diff --git a/.gitattributes b/.gitattributes index 187c157679490236dc2b4ef61c757d6d40303111..71e6abe8f61ca70dc7cf9b606e68fae741b03e87 100644 --- a/.gitattributes +++ b/.gitattributes @@ -1044,3 +1044,67 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text 2024/Human[[:space:]]Motion[[:space:]]Forecasting[[:space:]]in[[:space:]]Dynamic[[:space:]]Domain[[:space:]]Shifts_[[:space:]]A[[:space:]]Homeostatic[[:space:]]Continual[[:space:]]Test-time[[:space:]]Adaptation[[:space:]]Framework/4c7b6b92-219b-4e51-9f92-3709a3605254_origin.pdf filter=lfs diff=lfs merge=lfs -text 2024/Human[[:space:]]Pose[[:space:]]Recognition[[:space:]]via[[:space:]]Occlusion-Preserving[[:space:]]Abstract[[:space:]]Images/f38afc6e-f0b9-4acc-b848-43b4cb78f922_origin.pdf filter=lfs diff=lfs merge=lfs -text 2024/Human-in-the-Loop[[:space:]]Visual[[:space:]]Re-ID[[:space:]]for[[:space:]]Population[[:space:]]Size[[:space:]]Estimation/d7d4f862-073c-43ae-9cd1-0a15c0d7fcdf_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/HumanRefiner_[[:space:]]Benchmarking[[:space:]]Abnormal[[:space:]]Human[[:space:]]Generation[[:space:]]and[[:space:]]Refining[[:space:]]with[[:space:]]Coarse-to-fine[[:space:]]Pose-Reversible[[:space:]]Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/HyTAS_[[:space:]]A[[:space:]]Hyperspectral[[:space:]]Image[[:space:]]Transformer[[:space:]]Architecture[[:space:]]Search[[:space:]]Benchmark[[:space:]]and[[:space:]]Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Hybrid[[:space:]]Video[[:space:]]Diffusion[[:space:]]Models[[:space:]]with[[:space:]]2D[[:space:]]Triplane[[:space:]]and[[:space:]]3D[[:space:]]Wavelet[[:space:]]Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/HybridBooth_[[:space:]]Hybrid[[:space:]]Prompt[[:space:]]Inversion[[:space:]]for[[:space:]]Efficient[[:space:]]Subject-Driven[[:space:]]Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/HyperSpaceX_[[:space:]]Radial[[:space:]]and[[:space:]]Angular[[:space:]]Exploration[[:space:]]of[[:space:]]HyperSpherical[[:space:]]Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Hyperion[[:space:]]–[[:space:]]A[[:space:]]fast,[[:space:]]versatile[[:space:]]symbolic[[:space:]]Gaussian[[:space:]]Belief[[:space:]]Propagation[[:space:]]framework[[:space:]]for[[:space:]]Continuous-Time[[:space:]]SLAM/f4560473-9318-445b-99ca-e894e9617072_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Hypernetworks[[:space:]]for[[:space:]]Generalizable[[:space:]]BRDF[[:space:]]Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/I[[:space:]]Can't[[:space:]]Believe[[:space:]]It's[[:space:]]Not[[:space:]]Scene[[:space:]]Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/I-MedSAM_[[:space:]]Implicit[[:space:]]Medical[[:space:]]Image[[:space:]]Segmentation[[:space:]]with[[:space:]]Segment[[:space:]]Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/I2-SLAM_[[:space:]]Inverting[[:space:]]Imaging[[:space:]]Process[[:space:]]for[[:space:]]Robust[[:space:]]Photorealistic[[:space:]]Dense[[:space:]]SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IAM-VFI[[:space:]]_[[:space:]]Interpolate[[:space:]]Any[[:space:]]Motion[[:space:]]for[[:space:]]Video[[:space:]]Frame[[:space:]]Interpolation[[:space:]]with[[:space:]]motion[[:space:]]complexity[[:space:]]map/27484e78-4d3a-4c10-8bb6-c78efe457562_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IDOL_[[:space:]]Unified[[:space:]]Dual-Modal[[:space:]]Latent[[:space:]]Diffusion[[:space:]]for[[:space:]]Human-Centric[[:space:]]Joint[[:space:]]Video-Depth[[:space:]]Generation/936a163c-2a44-4375-899b-7f720c040bba_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IFTR_[[:space:]]An[[:space:]]Instance-Level[[:space:]]Fusion[[:space:]]Transformer[[:space:]]for[[:space:]]Visual[[:space:]]Collaborative[[:space:]]Perception/64d575fa-b556-4d63-89b7-604e93669af8_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IG[[:space:]]Captioner_[[:space:]]Information[[:space:]]Gain[[:space:]]Captioners[[:space:]]are[[:space:]]Strong[[:space:]]Zero-shot[[:space:]]Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IGNORE_[[:space:]]Information[[:space:]]Gap-based[[:space:]]False[[:space:]]Negative[[:space:]]Loss[[:space:]]Rejection[[:space:]]for[[:space:]]Single[[:space:]]Positive[[:space:]]Multi-Label[[:space:]]Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IMMA_[[:space:]]Immunizing[[:space:]]text-to-image[[:space:]]Models[[:space:]]against[[:space:]]Malicious[[:space:]]Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/INTRA_[[:space:]]Interaction[[:space:]]Relationship-aware[[:space:]]Weakly[[:space:]]Supervised[[:space:]]Affordance[[:space:]]Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IRGen_[[:space:]]Generative[[:space:]]Modeling[[:space:]]for[[:space:]]Image[[:space:]]Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IRSAM_[[:space:]]Advancing[[:space:]]Segment[[:space:]]Anything[[:space:]]Model[[:space:]]for[[:space:]]Infrared[[:space:]]Small[[:space:]]Target[[:space:]]Detection/1951067b-70fe-4b51-a641-6a218131792c_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/IVTP_[[:space:]]Instruction-guided[[:space:]]Visual[[:space:]]Token[[:space:]]Pruning[[:space:]]for[[:space:]]Large[[:space:]]Vision-Language[[:space:]]Models/dc23e47d-6ef5-417d-a382-d275c9d72743_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Idea2Img_[[:space:]]Iterative[[:space:]]Self-Refinement[[:space:]]with[[:space:]]GPT-4V[[:space:]]for[[:space:]]Automatic[[:space:]]Image[[:space:]]Design[[:space:]]and[[:space:]]Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Idempotent[[:space:]]Unsupervised[[:space:]]Representation[[:space:]]Learning[[:space:]]for[[:space:]]Skeleton-Based[[:space:]]Action[[:space:]]Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Identity-Consistent[[:space:]]Diffusion[[:space:]]Network[[:space:]]for[[:space:]]Grading[[:space:]]Knee[[:space:]]Osteoarthritis[[:space:]]Progression[[:space:]]in[[:space:]]Radiographic[[:space:]]Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Idling[[:space:]]Neurons,[[:space:]]Appropriately[[:space:]]Lenient[[:space:]]Workload[[:space:]]During[[:space:]]Fine-tuning[[:space:]]Leads[[:space:]]to[[:space:]]Better[[:space:]]Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Image[[:space:]]Compression[[:space:]]for[[:space:]]Machine[[:space:]]and[[:space:]]Human[[:space:]]Vision[[:space:]]With[[:space:]]Spatial-Frequency[[:space:]]Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Image[[:space:]]Demoireing[[:space:]]in[[:space:]]RAW[[:space:]]and[[:space:]]sRGB[[:space:]]Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Image[[:space:]]Manipulation[[:space:]]Detection[[:space:]]With[[:space:]]Implicit[[:space:]]Neural[[:space:]]Representation[[:space:]]and[[:space:]]Limited[[:space:]]Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Image-Feature[[:space:]]Weak-to-Strong[[:space:]]Consistency_[[:space:]]An[[:space:]]Enhanced[[:space:]]Paradigm[[:space:]]for[[:space:]]Semi-Supervised[[:space:]]Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Image-adaptive[[:space:]]3D[[:space:]]Lookup[[:space:]]Tables[[:space:]]for[[:space:]]Real-time[[:space:]]Image[[:space:]]Enhancement[[:space:]]with[[:space:]]Bilateral[[:space:]]Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Image-to-Lidar[[:space:]]Relational[[:space:]]Distillation[[:space:]]for[[:space:]]Autonomous[[:space:]]Driving[[:space:]]Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Images[[:space:]]are[[:space:]]Achilles'[[:space:]]Heel[[:space:]]of[[:space:]]Alignment_[[:space:]]Exploiting[[:space:]]Visual[[:space:]]Vulnerabilities[[:space:]]for[[:space:]]Jailbreaking[[:space:]]Multimodal[[:space:]]Large[[:space:]]Language[[:space:]]Models/3182182c-ff4e-403e-9da5-1c7cd2393327_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Imaging[[:space:]]Interiors_[[:space:]]An[[:space:]]Implicit[[:space:]]Solution[[:space:]]to[[:space:]]Electromagnetic[[:space:]]Inverse[[:space:]]Scattering[[:space:]]Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Imaging[[:space:]]with[[:space:]]Confidence_[[:space:]]Uncertainty[[:space:]]Quantification[[:space:]]for[[:space:]]High-dimensional[[:space:]]Undersampled[[:space:]]MR[[:space:]]Images/973eb161-b90b-4ebc-8ed6-123db5236604_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Implicit[[:space:]]Concept[[:space:]]Removal[[:space:]]of[[:space:]]Diffusion[[:space:]]Models/405c4f60-62f2-4cac-9886-d7a1411bef57_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Implicit[[:space:]]Filtering[[:space:]]for[[:space:]]Learning[[:space:]]Neural[[:space:]]Signed[[:space:]]Distance[[:space:]]Functions[[:space:]]from[[:space:]]3D[[:space:]]Point[[:space:]]Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Implicit[[:space:]]Neural[[:space:]]Models[[:space:]]to[[:space:]]Extract[[:space:]]Heart[[:space:]]Rate[[:space:]]from[[:space:]]Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Implicit[[:space:]]Steganography[[:space:]]Beyond[[:space:]]the[[:space:]]Constraints[[:space:]]of[[:space:]]Modality/19cd1b70-5002-4035-b78b-8110c5c75478_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Implicit[[:space:]]Style-Content[[:space:]]Separation[[:space:]]using[[:space:]]B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]2D[[:space:]]Feature[[:space:]]Representations[[:space:]]by[[:space:]]3D-Aware[[:space:]]Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]3D[[:space:]]Semi-supervised[[:space:]]Learning[[:space:]]by[[:space:]]Effectively[[:space:]]Utilizing[[:space:]]All[[:space:]]Unlabelled[[:space:]]Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Adversarial[[:space:]]Transferability[[:space:]]via[[:space:]]Model[[:space:]]Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Agent[[:space:]]Behaviors[[:space:]]with[[:space:]]RL[[:space:]]Fine-tuning[[:space:]]for[[:space:]]Autonomous[[:space:]]Driving/4493735f-e7ad-4f7b-b338-224421df7970_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Diffusion[[:space:]]Models[[:space:]]for[[:space:]]Authentic[[:space:]]Virtual[[:space:]]Try-on[[:space:]]in[[:space:]]the[[:space:]]Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Domain[[:space:]]Generalization[[:space:]]in[[:space:]]Self-Supervised[[:space:]]Monocular[[:space:]]Depth[[:space:]]Estimation[[:space:]]via[[:space:]]Stabilized[[:space:]]Adversarial[[:space:]]Training/735d10f0-6511-486f-ac2e-dcb725a3f997_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Feature[[:space:]]Stability[[:space:]]during[[:space:]]Upsampling[[:space:]]--[[:space:]]Spectral[[:space:]]Artifacts[[:space:]]and[[:space:]]the[[:space:]]Importance[[:space:]]of[[:space:]]Spatial[[:space:]]Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Geo-diversity[[:space:]]of[[:space:]]Generated[[:space:]]Images[[:space:]]with[[:space:]]Contextualized[[:space:]]Vendi[[:space:]]Score[[:space:]]Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Hyperbolic[[:space:]]Representations[[:space:]]via[[:space:]]Gromov-Wasserstein[[:space:]]Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Intervention[[:space:]]Efficacy[[:space:]]via[[:space:]]Concept[[:space:]]Realignment[[:space:]]in[[:space:]]Concept[[:space:]]Bottleneck[[:space:]]Models/b87f9961-1363-42af-af3c-357c0eb68823_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Knowledge[[:space:]]Distillation[[:space:]]via[[:space:]]Regularizing[[:space:]]Feature[[:space:]]Direction[[:space:]]and[[:space:]]Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Medical[[:space:]]Multi-modal[[:space:]]Contrastive[[:space:]]Learning[[:space:]]with[[:space:]]Expert[[:space:]]Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Neural[[:space:]]Surface[[:space:]]Reconstruction[[:space:]]with[[:space:]]Feature[[:space:]]Priors[[:space:]]from[[:space:]]Multi-View[[:space:]]Images/ac44814b-3daa-415a-bab2-3a060356d9f3_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Point-based[[:space:]]Crowd[[:space:]]Counting[[:space:]]and[[:space:]]Localization[[:space:]]Based[[:space:]]on[[:space:]]Auxiliary[[:space:]]Point[[:space:]]Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Robustness[[:space:]]to[[:space:]]Model[[:space:]]Inversion[[:space:]]Attacks[[:space:]]via[[:space:]]Sparse[[:space:]]Coding[[:space:]]Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Text-guided[[:space:]]Object[[:space:]]Inpainting[[:space:]]with[[:space:]]Semantic[[:space:]]Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Unsupervised[[:space:]]Domain[[:space:]]Adaptation_[[:space:]]A[[:space:]]Pseudo-Candidate[[:space:]]Set[[:space:]]Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Video[[:space:]]Segmentation[[:space:]]via[[:space:]]Dynamic[[:space:]]Anchor[[:space:]]Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Virtual[[:space:]]Try-On[[:space:]]with[[:space:]]Garment-focused[[:space:]]Diffusion[[:space:]]Models/763136ac-f113-4838-b176-ba0b1b53b539_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Vision[[:space:]]and[[:space:]]Language[[:space:]]Concepts[[:space:]]Understanding[[:space:]]with[[:space:]]Multimodal[[:space:]]Counterfactual[[:space:]]Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Zero-Shot[[:space:]]Generalization[[:space:]]for[[:space:]]CLIP[[:space:]]with[[:space:]]Variational[[:space:]]Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]Zero-shot[[:space:]]Generalization[[:space:]]of[[:space:]]Learned[[:space:]]Prompts[[:space:]]via[[:space:]]Unsupervised[[:space:]]Knowledge[[:space:]]Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Improving[[:space:]]image[[:space:]]synthesis[[:space:]]with[[:space:]]diffusion-negative[[:space:]]sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/In[[:space:]]Defense[[:space:]]of[[:space:]]Lazy[[:space:]]Visual[[:space:]]Grounding[[:space:]]for[[:space:]]Open-Vocabulary[[:space:]]Semantic[[:space:]]Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/Inf-DiT_[[:space:]]Upsampling[[:space:]]any-resolution[[:space:]]image[[:space:]]with[[:space:]]memory-efficient[[:space:]]diffusion[[:space:]]transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_origin.pdf filter=lfs diff=lfs merge=lfs -text +2024/InfMAE_[[:space:]]A[[:space:]]Foundation[[:space:]]Model[[:space:]]in[[:space:]]The[[:space:]]Infrared[[:space:]]Modality/27243eca-1887-4c8e-8b92-89b601b015c1_origin.pdf filter=lfs diff=lfs merge=lfs -text diff --git a/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_content_list.json b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..656d118b30a2ae38d198d2da9e6895c719190544 --- /dev/null +++ b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_content_list.json @@ -0,0 +1,1896 @@ +[ + { + "type": "text", + "text": "HumanRefiner: Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance", + "text_level": 1, + "bbox": [ + 222, + 140, + 782, + 205 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Guian Fang $^{1,\\star}$ , Wenbiao Yan $^{4,*}$ , Yuanfan Guo $^{3,*}$ , Jianhua Han $^{3}$ , Zutao Jiang $^{2}$ , Hang Xu $^{3}$ , Shengcai Liao $^{5}$ , and Xiaodan Liang $^{1,2,\\star\\star}$", + "bbox": [ + 238, + 234, + 763, + 266 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Shenzhen campus of Sun Yat-sen University", + "bbox": [ + 344, + 277, + 655, + 291 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Mohamed bin Zayed University of Artificial Intelligence", + "bbox": [ + 308, + 291, + 692, + 305 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Huawei Noah's Ark Lab", + "bbox": [ + 426, + 305, + 589, + 316 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{4}$ Xi'an Jiaotong University", + "bbox": [ + 408, + 318, + 594, + 332 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "5 United Arab Emirates University", + "bbox": [ + 382, + 332, + 620, + 345 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Text-to-image diffusion models have significantly advanced in conditional image generation. However, these models usually struggle with accurately rendering images featuring humans, resulting in distorted limbs and other anomalies. This issue primarily stems from the insufficient recognition and evaluation of limb qualities in diffusion models. To address this issue, we introduce AbHuman, the first large-scale synthesized human benchmark focusing on anatomical anomalies. This benchmark consists of 56K synthesized human images, each annotated with detailed, bounding-box level labels identifying 147K human anomalies in 18 different categories. Based on this, the recognition of human anomalies can be established, which in turn enhances image generation through traditional techniques such as negative prompting and guidance. To further boost the improvement, we propose HumanRefiner, a novel plug-and-play approach for the coarse-to-fine refinement of human anomalies in text-to-image generation. Specifically, HumanRefiner utilizes a self-diagnostic procedure to detect and correct issues related to both coarse-grained abnormal human poses and fine-grained anomaly levels, facilitating pose-reversible diffusion generation. Experimental results on the AbHuman benchmark demonstrate that HumanRefiner significantly reduces generative discrepancies, achieving a $2.9\\mathrm{x}$ improvement in limb quality compared to the state-of-the-art open-source generator SDXL and a $1.4\\mathrm{x}$ improvement over DALL-E 3 in human evaluations. Our AbHuman dataset is available at https://github.com/Enderfga/HumanRefiner.", + "bbox": [ + 259, + 366, + 743, + 684 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Text-to-Image Diffusion Model $\\cdot$ Abnormal Human Dataset $\\cdot$ Human Anomalies Refinement", + "bbox": [ + 261, + 696, + 740, + 724 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 746, + 375, + 762 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recent developments in text-to-image diffusion models, as exemplified by SDXL [31], DALL-E 2 [34], and DeepFloyd [31,34,44], have marked significant breakthroughs", + "bbox": [ + 212, + 773, + 807, + 805 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Equal Contribution.", + "bbox": [ + 217, + 811, + 370, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "\\*\\* Corresponding author.", + "bbox": [ + 215, + 825, + 383, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "in the generation of high-quality images. These models, benefiting from large-scale pre-training, are capable of generating images for various objects.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, generating complex and flexible structures, such as the human body, poses significant challenges for current text-to-image models. As illustrated in Figure 1, common issues with these models include the generation of multiple limbs or abnormal limb details (e.g., irregular fingers). These challenges arise because training focuses on overall characteristics, not detailed ones like the number of fingers or hands. Consequently, models have limited control over the fine-grained generation of detailed body parts and lack the knowledge to distinguish between normal and abnormal human body characteristics. Though such knowledge could be introduced by extra pose condition as indicated in HumanSD [18], Pose-ControlNet [47], T2I-Adapter [27], these models are hard to use because of the requirement of providing extra input.", + "bbox": [ + 212, + 176, + 785, + 343 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Incorrect hand counts Twisted hands Incorrect Limb Position Incorrect leg counts Abnormal hands", + "bbox": [ + 225, + 359, + 751, + 372 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/c49a7f4fb023159fea3ad5f7a6784ce3e0cb5ee0cfbe0c7e482430e5e6bf341c.jpg", + "image_caption": [ + "A beautiful ballet dancer is practicing A man doing a trick on a loop" + ], + "image_footnote": [], + "bbox": [ + 235, + 373, + 370, + 474 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/2701c2a97841ecab1d8a717fd89a7b7ae8d1aa80d7d4aff35b89c6318f85a75e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 372, + 373, + 504, + 474 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/63073063f3a569aa823704988de094fee76e799a558c83fd4dae863274153e48.jpg", + "image_caption": [ + "A male dancer in a black outfit" + ], + "image_footnote": [], + "bbox": [ + 506, + 373, + 640, + 474 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/174bc9b616db7792fb1a9bf185a887f2f7d96239352e5904ed14fac00b75b1c6.jpg", + "image_caption": [ + "A boy is jumping high" + ], + "image_footnote": [], + "bbox": [ + 642, + 373, + 777, + 474 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/6eb2e800c8eda46316e73c919d502a81788f4924e5e355a3d698192cf17214d9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 235, + 502, + 370, + 604 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/dbb9e277fadd8021cda30442d22d8846d8047ddf71d63b760d2eca59c4c9b79e.jpg", + "image_caption": [ + "(a) Human images generated by SDXL", + "(b) HumanRefiner (ours), based on SDXL" + ], + "image_footnote": [], + "bbox": [ + 372, + 502, + 504, + 604 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/4050416c1b35c257415c48ef584db977ba94389170888b26dd96ffd5564be644.jpg", + "image_caption": [ + "Fig.1: The synthesis of human images by SOTA text-to-image diffusion model SDXL [31] still presents incorrect limb counts, twisted hands, and incorrect limb position problems. We propose HumanRefiner, a coarse-to-fine self-diagnosis pose/anomaly-reversible generation pipeline built on the AbHuman benchmark to eliminate the anomalies." + ], + "image_footnote": [], + "bbox": [ + 506, + 502, + 640, + 604 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/5907d986974714d4a1ecc6e09da05f41ade3efd064767c6526ef06652aa1fcbf.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 642, + 502, + 777, + 604 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Therefore, this paper focuses on enhancing the text-to-image diffusion model's understanding of human anomalies and leveraging this knowledge to drive models for generating accurate and realistic human bodies. To address the above challenges, we introduce the first large-scale synthesized human benchmark for anatomical anomalies, named AbHuman. This benchmark comprises 56K synthesized human images, each meticulously annotated with detailed, bounding-box level labels that mark 147K instances of human limbs. Instead of a single \"abnormal body\" category, these anomalies are categorized into 18 distinct finer", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "groups, such as \"abnormal/normal head\", \"abnormal/normal hand\", \"abnormal/normal foot\", etc.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "With the proposed benchmark, it could be directly employed to provide knowledge about human anomalies by abnormal captions derived from the annotation, which can then be integrated into the diffusion model through the conventional negative prompting technique. Another possible way is to develop an Abnormal Scorer, which provides feedback on generated images to distinguish normal/abnormal images. Such a scorer enables quantitative assessment of anomalies in generated images and could provide guidance on anomalies for the text-to-image diffusion process.", + "bbox": [ + 212, + 176, + 785, + 297 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "However, these conventional approaches from our AbHuman benchmark do not fully leverage the detailed information available from bounding box-level annotations of human limb anomalies. Therefore, we propose HumanRefiner, a novel and adaptable method for addressing human anomalies that can be integrated with any text-to-image generation model. HumanRefiner goes beyond the typical abnormal guidance and negative prompting by implementing a coarse-to-fine, pose-reversible diffusion generation process. This includes a pose-guided generation for global refinement and anomaly detector-guided inpainting for fine-grained refinement. The detailed anomalies are identified using an abnormal detector train on AbHuman. Experimental results on the benchmark illustrate that HumanRefiner markedly reduces generative discrepancies, achieving a $2.9\\times$ improvement in limb quality compared to leading open-source generator SDXL and a $1.4\\times$ improvement over DALL-E 3 in human evaluations. In summary, our contributions are threefold:", + "bbox": [ + 212, + 299, + 787, + 508 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Introduction of AbHuman, the first large-scale benchmark of synthesized humans with anatomical anomalies, which encompasses 56K images, each annotated with detailed, bounding-box level human anomaly labels.", + "- We propose HumanRefiner, a novel plug-and-play approach for coarse-to-fine refinement of human anomalies via pose-reversible guidance.", + "- Comprehensive experimental results show that HumanRefiner significantly reduces generative discrepancies compared to SOTA text-to-image models. Human evaluation results indicate a $2.9 \\times$ preference for our HumanRefiner in generating high-quality human images compared to SDXL and a $1.4 \\times$ preference over DALL-E 3." + ], + "bbox": [ + 223, + 522, + 782, + 671 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 700, + 387, + 715 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Text-to-Image/Human Generation", + "text_level": 1, + "bbox": [ + 214, + 736, + 545, + 751 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Text-To-Image Generation. The goal of text-to-image synthesis is to generate realistic images based on given descriptions. Fueled by large-scale image-text datasets [4, 42], various training and inference techniques [12, 13, 45], and advancements in scalability [34], text-to-image models have made significant progress. Existing text-to-image models can be broadly categorized into three", + "bbox": [ + 212, + 763, + 785, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 633, + 114, + 730, + 127 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "main approaches: those utilizing diffusion models [2, 11, 29, 34, 37-39], autoregressive models [7, 35, 46], and generative adversarial models [19, 40, 49]. The latest models, such as DALL-E 3 [30], and SDXL [31], have shown substantial improvements in image generation quality. However, the challenge of generating human-like images from text remains difficult due to the diversity of human body poses and insufficient alignment between image and text. Our work focuses on improving the quality of generated human images.", + "bbox": [ + 212, + 146, + 782, + 251 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Text-To-Human Generation. Numerous models have made considerable efforts to enhance the generation quality of realistic human images. They have discovered that injecting additional conditions into diffusion models provides better guidance for human image generation. Models such as [15,27,47] have incorporated additional training modules, introducing human pose conditions to finely control the generation of human images. Additionally, [21] has the capability not only to introduce key points but also to incorporate bounding box detection data. Building upon the introduction of additional poses, [18] has implemented a strategy involving heatmap alignment to achieve higher-quality human images.", + "bbox": [ + 212, + 252, + 784, + 387 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "However, existing works dedicated to human generation face two main challenges: (1) the introduction of poses significantly restricts the diversity of generated human poses, and (2) pose conditions still exhibit limitations in addressing fine-grained details of human body parts, such as hands, feet, and facial features.", + "bbox": [ + 212, + 388, + 784, + 446 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Differing from this line of research, HumanRefiner is designed to address the issue of human generation without the requirement of human-provided pose conditions.", + "bbox": [ + 212, + 449, + 785, + 492 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Human Generation Datasets.", + "text_level": 1, + "bbox": [ + 215, + 513, + 501, + 527 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Currently, human datasets primarily consist of two types. The first focuses on authentic depictions of individuals in natural settings, such as human photos and images from human video data [1,6,8,20,22,28,42,50]. These widely available datasets offer abundant human-pose pairs, with annotations limited to key points or bounding boxes. Given that these data are derived from real photos, the humans depicted are inherently natural, without limb anomalies. The second category involves artificial scenes featuring human-like figures in settings such as paintings, cartoons, and similar environments. The Human-Art dataset [17] provides 50,000 images centered around humans, encompassing five natural scenes and fifteen artificial scenes, accompanied by precise pose and text annotations. None of these datasets provide large-scale synthesized images or potential limb abnormal annotations.", + "bbox": [ + 212, + 537, + 784, + 717 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To address the challenge of limb anomalies in the text-driven human image generation task, we have developed a novel AbHuman dataset as a component of this research effort. This dataset serves as a valuable resource for effectively handling limb abnormalities within the context of generating human images from textual descriptions.", + "bbox": [ + 212, + 719, + 784, + 794 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We provide a large-scale dataset of abnormal human images called AbHuman. Firstly, this is the first dataset to focus on limb abnormalities, as existing text-to-human algorithms are primarily based on the MS-COCO [22] and", + "bbox": [ + 212, + 794, + 784, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "LAION-5B [42] datasets. Notably, models trained on real images often face challenges in accurately generating limb abnormalities in humans. To address this issue in general human image generation scenarios, we constructed a new benchmark. Secondly, this dataset collects a significant number of failure cases based on existing generative models. We observed that existing AI-generated human images often feature limb abnormalities, which we filtered, annotated, and analyzed. With the guidance of this dataset, the quality of generative models has been greatly improved.", + "bbox": [ + 212, + 146, + 787, + 268 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.3 Data Collection", + "text_level": 1, + "bbox": [ + 214, + 287, + 392, + 301 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We designed a standardized pipeline for abnormal human limb image collection, including prompt collection, image generation, and abnormal annotation, as shown in Fig. 2.", + "bbox": [ + 212, + 310, + 782, + 356 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/383b94511e62f6e01d253c834e0a9af01ff44e2ed4ecb4121da3b5be962c7594.jpg", + "image_caption": [ + "Fig. 2: Data generation pipeline of our AbHuman dataset." + ], + "image_footnote": [], + "bbox": [ + 222, + 372, + 781, + 473 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 The AbHuman Dataset", + "text_level": 1, + "bbox": [ + 214, + 540, + 478, + 556 + ], + "page_idx": 4 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Prompt Collection: Our prompts are derived from three sources: textual descriptions related to humans in the Laion-5B [42], textual descriptions from the Human-Art dataset [17], and prompts generated using ChatGPT 3.5 [3]. To extract text-generating human-related content from the Laion dataset, We used keyword filtering to extract human-related content from the Laion dataset, resulting in 100,000 high-quality textual prompts. Subsequently, we utilized the collected textual content as the foundation of our dataset.", + "- Image Generation: With the rapid advancements in text-to-image models, the quality of human image generation has significantly improved. However, even state-of-the-art generation models like SDXL [32], Midjourney, and DALL-E 3 [30] encounter issues with limb abnormalities when generating human images. To enhance the quality of human generation using the best existing generation models as a baseline, we employed the SDXL model for generating our images.", + "- Abnormal Annotation: After collecting a large number of images, a comparative analysis revealed the presence of non-human images within the dataset. Initially, we applied a ResNet50-based classifier to filter all images labeled as \"person\".After removing low-quality images, trained human" + ], + "bbox": [ + 223, + 569, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 633, + 114, + 730, + 127 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "annotators annotated the remaining 56,000 images. Two human evaluators reviewed the dataset, resulting in a curated AbHuman dataset with 56,000 images and 147,000 annotations. Details of the annotated categories are provided in the appendix.", + "bbox": [ + 240, + 146, + 785, + 205 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "- Data Split: The dataset is partitioned into training and testing splits in 4:1, with 52k and 13k image-text pairs, respectively. We further develop a testing split for human evaluation, where prompts are from HumanArt [17], each describing humans performing difficult actions such as acrobatics, dancing, and drama.", + "bbox": [ + 225, + 207, + 785, + 282 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As illustrated in Figure 3, the AbHuman dataset provides bounding boxes and classification information for abnormal humans. Unlike existing keypoint-based annotation methods, the bounding box annotation enables the identification of both the location and type of anomalies in limbs. By detecting and inpainting anomalies in human limbs, our dataset is more conducive to improving generation algorithms.", + "bbox": [ + 212, + 295, + 782, + 387 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/6bea1cfa3b423f2d5fd11b675ef720d79426a02a168a635b3fba0b76e20c666c.jpg", + "image_caption": [ + "Fig. 3: The visualization of limb detection in the test set using the fine-tuned AbHuman detection model. Red boxes and labels are used to annotate the abnormal limbs detected, and white boxes and labels are used to annotate the normal limbs detected." + ], + "image_footnote": [], + "bbox": [ + 217, + 405, + 785, + 583 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Dataset Statistics and Analysis", + "text_level": 1, + "bbox": [ + 215, + 676, + 517, + 694 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "After reviewing a large number of generated samples, we conducted an analysis of human abnormalities and identified 18 distinct detection classes (e.g., Normal human, Abnormal Head, Abnormal Neck, Abnormal Body, Abnormal Arm, Abnormal Hand...). To illustrate the class distribution of anomalous human samples generated by the SDXL model, we performed a statistical analysis of both anomalous humans and their corresponding annotations. As depicted in Figure 4, the model predominantly generates images with anomalous hands, aligning with the highest count of annotations for hand anomalies. Thus, it is evident that hand anomalies remain a challenge for text-to-image models. Additionally,", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "the number of samples with anomalies in the head and foot regions is relatively higher compared to other parts of the human body.", + "bbox": [ + 214, + 146, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/dc0a7ce3d17cdc7b27d5e3e8647c85a8daa7a705123a017ea1634b4f76ad710c.jpg", + "image_caption": [ + "Fig. 5: Visualization of abnormal scores. red indicates images with high abnormal scores while green indicates images with low abnormal scores." + ], + "image_footnote": [], + "bbox": [ + 228, + 229, + 493, + 339 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/e4c1f6eb8176493109ae410994439485c30e18124668be8dffb404bc5cb5cd77.jpg", + "image_caption": [ + "Fig. 4: Ab-human annotations statistics." + ], + "image_footnote": [], + "bbox": [ + 500, + 202, + 787, + 327 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Table 1 illustrates a comparison of datasets concerning human images. Compared to other human datasets [1, 16, 17, 20, 25, 28] that solely annotate images of authentic and normal individuals, existing datasets have limited annotations for genuinely abnormal human limbs. On the contrary, the AbHuman dataset introduces anomalies in human-generated images and provides ample annotations for anomalous body postures. In the context of human-focused tasks such as generation and detection, AbHuman proves to be more suitable. Additionally, compared to datasets with relatively monotonous scenes, AbHuman encompasses a more diverse range of scenarios, enhancing its applicability in various contexts.", + "bbox": [ + 212, + 412, + 787, + 550 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/6e00c73bea04493f0acd616d423eba944c08c0f1f711e954d3d7d8f2160b7c41.jpg", + "table_caption": [ + "Table 1: Comparison of human-centric datasets, including human generation and detection tasks. AbHuman provides more granular annotation boxes and information to address the abnormality issues in the human generation." + ], + "table_footnote": [], + "table_body": "
DatasetImagesBboxNormalAbnormal-LimbGeneral
BodyHands [28]20K✓✓✗✗
CrowdPose [20]20K✓✓✗✗
Multi-Person PoseTrack [16]23K✓✓✗✗
PoseTrack [1]23K✓✓✗✗
ClassArch [25]1.5K✓✓✗✗
Human-Art [17]50K✓✓✗✓
AbHuman (Ours)56K✓✓✓✓
", + "bbox": [ + 279, + 623, + 718, + 728 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 Abnormal Scorer", + "text_level": 1, + "bbox": [ + 215, + 768, + 406, + 782 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As indicated, the lack of a metric measuring the generated limb quality makes it difficult to (1) quantitatively compare different models; and (2) develop generators for the improvement of limb quality. Based on the proposed AbHuman", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 633, + 114, + 730, + 127 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Dataset, we present a quantitative metric of limb anomalies in a generated or real human image. To this end, inspired by the aesthetic scorer based on the Laion dataset [41], we train an Abnormal Scorer $S_{\\theta}(\\cdot)$ . For the model structure of Abnormal Scorer $S_{\\theta}(\\cdot)$ , we adhere to the architecture utilized by Aesthetic Scorer [41]. Building upon a pretrained CLIP ViT-Large with patch size of 14 [33] with a hidden dimension of 768, a Multi-Layer Perceptron (MLP) is constructed, as depicted in Table 2.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/ecb11919fad2f1b4a4708eb707f3542827d70c7e2632acb5aa45d859a752922f.jpg", + "table_caption": [ + "Table 2: Model architecture of MLP part of our abnormal scorer. Linear(A, B) means a linear layer with an input feature dimension of A and an output feature dimension of B. Dropout $(\\alpha)$ means a dropout layer with the probability of $\\alpha$ ." + ], + "table_footnote": [], + "table_body": "
Layer index0123
LayerLinear (768, 1024)Dropout (0.2)Linear (1024, 128)Dropout (0.2)
Layer index4567
LayerLinear (128, 64)Dropout (0.1)Linear (64, 16)Linear (16, 1)
", + "bbox": [ + 267, + 333, + 730, + 386 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Given an image $x \\in \\mathcal{R}^{3 \\times H \\times W}$ , the Abnormal Scorer assigns a score $S_{\\theta}(x) \\in [0,1]$ reflecting the severity of limb aberrations or distortions. Specifically, this model is architecturally based on a Multi-Layer Perceptron (MLP) and is built upon the foundation of the pre-trained CLIP Vision Transformer Large (ViT-L) model [33]. As illustrated in Figure 5, high-scoring images are characterized by pronounced limb distortions or the absence of limbs, whereas images with lower scores correspond to either normal human depictions or non-human subjects.", + "bbox": [ + 212, + 414, + 787, + 521 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Abnormal Detector", + "text_level": 1, + "bbox": [ + 214, + 544, + 423, + 558 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To locate and detect abnormal limbs in human images for subsequent fine-grained refinement, we developed an abnormal limb detector. Specifically, we fine-tuned YOLOv8 [36] and RT-DETR [24] on the training set of AbHuman for 100 epochs. Subsequently, we conduct corresponding detections on the test set, obtaining consistently stable results in the detection of abnormal limbs. Visualization results are provided in Figure 3, showing the capability of identifying abnormal/normal regions and corresponding categories.", + "bbox": [ + 212, + 570, + 787, + 676 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 HumanRefiner", + "text_level": 1, + "bbox": [ + 214, + 700, + 395, + 717 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Based on the trained detector as illustrated in sec 3.3, we can develop a flexible human image synthesis and refinement mechanism, HumanRefiner, which can be integrated into any pipeline for human image generation. As shown in Figure 6, in addition to the basic improvement on generation gained from negative prompting learned from Abnormal Guidance, HumanRefiner performs a coarse-to-fine pose-reversible refinement based on the initially generated images. An off-the-shelf pose detector [6] is employed to inject pose guidance into the", + "bbox": [ + 212, + 733, + 787, + 842 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "text-to-image diffusion model, which serves as conditions for coarse refinement of the initial generated image. Then, the Abnormal Detector identifies abnormals that are further rectified through an inpainting diffusion model, refining the remained abnormals at a fine-grained level.", + "bbox": [ + 212, + 146, + 787, + 205 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/992567458f099979b73106a701d6781e6b26a68e241dabc2d0f4b48d047185e3.jpg", + "image_caption": [ + "Fig.6: Overview of our HumanRefiner pipeline empowered by the proposed AbHuman benchmark. It consists of a Text-to-Image Diffusion Model trained with negative prompts on the AbHuman benchmark, which generates an initial human image with guidance from Abnormal Scorer, a Coarse-to-Fine Refinement Process where the generated image is globally refined by pose-guided generation and locally refined by detector-guided inpainting. For both the Pose-T2I Adapter [27] and the Inpainting Diffusion models, the Stable Diffusion parameters are adopted from the Text-to-Image model, which was refined through training in the Abnormal Guidance Stage." + ], + "image_footnote": [], + "bbox": [ + 220, + 232, + 787, + 378 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The following sections demonstrate the basic control of human generation from negative prompting and abnormal guidance, followed by the coarse refinement module of pose-guided generation and the fine-grained refinement module of detector-guided inpainting.", + "bbox": [ + 212, + 508, + 787, + 571 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Negative Prompts", + "text_level": 1, + "bbox": [ + 215, + 590, + 413, + 606 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The diffusion model is designed to generate data through a sequence of denoising autoencoders. The Latent Diffusion Model (LDM) [37] conducts the diffusion process with a VAE encoder $\\mathcal{E}$ and decoder $\\mathcal{D}$ . Given an image $x$ , the forward diffusion process incrementally adds Gaussian noise $\\epsilon$ to the latent $z_0 = \\mathcal{E}(x)$ following a T-step noise schedule $\\{\\alpha_t\\}_{t=1}^T$ to produce a noisy latent $z_t$ where the noise level increases over timesteps $t$ :", + "bbox": [ + 212, + 614, + 787, + 705 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\nz _ {t} = \\sqrt {1 - \\overline {{\\alpha}} _ {t}} z _ {0} + \\sqrt {\\overline {{\\alpha}} _ {t}} \\epsilon , \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 413, + 714, + 785, + 733 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\epsilon \\sim \\mathcal{N}(0,I)$ and $\\overline{\\alpha}_t = \\prod_{i=1}^t \\alpha_i$ . A text-to-image diffusion model learns a noise predictor $\\epsilon_\\theta(z_t, t, y)$ conditioned on text $y$ with the objective:", + "bbox": [ + 212, + 741, + 785, + 773 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\nL = \\mathbb {E} _ {\\mathcal {E} (x), y, \\epsilon \\sim \\mathcal {N} (0, 1), t} [ | | \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, y) | | _ {2} ^ {2} ]. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 354, + 782, + 785, + 800 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The text condition $y$ ensures that the model's denoising is conditioned and controlled. Consequently, based on our AbHuman Benchmark, we can train the", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 633, + 114, + 730, + 127 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Latent Diffusion Model with the abnormal text conditions $y_{a}$ (e.g., Ab. Hand, Ab. Feet...), making the model aware of the abnormal limb information. During the generation process, Classifier-Free Guidance [14] could be applied by using the abnormal text as a negative prompt to eliminate the generation of abnormal limbs:", + "bbox": [ + 212, + 146, + 782, + 219 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} _ {\\theta} (z _ {t}, t, y) = \\epsilon_ {\\theta} (z _ {t}, t, y _ {a}) + s \\cdot (\\epsilon_ {\\theta} (z _ {t}, t, y) - \\epsilon_ {\\theta} (z _ {t}, t, y _ {a})), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 307, + 224, + 785, + 239 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "where $s$ is a scaling factor that modulates the influence of the condition.", + "bbox": [ + 215, + 247, + 735, + 261 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Abnormal Guidance", + "text_level": 1, + "bbox": [ + 215, + 286, + 429, + 300 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In addition to adding information on human abnormals through negative prompting, we can introduce a general form of guidance to improve control over the denoising process. As shown in section 3.2, the Abnormal Scorer $S_{\\phi}(x)$ gives a score to an image that measures the severity of limb abnormals. This scorer can provide further guidance using a general Classifier Guidance [10]. Specifically, since $\\epsilon_{\\theta}(z_t,t,y)$ predicts the added noise, we can estimate the clean latent variable $z_0$ by:", + "bbox": [ + 212, + 313, + 784, + 417 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {z} _ {0} = \\frac {z _ {t} - \\sqrt {\\overline {{\\alpha}} _ {t}} \\epsilon_ {\\theta} (z _ {t} , t , y)}{\\sqrt {1 - \\overline {{\\alpha}} _ {t}}}. \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 413, + 420, + 785, + 452 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "After this, we can calculate an estimated abnormal score with $S_{\\phi}(\\mathcal{D}(\\hat{z}_0))$ . Consequently, the noise prediction guided by this method is:", + "bbox": [ + 214, + 458, + 782, + 489 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\ddot {\\epsilon} _ {\\theta} \\left(z _ {t}, t, y\\right) = \\epsilon \\left(z _ {t}, t, y\\right) + \\mu \\cdot \\nabla S _ {\\phi} \\left(\\mathcal {D} \\left(\\hat {z} _ {0}\\right)\\right). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 359, + 503, + 784, + 518 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We can combine classifier-free guidance through negative prompting with abnormal guidance easily by:", + "bbox": [ + 214, + 531, + 782, + 560 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\hat {\\epsilon} _ {t} = \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right) + s \\cdot \\left(\\epsilon_ {\\theta} \\left(z _ {t}, t, y\\right) - \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right)\\right) \\tag {6} \\\\ + \\mu \\cdot \\nabla S _ {\\phi} (\\mathcal {D} (\\hat {z} _ {0})). \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 339, + 574, + 784, + 607 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.3 Coarse-to-fine Pose-reversible Guidance", + "text_level": 1, + "bbox": [ + 215, + 631, + 588, + 645 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In contrast to unguided approaches, our HumanRefiner now yields human images with more accurate poses initially. To further enhance the generation quality, we refine the generated image with pose-reversible guidance at both coarse and fine-grained levels.", + "bbox": [ + 212, + 657, + 782, + 717 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Pose-Guided Coarse Refine The abnormal guided text-to-image diffusion model could be combined with off-the-shelf pose detector [6] and T2I-Adapter [27] to further inject global human pose information for pose-guided refinement. For an initially generated image $\\hat{x}$ from a guided text-to-image diffusion model, a pose keypoint map $M$ could be detected by a pose detector $M = P_{\\psi}(\\hat{x})$ . The pose-guided generation could be expanded from the text-to-image diffusion model with T2I-Adapter [27] by injecting the pose condition information into intermediate encoder features:", + "bbox": [ + 212, + 719, + 784, + 838 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\nF _ {c} = \\mathcal {F} _ {A D} (M), \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 447, + 162, + 784, + 176 + ], + "page_idx": 10 + }, + { + "type": "equation", + "text": "\n$$\nF _ {e n c} = F _ {e n c} + F _ {c}, \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 437, + 181, + 784, + 195 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "where $\\mathcal{F}_{AD}$ is T2I-Adapter and $F_{enc}$ is the intermediate feature of the encoder part of $\\epsilon_{\\theta}(\\cdot)$ . Forming the pose conditioned denoising as $\\epsilon_{\\theta}(z_t,t,y,\\mathcal{F}_{AD}(M))$ , the advantage of abnormal guidance and negative prompts could also be integrated as:", + "bbox": [ + 212, + 202, + 782, + 260 + ], + "page_idx": 10 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\hat {\\epsilon} _ {t} = \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right) + s \\cdot \\left(\\epsilon_ {\\theta} \\left(z _ {t}, t, y, \\mathcal {F} _ {A D} (M)\\right) - \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right)\\right) \\tag {9} \\\\ + \\mu \\cdot \\nabla S _ {\\phi} (\\mathcal {D} (\\hat {z _ {0}})). \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 303, + 272, + 784, + 306 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Detector-Guided Inpainting Refine The pose-guided generation refines the initial image in a global view, performing a coarse refinement. Besides, a fine-grained refinement could be established with our abnormal detector providing region-level abnormal information.", + "bbox": [ + 212, + 318, + 782, + 377 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Specifically, for a refined image by applying diffusion denoise process in Eq. (9), $x_{r} = \\mathcal{D}(\\hat{z}_{0})$ , abnormal detector $D_{Ab}(\\cdot)$ outputs a set of $K$ bounding boxes and corresponding categories $\\{B_i,C_i\\}_{i = 1}^K = D_{Ab}(x_r)$ , where $B_{i} = \\{x_{i},y_{i},w_{i},h_{i}\\}$ denotes the detected regions, $C_i\\in \\{0,\\dots 17\\}$ denoting the detected categories defined in sec 3.1. For detected abnormal classes, the local region $B_{i}$ is inpainted with an input text conditioned on abnormal category $\\hat{y} (C_i)$ . The local region in the original image is then pasted by the inpainted output.", + "bbox": [ + 212, + 378, + 784, + 484 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 215, + 507, + 375, + 525 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.1 Implementation Details", + "text_level": 1, + "bbox": [ + 215, + 540, + 455, + 555 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Negative Prompt Fine-tuning: we finetune SDXL [31] released checkpoint at a resolution of $1024 \\times 1024$ for 10 epochs with the learning rate of $1.0\\mathrm{e} - 5$ on the training split, with a batch size of 32 in total. The images are paired with the original text description followed by abnormal captions (e.g. Ab(hand, Ab.leg). More details can be found in the appendix.", + "bbox": [ + 212, + 565, + 782, + 642 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.2 Quantitative Experiments", + "text_level": 1, + "bbox": [ + 215, + 662, + 475, + 679 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Evaluation Setup We present quantitative comparison with baseline methods including SOTA text-to-image diffusion models SDXL [31], DeepFlyod-IF [44], LCM [23]. For methods require extra pose condition inputs such as HumanSD [18]. Pose-ControlNet [47] and Pose-T2I-Adapter [27], we first generate an initial image from SDXL [31], then generate pose condition from it with pose detector [5], which operates similarly to our pose-guided generation. Test prompts are provided from the AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt). We quantitatively evaluate the generated images with Abnormal Score, CLIP score and FID, respectively. Abnormal Score measures the severity of anomalies.", + "bbox": [ + 212, + 689, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 632, + 114, + 730, + 127 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Results As indicated in Table 3, HumanRefiner consistently achieves the best performance in terms of Abnormal score, FID, and CLIP score. Furthermore, when compared to Pose-ControlNet [47] and Pose-T2I-Adapter [27] applied on SDXL, HumanRefiner demonstrates a significant improvement, indicating the effectiveness of HumanRefiner on integrating off-the-shelf methods such as pose detectors and T2I-adapter [27].", + "bbox": [ + 212, + 146, + 787, + 238 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/aa0d8268e2f926e6b39e75fdae0ff8d334a7471deb0e097e376dec53b62bef89.jpg", + "table_caption": [ + "Table 3: Abnormal score, CLIP Score and FID on AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt)." + ], + "table_footnote": [], + "table_body": "
DatasetLAIONHumanArt
ModelAbnormal Score ↓CLIP Score↑FID Score↓Abnormal Score↓CLIP Score↑FID Score↓
SSD-1B [43]0.61234.0216.4650.83233.3713.304
PixArt-XL-2-1024-MS [9]0.70134.3219.6040.80732.6815.452
DeepFloyd-IF [44]0.59532.7225.9260.84932.6721.512
LCM [23]0.64432.9925.1750.83132.4021.179
SDXL [32]0.65934.1330.0240.85732.4020.796
Pose-ControlNet [48]0.66333.5115.3680.83831.8813.047
Pose-T2I-Adapter [26]0.62434.7915.6580.80732.7212.582
HumanSD [18]0.66133.7850.5460.80133.0338.032
HumanRefiner (ours)0.59034.8513.6340.77833.909.145
", + "bbox": [ + 220, + 299, + 787, + 420 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Human Evaluation We conduct a human preference study on generated images with prompts from HumanArt [17], asking 38 users for a preference comparison between DALL-E 3 [30], SDXL [31], and the proposed HumanRefiner. Users compared the images based on fidelity and limb quality. Figure 7 shows that HumanRefiner surpasses DALL-E 3 and SDXL in both fidelity and limb quality for the human generation. For limb quality, HumanRefiner gets $2.9 \\times$ preference over SDXL (32.3% vs. 11.20%), and $1.4 \\times$ over DALL-E 3 (51.42% vs. 36.03%), indicating that HumanRefiner can generate high-quality human pose.", + "bbox": [ + 212, + 440, + 787, + 561 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/660b91f73803212a9b994c4365361db26b91f5b6d1ca23f7e8f7897ceca44501.jpg", + "image_caption": [ + "Fig. 7: Human Evaluation on prompts from HumanArt. The percentage indicates the frequency of human preference. \"Tie\" means having a similar level of preference." + ], + "image_footnote": [], + "bbox": [ + 218, + 587, + 781, + 625 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation Study We perform a component analysis to assess the contribution of each element utilizing the Abnormal Score as a metric for generation quality, as shown in Table 4. For instance, the incorporation of the negative prompt learned from the AbHuman dataset significantly reduces the Abnormal Score from 0.659 to 0.614.", + "bbox": [ + 212, + 686, + 787, + 762 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Figure 8 shows several ablation experiment findings. The Baseline represents the unaltered output of the SDXL model, while AbnormalGuided and PoseGuided illustrate results achieved through the application of distinct guiding modules. As depicted in the first row of figures, discernible enhancements are observed in the characters' outline. Moreover, the second and fourth rows", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/8e3da9ee72d10939a7cae04955992daff9b21af6d929ad5b6c003d8636e4a770.jpg", + "image_caption": [ + "Fig. 8: Visualization outcomes from ablation experiments." + ], + "image_footnote": [], + "bbox": [ + 258, + 146, + 743, + 484 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/f9928375767296ee2d38facac67639be91f7988c93df44179dd1172510e3f883.jpg", + "table_caption": [ + "Table 4: Ablation Study on the proposed components, evaluated on the AbHuman test split (prompts from Laion) with Abnormal score." + ], + "table_footnote": [], + "table_body": "
Negative PromptAbnormal Guidance DetectorInpaintPose GuideAbnormal Score ↓
XXXX0.659
✓XXX0.614
✓✓XX0.605
✓✓✓X0.601
✓✓✓✓0.590
", + "bbox": [ + 246, + 556, + 746, + 633 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "showcase varying degrees of improvement in hand details. Notably, our AbnormalGuided module demonstrates corrective efficacy even in scenes where hand details typically appear blurry. Importantly, the ablation of our AbnormalGuided module mirrors an ablation of the dataset, underscoring the dataset's pivotal role in our approach.", + "bbox": [ + 212, + 643, + 787, + 719 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.3 Qualitative Results", + "text_level": 1, + "bbox": [ + 215, + 739, + 419, + 755 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We also present showcases in the challenging test split, featuring humans engaged in activities such as dancing or performing acrobatics. As illustrated in Figure 9, HumanRefiner exhibits superior limb quality compared to the baseline methods. It accurately captures the human pose, represents natural limb attributes, and presents visually pleasing arrangements.", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 633, + 114, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/45892b29c2014b416980c03fcd52ba2052e8752fad16c38265dd4a5cc142e385.jpg", + "image_caption": [ + "A girl in a pink business suit", + "Fig. 9: Qualitative comparison with baselines conducted on humans engaged in activity prompts." + ], + "image_footnote": [], + "bbox": [ + 233, + 145, + 764, + 460 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion and Future work", + "text_level": 1, + "bbox": [ + 214, + 508, + 526, + 523 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we introduce AbHuman, a benchmark including fine-grained annotations of abnormal limbs. AbHuman comprises 56K generated human images along with 147K annotations for abnormal limbs at the bounding box level. Leveraging this benchmark, we construct HumanRefiner, a plug-and-play human refinement module that could be integrated into any text-to-image diffusion model.", + "bbox": [ + 212, + 537, + 784, + 627 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Integraed with abnormal guidance, pose-reversible guidance, and detector-guided inpainting, HumanRefiner identifies abnormal limbs and removes them during the generation process, resulting in high-quality human image synthesis. Quantitative experimental results on the AbHuman test split, along with human evaluation results, demonstrate the superiority of HumanRefiner. We envision that the AbHuman Benchmark will facilitate further exploration of methods in the field of human image generation.", + "bbox": [ + 212, + 628, + 784, + 733 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitation and Future Work While HumanRefiner is capable of generating high-quality human images, the process involves dual generation steps and inpainting, resulting in a limited inference speed. Furthermore, the AbHuman Dataset lacks broader scene annotations for normal human images. We would continue to improve the diversity of the AbHuman benchmark. We believe that richer annotations will further enhance the performance of HumanRefiner and foster the development of more effective models.", + "bbox": [ + 212, + 734, + 785, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgments", + "text_level": 1, + "bbox": [ + 217, + 143, + 392, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported in part by National Science and Technology Major Project (2020AAA0109704), National Science and Technology Ministry Youth Talent Funding No. 2022WRQB002, Guangdong Outstanding Youth Fund (Grant No. 2021B1515020061), Mobility Grant Award under Grant No. M-0461, Shenzhen Science and Technology Program (Grant No. GJHZ20220913142600001), Nansha Key RD Program under Grant No.2022ZD014.", + "bbox": [ + 212, + 176, + 787, + 268 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 292, + 321, + 308 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Andriluka, M., Iqbal, U., Insafutdinov, E., Pishchulin, L., Milan, A., Gall, J., Schiele, B.: Posetrack: A benchmark for human pose estimation and tracking. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5167-5176 (2018)", + "2. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022)", + "3. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems pp. 1877-1901 (2020)", + "4. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022)", + "5. Cao, Z., Hidalgo Martinez, G., Simon, T., Wei, S., Sheikh, Y.A.: Openpose: Realtime multi-person 2d pose estimation using part affinity fields. IEEE Transactions on Pattern Analysis and Machine Intelligence (2019)", + "6. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017)", + "7. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M.H., Murphy, K., Freeman, W.T., Rubinstein, M., et al.: Muse: Text-to-image generation via masked generative transformers. arXiv preprint arXiv:2301.00704 (2023)", + "8. Charles, J., Pfister, T., Magee, D., Hogg, D., Zisserman, A.: Personalizing human video pose estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3063-3072 (2016)", + "9. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis (2023)", + "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis (2021)", + "11. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106 (2022)", + "12. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems. vol. 33, pp. 6840-6851 (2020)", + "13. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research pp. 2249-2281 (2022)" + ], + "bbox": [ + 218, + 324, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 633, + 114, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)", + "15. Huang, L., Chen, D., Liu, Y., Shen, Y., Zhao, D., Zhou, J.: Composer: Creative and controllable image synthesis with composable conditions. arXiv preprint arXiv:2302.09778 (2023)", + "16. Iqbal, U., Milan, A., Gall, J.: Posetrack: Joint multi-person pose estimation and tracking. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2011-2020 (2017)", + "17. Ju, X., Zeng, A., Wang, J., Xu, Q., Zhang, L.: Human-art: A versatile human-centric dataset bridging natural and artificial scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)", + "18. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15988-15998 (2023)", + "19. Kang, M., Zhu, J.Y., Zhang, R., Park, J., Shechtman, E., Paris, S., Park, T.: Scaling up gans for text-to-image synthesis. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10124-10134 (2023)", + "20. Li, J., Wang, C., Zhu, H., Mao, Y., Fang, H.S., Lu, C.: Crowdpose: Efficient crowded scenes pose estimation and a new benchmark. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10863-10872 (2019)", + "21. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)", + "22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)", + "23. Luo, S., Tan, Y., Huang, L., Li, J., Zhao, H.: Latent consistency models: Synthesizing high-resolution images with few-step inference (2023)", + "24. Lv, W., Xu, S., Zhao, Y., Wang, G., Wei, J., Cui, C., Du, Y., Dang, Q., Liu, Y.: Detrs beat yolos on real-time object detection (2023)", + "25. Madhu, P., Villar-Corrales, A., Kosti, R., Bendschus, T., Reinhardt, C., Bell, P., Maier, A., Christlein, V.: Enhancing human pose estimation in ancient vase paintings via perceptually-grounded style transfer learning. ACM Journal on Computing and Cultural Heritage 16(1), 1-17 (2022)", + "26. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)", + "27. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)", + "28. Narasimhaswamy, S., Nguyen, T., Huang, M., Hoai, M.: Whose hands are these? hand detection and hand-body association in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4889-4899 (2022)", + "29. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)" + ], + "bbox": [ + 215, + 147, + 784, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "30. OpenAI: Improving image generation with better captions (2023), https://cdn.openai.com/papers/dall-e-3.pdf, online; accessed 16-November-2023", + "31. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023)", + "32. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023)", + "33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)", + "34. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)", + "35. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)", + "36. Redmon, J., Divvala, S., Girshick, R., Farhadi, A.: You only look once: Unified, real-time object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 779-788 (2016)", + "37. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)", + "38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)", + "39. Saharia, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)", + "40. Sauer, A., Karras, T., Laine, S., Geiger, A., Aila, T.: Stylegan-t: Unlocking the power of gans for fast large-scale text-to-image synthesis. arXiv preprint arXiv:2301.09515 (2023)", + "41. Schuhmann, C.: Laion-aesthetics predictor v2 (2023), https://laion.ai/blog/laion-aesthetics/, online; accessed 16-November-2023", + "42. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022)", + "43. Segmind: Announcing ssd-1b: A leap in efficient t2i generation (2023), https://blog.segmind.com/introducing-segmind-ssd-1b/, online; accessed 16-November-2023", + "44. Shonenkov, A., Konstantinov, M., Bakshandaeva, D., Schuhmann, C., Ivanova, K., Klokova, N.: Deepfloyd if: A powerful text-to-image model that can smartly integrate text into images (2023), https://www deepfloyd.ai/deepfloyd-if, online; accessed 16-November-2023", + "45. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "HumanRefiner", + "bbox": [ + 633, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 2(3), 5 (2022)", + "47. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023)", + "48. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023)", + "49. Zhang, P., Yang, L., Lai, J.H., Xie, X.: Exploring dual-task correlation for pose guided person image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7713-7722 (2022)", + "50. Zhang, S.H., Li, R., Dong, X., Rosin, P., Cai, Z., Han, X., Yang, D., Huang, H., Hu, S.M.: Pose2seg: Detection free human instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 889-898 (2019)" + ], + "bbox": [ + 215, + 146, + 784, + 354 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Fang and Yan et al.", + "bbox": [ + 271, + 114, + 403, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_model.json b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_model.json new file mode 100644 index 0000000000000000000000000000000000000000..b2ff4eeaa92c7f1c1cecfd4495343cfbe0ad30b9 --- /dev/null +++ b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_model.json @@ -0,0 +1,2590 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.223, + 0.141, + 0.783, + 0.207 + ], + "angle": 0, + "content": "HumanRefiner: Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.235, + 0.764, + 0.267 + ], + "angle": 0, + "content": "Guian Fang\\(^{1,\\star}\\), Wenbiao Yan\\(^{4,*}\\), Yuanfan Guo\\(^{3,*}\\), Jianhua Han\\(^{3}\\), Zutao Jiang\\(^{2}\\), Hang Xu\\(^{3}\\), Shengcai Liao\\(^{5}\\), and Xiaodan Liang\\(^{1,2,\\star\\star}\\)" + }, + { + "type": "text", + "bbox": [ + 0.346, + 0.278, + 0.656, + 0.292 + ], + "angle": 0, + "content": "1 Shenzhen campus of Sun Yat-sen University" + }, + { + "type": "text", + "bbox": [ + 0.31, + 0.292, + 0.693, + 0.306 + ], + "angle": 0, + "content": "\\(^{2}\\) Mohamed bin Zayed University of Artificial Intelligence" + }, + { + "type": "text", + "bbox": [ + 0.428, + 0.306, + 0.59, + 0.318 + ], + "angle": 0, + "content": "Huawei Noah's Ark Lab" + }, + { + "type": "text", + "bbox": [ + 0.409, + 0.319, + 0.596, + 0.333 + ], + "angle": 0, + "content": "\\(^{4}\\) Xi'an Jiaotong University" + }, + { + "type": "text", + "bbox": [ + 0.383, + 0.333, + 0.621, + 0.347 + ], + "angle": 0, + "content": "5 United Arab Emirates University" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.367, + 0.744, + 0.685 + ], + "angle": 0, + "content": "Abstract. Text-to-image diffusion models have significantly advanced in conditional image generation. However, these models usually struggle with accurately rendering images featuring humans, resulting in distorted limbs and other anomalies. This issue primarily stems from the insufficient recognition and evaluation of limb qualities in diffusion models. To address this issue, we introduce AbHuman, the first large-scale synthesized human benchmark focusing on anatomical anomalies. This benchmark consists of 56K synthesized human images, each annotated with detailed, bounding-box level labels identifying 147K human anomalies in 18 different categories. Based on this, the recognition of human anomalies can be established, which in turn enhances image generation through traditional techniques such as negative prompting and guidance. To further boost the improvement, we propose HumanRefiner, a novel plug-and-play approach for the coarse-to-fine refinement of human anomalies in text-to-image generation. Specifically, HumanRefiner utilizes a self-diagnostic procedure to detect and correct issues related to both coarse-grained abnormal human poses and fine-grained anomaly levels, facilitating pose-reversible diffusion generation. Experimental results on the AbHuman benchmark demonstrate that HumanRefiner significantly reduces generative discrepancies, achieving a \\(2.9\\mathrm{x}\\) improvement in limb quality compared to the state-of-the-art open-source generator SDXL and a \\(1.4\\mathrm{x}\\) improvement over DALL-E 3 in human evaluations. Our AbHuman dataset is available at https://github.com/Enderfga/HumanRefiner." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.698, + 0.741, + 0.725 + ], + "angle": 0, + "content": "Keywords: Text-to-Image Diffusion Model \\(\\cdot\\) Abnormal Human Dataset \\(\\cdot\\) Human Anomalies Refinement" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.747, + 0.376, + 0.763 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.774, + 0.808, + 0.806 + ], + "angle": 0, + "content": "Recent developments in text-to-image diffusion models, as exemplified by SDXL [31], DALL-E 2 [34], and DeepFloyd [31,34,44], have marked significant breakthroughs" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.812, + 0.371, + 0.825 + ], + "angle": 0, + "content": "* Equal Contribution." + }, + { + "type": "page_footnote", + "bbox": [ + 0.217, + 0.826, + 0.384, + 0.84 + ], + "angle": 0, + "content": "\\*\\* Corresponding author." + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.812, + 0.384, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "in the generation of high-quality images. These models, benefiting from large-scale pre-training, are capable of generating images for various objects." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.787, + 0.344 + ], + "angle": 0, + "content": "However, generating complex and flexible structures, such as the human body, poses significant challenges for current text-to-image models. As illustrated in Figure 1, common issues with these models include the generation of multiple limbs or abnormal limb details (e.g., irregular fingers). These challenges arise because training focuses on overall characteristics, not detailed ones like the number of fingers or hands. Consequently, models have limited control over the fine-grained generation of detailed body parts and lack the knowledge to distinguish between normal and abnormal human body characteristics. Though such knowledge could be introduced by extra pose condition as indicated in HumanSD [18], Pose-ControlNet [47], T2I-Adapter [27], these models are hard to use because of the requirement of providing extra input." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.361, + 0.753, + 0.373 + ], + "angle": 0, + "content": "Incorrect hand counts Twisted hands Incorrect Limb Position Incorrect leg counts Abnormal hands" + }, + { + "type": "image", + "bbox": [ + 0.236, + 0.374, + 0.371, + 0.476 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.221, + 0.477, + 0.503, + 0.488 + ], + "angle": 0, + "content": "A beautiful ballet dancer is practicing A man doing a trick on a loop" + }, + { + "type": "image", + "bbox": [ + 0.373, + 0.374, + 0.506, + 0.476 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.374, + 0.641, + 0.476 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.643, + 0.374, + 0.778, + 0.476 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.51, + 0.477, + 0.64, + 0.487 + ], + "angle": 0, + "content": "A male dancer in a black outfit" + }, + { + "type": "image_caption", + "bbox": [ + 0.665, + 0.477, + 0.758, + 0.487 + ], + "angle": 0, + "content": "A boy is jumping high" + }, + { + "type": "image_caption", + "bbox": [ + 0.394, + 0.489, + 0.612, + 0.5 + ], + "angle": 0, + "content": "(a) Human images generated by SDXL" + }, + { + "type": "image", + "bbox": [ + 0.236, + 0.503, + 0.371, + 0.606 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.373, + 0.503, + 0.506, + 0.606 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.503, + 0.641, + 0.606 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.643, + 0.503, + 0.778, + 0.606 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.393, + 0.608, + 0.63, + 0.621 + ], + "angle": 0, + "content": "(b) HumanRefiner (ours), based on SDXL" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.632, + 0.788, + 0.702 + ], + "angle": 0, + "content": "Fig.1: The synthesis of human images by SOTA text-to-image diffusion model SDXL [31] still presents incorrect limb counts, twisted hands, and incorrect limb position problems. We propose HumanRefiner, a coarse-to-fine self-diagnosis pose/anomaly-reversible generation pipeline built on the AbHuman benchmark to eliminate the anomalies." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Therefore, this paper focuses on enhancing the text-to-image diffusion model's understanding of human anomalies and leveraging this knowledge to drive models for generating accurate and realistic human bodies. To address the above challenges, we introduce the first large-scale synthesized human benchmark for anatomical anomalies, named AbHuman. This benchmark comprises 56K synthesized human images, each meticulously annotated with detailed, bounding-box level labels that mark 147K instances of human limbs. Instead of a single \"abnormal body\" category, these anomalies are categorized into 18 distinct finer" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.634, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "groups, such as \"abnormal/normal head\", \"abnormal/normal hand\", \"abnormal/normal foot\", etc." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.787, + 0.299 + ], + "angle": 0, + "content": "With the proposed benchmark, it could be directly employed to provide knowledge about human anomalies by abnormal captions derived from the annotation, which can then be integrated into the diffusion model through the conventional negative prompting technique. Another possible way is to develop an Abnormal Scorer, which provides feedback on generated images to distinguish normal/abnormal images. Such a scorer enables quantitative assessment of anomalies in generated images and could provide guidance on anomalies for the text-to-image diffusion process." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.3, + 0.788, + 0.51 + ], + "angle": 0, + "content": "However, these conventional approaches from our AbHuman benchmark do not fully leverage the detailed information available from bounding box-level annotations of human limb anomalies. Therefore, we propose HumanRefiner, a novel and adaptable method for addressing human anomalies that can be integrated with any text-to-image generation model. HumanRefiner goes beyond the typical abnormal guidance and negative prompting by implementing a coarse-to-fine, pose-reversible diffusion generation process. This includes a pose-guided generation for global refinement and anomaly detector-guided inpainting for fine-grained refinement. The detailed anomalies are identified using an abnormal detector train on AbHuman. Experimental results on the benchmark illustrate that HumanRefiner markedly reduces generative discrepancies, achieving a \\(2.9\\times\\) improvement in limb quality compared to leading open-source generator SDXL and a \\(1.4\\times\\) improvement over DALL-E 3 in human evaluations. In summary, our contributions are threefold:" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.523, + 0.784, + 0.565 + ], + "angle": 0, + "content": "- Introduction of AbHuman, the first large-scale benchmark of synthesized humans with anatomical anomalies, which encompasses 56K images, each annotated with detailed, bounding-box level human anomaly labels." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.569, + 0.784, + 0.597 + ], + "angle": 0, + "content": "- We propose HumanRefiner, a novel plug-and-play approach for coarse-to-fine refinement of human anomalies via pose-reversible guidance." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.6, + 0.784, + 0.672 + ], + "angle": 0, + "content": "- Comprehensive experimental results show that HumanRefiner significantly reduces generative discrepancies compared to SOTA text-to-image models. Human evaluation results indicate a \\(2.9 \\times\\) preference for our HumanRefiner in generating high-quality human images compared to SDXL and a \\(1.4 \\times\\) preference over DALL-E 3." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.523, + 0.784, + 0.672 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.702, + 0.388, + 0.717 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.737, + 0.547, + 0.752 + ], + "angle": 0, + "content": "2.1 Text-to-Image/Human Generation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Text-To-Image Generation. The goal of text-to-image synthesis is to generate realistic images based on given descriptions. Fueled by large-scale image-text datasets [4, 42], various training and inference techniques [12, 13, 45], and advancements in scalability [34], text-to-image models have made significant progress. Existing text-to-image models can be broadly categorized into three" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.252 + ], + "angle": 0, + "content": "main approaches: those utilizing diffusion models [2, 11, 29, 34, 37-39], autoregressive models [7, 35, 46], and generative adversarial models [19, 40, 49]. The latest models, such as DALL-E 3 [30], and SDXL [31], have shown substantial improvements in image generation quality. However, the challenge of generating human-like images from text remains difficult due to the diversity of human body poses and insufficient alignment between image and text. Our work focuses on improving the quality of generated human images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.785, + 0.388 + ], + "angle": 0, + "content": "Text-To-Human Generation. Numerous models have made considerable efforts to enhance the generation quality of realistic human images. They have discovered that injecting additional conditions into diffusion models provides better guidance for human image generation. Models such as [15,27,47] have incorporated additional training modules, introducing human pose conditions to finely control the generation of human images. Additionally, [21] has the capability not only to introduce key points but also to incorporate bounding box detection data. Building upon the introduction of additional poses, [18] has implemented a strategy involving heatmap alignment to achieve higher-quality human images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.389, + 0.785, + 0.448 + ], + "angle": 0, + "content": "However, existing works dedicated to human generation face two main challenges: (1) the introduction of poses significantly restricts the diversity of generated human poses, and (2) pose conditions still exhibit limitations in addressing fine-grained details of human body parts, such as hands, feet, and facial features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.45, + 0.787, + 0.493 + ], + "angle": 0, + "content": "Differing from this line of research, HumanRefiner is designed to address the issue of human generation without the requirement of human-provided pose conditions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.515, + 0.503, + 0.529 + ], + "angle": 0, + "content": "2.2 Human Generation Datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.785, + 0.718 + ], + "angle": 0, + "content": "Currently, human datasets primarily consist of two types. The first focuses on authentic depictions of individuals in natural settings, such as human photos and images from human video data [1,6,8,20,22,28,42,50]. These widely available datasets offer abundant human-pose pairs, with annotations limited to key points or bounding boxes. Given that these data are derived from real photos, the humans depicted are inherently natural, without limb anomalies. The second category involves artificial scenes featuring human-like figures in settings such as paintings, cartoons, and similar environments. The Human-Art dataset [17] provides 50,000 images centered around humans, encompassing five natural scenes and fifteen artificial scenes, accompanied by precise pose and text annotations. None of these datasets provide large-scale synthesized images or potential limb abnormal annotations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.785, + 0.795 + ], + "angle": 0, + "content": "To address the challenge of limb anomalies in the text-driven human image generation task, we have developed a novel AbHuman dataset as a component of this research effort. This dataset serves as a valuable resource for effectively handling limb abnormalities within the context of generating human images from textual descriptions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.785, + 0.84 + ], + "angle": 0, + "content": "We provide a large-scale dataset of abnormal human images called AbHuman. Firstly, this is the first dataset to focus on limb abnormalities, as existing text-to-human algorithms are primarily based on the MS-COCO [22] and" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.634, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.269 + ], + "angle": 0, + "content": "LAION-5B [42] datasets. Notably, models trained on real images often face challenges in accurately generating limb abnormalities in humans. To address this issue in general human image generation scenarios, we constructed a new benchmark. Secondly, this dataset collects a significant number of failure cases based on existing generative models. We observed that existing AI-generated human images often feature limb abnormalities, which we filtered, annotated, and analyzed. With the guidance of this dataset, the quality of generative models has been greatly improved." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.288, + 0.393, + 0.302 + ], + "angle": 0, + "content": "2.3 Data Collection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.311, + 0.784, + 0.357 + ], + "angle": 0, + "content": "We designed a standardized pipeline for abnormal human limb image collection, including prompt collection, image generation, and abnormal annotation, as shown in Fig. 2." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.373, + 0.782, + 0.474 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.304, + 0.487, + 0.696, + 0.501 + ], + "angle": 0, + "content": "Fig. 2: Data generation pipeline of our AbHuman dataset." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.541, + 0.48, + 0.557 + ], + "angle": 0, + "content": "3 The AbHuman Dataset" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.57, + 0.788, + 0.674 + ], + "angle": 0, + "content": "- Prompt Collection: Our prompts are derived from three sources: textual descriptions related to humans in the Laion-5B [42], textual descriptions from the Human-Art dataset [17], and prompts generated using ChatGPT 3.5 [3]. To extract text-generating human-related content from the Laion dataset, We used keyword filtering to extract human-related content from the Laion dataset, resulting in 100,000 high-quality textual prompts. Subsequently, we utilized the collected textual content as the foundation of our dataset." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.675, + 0.788, + 0.78 + ], + "angle": 0, + "content": "- Image Generation: With the rapid advancements in text-to-image models, the quality of human image generation has significantly improved. However, even state-of-the-art generation models like SDXL [32], Midjourney, and DALL-E 3 [30] encounter issues with limb abnormalities when generating human images. To enhance the quality of human generation using the best existing generation models as a baseline, we employed the SDXL model for generating our images." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "- Abnormal Annotation: After collecting a large number of images, a comparative analysis revealed the presence of non-human images within the dataset. Initially, we applied a ResNet50-based classifier to filter all images labeled as \"person\".After removing low-quality images, trained human" + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.57, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.147, + 0.786, + 0.207 + ], + "angle": 0, + "content": "annotators annotated the remaining 56,000 images. Two human evaluators reviewed the dataset, resulting in a curated AbHuman dataset with 56,000 images and 147,000 annotations. Details of the annotated categories are provided in the appendix." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.208, + 0.787, + 0.283 + ], + "angle": 0, + "content": "- Data Split: The dataset is partitioned into training and testing splits in 4:1, with 52k and 13k image-text pairs, respectively. We further develop a testing split for human evaluation, where prompts are from HumanArt [17], each describing humans performing difficult actions such as acrobatics, dancing, and drama." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.296, + 0.784, + 0.388 + ], + "angle": 0, + "content": "As illustrated in Figure 3, the AbHuman dataset provides bounding boxes and classification information for abnormal humans. Unlike existing keypoint-based annotation methods, the bounding box annotation enables the identification of both the location and type of anomalies in limbs. By detecting and inpainting anomalies in human limbs, our dataset is more conducive to improving generation algorithms." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.406, + 0.787, + 0.584 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.593, + 0.788, + 0.637 + ], + "angle": 0, + "content": "Fig. 3: The visualization of limb detection in the test set using the fine-tuned AbHuman detection model. Red boxes and labels are used to annotate the abnormal limbs detected, and white boxes and labels are used to annotate the normal limbs detected." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.678, + 0.519, + 0.695 + ], + "angle": 0, + "content": "3.1 Dataset Statistics and Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.841 + ], + "angle": 0, + "content": "After reviewing a large number of generated samples, we conducted an analysis of human abnormalities and identified 18 distinct detection classes (e.g., Normal human, Abnormal Head, Abnormal Neck, Abnormal Body, Abnormal Arm, Abnormal Hand...). To illustrate the class distribution of anomalous human samples generated by the SDXL model, we performed a statistical analysis of both anomalous humans and their corresponding annotations. As depicted in Figure 4, the model predominantly generates images with anomalous hands, aligning with the highest count of annotations for hand anomalies. Thus, it is evident that hand anomalies remain a challenge for text-to-image models. Additionally," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.634, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "the number of samples with anomalies in the head and foot regions is relatively higher compared to other parts of the human body." + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.231, + 0.495, + 0.34 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.223, + 0.352, + 0.496, + 0.366 + ], + "angle": 0, + "content": "Fig. 4: Ab-human annotations statistics." + }, + { + "type": "image", + "bbox": [ + 0.5, + 0.203, + 0.788, + 0.328 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.498, + 0.337, + 0.788, + 0.392 + ], + "angle": 0, + "content": "Fig. 5: Visualization of abnormal scores. red indicates images with high abnormal scores while green indicates images with low abnormal scores." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.414, + 0.788, + 0.551 + ], + "angle": 0, + "content": "Table 1 illustrates a comparison of datasets concerning human images. Compared to other human datasets [1, 16, 17, 20, 25, 28] that solely annotate images of authentic and normal individuals, existing datasets have limited annotations for genuinely abnormal human limbs. On the contrary, the AbHuman dataset introduces anomalies in human-generated images and provides ample annotations for anomalous body postures. In the context of human-focused tasks such as generation and detection, AbHuman proves to be more suitable. Additionally, compared to datasets with relatively monotonous scenes, AbHuman encompasses a more diverse range of scenarios, enhancing its applicability in various contexts." + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.569, + 0.788, + 0.613 + ], + "angle": 0, + "content": "Table 1: Comparison of human-centric datasets, including human generation and detection tasks. AbHuman provides more granular annotation boxes and information to address the abnormality issues in the human generation." + }, + { + "type": "table", + "bbox": [ + 0.28, + 0.624, + 0.72, + 0.729 + ], + "angle": 0, + "content": "
DatasetImagesBboxNormalAbnormal-LimbGeneral
BodyHands [28]20K✓✓✗✗
CrowdPose [20]20K✓✓✗✗
Multi-Person PoseTrack [16]23K✓✓✗✗
PoseTrack [1]23K✓✓✗✗
ClassArch [25]1.5K✓✓✗✗
Human-Art [17]50K✓✓✗✓
AbHuman (Ours)56K✓✓✓✓
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.769, + 0.407, + 0.784 + ], + "angle": 0, + "content": "3.2 Abnormal Scorer" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "As indicated, the lack of a metric measuring the generated limb quality makes it difficult to (1) quantitatively compare different models; and (2) develop generators for the improvement of limb quality. Based on the proposed AbHuman" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "Dataset, we present a quantitative metric of limb anomalies in a generated or real human image. To this end, inspired by the aesthetic scorer based on the Laion dataset [41], we train an Abnormal Scorer \\( S_{\\theta}(\\cdot) \\). For the model structure of Abnormal Scorer \\( S_{\\theta}(\\cdot) \\), we adhere to the architecture utilized by Aesthetic Scorer [41]. Building upon a pretrained CLIP ViT-Large with patch size of 14 [33] with a hidden dimension of 768, a Multi-Layer Perceptron (MLP) is constructed, as depicted in Table 2." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.279, + 0.788, + 0.322 + ], + "angle": 0, + "content": "Table 2: Model architecture of MLP part of our abnormal scorer. Linear(A, B) means a linear layer with an input feature dimension of A and an output feature dimension of B. Dropout \\((\\alpha)\\) means a dropout layer with the probability of \\(\\alpha\\)." + }, + { + "type": "table", + "bbox": [ + 0.269, + 0.334, + 0.731, + 0.387 + ], + "angle": 0, + "content": "
Layer index0123
LayerLinear (768, 1024)Dropout (0.2)Linear (1024, 128)Dropout (0.2)
Layer index4567
LayerLinear (128, 64)Dropout (0.1)Linear (64, 16)Linear (16, 1)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.415, + 0.788, + 0.522 + ], + "angle": 0, + "content": "Given an image \\( x \\in \\mathcal{R}^{3 \\times H \\times W} \\), the Abnormal Scorer assigns a score \\( S_{\\theta}(x) \\in [0,1] \\) reflecting the severity of limb aberrations or distortions. Specifically, this model is architecturally based on a Multi-Layer Perceptron (MLP) and is built upon the foundation of the pre-trained CLIP Vision Transformer Large (ViT-L) model [33]. As illustrated in Figure 5, high-scoring images are characterized by pronounced limb distortions or the absence of limbs, whereas images with lower scores correspond to either normal human depictions or non-human subjects." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.545, + 0.424, + 0.559 + ], + "angle": 0, + "content": "3.3 Abnormal Detector" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.571, + 0.788, + 0.678 + ], + "angle": 0, + "content": "To locate and detect abnormal limbs in human images for subsequent fine-grained refinement, we developed an abnormal limb detector. Specifically, we fine-tuned YOLOv8 [36] and RT-DETR [24] on the training set of AbHuman for 100 epochs. Subsequently, we conduct corresponding detections on the test set, obtaining consistently stable results in the detection of abnormal limbs. Visualization results are provided in Figure 3, showing the capability of identifying abnormal/normal regions and corresponding categories." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.702, + 0.396, + 0.718 + ], + "angle": 0, + "content": "4 HumanRefiner" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Based on the trained detector as illustrated in sec 3.3, we can develop a flexible human image synthesis and refinement mechanism, HumanRefiner, which can be integrated into any pipeline for human image generation. As shown in Figure 6, in addition to the basic improvement on generation gained from negative prompting learned from Abnormal Guidance, HumanRefiner performs a coarse-to-fine pose-reversible refinement based on the initially generated images. An off-the-shelf pose detector [6] is employed to inject pose guidance into the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.634, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.207 + ], + "angle": 0, + "content": "text-to-image diffusion model, which serves as conditions for coarse refinement of the initial generated image. Then, the Abnormal Detector identifies abnormals that are further rectified through an inpainting diffusion model, refining the remained abnormals at a fine-grained level." + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.233, + 0.788, + 0.379 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.38, + 0.788, + 0.492 + ], + "angle": 0, + "content": "Fig.6: Overview of our HumanRefiner pipeline empowered by the proposed AbHuman benchmark. It consists of a Text-to-Image Diffusion Model trained with negative prompts on the AbHuman benchmark, which generates an initial human image with guidance from Abnormal Scorer, a Coarse-to-Fine Refinement Process where the generated image is globally refined by pose-guided generation and locally refined by detector-guided inpainting. For both the Pose-T2I Adapter [27] and the Inpainting Diffusion models, the Stable Diffusion parameters are adopted from the Text-to-Image model, which was refined through training in the Abnormal Guidance Stage." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.788, + 0.572 + ], + "angle": 0, + "content": "The following sections demonstrate the basic control of human generation from negative prompting and abnormal guidance, followed by the coarse refinement module of pose-guided generation and the fine-grained refinement module of detector-guided inpainting." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.591, + 0.414, + 0.607 + ], + "angle": 0, + "content": "4.1 Negative Prompts" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.615, + 0.788, + 0.707 + ], + "angle": 0, + "content": "The diffusion model is designed to generate data through a sequence of denoising autoencoders. The Latent Diffusion Model (LDM) [37] conducts the diffusion process with a VAE encoder \\(\\mathcal{E}\\) and decoder \\(\\mathcal{D}\\). Given an image \\(x\\), the forward diffusion process incrementally adds Gaussian noise \\(\\epsilon\\) to the latent \\(z_0 = \\mathcal{E}(x)\\) following a T-step noise schedule \\(\\{\\alpha_t\\}_{t=1}^T\\) to produce a noisy latent \\(z_t\\) where the noise level increases over timesteps \\(t\\):" + }, + { + "type": "equation", + "bbox": [ + 0.414, + 0.715, + 0.787, + 0.734 + ], + "angle": 0, + "content": "\\[\nz _ {t} = \\sqrt {1 - \\overline {{\\alpha}} _ {t}} z _ {0} + \\sqrt {\\overline {{\\alpha}} _ {t}} \\epsilon , \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.742, + 0.787, + 0.774 + ], + "angle": 0, + "content": "where \\(\\epsilon \\sim \\mathcal{N}(0,I)\\) and \\(\\overline{\\alpha}_t = \\prod_{i=1}^t \\alpha_i\\). A text-to-image diffusion model learns a noise predictor \\(\\epsilon_\\theta(z_t, t, y)\\) conditioned on text \\(y\\) with the objective:" + }, + { + "type": "equation", + "bbox": [ + 0.356, + 0.783, + 0.787, + 0.801 + ], + "angle": 0, + "content": "\\[\nL = \\mathbb {E} _ {\\mathcal {E} (x), y, \\epsilon \\sim \\mathcal {N} (0, 1), t} [ | | \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, y) | | _ {2} ^ {2} ]. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "The text condition \\( y \\) ensures that the model's denoising is conditioned and controlled. Consequently, based on our AbHuman Benchmark, we can train the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.22 + ], + "angle": 0, + "content": "Latent Diffusion Model with the abnormal text conditions \\( y_{a} \\) (e.g., Ab. Hand, Ab. Feet...), making the model aware of the abnormal limb information. During the generation process, Classifier-Free Guidance [14] could be applied by using the abnormal text as a negative prompt to eliminate the generation of abnormal limbs:" + }, + { + "type": "equation", + "bbox": [ + 0.308, + 0.225, + 0.786, + 0.241 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} _ {\\theta} (z _ {t}, t, y) = \\epsilon_ {\\theta} (z _ {t}, t, y _ {a}) + s \\cdot (\\epsilon_ {\\theta} (z _ {t}, t, y) - \\epsilon_ {\\theta} (z _ {t}, t, y _ {a})), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.248, + 0.736, + 0.262 + ], + "angle": 0, + "content": "where \\( s \\) is a scaling factor that modulates the influence of the condition." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.287, + 0.43, + 0.301 + ], + "angle": 0, + "content": "4.2 Abnormal Guidance" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.785, + 0.418 + ], + "angle": 0, + "content": "In addition to adding information on human abnormals through negative prompting, we can introduce a general form of guidance to improve control over the denoising process. As shown in section 3.2, the Abnormal Scorer \\( S_{\\phi}(x) \\) gives a score to an image that measures the severity of limb abnormals. This scorer can provide further guidance using a general Classifier Guidance [10]. Specifically, since \\( \\epsilon_{\\theta}(z_t,t,y) \\) predicts the added noise, we can estimate the clean latent variable \\( z_0 \\) by:" + }, + { + "type": "equation", + "bbox": [ + 0.414, + 0.421, + 0.786, + 0.453 + ], + "angle": 0, + "content": "\\[\n\\hat {z} _ {0} = \\frac {z _ {t} - \\sqrt {\\overline {{\\alpha}} _ {t}} \\epsilon_ {\\theta} (z _ {t} , t , y)}{\\sqrt {1 - \\overline {{\\alpha}} _ {t}}}. \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.459, + 0.784, + 0.49 + ], + "angle": 0, + "content": "After this, we can calculate an estimated abnormal score with \\( S_{\\phi}(\\mathcal{D}(\\hat{z}_0)) \\). Consequently, the noise prediction guided by this method is:" + }, + { + "type": "equation", + "bbox": [ + 0.36, + 0.504, + 0.785, + 0.519 + ], + "angle": 0, + "content": "\\[\n\\ddot {\\epsilon} _ {\\theta} \\left(z _ {t}, t, y\\right) = \\epsilon \\left(z _ {t}, t, y\\right) + \\mu \\cdot \\nabla S _ {\\phi} \\left(\\mathcal {D} \\left(\\hat {z} _ {0}\\right)\\right). \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.532, + 0.784, + 0.561 + ], + "angle": 0, + "content": "We can combine classifier-free guidance through negative prompting with abnormal guidance easily by:" + }, + { + "type": "equation", + "bbox": [ + 0.341, + 0.575, + 0.785, + 0.608 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\hat {\\epsilon} _ {t} = \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right) + s \\cdot \\left(\\epsilon_ {\\theta} \\left(z _ {t}, t, y\\right) - \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right)\\right) \\tag {6} \\\\ + \\mu \\cdot \\nabla S _ {\\phi} (\\mathcal {D} (\\hat {z} _ {0})). \\\\ \\end{array}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.632, + 0.589, + 0.646 + ], + "angle": 0, + "content": "4.3 Coarse-to-fine Pose-reversible Guidance" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.784, + 0.718 + ], + "angle": 0, + "content": "In contrast to unguided approaches, our HumanRefiner now yields human images with more accurate poses initially. To further enhance the generation quality, we refine the generated image with pose-reversible guidance at both coarse and fine-grained levels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.785, + 0.839 + ], + "angle": 0, + "content": "Pose-Guided Coarse Refine The abnormal guided text-to-image diffusion model could be combined with off-the-shelf pose detector [6] and T2I-Adapter [27] to further inject global human pose information for pose-guided refinement. For an initially generated image \\(\\hat{x}\\) from a guided text-to-image diffusion model, a pose keypoint map \\(M\\) could be detected by a pose detector \\(M = P_{\\psi}(\\hat{x})\\). The pose-guided generation could be expanded from the text-to-image diffusion model with T2I-Adapter [27] by injecting the pose condition information into intermediate encoder features:" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.633, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "equation", + "bbox": [ + 0.449, + 0.163, + 0.785, + 0.178 + ], + "angle": 0, + "content": "\\[\nF _ {c} = \\mathcal {F} _ {A D} (M), \\tag {7}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.439, + 0.182, + 0.785, + 0.196 + ], + "angle": 0, + "content": "\\[\nF _ {e n c} = F _ {e n c} + F _ {c}, \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.203, + 0.784, + 0.261 + ], + "angle": 0, + "content": "where \\(\\mathcal{F}_{AD}\\) is T2I-Adapter and \\(F_{enc}\\) is the intermediate feature of the encoder part of \\(\\epsilon_{\\theta}(\\cdot)\\). Forming the pose conditioned denoising as \\(\\epsilon_{\\theta}(z_t,t,y,\\mathcal{F}_{AD}(M))\\), the advantage of abnormal guidance and negative prompts could also be integrated as:" + }, + { + "type": "equation", + "bbox": [ + 0.305, + 0.273, + 0.785, + 0.308 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\hat {\\epsilon} _ {t} = \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right) + s \\cdot \\left(\\epsilon_ {\\theta} \\left(z _ {t}, t, y, \\mathcal {F} _ {A D} (M)\\right) - \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right)\\right) \\tag {9} \\\\ + \\mu \\cdot \\nabla S _ {\\phi} (\\mathcal {D} (\\hat {z _ {0}})). \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.319, + 0.784, + 0.378 + ], + "angle": 0, + "content": "Detector-Guided Inpainting Refine The pose-guided generation refines the initial image in a global view, performing a coarse refinement. Besides, a fine-grained refinement could be established with our abnormal detector providing region-level abnormal information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.379, + 0.785, + 0.485 + ], + "angle": 0, + "content": "Specifically, for a refined image by applying diffusion denoise process in Eq. (9), \\( x_{r} = \\mathcal{D}(\\hat{z}_{0}) \\), abnormal detector \\( D_{Ab}(\\cdot) \\) outputs a set of \\( K \\) bounding boxes and corresponding categories \\( \\{B_i,C_i\\}_{i = 1}^K = D_{Ab}(x_r) \\), where \\( B_{i} = \\{x_{i},y_{i},w_{i},h_{i}\\} \\) denotes the detected regions, \\( C_i\\in \\{0,\\dots 17\\} \\) denoting the detected categories defined in sec 3.1. For detected abnormal classes, the local region \\( B_{i} \\) is inpainted with an input text conditioned on abnormal category \\( \\hat{y} (C_i) \\). The local region in the original image is then pasted by the inpainted output." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.508, + 0.376, + 0.526 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.541, + 0.457, + 0.556 + ], + "angle": 0, + "content": "5.1 Implementation Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.566, + 0.784, + 0.643 + ], + "angle": 0, + "content": "Negative Prompt Fine-tuning: we finetune SDXL [31] released checkpoint at a resolution of \\(1024 \\times 1024\\) for 10 epochs with the learning rate of \\(1.0\\mathrm{e} - 5\\) on the training split, with a batch size of 32 in total. The images are paired with the original text description followed by abnormal captions (e.g. Ab(hand, Ab.leg). More details can be found in the appendix." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.664, + 0.476, + 0.68 + ], + "angle": 0, + "content": "5.2 Quantitative Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Evaluation Setup We present quantitative comparison with baseline methods including SOTA text-to-image diffusion models SDXL [31], DeepFlyod-IF [44], LCM [23]. For methods require extra pose condition inputs such as HumanSD [18]. Pose-ControlNet [47] and Pose-T2I-Adapter [27], we first generate an initial image from SDXL [31], then generate pose condition from it with pose detector [5], which operates similarly to our pose-guided generation. Test prompts are provided from the AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt). We quantitatively evaluate the generated images with Abnormal Score, CLIP score and FID, respectively. Abnormal Score measures the severity of anomalies." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.239 + ], + "angle": 0, + "content": "Results As indicated in Table 3, HumanRefiner consistently achieves the best performance in terms of Abnormal score, FID, and CLIP score. Furthermore, when compared to Pose-ControlNet [47] and Pose-T2I-Adapter [27] applied on SDXL, HumanRefiner demonstrates a significant improvement, indicating the effectiveness of HumanRefiner on integrating off-the-shelf methods such as pose detectors and T2I-adapter [27]." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.267, + 0.788, + 0.296 + ], + "angle": 0, + "content": "Table 3: Abnormal score, CLIP Score and FID on AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt)." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.3, + 0.789, + 0.421 + ], + "angle": 0, + "content": "
DatasetLAIONHumanArt
ModelAbnormal Score ↓CLIP Score↑FID Score↓Abnormal Score↓CLIP Score↑FID Score↓
SSD-1B [43]0.61234.0216.4650.83233.3713.304
PixArt-XL-2-1024-MS [9]0.70134.3219.6040.80732.6815.452
DeepFloyd-IF [44]0.59532.7225.9260.84932.6721.512
LCM [23]0.64432.9925.1750.83132.4021.179
SDXL [32]0.65934.1330.0240.85732.4020.796
Pose-ControlNet [48]0.66333.5115.3680.83831.8813.047
Pose-T2I-Adapter [26]0.62434.7915.6580.80732.7212.582
HumanSD [18]0.66133.7850.5460.80133.0338.032
HumanRefiner (ours)0.59034.8513.6340.77833.909.145
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.788, + 0.562 + ], + "angle": 0, + "content": "Human Evaluation We conduct a human preference study on generated images with prompts from HumanArt [17], asking 38 users for a preference comparison between DALL-E 3 [30], SDXL [31], and the proposed HumanRefiner. Users compared the images based on fidelity and limb quality. Figure 7 shows that HumanRefiner surpasses DALL-E 3 and SDXL in both fidelity and limb quality for the human generation. For limb quality, HumanRefiner gets \\(2.9 \\times\\) preference over SDXL (32.3% vs. 11.20%), and \\(1.4 \\times\\) over DALL-E 3 (51.42% vs. 36.03%), indicating that HumanRefiner can generate high-quality human pose." + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.588, + 0.782, + 0.626 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.639, + 0.788, + 0.668 + ], + "angle": 0, + "content": "Fig. 7: Human Evaluation on prompts from HumanArt. The percentage indicates the frequency of human preference. \"Tie\" means having a similar level of preference." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.688, + 0.788, + 0.763 + ], + "angle": 0, + "content": "Ablation Study We perform a component analysis to assess the contribution of each element utilizing the Abnormal Score as a metric for generation quality, as shown in Table 4. For instance, the incorporation of the negative prompt learned from the AbHuman dataset significantly reduces the Abnormal Score from 0.659 to 0.614." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Figure 8 shows several ablation experiment findings. The Baseline represents the unaltered output of the SDXL model, while AbnormalGuided and PoseGuided illustrate results achieved through the application of distinct guiding modules. As depicted in the first row of figures, discernible enhancements are observed in the characters' outline. Moreover, the second and fourth rows" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.634, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.259, + 0.147, + 0.744, + 0.485 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.305, + 0.495, + 0.696, + 0.51 + ], + "angle": 0, + "content": "Fig. 8: Visualization outcomes from ablation experiments." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.523, + 0.785, + 0.552 + ], + "angle": 0, + "content": "Table 4: Ablation Study on the proposed components, evaluated on the AbHuman test split (prompts from Laion) with Abnormal score." + }, + { + "type": "table", + "bbox": [ + 0.248, + 0.557, + 0.747, + 0.635 + ], + "angle": 0, + "content": "
Negative PromptAbnormal Guidance DetectorInpaintPose GuideAbnormal Score ↓
XXXX0.659
✓XXX0.614
✓✓XX0.605
✓✓✓X0.601
✓✓✓✓0.590
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.72 + ], + "angle": 0, + "content": "showcase varying degrees of improvement in hand details. Notably, our AbnormalGuided module demonstrates corrective efficacy even in scenes where hand details typically appear blurry. Importantly, the ablation of our AbnormalGuided module mirrors an ablation of the dataset, underscoring the dataset's pivotal role in our approach." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.741, + 0.421, + 0.756 + ], + "angle": 0, + "content": "5.3 Qualitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We also present showcases in the challenging test split, featuring humans engaged in activities such as dancing or performing acrobatics. As illustrated in Figure 9, HumanRefiner exhibits superior limb quality compared to the baseline methods. It accurately captures the human pose, represents natural limb attributes, and presents visually pleasing arrangements." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "image", + "bbox": [ + 0.234, + 0.146, + 0.765, + 0.461 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.455, + 0.462, + 0.56, + 0.47 + ], + "angle": 0, + "content": "A girl in a pink business suit" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.472, + 0.785, + 0.499 + ], + "angle": 0, + "content": "Fig. 9: Qualitative comparison with baselines conducted on humans engaged in activity prompts." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.509, + 0.527, + 0.525 + ], + "angle": 0, + "content": "6 Conclusion and Future work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.785, + 0.628 + ], + "angle": 0, + "content": "In this paper, we introduce AbHuman, a benchmark including fine-grained annotations of abnormal limbs. AbHuman comprises 56K generated human images along with 147K annotations for abnormal limbs at the bounding box level. Leveraging this benchmark, we construct HumanRefiner, a plug-and-play human refinement module that could be integrated into any text-to-image diffusion model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.785, + 0.734 + ], + "angle": 0, + "content": "Integraed with abnormal guidance, pose-reversible guidance, and detector-guided inpainting, HumanRefiner identifies abnormal limbs and removes them during the generation process, resulting in high-quality human image synthesis. Quantitative experimental results on the AbHuman test split, along with human evaluation results, demonstrate the superiority of HumanRefiner. We envision that the AbHuman Benchmark will facilitate further exploration of methods in the field of human image generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Limitation and Future Work While HumanRefiner is capable of generating high-quality human images, the process involves dual generation steps and inpainting, resulting in a limited inference speed. Furthermore, the AbHuman Dataset lacks broader scene annotations for normal human images. We would continue to improve the diversity of the AbHuman benchmark. We believe that richer annotations will further enhance the performance of HumanRefiner and foster the development of more effective models." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.634, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.393, + 0.163 + ], + "angle": 0, + "content": "Acknowledgments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.269 + ], + "angle": 0, + "content": "This work was supported in part by National Science and Technology Major Project (2020AAA0109704), National Science and Technology Ministry Youth Talent Funding No. 2022WRQB002, Guangdong Outstanding Youth Fund (Grant No. 2021B1515020061), Mobility Grant Award under Grant No. M-0461, Shenzhen Science and Technology Program (Grant No. GJHZ20220913142600001), Nansha Key RD Program under Grant No.2022ZD014." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.293, + 0.323, + 0.309 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.325, + 0.785, + 0.38 + ], + "angle": 0, + "content": "1. Andriluka, M., Iqbal, U., Insafutdinov, E., Pishchulin, L., Milan, A., Gall, J., Schiele, B.: Posetrack: A benchmark for human pose estimation and tracking. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5167-5176 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.382, + 0.785, + 0.422 + ], + "angle": 0, + "content": "2. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.424, + 0.785, + 0.464 + ], + "angle": 0, + "content": "3. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems pp. 1877-1901 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.465, + 0.785, + 0.492 + ], + "angle": 0, + "content": "4. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.493, + 0.785, + 0.533 + ], + "angle": 0, + "content": "5. Cao, Z., Hidalgo Martinez, G., Simon, T., Wei, S., Sheikh, Y.A.: Openpose: Realtime multi-person 2d pose estimation using part affinity fields. IEEE Transactions on Pattern Analysis and Machine Intelligence (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.535, + 0.785, + 0.575 + ], + "angle": 0, + "content": "6. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.577, + 0.785, + 0.631 + ], + "angle": 0, + "content": "7. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M.H., Murphy, K., Freeman, W.T., Rubinstein, M., et al.: Muse: Text-to-image generation via masked generative transformers. arXiv preprint arXiv:2301.00704 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.632, + 0.785, + 0.673 + ], + "angle": 0, + "content": "8. Charles, J., Pfister, T., Magee, D., Hogg, D., Zisserman, A.: Personalizing human video pose estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3063-3072 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.674, + 0.785, + 0.715 + ], + "angle": 0, + "content": "9. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.716, + 0.766, + 0.729 + ], + "angle": 0, + "content": "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.73, + 0.785, + 0.77 + ], + "angle": 0, + "content": "11. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.771, + 0.785, + 0.799 + ], + "angle": 0, + "content": "12. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems. vol. 33, pp. 6840-6851 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "13. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research pp. 2249-2281 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.325, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.128 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "14. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.785, + 0.217 + ], + "angle": 0, + "content": "15. Huang, L., Chen, D., Liu, Y., Shen, Y., Zhao, D., Zhou, J.: Composer: Creative and controllable image synthesis with composable conditions. arXiv preprint arXiv:2302.09778 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.785, + 0.259 + ], + "angle": 0, + "content": "16. Iqbal, U., Milan, A., Gall, J.: Posetrack: Joint multi-person pose estimation and tracking. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2011-2020 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.26, + 0.785, + 0.3 + ], + "angle": 0, + "content": "17. Ju, X., Zeng, A., Wang, J., Xu, Q., Zhang, L.: Human-art: A versatile human-centric dataset bridging natural and artificial scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.301, + 0.785, + 0.355 + ], + "angle": 0, + "content": "18. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15988-15998 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.356, + 0.785, + 0.398 + ], + "angle": 0, + "content": "19. Kang, M., Zhu, J.Y., Zhang, R., Park, J., Shechtman, E., Paris, S., Park, T.: Scaling up gans for text-to-image synthesis. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10124-10134 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.452 + ], + "angle": 0, + "content": "20. Li, J., Wang, C., Zhu, H., Mao, Y., Fang, H.S., Lu, C.: Crowdpose: Efficient crowded scenes pose estimation and a new benchmark. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10863-10872 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.785, + 0.494 + ], + "angle": 0, + "content": "21. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.785, + 0.55 + ], + "angle": 0, + "content": "22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.785, + 0.577 + ], + "angle": 0, + "content": "23. Luo, S., Tan, Y., Huang, L., Li, J., Zhao, H.: Latent consistency models: Synthesizing high-resolution images with few-step inference (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.785, + 0.605 + ], + "angle": 0, + "content": "24. Lv, W., Xu, S., Zhao, Y., Wang, G., Wei, J., Cui, C., Du, Y., Dang, Q., Liu, Y.: Detrs beat yolos on real-time object detection (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.785, + 0.66 + ], + "angle": 0, + "content": "25. Madhu, P., Villar-Corrales, A., Kosti, R., Bendschus, T., Reinhardt, C., Bell, P., Maier, A., Christlein, V.: Enhancing human pose estimation in ancient vase paintings via perceptually-grounded style transfer learning. ACM Journal on Computing and Cultural Heritage 16(1), 1-17 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.661, + 0.785, + 0.702 + ], + "angle": 0, + "content": "26. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.785, + 0.743 + ], + "angle": 0, + "content": "27. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.785, + 0.799 + ], + "angle": 0, + "content": "28. Narasimhaswamy, S., Nguyen, T., Huang, M., Hoai, M.: Whose hands are these? hand detection and hand-body association in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4889-4899 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.841 + ], + "angle": 0, + "content": "29. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.634, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HumanRefiner" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "30. OpenAI: Improving image generation with better captions (2023), https://cdn.openai.com/papers/dall-e-3.pdf, online; accessed 16-November-2023" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.217 + ], + "angle": 0, + "content": "31. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.785, + 0.258 + ], + "angle": 0, + "content": "32. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.259, + 0.785, + 0.313 + ], + "angle": 0, + "content": "33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.785, + 0.355 + ], + "angle": 0, + "content": "34. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.357, + 0.785, + 0.397 + ], + "angle": 0, + "content": "35. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.438 + ], + "angle": 0, + "content": "36. Redmon, J., Divvala, S., Girshick, R., Farhadi, A.: You only look once: Unified, real-time object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 779-788 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.785, + 0.481 + ], + "angle": 0, + "content": "37. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.481, + 0.785, + 0.535 + ], + "angle": 0, + "content": "38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.785, + 0.59 + ], + "angle": 0, + "content": "39. Saharia, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.591, + 0.785, + 0.632 + ], + "angle": 0, + "content": "40. Sauer, A., Karras, T., Laine, S., Geiger, A., Aila, T.: Stylegan-t: Unlocking the power of gans for fast large-scale text-to-image synthesis. arXiv preprint arXiv:2301.09515 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.785, + 0.659 + ], + "angle": 0, + "content": "41. Schuhmann, C.: Laion-aesthetics predictor v2 (2023), https://laion.ai/blog/laion-aesthetics/, online; accessed 16-November-2023" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.66, + 0.785, + 0.715 + ], + "angle": 0, + "content": "42. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.785, + 0.756 + ], + "angle": 0, + "content": "43. Segmind: Announcing ssd-1b: A leap in efficient t2i generation (2023), https://blog.segmind.com/introducing-segmind-ssd-1b/, online; accessed 16-November-2023" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.785, + 0.811 + ], + "angle": 0, + "content": "44. Shonenkov, A., Konstantinov, M., Bakshandaeva, D., Schuhmann, C., Ivanova, K., Klokova, N.: Deepfloyd if: A powerful text-to-image model that can smartly integrate text into images (2023), https://www deepfloyd.ai/deepfloyd-if, online; accessed 16-November-2023" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.812, + 0.785, + 0.84 + ], + "angle": 0, + "content": "45. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.129 + ], + "angle": 0, + "content": "Fang and Yan et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "46. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 2(3), 5 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.785, + 0.232 + ], + "angle": 0, + "content": "47. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.785, + 0.259 + ], + "angle": 0, + "content": "48. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.259, + 0.785, + 0.3 + ], + "angle": 0, + "content": "49. Zhang, P., Yang, L., Lai, J.H., Xie, X.: Exploring dual-task correlation for pose guided person image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7713-7722 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.785, + 0.356 + ], + "angle": 0, + "content": "50. Zhang, S.H., Li, R., Dong, X., Rosin, P., Cai, Z., Han, X., Yang, D., Huang, H., Hu, S.M.: Pose2seg: Detection free human instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 889-898 (2019)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.356 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_origin.pdf b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bba4ec2126a41415c45d97668091b08f08677760 --- /dev/null +++ b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/170d8e93-dbde-42d0-97c8-a79d33cb94cc_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c7b8091b274a5dba83243d220f537b6dbfd820d0f37740bb56cfe31129557d69 +size 11297810 diff --git a/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/full.md b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/full.md new file mode 100644 index 0000000000000000000000000000000000000000..4b5ca2385c21bd528d51ad018f4a9f6021fd5f9e --- /dev/null +++ b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/full.md @@ -0,0 +1,330 @@ +# HumanRefiner: Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance + +Guian Fang $^{1,\star}$ , Wenbiao Yan $^{4,*}$ , Yuanfan Guo $^{3,*}$ , Jianhua Han $^{3}$ , Zutao Jiang $^{2}$ , Hang Xu $^{3}$ , Shengcai Liao $^{5}$ , and Xiaodan Liang $^{1,2,\star\star}$ + +1 Shenzhen campus of Sun Yat-sen University + +$^{2}$ Mohamed bin Zayed University of Artificial Intelligence + +Huawei Noah's Ark Lab + +$^{4}$ Xi'an Jiaotong University + +5 United Arab Emirates University + +Abstract. Text-to-image diffusion models have significantly advanced in conditional image generation. However, these models usually struggle with accurately rendering images featuring humans, resulting in distorted limbs and other anomalies. This issue primarily stems from the insufficient recognition and evaluation of limb qualities in diffusion models. To address this issue, we introduce AbHuman, the first large-scale synthesized human benchmark focusing on anatomical anomalies. This benchmark consists of 56K synthesized human images, each annotated with detailed, bounding-box level labels identifying 147K human anomalies in 18 different categories. Based on this, the recognition of human anomalies can be established, which in turn enhances image generation through traditional techniques such as negative prompting and guidance. To further boost the improvement, we propose HumanRefiner, a novel plug-and-play approach for the coarse-to-fine refinement of human anomalies in text-to-image generation. Specifically, HumanRefiner utilizes a self-diagnostic procedure to detect and correct issues related to both coarse-grained abnormal human poses and fine-grained anomaly levels, facilitating pose-reversible diffusion generation. Experimental results on the AbHuman benchmark demonstrate that HumanRefiner significantly reduces generative discrepancies, achieving a $2.9\mathrm{x}$ improvement in limb quality compared to the state-of-the-art open-source generator SDXL and a $1.4\mathrm{x}$ improvement over DALL-E 3 in human evaluations. Our AbHuman dataset is available at https://github.com/Enderfga/HumanRefiner. + +Keywords: Text-to-Image Diffusion Model $\cdot$ Abnormal Human Dataset $\cdot$ Human Anomalies Refinement + +# 1 Introduction + +Recent developments in text-to-image diffusion models, as exemplified by SDXL [31], DALL-E 2 [34], and DeepFloyd [31,34,44], have marked significant breakthroughs + +in the generation of high-quality images. These models, benefiting from large-scale pre-training, are capable of generating images for various objects. + +However, generating complex and flexible structures, such as the human body, poses significant challenges for current text-to-image models. As illustrated in Figure 1, common issues with these models include the generation of multiple limbs or abnormal limb details (e.g., irregular fingers). These challenges arise because training focuses on overall characteristics, not detailed ones like the number of fingers or hands. Consequently, models have limited control over the fine-grained generation of detailed body parts and lack the knowledge to distinguish between normal and abnormal human body characteristics. Though such knowledge could be introduced by extra pose condition as indicated in HumanSD [18], Pose-ControlNet [47], T2I-Adapter [27], these models are hard to use because of the requirement of providing extra input. + +Incorrect hand counts Twisted hands Incorrect Limb Position Incorrect leg counts Abnormal hands + +![](images/c49a7f4fb023159fea3ad5f7a6784ce3e0cb5ee0cfbe0c7e482430e5e6bf341c.jpg) +A beautiful ballet dancer is practicing A man doing a trick on a loop + +![](images/2701c2a97841ecab1d8a717fd89a7b7ae8d1aa80d7d4aff35b89c6318f85a75e.jpg) + +![](images/63073063f3a569aa823704988de094fee76e799a558c83fd4dae863274153e48.jpg) +A male dancer in a black outfit + +![](images/174bc9b616db7792fb1a9bf185a887f2f7d96239352e5904ed14fac00b75b1c6.jpg) +A boy is jumping high + +![](images/6eb2e800c8eda46316e73c919d502a81788f4924e5e355a3d698192cf17214d9.jpg) + +![](images/dbb9e277fadd8021cda30442d22d8846d8047ddf71d63b760d2eca59c4c9b79e.jpg) +(a) Human images generated by SDXL +(b) HumanRefiner (ours), based on SDXL + +![](images/4050416c1b35c257415c48ef584db977ba94389170888b26dd96ffd5564be644.jpg) +Fig.1: The synthesis of human images by SOTA text-to-image diffusion model SDXL [31] still presents incorrect limb counts, twisted hands, and incorrect limb position problems. We propose HumanRefiner, a coarse-to-fine self-diagnosis pose/anomaly-reversible generation pipeline built on the AbHuman benchmark to eliminate the anomalies. + +![](images/5907d986974714d4a1ecc6e09da05f41ade3efd064767c6526ef06652aa1fcbf.jpg) + +Therefore, this paper focuses on enhancing the text-to-image diffusion model's understanding of human anomalies and leveraging this knowledge to drive models for generating accurate and realistic human bodies. To address the above challenges, we introduce the first large-scale synthesized human benchmark for anatomical anomalies, named AbHuman. This benchmark comprises 56K synthesized human images, each meticulously annotated with detailed, bounding-box level labels that mark 147K instances of human limbs. Instead of a single "abnormal body" category, these anomalies are categorized into 18 distinct finer + +groups, such as "abnormal/normal head", "abnormal/normal hand", "abnormal/normal foot", etc. + +With the proposed benchmark, it could be directly employed to provide knowledge about human anomalies by abnormal captions derived from the annotation, which can then be integrated into the diffusion model through the conventional negative prompting technique. Another possible way is to develop an Abnormal Scorer, which provides feedback on generated images to distinguish normal/abnormal images. Such a scorer enables quantitative assessment of anomalies in generated images and could provide guidance on anomalies for the text-to-image diffusion process. + +However, these conventional approaches from our AbHuman benchmark do not fully leverage the detailed information available from bounding box-level annotations of human limb anomalies. Therefore, we propose HumanRefiner, a novel and adaptable method for addressing human anomalies that can be integrated with any text-to-image generation model. HumanRefiner goes beyond the typical abnormal guidance and negative prompting by implementing a coarse-to-fine, pose-reversible diffusion generation process. This includes a pose-guided generation for global refinement and anomaly detector-guided inpainting for fine-grained refinement. The detailed anomalies are identified using an abnormal detector train on AbHuman. Experimental results on the benchmark illustrate that HumanRefiner markedly reduces generative discrepancies, achieving a $2.9\times$ improvement in limb quality compared to leading open-source generator SDXL and a $1.4\times$ improvement over DALL-E 3 in human evaluations. In summary, our contributions are threefold: + +- Introduction of AbHuman, the first large-scale benchmark of synthesized humans with anatomical anomalies, which encompasses 56K images, each annotated with detailed, bounding-box level human anomaly labels. +- We propose HumanRefiner, a novel plug-and-play approach for coarse-to-fine refinement of human anomalies via pose-reversible guidance. +- Comprehensive experimental results show that HumanRefiner significantly reduces generative discrepancies compared to SOTA text-to-image models. Human evaluation results indicate a $2.9 \times$ preference for our HumanRefiner in generating high-quality human images compared to SDXL and a $1.4 \times$ preference over DALL-E 3. + +# 2 Related Work + +# 2.1 Text-to-Image/Human Generation + +Text-To-Image Generation. The goal of text-to-image synthesis is to generate realistic images based on given descriptions. Fueled by large-scale image-text datasets [4, 42], various training and inference techniques [12, 13, 45], and advancements in scalability [34], text-to-image models have made significant progress. Existing text-to-image models can be broadly categorized into three + +main approaches: those utilizing diffusion models [2, 11, 29, 34, 37-39], autoregressive models [7, 35, 46], and generative adversarial models [19, 40, 49]. The latest models, such as DALL-E 3 [30], and SDXL [31], have shown substantial improvements in image generation quality. However, the challenge of generating human-like images from text remains difficult due to the diversity of human body poses and insufficient alignment between image and text. Our work focuses on improving the quality of generated human images. + +Text-To-Human Generation. Numerous models have made considerable efforts to enhance the generation quality of realistic human images. They have discovered that injecting additional conditions into diffusion models provides better guidance for human image generation. Models such as [15,27,47] have incorporated additional training modules, introducing human pose conditions to finely control the generation of human images. Additionally, [21] has the capability not only to introduce key points but also to incorporate bounding box detection data. Building upon the introduction of additional poses, [18] has implemented a strategy involving heatmap alignment to achieve higher-quality human images. + +However, existing works dedicated to human generation face two main challenges: (1) the introduction of poses significantly restricts the diversity of generated human poses, and (2) pose conditions still exhibit limitations in addressing fine-grained details of human body parts, such as hands, feet, and facial features. + +Differing from this line of research, HumanRefiner is designed to address the issue of human generation without the requirement of human-provided pose conditions. + +# 2.2 Human Generation Datasets. + +Currently, human datasets primarily consist of two types. The first focuses on authentic depictions of individuals in natural settings, such as human photos and images from human video data [1,6,8,20,22,28,42,50]. These widely available datasets offer abundant human-pose pairs, with annotations limited to key points or bounding boxes. Given that these data are derived from real photos, the humans depicted are inherently natural, without limb anomalies. The second category involves artificial scenes featuring human-like figures in settings such as paintings, cartoons, and similar environments. The Human-Art dataset [17] provides 50,000 images centered around humans, encompassing five natural scenes and fifteen artificial scenes, accompanied by precise pose and text annotations. None of these datasets provide large-scale synthesized images or potential limb abnormal annotations. + +To address the challenge of limb anomalies in the text-driven human image generation task, we have developed a novel AbHuman dataset as a component of this research effort. This dataset serves as a valuable resource for effectively handling limb abnormalities within the context of generating human images from textual descriptions. + +We provide a large-scale dataset of abnormal human images called AbHuman. Firstly, this is the first dataset to focus on limb abnormalities, as existing text-to-human algorithms are primarily based on the MS-COCO [22] and + +LAION-5B [42] datasets. Notably, models trained on real images often face challenges in accurately generating limb abnormalities in humans. To address this issue in general human image generation scenarios, we constructed a new benchmark. Secondly, this dataset collects a significant number of failure cases based on existing generative models. We observed that existing AI-generated human images often feature limb abnormalities, which we filtered, annotated, and analyzed. With the guidance of this dataset, the quality of generative models has been greatly improved. + +# 2.3 Data Collection + +We designed a standardized pipeline for abnormal human limb image collection, including prompt collection, image generation, and abnormal annotation, as shown in Fig. 2. + +![](images/383b94511e62f6e01d253c834e0a9af01ff44e2ed4ecb4121da3b5be962c7594.jpg) +Fig. 2: Data generation pipeline of our AbHuman dataset. + +# 3 The AbHuman Dataset + +- Prompt Collection: Our prompts are derived from three sources: textual descriptions related to humans in the Laion-5B [42], textual descriptions from the Human-Art dataset [17], and prompts generated using ChatGPT 3.5 [3]. To extract text-generating human-related content from the Laion dataset, We used keyword filtering to extract human-related content from the Laion dataset, resulting in 100,000 high-quality textual prompts. Subsequently, we utilized the collected textual content as the foundation of our dataset. +- Image Generation: With the rapid advancements in text-to-image models, the quality of human image generation has significantly improved. However, even state-of-the-art generation models like SDXL [32], Midjourney, and DALL-E 3 [30] encounter issues with limb abnormalities when generating human images. To enhance the quality of human generation using the best existing generation models as a baseline, we employed the SDXL model for generating our images. +- Abnormal Annotation: After collecting a large number of images, a comparative analysis revealed the presence of non-human images within the dataset. Initially, we applied a ResNet50-based classifier to filter all images labeled as "person".After removing low-quality images, trained human + +annotators annotated the remaining 56,000 images. Two human evaluators reviewed the dataset, resulting in a curated AbHuman dataset with 56,000 images and 147,000 annotations. Details of the annotated categories are provided in the appendix. + +- Data Split: The dataset is partitioned into training and testing splits in 4:1, with 52k and 13k image-text pairs, respectively. We further develop a testing split for human evaluation, where prompts are from HumanArt [17], each describing humans performing difficult actions such as acrobatics, dancing, and drama. + +As illustrated in Figure 3, the AbHuman dataset provides bounding boxes and classification information for abnormal humans. Unlike existing keypoint-based annotation methods, the bounding box annotation enables the identification of both the location and type of anomalies in limbs. By detecting and inpainting anomalies in human limbs, our dataset is more conducive to improving generation algorithms. + +![](images/6bea1cfa3b423f2d5fd11b675ef720d79426a02a168a635b3fba0b76e20c666c.jpg) +Fig. 3: The visualization of limb detection in the test set using the fine-tuned AbHuman detection model. Red boxes and labels are used to annotate the abnormal limbs detected, and white boxes and labels are used to annotate the normal limbs detected. + +# 3.1 Dataset Statistics and Analysis + +After reviewing a large number of generated samples, we conducted an analysis of human abnormalities and identified 18 distinct detection classes (e.g., Normal human, Abnormal Head, Abnormal Neck, Abnormal Body, Abnormal Arm, Abnormal Hand...). To illustrate the class distribution of anomalous human samples generated by the SDXL model, we performed a statistical analysis of both anomalous humans and their corresponding annotations. As depicted in Figure 4, the model predominantly generates images with anomalous hands, aligning with the highest count of annotations for hand anomalies. Thus, it is evident that hand anomalies remain a challenge for text-to-image models. Additionally, + +the number of samples with anomalies in the head and foot regions is relatively higher compared to other parts of the human body. + +![](images/dc0a7ce3d17cdc7b27d5e3e8647c85a8daa7a705123a017ea1634b4f76ad710c.jpg) +Fig. 5: Visualization of abnormal scores. red indicates images with high abnormal scores while green indicates images with low abnormal scores. + +![](images/e4c1f6eb8176493109ae410994439485c30e18124668be8dffb404bc5cb5cd77.jpg) +Fig. 4: Ab-human annotations statistics. + +Table 1 illustrates a comparison of datasets concerning human images. Compared to other human datasets [1, 16, 17, 20, 25, 28] that solely annotate images of authentic and normal individuals, existing datasets have limited annotations for genuinely abnormal human limbs. On the contrary, the AbHuman dataset introduces anomalies in human-generated images and provides ample annotations for anomalous body postures. In the context of human-focused tasks such as generation and detection, AbHuman proves to be more suitable. Additionally, compared to datasets with relatively monotonous scenes, AbHuman encompasses a more diverse range of scenarios, enhancing its applicability in various contexts. + +Table 1: Comparison of human-centric datasets, including human generation and detection tasks. AbHuman provides more granular annotation boxes and information to address the abnormality issues in the human generation. + +
DatasetImagesBboxNormalAbnormal-LimbGeneral
BodyHands [28]20K✓✓✗✗
CrowdPose [20]20K✓✓✗✗
Multi-Person PoseTrack [16]23K✓✓✗✗
PoseTrack [1]23K✓✓✗✗
ClassArch [25]1.5K✓✓✗✗
Human-Art [17]50K✓✓✗✓
AbHuman (Ours)56K✓✓✓✓
+ +# 3.2 Abnormal Scorer + +As indicated, the lack of a metric measuring the generated limb quality makes it difficult to (1) quantitatively compare different models; and (2) develop generators for the improvement of limb quality. Based on the proposed AbHuman + +Dataset, we present a quantitative metric of limb anomalies in a generated or real human image. To this end, inspired by the aesthetic scorer based on the Laion dataset [41], we train an Abnormal Scorer $S_{\theta}(\cdot)$ . For the model structure of Abnormal Scorer $S_{\theta}(\cdot)$ , we adhere to the architecture utilized by Aesthetic Scorer [41]. Building upon a pretrained CLIP ViT-Large with patch size of 14 [33] with a hidden dimension of 768, a Multi-Layer Perceptron (MLP) is constructed, as depicted in Table 2. + +Table 2: Model architecture of MLP part of our abnormal scorer. Linear(A, B) means a linear layer with an input feature dimension of A and an output feature dimension of B. Dropout $(\alpha)$ means a dropout layer with the probability of $\alpha$ . + +
Layer index0123
LayerLinear (768, 1024)Dropout (0.2)Linear (1024, 128)Dropout (0.2)
Layer index4567
LayerLinear (128, 64)Dropout (0.1)Linear (64, 16)Linear (16, 1)
+ +Given an image $x \in \mathcal{R}^{3 \times H \times W}$ , the Abnormal Scorer assigns a score $S_{\theta}(x) \in [0,1]$ reflecting the severity of limb aberrations or distortions. Specifically, this model is architecturally based on a Multi-Layer Perceptron (MLP) and is built upon the foundation of the pre-trained CLIP Vision Transformer Large (ViT-L) model [33]. As illustrated in Figure 5, high-scoring images are characterized by pronounced limb distortions or the absence of limbs, whereas images with lower scores correspond to either normal human depictions or non-human subjects. + +# 3.3 Abnormal Detector + +To locate and detect abnormal limbs in human images for subsequent fine-grained refinement, we developed an abnormal limb detector. Specifically, we fine-tuned YOLOv8 [36] and RT-DETR [24] on the training set of AbHuman for 100 epochs. Subsequently, we conduct corresponding detections on the test set, obtaining consistently stable results in the detection of abnormal limbs. Visualization results are provided in Figure 3, showing the capability of identifying abnormal/normal regions and corresponding categories. + +# 4 HumanRefiner + +Based on the trained detector as illustrated in sec 3.3, we can develop a flexible human image synthesis and refinement mechanism, HumanRefiner, which can be integrated into any pipeline for human image generation. As shown in Figure 6, in addition to the basic improvement on generation gained from negative prompting learned from Abnormal Guidance, HumanRefiner performs a coarse-to-fine pose-reversible refinement based on the initially generated images. An off-the-shelf pose detector [6] is employed to inject pose guidance into the + +text-to-image diffusion model, which serves as conditions for coarse refinement of the initial generated image. Then, the Abnormal Detector identifies abnormals that are further rectified through an inpainting diffusion model, refining the remained abnormals at a fine-grained level. + +![](images/992567458f099979b73106a701d6781e6b26a68e241dabc2d0f4b48d047185e3.jpg) +Fig.6: Overview of our HumanRefiner pipeline empowered by the proposed AbHuman benchmark. It consists of a Text-to-Image Diffusion Model trained with negative prompts on the AbHuman benchmark, which generates an initial human image with guidance from Abnormal Scorer, a Coarse-to-Fine Refinement Process where the generated image is globally refined by pose-guided generation and locally refined by detector-guided inpainting. For both the Pose-T2I Adapter [27] and the Inpainting Diffusion models, the Stable Diffusion parameters are adopted from the Text-to-Image model, which was refined through training in the Abnormal Guidance Stage. + +The following sections demonstrate the basic control of human generation from negative prompting and abnormal guidance, followed by the coarse refinement module of pose-guided generation and the fine-grained refinement module of detector-guided inpainting. + +# 4.1 Negative Prompts + +The diffusion model is designed to generate data through a sequence of denoising autoencoders. The Latent Diffusion Model (LDM) [37] conducts the diffusion process with a VAE encoder $\mathcal{E}$ and decoder $\mathcal{D}$ . Given an image $x$ , the forward diffusion process incrementally adds Gaussian noise $\epsilon$ to the latent $z_0 = \mathcal{E}(x)$ following a T-step noise schedule $\{\alpha_t\}_{t=1}^T$ to produce a noisy latent $z_t$ where the noise level increases over timesteps $t$ : + +$$ +z _ {t} = \sqrt {1 - \overline {{\alpha}} _ {t}} z _ {0} + \sqrt {\overline {{\alpha}} _ {t}} \epsilon , \tag {1} +$$ + +where $\epsilon \sim \mathcal{N}(0,I)$ and $\overline{\alpha}_t = \prod_{i=1}^t \alpha_i$ . A text-to-image diffusion model learns a noise predictor $\epsilon_\theta(z_t, t, y)$ conditioned on text $y$ with the objective: + +$$ +L = \mathbb {E} _ {\mathcal {E} (x), y, \epsilon \sim \mathcal {N} (0, 1), t} [ | | \epsilon - \epsilon_ {\theta} (z _ {t}, t, y) | | _ {2} ^ {2} ]. \tag {2} +$$ + +The text condition $y$ ensures that the model's denoising is conditioned and controlled. Consequently, based on our AbHuman Benchmark, we can train the + +Latent Diffusion Model with the abnormal text conditions $y_{a}$ (e.g., Ab. Hand, Ab. Feet...), making the model aware of the abnormal limb information. During the generation process, Classifier-Free Guidance [14] could be applied by using the abnormal text as a negative prompt to eliminate the generation of abnormal limbs: + +$$ +\hat {\epsilon} _ {\theta} (z _ {t}, t, y) = \epsilon_ {\theta} (z _ {t}, t, y _ {a}) + s \cdot (\epsilon_ {\theta} (z _ {t}, t, y) - \epsilon_ {\theta} (z _ {t}, t, y _ {a})), \tag {3} +$$ + +where $s$ is a scaling factor that modulates the influence of the condition. + +# 4.2 Abnormal Guidance + +In addition to adding information on human abnormals through negative prompting, we can introduce a general form of guidance to improve control over the denoising process. As shown in section 3.2, the Abnormal Scorer $S_{\phi}(x)$ gives a score to an image that measures the severity of limb abnormals. This scorer can provide further guidance using a general Classifier Guidance [10]. Specifically, since $\epsilon_{\theta}(z_t,t,y)$ predicts the added noise, we can estimate the clean latent variable $z_0$ by: + +$$ +\hat {z} _ {0} = \frac {z _ {t} - \sqrt {\overline {{\alpha}} _ {t}} \epsilon_ {\theta} (z _ {t} , t , y)}{\sqrt {1 - \overline {{\alpha}} _ {t}}}. \tag {4} +$$ + +After this, we can calculate an estimated abnormal score with $S_{\phi}(\mathcal{D}(\hat{z}_0))$ . Consequently, the noise prediction guided by this method is: + +$$ +\ddot {\epsilon} _ {\theta} \left(z _ {t}, t, y\right) = \epsilon \left(z _ {t}, t, y\right) + \mu \cdot \nabla S _ {\phi} \left(\mathcal {D} \left(\hat {z} _ {0}\right)\right). \tag {5} +$$ + +We can combine classifier-free guidance through negative prompting with abnormal guidance easily by: + +$$ +\begin{array}{l} \hat {\epsilon} _ {t} = \epsilon_ {\theta} \left(z _ {t}, t, y _ {a}\right) + s \cdot \left(\epsilon_ {\theta} \left(z _ {t}, t, y\right) - \epsilon_ {\theta} \left(z _ {t}, t, y _ {a}\right)\right) \tag {6} \\ + \mu \cdot \nabla S _ {\phi} (\mathcal {D} (\hat {z} _ {0})). \\ \end{array} +$$ + +# 4.3 Coarse-to-fine Pose-reversible Guidance + +In contrast to unguided approaches, our HumanRefiner now yields human images with more accurate poses initially. To further enhance the generation quality, we refine the generated image with pose-reversible guidance at both coarse and fine-grained levels. + +Pose-Guided Coarse Refine The abnormal guided text-to-image diffusion model could be combined with off-the-shelf pose detector [6] and T2I-Adapter [27] to further inject global human pose information for pose-guided refinement. For an initially generated image $\hat{x}$ from a guided text-to-image diffusion model, a pose keypoint map $M$ could be detected by a pose detector $M = P_{\psi}(\hat{x})$ . The pose-guided generation could be expanded from the text-to-image diffusion model with T2I-Adapter [27] by injecting the pose condition information into intermediate encoder features: + +$$ +F _ {c} = \mathcal {F} _ {A D} (M), \tag {7} +$$ + +$$ +F _ {e n c} = F _ {e n c} + F _ {c}, \tag {8} +$$ + +where $\mathcal{F}_{AD}$ is T2I-Adapter and $F_{enc}$ is the intermediate feature of the encoder part of $\epsilon_{\theta}(\cdot)$ . Forming the pose conditioned denoising as $\epsilon_{\theta}(z_t,t,y,\mathcal{F}_{AD}(M))$ , the advantage of abnormal guidance and negative prompts could also be integrated as: + +$$ +\begin{array}{l} \hat {\epsilon} _ {t} = \epsilon_ {\theta} \left(z _ {t}, t, y _ {a}\right) + s \cdot \left(\epsilon_ {\theta} \left(z _ {t}, t, y, \mathcal {F} _ {A D} (M)\right) - \epsilon_ {\theta} \left(z _ {t}, t, y _ {a}\right)\right) \tag {9} \\ + \mu \cdot \nabla S _ {\phi} (\mathcal {D} (\hat {z _ {0}})). \\ \end{array} +$$ + +Detector-Guided Inpainting Refine The pose-guided generation refines the initial image in a global view, performing a coarse refinement. Besides, a fine-grained refinement could be established with our abnormal detector providing region-level abnormal information. + +Specifically, for a refined image by applying diffusion denoise process in Eq. (9), $x_{r} = \mathcal{D}(\hat{z}_{0})$ , abnormal detector $D_{Ab}(\cdot)$ outputs a set of $K$ bounding boxes and corresponding categories $\{B_i,C_i\}_{i = 1}^K = D_{Ab}(x_r)$ , where $B_{i} = \{x_{i},y_{i},w_{i},h_{i}\}$ denotes the detected regions, $C_i\in \{0,\dots 17\}$ denoting the detected categories defined in sec 3.1. For detected abnormal classes, the local region $B_{i}$ is inpainted with an input text conditioned on abnormal category $\hat{y} (C_i)$ . The local region in the original image is then pasted by the inpainted output. + +# 5 Experiments + +# 5.1 Implementation Details + +Negative Prompt Fine-tuning: we finetune SDXL [31] released checkpoint at a resolution of $1024 \times 1024$ for 10 epochs with the learning rate of $1.0\mathrm{e} - 5$ on the training split, with a batch size of 32 in total. The images are paired with the original text description followed by abnormal captions (e.g. Ab(hand, Ab.leg). More details can be found in the appendix. + +# 5.2 Quantitative Experiments + +Evaluation Setup We present quantitative comparison with baseline methods including SOTA text-to-image diffusion models SDXL [31], DeepFlyod-IF [44], LCM [23]. For methods require extra pose condition inputs such as HumanSD [18]. Pose-ControlNet [47] and Pose-T2I-Adapter [27], we first generate an initial image from SDXL [31], then generate pose condition from it with pose detector [5], which operates similarly to our pose-guided generation. Test prompts are provided from the AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt). We quantitatively evaluate the generated images with Abnormal Score, CLIP score and FID, respectively. Abnormal Score measures the severity of anomalies. + +Results As indicated in Table 3, HumanRefiner consistently achieves the best performance in terms of Abnormal score, FID, and CLIP score. Furthermore, when compared to Pose-ControlNet [47] and Pose-T2I-Adapter [27] applied on SDXL, HumanRefiner demonstrates a significant improvement, indicating the effectiveness of HumanRefiner on integrating off-the-shelf methods such as pose detectors and T2I-adapter [27]. + +Table 3: Abnormal score, CLIP Score and FID on AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt). + +
DatasetLAIONHumanArt
ModelAbnormal Score ↓CLIP Score↑FID Score↓Abnormal Score↓CLIP Score↑FID Score↓
SSD-1B [43]0.61234.0216.4650.83233.3713.304
PixArt-XL-2-1024-MS [9]0.70134.3219.6040.80732.6815.452
DeepFloyd-IF [44]0.59532.7225.9260.84932.6721.512
LCM [23]0.64432.9925.1750.83132.4021.179
SDXL [32]0.65934.1330.0240.85732.4020.796
Pose-ControlNet [48]0.66333.5115.3680.83831.8813.047
Pose-T2I-Adapter [26]0.62434.7915.6580.80732.7212.582
HumanSD [18]0.66133.7850.5460.80133.0338.032
HumanRefiner (ours)0.59034.8513.6340.77833.909.145
+ +Human Evaluation We conduct a human preference study on generated images with prompts from HumanArt [17], asking 38 users for a preference comparison between DALL-E 3 [30], SDXL [31], and the proposed HumanRefiner. Users compared the images based on fidelity and limb quality. Figure 7 shows that HumanRefiner surpasses DALL-E 3 and SDXL in both fidelity and limb quality for the human generation. For limb quality, HumanRefiner gets $2.9 \times$ preference over SDXL (32.3% vs. 11.20%), and $1.4 \times$ over DALL-E 3 (51.42% vs. 36.03%), indicating that HumanRefiner can generate high-quality human pose. + +![](images/660b91f73803212a9b994c4365361db26b91f5b6d1ca23f7e8f7897ceca44501.jpg) +Fig. 7: Human Evaluation on prompts from HumanArt. The percentage indicates the frequency of human preference. "Tie" means having a similar level of preference. + +Ablation Study We perform a component analysis to assess the contribution of each element utilizing the Abnormal Score as a metric for generation quality, as shown in Table 4. For instance, the incorporation of the negative prompt learned from the AbHuman dataset significantly reduces the Abnormal Score from 0.659 to 0.614. + +Figure 8 shows several ablation experiment findings. The Baseline represents the unaltered output of the SDXL model, while AbnormalGuided and PoseGuided illustrate results achieved through the application of distinct guiding modules. As depicted in the first row of figures, discernible enhancements are observed in the characters' outline. Moreover, the second and fourth rows + +![](images/8e3da9ee72d10939a7cae04955992daff9b21af6d929ad5b6c003d8636e4a770.jpg) +Fig. 8: Visualization outcomes from ablation experiments. + +Table 4: Ablation Study on the proposed components, evaluated on the AbHuman test split (prompts from Laion) with Abnormal score. + +
Negative PromptAbnormal Guidance DetectorInpaintPose GuideAbnormal Score ↓
XXXX0.659
✓XXX0.614
✓✓XX0.605
✓✓✓X0.601
✓✓✓✓0.590
+ +showcase varying degrees of improvement in hand details. Notably, our AbnormalGuided module demonstrates corrective efficacy even in scenes where hand details typically appear blurry. Importantly, the ablation of our AbnormalGuided module mirrors an ablation of the dataset, underscoring the dataset's pivotal role in our approach. + +# 5.3 Qualitative Results + +We also present showcases in the challenging test split, featuring humans engaged in activities such as dancing or performing acrobatics. As illustrated in Figure 9, HumanRefiner exhibits superior limb quality compared to the baseline methods. It accurately captures the human pose, represents natural limb attributes, and presents visually pleasing arrangements. + +![](images/45892b29c2014b416980c03fcd52ba2052e8752fad16c38265dd4a5cc142e385.jpg) +A girl in a pink business suit +Fig. 9: Qualitative comparison with baselines conducted on humans engaged in activity prompts. + +# 6 Conclusion and Future work + +In this paper, we introduce AbHuman, a benchmark including fine-grained annotations of abnormal limbs. AbHuman comprises 56K generated human images along with 147K annotations for abnormal limbs at the bounding box level. Leveraging this benchmark, we construct HumanRefiner, a plug-and-play human refinement module that could be integrated into any text-to-image diffusion model. + +Integraed with abnormal guidance, pose-reversible guidance, and detector-guided inpainting, HumanRefiner identifies abnormal limbs and removes them during the generation process, resulting in high-quality human image synthesis. Quantitative experimental results on the AbHuman test split, along with human evaluation results, demonstrate the superiority of HumanRefiner. We envision that the AbHuman Benchmark will facilitate further exploration of methods in the field of human image generation. + +Limitation and Future Work While HumanRefiner is capable of generating high-quality human images, the process involves dual generation steps and inpainting, resulting in a limited inference speed. Furthermore, the AbHuman Dataset lacks broader scene annotations for normal human images. We would continue to improve the diversity of the AbHuman benchmark. We believe that richer annotations will further enhance the performance of HumanRefiner and foster the development of more effective models. + +# Acknowledgments + +This work was supported in part by National Science and Technology Major Project (2020AAA0109704), National Science and Technology Ministry Youth Talent Funding No. 2022WRQB002, Guangdong Outstanding Youth Fund (Grant No. 2021B1515020061), Mobility Grant Award under Grant No. M-0461, Shenzhen Science and Technology Program (Grant No. GJHZ20220913142600001), Nansha Key RD Program under Grant No.2022ZD014. + +# References + +1. Andriluka, M., Iqbal, U., Insafutdinov, E., Pishchulin, L., Milan, A., Gall, J., Schiele, B.: Posetrack: A benchmark for human pose estimation and tracking. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5167-5176 (2018) +2. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022) +3. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems pp. 1877-1901 (2020) +4. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022) +5. Cao, Z., Hidalgo Martinez, G., Simon, T., Wei, S., Sheikh, Y.A.: Openpose: Realtime multi-person 2d pose estimation using part affinity fields. IEEE Transactions on Pattern Analysis and Machine Intelligence (2019) +6. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017) +7. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M.H., Murphy, K., Freeman, W.T., Rubinstein, M., et al.: Muse: Text-to-image generation via masked generative transformers. arXiv preprint arXiv:2301.00704 (2023) +8. Charles, J., Pfister, T., Magee, D., Hogg, D., Zisserman, A.: Personalizing human video pose estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3063-3072 (2016) +9. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis (2023) +0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis (2021) +11. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106 (2022) +12. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems. vol. 33, pp. 6840-6851 (2020) +13. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research pp. 2249-2281 (2022) + +14. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) +15. Huang, L., Chen, D., Liu, Y., Shen, Y., Zhao, D., Zhou, J.: Composer: Creative and controllable image synthesis with composable conditions. arXiv preprint arXiv:2302.09778 (2023) +16. Iqbal, U., Milan, A., Gall, J.: Posetrack: Joint multi-person pose estimation and tracking. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2011-2020 (2017) +17. Ju, X., Zeng, A., Wang, J., Xu, Q., Zhang, L.: Human-art: A versatile human-centric dataset bridging natural and artificial scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023) +18. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15988-15998 (2023) +19. Kang, M., Zhu, J.Y., Zhang, R., Park, J., Shechtman, E., Paris, S., Park, T.: Scaling up gans for text-to-image synthesis. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10124-10134 (2023) +20. Li, J., Wang, C., Zhu, H., Mao, Y., Fang, H.S., Lu, C.: Crowdpose: Efficient crowded scenes pose estimation and a new benchmark. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10863-10872 (2019) +21. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023) +22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014) +23. Luo, S., Tan, Y., Huang, L., Li, J., Zhao, H.: Latent consistency models: Synthesizing high-resolution images with few-step inference (2023) +24. Lv, W., Xu, S., Zhao, Y., Wang, G., Wei, J., Cui, C., Du, Y., Dang, Q., Liu, Y.: Detrs beat yolos on real-time object detection (2023) +25. Madhu, P., Villar-Corrales, A., Kosti, R., Bendschus, T., Reinhardt, C., Bell, P., Maier, A., Christlein, V.: Enhancing human pose estimation in ancient vase paintings via perceptually-grounded style transfer learning. ACM Journal on Computing and Cultural Heritage 16(1), 1-17 (2022) +26. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023) +27. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023) +28. Narasimhaswamy, S., Nguyen, T., Huang, M., Hoai, M.: Whose hands are these? hand detection and hand-body association in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4889-4899 (2022) +29. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021) + +30. OpenAI: Improving image generation with better captions (2023), https://cdn.openai.com/papers/dall-e-3.pdf, online; accessed 16-November-2023 +31. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023) +32. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023) +33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) +34. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) +35. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021) +36. Redmon, J., Divvala, S., Girshick, R., Farhadi, A.: You only look once: Unified, real-time object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 779-788 (2016) +37. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) +38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) +39. Saharia, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) +40. Sauer, A., Karras, T., Laine, S., Geiger, A., Aila, T.: Stylegan-t: Unlocking the power of gans for fast large-scale text-to-image synthesis. arXiv preprint arXiv:2301.09515 (2023) +41. Schuhmann, C.: Laion-aesthetics predictor v2 (2023), https://laion.ai/blog/laion-aesthetics/, online; accessed 16-November-2023 +42. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022) +43. Segmind: Announcing ssd-1b: A leap in efficient t2i generation (2023), https://blog.segmind.com/introducing-segmind-ssd-1b/, online; accessed 16-November-2023 +44. Shonenkov, A., Konstantinov, M., Bakshandaeva, D., Schuhmann, C., Ivanova, K., Klokova, N.: Deepfloyd if: A powerful text-to-image model that can smartly integrate text into images (2023), https://www deepfloyd.ai/deepfloyd-if, online; accessed 16-November-2023 +45. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) + +46. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 2(3), 5 (2022) +47. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) +48. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023) +49. Zhang, P., Yang, L., Lai, J.H., Xie, X.: Exploring dual-task correlation for pose guided person image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7713-7722 (2022) +50. Zhang, S.H., Li, R., Dong, X., Rosin, P., Cai, Z., Han, X., Yang, D., Huang, H., Hu, S.M.: Pose2seg: Detection free human instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 889-898 (2019) \ No newline at end of file diff --git a/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/images.zip b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..69ca12b0097e3c91ddf4265d36acc6bb9237c033 --- /dev/null +++ b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f6e2a938dad60b0cf27edb84b5bd6f690dd093548b33144262287f0a10dcf408 +size 686805 diff --git a/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/layout.json b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..a5edd94c92e44fb55e04275ce6c2aeac6c7cd6b8 --- /dev/null +++ b/2024/HumanRefiner_ Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance/layout.json @@ -0,0 +1,9176 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 136, + 111, + 479, + 163 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 111, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 136, + 111, + 479, + 163 + ], + "type": "text", + "content": "HumanRefiner: Benchmarking Abnormal Human Generation and Refining with Coarse-to-fine Pose-Reversible Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "spans": [ + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": "Guian Fang" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{1,\\star}" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": ", Wenbiao Yan" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{4,*}" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": ", Yuanfan Guo" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{3,*}" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": ", Jianhua Han" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": ", Zutao Jiang" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": ", Hang Xu" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": ", Shengcai Liao" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{5}" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "text", + "content": ", and Xiaodan Liang" + }, + { + "bbox": [ + 146, + 186, + 467, + 211 + ], + "type": "inline_equation", + "content": "^{1,2,\\star\\star}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 211, + 220, + 401, + 231 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 220, + 401, + 231 + ], + "spans": [ + { + "bbox": [ + 211, + 220, + 401, + 231 + ], + "type": "text", + "content": "1 Shenzhen campus of Sun Yat-sen University" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 189, + 231, + 424, + 242 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 189, + 231, + 424, + 242 + ], + "spans": [ + { + "bbox": [ + 189, + 231, + 424, + 242 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 189, + 231, + 424, + 242 + ], + "type": "text", + "content": " Mohamed bin Zayed University of Artificial Intelligence" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 261, + 242, + 361, + 251 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 242, + 361, + 251 + ], + "spans": [ + { + "bbox": [ + 261, + 242, + 361, + 251 + ], + "type": "text", + "content": "Huawei Noah's Ark Lab" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 250, + 252, + 364, + 263 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 250, + 252, + 364, + 263 + ], + "spans": [ + { + "bbox": [ + 250, + 252, + 364, + 263 + ], + "type": "inline_equation", + "content": "^{4}" + }, + { + "bbox": [ + 250, + 252, + 364, + 263 + ], + "type": "text", + "content": " Xi'an Jiaotong University" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 234, + 263, + 380, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 234, + 263, + 380, + 274 + ], + "spans": [ + { + "bbox": [ + 234, + 263, + 380, + 274 + ], + "type": "text", + "content": "5 United Arab Emirates University" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 290, + 455, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 290, + 455, + 542 + ], + "spans": [ + { + "bbox": [ + 159, + 290, + 455, + 542 + ], + "type": "text", + "content": "Abstract. Text-to-image diffusion models have significantly advanced in conditional image generation. However, these models usually struggle with accurately rendering images featuring humans, resulting in distorted limbs and other anomalies. This issue primarily stems from the insufficient recognition and evaluation of limb qualities in diffusion models. To address this issue, we introduce AbHuman, the first large-scale synthesized human benchmark focusing on anatomical anomalies. This benchmark consists of 56K synthesized human images, each annotated with detailed, bounding-box level labels identifying 147K human anomalies in 18 different categories. Based on this, the recognition of human anomalies can be established, which in turn enhances image generation through traditional techniques such as negative prompting and guidance. To further boost the improvement, we propose HumanRefiner, a novel plug-and-play approach for the coarse-to-fine refinement of human anomalies in text-to-image generation. Specifically, HumanRefiner utilizes a self-diagnostic procedure to detect and correct issues related to both coarse-grained abnormal human poses and fine-grained anomaly levels, facilitating pose-reversible diffusion generation. Experimental results on the AbHuman benchmark demonstrate that HumanRefiner significantly reduces generative discrepancies, achieving a " + }, + { + "bbox": [ + 159, + 290, + 455, + 542 + ], + "type": "inline_equation", + "content": "2.9\\mathrm{x}" + }, + { + "bbox": [ + 159, + 290, + 455, + 542 + ], + "type": "text", + "content": " improvement in limb quality compared to the state-of-the-art open-source generator SDXL and a " + }, + { + "bbox": [ + 159, + 290, + 455, + 542 + ], + "type": "inline_equation", + "content": "1.4\\mathrm{x}" + }, + { + "bbox": [ + 159, + 290, + 455, + 542 + ], + "type": "text", + "content": " improvement over DALL-E 3 in human evaluations. Our AbHuman dataset is available at https://github.com/Enderfga/HumanRefiner." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 160, + 552, + 453, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 552, + 453, + 574 + ], + "spans": [ + { + "bbox": [ + 160, + 552, + 453, + 574 + ], + "type": "text", + "content": "Keywords: Text-to-Image Diffusion Model " + }, + { + "bbox": [ + 160, + 552, + 453, + 574 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 552, + 453, + 574 + ], + "type": "text", + "content": " Abnormal Human Dataset " + }, + { + "bbox": [ + 160, + 552, + 453, + 574 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 552, + 453, + 574 + ], + "type": "text", + "content": " Human Anomalies Refinement" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 591, + 230, + 604 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 591, + 230, + 604 + ], + "spans": [ + { + "bbox": [ + 132, + 591, + 230, + 604 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 613, + 494, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 613, + 494, + 638 + ], + "spans": [ + { + "bbox": [ + 130, + 613, + 494, + 638 + ], + "type": "text", + "content": "Recent developments in text-to-image diffusion models, as exemplified by SDXL [31], DALL-E 2 [34], and DeepFloyd [31,34,44], have marked significant breakthroughs" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 643, + 227, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 643, + 227, + 653 + ], + "spans": [ + { + "bbox": [ + 133, + 643, + 227, + 653 + ], + "type": "text", + "content": "* Equal Contribution." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 654, + 235, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 654, + 235, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 654, + 235, + 665 + ], + "type": "text", + "content": "\\*\\* Corresponding author." + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "in the generation of high-quality images. These models, benefiting from large-scale pre-training, are capable of generating images for various objects." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 481, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 481, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 481, + 272 + ], + "type": "text", + "content": "However, generating complex and flexible structures, such as the human body, poses significant challenges for current text-to-image models. As illustrated in Figure 1, common issues with these models include the generation of multiple limbs or abnormal limb details (e.g., irregular fingers). These challenges arise because training focuses on overall characteristics, not detailed ones like the number of fingers or hands. Consequently, models have limited control over the fine-grained generation of detailed body parts and lack the knowledge to distinguish between normal and abnormal human body characteristics. Though such knowledge could be introduced by extra pose condition as indicated in HumanSD [18], Pose-ControlNet [47], T2I-Adapter [27], these models are hard to use because of the requirement of providing extra input." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 285, + 460, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 460, + 295 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 460, + 295 + ], + "type": "text", + "content": "Incorrect hand counts Twisted hands Incorrect Limb Position Incorrect leg counts Abnormal hands" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 144, + 296, + 227, + 376 + ], + "blocks": [ + { + "bbox": [ + 144, + 296, + 227, + 376 + ], + "lines": [ + { + "bbox": [ + 144, + 296, + 227, + 376 + ], + "spans": [ + { + "bbox": [ + 144, + 296, + 227, + 376 + ], + "type": "image", + "image_path": "c49a7f4fb023159fea3ad5f7a6784ce3e0cb5ee0cfbe0c7e482430e5e6bf341c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 135, + 377, + 307, + 386 + ], + "lines": [ + { + "bbox": [ + 135, + 377, + 307, + 386 + ], + "spans": [ + { + "bbox": [ + 135, + 377, + 307, + 386 + ], + "type": "text", + "content": "A beautiful ballet dancer is practicing A man doing a trick on a loop" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 228, + 296, + 309, + 376 + ], + "blocks": [ + { + "bbox": [ + 228, + 296, + 309, + 376 + ], + "lines": [ + { + "bbox": [ + 228, + 296, + 309, + 376 + ], + "spans": [ + { + "bbox": [ + 228, + 296, + 309, + 376 + ], + "type": "image", + "image_path": "2701c2a97841ecab1d8a717fd89a7b7ae8d1aa80d7d4aff35b89c6318f85a75e.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 310, + 296, + 392, + 376 + ], + "blocks": [ + { + "bbox": [ + 310, + 296, + 392, + 376 + ], + "lines": [ + { + "bbox": [ + 310, + 296, + 392, + 376 + ], + "spans": [ + { + "bbox": [ + 310, + 296, + 392, + 376 + ], + "type": "image", + "image_path": "63073063f3a569aa823704988de094fee76e799a558c83fd4dae863274153e48.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 312, + 377, + 391, + 385 + ], + "lines": [ + { + "bbox": [ + 312, + 377, + 391, + 385 + ], + "spans": [ + { + "bbox": [ + 312, + 377, + 391, + 385 + ], + "type": "text", + "content": "A male dancer in a black outfit" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 393, + 296, + 476, + 376 + ], + "blocks": [ + { + "bbox": [ + 393, + 296, + 476, + 376 + ], + "lines": [ + { + "bbox": [ + 393, + 296, + 476, + 376 + ], + "spans": [ + { + "bbox": [ + 393, + 296, + 476, + 376 + ], + "type": "image", + "image_path": "174bc9b616db7792fb1a9bf185a887f2f7d96239352e5904ed14fac00b75b1c6.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 406, + 377, + 463, + 385 + ], + "lines": [ + { + "bbox": [ + 406, + 377, + 463, + 385 + ], + "spans": [ + { + "bbox": [ + 406, + 377, + 463, + 385 + ], + "type": "text", + "content": "A boy is jumping high" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 144, + 398, + 227, + 479 + ], + "blocks": [ + { + "bbox": [ + 144, + 398, + 227, + 479 + ], + "lines": [ + { + "bbox": [ + 144, + 398, + 227, + 479 + ], + "spans": [ + { + "bbox": [ + 144, + 398, + 227, + 479 + ], + "type": "image", + "image_path": "6eb2e800c8eda46316e73c919d502a81788f4924e5e355a3d698192cf17214d9.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 228, + 398, + 309, + 479 + ], + "blocks": [ + { + "bbox": [ + 241, + 387, + 374, + 396 + ], + "lines": [ + { + "bbox": [ + 241, + 387, + 374, + 396 + ], + "spans": [ + { + "bbox": [ + 241, + 387, + 374, + 396 + ], + "type": "text", + "content": "(a) Human images generated by SDXL" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 228, + 398, + 309, + 479 + ], + "lines": [ + { + "bbox": [ + 228, + 398, + 309, + 479 + ], + "spans": [ + { + "bbox": [ + 228, + 398, + 309, + 479 + ], + "type": "image", + "image_path": "dbb9e277fadd8021cda30442d22d8846d8047ddf71d63b760d2eca59c4c9b79e.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 240, + 481, + 385, + 491 + ], + "lines": [ + { + "bbox": [ + 240, + 481, + 385, + 491 + ], + "spans": [ + { + "bbox": [ + 240, + 481, + 385, + 491 + ], + "type": "text", + "content": "(b) HumanRefiner (ours), based on SDXL" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 310, + 398, + 392, + 479 + ], + "blocks": [ + { + "bbox": [ + 310, + 398, + 392, + 479 + ], + "lines": [ + { + "bbox": [ + 310, + 398, + 392, + 479 + ], + "spans": [ + { + "bbox": [ + 310, + 398, + 392, + 479 + ], + "type": "image", + "image_path": "4050416c1b35c257415c48ef584db977ba94389170888b26dd96ffd5564be644.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 500, + 482, + 555 + ], + "lines": [ + { + "bbox": [ + 130, + 500, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 500, + 482, + 555 + ], + "type": "text", + "content": "Fig.1: The synthesis of human images by SOTA text-to-image diffusion model SDXL [31] still presents incorrect limb counts, twisted hands, and incorrect limb position problems. We propose HumanRefiner, a coarse-to-fine self-diagnosis pose/anomaly-reversible generation pipeline built on the AbHuman benchmark to eliminate the anomalies." + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 393, + 398, + 476, + 479 + ], + "blocks": [ + { + "bbox": [ + 393, + 398, + 476, + 479 + ], + "lines": [ + { + "bbox": [ + 393, + 398, + 476, + 479 + ], + "spans": [ + { + "bbox": [ + 393, + 398, + 476, + 479 + ], + "type": "image", + "image_path": "5907d986974714d4a1ecc6e09da05f41ade3efd064767c6526ef06652aa1fcbf.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "Therefore, this paper focuses on enhancing the text-to-image diffusion model's understanding of human anomalies and leveraging this knowledge to drive models for generating accurate and realistic human bodies. To address the above challenges, we introduce the first large-scale synthesized human benchmark for anatomical anomalies, named AbHuman. This benchmark comprises 56K synthesized human images, each meticulously annotated with detailed, bounding-box level labels that mark 147K instances of human limbs. Instead of a single \"abnormal body\" category, these anomalies are categorized into 18 distinct finer" + } + ] + } + ], + "index": 19 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "groups, such as \"abnormal/normal head\", \"abnormal/normal hand\", \"abnormal/normal foot\", etc." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "type": "text", + "content": "With the proposed benchmark, it could be directly employed to provide knowledge about human anomalies by abnormal captions derived from the annotation, which can then be integrated into the diffusion model through the conventional negative prompting technique. Another possible way is to develop an Abnormal Scorer, which provides feedback on generated images to distinguish normal/abnormal images. Such a scorer enables quantitative assessment of anomalies in generated images and could provide guidance on anomalies for the text-to-image diffusion process." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 237, + 482, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 237, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 482, + 403 + ], + "type": "text", + "content": "However, these conventional approaches from our AbHuman benchmark do not fully leverage the detailed information available from bounding box-level annotations of human limb anomalies. Therefore, we propose HumanRefiner, a novel and adaptable method for addressing human anomalies that can be integrated with any text-to-image generation model. HumanRefiner goes beyond the typical abnormal guidance and negative prompting by implementing a coarse-to-fine, pose-reversible diffusion generation process. This includes a pose-guided generation for global refinement and anomaly detector-guided inpainting for fine-grained refinement. The detailed anomalies are identified using an abnormal detector train on AbHuman. Experimental results on the benchmark illustrate that HumanRefiner markedly reduces generative discrepancies, achieving a " + }, + { + "bbox": [ + 130, + 237, + 482, + 403 + ], + "type": "inline_equation", + "content": "2.9\\times" + }, + { + "bbox": [ + 130, + 237, + 482, + 403 + ], + "type": "text", + "content": " improvement in limb quality compared to leading open-source generator SDXL and a " + }, + { + "bbox": [ + 130, + 237, + 482, + 403 + ], + "type": "inline_equation", + "content": "1.4\\times" + }, + { + "bbox": [ + 130, + 237, + 482, + 403 + ], + "type": "text", + "content": " improvement over DALL-E 3 in human evaluations. In summary, our contributions are threefold:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 414, + 479, + 532 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 137, + 414, + 479, + 447 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 414, + 479, + 447 + ], + "spans": [ + { + "bbox": [ + 137, + 414, + 479, + 447 + ], + "type": "text", + "content": "- Introduction of AbHuman, the first large-scale benchmark of synthesized humans with anatomical anomalies, which encompasses 56K images, each annotated with detailed, bounding-box level human anomaly labels." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 137, + 450, + 479, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 450, + 479, + 472 + ], + "spans": [ + { + "bbox": [ + 137, + 450, + 479, + 472 + ], + "type": "text", + "content": "- We propose HumanRefiner, a novel plug-and-play approach for coarse-to-fine refinement of human anomalies via pose-reversible guidance." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 137, + 475, + 479, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 475, + 479, + 532 + ], + "spans": [ + { + "bbox": [ + 137, + 475, + 479, + 532 + ], + "type": "text", + "content": "- Comprehensive experimental results show that HumanRefiner significantly reduces generative discrepancies compared to SOTA text-to-image models. Human evaluation results indicate a " + }, + { + "bbox": [ + 137, + 475, + 479, + 532 + ], + "type": "inline_equation", + "content": "2.9 \\times" + }, + { + "bbox": [ + 137, + 475, + 479, + 532 + ], + "type": "text", + "content": " preference for our HumanRefiner in generating high-quality human images compared to SDXL and a " + }, + { + "bbox": [ + 137, + 475, + 479, + 532 + ], + "type": "inline_equation", + "content": "1.4 \\times" + }, + { + "bbox": [ + 137, + 475, + 479, + 532 + ], + "type": "text", + "content": " preference over DALL-E 3." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 555, + 237, + 567 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 237, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 237, + 567 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 583, + 334, + 595 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 583, + 334, + 595 + ], + "spans": [ + { + "bbox": [ + 131, + 583, + 334, + 595 + ], + "type": "text", + "content": "2.1 Text-to-Image/Human Generation" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "content": "Text-To-Image Generation. The goal of text-to-image synthesis is to generate realistic images based on given descriptions. Fueled by large-scale image-text datasets [4, 42], various training and inference techniques [12, 13, 45], and advancements in scalability [34], text-to-image models have made significant progress. Existing text-to-image models can be broadly categorized into three" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 199 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 199 + ], + "type": "text", + "content": "main approaches: those utilizing diffusion models [2, 11, 29, 34, 37-39], autoregressive models [7, 35, 46], and generative adversarial models [19, 40, 49]. The latest models, such as DALL-E 3 [30], and SDXL [31], have shown substantial improvements in image generation quality. However, the challenge of generating human-like images from text remains difficult due to the diversity of human body poses and insufficient alignment between image and text. Our work focuses on improving the quality of generated human images." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 200, + 480, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 480, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 480, + 307 + ], + "type": "text", + "content": "Text-To-Human Generation. Numerous models have made considerable efforts to enhance the generation quality of realistic human images. They have discovered that injecting additional conditions into diffusion models provides better guidance for human image generation. Models such as [15,27,47] have incorporated additional training modules, introducing human pose conditions to finely control the generation of human images. Additionally, [21] has the capability not only to introduce key points but also to incorporate bounding box detection data. Building upon the introduction of additional poses, [18] has implemented a strategy involving heatmap alignment to achieve higher-quality human images." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 308, + 480, + 354 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 480, + 354 + ], + "type": "text", + "content": "However, existing works dedicated to human generation face two main challenges: (1) the introduction of poses significantly restricts the diversity of generated human poses, and (2) pose conditions still exhibit limitations in addressing fine-grained details of human body parts, such as hands, feet, and facial features." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 356, + 481, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 356, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 356, + 481, + 390 + ], + "type": "text", + "content": "Differing from this line of research, HumanRefiner is designed to address the issue of human generation without the requirement of human-provided pose conditions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 407, + 307, + 418 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 307, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 307, + 418 + ], + "type": "text", + "content": "2.2 Human Generation Datasets." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 426, + 480, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 480, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 480, + 568 + ], + "type": "text", + "content": "Currently, human datasets primarily consist of two types. The first focuses on authentic depictions of individuals in natural settings, such as human photos and images from human video data [1,6,8,20,22,28,42,50]. These widely available datasets offer abundant human-pose pairs, with annotations limited to key points or bounding boxes. Given that these data are derived from real photos, the humans depicted are inherently natural, without limb anomalies. The second category involves artificial scenes featuring human-like figures in settings such as paintings, cartoons, and similar environments. The Human-Art dataset [17] provides 50,000 images centered around humans, encompassing five natural scenes and fifteen artificial scenes, accompanied by precise pose and text annotations. None of these datasets provide large-scale synthesized images or potential limb abnormal annotations." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 570, + 480, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 480, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 480, + 629 + ], + "type": "text", + "content": "To address the challenge of limb anomalies in the text-driven human image generation task, we have developed a novel AbHuman dataset as a component of this research effort. This dataset serves as a valuable resource for effectively handling limb abnormalities within the context of generating human images from textual descriptions." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "content": "We provide a large-scale dataset of abnormal human images called AbHuman. Firstly, this is the first dataset to focus on limb abnormalities, as existing text-to-human algorithms are primarily based on the MS-COCO [22] and" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": "LAION-5B [42] datasets. Notably, models trained on real images often face challenges in accurately generating limb abnormalities in humans. To address this issue in general human image generation scenarios, we constructed a new benchmark. Secondly, this dataset collects a significant number of failure cases based on existing generative models. We observed that existing AI-generated human images often feature limb abnormalities, which we filtered, annotated, and analyzed. With the guidance of this dataset, the quality of generative models has been greatly improved." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 228, + 240, + 239 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 228, + 240, + 239 + ], + "spans": [ + { + "bbox": [ + 131, + 228, + 240, + 239 + ], + "type": "text", + "content": "2.3 Data Collection" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 246, + 479, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 246, + 479, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 246, + 479, + 282 + ], + "type": "text", + "content": "We designed a standardized pipeline for abnormal human limb image collection, including prompt collection, image generation, and abnormal annotation, as shown in Fig. 2." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 136, + 295, + 478, + 375 + ], + "blocks": [ + { + "bbox": [ + 136, + 295, + 478, + 375 + ], + "lines": [ + { + "bbox": [ + 136, + 295, + 478, + 375 + ], + "spans": [ + { + "bbox": [ + 136, + 295, + 478, + 375 + ], + "type": "image", + "image_path": "383b94511e62f6e01d253c834e0a9af01ff44e2ed4ecb4121da3b5be962c7594.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 186, + 385, + 425, + 396 + ], + "lines": [ + { + "bbox": [ + 186, + 385, + 425, + 396 + ], + "spans": [ + { + "bbox": [ + 186, + 385, + 425, + 396 + ], + "type": "text", + "content": "Fig. 2: Data generation pipeline of our AbHuman dataset." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 428, + 293, + 441 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 428, + 293, + 441 + ], + "spans": [ + { + "bbox": [ + 131, + 428, + 293, + 441 + ], + "type": "text", + "content": "3 The AbHuman Dataset" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 137, + 451, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 138, + 451, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 451, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 451, + 482, + 533 + ], + "type": "text", + "content": "- Prompt Collection: Our prompts are derived from three sources: textual descriptions related to humans in the Laion-5B [42], textual descriptions from the Human-Art dataset [17], and prompts generated using ChatGPT 3.5 [3]. To extract text-generating human-related content from the Laion dataset, We used keyword filtering to extract human-related content from the Laion dataset, resulting in 100,000 high-quality textual prompts. Subsequently, we utilized the collected textual content as the foundation of our dataset." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 137, + 534, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 534, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 137, + 534, + 482, + 617 + ], + "type": "text", + "content": "- Image Generation: With the rapid advancements in text-to-image models, the quality of human image generation has significantly improved. However, even state-of-the-art generation models like SDXL [32], Midjourney, and DALL-E 3 [30] encounter issues with limb abnormalities when generating human images. To enhance the quality of human generation using the best existing generation models as a baseline, we employed the SDXL model for generating our images." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 137, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 137, + 617, + 482, + 666 + ], + "type": "text", + "content": "- Abnormal Annotation: After collecting a large number of images, a comparative analysis revealed the presence of non-human images within the dataset. Initially, we applied a ResNet50-based classifier to filter all images labeled as \"person\".After removing low-quality images, trained human" + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 147, + 116, + 481, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 116, + 481, + 163 + ], + "spans": [ + { + "bbox": [ + 147, + 116, + 481, + 163 + ], + "type": "text", + "content": "annotators annotated the remaining 56,000 images. Two human evaluators reviewed the dataset, resulting in a curated AbHuman dataset with 56,000 images and 147,000 annotations. Details of the annotated categories are provided in the appendix." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 164, + 481, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 164, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 138, + 164, + 481, + 224 + ], + "type": "text", + "content": "- Data Split: The dataset is partitioned into training and testing splits in 4:1, with 52k and 13k image-text pairs, respectively. We further develop a testing split for human evaluation, where prompts are from HumanArt [17], each describing humans performing difficult actions such as acrobatics, dancing, and drama." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 234, + 479, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 234, + 479, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 234, + 479, + 307 + ], + "type": "text", + "content": "As illustrated in Figure 3, the AbHuman dataset provides bounding boxes and classification information for abnormal humans. Unlike existing keypoint-based annotation methods, the bounding box annotation enables the identification of both the location and type of anomalies in limbs. By detecting and inpainting anomalies in human limbs, our dataset is more conducive to improving generation algorithms." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 133, + 321, + 481, + 462 + ], + "blocks": [ + { + "bbox": [ + 133, + 321, + 481, + 462 + ], + "lines": [ + { + "bbox": [ + 133, + 321, + 481, + 462 + ], + "spans": [ + { + "bbox": [ + 133, + 321, + 481, + 462 + ], + "type": "image", + "image_path": "6bea1cfa3b423f2d5fd11b675ef720d79426a02a168a635b3fba0b76e20c666c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 469, + 482, + 504 + ], + "lines": [ + { + "bbox": [ + 130, + 469, + 482, + 504 + ], + "spans": [ + { + "bbox": [ + 130, + 469, + 482, + 504 + ], + "type": "text", + "content": "Fig. 3: The visualization of limb detection in the test set using the fine-tuned AbHuman detection model. Red boxes and labels are used to annotate the abnormal limbs detected, and white boxes and labels are used to annotate the normal limbs detected." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 536, + 317, + 550 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 536, + 317, + 550 + ], + "spans": [ + { + "bbox": [ + 132, + 536, + 317, + 550 + ], + "type": "text", + "content": "3.1 Dataset Statistics and Analysis" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "After reviewing a large number of generated samples, we conducted an analysis of human abnormalities and identified 18 distinct detection classes (e.g., Normal human, Abnormal Head, Abnormal Neck, Abnormal Body, Abnormal Arm, Abnormal Hand...). To illustrate the class distribution of anomalous human samples generated by the SDXL model, we performed a statistical analysis of both anomalous humans and their corresponding annotations. As depicted in Figure 4, the model predominantly generates images with anomalous hands, aligning with the highest count of annotations for hand anomalies. Thus, it is evident that hand anomalies remain a challenge for text-to-image models. Additionally," + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "the number of samples with anomalies in the head and foot regions is relatively higher compared to other parts of the human body." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 140, + 182, + 302, + 269 + ], + "blocks": [ + { + "bbox": [ + 140, + 182, + 302, + 269 + ], + "lines": [ + { + "bbox": [ + 140, + 182, + 302, + 269 + ], + "spans": [ + { + "bbox": [ + 140, + 182, + 302, + 269 + ], + "type": "image", + "image_path": "dc0a7ce3d17cdc7b27d5e3e8647c85a8daa7a705123a017ea1634b4f76ad710c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 266, + 482, + 310 + ], + "lines": [ + { + "bbox": [ + 304, + 266, + 482, + 310 + ], + "spans": [ + { + "bbox": [ + 304, + 266, + 482, + 310 + ], + "type": "text", + "content": "Fig. 5: Visualization of abnormal scores. red indicates images with high abnormal scores while green indicates images with low abnormal scores." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 306, + 160, + 482, + 259 + ], + "blocks": [ + { + "bbox": [ + 136, + 278, + 303, + 289 + ], + "lines": [ + { + "bbox": [ + 136, + 278, + 303, + 289 + ], + "spans": [ + { + "bbox": [ + 136, + 278, + 303, + 289 + ], + "type": "text", + "content": "Fig. 4: Ab-human annotations statistics." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 306, + 160, + 482, + 259 + ], + "lines": [ + { + "bbox": [ + 306, + 160, + 482, + 259 + ], + "spans": [ + { + "bbox": [ + 306, + 160, + 482, + 259 + ], + "type": "image", + "image_path": "e4c1f6eb8176493109ae410994439485c30e18124668be8dffb404bc5cb5cd77.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 327, + 482, + 436 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 327, + 482, + 436 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 482, + 436 + ], + "type": "text", + "content": "Table 1 illustrates a comparison of datasets concerning human images. Compared to other human datasets [1, 16, 17, 20, 25, 28] that solely annotate images of authentic and normal individuals, existing datasets have limited annotations for genuinely abnormal human limbs. On the contrary, the AbHuman dataset introduces anomalies in human-generated images and provides ample annotations for anomalous body postures. In the context of human-focused tasks such as generation and detection, AbHuman proves to be more suitable. Additionally, compared to datasets with relatively monotonous scenes, AbHuman encompasses a more diverse range of scenarios, enhancing its applicability in various contexts." + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 171, + 494, + 440, + 577 + ], + "blocks": [ + { + "bbox": [ + 131, + 450, + 482, + 485 + ], + "lines": [ + { + "bbox": [ + 131, + 450, + 482, + 485 + ], + "spans": [ + { + "bbox": [ + 131, + 450, + 482, + 485 + ], + "type": "text", + "content": "Table 1: Comparison of human-centric datasets, including human generation and detection tasks. AbHuman provides more granular annotation boxes and information to address the abnormality issues in the human generation." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 171, + 494, + 440, + 577 + ], + "lines": [ + { + "bbox": [ + 171, + 494, + 440, + 577 + ], + "spans": [ + { + "bbox": [ + 171, + 494, + 440, + 577 + ], + "type": "table", + "html": "
DatasetImagesBboxNormalAbnormal-LimbGeneral
BodyHands [28]20K✓✓✗✗
CrowdPose [20]20K✓✓✗✗
Multi-Person PoseTrack [16]23K✓✓✗✗
PoseTrack [1]23K✓✓✗✗
ClassArch [25]1.5K✓✓✗✗
Human-Art [17]50K✓✓✗✓
AbHuman (Ours)56K✓✓✓✓
", + "image_path": "6e00c73bea04493f0acd616d423eba944c08c0f1f711e954d3d7d8f2160b7c41.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 609, + 249, + 620 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 249, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 249, + 620 + ], + "type": "text", + "content": "3.2 Abnormal Scorer" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "As indicated, the lack of a metric measuring the generated limb quality makes it difficult to (1) quantitatively compare different models; and (2) develop generators for the improvement of limb quality. Based on the proposed AbHuman" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "Dataset, we present a quantitative metric of limb anomalies in a generated or real human image. To this end, inspired by the aesthetic scorer based on the Laion dataset [41], we train an Abnormal Scorer " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "S_{\\theta}(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": ". For the model structure of Abnormal Scorer " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "S_{\\theta}(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": ", we adhere to the architecture utilized by Aesthetic Scorer [41]. Building upon a pretrained CLIP ViT-Large with patch size of 14 [33] with a hidden dimension of 768, a Multi-Layer Perceptron (MLP) is constructed, as depicted in Table 2." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 164, + 264, + 447, + 306 + ], + "blocks": [ + { + "bbox": [ + 130, + 220, + 482, + 255 + ], + "lines": [ + { + "bbox": [ + 130, + 220, + 482, + 255 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 482, + 255 + ], + "type": "text", + "content": "Table 2: Model architecture of MLP part of our abnormal scorer. Linear(A, B) means a linear layer with an input feature dimension of A and an output feature dimension of B. Dropout " + }, + { + "bbox": [ + 130, + 220, + 482, + 255 + ], + "type": "inline_equation", + "content": "(\\alpha)" + }, + { + "bbox": [ + 130, + 220, + 482, + 255 + ], + "type": "text", + "content": " means a dropout layer with the probability of " + }, + { + "bbox": [ + 130, + 220, + 482, + 255 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 220, + 482, + 255 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 164, + 264, + 447, + 306 + ], + "lines": [ + { + "bbox": [ + 164, + 264, + 447, + 306 + ], + "spans": [ + { + "bbox": [ + 164, + 264, + 447, + 306 + ], + "type": "table", + "html": "
Layer index0123
LayerLinear (768, 1024)Dropout (0.2)Linear (1024, 128)Dropout (0.2)
Layer index4567
LayerLinear (128, 64)Dropout (0.1)Linear (64, 16)Linear (16, 1)
", + "image_path": "ecb11919fad2f1b4a4708eb707f3542827d70c7e2632acb5aa45d859a752922f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 328, + 482, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 328, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 328, + 482, + 413 + ], + "type": "text", + "content": "Given an image " + }, + { + "bbox": [ + 130, + 328, + 482, + 413 + ], + "type": "inline_equation", + "content": "x \\in \\mathcal{R}^{3 \\times H \\times W}" + }, + { + "bbox": [ + 130, + 328, + 482, + 413 + ], + "type": "text", + "content": ", the Abnormal Scorer assigns a score " + }, + { + "bbox": [ + 130, + 328, + 482, + 413 + ], + "type": "inline_equation", + "content": "S_{\\theta}(x) \\in [0,1]" + }, + { + "bbox": [ + 130, + 328, + 482, + 413 + ], + "type": "text", + "content": " reflecting the severity of limb aberrations or distortions. Specifically, this model is architecturally based on a Multi-Layer Perceptron (MLP) and is built upon the foundation of the pre-trained CLIP Vision Transformer Large (ViT-L) model [33]. As illustrated in Figure 5, high-scoring images are characterized by pronounced limb distortions or the absence of limbs, whereas images with lower scores correspond to either normal human depictions or non-human subjects." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 431, + 259, + 442 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 431, + 259, + 442 + ], + "spans": [ + { + "bbox": [ + 131, + 431, + 259, + 442 + ], + "type": "text", + "content": "3.3 Abnormal Detector" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 452, + 482, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 452, + 482, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 452, + 482, + 536 + ], + "type": "text", + "content": "To locate and detect abnormal limbs in human images for subsequent fine-grained refinement, we developed an abnormal limb detector. Specifically, we fine-tuned YOLOv8 [36] and RT-DETR [24] on the training set of AbHuman for 100 epochs. Subsequently, we conduct corresponding detections on the test set, obtaining consistently stable results in the detection of abnormal limbs. Visualization results are provided in Figure 3, showing the capability of identifying abnormal/normal regions and corresponding categories." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 555, + 242, + 568 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 555, + 242, + 568 + ], + "spans": [ + { + "bbox": [ + 131, + 555, + 242, + 568 + ], + "type": "text", + "content": "4 HumanRefiner" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 581, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 667 + ], + "type": "text", + "content": "Based on the trained detector as illustrated in sec 3.3, we can develop a flexible human image synthesis and refinement mechanism, HumanRefiner, which can be integrated into any pipeline for human image generation. As shown in Figure 6, in addition to the basic improvement on generation gained from negative prompting learned from Abnormal Guidance, HumanRefiner performs a coarse-to-fine pose-reversible refinement based on the initially generated images. An off-the-shelf pose detector [6] is employed to inject pose guidance into the" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": "text-to-image diffusion model, which serves as conditions for coarse refinement of the initial generated image. Then, the Abnormal Detector identifies abnormals that are further rectified through an inpainting diffusion model, refining the remained abnormals at a fine-grained level." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 135, + 184, + 482, + 300 + ], + "blocks": [ + { + "bbox": [ + 135, + 184, + 482, + 300 + ], + "lines": [ + { + "bbox": [ + 135, + 184, + 482, + 300 + ], + "spans": [ + { + "bbox": [ + 135, + 184, + 482, + 300 + ], + "type": "image", + "image_path": "992567458f099979b73106a701d6781e6b26a68e241dabc2d0f4b48d047185e3.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 300, + 482, + 389 + ], + "lines": [ + { + "bbox": [ + 130, + 300, + 482, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 482, + 389 + ], + "type": "text", + "content": "Fig.6: Overview of our HumanRefiner pipeline empowered by the proposed AbHuman benchmark. It consists of a Text-to-Image Diffusion Model trained with negative prompts on the AbHuman benchmark, which generates an initial human image with guidance from Abnormal Scorer, a Coarse-to-Fine Refinement Process where the generated image is globally refined by pose-guided generation and locally refined by detector-guided inpainting. For both the Pose-T2I Adapter [27] and the Inpainting Diffusion models, the Stable Diffusion parameters are adopted from the Text-to-Image model, which was refined through training in the Abnormal Guidance Stage." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 403, + 482, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 453 + ], + "type": "text", + "content": "The following sections demonstrate the basic control of human generation from negative prompting and abnormal guidance, followed by the coarse refinement module of pose-guided generation and the fine-grained refinement module of detector-guided inpainting." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 468, + 253, + 480 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 253, + 480 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 253, + 480 + ], + "type": "text", + "content": "4.1 Negative Prompts" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": "The diffusion model is designed to generate data through a sequence of denoising autoencoders. The Latent Diffusion Model (LDM) [37] conducts the diffusion process with a VAE encoder " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": " and decoder " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": ". Given an image " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": ", the forward diffusion process incrementally adds Gaussian noise " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": " to the latent " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "z_0 = \\mathcal{E}(x)" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": " following a T-step noise schedule " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\{\\alpha_t\\}_{t=1}^T" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": " to produce a noisy latent " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "z_t" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": " where the noise level increases over timesteps " + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 487, + 482, + 559 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 253, + 566, + 481, + 581 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 566, + 481, + 581 + ], + "spans": [ + { + "bbox": [ + 253, + 566, + 481, + 581 + ], + "type": "interline_equation", + "content": "z _ {t} = \\sqrt {1 - \\overline {{\\alpha}} _ {t}} z _ {0} + \\sqrt {\\overline {{\\alpha}} _ {t}} \\epsilon , \\tag {1}", + "image_path": "037bae0ba502c22215d2076fb31c5bdde8b45e8b82c8b344a9ab8399a985aaa0.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "spans": [ + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "inline_equation", + "content": "\\epsilon \\sim \\mathcal{N}(0,I)" + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "inline_equation", + "content": "\\overline{\\alpha}_t = \\prod_{i=1}^t \\alpha_i" + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "text", + "content": ". A text-to-image diffusion model learns a noise predictor " + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "inline_equation", + "content": "\\epsilon_\\theta(z_t, t, y)" + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "text", + "content": " conditioned on text " + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 587, + 481, + 613 + ], + "type": "text", + "content": " with the objective:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 217, + 620, + 481, + 634 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 620, + 481, + 634 + ], + "spans": [ + { + "bbox": [ + 217, + 620, + 481, + 634 + ], + "type": "interline_equation", + "content": "L = \\mathbb {E} _ {\\mathcal {E} (x), y, \\epsilon \\sim \\mathcal {N} (0, 1), t} [ | | \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, y) | | _ {2} ^ {2} ]. \\tag {2}", + "image_path": "dff5c5cf320f25ea196c34ba11b2ed0dd85bb2638ef4efe7a97d1aa6426202a5.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "The text condition " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": " ensures that the model's denoising is conditioned and controlled. Consequently, based on our AbHuman Benchmark, we can train the" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "text", + "content": "Latent Diffusion Model with the abnormal text conditions " + }, + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "inline_equation", + "content": "y_{a}" + }, + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "text", + "content": " (e.g., Ab. Hand, Ab. Feet...), making the model aware of the abnormal limb information. During the generation process, Classifier-Free Guidance [14] could be applied by using the abnormal text as a negative prompt to eliminate the generation of abnormal limbs:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 188, + 178, + 481, + 190 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 188, + 178, + 481, + 190 + ], + "spans": [ + { + "bbox": [ + 188, + 178, + 481, + 190 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} _ {\\theta} (z _ {t}, t, y) = \\epsilon_ {\\theta} (z _ {t}, t, y _ {a}) + s \\cdot (\\epsilon_ {\\theta} (z _ {t}, t, y) - \\epsilon_ {\\theta} (z _ {t}, t, y _ {a})), \\tag {3}", + "image_path": "2d2e310e8925fa14868579c992b83d7482635881bda2ce254960c742e398ff00.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 196, + 450, + 207 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 196, + 450, + 207 + ], + "spans": [ + { + "bbox": [ + 132, + 196, + 450, + 207 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 196, + 450, + 207 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 132, + 196, + 450, + 207 + ], + "type": "text", + "content": " is a scaling factor that modulates the influence of the condition." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 263, + 238 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 263, + 238 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 263, + 238 + ], + "type": "text", + "content": "4.2 Abnormal Guidance" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "text", + "content": "In addition to adding information on human abnormals through negative prompting, we can introduce a general form of guidance to improve control over the denoising process. As shown in section 3.2, the Abnormal Scorer " + }, + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "inline_equation", + "content": "S_{\\phi}(x)" + }, + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "text", + "content": " gives a score to an image that measures the severity of limb abnormals. This scorer can provide further guidance using a general Classifier Guidance [10]. Specifically, since " + }, + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(z_t,t,y)" + }, + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "text", + "content": " predicts the added noise, we can estimate the clean latent variable " + }, + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "inline_equation", + "content": "z_0" + }, + { + "bbox": [ + 130, + 248, + 480, + 331 + ], + "type": "text", + "content": " by:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 253, + 333, + 481, + 358 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 333, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 253, + 333, + 481, + 358 + ], + "type": "interline_equation", + "content": "\\hat {z} _ {0} = \\frac {z _ {t} - \\sqrt {\\overline {{\\alpha}} _ {t}} \\epsilon_ {\\theta} (z _ {t} , t , y)}{\\sqrt {1 - \\overline {{\\alpha}} _ {t}}}. \\tag {4}", + "image_path": "e4051dc585b16a02f2e4101a7ec4da3b0a70b24965468cfd757ff0c048ac9847.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 363, + 479, + 388 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 363, + 479, + 388 + ], + "spans": [ + { + "bbox": [ + 131, + 363, + 479, + 388 + ], + "type": "text", + "content": "After this, we can calculate an estimated abnormal score with " + }, + { + "bbox": [ + 131, + 363, + 479, + 388 + ], + "type": "inline_equation", + "content": "S_{\\phi}(\\mathcal{D}(\\hat{z}_0))" + }, + { + "bbox": [ + 131, + 363, + 479, + 388 + ], + "type": "text", + "content": ". Consequently, the noise prediction guided by this method is:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 220, + 399, + 480, + 411 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 399, + 480, + 411 + ], + "spans": [ + { + "bbox": [ + 220, + 399, + 480, + 411 + ], + "type": "interline_equation", + "content": "\\ddot {\\epsilon} _ {\\theta} \\left(z _ {t}, t, y\\right) = \\epsilon \\left(z _ {t}, t, y\\right) + \\mu \\cdot \\nabla S _ {\\phi} \\left(\\mathcal {D} \\left(\\hat {z} _ {0}\\right)\\right). \\tag {5}", + "image_path": "f4d6153973c4ecc2d7c3ae2d29583b4b49fc27dad81819c5d512fce78c00d2a4.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 421, + 479, + 444 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 421, + 479, + 444 + ], + "spans": [ + { + "bbox": [ + 131, + 421, + 479, + 444 + ], + "type": "text", + "content": "We can combine classifier-free guidance through negative prompting with abnormal guidance easily by:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 208, + 455, + 480, + 481 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 455, + 480, + 481 + ], + "spans": [ + { + "bbox": [ + 208, + 455, + 480, + 481 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\hat {\\epsilon} _ {t} = \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right) + s \\cdot \\left(\\epsilon_ {\\theta} \\left(z _ {t}, t, y\\right) - \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right)\\right) \\tag {6} \\\\ + \\mu \\cdot \\nabla S _ {\\phi} (\\mathcal {D} (\\hat {z} _ {0})). \\\\ \\end{array}", + "image_path": "8945eacacd958db182949d7fbada59d7a29af034b46c276856579d065ac7ccc7.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 500, + 360, + 511 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 500, + 360, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 500, + 360, + 511 + ], + "type": "text", + "content": "4.3 Coarse-to-fine Pose-reversible Guidance" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 521, + 479, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 479, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 479, + 568 + ], + "type": "text", + "content": "In contrast to unguided approaches, our HumanRefiner now yields human images with more accurate poses initially. To further enhance the generation quality, we refine the generated image with pose-reversible guidance at both coarse and fine-grained levels." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "text", + "content": "Pose-Guided Coarse Refine The abnormal guided text-to-image diffusion model could be combined with off-the-shelf pose detector [6] and T2I-Adapter [27] to further inject global human pose information for pose-guided refinement. For an initially generated image " + }, + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "inline_equation", + "content": "\\hat{x}" + }, + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "text", + "content": " from a guided text-to-image diffusion model, a pose keypoint map " + }, + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "text", + "content": " could be detected by a pose detector " + }, + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "inline_equation", + "content": "M = P_{\\psi}(\\hat{x})" + }, + { + "bbox": [ + 130, + 570, + 480, + 664 + ], + "type": "text", + "content": ". The pose-guided generation could be expanded from the text-to-image diffusion model with T2I-Adapter [27] by injecting the pose condition information into intermediate encoder features:" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 274, + 129, + 480, + 140 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 129, + 480, + 140 + ], + "spans": [ + { + "bbox": [ + 274, + 129, + 480, + 140 + ], + "type": "interline_equation", + "content": "F _ {c} = \\mathcal {F} _ {A D} (M), \\tag {7}", + "image_path": "905c789a31507cfbff46732179fd51901100b6fcb5ee153973ffa3c4347e1215.jpg" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 268, + 144, + 480, + 155 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 268, + 144, + 480, + 155 + ], + "spans": [ + { + "bbox": [ + 268, + 144, + 480, + 155 + ], + "type": "interline_equation", + "content": "F _ {e n c} = F _ {e n c} + F _ {c}, \\tag {8}", + "image_path": "0c626540ee1bb8587f23be84e18e917247213340c3677670b5a2730bc35152af.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{AD}" + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "text", + "content": " is T2I-Adapter and " + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "inline_equation", + "content": "F_{enc}" + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "text", + "content": " is the intermediate feature of the encoder part of " + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(\\cdot)" + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "text", + "content": ". Forming the pose conditioned denoising as " + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(z_t,t,y,\\mathcal{F}_{AD}(M))" + }, + { + "bbox": [ + 130, + 160, + 479, + 206 + ], + "type": "text", + "content": ", the advantage of abnormal guidance and negative prompts could also be integrated as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 186, + 216, + 480, + 243 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 186, + 216, + 480, + 243 + ], + "spans": [ + { + "bbox": [ + 186, + 216, + 480, + 243 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\hat {\\epsilon} _ {t} = \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right) + s \\cdot \\left(\\epsilon_ {\\theta} \\left(z _ {t}, t, y, \\mathcal {F} _ {A D} (M)\\right) - \\epsilon_ {\\theta} \\left(z _ {t}, t, y _ {a}\\right)\\right) \\tag {9} \\\\ + \\mu \\cdot \\nabla S _ {\\phi} (\\mathcal {D} (\\hat {z _ {0}})). \\\\ \\end{array}", + "image_path": "c578afbca5aabf4a00b7a13aab42e56feb41addf31a7e9dac95b678ec1e2c72b.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 252, + 479, + 299 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 252, + 479, + 299 + ], + "spans": [ + { + "bbox": [ + 130, + 252, + 479, + 299 + ], + "type": "text", + "content": "Detector-Guided Inpainting Refine The pose-guided generation refines the initial image in a global view, performing a coarse refinement. Besides, a fine-grained refinement could be established with our abnormal detector providing region-level abnormal information." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": "Specifically, for a refined image by applying diffusion denoise process in Eq. (9), " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "x_{r} = \\mathcal{D}(\\hat{z}_{0})" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": ", abnormal detector " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "D_{Ab}(\\cdot)" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": " outputs a set of " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": " bounding boxes and corresponding categories " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "\\{B_i,C_i\\}_{i = 1}^K = D_{Ab}(x_r)" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "B_{i} = \\{x_{i},y_{i},w_{i},h_{i}\\}" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": " denotes the detected regions, " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "C_i\\in \\{0,\\dots 17\\}" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": " denoting the detected categories defined in sec 3.1. For detected abnormal classes, the local region " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "B_{i}" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": " is inpainted with an input text conditioned on abnormal category " + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "inline_equation", + "content": "\\hat{y} (C_i)" + }, + { + "bbox": [ + 130, + 300, + 480, + 384 + ], + "type": "text", + "content": ". The local region in the original image is then pasted by the inpainted output." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 402, + 230, + 416 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 230, + 416 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 230, + 416 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 428, + 279, + 440 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 428, + 279, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 428, + 279, + 440 + ], + "type": "text", + "content": "5.1 Implementation Details" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 448, + 479, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 448, + 479, + 509 + ], + "spans": [ + { + "bbox": [ + 130, + 448, + 479, + 509 + ], + "type": "text", + "content": "Negative Prompt Fine-tuning: we finetune SDXL [31] released checkpoint at a resolution of " + }, + { + "bbox": [ + 130, + 448, + 479, + 509 + ], + "type": "inline_equation", + "content": "1024 \\times 1024" + }, + { + "bbox": [ + 130, + 448, + 479, + 509 + ], + "type": "text", + "content": " for 10 epochs with the learning rate of " + }, + { + "bbox": [ + 130, + 448, + 479, + 509 + ], + "type": "inline_equation", + "content": "1.0\\mathrm{e} - 5" + }, + { + "bbox": [ + 130, + 448, + 479, + 509 + ], + "type": "text", + "content": " on the training split, with a batch size of 32 in total. The images are paired with the original text description followed by abnormal captions (e.g. Ab(hand, Ab.leg). More details can be found in the appendix." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 525, + 291, + 538 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 291, + 538 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 291, + 538 + ], + "type": "text", + "content": "5.2 Quantitative Experiments" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "text", + "content": "Evaluation Setup We present quantitative comparison with baseline methods including SOTA text-to-image diffusion models SDXL [31], DeepFlyod-IF [44], LCM [23]. For methods require extra pose condition inputs such as HumanSD [18]. Pose-ControlNet [47] and Pose-T2I-Adapter [27], we first generate an initial image from SDXL [31], then generate pose condition from it with pose detector [5], which operates similarly to our pose-guided generation. Test prompts are provided from the AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt). We quantitatively evaluate the generated images with Abnormal Score, CLIP score and FID, respectively. Abnormal Score measures the severity of anomalies." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 387, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 387, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 387, + 91, + 447, + 101 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": "Results As indicated in Table 3, HumanRefiner consistently achieves the best performance in terms of Abnormal score, FID, and CLIP score. Furthermore, when compared to Pose-ControlNet [47] and Pose-T2I-Adapter [27] applied on SDXL, HumanRefiner demonstrates a significant improvement, indicating the effectiveness of HumanRefiner on integrating off-the-shelf methods such as pose detectors and T2I-adapter [27]." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 135, + 237, + 482, + 333 + ], + "blocks": [ + { + "bbox": [ + 130, + 211, + 482, + 234 + ], + "lines": [ + { + "bbox": [ + 130, + 211, + 482, + 234 + ], + "spans": [ + { + "bbox": [ + 130, + 211, + 482, + 234 + ], + "type": "text", + "content": "Table 3: Abnormal score, CLIP Score and FID on AbHuman full test split (prompts from LAION) and hard test split (prompts from HumanArt)." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 237, + 482, + 333 + ], + "lines": [ + { + "bbox": [ + 135, + 237, + 482, + 333 + ], + "spans": [ + { + "bbox": [ + 135, + 237, + 482, + 333 + ], + "type": "table", + "html": "
DatasetLAIONHumanArt
ModelAbnormal Score ↓CLIP Score↑FID Score↓Abnormal Score↓CLIP Score↑FID Score↓
SSD-1B [43]0.61234.0216.4650.83233.3713.304
PixArt-XL-2-1024-MS [9]0.70134.3219.6040.80732.6815.452
DeepFloyd-IF [44]0.59532.7225.9260.84932.6721.512
LCM [23]0.64432.9925.1750.83132.4021.179
SDXL [32]0.65934.1330.0240.85732.4020.796
Pose-ControlNet [48]0.66333.5115.3680.83831.8813.047
Pose-T2I-Adapter [26]0.62434.7915.6580.80732.7212.582
HumanSD [18]0.66133.7850.5460.80133.0338.032
HumanRefiner (ours)0.59034.8513.6340.77833.909.145
", + "image_path": "aa0d8268e2f926e6b39e75fdae0ff8d334a7471deb0e097e376dec53b62bef89.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 349, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 482, + 445 + ], + "type": "text", + "content": "Human Evaluation We conduct a human preference study on generated images with prompts from HumanArt [17], asking 38 users for a preference comparison between DALL-E 3 [30], SDXL [31], and the proposed HumanRefiner. Users compared the images based on fidelity and limb quality. Figure 7 shows that HumanRefiner surpasses DALL-E 3 and SDXL in both fidelity and limb quality for the human generation. For limb quality, HumanRefiner gets " + }, + { + "bbox": [ + 130, + 349, + 482, + 445 + ], + "type": "inline_equation", + "content": "2.9 \\times" + }, + { + "bbox": [ + 130, + 349, + 482, + 445 + ], + "type": "text", + "content": " preference over SDXL (32.3% vs. 11.20%), and " + }, + { + "bbox": [ + 130, + 349, + 482, + 445 + ], + "type": "inline_equation", + "content": "1.4 \\times" + }, + { + "bbox": [ + 130, + 349, + 482, + 445 + ], + "type": "text", + "content": " over DALL-E 3 (51.42% vs. 36.03%), indicating that HumanRefiner can generate high-quality human pose." + } + ] + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 134, + 465, + 478, + 495 + ], + "blocks": [ + { + "bbox": [ + 134, + 465, + 478, + 495 + ], + "lines": [ + { + "bbox": [ + 134, + 465, + 478, + 495 + ], + "spans": [ + { + "bbox": [ + 134, + 465, + 478, + 495 + ], + "type": "image", + "image_path": "660b91f73803212a9b994c4365361db26b91f5b6d1ca23f7e8f7897ceca44501.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 506, + 482, + 529 + ], + "lines": [ + { + "bbox": [ + 130, + 506, + 482, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 482, + 529 + ], + "type": "text", + "content": "Fig. 7: Human Evaluation on prompts from HumanArt. The percentage indicates the frequency of human preference. \"Tie\" means having a similar level of preference." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "content": "Ablation Study We perform a component analysis to assess the contribution of each element utilizing the Abnormal Score as a metric for generation quality, as shown in Table 4. For instance, the incorporation of the negative prompt learned from the AbHuman dataset significantly reduces the Abnormal Score from 0.659 to 0.614." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "Figure 8 shows several ablation experiment findings. The Baseline represents the unaltered output of the SDXL model, while AbnormalGuided and PoseGuided illustrate results achieved through the application of distinct guiding modules. As depicted in the first row of figures, discernible enhancements are observed in the characters' outline. Moreover, the second and fourth rows" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 158, + 116, + 455, + 384 + ], + "blocks": [ + { + "bbox": [ + 158, + 116, + 455, + 384 + ], + "lines": [ + { + "bbox": [ + 158, + 116, + 455, + 384 + ], + "spans": [ + { + "bbox": [ + 158, + 116, + 455, + 384 + ], + "type": "image", + "image_path": "8e3da9ee72d10939a7cae04955992daff9b21af6d929ad5b6c003d8636e4a770.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 186, + 392, + 425, + 403 + ], + "lines": [ + { + "bbox": [ + 186, + 392, + 425, + 403 + ], + "spans": [ + { + "bbox": [ + 186, + 392, + 425, + 403 + ], + "type": "text", + "content": "Fig. 8: Visualization outcomes from ablation experiments." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 151, + 441, + 457, + 502 + ], + "blocks": [ + { + "bbox": [ + 132, + 414, + 480, + 437 + ], + "lines": [ + { + "bbox": [ + 132, + 414, + 480, + 437 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 480, + 437 + ], + "type": "text", + "content": "Table 4: Ablation Study on the proposed components, evaluated on the AbHuman test split (prompts from Laion) with Abnormal score." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 151, + 441, + 457, + 502 + ], + "lines": [ + { + "bbox": [ + 151, + 441, + 457, + 502 + ], + "spans": [ + { + "bbox": [ + 151, + 441, + 457, + 502 + ], + "type": "table", + "html": "
Negative PromptAbnormal Guidance DetectorInpaintPose GuideAbnormal Score ↓
XXXX0.659
✓XXX0.614
✓✓XX0.605
✓✓✓X0.601
✓✓✓✓0.590
", + "image_path": "f9928375767296ee2d38facac67639be91f7988c93df44179dd1172510e3f883.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 510, + 482, + 570 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 570 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 570 + ], + "type": "text", + "content": "showcase varying degrees of improvement in hand details. Notably, our AbnormalGuided module demonstrates corrective efficacy even in scenes where hand details typically appear blurry. Importantly, the ablation of our AbnormalGuided module mirrors an ablation of the dataset, underscoring the dataset's pivotal role in our approach." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 586, + 257, + 598 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 586, + 257, + 598 + ], + "spans": [ + { + "bbox": [ + 132, + 586, + 257, + 598 + ], + "type": "text", + "content": "5.3 Qualitative Results" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "We also present showcases in the challenging test split, featuring humans engaged in activities such as dancing or performing acrobatics. As illustrated in Figure 9, HumanRefiner exhibits superior limb quality compared to the baseline methods. It accurately captures the human pose, represents natural limb attributes, and presents visually pleasing arrangements." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 388, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 388, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 388, + 91, + 447, + 100 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 115, + 468, + 365 + ], + "blocks": [ + { + "bbox": [ + 143, + 115, + 468, + 365 + ], + "lines": [ + { + "bbox": [ + 143, + 115, + 468, + 365 + ], + "spans": [ + { + "bbox": [ + 143, + 115, + 468, + 365 + ], + "type": "image", + "image_path": "45892b29c2014b416980c03fcd52ba2052e8752fad16c38265dd4a5cc142e385.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 278, + 365, + 342, + 372 + ], + "lines": [ + { + "bbox": [ + 278, + 365, + 342, + 372 + ], + "spans": [ + { + "bbox": [ + 278, + 365, + 342, + 372 + ], + "type": "text", + "content": "A girl in a pink business suit" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 373, + 480, + 395 + ], + "lines": [ + { + "bbox": [ + 130, + 373, + 480, + 395 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 480, + 395 + ], + "type": "text", + "content": "Fig. 9: Qualitative comparison with baselines conducted on humans engaged in activity prompts." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 403, + 322, + 415 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 403, + 322, + 415 + ], + "spans": [ + { + "bbox": [ + 131, + 403, + 322, + 415 + ], + "type": "text", + "content": "6 Conclusion and Future work" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 426, + 480, + 497 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 480, + 497 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 480, + 497 + ], + "type": "text", + "content": "In this paper, we introduce AbHuman, a benchmark including fine-grained annotations of abnormal limbs. AbHuman comprises 56K generated human images along with 147K annotations for abnormal limbs at the bounding box level. Leveraging this benchmark, we construct HumanRefiner, a plug-and-play human refinement module that could be integrated into any text-to-image diffusion model." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 498, + 480, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 480, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 480, + 581 + ], + "type": "text", + "content": "Integraed with abnormal guidance, pose-reversible guidance, and detector-guided inpainting, HumanRefiner identifies abnormal limbs and removes them during the generation process, resulting in high-quality human image synthesis. Quantitative experimental results on the AbHuman test split, along with human evaluation results, demonstrate the superiority of HumanRefiner. We envision that the AbHuman Benchmark will facilitate further exploration of methods in the field of human image generation." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 582, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 481, + 665 + ], + "type": "text", + "content": "Limitation and Future Work While HumanRefiner is capable of generating high-quality human images, the process involves dual generation steps and inpainting, resulting in a limited inference speed. Furthermore, the AbHuman Dataset lacks broader scene annotations for normal human images. We would continue to improve the diversity of the AbHuman benchmark. We believe that richer annotations will further enhance the performance of HumanRefiner and foster the development of more effective models." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "text", + "content": "Acknowledgments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "text", + "content": "This work was supported in part by National Science and Technology Major Project (2020AAA0109704), National Science and Technology Ministry Youth Talent Funding No. 2022WRQB002, Guangdong Outstanding Youth Fund (Grant No. 2021B1515020061), Mobility Grant Award under Grant No. M-0461, Shenzhen Science and Technology Program (Grant No. GJHZ20220913142600001), Nansha Key RD Program under Grant No.2022ZD014." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 232, + 197, + 244 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 232, + 197, + 244 + ], + "spans": [ + { + "bbox": [ + 133, + 232, + 197, + 244 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 257, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 257, + 480, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 257, + 480, + 300 + ], + "spans": [ + { + "bbox": [ + 138, + 257, + 480, + 300 + ], + "type": "text", + "content": "1. Andriluka, M., Iqbal, U., Insafutdinov, E., Pishchulin, L., Milan, A., Gall, J., Schiele, B.: Posetrack: A benchmark for human pose estimation and tracking. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5167-5176 (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 302, + 480, + 334 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 302, + 480, + 334 + ], + "spans": [ + { + "bbox": [ + 138, + 302, + 480, + 334 + ], + "type": "text", + "content": "2. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 335, + 480, + 367 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 335, + 480, + 367 + ], + "spans": [ + { + "bbox": [ + 138, + 335, + 480, + 367 + ], + "type": "text", + "content": "3. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems pp. 1877-1901 (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 368, + 480, + 389 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 368, + 480, + 389 + ], + "spans": [ + { + "bbox": [ + 138, + 368, + 480, + 389 + ], + "type": "text", + "content": "4. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 390, + 480, + 422 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 390, + 480, + 422 + ], + "spans": [ + { + "bbox": [ + 138, + 390, + 480, + 422 + ], + "type": "text", + "content": "5. Cao, Z., Hidalgo Martinez, G., Simon, T., Wei, S., Sheikh, Y.A.: Openpose: Realtime multi-person 2d pose estimation using part affinity fields. IEEE Transactions on Pattern Analysis and Machine Intelligence (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 423, + 480, + 455 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 423, + 480, + 455 + ], + "spans": [ + { + "bbox": [ + 138, + 423, + 480, + 455 + ], + "type": "text", + "content": "6. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 456, + 480, + 499 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 456, + 480, + 499 + ], + "spans": [ + { + "bbox": [ + 138, + 456, + 480, + 499 + ], + "type": "text", + "content": "7. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M.H., Murphy, K., Freeman, W.T., Rubinstein, M., et al.: Muse: Text-to-image generation via masked generative transformers. arXiv preprint arXiv:2301.00704 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 500, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 500, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 500, + 480, + 533 + ], + "type": "text", + "content": "8. Charles, J., Pfister, T., Magee, D., Hogg, D., Zisserman, A.: Personalizing human video pose estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3063-3072 (2016)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 533, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 533, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 138, + 533, + 480, + 566 + ], + "type": "text", + "content": "9. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 567, + 468, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 468, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 468, + 577 + ], + "type": "text", + "content": "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 578, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 578, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 134, + 578, + 480, + 609 + ], + "type": "text", + "content": "11. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 610, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 610, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 610, + 480, + 632 + ], + "type": "text", + "content": "12. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems. vol. 33, pp. 6840-6851 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "text", + "content": "13. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research pp. 2249-2281 (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 388, + 91, + 447, + 101 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "14. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 480, + 171 + ], + "type": "text", + "content": "15. Huang, L., Chen, D., Liu, Y., Shen, Y., Zhao, D., Zhou, J.: Composer: Creative and controllable image synthesis with composable conditions. arXiv preprint arXiv:2302.09778 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "type": "text", + "content": "16. Iqbal, U., Milan, A., Gall, J.: Posetrack: Joint multi-person pose estimation and tracking. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2011-2020 (2017)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 205, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 205, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 133, + 205, + 480, + 237 + ], + "type": "text", + "content": "17. Ju, X., Zeng, A., Wang, J., Xu, Q., Zhang, L.: Human-art: A versatile human-centric dataset bridging natural and artificial scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 238, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 238, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 133, + 238, + 480, + 281 + ], + "type": "text", + "content": "18. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15988-15998 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 281, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 281, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 133, + 281, + 480, + 315 + ], + "type": "text", + "content": "19. Kang, M., Zhu, J.Y., Zhang, R., Park, J., Shechtman, E., Paris, S., Park, T.: Scaling up gans for text-to-image synthesis. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10124-10134 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 480, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 357 + ], + "type": "text", + "content": "20. Li, J., Wang, C., Zhu, H., Mao, Y., Fang, H.S., Lu, C.: Crowdpose: Efficient crowded scenes pose estimation and a new benchmark. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10863-10872 (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 358, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 480, + 391 + ], + "type": "text", + "content": "21. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 480, + 435 + ], + "type": "text", + "content": "22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 435, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 480, + 456 + ], + "type": "text", + "content": "23. Luo, S., Tan, Y., Huang, L., Li, J., Zhao, H.: Latent consistency models: Synthesizing high-resolution images with few-step inference (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 457, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 480, + 479 + ], + "type": "text", + "content": "24. Lv, W., Xu, S., Zhao, Y., Wang, G., Wei, J., Cui, C., Du, Y., Dang, Q., Liu, Y.: Detrs beat yolos on real-time object detection (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 480, + 522 + ], + "type": "text", + "content": "25. Madhu, P., Villar-Corrales, A., Kosti, R., Bendschus, T., Reinhardt, C., Bell, P., Maier, A., Christlein, V.: Enhancing human pose estimation in ancient vase paintings via perceptually-grounded style transfer learning. ACM Journal on Computing and Cultural Heritage 16(1), 1-17 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "type": "text", + "content": "26. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 555, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 480, + 588 + ], + "type": "text", + "content": "27. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 589, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 480, + 632 + ], + "type": "text", + "content": "28. Narasimhaswamy, S., Nguyen, T., Huang, M., Hoai, M.: Whose hands are these? hand detection and hand-body association in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4889-4899 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "type": "text", + "content": "29. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 101 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "text", + "content": "30. OpenAI: Improving image generation with better captions (2023), https://cdn.openai.com/papers/dall-e-3.pdf, online; accessed 16-November-2023" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "type": "text", + "content": "31. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 480, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 480, + 204 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 480, + 204 + ], + "type": "text", + "content": "32. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 205, + 480, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 205, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 133, + 205, + 480, + 247 + ], + "type": "text", + "content": "33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "type": "text", + "content": "34. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 282, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 480, + 314 + ], + "type": "text", + "content": "35. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "text", + "content": "36. Redmon, J., Divvala, S., Girshick, R., Farhadi, A.: You only look once: Unified, real-time object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 779-788 (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 347, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 480, + 380 + ], + "type": "text", + "content": "37. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 380, + 480, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 480, + 423 + ], + "type": "text", + "content": "38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 424, + 480, + 467 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 480, + 467 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 480, + 467 + ], + "type": "text", + "content": "39. Saharia, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 468, + 480, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 480, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 480, + 500 + ], + "type": "text", + "content": "40. Sauer, A., Karras, T., Laine, S., Geiger, A., Aila, T.: Stylegan-t: Unlocking the power of gans for fast large-scale text-to-image synthesis. arXiv preprint arXiv:2301.09515 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 501, + 480, + 521 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 480, + 521 + ], + "type": "text", + "content": "41. Schuhmann, C.: Laion-aesthetics predictor v2 (2023), https://laion.ai/blog/laion-aesthetics/, online; accessed 16-November-2023" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 522, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 522, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 522, + 480, + 566 + ], + "type": "text", + "content": "42. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 567, + 480, + 598 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 480, + 598 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 480, + 598 + ], + "type": "text", + "content": "43. Segmind: Announcing ssd-1b: A leap in efficient t2i generation (2023), https://blog.segmind.com/introducing-segmind-ssd-1b/, online; accessed 16-November-2023" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 599, + 480, + 642 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 480, + 642 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 480, + 642 + ], + "type": "text", + "content": "44. Shonenkov, A., Konstantinov, M., Bakshandaeva, D., Schuhmann, C., Ivanova, K., Klokova, N.: Deepfloyd if: A powerful text-to-image model that can smartly integrate text into images (2023), https://www deepfloyd.ai/deepfloyd-if, online; accessed 16-November-2023" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "text", + "content": "45. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 388, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 388, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 388, + 91, + 447, + 100 + ], + "type": "text", + "content": "HumanRefiner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 281 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "text", + "content": "46. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 2(3), 5 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "type": "text", + "content": "47. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "type": "text", + "content": "48. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "type": "text", + "content": "49. Zhang, P., Yang, L., Lai, J.H., Xie, X.: Exploring dual-task correlation for pose guided person image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7713-7722 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 237, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 480, + 281 + ], + "type": "text", + "content": "50. Zhang, S.H., Li, R., Dong, X., Rosin, P., Cai, Z., Han, X., Yang, D., Huang, H., Hu, S.M.: Pose2seg: Detection free human instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 889-898 (2019)" + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 102 + ], + "type": "text", + "content": "Fang and Yan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_content_list.json b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..a8221b2e15c793d3541955d4d7ff1d352554cba9 --- /dev/null +++ b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_content_list.json @@ -0,0 +1,1821 @@ +[ + { + "type": "text", + "text": "HyTAS: A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis", + "text_level": 1, + "bbox": [ + 243, + 140, + 759, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Fangqin Zhou $^{1}$ , Mert Kilickaya $^{1}$ , Joaquin Vanschoren $^{1}$ , and Ran Piao $^{1}$", + "bbox": [ + 230, + 210, + 771, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Automated Machine Learning Group, Eindhoven University of Technology, the", + "bbox": [ + 238, + 239, + 764, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Netherlands", + "bbox": [ + 460, + 253, + 542, + 266 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{f.zhou, j.vanschoren}@tue.nl", + "bbox": [ + 387, + 268, + 612, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "https://github.com/openml-labs", + "bbox": [ + 383, + 282, + 617, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Hyperspectral Imaging (HSI) plays an increasingly critical role in precise vision tasks within remote sensing, capturing a wide spectrum of visual data. Transformer architectures have significantly enhanced HSI task performance, while advancements in Transformer Architecture Search (TAS) have improved model discovery. To harness these advancements for HSI classification, we make the following contributions: i) We propose HyTAS, the first benchmark on transformer architecture search for Hyperspectral imaging, ii) We comprehensively evaluate 12 different methods to identify the optimal transformer over 5 different datasets, iii) We perform an extensive factor analysis on the Hyperspectral transformer search performance, greatly motivating future research in this direction. All benchmark materials are available at HyTAS.", + "bbox": [ + 259, + 332, + 743, + 500 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Hyperspectral Image Classification $\\cdot$ Transformer Architecture Search $\\cdot$ Zero-Cost Proxies $\\cdot$ Benchmark and Analysis", + "bbox": [ + 259, + 512, + 740, + 540 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 566, + 375, + 580 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Hyperspectral Imaging (HSI) captures a broad spectrum of electromagnetic wavelengths, providing detailed spectral information beyond conventional RGB images. This rich spectral data has significantly impacted various industries, including agriculture for plant monitoring [6,8,21,32,36], remote sensing for Earth analysis [9,27], and robotics for enhanced navigation and vision [13,28].", + "bbox": [ + 212, + 583, + 785, + 657 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Scientists in fields like agriculture or remote sensing may seek to analyze Hyperspectral images using transformer models, see Fig. 1. However, designing high-performing Hyperspectral image transformers requires significant expertise and computational resources. Transformer Architecture Search (TAS) methods like AutoFormer [5] or ViTAS [23] can help but demand extensive computational resources (e.g., 24 GPU days for AutoFormer).", + "bbox": [ + 212, + 659, + 787, + 748 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "An alternative is using training-free architecture search techniques, known as zero-cost proxies [14, 16, 25, 31, 39]. Hereafter, we will use the term \"proxy\" for brevity. Proxies quickly evaluate transformer architectures without training, offering two key advantages: i) Efficiency: Proxies identify high-performing transformers within minutes. ii) Data Independence: Many proxies do not require real data, reducing setup and data collection costs [3,20,25,39]. This characteristic is", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/34465a6c2e10b84493e6ebe6e05769fd00f97760d5303bbec36c3943d5fbcd2f.jpg", + "image_caption": [ + "Fig. 1: A scientist outside AI domain may find it difficult to design a novel Hyperspectral image transformer tailored to their tasks and data. To automate the design of Hyperspectral transformers, we introduce Hyperspectral Transformer Architecture Search (HyTAS) in this paper. The scientist images are generated by DALL-E." + ], + "image_footnote": [], + "bbox": [ + 261, + 143, + 733, + 290 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "especially advantageous for hyperspectral imaging applications, where the setup and calibration of the camera, as well as the collection and annotation of data, incur significant costs.", + "bbox": [ + 212, + 386, + 787, + 431 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To that end, in this paper, we introduce Hyperspectral Transformer Architecture Search (HyTAS), to automatically identify Hyperspectral transformers tailored for downstream tasks and datasets. Our motivations are three-fold: i) Democratization: HyTAS enables researchers, especially in fields like biology or agriculture, to identify top-performing, lightweight models using minimal resources. ii) Attention: We aim to highlight the unique challenges of HSI to the NAS community, which has focused more on RGB images. iii) Novelty: We share novel findings to guide the development of better hyperspectral-specific search techniques and architectures.", + "bbox": [ + 212, + 431, + 815, + 566 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our approach begins by generating a substantial pool of candidate Hyperspectral transformers. Subsequently, we assess the performance of various proxies in their capacity to efficiently identify accurate Hyperspectral image transformers. Lastly, we conduct a comprehensive factor analysis to elucidate the factors influencing the performance of both Hyperspectral image transformers and proxy-based transformer search methods.", + "bbox": [ + 212, + 568, + 787, + 657 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To sum up, this paper presents three primary contributions:", + "bbox": [ + 238, + 659, + 673, + 672 + ], + "page_idx": 1 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "I. We introduce HyTAS, the pioneering benchmark for Transformer Architecture Search in HSI classification, comprising 2000 distinct Hyperspectral Image transformer architectures.", + "II. We conduct comprehensive benchmarking using 12 proxies across 5 datasets. Our benchmarking demonstrates the capability to achieve superior performance over a well-established, human-crafted counterpart within minutes.", + "III. We analyze various factors influencing the effectiveness of Transformer architecture search. Our findings include: i) Proxies demonstrate a bias towards larger models, ii) Proxies operate without necessitating real data input, iii) Proxies synergistically complement each other in predicting the accuracy of input transformers, suggesting promising avenues for future research." + ], + "bbox": [ + 210, + 674, + 785, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 143, + 388, + 160 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Transformer Architecture Search via Proxies", + "text_level": 1, + "bbox": [ + 215, + 175, + 630, + 191 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Neural Architecture Search (NAS) customizes optimal architectures for specific tasks [2,18,22,40]. Transformer Architecture Search (TAS) is gaining popularity alongside transformer-based model advancements [4, 5, 23, 39]. However, these methods are computationally intensive, often taking days or months to converge [15, 33]. Many researchers lack resources; for instance, this study employs only a single GPU. An alternative approach involves using proxy functions, which swiftly assess architecture fitness without training [3, 14-16, 25]. In this paper, we adapt proxy methods to quickly search over a large database of Hyperspectral transformers.", + "bbox": [ + 212, + 199, + 787, + 335 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.2 Hyperspectral Image Transformers", + "text_level": 1, + "bbox": [ + 215, + 357, + 549, + 373 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Hyperspectral image classification involves processing input cubes with significantly more channels (e.g., 200 vs. 3) and lower spatial resolution than conventional RGB imaging [17]. With the emergence of Vision-Transformers (ViT) [7], manual design of transformer architectures for Hyperspectral image classification has become common practice. For instance, Hong et al. [12] introduce Spectral-Former, adapting ViT for HSI classification, while Sun et al. [24] and Zhou et al. [38] enhance it with spatial-local attention modules. However, manual network design is laborious and resource-intensive. Therefore, in this study, we propose HyTAS to automate Hyperspectral image transformer design.", + "bbox": [ + 212, + 381, + 787, + 518 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 HyTAS Benchmark", + "text_level": 1, + "bbox": [ + 215, + 540, + 441, + 558 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In practice, the optimal architecture is determined by its performance, often measured by the highest test accuracy for classification tasks. However, in TAS proxies, where training is not involved, a proxy measure is needed to rank architectures sampled from a search space based on their initial model weights or one-step gradients. This proxy score serves as the metric for estimating the performance of each architecture.", + "bbox": [ + 212, + 571, + 787, + 660 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The process of TAS proxy for HSI classification is illustrated in Fig. 2, containing four main steps: 1). Patchify HSI image and tokenize each patch along its spectra, then randomly sample a batch of input. 2). Design a search space and sample architectures from it. 3). Select a proxy to estimate the sampled architectures and rank them by their proxy scores. 4). Evaluate the performance of search proxies. Formally, the objective of TAS proxy is formulated as follows:", + "bbox": [ + 212, + 662, + 787, + 753 + ], + "page_idx": 2 + }, + { + "type": "equation", + "text": "\n$$\na ^ {*} = \\arg \\max _ {a \\in \\mathcal {A}} \\mathrm {O A} (a) \\equiv a ^ {*} = \\arg \\max _ {a \\in \\mathcal {A}} \\mathcal {F} _ {s} (a) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 348, + 768, + 785, + 789 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $a$ is a transformer architecture sampled from the search space $\\mathcal{A}$ , OA and $\\mathcal{F}_s$ denote the test overall accuracy and a scoring function, respectively. The objective aims to discover the optimal architecture $a^*$ through a scoring function", + "bbox": [ + 214, + 794, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/6ddbbda3fd82376680d4bd4a89907c89006dffb70d91c8830900b4ab4445b2e1.jpg", + "image_caption": [ + "Fig. 2: Diagram of TAS proxies for HSI classification: (1) Patchify the image and tokenize each patch along its spectra. (2) Randomly sample architectures from a designed search space. (3) Select a proxy to compute scores for sampled architectures after passing a batch of input. (4) Use the scores to rank architectures and choose the one with the highest score to retrain. Proxy evaluation metrics include test overall accuracy, model size, Spearman correlation between proxy scores and test OA, and search time." + ], + "image_footnote": [], + "bbox": [ + 225, + 146, + 782, + 316 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "instead of training all models. Designing a good search space $\\mathcal{A}$ and a suitable proxy scoring function that accurately estimates architectures' performance is crucial for TAS proxies.", + "bbox": [ + 212, + 445, + 787, + 491 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Benchmark Proxies", + "text_level": 1, + "bbox": [ + 215, + 517, + 423, + 531 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Optimizing Equation 1 relies on employing an appropriate proxy scoring function $\\mathcal{F}_s$ . In this section, we provide a concise overview of various existing proxies commonly utilized within the NAS and TAS communities. The mathematical equation of each proxy as well as further details are presented in Section 7.1 in our supplementary material.", + "bbox": [ + 212, + 547, + 787, + 622 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "GradNorm [1]: aggregates the Euclidean norms of each layer's gradients after processing a single batch of training data.", + "bbox": [ + 212, + 625, + 785, + 654 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "SNIP [14]: calculates a saliency metric by incorporating both gradients and weights, facilitating parameter pruning in neural networks.", + "bbox": [ + 212, + 655, + 785, + 684 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "GraSP [31]: considers both the first-order and second-order derivatives of the network to preserve training dynamics instead of the loss at the beginning of training.", + "bbox": [ + 212, + 686, + 787, + 731 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Synflow [25]: a modification of SNIP that eliminates the absolute expression to address layer collapse during parameter pruning.", + "bbox": [ + 212, + 732, + 785, + 762 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "LogSynflow [3]: addresses the issue of neglecting the significance of weights due to gradients in Synflow, by scaling down the gradients with a logarithmic function before summing up the contributions of their weights.", + "bbox": [ + 212, + 763, + 785, + 808 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Fisher: initially presented by [26] to achieve more runtime-efficient neural architectures, and utilized as a pruning metric at initialization by [30]. More", + "bbox": [ + 212, + 810, + 785, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 116, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "recently, [1] applied this metric to aggregate all gradients of the activations for scoring a network.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "JacobCov [19]: leverages gradients over the input data instead of parameters or activations.", + "bbox": [ + 212, + 176, + 782, + 204 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "NASWOT [20]: computes the network score according to its kernel matrix of the binary activation patterns between a batch of training inputs.", + "bbox": [ + 212, + 207, + 782, + 236 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "DSS [39]: specifically designed for transformer architectures via combining synaptic diversity scores of MSA and synaptic saliency scores of MLP modules.", + "bbox": [ + 212, + 238, + 782, + 267 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "CROZe [11]: measures the consistency of features, parameters, and gradients between perturbed and clean samples.", + "bbox": [ + 212, + 268, + 782, + 297 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "T-CET [35]: incorporates the orthogonality of gradient-based (SSNR) and activation-based (NASWOT) compressibility to score an architecture.", + "bbox": [ + 212, + 297, + 782, + 327 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "ZiCo [16]: considers both absolute mean and standard deviation of gradients, emphasizing their influence on convergence rate and generalization capacity.", + "bbox": [ + 212, + 329, + 782, + 359 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 A New Proxy: $\\mathrm{ZiCo}^{+ + }$", + "text_level": 1, + "bbox": [ + 214, + 382, + 449, + 397 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Inspired by ZiCo's principle of favoring networks with high absolute mean and low standard deviation gradient values for faster convergence and improved generalization, we introduce $\\mathrm{ZiCo}^{++}$ , a novel proxy. $\\mathrm{ZiCo}^{++}$ enhances network expressive capacity by optimizing the mean and minimizing the standard deviation of Fisher information of activations across input samples. Additionally, to address the issue of the final score's heavy reliance on the number of layers in ZiCo, we incorporate a layer decay mechanism during score aggregation in $\\mathrm{ZiCo}^{++}$ . The mathematical formulation is as follows:", + "bbox": [ + 212, + 407, + 784, + 527 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} Z i C o ^ {+ +} \\triangleq \\sum_ {i = 1} ^ {n - 1} Z i C o _ {i} ^ {+ +} + \\sum_ {i = n} ^ {N - 1} \\frac {1}{i - n + 1} Z i C o _ {i} ^ {+ +} + Z i C o _ {N} ^ {+ +} \\quad \\text {s . t .} \\\\ Z i C o _ {i} ^ {+ +} \\triangleq \\log \\left(\\sum_ {\\omega \\in \\theta_ {l}} \\frac {\\mathbb {E} \\left[ \\left(\\nabla_ {\\omega} L \\left(X _ {i} , y _ {i} ; z _ {i}\\right) * z _ {i}\\right) ^ {2} \\right]}{\\sqrt {\\operatorname {V a r} \\left(\\left(\\nabla_ {\\omega} L \\left(X _ {i} , y _ {i} ; z _ {i}\\right) * z _ {i}\\right) ^ {2}\\right)}}\\right) \\tag {2} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 312, + 539, + 784, + 611 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathrm{ZiCo}_i^{++}$ and $\\mathrm{ZiCo}_N^{++}$ denote the $\\mathrm{ZiCo}^{++}$ score of $i\\_\\text{th}$ and the last layer, respectively. $n$ is a tunable parameter representing the starting layer for layer decay, such that $n$ is constrained by $n \\leq \\min\\_depth * 4 + 1$ , with $\\min\\_depth$ denoting the minimal depth defined in the search space. In our experiments, we set $\\min\\_depth = 4$ and $n = 6$ to preserve the $\\mathrm{ZiCo}^{++}$ score for the first embedding and the last projection layer, as well as for the first block containing two MSA layers and two MLP layers.", + "bbox": [ + 212, + 623, + 784, + 729 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.3 Search Space Design", + "text_level": 1, + "bbox": [ + 214, + 753, + 431, + 768 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A transformer architecture contains an encoder and decoder, but for our classification task, we focus on encoder-only transformers. Typically, a transformer encoder consists of a series of blocks, each containing a multi-head self-attention (MSA) and a multi-layer perceptron (MLP) module. Therefore, the search space", + "bbox": [ + 212, + 779, + 782, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "should account for four key elements: embedding dimension (embed_dim), number of blocks (depth), number of attention heads (num_heads), and MLP embedding ratio (mlp_ratio) for each block. These components significantly impact model performance.", + "bbox": [ + 212, + 146, + 787, + 205 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/2f632c7fd8c024a81c6eacbfd08638bb2c2a004e09b4b467eed7fd497e6e2ac3.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Componentsdepthembed_dimnum_headsmlp_ratio
Choices(4, 10, 1)(32, 240, 16)(3, 6, 1)(1, 6, 1)
", + "bbox": [ + 259, + 229, + 743, + 277 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Table 1: The search space across all datasets. It includes depth, embed_dim, num_heads, and mlp_ratio, with values indicating initial, final, and intervals. Different numbers of heads and MLP ratios are utilized for each block. Notably, the total number of layers equals depth * 4 + 2.", + "bbox": [ + 212, + 279, + 787, + 334 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Drawing inspiration from the effectiveness of manually crafted models proposed by [12, 38], we define our search space in Table 1. We randomly sample 2000 subnetworks from the search space for our experiments.", + "bbox": [ + 212, + 359, + 785, + 405 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Experimental Setup", + "text_level": 1, + "bbox": [ + 214, + 422, + 447, + 441 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Datasets We conduct experiments on five well-established HSI datasets:", + "bbox": [ + 215, + 450, + 733, + 465 + ], + "page_idx": 5 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "i. Indian Pines [10]: 224 spectral bands, $145 \\times 145$ spatial resolution, 16 classes, 695 training, and $9k$ testing samples.", + "ii. Houston2013 [37]: 144 spectral bands, $349 \\times 1905$ spatial resolution, 15 classes, $2k$ training, and $12k$ testing samples.", + "iii. Pavia University (PaviaU) [10]: 103 spectral bands, $610 \\times 340$ spatial resolution, 9 classes, $3k$ training, and $40k$ testing samples.", + "iv. Kennedy Space Center (KSC) [10]: 176 spectral bands, $518 \\times 620$ spatial resolution, 13 classes, 195 training, and $5k$ testing samples.", + "$v$ . Salinas scene [10]: 224 spectral bands, $512 \\times 217$ spatial resolution, 16 classes, 800 training, and $53k$ testing samples." + ], + "bbox": [ + 215, + 469, + 784, + 614 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Indian Pines and Salinas contain mostly agricultural vegetation, and the remaining three datasets consist of non-agricultural vegetation, such as roads and buildings. More details are presented in Section 7.2 in our supplementary material. For data-dependent search proxies, we randomly sample a batch of training data with a batch size of 64, consistent with the batch size used for retraining.", + "bbox": [ + 212, + 619, + 787, + 696 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Metrics We evaluate architecture performance with test Overall Accuracy (OA), indicating correctly predicted samples over all samples. Spearman correlation $(\\rho)$ measures the correlation between proxy scores and final test OA after training all sampled networks. We also compare Search Time (ST) and proposed Model Size (MS) for each proxy, calculated using the following equation from [29]:", + "bbox": [ + 212, + 705, + 787, + 782 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nM S (a, b, c, d) = 1, 5 3 9 d + a \\left(4 d + 2 5 6 c d + 1 9 2 c + 5 d + 7, 6 8 0 + 2 b d ^ {2} + b d + d\\right) + 2 d + \\# \\text {c l a s s} \\times (d + 1)\n$$\n", + "text_format": "latex", + "bbox": [ + 222, + 789, + 777, + 804 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Here, $a$ , $b$ , $c$ , and $d$ represent the depth, MLP ratio, number of heads, and embedding dimension, respectively. #class is the number of classes in the dataset.", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5 HyTAS Analysis", + "text_level": 1, + "bbox": [ + 215, + 143, + 413, + 162 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "This section presents experiments to answer the following research questions:", + "bbox": [ + 215, + 180, + 769, + 196 + ], + "page_idx": 6 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- RQ1: How do proxies perform on HSI classification?", + "RQ2: What factors influence Hyperspectral image transformer performance?", + "RQ3: What factors influence the proxy scores?", + "RQ4: Are proxies complementary?" + ], + "bbox": [ + 223, + 212, + 782, + 275 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 RQ1: How Do Proxies Perform on HSI Classification?", + "text_level": 1, + "bbox": [ + 215, + 301, + 705, + 318 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Previous studies have shown the varying performance of proxies under different search space constraints [15,33]. To address RQ1, we conduct experiments under full and constrained search space conditions.", + "bbox": [ + 215, + 332, + 785, + 378 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Full Search Space We compare proxies across all (2000) subnetworks sampled from the entire search space on five datasets. We include two reference results: SpectralFormer as the human-crafted transformer, and Oracle as the upper bound. Results are presented in Table 2. We make four observations:", + "bbox": [ + 215, + 396, + 785, + 458 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/b58d67badadcf2ea5e11d8a76086b47145d447b05b0b29f6ebd84a04064fcd2b.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
DatasetIndian PinesHouston2013PaviaUKSCSalinas
ProxyOAMSρOAMSρOAMSρOAMSρOAMSρ
#Flops0.7926.30.690.8626.30.660.8926.30.710.8926.30.820.9126.30.94
GradNorm0.8126.80.710.8629.80.700.9029.80.620.9029.20.840.9229.80.87
SNIP0.8126.80.700.8729.90.660.8926.30.690.8928.10.830.9326.80.94
GraSP0.420.62-0.670.780.94-0.630.780.62-0.670.470.62-0.790.391.23-0.88
Synflow0.797.350.600.847.350.530.907.350.730.877.350.710.927.350.91
LogSynflow0.797.350.600.847.350.520.907.350.730.877.350.680.927.350.89
Fisher0.8116.30.610.8718.50.640.9029.30.610.8928.10.790.929.830.92
JacobCov0.8211.90.580.8821.40.720.845.630.400.9029.80.700.9013.70.52
NASWOT0.7926.30.690.8723.10.710.8923.10.620.8926.30.830.9126.30.87
T-CET0.7926.30.630.8626.30.710.8926.30.380.8926.30.740.9429.90.65
CRoZe0.7926.30.460.8726.70.540.8426.40.180.8929.30.550.9128.10.42
DSS0.8025.90.600.847.350.530.899.890.730.8910.60.720.9229.80.91
ZiCo0.8126.80.520.8626.30.620.8425.60.260.8926.30.630.9126.30.50
ZiCo++0.8125.60.730.8629.30.750.8425.60.620.8929.30.830.9429.30.86
SpectralFormer0.790.48-0.850.48-0.850.48-0.860.48-0.890.48-
Oracle0.858.42-0.899.23-0.913.20-0.918.43-0.9620.5-
", + "bbox": [ + 222, + 484, + 779, + 724 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Table 2: Comparison of search results among proxies, presenting test Overall Accuracy (OA) and corresponding model size (MS) determined by each proxy, as well as their Spearman correlation $(\\rho)$ between proxy scores and final test OA after training. The evaluation is conducted over a search space of 2000 subnets across five HSI datasets. MS values are scaled by $10^{6}$ . T-CET is computed with SNIP and NASWOT [35].", + "bbox": [ + 215, + 726, + 785, + 794 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- The effectiveness of proxies varies across datasets. JacobCov achieves the highest OA for Indian Pines, Houston2013, and KSC datasets, while Grad-Norm and T-CET demonstrate the highest OA of 0.90 and 0.94 for the PaviaU and Salinas datasets, respectively.", + "- Some proxies may yield high OA but exhibit low Spearman correlation. For instance, JacobCov achieves the highest OA for three datasets but with considerably lower Spearman correlations compared to the best ones, emphasizing the importance of considering both OA and Spearman correlation for comprehensive assessment.", + "- $\\mathrm{ZiCo}^{++}$ does not outperform $\\mathrm{ZiCo}$ in terms of OA across all datasets except for Salinas. However, it significantly exceeds $\\mathrm{ZiCo}$ in Spearman correlation across all datasets, achieving the highest Spearman correlation among all proxies for the Indian Pines and Houston datasets.", + "- Apart from OA, model size, and $\\rho$ , searching efficiency is crucial for evaluating proxies. Table 3 compares search times of all proxies. Except for ZiCo and CRoZe, the search times for the other proxies are remarkably similar. ZiCo's extended search time can be attributed to the computation of scores across individual samples, requiring gradient calculations for each sample rather than utilizing batch mean gradients." + ], + "bbox": [ + 225, + 146, + 787, + 434 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/d358cff869a00aa0cb79fd3b04cac9c3f35f684c61ec95b7097a61caa7075305.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
ProxyGradNormSNIPSynflowFisherJacobCovNASWOTCRoZeDSSZiCoZiCo++
Search time (h)0.120.120.120.200.120.140.380.170.840.14
", + "bbox": [ + 222, + 476, + 781, + 508 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Table 3: Comparison of search times for each proxy across a search space of 2000 subnets on the Indian Pines dataset.", + "bbox": [ + 215, + 508, + 787, + 536 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Constrained Search Space We visualize Spearman correlations and proposed OA across varying model size constraints in Fig. 3. The depicted range represents the minimum and maximum model sizes within the search space. For instance, the range from 0 to $0.5\\mathrm{e}7$ signifies model sizes from 0 to $5\\mathrm{M}$ , and from $0.5\\mathrm{e}7$ to $1\\mathrm{e}7$ , it represents sizes from $5\\mathrm{M}$ to $10\\mathrm{M}$ . We make three observations:", + "bbox": [ + 215, + 582, + 787, + 659 + ], + "page_idx": 7 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- The Spearman correlation between proxies and OA decreases with increasing model size, indicating higher efficacy of proxies for smaller models.", + "- The Oracle OA increases for models smaller than 5M and remains relatively stable thereafter, with the optimal OA observed at 5M.", + "- Most proxies favor complex models and struggle when simpler models are more effective, suggesting their limited capability to filter out underperforming models." + ], + "bbox": [ + 225, + 672, + 787, + 780 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Takeaway ①: Most proxies can identify a transformer with better accuracy than the human-crafted counterpart, SpectralFormer. However, the proposed architectures are more complex than necessary, when compared to the oracle.", + "bbox": [ + 215, + 792, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/600ee957334a2cf96c3ca512bdb5eed31c5fe265d358610b4b9d747a82ca2fb0.jpg", + "image_caption": [ + "Fig. 3: Spearman correlation and proxy-proposed OA across different model size constraints on the Indian Pines dataset." + ], + "image_footnote": [], + "bbox": [ + 218, + 146, + 501, + 334 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/aa795b3fb7b0a0c6739a2f87e188d4bdb85107fbd6ec42666712c5fbeb3042a1.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 501, + 146, + 782, + 334 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.2 RQ2: What Factors Influence Hyperspectral Image Transformer Performance?", + "text_level": 1, + "bbox": [ + 212, + 407, + 782, + 436 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In RQ1, we show that proxies identify a highly accurate, yet complex model. However, is this an optimal Hyperspectral transformer? To answer this, in this section, we analyze the relationship between the performance and the architectural factors. We have three key observations:", + "bbox": [ + 212, + 448, + 782, + 508 + ], + "page_idx": 8 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Fig. 4 presents the Spearman correlation between OA and: depth (depth), embedding dimension (embed_dim), number of heads (num_heads), and MLP ratio (mlp_ratio). Notably, factors such as the number of heads and MLP ratio show minimal correlation with overall model performance across all datasets. Conversely, the influence of depth and embedding dimension varies across datasets, with embedding dimension exhibiting particularly high correlations across all datasets, reaching 0.91 on Salinas dataset.", + "- Fig. 4 presents average head embedding dimension (mean_head_dim), average MLP dimension (mean_mlp_dim), sum of all head dimensions (sum_head_dim), sum of all MLP dimensions (sum_mlp_dim), and model size. Notably, average head dimension and average MLP ratio exhibit OA impacts similar to the embedding dimension, while total head dimension and total MLP ratio aggregate influence from both embedding dimension and depth. However, for datasets like PaviaU, where OA relies solely on embedding dimension, the impact of total head dimension diminishes. Conversely, for datasets like Indian Pines, Houston2013, and KSC, where OA correlates with both embedding dimension and depth, Spearman correlation of total head dimension increases. This suggests that if proxy scores correlate solely with one factor, they may not be robust indicators.", + "- In Fig. 5, we visualize the highest OA of different values of each component across all datasets. Optimal embedding dimension and depth vary across" + ], + "bbox": [ + 225, + 522, + 784, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/b9627a007813822a3bbca27372306b22a11654d07c6dd51b22727a3d80fae56d.jpg", + "image_caption": [ + "Spearman correlations between OA and each component", + "Fig. 4: Spearman correlations between final test OA and components of the search space across five datasets. num_heads and mlp_ratio exhibit minimal correlation, while embed_dim, sum_head_dim, and sum_mlp_dim show high correlation across all datasets." + ], + "image_footnote": [], + "bbox": [ + 256, + 166, + 718, + 330 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "datasets. As an example, in Indian Pines, OA increases with the embedding dimension, peaking at embed_dim = 128 and remaining stable thereafter. Similarly, depth = 8 results in the highest OA, with no further improvements observed when increasing the depth to 9 or 10. Additionally, the impact of the average number of heads and the average MLP ratio on model performance is showcased in the right two subplots, where mean number of heads of 4 - 5 and mean MLP ratio of 3 - 4 yield relatively stable and high OA.", + "bbox": [ + 241, + 445, + 787, + 551 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/09e28cb47fee7590787f90e5a3c5b0fceca112ac459d1c88fc6bbeae73301996.jpg", + "image_caption": [ + "Fig. 5: The best OA corresponding to different values of diverse factors, including the embedding dimension (embed_dim), the depth (depth), the average number of heads (mean_heads_num), and the average MLP ratio (mean_mlp_ratio)." + ], + "image_footnote": [], + "bbox": [ + 217, + 604, + 784, + 689 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Takeaway ②: Across datasets, embedding dimension and depth exhibit consistent sensitivity, though with slight variations. Furthermore, while larger models generally achieve better performance, optimal networks do not necessarily have to be the largest or most complex ones.", + "bbox": [ + 212, + 777, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.3 RQ3: What Factors Influence the Proxy Scores?", + "text_level": 1, + "bbox": [ + 215, + 146, + 656, + 161 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To answer this question, we analyze the sensitivity of proxy scores to architecture components, input data, and module types separately.", + "bbox": [ + 212, + 172, + 785, + 203 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Sensitivity to Architectural Components We examine Spearman correlations between proxy scores and each component on Indian Pines dataset in Fig. 6. Additionally, Spearman correlations between OA and each component are shown in the last column as a comparison. Depth and embedding dimension significantly impact scores of most proxies. Specifically, #Flops, SNIP, and GradNorm display a strong correlation (over 0.95) with the sum of heads' dimensions, surpassing the correlation with OA. Furthermore, Synflow, LogSynflow, and DSS show perfect correlation with embedding dimension and minimal correlation with depth due to taking sign of model parameters, which also exceeds the correlation with OA. Interestingly, removing sign operations improves the performance of Synflow, LogSynflow, and DSS. Details are shown in Section 7.3 in our supplementary material. These discrepancies in the correlation between OA and proxy scores result in a performance gap between proxies and oracle results.", + "bbox": [ + 212, + 219, + 787, + 430 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/bd90242dea15cdf3395789193643ee2b40dff3753c4030d934e721689d453ee2.jpg", + "image_caption": [ + "Fig.6: Spearman correlations between proxy scores and architecture components on Indian Pines dataset." + ], + "image_footnote": [], + "bbox": [ + 225, + 460, + 792, + 619 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Sensitivity to Input Data Considering Synflow, LogSynflow, NASWOT, and DSS are data-agnostic, we explore the sensitivity of remaining proxies to input data. To investigate this, we conduct search experiments using one batch of random input data across the remaining proxies. The results, presented in Table 4, reveal that performing the search with random inputs yields outcomes very similar to those obtained with the Indian Pines dataset. This suggests that the majority of the proxies exhibit negligible dependency on specific input data.", + "bbox": [ + 212, + 688, + 787, + 794 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Furthermore, we compare OA, SNIP, and GradNorm scores from the same models between PaviaU and Indian Pines datasets in Fig. 7. The plots of SNIP and GradNorm indicate a perfect correlation between scores across different", + "bbox": [ + 212, + 795, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/d0777ff4f80a8b89a72dbf1dbe1accaea30ce3fa6eed9b0a2aa7c604da18ea00.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
ProxyOAρ
Indian PinesRandom InputIndian PinesRandom Input
GradNorm0.810.810.710.71
SNIP0.810.810.700.69 (-0.01)
GraSP0.420.44 (+0.02)-0.67-0.70 (-0.03)
Fisher0.810.82 (+0.01)0.610.55 (-0.06)
JacobCov0.820.79 (-0.03)0.580.68 (+0.1)
ZiCo0.810.79 (-0.02)0.520.52
", + "bbox": [ + 236, + 143, + 767, + 261 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Table 4: Comparison between searching with a batch of Indian Pines inputs and random inputs.", + "bbox": [ + 215, + 262, + 782, + 289 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "datasets, suggesting that the proxies are largely independent of the input data. However, the plot of OA shows significant variation between the two datasets, indicating that the same architecture yields very different performances depending on the dataset. This finding further emphasizes the gap between proxies and model performance.", + "bbox": [ + 212, + 332, + 784, + 407 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/16aef6e663694dea17a86a05dfc41d8e36fadafdf0789445d1995f16be1733d6.jpg", + "image_caption": [ + "Fig. 7: Comparisons of OA, SNIP, GradNorm of same subnetworks between PaviaU and Indian Pines datasets." + ], + "image_footnote": [], + "bbox": [ + 222, + 436, + 405, + 547 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/13079103e2e7fce302a8069267d847ba0981b710738465759af3e5df5009bc22.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 406, + 436, + 591, + 547 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/8f789f564f9527b743435c3bb5f28c042be110d6daa235e30f1d36ceb64ff425.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 596, + 436, + 779, + 547 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Sensitivity to Module Type (MSA vs. MLP) Given the distinct structures of MSA and MLP modules within a transformer architecture, we hypothesize that the effectiveness of the two modules for proxy scores might differ significantly. To validate our assumption, we separately compute DSS, Synflow, and SNIP scores for MSA and MLP modules. Our analysis reveals a significant score scale difference between MSA and MLP. For instance, for DSS scores, MSA $(2472 \\pm 259)$ is notably higher than MLP $(268 \\pm 366)$ , indicating the predominant contribution of MSA modules to final proxy scores, with minimal influence from MLP modules. To address this imbalance, we apply a logarithmic transformation to both module scores. The transformed results demonstrate comparable scores for MSA and MLP modules across all three proxies. Detailed scores are presented in Section 7.4 in our supplementary material.", + "bbox": [ + 212, + 612, + 785, + 792 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Furthermore, we assess the effectiveness of scores with and without logarithmic transformation, as shown in Table 5. The origin score is represented as origin_score = msa_score + mlp_score, and the new score is represented as", + "bbox": [ + 212, + 795, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "$\\text{logarithm\\_score} = \\log (msa\\_ score \\times mlp\\_ score)$ , where $msa\\_ score$ represents the cumulative score of all MSA layers, and $mlp\\_ score$ denotes the cumulative score of all MLP layers. The results indicate improvements with the logarithmic transformation, particularly for Synflow and DSS proxies.", + "bbox": [ + 212, + 146, + 787, + 207 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/48040df8edabd9e4e4ce4a25bd9bf6b212e0f190861cdc119169147c6727568e.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
DatasetSNIPGradNormSynflowDSS
originlogarithmoriginlogarithmoriginlogarithmoriginlogarithm
Indian Pines0.700.700.710.710.690.720.690.70
Houston20130.660.650.700.700.680.730.670.69
PaviaU0.690.700.620.640.690.630.700.69
KSC0.830.820.840.840.820.860.820.84
Salinas0.940.940.870.900.930.900.940.94
", + "bbox": [ + 218, + 232, + 782, + 338 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 5: Comparison of Spearman correlations between proxy scores and OA, with and without logarithmic transformation.", + "bbox": [ + 215, + 339, + 782, + 367 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Takeaway ③: Proxies exhibit a higher correlation with embedding dimension and depth than actual model performance, suggesting limited sensitivity to input data. Enhancing proxies' robustness may involve integrating more input information and decreasing sensitivity to individual architecture components. Furthermore, assessing scores independently for MSA and MLP modules, or employing distinct metrics for each, could improve proxy performance.", + "bbox": [ + 212, + 391, + 787, + 484 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.4 RQ4: Are Proxies Complementary?", + "text_level": 1, + "bbox": [ + 214, + 507, + 553, + 523 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Motivation. Our results indicate that TAS proxies are fast but may lack reliability, with search performance varying across datasets. Therefore, TAS proxies solely remain problematic. Some studies have employed proxies for pre-filtering or combined them with other search methods, such as one-shot search, evolutionary algorithms, or Bayesian optimization [33,34]. Here, we propose an alternative approach to leverage proxies for enhancing search performance.", + "bbox": [ + 212, + 534, + 787, + 625 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Setup. We seek to forecast a network's performance using its architectural structure and proxy scores. By retraining all sampled networks and collecting their proxy scores, we explore the feasibility of predicting a model's OA, alongside exploring the number of training samples needed for accurate predictions. We apply a default Random Forest model, with inputs comprising 2000 samples. Each sample represents a subnetwork sampled from the search space, encompassing attributes such as depth, embed_dim, num_heads, mlp_ratio, and various proxy scores including SNIP, GradNorm, Synflow, DSS, ZiCo, and Fisher scores. The target variable is OA, derived from the Indian Pines dataset. Detailed settings are presented in Section 7.5 in our supplementary material.", + "bbox": [ + 212, + 641, + 787, + 792 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Results. Fig. 8 displays the test outcomes. The left subplot presents the predicted OA alongside the actual OA for 1950 networks trained on 50 networks.", + "bbox": [ + 214, + 809, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The Spearman correlation between actual and predicted OA reaches 0.80, surpassing the best correlation obtained from proxies by $9\\%$ . Additionally, the right subplot demonstrates a correlation improvement with an increase in the number of training networks. Each result represents the mean and standard deviation across five runs with random seeds. Notably, the correlation rises to 0.78, a $6\\%$ increase over the untrained scenario, with only 20 networks trained. It is worth noting that training the Random Forest model takes less than one minute with a training size of $0.5\\mathrm{x}$ , making the cost almost negligible compared to training the original subnetworks with actual input data.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/1d7a5ce949b95cf41a1e5e444ae4f6519d727e969ac3cbbd2a27482abdfe5a98.jpg", + "image_caption": [ + "Fig. 8: Predicting subnetworks' performance using Random Forest model." + ], + "image_footnote": [], + "bbox": [ + 218, + 311, + 478, + 470 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/3a1cbf87d0bb80e5f98fb3fcc4f565b899cb9d5c1b88cf08d0934f0e99f539c6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 521, + 311, + 782, + 470 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Takeaway ④: Proxies, while not entirely reliable on their own, can complement other architecture search methods to improve search efficiency or serve as training data for models predicting network performance to improve search accuracy.", + "bbox": [ + 212, + 531, + 787, + 593 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 621, + 359, + 636 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this study, we introduced HyTAS: a benchmark for Hyperspectral Image Transformer Architecture Search. We defined a search space comprising 2000 Hyperspectral image transformers and evaluated 12 proxies across five HSI datasets. Our key observations are as follows: Most proxies can identify a transformer surpassing the human-crafted architecture, SpectralFormer, within 10 minutes. However, there's a significant performance gap between proxies and optimal results, driven by preferences for larger and more complex models, minimal dependence on input data, and disparities between MSA and MLP modules. Our proposed proxy, $\\mathrm{ZiCo}^{++}$ , demonstrates superior performance compared to $\\mathrm{ZiCo}$ and other proxies. Furthermore, proxies can enhance the prediction of subnetworks' performance when used as input data. These findings encourage the TAS community to explore new methods for improving search quality and efficiency.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was funded by the Dutch Science Foundation (NWO) under grant 482.20.700. Furthermore, we deeply appreciate the invaluable and constructive feedback offered by our anonymous reviewers and the meta-reviewer. Their insights have greatly enriched our manuscript.", + "bbox": [ + 212, + 175, + 785, + 236 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 258, + 321, + 273 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Abdelfattah, M.S., Mehrotra, A., Dudziak, L., Lane, N.D.: Zero-cost proxies for lightweight nas. arXiv preprint arXiv:2101.08134 (2021)", + "2. Baker, B., Gupta, O., Naik, N., Raskar, R.: Designing neural network architectures using reinforcement learning. arXiv preprint arXiv:1611.02167 (2016)", + "3. Cavagnero, N., Robbiano, L., Caputo, B., Averta, G.: Freerea: Training-free evolution-based architecture search. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1493-1502 (2023)", + "4. Chen, B., Li, P., Li, C., Li, B., Bai, L., Lin, C., Sun, M., Yan, J., Ouyang, W.: Glit: Neural architecture search for global and local image transformer. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12-21 (2021)", + "5. Chen, M., Peng, H., Fu, J., Ling, H.: Autoformer: Searching transformers for visual recognition. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 12270-12280 (2021)", + "6. Dale, L.M., Thewis, A., Boudry, C., Rotar, I., Dardenne, P., Baeten, V., Pierna, J.A.F.: Hyperspectral imaging applications in agriculture and agro-food product quality and safety control: A review. Applied Spectroscopy Reviews 48(2), 142-159 (2013)", + "7. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)", + "8. Furbank, R.T., Silva-Perez, V., Evans, J.R., Condon, A.G., Estavillo, G.M., He, W., Newman, S., Poiré, R., Hall, A., He, Z.: Wheat physiology predictor: predicting physiological traits in wheat from hyperspectral reflectance measurements using deep learning. Plant Methods 17, 1-15 (2021)", + "9. Goetz, A.F.: Three decades of hyperspectral remote sensing of the earth: A personal view. Remote sensing of environment 113, S5-S16 (2009)", + "10. Graña, M., Veganzons, M., Ayerdi, B.: Hyperspectral remote sensing scenes. Hyperspectral Remote Sensing Scenes - Grupo de Inteligencia Computacional (GIC) https://www.ehu.eus/ccwintco/index.php/Hyperspectral_Remote_Sensing_Scenes", + "11. Ha, H., Kim, M., Hwang, S.J.: Generalizable lightweight proxy for robust nas against diverse perturbations. arXiv preprint arXiv:2306.05031 (2023)", + "12. Hong, D., Han, Z., Yao, J., Gao, L., Zhang, B., Plaza, A., Chanussot, J.: Spectralformer: Rethinking hyperspectral image classification with transformers. IEEE Transactions on Geoscience and Remote Sensing 60, 1-15 (2021)", + "13. Jakubczyk, K., Siemiatkowska, B., Wieckowski, R., Rapcewicz, J.: Hyperspectral imaging for mobile robot navigation. Sensors 23(1), 383 (2022)", + "14. Lee, N., Ajanthan, T., Torr, P.H.: Snip: Single-shot network pruning based on connection sensitivity. arXiv preprint arXiv:1810.02340 (2018)" + ], + "bbox": [ + 218, + 287, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "15. Li, G., Hoang, D., Bhardwaj, K., Lin, M., Wang, Z., Marculescu, R.: Zero-shot neural architecture search: Challenges, solutions, and opportunities. arXiv preprint arXiv:2307.01998 (2023)", + "16. Li, G., Yang, Y., Bhardwaj, K., Marculescu, R.: Zico: Zero-shot nas via inverse coefficient of variation on gradients. arXiv preprint arXiv:2301.11300 (2023)", + "17. Li, S., Song, W., Fang, L., Chen, Y., Ghamisi, P., Benediktsson, J.A.: Deep learning for hyperspectral image classification: An overview. IEEE Transactions on Geoscience and Remote Sensing 57(9), 6690-6709 (2019)", + "18. Liu, C., Zoph, B., Neumann, M., Shlens, J., Hua, W., Li, L.J., Fei-Fei, L., Yuille, A., Huang, J., Murphy, K.: Progressive neural architecture search. In: Proceedings of the European conference on computer vision (ECCV). pp. 19-34 (2018)", + "19. Lopes, V., Alirezazadeh, S., Alexandre, L.A.: Epe-nas: Efficient performance estimation without training for neural architecture search. In: International Conference on Artificial Neural Networks. pp. 552-563. Springer (2021)", + "20. Mellor, J., Turner, J., Storkey, A., Crowley, E.J.: Neural architecture search without training. In: International Conference on Machine Learning. pp. 7588-7598. PMLR (2021)", + "21. Nagasubramanian, K., Jones, S., Singh, A.K., Sarkar, S., Singh, A., Ganapathysubramanian, B.: Plant disease identification using explainable 3d deep learning on hyperspectral images. Plant methods 15, 1-10 (2019)", + "22. Pham, H., Guan, M., Zoph, B., Le, Q., Dean, J.: Efficient neural architecture search via parameters sharing. In: International conference on machine learning. pp. 4095-4104. PMLR (2018)", + "23. Su, X., You, S., Xie, J., Zheng, M., Wang, F., Qian, C., Zhang, C., Wang, X., Xu, C.: Vitas: Vision transformer architecture search. In: European Conference on Computer Vision. pp. 139-157. Springer (2022)", + "24. Sun, L., Zhao, G., Zheng, Y., Wu, Z.: Spectral-spatial feature tokenization transformer for hyperspectral image classification. IEEE Transactions on Geoscience and Remote Sensing 60, 1-14 (2022)", + "25. Tanaka, H., Kunin, D., Yamins, D.L., Ganguli, S.: Pruning neural networks without any data by iteratively conserving synaptic flow. Advances in neural information processing systems 33, 6377-6389 (2020)", + "26. Theis, L., Korshunova, I., Tejani, A., Huszar, F.: Faster gaze prediction with dense networks and fisher pruning. arXiv preprint arXiv:1801.05787 (2018)", + "27. Transon, J., d'Andrimont, R., Maugnard, A., Defourny, P.: Survey of hyperspectral earth observation applications from space in the sentinel-2 context. Remote Sensing 10(2), 157 (2018)", + "28. Trierscheid, M., Pellenz, J., Paulus, D., Balthasar, D.: Hyperspectral imaging or victim detection with rescue robots. In: 2008 IEEE International Workshop on Safety, Security and Rescue Robotics. pp. 7-12. IEEE (2008)", + "29. Tsou, C.H., Lin, Y.C., Huang, Y.C., Li, W., Chen, J.C., Chen, C.S.: SEEKING THE SEARCH SPACE FOR SIZE-AWARE VISION TRANSFORMER ARCHITECTURE (2024), https://openreview.net/forum?id=iSdH16qEs2", + "30. Turner, J., Crowley, E.J., O'Boyle, M., Storkey, A., Gray, G.: Blockswap: Fisher-guided block substitution for network compression on a budget. arXiv preprint arXiv:1906.04113 (2019)", + "31. Wang, C., Zhang, G., Grosse, R.: Picking winning tickets before training by preserving gradient flow. arXiv preprint arXiv:2002.07376 (2020)", + "32. Wang, D., Vinson, R., Holmes, M., Seibel, G., Bechar, A., Nof, S., Tao, Y.: Early detection of tomato spotted wilt virus by hyperspectral imaging and outlier removal" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "F.Zhou et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "auxiliary classifier generative adversarial nets (or-ac-gan). Scientific reports 9(1), 1-14 (2019)", + "33. White, C., Safari, M., Sukthanker, R., Ru, B., Elsken, T., Zela, A., Dey, D., Hutter, F.: Neural architecture search: Insights from 1000 papers. arXiv preprint arXiv:2301.08727 (2023)", + "34. Xiang, L., Dudziak, L., Abdelfattah, M.S., Chau, T., Lane, N.D., Wen, H.: Zero-cost operation scoring in differentiable architecture search. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 10453-10463 (2023)", + "35. Xiang, L., Hunter, R., Xu, M., Dudziak, L., Wen, H.: Exploiting network compressibility and topology in zero-cost nas. In: International Conference on Automated Machine Learning. pp. 18-1. PMLR (2023)", + "36. Xie, C., Shao, Y., Li, X., He, Y.: Detection of early blight and late blight diseases on tomato leaves using hyperspectral imaging. Scientific reports 5(1), 1-11 (2015)", + "37. Xiong, Z., Minshan, C., Abhinav, S., Díaz, D.J.C.F.: 2013 IEEE GRSS Data Fusion Contest - Fusion of Hyperspectral and LiDAR Data (2013), https://hyperspectral.ee.uh.edu/?page_id=459", + "38. Zhou, F., Killickaya, M., Vanschoren, J.: Locality-aware hyperspectral classification. arXiv preprint arXiv:2309.01561 (2023)", + "39. Zhou, Q., Sheng, K., Zheng, X., Li, K., Sun, X., Tian, Y., Chen, J., Ji, R.: Training-free transformer architecture search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10894-10903 (2022)", + "40. Zoph, B., Le, Q.V.: Neural architecture search with reinforcement learning. arXiv preprint arXiv:1611.01578 (2016)" + ], + "bbox": [ + 215, + 146, + 785, + 465 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "HyTAS: Hyperspectral Transformer Architecture Search", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_model.json b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_model.json new file mode 100644 index 0000000000000000000000000000000000000000..799aec31aae9d95b831628d1f3a7536f45654513 --- /dev/null +++ b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_model.json @@ -0,0 +1,2489 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.244, + 0.141, + 0.761, + 0.187 + ], + "angle": 0, + "content": "HyTAS: A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis" + }, + { + "type": "text", + "bbox": [ + 0.231, + 0.212, + 0.772, + 0.229 + ], + "angle": 0, + "content": "Fangqin Zhou\\(^{1}\\), Mert Kilickaya\\(^{1}\\), Joaquin Vanschoren\\(^{1}\\), and Ran Piao\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.24, + 0.765, + 0.254 + ], + "angle": 0, + "content": "Automated Machine Learning Group, Eindhoven University of Technology, the" + }, + { + "type": "text", + "bbox": [ + 0.461, + 0.255, + 0.543, + 0.267 + ], + "angle": 0, + "content": "Netherlands" + }, + { + "type": "text", + "bbox": [ + 0.388, + 0.269, + 0.613, + 0.282 + ], + "angle": 0, + "content": "{f.zhou, j.vanschoren}@tue.nl" + }, + { + "type": "text", + "bbox": [ + 0.384, + 0.284, + 0.618, + 0.296 + ], + "angle": 0, + "content": "https://github.com/openml-labs" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.333, + 0.744, + 0.501 + ], + "angle": 0, + "content": "Abstract. Hyperspectral Imaging (HSI) plays an increasingly critical role in precise vision tasks within remote sensing, capturing a wide spectrum of visual data. Transformer architectures have significantly enhanced HSI task performance, while advancements in Transformer Architecture Search (TAS) have improved model discovery. To harness these advancements for HSI classification, we make the following contributions: i) We propose HyTAS, the first benchmark on transformer architecture search for Hyperspectral imaging, ii) We comprehensively evaluate 12 different methods to identify the optimal transformer over 5 different datasets, iii) We perform an extensive factor analysis on the Hyperspectral transformer search performance, greatly motivating future research in this direction. All benchmark materials are available at HyTAS." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.513, + 0.741, + 0.541 + ], + "angle": 0, + "content": "Keywords: Hyperspectral Image Classification \\(\\cdot\\) Transformer Architecture Search \\(\\cdot\\) Zero-Cost Proxies \\(\\cdot\\) Benchmark and Analysis" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.567, + 0.376, + 0.582 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.787, + 0.659 + ], + "angle": 0, + "content": "Hyperspectral Imaging (HSI) captures a broad spectrum of electromagnetic wavelengths, providing detailed spectral information beyond conventional RGB images. This rich spectral data has significantly impacted various industries, including agriculture for plant monitoring [6,8,21,32,36], remote sensing for Earth analysis [9,27], and robotics for enhanced navigation and vision [13,28]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.749 + ], + "angle": 0, + "content": "Scientists in fields like agriculture or remote sensing may seek to analyze Hyperspectral images using transformer models, see Fig. 1. However, designing high-performing Hyperspectral image transformers requires significant expertise and computational resources. Transformer Architecture Search (TAS) methods like AutoFormer [5] or ViTAS [23] can help but demand extensive computational resources (e.g., 24 GPU days for AutoFormer)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "An alternative is using training-free architecture search techniques, known as zero-cost proxies [14, 16, 25, 31, 39]. Hereafter, we will use the term \"proxy\" for brevity. Proxies quickly evaluate transformer architectures without training, offering two key advantages: i) Efficiency: Proxies identify high-performing transformers within minutes. ii) Data Independence: Many proxies do not require real data, reducing setup and data collection costs [3,20,25,39]. This characteristic is" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "image", + "bbox": [ + 0.262, + 0.145, + 0.734, + 0.291 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.302, + 0.789, + 0.361 + ], + "angle": 0, + "content": "Fig. 1: A scientist outside AI domain may find it difficult to design a novel Hyperspectral image transformer tailored to their tasks and data. To automate the design of Hyperspectral transformers, we introduce Hyperspectral Transformer Architecture Search (HyTAS) in this paper. The scientist images are generated by DALL-E." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.387, + 0.789, + 0.432 + ], + "angle": 0, + "content": "especially advantageous for hyperspectral imaging applications, where the setup and calibration of the camera, as well as the collection and annotation of data, incur significant costs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.433, + 0.816, + 0.568 + ], + "angle": 0, + "content": "To that end, in this paper, we introduce Hyperspectral Transformer Architecture Search (HyTAS), to automatically identify Hyperspectral transformers tailored for downstream tasks and datasets. Our motivations are three-fold: i) Democratization: HyTAS enables researchers, especially in fields like biology or agriculture, to identify top-performing, lightweight models using minimal resources. ii) Attention: We aim to highlight the unique challenges of HSI to the NAS community, which has focused more on RGB images. iii) Novelty: We share novel findings to guide the development of better hyperspectral-specific search techniques and architectures." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.789, + 0.659 + ], + "angle": 0, + "content": "Our approach begins by generating a substantial pool of candidate Hyperspectral transformers. Subsequently, we assess the performance of various proxies in their capacity to efficiently identify accurate Hyperspectral image transformers. Lastly, we conduct a comprehensive factor analysis to elucidate the factors influencing the performance of both Hyperspectral image transformers and proxy-based transformer search methods." + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.66, + 0.674, + 0.674 + ], + "angle": 0, + "content": "To sum up, this paper presents three primary contributions:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.675, + 0.787, + 0.719 + ], + "angle": 0, + "content": "I. We introduce HyTAS, the pioneering benchmark for Transformer Architecture Search in HSI classification, comprising 2000 distinct Hyperspectral Image transformer architectures." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.72, + 0.786, + 0.763 + ], + "angle": 0, + "content": "II. We conduct comprehensive benchmarking using 12 proxies across 5 datasets. Our benchmarking demonstrates the capability to achieve superior performance over a well-established, human-crafted counterpart within minutes." + }, + { + "type": "text", + "bbox": [ + 0.212, + 0.765, + 0.787, + 0.84 + ], + "angle": 0, + "content": "III. We analyze various factors influencing the effectiveness of Transformer architecture search. Our findings include: i) Proxies demonstrate a bias towards larger models, ii) Proxies operate without necessitating real data input, iii) Proxies synergistically complement each other in predicting the accuracy of input transformers, suggesting promising avenues for future research." + }, + { + "type": "list", + "bbox": [ + 0.212, + 0.675, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.389, + 0.161 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.176, + 0.631, + 0.192 + ], + "angle": 0, + "content": "2.1 Transformer Architecture Search via Proxies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.2, + 0.788, + 0.336 + ], + "angle": 0, + "content": "Neural Architecture Search (NAS) customizes optimal architectures for specific tasks [2,18,22,40]. Transformer Architecture Search (TAS) is gaining popularity alongside transformer-based model advancements [4, 5, 23, 39]. However, these methods are computationally intensive, often taking days or months to converge [15, 33]. Many researchers lack resources; for instance, this study employs only a single GPU. An alternative approach involves using proxy functions, which swiftly assess architecture fitness without training [3, 14-16, 25]. In this paper, we adapt proxy methods to quickly search over a large database of Hyperspectral transformers." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.358, + 0.55, + 0.374 + ], + "angle": 0, + "content": "2.2 Hyperspectral Image Transformers" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.382, + 0.788, + 0.519 + ], + "angle": 0, + "content": "Hyperspectral image classification involves processing input cubes with significantly more channels (e.g., 200 vs. 3) and lower spatial resolution than conventional RGB imaging [17]. With the emergence of Vision-Transformers (ViT) [7], manual design of transformer architectures for Hyperspectral image classification has become common practice. For instance, Hong et al. [12] introduce Spectral-Former, adapting ViT for HSI classification, while Sun et al. [24] and Zhou et al. [38] enhance it with spatial-local attention modules. However, manual network design is laborious and resource-intensive. Therefore, in this study, we propose HyTAS to automate Hyperspectral image transformer design." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.541, + 0.442, + 0.559 + ], + "angle": 0, + "content": "3 HyTAS Benchmark" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.572, + 0.788, + 0.661 + ], + "angle": 0, + "content": "In practice, the optimal architecture is determined by its performance, often measured by the highest test accuracy for classification tasks. However, in TAS proxies, where training is not involved, a proxy measure is needed to rank architectures sampled from a search space based on their initial model weights or one-step gradients. This proxy score serves as the metric for estimating the performance of each architecture." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.663, + 0.788, + 0.754 + ], + "angle": 0, + "content": "The process of TAS proxy for HSI classification is illustrated in Fig. 2, containing four main steps: 1). Patchify HSI image and tokenize each patch along its spectra, then randomly sample a batch of input. 2). Design a search space and sample architectures from it. 3). Select a proxy to estimate the sampled architectures and rank them by their proxy scores. 4). Evaluate the performance of search proxies. Formally, the objective of TAS proxy is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.349, + 0.769, + 0.786, + 0.79 + ], + "angle": 0, + "content": "\\[\na ^ {*} = \\arg \\max _ {a \\in \\mathcal {A}} \\mathrm {O A} (a) \\equiv a ^ {*} = \\arg \\max _ {a \\in \\mathcal {A}} \\mathcal {F} _ {s} (a) \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "where \\(a\\) is a transformer architecture sampled from the search space \\(\\mathcal{A}\\), OA and \\(\\mathcal{F}_s\\) denote the test overall accuracy and a scoring function, respectively. The objective aims to discover the optimal architecture \\(a^*\\) through a scoring function" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.117, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.116, + 0.361, + 0.127 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.147, + 0.784, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.33, + 0.788, + 0.415 + ], + "angle": 0, + "content": "Fig. 2: Diagram of TAS proxies for HSI classification: (1) Patchify the image and tokenize each patch along its spectra. (2) Randomly sample architectures from a designed search space. (3) Select a proxy to compute scores for sampled architectures after passing a batch of input. (4) Use the scores to rank architectures and choose the one with the highest score to retrain. Proxy evaluation metrics include test overall accuracy, model size, Spearman correlation between proxy scores and test OA, and search time." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.446, + 0.788, + 0.492 + ], + "angle": 0, + "content": "instead of training all models. Designing a good search space \\(\\mathcal{A}\\) and a suitable proxy scoring function that accurately estimates architectures' performance is crucial for TAS proxies." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.518, + 0.424, + 0.532 + ], + "angle": 0, + "content": "3.1 Benchmark Proxies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.548, + 0.788, + 0.623 + ], + "angle": 0, + "content": "Optimizing Equation 1 relies on employing an appropriate proxy scoring function \\(\\mathcal{F}_s\\). In this section, we provide a concise overview of various existing proxies commonly utilized within the NAS and TAS communities. The mathematical equation of each proxy as well as further details are presented in Section 7.1 in our supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.625, + 0.787, + 0.655 + ], + "angle": 0, + "content": "GradNorm [1]: aggregates the Euclidean norms of each layer's gradients after processing a single batch of training data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.656, + 0.787, + 0.685 + ], + "angle": 0, + "content": "SNIP [14]: calculates a saliency metric by incorporating both gradients and weights, facilitating parameter pruning in neural networks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.687, + 0.788, + 0.732 + ], + "angle": 0, + "content": "GraSP [31]: considers both the first-order and second-order derivatives of the network to preserve training dynamics instead of the loss at the beginning of training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.733, + 0.787, + 0.763 + ], + "angle": 0, + "content": "Synflow [25]: a modification of SNIP that eliminates the absolute expression to address layer collapse during parameter pruning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.787, + 0.809 + ], + "angle": 0, + "content": "LogSynflow [3]: addresses the issue of neglecting the significance of weights due to gradients in Synflow, by scaling down the gradients with a logarithmic function before summing up the contributions of their weights." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.811, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Fisher: initially presented by [26] to achieve more runtime-efficient neural architectures, and utilized as a pruning metric at initialization by [30]. More" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "recently, [1] applied this metric to aggregate all gradients of the activations for scoring a network." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.784, + 0.205 + ], + "angle": 0, + "content": "JacobCov [19]: leverages gradients over the input data instead of parameters or activations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.784, + 0.237 + ], + "angle": 0, + "content": "NASWOT [20]: computes the network score according to its kernel matrix of the binary activation patterns between a batch of training inputs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.239, + 0.784, + 0.268 + ], + "angle": 0, + "content": "DSS [39]: specifically designed for transformer architectures via combining synaptic diversity scores of MSA and synaptic saliency scores of MLP modules." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.269, + 0.784, + 0.298 + ], + "angle": 0, + "content": "CROZe [11]: measures the consistency of features, parameters, and gradients between perturbed and clean samples." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.784, + 0.328 + ], + "angle": 0, + "content": "T-CET [35]: incorporates the orthogonality of gradient-based (SSNR) and activation-based (NASWOT) compressibility to score an architecture." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.33, + 0.784, + 0.36 + ], + "angle": 0, + "content": "ZiCo [16]: considers both absolute mean and standard deviation of gradients, emphasizing their influence on convergence rate and generalization capacity." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.383, + 0.45, + 0.398 + ], + "angle": 0, + "content": "3.2 A New Proxy: \\(\\mathrm{ZiCo}^{+ + }\\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.409, + 0.785, + 0.528 + ], + "angle": 0, + "content": "Inspired by ZiCo's principle of favoring networks with high absolute mean and low standard deviation gradient values for faster convergence and improved generalization, we introduce \\(\\mathrm{ZiCo}^{++}\\), a novel proxy. \\(\\mathrm{ZiCo}^{++}\\) enhances network expressive capacity by optimizing the mean and minimizing the standard deviation of Fisher information of activations across input samples. Additionally, to address the issue of the final score's heavy reliance on the number of layers in ZiCo, we incorporate a layer decay mechanism during score aggregation in \\(\\mathrm{ZiCo}^{++}\\). The mathematical formulation is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.313, + 0.54, + 0.785, + 0.612 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} Z i C o ^ {+ +} \\triangleq \\sum_ {i = 1} ^ {n - 1} Z i C o _ {i} ^ {+ +} + \\sum_ {i = n} ^ {N - 1} \\frac {1}{i - n + 1} Z i C o _ {i} ^ {+ +} + Z i C o _ {N} ^ {+ +} \\quad \\text {s . t .} \\\\ Z i C o _ {i} ^ {+ +} \\triangleq \\log \\left(\\sum_ {\\omega \\in \\theta_ {l}} \\frac {\\mathbb {E} \\left[ \\left(\\nabla_ {\\omega} L \\left(X _ {i} , y _ {i} ; z _ {i}\\right) * z _ {i}\\right) ^ {2} \\right]}{\\sqrt {\\operatorname {V a r} \\left(\\left(\\nabla_ {\\omega} L \\left(X _ {i} , y _ {i} ; z _ {i}\\right) * z _ {i}\\right) ^ {2}\\right)}}\\right) \\tag {2} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.624, + 0.785, + 0.73 + ], + "angle": 0, + "content": "where \\(\\mathrm{ZiCo}_i^{++}\\) and \\(\\mathrm{ZiCo}_N^{++}\\) denote the \\(\\mathrm{ZiCo}^{++}\\) score of \\(i\\_\\text{th}\\) and the last layer, respectively. \\(n\\) is a tunable parameter representing the starting layer for layer decay, such that \\(n\\) is constrained by \\(n \\leq \\min\\_depth * 4 + 1\\), with \\(\\min\\_depth\\) denoting the minimal depth defined in the search space. In our experiments, we set \\(\\min\\_depth = 4\\) and \\(n = 6\\) to preserve the \\(\\mathrm{ZiCo}^{++}\\) score for the first embedding and the last projection layer, as well as for the first block containing two MSA layers and two MLP layers." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.754, + 0.432, + 0.769 + ], + "angle": 0, + "content": "3.3 Search Space Design" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.784, + 0.841 + ], + "angle": 0, + "content": "A transformer architecture contains an encoder and decoder, but for our classification task, we focus on encoder-only transformers. Typically, a transformer encoder consists of a series of blocks, each containing a multi-head self-attention (MSA) and a multi-layer perceptron (MLP) module. Therefore, the search space" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.207 + ], + "angle": 0, + "content": "should account for four key elements: embedding dimension (embed_dim), number of blocks (depth), number of attention heads (num_heads), and MLP embedding ratio (mlp_ratio) for each block. These components significantly impact model performance." + }, + { + "type": "table", + "bbox": [ + 0.261, + 0.23, + 0.744, + 0.279 + ], + "angle": 0, + "content": "
Componentsdepthembed_dimnum_headsmlp_ratio
Choices(4, 10, 1)(32, 240, 16)(3, 6, 1)(1, 6, 1)
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.28, + 0.788, + 0.335 + ], + "angle": 0, + "content": "Table 1: The search space across all datasets. It includes depth, embed_dim, num_heads, and mlp_ratio, with values indicating initial, final, and intervals. Different numbers of heads and MLP ratios are utilized for each block. Notably, the total number of layers equals depth * 4 + 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.361, + 0.787, + 0.406 + ], + "angle": 0, + "content": "Drawing inspiration from the effectiveness of manually crafted models proposed by [12, 38], we define our search space in Table 1. We randomly sample 2000 subnetworks from the search space for our experiments." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.424, + 0.449, + 0.443 + ], + "angle": 0, + "content": "4 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.451, + 0.735, + 0.466 + ], + "angle": 0, + "content": "Datasets We conduct experiments on five well-established HSI datasets:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.47, + 0.785, + 0.499 + ], + "angle": 0, + "content": "i. Indian Pines [10]: 224 spectral bands, \\(145 \\times 145\\) spatial resolution, 16 classes, 695 training, and \\(9k\\) testing samples." + }, + { + "type": "text", + "bbox": [ + 0.22, + 0.5, + 0.785, + 0.528 + ], + "angle": 0, + "content": "ii. Houston2013 [37]: 144 spectral bands, \\(349 \\times 1905\\) spatial resolution, 15 classes, \\(2k\\) training, and \\(12k\\) testing samples." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.529, + 0.785, + 0.557 + ], + "angle": 0, + "content": "iii. Pavia University (PaviaU) [10]: 103 spectral bands, \\(610 \\times 340\\) spatial resolution, 9 classes, \\(3k\\) training, and \\(40k\\) testing samples." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.557, + 0.785, + 0.586 + ], + "angle": 0, + "content": "iv. Kennedy Space Center (KSC) [10]: 176 spectral bands, \\(518 \\times 620\\) spatial resolution, 13 classes, 195 training, and \\(5k\\) testing samples." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.587, + 0.785, + 0.616 + ], + "angle": 0, + "content": "\\(v\\). Salinas scene [10]: 224 spectral bands, \\(512 \\times 217\\) spatial resolution, 16 classes, 800 training, and \\(53k\\) testing samples." + }, + { + "type": "list", + "bbox": [ + 0.216, + 0.47, + 0.785, + 0.616 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.621, + 0.788, + 0.698 + ], + "angle": 0, + "content": "Indian Pines and Salinas contain mostly agricultural vegetation, and the remaining three datasets consist of non-agricultural vegetation, such as roads and buildings. More details are presented in Section 7.2 in our supplementary material. For data-dependent search proxies, we randomly sample a batch of training data with a batch size of 64, consistent with the batch size used for retraining." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.706, + 0.788, + 0.784 + ], + "angle": 0, + "content": "Metrics We evaluate architecture performance with test Overall Accuracy (OA), indicating correctly predicted samples over all samples. Spearman correlation \\((\\rho)\\) measures the correlation between proxy scores and final test OA after training all sampled networks. We also compare Search Time (ST) and proposed Model Size (MS) for each proxy, calculated using the following equation from [29]:" + }, + { + "type": "equation", + "bbox": [ + 0.223, + 0.79, + 0.779, + 0.805 + ], + "angle": 0, + "content": "\\[\nM S (a, b, c, d) = 1, 5 3 9 d + a \\left(4 d + 2 5 6 c d + 1 9 2 c + 5 d + 7, 6 8 0 + 2 b d ^ {2} + b d + d\\right) + 2 d + \\# \\text {c l a s s} \\times (d + 1)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Here, \\( a \\), \\( b \\), \\( c \\), and \\( d \\) represent the depth, MLP ratio, number of heads, and embedding dimension, respectively. #class is the number of classes in the dataset." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.414, + 0.163 + ], + "angle": 0, + "content": "5 HyTAS Analysis" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.181, + 0.77, + 0.198 + ], + "angle": 0, + "content": "This section presents experiments to answer the following research questions:" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.213, + 0.621, + 0.228 + ], + "angle": 0, + "content": "- RQ1: How do proxies perform on HSI classification?" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.23, + 0.784, + 0.244 + ], + "angle": 0, + "content": "RQ2: What factors influence Hyperspectral image transformer performance?" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.246, + 0.581, + 0.26 + ], + "angle": 0, + "content": "RQ3: What factors influence the proxy scores?" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.262, + 0.493, + 0.276 + ], + "angle": 0, + "content": "RQ4: Are proxies complementary?" + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.213, + 0.784, + 0.276 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.303, + 0.706, + 0.319 + ], + "angle": 0, + "content": "5.1 RQ1: How Do Proxies Perform on HSI Classification?" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.333, + 0.787, + 0.379 + ], + "angle": 0, + "content": "Previous studies have shown the varying performance of proxies under different search space constraints [15,33]. To address RQ1, we conduct experiments under full and constrained search space conditions." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.397, + 0.787, + 0.459 + ], + "angle": 0, + "content": "Full Search Space We compare proxies across all (2000) subnetworks sampled from the entire search space on five datasets. We include two reference results: SpectralFormer as the human-crafted transformer, and Oracle as the upper bound. Results are presented in Table 2. We make four observations:" + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.485, + 0.78, + 0.726 + ], + "angle": 0, + "content": "
DatasetIndian PinesHouston2013PaviaUKSCSalinas
ProxyOAMSρOAMSρOAMSρOAMSρOAMSρ
#Flops0.7926.30.690.8626.30.660.8926.30.710.8926.30.820.9126.30.94
GradNorm0.8126.80.710.8629.80.700.9029.80.620.9029.20.840.9229.80.87
SNIP0.8126.80.700.8729.90.660.8926.30.690.8928.10.830.9326.80.94
GraSP0.420.62-0.670.780.94-0.630.780.62-0.670.470.62-0.790.391.23-0.88
Synflow0.797.350.600.847.350.530.907.350.730.877.350.710.927.350.91
LogSynflow0.797.350.600.847.350.520.907.350.730.877.350.680.927.350.89
Fisher0.8116.30.610.8718.50.640.9029.30.610.8928.10.790.929.830.92
JacobCov0.8211.90.580.8821.40.720.845.630.400.9029.80.700.9013.70.52
NASWOT0.7926.30.690.8723.10.710.8923.10.620.8926.30.830.9126.30.87
T-CET0.7926.30.630.8626.30.710.8926.30.380.8926.30.740.9429.90.65
CRoZe0.7926.30.460.8726.70.540.8426.40.180.8929.30.550.9128.10.42
DSS0.8025.90.600.847.350.530.899.890.730.8910.60.720.9229.80.91
ZiCo0.8126.80.520.8626.30.620.8425.60.260.8926.30.630.9126.30.50
ZiCo++0.8125.60.730.8629.30.750.8425.60.620.8929.30.830.9429.30.86
SpectralFormer0.790.48-0.850.48-0.850.48-0.860.48-0.890.48-
Oracle0.858.42-0.899.23-0.913.20-0.918.43-0.9620.5-
" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.727, + 0.787, + 0.795 + ], + "angle": 0, + "content": "Table 2: Comparison of search results among proxies, presenting test Overall Accuracy (OA) and corresponding model size (MS) determined by each proxy, as well as their Spearman correlation \\((\\rho)\\) between proxy scores and final test OA after training. The evaluation is conducted over a search space of 2000 subnets across five HSI datasets. MS values are scaled by \\(10^{6}\\). T-CET is computed with SNIP and NASWOT [35]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.147, + 0.788, + 0.208 + ], + "angle": 0, + "content": "- The effectiveness of proxies varies across datasets. JacobCov achieves the highest OA for Indian Pines, Houston2013, and KSC datasets, while Grad-Norm and T-CET demonstrate the highest OA of 0.90 and 0.94 for the PaviaU and Salinas datasets, respectively." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.208, + 0.788, + 0.284 + ], + "angle": 0, + "content": "- Some proxies may yield high OA but exhibit low Spearman correlation. For instance, JacobCov achieves the highest OA for three datasets but with considerably lower Spearman correlations compared to the best ones, emphasizing the importance of considering both OA and Spearman correlation for comprehensive assessment." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.284, + 0.788, + 0.344 + ], + "angle": 0, + "content": "- \\(\\mathrm{ZiCo}^{++}\\) does not outperform \\(\\mathrm{ZiCo}\\) in terms of OA across all datasets except for Salinas. However, it significantly exceeds \\(\\mathrm{ZiCo}\\) in Spearman correlation across all datasets, achieving the highest Spearman correlation among all proxies for the Indian Pines and Houston datasets." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.345, + 0.788, + 0.435 + ], + "angle": 0, + "content": "- Apart from OA, model size, and \\(\\rho\\), searching efficiency is crucial for evaluating proxies. Table 3 compares search times of all proxies. Except for ZiCo and CRoZe, the search times for the other proxies are remarkably similar. ZiCo's extended search time can be attributed to the computation of scores across individual samples, requiring gradient calculations for each sample rather than utilizing batch mean gradients." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.147, + 0.788, + 0.435 + ], + "angle": 0, + "content": null + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.477, + 0.782, + 0.509 + ], + "angle": 0, + "content": "
ProxyGradNormSNIPSynflowFisherJacobCovNASWOTCRoZeDSSZiCoZiCo++
Search time (h)0.120.120.120.200.120.140.380.170.840.14
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.51, + 0.788, + 0.537 + ], + "angle": 0, + "content": "Table 3: Comparison of search times for each proxy across a search space of 2000 subnets on the Indian Pines dataset." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.583, + 0.788, + 0.66 + ], + "angle": 0, + "content": "Constrained Search Space We visualize Spearman correlations and proposed OA across varying model size constraints in Fig. 3. The depicted range represents the minimum and maximum model sizes within the search space. For instance, the range from 0 to \\(0.5\\mathrm{e}7\\) signifies model sizes from 0 to \\(5\\mathrm{M}\\), and from \\(0.5\\mathrm{e}7\\) to \\(1\\mathrm{e}7\\), it represents sizes from \\(5\\mathrm{M}\\) to \\(10\\mathrm{M}\\). We make three observations:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.674, + 0.788, + 0.704 + ], + "angle": 0, + "content": "- The Spearman correlation between proxies and OA decreases with increasing model size, indicating higher efficacy of proxies for smaller models." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.705, + 0.788, + 0.734 + ], + "angle": 0, + "content": "- The Oracle OA increases for models smaller than 5M and remains relatively stable thereafter, with the optimal OA observed at 5M." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.736, + 0.788, + 0.781 + ], + "angle": 0, + "content": "- Most proxies favor complex models and struggle when simpler models are more effective, suggesting their limited capability to filter out underperforming models." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.674, + 0.788, + 0.781 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.794, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Takeaway ①: Most proxies can identify a transformer with better accuracy than the human-crafted counterpart, SpectralFormer. However, the proposed architectures are more complex than necessary, when compared to the oracle." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.147, + 0.502, + 0.335 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.147, + 0.783, + 0.335 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.349, + 0.784, + 0.378 + ], + "angle": 0, + "content": "Fig. 3: Spearman correlation and proxy-proposed OA across different model size constraints on the Indian Pines dataset." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.408, + 0.784, + 0.438 + ], + "angle": 0, + "content": "5.2 RQ2: What Factors Influence Hyperspectral Image Transformer Performance?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.449, + 0.784, + 0.51 + ], + "angle": 0, + "content": "In RQ1, we show that proxies identify a highly accurate, yet complex model. However, is this an optimal Hyperspectral transformer? To answer this, in this section, we analyze the relationship between the performance and the architectural factors. We have three key observations:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.523, + 0.784, + 0.628 + ], + "angle": 0, + "content": "- Fig. 4 presents the Spearman correlation between OA and: depth (depth), embedding dimension (embed_dim), number of heads (num_heads), and MLP ratio (mlp_ratio). Notably, factors such as the number of heads and MLP ratio show minimal correlation with overall model performance across all datasets. Conversely, the influence of depth and embedding dimension varies across datasets, with embedding dimension exhibiting particularly high correlations across all datasets, reaching 0.91 on Salinas dataset." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.63, + 0.785, + 0.809 + ], + "angle": 0, + "content": "- Fig. 4 presents average head embedding dimension (mean_head_dim), average MLP dimension (mean_mlp_dim), sum of all head dimensions (sum_head_dim), sum of all MLP dimensions (sum_mlp_dim), and model size. Notably, average head dimension and average MLP ratio exhibit OA impacts similar to the embedding dimension, while total head dimension and total MLP ratio aggregate influence from both embedding dimension and depth. However, for datasets like PaviaU, where OA relies solely on embedding dimension, the impact of total head dimension diminishes. Conversely, for datasets like Indian Pines, Houston2013, and KSC, where OA correlates with both embedding dimension and depth, Spearman correlation of total head dimension increases. This suggests that if proxy scores correlate solely with one factor, they may not be robust indicators." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.811, + 0.784, + 0.84 + ], + "angle": 0, + "content": "- In Fig. 5, we visualize the highest OA of different values of each component across all datasets. Optimal embedding dimension and depth vary across" + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.523, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "image_caption", + "bbox": [ + 0.327, + 0.153, + 0.684, + 0.165 + ], + "angle": 0, + "content": "Spearman correlations between OA and each component" + }, + { + "type": "image", + "bbox": [ + 0.258, + 0.167, + 0.72, + 0.332 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.354, + 0.788, + 0.409 + ], + "angle": 0, + "content": "Fig. 4: Spearman correlations between final test OA and components of the search space across five datasets. num_heads and mlp_ratio exhibit minimal correlation, while embed_dim, sum_head_dim, and sum_mlp_dim show high correlation across all datasets." + }, + { + "type": "text", + "bbox": [ + 0.243, + 0.446, + 0.788, + 0.552 + ], + "angle": 0, + "content": "datasets. As an example, in Indian Pines, OA increases with the embedding dimension, peaking at embed_dim = 128 and remaining stable thereafter. Similarly, depth = 8 results in the highest OA, with no further improvements observed when increasing the depth to 9 or 10. Additionally, the impact of the average number of heads and the average MLP ratio on model performance is showcased in the right two subplots, where mean number of heads of 4 - 5 and mean MLP ratio of 3 - 4 yield relatively stable and high OA." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.606, + 0.785, + 0.69 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.702, + 0.788, + 0.745 + ], + "angle": 0, + "content": "Fig. 5: The best OA corresponding to different values of diverse factors, including the embedding dimension (embed_dim), the depth (depth), the average number of heads (mean_heads_num), and the average MLP ratio (mean_mlp_ratio)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.779, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Takeaway ②: Across datasets, embedding dimension and depth exhibit consistent sensitivity, though with slight variations. Furthermore, while larger models generally achieve better performance, optimal networks do not necessarily have to be the largest or most complex ones." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.658, + 0.162 + ], + "angle": 0, + "content": "5.3 RQ3: What Factors Influence the Proxy Scores?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.174, + 0.786, + 0.204 + ], + "angle": 0, + "content": "To answer this question, we analyze the sensitivity of proxy scores to architecture components, input data, and module types separately." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.22, + 0.788, + 0.431 + ], + "angle": 0, + "content": "Sensitivity to Architectural Components We examine Spearman correlations between proxy scores and each component on Indian Pines dataset in Fig. 6. Additionally, Spearman correlations between OA and each component are shown in the last column as a comparison. Depth and embedding dimension significantly impact scores of most proxies. Specifically, #Flops, SNIP, and GradNorm display a strong correlation (over 0.95) with the sum of heads' dimensions, surpassing the correlation with OA. Furthermore, Synflow, LogSynflow, and DSS show perfect correlation with embedding dimension and minimal correlation with depth due to taking sign of model parameters, which also exceeds the correlation with OA. Interestingly, removing sign operations improves the performance of Synflow, LogSynflow, and DSS. Details are shown in Section 7.3 in our supplementary material. These discrepancies in the correlation between OA and proxy scores result in a performance gap between proxies and oracle results." + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.462, + 0.794, + 0.621 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.64, + 0.788, + 0.668 + ], + "angle": 0, + "content": "Fig.6: Spearman correlations between proxy scores and architecture components on Indian Pines dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.795 + ], + "angle": 0, + "content": "Sensitivity to Input Data Considering Synflow, LogSynflow, NASWOT, and DSS are data-agnostic, we explore the sensitivity of remaining proxies to input data. To investigate this, we conduct search experiments using one batch of random input data across the remaining proxies. The results, presented in Table 4, reveal that performing the search with random inputs yields outcomes very similar to those obtained with the Indian Pines dataset. This suggests that the majority of the proxies exhibit negligible dependency on specific input data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Furthermore, we compare OA, SNIP, and GradNorm scores from the same models between PaviaU and Indian Pines datasets in Fig. 7. The plots of SNIP and GradNorm indicate a perfect correlation between scores across different" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "table", + "bbox": [ + 0.237, + 0.144, + 0.768, + 0.262 + ], + "angle": 0, + "content": "
ProxyOAρ
Indian PinesRandom InputIndian PinesRandom Input
GradNorm0.810.810.710.71
SNIP0.810.810.700.69 (-0.01)
GraSP0.420.44 (+0.02)-0.67-0.70 (-0.03)
Fisher0.810.82 (+0.01)0.610.55 (-0.06)
JacobCov0.820.79 (-0.03)0.580.68 (+0.1)
ZiCo0.810.79 (-0.02)0.520.52
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.263, + 0.784, + 0.29 + ], + "angle": 0, + "content": "Table 4: Comparison between searching with a batch of Indian Pines inputs and random inputs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.333, + 0.785, + 0.409 + ], + "angle": 0, + "content": "datasets, suggesting that the proxies are largely independent of the input data. However, the plot of OA shows significant variation between the two datasets, indicating that the same architecture yields very different performances depending on the dataset. This finding further emphasizes the gap between proxies and model performance." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.438, + 0.406, + 0.549 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.408, + 0.438, + 0.593, + 0.549 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.598, + 0.438, + 0.781, + 0.549 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.564, + 0.785, + 0.592 + ], + "angle": 0, + "content": "Fig. 7: Comparisons of OA, SNIP, GradNorm of same subnetworks between PaviaU and Indian Pines datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.787, + 0.794 + ], + "angle": 0, + "content": "Sensitivity to Module Type (MSA vs. MLP) Given the distinct structures of MSA and MLP modules within a transformer architecture, we hypothesize that the effectiveness of the two modules for proxy scores might differ significantly. To validate our assumption, we separately compute DSS, Synflow, and SNIP scores for MSA and MLP modules. Our analysis reveals a significant score scale difference between MSA and MLP. For instance, for DSS scores, MSA \\((2472 \\pm 259)\\) is notably higher than MLP \\((268 \\pm 366)\\), indicating the predominant contribution of MSA modules to final proxy scores, with minimal influence from MLP modules. To address this imbalance, we apply a logarithmic transformation to both module scores. The transformed results demonstrate comparable scores for MSA and MLP modules across all three proxies. Detailed scores are presented in Section 7.4 in our supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.786, + 0.842 + ], + "angle": 0, + "content": "Furthermore, we assess the effectiveness of scores with and without logarithmic transformation, as shown in Table 5. The origin score is represented as origin_score = msa_score + mlp_score, and the new score is represented as" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.208 + ], + "angle": 0, + "content": "\\(\\text{logarithm\\_score} = \\log (msa\\_ score \\times mlp\\_ score)\\), where \\(msa\\_ score\\) represents the cumulative score of all MSA layers, and \\(mlp\\_ score\\) denotes the cumulative score of all MLP layers. The results indicate improvements with the logarithmic transformation, particularly for Synflow and DSS proxies." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.233, + 0.784, + 0.339 + ], + "angle": 0, + "content": "
DatasetSNIPGradNormSynflowDSS
originlogarithmoriginlogarithmoriginlogarithmoriginlogarithm
Indian Pines0.700.700.710.710.690.720.690.70
Houston20130.660.650.700.700.680.730.670.69
PaviaU0.690.700.620.640.690.630.700.69
KSC0.830.820.840.840.820.860.820.84
Salinas0.940.940.870.900.930.900.940.94
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.34, + 0.784, + 0.368 + ], + "angle": 0, + "content": "Table 5: Comparison of Spearman correlations between proxy scores and OA, with and without logarithmic transformation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.392, + 0.788, + 0.485 + ], + "angle": 0, + "content": "Takeaway ③: Proxies exhibit a higher correlation with embedding dimension and depth than actual model performance, suggesting limited sensitivity to input data. Enhancing proxies' robustness may involve integrating more input information and decreasing sensitivity to individual architecture components. Furthermore, assessing scores independently for MSA and MLP modules, or employing distinct metrics for each, could improve proxy performance." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.508, + 0.555, + 0.525 + ], + "angle": 0, + "content": "5.4 RQ4: Are Proxies Complementary?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.626 + ], + "angle": 0, + "content": "Motivation. Our results indicate that TAS proxies are fast but may lack reliability, with search performance varying across datasets. Therefore, TAS proxies solely remain problematic. Some studies have employed proxies for pre-filtering or combined them with other search methods, such as one-shot search, evolutionary algorithms, or Bayesian optimization [33,34]. Here, we propose an alternative approach to leverage proxies for enhancing search performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.642, + 0.788, + 0.794 + ], + "angle": 0, + "content": "Setup. We seek to forecast a network's performance using its architectural structure and proxy scores. By retraining all sampled networks and collecting their proxy scores, we explore the feasibility of predicting a model's OA, alongside exploring the number of training samples needed for accurate predictions. We apply a default Random Forest model, with inputs comprising 2000 samples. Each sample represents a subnetwork sampled from the search space, encompassing attributes such as depth, embed_dim, num_heads, mlp_ratio, and various proxy scores including SNIP, GradNorm, Synflow, DSS, ZiCo, and Fisher scores. The target variable is OA, derived from the Indian Pines dataset. Detailed settings are presented in Section 7.5 in our supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Results. Fig. 8 displays the test outcomes. The left subplot presents the predicted OA alongside the actual OA for 1950 networks trained on 50 networks." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "The Spearman correlation between actual and predicted OA reaches 0.80, surpassing the best correlation obtained from proxies by \\(9\\%\\). Additionally, the right subplot demonstrates a correlation improvement with an increase in the number of training networks. Each result represents the mean and standard deviation across five runs with random seeds. Notably, the correlation rises to 0.78, a \\(6\\%\\) increase over the untrained scenario, with only 20 networks trained. It is worth noting that training the Random Forest model takes less than one minute with a training size of \\(0.5\\mathrm{x}\\), making the cost almost negligible compared to training the original subnetworks with actual input data." + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.313, + 0.48, + 0.471 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.522, + 0.313, + 0.784, + 0.472 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.253, + 0.485, + 0.748, + 0.5 + ], + "angle": 0, + "content": "Fig. 8: Predicting subnetworks' performance using Random Forest model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.532, + 0.788, + 0.594 + ], + "angle": 0, + "content": "Takeaway ④: Proxies, while not entirely reliable on their own, can complement other architecture search methods to improve search efficiency or serve as training data for models predicting network performance to improve search accuracy." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.622, + 0.36, + 0.637 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.842 + ], + "angle": 0, + "content": "In this study, we introduced HyTAS: a benchmark for Hyperspectral Image Transformer Architecture Search. We defined a search space comprising 2000 Hyperspectral image transformers and evaluated 12 proxies across five HSI datasets. Our key observations are as follows: Most proxies can identify a transformer surpassing the human-crafted architecture, SpectralFormer, within 10 minutes. However, there's a significant performance gap between proxies and optimal results, driven by preferences for larger and more complex models, minimal dependence on input data, and disparities between MSA and MLP modules. Our proposed proxy, \\(\\mathrm{ZiCo}^{++}\\), demonstrates superior performance compared to \\(\\mathrm{ZiCo}\\) and other proxies. Furthermore, proxies can enhance the prediction of subnetworks' performance when used as input data. These findings encourage the TAS community to explore new methods for improving search quality and efficiency." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.787, + 0.237 + ], + "angle": 0, + "content": "This work was funded by the Dutch Science Foundation (NWO) under grant 482.20.700. Furthermore, we deeply appreciate the invaluable and constructive feedback offered by our anonymous reviewers and the meta-reviewer. Their insights have greatly enriched our manuscript." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.259, + 0.323, + 0.275 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.289, + 0.785, + 0.317 + ], + "angle": 0, + "content": "1. Abdelfattah, M.S., Mehrotra, A., Dudziak, L., Lane, N.D.: Zero-cost proxies for lightweight nas. arXiv preprint arXiv:2101.08134 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.345 + ], + "angle": 0, + "content": "2. Baker, B., Gupta, O., Naik, N., Raskar, R.: Designing neural network architectures using reinforcement learning. arXiv preprint arXiv:1611.02167 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.346, + 0.785, + 0.386 + ], + "angle": 0, + "content": "3. Cavagnero, N., Robbiano, L., Caputo, B., Averta, G.: Freerea: Training-free evolution-based architecture search. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1493-1502 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.387, + 0.785, + 0.428 + ], + "angle": 0, + "content": "4. Chen, B., Li, P., Li, C., Li, B., Bai, L., Lin, C., Sun, M., Yan, J., Ouyang, W.: Glit: Neural architecture search for global and local image transformer. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12-21 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.429, + 0.785, + 0.469 + ], + "angle": 0, + "content": "5. Chen, M., Peng, H., Fu, J., Ling, H.: Autoformer: Searching transformers for visual recognition. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 12270-12280 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.47, + 0.785, + 0.523 + ], + "angle": 0, + "content": "6. Dale, L.M., Thewis, A., Boudry, C., Rotar, I., Dardenne, P., Baeten, V., Pierna, J.A.F.: Hyperspectral imaging applications in agriculture and agro-food product quality and safety control: A review. Applied Spectroscopy Reviews 48(2), 142-159 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.525, + 0.785, + 0.579 + ], + "angle": 0, + "content": "7. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.58, + 0.785, + 0.634 + ], + "angle": 0, + "content": "8. Furbank, R.T., Silva-Perez, V., Evans, J.R., Condon, A.G., Estavillo, G.M., He, W., Newman, S., Poiré, R., Hall, A., He, Z.: Wheat physiology predictor: predicting physiological traits in wheat from hyperspectral reflectance measurements using deep learning. Plant Methods 17, 1-15 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.635, + 0.785, + 0.661 + ], + "angle": 0, + "content": "9. Goetz, A.F.: Three decades of hyperspectral remote sensing of the earth: A personal view. Remote sensing of environment 113, S5-S16 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.662, + 0.785, + 0.715 + ], + "angle": 0, + "content": "10. Graña, M., Veganzons, M., Ayerdi, B.: Hyperspectral remote sensing scenes. Hyperspectral Remote Sensing Scenes - Grupo de Inteligencia Computacional (GIC) https://www.ehu.eus/ccwintco/index.php/Hyperspectral_Remote_Sensing_Scenes" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.717, + 0.785, + 0.744 + ], + "angle": 0, + "content": "11. Ha, H., Kim, M., Hwang, S.J.: Generalizable lightweight proxy for robust nas against diverse perturbations. arXiv preprint arXiv:2306.05031 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.745, + 0.785, + 0.785 + ], + "angle": 0, + "content": "12. Hong, D., Han, Z., Yao, J., Gao, L., Zhang, B., Plaza, A., Chanussot, J.: Spectralformer: Rethinking hyperspectral image classification with transformers. IEEE Transactions on Geoscience and Remote Sensing 60, 1-15 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.786, + 0.785, + 0.813 + ], + "angle": 0, + "content": "13. Jakubczyk, K., Siemiatkowska, B., Wieckowski, R., Rapcewicz, J.: Hyperspectral imaging for mobile robot navigation. Sensors 23(1), 383 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "14. Lee, N., Ajanthan, T., Torr, P.H.: Snip: Single-shot network pruning based on connection sensitivity. arXiv preprint arXiv:1810.02340 (2018)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.289, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "F.Zhou et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "15. Li, G., Hoang, D., Bhardwaj, K., Lin, M., Wang, Z., Marculescu, R.: Zero-shot neural architecture search: Challenges, solutions, and opportunities. arXiv preprint arXiv:2307.01998 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.218 + ], + "angle": 0, + "content": "16. Li, G., Yang, Y., Bhardwaj, K., Marculescu, R.: Zico: Zero-shot nas via inverse coefficient of variation on gradients. arXiv preprint arXiv:2301.11300 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.787, + 0.259 + ], + "angle": 0, + "content": "17. Li, S., Song, W., Fang, L., Chen, Y., Ghamisi, P., Benediktsson, J.A.: Deep learning for hyperspectral image classification: An overview. IEEE Transactions on Geoscience and Remote Sensing 57(9), 6690-6709 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.259, + 0.787, + 0.3 + ], + "angle": 0, + "content": "18. Liu, C., Zoph, B., Neumann, M., Shlens, J., Hua, W., Li, L.J., Fei-Fei, L., Yuille, A., Huang, J., Murphy, K.: Progressive neural architecture search. In: Proceedings of the European conference on computer vision (ECCV). pp. 19-34 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.3, + 0.787, + 0.342 + ], + "angle": 0, + "content": "19. Lopes, V., Alirezazadeh, S., Alexandre, L.A.: Epe-nas: Efficient performance estimation without training for neural architecture search. In: International Conference on Artificial Neural Networks. pp. 552-563. Springer (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.342, + 0.787, + 0.383 + ], + "angle": 0, + "content": "20. Mellor, J., Turner, J., Storkey, A., Crowley, E.J.: Neural architecture search without training. In: International Conference on Machine Learning. pp. 7588-7598. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.383, + 0.787, + 0.425 + ], + "angle": 0, + "content": "21. Nagasubramanian, K., Jones, S., Singh, A.K., Sarkar, S., Singh, A., Ganapathysubramanian, B.: Plant disease identification using explainable 3d deep learning on hyperspectral images. Plant methods 15, 1-10 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.467 + ], + "angle": 0, + "content": "22. Pham, H., Guan, M., Zoph, B., Le, Q., Dean, J.: Efficient neural architecture search via parameters sharing. In: International conference on machine learning. pp. 4095-4104. PMLR (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.787, + 0.509 + ], + "angle": 0, + "content": "23. Su, X., You, S., Xie, J., Zheng, M., Wang, F., Qian, C., Zhang, C., Wang, X., Xu, C.: Vitas: Vision transformer architecture search. In: European Conference on Computer Vision. pp. 139-157. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.787, + 0.55 + ], + "angle": 0, + "content": "24. Sun, L., Zhao, G., Zheng, Y., Wu, Z.: Spectral-spatial feature tokenization transformer for hyperspectral image classification. IEEE Transactions on Geoscience and Remote Sensing 60, 1-14 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.787, + 0.592 + ], + "angle": 0, + "content": "25. Tanaka, H., Kunin, D., Yamins, D.L., Ganguli, S.: Pruning neural networks without any data by iteratively conserving synaptic flow. Advances in neural information processing systems 33, 6377-6389 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.592, + 0.787, + 0.619 + ], + "angle": 0, + "content": "26. Theis, L., Korshunova, I., Tejani, A., Huszar, F.: Faster gaze prediction with dense networks and fisher pruning. arXiv preprint arXiv:1801.05787 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.619, + 0.787, + 0.66 + ], + "angle": 0, + "content": "27. Transon, J., d'Andrimont, R., Maugnard, A., Defourny, P.: Survey of hyperspectral earth observation applications from space in the sentinel-2 context. Remote Sensing 10(2), 157 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.66, + 0.787, + 0.702 + ], + "angle": 0, + "content": "28. Trierscheid, M., Pellenz, J., Paulus, D., Balthasar, D.: Hyperspectral imaging or victim detection with rescue robots. In: 2008 IEEE International Workshop on Safety, Security and Rescue Robotics. pp. 7-12. IEEE (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.787, + 0.744 + ], + "angle": 0, + "content": "29. Tsou, C.H., Lin, Y.C., Huang, Y.C., Li, W., Chen, J.C., Chen, C.S.: SEEKING THE SEARCH SPACE FOR SIZE-AWARE VISION TRANSFORMER ARCHITECTURE (2024), https://openreview.net/forum?id=iSdH16qEs2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.787, + 0.785 + ], + "angle": 0, + "content": "30. Turner, J., Crowley, E.J., O'Boyle, M., Storkey, A., Gray, G.: Blockswap: Fisher-guided block substitution for network compression on a budget. arXiv preprint arXiv:1906.04113 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.785, + 0.787, + 0.813 + ], + "angle": 0, + "content": "31. Wang, C., Zhang, G., Grosse, R.: Picking winning tickets before training by preserving gradient flow. arXiv preprint arXiv:2002.07376 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.787, + 0.84 + ], + "angle": 0, + "content": "32. Wang, D., Vinson, R., Holmes, M., Seibel, G., Bechar, A., Nof, S., Tao, Y.: Early detection of tomato spotted wilt virus by hyperspectral imaging and outlier removal" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.245, + 0.147, + 0.786, + 0.175 + ], + "angle": 0, + "content": "auxiliary classifier generative adversarial nets (or-ac-gan). Scientific reports 9(1), 1-14 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.787, + 0.217 + ], + "angle": 0, + "content": "33. White, C., Safari, M., Sukthanker, R., Ru, B., Elsken, T., Zela, A., Dey, D., Hutter, F.: Neural architecture search: Insights from 1000 papers. arXiv preprint arXiv:2301.08727 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.787, + 0.259 + ], + "angle": 0, + "content": "34. Xiang, L., Dudziak, L., Abdelfattah, M.S., Chau, T., Lane, N.D., Wen, H.: Zero-cost operation scoring in differentiable architecture search. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 10453-10463 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.26, + 0.787, + 0.3 + ], + "angle": 0, + "content": "35. Xiang, L., Hunter, R., Xu, M., Dudziak, L., Wen, H.: Exploiting network compressibility and topology in zero-cost nas. In: International Conference on Automated Machine Learning. pp. 18-1. PMLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.301, + 0.787, + 0.328 + ], + "angle": 0, + "content": "36. Xie, C., Shao, Y., Li, X., He, Y.: Detection of early blight and late blight diseases on tomato leaves using hyperspectral imaging. Scientific reports 5(1), 1-11 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.329, + 0.787, + 0.37 + ], + "angle": 0, + "content": "37. Xiong, Z., Minshan, C., Abhinav, S., Díaz, D.J.C.F.: 2013 IEEE GRSS Data Fusion Contest - Fusion of Hyperspectral and LiDAR Data (2013), https://hyperspectral.ee.uh.edu/?page_id=459" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.787, + 0.397 + ], + "angle": 0, + "content": "38. Zhou, F., Killickaya, M., Vanschoren, J.: Locality-aware hyperspectral classification. arXiv preprint arXiv:2309.01561 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.787, + 0.439 + ], + "angle": 0, + "content": "39. Zhou, Q., Sheng, K., Zheng, X., Li, K., Sun, X., Tian, Y., Chen, J., Ji, R.: Training-free transformer architecture search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10894-10903 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.44, + 0.787, + 0.467 + ], + "angle": 0, + "content": "40. Zoph, B., Le, Q.V.: Neural architecture search with reinforcement learning. arXiv preprint arXiv:1611.01578 (2016)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.467 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_origin.pdf b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..81016f9a68c914a5fc85c05df3938b50258717f8 --- /dev/null +++ b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/fa18bcbc-c498-47b3-a27e-9c6ff7514bfd_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:adb655d4d129c1a0a750a32bca558c8b9e54528bb3b0198536cfdd96706e55cd +size 1332640 diff --git a/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/full.md b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/full.md new file mode 100644 index 0000000000000000000000000000000000000000..d0742b27d550a2ad7cf6556ce37b79362f7cb143 --- /dev/null +++ b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/full.md @@ -0,0 +1,306 @@ +# HyTAS: A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis + +Fangqin Zhou $^{1}$ , Mert Kilickaya $^{1}$ , Joaquin Vanschoren $^{1}$ , and Ran Piao $^{1}$ + +Automated Machine Learning Group, Eindhoven University of Technology, the + +Netherlands + +{f.zhou, j.vanschoren}@tue.nl + +https://github.com/openml-labs + +Abstract. Hyperspectral Imaging (HSI) plays an increasingly critical role in precise vision tasks within remote sensing, capturing a wide spectrum of visual data. Transformer architectures have significantly enhanced HSI task performance, while advancements in Transformer Architecture Search (TAS) have improved model discovery. To harness these advancements for HSI classification, we make the following contributions: i) We propose HyTAS, the first benchmark on transformer architecture search for Hyperspectral imaging, ii) We comprehensively evaluate 12 different methods to identify the optimal transformer over 5 different datasets, iii) We perform an extensive factor analysis on the Hyperspectral transformer search performance, greatly motivating future research in this direction. All benchmark materials are available at HyTAS. + +Keywords: Hyperspectral Image Classification $\cdot$ Transformer Architecture Search $\cdot$ Zero-Cost Proxies $\cdot$ Benchmark and Analysis + +# 1 Introduction + +Hyperspectral Imaging (HSI) captures a broad spectrum of electromagnetic wavelengths, providing detailed spectral information beyond conventional RGB images. This rich spectral data has significantly impacted various industries, including agriculture for plant monitoring [6,8,21,32,36], remote sensing for Earth analysis [9,27], and robotics for enhanced navigation and vision [13,28]. + +Scientists in fields like agriculture or remote sensing may seek to analyze Hyperspectral images using transformer models, see Fig. 1. However, designing high-performing Hyperspectral image transformers requires significant expertise and computational resources. Transformer Architecture Search (TAS) methods like AutoFormer [5] or ViTAS [23] can help but demand extensive computational resources (e.g., 24 GPU days for AutoFormer). + +An alternative is using training-free architecture search techniques, known as zero-cost proxies [14, 16, 25, 31, 39]. Hereafter, we will use the term "proxy" for brevity. Proxies quickly evaluate transformer architectures without training, offering two key advantages: i) Efficiency: Proxies identify high-performing transformers within minutes. ii) Data Independence: Many proxies do not require real data, reducing setup and data collection costs [3,20,25,39]. This characteristic is + +![](images/34465a6c2e10b84493e6ebe6e05769fd00f97760d5303bbec36c3943d5fbcd2f.jpg) +Fig. 1: A scientist outside AI domain may find it difficult to design a novel Hyperspectral image transformer tailored to their tasks and data. To automate the design of Hyperspectral transformers, we introduce Hyperspectral Transformer Architecture Search (HyTAS) in this paper. The scientist images are generated by DALL-E. + +especially advantageous for hyperspectral imaging applications, where the setup and calibration of the camera, as well as the collection and annotation of data, incur significant costs. + +To that end, in this paper, we introduce Hyperspectral Transformer Architecture Search (HyTAS), to automatically identify Hyperspectral transformers tailored for downstream tasks and datasets. Our motivations are three-fold: i) Democratization: HyTAS enables researchers, especially in fields like biology or agriculture, to identify top-performing, lightweight models using minimal resources. ii) Attention: We aim to highlight the unique challenges of HSI to the NAS community, which has focused more on RGB images. iii) Novelty: We share novel findings to guide the development of better hyperspectral-specific search techniques and architectures. + +Our approach begins by generating a substantial pool of candidate Hyperspectral transformers. Subsequently, we assess the performance of various proxies in their capacity to efficiently identify accurate Hyperspectral image transformers. Lastly, we conduct a comprehensive factor analysis to elucidate the factors influencing the performance of both Hyperspectral image transformers and proxy-based transformer search methods. + +To sum up, this paper presents three primary contributions: + +I. We introduce HyTAS, the pioneering benchmark for Transformer Architecture Search in HSI classification, comprising 2000 distinct Hyperspectral Image transformer architectures. +II. We conduct comprehensive benchmarking using 12 proxies across 5 datasets. Our benchmarking demonstrates the capability to achieve superior performance over a well-established, human-crafted counterpart within minutes. +III. We analyze various factors influencing the effectiveness of Transformer architecture search. Our findings include: i) Proxies demonstrate a bias towards larger models, ii) Proxies operate without necessitating real data input, iii) Proxies synergistically complement each other in predicting the accuracy of input transformers, suggesting promising avenues for future research. + +# 2 Related Work + +# 2.1 Transformer Architecture Search via Proxies + +Neural Architecture Search (NAS) customizes optimal architectures for specific tasks [2,18,22,40]. Transformer Architecture Search (TAS) is gaining popularity alongside transformer-based model advancements [4, 5, 23, 39]. However, these methods are computationally intensive, often taking days or months to converge [15, 33]. Many researchers lack resources; for instance, this study employs only a single GPU. An alternative approach involves using proxy functions, which swiftly assess architecture fitness without training [3, 14-16, 25]. In this paper, we adapt proxy methods to quickly search over a large database of Hyperspectral transformers. + +# 2.2 Hyperspectral Image Transformers + +Hyperspectral image classification involves processing input cubes with significantly more channels (e.g., 200 vs. 3) and lower spatial resolution than conventional RGB imaging [17]. With the emergence of Vision-Transformers (ViT) [7], manual design of transformer architectures for Hyperspectral image classification has become common practice. For instance, Hong et al. [12] introduce Spectral-Former, adapting ViT for HSI classification, while Sun et al. [24] and Zhou et al. [38] enhance it with spatial-local attention modules. However, manual network design is laborious and resource-intensive. Therefore, in this study, we propose HyTAS to automate Hyperspectral image transformer design. + +# 3 HyTAS Benchmark + +In practice, the optimal architecture is determined by its performance, often measured by the highest test accuracy for classification tasks. However, in TAS proxies, where training is not involved, a proxy measure is needed to rank architectures sampled from a search space based on their initial model weights or one-step gradients. This proxy score serves as the metric for estimating the performance of each architecture. + +The process of TAS proxy for HSI classification is illustrated in Fig. 2, containing four main steps: 1). Patchify HSI image and tokenize each patch along its spectra, then randomly sample a batch of input. 2). Design a search space and sample architectures from it. 3). Select a proxy to estimate the sampled architectures and rank them by their proxy scores. 4). Evaluate the performance of search proxies. Formally, the objective of TAS proxy is formulated as follows: + +$$ +a ^ {*} = \arg \max _ {a \in \mathcal {A}} \mathrm {O A} (a) \equiv a ^ {*} = \arg \max _ {a \in \mathcal {A}} \mathcal {F} _ {s} (a) \tag {1} +$$ + +where $a$ is a transformer architecture sampled from the search space $\mathcal{A}$ , OA and $\mathcal{F}_s$ denote the test overall accuracy and a scoring function, respectively. The objective aims to discover the optimal architecture $a^*$ through a scoring function + +![](images/6ddbbda3fd82376680d4bd4a89907c89006dffb70d91c8830900b4ab4445b2e1.jpg) +Fig. 2: Diagram of TAS proxies for HSI classification: (1) Patchify the image and tokenize each patch along its spectra. (2) Randomly sample architectures from a designed search space. (3) Select a proxy to compute scores for sampled architectures after passing a batch of input. (4) Use the scores to rank architectures and choose the one with the highest score to retrain. Proxy evaluation metrics include test overall accuracy, model size, Spearman correlation between proxy scores and test OA, and search time. + +instead of training all models. Designing a good search space $\mathcal{A}$ and a suitable proxy scoring function that accurately estimates architectures' performance is crucial for TAS proxies. + +# 3.1 Benchmark Proxies + +Optimizing Equation 1 relies on employing an appropriate proxy scoring function $\mathcal{F}_s$ . In this section, we provide a concise overview of various existing proxies commonly utilized within the NAS and TAS communities. The mathematical equation of each proxy as well as further details are presented in Section 7.1 in our supplementary material. + +GradNorm [1]: aggregates the Euclidean norms of each layer's gradients after processing a single batch of training data. + +SNIP [14]: calculates a saliency metric by incorporating both gradients and weights, facilitating parameter pruning in neural networks. + +GraSP [31]: considers both the first-order and second-order derivatives of the network to preserve training dynamics instead of the loss at the beginning of training. + +Synflow [25]: a modification of SNIP that eliminates the absolute expression to address layer collapse during parameter pruning. + +LogSynflow [3]: addresses the issue of neglecting the significance of weights due to gradients in Synflow, by scaling down the gradients with a logarithmic function before summing up the contributions of their weights. + +Fisher: initially presented by [26] to achieve more runtime-efficient neural architectures, and utilized as a pruning metric at initialization by [30]. More + +recently, [1] applied this metric to aggregate all gradients of the activations for scoring a network. + +JacobCov [19]: leverages gradients over the input data instead of parameters or activations. + +NASWOT [20]: computes the network score according to its kernel matrix of the binary activation patterns between a batch of training inputs. + +DSS [39]: specifically designed for transformer architectures via combining synaptic diversity scores of MSA and synaptic saliency scores of MLP modules. + +CROZe [11]: measures the consistency of features, parameters, and gradients between perturbed and clean samples. + +T-CET [35]: incorporates the orthogonality of gradient-based (SSNR) and activation-based (NASWOT) compressibility to score an architecture. + +ZiCo [16]: considers both absolute mean and standard deviation of gradients, emphasizing their influence on convergence rate and generalization capacity. + +# 3.2 A New Proxy: $\mathrm{ZiCo}^{+ + }$ + +Inspired by ZiCo's principle of favoring networks with high absolute mean and low standard deviation gradient values for faster convergence and improved generalization, we introduce $\mathrm{ZiCo}^{++}$ , a novel proxy. $\mathrm{ZiCo}^{++}$ enhances network expressive capacity by optimizing the mean and minimizing the standard deviation of Fisher information of activations across input samples. Additionally, to address the issue of the final score's heavy reliance on the number of layers in ZiCo, we incorporate a layer decay mechanism during score aggregation in $\mathrm{ZiCo}^{++}$ . The mathematical formulation is as follows: + +$$ +\begin{array}{l} Z i C o ^ {+ +} \triangleq \sum_ {i = 1} ^ {n - 1} Z i C o _ {i} ^ {+ +} + \sum_ {i = n} ^ {N - 1} \frac {1}{i - n + 1} Z i C o _ {i} ^ {+ +} + Z i C o _ {N} ^ {+ +} \quad \text {s . t .} \\ Z i C o _ {i} ^ {+ +} \triangleq \log \left(\sum_ {\omega \in \theta_ {l}} \frac {\mathbb {E} \left[ \left(\nabla_ {\omega} L \left(X _ {i} , y _ {i} ; z _ {i}\right) * z _ {i}\right) ^ {2} \right]}{\sqrt {\operatorname {V a r} \left(\left(\nabla_ {\omega} L \left(X _ {i} , y _ {i} ; z _ {i}\right) * z _ {i}\right) ^ {2}\right)}}\right) \tag {2} \\ \end{array} +$$ + +where $\mathrm{ZiCo}_i^{++}$ and $\mathrm{ZiCo}_N^{++}$ denote the $\mathrm{ZiCo}^{++}$ score of $i\_\text{th}$ and the last layer, respectively. $n$ is a tunable parameter representing the starting layer for layer decay, such that $n$ is constrained by $n \leq \min\_depth * 4 + 1$ , with $\min\_depth$ denoting the minimal depth defined in the search space. In our experiments, we set $\min\_depth = 4$ and $n = 6$ to preserve the $\mathrm{ZiCo}^{++}$ score for the first embedding and the last projection layer, as well as for the first block containing two MSA layers and two MLP layers. + +# 3.3 Search Space Design + +A transformer architecture contains an encoder and decoder, but for our classification task, we focus on encoder-only transformers. Typically, a transformer encoder consists of a series of blocks, each containing a multi-head self-attention (MSA) and a multi-layer perceptron (MLP) module. Therefore, the search space + +should account for four key elements: embedding dimension (embed_dim), number of blocks (depth), number of attention heads (num_heads), and MLP embedding ratio (mlp_ratio) for each block. These components significantly impact model performance. + +
Componentsdepthembed_dimnum_headsmlp_ratio
Choices(4, 10, 1)(32, 240, 16)(3, 6, 1)(1, 6, 1)
+ +Table 1: The search space across all datasets. It includes depth, embed_dim, num_heads, and mlp_ratio, with values indicating initial, final, and intervals. Different numbers of heads and MLP ratios are utilized for each block. Notably, the total number of layers equals depth * 4 + 2. + +Drawing inspiration from the effectiveness of manually crafted models proposed by [12, 38], we define our search space in Table 1. We randomly sample 2000 subnetworks from the search space for our experiments. + +# 4 Experimental Setup + +Datasets We conduct experiments on five well-established HSI datasets: + +i. Indian Pines [10]: 224 spectral bands, $145 \times 145$ spatial resolution, 16 classes, 695 training, and $9k$ testing samples. +ii. Houston2013 [37]: 144 spectral bands, $349 \times 1905$ spatial resolution, 15 classes, $2k$ training, and $12k$ testing samples. +iii. Pavia University (PaviaU) [10]: 103 spectral bands, $610 \times 340$ spatial resolution, 9 classes, $3k$ training, and $40k$ testing samples. +iv. Kennedy Space Center (KSC) [10]: 176 spectral bands, $518 \times 620$ spatial resolution, 13 classes, 195 training, and $5k$ testing samples. +$v$ . Salinas scene [10]: 224 spectral bands, $512 \times 217$ spatial resolution, 16 classes, 800 training, and $53k$ testing samples. + +Indian Pines and Salinas contain mostly agricultural vegetation, and the remaining three datasets consist of non-agricultural vegetation, such as roads and buildings. More details are presented in Section 7.2 in our supplementary material. For data-dependent search proxies, we randomly sample a batch of training data with a batch size of 64, consistent with the batch size used for retraining. + +Metrics We evaluate architecture performance with test Overall Accuracy (OA), indicating correctly predicted samples over all samples. Spearman correlation $(\rho)$ measures the correlation between proxy scores and final test OA after training all sampled networks. We also compare Search Time (ST) and proposed Model Size (MS) for each proxy, calculated using the following equation from [29]: + +$$ +M S (a, b, c, d) = 1, 5 3 9 d + a \left(4 d + 2 5 6 c d + 1 9 2 c + 5 d + 7, 6 8 0 + 2 b d ^ {2} + b d + d\right) + 2 d + \# \text {c l a s s} \times (d + 1) +$$ + +Here, $a$ , $b$ , $c$ , and $d$ represent the depth, MLP ratio, number of heads, and embedding dimension, respectively. #class is the number of classes in the dataset. + +# 5 HyTAS Analysis + +This section presents experiments to answer the following research questions: + +- RQ1: How do proxies perform on HSI classification? +RQ2: What factors influence Hyperspectral image transformer performance? +RQ3: What factors influence the proxy scores? +RQ4: Are proxies complementary? + +# 5.1 RQ1: How Do Proxies Perform on HSI Classification? + +Previous studies have shown the varying performance of proxies under different search space constraints [15,33]. To address RQ1, we conduct experiments under full and constrained search space conditions. + +Full Search Space We compare proxies across all (2000) subnetworks sampled from the entire search space on five datasets. We include two reference results: SpectralFormer as the human-crafted transformer, and Oracle as the upper bound. Results are presented in Table 2. We make four observations: + +
DatasetIndian PinesHouston2013PaviaUKSCSalinas
ProxyOAMSρOAMSρOAMSρOAMSρOAMSρ
#Flops0.7926.30.690.8626.30.660.8926.30.710.8926.30.820.9126.30.94
GradNorm0.8126.80.710.8629.80.700.9029.80.620.9029.20.840.9229.80.87
SNIP0.8126.80.700.8729.90.660.8926.30.690.8928.10.830.9326.80.94
GraSP0.420.62-0.670.780.94-0.630.780.62-0.670.470.62-0.790.391.23-0.88
Synflow0.797.350.600.847.350.530.907.350.730.877.350.710.927.350.91
LogSynflow0.797.350.600.847.350.520.907.350.730.877.350.680.927.350.89
Fisher0.8116.30.610.8718.50.640.9029.30.610.8928.10.790.929.830.92
JacobCov0.8211.90.580.8821.40.720.845.630.400.9029.80.700.9013.70.52
NASWOT0.7926.30.690.8723.10.710.8923.10.620.8926.30.830.9126.30.87
T-CET0.7926.30.630.8626.30.710.8926.30.380.8926.30.740.9429.90.65
CRoZe0.7926.30.460.8726.70.540.8426.40.180.8929.30.550.9128.10.42
DSS0.8025.90.600.847.350.530.899.890.730.8910.60.720.9229.80.91
ZiCo0.8126.80.520.8626.30.620.8425.60.260.8926.30.630.9126.30.50
ZiCo++0.8125.60.730.8629.30.750.8425.60.620.8929.30.830.9429.30.86
SpectralFormer0.790.48-0.850.48-0.850.48-0.860.48-0.890.48-
Oracle0.858.42-0.899.23-0.913.20-0.918.43-0.9620.5-
+ +Table 2: Comparison of search results among proxies, presenting test Overall Accuracy (OA) and corresponding model size (MS) determined by each proxy, as well as their Spearman correlation $(\rho)$ between proxy scores and final test OA after training. The evaluation is conducted over a search space of 2000 subnets across five HSI datasets. MS values are scaled by $10^{6}$ . T-CET is computed with SNIP and NASWOT [35]. + +- The effectiveness of proxies varies across datasets. JacobCov achieves the highest OA for Indian Pines, Houston2013, and KSC datasets, while Grad-Norm and T-CET demonstrate the highest OA of 0.90 and 0.94 for the PaviaU and Salinas datasets, respectively. +- Some proxies may yield high OA but exhibit low Spearman correlation. For instance, JacobCov achieves the highest OA for three datasets but with considerably lower Spearman correlations compared to the best ones, emphasizing the importance of considering both OA and Spearman correlation for comprehensive assessment. +- $\mathrm{ZiCo}^{++}$ does not outperform $\mathrm{ZiCo}$ in terms of OA across all datasets except for Salinas. However, it significantly exceeds $\mathrm{ZiCo}$ in Spearman correlation across all datasets, achieving the highest Spearman correlation among all proxies for the Indian Pines and Houston datasets. +- Apart from OA, model size, and $\rho$ , searching efficiency is crucial for evaluating proxies. Table 3 compares search times of all proxies. Except for ZiCo and CRoZe, the search times for the other proxies are remarkably similar. ZiCo's extended search time can be attributed to the computation of scores across individual samples, requiring gradient calculations for each sample rather than utilizing batch mean gradients. + +
ProxyGradNormSNIPSynflowFisherJacobCovNASWOTCRoZeDSSZiCoZiCo++
Search time (h)0.120.120.120.200.120.140.380.170.840.14
+ +Table 3: Comparison of search times for each proxy across a search space of 2000 subnets on the Indian Pines dataset. + +Constrained Search Space We visualize Spearman correlations and proposed OA across varying model size constraints in Fig. 3. The depicted range represents the minimum and maximum model sizes within the search space. For instance, the range from 0 to $0.5\mathrm{e}7$ signifies model sizes from 0 to $5\mathrm{M}$ , and from $0.5\mathrm{e}7$ to $1\mathrm{e}7$ , it represents sizes from $5\mathrm{M}$ to $10\mathrm{M}$ . We make three observations: + +- The Spearman correlation between proxies and OA decreases with increasing model size, indicating higher efficacy of proxies for smaller models. +- The Oracle OA increases for models smaller than 5M and remains relatively stable thereafter, with the optimal OA observed at 5M. +- Most proxies favor complex models and struggle when simpler models are more effective, suggesting their limited capability to filter out underperforming models. + +Takeaway ①: Most proxies can identify a transformer with better accuracy than the human-crafted counterpart, SpectralFormer. However, the proposed architectures are more complex than necessary, when compared to the oracle. + +![](images/600ee957334a2cf96c3ca512bdb5eed31c5fe265d358610b4b9d747a82ca2fb0.jpg) +Fig. 3: Spearman correlation and proxy-proposed OA across different model size constraints on the Indian Pines dataset. + +![](images/aa795b3fb7b0a0c6739a2f87e188d4bdb85107fbd6ec42666712c5fbeb3042a1.jpg) + +# 5.2 RQ2: What Factors Influence Hyperspectral Image Transformer Performance? + +In RQ1, we show that proxies identify a highly accurate, yet complex model. However, is this an optimal Hyperspectral transformer? To answer this, in this section, we analyze the relationship between the performance and the architectural factors. We have three key observations: + +- Fig. 4 presents the Spearman correlation between OA and: depth (depth), embedding dimension (embed_dim), number of heads (num_heads), and MLP ratio (mlp_ratio). Notably, factors such as the number of heads and MLP ratio show minimal correlation with overall model performance across all datasets. Conversely, the influence of depth and embedding dimension varies across datasets, with embedding dimension exhibiting particularly high correlations across all datasets, reaching 0.91 on Salinas dataset. +- Fig. 4 presents average head embedding dimension (mean_head_dim), average MLP dimension (mean_mlp_dim), sum of all head dimensions (sum_head_dim), sum of all MLP dimensions (sum_mlp_dim), and model size. Notably, average head dimension and average MLP ratio exhibit OA impacts similar to the embedding dimension, while total head dimension and total MLP ratio aggregate influence from both embedding dimension and depth. However, for datasets like PaviaU, where OA relies solely on embedding dimension, the impact of total head dimension diminishes. Conversely, for datasets like Indian Pines, Houston2013, and KSC, where OA correlates with both embedding dimension and depth, Spearman correlation of total head dimension increases. This suggests that if proxy scores correlate solely with one factor, they may not be robust indicators. +- In Fig. 5, we visualize the highest OA of different values of each component across all datasets. Optimal embedding dimension and depth vary across + +![](images/b9627a007813822a3bbca27372306b22a11654d07c6dd51b22727a3d80fae56d.jpg) +Spearman correlations between OA and each component +Fig. 4: Spearman correlations between final test OA and components of the search space across five datasets. num_heads and mlp_ratio exhibit minimal correlation, while embed_dim, sum_head_dim, and sum_mlp_dim show high correlation across all datasets. + +datasets. As an example, in Indian Pines, OA increases with the embedding dimension, peaking at embed_dim = 128 and remaining stable thereafter. Similarly, depth = 8 results in the highest OA, with no further improvements observed when increasing the depth to 9 or 10. Additionally, the impact of the average number of heads and the average MLP ratio on model performance is showcased in the right two subplots, where mean number of heads of 4 - 5 and mean MLP ratio of 3 - 4 yield relatively stable and high OA. + +![](images/09e28cb47fee7590787f90e5a3c5b0fceca112ac459d1c88fc6bbeae73301996.jpg) +Fig. 5: The best OA corresponding to different values of diverse factors, including the embedding dimension (embed_dim), the depth (depth), the average number of heads (mean_heads_num), and the average MLP ratio (mean_mlp_ratio). + +Takeaway ②: Across datasets, embedding dimension and depth exhibit consistent sensitivity, though with slight variations. Furthermore, while larger models generally achieve better performance, optimal networks do not necessarily have to be the largest or most complex ones. + +# 5.3 RQ3: What Factors Influence the Proxy Scores? + +To answer this question, we analyze the sensitivity of proxy scores to architecture components, input data, and module types separately. + +Sensitivity to Architectural Components We examine Spearman correlations between proxy scores and each component on Indian Pines dataset in Fig. 6. Additionally, Spearman correlations between OA and each component are shown in the last column as a comparison. Depth and embedding dimension significantly impact scores of most proxies. Specifically, #Flops, SNIP, and GradNorm display a strong correlation (over 0.95) with the sum of heads' dimensions, surpassing the correlation with OA. Furthermore, Synflow, LogSynflow, and DSS show perfect correlation with embedding dimension and minimal correlation with depth due to taking sign of model parameters, which also exceeds the correlation with OA. Interestingly, removing sign operations improves the performance of Synflow, LogSynflow, and DSS. Details are shown in Section 7.3 in our supplementary material. These discrepancies in the correlation between OA and proxy scores result in a performance gap between proxies and oracle results. + +![](images/bd90242dea15cdf3395789193643ee2b40dff3753c4030d934e721689d453ee2.jpg) +Fig.6: Spearman correlations between proxy scores and architecture components on Indian Pines dataset. + +Sensitivity to Input Data Considering Synflow, LogSynflow, NASWOT, and DSS are data-agnostic, we explore the sensitivity of remaining proxies to input data. To investigate this, we conduct search experiments using one batch of random input data across the remaining proxies. The results, presented in Table 4, reveal that performing the search with random inputs yields outcomes very similar to those obtained with the Indian Pines dataset. This suggests that the majority of the proxies exhibit negligible dependency on specific input data. + +Furthermore, we compare OA, SNIP, and GradNorm scores from the same models between PaviaU and Indian Pines datasets in Fig. 7. The plots of SNIP and GradNorm indicate a perfect correlation between scores across different + +
ProxyOAρ
Indian PinesRandom InputIndian PinesRandom Input
GradNorm0.810.810.710.71
SNIP0.810.810.700.69 (-0.01)
GraSP0.420.44 (+0.02)-0.67-0.70 (-0.03)
Fisher0.810.82 (+0.01)0.610.55 (-0.06)
JacobCov0.820.79 (-0.03)0.580.68 (+0.1)
ZiCo0.810.79 (-0.02)0.520.52
+ +Table 4: Comparison between searching with a batch of Indian Pines inputs and random inputs. + +datasets, suggesting that the proxies are largely independent of the input data. However, the plot of OA shows significant variation between the two datasets, indicating that the same architecture yields very different performances depending on the dataset. This finding further emphasizes the gap between proxies and model performance. + +![](images/16aef6e663694dea17a86a05dfc41d8e36fadafdf0789445d1995f16be1733d6.jpg) +Fig. 7: Comparisons of OA, SNIP, GradNorm of same subnetworks between PaviaU and Indian Pines datasets. + +![](images/13079103e2e7fce302a8069267d847ba0981b710738465759af3e5df5009bc22.jpg) + +![](images/8f789f564f9527b743435c3bb5f28c042be110d6daa235e30f1d36ceb64ff425.jpg) + +Sensitivity to Module Type (MSA vs. MLP) Given the distinct structures of MSA and MLP modules within a transformer architecture, we hypothesize that the effectiveness of the two modules for proxy scores might differ significantly. To validate our assumption, we separately compute DSS, Synflow, and SNIP scores for MSA and MLP modules. Our analysis reveals a significant score scale difference between MSA and MLP. For instance, for DSS scores, MSA $(2472 \pm 259)$ is notably higher than MLP $(268 \pm 366)$ , indicating the predominant contribution of MSA modules to final proxy scores, with minimal influence from MLP modules. To address this imbalance, we apply a logarithmic transformation to both module scores. The transformed results demonstrate comparable scores for MSA and MLP modules across all three proxies. Detailed scores are presented in Section 7.4 in our supplementary material. + +Furthermore, we assess the effectiveness of scores with and without logarithmic transformation, as shown in Table 5. The origin score is represented as origin_score = msa_score + mlp_score, and the new score is represented as + +$\text{logarithm\_score} = \log (msa\_ score \times mlp\_ score)$ , where $msa\_ score$ represents the cumulative score of all MSA layers, and $mlp\_ score$ denotes the cumulative score of all MLP layers. The results indicate improvements with the logarithmic transformation, particularly for Synflow and DSS proxies. + +
DatasetSNIPGradNormSynflowDSS
originlogarithmoriginlogarithmoriginlogarithmoriginlogarithm
Indian Pines0.700.700.710.710.690.720.690.70
Houston20130.660.650.700.700.680.730.670.69
PaviaU0.690.700.620.640.690.630.700.69
KSC0.830.820.840.840.820.860.820.84
Salinas0.940.940.870.900.930.900.940.94
+ +Table 5: Comparison of Spearman correlations between proxy scores and OA, with and without logarithmic transformation. + +Takeaway ③: Proxies exhibit a higher correlation with embedding dimension and depth than actual model performance, suggesting limited sensitivity to input data. Enhancing proxies' robustness may involve integrating more input information and decreasing sensitivity to individual architecture components. Furthermore, assessing scores independently for MSA and MLP modules, or employing distinct metrics for each, could improve proxy performance. + +# 5.4 RQ4: Are Proxies Complementary? + +Motivation. Our results indicate that TAS proxies are fast but may lack reliability, with search performance varying across datasets. Therefore, TAS proxies solely remain problematic. Some studies have employed proxies for pre-filtering or combined them with other search methods, such as one-shot search, evolutionary algorithms, or Bayesian optimization [33,34]. Here, we propose an alternative approach to leverage proxies for enhancing search performance. + +Setup. We seek to forecast a network's performance using its architectural structure and proxy scores. By retraining all sampled networks and collecting their proxy scores, we explore the feasibility of predicting a model's OA, alongside exploring the number of training samples needed for accurate predictions. We apply a default Random Forest model, with inputs comprising 2000 samples. Each sample represents a subnetwork sampled from the search space, encompassing attributes such as depth, embed_dim, num_heads, mlp_ratio, and various proxy scores including SNIP, GradNorm, Synflow, DSS, ZiCo, and Fisher scores. The target variable is OA, derived from the Indian Pines dataset. Detailed settings are presented in Section 7.5 in our supplementary material. + +Results. Fig. 8 displays the test outcomes. The left subplot presents the predicted OA alongside the actual OA for 1950 networks trained on 50 networks. + +The Spearman correlation between actual and predicted OA reaches 0.80, surpassing the best correlation obtained from proxies by $9\%$ . Additionally, the right subplot demonstrates a correlation improvement with an increase in the number of training networks. Each result represents the mean and standard deviation across five runs with random seeds. Notably, the correlation rises to 0.78, a $6\%$ increase over the untrained scenario, with only 20 networks trained. It is worth noting that training the Random Forest model takes less than one minute with a training size of $0.5\mathrm{x}$ , making the cost almost negligible compared to training the original subnetworks with actual input data. + +![](images/1d7a5ce949b95cf41a1e5e444ae4f6519d727e969ac3cbbd2a27482abdfe5a98.jpg) +Fig. 8: Predicting subnetworks' performance using Random Forest model. + +![](images/3a1cbf87d0bb80e5f98fb3fcc4f565b899cb9d5c1b88cf08d0934f0e99f539c6.jpg) + +Takeaway ④: Proxies, while not entirely reliable on their own, can complement other architecture search methods to improve search efficiency or serve as training data for models predicting network performance to improve search accuracy. + +# 6 Conclusion + +In this study, we introduced HyTAS: a benchmark for Hyperspectral Image Transformer Architecture Search. We defined a search space comprising 2000 Hyperspectral image transformers and evaluated 12 proxies across five HSI datasets. Our key observations are as follows: Most proxies can identify a transformer surpassing the human-crafted architecture, SpectralFormer, within 10 minutes. However, there's a significant performance gap between proxies and optimal results, driven by preferences for larger and more complex models, minimal dependence on input data, and disparities between MSA and MLP modules. Our proposed proxy, $\mathrm{ZiCo}^{++}$ , demonstrates superior performance compared to $\mathrm{ZiCo}$ and other proxies. Furthermore, proxies can enhance the prediction of subnetworks' performance when used as input data. These findings encourage the TAS community to explore new methods for improving search quality and efficiency. + +# Acknowledgements + +This work was funded by the Dutch Science Foundation (NWO) under grant 482.20.700. Furthermore, we deeply appreciate the invaluable and constructive feedback offered by our anonymous reviewers and the meta-reviewer. Their insights have greatly enriched our manuscript. + +# References + +1. Abdelfattah, M.S., Mehrotra, A., Dudziak, L., Lane, N.D.: Zero-cost proxies for lightweight nas. arXiv preprint arXiv:2101.08134 (2021) +2. Baker, B., Gupta, O., Naik, N., Raskar, R.: Designing neural network architectures using reinforcement learning. arXiv preprint arXiv:1611.02167 (2016) +3. Cavagnero, N., Robbiano, L., Caputo, B., Averta, G.: Freerea: Training-free evolution-based architecture search. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1493-1502 (2023) +4. Chen, B., Li, P., Li, C., Li, B., Bai, L., Lin, C., Sun, M., Yan, J., Ouyang, W.: Glit: Neural architecture search for global and local image transformer. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12-21 (2021) +5. Chen, M., Peng, H., Fu, J., Ling, H.: Autoformer: Searching transformers for visual recognition. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 12270-12280 (2021) +6. Dale, L.M., Thewis, A., Boudry, C., Rotar, I., Dardenne, P., Baeten, V., Pierna, J.A.F.: Hyperspectral imaging applications in agriculture and agro-food product quality and safety control: A review. Applied Spectroscopy Reviews 48(2), 142-159 (2013) +7. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020) +8. Furbank, R.T., Silva-Perez, V., Evans, J.R., Condon, A.G., Estavillo, G.M., He, W., Newman, S., Poiré, R., Hall, A., He, Z.: Wheat physiology predictor: predicting physiological traits in wheat from hyperspectral reflectance measurements using deep learning. Plant Methods 17, 1-15 (2021) +9. Goetz, A.F.: Three decades of hyperspectral remote sensing of the earth: A personal view. Remote sensing of environment 113, S5-S16 (2009) +10. Graña, M., Veganzons, M., Ayerdi, B.: Hyperspectral remote sensing scenes. Hyperspectral Remote Sensing Scenes - Grupo de Inteligencia Computacional (GIC) https://www.ehu.eus/ccwintco/index.php/Hyperspectral_Remote_Sensing_Scenes +11. Ha, H., Kim, M., Hwang, S.J.: Generalizable lightweight proxy for robust nas against diverse perturbations. arXiv preprint arXiv:2306.05031 (2023) +12. Hong, D., Han, Z., Yao, J., Gao, L., Zhang, B., Plaza, A., Chanussot, J.: Spectralformer: Rethinking hyperspectral image classification with transformers. IEEE Transactions on Geoscience and Remote Sensing 60, 1-15 (2021) +13. Jakubczyk, K., Siemiatkowska, B., Wieckowski, R., Rapcewicz, J.: Hyperspectral imaging for mobile robot navigation. Sensors 23(1), 383 (2022) +14. Lee, N., Ajanthan, T., Torr, P.H.: Snip: Single-shot network pruning based on connection sensitivity. arXiv preprint arXiv:1810.02340 (2018) + +15. Li, G., Hoang, D., Bhardwaj, K., Lin, M., Wang, Z., Marculescu, R.: Zero-shot neural architecture search: Challenges, solutions, and opportunities. arXiv preprint arXiv:2307.01998 (2023) +16. Li, G., Yang, Y., Bhardwaj, K., Marculescu, R.: Zico: Zero-shot nas via inverse coefficient of variation on gradients. arXiv preprint arXiv:2301.11300 (2023) +17. Li, S., Song, W., Fang, L., Chen, Y., Ghamisi, P., Benediktsson, J.A.: Deep learning for hyperspectral image classification: An overview. IEEE Transactions on Geoscience and Remote Sensing 57(9), 6690-6709 (2019) +18. Liu, C., Zoph, B., Neumann, M., Shlens, J., Hua, W., Li, L.J., Fei-Fei, L., Yuille, A., Huang, J., Murphy, K.: Progressive neural architecture search. In: Proceedings of the European conference on computer vision (ECCV). pp. 19-34 (2018) +19. Lopes, V., Alirezazadeh, S., Alexandre, L.A.: Epe-nas: Efficient performance estimation without training for neural architecture search. In: International Conference on Artificial Neural Networks. pp. 552-563. Springer (2021) +20. Mellor, J., Turner, J., Storkey, A., Crowley, E.J.: Neural architecture search without training. In: International Conference on Machine Learning. pp. 7588-7598. PMLR (2021) +21. Nagasubramanian, K., Jones, S., Singh, A.K., Sarkar, S., Singh, A., Ganapathysubramanian, B.: Plant disease identification using explainable 3d deep learning on hyperspectral images. Plant methods 15, 1-10 (2019) +22. Pham, H., Guan, M., Zoph, B., Le, Q., Dean, J.: Efficient neural architecture search via parameters sharing. In: International conference on machine learning. pp. 4095-4104. PMLR (2018) +23. Su, X., You, S., Xie, J., Zheng, M., Wang, F., Qian, C., Zhang, C., Wang, X., Xu, C.: Vitas: Vision transformer architecture search. In: European Conference on Computer Vision. pp. 139-157. Springer (2022) +24. Sun, L., Zhao, G., Zheng, Y., Wu, Z.: Spectral-spatial feature tokenization transformer for hyperspectral image classification. IEEE Transactions on Geoscience and Remote Sensing 60, 1-14 (2022) +25. Tanaka, H., Kunin, D., Yamins, D.L., Ganguli, S.: Pruning neural networks without any data by iteratively conserving synaptic flow. Advances in neural information processing systems 33, 6377-6389 (2020) +26. Theis, L., Korshunova, I., Tejani, A., Huszar, F.: Faster gaze prediction with dense networks and fisher pruning. arXiv preprint arXiv:1801.05787 (2018) +27. Transon, J., d'Andrimont, R., Maugnard, A., Defourny, P.: Survey of hyperspectral earth observation applications from space in the sentinel-2 context. Remote Sensing 10(2), 157 (2018) +28. Trierscheid, M., Pellenz, J., Paulus, D., Balthasar, D.: Hyperspectral imaging or victim detection with rescue robots. In: 2008 IEEE International Workshop on Safety, Security and Rescue Robotics. pp. 7-12. IEEE (2008) +29. Tsou, C.H., Lin, Y.C., Huang, Y.C., Li, W., Chen, J.C., Chen, C.S.: SEEKING THE SEARCH SPACE FOR SIZE-AWARE VISION TRANSFORMER ARCHITECTURE (2024), https://openreview.net/forum?id=iSdH16qEs2 +30. Turner, J., Crowley, E.J., O'Boyle, M., Storkey, A., Gray, G.: Blockswap: Fisher-guided block substitution for network compression on a budget. arXiv preprint arXiv:1906.04113 (2019) +31. Wang, C., Zhang, G., Grosse, R.: Picking winning tickets before training by preserving gradient flow. arXiv preprint arXiv:2002.07376 (2020) +32. Wang, D., Vinson, R., Holmes, M., Seibel, G., Bechar, A., Nof, S., Tao, Y.: Early detection of tomato spotted wilt virus by hyperspectral imaging and outlier removal + +auxiliary classifier generative adversarial nets (or-ac-gan). Scientific reports 9(1), 1-14 (2019) +33. White, C., Safari, M., Sukthanker, R., Ru, B., Elsken, T., Zela, A., Dey, D., Hutter, F.: Neural architecture search: Insights from 1000 papers. arXiv preprint arXiv:2301.08727 (2023) +34. Xiang, L., Dudziak, L., Abdelfattah, M.S., Chau, T., Lane, N.D., Wen, H.: Zero-cost operation scoring in differentiable architecture search. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 10453-10463 (2023) +35. Xiang, L., Hunter, R., Xu, M., Dudziak, L., Wen, H.: Exploiting network compressibility and topology in zero-cost nas. In: International Conference on Automated Machine Learning. pp. 18-1. PMLR (2023) +36. Xie, C., Shao, Y., Li, X., He, Y.: Detection of early blight and late blight diseases on tomato leaves using hyperspectral imaging. Scientific reports 5(1), 1-11 (2015) +37. Xiong, Z., Minshan, C., Abhinav, S., Díaz, D.J.C.F.: 2013 IEEE GRSS Data Fusion Contest - Fusion of Hyperspectral and LiDAR Data (2013), https://hyperspectral.ee.uh.edu/?page_id=459 +38. Zhou, F., Killickaya, M., Vanschoren, J.: Locality-aware hyperspectral classification. arXiv preprint arXiv:2309.01561 (2023) +39. Zhou, Q., Sheng, K., Zheng, X., Li, K., Sun, X., Tian, Y., Chen, J., Ji, R.: Training-free transformer architecture search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10894-10903 (2022) +40. Zoph, B., Le, Q.V.: Neural architecture search with reinforcement learning. arXiv preprint arXiv:1611.01578 (2016) \ No newline at end of file diff --git a/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/images.zip b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..6c2fe05870accd18e3e92be3c6ab55650742f4f4 --- /dev/null +++ b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1c2ac3fcf847be6bbde86eada05e6b5260550659385f18ac04217a532faa37cc +size 573919 diff --git a/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/layout.json b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..e2a7740cc24c523ee521c961e8b6824e9cdacda3 --- /dev/null +++ b/2024/HyTAS_ A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis/layout.json @@ -0,0 +1,8912 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 149, + 111, + 465, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 111, + 465, + 148 + ], + "spans": [ + { + "bbox": [ + 149, + 111, + 465, + 148 + ], + "type": "text", + "content": "HyTAS: A Hyperspectral Image Transformer Architecture Search Benchmark and Analysis" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "spans": [ + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "text", + "content": "Fangqin Zhou" + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "text", + "content": ", Mert Kilickaya" + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "text", + "content": ", Joaquin Vanschoren" + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "text", + "content": ", and Ran Piao" + }, + { + "bbox": [ + 141, + 167, + 472, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 146, + 190, + 468, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 190, + 468, + 201 + ], + "spans": [ + { + "bbox": [ + 146, + 190, + 468, + 201 + ], + "type": "text", + "content": "Automated Machine Learning Group, Eindhoven University of Technology, the" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 282, + 201, + 332, + 211 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 282, + 201, + 332, + 211 + ], + "spans": [ + { + "bbox": [ + 282, + 201, + 332, + 211 + ], + "type": "text", + "content": "Netherlands" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 237, + 213, + 375, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 237, + 213, + 375, + 223 + ], + "spans": [ + { + "bbox": [ + 237, + 213, + 375, + 223 + ], + "type": "text", + "content": "{f.zhou, j.vanschoren}@tue.nl" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 235, + 224, + 378, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 224, + 378, + 234 + ], + "spans": [ + { + "bbox": [ + 235, + 224, + 378, + 234 + ], + "type": "text", + "content": "https://github.com/openml-labs" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 263, + 455, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 263, + 455, + 396 + ], + "spans": [ + { + "bbox": [ + 159, + 263, + 455, + 396 + ], + "type": "text", + "content": "Abstract. Hyperspectral Imaging (HSI) plays an increasingly critical role in precise vision tasks within remote sensing, capturing a wide spectrum of visual data. Transformer architectures have significantly enhanced HSI task performance, while advancements in Transformer Architecture Search (TAS) have improved model discovery. To harness these advancements for HSI classification, we make the following contributions: i) We propose HyTAS, the first benchmark on transformer architecture search for Hyperspectral imaging, ii) We comprehensively evaluate 12 different methods to identify the optimal transformer over 5 different datasets, iii) We perform an extensive factor analysis on the Hyperspectral transformer search performance, greatly motivating future research in this direction. All benchmark materials are available at HyTAS." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "spans": [ + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "text", + "content": "Keywords: Hyperspectral Image Classification " + }, + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "text", + "content": " Transformer Architecture Search " + }, + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "text", + "content": " Zero-Cost Proxies " + }, + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 406, + 453, + 428 + ], + "type": "text", + "content": " Benchmark and Analysis" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 449, + 230, + 460 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 449, + 230, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 449, + 230, + 460 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 462, + 481, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 481, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 481, + 521 + ], + "type": "text", + "content": "Hyperspectral Imaging (HSI) captures a broad spectrum of electromagnetic wavelengths, providing detailed spectral information beyond conventional RGB images. This rich spectral data has significantly impacted various industries, including agriculture for plant monitoring [6,8,21,32,36], remote sensing for Earth analysis [9,27], and robotics for enhanced navigation and vision [13,28]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 522, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 593 + ], + "type": "text", + "content": "Scientists in fields like agriculture or remote sensing may seek to analyze Hyperspectral images using transformer models, see Fig. 1. However, designing high-performing Hyperspectral image transformers requires significant expertise and computational resources. Transformer Architecture Search (TAS) methods like AutoFormer [5] or ViTAS [23] can help but demand extensive computational resources (e.g., 24 GPU days for AutoFormer)." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "An alternative is using training-free architecture search techniques, known as zero-cost proxies [14, 16, 25, 31, 39]. Hereafter, we will use the term \"proxy\" for brevity. Proxies quickly evaluate transformer architectures without training, offering two key advantages: i) Efficiency: Proxies identify high-performing transformers within minutes. ii) Data Independence: Many proxies do not require real data, reducing setup and data collection costs [3,20,25,39]. This characteristic is" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 160, + 114, + 449, + 230 + ], + "blocks": [ + { + "bbox": [ + 160, + 114, + 449, + 230 + ], + "lines": [ + { + "bbox": [ + 160, + 114, + 449, + 230 + ], + "spans": [ + { + "bbox": [ + 160, + 114, + 449, + 230 + ], + "type": "image", + "image_path": "34465a6c2e10b84493e6ebe6e05769fd00f97760d5303bbec36c3943d5fbcd2f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 239, + 482, + 285 + ], + "lines": [ + { + "bbox": [ + 130, + 239, + 482, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 239, + 482, + 285 + ], + "type": "text", + "content": "Fig. 1: A scientist outside AI domain may find it difficult to design a novel Hyperspectral image transformer tailored to their tasks and data. To automate the design of Hyperspectral transformers, we introduce Hyperspectral Transformer Architecture Search (HyTAS) in this paper. The scientist images are generated by DALL-E." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 306, + 482, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 306, + 482, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 306, + 482, + 342 + ], + "type": "text", + "content": "especially advantageous for hyperspectral imaging applications, where the setup and calibration of the camera, as well as the collection and annotation of data, incur significant costs." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 342, + 499, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 342, + 499, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 342, + 499, + 449 + ], + "type": "text", + "content": "To that end, in this paper, we introduce Hyperspectral Transformer Architecture Search (HyTAS), to automatically identify Hyperspectral transformers tailored for downstream tasks and datasets. Our motivations are three-fold: i) Democratization: HyTAS enables researchers, especially in fields like biology or agriculture, to identify top-performing, lightweight models using minimal resources. ii) Attention: We aim to highlight the unique challenges of HSI to the NAS community, which has focused more on RGB images. iii) Novelty: We share novel findings to guide the development of better hyperspectral-specific search techniques and architectures." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 450, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 521 + ], + "type": "text", + "content": "Our approach begins by generating a substantial pool of candidate Hyperspectral transformers. Subsequently, we assess the performance of various proxies in their capacity to efficiently identify accurate Hyperspectral image transformers. Lastly, we conduct a comprehensive factor analysis to elucidate the factors influencing the performance of both Hyperspectral image transformers and proxy-based transformer search methods." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 146, + 522, + 412, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 522, + 412, + 533 + ], + "spans": [ + { + "bbox": [ + 146, + 522, + 412, + 533 + ], + "type": "text", + "content": "To sum up, this paper presents three primary contributions:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 129, + 534, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 136, + 534, + 481, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 534, + 481, + 569 + ], + "spans": [ + { + "bbox": [ + 136, + 534, + 481, + 569 + ], + "type": "text", + "content": "I. We introduce HyTAS, the pioneering benchmark for Transformer Architecture Search in HSI classification, comprising 2000 distinct Hyperspectral Image transformer architectures." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 570, + 481, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 570, + 481, + 604 + ], + "spans": [ + { + "bbox": [ + 133, + 570, + 481, + 604 + ], + "type": "text", + "content": "II. We conduct comprehensive benchmarking using 12 proxies across 5 datasets. Our benchmarking demonstrates the capability to achieve superior performance over a well-established, human-crafted counterpart within minutes." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 129, + 605, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 129, + 605, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 129, + 605, + 481, + 665 + ], + "type": "text", + "content": "III. We analyze various factors influencing the effectiveness of Transformer architecture search. Our findings include: i) Proxies demonstrate a bias towards larger models, ii) Proxies operate without necessitating real data input, iii) Proxies synergistically complement each other in predicting the accuracy of input transformers, suggesting promising avenues for future research." + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 238, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 238, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 238, + 127 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 139, + 386, + 152 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 139, + 386, + 152 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 386, + 152 + ], + "type": "text", + "content": "2.1 Transformer Architecture Search via Proxies" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 158, + 482, + 266 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 158, + 482, + 266 + ], + "spans": [ + { + "bbox": [ + 130, + 158, + 482, + 266 + ], + "type": "text", + "content": "Neural Architecture Search (NAS) customizes optimal architectures for specific tasks [2,18,22,40]. Transformer Architecture Search (TAS) is gaining popularity alongside transformer-based model advancements [4, 5, 23, 39]. However, these methods are computationally intensive, often taking days or months to converge [15, 33]. Many researchers lack resources; for instance, this study employs only a single GPU. An alternative approach involves using proxy functions, which swiftly assess architecture fitness without training [3, 14-16, 25]. In this paper, we adapt proxy methods to quickly search over a large database of Hyperspectral transformers." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 283, + 336, + 296 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 283, + 336, + 296 + ], + "spans": [ + { + "bbox": [ + 132, + 283, + 336, + 296 + ], + "type": "text", + "content": "2.2 Hyperspectral Image Transformers" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 302, + 482, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 302, + 482, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 302, + 482, + 411 + ], + "type": "text", + "content": "Hyperspectral image classification involves processing input cubes with significantly more channels (e.g., 200 vs. 3) and lower spatial resolution than conventional RGB imaging [17]. With the emergence of Vision-Transformers (ViT) [7], manual design of transformer architectures for Hyperspectral image classification has become common practice. For instance, Hong et al. [12] introduce Spectral-Former, adapting ViT for HSI classification, while Sun et al. [24] and Zhou et al. [38] enhance it with spatial-local attention modules. However, manual network design is laborious and resource-intensive. Therefore, in this study, we propose HyTAS to automate Hyperspectral image transformer design." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 428, + 270, + 442 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 428, + 270, + 442 + ], + "spans": [ + { + "bbox": [ + 132, + 428, + 270, + 442 + ], + "type": "text", + "content": "3 HyTAS Benchmark" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 453, + 482, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 482, + 523 + ], + "type": "text", + "content": "In practice, the optimal architecture is determined by its performance, often measured by the highest test accuracy for classification tasks. However, in TAS proxies, where training is not involved, a proxy measure is needed to rank architectures sampled from a search space based on their initial model weights or one-step gradients. This proxy score serves as the metric for estimating the performance of each architecture." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 525, + 482, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 597 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 597 + ], + "type": "text", + "content": "The process of TAS proxy for HSI classification is illustrated in Fig. 2, containing four main steps: 1). Patchify HSI image and tokenize each patch along its spectra, then randomly sample a batch of input. 2). Design a search space and sample architectures from it. 3). Select a proxy to estimate the sampled architectures and rank them by their proxy scores. 4). Evaluate the performance of search proxies. Formally, the objective of TAS proxy is formulated as follows:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 213, + 609, + 481, + 625 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 213, + 609, + 481, + 625 + ], + "spans": [ + { + "bbox": [ + 213, + 609, + 481, + 625 + ], + "type": "interline_equation", + "content": "a ^ {*} = \\arg \\max _ {a \\in \\mathcal {A}} \\mathrm {O A} (a) \\equiv a ^ {*} = \\arg \\max _ {a \\in \\mathcal {A}} \\mathcal {F} _ {s} (a) \\tag {1}", + "image_path": "1cf5f521ca31e65703d52ef75dd0d88a7b38829632ca2bdc09caa0fd52fbc873.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "a" + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "content": " is a transformer architecture sampled from the search space " + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "content": ", OA and " + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_s" + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "content": " denote the test overall accuracy and a scoring function, respectively. The objective aims to discover the optimal architecture " + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "a^*" + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "content": " through a scoring function" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 116, + 479, + 251 + ], + "blocks": [ + { + "bbox": [ + 138, + 116, + 479, + 251 + ], + "lines": [ + { + "bbox": [ + 138, + 116, + 479, + 251 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 479, + 251 + ], + "type": "image", + "image_path": "6ddbbda3fd82376680d4bd4a89907c89006dffb70d91c8830900b4ab4445b2e1.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 261, + 482, + 328 + ], + "lines": [ + { + "bbox": [ + 130, + 261, + 482, + 328 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 482, + 328 + ], + "type": "text", + "content": "Fig. 2: Diagram of TAS proxies for HSI classification: (1) Patchify the image and tokenize each patch along its spectra. (2) Randomly sample architectures from a designed search space. (3) Select a proxy to compute scores for sampled architectures after passing a batch of input. (4) Use the scores to rank architectures and choose the one with the highest score to retrain. Proxy evaluation metrics include test overall accuracy, model size, Spearman correlation between proxy scores and test OA, and search time." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 353, + 482, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 353, + 482, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 353, + 482, + 389 + ], + "type": "text", + "content": "instead of training all models. Designing a good search space " + }, + { + "bbox": [ + 130, + 353, + 482, + 389 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 353, + 482, + 389 + ], + "type": "text", + "content": " and a suitable proxy scoring function that accurately estimates architectures' performance is crucial for TAS proxies." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 410, + 259, + 421 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 410, + 259, + 421 + ], + "spans": [ + { + "bbox": [ + 132, + 410, + 259, + 421 + ], + "type": "text", + "content": "3.1 Benchmark Proxies" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 434, + 482, + 493 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 482, + 493 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 482, + 493 + ], + "type": "text", + "content": "Optimizing Equation 1 relies on employing an appropriate proxy scoring function " + }, + { + "bbox": [ + 130, + 434, + 482, + 493 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_s" + }, + { + "bbox": [ + 130, + 434, + 482, + 493 + ], + "type": "text", + "content": ". In this section, we provide a concise overview of various existing proxies commonly utilized within the NAS and TAS communities. The mathematical equation of each proxy as well as further details are presented in Section 7.1 in our supplementary material." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 495, + 481, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 495, + 481, + 518 + ], + "spans": [ + { + "bbox": [ + 130, + 495, + 481, + 518 + ], + "type": "text", + "content": "GradNorm [1]: aggregates the Euclidean norms of each layer's gradients after processing a single batch of training data." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 519, + 481, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 519, + 481, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 519, + 481, + 542 + ], + "type": "text", + "content": "SNIP [14]: calculates a saliency metric by incorporating both gradients and weights, facilitating parameter pruning in neural networks." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 544, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 579 + ], + "type": "text", + "content": "GraSP [31]: considers both the first-order and second-order derivatives of the network to preserve training dynamics instead of the loss at the beginning of training." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 580, + 481, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 580, + 481, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 580, + 481, + 604 + ], + "type": "text", + "content": "Synflow [25]: a modification of SNIP that eliminates the absolute expression to address layer collapse during parameter pruning." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 481, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 481, + 640 + ], + "type": "text", + "content": "LogSynflow [3]: addresses the issue of neglecting the significance of weights due to gradients in Synflow, by scaling down the gradients with a logarithmic function before summing up the contributions of their weights." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "type": "text", + "content": "Fisher: initially presented by [26] to achieve more runtime-efficient neural architectures, and utilized as a pruning metric at initialization by [30]. More" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "recently, [1] applied this metric to aggregate all gradients of the activations for scoring a network." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 479, + 162 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 479, + 162 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 479, + 162 + ], + "type": "text", + "content": "JacobCov [19]: leverages gradients over the input data instead of parameters or activations." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 164, + 479, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 479, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 479, + 187 + ], + "type": "text", + "content": "NASWOT [20]: computes the network score according to its kernel matrix of the binary activation patterns between a batch of training inputs." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 189, + 479, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 189, + 479, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 189, + 479, + 212 + ], + "type": "text", + "content": "DSS [39]: specifically designed for transformer architectures via combining synaptic diversity scores of MSA and synaptic saliency scores of MLP modules." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 213, + 479, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 213, + 479, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 213, + 479, + 236 + ], + "type": "text", + "content": "CROZe [11]: measures the consistency of features, parameters, and gradients between perturbed and clean samples." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 236, + 479, + 259 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 479, + 259 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 479, + 259 + ], + "type": "text", + "content": "T-CET [35]: incorporates the orthogonality of gradient-based (SSNR) and activation-based (NASWOT) compressibility to score an architecture." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 261, + 479, + 285 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 261, + 479, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 479, + 285 + ], + "type": "text", + "content": "ZiCo [16]: considers both absolute mean and standard deviation of gradients, emphasizing their influence on convergence rate and generalization capacity." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 303, + 275, + 315 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 303, + 275, + 315 + ], + "spans": [ + { + "bbox": [ + 131, + 303, + 275, + 315 + ], + "type": "text", + "content": "3.2 A New Proxy: " + }, + { + "bbox": [ + 131, + 303, + 275, + 315 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{+ + }" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "text", + "content": "Inspired by ZiCo's principle of favoring networks with high absolute mean and low standard deviation gradient values for faster convergence and improved generalization, we introduce " + }, + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{++}" + }, + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "text", + "content": ", a novel proxy. " + }, + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{++}" + }, + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "text", + "content": " enhances network expressive capacity by optimizing the mean and minimizing the standard deviation of Fisher information of activations across input samples. Additionally, to address the issue of the final score's heavy reliance on the number of layers in ZiCo, we incorporate a layer decay mechanism during score aggregation in " + }, + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{++}" + }, + { + "bbox": [ + 130, + 323, + 480, + 418 + ], + "type": "text", + "content": ". The mathematical formulation is as follows:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 191, + 427, + 480, + 484 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 191, + 427, + 480, + 484 + ], + "spans": [ + { + "bbox": [ + 191, + 427, + 480, + 484 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} Z i C o ^ {+ +} \\triangleq \\sum_ {i = 1} ^ {n - 1} Z i C o _ {i} ^ {+ +} + \\sum_ {i = n} ^ {N - 1} \\frac {1}{i - n + 1} Z i C o _ {i} ^ {+ +} + Z i C o _ {N} ^ {+ +} \\quad \\text {s . t .} \\\\ Z i C o _ {i} ^ {+ +} \\triangleq \\log \\left(\\sum_ {\\omega \\in \\theta_ {l}} \\frac {\\mathbb {E} \\left[ \\left(\\nabla_ {\\omega} L \\left(X _ {i} , y _ {i} ; z _ {i}\\right) * z _ {i}\\right) ^ {2} \\right]}{\\sqrt {\\operatorname {V a r} \\left(\\left(\\nabla_ {\\omega} L \\left(X _ {i} , y _ {i} ; z _ {i}\\right) * z _ {i}\\right) ^ {2}\\right)}}\\right) \\tag {2} \\\\ \\end{array}", + "image_path": "bb405fb0de0b871f19f730c47c5533f2f532cead515718d04495ada91800402e.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}_i^{++}" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}_N^{++}" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " denote the " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{++}" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " score of " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "i\\_\\text{th}" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " and the last layer, respectively. " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " is a tunable parameter representing the starting layer for layer decay, such that " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " is constrained by " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "n \\leq \\min\\_depth * 4 + 1" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": ", with " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "\\min\\_depth" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " denoting the minimal depth defined in the search space. In our experiments, we set " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "\\min\\_depth = 4" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "n = 6" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " to preserve the " + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{++}" + }, + { + "bbox": [ + 130, + 494, + 480, + 578 + ], + "type": "text", + "content": " score for the first embedding and the last projection layer, as well as for the first block containing two MSA layers and two MLP layers." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 597, + 264, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 597, + 264, + 609 + ], + "spans": [ + { + "bbox": [ + 131, + 597, + 264, + 609 + ], + "type": "text", + "content": "3.3 Search Space Design" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 617, + 479, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 479, + 666 + ], + "type": "text", + "content": "A transformer architecture contains an encoder and decoder, but for our classification task, we focus on encoder-only transformers. Typically, a transformer encoder consists of a series of blocks, each containing a multi-head self-attention (MSA) and a multi-layer perceptron (MLP) module. Therefore, the search space" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": "should account for four key elements: embedding dimension (embed_dim), number of blocks (depth), number of attention heads (num_heads), and MLP embedding ratio (mlp_ratio) for each block. These components significantly impact model performance." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 159, + 182, + 455, + 220 + ], + "blocks": [ + { + "bbox": [ + 159, + 182, + 455, + 220 + ], + "lines": [ + { + "bbox": [ + 159, + 182, + 455, + 220 + ], + "spans": [ + { + "bbox": [ + 159, + 182, + 455, + 220 + ], + "type": "table", + "html": "
Componentsdepthembed_dimnum_headsmlp_ratio
Choices(4, 10, 1)(32, 240, 16)(3, 6, 1)(1, 6, 1)
", + "image_path": "2f632c7fd8c024a81c6eacbfd08638bb2c2a004e09b4b467eed7fd497e6e2ac3.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 221, + 482, + 265 + ], + "lines": [ + { + "bbox": [ + 130, + 221, + 482, + 265 + ], + "spans": [ + { + "bbox": [ + 130, + 221, + 482, + 265 + ], + "type": "text", + "content": "Table 1: The search space across all datasets. It includes depth, embed_dim, num_heads, and mlp_ratio, with values indicating initial, final, and intervals. Different numbers of heads and MLP ratios are utilized for each block. Notably, the total number of layers equals depth * 4 + 2." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "type": "text", + "content": "Drawing inspiration from the effectiveness of manually crafted models proposed by [12, 38], we define our search space in Table 1. We randomly sample 2000 subnetworks from the search space for our experiments." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 335, + 274, + 350 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 335, + 274, + 350 + ], + "spans": [ + { + "bbox": [ + 131, + 335, + 274, + 350 + ], + "type": "text", + "content": "4 Experimental Setup" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 357, + 449, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 357, + 449, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 449, + 369 + ], + "type": "text", + "content": "Datasets We conduct experiments on five well-established HSI datasets:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 372, + 480, + 487 + ], + "type": "list", + "angle": 0, + "index": 13, + "blocks": [ + { + "bbox": [ + 136, + 372, + 480, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 372, + 480, + 395 + ], + "spans": [ + { + "bbox": [ + 136, + 372, + 480, + 395 + ], + "type": "text", + "content": "i. Indian Pines [10]: 224 spectral bands, " + }, + { + "bbox": [ + 136, + 372, + 480, + 395 + ], + "type": "inline_equation", + "content": "145 \\times 145" + }, + { + "bbox": [ + 136, + 372, + 480, + 395 + ], + "type": "text", + "content": " spatial resolution, 16 classes, 695 training, and " + }, + { + "bbox": [ + 136, + 372, + 480, + 395 + ], + "type": "inline_equation", + "content": "9k" + }, + { + "bbox": [ + 136, + 372, + 480, + 395 + ], + "type": "text", + "content": " testing samples." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "text", + "content": "ii. Houston2013 [37]: 144 spectral bands, " + }, + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "inline_equation", + "content": "349 \\times 1905" + }, + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "text", + "content": " spatial resolution, 15 classes, " + }, + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "inline_equation", + "content": "2k" + }, + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "text", + "content": " training, and " + }, + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "inline_equation", + "content": "12k" + }, + { + "bbox": [ + 134, + 396, + 480, + 418 + ], + "type": "text", + "content": " testing samples." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "text", + "content": "iii. Pavia University (PaviaU) [10]: 103 spectral bands, " + }, + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "inline_equation", + "content": "610 \\times 340" + }, + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "text", + "content": " spatial resolution, 9 classes, " + }, + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "inline_equation", + "content": "3k" + }, + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "text", + "content": " training, and " + }, + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "inline_equation", + "content": "40k" + }, + { + "bbox": [ + 132, + 418, + 480, + 441 + ], + "type": "text", + "content": " testing samples." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 441, + 480, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 441, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 133, + 441, + 480, + 464 + ], + "type": "text", + "content": "iv. Kennedy Space Center (KSC) [10]: 176 spectral bands, " + }, + { + "bbox": [ + 133, + 441, + 480, + 464 + ], + "type": "inline_equation", + "content": "518 \\times 620" + }, + { + "bbox": [ + 133, + 441, + 480, + 464 + ], + "type": "text", + "content": " spatial resolution, 13 classes, 195 training, and " + }, + { + "bbox": [ + 133, + 441, + 480, + 464 + ], + "type": "inline_equation", + "content": "5k" + }, + { + "bbox": [ + 133, + 441, + 480, + 464 + ], + "type": "text", + "content": " testing samples." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "spans": [ + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "type": "text", + "content": ". Salinas scene [10]: 224 spectral bands, " + }, + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "type": "inline_equation", + "content": "512 \\times 217" + }, + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "type": "text", + "content": " spatial resolution, 16 classes, 800 training, and " + }, + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "type": "inline_equation", + "content": "53k" + }, + { + "bbox": [ + 136, + 464, + 480, + 487 + ], + "type": "text", + "content": " testing samples." + } + ] + } + ], + "index": 12 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 491, + 482, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 482, + 552 + ], + "type": "text", + "content": "Indian Pines and Salinas contain mostly agricultural vegetation, and the remaining three datasets consist of non-agricultural vegetation, such as roads and buildings. More details are presented in Section 7.2 in our supplementary material. For data-dependent search proxies, we randomly sample a batch of training data with a batch size of 64, consistent with the batch size used for retraining." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "spans": [ + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "text", + "content": "Metrics We evaluate architecture performance with test Overall Accuracy (OA), indicating correctly predicted samples over all samples. Spearman correlation " + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "inline_equation", + "content": "(\\rho)" + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "text", + "content": " measures the correlation between proxy scores and final test OA after training all sampled networks. We also compare Search Time (ST) and proposed Model Size (MS) for each proxy, calculated using the following equation from [29]:" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 136, + 625, + 476, + 637 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 625, + 476, + 637 + ], + "spans": [ + { + "bbox": [ + 136, + 625, + 476, + 637 + ], + "type": "interline_equation", + "content": "M S (a, b, c, d) = 1, 5 3 9 d + a \\left(4 d + 2 5 6 c d + 1 9 2 c + 5 d + 7, 6 8 0 + 2 b d ^ {2} + b d + d\\right) + 2 d + \\# \\text {c l a s s} \\times (d + 1)", + "image_path": "1b643413c6b7875d8f326ec091ba418b67bce5113a491bd177784e025e136604.jpg" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "a" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "b" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": " represent the depth, MLP ratio, number of heads, and embedding dimension, respectively. #class is the number of classes in the dataset." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 253, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 253, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 253, + 129 + ], + "type": "text", + "content": "5 HyTAS Analysis" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 143, + 471, + 156 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 143, + 471, + 156 + ], + "spans": [ + { + "bbox": [ + 132, + 143, + 471, + 156 + ], + "type": "text", + "content": "This section presents experiments to answer the following research questions:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 137, + 168, + 479, + 218 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 137, + 168, + 380, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 168, + 380, + 180 + ], + "spans": [ + { + "bbox": [ + 137, + 168, + 380, + 180 + ], + "type": "text", + "content": "- RQ1: How do proxies perform on HSI classification?" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 182, + 479, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 182, + 479, + 193 + ], + "spans": [ + { + "bbox": [ + 138, + 182, + 479, + 193 + ], + "type": "text", + "content": "RQ2: What factors influence Hyperspectral image transformer performance?" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 194, + 355, + 205 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 194, + 355, + 205 + ], + "spans": [ + { + "bbox": [ + 138, + 194, + 355, + 205 + ], + "type": "text", + "content": "RQ3: What factors influence the proxy scores?" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 207, + 301, + 218 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 207, + 301, + 218 + ], + "spans": [ + { + "bbox": [ + 138, + 207, + 301, + 218 + ], + "type": "text", + "content": "RQ4: Are proxies complementary?" + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 239, + 432, + 252 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 239, + 432, + 252 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 432, + 252 + ], + "type": "text", + "content": "5.1 RQ1: How Do Proxies Perform on HSI Classification?" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 263, + 481, + 300 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 263, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 263, + 481, + 300 + ], + "type": "text", + "content": "Previous studies have shown the varying performance of proxies under different search space constraints [15,33]. To address RQ1, we conduct experiments under full and constrained search space conditions." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 314, + 481, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 314, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 314, + 481, + 363 + ], + "type": "text", + "content": "Full Search Space We compare proxies across all (2000) subnetworks sampled from the entire search space on five datasets. We include two reference results: SpectralFormer as the human-crafted transformer, and Oracle as the upper bound. Results are presented in Table 2. We make four observations:" + } + ] + } + ], + "index": 11 + }, + { + "type": "table", + "bbox": [ + 136, + 384, + 477, + 574 + ], + "blocks": [ + { + "bbox": [ + 136, + 384, + 477, + 574 + ], + "lines": [ + { + "bbox": [ + 136, + 384, + 477, + 574 + ], + "spans": [ + { + "bbox": [ + 136, + 384, + 477, + 574 + ], + "type": "table", + "html": "
DatasetIndian PinesHouston2013PaviaUKSCSalinas
ProxyOAMSρOAMSρOAMSρOAMSρOAMSρ
#Flops0.7926.30.690.8626.30.660.8926.30.710.8926.30.820.9126.30.94
GradNorm0.8126.80.710.8629.80.700.9029.80.620.9029.20.840.9229.80.87
SNIP0.8126.80.700.8729.90.660.8926.30.690.8928.10.830.9326.80.94
GraSP0.420.62-0.670.780.94-0.630.780.62-0.670.470.62-0.790.391.23-0.88
Synflow0.797.350.600.847.350.530.907.350.730.877.350.710.927.350.91
LogSynflow0.797.350.600.847.350.520.907.350.730.877.350.680.927.350.89
Fisher0.8116.30.610.8718.50.640.9029.30.610.8928.10.790.929.830.92
JacobCov0.8211.90.580.8821.40.720.845.630.400.9029.80.700.9013.70.52
NASWOT0.7926.30.690.8723.10.710.8923.10.620.8926.30.830.9126.30.87
T-CET0.7926.30.630.8626.30.710.8926.30.380.8926.30.740.9429.90.65
CRoZe0.7926.30.460.8726.70.540.8426.40.180.8929.30.550.9128.10.42
DSS0.8025.90.600.847.350.530.899.890.730.8910.60.720.9229.80.91
ZiCo0.8126.80.520.8626.30.620.8425.60.260.8926.30.630.9126.30.50
ZiCo++0.8125.60.730.8629.30.750.8425.60.620.8929.30.830.9429.30.86
SpectralFormer0.790.48-0.850.48-0.850.48-0.860.48-0.890.48-
Oracle0.858.42-0.899.23-0.913.20-0.918.43-0.9620.5-
", + "image_path": "b58d67badadcf2ea5e11d8a76086b47145d447b05b0b29f6ebd84a04064fcd2b.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "table_body" + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 575, + 481, + 629 + ], + "lines": [ + { + "bbox": [ + 132, + 575, + 481, + 629 + ], + "spans": [ + { + "bbox": [ + 132, + 575, + 481, + 629 + ], + "type": "text", + "content": "Table 2: Comparison of search results among proxies, presenting test Overall Accuracy (OA) and corresponding model size (MS) determined by each proxy, as well as their Spearman correlation " + }, + { + "bbox": [ + 132, + 575, + 481, + 629 + ], + "type": "inline_equation", + "content": "(\\rho)" + }, + { + "bbox": [ + 132, + 575, + 481, + 629 + ], + "type": "text", + "content": " between proxy scores and final test OA after training. The evaluation is conducted over a search space of 2000 subnets across five HSI datasets. MS values are scaled by " + }, + { + "bbox": [ + 132, + 575, + 481, + 629 + ], + "type": "inline_equation", + "content": "10^{6}" + }, + { + "bbox": [ + 132, + 575, + 481, + 629 + ], + "type": "text", + "content": ". T-CET is computed with SNIP and NASWOT [35]." + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 482, + 344 + ], + "type": "list", + "angle": 0, + "index": 6, + "blocks": [ + { + "bbox": [ + 138, + 116, + 482, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 482, + 164 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 482, + 164 + ], + "type": "text", + "content": "- The effectiveness of proxies varies across datasets. JacobCov achieves the highest OA for Indian Pines, Houston2013, and KSC datasets, while Grad-Norm and T-CET demonstrate the highest OA of 0.90 and 0.94 for the PaviaU and Salinas datasets, respectively." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 139, + 164, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 164, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 139, + 164, + 482, + 224 + ], + "type": "text", + "content": "- Some proxies may yield high OA but exhibit low Spearman correlation. For instance, JacobCov achieves the highest OA for three datasets but with considerably lower Spearman correlations compared to the best ones, emphasizing the importance of considering both OA and Spearman correlation for comprehensive assessment." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "text", + "content": "- " + }, + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{++}" + }, + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "text", + "content": " does not outperform " + }, + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}" + }, + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "text", + "content": " in terms of OA across all datasets except for Salinas. However, it significantly exceeds " + }, + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}" + }, + { + "bbox": [ + 139, + 224, + 482, + 272 + ], + "type": "text", + "content": " in Spearman correlation across all datasets, achieving the highest Spearman correlation among all proxies for the Indian Pines and Houston datasets." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 139, + 273, + 482, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 273, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 139, + 273, + 482, + 344 + ], + "type": "text", + "content": "- Apart from OA, model size, and " + }, + { + "bbox": [ + 139, + 273, + 482, + 344 + ], + "type": "inline_equation", + "content": "\\rho" + }, + { + "bbox": [ + 139, + 273, + 482, + 344 + ], + "type": "text", + "content": ", searching efficiency is crucial for evaluating proxies. Table 3 compares search times of all proxies. Except for ZiCo and CRoZe, the search times for the other proxies are remarkably similar. ZiCo's extended search time can be attributed to the computation of scores across individual samples, requiring gradient calculations for each sample rather than utilizing batch mean gradients." + } + ] + } + ], + "index": 5 + } + ], + "sub_type": "text" + }, + { + "type": "table", + "bbox": [ + 136, + 377, + 478, + 403 + ], + "blocks": [ + { + "bbox": [ + 136, + 377, + 478, + 403 + ], + "lines": [ + { + "bbox": [ + 136, + 377, + 478, + 403 + ], + "spans": [ + { + "bbox": [ + 136, + 377, + 478, + 403 + ], + "type": "table", + "html": "
ProxyGradNormSNIPSynflowFisherJacobCovNASWOTCRoZeDSSZiCoZiCo++
Search time (h)0.120.120.120.200.120.140.380.170.840.14
", + "image_path": "d358cff869a00aa0cb79fd3b04cac9c3f35f684c61ec95b7097a61caa7075305.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 403, + 482, + 425 + ], + "lines": [ + { + "bbox": [ + 132, + 403, + 482, + 425 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 482, + 425 + ], + "type": "text", + "content": "Table 3: Comparison of search times for each proxy across a search space of 2000 subnets on the Indian Pines dataset." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "content": "Constrained Search Space We visualize Spearman correlations and proposed OA across varying model size constraints in Fig. 3. The depicted range represents the minimum and maximum model sizes within the search space. For instance, the range from 0 to " + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{e}7" + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "content": " signifies model sizes from 0 to " + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "inline_equation", + "content": "5\\mathrm{M}" + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "content": ", and from " + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{e}7" + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "inline_equation", + "content": "1\\mathrm{e}7" + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "content": ", it represents sizes from " + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "inline_equation", + "content": "5\\mathrm{M}" + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "inline_equation", + "content": "10\\mathrm{M}" + }, + { + "bbox": [ + 132, + 461, + 482, + 522 + ], + "type": "text", + "content": ". We make three observations:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 533, + 482, + 618 + ], + "type": "list", + "angle": 0, + "index": 13, + "blocks": [ + { + "bbox": [ + 138, + 533, + 482, + 557 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 533, + 482, + 557 + ], + "spans": [ + { + "bbox": [ + 138, + 533, + 482, + 557 + ], + "type": "text", + "content": "- The Spearman correlation between proxies and OA decreases with increasing model size, indicating higher efficacy of proxies for smaller models." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 139, + 558, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 558, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 139, + 558, + 482, + 581 + ], + "type": "text", + "content": "- The Oracle OA increases for models smaller than 5M and remains relatively stable thereafter, with the optimal OA observed at 5M." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 139, + 582, + 482, + 618 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 582, + 482, + 618 + ], + "spans": [ + { + "bbox": [ + 139, + 582, + 482, + 618 + ], + "type": "text", + "content": "- Most proxies favor complex models and struggle when simpler models are more effective, suggesting their limited capability to filter out underperforming models." + } + ] + } + ], + "index": 12 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 628, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 628, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 628, + 482, + 666 + ], + "type": "text", + "content": "Takeaway ①: Most proxies can identify a transformer with better accuracy than the human-crafted counterpart, SpectralFormer. However, the proposed architectures are more complex than necessary, when compared to the oracle." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 116, + 307, + 265 + ], + "blocks": [ + { + "bbox": [ + 134, + 116, + 307, + 265 + ], + "lines": [ + { + "bbox": [ + 134, + 116, + 307, + 265 + ], + "spans": [ + { + "bbox": [ + 134, + 116, + 307, + 265 + ], + "type": "image", + "image_path": "600ee957334a2cf96c3ca512bdb5eed31c5fe265d358610b4b9d747a82ca2fb0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 276, + 479, + 299 + ], + "lines": [ + { + "bbox": [ + 130, + 276, + 479, + 299 + ], + "spans": [ + { + "bbox": [ + 130, + 276, + 479, + 299 + ], + "type": "text", + "content": "Fig. 3: Spearman correlation and proxy-proposed OA across different model size constraints on the Indian Pines dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 307, + 116, + 479, + 265 + ], + "blocks": [ + { + "bbox": [ + 307, + 116, + 479, + 265 + ], + "lines": [ + { + "bbox": [ + 307, + 116, + 479, + 265 + ], + "spans": [ + { + "bbox": [ + 307, + 116, + 479, + 265 + ], + "type": "image", + "image_path": "aa795b3fb7b0a0c6739a2f87e188d4bdb85107fbd6ec42666712c5fbeb3042a1.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 323, + 479, + 346 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 479, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 479, + 346 + ], + "type": "text", + "content": "5.2 RQ2: What Factors Influence Hyperspectral Image Transformer Performance?" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 355, + 479, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 355, + 479, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 355, + 479, + 403 + ], + "type": "text", + "content": "In RQ1, we show that proxies identify a highly accurate, yet complex model. However, is this an optimal Hyperspectral transformer? To answer this, in this section, we analyze the relationship between the performance and the architectural factors. We have three key observations:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 414, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 10, + "blocks": [ + { + "bbox": [ + 138, + 414, + 479, + 497 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 414, + 479, + 497 + ], + "spans": [ + { + "bbox": [ + 138, + 414, + 479, + 497 + ], + "type": "text", + "content": "- Fig. 4 presents the Spearman correlation between OA and: depth (depth), embedding dimension (embed_dim), number of heads (num_heads), and MLP ratio (mlp_ratio). Notably, factors such as the number of heads and MLP ratio show minimal correlation with overall model performance across all datasets. Conversely, the influence of depth and embedding dimension varies across datasets, with embedding dimension exhibiting particularly high correlations across all datasets, reaching 0.91 on Salinas dataset." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 498, + 480, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 498, + 480, + 640 + ], + "spans": [ + { + "bbox": [ + 138, + 498, + 480, + 640 + ], + "type": "text", + "content": "- Fig. 4 presents average head embedding dimension (mean_head_dim), average MLP dimension (mean_mlp_dim), sum of all head dimensions (sum_head_dim), sum of all MLP dimensions (sum_mlp_dim), and model size. Notably, average head dimension and average MLP ratio exhibit OA impacts similar to the embedding dimension, while total head dimension and total MLP ratio aggregate influence from both embedding dimension and depth. However, for datasets like PaviaU, where OA relies solely on embedding dimension, the impact of total head dimension diminishes. Conversely, for datasets like Indian Pines, Houston2013, and KSC, where OA correlates with both embedding dimension and depth, Spearman correlation of total head dimension increases. This suggests that if proxy scores correlate solely with one factor, they may not be robust indicators." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 642, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 642, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 642, + 479, + 665 + ], + "type": "text", + "content": "- In Fig. 5, we visualize the highest OA of different values of each component across all datasets. Optimal embedding dimension and depth vary across" + } + ] + } + ], + "index": 9 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 157, + 132, + 440, + 262 + ], + "blocks": [ + { + "bbox": [ + 200, + 121, + 418, + 130 + ], + "lines": [ + { + "bbox": [ + 200, + 121, + 418, + 130 + ], + "spans": [ + { + "bbox": [ + 200, + 121, + 418, + 130 + ], + "type": "text", + "content": "Spearman correlations between OA and each component" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 157, + 132, + 440, + 262 + ], + "lines": [ + { + "bbox": [ + 157, + 132, + 440, + 262 + ], + "spans": [ + { + "bbox": [ + 157, + 132, + 440, + 262 + ], + "type": "image", + "image_path": "b9627a007813822a3bbca27372306b22a11654d07c6dd51b22727a3d80fae56d.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 280, + 482, + 323 + ], + "lines": [ + { + "bbox": [ + 130, + 280, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 280, + 482, + 323 + ], + "type": "text", + "content": "Fig. 4: Spearman correlations between final test OA and components of the search space across five datasets. num_heads and mlp_ratio exhibit minimal correlation, while embed_dim, sum_head_dim, and sum_mlp_dim show high correlation across all datasets." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 148, + 353, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 148, + 353, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 148, + 353, + 482, + 437 + ], + "type": "text", + "content": "datasets. As an example, in Indian Pines, OA increases with the embedding dimension, peaking at embed_dim = 128 and remaining stable thereafter. Similarly, depth = 8 results in the highest OA, with no further improvements observed when increasing the depth to 9 or 10. Additionally, the impact of the average number of heads and the average MLP ratio on model performance is showcased in the right two subplots, where mean number of heads of 4 - 5 and mean MLP ratio of 3 - 4 yield relatively stable and high OA." + } + ] + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 133, + 479, + 480, + 546 + ], + "blocks": [ + { + "bbox": [ + 133, + 479, + 480, + 546 + ], + "lines": [ + { + "bbox": [ + 133, + 479, + 480, + 546 + ], + "spans": [ + { + "bbox": [ + 133, + 479, + 480, + 546 + ], + "type": "image", + "image_path": "09e28cb47fee7590787f90e5a3c5b0fceca112ac459d1c88fc6bbeae73301996.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 555, + 482, + 590 + ], + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 590 + ], + "type": "text", + "content": "Fig. 5: The best OA corresponding to different values of diverse factors, including the embedding dimension (embed_dim), the depth (depth), the average number of heads (mean_heads_num), and the average MLP ratio (mean_mlp_ratio)." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 616, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 616, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 616, + 482, + 666 + ], + "type": "text", + "content": "Takeaway ②: Across datasets, embedding dimension and depth exhibit consistent sensitivity, though with slight variations. Furthermore, while larger models generally achieve better performance, optimal networks do not necessarily have to be the largest or most complex ones." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 402, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 402, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 402, + 128 + ], + "type": "text", + "content": "5.3 RQ3: What Factors Influence the Proxy Scores?" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 481, + 161 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 481, + 161 + ], + "type": "text", + "content": "To answer this question, we analyze the sensitivity of proxy scores to architecture components, input data, and module types separately." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 174, + 482, + 341 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 174, + 482, + 341 + ], + "spans": [ + { + "bbox": [ + 130, + 174, + 482, + 341 + ], + "type": "text", + "content": "Sensitivity to Architectural Components We examine Spearman correlations between proxy scores and each component on Indian Pines dataset in Fig. 6. Additionally, Spearman correlations between OA and each component are shown in the last column as a comparison. Depth and embedding dimension significantly impact scores of most proxies. Specifically, #Flops, SNIP, and GradNorm display a strong correlation (over 0.95) with the sum of heads' dimensions, surpassing the correlation with OA. Furthermore, Synflow, LogSynflow, and DSS show perfect correlation with embedding dimension and minimal correlation with depth due to taking sign of model parameters, which also exceeds the correlation with OA. Interestingly, removing sign operations improves the performance of Synflow, LogSynflow, and DSS. Details are shown in Section 7.3 in our supplementary material. These discrepancies in the correlation between OA and proxy scores result in a performance gap between proxies and oracle results." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 138, + 365, + 485, + 491 + ], + "blocks": [ + { + "bbox": [ + 138, + 365, + 485, + 491 + ], + "lines": [ + { + "bbox": [ + 138, + 365, + 485, + 491 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 485, + 491 + ], + "type": "image", + "image_path": "bd90242dea15cdf3395789193643ee2b40dff3753c4030d934e721689d453ee2.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 506, + 482, + 529 + ], + "lines": [ + { + "bbox": [ + 130, + 506, + 482, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 482, + 529 + ], + "type": "text", + "content": "Fig.6: Spearman correlations between proxy scores and architecture components on Indian Pines dataset." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 545, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 629 + ], + "type": "text", + "content": "Sensitivity to Input Data Considering Synflow, LogSynflow, NASWOT, and DSS are data-agnostic, we explore the sensitivity of remaining proxies to input data. To investigate this, we conduct search experiments using one batch of random input data across the remaining proxies. The results, presented in Table 4, reveal that performing the search with random inputs yields outcomes very similar to those obtained with the Indian Pines dataset. This suggests that the majority of the proxies exhibit negligible dependency on specific input data." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 630, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 665 + ], + "type": "text", + "content": "Furthermore, we compare OA, SNIP, and GradNorm scores from the same models between PaviaU and Indian Pines datasets in Fig. 7. The plots of SNIP and GradNorm indicate a perfect correlation between scores across different" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 145, + 114, + 470, + 207 + ], + "blocks": [ + { + "bbox": [ + 145, + 114, + 470, + 207 + ], + "lines": [ + { + "bbox": [ + 145, + 114, + 470, + 207 + ], + "spans": [ + { + "bbox": [ + 145, + 114, + 470, + 207 + ], + "type": "table", + "html": "
ProxyOAρ
Indian PinesRandom InputIndian PinesRandom Input
GradNorm0.810.810.710.71
SNIP0.810.810.700.69 (-0.01)
GraSP0.420.44 (+0.02)-0.67-0.70 (-0.03)
Fisher0.810.82 (+0.01)0.610.55 (-0.06)
JacobCov0.820.79 (-0.03)0.580.68 (+0.1)
ZiCo0.810.79 (-0.02)0.520.52
", + "image_path": "d0777ff4f80a8b89a72dbf1dbe1accaea30ce3fa6eed9b0a2aa7c604da18ea00.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 208, + 479, + 229 + ], + "lines": [ + { + "bbox": [ + 132, + 208, + 479, + 229 + ], + "spans": [ + { + "bbox": [ + 132, + 208, + 479, + 229 + ], + "type": "text", + "content": "Table 4: Comparison between searching with a batch of Indian Pines inputs and random inputs." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 263, + 480, + 323 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 263, + 480, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 263, + 480, + 323 + ], + "type": "text", + "content": "datasets, suggesting that the proxies are largely independent of the input data. However, the plot of OA shows significant variation between the two datasets, indicating that the same architecture yields very different performances depending on the dataset. This finding further emphasizes the gap between proxies and model performance." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 136, + 346, + 248, + 434 + ], + "blocks": [ + { + "bbox": [ + 136, + 346, + 248, + 434 + ], + "lines": [ + { + "bbox": [ + 136, + 346, + 248, + 434 + ], + "spans": [ + { + "bbox": [ + 136, + 346, + 248, + 434 + ], + "type": "image", + "image_path": "16aef6e663694dea17a86a05dfc41d8e36fadafdf0789445d1995f16be1733d6.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 446, + 480, + 468 + ], + "lines": [ + { + "bbox": [ + 130, + 446, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 480, + 468 + ], + "type": "text", + "content": "Fig. 7: Comparisons of OA, SNIP, GradNorm of same subnetworks between PaviaU and Indian Pines datasets." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 249, + 346, + 362, + 434 + ], + "blocks": [ + { + "bbox": [ + 249, + 346, + 362, + 434 + ], + "lines": [ + { + "bbox": [ + 249, + 346, + 362, + 434 + ], + "spans": [ + { + "bbox": [ + 249, + 346, + 362, + 434 + ], + "type": "image", + "image_path": "13079103e2e7fce302a8069267d847ba0981b710738465759af3e5df5009bc22.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 365, + 346, + 477, + 434 + ], + "blocks": [ + { + "bbox": [ + 365, + 346, + 477, + 434 + ], + "lines": [ + { + "bbox": [ + 365, + 346, + 477, + 434 + ], + "spans": [ + { + "bbox": [ + 365, + 346, + 477, + 434 + ], + "type": "image", + "image_path": "8f789f564f9527b743435c3bb5f28c042be110d6daa235e30f1d36ceb64ff425.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 485, + 481, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 481, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 481, + 628 + ], + "type": "text", + "content": "Sensitivity to Module Type (MSA vs. MLP) Given the distinct structures of MSA and MLP modules within a transformer architecture, we hypothesize that the effectiveness of the two modules for proxy scores might differ significantly. To validate our assumption, we separately compute DSS, Synflow, and SNIP scores for MSA and MLP modules. Our analysis reveals a significant score scale difference between MSA and MLP. For instance, for DSS scores, MSA " + }, + { + "bbox": [ + 130, + 485, + 481, + 628 + ], + "type": "inline_equation", + "content": "(2472 \\pm 259)" + }, + { + "bbox": [ + 130, + 485, + 481, + 628 + ], + "type": "text", + "content": " is notably higher than MLP " + }, + { + "bbox": [ + 130, + 485, + 481, + 628 + ], + "type": "inline_equation", + "content": "(268 \\pm 366)" + }, + { + "bbox": [ + 130, + 485, + 481, + 628 + ], + "type": "text", + "content": ", indicating the predominant contribution of MSA modules to final proxy scores, with minimal influence from MLP modules. To address this imbalance, we apply a logarithmic transformation to both module scores. The transformed results demonstrate comparable scores for MSA and MLP modules across all three proxies. Detailed scores are presented in Section 7.4 in our supplementary material." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 630, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 481, + 666 + ], + "type": "text", + "content": "Furthermore, we assess the effectiveness of scores with and without logarithmic transformation, as shown in Table 5. The origin score is represented as origin_score = msa_score + mlp_score, and the new score is represented as" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "inline_equation", + "content": "\\text{logarithm\\_score} = \\log (msa\\_ score \\times mlp\\_ score)" + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "inline_equation", + "content": "msa\\_ score" + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "content": " represents the cumulative score of all MSA layers, and " + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "inline_equation", + "content": "mlp\\_ score" + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "content": " denotes the cumulative score of all MLP layers. The results indicate improvements with the logarithmic transformation, particularly for Synflow and DSS proxies." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 134, + 184, + 479, + 268 + ], + "blocks": [ + { + "bbox": [ + 134, + 184, + 479, + 268 + ], + "lines": [ + { + "bbox": [ + 134, + 184, + 479, + 268 + ], + "spans": [ + { + "bbox": [ + 134, + 184, + 479, + 268 + ], + "type": "table", + "html": "
DatasetSNIPGradNormSynflowDSS
originlogarithmoriginlogarithmoriginlogarithmoriginlogarithm
Indian Pines0.700.700.710.710.690.720.690.70
Houston20130.660.650.700.700.680.730.670.69
PaviaU0.690.700.620.640.690.630.700.69
KSC0.830.820.840.840.820.860.820.84
Salinas0.940.940.870.900.930.900.940.94
", + "image_path": "48040df8edabd9e4e4ce4a25bd9bf6b212e0f190861cdc119169147c6727568e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 269, + 479, + 291 + ], + "lines": [ + { + "bbox": [ + 132, + 269, + 479, + 291 + ], + "spans": [ + { + "bbox": [ + 132, + 269, + 479, + 291 + ], + "type": "text", + "content": "Table 5: Comparison of Spearman correlations between proxy scores and OA, with and without logarithmic transformation." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 310, + 482, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 310, + 482, + 384 + ], + "spans": [ + { + "bbox": [ + 130, + 310, + 482, + 384 + ], + "type": "text", + "content": "Takeaway ③: Proxies exhibit a higher correlation with embedding dimension and depth than actual model performance, suggesting limited sensitivity to input data. Enhancing proxies' robustness may involve integrating more input information and decreasing sensitivity to individual architecture components. Furthermore, assessing scores independently for MSA and MLP modules, or employing distinct metrics for each, could improve proxy performance." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 402, + 339, + 415 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 402, + 339, + 415 + ], + "spans": [ + { + "bbox": [ + 131, + 402, + 339, + 415 + ], + "type": "text", + "content": "5.4 RQ4: Are Proxies Complementary?" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 423, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 495 + ], + "type": "text", + "content": "Motivation. Our results indicate that TAS proxies are fast but may lack reliability, with search performance varying across datasets. Therefore, TAS proxies solely remain problematic. Some studies have employed proxies for pre-filtering or combined them with other search methods, such as one-shot search, evolutionary algorithms, or Bayesian optimization [33,34]. Here, we propose an alternative approach to leverage proxies for enhancing search performance." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 508, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 508, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 508, + 482, + 628 + ], + "type": "text", + "content": "Setup. We seek to forecast a network's performance using its architectural structure and proxy scores. By retraining all sampled networks and collecting their proxy scores, we explore the feasibility of predicting a model's OA, alongside exploring the number of training samples needed for accurate predictions. We apply a default Random Forest model, with inputs comprising 2000 samples. Each sample represents a subnetwork sampled from the search space, encompassing attributes such as depth, embed_dim, num_heads, mlp_ratio, and various proxy scores including SNIP, GradNorm, Synflow, DSS, ZiCo, and Fisher scores. The target variable is OA, derived from the Indian Pines dataset. Detailed settings are presented in Section 7.5 in our supplementary material." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": "Results. Fig. 8 displays the test outcomes. The left subplot presents the predicted OA alongside the actual OA for 1950 networks trained on 50 networks." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "The Spearman correlation between actual and predicted OA reaches 0.80, surpassing the best correlation obtained from proxies by " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "9\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": ". Additionally, the right subplot demonstrates a correlation improvement with an increase in the number of training networks. Each result represents the mean and standard deviation across five runs with random seeds. Notably, the correlation rises to 0.78, a " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "6\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": " increase over the untrained scenario, with only 20 networks trained. It is worth noting that training the Random Forest model takes less than one minute with a training size of " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{x}" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": ", making the cost almost negligible compared to training the original subnetworks with actual input data." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 134, + 247, + 293, + 373 + ], + "blocks": [ + { + "bbox": [ + 134, + 247, + 293, + 373 + ], + "lines": [ + { + "bbox": [ + 134, + 247, + 293, + 373 + ], + "spans": [ + { + "bbox": [ + 134, + 247, + 293, + 373 + ], + "type": "image", + "image_path": "1d7a5ce949b95cf41a1e5e444ae4f6519d727e969ac3cbbd2a27482abdfe5a98.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 154, + 384, + 457, + 396 + ], + "lines": [ + { + "bbox": [ + 154, + 384, + 457, + 396 + ], + "spans": [ + { + "bbox": [ + 154, + 384, + 457, + 396 + ], + "type": "text", + "content": "Fig. 8: Predicting subnetworks' performance using Random Forest model." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 319, + 247, + 479, + 373 + ], + "blocks": [ + { + "bbox": [ + 319, + 247, + 479, + 373 + ], + "lines": [ + { + "bbox": [ + 319, + 247, + 479, + 373 + ], + "spans": [ + { + "bbox": [ + 319, + 247, + 479, + 373 + ], + "type": "image", + "image_path": "3a1cbf87d0bb80e5f98fb3fcc4f565b899cb9d5c1b88cf08d0934f0e99f539c6.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 421, + 482, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 421, + 482, + 470 + ], + "spans": [ + { + "bbox": [ + 130, + 421, + 482, + 470 + ], + "type": "text", + "content": "Takeaway ④: Proxies, while not entirely reliable on their own, can complement other architecture search methods to improve search efficiency or serve as training data for models predicting network performance to improve search accuracy." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 492, + 220, + 504 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 492, + 220, + 504 + ], + "spans": [ + { + "bbox": [ + 132, + 492, + 220, + 504 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "In this study, we introduced HyTAS: a benchmark for Hyperspectral Image Transformer Architecture Search. We defined a search space comprising 2000 Hyperspectral image transformers and evaluated 12 proxies across five HSI datasets. Our key observations are as follows: Most proxies can identify a transformer surpassing the human-crafted architecture, SpectralFormer, within 10 minutes. However, there's a significant performance gap between proxies and optimal results, driven by preferences for larger and more complex models, minimal dependence on input data, and disparities between MSA and MLP modules. Our proposed proxy, " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}^{++}" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": ", demonstrates superior performance compared to " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{ZiCo}" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " and other proxies. Furthermore, proxies can enhance the prediction of subnetworks' performance when used as input data. These findings encourage the TAS community to explore new methods for improving search quality and efficiency." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 481, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 481, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 481, + 187 + ], + "type": "text", + "content": "This work was funded by the Dutch Science Foundation (NWO) under grant 482.20.700. Furthermore, we deeply appreciate the invaluable and constructive feedback offered by our anonymous reviewers and the meta-reviewer. Their insights have greatly enriched our manuscript." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 205, + 197, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 205, + 197, + 217 + ], + "spans": [ + { + "bbox": [ + 133, + 205, + 197, + 217 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 228, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 228, + 480, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 251 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 251 + ], + "type": "text", + "content": "1. Abdelfattah, M.S., Mehrotra, A., Dudziak, L., Lane, N.D.: Zero-cost proxies for lightweight nas. arXiv preprint arXiv:2101.08134 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 251, + 480, + 273 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 480, + 273 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 480, + 273 + ], + "type": "text", + "content": "2. Baker, B., Gupta, O., Naik, N., Raskar, R.: Designing neural network architectures using reinforcement learning. arXiv preprint arXiv:1611.02167 (2016)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 274, + 480, + 305 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 274, + 480, + 305 + ], + "spans": [ + { + "bbox": [ + 138, + 274, + 480, + 305 + ], + "type": "text", + "content": "3. Cavagnero, N., Robbiano, L., Caputo, B., Averta, G.: Freerea: Training-free evolution-based architecture search. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1493-1502 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 306, + 480, + 338 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 306, + 480, + 338 + ], + "spans": [ + { + "bbox": [ + 138, + 306, + 480, + 338 + ], + "type": "text", + "content": "4. Chen, B., Li, P., Li, C., Li, B., Bai, L., Lin, C., Sun, M., Yan, J., Ouyang, W.: Glit: Neural architecture search for global and local image transformer. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12-21 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 339, + 480, + 371 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 339, + 480, + 371 + ], + "spans": [ + { + "bbox": [ + 138, + 339, + 480, + 371 + ], + "type": "text", + "content": "5. Chen, M., Peng, H., Fu, J., Ling, H.: Autoformer: Searching transformers for visual recognition. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 12270-12280 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 372, + 480, + 414 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 372, + 480, + 414 + ], + "spans": [ + { + "bbox": [ + 138, + 372, + 480, + 414 + ], + "type": "text", + "content": "6. Dale, L.M., Thewis, A., Boudry, C., Rotar, I., Dardenne, P., Baeten, V., Pierna, J.A.F.: Hyperspectral imaging applications in agriculture and agro-food product quality and safety control: A review. Applied Spectroscopy Reviews 48(2), 142-159 (2013)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 415, + 480, + 458 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 415, + 480, + 458 + ], + "spans": [ + { + "bbox": [ + 138, + 415, + 480, + 458 + ], + "type": "text", + "content": "7. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 459, + 480, + 502 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 459, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 138, + 459, + 480, + 502 + ], + "type": "text", + "content": "8. Furbank, R.T., Silva-Perez, V., Evans, J.R., Condon, A.G., Estavillo, G.M., He, W., Newman, S., Poiré, R., Hall, A., He, Z.: Wheat physiology predictor: predicting physiological traits in wheat from hyperspectral reflectance measurements using deep learning. Plant Methods 17, 1-15 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 502, + 480, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 480, + 523 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 480, + 523 + ], + "type": "text", + "content": "9. Goetz, A.F.: Three decades of hyperspectral remote sensing of the earth: A personal view. Remote sensing of environment 113, S5-S16 (2009)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 524, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 524, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 134, + 524, + 480, + 566 + ], + "type": "text", + "content": "10. Graña, M., Veganzons, M., Ayerdi, B.: Hyperspectral remote sensing scenes. Hyperspectral Remote Sensing Scenes - Grupo de Inteligencia Computacional (GIC) https://www.ehu.eus/ccwintco/index.php/Hyperspectral_Remote_Sensing_Scenes" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 567, + 480, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 567, + 480, + 589 + ], + "spans": [ + { + "bbox": [ + 134, + 567, + 480, + 589 + ], + "type": "text", + "content": "11. Ha, H., Kim, M., Hwang, S.J.: Generalizable lightweight proxy for robust nas against diverse perturbations. arXiv preprint arXiv:2306.05031 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 590, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 590, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 134, + 590, + 480, + 621 + ], + "type": "text", + "content": "12. Hong, D., Han, Z., Yao, J., Gao, L., Zhang, B., Plaza, A., Chanussot, J.: Spectralformer: Rethinking hyperspectral image classification with transformers. IEEE Transactions on Geoscience and Remote Sensing 60, 1-15 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 622, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 622, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 134, + 622, + 480, + 643 + ], + "type": "text", + "content": "13. Jakubczyk, K., Siemiatkowska, B., Wieckowski, R., Rapcewicz, J.: Hyperspectral imaging for mobile robot navigation. Sensors 23(1), 383 (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 644, + 480, + 665 + ], + "type": "text", + "content": "14. Lee, N., Ajanthan, T., Torr, P.H.: Snip: Single-shot network pruning based on connection sensitivity. arXiv preprint arXiv:1810.02340 (2018)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "15. Li, G., Hoang, D., Bhardwaj, K., Lin, M., Wang, Z., Marculescu, R.: Zero-shot neural architecture search: Challenges, solutions, and opportunities. arXiv preprint arXiv:2307.01998 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "type": "text", + "content": "16. Li, G., Yang, Y., Bhardwaj, K., Marculescu, R.: Zico: Zero-shot nas via inverse coefficient of variation on gradients. arXiv preprint arXiv:2301.11300 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "text", + "content": "17. Li, S., Song, W., Fang, L., Chen, Y., Ghamisi, P., Benediktsson, J.A.: Deep learning for hyperspectral image classification: An overview. IEEE Transactions on Geoscience and Remote Sensing 57(9), 6690-6709 (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 205, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 205, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 134, + 205, + 481, + 237 + ], + "type": "text", + "content": "18. Liu, C., Zoph, B., Neumann, M., Shlens, J., Hua, W., Li, L.J., Fei-Fei, L., Yuille, A., Huang, J., Murphy, K.: Progressive neural architecture search. In: Proceedings of the European conference on computer vision (ECCV). pp. 19-34 (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 237, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 237, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 133, + 237, + 481, + 270 + ], + "type": "text", + "content": "19. Lopes, V., Alirezazadeh, S., Alexandre, L.A.: Epe-nas: Efficient performance estimation without training for neural architecture search. In: International Conference on Artificial Neural Networks. pp. 552-563. Springer (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "type": "text", + "content": "20. Mellor, J., Turner, J., Storkey, A., Crowley, E.J.: Neural architecture search without training. In: International Conference on Machine Learning. pp. 7588-7598. PMLR (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "type": "text", + "content": "21. Nagasubramanian, K., Jones, S., Singh, A.K., Sarkar, S., Singh, A., Ganapathysubramanian, B.: Plant disease identification using explainable 3d deep learning on hyperspectral images. Plant methods 15, 1-10 (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "22. Pham, H., Guan, M., Zoph, B., Le, Q., Dean, J.: Efficient neural architecture search via parameters sharing. In: International conference on machine learning. pp. 4095-4104. PMLR (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "type": "text", + "content": "23. Su, X., You, S., Xie, J., Zheng, M., Wang, F., Qian, C., Zhang, C., Wang, X., Xu, C.: Vitas: Vision transformer architecture search. In: European Conference on Computer Vision. pp. 139-157. Springer (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 403, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 481, + 435 + ], + "type": "text", + "content": "24. Sun, L., Zhao, G., Zheng, Y., Wu, Z.: Spectral-spatial feature tokenization transformer for hyperspectral image classification. IEEE Transactions on Geoscience and Remote Sensing 60, 1-14 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "type": "text", + "content": "25. Tanaka, H., Kunin, D., Yamins, D.L., Ganguli, S.: Pruning neural networks without any data by iteratively conserving synaptic flow. Advances in neural information processing systems 33, 6377-6389 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "type": "text", + "content": "26. Theis, L., Korshunova, I., Tejani, A., Huszar, F.: Faster gaze prediction with dense networks and fisher pruning. arXiv preprint arXiv:1801.05787 (2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 490, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 490, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 490, + 481, + 522 + ], + "type": "text", + "content": "27. Transon, J., d'Andrimont, R., Maugnard, A., Defourny, P.: Survey of hyperspectral earth observation applications from space in the sentinel-2 context. Remote Sensing 10(2), 157 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 522, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 522, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 522, + 481, + 555 + ], + "type": "text", + "content": "28. Trierscheid, M., Pellenz, J., Paulus, D., Balthasar, D.: Hyperspectral imaging or victim detection with rescue robots. In: 2008 IEEE International Workshop on Safety, Security and Rescue Robotics. pp. 7-12. IEEE (2008)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 555, + 481, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 481, + 589 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 481, + 589 + ], + "type": "text", + "content": "29. Tsou, C.H., Lin, Y.C., Huang, Y.C., Li, W., Chen, J.C., Chen, C.S.: SEEKING THE SEARCH SPACE FOR SIZE-AWARE VISION TRANSFORMER ARCHITECTURE (2024), https://openreview.net/forum?id=iSdH16qEs2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "type": "text", + "content": "30. Turner, J., Crowley, E.J., O'Boyle, M., Storkey, A., Gray, G.: Blockswap: Fisher-guided block substitution for network compression on a budget. arXiv preprint arXiv:1906.04113 (2019)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 621, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 621, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 621, + 481, + 643 + ], + "type": "text", + "content": "31. Wang, C., Zhang, G., Grosse, R.: Picking winning tickets before training by preserving gradient flow. arXiv preprint arXiv:2002.07376 (2020)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "text", + "content": "32. Wang, D., Vinson, R., Holmes, M., Seibel, G., Bechar, A., Nof, S., Tao, Y.: Early detection of tomato spotted wilt virus by hyperspectral imaging and outlier removal" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "F.Zhou et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 369 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "type": "text", + "content": "auxiliary classifier generative adversarial nets (or-ac-gan). Scientific reports 9(1), 1-14 (2019)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "type": "text", + "content": "33. White, C., Safari, M., Sukthanker, R., Ru, B., Elsken, T., Zela, A., Dey, D., Hutter, F.: Neural architecture search: Insights from 1000 papers. arXiv preprint arXiv:2301.08727 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "type": "text", + "content": "34. Xiang, L., Dudziak, L., Abdelfattah, M.S., Chau, T., Lane, N.D., Wen, H.: Zero-cost operation scoring in differentiable architecture search. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 10453-10463 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "text", + "content": "35. Xiang, L., Hunter, R., Xu, M., Dudziak, L., Wen, H.: Exploiting network compressibility and topology in zero-cost nas. In: International Conference on Automated Machine Learning. pp. 18-1. PMLR (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 238, + 481, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 238, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 238, + 481, + 259 + ], + "type": "text", + "content": "36. Xie, C., Shao, Y., Li, X., He, Y.: Detection of early blight and late blight diseases on tomato leaves using hyperspectral imaging. Scientific reports 5(1), 1-11 (2015)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 260, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 260, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 260, + 481, + 293 + ], + "type": "text", + "content": "37. Xiong, Z., Minshan, C., Abhinav, S., Díaz, D.J.C.F.: 2013 IEEE GRSS Data Fusion Contest - Fusion of Hyperspectral and LiDAR Data (2013), https://hyperspectral.ee.uh.edu/?page_id=459" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 314 + ], + "type": "text", + "content": "38. Zhou, F., Killickaya, M., Vanschoren, J.: Locality-aware hyperspectral classification. arXiv preprint arXiv:2309.01561 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 315, + 481, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 347 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 347 + ], + "type": "text", + "content": "39. Zhou, Q., Sheng, K., Zheng, X., Li, K., Sun, X., Tian, Y., Chen, J., Ji, R.: Training-free transformer architecture search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10894-10903 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 348, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 348, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 348, + 481, + 369 + ], + "type": "text", + "content": "40. Zoph, B., Le, Q.V.: Neural architecture search with reinforcement learning. arXiv preprint arXiv:1611.01578 (2016)" + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyTAS: Hyperspectral Transformer Architecture Search" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_content_list.json b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..5a8b80307ec116bf98b353255bfa55bd42464922 --- /dev/null +++ b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_content_list.json @@ -0,0 +1,2084 @@ +[ + { + "type": "text", + "text": "Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation", + "text_level": 1, + "bbox": [ + 220, + 140, + 782, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Kihong Kim $^{1}$ , Haneol Lee $^{2}$ , Jihye Park $^{3}$ , Seyeon Kim $^{3}$ , Kwanghee Lee $^{1}$ , Seungryong Kim $^{†3}$ , and Jaejun Yoo $^{†2}$", + "bbox": [ + 269, + 210, + 733, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ VIVE STUDIOS $^{2}$ UNIST $^{3}$ Korea University $\\{\\mathrm{h} \\times \\mathrm{n} \\times \\mathrm{g} \\mathrm{i} \\mathrm{e} \\mathrm{e}, \\mathrm{l} \\times \\mathrm{k} \\times \\mathrm{w} \\mathrm{a} \\mathrm{g} \\mathrm{h} \\mathrm{e} \\mathrm{e}\\} @$ gmail.com $\\{\\mathrm{h} \\times \\mathrm{n} \\times \\mathrm{e} \\mathrm{t} \\mathrm{l} \\times \\mathrm{e}, \\mathrm{j} \\times \\mathrm{n} \\times \\mathrm{u} \\mathrm{e} \\mathrm{u} \\mathrm{r} \\mathrm{y} \\mathrm{o} \\mathrm{g}, \\mathrm{k} \\times \\mathrm{m} \\times \\mathrm{u} \\mathrm{n} \\mathrm{i} \\mathrm{s} \\mathrm{t}. \\mathrm{a} \\mathrm{c}. \\mathrm{k} \\mathrm{r}\\}$ {ghp1112, kimse2878, seungryong_kim}@korea.ac.kr https://hxngiee.github.io/HVDM", + "bbox": [ + 318, + 253, + 684, + 325 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Generating high-quality videos that synthesize desired realistic content is a challenging task due to their intricate high dimensionality and complexity. Several recent diffusion-based methods have shown comparable performance by compressing videos to a lower-dimensional latent space, using traditional video autoencoder architecture. However, such method that employ standard frame-wise 2D or 3D convolution fail to fully exploit the spatio-temporal nature of videos. To address this issue, we propose a novel hybrid video diffusion model, called HVDM, which can capture spatio-temporal dependencies more effectively. HVDM is trained by a hybrid video autoencoder which extracts a disentangled representation of the video including: (i) a global context information captured by a 2D projected latent, (ii) a local volume information captured by 3D convolutions with wavelet decomposition, and (iii) a frequency information for improving the video reconstruction. Based on this disentangled representation, our hybrid autoencoder provide a more comprehensive video latent enriching the generated videos with fine structures and details. Experiments on standard video generation benchmarks such as UCF101, SkyTimelapse, and TaiChi demonstrate that the proposed approach achieves state-of-the-art video generation quality, showing a wide range of video applications (e.g., long video generation, image-to-video, and video dynamics control). The source code and pre-trained models will be publicly available once the paper is accepted.", + "bbox": [ + 261, + 363, + 743, + 670 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Video Diffusion $\\cdot$ Wavelet Transform $\\cdot$ Generative Models", + "bbox": [ + 261, + 681, + 735, + 696 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 722, + 377, + 739 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Video generation has received a lot of attention in the computer vision and graphics fields due to its broad applications in making films, creating animations, simulating environments, etc [1,5,6,10,23]. Nonetheless, video generation remains a challenging task because of the high-dimensionality and complexity inherent", + "bbox": [ + 212, + 753, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "†Corresponding author", + "bbox": [ + 232, + 824, + 388, + 840 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "in video data. The primary difficulty lies in producing high-quality video frames that are both visually appealing and dynamically coherent.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "By leveraging the recent advancements of image-based diffusion models [14, 15], a variety of video diffusion methods have emerged [17,27,31]. These methods show considerable promise in modeling video distributions and synthesizing visually plausible results. However, they often face efficiency challenge due to operating in pixel space. To address this challenge, several recent latent video diffusion models have been developed, training within a compressed latent space to reduce computational demands [2,11,13,56,56]. While these latent diffusion models exhibit improved scaling properties with reduced complexity, the potential of novel autoencoder designs remains largely unexplored. There exist conventional approaches, employing standard 2D or 3D CNN-based autoencoders for video generation [13,17,19,35]. Yet, these CNN-based architectures struggle with effectively managing the overall spatio-temporal structure of videos. While transformers might be considered as a solution, their direct application to video representation learning can lead to significant computational time and memory inefficiency [21,49].", + "bbox": [ + 212, + 181, + 787, + 407 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Unlike the aforementioned approaches, PVDM [53] offers a novel perspective in video generation. PVDM simplifies video complexity by adopting a triplane representation, where video data is factorized into 2D projected latents across different spatio-temporal directions in a latent space. This method has demonstrated improved generation results over previous works such as StyleGAN-based approaches [36] and other diffusion models [17], particularly in effectively representing intricate video data. Despite its progress, they encounter inherent limitations due to the reduction of higher-dimensional video data into lower-dimensional spaces. More specifically, the 2D projected latents struggle to fully recover the 3D structure of video volume, lacking crucial volume information.", + "bbox": [ + 212, + 412, + 787, + 561 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Motivated by these observations, we propose a novel hybrid video diffusion model designed to comprehensively capture the spatio-temporal dependencies of video, called HVDM. Rather than reinventing the wheel, we leverage these known characteristics to enhance effectiveness in video generation tasks. Our video autoencoder combines transformer for 3D-to-2D projections and the 3D CNNs to effectively utilize both global context and local volume information in video. We first start from a well-known fact that transformers excel at capturing long-range dependencies, and we employ them to acquire the global context of the video. To compensate the limited inductive bias of transformers, we leverage 3D CNNs to provide local volume details, drawing from the recognized advantage of 3D CNNs in capturing short-range spatio-temporal information. More specifically, our proposed autoencoder builds the strengths of both architectures by incorporating global 2D projected and local 3D volume latent representations. These two types of latent representations mutually enhance each other through cross-attention module that operates along both the temporal and spatial axes. Taking this approach further, we pose the question of whether it is possible to exploit frequency information for boosting the video reconstruction process. We find that employing 3D discrete wavelet transform could potentially resolve the", + "bbox": [ + 212, + 568, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 339, + 127 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/4ed2b1ce79277c2706e4734aa5ae669ce33c3bee0b2af763f21b408037add878.jpg", + "image_caption": [ + "Fig. 1: Overview of our hybrid video autoencoder in HVDM that combines a 2D triplane and 3D volume representation for video encoding. The 2D triplane representation provides global context and 3D volume representation providing local volume information of video. The spatio-temporal cross-attention module incorporates these distinctive features to organize fine-grained video representation." + ], + "image_footnote": [], + "bbox": [ + 223, + 143, + 782, + 371 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "problem of limited receptive fields in 3D CNNs. Specifically, considering that the 3D discrete wavelet transform reduces the video's size by half in the frequency domain, it allows us to expand the receptive field without losing information. Additionally, using 3D discrete wavelet transform decompose complex video into different frequency components at multiple levels of details, providing rich video representation. Finally, by training the video autoencoder with both reconstruction and frequency matching loss in the pixel and spectral spaces, frequency matching loss improved visual quality during video reconstruction process. As a result, we observe that the integration of wavelet-based features provides benefit compared to the use of raw video data by enabling more nuanced video encoding.", + "bbox": [ + 212, + 468, + 787, + 619 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To validate the effectiveness of our method, we demonstrate a wide range of video applications including unconditional video generation, long video generation, image-to-video, and video dynamics control. Here, we use three benchmark datasets for video generation: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. Both quantitative and qualitative results demonstrate video generation capabilities of our method, showing superior performance over the state-of-the-art approaches.", + "bbox": [ + 212, + 619, + 787, + 726 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 748, + 388, + 763 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Video generation. Video generation methods have been developed based on deep generative models, such as variational autoencoder (VAEs), generative adversarial networks (GANs), and diffusion models (DMs). Early work [24, 28] attempted to employ VAEs and GANs-based models to generate frames in an", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 114, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "autoregressive manner. However, they fail to produce desired results due to the difficulty of modeling spatial-temporal changes and their results limited to low resolutions. Another work [45] introduce a spatio-temporal convolutional architecture that effectively disentangles the scene's foreground and background. MoCoGAN [40] propose the motion and content decomposed generative adversarial network that generates a video by translating a sequence of random vectors into a sequence of video frames. Although each of these methods show encouraging results for video generation, GAN-based models often suffer from unstable training and fall into mode collapse. In contrast, diffusion models have demonstrated new possibilities for video generation, leveraging a stable training scheme and robust representation.", + "bbox": [ + 212, + 146, + 787, + 313 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Diffusion models. Inspired by the success of image-based diffusion models, a series of video diffusion models [2, 11, 25, 30, 50, 56] are proposed. These models leverage the pre-trained image diffusion models and extend their application to videos. While they are capable of efficient learning with just a few computation powers, there are some difficulties in creating consistent and photo-realistic video content. Since they generate videos on a frame-by-frame basis, they face challenges in achieving temporal consistency and producing long video results.", + "bbox": [ + 212, + 321, + 787, + 428 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "On the other hand, recent videos diffusion models [16, 26, 31, 44] proposed methods for learning video from scratch by adopting various model architectures [9, 29]. While they are capable of generating high fidelity results that are both temporally consistent and realistic, these methods are still limited in computation and memory inefficiency. To overcome these inefficiency, latent diffusion methods [13, 19, 53] have emerged which train the model in low-dimensional latent space while maintaining their perceptual quality.", + "bbox": [ + 212, + 429, + 787, + 536 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Triplane representations. The effectiveness of triplane representation has already found in 3D-aware generation works [3,7,8,12,32,48]. These triplane representation methods have been shown to offer an effective compression benefits by projecting the 3D volume as 2D-shaped latent features. By taking advantage of these triplane representation, PVDM [53] achieves comparable results in the video generation task, encoding the cubic structure of video pixels. Inspired by this, we present an improved video encoding method that exploit the 2D projected latent with wavelet-based 3D volume latent.", + "bbox": [ + 212, + 544, + 787, + 667 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 688, + 382, + 704 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 2D Triplane Representation for Video Diffusion Model", + "text_level": 1, + "bbox": [ + 212, + 720, + 712, + 736 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Given a video sample $\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}$ with time $S$ , height $H$ , and width $W$ , the triplane autoencoder encodes it as three 2D projected latent $[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}}, \\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}}, \\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}]$ where $\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}} \\in \\mathbb{R}^{C \\times H' \\times W'}$ , $\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}} \\in \\mathbb{R}^{C \\times S \\times W'}$ , $\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}} \\in \\mathbb{R}^{C \\times S \\times H'}$ . We denote $C$ as number of channels, $H' = H / d$ , $W' = W / d$ for downsampling factors $d > 1$ . Unlike conventional video autoencoder which depends on frame-wise 2D or 3D convolution networks [13,17,19,35], the PVDM [53] effectively decompose", + "bbox": [ + 212, + 744, + 787, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 339, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "the 3D data using video transformer [4] for projections $\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]$ . The utilization of these latent vectors $\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]$ offers several advantages in terms of achieving both computation and memory efficiency. Furthermore, their image-like structure enables the efficient video generation from the latent space reducing the dimensionality of the data.", + "bbox": [ + 212, + 145, + 787, + 224 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 3D Wavelet Representation", + "text_level": 1, + "bbox": [ + 214, + 257, + 488, + 272 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3D Wavelet transform is a classical algorithm widely used in medical imaging and video compression to separate different frequency components within the data [33,46,47]. Just as the 2D wavelet transform, given $\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}$ , the 3D wavelet transform operates along $s$ , $h$ , and $w$ direction decomposing the 3D volume into different subbands. These subbands are factorized into low and high subbands where the low subband express the slowly changing part of the data and the high subband contain fine details capturing sharp edges and rapid transitions within the data.", + "bbox": [ + 212, + 292, + 787, + 412 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Specifically, it can be defined as discrete wavelet transform (DWT) and discrete inverse wavelet transform (IWT). In general, Haar wavelets is commonly employed in a variety of real-world applications due to their simplicity. Different types of filters, including low-pass and high-pass filters, divide the volume input $\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}$ into distinct frequency sub-bands $\\mathbf{x}_{\\mathrm{lll}}$ , $\\mathbf{x}_{\\mathrm{llh}}$ , $\\mathbf{x}_{\\mathrm{lhl}}$ , $\\mathbf{x}_{\\mathrm{hlh}}$ , $\\mathbf{x}_{\\mathrm{hhll}}$ , $\\mathbf{x}_{\\mathrm{hhh}}$ with a size of $S / 2 \\times H / 2 \\times W / 2$ . Where the low-frequency components provide the long-term av", + "bbox": [ + 212, + 415, + 488, + 625 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "erages information, while the high-frequency components provide information about local changes. In Fig. 2, we visualize a one level of 3D discrete wavelet decomposition.", + "bbox": [ + 212, + 626, + 787, + 672 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/a379e64dd8e197ec099013da664e3b3b2608f9bad9b54e5ec261781f1c527fe7.jpg", + "image_caption": [ + "Fig.2: Visualization of 3D wavelet transform. The volume of video is decomposed into eight subband $(\\mathbf{x}_{\\mathrm{lll}},\\dots ,\\mathbf{x}_{\\mathrm{hhh}})$ including low and high frequency components." + ], + "image_footnote": [], + "bbox": [ + 504, + 416, + 787, + 534 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 Methodology", + "text_level": 1, + "bbox": [ + 214, + 705, + 380, + 724 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our hybrid video autoencoder is illustrated in Fig. 1. We first describe the overall video encoding architecture in Sec 4.1. In the following, we present the training objective which enforce constraints in both pixel space and the wavelet space in Sec 4.2. Then, we formalize the diffusion-based video generation framework in Sec 4.3. Lastly, we introduce various video applications using video diffusion model in Sec 4.4.", + "bbox": [ + 212, + 748, + 787, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 114, + 730, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 Designing Hybrid Video Autoencoder", + "text_level": 1, + "bbox": [ + 215, + 146, + 573, + 162 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To train a video diffusion model generating high quality results, it is necessary to have an expressive video representation that accounts for inclusive information of video data. To satisfy this requirement, we construct hybrid representations by combining 2D triplane and 3D wavelet representation.", + "bbox": [ + 212, + 167, + 787, + 229 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "2D triplane representation. The 2D projected latent which is originated from PVDM [53] is extracted by 3D-to-2D projections mapping at each spatiotemporal direction to encode 3D video pixels. As shown in Sec 3.1, the 2D image-like latent $\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]$ can be encoded with a combination of a video encoder [4] and a small transformer [43]. Formally, the projected latent is formulated as follows:", + "bbox": [ + 212, + 234, + 787, + 325 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n[ u _ {\\mathrm {s h w}} ] := \\mathcal {T} _ {\\mathrm {v i d e o}} ^ {\\mathrm {s h w}} (\\mathbf {x}),\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 330, + 527, + 347 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {h w}} := \\mathcal {T} _ {\\text {p r o j}} ^ {\\mathrm {s}} \\left(u _ {1 \\mathrm {h w}}, \\dots , u _ {\\mathrm {S h w}}\\right),\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 351, + 785, + 378 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\text {p r o j} \\\\ \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {w s}} := \\mathcal {T} _ {\\text {p r o j}} ^ {\\mathrm {h}} \\left(u _ {\\mathrm {s l w}}, \\dots , u _ {\\mathrm {s H ^ {\\prime} w}}\\right), \\end{array} \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 364, + 784, + 391 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {h s}} := \\mathcal {T} _ {\\mathrm {p r o j}} ^ {\\mathrm {w}} \\left(u _ {\\mathrm {s h} 1}, \\dots , u _ {\\mathrm {s h W} ^ {\\prime}}\\right),\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 393, + 614, + 412 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathcal{T}_{\\mathrm{video}}^{\\mathrm{shw}}$ denotes a video-to-3D-latent encoder such as video transformer [4] and $\\mathcal{T}_{\\mathrm{proj}} = [\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{s}},\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{h}},\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{w}}]$ denotes a small transformer [43] for projections. While projected latent provide a global information of video with a computational efficiency, this transformer architecture projecting a triplane leads to lossy compression due to the lack of local volume information. Moreover, the weak inductive bias of the transformer leads to a slower convergence speed for the model. To overcome these limitations, we transformed the 2D projected latent into a 3D volume and complemented it with the 3D volume representation. Converting a 2D projected latent into a 3D volume $\\mathbf{z}_{\\mathrm{proj}}$ is formulated as follows:", + "bbox": [ + 212, + 419, + 787, + 556 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s} ^ {\\prime} \\mathrm {h w}} := [ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {1 \\mathrm {h w}}, \\dots , \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {S h w}} ],\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 564, + 570, + 584 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} := \\left[ \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s l w}}, \\dots , \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} \\right], \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 585, + 784, + 613 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h w} ^ {\\prime}} := \\left[ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h 1}}, \\dots , \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h W} ^ {\\prime}} \\right],\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 608, + 575, + 628 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {\\mathrm {p r o j}} := \\left[ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s} ^ {\\prime} \\mathrm {h w}} + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h w} ^ {\\prime}} \\right].\n$$\n", + "text_format": "latex", + "bbox": [ + 392, + 631, + 612, + 651 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3D wavelet representation. 3D CNN based volume encoder $\\mathcal{E}_{\\mathrm{low}}$ , $\\mathcal{E}_{\\mathrm{high}}$ extract local spatio-temporal features in videos. These volumetric local features are exploited with the 2D projected latent $\\mathbf{z}_{\\mathrm{proj}}$ to reorganize fine-grained features. Instead of utilizing the unprocessed RGB video frame directly in the volume encoder, we employ the decomposed wavelet features as input. These decomposed wavelet features extracted from the 3D wavelet transform $\\mathcal{W}$ provide coarse and detailed volume coefficient suited for video encoding. Extracting 3D wavelet latent can be formulated as follows:", + "bbox": [ + 212, + 662, + 787, + 782 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {F} _ {\\mathrm {l o w}} = \\mathcal {E} _ {\\mathrm {l o w}} (\\mathbf {x} _ {\\mathrm {l l l}}),\n$$\n", + "text_format": "latex", + "bbox": [ + 382, + 789, + 506, + 804 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {F} _ {\\text {h i g h}} = \\mathcal {E} _ {\\text {h i g h}} \\left(\\operatorname {C a t} \\left(\\mathbf {x} _ {\\text {l l h}}, \\dots , \\mathbf {x} _ {\\text {h h h}}\\right)\\right), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 808, + 784, + 824 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {\\mathrm {v o l}} = \\operatorname {C a t} \\left(\\mathcal {F} _ {\\mathrm {l o w}}, \\mathcal {F} _ {\\mathrm {h i g h}}\\right).\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 827, + 557, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 341, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{x}_{\\mathrm{III}}$ denotes decomposed low-pass subband and the others $\\mathbf{x}_{\\mathrm{IIh}},\\ldots ,X_{\\mathrm{hhh}}$ denotes high-pass subband. The low-pass subband and high-pass subband are encoded to provide the coarse content and fine motion information.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Fusing 2D triplane and 3D wavelet representations. As shown in Fig. 1, these 2D projected and 3D volume latent are integrated by cross-attention operation across the temporal and spatial axis. In this way, we can reinforce the volume-related inductive bias and rearrange fine-grained video latent for video generation. Formally, this cross-attention process can be formulated as follows:", + "bbox": [ + 212, + 196, + 784, + 272 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} ^ {i} = \\mathrm {C A} (\\mathbf {z} _ {\\mathrm {p r o j}} ^ {i}, \\mathbf {z} _ {\\mathrm {v o l}}) + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {i},\n$$\n", + "text_format": "latex", + "bbox": [ + 411, + 279, + 607, + 297 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathbf {z} ^ {i} = \\operatorname {F F N} \\left(\\mathbf {z} ^ {i}\\right) + \\mathbf {z} ^ {i}, \\\\ \\tilde {\\mathbf {\\Sigma}} ^ {i} = C \\Lambda (- i, - \\infty), + - i \\end{array} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 411, + 300, + 784, + 327 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {\\mathbf {z}} ^ {i} = \\operatorname {C A} \\left(\\mathbf {z} ^ {i}, \\mathbf {z} _ {\\text {v o l}}\\right) + \\mathbf {z} ^ {i}, \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 411, + 311, + 784, + 335 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} ^ {i + 1} = \\mathrm {F F N} (\\tilde {\\mathbf {z}} ^ {i}) + \\tilde {\\mathbf {z}} ^ {i},\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 340, + 545, + 357 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathrm{CA}(a,b)$ refers to Cross-Attention, with a representing the query and b representing the key and value. Additionally, FFN stands for FeedForward Network. Note that the input $\\mathbf{z}_{\\mathrm{proj}}^{0} = \\mathbf{z}_{\\mathrm{proj}}$ and the final output $\\mathbf{z}$ . Then, we reconstruct the video $\\tilde{\\mathbf{x}}$ with video decoder $\\mathcal{D}$ based on the refined hybrid features.", + "bbox": [ + 212, + 364, + 782, + 425 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {\\mathbf {x}} = \\mathcal {D} (\\mathbf {z}), \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 465, + 441, + 784, + 455 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathbf{z} \\in \\mathbb{R}^{C \\times S \\times H' \\times W'}$ .", + "bbox": [ + 214, + 455, + 395, + 473 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 Loss function", + "text_level": 1, + "bbox": [ + 214, + 492, + 372, + 505 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Our hybrid video autoencoder consists of three loss functions. In the following, we provide a brief overview and explain the training loss functions. Our training loss functions enable the preservation of frequency information during the video reconstruction process. Specifically, we enforce constraints both in the pixel space and the wavelet space.", + "bbox": [ + 212, + 513, + 782, + 588 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Reconstruction loss. The reconstruction loss $\\mathcal{L}_{rec}$ denotes the similarity between the original input video and output video reconstructed by a model. The reconstruction loss term enforces the model to learn meaningful features in the encoding phase so that it can accurately reconstruct the input data in the decoding phase. We employ mean absolute error for reconstruction:", + "bbox": [ + 212, + 594, + 782, + 669 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {r e c}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| \\mathbf {x} - \\tilde {\\mathbf {x}} \\| _ {1} \\right]. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 415, + 678, + 784, + 691 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "- Perceptual loss. The perceptual loss measures the difference between the feature map of input and a generated output in terms of perceptual similarity. Typically, this loss entails the extraction of feature maps from a pre-trained neural network. In contrast to reconstruction loss, which focuses solely on the pixel-level differences between videos, perceptual loss takes into account high level features such as textures and structures that humans perceive.", + "bbox": [ + 212, + 704, + 782, + 795 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {l p i p s}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| f (\\mathbf {x}) - f (\\tilde {\\mathbf {x}}) \\| _ {1} \\right]. \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 387, + 803, + 784, + 819 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $f$ denotes the perceptual feature extractor.", + "bbox": [ + 214, + 824, + 573, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 114, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Frequency matching loss. Conventional methods typically rely on pixel-level losses in the spatial-temporal space. Since these loss functions closely match the original videos in pixel domain, the generated video's quality may not be sufficient potentially failing to capture the frequency information. Our frequency matching loss is designed to facilitate the model can learn frequency features with less optimization difficulty. This loss not only helps the model to recover missing frequency components but also enhances the overall reconstruction quality. We define the frequency matching loss as a reconstruction term in the wavelet domain:", + "bbox": [ + 212, + 146, + 787, + 281 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {f r e q}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| \\mathcal {W} _ {\\mathbf {d}} (\\mathbf {x}) - \\mathcal {W} _ {\\mathbf {d}} (\\tilde {\\mathbf {x}}) \\| _ {1} \\right], \\mathbf {d} \\in \\{\\mathrm {s}, \\mathrm {h}, \\mathrm {w} \\}. \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 282, + 785, + 301 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathcal{W}_{\\mathbf{d}}$ denotes three-dimensional discrete wavelet transform and $\\mathbf{d}$ denotes the dimensions from which the wavelet transform is performed.", + "bbox": [ + 214, + 308, + 785, + 339 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Overall loss. Taking into account all the losses, the overall loss is formulated as follows:", + "bbox": [ + 214, + 349, + 785, + 380 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\lambda_ {\\text {r e c}} \\mathcal {L} _ {\\text {r e c}} + \\lambda_ {\\text {l p i p s}} \\mathcal {L} _ {\\text {l p i p s}} + \\lambda_ {\\text {f r e q}} \\mathcal {L} _ {\\text {f r e q}}, \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 364, + 398, + 785, + 415 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\lambda_{\\mathrm{rec}} = \\lambda_{\\mathrm{lpips}} = 1$ and $\\lambda_{\\mathrm{freq}} = 0.5$ in our experiments.", + "bbox": [ + 214, + 422, + 640, + 436 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Note that, unlike previous works [5, 53] that focus on improving the temporal dynamics of generated videos through the use of a 3D discriminator, our video autoencoder achieves temporal realism in the reconstructed videos without the need for adversarial training.", + "bbox": [ + 212, + 438, + 785, + 500 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 Diffusion Model-based Video Generator", + "text_level": 1, + "bbox": [ + 215, + 523, + 589, + 537 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Leveraging the hybrid latent extracted from the video autoencoder, we train a diffusion-based video generator which learn the latent distribution $p(\\mathbf{z})$ through the reverse process of the Markov Chain.", + "bbox": [ + 212, + 551, + 785, + 595 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our diffusion model consists of two processes: the forward process and the reverse process. In forward process, the model gradually transforms the latent $\\mathbf{z}_0\\sim p(\\mathbf{z}_0)$ toward a Gaussian distribution as formulated below:", + "bbox": [ + 214, + 597, + 785, + 643 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nq \\left(\\mathbf {z} _ {t} \\mid \\mathbf {z} _ {t - 1}\\right) = \\mathcal {N} \\left(\\mathbf {z} _ {t}; \\sqrt {1 - \\beta_ {t}} \\mathbf {z} _ {t - 1}, \\beta_ {t} \\mathbf {I}\\right), \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 367, + 656, + 785, + 681 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nq (\\mathbf {z} _ {t} | \\mathbf {z} _ {0}) = \\mathcal {N} (\\mathbf {z} _ {t}; \\sqrt {\\bar {\\alpha} _ {t}} \\mathbf {z} _ {0}, (1 - \\bar {\\alpha} _ {t}) \\mathbf {I}).\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 678, + 632, + 694 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\bar{\\alpha}_t = \\prod_{i=1}^t (1 - \\beta_i)$ and $\\beta$ represents a pre-defined schedule for the variance.", + "bbox": [ + 214, + 708, + 782, + 724 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In the reverse process, the model is trained to gradually denoise the latent via the parameterized Gaussian transition.", + "bbox": [ + 214, + 724, + 785, + 753 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\np _ {\\theta} \\left(\\mathbf {z} _ {t - 1} \\mid \\mathbf {z} _ {t}\\right) = \\mathcal {N} \\left(\\mathbf {z} _ {t - 1}; \\mu_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right), \\sigma_ {t} ^ {2} \\mathbf {I}\\right), \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 768, + 785, + 785 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mu_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right) = \\frac {1}{\\sqrt {\\alpha_ {t}}} \\left(\\mathbf {z} _ {t} - \\frac {\\beta_ {t}}{\\sqrt {1 - \\bar {\\alpha} _ {t}}} \\epsilon_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right)\\right), \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 349, + 810, + 785, + 844 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 341, + 127 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/538594eb6a4e3942577e9a675644f38665ef168d9c5ea3769adcba23355e9f05.jpg", + "image_caption": [ + "Fig. 3: Applications for diverse video generator by our proposed HVDM. Our HVDM is adaptable for diverse video generation tasks depending on the type of condition latent $z_{c}$ . During training process, the condition latent $z_{c}$ is extracted from the video and jointly trained with the noised hybrid video latent $z_{t}$ . During the sampling process, these condition latent are supported to enable various video generation tasks, such as long video generation, image-to-video, and video dynamics control." + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 787, + 282 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\epsilon_{\\theta}(\\cdot)$ is a trainable denoising diffusion model which recovers a noisy sample $\\mathbf{z}_t$ . The denoising diffusion model is trained to predict the noise with the following simplified objective:", + "bbox": [ + 212, + 407, + 784, + 452 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {s i m p l e}} (\\theta) := \\left\\| \\epsilon_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right) - \\epsilon \\right\\| _ {2} ^ {2}, \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 460, + 784, + 479 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\mathbf{z}_t = \\sqrt{\\bar{\\alpha}_t}\\mathbf{z}_0 + \\sqrt{1 - \\bar{\\alpha}_t}\\epsilon$ .", + "bbox": [ + 214, + 486, + 436, + 502 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To generate video samples from the latent space, we train a denoising diffusion model which follows the standard 3D U-Net architecture. The 3D U-Net architecture is composed of 3D convolution layers combined with skip connections. We employ a simplified 3D U-Net to denoise the latent $\\mathbf{z}$ for the purpose of verifying the effectiveness of our video autoencoder.", + "bbox": [ + 212, + 503, + 782, + 577 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.4 Applications for Diverse Video Generator", + "text_level": 1, + "bbox": [ + 214, + 598, + 604, + 614 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We demonstrate that our method can be extended to a variety of video applications such as long video generation, image-to-video, and video dynamics control.", + "bbox": [ + 212, + 621, + 782, + 664 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Long video generation. To facilitate long video generation, our work follows the traditional frame prediction approach [13, 44, 53] where previous frame conditions are combined with future frames. Given two consecutive video clips $[\\mathbf{x}^{\\mathrm{prev}},\\mathbf{x}^{\\mathrm{next}}]$ of $\\mathbf{x}^{\\mathrm{prev}},\\mathbf{x}^{\\mathrm{next}}\\in \\mathbb{R}^{3\\times S\\times H\\times W}$ , we can train the model to generate initial clips and future clips in a unified manner. More specifically, we can generate an initial clip with a null latent and extend the video by composing the condition with previous frame latent as follow:", + "bbox": [ + 212, + 672, + 787, + 779 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {c} ^ {\\text {l o n g}} = \\left\\{ \\begin{array}{l l} \\mathcal {E} (\\mathbf {x} ^ {\\text {p r e v}}), & \\text {i f f u t u r e c l i p ,} \\\\ 0, & \\text {o t h e r w i s e ,} \\end{array} \\right. \\tag {14}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 787, + 784, + 828 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\mathcal{E}$ denotes our pre-trained hybrid encoder.", + "bbox": [ + 214, + 834, + 563, + 851 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 114, + 730, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Image-to-video. Image-to-video generation aims to synthesize a coherent video starting from an image. In general, videos are composed of a series of consecutive images, where the first frame serves as a representative depiction of the overall content within the video. To facilitate the process of image-to-video generation without introducing an additional image encoder, we repeatedly stack the first frame of the video on the temporal axis. Then, we use the latent $\\mathcal{I}^{\\mathrm{content}}$ extracted from our video encoder as the content condition. By leveraging the latent $\\mathcal{I}^{\\mathrm{content}}$ which capture the common content, we can effectively guide the model to generate coherent video sequence as follow:", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {I} _ {\\text {i m c 2 v i d}} ^ {\\text {c o n t e n t}} = \\left[ \\mathbf {x} _ {0} ^ {1}, \\dots , \\mathbf {x} _ {0} ^ {1} \\right] \\in \\mathbb {R} ^ {3 \\times S \\times H \\times W}, \\tag {15}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 292, + 785, + 316 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {c} ^ {\\mathrm {i m g 2 v i d}} = \\mathcal {E} (\\mathcal {I} ^ {\\mathrm {c o n t e n t}}).\n$$\n", + "text_format": "latex", + "bbox": [ + 367, + 311, + 524, + 330 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Video dynamics control. Empowering users to control motion intensity in video creation provides flexibility with an improved user experience. Unfortunately, it was difficult to obtain motion-related labels from existing video collections for training diffusion models. To enable the alteration of motion intensity, we devise a method that learns motion dynamics with inter-frame variance. Specifically, we define the level of motion alteration as the structural dissimilarity between the semantic latent of the start and end frames. Since the structural dissimilarity encompasses both semantic and motion variance, we employ it as guiding cues to control motion without explicit motion labeled video. Formally, our structural dissimilarity is defined as follow:", + "bbox": [ + 212, + 348, + 787, + 500 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} _ {c} ^ {\\text {d y n a m i c s}} = \\left\\| \\mathbf {z} _ {0} ^ {\\mathrm {T}} - \\mathbf {z} _ {0} ^ {1} \\right\\| _ {1}. \\tag {16}\n$$\n", + "text_format": "latex", + "bbox": [ + 418, + 508, + 785, + 527 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Inspired by the classifier-free guidance techniques, we train a single diffusion model to jointly learn both the unconditional distribution $p(\\mathbf{x})$ and the conditional distribution $p(\\mathbf{x}^2|\\mathbf{x}^1)$ . In particular, we train the conditional distribution $p(\\mathbf{x}^2|\\mathbf{x}^1)$ with condition-specific information (e.g., previous frame or content or dynamics latent) and the unconditional distribution using a null condition (e.g., $\\mathbf{z}_c = 0$ ). The optimized objective can be formulated as follow:", + "bbox": [ + 212, + 536, + 787, + 628 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbb {E} _ {\\mathbf {x} _ {0}, \\epsilon , t} [ \\lambda | | \\epsilon - \\epsilon_ {\\theta} (\\mathbf {z} _ {t}, \\mathbf {z} _ {c}, t) | | _ {2} ^ {2} + (1 - \\lambda) | | \\epsilon - \\epsilon_ {\\theta} (\\mathbf {z} _ {t}, 0, t) | | _ {2} ^ {2} ], \\tag {17}\n$$\n", + "text_format": "latex", + "bbox": [ + 305, + 638, + 785, + 662 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "where $\\mathbf{z}_0 = \\mathcal{E}(\\mathbf{x}_0),\\mathbf{z}_t = \\sqrt{\\bar{\\alpha}_t}\\mathbf{z}_0 + \\sqrt{1 - \\bar{\\alpha}_t}\\epsilon$ and $\\lambda \\in (0,1)$ is a hyperparameter that guide a model to learn an unconditional and conditional distributions.", + "bbox": [ + 212, + 672, + 787, + 705 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 214, + 724, + 375, + 742 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.1 Training Details", + "text_level": 1, + "bbox": [ + 214, + 755, + 397, + 771 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Datasets. We conduct the experiments on three commonly-used benchmark datasets for the video generation task: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. UCF-101 [38] contains 13,320 videos from 101 action classes, offering a diverse range of human actions. SkyTimelapse [51] is composed of 5,000", + "bbox": [ + 212, + 779, + 787, + 842 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 339, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/aba882d14b34716773a87077e9802bc9d832681a4c2cc927c2106a30986a0ab2.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodUCF-101SkyTimelapseTaiChi
R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM
LVDM [13]----74.920.09131.210.778102.680.11227.630.729
PVDM [53]27.030.09527.030.74235.960.06132.710.82661.610.06826.870.715
HVDM (ours)5.350.03834.000.91520.760.04635.040.89121.510.02533.510.916
", + "bbox": [ + 218, + 143, + 787, + 213 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Table 1: Quantitative comparison of reconstruction results on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. Our video autoencoder shows significantly superior performance across various metrics, providing more fine-grained comparison.", + "bbox": [ + 212, + 218, + 784, + 272 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/791298341b1a253f041decfdb5e4f21f4911748e4037983901086bc9c72f4543.jpg", + "image_caption": [ + "Fig. 4: Qualitative reconstruction results on SkyTimelapse [51] dataset [34]. Our HVDM produces distinct and sharp edge details and faithfully expresses a fine structures in a video sequence. Additional samples are included in appendix." + ], + "image_footnote": [], + "bbox": [ + 232, + 287, + 769, + 491 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "videos containing dynamic sky scenes. TaiChi [34] consists of full human bodies performing Tai-Chi actions.", + "bbox": [ + 212, + 554, + 784, + 585 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Training. The video autoencoder component for 2D projected latent stem from the PVDM [53], but the other wavelet-based frequency component is added. We train our models on 4 NVIDIA A100 GPUs for each autoencoding and diffusion process. See Appendix A for the details.", + "bbox": [ + 212, + 590, + 784, + 650 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.2 Evaluation Details", + "text_level": 1, + "bbox": [ + 214, + 672, + 413, + 686 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Baseline models. We compare our HVDM with the following video generation models: VideoGPT [52], MoCoGAN [40], MoCoGAN-HD [39], DIGAN [54], StyleGAN-V [36], LVDM [13], and PVDM [53]. We utilize official model weights and conduct training using the official code when the model weights are not available.", + "bbox": [ + 212, + 696, + 784, + 772 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Quantitative evaluations. To evaluate reconstruction quality, we use R-FVD [42], LPIPS [55], PSNR [20], and SSIM [18]. Here, R-FVD denotes FVD between reconstructed videos and the ground-truth videos. As for the evaluation of generation quality, we measure FVD [42] and KVD [41]. Considering different clip", + "bbox": [ + 212, + 779, + 805, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 114, + 730, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/ea3738d91d1b8763ce56c4d8f923905727f5a7bb84a13fe5a29776fc75aa8dc9.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
VideoGPT MoCoGAN + StyleGAN2 MoCoGAN-HD DIGAN StyleGAN-V LVDM†
Train Split
UCF101 - FVD162880.62886.81821.41729.61630.21431.0N/A399.4303.1
UCF101 - FVD128N/A3679.02311.32606.52293.71773.4N/A505.0549.7
SkyTimelapse - FVD16222.7206.685.88164.183.1179.52318.963.542.8
SkyTimelapse - FVD128N/A575.9272.8878.1196.7197.0N/A134.7124.9
LVDM† PVDM† HVDM (Ours)LVDM† PVDM* HVDM (Ours)
Train SplitTrain+Test Split
UCF101 - KVD16N/A35.523.6TaiChi - FVD16120.9267.077.0
UCF101 - KVD128N/A37.734.4TaiChi - FVD128N/A339.2258.5
SkyTimelapse - KVD1621.733.11.5TaiChi - KVD1614.766.511.9
SkyTimelapse - KVD128N/A6.03.5TaiChi - KVD128N/A120.177.8
", + "bbox": [ + 218, + 143, + 785, + 273 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Table 2: Quantitative comparison of video generation models on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. We evaluate FVD and KVD metrics (the lower values are better) and the best score are marked as bold. The overall score of other baselines are referenced from StyleGAN-V [37]. Methods marked with $\\dagger$ denote the score is computed using official pretrained weights and $*$ denote the score is reproduced using official codes. We report evaluation details and sampling settings on Appendix B.", + "bbox": [ + 212, + 277, + 787, + 376 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/7569e1d2cbd9a0abb151e4862c768ac93050b488be8fdf7cc956764f72bc4e07.jpg", + "image_caption": [ + "Fig. 5: Generated video sample by our HVDM on UCF-101 [38], SkyTime-lapse [51], and TaiChi datasets [34]." + ], + "image_footnote": [], + "bbox": [ + 217, + 388, + 785, + 508 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "lengths, we denote $\\mathrm{FVD}_{16}$ and $\\mathrm{KVD}_{16}$ scores, as well as $\\mathrm{FVD}_{128}$ and $\\mathrm{KVD}_{128}$ scores for video clips with a length of 16 and 128. For a fair comparison, we follow the evaluation protocol of StyleGAN-V [37]; i.e., we use 2,048 real/fake video clips for evaluating FVD. See Appendix B for the details.", + "bbox": [ + 212, + 571, + 787, + 633 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.3 Comparison Results", + "text_level": 1, + "bbox": [ + 214, + 656, + 429, + 672 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Reconstruction results. Fig. 4 and Appendix F.1 show the performance of the reconstructed videos from our autoencoder and other diffusion-based video generative models. Our autoencoder presents a more accurate and clear reconstructed video compared to other baseline methods. In the Tab. 1, we demonstrate that our autoencoder achieves superior performance in all metrics for the three datasets.", + "bbox": [ + 212, + 681, + 787, + 772 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Generation results. We perform video generation on three datasets and compare the results with the other video generation methods. As shown in Fig. 5, our method is capable of generating not only monotonic motion videos such as Sky-Timelapse [51] and TaiChi [34] but also dynamic motion video UCF-101 [38],", + "bbox": [ + 212, + 779, + 787, + 842 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 339, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/b9c66a66ad3fc5930d0e7e8e01ede1b1bc6eb57d4a1f1b3fc97f946112b8f062.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
BackboneProj.Adv.z shape dimensionR-FVD ↓ LPIPS ↓ PSNR ↑SSIM ↑
Video Transformer [4]✓-4 × (32 × 32 + 16 × 32 + 16 × 32)180.210.092
Video Transformer [4]✓✓4 × (32 × 32 + 16 × 32 + 16 × 32)27.030.095
3D CNN [22]--4 × 16 × 32 × 3286.730.057
3D CNN [22]-✓4 × 16 × 32 × 3221.690.064
Ours✓-4 × 16 × 32 × 325.350.038
34.00
0.915
", + "bbox": [ + 230, + 143, + 767, + 227 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 3: Ablation study on various backbone architectures", + "bbox": [ + 274, + 229, + 725, + 244 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "which contain complex action categories. Note that synthesizing high quality videos on a complex dataset like UCF-101 [38] has been a challenging problem where existing video generation method often struggle with producing natural motions with good quality. As shown in Tab. 2, our method achieves superior performance in the benchmark datasets. See Appendix F for more samples.", + "bbox": [ + 212, + 258, + 787, + 335 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.4 Interpreting the frequency supervision", + "text_level": 1, + "bbox": [ + 215, + 354, + 580, + 369 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/6ddcc6f6df490d2ded008a1bf3202158ab458eb902dc735919383d74ec9ec14c.jpg", + "image_caption": [ + "Fig.6: Visualization of our hybrid representations." + ], + "image_footnote": [], + "bbox": [ + 240, + 380, + 486, + 593 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We perform visualization to understand how hybrid representation can help autoencoder to encode the 3D video pixels in Fig. 6. The decomposed 3D wavelet features is divided into low frequency and high frequency components, where each component conducts cross-attention operation with the 2D projected latent. As shown in Fig. 6, low frequency component captures static and dynamic regions and high frequency component captures the sharp edges and important details of video. To refine the ambiguity of the 2D project latent which contain global and abstract information, we incorporate these latent with", + "bbox": [ + 511, + 376, + 787, + 631 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "frequency components. As a result, our autoencoder figures out where the objects are located and how object's motion occurs in the video.", + "bbox": [ + 212, + 633, + 787, + 662 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.5 Ablation study on backbone architectures", + "text_level": 1, + "bbox": [ + 214, + 681, + 607, + 698 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We conduct verification of performance based on the autoencoder's backbone architecture on UCF-101 dataset. As shown in Tab. 3, our hybrid autoencoder demonstrates effectiveness in capturing both perceptual details and temporal coherence in the video. We can observe that 3D CNN-based autoencoder show better performance compared to the 2D triplane-based autoencoder since it has more latent dimensions. Although the 2D triplane-based autoencoder effectively compresses latent dimensions, enhancing temporal coherence necessitates adversarial training with a 3D discriminator. Our hybrid autoencoder integrates the strengths of both architectures, achieving superior performance.", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 114, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.6 Ablation study on fusing modules", + "text_level": 1, + "bbox": [ + 215, + 146, + 540, + 162 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We verify several experiments to assess how the fusing module affects the performance of our hybrid autoencoder on UCF-101 dataset. For feature fusion, we adopted two different modules: 1) the concatenation module 2) the cross-attention module. We also validated the effectiveness of wavelet decomposition by comparing the results which use raw RGB video as input. As shown in Tab. 4, the experimental results show that the cross-attention module and wavelet-decomposed components contribute to the improvement of reconstruction performance. We analyze that utilizing the temporal and spatial attention module facilitate the integration of different 2D triplane and 3D wavelet representation through the comparison of features at different spatial locations.", + "bbox": [ + 212, + 172, + 787, + 324 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/51295d082995495225609ab26d1c70e2a62d28ebf43b15f9e5ebad180c5999d8.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑
Baseline27.030.09527.030.742Baseline + RGB (Cross-attn.)6.320.03833.790.908
Baseline + RGB (Concat.)20.370.06331.020.831Baseline + Low Freq. (Cross-attn.)6.870.04033.690.909
Baseline + Low Freq. (Concat.)34.390.07830.500.816Baseline + High Freq. (Cross-attn.)6.970.04733.200.899
Baseline + High Freq. (Concat.)14.960.06131.320.838
Baseline + Low & High Freq. (Concat.)9.920.05132.690.871Ours5.350.03734.000.915
", + "bbox": [ + 217, + 335, + 789, + 393 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5.7 Ablation study on frequency matching loss", + "text_level": 1, + "bbox": [ + 215, + 436, + 614, + 454 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We validate the effectiveness of frequency matching loss (FML) on UCF-101 dataset in Tab. 5. The result shows that utilizing the FML term leads to a remarkable reduction in the FVD score by approximately 2.73 points demonstrating its effectiveness in enhancing the temporal coherency. Furthermore, evaluation metrics related to perceptual details also improved to 0.003 points for LPIPS, 0.33 points for PSNR, and 0.023 points for SSIM respectively. Based on these results, the FML verifies that aligning frequency components allow the HVDM to enhance temporal changes and perceptual quality of generated videos.", + "bbox": [ + 212, + 463, + 787, + 585 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/42493a8ca21c9c495eeec160f35814430a8bf4743f50b543c46a989eec5ade46.jpg", + "table_caption": [ + "Table 4: Ablation study on feature fusing module." + ], + "table_footnote": [], + "table_body": "
MethodR-FVD ↓LPIPS ↓PSNR ↑SSIM ↑
HVDM (w/o FML)8.080.04133.670.892
HVDM (w/ FML)5.350.03834.000.915
", + "bbox": [ + 357, + 604, + 643, + 647 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 5: Ablation study on frequency matching loss.", + "bbox": [ + 300, + 654, + 700, + 669 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 700, + 359, + 717 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We proposed a novel hybrid video autoencoder for video generation using diffusion model, dubbed HVDM. We investigated the effectiveness of our hybrid architecture that combines 2D projected and 3D volume representation, leveraging the strengths of frequency matching loss. By incorporating these representations with spatio-temporal cross-attention, HVDM generates high-quality videos with improved realism. Our extensive experiments on benchmark datasets demonstrated the superior performance, compared to the other baseline methods.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 339, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This research was supported by the National Supercomputing Center in Korea (KISTI) (TS-2023-RG-0004), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No.2022R1C1C1008496, RS-2024-00346597), Institute of Information & communications Technology Planning & Evaluation(IITP) grant funded by the Korea government(MSIT) (No.RS-2020-II201336, Artificial Intelligence graduate school support(UNIST), RS-2021-II212068, Comprehensive Video Understanding and Generation with Knowledge-based Deep Logic Neural Network), and Culture, Sports, and Tourism R&D Program through the Korea Creative Content Agency grant funded by the Ministry of Culture, Sports and Tourism (Research on neural watermark technology for copyright protection of generative AI 3D content, RS-2024-00348469, RS-2024-00333068).", + "bbox": [ + 212, + 178, + 787, + 359 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 386, + 321, + 402 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Ajay, A., Han, S., Du, Y., Li, S., Gupta, A., Jaakkola, T., Tenenbaum, J., Kaelbling, L., Srivastava, A., Agrawal, P.: Compositional foundation models for hierarchical planning. arXiv preprint arXiv:2309.08587 (2023)", + "2. An, J., Zhang, S., Yang, H., Gupta, S., Huang, J.B., Luo, J., Yin, X.: Latent-shift: Latent diffusion with temporal shift for efficient text-to-video generation. arXiv preprint arXiv:2304.08477 (2023)", + "3. Anciukevicius, T., Xu, Z., Fisher, M., Henderson, P., Bilen, H., Mitra, N.J., Guerrero, P.: Renderdiffusion: Image diffusion for 3d reconstruction, inpainting and generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12608-12618 (2023)", + "4. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021)", + "5. Blattmann, A., Rombach, R., Ling, H., Dockhorn, T., Kim, S.W., Fidler, S., Kreis, K.: Align your latents: High-resolution video synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22563-22575 (2023)", + "6. Ceylan, D., Huang, C.H.P., Mitra, N.J.: Pix2video: Video editing using image diffusion. arXiv preprint arXiv:2303.12688 (2023)", + "7. Chan, E.R., Lin, C.Z., Chan, M.A., Nagano, K., Pan, B., De Mello, S., Gallo, O., Guibas, L.J., Tremblay, J., Khamis, S., et al.: Efficient geometry-aware 3d generative adversarial networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16123-16133 (2022)", + "8. Chan, E.R., Monteiro, M., Kellnhofer, P., Wu, J., Wetzstein, G.: Pi-GAN: Periodic implicit generative adversarial networks for 3D-aware image synthesis. In: CVPR (2021)", + "9. Çiçek, Ö., Abdulkadir, A., Lienkamp, S.S., Brox, T., Ronneberger, O.: 3d u-net: learning dense volumetric segmentation from sparse annotation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2016: 19th International Conference, Athens, Greece, October 17-21, 2016, Proceedings, Part II 19. pp. 424-432. Springer (2016)" + ], + "bbox": [ + 225, + 419, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 113, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "10. Dai, Y., Yang, M., Dai, B., Dai, H., Nachum, O., Tenenbaum, J., Schuurmans, D., Abbeel, P.: Learning universal policies via text-guided video generation. arXiv preprint arXiv:2302.00111 (2023)", + "11. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. arXiv preprint arXiv:2302.03011 (2023)", + "12. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. In: International Conference on Machine Learning. pp. 11808-11826. PMLR (2023)", + "13. He, Y., Yang, T., Zhang, Y., Shan, Y., Chen, Q.: Latent video diffusion models for high-fidelity video generation with arbitrary lengths. arXiv preprint arXiv:2211.13221 (2022)", + "14. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., Salimans, T.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022)", + "15. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems (2020)", + "16. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models, 2022. URL https://arxiv.org/abs/2204.03458", + "17. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models. arXiv preprint arXiv:2204.03458 (2022)", + "18. Hore, A., Ziou, D.: Image quality metrics: Psnr vs. sSIM. In: 2010 20th international conference on pattern recognition. pp. 2366-2369. IEEE (2010)", + "19. Hu, Y., Chen, Z., Luo, C.: Lamd: Latent motion diffusion for video generation. arXiv preprint arXiv:2304.11603 (2023)", + "20. Huynh-Thu, Q., Ghanbari, M.: Scope of validity of psnr in image/video quality assessment. Electronics letters 44(13), 800-801 (2008)", + "21. Kalchbrenner, N., Oord, A., Simonyan, K., Danihelka, I., Vinyals, O., Graves, A., Kavukcuoglu, K.: Video pixel networks. In: ICML (2017)", + "22. Karpathy, A., Toderici, G., Shetty, S., Leung, T., Sukthankar, R., Fei-Fei, L.: Large-scale video classification with convolutional neural networks. In: CVPR (2014)", + "23. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023)", + "24. Li, Y., Min, M., Shen, D., Carlson, D., Carin, L.: Video generation from text. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018)", + "25. Liu, S., Zhang, Y., Li, W., Lin, Z., Jia, J.: Video-p2p: Video editing with cross-attention control. arXiv preprint arXiv:2303.04761 (2023)", + "26. Ma, X., Wang, Y., Jia, G., Chen, X., Liu, Z., Li, Y.F., Chen, C., Qiao, Y.: Latte: Latent diffusion transformer for video generation. arXiv preprint arXiv:2401.03048 (2024)", + "27. Mei, K., Patel, V.M.: Vidm: Video implicit diffusion models. In: AAAI (2023)", + "28. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: Proceedings of the 25th ACM international conference on Multimedia. pp. 1789-1798 (2017)", + "29. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023)" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 339, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "30. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023)", + "31. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10219-10228 (2023)", + "32. Schwarz, K., Liao, Y., Niemeyer, M., Geiger, A.: Graf: Generative radiance fields for 3d-aware image synthesis. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)", + "33. Secker, A., Taubman, D.: Highly scalable video compression using a lifting-based 3d wavelet transform with deformable mesh motion compensation. In: Proceedings. International Conference on Image Processing. vol. 3, pp. 749-752. IEEE (2002)", + "34. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: First order motion model for image animation. In: NeurIPS (2019)", + "35. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. In: ICLR (2023)", + "36. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: StyleGAN-V: A continuous video generator with the price, image quality and perks of StyleGAN2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022)", + "37. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: Stylegan-v: A continuous video generator with the price, image quality and perks of stylegan2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3626-3636 (2022)", + "38. Soomro, K., Zamir, A.R., Shah, M.: UCF101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012)", + "39. Tian, Y., Ren, J., Chai, M., Olszewski, K., Peng, X., Metaxas, D.N., Tulyakov, S.: A good image generator is what you need for high-resolution video synthesis. In: ICLR (2021)", + "40. Tulyakov, S., Liu, M.Y., Yang, X., Kautz, J.: MoCoGAN: Decomposing motion and content for video generation. In: CVPR (2018)", + "41. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018)", + "42. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Fvd: A new metric for video generation. In: DGS@ICLR (2019), https://apisemantic scholar.org/CorpusID:198489709", + "43. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017)", + "44. Voleti, V., Jolicoeur-Martineau, A., Pal, C.: Mcvd-masked conditional video diffusion for prediction, generation, and interpolation. Advances in Neural Information Processing Systems 35, 23371-23385 (2022)", + "45. Vondrick, C., Pirsiavash, H., Torralba, A.: Generating videos with scene dynamics. In: NeurIPS (2016)", + "46. Wang, B., Wang, Y., Selesnick, I., Vetro, A.: Video coding using 3d dual-tree wavelet transform. EURASIP Journal on Image and Video Processing 2007, 1-15 (2007)", + "47. Wang, J., Huang, K.: Medical image compression by using three-dimensional wavelet transformation. IEEE Transactions on Medical Imaging 15(4), 547-554 (1996)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "HVDM", + "bbox": [ + 679, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "48. Wang, T., Zhang, B., Zhang, T., Gu, S., Bao, J., Baltrusaitis, T., Shen, J., Chen, D., Wen, F., Chen, Q., et al.: Rodin: A generative model for sculpting 3d digital avatars using diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4563-4573 (2023)", + "49. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019)", + "50. Wu, J.Z., Ge, Y., Wang, X., Lei, W., Gu, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. arXiv preprint arXiv:2212.11565 (2022)", + "51. Xiong, W., Luo, W., Ma, L., Liu, W., Luo, J.: Learning to generate time-lapse videos using multi-stage dynamic generative adversarial networks. In: CVPR (2018)", + "52. Yan, W., Zhang, Y., Abbeel, P., Srinivas, A.: VideoGPT: Video generation using VQ-VAE and transformers. arXiv preprint arXiv:2104.10157 (2021)", + "53. Yu, S., Sohn, K., Kim, S., Shin, J.: Video probabilistic diffusion models in projected latent space. arXiv preprint arXiv:2302.07685 (2023)", + "54. Yu, S., Tack, J., Mo, S., Kim, H., Kim, J., Ha, J.W., Shin, J.: Generating videos with dynamics-aware implicit generative adversarial networks. In: The Tenth International Conference on Learning Representations (2022)", + "55. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018)", + "56. Zhou, D., Wang, W., Yan, H., Lv, W., Zhu, Y., Feng, J.: Magicvideo: Efficient video generation with latent diffusion models. arXiv preprint arXiv:2211.11018 (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 465 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Kim et al.", + "bbox": [ + 271, + 114, + 339, + 127 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_model.json b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_model.json new file mode 100644 index 0000000000000000000000000000000000000000..a31653ae0a90246630a84c402e3d04c72590754d --- /dev/null +++ b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_model.json @@ -0,0 +1,2656 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.222, + 0.141, + 0.783, + 0.187 + ], + "angle": 0, + "content": "Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation" + }, + { + "type": "text", + "bbox": [ + 0.27, + 0.212, + 0.734, + 0.245 + ], + "angle": 0, + "content": "Kihong Kim \\(^{1}\\), Haneol Lee \\(^{2}\\), Jihye Park \\(^{3}\\), Seyeon Kim \\(^{3}\\), Kwanghee Lee \\(^{1}\\), Seungryong Kim \\(^{†3}\\), and Jaejun Yoo \\(^{†2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.32, + 0.254, + 0.686, + 0.327 + ], + "angle": 0, + "content": "\\(^{1}\\)VIVE STUDIOS \\(^{2}\\)UNIST \\(^{3}\\)Korea University \\(\\{\\mathrm{h} \\times \\mathrm{n} \\times \\mathrm{g} \\mathrm{i} \\mathrm{e} \\mathrm{e}, \\mathrm{l} \\times \\mathrm{k} \\times \\mathrm{w} \\mathrm{a} \\mathrm{g} \\mathrm{h} \\mathrm{e} \\mathrm{e}\\} @\\)gmail.com \\(\\{\\mathrm{h} \\times \\mathrm{n} \\times \\mathrm{e} \\mathrm{t} \\mathrm{l} \\times \\mathrm{e}, \\mathrm{j} \\times \\mathrm{n} \\times \\mathrm{u} \\mathrm{e} \\mathrm{u} \\mathrm{r} \\mathrm{y} \\mathrm{o} \\mathrm{g}, \\mathrm{k} \\times \\mathrm{m} \\times \\mathrm{u} \\mathrm{n} \\mathrm{i} \\mathrm{s} \\mathrm{t}. \\mathrm{a} \\mathrm{c}. \\mathrm{k} \\mathrm{r}\\}\\) {ghp1112, kimse2878, seungryong_kim}@korea.ac.kr https://hxngiee.github.io/HVDM" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.364, + 0.744, + 0.671 + ], + "angle": 0, + "content": "Abstract. Generating high-quality videos that synthesize desired realistic content is a challenging task due to their intricate high dimensionality and complexity. Several recent diffusion-based methods have shown comparable performance by compressing videos to a lower-dimensional latent space, using traditional video autoencoder architecture. However, such method that employ standard frame-wise 2D or 3D convolution fail to fully exploit the spatio-temporal nature of videos. To address this issue, we propose a novel hybrid video diffusion model, called HVDM, which can capture spatio-temporal dependencies more effectively. HVDM is trained by a hybrid video autoencoder which extracts a disentangled representation of the video including: (i) a global context information captured by a 2D projected latent, (ii) a local volume information captured by 3D convolutions with wavelet decomposition, and (iii) a frequency information for improving the video reconstruction. Based on this disentangled representation, our hybrid autoencoder provide a more comprehensive video latent enriching the generated videos with fine structures and details. Experiments on standard video generation benchmarks such as UCF101, SkyTimelapse, and TaiChi demonstrate that the proposed approach achieves state-of-the-art video generation quality, showing a wide range of video applications (e.g., long video generation, image-to-video, and video dynamics control). The source code and pre-trained models will be publicly available once the paper is accepted." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.682, + 0.736, + 0.697 + ], + "angle": 0, + "content": "Keywords: Video Diffusion \\(\\cdot\\) Wavelet Transform \\(\\cdot\\) Generative Models" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.723, + 0.378, + 0.74 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Video generation has received a lot of attention in the computer vision and graphics fields due to its broad applications in making films, creating animations, simulating environments, etc [1,5,6,10,23]. Nonetheless, video generation remains a challenging task because of the high-dimensionality and complexity inherent" + }, + { + "type": "page_footnote", + "bbox": [ + 0.233, + 0.825, + 0.39, + 0.841 + ], + "angle": 0, + "content": "†Corresponding author" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.341, + 0.128 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "in video data. The primary difficulty lies in producing high-quality video frames that are both visually appealing and dynamically coherent." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.182, + 0.788, + 0.409 + ], + "angle": 0, + "content": "By leveraging the recent advancements of image-based diffusion models [14, 15], a variety of video diffusion methods have emerged [17,27,31]. These methods show considerable promise in modeling video distributions and synthesizing visually plausible results. However, they often face efficiency challenge due to operating in pixel space. To address this challenge, several recent latent video diffusion models have been developed, training within a compressed latent space to reduce computational demands [2,11,13,56,56]. While these latent diffusion models exhibit improved scaling properties with reduced complexity, the potential of novel autoencoder designs remains largely unexplored. There exist conventional approaches, employing standard 2D or 3D CNN-based autoencoders for video generation [13,17,19,35]. Yet, these CNN-based architectures struggle with effectively managing the overall spatio-temporal structure of videos. While transformers might be considered as a solution, their direct application to video representation learning can lead to significant computational time and memory inefficiency [21,49]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.413, + 0.788, + 0.563 + ], + "angle": 0, + "content": "Unlike the aforementioned approaches, PVDM [53] offers a novel perspective in video generation. PVDM simplifies video complexity by adopting a triplane representation, where video data is factorized into 2D projected latents across different spatio-temporal directions in a latent space. This method has demonstrated improved generation results over previous works such as StyleGAN-based approaches [36] and other diffusion models [17], particularly in effectively representing intricate video data. Despite its progress, they encounter inherent limitations due to the reduction of higher-dimensional video data into lower-dimensional spaces. More specifically, the 2D projected latents struggle to fully recover the 3D structure of video volume, lacking crucial volume information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Motivated by these observations, we propose a novel hybrid video diffusion model designed to comprehensively capture the spatio-temporal dependencies of video, called HVDM. Rather than reinventing the wheel, we leverage these known characteristics to enhance effectiveness in video generation tasks. Our video autoencoder combines transformer for 3D-to-2D projections and the 3D CNNs to effectively utilize both global context and local volume information in video. We first start from a well-known fact that transformers excel at capturing long-range dependencies, and we employ them to acquire the global context of the video. To compensate the limited inductive bias of transformers, we leverage 3D CNNs to provide local volume details, drawing from the recognized advantage of 3D CNNs in capturing short-range spatio-temporal information. More specifically, our proposed autoencoder builds the strengths of both architectures by incorporating global 2D projected and local 3D volume latent representations. These two types of latent representations mutually enhance each other through cross-attention module that operates along both the temporal and spatial axes. Taking this approach further, we pose the question of whether it is possible to exploit frequency information for boosting the video reconstruction process. We find that employing 3D discrete wavelet transform could potentially resolve the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.681, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.144, + 0.784, + 0.372 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.381, + 0.788, + 0.452 + ], + "angle": 0, + "content": "Fig. 1: Overview of our hybrid video autoencoder in HVDM that combines a 2D triplane and 3D volume representation for video encoding. The 2D triplane representation provides global context and 3D volume representation providing local volume information of video. The spatio-temporal cross-attention module incorporates these distinctive features to organize fine-grained video representation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.469, + 0.788, + 0.621 + ], + "angle": 0, + "content": "problem of limited receptive fields in 3D CNNs. Specifically, considering that the 3D discrete wavelet transform reduces the video's size by half in the frequency domain, it allows us to expand the receptive field without losing information. Additionally, using 3D discrete wavelet transform decompose complex video into different frequency components at multiple levels of details, providing rich video representation. Finally, by training the video autoencoder with both reconstruction and frequency matching loss in the pixel and spectral spaces, frequency matching loss improved visual quality during video reconstruction process. As a result, we observe that the integration of wavelet-based features provides benefit compared to the use of raw video data by enabling more nuanced video encoding." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.62, + 0.788, + 0.727 + ], + "angle": 0, + "content": "To validate the effectiveness of our method, we demonstrate a wide range of video applications including unconditional video generation, long video generation, image-to-video, and video dynamics control. Here, we use three benchmark datasets for video generation: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. Both quantitative and qualitative results demonstrate video generation capabilities of our method, showing superior performance over the state-of-the-art approaches." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.749, + 0.39, + 0.765 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Video generation. Video generation methods have been developed based on deep generative models, such as variational autoencoder (VAEs), generative adversarial networks (GANs), and diffusion models (DMs). Early work [24, 28] attempted to employ VAEs and GANs-based models to generate frames in an" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.341, + 0.128 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.314 + ], + "angle": 0, + "content": "autoregressive manner. However, they fail to produce desired results due to the difficulty of modeling spatial-temporal changes and their results limited to low resolutions. Another work [45] introduce a spatio-temporal convolutional architecture that effectively disentangles the scene's foreground and background. MoCoGAN [40] propose the motion and content decomposed generative adversarial network that generates a video by translating a sequence of random vectors into a sequence of video frames. Although each of these methods show encouraging results for video generation, GAN-based models often suffer from unstable training and fall into mode collapse. In contrast, diffusion models have demonstrated new possibilities for video generation, leveraging a stable training scheme and robust representation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.323, + 0.788, + 0.429 + ], + "angle": 0, + "content": "Diffusion models. Inspired by the success of image-based diffusion models, a series of video diffusion models [2, 11, 25, 30, 50, 56] are proposed. These models leverage the pre-trained image diffusion models and extend their application to videos. While they are capable of efficient learning with just a few computation powers, there are some difficulties in creating consistent and photo-realistic video content. Since they generate videos on a frame-by-frame basis, they face challenges in achieving temporal consistency and producing long video results." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.43, + 0.788, + 0.537 + ], + "angle": 0, + "content": "On the other hand, recent videos diffusion models [16, 26, 31, 44] proposed methods for learning video from scratch by adopting various model architectures [9, 29]. While they are capable of generating high fidelity results that are both temporally consistent and realistic, these methods are still limited in computation and memory inefficiency. To overcome these inefficiency, latent diffusion methods [13, 19, 53] have emerged which train the model in low-dimensional latent space while maintaining their perceptual quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.545, + 0.788, + 0.668 + ], + "angle": 0, + "content": "Triplane representations. The effectiveness of triplane representation has already found in 3D-aware generation works [3,7,8,12,32,48]. These triplane representation methods have been shown to offer an effective compression benefits by projecting the 3D volume as 2D-shaped latent features. By taking advantage of these triplane representation, PVDM [53] achieves comparable results in the video generation task, encoding the cubic structure of video pixels. Inspired by this, we present an improved video encoding method that exploit the 2D projected latent with wavelet-based 3D volume latent." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.689, + 0.383, + 0.705 + ], + "angle": 0, + "content": "3 Preliminaries" + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.721, + 0.714, + 0.737 + ], + "angle": 0, + "content": "3.1 2D Triplane Representation for Video Diffusion Model" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.746, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Given a video sample \\(\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}\\) with time \\(S\\), height \\(H\\), and width \\(W\\), the triplane autoencoder encodes it as three 2D projected latent \\([\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}}, \\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}}, \\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}]\\) where \\(\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}} \\in \\mathbb{R}^{C \\times H' \\times W'}\\), \\(\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}} \\in \\mathbb{R}^{C \\times S \\times W'}\\), \\(\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}} \\in \\mathbb{R}^{C \\times S \\times H'}\\). We denote \\(C\\) as number of channels, \\(H' = H / d\\), \\(W' = W / d\\) for downsampling factors \\(d > 1\\). Unlike conventional video autoencoder which depends on frame-wise 2D or 3D convolution networks [13,17,19,35], the PVDM [53] effectively decompose" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.68, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.225 + ], + "angle": 0, + "content": "the 3D data using video transformer [4] for projections \\(\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]\\). The utilization of these latent vectors \\(\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]\\) offers several advantages in terms of achieving both computation and memory efficiency. Furthermore, their image-like structure enables the efficient video generation from the latent space reducing the dimensionality of the data." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.258, + 0.489, + 0.273 + ], + "angle": 0, + "content": "3.2 3D Wavelet Representation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.294, + 0.789, + 0.413 + ], + "angle": 0, + "content": "3D Wavelet transform is a classical algorithm widely used in medical imaging and video compression to separate different frequency components within the data [33,46,47]. Just as the 2D wavelet transform, given \\(\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}\\), the 3D wavelet transform operates along \\(s\\), \\(h\\), and \\(w\\) direction decomposing the 3D volume into different subbands. These subbands are factorized into low and high subbands where the low subband express the slowly changing part of the data and the high subband contain fine details capturing sharp edges and rapid transitions within the data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.416, + 0.489, + 0.626 + ], + "angle": 0, + "content": "Specifically, it can be defined as discrete wavelet transform (DWT) and discrete inverse wavelet transform (IWT). In general, Haar wavelets is commonly employed in a variety of real-world applications due to their simplicity. Different types of filters, including low-pass and high-pass filters, divide the volume input \\(\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}\\) into distinct frequency sub-bands \\(\\mathbf{x}_{\\mathrm{lll}}\\), \\(\\mathbf{x}_{\\mathrm{llh}}\\), \\(\\mathbf{x}_{\\mathrm{lhl}}\\), \\(\\mathbf{x}_{\\mathrm{hlh}}\\), \\(\\mathbf{x}_{\\mathrm{hhll}}\\), \\(\\mathbf{x}_{\\mathrm{hhh}}\\) with a size of \\(S / 2 \\times H / 2 \\times W / 2\\). Where the low-frequency components provide the long-term av" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.627, + 0.788, + 0.673 + ], + "angle": 0, + "content": "erages information, while the high-frequency components provide information about local changes. In Fig. 2, we visualize a one level of 3D discrete wavelet decomposition." + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.417, + 0.789, + 0.535 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.546, + 0.788, + 0.614 + ], + "angle": 0, + "content": "Fig.2: Visualization of 3D wavelet transform. The volume of video is decomposed into eight subband \\((\\mathbf{x}_{\\mathrm{lll}},\\dots ,\\mathbf{x}_{\\mathrm{hhh}})\\) including low and high frequency components." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.707, + 0.381, + 0.725 + ], + "angle": 0, + "content": "4 Methodology" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Our hybrid video autoencoder is illustrated in Fig. 1. We first describe the overall video encoding architecture in Sec 4.1. In the following, we present the training objective which enforce constraints in both pixel space and the wavelet space in Sec 4.2. Then, we formalize the diffusion-based video generation framework in Sec 4.3. Lastly, we introduce various video applications using video diffusion model in Sec 4.4." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.342, + 0.128 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.574, + 0.163 + ], + "angle": 0, + "content": "4.1 Designing Hybrid Video Autoencoder" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.169, + 0.788, + 0.23 + ], + "angle": 0, + "content": "To train a video diffusion model generating high quality results, it is necessary to have an expressive video representation that accounts for inclusive information of video data. To satisfy this requirement, we construct hybrid representations by combining 2D triplane and 3D wavelet representation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.236, + 0.788, + 0.326 + ], + "angle": 0, + "content": "2D triplane representation. The 2D projected latent which is originated from PVDM [53] is extracted by 3D-to-2D projections mapping at each spatiotemporal direction to encode 3D video pixels. As shown in Sec 3.1, the 2D image-like latent \\(\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]\\) can be encoded with a combination of a video encoder [4] and a small transformer [43]. Formally, the projected latent is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.389, + 0.332, + 0.528, + 0.348 + ], + "angle": 0, + "content": "\\[\n[ u _ {\\mathrm {s h w}} ] := \\mathcal {T} _ {\\mathrm {v i d e o}} ^ {\\mathrm {s h w}} (\\mathbf {x}),\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.352, + 0.786, + 0.379 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {h w}} := \\mathcal {T} _ {\\text {p r o j}} ^ {\\mathrm {s}} \\left(u _ {1 \\mathrm {h w}}, \\dots , u _ {\\mathrm {S h w}}\\right),\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.365, + 0.785, + 0.392 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\text {p r o j} \\\\ \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {w s}} := \\mathcal {T} _ {\\text {p r o j}} ^ {\\mathrm {h}} \\left(u _ {\\mathrm {s l w}}, \\dots , u _ {\\mathrm {s H ^ {\\prime} w}}\\right), \\end{array} \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.395, + 0.615, + 0.413 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {h s}} := \\mathcal {T} _ {\\mathrm {p r o j}} ^ {\\mathrm {w}} \\left(u _ {\\mathrm {s h} 1}, \\dots , u _ {\\mathrm {s h W} ^ {\\prime}}\\right),\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.42, + 0.789, + 0.557 + ], + "angle": 0, + "content": "where \\(\\mathcal{T}_{\\mathrm{video}}^{\\mathrm{shw}}\\) denotes a video-to-3D-latent encoder such as video transformer [4] and \\(\\mathcal{T}_{\\mathrm{proj}} = [\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{s}},\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{h}},\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{w}}]\\) denotes a small transformer [43] for projections. While projected latent provide a global information of video with a computational efficiency, this transformer architecture projecting a triplane leads to lossy compression due to the lack of local volume information. Moreover, the weak inductive bias of the transformer leads to a slower convergence speed for the model. To overcome these limitations, we transformed the 2D projected latent into a 3D volume and complemented it with the 3D volume representation. Converting a 2D projected latent into a 3D volume \\(\\mathbf{z}_{\\mathrm{proj}}\\) is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.391, + 0.565, + 0.571, + 0.585 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s} ^ {\\prime} \\mathrm {h w}} := [ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {1 \\mathrm {h w}}, \\dots , \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {S h w}} ],\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.391, + 0.587, + 0.785, + 0.614 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} := \\left[ \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s l w}}, \\dots , \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} \\right], \\tag {2}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.392, + 0.609, + 0.576, + 0.629 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h w} ^ {\\prime}} := \\left[ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h 1}}, \\dots , \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h W} ^ {\\prime}} \\right],\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.393, + 0.632, + 0.613, + 0.652 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {\\mathrm {p r o j}} := \\left[ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s} ^ {\\prime} \\mathrm {h w}} + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h w} ^ {\\prime}} \\right].\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.664, + 0.788, + 0.783 + ], + "angle": 0, + "content": "3D wavelet representation. 3D CNN based volume encoder \\(\\mathcal{E}_{\\mathrm{low}}\\), \\(\\mathcal{E}_{\\mathrm{high}}\\) extract local spatio-temporal features in videos. These volumetric local features are exploited with the 2D projected latent \\(\\mathbf{z}_{\\mathrm{proj}}\\) to reorganize fine-grained features. Instead of utilizing the unprocessed RGB video frame directly in the volume encoder, we employ the decomposed wavelet features as input. These decomposed wavelet features extracted from the 3D wavelet transform \\(\\mathcal{W}\\) provide coarse and detailed volume coefficient suited for video encoding. Extracting 3D wavelet latent can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.383, + 0.79, + 0.508, + 0.805 + ], + "angle": 0, + "content": "\\[\n\\mathcal {F} _ {\\mathrm {l o w}} = \\mathcal {E} _ {\\mathrm {l o w}} (\\mathbf {x} _ {\\mathrm {l l l}}),\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.809, + 0.785, + 0.825 + ], + "angle": 0, + "content": "\\[\n\\mathcal {F} _ {\\text {h i g h}} = \\mathcal {E} _ {\\text {h i g h}} \\left(\\operatorname {C a t} \\left(\\mathbf {x} _ {\\text {l l h}}, \\dots , \\mathbf {x} _ {\\text {h h h}}\\right)\\right), \\tag {3}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.39, + 0.828, + 0.558, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {\\mathrm {v o l}} = \\operatorname {C a t} \\left(\\mathcal {F} _ {\\mathrm {l o w}}, \\mathcal {F} _ {\\mathrm {h i g h}}\\right).\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.68, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "where \\(\\mathbf{x}_{\\mathrm{III}}\\) denotes decomposed low-pass subband and the others \\(\\mathbf{x}_{\\mathrm{IIh}},\\ldots ,X_{\\mathrm{hhh}}\\) denotes high-pass subband. The low-pass subband and high-pass subband are encoded to provide the coarse content and fine motion information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.198, + 0.785, + 0.273 + ], + "angle": 0, + "content": "Fusing 2D triplane and 3D wavelet representations. As shown in Fig. 1, these 2D projected and 3D volume latent are integrated by cross-attention operation across the temporal and spatial axis. In this way, we can reinforce the volume-related inductive bias and rearrange fine-grained video latent for video generation. Formally, this cross-attention process can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.413, + 0.28, + 0.608, + 0.298 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} ^ {i} = \\mathrm {C A} (\\mathbf {z} _ {\\mathrm {p r o j}} ^ {i}, \\mathbf {z} _ {\\mathrm {v o l}}) + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {i},\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.413, + 0.301, + 0.785, + 0.328 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathbf {z} ^ {i} = \\operatorname {F F N} \\left(\\mathbf {z} ^ {i}\\right) + \\mathbf {z} ^ {i}, \\\\ \\tilde {\\mathbf {\\Sigma}} ^ {i} = C \\Lambda (- i, - \\infty), + - i \\end{array} \\tag {4}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.413, + 0.313, + 0.785, + 0.337 + ], + "angle": 0, + "content": "\\[\n\\tilde {\\mathbf {z}} ^ {i} = \\operatorname {C A} \\left(\\mathbf {z} ^ {i}, \\mathbf {z} _ {\\text {v o l}}\\right) + \\mathbf {z} ^ {i}, \\tag {4}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.342, + 0.547, + 0.358 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} ^ {i + 1} = \\mathrm {F F N} (\\tilde {\\mathbf {z}} ^ {i}) + \\tilde {\\mathbf {z}} ^ {i},\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.365, + 0.784, + 0.426 + ], + "angle": 0, + "content": "where \\(\\mathrm{CA}(a,b)\\) refers to Cross-Attention, with a representing the query and b representing the key and value. Additionally, FFN stands for FeedForward Network. Note that the input \\(\\mathbf{z}_{\\mathrm{proj}}^{0} = \\mathbf{z}_{\\mathrm{proj}}\\) and the final output \\(\\mathbf{z}\\). Then, we reconstruct the video \\(\\tilde{\\mathbf{x}}\\) with video decoder \\(\\mathcal{D}\\) based on the refined hybrid features." + }, + { + "type": "equation", + "bbox": [ + 0.467, + 0.442, + 0.785, + 0.456 + ], + "angle": 0, + "content": "\\[\n\\tilde {\\mathbf {x}} = \\mathcal {D} (\\mathbf {z}), \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.457, + 0.396, + 0.474 + ], + "angle": 0, + "content": "where \\(\\mathbf{z} \\in \\mathbb{R}^{C \\times S \\times H' \\times W'}\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.493, + 0.373, + 0.506 + ], + "angle": 0, + "content": "4.2 Loss function" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.514, + 0.784, + 0.589 + ], + "angle": 0, + "content": "Our hybrid video autoencoder consists of three loss functions. In the following, we provide a brief overview and explain the training loss functions. Our training loss functions enable the preservation of frequency information during the video reconstruction process. Specifically, we enforce constraints both in the pixel space and the wavelet space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.595, + 0.784, + 0.67 + ], + "angle": 0, + "content": "Reconstruction loss. The reconstruction loss \\(\\mathcal{L}_{rec}\\) denotes the similarity between the original input video and output video reconstructed by a model. The reconstruction loss term enforces the model to learn meaningful features in the encoding phase so that it can accurately reconstruct the input data in the decoding phase. We employ mean absolute error for reconstruction:" + }, + { + "type": "equation", + "bbox": [ + 0.416, + 0.679, + 0.785, + 0.693 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {r e c}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| \\mathbf {x} - \\tilde {\\mathbf {x}} \\| _ {1} \\right]. \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.784, + 0.796 + ], + "angle": 0, + "content": "- Perceptual loss. The perceptual loss measures the difference between the feature map of input and a generated output in terms of perceptual similarity. Typically, this loss entails the extraction of feature maps from a pre-trained neural network. In contrast to reconstruction loss, which focuses solely on the pixel-level differences between videos, perceptual loss takes into account high level features such as textures and structures that humans perceive." + }, + { + "type": "equation", + "bbox": [ + 0.388, + 0.804, + 0.785, + 0.82 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {l p i p s}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| f (\\mathbf {x}) - f (\\tilde {\\mathbf {x}}) \\| _ {1} \\right]. \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.825, + 0.574, + 0.841 + ], + "angle": 0, + "content": "where \\(f\\) denotes the perceptual feature extractor." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.342, + 0.128 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.282 + ], + "angle": 0, + "content": "Frequency matching loss. Conventional methods typically rely on pixel-level losses in the spatial-temporal space. Since these loss functions closely match the original videos in pixel domain, the generated video's quality may not be sufficient potentially failing to capture the frequency information. Our frequency matching loss is designed to facilitate the model can learn frequency features with less optimization difficulty. This loss not only helps the model to recover missing frequency components but also enhances the overall reconstruction quality. We define the frequency matching loss as a reconstruction term in the wavelet domain:" + }, + { + "type": "equation", + "bbox": [ + 0.327, + 0.284, + 0.786, + 0.302 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {f r e q}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| \\mathcal {W} _ {\\mathbf {d}} (\\mathbf {x}) - \\mathcal {W} _ {\\mathbf {d}} (\\tilde {\\mathbf {x}}) \\| _ {1} \\right], \\mathbf {d} \\in \\{\\mathrm {s}, \\mathrm {h}, \\mathrm {w} \\}. \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.309, + 0.787, + 0.34 + ], + "angle": 0, + "content": "where \\(\\mathcal{W}_{\\mathbf{d}}\\) denotes three-dimensional discrete wavelet transform and \\(\\mathbf{d}\\) denotes the dimensions from which the wavelet transform is performed." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.351, + 0.787, + 0.381 + ], + "angle": 0, + "content": "Overall loss. Taking into account all the losses, the overall loss is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.365, + 0.399, + 0.786, + 0.416 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\lambda_ {\\text {r e c}} \\mathcal {L} _ {\\text {r e c}} + \\lambda_ {\\text {l p i p s}} \\mathcal {L} _ {\\text {l p i p s}} + \\lambda_ {\\text {f r e q}} \\mathcal {L} _ {\\text {f r e q}}, \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.424, + 0.641, + 0.438 + ], + "angle": 0, + "content": "where \\(\\lambda_{\\mathrm{rec}} = \\lambda_{\\mathrm{lpips}} = 1\\) and \\(\\lambda_{\\mathrm{freq}} = 0.5\\) in our experiments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.439, + 0.787, + 0.5 + ], + "angle": 0, + "content": "Note that, unlike previous works [5, 53] that focus on improving the temporal dynamics of generated videos through the use of a 3D discriminator, our video autoencoder achieves temporal realism in the reconstructed videos without the need for adversarial training." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.524, + 0.591, + 0.538 + ], + "angle": 0, + "content": "4.3 Diffusion Model-based Video Generator" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.787, + 0.597 + ], + "angle": 0, + "content": "Leveraging the hybrid latent extracted from the video autoencoder, we train a diffusion-based video generator which learn the latent distribution \\( p(\\mathbf{z}) \\) through the reverse process of the Markov Chain." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.598, + 0.787, + 0.644 + ], + "angle": 0, + "content": "Our diffusion model consists of two processes: the forward process and the reverse process. In forward process, the model gradually transforms the latent \\(\\mathbf{z}_0\\sim p(\\mathbf{z}_0)\\) toward a Gaussian distribution as formulated below:" + }, + { + "type": "equation", + "bbox": [ + 0.368, + 0.657, + 0.786, + 0.682 + ], + "angle": 0, + "content": "\\[\nq \\left(\\mathbf {z} _ {t} \\mid \\mathbf {z} _ {t - 1}\\right) = \\mathcal {N} \\left(\\mathbf {z} _ {t}; \\sqrt {1 - \\beta_ {t}} \\mathbf {z} _ {t - 1}, \\beta_ {t} \\mathbf {I}\\right), \\tag {10}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.384, + 0.679, + 0.633, + 0.695 + ], + "angle": 0, + "content": "\\[\nq (\\mathbf {z} _ {t} | \\mathbf {z} _ {0}) = \\mathcal {N} (\\mathbf {z} _ {t}; \\sqrt {\\bar {\\alpha} _ {t}} \\mathbf {z} _ {0}, (1 - \\bar {\\alpha} _ {t}) \\mathbf {I}).\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.709, + 0.784, + 0.726 + ], + "angle": 0, + "content": "where \\(\\bar{\\alpha}_t = \\prod_{i=1}^t (1 - \\beta_i)\\) and \\(\\beta\\) represents a pre-defined schedule for the variance." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.726, + 0.786, + 0.755 + ], + "angle": 0, + "content": "In the reverse process, the model is trained to gradually denoise the latent via the parameterized Gaussian transition." + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.769, + 0.786, + 0.786 + ], + "angle": 0, + "content": "\\[\np _ {\\theta} \\left(\\mathbf {z} _ {t - 1} \\mid \\mathbf {z} _ {t}\\right) = \\mathcal {N} \\left(\\mathbf {z} _ {t - 1}; \\mu_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right), \\sigma_ {t} ^ {2} \\mathbf {I}\\right), \\tag {11}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.35, + 0.811, + 0.786, + 0.845 + ], + "angle": 0, + "content": "\\[\n\\mu_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right) = \\frac {1}{\\sqrt {\\alpha_ {t}}} \\left(\\mathbf {z} _ {t} - \\frac {\\beta_ {t}}{\\sqrt {1 - \\bar {\\alpha} _ {t}}} \\epsilon_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right)\\right), \\tag {12}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.68, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.145, + 0.788, + 0.284 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.297, + 0.788, + 0.382 + ], + "angle": 0, + "content": "Fig. 3: Applications for diverse video generator by our proposed HVDM. Our HVDM is adaptable for diverse video generation tasks depending on the type of condition latent \\( z_{c} \\). During training process, the condition latent \\( z_{c} \\) is extracted from the video and jointly trained with the noised hybrid video latent \\( z_{t} \\). During the sampling process, these condition latent are supported to enable various video generation tasks, such as long video generation, image-to-video, and video dynamics control." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.408, + 0.785, + 0.453 + ], + "angle": 0, + "content": "where \\(\\epsilon_{\\theta}(\\cdot)\\) is a trainable denoising diffusion model which recovers a noisy sample \\(\\mathbf{z}_t\\). The denoising diffusion model is trained to predict the noise with the following simplified objective:" + }, + { + "type": "equation", + "bbox": [ + 0.395, + 0.461, + 0.785, + 0.48 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {s i m p l e}} (\\theta) := \\left\\| \\epsilon_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right) - \\epsilon \\right\\| _ {2} ^ {2}, \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.487, + 0.437, + 0.503 + ], + "angle": 0, + "content": "where \\(\\mathbf{z}_t = \\sqrt{\\bar{\\alpha}_t}\\mathbf{z}_0 + \\sqrt{1 - \\bar{\\alpha}_t}\\epsilon\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.504, + 0.784, + 0.578 + ], + "angle": 0, + "content": "To generate video samples from the latent space, we train a denoising diffusion model which follows the standard 3D U-Net architecture. The 3D U-Net architecture is composed of 3D convolution layers combined with skip connections. We employ a simplified 3D U-Net to denoise the latent \\(\\mathbf{z}\\) for the purpose of verifying the effectiveness of our video autoencoder." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.599, + 0.606, + 0.615 + ], + "angle": 0, + "content": "4.4 Applications for Diverse Video Generator" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.622, + 0.784, + 0.665 + ], + "angle": 0, + "content": "We demonstrate that our method can be extended to a variety of video applications such as long video generation, image-to-video, and video dynamics control." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.78 + ], + "angle": 0, + "content": "Long video generation. To facilitate long video generation, our work follows the traditional frame prediction approach [13, 44, 53] where previous frame conditions are combined with future frames. Given two consecutive video clips \\([\\mathbf{x}^{\\mathrm{prev}},\\mathbf{x}^{\\mathrm{next}}]\\) of \\(\\mathbf{x}^{\\mathrm{prev}},\\mathbf{x}^{\\mathrm{next}}\\in \\mathbb{R}^{3\\times S\\times H\\times W}\\), we can train the model to generate initial clips and future clips in a unified manner. More specifically, we can generate an initial clip with a null latent and extend the video by composing the condition with previous frame latent as follow:" + }, + { + "type": "equation", + "bbox": [ + 0.373, + 0.788, + 0.785, + 0.829 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {c} ^ {\\text {l o n g}} = \\left\\{ \\begin{array}{l l} \\mathcal {E} (\\mathbf {x} ^ {\\text {p r e v}}), & \\text {i f f u t u r e c l i p ,} \\\\ 0, & \\text {o t h e r w i s e ,} \\end{array} \\right. \\tag {14}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.835, + 0.565, + 0.852 + ], + "angle": 0, + "content": "where \\(\\mathcal{E}\\) denotes our pre-trained hybrid encoder." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.341, + 0.128 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "Image-to-video. Image-to-video generation aims to synthesize a coherent video starting from an image. In general, videos are composed of a series of consecutive images, where the first frame serves as a representative depiction of the overall content within the video. To facilitate the process of image-to-video generation without introducing an additional image encoder, we repeatedly stack the first frame of the video on the temporal axis. Then, we use the latent \\(\\mathcal{I}^{\\mathrm{content}}\\) extracted from our video encoder as the content condition. By leveraging the latent \\(\\mathcal{I}^{\\mathrm{content}}\\) which capture the common content, we can effectively guide the model to generate coherent video sequence as follow:" + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.293, + 0.786, + 0.318 + ], + "angle": 0, + "content": "\\[\n\\mathcal {I} _ {\\text {i m c 2 v i d}} ^ {\\text {c o n t e n t}} = \\left[ \\mathbf {x} _ {0} ^ {1}, \\dots , \\mathbf {x} _ {0} ^ {1} \\right] \\in \\mathbb {R} ^ {3 \\times S \\times H \\times W}, \\tag {15}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.369, + 0.313, + 0.526, + 0.331 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {c} ^ {\\mathrm {i m g 2 v i d}} = \\mathcal {E} (\\mathcal {I} ^ {\\mathrm {c o n t e n t}}).\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.349, + 0.788, + 0.501 + ], + "angle": 0, + "content": "Video dynamics control. Empowering users to control motion intensity in video creation provides flexibility with an improved user experience. Unfortunately, it was difficult to obtain motion-related labels from existing video collections for training diffusion models. To enable the alteration of motion intensity, we devise a method that learns motion dynamics with inter-frame variance. Specifically, we define the level of motion alteration as the structural dissimilarity between the semantic latent of the start and end frames. Since the structural dissimilarity encompasses both semantic and motion variance, we employ it as guiding cues to control motion without explicit motion labeled video. Formally, our structural dissimilarity is defined as follow:" + }, + { + "type": "equation", + "bbox": [ + 0.419, + 0.51, + 0.786, + 0.528 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} _ {c} ^ {\\text {d y n a m i c s}} = \\left\\| \\mathbf {z} _ {0} ^ {\\mathrm {T}} - \\mathbf {z} _ {0} ^ {1} \\right\\| _ {1}. \\tag {16}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.537, + 0.788, + 0.629 + ], + "angle": 0, + "content": "Inspired by the classifier-free guidance techniques, we train a single diffusion model to jointly learn both the unconditional distribution \\( p(\\mathbf{x}) \\) and the conditional distribution \\( p(\\mathbf{x}^2|\\mathbf{x}^1) \\). In particular, we train the conditional distribution \\( p(\\mathbf{x}^2|\\mathbf{x}^1) \\) with condition-specific information (e.g., previous frame or content or dynamics latent) and the unconditional distribution using a null condition (e.g., \\( \\mathbf{z}_c = 0 \\)). The optimized objective can be formulated as follow:" + }, + { + "type": "equation", + "bbox": [ + 0.306, + 0.639, + 0.786, + 0.664 + ], + "angle": 0, + "content": "\\[\n\\mathbb {E} _ {\\mathbf {x} _ {0}, \\epsilon , t} [ \\lambda | | \\epsilon - \\epsilon_ {\\theta} (\\mathbf {z} _ {t}, \\mathbf {z} _ {c}, t) | | _ {2} ^ {2} + (1 - \\lambda) | | \\epsilon - \\epsilon_ {\\theta} (\\mathbf {z} _ {t}, 0, t) | | _ {2} ^ {2} ], \\tag {17}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.673, + 0.788, + 0.706 + ], + "angle": 0, + "content": "where \\(\\mathbf{z}_0 = \\mathcal{E}(\\mathbf{x}_0),\\mathbf{z}_t = \\sqrt{\\bar{\\alpha}_t}\\mathbf{z}_0 + \\sqrt{1 - \\bar{\\alpha}_t}\\epsilon\\) and \\(\\lambda \\in (0,1)\\) is a hyperparameter that guide a model to learn an unconditional and conditional distributions." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.726, + 0.377, + 0.743 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.756, + 0.398, + 0.772 + ], + "angle": 0, + "content": "5.1 Training Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Datasets. We conduct the experiments on three commonly-used benchmark datasets for the video generation task: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. UCF-101 [38] contains 13,320 videos from 101 action classes, offering a diverse range of human actions. SkyTimelapse [51] is composed of 5,000" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.68, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.144, + 0.788, + 0.214 + ], + "angle": 0, + "content": "
MethodUCF-101SkyTimelapseTaiChi
R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM
LVDM [13]----74.920.09131.210.778102.680.11227.630.729
PVDM [53]27.030.09527.030.74235.960.06132.710.82661.610.06826.870.715
HVDM (ours)5.350.03834.000.91520.760.04635.040.89121.510.02533.510.916
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.219, + 0.785, + 0.273 + ], + "angle": 0, + "content": "Table 1: Quantitative comparison of reconstruction results on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. Our video autoencoder shows significantly superior performance across various metrics, providing more fine-grained comparison." + }, + { + "type": "image", + "bbox": [ + 0.233, + 0.288, + 0.771, + 0.492 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.496, + 0.785, + 0.539 + ], + "angle": 0, + "content": "Fig. 4: Qualitative reconstruction results on SkyTimelapse [51] dataset [34]. Our HVDM produces distinct and sharp edge details and faithfully expresses a fine structures in a video sequence. Additional samples are included in appendix." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.555, + 0.785, + 0.587 + ], + "angle": 0, + "content": "videos containing dynamic sky scenes. TaiChi [34] consists of full human bodies performing Tai-Chi actions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.592, + 0.785, + 0.651 + ], + "angle": 0, + "content": "Training. The video autoencoder component for 2D projected latent stem from the PVDM [53], but the other wavelet-based frequency component is added. We train our models on 4 NVIDIA A100 GPUs for each autoencoding and diffusion process. See Appendix A for the details." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.674, + 0.414, + 0.687 + ], + "angle": 0, + "content": "5.2 Evaluation Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.698, + 0.785, + 0.773 + ], + "angle": 0, + "content": "Baseline models. We compare our HVDM with the following video generation models: VideoGPT [52], MoCoGAN [40], MoCoGAN-HD [39], DIGAN [54], StyleGAN-V [36], LVDM [13], and PVDM [53]. We utilize official model weights and conduct training using the official code when the model weights are not available." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.806, + 0.842 + ], + "angle": 0, + "content": "Quantitative evaluations. To evaluate reconstruction quality, we use R-FVD [42], LPIPS [55], PSNR [20], and SSIM [18]. Here, R-FVD denotes FVD between reconstructed videos and the ground-truth videos. As for the evaluation of generation quality, we measure FVD [42] and KVD [41]. Considering different clip" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.341, + 0.127 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "table", + "bbox": [ + 0.219, + 0.144, + 0.787, + 0.274 + ], + "angle": 0, + "content": "
VideoGPT MoCoGAN + StyleGAN2 MoCoGAN-HD DIGAN StyleGAN-V LVDM†
Train Split
UCF101 - FVD162880.62886.81821.41729.61630.21431.0N/A399.4303.1
UCF101 - FVD128N/A3679.02311.32606.52293.71773.4N/A505.0549.7
SkyTimelapse - FVD16222.7206.685.88164.183.1179.52318.963.542.8
SkyTimelapse - FVD128N/A575.9272.8878.1196.7197.0N/A134.7124.9
LVDM† PVDM† HVDM (Ours)LVDM† PVDM* HVDM (Ours)
Train SplitTrain+Test Split
UCF101 - KVD16N/A35.523.6TaiChi - FVD16120.9267.077.0
UCF101 - KVD128N/A37.734.4TaiChi - FVD128N/A339.2258.5
SkyTimelapse - KVD1621.733.11.5TaiChi - KVD1614.766.511.9
SkyTimelapse - KVD128N/A6.03.5TaiChi - KVD128N/A120.177.8
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.279, + 0.788, + 0.377 + ], + "angle": 0, + "content": "Table 2: Quantitative comparison of video generation models on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. We evaluate FVD and KVD metrics (the lower values are better) and the best score are marked as bold. The overall score of other baselines are referenced from StyleGAN-V [37]. Methods marked with \\(\\dagger\\) denote the score is computed using official pretrained weights and \\(*\\) denote the score is reproduced using official codes. We report evaluation details and sampling settings on Appendix B." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.39, + 0.787, + 0.51 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.515, + 0.787, + 0.545 + ], + "angle": 0, + "content": "Fig. 5: Generated video sample by our HVDM on UCF-101 [38], SkyTime-lapse [51], and TaiChi datasets [34]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.573, + 0.788, + 0.634 + ], + "angle": 0, + "content": "lengths, we denote \\(\\mathrm{FVD}_{16}\\) and \\(\\mathrm{KVD}_{16}\\) scores, as well as \\(\\mathrm{FVD}_{128}\\) and \\(\\mathrm{KVD}_{128}\\) scores for video clips with a length of 16 and 128. For a fair comparison, we follow the evaluation protocol of StyleGAN-V [37]; i.e., we use 2,048 real/fake video clips for evaluating FVD. See Appendix B for the details." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.657, + 0.431, + 0.673 + ], + "angle": 0, + "content": "5.3 Comparison Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.683, + 0.788, + 0.773 + ], + "angle": 0, + "content": "Reconstruction results. Fig. 4 and Appendix F.1 show the performance of the reconstructed videos from our autoencoder and other diffusion-based video generative models. Our autoencoder presents a more accurate and clear reconstructed video compared to other baseline methods. In the Tab. 1, we demonstrate that our autoencoder achieves superior performance in all metrics for the three datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Generation results. We perform video generation on three datasets and compare the results with the other video generation methods. As shown in Fig. 5, our method is capable of generating not only monotonic motion videos such as Sky-Timelapse [51] and TaiChi [34] but also dynamic motion video UCF-101 [38]," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.68, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table", + "bbox": [ + 0.232, + 0.144, + 0.768, + 0.228 + ], + "angle": 0, + "content": "
BackboneProj.Adv.z shape dimensionR-FVD ↓ LPIPS ↓ PSNR ↑SSIM ↑
Video Transformer [4]✓-4 × (32 × 32 + 16 × 32 + 16 × 32)180.210.092
Video Transformer [4]✓✓4 × (32 × 32 + 16 × 32 + 16 × 32)27.030.095
3D CNN [22]--4 × 16 × 32 × 3286.730.057
3D CNN [22]-✓4 × 16 × 32 × 3221.690.064
Ours✓-4 × 16 × 32 × 325.350.038
34.00
0.915
" + }, + { + "type": "table_caption", + "bbox": [ + 0.276, + 0.231, + 0.726, + 0.246 + ], + "angle": 0, + "content": "Table 3: Ablation study on various backbone architectures" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.337 + ], + "angle": 0, + "content": "which contain complex action categories. Note that synthesizing high quality videos on a complex dataset like UCF-101 [38] has been a challenging problem where existing video generation method often struggle with producing natural motions with good quality. As shown in Tab. 2, our method achieves superior performance in the benchmark datasets. See Appendix F for more samples." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.355, + 0.581, + 0.371 + ], + "angle": 0, + "content": "5.4 Interpreting the frequency supervision" + }, + { + "type": "image", + "bbox": [ + 0.241, + 0.381, + 0.487, + 0.594 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.602, + 0.505, + 0.631 + ], + "angle": 0, + "content": "Fig.6: Visualization of our hybrid representations." + }, + { + "type": "text", + "bbox": [ + 0.513, + 0.377, + 0.789, + 0.632 + ], + "angle": 0, + "content": "We perform visualization to understand how hybrid representation can help autoencoder to encode the 3D video pixels in Fig. 6. The decomposed 3D wavelet features is divided into low frequency and high frequency components, where each component conducts cross-attention operation with the 2D projected latent. As shown in Fig. 6, low frequency component captures static and dynamic regions and high frequency component captures the sharp edges and important details of video. To refine the ambiguity of the 2D project latent which contain global and abstract information, we incorporate these latent with" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.634, + 0.788, + 0.664 + ], + "angle": 0, + "content": "frequency components. As a result, our autoencoder figures out where the objects are located and how object's motion occurs in the video." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.683, + 0.608, + 0.699 + ], + "angle": 0, + "content": "5.5 Ablation study on backbone architectures" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.789, + 0.841 + ], + "angle": 0, + "content": "We conduct verification of performance based on the autoencoder's backbone architecture on UCF-101 dataset. As shown in Tab. 3, our hybrid autoencoder demonstrates effectiveness in capturing both perceptual details and temporal coherence in the video. We can observe that 3D CNN-based autoencoder show better performance compared to the 2D triplane-based autoencoder since it has more latent dimensions. Although the 2D triplane-based autoencoder effectively compresses latent dimensions, enhancing temporal coherence necessitates adversarial training with a 3D discriminator. Our hybrid autoencoder integrates the strengths of both architectures, achieving superior performance." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.341, + 0.127 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.542, + 0.163 + ], + "angle": 0, + "content": "5.6 Ablation study on fusing modules" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.173, + 0.788, + 0.325 + ], + "angle": 0, + "content": "We verify several experiments to assess how the fusing module affects the performance of our hybrid autoencoder on UCF-101 dataset. For feature fusion, we adopted two different modules: 1) the concatenation module 2) the cross-attention module. We also validated the effectiveness of wavelet decomposition by comparing the results which use raw RGB video as input. As shown in Tab. 4, the experimental results show that the cross-attention module and wavelet-decomposed components contribute to the improvement of reconstruction performance. We analyze that utilizing the temporal and spatial attention module facilitate the integration of different 2D triplane and 3D wavelet representation through the comparison of features at different spatial locations." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.337, + 0.79, + 0.395 + ], + "angle": 0, + "content": "
Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑
Baseline27.030.09527.030.742Baseline + RGB (Cross-attn.)6.320.03833.790.908
Baseline + RGB (Concat.)20.370.06331.020.831Baseline + Low Freq. (Cross-attn.)6.870.04033.690.909
Baseline + Low Freq. (Concat.)34.390.07830.500.816Baseline + High Freq. (Cross-attn.)6.970.04733.200.899
Baseline + High Freq. (Concat.)14.960.06131.320.838
Baseline + Low & High Freq. (Concat.)9.920.05132.690.871Ours5.350.03734.000.915
" + }, + { + "type": "table_caption", + "bbox": [ + 0.308, + 0.401, + 0.694, + 0.415 + ], + "angle": 0, + "content": "Table 4: Ablation study on feature fusing module." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.438, + 0.616, + 0.455 + ], + "angle": 0, + "content": "5.7 Ablation study on frequency matching loss" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.464, + 0.788, + 0.586 + ], + "angle": 0, + "content": "We validate the effectiveness of frequency matching loss (FML) on UCF-101 dataset in Tab. 5. The result shows that utilizing the FML term leads to a remarkable reduction in the FVD score by approximately 2.73 points demonstrating its effectiveness in enhancing the temporal coherency. Furthermore, evaluation metrics related to perceptual details also improved to 0.003 points for LPIPS, 0.33 points for PSNR, and 0.023 points for SSIM respectively. Based on these results, the FML verifies that aligning frequency components allow the HVDM to enhance temporal changes and perceptual quality of generated videos." + }, + { + "type": "table", + "bbox": [ + 0.359, + 0.606, + 0.645, + 0.648 + ], + "angle": 0, + "content": "
MethodR-FVD ↓LPIPS ↓PSNR ↑SSIM ↑
HVDM (w/o FML)8.080.04133.670.892
HVDM (w/ FML)5.350.03834.000.915
" + }, + { + "type": "table_caption", + "bbox": [ + 0.301, + 0.655, + 0.702, + 0.67 + ], + "angle": 0, + "content": "Table 5: Ablation study on frequency matching loss." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.702, + 0.36, + 0.718 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We proposed a novel hybrid video autoencoder for video generation using diffusion model, dubbed HVDM. We investigated the effectiveness of our hybrid architecture that combines 2D projected and 3D volume representation, leveraging the strengths of frequency matching loss. By incorporating these representations with spatio-temporal cross-attention, HVDM generates high-quality videos with improved realism. Our extensive experiments on benchmark datasets demonstrated the superior performance, compared to the other baseline methods." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.68, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.788, + 0.36 + ], + "angle": 0, + "content": "This research was supported by the National Supercomputing Center in Korea (KISTI) (TS-2023-RG-0004), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No.2022R1C1C1008496, RS-2024-00346597), Institute of Information & communications Technology Planning & Evaluation(IITP) grant funded by the Korea government(MSIT) (No.RS-2020-II201336, Artificial Intelligence graduate school support(UNIST), RS-2021-II212068, Comprehensive Video Understanding and Generation with Knowledge-based Deep Logic Neural Network), and Culture, Sports, and Tourism R&D Program through the Korea Creative Content Agency grant funded by the Ministry of Culture, Sports and Tourism (Research on neural watermark technology for copyright protection of generative AI 3D content, RS-2024-00348469, RS-2024-00333068)." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.387, + 0.323, + 0.403 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.787, + 0.463 + ], + "angle": 0, + "content": "1. Ajay, A., Han, S., Du, Y., Li, S., Gupta, A., Jaakkola, T., Tenenbaum, J., Kaelbling, L., Srivastava, A., Agrawal, P.: Compositional foundation models for hierarchical planning. arXiv preprint arXiv:2309.08587 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.463, + 0.787, + 0.504 + ], + "angle": 0, + "content": "2. An, J., Zhang, S., Yang, H., Gupta, S., Huang, J.B., Luo, J., Yin, X.: Latent-shift: Latent diffusion with temporal shift for efficient text-to-video generation. arXiv preprint arXiv:2304.08477 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.505, + 0.787, + 0.56 + ], + "angle": 0, + "content": "3. Anciukevicius, T., Xu, Z., Fisher, M., Henderson, P., Bilen, H., Mitra, N.J., Guerrero, P.: Renderdiffusion: Image diffusion for 3d reconstruction, inpainting and generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12608-12618 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.561, + 0.787, + 0.588 + ], + "angle": 0, + "content": "4. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.589, + 0.787, + 0.644 + ], + "angle": 0, + "content": "5. Blattmann, A., Rombach, R., Ling, H., Dockhorn, T., Kim, S.W., Fidler, S., Kreis, K.: Align your latents: High-resolution video synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22563-22575 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.645, + 0.787, + 0.673 + ], + "angle": 0, + "content": "6. Ceylan, D., Huang, C.H.P., Mitra, N.J.: Pix2video: Video editing using image diffusion. arXiv preprint arXiv:2303.12688 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.673, + 0.787, + 0.729 + ], + "angle": 0, + "content": "7. Chan, E.R., Lin, C.Z., Chan, M.A., Nagano, K., Pan, B., De Mello, S., Gallo, O., Guibas, L.J., Tremblay, J., Khamis, S., et al.: Efficient geometry-aware 3d generative adversarial networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16123-16133 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.787, + 0.771 + ], + "angle": 0, + "content": "8. Chan, E.R., Monteiro, M., Kellnhofer, P., Wu, J., Wetzstein, G.: Pi-GAN: Periodic implicit generative adversarial networks for 3D-aware image synthesis. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.771, + 0.787, + 0.84 + ], + "angle": 0, + "content": "9. Çiçek, Ö., Abdulkadir, A., Lienkamp, S.S., Brox, T., Ronneberger, O.: 3d u-net: learning dense volumetric segmentation from sparse annotation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2016: 19th International Conference, Athens, Greece, October 17-21, 2016, Proceedings, Part II 19. pp. 424-432. Springer (2016)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.42, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.341, + 0.127 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "10. Dai, Y., Yang, M., Dai, B., Dai, H., Nachum, O., Tenenbaum, J., Schuurmans, D., Abbeel, P.: Learning universal policies via text-guided video generation. arXiv preprint arXiv:2302.00111 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.785, + 0.232 + ], + "angle": 0, + "content": "11. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. arXiv preprint arXiv:2302.03011 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.233, + 0.785, + 0.288 + ], + "angle": 0, + "content": "12. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. In: International Conference on Machine Learning. pp. 11808-11826. PMLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.289, + 0.785, + 0.33 + ], + "angle": 0, + "content": "13. He, Y., Yang, T., Zhang, Y., Shan, Y., Chen, Q.: Latent video diffusion models for high-fidelity video generation with arbitrary lengths. arXiv preprint arXiv:2211.13221 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.331, + 0.785, + 0.373 + ], + "angle": 0, + "content": "14. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., Salimans, T.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.374, + 0.785, + 0.401 + ], + "angle": 0, + "content": "15. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.402, + 0.785, + 0.43 + ], + "angle": 0, + "content": "16. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models, 2022. URL https://arxiv.org/abs/2204.03458" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.431, + 0.785, + 0.458 + ], + "angle": 0, + "content": "17. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models. arXiv preprint arXiv:2204.03458 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.459, + 0.785, + 0.487 + ], + "angle": 0, + "content": "18. Hore, A., Ziou, D.: Image quality metrics: Psnr vs. sSIM. In: 2010 20th international conference on pattern recognition. pp. 2366-2369. IEEE (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.488, + 0.785, + 0.515 + ], + "angle": 0, + "content": "19. Hu, Y., Chen, Z., Luo, C.: Lamd: Latent motion diffusion for video generation. arXiv preprint arXiv:2304.11603 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.516, + 0.785, + 0.543 + ], + "angle": 0, + "content": "20. Huynh-Thu, Q., Ghanbari, M.: Scope of validity of psnr in image/video quality assessment. Electronics letters 44(13), 800-801 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.544, + 0.785, + 0.572 + ], + "angle": 0, + "content": "21. Kalchbrenner, N., Oord, A., Simonyan, K., Danihelka, I., Vinyals, O., Graves, A., Kavukcuoglu, K.: Video pixel networks. In: ICML (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.573, + 0.785, + 0.6 + ], + "angle": 0, + "content": "22. Karpathy, A., Toderici, G., Shetty, S., Leung, T., Sukthankar, R., Fei-Fei, L.: Large-scale video classification with convolutional neural networks. In: CVPR (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.601, + 0.785, + 0.642 + ], + "angle": 0, + "content": "23. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.785, + 0.671 + ], + "angle": 0, + "content": "24. Li, Y., Min, M., Shen, D., Carlson, D., Carin, L.: Video generation from text. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.672, + 0.785, + 0.699 + ], + "angle": 0, + "content": "25. Liu, S., Zhang, Y., Li, W., Lin, Z., Jia, J.: Video-p2p: Video editing with cross-attention control. arXiv preprint arXiv:2303.04761 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.7, + 0.785, + 0.741 + ], + "angle": 0, + "content": "26. Ma, X., Wang, Y., Jia, G., Chen, X., Liu, Z., Li, Y.F., Chen, C., Qiao, Y.: Latte: Latent diffusion transformer for video generation. arXiv preprint arXiv:2401.03048 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.742, + 0.761, + 0.756 + ], + "angle": 0, + "content": "27. Mei, K., Patel, V.M.: Vidm: Video implicit diffusion models. In: AAAI (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.785, + 0.798 + ], + "angle": 0, + "content": "28. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: Proceedings of the 25th ACM international conference on Multimedia. pp. 1789-1798 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "29. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.681, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "HVDM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "30. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.189, + 0.788, + 0.244 + ], + "angle": 0, + "content": "31. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10219-10228 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.244, + 0.788, + 0.285 + ], + "angle": 0, + "content": "32. Schwarz, K., Liao, Y., Niemeyer, M., Geiger, A.: Graf: Generative radiance fields for 3d-aware image synthesis. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.285, + 0.788, + 0.326 + ], + "angle": 0, + "content": "33. Secker, A., Taubman, D.: Highly scalable video compression using a lifting-based 3d wavelet transform with deformable mesh motion compensation. In: Proceedings. International Conference on Image Processing. vol. 3, pp. 749-752. IEEE (2002)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.326, + 0.788, + 0.353 + ], + "angle": 0, + "content": "34. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: First order motion model for image animation. In: NeurIPS (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.353, + 0.788, + 0.393 + ], + "angle": 0, + "content": "35. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. In: ICLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.393, + 0.788, + 0.434 + ], + "angle": 0, + "content": "36. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: StyleGAN-V: A continuous video generator with the price, image quality and perks of StyleGAN2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.434, + 0.788, + 0.489 + ], + "angle": 0, + "content": "37. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: Stylegan-v: A continuous video generator with the price, image quality and perks of stylegan2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3626-3636 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.488, + 0.788, + 0.516 + ], + "angle": 0, + "content": "38. Soomro, K., Zamir, A.R., Shah, M.: UCF101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.516, + 0.788, + 0.556 + ], + "angle": 0, + "content": "39. Tian, Y., Ren, J., Chai, M., Olszewski, K., Peng, X., Metaxas, D.N., Tulyakov, S.: A good image generator is what you need for high-resolution video synthesis. In: ICLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.556, + 0.788, + 0.583 + ], + "angle": 0, + "content": "40. Tulyakov, S., Liu, M.Y., Yang, X., Kautz, J.: MoCoGAN: Decomposing motion and content for video generation. In: CVPR (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.583, + 0.788, + 0.624 + ], + "angle": 0, + "content": "41. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.624, + 0.788, + 0.664 + ], + "angle": 0, + "content": "42. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Fvd: A new metric for video generation. In: DGS@ICLR (2019), https://apisemantic scholar.org/CorpusID:198489709" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.664, + 0.788, + 0.692 + ], + "angle": 0, + "content": "43. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.692, + 0.788, + 0.732 + ], + "angle": 0, + "content": "44. Voleti, V., Jolicoeur-Martineau, A., Pal, C.: Mcvd-masked conditional video diffusion for prediction, generation, and interpolation. Advances in Neural Information Processing Systems 35, 23371-23385 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.732, + 0.788, + 0.759 + ], + "angle": 0, + "content": "45. Vondrick, C., Pirsiavash, H., Torralba, A.: Generating videos with scene dynamics. In: NeurIPS (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.759, + 0.788, + 0.8 + ], + "angle": 0, + "content": "46. Wang, B., Wang, Y., Selesnick, I., Vetro, A.: Video coding using 3d dual-tree wavelet transform. EURASIP Journal on Image and Video Processing 2007, 1-15 (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.8, + 0.788, + 0.841 + ], + "angle": 0, + "content": "47. Wang, J., Huang, K.: Medical image compression by using three-dimensional wavelet transformation. IEEE Transactions on Medical Imaging 15(4), 547-554 (1996)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.341, + 0.128 + ], + "angle": 0, + "content": "Kim et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "48. Wang, T., Zhang, B., Zhang, T., Gu, S., Bao, J., Baltrusaitis, T., Shen, J., Chen, D., Wen, F., Chen, Q., et al.: Rodin: A generative model for sculpting 3d digital avatars using diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4563-4573 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.204, + 0.786, + 0.231 + ], + "angle": 0, + "content": "49. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.231, + 0.787, + 0.272 + ], + "angle": 0, + "content": "50. Wu, J.Z., Ge, Y., Wang, X., Lei, W., Gu, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. arXiv preprint arXiv:2212.11565 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.272, + 0.787, + 0.313 + ], + "angle": 0, + "content": "51. Xiong, W., Luo, W., Ma, L., Liu, W., Luo, J.: Learning to generate time-lapse videos using multi-stage dynamic generative adversarial networks. In: CVPR (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.314, + 0.787, + 0.342 + ], + "angle": 0, + "content": "52. Yan, W., Zhang, Y., Abbeel, P., Srinivas, A.: VideoGPT: Video generation using VQ-VAE and transformers. arXiv preprint arXiv:2104.10157 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.342, + 0.787, + 0.37 + ], + "angle": 0, + "content": "53. Yu, S., Sohn, K., Kim, S., Shin, J.: Video probabilistic diffusion models in projected latent space. arXiv preprint arXiv:2302.07685 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.37, + 0.787, + 0.411 + ], + "angle": 0, + "content": "54. Yu, S., Tack, J., Mo, S., Kim, H., Kim, J., Ha, J.W., Shin, J.: Generating videos with dynamics-aware implicit generative adversarial networks. In: The Tenth International Conference on Learning Representations (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.411, + 0.787, + 0.439 + ], + "angle": 0, + "content": "55. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.787, + 0.467 + ], + "angle": 0, + "content": "56. Zhou, D., Wang, W., Yan, H., Lv, W., Zhu, Y., Feng, J.: Magicvideo: Efficient video generation with latent diffusion models. arXiv preprint arXiv:2211.11018 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.467 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_origin.pdf b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f2d52c55f0998b8f7f1664fcf345668d8accdce6 --- /dev/null +++ b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/3a74bbe1-4d9f-4c40-a118-2bf8b63e6553_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:144641103e0433e034ceb984905b9d5e85098beb4baf3264fc8ab1482ebfb24c +size 15009950 diff --git a/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/full.md b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..15a6c6fbe273bcd4435291c5d7ebef206ae2140b --- /dev/null +++ b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/full.md @@ -0,0 +1,399 @@ +# Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation + +Kihong Kim $^{1}$ , Haneol Lee $^{2}$ , Jihye Park $^{3}$ , Seyeon Kim $^{3}$ , Kwanghee Lee $^{1}$ , Seungryong Kim $^{†3}$ , and Jaejun Yoo $^{†2}$ + +$^{1}$ VIVE STUDIOS $^{2}$ UNIST $^{3}$ Korea University $\{\mathrm{h} \times \mathrm{n} \times \mathrm{g} \mathrm{i} \mathrm{e} \mathrm{e}, \mathrm{l} \times \mathrm{k} \times \mathrm{w} \mathrm{a} \mathrm{g} \mathrm{h} \mathrm{e} \mathrm{e}\} @$ gmail.com $\{\mathrm{h} \times \mathrm{n} \times \mathrm{e} \mathrm{t} \mathrm{l} \times \mathrm{e}, \mathrm{j} \times \mathrm{n} \times \mathrm{u} \mathrm{e} \mathrm{u} \mathrm{r} \mathrm{y} \mathrm{o} \mathrm{g}, \mathrm{k} \times \mathrm{m} \times \mathrm{u} \mathrm{n} \mathrm{i} \mathrm{s} \mathrm{t}. \mathrm{a} \mathrm{c}. \mathrm{k} \mathrm{r}\}$ {ghp1112, kimse2878, seungryong_kim}@korea.ac.kr https://hxngiee.github.io/HVDM + +Abstract. Generating high-quality videos that synthesize desired realistic content is a challenging task due to their intricate high dimensionality and complexity. Several recent diffusion-based methods have shown comparable performance by compressing videos to a lower-dimensional latent space, using traditional video autoencoder architecture. However, such method that employ standard frame-wise 2D or 3D convolution fail to fully exploit the spatio-temporal nature of videos. To address this issue, we propose a novel hybrid video diffusion model, called HVDM, which can capture spatio-temporal dependencies more effectively. HVDM is trained by a hybrid video autoencoder which extracts a disentangled representation of the video including: (i) a global context information captured by a 2D projected latent, (ii) a local volume information captured by 3D convolutions with wavelet decomposition, and (iii) a frequency information for improving the video reconstruction. Based on this disentangled representation, our hybrid autoencoder provide a more comprehensive video latent enriching the generated videos with fine structures and details. Experiments on standard video generation benchmarks such as UCF101, SkyTimelapse, and TaiChi demonstrate that the proposed approach achieves state-of-the-art video generation quality, showing a wide range of video applications (e.g., long video generation, image-to-video, and video dynamics control). The source code and pre-trained models will be publicly available once the paper is accepted. + +Keywords: Video Diffusion $\cdot$ Wavelet Transform $\cdot$ Generative Models + +# 1 Introduction + +Video generation has received a lot of attention in the computer vision and graphics fields due to its broad applications in making films, creating animations, simulating environments, etc [1,5,6,10,23]. Nonetheless, video generation remains a challenging task because of the high-dimensionality and complexity inherent + +in video data. The primary difficulty lies in producing high-quality video frames that are both visually appealing and dynamically coherent. + +By leveraging the recent advancements of image-based diffusion models [14, 15], a variety of video diffusion methods have emerged [17,27,31]. These methods show considerable promise in modeling video distributions and synthesizing visually plausible results. However, they often face efficiency challenge due to operating in pixel space. To address this challenge, several recent latent video diffusion models have been developed, training within a compressed latent space to reduce computational demands [2,11,13,56,56]. While these latent diffusion models exhibit improved scaling properties with reduced complexity, the potential of novel autoencoder designs remains largely unexplored. There exist conventional approaches, employing standard 2D or 3D CNN-based autoencoders for video generation [13,17,19,35]. Yet, these CNN-based architectures struggle with effectively managing the overall spatio-temporal structure of videos. While transformers might be considered as a solution, their direct application to video representation learning can lead to significant computational time and memory inefficiency [21,49]. + +Unlike the aforementioned approaches, PVDM [53] offers a novel perspective in video generation. PVDM simplifies video complexity by adopting a triplane representation, where video data is factorized into 2D projected latents across different spatio-temporal directions in a latent space. This method has demonstrated improved generation results over previous works such as StyleGAN-based approaches [36] and other diffusion models [17], particularly in effectively representing intricate video data. Despite its progress, they encounter inherent limitations due to the reduction of higher-dimensional video data into lower-dimensional spaces. More specifically, the 2D projected latents struggle to fully recover the 3D structure of video volume, lacking crucial volume information. + +Motivated by these observations, we propose a novel hybrid video diffusion model designed to comprehensively capture the spatio-temporal dependencies of video, called HVDM. Rather than reinventing the wheel, we leverage these known characteristics to enhance effectiveness in video generation tasks. Our video autoencoder combines transformer for 3D-to-2D projections and the 3D CNNs to effectively utilize both global context and local volume information in video. We first start from a well-known fact that transformers excel at capturing long-range dependencies, and we employ them to acquire the global context of the video. To compensate the limited inductive bias of transformers, we leverage 3D CNNs to provide local volume details, drawing from the recognized advantage of 3D CNNs in capturing short-range spatio-temporal information. More specifically, our proposed autoencoder builds the strengths of both architectures by incorporating global 2D projected and local 3D volume latent representations. These two types of latent representations mutually enhance each other through cross-attention module that operates along both the temporal and spatial axes. Taking this approach further, we pose the question of whether it is possible to exploit frequency information for boosting the video reconstruction process. We find that employing 3D discrete wavelet transform could potentially resolve the + +![](images/4ed2b1ce79277c2706e4734aa5ae669ce33c3bee0b2af763f21b408037add878.jpg) +Fig. 1: Overview of our hybrid video autoencoder in HVDM that combines a 2D triplane and 3D volume representation for video encoding. The 2D triplane representation provides global context and 3D volume representation providing local volume information of video. The spatio-temporal cross-attention module incorporates these distinctive features to organize fine-grained video representation. + +problem of limited receptive fields in 3D CNNs. Specifically, considering that the 3D discrete wavelet transform reduces the video's size by half in the frequency domain, it allows us to expand the receptive field without losing information. Additionally, using 3D discrete wavelet transform decompose complex video into different frequency components at multiple levels of details, providing rich video representation. Finally, by training the video autoencoder with both reconstruction and frequency matching loss in the pixel and spectral spaces, frequency matching loss improved visual quality during video reconstruction process. As a result, we observe that the integration of wavelet-based features provides benefit compared to the use of raw video data by enabling more nuanced video encoding. + +To validate the effectiveness of our method, we demonstrate a wide range of video applications including unconditional video generation, long video generation, image-to-video, and video dynamics control. Here, we use three benchmark datasets for video generation: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. Both quantitative and qualitative results demonstrate video generation capabilities of our method, showing superior performance over the state-of-the-art approaches. + +# 2 Related Work + +Video generation. Video generation methods have been developed based on deep generative models, such as variational autoencoder (VAEs), generative adversarial networks (GANs), and diffusion models (DMs). Early work [24, 28] attempted to employ VAEs and GANs-based models to generate frames in an + +autoregressive manner. However, they fail to produce desired results due to the difficulty of modeling spatial-temporal changes and their results limited to low resolutions. Another work [45] introduce a spatio-temporal convolutional architecture that effectively disentangles the scene's foreground and background. MoCoGAN [40] propose the motion and content decomposed generative adversarial network that generates a video by translating a sequence of random vectors into a sequence of video frames. Although each of these methods show encouraging results for video generation, GAN-based models often suffer from unstable training and fall into mode collapse. In contrast, diffusion models have demonstrated new possibilities for video generation, leveraging a stable training scheme and robust representation. + +Diffusion models. Inspired by the success of image-based diffusion models, a series of video diffusion models [2, 11, 25, 30, 50, 56] are proposed. These models leverage the pre-trained image diffusion models and extend their application to videos. While they are capable of efficient learning with just a few computation powers, there are some difficulties in creating consistent and photo-realistic video content. Since they generate videos on a frame-by-frame basis, they face challenges in achieving temporal consistency and producing long video results. + +On the other hand, recent videos diffusion models [16, 26, 31, 44] proposed methods for learning video from scratch by adopting various model architectures [9, 29]. While they are capable of generating high fidelity results that are both temporally consistent and realistic, these methods are still limited in computation and memory inefficiency. To overcome these inefficiency, latent diffusion methods [13, 19, 53] have emerged which train the model in low-dimensional latent space while maintaining their perceptual quality. + +Triplane representations. The effectiveness of triplane representation has already found in 3D-aware generation works [3,7,8,12,32,48]. These triplane representation methods have been shown to offer an effective compression benefits by projecting the 3D volume as 2D-shaped latent features. By taking advantage of these triplane representation, PVDM [53] achieves comparable results in the video generation task, encoding the cubic structure of video pixels. Inspired by this, we present an improved video encoding method that exploit the 2D projected latent with wavelet-based 3D volume latent. + +# 3 Preliminaries + +# 3.1 2D Triplane Representation for Video Diffusion Model + +Given a video sample $\mathbf{x} \in \mathbb{R}^{3 \times S \times H \times W}$ with time $S$ , height $H$ , and width $W$ , the triplane autoencoder encodes it as three 2D projected latent $[\mathbf{z}_{\mathrm{proj}}^{\mathrm{hw}}, \mathbf{z}_{\mathrm{proj}}^{\mathrm{ws}}, \mathbf{z}_{\mathrm{proj}}^{\mathrm{hs}}]$ where $\mathbf{z}_{\mathrm{proj}}^{\mathrm{hw}} \in \mathbb{R}^{C \times H' \times W'}$ , $\mathbf{z}_{\mathrm{proj}}^{\mathrm{ws}} \in \mathbb{R}^{C \times S \times W'}$ , $\mathbf{z}_{\mathrm{proj}}^{\mathrm{hs}} \in \mathbb{R}^{C \times S \times H'}$ . We denote $C$ as number of channels, $H' = H / d$ , $W' = W / d$ for downsampling factors $d > 1$ . Unlike conventional video autoencoder which depends on frame-wise 2D or 3D convolution networks [13,17,19,35], the PVDM [53] effectively decompose + +the 3D data using video transformer [4] for projections $\left[\mathbf{z}_{\mathrm{proj}}^{\mathrm{hw}},\mathbf{z}_{\mathrm{proj}}^{\mathrm{ws}},\mathbf{z}_{\mathrm{proj}}^{\mathrm{hs}}\right]$ . The utilization of these latent vectors $\left[\mathbf{z}_{\mathrm{proj}}^{\mathrm{hw}},\mathbf{z}_{\mathrm{proj}}^{\mathrm{ws}},\mathbf{z}_{\mathrm{proj}}^{\mathrm{hs}}\right]$ offers several advantages in terms of achieving both computation and memory efficiency. Furthermore, their image-like structure enables the efficient video generation from the latent space reducing the dimensionality of the data. + +# 3.2 3D Wavelet Representation + +3D Wavelet transform is a classical algorithm widely used in medical imaging and video compression to separate different frequency components within the data [33,46,47]. Just as the 2D wavelet transform, given $\mathbf{x} \in \mathbb{R}^{3 \times S \times H \times W}$ , the 3D wavelet transform operates along $s$ , $h$ , and $w$ direction decomposing the 3D volume into different subbands. These subbands are factorized into low and high subbands where the low subband express the slowly changing part of the data and the high subband contain fine details capturing sharp edges and rapid transitions within the data. + +Specifically, it can be defined as discrete wavelet transform (DWT) and discrete inverse wavelet transform (IWT). In general, Haar wavelets is commonly employed in a variety of real-world applications due to their simplicity. Different types of filters, including low-pass and high-pass filters, divide the volume input $\mathbf{x} \in \mathbb{R}^{3 \times S \times H \times W}$ into distinct frequency sub-bands $\mathbf{x}_{\mathrm{lll}}$ , $\mathbf{x}_{\mathrm{llh}}$ , $\mathbf{x}_{\mathrm{lhl}}$ , $\mathbf{x}_{\mathrm{hlh}}$ , $\mathbf{x}_{\mathrm{hhll}}$ , $\mathbf{x}_{\mathrm{hhh}}$ with a size of $S / 2 \times H / 2 \times W / 2$ . Where the low-frequency components provide the long-term av + +erages information, while the high-frequency components provide information about local changes. In Fig. 2, we visualize a one level of 3D discrete wavelet decomposition. + +![](images/a379e64dd8e197ec099013da664e3b3b2608f9bad9b54e5ec261781f1c527fe7.jpg) +Fig.2: Visualization of 3D wavelet transform. The volume of video is decomposed into eight subband $(\mathbf{x}_{\mathrm{lll}},\dots ,\mathbf{x}_{\mathrm{hhh}})$ including low and high frequency components. + +# 4 Methodology + +Our hybrid video autoencoder is illustrated in Fig. 1. We first describe the overall video encoding architecture in Sec 4.1. In the following, we present the training objective which enforce constraints in both pixel space and the wavelet space in Sec 4.2. Then, we formalize the diffusion-based video generation framework in Sec 4.3. Lastly, we introduce various video applications using video diffusion model in Sec 4.4. + +# 4.1 Designing Hybrid Video Autoencoder + +To train a video diffusion model generating high quality results, it is necessary to have an expressive video representation that accounts for inclusive information of video data. To satisfy this requirement, we construct hybrid representations by combining 2D triplane and 3D wavelet representation. + +2D triplane representation. The 2D projected latent which is originated from PVDM [53] is extracted by 3D-to-2D projections mapping at each spatiotemporal direction to encode 3D video pixels. As shown in Sec 3.1, the 2D image-like latent $\left[\mathbf{z}_{\mathrm{proj}}^{\mathrm{hw}},\mathbf{z}_{\mathrm{proj}}^{\mathrm{ws}},\mathbf{z}_{\mathrm{proj}}^{\mathrm{hs}}\right]$ can be encoded with a combination of a video encoder [4] and a small transformer [43]. Formally, the projected latent is formulated as follows: + +$$ +[ u _ {\mathrm {s h w}} ] := \mathcal {T} _ {\mathrm {v i d e o}} ^ {\mathrm {s h w}} (\mathbf {x}), +$$ + +$$ +\mathbf {z} _ {\text {p r o j}} ^ {\mathrm {h w}} := \mathcal {T} _ {\text {p r o j}} ^ {\mathrm {s}} \left(u _ {1 \mathrm {h w}}, \dots , u _ {\mathrm {S h w}}\right), +$$ + +$$ +\begin{array}{l} \text {p r o j} \\ \mathbf {z} _ {\text {p r o j}} ^ {\mathrm {w s}} := \mathcal {T} _ {\text {p r o j}} ^ {\mathrm {h}} \left(u _ {\mathrm {s l w}}, \dots , u _ {\mathrm {s H ^ {\prime} w}}\right), \end{array} \tag {1} +$$ + +$$ +\mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {h s}} := \mathcal {T} _ {\mathrm {p r o j}} ^ {\mathrm {w}} \left(u _ {\mathrm {s h} 1}, \dots , u _ {\mathrm {s h W} ^ {\prime}}\right), +$$ + +where $\mathcal{T}_{\mathrm{video}}^{\mathrm{shw}}$ denotes a video-to-3D-latent encoder such as video transformer [4] and $\mathcal{T}_{\mathrm{proj}} = [\mathcal{T}_{\mathrm{proj}}^{\mathrm{s}},\mathcal{T}_{\mathrm{proj}}^{\mathrm{h}},\mathcal{T}_{\mathrm{proj}}^{\mathrm{w}}]$ denotes a small transformer [43] for projections. While projected latent provide a global information of video with a computational efficiency, this transformer architecture projecting a triplane leads to lossy compression due to the lack of local volume information. Moreover, the weak inductive bias of the transformer leads to a slower convergence speed for the model. To overcome these limitations, we transformed the 2D projected latent into a 3D volume and complemented it with the 3D volume representation. Converting a 2D projected latent into a 3D volume $\mathbf{z}_{\mathrm{proj}}$ is formulated as follows: + +$$ +\mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {s} ^ {\prime} \mathrm {h w}} := [ \mathbf {z} _ {\mathrm {p r o j}} ^ {1 \mathrm {h w}}, \dots , \mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {S h w}} ], +$$ + +$$ +\mathbf {z} _ {\text {p r o j}} ^ {\mathrm {s h} ^ {\prime} \mathrm {w}} := \left[ \mathbf {z} _ {\text {p r o j}} ^ {\mathrm {s l w}}, \dots , \mathbf {z} _ {\text {p r o j}} ^ {\mathrm {s h} ^ {\prime} \mathrm {w}} \right], \tag {2} +$$ + +$$ +\mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {s h w} ^ {\prime}} := \left[ \mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {s h 1}}, \dots , \mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {s h W} ^ {\prime}} \right], +$$ + +$$ +\mathbf {z} _ {\mathrm {p r o j}} := \left[ \mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {s} ^ {\prime} \mathrm {h w}} + \mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {s h} ^ {\prime} \mathrm {w}} + \mathbf {z} _ {\mathrm {p r o j}} ^ {\mathrm {s h w} ^ {\prime}} \right]. +$$ + +3D wavelet representation. 3D CNN based volume encoder $\mathcal{E}_{\mathrm{low}}$ , $\mathcal{E}_{\mathrm{high}}$ extract local spatio-temporal features in videos. These volumetric local features are exploited with the 2D projected latent $\mathbf{z}_{\mathrm{proj}}$ to reorganize fine-grained features. Instead of utilizing the unprocessed RGB video frame directly in the volume encoder, we employ the decomposed wavelet features as input. These decomposed wavelet features extracted from the 3D wavelet transform $\mathcal{W}$ provide coarse and detailed volume coefficient suited for video encoding. Extracting 3D wavelet latent can be formulated as follows: + +$$ +\mathcal {F} _ {\mathrm {l o w}} = \mathcal {E} _ {\mathrm {l o w}} (\mathbf {x} _ {\mathrm {l l l}}), +$$ + +$$ +\mathcal {F} _ {\text {h i g h}} = \mathcal {E} _ {\text {h i g h}} \left(\operatorname {C a t} \left(\mathbf {x} _ {\text {l l h}}, \dots , \mathbf {x} _ {\text {h h h}}\right)\right), \tag {3} +$$ + +$$ +\mathbf {z} _ {\mathrm {v o l}} = \operatorname {C a t} \left(\mathcal {F} _ {\mathrm {l o w}}, \mathcal {F} _ {\mathrm {h i g h}}\right). +$$ + +where $\mathbf{x}_{\mathrm{III}}$ denotes decomposed low-pass subband and the others $\mathbf{x}_{\mathrm{IIh}},\ldots ,X_{\mathrm{hhh}}$ denotes high-pass subband. The low-pass subband and high-pass subband are encoded to provide the coarse content and fine motion information. + +Fusing 2D triplane and 3D wavelet representations. As shown in Fig. 1, these 2D projected and 3D volume latent are integrated by cross-attention operation across the temporal and spatial axis. In this way, we can reinforce the volume-related inductive bias and rearrange fine-grained video latent for video generation. Formally, this cross-attention process can be formulated as follows: + +$$ +\mathbf {z} ^ {i} = \mathrm {C A} (\mathbf {z} _ {\mathrm {p r o j}} ^ {i}, \mathbf {z} _ {\mathrm {v o l}}) + \mathbf {z} _ {\mathrm {p r o j}} ^ {i}, +$$ + +$$ +\begin{array}{l} \mathbf {z} ^ {i} = \operatorname {F F N} \left(\mathbf {z} ^ {i}\right) + \mathbf {z} ^ {i}, \\ \tilde {\mathbf {\Sigma}} ^ {i} = C \Lambda (- i, - \infty), + - i \end{array} \tag {4} +$$ + +$$ +\tilde {\mathbf {z}} ^ {i} = \operatorname {C A} \left(\mathbf {z} ^ {i}, \mathbf {z} _ {\text {v o l}}\right) + \mathbf {z} ^ {i}, \tag {4} +$$ + +$$ +\mathbf {z} ^ {i + 1} = \mathrm {F F N} (\tilde {\mathbf {z}} ^ {i}) + \tilde {\mathbf {z}} ^ {i}, +$$ + +where $\mathrm{CA}(a,b)$ refers to Cross-Attention, with a representing the query and b representing the key and value. Additionally, FFN stands for FeedForward Network. Note that the input $\mathbf{z}_{\mathrm{proj}}^{0} = \mathbf{z}_{\mathrm{proj}}$ and the final output $\mathbf{z}$ . Then, we reconstruct the video $\tilde{\mathbf{x}}$ with video decoder $\mathcal{D}$ based on the refined hybrid features. + +$$ +\tilde {\mathbf {x}} = \mathcal {D} (\mathbf {z}), \tag {5} +$$ + +where $\mathbf{z} \in \mathbb{R}^{C \times S \times H' \times W'}$ . + +# 4.2 Loss function + +Our hybrid video autoencoder consists of three loss functions. In the following, we provide a brief overview and explain the training loss functions. Our training loss functions enable the preservation of frequency information during the video reconstruction process. Specifically, we enforce constraints both in the pixel space and the wavelet space. + +Reconstruction loss. The reconstruction loss $\mathcal{L}_{rec}$ denotes the similarity between the original input video and output video reconstructed by a model. The reconstruction loss term enforces the model to learn meaningful features in the encoding phase so that it can accurately reconstruct the input data in the decoding phase. We employ mean absolute error for reconstruction: + +$$ +\mathcal {L} _ {\text {r e c}} = \mathbb {E} _ {\mathbf {x} \sim \mathcal {X}} \left[ \| \mathbf {x} - \tilde {\mathbf {x}} \| _ {1} \right]. \tag {6} +$$ + +- Perceptual loss. The perceptual loss measures the difference between the feature map of input and a generated output in terms of perceptual similarity. Typically, this loss entails the extraction of feature maps from a pre-trained neural network. In contrast to reconstruction loss, which focuses solely on the pixel-level differences between videos, perceptual loss takes into account high level features such as textures and structures that humans perceive. + +$$ +\mathcal {L} _ {\mathrm {l p i p s}} = \mathbb {E} _ {\mathbf {x} \sim \mathcal {X}} \left[ \| f (\mathbf {x}) - f (\tilde {\mathbf {x}}) \| _ {1} \right]. \tag {7} +$$ + +where $f$ denotes the perceptual feature extractor. + +Frequency matching loss. Conventional methods typically rely on pixel-level losses in the spatial-temporal space. Since these loss functions closely match the original videos in pixel domain, the generated video's quality may not be sufficient potentially failing to capture the frequency information. Our frequency matching loss is designed to facilitate the model can learn frequency features with less optimization difficulty. This loss not only helps the model to recover missing frequency components but also enhances the overall reconstruction quality. We define the frequency matching loss as a reconstruction term in the wavelet domain: + +$$ +\mathcal {L} _ {\mathrm {f r e q}} = \mathbb {E} _ {\mathbf {x} \sim \mathcal {X}} \left[ \| \mathcal {W} _ {\mathbf {d}} (\mathbf {x}) - \mathcal {W} _ {\mathbf {d}} (\tilde {\mathbf {x}}) \| _ {1} \right], \mathbf {d} \in \{\mathrm {s}, \mathrm {h}, \mathrm {w} \}. \tag {8} +$$ + +where $\mathcal{W}_{\mathbf{d}}$ denotes three-dimensional discrete wavelet transform and $\mathbf{d}$ denotes the dimensions from which the wavelet transform is performed. + +Overall loss. Taking into account all the losses, the overall loss is formulated as follows: + +$$ +\mathcal {L} = \lambda_ {\text {r e c}} \mathcal {L} _ {\text {r e c}} + \lambda_ {\text {l p i p s}} \mathcal {L} _ {\text {l p i p s}} + \lambda_ {\text {f r e q}} \mathcal {L} _ {\text {f r e q}}, \tag {9} +$$ + +where $\lambda_{\mathrm{rec}} = \lambda_{\mathrm{lpips}} = 1$ and $\lambda_{\mathrm{freq}} = 0.5$ in our experiments. + +Note that, unlike previous works [5, 53] that focus on improving the temporal dynamics of generated videos through the use of a 3D discriminator, our video autoencoder achieves temporal realism in the reconstructed videos without the need for adversarial training. + +# 4.3 Diffusion Model-based Video Generator + +Leveraging the hybrid latent extracted from the video autoencoder, we train a diffusion-based video generator which learn the latent distribution $p(\mathbf{z})$ through the reverse process of the Markov Chain. + +Our diffusion model consists of two processes: the forward process and the reverse process. In forward process, the model gradually transforms the latent $\mathbf{z}_0\sim p(\mathbf{z}_0)$ toward a Gaussian distribution as formulated below: + +$$ +q \left(\mathbf {z} _ {t} \mid \mathbf {z} _ {t - 1}\right) = \mathcal {N} \left(\mathbf {z} _ {t}; \sqrt {1 - \beta_ {t}} \mathbf {z} _ {t - 1}, \beta_ {t} \mathbf {I}\right), \tag {10} +$$ + +$$ +q (\mathbf {z} _ {t} | \mathbf {z} _ {0}) = \mathcal {N} (\mathbf {z} _ {t}; \sqrt {\bar {\alpha} _ {t}} \mathbf {z} _ {0}, (1 - \bar {\alpha} _ {t}) \mathbf {I}). +$$ + +where $\bar{\alpha}_t = \prod_{i=1}^t (1 - \beta_i)$ and $\beta$ represents a pre-defined schedule for the variance. + +In the reverse process, the model is trained to gradually denoise the latent via the parameterized Gaussian transition. + +$$ +p _ {\theta} \left(\mathbf {z} _ {t - 1} \mid \mathbf {z} _ {t}\right) = \mathcal {N} \left(\mathbf {z} _ {t - 1}; \mu_ {\theta} \left(\mathbf {z} _ {t}, t\right), \sigma_ {t} ^ {2} \mathbf {I}\right), \tag {11} +$$ + +$$ +\mu_ {\theta} \left(\mathbf {z} _ {t}, t\right) = \frac {1}{\sqrt {\alpha_ {t}}} \left(\mathbf {z} _ {t} - \frac {\beta_ {t}}{\sqrt {1 - \bar {\alpha} _ {t}}} \epsilon_ {\theta} \left(\mathbf {z} _ {t}, t\right)\right), \tag {12} +$$ + +![](images/538594eb6a4e3942577e9a675644f38665ef168d9c5ea3769adcba23355e9f05.jpg) +Fig. 3: Applications for diverse video generator by our proposed HVDM. Our HVDM is adaptable for diverse video generation tasks depending on the type of condition latent $z_{c}$ . During training process, the condition latent $z_{c}$ is extracted from the video and jointly trained with the noised hybrid video latent $z_{t}$ . During the sampling process, these condition latent are supported to enable various video generation tasks, such as long video generation, image-to-video, and video dynamics control. + +where $\epsilon_{\theta}(\cdot)$ is a trainable denoising diffusion model which recovers a noisy sample $\mathbf{z}_t$ . The denoising diffusion model is trained to predict the noise with the following simplified objective: + +$$ +\mathcal {L} _ {\text {s i m p l e}} (\theta) := \left\| \epsilon_ {\theta} \left(\mathbf {z} _ {t}, t\right) - \epsilon \right\| _ {2} ^ {2}, \tag {13} +$$ + +where $\mathbf{z}_t = \sqrt{\bar{\alpha}_t}\mathbf{z}_0 + \sqrt{1 - \bar{\alpha}_t}\epsilon$ . + +To generate video samples from the latent space, we train a denoising diffusion model which follows the standard 3D U-Net architecture. The 3D U-Net architecture is composed of 3D convolution layers combined with skip connections. We employ a simplified 3D U-Net to denoise the latent $\mathbf{z}$ for the purpose of verifying the effectiveness of our video autoencoder. + +# 4.4 Applications for Diverse Video Generator + +We demonstrate that our method can be extended to a variety of video applications such as long video generation, image-to-video, and video dynamics control. + +Long video generation. To facilitate long video generation, our work follows the traditional frame prediction approach [13, 44, 53] where previous frame conditions are combined with future frames. Given two consecutive video clips $[\mathbf{x}^{\mathrm{prev}},\mathbf{x}^{\mathrm{next}}]$ of $\mathbf{x}^{\mathrm{prev}},\mathbf{x}^{\mathrm{next}}\in \mathbb{R}^{3\times S\times H\times W}$ , we can train the model to generate initial clips and future clips in a unified manner. More specifically, we can generate an initial clip with a null latent and extend the video by composing the condition with previous frame latent as follow: + +$$ +\mathbf {z} _ {c} ^ {\text {l o n g}} = \left\{ \begin{array}{l l} \mathcal {E} (\mathbf {x} ^ {\text {p r e v}}), & \text {i f f u t u r e c l i p ,} \\ 0, & \text {o t h e r w i s e ,} \end{array} \right. \tag {14} +$$ + +where $\mathcal{E}$ denotes our pre-trained hybrid encoder. + +Image-to-video. Image-to-video generation aims to synthesize a coherent video starting from an image. In general, videos are composed of a series of consecutive images, where the first frame serves as a representative depiction of the overall content within the video. To facilitate the process of image-to-video generation without introducing an additional image encoder, we repeatedly stack the first frame of the video on the temporal axis. Then, we use the latent $\mathcal{I}^{\mathrm{content}}$ extracted from our video encoder as the content condition. By leveraging the latent $\mathcal{I}^{\mathrm{content}}$ which capture the common content, we can effectively guide the model to generate coherent video sequence as follow: + +$$ +\mathcal {I} _ {\text {i m c 2 v i d}} ^ {\text {c o n t e n t}} = \left[ \mathbf {x} _ {0} ^ {1}, \dots , \mathbf {x} _ {0} ^ {1} \right] \in \mathbb {R} ^ {3 \times S \times H \times W}, \tag {15} +$$ + +$$ +\mathbf {z} _ {c} ^ {\mathrm {i m g 2 v i d}} = \mathcal {E} (\mathcal {I} ^ {\mathrm {c o n t e n t}}). +$$ + +Video dynamics control. Empowering users to control motion intensity in video creation provides flexibility with an improved user experience. Unfortunately, it was difficult to obtain motion-related labels from existing video collections for training diffusion models. To enable the alteration of motion intensity, we devise a method that learns motion dynamics with inter-frame variance. Specifically, we define the level of motion alteration as the structural dissimilarity between the semantic latent of the start and end frames. Since the structural dissimilarity encompasses both semantic and motion variance, we employ it as guiding cues to control motion without explicit motion labeled video. Formally, our structural dissimilarity is defined as follow: + +$$ +\mathbf {z} _ {c} ^ {\text {d y n a m i c s}} = \left\| \mathbf {z} _ {0} ^ {\mathrm {T}} - \mathbf {z} _ {0} ^ {1} \right\| _ {1}. \tag {16} +$$ + +Inspired by the classifier-free guidance techniques, we train a single diffusion model to jointly learn both the unconditional distribution $p(\mathbf{x})$ and the conditional distribution $p(\mathbf{x}^2|\mathbf{x}^1)$ . In particular, we train the conditional distribution $p(\mathbf{x}^2|\mathbf{x}^1)$ with condition-specific information (e.g., previous frame or content or dynamics latent) and the unconditional distribution using a null condition (e.g., $\mathbf{z}_c = 0$ ). The optimized objective can be formulated as follow: + +$$ +\mathbb {E} _ {\mathbf {x} _ {0}, \epsilon , t} [ \lambda | | \epsilon - \epsilon_ {\theta} (\mathbf {z} _ {t}, \mathbf {z} _ {c}, t) | | _ {2} ^ {2} + (1 - \lambda) | | \epsilon - \epsilon_ {\theta} (\mathbf {z} _ {t}, 0, t) | | _ {2} ^ {2} ], \tag {17} +$$ + +where $\mathbf{z}_0 = \mathcal{E}(\mathbf{x}_0),\mathbf{z}_t = \sqrt{\bar{\alpha}_t}\mathbf{z}_0 + \sqrt{1 - \bar{\alpha}_t}\epsilon$ and $\lambda \in (0,1)$ is a hyperparameter that guide a model to learn an unconditional and conditional distributions. + +# 5 Experiments + +# 5.1 Training Details + +Datasets. We conduct the experiments on three commonly-used benchmark datasets for the video generation task: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. UCF-101 [38] contains 13,320 videos from 101 action classes, offering a diverse range of human actions. SkyTimelapse [51] is composed of 5,000 + +
MethodUCF-101SkyTimelapseTaiChi
R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM
LVDM [13]----74.920.09131.210.778102.680.11227.630.729
PVDM [53]27.030.09527.030.74235.960.06132.710.82661.610.06826.870.715
HVDM (ours)5.350.03834.000.91520.760.04635.040.89121.510.02533.510.916
+ +Table 1: Quantitative comparison of reconstruction results on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. Our video autoencoder shows significantly superior performance across various metrics, providing more fine-grained comparison. + +![](images/791298341b1a253f041decfdb5e4f21f4911748e4037983901086bc9c72f4543.jpg) +Fig. 4: Qualitative reconstruction results on SkyTimelapse [51] dataset [34]. Our HVDM produces distinct and sharp edge details and faithfully expresses a fine structures in a video sequence. Additional samples are included in appendix. + +videos containing dynamic sky scenes. TaiChi [34] consists of full human bodies performing Tai-Chi actions. + +Training. The video autoencoder component for 2D projected latent stem from the PVDM [53], but the other wavelet-based frequency component is added. We train our models on 4 NVIDIA A100 GPUs for each autoencoding and diffusion process. See Appendix A for the details. + +# 5.2 Evaluation Details + +Baseline models. We compare our HVDM with the following video generation models: VideoGPT [52], MoCoGAN [40], MoCoGAN-HD [39], DIGAN [54], StyleGAN-V [36], LVDM [13], and PVDM [53]. We utilize official model weights and conduct training using the official code when the model weights are not available. + +Quantitative evaluations. To evaluate reconstruction quality, we use R-FVD [42], LPIPS [55], PSNR [20], and SSIM [18]. Here, R-FVD denotes FVD between reconstructed videos and the ground-truth videos. As for the evaluation of generation quality, we measure FVD [42] and KVD [41]. Considering different clip + +
VideoGPT MoCoGAN + StyleGAN2 MoCoGAN-HD DIGAN StyleGAN-V LVDM†
Train Split
UCF101 - FVD162880.62886.81821.41729.61630.21431.0N/A399.4303.1
UCF101 - FVD128N/A3679.02311.32606.52293.71773.4N/A505.0549.7
SkyTimelapse - FVD16222.7206.685.88164.183.1179.52318.963.542.8
SkyTimelapse - FVD128N/A575.9272.8878.1196.7197.0N/A134.7124.9
LVDM† PVDM† HVDM (Ours)LVDM† PVDM* HVDM (Ours)
Train SplitTrain+Test Split
UCF101 - KVD16N/A35.523.6TaiChi - FVD16120.9267.077.0
UCF101 - KVD128N/A37.734.4TaiChi - FVD128N/A339.2258.5
SkyTimelapse - KVD1621.733.11.5TaiChi - KVD1614.766.511.9
SkyTimelapse - KVD128N/A6.03.5TaiChi - KVD128N/A120.177.8
+ +Table 2: Quantitative comparison of video generation models on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. We evaluate FVD and KVD metrics (the lower values are better) and the best score are marked as bold. The overall score of other baselines are referenced from StyleGAN-V [37]. Methods marked with $\dagger$ denote the score is computed using official pretrained weights and $*$ denote the score is reproduced using official codes. We report evaluation details and sampling settings on Appendix B. + +![](images/7569e1d2cbd9a0abb151e4862c768ac93050b488be8fdf7cc956764f72bc4e07.jpg) +Fig. 5: Generated video sample by our HVDM on UCF-101 [38], SkyTime-lapse [51], and TaiChi datasets [34]. + +lengths, we denote $\mathrm{FVD}_{16}$ and $\mathrm{KVD}_{16}$ scores, as well as $\mathrm{FVD}_{128}$ and $\mathrm{KVD}_{128}$ scores for video clips with a length of 16 and 128. For a fair comparison, we follow the evaluation protocol of StyleGAN-V [37]; i.e., we use 2,048 real/fake video clips for evaluating FVD. See Appendix B for the details. + +# 5.3 Comparison Results + +Reconstruction results. Fig. 4 and Appendix F.1 show the performance of the reconstructed videos from our autoencoder and other diffusion-based video generative models. Our autoencoder presents a more accurate and clear reconstructed video compared to other baseline methods. In the Tab. 1, we demonstrate that our autoencoder achieves superior performance in all metrics for the three datasets. + +Generation results. We perform video generation on three datasets and compare the results with the other video generation methods. As shown in Fig. 5, our method is capable of generating not only monotonic motion videos such as Sky-Timelapse [51] and TaiChi [34] but also dynamic motion video UCF-101 [38], + +
BackboneProj.Adv.z shape dimensionR-FVD ↓ LPIPS ↓ PSNR ↑SSIM ↑
Video Transformer [4]✓-4 × (32 × 32 + 16 × 32 + 16 × 32)180.210.092
Video Transformer [4]✓✓4 × (32 × 32 + 16 × 32 + 16 × 32)27.030.095
3D CNN [22]--4 × 16 × 32 × 3286.730.057
3D CNN [22]-✓4 × 16 × 32 × 3221.690.064
Ours✓-4 × 16 × 32 × 325.350.038
34.00
0.915
+ +Table 3: Ablation study on various backbone architectures + +which contain complex action categories. Note that synthesizing high quality videos on a complex dataset like UCF-101 [38] has been a challenging problem where existing video generation method often struggle with producing natural motions with good quality. As shown in Tab. 2, our method achieves superior performance in the benchmark datasets. See Appendix F for more samples. + +# 5.4 Interpreting the frequency supervision + +![](images/6ddcc6f6df490d2ded008a1bf3202158ab458eb902dc735919383d74ec9ec14c.jpg) +Fig.6: Visualization of our hybrid representations. + +We perform visualization to understand how hybrid representation can help autoencoder to encode the 3D video pixels in Fig. 6. The decomposed 3D wavelet features is divided into low frequency and high frequency components, where each component conducts cross-attention operation with the 2D projected latent. As shown in Fig. 6, low frequency component captures static and dynamic regions and high frequency component captures the sharp edges and important details of video. To refine the ambiguity of the 2D project latent which contain global and abstract information, we incorporate these latent with + +frequency components. As a result, our autoencoder figures out where the objects are located and how object's motion occurs in the video. + +# 5.5 Ablation study on backbone architectures + +We conduct verification of performance based on the autoencoder's backbone architecture on UCF-101 dataset. As shown in Tab. 3, our hybrid autoencoder demonstrates effectiveness in capturing both perceptual details and temporal coherence in the video. We can observe that 3D CNN-based autoencoder show better performance compared to the 2D triplane-based autoencoder since it has more latent dimensions. Although the 2D triplane-based autoencoder effectively compresses latent dimensions, enhancing temporal coherence necessitates adversarial training with a 3D discriminator. Our hybrid autoencoder integrates the strengths of both architectures, achieving superior performance. + +# 5.6 Ablation study on fusing modules + +We verify several experiments to assess how the fusing module affects the performance of our hybrid autoencoder on UCF-101 dataset. For feature fusion, we adopted two different modules: 1) the concatenation module 2) the cross-attention module. We also validated the effectiveness of wavelet decomposition by comparing the results which use raw RGB video as input. As shown in Tab. 4, the experimental results show that the cross-attention module and wavelet-decomposed components contribute to the improvement of reconstruction performance. We analyze that utilizing the temporal and spatial attention module facilitate the integration of different 2D triplane and 3D wavelet representation through the comparison of features at different spatial locations. + +
Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑
Baseline27.030.09527.030.742Baseline + RGB (Cross-attn.)6.320.03833.790.908
Baseline + RGB (Concat.)20.370.06331.020.831Baseline + Low Freq. (Cross-attn.)6.870.04033.690.909
Baseline + Low Freq. (Concat.)34.390.07830.500.816Baseline + High Freq. (Cross-attn.)6.970.04733.200.899
Baseline + High Freq. (Concat.)14.960.06131.320.838
Baseline + Low & High Freq. (Concat.)9.920.05132.690.871Ours5.350.03734.000.915
+ +# 5.7 Ablation study on frequency matching loss + +We validate the effectiveness of frequency matching loss (FML) on UCF-101 dataset in Tab. 5. The result shows that utilizing the FML term leads to a remarkable reduction in the FVD score by approximately 2.73 points demonstrating its effectiveness in enhancing the temporal coherency. Furthermore, evaluation metrics related to perceptual details also improved to 0.003 points for LPIPS, 0.33 points for PSNR, and 0.023 points for SSIM respectively. Based on these results, the FML verifies that aligning frequency components allow the HVDM to enhance temporal changes and perceptual quality of generated videos. + +Table 4: Ablation study on feature fusing module. + +
MethodR-FVD ↓LPIPS ↓PSNR ↑SSIM ↑
HVDM (w/o FML)8.080.04133.670.892
HVDM (w/ FML)5.350.03834.000.915
+ +Table 5: Ablation study on frequency matching loss. + +# 6 Conclusion + +We proposed a novel hybrid video autoencoder for video generation using diffusion model, dubbed HVDM. We investigated the effectiveness of our hybrid architecture that combines 2D projected and 3D volume representation, leveraging the strengths of frequency matching loss. By incorporating these representations with spatio-temporal cross-attention, HVDM generates high-quality videos with improved realism. Our extensive experiments on benchmark datasets demonstrated the superior performance, compared to the other baseline methods. + +# Acknowledgements + +This research was supported by the National Supercomputing Center in Korea (KISTI) (TS-2023-RG-0004), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No.2022R1C1C1008496, RS-2024-00346597), Institute of Information & communications Technology Planning & Evaluation(IITP) grant funded by the Korea government(MSIT) (No.RS-2020-II201336, Artificial Intelligence graduate school support(UNIST), RS-2021-II212068, Comprehensive Video Understanding and Generation with Knowledge-based Deep Logic Neural Network), and Culture, Sports, and Tourism R&D Program through the Korea Creative Content Agency grant funded by the Ministry of Culture, Sports and Tourism (Research on neural watermark technology for copyright protection of generative AI 3D content, RS-2024-00348469, RS-2024-00333068). + +# References + +1. Ajay, A., Han, S., Du, Y., Li, S., Gupta, A., Jaakkola, T., Tenenbaum, J., Kaelbling, L., Srivastava, A., Agrawal, P.: Compositional foundation models for hierarchical planning. arXiv preprint arXiv:2309.08587 (2023) +2. An, J., Zhang, S., Yang, H., Gupta, S., Huang, J.B., Luo, J., Yin, X.: Latent-shift: Latent diffusion with temporal shift for efficient text-to-video generation. arXiv preprint arXiv:2304.08477 (2023) +3. Anciukevicius, T., Xu, Z., Fisher, M., Henderson, P., Bilen, H., Mitra, N.J., Guerrero, P.: Renderdiffusion: Image diffusion for 3d reconstruction, inpainting and generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12608-12618 (2023) +4. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021) +5. Blattmann, A., Rombach, R., Ling, H., Dockhorn, T., Kim, S.W., Fidler, S., Kreis, K.: Align your latents: High-resolution video synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22563-22575 (2023) +6. Ceylan, D., Huang, C.H.P., Mitra, N.J.: Pix2video: Video editing using image diffusion. arXiv preprint arXiv:2303.12688 (2023) +7. Chan, E.R., Lin, C.Z., Chan, M.A., Nagano, K., Pan, B., De Mello, S., Gallo, O., Guibas, L.J., Tremblay, J., Khamis, S., et al.: Efficient geometry-aware 3d generative adversarial networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16123-16133 (2022) +8. Chan, E.R., Monteiro, M., Kellnhofer, P., Wu, J., Wetzstein, G.: Pi-GAN: Periodic implicit generative adversarial networks for 3D-aware image synthesis. In: CVPR (2021) +9. Çiçek, Ö., Abdulkadir, A., Lienkamp, S.S., Brox, T., Ronneberger, O.: 3d u-net: learning dense volumetric segmentation from sparse annotation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2016: 19th International Conference, Athens, Greece, October 17-21, 2016, Proceedings, Part II 19. pp. 424-432. Springer (2016) + +10. Dai, Y., Yang, M., Dai, B., Dai, H., Nachum, O., Tenenbaum, J., Schuurmans, D., Abbeel, P.: Learning universal policies via text-guided video generation. arXiv preprint arXiv:2302.00111 (2023) +11. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. arXiv preprint arXiv:2302.03011 (2023) +12. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. In: International Conference on Machine Learning. pp. 11808-11826. PMLR (2023) +13. He, Y., Yang, T., Zhang, Y., Shan, Y., Chen, Q.: Latent video diffusion models for high-fidelity video generation with arbitrary lengths. arXiv preprint arXiv:2211.13221 (2022) +14. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., Salimans, T.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022) +15. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems (2020) +16. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models, 2022. URL https://arxiv.org/abs/2204.03458 +17. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models. arXiv preprint arXiv:2204.03458 (2022) +18. Hore, A., Ziou, D.: Image quality metrics: Psnr vs. sSIM. In: 2010 20th international conference on pattern recognition. pp. 2366-2369. IEEE (2010) +19. Hu, Y., Chen, Z., Luo, C.: Lamd: Latent motion diffusion for video generation. arXiv preprint arXiv:2304.11603 (2023) +20. Huynh-Thu, Q., Ghanbari, M.: Scope of validity of psnr in image/video quality assessment. Electronics letters 44(13), 800-801 (2008) +21. Kalchbrenner, N., Oord, A., Simonyan, K., Danihelka, I., Vinyals, O., Graves, A., Kavukcuoglu, K.: Video pixel networks. In: ICML (2017) +22. Karpathy, A., Toderici, G., Shetty, S., Leung, T., Sukthankar, R., Fei-Fei, L.: Large-scale video classification with convolutional neural networks. In: CVPR (2014) +23. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023) +24. Li, Y., Min, M., Shen, D., Carlson, D., Carin, L.: Video generation from text. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018) +25. Liu, S., Zhang, Y., Li, W., Lin, Z., Jia, J.: Video-p2p: Video editing with cross-attention control. arXiv preprint arXiv:2303.04761 (2023) +26. Ma, X., Wang, Y., Jia, G., Chen, X., Liu, Z., Li, Y.F., Chen, C., Qiao, Y.: Latte: Latent diffusion transformer for video generation. arXiv preprint arXiv:2401.03048 (2024) +27. Mei, K., Patel, V.M.: Vidm: Video implicit diffusion models. In: AAAI (2023) +28. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: Proceedings of the 25th ACM international conference on Multimedia. pp. 1789-1798 (2017) +29. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023) + +30. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023) +31. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10219-10228 (2023) +32. Schwarz, K., Liao, Y., Niemeyer, M., Geiger, A.: Graf: Generative radiance fields for 3d-aware image synthesis. In: Advances in Neural Information Processing Systems (NeurIPS) (2020) +33. Secker, A., Taubman, D.: Highly scalable video compression using a lifting-based 3d wavelet transform with deformable mesh motion compensation. In: Proceedings. International Conference on Image Processing. vol. 3, pp. 749-752. IEEE (2002) +34. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: First order motion model for image animation. In: NeurIPS (2019) +35. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. In: ICLR (2023) +36. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: StyleGAN-V: A continuous video generator with the price, image quality and perks of StyleGAN2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022) +37. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: Stylegan-v: A continuous video generator with the price, image quality and perks of stylegan2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3626-3636 (2022) +38. Soomro, K., Zamir, A.R., Shah, M.: UCF101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012) +39. Tian, Y., Ren, J., Chai, M., Olszewski, K., Peng, X., Metaxas, D.N., Tulyakov, S.: A good image generator is what you need for high-resolution video synthesis. In: ICLR (2021) +40. Tulyakov, S., Liu, M.Y., Yang, X., Kautz, J.: MoCoGAN: Decomposing motion and content for video generation. In: CVPR (2018) +41. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018) +42. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Fvd: A new metric for video generation. In: DGS@ICLR (2019), https://apisemantic scholar.org/CorpusID:198489709 +43. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017) +44. Voleti, V., Jolicoeur-Martineau, A., Pal, C.: Mcvd-masked conditional video diffusion for prediction, generation, and interpolation. Advances in Neural Information Processing Systems 35, 23371-23385 (2022) +45. Vondrick, C., Pirsiavash, H., Torralba, A.: Generating videos with scene dynamics. In: NeurIPS (2016) +46. Wang, B., Wang, Y., Selesnick, I., Vetro, A.: Video coding using 3d dual-tree wavelet transform. EURASIP Journal on Image and Video Processing 2007, 1-15 (2007) +47. Wang, J., Huang, K.: Medical image compression by using three-dimensional wavelet transformation. IEEE Transactions on Medical Imaging 15(4), 547-554 (1996) + +48. Wang, T., Zhang, B., Zhang, T., Gu, S., Bao, J., Baltrusaitis, T., Shen, J., Chen, D., Wen, F., Chen, Q., et al.: Rodin: A generative model for sculpting 3d digital avatars using diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4563-4573 (2023) +49. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019) +50. Wu, J.Z., Ge, Y., Wang, X., Lei, W., Gu, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. arXiv preprint arXiv:2212.11565 (2022) +51. Xiong, W., Luo, W., Ma, L., Liu, W., Luo, J.: Learning to generate time-lapse videos using multi-stage dynamic generative adversarial networks. In: CVPR (2018) +52. Yan, W., Zhang, Y., Abbeel, P., Srinivas, A.: VideoGPT: Video generation using VQ-VAE and transformers. arXiv preprint arXiv:2104.10157 (2021) +53. Yu, S., Sohn, K., Kim, S., Shin, J.: Video probabilistic diffusion models in projected latent space. arXiv preprint arXiv:2302.07685 (2023) +54. Yu, S., Tack, J., Mo, S., Kim, H., Kim, J., Ha, J.W., Shin, J.: Generating videos with dynamics-aware implicit generative adversarial networks. In: The Tenth International Conference on Learning Representations (2022) +55. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018) +56. Zhou, D., Wang, W., Yan, H., Lv, W., Zhu, Y., Feng, J.: Magicvideo: Efficient video generation with latent diffusion models. arXiv preprint arXiv:2211.11018 (2022) \ No newline at end of file diff --git a/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/images.zip b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..f20777b161a546c236b576de7d6a78c1df7786aa --- /dev/null +++ b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:34981dc85f550c6bf8e7db4c43c3f35fe0420159057c665fa6bab66a0122e5c8 +size 595881 diff --git a/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/layout.json b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..863939faca5b25d19c3349637c01a8fb7b4e071b --- /dev/null +++ b/2024/Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation/layout.json @@ -0,0 +1,9949 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 135, + 111, + 479, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 111, + 479, + 148 + ], + "spans": [ + { + "bbox": [ + 135, + 111, + 479, + 148 + ], + "type": "text", + "content": "Hybrid Video Diffusion Models with 2D Triplane and 3D Wavelet Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "spans": [ + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "content": "Kihong Kim " + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "content": ", Haneol Lee " + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "content": ", Jihye Park " + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "content": ", Seyeon Kim " + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "content": ", Kwanghee Lee " + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "content": ", Seungryong Kim " + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "inline_equation", + "content": "^{†3}" + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "text", + "content": ", and Jaejun Yoo " + }, + { + "bbox": [ + 165, + 167, + 449, + 194 + ], + "type": "inline_equation", + "content": "^{†2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "spans": [ + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "text", + "content": "VIVE STUDIOS " + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "text", + "content": "UNIST " + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "text", + "content": "Korea University " + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "inline_equation", + "content": "\\{\\mathrm{h} \\times \\mathrm{n} \\times \\mathrm{g} \\mathrm{i} \\mathrm{e} \\mathrm{e}, \\mathrm{l} \\times \\mathrm{k} \\times \\mathrm{w} \\mathrm{a} \\mathrm{g} \\mathrm{h} \\mathrm{e} \\mathrm{e}\\} @" + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "text", + "content": "gmail.com " + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "inline_equation", + "content": "\\{\\mathrm{h} \\times \\mathrm{n} \\times \\mathrm{e} \\mathrm{t} \\mathrm{l} \\times \\mathrm{e}, \\mathrm{j} \\times \\mathrm{n} \\times \\mathrm{u} \\mathrm{e} \\mathrm{u} \\mathrm{r} \\mathrm{y} \\mathrm{o} \\mathrm{g}, \\mathrm{k} \\times \\mathrm{m} \\times \\mathrm{u} \\mathrm{n} \\mathrm{i} \\mathrm{s} \\mathrm{t}. \\mathrm{a} \\mathrm{c}. \\mathrm{k} \\mathrm{r}\\}" + }, + { + "bbox": [ + 195, + 201, + 419, + 258 + ], + "type": "text", + "content": " {ghp1112, kimse2878, seungryong_kim}@korea.ac.kr https://hxngiee.github.io/HVDM" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 288, + 455, + 531 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 288, + 455, + 531 + ], + "spans": [ + { + "bbox": [ + 160, + 288, + 455, + 531 + ], + "type": "text", + "content": "Abstract. Generating high-quality videos that synthesize desired realistic content is a challenging task due to their intricate high dimensionality and complexity. Several recent diffusion-based methods have shown comparable performance by compressing videos to a lower-dimensional latent space, using traditional video autoencoder architecture. However, such method that employ standard frame-wise 2D or 3D convolution fail to fully exploit the spatio-temporal nature of videos. To address this issue, we propose a novel hybrid video diffusion model, called HVDM, which can capture spatio-temporal dependencies more effectively. HVDM is trained by a hybrid video autoencoder which extracts a disentangled representation of the video including: (i) a global context information captured by a 2D projected latent, (ii) a local volume information captured by 3D convolutions with wavelet decomposition, and (iii) a frequency information for improving the video reconstruction. Based on this disentangled representation, our hybrid autoencoder provide a more comprehensive video latent enriching the generated videos with fine structures and details. Experiments on standard video generation benchmarks such as UCF101, SkyTimelapse, and TaiChi demonstrate that the proposed approach achieves state-of-the-art video generation quality, showing a wide range of video applications (e.g., long video generation, image-to-video, and video dynamics control). The source code and pre-trained models will be publicly available once the paper is accepted." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 540, + 450, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 540, + 450, + 552 + ], + "spans": [ + { + "bbox": [ + 160, + 540, + 450, + 552 + ], + "type": "text", + "content": "Keywords: Video Diffusion " + }, + { + "bbox": [ + 160, + 540, + 450, + 552 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 540, + 450, + 552 + ], + "type": "text", + "content": " Wavelet Transform " + }, + { + "bbox": [ + 160, + 540, + 450, + 552 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 540, + 450, + 552 + ], + "type": "text", + "content": " Generative Models" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 572, + 231, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 572, + 231, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 572, + 231, + 586 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "content": "Video generation has received a lot of attention in the computer vision and graphics fields due to its broad applications in making films, creating animations, simulating environments, etc [1,5,6,10,23]. Nonetheless, video generation remains a challenging task because of the high-dimensionality and complexity inherent" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 142, + 653, + 238, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 653, + 238, + 666 + ], + "spans": [ + { + "bbox": [ + 142, + 653, + 238, + 666 + ], + "type": "text", + "content": "†Corresponding author" + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "in video data. The primary difficulty lies in producing high-quality video frames that are both visually appealing and dynamically coherent." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 144, + 482, + 323 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 144, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 144, + 482, + 323 + ], + "type": "text", + "content": "By leveraging the recent advancements of image-based diffusion models [14, 15], a variety of video diffusion methods have emerged [17,27,31]. These methods show considerable promise in modeling video distributions and synthesizing visually plausible results. However, they often face efficiency challenge due to operating in pixel space. To address this challenge, several recent latent video diffusion models have been developed, training within a compressed latent space to reduce computational demands [2,11,13,56,56]. While these latent diffusion models exhibit improved scaling properties with reduced complexity, the potential of novel autoencoder designs remains largely unexplored. There exist conventional approaches, employing standard 2D or 3D CNN-based autoencoders for video generation [13,17,19,35]. Yet, these CNN-based architectures struggle with effectively managing the overall spatio-temporal structure of videos. While transformers might be considered as a solution, their direct application to video representation learning can lead to significant computational time and memory inefficiency [21,49]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 327, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 327, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 482, + 445 + ], + "type": "text", + "content": "Unlike the aforementioned approaches, PVDM [53] offers a novel perspective in video generation. PVDM simplifies video complexity by adopting a triplane representation, where video data is factorized into 2D projected latents across different spatio-temporal directions in a latent space. This method has demonstrated improved generation results over previous works such as StyleGAN-based approaches [36] and other diffusion models [17], particularly in effectively representing intricate video data. Despite its progress, they encounter inherent limitations due to the reduction of higher-dimensional video data into lower-dimensional spaces. More specifically, the 2D projected latents struggle to fully recover the 3D structure of video volume, lacking crucial volume information." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": "Motivated by these observations, we propose a novel hybrid video diffusion model designed to comprehensively capture the spatio-temporal dependencies of video, called HVDM. Rather than reinventing the wheel, we leverage these known characteristics to enhance effectiveness in video generation tasks. Our video autoencoder combines transformer for 3D-to-2D projections and the 3D CNNs to effectively utilize both global context and local volume information in video. We first start from a well-known fact that transformers excel at capturing long-range dependencies, and we employ them to acquire the global context of the video. To compensate the limited inductive bias of transformers, we leverage 3D CNNs to provide local volume details, drawing from the recognized advantage of 3D CNNs in capturing short-range spatio-temporal information. More specifically, our proposed autoencoder builds the strengths of both architectures by incorporating global 2D projected and local 3D volume latent representations. These two types of latent representations mutually enhance each other through cross-attention module that operates along both the temporal and spatial axes. Taking this approach further, we pose the question of whether it is possible to exploit frequency information for boosting the video reconstruction process. We find that employing 3D discrete wavelet transform could potentially resolve the" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 114, + 479, + 294 + ], + "blocks": [ + { + "bbox": [ + 137, + 114, + 479, + 294 + ], + "lines": [ + { + "bbox": [ + 137, + 114, + 479, + 294 + ], + "spans": [ + { + "bbox": [ + 137, + 114, + 479, + 294 + ], + "type": "image", + "image_path": "4ed2b1ce79277c2706e4734aa5ae669ce33c3bee0b2af763f21b408037add878.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 301, + 482, + 357 + ], + "lines": [ + { + "bbox": [ + 130, + 301, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 301, + 482, + 357 + ], + "type": "text", + "content": "Fig. 1: Overview of our hybrid video autoencoder in HVDM that combines a 2D triplane and 3D volume representation for video encoding. The 2D triplane representation provides global context and 3D volume representation providing local volume information of video. The spatio-temporal cross-attention module incorporates these distinctive features to organize fine-grained video representation." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 371, + 482, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 371, + 482, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 371, + 482, + 491 + ], + "type": "text", + "content": "problem of limited receptive fields in 3D CNNs. Specifically, considering that the 3D discrete wavelet transform reduces the video's size by half in the frequency domain, it allows us to expand the receptive field without losing information. Additionally, using 3D discrete wavelet transform decompose complex video into different frequency components at multiple levels of details, providing rich video representation. Finally, by training the video autoencoder with both reconstruction and frequency matching loss in the pixel and spectral spaces, frequency matching loss improved visual quality during video reconstruction process. As a result, we observe that the integration of wavelet-based features provides benefit compared to the use of raw video data by enabling more nuanced video encoding." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 491, + 482, + 575 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 482, + 575 + ], + "type": "text", + "content": "To validate the effectiveness of our method, we demonstrate a wide range of video applications including unconditional video generation, long video generation, image-to-video, and video dynamics control. Here, we use three benchmark datasets for video generation: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. Both quantitative and qualitative results demonstrate video generation capabilities of our method, showing superior performance over the state-of-the-art approaches." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 593, + 238, + 605 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 593, + 238, + 605 + ], + "spans": [ + { + "bbox": [ + 132, + 593, + 238, + 605 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Video generation. Video generation methods have been developed based on deep generative models, such as variational autoencoder (VAEs), generative adversarial networks (GANs), and diffusion models (DMs). Early work [24, 28] attempted to employ VAEs and GANs-based models to generate frames in an" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": "autoregressive manner. However, they fail to produce desired results due to the difficulty of modeling spatial-temporal changes and their results limited to low resolutions. Another work [45] introduce a spatio-temporal convolutional architecture that effectively disentangles the scene's foreground and background. MoCoGAN [40] propose the motion and content decomposed generative adversarial network that generates a video by translating a sequence of random vectors into a sequence of video frames. Although each of these methods show encouraging results for video generation, GAN-based models often suffer from unstable training and fall into mode collapse. In contrast, diffusion models have demonstrated new possibilities for video generation, leveraging a stable training scheme and robust representation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 255, + 482, + 339 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 255, + 482, + 339 + ], + "spans": [ + { + "bbox": [ + 130, + 255, + 482, + 339 + ], + "type": "text", + "content": "Diffusion models. Inspired by the success of image-based diffusion models, a series of video diffusion models [2, 11, 25, 30, 50, 56] are proposed. These models leverage the pre-trained image diffusion models and extend their application to videos. While they are capable of efficient learning with just a few computation powers, there are some difficulties in creating consistent and photo-realistic video content. Since they generate videos on a frame-by-frame basis, they face challenges in achieving temporal consistency and producing long video results." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 340, + 482, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 340, + 482, + 425 + ], + "spans": [ + { + "bbox": [ + 130, + 340, + 482, + 425 + ], + "type": "text", + "content": "On the other hand, recent videos diffusion models [16, 26, 31, 44] proposed methods for learning video from scratch by adopting various model architectures [9, 29]. While they are capable of generating high fidelity results that are both temporally consistent and realistic, these methods are still limited in computation and memory inefficiency. To overcome these inefficiency, latent diffusion methods [13, 19, 53] have emerged which train the model in low-dimensional latent space while maintaining their perceptual quality." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 431, + 482, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 431, + 482, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 431, + 482, + 529 + ], + "type": "text", + "content": "Triplane representations. The effectiveness of triplane representation has already found in 3D-aware generation works [3,7,8,12,32,48]. These triplane representation methods have been shown to offer an effective compression benefits by projecting the 3D volume as 2D-shaped latent features. By taking advantage of these triplane representation, PVDM [53] achieves comparable results in the video generation task, encoding the cubic structure of video pixels. Inspired by this, we present an improved video encoding method that exploit the 2D projected latent with wavelet-based 3D volume latent." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 545, + 234, + 558 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 234, + 558 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 234, + 558 + ], + "type": "text", + "content": "3 Preliminaries" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 571, + 436, + 583 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 571, + 436, + 583 + ], + "spans": [ + { + "bbox": [ + 130, + 571, + 436, + 583 + ], + "type": "text", + "content": "3.1 2D Triplane Representation for Video Diffusion Model" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": "Given a video sample " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": " with time " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ", height " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ", and width " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ", the triplane autoencoder encodes it as three 2D projected latent " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}}, \\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}}, \\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}]" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}} \\in \\mathbb{R}^{C \\times H' \\times W'}" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}} \\in \\mathbb{R}^{C \\times S \\times W'}" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}} \\in \\mathbb{R}^{C \\times S \\times H'}" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ". We denote " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": " as number of channels, " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "H' = H / d" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "W' = W / d" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": " for downsampling factors " + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "inline_equation", + "content": "d > 1" + }, + { + "bbox": [ + 130, + 590, + 482, + 667 + ], + "type": "text", + "content": ". Unlike conventional video autoencoder which depends on frame-wise 2D or 3D convolution networks [13,17,19,35], the PVDM [53] effectively decompose" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 178 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 178 + ], + "type": "text", + "content": "the 3D data using video transformer [4] for projections " + }, + { + "bbox": [ + 130, + 115, + 482, + 178 + ], + "type": "inline_equation", + "content": "\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]" + }, + { + "bbox": [ + 130, + 115, + 482, + 178 + ], + "type": "text", + "content": ". The utilization of these latent vectors " + }, + { + "bbox": [ + 130, + 115, + 482, + 178 + ], + "type": "inline_equation", + "content": "\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]" + }, + { + "bbox": [ + 130, + 115, + 482, + 178 + ], + "type": "text", + "content": " offers several advantages in terms of achieving both computation and memory efficiency. Furthermore, their image-like structure enables the efficient video generation from the latent space reducing the dimensionality of the data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 204, + 299, + 216 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 204, + 299, + 216 + ], + "spans": [ + { + "bbox": [ + 131, + 204, + 299, + 216 + ], + "type": "text", + "content": "3.2 3D Wavelet Representation" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "text", + "content": "3D Wavelet transform is a classical algorithm widely used in medical imaging and video compression to separate different frequency components within the data [33,46,47]. Just as the 2D wavelet transform, given " + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "inline_equation", + "content": "\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}" + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "text", + "content": ", the 3D wavelet transform operates along " + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 130, + 232, + 482, + 327 + ], + "type": "text", + "content": " direction decomposing the 3D volume into different subbands. These subbands are factorized into low and high subbands where the low subband express the slowly changing part of the data and the high subband contain fine details capturing sharp edges and rapid transitions within the data." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": "Specifically, it can be defined as discrete wavelet transform (DWT) and discrete inverse wavelet transform (IWT). In general, Haar wavelets is commonly employed in a variety of real-world applications due to their simplicity. Different types of filters, including low-pass and high-pass filters, divide the volume input " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "\\mathbf{x} \\in \\mathbb{R}^{3 \\times S \\times H \\times W}" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": " into distinct frequency sub-bands " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{lll}}" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{llh}}" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{lhl}}" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{hlh}}" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{hhll}}" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{hhh}}" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": " with a size of " + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "inline_equation", + "content": "S / 2 \\times H / 2 \\times W / 2" + }, + { + "bbox": [ + 130, + 329, + 299, + 495 + ], + "type": "text", + "content": ". Where the low-frequency components provide the long-term av" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 496, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 496, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 496, + 482, + 533 + ], + "type": "text", + "content": "erages information, while the high-frequency components provide information about local changes. In Fig. 2, we visualize a one level of 3D discrete wavelet decomposition." + } + ] + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 309, + 330, + 482, + 423 + ], + "blocks": [ + { + "bbox": [ + 309, + 330, + 482, + 423 + ], + "lines": [ + { + "bbox": [ + 309, + 330, + 482, + 423 + ], + "spans": [ + { + "bbox": [ + 309, + 330, + 482, + 423 + ], + "type": "image", + "image_path": "a379e64dd8e197ec099013da664e3b3b2608f9bad9b54e5ec261781f1c527fe7.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 432, + 482, + 486 + ], + "lines": [ + { + "bbox": [ + 304, + 432, + 482, + 486 + ], + "spans": [ + { + "bbox": [ + 304, + 432, + 482, + 486 + ], + "type": "text", + "content": "Fig.2: Visualization of 3D wavelet transform. The volume of video is decomposed into eight subband " + }, + { + "bbox": [ + 304, + 432, + 482, + 486 + ], + "type": "inline_equation", + "content": "(\\mathbf{x}_{\\mathrm{lll}},\\dots ,\\mathbf{x}_{\\mathrm{hhh}})" + }, + { + "bbox": [ + 304, + 432, + 482, + 486 + ], + "type": "text", + "content": " including low and high frequency components." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 559, + 233, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 559, + 233, + 574 + ], + "spans": [ + { + "bbox": [ + 131, + 559, + 233, + 574 + ], + "type": "text", + "content": "4 Methodology" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "content": "Our hybrid video autoencoder is illustrated in Fig. 1. We first describe the overall video encoding architecture in Sec 4.1. In the following, we present the training objective which enforce constraints in both pixel space and the wavelet space in Sec 4.2. Then, we formalize the diffusion-based video generation framework in Sec 4.3. Lastly, we introduce various video applications using video diffusion model in Sec 4.4." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 351, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 351, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 351, + 129 + ], + "type": "text", + "content": "4.1 Designing Hybrid Video Autoencoder" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 133, + 482, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 133, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 133, + 482, + 182 + ], + "type": "text", + "content": "To train a video diffusion model generating high quality results, it is necessary to have an expressive video representation that accounts for inclusive information of video data. To satisfy this requirement, we construct hybrid representations by combining 2D triplane and 3D wavelet representation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 186, + 482, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 186, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 482, + 258 + ], + "type": "text", + "content": "2D triplane representation. The 2D projected latent which is originated from PVDM [53] is extracted by 3D-to-2D projections mapping at each spatiotemporal direction to encode 3D video pixels. As shown in Sec 3.1, the 2D image-like latent " + }, + { + "bbox": [ + 130, + 186, + 482, + 258 + ], + "type": "inline_equation", + "content": "\\left[\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hw}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{ws}},\\mathbf{z}_{\\mathrm{proj}}^{\\mathrm{hs}}\\right]" + }, + { + "bbox": [ + 130, + 186, + 482, + 258 + ], + "type": "text", + "content": " can be encoded with a combination of a video encoder [4] and a small transformer [43]. Formally, the projected latent is formulated as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 238, + 262, + 323, + 275 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 262, + 323, + 275 + ], + "spans": [ + { + "bbox": [ + 238, + 262, + 323, + 275 + ], + "type": "interline_equation", + "content": "[ u _ {\\mathrm {s h w}} ] := \\mathcal {T} _ {\\mathrm {v i d e o}} ^ {\\mathrm {s h w}} (\\mathbf {x}),", + "image_path": "409b913ebff6be4355676c7e6487c9a390c5b1ef1bd4663e3588ba10402a377e.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 242, + 278, + 481, + 300 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 278, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 242, + 278, + 481, + 300 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {h w}} := \\mathcal {T} _ {\\text {p r o j}} ^ {\\mathrm {s}} \\left(u _ {1 \\mathrm {h w}}, \\dots , u _ {\\mathrm {S h w}}\\right),", + "image_path": "4d7dbe995d145bc1c1f1e291f130115131615bea16fdb82fba8663a664f9ba70.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 242, + 289, + 480, + 310 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 289, + 480, + 310 + ], + "spans": [ + { + "bbox": [ + 242, + 289, + 480, + 310 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\text {p r o j} \\\\ \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {w s}} := \\mathcal {T} _ {\\text {p r o j}} ^ {\\mathrm {h}} \\left(u _ {\\mathrm {s l w}}, \\dots , u _ {\\mathrm {s H ^ {\\prime} w}}\\right), \\end{array} \\tag {1}", + "image_path": "62d7e9dda32fe70b009d7e8175511496b4310eb81563a2dde7fa7b2eacad7ab3.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 242, + 312, + 376, + 327 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 312, + 376, + 327 + ], + "spans": [ + { + "bbox": [ + 242, + 312, + 376, + 327 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {h s}} := \\mathcal {T} _ {\\mathrm {p r o j}} ^ {\\mathrm {w}} \\left(u _ {\\mathrm {s h} 1}, \\dots , u _ {\\mathrm {s h W} ^ {\\prime}}\\right),", + "image_path": "7ece4e1c55eeab222b8d89e33e01f4f86a664096b545acd1c1d1c158d2933ede.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "inline_equation", + "content": "\\mathcal{T}_{\\mathrm{video}}^{\\mathrm{shw}}" + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "text", + "content": " denotes a video-to-3D-latent encoder such as video transformer [4] and " + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "inline_equation", + "content": "\\mathcal{T}_{\\mathrm{proj}} = [\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{s}},\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{h}},\\mathcal{T}_{\\mathrm{proj}}^{\\mathrm{w}}]" + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "text", + "content": " denotes a small transformer [43] for projections. While projected latent provide a global information of video with a computational efficiency, this transformer architecture projecting a triplane leads to lossy compression due to the lack of local volume information. Moreover, the weak inductive bias of the transformer leads to a slower convergence speed for the model. To overcome these limitations, we transformed the 2D projected latent into a 3D volume and complemented it with the 3D volume representation. Converting a 2D projected latent into a 3D volume " + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_{\\mathrm{proj}}" + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "text", + "content": " is formulated as follows:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 239, + 447, + 349, + 463 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 447, + 349, + 463 + ], + "spans": [ + { + "bbox": [ + 239, + 447, + 349, + 463 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s} ^ {\\prime} \\mathrm {h w}} := [ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {1 \\mathrm {h w}}, \\dots , \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {S h w}} ],", + "image_path": "7cc0a91d1185c5d4170fc924856886c6b2213b6d33752f9d072a38d768232d46.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 239, + 464, + 480, + 486 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 464, + 480, + 486 + ], + "spans": [ + { + "bbox": [ + 239, + 464, + 480, + 486 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} := \\left[ \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s l w}}, \\dots , \\mathbf {z} _ {\\text {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} \\right], \\tag {2}", + "image_path": "8a83aa7e1aa47bac88f6c48b818076fbd817c891195affd7e47a32f500f42bcc.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 239, + 482, + 352, + 498 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 482, + 352, + 498 + ], + "spans": [ + { + "bbox": [ + 239, + 482, + 352, + 498 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h w} ^ {\\prime}} := \\left[ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h 1}}, \\dots , \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h W} ^ {\\prime}} \\right],", + "image_path": "ca687b31a9ec78a40b3934456a314c8d4aacdac07525d9eb29e89dc67de12b7f.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 240, + 500, + 375, + 516 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 240, + 500, + 375, + 516 + ], + "spans": [ + { + "bbox": [ + 240, + 500, + 375, + 516 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {\\mathrm {p r o j}} := \\left[ \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s} ^ {\\prime} \\mathrm {h w}} + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h} ^ {\\prime} \\mathrm {w}} + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {\\mathrm {s h w} ^ {\\prime}} \\right].", + "image_path": "1155814727cbb5a74a22906eaac47e2207c137ebbaeb658aa6bc4d4e2d0afe56.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "text", + "content": "3D wavelet representation. 3D CNN based volume encoder " + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "inline_equation", + "content": "\\mathcal{E}_{\\mathrm{low}}" + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "inline_equation", + "content": "\\mathcal{E}_{\\mathrm{high}}" + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "text", + "content": " extract local spatio-temporal features in videos. These volumetric local features are exploited with the 2D projected latent " + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_{\\mathrm{proj}}" + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "text", + "content": " to reorganize fine-grained features. Instead of utilizing the unprocessed RGB video frame directly in the volume encoder, we employ the decomposed wavelet features as input. These decomposed wavelet features extracted from the 3D wavelet transform " + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "inline_equation", + "content": "\\mathcal{W}" + }, + { + "bbox": [ + 130, + 525, + 482, + 620 + ], + "type": "text", + "content": " provide coarse and detailed volume coefficient suited for video encoding. Extracting 3D wavelet latent can be formulated as follows:" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 234, + 625, + 310, + 637 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 234, + 625, + 310, + 637 + ], + "spans": [ + { + "bbox": [ + 234, + 625, + 310, + 637 + ], + "type": "interline_equation", + "content": "\\mathcal {F} _ {\\mathrm {l o w}} = \\mathcal {E} _ {\\mathrm {l o w}} (\\mathbf {x} _ {\\mathrm {l l l}}),", + "image_path": "4fc9736614e80bb8a376c7c283346a13b65c7fa8a1255dfa0f9bc5df97ab53ff.jpg" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 231, + 640, + 480, + 653 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 640, + 480, + 653 + ], + "spans": [ + { + "bbox": [ + 231, + 640, + 480, + 653 + ], + "type": "interline_equation", + "content": "\\mathcal {F} _ {\\text {h i g h}} = \\mathcal {E} _ {\\text {h i g h}} \\left(\\operatorname {C a t} \\left(\\mathbf {x} _ {\\text {l l h}}, \\dots , \\mathbf {x} _ {\\text {h h h}}\\right)\\right), \\tag {3}", + "image_path": "1a2bb6e04c8e2757a43c062320f6b3b28291a5ec728d3fe137484ad5d10e5dbb.jpg" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 238, + 655, + 341, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 655, + 341, + 667 + ], + "spans": [ + { + "bbox": [ + 238, + 655, + 341, + 667 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {\\mathrm {v o l}} = \\operatorname {C a t} \\left(\\mathcal {F} _ {\\mathrm {l o w}}, \\mathcal {F} _ {\\mathrm {h i g h}}\\right).", + "image_path": "f7849d05be1359786e12fa48a69bb4a16b69671faaa7098be34715208a2bd87e.jpg" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 209, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 209, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 209, + 101 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{III}}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " denotes decomposed low-pass subband and the others " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{IIh}},\\ldots ,X_{\\mathrm{hhh}}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " denotes high-pass subband. The low-pass subband and high-pass subband are encoded to provide the coarse content and fine motion information." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 156, + 480, + 216 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 156, + 480, + 216 + ], + "spans": [ + { + "bbox": [ + 130, + 156, + 480, + 216 + ], + "type": "text", + "content": "Fusing 2D triplane and 3D wavelet representations. As shown in Fig. 1, these 2D projected and 3D volume latent are integrated by cross-attention operation across the temporal and spatial axis. In this way, we can reinforce the volume-related inductive bias and rearrange fine-grained video latent for video generation. Formally, this cross-attention process can be formulated as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 252, + 221, + 372, + 236 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 221, + 372, + 236 + ], + "spans": [ + { + "bbox": [ + 252, + 221, + 372, + 236 + ], + "type": "interline_equation", + "content": "\\mathbf {z} ^ {i} = \\mathrm {C A} (\\mathbf {z} _ {\\mathrm {p r o j}} ^ {i}, \\mathbf {z} _ {\\mathrm {v o l}}) + \\mathbf {z} _ {\\mathrm {p r o j}} ^ {i},", + "image_path": "dc8ecd8b82b83782e6de0cf364d742a489bdea7946cf73ff98f9fe0fbddda786.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 252, + 238, + 480, + 259 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 238, + 480, + 259 + ], + "spans": [ + { + "bbox": [ + 252, + 238, + 480, + 259 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathbf {z} ^ {i} = \\operatorname {F F N} \\left(\\mathbf {z} ^ {i}\\right) + \\mathbf {z} ^ {i}, \\\\ \\tilde {\\mathbf {\\Sigma}} ^ {i} = C \\Lambda (- i, - \\infty), + - i \\end{array} \\tag {4}", + "image_path": "0b4d6e076c41e152e60ba23cb1b38832c542ab67943f2c31e5eefb7734bc41a9.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 252, + 247, + 480, + 266 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 247, + 480, + 266 + ], + "spans": [ + { + "bbox": [ + 252, + 247, + 480, + 266 + ], + "type": "interline_equation", + "content": "\\tilde {\\mathbf {z}} ^ {i} = \\operatorname {C A} \\left(\\mathbf {z} ^ {i}, \\mathbf {z} _ {\\text {v o l}}\\right) + \\mathbf {z} ^ {i}, \\tag {4}", + "image_path": "ae56c3e6c42eee541b02282f2e413182a0abf9fea15603290a80387d05d41271.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 242, + 270, + 334, + 283 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 270, + 334, + 283 + ], + "spans": [ + { + "bbox": [ + 242, + 270, + 334, + 283 + ], + "type": "interline_equation", + "content": "\\mathbf {z} ^ {i + 1} = \\mathrm {F F N} (\\tilde {\\mathbf {z}} ^ {i}) + \\tilde {\\mathbf {z}} ^ {i},", + "image_path": "6a913a994fd1715f59d087710cec9726d437f1eb5f93b54d1e611392d1ceb24b.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "inline_equation", + "content": "\\mathrm{CA}(a,b)" + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "text", + "content": " refers to Cross-Attention, with a representing the query and b representing the key and value. Additionally, FFN stands for FeedForward Network. Note that the input " + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_{\\mathrm{proj}}^{0} = \\mathbf{z}_{\\mathrm{proj}}" + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "text", + "content": " and the final output " + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "text", + "content": ". Then, we reconstruct the video " + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "inline_equation", + "content": "\\tilde{\\mathbf{x}}" + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "text", + "content": " with video decoder " + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 289, + 479, + 337 + ], + "type": "text", + "content": " based on the refined hybrid features." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 285, + 350, + 480, + 361 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 285, + 350, + 480, + 361 + ], + "spans": [ + { + "bbox": [ + 285, + 350, + 480, + 361 + ], + "type": "interline_equation", + "content": "\\tilde {\\mathbf {x}} = \\mathcal {D} (\\mathbf {z}), \\tag {5}", + "image_path": "572b6dfd90a5c2fd8006a6e6eb0c3e4a5b5952c5151dbc72017e76925663ac44.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 361, + 242, + 375 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 361, + 242, + 375 + ], + "spans": [ + { + "bbox": [ + 131, + 361, + 242, + 375 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 361, + 242, + 375 + ], + "type": "inline_equation", + "content": "\\mathbf{z} \\in \\mathbb{R}^{C \\times S \\times H' \\times W'}" + }, + { + "bbox": [ + 131, + 361, + 242, + 375 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 390, + 228, + 400 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 390, + 228, + 400 + ], + "spans": [ + { + "bbox": [ + 131, + 390, + 228, + 400 + ], + "type": "text", + "content": "4.2 Loss function" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 407, + 479, + 466 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 479, + 466 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 479, + 466 + ], + "type": "text", + "content": "Our hybrid video autoencoder consists of three loss functions. In the following, we provide a brief overview and explain the training loss functions. Our training loss functions enable the preservation of frequency information during the video reconstruction process. Specifically, we enforce constraints both in the pixel space and the wavelet space." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 471, + 479, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 471, + 479, + 530 + ], + "spans": [ + { + "bbox": [ + 130, + 471, + 479, + 530 + ], + "type": "text", + "content": "Reconstruction loss. The reconstruction loss " + }, + { + "bbox": [ + 130, + 471, + 479, + 530 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{rec}" + }, + { + "bbox": [ + 130, + 471, + 479, + 530 + ], + "type": "text", + "content": " denotes the similarity between the original input video and output video reconstructed by a model. The reconstruction loss term enforces the model to learn meaningful features in the encoding phase so that it can accurately reconstruct the input data in the decoding phase. We employ mean absolute error for reconstruction:" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 254, + 537, + 480, + 548 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 254, + 537, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 254, + 537, + 480, + 548 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {r e c}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| \\mathbf {x} - \\tilde {\\mathbf {x}} \\| _ {1} \\right]. \\tag {6}", + "image_path": "772046a14fb24c4a64bb3c405612bb15a8440d031b1538677caa9cc745eb474c.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 558, + 479, + 630 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 479, + 630 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 479, + 630 + ], + "type": "text", + "content": "- Perceptual loss. The perceptual loss measures the difference between the feature map of input and a generated output in terms of perceptual similarity. Typically, this loss entails the extraction of feature maps from a pre-trained neural network. In contrast to reconstruction loss, which focuses solely on the pixel-level differences between videos, perceptual loss takes into account high level features such as textures and structures that humans perceive." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 237, + 636, + 480, + 649 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 237, + 636, + 480, + 649 + ], + "spans": [ + { + "bbox": [ + 237, + 636, + 480, + 649 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {l p i p s}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| f (\\mathbf {x}) - f (\\tilde {\\mathbf {x}}) \\| _ {1} \\right]. \\tag {7}", + "image_path": "094914376b80e95acd18570fe793ee6581a9437aad3c81f843cb4f6045451947.jpg" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 131, + 653, + 351, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 653, + 351, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 653, + 351, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 653, + 351, + 666 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 131, + 653, + 351, + 666 + ], + "type": "text", + "content": " denotes the perceptual feature extractor." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 223 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 223 + ], + "type": "text", + "content": "Frequency matching loss. Conventional methods typically rely on pixel-level losses in the spatial-temporal space. Since these loss functions closely match the original videos in pixel domain, the generated video's quality may not be sufficient potentially failing to capture the frequency information. Our frequency matching loss is designed to facilitate the model can learn frequency features with less optimization difficulty. This loss not only helps the model to recover missing frequency components but also enhances the overall reconstruction quality. We define the frequency matching loss as a reconstruction term in the wavelet domain:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 200, + 224, + 481, + 239 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 224, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 200, + 224, + 481, + 239 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {f r e q}} = \\mathbb {E} _ {\\mathbf {x} \\sim \\mathcal {X}} \\left[ \\| \\mathcal {W} _ {\\mathbf {d}} (\\mathbf {x}) - \\mathcal {W} _ {\\mathbf {d}} (\\tilde {\\mathbf {x}}) \\| _ {1} \\right], \\mathbf {d} \\in \\{\\mathrm {s}, \\mathrm {h}, \\mathrm {w} \\}. \\tag {8}", + "image_path": "87aa4aa611007f227ec9cb4c3e54efc1d0e13768bce156b6d1f1195b91525107.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 244, + 481, + 269 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 244, + 481, + 269 + ], + "spans": [ + { + "bbox": [ + 131, + 244, + 481, + 269 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 244, + 481, + 269 + ], + "type": "inline_equation", + "content": "\\mathcal{W}_{\\mathbf{d}}" + }, + { + "bbox": [ + 131, + 244, + 481, + 269 + ], + "type": "text", + "content": " denotes three-dimensional discrete wavelet transform and " + }, + { + "bbox": [ + 131, + 244, + 481, + 269 + ], + "type": "inline_equation", + "content": "\\mathbf{d}" + }, + { + "bbox": [ + 131, + 244, + 481, + 269 + ], + "type": "text", + "content": " denotes the dimensions from which the wavelet transform is performed." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 277, + 481, + 301 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 277, + 481, + 301 + ], + "spans": [ + { + "bbox": [ + 131, + 277, + 481, + 301 + ], + "type": "text", + "content": "Overall loss. Taking into account all the losses, the overall loss is formulated as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 223, + 316, + 481, + 329 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 316, + 481, + 329 + ], + "spans": [ + { + "bbox": [ + 223, + 316, + 481, + 329 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\lambda_ {\\text {r e c}} \\mathcal {L} _ {\\text {r e c}} + \\lambda_ {\\text {l p i p s}} \\mathcal {L} _ {\\text {l p i p s}} + \\lambda_ {\\text {f r e q}} \\mathcal {L} _ {\\text {f r e q}}, \\tag {9}", + "image_path": "89de5c2247c7debf0e1582294b21fdd005d3cbfc2ceff359d1627dacee10c650.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 335, + 392, + 346 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 335, + 392, + 346 + ], + "spans": [ + { + "bbox": [ + 131, + 335, + 392, + 346 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 335, + 392, + 346 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{rec}} = \\lambda_{\\mathrm{lpips}} = 1" + }, + { + "bbox": [ + 131, + 335, + 392, + 346 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 335, + 392, + 346 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{freq}} = 0.5" + }, + { + "bbox": [ + 131, + 335, + 392, + 346 + ], + "type": "text", + "content": " in our experiments." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 347, + 481, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 481, + 396 + ], + "type": "text", + "content": "Note that, unlike previous works [5, 53] that focus on improving the temporal dynamics of generated videos through the use of a 3D discriminator, our video autoencoder achieves temporal realism in the reconstructed videos without the need for adversarial training." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 415, + 361, + 426 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 415, + 361, + 426 + ], + "spans": [ + { + "bbox": [ + 132, + 415, + 361, + 426 + ], + "type": "text", + "content": "4.3 Diffusion Model-based Video Generator" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 437, + 481, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 481, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 481, + 472 + ], + "type": "text", + "content": "Leveraging the hybrid latent extracted from the video autoencoder, we train a diffusion-based video generator which learn the latent distribution " + }, + { + "bbox": [ + 130, + 437, + 481, + 472 + ], + "type": "inline_equation", + "content": "p(\\mathbf{z})" + }, + { + "bbox": [ + 130, + 437, + 481, + 472 + ], + "type": "text", + "content": " through the reverse process of the Markov Chain." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 473, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 473, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 131, + 473, + 481, + 510 + ], + "type": "text", + "content": "Our diffusion model consists of two processes: the forward process and the reverse process. In forward process, the model gradually transforms the latent " + }, + { + "bbox": [ + 131, + 473, + 481, + 510 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_0\\sim p(\\mathbf{z}_0)" + }, + { + "bbox": [ + 131, + 473, + 481, + 510 + ], + "type": "text", + "content": " toward a Gaussian distribution as formulated below:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 225, + 520, + 481, + 540 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 520, + 481, + 540 + ], + "spans": [ + { + "bbox": [ + 225, + 520, + 481, + 540 + ], + "type": "interline_equation", + "content": "q \\left(\\mathbf {z} _ {t} \\mid \\mathbf {z} _ {t - 1}\\right) = \\mathcal {N} \\left(\\mathbf {z} _ {t}; \\sqrt {1 - \\beta_ {t}} \\mathbf {z} _ {t - 1}, \\beta_ {t} \\mathbf {I}\\right), \\tag {10}", + "image_path": "6703043d4ea8dac7c6468ba1fc77dea8876938214cf560d7f11e1a55bce380b6.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 235, + 537, + 387, + 550 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 537, + 387, + 550 + ], + "spans": [ + { + "bbox": [ + 235, + 537, + 387, + 550 + ], + "type": "interline_equation", + "content": "q (\\mathbf {z} _ {t} | \\mathbf {z} _ {0}) = \\mathcal {N} (\\mathbf {z} _ {t}; \\sqrt {\\bar {\\alpha} _ {t}} \\mathbf {z} _ {0}, (1 - \\bar {\\alpha} _ {t}) \\mathbf {I}).", + "image_path": "6ac2ac253734785f1ee454eece80825eec983fd15066873ddd7cc65269289e30.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 561, + 479, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 561, + 479, + 574 + ], + "spans": [ + { + "bbox": [ + 131, + 561, + 479, + 574 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 561, + 479, + 574 + ], + "type": "inline_equation", + "content": "\\bar{\\alpha}_t = \\prod_{i=1}^t (1 - \\beta_i)" + }, + { + "bbox": [ + 131, + 561, + 479, + 574 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 561, + 479, + 574 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 131, + 561, + 479, + 574 + ], + "type": "text", + "content": " represents a pre-defined schedule for the variance." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 574, + 481, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 574, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 131, + 574, + 481, + 597 + ], + "type": "text", + "content": "In the reverse process, the model is trained to gradually denoise the latent via the parameterized Gaussian transition." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 227, + 609, + 481, + 622 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 609, + 481, + 622 + ], + "spans": [ + { + "bbox": [ + 227, + 609, + 481, + 622 + ], + "type": "interline_equation", + "content": "p _ {\\theta} \\left(\\mathbf {z} _ {t - 1} \\mid \\mathbf {z} _ {t}\\right) = \\mathcal {N} \\left(\\mathbf {z} _ {t - 1}; \\mu_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right), \\sigma_ {t} ^ {2} \\mathbf {I}\\right), \\tag {11}", + "image_path": "0046e6438ade7fe5baddbc609e0e0ed5ffa0650cf56e4bfe6c713f9d4c6e9076.jpg" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 214, + 642, + 481, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 642, + 481, + 669 + ], + "spans": [ + { + "bbox": [ + 214, + 642, + 481, + 669 + ], + "type": "interline_equation", + "content": "\\mu_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right) = \\frac {1}{\\sqrt {\\alpha_ {t}}} \\left(\\mathbf {z} _ {t} - \\frac {\\beta_ {t}}{\\sqrt {1 - \\bar {\\alpha} _ {t}}} \\epsilon_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right)\\right), \\tag {12}", + "image_path": "e5fb0db7dde0ce4a236020163fb032e149542e2d2050876855d8d30abe229051.jpg" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 209, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 209, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 209, + 101 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 482, + 224 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 482, + 224 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 482, + 224 + ], + "type": "image", + "image_path": "538594eb6a4e3942577e9a675644f38665ef168d9c5ea3769adcba23355e9f05.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "lines": [ + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "spans": [ + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "type": "text", + "content": "Fig. 3: Applications for diverse video generator by our proposed HVDM. Our HVDM is adaptable for diverse video generation tasks depending on the type of condition latent " + }, + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "type": "inline_equation", + "content": "z_{c}" + }, + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "type": "text", + "content": ". During training process, the condition latent " + }, + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "type": "inline_equation", + "content": "z_{c}" + }, + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "type": "text", + "content": " is extracted from the video and jointly trained with the noised hybrid video latent " + }, + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 235, + 482, + 302 + ], + "type": "text", + "content": ". During the sampling process, these condition latent are supported to enable various video generation tasks, such as long video generation, image-to-video, and video dynamics control." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 323, + 480, + 358 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 480, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 480, + 358 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 323, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(\\cdot)" + }, + { + "bbox": [ + 130, + 323, + 480, + 358 + ], + "type": "text", + "content": " is a trainable denoising diffusion model which recovers a noisy sample " + }, + { + "bbox": [ + 130, + 323, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_t" + }, + { + "bbox": [ + 130, + 323, + 480, + 358 + ], + "type": "text", + "content": ". The denoising diffusion model is trained to predict the noise with the following simplified objective:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 241, + 365, + 480, + 380 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 365, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 241, + 365, + 480, + 380 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {s i m p l e}} (\\theta) := \\left\\| \\epsilon_ {\\theta} \\left(\\mathbf {z} _ {t}, t\\right) - \\epsilon \\right\\| _ {2} ^ {2}, \\tag {13}", + "image_path": "7437ea0cd785e3c86a6d0105268e277ac62d7fea011e611cdd917e3348aec997.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 385, + 267, + 398 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 385, + 267, + 398 + ], + "spans": [ + { + "bbox": [ + 131, + 385, + 267, + 398 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 385, + 267, + 398 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_t = \\sqrt{\\bar{\\alpha}_t}\\mathbf{z}_0 + \\sqrt{1 - \\bar{\\alpha}_t}\\epsilon" + }, + { + "bbox": [ + 131, + 385, + 267, + 398 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 399, + 479, + 457 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 479, + 457 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 479, + 457 + ], + "type": "text", + "content": "To generate video samples from the latent space, we train a denoising diffusion model which follows the standard 3D U-Net architecture. The 3D U-Net architecture is composed of 3D convolution layers combined with skip connections. We employ a simplified 3D U-Net to denoise the latent " + }, + { + "bbox": [ + 130, + 399, + 479, + 457 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 399, + 479, + 457 + ], + "type": "text", + "content": " for the purpose of verifying the effectiveness of our video autoencoder." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 474, + 370, + 487 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 474, + 370, + 487 + ], + "spans": [ + { + "bbox": [ + 131, + 474, + 370, + 487 + ], + "type": "text", + "content": "4.4 Applications for Diverse Video Generator" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 492, + 479, + 526 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 492, + 479, + 526 + ], + "spans": [ + { + "bbox": [ + 130, + 492, + 479, + 526 + ], + "type": "text", + "content": "We demonstrate that our method can be extended to a variety of video applications such as long video generation, image-to-video, and video dynamics control." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "content": "Long video generation. To facilitate long video generation, our work follows the traditional frame prediction approach [13, 44, 53] where previous frame conditions are combined with future frames. Given two consecutive video clips " + }, + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "inline_equation", + "content": "[\\mathbf{x}^{\\mathrm{prev}},\\mathbf{x}^{\\mathrm{next}}]" + }, + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "content": " of " + }, + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "inline_equation", + "content": "\\mathbf{x}^{\\mathrm{prev}},\\mathbf{x}^{\\mathrm{next}}\\in \\mathbb{R}^{3\\times S\\times H\\times W}" + }, + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "content": ", we can train the model to generate initial clips and future clips in a unified manner. More specifically, we can generate an initial clip with a null latent and extend the video by composing the condition with previous frame latent as follow:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 228, + 624, + 480, + 656 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 624, + 480, + 656 + ], + "spans": [ + { + "bbox": [ + 228, + 624, + 480, + 656 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {c} ^ {\\text {l o n g}} = \\left\\{ \\begin{array}{l l} \\mathcal {E} (\\mathbf {x} ^ {\\text {p r e v}}), & \\text {i f f u t u r e c l i p ,} \\\\ 0, & \\text {o t h e r w i s e ,} \\end{array} \\right. \\tag {14}", + "image_path": "1dd14b494cdb191079de72be8f4a3e2a0a117378ab713a225a0b1199dd1d8d16.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 661, + 345, + 674 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 661, + 345, + 674 + ], + "spans": [ + { + "bbox": [ + 131, + 661, + 345, + 674 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 661, + 345, + 674 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 131, + 661, + 345, + 674 + ], + "type": "text", + "content": " denotes our pre-trained hybrid encoder." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "Image-to-video. Image-to-video generation aims to synthesize a coherent video starting from an image. In general, videos are composed of a series of consecutive images, where the first frame serves as a representative depiction of the overall content within the video. To facilitate the process of image-to-video generation without introducing an additional image encoder, we repeatedly stack the first frame of the video on the temporal axis. Then, we use the latent " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "\\mathcal{I}^{\\mathrm{content}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": " extracted from our video encoder as the content condition. By leveraging the latent " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "\\mathcal{I}^{\\mathrm{content}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": " which capture the common content, we can effectively guide the model to generate coherent video sequence as follow:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 227, + 232, + 481, + 251 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 232, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 227, + 232, + 481, + 251 + ], + "type": "interline_equation", + "content": "\\mathcal {I} _ {\\text {i m c 2 v i d}} ^ {\\text {c o n t e n t}} = \\left[ \\mathbf {x} _ {0} ^ {1}, \\dots , \\mathbf {x} _ {0} ^ {1} \\right] \\in \\mathbb {R} ^ {3 \\times S \\times H \\times W}, \\tag {15}", + "image_path": "30f82af0ffb49f292a93742540e4fc37fda673b102b51d771d4d4a85f32fb96c.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 225, + 247, + 321, + 262 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 247, + 321, + 262 + ], + "spans": [ + { + "bbox": [ + 225, + 247, + 321, + 262 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {c} ^ {\\mathrm {i m g 2 v i d}} = \\mathcal {E} (\\mathcal {I} ^ {\\mathrm {c o n t e n t}}).", + "image_path": "b084629ec5232dde291260d0b1bf45afce300e3c924c3bf372a725156dc1e65e.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 276, + 482, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 276, + 482, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 276, + 482, + 396 + ], + "type": "text", + "content": "Video dynamics control. Empowering users to control motion intensity in video creation provides flexibility with an improved user experience. Unfortunately, it was difficult to obtain motion-related labels from existing video collections for training diffusion models. To enable the alteration of motion intensity, we devise a method that learns motion dynamics with inter-frame variance. Specifically, we define the level of motion alteration as the structural dissimilarity between the semantic latent of the start and end frames. Since the structural dissimilarity encompasses both semantic and motion variance, we employ it as guiding cues to control motion without explicit motion labeled video. Formally, our structural dissimilarity is defined as follow:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 256, + 403, + 481, + 418 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 256, + 403, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 256, + 403, + 481, + 418 + ], + "type": "interline_equation", + "content": "\\mathbf {z} _ {c} ^ {\\text {d y n a m i c s}} = \\left\\| \\mathbf {z} _ {0} ^ {\\mathrm {T}} - \\mathbf {z} _ {0} ^ {1} \\right\\| _ {1}. \\tag {16}", + "image_path": "86c5d9cb8d4373c6a0197f8718f6529f9465d8752adb98be1e55c3fc6aacdd51.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "content": "Inspired by the classifier-free guidance techniques, we train a single diffusion model to jointly learn both the unconditional distribution " + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "inline_equation", + "content": "p(\\mathbf{x})" + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "content": " and the conditional distribution " + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "inline_equation", + "content": "p(\\mathbf{x}^2|\\mathbf{x}^1)" + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "content": ". In particular, we train the conditional distribution " + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "inline_equation", + "content": "p(\\mathbf{x}^2|\\mathbf{x}^1)" + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "content": " with condition-specific information (e.g., previous frame or content or dynamics latent) and the unconditional distribution using a null condition (e.g., " + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_c = 0" + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "content": "). The optimized objective can be formulated as follow:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 187, + 506, + 481, + 525 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 506, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 187, + 506, + 481, + 525 + ], + "type": "interline_equation", + "content": "\\mathbb {E} _ {\\mathbf {x} _ {0}, \\epsilon , t} [ \\lambda | | \\epsilon - \\epsilon_ {\\theta} (\\mathbf {z} _ {t}, \\mathbf {z} _ {c}, t) | | _ {2} ^ {2} + (1 - \\lambda) | | \\epsilon - \\epsilon_ {\\theta} (\\mathbf {z} _ {t}, 0, t) | | _ {2} ^ {2} ], \\tag {17}", + "image_path": "85b5e9a45336c24ed971a67838a993ee72ee4cd78d0232c9a6ccf4dcfdd021e3.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 533, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 559 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 533, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_0 = \\mathcal{E}(\\mathbf{x}_0),\\mathbf{z}_t = \\sqrt{\\bar{\\alpha}_t}\\mathbf{z}_0 + \\sqrt{1 - \\bar{\\alpha}_t}\\epsilon" + }, + { + "bbox": [ + 130, + 533, + 482, + 559 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 533, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\lambda \\in (0,1)" + }, + { + "bbox": [ + 130, + 533, + 482, + 559 + ], + "type": "text", + "content": " is a hyperparameter that guide a model to learn an unconditional and conditional distributions." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 574, + 230, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 574, + 230, + 588 + ], + "spans": [ + { + "bbox": [ + 131, + 574, + 230, + 588 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 598, + 243, + 611 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 598, + 243, + 611 + ], + "spans": [ + { + "bbox": [ + 131, + 598, + 243, + 611 + ], + "type": "text", + "content": "5.1 Training Details" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "type": "text", + "content": "Datasets. We conduct the experiments on three commonly-used benchmark datasets for the video generation task: UCF-101 [38], SkyTimelapse [51], and TaiChi [34]. UCF-101 [38] contains 13,320 videos from 101 action classes, offering a diverse range of human actions. SkyTimelapse [51] is composed of 5,000" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 114, + 482, + 169 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 482, + 169 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 482, + 169 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 482, + 169 + ], + "type": "table", + "html": "
MethodUCF-101SkyTimelapseTaiChi
R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM↑R-FVD↓LPIPS↓PSNR↑SSIM
LVDM [13]----74.920.09131.210.778102.680.11227.630.729
PVDM [53]27.030.09527.030.74235.960.06132.710.82661.610.06826.870.715
HVDM (ours)5.350.03834.000.91520.760.04635.040.89121.510.02533.510.916
", + "image_path": "aba882d14b34716773a87077e9802bc9d832681a4c2cc927c2106a30986a0ab2.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 173, + 480, + 216 + ], + "lines": [ + { + "bbox": [ + 130, + 173, + 480, + 216 + ], + "spans": [ + { + "bbox": [ + 130, + 173, + 480, + 216 + ], + "type": "text", + "content": "Table 1: Quantitative comparison of reconstruction results on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. Our video autoencoder shows significantly superior performance across various metrics, providing more fine-grained comparison." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "type": "image", + "bbox": [ + 142, + 228, + 471, + 389 + ], + "blocks": [ + { + "bbox": [ + 142, + 228, + 471, + 389 + ], + "lines": [ + { + "bbox": [ + 142, + 228, + 471, + 389 + ], + "spans": [ + { + "bbox": [ + 142, + 228, + 471, + 389 + ], + "type": "image", + "image_path": "791298341b1a253f041decfdb5e4f21f4911748e4037983901086bc9c72f4543.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 392, + 480, + 426 + ], + "lines": [ + { + "bbox": [ + 130, + 392, + 480, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 480, + 426 + ], + "type": "text", + "content": "Fig. 4: Qualitative reconstruction results on SkyTimelapse [51] dataset [34]. Our HVDM produces distinct and sharp edge details and faithfully expresses a fine structures in a video sequence. Additional samples are included in appendix." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 439, + 480, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 439, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 439, + 480, + 464 + ], + "type": "text", + "content": "videos containing dynamic sky scenes. TaiChi [34] consists of full human bodies performing Tai-Chi actions." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 468, + 480, + 515 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 480, + 515 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 480, + 515 + ], + "type": "text", + "content": "Training. The video autoencoder component for 2D projected latent stem from the PVDM [53], but the other wavelet-based frequency component is added. We train our models on 4 NVIDIA A100 GPUs for each autoencoding and diffusion process. See Appendix A for the details." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 533, + 253, + 544 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 533, + 253, + 544 + ], + "spans": [ + { + "bbox": [ + 131, + 533, + 253, + 544 + ], + "type": "text", + "content": "5.2 Evaluation Details" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 552, + 480, + 612 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 552, + 480, + 612 + ], + "spans": [ + { + "bbox": [ + 130, + 552, + 480, + 612 + ], + "type": "text", + "content": "Baseline models. We compare our HVDM with the following video generation models: VideoGPT [52], MoCoGAN [40], MoCoGAN-HD [39], DIGAN [54], StyleGAN-V [36], LVDM [13], and PVDM [53]. We utilize official model weights and conduct training using the official code when the model weights are not available." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 617, + 493, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 493, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 493, + 666 + ], + "type": "text", + "content": "Quantitative evaluations. To evaluate reconstruction quality, we use R-FVD [42], LPIPS [55], PSNR [20], and SSIM [18]. Here, R-FVD denotes FVD between reconstructed videos and the ground-truth videos. As for the evaluation of generation quality, we measure FVD [42] and KVD [41]. Considering different clip" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 114, + 481, + 217 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 481, + 217 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 481, + 217 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 481, + 217 + ], + "type": "table", + "html": "
VideoGPT MoCoGAN + StyleGAN2 MoCoGAN-HD DIGAN StyleGAN-V LVDM†
Train Split
UCF101 - FVD162880.62886.81821.41729.61630.21431.0N/A399.4303.1
UCF101 - FVD128N/A3679.02311.32606.52293.71773.4N/A505.0549.7
SkyTimelapse - FVD16222.7206.685.88164.183.1179.52318.963.542.8
SkyTimelapse - FVD128N/A575.9272.8878.1196.7197.0N/A134.7124.9
LVDM† PVDM† HVDM (Ours)LVDM† PVDM* HVDM (Ours)
Train SplitTrain+Test Split
UCF101 - KVD16N/A35.523.6TaiChi - FVD16120.9267.077.0
UCF101 - KVD128N/A37.734.4TaiChi - FVD128N/A339.2258.5
SkyTimelapse - KVD1621.733.11.5TaiChi - KVD1614.766.511.9
SkyTimelapse - KVD128N/A6.03.5TaiChi - KVD128N/A120.177.8
", + "image_path": "ea3738d91d1b8763ce56c4d8f923905727f5a7bb84a13fe5a29776fc75aa8dc9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 220, + 482, + 298 + ], + "lines": [ + { + "bbox": [ + 130, + 220, + 482, + 298 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 482, + 298 + ], + "type": "text", + "content": "Table 2: Quantitative comparison of video generation models on UCF-101 [38], SkyTimelapse [51], and TaiChi datasets [34]. We evaluate FVD and KVD metrics (the lower values are better) and the best score are marked as bold. The overall score of other baselines are referenced from StyleGAN-V [37]. Methods marked with " + }, + { + "bbox": [ + 130, + 220, + 482, + 298 + ], + "type": "inline_equation", + "content": "\\dagger" + }, + { + "bbox": [ + 130, + 220, + 482, + 298 + ], + "type": "text", + "content": " denote the score is computed using official pretrained weights and " + }, + { + "bbox": [ + 130, + 220, + 482, + 298 + ], + "type": "inline_equation", + "content": "*" + }, + { + "bbox": [ + 130, + 220, + 482, + 298 + ], + "type": "text", + "content": " denote the score is reproduced using official codes. We report evaluation details and sampling settings on Appendix B." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "type": "image", + "bbox": [ + 133, + 308, + 481, + 403 + ], + "blocks": [ + { + "bbox": [ + 133, + 308, + 481, + 403 + ], + "lines": [ + { + "bbox": [ + 133, + 308, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 133, + 308, + 481, + 403 + ], + "type": "image", + "image_path": "7569e1d2cbd9a0abb151e4862c768ac93050b488be8fdf7cc956764f72bc4e07.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 407, + 481, + 431 + ], + "lines": [ + { + "bbox": [ + 130, + 407, + 481, + 431 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 481, + 431 + ], + "type": "text", + "content": "Fig. 5: Generated video sample by our HVDM on UCF-101 [38], SkyTime-lapse [51], and TaiChi datasets [34]." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "text", + "content": "lengths, we denote " + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "inline_equation", + "content": "\\mathrm{FVD}_{16}" + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "inline_equation", + "content": "\\mathrm{KVD}_{16}" + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "text", + "content": " scores, as well as " + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "inline_equation", + "content": "\\mathrm{FVD}_{128}" + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "inline_equation", + "content": "\\mathrm{KVD}_{128}" + }, + { + "bbox": [ + 130, + 453, + 482, + 502 + ], + "type": "text", + "content": " scores for video clips with a length of 16 and 128. For a fair comparison, we follow the evaluation protocol of StyleGAN-V [37]; i.e., we use 2,048 real/fake video clips for evaluating FVD. See Appendix B for the details." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 520, + 263, + 533 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 520, + 263, + 533 + ], + "spans": [ + { + "bbox": [ + 131, + 520, + 263, + 533 + ], + "type": "text", + "content": "5.3 Comparison Results" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 540, + 482, + 612 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 540, + 482, + 612 + ], + "spans": [ + { + "bbox": [ + 130, + 540, + 482, + 612 + ], + "type": "text", + "content": "Reconstruction results. Fig. 4 and Appendix F.1 show the performance of the reconstructed videos from our autoencoder and other diffusion-based video generative models. Our autoencoder presents a more accurate and clear reconstructed video compared to other baseline methods. In the Tab. 1, we demonstrate that our autoencoder achieves superior performance in all metrics for the three datasets." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "type": "text", + "content": "Generation results. We perform video generation on three datasets and compare the results with the other video generation methods. As shown in Fig. 5, our method is capable of generating not only monotonic motion videos such as Sky-Timelapse [51] and TaiChi [34] but also dynamic motion video UCF-101 [38]," + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 141, + 114, + 470, + 180 + ], + "blocks": [ + { + "bbox": [ + 141, + 114, + 470, + 180 + ], + "lines": [ + { + "bbox": [ + 141, + 114, + 470, + 180 + ], + "spans": [ + { + "bbox": [ + 141, + 114, + 470, + 180 + ], + "type": "table", + "html": "
BackboneProj.Adv.z shape dimensionR-FVD ↓ LPIPS ↓ PSNR ↑SSIM ↑
Video Transformer [4]✓-4 × (32 × 32 + 16 × 32 + 16 × 32)180.210.092
Video Transformer [4]✓✓4 × (32 × 32 + 16 × 32 + 16 × 32)27.030.095
3D CNN [22]--4 × 16 × 32 × 3286.730.057
3D CNN [22]-✓4 × 16 × 32 × 3221.690.064
Ours✓-4 × 16 × 32 × 325.350.038
34.00
0.915
", + "image_path": "b9c66a66ad3fc5930d0e7e8e01ede1b1bc6eb57d4a1f1b3fc97f946112b8f062.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 168, + 182, + 444, + 194 + ], + "lines": [ + { + "bbox": [ + 168, + 182, + 444, + 194 + ], + "spans": [ + { + "bbox": [ + 168, + 182, + 444, + 194 + ], + "type": "text", + "content": "Table 3: Ablation study on various backbone architectures" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 205, + 482, + 266 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 266 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 266 + ], + "type": "text", + "content": "which contain complex action categories. Note that synthesizing high quality videos on a complex dataset like UCF-101 [38] has been a challenging problem where existing video generation method often struggle with producing natural motions with good quality. As shown in Tab. 2, our method achieves superior performance in the benchmark datasets. See Appendix F for more samples." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 281, + 355, + 293 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 355, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 355, + 293 + ], + "type": "text", + "content": "5.4 Interpreting the frequency supervision" + } + ] + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 147, + 301, + 298, + 470 + ], + "blocks": [ + { + "bbox": [ + 147, + 301, + 298, + 470 + ], + "lines": [ + { + "bbox": [ + 147, + 301, + 298, + 470 + ], + "spans": [ + { + "bbox": [ + 147, + 301, + 298, + 470 + ], + "type": "image", + "image_path": "6ddcc6f6df490d2ded008a1bf3202158ab458eb902dc735919383d74ec9ec14c.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 476, + 309, + 499 + ], + "lines": [ + { + "bbox": [ + 131, + 476, + 309, + 499 + ], + "spans": [ + { + "bbox": [ + 131, + 476, + 309, + 499 + ], + "type": "text", + "content": "Fig.6: Visualization of our hybrid representations." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 313, + 298, + 482, + 500 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 313, + 298, + 482, + 500 + ], + "spans": [ + { + "bbox": [ + 313, + 298, + 482, + 500 + ], + "type": "text", + "content": "We perform visualization to understand how hybrid representation can help autoencoder to encode the 3D video pixels in Fig. 6. The decomposed 3D wavelet features is divided into low frequency and high frequency components, where each component conducts cross-attention operation with the 2D projected latent. As shown in Fig. 6, low frequency component captures static and dynamic regions and high frequency component captures the sharp edges and important details of video. To refine the ambiguity of the 2D project latent which contain global and abstract information, we incorporate these latent with" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 502, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 502, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 502, + 482, + 525 + ], + "type": "text", + "content": "frequency components. As a result, our autoencoder figures out where the objects are located and how object's motion occurs in the video." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 540, + 372, + 553 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 540, + 372, + 553 + ], + "spans": [ + { + "bbox": [ + 131, + 540, + 372, + 553 + ], + "type": "text", + "content": "5.5 Ablation study on backbone architectures" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "We conduct verification of performance based on the autoencoder's backbone architecture on UCF-101 dataset. As shown in Tab. 3, our hybrid autoencoder demonstrates effectiveness in capturing both perceptual details and temporal coherence in the video. We can observe that 3D CNN-based autoencoder show better performance compared to the 2D triplane-based autoencoder since it has more latent dimensions. Although the 2D triplane-based autoencoder effectively compresses latent dimensions, enhancing temporal coherence necessitates adversarial training with a 3D discriminator. Our hybrid autoencoder integrates the strengths of both architectures, achieving superior performance." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 331, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 331, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 331, + 129 + ], + "type": "text", + "content": "5.6 Ablation study on fusing modules" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 482, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 482, + 257 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 482, + 257 + ], + "type": "text", + "content": "We verify several experiments to assess how the fusing module affects the performance of our hybrid autoencoder on UCF-101 dataset. For feature fusion, we adopted two different modules: 1) the concatenation module 2) the cross-attention module. We also validated the effectiveness of wavelet decomposition by comparing the results which use raw RGB video as input. As shown in Tab. 4, the experimental results show that the cross-attention module and wavelet-decomposed components contribute to the improvement of reconstruction performance. We analyze that utilizing the temporal and spatial attention module facilitate the integration of different 2D triplane and 3D wavelet representation through the comparison of features at different spatial locations." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 266, + 483, + 312 + ], + "blocks": [ + { + "bbox": [ + 133, + 266, + 483, + 312 + ], + "lines": [ + { + "bbox": [ + 133, + 266, + 483, + 312 + ], + "spans": [ + { + "bbox": [ + 133, + 266, + 483, + 312 + ], + "type": "table", + "html": "
Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑Fusion moduleR-FVD ↓ LPIPS ↓ PSNR ↑ SSIM ↑
Baseline27.030.09527.030.742Baseline + RGB (Cross-attn.)6.320.03833.790.908
Baseline + RGB (Concat.)20.370.06331.020.831Baseline + Low Freq. (Cross-attn.)6.870.04033.690.909
Baseline + Low Freq. (Concat.)34.390.07830.500.816Baseline + High Freq. (Cross-attn.)6.970.04733.200.899
Baseline + High Freq. (Concat.)14.960.06131.320.838
Baseline + Low & High Freq. (Concat.)9.920.05132.690.871Ours5.350.03734.000.915
", + "image_path": "51295d082995495225609ab26d1c70e2a62d28ebf43b15f9e5ebad180c5999d8.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 346, + 376, + 360 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 346, + 376, + 360 + ], + "spans": [ + { + "bbox": [ + 132, + 346, + 376, + 360 + ], + "type": "text", + "content": "5.7 Ablation study on frequency matching loss" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 367, + 482, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 367, + 482, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 367, + 482, + 464 + ], + "type": "text", + "content": "We validate the effectiveness of frequency matching loss (FML) on UCF-101 dataset in Tab. 5. The result shows that utilizing the FML term leads to a remarkable reduction in the FVD score by approximately 2.73 points demonstrating its effectiveness in enhancing the temporal coherency. Furthermore, evaluation metrics related to perceptual details also improved to 0.003 points for LPIPS, 0.33 points for PSNR, and 0.023 points for SSIM respectively. Based on these results, the FML verifies that aligning frequency components allow the HVDM to enhance temporal changes and perceptual quality of generated videos." + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 219, + 479, + 394, + 513 + ], + "blocks": [ + { + "bbox": [ + 188, + 317, + 424, + 328 + ], + "lines": [ + { + "bbox": [ + 188, + 317, + 424, + 328 + ], + "spans": [ + { + "bbox": [ + 188, + 317, + 424, + 328 + ], + "type": "text", + "content": "Table 4: Ablation study on feature fusing module." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 219, + 479, + 394, + 513 + ], + "lines": [ + { + "bbox": [ + 219, + 479, + 394, + 513 + ], + "spans": [ + { + "bbox": [ + 219, + 479, + 394, + 513 + ], + "type": "table", + "html": "
MethodR-FVD ↓LPIPS ↓PSNR ↑SSIM ↑
HVDM (w/o FML)8.080.04133.670.892
HVDM (w/ FML)5.350.03834.000.915
", + "image_path": "42493a8ca21c9c495eeec160f35814430a8bf4743f50b543c46a989eec5ade46.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 184, + 518, + 429, + 530 + ], + "lines": [ + { + "bbox": [ + 184, + 518, + 429, + 530 + ], + "spans": [ + { + "bbox": [ + 184, + 518, + 429, + 530 + ], + "type": "text", + "content": "Table 5: Ablation study on frequency matching loss." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 555, + 220, + 568 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 220, + 568 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 220, + 568 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "We proposed a novel hybrid video autoencoder for video generation using diffusion model, dubbed HVDM. We investigated the effectiveness of our hybrid architecture that combines 2D projected and 3D volume representation, leveraging the strengths of frequency matching loss. By incorporating these representations with spatio-temporal cross-attention, HVDM generates high-quality videos with improved realism. Our extensive experiments on benchmark datasets demonstrated the superior performance, compared to the other baseline methods." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 482, + 285 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 482, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 482, + 285 + ], + "type": "text", + "content": "This research was supported by the National Supercomputing Center in Korea (KISTI) (TS-2023-RG-0004), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No.2022R1C1C1008496, RS-2024-00346597), Institute of Information & communications Technology Planning & Evaluation(IITP) grant funded by the Korea government(MSIT) (No.RS-2020-II201336, Artificial Intelligence graduate school support(UNIST), RS-2021-II212068, Comprehensive Video Understanding and Generation with Knowledge-based Deep Logic Neural Network), and Culture, Sports, and Tourism R&D Program through the Korea Creative Content Agency grant funded by the Ministry of Culture, Sports and Tourism (Research on neural watermark technology for copyright protection of generative AI 3D content, RS-2024-00348469, RS-2024-00333068)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 306, + 197, + 319 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 306, + 197, + 319 + ], + "spans": [ + { + "bbox": [ + 133, + 306, + 197, + 319 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 332, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 138, + 332, + 481, + 366 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 481, + 366 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 481, + 366 + ], + "type": "text", + "content": "1. Ajay, A., Han, S., Du, Y., Li, S., Gupta, A., Jaakkola, T., Tenenbaum, J., Kaelbling, L., Srivastava, A., Agrawal, P.: Compositional foundation models for hierarchical planning. arXiv preprint arXiv:2309.08587 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 366, + 481, + 399 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 366, + 481, + 399 + ], + "spans": [ + { + "bbox": [ + 138, + 366, + 481, + 399 + ], + "type": "text", + "content": "2. An, J., Zhang, S., Yang, H., Gupta, S., Huang, J.B., Luo, J., Yin, X.: Latent-shift: Latent diffusion with temporal shift for efficient text-to-video generation. arXiv preprint arXiv:2304.08477 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 399, + 481, + 443 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 399, + 481, + 443 + ], + "spans": [ + { + "bbox": [ + 138, + 399, + 481, + 443 + ], + "type": "text", + "content": "3. Anciukevicius, T., Xu, Z., Fisher, M., Henderson, P., Bilen, H., Mitra, N.J., Guerrero, P.: Renderdiffusion: Image diffusion for 3d reconstruction, inpainting and generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12608-12618 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 444, + 481, + 465 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 444, + 481, + 465 + ], + "spans": [ + { + "bbox": [ + 138, + 444, + 481, + 465 + ], + "type": "text", + "content": "4. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 466, + 481, + 510 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 466, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 138, + 466, + 481, + 510 + ], + "type": "text", + "content": "5. Blattmann, A., Rombach, R., Ling, H., Dockhorn, T., Kim, S.W., Fidler, S., Kreis, K.: Align your latents: High-resolution video synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22563-22575 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 510, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 481, + 533 + ], + "type": "text", + "content": "6. Ceylan, D., Huang, C.H.P., Mitra, N.J.: Pix2video: Video editing using image diffusion. arXiv preprint arXiv:2303.12688 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 533, + 481, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 533, + 481, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 533, + 481, + 577 + ], + "type": "text", + "content": "7. Chan, E.R., Lin, C.Z., Chan, M.A., Nagano, K., Pan, B., De Mello, S., Gallo, O., Guibas, L.J., Tremblay, J., Khamis, S., et al.: Efficient geometry-aware 3d generative adversarial networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16123-16133 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 577, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 481, + 610 + ], + "type": "text", + "content": "8. Chan, E.R., Monteiro, M., Kellnhofer, P., Wu, J., Wetzstein, G.: Pi-GAN: Periodic implicit generative adversarial networks for 3D-aware image synthesis. In: CVPR (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 610, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 610, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 610, + 481, + 665 + ], + "type": "text", + "content": "9. Çiçek, Ö., Abdulkadir, A., Lienkamp, S.S., Brox, T., Ronneberger, O.: 3d u-net: learning dense volumetric segmentation from sparse annotation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2016: 19th International Conference, Athens, Greece, October 17-21, 2016, Proceedings, Part II 19. pp. 424-432. Springer (2016)" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 416, + 90, + 447, + 101 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "10. Dai, Y., Yang, M., Dai, B., Dai, H., Nachum, O., Tenenbaum, J., Schuurmans, D., Abbeel, P.: Learning universal policies via text-guided video generation. arXiv preprint arXiv:2302.00111 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 480, + 183 + ], + "type": "text", + "content": "11. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. arXiv preprint arXiv:2302.03011 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 184, + 480, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 184, + 480, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 184, + 480, + 228 + ], + "type": "text", + "content": "12. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. In: International Conference on Machine Learning. pp. 11808-11826. PMLR (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 228, + 480, + 261 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 480, + 261 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 480, + 261 + ], + "type": "text", + "content": "13. He, Y., Yang, T., Zhang, Y., Shan, Y., Chen, Q.: Latent video diffusion models for high-fidelity video generation with arbitrary lengths. arXiv preprint arXiv:2211.13221 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 262, + 480, + 295 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 262, + 480, + 295 + ], + "spans": [ + { + "bbox": [ + 132, + 262, + 480, + 295 + ], + "type": "text", + "content": "14. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., Salimans, T.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 296, + 480, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 296, + 480, + 317 + ], + "spans": [ + { + "bbox": [ + 132, + 296, + 480, + 317 + ], + "type": "text", + "content": "15. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Advances in Neural Information Processing Systems (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 318, + 480, + 340 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 318, + 480, + 340 + ], + "spans": [ + { + "bbox": [ + 132, + 318, + 480, + 340 + ], + "type": "text", + "content": "16. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models, 2022. URL https://arxiv.org/abs/2204.03458" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 341, + 480, + 362 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 341, + 480, + 362 + ], + "spans": [ + { + "bbox": [ + 132, + 341, + 480, + 362 + ], + "type": "text", + "content": "17. Ho, J., Salimans, T., Gritsenko, A., Chan, W., Norouzi, M., Fleet, D.J.: Video diffusion models. arXiv preprint arXiv:2204.03458 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 363, + 480, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 480, + 385 + ], + "type": "text", + "content": "18. Hore, A., Ziou, D.: Image quality metrics: Psnr vs. sSIM. In: 2010 20th international conference on pattern recognition. pp. 2366-2369. IEEE (2010)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "type": "text", + "content": "19. Hu, Y., Chen, Z., Luo, C.: Lamd: Latent motion diffusion for video generation. arXiv preprint arXiv:2304.11603 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 408, + 480, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 480, + 430 + ], + "type": "text", + "content": "20. Huynh-Thu, Q., Ghanbari, M.: Scope of validity of psnr in image/video quality assessment. Electronics letters 44(13), 800-801 (2008)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 430, + 480, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 480, + 453 + ], + "type": "text", + "content": "21. Kalchbrenner, N., Oord, A., Simonyan, K., Danihelka, I., Vinyals, O., Graves, A., Kavukcuoglu, K.: Video pixel networks. In: ICML (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 453, + 480, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 480, + 475 + ], + "type": "text", + "content": "22. Karpathy, A., Toderici, G., Shetty, S., Leung, T., Sukthankar, R., Fei-Fei, L.: Large-scale video classification with convolutional neural networks. In: CVPR (2014)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 475, + 480, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 480, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 480, + 508 + ], + "type": "text", + "content": "23. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 509, + 480, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 480, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 480, + 531 + ], + "type": "text", + "content": "24. Li, Y., Min, M., Shen, D., Carlson, D., Carin, L.: Video generation from text. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 532, + 480, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 480, + 553 + ], + "type": "text", + "content": "25. Liu, S., Zhang, Y., Li, W., Lin, Z., Jia, J.: Video-p2p: Video editing with cross-attention control. arXiv preprint arXiv:2303.04761 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 554, + 480, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 480, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 480, + 586 + ], + "type": "text", + "content": "26. Ma, X., Wang, Y., Jia, G., Chen, X., Liu, Z., Li, Y.F., Chen, C., Qiao, Y.: Latte: Latent diffusion transformer for video generation. arXiv preprint arXiv:2401.03048 (2024)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 587, + 465, + 598 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 587, + 465, + 598 + ], + "spans": [ + { + "bbox": [ + 132, + 587, + 465, + 598 + ], + "type": "text", + "content": "27. Mei, K., Patel, V.M.: Vidm: Video implicit diffusion models. In: AAAI (2023)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "text", + "content": "28. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: Proceedings of the 25th ACM international conference on Multimedia. pp. 1789-1798 (2017)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "text", + "content": "29. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 208, + 100 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "30. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 149, + 482, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 149, + 482, + 193 + ], + "spans": [ + { + "bbox": [ + 130, + 149, + 482, + 193 + ], + "type": "text", + "content": "31. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10219-10228 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 193, + 482, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 193, + 482, + 225 + ], + "spans": [ + { + "bbox": [ + 130, + 193, + 482, + 225 + ], + "type": "text", + "content": "32. Schwarz, K., Liao, Y., Niemeyer, M., Geiger, A.: Graf: Generative radiance fields for 3d-aware image synthesis. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 225, + 482, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 225, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 225, + 482, + 258 + ], + "type": "text", + "content": "33. Secker, A., Taubman, D.: Highly scalable video compression using a lifting-based 3d wavelet transform with deformable mesh motion compensation. In: Proceedings. International Conference on Image Processing. vol. 3, pp. 749-752. IEEE (2002)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 258, + 482, + 279 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 258, + 482, + 279 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 482, + 279 + ], + "type": "text", + "content": "34. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: First order motion model for image animation. In: NeurIPS (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 279, + 482, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 279, + 482, + 311 + ], + "spans": [ + { + "bbox": [ + 130, + 279, + 482, + 311 + ], + "type": "text", + "content": "35. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. In: ICLR (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 311, + 482, + 343 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 482, + 343 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 482, + 343 + ], + "type": "text", + "content": "36. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: StyleGAN-V: A continuous video generator with the price, image quality and perks of StyleGAN2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 343, + 482, + 387 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 343, + 482, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 343, + 482, + 387 + ], + "type": "text", + "content": "37. Skorokhodov, I., Tulyakov, S., Elhoseiny, M.: Stylegan-v: A continuous video generator with the price, image quality and perks of stylegan2. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3626-3636 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 386, + 482, + 408 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 386, + 482, + 408 + ], + "spans": [ + { + "bbox": [ + 130, + 386, + 482, + 408 + ], + "type": "text", + "content": "38. Soomro, K., Zamir, A.R., Shah, M.: UCF101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 408, + 482, + 440 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 408, + 482, + 440 + ], + "spans": [ + { + "bbox": [ + 130, + 408, + 482, + 440 + ], + "type": "text", + "content": "39. Tian, Y., Ren, J., Chai, M., Olszewski, K., Peng, X., Metaxas, D.N., Tulyakov, S.: A good image generator is what you need for high-resolution video synthesis. In: ICLR (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 440, + 482, + 461 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 440, + 482, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 440, + 482, + 461 + ], + "type": "text", + "content": "40. Tulyakov, S., Liu, M.Y., Yang, X., Kautz, J.: MoCoGAN: Decomposing motion and content for video generation. In: CVPR (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 461, + 482, + 494 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 461, + 482, + 494 + ], + "spans": [ + { + "bbox": [ + 130, + 461, + 482, + 494 + ], + "type": "text", + "content": "41. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 494, + 482, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 494, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 494, + 482, + 525 + ], + "type": "text", + "content": "42. Unterthiner, T., van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Fvd: A new metric for video generation. In: DGS@ICLR (2019), https://apisemantic scholar.org/CorpusID:198489709" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 525, + 482, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 548 + ], + "type": "text", + "content": "43. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 548, + 482, + 579 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 548, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 548, + 482, + 579 + ], + "type": "text", + "content": "44. Voleti, V., Jolicoeur-Martineau, A., Pal, C.: Mcvd-masked conditional video diffusion for prediction, generation, and interpolation. Advances in Neural Information Processing Systems 35, 23371-23385 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 579, + 482, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 579, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 579, + 482, + 601 + ], + "type": "text", + "content": "45. Vondrick, C., Pirsiavash, H., Torralba, A.: Generating videos with scene dynamics. In: NeurIPS (2016)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 601, + 482, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 601, + 482, + 633 + ], + "spans": [ + { + "bbox": [ + 130, + 601, + 482, + 633 + ], + "type": "text", + "content": "46. Wang, B., Wang, Y., Selesnick, I., Vetro, A.: Video coding using 3d dual-tree wavelet transform. EURASIP Journal on Image and Video Processing 2007, 1-15 (2007)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 633, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 633, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 633, + 482, + 666 + ], + "type": "text", + "content": "47. Wang, J., Huang, K.: Medical image compression by using three-dimensional wavelet transformation. IEEE Transactions on Medical Imaging 15(4), 547-554 (1996)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 416, + 91, + 447, + 100 + ], + "type": "text", + "content": "HVDM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 369 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "48. Wang, T., Zhang, B., Zhang, T., Gu, S., Bao, J., Baltrusaitis, T., Shen, J., Chen, D., Wen, F., Chen, Q., et al.: Rodin: A generative model for sculpting 3d digital avatars using diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4563-4573 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 161, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 481, + 182 + ], + "type": "text", + "content": "49. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 182, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 481, + 215 + ], + "type": "text", + "content": "50. Wu, J.Z., Ge, Y., Wang, X., Lei, W., Gu, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. arXiv preprint arXiv:2212.11565 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 215, + 481, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 215, + 481, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 215, + 481, + 247 + ], + "type": "text", + "content": "51. Xiong, W., Luo, W., Ma, L., Liu, W., Luo, J.: Learning to generate time-lapse videos using multi-stage dynamic generative adversarial networks. In: CVPR (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "type": "text", + "content": "52. Yan, W., Zhang, Y., Abbeel, P., Srinivas, A.: VideoGPT: Video generation using VQ-VAE and transformers. arXiv preprint arXiv:2104.10157 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 270, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 481, + 293 + ], + "type": "text", + "content": "53. Yu, S., Sohn, K., Kim, S., Shin, J.: Video probabilistic diffusion models in projected latent space. arXiv preprint arXiv:2302.07685 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "text", + "content": "54. Yu, S., Tack, J., Mo, S., Kim, H., Kim, J., Ha, J.W., Shin, J.: Generating videos with dynamics-aware implicit generative adversarial networks. In: The Tenth International Conference on Learning Representations (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 325, + 481, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 325, + 481, + 347 + ], + "spans": [ + { + "bbox": [ + 132, + 325, + 481, + 347 + ], + "type": "text", + "content": "55. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "text", + "content": "56. Zhou, D., Wang, W., Yan, H., Lv, W., Zhu, Y., Feng, J.: Magicvideo: Efficient video generation with latent diffusion models. arXiv preprint arXiv:2211.11018 (2022)" + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 208, + 101 + ], + "type": "text", + "content": "Kim et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_content_list.json b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..ce1652ed124e4e3e2043e8c92476a6e97cafea31 --- /dev/null +++ b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_content_list.json @@ -0,0 +1,2106 @@ +[ + { + "type": "text", + "text": "HybridBooth: Hybrid Prompt Inversion for Efficient Subject-Driven Generation", + "text_level": 1, + "bbox": [ + 254, + 140, + 750, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Shanyan Guan $^{1\\star}$ , Yanhao Ge $^{1,3\\star}$ , Ying Tai $^{2\\boxtimes}$ , Jian Yang $^{2}$ Wei Li $^{1}$ , and Mingyu You $^{3\\star\\star\\boxtimes}$", + "bbox": [ + 274, + 210, + 725, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ vivo Mobile Communication Co., Ltd", + "bbox": [ + 369, + 253, + 630, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ School of Intelligence Science and Technology, Nanjing University", + "bbox": [ + 276, + 268, + 723, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 College of Electronic and Information Engineering, Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University", + "bbox": [ + 217, + 282, + 781, + 310 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{guanshanyan, halege}@vivo.com yingtai@nju.edu.cn myyou@tongji.edu.cn https://sites.google.com/view/hybridbooth", + "bbox": [ + 222, + 311, + 779, + 339 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Recent advancements in text-to-image diffusion models have shown remarkable creative capabilities with textual prompts, but generating personalized instances based on specific subjects, known as subject-driven generation, remains challenging. To tackle this issue, we present a new hybrid framework called HybridBooth, which merges the benefits of optimization-based and direct-regression methods. HybridBooth operates in two stages: the Word Embedding Probe, which generates a robust initial word embedding using a fine-tuned encoder, and the Word Embedding Refinement, which further adapts the encoder to specific subject images by optimizing key parameters. This approach allows for effective and fast inversion of visual concepts into textual embedding, even from a single image, while maintaining the model's generalization capabilities.", + "bbox": [ + 259, + 375, + 740, + 541 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Customized Generation $\\cdot$ Image Inversion $\\cdot$ Image synthesis", + "bbox": [ + 261, + 553, + 740, + 566 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 593, + 375, + 608 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recent advancements in text-to-image diffusion models [25, 34] have demonstrated unprecedented creating capabilities guided by textual prompts, such as creative endeavors in visual arts [28], synthetic dataset build-up [45], and image editing for marketing and advertising [24]. However, creating personalized instantiations based on specific subjects remains a challenging problem, also known as subject-driven generation [9,10,30,36,46].", + "bbox": [ + 212, + 623, + 787, + 714 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "To achieve subject-driven generation, recent works [9, 10, 36] explore the inversion of subject images into specific textual embeddings, either through iterative optimization (optimization-based) or direct regression methods. These two paradigms are summarized in Fig. 2. Optimization-based methods, such as", + "bbox": [ + 212, + 715, + 787, + 776 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Equal contributions. Ying Tai and Mingyu You are corresponding authors.", + "bbox": [ + 215, + 782, + 733, + 797 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "\\*\\* Mingyu You is also affiliated with State Key Laboratory of Intelligent Autonomous Systems, Frontiers Science Center for Intelligent Autonomous Systems, Shanghai Key Laboratory of Intelligent Autonomous Systems", + "bbox": [ + 215, + 797, + 785, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/7a8a5514cf0765683bc565a978045a0bad2a2b743bd866d5cfc5613c049c54d9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 250, + 171, + 333, + 212 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/8780147643ef99d3eca980681de55126c2b8aac31fa9a605ffc7a122ac667302.jpg", + "image_caption": [ + "Input Image" + ], + "image_footnote": [], + "bbox": [ + 251, + 234, + 331, + 296 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/cabd0c67d91a6d2be0e8c26d894f55a5ef42493f2b4e6a96468ce0455623054f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 334, + 145, + 751, + 233 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/7714d85bbb1c3349d0c3a041595c80612d96abedd8bf6abeaa18e77500179b12.jpg", + "image_caption": [ + "InputImage", + "HybridBooth (Ours) 3~5 steps" + ], + "image_footnote": [], + "bbox": [ + 336, + 234, + 416, + 296 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/6313e6724bd5d8907850035fc2e9d4f97d209141c4a1b3a7b220847b1e9c482d.jpg", + "image_caption": [ + "Custom Diffusion 200 * steps", + "Fig.1: We propose HybridBooth for efficient subject-driven generation. Unlike FastComposer [48], which targets humans, it cannot affect the Bronze Mask (Top). Compared to optimization-based [19,36] and direct-regression-based methods [47,48], our framework generates diverse, precise images while preserving the subject's identity, requiring only $3 \\sim 5$ optimization iterations." + ], + "image_footnote": [], + "bbox": [ + 419, + 234, + 500, + 296 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/a66ea35773032713da35ab1773bbb685038952c30e00f7ea8143e93189ff2334.jpg", + "image_caption": [ + "DreamBooth 1000\\*steps" + ], + "image_footnote": [], + "bbox": [ + 500, + 234, + 581, + 296 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/e2f560baedc35822cf5ab0b1addeda8711e651a551f611077f30988c67a76db8.jpg", + "image_caption": [ + "Fast Composer $1^{*}$ step" + ], + "image_footnote": [], + "bbox": [ + 584, + 234, + 666, + 296 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/a4b45c60d5ccc3f459f3b4a4a33dd981a48db52c99c603872ffc795b80fa1405.jpg", + "image_caption": [ + "ELITE $I^{*}$ step" + ], + "image_footnote": [], + "bbox": [ + 669, + 234, + 750, + 296 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Textual Inversion and DreamBooth [9, 37], iteratively optimize the generation model or textual embedding of the subject to better align with given subject images. Constrained by tens of subject images, optimization-based methods can accurately capture the identifying characteristics of the subject. However, the optimization procedure is computationally expensive and slow to converge. In comparison, direct-regression-based methods [1-3,7,10,39-41,44,47] achieve textual concept inversion by tuning a pre-trained model with labeled datasets or concept-specific images. While these methods enable zero-shot subject-driven generation, they suffer from detail loss and adaptation issues when combining the target subject with new styles or prompts.", + "bbox": [ + 212, + 440, + 787, + 590 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we introduce a novel framework called HybridBooth, designed for efficient subject-driven generation using text-to-image diffusion models. The core idea is to synergistically combine the strengths of various methods, creating a hybrid approach that balances quality and speed. As shown in Fig. 2, HybridBooth operates in two stages. The first stage, termed Word Embedding Probe, employs an encoder to generate a robust initial word embedding. This encoder is fine-tuned on a large-scale dataset such as FFHQ [14] with 70,000 images. In the second stage, the domain-agnostic encoder undergoes further finetuning to adapt to a specific subject's image in a word embedding refinement process. This stage focuses on optimizing the most influential parameters of the regressor. These two stages work collaboratively, enhancing each other to achieve precise and efficient subject-driven generation.", + "bbox": [ + 212, + 590, + 787, + 771 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Overall, our contributions are summarized as follows:", + "bbox": [ + 238, + 772, + 624, + 786 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "- Combining strengths of both optimization-based and direct-regression-based paradigms, we propose HybridBooth for precise and efficient subject-driven generation in less than 5 iteration steps.", + "bbox": [ + 223, + 794, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 114, + 622, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/21a6c09eb3d5e647d1f5f8e6c6b83e7419883a58364950bdd682271813f03616.jpg", + "image_caption": [ + "Fig. 2: Comparing with previous frameworks, our method leverages a coarse-to-fine strategy, effectively integrating the advantages of both optimization- and regression-based methods. Consequently, we enable a fast prompt inversion with high-fidelity generation from just a single image." + ], + "image_footnote": [], + "bbox": [ + 263, + 155, + 495, + 236 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/f997ece0278d0771463b37d284f4901ccb008e3517c63eef46c5f2790d497842.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 263, + 238, + 491, + 318 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/a4aa15340262ead98937e3a575b3f2adcc829b8b6aa14721c7bbba9239f6746f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 506, + 155, + 741, + 318 + ], + "page_idx": 2 + }, + { + "type": "table", + "img_path": "images/5f3c0b07e719233230c7dffaaf38c7bb1663eb378c40b8249952f3ef1875ebc9.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodFast Prompt InversionHigh-Fidelity GenerationSubject Images Needed
1. Optimization-basedX✓Multiple
2. Direct-regression-based✓XSingle
3. HybridBooth (Ours)✓✓Single
", + "bbox": [ + 263, + 321, + 745, + 410 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We craft a Regressor-based Word Embedding Probe module to ensure a robust feature initialization while maintaining a focus on general-oriented generation model.", + "- We introduce a residual refinement strategy to accelerate the fitting process while preventing the collapse of the prior learned during the probe stage." + ], + "bbox": [ + 223, + 521, + 784, + 598 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 625, + 387, + 641 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Text-to-image Generation", + "text_level": 1, + "bbox": [ + 214, + 660, + 475, + 674 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Text-to-image generation focuses on creating visually accurate and contextually relevant images from textual descriptions. Early approaches, such as Generative Adversarial Networks (GANs) [11, 12, 15, 51], achieved high-quality synthetic images. However, these studies primarily emphasize image generation within specific domains, leading to limitations in extended applications. The progress of large language models [6,8,31,42,43] has enabled methods based on variational auto-encoders [17, 26] and diffusion models [32, 34, 38] to effectively map word sequences into latent space, guiding image generation from textual prompts. Our method leverages pre-trained text-to-image diffusion models to generate personalized visual content efficiently and effectively.", + "bbox": [ + 212, + 689, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.2 Subject-driven Generation", + "text_level": 1, + "bbox": [ + 215, + 146, + 480, + 161 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Subject-driven generation is a type of controllable generation task that aims to generate instances of specific subjects in new contexts (e.g., styles, scenarios). Current approaches can be broadly categorized into two types: 1) optimization-based and 2) direct-regression-based methods.", + "bbox": [ + 212, + 186, + 787, + 247 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Optimization-based Methods iteratively refine images to align with given textual descriptions. Inversion is a common technique to preserve a subject while modifying its context. For GANs, Pivot Tuning [33] fine-tunes the model using an inverted latent code for robust, ID-preserving generation. Recent work [29] keeps GAN-generated subjects consistent and controllable. However, these methods often struggle with unique subjects and fail to preserve all details. In diffusion models, inversion aims to determine the initial noise that generates the target image through denoising. Methods like DreamBooth and Textual Inversion [9, 19, 36, 37] personalize pre-trained models to generate specific subjects in various contexts but are computationally intensive and slow to converge. Our method uses a hybrid framework for robust initial feature encoding, followed by rapid optimization, achieving superior efficiency.", + "bbox": [ + 212, + 261, + 787, + 444 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Direct-regression-based Methods generate subject-specific images directly from textual prompts without iterative optimization, relying on extensive model modifications on large datasets. These methods generate images from scratch based on learned text-visual correlations. Previous GAN-based methods [1, 7, 39, 40, 44] retrain generators or add conditioned constraints for ID-preserving generation but are limited by their training sets. Recent diffusion-based methods [2, 3, 10, 41, 47] tune only the encoder of pre-trained models, offering efficiency but risking overfitting and reduced performance on diverse tasks. To address these limitations, HybridBooth initially refines the encoder and employs a subject-driven residual refinement module. This process requires only 3 to 5 steps, resulting in more detailed and robust images compared to other direct-regression-based methods.", + "bbox": [ + 212, + 458, + 789, + 640 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 662, + 382, + 678 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Text-to-Image Latent Diffusion Models", + "text_level": 1, + "bbox": [ + 215, + 694, + 586, + 709 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We implemented our method based on text-to-image Latent Diffusion Models (LDMs) [34] which can understand prompts and generate vivid images. LDMs mainly consist of three components, including a variational auto-encoder (VAE) [26], an UNet, and a CLIP text encoder [31]. The VAE encoder $\\mathcal{E}$ compresses $\\pmb{x}$ into a low-dimensional latent code $z = \\mathcal{E}(\\pmb{x})$ , and the decoder $\\mathcal{D}$ maps the latent code $\\pmb{z}$ back to image space $\\hat{\\pmb{x}} = \\mathcal{D}(\\pmb{z})$ . For the text-guided diffusion process, the latent code $\\pmb{z}$ is perturbed by Gaussian noise $\\epsilon$ . Then the UNet $\\mathcal{M}_{\\theta}$ learns to predict the applied noise $\\pmb{z}_t$ with a specified time step $t$ . The denoising", + "bbox": [ + 212, + 718, + 787, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 113, + 622, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/0d44240b1b720294e4720973c6e443c8e71f63707e3a9f610dc380b6f159ec80.jpg", + "image_caption": [ + "Fig. 3: Showcasing our prompt inversion framework incorporating various conditions (depth, canny, keypoints) and community models1." + ], + "image_footnote": [], + "bbox": [ + 220, + 145, + 782, + 229 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "process is conditioned on the text feature $\\pmb{c}$ extracted from text prompts $\\pmb{y}$ by using text encoder $\\tau_{\\pmb{\\theta}}$ . The training loss is formulated as:", + "bbox": [ + 214, + 301, + 782, + 330 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\epsilon} = \\mathbb {E} _ {\\boldsymbol {z} \\sim \\mathcal {E} (\\boldsymbol {x}), \\epsilon \\sim \\mathcal {N} (0, 1), \\boldsymbol {c}, t} \\left[ \\left\\| \\boldsymbol {\\epsilon} - \\mathcal {M} _ {\\boldsymbol {\\theta}} \\left(\\boldsymbol {z} _ {t}, \\boldsymbol {c}, t\\right) \\right\\| _ {2} ^ {2} \\right]. \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 337, + 784, + 362 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "During inference, given a prompt $\\pmb{y}$ , the model iteratively denoises $\\pmb{z}_t$ conditioned on the text feature $\\pmb{c} = \\tau_{\\pmb{\\theta}}(\\pmb{y})$ . Finally, $\\pmb{z}_0$ is decoded to an image $\\hat{\\pmb{x}} = \\mathcal{D}(\\pmb{z}_0)$ .", + "bbox": [ + 214, + 369, + 782, + 400 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Prompt Inversion for Subject-Dirven Generation", + "text_level": 1, + "bbox": [ + 215, + 419, + 663, + 434 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Despite the remarkable general generation capability of LDMs, challenges remain in generating specific subjects across various contexts, known as Subject-Driven Generation [9,36]. One feasible approach is to learn textual concepts from subject-specific images, referred to as Prompt Inversion [3,10,21]. Given several images $\\mathbf{X}$ of a subject, the prompt inversion aims to inverse the visual content of the subject to the embedding of words $\\mathbf{e}$ :", + "bbox": [ + 214, + 441, + 782, + 532 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {e} \\leftarrow \\mathcal {I} (\\boldsymbol {X}), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 457, + 540, + 784, + 556 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathcal{I}$ represents the inversion process. The primary goal of the inversion process is to ensure that $e\\in \\mathbb{R}^{n\\times d}$ captures the key identifying characteristics of the subject. The word embedding $\\pmb{e}$ is then encoded into textual features $\\pmb{c}$ using a pre-trained text encoder (i.e., CLIP). Once $\\pmb{e}$ is learned, it can be readily combined with arbitrary text for the creative generation of the subject. Specifically, let 'S*' be the text word corresponding to the learned embedding $\\pmb{e}$ , we can combine 'S*' with new prompts to realize arbitrary subject-driven image synthesis, e.g. 'S* in snow forest'.", + "bbox": [ + 214, + 564, + 784, + 685 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Discussion. Another paradigm involves mapping subject images to image tokens and using an additional cross-attention layer to inject these tokens into the diffusion process. This paradigm significantly alters the generation process of the original Latent Diffusion Models (LDMs), necessitating retraining on millions of images. In contrast, prompt inversion is a more resource-efficient method for subject-driven generation. As shown in Fig. 3, it can seamlessly integrate with various community foundational models and controllers pre-trained on the original stable diffusion, making it a versatile and practical alternative.", + "bbox": [ + 214, + 696, + 782, + 816 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_footnote", + "text": "1 disneyPixarCartoon_v10: civitai.com/models/65203/disney-pixel-cartoon-type-a", + "bbox": [ + 217, + 824, + 769, + 840 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/0572023978e62c53a3812efd3f2aee27c2a4f63fc53d5663827a5748c08513f0.jpg", + "image_caption": [ + "Fig. 4: The framework of HybridBooth consists of two stages: (a) The first Probe Stage leverages a prompt regressor estimate the initial word embedding, acting as a probe for a rational word embedding; (b) The second Refinement Stage adapts the regressor to the subject by taking only 3-5 iterations to achieve efficient subject generation." + ], + "image_footnote": [], + "bbox": [ + 246, + 143, + 759, + 354 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Hybrid Prompt Inversion Framework", + "text_level": 1, + "bbox": [ + 215, + 449, + 612, + 467 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Given just one image $\\pmb{x}$ of a specific subject, we aim to efficiently embed the subject into the word embedding space. We combine the strengths of optimization and direct-regression-based paradigms to achieve precise and efficient subject-driven generation. Thus, we propose a hybrid prompt inversion framework, termed HybridBooth. As shown in Fig. 4, HybridBooth consists of two stages: (1) Word Embedding Probe Stage, which learns a domain-agnostic encoder providing an initial word embedding estimate. (2) Word Embedding Refinement Stage, which adapts the encoder to the given image of the subject. The key idea is: A powerful encoder reduces iterative refinement costs, while effective iterative refinement reduces the encoder's accuracy demands. Our challenge is to develop a robust encoder for initial embeddings and an effective refinement scheme to reduce the encoder's precision requirements. Next, we introduce the Word Embedding Probe stage in Sec. 4.1, describe the residual refinement stage in Sec. 4.2, and present the framework details in Sec. 4.3.", + "bbox": [ + 212, + 479, + 787, + 691 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 Regressor-based Word Embedding Probe", + "text_level": 1, + "bbox": [ + 215, + 710, + 602, + 728 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "First, HybridBooth trains a prompt regressor that takes an image of a subject as input and estimates the initial word embedding. This involves extracting multi-grained image features and conducting multiple-word regression.", + "bbox": [ + 214, + 734, + 785, + 781 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Multi-grained Image Feature Merging. Existing regressor-based methods exclusively utilize CLIP features $\\pmb{f}_c$ , which often contain global semantic information (e.g., subject's category) [13,31,36]. Hence, we incorporate DINOv2 [27]", + "bbox": [ + 214, + 794, + 785, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 114, + 622, + 128 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/1a1a77edb2c46ce41186e8b1c0da6cc118e675aa18df42c0acebf72140438d01.jpg", + "image_caption": [ + "Fig. 5: Impact of hyper-parameters in the residual refinement stage (on the Dream-Booth dataset [36]). Default parameters are marked with red circles. Custom Diffusion [19] serves as the reference. Prompt Fidelity and Subject Fidelity are CLIP-I and DINO-T, respectively (see Sec. 5.1)." + ], + "image_footnote": [], + "bbox": [ + 235, + 148, + 769, + 232 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "features $\\pmb{f}_d$ as a supplement, offering detailed pixel-level information. Taking inspiration from previous practices [13,48], we employ a Multilayer Perceptron (MLP) to project DINOv2 features $\\pmb{f}_d$ , then concatenate the output with CLIP feature $\\pmb{f}_c$ . Finally we align the feature dimension using a Linear layer [35]. The merging process is formulated as:", + "bbox": [ + 212, + 329, + 782, + 404 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {f} = \\operatorname {L i n e a r} \\left(\\left[ \\boldsymbol {f} _ {c}, \\operatorname {M L P} \\left(\\boldsymbol {f} _ {d}\\right) \\right]\\right), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 412, + 785, + 430 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $[\\cdot, \\cdot]$ represents the concatenation operation, and the structure of MLP is LyaerNorm-Linear-GELU [49]-Linear. As verified in our experiments, this simple module yields significant improvements.", + "bbox": [ + 212, + 436, + 782, + 482 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Multiple-word Regression. The merged feature $\\pmb{f}$ is then mapped to word embeddings $\\pmb{e}$ . Typically, a single word represents a specific concept, e.g. 'man' conveys the subject's category but may lack details like hairstyle. Thus, we suggest projecting the feature $\\pmb{f}$ to multiple-word embeddings to provide a more thorough description of the subject:", + "bbox": [ + 212, + 494, + 782, + 569 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {e} = \\mathcal {R} (\\boldsymbol {f}), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 460, + 578, + 785, + 594 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\pmb{e} = \\{\\pmb{e}_i\\}_{i=1}^n$ , $n$ is the number of word embeddings $\\pmb{e}_i \\in \\mathbb{R}^d$ , and $d$ is the dimension of word embedding.", + "bbox": [ + 212, + 602, + 782, + 633 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 Residual Refinement", + "text_level": 1, + "bbox": [ + 214, + 652, + 433, + 666 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Although the regressor-based probe is fast, precise alignment between word embeddings and key subject features remains challenging without image feature feedback. Thus, our subsequent stage focuses on refinement, aiming to adapt the learned regressor to target subject for better alignment. Striking a balance is challenging due to the single image input, as it requires avoiding overfitting to a specific image while capturing essential subject characteristics effectively.", + "bbox": [ + 212, + 674, + 782, + 763 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To tackle this issue, we enhance the learned regressor with a residual refinement strategy that adjusts only critical parameters $(\\boldsymbol{W}_{\\phi})$ for faster adaptation while preserving the learned prior. The residual refinement is formulated as:", + "bbox": [ + 212, + 765, + 782, + 809 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {W} _ {\\phi} ^ {\\prime} = \\boldsymbol {W} _ {\\phi} + \\lambda \\Delta \\boldsymbol {W} _ {\\phi}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 816, + 785, + 837 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 127 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 125 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/4e6b667778398e427a2a160dd7571de1566c659073cd7c842bab27f13b07633f.jpg", + "image_caption": [ + "Fig. 6: Showcases of the cross-attention map for the subject word 'S*'. Applying mask regularization $\\mathcal{L}_M$ prevents attention leakage to irrelevant areas, even with other subjects present (highlighted in red boxes)." + ], + "image_footnote": [], + "bbox": [ + 230, + 143, + 767, + 205 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\Delta W_{\\phi}$ is the learned residual parameters and a hyperparameter $\\lambda$ is to control the scale of $\\Delta W_{\\phi}$ . With residual refinement, it only takes 3-5 iterations to achieve high-fidelity subject generation while preserving editability.", + "bbox": [ + 212, + 294, + 784, + 339 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Discussing the overfitting problem. Overfitting is a common challenge in finetune-based methods, especially when tuning the prompt regressor on a single image. To mitigate this, we refine only partial parameters (see Eq. (5)). Intuitively understanding, $W_{\\phi}$ acts as an anchor, preserving the learned prior and stabilizing updates. Zeroing out $W_{\\phi}$ collapses its prior (see the last column in Fig. 10), and we need to adjust hyper-parameters more carefully. As shown in Fig. 5, by using residual refinement, $\\lambda$ and iteration steps can vary widely yet still yield good results. Fig. 7 and Fig. 9 demonstrate that HybridBoothcan generate novel subject images with diverse expressions, postures, styles, and scenarios.", + "bbox": [ + 212, + 354, + 784, + 489 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 Framework Details", + "text_level": 1, + "bbox": [ + 215, + 512, + 418, + 526 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Prompt Regressor Design. Previous studies have used either an MLP or a UNet as the prompt regressor. HybridBooth is flexible and can integrate any network mapping image features $\\pmb{f}$ to word embeddings $\\pmb{e}$ . We employ the state-of-the-art regressor PromptNet [50], which uses a block structure similar to LDM and can be initialized with LDM pretrained on large-scale image datasets. In the refinement stage, we focus on refining the cross-attention layer parameters (key, query, and value matrices $\\mathbf{W}_k$ , $\\mathbf{W}_q$ , $\\mathbf{K}_v$ ) based on layer importance experiments. Fine-tuning the entire regressor with 100 images, we calculated importance scores for each layer based on the mean cosine distance of parameters before and after refinement: cross-attention (56.3), self-attention (43.9), and other layers (e.g. convolution) (12.4). The cross-attention layer had the highest importance. Similar experiments by Custom Diffusion [20] and E4T [10] focused on the denoising UNet within LDMs.", + "bbox": [ + 212, + 537, + 787, + 734 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Training with Mask Regularization. The diffusion loss $\\mathcal{L}_{\\epsilon}$ (Eq. (1)) is commonly used for training the prompt regressor. However, as shown in Fig. 6 (Left), the cross-attention maps of the subject's word embedding often leak into the irrelevant background. To address this, we use the subject's mask to constrain the cross-attention maps of subject words, ensuring focus on the subject region. Let $A_{e_i} \\in \\mathbb{R}^{h \\times w}$ be the attention map for $e_i$ , and $M \\in \\mathbb{R}^{H \\times W}$ be the segmentation", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 114, + 622, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "mask for the subject. We use a mask regularization loss to align $A_{e_i}$ with $M$ :", + "bbox": [ + 215, + 146, + 785, + 162 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {M} = \\frac {1}{n} \\sum_ {i = 1} ^ {n} \\operatorname {m e a n} \\left(\\boldsymbol {A} _ {\\boldsymbol {e} _ {i}} \\cdot (\\boldsymbol {1} - \\boldsymbol {M})\\right) - \\operatorname {m e a n} \\left(\\boldsymbol {A} _ {\\boldsymbol {e} _ {i}} \\cdot \\boldsymbol {M}\\right), \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 305, + 185, + 785, + 224 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $n$ is the number of word embeddings. This loss minimizes attention outside the mask and maximizes it inside, ensuring focus on the subject. The interpolation of $M$ to match $A_{e_i}$ is omitted for simplicity. The final training objective of the regressor is:", + "bbox": [ + 214, + 234, + 784, + 294 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {\\epsilon} + \\alpha_ {M} \\mathcal {L} _ {M}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 433, + 308, + 785, + 325 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\alpha_{M}$ is the weight of $\\mathcal{L}_M$ . During refinement, $\\mathcal{L}$ is used to prevent diverging update directions, focusing on fine-tuning the cross-attention parameters.", + "bbox": [ + 214, + 335, + 784, + 367 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 215, + 388, + 375, + 407 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 421, + 434, + 436 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets. We mainly conduct experiments on facial images. Following prior research practices, we train HybridBooth on the aligned FFHQ dataset [14], comprising 70,000 in-the-wild facial images. Constrained by computational resources, we conducted testing on the first 1,000 images from the CelebA-HQ test split. In addition, we also evaluate HybridBooth on other categories to demonstrate its versatility. With the same setting of ELITE [47], we train HybridBooth on the test split of OpenImagesv6 [18], and test on the DreamBooth Dataset. All images are cropped and resized to $512 \\times 512$ pixels.", + "bbox": [ + 214, + 446, + 799, + 568 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Training Details. We use Stable Diffusion v1.5 [34] as our Text-to-Image model, initializing the prompt regressor with the UNet from Stable Diffusion. The DINOv2-Large model [27] extracts the DINO feature, and the vision model of clip-vit-large-patch14 [31] extracts the CLIP image feature. The segmentation mask $M$ (Eq. (6)) is obtained using InSPyReNet [16]. We use the same hyperparameters for both facial and non-facial experiments. For the word embedding probe stage, we use the AdamW optimizer [23] with a learning rate of 2e-5 and a batch size of 8. Training on a single Nvidia A100 GPU takes 40 hours. In the refinement stage, we fine-tune the cross-attention parameters of the regressor for 5 steps using AdamW, with a learning rate of 2e-5 and a weight decay of 1e-2. Parameters $\\alpha_{M}$ (Eq. (7)) and $\\lambda$ (Eq. (5)) are set to 1e-3 and 1e-2, respectively.", + "bbox": [ + 214, + 582, + 787, + 750 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Baselines. We compare the proposed HybridBooth with two categories of methods: (1) Optimization-based methods: DreamBooth [36], Textual Inversion [9], and Custom Diffusion [19]. (2) Direct-regression-based methods: ELITE [47] and FastComposer [48]. Optimization-based methods typically require $3 \\sim 5$ images as input, which are not available in CelebA-HQ (our test set). To ensure a fair", + "bbox": [ + 214, + 763, + 787, + 842 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 127 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/5e75fd43dddcfd1645f356ef40263f3ee8c047a6470bd3adb553e15f48717a4b.jpg", + "image_caption": [ + "watercolor painting of a $S^{*}$ in the snow" + ], + "image_footnote": [], + "bbox": [ + 243, + 157, + 754, + 214 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/9265b7d65d582fd14bb13756fc28f7ee179417b4f62ea6b1f5396de1be0b827a.jpg", + "image_caption": [ + "A red S\\* in Pixar style" + ], + "image_footnote": [], + "bbox": [ + 245, + 227, + 754, + 282 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/fa1fa9ea23bb515045d45cd7345838e7dada8d40d0391c13336e8c26904b25fd.jpg", + "image_caption": [ + "Pointillism painting of a $S^{*}$ with night sky", + "Fig. 7: Qualitative Comparison Results on CelebA-HQ (facial dataset). Columns 2-4: Optimization-based methods. Columns 5-6: Direct-regression-based methods." + ], + "image_footnote": [], + "bbox": [ + 245, + 296, + 754, + 351 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "comparison, we augment each image to generate 5 images for these methods using affine transformations and background changes. More details on the augmentation process are provided in the Supplementary. To clarify the difference between HybridBooth and HyperDreamBooth [37], HyperDreamBooth updates weights in a low-rank space for rapid model tuning but overlooks the importance of training a powerful encoder initially. Since the official code for HyperDream-Booth was unavailable during our submission, we could only make qualitative comparisons with examples from their paper (see Fig. 8).", + "bbox": [ + 212, + 431, + 787, + 551 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation Metrics. We evaluate the model's performance in two aspects:", + "bbox": [ + 215, + 565, + 766, + 580 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "- Prompt Fidelity: This measures how well the generated images match the textual prompt, quantified by the average cosine similarity of CLIP embeddings between the prompt and the generated images (CLIP-T). Higher CLIP-T indicates better textual editability.", + "bbox": [ + 223, + 589, + 787, + 648 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "- Subject Fidelity: This assesses the preservation of subject details during generation. We use CLIP-I and DINO-I metrics, which are the cosine similarities between the embeddings of the generated images and the original concept images. Higher values indicate better subject fidelity.", + "bbox": [ + 223, + 648, + 787, + 710 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.2 Qualitative Comparison", + "text_level": 1, + "bbox": [ + 215, + 739, + 457, + 755 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In Fig. 7, we present qualitative comparison results. Similar to previous works, 'S*' denotes the word embedding learned from the input subject image. For a fair comparison, optimization-based methods use 5 images for optimization. Our setting is more complex, specifying both artistic style (e.g., 'watercolor painting') and environmental characteristics (e.g., 'in the snow'). From the results, two key", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 114, + 622, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/ad8bd36f8f997f81ccd433b602bee0c229fc1b0452d113000afdb14a8674c988.jpg", + "image_caption": [ + "Fig. 8: Qualitative Comparison with Hyperdreambooth [37]." + ], + "image_footnote": [], + "bbox": [ + 243, + 148, + 759, + 234 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/7a45b71bd115fed1b47c38d62ffd6e0308897e02fbb3c3741281c2f64771769c.jpg", + "image_caption": [ + "photo of sks dog on top of green grass with sunflowers", + "Fig. 9: Qualitative Comparison Results on non-facial images." + ], + "image_footnote": [], + "bbox": [ + 245, + 301, + 759, + 455 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "observations emerge: (1) Optimization-based methods (Columns 2-4), using multiple image inputs and finely tuned hyper-parameters (e.g., total iteration steps), generally outperform direct-regression-based methods (Columns 5-6) in prompt alignment and subject similarity. (2) Our proposed HybridBooth outperforms all compared methods in text alignment and subject similarity. For example, in the third row, other methods either fail in text similarity (e.g., FastComposer) or in preserving facial similarity, whereas HybridBooth successfully aligns the subject with the editing prompt, demonstrating its superiority.", + "bbox": [ + 212, + 518, + 787, + 640 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Qualitative comparisons with HyperDreamBooth [37] are shown in Fig. 8. HyperDreamBooth trains a hyper-network to predict low-rank weights of the image diffusion model and fine-tunes these weights on one subject image. However, low-rank weight updates limit personalized representation, resulting in poorer subject feature preservation, as seen in Fig. 8. This supports our core idea that a more powerful encoder reduces the cost of iterative refinement.", + "bbox": [ + 212, + 641, + 787, + 732 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "As shown in Fig. 9, we evaluate HybridBooth on non-facial images, including animals (Line 1) and complex buildings (Line 2). FastComposer [48] is excluded as it is designed for facial images. In Line 1, most methods preserve the texture of the subject well. However, in Line 2, only HybridBooth maintains the structural information while adhering to the complex prompt. This is due to the hybrid framework, which enables quick feature learning while retaining the prompt understanding capability of the Stable Diffusion model.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/6d77cd05e1d510a19b170e2bea3246c2c5f8497c1dfca9ab88c7c385a3451131.jpg", + "table_caption": [ + "Table 1: Quantitative Evaluation on the CelebA-HQ. First Block: Optimization-based methods. Second Block: Direct-regression-based methods. Third Block: HybridBooth and its ablations." + ], + "table_footnote": [], + "table_body": "
MethodCelebA-HQDreamBooth-datasetIter. Step↓
CLIP-T ↑CLIP-I ↑DINO-I ↑CLIP-T ↑CLIP-I ↑DINO-I ↑
Textual Inversion [9]0.1640.6120.2360.1830.6630.4625000
DreamBooth [36]0.2510.5640.3760.2510.7850.6741000
Custom Diffusion [19]0.2370.6750.3980.2450.8010.695200
ELITE [47]0.1690.5920.3110.2550.7620.6521
FastComposer [48]0.2010.7820.581---1
HybridBooth0.2460.8650.6440.2610.8650.7555
- w/o Refinement0.1770.8420.5680.1920.8350.645-
- w/o Probe0.1530.4080.0680.1420.4120.0505
- w/o DINO Feature0.1610.8370.4530.1840.8410.5965
- w/o CLIP Feature0.1820.7340.5100.2060.7520.6305
- w/o Mask Regularization0.2030.8310.6250.2330.8330.7055
", + "bbox": [ + 232, + 198, + 767, + 371 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/419d374bde625ea53aceac0a9aaed6fb11cef06e551d905cb846961739bee12e.jpg", + "image_caption": [ + "Input Image", + "Fig. 10: We conducted ablations on HybridBooth to evaluate its influence on learning subject-specific word embeddings. DreamBooth and FastComposer are utilized here for comparison. 'A photo of $S^{*}$ ' is used for generating images." + ], + "image_footnote": [], + "bbox": [ + 238, + 383, + 302, + 479 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/d34a1c353e99dda7abd2422148f91eb1e0d046596e0f94b0c1a64d389cb55613.jpg", + "image_caption": [ + "DreamBooth" + ], + "image_footnote": [], + "bbox": [ + 303, + 383, + 395, + 478 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/695cf3c9aa9a2d70910413a2a8460ef1bb555b813af12946da63900afee7721b.jpg", + "image_caption": [ + "FastComposer" + ], + "image_footnote": [], + "bbox": [ + 397, + 383, + 486, + 478 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/43802b9edac725a355244a1a101a1335bf164e8d9e5b69f868698dbb7f823034.jpg", + "image_caption": [ + "HybridBooth(Ours)" + ], + "image_footnote": [], + "bbox": [ + 488, + 383, + 578, + 478 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/44f5d9f14102809852f169412df007c03ac0a9d7c10d0a7f841d5282a2db463a.jpg", + "image_caption": [ + "- w/o Refinement" + ], + "image_footnote": [], + "bbox": [ + 580, + 383, + 669, + 478 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/e0f44a580c9e64245e057be11fdf892c408a2df9b4d31fcbc2601e31ed050eab.jpg", + "image_caption": [ + "- w/o Probe" + ], + "image_footnote": [], + "bbox": [ + 669, + 383, + 763, + 478 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.3 Quantitative Comparison", + "text_level": 1, + "bbox": [ + 214, + 575, + 472, + 590 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The quantitative results in Tab. 1 include the necessary iteration steps for assessing time efficiency. Optimization-based methods generally outperform direct-regression-based methods but require more iteration steps. Our HybridBooth significantly exceeds other methods in both prompt fidelity and subject fidelity. Notably, our DINO-T metric is over $10\\%$ higher than FastComposer, a key metric in the DreamBooth framework [36].", + "bbox": [ + 212, + 604, + 787, + 696 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.4 Ablation Analysis", + "text_level": 1, + "bbox": [ + 214, + 720, + 410, + 736 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablations on the Hybrid Framework. We evaluate our hybrid framework, which includes a word embedding stage for initial estimation and a residual refinement stage for precise alignment. Ablations, termed 'w/o Probe' and 'w/o Refinement', are shown in Fig. 10 and Tab. 1. The prompt regressor is initialized using the pre-trained UNet from Stable Diffusion in both settings. We assess subject fidelity using the prompt 'A photo of $\\mathbf{S}^*$ , comparing it with DreamBooth", + "bbox": [ + 212, + 750, + 787, + 842 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 114, + 622, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/deb27036284d7cadc70138ced6933f673036d2a8dea34cc256926cb5865e5d8a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 259, + 148, + 344, + 224 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/9803bde3157774622fbdc1c947a7ea7beafec7999277c9d5b29131b3269d718a.jpg", + "image_caption": [ + "A $S^{*}$ dog in the snow" + ], + "image_footnote": [], + "bbox": [ + 348, + 159, + 436, + 224 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/c1bc3dca46b5740c473f87a6d704f676cbdcc9573cad28eded2ffc4fb4061b7b.jpg", + "image_caption": [ + "A S* devil surrounded by flames" + ], + "image_footnote": [], + "bbox": [ + 437, + 159, + 478, + 224 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/594528f3f03d4a57376cbac4809ac12f68dfe639759eaab79acb4d93ee308264.jpg", + "image_caption": [ + "oil painting of a S\\* cat" + ], + "image_footnote": [], + "bbox": [ + 478, + 159, + 612, + 224 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/3ce440721a4f0d7240989c73384989a16b2002991fc1359ebd513b8b399daa03.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 612, + 159, + 743, + 224 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/4599e0af5ee904a764a808e92f95097c1ad41c223ba9c20b83e188e3527ece82.jpg", + "image_caption": [ + "Fig. 11: The learned words from human beings can be applied to cross-species subjects, which verifies that HybridBooth manages to learn intrinsic subject features." + ], + "image_footnote": [], + "bbox": [ + 259, + 228, + 344, + 305 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/ca160794d2fc266f7eea9510b67edb93bb748b510170d5728c88730f249ce590.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 346, + 228, + 478, + 305 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/4b7f53d7e367a547517cfd93a1172da3e7c27a4f4c42b2b48f1c810387a5e973.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 478, + 228, + 609, + 305 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/2d4198638e6790d16344110c16bc9a964c1495d108dc2872695e15bfe5fb5786.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 612, + 228, + 743, + 305 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/6e5ee6343649ee1fa7c277e315d7455f9ebf3f186a246c072ba34505918ed848.jpg", + "image_caption": [ + "Fig. 12: Impact of increasing number of word embeddings (on CelebeA-HQ)." + ], + "image_footnote": [], + "bbox": [ + 292, + 359, + 712, + 441 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "and FastComposer. As shown in Fig. 10, subject embedding from residual refinement alone leads to lower subject similarity. Without refinement, word embedding only crudely captures key features. Our HybridBooth framework, integrating both probe and refinement stages, outperforms all ablations and compared methods, effectively restoring subject characteristics.", + "bbox": [ + 212, + 501, + 784, + 575 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablations on Multi-grained Image Feature Merging. Previous works [47, 48] typically use CLIP features as input for the regressor. As discussed in Sec. 4.1, we use CLIP features for global semantic information and DINO features for detailed pixel-level information. We ablate the feature extraction strategy to verify this approach. As shown in Tab. 1, relying solely on DINO or CLIP features results in suboptimal performance. However, integrating both features significantly enhances performance. Notable improvements in prompt fidelity and subject fidelity are observed, even with just a single layer normalization and linear layer.", + "bbox": [ + 212, + 593, + 784, + 715 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Analysis on the Mask Regularization Loss $\\mathcal{L}_M$ . We propose a mask regularization loss $\\mathcal{L}_M$ (Eq. (6)) to ensure that the estimated word embeddings align with the subject area. As shown in the last line of Tab. 1, both subject fidelity and prompt fidelity decrease significantly without the mask regularization loss.", + "bbox": [ + 212, + 731, + 784, + 792 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablations on the Number of Word Embedding. Recalling that the prompt regressor estimates multiple word embeddings for enhanced description of key", + "bbox": [ + 214, + 809, + 784, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 127 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5166451214f0e0a01c388f7d2250d7c21ea4536ff45ebb7051f56a6e64637c51.jpg", + "image_caption": [ + "Input Image", + "Fig. 13: Showcases of limitations in HybridBooth." + ], + "image_footnote": [], + "bbox": [ + 287, + 143, + 392, + 224 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/188e0cfbae10580c1c8e45228ebeb719fde150b48cdee3e54052b4bd816e7087.jpg", + "image_caption": [ + "$S^{\\star}$ is Laughing" + ], + "image_footnote": [], + "bbox": [ + 395, + 143, + 500, + 224 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/20e741edb3bf5a657360d074c78568427e691c88a13dd4be2f2a089e73947639.jpg", + "image_caption": [ + "$S^{\\star}$ is Drawing" + ], + "image_footnote": [], + "bbox": [ + 501, + 143, + 607, + 224 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/36aa722ab179c1f6723246567918bb661a07d042914192841fbbc7c9e88ad20b.jpg", + "image_caption": [ + "$S^{\\star}$ as a young child" + ], + "image_footnote": [], + "bbox": [ + 609, + 143, + 715, + 224 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "subject features, we adjust the number of embeddings. Quantitative results in Fig. 12 indicate a consistent improvement in metrics related to Prompt Fidelity and Subject Fidelity with an increasing number of words. To balance efficiency and computation cost, we set the number of word embeddings we estimate to 5.", + "bbox": [ + 214, + 295, + 782, + 356 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Can the Learned Subject Concept be Cross-species Adapted? The well-aligned training data in the Probe Stage results in the encoder developing a consistent semantic tendency in attention maps, as shown in Fig. 6. The subsequent Refinement Stage further enhances the model's generalization ability. Fig. 11 illustrates that species with similar semantic structures, such as humans, dogs, and cats, consistently yield robust results, even with complex prompts.", + "bbox": [ + 214, + 369, + 784, + 460 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 483, + 357, + 498 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we address the challenge of achieving fast prompt inversion while preserving the generalization capabilities of text-to-image models. By leveraging both optimization-based and direct-regression-based methods, we propose a two-stage hybrid prompt inversion framework, termed HybridBooth. This framework ensures robust and efficient subject-driven generation while maintaining the model's general creative ability. Experimental results demonstrate the superior performance of HybridBooth compared to existing state-of-the-art methods.", + "bbox": [ + 212, + 513, + 784, + 619 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitation. As shown in Fig. 13, HybridBooth cannot perform precise semantic editing, such as adjusting expressions and age. In addition, HybridBooth inherits the weakness from StableDiffusion that fails to generate fine-grained details of the subject, such as fingers. To address these issues, we believe possible solutions are incorporating language-and-vision models [22] for improved understanding and planning, and utilizing more 3D structural information [4,5].", + "bbox": [ + 214, + 619, + 784, + 710 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement", + "text_level": 1, + "bbox": [ + 215, + 733, + 392, + 750 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This work was supported in part by the National Natural Science Foundation of China under Grant No. 62073244 and 61825303, 62088101, and the Shanghai Municipal Science and Technology Major Project (2021SHZDZX0100) and the Fundamental Research Funds for the Central Universities. We thank Yixuan Li for his assistance with the illustrations.", + "bbox": [ + 214, + 763, + 782, + 838 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 113, + 620, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Alaluf, Y., Patashnik, O., Cohen-Or, D.: Only a matter of style: Age transformation using a style-based regression model. ACM TOG 40(4) (2021) 2, 4", + "2. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization (2023) 2, 4", + "3. Arar, M., Gal, R., Atzmon, Y., Chechik, G., Cohen-Or, D., Shamir, A., Bermano, A.H.: Domain-agnostic tuning-encoder for fast personalization of text-to-image models (2023) 2, 4, 5", + "4. Blanz, V., Vetter, T.: A morphable model for the synthesis of 3d faces. In: Waggenspack, W.N. (ed.) SIGGRAPH. pp. 187-194 (1999) 14", + "5. Bogo, F., Kanazawa, A., Lassner, C., Gehler, P., Romero, J., Black, M.J.: Keep it smpl: Automatic estimation of 3d human pose and shape from a single image. In: ECCV. pp. 561-578. Springer (2016) 14", + "6. Brown, T.B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., Agarwal, S., Herbert-Voss, A., Krueger, G., Henighan, T., Child, R., Ramesh, A., Ziegler, D.M., Wu, J., Winter, C., Hesse, C., Chen, M., Sigler, E., Litwin, M., Gray, S., Chess, B., Clark, J., Berner, C., McCandlish, S., Radford, A., Sutskever, I., Amodei, D.: Language models are few-shot learners (2020) 3", + "7. Choi, Y., Choi, M., Kim, M., Ha, J.W., Kim, S., Choo, J.: Stargan: Unified generative adversarial networks for multi-domain image-to-image translation. In: CVPR (2018) 2, 4", + "8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: North American Chapter of the Association for Computational Linguistics (2019) 3", + "9. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: ICLR (2022) 1, 2, 4, 5, 9, 12", + "0. Gal, R., Arar, M., Atzmon, Y., Bermano, A.H., Chechik, G., Cohen-Or, D.: Encoder-based domain tuning for fast personalization of text-to-image models. ACM TOG 42(4), 1-13 (2023) 1, 2, 4, 5, 8", + "1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS. pp. 2672-2680 (2014) 3", + "2. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. In: CVPR (2017) 3", + "3. Jiang, D., Liu, Y., Liu, S., Zhang, X., Li, J., Xiong, H., Tian, Q.: From clip to dino: Visual encoders shout in multi-modal large language models. CoRR:2310.08825 (2023) 6, 7", + "4. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 2, 9", + "5. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 3", + "6. Kim, T., Kim, K., Lee, J., Cha, D., Lee, J., Kim, D.: Revisiting image pyramid structure for high resolution salient object detection. In: Proceedings of the Asian Conference on Computer Vision. pp. 108-124 (2022) 9", + "7. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3", + "8. Krasin, I., Duerig, T., Alldrin, N., Ferrari, V., Abu-El-Haija, S., Kuznetsova, A., Rom, H., Uijlings, J., Popov, S., Veit, A., et al.: Openimages: A public dataset for" + ], + "bbox": [ + 225, + 176, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "large-scale multi-label and multi-class image classification. Dataset available from https://github.com/openimages2(3), 18 (2017) 9", + "19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR (2023) 2, 4, 7, 9, 12", + "20. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR. pp. 1931-1941 (2023) 8", + "21. Li, D., Li, J., Hoi, S.C.H.: Blip-diffusion: Pre-trained subject representation for controllable text-to-image generation and editing. In: NeurIPS (2023) 5", + "22. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. In: CVPR. pp. 26296-26306 (2024) 14", + "23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2018) 9", + "24. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. CoRR:2211.09794 (2022) 1", + "25. Nichol, A.Q., Dhariwal, P.: Improved denoising diffusion probabilistic models. In: ICML. pp. 8162-8171 (2021) 1", + "26. van den Oord, A., Vinyals, O., kavukcuoglu, k.: Neural discrete representation learning. In: NeurIPS. p. 6306-6315 (2017) 3, 4", + "27. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. CoRR:2304.07193 (2023) 6, 9", + "28. Pan, X., Qin, P., Li, Y., Xue, H., Chen, W.: Synthesizing coherent story with auto-regressive latent diffusion models (2022) 1", + "29. Pan, X., Tewari, A., Leimkuhler, T., Liu, L., Meka, A., Theobalt, C.: Drag your gan: Interactive point-based manipulation on the generative image manifold. In: SIGGRAPH. pp. 1-11 (2023) 4", + "30. Peng, X., Zhu, J., Jiang, B., Tai, Y., Luo, D., Zhang, J., Lin, W., Jin, T., Wang, C., Ji, R.: Portrait booth: A versatile portrait model for fast identity-preserved personalization. In: CVPR. pp. 27080-27090 (2024) 1", + "31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021) 3, 4, 6, 9", + "32. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: ICML (2021) 3", + "33. Roich, D., Mokady, R., Bermano, A.H., Cohen-Or, D.: Pivotal tuning for latent-based editing of real images. ACM TOG (2021) 4", + "34. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022) 1, 3, 4, 9", + "35. Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychological review 65(6), 386 (1958) 7", + "36. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: CVPR. pp. 22500-22510 (2023) 1, 2, 4, 5, 6, 7, 9, 12", + "37. Ruiz, N., Li, Y., Jampani, V., Wei, W., Hou, T., Pritch, Y., Wadhwa, N., Rubinstein, M., Aberman, K.: Hyperdreambooth: Hypernetworks for fast personalization of text-to-image models. In: CVPR. pp. 6527-6536 (2024) 2, 4, 10, 11", + "38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, S.K.S., Lopes, R.G., Ayan, B.K., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022) 3" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You", + "bbox": [ + 269, + 114, + 622, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "39. Shen, Y., Gu, J., Tang, X., Zhou, B.: Interpreting the latent space of gans for semantic face editing. In: CVPR (2020) 2, 4", + "40. Shen, Y., Yang, C., Tang, X., Zhou, B.: Interfacegan: Interpreting the disentangled face representation learned by gans. TPAMI (2020) 2, 4", + "41. Tewel, Y., Gal, R., Chechik, G., Atzmon, Y.: Key-locked rank one editing for text-to-image personalization. SIGGRAPH (2023) 2, 4", + "42. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023) 3", + "43. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Ferrer, C.C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura, P.S., Lachaux, M.A., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models (2023) 3", + "44. Tov, O., Alaluf, Y., Nitzan, Y., Patashnik, O., Cohen-Or, D.: Designing an encoder for stylegan image manipulation. CoRR:2102.02766 (2021) 2, 4", + "45. Voetman, R., Aghaei, M., Dijkstra, K.: The big data myth: Using diffusion models for dataset generation to train deep detection models (2023) 1", + "46. Wang, Q., Bai, X., Wang, H., Qin, Z., Chen, A.: Instantid: Zero-shot identity-preserving generation in seconds. CoRR preprint CoRR:2401.07519 (2024) 1", + "47. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: ICCV. pp. 15943-15953 (2023) 2, 4, 9, 12, 13", + "48. Xiao, G., Yin, T., Freeman, W.T., Durand, F., Han, S.: Fastcomposer: Tuning-free multi-subject image generation with localized attention. CoRR:2305.10431 (2023) 2, 7, 9, 11, 12, 13", + "49. Zhang, Q., Wang, C., Wu, H., Xin, C., Phuong, T.V.: Gelu-net: A globally encrypted, locally unencrypted deep neural network for privacy-preserved learning. In: IJCAI. pp. 3933-3939 (2018) 7", + "50. Zhou, Y., Zhang, R., Sun, T., Xu, J.: Enhancing detail preservation for customized text-to-image generation: A regularization-free approach. CoRR:2305.13579 (2023) 8", + "51. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: ICCV (2017) 3" + ], + "bbox": [ + 212, + 146, + 787, + 702 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "HybridBooth", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_model.json b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_model.json new file mode 100644 index 0000000000000000000000000000000000000000..213fdc0be6923d353d42223c032e8e1e0c016de0 --- /dev/null +++ b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_model.json @@ -0,0 +1,2918 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.255, + 0.141, + 0.75, + 0.187 + ], + "angle": 0, + "content": "HybridBooth: Hybrid Prompt Inversion for Efficient Subject-Driven Generation" + }, + { + "type": "text", + "bbox": [ + 0.275, + 0.212, + 0.726, + 0.245 + ], + "angle": 0, + "content": "Shanyan Guan\\(^{1\\star}\\), Yanhao Ge\\(^{1,3\\star}\\), Ying Tai\\(^{2\\boxtimes}\\), Jian Yang\\(^{2}\\) Wei Li\\(^{1}\\), and Mingyu You\\(^{3\\star\\star\\boxtimes}\\)" + }, + { + "type": "text", + "bbox": [ + 0.37, + 0.255, + 0.632, + 0.269 + ], + "angle": 0, + "content": "\\(^{1}\\) vivo Mobile Communication Co., Ltd" + }, + { + "type": "text", + "bbox": [ + 0.277, + 0.269, + 0.725, + 0.284 + ], + "angle": 0, + "content": "\\(^{2}\\) School of Intelligence Science and Technology, Nanjing University" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.284, + 0.782, + 0.311 + ], + "angle": 0, + "content": "3 College of Electronic and Information Engineering, Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.312, + 0.78, + 0.34 + ], + "angle": 0, + "content": "{guanshanyan, halege}@vivo.com yingtai@nju.edu.cn myyou@tongji.edu.cn https://sites.google.com/view/hybridbooth" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.375, + 0.741, + 0.542 + ], + "angle": 0, + "content": "Abstract. Recent advancements in text-to-image diffusion models have shown remarkable creative capabilities with textual prompts, but generating personalized instances based on specific subjects, known as subject-driven generation, remains challenging. To tackle this issue, we present a new hybrid framework called HybridBooth, which merges the benefits of optimization-based and direct-regression methods. HybridBooth operates in two stages: the Word Embedding Probe, which generates a robust initial word embedding using a fine-tuned encoder, and the Word Embedding Refinement, which further adapts the encoder to specific subject images by optimizing key parameters. This approach allows for effective and fast inversion of visual concepts into textual embedding, even from a single image, while maintaining the model's generalization capabilities." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.554, + 0.741, + 0.568 + ], + "angle": 0, + "content": "Keywords: Customized Generation \\(\\cdot\\) Image Inversion \\(\\cdot\\) Image synthesis" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.594, + 0.376, + 0.609 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.624, + 0.788, + 0.715 + ], + "angle": 0, + "content": "Recent advancements in text-to-image diffusion models [25, 34] have demonstrated unprecedented creating capabilities guided by textual prompts, such as creative endeavors in visual arts [28], synthetic dataset build-up [45], and image editing for marketing and advertising [24]. However, creating personalized instantiations based on specific subjects remains a challenging problem, also known as subject-driven generation [9,10,30,36,46]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.716, + 0.788, + 0.777 + ], + "angle": 0, + "content": "To achieve subject-driven generation, recent works [9, 10, 36] explore the inversion of subject images into specific textual embeddings, either through iterative optimization (optimization-based) or direct regression methods. These two paradigms are summarized in Fig. 2. Optimization-based methods, such as" + }, + { + "type": "page_footnote", + "bbox": [ + 0.216, + 0.784, + 0.735, + 0.798 + ], + "angle": 0, + "content": "* Equal contributions. Ying Tai and Mingyu You are corresponding authors." + }, + { + "type": "page_footnote", + "bbox": [ + 0.216, + 0.799, + 0.786, + 0.84 + ], + "angle": 0, + "content": "\\*\\* Mingyu You is also affiliated with State Key Laboratory of Intelligent Autonomous Systems, Frontiers Science Center for Intelligent Autonomous Systems, Shanghai Key Laboratory of Intelligent Autonomous Systems" + }, + { + "type": "list", + "bbox": [ + 0.216, + 0.784, + 0.786, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.624, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "image", + "bbox": [ + 0.25, + 0.172, + 0.334, + 0.213 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.271, + 0.226, + 0.32, + 0.234 + ], + "angle": 0, + "content": "Input Image" + }, + { + "type": "image", + "bbox": [ + 0.252, + 0.235, + 0.333, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.27, + 0.302, + 0.319, + 0.311 + ], + "angle": 0, + "content": "InputImage" + }, + { + "type": "image", + "bbox": [ + 0.336, + 0.146, + 0.752, + 0.234 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.337, + 0.235, + 0.417, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.342, + 0.299, + 0.419, + 0.315 + ], + "angle": 0, + "content": "HybridBooth (Ours) 3~5 steps" + }, + { + "type": "image", + "bbox": [ + 0.42, + 0.235, + 0.5, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.432, + 0.299, + 0.498, + 0.316 + ], + "angle": 0, + "content": "Custom Diffusion 200 * steps" + }, + { + "type": "image", + "bbox": [ + 0.501, + 0.235, + 0.583, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.521, + 0.299, + 0.57, + 0.316 + ], + "angle": 0, + "content": "DreamBooth 1000\\*steps" + }, + { + "type": "image", + "bbox": [ + 0.585, + 0.235, + 0.667, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.602, + 0.299, + 0.659, + 0.316 + ], + "angle": 0, + "content": "Fast Composer \\(1^{*}\\) step" + }, + { + "type": "image", + "bbox": [ + 0.671, + 0.235, + 0.751, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.697, + 0.299, + 0.728, + 0.316 + ], + "angle": 0, + "content": "ELITE \\(I^{*}\\) step" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.33, + 0.788, + 0.401 + ], + "angle": 0, + "content": "Fig.1: We propose HybridBooth for efficient subject-driven generation. Unlike FastComposer [48], which targets humans, it cannot affect the Bronze Mask (Top). Compared to optimization-based [19,36] and direct-regression-based methods [47,48], our framework generates diverse, precise images while preserving the subject's identity, requiring only \\( 3 \\sim 5 \\) optimization iterations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.788, + 0.591 + ], + "angle": 0, + "content": "Textual Inversion and DreamBooth [9, 37], iteratively optimize the generation model or textual embedding of the subject to better align with given subject images. Constrained by tens of subject images, optimization-based methods can accurately capture the identifying characteristics of the subject. However, the optimization procedure is computationally expensive and slow to converge. In comparison, direct-regression-based methods [1-3,7,10,39-41,44,47] achieve textual concept inversion by tuning a pre-trained model with labeled datasets or concept-specific images. While these methods enable zero-shot subject-driven generation, they suffer from detail loss and adaptation issues when combining the target subject with new styles or prompts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.592, + 0.789, + 0.772 + ], + "angle": 0, + "content": "In this paper, we introduce a novel framework called HybridBooth, designed for efficient subject-driven generation using text-to-image diffusion models. The core idea is to synergistically combine the strengths of various methods, creating a hybrid approach that balances quality and speed. As shown in Fig. 2, HybridBooth operates in two stages. The first stage, termed Word Embedding Probe, employs an encoder to generate a robust initial word embedding. This encoder is fine-tuned on a large-scale dataset such as FFHQ [14] with 70,000 images. In the second stage, the domain-agnostic encoder undergoes further finetuning to adapt to a specific subject's image in a word embedding refinement process. This stage focuses on optimizing the most influential parameters of the regressor. These two stages work collaboratively, enhancing each other to achieve precise and efficient subject-driven generation." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.773, + 0.625, + 0.787 + ], + "angle": 0, + "content": "Overall, our contributions are summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.795, + 0.789, + 0.842 + ], + "angle": 0, + "content": "- Combining strengths of both optimization-based and direct-regression-based paradigms, we propose HybridBooth for precise and efficient subject-driven generation in less than 5 iteration steps." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.264, + 0.156, + 0.496, + 0.237 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.264, + 0.239, + 0.493, + 0.319 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.156, + 0.743, + 0.319 + ], + "angle": 0, + "content": null + }, + { + "type": "table", + "bbox": [ + 0.264, + 0.323, + 0.746, + 0.411 + ], + "angle": 0, + "content": "
MethodFast Prompt InversionHigh-Fidelity GenerationSubject Images Needed
1. Optimization-basedX✓Multiple
2. Direct-regression-based✓XSingle
3. HybridBooth (Ours)✓✓Single
" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.435, + 0.788, + 0.491 + ], + "angle": 0, + "content": "Fig. 2: Comparing with previous frameworks, our method leverages a coarse-to-fine strategy, effectively integrating the advantages of both optimization- and regression-based methods. Consequently, we enable a fast prompt inversion with high-fidelity generation from just a single image." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.522, + 0.785, + 0.565 + ], + "angle": 0, + "content": "- We craft a Regressor-based Word Embedding Probe module to ensure a robust feature initialization while maintaining a focus on general-oriented generation model." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.568, + 0.785, + 0.599 + ], + "angle": 0, + "content": "- We introduce a residual refinement strategy to accelerate the fitting process while preventing the collapse of the prior learned during the probe stage." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.522, + 0.785, + 0.599 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.625, + 0.388, + 0.642 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.661, + 0.476, + 0.675 + ], + "angle": 0, + "content": "2.1 Text-to-image Generation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Text-to-image generation focuses on creating visually accurate and contextually relevant images from textual descriptions. Early approaches, such as Generative Adversarial Networks (GANs) [11, 12, 15, 51], achieved high-quality synthetic images. However, these studies primarily emphasize image generation within specific domains, leading to limitations in extended applications. The progress of large language models [6,8,31,42,43] has enabled methods based on variational auto-encoders [17, 26] and diffusion models [32, 34, 38] to effectively map word sequences into latent space, guiding image generation from textual prompts. Our method leverages pre-trained text-to-image diffusion models to generate personalized visual content efficiently and effectively." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.114, + 0.624, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.482, + 0.162 + ], + "angle": 0, + "content": "2.2 Subject-driven Generation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.187, + 0.788, + 0.248 + ], + "angle": 0, + "content": "Subject-driven generation is a type of controllable generation task that aims to generate instances of specific subjects in new contexts (e.g., styles, scenarios). Current approaches can be broadly categorized into two types: 1) optimization-based and 2) direct-regression-based methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.262, + 0.789, + 0.445 + ], + "angle": 0, + "content": "Optimization-based Methods iteratively refine images to align with given textual descriptions. Inversion is a common technique to preserve a subject while modifying its context. For GANs, Pivot Tuning [33] fine-tunes the model using an inverted latent code for robust, ID-preserving generation. Recent work [29] keeps GAN-generated subjects consistent and controllable. However, these methods often struggle with unique subjects and fail to preserve all details. In diffusion models, inversion aims to determine the initial noise that generates the target image through denoising. Methods like DreamBooth and Textual Inversion [9, 19, 36, 37] personalize pre-trained models to generate specific subjects in various contexts but are computationally intensive and slow to converge. Our method uses a hybrid framework for robust initial feature encoding, followed by rapid optimization, achieving superior efficiency." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.459, + 0.79, + 0.641 + ], + "angle": 0, + "content": "Direct-regression-based Methods generate subject-specific images directly from textual prompts without iterative optimization, relying on extensive model modifications on large datasets. These methods generate images from scratch based on learned text-visual correlations. Previous GAN-based methods [1, 7, 39, 40, 44] retrain generators or add conditioned constraints for ID-preserving generation but are limited by their training sets. Recent diffusion-based methods [2, 3, 10, 41, 47] tune only the encoder of pre-trained models, offering efficiency but risking overfitting and reduced performance on diverse tasks. To address these limitations, HybridBooth initially refines the encoder and employs a subject-driven residual refinement module. This process requires only 3 to 5 steps, resulting in more detailed and robust images compared to other direct-regression-based methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.663, + 0.383, + 0.679 + ], + "angle": 0, + "content": "3 Preliminaries" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.695, + 0.587, + 0.71 + ], + "angle": 0, + "content": "3.1 Text-to-Image Latent Diffusion Models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.789, + 0.843 + ], + "angle": 0, + "content": "We implemented our method based on text-to-image Latent Diffusion Models (LDMs) [34] which can understand prompts and generate vivid images. LDMs mainly consist of three components, including a variational auto-encoder (VAE) [26], an UNet, and a CLIP text encoder [31]. The VAE encoder \\(\\mathcal{E}\\) compresses \\(\\pmb{x}\\) into a low-dimensional latent code \\(z = \\mathcal{E}(\\pmb{x})\\), and the decoder \\(\\mathcal{D}\\) maps the latent code \\(\\pmb{z}\\) back to image space \\(\\hat{\\pmb{x}} = \\mathcal{D}(\\pmb{z})\\). For the text-guided diffusion process, the latent code \\(\\pmb{z}\\) is perturbed by Gaussian noise \\(\\epsilon\\). Then the UNet \\(\\mathcal{M}_{\\theta}\\) learns to predict the applied noise \\(\\pmb{z}_t\\) with a specified time step \\(t\\). The denoising" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.146, + 0.784, + 0.231 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.246, + 0.784, + 0.274 + ], + "angle": 0, + "content": "Fig. 3: Showcasing our prompt inversion framework incorporating various conditions (depth, canny, keypoints) and community models1." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.302, + 0.784, + 0.332 + ], + "angle": 0, + "content": "process is conditioned on the text feature \\( \\pmb{c} \\) extracted from text prompts \\( \\pmb{y} \\) by using text encoder \\( \\tau_{\\pmb{\\theta}} \\). The training loss is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.328, + 0.338, + 0.785, + 0.363 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\epsilon} = \\mathbb {E} _ {\\boldsymbol {z} \\sim \\mathcal {E} (\\boldsymbol {x}), \\epsilon \\sim \\mathcal {N} (0, 1), \\boldsymbol {c}, t} \\left[ \\left\\| \\boldsymbol {\\epsilon} - \\mathcal {M} _ {\\boldsymbol {\\theta}} \\left(\\boldsymbol {z} _ {t}, \\boldsymbol {c}, t\\right) \\right\\| _ {2} ^ {2} \\right]. \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.37, + 0.784, + 0.401 + ], + "angle": 0, + "content": "During inference, given a prompt \\(\\pmb{y}\\), the model iteratively denoises \\(\\pmb{z}_t\\) conditioned on the text feature \\(\\pmb{c} = \\tau_{\\pmb{\\theta}}(\\pmb{y})\\). Finally, \\(\\pmb{z}_0\\) is decoded to an image \\(\\hat{\\pmb{x}} = \\mathcal{D}(\\pmb{z}_0)\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.42, + 0.665, + 0.435 + ], + "angle": 0, + "content": "3.2 Prompt Inversion for Subject-Dirven Generation" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.442, + 0.784, + 0.533 + ], + "angle": 0, + "content": "Despite the remarkable general generation capability of LDMs, challenges remain in generating specific subjects across various contexts, known as Subject-Driven Generation [9,36]. One feasible approach is to learn textual concepts from subject-specific images, referred to as Prompt Inversion [3,10,21]. Given several images \\(\\mathbf{X}\\) of a subject, the prompt inversion aims to inverse the visual content of the subject to the embedding of words \\(\\mathbf{e}\\):" + }, + { + "type": "equation", + "bbox": [ + 0.458, + 0.541, + 0.785, + 0.557 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {e} \\leftarrow \\mathcal {I} (\\boldsymbol {X}), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.565, + 0.785, + 0.686 + ], + "angle": 0, + "content": "where \\(\\mathcal{I}\\) represents the inversion process. The primary goal of the inversion process is to ensure that \\(e\\in \\mathbb{R}^{n\\times d}\\) captures the key identifying characteristics of the subject. The word embedding \\(\\pmb{e}\\) is then encoded into textual features \\(\\pmb{c}\\) using a pre-trained text encoder (i.e., CLIP). Once \\(\\pmb{e}\\) is learned, it can be readily combined with arbitrary text for the creative generation of the subject. Specifically, let 'S*' be the text word corresponding to the learned embedding \\(\\pmb{e}\\), we can combine 'S*' with new prompts to realize arbitrary subject-driven image synthesis, e.g. 'S* in snow forest'." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.698, + 0.784, + 0.818 + ], + "angle": 0, + "content": "Discussion. Another paradigm involves mapping subject images to image tokens and using an additional cross-attention layer to inject these tokens into the diffusion process. This paradigm significantly alters the generation process of the original Latent Diffusion Models (LDMs), necessitating retraining on millions of images. In contrast, prompt inversion is a more resource-efficient method for subject-driven generation. As shown in Fig. 3, it can seamlessly integrate with various community foundational models and controllers pre-trained on the original stable diffusion, making it a versatile and practical alternative." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.771, + 0.841 + ], + "angle": 0, + "content": "1 disneyPixarCartoon_v10: civitai.com/models/65203/disney-pixel-cartoon-type-a" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.624, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.144, + 0.761, + 0.356 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.367, + 0.788, + 0.424 + ], + "angle": 0, + "content": "Fig. 4: The framework of HybridBooth consists of two stages: (a) The first Probe Stage leverages a prompt regressor estimate the initial word embedding, acting as a probe for a rational word embedding; (b) The second Refinement Stage adapts the regressor to the subject by taking only 3-5 iterations to achieve efficient subject generation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.45, + 0.614, + 0.468 + ], + "angle": 0, + "content": "4 Hybrid Prompt Inversion Framework" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.48, + 0.789, + 0.692 + ], + "angle": 0, + "content": "Given just one image \\(\\pmb{x}\\) of a specific subject, we aim to efficiently embed the subject into the word embedding space. We combine the strengths of optimization and direct-regression-based paradigms to achieve precise and efficient subject-driven generation. Thus, we propose a hybrid prompt inversion framework, termed HybridBooth. As shown in Fig. 4, HybridBooth consists of two stages: (1) Word Embedding Probe Stage, which learns a domain-agnostic encoder providing an initial word embedding estimate. (2) Word Embedding Refinement Stage, which adapts the encoder to the given image of the subject. The key idea is: A powerful encoder reduces iterative refinement costs, while effective iterative refinement reduces the encoder's accuracy demands. Our challenge is to develop a robust encoder for initial embeddings and an effective refinement scheme to reduce the encoder's precision requirements. Next, we introduce the Word Embedding Probe stage in Sec. 4.1, describe the residual refinement stage in Sec. 4.2, and present the framework details in Sec. 4.3." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.712, + 0.604, + 0.729 + ], + "angle": 0, + "content": "4.1 Regressor-based Word Embedding Probe" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.736, + 0.787, + 0.782 + ], + "angle": 0, + "content": "First, HybridBooth trains a prompt regressor that takes an image of a subject as input and estimates the initial word embedding. This involves extracting multi-grained image features and conducting multiple-word regression." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.795, + 0.787, + 0.843 + ], + "angle": 0, + "content": "Multi-grained Image Feature Merging. Existing regressor-based methods exclusively utilize CLIP features \\( \\pmb{f}_c \\), which often contain global semantic information (e.g., subject's category) [13,31,36]. Hence, we incorporate DINOv2 [27]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.126 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.236, + 0.149, + 0.77, + 0.233 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.248, + 0.788, + 0.304 + ], + "angle": 0, + "content": "Fig. 5: Impact of hyper-parameters in the residual refinement stage (on the Dream-Booth dataset [36]). Default parameters are marked with red circles. Custom Diffusion [19] serves as the reference. Prompt Fidelity and Subject Fidelity are CLIP-I and DINO-T, respectively (see Sec. 5.1)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.33, + 0.784, + 0.405 + ], + "angle": 0, + "content": "features \\( \\pmb{f}_d \\) as a supplement, offering detailed pixel-level information. Taking inspiration from previous practices [13,48], we employ a Multilayer Perceptron (MLP) to project DINOv2 features \\( \\pmb{f}_d \\), then concatenate the output with CLIP feature \\( \\pmb{f}_c \\). Finally we align the feature dimension using a Linear layer [35]. The merging process is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.414, + 0.786, + 0.431 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {f} = \\operatorname {L i n e a r} \\left(\\left[ \\boldsymbol {f} _ {c}, \\operatorname {M L P} \\left(\\boldsymbol {f} _ {d}\\right) \\right]\\right), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.438, + 0.784, + 0.483 + ], + "angle": 0, + "content": "where \\([\\cdot, \\cdot]\\) represents the concatenation operation, and the structure of MLP is LyaerNorm-Linear-GELU [49]-Linear. As verified in our experiments, this simple module yields significant improvements." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.495, + 0.784, + 0.57 + ], + "angle": 0, + "content": "Multiple-word Regression. The merged feature \\( \\pmb{f} \\) is then mapped to word embeddings \\( \\pmb{e} \\). Typically, a single word represents a specific concept, e.g. 'man' conveys the subject's category but may lack details like hairstyle. Thus, we suggest projecting the feature \\( \\pmb{f} \\) to multiple-word embeddings to provide a more thorough description of the subject:" + }, + { + "type": "equation", + "bbox": [ + 0.461, + 0.579, + 0.786, + 0.595 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {e} = \\mathcal {R} (\\boldsymbol {f}), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.603, + 0.784, + 0.634 + ], + "angle": 0, + "content": "where \\(\\pmb{e} = \\{\\pmb{e}_i\\}_{i=1}^n\\), \\(n\\) is the number of word embeddings \\(\\pmb{e}_i \\in \\mathbb{R}^d\\), and \\(d\\) is the dimension of word embedding." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.653, + 0.434, + 0.667 + ], + "angle": 0, + "content": "4.2 Residual Refinement" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.784, + 0.765 + ], + "angle": 0, + "content": "Although the regressor-based probe is fast, precise alignment between word embeddings and key subject features remains challenging without image feature feedback. Thus, our subsequent stage focuses on refinement, aiming to adapt the learned regressor to target subject for better alignment. Striking a balance is challenging due to the single image input, as it requires avoiding overfitting to a specific image while capturing essential subject characteristics effectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.784, + 0.81 + ], + "angle": 0, + "content": "To tackle this issue, we enhance the learned regressor with a residual refinement strategy that adjusts only critical parameters \\((\\boldsymbol{W}_{\\phi})\\) for faster adaptation while preserving the learned prior. The residual refinement is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.418, + 0.818, + 0.786, + 0.838 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {W} _ {\\phi} ^ {\\prime} = \\boldsymbol {W} _ {\\phi} + \\lambda \\Delta \\boldsymbol {W} _ {\\phi}, \\tag {5}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.624, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.145, + 0.769, + 0.207 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.222, + 0.785, + 0.264 + ], + "angle": 0, + "content": "Fig. 6: Showcases of the cross-attention map for the subject word 'S*'. Applying mask regularization \\(\\mathcal{L}_M\\) prevents attention leakage to irrelevant areas, even with other subjects present (highlighted in red boxes)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.295, + 0.785, + 0.34 + ], + "angle": 0, + "content": "where \\(\\Delta W_{\\phi}\\) is the learned residual parameters and a hyperparameter \\(\\lambda\\) is to control the scale of \\(\\Delta W_{\\phi}\\). With residual refinement, it only takes 3-5 iterations to achieve high-fidelity subject generation while preserving editability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.355, + 0.785, + 0.491 + ], + "angle": 0, + "content": "Discussing the overfitting problem. Overfitting is a common challenge in finetune-based methods, especially when tuning the prompt regressor on a single image. To mitigate this, we refine only partial parameters (see Eq. (5)). Intuitively understanding, \\( W_{\\phi} \\) acts as an anchor, preserving the learned prior and stabilizing updates. Zeroing out \\( W_{\\phi} \\) collapses its prior (see the last column in Fig. 10), and we need to adjust hyper-parameters more carefully. As shown in Fig. 5, by using residual refinement, \\( \\lambda \\) and iteration steps can vary widely yet still yield good results. Fig. 7 and Fig. 9 demonstrate that HybridBoothcan generate novel subject images with diverse expressions, postures, styles, and scenarios." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.513, + 0.419, + 0.527 + ], + "angle": 0, + "content": "4.3 Framework Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.539, + 0.788, + 0.735 + ], + "angle": 0, + "content": "Prompt Regressor Design. Previous studies have used either an MLP or a UNet as the prompt regressor. HybridBooth is flexible and can integrate any network mapping image features \\(\\pmb{f}\\) to word embeddings \\(\\pmb{e}\\). We employ the state-of-the-art regressor PromptNet [50], which uses a block structure similar to LDM and can be initialized with LDM pretrained on large-scale image datasets. In the refinement stage, we focus on refining the cross-attention layer parameters (key, query, and value matrices \\(\\mathbf{W}_k\\), \\(\\mathbf{W}_q\\), \\(\\mathbf{K}_v\\)) based on layer importance experiments. Fine-tuning the entire regressor with 100 images, we calculated importance scores for each layer based on the mean cosine distance of parameters before and after refinement: cross-attention (56.3), self-attention (43.9), and other layers (e.g. convolution) (12.4). The cross-attention layer had the highest importance. Similar experiments by Custom Diffusion [20] and E4T [10] focused on the denoising UNet within LDMs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Training with Mask Regularization. The diffusion loss \\(\\mathcal{L}_{\\epsilon}\\) (Eq. (1)) is commonly used for training the prompt regressor. However, as shown in Fig. 6 (Left), the cross-attention maps of the subject's word embedding often leak into the irrelevant background. To address this, we use the subject's mask to constrain the cross-attention maps of subject words, ensuring focus on the subject region. Let \\(A_{e_i} \\in \\mathbb{R}^{h \\times w}\\) be the attention map for \\(e_i\\), and \\(M \\in \\mathbb{R}^{H \\times W}\\) be the segmentation" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.128 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.786, + 0.163 + ], + "angle": 0, + "content": "mask for the subject. We use a mask regularization loss to align \\(A_{e_i}\\) with \\(M\\):" + }, + { + "type": "equation", + "bbox": [ + 0.307, + 0.186, + 0.786, + 0.226 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {M} = \\frac {1}{n} \\sum_ {i = 1} ^ {n} \\operatorname {m e a n} \\left(\\boldsymbol {A} _ {\\boldsymbol {e} _ {i}} \\cdot (\\boldsymbol {1} - \\boldsymbol {M})\\right) - \\operatorname {m e a n} \\left(\\boldsymbol {A} _ {\\boldsymbol {e} _ {i}} \\cdot \\boldsymbol {M}\\right), \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.235, + 0.785, + 0.295 + ], + "angle": 0, + "content": "where \\( n \\) is the number of word embeddings. This loss minimizes attention outside the mask and maximizes it inside, ensuring focus on the subject. The interpolation of \\( M \\) to match \\( A_{e_i} \\) is omitted for simplicity. The final training objective of the regressor is:" + }, + { + "type": "equation", + "bbox": [ + 0.434, + 0.309, + 0.786, + 0.327 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {\\epsilon} + \\alpha_ {M} \\mathcal {L} _ {M}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.336, + 0.785, + 0.368 + ], + "angle": 0, + "content": "where \\(\\alpha_{M}\\) is the weight of \\(\\mathcal{L}_M\\). During refinement, \\(\\mathcal{L}\\) is used to prevent diverging update directions, focusing on fine-tuning the cross-attention parameters." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.39, + 0.376, + 0.408 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.422, + 0.436, + 0.438 + ], + "angle": 0, + "content": "5.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.447, + 0.8, + 0.569 + ], + "angle": 0, + "content": "Datasets. We mainly conduct experiments on facial images. Following prior research practices, we train HybridBooth on the aligned FFHQ dataset [14], comprising 70,000 in-the-wild facial images. Constrained by computational resources, we conducted testing on the first 1,000 images from the CelebA-HQ test split. In addition, we also evaluate HybridBooth on other categories to demonstrate its versatility. With the same setting of ELITE [47], we train HybridBooth on the test split of OpenImagesv6 [18], and test on the DreamBooth Dataset. All images are cropped and resized to \\(512 \\times 512\\) pixels." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.583, + 0.788, + 0.751 + ], + "angle": 0, + "content": "Training Details. We use Stable Diffusion v1.5 [34] as our Text-to-Image model, initializing the prompt regressor with the UNet from Stable Diffusion. The DINOv2-Large model [27] extracts the DINO feature, and the vision model of clip-vit-large-patch14 [31] extracts the CLIP image feature. The segmentation mask \\( M \\) (Eq. (6)) is obtained using InSPyReNet [16]. We use the same hyperparameters for both facial and non-facial experiments. For the word embedding probe stage, we use the AdamW optimizer [23] with a learning rate of 2e-5 and a batch size of 8. Training on a single Nvidia A100 GPU takes 40 hours. In the refinement stage, we fine-tune the cross-attention parameters of the regressor for 5 steps using AdamW, with a learning rate of 2e-5 and a weight decay of 1e-2. Parameters \\( \\alpha_{M} \\) (Eq. (7)) and \\( \\lambda \\) (Eq. (5)) are set to 1e-3 and 1e-2, respectively." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.765, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Baselines. We compare the proposed HybridBooth with two categories of methods: (1) Optimization-based methods: DreamBooth [36], Textual Inversion [9], and Custom Diffusion [19]. (2) Direct-regression-based methods: ELITE [47] and FastComposer [48]. Optimization-based methods typically require \\(3 \\sim 5\\) images as input, which are not available in CelebA-HQ (our test set). To ensure a fair" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.623, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "image_caption", + "bbox": [ + 0.437, + 0.149, + 0.608, + 0.159 + ], + "angle": 0, + "content": "watercolor painting of a \\(S^{*}\\) in the snow" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.159, + 0.755, + 0.215 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.464, + 0.217, + 0.562, + 0.227 + ], + "angle": 0, + "content": "A red S\\* in Pixar style" + }, + { + "type": "image", + "bbox": [ + 0.246, + 0.228, + 0.755, + 0.284 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.42, + 0.285, + 0.598, + 0.297 + ], + "angle": 0, + "content": "Pointillism painting of a \\(S^{*}\\) with night sky" + }, + { + "type": "image", + "bbox": [ + 0.246, + 0.297, + 0.755, + 0.352 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.237, + 0.374, + 0.786, + 0.402 + ], + "angle": 0, + "content": "Fig. 7: Qualitative Comparison Results on CelebA-HQ (facial dataset). Columns 2-4: Optimization-based methods. Columns 5-6: Direct-regression-based methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.432, + 0.788, + 0.553 + ], + "angle": 0, + "content": "comparison, we augment each image to generate 5 images for these methods using affine transformations and background changes. More details on the augmentation process are provided in the Supplementary. To clarify the difference between HybridBooth and HyperDreamBooth [37], HyperDreamBooth updates weights in a low-rank space for rapid model tuning but overlooks the importance of training a powerful encoder initially. Since the official code for HyperDream-Booth was unavailable during our submission, we could only make qualitative comparisons with examples from their paper (see Fig. 8)." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.566, + 0.767, + 0.582 + ], + "angle": 0, + "content": "Evaluation Metrics. We evaluate the model's performance in two aspects:" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.59, + 0.789, + 0.65 + ], + "angle": 0, + "content": "- Prompt Fidelity: This measures how well the generated images match the textual prompt, quantified by the average cosine similarity of CLIP embeddings between the prompt and the generated images (CLIP-T). Higher CLIP-T indicates better textual editability." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.65, + 0.789, + 0.711 + ], + "angle": 0, + "content": "- Subject Fidelity: This assesses the preservation of subject details during generation. We use CLIP-I and DINO-I metrics, which are the cosine similarities between the embeddings of the generated images and the original concept images. Higher values indicate better subject fidelity." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.741, + 0.459, + 0.756 + ], + "angle": 0, + "content": "5.2 Qualitative Comparison" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In Fig. 7, we present qualitative comparison results. Similar to previous works, 'S*' denotes the word embedding learned from the input subject image. For a fair comparison, optimization-based methods use 5 images for optimization. Our setting is more complex, specifying both artistic style (e.g., 'watercolor painting') and environmental characteristics (e.g., 'in the snow'). From the results, two key" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.149, + 0.761, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.298, + 0.251, + 0.704, + 0.266 + ], + "angle": 0, + "content": "Fig. 8: Qualitative Comparison with Hyperdreambooth [37]." + }, + { + "type": "image_caption", + "bbox": [ + 0.368, + 0.289, + 0.644, + 0.302 + ], + "angle": 0, + "content": "photo of sks dog on top of green grass with sunflowers" + }, + { + "type": "image", + "bbox": [ + 0.246, + 0.302, + 0.761, + 0.457 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.296, + 0.471, + 0.704, + 0.486 + ], + "angle": 0, + "content": "Fig. 9: Qualitative Comparison Results on non-facial images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.519, + 0.788, + 0.641 + ], + "angle": 0, + "content": "observations emerge: (1) Optimization-based methods (Columns 2-4), using multiple image inputs and finely tuned hyper-parameters (e.g., total iteration steps), generally outperform direct-regression-based methods (Columns 5-6) in prompt alignment and subject similarity. (2) Our proposed HybridBooth outperforms all compared methods in text alignment and subject similarity. For example, in the third row, other methods either fail in text similarity (e.g., FastComposer) or in preserving facial similarity, whereas HybridBooth successfully aligns the subject with the editing prompt, demonstrating its superiority." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.642, + 0.788, + 0.733 + ], + "angle": 0, + "content": "Qualitative comparisons with HyperDreamBooth [37] are shown in Fig. 8. HyperDreamBooth trains a hyper-network to predict low-rank weights of the image diffusion model and fine-tunes these weights on one subject image. However, low-rank weight updates limit personalized representation, resulting in poorer subject feature preservation, as seen in Fig. 8. This supports our core idea that a more powerful encoder reduces the cost of iterative refinement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "As shown in Fig. 9, we evaluate HybridBooth on non-facial images, including animals (Line 1) and complex buildings (Line 2). FastComposer [48] is excluded as it is designed for facial images. In Line 1, most methods preserve the texture of the subject well. However, in Line 2, only HybridBooth maintains the structural information while adhering to the complex prompt. This is due to the hybrid framework, which enables quick feature learning while retaining the prompt understanding capability of the Stable Diffusion model." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.624, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Table 1: Quantitative Evaluation on the CelebA-HQ. First Block: Optimization-based methods. Second Block: Direct-regression-based methods. Third Block: HybridBooth and its ablations." + }, + { + "type": "table", + "bbox": [ + 0.233, + 0.199, + 0.769, + 0.372 + ], + "angle": 0, + "content": "
MethodCelebA-HQDreamBooth-datasetIter. Step↓
CLIP-T ↑CLIP-I ↑DINO-I ↑CLIP-T ↑CLIP-I ↑DINO-I ↑
Textual Inversion [9]0.1640.6120.2360.1830.6630.4625000
DreamBooth [36]0.2510.5640.3760.2510.7850.6741000
Custom Diffusion [19]0.2370.6750.3980.2450.8010.695200
ELITE [47]0.1690.5920.3110.2550.7620.6521
FastComposer [48]0.2010.7820.581---1
HybridBooth0.2460.8650.6440.2610.8650.7555
- w/o Refinement0.1770.8420.5680.1920.8350.645-
- w/o Probe0.1530.4080.0680.1420.4120.0505
- w/o DINO Feature0.1610.8370.4530.1840.8410.5965
- w/o CLIP Feature0.1820.7340.5100.2060.7520.6305
- w/o Mask Regularization0.2030.8310.6250.2330.8330.7055
" + }, + { + "type": "image", + "bbox": [ + 0.24, + 0.384, + 0.303, + 0.48 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.251, + 0.48, + 0.292, + 0.488 + ], + "angle": 0, + "content": "Input Image" + }, + { + "type": "image", + "bbox": [ + 0.305, + 0.385, + 0.396, + 0.479 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.33, + 0.48, + 0.373, + 0.488 + ], + "angle": 0, + "content": "DreamBooth" + }, + { + "type": "image", + "bbox": [ + 0.398, + 0.385, + 0.488, + 0.479 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.415, + 0.48, + 0.466, + 0.488 + ], + "angle": 0, + "content": "FastComposer" + }, + { + "type": "image", + "bbox": [ + 0.49, + 0.385, + 0.579, + 0.479 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.502, + 0.48, + 0.567, + 0.488 + ], + "angle": 0, + "content": "HybridBooth(Ours)" + }, + { + "type": "image", + "bbox": [ + 0.581, + 0.385, + 0.67, + 0.479 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.595, + 0.48, + 0.653, + 0.488 + ], + "angle": 0, + "content": "- w/o Refinement" + }, + { + "type": "image", + "bbox": [ + 0.671, + 0.385, + 0.764, + 0.479 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.698, + 0.48, + 0.736, + 0.488 + ], + "angle": 0, + "content": "- w/o Probe" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.503, + 0.789, + 0.545 + ], + "angle": 0, + "content": "Fig. 10: We conducted ablations on HybridBooth to evaluate its influence on learning subject-specific word embeddings. DreamBooth and FastComposer are utilized here for comparison. 'A photo of \\( S^{*} \\)' is used for generating images." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.576, + 0.473, + 0.592 + ], + "angle": 0, + "content": "5.3 Quantitative Comparison" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.605, + 0.788, + 0.697 + ], + "angle": 0, + "content": "The quantitative results in Tab. 1 include the necessary iteration steps for assessing time efficiency. Optimization-based methods generally outperform direct-regression-based methods but require more iteration steps. Our HybridBooth significantly exceeds other methods in both prompt fidelity and subject fidelity. Notably, our DINO-T metric is over \\(10\\%\\) higher than FastComposer, a key metric in the DreamBooth framework [36]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.721, + 0.411, + 0.737 + ], + "angle": 0, + "content": "5.4 Ablation Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.789, + 0.843 + ], + "angle": 0, + "content": "Ablations on the Hybrid Framework. We evaluate our hybrid framework, which includes a word embedding stage for initial estimation and a residual refinement stage for precise alignment. Ablations, termed 'w/o Probe' and 'w/o Refinement', are shown in Fig. 10 and Tab. 1. The prompt regressor is initialized using the pre-trained UNet from Stable Diffusion in both settings. We assess subject fidelity using the prompt 'A photo of \\(\\mathbf{S}^*\\) , comparing it with DreamBooth" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.26, + 0.149, + 0.345, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.349, + 0.149, + 0.46, + 0.16 + ], + "angle": 0, + "content": "A \\(S^{*}\\) dog in the snow" + }, + { + "type": "image", + "bbox": [ + 0.349, + 0.16, + 0.437, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.438, + 0.16, + 0.479, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.48, + 0.149, + 0.611, + 0.159 + ], + "angle": 0, + "content": "A S* devil surrounded by flames" + }, + { + "type": "image", + "bbox": [ + 0.48, + 0.16, + 0.613, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.613, + 0.149, + 0.744, + 0.159 + ], + "angle": 0, + "content": "oil painting of a S\\* cat" + }, + { + "type": "image", + "bbox": [ + 0.613, + 0.16, + 0.744, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.26, + 0.229, + 0.346, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.348, + 0.229, + 0.479, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.48, + 0.229, + 0.611, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.613, + 0.229, + 0.744, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.316, + 0.785, + 0.345 + ], + "angle": 0, + "content": "Fig. 11: The learned words from human beings can be applied to cross-species subjects, which verifies that HybridBooth manages to learn intrinsic subject features." + }, + { + "type": "image", + "bbox": [ + 0.294, + 0.36, + 0.713, + 0.442 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.243, + 0.456, + 0.757, + 0.471 + ], + "angle": 0, + "content": "Fig. 12: Impact of increasing number of word embeddings (on CelebeA-HQ)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.502, + 0.785, + 0.577 + ], + "angle": 0, + "content": "and FastComposer. As shown in Fig. 10, subject embedding from residual refinement alone leads to lower subject similarity. Without refinement, word embedding only crudely captures key features. Our HybridBooth framework, integrating both probe and refinement stages, outperforms all ablations and compared methods, effectively restoring subject characteristics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.594, + 0.785, + 0.716 + ], + "angle": 0, + "content": "Ablations on Multi-grained Image Feature Merging. Previous works [47, 48] typically use CLIP features as input for the regressor. As discussed in Sec. 4.1, we use CLIP features for global semantic information and DINO features for detailed pixel-level information. We ablate the feature extraction strategy to verify this approach. As shown in Tab. 1, relying solely on DINO or CLIP features results in suboptimal performance. However, integrating both features significantly enhances performance. Notable improvements in prompt fidelity and subject fidelity are observed, even with just a single layer normalization and linear layer." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.732, + 0.785, + 0.793 + ], + "angle": 0, + "content": "Analysis on the Mask Regularization Loss \\(\\mathcal{L}_M\\). We propose a mask regularization loss \\(\\mathcal{L}_M\\) (Eq. (6)) to ensure that the estimated word embeddings align with the subject area. As shown in the last line of Tab. 1, both subject fidelity and prompt fidelity decrease significantly without the mask regularization loss." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Ablations on the Number of Word Embedding. Recalling that the prompt regressor estimates multiple word embeddings for enhanced description of key" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.114, + 0.622, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "image", + "bbox": [ + 0.289, + 0.145, + 0.393, + 0.225 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.315, + 0.226, + 0.366, + 0.237 + ], + "angle": 0, + "content": "Input Image" + }, + { + "type": "image", + "bbox": [ + 0.396, + 0.145, + 0.501, + 0.225 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.405, + 0.226, + 0.472, + 0.237 + ], + "angle": 0, + "content": "\\(S^{\\star}\\) is Laughing" + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.144, + 0.608, + 0.225 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.512, + 0.226, + 0.577, + 0.237 + ], + "angle": 0, + "content": "\\(S^{\\star}\\) is Drawing" + }, + { + "type": "image", + "bbox": [ + 0.611, + 0.145, + 0.716, + 0.225 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.617, + 0.226, + 0.705, + 0.237 + ], + "angle": 0, + "content": "\\(S^{\\star}\\) as a young child" + }, + { + "type": "image_caption", + "bbox": [ + 0.333, + 0.252, + 0.668, + 0.266 + ], + "angle": 0, + "content": "Fig. 13: Showcases of limitations in HybridBooth." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.296, + 0.784, + 0.357 + ], + "angle": 0, + "content": "subject features, we adjust the number of embeddings. Quantitative results in Fig. 12 indicate a consistent improvement in metrics related to Prompt Fidelity and Subject Fidelity with an increasing number of words. To balance efficiency and computation cost, we set the number of word embeddings we estimate to 5." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.37, + 0.785, + 0.462 + ], + "angle": 0, + "content": "Can the Learned Subject Concept be Cross-species Adapted? The well-aligned training data in the Probe Stage results in the encoder developing a consistent semantic tendency in attention maps, as shown in Fig. 6. The subsequent Refinement Stage further enhances the model's generalization ability. Fig. 11 illustrates that species with similar semantic structures, such as humans, dogs, and cats, consistently yield robust results, even with complex prompts." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.484, + 0.358, + 0.499 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.515, + 0.785, + 0.621 + ], + "angle": 0, + "content": "In this paper, we address the challenge of achieving fast prompt inversion while preserving the generalization capabilities of text-to-image models. By leveraging both optimization-based and direct-regression-based methods, we propose a two-stage hybrid prompt inversion framework, termed HybridBooth. This framework ensures robust and efficient subject-driven generation while maintaining the model's general creative ability. Experimental results demonstrate the superior performance of HybridBooth compared to existing state-of-the-art methods." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.621, + 0.785, + 0.711 + ], + "angle": 0, + "content": "Limitation. As shown in Fig. 13, HybridBooth cannot perform precise semantic editing, such as adjusting expressions and age. In addition, HybridBooth inherits the weakness from StableDiffusion that fails to generate fine-grained details of the subject, such as fingers. To address these issues, we believe possible solutions are incorporating language-and-vision models [22] for improved understanding and planning, and utilizing more 3D structural information [4,5]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.734, + 0.393, + 0.751 + ], + "angle": 0, + "content": "Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.765, + 0.784, + 0.839 + ], + "angle": 0, + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant No. 62073244 and 61825303, 62088101, and the Shanghai Municipal Science and Technology Major Project (2021SHZDZX0100) and the Fundamental Research Funds for the Central Universities. We thank Yixuan Li for his assistance with the illustrations." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.204 + ], + "angle": 0, + "content": "1. Alaluf, Y., Patashnik, O., Cohen-Or, D.: Only a matter of style: Age transformation using a style-based regression model. ACM TOG 40(4) (2021) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.205, + 0.785, + 0.232 + ], + "angle": 0, + "content": "2. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization (2023) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.233, + 0.785, + 0.272 + ], + "angle": 0, + "content": "3. Arar, M., Gal, R., Atzmon, Y., Chechik, G., Cohen-Or, D., Shamir, A., Bermano, A.H.: Domain-agnostic tuning-encoder for fast personalization of text-to-image models (2023) 2, 4, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.273, + 0.785, + 0.3 + ], + "angle": 0, + "content": "4. Blanz, V., Vetter, T.: A morphable model for the synthesis of 3d faces. In: Waggenspack, W.N. (ed.) SIGGRAPH. pp. 187-194 (1999) 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.301, + 0.785, + 0.342 + ], + "angle": 0, + "content": "5. Bogo, F., Kanazawa, A., Lassner, C., Gehler, P., Romero, J., Black, M.J.: Keep it smpl: Automatic estimation of 3d human pose and shape from a single image. In: ECCV. pp. 561-578. Springer (2016) 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.343, + 0.785, + 0.424 + ], + "angle": 0, + "content": "6. Brown, T.B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., Agarwal, S., Herbert-Voss, A., Krueger, G., Henighan, T., Child, R., Ramesh, A., Ziegler, D.M., Wu, J., Winter, C., Hesse, C., Chen, M., Sigler, E., Litwin, M., Gray, S., Chess, B., Clark, J., Berner, C., McCandlish, S., Radford, A., Sutskever, I., Amodei, D.: Language models are few-shot learners (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.785, + 0.466 + ], + "angle": 0, + "content": "7. Choi, Y., Choi, M., Kim, M., Ha, J.W., Kim, S., Choo, J.: Stargan: Unified generative adversarial networks for multi-domain image-to-image translation. In: CVPR (2018) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.785, + 0.508 + ], + "angle": 0, + "content": "8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: North American Chapter of the Association for Computational Linguistics (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.509, + 0.785, + 0.55 + ], + "angle": 0, + "content": "9. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: ICLR (2022) 1, 2, 4, 5, 9, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.551, + 0.785, + 0.591 + ], + "angle": 0, + "content": "0. Gal, R., Arar, M., Atzmon, Y., Bermano, A.H., Chechik, G., Cohen-Or, D.: Encoder-based domain tuning for fast personalization of text-to-image models. ACM TOG 42(4), 1-13 (2023) 1, 2, 4, 5, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.592, + 0.785, + 0.632 + ], + "angle": 0, + "content": "1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS. pp. 2672-2680 (2014) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.633, + 0.785, + 0.66 + ], + "angle": 0, + "content": "2. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. In: CVPR (2017) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.785, + 0.702 + ], + "angle": 0, + "content": "3. Jiang, D., Liu, Y., Liu, S., Zhang, X., Li, J., Xiong, H., Tian, Q.: From clip to dino: Visual encoders shout in multi-modal large language models. CoRR:2310.08825 (2023) 6, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.703, + 0.785, + 0.729 + ], + "angle": 0, + "content": "4. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 2, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.73, + 0.785, + 0.756 + ], + "angle": 0, + "content": "5. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.798 + ], + "angle": 0, + "content": "6. Kim, T., Kim, K., Lee, J., Cha, D., Lee, J., Kim, D.: Revisiting image pyramid structure for high resolution salient object detection. In: Proceedings of the Asian Conference on Computer Vision. pp. 108-124 (2022) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.775, + 0.812 + ], + "angle": 0, + "content": "7. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "8. Krasin, I., Duerig, T., Alldrin, N., Ferrari, V., Abu-El-Haija, S., Kuznetsova, A., Rom, H., Uijlings, J., Popov, S., Veit, A., et al.: Openimages: A public dataset for" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.623, + 0.129 + ], + "angle": 0, + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + }, + { + "type": "ref_text", + "bbox": [ + 0.241, + 0.147, + 0.786, + 0.176 + ], + "angle": 0, + "content": "large-scale multi-label and multi-class image classification. Dataset available from https://github.com/openimages2(3), 18 (2017) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.177, + 0.786, + 0.202 + ], + "angle": 0, + "content": "19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR (2023) 2, 4, 7, 9, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.203, + 0.786, + 0.23 + ], + "angle": 0, + "content": "20. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR. pp. 1931-1941 (2023) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.23, + 0.786, + 0.256 + ], + "angle": 0, + "content": "21. Li, D., Li, J., Hoi, S.C.H.: Blip-diffusion: Pre-trained subject representation for controllable text-to-image generation and editing. In: NeurIPS (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.257, + 0.786, + 0.283 + ], + "angle": 0, + "content": "22. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. In: CVPR. pp. 26296-26306 (2024) 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.284, + 0.786, + 0.308 + ], + "angle": 0, + "content": "23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2018) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.31, + 0.786, + 0.338 + ], + "angle": 0, + "content": "24. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. CoRR:2211.09794 (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.338, + 0.786, + 0.365 + ], + "angle": 0, + "content": "25. Nichol, A.Q., Dhariwal, P.: Improved denoising diffusion probabilistic models. In: ICML. pp. 8162-8171 (2021) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.365, + 0.786, + 0.392 + ], + "angle": 0, + "content": "26. van den Oord, A., Vinyals, O., kavukcuoglu, k.: Neural discrete representation learning. In: NeurIPS. p. 6306-6315 (2017) 3, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.392, + 0.786, + 0.432 + ], + "angle": 0, + "content": "27. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. CoRR:2304.07193 (2023) 6, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.433, + 0.786, + 0.459 + ], + "angle": 0, + "content": "28. Pan, X., Qin, P., Li, Y., Xue, H., Chen, W.: Synthesizing coherent story with auto-regressive latent diffusion models (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.459, + 0.786, + 0.5 + ], + "angle": 0, + "content": "29. Pan, X., Tewari, A., Leimkuhler, T., Liu, L., Meka, A., Theobalt, C.: Drag your gan: Interactive point-based manipulation on the generative image manifold. In: SIGGRAPH. pp. 1-11 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.501, + 0.786, + 0.542 + ], + "angle": 0, + "content": "30. Peng, X., Zhu, J., Jiang, B., Tai, Y., Luo, D., Zhang, J., Lin, W., Jin, T., Wang, C., Ji, R.: Portrait booth: A versatile portrait model for fast identity-preserved personalization. In: CVPR. pp. 27080-27090 (2024) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.542, + 0.786, + 0.582 + ], + "angle": 0, + "content": "31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021) 3, 4, 6, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.583, + 0.786, + 0.609 + ], + "angle": 0, + "content": "32. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: ICML (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.61, + 0.786, + 0.636 + ], + "angle": 0, + "content": "33. Roich, D., Mokady, R., Bermano, A.H., Cohen-Or, D.: Pivotal tuning for latent-based editing of real images. ACM TOG (2021) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.636, + 0.786, + 0.676 + ], + "angle": 0, + "content": "34. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022) 1, 3, 4, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.677, + 0.786, + 0.704 + ], + "angle": 0, + "content": "35. Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychological review 65(6), 386 (1958) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.705, + 0.786, + 0.744 + ], + "angle": 0, + "content": "36. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: CVPR. pp. 22500-22510 (2023) 1, 2, 4, 5, 6, 7, 9, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.745, + 0.786, + 0.786 + ], + "angle": 0, + "content": "37. Ruiz, N., Li, Y., Jampani, V., Wei, W., Hou, T., Pritch, Y., Wadhwa, N., Rubinstein, M., Aberman, K.: Hyperdreambooth: Hypernetworks for fast personalization of text-to-image models. In: CVPR. pp. 6527-6536 (2024) 2, 4, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.786, + 0.786, + 0.84 + ], + "angle": 0, + "content": "38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, S.K.S., Lopes, R.G., Ayan, B.K., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022) 3" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HybridBooth" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.175 + ], + "angle": 0, + "content": "39. Shen, Y., Gu, J., Tang, X., Zhou, B.: Interpreting the latent space of gans for semantic face editing. In: CVPR (2020) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.175, + 0.787, + 0.203 + ], + "angle": 0, + "content": "40. Shen, Y., Yang, C., Tang, X., Zhou, B.: Interfacegan: Interpreting the disentangled face representation learned by gans. TPAMI (2020) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.203, + 0.787, + 0.231 + ], + "angle": 0, + "content": "41. Tewel, Y., Gal, R., Chechik, G., Atzmon, Y.: Key-locked rank one editing for text-to-image personalization. SIGGRAPH (2023) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.231, + 0.787, + 0.272 + ], + "angle": 0, + "content": "42. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.272, + 0.787, + 0.424 + ], + "angle": 0, + "content": "43. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Ferrer, C.C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura, P.S., Lachaux, M.A., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.424, + 0.787, + 0.452 + ], + "angle": 0, + "content": "44. Tov, O., Alaluf, Y., Nitzan, Y., Patashnik, O., Cohen-Or, D.: Designing an encoder for stylegan image manipulation. CoRR:2102.02766 (2021) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.452, + 0.787, + 0.479 + ], + "angle": 0, + "content": "45. Voetman, R., Aghaei, M., Dijkstra, K.: The big data myth: Using diffusion models for dataset generation to train deep detection models (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.48, + 0.787, + 0.508 + ], + "angle": 0, + "content": "46. Wang, Q., Bai, X., Wang, H., Qin, Z., Chen, A.: Instantid: Zero-shot identity-preserving generation in seconds. CoRR preprint CoRR:2401.07519 (2024) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.508, + 0.787, + 0.55 + ], + "angle": 0, + "content": "47. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: ICCV. pp. 15943-15953 (2023) 2, 4, 9, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.55, + 0.787, + 0.59 + ], + "angle": 0, + "content": "48. Xiao, G., Yin, T., Freeman, W.T., Durand, F., Han, S.: Fastcomposer: Tuning-free multi-subject image generation with localized attention. CoRR:2305.10431 (2023) 2, 7, 9, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.591, + 0.787, + 0.632 + ], + "angle": 0, + "content": "49. Zhang, Q., Wang, C., Wu, H., Xin, C., Phuong, T.V.: Gelu-net: A globally encrypted, locally unencrypted deep neural network for privacy-preserved learning. In: IJCAI. pp. 3933-3939 (2018) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.632, + 0.787, + 0.672 + ], + "angle": 0, + "content": "50. Zhou, Y., Zhang, R., Sun, T., Xu, J.: Enhancing detail preservation for customized text-to-image generation: A regularization-free approach. CoRR:2305.13579 (2023) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.672, + 0.787, + 0.703 + ], + "angle": 0, + "content": "51. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: ICCV (2017) 3" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.703 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_origin.pdf b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6c54a0644ac9f361c5fc979371a2b19da6846b0e --- /dev/null +++ b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/34cf6720-b23d-466c-a2c5-f8480c69551f_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b9ea98139a85793a7c9bbff35672d12cf27277cc05f2bf199d43cc7a153ff92a +size 5741732 diff --git a/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/full.md b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..49459eb7e64b06430d0a656f70b56bbb7e45d92a --- /dev/null +++ b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/full.md @@ -0,0 +1,370 @@ +# HybridBooth: Hybrid Prompt Inversion for Efficient Subject-Driven Generation + +Shanyan Guan $^{1\star}$ , Yanhao Ge $^{1,3\star}$ , Ying Tai $^{2\boxtimes}$ , Jian Yang $^{2}$ Wei Li $^{1}$ , and Mingyu You $^{3\star\star\boxtimes}$ + +$^{1}$ vivo Mobile Communication Co., Ltd + +$^{2}$ School of Intelligence Science and Technology, Nanjing University + +3 College of Electronic and Information Engineering, Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University + +{guanshanyan, halege}@vivo.com yingtai@nju.edu.cn myyou@tongji.edu.cn https://sites.google.com/view/hybridbooth + +Abstract. Recent advancements in text-to-image diffusion models have shown remarkable creative capabilities with textual prompts, but generating personalized instances based on specific subjects, known as subject-driven generation, remains challenging. To tackle this issue, we present a new hybrid framework called HybridBooth, which merges the benefits of optimization-based and direct-regression methods. HybridBooth operates in two stages: the Word Embedding Probe, which generates a robust initial word embedding using a fine-tuned encoder, and the Word Embedding Refinement, which further adapts the encoder to specific subject images by optimizing key parameters. This approach allows for effective and fast inversion of visual concepts into textual embedding, even from a single image, while maintaining the model's generalization capabilities. + +Keywords: Customized Generation $\cdot$ Image Inversion $\cdot$ Image synthesis + +# 1 Introduction + +Recent advancements in text-to-image diffusion models [25, 34] have demonstrated unprecedented creating capabilities guided by textual prompts, such as creative endeavors in visual arts [28], synthetic dataset build-up [45], and image editing for marketing and advertising [24]. However, creating personalized instantiations based on specific subjects remains a challenging problem, also known as subject-driven generation [9,10,30,36,46]. + +To achieve subject-driven generation, recent works [9, 10, 36] explore the inversion of subject images into specific textual embeddings, either through iterative optimization (optimization-based) or direct regression methods. These two paradigms are summarized in Fig. 2. Optimization-based methods, such as + +![](images/7a8a5514cf0765683bc565a978045a0bad2a2b743bd866d5cfc5613c049c54d9.jpg) + +![](images/8780147643ef99d3eca980681de55126c2b8aac31fa9a605ffc7a122ac667302.jpg) +Input Image + +![](images/cabd0c67d91a6d2be0e8c26d894f55a5ef42493f2b4e6a96468ce0455623054f.jpg) + +![](images/7714d85bbb1c3349d0c3a041595c80612d96abedd8bf6abeaa18e77500179b12.jpg) +InputImage +HybridBooth (Ours) 3~5 steps + +![](images/6313e6724bd5d8907850035fc2e9d4f97d209141c4a1b3a7b220847b1e9c482d.jpg) +Custom Diffusion 200 * steps +Fig.1: We propose HybridBooth for efficient subject-driven generation. Unlike FastComposer [48], which targets humans, it cannot affect the Bronze Mask (Top). Compared to optimization-based [19,36] and direct-regression-based methods [47,48], our framework generates diverse, precise images while preserving the subject's identity, requiring only $3 \sim 5$ optimization iterations. + +![](images/a66ea35773032713da35ab1773bbb685038952c30e00f7ea8143e93189ff2334.jpg) +DreamBooth 1000\*steps + +![](images/e2f560baedc35822cf5ab0b1addeda8711e651a551f611077f30988c67a76db8.jpg) +Fast Composer $1^{*}$ step + +![](images/a4b45c60d5ccc3f459f3b4a4a33dd981a48db52c99c603872ffc795b80fa1405.jpg) +ELITE $I^{*}$ step + +Textual Inversion and DreamBooth [9, 37], iteratively optimize the generation model or textual embedding of the subject to better align with given subject images. Constrained by tens of subject images, optimization-based methods can accurately capture the identifying characteristics of the subject. However, the optimization procedure is computationally expensive and slow to converge. In comparison, direct-regression-based methods [1-3,7,10,39-41,44,47] achieve textual concept inversion by tuning a pre-trained model with labeled datasets or concept-specific images. While these methods enable zero-shot subject-driven generation, they suffer from detail loss and adaptation issues when combining the target subject with new styles or prompts. + +In this paper, we introduce a novel framework called HybridBooth, designed for efficient subject-driven generation using text-to-image diffusion models. The core idea is to synergistically combine the strengths of various methods, creating a hybrid approach that balances quality and speed. As shown in Fig. 2, HybridBooth operates in two stages. The first stage, termed Word Embedding Probe, employs an encoder to generate a robust initial word embedding. This encoder is fine-tuned on a large-scale dataset such as FFHQ [14] with 70,000 images. In the second stage, the domain-agnostic encoder undergoes further finetuning to adapt to a specific subject's image in a word embedding refinement process. This stage focuses on optimizing the most influential parameters of the regressor. These two stages work collaboratively, enhancing each other to achieve precise and efficient subject-driven generation. + +Overall, our contributions are summarized as follows: + +- Combining strengths of both optimization-based and direct-regression-based paradigms, we propose HybridBooth for precise and efficient subject-driven generation in less than 5 iteration steps. + +![](images/21a6c09eb3d5e647d1f5f8e6c6b83e7419883a58364950bdd682271813f03616.jpg) +Fig. 2: Comparing with previous frameworks, our method leverages a coarse-to-fine strategy, effectively integrating the advantages of both optimization- and regression-based methods. Consequently, we enable a fast prompt inversion with high-fidelity generation from just a single image. + +![](images/f997ece0278d0771463b37d284f4901ccb008e3517c63eef46c5f2790d497842.jpg) + +![](images/a4aa15340262ead98937e3a575b3f2adcc829b8b6aa14721c7bbba9239f6746f.jpg) + +
MethodFast Prompt InversionHigh-Fidelity GenerationSubject Images Needed
1. Optimization-basedX✓Multiple
2. Direct-regression-based✓XSingle
3. HybridBooth (Ours)✓✓Single
+ +- We craft a Regressor-based Word Embedding Probe module to ensure a robust feature initialization while maintaining a focus on general-oriented generation model. +- We introduce a residual refinement strategy to accelerate the fitting process while preventing the collapse of the prior learned during the probe stage. + +# 2 Related Work + +# 2.1 Text-to-image Generation + +Text-to-image generation focuses on creating visually accurate and contextually relevant images from textual descriptions. Early approaches, such as Generative Adversarial Networks (GANs) [11, 12, 15, 51], achieved high-quality synthetic images. However, these studies primarily emphasize image generation within specific domains, leading to limitations in extended applications. The progress of large language models [6,8,31,42,43] has enabled methods based on variational auto-encoders [17, 26] and diffusion models [32, 34, 38] to effectively map word sequences into latent space, guiding image generation from textual prompts. Our method leverages pre-trained text-to-image diffusion models to generate personalized visual content efficiently and effectively. + +# 2.2 Subject-driven Generation + +Subject-driven generation is a type of controllable generation task that aims to generate instances of specific subjects in new contexts (e.g., styles, scenarios). Current approaches can be broadly categorized into two types: 1) optimization-based and 2) direct-regression-based methods. + +Optimization-based Methods iteratively refine images to align with given textual descriptions. Inversion is a common technique to preserve a subject while modifying its context. For GANs, Pivot Tuning [33] fine-tunes the model using an inverted latent code for robust, ID-preserving generation. Recent work [29] keeps GAN-generated subjects consistent and controllable. However, these methods often struggle with unique subjects and fail to preserve all details. In diffusion models, inversion aims to determine the initial noise that generates the target image through denoising. Methods like DreamBooth and Textual Inversion [9, 19, 36, 37] personalize pre-trained models to generate specific subjects in various contexts but are computationally intensive and slow to converge. Our method uses a hybrid framework for robust initial feature encoding, followed by rapid optimization, achieving superior efficiency. + +Direct-regression-based Methods generate subject-specific images directly from textual prompts without iterative optimization, relying on extensive model modifications on large datasets. These methods generate images from scratch based on learned text-visual correlations. Previous GAN-based methods [1, 7, 39, 40, 44] retrain generators or add conditioned constraints for ID-preserving generation but are limited by their training sets. Recent diffusion-based methods [2, 3, 10, 41, 47] tune only the encoder of pre-trained models, offering efficiency but risking overfitting and reduced performance on diverse tasks. To address these limitations, HybridBooth initially refines the encoder and employs a subject-driven residual refinement module. This process requires only 3 to 5 steps, resulting in more detailed and robust images compared to other direct-regression-based methods. + +# 3 Preliminaries + +# 3.1 Text-to-Image Latent Diffusion Models + +We implemented our method based on text-to-image Latent Diffusion Models (LDMs) [34] which can understand prompts and generate vivid images. LDMs mainly consist of three components, including a variational auto-encoder (VAE) [26], an UNet, and a CLIP text encoder [31]. The VAE encoder $\mathcal{E}$ compresses $\pmb{x}$ into a low-dimensional latent code $z = \mathcal{E}(\pmb{x})$ , and the decoder $\mathcal{D}$ maps the latent code $\pmb{z}$ back to image space $\hat{\pmb{x}} = \mathcal{D}(\pmb{z})$ . For the text-guided diffusion process, the latent code $\pmb{z}$ is perturbed by Gaussian noise $\epsilon$ . Then the UNet $\mathcal{M}_{\theta}$ learns to predict the applied noise $\pmb{z}_t$ with a specified time step $t$ . The denoising + +![](images/0d44240b1b720294e4720973c6e443c8e71f63707e3a9f610dc380b6f159ec80.jpg) +Fig. 3: Showcasing our prompt inversion framework incorporating various conditions (depth, canny, keypoints) and community models1. + +process is conditioned on the text feature $\pmb{c}$ extracted from text prompts $\pmb{y}$ by using text encoder $\tau_{\pmb{\theta}}$ . The training loss is formulated as: + +$$ +\mathcal {L} _ {\epsilon} = \mathbb {E} _ {\boldsymbol {z} \sim \mathcal {E} (\boldsymbol {x}), \epsilon \sim \mathcal {N} (0, 1), \boldsymbol {c}, t} \left[ \left\| \boldsymbol {\epsilon} - \mathcal {M} _ {\boldsymbol {\theta}} \left(\boldsymbol {z} _ {t}, \boldsymbol {c}, t\right) \right\| _ {2} ^ {2} \right]. \tag {1} +$$ + +During inference, given a prompt $\pmb{y}$ , the model iteratively denoises $\pmb{z}_t$ conditioned on the text feature $\pmb{c} = \tau_{\pmb{\theta}}(\pmb{y})$ . Finally, $\pmb{z}_0$ is decoded to an image $\hat{\pmb{x}} = \mathcal{D}(\pmb{z}_0)$ . + +# 3.2 Prompt Inversion for Subject-Dirven Generation + +Despite the remarkable general generation capability of LDMs, challenges remain in generating specific subjects across various contexts, known as Subject-Driven Generation [9,36]. One feasible approach is to learn textual concepts from subject-specific images, referred to as Prompt Inversion [3,10,21]. Given several images $\mathbf{X}$ of a subject, the prompt inversion aims to inverse the visual content of the subject to the embedding of words $\mathbf{e}$ : + +$$ +\boldsymbol {e} \leftarrow \mathcal {I} (\boldsymbol {X}), \tag {2} +$$ + +where $\mathcal{I}$ represents the inversion process. The primary goal of the inversion process is to ensure that $e\in \mathbb{R}^{n\times d}$ captures the key identifying characteristics of the subject. The word embedding $\pmb{e}$ is then encoded into textual features $\pmb{c}$ using a pre-trained text encoder (i.e., CLIP). Once $\pmb{e}$ is learned, it can be readily combined with arbitrary text for the creative generation of the subject. Specifically, let 'S*' be the text word corresponding to the learned embedding $\pmb{e}$ , we can combine 'S*' with new prompts to realize arbitrary subject-driven image synthesis, e.g. 'S* in snow forest'. + +Discussion. Another paradigm involves mapping subject images to image tokens and using an additional cross-attention layer to inject these tokens into the diffusion process. This paradigm significantly alters the generation process of the original Latent Diffusion Models (LDMs), necessitating retraining on millions of images. In contrast, prompt inversion is a more resource-efficient method for subject-driven generation. As shown in Fig. 3, it can seamlessly integrate with various community foundational models and controllers pre-trained on the original stable diffusion, making it a versatile and practical alternative. + +![](images/0572023978e62c53a3812efd3f2aee27c2a4f63fc53d5663827a5748c08513f0.jpg) +Fig. 4: The framework of HybridBooth consists of two stages: (a) The first Probe Stage leverages a prompt regressor estimate the initial word embedding, acting as a probe for a rational word embedding; (b) The second Refinement Stage adapts the regressor to the subject by taking only 3-5 iterations to achieve efficient subject generation. + +# 4 Hybrid Prompt Inversion Framework + +Given just one image $\pmb{x}$ of a specific subject, we aim to efficiently embed the subject into the word embedding space. We combine the strengths of optimization and direct-regression-based paradigms to achieve precise and efficient subject-driven generation. Thus, we propose a hybrid prompt inversion framework, termed HybridBooth. As shown in Fig. 4, HybridBooth consists of two stages: (1) Word Embedding Probe Stage, which learns a domain-agnostic encoder providing an initial word embedding estimate. (2) Word Embedding Refinement Stage, which adapts the encoder to the given image of the subject. The key idea is: A powerful encoder reduces iterative refinement costs, while effective iterative refinement reduces the encoder's accuracy demands. Our challenge is to develop a robust encoder for initial embeddings and an effective refinement scheme to reduce the encoder's precision requirements. Next, we introduce the Word Embedding Probe stage in Sec. 4.1, describe the residual refinement stage in Sec. 4.2, and present the framework details in Sec. 4.3. + +# 4.1 Regressor-based Word Embedding Probe + +First, HybridBooth trains a prompt regressor that takes an image of a subject as input and estimates the initial word embedding. This involves extracting multi-grained image features and conducting multiple-word regression. + +Multi-grained Image Feature Merging. Existing regressor-based methods exclusively utilize CLIP features $\pmb{f}_c$ , which often contain global semantic information (e.g., subject's category) [13,31,36]. Hence, we incorporate DINOv2 [27] + +![](images/1a1a77edb2c46ce41186e8b1c0da6cc118e675aa18df42c0acebf72140438d01.jpg) +Fig. 5: Impact of hyper-parameters in the residual refinement stage (on the Dream-Booth dataset [36]). Default parameters are marked with red circles. Custom Diffusion [19] serves as the reference. Prompt Fidelity and Subject Fidelity are CLIP-I and DINO-T, respectively (see Sec. 5.1). + +features $\pmb{f}_d$ as a supplement, offering detailed pixel-level information. Taking inspiration from previous practices [13,48], we employ a Multilayer Perceptron (MLP) to project DINOv2 features $\pmb{f}_d$ , then concatenate the output with CLIP feature $\pmb{f}_c$ . Finally we align the feature dimension using a Linear layer [35]. The merging process is formulated as: + +$$ +\boldsymbol {f} = \operatorname {L i n e a r} \left(\left[ \boldsymbol {f} _ {c}, \operatorname {M L P} \left(\boldsymbol {f} _ {d}\right) \right]\right), \tag {3} +$$ + +where $[\cdot, \cdot]$ represents the concatenation operation, and the structure of MLP is LyaerNorm-Linear-GELU [49]-Linear. As verified in our experiments, this simple module yields significant improvements. + +Multiple-word Regression. The merged feature $\pmb{f}$ is then mapped to word embeddings $\pmb{e}$ . Typically, a single word represents a specific concept, e.g. 'man' conveys the subject's category but may lack details like hairstyle. Thus, we suggest projecting the feature $\pmb{f}$ to multiple-word embeddings to provide a more thorough description of the subject: + +$$ +\boldsymbol {e} = \mathcal {R} (\boldsymbol {f}), \tag {4} +$$ + +where $\pmb{e} = \{\pmb{e}_i\}_{i=1}^n$ , $n$ is the number of word embeddings $\pmb{e}_i \in \mathbb{R}^d$ , and $d$ is the dimension of word embedding. + +# 4.2 Residual Refinement + +Although the regressor-based probe is fast, precise alignment between word embeddings and key subject features remains challenging without image feature feedback. Thus, our subsequent stage focuses on refinement, aiming to adapt the learned regressor to target subject for better alignment. Striking a balance is challenging due to the single image input, as it requires avoiding overfitting to a specific image while capturing essential subject characteristics effectively. + +To tackle this issue, we enhance the learned regressor with a residual refinement strategy that adjusts only critical parameters $(\boldsymbol{W}_{\phi})$ for faster adaptation while preserving the learned prior. The residual refinement is formulated as: + +$$ +\boldsymbol {W} _ {\phi} ^ {\prime} = \boldsymbol {W} _ {\phi} + \lambda \Delta \boldsymbol {W} _ {\phi}, \tag {5} +$$ + +![](images/4e6b667778398e427a2a160dd7571de1566c659073cd7c842bab27f13b07633f.jpg) +Fig. 6: Showcases of the cross-attention map for the subject word 'S*'. Applying mask regularization $\mathcal{L}_M$ prevents attention leakage to irrelevant areas, even with other subjects present (highlighted in red boxes). + +where $\Delta W_{\phi}$ is the learned residual parameters and a hyperparameter $\lambda$ is to control the scale of $\Delta W_{\phi}$ . With residual refinement, it only takes 3-5 iterations to achieve high-fidelity subject generation while preserving editability. + +Discussing the overfitting problem. Overfitting is a common challenge in finetune-based methods, especially when tuning the prompt regressor on a single image. To mitigate this, we refine only partial parameters (see Eq. (5)). Intuitively understanding, $W_{\phi}$ acts as an anchor, preserving the learned prior and stabilizing updates. Zeroing out $W_{\phi}$ collapses its prior (see the last column in Fig. 10), and we need to adjust hyper-parameters more carefully. As shown in Fig. 5, by using residual refinement, $\lambda$ and iteration steps can vary widely yet still yield good results. Fig. 7 and Fig. 9 demonstrate that HybridBoothcan generate novel subject images with diverse expressions, postures, styles, and scenarios. + +# 4.3 Framework Details + +Prompt Regressor Design. Previous studies have used either an MLP or a UNet as the prompt regressor. HybridBooth is flexible and can integrate any network mapping image features $\pmb{f}$ to word embeddings $\pmb{e}$ . We employ the state-of-the-art regressor PromptNet [50], which uses a block structure similar to LDM and can be initialized with LDM pretrained on large-scale image datasets. In the refinement stage, we focus on refining the cross-attention layer parameters (key, query, and value matrices $\mathbf{W}_k$ , $\mathbf{W}_q$ , $\mathbf{K}_v$ ) based on layer importance experiments. Fine-tuning the entire regressor with 100 images, we calculated importance scores for each layer based on the mean cosine distance of parameters before and after refinement: cross-attention (56.3), self-attention (43.9), and other layers (e.g. convolution) (12.4). The cross-attention layer had the highest importance. Similar experiments by Custom Diffusion [20] and E4T [10] focused on the denoising UNet within LDMs. + +Training with Mask Regularization. The diffusion loss $\mathcal{L}_{\epsilon}$ (Eq. (1)) is commonly used for training the prompt regressor. However, as shown in Fig. 6 (Left), the cross-attention maps of the subject's word embedding often leak into the irrelevant background. To address this, we use the subject's mask to constrain the cross-attention maps of subject words, ensuring focus on the subject region. Let $A_{e_i} \in \mathbb{R}^{h \times w}$ be the attention map for $e_i$ , and $M \in \mathbb{R}^{H \times W}$ be the segmentation + +mask for the subject. We use a mask regularization loss to align $A_{e_i}$ with $M$ : + +$$ +\mathcal {L} _ {M} = \frac {1}{n} \sum_ {i = 1} ^ {n} \operatorname {m e a n} \left(\boldsymbol {A} _ {\boldsymbol {e} _ {i}} \cdot (\boldsymbol {1} - \boldsymbol {M})\right) - \operatorname {m e a n} \left(\boldsymbol {A} _ {\boldsymbol {e} _ {i}} \cdot \boldsymbol {M}\right), \tag {6} +$$ + +where $n$ is the number of word embeddings. This loss minimizes attention outside the mask and maximizes it inside, ensuring focus on the subject. The interpolation of $M$ to match $A_{e_i}$ is omitted for simplicity. The final training objective of the regressor is: + +$$ +\mathcal {L} = \mathcal {L} _ {\epsilon} + \alpha_ {M} \mathcal {L} _ {M}, \tag {7} +$$ + +where $\alpha_{M}$ is the weight of $\mathcal{L}_M$ . During refinement, $\mathcal{L}$ is used to prevent diverging update directions, focusing on fine-tuning the cross-attention parameters. + +# 5 Experiments + +# 5.1 Experimental Setup + +Datasets. We mainly conduct experiments on facial images. Following prior research practices, we train HybridBooth on the aligned FFHQ dataset [14], comprising 70,000 in-the-wild facial images. Constrained by computational resources, we conducted testing on the first 1,000 images from the CelebA-HQ test split. In addition, we also evaluate HybridBooth on other categories to demonstrate its versatility. With the same setting of ELITE [47], we train HybridBooth on the test split of OpenImagesv6 [18], and test on the DreamBooth Dataset. All images are cropped and resized to $512 \times 512$ pixels. + +Training Details. We use Stable Diffusion v1.5 [34] as our Text-to-Image model, initializing the prompt regressor with the UNet from Stable Diffusion. The DINOv2-Large model [27] extracts the DINO feature, and the vision model of clip-vit-large-patch14 [31] extracts the CLIP image feature. The segmentation mask $M$ (Eq. (6)) is obtained using InSPyReNet [16]. We use the same hyperparameters for both facial and non-facial experiments. For the word embedding probe stage, we use the AdamW optimizer [23] with a learning rate of 2e-5 and a batch size of 8. Training on a single Nvidia A100 GPU takes 40 hours. In the refinement stage, we fine-tune the cross-attention parameters of the regressor for 5 steps using AdamW, with a learning rate of 2e-5 and a weight decay of 1e-2. Parameters $\alpha_{M}$ (Eq. (7)) and $\lambda$ (Eq. (5)) are set to 1e-3 and 1e-2, respectively. + +Baselines. We compare the proposed HybridBooth with two categories of methods: (1) Optimization-based methods: DreamBooth [36], Textual Inversion [9], and Custom Diffusion [19]. (2) Direct-regression-based methods: ELITE [47] and FastComposer [48]. Optimization-based methods typically require $3 \sim 5$ images as input, which are not available in CelebA-HQ (our test set). To ensure a fair + +![](images/5e75fd43dddcfd1645f356ef40263f3ee8c047a6470bd3adb553e15f48717a4b.jpg) +watercolor painting of a $S^{*}$ in the snow + +![](images/9265b7d65d582fd14bb13756fc28f7ee179417b4f62ea6b1f5396de1be0b827a.jpg) +A red S\* in Pixar style + +![](images/fa1fa9ea23bb515045d45cd7345838e7dada8d40d0391c13336e8c26904b25fd.jpg) +Pointillism painting of a $S^{*}$ with night sky +Fig. 7: Qualitative Comparison Results on CelebA-HQ (facial dataset). Columns 2-4: Optimization-based methods. Columns 5-6: Direct-regression-based methods. + +comparison, we augment each image to generate 5 images for these methods using affine transformations and background changes. More details on the augmentation process are provided in the Supplementary. To clarify the difference between HybridBooth and HyperDreamBooth [37], HyperDreamBooth updates weights in a low-rank space for rapid model tuning but overlooks the importance of training a powerful encoder initially. Since the official code for HyperDream-Booth was unavailable during our submission, we could only make qualitative comparisons with examples from their paper (see Fig. 8). + +Evaluation Metrics. We evaluate the model's performance in two aspects: + +- Prompt Fidelity: This measures how well the generated images match the textual prompt, quantified by the average cosine similarity of CLIP embeddings between the prompt and the generated images (CLIP-T). Higher CLIP-T indicates better textual editability. + +- Subject Fidelity: This assesses the preservation of subject details during generation. We use CLIP-I and DINO-I metrics, which are the cosine similarities between the embeddings of the generated images and the original concept images. Higher values indicate better subject fidelity. + +# 5.2 Qualitative Comparison + +In Fig. 7, we present qualitative comparison results. Similar to previous works, 'S*' denotes the word embedding learned from the input subject image. For a fair comparison, optimization-based methods use 5 images for optimization. Our setting is more complex, specifying both artistic style (e.g., 'watercolor painting') and environmental characteristics (e.g., 'in the snow'). From the results, two key + +![](images/ad8bd36f8f997f81ccd433b602bee0c229fc1b0452d113000afdb14a8674c988.jpg) +Fig. 8: Qualitative Comparison with Hyperdreambooth [37]. + +![](images/7a45b71bd115fed1b47c38d62ffd6e0308897e02fbb3c3741281c2f64771769c.jpg) +photo of sks dog on top of green grass with sunflowers +Fig. 9: Qualitative Comparison Results on non-facial images. + +observations emerge: (1) Optimization-based methods (Columns 2-4), using multiple image inputs and finely tuned hyper-parameters (e.g., total iteration steps), generally outperform direct-regression-based methods (Columns 5-6) in prompt alignment and subject similarity. (2) Our proposed HybridBooth outperforms all compared methods in text alignment and subject similarity. For example, in the third row, other methods either fail in text similarity (e.g., FastComposer) or in preserving facial similarity, whereas HybridBooth successfully aligns the subject with the editing prompt, demonstrating its superiority. + +Qualitative comparisons with HyperDreamBooth [37] are shown in Fig. 8. HyperDreamBooth trains a hyper-network to predict low-rank weights of the image diffusion model and fine-tunes these weights on one subject image. However, low-rank weight updates limit personalized representation, resulting in poorer subject feature preservation, as seen in Fig. 8. This supports our core idea that a more powerful encoder reduces the cost of iterative refinement. + +As shown in Fig. 9, we evaluate HybridBooth on non-facial images, including animals (Line 1) and complex buildings (Line 2). FastComposer [48] is excluded as it is designed for facial images. In Line 1, most methods preserve the texture of the subject well. However, in Line 2, only HybridBooth maintains the structural information while adhering to the complex prompt. This is due to the hybrid framework, which enables quick feature learning while retaining the prompt understanding capability of the Stable Diffusion model. + +Table 1: Quantitative Evaluation on the CelebA-HQ. First Block: Optimization-based methods. Second Block: Direct-regression-based methods. Third Block: HybridBooth and its ablations. + +
MethodCelebA-HQDreamBooth-datasetIter. Step↓
CLIP-T ↑CLIP-I ↑DINO-I ↑CLIP-T ↑CLIP-I ↑DINO-I ↑
Textual Inversion [9]0.1640.6120.2360.1830.6630.4625000
DreamBooth [36]0.2510.5640.3760.2510.7850.6741000
Custom Diffusion [19]0.2370.6750.3980.2450.8010.695200
ELITE [47]0.1690.5920.3110.2550.7620.6521
FastComposer [48]0.2010.7820.581---1
HybridBooth0.2460.8650.6440.2610.8650.7555
- w/o Refinement0.1770.8420.5680.1920.8350.645-
- w/o Probe0.1530.4080.0680.1420.4120.0505
- w/o DINO Feature0.1610.8370.4530.1840.8410.5965
- w/o CLIP Feature0.1820.7340.5100.2060.7520.6305
- w/o Mask Regularization0.2030.8310.6250.2330.8330.7055
+ +![](images/419d374bde625ea53aceac0a9aaed6fb11cef06e551d905cb846961739bee12e.jpg) +Input Image +Fig. 10: We conducted ablations on HybridBooth to evaluate its influence on learning subject-specific word embeddings. DreamBooth and FastComposer are utilized here for comparison. 'A photo of $S^{*}$ ' is used for generating images. + +![](images/d34a1c353e99dda7abd2422148f91eb1e0d046596e0f94b0c1a64d389cb55613.jpg) +DreamBooth + +![](images/695cf3c9aa9a2d70910413a2a8460ef1bb555b813af12946da63900afee7721b.jpg) +FastComposer + +![](images/43802b9edac725a355244a1a101a1335bf164e8d9e5b69f868698dbb7f823034.jpg) +HybridBooth(Ours) + +![](images/44f5d9f14102809852f169412df007c03ac0a9d7c10d0a7f841d5282a2db463a.jpg) +- w/o Refinement + +![](images/e0f44a580c9e64245e057be11fdf892c408a2df9b4d31fcbc2601e31ed050eab.jpg) +- w/o Probe + +# 5.3 Quantitative Comparison + +The quantitative results in Tab. 1 include the necessary iteration steps for assessing time efficiency. Optimization-based methods generally outperform direct-regression-based methods but require more iteration steps. Our HybridBooth significantly exceeds other methods in both prompt fidelity and subject fidelity. Notably, our DINO-T metric is over $10\%$ higher than FastComposer, a key metric in the DreamBooth framework [36]. + +# 5.4 Ablation Analysis + +Ablations on the Hybrid Framework. We evaluate our hybrid framework, which includes a word embedding stage for initial estimation and a residual refinement stage for precise alignment. Ablations, termed 'w/o Probe' and 'w/o Refinement', are shown in Fig. 10 and Tab. 1. The prompt regressor is initialized using the pre-trained UNet from Stable Diffusion in both settings. We assess subject fidelity using the prompt 'A photo of $\mathbf{S}^*$ , comparing it with DreamBooth + +![](images/deb27036284d7cadc70138ced6933f673036d2a8dea34cc256926cb5865e5d8a.jpg) + +![](images/9803bde3157774622fbdc1c947a7ea7beafec7999277c9d5b29131b3269d718a.jpg) +A $S^{*}$ dog in the snow + +![](images/c1bc3dca46b5740c473f87a6d704f676cbdcc9573cad28eded2ffc4fb4061b7b.jpg) +A S* devil surrounded by flames + +![](images/594528f3f03d4a57376cbac4809ac12f68dfe639759eaab79acb4d93ee308264.jpg) +oil painting of a S\* cat + +![](images/3ce440721a4f0d7240989c73384989a16b2002991fc1359ebd513b8b399daa03.jpg) + +![](images/4599e0af5ee904a764a808e92f95097c1ad41c223ba9c20b83e188e3527ece82.jpg) +Fig. 11: The learned words from human beings can be applied to cross-species subjects, which verifies that HybridBooth manages to learn intrinsic subject features. + +![](images/ca160794d2fc266f7eea9510b67edb93bb748b510170d5728c88730f249ce590.jpg) + +![](images/4b7f53d7e367a547517cfd93a1172da3e7c27a4f4c42b2b48f1c810387a5e973.jpg) + +![](images/2d4198638e6790d16344110c16bc9a964c1495d108dc2872695e15bfe5fb5786.jpg) + +![](images/6e5ee6343649ee1fa7c277e315d7455f9ebf3f186a246c072ba34505918ed848.jpg) +Fig. 12: Impact of increasing number of word embeddings (on CelebeA-HQ). + +and FastComposer. As shown in Fig. 10, subject embedding from residual refinement alone leads to lower subject similarity. Without refinement, word embedding only crudely captures key features. Our HybridBooth framework, integrating both probe and refinement stages, outperforms all ablations and compared methods, effectively restoring subject characteristics. + +Ablations on Multi-grained Image Feature Merging. Previous works [47, 48] typically use CLIP features as input for the regressor. As discussed in Sec. 4.1, we use CLIP features for global semantic information and DINO features for detailed pixel-level information. We ablate the feature extraction strategy to verify this approach. As shown in Tab. 1, relying solely on DINO or CLIP features results in suboptimal performance. However, integrating both features significantly enhances performance. Notable improvements in prompt fidelity and subject fidelity are observed, even with just a single layer normalization and linear layer. + +Analysis on the Mask Regularization Loss $\mathcal{L}_M$ . We propose a mask regularization loss $\mathcal{L}_M$ (Eq. (6)) to ensure that the estimated word embeddings align with the subject area. As shown in the last line of Tab. 1, both subject fidelity and prompt fidelity decrease significantly without the mask regularization loss. + +Ablations on the Number of Word Embedding. Recalling that the prompt regressor estimates multiple word embeddings for enhanced description of key + +![](images/5166451214f0e0a01c388f7d2250d7c21ea4536ff45ebb7051f56a6e64637c51.jpg) +Input Image +Fig. 13: Showcases of limitations in HybridBooth. + +![](images/188e0cfbae10580c1c8e45228ebeb719fde150b48cdee3e54052b4bd816e7087.jpg) +$S^{\star}$ is Laughing + +![](images/20e741edb3bf5a657360d074c78568427e691c88a13dd4be2f2a089e73947639.jpg) +$S^{\star}$ is Drawing + +![](images/36aa722ab179c1f6723246567918bb661a07d042914192841fbbc7c9e88ad20b.jpg) +$S^{\star}$ as a young child + +subject features, we adjust the number of embeddings. Quantitative results in Fig. 12 indicate a consistent improvement in metrics related to Prompt Fidelity and Subject Fidelity with an increasing number of words. To balance efficiency and computation cost, we set the number of word embeddings we estimate to 5. + +Can the Learned Subject Concept be Cross-species Adapted? The well-aligned training data in the Probe Stage results in the encoder developing a consistent semantic tendency in attention maps, as shown in Fig. 6. The subsequent Refinement Stage further enhances the model's generalization ability. Fig. 11 illustrates that species with similar semantic structures, such as humans, dogs, and cats, consistently yield robust results, even with complex prompts. + +# 6 Conclusion + +In this paper, we address the challenge of achieving fast prompt inversion while preserving the generalization capabilities of text-to-image models. By leveraging both optimization-based and direct-regression-based methods, we propose a two-stage hybrid prompt inversion framework, termed HybridBooth. This framework ensures robust and efficient subject-driven generation while maintaining the model's general creative ability. Experimental results demonstrate the superior performance of HybridBooth compared to existing state-of-the-art methods. + +Limitation. As shown in Fig. 13, HybridBooth cannot perform precise semantic editing, such as adjusting expressions and age. In addition, HybridBooth inherits the weakness from StableDiffusion that fails to generate fine-grained details of the subject, such as fingers. To address these issues, we believe possible solutions are incorporating language-and-vision models [22] for improved understanding and planning, and utilizing more 3D structural information [4,5]. + +# Acknowledgement + +This work was supported in part by the National Natural Science Foundation of China under Grant No. 62073244 and 61825303, 62088101, and the Shanghai Municipal Science and Technology Major Project (2021SHZDZX0100) and the Fundamental Research Funds for the Central Universities. We thank Yixuan Li for his assistance with the illustrations. + +# References + +1. Alaluf, Y., Patashnik, O., Cohen-Or, D.: Only a matter of style: Age transformation using a style-based regression model. ACM TOG 40(4) (2021) 2, 4 +2. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization (2023) 2, 4 +3. Arar, M., Gal, R., Atzmon, Y., Chechik, G., Cohen-Or, D., Shamir, A., Bermano, A.H.: Domain-agnostic tuning-encoder for fast personalization of text-to-image models (2023) 2, 4, 5 +4. Blanz, V., Vetter, T.: A morphable model for the synthesis of 3d faces. In: Waggenspack, W.N. (ed.) SIGGRAPH. pp. 187-194 (1999) 14 +5. Bogo, F., Kanazawa, A., Lassner, C., Gehler, P., Romero, J., Black, M.J.: Keep it smpl: Automatic estimation of 3d human pose and shape from a single image. In: ECCV. pp. 561-578. Springer (2016) 14 +6. Brown, T.B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., Agarwal, S., Herbert-Voss, A., Krueger, G., Henighan, T., Child, R., Ramesh, A., Ziegler, D.M., Wu, J., Winter, C., Hesse, C., Chen, M., Sigler, E., Litwin, M., Gray, S., Chess, B., Clark, J., Berner, C., McCandlish, S., Radford, A., Sutskever, I., Amodei, D.: Language models are few-shot learners (2020) 3 +7. Choi, Y., Choi, M., Kim, M., Ha, J.W., Kim, S., Choo, J.: Stargan: Unified generative adversarial networks for multi-domain image-to-image translation. In: CVPR (2018) 2, 4 +8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: North American Chapter of the Association for Computational Linguistics (2019) 3 +9. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: ICLR (2022) 1, 2, 4, 5, 9, 12 +0. Gal, R., Arar, M., Atzmon, Y., Bermano, A.H., Chechik, G., Cohen-Or, D.: Encoder-based domain tuning for fast personalization of text-to-image models. ACM TOG 42(4), 1-13 (2023) 1, 2, 4, 5, 8 +1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS. pp. 2672-2680 (2014) 3 +2. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. In: CVPR (2017) 3 +3. Jiang, D., Liu, Y., Liu, S., Zhang, X., Li, J., Xiong, H., Tian, Q.: From clip to dino: Visual encoders shout in multi-modal large language models. CoRR:2310.08825 (2023) 6, 7 +4. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 2, 9 +5. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 3 +6. Kim, T., Kim, K., Lee, J., Cha, D., Lee, J., Kim, D.: Revisiting image pyramid structure for high resolution salient object detection. In: Proceedings of the Asian Conference on Computer Vision. pp. 108-124 (2022) 9 +7. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3 +8. Krasin, I., Duerig, T., Alldrin, N., Ferrari, V., Abu-El-Haija, S., Kuznetsova, A., Rom, H., Uijlings, J., Popov, S., Veit, A., et al.: Openimages: A public dataset for + +large-scale multi-label and multi-class image classification. Dataset available from https://github.com/openimages2(3), 18 (2017) 9 +19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR (2023) 2, 4, 7, 9, 12 +20. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR. pp. 1931-1941 (2023) 8 +21. Li, D., Li, J., Hoi, S.C.H.: Blip-diffusion: Pre-trained subject representation for controllable text-to-image generation and editing. In: NeurIPS (2023) 5 +22. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. In: CVPR. pp. 26296-26306 (2024) 14 +23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2018) 9 +24. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. CoRR:2211.09794 (2022) 1 +25. Nichol, A.Q., Dhariwal, P.: Improved denoising diffusion probabilistic models. In: ICML. pp. 8162-8171 (2021) 1 +26. van den Oord, A., Vinyals, O., kavukcuoglu, k.: Neural discrete representation learning. In: NeurIPS. p. 6306-6315 (2017) 3, 4 +27. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. CoRR:2304.07193 (2023) 6, 9 +28. Pan, X., Qin, P., Li, Y., Xue, H., Chen, W.: Synthesizing coherent story with auto-regressive latent diffusion models (2022) 1 +29. Pan, X., Tewari, A., Leimkuhler, T., Liu, L., Meka, A., Theobalt, C.: Drag your gan: Interactive point-based manipulation on the generative image manifold. In: SIGGRAPH. pp. 1-11 (2023) 4 +30. Peng, X., Zhu, J., Jiang, B., Tai, Y., Luo, D., Zhang, J., Lin, W., Jin, T., Wang, C., Ji, R.: Portrait booth: A versatile portrait model for fast identity-preserved personalization. In: CVPR. pp. 27080-27090 (2024) 1 +31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021) 3, 4, 6, 9 +32. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: ICML (2021) 3 +33. Roich, D., Mokady, R., Bermano, A.H., Cohen-Or, D.: Pivotal tuning for latent-based editing of real images. ACM TOG (2021) 4 +34. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022) 1, 3, 4, 9 +35. Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychological review 65(6), 386 (1958) 7 +36. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: CVPR. pp. 22500-22510 (2023) 1, 2, 4, 5, 6, 7, 9, 12 +37. Ruiz, N., Li, Y., Jampani, V., Wei, W., Hou, T., Pritch, Y., Wadhwa, N., Rubinstein, M., Aberman, K.: Hyperdreambooth: Hypernetworks for fast personalization of text-to-image models. In: CVPR. pp. 6527-6536 (2024) 2, 4, 10, 11 +38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, S.K.S., Lopes, R.G., Ayan, B.K., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022) 3 + +39. Shen, Y., Gu, J., Tang, X., Zhou, B.: Interpreting the latent space of gans for semantic face editing. In: CVPR (2020) 2, 4 +40. Shen, Y., Yang, C., Tang, X., Zhou, B.: Interfacegan: Interpreting the disentangled face representation learned by gans. TPAMI (2020) 2, 4 +41. Tewel, Y., Gal, R., Chechik, G., Atzmon, Y.: Key-locked rank one editing for text-to-image personalization. SIGGRAPH (2023) 2, 4 +42. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023) 3 +43. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Ferrer, C.C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura, P.S., Lachaux, M.A., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models (2023) 3 +44. Tov, O., Alaluf, Y., Nitzan, Y., Patashnik, O., Cohen-Or, D.: Designing an encoder for stylegan image manipulation. CoRR:2102.02766 (2021) 2, 4 +45. Voetman, R., Aghaei, M., Dijkstra, K.: The big data myth: Using diffusion models for dataset generation to train deep detection models (2023) 1 +46. Wang, Q., Bai, X., Wang, H., Qin, Z., Chen, A.: Instantid: Zero-shot identity-preserving generation in seconds. CoRR preprint CoRR:2401.07519 (2024) 1 +47. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: ICCV. pp. 15943-15953 (2023) 2, 4, 9, 12, 13 +48. Xiao, G., Yin, T., Freeman, W.T., Durand, F., Han, S.: Fastcomposer: Tuning-free multi-subject image generation with localized attention. CoRR:2305.10431 (2023) 2, 7, 9, 11, 12, 13 +49. Zhang, Q., Wang, C., Wu, H., Xin, C., Phuong, T.V.: Gelu-net: A globally encrypted, locally unencrypted deep neural network for privacy-preserved learning. In: IJCAI. pp. 3933-3939 (2018) 7 +50. Zhou, Y., Zhang, R., Sun, T., Xu, J.: Enhancing detail preservation for customized text-to-image generation: A regularization-free approach. CoRR:2305.13579 (2023) 8 +51. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: ICCV (2017) 3 \ No newline at end of file diff --git a/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/images.zip b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..ae0a70f879dfafaea181db19b7863f7035cadb61 --- /dev/null +++ b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a0e846f11a81ac269520f43ee26caff86ae0ba8175dfc0e8e6441b4d8f7f15fa +size 773361 diff --git a/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/layout.json b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..96583169c3c35881c67c1cbab88334533cacc9f8 --- /dev/null +++ b/2024/HybridBooth_ Hybrid Prompt Inversion for Efficient Subject-Driven Generation/layout.json @@ -0,0 +1,11063 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 156, + 111, + 459, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 111, + 459, + 148 + ], + "spans": [ + { + "bbox": [ + 156, + 111, + 459, + 148 + ], + "type": "text", + "content": "HybridBooth: Hybrid Prompt Inversion for Efficient Subject-Driven Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "spans": [ + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "text", + "content": "Shanyan Guan" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "inline_equation", + "content": "^{1\\star}" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "text", + "content": ", Yanhao Ge" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "inline_equation", + "content": "^{1,3\\star}" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "text", + "content": ", Ying Tai" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "inline_equation", + "content": "^{2\\boxtimes}" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "text", + "content": ", Jian Yang" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "text", + "content": " Wei Li" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "text", + "content": ", and Mingyu You" + }, + { + "bbox": [ + 168, + 167, + 444, + 194 + ], + "type": "inline_equation", + "content": "^{3\\star\\star\\boxtimes}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 226, + 201, + 386, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 226, + 201, + 386, + 213 + ], + "spans": [ + { + "bbox": [ + 226, + 201, + 386, + 213 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 226, + 201, + 386, + 213 + ], + "type": "text", + "content": " vivo Mobile Communication Co., Ltd" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 169, + 213, + 443, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 169, + 213, + 443, + 224 + ], + "spans": [ + { + "bbox": [ + 169, + 213, + 443, + 224 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 169, + 213, + 443, + 224 + ], + "type": "text", + "content": " School of Intelligence Science and Technology, Nanjing University" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 224, + 478, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 224, + 478, + 246 + ], + "spans": [ + { + "bbox": [ + 133, + 224, + 478, + 246 + ], + "type": "text", + "content": "3 College of Electronic and Information Engineering, Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 136, + 247, + 477, + 269 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 247, + 477, + 269 + ], + "spans": [ + { + "bbox": [ + 136, + 247, + 477, + 269 + ], + "type": "text", + "content": "{guanshanyan, halege}@vivo.com yingtai@nju.edu.cn myyou@tongji.edu.cn https://sites.google.com/view/hybridbooth" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 297, + 453, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 297, + 453, + 429 + ], + "spans": [ + { + "bbox": [ + 159, + 297, + 453, + 429 + ], + "type": "text", + "content": "Abstract. Recent advancements in text-to-image diffusion models have shown remarkable creative capabilities with textual prompts, but generating personalized instances based on specific subjects, known as subject-driven generation, remains challenging. To tackle this issue, we present a new hybrid framework called HybridBooth, which merges the benefits of optimization-based and direct-regression methods. HybridBooth operates in two stages: the Word Embedding Probe, which generates a robust initial word embedding using a fine-tuned encoder, and the Word Embedding Refinement, which further adapts the encoder to specific subject images by optimizing key parameters. This approach allows for effective and fast inversion of visual concepts into textual embedding, even from a single image, while maintaining the model's generalization capabilities." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 160, + 438, + 453, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 438, + 453, + 449 + ], + "spans": [ + { + "bbox": [ + 160, + 438, + 453, + 449 + ], + "type": "text", + "content": "Keywords: Customized Generation " + }, + { + "bbox": [ + 160, + 438, + 453, + 449 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 438, + 453, + 449 + ], + "type": "text", + "content": " Image Inversion " + }, + { + "bbox": [ + 160, + 438, + 453, + 449 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 438, + 453, + 449 + ], + "type": "text", + "content": " Image synthesis" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 470, + 230, + 482 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 470, + 230, + 482 + ], + "spans": [ + { + "bbox": [ + 132, + 470, + 230, + 482 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 494, + 482, + 566 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 494, + 482, + 566 + ], + "spans": [ + { + "bbox": [ + 130, + 494, + 482, + 566 + ], + "type": "text", + "content": "Recent advancements in text-to-image diffusion models [25, 34] have demonstrated unprecedented creating capabilities guided by textual prompts, such as creative endeavors in visual arts [28], synthetic dataset build-up [45], and image editing for marketing and advertising [24]. However, creating personalized instantiations based on specific subjects remains a challenging problem, also known as subject-driven generation [9,10,30,36,46]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 567, + 482, + 615 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 567, + 482, + 615 + ], + "spans": [ + { + "bbox": [ + 130, + 567, + 482, + 615 + ], + "type": "text", + "content": "To achieve subject-driven generation, recent works [9, 10, 36] explore the inversion of subject images into specific textual embeddings, either through iterative optimization (optimization-based) or direct regression methods. These two paradigms are summarized in Fig. 2. Optimization-based methods, such as" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 132, + 620, + 449, + 632 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 620, + 449, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 620, + 449, + 632 + ], + "type": "text", + "content": "* Equal contributions. Ying Tai and Mingyu You are corresponding authors." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "\\*\\* Mingyu You is also affiliated with State Key Laboratory of Intelligent Autonomous Systems, Frontiers Science Center for Intelligent Autonomous Systems, Shanghai Key Laboratory of Intelligent Autonomous Systems" + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 153, + 136, + 204, + 168 + ], + "blocks": [ + { + "bbox": [ + 153, + 136, + 204, + 168 + ], + "lines": [ + { + "bbox": [ + 153, + 136, + 204, + 168 + ], + "spans": [ + { + "bbox": [ + 153, + 136, + 204, + 168 + ], + "type": "image", + "image_path": "7a8a5514cf0765683bc565a978045a0bad2a2b743bd866d5cfc5613c049c54d9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 154, + 186, + 203, + 235 + ], + "blocks": [ + { + "bbox": [ + 165, + 178, + 195, + 185 + ], + "lines": [ + { + "bbox": [ + 165, + 178, + 195, + 185 + ], + "spans": [ + { + "bbox": [ + 165, + 178, + 195, + 185 + ], + "type": "text", + "content": "Input Image" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 154, + 186, + 203, + 235 + ], + "lines": [ + { + "bbox": [ + 154, + 186, + 203, + 235 + ], + "spans": [ + { + "bbox": [ + 154, + 186, + 203, + 235 + ], + "type": "image", + "image_path": "8780147643ef99d3eca980681de55126c2b8aac31fa9a605ffc7a122ac667302.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 205, + 115, + 460, + 185 + ], + "blocks": [ + { + "bbox": [ + 205, + 115, + 460, + 185 + ], + "lines": [ + { + "bbox": [ + 205, + 115, + 460, + 185 + ], + "spans": [ + { + "bbox": [ + 205, + 115, + 460, + 185 + ], + "type": "image", + "image_path": "cabd0c67d91a6d2be0e8c26d894f55a5ef42493f2b4e6a96468ce0455623054f.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 206, + 186, + 255, + 235 + ], + "blocks": [ + { + "bbox": [ + 165, + 239, + 195, + 246 + ], + "lines": [ + { + "bbox": [ + 165, + 239, + 195, + 246 + ], + "spans": [ + { + "bbox": [ + 165, + 239, + 195, + 246 + ], + "type": "text", + "content": "InputImage" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 206, + 186, + 255, + 235 + ], + "lines": [ + { + "bbox": [ + 206, + 186, + 255, + 235 + ], + "spans": [ + { + "bbox": [ + 206, + 186, + 255, + 235 + ], + "type": "image", + "image_path": "7714d85bbb1c3349d0c3a041595c80612d96abedd8bf6abeaa18e77500179b12.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 209, + 236, + 256, + 249 + ], + "lines": [ + { + "bbox": [ + 209, + 236, + 256, + 249 + ], + "spans": [ + { + "bbox": [ + 209, + 236, + 256, + 249 + ], + "type": "text", + "content": "HybridBooth (Ours) 3~5 steps" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 257, + 186, + 306, + 235 + ], + "blocks": [ + { + "bbox": [ + 257, + 186, + 306, + 235 + ], + "lines": [ + { + "bbox": [ + 257, + 186, + 306, + 235 + ], + "spans": [ + { + "bbox": [ + 257, + 186, + 306, + 235 + ], + "type": "image", + "image_path": "6313e6724bd5d8907850035fc2e9d4f97d209141c4a1b3a7b220847b1e9c482d.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 264, + 236, + 304, + 250 + ], + "lines": [ + { + "bbox": [ + 264, + 236, + 304, + 250 + ], + "spans": [ + { + "bbox": [ + 264, + 236, + 304, + 250 + ], + "type": "text", + "content": "Custom Diffusion 200 * steps" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 261, + 482, + 317 + ], + "lines": [ + { + "bbox": [ + 131, + 261, + 482, + 317 + ], + "spans": [ + { + "bbox": [ + 131, + 261, + 482, + 317 + ], + "type": "text", + "content": "Fig.1: We propose HybridBooth for efficient subject-driven generation. Unlike FastComposer [48], which targets humans, it cannot affect the Bronze Mask (Top). Compared to optimization-based [19,36] and direct-regression-based methods [47,48], our framework generates diverse, precise images while preserving the subject's identity, requiring only " + }, + { + "bbox": [ + 131, + 261, + 482, + 317 + ], + "type": "inline_equation", + "content": "3 \\sim 5" + }, + { + "bbox": [ + 131, + 261, + 482, + 317 + ], + "type": "text", + "content": " optimization iterations." + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 306, + 186, + 356, + 235 + ], + "blocks": [ + { + "bbox": [ + 306, + 186, + 356, + 235 + ], + "lines": [ + { + "bbox": [ + 306, + 186, + 356, + 235 + ], + "spans": [ + { + "bbox": [ + 306, + 186, + 356, + 235 + ], + "type": "image", + "image_path": "a66ea35773032713da35ab1773bbb685038952c30e00f7ea8143e93189ff2334.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 318, + 236, + 348, + 250 + ], + "lines": [ + { + "bbox": [ + 318, + 236, + 348, + 250 + ], + "spans": [ + { + "bbox": [ + 318, + 236, + 348, + 250 + ], + "type": "text", + "content": "DreamBooth 1000\\*steps" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 358, + 186, + 408, + 235 + ], + "blocks": [ + { + "bbox": [ + 358, + 186, + 408, + 235 + ], + "lines": [ + { + "bbox": [ + 358, + 186, + 408, + 235 + ], + "spans": [ + { + "bbox": [ + 358, + 186, + 408, + 235 + ], + "type": "image", + "image_path": "e2f560baedc35822cf5ab0b1addeda8711e651a551f611077f30988c67a76db8.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 368, + 236, + 403, + 250 + ], + "lines": [ + { + "bbox": [ + 368, + 236, + 403, + 250 + ], + "spans": [ + { + "bbox": [ + 368, + 236, + 403, + 250 + ], + "type": "text", + "content": "Fast Composer " + }, + { + "bbox": [ + 368, + 236, + 403, + 250 + ], + "type": "inline_equation", + "content": "1^{*}" + }, + { + "bbox": [ + 368, + 236, + 403, + 250 + ], + "type": "text", + "content": " step" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 410, + 186, + 459, + 235 + ], + "blocks": [ + { + "bbox": [ + 410, + 186, + 459, + 235 + ], + "lines": [ + { + "bbox": [ + 410, + 186, + 459, + 235 + ], + "spans": [ + { + "bbox": [ + 410, + 186, + 459, + 235 + ], + "type": "image", + "image_path": "a4b45c60d5ccc3f459f3b4a4a33dd981a48db52c99c603872ffc795b80fa1405.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 426, + 236, + 445, + 250 + ], + "lines": [ + { + "bbox": [ + 426, + 236, + 445, + 250 + ], + "spans": [ + { + "bbox": [ + 426, + 236, + 445, + 250 + ], + "type": "text", + "content": "ELITE " + }, + { + "bbox": [ + 426, + 236, + 445, + 250 + ], + "type": "inline_equation", + "content": "I^{*}" + }, + { + "bbox": [ + 426, + 236, + 445, + 250 + ], + "type": "text", + "content": " step" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 349, + 482, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 482, + 468 + ], + "type": "text", + "content": "Textual Inversion and DreamBooth [9, 37], iteratively optimize the generation model or textual embedding of the subject to better align with given subject images. Constrained by tens of subject images, optimization-based methods can accurately capture the identifying characteristics of the subject. However, the optimization procedure is computationally expensive and slow to converge. In comparison, direct-regression-based methods [1-3,7,10,39-41,44,47] achieve textual concept inversion by tuning a pre-trained model with labeled datasets or concept-specific images. While these methods enable zero-shot subject-driven generation, they suffer from detail loss and adaptation issues when combining the target subject with new styles or prompts." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 468, + 482, + 611 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 611 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 611 + ], + "type": "text", + "content": "In this paper, we introduce a novel framework called HybridBooth, designed for efficient subject-driven generation using text-to-image diffusion models. The core idea is to synergistically combine the strengths of various methods, creating a hybrid approach that balances quality and speed. As shown in Fig. 2, HybridBooth operates in two stages. The first stage, termed Word Embedding Probe, employs an encoder to generate a robust initial word embedding. This encoder is fine-tuned on a large-scale dataset such as FFHQ [14] with 70,000 images. In the second stage, the domain-agnostic encoder undergoes further finetuning to adapt to a specific subject's image in a word embedding refinement process. This stage focuses on optimizing the most influential parameters of the regressor. These two stages work collaboratively, enhancing each other to achieve precise and efficient subject-driven generation." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 146, + 612, + 382, + 623 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 612, + 382, + 623 + ], + "spans": [ + { + "bbox": [ + 146, + 612, + 382, + 623 + ], + "type": "text", + "content": "Overall, our contributions are summarized as follows:" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 137, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 137, + 629, + 482, + 666 + ], + "type": "text", + "content": "- Combining strengths of both optimization-based and direct-regression-based paradigms, we propose HybridBooth for precise and efficient subject-driven generation in less than 5 iteration steps." + } + ] + } + ], + "index": 21 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 161, + 123, + 303, + 187 + ], + "blocks": [ + { + "bbox": [ + 161, + 123, + 303, + 187 + ], + "lines": [ + { + "bbox": [ + 161, + 123, + 303, + 187 + ], + "spans": [ + { + "bbox": [ + 161, + 123, + 303, + 187 + ], + "type": "image", + "image_path": "21a6c09eb3d5e647d1f5f8e6c6b83e7419883a58364950bdd682271813f03616.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 344, + 482, + 388 + ], + "lines": [ + { + "bbox": [ + 130, + 344, + 482, + 388 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 482, + 388 + ], + "type": "text", + "content": "Fig. 2: Comparing with previous frameworks, our method leverages a coarse-to-fine strategy, effectively integrating the advantages of both optimization- and regression-based methods. Consequently, we enable a fast prompt inversion with high-fidelity generation from just a single image." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 161, + 189, + 301, + 252 + ], + "blocks": [ + { + "bbox": [ + 161, + 189, + 301, + 252 + ], + "lines": [ + { + "bbox": [ + 161, + 189, + 301, + 252 + ], + "spans": [ + { + "bbox": [ + 161, + 189, + 301, + 252 + ], + "type": "image", + "image_path": "f997ece0278d0771463b37d284f4901ccb008e3517c63eef46c5f2790d497842.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 310, + 123, + 454, + 252 + ], + "blocks": [ + { + "bbox": [ + 310, + 123, + 454, + 252 + ], + "lines": [ + { + "bbox": [ + 310, + 123, + 454, + 252 + ], + "spans": [ + { + "bbox": [ + 310, + 123, + 454, + 252 + ], + "type": "image", + "image_path": "a4aa15340262ead98937e3a575b3f2adcc829b8b6aa14721c7bbba9239f6746f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 161, + 255, + 456, + 325 + ], + "blocks": [ + { + "bbox": [ + 161, + 255, + 456, + 325 + ], + "lines": [ + { + "bbox": [ + 161, + 255, + 456, + 325 + ], + "spans": [ + { + "bbox": [ + 161, + 255, + 456, + 325 + ], + "type": "table", + "html": "
MethodFast Prompt InversionHigh-Fidelity GenerationSubject Images Needed
1. Optimization-basedX✓Multiple
2. Direct-regression-based✓XSingle
3. HybridBooth (Ours)✓✓Single
", + "image_path": "5f3c0b07e719233230c7dffaaf38c7bb1663eb378c40b8249952f3ef1875ebc9.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 137, + 413, + 480, + 474 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 137, + 413, + 480, + 447 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 413, + 480, + 447 + ], + "spans": [ + { + "bbox": [ + 137, + 413, + 480, + 447 + ], + "type": "text", + "content": "- We craft a Regressor-based Word Embedding Probe module to ensure a robust feature initialization while maintaining a focus on general-oriented generation model." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 449, + 480, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 480, + 474 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 480, + 474 + ], + "type": "text", + "content": "- We introduce a residual refinement strategy to accelerate the fitting process while preventing the collapse of the prior learned during the probe stage." + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 495, + 237, + 508 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 495, + 237, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 495, + 237, + 508 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 523, + 291, + 534 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 523, + 291, + 534 + ], + "spans": [ + { + "bbox": [ + 131, + 523, + 291, + 534 + ], + "type": "text", + "content": "2.1 Text-to-image Generation" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": "Text-to-image generation focuses on creating visually accurate and contextually relevant images from textual descriptions. Early approaches, such as Generative Adversarial Networks (GANs) [11, 12, 15, 51], achieved high-quality synthetic images. However, these studies primarily emphasize image generation within specific domains, leading to limitations in extended applications. The progress of large language models [6,8,31,42,43] has enabled methods based on variational auto-encoders [17, 26] and diffusion models [32, 34, 38] to effectively map word sequences into latent space, guiding image generation from textual prompts. Our method leverages pre-trained text-to-image diffusion models to generate personalized visual content efficiently and effectively." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 294, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 294, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 294, + 128 + ], + "type": "text", + "content": "2.2 Subject-driven Generation" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 148, + 482, + 196 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 148, + 482, + 196 + ], + "spans": [ + { + "bbox": [ + 130, + 148, + 482, + 196 + ], + "type": "text", + "content": "Subject-driven generation is a type of controllable generation task that aims to generate instances of specific subjects in new contexts (e.g., styles, scenarios). Current approaches can be broadly categorized into two types: 1) optimization-based and 2) direct-regression-based methods." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 207, + 482, + 352 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 207, + 482, + 352 + ], + "spans": [ + { + "bbox": [ + 130, + 207, + 482, + 352 + ], + "type": "text", + "content": "Optimization-based Methods iteratively refine images to align with given textual descriptions. Inversion is a common technique to preserve a subject while modifying its context. For GANs, Pivot Tuning [33] fine-tunes the model using an inverted latent code for robust, ID-preserving generation. Recent work [29] keeps GAN-generated subjects consistent and controllable. However, these methods often struggle with unique subjects and fail to preserve all details. In diffusion models, inversion aims to determine the initial noise that generates the target image through denoising. Methods like DreamBooth and Textual Inversion [9, 19, 36, 37] personalize pre-trained models to generate specific subjects in various contexts but are computationally intensive and slow to converge. Our method uses a hybrid framework for robust initial feature encoding, followed by rapid optimization, achieving superior efficiency." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 363, + 483, + 507 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 363, + 483, + 507 + ], + "spans": [ + { + "bbox": [ + 130, + 363, + 483, + 507 + ], + "type": "text", + "content": "Direct-regression-based Methods generate subject-specific images directly from textual prompts without iterative optimization, relying on extensive model modifications on large datasets. These methods generate images from scratch based on learned text-visual correlations. Previous GAN-based methods [1, 7, 39, 40, 44] retrain generators or add conditioned constraints for ID-preserving generation but are limited by their training sets. Recent diffusion-based methods [2, 3, 10, 41, 47] tune only the encoder of pre-trained models, offering efficiency but risking overfitting and reduced performance on diverse tasks. To address these limitations, HybridBooth initially refines the encoder and employs a subject-driven residual refinement module. This process requires only 3 to 5 steps, resulting in more detailed and robust images compared to other direct-regression-based methods." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 525, + 234, + 537 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 234, + 537 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 234, + 537 + ], + "type": "text", + "content": "3 Preliminaries" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 550, + 359, + 562 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 550, + 359, + 562 + ], + "spans": [ + { + "bbox": [ + 132, + 550, + 359, + 562 + ], + "type": "text", + "content": "3.1 Text-to-Image Latent Diffusion Models" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": "We implemented our method based on text-to-image Latent Diffusion Models (LDMs) [34] which can understand prompts and generate vivid images. LDMs mainly consist of three components, including a variational auto-encoder (VAE) [26], an UNet, and a CLIP text encoder [31]. The VAE encoder " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": " compresses " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{x}" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": " into a low-dimensional latent code " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "z = \\mathcal{E}(\\pmb{x})" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": ", and the decoder " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": " maps the latent code " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{z}" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": " back to image space " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{x}} = \\mathcal{D}(\\pmb{z})" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": ". For the text-guided diffusion process, the latent code " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{z}" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": " is perturbed by Gaussian noise " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": ". Then the UNet " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_{\\theta}" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": " learns to predict the applied noise " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{z}_t" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": " with a specified time step " + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 569, + 482, + 667 + ], + "type": "text", + "content": ". The denoising" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 90, + 381, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 90, + 381, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 90, + 381, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 115, + 479, + 182 + ], + "blocks": [ + { + "bbox": [ + 135, + 115, + 479, + 182 + ], + "lines": [ + { + "bbox": [ + 135, + 115, + 479, + 182 + ], + "spans": [ + { + "bbox": [ + 135, + 115, + 479, + 182 + ], + "type": "image", + "image_path": "0d44240b1b720294e4720973c6e443c8e71f63707e3a9f610dc380b6f159ec80.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 194, + 479, + 217 + ], + "lines": [ + { + "bbox": [ + 132, + 194, + 479, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 479, + 217 + ], + "type": "text", + "content": "Fig. 3: Showcasing our prompt inversion framework incorporating various conditions (depth, canny, keypoints) and community models1." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "text", + "content": "process is conditioned on the text feature " + }, + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "inline_equation", + "content": "\\pmb{c}" + }, + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "text", + "content": " extracted from text prompts " + }, + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "inline_equation", + "content": "\\pmb{y}" + }, + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "text", + "content": " by using text encoder " + }, + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "inline_equation", + "content": "\\tau_{\\pmb{\\theta}}" + }, + { + "bbox": [ + 131, + 239, + 479, + 262 + ], + "type": "text", + "content": ". The training loss is formulated as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 200, + 267, + 480, + 287 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 267, + 480, + 287 + ], + "spans": [ + { + "bbox": [ + 200, + 267, + 480, + 287 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\epsilon} = \\mathbb {E} _ {\\boldsymbol {z} \\sim \\mathcal {E} (\\boldsymbol {x}), \\epsilon \\sim \\mathcal {N} (0, 1), \\boldsymbol {c}, t} \\left[ \\left\\| \\boldsymbol {\\epsilon} - \\mathcal {M} _ {\\boldsymbol {\\theta}} \\left(\\boldsymbol {z} _ {t}, \\boldsymbol {c}, t\\right) \\right\\| _ {2} ^ {2} \\right]. \\tag {1}", + "image_path": "12cc9aa30fe837c896222d826a6caa9ba68045c8419616396d676cbcff77951e.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "spans": [ + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "text", + "content": "During inference, given a prompt " + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "inline_equation", + "content": "\\pmb{y}" + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "text", + "content": ", the model iteratively denoises " + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "inline_equation", + "content": "\\pmb{z}_t" + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "text", + "content": " conditioned on the text feature " + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "inline_equation", + "content": "\\pmb{c} = \\tau_{\\pmb{\\theta}}(\\pmb{y})" + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "text", + "content": ". Finally, " + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "inline_equation", + "content": "\\pmb{z}_0" + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "text", + "content": " is decoded to an image " + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{x}} = \\mathcal{D}(\\pmb{z}_0)" + }, + { + "bbox": [ + 131, + 293, + 479, + 317 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 332, + 406, + 344 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 332, + 406, + 344 + ], + "spans": [ + { + "bbox": [ + 132, + 332, + 406, + 344 + ], + "type": "text", + "content": "3.2 Prompt Inversion for Subject-Dirven Generation" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 350, + 479, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 350, + 479, + 422 + ], + "spans": [ + { + "bbox": [ + 131, + 350, + 479, + 422 + ], + "type": "text", + "content": "Despite the remarkable general generation capability of LDMs, challenges remain in generating specific subjects across various contexts, known as Subject-Driven Generation [9,36]. One feasible approach is to learn textual concepts from subject-specific images, referred to as Prompt Inversion [3,10,21]. Given several images " + }, + { + "bbox": [ + 131, + 350, + 479, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{X}" + }, + { + "bbox": [ + 131, + 350, + 479, + 422 + ], + "type": "text", + "content": " of a subject, the prompt inversion aims to inverse the visual content of the subject to the embedding of words " + }, + { + "bbox": [ + 131, + 350, + 479, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{e}" + }, + { + "bbox": [ + 131, + 350, + 479, + 422 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 280, + 428, + 480, + 441 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 428, + 480, + 441 + ], + "spans": [ + { + "bbox": [ + 280, + 428, + 480, + 441 + ], + "type": "interline_equation", + "content": "\\boldsymbol {e} \\leftarrow \\mathcal {I} (\\boldsymbol {X}), \\tag {2}", + "image_path": "403adf0f1bcc262b6e962343d21355bfc5d8bc35967c79370d03639fd9961cdd.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "spans": [ + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "inline_equation", + "content": "\\mathcal{I}" + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "content": " represents the inversion process. The primary goal of the inversion process is to ensure that " + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "inline_equation", + "content": "e\\in \\mathbb{R}^{n\\times d}" + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "content": " captures the key identifying characteristics of the subject. The word embedding " + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "inline_equation", + "content": "\\pmb{e}" + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "content": " is then encoded into textual features " + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "inline_equation", + "content": "\\pmb{c}" + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "content": " using a pre-trained text encoder (i.e., CLIP). Once " + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "inline_equation", + "content": "\\pmb{e}" + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "content": " is learned, it can be readily combined with arbitrary text for the creative generation of the subject. Specifically, let 'S*' be the text word corresponding to the learned embedding " + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "inline_equation", + "content": "\\pmb{e}" + }, + { + "bbox": [ + 131, + 447, + 480, + 543 + ], + "type": "text", + "content": ", we can combine 'S*' with new prompts to realize arbitrary subject-driven image synthesis, e.g. 'S* in snow forest'." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 552, + 479, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 552, + 479, + 647 + ], + "spans": [ + { + "bbox": [ + 131, + 552, + 479, + 647 + ], + "type": "text", + "content": "Discussion. Another paradigm involves mapping subject images to image tokens and using an additional cross-attention layer to inject these tokens into the diffusion process. This paradigm significantly alters the generation process of the original Latent Diffusion Models (LDMs), necessitating retraining on millions of images. In contrast, prompt inversion is a more resource-efficient method for subject-driven generation. As shown in Fig. 3, it can seamlessly integrate with various community foundational models and controllers pre-trained on the original stable diffusion, making it a versatile and practical alternative." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 471, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 471, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 471, + 666 + ], + "type": "text", + "content": "1 disneyPixarCartoon_v10: civitai.com/models/65203/disney-pixel-cartoon-type-a" + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 114, + 465, + 281 + ], + "blocks": [ + { + "bbox": [ + 151, + 114, + 465, + 281 + ], + "lines": [ + { + "bbox": [ + 151, + 114, + 465, + 281 + ], + "spans": [ + { + "bbox": [ + 151, + 114, + 465, + 281 + ], + "type": "image", + "image_path": "0572023978e62c53a3812efd3f2aee27c2a4f63fc53d5663827a5748c08513f0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 290, + 482, + 335 + ], + "lines": [ + { + "bbox": [ + 131, + 290, + 482, + 335 + ], + "spans": [ + { + "bbox": [ + 131, + 290, + 482, + 335 + ], + "type": "text", + "content": "Fig. 4: The framework of HybridBooth consists of two stages: (a) The first Probe Stage leverages a prompt regressor estimate the initial word embedding, acting as a probe for a rational word embedding; (b) The second Refinement Stage adapts the regressor to the subject by taking only 3-5 iterations to achieve efficient subject generation." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 356, + 375, + 370 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 356, + 375, + 370 + ], + "spans": [ + { + "bbox": [ + 132, + 356, + 375, + 370 + ], + "type": "text", + "content": "4 Hybrid Prompt Inversion Framework" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "type": "text", + "content": "Given just one image " + }, + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "type": "inline_equation", + "content": "\\pmb{x}" + }, + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "type": "text", + "content": " of a specific subject, we aim to efficiently embed the subject into the word embedding space. We combine the strengths of optimization and direct-regression-based paradigms to achieve precise and efficient subject-driven generation. Thus, we propose a hybrid prompt inversion framework, termed HybridBooth. As shown in Fig. 4, HybridBooth consists of two stages: (1) Word Embedding Probe Stage, which learns a domain-agnostic encoder providing an initial word embedding estimate. (2) Word Embedding Refinement Stage, which adapts the encoder to the given image of the subject. The key idea is: A powerful encoder reduces iterative refinement costs, while effective iterative refinement reduces the encoder's accuracy demands. Our challenge is to develop a robust encoder for initial embeddings and an effective refinement scheme to reduce the encoder's precision requirements. Next, we introduce the Word Embedding Probe stage in Sec. 4.1, describe the residual refinement stage in Sec. 4.2, and present the framework details in Sec. 4.3." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 563, + 369, + 577 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 563, + 369, + 577 + ], + "spans": [ + { + "bbox": [ + 132, + 563, + 369, + 577 + ], + "type": "text", + "content": "4.1 Regressor-based Word Embedding Probe" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 582, + 481, + 619 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 582, + 481, + 619 + ], + "spans": [ + { + "bbox": [ + 131, + 582, + 481, + 619 + ], + "type": "text", + "content": "First, HybridBooth trains a prompt regressor that takes an image of a subject as input and estimates the initial word embedding. This involves extracting multi-grained image features and conducting multiple-word regression." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 629, + 481, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 629, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 131, + 629, + 481, + 667 + ], + "type": "text", + "content": "Multi-grained Image Feature Merging. Existing regressor-based methods exclusively utilize CLIP features " + }, + { + "bbox": [ + 131, + 629, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{f}_c" + }, + { + "bbox": [ + 131, + 629, + 481, + 667 + ], + "type": "text", + "content": ", which often contain global semantic information (e.g., subject's category) [13,31,36]. Hence, we incorporate DINOv2 [27]" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 144, + 118, + 471, + 184 + ], + "blocks": [ + { + "bbox": [ + 144, + 118, + 471, + 184 + ], + "lines": [ + { + "bbox": [ + 144, + 118, + 471, + 184 + ], + "spans": [ + { + "bbox": [ + 144, + 118, + 471, + 184 + ], + "type": "image", + "image_path": "1a1a77edb2c46ce41186e8b1c0da6cc118e675aa18df42c0acebf72140438d01.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 196, + 482, + 240 + ], + "lines": [ + { + "bbox": [ + 130, + 196, + 482, + 240 + ], + "spans": [ + { + "bbox": [ + 130, + 196, + 482, + 240 + ], + "type": "text", + "content": "Fig. 5: Impact of hyper-parameters in the residual refinement stage (on the Dream-Booth dataset [36]). Default parameters are marked with red circles. Custom Diffusion [19] serves as the reference. Prompt Fidelity and Subject Fidelity are CLIP-I and DINO-T, respectively (see Sec. 5.1)." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "text", + "content": "features " + }, + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "inline_equation", + "content": "\\pmb{f}_d" + }, + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "text", + "content": " as a supplement, offering detailed pixel-level information. Taking inspiration from previous practices [13,48], we employ a Multilayer Perceptron (MLP) to project DINOv2 features " + }, + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "inline_equation", + "content": "\\pmb{f}_d" + }, + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "text", + "content": ", then concatenate the output with CLIP feature " + }, + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "inline_equation", + "content": "\\pmb{f}_c" + }, + { + "bbox": [ + 130, + 261, + 479, + 320 + ], + "type": "text", + "content": ". Finally we align the feature dimension using a Linear layer [35]. The merging process is formulated as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 242, + 327, + 481, + 341 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 327, + 481, + 341 + ], + "spans": [ + { + "bbox": [ + 242, + 327, + 481, + 341 + ], + "type": "interline_equation", + "content": "\\boldsymbol {f} = \\operatorname {L i n e a r} \\left(\\left[ \\boldsymbol {f} _ {c}, \\operatorname {M L P} \\left(\\boldsymbol {f} _ {d}\\right) \\right]\\right), \\tag {3}", + "image_path": "5ca29d796e36d1290720f163c6c80746f94734e891491f9b60c13301109a03d6.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 346, + 479, + 382 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 346, + 479, + 382 + ], + "spans": [ + { + "bbox": [ + 130, + 346, + 479, + 382 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 346, + 479, + 382 + ], + "type": "inline_equation", + "content": "[\\cdot, \\cdot]" + }, + { + "bbox": [ + 130, + 346, + 479, + 382 + ], + "type": "text", + "content": " represents the concatenation operation, and the structure of MLP is LyaerNorm-Linear-GELU [49]-Linear. As verified in our experiments, this simple module yields significant improvements." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "text", + "content": "Multiple-word Regression. The merged feature " + }, + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "inline_equation", + "content": "\\pmb{f}" + }, + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "text", + "content": " is then mapped to word embeddings " + }, + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "inline_equation", + "content": "\\pmb{e}" + }, + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "text", + "content": ". Typically, a single word represents a specific concept, e.g. 'man' conveys the subject's category but may lack details like hairstyle. Thus, we suggest projecting the feature " + }, + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "inline_equation", + "content": "\\pmb{f}" + }, + { + "bbox": [ + 130, + 392, + 479, + 451 + ], + "type": "text", + "content": " to multiple-word embeddings to provide a more thorough description of the subject:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 282, + 458, + 481, + 471 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 282, + 458, + 481, + 471 + ], + "spans": [ + { + "bbox": [ + 282, + 458, + 481, + 471 + ], + "type": "interline_equation", + "content": "\\boldsymbol {e} = \\mathcal {R} (\\boldsymbol {f}), \\tag {4}", + "image_path": "278af4e833683507e1da20e769eeb08fcfddecb62449aa02642461f095fad678.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "inline_equation", + "content": "\\pmb{e} = \\{\\pmb{e}_i\\}_{i=1}^n" + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "text", + "content": " is the number of word embeddings " + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "inline_equation", + "content": "\\pmb{e}_i \\in \\mathbb{R}^d" + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 477, + 479, + 502 + ], + "type": "text", + "content": " is the dimension of word embedding." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 517, + 265, + 528 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 517, + 265, + 528 + ], + "spans": [ + { + "bbox": [ + 131, + 517, + 265, + 528 + ], + "type": "text", + "content": "4.2 Residual Refinement" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 534, + 479, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 479, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 479, + 605 + ], + "type": "text", + "content": "Although the regressor-based probe is fast, precise alignment between word embeddings and key subject features remains challenging without image feature feedback. Thus, our subsequent stage focuses on refinement, aiming to adapt the learned regressor to target subject for better alignment. Striking a balance is challenging due to the single image input, as it requires avoiding overfitting to a specific image while capturing essential subject characteristics effectively." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 606, + 479, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 479, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 479, + 641 + ], + "type": "text", + "content": "To tackle this issue, we enhance the learned regressor with a residual refinement strategy that adjusts only critical parameters " + }, + { + "bbox": [ + 130, + 606, + 479, + 641 + ], + "type": "inline_equation", + "content": "(\\boldsymbol{W}_{\\phi})" + }, + { + "bbox": [ + 130, + 606, + 479, + 641 + ], + "type": "text", + "content": " for faster adaptation while preserving the learned prior. The residual refinement is formulated as:" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 255, + 647, + 481, + 663 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 647, + 481, + 663 + ], + "spans": [ + { + "bbox": [ + 255, + 647, + 481, + 663 + ], + "type": "interline_equation", + "content": "\\boldsymbol {W} _ {\\phi} ^ {\\prime} = \\boldsymbol {W} _ {\\phi} + \\lambda \\Delta \\boldsymbol {W} _ {\\phi}, \\tag {5}", + "image_path": "5b3212b73d12a3de6e9cb76f6eab052185cfb37e74198288014fff087269de79.jpg" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 114, + 470, + 163 + ], + "blocks": [ + { + "bbox": [ + 141, + 114, + 470, + 163 + ], + "lines": [ + { + "bbox": [ + 141, + 114, + 470, + 163 + ], + "spans": [ + { + "bbox": [ + 141, + 114, + 470, + 163 + ], + "type": "image", + "image_path": "4e6b667778398e427a2a160dd7571de1566c659073cd7c842bab27f13b07633f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 175, + 480, + 209 + ], + "lines": [ + { + "bbox": [ + 130, + 175, + 480, + 209 + ], + "spans": [ + { + "bbox": [ + 130, + 175, + 480, + 209 + ], + "type": "text", + "content": "Fig. 6: Showcases of the cross-attention map for the subject word 'S*'. Applying mask regularization " + }, + { + "bbox": [ + 130, + 175, + 480, + 209 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_M" + }, + { + "bbox": [ + 130, + 175, + 480, + 209 + ], + "type": "text", + "content": " prevents attention leakage to irrelevant areas, even with other subjects present (highlighted in red boxes)." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "spans": [ + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "inline_equation", + "content": "\\Delta W_{\\phi}" + }, + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "text", + "content": " is the learned residual parameters and a hyperparameter " + }, + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "text", + "content": " is to control the scale of " + }, + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "inline_equation", + "content": "\\Delta W_{\\phi}" + }, + { + "bbox": [ + 130, + 233, + 480, + 269 + ], + "type": "text", + "content": ". With residual refinement, it only takes 3-5 iterations to achieve high-fidelity subject generation while preserving editability." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "spans": [ + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "text", + "content": "Discussing the overfitting problem. Overfitting is a common challenge in finetune-based methods, especially when tuning the prompt regressor on a single image. To mitigate this, we refine only partial parameters (see Eq. (5)). Intuitively understanding, " + }, + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "inline_equation", + "content": "W_{\\phi}" + }, + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "text", + "content": " acts as an anchor, preserving the learned prior and stabilizing updates. Zeroing out " + }, + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "inline_equation", + "content": "W_{\\phi}" + }, + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "text", + "content": " collapses its prior (see the last column in Fig. 10), and we need to adjust hyper-parameters more carefully. As shown in Fig. 5, by using residual refinement, " + }, + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 281, + 480, + 388 + ], + "type": "text", + "content": " and iteration steps can vary widely yet still yield good results. Fig. 7 and Fig. 9 demonstrate that HybridBoothcan generate novel subject images with diverse expressions, postures, styles, and scenarios." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 406, + 256, + 417 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 406, + 256, + 417 + ], + "spans": [ + { + "bbox": [ + 132, + 406, + 256, + 417 + ], + "type": "text", + "content": "4.3 Framework Details" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "text", + "content": "Prompt Regressor Design. Previous studies have used either an MLP or a UNet as the prompt regressor. HybridBooth is flexible and can integrate any network mapping image features " + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "inline_equation", + "content": "\\pmb{f}" + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "text", + "content": " to word embeddings " + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "inline_equation", + "content": "\\pmb{e}" + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "text", + "content": ". We employ the state-of-the-art regressor PromptNet [50], which uses a block structure similar to LDM and can be initialized with LDM pretrained on large-scale image datasets. In the refinement stage, we focus on refining the cross-attention layer parameters (key, query, and value matrices " + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_k" + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_q" + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "inline_equation", + "content": "\\mathbf{K}_v" + }, + { + "bbox": [ + 130, + 426, + 482, + 582 + ], + "type": "text", + "content": ") based on layer importance experiments. Fine-tuning the entire regressor with 100 images, we calculated importance scores for each layer based on the mean cosine distance of parameters before and after refinement: cross-attention (56.3), self-attention (43.9), and other layers (e.g. convolution) (12.4). The cross-attention layer had the highest importance. Similar experiments by Custom Diffusion [20] and E4T [10] focused on the denoising UNet within LDMs." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Training with Mask Regularization. The diffusion loss " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\epsilon}" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " (Eq. (1)) is commonly used for training the prompt regressor. However, as shown in Fig. 6 (Left), the cross-attention maps of the subject's word embedding often leak into the irrelevant background. To address this, we use the subject's mask to constrain the cross-attention maps of subject words, ensuring focus on the subject region. Let " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "A_{e_i} \\in \\mathbb{R}^{h \\times w}" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " be the attention map for " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "e_i" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "M \\in \\mathbb{R}^{H \\times W}" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " be the segmentation" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 129 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 129 + ], + "type": "text", + "content": "mask for the subject. We use a mask regularization loss to align " + }, + { + "bbox": [ + 132, + 116, + 481, + 129 + ], + "type": "inline_equation", + "content": "A_{e_i}" + }, + { + "bbox": [ + 132, + 116, + 481, + 129 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 132, + 116, + 481, + 129 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 132, + 116, + 481, + 129 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 187, + 147, + 481, + 178 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 147, + 481, + 178 + ], + "spans": [ + { + "bbox": [ + 187, + 147, + 481, + 178 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {M} = \\frac {1}{n} \\sum_ {i = 1} ^ {n} \\operatorname {m e a n} \\left(\\boldsymbol {A} _ {\\boldsymbol {e} _ {i}} \\cdot (\\boldsymbol {1} - \\boldsymbol {M})\\right) - \\operatorname {m e a n} \\left(\\boldsymbol {A} _ {\\boldsymbol {e} _ {i}} \\cdot \\boldsymbol {M}\\right), \\tag {6}", + "image_path": "b3412042a720485de6d466570558ce512935b1cd7f9fce2b007101e81185b6b9.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "spans": [ + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "text", + "content": " is the number of word embeddings. This loss minimizes attention outside the mask and maximizes it inside, ensuring focus on the subject. The interpolation of " + }, + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "text", + "content": " to match " + }, + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "inline_equation", + "content": "A_{e_i}" + }, + { + "bbox": [ + 131, + 186, + 480, + 233 + ], + "type": "text", + "content": " is omitted for simplicity. The final training objective of the regressor is:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 265, + 244, + 481, + 258 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 265, + 244, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 265, + 244, + 481, + 258 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {\\epsilon} + \\alpha_ {M} \\mathcal {L} _ {M}, \\tag {7}", + "image_path": "87e73129589c368e5e85ef905e964493e910ce96562271f2d18395df8edba952.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "spans": [ + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "inline_equation", + "content": "\\alpha_{M}" + }, + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "text", + "content": " is the weight of " + }, + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_M" + }, + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "text", + "content": ". During refinement, " + }, + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "inline_equation", + "content": "\\mathcal{L}" + }, + { + "bbox": [ + 131, + 266, + 480, + 291 + ], + "type": "text", + "content": " is used to prevent diverging update directions, focusing on fine-tuning the cross-attention parameters." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 308, + 230, + 323 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 230, + 323 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 230, + 323 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 334, + 266, + 346 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 334, + 266, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 334, + 266, + 346 + ], + "type": "text", + "content": "5.1 Experimental Setup" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 354, + 489, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 354, + 489, + 450 + ], + "spans": [ + { + "bbox": [ + 131, + 354, + 489, + 450 + ], + "type": "text", + "content": "Datasets. We mainly conduct experiments on facial images. Following prior research practices, we train HybridBooth on the aligned FFHQ dataset [14], comprising 70,000 in-the-wild facial images. Constrained by computational resources, we conducted testing on the first 1,000 images from the CelebA-HQ test split. In addition, we also evaluate HybridBooth on other categories to demonstrate its versatility. With the same setting of ELITE [47], we train HybridBooth on the test split of OpenImagesv6 [18], and test on the DreamBooth Dataset. All images are cropped and resized to " + }, + { + "bbox": [ + 131, + 354, + 489, + 450 + ], + "type": "inline_equation", + "content": "512 \\times 512" + }, + { + "bbox": [ + 131, + 354, + 489, + 450 + ], + "type": "text", + "content": " pixels." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "text", + "content": "Training Details. We use Stable Diffusion v1.5 [34] as our Text-to-Image model, initializing the prompt regressor with the UNet from Stable Diffusion. The DINOv2-Large model [27] extracts the DINO feature, and the vision model of clip-vit-large-patch14 [31] extracts the CLIP image feature. The segmentation mask " + }, + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "text", + "content": " (Eq. (6)) is obtained using InSPyReNet [16]. We use the same hyperparameters for both facial and non-facial experiments. For the word embedding probe stage, we use the AdamW optimizer [23] with a learning rate of 2e-5 and a batch size of 8. Training on a single Nvidia A100 GPU takes 40 hours. In the refinement stage, we fine-tune the cross-attention parameters of the regressor for 5 steps using AdamW, with a learning rate of 2e-5 and a weight decay of 1e-2. Parameters " + }, + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "inline_equation", + "content": "\\alpha_{M}" + }, + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "text", + "content": " (Eq. (7)) and " + }, + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 131, + 461, + 482, + 594 + ], + "type": "text", + "content": " (Eq. (5)) are set to 1e-3 and 1e-2, respectively." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": "Baselines. We compare the proposed HybridBooth with two categories of methods: (1) Optimization-based methods: DreamBooth [36], Textual Inversion [9], and Custom Diffusion [19]. (2) Direct-regression-based methods: ELITE [47] and FastComposer [48]. Optimization-based methods typically require " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "3 \\sim 5" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": " images as input, which are not available in CelebA-HQ (our test set). To ensure a fair" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 125, + 462, + 170 + ], + "blocks": [ + { + "bbox": [ + 267, + 118, + 372, + 125 + ], + "lines": [ + { + "bbox": [ + 267, + 118, + 372, + 125 + ], + "spans": [ + { + "bbox": [ + 267, + 118, + 372, + 125 + ], + "type": "text", + "content": "watercolor painting of a " + }, + { + "bbox": [ + 267, + 118, + 372, + 125 + ], + "type": "inline_equation", + "content": "S^{*}" + }, + { + "bbox": [ + 267, + 118, + 372, + 125 + ], + "type": "text", + "content": " in the snow" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 149, + 125, + 462, + 170 + ], + "lines": [ + { + "bbox": [ + 149, + 125, + 462, + 170 + ], + "spans": [ + { + "bbox": [ + 149, + 125, + 462, + 170 + ], + "type": "image", + "image_path": "5e75fd43dddcfd1645f356ef40263f3ee8c047a6470bd3adb553e15f48717a4b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 150, + 180, + 462, + 224 + ], + "blocks": [ + { + "bbox": [ + 283, + 171, + 343, + 179 + ], + "lines": [ + { + "bbox": [ + 283, + 171, + 343, + 179 + ], + "spans": [ + { + "bbox": [ + 283, + 171, + 343, + 179 + ], + "type": "text", + "content": "A red S\\* in Pixar style" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 150, + 180, + 462, + 224 + ], + "lines": [ + { + "bbox": [ + 150, + 180, + 462, + 224 + ], + "spans": [ + { + "bbox": [ + 150, + 180, + 462, + 224 + ], + "type": "image", + "image_path": "9265b7d65d582fd14bb13756fc28f7ee179417b4f62ea6b1f5396de1be0b827a.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 150, + 235, + 462, + 278 + ], + "blocks": [ + { + "bbox": [ + 257, + 225, + 365, + 235 + ], + "lines": [ + { + "bbox": [ + 257, + 225, + 365, + 235 + ], + "spans": [ + { + "bbox": [ + 257, + 225, + 365, + 235 + ], + "type": "text", + "content": "Pointillism painting of a " + }, + { + "bbox": [ + 257, + 225, + 365, + 235 + ], + "type": "inline_equation", + "content": "S^{*}" + }, + { + "bbox": [ + 257, + 225, + 365, + 235 + ], + "type": "text", + "content": " with night sky" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 150, + 235, + 462, + 278 + ], + "lines": [ + { + "bbox": [ + 150, + 235, + 462, + 278 + ], + "spans": [ + { + "bbox": [ + 150, + 235, + 462, + 278 + ], + "type": "image", + "image_path": "fa1fa9ea23bb515045d45cd7345838e7dada8d40d0391c13336e8c26904b25fd.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 145, + 296, + 481, + 318 + ], + "lines": [ + { + "bbox": [ + 145, + 296, + 481, + 318 + ], + "spans": [ + { + "bbox": [ + 145, + 296, + 481, + 318 + ], + "type": "text", + "content": "Fig. 7: Qualitative Comparison Results on CelebA-HQ (facial dataset). Columns 2-4: Optimization-based methods. Columns 5-6: Direct-regression-based methods." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 342, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 342, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 342, + 482, + 437 + ], + "type": "text", + "content": "comparison, we augment each image to generate 5 images for these methods using affine transformations and background changes. More details on the augmentation process are provided in the Supplementary. To clarify the difference between HybridBooth and HyperDreamBooth [37], HyperDreamBooth updates weights in a low-rank space for rapid model tuning but overlooks the importance of training a powerful encoder initially. Since the official code for HyperDream-Booth was unavailable during our submission, we could only make qualitative comparisons with examples from their paper (see Fig. 8)." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 448, + 469, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 448, + 469, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 448, + 469, + 460 + ], + "type": "text", + "content": "Evaluation Metrics. We evaluate the model's performance in two aspects:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 137, + 467, + 482, + 514 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 467, + 482, + 514 + ], + "spans": [ + { + "bbox": [ + 137, + 467, + 482, + 514 + ], + "type": "text", + "content": "- Prompt Fidelity: This measures how well the generated images match the textual prompt, quantified by the average cosine similarity of CLIP embeddings between the prompt and the generated images (CLIP-T). Higher CLIP-T indicates better textual editability." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 137, + 514, + 482, + 563 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 514, + 482, + 563 + ], + "spans": [ + { + "bbox": [ + 137, + 514, + 482, + 563 + ], + "type": "text", + "content": "- Subject Fidelity: This assesses the preservation of subject details during generation. We use CLIP-I and DINO-I metrics, which are the cosine similarities between the embeddings of the generated images and the original concept images. Higher values indicate better subject fidelity." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 586, + 280, + 598 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 586, + 280, + 598 + ], + "spans": [ + { + "bbox": [ + 132, + 586, + 280, + 598 + ], + "type": "text", + "content": "5.2 Qualitative Comparison" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "In Fig. 7, we present qualitative comparison results. Similar to previous works, 'S*' denotes the word embedding learned from the input subject image. For a fair comparison, optimization-based methods use 5 images for optimization. Our setting is more complex, specifying both artistic style (e.g., 'watercolor painting') and environmental characteristics (e.g., 'in the snow'). From the results, two key" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 118, + 465, + 186 + ], + "blocks": [ + { + "bbox": [ + 149, + 118, + 465, + 186 + ], + "lines": [ + { + "bbox": [ + 149, + 118, + 465, + 186 + ], + "spans": [ + { + "bbox": [ + 149, + 118, + 465, + 186 + ], + "type": "image", + "image_path": "ad8bd36f8f997f81ccd433b602bee0c229fc1b0452d113000afdb14a8674c988.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 182, + 198, + 430, + 210 + ], + "lines": [ + { + "bbox": [ + 182, + 198, + 430, + 210 + ], + "spans": [ + { + "bbox": [ + 182, + 198, + 430, + 210 + ], + "type": "text", + "content": "Fig. 8: Qualitative Comparison with Hyperdreambooth [37]." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 150, + 239, + 465, + 361 + ], + "blocks": [ + { + "bbox": [ + 225, + 228, + 394, + 239 + ], + "lines": [ + { + "bbox": [ + 225, + 228, + 394, + 239 + ], + "spans": [ + { + "bbox": [ + 225, + 228, + 394, + 239 + ], + "type": "text", + "content": "photo of sks dog on top of green grass with sunflowers" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 150, + 239, + 465, + 361 + ], + "lines": [ + { + "bbox": [ + 150, + 239, + 465, + 361 + ], + "spans": [ + { + "bbox": [ + 150, + 239, + 465, + 361 + ], + "type": "image", + "image_path": "7a45b71bd115fed1b47c38d62ffd6e0308897e02fbb3c3741281c2f64771769c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 181, + 373, + 430, + 384 + ], + "lines": [ + { + "bbox": [ + 181, + 373, + 430, + 384 + ], + "spans": [ + { + "bbox": [ + 181, + 373, + 430, + 384 + ], + "type": "text", + "content": "Fig. 9: Qualitative Comparison Results on non-facial images." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 411, + 482, + 507 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 507 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 507 + ], + "type": "text", + "content": "observations emerge: (1) Optimization-based methods (Columns 2-4), using multiple image inputs and finely tuned hyper-parameters (e.g., total iteration steps), generally outperform direct-regression-based methods (Columns 5-6) in prompt alignment and subject similarity. (2) Our proposed HybridBooth outperforms all compared methods in text alignment and subject similarity. For example, in the third row, other methods either fail in text similarity (e.g., FastComposer) or in preserving facial similarity, whereas HybridBooth successfully aligns the subject with the editing prompt, demonstrating its superiority." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 508, + 482, + 580 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 508, + 482, + 580 + ], + "spans": [ + { + "bbox": [ + 130, + 508, + 482, + 580 + ], + "type": "text", + "content": "Qualitative comparisons with HyperDreamBooth [37] are shown in Fig. 8. HyperDreamBooth trains a hyper-network to predict low-rank weights of the image diffusion model and fine-tunes these weights on one subject image. However, low-rank weight updates limit personalized representation, resulting in poorer subject feature preservation, as seen in Fig. 8. This supports our core idea that a more powerful encoder reduces the cost of iterative refinement." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "As shown in Fig. 9, we evaluate HybridBooth on non-facial images, including animals (Line 1) and complex buildings (Line 2). FastComposer [48] is excluded as it is designed for facial images. In Line 1, most methods preserve the texture of the subject well. However, in Line 2, only HybridBooth maintains the structural information while adhering to the complex prompt. This is due to the hybrid framework, which enables quick feature learning while retaining the prompt understanding capability of the Stable Diffusion model." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 142, + 157, + 470, + 294 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 1: Quantitative Evaluation on the CelebA-HQ. First Block: Optimization-based methods. Second Block: Direct-regression-based methods. Third Block: HybridBooth and its ablations." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 142, + 157, + 470, + 294 + ], + "lines": [ + { + "bbox": [ + 142, + 157, + 470, + 294 + ], + "spans": [ + { + "bbox": [ + 142, + 157, + 470, + 294 + ], + "type": "table", + "html": "
MethodCelebA-HQDreamBooth-datasetIter. Step↓
CLIP-T ↑CLIP-I ↑DINO-I ↑CLIP-T ↑CLIP-I ↑DINO-I ↑
Textual Inversion [9]0.1640.6120.2360.1830.6630.4625000
DreamBooth [36]0.2510.5640.3760.2510.7850.6741000
Custom Diffusion [19]0.2370.6750.3980.2450.8010.695200
ELITE [47]0.1690.5920.3110.2550.7620.6521
FastComposer [48]0.2010.7820.581---1
HybridBooth0.2460.8650.6440.2610.8650.7555
- w/o Refinement0.1770.8420.5680.1920.8350.645-
- w/o Probe0.1530.4080.0680.1420.4120.0505
- w/o DINO Feature0.1610.8370.4530.1840.8410.5965
- w/o CLIP Feature0.1820.7340.5100.2060.7520.6305
- w/o Mask Regularization0.2030.8310.6250.2330.8330.7055
", + "image_path": "6d77cd05e1d510a19b170e2bea3246c2c5f8497c1dfca9ab88c7c385a3451131.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 146, + 304, + 185, + 380 + ], + "blocks": [ + { + "bbox": [ + 146, + 304, + 185, + 380 + ], + "lines": [ + { + "bbox": [ + 146, + 304, + 185, + 380 + ], + "spans": [ + { + "bbox": [ + 146, + 304, + 185, + 380 + ], + "type": "image", + "image_path": "419d374bde625ea53aceac0a9aaed6fb11cef06e551d905cb846961739bee12e.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 153, + 380, + 178, + 386 + ], + "lines": [ + { + "bbox": [ + 153, + 380, + 178, + 386 + ], + "spans": [ + { + "bbox": [ + 153, + 380, + 178, + 386 + ], + "type": "text", + "content": "Input Image" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 398, + 482, + 431 + ], + "lines": [ + { + "bbox": [ + 130, + 398, + 482, + 431 + ], + "spans": [ + { + "bbox": [ + 130, + 398, + 482, + 431 + ], + "type": "text", + "content": "Fig. 10: We conducted ablations on HybridBooth to evaluate its influence on learning subject-specific word embeddings. DreamBooth and FastComposer are utilized here for comparison. 'A photo of " + }, + { + "bbox": [ + 130, + 398, + 482, + 431 + ], + "type": "inline_equation", + "content": "S^{*}" + }, + { + "bbox": [ + 130, + 398, + 482, + 431 + ], + "type": "text", + "content": "' is used for generating images." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 186, + 304, + 242, + 379 + ], + "blocks": [ + { + "bbox": [ + 186, + 304, + 242, + 379 + ], + "lines": [ + { + "bbox": [ + 186, + 304, + 242, + 379 + ], + "spans": [ + { + "bbox": [ + 186, + 304, + 242, + 379 + ], + "type": "image", + "image_path": "d34a1c353e99dda7abd2422148f91eb1e0d046596e0f94b0c1a64d389cb55613.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 201, + 380, + 228, + 386 + ], + "lines": [ + { + "bbox": [ + 201, + 380, + 228, + 386 + ], + "spans": [ + { + "bbox": [ + 201, + 380, + 228, + 386 + ], + "type": "text", + "content": "DreamBooth" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 243, + 304, + 298, + 379 + ], + "blocks": [ + { + "bbox": [ + 243, + 304, + 298, + 379 + ], + "lines": [ + { + "bbox": [ + 243, + 304, + 298, + 379 + ], + "spans": [ + { + "bbox": [ + 243, + 304, + 298, + 379 + ], + "type": "image", + "image_path": "695cf3c9aa9a2d70910413a2a8460ef1bb555b813af12946da63900afee7721b.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 253, + 380, + 285, + 386 + ], + "lines": [ + { + "bbox": [ + 253, + 380, + 285, + 386 + ], + "spans": [ + { + "bbox": [ + 253, + 380, + 285, + 386 + ], + "type": "text", + "content": "FastComposer" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 299, + 304, + 354, + 379 + ], + "blocks": [ + { + "bbox": [ + 299, + 304, + 354, + 379 + ], + "lines": [ + { + "bbox": [ + 299, + 304, + 354, + 379 + ], + "spans": [ + { + "bbox": [ + 299, + 304, + 354, + 379 + ], + "type": "image", + "image_path": "43802b9edac725a355244a1a101a1335bf164e8d9e5b69f868698dbb7f823034.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 307, + 380, + 347, + 386 + ], + "lines": [ + { + "bbox": [ + 307, + 380, + 347, + 386 + ], + "spans": [ + { + "bbox": [ + 307, + 380, + 347, + 386 + ], + "type": "text", + "content": "HybridBooth(Ours)" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 355, + 304, + 410, + 379 + ], + "blocks": [ + { + "bbox": [ + 355, + 304, + 410, + 379 + ], + "lines": [ + { + "bbox": [ + 355, + 304, + 410, + 379 + ], + "spans": [ + { + "bbox": [ + 355, + 304, + 410, + 379 + ], + "type": "image", + "image_path": "44f5d9f14102809852f169412df007c03ac0a9d7c10d0a7f841d5282a2db463a.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 364, + 380, + 399, + 386 + ], + "lines": [ + { + "bbox": [ + 364, + 380, + 399, + 386 + ], + "spans": [ + { + "bbox": [ + 364, + 380, + 399, + 386 + ], + "type": "text", + "content": "- w/o Refinement" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 410, + 304, + 467, + 379 + ], + "blocks": [ + { + "bbox": [ + 410, + 304, + 467, + 379 + ], + "lines": [ + { + "bbox": [ + 410, + 304, + 467, + 379 + ], + "spans": [ + { + "bbox": [ + 410, + 304, + 467, + 379 + ], + "type": "image", + "image_path": "e0f44a580c9e64245e057be11fdf892c408a2df9b4d31fcbc2601e31ed050eab.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 427, + 380, + 450, + 386 + ], + "lines": [ + { + "bbox": [ + 427, + 380, + 450, + 386 + ], + "spans": [ + { + "bbox": [ + 427, + 380, + 450, + 386 + ], + "type": "text", + "content": "- w/o Probe" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 456, + 289, + 468 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 456, + 289, + 468 + ], + "spans": [ + { + "bbox": [ + 131, + 456, + 289, + 468 + ], + "type": "text", + "content": "5.3 Quantitative Comparison" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 479, + 482, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 552 + ], + "type": "text", + "content": "The quantitative results in Tab. 1 include the necessary iteration steps for assessing time efficiency. Optimization-based methods generally outperform direct-regression-based methods but require more iteration steps. Our HybridBooth significantly exceeds other methods in both prompt fidelity and subject fidelity. Notably, our DINO-T metric is over " + }, + { + "bbox": [ + 130, + 479, + 482, + 552 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 479, + 482, + 552 + ], + "type": "text", + "content": " higher than FastComposer, a key metric in the DreamBooth framework [36]." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 131, + 571, + 251, + 583 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 571, + 251, + 583 + ], + "spans": [ + { + "bbox": [ + 131, + 571, + 251, + 583 + ], + "type": "text", + "content": "5.4 Ablation Analysis" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": "Ablations on the Hybrid Framework. We evaluate our hybrid framework, which includes a word embedding stage for initial estimation and a residual refinement stage for precise alignment. Ablations, termed 'w/o Probe' and 'w/o Refinement', are shown in Fig. 10 and Tab. 1. The prompt regressor is initialized using the pre-trained UNet from Stable Diffusion in both settings. We assess subject fidelity using the prompt 'A photo of " + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{S}^*" + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": " , comparing it with DreamBooth" + } + ] + } + ], + "index": 20 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 159, + 118, + 211, + 178 + ], + "blocks": [ + { + "bbox": [ + 159, + 118, + 211, + 178 + ], + "lines": [ + { + "bbox": [ + 159, + 118, + 211, + 178 + ], + "spans": [ + { + "bbox": [ + 159, + 118, + 211, + 178 + ], + "type": "image", + "image_path": "deb27036284d7cadc70138ced6933f673036d2a8dea34cc256926cb5865e5d8a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 213, + 126, + 267, + 178 + ], + "blocks": [ + { + "bbox": [ + 213, + 118, + 281, + 126 + ], + "lines": [ + { + "bbox": [ + 213, + 118, + 281, + 126 + ], + "spans": [ + { + "bbox": [ + 213, + 118, + 281, + 126 + ], + "type": "text", + "content": "A " + }, + { + "bbox": [ + 213, + 118, + 281, + 126 + ], + "type": "inline_equation", + "content": "S^{*}" + }, + { + "bbox": [ + 213, + 118, + 281, + 126 + ], + "type": "text", + "content": " dog in the snow" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 213, + 126, + 267, + 178 + ], + "lines": [ + { + "bbox": [ + 213, + 126, + 267, + 178 + ], + "spans": [ + { + "bbox": [ + 213, + 126, + 267, + 178 + ], + "type": "image", + "image_path": "9803bde3157774622fbdc1c947a7ea7beafec7999277c9d5b29131b3269d718a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 268, + 126, + 293, + 178 + ], + "blocks": [ + { + "bbox": [ + 268, + 126, + 293, + 178 + ], + "lines": [ + { + "bbox": [ + 268, + 126, + 293, + 178 + ], + "spans": [ + { + "bbox": [ + 268, + 126, + 293, + 178 + ], + "type": "image", + "image_path": "c1bc3dca46b5740c473f87a6d704f676cbdcc9573cad28eded2ffc4fb4061b7b.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 293, + 118, + 373, + 125 + ], + "lines": [ + { + "bbox": [ + 293, + 118, + 373, + 125 + ], + "spans": [ + { + "bbox": [ + 293, + 118, + 373, + 125 + ], + "type": "text", + "content": "A S* devil surrounded by flames" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 293, + 126, + 375, + 178 + ], + "blocks": [ + { + "bbox": [ + 293, + 126, + 375, + 178 + ], + "lines": [ + { + "bbox": [ + 293, + 126, + 375, + 178 + ], + "spans": [ + { + "bbox": [ + 293, + 126, + 375, + 178 + ], + "type": "image", + "image_path": "594528f3f03d4a57376cbac4809ac12f68dfe639759eaab79acb4d93ee308264.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 375, + 118, + 455, + 125 + ], + "lines": [ + { + "bbox": [ + 375, + 118, + 455, + 125 + ], + "spans": [ + { + "bbox": [ + 375, + 118, + 455, + 125 + ], + "type": "text", + "content": "oil painting of a S\\* cat" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 375, + 126, + 455, + 178 + ], + "blocks": [ + { + "bbox": [ + 375, + 126, + 455, + 178 + ], + "lines": [ + { + "bbox": [ + 375, + 126, + 455, + 178 + ], + "spans": [ + { + "bbox": [ + 375, + 126, + 455, + 178 + ], + "type": "image", + "image_path": "3ce440721a4f0d7240989c73384989a16b2002991fc1359ebd513b8b399daa03.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 159, + 181, + 211, + 242 + ], + "blocks": [ + { + "bbox": [ + 159, + 181, + 211, + 242 + ], + "lines": [ + { + "bbox": [ + 159, + 181, + 211, + 242 + ], + "spans": [ + { + "bbox": [ + 159, + 181, + 211, + 242 + ], + "type": "image", + "image_path": "4599e0af5ee904a764a808e92f95097c1ad41c223ba9c20b83e188e3527ece82.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 250, + 480, + 273 + ], + "lines": [ + { + "bbox": [ + 131, + 250, + 480, + 273 + ], + "spans": [ + { + "bbox": [ + 131, + 250, + 480, + 273 + ], + "type": "text", + "content": "Fig. 11: The learned words from human beings can be applied to cross-species subjects, which verifies that HybridBooth manages to learn intrinsic subject features." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 212, + 181, + 293, + 242 + ], + "blocks": [ + { + "bbox": [ + 212, + 181, + 293, + 242 + ], + "lines": [ + { + "bbox": [ + 212, + 181, + 293, + 242 + ], + "spans": [ + { + "bbox": [ + 212, + 181, + 293, + 242 + ], + "type": "image", + "image_path": "ca160794d2fc266f7eea9510b67edb93bb748b510170d5728c88730f249ce590.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 293, + 181, + 373, + 242 + ], + "blocks": [ + { + "bbox": [ + 293, + 181, + 373, + 242 + ], + "lines": [ + { + "bbox": [ + 293, + 181, + 373, + 242 + ], + "spans": [ + { + "bbox": [ + 293, + 181, + 373, + 242 + ], + "type": "image", + "image_path": "4b7f53d7e367a547517cfd93a1172da3e7c27a4f4c42b2b48f1c810387a5e973.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 375, + 181, + 455, + 242 + ], + "blocks": [ + { + "bbox": [ + 375, + 181, + 455, + 242 + ], + "lines": [ + { + "bbox": [ + 375, + 181, + 455, + 242 + ], + "spans": [ + { + "bbox": [ + 375, + 181, + 455, + 242 + ], + "type": "image", + "image_path": "2d4198638e6790d16344110c16bc9a964c1495d108dc2872695e15bfe5fb5786.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 179, + 285, + 436, + 350 + ], + "blocks": [ + { + "bbox": [ + 179, + 285, + 436, + 350 + ], + "lines": [ + { + "bbox": [ + 179, + 285, + 436, + 350 + ], + "spans": [ + { + "bbox": [ + 179, + 285, + 436, + 350 + ], + "type": "image", + "image_path": "6e5ee6343649ee1fa7c277e315d7455f9ebf3f186a246c072ba34505918ed848.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 148, + 361, + 463, + 373 + ], + "lines": [ + { + "bbox": [ + 148, + 361, + 463, + 373 + ], + "spans": [ + { + "bbox": [ + 148, + 361, + 463, + 373 + ], + "type": "text", + "content": "Fig. 12: Impact of increasing number of word embeddings (on CelebeA-HQ)." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 397, + 480, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 397, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 480, + 456 + ], + "type": "text", + "content": "and FastComposer. As shown in Fig. 10, subject embedding from residual refinement alone leads to lower subject similarity. Without refinement, word embedding only crudely captures key features. Our HybridBooth framework, integrating both probe and refinement stages, outperforms all ablations and compared methods, effectively restoring subject characteristics." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 470, + 480, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 470, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 470, + 480, + 567 + ], + "type": "text", + "content": "Ablations on Multi-grained Image Feature Merging. Previous works [47, 48] typically use CLIP features as input for the regressor. As discussed in Sec. 4.1, we use CLIP features for global semantic information and DINO features for detailed pixel-level information. We ablate the feature extraction strategy to verify this approach. As shown in Tab. 1, relying solely on DINO or CLIP features results in suboptimal performance. However, integrating both features significantly enhances performance. Notable improvements in prompt fidelity and subject fidelity are observed, even with just a single layer normalization and linear layer." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 579, + 480, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 579, + 480, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 579, + 480, + 628 + ], + "type": "text", + "content": "Analysis on the Mask Regularization Loss " + }, + { + "bbox": [ + 130, + 579, + 480, + 628 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_M" + }, + { + "bbox": [ + 130, + 579, + 480, + 628 + ], + "type": "text", + "content": ". We propose a mask regularization loss " + }, + { + "bbox": [ + 130, + 579, + 480, + 628 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_M" + }, + { + "bbox": [ + 130, + 579, + 480, + 628 + ], + "type": "text", + "content": " (Eq. (6)) to ensure that the estimated word embeddings align with the subject area. As shown in the last line of Tab. 1, both subject fidelity and prompt fidelity decrease significantly without the mask regularization loss." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 131, + 641, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 480, + 665 + ], + "type": "text", + "content": "Ablations on the Number of Word Embedding. Recalling that the prompt regressor estimates multiple word embeddings for enhanced description of key" + } + ] + } + ], + "index": 20 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 176, + 114, + 240, + 178 + ], + "blocks": [ + { + "bbox": [ + 176, + 114, + 240, + 178 + ], + "lines": [ + { + "bbox": [ + 176, + 114, + 240, + 178 + ], + "spans": [ + { + "bbox": [ + 176, + 114, + 240, + 178 + ], + "type": "image", + "image_path": "5166451214f0e0a01c388f7d2250d7c21ea4536ff45ebb7051f56a6e64637c51.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 192, + 178, + 223, + 187 + ], + "lines": [ + { + "bbox": [ + 192, + 178, + 223, + 187 + ], + "spans": [ + { + "bbox": [ + 192, + 178, + 223, + 187 + ], + "type": "text", + "content": "Input Image" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 203, + 199, + 408, + 210 + ], + "lines": [ + { + "bbox": [ + 203, + 199, + 408, + 210 + ], + "spans": [ + { + "bbox": [ + 203, + 199, + 408, + 210 + ], + "type": "text", + "content": "Fig. 13: Showcases of limitations in HybridBooth." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 242, + 114, + 306, + 178 + ], + "blocks": [ + { + "bbox": [ + 242, + 114, + 306, + 178 + ], + "lines": [ + { + "bbox": [ + 242, + 114, + 306, + 178 + ], + "spans": [ + { + "bbox": [ + 242, + 114, + 306, + 178 + ], + "type": "image", + "image_path": "188e0cfbae10580c1c8e45228ebeb719fde150b48cdee3e54052b4bd816e7087.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 247, + 178, + 288, + 187 + ], + "lines": [ + { + "bbox": [ + 247, + 178, + 288, + 187 + ], + "spans": [ + { + "bbox": [ + 247, + 178, + 288, + 187 + ], + "type": "inline_equation", + "content": "S^{\\star}" + }, + { + "bbox": [ + 247, + 178, + 288, + 187 + ], + "type": "text", + "content": " is Laughing" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 307, + 114, + 372, + 178 + ], + "blocks": [ + { + "bbox": [ + 307, + 114, + 372, + 178 + ], + "lines": [ + { + "bbox": [ + 307, + 114, + 372, + 178 + ], + "spans": [ + { + "bbox": [ + 307, + 114, + 372, + 178 + ], + "type": "image", + "image_path": "20e741edb3bf5a657360d074c78568427e691c88a13dd4be2f2a089e73947639.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 313, + 178, + 353, + 187 + ], + "lines": [ + { + "bbox": [ + 313, + 178, + 353, + 187 + ], + "spans": [ + { + "bbox": [ + 313, + 178, + 353, + 187 + ], + "type": "inline_equation", + "content": "S^{\\star}" + }, + { + "bbox": [ + 313, + 178, + 353, + 187 + ], + "type": "text", + "content": " is Drawing" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 373, + 114, + 438, + 178 + ], + "blocks": [ + { + "bbox": [ + 373, + 114, + 438, + 178 + ], + "lines": [ + { + "bbox": [ + 373, + 114, + 438, + 178 + ], + "spans": [ + { + "bbox": [ + 373, + 114, + 438, + 178 + ], + "type": "image", + "image_path": "36aa722ab179c1f6723246567918bb661a07d042914192841fbbc7c9e88ad20b.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 377, + 178, + 431, + 187 + ], + "lines": [ + { + "bbox": [ + 377, + 178, + 431, + 187 + ], + "spans": [ + { + "bbox": [ + 377, + 178, + 431, + 187 + ], + "type": "inline_equation", + "content": "S^{\\star}" + }, + { + "bbox": [ + 377, + 178, + 431, + 187 + ], + "type": "text", + "content": " as a young child" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 234, + 479, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 234, + 479, + 282 + ], + "spans": [ + { + "bbox": [ + 131, + 234, + 479, + 282 + ], + "type": "text", + "content": "subject features, we adjust the number of embeddings. Quantitative results in Fig. 12 indicate a consistent improvement in metrics related to Prompt Fidelity and Subject Fidelity with an increasing number of words. To balance efficiency and computation cost, we set the number of word embeddings we estimate to 5." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 293, + 480, + 365 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 293, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 131, + 293, + 480, + 365 + ], + "type": "text", + "content": "Can the Learned Subject Concept be Cross-species Adapted? The well-aligned training data in the Probe Stage results in the encoder developing a consistent semantic tendency in attention maps, as shown in Fig. 6. The subsequent Refinement Stage further enhances the model's generalization ability. Fig. 11 illustrates that species with similar semantic structures, such as humans, dogs, and cats, consistently yield robust results, even with complex prompts." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 383, + 219, + 395 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 383, + 219, + 395 + ], + "spans": [ + { + "bbox": [ + 132, + 383, + 219, + 395 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 407, + 480, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 480, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 480, + 491 + ], + "type": "text", + "content": "In this paper, we address the challenge of achieving fast prompt inversion while preserving the generalization capabilities of text-to-image models. By leveraging both optimization-based and direct-regression-based methods, we propose a two-stage hybrid prompt inversion framework, termed HybridBooth. This framework ensures robust and efficient subject-driven generation while maintaining the model's general creative ability. Experimental results demonstrate the superior performance of HybridBooth compared to existing state-of-the-art methods." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 491, + 480, + 563 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 491, + 480, + 563 + ], + "spans": [ + { + "bbox": [ + 131, + 491, + 480, + 563 + ], + "type": "text", + "content": "Limitation. As shown in Fig. 13, HybridBooth cannot perform precise semantic editing, such as adjusting expressions and age. In addition, HybridBooth inherits the weakness from StableDiffusion that fails to generate fine-grained details of the subject, such as fingers. To address these issues, we believe possible solutions are incorporating language-and-vision models [22] for improved understanding and planning, and utilizing more 3D structural information [4,5]." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 581, + 240, + 594 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 581, + 240, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 581, + 240, + 594 + ], + "type": "text", + "content": "Acknowledgement" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 131, + 605, + 479, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 605, + 479, + 664 + ], + "spans": [ + { + "bbox": [ + 131, + 605, + 479, + 664 + ], + "type": "text", + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant No. 62073244 and 61825303, 62088101, and the Shanghai Municipal Science and Technology Major Project (2021SHZDZX0100) and the Fundamental Research Funds for the Central Universities. We thank Yixuan Li for his assistance with the illustrations." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 90, + 380, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 90, + 380, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 90, + 380, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "type": "text", + "content": "1. Alaluf, Y., Patashnik, O., Cohen-Or, D.: Only a matter of style: Age transformation using a style-based regression model. ACM TOG 40(4) (2021) 2, 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "text", + "content": "2. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization (2023) 2, 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 184, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 480, + 215 + ], + "type": "text", + "content": "3. Arar, M., Gal, R., Atzmon, Y., Chechik, G., Cohen-Or, D., Shamir, A., Bermano, A.H.: Domain-agnostic tuning-encoder for fast personalization of text-to-image models (2023) 2, 4, 5" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 216, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 216, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 138, + 216, + 480, + 237 + ], + "type": "text", + "content": "4. Blanz, V., Vetter, T.: A morphable model for the synthesis of 3d faces. In: Waggenspack, W.N. (ed.) SIGGRAPH. pp. 187-194 (1999) 14" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 238, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 238, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 138, + 238, + 480, + 270 + ], + "type": "text", + "content": "5. Bogo, F., Kanazawa, A., Lassner, C., Gehler, P., Romero, J., Black, M.J.: Keep it smpl: Automatic estimation of 3d human pose and shape from a single image. In: ECCV. pp. 561-578. Springer (2016) 14" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 271, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 271, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 138, + 271, + 480, + 335 + ], + "type": "text", + "content": "6. Brown, T.B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., Agarwal, S., Herbert-Voss, A., Krueger, G., Henighan, T., Child, R., Ramesh, A., Ziegler, D.M., Wu, J., Winter, C., Hesse, C., Chen, M., Sigler, E., Litwin, M., Gray, S., Chess, B., Clark, J., Berner, C., McCandlish, S., Radford, A., Sutskever, I., Amodei, D.: Language models are few-shot learners (2020) 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 337, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 480, + 369 + ], + "type": "text", + "content": "7. Choi, Y., Choi, M., Kim, M., Ha, J.W., Kim, S., Choo, J.: Stargan: Unified generative adversarial networks for multi-domain image-to-image translation. In: CVPR (2018) 2, 4" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 370, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 480, + 402 + ], + "type": "text", + "content": "8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: North American Chapter of the Association for Computational Linguistics (2019) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "text", + "content": "9. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: ICLR (2022) 1, 2, 4, 5, 9, 12" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "type": "text", + "content": "0. Gal, R., Arar, M., Atzmon, Y., Bermano, A.H., Chechik, G., Cohen-Or, D.: Encoder-based domain tuning for fast personalization of text-to-image models. ACM TOG 42(4), 1-13 (2023) 1, 2, 4, 5, 8" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 468, + 480, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 480, + 500 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 480, + 500 + ], + "type": "text", + "content": "1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS. pp. 2672-2680 (2014) 3" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 501, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 501, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 138, + 501, + 480, + 522 + ], + "type": "text", + "content": "2. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. In: CVPR (2017) 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 523, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 480, + 555 + ], + "type": "text", + "content": "3. Jiang, D., Liu, Y., Liu, S., Zhang, X., Li, J., Xiong, H., Tian, Q.: From clip to dino: Visual encoders shout in multi-modal large language models. CoRR:2310.08825 (2023) 6, 7" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 556, + 480, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 556, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 556, + 480, + 577 + ], + "type": "text", + "content": "4. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 2, 9" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 578, + 480, + 598 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 598 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 598 + ], + "type": "text", + "content": "5. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR. pp. 4401-4410 (2019) 3" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "type": "text", + "content": "6. Kim, T., Kim, K., Lee, J., Cha, D., Lee, J., Kim, D.: Revisiting image pyramid structure for high resolution salient object detection. In: Proceedings of the Asian Conference on Computer Vision. pp. 108-124 (2022) 9" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 632, + 474, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 474, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 474, + 643 + ], + "type": "text", + "content": "7. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "8. Krasin, I., Duerig, T., Alldrin, N., Ferrari, V., Abu-El-Haija, S., Kuznetsova, A., Rom, H., Uijlings, J., Popov, S., Veit, A., et al.: Openimages: A public dataset for" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 147, + 116, + 481, + 139 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 116, + 481, + 139 + ], + "spans": [ + { + "bbox": [ + 147, + 116, + 481, + 139 + ], + "type": "text", + "content": "large-scale multi-label and multi-class image classification. Dataset available from https://github.com/openimages2(3), 18 (2017) 9" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 481, + 159 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 481, + 159 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 481, + 159 + ], + "type": "text", + "content": "19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR (2023) 2, 4, 7, 9, 12" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 160, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 160, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 160, + 481, + 182 + ], + "type": "text", + "content": "20. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: CVPR. pp. 1931-1941 (2023) 8" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 182, + 481, + 202 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 481, + 202 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 481, + 202 + ], + "type": "text", + "content": "21. Li, D., Li, J., Hoi, S.C.H.: Blip-diffusion: Pre-trained subject representation for controllable text-to-image generation and editing. In: NeurIPS (2023) 5" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 203, + 481, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 203, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 132, + 203, + 481, + 224 + ], + "type": "text", + "content": "22. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. In: CVPR. pp. 26296-26306 (2024) 14" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 224, + 481, + 243 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 481, + 243 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 481, + 243 + ], + "type": "text", + "content": "23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2018) 9" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 245, + 481, + 267 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 245, + 481, + 267 + ], + "spans": [ + { + "bbox": [ + 132, + 245, + 481, + 267 + ], + "type": "text", + "content": "24. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. CoRR:2211.09794 (2022) 1" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 267, + 481, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 267, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 481, + 289 + ], + "type": "text", + "content": "25. Nichol, A.Q., Dhariwal, P.: Improved denoising diffusion probabilistic models. In: ICML. pp. 8162-8171 (2021) 1" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 289, + 481, + 310 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 289, + 481, + 310 + ], + "spans": [ + { + "bbox": [ + 132, + 289, + 481, + 310 + ], + "type": "text", + "content": "26. van den Oord, A., Vinyals, O., kavukcuoglu, k.: Neural discrete representation learning. In: NeurIPS. p. 6306-6315 (2017) 3, 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 310, + 481, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 310, + 481, + 342 + ], + "spans": [ + { + "bbox": [ + 132, + 310, + 481, + 342 + ], + "type": "text", + "content": "27. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. CoRR:2304.07193 (2023) 6, 9" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 342, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 342, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 342, + 481, + 363 + ], + "type": "text", + "content": "28. Pan, X., Qin, P., Li, Y., Xue, H., Chen, W.: Synthesizing coherent story with auto-regressive latent diffusion models (2022) 1" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "type": "text", + "content": "29. Pan, X., Tewari, A., Leimkuhler, T., Liu, L., Meka, A., Theobalt, C.: Drag your gan: Interactive point-based manipulation on the generative image manifold. In: SIGGRAPH. pp. 1-11 (2023) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "type": "text", + "content": "30. Peng, X., Zhu, J., Jiang, B., Tai, Y., Luo, D., Zhang, J., Lin, W., Jin, T., Wang, C., Ji, R.: Portrait booth: A versatile portrait model for fast identity-preserved personalization. In: CVPR. pp. 27080-27090 (2024) 1" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 429, + 481, + 460 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 429, + 481, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 429, + 481, + 460 + ], + "type": "text", + "content": "31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021) 3, 4, 6, 9" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 461, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 461, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 132, + 461, + 481, + 482 + ], + "type": "text", + "content": "32. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: ICML (2021) 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 483, + 481, + 503 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 483, + 481, + 503 + ], + "spans": [ + { + "bbox": [ + 132, + 483, + 481, + 503 + ], + "type": "text", + "content": "33. Roich, D., Mokady, R., Bermano, A.H., Cohen-Or, D.: Pivotal tuning for latent-based editing of real images. ACM TOG (2021) 4" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 503, + 481, + 535 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 503, + 481, + 535 + ], + "spans": [ + { + "bbox": [ + 132, + 503, + 481, + 535 + ], + "type": "text", + "content": "34. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022) 1, 3, 4, 9" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 536, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 536, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 132, + 536, + 481, + 557 + ], + "type": "text", + "content": "35. Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychological review 65(6), 386 (1958) 7" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 558, + 481, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 481, + 589 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 481, + 589 + ], + "type": "text", + "content": "36. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: CVPR. pp. 22500-22510 (2023) 1, 2, 4, 5, 6, 7, 9, 12" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 590, + 481, + 622 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 590, + 481, + 622 + ], + "spans": [ + { + "bbox": [ + 132, + 590, + 481, + 622 + ], + "type": "text", + "content": "37. Ruiz, N., Li, Y., Jampani, V., Wei, W., Hou, T., Pritch, Y., Wadhwa, N., Rubinstein, M., Aberman, K.: Hyperdreambooth: Hypernetworks for fast personalization of text-to-image models. In: CVPR. pp. 6527-6536 (2024) 2, 4, 10, 11" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "text", + "content": "38. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, S.K.S., Lopes, R.G., Ayan, B.K., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022) 3" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 381, + 102 + ], + "type": "text", + "content": "S. Guan, Y. Ge, Y. Tai, J. Yang, W. Li, and M. You" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 556 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "text", + "content": "39. Shen, Y., Gu, J., Tang, X., Zhou, B.: Interpreting the latent space of gans for semantic face editing. In: CVPR (2020) 2, 4" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 481, + 160 + ], + "type": "text", + "content": "40. Shen, Y., Yang, C., Tang, X., Zhou, B.: Interfacegan: Interpreting the disentangled face representation learned by gans. TPAMI (2020) 2, 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 160, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 481, + 182 + ], + "type": "text", + "content": "41. Tewel, Y., Gal, R., Chechik, G., Atzmon, Y.: Key-locked rank one editing for text-to-image personalization. SIGGRAPH (2023) 2, 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 182, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 481, + 215 + ], + "type": "text", + "content": "42. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023) 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 215, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 215, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 130, + 215, + 481, + 335 + ], + "type": "text", + "content": "43. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Ferrer, C.C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura, P.S., Lachaux, M.A., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models (2023) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 335, + 481, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 335, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 335, + 481, + 357 + ], + "type": "text", + "content": "44. Tov, O., Alaluf, Y., Nitzan, Y., Patashnik, O., Cohen-Or, D.: Designing an encoder for stylegan image manipulation. CoRR:2102.02766 (2021) 2, 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 357, + 481, + 379 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 357, + 481, + 379 + ], + "spans": [ + { + "bbox": [ + 130, + 357, + 481, + 379 + ], + "type": "text", + "content": "45. Voetman, R., Aghaei, M., Dijkstra, K.: The big data myth: Using diffusion models for dataset generation to train deep detection models (2023) 1" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 380, + 481, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 481, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 481, + 402 + ], + "type": "text", + "content": "46. Wang, Q., Bai, X., Wang, H., Qin, Z., Chen, A.: Instantid: Zero-shot identity-preserving generation in seconds. CoRR preprint CoRR:2401.07519 (2024) 1" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 402, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 481, + 435 + ], + "type": "text", + "content": "47. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: ICCV. pp. 15943-15953 (2023) 2, 4, 9, 12, 13" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 435, + 481, + 467 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 435, + 481, + 467 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 481, + 467 + ], + "type": "text", + "content": "48. Xiao, G., Yin, T., Freeman, W.T., Durand, F., Han, S.: Fastcomposer: Tuning-free multi-subject image generation with localized attention. CoRR:2305.10431 (2023) 2, 7, 9, 11, 12, 13" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 468, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 481, + 500 + ], + "type": "text", + "content": "49. Zhang, Q., Wang, C., Wu, H., Xin, C., Phuong, T.V.: Gelu-net: A globally encrypted, locally unencrypted deep neural network for privacy-preserved learning. In: IJCAI. pp. 3933-3939 (2018) 7" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 500, + 481, + 532 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 500, + 481, + 532 + ], + "spans": [ + { + "bbox": [ + 130, + 500, + 481, + 532 + ], + "type": "text", + "content": "50. Zhou, Y., Zhang, R., Sun, T., Xu, J.: Enhancing detail preservation for customized text-to-image generation: A regularization-free approach. CoRR:2305.13579 (2023) 8" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 532, + 481, + 556 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 532, + 481, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 532, + 481, + 556 + ], + "type": "text", + "content": "51. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: ICCV (2017) 3" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "HybridBooth" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_content_list.json b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..21d16159b70ee88a6a90de829a051cec6654787f --- /dev/null +++ b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_content_list.json @@ -0,0 +1,1535 @@ +[ + { + "type": "text", + "text": "HyperSpaceX: Radial and Angular Exploration of HyperSpherical Dimensions", + "text_level": 1, + "bbox": [ + 217, + 140, + 789, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Chiranjeev Chiranjeev, Muskan Dosi, Kartik Thakral Mayank Vatsa and Richa Singh", + "bbox": [ + 230, + 212, + 772, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Indian Institute of Technology Jodhpur, India {chiranjeev.1,dosi.1,thakral.1,mvatsa,richa}@iitj.ac.in https://github.com/IAB-IITJ/HyperSpaceX", + "bbox": [ + 287, + 255, + 715, + 297 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/8396ba67b03bde4741884bbcb8e8d53ed923e992e18e4117b5bfd839dd4be1ef.jpg", + "image_caption": [ + "Fig. 1: Visual concept of the proposed HyperSpaceX framework: It utilizes a novel radial-angular latent space on hyperspherical manifolds to differentiate features effectively. Initially, class features are indistinguishable due to overlap. The proposed DistArc loss exhibits two feature arrangement learning: high inter-class variation employing multi-radial angular arrangement and minimal intra-class distance, leading to highly separable-discriminable class features." + ], + "image_footnote": [], + "bbox": [ + 276, + 310, + 725, + 426 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Traditional deep learning models rely on methods such as softmax cross-entropy and ArcFace loss for tasks like classification and face recognition. These methods mainly explore angular features in a hyperspherical space, often resulting in entangled inter-class features due to dense angular data across many classes. In this paper, a new field of feature exploration is proposed known as HyperSpaceX which enhances class discrimination by exploring both angular and radial dimensions in multi-hyperspherical spaces, facilitated by a novel DistArc loss. The proposed DistArc loss encompasses three feature arrangement components: two angular and one radial, enforcing intra-class binding and inter-class separation in multi-radial arrangement, improving feature discriminability. Evaluation of HyperSpaceX framework for the novel representation utilizes a proposed predictive measure that accounts for both angular and radial elements, providing a more comprehensive assessment of model accuracy beyond standard metrics. Experiments across seven object classification and six face recognition datasets demonstrate state-of-the-art (SoTA) results obtained from HyperSpaceX, achieving up to a $20\\%$ performance improvement on large-scale object datasets in lower dimensions and up to $6\\%$ gain in higher dimensions.", + "bbox": [ + 259, + 536, + 740, + 800 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Representation Learning $\\cdot$ Image Classification $\\cdot$ Face Recognition", + "bbox": [ + 261, + 811, + 743, + 838 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 143, + 374, + 160 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The advancement in image classification and face recognition has greatly benefited from the introduction of innovative loss functions, designed to better differentiate between class features. These functions are crafted to learn unique representations for each class by employing proxies or weight vectors to increase the distinction between classes. Traditional image classification techniques [14], [12], [24], [34] primarily rely on cross-entropy loss [1], [35] to create intricate class boundaries and improve model generalization. However, a common limitation of these approaches is their tendency to neglect the reduction of within-class feature distances while failing to adequately separate features between different classes. This results in the blending of feature points from dissimilar classes, thus leading to reduced accuracies in object classification and face verification tasks.", + "bbox": [ + 212, + 179, + 787, + 345 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To address this gap, several modifications to softmax-based loss functions have been introduced, utilizing proxy-based methods to cluster similar class features while concurrently expanding the separation between dissimilar ones within the latent space. For face recognition, existing approaches [3], [8], [16], [26], [28] leverage proxy-based objectives to achieve better feature separability on a hypersphere through angular dimensions. Methods such as SphereFace [16], [29] and ArcFace [3] introduce angular margins to promote large-margin discriminative feature learning, while CosFace [28] incorporates marginal cosine functions to modify softmax loss by equalizing radial variations, introducing a cosine margin for angular decision boundaries. Furthermore, face recognition has benefited from proxy-free training strategies that focus on deep metric learning techniques [19], [22], [25], [31]. These strategies generate embeddings that bring similar faces closer together while keeping dissimilar ones apart, adapting effectively to various conditions without the need for explicit class labels. However, methods like triplet learning [22] and contrastive loss [31] depend heavily on the availability of extensive image pairs or triplets for effective training and often face difficulties with hard-pair mining. Other discriminative loss functions like Center loss [30] and Git loss [7] encounter difficulties in updating class center parameters with a large identity count, adding computational cost. Orthogonal Projection Loss (OPL) [21] and Learnable Subspace Orthogonal Projection [15] employ orthogonal projection constraints to improve separability between classes, but this approach restricts the number of classes to $2^d$ in d-dimensional space.", + "bbox": [ + 212, + 345, + 787, + 678 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The limitations of traditional loss functions, including those modified for angular space, have led to challenges in effectively differentiating between features. The issue occurs when features of closely related classes overlap, causing uncertainties in the correct identification or classification of subjects1. This overlap of class features makes it difficult to discern between unique identities or classes, thereby impacting the overall performance. To overcome these limitations, we propose the HyperSpaceX framework, a novel approach that extends the exploration of feature space beyond the angular to include radial dimensions in multi-hyperspherical latent spaces. It introduces a loss function that emphasizes", + "bbox": [ + 212, + 679, + 787, + 814 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 1 + }, + { + "type": "page_footnote", + "text": "It is further analyzed in section 3", + "bbox": [ + 217, + 824, + 457, + 839 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "the arrangement of features to increase inter-class separability and intra-class compactness. Through the effective combination of angular and radial organization of features, the framework aims to minimize the overlap among inter-class data points, presenting a novel discriminative feature representation approach for image classification and face recognition. The key highlights are:", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. Introducing HyperSpaceX, a novel discriminative feature representation and arrangement learning that explores both radial and angular dimensions within multi-hyperspherical spaces, enabling effective feature learning.", + "2. Developing the DistArc loss function, aimed at enhancing the discriminative power of deep learning models. It improves feature representation by promoting better separation between different classes and tighter clustering of features within the same class in the latent space.", + "3. Presenting a predictive measure to evaluate the model's performance, incorporating both radial and angular dimensions in multi-hyperspherical settings. This measure provides a more comprehensive understanding of the model's capabilities in handling complex feature distributions.", + "4. Evaluating the proposed approach using seven object datasets (MNIST, FashionMNIST, CIFAR-10, CIFAR-100, CUB-200, TinyImageNet and ImageNet1K) and six face datasets (LFW, CFP-FP, AgeDB-30, CA-LFW, CP-LFW and D-LORD), showing its effectiveness in improving feature distinction and model accuracy across various data types and complexities, often achieving state-of-the-art results." + ], + "bbox": [ + 222, + 241, + 790, + 503 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 The HyperSpaceX Framework", + "text_level": 1, + "bbox": [ + 215, + 539, + 545, + 556 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In traditional hyperspherical angular latent spaces, identities or classes are delineated by distinct angular directions. However, with the increase in the number of classes and the volume of data for each class, overlaps and intersections in these class representations increases, leading to significant classification challenges, as they blur the distinction between different classes. To address the issue of feature overlap and the necessity for more defined class distinctions, we propose the HyperSpaceX framework. This framework utilizes a multi-hyperspherical space, drawing on both radial hyperspheres and angular dimensions to promote a discriminative distribution of class features. This learnable arrangement distribution is facilitated by the novel DistArc loss that significantly enhances class differentiation and separation along with the grouping of same-category features. DistArc strategically arranges features by considering both their angle and distance from the center, across various spherical layers. This method utilizes the diversity of spatial dimensions to establish clear and distinct areas within the spherical model, making it easier to define precise boundaries between classes. Such a multi-dimensional approach generates a more elaborate hyperspherical subspace, facilitating the creation of more efficient decision boundaries.", + "bbox": [ + 212, + 583, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "HyperSpaceX", + "bbox": [ + 637, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 146, + 372, + 159 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Deep learning research has explored a variety of loss functions, among which Cross-entropy loss is most commonly used for classification tasks. Let $x_{i}$ and $\\omega$ be the feature embedding and weight or proxy matrix, respectively. Cross-entropy loss is defined as $L_{\\mathrm{CE}} = -\\frac{1}{N}\\sum_{i=1}^{N}\\log\\frac{e^{\\omega_T x_i + by_i}}{\\sum_{j=1}^{K}e^{\\omega_T x_j + bj}}$ . Here, $\\omega_{y_i}$ signifies the proxy vector of the $y_{i}$ -th class. The term $b$ refers to the bias, $N$ represents the number of samples distributed over $K$ number of classes. This function calculates the expected loss between the predicted and actual class distributions, focusing on optimizing class separations without necessarily bringing similar class features closer or significantly distancing different classes. Such limitations can adversely affect image classification and face recognition performance, particularly under high intra-class variations. There have been attempts to enhance inter-class distinctions through loss functions like Orthogonal Projection Loss (OPL) [21], which introduces perpendicular margins between class features. However, these efforts are often overshadowed by the dominance of cross-entropy in optimization processes. Softmax-based losses, including those used in deep face recognition like SphereFace [16] [29], CosFace [28] and ArcFace [3], primarily rely on cross-entropy based formulation. Among these is ArcFace loss, one of the most popular angular-loss functions, which distinguishes itself by allocating features around class proxies within a hyperspherical space and applying an angular margin $m$ to enhance the cohesion within classes and the distinction between different classes. The mathematical formulation of ArcFace loss is represented as $L_{\\mathrm{ArcFace}} = -\\frac{1}{N}\\sum_{i=1}^{N}\\log\\frac{e^{\\cos(\\theta_{y_i} + m)}}{e^{\\cos(\\theta_{y_i} + m)} + \\sum_{j=1,j \\neq y_i}^{K}e^{\\cos\\theta_j}}$ .", + "bbox": [ + 212, + 172, + 787, + 529 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this, $\\cos\\theta$ is calculated using cosine similarity between feature embedding $x$ and proxy $\\omega$ , that is defined by computing a dot product between unit vectors of $x$ and $\\omega$ as represented through $\\cos(\\theta_{y_i}) = \\hat{x}_i \\cdot \\hat{\\omega}_{y_i} \\cos(\\theta_j) = \\hat{x}_i \\cdot \\hat{\\omega}_j$ . However, focusing solely on angular dimensions can lead to ambiguity among classes in densely populated identity spaces, highlighting a need for broader exploration beyond angular metrics.", + "bbox": [ + 212, + 529, + 787, + 619 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Proposed DistArc Loss", + "text_level": 1, + "bbox": [ + 215, + 643, + 452, + 657 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The proposed DistArc loss navigates through radial and angular dimensions across multiple hyperspheres centered at the origin to improve class discrimination. The DistArc loss is formulated as,", + "bbox": [ + 212, + 670, + 785, + 715 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\nL _ {\\text {D i s t A r c}} = - \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\log \\frac {e ^ {\\cos \\left(\\theta_ {y _ {i}} + m\\right) + \\cos \\left(\\phi_ {y _ {i}}\\right) - \\lambda \\delta_ {y _ {i}}}}{e ^ {\\cos \\left(\\theta_ {y _ {i}} + m\\right)} + \\sum_ {j = 1 , j \\neq y _ {i}} ^ {K} e ^ {\\cos \\left(\\theta_ {j}\\right) - \\lambda \\delta_ {j}}} \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 289, + 727, + 785, + 768 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\lambda$ represents the weighing factor and $\\cos \\theta$ defines the cosine of angle between embedding $x$ and a proxy vector $\\omega$ . An angular-margin penalty of $m$ is introduced in $\\cos \\theta$ to enhance the feature discriminability. Fig. 2a represents the geometric illustration of $\\cos (\\theta_{y_i} + m)$ . The DistArc loss minimizes the angle", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/c33b1ddbff03eed3bbf8f215b692fc4a58104e588496286f90cbc864f40c2dbb.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 349, + 143, + 452, + 224 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/ba2d9d8a595d36b1862197fffc2ca07726fb5b8ddcd7c4632e04a16ff29506bd.jpg", + "image_caption": [ + "(b)", + "Fig.2: The geometric interpretation of angular and radial formations in multihyperspherical dimensions in the training phase through (a) $\\theta$ and angular-margin penalty $m$ , and (b) angle $\\phi$ between scaled proxy vector $\\omega_{y_i}$ and resultant vector $R$ . (c) Shows the vector representation of $R$ and $\\omega_{y_i}$ in a reverse direction for computing angle $\\phi$ using cosine of an angle $\\phi$ ." + ], + "image_footnote": [], + "bbox": [ + 452, + 143, + 563, + 227 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/029d5119f7eecff79768b6fc3551d3748e9d2769cc118cf9ca6d1fc7c027be65.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 566, + 146, + 656, + 220 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "$\\theta_{y_i}$ , thereby increasing the cosine similarity between embeddings $x_i$ and their corresponding proxy's $\\omega_{y_i}$ . However, to include the radial dimension also we incorporate the $\\cos \\phi_{y_i}$ which represents the cosine of angle between radii scaled proxy vector $\\omega_{r_y_i}$ and a resultant vector $R_{y_i}$ of $\\omega_{r_y_i}$ and $x_i$ . Fig. 2b describes the geometric representation of the resultant vector $R_{y_i}$ . $R_{y_i}$ is modified while learning/training such that it minimizes the angle between $R_{y_i}$ and $\\omega_{r_y_i}$ which is defined using $\\omega_{r_y_i} = \\hat{\\omega}_{y_i} \\times r_y_i$ and $R_{y_i}$ is defined as $R_{y_i} = -\\omega_{r_y_i} + x_i$ . Here, $R_{y_i} \\in \\mathbb{R}^d$ , $\\omega_{r_y_i} \\in \\mathbb{R}^{d \\times 1}$ , and $x_i \\in \\mathbb{R}^d$ . The resultant vector helps to maintain the embedding magnitude within the hyperspherical radii of magnitude $||\\omega_{r_y_i}||_2$ and further optimizes the embeddings $x_i$ 's to cluster in the angular direction by minimizing the angle $(\\phi_{y_i})$ between $R_{y_i}$ and $\\omega_{r_y_i} \\colon \\cos (\\phi_{y_i}) = \\hat{R}_{y_i} \\cdot -\\hat{\\omega}_{r_y_i}$ . This equation, while calculating the $\\cos \\phi_{y_i}$ , the origin is taken at $\\hat{\\omega}_{r_y_i}$ which results $\\hat{\\omega}_{r_y_i}$ vector to be in reverse direction leading to $-\\hat{\\omega}_{r_y_i}$ . We can visualize its vector representation from Fig. 2c representing the angle computation process between the reversely directed scaled proxy vector $\\omega_{r_y_i}$ and a resultant vector $R_{y_i}$ . The term $\\cos \\phi_{y_i}$ within the proposed loss function $L_{DistArc}$ is designed to enhance the intra-class compactness of features with their respective scaled class proxies, $\\omega_{r_y_i}$ by optimizing both the radial and angular dimensions of different hyperspheres. This term also has a major significance in letting the distribution of each class to stay within particular radii hyperspheres in the feature space.", + "bbox": [ + 212, + 353, + 787, + 657 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Through DistArc loss, the $\\cos \\theta_{y_i}$ optimizes to align the embeddings with class proxies $\\omega_{y_i}$ in the angular space and $\\cos \\phi_{y_i}$ optimizes to increase the compactness among embeddings and their respective scaled proxies $\\omega_{r_{y_i}}$ . It also ensures that the length of embeddings does not extend beyond their radial space $r_i$ ; further, minimizes the angle between normalized resultant vector $(\\hat{R}_{y_i})$ and normalized scaled proxy $(\\hat{\\omega}_{r_{y_i}})$ to bring closer the embeddings at the point of scaled proxy, $\\omega_{r_{y_i}}$ in the angular space. The overall geometric interpretation of DistArc loss during the training phase is shown in Fig. 2b.", + "bbox": [ + 212, + 657, + 789, + 779 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In the proposed DistArc loss, $\\delta_{y_i}$ act as a pulling force to attract embeddings $x_{i}$ towards $\\omega_{r_{y_i}}$ . This loss component optimizes to shift the distribution of each class towards the scaled proxies $\\omega_{r_{y_i}}$ in the radial space, leading to an increase in the embedding's magnitude. Leading to the enhancement of intra-class compact-", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "HyperSpaceX", + "bbox": [ + 637, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "ness, $\\delta_{j}$ in the denominator of the loss function, helps to distant the $x_{i}$ 's away from other scaled proxies $\\omega_{r_j}$ 's excluding $\\omega_{r_{y_i}}$ . The overall combination of $\\delta_{y_i}$ and $\\delta_{j}$ increases the inter-class distance between dissimilar class scaled proxies and embeddings while decreasing the intra-class distance between similar class scaled proxy and embeddings. The $\\delta_{y_i}$ term is defined using, $\\delta_{y_i} = \\| \\omega_{r_y_i} - x_i\\| _2^2$ and in case when $j\\neq y_{i}$ , $\\delta_{j} = \\| \\omega_{r_{j}} - x_{i}\\|_{2}^{2}$ . A negative (-) sign is used in the $\\delta$ component of loss Eq. 1 to maximize the logarithmic distribution overall and subsequently minimize the DistArc loss.", + "bbox": [ + 212, + 146, + 787, + 270 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "2.3 Analytical Ablation of DistArc Loss and Inductive Bias for HyperSpaceX Framework", + "text_level": 1, + "bbox": [ + 214, + 292, + 754, + 324 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In the proposed DistArc loss, the first component $\\cos (\\theta_{y_i} + m)$ represents the cosine of the angle $\\theta_{y_i}$ between $\\omega_{y_i}$ and $x_i$ , incorporating an additional penalty $m$ for the angular margin applied to angle $\\theta_{y_i}$ , to strengthen coherence within the class while increasing differentiation between different classes. The second term, $\\cos \\phi_{y_i}$ , calculates the angle between the scaled proxy $\\omega_{r_{y_i}}$ and its corresponding resultant vector $R_{y_i}$ . This can be expressed as the dot product between the two vectors: $\\omega_{r_{y_i}}$ in reverse direction and $R_{y_i}$ . This aims to minimize the angle $\\phi_{y_i}$ , ensuring that feature points remain close to their scaled proxies and do not extend beyond the boundaries of their respective radial hyperspheres. The last two terms, $\\delta_{y_i}$ and $\\delta_j$ , help to shift the features to their corresponding scaled proxy $\\omega_{r_{y_i}}$ points over different radii hyperspheres and diverging $x_i$ features from different class proxies $\\omega_{r_j}$ 's. It ensures inter-class separability in the radial direction across multi-hyperspherical manifolds. The $\\delta_{y_i}$ term also results in the tighter clustering of class features around their respective $\\omega_{r_{y_i}}$ leading to high class discrimination. The combined importance of the components $\\cos \\theta_{y_i}$ and $\\cos \\phi_{y_i}$ manifests itself in the minimization of angles $\\theta$ and $\\phi$ , using a more concentrated angular distribution of features aligning to the corresponding class proxies. Further, it prevents features from extending beyond their respective class radii. The loss's additional $\\delta$ component contributes to the compact clustering and length amplification of $x_i$ vectors, shifting them to specific hypersphere radii $^2$ .", + "bbox": [ + 212, + 333, + 787, + 648 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Additionally, in the context of HyperSpaceX framework, the inductive bias effectively shapes the decision boundaries based on both radial and angular factors. We define the decision boundary as,", + "bbox": [ + 212, + 651, + 789, + 696 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\left(\\cos \\left(\\theta_ {1} + m\\right) + \\left| \\left| x _ {1} \\right| \\right| _ {2}\\right) - \\left(\\cos \\left(\\theta_ {2}\\right) + \\left| \\left| x _ {2} \\right| \\right| _ {2}\\right) = 0 \\text {f o r c l a s s 1} \\\\ \\left(\\cos \\left(\\theta_ {1}\\right) + \\left\\| x _ {1} \\right\\| _ {2}\\right) - \\left(\\cos \\left(\\theta_ {2} + m\\right) + \\left\\| x _ {2} \\right\\| _ {2}\\right) = 0 \\text {f o r c l a s s 2} \\tag {2} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 297, + 708, + 784, + 742 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This analysis of inductive bias in decision boundaries is built on binary classification and can effectively be extended to multi-class classification tasks. Consequently, the features learned through the radial-angular DistArc loss exhibit more separable decision boundaries and enhanced discriminative capabilities", + "bbox": [ + 212, + 755, + 787, + 816 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 5 + }, + { + "type": "page_footnote", + "text": "2 A detailed visual and theoretical ablation is included in the supplementary material.", + "bbox": [ + 217, + 824, + 784, + 839 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/b6e75836315174dd6b37ee174a9af0205ae950dc1dc0345c8d87828387aaec5d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 308, + 157, + 410, + 220 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/4cd0957e4b650efe31cf0d88fbba4d242bd455e952d5affddccea41716d58bb4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 444, + 156, + 537, + 224 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/eadd8e59cd529eff3475b410ec736e6d5d8df017e5f65912e95578909aa953b0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 568, + 143, + 694, + 234 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/a85122bbac1335527ea5955098dea4984b03d9d136d105e14c271ebf7c8c11c4.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 323, + 251, + 387, + 316 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/445c69662e3ef602885bf8a11d27ce09b07f379725d3f4f5bcc750fd4c96cafb.jpg", + "image_caption": [ + "(b)" + ], + "image_footnote": [], + "bbox": [ + 434, + 247, + 526, + 321 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/ee8c7a6559a8dadddfb3084f378e82416f0e46ddd35c984cf0a44f51ffe41b47.jpg", + "image_caption": [ + "(c)", + "Fig. 3: The 2-D (in first row) and 3-D (in second row) latent space visualization of features learnt through (a) metric-based loss functions, (b) Angular-softmax-based loss functions, and (c) the proposed Radial-Angular DistArc loss. Further showing the decision-making process of assigning a test sample $x$ to the most favourable class distribution represented using either class center $c$ or proxy vector $\\omega$ ." + ], + "image_footnote": [], + "bbox": [ + 566, + 238, + 691, + 328 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "among class features. A more comprehensive derivation of the decision boundary influenced by inductive bias, elucidating its dependency on angles $\\phi$ , $\\theta$ , and resultant vector $R$ is present in the supplemental.", + "bbox": [ + 214, + 446, + 787, + 492 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3 Predictive Measure and Latent Space Visualization", + "text_level": 1, + "bbox": [ + 215, + 510, + 746, + 527 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The most prevailing choice for evaluating and categorizing a sample involves determining the category by calculating the maximum prediction from the model's predicted probability distribution. The proposed framework identifies the most favourable class distribution across multi-hyperspherical manifolds by considering a combination of angular and radial factors. An optimal class prediction is determined through a distinct approach that helps the evaluation metric, taking into account the radial and angular aspects of hyperspheres. The procedure encompasses the computation of resultant vectors between a sample's feature vector and each scaled proxy through mathematical formulation defined as $R_{i} = x - \\omega_{r_{i}} (\\forall i \\in 1,2,3,\\ldots)$ . The resultant vector with the smallest magnitude determines the most favourable class proximity. Cosine law of triangle length computation is employed to determine the length of the resultant vector $R$ based on learned and computed angles $\\theta$ , $\\phi$ and a magnitude of feature vector $x$ . Eq. 3 defines the formulation for $R_{i}$ 's length computation for every $i^{th}$ category.", + "bbox": [ + 214, + 539, + 787, + 750 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\left| \\left| R _ {i} \\right| \\right| _ {2} = \\left| \\left| x \\right| \\right| _ {2} \\cos \\phi_ {i} + \\left| \\left| \\omega_ {r _ {i}} \\right| \\right| _ {2} \\cos (\\pi - \\left(\\theta_ {i} + \\phi_ {i}\\right)) \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 323, + 757, + 784, + 773 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We introduce a favourable class determining predictive measure for the HyperSpace $X$ framework with its radial-angular based formulation, i.e.,", + "bbox": [ + 215, + 780, + 787, + 810 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {y} = \\underset {R _ {m}} {\\arg \\min } \\left\\{R _ {m} \\in \\mathbb {R} ^ {K}: R _ {m} \\right\\} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 816, + 785, + 843 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "HyperSpaceX", + "bbox": [ + 638, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $R_{m} \\in \\mathbb{R}^{K}$ refers to a vector comprising magnitude of resultant vectors between a sample's feature vector $x \\in \\mathbb{R}^{d}$ and scaled proxy matrix $\\omega_{r} \\in \\mathbb{R}^{d \\times K}$ representing the radii scaled $K$ -class proxies, and $\\hat{y}$ defines a predicted class distribution. The predicted class distribution for a specific sample is effectively represented by the class having the smallest resultant vector magnitude in relation to that sample. The derivation of a predictive measure formulation is provided in the supplementary material.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "During testing, the class of a test sample is determined by its feature representation predicted by the model, influenced by the loss function during training. Fig. 3 displays visual representations of 2D and 3D latent space features, elucidating the decision-making process for classifying a test sample. This is achieved by employing a nearest distance class measure, calculated as the Euclidean distance, as shown in Fig. 3a. In Fig. 3b, the class prediction process is shown, based on angular distance within a unit hypersphere. Lastly, Fig. 3c describes the probable class selection process by finding the vector with the least magnitude across multi-hyperspherical manifolds. As shown in Fig. 4a.i, the cross-entropy loss facilitates class feature separation, leaving intermixed features that affect prediction confidence due to lack of discriminability. Conversely, angular-softmax losses, introducing angular-margin penalties to enhance cosine similarity among embeddings, aiming separation and discriminability still causes inter-mixed feature representations (depicted via Fig. 4a.ii). HyperSpaceX framework with DistArc loss, presents a solution by distributing features across various angles on multiple hyperspheres, achieving better separation and discriminability by integrating both angular and radial dimensions. This approach results in a more distinct feature arrangement between classes, as demonstrated in Fig. 4a.iii), indicating the effectiveness of DistArc loss in creating a more discriminable and separable feature space.", + "bbox": [ + 212, + 252, + 787, + 555 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 579, + 444, + 597 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The experimental approach is designed to analyze the distribution of features in the latent space across various image classification and face recognition tasks. We have trained and tested the proposed HyperSpaceX framework on well-known benchmark datasets: (a) seven image classification datasets including MNIST [4], FashionMNIST [32], CIFAR-10 [11], CIFAR-100 [11], CUB-200 [27], TinyImageNet [13] and ImageNet-1K [2], and (b) six face recognition datasets including LFW [10], CFP-FP [23], AgeDB-30 [18], CA-LFW [37], CP-LFW [36] datasets (CASIA-WebFace [33] is used for initial model training). Model is also trained on 1500 subjects of D-LORD [17] dataset and tested on 600 different test subjects. Implementation Details: The HyperSpaceX framework undergoes training using various deep neural network backbones, including the iResNet50 architecture [6], [9], the ViT and RN101 backbones [5] from the CLIP foundation model [20]. The models are trained using DistArc loss and several variants of softmax-based loss functions, including Cross-entropy, CosFace and ArcFace loss, and also with Orthogonal projection loss. For image classification, the model", + "bbox": [ + 212, + 612, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/f4fc35a92fc53e9bba9b05dff9b90ad175b4b700f27bb1127cc5ef2a916a67e8.jpg", + "image_caption": [ + "Fig. 4: (a) Illustrating comparative visual analysis of the organization of MNIST class feature distribution in the latent space. The feature representations are learned using (i) Cross-entropy loss, (ii) ArcFace loss, and (iii) the proposed DistArc loss on the MNIST database, where each color represents a unique class. While (b) depicts the subclass organization of the CIFAR-100 dataset on 2D multi-hyperspherical manifolds. The color of each line denotes a distinct superclass, facilitating angular separability. Subclasses within each superclass are distinguished radially, with each superclass represented as blobs extending radially from the superclass center." + ], + "image_footnote": [], + "bbox": [ + 222, + 162, + 326, + 251 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/42bae49df832fb3b150abf2f85dfbf27ca6e3cb6d9bb95e3cc6c3ec843a5923b.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 333, + 164, + 442, + 250 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/c3ca6b44ac613349df8846afd0351573918789a9fa6a14ff8dcdf538e7ea30d7.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 452, + 164, + 558, + 251 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/0be716b039d77716bd6f0a9f8cc987719365d54560a99aa5739f16c87ef84c77.jpg", + "image_caption": [ + "(b)" + ], + "image_footnote": [], + "bbox": [ + 593, + 143, + 736, + 252 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "undergoes both training and testing in a classification setting. We train models for small-class simple datasets like MNIST and FashionMNIST with an SGD optimizer at a learning rate of $1e - 2$ and a weight decay of $5e - 4$ . We further set the value of $m = 0.4$ and $\\lambda = 0.003$ in the DistArc loss components. For complex datasets like CIFAR-10, CIFAR-100, CUB-200 and TinyImageNet, the value of $\\lambda$ is set to 0.005. Other hyperparameters remain the same. For face recognition, the training is conducted by employing a classification setup, while during testing, face verification is performed using image pairs with class-set disjoint from training. In the face recognition task, the training is performed on the CASIA-WebFace dataset in the classification setting and testing is performed in the verification setup on LFW, CFP-FP, AgeDB-30, CA-LFW and CP-LFW datasets. The SGD optimizer with a learning rate of $1e - 3$ and weight decay of $5e - 4$ is utilized for both the classifier and backbone network. However, in this task $\\lambda$ is varied based on the number of epochs. We initialize by setting $\\lambda$ to 0.001 and increasing it by an addition of 0.001 after every tenth epoch and stop updating after reaching the value of 0.005.", + "bbox": [ + 212, + 419, + 787, + 660 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Results and Analysis", + "text_level": 1, + "bbox": [ + 215, + 685, + 455, + 702 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Image Classification Results: We first present the results pertaining to how class features are organized across a range of embedding sizes, from low (2D) to high (512D) and very high (2048D) dimensions, distributed across radial-hyperspherical manifolds. Table 1 showcases the performance on multi-class datasets like CIFAR-100 [11] and TinyImageNet [13], achieved by employing different backbone architectures trained with a variety of loss functions. This highlights the effectiveness of our HyperSpaceX framework, which utilizes DistArc loss for training. This method enhances class distinctiveness, typically outper", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "HyperSpaceX", + "bbox": [ + 638, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/12783c337c7741c1f91ae4ae924e3816a8451f4a2346ef1b08ece482b18439fe.jpg", + "table_caption": [ + "Table 1: Performance comparison (accuracy in %) on image classification task between the proposed DistArc and other loss functions utilized for training models with multiple backbones. The best and second best performances are bolded and underlined." + ], + "table_footnote": [], + "table_body": "
CIFAR-100Tiny-Imagenet
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArcCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]47.1251.4846.9245.2062.0614.0316.0313.7817.7320.89
RN101 [20]37.8436.0235.1238.8553.9517.9616.2218.1020.5532.97
ViT-B [20]58.3656.2753.9657.0477.9337.5842.9436.2536.4954.11
ViT-L [20]67.8966.4463.8166.2779.5645.9344.0649.3446.2068.21
512iResNet50 [6]83.0580.2280.0181.2881.6261.8360.0258.3963.0663.27
RN101 [20]69.3970.8468.3769.1175.5853.0453.0151.7752.8554.40
ViT-B [20]81.9981.5879.4680.9282.6278.3874.2272.6174.4276.03
ViT-L [20]88.7587.2785.4084.8389.4886.4985.5581.8485.9486.79
2048iResNet50 [6]85.2284.2986.8286.1489.1061.3963.9262.4062.7164.20
RN101 [20]79.4078.1577.0678.2280.3754.1353.2853.8754.1059.06
ViT-B [20]81.0479.3379.2980.7283.0079.5478.3779.2677.0080.37
ViT-L [20]87.5985.9384.7490.2090.2085.0381.3982.4886.0486.94
", + "bbox": [ + 233, + 199, + 772, + 369 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "forming models trained with conventional loss functions such as Cross-entropy, ArcFace, CosFace, and Orthogonal Projection Loss (OPL). These results also showcase that the DistArc loss leads to features with enhanced separability and discrimination due to its effective exploration of both radial and angular dimensions within each hyperspherical latent space. This approach results in a significant performance increase: in TinyImageNet classification tasks, we observe an increase of over $22\\%$ in 2D, around $1.44\\%$ in 512D, and $4.93\\%$ in 2048D spaces, when benchmarked against cross-entropy loss and various softmax-angular margin-based loss functions. A similar trend of substantial improvement is observed for the CIFAR-100 dataset, showing improvements of up to $19.57\\%$ in 2D, $6.19\\%$ in 512D, and $2.61\\%$ in 2048D spaces.", + "bbox": [ + 212, + 398, + 794, + 566 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Fig. 4b illustrates the subclass and class-based feature distribution for CIFAR-100 categories, arranging each subclass angularly within its superclass group across different radial spaces. This setup enhances radial separability for subclasses and angular separability for superclasses, leading to clear distinctions between them. Furthermore, subclasses are compactly positioned according to their radial and angular coordinates, showcasing precise class feature discrimination. This organized feature distribution demonstrates the capability for a more defined feature arrangement, optimizing representation in lower-dimensional spaces and simplifying model complexity. Consequently, Fig. 4b uses color differentiation to distinguish between unrelated classes, while same-colored points on different radii indicate subclasses belonging to the same superclass, thereby facilitating a methodical learning of class arrangements in multi-radial spaces for refined differentiation between classes and their subclasses.", + "bbox": [ + 212, + 566, + 789, + 762 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The results for the CUB-200 dataset [27], a large multi-class image classification challenge focusing on bird categorization, are shown in Table 2. Classifying images in the CUB-200 dataset is particularly demanding due to the subtle, unique features each bird species has, despite the commonality of features like beaks and wings. This demands an emphasis on fine-grained, distinct characteris", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/9a94112e60d68806b8804a9394d0cc35efc8c22afa21c14e10203a35d890284c.jpg", + "table_caption": [ + "Table 2: Comparative performance (accuracy in %) analysis on CUB-200 dataset between proposed DistArc and other loss functions used for training models with multiple backbones. The best and second best performances are bolded and underlined." + ], + "table_footnote": [], + "table_body": "
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]7.506.197.0711.5918.09
RN101 [20]11.4410.4711.4212.8431.50
ViT-B [20]18.7020.6319.0417.0625.93
ViT-L [20]25.4822.8524.1927.7748.11
512iResNet50 [6]61.2963.4760.2962.8370.48
RN101 [20]51.4050.8550.1154.2658.44
ViT-B [20]67.9368.7068.1870.3676.06
ViT-L [20]80.7978.2779.6680.6583.28
", + "bbox": [ + 250, + 199, + 756, + 321 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/762bd411bc1ad0f46b876fa3e8d8f7303b9ac9c8ea5d19106dc9a6f785e10d6a.jpg", + "table_caption": [ + "Table 3: Evaluating model performance (accuracy in%) using conventional and proposed predictive measures in the HyperSpaceX framework when trained using DistArc loss on backbones with 512-D embedding size. The best performances are bolded." + ], + "table_footnote": [], + "table_body": "
BackboneCIFAR-100CUB-200TinyImageNet
Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)
iResNet50 [6]80.2981.6269.5670.4861.9363.27
RN101 [20]71.0575.5858.1958.4454.3354.43
ViT-B [20]78.9982.6274.9176.0676.1076.03
ViT-L [20]88.2089.4882.8583.2882.5186.79
", + "bbox": [ + 233, + 393, + 771, + 470 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "ties of different bird body parts when developing bird image classification models. In such challenging scenario, as shown in Table 2, the HyperSpaceX framework outperforms existing methods. Models trained with DistArc loss achieved a significant performance boost of approximately $20.34\\%$ using a ViT-L backbone with a 2D last embedding layer. Additionally, DistArc loss trained models excelled in higher-dimensional latent spaces. This success is attributed to our approach's adeptness in discriminately mapping various bird class features across distinctively separated radii and angles in a multi-hyperspherical space, while simultaneously compacting features within the same bird class.", + "bbox": [ + 215, + 503, + 784, + 638 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Reduced Latent Space Representation: Table 1 and Table 2 represent the performance on several backbones having the last embedding layer of size 2. It signifies that on complex datasets such as CIFAR-100, CUB-200 and TinyImageNet, the proposed radial-angular feature learning approach in a 2-D latent space achieves a performance boost of $16\\%$ to $20\\%$ over traditional cross-entropy loss methods even with large number of classes. Experimental results on the CUB-200 dataset also depict the high separability among various low-variance classes. Quantitatively, we can deduce that while dimensionality reduction for large complex datasets from a higher dimension of 512 and 2048 to the lower dimension of 2 embedding space, cross-entropy loss observes a $40 - 42\\%$ performance gap while DistArc loss successfully reduced this disparity to $20 - 24\\%$ .", + "bbox": [ + 215, + 642, + 785, + 806 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Predictive Measures Analysis: In the Image classification task, the class predictions are generally made utilizing the model's classification layer, adopted for", + "bbox": [ + 215, + 809, + 784, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "HyperSpaceX", + "bbox": [ + 637, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/35cb5e787bde808b3cb9edb8168447c48d192a329f58f0d6683d4a574c31ea81.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 289, + 152, + 416, + 248 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/672278872e3c7d71a16c5f43a2b6b97f15cd19390b23cca23aca0949d75dbd4b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 436, + 154, + 563, + 247 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/b4c53e5e32023ab3aeedaa08b25bc09c01c8e29b3e4719b93ab6837362761dcc.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 581, + 154, + 709, + 247 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/f06f2b44c000d1dd2af7875ec9586066fe0c2d95f85f6da74ecfdf3d09f664a1.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 287, + 253, + 428, + 320 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/d65979d87cd3e7dd0e3a09824823769a884508183f5bef1a9687fc30f2525937.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 433, + 252, + 570, + 321 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/aa20bea31c157fb07f635a706ab6ba531299a863814b22be422a843d1e8d4df3.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 578, + 253, + 710, + 321 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/c32f31328fb5c87fb11a05dad0b3b895a1b72637c2bd88b598bc801cd9dad7ef.jpg", + "image_caption": [ + "Fig. 5: Analysis of loss functions using small-class simple datasets (a) MNIST and (b) FashionMNIST, and complex dataset (c) CIFAR-10. The first row visualizes the features, showcasing the outcomes of learning with DistArc loss over 2D multi-spherical manifolds. The last two rows illustrate classification performance of different backbones with a 2-D and 512-D embedding sizes, trained using Cross-entropy and DistArc loss." + ], + "image_footnote": [], + "bbox": [ + 285, + 324, + 428, + 397 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/adcc695b6d815e3c6ac330851c7911c97841c895bae5d39c8683cbb9578dc708.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 431, + 324, + 568, + 397 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/8da0f7e560de343dce767201fb36fc8f9f54b4e2d83e0bb683a36f8048dcb895.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 578, + 324, + 712, + 397 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "models trained with various existing loss functions except for DistArc loss, for results presented in Table 1 and Table 2. The proposed DistArc loss, the predictions are computed using the newly introduced radial-angular based predictive measure defined in section 3. The comparison of utilizing traditional and proposed predictive measures in the HyperSpaceX framework is shown via Table 3. From the outperforming results shown, it can be analyzed that the proposed radial-angular-based predictive measure is effective over the conventional approach of predictions from the final classification layer for models trained using DistArc loss due to different radii of classes.", + "bbox": [ + 212, + 515, + 787, + 651 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Performance of HyperSpaceX on a Large-Scale Image Dataset: Table 4 provides the details the performance of the proposed framework after finetuning on the ImageNet-1K dataset [2]. We observe that the proposed DistArc loss outperforms existing methods for embedding sizes of 32 and 128. It also achieves the second-highest performance at 512 dimensions. As the number of classes grows, ArcFace finds it difficult to manage many feature points on a unit hypersphere. This demonstrates the benefit of strategically arranging features in a multi-radial hyperspherical space using DistArc loss during model training.", + "bbox": [ + 212, + 654, + 787, + 776 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "HyperSpaceX Performance on Datasets with Fewer Classes: Fig. 5 showcases the performance and feature visualization for MNIST, FashionMNIST, and CIFAR-10 datasets. The top row of Fig. 5 illustrates the 2D-latent space feature organization across multi-radial hyperspherical manifolds, highlighting the", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/669d9d297bd62a4f67a273814895ab61131174080208a1326be2465b245ddb7b.jpg", + "table_caption": [ + "Table 4: Classification Accuracy (%) Table 5: Ablation study of DistArc on ImageNet-1K dataset using iRes-loss, reporting classification performance [6]. The best and second best performance (in %) for various image classifi-cormances are bolded and underlined. fication datasets." + ], + "table_footnote": [], + "table_body": "
Embedding SizeCross EntropyArcFaceDistArcLoss ComponentsMNISTFashion-MNISTCIFAR-10
3248.2543.0555.91cos(θ)98.9793.6994.81
12865.1858.6265.30cos(θ) & cos(φ)98.9393.7295.16
51269.2759.6767.90cos(θ) & δ99.0194.8395.31
cos(θ) & cos(φ) & δ99.1995.0496.03
", + "bbox": [ + 241, + 212, + 767, + 280 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "strategic angular positioning. This arrangement emphasizes the significant distance between features of unrelated classes and the closeness of features within the same class, facilitating accurate class predictions. The subsequent rows display a comparison of classification accuracy across different models trained using cross-entropy and DistArc loss functions in 2D and 512D latent spaces. These findings illustrate the superior performance of the HyperSpaceX framework across both simple (MNIST, FashionMNIST) and more complex (CIFAR-10) datasets with a smaller number of classes.", + "bbox": [ + 212, + 309, + 787, + 430 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Training Convergence Analysis: The training convergence rates of the DistArc loss were benchmarked against existing loss functions. Training with softmax cross-entropy loss shows only a slight decrease in loss values. In contrast, DistArc loss significantly restructures the feature space layout by dispersing identities across various radial hyperspheres. This approach leads to higher initial loss figures that efficiently reduce to a minimum of 0.22, surpassing the reduction achieved with softmax cross-entropy (0.34), CosFace (2.31), ArcFace (1.51), and OPL (0.68) loss functions. A detailed comparison illustrating the training convergence rates of loss functions is available in the supplementary file.", + "bbox": [ + 212, + 430, + 789, + 566 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablatic Analysis of DistArc: Table 5 shows the ablation analysis on three image classification datasets, MNIST, FashionMNIST, and CIFAR-10, while utilizing ViT-B architecture (embedding size 512). The first and second row of Table 5 shows the efficacy of performance improvement over angular separation through $\\theta$ and $\\phi$ , and the third row shows the improvement with radial and angular factors due to $\\delta$ and $\\theta$ terms. While, the last row shows the highest performance achieved by including all $\\theta$ , $\\phi$ and $\\delta$ components into the loss formulation, highlighting the importance of each component.", + "bbox": [ + 212, + 566, + 787, + 688 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Face Recognition Results: Table 6 showcases detailed comparative results of the DistArc loss against other loss functions in face recognition tasks. Utilizing the iResNet50 architecture and training on the CASIA-WebFace dataset, we have evaluated verification performance with a 512-dimensional embedding. The DistArc loss demonstrates state-of-the-art (SoTA) results on LFW and CP-LFW datasets and near state-of-the-art results on other datasets. Additionally, experiments with the iResNet50 backbone on the MS1Mv2 dataset—a derivative of the now-withdrawn MS-Celeb dataset—were conducted to ensure a fair comparison with SoTA methods are included in supplementary materials. The DistArc loss trained model achieved following results: $99.82\\%$ on LFW and $98.21\\%$ on AgeDB", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "HyperSpaceX", + "bbox": [ + 637, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/9b9bac3a76e79c93cb8cf8cea6a442700d7bdf0e32783cfa1c384afc6bc34635.jpg", + "table_caption": [ + "Table 6: Quantitative results (in %) of face recognition models trained using different loss functions. The best and second best performances are bolded and underlined." + ], + "table_footnote": [], + "table_body": "
LossLFWCFP-FPAgeDB-30CA-LFWCP-LFW
Triplet98.9891.9089.98--
Center loss [30]99.28--85.4877.48
Softmax99.0894.3992.3388.1784.85
Norm-Softmax98.5689.7988.72--
SphereFace [16]99.1194.3891.7092.5590.90
CosFace (m=0.35) [28]99.1095.4492.9892.8391.03
ArcFace (m=0.45) [3]99.4695.4794.9392.4790.85
SphereFace2 [29]99.50-93.6893.4791.07
DistArc (m=0.4)99.5495.4194.0393.3291.10
", + "bbox": [ + 277, + 184, + 728, + 330 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "30, surpassing results from SphereFace, CosFace, ArcFace, and SphereFace2 $^3$ . These findings highlight the HyperSpaceX framework's proficiency in crafting highly discriminative and distinct features within the latent space.", + "bbox": [ + 212, + 359, + 785, + 405 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The HyperSpaceX framework is also evaluated on the D-LORD [17] dataset, a large-scale open-set surveillance dataset with 600 test subjects, using a deep metric learning approach [19]. With ArcFace, a Rank-1 identification accuracy of $61.84\\%$ was achieved, while DistArc achieved $62.71\\%$ . For Rank-5 accuracy, the results were $65.89\\%$ and $66.03\\%$ , respectively, indicating that DistArc is more effective at learning enhanced discriminative features than ArcFace.", + "bbox": [ + 212, + 406, + 785, + 498 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 523, + 359, + 539 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this research, we introduce the HyperSpaceX framework, which navigates both angular and radial dimensions, facilitating a uniquely distinguishable and discernible arrangement of class features within multi-hyperspherical manifold space. This is achieved using the novel DistArc loss, which leverages the radial and angular components of the feature space. This loss function significantly enhances the cohesion among similar class features while concurrently maximizing the distances between different classes, resulting in more precise and discriminative feature representation. To evaluate the performance of this radial-angular framework, we introduce a predictive measure that utilizes the shortest resultant vector between the embeddings of test samples and proxy vectors, offering a deeper insight into the model's performance. The efficacy of HyperSpaceX is demonstrated through comprehensive experiments on seven image classification datasets and six face recognition datasets. The proposed methodology shows improvements in handling a diverse array of image and face datasets, ranging from simpler to more complex and large-scale collections encompassing several classes and samples.", + "bbox": [ + 212, + 558, + 787, + 801 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 13 + }, + { + "type": "page_footnote", + "text": "$^3$ SphereFace (LFW: 99.42%), CosFace (LFW: 99.73%), ArcFace (LFW: 99.82%, AgeDB30: 98.15%) and SphereFace2 (LFW: 99.50%, AgeDB30: 93.68%).", + "bbox": [ + 217, + 809, + 785, + 840 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Chiranjeev and Thakral received partial support from the PMRF Fellowship, and Vatsa is partially supported by the Swarnajayanti Fellowship.", + "bbox": [ + 215, + 176, + 782, + 205 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 229, + 321, + 244 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Conniffe, D.: Expected maximum log likelihood estimation. Journal of the Royal Statistical Society: Series D (The Statistician) 36(4), 317-329 (1987)", + "2. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009)", + "3. Deng, J., Guo, J., Xue, N., Zafeiriou, S.: Arcface: Additive angular margin loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4690-4699 (2019)", + "4. Deng, L.: The mnist database of handwritten digit images for machine learning research [best of the web]. IEEE signal processing magazine 29(6), 141-142 (2012)", + "5. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)", + "6. Duta, I.C., Liu, L., Zhu, F., Shao, L.: Improved residual networks for image and video recognition. In: Int. Conf. Pattern Recog. pp. 9415-9422. IEEE (2021)", + "7. Gallo, I., Nawaz, S., Calefati, A., Janjua, M.K.: Git loss for deep face recognition. In: Brit. Mach. Vis. Conf. p. 313. BMVA (2018)", + "8. Guo, G., Zhang, N.: A survey on deep learning based face recognition. Comput. Vis. Image Underst. 189, 102805 (2019)", + "9. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 770-778 (2016)", + "0. Huang, G.B., Mattar, M., Berg, T., Learned-Miller, E.: Labeled faces in the wild: A database for studying face recognition in unconstrained environments. In: Workshop on faces in Real-Life Images: detection, alignment, and recognition (2008)", + "1. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)", + "2. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Adv. Neural Inform. Process. Syst. 25 (2012)", + "3. Le, Y., Yang, X.: Tiny imagenet visual recognition challenge. CS 231N 7(7), 3 (2015)", + "4. LeCun, Y., Boser, B., Denker, J.S., Henderson, D., Howard, R.E., Hubbard, W., Jackel, L.D.: Backpropagation applied to handwritten zip code recognition. Neural computation 1(4), 541-551 (1989)", + "5. Li, L., Zhang, Y., Huang, A.: Learnable subspace orthogonal projection for semi-supervised image classification. In: ACCV. pp. 477-490. Springer (2022)", + "6. Liu, W., Wen, Y., Yu, Z., Li, M., Raj, B., Song, L.: Spherface: Deep hypersphere embedding for face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 212-220 (2017)", + "7. Manchanda, S., Bhagwatkar, K., Balutia, K., Agarwal, S., Chaudhary, J., Dosi, M., Chiranjeev, C., Vatsa, M., Singh, R.: D-lord: Dysl-ai database for low-resolution disguised face recognition. IEEE Trans. on Biom., Behav., and Ident. Sci. (2023)" + ], + "bbox": [ + 225, + 260, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "HyperSpaceX", + "bbox": [ + 637, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Moschoglou, S., Papaioannou, A., Sagonas, C., Deng, J., Kotsia, I., Zafeiriou, S.: Agedb: the first manually collected, in-the-wild age database. In: IEEE Conf. Comput. Vis. Pattern Recog. Worksh. pp. 51-59 (2017)", + "19. Oh Song, H., Xiang, Y., Jegelka, S., Savarese, S.: Deep metric learning via lifted structured feature embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4004-4012 (2016)", + "20. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Int. Conf. Mach. Learn. pp. 8748-8763. PMLR (2021)", + "21. Ranasinghe, K., Naseer, M., Hayat, M., Khan, S., Khan, F.S.: Orthogonal projection loss. In: Int. Conf. Comput. Vis. pp. 12333-12343 (2021)", + "22. Schroff, F., Kalenichenko, D., Philbin, J.: Facenet: A unified embedding for face recognition and clustering. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 815-823 (2015)", + "23. Sengupta, S., Chen, J.C., Castillo, C., Patel, V.M., Chellappa, R., Jacobs, D.W.: Frontal to profile face verification in the wild. In: Winter Conf. on App. of Comput. Vis. pp. 1-9. IEEE (2016)", + "24. Sermanet, P., Eigen, D., Zhang, X., Mathieu, M., Fergus, R., LeCun, Y.: Overfeat: Integrated recognition, localization and detection using convolutional networks. arXiv preprint arXiv:1312.6229 (2013)", + "25. Sohn, K.: Improved deep metric learning with multi-class n-pair loss objective. Adv. Neural Inform. Process. Syst. 29 (2016)", + "26. Sun, Y., Chen, Y., Wang, X., Tang, X.: Deep learning face representation by joint identification-verification. Adv. Neural Inform. Process. Syst. 27 (2014)", + "27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: Caltech-ucsd birds-200-2011 (cub-200-2011). Tech. Rep. CNS-TR-2011-001, California Institute of Technology (2011)", + "28. Wang, H., Wang, Y., Zhou, Z., Ji, X., Gong, D., Zhou, J., Li, Z., Liu, W.: Cosface: Large margin cosine loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5265-5274 (2018)", + "29. Wen, Y., Liu, W., Weller, A., Raj, B., Singh, R.: Spherical face classification is all you need for deep face recognition. In: Int. Conf. Learn. Represent. (2022)", + "30. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Eur. Conf. Comput. Vis. Springer (2016)", + "31. Wu, C.Y., Manmatha, R., Smola, A.J., Krahenbuhl, P.: Sampling matters in deep embedding learning. In: Int. Conf. Comput. Vis. pp. 2840-2848 (2017)", + "32. Xiao, H., Rasul, K., Vollgraf, R.: Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747 (2017)", + "33. Yi, D., Lei, Z., Liao, S., Li, S.Z.: Learning face representation from scratch. arXiv preprint arXiv:1411.7923 (2014)", + "34. Zeiler, M.D., Fergus, R.: Visualizing and understanding convolutional networks. In: Eur. Conf. Comput. Vis. pp. 818-833. Springer (2014)", + "35. Zhang, Z., Sabuncu, M.: Generalized cross entropy loss for training deep neural networks with noisy labels. Adv. Neural Inform. Process. Syst. 31 (2018)", + "36. Zheng, T., Deng, W.: Cross-pose lfw: A database for studying cross-posed face recognition in unconstrained environments. Beijing University of Posts and Telecommunications, Tech. Rep 5(7) (2018)", + "37. Zheng, T., Deng, W., Hu, J.: Cross-age LFW: A database for studying cross-age face recognition in unconstrained environments. CoRR abs/1708.08197 (2017)" + ], + "bbox": [ + 215, + 146, + 784, + 829 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Chiranjeev et al.", + "bbox": [ + 271, + 114, + 383, + 128 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_model.json b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_model.json new file mode 100644 index 0000000000000000000000000000000000000000..7f62603e9b59ddb926844c9092850ef2c945bd31 --- /dev/null +++ b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_model.json @@ -0,0 +1,2058 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.218, + 0.141, + 0.79, + 0.187 + ], + "angle": 0, + "content": "HyperSpaceX: Radial and Angular Exploration of HyperSpherical Dimensions" + }, + { + "type": "text", + "bbox": [ + 0.231, + 0.213, + 0.773, + 0.245 + ], + "angle": 0, + "content": "Chiranjeev Chiranjeev, Muskan Dosi, Kartik Thakral Mayank Vatsa and Richa Singh" + }, + { + "type": "text", + "bbox": [ + 0.288, + 0.256, + 0.717, + 0.299 + ], + "angle": 0, + "content": "Indian Institute of Technology Jodhpur, India {chiranjeev.1,dosi.1,thakral.1,mvatsa,richa}@iitj.ac.in https://github.com/IAB-IITJ/HyperSpaceX" + }, + { + "type": "image", + "bbox": [ + 0.277, + 0.311, + 0.727, + 0.427 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.436, + 0.788, + 0.52 + ], + "angle": 0, + "content": "Fig. 1: Visual concept of the proposed HyperSpaceX framework: It utilizes a novel radial-angular latent space on hyperspherical manifolds to differentiate features effectively. Initially, class features are indistinguishable due to overlap. The proposed DistArc loss exhibits two feature arrangement learning: high inter-class variation employing multi-radial angular arrangement and minimal intra-class distance, leading to highly separable-discriminable class features." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.537, + 0.741, + 0.801 + ], + "angle": 0, + "content": "Abstract. Traditional deep learning models rely on methods such as softmax cross-entropy and ArcFace loss for tasks like classification and face recognition. These methods mainly explore angular features in a hyperspherical space, often resulting in entangled inter-class features due to dense angular data across many classes. In this paper, a new field of feature exploration is proposed known as HyperSpaceX which enhances class discrimination by exploring both angular and radial dimensions in multi-hyperspherical spaces, facilitated by a novel DistArc loss. The proposed DistArc loss encompasses three feature arrangement components: two angular and one radial, enforcing intra-class binding and inter-class separation in multi-radial arrangement, improving feature discriminability. Evaluation of HyperSpaceX framework for the novel representation utilizes a proposed predictive measure that accounts for both angular and radial elements, providing a more comprehensive assessment of model accuracy beyond standard metrics. Experiments across seven object classification and six face recognition datasets demonstrate state-of-the-art (SoTA) results obtained from HyperSpaceX, achieving up to a \\(20\\%\\) performance improvement on large-scale object datasets in lower dimensions and up to \\(6\\%\\) gain in higher dimensions." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.812, + 0.744, + 0.839 + ], + "angle": 0, + "content": "Keywords: Representation Learning \\(\\cdot\\) Image Classification \\(\\cdot\\) Face Recognition" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.375, + 0.161 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.18, + 0.788, + 0.346 + ], + "angle": 0, + "content": "The advancement in image classification and face recognition has greatly benefited from the introduction of innovative loss functions, designed to better differentiate between class features. These functions are crafted to learn unique representations for each class by employing proxies or weight vectors to increase the distinction between classes. Traditional image classification techniques [14], [12], [24], [34] primarily rely on cross-entropy loss [1], [35] to create intricate class boundaries and improve model generalization. However, a common limitation of these approaches is their tendency to neglect the reduction of within-class feature distances while failing to adequately separate features between different classes. This results in the blending of feature points from dissimilar classes, thus leading to reduced accuracies in object classification and face verification tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.347, + 0.788, + 0.679 + ], + "angle": 0, + "content": "To address this gap, several modifications to softmax-based loss functions have been introduced, utilizing proxy-based methods to cluster similar class features while concurrently expanding the separation between dissimilar ones within the latent space. For face recognition, existing approaches [3], [8], [16], [26], [28] leverage proxy-based objectives to achieve better feature separability on a hypersphere through angular dimensions. Methods such as SphereFace [16], [29] and ArcFace [3] introduce angular margins to promote large-margin discriminative feature learning, while CosFace [28] incorporates marginal cosine functions to modify softmax loss by equalizing radial variations, introducing a cosine margin for angular decision boundaries. Furthermore, face recognition has benefited from proxy-free training strategies that focus on deep metric learning techniques [19], [22], [25], [31]. These strategies generate embeddings that bring similar faces closer together while keeping dissimilar ones apart, adapting effectively to various conditions without the need for explicit class labels. However, methods like triplet learning [22] and contrastive loss [31] depend heavily on the availability of extensive image pairs or triplets for effective training and often face difficulties with hard-pair mining. Other discriminative loss functions like Center loss [30] and Git loss [7] encounter difficulties in updating class center parameters with a large identity count, adding computational cost. Orthogonal Projection Loss (OPL) [21] and Learnable Subspace Orthogonal Projection [15] employ orthogonal projection constraints to improve separability between classes, but this approach restricts the number of classes to \\( 2^d \\) in d-dimensional space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.68, + 0.788, + 0.815 + ], + "angle": 0, + "content": "The limitations of traditional loss functions, including those modified for angular space, have led to challenges in effectively differentiating between features. The issue occurs when features of closely related classes overlap, causing uncertainties in the correct identification or classification of subjects1. This overlap of class features makes it difficult to discern between unique identities or classes, thereby impacting the overall performance. To overcome these limitations, we propose the HyperSpaceX framework, a novel approach that extends the exploration of feature space beyond the angular to include radial dimensions in multi-hyperspherical latent spaces. It introduces a loss function that emphasizes" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.458, + 0.84 + ], + "angle": 0, + "content": "It is further analyzed in section 3" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.638, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "HyperSpaceX" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "the arrangement of features to increase inter-class separability and intra-class compactness. Through the effective combination of angular and radial organization of features, the framework aims to minimize the overlap among inter-class data points, presenting a novel discriminative feature representation approach for image classification and face recognition. The key highlights are:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.242, + 0.791, + 0.287 + ], + "angle": 0, + "content": "1. Introducing HyperSpaceX, a novel discriminative feature representation and arrangement learning that explores both radial and angular dimensions within multi-hyperspherical spaces, enabling effective feature learning." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.29, + 0.788, + 0.349 + ], + "angle": 0, + "content": "2. Developing the DistArc loss function, aimed at enhancing the discriminative power of deep learning models. It improves feature representation by promoting better separation between different classes and tighter clustering of features within the same class in the latent space." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.352, + 0.788, + 0.412 + ], + "angle": 0, + "content": "3. Presenting a predictive measure to evaluate the model's performance, incorporating both radial and angular dimensions in multi-hyperspherical settings. This measure provides a more comprehensive understanding of the model's capabilities in handling complex feature distributions." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.414, + 0.788, + 0.505 + ], + "angle": 0, + "content": "4. Evaluating the proposed approach using seven object datasets (MNIST, FashionMNIST, CIFAR-10, CIFAR-100, CUB-200, TinyImageNet and ImageNet1K) and six face datasets (LFW, CFP-FP, AgeDB-30, CA-LFW, CP-LFW and D-LORD), showing its effectiveness in improving feature distinction and model accuracy across various data types and complexities, often achieving state-of-the-art results." + }, + { + "type": "list", + "bbox": [ + 0.223, + 0.242, + 0.791, + 0.505 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.54, + 0.546, + 0.558 + ], + "angle": 0, + "content": "2 The HyperSpaceX Framework" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.789, + 0.841 + ], + "angle": 0, + "content": "In traditional hyperspherical angular latent spaces, identities or classes are delineated by distinct angular directions. However, with the increase in the number of classes and the volume of data for each class, overlaps and intersections in these class representations increases, leading to significant classification challenges, as they blur the distinction between different classes. To address the issue of feature overlap and the necessity for more defined class distinctions, we propose the HyperSpaceX framework. This framework utilizes a multi-hyperspherical space, drawing on both radial hyperspheres and angular dimensions to promote a discriminative distribution of class features. This learnable arrangement distribution is facilitated by the novel DistArc loss that significantly enhances class differentiation and separation along with the grouping of same-category features. DistArc strategically arranges features by considering both their angle and distance from the center, across various spherical layers. This method utilizes the diversity of spatial dimensions to establish clear and distinct areas within the spherical model, making it easier to define precise boundaries between classes. Such a multi-dimensional approach generates a more elaborate hyperspherical subspace, facilitating the creation of more efficient decision boundaries." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.373, + 0.16 + ], + "angle": 0, + "content": "2.1 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.174, + 0.788, + 0.53 + ], + "angle": 0, + "content": "Deep learning research has explored a variety of loss functions, among which Cross-entropy loss is most commonly used for classification tasks. Let \\( x_{i} \\) and \\( \\omega \\) be the feature embedding and weight or proxy matrix, respectively. Cross-entropy loss is defined as \\( L_{\\mathrm{CE}} = -\\frac{1}{N}\\sum_{i=1}^{N}\\log\\frac{e^{\\omega_T x_i + by_i}}{\\sum_{j=1}^{K}e^{\\omega_T x_j + bj}} \\). Here, \\( \\omega_{y_i} \\) signifies the proxy vector of the \\( y_{i} \\)-th class. The term \\( b \\) refers to the bias, \\( N \\) represents the number of samples distributed over \\( K \\) number of classes. This function calculates the expected loss between the predicted and actual class distributions, focusing on optimizing class separations without necessarily bringing similar class features closer or significantly distancing different classes. Such limitations can adversely affect image classification and face recognition performance, particularly under high intra-class variations. There have been attempts to enhance inter-class distinctions through loss functions like Orthogonal Projection Loss (OPL) [21], which introduces perpendicular margins between class features. However, these efforts are often overshadowed by the dominance of cross-entropy in optimization processes. Softmax-based losses, including those used in deep face recognition like SphereFace [16] [29], CosFace [28] and ArcFace [3], primarily rely on cross-entropy based formulation. Among these is ArcFace loss, one of the most popular angular-loss functions, which distinguishes itself by allocating features around class proxies within a hyperspherical space and applying an angular margin \\( m \\) to enhance the cohesion within classes and the distinction between different classes. The mathematical formulation of ArcFace loss is represented as \\( L_{\\mathrm{ArcFace}} = -\\frac{1}{N}\\sum_{i=1}^{N}\\log\\frac{e^{\\cos(\\theta_{y_i} + m)}}{e^{\\cos(\\theta_{y_i} + m)} + \\sum_{j=1,j \\neq y_i}^{K}e^{\\cos\\theta_j}} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.53, + 0.788, + 0.62 + ], + "angle": 0, + "content": "In this, \\( \\cos\\theta \\) is calculated using cosine similarity between feature embedding \\( x \\) and proxy \\( \\omega \\), that is defined by computing a dot product between unit vectors of \\( x \\) and \\( \\omega \\) as represented through \\( \\cos(\\theta_{y_i}) = \\hat{x}_i \\cdot \\hat{\\omega}_{y_i} \\cos(\\theta_j) = \\hat{x}_i \\cdot \\hat{\\omega}_j \\). However, focusing solely on angular dimensions can lead to ambiguity among classes in densely populated identity spaces, highlighting a need for broader exploration beyond angular metrics." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.644, + 0.454, + 0.658 + ], + "angle": 0, + "content": "2.2 Proposed DistArc Loss" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.671, + 0.787, + 0.716 + ], + "angle": 0, + "content": "The proposed DistArc loss navigates through radial and angular dimensions across multiple hyperspheres centered at the origin to improve class discrimination. The DistArc loss is formulated as," + }, + { + "type": "equation", + "bbox": [ + 0.29, + 0.728, + 0.787, + 0.77 + ], + "angle": 0, + "content": "\\[\nL _ {\\text {D i s t A r c}} = - \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\log \\frac {e ^ {\\cos \\left(\\theta_ {y _ {i}} + m\\right) + \\cos \\left(\\phi_ {y _ {i}}\\right) - \\lambda \\delta_ {y _ {i}}}}{e ^ {\\cos \\left(\\theta_ {y _ {i}} + m\\right)} + \\sum_ {j = 1 , j \\neq y _ {i}} ^ {K} e ^ {\\cos \\left(\\theta_ {j}\\right) - \\lambda \\delta_ {j}}} \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "where \\(\\lambda\\) represents the weighing factor and \\(\\cos \\theta\\) defines the cosine of angle between embedding \\(x\\) and a proxy vector \\(\\omega\\). An angular-margin penalty of \\(m\\) is introduced in \\(\\cos \\theta\\) to enhance the feature discriminability. Fig. 2a represents the geometric illustration of \\(\\cos (\\theta_{y_i} + m)\\). The DistArc loss minimizes the angle" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.638, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "HyperSpaceX" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.35, + 0.145, + 0.453, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.388, + 0.228, + 0.405, + 0.24 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.454, + 0.144, + 0.564, + 0.228 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.567, + 0.147, + 0.657, + 0.222 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.5, + 0.228, + 0.516, + 0.239 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.604, + 0.228, + 0.619, + 0.239 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.254, + 0.788, + 0.325 + ], + "angle": 0, + "content": "Fig.2: The geometric interpretation of angular and radial formations in multihyperspherical dimensions in the training phase through (a) \\(\\theta\\) and angular-margin penalty \\(m\\), and (b) angle \\(\\phi\\) between scaled proxy vector \\(\\omega_{y_i}\\) and resultant vector \\(R\\). (c) Shows the vector representation of \\(R\\) and \\(\\omega_{y_i}\\) in a reverse direction for computing angle \\(\\phi\\) using cosine of an angle \\(\\phi\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.354, + 0.789, + 0.658 + ], + "angle": 0, + "content": "\\(\\theta_{y_i}\\), thereby increasing the cosine similarity between embeddings \\(x_i\\) and their corresponding proxy's \\(\\omega_{y_i}\\). However, to include the radial dimension also we incorporate the \\(\\cos \\phi_{y_i}\\) which represents the cosine of angle between radii scaled proxy vector \\(\\omega_{r_y_i}\\) and a resultant vector \\(R_{y_i}\\) of \\(\\omega_{r_y_i}\\) and \\(x_i\\). Fig. 2b describes the geometric representation of the resultant vector \\(R_{y_i}\\). \\(R_{y_i}\\) is modified while learning/training such that it minimizes the angle between \\(R_{y_i}\\) and \\(\\omega_{r_y_i}\\) which is defined using \\(\\omega_{r_y_i} = \\hat{\\omega}_{y_i} \\times r_y_i\\) and \\(R_{y_i}\\) is defined as \\(R_{y_i} = -\\omega_{r_y_i} + x_i\\). Here, \\(R_{y_i} \\in \\mathbb{R}^d\\), \\(\\omega_{r_y_i} \\in \\mathbb{R}^{d \\times 1}\\), and \\(x_i \\in \\mathbb{R}^d\\). The resultant vector helps to maintain the embedding magnitude within the hyperspherical radii of magnitude \\(||\\omega_{r_y_i}||_2\\) and further optimizes the embeddings \\(x_i\\)'s to cluster in the angular direction by minimizing the angle \\((\\phi_{y_i})\\) between \\(R_{y_i}\\) and \\(\\omega_{r_y_i} \\colon \\cos (\\phi_{y_i}) = \\hat{R}_{y_i} \\cdot -\\hat{\\omega}_{r_y_i}\\). This equation, while calculating the \\(\\cos \\phi_{y_i}\\), the origin is taken at \\(\\hat{\\omega}_{r_y_i}\\) which results \\(\\hat{\\omega}_{r_y_i}\\) vector to be in reverse direction leading to \\(-\\hat{\\omega}_{r_y_i}\\). We can visualize its vector representation from Fig. 2c representing the angle computation process between the reversely directed scaled proxy vector \\(\\omega_{r_y_i}\\) and a resultant vector \\(R_{y_i}\\). The term \\(\\cos \\phi_{y_i}\\) within the proposed loss function \\(L_{DistArc}\\) is designed to enhance the intra-class compactness of features with their respective scaled class proxies, \\(\\omega_{r_y_i}\\) by optimizing both the radial and angular dimensions of different hyperspheres. This term also has a major significance in letting the distribution of each class to stay within particular radii hyperspheres in the feature space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.79, + 0.78 + ], + "angle": 0, + "content": "Through DistArc loss, the \\(\\cos \\theta_{y_i}\\) optimizes to align the embeddings with class proxies \\(\\omega_{y_i}\\) in the angular space and \\(\\cos \\phi_{y_i}\\) optimizes to increase the compactness among embeddings and their respective scaled proxies \\(\\omega_{r_{y_i}}\\). It also ensures that the length of embeddings does not extend beyond their radial space \\(r_i\\); further, minimizes the angle between normalized resultant vector \\((\\hat{R}_{y_i})\\) and normalized scaled proxy \\((\\hat{\\omega}_{r_{y_i}})\\) to bring closer the embeddings at the point of scaled proxy, \\(\\omega_{r_{y_i}}\\) in the angular space. The overall geometric interpretation of DistArc loss during the training phase is shown in Fig. 2b." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.789, + 0.842 + ], + "angle": 0, + "content": "In the proposed DistArc loss, \\(\\delta_{y_i}\\) act as a pulling force to attract embeddings \\(x_{i}\\) towards \\(\\omega_{r_{y_i}}\\). This loss component optimizes to shift the distribution of each class towards the scaled proxies \\(\\omega_{r_{y_i}}\\) in the radial space, leading to an increase in the embedding's magnitude. Leading to the enhancement of intra-class compact-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.271 + ], + "angle": 0, + "content": "ness, \\(\\delta_{j}\\) in the denominator of the loss function, helps to distant the \\(x_{i}\\)'s away from other scaled proxies \\(\\omega_{r_j}\\)'s excluding \\(\\omega_{r_{y_i}}\\). The overall combination of \\(\\delta_{y_i}\\) and \\(\\delta_{j}\\) increases the inter-class distance between dissimilar class scaled proxies and embeddings while decreasing the intra-class distance between similar class scaled proxy and embeddings. The \\(\\delta_{y_i}\\) term is defined using, \\(\\delta_{y_i} = \\| \\omega_{r_y_i} - x_i\\| _2^2\\) and in case when \\(j\\neq y_{i}\\), \\(\\delta_{j} = \\| \\omega_{r_{j}} - x_{i}\\|_{2}^{2}\\). A negative (-) sign is used in the \\(\\delta\\) component of loss Eq. 1 to maximize the logarithmic distribution overall and subsequently minimize the DistArc loss." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.293, + 0.755, + 0.325 + ], + "angle": 0, + "content": "2.3 Analytical Ablation of DistArc Loss and Inductive Bias for HyperSpaceX Framework" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.334, + 0.789, + 0.65 + ], + "angle": 0, + "content": "In the proposed DistArc loss, the first component \\(\\cos (\\theta_{y_i} + m)\\) represents the cosine of the angle \\(\\theta_{y_i}\\) between \\(\\omega_{y_i}\\) and \\(x_i\\), incorporating an additional penalty \\(m\\) for the angular margin applied to angle \\(\\theta_{y_i}\\), to strengthen coherence within the class while increasing differentiation between different classes. The second term, \\(\\cos \\phi_{y_i}\\), calculates the angle between the scaled proxy \\(\\omega_{r_{y_i}}\\) and its corresponding resultant vector \\(R_{y_i}\\). This can be expressed as the dot product between the two vectors: \\(\\omega_{r_{y_i}}\\) in reverse direction and \\(R_{y_i}\\). This aims to minimize the angle \\(\\phi_{y_i}\\), ensuring that feature points remain close to their scaled proxies and do not extend beyond the boundaries of their respective radial hyperspheres. The last two terms, \\(\\delta_{y_i}\\) and \\(\\delta_j\\), help to shift the features to their corresponding scaled proxy \\(\\omega_{r_{y_i}}\\) points over different radii hyperspheres and diverging \\(x_i\\) features from different class proxies \\(\\omega_{r_j}\\)'s. It ensures inter-class separability in the radial direction across multi-hyperspherical manifolds. The \\(\\delta_{y_i}\\) term also results in the tighter clustering of class features around their respective \\(\\omega_{r_{y_i}}\\) leading to high class discrimination. The combined importance of the components \\(\\cos \\theta_{y_i}\\) and \\(\\cos \\phi_{y_i}\\) manifests itself in the minimization of angles \\(\\theta\\) and \\(\\phi\\), using a more concentrated angular distribution of features aligning to the corresponding class proxies. Further, it prevents features from extending beyond their respective class radii. The loss's additional \\(\\delta\\) component contributes to the compact clustering and length amplification of \\(x_i\\) vectors, shifting them to specific hypersphere radii\\(^2\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.652, + 0.79, + 0.698 + ], + "angle": 0, + "content": "Additionally, in the context of HyperSpaceX framework, the inductive bias effectively shapes the decision boundaries based on both radial and angular factors. We define the decision boundary as," + }, + { + "type": "equation", + "bbox": [ + 0.298, + 0.709, + 0.785, + 0.743 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\left(\\cos \\left(\\theta_ {1} + m\\right) + \\left| \\left| x _ {1} \\right| \\right| _ {2}\\right) - \\left(\\cos \\left(\\theta_ {2}\\right) + \\left| \\left| x _ {2} \\right| \\right| _ {2}\\right) = 0 \\text {f o r c l a s s 1} \\\\ \\left(\\cos \\left(\\theta_ {1}\\right) + \\left\\| x _ {1} \\right\\| _ {2}\\right) - \\left(\\cos \\left(\\theta_ {2} + m\\right) + \\left\\| x _ {2} \\right\\| _ {2}\\right) = 0 \\text {f o r c l a s s 2} \\tag {2} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.756, + 0.788, + 0.817 + ], + "angle": 0, + "content": "This analysis of inductive bias in decision boundaries is built on binary classification and can effectively be extended to multi-class classification tasks. Consequently, the features learned through the radial-angular DistArc loss exhibit more separable decision boundaries and enhanced discriminative capabilities" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.785, + 0.84 + ], + "angle": 0, + "content": "2 A detailed visual and theoretical ablation is included in the supplementary material." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.639, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyperSpaceX" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.31, + 0.159, + 0.411, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.445, + 0.157, + 0.538, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.57, + 0.145, + 0.696, + 0.236 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.324, + 0.252, + 0.388, + 0.318 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.357, + 0.329, + 0.369, + 0.337 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.435, + 0.248, + 0.527, + 0.322 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.474, + 0.329, + 0.486, + 0.337 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.568, + 0.239, + 0.692, + 0.329 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.625, + 0.33, + 0.636, + 0.337 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.351, + 0.788, + 0.421 + ], + "angle": 0, + "content": "Fig. 3: The 2-D (in first row) and 3-D (in second row) latent space visualization of features learnt through (a) metric-based loss functions, (b) Angular-softmax-based loss functions, and (c) the proposed Radial-Angular DistArc loss. Further showing the decision-making process of assigning a test sample \\( x \\) to the most favourable class distribution represented using either class center \\( c \\) or proxy vector \\( \\omega \\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.447, + 0.788, + 0.493 + ], + "angle": 0, + "content": "among class features. A more comprehensive derivation of the decision boundary influenced by inductive bias, elucidating its dependency on angles \\(\\phi\\), \\(\\theta\\), and resultant vector \\(R\\) is present in the supplemental." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.511, + 0.747, + 0.529 + ], + "angle": 0, + "content": "3 Predictive Measure and Latent Space Visualization" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.54, + 0.788, + 0.751 + ], + "angle": 0, + "content": "The most prevailing choice for evaluating and categorizing a sample involves determining the category by calculating the maximum prediction from the model's predicted probability distribution. The proposed framework identifies the most favourable class distribution across multi-hyperspherical manifolds by considering a combination of angular and radial factors. An optimal class prediction is determined through a distinct approach that helps the evaluation metric, taking into account the radial and angular aspects of hyperspheres. The procedure encompasses the computation of resultant vectors between a sample's feature vector and each scaled proxy through mathematical formulation defined as \\( R_{i} = x - \\omega_{r_{i}} (\\forall i \\in 1,2,3,\\ldots) \\). The resultant vector with the smallest magnitude determines the most favourable class proximity. Cosine law of triangle length computation is employed to determine the length of the resultant vector \\( R \\) based on learned and computed angles \\( \\theta \\), \\( \\phi \\) and a magnitude of feature vector \\( x \\). Eq. 3 defines the formulation for \\( R_{i} \\)'s length computation for every \\( i^{th} \\) category." + }, + { + "type": "equation", + "bbox": [ + 0.324, + 0.758, + 0.785, + 0.775 + ], + "angle": 0, + "content": "\\[\n\\left| \\left| R _ {i} \\right| \\right| _ {2} = \\left| \\left| x \\right| \\right| _ {2} \\cos \\phi_ {i} + \\left| \\left| \\omega_ {r _ {i}} \\right| \\right| _ {2} \\cos (\\pi - \\left(\\theta_ {i} + \\phi_ {i}\\right)) \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.781, + 0.788, + 0.811 + ], + "angle": 0, + "content": "We introduce a favourable class determining predictive measure for the HyperSpace \\( X \\) framework with its radial-angular based formulation, i.e.," + }, + { + "type": "equation", + "bbox": [ + 0.395, + 0.817, + 0.786, + 0.844 + ], + "angle": 0, + "content": "\\[\n\\hat {y} = \\underset {R _ {m}} {\\arg \\min } \\left\\{R _ {m} \\in \\mathbb {R} ^ {K}: R _ {m} \\right\\} \\tag {4}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "where \\( R_{m} \\in \\mathbb{R}^{K} \\) refers to a vector comprising magnitude of resultant vectors between a sample's feature vector \\( x \\in \\mathbb{R}^{d} \\) and scaled proxy matrix \\( \\omega_{r} \\in \\mathbb{R}^{d \\times K} \\) representing the radii scaled \\( K \\)-class proxies, and \\( \\hat{y} \\) defines a predicted class distribution. The predicted class distribution for a specific sample is effectively represented by the class having the smallest resultant vector magnitude in relation to that sample. The derivation of a predictive measure formulation is provided in the supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.788, + 0.556 + ], + "angle": 0, + "content": "During testing, the class of a test sample is determined by its feature representation predicted by the model, influenced by the loss function during training. Fig. 3 displays visual representations of 2D and 3D latent space features, elucidating the decision-making process for classifying a test sample. This is achieved by employing a nearest distance class measure, calculated as the Euclidean distance, as shown in Fig. 3a. In Fig. 3b, the class prediction process is shown, based on angular distance within a unit hypersphere. Lastly, Fig. 3c describes the probable class selection process by finding the vector with the least magnitude across multi-hyperspherical manifolds. As shown in Fig. 4a.i, the cross-entropy loss facilitates class feature separation, leaving intermixed features that affect prediction confidence due to lack of discriminability. Conversely, angular-softmax losses, introducing angular-margin penalties to enhance cosine similarity among embeddings, aiming separation and discriminability still causes inter-mixed feature representations (depicted via Fig. 4a.ii). HyperSpaceX framework with DistArc loss, presents a solution by distributing features across various angles on multiple hyperspheres, achieving better separation and discriminability by integrating both angular and radial dimensions. This approach results in a more distinct feature arrangement between classes, as demonstrated in Fig. 4a.iii), indicating the effectiveness of DistArc loss in creating a more discriminable and separable feature space." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.58, + 0.446, + 0.598 + ], + "angle": 0, + "content": "4 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.788, + 0.842 + ], + "angle": 0, + "content": "The experimental approach is designed to analyze the distribution of features in the latent space across various image classification and face recognition tasks. We have trained and tested the proposed HyperSpaceX framework on well-known benchmark datasets: (a) seven image classification datasets including MNIST [4], FashionMNIST [32], CIFAR-10 [11], CIFAR-100 [11], CUB-200 [27], TinyImageNet [13] and ImageNet-1K [2], and (b) six face recognition datasets including LFW [10], CFP-FP [23], AgeDB-30 [18], CA-LFW [37], CP-LFW [36] datasets (CASIA-WebFace [33] is used for initial model training). Model is also trained on 1500 subjects of D-LORD [17] dataset and tested on 600 different test subjects. Implementation Details: The HyperSpaceX framework undergoes training using various deep neural network backbones, including the iResNet50 architecture [6], [9], the ViT and RN101 backbones [5] from the CLIP foundation model [20]. The models are trained using DistArc loss and several variants of softmax-based loss functions, including Cross-entropy, CosFace and ArcFace loss, and also with Orthogonal projection loss. For image classification, the model" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.639, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyperSpaceX" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.164, + 0.328, + 0.252 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.334, + 0.165, + 0.443, + 0.251 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.453, + 0.165, + 0.56, + 0.252 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.365, + 0.255, + 0.385, + 0.266 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.594, + 0.145, + 0.738, + 0.253 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.655, + 0.255, + 0.676, + 0.266 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.278, + 0.788, + 0.389 + ], + "angle": 0, + "content": "Fig. 4: (a) Illustrating comparative visual analysis of the organization of MNIST class feature distribution in the latent space. The feature representations are learned using (i) Cross-entropy loss, (ii) ArcFace loss, and (iii) the proposed DistArc loss on the MNIST database, where each color represents a unique class. While (b) depicts the subclass organization of the CIFAR-100 dataset on 2D multi-hyperspherical manifolds. The color of each line denotes a distinct superclass, facilitating angular separability. Subclasses within each superclass are distinguished radially, with each superclass represented as blobs extending radially from the superclass center." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.42, + 0.789, + 0.661 + ], + "angle": 0, + "content": "undergoes both training and testing in a classification setting. We train models for small-class simple datasets like MNIST and FashionMNIST with an SGD optimizer at a learning rate of \\(1e - 2\\) and a weight decay of \\(5e - 4\\). We further set the value of \\(m = 0.4\\) and \\(\\lambda = 0.003\\) in the DistArc loss components. For complex datasets like CIFAR-10, CIFAR-100, CUB-200 and TinyImageNet, the value of \\(\\lambda\\) is set to 0.005. Other hyperparameters remain the same. For face recognition, the training is conducted by employing a classification setup, while during testing, face verification is performed using image pairs with class-set disjoint from training. In the face recognition task, the training is performed on the CASIA-WebFace dataset in the classification setting and testing is performed in the verification setup on LFW, CFP-FP, AgeDB-30, CA-LFW and CP-LFW datasets. The SGD optimizer with a learning rate of \\(1e - 3\\) and weight decay of \\(5e - 4\\) is utilized for both the classifier and backbone network. However, in this task \\(\\lambda\\) is varied based on the number of epochs. We initialize by setting \\(\\lambda\\) to 0.001 and increasing it by an addition of 0.001 after every tenth epoch and stop updating after reaching the value of 0.005." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.686, + 0.456, + 0.703 + ], + "angle": 0, + "content": "5 Results and Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Image Classification Results: We first present the results pertaining to how class features are organized across a range of embedding sizes, from low (2D) to high (512D) and very high (2048D) dimensions, distributed across radial-hyperspherical manifolds. Table 1 showcases the performance on multi-class datasets like CIFAR-100 [11] and TinyImageNet [13], achieved by employing different backbone architectures trained with a variety of loss functions. This highlights the effectiveness of our HyperSpaceX framework, which utilizes DistArc loss for training. This method enhances class distinctiveness, typically outper" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Table 1: Performance comparison (accuracy in %) on image classification task between the proposed DistArc and other loss functions utilized for training models with multiple backbones. The best and second best performances are bolded and underlined." + }, + { + "type": "table", + "bbox": [ + 0.235, + 0.2, + 0.773, + 0.37 + ], + "angle": 0, + "content": "
CIFAR-100Tiny-Imagenet
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArcCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]47.1251.4846.9245.2062.0614.0316.0313.7817.7320.89
RN101 [20]37.8436.0235.1238.8553.9517.9616.2218.1020.5532.97
ViT-B [20]58.3656.2753.9657.0477.9337.5842.9436.2536.4954.11
ViT-L [20]67.8966.4463.8166.2779.5645.9344.0649.3446.2068.21
512iResNet50 [6]83.0580.2280.0181.2881.6261.8360.0258.3963.0663.27
RN101 [20]69.3970.8468.3769.1175.5853.0453.0151.7752.8554.40
ViT-B [20]81.9981.5879.4680.9282.6278.3874.2272.6174.4276.03
ViT-L [20]88.7587.2785.4084.8389.4886.4985.5581.8485.9486.79
2048iResNet50 [6]85.2284.2986.8286.1489.1061.3963.9262.4062.7164.20
RN101 [20]79.4078.1577.0678.2280.3754.1353.2853.8754.1059.06
ViT-B [20]81.0479.3379.2980.7283.0079.5478.3779.2677.0080.37
ViT-L [20]87.5985.9384.7490.2090.2085.0381.3982.4886.0486.94
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.4, + 0.795, + 0.567 + ], + "angle": 0, + "content": "forming models trained with conventional loss functions such as Cross-entropy, ArcFace, CosFace, and Orthogonal Projection Loss (OPL). These results also showcase that the DistArc loss leads to features with enhanced separability and discrimination due to its effective exploration of both radial and angular dimensions within each hyperspherical latent space. This approach results in a significant performance increase: in TinyImageNet classification tasks, we observe an increase of over \\(22\\%\\) in 2D, around \\(1.44\\%\\) in 512D, and \\(4.93\\%\\) in 2048D spaces, when benchmarked against cross-entropy loss and various softmax-angular margin-based loss functions. A similar trend of substantial improvement is observed for the CIFAR-100 dataset, showing improvements of up to \\(19.57\\%\\) in 2D, \\(6.19\\%\\) in 512D, and \\(2.61\\%\\) in 2048D spaces." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.79, + 0.763 + ], + "angle": 0, + "content": "Fig. 4b illustrates the subclass and class-based feature distribution for CIFAR-100 categories, arranging each subclass angularly within its superclass group across different radial spaces. This setup enhances radial separability for subclasses and angular separability for superclasses, leading to clear distinctions between them. Furthermore, subclasses are compactly positioned according to their radial and angular coordinates, showcasing precise class feature discrimination. This organized feature distribution demonstrates the capability for a more defined feature arrangement, optimizing representation in lower-dimensional spaces and simplifying model complexity. Consequently, Fig. 4b uses color differentiation to distinguish between unrelated classes, while same-colored points on different radii indicate subclasses belonging to the same superclass, thereby facilitating a methodical learning of class arrangements in multi-radial spaces for refined differentiation between classes and their subclasses." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "The results for the CUB-200 dataset [27], a large multi-class image classification challenge focusing on bird categorization, are shown in Table 2. Classifying images in the CUB-200 dataset is particularly demanding due to the subtle, unique features each bird species has, despite the commonality of features like beaks and wings. This demands an emphasis on fine-grained, distinct characteris" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.638, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyperSpaceX" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.187 + ], + "angle": 0, + "content": "Table 2: Comparative performance (accuracy in %) analysis on CUB-200 dataset between proposed DistArc and other loss functions used for training models with multiple backbones. The best and second best performances are bolded and underlined." + }, + { + "type": "table", + "bbox": [ + 0.25, + 0.2, + 0.758, + 0.323 + ], + "angle": 0, + "content": "
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]7.506.197.0711.5918.09
RN101 [20]11.4410.4711.4212.8431.50
ViT-B [20]18.7020.6319.0417.0625.93
ViT-L [20]25.4822.8524.1927.7748.11
512iResNet50 [6]61.2963.4760.2962.8370.48
RN101 [20]51.4050.8550.1154.2658.44
ViT-B [20]67.9368.7068.1870.3676.06
ViT-L [20]80.7978.2779.6680.6583.28
" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.341, + 0.785, + 0.381 + ], + "angle": 0, + "content": "Table 3: Evaluating model performance (accuracy in%) using conventional and proposed predictive measures in the HyperSpaceX framework when trained using DistArc loss on backbones with 512-D embedding size. The best performances are bolded." + }, + { + "type": "table", + "bbox": [ + 0.235, + 0.395, + 0.772, + 0.471 + ], + "angle": 0, + "content": "
BackboneCIFAR-100CUB-200TinyImageNet
Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)
iResNet50 [6]80.2981.6269.5670.4861.9363.27
RN101 [20]71.0575.5858.1958.4454.3354.43
ViT-B [20]78.9982.6274.9176.0676.1076.03
ViT-L [20]88.2089.4882.8583.2882.5186.79
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.504, + 0.785, + 0.639 + ], + "angle": 0, + "content": "ties of different bird body parts when developing bird image classification models. In such challenging scenario, as shown in Table 2, the HyperSpaceX framework outperforms existing methods. Models trained with DistArc loss achieved a significant performance boost of approximately \\(20.34\\%\\) using a ViT-L backbone with a 2D last embedding layer. Additionally, DistArc loss trained models excelled in higher-dimensional latent spaces. This success is attributed to our approach's adeptness in discriminately mapping various bird class features across distinctively separated radii and angles in a multi-hyperspherical space, while simultaneously compacting features within the same bird class." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.643, + 0.786, + 0.808 + ], + "angle": 0, + "content": "Reduced Latent Space Representation: Table 1 and Table 2 represent the performance on several backbones having the last embedding layer of size 2. It signifies that on complex datasets such as CIFAR-100, CUB-200 and TinyImageNet, the proposed radial-angular feature learning approach in a 2-D latent space achieves a performance boost of \\(16\\%\\) to \\(20\\%\\) over traditional cross-entropy loss methods even with large number of classes. Experimental results on the CUB-200 dataset also depict the high separability among various low-variance classes. Quantitatively, we can deduce that while dimensionality reduction for large complex datasets from a higher dimension of 512 and 2048 to the lower dimension of 2 embedding space, cross-entropy loss observes a \\(40 - 42\\%\\) performance gap while DistArc loss successfully reduced this disparity to \\(20 - 24\\%\\)." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.81, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Predictive Measures Analysis: In the Image classification task, the class predictions are generally made utilizing the model's classification layer, adopted for" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "image", + "bbox": [ + 0.29, + 0.153, + 0.418, + 0.249 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.437, + 0.155, + 0.565, + 0.248 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.582, + 0.155, + 0.71, + 0.248 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.288, + 0.254, + 0.429, + 0.321 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.434, + 0.253, + 0.571, + 0.323 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.58, + 0.254, + 0.712, + 0.322 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.287, + 0.325, + 0.429, + 0.398 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.433, + 0.325, + 0.57, + 0.398 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.58, + 0.325, + 0.714, + 0.398 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.409, + 0.788, + 0.48 + ], + "angle": 0, + "content": "Fig. 5: Analysis of loss functions using small-class simple datasets (a) MNIST and (b) FashionMNIST, and complex dataset (c) CIFAR-10. The first row visualizes the features, showcasing the outcomes of learning with DistArc loss over 2D multi-spherical manifolds. The last two rows illustrate classification performance of different backbones with a 2-D and 512-D embedding sizes, trained using Cross-entropy and DistArc loss." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.516, + 0.788, + 0.652 + ], + "angle": 0, + "content": "models trained with various existing loss functions except for DistArc loss, for results presented in Table 1 and Table 2. The proposed DistArc loss, the predictions are computed using the newly introduced radial-angular based predictive measure defined in section 3. The comparison of utilizing traditional and proposed predictive measures in the HyperSpaceX framework is shown via Table 3. From the outperforming results shown, it can be analyzed that the proposed radial-angular-based predictive measure is effective over the conventional approach of predictions from the final classification layer for models trained using DistArc loss due to different radii of classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.655, + 0.788, + 0.777 + ], + "angle": 0, + "content": "Performance of HyperSpaceX on a Large-Scale Image Dataset: Table 4 provides the details the performance of the proposed framework after finetuning on the ImageNet-1K dataset [2]. We observe that the proposed DistArc loss outperforms existing methods for embedding sizes of 32 and 128. It also achieves the second-highest performance at 512 dimensions. As the number of classes grows, ArcFace finds it difficult to manage many feature points on a unit hypersphere. This demonstrates the benefit of strategically arranging features in a multi-radial hyperspherical space using DistArc loss during model training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "HyperSpaceX Performance on Datasets with Fewer Classes: Fig. 5 showcases the performance and feature visualization for MNIST, FashionMNIST, and CIFAR-10 datasets. The top row of Fig. 5 illustrates the 2D-latent space feature organization across multi-radial hyperspherical manifolds, highlighting the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.638, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "HyperSpaceX" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.235, + 0.145, + 0.768, + 0.201 + ], + "angle": 0, + "content": "Table 4: Classification Accuracy (%) Table 5: Ablation study of DistArc on ImageNet-1K dataset using iRes-loss, reporting classification performance [6]. The best and second best performance (in %) for various image classifi-cormances are bolded and underlined. fication datasets." + }, + { + "type": "table", + "bbox": [ + 0.242, + 0.213, + 0.768, + 0.281 + ], + "angle": 0, + "content": "
Embedding SizeCross EntropyArcFaceDistArcLoss ComponentsMNISTFashion-MNISTCIFAR-10
3248.2543.0555.91cos(θ)98.9793.6994.81
12865.1858.6265.30cos(θ) & cos(φ)98.9393.7295.16
51269.2759.6767.90cos(θ) & δ99.0194.8395.31
cos(θ) & cos(φ) & δ99.1995.0496.03
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.31, + 0.788, + 0.431 + ], + "angle": 0, + "content": "strategic angular positioning. This arrangement emphasizes the significant distance between features of unrelated classes and the closeness of features within the same class, facilitating accurate class predictions. The subsequent rows display a comparison of classification accuracy across different models trained using cross-entropy and DistArc loss functions in 2D and 512D latent spaces. These findings illustrate the superior performance of the HyperSpaceX framework across both simple (MNIST, FashionMNIST) and more complex (CIFAR-10) datasets with a smaller number of classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.79, + 0.568 + ], + "angle": 0, + "content": "Training Convergence Analysis: The training convergence rates of the DistArc loss were benchmarked against existing loss functions. Training with softmax cross-entropy loss shows only a slight decrease in loss values. In contrast, DistArc loss significantly restructures the feature space layout by dispersing identities across various radial hyperspheres. This approach leads to higher initial loss figures that efficiently reduce to a minimum of 0.22, surpassing the reduction achieved with softmax cross-entropy (0.34), CosFace (2.31), ArcFace (1.51), and OPL (0.68) loss functions. A detailed comparison illustrating the training convergence rates of loss functions is available in the supplementary file." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.788, + 0.689 + ], + "angle": 0, + "content": "Ablatic Analysis of DistArc: Table 5 shows the ablation analysis on three image classification datasets, MNIST, FashionMNIST, and CIFAR-10, while utilizing ViT-B architecture (embedding size 512). The first and second row of Table 5 shows the efficacy of performance improvement over angular separation through \\(\\theta\\) and \\(\\phi\\), and the third row shows the improvement with radial and angular factors due to \\(\\delta\\) and \\(\\theta\\) terms. While, the last row shows the highest performance achieved by including all \\(\\theta\\), \\(\\phi\\) and \\(\\delta\\) components into the loss formulation, highlighting the importance of each component." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Face Recognition Results: Table 6 showcases detailed comparative results of the DistArc loss against other loss functions in face recognition tasks. Utilizing the iResNet50 architecture and training on the CASIA-WebFace dataset, we have evaluated verification performance with a 512-dimensional embedding. The DistArc loss demonstrates state-of-the-art (SoTA) results on LFW and CP-LFW datasets and near state-of-the-art results on other datasets. Additionally, experiments with the iResNet50 backbone on the MS1Mv2 dataset—a derivative of the now-withdrawn MS-Celeb dataset—were conducted to ensure a fair comparison with SoTA methods are included in supplementary materials. The DistArc loss trained model achieved following results: \\(99.82\\%\\) on LFW and \\(98.21\\%\\) on AgeDB" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.787, + 0.174 + ], + "angle": 0, + "content": "Table 6: Quantitative results (in %) of face recognition models trained using different loss functions. The best and second best performances are bolded and underlined." + }, + { + "type": "table", + "bbox": [ + 0.278, + 0.185, + 0.73, + 0.332 + ], + "angle": 0, + "content": "
LossLFWCFP-FPAgeDB-30CA-LFWCP-LFW
Triplet98.9891.9089.98--
Center loss [30]99.28--85.4877.48
Softmax99.0894.3992.3388.1784.85
Norm-Softmax98.5689.7988.72--
SphereFace [16]99.1194.3891.7092.5590.90
CosFace (m=0.35) [28]99.1095.4492.9892.8391.03
ArcFace (m=0.45) [3]99.4695.4794.9392.4790.85
SphereFace2 [29]99.50-93.6893.4791.07
DistArc (m=0.4)99.5495.4194.0393.3291.10
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.361, + 0.786, + 0.406 + ], + "angle": 0, + "content": "30, surpassing results from SphereFace, CosFace, ArcFace, and SphereFace2\\(^3\\). These findings highlight the HyperSpaceX framework's proficiency in crafting highly discriminative and distinct features within the latent space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.407, + 0.787, + 0.499 + ], + "angle": 0, + "content": "The HyperSpaceX framework is also evaluated on the D-LORD [17] dataset, a large-scale open-set surveillance dataset with 600 test subjects, using a deep metric learning approach [19]. With ArcFace, a Rank-1 identification accuracy of \\(61.84\\%\\) was achieved, while DistArc achieved \\(62.71\\%\\). For Rank-5 accuracy, the results were \\(65.89\\%\\) and \\(66.03\\%\\), respectively, indicating that DistArc is more effective at learning enhanced discriminative features than ArcFace." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.524, + 0.36, + 0.54 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.559, + 0.788, + 0.802 + ], + "angle": 0, + "content": "In this research, we introduce the HyperSpaceX framework, which navigates both angular and radial dimensions, facilitating a uniquely distinguishable and discernible arrangement of class features within multi-hyperspherical manifold space. This is achieved using the novel DistArc loss, which leverages the radial and angular components of the feature space. This loss function significantly enhances the cohesion among similar class features while concurrently maximizing the distances between different classes, resulting in more precise and discriminative feature representation. To evaluate the performance of this radial-angular framework, we introduce a predictive measure that utilizes the shortest resultant vector between the embeddings of test samples and proxy vectors, offering a deeper insight into the model's performance. The efficacy of HyperSpaceX is demonstrated through comprehensive experiments on seven image classification datasets and six face recognition datasets. The proposed methodology shows improvements in handling a diverse array of image and face datasets, ranging from simpler to more complex and large-scale collections encompassing several classes and samples." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "\\(^3\\)SphereFace (LFW: 99.42%), CosFace (LFW: 99.73%), ArcFace (LFW: 99.82%, AgeDB30: 98.15%) and SphereFace2 (LFW: 99.50%, AgeDB30: 93.68%)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.638, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "HyperSpaceX" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.177, + 0.784, + 0.207 + ], + "angle": 0, + "content": "Chiranjeev and Thakral received partial support from the PMRF Fellowship, and Vatsa is partially supported by the Swarnajayanti Fellowship." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.23, + 0.323, + 0.245 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.261, + 0.785, + 0.288 + ], + "angle": 0, + "content": "1. Conniffe, D.: Expected maximum log likelihood estimation. Journal of the Royal Statistical Society: Series D (The Statistician) 36(4), 317-329 (1987)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.289, + 0.785, + 0.328 + ], + "angle": 0, + "content": "2. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.33, + 0.785, + 0.371 + ], + "angle": 0, + "content": "3. Deng, J., Guo, J., Xue, N., Zafeiriou, S.: Arcface: Additive angular margin loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4690-4699 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.372, + 0.785, + 0.399 + ], + "angle": 0, + "content": "4. Deng, L.: The mnist database of handwritten digit images for machine learning research [best of the web]. IEEE signal processing magazine 29(6), 141-142 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.4, + 0.785, + 0.453 + ], + "angle": 0, + "content": "5. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.455, + 0.785, + 0.481 + ], + "angle": 0, + "content": "6. Duta, I.C., Liu, L., Zhu, F., Shao, L.: Improved residual networks for image and video recognition. In: Int. Conf. Pattern Recog. pp. 9415-9422. IEEE (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.483, + 0.785, + 0.509 + ], + "angle": 0, + "content": "7. Gallo, I., Nawaz, S., Calefati, A., Janjua, M.K.: Git loss for deep face recognition. In: Brit. Mach. Vis. Conf. p. 313. BMVA (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.511, + 0.785, + 0.536 + ], + "angle": 0, + "content": "8. Guo, G., Zhang, N.: A survey on deep learning based face recognition. Comput. Vis. Image Underst. 189, 102805 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.538, + 0.785, + 0.564 + ], + "angle": 0, + "content": "9. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.565, + 0.785, + 0.606 + ], + "angle": 0, + "content": "0. Huang, G.B., Mattar, M., Berg, T., Learned-Miller, E.: Labeled faces in the wild: A database for studying face recognition in unconstrained environments. In: Workshop on faces in Real-Life Images: detection, alignment, and recognition (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.607, + 0.785, + 0.633 + ], + "angle": 0, + "content": "1. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.635, + 0.785, + 0.66 + ], + "angle": 0, + "content": "2. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Adv. Neural Inform. Process. Syst. 25 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.785, + 0.688 + ], + "angle": 0, + "content": "3. Le, Y., Yang, X.: Tiny imagenet visual recognition challenge. CS 231N 7(7), 3 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.785, + 0.73 + ], + "angle": 0, + "content": "4. LeCun, Y., Boser, B., Denker, J.S., Henderson, D., Howard, R.E., Hubbard, W., Jackel, L.D.: Backpropagation applied to handwritten zip code recognition. Neural computation 1(4), 541-551 (1989)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.785, + 0.757 + ], + "angle": 0, + "content": "5. Li, L., Zhang, Y., Huang, A.: Learnable subspace orthogonal projection for semi-supervised image classification. In: ACCV. pp. 477-490. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.798 + ], + "angle": 0, + "content": "6. Liu, W., Wen, Y., Yu, Z., Li, M., Raj, B., Song, L.: Spherface: Deep hypersphere embedding for face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 212-220 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "7. Manchanda, S., Bhagwatkar, K., Balutia, K., Agarwal, S., Chaudhary, J., Dosi, M., Chiranjeev, C., Vatsa, M., Singh, R.: D-lord: Dysl-ai database for low-resolution disguised face recognition. IEEE Trans. on Biom., Behav., and Ident. Sci. (2023)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.261, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.384, + 0.129 + ], + "angle": 0, + "content": "Chiranjeev et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "18. Moschoglou, S., Papaioannou, A., Sagonas, C., Deng, J., Kotsia, I., Zafeiriou, S.: Agedb: the first manually collected, in-the-wild age database. In: IEEE Conf. Comput. Vis. Pattern Recog. Worksh. pp. 51-59 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.785, + 0.23 + ], + "angle": 0, + "content": "19. Oh Song, H., Xiang, Y., Jegelka, S., Savarese, S.: Deep metric learning via lifted structured feature embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4004-4012 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.23, + 0.785, + 0.285 + ], + "angle": 0, + "content": "20. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Int. Conf. Mach. Learn. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.285, + 0.785, + 0.311 + ], + "angle": 0, + "content": "21. Ranasinghe, K., Naseer, M., Hayat, M., Khan, S., Khan, F.S.: Orthogonal projection loss. In: Int. Conf. Comput. Vis. pp. 12333-12343 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.312, + 0.785, + 0.353 + ], + "angle": 0, + "content": "22. Schroff, F., Kalenichenko, D., Philbin, J.: Facenet: A unified embedding for face recognition and clustering. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 815-823 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.353, + 0.785, + 0.394 + ], + "angle": 0, + "content": "23. Sengupta, S., Chen, J.C., Castillo, C., Patel, V.M., Chellappa, R., Jacobs, D.W.: Frontal to profile face verification in the wild. In: Winter Conf. on App. of Comput. Vis. pp. 1-9. IEEE (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.395, + 0.785, + 0.435 + ], + "angle": 0, + "content": "24. Sermanet, P., Eigen, D., Zhang, X., Mathieu, M., Fergus, R., LeCun, Y.: Overfeat: Integrated recognition, localization and detection using convolutional networks. arXiv preprint arXiv:1312.6229 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.436, + 0.785, + 0.462 + ], + "angle": 0, + "content": "25. Sohn, K.: Improved deep metric learning with multi-class n-pair loss objective. Adv. Neural Inform. Process. Syst. 29 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.463, + 0.785, + 0.489 + ], + "angle": 0, + "content": "26. Sun, Y., Chen, Y., Wang, X., Tang, X.: Deep learning face representation by joint identification-verification. Adv. Neural Inform. Process. Syst. 27 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.489, + 0.785, + 0.531 + ], + "angle": 0, + "content": "27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: Caltech-ucsd birds-200-2011 (cub-200-2011). Tech. Rep. CNS-TR-2011-001, California Institute of Technology (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.531, + 0.785, + 0.572 + ], + "angle": 0, + "content": "28. Wang, H., Wang, Y., Zhou, Z., Ji, X., Gong, D., Zhou, J., Li, Z., Liu, W.: Cosface: Large margin cosine loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5265-5274 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.572, + 0.785, + 0.599 + ], + "angle": 0, + "content": "29. Wen, Y., Liu, W., Weller, A., Raj, B., Singh, R.: Spherical face classification is all you need for deep face recognition. In: Int. Conf. Learn. Represent. (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.599, + 0.785, + 0.626 + ], + "angle": 0, + "content": "30. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Eur. Conf. Comput. Vis. Springer (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.626, + 0.785, + 0.653 + ], + "angle": 0, + "content": "31. Wu, C.Y., Manmatha, R., Smola, A.J., Krahenbuhl, P.: Sampling matters in deep embedding learning. In: Int. Conf. Comput. Vis. pp. 2840-2848 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.654, + 0.785, + 0.68 + ], + "angle": 0, + "content": "32. Xiao, H., Rasul, K., Vollgraf, R.: Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.681, + 0.785, + 0.707 + ], + "angle": 0, + "content": "33. Yi, D., Lei, Z., Liao, S., Li, S.Z.: Learning face representation from scratch. arXiv preprint arXiv:1411.7923 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.708, + 0.785, + 0.735 + ], + "angle": 0, + "content": "34. Zeiler, M.D., Fergus, R.: Visualizing and understanding convolutional networks. In: Eur. Conf. Comput. Vis. pp. 818-833. Springer (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.735, + 0.785, + 0.762 + ], + "angle": 0, + "content": "35. Zhang, Z., Sabuncu, M.: Generalized cross entropy loss for training deep neural networks with noisy labels. Adv. Neural Inform. Process. Syst. 31 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.762, + 0.785, + 0.802 + ], + "angle": 0, + "content": "36. Zheng, T., Deng, W.: Cross-pose lfw: A database for studying cross-posed face recognition in unconstrained environments. Beijing University of Posts and Telecommunications, Tech. Rep 5(7) (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.803, + 0.785, + 0.83 + ], + "angle": 0, + "content": "37. Zheng, T., Deng, W., Hu, J.: Cross-age LFW: A database for studying cross-age face recognition in unconstrained environments. CoRR abs/1708.08197 (2017)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.83 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_origin.pdf b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f4295cd5548daacdfa23f64a9b2133d929992490 --- /dev/null +++ b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/e35c4a71-ae81-4580-80e8-a67ddbb3adf6_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e78226fcf41851d276e363e59cb4990ee6a7d597704cfd01dd4e6a6f4335d64c +size 5071308 diff --git a/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/full.md b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/full.md new file mode 100644 index 0000000000000000000000000000000000000000..ec0cf2761e18ff0d86a96bfbd50791748eef761f --- /dev/null +++ b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/full.md @@ -0,0 +1,252 @@ +# HyperSpaceX: Radial and Angular Exploration of HyperSpherical Dimensions + +Chiranjeev Chiranjeev, Muskan Dosi, Kartik Thakral Mayank Vatsa and Richa Singh + +Indian Institute of Technology Jodhpur, India {chiranjeev.1,dosi.1,thakral.1,mvatsa,richa}@iitj.ac.in https://github.com/IAB-IITJ/HyperSpaceX + +![](images/8396ba67b03bde4741884bbcb8e8d53ed923e992e18e4117b5bfd839dd4be1ef.jpg) +Fig. 1: Visual concept of the proposed HyperSpaceX framework: It utilizes a novel radial-angular latent space on hyperspherical manifolds to differentiate features effectively. Initially, class features are indistinguishable due to overlap. The proposed DistArc loss exhibits two feature arrangement learning: high inter-class variation employing multi-radial angular arrangement and minimal intra-class distance, leading to highly separable-discriminable class features. + +Abstract. Traditional deep learning models rely on methods such as softmax cross-entropy and ArcFace loss for tasks like classification and face recognition. These methods mainly explore angular features in a hyperspherical space, often resulting in entangled inter-class features due to dense angular data across many classes. In this paper, a new field of feature exploration is proposed known as HyperSpaceX which enhances class discrimination by exploring both angular and radial dimensions in multi-hyperspherical spaces, facilitated by a novel DistArc loss. The proposed DistArc loss encompasses three feature arrangement components: two angular and one radial, enforcing intra-class binding and inter-class separation in multi-radial arrangement, improving feature discriminability. Evaluation of HyperSpaceX framework for the novel representation utilizes a proposed predictive measure that accounts for both angular and radial elements, providing a more comprehensive assessment of model accuracy beyond standard metrics. Experiments across seven object classification and six face recognition datasets demonstrate state-of-the-art (SoTA) results obtained from HyperSpaceX, achieving up to a $20\%$ performance improvement on large-scale object datasets in lower dimensions and up to $6\%$ gain in higher dimensions. + +Keywords: Representation Learning $\cdot$ Image Classification $\cdot$ Face Recognition + +# 1 Introduction + +The advancement in image classification and face recognition has greatly benefited from the introduction of innovative loss functions, designed to better differentiate between class features. These functions are crafted to learn unique representations for each class by employing proxies or weight vectors to increase the distinction between classes. Traditional image classification techniques [14], [12], [24], [34] primarily rely on cross-entropy loss [1], [35] to create intricate class boundaries and improve model generalization. However, a common limitation of these approaches is their tendency to neglect the reduction of within-class feature distances while failing to adequately separate features between different classes. This results in the blending of feature points from dissimilar classes, thus leading to reduced accuracies in object classification and face verification tasks. + +To address this gap, several modifications to softmax-based loss functions have been introduced, utilizing proxy-based methods to cluster similar class features while concurrently expanding the separation between dissimilar ones within the latent space. For face recognition, existing approaches [3], [8], [16], [26], [28] leverage proxy-based objectives to achieve better feature separability on a hypersphere through angular dimensions. Methods such as SphereFace [16], [29] and ArcFace [3] introduce angular margins to promote large-margin discriminative feature learning, while CosFace [28] incorporates marginal cosine functions to modify softmax loss by equalizing radial variations, introducing a cosine margin for angular decision boundaries. Furthermore, face recognition has benefited from proxy-free training strategies that focus on deep metric learning techniques [19], [22], [25], [31]. These strategies generate embeddings that bring similar faces closer together while keeping dissimilar ones apart, adapting effectively to various conditions without the need for explicit class labels. However, methods like triplet learning [22] and contrastive loss [31] depend heavily on the availability of extensive image pairs or triplets for effective training and often face difficulties with hard-pair mining. Other discriminative loss functions like Center loss [30] and Git loss [7] encounter difficulties in updating class center parameters with a large identity count, adding computational cost. Orthogonal Projection Loss (OPL) [21] and Learnable Subspace Orthogonal Projection [15] employ orthogonal projection constraints to improve separability between classes, but this approach restricts the number of classes to $2^d$ in d-dimensional space. + +The limitations of traditional loss functions, including those modified for angular space, have led to challenges in effectively differentiating between features. The issue occurs when features of closely related classes overlap, causing uncertainties in the correct identification or classification of subjects1. This overlap of class features makes it difficult to discern between unique identities or classes, thereby impacting the overall performance. To overcome these limitations, we propose the HyperSpaceX framework, a novel approach that extends the exploration of feature space beyond the angular to include radial dimensions in multi-hyperspherical latent spaces. It introduces a loss function that emphasizes + +the arrangement of features to increase inter-class separability and intra-class compactness. Through the effective combination of angular and radial organization of features, the framework aims to minimize the overlap among inter-class data points, presenting a novel discriminative feature representation approach for image classification and face recognition. The key highlights are: + +1. Introducing HyperSpaceX, a novel discriminative feature representation and arrangement learning that explores both radial and angular dimensions within multi-hyperspherical spaces, enabling effective feature learning. +2. Developing the DistArc loss function, aimed at enhancing the discriminative power of deep learning models. It improves feature representation by promoting better separation between different classes and tighter clustering of features within the same class in the latent space. +3. Presenting a predictive measure to evaluate the model's performance, incorporating both radial and angular dimensions in multi-hyperspherical settings. This measure provides a more comprehensive understanding of the model's capabilities in handling complex feature distributions. +4. Evaluating the proposed approach using seven object datasets (MNIST, FashionMNIST, CIFAR-10, CIFAR-100, CUB-200, TinyImageNet and ImageNet1K) and six face datasets (LFW, CFP-FP, AgeDB-30, CA-LFW, CP-LFW and D-LORD), showing its effectiveness in improving feature distinction and model accuracy across various data types and complexities, often achieving state-of-the-art results. + +# 2 The HyperSpaceX Framework + +In traditional hyperspherical angular latent spaces, identities or classes are delineated by distinct angular directions. However, with the increase in the number of classes and the volume of data for each class, overlaps and intersections in these class representations increases, leading to significant classification challenges, as they blur the distinction between different classes. To address the issue of feature overlap and the necessity for more defined class distinctions, we propose the HyperSpaceX framework. This framework utilizes a multi-hyperspherical space, drawing on both radial hyperspheres and angular dimensions to promote a discriminative distribution of class features. This learnable arrangement distribution is facilitated by the novel DistArc loss that significantly enhances class differentiation and separation along with the grouping of same-category features. DistArc strategically arranges features by considering both their angle and distance from the center, across various spherical layers. This method utilizes the diversity of spatial dimensions to establish clear and distinct areas within the spherical model, making it easier to define precise boundaries between classes. Such a multi-dimensional approach generates a more elaborate hyperspherical subspace, facilitating the creation of more efficient decision boundaries. + +# 2.1 Preliminaries + +Deep learning research has explored a variety of loss functions, among which Cross-entropy loss is most commonly used for classification tasks. Let $x_{i}$ and $\omega$ be the feature embedding and weight or proxy matrix, respectively. Cross-entropy loss is defined as $L_{\mathrm{CE}} = -\frac{1}{N}\sum_{i=1}^{N}\log\frac{e^{\omega_T x_i + by_i}}{\sum_{j=1}^{K}e^{\omega_T x_j + bj}}$ . Here, $\omega_{y_i}$ signifies the proxy vector of the $y_{i}$ -th class. The term $b$ refers to the bias, $N$ represents the number of samples distributed over $K$ number of classes. This function calculates the expected loss between the predicted and actual class distributions, focusing on optimizing class separations without necessarily bringing similar class features closer or significantly distancing different classes. Such limitations can adversely affect image classification and face recognition performance, particularly under high intra-class variations. There have been attempts to enhance inter-class distinctions through loss functions like Orthogonal Projection Loss (OPL) [21], which introduces perpendicular margins between class features. However, these efforts are often overshadowed by the dominance of cross-entropy in optimization processes. Softmax-based losses, including those used in deep face recognition like SphereFace [16] [29], CosFace [28] and ArcFace [3], primarily rely on cross-entropy based formulation. Among these is ArcFace loss, one of the most popular angular-loss functions, which distinguishes itself by allocating features around class proxies within a hyperspherical space and applying an angular margin $m$ to enhance the cohesion within classes and the distinction between different classes. The mathematical formulation of ArcFace loss is represented as $L_{\mathrm{ArcFace}} = -\frac{1}{N}\sum_{i=1}^{N}\log\frac{e^{\cos(\theta_{y_i} + m)}}{e^{\cos(\theta_{y_i} + m)} + \sum_{j=1,j \neq y_i}^{K}e^{\cos\theta_j}}$ . + +In this, $\cos\theta$ is calculated using cosine similarity between feature embedding $x$ and proxy $\omega$ , that is defined by computing a dot product between unit vectors of $x$ and $\omega$ as represented through $\cos(\theta_{y_i}) = \hat{x}_i \cdot \hat{\omega}_{y_i} \cos(\theta_j) = \hat{x}_i \cdot \hat{\omega}_j$ . However, focusing solely on angular dimensions can lead to ambiguity among classes in densely populated identity spaces, highlighting a need for broader exploration beyond angular metrics. + +# 2.2 Proposed DistArc Loss + +The proposed DistArc loss navigates through radial and angular dimensions across multiple hyperspheres centered at the origin to improve class discrimination. The DistArc loss is formulated as, + +$$ +L _ {\text {D i s t A r c}} = - \frac {1}{N} \sum_ {i = 1} ^ {N} \log \frac {e ^ {\cos \left(\theta_ {y _ {i}} + m\right) + \cos \left(\phi_ {y _ {i}}\right) - \lambda \delta_ {y _ {i}}}}{e ^ {\cos \left(\theta_ {y _ {i}} + m\right)} + \sum_ {j = 1 , j \neq y _ {i}} ^ {K} e ^ {\cos \left(\theta_ {j}\right) - \lambda \delta_ {j}}} \tag {1} +$$ + +where $\lambda$ represents the weighing factor and $\cos \theta$ defines the cosine of angle between embedding $x$ and a proxy vector $\omega$ . An angular-margin penalty of $m$ is introduced in $\cos \theta$ to enhance the feature discriminability. Fig. 2a represents the geometric illustration of $\cos (\theta_{y_i} + m)$ . The DistArc loss minimizes the angle + +![](images/c33b1ddbff03eed3bbf8f215b692fc4a58104e588496286f90cbc864f40c2dbb.jpg) +(a) + +![](images/ba2d9d8a595d36b1862197fffc2ca07726fb5b8ddcd7c4632e04a16ff29506bd.jpg) +(b) +Fig.2: The geometric interpretation of angular and radial formations in multihyperspherical dimensions in the training phase through (a) $\theta$ and angular-margin penalty $m$ , and (b) angle $\phi$ between scaled proxy vector $\omega_{y_i}$ and resultant vector $R$ . (c) Shows the vector representation of $R$ and $\omega_{y_i}$ in a reverse direction for computing angle $\phi$ using cosine of an angle $\phi$ . + +![](images/029d5119f7eecff79768b6fc3551d3748e9d2769cc118cf9ca6d1fc7c027be65.jpg) +(c) + +$\theta_{y_i}$ , thereby increasing the cosine similarity between embeddings $x_i$ and their corresponding proxy's $\omega_{y_i}$ . However, to include the radial dimension also we incorporate the $\cos \phi_{y_i}$ which represents the cosine of angle between radii scaled proxy vector $\omega_{r_y_i}$ and a resultant vector $R_{y_i}$ of $\omega_{r_y_i}$ and $x_i$ . Fig. 2b describes the geometric representation of the resultant vector $R_{y_i}$ . $R_{y_i}$ is modified while learning/training such that it minimizes the angle between $R_{y_i}$ and $\omega_{r_y_i}$ which is defined using $\omega_{r_y_i} = \hat{\omega}_{y_i} \times r_y_i$ and $R_{y_i}$ is defined as $R_{y_i} = -\omega_{r_y_i} + x_i$ . Here, $R_{y_i} \in \mathbb{R}^d$ , $\omega_{r_y_i} \in \mathbb{R}^{d \times 1}$ , and $x_i \in \mathbb{R}^d$ . The resultant vector helps to maintain the embedding magnitude within the hyperspherical radii of magnitude $||\omega_{r_y_i}||_2$ and further optimizes the embeddings $x_i$ 's to cluster in the angular direction by minimizing the angle $(\phi_{y_i})$ between $R_{y_i}$ and $\omega_{r_y_i} \colon \cos (\phi_{y_i}) = \hat{R}_{y_i} \cdot -\hat{\omega}_{r_y_i}$ . This equation, while calculating the $\cos \phi_{y_i}$ , the origin is taken at $\hat{\omega}_{r_y_i}$ which results $\hat{\omega}_{r_y_i}$ vector to be in reverse direction leading to $-\hat{\omega}_{r_y_i}$ . We can visualize its vector representation from Fig. 2c representing the angle computation process between the reversely directed scaled proxy vector $\omega_{r_y_i}$ and a resultant vector $R_{y_i}$ . The term $\cos \phi_{y_i}$ within the proposed loss function $L_{DistArc}$ is designed to enhance the intra-class compactness of features with their respective scaled class proxies, $\omega_{r_y_i}$ by optimizing both the radial and angular dimensions of different hyperspheres. This term also has a major significance in letting the distribution of each class to stay within particular radii hyperspheres in the feature space. + +Through DistArc loss, the $\cos \theta_{y_i}$ optimizes to align the embeddings with class proxies $\omega_{y_i}$ in the angular space and $\cos \phi_{y_i}$ optimizes to increase the compactness among embeddings and their respective scaled proxies $\omega_{r_{y_i}}$ . It also ensures that the length of embeddings does not extend beyond their radial space $r_i$ ; further, minimizes the angle between normalized resultant vector $(\hat{R}_{y_i})$ and normalized scaled proxy $(\hat{\omega}_{r_{y_i}})$ to bring closer the embeddings at the point of scaled proxy, $\omega_{r_{y_i}}$ in the angular space. The overall geometric interpretation of DistArc loss during the training phase is shown in Fig. 2b. + +In the proposed DistArc loss, $\delta_{y_i}$ act as a pulling force to attract embeddings $x_{i}$ towards $\omega_{r_{y_i}}$ . This loss component optimizes to shift the distribution of each class towards the scaled proxies $\omega_{r_{y_i}}$ in the radial space, leading to an increase in the embedding's magnitude. Leading to the enhancement of intra-class compact- + +ness, $\delta_{j}$ in the denominator of the loss function, helps to distant the $x_{i}$ 's away from other scaled proxies $\omega_{r_j}$ 's excluding $\omega_{r_{y_i}}$ . The overall combination of $\delta_{y_i}$ and $\delta_{j}$ increases the inter-class distance between dissimilar class scaled proxies and embeddings while decreasing the intra-class distance between similar class scaled proxy and embeddings. The $\delta_{y_i}$ term is defined using, $\delta_{y_i} = \| \omega_{r_y_i} - x_i\| _2^2$ and in case when $j\neq y_{i}$ , $\delta_{j} = \| \omega_{r_{j}} - x_{i}\|_{2}^{2}$ . A negative (-) sign is used in the $\delta$ component of loss Eq. 1 to maximize the logarithmic distribution overall and subsequently minimize the DistArc loss. + +# 2.3 Analytical Ablation of DistArc Loss and Inductive Bias for HyperSpaceX Framework + +In the proposed DistArc loss, the first component $\cos (\theta_{y_i} + m)$ represents the cosine of the angle $\theta_{y_i}$ between $\omega_{y_i}$ and $x_i$ , incorporating an additional penalty $m$ for the angular margin applied to angle $\theta_{y_i}$ , to strengthen coherence within the class while increasing differentiation between different classes. The second term, $\cos \phi_{y_i}$ , calculates the angle between the scaled proxy $\omega_{r_{y_i}}$ and its corresponding resultant vector $R_{y_i}$ . This can be expressed as the dot product between the two vectors: $\omega_{r_{y_i}}$ in reverse direction and $R_{y_i}$ . This aims to minimize the angle $\phi_{y_i}$ , ensuring that feature points remain close to their scaled proxies and do not extend beyond the boundaries of their respective radial hyperspheres. The last two terms, $\delta_{y_i}$ and $\delta_j$ , help to shift the features to their corresponding scaled proxy $\omega_{r_{y_i}}$ points over different radii hyperspheres and diverging $x_i$ features from different class proxies $\omega_{r_j}$ 's. It ensures inter-class separability in the radial direction across multi-hyperspherical manifolds. The $\delta_{y_i}$ term also results in the tighter clustering of class features around their respective $\omega_{r_{y_i}}$ leading to high class discrimination. The combined importance of the components $\cos \theta_{y_i}$ and $\cos \phi_{y_i}$ manifests itself in the minimization of angles $\theta$ and $\phi$ , using a more concentrated angular distribution of features aligning to the corresponding class proxies. Further, it prevents features from extending beyond their respective class radii. The loss's additional $\delta$ component contributes to the compact clustering and length amplification of $x_i$ vectors, shifting them to specific hypersphere radii $^2$ . + +Additionally, in the context of HyperSpaceX framework, the inductive bias effectively shapes the decision boundaries based on both radial and angular factors. We define the decision boundary as, + +$$ +\begin{array}{l} \left(\cos \left(\theta_ {1} + m\right) + \left| \left| x _ {1} \right| \right| _ {2}\right) - \left(\cos \left(\theta_ {2}\right) + \left| \left| x _ {2} \right| \right| _ {2}\right) = 0 \text {f o r c l a s s 1} \\ \left(\cos \left(\theta_ {1}\right) + \left\| x _ {1} \right\| _ {2}\right) - \left(\cos \left(\theta_ {2} + m\right) + \left\| x _ {2} \right\| _ {2}\right) = 0 \text {f o r c l a s s 2} \tag {2} \\ \end{array} +$$ + +This analysis of inductive bias in decision boundaries is built on binary classification and can effectively be extended to multi-class classification tasks. Consequently, the features learned through the radial-angular DistArc loss exhibit more separable decision boundaries and enhanced discriminative capabilities + +![](images/b6e75836315174dd6b37ee174a9af0205ae950dc1dc0345c8d87828387aaec5d.jpg) + +![](images/4cd0957e4b650efe31cf0d88fbba4d242bd455e952d5affddccea41716d58bb4.jpg) + +![](images/eadd8e59cd529eff3475b410ec736e6d5d8df017e5f65912e95578909aa953b0.jpg) + +![](images/a85122bbac1335527ea5955098dea4984b03d9d136d105e14c271ebf7c8c11c4.jpg) +(a) + +![](images/445c69662e3ef602885bf8a11d27ce09b07f379725d3f4f5bcc750fd4c96cafb.jpg) +(b) + +![](images/ee8c7a6559a8dadddfb3084f378e82416f0e46ddd35c984cf0a44f51ffe41b47.jpg) +(c) +Fig. 3: The 2-D (in first row) and 3-D (in second row) latent space visualization of features learnt through (a) metric-based loss functions, (b) Angular-softmax-based loss functions, and (c) the proposed Radial-Angular DistArc loss. Further showing the decision-making process of assigning a test sample $x$ to the most favourable class distribution represented using either class center $c$ or proxy vector $\omega$ . + +among class features. A more comprehensive derivation of the decision boundary influenced by inductive bias, elucidating its dependency on angles $\phi$ , $\theta$ , and resultant vector $R$ is present in the supplemental. + +# 3 Predictive Measure and Latent Space Visualization + +The most prevailing choice for evaluating and categorizing a sample involves determining the category by calculating the maximum prediction from the model's predicted probability distribution. The proposed framework identifies the most favourable class distribution across multi-hyperspherical manifolds by considering a combination of angular and radial factors. An optimal class prediction is determined through a distinct approach that helps the evaluation metric, taking into account the radial and angular aspects of hyperspheres. The procedure encompasses the computation of resultant vectors between a sample's feature vector and each scaled proxy through mathematical formulation defined as $R_{i} = x - \omega_{r_{i}} (\forall i \in 1,2,3,\ldots)$ . The resultant vector with the smallest magnitude determines the most favourable class proximity. Cosine law of triangle length computation is employed to determine the length of the resultant vector $R$ based on learned and computed angles $\theta$ , $\phi$ and a magnitude of feature vector $x$ . Eq. 3 defines the formulation for $R_{i}$ 's length computation for every $i^{th}$ category. + +$$ +\left| \left| R _ {i} \right| \right| _ {2} = \left| \left| x \right| \right| _ {2} \cos \phi_ {i} + \left| \left| \omega_ {r _ {i}} \right| \right| _ {2} \cos (\pi - \left(\theta_ {i} + \phi_ {i}\right)) \tag {3} +$$ + +We introduce a favourable class determining predictive measure for the HyperSpace $X$ framework with its radial-angular based formulation, i.e., + +$$ +\hat {y} = \underset {R _ {m}} {\arg \min } \left\{R _ {m} \in \mathbb {R} ^ {K}: R _ {m} \right\} \tag {4} +$$ + +where $R_{m} \in \mathbb{R}^{K}$ refers to a vector comprising magnitude of resultant vectors between a sample's feature vector $x \in \mathbb{R}^{d}$ and scaled proxy matrix $\omega_{r} \in \mathbb{R}^{d \times K}$ representing the radii scaled $K$ -class proxies, and $\hat{y}$ defines a predicted class distribution. The predicted class distribution for a specific sample is effectively represented by the class having the smallest resultant vector magnitude in relation to that sample. The derivation of a predictive measure formulation is provided in the supplementary material. + +During testing, the class of a test sample is determined by its feature representation predicted by the model, influenced by the loss function during training. Fig. 3 displays visual representations of 2D and 3D latent space features, elucidating the decision-making process for classifying a test sample. This is achieved by employing a nearest distance class measure, calculated as the Euclidean distance, as shown in Fig. 3a. In Fig. 3b, the class prediction process is shown, based on angular distance within a unit hypersphere. Lastly, Fig. 3c describes the probable class selection process by finding the vector with the least magnitude across multi-hyperspherical manifolds. As shown in Fig. 4a.i, the cross-entropy loss facilitates class feature separation, leaving intermixed features that affect prediction confidence due to lack of discriminability. Conversely, angular-softmax losses, introducing angular-margin penalties to enhance cosine similarity among embeddings, aiming separation and discriminability still causes inter-mixed feature representations (depicted via Fig. 4a.ii). HyperSpaceX framework with DistArc loss, presents a solution by distributing features across various angles on multiple hyperspheres, achieving better separation and discriminability by integrating both angular and radial dimensions. This approach results in a more distinct feature arrangement between classes, as demonstrated in Fig. 4a.iii), indicating the effectiveness of DistArc loss in creating a more discriminable and separable feature space. + +# 4 Experimental Setup + +The experimental approach is designed to analyze the distribution of features in the latent space across various image classification and face recognition tasks. We have trained and tested the proposed HyperSpaceX framework on well-known benchmark datasets: (a) seven image classification datasets including MNIST [4], FashionMNIST [32], CIFAR-10 [11], CIFAR-100 [11], CUB-200 [27], TinyImageNet [13] and ImageNet-1K [2], and (b) six face recognition datasets including LFW [10], CFP-FP [23], AgeDB-30 [18], CA-LFW [37], CP-LFW [36] datasets (CASIA-WebFace [33] is used for initial model training). Model is also trained on 1500 subjects of D-LORD [17] dataset and tested on 600 different test subjects. Implementation Details: The HyperSpaceX framework undergoes training using various deep neural network backbones, including the iResNet50 architecture [6], [9], the ViT and RN101 backbones [5] from the CLIP foundation model [20]. The models are trained using DistArc loss and several variants of softmax-based loss functions, including Cross-entropy, CosFace and ArcFace loss, and also with Orthogonal projection loss. For image classification, the model + +![](images/f4fc35a92fc53e9bba9b05dff9b90ad175b4b700f27bb1127cc5ef2a916a67e8.jpg) +Fig. 4: (a) Illustrating comparative visual analysis of the organization of MNIST class feature distribution in the latent space. The feature representations are learned using (i) Cross-entropy loss, (ii) ArcFace loss, and (iii) the proposed DistArc loss on the MNIST database, where each color represents a unique class. While (b) depicts the subclass organization of the CIFAR-100 dataset on 2D multi-hyperspherical manifolds. The color of each line denotes a distinct superclass, facilitating angular separability. Subclasses within each superclass are distinguished radially, with each superclass represented as blobs extending radially from the superclass center. + +![](images/42bae49df832fb3b150abf2f85dfbf27ca6e3cb6d9bb95e3cc6c3ec843a5923b.jpg) +(a) + +![](images/c3ca6b44ac613349df8846afd0351573918789a9fa6a14ff8dcdf538e7ea30d7.jpg) + +![](images/0be716b039d77716bd6f0a9f8cc987719365d54560a99aa5739f16c87ef84c77.jpg) +(b) + +undergoes both training and testing in a classification setting. We train models for small-class simple datasets like MNIST and FashionMNIST with an SGD optimizer at a learning rate of $1e - 2$ and a weight decay of $5e - 4$ . We further set the value of $m = 0.4$ and $\lambda = 0.003$ in the DistArc loss components. For complex datasets like CIFAR-10, CIFAR-100, CUB-200 and TinyImageNet, the value of $\lambda$ is set to 0.005. Other hyperparameters remain the same. For face recognition, the training is conducted by employing a classification setup, while during testing, face verification is performed using image pairs with class-set disjoint from training. In the face recognition task, the training is performed on the CASIA-WebFace dataset in the classification setting and testing is performed in the verification setup on LFW, CFP-FP, AgeDB-30, CA-LFW and CP-LFW datasets. The SGD optimizer with a learning rate of $1e - 3$ and weight decay of $5e - 4$ is utilized for both the classifier and backbone network. However, in this task $\lambda$ is varied based on the number of epochs. We initialize by setting $\lambda$ to 0.001 and increasing it by an addition of 0.001 after every tenth epoch and stop updating after reaching the value of 0.005. + +# 5 Results and Analysis + +Image Classification Results: We first present the results pertaining to how class features are organized across a range of embedding sizes, from low (2D) to high (512D) and very high (2048D) dimensions, distributed across radial-hyperspherical manifolds. Table 1 showcases the performance on multi-class datasets like CIFAR-100 [11] and TinyImageNet [13], achieved by employing different backbone architectures trained with a variety of loss functions. This highlights the effectiveness of our HyperSpaceX framework, which utilizes DistArc loss for training. This method enhances class distinctiveness, typically outper + +Table 1: Performance comparison (accuracy in %) on image classification task between the proposed DistArc and other loss functions utilized for training models with multiple backbones. The best and second best performances are bolded and underlined. + +
CIFAR-100Tiny-Imagenet
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArcCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]47.1251.4846.9245.2062.0614.0316.0313.7817.7320.89
RN101 [20]37.8436.0235.1238.8553.9517.9616.2218.1020.5532.97
ViT-B [20]58.3656.2753.9657.0477.9337.5842.9436.2536.4954.11
ViT-L [20]67.8966.4463.8166.2779.5645.9344.0649.3446.2068.21
512iResNet50 [6]83.0580.2280.0181.2881.6261.8360.0258.3963.0663.27
RN101 [20]69.3970.8468.3769.1175.5853.0453.0151.7752.8554.40
ViT-B [20]81.9981.5879.4680.9282.6278.3874.2272.6174.4276.03
ViT-L [20]88.7587.2785.4084.8389.4886.4985.5581.8485.9486.79
2048iResNet50 [6]85.2284.2986.8286.1489.1061.3963.9262.4062.7164.20
RN101 [20]79.4078.1577.0678.2280.3754.1353.2853.8754.1059.06
ViT-B [20]81.0479.3379.2980.7283.0079.5478.3779.2677.0080.37
ViT-L [20]87.5985.9384.7490.2090.2085.0381.3982.4886.0486.94
+ +forming models trained with conventional loss functions such as Cross-entropy, ArcFace, CosFace, and Orthogonal Projection Loss (OPL). These results also showcase that the DistArc loss leads to features with enhanced separability and discrimination due to its effective exploration of both radial and angular dimensions within each hyperspherical latent space. This approach results in a significant performance increase: in TinyImageNet classification tasks, we observe an increase of over $22\%$ in 2D, around $1.44\%$ in 512D, and $4.93\%$ in 2048D spaces, when benchmarked against cross-entropy loss and various softmax-angular margin-based loss functions. A similar trend of substantial improvement is observed for the CIFAR-100 dataset, showing improvements of up to $19.57\%$ in 2D, $6.19\%$ in 512D, and $2.61\%$ in 2048D spaces. + +Fig. 4b illustrates the subclass and class-based feature distribution for CIFAR-100 categories, arranging each subclass angularly within its superclass group across different radial spaces. This setup enhances radial separability for subclasses and angular separability for superclasses, leading to clear distinctions between them. Furthermore, subclasses are compactly positioned according to their radial and angular coordinates, showcasing precise class feature discrimination. This organized feature distribution demonstrates the capability for a more defined feature arrangement, optimizing representation in lower-dimensional spaces and simplifying model complexity. Consequently, Fig. 4b uses color differentiation to distinguish between unrelated classes, while same-colored points on different radii indicate subclasses belonging to the same superclass, thereby facilitating a methodical learning of class arrangements in multi-radial spaces for refined differentiation between classes and their subclasses. + +The results for the CUB-200 dataset [27], a large multi-class image classification challenge focusing on bird categorization, are shown in Table 2. Classifying images in the CUB-200 dataset is particularly demanding due to the subtle, unique features each bird species has, despite the commonality of features like beaks and wings. This demands an emphasis on fine-grained, distinct characteris + +Table 2: Comparative performance (accuracy in %) analysis on CUB-200 dataset between proposed DistArc and other loss functions used for training models with multiple backbones. The best and second best performances are bolded and underlined. + +
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]7.506.197.0711.5918.09
RN101 [20]11.4410.4711.4212.8431.50
ViT-B [20]18.7020.6319.0417.0625.93
ViT-L [20]25.4822.8524.1927.7748.11
512iResNet50 [6]61.2963.4760.2962.8370.48
RN101 [20]51.4050.8550.1154.2658.44
ViT-B [20]67.9368.7068.1870.3676.06
ViT-L [20]80.7978.2779.6680.6583.28
+ +Table 3: Evaluating model performance (accuracy in%) using conventional and proposed predictive measures in the HyperSpaceX framework when trained using DistArc loss on backbones with 512-D embedding size. The best performances are bolded. + +
BackboneCIFAR-100CUB-200TinyImageNet
Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)
iResNet50 [6]80.2981.6269.5670.4861.9363.27
RN101 [20]71.0575.5858.1958.4454.3354.43
ViT-B [20]78.9982.6274.9176.0676.1076.03
ViT-L [20]88.2089.4882.8583.2882.5186.79
+ +ties of different bird body parts when developing bird image classification models. In such challenging scenario, as shown in Table 2, the HyperSpaceX framework outperforms existing methods. Models trained with DistArc loss achieved a significant performance boost of approximately $20.34\%$ using a ViT-L backbone with a 2D last embedding layer. Additionally, DistArc loss trained models excelled in higher-dimensional latent spaces. This success is attributed to our approach's adeptness in discriminately mapping various bird class features across distinctively separated radii and angles in a multi-hyperspherical space, while simultaneously compacting features within the same bird class. + +Reduced Latent Space Representation: Table 1 and Table 2 represent the performance on several backbones having the last embedding layer of size 2. It signifies that on complex datasets such as CIFAR-100, CUB-200 and TinyImageNet, the proposed radial-angular feature learning approach in a 2-D latent space achieves a performance boost of $16\%$ to $20\%$ over traditional cross-entropy loss methods even with large number of classes. Experimental results on the CUB-200 dataset also depict the high separability among various low-variance classes. Quantitatively, we can deduce that while dimensionality reduction for large complex datasets from a higher dimension of 512 and 2048 to the lower dimension of 2 embedding space, cross-entropy loss observes a $40 - 42\%$ performance gap while DistArc loss successfully reduced this disparity to $20 - 24\%$ . + +Predictive Measures Analysis: In the Image classification task, the class predictions are generally made utilizing the model's classification layer, adopted for + +![](images/35cb5e787bde808b3cb9edb8168447c48d192a329f58f0d6683d4a574c31ea81.jpg) + +![](images/672278872e3c7d71a16c5f43a2b6b97f15cd19390b23cca23aca0949d75dbd4b.jpg) + +![](images/b4c53e5e32023ab3aeedaa08b25bc09c01c8e29b3e4719b93ab6837362761dcc.jpg) + +![](images/f06f2b44c000d1dd2af7875ec9586066fe0c2d95f85f6da74ecfdf3d09f664a1.jpg) + +![](images/d65979d87cd3e7dd0e3a09824823769a884508183f5bef1a9687fc30f2525937.jpg) + +![](images/aa20bea31c157fb07f635a706ab6ba531299a863814b22be422a843d1e8d4df3.jpg) + +![](images/c32f31328fb5c87fb11a05dad0b3b895a1b72637c2bd88b598bc801cd9dad7ef.jpg) +Fig. 5: Analysis of loss functions using small-class simple datasets (a) MNIST and (b) FashionMNIST, and complex dataset (c) CIFAR-10. The first row visualizes the features, showcasing the outcomes of learning with DistArc loss over 2D multi-spherical manifolds. The last two rows illustrate classification performance of different backbones with a 2-D and 512-D embedding sizes, trained using Cross-entropy and DistArc loss. + +![](images/adcc695b6d815e3c6ac330851c7911c97841c895bae5d39c8683cbb9578dc708.jpg) + +![](images/8da0f7e560de343dce767201fb36fc8f9f54b4e2d83e0bb683a36f8048dcb895.jpg) + +models trained with various existing loss functions except for DistArc loss, for results presented in Table 1 and Table 2. The proposed DistArc loss, the predictions are computed using the newly introduced radial-angular based predictive measure defined in section 3. The comparison of utilizing traditional and proposed predictive measures in the HyperSpaceX framework is shown via Table 3. From the outperforming results shown, it can be analyzed that the proposed radial-angular-based predictive measure is effective over the conventional approach of predictions from the final classification layer for models trained using DistArc loss due to different radii of classes. + +Performance of HyperSpaceX on a Large-Scale Image Dataset: Table 4 provides the details the performance of the proposed framework after finetuning on the ImageNet-1K dataset [2]. We observe that the proposed DistArc loss outperforms existing methods for embedding sizes of 32 and 128. It also achieves the second-highest performance at 512 dimensions. As the number of classes grows, ArcFace finds it difficult to manage many feature points on a unit hypersphere. This demonstrates the benefit of strategically arranging features in a multi-radial hyperspherical space using DistArc loss during model training. + +HyperSpaceX Performance on Datasets with Fewer Classes: Fig. 5 showcases the performance and feature visualization for MNIST, FashionMNIST, and CIFAR-10 datasets. The top row of Fig. 5 illustrates the 2D-latent space feature organization across multi-radial hyperspherical manifolds, highlighting the + +Table 4: Classification Accuracy (%) Table 5: Ablation study of DistArc on ImageNet-1K dataset using iRes-loss, reporting classification performance [6]. The best and second best performance (in %) for various image classifi-cormances are bolded and underlined. fication datasets. + +
Embedding SizeCross EntropyArcFaceDistArcLoss ComponentsMNISTFashion-MNISTCIFAR-10
3248.2543.0555.91cos(θ)98.9793.6994.81
12865.1858.6265.30cos(θ) & cos(φ)98.9393.7295.16
51269.2759.6767.90cos(θ) & δ99.0194.8395.31
cos(θ) & cos(φ) & δ99.1995.0496.03
+ +strategic angular positioning. This arrangement emphasizes the significant distance between features of unrelated classes and the closeness of features within the same class, facilitating accurate class predictions. The subsequent rows display a comparison of classification accuracy across different models trained using cross-entropy and DistArc loss functions in 2D and 512D latent spaces. These findings illustrate the superior performance of the HyperSpaceX framework across both simple (MNIST, FashionMNIST) and more complex (CIFAR-10) datasets with a smaller number of classes. + +Training Convergence Analysis: The training convergence rates of the DistArc loss were benchmarked against existing loss functions. Training with softmax cross-entropy loss shows only a slight decrease in loss values. In contrast, DistArc loss significantly restructures the feature space layout by dispersing identities across various radial hyperspheres. This approach leads to higher initial loss figures that efficiently reduce to a minimum of 0.22, surpassing the reduction achieved with softmax cross-entropy (0.34), CosFace (2.31), ArcFace (1.51), and OPL (0.68) loss functions. A detailed comparison illustrating the training convergence rates of loss functions is available in the supplementary file. + +Ablatic Analysis of DistArc: Table 5 shows the ablation analysis on three image classification datasets, MNIST, FashionMNIST, and CIFAR-10, while utilizing ViT-B architecture (embedding size 512). The first and second row of Table 5 shows the efficacy of performance improvement over angular separation through $\theta$ and $\phi$ , and the third row shows the improvement with radial and angular factors due to $\delta$ and $\theta$ terms. While, the last row shows the highest performance achieved by including all $\theta$ , $\phi$ and $\delta$ components into the loss formulation, highlighting the importance of each component. + +Face Recognition Results: Table 6 showcases detailed comparative results of the DistArc loss against other loss functions in face recognition tasks. Utilizing the iResNet50 architecture and training on the CASIA-WebFace dataset, we have evaluated verification performance with a 512-dimensional embedding. The DistArc loss demonstrates state-of-the-art (SoTA) results on LFW and CP-LFW datasets and near state-of-the-art results on other datasets. Additionally, experiments with the iResNet50 backbone on the MS1Mv2 dataset—a derivative of the now-withdrawn MS-Celeb dataset—were conducted to ensure a fair comparison with SoTA methods are included in supplementary materials. The DistArc loss trained model achieved following results: $99.82\%$ on LFW and $98.21\%$ on AgeDB + +Table 6: Quantitative results (in %) of face recognition models trained using different loss functions. The best and second best performances are bolded and underlined. + +
LossLFWCFP-FPAgeDB-30CA-LFWCP-LFW
Triplet98.9891.9089.98--
Center loss [30]99.28--85.4877.48
Softmax99.0894.3992.3388.1784.85
Norm-Softmax98.5689.7988.72--
SphereFace [16]99.1194.3891.7092.5590.90
CosFace (m=0.35) [28]99.1095.4492.9892.8391.03
ArcFace (m=0.45) [3]99.4695.4794.9392.4790.85
SphereFace2 [29]99.50-93.6893.4791.07
DistArc (m=0.4)99.5495.4194.0393.3291.10
+ +30, surpassing results from SphereFace, CosFace, ArcFace, and SphereFace2 $^3$ . These findings highlight the HyperSpaceX framework's proficiency in crafting highly discriminative and distinct features within the latent space. + +The HyperSpaceX framework is also evaluated on the D-LORD [17] dataset, a large-scale open-set surveillance dataset with 600 test subjects, using a deep metric learning approach [19]. With ArcFace, a Rank-1 identification accuracy of $61.84\%$ was achieved, while DistArc achieved $62.71\%$ . For Rank-5 accuracy, the results were $65.89\%$ and $66.03\%$ , respectively, indicating that DistArc is more effective at learning enhanced discriminative features than ArcFace. + +# 6 Conclusion + +In this research, we introduce the HyperSpaceX framework, which navigates both angular and radial dimensions, facilitating a uniquely distinguishable and discernible arrangement of class features within multi-hyperspherical manifold space. This is achieved using the novel DistArc loss, which leverages the radial and angular components of the feature space. This loss function significantly enhances the cohesion among similar class features while concurrently maximizing the distances between different classes, resulting in more precise and discriminative feature representation. To evaluate the performance of this radial-angular framework, we introduce a predictive measure that utilizes the shortest resultant vector between the embeddings of test samples and proxy vectors, offering a deeper insight into the model's performance. The efficacy of HyperSpaceX is demonstrated through comprehensive experiments on seven image classification datasets and six face recognition datasets. The proposed methodology shows improvements in handling a diverse array of image and face datasets, ranging from simpler to more complex and large-scale collections encompassing several classes and samples. + +# Acknowledgements + +Chiranjeev and Thakral received partial support from the PMRF Fellowship, and Vatsa is partially supported by the Swarnajayanti Fellowship. + +# References + +1. Conniffe, D.: Expected maximum log likelihood estimation. Journal of the Royal Statistical Society: Series D (The Statistician) 36(4), 317-329 (1987) +2. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009) +3. Deng, J., Guo, J., Xue, N., Zafeiriou, S.: Arcface: Additive angular margin loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4690-4699 (2019) +4. Deng, L.: The mnist database of handwritten digit images for machine learning research [best of the web]. IEEE signal processing magazine 29(6), 141-142 (2012) +5. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020) +6. Duta, I.C., Liu, L., Zhu, F., Shao, L.: Improved residual networks for image and video recognition. In: Int. Conf. Pattern Recog. pp. 9415-9422. IEEE (2021) +7. Gallo, I., Nawaz, S., Calefati, A., Janjua, M.K.: Git loss for deep face recognition. In: Brit. Mach. Vis. Conf. p. 313. BMVA (2018) +8. Guo, G., Zhang, N.: A survey on deep learning based face recognition. Comput. Vis. Image Underst. 189, 102805 (2019) +9. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 770-778 (2016) +0. Huang, G.B., Mattar, M., Berg, T., Learned-Miller, E.: Labeled faces in the wild: A database for studying face recognition in unconstrained environments. In: Workshop on faces in Real-Life Images: detection, alignment, and recognition (2008) +1. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009) +2. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Adv. Neural Inform. Process. Syst. 25 (2012) +3. Le, Y., Yang, X.: Tiny imagenet visual recognition challenge. CS 231N 7(7), 3 (2015) +4. LeCun, Y., Boser, B., Denker, J.S., Henderson, D., Howard, R.E., Hubbard, W., Jackel, L.D.: Backpropagation applied to handwritten zip code recognition. Neural computation 1(4), 541-551 (1989) +5. Li, L., Zhang, Y., Huang, A.: Learnable subspace orthogonal projection for semi-supervised image classification. In: ACCV. pp. 477-490. Springer (2022) +6. Liu, W., Wen, Y., Yu, Z., Li, M., Raj, B., Song, L.: Spherface: Deep hypersphere embedding for face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 212-220 (2017) +7. Manchanda, S., Bhagwatkar, K., Balutia, K., Agarwal, S., Chaudhary, J., Dosi, M., Chiranjeev, C., Vatsa, M., Singh, R.: D-lord: Dysl-ai database for low-resolution disguised face recognition. IEEE Trans. on Biom., Behav., and Ident. Sci. (2023) + +18. Moschoglou, S., Papaioannou, A., Sagonas, C., Deng, J., Kotsia, I., Zafeiriou, S.: Agedb: the first manually collected, in-the-wild age database. In: IEEE Conf. Comput. Vis. Pattern Recog. Worksh. pp. 51-59 (2017) +19. Oh Song, H., Xiang, Y., Jegelka, S., Savarese, S.: Deep metric learning via lifted structured feature embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4004-4012 (2016) +20. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Int. Conf. Mach. Learn. pp. 8748-8763. PMLR (2021) +21. Ranasinghe, K., Naseer, M., Hayat, M., Khan, S., Khan, F.S.: Orthogonal projection loss. In: Int. Conf. Comput. Vis. pp. 12333-12343 (2021) +22. Schroff, F., Kalenichenko, D., Philbin, J.: Facenet: A unified embedding for face recognition and clustering. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 815-823 (2015) +23. Sengupta, S., Chen, J.C., Castillo, C., Patel, V.M., Chellappa, R., Jacobs, D.W.: Frontal to profile face verification in the wild. In: Winter Conf. on App. of Comput. Vis. pp. 1-9. IEEE (2016) +24. Sermanet, P., Eigen, D., Zhang, X., Mathieu, M., Fergus, R., LeCun, Y.: Overfeat: Integrated recognition, localization and detection using convolutional networks. arXiv preprint arXiv:1312.6229 (2013) +25. Sohn, K.: Improved deep metric learning with multi-class n-pair loss objective. Adv. Neural Inform. Process. Syst. 29 (2016) +26. Sun, Y., Chen, Y., Wang, X., Tang, X.: Deep learning face representation by joint identification-verification. Adv. Neural Inform. Process. Syst. 27 (2014) +27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: Caltech-ucsd birds-200-2011 (cub-200-2011). Tech. Rep. CNS-TR-2011-001, California Institute of Technology (2011) +28. Wang, H., Wang, Y., Zhou, Z., Ji, X., Gong, D., Zhou, J., Li, Z., Liu, W.: Cosface: Large margin cosine loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5265-5274 (2018) +29. Wen, Y., Liu, W., Weller, A., Raj, B., Singh, R.: Spherical face classification is all you need for deep face recognition. In: Int. Conf. Learn. Represent. (2022) +30. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Eur. Conf. Comput. Vis. Springer (2016) +31. Wu, C.Y., Manmatha, R., Smola, A.J., Krahenbuhl, P.: Sampling matters in deep embedding learning. In: Int. Conf. Comput. Vis. pp. 2840-2848 (2017) +32. Xiao, H., Rasul, K., Vollgraf, R.: Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747 (2017) +33. Yi, D., Lei, Z., Liao, S., Li, S.Z.: Learning face representation from scratch. arXiv preprint arXiv:1411.7923 (2014) +34. Zeiler, M.D., Fergus, R.: Visualizing and understanding convolutional networks. In: Eur. Conf. Comput. Vis. pp. 818-833. Springer (2014) +35. Zhang, Z., Sabuncu, M.: Generalized cross entropy loss for training deep neural networks with noisy labels. Adv. Neural Inform. Process. Syst. 31 (2018) +36. Zheng, T., Deng, W.: Cross-pose lfw: A database for studying cross-posed face recognition in unconstrained environments. Beijing University of Posts and Telecommunications, Tech. Rep 5(7) (2018) +37. Zheng, T., Deng, W., Hu, J.: Cross-age LFW: A database for studying cross-age face recognition in unconstrained environments. CoRR abs/1708.08197 (2017) \ No newline at end of file diff --git a/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/images.zip b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..6430bb8b8f36e04d4f0a8c2dbabe1dce3d2e63e9 --- /dev/null +++ b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a647e6c58ed8b97caff092662b97ac98faa0cf8299057013acb6b2c8ae7e392d +size 407350 diff --git a/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/layout.json b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..47c97d1cf574d200414cae41447f36417fbf449d --- /dev/null +++ b/2024/HyperSpaceX_ Radial and Angular Exploration of HyperSpherical Dimensions/layout.json @@ -0,0 +1,9961 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 133, + 111, + 483, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 111, + 483, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 111, + 483, + 148 + ], + "type": "text", + "content": "HyperSpaceX: Radial and Angular Exploration of HyperSpherical Dimensions" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 141, + 168, + 473, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 168, + 473, + 194 + ], + "spans": [ + { + "bbox": [ + 141, + 168, + 473, + 194 + ], + "type": "text", + "content": "Chiranjeev Chiranjeev, Muskan Dosi, Kartik Thakral Mayank Vatsa and Richa Singh" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 176, + 202, + 438, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 202, + 438, + 236 + ], + "spans": [ + { + "bbox": [ + 176, + 202, + 438, + 236 + ], + "type": "text", + "content": "Indian Institute of Technology Jodhpur, India {chiranjeev.1,dosi.1,thakral.1,mvatsa,richa}@iitj.ac.in https://github.com/IAB-IITJ/HyperSpaceX" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 169, + 246, + 444, + 338 + ], + "blocks": [ + { + "bbox": [ + 169, + 246, + 444, + 338 + ], + "lines": [ + { + "bbox": [ + 169, + 246, + 444, + 338 + ], + "spans": [ + { + "bbox": [ + 169, + 246, + 444, + 338 + ], + "type": "image", + "image_path": "8396ba67b03bde4741884bbcb8e8d53ed923e992e18e4117b5bfd839dd4be1ef.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 345, + 482, + 411 + ], + "lines": [ + { + "bbox": [ + 130, + 345, + 482, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 345, + 482, + 411 + ], + "type": "text", + "content": "Fig. 1: Visual concept of the proposed HyperSpaceX framework: It utilizes a novel radial-angular latent space on hyperspherical manifolds to differentiate features effectively. Initially, class features are indistinguishable due to overlap. The proposed DistArc loss exhibits two feature arrangement learning: high inter-class variation employing multi-radial angular arrangement and minimal intra-class distance, leading to highly separable-discriminable class features." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 425, + 453, + 634 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 425, + 453, + 634 + ], + "spans": [ + { + "bbox": [ + 159, + 425, + 453, + 634 + ], + "type": "text", + "content": "Abstract. Traditional deep learning models rely on methods such as softmax cross-entropy and ArcFace loss for tasks like classification and face recognition. These methods mainly explore angular features in a hyperspherical space, often resulting in entangled inter-class features due to dense angular data across many classes. In this paper, a new field of feature exploration is proposed known as HyperSpaceX which enhances class discrimination by exploring both angular and radial dimensions in multi-hyperspherical spaces, facilitated by a novel DistArc loss. The proposed DistArc loss encompasses three feature arrangement components: two angular and one radial, enforcing intra-class binding and inter-class separation in multi-radial arrangement, improving feature discriminability. Evaluation of HyperSpaceX framework for the novel representation utilizes a proposed predictive measure that accounts for both angular and radial elements, providing a more comprehensive assessment of model accuracy beyond standard metrics. Experiments across seven object classification and six face recognition datasets demonstrate state-of-the-art (SoTA) results obtained from HyperSpaceX, achieving up to a " + }, + { + "bbox": [ + 159, + 425, + 453, + 634 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 159, + 425, + 453, + 634 + ], + "type": "text", + "content": " performance improvement on large-scale object datasets in lower dimensions and up to " + }, + { + "bbox": [ + 159, + 425, + 453, + 634 + ], + "type": "inline_equation", + "content": "6\\%" + }, + { + "bbox": [ + 159, + 425, + 453, + 634 + ], + "type": "text", + "content": " gain in higher dimensions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 643, + 455, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 643, + 455, + 664 + ], + "spans": [ + { + "bbox": [ + 160, + 643, + 455, + 664 + ], + "type": "text", + "content": "Keywords: Representation Learning " + }, + { + "bbox": [ + 160, + 643, + 455, + 664 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 643, + 455, + 664 + ], + "type": "text", + "content": " Image Classification " + }, + { + "bbox": [ + 160, + 643, + 455, + 664 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 643, + 455, + 664 + ], + "type": "text", + "content": " Face Recognition" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 229, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 229, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 229, + 127 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 142, + 482, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 142, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 142, + 482, + 274 + ], + "type": "text", + "content": "The advancement in image classification and face recognition has greatly benefited from the introduction of innovative loss functions, designed to better differentiate between class features. These functions are crafted to learn unique representations for each class by employing proxies or weight vectors to increase the distinction between classes. Traditional image classification techniques [14], [12], [24], [34] primarily rely on cross-entropy loss [1], [35] to create intricate class boundaries and improve model generalization. However, a common limitation of these approaches is their tendency to neglect the reduction of within-class feature distances while failing to adequately separate features between different classes. This results in the blending of feature points from dissimilar classes, thus leading to reduced accuracies in object classification and face verification tasks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 274, + 482, + 537 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 274, + 482, + 537 + ], + "spans": [ + { + "bbox": [ + 130, + 274, + 482, + 537 + ], + "type": "text", + "content": "To address this gap, several modifications to softmax-based loss functions have been introduced, utilizing proxy-based methods to cluster similar class features while concurrently expanding the separation between dissimilar ones within the latent space. For face recognition, existing approaches [3], [8], [16], [26], [28] leverage proxy-based objectives to achieve better feature separability on a hypersphere through angular dimensions. Methods such as SphereFace [16], [29] and ArcFace [3] introduce angular margins to promote large-margin discriminative feature learning, while CosFace [28] incorporates marginal cosine functions to modify softmax loss by equalizing radial variations, introducing a cosine margin for angular decision boundaries. Furthermore, face recognition has benefited from proxy-free training strategies that focus on deep metric learning techniques [19], [22], [25], [31]. These strategies generate embeddings that bring similar faces closer together while keeping dissimilar ones apart, adapting effectively to various conditions without the need for explicit class labels. However, methods like triplet learning [22] and contrastive loss [31] depend heavily on the availability of extensive image pairs or triplets for effective training and often face difficulties with hard-pair mining. Other discriminative loss functions like Center loss [30] and Git loss [7] encounter difficulties in updating class center parameters with a large identity count, adding computational cost. Orthogonal Projection Loss (OPL) [21] and Learnable Subspace Orthogonal Projection [15] employ orthogonal projection constraints to improve separability between classes, but this approach restricts the number of classes to " + }, + { + "bbox": [ + 130, + 274, + 482, + 537 + ], + "type": "inline_equation", + "content": "2^d" + }, + { + "bbox": [ + 130, + 274, + 482, + 537 + ], + "type": "text", + "content": " in d-dimensional space." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 538, + 482, + 645 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 538, + 482, + 645 + ], + "spans": [ + { + "bbox": [ + 130, + 538, + 482, + 645 + ], + "type": "text", + "content": "The limitations of traditional loss functions, including those modified for angular space, have led to challenges in effectively differentiating between features. The issue occurs when features of closely related classes overlap, causing uncertainties in the correct identification or classification of subjects1. This overlap of class features makes it difficult to discern between unique identities or classes, thereby impacting the overall performance. To overcome these limitations, we propose the HyperSpaceX framework, a novel approach that extends the exploration of feature space beyond the angular to include radial dimensions in multi-hyperspherical latent spaces. It introduces a loss function that emphasizes" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 280, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 280, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 280, + 665 + ], + "type": "text", + "content": "It is further analyzed in section 3" + } + ] + } + ], + "index": 6 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "the arrangement of features to increase inter-class separability and intra-class compactness. Through the effective combination of angular and radial organization of features, the framework aims to minimize the overlap among inter-class data points, presenting a novel discriminative feature representation approach for image classification and face recognition. The key highlights are:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 136, + 191, + 484, + 399 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 136, + 191, + 484, + 227 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 191, + 484, + 227 + ], + "spans": [ + { + "bbox": [ + 136, + 191, + 484, + 227 + ], + "type": "text", + "content": "1. Introducing HyperSpaceX, a novel discriminative feature representation and arrangement learning that explores both radial and angular dimensions within multi-hyperspherical spaces, enabling effective feature learning." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 136, + 229, + 482, + 276 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 229, + 482, + 276 + ], + "spans": [ + { + "bbox": [ + 136, + 229, + 482, + 276 + ], + "type": "text", + "content": "2. Developing the DistArc loss function, aimed at enhancing the discriminative power of deep learning models. It improves feature representation by promoting better separation between different classes and tighter clustering of features within the same class in the latent space." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 136, + 278, + 482, + 326 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 278, + 482, + 326 + ], + "spans": [ + { + "bbox": [ + 136, + 278, + 482, + 326 + ], + "type": "text", + "content": "3. Presenting a predictive measure to evaluate the model's performance, incorporating both radial and angular dimensions in multi-hyperspherical settings. This measure provides a more comprehensive understanding of the model's capabilities in handling complex feature distributions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 136, + 327, + 482, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 327, + 482, + 399 + ], + "spans": [ + { + "bbox": [ + 136, + 327, + 482, + 399 + ], + "type": "text", + "content": "4. Evaluating the proposed approach using seven object datasets (MNIST, FashionMNIST, CIFAR-10, CIFAR-100, CUB-200, TinyImageNet and ImageNet1K) and six face datasets (LFW, CFP-FP, AgeDB-30, CA-LFW, CP-LFW and D-LORD), showing its effectiveness in improving feature distinction and model accuracy across various data types and complexities, often achieving state-of-the-art results." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 427, + 334, + 441 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 427, + 334, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 427, + 334, + 441 + ], + "type": "text", + "content": "2 The HyperSpaceX Framework" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "type": "text", + "content": "In traditional hyperspherical angular latent spaces, identities or classes are delineated by distinct angular directions. However, with the increase in the number of classes and the volume of data for each class, overlaps and intersections in these class representations increases, leading to significant classification challenges, as they blur the distinction between different classes. To address the issue of feature overlap and the necessity for more defined class distinctions, we propose the HyperSpaceX framework. This framework utilizes a multi-hyperspherical space, drawing on both radial hyperspheres and angular dimensions to promote a discriminative distribution of class features. This learnable arrangement distribution is facilitated by the novel DistArc loss that significantly enhances class differentiation and separation along with the grouping of same-category features. DistArc strategically arranges features by considering both their angle and distance from the center, across various spherical layers. This method utilizes the diversity of spatial dimensions to establish clear and distinct areas within the spherical model, making it easier to define precise boundaries between classes. Such a multi-dimensional approach generates a more elaborate hyperspherical subspace, facilitating the creation of more efficient decision boundaries." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyperSpaceX" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 228, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 228, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 228, + 126 + ], + "type": "text", + "content": "2.1 Preliminaries" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": "Deep learning research has explored a variety of loss functions, among which Cross-entropy loss is most commonly used for classification tasks. Let " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "x_{i}" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "\\omega" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": " be the feature embedding and weight or proxy matrix, respectively. Cross-entropy loss is defined as " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "L_{\\mathrm{CE}} = -\\frac{1}{N}\\sum_{i=1}^{N}\\log\\frac{e^{\\omega_T x_i + by_i}}{\\sum_{j=1}^{K}e^{\\omega_T x_j + bj}}" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "\\omega_{y_i}" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": " signifies the proxy vector of the " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "y_{i}" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": "-th class. The term " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "b" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": " refers to the bias, " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": " represents the number of samples distributed over " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": " number of classes. This function calculates the expected loss between the predicted and actual class distributions, focusing on optimizing class separations without necessarily bringing similar class features closer or significantly distancing different classes. Such limitations can adversely affect image classification and face recognition performance, particularly under high intra-class variations. There have been attempts to enhance inter-class distinctions through loss functions like Orthogonal Projection Loss (OPL) [21], which introduces perpendicular margins between class features. However, these efforts are often overshadowed by the dominance of cross-entropy in optimization processes. Softmax-based losses, including those used in deep face recognition like SphereFace [16] [29], CosFace [28] and ArcFace [3], primarily rely on cross-entropy based formulation. Among these is ArcFace loss, one of the most popular angular-loss functions, which distinguishes itself by allocating features around class proxies within a hyperspherical space and applying an angular margin " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": " to enhance the cohesion within classes and the distinction between different classes. The mathematical formulation of ArcFace loss is represented as " + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "inline_equation", + "content": "L_{\\mathrm{ArcFace}} = -\\frac{1}{N}\\sum_{i=1}^{N}\\log\\frac{e^{\\cos(\\theta_{y_i} + m)}}{e^{\\cos(\\theta_{y_i} + m)} + \\sum_{j=1,j \\neq y_i}^{K}e^{\\cos\\theta_j}}" + }, + { + "bbox": [ + 130, + 137, + 482, + 419 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "content": "In this, " + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\cos\\theta" + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "content": " is calculated using cosine similarity between feature embedding " + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "content": " and proxy " + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\omega" + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "content": ", that is defined by computing a dot product between unit vectors of " + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\omega" + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "content": " as represented through " + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\cos(\\theta_{y_i}) = \\hat{x}_i \\cdot \\hat{\\omega}_{y_i} \\cos(\\theta_j) = \\hat{x}_i \\cdot \\hat{\\omega}_j" + }, + { + "bbox": [ + 130, + 419, + 482, + 491 + ], + "type": "text", + "content": ". However, focusing solely on angular dimensions can lead to ambiguity among classes in densely populated identity spaces, highlighting a need for broader exploration beyond angular metrics." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 510, + 277, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 277, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 277, + 521 + ], + "type": "text", + "content": "2.2 Proposed DistArc Loss" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "content": "The proposed DistArc loss navigates through radial and angular dimensions across multiple hyperspheres centered at the origin to improve class discrimination. The DistArc loss is formulated as," + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 177, + 576, + 481, + 609 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 177, + 576, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 177, + 576, + 481, + 609 + ], + "type": "interline_equation", + "content": "L _ {\\text {D i s t A r c}} = - \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\log \\frac {e ^ {\\cos \\left(\\theta_ {y _ {i}} + m\\right) + \\cos \\left(\\phi_ {y _ {i}}\\right) - \\lambda \\delta_ {y _ {i}}}}{e ^ {\\cos \\left(\\theta_ {y _ {i}} + m\\right)} + \\sum_ {j = 1 , j \\neq y _ {i}} ^ {K} e ^ {\\cos \\left(\\theta_ {j}\\right) - \\lambda \\delta_ {j}}} \\tag {1}", + "image_path": "d5866790a61d064bafb78e8c7e4bd37b827e1b313f706e474ed51b043da9b981.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " represents the weighing factor and " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\cos \\theta" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " defines the cosine of angle between embedding " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and a proxy vector " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\omega" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ". An angular-margin penalty of " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " is introduced in " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\cos \\theta" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " to enhance the feature discriminability. Fig. 2a represents the geometric illustration of " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\cos (\\theta_{y_i} + m)" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ". The DistArc loss minimizes the angle" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 214, + 114, + 277, + 178 + ], + "blocks": [ + { + "bbox": [ + 214, + 114, + 277, + 178 + ], + "lines": [ + { + "bbox": [ + 214, + 114, + 277, + 178 + ], + "spans": [ + { + "bbox": [ + 214, + 114, + 277, + 178 + ], + "type": "image", + "image_path": "c33b1ddbff03eed3bbf8f215b692fc4a58104e588496286f90cbc864f40c2dbb.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 237, + 180, + 247, + 190 + ], + "lines": [ + { + "bbox": [ + 237, + 180, + 247, + 190 + ], + "spans": [ + { + "bbox": [ + 237, + 180, + 247, + 190 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 277, + 114, + 345, + 180 + ], + "blocks": [ + { + "bbox": [ + 277, + 114, + 345, + 180 + ], + "lines": [ + { + "bbox": [ + 277, + 114, + 345, + 180 + ], + "spans": [ + { + "bbox": [ + 277, + 114, + 345, + 180 + ], + "type": "image", + "image_path": "ba2d9d8a595d36b1862197fffc2ca07726fb5b8ddcd7c4632e04a16ff29506bd.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 306, + 180, + 315, + 189 + ], + "lines": [ + { + "bbox": [ + 306, + 180, + 315, + 189 + ], + "spans": [ + { + "bbox": [ + 306, + 180, + 315, + 189 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "lines": [ + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "spans": [ + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": "Fig.2: The geometric interpretation of angular and radial formations in multihyperspherical dimensions in the training phase through (a) " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": " and angular-margin penalty " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": ", and (b) angle " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": " between scaled proxy vector " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "\\omega_{y_i}" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": " and resultant vector " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": ". (c) Shows the vector representation of " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "\\omega_{y_i}" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": " in a reverse direction for computing angle " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": " using cosine of an angle " + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 131, + 201, + 482, + 257 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 347, + 116, + 402, + 175 + ], + "blocks": [ + { + "bbox": [ + 347, + 116, + 402, + 175 + ], + "lines": [ + { + "bbox": [ + 347, + 116, + 402, + 175 + ], + "spans": [ + { + "bbox": [ + 347, + 116, + 402, + 175 + ], + "type": "image", + "image_path": "029d5119f7eecff79768b6fc3551d3748e9d2769cc118cf9ca6d1fc7c027be65.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 369, + 180, + 378, + 189 + ], + "lines": [ + { + "bbox": [ + 369, + 180, + 378, + 189 + ], + "spans": [ + { + "bbox": [ + 369, + 180, + 378, + 189 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\theta_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ", thereby increasing the cosine similarity between embeddings " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "x_i" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and their corresponding proxy's " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". However, to include the radial dimension also we incorporate the " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\cos \\phi_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " which represents the cosine of angle between radii scaled proxy vector " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and a resultant vector " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " of " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "x_i" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". Fig. 2b describes the geometric representation of the resultant vector " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " is modified while learning/training such that it minimizes the angle between " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " which is defined using " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i} = \\hat{\\omega}_{y_i} \\times r_y_i" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " is defined as " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i} = -\\omega_{r_y_i} + x_i" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i} \\in \\mathbb{R}^d" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i} \\in \\mathbb{R}^{d \\times 1}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "x_i \\in \\mathbb{R}^d" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". The resultant vector helps to maintain the embedding magnitude within the hyperspherical radii of magnitude " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "||\\omega_{r_y_i}||_2" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and further optimizes the embeddings " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "x_i" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": "'s to cluster in the angular direction by minimizing the angle " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "(\\phi_{y_i})" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " between " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i} \\colon \\cos (\\phi_{y_i}) = \\hat{R}_{y_i} \\cdot -\\hat{\\omega}_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". This equation, while calculating the " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\cos \\phi_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ", the origin is taken at " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\hat{\\omega}_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " which results " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\hat{\\omega}_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " vector to be in reverse direction leading to " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "-\\hat{\\omega}_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". We can visualize its vector representation from Fig. 2c representing the angle computation process between the reversely directed scaled proxy vector " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " and a resultant vector " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": ". The term " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\cos \\phi_{y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " within the proposed loss function " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "L_{DistArc}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " is designed to enhance the intra-class compactness of features with their respective scaled class proxies, " + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\omega_{r_y_i}" + }, + { + "bbox": [ + 130, + 280, + 482, + 521 + ], + "type": "text", + "content": " by optimizing both the radial and angular dimensions of different hyperspheres. This term also has a major significance in letting the distribution of each class to stay within particular radii hyperspheres in the feature space." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": "Through DistArc loss, the " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "\\cos \\theta_{y_i}" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": " optimizes to align the embeddings with class proxies " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "\\omega_{y_i}" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": " in the angular space and " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "\\cos \\phi_{y_i}" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": " optimizes to increase the compactness among embeddings and their respective scaled proxies " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": ". It also ensures that the length of embeddings does not extend beyond their radial space " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "r_i" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": "; further, minimizes the angle between normalized resultant vector " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "(\\hat{R}_{y_i})" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": " and normalized scaled proxy " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "(\\hat{\\omega}_{r_{y_i}})" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": " to bring closer the embeddings at the point of scaled proxy, " + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 521, + 483, + 617 + ], + "type": "text", + "content": " in the angular space. The overall geometric interpretation of DistArc loss during the training phase is shown in Fig. 2b." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "In the proposed DistArc loss, " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\delta_{y_i}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " act as a pulling force to attract embeddings " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "x_{i}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " towards " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ". This loss component optimizes to shift the distribution of each class towards the scaled proxies " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " in the radial space, leading to an increase in the embedding's magnitude. Leading to the enhancement of intra-class compact-" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyperSpaceX" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": "ness, " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\delta_{j}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": " in the denominator of the loss function, helps to distant the " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "x_{i}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": "'s away from other scaled proxies " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\omega_{r_j}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": "'s excluding " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": ". The overall combination of " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\delta_{y_i}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\delta_{j}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": " increases the inter-class distance between dissimilar class scaled proxies and embeddings while decreasing the intra-class distance between similar class scaled proxy and embeddings. The " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\delta_{y_i}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": " term is defined using, " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\delta_{y_i} = \\| \\omega_{r_y_i} - x_i\\| _2^2" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": " and in case when " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "j\\neq y_{i}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\delta_{j} = \\| \\omega_{r_{j}} - x_{i}\\|_{2}^{2}" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": ". A negative (-) sign is used in the " + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 130, + 116, + 482, + 214 + ], + "type": "text", + "content": " component of loss Eq. 1 to maximize the logarithmic distribution overall and subsequently minimize the DistArc loss." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 232, + 462, + 257 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 232, + 462, + 257 + ], + "spans": [ + { + "bbox": [ + 131, + 232, + 462, + 257 + ], + "type": "text", + "content": "2.3 Analytical Ablation of DistArc Loss and Inductive Bias for HyperSpaceX Framework" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "spans": [ + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": "In the proposed DistArc loss, the first component " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\cos (\\theta_{y_i} + m)" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " represents the cosine of the angle " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\theta_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " between " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\omega_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "x_i" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ", incorporating an additional penalty " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " for the angular margin applied to angle " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\theta_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ", to strengthen coherence within the class while increasing differentiation between different classes. The second term, " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\cos \\phi_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ", calculates the angle between the scaled proxy " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " and its corresponding resultant vector " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ". This can be expressed as the dot product between the two vectors: " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " in reverse direction and " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "R_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ". This aims to minimize the angle " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\phi_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ", ensuring that feature points remain close to their scaled proxies and do not extend beyond the boundaries of their respective radial hyperspheres. The last two terms, " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\delta_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\delta_j" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ", help to shift the features to their corresponding scaled proxy " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " points over different radii hyperspheres and diverging " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "x_i" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " features from different class proxies " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\omega_{r_j}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": "'s. It ensures inter-class separability in the radial direction across multi-hyperspherical manifolds. The " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\delta_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " term also results in the tighter clustering of class features around their respective " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\omega_{r_{y_i}}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " leading to high class discrimination. The combined importance of the components " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\cos \\theta_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\cos \\phi_{y_i}" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " manifests itself in the minimization of angles " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": ", using a more concentrated angular distribution of features aligning to the corresponding class proxies. Further, it prevents features from extending beyond their respective class radii. The loss's additional " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " component contributes to the compact clustering and length amplification of " + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "x_i" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": " vectors, shifting them to specific hypersphere radii" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "inline_equation", + "content": "^2" + }, + { + "bbox": [ + 130, + 264, + 482, + 514 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 516, + 483, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 516, + 483, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 516, + 483, + 552 + ], + "type": "text", + "content": "Additionally, in the context of HyperSpaceX framework, the inductive bias effectively shapes the decision boundaries based on both radial and angular factors. We define the decision boundary as," + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 182, + 561, + 480, + 588 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 182, + 561, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 182, + 561, + 480, + 588 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\left(\\cos \\left(\\theta_ {1} + m\\right) + \\left| \\left| x _ {1} \\right| \\right| _ {2}\\right) - \\left(\\cos \\left(\\theta_ {2}\\right) + \\left| \\left| x _ {2} \\right| \\right| _ {2}\\right) = 0 \\text {f o r c l a s s 1} \\\\ \\left(\\cos \\left(\\theta_ {1}\\right) + \\left\\| x _ {1} \\right\\| _ {2}\\right) - \\left(\\cos \\left(\\theta_ {2} + m\\right) + \\left\\| x _ {2} \\right\\| _ {2}\\right) = 0 \\text {f o r c l a s s 2} \\tag {2} \\\\ \\end{array}", + "image_path": "908212e32950696b5e3e3145cb19f5c4b207842a65f970c4a193eb44a3e05790.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "text", + "content": "This analysis of inductive bias in decision boundaries is built on binary classification and can effectively be extended to multi-class classification tasks. Consequently, the features learned through the radial-angular DistArc loss exhibit more separable decision boundaries and enhanced discriminative capabilities" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 480, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 480, + 665 + ], + "type": "text", + "content": "2 A detailed visual and theoretical ablation is included in the supplementary material." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 189, + 125, + 251, + 175 + ], + "blocks": [ + { + "bbox": [ + 189, + 125, + 251, + 175 + ], + "lines": [ + { + "bbox": [ + 189, + 125, + 251, + 175 + ], + "spans": [ + { + "bbox": [ + 189, + 125, + 251, + 175 + ], + "type": "image", + "image_path": "b6e75836315174dd6b37ee174a9af0205ae950dc1dc0345c8d87828387aaec5d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 272, + 124, + 329, + 178 + ], + "blocks": [ + { + "bbox": [ + 272, + 124, + 329, + 178 + ], + "lines": [ + { + "bbox": [ + 272, + 124, + 329, + 178 + ], + "spans": [ + { + "bbox": [ + 272, + 124, + 329, + 178 + ], + "type": "image", + "image_path": "4cd0957e4b650efe31cf0d88fbba4d242bd455e952d5affddccea41716d58bb4.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 348, + 114, + 425, + 186 + ], + "blocks": [ + { + "bbox": [ + 348, + 114, + 425, + 186 + ], + "lines": [ + { + "bbox": [ + 348, + 114, + 425, + 186 + ], + "spans": [ + { + "bbox": [ + 348, + 114, + 425, + 186 + ], + "type": "image", + "image_path": "eadd8e59cd529eff3475b410ec736e6d5d8df017e5f65912e95578909aa953b0.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 198, + 199, + 237, + 251 + ], + "blocks": [ + { + "bbox": [ + 198, + 199, + 237, + 251 + ], + "lines": [ + { + "bbox": [ + 198, + 199, + 237, + 251 + ], + "spans": [ + { + "bbox": [ + 198, + 199, + 237, + 251 + ], + "type": "image", + "image_path": "a85122bbac1335527ea5955098dea4984b03d9d136d105e14c271ebf7c8c11c4.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 218, + 260, + 225, + 266 + ], + "lines": [ + { + "bbox": [ + 218, + 260, + 225, + 266 + ], + "spans": [ + { + "bbox": [ + 218, + 260, + 225, + 266 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 266, + 196, + 322, + 255 + ], + "blocks": [ + { + "bbox": [ + 266, + 196, + 322, + 255 + ], + "lines": [ + { + "bbox": [ + 266, + 196, + 322, + 255 + ], + "spans": [ + { + "bbox": [ + 266, + 196, + 322, + 255 + ], + "type": "image", + "image_path": "445c69662e3ef602885bf8a11d27ce09b07f379725d3f4f5bcc750fd4c96cafb.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 290, + 260, + 297, + 266 + ], + "lines": [ + { + "bbox": [ + 290, + 260, + 297, + 266 + ], + "spans": [ + { + "bbox": [ + 290, + 260, + 297, + 266 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 347, + 189, + 423, + 260 + ], + "blocks": [ + { + "bbox": [ + 347, + 189, + 423, + 260 + ], + "lines": [ + { + "bbox": [ + 347, + 189, + 423, + 260 + ], + "spans": [ + { + "bbox": [ + 347, + 189, + 423, + 260 + ], + "type": "image", + "image_path": "ee8c7a6559a8dadddfb3084f378e82416f0e46ddd35c984cf0a44f51ffe41b47.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 382, + 261, + 389, + 266 + ], + "lines": [ + { + "bbox": [ + 382, + 261, + 389, + 266 + ], + "spans": [ + { + "bbox": [ + 382, + 261, + 389, + 266 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "lines": [ + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "spans": [ + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "type": "text", + "content": "Fig. 3: The 2-D (in first row) and 3-D (in second row) latent space visualization of features learnt through (a) metric-based loss functions, (b) Angular-softmax-based loss functions, and (c) the proposed Radial-Angular DistArc loss. Further showing the decision-making process of assigning a test sample " + }, + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "type": "text", + "content": " to the most favourable class distribution represented using either class center " + }, + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "type": "text", + "content": " or proxy vector " + }, + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "type": "inline_equation", + "content": "\\omega" + }, + { + "bbox": [ + 131, + 277, + 482, + 333 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "text", + "content": "among class features. A more comprehensive derivation of the decision boundary influenced by inductive bias, elucidating its dependency on angles " + }, + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "text", + "content": ", and resultant vector " + }, + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 131, + 354, + 482, + 390 + ], + "type": "text", + "content": " is present in the supplemental." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 404, + 457, + 418 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 404, + 457, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 404, + 457, + 418 + ], + "type": "text", + "content": "3 Predictive Measure and Latent Space Visualization" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": "The most prevailing choice for evaluating and categorizing a sample involves determining the category by calculating the maximum prediction from the model's predicted probability distribution. The proposed framework identifies the most favourable class distribution across multi-hyperspherical manifolds by considering a combination of angular and radial factors. An optimal class prediction is determined through a distinct approach that helps the evaluation metric, taking into account the radial and angular aspects of hyperspheres. The procedure encompasses the computation of resultant vectors between a sample's feature vector and each scaled proxy through mathematical formulation defined as " + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "inline_equation", + "content": "R_{i} = x - \\omega_{r_{i}} (\\forall i \\in 1,2,3,\\ldots)" + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": ". The resultant vector with the smallest magnitude determines the most favourable class proximity. Cosine law of triangle length computation is employed to determine the length of the resultant vector " + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": " based on learned and computed angles " + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": " and a magnitude of feature vector " + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": ". Eq. 3 defines the formulation for " + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "inline_equation", + "content": "R_{i}" + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": "'s length computation for every " + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "inline_equation", + "content": "i^{th}" + }, + { + "bbox": [ + 131, + 427, + 482, + 594 + ], + "type": "text", + "content": " category." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 198, + 600, + 480, + 613 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 198, + 600, + 480, + 613 + ], + "spans": [ + { + "bbox": [ + 198, + 600, + 480, + 613 + ], + "type": "interline_equation", + "content": "\\left| \\left| R _ {i} \\right| \\right| _ {2} = \\left| \\left| x \\right| \\right| _ {2} \\cos \\phi_ {i} + \\left| \\left| \\omega_ {r _ {i}} \\right| \\right| _ {2} \\cos (\\pi - \\left(\\theta_ {i} + \\phi_ {i}\\right)) \\tag {3}", + "image_path": "217a0d5b78d0ce39250d63dfa0633d56939493186daa4baee1032ebe84f18952.jpg" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 618, + 482, + 642 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 618, + 482, + 642 + ], + "spans": [ + { + "bbox": [ + 132, + 618, + 482, + 642 + ], + "type": "text", + "content": "We introduce a favourable class determining predictive measure for the HyperSpace " + }, + { + "bbox": [ + 132, + 618, + 482, + 642 + ], + "type": "inline_equation", + "content": "X" + }, + { + "bbox": [ + 132, + 618, + 482, + 642 + ], + "type": "text", + "content": " framework with its radial-angular based formulation, i.e.," + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 241, + 647, + 481, + 668 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 647, + 481, + 668 + ], + "spans": [ + { + "bbox": [ + 241, + 647, + 481, + 668 + ], + "type": "interline_equation", + "content": "\\hat {y} = \\underset {R _ {m}} {\\arg \\min } \\left\\{R _ {m} \\in \\mathbb {R} ^ {K}: R _ {m} \\right\\} \\tag {4}", + "image_path": "4c987f5e9f6e7e5fa7a88f4ce57d24744906436f0f025c2b15523c89fba09f89.jpg" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 391, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 391, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 391, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyperSpaceX" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "R_{m} \\in \\mathbb{R}^{K}" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": " refers to a vector comprising magnitude of resultant vectors between a sample's feature vector " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "x \\in \\mathbb{R}^{d}" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": " and scaled proxy matrix " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "\\omega_{r} \\in \\mathbb{R}^{d \\times K}" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": " representing the radii scaled " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "-class proxies, and " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "\\hat{y}" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": " defines a predicted class distribution. The predicted class distribution for a specific sample is effectively represented by the class having the smallest resultant vector magnitude in relation to that sample. The derivation of a predictive measure formulation is provided in the supplementary material." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 200, + 482, + 440 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 482, + 440 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 482, + 440 + ], + "type": "text", + "content": "During testing, the class of a test sample is determined by its feature representation predicted by the model, influenced by the loss function during training. Fig. 3 displays visual representations of 2D and 3D latent space features, elucidating the decision-making process for classifying a test sample. This is achieved by employing a nearest distance class measure, calculated as the Euclidean distance, as shown in Fig. 3a. In Fig. 3b, the class prediction process is shown, based on angular distance within a unit hypersphere. Lastly, Fig. 3c describes the probable class selection process by finding the vector with the least magnitude across multi-hyperspherical manifolds. As shown in Fig. 4a.i, the cross-entropy loss facilitates class feature separation, leaving intermixed features that affect prediction confidence due to lack of discriminability. Conversely, angular-softmax losses, introducing angular-margin penalties to enhance cosine similarity among embeddings, aiming separation and discriminability still causes inter-mixed feature representations (depicted via Fig. 4a.ii). HyperSpaceX framework with DistArc loss, presents a solution by distributing features across various angles on multiple hyperspheres, achieving better separation and discriminability by integrating both angular and radial dimensions. This approach results in a more distinct feature arrangement between classes, as demonstrated in Fig. 4a.iii), indicating the effectiveness of DistArc loss in creating a more discriminable and separable feature space." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 459, + 272, + 473 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 459, + 272, + 473 + ], + "spans": [ + { + "bbox": [ + 132, + 459, + 272, + 473 + ], + "type": "text", + "content": "4 Experimental Setup" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 485, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 482, + 666 + ], + "type": "text", + "content": "The experimental approach is designed to analyze the distribution of features in the latent space across various image classification and face recognition tasks. We have trained and tested the proposed HyperSpaceX framework on well-known benchmark datasets: (a) seven image classification datasets including MNIST [4], FashionMNIST [32], CIFAR-10 [11], CIFAR-100 [11], CUB-200 [27], TinyImageNet [13] and ImageNet-1K [2], and (b) six face recognition datasets including LFW [10], CFP-FP [23], AgeDB-30 [18], CA-LFW [37], CP-LFW [36] datasets (CASIA-WebFace [33] is used for initial model training). Model is also trained on 1500 subjects of D-LORD [17] dataset and tested on 600 different test subjects. Implementation Details: The HyperSpaceX framework undergoes training using various deep neural network backbones, including the iResNet50 architecture [6], [9], the ViT and RN101 backbones [5] from the CLIP foundation model [20]. The models are trained using DistArc loss and several variants of softmax-based loss functions, including Cross-entropy, CosFace and ArcFace loss, and also with Orthogonal projection loss. For image classification, the model" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 129, + 200, + 199 + ], + "blocks": [ + { + "bbox": [ + 136, + 129, + 200, + 199 + ], + "lines": [ + { + "bbox": [ + 136, + 129, + 200, + 199 + ], + "spans": [ + { + "bbox": [ + 136, + 129, + 200, + 199 + ], + "type": "image", + "image_path": "f4fc35a92fc53e9bba9b05dff9b90ad175b4b700f27bb1127cc5ef2a916a67e8.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 220, + 482, + 308 + ], + "lines": [ + { + "bbox": [ + 130, + 220, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 482, + 308 + ], + "type": "text", + "content": "Fig. 4: (a) Illustrating comparative visual analysis of the organization of MNIST class feature distribution in the latent space. The feature representations are learned using (i) Cross-entropy loss, (ii) ArcFace loss, and (iii) the proposed DistArc loss on the MNIST database, where each color represents a unique class. While (b) depicts the subclass organization of the CIFAR-100 dataset on 2D multi-hyperspherical manifolds. The color of each line denotes a distinct superclass, facilitating angular separability. Subclasses within each superclass are distinguished radially, with each superclass represented as blobs extending radially from the superclass center." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 204, + 130, + 271, + 198 + ], + "blocks": [ + { + "bbox": [ + 204, + 130, + 271, + 198 + ], + "lines": [ + { + "bbox": [ + 204, + 130, + 271, + 198 + ], + "spans": [ + { + "bbox": [ + 204, + 130, + 271, + 198 + ], + "type": "image", + "image_path": "42bae49df832fb3b150abf2f85dfbf27ca6e3cb6d9bb95e3cc6c3ec843a5923b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 223, + 201, + 235, + 210 + ], + "lines": [ + { + "bbox": [ + 223, + 201, + 235, + 210 + ], + "spans": [ + { + "bbox": [ + 223, + 201, + 235, + 210 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 277, + 130, + 342, + 199 + ], + "blocks": [ + { + "bbox": [ + 277, + 130, + 342, + 199 + ], + "lines": [ + { + "bbox": [ + 277, + 130, + 342, + 199 + ], + "spans": [ + { + "bbox": [ + 277, + 130, + 342, + 199 + ], + "type": "image", + "image_path": "c3ca6b44ac613349df8846afd0351573918789a9fa6a14ff8dcdf538e7ea30d7.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 363, + 114, + 451, + 200 + ], + "blocks": [ + { + "bbox": [ + 363, + 114, + 451, + 200 + ], + "lines": [ + { + "bbox": [ + 363, + 114, + 451, + 200 + ], + "spans": [ + { + "bbox": [ + 363, + 114, + 451, + 200 + ], + "type": "image", + "image_path": "0be716b039d77716bd6f0a9f8cc987719365d54560a99aa5739f16c87ef84c77.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 400, + 201, + 413, + 210 + ], + "lines": [ + { + "bbox": [ + 400, + 201, + 413, + 210 + ], + "spans": [ + { + "bbox": [ + 400, + 201, + 413, + 210 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": "undergoes both training and testing in a classification setting. We train models for small-class simple datasets like MNIST and FashionMNIST with an SGD optimizer at a learning rate of " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "1e - 2" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " and a weight decay of " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "5e - 4" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": ". We further set the value of " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "m = 0.4" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "\\lambda = 0.003" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " in the DistArc loss components. For complex datasets like CIFAR-10, CIFAR-100, CUB-200 and TinyImageNet, the value of " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " is set to 0.005. Other hyperparameters remain the same. For face recognition, the training is conducted by employing a classification setup, while during testing, face verification is performed using image pairs with class-set disjoint from training. In the face recognition task, the training is performed on the CASIA-WebFace dataset in the classification setting and testing is performed in the verification setup on LFW, CFP-FP, AgeDB-30, CA-LFW and CP-LFW datasets. The SGD optimizer with a learning rate of " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "1e - 3" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " and weight decay of " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "5e - 4" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " is utilized for both the classifier and backbone network. However, in this task " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " is varied based on the number of epochs. We initialize by setting " + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 332, + 482, + 523 + ], + "type": "text", + "content": " to 0.001 and increasing it by an addition of 0.001 after every tenth epoch and stop updating after reaching the value of 0.005." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 543, + 279, + 556 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 279, + 556 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 279, + 556 + ], + "type": "text", + "content": "5 Results and Analysis" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "Image Classification Results: We first present the results pertaining to how class features are organized across a range of embedding sizes, from low (2D) to high (512D) and very high (2048D) dimensions, distributed across radial-hyperspherical manifolds. Table 1 showcases the performance on multi-class datasets like CIFAR-100 [11] and TinyImageNet [13], achieved by employing different backbone architectures trained with a variety of loss functions. This highlights the effectiveness of our HyperSpaceX framework, which utilizes DistArc loss for training. This method enhances class distinctiveness, typically outper" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 391, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 391, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 391, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyperSpaceX" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 143, + 158, + 473, + 293 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 1: Performance comparison (accuracy in %) on image classification task between the proposed DistArc and other loss functions utilized for training models with multiple backbones. The best and second best performances are bolded and underlined." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 143, + 158, + 473, + 293 + ], + "lines": [ + { + "bbox": [ + 143, + 158, + 473, + 293 + ], + "spans": [ + { + "bbox": [ + 143, + 158, + 473, + 293 + ], + "type": "table", + "html": "
CIFAR-100Tiny-Imagenet
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArcCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]47.1251.4846.9245.2062.0614.0316.0313.7817.7320.89
RN101 [20]37.8436.0235.1238.8553.9517.9616.2218.1020.5532.97
ViT-B [20]58.3656.2753.9657.0477.9337.5842.9436.2536.4954.11
ViT-L [20]67.8966.4463.8166.2779.5645.9344.0649.3446.2068.21
512iResNet50 [6]83.0580.2280.0181.2881.6261.8360.0258.3963.0663.27
RN101 [20]69.3970.8468.3769.1175.5853.0453.0151.7752.8554.40
ViT-B [20]81.9981.5879.4680.9282.6278.3874.2272.6174.4276.03
ViT-L [20]88.7587.2785.4084.8389.4886.4985.5581.8485.9486.79
2048iResNet50 [6]85.2284.2986.8286.1489.1061.3963.9262.4062.7164.20
RN101 [20]79.4078.1577.0678.2280.3754.1353.2853.8754.1059.06
ViT-B [20]81.0479.3379.2980.7283.0079.5478.3779.2677.0080.37
ViT-L [20]87.5985.9384.7490.2090.2085.0381.3982.4886.0486.94
", + "image_path": "12783c337c7741c1f91ae4ae924e3816a8451f4a2346ef1b08ece482b18439fe.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "content": "forming models trained with conventional loss functions such as Cross-entropy, ArcFace, CosFace, and Orthogonal Projection Loss (OPL). These results also showcase that the DistArc loss leads to features with enhanced separability and discrimination due to its effective exploration of both radial and angular dimensions within each hyperspherical latent space. This approach results in a significant performance increase: in TinyImageNet classification tasks, we observe an increase of over " + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "inline_equation", + "content": "22\\%" + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "content": " in 2D, around " + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "inline_equation", + "content": "1.44\\%" + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "content": " in 512D, and " + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "inline_equation", + "content": "4.93\\%" + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "content": " in 2048D spaces, when benchmarked against cross-entropy loss and various softmax-angular margin-based loss functions. A similar trend of substantial improvement is observed for the CIFAR-100 dataset, showing improvements of up to " + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "inline_equation", + "content": "19.57\\%" + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "content": " in 2D, " + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "inline_equation", + "content": "6.19\\%" + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "content": " in 512D, and " + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "inline_equation", + "content": "2.61\\%" + }, + { + "bbox": [ + 130, + 316, + 486, + 449 + ], + "type": "text", + "content": " in 2048D spaces." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 449, + 483, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 483, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 483, + 604 + ], + "type": "text", + "content": "Fig. 4b illustrates the subclass and class-based feature distribution for CIFAR-100 categories, arranging each subclass angularly within its superclass group across different radial spaces. This setup enhances radial separability for subclasses and angular separability for superclasses, leading to clear distinctions between them. Furthermore, subclasses are compactly positioned according to their radial and angular coordinates, showcasing precise class feature discrimination. This organized feature distribution demonstrates the capability for a more defined feature arrangement, optimizing representation in lower-dimensional spaces and simplifying model complexity. Consequently, Fig. 4b uses color differentiation to distinguish between unrelated classes, while same-colored points on different radii indicate subclasses belonging to the same superclass, thereby facilitating a methodical learning of class arrangements in multi-radial spaces for refined differentiation between classes and their subclasses." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "The results for the CUB-200 dataset [27], a large multi-class image classification challenge focusing on bird categorization, are shown in Table 2. Classifying images in the CUB-200 dataset is particularly demanding due to the subtle, unique features each bird species has, despite the commonality of features like beaks and wings. This demands an emphasis on fine-grained, distinct characteris" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 153, + 158, + 463, + 255 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "type": "text", + "content": "Table 2: Comparative performance (accuracy in %) analysis on CUB-200 dataset between proposed DistArc and other loss functions used for training models with multiple backbones. The best and second best performances are bolded and underlined." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 153, + 158, + 463, + 255 + ], + "lines": [ + { + "bbox": [ + 153, + 158, + 463, + 255 + ], + "spans": [ + { + "bbox": [ + 153, + 158, + 463, + 255 + ], + "type": "table", + "html": "
Embedding SizeBackboneCross EntropyArcFaceCosFaceOPLDistArc
2iResNet50 [6]7.506.197.0711.5918.09
RN101 [20]11.4410.4711.4212.8431.50
ViT-B [20]18.7020.6319.0417.0625.93
ViT-L [20]25.4822.8524.1927.7748.11
512iResNet50 [6]61.2963.4760.2962.8370.48
RN101 [20]51.4050.8550.1154.2658.44
ViT-B [20]67.9368.7068.1870.3676.06
ViT-L [20]80.7978.2779.6680.6583.28
", + "image_path": "9a94112e60d68806b8804a9394d0cc35efc8c22afa21c14e10203a35d890284c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 143, + 312, + 472, + 373 + ], + "blocks": [ + { + "bbox": [ + 132, + 270, + 480, + 301 + ], + "lines": [ + { + "bbox": [ + 132, + 270, + 480, + 301 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 480, + 301 + ], + "type": "text", + "content": "Table 3: Evaluating model performance (accuracy in%) using conventional and proposed predictive measures in the HyperSpaceX framework when trained using DistArc loss on backbones with 512-D embedding size. The best performances are bolded." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 143, + 312, + 472, + 373 + ], + "lines": [ + { + "bbox": [ + 143, + 312, + 472, + 373 + ], + "spans": [ + { + "bbox": [ + 143, + 312, + 472, + 373 + ], + "type": "table", + "html": "
BackboneCIFAR-100CUB-200TinyImageNet
Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)Classification layerRadial-Angular (proposed)
iResNet50 [6]80.2981.6269.5670.4861.9363.27
RN101 [20]71.0575.5858.1958.4454.3354.43
ViT-B [20]78.9982.6274.9176.0676.1076.03
ViT-L [20]88.2089.4882.8583.2882.5186.79
", + "image_path": "762bd411bc1ad0f46b876fa3e8d8f7303b9ac9c8ea5d19106dc9a6f785e10d6a.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 399, + 480, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 399, + 480, + 506 + ], + "spans": [ + { + "bbox": [ + 132, + 399, + 480, + 506 + ], + "type": "text", + "content": "ties of different bird body parts when developing bird image classification models. In such challenging scenario, as shown in Table 2, the HyperSpaceX framework outperforms existing methods. Models trained with DistArc loss achieved a significant performance boost of approximately " + }, + { + "bbox": [ + 132, + 399, + 480, + 506 + ], + "type": "inline_equation", + "content": "20.34\\%" + }, + { + "bbox": [ + 132, + 399, + 480, + 506 + ], + "type": "text", + "content": " using a ViT-L backbone with a 2D last embedding layer. Additionally, DistArc loss trained models excelled in higher-dimensional latent spaces. This success is attributed to our approach's adeptness in discriminately mapping various bird class features across distinctively separated radii and angles in a multi-hyperspherical space, while simultaneously compacting features within the same bird class." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "text", + "content": "Reduced Latent Space Representation: Table 1 and Table 2 represent the performance on several backbones having the last embedding layer of size 2. It signifies that on complex datasets such as CIFAR-100, CUB-200 and TinyImageNet, the proposed radial-angular feature learning approach in a 2-D latent space achieves a performance boost of " + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "inline_equation", + "content": "16\\%" + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "text", + "content": " over traditional cross-entropy loss methods even with large number of classes. Experimental results on the CUB-200 dataset also depict the high separability among various low-variance classes. Quantitatively, we can deduce that while dimensionality reduction for large complex datasets from a higher dimension of 512 and 2048 to the lower dimension of 2 embedding space, cross-entropy loss observes a " + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "inline_equation", + "content": "40 - 42\\%" + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "text", + "content": " performance gap while DistArc loss successfully reduced this disparity to " + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "inline_equation", + "content": "20 - 24\\%" + }, + { + "bbox": [ + 132, + 509, + 481, + 639 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 641, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 641, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 641, + 480, + 665 + ], + "type": "text", + "content": "Predictive Measures Analysis: In the Image classification task, the class predictions are generally made utilizing the model's classification layer, adopted for" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyperSpaceX" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 177, + 121, + 255, + 197 + ], + "blocks": [ + { + "bbox": [ + 177, + 121, + 255, + 197 + ], + "lines": [ + { + "bbox": [ + 177, + 121, + 255, + 197 + ], + "spans": [ + { + "bbox": [ + 177, + 121, + 255, + 197 + ], + "type": "image", + "image_path": "35cb5e787bde808b3cb9edb8168447c48d192a329f58f0d6683d4a574c31ea81.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 267, + 122, + 345, + 196 + ], + "blocks": [ + { + "bbox": [ + 267, + 122, + 345, + 196 + ], + "lines": [ + { + "bbox": [ + 267, + 122, + 345, + 196 + ], + "spans": [ + { + "bbox": [ + 267, + 122, + 345, + 196 + ], + "type": "image", + "image_path": "672278872e3c7d71a16c5f43a2b6b97f15cd19390b23cca23aca0949d75dbd4b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 356, + 122, + 434, + 196 + ], + "blocks": [ + { + "bbox": [ + 356, + 122, + 434, + 196 + ], + "lines": [ + { + "bbox": [ + 356, + 122, + 434, + 196 + ], + "spans": [ + { + "bbox": [ + 356, + 122, + 434, + 196 + ], + "type": "image", + "image_path": "b4c53e5e32023ab3aeedaa08b25bc09c01c8e29b3e4719b93ab6837362761dcc.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 176, + 201, + 262, + 254 + ], + "blocks": [ + { + "bbox": [ + 176, + 201, + 262, + 254 + ], + "lines": [ + { + "bbox": [ + 176, + 201, + 262, + 254 + ], + "spans": [ + { + "bbox": [ + 176, + 201, + 262, + 254 + ], + "type": "image", + "image_path": "f06f2b44c000d1dd2af7875ec9586066fe0c2d95f85f6da74ecfdf3d09f664a1.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 265, + 200, + 349, + 255 + ], + "blocks": [ + { + "bbox": [ + 265, + 200, + 349, + 255 + ], + "lines": [ + { + "bbox": [ + 265, + 200, + 349, + 255 + ], + "spans": [ + { + "bbox": [ + 265, + 200, + 349, + 255 + ], + "type": "image", + "image_path": "d65979d87cd3e7dd0e3a09824823769a884508183f5bef1a9687fc30f2525937.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 354, + 201, + 435, + 255 + ], + "blocks": [ + { + "bbox": [ + 354, + 201, + 435, + 255 + ], + "lines": [ + { + "bbox": [ + 354, + 201, + 435, + 255 + ], + "spans": [ + { + "bbox": [ + 354, + 201, + 435, + 255 + ], + "type": "image", + "image_path": "aa20bea31c157fb07f635a706ab6ba531299a863814b22be422a843d1e8d4df3.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 175, + 257, + 262, + 315 + ], + "blocks": [ + { + "bbox": [ + 175, + 257, + 262, + 315 + ], + "lines": [ + { + "bbox": [ + 175, + 257, + 262, + 315 + ], + "spans": [ + { + "bbox": [ + 175, + 257, + 262, + 315 + ], + "type": "image", + "image_path": "c32f31328fb5c87fb11a05dad0b3b895a1b72637c2bd88b598bc801cd9dad7ef.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 323, + 482, + 380 + ], + "lines": [ + { + "bbox": [ + 130, + 323, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 482, + 380 + ], + "type": "text", + "content": "Fig. 5: Analysis of loss functions using small-class simple datasets (a) MNIST and (b) FashionMNIST, and complex dataset (c) CIFAR-10. The first row visualizes the features, showcasing the outcomes of learning with DistArc loss over 2D multi-spherical manifolds. The last two rows illustrate classification performance of different backbones with a 2-D and 512-D embedding sizes, trained using Cross-entropy and DistArc loss." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 264, + 257, + 348, + 315 + ], + "blocks": [ + { + "bbox": [ + 264, + 257, + 348, + 315 + ], + "lines": [ + { + "bbox": [ + 264, + 257, + 348, + 315 + ], + "spans": [ + { + "bbox": [ + 264, + 257, + 348, + 315 + ], + "type": "image", + "image_path": "adcc695b6d815e3c6ac330851c7911c97841c895bae5d39c8683cbb9578dc708.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 354, + 257, + 436, + 315 + ], + "blocks": [ + { + "bbox": [ + 354, + 257, + 436, + 315 + ], + "lines": [ + { + "bbox": [ + 354, + 257, + 436, + 315 + ], + "spans": [ + { + "bbox": [ + 354, + 257, + 436, + 315 + ], + "type": "image", + "image_path": "8da0f7e560de343dce767201fb36fc8f9f54b4e2d83e0bb683a36f8048dcb895.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 408, + 482, + 516 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 408, + 482, + 516 + ], + "spans": [ + { + "bbox": [ + 130, + 408, + 482, + 516 + ], + "type": "text", + "content": "models trained with various existing loss functions except for DistArc loss, for results presented in Table 1 and Table 2. The proposed DistArc loss, the predictions are computed using the newly introduced radial-angular based predictive measure defined in section 3. The comparison of utilizing traditional and proposed predictive measures in the HyperSpaceX framework is shown via Table 3. From the outperforming results shown, it can be analyzed that the proposed radial-angular-based predictive measure is effective over the conventional approach of predictions from the final classification layer for models trained using DistArc loss due to different radii of classes." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 518, + 482, + 615 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 518, + 482, + 615 + ], + "spans": [ + { + "bbox": [ + 130, + 518, + 482, + 615 + ], + "type": "text", + "content": "Performance of HyperSpaceX on a Large-Scale Image Dataset: Table 4 provides the details the performance of the proposed framework after finetuning on the ImageNet-1K dataset [2]. We observe that the proposed DistArc loss outperforms existing methods for embedding sizes of 32 and 128. It also achieves the second-highest performance at 512 dimensions. As the number of classes grows, ArcFace finds it difficult to manage many feature points on a unit hypersphere. This demonstrates the benefit of strategically arranging features in a multi-radial hyperspherical space using DistArc loss during model training." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "HyperSpaceX Performance on Datasets with Fewer Classes: Fig. 5 showcases the performance and feature visualization for MNIST, FashionMNIST, and CIFAR-10 datasets. The top row of Fig. 5 illustrates the 2D-latent space feature organization across multi-radial hyperspherical manifolds, highlighting the" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 168, + 470, + 222 + ], + "blocks": [ + { + "bbox": [ + 143, + 114, + 470, + 159 + ], + "lines": [ + { + "bbox": [ + 143, + 114, + 470, + 159 + ], + "spans": [ + { + "bbox": [ + 143, + 114, + 470, + 159 + ], + "type": "text", + "content": "Table 4: Classification Accuracy (%) Table 5: Ablation study of DistArc on ImageNet-1K dataset using iRes-loss, reporting classification performance [6]. The best and second best performance (in %) for various image classifi-cormances are bolded and underlined. fication datasets." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 168, + 470, + 222 + ], + "lines": [ + { + "bbox": [ + 148, + 168, + 470, + 222 + ], + "spans": [ + { + "bbox": [ + 148, + 168, + 470, + 222 + ], + "type": "table", + "html": "
Embedding SizeCross EntropyArcFaceDistArcLoss ComponentsMNISTFashion-MNISTCIFAR-10
3248.2543.0555.91cos(θ)98.9793.6994.81
12865.1858.6265.30cos(θ) & cos(φ)98.9393.7295.16
51269.2759.6767.90cos(θ) & δ99.0194.8395.31
cos(θ) & cos(φ) & δ99.1995.0496.03
", + "image_path": "669d9d297bd62a4f67a273814895ab61131174080208a1326be2465b245ddb7b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 245, + 482, + 341 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 245, + 482, + 341 + ], + "spans": [ + { + "bbox": [ + 130, + 245, + 482, + 341 + ], + "type": "text", + "content": "strategic angular positioning. This arrangement emphasizes the significant distance between features of unrelated classes and the closeness of features within the same class, facilitating accurate class predictions. The subsequent rows display a comparison of classification accuracy across different models trained using cross-entropy and DistArc loss functions in 2D and 512D latent spaces. These findings illustrate the superior performance of the HyperSpaceX framework across both simple (MNIST, FashionMNIST) and more complex (CIFAR-10) datasets with a smaller number of classes." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 341, + 483, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 483, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 483, + 449 + ], + "type": "text", + "content": "Training Convergence Analysis: The training convergence rates of the DistArc loss were benchmarked against existing loss functions. Training with softmax cross-entropy loss shows only a slight decrease in loss values. In contrast, DistArc loss significantly restructures the feature space layout by dispersing identities across various radial hyperspheres. This approach leads to higher initial loss figures that efficiently reduce to a minimum of 0.22, surpassing the reduction achieved with softmax cross-entropy (0.34), CosFace (2.31), ArcFace (1.51), and OPL (0.68) loss functions. A detailed comparison illustrating the training convergence rates of loss functions is available in the supplementary file." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": "Ablatic Analysis of DistArc: Table 5 shows the ablation analysis on three image classification datasets, MNIST, FashionMNIST, and CIFAR-10, while utilizing ViT-B architecture (embedding size 512). The first and second row of Table 5 shows the efficacy of performance improvement over angular separation through " + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": ", and the third row shows the improvement with radial and angular factors due to " + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": " terms. While, the last row shows the highest performance achieved by including all " + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 130, + 449, + 482, + 545 + ], + "type": "text", + "content": " components into the loss formulation, highlighting the importance of each component." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Face Recognition Results: Table 6 showcases detailed comparative results of the DistArc loss against other loss functions in face recognition tasks. Utilizing the iResNet50 architecture and training on the CASIA-WebFace dataset, we have evaluated verification performance with a 512-dimensional embedding. The DistArc loss demonstrates state-of-the-art (SoTA) results on LFW and CP-LFW datasets and near state-of-the-art results on other datasets. Additionally, experiments with the iResNet50 backbone on the MS1Mv2 dataset—a derivative of the now-withdrawn MS-Celeb dataset—were conducted to ensure a fair comparison with SoTA methods are included in supplementary materials. The DistArc loss trained model achieved following results: " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "99.82\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " on LFW and " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "98.21\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " on AgeDB" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyperSpaceX" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 170, + 146, + 446, + 262 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 481, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 481, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 481, + 137 + ], + "type": "text", + "content": "Table 6: Quantitative results (in %) of face recognition models trained using different loss functions. The best and second best performances are bolded and underlined." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 170, + 146, + 446, + 262 + ], + "lines": [ + { + "bbox": [ + 170, + 146, + 446, + 262 + ], + "spans": [ + { + "bbox": [ + 170, + 146, + 446, + 262 + ], + "type": "table", + "html": "
LossLFWCFP-FPAgeDB-30CA-LFWCP-LFW
Triplet98.9891.9089.98--
Center loss [30]99.28--85.4877.48
Softmax99.0894.3992.3388.1784.85
Norm-Softmax98.5689.7988.72--
SphereFace [16]99.1194.3891.7092.5590.90
CosFace (m=0.35) [28]99.1095.4492.9892.8391.03
ArcFace (m=0.45) [3]99.4695.4794.9392.4790.85
SphereFace2 [29]99.50-93.6893.4791.07
DistArc (m=0.4)99.5495.4194.0393.3291.10
", + "image_path": "9b9bac3a76e79c93cb8cf8cea6a442700d7bdf0e32783cfa1c384afc6bc34635.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "type": "text", + "content": "30, surpassing results from SphereFace, CosFace, ArcFace, and SphereFace2" + }, + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "type": "inline_equation", + "content": "^3" + }, + { + "bbox": [ + 130, + 285, + 481, + 321 + ], + "type": "text", + "content": ". These findings highlight the HyperSpaceX framework's proficiency in crafting highly discriminative and distinct features within the latent space." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "spans": [ + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "text", + "content": "The HyperSpaceX framework is also evaluated on the D-LORD [17] dataset, a large-scale open-set surveillance dataset with 600 test subjects, using a deep metric learning approach [19]. With ArcFace, a Rank-1 identification accuracy of " + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "inline_equation", + "content": "61.84\\%" + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "text", + "content": " was achieved, while DistArc achieved " + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "inline_equation", + "content": "62.71\\%" + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "text", + "content": ". For Rank-5 accuracy, the results were " + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "inline_equation", + "content": "65.89\\%" + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "inline_equation", + "content": "66.03\\%" + }, + { + "bbox": [ + 130, + 322, + 481, + 395 + ], + "type": "text", + "content": ", respectively, indicating that DistArc is more effective at learning enhanced discriminative features than ArcFace." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 415, + 220, + 427 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 415, + 220, + 427 + ], + "spans": [ + { + "bbox": [ + 132, + 415, + 220, + 427 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 442, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 442, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 442, + 482, + 635 + ], + "type": "text", + "content": "In this research, we introduce the HyperSpaceX framework, which navigates both angular and radial dimensions, facilitating a uniquely distinguishable and discernible arrangement of class features within multi-hyperspherical manifold space. This is achieved using the novel DistArc loss, which leverages the radial and angular components of the feature space. This loss function significantly enhances the cohesion among similar class features while concurrently maximizing the distances between different classes, resulting in more precise and discriminative feature representation. To evaluate the performance of this radial-angular framework, we introduce a predictive measure that utilizes the shortest resultant vector between the embeddings of test samples and proxy vectors, offering a deeper insight into the model's performance. The efficacy of HyperSpaceX is demonstrated through comprehensive experiments on seven image classification datasets and six face recognition datasets. The proposed methodology shows improvements in handling a diverse array of image and face datasets, ranging from simpler to more complex and large-scale collections encompassing several classes and samples." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "^3" + }, + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "type": "text", + "content": "SphereFace (LFW: 99.42%), CosFace (LFW: 99.73%), ArcFace (LFW: 99.82%, AgeDB30: 98.15%) and SphereFace2 (LFW: 99.50%, AgeDB30: 93.68%)." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 479, + 163 + ], + "type": "text", + "content": "Chiranjeev and Thakral received partial support from the PMRF Fellowship, and Vatsa is partially supported by the Swarnajayanti Fellowship." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 206, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 138, + 206, + 480, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 206, + 480, + 228 + ], + "spans": [ + { + "bbox": [ + 138, + 206, + 480, + 228 + ], + "type": "text", + "content": "1. Conniffe, D.: Expected maximum log likelihood estimation. Journal of the Royal Statistical Society: Series D (The Statistician) 36(4), 317-329 (1987)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 228, + 480, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 259 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 259 + ], + "type": "text", + "content": "2. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 261, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 261, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 261, + 480, + 293 + ], + "type": "text", + "content": "3. Deng, J., Guo, J., Xue, N., Zafeiriou, S.: Arcface: Additive angular margin loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4690-4699 (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 294, + 480, + 316 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 294, + 480, + 316 + ], + "spans": [ + { + "bbox": [ + 138, + 294, + 480, + 316 + ], + "type": "text", + "content": "4. Deng, L.: The mnist database of handwritten digit images for machine learning research [best of the web]. IEEE signal processing magazine 29(6), 141-142 (2012)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 316, + 480, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 480, + 358 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 480, + 358 + ], + "type": "text", + "content": "5. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 360, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 360, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 360, + 480, + 380 + ], + "type": "text", + "content": "6. Duta, I.C., Liu, L., Zhu, F., Shao, L.: Improved residual networks for image and video recognition. In: Int. Conf. Pattern Recog. pp. 9415-9422. IEEE (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 382, + 480, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 382, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 382, + 480, + 403 + ], + "type": "text", + "content": "7. Gallo, I., Nawaz, S., Calefati, A., Janjua, M.K.: Git loss for deep face recognition. In: Brit. Mach. Vis. Conf. p. 313. BMVA (2018)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 404, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 404, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 138, + 404, + 480, + 424 + ], + "type": "text", + "content": "8. Guo, G., Zhang, N.: A survey on deep learning based face recognition. Comput. Vis. Image Underst. 189, 102805 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 426, + 480, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 426, + 480, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 426, + 480, + 446 + ], + "type": "text", + "content": "9. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 770-778 (2016)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 447, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 447, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 447, + 480, + 479 + ], + "type": "text", + "content": "0. Huang, G.B., Mattar, M., Berg, T., Learned-Miller, E.: Labeled faces in the wild: A database for studying face recognition in unconstrained environments. In: Workshop on faces in Real-Life Images: detection, alignment, and recognition (2008)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 480, + 480, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 480, + 480, + 501 + ], + "spans": [ + { + "bbox": [ + 138, + 480, + 480, + 501 + ], + "type": "text", + "content": "1. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 502, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 480, + 522 + ], + "type": "text", + "content": "2. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Adv. Neural Inform. Process. Syst. 25 (2012)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 523, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 480, + 544 + ], + "type": "text", + "content": "3. Le, Y., Yang, X.: Tiny imagenet visual recognition challenge. CS 231N 7(7), 3 (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "text", + "content": "4. LeCun, Y., Boser, B., Denker, J.S., Henderson, D., Howard, R.E., Hubbard, W., Jackel, L.D.: Backpropagation applied to handwritten zip code recognition. Neural computation 1(4), 541-551 (1989)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "type": "text", + "content": "5. Li, L., Zhang, Y., Huang, A.: Learnable subspace orthogonal projection for semi-supervised image classification. In: ACCV. pp. 477-490. Springer (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "type": "text", + "content": "6. Liu, W., Wen, Y., Yu, Z., Li, M., Raj, B., Song, L.: Spherface: Deep hypersphere embedding for face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 212-220 (2017)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "text", + "content": "7. Manchanda, S., Bhagwatkar, K., Balutia, K., Agarwal, S., Chaudhary, J., Dosi, M., Chiranjeev, C., Vatsa, M., Singh, R.: D-lord: Dysl-ai database for low-resolution disguised face recognition. IEEE Trans. on Biom., Behav., and Ident. Sci. (2023)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 390, + 91, + 447, + 102 + ], + "type": "text", + "content": "HyperSpaceX" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 657 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "18. Moschoglou, S., Papaioannou, A., Sagonas, C., Deng, J., Kotsia, I., Zafeiriou, S.: Agedb: the first manually collected, in-the-wild age database. In: IEEE Conf. Comput. Vis. Pattern Recog. Worksh. pp. 51-59 (2017)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "type": "text", + "content": "19. Oh Song, H., Xiang, Y., Jegelka, S., Savarese, S.: Deep metric learning via lifted structured feature embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4004-4012 (2016)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 182, + 480, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 480, + 225 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 480, + 225 + ], + "type": "text", + "content": "20. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Int. Conf. Mach. Learn. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 225, + 480, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 225, + 480, + 246 + ], + "spans": [ + { + "bbox": [ + 132, + 225, + 480, + 246 + ], + "type": "text", + "content": "21. Ranasinghe, K., Naseer, M., Hayat, M., Khan, S., Khan, F.S.: Orthogonal projection loss. In: Int. Conf. Comput. Vis. pp. 12333-12343 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 247, + 480, + 279 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 247, + 480, + 279 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 480, + 279 + ], + "type": "text", + "content": "22. Schroff, F., Kalenichenko, D., Philbin, J.: Facenet: A unified embedding for face recognition and clustering. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 815-823 (2015)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 279, + 480, + 312 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 279, + 480, + 312 + ], + "spans": [ + { + "bbox": [ + 132, + 279, + 480, + 312 + ], + "type": "text", + "content": "23. Sengupta, S., Chen, J.C., Castillo, C., Patel, V.M., Chellappa, R., Jacobs, D.W.: Frontal to profile face verification in the wild. In: Winter Conf. on App. of Comput. Vis. pp. 1-9. IEEE (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 312, + 480, + 344 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 312, + 480, + 344 + ], + "spans": [ + { + "bbox": [ + 132, + 312, + 480, + 344 + ], + "type": "text", + "content": "24. Sermanet, P., Eigen, D., Zhang, X., Mathieu, M., Fergus, R., LeCun, Y.: Overfeat: Integrated recognition, localization and detection using convolutional networks. arXiv preprint arXiv:1312.6229 (2013)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 345, + 480, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 345, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 132, + 345, + 480, + 365 + ], + "type": "text", + "content": "25. Sohn, K.: Improved deep metric learning with multi-class n-pair loss objective. Adv. Neural Inform. Process. Syst. 29 (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 366, + 480, + 387 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 366, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 132, + 366, + 480, + 387 + ], + "type": "text", + "content": "26. Sun, Y., Chen, Y., Wang, X., Tang, X.: Deep learning face representation by joint identification-verification. Adv. Neural Inform. Process. Syst. 27 (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 387, + 480, + 420 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 387, + 480, + 420 + ], + "spans": [ + { + "bbox": [ + 132, + 387, + 480, + 420 + ], + "type": "text", + "content": "27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: Caltech-ucsd birds-200-2011 (cub-200-2011). Tech. Rep. CNS-TR-2011-001, California Institute of Technology (2011)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 420, + 480, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 420, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 480, + 453 + ], + "type": "text", + "content": "28. Wang, H., Wang, Y., Zhou, Z., Ji, X., Gong, D., Zhou, J., Li, Z., Liu, W.: Cosface: Large margin cosine loss for deep face recognition. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5265-5274 (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 453, + 480, + 474 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 480, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 480, + 474 + ], + "type": "text", + "content": "29. Wen, Y., Liu, W., Weller, A., Raj, B., Singh, R.: Spherical face classification is all you need for deep face recognition. In: Int. Conf. Learn. Represent. (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 474, + 480, + 495 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 474, + 480, + 495 + ], + "spans": [ + { + "bbox": [ + 132, + 474, + 480, + 495 + ], + "type": "text", + "content": "30. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Eur. Conf. Comput. Vis. Springer (2016)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 495, + 480, + 517 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 495, + 480, + 517 + ], + "spans": [ + { + "bbox": [ + 132, + 495, + 480, + 517 + ], + "type": "text", + "content": "31. Wu, C.Y., Manmatha, R., Smola, A.J., Krahenbuhl, P.: Sampling matters in deep embedding learning. In: Int. Conf. Comput. Vis. pp. 2840-2848 (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 517, + 480, + 538 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 517, + 480, + 538 + ], + "spans": [ + { + "bbox": [ + 132, + 517, + 480, + 538 + ], + "type": "text", + "content": "32. Xiao, H., Rasul, K., Vollgraf, R.: Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747 (2017)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 539, + 480, + 559 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 539, + 480, + 559 + ], + "spans": [ + { + "bbox": [ + 132, + 539, + 480, + 559 + ], + "type": "text", + "content": "33. Yi, D., Lei, Z., Liao, S., Li, S.Z.: Learning face representation from scratch. arXiv preprint arXiv:1411.7923 (2014)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 560, + 480, + 582 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 560, + 480, + 582 + ], + "spans": [ + { + "bbox": [ + 132, + 560, + 480, + 582 + ], + "type": "text", + "content": "34. Zeiler, M.D., Fergus, R.: Visualizing and understanding convolutional networks. In: Eur. Conf. Comput. Vis. pp. 818-833. Springer (2014)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 582, + 480, + 603 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 582, + 480, + 603 + ], + "spans": [ + { + "bbox": [ + 132, + 582, + 480, + 603 + ], + "type": "text", + "content": "35. Zhang, Z., Sabuncu, M.: Generalized cross entropy loss for training deep neural networks with noisy labels. Adv. Neural Inform. Process. Syst. 31 (2018)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 603, + 480, + 635 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 603, + 480, + 635 + ], + "spans": [ + { + "bbox": [ + 132, + 603, + 480, + 635 + ], + "type": "text", + "content": "36. Zheng, T., Deng, W.: Cross-pose lfw: A database for studying cross-posed face recognition in unconstrained environments. Beijing University of Posts and Telecommunications, Tech. Rep 5(7) (2018)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 635, + 480, + 657 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 635, + 480, + 657 + ], + "spans": [ + { + "bbox": [ + 132, + 635, + 480, + 657 + ], + "type": "text", + "content": "37. Zheng, T., Deng, W., Hu, J.: Cross-age LFW: A database for studying cross-age face recognition in unconstrained environments. CoRR abs/1708.08197 (2017)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 235, + 102 + ], + "type": "text", + "content": "Chiranjeev et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git "a/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_content_list.json" "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_content_list.json" new file mode 100644 index 0000000000000000000000000000000000000000..de6bb35de0bce4e6ff8dfff2c7b7fe96d53cc9c4 --- /dev/null +++ "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_content_list.json" @@ -0,0 +1,2063 @@ +[ + { + "type": "text", + "text": "Hyperion - A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM", + "text_level": 1, + "bbox": [ + 104, + 48, + 891, + 131 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "David Hug1, Ignacio Alzugaray2, and Margarita Chli1,3", + "bbox": [ + 179, + 169, + 815, + 188 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Vision for Robotics Lab, ETH Zürich, Zürich, Switzerland \n $^{2}$ Dyson Robotics Lab, Imperial College London, London, United Kingdom \n $^{3}$ Vision for Robotics Lab, University of Cyprus, Nicosia, Cyprus", + "bbox": [ + 128, + 204, + 866, + 258 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Continuous-Time Simultaneous Localization And Mapping (CTSLAM) has become a promising approach for fusing asynchronous and multi-modal sensor suites. Unlike discrete-time SLAM, which estimates poses discretely, CTSLAM uses continuous-time motion parametrizations, facilitating the integration of a variety of sensors such as rolling-shutter cameras, event cameras and Inertial Measurement Units (IMUs). However, CTSLAM approaches remain computationally demanding and are conventionally posed as centralized Non-Linear Least Squares (NLLS) optimizations. Targeting these limitations, we not only present the fastest SymForce-based [22] B- and Z-Spline implementations achieving speedups between $2.43\\mathrm{x}$ and $110.31\\mathrm{x}$ over Sommer et al. [40] but also implement a novel continuous-time Gaussian Belief Propagation (GBP) framework, coined Hyperion, which targets decentralized probabilistic inference across agents. We demonstrate the efficacy of our method in motion tracking and localization settings, complemented by empirical ablation studies.", + "bbox": [ + 145, + 302, + 849, + 570 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Code: https://github.com/VIS4ROB-lab/hyperion", + "bbox": [ + 147, + 572, + 670, + 588 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Gaussian Belief Propagation $\\cdot$ Continuous-Time SLAM $\\cdot$ Distributed Non-Linear Least Squares Optimization $\\cdot$ B- and Z-Splines", + "bbox": [ + 147, + 606, + 849, + 642 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 82, + 674, + 307, + 695 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Estimating a sensor-suite's ego-motion and workspace employing Simultaneous Localization And Mapping (SLAM) techniques, has long been studied using a wide variety of sensing modalities, such as vision sensors [35,39,43,46], IMUs [7,18,36], Global Positioning System (GPS) feeds [21, 23], and laser ranging [9] sensors. Unlike traditional, discrete-time approaches, which require careful synchronization of sensory measurements due to the discretization of motion-parametrizing states, Continuous-Time Simultaneous Localization And Mapping (CTSLAM) [9,12,13, 15,33] offers native support for the fusion of asynchronous measurements due to its continuous-time parametrization that yields pose, velocity and acceleration estimates at arbitrary instances in time.", + "bbox": [ + 79, + 713, + 920, + 907 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Despite their advantages, CTSLAM approaches often entail higher computational complexity than conventional approaches, which somewhat hinders their", + "bbox": [ + 82, + 910, + 917, + 946 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/880a72859e038ce470de5e86e040e91632612a1dd55bb859e91893c0f777c18d.jpg", + "image_caption": [ + "(a) At initialization" + ], + "image_footnote": [], + "bbox": [ + 113, + 52, + 348, + 211 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/5cc37deb828f995f589cb6ee44425b7e0da44486bbedd1ef3c3b0958d90472e4.jpg", + "image_caption": [ + "(b) After the $1^{\\mathrm{st}}$ iteration", + "Fig. 1: Both the proposed continuous-time GBP solver (in magenta) and the conventional NLLS solver [1] (in white) converge to identical solutions close to the ground truth (in green) even under poor initialization ( $\\pm 1.00 \\, \\mathrm{m / rad}$ ) and substantial pose measurement noise ( $\\pm 0.05 \\, \\mathrm{m / rad}$ )." + ], + "image_footnote": [], + "bbox": [ + 360, + 52, + 595, + 211 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/2c53a95439bee51e238547e090013378be339e05e5505e123a7287d7a7309328.jpg", + "image_caption": [ + "(c) Absolute Error" + ], + "image_footnote": [], + "bbox": [ + 605, + 52, + 883, + 211 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "deployment in real-world scenarios. In addition, most (discrete- and continuous-time) SLAM systems pose the underlying optimization as a centralized Non-Linear Least Squares (NLLS) problem, which, without further modifications, strictly limits their applicability to single-agent setups.", + "bbox": [ + 72, + 354, + 922, + 432 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Thus, novel, decentralized algorithms along with more effective continuous-time motion parametrizations are paramount in the quest to overcome existing challenges in traditional, centralized CTSLAM techniques. Distributed methods such as GBP are especially promising given that they, in contrast to conventional NLLS paradigms, achieve iterative, probabilistic inference through message-passing between individual nodes and factors in a factor graph and that they operate in a distributed and asynchronous manner by nature rendering them inherently scalable, even across multiple agents. In addition, GBP also explicitly models the uncertainties of estimizable quantities, which can be leveraged to selectively direct computational resources to non-converged nodes in the graph. This circumstance is especially promising in the context of CTSLAM where effective allocation of computational resources towards the least certain estimates promises to further reduce their computational complexity.", + "bbox": [ + 75, + 432, + 922, + 684 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This work, in particular, pushes the performance envelope of B- and Z-Splines and devises an innovative, distributed optimization strategy for CTSLAM using GBP. Whilst the need for faster continuous-time parametrizations is self-evident, we also specifically target the absence of a distributed, continuous-time state estimation framework. Such a framework, not only promises flexible resource allocation and decentralized state estimation but also allows fusing asynchronous measurements. Here, we showcase the practicality of the proposed continuous-time GBP framework and provide it as an open-source implementation to encourage benchmarking. In addition to these contributions, this work also", + "bbox": [ + 72, + 684, + 922, + 861 + ], + "page_idx": 1 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- offers the fastest, fully analytic B- and Z-Spline implementations to date,", + "- presents a novel, symbolic GBP-based framework for continuous-time SLAM,", + "- demonstrates the suitability of the proposed method in practical setups, and", + "- provides detailed ablation studies on the algorithm itself." + ], + "bbox": [ + 92, + 871, + 922, + 947 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 77, + 17, + 94, + 29 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 159, + 14, + 288, + 30 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 77, + 53, + 329, + 74 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The SLAM problem has long been researched as it comprises the core of robotic perception, with seminal works focusing on discrete-time, monocular [26, 36] and stereo setups [35, 37], as well as works which propose fusion of additional sensing information, such as inertial [5-7, 19], and laser ranging [9]. In addition to these feature-based approaches to SLAM, alternative powerful paradigms have been proposed, such as direct methods [10, 11] and machine-learning based techniques [24, 44] have been demonstrated to be beneficial in some scenarios.", + "bbox": [ + 77, + 92, + 917, + 227 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In contrast to traditional, discrete-time SLAM methods that have been widely adopted, CTSLAM techniques have early on been demonstrated to exhibit great potential for high-fidelity and continuous estimates of motion [2, 12, 13, 15, 20, 25, 42, 45], albeit posing fundamental scientific and algorithmic challenges. The key advantage of these methods lies in their inherent capability to fuse unsynchronized and asynchronous measurements (e.g. from a rolling shutter camera or an event-based vision sensor) in the estimation processes, in contrast to conventional approaches. However, the wider adoption of CTSLAM techniques remains impeded by challenges in finding more efficient motion representations, addressing convergence issues as well as overcoming computational limitations, missing out on the promise for high-fidelity motion and scene estimation.", + "bbox": [ + 77, + 229, + 917, + 440 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Following promising leads in fundamental SLAM research for single agents, a novel challenge and desire to deploy the same techniques in collaborative, multi-agent setups arose. Works such as [38] proposed means to address centralized multi-agent SLAM, while [18] investigated the advantages of variable-stereo baseline setups, which leverage the views from two agents to boost the accuracy of high-altitude depth estimates. A common approach to solve NLLS optimizations in a distributed fashion is based on Alternating Direction Method of Multipliers (ADMM) approaches similar to the work in [34] and [3], which leverage the use of dual residuals to ensure consistent estimates across distributed multi-agent NLLS optimizations. Orthogonally, GBP approaches [8, 28, 30, 32] can perform distributed and asynchronous inference of states via an equivalent message-passing scheme, making them ideal candidates to address multi-agent SLAM.", + "bbox": [ + 77, + 443, + 917, + 674 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this work, we build upon these ideas, consolidate a distributed GBP optimization with a continuous-time parametrization, and demonstrate the suitability of the novel, combined method in practical setups.", + "bbox": [ + 77, + 676, + 917, + 733 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 77, + 762, + 314, + 783 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 Preliminaries", + "text_level": 1, + "bbox": [ + 77, + 801, + 305, + 819 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "All Simultaneous Localization And Mapping (SLAM) algorithms, in essence, aim to estimate an optimal, cost-minimizing set of estimizable parameters $\\Theta$ which are set to describe a collection of noisy sensory measurements $m$ with the highest possible accuracy. Specifically, in its NLLS formulation, this optimal solution is found by minimization of the cumulative cost over a set of weighted residuals $\\bar{r}$ associated with measurements $m$ stemming from a connected sensor", + "bbox": [ + 77, + 830, + 917, + 947 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 837, + 34 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 900, + 16, + 917, + 30 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/a5794792b9b6a0599496a3c4d1a5c0a4997a3d5c9713592131dbe323b2f4130a.jpg", + "image_caption": [ + "Fig. 2: For every (valid) instance in time $t$ , a collection of adjacent bases (in orange) gives rise to an individual segment (in green) of a cubic B-Spline. An interpolated pose at query time $t$ is then obtained from the (cumulative) blending of these bases." + ], + "image_footnote": [], + "bbox": [ + 242, + 50, + 755, + 208 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "$s$ . A weighted residuals $\\bar{\\pmb{r}}$ at measurement time $t$ is computed by comparing a predicted measurement $\\hat{\\pmb{m}}(t, \\pmb{\\theta}_s)$ with sensor-associated parameters $\\pmb{\\theta}_s \\subseteq \\pmb{\\Theta}$ to a measured one $\\pmb{m}(t)$ through the application of a metric $\\pmb{\\mu}$ (i.e. $\\hat{x} \\boxminus_{\\pmb{\\mu}} x$ ) and a subsequent weighting via the square-root information $\\Omega_m$ according to", + "bbox": [ + 72, + 313, + 922, + 393 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {r} (t, \\boldsymbol {\\theta} _ {s}) = \\hat {\\boldsymbol {m}} (t, \\boldsymbol {\\theta} _ {s}) \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {m} (t) \\text {a n d} \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 322, + 409, + 920, + 430 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\left\\| \\bar {\\boldsymbol {r}} \\right\\| ^ {2} = \\bar {\\boldsymbol {r}} ^ {\\top} \\bar {\\boldsymbol {r}} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Omega} _ {m} ^ {\\top} \\boldsymbol {\\Omega} _ {m} \\boldsymbol {r} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Lambda} _ {m} \\boldsymbol {r} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Sigma} _ {m} ^ {- 1} \\boldsymbol {r}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 232, + 434, + 920, + 458 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\pmb{\\Sigma}_{m}$ and $\\pmb{\\Lambda}_{m}$ are the covariance and precision matrix, respectively. Ultimately, we aim to minimize the sum over residuals stemming from all connected sensors $S$ and their associated measurements $\\mathcal{M}_s$ with measurement times $\\mathcal{T}_s$ . To this end, established NLLS solvers [1] are commonly deployed in practice, which aim to obtain the optimal, cost-minimizing parameters $\\Theta^{*}$ as defined below.", + "bbox": [ + 72, + 474, + 922, + 573 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\Theta} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\left[ \\sum_ {s \\in \\mathcal {S}} \\sum_ {t \\in \\mathcal {T} _ {s}} \\frac {1}{2} \\| \\bar {\\boldsymbol {r}} (t, \\boldsymbol {\\theta} _ {s}) \\| ^ {2} \\right]. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 285, + 586, + 920, + 652 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 Continuous-Time Motion", + "text_level": 1, + "bbox": [ + 75, + 682, + 452, + 700 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In recent times, continuous-time formulations of conventional SLAM algorithms have been studied by multiple authors [12, 13, 15, 16, 20, 40], where the most common motion parametrization is based on the concept of cubic B-Splines. This practice is rooted in several favorable properties of B-Splines, such as their compact representation, finite support, analytic Jacobians, and their $\\mathcal{C}_2$ -continuity for predicting instantaneous velocities and accelerations. In this work, we utilize split interpolations for world-to-body transformations $T_{wb}(t) \\in \\mathbb{S}\\mathbb{E}(3)$ , illustrated in Fig. 2, that separately parametrize rotations $R_{wb}(t) \\in \\mathbb{S}\\mathbb{O}(3)$ and translations $t_{wb}(t) \\in \\mathbb{R}^3$ . In particular, we compute transformations $T_{wb}(t)$ using", + "bbox": [ + 72, + 718, + 924, + 897 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {T} _ {w b} (t) = \\left[ \\begin{array}{c c} \\boldsymbol {R} _ {w b} (\\boldsymbol {q} _ {w b} (t)) & \\boldsymbol {t} _ {w b} (t) \\\\ \\boldsymbol {0} & 1 \\end{array} \\right] \\in \\mathbb {S E} (3) \\text {w i t h} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 246, + 910, + 920, + 954 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 77, + 16, + 96, + 29 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 157, + 14, + 290, + 32 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {q} _ {w b} (t) = \\boldsymbol {q} _ {w i} * \\prod_ {j = 1} ^ {k} \\left(\\boldsymbol {q} _ {w (i + j - 1)} ^ {- 1} * \\boldsymbol {q} _ {w (i + j)}\\right) ^ {\\lambda_ {j} (t)} \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 259, + 71, + 920, + 126 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {t} _ {w b} (t) = \\boldsymbol {t} _ {w i} + \\sum_ {j = 1} ^ {k} \\left[ \\lambda_ {j} (t) \\left(\\boldsymbol {t} _ {w (i + j)} - \\boldsymbol {t} _ {w (i + j - 1)}\\right) \\right], \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 239, + 134, + 920, + 188 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where individual evaluations of $T_{wb}(t)$ depend on a collection of bases $\\{\\mathcal{B}_i, \\dots, \\mathcal{B}_{i+k}\\}$ (see Fig. 2) and each basis $\\mathcal{B}_i$ comprises a time $t_i$ , a quaternion $q_{wi}$ and a translation $t_{wi}$ . Above, $k$ is the Degree of Freedom (DoF) of the B-/Z-Spline, rotations $R_{wb}(t)$ are parametrized by quaternions $q_{wb}(t)$ and the expression $\\lambda_j(t)$ serves as a placeholder for concrete interpolation coefficients found in [4, 15, 17, 20].", + "bbox": [ + 72, + 195, + 946, + 295 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.3 Continuous-Time Optimization", + "text_level": 1, + "bbox": [ + 75, + 318, + 525, + 339 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In its probabilistic formulation [30, 32], the non-linear minimization problem from Eq. (3) is equivalent to finding an optimal probability distribution that accounts for all acquired measurements. Without loss of generality, one can also represent the problem as a product of factors $f_{i} \\propto e^{-E_{i}(\\pmb{\\theta}_{i})}$ with induced energies $E_{i}(\\pmb{\\theta}_{i})$ , arriving at the modified expression to obtain the optimal parameters $\\pmb{\\Theta}^{*}$ .", + "bbox": [ + 72, + 349, + 922, + 448 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\Theta} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m a x}} \\log (p (\\boldsymbol {\\Theta})) = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\sum_ {i} E _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\text {w i t h} \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 215, + 458, + 920, + 497 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\np (\\boldsymbol {\\Theta}) = \\prod_ {i} f _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\propto \\prod_ {i} e ^ {- E _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right)}. \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 295, + 502, + 920, + 541 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this work, we use multi-variant Gaussians $\\mathcal{N}(\\pmb{\\mu}_i, \\pmb{\\Sigma}_i)$ to model the factors $f_i$ in Eq. (8), linking the energies in Eq. (7) to the residuals in Eq. (2) according to", + "bbox": [ + 72, + 554, + 917, + 595 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nE _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) = \\left\\| \\bar {\\boldsymbol {r}} _ {i} \\right\\| ^ {2} = \\boldsymbol {r} _ {i} ^ {\\top} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\boldsymbol {\\Omega} _ {i} ^ {\\top} \\boldsymbol {\\Omega} _ {i} \\boldsymbol {r} _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right). \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 254, + 622, + 920, + 647 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The generic residuals $\\bar{\\pmb{r}}_i$ themselves are non-linear with a corresponding Taylor expansions in $\\pmb{\\theta}_i$ around some linearization point $\\pmb{\\theta}_i^0$ such that", + "bbox": [ + 72, + 658, + 917, + 699 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i}\\right) - \\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i} ^ {0}\\right) \\approx D \\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i} ^ {0}\\right) \\left(\\boldsymbol {\\theta} _ {i} - \\boldsymbol {\\theta} _ {i} ^ {0}\\right) = \\bar {\\boldsymbol {J}} _ {i} ^ {0} \\left(\\boldsymbol {\\theta} _ {i} - \\boldsymbol {\\theta} _ {i} ^ {0}\\right) = \\bar {\\boldsymbol {J}} _ {i} ^ {0} \\boldsymbol {\\tau} _ {i} ^ {0}. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 179, + 710, + 920, + 736 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Furthermore, all factors $f_{i}$ , their energies $E_{i}(t_{i},\\pmb{\\theta}_{i})$ respectively, can also be converted to an equivalent, incremental information form $\\mathcal{N}^{-1}(\\pmb{\\eta}_i^0,\\pmb{\\Lambda}_i^0)$ , yielding", + "bbox": [ + 72, + 747, + 917, + 788 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nE _ {i} \\left(t _ {i}, \\boldsymbol {\\tau} _ {i} ^ {0}\\right) \\approx \\frac {1}{2} \\boldsymbol {\\tau} _ {i} ^ {0, \\top} \\boldsymbol {\\Lambda} _ {i} ^ {0} \\boldsymbol {\\tau} _ {i} ^ {0} - \\boldsymbol {\\tau} _ {i} ^ {0, \\top} \\boldsymbol {\\eta} _ {i} ^ {0} \\quad \\text {w h e r e} \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 268, + 811, + 920, + 850 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\eta} _ {i} ^ {0} = - \\bar {\\boldsymbol {J}} _ {i} ^ {0, \\top} \\bar {\\boldsymbol {r}} _ {i} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {i} ^ {0} = \\bar {\\boldsymbol {J}} _ {i} ^ {0, \\top} \\bar {\\boldsymbol {J}} _ {i} ^ {0}. \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 300, + 852, + 920, + 879 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "This dual representation of factors $f_{i}$ and the existence of the Gaussian $\\mathcal{N}$ and its inverse $\\mathcal{N}^{-1}$ is vital for efficient conditioning and marginalization of individual terms in the GBP algorithm presented in the next section.", + "bbox": [ + 72, + 889, + 917, + 947 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 840, + 32 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 900, + 16, + 917, + 30 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/e9cbb42702f7687243747090f2e2f9c99a7521e08a624871189b625df04a8039.jpg", + "image_caption": [ + "(a) Factor Graph" + ], + "image_footnote": [], + "bbox": [ + 89, + 50, + 472, + 182 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/ece40848923e6c99ad24958d2e65dc8478d19c5b165985e6ced635208647bd57.jpg", + "image_caption": [ + "(b) Message Passing", + "Fig. 3: (a) Qualitative illustration of the factor graphs resulting from a continuous-time motion parametrization. Notably, even one of the simplest factor archetypes, which purely relies on the motion-parameterizing nodes as well as some landmarks, introduces a considerable amount of loops in the continuous-time realm. This can be attributed to the fact that poses $T_{wb}(t)$ depend on multiple bases for any given time $t$ . (b) Visualization of the message passing algorithm between nodes and factors in a graph $\\mathcal{G}$ ." + ], + "image_footnote": [], + "bbox": [ + 481, + 48, + 903, + 182 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Gaussian Belief Propagation (GBP) As illustrated in Fig. 3a, Eqs. (3) and (7) expose equivalent visual representations as factor graphs, giving rise to compact and intuitive descriptions of complex probabilistic dependencies which are encoded into bipartite graphs $\\mathcal{G}$ containing factors $f_{i} \\sim \\mathcal{N}^{-1}(\\pmb{\\eta}_{f_{i}}, \\pmb{\\Lambda}_{f_{i}})$ and nodes $n_j \\sim \\mathcal{N}(\\pmb{\\mu}_{n_j}, \\pmb{\\Sigma}_{n_j}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_j}, \\pmb{\\Lambda}_{n_j})$ . Intuitively, the GBP algorithm, thus, comprises two steps to iteratively solve for the optimal solution to Eq. (7), namely node and factor updates with intermediate factor-to-node $\\pmb{m}_{f_i \\rightarrow n_j}$ and node-to-factor $\\pmb{m}_{n_j \\rightarrow f_i}$ message passing detailed in the following.", + "bbox": [ + 72, + 357, + 920, + 517 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Node Updates: The Gaussian nodes $n_j \\in \\mathcal{G}$ with neighborhood $N(n_j)$ of connected factors $f_i \\in N(n_j)$ are updated by taking the product over incoming factor-to-node messages $\\pmb{m}_{f_i \\to n_j}$ , which reduces to a simple summation of Gaussians for (linear) vector spaces, resulting in node beliefs $B(n_j) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_j}, \\pmb{\\Lambda}_{n_j})$ , where", + "bbox": [ + 72, + 531, + 922, + 611 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\eta} _ {n _ {j}} = \\boldsymbol {\\eta} _ {n _ {j}} ^ {p} + \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\eta} _ {f _ {i} \\rightarrow n _ {j}} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} = \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {p} + \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}}. \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 123, + 637, + 920, + 682 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Above, $P(n_{j}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_{j}}^{p},\\pmb{\\Lambda}_{n_{j}}^{p})$ denotes a known prior on the node belief $B(n_{j})$ which can be leveraged to better constrain the problem in practice. However, despite its simplicity and elegance, this straightforward approach can not be applied to Lie groups $G$ with associated tangent space $\\mathfrak{g}$ and their operators $\\boxminus : G \\times G \\mapsto \\mathfrak{g}$ and $\\boxplus : G \\times \\mathfrak{g} \\mapsto G$ extensively used in robotics. Hence, a more sophisticated approach is required to obtain the product of factor-to-node messages and to handle frame conversions between elements in the Lie group.", + "bbox": [ + 72, + 695, + 920, + 830 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To this end, we follow a similar strategy as Murai et al. [28] and propose the use of a Mixed Gaussian Representation (MGR) to parameterize Lie-group-valued nodes as $n_j \\sim \\mathfrak{N}(\\pmb{\\mu}_{n_j}, \\pmb{\\Lambda}_{n_j})$ , where $\\pmb{\\mu}_{n_j} \\in G$ and $\\pmb{\\Lambda}_{n_j} \\in \\mathbb{R}^{\\dim(\\mathfrak{g}) \\times \\dim(\\mathfrak{g})}$ , also assuming that incoming message $\\pmb{m}_{f_i \\to n_j} \\sim \\mathfrak{N}(\\pmb{\\mu}_{f_i \\to n_j}, \\pmb{\\Lambda}_{f_i \\to n_j})$ take the same form. In contrast to conventional vector spaces, the precision matrices are expressed relative to their associated elements in the Lie group, implying that", + "bbox": [ + 72, + 830, + 920, + 949 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 77, + 16, + 94, + 29 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 159, + 14, + 288, + 32 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "one must warp them to a privileged frame of reference. An intuitive choice for such a frame is the latest estimate of the node's state, denoted as $\\pmb{\\mu}_{n_j}^0$ and $\\pmb{\\Lambda}_{n_j}^0$ , resulting in the following transformation rules to warp the messages.", + "bbox": [ + 72, + 56, + 922, + 115 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} = \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}} \\boxminus \\boldsymbol {\\mu} _ {n _ {j}} ^ {0} \\quad \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g})} \\tag {14}\n$$\n", + "text_format": "latex", + "bbox": [ + 307, + 123, + 920, + 149 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} = \\left[ \\frac {\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}}{\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} \\left[ \\frac {\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}}{\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}}} \\right] \\quad \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g}) \\times \\dim (\\mathfrak {g})} \\tag {15}\n$$\n", + "text_format": "latex", + "bbox": [ + 167, + 152, + 920, + 209 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "After this conversion, both $\\pmb{\\tau}_{f_i\\rightarrow n_j}^0$ and $\\pmb{\\Lambda}_{f_i\\rightarrow n_j}^0$ are elements in the tangent (matrix) space relative to the privileged frame and must then be summed in analogy to Eq. (13) to yield the intermediate, incremental values", + "bbox": [ + 72, + 219, + 920, + 281 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\tau} _ {n _ {j}} ^ {+} = \\alpha_ {n _ {j}} \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}, \\tag {16}\n$$\n", + "text_format": "latex", + "bbox": [ + 157, + 292, + 920, + 336 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\alpha_{n_j}$ denotes an optional step size. The above increments must then again be warped to the updated frame of reference by evaluating", + "bbox": [ + 72, + 346, + 917, + 386 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\mu} _ {n _ {j}} = \\boldsymbol {\\mu} _ {n _ {j}} ^ {0} \\boxplus \\boldsymbol {\\tau} _ {n _ {j}} ^ {+} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} = \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {n _ {j}}}{\\partial \\boldsymbol {\\tau} _ {n _ {j}} ^ {+}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {+} \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {n _ {j}}}{\\partial \\boldsymbol {\\tau} _ {n _ {j}} ^ {+}} \\right]. \\tag {17}\n$$\n", + "text_format": "latex", + "bbox": [ + 205, + 396, + 920, + 445 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Note, however, that priors can not be injected as simplistically as in Eq. (13) and need to be treated as proper factors in the context of Lie groups instead.", + "bbox": [ + 75, + 453, + 917, + 494 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Node-to-factor Messages: The generation of node-to-factor messages mirrors the expressions from Eq. (16), differing only in excluding information stemming from the target factor in the sums. Hence, they encompass", + "bbox": [ + 75, + 508, + 917, + 567 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\tau} _ {n _ {j} \\rightarrow f _ {k}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j}) \\backslash f _ {k}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j} \\rightarrow f _ {k}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j}) \\backslash f _ {k}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\tag {18}\n$$\n", + "text_format": "latex", + "bbox": [ + 94, + 578, + 920, + 622 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "alongside their respective linearization point $\\pmb{\\mu}_{n_j}^0$ to form the outgoing message triplet $(\\pmb{\\mu}_{n_j}^0, \\pmb{\\tau}_{n_j \\to f_k}^+, \\pmb{\\Lambda}_{n_j \\to f_k}^+)$ destined for the factor $f_k$ . Note, however, that another reevaluation of Eqs. (14) and (15) is required to generate outgoing messages that leverage the latest state estimate from Eq. (17).", + "bbox": [ + 72, + 634, + 917, + 718 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Factor Updates: In analogy to previous paragraphs, factors $f_{i} \\in \\mathcal{G}$ depend on a collection of connected, neighboring nodes $N(f_{i})$ which collectively determine the linearization point $\\pmb{\\theta}_{f_i}^0$ for the residual evaluation $\\bar{\\pmb{r}}_{f_i}$ from Eq. (2). The computation of the factor-to-node messages $m_{f_i \\to N(f_i)}$ depends on the factor beliefs $B(f_{i}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{f_{i}}^{0},\\pmb{\\Lambda}_{f_{i}}^{0})$ obtained from Eq. (12) as well as the auxiliary, intermediate quantities $\\pmb{\\eta}_{f_i}'$ and $\\pmb{\\Lambda}_{f_i}'$ (used in the next paragraph) defined as", + "bbox": [ + 72, + 734, + 920, + 858 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} = \\boldsymbol {\\eta} _ {f _ {i}} ^ {0} + \\boldsymbol {\\eta} _ {N (f _ {i}) \\rightarrow f _ {i}} ^ {+} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} = \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {0} + \\boldsymbol {\\Lambda} _ {N (f _ {i}) \\rightarrow f _ {i}} ^ {+} \\tag {19}\n$$\n", + "text_format": "latex", + "bbox": [ + 217, + 869, + 920, + 895 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Above, $\\pmb{\\eta}_{N(f_i)\\rightarrow f_i}^+$ and $\\pmb{\\Lambda}_{N(f_i)\\rightarrow f_i}^+$ denote stacked vector and block diagonal matrix versions of the neighborhood-to-factor messages (see Eqs. (20) and (21)).", + "bbox": [ + 75, + 905, + 917, + 949 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 840, + 32 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 903, + 16, + 917, + 30 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Factor-to-Node Messages: We illustrate the computation of the factor-to-node messages (see Fig. 3b) assuming a factor $f_{i}$ which depends on two nodes, namely $n_a$ and $n_b$ . Thus, Eq. (19) takes the following form", + "bbox": [ + 75, + 55, + 920, + 115 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} = \\left[\\begin{array}{l}\\boldsymbol {\\eta} _ {a} ^ {\\prime}\\\\\\boldsymbol {\\eta} _ {b} ^ {\\prime}\\end{array}\\right] = \\boldsymbol {\\eta} _ {f _ {i}} ^ {0} + \\left[\\begin{array}{c}\\boldsymbol {\\eta} _ {n _ {a} \\rightarrow f _ {i}} ^ {+}\\\\\\boldsymbol {\\eta} _ {n _ {b} \\rightarrow f _ {i}} ^ {+}\\end{array}\\right] \\tag {20}\n$$\n", + "text_format": "latex", + "bbox": [ + 341, + 131, + 917, + 175 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} = \\left[\\begin{array}{l l}\\boldsymbol {\\Lambda} _ {a a} ^ {\\prime}&\\boldsymbol {\\Lambda} _ {b a} ^ {\\prime \\top}\\\\\\boldsymbol {\\Lambda} _ {b a} ^ {\\prime}&\\boldsymbol {\\Lambda} _ {b b} ^ {\\prime}\\end{array}\\right] = \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {0} + \\left[\\begin{array}{c c}\\boldsymbol {\\Lambda} _ {n _ {a} \\rightarrow f _ {i}} ^ {+}&\\mathbf {0}\\\\\\mathbf {0}&\\boldsymbol {\\Lambda} _ {n _ {b} \\rightarrow f _ {i}} ^ {+}\\end{array}\\right]. \\tag {21}\n$$\n", + "text_format": "latex", + "bbox": [ + 256, + 180, + 917, + 224 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To retrieve the message $\\pmb{m}_{f_i\\rightarrow n_a} = \\mathfrak{N}(\\pmb{\\mu}_{f_i\\rightarrow n_a},\\pmb{\\Lambda}_{f_i\\rightarrow n_a})$ , the remaining nodes (i.e. $n_b$ in this example) must initially be marginalized by computing the Schur complement defined as", + "bbox": [ + 72, + 240, + 917, + 299 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\eta_ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\eta_ {a} ^ {0} - \\Lambda_ {b a} ^ {\\prime \\top} \\Lambda_ {b b} ^ {\\prime - 1} \\eta_ {b} ^ {\\prime} \\quad \\text {a n d} \\quad \\Lambda_ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\Lambda_ {a a} ^ {0} - \\Lambda_ {b a} ^ {\\prime \\top} \\Lambda_ {b b} ^ {\\prime - 1} \\Lambda_ {b a} ^ {\\prime}. \\tag {22}\n$$\n", + "text_format": "latex", + "bbox": [ + 135, + 313, + 917, + 339 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In a similar vein, one obtains $\\pmb{m}_{f_i \\to n_b}$ by permuting $\\pmb{\\eta}_{f_i}'$ and $\\pmb{\\Lambda}_{f_i}'$ such that $n_a$ is marginalized instead of $n_b$ . In particular,", + "bbox": [ + 72, + 356, + 917, + 395 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\left[ \\begin{array}{l} \\boldsymbol {\\eta} _ {b} ^ {\\prime} \\\\ \\boldsymbol {\\eta} _ {a} ^ {\\prime} \\end{array} \\right] = P \\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} \\text {a n d} \\left[ \\begin{array}{c c} \\boldsymbol {\\Lambda} _ {b b} ^ {\\prime} & \\boldsymbol {\\Lambda} _ {a b} ^ {\\prime \\top} \\\\ \\boldsymbol {\\Lambda} _ {a b} ^ {\\prime} & \\boldsymbol {\\Lambda} _ {a a} ^ {\\prime} \\end{array} \\right] = P \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} P ^ {\\top}, \\tag {23}\n$$\n", + "text_format": "latex", + "bbox": [ + 280, + 411, + 917, + 453 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "which also naturally extends to factors touching more than two nodes. Readers might notice that our formulation differs from others found in the literature; this has the advantage that the formulations from Eqs. (20) and (21) allow for extremely efficient in-place permutations of $\\pmb{\\eta}_{f_i}^{\\prime}$ and $\\pmb{\\Lambda}_{f_i}^{\\prime}$ to marginalize many-node factors, limiting reallocations and recomputations. Mirroring the process in Eq. (17), it is necessary to convert the incremental values $\\pmb{\\eta}_{f_i\\rightarrow n_a}^{\\prime}$ and $\\pmb{\\Lambda}_{f_i\\rightarrow n_a}^{\\prime}$ into the updated, outgoing frame of reference, to obtain the message $\\pmb{m}_{f_i\\rightarrow n_a}$ , relying on an optional step size $\\alpha_{f_i}$ . That is", + "bbox": [ + 72, + 468, + 920, + 624 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\alpha_ {f _ {i}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime - 1} \\boldsymbol {\\eta} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g})}, \\quad \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}} = \\boldsymbol {\\mu} _ {n _ {a}} ^ {0} \\boxplus \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\in G \\tag {24}\n$$\n", + "text_format": "latex", + "bbox": [ + 101, + 642, + 917, + 666 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} = \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}}}{\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}}}{\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime}} \\right] \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g}) \\times \\dim (\\mathfrak {g})}. \\tag {25}\n$$\n", + "text_format": "latex", + "bbox": [ + 118, + 669, + 917, + 726 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Robust Residuals and Energies: It is well understood that the presence of outliers in the optimization problem from Eq. (3) causes substantial issues in terms of converging to a globally optimal solution $\\Theta^{*}$ due to the quadratic nature of the occurring cost terms. The same holds in the context of GBP, where outliers are bound to heavily influence the found solution as well. To address this issue we take inspiration from established NLLS approaches [1] and apply robust loss functions $\\rho$ to Eqs. (3) and (9), resulting in modified expressions for the robust energies $\\vec{E}$ and the robust optimal solution $\\check{\\Theta}^{*}$ , provided for completeness only.", + "bbox": [ + 72, + 746, + 920, + 902 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\check {E} (t, \\boldsymbol {\\theta} _ {s}) = \\frac {1}{2} \\rho (\\bar {\\boldsymbol {r}} ^ {\\top} \\bar {\\boldsymbol {r}}) \\tag {26}\n$$\n", + "text_format": "latex", + "bbox": [ + 387, + 918, + 917, + 952 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 77, + 16, + 94, + 29 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 157, + 14, + 290, + 32 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\breve {\\boldsymbol {\\theta}} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\left[ \\sum_ {s \\in \\mathcal {S}} \\sum_ {t \\in \\mathcal {T} _ {s}} \\breve {E} (t, \\boldsymbol {\\theta} _ {s}) \\right] \\tag {27}\n$$\n", + "text_format": "latex", + "bbox": [ + 319, + 68, + 920, + 131 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In particular, based on the methodology from Triggs et al. [41], the robust residual and Jacobian then take the following forms.", + "bbox": [ + 72, + 136, + 917, + 177 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\alpha^ {2} - 2 \\alpha - \\frac {2 \\rho^ {\\prime \\prime}}{\\rho^ {\\prime}} \\bar {\\boldsymbol {r}} _ {i} ^ {\\top} \\bar {\\boldsymbol {r}} _ {i} \\stackrel {!} {=} 0 \\tag {28}\n$$\n", + "text_format": "latex", + "bbox": [ + 365, + 185, + 920, + 227 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\check {\\boldsymbol {r}} _ {i} = \\frac {\\sqrt {\\rho^ {\\prime}}}{1 - \\alpha} \\bar {\\boldsymbol {r}} _ {i} \\quad \\check {\\boldsymbol {J}} _ {i} = \\sqrt {\\rho^ {\\prime}} \\left(1 - \\alpha \\frac {\\bar {\\boldsymbol {r}} _ {i} \\bar {\\boldsymbol {r}} _ {i} ^ {\\top}}{\\| \\bar {\\boldsymbol {r}} _ {i} \\| ^ {2}}\\right) \\bar {\\boldsymbol {J}} _ {i} \\tag {29}\n$$\n", + "text_format": "latex", + "bbox": [ + 263, + 230, + 920, + 284 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Non-Gaussian Nodes: Another extension to conventional GBP lies in classifying Gaussian nodes as either pure constants or as stochastic variables. This distinction streamlines computation given that the message marginalization $\\pmb{m}_{n_j\\rightarrow f_i}$ across nodes via Cholesky decomposition exposes complexity $\\mathcal{O}(n^3)$ which quickly becomes prohibitive. In particular, allowing non-variable parameters (e.g. extrinsic, intrinsic, offset etc.) to be treated as pure constants considerably reduces the dimensionality of the marginalization procedure without any drawbacks.", + "bbox": [ + 72, + 295, + 922, + 434 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.4 Sensor Models", + "text_level": 1, + "bbox": [ + 75, + 458, + 324, + 476 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In the following, we detail the employed absolute and visual sensor models, where expressions marked with $\\hat{\\cdot}$ indicate estimizable parameters. Conversely, unless explicitly mentioned, all other variables are considered known and constant.", + "bbox": [ + 72, + 487, + 917, + 546 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Absolute Sensor Model The predictions of absolute sensor measurements $\\hat{m}_s(t_m,\\Theta_s)$ (e.g. absolute pose estimates extracted from AprilTags [29] or measurements obtained from a Motion Capture (MoCap) system) are evaluated using Eq. (30) and subsequently compared against their corresponding true measurements by applying the metric $\\boxdot_{\\mu}$ in Eq. (31) where we make use of the logarithmic map for elements in $\\mathbb{S}\\mathbb{O}(3)$ , and $\\mathbb{SU}(2)$ respectively.", + "bbox": [ + 72, + 570, + 920, + 689 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\boldsymbol {m}} _ {s} \\left(t _ {m}, \\Theta_ {s}\\right) = \\hat {\\boldsymbol {T}} _ {w s} \\left(t _ {m}\\right) = \\hat {\\boldsymbol {T}} _ {w b} \\left(t _ {m}\\right) \\boldsymbol {T} _ {b s} \\tag {30}\n$$\n", + "text_format": "latex", + "bbox": [ + 290, + 700, + 917, + 721 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\boldsymbol {T}} _ {w s} \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {T} _ {w s} = \\left[ \\begin{array}{c} \\log (\\hat {\\boldsymbol {q}} _ {w s} \\boldsymbol {q} _ {w s} ^ {- 1}) \\\\ \\hat {\\boldsymbol {t}} _ {w s} - \\boldsymbol {t} _ {w s} \\end{array} \\right] \\in \\mathbb {R} ^ {6} \\tag {31}\n$$\n", + "text_format": "latex", + "bbox": [ + 297, + 726, + 920, + 770 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Visual Sensor Model Abstracting from the specific camera parameters, such as its intrinsic and its distortion model, we introduce the mapping $\\pi(\\cdot)$ in Eq. (32) to infer individual projections of landmarks $l_w$ onto the image plane at time $t_m$ . For visual, pixel-based measurements, the metric $\\boxdot_{\\mu}$ is chosen to be equivalent to trivial Euclidean subtraction.", + "bbox": [ + 72, + 791, + 922, + 889 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\boldsymbol {m}} _ {s} \\left(t _ {m}, \\Theta_ {s}\\right) = \\hat {\\boldsymbol {p}} _ {s} \\left(t _ {m}\\right) = \\pi \\left(\\boldsymbol {T} _ {s b} \\hat {\\boldsymbol {T}} _ {b w} \\left(t _ {m}\\right), l _ {w}\\right) \\tag {32}\n$$\n", + "text_format": "latex", + "bbox": [ + 266, + 900, + 920, + 923 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\boldsymbol {p}} _ {s} \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {p} _ {s} = \\hat {\\boldsymbol {p}} _ {s} - \\boldsymbol {p} _ {s} \\in \\mathbb {R} ^ {2} \\tag {33}\n$$\n", + "text_format": "latex", + "bbox": [ + 360, + 926, + 920, + 949 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 840, + 34 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 900, + 16, + 917, + 30 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.5 System", + "text_level": 1, + "bbox": [ + 77, + 56, + 234, + 74 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Overview Our system is designed to efficiently support both batch and windowed optimizations, crucial for applications such as Bundle Adjustment (BA) and SLAM. Inspired by Ceres [1], it allows dynamic modification of nodes and factors between solver calls, features multiple solving strategies, namely synchronous and dropout, determining the order of node and factor updates and leverages multithreading to exploit the inherent parallelism of GBP methods, further boosting the overall performance. Optimizable parameters are added and removed in analogy to Ceres [1], with the notable distinction that GBP-based methods necessitate both an initial mean and covariance estimate for each parameter, unlike standard NLLS methods. This requirement, however, poses no practical hindrance as conservative guesses on the covariance suffice to bootstrap the algorithm.", + "bbox": [ + 72, + 86, + 922, + 320 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Symbolic Factors Targeting the long-standing challenge of obtaining efficient, analytical expressions and derivatives of spline-based motion parameterizations and their associated cost factors, here, we leverage SymForce [22], a symbolic code generation framework, to completely automate this cumbersome, time-intensive and error-prone process. Taking inspiration from Sommer et al. [40], who exploited Lie-group-specific properties to simplify spline-related mathematical expressions, we supercharge their recursive spline formulation by combining it with SymForce [22] to obtain ultra-efficient $\\mathrm{C}++$ cost factor implementations. Furthermore, recognizing the broader relevance of automated factor generation for (continuous-time) robotics applications, our framework offers a comprehensive library featuring spline-based and standard factors designed to seamlessly interoperate with both our framework and Ceres [1], facilitating widespread adoption.", + "bbox": [ + 72, + 347, + 922, + 582 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Update Strategies Amongst many possible update strategies, we focus our attention on synchronous and dropout updates. Synchronous updates closely follow traditional NLLS algorithms, where residuals are completely re-evaluated in every solver iteration and where (non-constant) nodes and factors are sequentially updated in an alternating fashion to ensure optimal convergence. In contrast to traditional approaches, GBP, however, also accommodates selective updates based on a dropout strategy. That is, one assigns probabilities, $d_{n}$ for nodes and $d_{f}$ for factors, dictating their likelihood of being updated in each iteration. Although this may slow convergence, it intentionally compensates for stability challenges in loopy graphs while mimicking real-world scenarios with imperfect communication channels and delayed messages.", + "bbox": [ + 72, + 608, + 922, + 822 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 77, + 850, + 314, + 871 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We evaluate the proposed system, coined Hyperion, empirically through simulations in MoCap (absolute) and localization settings, using a temporal interval of 0.1 seconds between adjacent spline bases along with the empirical step sizes", + "bbox": [ + 77, + 889, + 922, + 949 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 79, + 16, + 104, + 30 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 157, + 14, + 290, + 32 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "$\\alpha_{n_j} = \\alpha_{f_i} = 0.7$ across all cases. The simulated trajectories span 10 seconds and mimic real-world conditions with appropriate initial perturbations, sensor acquisition rates, and measurement noise levels. Our analysis focuses on benchmarking Hyperion against Ceres [1], an established, centralized NLLS solver, and providing in-depth ablation studies on different aspects of the framework itself.", + "bbox": [ + 77, + 53, + 922, + 154 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.1 Absolute Setup", + "text_level": 1, + "bbox": [ + 79, + 178, + 331, + 200 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We commence our analysis with the absolute sensor configuration, capturing measurements akin to the ones stemming from a MoCap system, where individual factors model direct observations of the underlying motion without auxiliary parameters/nodes. As such, they embody the most fundamental category of constraints, suggesting that derived factors, such as landmark projections or relative measurements, merely extend these elements, rendering them ideal candidates to analyze key properties of the proposed approach. In the following, we assume an acquisition rate of $40\\mathrm{Hz}$ matching the real-world specifications.", + "bbox": [ + 77, + 209, + 922, + 365 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Our initial examination centers on comparing the convergence behavior of Hyperion against Ceres [1] across varying levels of initial perturbations and measurement noise. To this end, both solvers are identically initialized to a modified ground truth motion, encompassing perturbations in rotations and translations. Furthermore, we make use of the synchronized vertex updates if not stated otherwise, aiming for a fair comparison against Ceres.", + "bbox": [ + 77, + 365, + 922, + 481 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The qualitative outcomes of this setup are illustrated in Fig. 1, demonstrating that both Hyperion and Ceres converge to identical solutions even under substantial initial perturbation and considerable measurement noise. These observations are quantified in Tabs. 1a and 1b, indicating that motion estimates obtained from Hyperion and Ceres closely align across all levels of perturbation and noise.", + "bbox": [ + 77, + 481, + 922, + 578 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Message dropouts, mimicking imperfect communication, have also been shown to enhance convergence [27, 31] in loopy graphs. Hence, we study their effect on the proposed GBP framework, summarizing key insights in Fig. 4a, revealing that Hyperion consistently converges toward identical solutions across various dropout ratios. Despite this, they also influence the required iteration count (i.e., updates of all vertices), with every $10\\%$ increase in dropouts entailing an additional 2-4 iterations until convergence is reached.", + "bbox": [ + 77, + 578, + 922, + 713 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Furthermore, we find that different motion parameterizations, specifically cubic Z- and B-Splines [4, 17], also influence the convergence of the proposed approach, which we summarize in Fig. 7b. A notable difference between the traditional and our proposed solver lies in how motion parameterizations affect the convergence speed of the latter. Our findings suggest that Z-Splines, which are interpolating rather than approximating splines, typically yield better-conditioned solutions since their bases must lie on the motion estimate itself, implicitly constraining the space of possible solutions. Naturally, the centralized NLLS solver sets a baseline for the required iteration count to resolve an optimization problem, serving as a comparative standard for our method. Thus, while GBP-based approaches are inherently distributed, Fig. 7b indicates that they impose between 2 to 4 additional iterations to achieve convergence.", + "bbox": [ + 77, + 713, + 922, + 947 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 837, + 34 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 891, + 16, + 915, + 30 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/73d7c3134a89c22a10c478e0129a341ad3738be5c03d293e318a634bb1715bfc.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Perturbation [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-65.2e-65.2e-65.9e-65.3e-6
t [m]5.8e-65.8e-65.9e-65.9e-66.0e-61.3e-5
Ceres
R [rad]5.2e-65.2e-65.2e-65.2e-65.2e-65.2e-6
t [m]5.9e-65.9e-65.9e-65.9e-65.9e-65.9e-6
", + "bbox": [ + 125, + 52, + 493, + 154 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/c573ee122a2aadf22117d7b8a9ef5898d143bc20565dd4681372765dcc66e7de.jpg", + "table_caption": [ + "(a) Perturbation Tolerance" + ], + "table_footnote": [], + "table_body": "
Noise [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-55.2e-45.2e-35.3e-25.6e-1
t [m]5.8e-65.9e-55.9e-45.9e-35.9e-25.9e-1
Ceres
R [rad]5.2e-65.2e-55.2e-45.2e-35.2e-25.5e-1
t [m]5.9e-65.9e-55.9e-45.9e-35.9e-25.9e-1
", + "bbox": [ + 503, + 52, + 869, + 154 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/d721a2fb4044be007aeeaf3ba2ca971c9e9779becda97843f055c6cc2507fda1.jpg", + "image_caption": [ + "(a) Convergence: Dropout", + "Fig. 4: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the absolute setup (batch). (b) Performance comparison between our symbolically, auto-generated and optimized B-Spline implementation and the recursively-defined, hand-crafted implementation used by Sommer et al. [40] on an M3 Max @4.05GHz." + ], + "image_footnote": [], + "bbox": [ + 116, + 312, + 418, + 479 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/6125068037a696973c69cb9f94fa835bc94492de186300eb78db8e4aeb9f696d.jpg", + "table_caption": [ + "(b) Noise Tolerance", + "Table 1: Root Mean Square Errors (RMSEs) in rotation (R) and translation (t) resulting from Ceres [1] and Hyperion under different perturbation levels (a), different noise levels (b) respectively. The solvers run to convergence or terminate after 50 iterations. The perturbation/noise setup assumes the lowest noise/perturbation, respectively." + ], + "table_footnote": [], + "table_body": "
SetupPose [s]Velocity [s]Acceleration [s]Avg. Speedup
Lkθ/DBOursBasaltOursBasaltOursBasalt
SO(3)4X1.64e-73.16e-79.49e-82.90e-71.12e-73.28e-72.64x
SO(3)4✓5.03e-76.70e-64.05e-77.82e-65.11e-79.46e-617.05x
SO(3)5X1.96e-74.14e-71.32e-73.67e-71.39e-73.96e-72.58x
SO(3)5✓6.89e-71.08e-55.82e-71.27e-57.87e-71.58e-519.19x
SO(3)6X2.17e-74.78e-71.82e-74.42e-71.81e-74.83e-72.43x
SO(3)6✓8.19e-71.57e-57.51e-71.87e-51.01e-62.43e-522.71x
SE(3)4X1.62e-77.03e-71.38e-77.46e-71.34e-76.88e-74.96x
SE(3)4✓5.71e-74.69e-59.11e-75.35e-51.12e-66.25e-565.56x
SE(3)5X1.96e-77.38e-71.91e-78.73e-71.70e-79.15e-74.57x
SE(3)5✓7.32e-79.64e-51.27e-69.44e-51.47e-61.14e-494.53x
SE(3)6X2.53e-79.11e-72.34e-71.12e-62.23e-71.12e-64.47x
SE(3)6✓9.29e-71.25e-41.54e-61.67e-41.99e-61.75e-4110.31x
", + "bbox": [ + 445, + 312, + 876, + 465 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "(b) B-Spline Evaluation Timings", + "bbox": [ + 518, + 484, + 803, + 499 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Lastly, we benchmark Hyperion's real-world performance using a handheld camera to track a ChArUco [14] board, capturing a 60-second trajectory at $30\\mathrm{Hz}$ with an iPhone 13 Pro. The analysis, detailed in Fig. 5, closely mirrors our previous analysis. However, we find that real-world motions, which innately expose a greater level of volatility than simulated ones, expose slower convergence.", + "bbox": [ + 72, + 626, + 920, + 725 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.2 Localization Setup", + "text_level": 1, + "bbox": [ + 75, + 756, + 370, + 775 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In this section, we analyze our approach in a localization setup, where we model an image acquisition rate of $20\\mathrm{Hz}$ and 50 randomized, observable landmarks at a range of 2 to $6\\mathrm{m}$ across the modeled motion, mimicking real-world conditions.", + "bbox": [ + 72, + 791, + 920, + 850 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Overall, the results from the localization setup are consistent with our earlier observations, as detailed in Figs. 6, 7a and 7c. However, Fig. 7a indicates that this setup is more agnostic to lower dropout ratios compared to the absolute case. Furthermore, the disparity between different motion parameterizations becomes more pronounced over the previous setup as may be observed from", + "bbox": [ + 72, + 852, + 920, + 949 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 79, + 16, + 104, + 30 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 157, + 14, + 290, + 32 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/a12eeec4d4bea3511a9cd2974a5777c37cfb27f1a5aed945f4c1f15edd198998.jpg", + "image_caption": [ + "(a) Estimate" + ], + "image_footnote": [], + "bbox": [ + 89, + 52, + 317, + 200 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/24bb5aceb8b4fd3ed6e76e7a2310c62524ee55a417e094a4d684549150b84ea8.jpg", + "image_caption": [ + "(b) Convergence" + ], + "image_footnote": [], + "bbox": [ + 334, + 50, + 602, + 196 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/914907b04b779d082fa880ffe442cbe4d9b93cd1f327151a5f1ab3d8c3a2bae6.jpg", + "image_caption": [ + "(c) Relative Error" + ], + "image_footnote": [], + "bbox": [ + 619, + 50, + 922, + 196 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/8ede53e11f3d663aa303360b624c843307cf5cc48762cb3048e4b5c23a5c4028.jpg", + "image_caption": [ + "(a) At initialization", + "Fig.6: The motion estimates for Hyperion and a conventional NLLS solver [1] in magenta and white, respectively, converge to similar solutions close to ground truth (in green) in the localization setup, demonstrating robust convergence under poor pose $(\\pm 0.20\\mathrm{m / rad})$ and landmark initialization $(\\pm 0.20\\mathrm{m})$ with $\\pm 1$ px measurement noise." + ], + "image_footnote": [], + "bbox": [ + 125, + 302, + 355, + 448 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5c2502a24ea4738fd7fe5614b84a9ba262de416a56a58e4d78e3d67674354f7a.jpg", + "image_caption": [ + "(b) After the $1^{\\mathrm{st}}$ iteration" + ], + "image_footnote": [], + "bbox": [ + 363, + 302, + 590, + 448 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/03b853d16560c58c906d18decdc5caf2ab6072cff84a5090b676887b38182a0f.jpg", + "image_caption": [ + "Fig.5: ChArUco [14] setup with overlapping motion estimates (a) from Hyperion and Ceres [1] in magenta and white, respectively. Illustration of the corresponding convergence (b) and the relative errors between the two converged estimates (c).", + "(c) Absolute Error" + ], + "image_footnote": [], + "bbox": [ + 602, + 300, + 874, + 447 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Fig. 7c. In general, visual setups also display higher volatility over absolute ones, with notable differences in estimates, especially towards the head and tails of the optimized splines. In a similar vein, we found that these numerical instabilities tend to have a destabilizing effect in loop graphs, posing considerable challenges to deploying the proposed system as a comprehensive SLAM system at present.", + "bbox": [ + 72, + 591, + 920, + 692 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.3 Performance Analysis", + "text_level": 1, + "bbox": [ + 75, + 720, + 409, + 739 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "As highlighted in Sec. 3.5, our framework leverages SymForce [22] to automate the generation of analytic cost factors, aiming to outperform hand-crafted implementations while mitigating development effort and programmatic errors. Thus, we test our auto-generated B-Spline implementation against Sommer et al.'s optimized, hand-crafted version [40]. The comparison, detailed in Fig. 4b, assesses the timings of pose, velocity, and acceleration evaluations for B-Splines of order $k$ , within a Lie group $\\mathcal{L}$ , potentially including the Jacobians $\\partial/\\partial\\mathcal{B}$ with respect to the bases $\\mathcal{B}_i$ . Figure 4b shows that our automated spline implementations significantly outperform the manual ones from [40], with speedups ranging from 2.43x to 110.31x. The performance gains are particularly notable in derivative", + "bbox": [ + 72, + 754, + 920, + 949 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 840, + 34 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 891, + 16, + 917, + 30 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/1c359f089678e5e44ed331c46212b5ffed9817e7b92ce5892cb8d57790b6683b.jpg", + "image_caption": [ + "(a) Convergence: Dropout" + ], + "image_footnote": [], + "bbox": [ + 89, + 50, + 358, + 196 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/bcc7f82f8e68083a9f2298505f3d035ad06283af08f33c310920409213918855.jpg", + "image_caption": [ + "(b) Convergence: Absolute", + "Fig. 7: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the localization setup. Convergence comparison of different splines and solver variants in the absolute setups (b) and the localization setup (c), respectively." + ], + "image_footnote": [], + "bbox": [ + 377, + 50, + 641, + 196 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/8147a5faf7d7982ada9723b0e206f77e586a2d7c00de6eed3c2462cdc8771c0c.jpg", + "image_caption": [ + "(c) Convergence: Localization" + ], + "image_footnote": [], + "bbox": [ + 663, + 50, + 924, + 196 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "evaluations, where [40] employs automatic differentiation to compute the Jacobians. Considering the long-standing computational challenges of CTSLAM methods, our automated approach not only reduces complexity but also narrows the performance divide with discrete-time SLAM.", + "bbox": [ + 72, + 323, + 920, + 401 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We further analyze the single-core performance of the proposed GBP solver with Ceres [1], a conventional NLLS solver, within the previously discussed scenarios. For the absolute setup (400 pose measurements), Ceres averages 0.70 ms per iteration, whereas our method averages 4.18 ms to update all graph vertices (i.e. about 6x slower). In the localization scenario (10,000 landmark reprojections), Ceres requires 15 ms per iteration, compared to our solver's 112 ms per iteration (i.e. 7.5x slower). This performance gap is, however, largely mitigated by considering that Ceres excludes the (implicit) estimation of covariances, significantly reducing computational load, and that it has been extensively refined by numerous contributors over the years. Moreover, the intrinsic distributedness and parallelizability of GBP along with potential enhancements from adaptive vertex updates, leveraging covariance estimates to trigger selective updates, are promising avenues for further performance improvements. The above analysis suggests that, even in its present state, the proposed framework is capable of real-time execution for moderately sized problems.", + "bbox": [ + 72, + 403, + 920, + 695 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusions", + "text_level": 1, + "bbox": [ + 75, + 728, + 302, + 749 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we present a fast, versatile GBP framework that targets distributed, continuous-time SLAM applications and leverages message-passing algorithms to achieve probabilistic inference. We demonstrate the efficacy and competitiveness of our method against a conventional NLLS solver [1] achieving similar convergence and performance properties in practical settings. We further provide a comprehensive library of high-performance implementations for continuous-time SLAM, comprising motion parameterizations as well as common factors. Based on our experiments, the proposed framework shows great promise in paving the way towards resilient, distributed, continuous-time SLAM solutions.", + "bbox": [ + 72, + 773, + 920, + 947 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 79, + 16, + 104, + 30 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 157, + 14, + 290, + 32 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgments", + "text_level": 1, + "bbox": [ + 77, + 53, + 336, + 76 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was partially funded by the European Research Council (ERC) Consolidator Grant project SkEyes (Grant agreement No. 101089328).", + "bbox": [ + 72, + 95, + 922, + 136 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 77, + 167, + 237, + 188 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Agarwal, S., Mierle, K.: Ceres Solver, https://github.com/ceres-solver/ceres-solver, (2023, November 28)", + "2. Anderson, S., Dellaert, F., Barfoot, T.D.: A Hierarchical Wavelet Decomposition for Continuous-Time SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 373-380 (2014)", + "3. Bänninger, P., Alzugaray, I., Karrer, M., Chli, M.: Cross-agent Relocalization for Decentralized Collaborative SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5551-5557 (2023)", + "4. Becerra-Sagredo, J.T.: Z-Splines: Moment-conserving Cardinal Spline Interpolation of Compact Support for Arbitrarily Spaced Data. Sem. Appl. Math. (2003)", + "5. Bloesch, M., Burri, M., Omari, S., Hutter, M., Siegwart, R.: Iterated Extended Kalman Filter-based Visual-Inertial Odometry using Direct Photometric Feedback. Int. J. Rob. Reas. 36(10), 1053-1072 (2017)", + "6. Bloesch, M., Omari, S., Hutter, M., Siegwart, R.: Robust Visual-Inertial Odometry using a Direct EKF-based Approach. In: IEEE Int. Conf. Int. Rob. Sys. pp. 298-304 (2015)", + "7. Campos, C., Elvira, R., Rodríguez, J.J.G., Montiel, J.M., Tardós, J.D.: ORBSLAM3: An Accurate Open-Source Library for Visual, Visual-Inertial and Multi-Map SLAM. IEEE Trans. Rob. 37(6), 1874-1890 (2021)", + "8. Davison, A.J., Ortiz, J.: FutureMapping 2: Gaussian Belief Propagation for Spatial AI. ArXiv (2019)", + "9. Droeschel, D., Behnke, S.: Efficient Continuous-Time SLAM for 3D Lidar-based Online Mapping. In: IEEE Int. Conf. Rob. Aut. pp. 1-9 (05 2018)", + "10. Engel, J., Schöps, T., Cremers, D.: LSD-SLAM: Large-scale Direct Monocular SLAM. In: Eur. Conf. Comput. Vis. pp. 834-849 (2014)", + "11. Forster, C., Zhang, Z., Gassner, M., Werlberger, M., Scaramuzza, D.: SVO: Semidirect Visual Odometry for Monocular and Multicamera Systems. IEEE Trans. Rob. 33(2), 249-265 (2017)", + "12. Furgale, P., D. Barfoot, T., Sibley, G.: Continuous-Time Batch Estimation using Temporal Basis Functions. Rob. Sc. Sys. 34, 2088-2095 (05 2012)", + "13. Furgale, P., Rehder, J., Siegwart, R.: Unified Temporal and Spatial Calibration for Multi-sensor Systems. In: IEEE Int. Conf. Int. Rob. Sys. pp. 1280-1286 (2013)", + "14. Garrido-Jurado, S., Muñoz-Salinas, R., Madrid-Cuevas, F.J., Marín-Jiménez, M.J.: Automatic Generation and Detection of Highly Reliable Fiducial Markers under Occlusion. Pattern Recognition 47(6), 2280-2292 (2014)", + "15. Hug, D., Bänninger, P., Alzugaray, I., Chli, M.: Continuous-Time Stereo-Inertial Odometry. IEEE Rob. Aut. Letters 7(3), 6455-6462 (2022)", + "16. Hug, D., Chli, M.: HyperSLAM: A Generic and Modular Approach to Sensor Fusion and Simultaneous Localization and Mapping in Continuous-Time. In: Int. Conf. 3D Vis. pp. 978-986 (2020)", + "17. Kaihuai Qin: General Matrix Representations for B-splines. In: Pac. Conf. Comput. Graph. Appl. pp. 37-43 (10 1998)" + ], + "bbox": [ + 79, + 209, + 920, + 947 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 840, + 34 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 891, + 16, + 917, + 30 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Karrer, M., Chli, M.: Distributed Variable-baseline Stereo SLAM from two UAVs. In: IEEE Int. Conf. Rob. Aut. pp. 82-88 (2021)", + "19. Leutenegger, S., Lynen, S., Bosse, M., Siegwart, R., Furgale, P.: Keyframe-based Visual-inertial Odometry using Nonlinear Optimization. Int. J. Rob. Reas. 34, 314 - 334 (2015)", + "20. Lovegrove, S., Patron-Perez, A., Sibley, G.: Spline Fusion: A continuous-Time Representation for Visual-Inertial Fusion with Application to Rolling Shutter Cameras. In: Brit. Mach. Vis. Conf. vol. 2, p. 8 (2013)", + "21. Lynen, S., Achtelik, M.W., Weiss, S., Chli, M., Siegwart, R.: A Robust and Modular Multi-sensor Fusion Approach Applied to MAV Navigation. In: IEEE Int. Conf. Int. Rob. Sys. pp. 3923-3929 (2013)", + "22. Martiros, H., Miller, A., Bucki, N., Solliday, B., Kennedy, R., Zhu, J., Dang, T., Pattison, D., Zheng, H., Tomic, T., Henry, P., Cross, G., VanderMey, J., Sun, A., Wang, S., Holtz, K.: SymForce: Symbolic Computation and Code Generation for Robotics. In: Rob. Sc. Sys. (2022)", + "23. Mascaro, R., Teixeira, L., Hinzmann, T., Siegwart, R., Chli, M.: GOMSF: Graph-Optimization Based Multi-Sensor Fusion for robust UAV Pose Estimation. In: IEEE Int. Conf. Rob. Aut. pp. 1421-1428 (2018)", + "24. Milford, M.J., Wyeth, G.F.: SeqSLAM: Visual Route-based Navigation for Sunny Summer Days and Stormy Winter Nights. In: IEEE Int. Conf. Rob. Aut. pp. 1643-1649 (2012)", + "25. Mueggler, E., Gallego, G., Rebecq, H., Scaramuzza, D.: Continuous-Time Visual-Inertial Odometry for Event Cameras. IEEE Trans. Rob. 34(6), 1425-1440 (2018)", + "26. Mur-Artal, R., Montiel, J., Tardós, J.D.: ORB-SLAM: A Versatile and Accurate Monocular SLAM System. IEEE Trans. Rob. 31, 1147-1163 (2015)", + "27. Murai, R., Alzugaray, I., Kelly, P.H., Davison, A.J.: Distributed Simultaneous Localisation and Auto-Calibration Using Gaussian Belief Propagation. IEEE Rob. Aut. Letters (2024)", + "28. Murai, R., Ortiz, J., Saeedi, S., Kelly, P.H., Davison, A.J.: A Robot Web for Distributed Many-Device Localisation. IEEE Trans. Rob. (2023)", + "29. Olson, E.: AprilTag: A Robust and Flexible Visual Fiducial System. In: IEEE Int. Conf. Rob. Aut. pp. 3400-3407 (2011)", + "30. Ortiz, J., Evans, T., Davison, A.J.: A Visual Introduction to Gaussian Belief Propagation. ArXiv (2021)", + "31. Ortiz, J., Evans, T., Sucar, E., Davison, A.J.: Incremental Abstraction in Distributed Probabilistic SLAM Graphs. In: IEEE Int. Conf. Rob. Aut. pp. 7566-7572 (2022)", + "32. Ortiz, J., Pupilli, M., Leutenegger, S., Davison, A.J.: Bundle Adjustment on a Graph Processor. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 2416-2425 (2020)", + "33. Oth, L., Furgale, P., Kneip, L., Siegwart, R.: Rolling Shutter Camera Calibration. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 1360-1367 (2013)", + "34. Peng, Z., Xu, Y., Yan, M., Yin, W.: ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates. J. Sc. Comput. 38(5), A2851-A2879 (2016)", + "35. Qin, T., Cao, S., Pan, J., Shen, S.: A General Optimization-based Framework for Global Pose Estimation with Multiple Sensors. ArXiv (2019)", + "36. Qin, T., Li, P., Shen, S.: VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimator. IEEE Trans. Rob. 34(4), 1004-1020 (2018)", + "37. Qin, T., Pan, J., Cao, S., Shen, S.: A General Optimization-based Framework for Local Odometry Estimation with Multiple Sensors. ArXiv (2019)" + ], + "bbox": [ + 75, + 56, + 922, + 947 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 79, + 16, + 104, + 30 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "D. Hug et al.", + "bbox": [ + 157, + 14, + 290, + 32 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "38. Schmuck, P., Chli, M.: CCM-SLAM: Robust and Efficient Centralized Collaborative Monocular Simultaneous Localization and Mapping for Robotic Teams. J. Fld. Rob. 36(4), 763-781 (2019)", + "39. Schubert, D., Demmel, N., Usenko, V., Stuckler, J., Cremers, D.: Direct Sparse Odometry With Rolling Shutter. In: Eur. Conf. Comput. Vis. pp. 682-697 (2018)", + "40. Sommer, C., Usenko, V., Schubert, D., Demmel, N., Cremers, D.: Efficient Derivative Computation for Cumulative B-Splines on Lie Groups. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11145-11153 (2020)", + "41. Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle Adjustment - A Modern Synthesis. In: Vision Algorithms: Theory and Practice. pp. 298-372 (2000)", + "42. Usenko, V., Demmel, N., Schubert, D., Stuckler, J., Cremers, D.: Visual-Inertial Mapping With Non-linear Factor Recovery. IEEE Rob. Aut. Letters 5(2), 422-429 (2019)", + "43. Wang, R., Schworer, M., Cremers, D.: Stereo DSO: Large-scale Direct Sparse Visual Odometry with Stereo Cameras. In: Int. Conf. Comput. Vis. pp. 3903-3911 (2017)", + "44. Wang, S., Clark, R., Wen, H., Trigoni, N.: DeepVO: Towards end-to-end Visual Odometry with Deep Recurrent Convolutional Neural Networks. In: IEEE Int. Conf. Rob. Aut. pp. 2043-2050 (2017)", + "45. Wang, X., Xue, F., Yan, Z., Dong, W., Wang, Q., Zha, H.: Continuous-Time Stereo Visual Odometry Based on Dynamics Model. In: Asian Conf. Comput. Vis. pp. 388-403 (2018)", + "46. Yang, A.J., Cui, C., Bardsan, I.A., Urtasun, R., Wang, S.: Asynchronous Multi-view SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5669-5676 (2021)" + ], + "bbox": [ + 75, + 56, + 920, + 484 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Hyperion - A fast, versatile continuous-time GBP framework", + "bbox": [ + 234, + 14, + 840, + 30 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 891, + 17, + 917, + 30 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git "a/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_model.json" "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_model.json" new file mode 100644 index 0000000000000000000000000000000000000000..23f4f9b8eab5190f9b9cb0b09b5cd0f5a31342c1 --- /dev/null +++ "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_model.json" @@ -0,0 +1,2731 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.105, + 0.049, + 0.893, + 0.132 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM" + }, + { + "type": "text", + "bbox": [ + 0.18, + 0.17, + 0.818, + 0.19 + ], + "angle": 0, + "content": "David Hug1, Ignacio Alzugaray2, and Margarita Chli1,3" + }, + { + "type": "text", + "bbox": [ + 0.129, + 0.205, + 0.868, + 0.259 + ], + "angle": 0, + "content": "\\(^{1}\\) Vision for Robotics Lab, ETH Zürich, Zürich, Switzerland \n\\(^{2}\\) Dyson Robotics Lab, Imperial College London, London, United Kingdom \n\\(^{3}\\) Vision for Robotics Lab, University of Cyprus, Nicosia, Cyprus" + }, + { + "type": "text", + "bbox": [ + 0.147, + 0.304, + 0.851, + 0.571 + ], + "angle": 0, + "content": "Abstract. Continuous-Time Simultaneous Localization And Mapping (CTSLAM) has become a promising approach for fusing asynchronous and multi-modal sensor suites. Unlike discrete-time SLAM, which estimates poses discretely, CTSLAM uses continuous-time motion parametrizations, facilitating the integration of a variety of sensors such as rolling-shutter cameras, event cameras and Inertial Measurement Units (IMUs). However, CTSLAM approaches remain computationally demanding and are conventionally posed as centralized Non-Linear Least Squares (NLLS) optimizations. Targeting these limitations, we not only present the fastest SymForce-based [22] B- and Z-Spline implementations achieving speedups between \\(2.43\\mathrm{x}\\) and \\(110.31\\mathrm{x}\\) over Sommer et al. [40] but also implement a novel continuous-time Gaussian Belief Propagation (GBP) framework, coined Hyperion, which targets decentralized probabilistic inference across agents. We demonstrate the efficacy of our method in motion tracking and localization settings, complemented by empirical ablation studies." + }, + { + "type": "text", + "bbox": [ + 0.148, + 0.573, + 0.672, + 0.59 + ], + "angle": 0, + "content": "Code: https://github.com/VIS4ROB-lab/hyperion" + }, + { + "type": "text", + "bbox": [ + 0.148, + 0.607, + 0.851, + 0.643 + ], + "angle": 0, + "content": "Keywords: Gaussian Belief Propagation \\(\\cdot\\) Continuous-Time SLAM \\(\\cdot\\) Distributed Non-Linear Least Squares Optimization \\(\\cdot\\) B- and Z-Splines" + }, + { + "type": "title", + "bbox": [ + 0.083, + 0.676, + 0.309, + 0.696 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.081, + 0.715, + 0.922, + 0.908 + ], + "angle": 0, + "content": "Estimating a sensor-suite's ego-motion and workspace employing Simultaneous Localization And Mapping (SLAM) techniques, has long been studied using a wide variety of sensing modalities, such as vision sensors [35,39,43,46], IMUs [7,18,36], Global Positioning System (GPS) feeds [21, 23], and laser ranging [9] sensors. Unlike traditional, discrete-time approaches, which require careful synchronization of sensory measurements due to the discretization of motion-parametrizing states, Continuous-Time Simultaneous Localization And Mapping (CTSLAM) [9,12,13, 15,33] offers native support for the fusion of asynchronous measurements due to its continuous-time parametrization that yields pose, velocity and acceleration estimates at arbitrary instances in time." + }, + { + "type": "text", + "bbox": [ + 0.083, + 0.911, + 0.92, + 0.947 + ], + "angle": 0, + "content": "Despite their advantages, CTSLAM approaches often entail higher computational complexity than conventional approaches, which somewhat hinders their" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.079, + 0.018, + 0.095, + 0.03 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.16, + 0.016, + 0.29, + 0.032 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "image", + "bbox": [ + 0.116, + 0.053, + 0.351, + 0.213 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.143, + 0.215, + 0.314, + 0.229 + ], + "angle": 0, + "content": "(a) At initialization" + }, + { + "type": "image", + "bbox": [ + 0.361, + 0.053, + 0.596, + 0.213 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.361, + 0.215, + 0.585, + 0.23 + ], + "angle": 0, + "content": "(b) After the \\(1^{\\mathrm{st}}\\) iteration" + }, + { + "type": "image", + "bbox": [ + 0.607, + 0.053, + 0.885, + 0.212 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.662, + 0.215, + 0.825, + 0.229 + ], + "angle": 0, + "content": "(c) Absolute Error" + }, + { + "type": "image_caption", + "bbox": [ + 0.075, + 0.245, + 0.923, + 0.318 + ], + "angle": 0, + "content": "Fig. 1: Both the proposed continuous-time GBP solver (in magenta) and the conventional NLLS solver [1] (in white) converge to identical solutions close to the ground truth (in green) even under poor initialization (\\(\\pm 1.00 \\, \\mathrm{m / rad}\\)) and substantial pose measurement noise (\\(\\pm 0.05 \\, \\mathrm{m / rad}\\))." + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.355, + 0.923, + 0.433 + ], + "angle": 0, + "content": "deployment in real-world scenarios. In addition, most (discrete- and continuous-time) SLAM systems pose the underlying optimization as a centralized Non-Linear Least Squares (NLLS) problem, which, without further modifications, strictly limits their applicability to single-agent setups." + }, + { + "type": "text", + "bbox": [ + 0.076, + 0.434, + 0.923, + 0.685 + ], + "angle": 0, + "content": "Thus, novel, decentralized algorithms along with more effective continuous-time motion parametrizations are paramount in the quest to overcome existing challenges in traditional, centralized CTSLAM techniques. Distributed methods such as GBP are especially promising given that they, in contrast to conventional NLLS paradigms, achieve iterative, probabilistic inference through message-passing between individual nodes and factors in a factor graph and that they operate in a distributed and asynchronous manner by nature rendering them inherently scalable, even across multiple agents. In addition, GBP also explicitly models the uncertainties of estimizable quantities, which can be leveraged to selectively direct computational resources to non-converged nodes in the graph. This circumstance is especially promising in the context of CTSLAM where effective allocation of computational resources towards the least certain estimates promises to further reduce their computational complexity." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.686, + 0.924, + 0.862 + ], + "angle": 0, + "content": "This work, in particular, pushes the performance envelope of B- and Z-Splines and devises an innovative, distributed optimization strategy for CTSLAM using GBP. Whilst the need for faster continuous-time parametrizations is self-evident, we also specifically target the absence of a distributed, continuous-time state estimation framework. Such a framework, not only promises flexible resource allocation and decentralized state estimation but also allows fusing asynchronous measurements. Here, we showcase the practicality of the proposed continuous-time GBP framework and provide it as an open-source implementation to encourage benchmarking. In addition to these contributions, this work also" + }, + { + "type": "text", + "bbox": [ + 0.093, + 0.872, + 0.897, + 0.891 + ], + "angle": 0, + "content": "- offers the fastest, fully analytic B- and Z-Spline implementations to date," + }, + { + "type": "text", + "bbox": [ + 0.093, + 0.892, + 0.923, + 0.91 + ], + "angle": 0, + "content": "- presents a novel, symbolic GBP-based framework for continuous-time SLAM," + }, + { + "type": "text", + "bbox": [ + 0.093, + 0.911, + 0.921, + 0.93 + ], + "angle": 0, + "content": "- demonstrates the suitability of the proposed method in practical setups, and" + }, + { + "type": "text", + "bbox": [ + 0.093, + 0.93, + 0.724, + 0.949 + ], + "angle": 0, + "content": "- provides detailed ablation studies on the algorithm itself." + }, + { + "type": "list", + "bbox": [ + 0.093, + 0.872, + 0.923, + 0.949 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.015, + 0.84, + 0.035 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.903, + 0.017, + 0.92, + 0.032 + ], + "angle": 0, + "content": "3" + }, + { + "type": "title", + "bbox": [ + 0.079, + 0.054, + 0.331, + 0.075 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.093, + 0.92, + 0.228 + ], + "angle": 0, + "content": "The SLAM problem has long been researched as it comprises the core of robotic perception, with seminal works focusing on discrete-time, monocular [26, 36] and stereo setups [35, 37], as well as works which propose fusion of additional sensing information, such as inertial [5-7, 19], and laser ranging [9]. In addition to these feature-based approaches to SLAM, alternative powerful paradigms have been proposed, such as direct methods [10, 11] and machine-learning based techniques [24, 44] have been demonstrated to be beneficial in some scenarios." + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.23, + 0.92, + 0.442 + ], + "angle": 0, + "content": "In contrast to traditional, discrete-time SLAM methods that have been widely adopted, CTSLAM techniques have early on been demonstrated to exhibit great potential for high-fidelity and continuous estimates of motion [2, 12, 13, 15, 20, 25, 42, 45], albeit posing fundamental scientific and algorithmic challenges. The key advantage of these methods lies in their inherent capability to fuse unsynchronized and asynchronous measurements (e.g. from a rolling shutter camera or an event-based vision sensor) in the estimation processes, in contrast to conventional approaches. However, the wider adoption of CTSLAM techniques remains impeded by challenges in finding more efficient motion representations, addressing convergence issues as well as overcoming computational limitations, missing out on the promise for high-fidelity motion and scene estimation." + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.444, + 0.92, + 0.675 + ], + "angle": 0, + "content": "Following promising leads in fundamental SLAM research for single agents, a novel challenge and desire to deploy the same techniques in collaborative, multi-agent setups arose. Works such as [38] proposed means to address centralized multi-agent SLAM, while [18] investigated the advantages of variable-stereo baseline setups, which leverage the views from two agents to boost the accuracy of high-altitude depth estimates. A common approach to solve NLLS optimizations in a distributed fashion is based on Alternating Direction Method of Multipliers (ADMM) approaches similar to the work in [34] and [3], which leverage the use of dual residuals to ensure consistent estimates across distributed multi-agent NLLS optimizations. Orthogonally, GBP approaches [8, 28, 30, 32] can perform distributed and asynchronous inference of states via an equivalent message-passing scheme, making them ideal candidates to address multi-agent SLAM." + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.677, + 0.92, + 0.734 + ], + "angle": 0, + "content": "In this work, we build upon these ideas, consolidate a distributed GBP optimization with a continuous-time parametrization, and demonstrate the suitability of the novel, combined method in practical setups." + }, + { + "type": "title", + "bbox": [ + 0.079, + 0.763, + 0.316, + 0.785 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "title", + "bbox": [ + 0.079, + 0.802, + 0.306, + 0.82 + ], + "angle": 0, + "content": "3.1 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.832, + 0.92, + 0.948 + ], + "angle": 0, + "content": "All Simultaneous Localization And Mapping (SLAM) algorithms, in essence, aim to estimate an optimal, cost-minimizing set of estimizable parameters \\(\\Theta\\) which are set to describe a collection of noisy sensory measurements \\(m\\) with the highest possible accuracy. Specifically, in its NLLS formulation, this optimal solution is found by minimization of the cumulative cost over a set of weighted residuals \\(\\bar{r}\\) associated with measurements \\(m\\) stemming from a connected sensor" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.079, + 0.017, + 0.097, + 0.03 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.159, + 0.016, + 0.291, + 0.033 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "image", + "bbox": [ + 0.244, + 0.051, + 0.756, + 0.209 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.075, + 0.219, + 0.923, + 0.275 + ], + "angle": 0, + "content": "Fig. 2: For every (valid) instance in time \\( t \\), a collection of adjacent bases (in orange) gives rise to an individual segment (in green) of a cubic B-Spline. An interpolated pose at query time \\( t \\) is then obtained from the (cumulative) blending of these bases." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.315, + 0.923, + 0.395 + ], + "angle": 0, + "content": "\\(s\\). A weighted residuals \\(\\bar{\\pmb{r}}\\) at measurement time \\(t\\) is computed by comparing a predicted measurement \\(\\hat{\\pmb{m}}(t, \\pmb{\\theta}_s)\\) with sensor-associated parameters \\(\\pmb{\\theta}_s \\subseteq \\pmb{\\Theta}\\) to a measured one \\(\\pmb{m}(t)\\) through the application of a metric \\(\\pmb{\\mu}\\) (i.e. \\(\\hat{x} \\boxminus_{\\pmb{\\mu}} x\\)) and a subsequent weighting via the square-root information \\(\\Omega_m\\) according to" + }, + { + "type": "equation", + "bbox": [ + 0.324, + 0.41, + 0.921, + 0.431 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {r} (t, \\boldsymbol {\\theta} _ {s}) = \\hat {\\boldsymbol {m}} (t, \\boldsymbol {\\theta} _ {s}) \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {m} (t) \\text {a n d} \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.233, + 0.435, + 0.921, + 0.46 + ], + "angle": 0, + "content": "\\[\n\\left\\| \\bar {\\boldsymbol {r}} \\right\\| ^ {2} = \\bar {\\boldsymbol {r}} ^ {\\top} \\bar {\\boldsymbol {r}} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Omega} _ {m} ^ {\\top} \\boldsymbol {\\Omega} _ {m} \\boldsymbol {r} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Lambda} _ {m} \\boldsymbol {r} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Sigma} _ {m} ^ {- 1} \\boldsymbol {r}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.476, + 0.924, + 0.575 + ], + "angle": 0, + "content": "where \\(\\pmb{\\Sigma}_{m}\\) and \\(\\pmb{\\Lambda}_{m}\\) are the covariance and precision matrix, respectively. Ultimately, we aim to minimize the sum over residuals stemming from all connected sensors \\(S\\) and their associated measurements \\(\\mathcal{M}_s\\) with measurement times \\(\\mathcal{T}_s\\). To this end, established NLLS solvers [1] are commonly deployed in practice, which aim to obtain the optimal, cost-minimizing parameters \\(\\Theta^{*}\\) as defined below." + }, + { + "type": "equation", + "bbox": [ + 0.286, + 0.588, + 0.922, + 0.653 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\Theta} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\left[ \\sum_ {s \\in \\mathcal {S}} \\sum_ {t \\in \\mathcal {T} _ {s}} \\frac {1}{2} \\| \\bar {\\boldsymbol {r}} (t, \\boldsymbol {\\theta} _ {s}) \\| ^ {2} \\right]. \\tag {3}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.076, + 0.683, + 0.453, + 0.701 + ], + "angle": 0, + "content": "3.2 Continuous-Time Motion" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.72, + 0.925, + 0.898 + ], + "angle": 0, + "content": "In recent times, continuous-time formulations of conventional SLAM algorithms have been studied by multiple authors [12, 13, 15, 16, 20, 40], where the most common motion parametrization is based on the concept of cubic B-Splines. This practice is rooted in several favorable properties of B-Splines, such as their compact representation, finite support, analytic Jacobians, and their \\(\\mathcal{C}_2\\)-continuity for predicting instantaneous velocities and accelerations. In this work, we utilize split interpolations for world-to-body transformations \\(T_{wb}(t) \\in \\mathbb{S}\\mathbb{E}(3)\\), illustrated in Fig. 2, that separately parametrize rotations \\(R_{wb}(t) \\in \\mathbb{S}\\mathbb{O}(3)\\) and translations \\(t_{wb}(t) \\in \\mathbb{R}^3\\). In particular, we compute transformations \\(T_{wb}(t)\\) using" + }, + { + "type": "equation", + "bbox": [ + 0.249, + 0.911, + 0.922, + 0.955 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {T} _ {w b} (t) = \\left[ \\begin{array}{c c} \\boldsymbol {R} _ {w b} (\\boldsymbol {q} _ {w b} (t)) & \\boldsymbol {t} _ {w b} (t) \\\\ \\boldsymbol {0} & 1 \\end{array} \\right] \\in \\mathbb {S E} (3) \\text {w i t h} \\tag {4}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.236, + 0.015, + 0.842, + 0.034 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.903, + 0.017, + 0.92, + 0.031 + ], + "angle": 0, + "content": "5" + }, + { + "type": "equation", + "bbox": [ + 0.26, + 0.072, + 0.922, + 0.127 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {q} _ {w b} (t) = \\boldsymbol {q} _ {w i} * \\prod_ {j = 1} ^ {k} \\left(\\boldsymbol {q} _ {w (i + j - 1)} ^ {- 1} * \\boldsymbol {q} _ {w (i + j)}\\right) ^ {\\lambda_ {j} (t)} \\tag {5}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.241, + 0.135, + 0.921, + 0.19 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {t} _ {w b} (t) = \\boldsymbol {t} _ {w i} + \\sum_ {j = 1} ^ {k} \\left[ \\lambda_ {j} (t) \\left(\\boldsymbol {t} _ {w (i + j)} - \\boldsymbol {t} _ {w (i + j - 1)}\\right) \\right], \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.196, + 0.947, + 0.296 + ], + "angle": 0, + "content": "where individual evaluations of \\( T_{wb}(t) \\) depend on a collection of bases \\( \\{\\mathcal{B}_i, \\dots, \\mathcal{B}_{i+k}\\} \\) (see Fig. 2) and each basis \\( \\mathcal{B}_i \\) comprises a time \\( t_i \\), a quaternion \\( q_{wi} \\) and a translation \\( t_{wi} \\). Above, \\( k \\) is the Degree of Freedom (DoF) of the B-/Z-Spline, rotations \\( R_{wb}(t) \\) are parametrized by quaternions \\( q_{wb}(t) \\) and the expression \\( \\lambda_j(t) \\) serves as a placeholder for concrete interpolation coefficients found in [4, 15, 17, 20]." + }, + { + "type": "title", + "bbox": [ + 0.076, + 0.32, + 0.526, + 0.34 + ], + "angle": 0, + "content": "3.3 Continuous-Time Optimization" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.35, + 0.923, + 0.449 + ], + "angle": 0, + "content": "In its probabilistic formulation [30, 32], the non-linear minimization problem from Eq. (3) is equivalent to finding an optimal probability distribution that accounts for all acquired measurements. Without loss of generality, one can also represent the problem as a product of factors \\( f_{i} \\propto e^{-E_{i}(\\pmb{\\theta}_{i})} \\) with induced energies \\( E_{i}(\\pmb{\\theta}_{i}) \\), arriving at the modified expression to obtain the optimal parameters \\( \\pmb{\\Theta}^{*} \\)." + }, + { + "type": "equation", + "bbox": [ + 0.216, + 0.459, + 0.921, + 0.498 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\Theta} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m a x}} \\log (p (\\boldsymbol {\\Theta})) = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\sum_ {i} E _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\text {w i t h} \\tag {7}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.296, + 0.503, + 0.921, + 0.543 + ], + "angle": 0, + "content": "\\[\np (\\boldsymbol {\\Theta}) = \\prod_ {i} f _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\propto \\prod_ {i} e ^ {- E _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right)}. \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.555, + 0.92, + 0.596 + ], + "angle": 0, + "content": "In this work, we use multi-variant Gaussians \\(\\mathcal{N}(\\pmb{\\mu}_i, \\pmb{\\Sigma}_i)\\) to model the factors \\(f_i\\) in Eq. (8), linking the energies in Eq. (7) to the residuals in Eq. (2) according to" + }, + { + "type": "equation", + "bbox": [ + 0.256, + 0.624, + 0.921, + 0.648 + ], + "angle": 0, + "content": "\\[\nE _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) = \\left\\| \\bar {\\boldsymbol {r}} _ {i} \\right\\| ^ {2} = \\boldsymbol {r} _ {i} ^ {\\top} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\boldsymbol {\\Omega} _ {i} ^ {\\top} \\boldsymbol {\\Omega} _ {i} \\boldsymbol {r} _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right). \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.66, + 0.92, + 0.7 + ], + "angle": 0, + "content": "The generic residuals \\(\\bar{\\pmb{r}}_i\\) themselves are non-linear with a corresponding Taylor expansions in \\(\\pmb{\\theta}_i\\) around some linearization point \\(\\pmb{\\theta}_i^0\\) such that" + }, + { + "type": "equation", + "bbox": [ + 0.181, + 0.711, + 0.921, + 0.737 + ], + "angle": 0, + "content": "\\[\n\\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i}\\right) - \\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i} ^ {0}\\right) \\approx D \\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i} ^ {0}\\right) \\left(\\boldsymbol {\\theta} _ {i} - \\boldsymbol {\\theta} _ {i} ^ {0}\\right) = \\bar {\\boldsymbol {J}} _ {i} ^ {0} \\left(\\boldsymbol {\\theta} _ {i} - \\boldsymbol {\\theta} _ {i} ^ {0}\\right) = \\bar {\\boldsymbol {J}} _ {i} ^ {0} \\boldsymbol {\\tau} _ {i} ^ {0}. \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.748, + 0.92, + 0.789 + ], + "angle": 0, + "content": "Furthermore, all factors \\( f_{i} \\), their energies \\( E_{i}(t_{i},\\pmb{\\theta}_{i}) \\) respectively, can also be converted to an equivalent, incremental information form \\( \\mathcal{N}^{-1}(\\pmb{\\eta}_i^0,\\pmb{\\Lambda}_i^0) \\), yielding" + }, + { + "type": "equation", + "bbox": [ + 0.27, + 0.813, + 0.921, + 0.852 + ], + "angle": 0, + "content": "\\[\nE _ {i} \\left(t _ {i}, \\boldsymbol {\\tau} _ {i} ^ {0}\\right) \\approx \\frac {1}{2} \\boldsymbol {\\tau} _ {i} ^ {0, \\top} \\boldsymbol {\\Lambda} _ {i} ^ {0} \\boldsymbol {\\tau} _ {i} ^ {0} - \\boldsymbol {\\tau} _ {i} ^ {0, \\top} \\boldsymbol {\\eta} _ {i} ^ {0} \\quad \\text {w h e r e} \\tag {11}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.302, + 0.853, + 0.921, + 0.88 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\eta} _ {i} ^ {0} = - \\bar {\\boldsymbol {J}} _ {i} ^ {0, \\top} \\bar {\\boldsymbol {r}} _ {i} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {i} ^ {0} = \\bar {\\boldsymbol {J}} _ {i} ^ {0, \\top} \\bar {\\boldsymbol {J}} _ {i} ^ {0}. \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.891, + 0.92, + 0.949 + ], + "angle": 0, + "content": "This dual representation of factors \\( f_{i} \\) and the existence of the Gaussian \\( \\mathcal{N} \\) and its inverse \\( \\mathcal{N}^{-1} \\) is vital for efficient conditioning and marginalization of individual terms in the GBP algorithm presented in the next section." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.079, + 0.017, + 0.095, + 0.03 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.16, + 0.016, + 0.29, + 0.033 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "image", + "bbox": [ + 0.092, + 0.051, + 0.473, + 0.183 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.205, + 0.185, + 0.357, + 0.201 + ], + "angle": 0, + "content": "(a) Factor Graph" + }, + { + "type": "image", + "bbox": [ + 0.482, + 0.05, + 0.904, + 0.183 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.604, + 0.185, + 0.783, + 0.201 + ], + "angle": 0, + "content": "(b) Message Passing" + }, + { + "type": "image_caption", + "bbox": [ + 0.075, + 0.215, + 0.921, + 0.324 + ], + "angle": 0, + "content": "Fig. 3: (a) Qualitative illustration of the factor graphs resulting from a continuous-time motion parametrization. Notably, even one of the simplest factor archetypes, which purely relies on the motion-parameterizing nodes as well as some landmarks, introduces a considerable amount of loops in the continuous-time realm. This can be attributed to the fact that poses \\( T_{wb}(t) \\) depend on multiple bases for any given time \\( t \\). (b) Visualization of the message passing algorithm between nodes and factors in a graph \\( \\mathcal{G} \\)." + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.358, + 0.922, + 0.518 + ], + "angle": 0, + "content": "Gaussian Belief Propagation (GBP) As illustrated in Fig. 3a, Eqs. (3) and (7) expose equivalent visual representations as factor graphs, giving rise to compact and intuitive descriptions of complex probabilistic dependencies which are encoded into bipartite graphs \\(\\mathcal{G}\\) containing factors \\(f_{i} \\sim \\mathcal{N}^{-1}(\\pmb{\\eta}_{f_{i}}, \\pmb{\\Lambda}_{f_{i}})\\) and nodes \\(n_j \\sim \\mathcal{N}(\\pmb{\\mu}_{n_j}, \\pmb{\\Sigma}_{n_j}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_j}, \\pmb{\\Lambda}_{n_j})\\). Intuitively, the GBP algorithm, thus, comprises two steps to iteratively solve for the optimal solution to Eq. (7), namely node and factor updates with intermediate factor-to-node \\(\\pmb{m}_{f_i \\rightarrow n_j}\\) and node-to-factor \\(\\pmb{m}_{n_j \\rightarrow f_i}\\) message passing detailed in the following." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.532, + 0.923, + 0.613 + ], + "angle": 0, + "content": "Node Updates: The Gaussian nodes \\( n_j \\in \\mathcal{G} \\) with neighborhood \\( N(n_j) \\) of connected factors \\( f_i \\in N(n_j) \\) are updated by taking the product over incoming factor-to-node messages \\( \\pmb{m}_{f_i \\to n_j} \\), which reduces to a simple summation of Gaussians for (linear) vector spaces, resulting in node beliefs \\( B(n_j) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_j}, \\pmb{\\Lambda}_{n_j}) \\), where" + }, + { + "type": "equation", + "bbox": [ + 0.124, + 0.638, + 0.922, + 0.684 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\eta} _ {n _ {j}} = \\boldsymbol {\\eta} _ {n _ {j}} ^ {p} + \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\eta} _ {f _ {i} \\rightarrow n _ {j}} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} = \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {p} + \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}}. \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.696, + 0.922, + 0.832 + ], + "angle": 0, + "content": "Above, \\( P(n_{j}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_{j}}^{p},\\pmb{\\Lambda}_{n_{j}}^{p}) \\) denotes a known prior on the node belief \\( B(n_{j}) \\) which can be leveraged to better constrain the problem in practice. However, despite its simplicity and elegance, this straightforward approach can not be applied to Lie groups \\( G \\) with associated tangent space \\( \\mathfrak{g} \\) and their operators \\( \\boxminus : G \\times G \\mapsto \\mathfrak{g} \\) and \\( \\boxplus : G \\times \\mathfrak{g} \\mapsto G \\) extensively used in robotics. Hence, a more sophisticated approach is required to obtain the product of factor-to-node messages and to handle frame conversions between elements in the Lie group." + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.832, + 0.922, + 0.95 + ], + "angle": 0, + "content": "To this end, we follow a similar strategy as Murai et al. [28] and propose the use of a Mixed Gaussian Representation (MGR) to parameterize Lie-group-valued nodes as \\( n_j \\sim \\mathfrak{N}(\\pmb{\\mu}_{n_j}, \\pmb{\\Lambda}_{n_j}) \\), where \\( \\pmb{\\mu}_{n_j} \\in G \\) and \\( \\pmb{\\Lambda}_{n_j} \\in \\mathbb{R}^{\\dim(\\mathfrak{g}) \\times \\dim(\\mathfrak{g})} \\), also assuming that incoming message \\( \\pmb{m}_{f_i \\to n_j} \\sim \\mathfrak{N}(\\pmb{\\mu}_{f_i \\to n_j}, \\pmb{\\Lambda}_{f_i \\to n_j}) \\) take the same form. In contrast to conventional vector spaces, the precision matrices are expressed relative to their associated elements in the Lie group, implying that" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.236, + 0.015, + 0.842, + 0.034 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.904, + 0.017, + 0.92, + 0.031 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.057, + 0.923, + 0.116 + ], + "angle": 0, + "content": "one must warp them to a privileged frame of reference. An intuitive choice for such a frame is the latest estimate of the node's state, denoted as \\(\\pmb{\\mu}_{n_j}^0\\) and \\(\\pmb{\\Lambda}_{n_j}^0\\), resulting in the following transformation rules to warp the messages." + }, + { + "type": "equation", + "bbox": [ + 0.309, + 0.125, + 0.921, + 0.151 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} = \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}} \\boxminus \\boldsymbol {\\mu} _ {n _ {j}} ^ {0} \\quad \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g})} \\tag {14}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.169, + 0.154, + 0.921, + 0.21 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} = \\left[ \\frac {\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}}{\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} \\left[ \\frac {\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}}{\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}}} \\right] \\quad \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g}) \\times \\dim (\\mathfrak {g})} \\tag {15}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.221, + 0.921, + 0.282 + ], + "angle": 0, + "content": "After this conversion, both \\(\\pmb{\\tau}_{f_i\\rightarrow n_j}^0\\) and \\(\\pmb{\\Lambda}_{f_i\\rightarrow n_j}^0\\) are elements in the tangent (matrix) space relative to the privileged frame and must then be summed in analogy to Eq. (13) to yield the intermediate, incremental values" + }, + { + "type": "equation", + "bbox": [ + 0.158, + 0.294, + 0.921, + 0.338 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\tau} _ {n _ {j}} ^ {+} = \\alpha_ {n _ {j}} \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}, \\tag {16}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.347, + 0.92, + 0.387 + ], + "angle": 0, + "content": "where \\(\\alpha_{n_j}\\) denotes an optional step size. The above increments must then again be warped to the updated frame of reference by evaluating" + }, + { + "type": "equation", + "bbox": [ + 0.206, + 0.397, + 0.921, + 0.446 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\mu} _ {n _ {j}} = \\boldsymbol {\\mu} _ {n _ {j}} ^ {0} \\boxplus \\boldsymbol {\\tau} _ {n _ {j}} ^ {+} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} = \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {n _ {j}}}{\\partial \\boldsymbol {\\tau} _ {n _ {j}} ^ {+}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {+} \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {n _ {j}}}{\\partial \\boldsymbol {\\tau} _ {n _ {j}} ^ {+}} \\right]. \\tag {17}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.076, + 0.455, + 0.92, + 0.495 + ], + "angle": 0, + "content": "Note, however, that priors can not be injected as simplistically as in Eq. (13) and need to be treated as proper factors in the context of Lie groups instead." + }, + { + "type": "text", + "bbox": [ + 0.076, + 0.51, + 0.92, + 0.569 + ], + "angle": 0, + "content": "Node-to-factor Messages: The generation of node-to-factor messages mirrors the expressions from Eq. (16), differing only in excluding information stemming from the target factor in the sums. Hence, they encompass" + }, + { + "type": "equation", + "bbox": [ + 0.095, + 0.58, + 0.921, + 0.623 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\tau} _ {n _ {j} \\rightarrow f _ {k}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j}) \\backslash f _ {k}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j} \\rightarrow f _ {k}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j}) \\backslash f _ {k}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\tag {18}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.635, + 0.92, + 0.72 + ], + "angle": 0, + "content": "alongside their respective linearization point \\(\\pmb{\\mu}_{n_j}^0\\) to form the outgoing message triplet \\((\\pmb{\\mu}_{n_j}^0, \\pmb{\\tau}_{n_j \\to f_k}^+, \\pmb{\\Lambda}_{n_j \\to f_k}^+)\\) destined for the factor \\(f_k\\). Note, however, that another reevaluation of Eqs. (14) and (15) is required to generate outgoing messages that leverage the latest state estimate from Eq. (17)." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.735, + 0.922, + 0.86 + ], + "angle": 0, + "content": "Factor Updates: In analogy to previous paragraphs, factors \\( f_{i} \\in \\mathcal{G} \\) depend on a collection of connected, neighboring nodes \\( N(f_{i}) \\) which collectively determine the linearization point \\( \\pmb{\\theta}_{f_i}^0 \\) for the residual evaluation \\( \\bar{\\pmb{r}}_{f_i} \\) from Eq. (2). The computation of the factor-to-node messages \\( m_{f_i \\to N(f_i)} \\) depends on the factor beliefs \\( B(f_{i}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{f_{i}}^{0},\\pmb{\\Lambda}_{f_{i}}^{0}) \\) obtained from Eq. (12) as well as the auxiliary, intermediate quantities \\( \\pmb{\\eta}_{f_i}' \\) and \\( \\pmb{\\Lambda}_{f_i}' \\) (used in the next paragraph) defined as" + }, + { + "type": "equation", + "bbox": [ + 0.218, + 0.871, + 0.921, + 0.896 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} = \\boldsymbol {\\eta} _ {f _ {i}} ^ {0} + \\boldsymbol {\\eta} _ {N (f _ {i}) \\rightarrow f _ {i}} ^ {+} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} = \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {0} + \\boldsymbol {\\Lambda} _ {N (f _ {i}) \\rightarrow f _ {i}} ^ {+} \\tag {19}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.076, + 0.907, + 0.92, + 0.95 + ], + "angle": 0, + "content": "Above, \\(\\pmb{\\eta}_{N(f_i)\\rightarrow f_i}^+\\) and \\(\\pmb{\\Lambda}_{N(f_i)\\rightarrow f_i}^+\\) denote stacked vector and block diagonal matrix versions of the neighborhood-to-factor messages (see Eqs. (20) and (21))." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.079, + 0.017, + 0.096, + 0.03 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.159, + 0.016, + 0.291, + 0.033 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "text", + "bbox": [ + 0.076, + 0.056, + 0.921, + 0.116 + ], + "angle": 0, + "content": "Factor-to-Node Messages: We illustrate the computation of the factor-to-node messages (see Fig. 3b) assuming a factor \\( f_{i} \\) which depends on two nodes, namely \\( n_a \\) and \\( n_b \\). Thus, Eq. (19) takes the following form" + }, + { + "type": "equation", + "bbox": [ + 0.343, + 0.133, + 0.92, + 0.176 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} = \\left[\\begin{array}{l}\\boldsymbol {\\eta} _ {a} ^ {\\prime}\\\\\\boldsymbol {\\eta} _ {b} ^ {\\prime}\\end{array}\\right] = \\boldsymbol {\\eta} _ {f _ {i}} ^ {0} + \\left[\\begin{array}{c}\\boldsymbol {\\eta} _ {n _ {a} \\rightarrow f _ {i}} ^ {+}\\\\\\boldsymbol {\\eta} _ {n _ {b} \\rightarrow f _ {i}} ^ {+}\\end{array}\\right] \\tag {20}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.258, + 0.182, + 0.92, + 0.226 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} = \\left[\\begin{array}{l l}\\boldsymbol {\\Lambda} _ {a a} ^ {\\prime}&\\boldsymbol {\\Lambda} _ {b a} ^ {\\prime \\top}\\\\\\boldsymbol {\\Lambda} _ {b a} ^ {\\prime}&\\boldsymbol {\\Lambda} _ {b b} ^ {\\prime}\\end{array}\\right] = \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {0} + \\left[\\begin{array}{c c}\\boldsymbol {\\Lambda} _ {n _ {a} \\rightarrow f _ {i}} ^ {+}&\\mathbf {0}\\\\\\mathbf {0}&\\boldsymbol {\\Lambda} _ {n _ {b} \\rightarrow f _ {i}} ^ {+}\\end{array}\\right]. \\tag {21}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.242, + 0.92, + 0.3 + ], + "angle": 0, + "content": "To retrieve the message \\( \\pmb{m}_{f_i\\rightarrow n_a} = \\mathfrak{N}(\\pmb{\\mu}_{f_i\\rightarrow n_a},\\pmb{\\Lambda}_{f_i\\rightarrow n_a}) \\), the remaining nodes (i.e. \\( n_b \\) in this example) must initially be marginalized by computing the Schur complement defined as" + }, + { + "type": "equation", + "bbox": [ + 0.136, + 0.315, + 0.92, + 0.34 + ], + "angle": 0, + "content": "\\[\n\\eta_ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\eta_ {a} ^ {0} - \\Lambda_ {b a} ^ {\\prime \\top} \\Lambda_ {b b} ^ {\\prime - 1} \\eta_ {b} ^ {\\prime} \\quad \\text {a n d} \\quad \\Lambda_ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\Lambda_ {a a} ^ {0} - \\Lambda_ {b a} ^ {\\prime \\top} \\Lambda_ {b b} ^ {\\prime - 1} \\Lambda_ {b a} ^ {\\prime}. \\tag {22}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.357, + 0.92, + 0.396 + ], + "angle": 0, + "content": "In a similar vein, one obtains \\( \\pmb{m}_{f_i \\to n_b} \\) by permuting \\( \\pmb{\\eta}_{f_i}' \\) and \\( \\pmb{\\Lambda}_{f_i}' \\) such that \\( n_a \\) is marginalized instead of \\( n_b \\). In particular," + }, + { + "type": "equation", + "bbox": [ + 0.282, + 0.412, + 0.92, + 0.454 + ], + "angle": 0, + "content": "\\[\n\\left[ \\begin{array}{l} \\boldsymbol {\\eta} _ {b} ^ {\\prime} \\\\ \\boldsymbol {\\eta} _ {a} ^ {\\prime} \\end{array} \\right] = P \\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} \\text {a n d} \\left[ \\begin{array}{c c} \\boldsymbol {\\Lambda} _ {b b} ^ {\\prime} & \\boldsymbol {\\Lambda} _ {a b} ^ {\\prime \\top} \\\\ \\boldsymbol {\\Lambda} _ {a b} ^ {\\prime} & \\boldsymbol {\\Lambda} _ {a a} ^ {\\prime} \\end{array} \\right] = P \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} P ^ {\\top}, \\tag {23}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.469, + 0.922, + 0.626 + ], + "angle": 0, + "content": "which also naturally extends to factors touching more than two nodes. Readers might notice that our formulation differs from others found in the literature; this has the advantage that the formulations from Eqs. (20) and (21) allow for extremely efficient in-place permutations of \\(\\pmb{\\eta}_{f_i}^{\\prime}\\) and \\(\\pmb{\\Lambda}_{f_i}^{\\prime}\\) to marginalize many-node factors, limiting reallocations and recomputations. Mirroring the process in Eq. (17), it is necessary to convert the incremental values \\(\\pmb{\\eta}_{f_i\\rightarrow n_a}^{\\prime}\\) and \\(\\pmb{\\Lambda}_{f_i\\rightarrow n_a}^{\\prime}\\) into the updated, outgoing frame of reference, to obtain the message \\(\\pmb{m}_{f_i\\rightarrow n_a}\\), relying on an optional step size \\(\\alpha_{f_i}\\). That is" + }, + { + "type": "equation", + "bbox": [ + 0.104, + 0.643, + 0.92, + 0.667 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\alpha_ {f _ {i}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime - 1} \\boldsymbol {\\eta} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g})}, \\quad \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}} = \\boldsymbol {\\mu} _ {n _ {a}} ^ {0} \\boxplus \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\in G \\tag {24}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.121, + 0.671, + 0.92, + 0.727 + ], + "angle": 0, + "content": "\\[\n\\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} = \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}}}{\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}}}{\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime}} \\right] \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g}) \\times \\dim (\\mathfrak {g})}. \\tag {25}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.747, + 0.922, + 0.903 + ], + "angle": 0, + "content": "Robust Residuals and Energies: It is well understood that the presence of outliers in the optimization problem from Eq. (3) causes substantial issues in terms of converging to a globally optimal solution \\(\\Theta^{*}\\) due to the quadratic nature of the occurring cost terms. The same holds in the context of GBP, where outliers are bound to heavily influence the found solution as well. To address this issue we take inspiration from established NLLS approaches [1] and apply robust loss functions \\(\\rho\\) to Eqs. (3) and (9), resulting in modified expressions for the robust energies \\(\\vec{E}\\) and the robust optimal solution \\(\\check{\\Theta}^{*}\\), provided for completeness only." + }, + { + "type": "equation", + "bbox": [ + 0.388, + 0.919, + 0.92, + 0.954 + ], + "angle": 0, + "content": "\\[\n\\check {E} (t, \\boldsymbol {\\theta} _ {s}) = \\frac {1}{2} \\rho (\\bar {\\boldsymbol {r}} ^ {\\top} \\bar {\\boldsymbol {r}}) \\tag {26}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.236, + 0.015, + 0.842, + 0.035 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.903, + 0.017, + 0.92, + 0.031 + ], + "angle": 0, + "content": "9" + }, + { + "type": "equation", + "bbox": [ + 0.32, + 0.069, + 0.921, + 0.133 + ], + "angle": 0, + "content": "\\[\n\\breve {\\boldsymbol {\\theta}} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\left[ \\sum_ {s \\in \\mathcal {S}} \\sum_ {t \\in \\mathcal {T} _ {s}} \\breve {E} (t, \\boldsymbol {\\theta} _ {s}) \\right] \\tag {27}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.138, + 0.92, + 0.178 + ], + "angle": 0, + "content": "In particular, based on the methodology from Triggs et al. [41], the robust residual and Jacobian then take the following forms." + }, + { + "type": "equation", + "bbox": [ + 0.368, + 0.186, + 0.921, + 0.229 + ], + "angle": 0, + "content": "\\[\n\\alpha^ {2} - 2 \\alpha - \\frac {2 \\rho^ {\\prime \\prime}}{\\rho^ {\\prime}} \\bar {\\boldsymbol {r}} _ {i} ^ {\\top} \\bar {\\boldsymbol {r}} _ {i} \\stackrel {!} {=} 0 \\tag {28}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.264, + 0.232, + 0.921, + 0.285 + ], + "angle": 0, + "content": "\\[\n\\check {\\boldsymbol {r}} _ {i} = \\frac {\\sqrt {\\rho^ {\\prime}}}{1 - \\alpha} \\bar {\\boldsymbol {r}} _ {i} \\quad \\check {\\boldsymbol {J}} _ {i} = \\sqrt {\\rho^ {\\prime}} \\left(1 - \\alpha \\frac {\\bar {\\boldsymbol {r}} _ {i} \\bar {\\boldsymbol {r}} _ {i} ^ {\\top}}{\\| \\bar {\\boldsymbol {r}} _ {i} \\| ^ {2}}\\right) \\bar {\\boldsymbol {J}} _ {i} \\tag {29}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.296, + 0.923, + 0.435 + ], + "angle": 0, + "content": "Non-Gaussian Nodes: Another extension to conventional GBP lies in classifying Gaussian nodes as either pure constants or as stochastic variables. This distinction streamlines computation given that the message marginalization \\( \\pmb{m}_{n_j\\rightarrow f_i} \\) across nodes via Cholesky decomposition exposes complexity \\( \\mathcal{O}(n^3) \\) which quickly becomes prohibitive. In particular, allowing non-variable parameters (e.g. extrinsic, intrinsic, offset etc.) to be treated as pure constants considerably reduces the dimensionality of the marginalization procedure without any drawbacks." + }, + { + "type": "title", + "bbox": [ + 0.076, + 0.459, + 0.325, + 0.477 + ], + "angle": 0, + "content": "3.4 Sensor Models" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.488, + 0.92, + 0.547 + ], + "angle": 0, + "content": "In the following, we detail the employed absolute and visual sensor models, where expressions marked with \\(\\hat{\\cdot}\\) indicate estimizable parameters. Conversely, unless explicitly mentioned, all other variables are considered known and constant." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.572, + 0.922, + 0.691 + ], + "angle": 0, + "content": "Absolute Sensor Model The predictions of absolute sensor measurements \\(\\hat{m}_s(t_m,\\Theta_s)\\) (e.g. absolute pose estimates extracted from AprilTags [29] or measurements obtained from a Motion Capture (MoCap) system) are evaluated using Eq. (30) and subsequently compared against their corresponding true measurements by applying the metric \\(\\boxdot_{\\mu}\\) in Eq. (31) where we make use of the logarithmic map for elements in \\(\\mathbb{S}\\mathbb{O}(3)\\), and \\(\\mathbb{SU}(2)\\) respectively." + }, + { + "type": "equation", + "bbox": [ + 0.291, + 0.701, + 0.92, + 0.723 + ], + "angle": 0, + "content": "\\[\n\\hat {\\boldsymbol {m}} _ {s} \\left(t _ {m}, \\Theta_ {s}\\right) = \\hat {\\boldsymbol {T}} _ {w s} \\left(t _ {m}\\right) = \\hat {\\boldsymbol {T}} _ {w b} \\left(t _ {m}\\right) \\boldsymbol {T} _ {b s} \\tag {30}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.3, + 0.727, + 0.921, + 0.772 + ], + "angle": 0, + "content": "\\[\n\\hat {\\boldsymbol {T}} _ {w s} \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {T} _ {w s} = \\left[ \\begin{array}{c} \\log (\\hat {\\boldsymbol {q}} _ {w s} \\boldsymbol {q} _ {w s} ^ {- 1}) \\\\ \\hat {\\boldsymbol {t}} _ {w s} - \\boldsymbol {t} _ {w s} \\end{array} \\right] \\in \\mathbb {R} ^ {6} \\tag {31}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.793, + 0.923, + 0.89 + ], + "angle": 0, + "content": "Visual Sensor Model Abstracting from the specific camera parameters, such as its intrinsic and its distortion model, we introduce the mapping \\(\\pi(\\cdot)\\) in Eq. (32) to infer individual projections of landmarks \\(l_w\\) onto the image plane at time \\(t_m\\). For visual, pixel-based measurements, the metric \\(\\boxdot_{\\mu}\\) is chosen to be equivalent to trivial Euclidean subtraction." + }, + { + "type": "equation", + "bbox": [ + 0.268, + 0.901, + 0.921, + 0.925 + ], + "angle": 0, + "content": "\\[\n\\hat {\\boldsymbol {m}} _ {s} \\left(t _ {m}, \\Theta_ {s}\\right) = \\hat {\\boldsymbol {p}} _ {s} \\left(t _ {m}\\right) = \\pi \\left(\\boldsymbol {T} _ {s b} \\hat {\\boldsymbol {T}} _ {b w} \\left(t _ {m}\\right), l _ {w}\\right) \\tag {32}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.362, + 0.928, + 0.921, + 0.951 + ], + "angle": 0, + "content": "\\[\n\\hat {\\boldsymbol {p}} _ {s} \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {p} _ {s} = \\hat {\\boldsymbol {p}} _ {s} - \\boldsymbol {p} _ {s} \\in \\mathbb {R} ^ {2} \\tag {33}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.08, + 0.017, + 0.106, + 0.032 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.159, + 0.016, + 0.291, + 0.034 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "title", + "bbox": [ + 0.078, + 0.057, + 0.236, + 0.075 + ], + "angle": 0, + "content": "3.5 System" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.087, + 0.923, + 0.321 + ], + "angle": 0, + "content": "Overview Our system is designed to efficiently support both batch and windowed optimizations, crucial for applications such as Bundle Adjustment (BA) and SLAM. Inspired by Ceres [1], it allows dynamic modification of nodes and factors between solver calls, features multiple solving strategies, namely synchronous and dropout, determining the order of node and factor updates and leverages multithreading to exploit the inherent parallelism of GBP methods, further boosting the overall performance. Optimizable parameters are added and removed in analogy to Ceres [1], with the notable distinction that GBP-based methods necessitate both an initial mean and covariance estimate for each parameter, unlike standard NLLS methods. This requirement, however, poses no practical hindrance as conservative guesses on the covariance suffice to bootstrap the algorithm." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.348, + 0.923, + 0.583 + ], + "angle": 0, + "content": "Symbolic Factors Targeting the long-standing challenge of obtaining efficient, analytical expressions and derivatives of spline-based motion parameterizations and their associated cost factors, here, we leverage SymForce [22], a symbolic code generation framework, to completely automate this cumbersome, time-intensive and error-prone process. Taking inspiration from Sommer et al. [40], who exploited Lie-group-specific properties to simplify spline-related mathematical expressions, we supercharge their recursive spline formulation by combining it with SymForce [22] to obtain ultra-efficient \\(\\mathrm{C}++\\) cost factor implementations. Furthermore, recognizing the broader relevance of automated factor generation for (continuous-time) robotics applications, our framework offers a comprehensive library featuring spline-based and standard factors designed to seamlessly interoperate with both our framework and Ceres [1], facilitating widespread adoption." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.609, + 0.923, + 0.824 + ], + "angle": 0, + "content": "Update Strategies Amongst many possible update strategies, we focus our attention on synchronous and dropout updates. Synchronous updates closely follow traditional NLLS algorithms, where residuals are completely re-evaluated in every solver iteration and where (non-constant) nodes and factors are sequentially updated in an alternating fashion to ensure optimal convergence. In contrast to traditional approaches, GBP, however, also accommodates selective updates based on a dropout strategy. That is, one assigns probabilities, \\( d_{n} \\) for nodes and \\( d_{f} \\) for factors, dictating their likelihood of being updated in each iteration. Although this may slow convergence, it intentionally compensates for stability challenges in loopy graphs while mimicking real-world scenarios with imperfect communication channels and delayed messages." + }, + { + "type": "title", + "bbox": [ + 0.078, + 0.851, + 0.315, + 0.873 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.078, + 0.891, + 0.924, + 0.95 + ], + "angle": 0, + "content": "We evaluate the proposed system, coined Hyperion, empirically through simulations in MoCap (absolute) and localization settings, using a temporal interval of 0.1 seconds between adjacent spline bases along with the empirical step sizes" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.236, + 0.015, + 0.84, + 0.035 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.893, + 0.017, + 0.917, + 0.032 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.055, + 0.923, + 0.155 + ], + "angle": 0, + "content": "\\(\\alpha_{n_j} = \\alpha_{f_i} = 0.7\\) across all cases. The simulated trajectories span 10 seconds and mimic real-world conditions with appropriate initial perturbations, sensor acquisition rates, and measurement noise levels. Our analysis focuses on benchmarking Hyperion against Ceres [1], an established, centralized NLLS solver, and providing in-depth ablation studies on different aspects of the framework itself." + }, + { + "type": "title", + "bbox": [ + 0.08, + 0.179, + 0.334, + 0.201 + ], + "angle": 0, + "content": "4.1 Absolute Setup" + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.21, + 0.923, + 0.366 + ], + "angle": 0, + "content": "We commence our analysis with the absolute sensor configuration, capturing measurements akin to the ones stemming from a MoCap system, where individual factors model direct observations of the underlying motion without auxiliary parameters/nodes. As such, they embody the most fundamental category of constraints, suggesting that derived factors, such as landmark projections or relative measurements, merely extend these elements, rendering them ideal candidates to analyze key properties of the proposed approach. In the following, we assume an acquisition rate of \\(40\\mathrm{Hz}\\) matching the real-world specifications." + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.366, + 0.923, + 0.482 + ], + "angle": 0, + "content": "Our initial examination centers on comparing the convergence behavior of Hyperion against Ceres [1] across varying levels of initial perturbations and measurement noise. To this end, both solvers are identically initialized to a modified ground truth motion, encompassing perturbations in rotations and translations. Furthermore, we make use of the synchronized vertex updates if not stated otherwise, aiming for a fair comparison against Ceres." + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.482, + 0.923, + 0.579 + ], + "angle": 0, + "content": "The qualitative outcomes of this setup are illustrated in Fig. 1, demonstrating that both Hyperion and Ceres converge to identical solutions even under substantial initial perturbation and considerable measurement noise. These observations are quantified in Tabs. 1a and 1b, indicating that motion estimates obtained from Hyperion and Ceres closely align across all levels of perturbation and noise." + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.58, + 0.923, + 0.715 + ], + "angle": 0, + "content": "Message dropouts, mimicking imperfect communication, have also been shown to enhance convergence [27, 31] in loopy graphs. Hence, we study their effect on the proposed GBP framework, summarizing key insights in Fig. 4a, revealing that Hyperion consistently converges toward identical solutions across various dropout ratios. Despite this, they also influence the required iteration count (i.e., updates of all vertices), with every \\(10\\%\\) increase in dropouts entailing an additional 2-4 iterations until convergence is reached." + }, + { + "type": "text", + "bbox": [ + 0.079, + 0.715, + 0.923, + 0.948 + ], + "angle": 0, + "content": "Furthermore, we find that different motion parameterizations, specifically cubic Z- and B-Splines [4, 17], also influence the convergence of the proposed approach, which we summarize in Fig. 7b. A notable difference between the traditional and our proposed solver lies in how motion parameterizations affect the convergence speed of the latter. Our findings suggest that Z-Splines, which are interpolating rather than approximating splines, typically yield better-conditioned solutions since their bases must lie on the motion estimate itself, implicitly constraining the space of possible solutions. Naturally, the centralized NLLS solver sets a baseline for the required iteration count to resolve an optimization problem, serving as a comparative standard for our method. Thus, while GBP-based approaches are inherently distributed, Fig. 7b indicates that they impose between 2 to 4 additional iterations to achieve convergence." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.08, + 0.017, + 0.105, + 0.031 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.159, + 0.016, + 0.291, + 0.033 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "table", + "bbox": [ + 0.126, + 0.053, + 0.496, + 0.156 + ], + "angle": 0, + "content": "
Perturbation [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-65.2e-65.2e-65.9e-65.3e-6
t [m]5.8e-65.8e-65.9e-65.9e-66.0e-61.3e-5
Ceres
R [rad]5.2e-65.2e-65.2e-65.2e-65.2e-65.2e-6
t [m]5.9e-65.9e-65.9e-65.9e-65.9e-65.9e-6
" + }, + { + "type": "table_caption", + "bbox": [ + 0.192, + 0.159, + 0.428, + 0.173 + ], + "angle": 0, + "content": "(a) Perturbation Tolerance" + }, + { + "type": "table", + "bbox": [ + 0.504, + 0.053, + 0.871, + 0.156 + ], + "angle": 0, + "content": "
Noise [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-55.2e-45.2e-35.3e-25.6e-1
t [m]5.8e-65.9e-55.9e-45.9e-35.9e-25.9e-1
Ceres
R [rad]5.2e-65.2e-55.2e-45.2e-35.2e-25.5e-1
t [m]5.9e-65.9e-55.9e-45.9e-35.9e-25.9e-1
" + }, + { + "type": "table_caption", + "bbox": [ + 0.599, + 0.159, + 0.774, + 0.173 + ], + "angle": 0, + "content": "(b) Noise Tolerance" + }, + { + "type": "table_caption", + "bbox": [ + 0.075, + 0.188, + 0.921, + 0.26 + ], + "angle": 0, + "content": "Table 1: Root Mean Square Errors (RMSEs) in rotation (R) and translation (t) resulting from Ceres [1] and Hyperion under different perturbation levels (a), different noise levels (b) respectively. The solvers run to convergence or terminate after 50 iterations. The perturbation/noise setup assumes the lowest noise/perturbation, respectively." + }, + { + "type": "image", + "bbox": [ + 0.118, + 0.313, + 0.42, + 0.481 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.157, + 0.485, + 0.382, + 0.5 + ], + "angle": 0, + "content": "(a) Convergence: Dropout" + }, + { + "type": "table", + "bbox": [ + 0.447, + 0.313, + 0.878, + 0.466 + ], + "angle": 0, + "content": "
SetupPose [s]Velocity [s]Acceleration [s]Avg. Speedup
Lkθ/DBOursBasaltOursBasaltOursBasalt
SO(3)4X1.64e-73.16e-79.49e-82.90e-71.12e-73.28e-72.64x
SO(3)4✓5.03e-76.70e-64.05e-77.82e-65.11e-79.46e-617.05x
SO(3)5X1.96e-74.14e-71.32e-73.67e-71.39e-73.96e-72.58x
SO(3)5✓6.89e-71.08e-55.82e-71.27e-57.87e-71.58e-519.19x
SO(3)6X2.17e-74.78e-71.82e-74.42e-71.81e-74.83e-72.43x
SO(3)6✓8.19e-71.57e-57.51e-71.87e-51.01e-62.43e-522.71x
SE(3)4X1.62e-77.03e-71.38e-77.46e-71.34e-76.88e-74.96x
SE(3)4✓5.71e-74.69e-59.11e-75.35e-51.12e-66.25e-565.56x
SE(3)5X1.96e-77.38e-71.91e-78.73e-71.70e-79.15e-74.57x
SE(3)5✓7.32e-79.64e-51.27e-69.44e-51.47e-61.14e-494.53x
SE(3)6X2.53e-79.11e-72.34e-71.12e-62.23e-71.12e-64.47x
SE(3)6✓9.29e-71.25e-41.54e-61.67e-41.99e-61.75e-4110.31x
" + }, + { + "type": "table_caption", + "bbox": [ + 0.519, + 0.485, + 0.804, + 0.5 + ], + "angle": 0, + "content": "(b) B-Spline Evaluation Timings" + }, + { + "type": "image_caption", + "bbox": [ + 0.075, + 0.515, + 0.924, + 0.587 + ], + "angle": 0, + "content": "Fig. 4: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the absolute setup (batch). (b) Performance comparison between our symbolically, auto-generated and optimized B-Spline implementation and the recursively-defined, hand-crafted implementation used by Sommer et al. [40] on an M3 Max @4.05GHz." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.627, + 0.922, + 0.726 + ], + "angle": 0, + "content": "Lastly, we benchmark Hyperion's real-world performance using a handheld camera to track a ChArUco [14] board, capturing a 60-second trajectory at \\(30\\mathrm{Hz}\\) with an iPhone 13 Pro. The analysis, detailed in Fig. 5, closely mirrors our previous analysis. However, we find that real-world motions, which innately expose a greater level of volatility than simulated ones, expose slower convergence." + }, + { + "type": "title", + "bbox": [ + 0.076, + 0.757, + 0.372, + 0.777 + ], + "angle": 0, + "content": "4.2 Localization Setup" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.793, + 0.921, + 0.851 + ], + "angle": 0, + "content": "In this section, we analyze our approach in a localization setup, where we model an image acquisition rate of \\(20\\mathrm{Hz}\\) and 50 randomized, observable landmarks at a range of 2 to \\(6\\mathrm{m}\\) across the modeled motion, mimicking real-world conditions." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.853, + 0.922, + 0.95 + ], + "angle": 0, + "content": "Overall, the results from the localization setup are consistent with our earlier observations, as detailed in Figs. 6, 7a and 7c. However, Fig. 7a indicates that this setup is more agnostic to lower dropout ratios compared to the absolute case. Furthermore, the disparity between different motion parameterizations becomes more pronounced over the previous setup as may be observed from" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.016, + 0.842, + 0.035 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.893, + 0.017, + 0.92, + 0.032 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.09, + 0.053, + 0.319, + 0.2 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.146, + 0.201, + 0.26, + 0.216 + ], + "angle": 0, + "content": "(a) Estimate" + }, + { + "type": "image", + "bbox": [ + 0.335, + 0.051, + 0.605, + 0.198 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.397, + 0.201, + 0.542, + 0.216 + ], + "angle": 0, + "content": "(b) Convergence" + }, + { + "type": "image", + "bbox": [ + 0.622, + 0.051, + 0.924, + 0.198 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.695, + 0.201, + 0.852, + 0.216 + ], + "angle": 0, + "content": "(c) Relative Error" + }, + { + "type": "image_caption", + "bbox": [ + 0.075, + 0.231, + 0.921, + 0.285 + ], + "angle": 0, + "content": "Fig.5: ChArUco [14] setup with overlapping motion estimates (a) from Hyperion and Ceres [1] in magenta and white, respectively. Illustration of the corresponding convergence (b) and the relative errors between the two converged estimates (c)." + }, + { + "type": "image", + "bbox": [ + 0.127, + 0.303, + 0.356, + 0.45 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.15, + 0.452, + 0.321, + 0.466 + ], + "angle": 0, + "content": "(a) At initialization" + }, + { + "type": "image", + "bbox": [ + 0.364, + 0.303, + 0.593, + 0.45 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.361, + 0.451, + 0.587, + 0.467 + ], + "angle": 0, + "content": "(b) After the \\(1^{\\mathrm{st}}\\) iteration" + }, + { + "type": "image", + "bbox": [ + 0.603, + 0.302, + 0.876, + 0.448 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.655, + 0.451, + 0.817, + 0.467 + ], + "angle": 0, + "content": "(c) Absolute Error" + }, + { + "type": "image_caption", + "bbox": [ + 0.074, + 0.481, + 0.921, + 0.556 + ], + "angle": 0, + "content": "Fig.6: The motion estimates for Hyperion and a conventional NLLS solver [1] in magenta and white, respectively, converge to similar solutions close to ground truth (in green) in the localization setup, demonstrating robust convergence under poor pose \\((\\pm 0.20\\mathrm{m / rad})\\) and landmark initialization \\((\\pm 0.20\\mathrm{m})\\) with \\(\\pm 1\\) px measurement noise." + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.593, + 0.922, + 0.693 + ], + "angle": 0, + "content": "Fig. 7c. In general, visual setups also display higher volatility over absolute ones, with notable differences in estimates, especially towards the head and tails of the optimized splines. In a similar vein, we found that these numerical instabilities tend to have a destabilizing effect in loop graphs, posing considerable challenges to deploying the proposed system as a comprehensive SLAM system at present." + }, + { + "type": "title", + "bbox": [ + 0.076, + 0.721, + 0.411, + 0.741 + ], + "angle": 0, + "content": "4.3 Performance Analysis" + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.755, + 0.922, + 0.95 + ], + "angle": 0, + "content": "As highlighted in Sec. 3.5, our framework leverages SymForce [22] to automate the generation of analytic cost factors, aiming to outperform hand-crafted implementations while mitigating development effort and programmatic errors. Thus, we test our auto-generated B-Spline implementation against Sommer et al.'s optimized, hand-crafted version [40]. The comparison, detailed in Fig. 4b, assesses the timings of pose, velocity, and acceleration evaluations for B-Splines of order \\( k \\), within a Lie group \\( \\mathcal{L} \\), potentially including the Jacobians \\( \\partial/\\partial\\mathcal{B} \\) with respect to the bases \\( \\mathcal{B}_i \\). Figure 4b shows that our automated spline implementations significantly outperform the manual ones from [40], with speedups ranging from 2.43x to 110.31x. The performance gains are particularly notable in derivative" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.08, + 0.017, + 0.105, + 0.031 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.159, + 0.016, + 0.291, + 0.033 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "image", + "bbox": [ + 0.091, + 0.051, + 0.36, + 0.197 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.111, + 0.201, + 0.338, + 0.216 + ], + "angle": 0, + "content": "(a) Convergence: Dropout" + }, + { + "type": "image", + "bbox": [ + 0.379, + 0.051, + 0.642, + 0.197 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.397, + 0.2, + 0.629, + 0.216 + ], + "angle": 0, + "content": "(b) Convergence: Absolute" + }, + { + "type": "image", + "bbox": [ + 0.664, + 0.051, + 0.925, + 0.197 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.668, + 0.201, + 0.924, + 0.216 + ], + "angle": 0, + "content": "(c) Convergence: Localization" + }, + { + "type": "image_caption", + "bbox": [ + 0.075, + 0.231, + 0.921, + 0.285 + ], + "angle": 0, + "content": "Fig. 7: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the localization setup. Convergence comparison of different splines and solver variants in the absolute setups (b) and the localization setup (c), respectively." + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.325, + 0.921, + 0.403 + ], + "angle": 0, + "content": "evaluations, where [40] employs automatic differentiation to compute the Jacobians. Considering the long-standing computational challenges of CTSLAM methods, our automated approach not only reduces complexity but also narrows the performance divide with discrete-time SLAM." + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.404, + 0.922, + 0.697 + ], + "angle": 0, + "content": "We further analyze the single-core performance of the proposed GBP solver with Ceres [1], a conventional NLLS solver, within the previously discussed scenarios. For the absolute setup (400 pose measurements), Ceres averages 0.70 ms per iteration, whereas our method averages 4.18 ms to update all graph vertices (i.e. about 6x slower). In the localization scenario (10,000 landmark reprojections), Ceres requires 15 ms per iteration, compared to our solver's 112 ms per iteration (i.e. 7.5x slower). This performance gap is, however, largely mitigated by considering that Ceres excludes the (implicit) estimation of covariances, significantly reducing computational load, and that it has been extensively refined by numerous contributors over the years. Moreover, the intrinsic distributedness and parallelizability of GBP along with potential enhancements from adaptive vertex updates, leveraging covariance estimates to trigger selective updates, are promising avenues for further performance improvements. The above analysis suggests that, even in its present state, the proposed framework is capable of real-time execution for moderately sized problems." + }, + { + "type": "title", + "bbox": [ + 0.077, + 0.73, + 0.303, + 0.75 + ], + "angle": 0, + "content": "5 Conclusions" + }, + { + "type": "text", + "bbox": [ + 0.074, + 0.774, + 0.922, + 0.949 + ], + "angle": 0, + "content": "In this work, we present a fast, versatile GBP framework that targets distributed, continuous-time SLAM applications and leverages message-passing algorithms to achieve probabilistic inference. We demonstrate the efficacy and competitiveness of our method against a conventional NLLS solver [1] achieving similar convergence and performance properties in practical settings. We further provide a comprehensive library of high-performance implementations for continuous-time SLAM, comprising motion parameterizations as well as common factors. Based on our experiments, the proposed framework shows great promise in paving the way towards resilient, distributed, continuous-time SLAM solutions." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.015, + 0.842, + 0.035 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.893, + 0.017, + 0.92, + 0.032 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.078, + 0.054, + 0.338, + 0.077 + ], + "angle": 0, + "content": "Acknowledgments" + }, + { + "type": "text", + "bbox": [ + 0.075, + 0.097, + 0.924, + 0.138 + ], + "angle": 0, + "content": "This work was partially funded by the European Research Council (ERC) Consolidator Grant project SkEyes (Grant agreement No. 101089328)." + }, + { + "type": "title", + "bbox": [ + 0.078, + 0.169, + 0.238, + 0.19 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.089, + 0.211, + 0.922, + 0.247 + ], + "angle": 0, + "content": "1. Agarwal, S., Mierle, K.: Ceres Solver, https://github.com/ceres-solver/ceres-solver, (2023, November 28)" + }, + { + "type": "ref_text", + "bbox": [ + 0.088, + 0.249, + 0.921, + 0.284 + ], + "angle": 0, + "content": "2. Anderson, S., Dellaert, F., Barfoot, T.D.: A Hierarchical Wavelet Decomposition for Continuous-Time SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 373-380 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.089, + 0.285, + 0.921, + 0.336 + ], + "angle": 0, + "content": "3. Bänninger, P., Alzugaray, I., Karrer, M., Chli, M.: Cross-agent Relocalization for Decentralized Collaborative SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5551-5557 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.09, + 0.338, + 0.921, + 0.374 + ], + "angle": 0, + "content": "4. Becerra-Sagredo, J.T.: Z-Splines: Moment-conserving Cardinal Spline Interpolation of Compact Support for Arbitrarily Spaced Data. Sem. Appl. Math. (2003)" + }, + { + "type": "ref_text", + "bbox": [ + 0.091, + 0.375, + 0.921, + 0.428 + ], + "angle": 0, + "content": "5. Bloesch, M., Burri, M., Omari, S., Hutter, M., Siegwart, R.: Iterated Extended Kalman Filter-based Visual-Inertial Odometry using Direct Photometric Feedback. Int. J. Rob. Reas. 36(10), 1053-1072 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.091, + 0.429, + 0.921, + 0.481 + ], + "angle": 0, + "content": "6. Bloesch, M., Omari, S., Hutter, M., Siegwart, R.: Robust Visual-Inertial Odometry using a Direct EKF-based Approach. In: IEEE Int. Conf. Int. Rob. Sys. pp. 298-304 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.091, + 0.483, + 0.922, + 0.535 + ], + "angle": 0, + "content": "7. Campos, C., Elvira, R., Rodríguez, J.J.G., Montiel, J.M., Tardós, J.D.: ORBSLAM3: An Accurate Open-Source Library for Visual, Visual-Inertial and Multi-Map SLAM. IEEE Trans. Rob. 37(6), 1874-1890 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.09, + 0.536, + 0.921, + 0.571 + ], + "angle": 0, + "content": "8. Davison, A.J., Ortiz, J.: FutureMapping 2: Gaussian Belief Propagation for Spatial AI. ArXiv (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.09, + 0.572, + 0.921, + 0.607 + ], + "angle": 0, + "content": "9. Droeschel, D., Behnke, S.: Efficient Continuous-Time SLAM for 3D Lidar-based Online Mapping. In: IEEE Int. Conf. Rob. Aut. pp. 1-9 (05 2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.082, + 0.608, + 0.92, + 0.643 + ], + "angle": 0, + "content": "10. Engel, J., Schöps, T., Cremers, D.: LSD-SLAM: Large-scale Direct Monocular SLAM. In: Eur. Conf. Comput. Vis. pp. 834-849 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.081, + 0.645, + 0.921, + 0.697 + ], + "angle": 0, + "content": "11. Forster, C., Zhang, Z., Gassner, M., Werlberger, M., Scaramuzza, D.: SVO: Semidirect Visual Odometry for Monocular and Multicamera Systems. IEEE Trans. Rob. 33(2), 249-265 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.081, + 0.698, + 0.92, + 0.734 + ], + "angle": 0, + "content": "12. Furgale, P., D. Barfoot, T., Sibley, G.: Continuous-Time Batch Estimation using Temporal Basis Functions. Rob. Sc. Sys. 34, 2088-2095 (05 2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.081, + 0.735, + 0.92, + 0.769 + ], + "angle": 0, + "content": "13. Furgale, P., Rehder, J., Siegwart, R.: Unified Temporal and Spatial Calibration for Multi-sensor Systems. In: IEEE Int. Conf. Int. Rob. Sys. pp. 1280-1286 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.081, + 0.77, + 0.92, + 0.823 + ], + "angle": 0, + "content": "14. Garrido-Jurado, S., Muñoz-Salinas, R., Madrid-Cuevas, F.J., Marín-Jiménez, M.J.: Automatic Generation and Detection of Highly Reliable Fiducial Markers under Occlusion. Pattern Recognition 47(6), 2280-2292 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.081, + 0.825, + 0.92, + 0.859 + ], + "angle": 0, + "content": "15. Hug, D., Bänninger, P., Alzugaray, I., Chli, M.: Continuous-Time Stereo-Inertial Odometry. IEEE Rob. Aut. Letters 7(3), 6455-6462 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.081, + 0.861, + 0.92, + 0.913 + ], + "angle": 0, + "content": "16. Hug, D., Chli, M.: HyperSLAM: A Generic and Modular Approach to Sensor Fusion and Simultaneous Localization and Mapping in Continuous-Time. In: Int. Conf. 3D Vis. pp. 978-986 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.081, + 0.914, + 0.921, + 0.949 + ], + "angle": 0, + "content": "17. Kaihuai Qin: General Matrix Representations for B-splines. In: Pac. Conf. Comput. Graph. Appl. pp. 37-43 (10 1998)" + }, + { + "type": "list", + "bbox": [ + 0.081, + 0.211, + 0.922, + 0.949 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.08, + 0.017, + 0.106, + 0.032 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.159, + 0.016, + 0.291, + 0.034 + ], + "angle": 0, + "content": "D. Hug et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.08, + 0.057, + 0.922, + 0.093 + ], + "angle": 0, + "content": "18. Karrer, M., Chli, M.: Distributed Variable-baseline Stereo SLAM from two UAVs. In: IEEE Int. Conf. Rob. Aut. pp. 82-88 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.079, + 0.094, + 0.923, + 0.147 + ], + "angle": 0, + "content": "19. Leutenegger, S., Lynen, S., Bosse, M., Siegwart, R., Furgale, P.: Keyframe-based Visual-inertial Odometry using Nonlinear Optimization. Int. J. Rob. Reas. 34, 314 - 334 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.077, + 0.147, + 0.921, + 0.2 + ], + "angle": 0, + "content": "20. Lovegrove, S., Patron-Perez, A., Sibley, G.: Spline Fusion: A continuous-Time Representation for Visual-Inertial Fusion with Application to Rolling Shutter Cameras. In: Brit. Mach. Vis. Conf. vol. 2, p. 8 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.201, + 0.921, + 0.254 + ], + "angle": 0, + "content": "21. Lynen, S., Achtelik, M.W., Weiss, S., Chli, M., Siegwart, R.: A Robust and Modular Multi-sensor Fusion Approach Applied to MAV Navigation. In: IEEE Int. Conf. Int. Rob. Sys. pp. 3923-3929 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.254, + 0.921, + 0.325 + ], + "angle": 0, + "content": "22. Martiros, H., Miller, A., Bucki, N., Solliday, B., Kennedy, R., Zhu, J., Dang, T., Pattison, D., Zheng, H., Tomic, T., Henry, P., Cross, G., VanderMey, J., Sun, A., Wang, S., Holtz, K.: SymForce: Symbolic Computation and Code Generation for Robotics. In: Rob. Sc. Sys. (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.326, + 0.921, + 0.379 + ], + "angle": 0, + "content": "23. Mascaro, R., Teixeira, L., Hinzmann, T., Siegwart, R., Chli, M.: GOMSF: Graph-Optimization Based Multi-Sensor Fusion for robust UAV Pose Estimation. In: IEEE Int. Conf. Rob. Aut. pp. 1421-1428 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.379, + 0.921, + 0.432 + ], + "angle": 0, + "content": "24. Milford, M.J., Wyeth, G.F.: SeqSLAM: Visual Route-based Navigation for Sunny Summer Days and Stormy Winter Nights. In: IEEE Int. Conf. Rob. Aut. pp. 1643-1649 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.433, + 0.921, + 0.468 + ], + "angle": 0, + "content": "25. Mueggler, E., Gallego, G., Rebecq, H., Scaramuzza, D.: Continuous-Time Visual-Inertial Odometry for Event Cameras. IEEE Trans. Rob. 34(6), 1425-1440 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.469, + 0.92, + 0.504 + ], + "angle": 0, + "content": "26. Mur-Artal, R., Montiel, J., Tardós, J.D.: ORB-SLAM: A Versatile and Accurate Monocular SLAM System. IEEE Trans. Rob. 31, 1147-1163 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.505, + 0.921, + 0.557 + ], + "angle": 0, + "content": "27. Murai, R., Alzugaray, I., Kelly, P.H., Davison, A.J.: Distributed Simultaneous Localisation and Auto-Calibration Using Gaussian Belief Propagation. IEEE Rob. Aut. Letters (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.558, + 0.92, + 0.592 + ], + "angle": 0, + "content": "28. Murai, R., Ortiz, J., Saeedi, S., Kelly, P.H., Davison, A.J.: A Robot Web for Distributed Many-Device Localisation. IEEE Trans. Rob. (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.593, + 0.921, + 0.628 + ], + "angle": 0, + "content": "29. Olson, E.: AprilTag: A Robust and Flexible Visual Fiducial System. In: IEEE Int. Conf. Rob. Aut. pp. 3400-3407 (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.629, + 0.92, + 0.664 + ], + "angle": 0, + "content": "30. Ortiz, J., Evans, T., Davison, A.J.: A Visual Introduction to Gaussian Belief Propagation. ArXiv (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.665, + 0.92, + 0.699 + ], + "angle": 0, + "content": "31. Ortiz, J., Evans, T., Sucar, E., Davison, A.J.: Incremental Abstraction in Distributed Probabilistic SLAM Graphs. In: IEEE Int. Conf. Rob. Aut. pp. 7566-7572 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.7, + 0.92, + 0.753 + ], + "angle": 0, + "content": "32. Ortiz, J., Pupilli, M., Leutenegger, S., Davison, A.J.: Bundle Adjustment on a Graph Processor. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 2416-2425 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.754, + 0.92, + 0.789 + ], + "angle": 0, + "content": "33. Oth, L., Furgale, P., Kneip, L., Siegwart, R.: Rolling Shutter Camera Calibration. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 1360-1367 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.789, + 0.92, + 0.842 + ], + "angle": 0, + "content": "34. Peng, Z., Xu, Y., Yan, M., Yin, W.: ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates. J. Sc. Comput. 38(5), A2851-A2879 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.843, + 0.919, + 0.878 + ], + "angle": 0, + "content": "35. Qin, T., Cao, S., Pan, J., Shen, S.: A General Optimization-based Framework for Global Pose Estimation with Multiple Sensors. ArXiv (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.879, + 0.921, + 0.913 + ], + "angle": 0, + "content": "36. Qin, T., Li, P., Shen, S.: VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimator. IEEE Trans. Rob. 34(4), 1004-1020 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.914, + 0.921, + 0.949 + ], + "angle": 0, + "content": "37. Qin, T., Pan, J., Cao, S., Shen, S.: A General Optimization-based Framework for Local Odometry Estimation with Multiple Sensors. ArXiv (2019)" + }, + { + "type": "list", + "bbox": [ + 0.077, + 0.057, + 0.923, + 0.949 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.016, + 0.841, + 0.032 + ], + "angle": 0, + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + }, + { + "type": "page_number", + "bbox": [ + 0.893, + 0.018, + 0.92, + 0.031 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.077, + 0.057, + 0.922, + 0.111 + ], + "angle": 0, + "content": "38. Schmuck, P., Chli, M.: CCM-SLAM: Robust and Efficient Centralized Collaborative Monocular Simultaneous Localization and Mapping for Robotic Teams. J. Fld. Rob. 36(4), 763-781 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.077, + 0.112, + 0.92, + 0.147 + ], + "angle": 0, + "content": "39. Schubert, D., Demmel, N., Usenko, V., Stuckler, J., Cremers, D.: Direct Sparse Odometry With Rolling Shutter. In: Eur. Conf. Comput. Vis. pp. 682-697 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.148, + 0.921, + 0.2 + ], + "angle": 0, + "content": "40. Sommer, C., Usenko, V., Schubert, D., Demmel, N., Cremers, D.: Efficient Derivative Computation for Cumulative B-Splines on Lie Groups. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11145-11153 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.201, + 0.92, + 0.254 + ], + "angle": 0, + "content": "41. Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle Adjustment - A Modern Synthesis. In: Vision Algorithms: Theory and Practice. pp. 298-372 (2000)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.255, + 0.921, + 0.307 + ], + "angle": 0, + "content": "42. Usenko, V., Demmel, N., Schubert, D., Stuckler, J., Cremers, D.: Visual-Inertial Mapping With Non-linear Factor Recovery. IEEE Rob. Aut. Letters 5(2), 422-429 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.308, + 0.921, + 0.343 + ], + "angle": 0, + "content": "43. Wang, R., Schworer, M., Cremers, D.: Stereo DSO: Large-scale Direct Sparse Visual Odometry with Stereo Cameras. In: Int. Conf. Comput. Vis. pp. 3903-3911 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.344, + 0.921, + 0.396 + ], + "angle": 0, + "content": "44. Wang, S., Clark, R., Wen, H., Trigoni, N.: DeepVO: Towards end-to-end Visual Odometry with Deep Recurrent Convolutional Neural Networks. In: IEEE Int. Conf. Rob. Aut. pp. 2043-2050 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.397, + 0.921, + 0.45 + ], + "angle": 0, + "content": "45. Wang, X., Xue, F., Yan, Z., Dong, W., Wang, Q., Zha, H.: Continuous-Time Stereo Visual Odometry Based on Dynamics Model. In: Asian Conf. Comput. Vis. pp. 388-403 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.078, + 0.451, + 0.921, + 0.485 + ], + "angle": 0, + "content": "46. Yang, A.J., Cui, C., Bardsan, I.A., Urtasun, R., Wang, S.: Asynchronous Multi-view SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5669-5676 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.077, + 0.057, + 0.922, + 0.485 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git "a/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_origin.pdf" "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_origin.pdf" new file mode 100644 index 0000000000000000000000000000000000000000..35e2399524412430ac4d5047e37482a7421e6a9d --- /dev/null +++ "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/f4560473-9318-445b-99ca-e894e9617072_origin.pdf" @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:920d83c1de9d83e6887eab849063a7e2482b9a6a0626f244ac0e01fdc105047e +size 2340113 diff --git "a/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/full.md" "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/full.md" new file mode 100644 index 0000000000000000000000000000000000000000..87a6729e2c9d6071f7d8daa0cfcd33f1f2d53e3e --- /dev/null +++ "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/full.md" @@ -0,0 +1,416 @@ +# Hyperion - A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM + +David Hug1, Ignacio Alzugaray2, and Margarita Chli1,3 + +$^{1}$ Vision for Robotics Lab, ETH Zürich, Zürich, Switzerland + $^{2}$ Dyson Robotics Lab, Imperial College London, London, United Kingdom + $^{3}$ Vision for Robotics Lab, University of Cyprus, Nicosia, Cyprus + +Abstract. Continuous-Time Simultaneous Localization And Mapping (CTSLAM) has become a promising approach for fusing asynchronous and multi-modal sensor suites. Unlike discrete-time SLAM, which estimates poses discretely, CTSLAM uses continuous-time motion parametrizations, facilitating the integration of a variety of sensors such as rolling-shutter cameras, event cameras and Inertial Measurement Units (IMUs). However, CTSLAM approaches remain computationally demanding and are conventionally posed as centralized Non-Linear Least Squares (NLLS) optimizations. Targeting these limitations, we not only present the fastest SymForce-based [22] B- and Z-Spline implementations achieving speedups between $2.43\mathrm{x}$ and $110.31\mathrm{x}$ over Sommer et al. [40] but also implement a novel continuous-time Gaussian Belief Propagation (GBP) framework, coined Hyperion, which targets decentralized probabilistic inference across agents. We demonstrate the efficacy of our method in motion tracking and localization settings, complemented by empirical ablation studies. + +Code: https://github.com/VIS4ROB-lab/hyperion + +Keywords: Gaussian Belief Propagation $\cdot$ Continuous-Time SLAM $\cdot$ Distributed Non-Linear Least Squares Optimization $\cdot$ B- and Z-Splines + +# 1 Introduction + +Estimating a sensor-suite's ego-motion and workspace employing Simultaneous Localization And Mapping (SLAM) techniques, has long been studied using a wide variety of sensing modalities, such as vision sensors [35,39,43,46], IMUs [7,18,36], Global Positioning System (GPS) feeds [21, 23], and laser ranging [9] sensors. Unlike traditional, discrete-time approaches, which require careful synchronization of sensory measurements due to the discretization of motion-parametrizing states, Continuous-Time Simultaneous Localization And Mapping (CTSLAM) [9,12,13, 15,33] offers native support for the fusion of asynchronous measurements due to its continuous-time parametrization that yields pose, velocity and acceleration estimates at arbitrary instances in time. + +Despite their advantages, CTSLAM approaches often entail higher computational complexity than conventional approaches, which somewhat hinders their + +![](images/880a72859e038ce470de5e86e040e91632612a1dd55bb859e91893c0f777c18d.jpg) +(a) At initialization + +![](images/5cc37deb828f995f589cb6ee44425b7e0da44486bbedd1ef3c3b0958d90472e4.jpg) +(b) After the $1^{\mathrm{st}}$ iteration +Fig. 1: Both the proposed continuous-time GBP solver (in magenta) and the conventional NLLS solver [1] (in white) converge to identical solutions close to the ground truth (in green) even under poor initialization ( $\pm 1.00 \, \mathrm{m / rad}$ ) and substantial pose measurement noise ( $\pm 0.05 \, \mathrm{m / rad}$ ). + +![](images/2c53a95439bee51e238547e090013378be339e05e5505e123a7287d7a7309328.jpg) +(c) Absolute Error + +deployment in real-world scenarios. In addition, most (discrete- and continuous-time) SLAM systems pose the underlying optimization as a centralized Non-Linear Least Squares (NLLS) problem, which, without further modifications, strictly limits their applicability to single-agent setups. + +Thus, novel, decentralized algorithms along with more effective continuous-time motion parametrizations are paramount in the quest to overcome existing challenges in traditional, centralized CTSLAM techniques. Distributed methods such as GBP are especially promising given that they, in contrast to conventional NLLS paradigms, achieve iterative, probabilistic inference through message-passing between individual nodes and factors in a factor graph and that they operate in a distributed and asynchronous manner by nature rendering them inherently scalable, even across multiple agents. In addition, GBP also explicitly models the uncertainties of estimizable quantities, which can be leveraged to selectively direct computational resources to non-converged nodes in the graph. This circumstance is especially promising in the context of CTSLAM where effective allocation of computational resources towards the least certain estimates promises to further reduce their computational complexity. + +This work, in particular, pushes the performance envelope of B- and Z-Splines and devises an innovative, distributed optimization strategy for CTSLAM using GBP. Whilst the need for faster continuous-time parametrizations is self-evident, we also specifically target the absence of a distributed, continuous-time state estimation framework. Such a framework, not only promises flexible resource allocation and decentralized state estimation but also allows fusing asynchronous measurements. Here, we showcase the practicality of the proposed continuous-time GBP framework and provide it as an open-source implementation to encourage benchmarking. In addition to these contributions, this work also + +- offers the fastest, fully analytic B- and Z-Spline implementations to date, +- presents a novel, symbolic GBP-based framework for continuous-time SLAM, +- demonstrates the suitability of the proposed method in practical setups, and +- provides detailed ablation studies on the algorithm itself. + +# 2 Related Work + +The SLAM problem has long been researched as it comprises the core of robotic perception, with seminal works focusing on discrete-time, monocular [26, 36] and stereo setups [35, 37], as well as works which propose fusion of additional sensing information, such as inertial [5-7, 19], and laser ranging [9]. In addition to these feature-based approaches to SLAM, alternative powerful paradigms have been proposed, such as direct methods [10, 11] and machine-learning based techniques [24, 44] have been demonstrated to be beneficial in some scenarios. + +In contrast to traditional, discrete-time SLAM methods that have been widely adopted, CTSLAM techniques have early on been demonstrated to exhibit great potential for high-fidelity and continuous estimates of motion [2, 12, 13, 15, 20, 25, 42, 45], albeit posing fundamental scientific and algorithmic challenges. The key advantage of these methods lies in their inherent capability to fuse unsynchronized and asynchronous measurements (e.g. from a rolling shutter camera or an event-based vision sensor) in the estimation processes, in contrast to conventional approaches. However, the wider adoption of CTSLAM techniques remains impeded by challenges in finding more efficient motion representations, addressing convergence issues as well as overcoming computational limitations, missing out on the promise for high-fidelity motion and scene estimation. + +Following promising leads in fundamental SLAM research for single agents, a novel challenge and desire to deploy the same techniques in collaborative, multi-agent setups arose. Works such as [38] proposed means to address centralized multi-agent SLAM, while [18] investigated the advantages of variable-stereo baseline setups, which leverage the views from two agents to boost the accuracy of high-altitude depth estimates. A common approach to solve NLLS optimizations in a distributed fashion is based on Alternating Direction Method of Multipliers (ADMM) approaches similar to the work in [34] and [3], which leverage the use of dual residuals to ensure consistent estimates across distributed multi-agent NLLS optimizations. Orthogonally, GBP approaches [8, 28, 30, 32] can perform distributed and asynchronous inference of states via an equivalent message-passing scheme, making them ideal candidates to address multi-agent SLAM. + +In this work, we build upon these ideas, consolidate a distributed GBP optimization with a continuous-time parametrization, and demonstrate the suitability of the novel, combined method in practical setups. + +# 3 Methodology + +# 3.1 Preliminaries + +All Simultaneous Localization And Mapping (SLAM) algorithms, in essence, aim to estimate an optimal, cost-minimizing set of estimizable parameters $\Theta$ which are set to describe a collection of noisy sensory measurements $m$ with the highest possible accuracy. Specifically, in its NLLS formulation, this optimal solution is found by minimization of the cumulative cost over a set of weighted residuals $\bar{r}$ associated with measurements $m$ stemming from a connected sensor + +![](images/a5794792b9b6a0599496a3c4d1a5c0a4997a3d5c9713592131dbe323b2f4130a.jpg) +Fig. 2: For every (valid) instance in time $t$ , a collection of adjacent bases (in orange) gives rise to an individual segment (in green) of a cubic B-Spline. An interpolated pose at query time $t$ is then obtained from the (cumulative) blending of these bases. + +$s$ . A weighted residuals $\bar{\pmb{r}}$ at measurement time $t$ is computed by comparing a predicted measurement $\hat{\pmb{m}}(t, \pmb{\theta}_s)$ with sensor-associated parameters $\pmb{\theta}_s \subseteq \pmb{\Theta}$ to a measured one $\pmb{m}(t)$ through the application of a metric $\pmb{\mu}$ (i.e. $\hat{x} \boxminus_{\pmb{\mu}} x$ ) and a subsequent weighting via the square-root information $\Omega_m$ according to + +$$ +\boldsymbol {r} (t, \boldsymbol {\theta} _ {s}) = \hat {\boldsymbol {m}} (t, \boldsymbol {\theta} _ {s}) \boxminus_ {\boldsymbol {\mu}} \boldsymbol {m} (t) \text {a n d} \tag {1} +$$ + +$$ +\left\| \bar {\boldsymbol {r}} \right\| ^ {2} = \bar {\boldsymbol {r}} ^ {\top} \bar {\boldsymbol {r}} = \boldsymbol {r} ^ {\top} \boldsymbol {\Omega} _ {m} ^ {\top} \boldsymbol {\Omega} _ {m} \boldsymbol {r} = \boldsymbol {r} ^ {\top} \boldsymbol {\Lambda} _ {m} \boldsymbol {r} = \boldsymbol {r} ^ {\top} \boldsymbol {\Sigma} _ {m} ^ {- 1} \boldsymbol {r}, \tag {2} +$$ + +where $\pmb{\Sigma}_{m}$ and $\pmb{\Lambda}_{m}$ are the covariance and precision matrix, respectively. Ultimately, we aim to minimize the sum over residuals stemming from all connected sensors $S$ and their associated measurements $\mathcal{M}_s$ with measurement times $\mathcal{T}_s$ . To this end, established NLLS solvers [1] are commonly deployed in practice, which aim to obtain the optimal, cost-minimizing parameters $\Theta^{*}$ as defined below. + +$$ +\boldsymbol {\Theta} ^ {*} = \underset {\boldsymbol {\Theta}} {\operatorname {a r g m i n}} \left[ \sum_ {s \in \mathcal {S}} \sum_ {t \in \mathcal {T} _ {s}} \frac {1}{2} \| \bar {\boldsymbol {r}} (t, \boldsymbol {\theta} _ {s}) \| ^ {2} \right]. \tag {3} +$$ + +# 3.2 Continuous-Time Motion + +In recent times, continuous-time formulations of conventional SLAM algorithms have been studied by multiple authors [12, 13, 15, 16, 20, 40], where the most common motion parametrization is based on the concept of cubic B-Splines. This practice is rooted in several favorable properties of B-Splines, such as their compact representation, finite support, analytic Jacobians, and their $\mathcal{C}_2$ -continuity for predicting instantaneous velocities and accelerations. In this work, we utilize split interpolations for world-to-body transformations $T_{wb}(t) \in \mathbb{S}\mathbb{E}(3)$ , illustrated in Fig. 2, that separately parametrize rotations $R_{wb}(t) \in \mathbb{S}\mathbb{O}(3)$ and translations $t_{wb}(t) \in \mathbb{R}^3$ . In particular, we compute transformations $T_{wb}(t)$ using + +$$ +\boldsymbol {T} _ {w b} (t) = \left[ \begin{array}{c c} \boldsymbol {R} _ {w b} (\boldsymbol {q} _ {w b} (t)) & \boldsymbol {t} _ {w b} (t) \\ \boldsymbol {0} & 1 \end{array} \right] \in \mathbb {S E} (3) \text {w i t h} \tag {4} +$$ + +$$ +\boldsymbol {q} _ {w b} (t) = \boldsymbol {q} _ {w i} * \prod_ {j = 1} ^ {k} \left(\boldsymbol {q} _ {w (i + j - 1)} ^ {- 1} * \boldsymbol {q} _ {w (i + j)}\right) ^ {\lambda_ {j} (t)} \tag {5} +$$ + +$$ +\boldsymbol {t} _ {w b} (t) = \boldsymbol {t} _ {w i} + \sum_ {j = 1} ^ {k} \left[ \lambda_ {j} (t) \left(\boldsymbol {t} _ {w (i + j)} - \boldsymbol {t} _ {w (i + j - 1)}\right) \right], \tag {6} +$$ + +where individual evaluations of $T_{wb}(t)$ depend on a collection of bases $\{\mathcal{B}_i, \dots, \mathcal{B}_{i+k}\}$ (see Fig. 2) and each basis $\mathcal{B}_i$ comprises a time $t_i$ , a quaternion $q_{wi}$ and a translation $t_{wi}$ . Above, $k$ is the Degree of Freedom (DoF) of the B-/Z-Spline, rotations $R_{wb}(t)$ are parametrized by quaternions $q_{wb}(t)$ and the expression $\lambda_j(t)$ serves as a placeholder for concrete interpolation coefficients found in [4, 15, 17, 20]. + +# 3.3 Continuous-Time Optimization + +In its probabilistic formulation [30, 32], the non-linear minimization problem from Eq. (3) is equivalent to finding an optimal probability distribution that accounts for all acquired measurements. Without loss of generality, one can also represent the problem as a product of factors $f_{i} \propto e^{-E_{i}(\pmb{\theta}_{i})}$ with induced energies $E_{i}(\pmb{\theta}_{i})$ , arriving at the modified expression to obtain the optimal parameters $\pmb{\Theta}^{*}$ . + +$$ +\boldsymbol {\Theta} ^ {*} = \underset {\boldsymbol {\Theta}} {\operatorname {a r g m a x}} \log (p (\boldsymbol {\Theta})) = \underset {\boldsymbol {\Theta}} {\operatorname {a r g m i n}} \sum_ {i} E _ {i} \left(t _ {i}, \boldsymbol {\theta} _ {i}\right) \text {w i t h} \tag {7} +$$ + +$$ +p (\boldsymbol {\Theta}) = \prod_ {i} f _ {i} \left(t _ {i}, \boldsymbol {\theta} _ {i}\right) \propto \prod_ {i} e ^ {- E _ {i} \left(t _ {i}, \boldsymbol {\theta} _ {i}\right)}. \tag {8} +$$ + +In this work, we use multi-variant Gaussians $\mathcal{N}(\pmb{\mu}_i, \pmb{\Sigma}_i)$ to model the factors $f_i$ in Eq. (8), linking the energies in Eq. (7) to the residuals in Eq. (2) according to + +$$ +E _ {i} \left(t _ {i}, \boldsymbol {\theta} _ {i}\right) = \left\| \bar {\boldsymbol {r}} _ {i} \right\| ^ {2} = \boldsymbol {r} _ {i} ^ {\top} \left(t _ {i}, \boldsymbol {\theta} _ {i}\right) \boldsymbol {\Omega} _ {i} ^ {\top} \boldsymbol {\Omega} _ {i} \boldsymbol {r} _ {i} \left(t _ {i}, \boldsymbol {\theta} _ {i}\right). \tag {9} +$$ + +The generic residuals $\bar{\pmb{r}}_i$ themselves are non-linear with a corresponding Taylor expansions in $\pmb{\theta}_i$ around some linearization point $\pmb{\theta}_i^0$ such that + +$$ +\bar {\boldsymbol {r}} _ {i} \left(\boldsymbol {\theta} _ {i}\right) - \bar {\boldsymbol {r}} _ {i} \left(\boldsymbol {\theta} _ {i} ^ {0}\right) \approx D \bar {\boldsymbol {r}} _ {i} \left(\boldsymbol {\theta} _ {i} ^ {0}\right) \left(\boldsymbol {\theta} _ {i} - \boldsymbol {\theta} _ {i} ^ {0}\right) = \bar {\boldsymbol {J}} _ {i} ^ {0} \left(\boldsymbol {\theta} _ {i} - \boldsymbol {\theta} _ {i} ^ {0}\right) = \bar {\boldsymbol {J}} _ {i} ^ {0} \boldsymbol {\tau} _ {i} ^ {0}. \tag {10} +$$ + +Furthermore, all factors $f_{i}$ , their energies $E_{i}(t_{i},\pmb{\theta}_{i})$ respectively, can also be converted to an equivalent, incremental information form $\mathcal{N}^{-1}(\pmb{\eta}_i^0,\pmb{\Lambda}_i^0)$ , yielding + +$$ +E _ {i} \left(t _ {i}, \boldsymbol {\tau} _ {i} ^ {0}\right) \approx \frac {1}{2} \boldsymbol {\tau} _ {i} ^ {0, \top} \boldsymbol {\Lambda} _ {i} ^ {0} \boldsymbol {\tau} _ {i} ^ {0} - \boldsymbol {\tau} _ {i} ^ {0, \top} \boldsymbol {\eta} _ {i} ^ {0} \quad \text {w h e r e} \tag {11} +$$ + +$$ +\boldsymbol {\eta} _ {i} ^ {0} = - \bar {\boldsymbol {J}} _ {i} ^ {0, \top} \bar {\boldsymbol {r}} _ {i} ^ {0} \quad \text {a n d} \quad \boldsymbol {\Lambda} _ {i} ^ {0} = \bar {\boldsymbol {J}} _ {i} ^ {0, \top} \bar {\boldsymbol {J}} _ {i} ^ {0}. \tag {12} +$$ + +This dual representation of factors $f_{i}$ and the existence of the Gaussian $\mathcal{N}$ and its inverse $\mathcal{N}^{-1}$ is vital for efficient conditioning and marginalization of individual terms in the GBP algorithm presented in the next section. + +![](images/e9cbb42702f7687243747090f2e2f9c99a7521e08a624871189b625df04a8039.jpg) +(a) Factor Graph + +![](images/ece40848923e6c99ad24958d2e65dc8478d19c5b165985e6ced635208647bd57.jpg) +(b) Message Passing +Fig. 3: (a) Qualitative illustration of the factor graphs resulting from a continuous-time motion parametrization. Notably, even one of the simplest factor archetypes, which purely relies on the motion-parameterizing nodes as well as some landmarks, introduces a considerable amount of loops in the continuous-time realm. This can be attributed to the fact that poses $T_{wb}(t)$ depend on multiple bases for any given time $t$ . (b) Visualization of the message passing algorithm between nodes and factors in a graph $\mathcal{G}$ . + +Gaussian Belief Propagation (GBP) As illustrated in Fig. 3a, Eqs. (3) and (7) expose equivalent visual representations as factor graphs, giving rise to compact and intuitive descriptions of complex probabilistic dependencies which are encoded into bipartite graphs $\mathcal{G}$ containing factors $f_{i} \sim \mathcal{N}^{-1}(\pmb{\eta}_{f_{i}}, \pmb{\Lambda}_{f_{i}})$ and nodes $n_j \sim \mathcal{N}(\pmb{\mu}_{n_j}, \pmb{\Sigma}_{n_j}) = \mathcal{N}^{-1}(\pmb{\eta}_{n_j}, \pmb{\Lambda}_{n_j})$ . Intuitively, the GBP algorithm, thus, comprises two steps to iteratively solve for the optimal solution to Eq. (7), namely node and factor updates with intermediate factor-to-node $\pmb{m}_{f_i \rightarrow n_j}$ and node-to-factor $\pmb{m}_{n_j \rightarrow f_i}$ message passing detailed in the following. + +Node Updates: The Gaussian nodes $n_j \in \mathcal{G}$ with neighborhood $N(n_j)$ of connected factors $f_i \in N(n_j)$ are updated by taking the product over incoming factor-to-node messages $\pmb{m}_{f_i \to n_j}$ , which reduces to a simple summation of Gaussians for (linear) vector spaces, resulting in node beliefs $B(n_j) = \mathcal{N}^{-1}(\pmb{\eta}_{n_j}, \pmb{\Lambda}_{n_j})$ , where + +$$ +\boldsymbol {\eta} _ {n _ {j}} = \boldsymbol {\eta} _ {n _ {j}} ^ {p} + \sum_ {f _ {i} \in N (n _ {j})} \boldsymbol {\eta} _ {f _ {i} \rightarrow n _ {j}} \quad \text {a n d} \quad \boldsymbol {\Lambda} _ {n _ {j}} = \boldsymbol {\Lambda} _ {n _ {j}} ^ {p} + \sum_ {f _ {i} \in N (n _ {j})} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {j}}. \tag {13} +$$ + +Above, $P(n_{j}) = \mathcal{N}^{-1}(\pmb{\eta}_{n_{j}}^{p},\pmb{\Lambda}_{n_{j}}^{p})$ denotes a known prior on the node belief $B(n_{j})$ which can be leveraged to better constrain the problem in practice. However, despite its simplicity and elegance, this straightforward approach can not be applied to Lie groups $G$ with associated tangent space $\mathfrak{g}$ and their operators $\boxminus : G \times G \mapsto \mathfrak{g}$ and $\boxplus : G \times \mathfrak{g} \mapsto G$ extensively used in robotics. Hence, a more sophisticated approach is required to obtain the product of factor-to-node messages and to handle frame conversions between elements in the Lie group. + +To this end, we follow a similar strategy as Murai et al. [28] and propose the use of a Mixed Gaussian Representation (MGR) to parameterize Lie-group-valued nodes as $n_j \sim \mathfrak{N}(\pmb{\mu}_{n_j}, \pmb{\Lambda}_{n_j})$ , where $\pmb{\mu}_{n_j} \in G$ and $\pmb{\Lambda}_{n_j} \in \mathbb{R}^{\dim(\mathfrak{g}) \times \dim(\mathfrak{g})}$ , also assuming that incoming message $\pmb{m}_{f_i \to n_j} \sim \mathfrak{N}(\pmb{\mu}_{f_i \to n_j}, \pmb{\Lambda}_{f_i \to n_j})$ take the same form. In contrast to conventional vector spaces, the precision matrices are expressed relative to their associated elements in the Lie group, implying that + +one must warp them to a privileged frame of reference. An intuitive choice for such a frame is the latest estimate of the node's state, denoted as $\pmb{\mu}_{n_j}^0$ and $\pmb{\Lambda}_{n_j}^0$ , resulting in the following transformation rules to warp the messages. + +$$ +\boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {j}} ^ {0} = \boldsymbol {\mu} _ {f _ {i} \rightarrow n _ {j}} \boxminus \boldsymbol {\mu} _ {n _ {j}} ^ {0} \quad \in \mathbb {R} ^ {\dim (\mathfrak {g})} \tag {14} +$$ + +$$ +\boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {j}} ^ {0} = \left[ \frac {\partial \boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {j}} ^ {0}}{\partial \boldsymbol {\mu} _ {f _ {i} \rightarrow n _ {j}}} \right] ^ {\top} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {j}} \left[ \frac {\partial \boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {j}} ^ {0}}{\partial \boldsymbol {\mu} _ {f _ {i} \rightarrow n _ {j}}} \right] \quad \in \mathbb {R} ^ {\dim (\mathfrak {g}) \times \dim (\mathfrak {g})} \tag {15} +$$ + +After this conversion, both $\pmb{\tau}_{f_i\rightarrow n_j}^0$ and $\pmb{\Lambda}_{f_i\rightarrow n_j}^0$ are elements in the tangent (matrix) space relative to the privileged frame and must then be summed in analogy to Eq. (13) to yield the intermediate, incremental values + +$$ +\boldsymbol {\tau} _ {n _ {j}} ^ {+} = \alpha_ {n _ {j}} \sum_ {f _ {i} \in N (n _ {j})} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {j}} ^ {0} \boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {j}} ^ {0} \quad \text {a n d} \quad \boldsymbol {\Lambda} _ {n _ {j}} ^ {+} = \sum_ {f _ {i} \in N (n _ {j})} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {j}} ^ {0}, \tag {16} +$$ + +where $\alpha_{n_j}$ denotes an optional step size. The above increments must then again be warped to the updated frame of reference by evaluating + +$$ +\boldsymbol {\mu} _ {n _ {j}} = \boldsymbol {\mu} _ {n _ {j}} ^ {0} \boxplus \boldsymbol {\tau} _ {n _ {j}} ^ {+} \quad \text {a n d} \quad \boldsymbol {\Lambda} _ {n _ {j}} = \left[ \frac {\partial \boldsymbol {\mu} _ {n _ {j}}}{\partial \boldsymbol {\tau} _ {n _ {j}} ^ {+}} \right] ^ {\top} \boldsymbol {\Lambda} _ {n _ {j}} ^ {+} \left[ \frac {\partial \boldsymbol {\mu} _ {n _ {j}}}{\partial \boldsymbol {\tau} _ {n _ {j}} ^ {+}} \right]. \tag {17} +$$ + +Note, however, that priors can not be injected as simplistically as in Eq. (13) and need to be treated as proper factors in the context of Lie groups instead. + +Node-to-factor Messages: The generation of node-to-factor messages mirrors the expressions from Eq. (16), differing only in excluding information stemming from the target factor in the sums. Hence, they encompass + +$$ +\boldsymbol {\tau} _ {n _ {j} \rightarrow f _ {k}} ^ {+} = \sum_ {f _ {i} \in N (n _ {j}) \backslash f _ {k}} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {j}} ^ {0} \boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {j}} ^ {0} \quad \text {a n d} \quad \boldsymbol {\Lambda} _ {n _ {j} \rightarrow f _ {k}} ^ {+} = \sum_ {f _ {i} \in N (n _ {j}) \backslash f _ {k}} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {j}} ^ {0} \tag {18} +$$ + +alongside their respective linearization point $\pmb{\mu}_{n_j}^0$ to form the outgoing message triplet $(\pmb{\mu}_{n_j}^0, \pmb{\tau}_{n_j \to f_k}^+, \pmb{\Lambda}_{n_j \to f_k}^+)$ destined for the factor $f_k$ . Note, however, that another reevaluation of Eqs. (14) and (15) is required to generate outgoing messages that leverage the latest state estimate from Eq. (17). + +Factor Updates: In analogy to previous paragraphs, factors $f_{i} \in \mathcal{G}$ depend on a collection of connected, neighboring nodes $N(f_{i})$ which collectively determine the linearization point $\pmb{\theta}_{f_i}^0$ for the residual evaluation $\bar{\pmb{r}}_{f_i}$ from Eq. (2). The computation of the factor-to-node messages $m_{f_i \to N(f_i)}$ depends on the factor beliefs $B(f_{i}) = \mathcal{N}^{-1}(\pmb{\eta}_{f_{i}}^{0},\pmb{\Lambda}_{f_{i}}^{0})$ obtained from Eq. (12) as well as the auxiliary, intermediate quantities $\pmb{\eta}_{f_i}'$ and $\pmb{\Lambda}_{f_i}'$ (used in the next paragraph) defined as + +$$ +\boldsymbol {\eta} _ {f _ {i}} ^ {\prime} = \boldsymbol {\eta} _ {f _ {i}} ^ {0} + \boldsymbol {\eta} _ {N (f _ {i}) \rightarrow f _ {i}} ^ {+} \quad \text {a n d} \quad \boldsymbol {\Lambda} _ {f _ {i}} ^ {\prime} = \boldsymbol {\Lambda} _ {f _ {i}} ^ {0} + \boldsymbol {\Lambda} _ {N (f _ {i}) \rightarrow f _ {i}} ^ {+} \tag {19} +$$ + +Above, $\pmb{\eta}_{N(f_i)\rightarrow f_i}^+$ and $\pmb{\Lambda}_{N(f_i)\rightarrow f_i}^+$ denote stacked vector and block diagonal matrix versions of the neighborhood-to-factor messages (see Eqs. (20) and (21)). + +Factor-to-Node Messages: We illustrate the computation of the factor-to-node messages (see Fig. 3b) assuming a factor $f_{i}$ which depends on two nodes, namely $n_a$ and $n_b$ . Thus, Eq. (19) takes the following form + +$$ +\boldsymbol {\eta} _ {f _ {i}} ^ {\prime} = \left[\begin{array}{l}\boldsymbol {\eta} _ {a} ^ {\prime}\\\boldsymbol {\eta} _ {b} ^ {\prime}\end{array}\right] = \boldsymbol {\eta} _ {f _ {i}} ^ {0} + \left[\begin{array}{c}\boldsymbol {\eta} _ {n _ {a} \rightarrow f _ {i}} ^ {+}\\\boldsymbol {\eta} _ {n _ {b} \rightarrow f _ {i}} ^ {+}\end{array}\right] \tag {20} +$$ + +$$ +\boldsymbol {\Lambda} _ {f _ {i}} ^ {\prime} = \left[\begin{array}{l l}\boldsymbol {\Lambda} _ {a a} ^ {\prime}&\boldsymbol {\Lambda} _ {b a} ^ {\prime \top}\\\boldsymbol {\Lambda} _ {b a} ^ {\prime}&\boldsymbol {\Lambda} _ {b b} ^ {\prime}\end{array}\right] = \boldsymbol {\Lambda} _ {f _ {i}} ^ {0} + \left[\begin{array}{c c}\boldsymbol {\Lambda} _ {n _ {a} \rightarrow f _ {i}} ^ {+}&\mathbf {0}\\\mathbf {0}&\boldsymbol {\Lambda} _ {n _ {b} \rightarrow f _ {i}} ^ {+}\end{array}\right]. \tag {21} +$$ + +To retrieve the message $\pmb{m}_{f_i\rightarrow n_a} = \mathfrak{N}(\pmb{\mu}_{f_i\rightarrow n_a},\pmb{\Lambda}_{f_i\rightarrow n_a})$ , the remaining nodes (i.e. $n_b$ in this example) must initially be marginalized by computing the Schur complement defined as + +$$ +\eta_ {f _ {i} \rightarrow n _ {a}} ^ {\prime} = \eta_ {a} ^ {0} - \Lambda_ {b a} ^ {\prime \top} \Lambda_ {b b} ^ {\prime - 1} \eta_ {b} ^ {\prime} \quad \text {a n d} \quad \Lambda_ {f _ {i} \rightarrow n _ {a}} ^ {\prime} = \Lambda_ {a a} ^ {0} - \Lambda_ {b a} ^ {\prime \top} \Lambda_ {b b} ^ {\prime - 1} \Lambda_ {b a} ^ {\prime}. \tag {22} +$$ + +In a similar vein, one obtains $\pmb{m}_{f_i \to n_b}$ by permuting $\pmb{\eta}_{f_i}'$ and $\pmb{\Lambda}_{f_i}'$ such that $n_a$ is marginalized instead of $n_b$ . In particular, + +$$ +\left[ \begin{array}{l} \boldsymbol {\eta} _ {b} ^ {\prime} \\ \boldsymbol {\eta} _ {a} ^ {\prime} \end{array} \right] = P \boldsymbol {\eta} _ {f _ {i}} ^ {\prime} \text {a n d} \left[ \begin{array}{c c} \boldsymbol {\Lambda} _ {b b} ^ {\prime} & \boldsymbol {\Lambda} _ {a b} ^ {\prime \top} \\ \boldsymbol {\Lambda} _ {a b} ^ {\prime} & \boldsymbol {\Lambda} _ {a a} ^ {\prime} \end{array} \right] = P \boldsymbol {\Lambda} _ {f _ {i}} ^ {\prime} P ^ {\top}, \tag {23} +$$ + +which also naturally extends to factors touching more than two nodes. Readers might notice that our formulation differs from others found in the literature; this has the advantage that the formulations from Eqs. (20) and (21) allow for extremely efficient in-place permutations of $\pmb{\eta}_{f_i}^{\prime}$ and $\pmb{\Lambda}_{f_i}^{\prime}$ to marginalize many-node factors, limiting reallocations and recomputations. Mirroring the process in Eq. (17), it is necessary to convert the incremental values $\pmb{\eta}_{f_i\rightarrow n_a}^{\prime}$ and $\pmb{\Lambda}_{f_i\rightarrow n_a}^{\prime}$ into the updated, outgoing frame of reference, to obtain the message $\pmb{m}_{f_i\rightarrow n_a}$ , relying on an optional step size $\alpha_{f_i}$ . That is + +$$ +\boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {a}} ^ {\prime} = \alpha_ {f _ {i}} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {a}} ^ {\prime - 1} \boldsymbol {\eta} _ {f _ {i} \rightarrow n _ {a}} ^ {\prime} \in \mathbb {R} ^ {\dim (\mathfrak {g})}, \quad \boldsymbol {\mu} _ {f _ {i} \rightarrow n _ {a}} = \boldsymbol {\mu} _ {n _ {a}} ^ {0} \boxplus \boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {a}} ^ {\prime} \in G \tag {24} +$$ + +$$ +\text {a n d} \quad \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {a}} = \left[ \frac {\partial \boldsymbol {\mu} _ {f _ {i} \rightarrow n _ {a}}}{\partial \boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {a}} ^ {\prime}} \right] ^ {\top} \boldsymbol {\Lambda} _ {f _ {i} \rightarrow n _ {a}} ^ {\prime} \left[ \frac {\partial \boldsymbol {\mu} _ {f _ {i} \rightarrow n _ {a}}}{\partial \boldsymbol {\tau} _ {f _ {i} \rightarrow n _ {a}} ^ {\prime}} \right] \in \mathbb {R} ^ {\dim (\mathfrak {g}) \times \dim (\mathfrak {g})}. \tag {25} +$$ + +Robust Residuals and Energies: It is well understood that the presence of outliers in the optimization problem from Eq. (3) causes substantial issues in terms of converging to a globally optimal solution $\Theta^{*}$ due to the quadratic nature of the occurring cost terms. The same holds in the context of GBP, where outliers are bound to heavily influence the found solution as well. To address this issue we take inspiration from established NLLS approaches [1] and apply robust loss functions $\rho$ to Eqs. (3) and (9), resulting in modified expressions for the robust energies $\vec{E}$ and the robust optimal solution $\check{\Theta}^{*}$ , provided for completeness only. + +$$ +\check {E} (t, \boldsymbol {\theta} _ {s}) = \frac {1}{2} \rho (\bar {\boldsymbol {r}} ^ {\top} \bar {\boldsymbol {r}}) \tag {26} +$$ + +$$ +\breve {\boldsymbol {\theta}} ^ {*} = \underset {\boldsymbol {\Theta}} {\operatorname {a r g m i n}} \left[ \sum_ {s \in \mathcal {S}} \sum_ {t \in \mathcal {T} _ {s}} \breve {E} (t, \boldsymbol {\theta} _ {s}) \right] \tag {27} +$$ + +In particular, based on the methodology from Triggs et al. [41], the robust residual and Jacobian then take the following forms. + +$$ +\alpha^ {2} - 2 \alpha - \frac {2 \rho^ {\prime \prime}}{\rho^ {\prime}} \bar {\boldsymbol {r}} _ {i} ^ {\top} \bar {\boldsymbol {r}} _ {i} \stackrel {!} {=} 0 \tag {28} +$$ + +$$ +\check {\boldsymbol {r}} _ {i} = \frac {\sqrt {\rho^ {\prime}}}{1 - \alpha} \bar {\boldsymbol {r}} _ {i} \quad \check {\boldsymbol {J}} _ {i} = \sqrt {\rho^ {\prime}} \left(1 - \alpha \frac {\bar {\boldsymbol {r}} _ {i} \bar {\boldsymbol {r}} _ {i} ^ {\top}}{\| \bar {\boldsymbol {r}} _ {i} \| ^ {2}}\right) \bar {\boldsymbol {J}} _ {i} \tag {29} +$$ + +Non-Gaussian Nodes: Another extension to conventional GBP lies in classifying Gaussian nodes as either pure constants or as stochastic variables. This distinction streamlines computation given that the message marginalization $\pmb{m}_{n_j\rightarrow f_i}$ across nodes via Cholesky decomposition exposes complexity $\mathcal{O}(n^3)$ which quickly becomes prohibitive. In particular, allowing non-variable parameters (e.g. extrinsic, intrinsic, offset etc.) to be treated as pure constants considerably reduces the dimensionality of the marginalization procedure without any drawbacks. + +# 3.4 Sensor Models + +In the following, we detail the employed absolute and visual sensor models, where expressions marked with $\hat{\cdot}$ indicate estimizable parameters. Conversely, unless explicitly mentioned, all other variables are considered known and constant. + +Absolute Sensor Model The predictions of absolute sensor measurements $\hat{m}_s(t_m,\Theta_s)$ (e.g. absolute pose estimates extracted from AprilTags [29] or measurements obtained from a Motion Capture (MoCap) system) are evaluated using Eq. (30) and subsequently compared against their corresponding true measurements by applying the metric $\boxdot_{\mu}$ in Eq. (31) where we make use of the logarithmic map for elements in $\mathbb{S}\mathbb{O}(3)$ , and $\mathbb{SU}(2)$ respectively. + +$$ +\hat {\boldsymbol {m}} _ {s} \left(t _ {m}, \Theta_ {s}\right) = \hat {\boldsymbol {T}} _ {w s} \left(t _ {m}\right) = \hat {\boldsymbol {T}} _ {w b} \left(t _ {m}\right) \boldsymbol {T} _ {b s} \tag {30} +$$ + +$$ +\hat {\boldsymbol {T}} _ {w s} \boxminus_ {\boldsymbol {\mu}} \boldsymbol {T} _ {w s} = \left[ \begin{array}{c} \log (\hat {\boldsymbol {q}} _ {w s} \boldsymbol {q} _ {w s} ^ {- 1}) \\ \hat {\boldsymbol {t}} _ {w s} - \boldsymbol {t} _ {w s} \end{array} \right] \in \mathbb {R} ^ {6} \tag {31} +$$ + +Visual Sensor Model Abstracting from the specific camera parameters, such as its intrinsic and its distortion model, we introduce the mapping $\pi(\cdot)$ in Eq. (32) to infer individual projections of landmarks $l_w$ onto the image plane at time $t_m$ . For visual, pixel-based measurements, the metric $\boxdot_{\mu}$ is chosen to be equivalent to trivial Euclidean subtraction. + +$$ +\hat {\boldsymbol {m}} _ {s} \left(t _ {m}, \Theta_ {s}\right) = \hat {\boldsymbol {p}} _ {s} \left(t _ {m}\right) = \pi \left(\boldsymbol {T} _ {s b} \hat {\boldsymbol {T}} _ {b w} \left(t _ {m}\right), l _ {w}\right) \tag {32} +$$ + +$$ +\hat {\boldsymbol {p}} _ {s} \boxminus_ {\boldsymbol {\mu}} \boldsymbol {p} _ {s} = \hat {\boldsymbol {p}} _ {s} - \boldsymbol {p} _ {s} \in \mathbb {R} ^ {2} \tag {33} +$$ + +# 3.5 System + +Overview Our system is designed to efficiently support both batch and windowed optimizations, crucial for applications such as Bundle Adjustment (BA) and SLAM. Inspired by Ceres [1], it allows dynamic modification of nodes and factors between solver calls, features multiple solving strategies, namely synchronous and dropout, determining the order of node and factor updates and leverages multithreading to exploit the inherent parallelism of GBP methods, further boosting the overall performance. Optimizable parameters are added and removed in analogy to Ceres [1], with the notable distinction that GBP-based methods necessitate both an initial mean and covariance estimate for each parameter, unlike standard NLLS methods. This requirement, however, poses no practical hindrance as conservative guesses on the covariance suffice to bootstrap the algorithm. + +Symbolic Factors Targeting the long-standing challenge of obtaining efficient, analytical expressions and derivatives of spline-based motion parameterizations and their associated cost factors, here, we leverage SymForce [22], a symbolic code generation framework, to completely automate this cumbersome, time-intensive and error-prone process. Taking inspiration from Sommer et al. [40], who exploited Lie-group-specific properties to simplify spline-related mathematical expressions, we supercharge their recursive spline formulation by combining it with SymForce [22] to obtain ultra-efficient $\mathrm{C}++$ cost factor implementations. Furthermore, recognizing the broader relevance of automated factor generation for (continuous-time) robotics applications, our framework offers a comprehensive library featuring spline-based and standard factors designed to seamlessly interoperate with both our framework and Ceres [1], facilitating widespread adoption. + +Update Strategies Amongst many possible update strategies, we focus our attention on synchronous and dropout updates. Synchronous updates closely follow traditional NLLS algorithms, where residuals are completely re-evaluated in every solver iteration and where (non-constant) nodes and factors are sequentially updated in an alternating fashion to ensure optimal convergence. In contrast to traditional approaches, GBP, however, also accommodates selective updates based on a dropout strategy. That is, one assigns probabilities, $d_{n}$ for nodes and $d_{f}$ for factors, dictating their likelihood of being updated in each iteration. Although this may slow convergence, it intentionally compensates for stability challenges in loopy graphs while mimicking real-world scenarios with imperfect communication channels and delayed messages. + +# 4 Experiments + +We evaluate the proposed system, coined Hyperion, empirically through simulations in MoCap (absolute) and localization settings, using a temporal interval of 0.1 seconds between adjacent spline bases along with the empirical step sizes + +$\alpha_{n_j} = \alpha_{f_i} = 0.7$ across all cases. The simulated trajectories span 10 seconds and mimic real-world conditions with appropriate initial perturbations, sensor acquisition rates, and measurement noise levels. Our analysis focuses on benchmarking Hyperion against Ceres [1], an established, centralized NLLS solver, and providing in-depth ablation studies on different aspects of the framework itself. + +# 4.1 Absolute Setup + +We commence our analysis with the absolute sensor configuration, capturing measurements akin to the ones stemming from a MoCap system, where individual factors model direct observations of the underlying motion without auxiliary parameters/nodes. As such, they embody the most fundamental category of constraints, suggesting that derived factors, such as landmark projections or relative measurements, merely extend these elements, rendering them ideal candidates to analyze key properties of the proposed approach. In the following, we assume an acquisition rate of $40\mathrm{Hz}$ matching the real-world specifications. + +Our initial examination centers on comparing the convergence behavior of Hyperion against Ceres [1] across varying levels of initial perturbations and measurement noise. To this end, both solvers are identically initialized to a modified ground truth motion, encompassing perturbations in rotations and translations. Furthermore, we make use of the synchronized vertex updates if not stated otherwise, aiming for a fair comparison against Ceres. + +The qualitative outcomes of this setup are illustrated in Fig. 1, demonstrating that both Hyperion and Ceres converge to identical solutions even under substantial initial perturbation and considerable measurement noise. These observations are quantified in Tabs. 1a and 1b, indicating that motion estimates obtained from Hyperion and Ceres closely align across all levels of perturbation and noise. + +Message dropouts, mimicking imperfect communication, have also been shown to enhance convergence [27, 31] in loopy graphs. Hence, we study their effect on the proposed GBP framework, summarizing key insights in Fig. 4a, revealing that Hyperion consistently converges toward identical solutions across various dropout ratios. Despite this, they also influence the required iteration count (i.e., updates of all vertices), with every $10\%$ increase in dropouts entailing an additional 2-4 iterations until convergence is reached. + +Furthermore, we find that different motion parameterizations, specifically cubic Z- and B-Splines [4, 17], also influence the convergence of the proposed approach, which we summarize in Fig. 7b. A notable difference between the traditional and our proposed solver lies in how motion parameterizations affect the convergence speed of the latter. Our findings suggest that Z-Splines, which are interpolating rather than approximating splines, typically yield better-conditioned solutions since their bases must lie on the motion estimate itself, implicitly constraining the space of possible solutions. Naturally, the centralized NLLS solver sets a baseline for the required iteration count to resolve an optimization problem, serving as a comparative standard for our method. Thus, while GBP-based approaches are inherently distributed, Fig. 7b indicates that they impose between 2 to 4 additional iterations to achieve convergence. + +
Perturbation [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-65.2e-65.2e-65.9e-65.3e-6
t [m]5.8e-65.8e-65.9e-65.9e-66.0e-61.3e-5
Ceres
R [rad]5.2e-65.2e-65.2e-65.2e-65.2e-65.2e-6
t [m]5.9e-65.9e-65.9e-65.9e-65.9e-65.9e-6
+ +(a) Perturbation Tolerance + +
Noise [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-55.2e-45.2e-35.3e-25.6e-1
t [m]5.8e-65.9e-55.9e-45.9e-35.9e-25.9e-1
Ceres
R [rad]5.2e-65.2e-55.2e-45.2e-35.2e-25.5e-1
t [m]5.9e-65.9e-55.9e-45.9e-35.9e-25.9e-1
+ +![](images/d721a2fb4044be007aeeaf3ba2ca971c9e9779becda97843f055c6cc2507fda1.jpg) +(a) Convergence: Dropout +Fig. 4: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the absolute setup (batch). (b) Performance comparison between our symbolically, auto-generated and optimized B-Spline implementation and the recursively-defined, hand-crafted implementation used by Sommer et al. [40] on an M3 Max @4.05GHz. + +(b) Noise Tolerance +Table 1: Root Mean Square Errors (RMSEs) in rotation (R) and translation (t) resulting from Ceres [1] and Hyperion under different perturbation levels (a), different noise levels (b) respectively. The solvers run to convergence or terminate after 50 iterations. The perturbation/noise setup assumes the lowest noise/perturbation, respectively. + +
SetupPose [s]Velocity [s]Acceleration [s]Avg. Speedup
Lkθ/DBOursBasaltOursBasaltOursBasalt
SO(3)4X1.64e-73.16e-79.49e-82.90e-71.12e-73.28e-72.64x
SO(3)4✓5.03e-76.70e-64.05e-77.82e-65.11e-79.46e-617.05x
SO(3)5X1.96e-74.14e-71.32e-73.67e-71.39e-73.96e-72.58x
SO(3)5✓6.89e-71.08e-55.82e-71.27e-57.87e-71.58e-519.19x
SO(3)6X2.17e-74.78e-71.82e-74.42e-71.81e-74.83e-72.43x
SO(3)6✓8.19e-71.57e-57.51e-71.87e-51.01e-62.43e-522.71x
SE(3)4X1.62e-77.03e-71.38e-77.46e-71.34e-76.88e-74.96x
SE(3)4✓5.71e-74.69e-59.11e-75.35e-51.12e-66.25e-565.56x
SE(3)5X1.96e-77.38e-71.91e-78.73e-71.70e-79.15e-74.57x
SE(3)5✓7.32e-79.64e-51.27e-69.44e-51.47e-61.14e-494.53x
SE(3)6X2.53e-79.11e-72.34e-71.12e-62.23e-71.12e-64.47x
SE(3)6✓9.29e-71.25e-41.54e-61.67e-41.99e-61.75e-4110.31x
+ +(b) B-Spline Evaluation Timings + +Lastly, we benchmark Hyperion's real-world performance using a handheld camera to track a ChArUco [14] board, capturing a 60-second trajectory at $30\mathrm{Hz}$ with an iPhone 13 Pro. The analysis, detailed in Fig. 5, closely mirrors our previous analysis. However, we find that real-world motions, which innately expose a greater level of volatility than simulated ones, expose slower convergence. + +# 4.2 Localization Setup + +In this section, we analyze our approach in a localization setup, where we model an image acquisition rate of $20\mathrm{Hz}$ and 50 randomized, observable landmarks at a range of 2 to $6\mathrm{m}$ across the modeled motion, mimicking real-world conditions. + +Overall, the results from the localization setup are consistent with our earlier observations, as detailed in Figs. 6, 7a and 7c. However, Fig. 7a indicates that this setup is more agnostic to lower dropout ratios compared to the absolute case. Furthermore, the disparity between different motion parameterizations becomes more pronounced over the previous setup as may be observed from + +![](images/a12eeec4d4bea3511a9cd2974a5777c37cfb27f1a5aed945f4c1f15edd198998.jpg) +(a) Estimate + +![](images/24bb5aceb8b4fd3ed6e76e7a2310c62524ee55a417e094a4d684549150b84ea8.jpg) +(b) Convergence + +![](images/914907b04b779d082fa880ffe442cbe4d9b93cd1f327151a5f1ab3d8c3a2bae6.jpg) +(c) Relative Error + +![](images/8ede53e11f3d663aa303360b624c843307cf5cc48762cb3048e4b5c23a5c4028.jpg) +(a) At initialization +Fig.6: The motion estimates for Hyperion and a conventional NLLS solver [1] in magenta and white, respectively, converge to similar solutions close to ground truth (in green) in the localization setup, demonstrating robust convergence under poor pose $(\pm 0.20\mathrm{m / rad})$ and landmark initialization $(\pm 0.20\mathrm{m})$ with $\pm 1$ px measurement noise. + +![](images/5c2502a24ea4738fd7fe5614b84a9ba262de416a56a58e4d78e3d67674354f7a.jpg) +(b) After the $1^{\mathrm{st}}$ iteration + +![](images/03b853d16560c58c906d18decdc5caf2ab6072cff84a5090b676887b38182a0f.jpg) +Fig.5: ChArUco [14] setup with overlapping motion estimates (a) from Hyperion and Ceres [1] in magenta and white, respectively. Illustration of the corresponding convergence (b) and the relative errors between the two converged estimates (c). +(c) Absolute Error + +Fig. 7c. In general, visual setups also display higher volatility over absolute ones, with notable differences in estimates, especially towards the head and tails of the optimized splines. In a similar vein, we found that these numerical instabilities tend to have a destabilizing effect in loop graphs, posing considerable challenges to deploying the proposed system as a comprehensive SLAM system at present. + +# 4.3 Performance Analysis + +As highlighted in Sec. 3.5, our framework leverages SymForce [22] to automate the generation of analytic cost factors, aiming to outperform hand-crafted implementations while mitigating development effort and programmatic errors. Thus, we test our auto-generated B-Spline implementation against Sommer et al.'s optimized, hand-crafted version [40]. The comparison, detailed in Fig. 4b, assesses the timings of pose, velocity, and acceleration evaluations for B-Splines of order $k$ , within a Lie group $\mathcal{L}$ , potentially including the Jacobians $\partial/\partial\mathcal{B}$ with respect to the bases $\mathcal{B}_i$ . Figure 4b shows that our automated spline implementations significantly outperform the manual ones from [40], with speedups ranging from 2.43x to 110.31x. The performance gains are particularly notable in derivative + +![](images/1c359f089678e5e44ed331c46212b5ffed9817e7b92ce5892cb8d57790b6683b.jpg) +(a) Convergence: Dropout + +![](images/bcc7f82f8e68083a9f2298505f3d035ad06283af08f33c310920409213918855.jpg) +(b) Convergence: Absolute +Fig. 7: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the localization setup. Convergence comparison of different splines and solver variants in the absolute setups (b) and the localization setup (c), respectively. + +![](images/8147a5faf7d7982ada9723b0e206f77e586a2d7c00de6eed3c2462cdc8771c0c.jpg) +(c) Convergence: Localization + +evaluations, where [40] employs automatic differentiation to compute the Jacobians. Considering the long-standing computational challenges of CTSLAM methods, our automated approach not only reduces complexity but also narrows the performance divide with discrete-time SLAM. + +We further analyze the single-core performance of the proposed GBP solver with Ceres [1], a conventional NLLS solver, within the previously discussed scenarios. For the absolute setup (400 pose measurements), Ceres averages 0.70 ms per iteration, whereas our method averages 4.18 ms to update all graph vertices (i.e. about 6x slower). In the localization scenario (10,000 landmark reprojections), Ceres requires 15 ms per iteration, compared to our solver's 112 ms per iteration (i.e. 7.5x slower). This performance gap is, however, largely mitigated by considering that Ceres excludes the (implicit) estimation of covariances, significantly reducing computational load, and that it has been extensively refined by numerous contributors over the years. Moreover, the intrinsic distributedness and parallelizability of GBP along with potential enhancements from adaptive vertex updates, leveraging covariance estimates to trigger selective updates, are promising avenues for further performance improvements. The above analysis suggests that, even in its present state, the proposed framework is capable of real-time execution for moderately sized problems. + +# 5 Conclusions + +In this work, we present a fast, versatile GBP framework that targets distributed, continuous-time SLAM applications and leverages message-passing algorithms to achieve probabilistic inference. We demonstrate the efficacy and competitiveness of our method against a conventional NLLS solver [1] achieving similar convergence and performance properties in practical settings. We further provide a comprehensive library of high-performance implementations for continuous-time SLAM, comprising motion parameterizations as well as common factors. Based on our experiments, the proposed framework shows great promise in paving the way towards resilient, distributed, continuous-time SLAM solutions. + +# Acknowledgments + +This work was partially funded by the European Research Council (ERC) Consolidator Grant project SkEyes (Grant agreement No. 101089328). + +# References + +1. Agarwal, S., Mierle, K.: Ceres Solver, https://github.com/ceres-solver/ceres-solver, (2023, November 28) +2. Anderson, S., Dellaert, F., Barfoot, T.D.: A Hierarchical Wavelet Decomposition for Continuous-Time SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 373-380 (2014) +3. Bänninger, P., Alzugaray, I., Karrer, M., Chli, M.: Cross-agent Relocalization for Decentralized Collaborative SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5551-5557 (2023) +4. Becerra-Sagredo, J.T.: Z-Splines: Moment-conserving Cardinal Spline Interpolation of Compact Support for Arbitrarily Spaced Data. Sem. Appl. Math. (2003) +5. Bloesch, M., Burri, M., Omari, S., Hutter, M., Siegwart, R.: Iterated Extended Kalman Filter-based Visual-Inertial Odometry using Direct Photometric Feedback. Int. J. Rob. Reas. 36(10), 1053-1072 (2017) +6. Bloesch, M., Omari, S., Hutter, M., Siegwart, R.: Robust Visual-Inertial Odometry using a Direct EKF-based Approach. In: IEEE Int. Conf. Int. Rob. Sys. pp. 298-304 (2015) +7. Campos, C., Elvira, R., Rodríguez, J.J.G., Montiel, J.M., Tardós, J.D.: ORBSLAM3: An Accurate Open-Source Library for Visual, Visual-Inertial and Multi-Map SLAM. IEEE Trans. Rob. 37(6), 1874-1890 (2021) +8. Davison, A.J., Ortiz, J.: FutureMapping 2: Gaussian Belief Propagation for Spatial AI. ArXiv (2019) +9. Droeschel, D., Behnke, S.: Efficient Continuous-Time SLAM for 3D Lidar-based Online Mapping. In: IEEE Int. Conf. Rob. Aut. pp. 1-9 (05 2018) +10. Engel, J., Schöps, T., Cremers, D.: LSD-SLAM: Large-scale Direct Monocular SLAM. In: Eur. Conf. Comput. Vis. pp. 834-849 (2014) +11. Forster, C., Zhang, Z., Gassner, M., Werlberger, M., Scaramuzza, D.: SVO: Semidirect Visual Odometry for Monocular and Multicamera Systems. IEEE Trans. Rob. 33(2), 249-265 (2017) +12. Furgale, P., D. Barfoot, T., Sibley, G.: Continuous-Time Batch Estimation using Temporal Basis Functions. Rob. Sc. Sys. 34, 2088-2095 (05 2012) +13. Furgale, P., Rehder, J., Siegwart, R.: Unified Temporal and Spatial Calibration for Multi-sensor Systems. In: IEEE Int. Conf. Int. Rob. Sys. pp. 1280-1286 (2013) +14. Garrido-Jurado, S., Muñoz-Salinas, R., Madrid-Cuevas, F.J., Marín-Jiménez, M.J.: Automatic Generation and Detection of Highly Reliable Fiducial Markers under Occlusion. Pattern Recognition 47(6), 2280-2292 (2014) +15. Hug, D., Bänninger, P., Alzugaray, I., Chli, M.: Continuous-Time Stereo-Inertial Odometry. IEEE Rob. Aut. Letters 7(3), 6455-6462 (2022) +16. Hug, D., Chli, M.: HyperSLAM: A Generic and Modular Approach to Sensor Fusion and Simultaneous Localization and Mapping in Continuous-Time. In: Int. Conf. 3D Vis. pp. 978-986 (2020) +17. Kaihuai Qin: General Matrix Representations for B-splines. In: Pac. Conf. Comput. Graph. Appl. pp. 37-43 (10 1998) + +18. Karrer, M., Chli, M.: Distributed Variable-baseline Stereo SLAM from two UAVs. In: IEEE Int. Conf. Rob. Aut. pp. 82-88 (2021) +19. Leutenegger, S., Lynen, S., Bosse, M., Siegwart, R., Furgale, P.: Keyframe-based Visual-inertial Odometry using Nonlinear Optimization. Int. J. Rob. Reas. 34, 314 - 334 (2015) +20. Lovegrove, S., Patron-Perez, A., Sibley, G.: Spline Fusion: A continuous-Time Representation for Visual-Inertial Fusion with Application to Rolling Shutter Cameras. In: Brit. Mach. Vis. Conf. vol. 2, p. 8 (2013) +21. Lynen, S., Achtelik, M.W., Weiss, S., Chli, M., Siegwart, R.: A Robust and Modular Multi-sensor Fusion Approach Applied to MAV Navigation. In: IEEE Int. Conf. Int. Rob. Sys. pp. 3923-3929 (2013) +22. Martiros, H., Miller, A., Bucki, N., Solliday, B., Kennedy, R., Zhu, J., Dang, T., Pattison, D., Zheng, H., Tomic, T., Henry, P., Cross, G., VanderMey, J., Sun, A., Wang, S., Holtz, K.: SymForce: Symbolic Computation and Code Generation for Robotics. In: Rob. Sc. Sys. (2022) +23. Mascaro, R., Teixeira, L., Hinzmann, T., Siegwart, R., Chli, M.: GOMSF: Graph-Optimization Based Multi-Sensor Fusion for robust UAV Pose Estimation. In: IEEE Int. Conf. Rob. Aut. pp. 1421-1428 (2018) +24. Milford, M.J., Wyeth, G.F.: SeqSLAM: Visual Route-based Navigation for Sunny Summer Days and Stormy Winter Nights. In: IEEE Int. Conf. Rob. Aut. pp. 1643-1649 (2012) +25. Mueggler, E., Gallego, G., Rebecq, H., Scaramuzza, D.: Continuous-Time Visual-Inertial Odometry for Event Cameras. IEEE Trans. Rob. 34(6), 1425-1440 (2018) +26. Mur-Artal, R., Montiel, J., Tardós, J.D.: ORB-SLAM: A Versatile and Accurate Monocular SLAM System. IEEE Trans. Rob. 31, 1147-1163 (2015) +27. Murai, R., Alzugaray, I., Kelly, P.H., Davison, A.J.: Distributed Simultaneous Localisation and Auto-Calibration Using Gaussian Belief Propagation. IEEE Rob. Aut. Letters (2024) +28. Murai, R., Ortiz, J., Saeedi, S., Kelly, P.H., Davison, A.J.: A Robot Web for Distributed Many-Device Localisation. IEEE Trans. Rob. (2023) +29. Olson, E.: AprilTag: A Robust and Flexible Visual Fiducial System. In: IEEE Int. Conf. Rob. Aut. pp. 3400-3407 (2011) +30. Ortiz, J., Evans, T., Davison, A.J.: A Visual Introduction to Gaussian Belief Propagation. ArXiv (2021) +31. Ortiz, J., Evans, T., Sucar, E., Davison, A.J.: Incremental Abstraction in Distributed Probabilistic SLAM Graphs. In: IEEE Int. Conf. Rob. Aut. pp. 7566-7572 (2022) +32. Ortiz, J., Pupilli, M., Leutenegger, S., Davison, A.J.: Bundle Adjustment on a Graph Processor. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 2416-2425 (2020) +33. Oth, L., Furgale, P., Kneip, L., Siegwart, R.: Rolling Shutter Camera Calibration. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 1360-1367 (2013) +34. Peng, Z., Xu, Y., Yan, M., Yin, W.: ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates. J. Sc. Comput. 38(5), A2851-A2879 (2016) +35. Qin, T., Cao, S., Pan, J., Shen, S.: A General Optimization-based Framework for Global Pose Estimation with Multiple Sensors. ArXiv (2019) +36. Qin, T., Li, P., Shen, S.: VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimator. IEEE Trans. Rob. 34(4), 1004-1020 (2018) +37. Qin, T., Pan, J., Cao, S., Shen, S.: A General Optimization-based Framework for Local Odometry Estimation with Multiple Sensors. ArXiv (2019) + +38. Schmuck, P., Chli, M.: CCM-SLAM: Robust and Efficient Centralized Collaborative Monocular Simultaneous Localization and Mapping for Robotic Teams. J. Fld. Rob. 36(4), 763-781 (2019) +39. Schubert, D., Demmel, N., Usenko, V., Stuckler, J., Cremers, D.: Direct Sparse Odometry With Rolling Shutter. In: Eur. Conf. Comput. Vis. pp. 682-697 (2018) +40. Sommer, C., Usenko, V., Schubert, D., Demmel, N., Cremers, D.: Efficient Derivative Computation for Cumulative B-Splines on Lie Groups. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11145-11153 (2020) +41. Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle Adjustment - A Modern Synthesis. In: Vision Algorithms: Theory and Practice. pp. 298-372 (2000) +42. Usenko, V., Demmel, N., Schubert, D., Stuckler, J., Cremers, D.: Visual-Inertial Mapping With Non-linear Factor Recovery. IEEE Rob. Aut. Letters 5(2), 422-429 (2019) +43. Wang, R., Schworer, M., Cremers, D.: Stereo DSO: Large-scale Direct Sparse Visual Odometry with Stereo Cameras. In: Int. Conf. Comput. Vis. pp. 3903-3911 (2017) +44. Wang, S., Clark, R., Wen, H., Trigoni, N.: DeepVO: Towards end-to-end Visual Odometry with Deep Recurrent Convolutional Neural Networks. In: IEEE Int. Conf. Rob. Aut. pp. 2043-2050 (2017) +45. Wang, X., Xue, F., Yan, Z., Dong, W., Wang, Q., Zha, H.: Continuous-Time Stereo Visual Odometry Based on Dynamics Model. In: Asian Conf. Comput. Vis. pp. 388-403 (2018) +46. Yang, A.J., Cui, C., Bardsan, I.A., Urtasun, R., Wang, S.: Asynchronous Multi-view SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5669-5676 (2021) \ No newline at end of file diff --git "a/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/images.zip" "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/images.zip" new file mode 100644 index 0000000000000000000000000000000000000000..2c018fc6cd8d5e3626a06f988a4cb9e9bf6e0468 --- /dev/null +++ "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/images.zip" @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:048e40370bc159377271a8124582cfbe2d738932bcfdbb9bf2197751f1db3b83 +size 549219 diff --git "a/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/layout.json" "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/layout.json" new file mode 100644 index 0000000000000000000000000000000000000000..7d8dfa8d98fc31f1f321b0b39f62e8f6a5975611 --- /dev/null +++ "b/2024/Hyperion \342\200\223 A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM/layout.json" @@ -0,0 +1,11435 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 43, + 30, + 368, + 81 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 43, + 30, + 368, + 81 + ], + "spans": [ + { + "bbox": [ + 43, + 30, + 368, + 81 + ], + "type": "text", + "content": "Hyperion - A fast, versatile symbolic Gaussian Belief Propagation framework for Continuous-Time SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 74, + 104, + 337, + 116 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 74, + 104, + 337, + 116 + ], + "spans": [ + { + "bbox": [ + 74, + 104, + 337, + 116 + ], + "type": "text", + "content": "David Hug1, Ignacio Alzugaray2, and Margarita Chli1,3" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "spans": [ + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "type": "text", + "content": " Vision for Robotics Lab, ETH Zürich, Zürich, Switzerland \n" + }, + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "type": "text", + "content": " Dyson Robotics Lab, Imperial College London, London, United Kingdom \n" + }, + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 53, + 126, + 358, + 159 + ], + "type": "text", + "content": " Vision for Robotics Lab, University of Cyprus, Nicosia, Cyprus" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 60, + 186, + 351, + 351 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 60, + 186, + 351, + 351 + ], + "spans": [ + { + "bbox": [ + 60, + 186, + 351, + 351 + ], + "type": "text", + "content": "Abstract. Continuous-Time Simultaneous Localization And Mapping (CTSLAM) has become a promising approach for fusing asynchronous and multi-modal sensor suites. Unlike discrete-time SLAM, which estimates poses discretely, CTSLAM uses continuous-time motion parametrizations, facilitating the integration of a variety of sensors such as rolling-shutter cameras, event cameras and Inertial Measurement Units (IMUs). However, CTSLAM approaches remain computationally demanding and are conventionally posed as centralized Non-Linear Least Squares (NLLS) optimizations. Targeting these limitations, we not only present the fastest SymForce-based [22] B- and Z-Spline implementations achieving speedups between " + }, + { + "bbox": [ + 60, + 186, + 351, + 351 + ], + "type": "inline_equation", + "content": "2.43\\mathrm{x}" + }, + { + "bbox": [ + 60, + 186, + 351, + 351 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 60, + 186, + 351, + 351 + ], + "type": "inline_equation", + "content": "110.31\\mathrm{x}" + }, + { + "bbox": [ + 60, + 186, + 351, + 351 + ], + "type": "text", + "content": " over Sommer et al. [40] but also implement a novel continuous-time Gaussian Belief Propagation (GBP) framework, coined Hyperion, which targets decentralized probabilistic inference across agents. We demonstrate the efficacy of our method in motion tracking and localization settings, complemented by empirical ablation studies." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 61, + 352, + 277, + 362 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 61, + 352, + 277, + 362 + ], + "spans": [ + { + "bbox": [ + 61, + 352, + 277, + 362 + ], + "type": "text", + "content": "Code: https://github.com/VIS4ROB-lab/hyperion" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "spans": [ + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "text", + "content": "Keywords: Gaussian Belief Propagation " + }, + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "text", + "content": " Continuous-Time SLAM " + }, + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "text", + "content": " Distributed Non-Linear Least Squares Optimization " + }, + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 61, + 373, + 351, + 395 + ], + "type": "text", + "content": " B- and Z-Splines" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 34, + 415, + 127, + 428 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 34, + 415, + 127, + 428 + ], + "spans": [ + { + "bbox": [ + 34, + 415, + 127, + 428 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 33, + 439, + 380, + 558 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 439, + 380, + 558 + ], + "spans": [ + { + "bbox": [ + 33, + 439, + 380, + 558 + ], + "type": "text", + "content": "Estimating a sensor-suite's ego-motion and workspace employing Simultaneous Localization And Mapping (SLAM) techniques, has long been studied using a wide variety of sensing modalities, such as vision sensors [35,39,43,46], IMUs [7,18,36], Global Positioning System (GPS) feeds [21, 23], and laser ranging [9] sensors. Unlike traditional, discrete-time approaches, which require careful synchronization of sensory measurements due to the discretization of motion-parametrizing states, Continuous-Time Simultaneous Localization And Mapping (CTSLAM) [9,12,13, 15,33] offers native support for the fusion of asynchronous measurements due to its continuous-time parametrization that yields pose, velocity and acceleration estimates at arbitrary instances in time." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 34, + 560, + 379, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 34, + 560, + 379, + 582 + ], + "spans": [ + { + "bbox": [ + 34, + 560, + 379, + 582 + ], + "type": "text", + "content": "Despite their advantages, CTSLAM approaches often entail higher computational complexity than conventional approaches, which somewhat hinders their" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [], + "page_size": [ + 413, + 615 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 47, + 32, + 144, + 130 + ], + "blocks": [ + { + "bbox": [ + 47, + 32, + 144, + 130 + ], + "lines": [ + { + "bbox": [ + 47, + 32, + 144, + 130 + ], + "spans": [ + { + "bbox": [ + 47, + 32, + 144, + 130 + ], + "type": "image", + "image_path": "880a72859e038ce470de5e86e040e91632612a1dd55bb859e91893c0f777c18d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 59, + 132, + 129, + 140 + ], + "lines": [ + { + "bbox": [ + 59, + 132, + 129, + 140 + ], + "spans": [ + { + "bbox": [ + 59, + 132, + 129, + 140 + ], + "type": "text", + "content": "(a) At initialization" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 149, + 32, + 246, + 130 + ], + "blocks": [ + { + "bbox": [ + 149, + 32, + 246, + 130 + ], + "lines": [ + { + "bbox": [ + 149, + 32, + 246, + 130 + ], + "spans": [ + { + "bbox": [ + 149, + 32, + 246, + 130 + ], + "type": "image", + "image_path": "5cc37deb828f995f589cb6ee44425b7e0da44486bbedd1ef3c3b0958d90472e4.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 149, + 132, + 241, + 141 + ], + "lines": [ + { + "bbox": [ + 149, + 132, + 241, + 141 + ], + "spans": [ + { + "bbox": [ + 149, + 132, + 241, + 141 + ], + "type": "text", + "content": "(b) After the " + }, + { + "bbox": [ + 149, + 132, + 241, + 141 + ], + "type": "inline_equation", + "content": "1^{\\mathrm{st}}" + }, + { + "bbox": [ + 149, + 132, + 241, + 141 + ], + "type": "text", + "content": " iteration" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 30, + 150, + 381, + 195 + ], + "lines": [ + { + "bbox": [ + 30, + 150, + 381, + 195 + ], + "spans": [ + { + "bbox": [ + 30, + 150, + 381, + 195 + ], + "type": "text", + "content": "Fig. 1: Both the proposed continuous-time GBP solver (in magenta) and the conventional NLLS solver [1] (in white) converge to identical solutions close to the ground truth (in green) even under poor initialization (" + }, + { + "bbox": [ + 30, + 150, + 381, + 195 + ], + "type": "inline_equation", + "content": "\\pm 1.00 \\, \\mathrm{m / rad}" + }, + { + "bbox": [ + 30, + 150, + 381, + 195 + ], + "type": "text", + "content": ") and substantial pose measurement noise (" + }, + { + "bbox": [ + 30, + 150, + 381, + 195 + ], + "type": "inline_equation", + "content": "\\pm 0.05 \\, \\mathrm{m / rad}" + }, + { + "bbox": [ + 30, + 150, + 381, + 195 + ], + "type": "text", + "content": ")." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 250, + 32, + 365, + 130 + ], + "blocks": [ + { + "bbox": [ + 250, + 32, + 365, + 130 + ], + "lines": [ + { + "bbox": [ + 250, + 32, + 365, + 130 + ], + "spans": [ + { + "bbox": [ + 250, + 32, + 365, + 130 + ], + "type": "image", + "image_path": "2c53a95439bee51e238547e090013378be339e05e5505e123a7287d7a7309328.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 273, + 132, + 340, + 140 + ], + "lines": [ + { + "bbox": [ + 273, + 132, + 340, + 140 + ], + "spans": [ + { + "bbox": [ + 273, + 132, + 340, + 140 + ], + "type": "text", + "content": "(c) Absolute Error" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 30, + 218, + 381, + 266 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 218, + 381, + 266 + ], + "spans": [ + { + "bbox": [ + 30, + 218, + 381, + 266 + ], + "type": "text", + "content": "deployment in real-world scenarios. In addition, most (discrete- and continuous-time) SLAM systems pose the underlying optimization as a centralized Non-Linear Least Squares (NLLS) problem, which, without further modifications, strictly limits their applicability to single-agent setups." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 31, + 266, + 381, + 421 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 266, + 381, + 421 + ], + "spans": [ + { + "bbox": [ + 31, + 266, + 381, + 421 + ], + "type": "text", + "content": "Thus, novel, decentralized algorithms along with more effective continuous-time motion parametrizations are paramount in the quest to overcome existing challenges in traditional, centralized CTSLAM techniques. Distributed methods such as GBP are especially promising given that they, in contrast to conventional NLLS paradigms, achieve iterative, probabilistic inference through message-passing between individual nodes and factors in a factor graph and that they operate in a distributed and asynchronous manner by nature rendering them inherently scalable, even across multiple agents. In addition, GBP also explicitly models the uncertainties of estimizable quantities, which can be leveraged to selectively direct computational resources to non-converged nodes in the graph. This circumstance is especially promising in the context of CTSLAM where effective allocation of computational resources towards the least certain estimates promises to further reduce their computational complexity." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 30, + 421, + 381, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 421, + 381, + 530 + ], + "spans": [ + { + "bbox": [ + 30, + 421, + 381, + 530 + ], + "type": "text", + "content": "This work, in particular, pushes the performance envelope of B- and Z-Splines and devises an innovative, distributed optimization strategy for CTSLAM using GBP. Whilst the need for faster continuous-time parametrizations is self-evident, we also specifically target the absence of a distributed, continuous-time state estimation framework. Such a framework, not only promises flexible resource allocation and decentralized state estimation but also allows fusing asynchronous measurements. Here, we showcase the practicality of the proposed continuous-time GBP framework and provide it as an open-source implementation to encourage benchmarking. In addition to these contributions, this work also" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 38, + 536, + 381, + 583 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 38, + 536, + 370, + 547 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 38, + 536, + 370, + 547 + ], + "spans": [ + { + "bbox": [ + 38, + 536, + 370, + 547 + ], + "type": "text", + "content": "- offers the fastest, fully analytic B- and Z-Spline implementations to date," + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 38, + 548, + 381, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 38, + 548, + 381, + 559 + ], + "spans": [ + { + "bbox": [ + 38, + 548, + 381, + 559 + ], + "type": "text", + "content": "- presents a novel, symbolic GBP-based framework for continuous-time SLAM," + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 38, + 560, + 380, + 571 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 38, + 560, + 380, + 571 + ], + "spans": [ + { + "bbox": [ + 38, + 560, + 380, + 571 + ], + "type": "text", + "content": "- demonstrates the suitability of the proposed method in practical setups, and" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 38, + 571, + 299, + 583 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 38, + 571, + 299, + 583 + ], + "spans": [ + { + "bbox": [ + 38, + 571, + 299, + 583 + ], + "type": "text", + "content": "- provides detailed ablation studies on the algorithm itself." + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 32, + 11, + 39, + 18 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 11, + 39, + 18 + ], + "spans": [ + { + "bbox": [ + 32, + 11, + 39, + 18 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 66, + 9, + 119, + 19 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 66, + 9, + 119, + 19 + ], + "spans": [ + { + "bbox": [ + 66, + 9, + 119, + 19 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 32, + 33, + 136, + 46 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 33, + 136, + 46 + ], + "spans": [ + { + "bbox": [ + 32, + 33, + 136, + 46 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 32, + 57, + 379, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 57, + 379, + 140 + ], + "spans": [ + { + "bbox": [ + 32, + 57, + 379, + 140 + ], + "type": "text", + "content": "The SLAM problem has long been researched as it comprises the core of robotic perception, with seminal works focusing on discrete-time, monocular [26, 36] and stereo setups [35, 37], as well as works which propose fusion of additional sensing information, such as inertial [5-7, 19], and laser ranging [9]. In addition to these feature-based approaches to SLAM, alternative powerful paradigms have been proposed, such as direct methods [10, 11] and machine-learning based techniques [24, 44] have been demonstrated to be beneficial in some scenarios." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 32, + 141, + 379, + 271 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 141, + 379, + 271 + ], + "spans": [ + { + "bbox": [ + 32, + 141, + 379, + 271 + ], + "type": "text", + "content": "In contrast to traditional, discrete-time SLAM methods that have been widely adopted, CTSLAM techniques have early on been demonstrated to exhibit great potential for high-fidelity and continuous estimates of motion [2, 12, 13, 15, 20, 25, 42, 45], albeit posing fundamental scientific and algorithmic challenges. The key advantage of these methods lies in their inherent capability to fuse unsynchronized and asynchronous measurements (e.g. from a rolling shutter camera or an event-based vision sensor) in the estimation processes, in contrast to conventional approaches. However, the wider adoption of CTSLAM techniques remains impeded by challenges in finding more efficient motion representations, addressing convergence issues as well as overcoming computational limitations, missing out on the promise for high-fidelity motion and scene estimation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 32, + 273, + 379, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 273, + 379, + 415 + ], + "spans": [ + { + "bbox": [ + 32, + 273, + 379, + 415 + ], + "type": "text", + "content": "Following promising leads in fundamental SLAM research for single agents, a novel challenge and desire to deploy the same techniques in collaborative, multi-agent setups arose. Works such as [38] proposed means to address centralized multi-agent SLAM, while [18] investigated the advantages of variable-stereo baseline setups, which leverage the views from two agents to boost the accuracy of high-altitude depth estimates. A common approach to solve NLLS optimizations in a distributed fashion is based on Alternating Direction Method of Multipliers (ADMM) approaches similar to the work in [34] and [3], which leverage the use of dual residuals to ensure consistent estimates across distributed multi-agent NLLS optimizations. Orthogonally, GBP approaches [8, 28, 30, 32] can perform distributed and asynchronous inference of states via an equivalent message-passing scheme, making them ideal candidates to address multi-agent SLAM." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 32, + 416, + 379, + 451 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 416, + 379, + 451 + ], + "spans": [ + { + "bbox": [ + 32, + 416, + 379, + 451 + ], + "type": "text", + "content": "In this work, we build upon these ideas, consolidate a distributed GBP optimization with a continuous-time parametrization, and demonstrate the suitability of the novel, combined method in practical setups." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 32, + 469, + 130, + 482 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 469, + 130, + 482 + ], + "spans": [ + { + "bbox": [ + 32, + 469, + 130, + 482 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 32, + 493, + 126, + 504 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 493, + 126, + 504 + ], + "spans": [ + { + "bbox": [ + 32, + 493, + 126, + 504 + ], + "type": "text", + "content": "3.1 Preliminaries" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "spans": [ + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "text", + "content": "All Simultaneous Localization And Mapping (SLAM) algorithms, in essence, aim to estimate an optimal, cost-minimizing set of estimizable parameters " + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "inline_equation", + "content": "\\Theta" + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "text", + "content": " which are set to describe a collection of noisy sensory measurements " + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "text", + "content": " with the highest possible accuracy. Specifically, in its NLLS formulation, this optimal solution is found by minimization of the cumulative cost over a set of weighted residuals " + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "inline_equation", + "content": "\\bar{r}" + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "text", + "content": " associated with measurements " + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 32, + 511, + 379, + 583 + ], + "type": "text", + "content": " stemming from a connected sensor" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 346, + 21 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 346, + 21 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 346, + 21 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "spans": [ + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 100, + 31, + 312, + 128 + ], + "blocks": [ + { + "bbox": [ + 100, + 31, + 312, + 128 + ], + "lines": [ + { + "bbox": [ + 100, + 31, + 312, + 128 + ], + "spans": [ + { + "bbox": [ + 100, + 31, + 312, + 128 + ], + "type": "image", + "image_path": "a5794792b9b6a0599496a3c4d1a5c0a4997a3d5c9713592131dbe323b2f4130a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 30, + 134, + 381, + 169 + ], + "lines": [ + { + "bbox": [ + 30, + 134, + 381, + 169 + ], + "spans": [ + { + "bbox": [ + 30, + 134, + 381, + 169 + ], + "type": "text", + "content": "Fig. 2: For every (valid) instance in time " + }, + { + "bbox": [ + 30, + 134, + 381, + 169 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 30, + 134, + 381, + 169 + ], + "type": "text", + "content": ", a collection of adjacent bases (in orange) gives rise to an individual segment (in green) of a cubic B-Spline. An interpolated pose at query time " + }, + { + "bbox": [ + 30, + 134, + 381, + 169 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 30, + 134, + 381, + 169 + ], + "type": "text", + "content": " is then obtained from the (cumulative) blending of these bases." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "spans": [ + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": ". A weighted residuals " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "\\bar{\\pmb{r}}" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": " at measurement time " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": " is computed by comparing a predicted measurement " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{m}}(t, \\pmb{\\theta}_s)" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": " with sensor-associated parameters " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "\\pmb{\\theta}_s \\subseteq \\pmb{\\Theta}" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": " to a measured one " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "\\pmb{m}(t)" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": " through the application of a metric " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "\\pmb{\\mu}" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": " (i.e. " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "\\hat{x} \\boxminus_{\\pmb{\\mu}} x" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": ") and a subsequent weighting via the square-root information " + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "inline_equation", + "content": "\\Omega_m" + }, + { + "bbox": [ + 30, + 193, + 381, + 242 + ], + "type": "text", + "content": " according to" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 252, + 380, + 265 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 252, + 380, + 265 + ], + "spans": [ + { + "bbox": [ + 133, + 252, + 380, + 265 + ], + "type": "interline_equation", + "content": "\\boldsymbol {r} (t, \\boldsymbol {\\theta} _ {s}) = \\hat {\\boldsymbol {m}} (t, \\boldsymbol {\\theta} _ {s}) \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {m} (t) \\text {a n d} \\tag {1}", + "image_path": "561eb9e6546c9dd80b6027e0ba63824f8de11150cef53715c512e83c00d1c91d.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 96, + 267, + 380, + 282 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 96, + 267, + 380, + 282 + ], + "spans": [ + { + "bbox": [ + 96, + 267, + 380, + 282 + ], + "type": "interline_equation", + "content": "\\left\\| \\bar {\\boldsymbol {r}} \\right\\| ^ {2} = \\bar {\\boldsymbol {r}} ^ {\\top} \\bar {\\boldsymbol {r}} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Omega} _ {m} ^ {\\top} \\boldsymbol {\\Omega} _ {m} \\boldsymbol {r} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Lambda} _ {m} \\boldsymbol {r} = \\boldsymbol {r} ^ {\\top} \\boldsymbol {\\Sigma} _ {m} ^ {- 1} \\boldsymbol {r}, \\tag {2}", + "image_path": "83029f68146ad33a6aed9e2cf1a97fc2947c49264b4c82972ba2e6a34bb5b639.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "spans": [ + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "inline_equation", + "content": "\\pmb{\\Sigma}_{m}" + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{m}" + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "content": " are the covariance and precision matrix, respectively. Ultimately, we aim to minimize the sum over residuals stemming from all connected sensors " + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "content": " and their associated measurements " + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_s" + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "content": " with measurement times " + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "inline_equation", + "content": "\\mathcal{T}_s" + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "content": ". To this end, established NLLS solvers [1] are commonly deployed in practice, which aim to obtain the optimal, cost-minimizing parameters " + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "inline_equation", + "content": "\\Theta^{*}" + }, + { + "bbox": [ + 30, + 292, + 381, + 353 + ], + "type": "text", + "content": " as defined below." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 118, + 361, + 380, + 401 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 118, + 361, + 380, + 401 + ], + "spans": [ + { + "bbox": [ + 118, + 361, + 380, + 401 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\Theta} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\left[ \\sum_ {s \\in \\mathcal {S}} \\sum_ {t \\in \\mathcal {T} _ {s}} \\frac {1}{2} \\| \\bar {\\boldsymbol {r}} (t, \\boldsymbol {\\theta} _ {s}) \\| ^ {2} \\right]. \\tag {3}", + "image_path": "a1200e04031dbdae9084ae3fccb864e02df6c735ae0eed250bfb23c4d0c719e4.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 31, + 420, + 187, + 431 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 420, + 187, + 431 + ], + "spans": [ + { + "bbox": [ + 31, + 420, + 187, + 431 + ], + "type": "text", + "content": "3.2 Continuous-Time Motion" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "spans": [ + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "text", + "content": "In recent times, continuous-time formulations of conventional SLAM algorithms have been studied by multiple authors [12, 13, 15, 16, 20, 40], where the most common motion parametrization is based on the concept of cubic B-Splines. This practice is rooted in several favorable properties of B-Splines, such as their compact representation, finite support, analytic Jacobians, and their " + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "inline_equation", + "content": "\\mathcal{C}_2" + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "text", + "content": "-continuity for predicting instantaneous velocities and accelerations. In this work, we utilize split interpolations for world-to-body transformations " + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "inline_equation", + "content": "T_{wb}(t) \\in \\mathbb{S}\\mathbb{E}(3)" + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "text", + "content": ", illustrated in Fig. 2, that separately parametrize rotations " + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "inline_equation", + "content": "R_{wb}(t) \\in \\mathbb{S}\\mathbb{O}(3)" + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "text", + "content": " and translations " + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "inline_equation", + "content": "t_{wb}(t) \\in \\mathbb{R}^3" + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "text", + "content": ". In particular, we compute transformations " + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "inline_equation", + "content": "T_{wb}(t)" + }, + { + "bbox": [ + 30, + 442, + 382, + 552 + ], + "type": "text", + "content": " using" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 102, + 560, + 380, + 587 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 102, + 560, + 380, + 587 + ], + "spans": [ + { + "bbox": [ + 102, + 560, + 380, + 587 + ], + "type": "interline_equation", + "content": "\\boldsymbol {T} _ {w b} (t) = \\left[ \\begin{array}{c c} \\boldsymbol {R} _ {w b} (\\boldsymbol {q} _ {w b} (t)) & \\boldsymbol {t} _ {w b} (t) \\\\ \\boldsymbol {0} & 1 \\end{array} \\right] \\in \\mathbb {S E} (3) \\text {w i t h} \\tag {4}", + "image_path": "1bfb89275b51153a069e5b848c98f4f97e24525fb89d6326d9fa49fb9257d376.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 32, + 10, + 40, + 18 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 10, + 40, + 18 + ], + "spans": [ + { + "bbox": [ + 32, + 10, + 40, + 18 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "spans": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 107, + 44, + 380, + 78 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 107, + 44, + 380, + 78 + ], + "spans": [ + { + "bbox": [ + 107, + 44, + 380, + 78 + ], + "type": "interline_equation", + "content": "\\boldsymbol {q} _ {w b} (t) = \\boldsymbol {q} _ {w i} * \\prod_ {j = 1} ^ {k} \\left(\\boldsymbol {q} _ {w (i + j - 1)} ^ {- 1} * \\boldsymbol {q} _ {w (i + j)}\\right) ^ {\\lambda_ {j} (t)} \\tag {5}", + "image_path": "4c83e059a74f4c40726dca3344b8f59a050cdaa7dac0615b77e15e116ec6bfe3.jpg" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 99, + 83, + 380, + 116 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 99, + 83, + 380, + 116 + ], + "spans": [ + { + "bbox": [ + 99, + 83, + 380, + 116 + ], + "type": "interline_equation", + "content": "\\boldsymbol {t} _ {w b} (t) = \\boldsymbol {t} _ {w i} + \\sum_ {j = 1} ^ {k} \\left[ \\lambda_ {j} (t) \\left(\\boldsymbol {t} _ {w (i + j)} - \\boldsymbol {t} _ {w (i + j - 1)}\\right) \\right], \\tag {6}", + "image_path": "3627f741c8ce0d32165c542ba1401aa4bf2cc783f4117916d77ecc85d33a8fe7.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "spans": [ + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": "where individual evaluations of " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "T_{wb}(t)" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " depend on a collection of bases " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{B}_i, \\dots, \\mathcal{B}_{i+k}\\}" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " (see Fig. 2) and each basis " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "\\mathcal{B}_i" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " comprises a time " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "t_i" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": ", a quaternion " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "q_{wi}" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " and a translation " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "t_{wi}" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": ". Above, " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " is the Degree of Freedom (DoF) of the B-/Z-Spline, rotations " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "R_{wb}(t)" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " are parametrized by quaternions " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "q_{wb}(t)" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " and the expression " + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "inline_equation", + "content": "\\lambda_j(t)" + }, + { + "bbox": [ + 30, + 120, + 391, + 182 + ], + "type": "text", + "content": " serves as a placeholder for concrete interpolation coefficients found in [4, 15, 17, 20]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 31, + 196, + 217, + 209 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 196, + 217, + 209 + ], + "spans": [ + { + "bbox": [ + 31, + 196, + 217, + 209 + ], + "type": "text", + "content": "3.3 Continuous-Time Optimization" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "spans": [ + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "text", + "content": "In its probabilistic formulation [30, 32], the non-linear minimization problem from Eq. (3) is equivalent to finding an optimal probability distribution that accounts for all acquired measurements. Without loss of generality, one can also represent the problem as a product of factors " + }, + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "inline_equation", + "content": "f_{i} \\propto e^{-E_{i}(\\pmb{\\theta}_{i})}" + }, + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "text", + "content": " with induced energies " + }, + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "inline_equation", + "content": "E_{i}(\\pmb{\\theta}_{i})" + }, + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "text", + "content": ", arriving at the modified expression to obtain the optimal parameters " + }, + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "inline_equation", + "content": "\\pmb{\\Theta}^{*}" + }, + { + "bbox": [ + 30, + 215, + 381, + 276 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 89, + 282, + 380, + 306 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 89, + 282, + 380, + 306 + ], + "spans": [ + { + "bbox": [ + 89, + 282, + 380, + 306 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\Theta} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m a x}} \\log (p (\\boldsymbol {\\Theta})) = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\sum_ {i} E _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\text {w i t h} \\tag {7}", + "image_path": "ad691476af7a65b2588a26e0efc1605536e8cc71edf7cf6f5574464851c85a30.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 122, + 309, + 380, + 333 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 122, + 309, + 380, + 333 + ], + "spans": [ + { + "bbox": [ + 122, + 309, + 380, + 333 + ], + "type": "interline_equation", + "content": "p (\\boldsymbol {\\Theta}) = \\prod_ {i} f _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\propto \\prod_ {i} e ^ {- E _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right)}. \\tag {8}", + "image_path": "b3c319c89ee8d6fbf2a60a7ba5741c52b489fcc570a04d4b78baf3fe1c793f6b.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 30, + 341, + 379, + 366 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 341, + 379, + 366 + ], + "spans": [ + { + "bbox": [ + 30, + 341, + 379, + 366 + ], + "type": "text", + "content": "In this work, we use multi-variant Gaussians " + }, + { + "bbox": [ + 30, + 341, + 379, + 366 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(\\pmb{\\mu}_i, \\pmb{\\Sigma}_i)" + }, + { + "bbox": [ + 30, + 341, + 379, + 366 + ], + "type": "text", + "content": " to model the factors " + }, + { + "bbox": [ + 30, + 341, + 379, + 366 + ], + "type": "inline_equation", + "content": "f_i" + }, + { + "bbox": [ + 30, + 341, + 379, + 366 + ], + "type": "text", + "content": " in Eq. (8), linking the energies in Eq. (7) to the residuals in Eq. (2) according to" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 383, + 380, + 398 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 105, + 383, + 380, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 380, + 398 + ], + "type": "interline_equation", + "content": "E _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) = \\left\\| \\bar {\\boldsymbol {r}} _ {i} \\right\\| ^ {2} = \\boldsymbol {r} _ {i} ^ {\\top} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right) \\boldsymbol {\\Omega} _ {i} ^ {\\top} \\boldsymbol {\\Omega} _ {i} \\boldsymbol {r} _ {i} \\left(t _ {i}, \\boldsymbol {\\theta} _ {i}\\right). \\tag {9}", + "image_path": "24c496c0f60198fb6c2ab3fd9981e454da53fb75c987d73cf2e8405422802094.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "spans": [ + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "text", + "content": "The generic residuals " + }, + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "inline_equation", + "content": "\\bar{\\pmb{r}}_i" + }, + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "text", + "content": " themselves are non-linear with a corresponding Taylor expansions in " + }, + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "inline_equation", + "content": "\\pmb{\\theta}_i" + }, + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "text", + "content": " around some linearization point " + }, + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "inline_equation", + "content": "\\pmb{\\theta}_i^0" + }, + { + "bbox": [ + 30, + 405, + 379, + 430 + ], + "type": "text", + "content": " such that" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 74, + 437, + 380, + 453 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 74, + 437, + 380, + 453 + ], + "spans": [ + { + "bbox": [ + 74, + 437, + 380, + 453 + ], + "type": "interline_equation", + "content": "\\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i}\\right) - \\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i} ^ {0}\\right) \\approx D \\bar {\\boldsymbol {r}} _ {i} \\left(\\boldsymbol {\\theta} _ {i} ^ {0}\\right) \\left(\\boldsymbol {\\theta} _ {i} - \\boldsymbol {\\theta} _ {i} ^ {0}\\right) = \\bar {\\boldsymbol {J}} _ {i} ^ {0} \\left(\\boldsymbol {\\theta} _ {i} - \\boldsymbol {\\theta} _ {i} ^ {0}\\right) = \\bar {\\boldsymbol {J}} _ {i} ^ {0} \\boldsymbol {\\tau} _ {i} ^ {0}. \\tag {10}", + "image_path": "a4bf20e6437d888050b084b44a6e1aad9b2ae55750cf0b636859f5b8416f7f99.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "spans": [ + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "text", + "content": "Furthermore, all factors " + }, + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "inline_equation", + "content": "f_{i}" + }, + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "text", + "content": ", their energies " + }, + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "inline_equation", + "content": "E_{i}(t_{i},\\pmb{\\theta}_{i})" + }, + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "text", + "content": " respectively, can also be converted to an equivalent, incremental information form " + }, + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "inline_equation", + "content": "\\mathcal{N}^{-1}(\\pmb{\\eta}_i^0,\\pmb{\\Lambda}_i^0)" + }, + { + "bbox": [ + 30, + 460, + 379, + 485 + ], + "type": "text", + "content": ", yielding" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 111, + 499, + 380, + 523 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 111, + 499, + 380, + 523 + ], + "spans": [ + { + "bbox": [ + 111, + 499, + 380, + 523 + ], + "type": "interline_equation", + "content": "E _ {i} \\left(t _ {i}, \\boldsymbol {\\tau} _ {i} ^ {0}\\right) \\approx \\frac {1}{2} \\boldsymbol {\\tau} _ {i} ^ {0, \\top} \\boldsymbol {\\Lambda} _ {i} ^ {0} \\boldsymbol {\\tau} _ {i} ^ {0} - \\boldsymbol {\\tau} _ {i} ^ {0, \\top} \\boldsymbol {\\eta} _ {i} ^ {0} \\quad \\text {w h e r e} \\tag {11}", + "image_path": "cb572a4d90a949821dd8f707d608325c3349a70bb31b8e4f4e47c2ac01590bef.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 124, + 524, + 380, + 541 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 124, + 524, + 380, + 541 + ], + "spans": [ + { + "bbox": [ + 124, + 524, + 380, + 541 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\eta} _ {i} ^ {0} = - \\bar {\\boldsymbol {J}} _ {i} ^ {0, \\top} \\bar {\\boldsymbol {r}} _ {i} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {i} ^ {0} = \\bar {\\boldsymbol {J}} _ {i} ^ {0, \\top} \\bar {\\boldsymbol {J}} _ {i} ^ {0}. \\tag {12}", + "image_path": "b82f7aa9fd069b87d5ca3662bf1fad8fd3739950a486318ddad7afd05d36faae.jpg" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "spans": [ + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "text", + "content": "This dual representation of factors " + }, + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "inline_equation", + "content": "f_{i}" + }, + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "text", + "content": " and the existence of the Gaussian " + }, + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "inline_equation", + "content": "\\mathcal{N}" + }, + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "text", + "content": " and its inverse " + }, + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "inline_equation", + "content": "\\mathcal{N}^{-1}" + }, + { + "bbox": [ + 30, + 547, + 379, + 583 + ], + "type": "text", + "content": " is vital for efficient conditioning and marginalization of individual terms in the GBP algorithm presented in the next section." + } + ] + } + ], + "index": 16 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 347, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 347, + 20 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 347, + 20 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "spans": [ + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 37, + 31, + 195, + 112 + ], + "blocks": [ + { + "bbox": [ + 37, + 31, + 195, + 112 + ], + "lines": [ + { + "bbox": [ + 37, + 31, + 195, + 112 + ], + "spans": [ + { + "bbox": [ + 37, + 31, + 195, + 112 + ], + "type": "image", + "image_path": "e9cbb42702f7687243747090f2e2f9c99a7521e08a624871189b625df04a8039.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 84, + 113, + 147, + 123 + ], + "lines": [ + { + "bbox": [ + 84, + 113, + 147, + 123 + ], + "spans": [ + { + "bbox": [ + 84, + 113, + 147, + 123 + ], + "type": "text", + "content": "(a) Factor Graph" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 199, + 30, + 373, + 112 + ], + "blocks": [ + { + "bbox": [ + 199, + 30, + 373, + 112 + ], + "lines": [ + { + "bbox": [ + 199, + 30, + 373, + 112 + ], + "spans": [ + { + "bbox": [ + 199, + 30, + 373, + 112 + ], + "type": "image", + "image_path": "ece40848923e6c99ad24958d2e65dc8478d19c5b165985e6ced635208647bd57.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 249, + 113, + 323, + 123 + ], + "lines": [ + { + "bbox": [ + 249, + 113, + 323, + 123 + ], + "spans": [ + { + "bbox": [ + 249, + 113, + 323, + 123 + ], + "type": "text", + "content": "(b) Message Passing" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "lines": [ + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "spans": [ + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "type": "text", + "content": "Fig. 3: (a) Qualitative illustration of the factor graphs resulting from a continuous-time motion parametrization. Notably, even one of the simplest factor archetypes, which purely relies on the motion-parameterizing nodes as well as some landmarks, introduces a considerable amount of loops in the continuous-time realm. This can be attributed to the fact that poses " + }, + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "type": "inline_equation", + "content": "T_{wb}(t)" + }, + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "type": "text", + "content": " depend on multiple bases for any given time " + }, + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "type": "text", + "content": ". (b) Visualization of the message passing algorithm between nodes and factors in a graph " + }, + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 30, + 132, + 380, + 199 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "spans": [ + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "text", + "content": "Gaussian Belief Propagation (GBP) As illustrated in Fig. 3a, Eqs. (3) and (7) expose equivalent visual representations as factor graphs, giving rise to compact and intuitive descriptions of complex probabilistic dependencies which are encoded into bipartite graphs " + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "text", + "content": " containing factors " + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "inline_equation", + "content": "f_{i} \\sim \\mathcal{N}^{-1}(\\pmb{\\eta}_{f_{i}}, \\pmb{\\Lambda}_{f_{i}})" + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "text", + "content": " and nodes " + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "inline_equation", + "content": "n_j \\sim \\mathcal{N}(\\pmb{\\mu}_{n_j}, \\pmb{\\Sigma}_{n_j}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_j}, \\pmb{\\Lambda}_{n_j})" + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "text", + "content": ". Intuitively, the GBP algorithm, thus, comprises two steps to iteratively solve for the optimal solution to Eq. (7), namely node and factor updates with intermediate factor-to-node " + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{f_i \\rightarrow n_j}" + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "text", + "content": " and node-to-factor " + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{n_j \\rightarrow f_i}" + }, + { + "bbox": [ + 30, + 220, + 380, + 318 + ], + "type": "text", + "content": " message passing detailed in the following." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "spans": [ + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "text", + "content": "Node Updates: The Gaussian nodes " + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "inline_equation", + "content": "n_j \\in \\mathcal{G}" + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "text", + "content": " with neighborhood " + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "inline_equation", + "content": "N(n_j)" + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "text", + "content": " of connected factors " + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "inline_equation", + "content": "f_i \\in N(n_j)" + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "text", + "content": " are updated by taking the product over incoming factor-to-node messages " + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{f_i \\to n_j}" + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "text", + "content": ", which reduces to a simple summation of Gaussians for (linear) vector spaces, resulting in node beliefs " + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "inline_equation", + "content": "B(n_j) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_j}, \\pmb{\\Lambda}_{n_j})" + }, + { + "bbox": [ + 30, + 327, + 381, + 376 + ], + "type": "text", + "content": ", where" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 51, + 392, + 380, + 420 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 51, + 392, + 380, + 420 + ], + "spans": [ + { + "bbox": [ + 51, + 392, + 380, + 420 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\eta} _ {n _ {j}} = \\boldsymbol {\\eta} _ {n _ {j}} ^ {p} + \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\eta} _ {f _ {i} \\rightarrow n _ {j}} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} = \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {p} + \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}}. \\tag {13}", + "image_path": "5860fd85bd1e4b037db263a7eaba9190468b2ca5c80e1a152aee0c0a27b673de.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "spans": [ + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "content": "Above, " + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "inline_equation", + "content": "P(n_{j}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{n_{j}}^{p},\\pmb{\\Lambda}_{n_{j}}^{p})" + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "content": " denotes a known prior on the node belief " + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "inline_equation", + "content": "B(n_{j})" + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "content": " which can be leveraged to better constrain the problem in practice. However, despite its simplicity and elegance, this straightforward approach can not be applied to Lie groups " + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "content": " with associated tangent space " + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "inline_equation", + "content": "\\mathfrak{g}" + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "content": " and their operators " + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "inline_equation", + "content": "\\boxminus : G \\times G \\mapsto \\mathfrak{g}" + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "inline_equation", + "content": "\\boxplus : G \\times \\mathfrak{g} \\mapsto G" + }, + { + "bbox": [ + 30, + 428, + 380, + 511 + ], + "type": "text", + "content": " extensively used in robotics. Hence, a more sophisticated approach is required to obtain the product of factor-to-node messages and to handle frame conversions between elements in the Lie group." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "spans": [ + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "text", + "content": "To this end, we follow a similar strategy as Murai et al. [28] and propose the use of a Mixed Gaussian Representation (MGR) to parameterize Lie-group-valued nodes as " + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "inline_equation", + "content": "n_j \\sim \\mathfrak{N}(\\pmb{\\mu}_{n_j}, \\pmb{\\Lambda}_{n_j})" + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "inline_equation", + "content": "\\pmb{\\mu}_{n_j} \\in G" + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{n_j} \\in \\mathbb{R}^{\\dim(\\mathfrak{g}) \\times \\dim(\\mathfrak{g})}" + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "text", + "content": ", also assuming that incoming message " + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{f_i \\to n_j} \\sim \\mathfrak{N}(\\pmb{\\mu}_{f_i \\to n_j}, \\pmb{\\Lambda}_{f_i \\to n_j})" + }, + { + "bbox": [ + 30, + 511, + 380, + 584 + ], + "type": "text", + "content": " take the same form. In contrast to conventional vector spaces, the precision matrices are expressed relative to their associated elements in the Lie group, implying that" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 32, + 10, + 39, + 18 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 10, + 39, + 18 + ], + "spans": [ + { + "bbox": [ + 32, + 10, + 39, + 18 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 66, + 9, + 119, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 66, + 9, + 119, + 20 + ], + "spans": [ + { + "bbox": [ + 66, + 9, + 119, + 20 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 30, + 35, + 381, + 71 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 35, + 381, + 71 + ], + "spans": [ + { + "bbox": [ + 30, + 35, + 381, + 71 + ], + "type": "text", + "content": "one must warp them to a privileged frame of reference. An intuitive choice for such a frame is the latest estimate of the node's state, denoted as " + }, + { + "bbox": [ + 30, + 35, + 381, + 71 + ], + "type": "inline_equation", + "content": "\\pmb{\\mu}_{n_j}^0" + }, + { + "bbox": [ + 30, + 35, + 381, + 71 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 35, + 381, + 71 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{n_j}^0" + }, + { + "bbox": [ + 30, + 35, + 381, + 71 + ], + "type": "text", + "content": ", resulting in the following transformation rules to warp the messages." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 127, + 76, + 380, + 92 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 127, + 76, + 380, + 92 + ], + "spans": [ + { + "bbox": [ + 127, + 76, + 380, + 92 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} = \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}} \\boxminus \\boldsymbol {\\mu} _ {n _ {j}} ^ {0} \\quad \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g})} \\tag {14}", + "image_path": "06c8082ba0598f891c4bb387e52a0f7bc94d1ee579ed372fba6b0dbabbba4eb4.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 69, + 94, + 380, + 129 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 69, + 94, + 380, + 129 + ], + "spans": [ + { + "bbox": [ + 69, + 94, + 380, + 129 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} = \\left[ \\frac {\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}}{\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} \\left[ \\frac {\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}}{\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {j}}} \\right] \\quad \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g}) \\times \\dim (\\mathfrak {g})} \\tag {15}", + "image_path": "d2f942ea9fca1ac0ab710a4e8e83e4adb5df6e853a4988539803a954e547c3e7.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 30, + 135, + 380, + 173 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 135, + 380, + 173 + ], + "spans": [ + { + "bbox": [ + 30, + 135, + 380, + 173 + ], + "type": "text", + "content": "After this conversion, both " + }, + { + "bbox": [ + 30, + 135, + 380, + 173 + ], + "type": "inline_equation", + "content": "\\pmb{\\tau}_{f_i\\rightarrow n_j}^0" + }, + { + "bbox": [ + 30, + 135, + 380, + 173 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 135, + 380, + 173 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{f_i\\rightarrow n_j}^0" + }, + { + "bbox": [ + 30, + 135, + 380, + 173 + ], + "type": "text", + "content": " are elements in the tangent (matrix) space relative to the privileged frame and must then be summed in analogy to Eq. (13) to yield the intermediate, incremental values" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 65, + 180, + 380, + 207 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 65, + 180, + 380, + 207 + ], + "spans": [ + { + "bbox": [ + 65, + 180, + 380, + 207 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\tau} _ {n _ {j}} ^ {+} = \\alpha_ {n _ {j}} \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j})} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0}, \\tag {16}", + "image_path": "ec7932f27f95b2022a5e276528a104cf5ed9bb2cd1eceaecd3267c1a8710f5b7.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 30, + 213, + 379, + 238 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 213, + 379, + 238 + ], + "spans": [ + { + "bbox": [ + 30, + 213, + 379, + 238 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 30, + 213, + 379, + 238 + ], + "type": "inline_equation", + "content": "\\alpha_{n_j}" + }, + { + "bbox": [ + 30, + 213, + 379, + 238 + ], + "type": "text", + "content": " denotes an optional step size. The above increments must then again be warped to the updated frame of reference by evaluating" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 85, + 244, + 380, + 274 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 85, + 244, + 380, + 274 + ], + "spans": [ + { + "bbox": [ + 85, + 244, + 380, + 274 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\mu} _ {n _ {j}} = \\boldsymbol {\\mu} _ {n _ {j}} ^ {0} \\boxplus \\boldsymbol {\\tau} _ {n _ {j}} ^ {+} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j}} = \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {n _ {j}}}{\\partial \\boldsymbol {\\tau} _ {n _ {j}} ^ {+}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {n _ {j}} ^ {+} \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {n _ {j}}}{\\partial \\boldsymbol {\\tau} _ {n _ {j}} ^ {+}} \\right]. \\tag {17}", + "image_path": "5dfe4a0452b6e1e210afd4049231b1e4378fddcf1a3cd87713a0b3f4f2a6d6bb.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 31, + 279, + 379, + 304 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 279, + 379, + 304 + ], + "spans": [ + { + "bbox": [ + 31, + 279, + 379, + 304 + ], + "type": "text", + "content": "Note, however, that priors can not be injected as simplistically as in Eq. (13) and need to be treated as proper factors in the context of Lie groups instead." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 31, + 313, + 379, + 349 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 313, + 379, + 349 + ], + "spans": [ + { + "bbox": [ + 31, + 313, + 379, + 349 + ], + "type": "text", + "content": "Node-to-factor Messages: The generation of node-to-factor messages mirrors the expressions from Eq. (16), differing only in excluding information stemming from the target factor in the sums. Hence, they encompass" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 39, + 356, + 380, + 383 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 39, + 356, + 380, + 383 + ], + "spans": [ + { + "bbox": [ + 39, + 356, + 380, + 383 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\tau} _ {n _ {j} \\rightarrow f _ {k}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j}) \\backslash f _ {k}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {n _ {j} \\rightarrow f _ {k}} ^ {+} = \\sum_ {f _ {i} \\in N (n _ {j}) \\backslash f _ {k}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {j}} ^ {0} \\tag {18}", + "image_path": "1c32692c722bc52f26755de0b7e83c8195366a69b7a3e4b1863e5d82f8a073e4.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "spans": [ + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "text", + "content": "alongside their respective linearization point " + }, + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "inline_equation", + "content": "\\pmb{\\mu}_{n_j}^0" + }, + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "text", + "content": " to form the outgoing message triplet " + }, + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "inline_equation", + "content": "(\\pmb{\\mu}_{n_j}^0, \\pmb{\\tau}_{n_j \\to f_k}^+, \\pmb{\\Lambda}_{n_j \\to f_k}^+)" + }, + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "text", + "content": " destined for the factor " + }, + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "inline_equation", + "content": "f_k" + }, + { + "bbox": [ + 30, + 390, + 379, + 442 + ], + "type": "text", + "content": ". Note, however, that another reevaluation of Eqs. (14) and (15) is required to generate outgoing messages that leverage the latest state estimate from Eq. (17)." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "spans": [ + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": "Factor Updates: In analogy to previous paragraphs, factors " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "f_{i} \\in \\mathcal{G}" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " depend on a collection of connected, neighboring nodes " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "N(f_{i})" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " which collectively determine the linearization point " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "\\pmb{\\theta}_{f_i}^0" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " for the residual evaluation " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "\\bar{\\pmb{r}}_{f_i}" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " from Eq. (2). The computation of the factor-to-node messages " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "m_{f_i \\to N(f_i)}" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " depends on the factor beliefs " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "B(f_{i}) = \\mathcal{N}^{-1}(\\pmb{\\eta}_{f_{i}}^{0},\\pmb{\\Lambda}_{f_{i}}^{0})" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " obtained from Eq. (12) as well as the auxiliary, intermediate quantities " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "\\pmb{\\eta}_{f_i}'" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{f_i}'" + }, + { + "bbox": [ + 30, + 452, + 380, + 528 + ], + "type": "text", + "content": " (used in the next paragraph) defined as" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 90, + 535, + 380, + 551 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 90, + 535, + 380, + 551 + ], + "spans": [ + { + "bbox": [ + 90, + 535, + 380, + 551 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} = \\boldsymbol {\\eta} _ {f _ {i}} ^ {0} + \\boldsymbol {\\eta} _ {N (f _ {i}) \\rightarrow f _ {i}} ^ {+} \\quad \\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} = \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {0} + \\boldsymbol {\\Lambda} _ {N (f _ {i}) \\rightarrow f _ {i}} ^ {+} \\tag {19}", + "image_path": "909b9976d36bb21caee9a625ae64d4f5c27243347580898635dccbb870e11c36.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 31, + 557, + 379, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 557, + 379, + 584 + ], + "spans": [ + { + "bbox": [ + 31, + 557, + 379, + 584 + ], + "type": "text", + "content": "Above, " + }, + { + "bbox": [ + 31, + 557, + 379, + 584 + ], + "type": "inline_equation", + "content": "\\pmb{\\eta}_{N(f_i)\\rightarrow f_i}^+" + }, + { + "bbox": [ + 31, + 557, + 379, + 584 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 31, + 557, + 379, + 584 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{N(f_i)\\rightarrow f_i}^+" + }, + { + "bbox": [ + 31, + 557, + 379, + 584 + ], + "type": "text", + "content": " denote stacked vector and block diagonal matrix versions of the neighborhood-to-factor messages (see Eqs. (20) and (21))." + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 347, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 347, + 20 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 347, + 20 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 373, + 10, + 379, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 373, + 10, + 379, + 19 + ], + "spans": [ + { + "bbox": [ + 373, + 10, + 379, + 19 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "spans": [ + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "text", + "content": "Factor-to-Node Messages: We illustrate the computation of the factor-to-node messages (see Fig. 3b) assuming a factor " + }, + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "inline_equation", + "content": "f_{i}" + }, + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "text", + "content": " which depends on two nodes, namely " + }, + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "inline_equation", + "content": "n_a" + }, + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "inline_equation", + "content": "n_b" + }, + { + "bbox": [ + 31, + 34, + 380, + 71 + ], + "type": "text", + "content": ". Thus, Eq. (19) takes the following form" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 141, + 81, + 379, + 108 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 81, + 379, + 108 + ], + "spans": [ + { + "bbox": [ + 141, + 81, + 379, + 108 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} = \\left[\\begin{array}{l}\\boldsymbol {\\eta} _ {a} ^ {\\prime}\\\\\\boldsymbol {\\eta} _ {b} ^ {\\prime}\\end{array}\\right] = \\boldsymbol {\\eta} _ {f _ {i}} ^ {0} + \\left[\\begin{array}{c}\\boldsymbol {\\eta} _ {n _ {a} \\rightarrow f _ {i}} ^ {+}\\\\\\boldsymbol {\\eta} _ {n _ {b} \\rightarrow f _ {i}} ^ {+}\\end{array}\\right] \\tag {20}", + "image_path": "c1e64497d1157f005bcd857db97ee44fe8e413c744ec5687c6bcec595a5524fa.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 111, + 379, + 138 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 106, + 111, + 379, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 379, + 138 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} = \\left[\\begin{array}{l l}\\boldsymbol {\\Lambda} _ {a a} ^ {\\prime}&\\boldsymbol {\\Lambda} _ {b a} ^ {\\prime \\top}\\\\\\boldsymbol {\\Lambda} _ {b a} ^ {\\prime}&\\boldsymbol {\\Lambda} _ {b b} ^ {\\prime}\\end{array}\\right] = \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {0} + \\left[\\begin{array}{c c}\\boldsymbol {\\Lambda} _ {n _ {a} \\rightarrow f _ {i}} ^ {+}&\\mathbf {0}\\\\\\mathbf {0}&\\boldsymbol {\\Lambda} _ {n _ {b} \\rightarrow f _ {i}} ^ {+}\\end{array}\\right]. \\tag {21}", + "image_path": "411eb13f0a51358de8668726ba8c4e8a2c124252556ab158bfa04d391aef40b9.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 30, + 148, + 379, + 184 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 148, + 379, + 184 + ], + "spans": [ + { + "bbox": [ + 30, + 148, + 379, + 184 + ], + "type": "text", + "content": "To retrieve the message " + }, + { + "bbox": [ + 30, + 148, + 379, + 184 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{f_i\\rightarrow n_a} = \\mathfrak{N}(\\pmb{\\mu}_{f_i\\rightarrow n_a},\\pmb{\\Lambda}_{f_i\\rightarrow n_a})" + }, + { + "bbox": [ + 30, + 148, + 379, + 184 + ], + "type": "text", + "content": ", the remaining nodes (i.e. " + }, + { + "bbox": [ + 30, + 148, + 379, + 184 + ], + "type": "inline_equation", + "content": "n_b" + }, + { + "bbox": [ + 30, + 148, + 379, + 184 + ], + "type": "text", + "content": " in this example) must initially be marginalized by computing the Schur complement defined as" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 56, + 193, + 379, + 209 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 56, + 193, + 379, + 209 + ], + "spans": [ + { + "bbox": [ + 56, + 193, + 379, + 209 + ], + "type": "interline_equation", + "content": "\\eta_ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\eta_ {a} ^ {0} - \\Lambda_ {b a} ^ {\\prime \\top} \\Lambda_ {b b} ^ {\\prime - 1} \\eta_ {b} ^ {\\prime} \\quad \\text {a n d} \\quad \\Lambda_ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\Lambda_ {a a} ^ {0} - \\Lambda_ {b a} ^ {\\prime \\top} \\Lambda_ {b b} ^ {\\prime - 1} \\Lambda_ {b a} ^ {\\prime}. \\tag {22}", + "image_path": "065ee395a6dd25c8d66f4497d5d6256cbc89e11531c971d1b0f4943fad004856.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "spans": [ + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "text", + "content": "In a similar vein, one obtains " + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{f_i \\to n_b}" + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "text", + "content": " by permuting " + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "inline_equation", + "content": "\\pmb{\\eta}_{f_i}'" + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{f_i}'" + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "text", + "content": " such that " + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "inline_equation", + "content": "n_a" + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "text", + "content": " is marginalized instead of " + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "inline_equation", + "content": "n_b" + }, + { + "bbox": [ + 30, + 219, + 379, + 243 + ], + "type": "text", + "content": ". In particular," + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 253, + 379, + 279 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 116, + 253, + 379, + 279 + ], + "spans": [ + { + "bbox": [ + 116, + 253, + 379, + 279 + ], + "type": "interline_equation", + "content": "\\left[ \\begin{array}{l} \\boldsymbol {\\eta} _ {b} ^ {\\prime} \\\\ \\boldsymbol {\\eta} _ {a} ^ {\\prime} \\end{array} \\right] = P \\boldsymbol {\\eta} _ {f _ {i}} ^ {\\prime} \\text {a n d} \\left[ \\begin{array}{c c} \\boldsymbol {\\Lambda} _ {b b} ^ {\\prime} & \\boldsymbol {\\Lambda} _ {a b} ^ {\\prime \\top} \\\\ \\boldsymbol {\\Lambda} _ {a b} ^ {\\prime} & \\boldsymbol {\\Lambda} _ {a a} ^ {\\prime} \\end{array} \\right] = P \\boldsymbol {\\Lambda} _ {f _ {i}} ^ {\\prime} P ^ {\\top}, \\tag {23}", + "image_path": "a476c1b822092cdb2317b8dc41cc6d6db224df159f529c838ab2881bc5e6dfd8.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "spans": [ + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "content": "which also naturally extends to factors touching more than two nodes. Readers might notice that our formulation differs from others found in the literature; this has the advantage that the formulations from Eqs. (20) and (21) allow for extremely efficient in-place permutations of " + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "inline_equation", + "content": "\\pmb{\\eta}_{f_i}^{\\prime}" + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{f_i}^{\\prime}" + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "content": " to marginalize many-node factors, limiting reallocations and recomputations. Mirroring the process in Eq. (17), it is necessary to convert the incremental values " + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "inline_equation", + "content": "\\pmb{\\eta}_{f_i\\rightarrow n_a}^{\\prime}" + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "inline_equation", + "content": "\\pmb{\\Lambda}_{f_i\\rightarrow n_a}^{\\prime}" + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "content": " into the updated, outgoing frame of reference, to obtain the message " + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{f_i\\rightarrow n_a}" + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "content": ", relying on an optional step size " + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "inline_equation", + "content": "\\alpha_{f_i}" + }, + { + "bbox": [ + 30, + 288, + 380, + 384 + ], + "type": "text", + "content": ". That is" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 42, + 395, + 379, + 410 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 42, + 395, + 379, + 410 + ], + "spans": [ + { + "bbox": [ + 42, + 395, + 379, + 410 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} = \\alpha_ {f _ {i}} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime - 1} \\boldsymbol {\\eta} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g})}, \\quad \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}} = \\boldsymbol {\\mu} _ {n _ {a}} ^ {0} \\boxplus \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\in G \\tag {24}", + "image_path": "55db7a125a6591e3af0b00d6043fa86c90044091a3d39a3d6639e1acc8d9b7ed.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 49, + 412, + 379, + 447 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 49, + 412, + 379, + 447 + ], + "spans": [ + { + "bbox": [ + 49, + 412, + 379, + 447 + ], + "type": "interline_equation", + "content": "\\text {a n d} \\quad \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} = \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}}}{\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime}} \\right] ^ {\\top} \\boldsymbol {\\Lambda} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime} \\left[ \\frac {\\partial \\boldsymbol {\\mu} _ {f _ {i} \\rightarrow n _ {a}}}{\\partial \\boldsymbol {\\tau} _ {f _ {i} \\rightarrow n _ {a}} ^ {\\prime}} \\right] \\in \\mathbb {R} ^ {\\dim (\\mathfrak {g}) \\times \\dim (\\mathfrak {g})}. \\tag {25}", + "image_path": "bc77e393181085e456231bda08db3cc277f70290c95247f0cd6a3a77372cdb63.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "spans": [ + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "text", + "content": "Robust Residuals and Energies: It is well understood that the presence of outliers in the optimization problem from Eq. (3) causes substantial issues in terms of converging to a globally optimal solution " + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "inline_equation", + "content": "\\Theta^{*}" + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "text", + "content": " due to the quadratic nature of the occurring cost terms. The same holds in the context of GBP, where outliers are bound to heavily influence the found solution as well. To address this issue we take inspiration from established NLLS approaches [1] and apply robust loss functions " + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "inline_equation", + "content": "\\rho" + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "text", + "content": " to Eqs. (3) and (9), resulting in modified expressions for the robust energies " + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "inline_equation", + "content": "\\vec{E}" + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "text", + "content": " and the robust optimal solution " + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "inline_equation", + "content": "\\check{\\Theta}^{*}" + }, + { + "bbox": [ + 30, + 459, + 380, + 555 + ], + "type": "text", + "content": ", provided for completeness only." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 160, + 565, + 379, + 586 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 565, + 379, + 586 + ], + "spans": [ + { + "bbox": [ + 160, + 565, + 379, + 586 + ], + "type": "interline_equation", + "content": "\\check {E} (t, \\boldsymbol {\\theta} _ {s}) = \\frac {1}{2} \\rho (\\bar {\\boldsymbol {r}} ^ {\\top} \\bar {\\boldsymbol {r}}) \\tag {26}", + "image_path": "9f5394a9afbe2af557ba383e9a092095bc778b5698cdb7c1aceecdb4541c978a.jpg" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 32, + 10, + 39, + 18 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 10, + 39, + 18 + ], + "spans": [ + { + "bbox": [ + 32, + 10, + 39, + 18 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "spans": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 42, + 380, + 81 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 42, + 380, + 81 + ], + "spans": [ + { + "bbox": [ + 132, + 42, + 380, + 81 + ], + "type": "interline_equation", + "content": "\\breve {\\boldsymbol {\\theta}} ^ {*} = \\underset {\\boldsymbol {\\Theta}} {\\operatorname {a r g m i n}} \\left[ \\sum_ {s \\in \\mathcal {S}} \\sum_ {t \\in \\mathcal {T} _ {s}} \\breve {E} (t, \\boldsymbol {\\theta} _ {s}) \\right] \\tag {27}", + "image_path": "16d2eb77c80f2808a8f141a1497aeead21e99b89746bbc078f54e24caf3a7708.jpg" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 30, + 84, + 379, + 109 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 84, + 379, + 109 + ], + "spans": [ + { + "bbox": [ + 30, + 84, + 379, + 109 + ], + "type": "text", + "content": "In particular, based on the methodology from Triggs et al. [41], the robust residual and Jacobian then take the following forms." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 151, + 114, + 380, + 140 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 151, + 114, + 380, + 140 + ], + "spans": [ + { + "bbox": [ + 151, + 114, + 380, + 140 + ], + "type": "interline_equation", + "content": "\\alpha^ {2} - 2 \\alpha - \\frac {2 \\rho^ {\\prime \\prime}}{\\rho^ {\\prime}} \\bar {\\boldsymbol {r}} _ {i} ^ {\\top} \\bar {\\boldsymbol {r}} _ {i} \\stackrel {!} {=} 0 \\tag {28}", + "image_path": "03fdabc8865b070024fa1c2a15f1c853bc78f6e8d69e4cf156c2d9487c16d44c.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 109, + 142, + 380, + 175 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 109, + 142, + 380, + 175 + ], + "spans": [ + { + "bbox": [ + 109, + 142, + 380, + 175 + ], + "type": "interline_equation", + "content": "\\check {\\boldsymbol {r}} _ {i} = \\frac {\\sqrt {\\rho^ {\\prime}}}{1 - \\alpha} \\bar {\\boldsymbol {r}} _ {i} \\quad \\check {\\boldsymbol {J}} _ {i} = \\sqrt {\\rho^ {\\prime}} \\left(1 - \\alpha \\frac {\\bar {\\boldsymbol {r}} _ {i} \\bar {\\boldsymbol {r}} _ {i} ^ {\\top}}{\\| \\bar {\\boldsymbol {r}} _ {i} \\| ^ {2}}\\right) \\bar {\\boldsymbol {J}} _ {i} \\tag {29}", + "image_path": "7a1a954b691c9e261d1e47196c8a42e7864765b00cecb311ca52c05e68f73a9b.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 30, + 182, + 381, + 267 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 182, + 381, + 267 + ], + "spans": [ + { + "bbox": [ + 30, + 182, + 381, + 267 + ], + "type": "text", + "content": "Non-Gaussian Nodes: Another extension to conventional GBP lies in classifying Gaussian nodes as either pure constants or as stochastic variables. This distinction streamlines computation given that the message marginalization " + }, + { + "bbox": [ + 30, + 182, + 381, + 267 + ], + "type": "inline_equation", + "content": "\\pmb{m}_{n_j\\rightarrow f_i}" + }, + { + "bbox": [ + 30, + 182, + 381, + 267 + ], + "type": "text", + "content": " across nodes via Cholesky decomposition exposes complexity " + }, + { + "bbox": [ + 30, + 182, + 381, + 267 + ], + "type": "inline_equation", + "content": "\\mathcal{O}(n^3)" + }, + { + "bbox": [ + 30, + 182, + 381, + 267 + ], + "type": "text", + "content": " which quickly becomes prohibitive. In particular, allowing non-variable parameters (e.g. extrinsic, intrinsic, offset etc.) to be treated as pure constants considerably reduces the dimensionality of the marginalization procedure without any drawbacks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 31, + 282, + 134, + 293 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 282, + 134, + 293 + ], + "spans": [ + { + "bbox": [ + 31, + 282, + 134, + 293 + ], + "type": "text", + "content": "3.4 Sensor Models" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 30, + 300, + 379, + 336 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 300, + 379, + 336 + ], + "spans": [ + { + "bbox": [ + 30, + 300, + 379, + 336 + ], + "type": "text", + "content": "In the following, we detail the employed absolute and visual sensor models, where expressions marked with " + }, + { + "bbox": [ + 30, + 300, + 379, + 336 + ], + "type": "inline_equation", + "content": "\\hat{\\cdot}" + }, + { + "bbox": [ + 30, + 300, + 379, + 336 + ], + "type": "text", + "content": " indicate estimizable parameters. Conversely, unless explicitly mentioned, all other variables are considered known and constant." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "spans": [ + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "text", + "content": "Absolute Sensor Model The predictions of absolute sensor measurements " + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "inline_equation", + "content": "\\hat{m}_s(t_m,\\Theta_s)" + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "text", + "content": " (e.g. absolute pose estimates extracted from AprilTags [29] or measurements obtained from a Motion Capture (MoCap) system) are evaluated using Eq. (30) and subsequently compared against their corresponding true measurements by applying the metric " + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "inline_equation", + "content": "\\boxdot_{\\mu}" + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "text", + "content": " in Eq. (31) where we make use of the logarithmic map for elements in " + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "inline_equation", + "content": "\\mathbb{S}\\mathbb{O}(3)" + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "inline_equation", + "content": "\\mathbb{SU}(2)" + }, + { + "bbox": [ + 30, + 351, + 380, + 424 + ], + "type": "text", + "content": " respectively." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 120, + 431, + 379, + 444 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 120, + 431, + 379, + 444 + ], + "spans": [ + { + "bbox": [ + 120, + 431, + 379, + 444 + ], + "type": "interline_equation", + "content": "\\hat {\\boldsymbol {m}} _ {s} \\left(t _ {m}, \\Theta_ {s}\\right) = \\hat {\\boldsymbol {T}} _ {w s} \\left(t _ {m}\\right) = \\hat {\\boldsymbol {T}} _ {w b} \\left(t _ {m}\\right) \\boldsymbol {T} _ {b s} \\tag {30}", + "image_path": "080e0373e73bb340ec2e5463724f3656a8daf1de3b5ad55f74b79302622d77ef.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 123, + 447, + 380, + 474 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 123, + 447, + 380, + 474 + ], + "spans": [ + { + "bbox": [ + 123, + 447, + 380, + 474 + ], + "type": "interline_equation", + "content": "\\hat {\\boldsymbol {T}} _ {w s} \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {T} _ {w s} = \\left[ \\begin{array}{c} \\log (\\hat {\\boldsymbol {q}} _ {w s} \\boldsymbol {q} _ {w s} ^ {- 1}) \\\\ \\hat {\\boldsymbol {t}} _ {w s} - \\boldsymbol {t} _ {w s} \\end{array} \\right] \\in \\mathbb {R} ^ {6} \\tag {31}", + "image_path": "769a66a01c3b4eb167da5ee9b2aa5c00898c4c6d250c10f3fae87a3c3da768a0.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "spans": [ + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "text", + "content": "Visual Sensor Model Abstracting from the specific camera parameters, such as its intrinsic and its distortion model, we introduce the mapping " + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "inline_equation", + "content": "\\pi(\\cdot)" + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "text", + "content": " in Eq. (32) to infer individual projections of landmarks " + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "inline_equation", + "content": "l_w" + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "text", + "content": " onto the image plane at time " + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "inline_equation", + "content": "t_m" + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "text", + "content": ". For visual, pixel-based measurements, the metric " + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "inline_equation", + "content": "\\boxdot_{\\mu}" + }, + { + "bbox": [ + 30, + 487, + 381, + 547 + ], + "type": "text", + "content": " is chosen to be equivalent to trivial Euclidean subtraction." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 110, + 554, + 380, + 568 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 110, + 554, + 380, + 568 + ], + "spans": [ + { + "bbox": [ + 110, + 554, + 380, + 568 + ], + "type": "interline_equation", + "content": "\\hat {\\boldsymbol {m}} _ {s} \\left(t _ {m}, \\Theta_ {s}\\right) = \\hat {\\boldsymbol {p}} _ {s} \\left(t _ {m}\\right) = \\pi \\left(\\boldsymbol {T} _ {s b} \\hat {\\boldsymbol {T}} _ {b w} \\left(t _ {m}\\right), l _ {w}\\right) \\tag {32}", + "image_path": "7f39829c809d9feef7669c1d4d968013a9d96fdfb66beb0afb0cd4637c937ff5.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 149, + 570, + 380, + 584 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 570, + 380, + 584 + ], + "spans": [ + { + "bbox": [ + 149, + 570, + 380, + 584 + ], + "type": "interline_equation", + "content": "\\hat {\\boldsymbol {p}} _ {s} \\boxminus_ {\\boldsymbol {\\mu}} \\boldsymbol {p} _ {s} = \\hat {\\boldsymbol {p}} _ {s} - \\boldsymbol {p} _ {s} \\in \\mathbb {R} ^ {2} \\tag {33}", + "image_path": "b0fbbe51ff7001a553e9b36c20751289cc53f4f1b86e4ad1f5f0a7fa955831d0.jpg" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "spans": [ + { + "bbox": [ + 372, + 10, + 379, + 19 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 32, + 35, + 97, + 46 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 35, + 97, + 46 + ], + "spans": [ + { + "bbox": [ + 32, + 35, + 97, + 46 + ], + "type": "text", + "content": "3.5 System" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 30, + 53, + 381, + 197 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 53, + 381, + 197 + ], + "spans": [ + { + "bbox": [ + 30, + 53, + 381, + 197 + ], + "type": "text", + "content": "Overview Our system is designed to efficiently support both batch and windowed optimizations, crucial for applications such as Bundle Adjustment (BA) and SLAM. Inspired by Ceres [1], it allows dynamic modification of nodes and factors between solver calls, features multiple solving strategies, namely synchronous and dropout, determining the order of node and factor updates and leverages multithreading to exploit the inherent parallelism of GBP methods, further boosting the overall performance. Optimizable parameters are added and removed in analogy to Ceres [1], with the notable distinction that GBP-based methods necessitate both an initial mean and covariance estimate for each parameter, unlike standard NLLS methods. This requirement, however, poses no practical hindrance as conservative guesses on the covariance suffice to bootstrap the algorithm." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 30, + 214, + 381, + 358 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 214, + 381, + 358 + ], + "spans": [ + { + "bbox": [ + 30, + 214, + 381, + 358 + ], + "type": "text", + "content": "Symbolic Factors Targeting the long-standing challenge of obtaining efficient, analytical expressions and derivatives of spline-based motion parameterizations and their associated cost factors, here, we leverage SymForce [22], a symbolic code generation framework, to completely automate this cumbersome, time-intensive and error-prone process. Taking inspiration from Sommer et al. [40], who exploited Lie-group-specific properties to simplify spline-related mathematical expressions, we supercharge their recursive spline formulation by combining it with SymForce [22] to obtain ultra-efficient " + }, + { + "bbox": [ + 30, + 214, + 381, + 358 + ], + "type": "inline_equation", + "content": "\\mathrm{C}++" + }, + { + "bbox": [ + 30, + 214, + 381, + 358 + ], + "type": "text", + "content": " cost factor implementations. Furthermore, recognizing the broader relevance of automated factor generation for (continuous-time) robotics applications, our framework offers a comprehensive library featuring spline-based and standard factors designed to seamlessly interoperate with both our framework and Ceres [1], facilitating widespread adoption." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 30, + 374, + 381, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 374, + 381, + 506 + ], + "spans": [ + { + "bbox": [ + 30, + 374, + 381, + 506 + ], + "type": "text", + "content": "Update Strategies Amongst many possible update strategies, we focus our attention on synchronous and dropout updates. Synchronous updates closely follow traditional NLLS algorithms, where residuals are completely re-evaluated in every solver iteration and where (non-constant) nodes and factors are sequentially updated in an alternating fashion to ensure optimal convergence. In contrast to traditional approaches, GBP, however, also accommodates selective updates based on a dropout strategy. That is, one assigns probabilities, " + }, + { + "bbox": [ + 30, + 374, + 381, + 506 + ], + "type": "inline_equation", + "content": "d_{n}" + }, + { + "bbox": [ + 30, + 374, + 381, + 506 + ], + "type": "text", + "content": " for nodes and " + }, + { + "bbox": [ + 30, + 374, + 381, + 506 + ], + "type": "inline_equation", + "content": "d_{f}" + }, + { + "bbox": [ + 30, + 374, + 381, + 506 + ], + "type": "text", + "content": " for factors, dictating their likelihood of being updated in each iteration. Although this may slow convergence, it intentionally compensates for stability challenges in loopy graphs while mimicking real-world scenarios with imperfect communication channels and delayed messages." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 32, + 523, + 130, + 536 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 523, + 130, + 536 + ], + "spans": [ + { + "bbox": [ + 32, + 523, + 130, + 536 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 32, + 547, + 381, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 547, + 381, + 584 + ], + "spans": [ + { + "bbox": [ + 32, + 547, + 381, + 584 + ], + "type": "text", + "content": "We evaluate the proposed system, coined Hyperion, empirically through simulations in MoCap (absolute) and localization settings, using a temporal interval of 0.1 seconds between adjacent spline bases along with the empirical step sizes" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "spans": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "spans": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 32, + 33, + 381, + 95 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 33, + 381, + 95 + ], + "spans": [ + { + "bbox": [ + 32, + 33, + 381, + 95 + ], + "type": "inline_equation", + "content": "\\alpha_{n_j} = \\alpha_{f_i} = 0.7" + }, + { + "bbox": [ + 32, + 33, + 381, + 95 + ], + "type": "text", + "content": " across all cases. The simulated trajectories span 10 seconds and mimic real-world conditions with appropriate initial perturbations, sensor acquisition rates, and measurement noise levels. Our analysis focuses on benchmarking Hyperion against Ceres [1], an established, centralized NLLS solver, and providing in-depth ablation studies on different aspects of the framework itself." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 33, + 110, + 137, + 123 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 110, + 137, + 123 + ], + "spans": [ + { + "bbox": [ + 33, + 110, + 137, + 123 + ], + "type": "text", + "content": "4.1 Absolute Setup" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 32, + 129, + 381, + 225 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 129, + 381, + 225 + ], + "spans": [ + { + "bbox": [ + 32, + 129, + 381, + 225 + ], + "type": "text", + "content": "We commence our analysis with the absolute sensor configuration, capturing measurements akin to the ones stemming from a MoCap system, where individual factors model direct observations of the underlying motion without auxiliary parameters/nodes. As such, they embody the most fundamental category of constraints, suggesting that derived factors, such as landmark projections or relative measurements, merely extend these elements, rendering them ideal candidates to analyze key properties of the proposed approach. In the following, we assume an acquisition rate of " + }, + { + "bbox": [ + 32, + 129, + 381, + 225 + ], + "type": "inline_equation", + "content": "40\\mathrm{Hz}" + }, + { + "bbox": [ + 32, + 129, + 381, + 225 + ], + "type": "text", + "content": " matching the real-world specifications." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 32, + 225, + 381, + 296 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 225, + 381, + 296 + ], + "spans": [ + { + "bbox": [ + 32, + 225, + 381, + 296 + ], + "type": "text", + "content": "Our initial examination centers on comparing the convergence behavior of Hyperion against Ceres [1] across varying levels of initial perturbations and measurement noise. To this end, both solvers are identically initialized to a modified ground truth motion, encompassing perturbations in rotations and translations. Furthermore, we make use of the synchronized vertex updates if not stated otherwise, aiming for a fair comparison against Ceres." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 32, + 296, + 381, + 356 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 296, + 381, + 356 + ], + "spans": [ + { + "bbox": [ + 32, + 296, + 381, + 356 + ], + "type": "text", + "content": "The qualitative outcomes of this setup are illustrated in Fig. 1, demonstrating that both Hyperion and Ceres converge to identical solutions even under substantial initial perturbation and considerable measurement noise. These observations are quantified in Tabs. 1a and 1b, indicating that motion estimates obtained from Hyperion and Ceres closely align across all levels of perturbation and noise." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 32, + 356, + 381, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 356, + 381, + 439 + ], + "spans": [ + { + "bbox": [ + 32, + 356, + 381, + 439 + ], + "type": "text", + "content": "Message dropouts, mimicking imperfect communication, have also been shown to enhance convergence [27, 31] in loopy graphs. Hence, we study their effect on the proposed GBP framework, summarizing key insights in Fig. 4a, revealing that Hyperion consistently converges toward identical solutions across various dropout ratios. Despite this, they also influence the required iteration count (i.e., updates of all vertices), with every " + }, + { + "bbox": [ + 32, + 356, + 381, + 439 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 32, + 356, + 381, + 439 + ], + "type": "text", + "content": " increase in dropouts entailing an additional 2-4 iterations until convergence is reached." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 32, + 439, + 381, + 583 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 439, + 381, + 583 + ], + "spans": [ + { + "bbox": [ + 32, + 439, + 381, + 583 + ], + "type": "text", + "content": "Furthermore, we find that different motion parameterizations, specifically cubic Z- and B-Splines [4, 17], also influence the convergence of the proposed approach, which we summarize in Fig. 7b. A notable difference between the traditional and our proposed solver lies in how motion parameterizations affect the convergence speed of the latter. Our findings suggest that Z-Splines, which are interpolating rather than approximating splines, typically yield better-conditioned solutions since their bases must lie on the motion estimate itself, implicitly constraining the space of possible solutions. Naturally, the centralized NLLS solver sets a baseline for the required iteration count to resolve an optimization problem, serving as a comparative standard for our method. Thus, while GBP-based approaches are inherently distributed, Fig. 7b indicates that they impose between 2 to 4 additional iterations to achieve convergence." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 346, + 21 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 346, + 21 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 346, + 21 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 368, + 10, + 378, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 368, + 10, + 378, + 19 + ], + "spans": [ + { + "bbox": [ + 368, + 10, + 378, + 19 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 52, + 32, + 204, + 95 + ], + "blocks": [ + { + "bbox": [ + 52, + 32, + 204, + 95 + ], + "lines": [ + { + "bbox": [ + 52, + 32, + 204, + 95 + ], + "spans": [ + { + "bbox": [ + 52, + 32, + 204, + 95 + ], + "type": "table", + "html": "
Perturbation [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-65.2e-65.2e-65.9e-65.3e-6
t [m]5.8e-65.8e-65.9e-65.9e-66.0e-61.3e-5
Ceres
R [rad]5.2e-65.2e-65.2e-65.2e-65.2e-65.2e-6
t [m]5.9e-65.9e-65.9e-65.9e-65.9e-65.9e-6
", + "image_path": "73d7c3134a89c22a10c478e0129a341ad3738be5c03d293e318a634bb1715bfc.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 208, + 32, + 359, + 95 + ], + "blocks": [ + { + "bbox": [ + 79, + 97, + 176, + 106 + ], + "lines": [ + { + "bbox": [ + 79, + 97, + 176, + 106 + ], + "spans": [ + { + "bbox": [ + 79, + 97, + 176, + 106 + ], + "type": "text", + "content": "(a) Perturbation Tolerance" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 208, + 32, + 359, + 95 + ], + "lines": [ + { + "bbox": [ + 208, + 32, + 359, + 95 + ], + "spans": [ + { + "bbox": [ + 208, + 32, + 359, + 95 + ], + "type": "table", + "html": "
Noise [m/rad]
1e-51e-41e-31e-21e-11e-0
Ours
R [rad]5.2e-65.2e-55.2e-45.2e-35.3e-25.6e-1
t [m]5.8e-65.9e-55.9e-45.9e-35.9e-25.9e-1
Ceres
R [rad]5.2e-65.2e-55.2e-45.2e-35.2e-25.5e-1
t [m]5.9e-65.9e-55.9e-45.9e-35.9e-25.9e-1
", + "image_path": "c573ee122a2aadf22117d7b8a9ef5898d143bc20565dd4681372765dcc66e7de.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 48, + 192, + 173, + 295 + ], + "blocks": [ + { + "bbox": [ + 48, + 192, + 173, + 295 + ], + "lines": [ + { + "bbox": [ + 48, + 192, + 173, + 295 + ], + "spans": [ + { + "bbox": [ + 48, + 192, + 173, + 295 + ], + "type": "image", + "image_path": "d721a2fb4044be007aeeaf3ba2ca971c9e9779becda97843f055c6cc2507fda1.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 64, + 298, + 157, + 307 + ], + "lines": [ + { + "bbox": [ + 64, + 298, + 157, + 307 + ], + "spans": [ + { + "bbox": [ + 64, + 298, + 157, + 307 + ], + "type": "text", + "content": "(a) Convergence: Dropout" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 30, + 316, + 381, + 361 + ], + "lines": [ + { + "bbox": [ + 30, + 316, + 381, + 361 + ], + "spans": [ + { + "bbox": [ + 30, + 316, + 381, + 361 + ], + "type": "text", + "content": "Fig. 4: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the absolute setup (batch). (b) Performance comparison between our symbolically, auto-generated and optimized B-Spline implementation and the recursively-defined, hand-crafted implementation used by Sommer et al. [40] on an M3 Max @4.05GHz." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 184, + 192, + 362, + 286 + ], + "blocks": [ + { + "bbox": [ + 247, + 97, + 319, + 106 + ], + "lines": [ + { + "bbox": [ + 247, + 97, + 319, + 106 + ], + "spans": [ + { + "bbox": [ + 247, + 97, + 319, + 106 + ], + "type": "text", + "content": "(b) Noise Tolerance" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 30, + 115, + 380, + 159 + ], + "lines": [ + { + "bbox": [ + 30, + 115, + 380, + 159 + ], + "spans": [ + { + "bbox": [ + 30, + 115, + 380, + 159 + ], + "type": "text", + "content": "Table 1: Root Mean Square Errors (RMSEs) in rotation (R) and translation (t) resulting from Ceres [1] and Hyperion under different perturbation levels (a), different noise levels (b) respectively. The solvers run to convergence or terminate after 50 iterations. The perturbation/noise setup assumes the lowest noise/perturbation, respectively." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 184, + 192, + 362, + 286 + ], + "lines": [ + { + "bbox": [ + 184, + 192, + 362, + 286 + ], + "spans": [ + { + "bbox": [ + 184, + 192, + 362, + 286 + ], + "type": "table", + "html": "
SetupPose [s]Velocity [s]Acceleration [s]Avg. Speedup
Lkθ/DBOursBasaltOursBasaltOursBasalt
SO(3)4X1.64e-73.16e-79.49e-82.90e-71.12e-73.28e-72.64x
SO(3)4✓5.03e-76.70e-64.05e-77.82e-65.11e-79.46e-617.05x
SO(3)5X1.96e-74.14e-71.32e-73.67e-71.39e-73.96e-72.58x
SO(3)5✓6.89e-71.08e-55.82e-71.27e-57.87e-71.58e-519.19x
SO(3)6X2.17e-74.78e-71.82e-74.42e-71.81e-74.83e-72.43x
SO(3)6✓8.19e-71.57e-57.51e-71.87e-51.01e-62.43e-522.71x
SE(3)4X1.62e-77.03e-71.38e-77.46e-71.34e-76.88e-74.96x
SE(3)4✓5.71e-74.69e-59.11e-75.35e-51.12e-66.25e-565.56x
SE(3)5X1.96e-77.38e-71.91e-78.73e-71.70e-79.15e-74.57x
SE(3)5✓7.32e-79.64e-51.27e-69.44e-51.47e-61.14e-494.53x
SE(3)6X2.53e-79.11e-72.34e-71.12e-62.23e-71.12e-64.47x
SE(3)6✓9.29e-71.25e-41.54e-61.67e-41.99e-61.75e-4110.31x
", + "image_path": "6125068037a696973c69cb9f94fa835bc94492de186300eb78db8e4aeb9f696d.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 214, + 298, + 332, + 307 + ], + "lines": [ + { + "bbox": [ + 214, + 298, + 332, + 307 + ], + "spans": [ + { + "bbox": [ + 214, + 298, + 332, + 307 + ], + "type": "text", + "content": "(b) B-Spline Evaluation Timings" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 30, + 385, + 380, + 446 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 385, + 380, + 446 + ], + "spans": [ + { + "bbox": [ + 30, + 385, + 380, + 446 + ], + "type": "text", + "content": "Lastly, we benchmark Hyperion's real-world performance using a handheld camera to track a ChArUco [14] board, capturing a 60-second trajectory at " + }, + { + "bbox": [ + 30, + 385, + 380, + 446 + ], + "type": "inline_equation", + "content": "30\\mathrm{Hz}" + }, + { + "bbox": [ + 30, + 385, + 380, + 446 + ], + "type": "text", + "content": " with an iPhone 13 Pro. The analysis, detailed in Fig. 5, closely mirrors our previous analysis. However, we find that real-world motions, which innately expose a greater level of volatility than simulated ones, expose slower convergence." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 31, + 465, + 153, + 477 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 465, + 153, + 477 + ], + "spans": [ + { + "bbox": [ + 31, + 465, + 153, + 477 + ], + "type": "text", + "content": "4.2 Localization Setup" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 30, + 487, + 380, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 487, + 380, + 523 + ], + "spans": [ + { + "bbox": [ + 30, + 487, + 380, + 523 + ], + "type": "text", + "content": "In this section, we analyze our approach in a localization setup, where we model an image acquisition rate of " + }, + { + "bbox": [ + 30, + 487, + 380, + 523 + ], + "type": "inline_equation", + "content": "20\\mathrm{Hz}" + }, + { + "bbox": [ + 30, + 487, + 380, + 523 + ], + "type": "text", + "content": " and 50 randomized, observable landmarks at a range of 2 to " + }, + { + "bbox": [ + 30, + 487, + 380, + 523 + ], + "type": "inline_equation", + "content": "6\\mathrm{m}" + }, + { + "bbox": [ + 30, + 487, + 380, + 523 + ], + "type": "text", + "content": " across the modeled motion, mimicking real-world conditions." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 30, + 524, + 380, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 524, + 380, + 584 + ], + "spans": [ + { + "bbox": [ + 30, + 524, + 380, + 584 + ], + "type": "text", + "content": "Overall, the results from the localization setup are consistent with our earlier observations, as detailed in Figs. 6, 7a and 7c. However, Fig. 7a indicates that this setup is more agnostic to lower dropout ratios compared to the absolute case. Furthermore, the disparity between different motion parameterizations becomes more pronounced over the previous setup as may be observed from" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "spans": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "spans": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 37, + 32, + 131, + 123 + ], + "blocks": [ + { + "bbox": [ + 37, + 32, + 131, + 123 + ], + "lines": [ + { + "bbox": [ + 37, + 32, + 131, + 123 + ], + "spans": [ + { + "bbox": [ + 37, + 32, + 131, + 123 + ], + "type": "image", + "image_path": "a12eeec4d4bea3511a9cd2974a5777c37cfb27f1a5aed945f4c1f15edd198998.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 60, + 123, + 107, + 132 + ], + "lines": [ + { + "bbox": [ + 60, + 123, + 107, + 132 + ], + "spans": [ + { + "bbox": [ + 60, + 123, + 107, + 132 + ], + "type": "text", + "content": "(a) Estimate" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 138, + 31, + 249, + 121 + ], + "blocks": [ + { + "bbox": [ + 138, + 31, + 249, + 121 + ], + "lines": [ + { + "bbox": [ + 138, + 31, + 249, + 121 + ], + "spans": [ + { + "bbox": [ + 138, + 31, + 249, + 121 + ], + "type": "image", + "image_path": "24bb5aceb8b4fd3ed6e76e7a2310c62524ee55a417e094a4d684549150b84ea8.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 163, + 123, + 223, + 132 + ], + "lines": [ + { + "bbox": [ + 163, + 123, + 223, + 132 + ], + "spans": [ + { + "bbox": [ + 163, + 123, + 223, + 132 + ], + "type": "text", + "content": "(b) Convergence" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 256, + 31, + 381, + 121 + ], + "blocks": [ + { + "bbox": [ + 256, + 31, + 381, + 121 + ], + "lines": [ + { + "bbox": [ + 256, + 31, + 381, + 121 + ], + "spans": [ + { + "bbox": [ + 256, + 31, + 381, + 121 + ], + "type": "image", + "image_path": "914907b04b779d082fa880ffe442cbe4d9b93cd1f327151a5f1ab3d8c3a2bae6.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 287, + 123, + 351, + 132 + ], + "lines": [ + { + "bbox": [ + 287, + 123, + 351, + 132 + ], + "spans": [ + { + "bbox": [ + 287, + 123, + 351, + 132 + ], + "type": "text", + "content": "(c) Relative Error" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 52, + 186, + 147, + 276 + ], + "blocks": [ + { + "bbox": [ + 52, + 186, + 147, + 276 + ], + "lines": [ + { + "bbox": [ + 52, + 186, + 147, + 276 + ], + "spans": [ + { + "bbox": [ + 52, + 186, + 147, + 276 + ], + "type": "image", + "image_path": "8ede53e11f3d663aa303360b624c843307cf5cc48762cb3048e4b5c23a5c4028.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 61, + 277, + 132, + 286 + ], + "lines": [ + { + "bbox": [ + 61, + 277, + 132, + 286 + ], + "spans": [ + { + "bbox": [ + 61, + 277, + 132, + 286 + ], + "type": "text", + "content": "(a) At initialization" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "lines": [ + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "spans": [ + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "type": "text", + "content": "Fig.6: The motion estimates for Hyperion and a conventional NLLS solver [1] in magenta and white, respectively, converge to similar solutions close to ground truth (in green) in the localization setup, demonstrating robust convergence under poor pose " + }, + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "type": "inline_equation", + "content": "(\\pm 0.20\\mathrm{m / rad})" + }, + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "type": "text", + "content": " and landmark initialization " + }, + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "type": "inline_equation", + "content": "(\\pm 0.20\\mathrm{m})" + }, + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "type": "inline_equation", + "content": "\\pm 1" + }, + { + "bbox": [ + 30, + 295, + 380, + 341 + ], + "type": "text", + "content": " px measurement noise." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 150, + 186, + 244, + 276 + ], + "blocks": [ + { + "bbox": [ + 150, + 186, + 244, + 276 + ], + "lines": [ + { + "bbox": [ + 150, + 186, + 244, + 276 + ], + "spans": [ + { + "bbox": [ + 150, + 186, + 244, + 276 + ], + "type": "image", + "image_path": "5c2502a24ea4738fd7fe5614b84a9ba262de416a56a58e4d78e3d67674354f7a.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 149, + 277, + 242, + 287 + ], + "lines": [ + { + "bbox": [ + 149, + 277, + 242, + 287 + ], + "spans": [ + { + "bbox": [ + 149, + 277, + 242, + 287 + ], + "type": "text", + "content": "(b) After the " + }, + { + "bbox": [ + 149, + 277, + 242, + 287 + ], + "type": "inline_equation", + "content": "1^{\\mathrm{st}}" + }, + { + "bbox": [ + 149, + 277, + 242, + 287 + ], + "type": "text", + "content": " iteration" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 249, + 185, + 361, + 275 + ], + "blocks": [ + { + "bbox": [ + 30, + 142, + 380, + 175 + ], + "lines": [ + { + "bbox": [ + 30, + 142, + 380, + 175 + ], + "spans": [ + { + "bbox": [ + 30, + 142, + 380, + 175 + ], + "type": "text", + "content": "Fig.5: ChArUco [14] setup with overlapping motion estimates (a) from Hyperion and Ceres [1] in magenta and white, respectively. Illustration of the corresponding convergence (b) and the relative errors between the two converged estimates (c)." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 249, + 185, + 361, + 275 + ], + "lines": [ + { + "bbox": [ + 249, + 185, + 361, + 275 + ], + "spans": [ + { + "bbox": [ + 249, + 185, + 361, + 275 + ], + "type": "image", + "image_path": "03b853d16560c58c906d18decdc5caf2ab6072cff84a5090b676887b38182a0f.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 270, + 277, + 337, + 287 + ], + "lines": [ + { + "bbox": [ + 270, + 277, + 337, + 287 + ], + "spans": [ + { + "bbox": [ + 270, + 277, + 337, + 287 + ], + "type": "text", + "content": "(c) Absolute Error" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "bbox": [ + 30, + 364, + 380, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 364, + 380, + 426 + ], + "spans": [ + { + "bbox": [ + 30, + 364, + 380, + 426 + ], + "type": "text", + "content": "Fig. 7c. In general, visual setups also display higher volatility over absolute ones, with notable differences in estimates, especially towards the head and tails of the optimized splines. In a similar vein, we found that these numerical instabilities tend to have a destabilizing effect in loop graphs, posing considerable challenges to deploying the proposed system as a comprehensive SLAM system at present." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 31, + 443, + 169, + 455 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 443, + 169, + 455 + ], + "spans": [ + { + "bbox": [ + 31, + 443, + 169, + 455 + ], + "type": "text", + "content": "4.3 Performance Analysis" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "spans": [ + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "text", + "content": "As highlighted in Sec. 3.5, our framework leverages SymForce [22] to automate the generation of analytic cost factors, aiming to outperform hand-crafted implementations while mitigating development effort and programmatic errors. Thus, we test our auto-generated B-Spline implementation against Sommer et al.'s optimized, hand-crafted version [40]. The comparison, detailed in Fig. 4b, assesses the timings of pose, velocity, and acceleration evaluations for B-Splines of order " + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "text", + "content": ", within a Lie group " + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "inline_equation", + "content": "\\mathcal{L}" + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "text", + "content": ", potentially including the Jacobians " + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "inline_equation", + "content": "\\partial/\\partial\\mathcal{B}" + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "text", + "content": " with respect to the bases " + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "inline_equation", + "content": "\\mathcal{B}_i" + }, + { + "bbox": [ + 30, + 464, + 380, + 584 + ], + "type": "text", + "content": ". Figure 4b shows that our automated spline implementations significantly outperform the manual ones from [40], with speedups ranging from 2.43x to 110.31x. The performance gains are particularly notable in derivative" + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 368, + 10, + 379, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 368, + 10, + 379, + 19 + ], + "spans": [ + { + "bbox": [ + 368, + 10, + 379, + 19 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 37, + 31, + 148, + 121 + ], + "blocks": [ + { + "bbox": [ + 37, + 31, + 148, + 121 + ], + "lines": [ + { + "bbox": [ + 37, + 31, + 148, + 121 + ], + "spans": [ + { + "bbox": [ + 37, + 31, + 148, + 121 + ], + "type": "image", + "image_path": "1c359f089678e5e44ed331c46212b5ffed9817e7b92ce5892cb8d57790b6683b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 45, + 123, + 139, + 132 + ], + "lines": [ + { + "bbox": [ + 45, + 123, + 139, + 132 + ], + "spans": [ + { + "bbox": [ + 45, + 123, + 139, + 132 + ], + "type": "text", + "content": "(a) Convergence: Dropout" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 156, + 31, + 265, + 121 + ], + "blocks": [ + { + "bbox": [ + 156, + 31, + 265, + 121 + ], + "lines": [ + { + "bbox": [ + 156, + 31, + 265, + 121 + ], + "spans": [ + { + "bbox": [ + 156, + 31, + 265, + 121 + ], + "type": "image", + "image_path": "bcc7f82f8e68083a9f2298505f3d035ad06283af08f33c310920409213918855.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 163, + 123, + 259, + 132 + ], + "lines": [ + { + "bbox": [ + 163, + 123, + 259, + 132 + ], + "spans": [ + { + "bbox": [ + 163, + 123, + 259, + 132 + ], + "type": "text", + "content": "(b) Convergence: Absolute" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 30, + 142, + 380, + 175 + ], + "lines": [ + { + "bbox": [ + 30, + 142, + 380, + 175 + ], + "spans": [ + { + "bbox": [ + 30, + 142, + 380, + 175 + ], + "type": "text", + "content": "Fig. 7: (a) Graph energy vs. number of iterations conditioned on the dropout probability in the localization setup. Convergence comparison of different splines and solver variants in the absolute setups (b) and the localization setup (c), respectively." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 274, + 31, + 382, + 121 + ], + "blocks": [ + { + "bbox": [ + 274, + 31, + 382, + 121 + ], + "lines": [ + { + "bbox": [ + 274, + 31, + 382, + 121 + ], + "spans": [ + { + "bbox": [ + 274, + 31, + 382, + 121 + ], + "type": "image", + "image_path": "8147a5faf7d7982ada9723b0e206f77e586a2d7c00de6eed3c2462cdc8771c0c.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 275, + 123, + 381, + 132 + ], + "lines": [ + { + "bbox": [ + 275, + 123, + 381, + 132 + ], + "spans": [ + { + "bbox": [ + 275, + 123, + 381, + 132 + ], + "type": "text", + "content": "(c) Convergence: Localization" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 30, + 199, + 380, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 199, + 380, + 247 + ], + "spans": [ + { + "bbox": [ + 30, + 199, + 380, + 247 + ], + "type": "text", + "content": "evaluations, where [40] employs automatic differentiation to compute the Jacobians. Considering the long-standing computational challenges of CTSLAM methods, our automated approach not only reduces complexity but also narrows the performance divide with discrete-time SLAM." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 30, + 248, + 380, + 428 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 248, + 380, + 428 + ], + "spans": [ + { + "bbox": [ + 30, + 248, + 380, + 428 + ], + "type": "text", + "content": "We further analyze the single-core performance of the proposed GBP solver with Ceres [1], a conventional NLLS solver, within the previously discussed scenarios. For the absolute setup (400 pose measurements), Ceres averages 0.70 ms per iteration, whereas our method averages 4.18 ms to update all graph vertices (i.e. about 6x slower). In the localization scenario (10,000 landmark reprojections), Ceres requires 15 ms per iteration, compared to our solver's 112 ms per iteration (i.e. 7.5x slower). This performance gap is, however, largely mitigated by considering that Ceres excludes the (implicit) estimation of covariances, significantly reducing computational load, and that it has been extensively refined by numerous contributors over the years. Moreover, the intrinsic distributedness and parallelizability of GBP along with potential enhancements from adaptive vertex updates, leveraging covariance estimates to trigger selective updates, are promising avenues for further performance improvements. The above analysis suggests that, even in its present state, the proposed framework is capable of real-time execution for moderately sized problems." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 31, + 448, + 125, + 461 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 448, + 125, + 461 + ], + "spans": [ + { + "bbox": [ + 31, + 448, + 125, + 461 + ], + "type": "text", + "content": "5 Conclusions" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 30, + 476, + 380, + 583 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 476, + 380, + 583 + ], + "spans": [ + { + "bbox": [ + 30, + 476, + 380, + 583 + ], + "type": "text", + "content": "In this work, we present a fast, versatile GBP framework that targets distributed, continuous-time SLAM applications and leverages message-passing algorithms to achieve probabilistic inference. We demonstrate the efficacy and competitiveness of our method against a conventional NLLS solver [1] achieving similar convergence and performance properties in practical settings. We further provide a comprehensive library of high-performance implementations for continuous-time SLAM, comprising motion parameterizations as well as common factors. Based on our experiments, the proposed framework shows great promise in paving the way towards resilient, distributed, continuous-time SLAM solutions." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "spans": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "spans": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 32, + 33, + 139, + 47 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 33, + 139, + 47 + ], + "spans": [ + { + "bbox": [ + 32, + 33, + 139, + 47 + ], + "type": "text", + "content": "Acknowledgments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 30, + 59, + 381, + 84 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 30, + 59, + 381, + 84 + ], + "spans": [ + { + "bbox": [ + 30, + 59, + 381, + 84 + ], + "type": "text", + "content": "This work was partially funded by the European Research Council (ERC) Consolidator Grant project SkEyes (Grant agreement No. 101089328)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 32, + 103, + 98, + 116 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 103, + 98, + 116 + ], + "spans": [ + { + "bbox": [ + 32, + 103, + 98, + 116 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 33, + 129, + 380, + 583 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 36, + 129, + 380, + 151 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 36, + 129, + 380, + 151 + ], + "spans": [ + { + "bbox": [ + 36, + 129, + 380, + 151 + ], + "type": "text", + "content": "1. Agarwal, S., Mierle, K.: Ceres Solver, https://github.com/ceres-solver/ceres-solver, (2023, November 28)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 36, + 153, + 380, + 174 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 36, + 153, + 380, + 174 + ], + "spans": [ + { + "bbox": [ + 36, + 153, + 380, + 174 + ], + "type": "text", + "content": "2. Anderson, S., Dellaert, F., Barfoot, T.D.: A Hierarchical Wavelet Decomposition for Continuous-Time SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 373-380 (2014)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 36, + 175, + 380, + 206 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 36, + 175, + 380, + 206 + ], + "spans": [ + { + "bbox": [ + 36, + 175, + 380, + 206 + ], + "type": "text", + "content": "3. Bänninger, P., Alzugaray, I., Karrer, M., Chli, M.: Cross-agent Relocalization for Decentralized Collaborative SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5551-5557 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 37, + 207, + 380, + 230 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 37, + 207, + 380, + 230 + ], + "spans": [ + { + "bbox": [ + 37, + 207, + 380, + 230 + ], + "type": "text", + "content": "4. Becerra-Sagredo, J.T.: Z-Splines: Moment-conserving Cardinal Spline Interpolation of Compact Support for Arbitrarily Spaced Data. Sem. Appl. Math. (2003)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 37, + 230, + 380, + 263 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 37, + 230, + 380, + 263 + ], + "spans": [ + { + "bbox": [ + 37, + 230, + 380, + 263 + ], + "type": "text", + "content": "5. Bloesch, M., Burri, M., Omari, S., Hutter, M., Siegwart, R.: Iterated Extended Kalman Filter-based Visual-Inertial Odometry using Direct Photometric Feedback. Int. J. Rob. Reas. 36(10), 1053-1072 (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 37, + 263, + 380, + 295 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 37, + 263, + 380, + 295 + ], + "spans": [ + { + "bbox": [ + 37, + 263, + 380, + 295 + ], + "type": "text", + "content": "6. Bloesch, M., Omari, S., Hutter, M., Siegwart, R.: Robust Visual-Inertial Odometry using a Direct EKF-based Approach. In: IEEE Int. Conf. Int. Rob. Sys. pp. 298-304 (2015)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 37, + 297, + 380, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 37, + 297, + 380, + 329 + ], + "spans": [ + { + "bbox": [ + 37, + 297, + 380, + 329 + ], + "type": "text", + "content": "7. Campos, C., Elvira, R., Rodríguez, J.J.G., Montiel, J.M., Tardós, J.D.: ORBSLAM3: An Accurate Open-Source Library for Visual, Visual-Inertial and Multi-Map SLAM. IEEE Trans. Rob. 37(6), 1874-1890 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 37, + 329, + 380, + 351 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 37, + 329, + 380, + 351 + ], + "spans": [ + { + "bbox": [ + 37, + 329, + 380, + 351 + ], + "type": "text", + "content": "8. Davison, A.J., Ortiz, J.: FutureMapping 2: Gaussian Belief Propagation for Spatial AI. ArXiv (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 37, + 351, + 380, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 37, + 351, + 380, + 373 + ], + "spans": [ + { + "bbox": [ + 37, + 351, + 380, + 373 + ], + "type": "text", + "content": "9. Droeschel, D., Behnke, S.: Efficient Continuous-Time SLAM for 3D Lidar-based Online Mapping. In: IEEE Int. Conf. Rob. Aut. pp. 1-9 (05 2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 33, + 373, + 379, + 395 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 373, + 379, + 395 + ], + "spans": [ + { + "bbox": [ + 33, + 373, + 379, + 395 + ], + "type": "text", + "content": "10. Engel, J., Schöps, T., Cremers, D.: LSD-SLAM: Large-scale Direct Monocular SLAM. In: Eur. Conf. Comput. Vis. pp. 834-849 (2014)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 33, + 396, + 380, + 428 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 396, + 380, + 428 + ], + "spans": [ + { + "bbox": [ + 33, + 396, + 380, + 428 + ], + "type": "text", + "content": "11. Forster, C., Zhang, Z., Gassner, M., Werlberger, M., Scaramuzza, D.: SVO: Semidirect Visual Odometry for Monocular and Multicamera Systems. IEEE Trans. Rob. 33(2), 249-265 (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 33, + 429, + 379, + 451 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 429, + 379, + 451 + ], + "spans": [ + { + "bbox": [ + 33, + 429, + 379, + 451 + ], + "type": "text", + "content": "12. Furgale, P., D. Barfoot, T., Sibley, G.: Continuous-Time Batch Estimation using Temporal Basis Functions. Rob. Sc. Sys. 34, 2088-2095 (05 2012)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 33, + 452, + 379, + 472 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 452, + 379, + 472 + ], + "spans": [ + { + "bbox": [ + 33, + 452, + 379, + 472 + ], + "type": "text", + "content": "13. Furgale, P., Rehder, J., Siegwart, R.: Unified Temporal and Spatial Calibration for Multi-sensor Systems. In: IEEE Int. Conf. Int. Rob. Sys. pp. 1280-1286 (2013)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 33, + 473, + 379, + 506 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 473, + 379, + 506 + ], + "spans": [ + { + "bbox": [ + 33, + 473, + 379, + 506 + ], + "type": "text", + "content": "14. Garrido-Jurado, S., Muñoz-Salinas, R., Madrid-Cuevas, F.J., Marín-Jiménez, M.J.: Automatic Generation and Detection of Highly Reliable Fiducial Markers under Occlusion. Pattern Recognition 47(6), 2280-2292 (2014)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 33, + 507, + 379, + 528 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 507, + 379, + 528 + ], + "spans": [ + { + "bbox": [ + 33, + 507, + 379, + 528 + ], + "type": "text", + "content": "15. Hug, D., Bänninger, P., Alzugaray, I., Chli, M.: Continuous-Time Stereo-Inertial Odometry. IEEE Rob. Aut. Letters 7(3), 6455-6462 (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 33, + 529, + 379, + 561 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 529, + 379, + 561 + ], + "spans": [ + { + "bbox": [ + 33, + 529, + 379, + 561 + ], + "type": "text", + "content": "16. Hug, D., Chli, M.: HyperSLAM: A Generic and Modular Approach to Sensor Fusion and Simultaneous Localization and Mapping in Continuous-Time. In: Int. Conf. 3D Vis. pp. 978-986 (2020)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 33, + 562, + 380, + 583 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 562, + 380, + 583 + ], + "spans": [ + { + "bbox": [ + 33, + 562, + 380, + 583 + ], + "type": "text", + "content": "17. Kaihuai Qin: General Matrix Representations for B-splines. In: Pac. Conf. Comput. Graph. Appl. pp. 37-43 (10 1998)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 347, + 21 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 368, + 10, + 379, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 368, + 10, + 379, + 19 + ], + "spans": [ + { + "bbox": [ + 368, + 10, + 379, + 19 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 31, + 35, + 381, + 583 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 33, + 35, + 380, + 57 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 35, + 380, + 57 + ], + "spans": [ + { + "bbox": [ + 33, + 35, + 380, + 57 + ], + "type": "text", + "content": "18. Karrer, M., Chli, M.: Distributed Variable-baseline Stereo SLAM from two UAVs. In: IEEE Int. Conf. Rob. Aut. pp. 82-88 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 32, + 57, + 381, + 90 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 57, + 381, + 90 + ], + "spans": [ + { + "bbox": [ + 32, + 57, + 381, + 90 + ], + "type": "text", + "content": "19. Leutenegger, S., Lynen, S., Bosse, M., Siegwart, R., Furgale, P.: Keyframe-based Visual-inertial Odometry using Nonlinear Optimization. Int. J. Rob. Reas. 34, 314 - 334 (2015)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 31, + 90, + 380, + 123 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 90, + 380, + 123 + ], + "spans": [ + { + "bbox": [ + 31, + 90, + 380, + 123 + ], + "type": "text", + "content": "20. Lovegrove, S., Patron-Perez, A., Sibley, G.: Spline Fusion: A continuous-Time Representation for Visual-Inertial Fusion with Application to Rolling Shutter Cameras. In: Brit. Mach. Vis. Conf. vol. 2, p. 8 (2013)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 32, + 123, + 380, + 156 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 123, + 380, + 156 + ], + "spans": [ + { + "bbox": [ + 32, + 123, + 380, + 156 + ], + "type": "text", + "content": "21. Lynen, S., Achtelik, M.W., Weiss, S., Chli, M., Siegwart, R.: A Robust and Modular Multi-sensor Fusion Approach Applied to MAV Navigation. In: IEEE Int. Conf. Int. Rob. Sys. pp. 3923-3929 (2013)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 32, + 156, + 380, + 199 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 156, + 380, + 199 + ], + "spans": [ + { + "bbox": [ + 32, + 156, + 380, + 199 + ], + "type": "text", + "content": "22. Martiros, H., Miller, A., Bucki, N., Solliday, B., Kennedy, R., Zhu, J., Dang, T., Pattison, D., Zheng, H., Tomic, T., Henry, P., Cross, G., VanderMey, J., Sun, A., Wang, S., Holtz, K.: SymForce: Symbolic Computation and Code Generation for Robotics. In: Rob. Sc. Sys. (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 32, + 200, + 380, + 233 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 200, + 380, + 233 + ], + "spans": [ + { + "bbox": [ + 32, + 200, + 380, + 233 + ], + "type": "text", + "content": "23. Mascaro, R., Teixeira, L., Hinzmann, T., Siegwart, R., Chli, M.: GOMSF: Graph-Optimization Based Multi-Sensor Fusion for robust UAV Pose Estimation. In: IEEE Int. Conf. Rob. Aut. pp. 1421-1428 (2018)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 32, + 233, + 380, + 265 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 233, + 380, + 265 + ], + "spans": [ + { + "bbox": [ + 32, + 233, + 380, + 265 + ], + "type": "text", + "content": "24. Milford, M.J., Wyeth, G.F.: SeqSLAM: Visual Route-based Navigation for Sunny Summer Days and Stormy Winter Nights. In: IEEE Int. Conf. Rob. Aut. pp. 1643-1649 (2012)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 32, + 266, + 380, + 287 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 266, + 380, + 287 + ], + "spans": [ + { + "bbox": [ + 32, + 266, + 380, + 287 + ], + "type": "text", + "content": "25. Mueggler, E., Gallego, G., Rebecq, H., Scaramuzza, D.: Continuous-Time Visual-Inertial Odometry for Event Cameras. IEEE Trans. Rob. 34(6), 1425-1440 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 32, + 288, + 379, + 309 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 288, + 379, + 309 + ], + "spans": [ + { + "bbox": [ + 32, + 288, + 379, + 309 + ], + "type": "text", + "content": "26. Mur-Artal, R., Montiel, J., Tardós, J.D.: ORB-SLAM: A Versatile and Accurate Monocular SLAM System. IEEE Trans. Rob. 31, 1147-1163 (2015)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 32, + 310, + 380, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 310, + 380, + 342 + ], + "spans": [ + { + "bbox": [ + 32, + 310, + 380, + 342 + ], + "type": "text", + "content": "27. Murai, R., Alzugaray, I., Kelly, P.H., Davison, A.J.: Distributed Simultaneous Localisation and Auto-Calibration Using Gaussian Belief Propagation. IEEE Rob. Aut. Letters (2024)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 32, + 343, + 379, + 364 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 343, + 379, + 364 + ], + "spans": [ + { + "bbox": [ + 32, + 343, + 379, + 364 + ], + "type": "text", + "content": "28. Murai, R., Ortiz, J., Saeedi, S., Kelly, P.H., Davison, A.J.: A Robot Web for Distributed Many-Device Localisation. IEEE Trans. Rob. (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 32, + 364, + 380, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 364, + 380, + 386 + ], + "spans": [ + { + "bbox": [ + 32, + 364, + 380, + 386 + ], + "type": "text", + "content": "29. Olson, E.: AprilTag: A Robust and Flexible Visual Fiducial System. In: IEEE Int. Conf. Rob. Aut. pp. 3400-3407 (2011)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 32, + 386, + 379, + 408 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 386, + 379, + 408 + ], + "spans": [ + { + "bbox": [ + 32, + 386, + 379, + 408 + ], + "type": "text", + "content": "30. Ortiz, J., Evans, T., Davison, A.J.: A Visual Introduction to Gaussian Belief Propagation. ArXiv (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 32, + 408, + 379, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 408, + 379, + 429 + ], + "spans": [ + { + "bbox": [ + 32, + 408, + 379, + 429 + ], + "type": "text", + "content": "31. Ortiz, J., Evans, T., Sucar, E., Davison, A.J.: Incremental Abstraction in Distributed Probabilistic SLAM Graphs. In: IEEE Int. Conf. Rob. Aut. pp. 7566-7572 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 32, + 430, + 379, + 463 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 430, + 379, + 463 + ], + "spans": [ + { + "bbox": [ + 32, + 430, + 379, + 463 + ], + "type": "text", + "content": "32. Ortiz, J., Pupilli, M., Leutenegger, S., Davison, A.J.: Bundle Adjustment on a Graph Processor. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 2416-2425 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 32, + 463, + 379, + 485 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 463, + 379, + 485 + ], + "spans": [ + { + "bbox": [ + 32, + 463, + 379, + 485 + ], + "type": "text", + "content": "33. Oth, L., Furgale, P., Kneip, L., Siegwart, R.: Rolling Shutter Camera Calibration. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 1360-1367 (2013)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 32, + 485, + 379, + 517 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 485, + 379, + 517 + ], + "spans": [ + { + "bbox": [ + 32, + 485, + 379, + 517 + ], + "type": "text", + "content": "34. Peng, Z., Xu, Y., Yan, M., Yin, W.: ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates. J. Sc. Comput. 38(5), A2851-A2879 (2016)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 32, + 518, + 379, + 539 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 518, + 379, + 539 + ], + "spans": [ + { + "bbox": [ + 32, + 518, + 379, + 539 + ], + "type": "text", + "content": "35. Qin, T., Cao, S., Pan, J., Shen, S.: A General Optimization-based Framework for Global Pose Estimation with Multiple Sensors. ArXiv (2019)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 32, + 540, + 380, + 561 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 540, + 380, + 561 + ], + "spans": [ + { + "bbox": [ + 32, + 540, + 380, + 561 + ], + "type": "text", + "content": "36. Qin, T., Li, P., Shen, S.: VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimator. IEEE Trans. Rob. 34(4), 1004-1020 (2018)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 32, + 562, + 380, + 583 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 562, + 380, + 583 + ], + "spans": [ + { + "bbox": [ + 32, + 562, + 380, + 583 + ], + "type": "text", + "content": "37. Qin, T., Pan, J., Cao, S., Shen, S.: A General Optimization-based Framework for Local Odometry Estimation with Multiple Sensors. ArXiv (2019)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "spans": [ + { + "bbox": [ + 33, + 10, + 43, + 19 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "spans": [ + { + "bbox": [ + 65, + 9, + 120, + 20 + ], + "type": "text", + "content": "D. Hug et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 31, + 35, + 380, + 298 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 31, + 35, + 380, + 68 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 35, + 380, + 68 + ], + "spans": [ + { + "bbox": [ + 31, + 35, + 380, + 68 + ], + "type": "text", + "content": "38. Schmuck, P., Chli, M.: CCM-SLAM: Robust and Efficient Centralized Collaborative Monocular Simultaneous Localization and Mapping for Robotic Teams. J. Fld. Rob. 36(4), 763-781 (2019)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 31, + 68, + 379, + 90 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 31, + 68, + 379, + 90 + ], + "spans": [ + { + "bbox": [ + 31, + 68, + 379, + 90 + ], + "type": "text", + "content": "39. Schubert, D., Demmel, N., Usenko, V., Stuckler, J., Cremers, D.: Direct Sparse Odometry With Rolling Shutter. In: Eur. Conf. Comput. Vis. pp. 682-697 (2018)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 32, + 91, + 380, + 123 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 91, + 380, + 123 + ], + "spans": [ + { + "bbox": [ + 32, + 91, + 380, + 123 + ], + "type": "text", + "content": "40. Sommer, C., Usenko, V., Schubert, D., Demmel, N., Cremers, D.: Efficient Derivative Computation for Cumulative B-Splines on Lie Groups. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11145-11153 (2020)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 32, + 123, + 379, + 156 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 123, + 379, + 156 + ], + "spans": [ + { + "bbox": [ + 32, + 123, + 379, + 156 + ], + "type": "text", + "content": "41. Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle Adjustment - A Modern Synthesis. In: Vision Algorithms: Theory and Practice. pp. 298-372 (2000)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 32, + 156, + 380, + 188 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 156, + 380, + 188 + ], + "spans": [ + { + "bbox": [ + 32, + 156, + 380, + 188 + ], + "type": "text", + "content": "42. Usenko, V., Demmel, N., Schubert, D., Stuckler, J., Cremers, D.: Visual-Inertial Mapping With Non-linear Factor Recovery. IEEE Rob. Aut. Letters 5(2), 422-429 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 32, + 189, + 380, + 210 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 189, + 380, + 210 + ], + "spans": [ + { + "bbox": [ + 32, + 189, + 380, + 210 + ], + "type": "text", + "content": "43. Wang, R., Schworer, M., Cremers, D.: Stereo DSO: Large-scale Direct Sparse Visual Odometry with Stereo Cameras. In: Int. Conf. Comput. Vis. pp. 3903-3911 (2017)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 32, + 211, + 380, + 243 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 211, + 380, + 243 + ], + "spans": [ + { + "bbox": [ + 32, + 211, + 380, + 243 + ], + "type": "text", + "content": "44. Wang, S., Clark, R., Wen, H., Trigoni, N.: DeepVO: Towards end-to-end Visual Odometry with Deep Recurrent Convolutional Neural Networks. In: IEEE Int. Conf. Rob. Aut. pp. 2043-2050 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 32, + 244, + 380, + 276 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 244, + 380, + 276 + ], + "spans": [ + { + "bbox": [ + 32, + 244, + 380, + 276 + ], + "type": "text", + "content": "45. Wang, X., Xue, F., Yan, Z., Dong, W., Wang, Q., Zha, H.: Continuous-Time Stereo Visual Odometry Based on Dynamics Model. In: Asian Conf. Comput. Vis. pp. 388-403 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 32, + 277, + 380, + 298 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 32, + 277, + 380, + 298 + ], + "spans": [ + { + "bbox": [ + 32, + 277, + 380, + 298 + ], + "type": "text", + "content": "46. Yang, A.J., Cui, C., Bardsan, I.A., Urtasun, R., Wang, S.: Asynchronous Multi-view SLAM. In: IEEE Int. Conf. Rob. Aut. pp. 5669-5676 (2021)" + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 97, + 9, + 347, + 19 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 97, + 9, + 347, + 19 + ], + "spans": [ + { + "bbox": [ + 97, + 9, + 347, + 19 + ], + "type": "text", + "content": "Hyperion - A fast, versatile continuous-time GBP framework" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 368, + 11, + 379, + 19 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 368, + 11, + 379, + 19 + ], + "spans": [ + { + "bbox": [ + 368, + 11, + 379, + 19 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 413, + 615 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_content_list.json b/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..9e5e1e15e313f0debf2123216c1653960b7114f1 --- /dev/null +++ b/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_content_list.json @@ -0,0 +1,1595 @@ +[ + { + "type": "text", + "text": "Hypernetworks for Generalizable BRDF Representation", + "text_level": 1, + "bbox": [ + 271, + 140, + 730, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Fazilet Gokbudak, Alejandro Sztrajman, Chenliang Zhou, Fangcheng Zhong, Rafal Mantiuk, and Cengiz Oztireli", + "bbox": [ + 236, + 212, + 767, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "University of Cambridge, Cambridge, UK", + "bbox": [ + 361, + 255, + 640, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. In this paper, we introduce a technique to estimate measured BRDFs from a sparse set of samples. Our approach offers accurate BRDF reconstructions that are generalizable to new materials. This opens the door to BRDF reconstructions from a variety of data sources. The success of our approach relies on the ability of hypernetworks to generate a robust representation of BRDFs and a set encoder that allows us to feed inputs of different sizes to the architecture. The set encoder and the hypernetwork also enable the compression of densely sampled BRDFs. We evaluate our technique both qualitatively and quantitatively on the well-known MERL dataset of 100 isotropic materials. Our approach accurately 1) estimates the BRDFs of unseen materials even for an extremely sparse sampling, 2) compresses the measured BRDFs into very small embeddings, e.g., 7D.", + "bbox": [ + 261, + 306, + 743, + 474 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Reflectance $\\cdot$ BRDF $\\cdot$ Implicit Neural Representations", + "bbox": [ + 261, + 487, + 712, + 501 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 527, + 375, + 544 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In computer graphics and vision, achieving realistic renderings for intricate surface materials hinges on accurately describing the interaction of light with the surfaces. This is conventionally conveyed through the modeling and reconstruction of a 4D Bidirectional Reflectance Distribution Function (BRDF), which quantifies the relationship between the incident and outgoing light intensities for a specific material. In this work, we propose a novel generalizable BRDF representation model that can estimate the BRDFs of new materials from highly sparse and unstructured point-based samples1 and compress the densely sampled values into very small latent embeddings.", + "bbox": [ + 212, + 560, + 787, + 696 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "While there has been prior work that attempts to tackle similar tasks by estimating the free parameters of analytic BRDF functions or the principal components of BRDF functions from images or reflectance measurements, the oversimplified models of the complex BRDF function lead to inaccuracies when predicting real materials, thereby diminishing the realism in renderings [35]. Moreover, the process of fitting through nonlinear optimization is inherently unstable, computationally expensive, and prone to local minima, hindering the", + "bbox": [ + 212, + 696, + 787, + 803 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "1 Point-based samples refer to the BRDF values acquired at specific points on a surface with known viewing and lighting directions.", + "bbox": [ + 217, + 810, + 785, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "accurate reconstruction of material appearance [10,15]. Measured BRDFs of real-world materials can also be fraught with errors due to equipment limitations, adding to the complexity of the fitting process [36].", + "bbox": [ + 212, + 146, + 787, + 193 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/5778f2f64826dc37f5497541b24c55ae5587e88e9524001e143d857f1212f3d8.jpg", + "image_caption": [ + "Fig. 1: A room scene rendered with our reconstructed materials, including sparse reconstruction (table top and legs, door, door and picture frames, hinge), compression (two teapots on the left, door handle) and BRDF interpolation (right-most teapot). Scene courtesy of Benedikt Bitterli." + ], + "image_footnote": [], + "bbox": [ + 217, + 224, + 787, + 434 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Recent advances in deep learning have enabled the accurate representation of complex continuous signals (e.g. images, surfaces, volumes, materials, etc.) using a Neural Field [44, 47, 56], i.e. a neural network mapping coordinate inputs to sampled values, without compromising model compactness. Consequently, neural fields have gained substantial popularity for representing continuous BRDFs in recent works [46, 56]. However, reconstructing a neural field representation for BRDFs typically requires training the network with a regression loss function to overfit to a single material, which demands dense sampling and extensive computational resources, while being unable to generalize to new materials.", + "bbox": [ + 212, + 534, + 787, + 671 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "More recently, Generalizable Neural Fields [40] (GNFs) have emerged as a promising solution to the aforementioned challenges. Rather than overfitting to individual signals, GNFs are designed to learn a generalized mapping, either deterministic or probabilistic, between sampled signals and their full neural field representations in a fashion similar to supervised learning. The key strategy of GNFs involves conditioning the neural fields with a latent embedding of the signal samples. Popular conditioning mechanisms include concatenated latent vectors [37], hypernetworks [17], and attention-based set latent representations [20]. Once the conditional neural field is properly learned, reconstruction of the full signal can be achieved at inference time, and even with highly sparse and unstructured samples.", + "bbox": [ + 212, + 672, + 789, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Inspired by GNFs, we propose a novel framework for generalizable neural BRDF representation for both the estimation of unseen materials from sparse and unstructured samples and the compression of measured BRDFs into low-dimensional latent space. In this framework, we employ a multi-layer perceptron (MLP) model as the neural field backbone for BRDF representation, a hypernetwork for conditioning, and a set encoder that allows for mapping an arbitrary number of reflectance measurements from arbitrary directions to a compact latent embedding for conditional BRDF generation. The built-in nonlinear interpolation capability of the hyper-network also offers robust and adaptable material editing and blending across various sample sizes.", + "bbox": [ + 212, + 146, + 782, + 297 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Unlike previous work, our BRDF reconstruction is highly efficient without the need for extensive training to overfit individual materials, while also maintaining state-of-the-art performance in reconstruction accuracy for sample size below 4000; see Figure 4.", + "bbox": [ + 212, + 297, + 784, + 358 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, we offer a novel solution for the challenging task of generalizable BRDF modelling with the following key contributions:", + "bbox": [ + 214, + 359, + 784, + 388 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- Generalizability and Adaptability: Our methodology ensures robustness and adaptability across varying sample sizes and appearances, making it highly effective for estimating the BRDFs of unseen materials from highly sparse and unstructured sampling. Its adaptability also extends to highly compact representation of BRDFs, overall outperforming the prior state-of-the-art compression method; see Table 2.", + "bbox": [ + 225, + 401, + 782, + 491 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- Realism and Accuracy: Our extensive evaluation demonstrates the superior performance of our approach in reconstructing the BRDFs of 20 test materials from a limited number of samples, ranging from 40 to 4000, outperforming prior methods in terms of appearance modeling and color preservation (by at least 2dB in peak-signal-to-noise ratio and 1 in Delta E).", + "bbox": [ + 225, + 493, + 784, + 568 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 594, + 385, + 611 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Analytic BRDF Models", + "text_level": 1, + "bbox": [ + 214, + 630, + 457, + 645 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Analytic models are the most common representation for BRDFs. Classic BRDF models include Phong [5], Cook-Torrance [7], Ward [52] and GGX [50]. Following models have increased their reconstruction capabilities by combining analytic formulations with data-driven representations of some or all of their components [1, 2, 10]. Notably, the ABC model [26] has been shown to provide an accurate reconstruction of measured materials, while only requiring the fitting of a handful of tunable parameters. These models are usually fast at evaluation, easily editable, and present a low memory footprint. However, they usually rely on oversimplifications of the reflectance distribution shapes, and thus have a limited capacity for the reconstruction of complex real-world materials [15, 35]. Therefore, recent works have started exploring neural representations to overcome these limitations.", + "bbox": [ + 212, + 657, + 784, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.2 Regression-based BRDF Estimation", + "text_level": 1, + "bbox": [ + 215, + 146, + 558, + 161 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "For a simpler representation of measured BRDFs, BRDF decomposition methods, such as PCA decomposition [31, 36, 42], non-negative matrix factorization [23, 24], Gaussian mixture [45], tensor decomposition [4, 48] and non-parametric models [3] have been proposed. The main limitation of PCA and factorization methods is that they have a limited capacity to represent complex functions without overfitting to the training dataset. In contrast, our method can represent the complex BRDFs even with sparse samples while maintaining generalizability.", + "bbox": [ + 212, + 171, + 787, + 279 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Deep learning for BRDF modeling. Multiple methods have been recently proposed for neural BRDF representation [6,13,18,32,38,46,55,56]. These methods usually offer a flexible representation, and thus are well fitted to encode the complex reflectance distributions of real-world measured materials. However, an accurate fitting of these methods usually requires lengthy optimizations and a very large number of sample measurements, typically from $8 \\times 10^{5}$ to $1.5 \\times 10^{6}$ . [32] learned materials with baked illumination via small fully-connected networks. NBRDF [46] and CNF [56] leveraged neural fields to learn individual BRDF functions. Closer to our work, DeepBRDF [18] and Neural Processes [55] introduce neural network architectures to learn a compressed latent space from a dataset of multiple materials. However, these methods only address the problem of compressing BRDF samples into a low dimensional space, hence overfitting to the dataset. Our method, on the other hand, also offers a generalizable approach for the reliable reconstruction of unseen materials from sparse and unstructured real-world reflectance measurements.", + "bbox": [ + 212, + 292, + 787, + 518 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.3 Efficient BRDF Acquisition", + "text_level": 1, + "bbox": [ + 215, + 542, + 488, + 556 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Realistic reflectance acquisition commonly requires a large amount of physical acquisition samples collected from different directions, making the process time-consuming and data intensive. To take fewer samples, hence reducing the BRDF capture time, optimization of a sample pattern with a linear statistical analysis of a database of BRDFs [36] and the joint optimization of the sample pattern and a non-linear BRDF model [25] have been proposed.", + "bbox": [ + 212, + 566, + 787, + 657 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Spatially-varying BRDFs (SVBRDF): For efficient SVBRDF capture, several methods based on multiplexing-based, also known as illumination-based, acquisition systems [21, 22, 27, 28, 49] have been proposed. A common approach has been to optimize the lighting patterns for efficient acquisition, followed by a BRDF fitting to an analytic model. Recent works have also leveraged deep learning architectures to learn a mapping from images to texture maps of analytic SVBRDF parameters [8, 9, 14, 16, 19, 29, 57].", + "bbox": [ + 212, + 672, + 787, + 779 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In contrast to those works, our focus is the reconstruction of spatially uniform BRDF that can accurately represent arbitrary complex materials. The works on spatially-varying BRDFs and efficient capture could be considered orthogonal to ours, and those methods could be potentially combined with ours.", + "bbox": [ + 212, + 779, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 127 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/9081d45e11002abdffc295be161d850c9c35aab6f16dc09e29c56c1c58b332b3.jpg", + "image_caption": [ + "Fig. 2: During training, the set encoder and hypernetwork decoder are trained on a set of materials to predict the weights of hyponet (MLP) so that it can reconstruct the training set. The BRDF data is provided as a set of BRDF coordinates, $H_{n}, D_{n}$ , and the corresponding reflectance values $f_{r}(H_{n}, D_{n})$ . To reconstruct a new material from a small set of BRDF reflectance samples, the trained set encoder and hypernetwork decoder are used to predict the weights of hyponet for the unknown material. Once those weights are known, we can query BRDF at any coordinates and for any new materials, conditioned on the embedding of their sampled BRDF values." + ], + "image_footnote": [], + "bbox": [ + 217, + 147, + 787, + 308 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.4 Hypernetworks and GNFs", + "text_level": 1, + "bbox": [ + 215, + 463, + 478, + 479 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The capacity of hypernetworks to dynamically output neural network weights, which allows models to adjust to input conditions, has drawn attention. Its promise in a variety of computer vision tasks, including dynamic network adaptation and generating neural implicit fields, has been demonstrated by recent works, such as HyperGAN [39] and Hyperdiffusion [12]. The concept of a generalizable neural field has also been extensively applied to the reconstruction of neural radiance fields [51, 53], but not sufficiently studied in other domains. These research efforts serve as our source of inspiration as we apply hypernetworks and GNFs to BRDF estimation, improving the model's adaptability to various material appearances.", + "bbox": [ + 212, + 489, + 787, + 643 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 666, + 380, + 683 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Based on our observation that recent work misses a generalized and adaptable BRDF representation, we propose a novel representation for measured BRDFs that learns compact embeddings of the BRDFs with a hypernetwork model.", + "bbox": [ + 212, + 699, + 787, + 744 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Pre-processing", + "text_level": 1, + "bbox": [ + 215, + 768, + 385, + 784 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Measured BRDFs usually contain high dynamic range (HDR) data, including arbitrarily high values, especially for the specular components. Hence, we preprocess the BRDF data by applying a Log Relative Mapping [36] of the form:", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\rho^ {\\prime} = \\ln \\left(\\frac {\\rho + \\epsilon}{\\rho_ {r e f} + \\epsilon} + 1\\right) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 157, + 785, + 191 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\rho$ refers to the BRDF values, $\\epsilon = 0.002$ is a small constant value to avoid zero-division, and $\\rho_{ref}$ is a reference BRDF value for relative mapping. The reference BRDF value is chosen to be the median value for each angle over the entire dataset.", + "bbox": [ + 212, + 196, + 784, + 256 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We also observe that input parameterization has a strong impact on the reconstruction quality since it guides the neural network model to learn different aspects of the reflectance function. Therefore, similar to NBRDF [46], we express the BRDFs as functions of the Cartesian vectors $H$ and $D$ in the Rusinkiewicz parameterization [41], i.e., $\\rho = f_r(H, D)$ , where $H, D \\in S^2$ indirectly encode the information about the incident and outgoing light directions.", + "bbox": [ + 212, + 258, + 784, + 348 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Importantly, in this parameterization the directions of specular reflection have a single fixed representation as $H = (0,0,1)$ , which provides an easier pattern for the network to learn than the traditional $\\omega_{i}, \\omega_{o}$ encoding.", + "bbox": [ + 212, + 349, + 785, + 395 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Hypernetwork", + "text_level": 1, + "bbox": [ + 215, + 417, + 380, + 431 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In Figure 2, we show the diagram of our hypernetwork model [44] for BRDF representation, with three main components: 1) a set encoder that generates compact latent representations $Z$ of BRDFs based on an arbitrary number of directional samples, 2) a hypernetwork decoder that decodes the latent to estimate the parameters of a neural field, and 3) a neural field controlled by the decoder that represents the BRDFs of the material, which we refer to as a hyponet, following the convention of prior work [43].", + "bbox": [ + 212, + 444, + 787, + 551 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Set Encoder The set encoder takes as input an arbitrary set of samples, $n = 1..N$ , taken from a BRDF measurement. Each measurement consists of directional coordinates $H_{n}, D_{n}$ , given in the Rusinkiewicz parameterization [41], and their corresponding BRDF values $f_{r}(H_{n}, D_{n})$ . The set encoder is composed of four fully-connected layers with two hidden layers of feature size 128 for each. The input is the concatenation of BRDF values $(N, 3)$ and coordinates $(N, 6)$ . The activation function applied after each layer is ReLU. Each sample is encoded into a 40-dimensional embedding, and the sample set is reduced to a single embedding by applying a symmetric operation (averaging). The use of a set encoder, which is commonly adopted in point set networks [54], ensures permutation invariance and provides a high degree of flexibility in terms of the input, enabling the encoding of BRDFs with an arbitrary number of data-points, irregularly sampled, and in no pre-defined order.", + "bbox": [ + 212, + 574, + 787, + 771 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Hypernetwork Decoder and Hyponet The hypernetwork decoder converts the embeddings from the set encoder into the weights of the hyponet that represents the BRDFs of a single material. The hypernetwork decoder is composed", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "of 10 blocks of a fully-connected neural network with three layers. Each block outputs the corresponding weights and biases of hyponet. The hyponet consists of five fully-connected layers with input layer of size 6 for coordinates, three hidden layers of size 60 for each, output layer of size 3 for BRDF values. Our neural representation of materials, hyponet, follows the structure of NBRDF [46], but replaces the exponential activation in the last layer with a ReLU activation due to BRDF properties $(\\rho \\geq 0)$ . This network provides a continuous representation of a BRDF, and has been shown to provide state-of-the-art reconstructions of measured BRDFs, with performances competitive with the fastest analytic BRDF models.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Training", + "text_level": 1, + "bbox": [ + 215, + 325, + 333, + 340 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We train the hypernetwork by optimizing the following loss, which consists of a reconstruction term $\\mathcal{L}_{\\mathrm{rec}}$ and two regularization terms $\\mathcal{L}_{\\mathrm{weights}}$ and $\\mathcal{L}_{\\mathrm{latent}}$ for the hyponet weights $w$ and the latent embeddings $z$ [17]:", + "bbox": [ + 214, + 356, + 787, + 402 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {\\mathrm {r e c}} + \\lambda_ {1} \\underbrace {\\frac {1}{W} \\sum_ {j = 1} ^ {W} w _ {j} ^ {2}} _ {\\mathcal {L} _ {\\mathrm {w e i g h t s}}} + \\lambda_ {2} \\underbrace {\\frac {1}{Z} \\sum_ {k = 1} ^ {Z} z _ {k} ^ {2}} _ {\\mathcal {L} _ {\\mathrm {l a t e n t}}} \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 367, + 416, + 785, + 479 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We define the reconstruction loss as the mean squared error between the cosine weighted predicted and ground-truth BRDF values:", + "bbox": [ + 214, + 493, + 785, + 523 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {r e c}} = \\sum_ {n = 1} ^ {N} \\sum_ {m = 1} ^ {M} \\frac {\\left| \\left| \\rho_ {n , m} ^ {\\mathrm {p r e d}} \\cos \\theta_ {n , m} - \\rho_ {n , m} ^ {\\mathrm {t r u e}} \\cos \\theta_ {n , m} \\right| \\right| _ {2}}{N M} \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 540, + 785, + 580 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\rho_{n,m}^{\\mathrm{pred}}$ and $\\rho_{n,m}^{\\mathrm{true}}$ indicate the predicted and ground truth BRDF values of the $n$ -th sample of the $m$ -th material, both processed as described in Eqn 1, and $\\theta$ measures the angle between the incident ray and the surface normal. The cosine term weighs BRDFs based on the assumption of uniform incoming radiance and leads to more visually accurate results [33].", + "bbox": [ + 212, + 590, + 787, + 667 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We train our network for 80 epochs with 1458000 samples per material. It takes around 15 minutes with an NVIDIA A100 80GB GPU support.", + "bbox": [ + 214, + 667, + 785, + 699 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Inference: When inferring the reflectance values, our model first estimates hyponet weights from sparse samples of a test material, which takes around 0.01 seconds without GPU. Later, we feed query coordinates to the hyponet to predict the BRDF values of the material. With the conversion of the predicted BRDF into a renderable format, this process takes around 9 seconds without GPU. The continuous representation of BRDFs with the hyponet offers a nonlinear built-in interpolation and, hence, accurately reconstruct unseen materials from even a few samples.", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 143, + 375, + 162 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Datasets and Baselines", + "text_level": 1, + "bbox": [ + 215, + 174, + 452, + 189 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To show the effectiveness of our method, we use MERL [30] and RGL (51 isotropic materials) [11] datasets, which are the most commonly used BRDF datasets that include isotropic materials. The MERL dataset [30] consists of 100 real-world materials, covering a wide range of appearances. Each material includes reflectance measurements from a dense set of directions, parameterized as the spherical angles $(\\theta, \\phi)$ of the $H$ and $D$ vectors from the Rusinkiewicz parameterization [41]. Each color channel has a resolution of $90 \\times 90 \\times 180$ , leading to 1458000 reflectance measurements.", + "bbox": [ + 215, + 198, + 785, + 319 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Sparse BRDF Reconstruction", + "text_level": 1, + "bbox": [ + 215, + 340, + 504, + 356 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For comparison with baselines, we train our hypernetwork model with 80 MERL materials that are randomly selected. We leave the remaining 20 materials for testing. To understand the reconstruction capacity of our model, we first train the model with all available samples (1458000). We observe that reducing the number of samples by around half (640000) results in a similar performance (Section 7 in supplementary).", + "bbox": [ + 215, + 364, + 785, + 455 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We also train our model with a mixed dataset of 80 MERL materials and 51 isotropic RGL materials. We later test the trained model on the same test dataset (20 MERL materials). We apply a separate log relative mapping to RGL materials by computing the median over the isotropic RGL dataset.", + "bbox": [ + 215, + 455, + 785, + 516 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We qualitatively compare our results against the ground truths through renderings of the materials. The renderings are obtained by a Mitsuba renderer with an environment map illumination. Our model can capture the diffuse colors of varying unseen appearances even for the materials with specular components.", + "bbox": [ + 215, + 517, + 785, + 575 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The main advantage of our architecture is that it is flexible in the number of samples fed to the network. That is, we can reconstruct unseen materials with fewer samples than the sample number used during training. Thanks to its built-in nonlinear interpolation that comes from the hyponet, we obtain high quality reconstruction results with fewer samples.", + "bbox": [ + 215, + 577, + 785, + 651 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Considering our architecture, we understand that the gap between reconstruction results with sparse samples relies on the embeddings $z$ (latent vectors). We hence analyse the embeddings for the materials reconstructed with varying number of samples. In Figure 3, we visualize the t-SNE clustering of the test embeddings with different number of samples. It is visible that the embeddings of the same material reconstructed with different sample sizes lie close in the t-SNE space.", + "bbox": [ + 215, + 652, + 785, + 757 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Qualitative Comparison We first compare our results with the ground truth renderings for varying sample sizes. Figure 4 shows that the hypernetwork can still reconstruct test materials even with $N = 40$ samples. However, as we reduce the sample number to 10, the reconstruction quality highly decreases. For", + "bbox": [ + 215, + 779, + 785, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 127 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/8145642d307eea06008049af598f6d6b7352a87d789c6545dc60c4ddd140965b.jpg", + "image_caption": [ + "Fig. 3: t-SNE clustering of the test embeddings with different sample sizes, including $N = 8, 40, 160, 4000, 40000, 640000$ ." + ], + "image_footnote": [], + "bbox": [ + 282, + 145, + 715, + 431 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "additional results with different query sample sizes, please refer to our supplementary.", + "bbox": [ + 212, + 510, + 782, + 541 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "During inference time, hypernetwork fits the samples to a BRDF. Even with a few samples, it can still accurately reconstruct test materials. Its success comes from the fact that it learns a prior for material appearance through training with a dataset of multiple materials. Therefore, we validate our generalizable approach by comparing the hypernetwork with NBRDF [46] and PCA with Log Relative Mapping (IPCA) [36].", + "bbox": [ + 212, + 544, + 784, + 636 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "NBRDF [46] is designed to implicitly represent an individual BRDF. It can reconstruct materials with very high accuracy (Structural Similarity Index of around 0.995) when the sample size is high. It first trains the network on a material and then estimates the BRDF values of the same material. For a fair comparison, we first fit an NBRDF model to a material BRDF with the query sample size, then estimate the function with the same sample size.", + "bbox": [ + 212, + 638, + 787, + 731 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We also compare our results with a PCA-based strategy (IPCA). To represent the BRDF data, PCA-based methods [31, 34] construct a matrix $A \\in \\mathbb{R}^{m \\times n}$ , where $\\mathrm{n} = 180 \\times 90 \\times 90 \\times 3 = 4374000$ is the feature number, $\\mathrm{m} = 80$ is sample number. The matrix is later decomposed into its principal components via Singular Value Decomposition. PCA itself struggles with the decomposition of high dynamic range data. Therefore, the Log Relative Mapping (IPCA) is proposed [36], which is defined in our pre-processing step (Section 3.1). This", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/94141207d8a15185c478d854a536d9a2ef5e8814bcfdf89838f58ba313524932.jpg", + "image_caption": [ + "Fig.4: Qualitative comparison results for reconstruction with small sample sizes. Thanks to the prior that our hypernetwork model learns for material appearance through training, it can accurately estimate the BRDFs of unseen materials and preserve the colors better than the baselines." + ], + "image_footnote": [], + "bbox": [ + 240, + 142, + 767, + 515 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "improves the reconstruction quility, offering competitive reconstructions against our method as shown in Figure 4.", + "bbox": [ + 212, + 623, + 785, + 654 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "For all methods including ours, samples are drawn from a uniform distribution over Rusinkiewicz coordinates. For IPCA results, we split train and test dataset in the same way as ours, i.e., 80 MERL materials for train and 20 for test, and use all available samples for learning the principal components. To reconstruct the test materials from sparse samples, we first run a least-squared-error optimization and predict the weights of the material for the corresponding principal components. To decide the number of components, we ran an additional ablation study, where we computed the average mean squared error over the test dataset for the reconstruction from sparse samples ( $N = 40$ ). We observed that $(N_{PC} = 8)$ gives the minimum error on the test dataset. Hence, we choose the number of principal components as $N_{PC} = 8$ and keep it same for sparse sampling results.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 127 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/de1583087fc61aa4d2b9cc59d358374e64d96dbe4c4bb941f73c85563b22c3ac.jpg", + "image_caption": [ + "Fig. 5: Average PSNR, Delta E (CIE 2000), and SSIM results across different sample sizes." + ], + "image_footnote": [], + "bbox": [ + 223, + 143, + 406, + 265 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/7c1360fb89de230e4ac403c73d71d618f7856c798a21054857fc7cb52bd00b3f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 410, + 143, + 594, + 266 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/bcad545541c023484c3e67a8931d25e6d317936df3f2dc2a6b369859b8808db0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 596, + 161, + 779, + 266 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We keep the range for sparse sample numbers between $N = 40$ and $N = 4000$ . Figure 4 shows the rendering results for the minimum and maximum number of our range. Compared to both IPCA and NBRDF, our hypernetwork can capture the appearances more precisely. Although our approach has difficulty estimating specular components (last two rows in Figure 4), overall it offers reconstructions with much higher accuracy.", + "bbox": [ + 212, + 335, + 782, + 425 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We observe that the diffuse colors of some reconstructed materials by NBRDF can be completely off (natural-209, teflon) due to function fitting with sparse samples. Hypernetwork, on the other hand, can preserve diffuse colors better thanks to the prior it learns through training.", + "bbox": [ + 212, + 426, + 784, + 486 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Quantitative Evaluation We compare our method quantitatively with the aforementioned techniques in multiple image-based error metrics through rendering results. The metrics include peak signal-to-noise ratio (PSNR), Delta E (CIE 2000), and structural similarity index (SSIM). We take the average over the test dataset for each metric. We plot the metric results across five different sample sizes (40, 160, 400, 2000, 4000). Since we optimize IPCA on the test dataset for the $N = 40$ case, it offers more competitive results. Nevertheless, our method can reconstruct the BRDFs of unseen materials more precisely. Figure 5 shows that across all sample sizes, the hypernetwork attains superior performance in terms of PSNR, Delta E (CIE 2000) and SSIM.", + "bbox": [ + 212, + 507, + 782, + 657 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Additionally, Table 1 shows that expanding the training set, even with materials captured from a different point-based setup, helps improve the performance of the hypernetwork. Also, note that compared to MERL materials, the colors of RGL materials are more saturated, which could explain a slight increase in Delta E.", + "bbox": [ + 212, + 659, + 782, + 734 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Compression", + "text_level": 1, + "bbox": [ + 214, + 755, + 369, + 771 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The high capacity of the hypernetwork also allows the compression of the densely sampled BRDF data into low-dimensional latent representations. The hypernetwork can process highly compact BRDF embeddings, and once decoded, reconstructs the BRDF data precisely. We compare our method with Neural Processes", + "bbox": [ + 212, + 779, + 782, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/e7a2130f6efc9e2f42dd9bb730d9075d67e408c43990d4776f611bd52562353f.jpg", + "table_caption": [ + "Table 1: Hypernetwork sparse reconstruction - Average metric results across varying sample sizes $(N)$ over the test set. We highlight best and second best results." + ], + "table_footnote": [], + "table_body": "
NMERLMERL + RGL
PSNR↑Delta E↓SSIM↑PSNR↑Delta E↓SSIM↑
4029.5813.1890.96830.0183.1120.963
16031.3412.6810.97331.9292.4540.962
40032.7432.2720.97933.8552.4320.977
200034.5272.2560.97934.5272.2430.983
400033.1702.1380.97734.3552.1660.982
", + "bbox": [ + 246, + 184, + 754, + 303 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "(NPs) [55], the state-of-the-art BRDF compression method, and show that our hypernetwork model overall performs better in all three metrics.", + "bbox": [ + 212, + 334, + 782, + 364 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "To compare our method with NPs, we overfit our model to the mixed dataset of MERL and isotropic RGL materials, consisting of 151 materials in total. Since the latent dimension of NPs is 7D, we also train our network with 7D latent space. It is worth mentioning that NPs cause invalid sample values in certain MERL materials, blacking some parts of the renderings. In contrast, our method consistently decompresses materials with high reconstruction accuracy; see Table 2. Rendering results can be found in our supplementary (Compression.pdf).", + "bbox": [ + 212, + 366, + 784, + 470 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/ed20b409cf923f68596311efd8d6181b71e8a70d044a40355f9e00deb9ab0775.jpg", + "table_caption": [ + "Table 2: Compression - Average metric results over the renderings of the entire MERL dataset. We highlight best and second best results." + ], + "table_footnote": [], + "table_body": "
PSNR ↑Delta E ↓SSIM ↑
Ours (40D)47.6820.5670.994
Ours (7D)47.4920.5740.994
NPs46.1252.4240.935
IPCA29.8923.3150.979
", + "bbox": [ + 310, + 542, + 691, + 627 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 BRDF Editing", + "text_level": 1, + "bbox": [ + 215, + 686, + 383, + 702 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Compared to analytic BRDFs that have a fixed number of parameters to tweak, editing measured BRDFs is rather a nontrivial task due to irregular data structure. On the other hand, our network is capable of BRDF editing thanks to its representation of materials in a low-dimensional space. We can easily reconstruct various appearances by linearly interpolating between the embeddings of two different materials. Figure 7 shows newly-reconstructed materials through linear interpolation between two different embeddings from the reconstructed MERL materials.", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 127 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/ec5269031ee55064d7584483e30016266c710cf84c0533cc3bd66091213a40fe.jpg", + "image_caption": [ + "Fig. 6: Reconstruction results for BRDF compression (GT: ground truths)." + ], + "image_footnote": [], + "bbox": [ + 243, + 141, + 756, + 308 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/035b5ce1183bd56acad634c5ca506959ae8b49a2044f431b72646f4bf2017785.jpg", + "image_caption": [ + "Fig. 7: BRDF editing through linear interpolation between the embeddings of two materials." + ], + "image_footnote": [], + "bbox": [ + 245, + 347, + 756, + 507 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.5 Limitations and Future Work", + "text_level": 1, + "bbox": [ + 215, + 575, + 503, + 589 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Specular components: Our network struggles with the estimation of specular components as shown in Figure 4 (last two rows). It is likely because of the high gap between the values of diffuse that are close to zero and the values of specular components that are arbitrarily high. We consider a separate estimation pipeline for each component within the network to improve the results.", + "bbox": [ + 212, + 599, + 784, + 675 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "BRDF editing: Our BRDF editing approach is rather non-intuitive with an interpolation approach. Finding a map between the embeddings and certain attributes of the materials, such as diffuse/specular colors or haziness, can lead to more interactive BRDF editing. We plan to map our latent space to material parameter space so that users can easily edit materials through more interpretable parameters.", + "bbox": [ + 212, + 689, + 784, + 779 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "SVBRDF representations: In this work, we focused on the task of generalizable neural representations for spatially uniform BRDFs. As the future work, we plan to extend our model to SVBRDF representations.", + "bbox": [ + 212, + 794, + 784, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 143, + 359, + 160 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We presented a hypernetwork model for neural BRDF representation, which is suitable for point-based BRDF acquisition setups. Representing the discrete BRDF values of a material as a continuous generalizable neural field, our method offers (1) accurate reconstructions of unseen materials from a sparse set of samples and (2) compression of the highly densest BRDF values into compact latent representations.", + "bbox": [ + 212, + 178, + 785, + 267 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Thanks to the set encoder that enables an arbitrary number of input samples and the neural field, hyponet, that offers the nonlinear built-in interpolation, we showed that our hypernetwork model can capture the BRDFs of test materials better than our baselines. We also illustrated our model's compression capacity on the entire MERL dataset, showing consistent results across varying materials.", + "bbox": [ + 212, + 268, + 785, + 345 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 369, + 403, + 386 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This work was supported by a UKRI Future Leaders Fellowship [grant number G104084].", + "bbox": [ + 212, + 402, + 785, + 434 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 458, + 323, + 474 + ], + "page_idx": 13 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Ashikhmin, M., Premoze, S.: Distribution-based brdfs. Tech. rep., Stony Brook University (2007)", + "2. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016)", + "3. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016)", + "4. Bilgili, A., Öztürk, A., Kurt, M.: A general brdf representation based on tensor decomposition. In: Computer Graphics Forum. vol. 30, pp. 2427-2439. Wiley Online Library (2011)", + "5. Blinn, J.F.: Models of light reflection for computer synthesized pictures. In: Proceedings of the 4th annual conference on Computer graphics and interactive techniques. pp. 192-198 (1977)", + "6. Chen, Z., Nobuhara, S., Nishino, K.: Invertible neural brdf for object inverse rendering. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(12), 9380-9395 (2021)", + "7. Cook, R.L., Torrance, K.E.: A reflectance model for computer graphics. ACM Transactions on Graphics (ToG) 1(1), 7-24 (1982)", + "8. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Single-image svbrdf capture with a rendering-aware deep network. ACM Transactions on Graphics (ToG) 37(4), 1-15 (2018)", + "9. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Flexible svbrdf capture with a multi-image deep network. In: Computer graphics forum. vol. 38, pp. 1-13. Wiley Online Library (2019)" + ], + "bbox": [ + 222, + 489, + 785, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 126 + ], + "page_idx": 13 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "10. Dupuy, J., Heitz, E., Iehl, J.C., Poulin, P., Ostromoukhov, V.: Extracting microfacet-based brdf parameters from arbitrary materials with power iterations. Comput. Graph. Forum 34(4), 21-30 (Jul 2015)", + "11. Dupuy, J., Jakob, W.: An adaptive parameterization for efficient material acquisition and rendering. ACM Transactions on graphics (TOG) 37(6), 1-14 (2018)", + "12. Erkoc, Z., Ma, F., Shan, Q., Nießner, M., Dai, A.: Hyperdiffusion: Generating implicit neural fields with weight-space diffusion. arXiv preprint arXiv:2303.17015 (2023)", + "13. Fan, J., Wang, B., Hasan, M., Yang, J., Yan, L.Q.: Neural brdfs: Representation and operations. arXiv preprint arXiv:2111.03797 (2021)", + "14. Gao, D., Li, X., Dong, Y., Peers, P., Xu, K., Tong, X.: Deep inverse rendering for high-resolution svbrdf estimation from an arbitrary number of images. ACM Trans. Graph. 38(4), 134-1 (2019)", + "15. Guarnera, D., Guarnera, G., Ghosh, A., Denk, C., Glencross, M.: Brdf representation and acquisition. Computer Graphics Forum 35(2), 625-650 (2016). https://doi.org/https://doi.org/10.1111/cgi.f.12867, https://onlinelibrary.wiley.com/doi/abs/10.1111/cgi.f.12867", + "16. Guo, J., Lai, S., Tao, C., Cai, Y., Wang, L., Guo, Y., Yan, L.Q.: Highlight-aware two-stream network for single-image svbrdf acquisition. ACM Transactions on Graphics (TOG) 40(4), 1-14 (2021)", + "17. Ha, D., Dai, A.M., Le, Q.V.: Hypernetworks. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=rkpAce1lx", + "18. Hu, B., Guo, J., Chen, Y., Li, M., Guo, Y.: Deepbrdf: A deep representation for manipulating measured brdf. In: Computer Graphics Forum. vol. 39, pp. 157-166. Wiley Online Library (2020)", + "19. Hui, Z., Sunkavalli, K., Lee, J.Y., Hadap, S., Wang, J., Sankaranarayanan, A.C.: Reflectance capture using univariate sampling of brdfs. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 5362-5370 (2017)", + "20. Jiang, W., Trulls, E., Hosang, J., Tagliasacchi, A., Yi, K.M.: Cotr: Correspondence transformer for matching across images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6207-6217 (2021)", + "21. Kang, K., et al.: Efficient reflectance capture using an autoencoder. ACM TOG 37(4), 127-1 (2018). https://doi.org/10.1145/3197517.3201279", + "22. Kang, K., et al.: Learning efficient illumination multiplexing for joint capture of reflectance and shape. ACM TOG 38(6), 165-1 (2019)", + "23. Lawrence, J., Ben-Artzi, A., DeCoro, C., Matusik, W., Pfister, H., Ramamoorthi, R., Rusinkiewicz, S.: Inverse shade trees for non-parametric material representation and editing. ACM Transactions on Graphics (ToG) 25(3), 735-745 (2006)", + "24. Lawrence, J., Rusinkiewicz, S., Ramamoorthi, R.: Efficient brdf importance sampling using a factored representation. ACM Transactions on Graphics (ToG) 23(3), 496-505 (2004)", + "25. Liu, C., Fischer, M., Ritschel, T.: Learning to learn and sample brdfs. In: Computer Graphics Forum. vol. 42, pp. 201-211. Wiley Online Library (2023)", + "26. Löw, J., Kronander, J., Ynnerman, A., Unger, J.: BRDF models for accurate and efficient rendering of glossy surfaces. ACM TOG 31(1), 9:1-9:14 (2012). https://doi.org/10.1145/2077341.2077350", + "27. Ma, X., et al.: Free-form scanning of non-planar appearance with neural trace photography. ACM TOG 40(4) (2021)", + "28. Ma, X., Xu, X., Zhang, L., Zhou, K., Wu, H.: Opensvbrdf: A database of measured spatially-varying reflectance. ACM Transactions on Graphics 42(6) (2023)" + ], + "bbox": [ + 215, + 146, + 787, + 840 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "29. Martin, R., Roullier, A., Rouffet, R., Kaiser, A., Boubekeur, T.: Materia: Single image high-resolution material capture in the wild. In: Computer Graphics Forum. vol. 41, pp. 163-177. Wiley Online Library (2022)", + "30. Matusik, W., Pfister, H., Brand, M., McMillan, L.: A data-driven reflectance model. ACM Transactions on Graphics (TOG) 22(3), 759-769 (Jul 2003). https://doi.org/10.1145/882262.882343, https://www.merl.com/publications/TR2003-83", + "31. Matusik, W.: A data-driven reflectance model. Ph.D. thesis, Massachusetts Institute of Technology (2003)", + "32. Maximov, M., Leal-Taixe, L., Fritz, M., Ritschel, T.: Deep appearance maps. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8729-8738 (2019)", + "33. Ngan, A., Durand, F., Matusik, W.: Experimental analysis of brdf models. Rendering Techniques 2005(16th), 2 (2005)", + "34. Ngan, A., Durand, F., Matusik, W.: Image-driven navigation of analytical brdf models. Rendering Techniques 2006, 399-407 (2006)", + "35. Ngan, A., Durand, F., Matusik, W.: Experimental Analysis of BRDF Models. In: Eurographics Symposium on Rendering. The Eurographics Association (2005). https://doi.org/10.2312/EGWR/EGSR05/117-126", + "36. Nielsen, J.B., Jensen, H.W., Ramamoorthi, R.: On optimal, minimal brdf sampling for reflectance acquisition. ACM Transactions on Graphics (TOG) 34(6), 1-11 (2015)", + "37. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019)", + "38. Rainer, G., Jakob, W., Ghosh, A., Weyrich, T.: Neural btf compression and interpolation. In: Computer Graphics Forum. vol. 38, pp. 235-244. Wiley Online Library (2019)", + "39. Ratzlaff, N., Fuxin, L.: Hypergan: A generative model for diverse, performant neural networks. In: International Conference on Machine Learning. pp. 5361-5369. PMLR (2019)", + "40. Rebain, D., Matthews, M.J., Yi, K.M., Sharma, G., Lagun, D., Tagliasacchi, A.: Attention beats concatenation for conditioning neural fields. arXiv preprint arXiv:2209.10684 (2022)", + "41. Rusinkiewicz, S.M.: A new change of variables for efficient brdf representation. In: Rendering Techniques' 98: Proceedings of the Eurographics Workshop in Vienna, Austria, June 29—July 1, 1998 9. pp. 11-22. Springer (1998)", + "42. Serrano, A., Gutierrez, D., Myszkowski, K., Seidel, H.P., Masia, B.: An intuitive control space for material appearance. arXiv preprint arXiv:1806.04950 (2018)", + "43. Sitzmann, V., Chan, E., Tucker, R., Snavely, N., Wetzstein, G.: Metasdf: Meta-learning signed distance functions. Advances in Neural Information Processing Systems 33, 10136-10147 (2020)", + "44. Sitzmann, V., Martel, J.N., Bergman, A.W., Lindell, D.B., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: NeurIPS (2020)", + "45. Sun, X., Zhou, K., Chen, Y., Lin, S., Shi, J., Guo, B.: Interactive relighting with dynamic brdfs. In: ACM SIGGRAPH 2007 papers, pp. 27-es (2007)", + "46. Sztrajman, A., Rainer, G., Ritschel, T., Weyrich, T.: Neural brdf representation and importance sampling. In: Computer Graphics Forum. vol. 40, pp. 332-346. Wiley Online Library (2021)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "F. Gokbudak et al.", + "bbox": [ + 271, + 114, + 398, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "47. Tancik, M., Srinivasan, P.P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J.T., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020)", + "48. Tongbuasirilai, T., Unger, J., Kronander, J., Kurt, M.: Compact and intuitive data-driven brdf models. The Visual Computer 36, 855-872 (2020)", + "49. Tunwattanapong, B., Fyffe, G., Graham, P., Busch, J., Yu, X., Ghosh, A., Debevec, P.: Acquiring reflectance and shape from continuous spherical harmonic illumination. ACM Transactions on graphics (TOG) 32(4), 1-12 (2013)", + "50. Walter, B., Marschner, S.R., Li, H., Torrance, K.E.: Microfacet models for refraction through rough surfaces. In: Proceedings of the 18th Eurographics Conference on Rendering Techniques. pp. 195-206. EGSR'07, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland (2007). https://doi.org/10.2312/EGWR/EGSR07/195-206, http://dx.doi.org/10.2312/EGWR/EGSR07/195-206", + "51. Wang, P., Chen, X., Chen, T., Venugopalan, S., Wang, Z., et al.: Is attention all nef needs? arXiv preprint arXiv:2207.13298 (2022)", + "52. Ward, G.J.: Measuring and modeling anisotropic reflection. In: Proceedings of the 19th annual conference on Computer graphics and interactive techniques. pp. 265-272 (1992)", + "53. Yang, H., Hong, L., Li, A., Hu, T., Li, Z., Lee, G.H., Wang, L.: Contranerf: Generalizable neural radiance fields for synthetic-to-real novel view synthesis via contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16508-16517 (2023)", + "54. Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R.R., Smola, A.J.: Deep sets. Advances in neural information processing systems 30 (2017)", + "55. Zheng, C., Zheng, R., Wang, R., Zhao, S., Bao, H.: A compact representation of measured brdfs using neural processes. ACM Transactions on Graphics (TOG) 41(2), 1-15 (2021)", + "56. Zhong, F., Fogarty, K., Hanji, P., Wu, T., Sztrajman, A., Spielberg, A., Tagliasacchi, A., Bosilj, P., Oztireli, C.: Neural fields with hard constraints of arbitrary differential order. arXiv preprint arXiv:2306.08943 (2023)", + "57. Zhou, X., Kalantari, N.K.: Adversarial single-image svbrdf estimation with hybrid training. In: Computer Graphics Forum. vol. 40, pp. 315-325. Wiley Online Library (2021)" + ], + "bbox": [ + 215, + 146, + 787, + 604 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Hypernetworks for Generalizable BRDF Representation", + "bbox": [ + 354, + 114, + 727, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_model.json b/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_model.json new file mode 100644 index 0000000000000000000000000000000000000000..f23c4440b435329ccdb0ec3fac0db11f52b765c1 --- /dev/null +++ b/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_model.json @@ -0,0 +1,2225 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.272, + 0.141, + 0.731, + 0.187 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "text", + "bbox": [ + 0.237, + 0.213, + 0.768, + 0.244 + ], + "angle": 0, + "content": "Fazilet Gokbudak, Alejandro Sztrajman, Chenliang Zhou, Fangcheng Zhong, Rafal Mantiuk, and Cengiz Oztireli" + }, + { + "type": "text", + "bbox": [ + 0.362, + 0.256, + 0.642, + 0.27 + ], + "angle": 0, + "content": "University of Cambridge, Cambridge, UK" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.308, + 0.744, + 0.476 + ], + "angle": 0, + "content": "Abstract. In this paper, we introduce a technique to estimate measured BRDFs from a sparse set of samples. Our approach offers accurate BRDF reconstructions that are generalizable to new materials. This opens the door to BRDF reconstructions from a variety of data sources. The success of our approach relies on the ability of hypernetworks to generate a robust representation of BRDFs and a set encoder that allows us to feed inputs of different sizes to the architecture. The set encoder and the hypernetwork also enable the compression of densely sampled BRDFs. We evaluate our technique both qualitatively and quantitatively on the well-known MERL dataset of 100 isotropic materials. Our approach accurately 1) estimates the BRDFs of unseen materials even for an extremely sparse sampling, 2) compresses the measured BRDFs into very small embeddings, e.g., 7D." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.488, + 0.714, + 0.502 + ], + "angle": 0, + "content": "Keywords: Reflectance \\(\\cdot\\) BRDF \\(\\cdot\\) Implicit Neural Representations" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.529, + 0.377, + 0.545 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.561, + 0.788, + 0.697 + ], + "angle": 0, + "content": "In computer graphics and vision, achieving realistic renderings for intricate surface materials hinges on accurately describing the interaction of light with the surfaces. This is conventionally conveyed through the modeling and reconstruction of a 4D Bidirectional Reflectance Distribution Function (BRDF), which quantifies the relationship between the incident and outgoing light intensities for a specific material. In this work, we propose a novel generalizable BRDF representation model that can estimate the BRDFs of new materials from highly sparse and unstructured point-based samples1 and compress the densely sampled values into very small latent embeddings." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.697, + 0.788, + 0.804 + ], + "angle": 0, + "content": "While there has been prior work that attempts to tackle similar tasks by estimating the free parameters of analytic BRDF functions or the principal components of BRDF functions from images or reflectance measurements, the oversimplified models of the complex BRDF function lead to inaccuracies when predicting real materials, thereby diminishing the realism in renderings [35]. Moreover, the process of fitting through nonlinear optimization is inherently unstable, computationally expensive, and prone to local minima, hindering the" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.787, + 0.84 + ], + "angle": 0, + "content": "1 Point-based samples refer to the BRDF values acquired at specific points on a surface with known viewing and lighting directions." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.128 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.194 + ], + "angle": 0, + "content": "accurate reconstruction of material appearance [10,15]. Measured BRDFs of real-world materials can also be fraught with errors due to equipment limitations, adding to the complexity of the fitting process [36]." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.226, + 0.789, + 0.435 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.444, + 0.79, + 0.5 + ], + "angle": 0, + "content": "Fig. 1: A room scene rendered with our reconstructed materials, including sparse reconstruction (table top and legs, door, door and picture frames, hinge), compression (two teapots on the left, door handle) and BRDF interpolation (right-most teapot). Scene courtesy of Benedikt Bitterli." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.789, + 0.672 + ], + "angle": 0, + "content": "Recent advances in deep learning have enabled the accurate representation of complex continuous signals (e.g. images, surfaces, volumes, materials, etc.) using a Neural Field [44, 47, 56], i.e. a neural network mapping coordinate inputs to sampled values, without compromising model compactness. Consequently, neural fields have gained substantial popularity for representing continuous BRDFs in recent works [46, 56]. However, reconstructing a neural field representation for BRDFs typically requires training the network with a regression loss function to overfit to a single material, which demands dense sampling and extensive computational resources, while being unable to generalize to new materials." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.79, + 0.842 + ], + "angle": 0, + "content": "More recently, Generalizable Neural Fields [40] (GNFs) have emerged as a promising solution to the aforementioned challenges. Rather than overfitting to individual signals, GNFs are designed to learn a generalized mapping, either deterministic or probabilistic, between sampled signals and their full neural field representations in a fashion similar to supervised learning. The key strategy of GNFs involves conditioning the neural fields with a latent embedding of the signal samples. Popular conditioning mechanisms include concatenated latent vectors [37], hypernetworks [17], and attention-based set latent representations [20]. Once the conditional neural field is properly learned, reconstruction of the full signal can be achieved at inference time, and even with highly sparse and unstructured samples." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.298 + ], + "angle": 0, + "content": "Inspired by GNFs, we propose a novel framework for generalizable neural BRDF representation for both the estimation of unseen materials from sparse and unstructured samples and the compression of measured BRDFs into low-dimensional latent space. In this framework, we employ a multi-layer perceptron (MLP) model as the neural field backbone for BRDF representation, a hypernetwork for conditioning, and a set encoder that allows for mapping an arbitrary number of reflectance measurements from arbitrary directions to a compact latent embedding for conditional BRDF generation. The built-in nonlinear interpolation capability of the hyper-network also offers robust and adaptable material editing and blending across various sample sizes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.785, + 0.359 + ], + "angle": 0, + "content": "Unlike previous work, our BRDF reconstruction is highly efficient without the need for extensive training to overfit individual materials, while also maintaining state-of-the-art performance in reconstruction accuracy for sample size below 4000; see Figure 4." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.36, + 0.785, + 0.39 + ], + "angle": 0, + "content": "In summary, we offer a novel solution for the challenging task of generalizable BRDF modelling with the following key contributions:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.402, + 0.784, + 0.492 + ], + "angle": 0, + "content": "- Generalizability and Adaptability: Our methodology ensures robustness and adaptability across varying sample sizes and appearances, making it highly effective for estimating the BRDFs of unseen materials from highly sparse and unstructured sampling. Its adaptability also extends to highly compact representation of BRDFs, overall outperforming the prior state-of-the-art compression method; see Table 2." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.494, + 0.785, + 0.569 + ], + "angle": 0, + "content": "- Realism and Accuracy: Our extensive evaluation demonstrates the superior performance of our approach in reconstructing the BRDFs of 20 test materials from a limited number of samples, ranging from 40 to 4000, outperforming prior methods in terms of appearance modeling and color preservation (by at least 2dB in peak-signal-to-noise ratio and 1 in Delta E)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.595, + 0.387, + 0.612 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.631, + 0.458, + 0.646 + ], + "angle": 0, + "content": "2.1 Analytic BRDF Models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Analytic models are the most common representation for BRDFs. Classic BRDF models include Phong [5], Cook-Torrance [7], Ward [52] and GGX [50]. Following models have increased their reconstruction capabilities by combining analytic formulations with data-driven representations of some or all of their components [1, 2, 10]. Notably, the ABC model [26] has been shown to provide an accurate reconstruction of measured materials, while only requiring the fitting of a handful of tunable parameters. These models are usually fast at evaluation, easily editable, and present a low memory footprint. However, they usually rely on oversimplifications of the reflectance distribution shapes, and thus have a limited capacity for the reconstruction of complex real-world materials [15, 35]. Therefore, recent works have started exploring neural representations to overcome these limitations." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.128 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.56, + 0.162 + ], + "angle": 0, + "content": "2.2 Regression-based BRDF Estimation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.172, + 0.788, + 0.28 + ], + "angle": 0, + "content": "For a simpler representation of measured BRDFs, BRDF decomposition methods, such as PCA decomposition [31, 36, 42], non-negative matrix factorization [23, 24], Gaussian mixture [45], tensor decomposition [4, 48] and non-parametric models [3] have been proposed. The main limitation of PCA and factorization methods is that they have a limited capacity to represent complex functions without overfitting to the training dataset. In contrast, our method can represent the complex BRDFs even with sparse samples while maintaining generalizability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.294, + 0.789, + 0.52 + ], + "angle": 0, + "content": "Deep learning for BRDF modeling. Multiple methods have been recently proposed for neural BRDF representation [6,13,18,32,38,46,55,56]. These methods usually offer a flexible representation, and thus are well fitted to encode the complex reflectance distributions of real-world measured materials. However, an accurate fitting of these methods usually requires lengthy optimizations and a very large number of sample measurements, typically from \\( 8 \\times 10^{5} \\) to \\( 1.5 \\times 10^{6} \\). [32] learned materials with baked illumination via small fully-connected networks. NBRDF [46] and CNF [56] leveraged neural fields to learn individual BRDF functions. Closer to our work, DeepBRDF [18] and Neural Processes [55] introduce neural network architectures to learn a compressed latent space from a dataset of multiple materials. However, these methods only address the problem of compressing BRDF samples into a low dimensional space, hence overfitting to the dataset. Our method, on the other hand, also offers a generalizable approach for the reliable reconstruction of unseen materials from sparse and unstructured real-world reflectance measurements." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.543, + 0.49, + 0.558 + ], + "angle": 0, + "content": "2.3 Efficient BRDF Acquisition" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.788, + 0.659 + ], + "angle": 0, + "content": "Realistic reflectance acquisition commonly requires a large amount of physical acquisition samples collected from different directions, making the process time-consuming and data intensive. To take fewer samples, hence reducing the BRDF capture time, optimization of a sample pattern with a linear statistical analysis of a database of BRDFs [36] and the joint optimization of the sample pattern and a non-linear BRDF model [25] have been proposed." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.78 + ], + "angle": 0, + "content": "Spatially-varying BRDFs (SVBRDF): For efficient SVBRDF capture, several methods based on multiplexing-based, also known as illumination-based, acquisition systems [21, 22, 27, 28, 49] have been proposed. A common approach has been to optimize the lighting patterns for efficient acquisition, followed by a BRDF fitting to an analytic model. Recent works have also leveraged deep learning architectures to learn a mapping from images to texture maps of analytic SVBRDF parameters [8, 9, 14, 16, 19, 29, 57]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "In contrast to those works, our focus is the reconstruction of spatially uniform BRDF that can accurately represent arbitrary complex materials. The works on spatially-varying BRDFs and efficient capture could be considered orthogonal to ours, and those methods could be potentially combined with ours." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.13 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.148, + 0.789, + 0.309 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.323, + 0.789, + 0.435 + ], + "angle": 0, + "content": "Fig. 2: During training, the set encoder and hypernetwork decoder are trained on a set of materials to predict the weights of hyponet (MLP) so that it can reconstruct the training set. The BRDF data is provided as a set of BRDF coordinates, \\( H_{n}, D_{n} \\), and the corresponding reflectance values \\( f_{r}(H_{n}, D_{n}) \\). To reconstruct a new material from a small set of BRDF reflectance samples, the trained set encoder and hypernetwork decoder are used to predict the weights of hyponet for the unknown material. Once those weights are known, we can query BRDF at any coordinates and for any new materials, conditioned on the embedding of their sampled BRDF values." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.464, + 0.479, + 0.48 + ], + "angle": 0, + "content": "2.4 Hypernetworks and GNFs" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.491, + 0.789, + 0.645 + ], + "angle": 0, + "content": "The capacity of hypernetworks to dynamically output neural network weights, which allows models to adjust to input conditions, has drawn attention. Its promise in a variety of computer vision tasks, including dynamic network adaptation and generating neural implicit fields, has been demonstrated by recent works, such as HyperGAN [39] and Hyperdiffusion [12]. The concept of a generalizable neural field has also been extensively applied to the reconstruction of neural radiance fields [51, 53], but not sufficiently studied in other domains. These research efforts serve as our source of inspiration as we apply hypernetworks and GNFs to BRDF estimation, improving the model's adaptability to various material appearances." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.667, + 0.381, + 0.684 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.7, + 0.789, + 0.746 + ], + "angle": 0, + "content": "Based on our observation that recent work misses a generalized and adaptable BRDF representation, we propose a novel representation for measured BRDFs that learns compact embeddings of the BRDFs with a hypernetwork model." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.769, + 0.387, + 0.785 + ], + "angle": 0, + "content": "3.1 Pre-processing" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.843 + ], + "angle": 0, + "content": "Measured BRDFs usually contain high dynamic range (HDR) data, including arbitrarily high values, especially for the specular components. Hence, we preprocess the BRDF data by applying a Log Relative Mapping [36] of the form:" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.128 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "equation", + "bbox": [ + 0.418, + 0.159, + 0.786, + 0.193 + ], + "angle": 0, + "content": "\\[\n\\rho^ {\\prime} = \\ln \\left(\\frac {\\rho + \\epsilon}{\\rho_ {r e f} + \\epsilon} + 1\\right) \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.198, + 0.785, + 0.257 + ], + "angle": 0, + "content": "where \\(\\rho\\) refers to the BRDF values, \\(\\epsilon = 0.002\\) is a small constant value to avoid zero-division, and \\(\\rho_{ref}\\) is a reference BRDF value for relative mapping. The reference BRDF value is chosen to be the median value for each angle over the entire dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.259, + 0.785, + 0.349 + ], + "angle": 0, + "content": "We also observe that input parameterization has a strong impact on the reconstruction quality since it guides the neural network model to learn different aspects of the reflectance function. Therefore, similar to NBRDF [46], we express the BRDFs as functions of the Cartesian vectors \\( H \\) and \\( D \\) in the Rusinkiewicz parameterization [41], i.e., \\( \\rho = f_r(H, D) \\), where \\( H, D \\in S^2 \\) indirectly encode the information about the incident and outgoing light directions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.35, + 0.787, + 0.396 + ], + "angle": 0, + "content": "Importantly, in this parameterization the directions of specular reflection have a single fixed representation as \\( H = (0,0,1) \\), which provides an easier pattern for the network to learn than the traditional \\( \\omega_{i}, \\omega_{o} \\) encoding." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.419, + 0.382, + 0.433 + ], + "angle": 0, + "content": "3.2 Hypernetwork" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.445, + 0.788, + 0.552 + ], + "angle": 0, + "content": "In Figure 2, we show the diagram of our hypernetwork model [44] for BRDF representation, with three main components: 1) a set encoder that generates compact latent representations \\( Z \\) of BRDFs based on an arbitrary number of directional samples, 2) a hypernetwork decoder that decodes the latent to estimate the parameters of a neural field, and 3) a neural field controlled by the decoder that represents the BRDFs of the material, which we refer to as a hyponet, following the convention of prior work [43]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.575, + 0.788, + 0.772 + ], + "angle": 0, + "content": "Set Encoder The set encoder takes as input an arbitrary set of samples, \\( n = 1..N \\), taken from a BRDF measurement. Each measurement consists of directional coordinates \\( H_{n}, D_{n} \\), given in the Rusinkiewicz parameterization [41], and their corresponding BRDF values \\( f_{r}(H_{n}, D_{n}) \\). The set encoder is composed of four fully-connected layers with two hidden layers of feature size 128 for each. The input is the concatenation of BRDF values \\( (N, 3) \\) and coordinates \\( (N, 6) \\). The activation function applied after each layer is ReLU. Each sample is encoded into a 40-dimensional embedding, and the sample set is reduced to a single embedding by applying a symmetric operation (averaging). The use of a set encoder, which is commonly adopted in point set networks [54], ensures permutation invariance and provides a high degree of flexibility in terms of the input, enabling the encoding of BRDFs with an arbitrary number of data-points, irregularly sampled, and in no pre-defined order." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Hypernetwork Decoder and Hyponet The hypernetwork decoder converts the embeddings from the set encoder into the weights of the hyponet that represents the BRDFs of a single material. The hypernetwork decoder is composed" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.13 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "of 10 blocks of a fully-connected neural network with three layers. Each block outputs the corresponding weights and biases of hyponet. The hyponet consists of five fully-connected layers with input layer of size 6 for coordinates, three hidden layers of size 60 for each, output layer of size 3 for BRDF values. Our neural representation of materials, hyponet, follows the structure of NBRDF [46], but replaces the exponential activation in the last layer with a ReLU activation due to BRDF properties \\((\\rho \\geq 0)\\). This network provides a continuous representation of a BRDF, and has been shown to provide state-of-the-art reconstructions of measured BRDFs, with performances competitive with the fastest analytic BRDF models." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.326, + 0.334, + 0.342 + ], + "angle": 0, + "content": "3.3 Training" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.357, + 0.789, + 0.403 + ], + "angle": 0, + "content": "We train the hypernetwork by optimizing the following loss, which consists of a reconstruction term \\(\\mathcal{L}_{\\mathrm{rec}}\\) and two regularization terms \\(\\mathcal{L}_{\\mathrm{weights}}\\) and \\(\\mathcal{L}_{\\mathrm{latent}}\\) for the hyponet weights \\(w\\) and the latent embeddings \\(z\\) [17]:" + }, + { + "type": "equation", + "bbox": [ + 0.368, + 0.417, + 0.786, + 0.48 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {\\mathrm {r e c}} + \\lambda_ {1} \\underbrace {\\frac {1}{W} \\sum_ {j = 1} ^ {W} w _ {j} ^ {2}} _ {\\mathcal {L} _ {\\mathrm {w e i g h t s}}} + \\lambda_ {2} \\underbrace {\\frac {1}{Z} \\sum_ {k = 1} ^ {Z} z _ {k} ^ {2}} _ {\\mathcal {L} _ {\\mathrm {l a t e n t}}} \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.494, + 0.787, + 0.525 + ], + "angle": 0, + "content": "We define the reconstruction loss as the mean squared error between the cosine weighted predicted and ground-truth BRDF values:" + }, + { + "type": "equation", + "bbox": [ + 0.327, + 0.541, + 0.786, + 0.581 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {r e c}} = \\sum_ {n = 1} ^ {N} \\sum_ {m = 1} ^ {M} \\frac {\\left| \\left| \\rho_ {n , m} ^ {\\mathrm {p r e d}} \\cos \\theta_ {n , m} - \\rho_ {n , m} ^ {\\mathrm {t r u e}} \\cos \\theta_ {n , m} \\right| \\right| _ {2}}{N M} \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.592, + 0.788, + 0.668 + ], + "angle": 0, + "content": "where \\(\\rho_{n,m}^{\\mathrm{pred}}\\) and \\(\\rho_{n,m}^{\\mathrm{true}}\\) indicate the predicted and ground truth BRDF values of the \\(n\\)-th sample of the \\(m\\)-th material, both processed as described in Eqn 1, and \\(\\theta\\) measures the angle between the incident ray and the surface normal. The cosine term weighs BRDFs based on the assumption of uniform incoming radiance and leads to more visually accurate results [33]." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.669, + 0.787, + 0.7 + ], + "angle": 0, + "content": "We train our network for 80 epochs with 1458000 samples per material. It takes around 15 minutes with an NVIDIA A100 80GB GPU support." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Inference: When inferring the reflectance values, our model first estimates hyponet weights from sparse samples of a test material, which takes around 0.01 seconds without GPU. Later, we feed query coordinates to the hyponet to predict the BRDF values of the material. With the conversion of the predicted BRDF into a renderable format, this process takes around 9 seconds without GPU. The continuous representation of BRDFs with the hyponet offers a nonlinear built-in interpolation and, hence, accurately reconstruct unseen materials from even a few samples." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.128 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.377, + 0.163 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.175, + 0.453, + 0.19 + ], + "angle": 0, + "content": "4.1 Datasets and Baselines" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.199, + 0.787, + 0.32 + ], + "angle": 0, + "content": "To show the effectiveness of our method, we use MERL [30] and RGL (51 isotropic materials) [11] datasets, which are the most commonly used BRDF datasets that include isotropic materials. The MERL dataset [30] consists of 100 real-world materials, covering a wide range of appearances. Each material includes reflectance measurements from a dense set of directions, parameterized as the spherical angles \\((\\theta, \\phi)\\) of the \\(H\\) and \\(D\\) vectors from the Rusinkiewicz parameterization [41]. Each color channel has a resolution of \\(90 \\times 90 \\times 180\\), leading to 1458000 reflectance measurements." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.342, + 0.506, + 0.357 + ], + "angle": 0, + "content": "4.2 Sparse BRDF Reconstruction" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.366, + 0.787, + 0.456 + ], + "angle": 0, + "content": "For comparison with baselines, we train our hypernetwork model with 80 MERL materials that are randomly selected. We leave the remaining 20 materials for testing. To understand the reconstruction capacity of our model, we first train the model with all available samples (1458000). We observe that reducing the number of samples by around half (640000) results in a similar performance (Section 7 in supplementary)." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.457, + 0.787, + 0.517 + ], + "angle": 0, + "content": "We also train our model with a mixed dataset of 80 MERL materials and 51 isotropic RGL materials. We later test the trained model on the same test dataset (20 MERL materials). We apply a separate log relative mapping to RGL materials by computing the median over the isotropic RGL dataset." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.518, + 0.787, + 0.577 + ], + "angle": 0, + "content": "We qualitatively compare our results against the ground truths through renderings of the materials. The renderings are obtained by a Mitsuba renderer with an environment map illumination. Our model can capture the diffuse colors of varying unseen appearances even for the materials with specular components." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.578, + 0.787, + 0.652 + ], + "angle": 0, + "content": "The main advantage of our architecture is that it is flexible in the number of samples fed to the network. That is, we can reconstruct unseen materials with fewer samples than the sample number used during training. Thanks to its built-in nonlinear interpolation that comes from the hyponet, we obtain high quality reconstruction results with fewer samples." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.653, + 0.787, + 0.758 + ], + "angle": 0, + "content": "Considering our architecture, we understand that the gap between reconstruction results with sparse samples relies on the embeddings \\(z\\) (latent vectors). We hence analyse the embeddings for the materials reconstructed with varying number of samples. In Figure 3, we visualize the t-SNE clustering of the test embeddings with different number of samples. It is visible that the embeddings of the same material reconstructed with different sample sizes lie close in the t-SNE space." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.78, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Qualitative Comparison We first compare our results with the ground truth renderings for varying sample sizes. Figure 4 shows that the hypernetwork can still reconstruct test materials even with \\( N = 40 \\) samples. However, as we reduce the sample number to 10, the reconstruction quality highly decreases. For" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.283, + 0.146, + 0.716, + 0.432 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.445, + 0.788, + 0.473 + ], + "angle": 0, + "content": "Fig. 3: t-SNE clustering of the test embeddings with different sample sizes, including \\( N = 8, 40, 160, 4000, 40000, 640000 \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.511, + 0.784, + 0.542 + ], + "angle": 0, + "content": "additional results with different query sample sizes, please refer to our supplementary." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.545, + 0.785, + 0.637 + ], + "angle": 0, + "content": "During inference time, hypernetwork fits the samples to a BRDF. Even with a few samples, it can still accurately reconstruct test materials. Its success comes from the fact that it learns a prior for material appearance through training with a dataset of multiple materials. Therefore, we validate our generalizable approach by comparing the hypernetwork with NBRDF [46] and PCA with Log Relative Mapping (IPCA) [36]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.64, + 0.788, + 0.732 + ], + "angle": 0, + "content": "NBRDF [46] is designed to implicitly represent an individual BRDF. It can reconstruct materials with very high accuracy (Structural Similarity Index of around 0.995) when the sample size is high. It first trains the network on a material and then estimates the BRDF values of the same material. For a fair comparison, we first fit an NBRDF model to a material BRDF with the query sample size, then estimate the function with the same sample size." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.842 + ], + "angle": 0, + "content": "We also compare our results with a PCA-based strategy (IPCA). To represent the BRDF data, PCA-based methods [31, 34] construct a matrix \\( A \\in \\mathbb{R}^{m \\times n} \\), where \\( \\mathrm{n} = 180 \\times 90 \\times 90 \\times 3 = 4374000 \\) is the feature number, \\( \\mathrm{m} = 80 \\) is sample number. The matrix is later decomposed into its principal components via Singular Value Decomposition. PCA itself struggles with the decomposition of high dynamic range data. Therefore, the Log Relative Mapping (IPCA) is proposed [36], which is defined in our pre-processing step (Section 3.1). This" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.128 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "image", + "bbox": [ + 0.241, + 0.143, + 0.768, + 0.516 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.526, + 0.788, + 0.584 + ], + "angle": 0, + "content": "Fig.4: Qualitative comparison results for reconstruction with small sample sizes. Thanks to the prior that our hypernetwork model learns for material appearance through training, it can accurately estimate the BRDFs of unseen materials and preserve the colors better than the baselines." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.624, + 0.787, + 0.655 + ], + "angle": 0, + "content": "improves the reconstruction quility, offering competitive reconstructions against our method as shown in Figure 4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.789, + 0.841 + ], + "angle": 0, + "content": "For all methods including ours, samples are drawn from a uniform distribution over Rusinkiewicz coordinates. For IPCA results, we split train and test dataset in the same way as ours, i.e., 80 MERL materials for train and 20 for test, and use all available samples for learning the principal components. To reconstruct the test materials from sparse samples, we first run a least-squared-error optimization and predict the weights of the material for the corresponding principal components. To decide the number of components, we ran an additional ablation study, where we computed the average mean squared error over the test dataset for the reconstruction from sparse samples (\\(N = 40\\)). We observed that \\((N_{PC} = 8)\\) gives the minimum error on the test dataset. Hence, we choose the number of principal components as \\(N_{PC} = 8\\) and keep it same for sparse sampling results." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.13 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.144, + 0.408, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.411, + 0.144, + 0.596, + 0.267 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.597, + 0.162, + 0.78, + 0.267 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.279, + 0.788, + 0.307 + ], + "angle": 0, + "content": "Fig. 5: Average PSNR, Delta E (CIE 2000), and SSIM results across different sample sizes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.336, + 0.784, + 0.426 + ], + "angle": 0, + "content": "We keep the range for sparse sample numbers between \\( N = 40 \\) and \\( N = 4000 \\). Figure 4 shows the rendering results for the minimum and maximum number of our range. Compared to both IPCA and NBRDF, our hypernetwork can capture the appearances more precisely. Although our approach has difficulty estimating specular components (last two rows in Figure 4), overall it offers reconstructions with much higher accuracy." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.785, + 0.487 + ], + "angle": 0, + "content": "We observe that the diffuse colors of some reconstructed materials by NBRDF can be completely off (natural-209, teflon) due to function fitting with sparse samples. Hypernetwork, on the other hand, can preserve diffuse colors better thanks to the prior it learns through training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.784, + 0.659 + ], + "angle": 0, + "content": "Quantitative Evaluation We compare our method quantitatively with the aforementioned techniques in multiple image-based error metrics through rendering results. The metrics include peak signal-to-noise ratio (PSNR), Delta E (CIE 2000), and structural similarity index (SSIM). We take the average over the test dataset for each metric. We plot the metric results across five different sample sizes (40, 160, 400, 2000, 4000). Since we optimize IPCA on the test dataset for the \\(N = 40\\) case, it offers more competitive results. Nevertheless, our method can reconstruct the BRDFs of unseen materials more precisely. Figure 5 shows that across all sample sizes, the hypernetwork attains superior performance in terms of PSNR, Delta E (CIE 2000) and SSIM." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.784, + 0.735 + ], + "angle": 0, + "content": "Additionally, Table 1 shows that expanding the training set, even with materials captured from a different point-based setup, helps improve the performance of the hypernetwork. Also, note that compared to MERL materials, the colors of RGL materials are more saturated, which could explain a slight increase in Delta E." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.756, + 0.37, + 0.772 + ], + "angle": 0, + "content": "4.3 Compression" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.784, + 0.84 + ], + "angle": 0, + "content": "The high capacity of the hypernetwork also allows the compression of the densely sampled BRDF data into low-dimensional latent representations. The hypernetwork can process highly compact BRDF embeddings, and once decoded, reconstructs the BRDF data precisely. We compare our method with Neural Processes" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.128 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.174 + ], + "angle": 0, + "content": "Table 1: Hypernetwork sparse reconstruction - Average metric results across varying sample sizes \\((N)\\) over the test set. We highlight best and second best results." + }, + { + "type": "table", + "bbox": [ + 0.248, + 0.185, + 0.756, + 0.304 + ], + "angle": 0, + "content": "
NMERLMERL + RGL
PSNR↑Delta E↓SSIM↑PSNR↑Delta E↓SSIM↑
4029.5813.1890.96830.0183.1120.963
16031.3412.6810.97331.9292.4540.962
40032.7432.2720.97933.8552.4320.977
200034.5272.2560.97934.5272.2430.983
400033.1702.1380.97734.3552.1660.982
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.335, + 0.784, + 0.365 + ], + "angle": 0, + "content": "(NPs) [55], the state-of-the-art BRDF compression method, and show that our hypernetwork model overall performs better in all three metrics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.367, + 0.785, + 0.472 + ], + "angle": 0, + "content": "To compare our method with NPs, we overfit our model to the mixed dataset of MERL and isotropic RGL materials, consisting of 151 materials in total. Since the latent dimension of NPs is 7D, we also train our network with 7D latent space. It is worth mentioning that NPs cause invalid sample values in certain MERL materials, blacking some parts of the renderings. In contrast, our method consistently decompresses materials with high reconstruction accuracy; see Table 2. Rendering results can be found in our supplementary (Compression.pdf)." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.502, + 0.785, + 0.532 + ], + "angle": 0, + "content": "Table 2: Compression - Average metric results over the renderings of the entire MERL dataset. We highlight best and second best results." + }, + { + "type": "table", + "bbox": [ + 0.312, + 0.543, + 0.692, + 0.628 + ], + "angle": 0, + "content": "
PSNR ↑Delta E ↓SSIM ↑
Ours (40D)47.6820.5670.994
Ours (7D)47.4920.5740.994
NPs46.1252.4240.935
IPCA29.8923.3150.979
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.687, + 0.384, + 0.703 + ], + "angle": 0, + "content": "4.4 BRDF Editing" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Compared to analytic BRDFs that have a fixed number of parameters to tweak, editing measured BRDFs is rather a nontrivial task due to irregular data structure. On the other hand, our network is capable of BRDF editing thanks to its representation of materials in a low-dimensional space. We can easily reconstruct various appearances by linearly interpolating between the embeddings of two different materials. Figure 7 shows newly-reconstructed materials through linear interpolation between two different embeddings from the reconstructed MERL materials." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.244, + 0.142, + 0.758, + 0.309 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.25, + 0.32, + 0.751, + 0.334 + ], + "angle": 0, + "content": "Fig. 6: Reconstruction results for BRDF compression (GT: ground truths)." + }, + { + "type": "image", + "bbox": [ + 0.246, + 0.348, + 0.758, + 0.508 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.519, + 0.785, + 0.546 + ], + "angle": 0, + "content": "Fig. 7: BRDF editing through linear interpolation between the embeddings of two materials." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.576, + 0.504, + 0.59 + ], + "angle": 0, + "content": "4.5 Limitations and Future Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.601, + 0.785, + 0.676 + ], + "angle": 0, + "content": "Specular components: Our network struggles with the estimation of specular components as shown in Figure 4 (last two rows). It is likely because of the high gap between the values of diffuse that are close to zero and the values of specular components that are arbitrarily high. We consider a separate estimation pipeline for each component within the network to improve the results." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.785, + 0.78 + ], + "angle": 0, + "content": "BRDF editing: Our BRDF editing approach is rather non-intuitive with an interpolation approach. Finding a map between the embeddings and certain attributes of the materials, such as diffuse/specular colors or haziness, can lead to more interactive BRDF editing. We plan to map our latent space to material parameter space so that users can easily edit materials through more interpretable parameters." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.785, + 0.84 + ], + "angle": 0, + "content": "SVBRDF representations: In this work, we focused on the task of generalizable neural representations for spatially uniform BRDFs. As the future work, we plan to extend our model to SVBRDF representations." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.127 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.36, + 0.161 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.787, + 0.268 + ], + "angle": 0, + "content": "We presented a hypernetwork model for neural BRDF representation, which is suitable for point-based BRDF acquisition setups. Representing the discrete BRDF values of a material as a continuous generalizable neural field, our method offers (1) accurate reconstructions of unseen materials from a sparse set of samples and (2) compression of the highly densest BRDF values into compact latent representations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.27, + 0.787, + 0.346 + ], + "angle": 0, + "content": "Thanks to the set encoder that enables an arbitrary number of input samples and the neural field, hyponet, that offers the nonlinear built-in interpolation, we showed that our hypernetwork model can capture the BRDFs of test materials better than our baselines. We also illustrated our model's compression capacity on the entire MERL dataset, showing consistent results across varying materials." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.37, + 0.405, + 0.387 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.403, + 0.787, + 0.435 + ], + "angle": 0, + "content": "This work was supported by a UKRI Future Leaders Fellowship [grant number G104084]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.459, + 0.325, + 0.475 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.491, + 0.787, + 0.519 + ], + "angle": 0, + "content": "1. Ashikhmin, M., Premoze, S.: Distribution-based brdfs. Tech. rep., Stony Brook University (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.52, + 0.787, + 0.56 + ], + "angle": 0, + "content": "2. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.561, + 0.787, + 0.603 + ], + "angle": 0, + "content": "3. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.604, + 0.787, + 0.645 + ], + "angle": 0, + "content": "4. Bilgili, A., Öztürk, A., Kurt, M.: A general brdf representation based on tensor decomposition. In: Computer Graphics Forum. vol. 30, pp. 2427-2439. Wiley Online Library (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.645, + 0.787, + 0.687 + ], + "angle": 0, + "content": "5. Blinn, J.F.: Models of light reflection for computer synthesized pictures. In: Proceedings of the 4th annual conference on Computer graphics and interactive techniques. pp. 192-198 (1977)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.688, + 0.787, + 0.728 + ], + "angle": 0, + "content": "6. Chen, Z., Nobuhara, S., Nishino, K.: Invertible neural brdf for object inverse rendering. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(12), 9380-9395 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.729, + 0.787, + 0.757 + ], + "angle": 0, + "content": "7. Cook, R.L., Torrance, K.E.: A reflectance model for computer graphics. ACM Transactions on Graphics (ToG) 1(1), 7-24 (1982)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.758, + 0.787, + 0.799 + ], + "angle": 0, + "content": "8. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Single-image svbrdf capture with a rendering-aware deep network. ACM Transactions on Graphics (ToG) 37(4), 1-15 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "9. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Flexible svbrdf capture with a multi-image deep network. In: Computer graphics forum. vol. 38, pp. 1-13. Wiley Online Library (2019)" + }, + { + "type": "list", + "bbox": [ + 0.223, + 0.491, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "10. Dupuy, J., Heitz, E., Iehl, J.C., Poulin, P., Ostromoukhov, V.: Extracting microfacet-based brdf parameters from arbitrary materials with power iterations. Comput. Graph. Forum 34(4), 21-30 (Jul 2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.218 + ], + "angle": 0, + "content": "11. Dupuy, J., Jakob, W.: An adaptive parameterization for efficient material acquisition and rendering. ACM Transactions on graphics (TOG) 37(6), 1-14 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.787, + 0.259 + ], + "angle": 0, + "content": "12. Erkoc, Z., Ma, F., Shan, Q., Nießner, M., Dai, A.: Hyperdiffusion: Generating implicit neural fields with weight-space diffusion. arXiv preprint arXiv:2303.17015 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.259, + 0.787, + 0.286 + ], + "angle": 0, + "content": "13. Fan, J., Wang, B., Hasan, M., Yang, J., Yan, L.Q.: Neural brdfs: Representation and operations. arXiv preprint arXiv:2111.03797 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.286, + 0.787, + 0.328 + ], + "angle": 0, + "content": "14. Gao, D., Li, X., Dong, Y., Peers, P., Xu, K., Tong, X.: Deep inverse rendering for high-resolution svbrdf estimation from an arbitrary number of images. ACM Trans. Graph. 38(4), 134-1 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.787, + 0.383 + ], + "angle": 0, + "content": "15. Guarnera, D., Guarnera, G., Ghosh, A., Denk, C., Glencross, M.: Brdf representation and acquisition. Computer Graphics Forum 35(2), 625-650 (2016). https://doi.org/https://doi.org/10.1111/cgi.f.12867, https://onlinelibrary.wiley.com/doi/abs/10.1111/cgi.f.12867" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.383, + 0.787, + 0.425 + ], + "angle": 0, + "content": "16. Guo, J., Lai, S., Tao, C., Cai, Y., Wang, L., Guo, Y., Yan, L.Q.: Highlight-aware two-stream network for single-image svbrdf acquisition. ACM Transactions on Graphics (TOG) 40(4), 1-14 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.452 + ], + "angle": 0, + "content": "17. Ha, D., Dai, A.M., Le, Q.V.: Hypernetworks. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=rkpAce1lx" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.452, + 0.787, + 0.493 + ], + "angle": 0, + "content": "18. Hu, B., Guo, J., Chen, Y., Li, M., Guo, Y.: Deepbrdf: A deep representation for manipulating measured brdf. In: Computer Graphics Forum. vol. 39, pp. 157-166. Wiley Online Library (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.493, + 0.787, + 0.536 + ], + "angle": 0, + "content": "19. Hui, Z., Sunkavalli, K., Lee, J.Y., Hadap, S., Wang, J., Sankaranarayanan, A.C.: Reflectance capture using univariate sampling of brdfs. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 5362-5370 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.787, + 0.577 + ], + "angle": 0, + "content": "20. Jiang, W., Trulls, E., Hosang, J., Tagliasacchi, A., Yi, K.M.: Cotr: Correspondence transformer for matching across images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6207-6217 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.577, + 0.787, + 0.605 + ], + "angle": 0, + "content": "21. Kang, K., et al.: Efficient reflectance capture using an autoencoder. ACM TOG 37(4), 127-1 (2018). https://doi.org/10.1145/3197517.3201279" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.605, + 0.787, + 0.633 + ], + "angle": 0, + "content": "22. Kang, K., et al.: Learning efficient illumination multiplexing for joint capture of reflectance and shape. ACM TOG 38(6), 165-1 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.787, + 0.674 + ], + "angle": 0, + "content": "23. Lawrence, J., Ben-Artzi, A., DeCoro, C., Matusik, W., Pfister, H., Ramamoorthi, R., Rusinkiewicz, S.: Inverse shade trees for non-parametric material representation and editing. ACM Transactions on Graphics (ToG) 25(3), 735-745 (2006)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.674, + 0.787, + 0.715 + ], + "angle": 0, + "content": "24. Lawrence, J., Rusinkiewicz, S., Ramamoorthi, R.: Efficient brdf importance sampling using a factored representation. ACM Transactions on Graphics (ToG) 23(3), 496-505 (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.715, + 0.787, + 0.743 + ], + "angle": 0, + "content": "25. Liu, C., Fischer, M., Ritschel, T.: Learning to learn and sample brdfs. In: Computer Graphics Forum. vol. 42, pp. 201-211. Wiley Online Library (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.743, + 0.787, + 0.785 + ], + "angle": 0, + "content": "26. Löw, J., Kronander, J., Ynnerman, A., Unger, J.: BRDF models for accurate and efficient rendering of glossy surfaces. ACM TOG 31(1), 9:1-9:14 (2012). https://doi.org/10.1145/2077341.2077350" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.785, + 0.787, + 0.813 + ], + "angle": 0, + "content": "27. Ma, X., et al.: Free-form scanning of non-planar appearance with neural trace photography. ACM TOG 40(4) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.787, + 0.841 + ], + "angle": 0, + "content": "28. Ma, X., Xu, X., Zhang, L., Zhou, K., Wu, H.: Opensvbrdf: A database of measured spatially-varying reflectance. ACM Transactions on Graphics 42(6) (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.399, + 0.127 + ], + "angle": 0, + "content": "F. Gokbudak et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "29. Martin, R., Roullier, A., Rouffet, R., Kaiser, A., Boubekeur, T.: Materia: Single image high-resolution material capture in the wild. In: Computer Graphics Forum. vol. 41, pp. 163-177. Wiley Online Library (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.191, + 0.785, + 0.232 + ], + "angle": 0, + "content": "30. Matusik, W., Pfister, H., Brand, M., McMillan, L.: A data-driven reflectance model. ACM Transactions on Graphics (TOG) 22(3), 759-769 (Jul 2003). https://doi.org/10.1145/882262.882343, https://www.merl.com/publications/TR2003-83" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.233, + 0.785, + 0.26 + ], + "angle": 0, + "content": "31. Matusik, W.: A data-driven reflectance model. Ph.D. thesis, Massachusetts Institute of Technology (2003)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.261, + 0.785, + 0.302 + ], + "angle": 0, + "content": "32. Maximov, M., Leal-Taixe, L., Fritz, M., Ritschel, T.: Deep appearance maps. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8729-8738 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.304, + 0.785, + 0.331 + ], + "angle": 0, + "content": "33. Ngan, A., Durand, F., Matusik, W.: Experimental analysis of brdf models. Rendering Techniques 2005(16th), 2 (2005)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.333, + 0.785, + 0.36 + ], + "angle": 0, + "content": "34. Ngan, A., Durand, F., Matusik, W.: Image-driven navigation of analytical brdf models. Rendering Techniques 2006, 399-407 (2006)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.361, + 0.785, + 0.402 + ], + "angle": 0, + "content": "35. Ngan, A., Durand, F., Matusik, W.: Experimental Analysis of BRDF Models. In: Eurographics Symposium on Rendering. The Eurographics Association (2005). https://doi.org/10.2312/EGWR/EGSR05/117-126" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.403, + 0.785, + 0.444 + ], + "angle": 0, + "content": "36. Nielsen, J.B., Jensen, H.W., Ramamoorthi, R.: On optimal, minimal brdf sampling for reflectance acquisition. ACM Transactions on Graphics (TOG) 34(6), 1-11 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.446, + 0.785, + 0.5 + ], + "angle": 0, + "content": "37. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.785, + 0.543 + ], + "angle": 0, + "content": "38. Rainer, G., Jakob, W., Ghosh, A., Weyrich, T.: Neural btf compression and interpolation. In: Computer Graphics Forum. vol. 38, pp. 235-244. Wiley Online Library (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.545, + 0.785, + 0.585 + ], + "angle": 0, + "content": "39. Ratzlaff, N., Fuxin, L.: Hypergan: A generative model for diverse, performant neural networks. In: International Conference on Machine Learning. pp. 5361-5369. PMLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.587, + 0.785, + 0.627 + ], + "angle": 0, + "content": "40. Rebain, D., Matthews, M.J., Yi, K.M., Sharma, G., Lagun, D., Tagliasacchi, A.: Attention beats concatenation for conditioning neural fields. arXiv preprint arXiv:2209.10684 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.629, + 0.785, + 0.67 + ], + "angle": 0, + "content": "41. Rusinkiewicz, S.M.: A new change of variables for efficient brdf representation. In: Rendering Techniques' 98: Proceedings of the Eurographics Workshop in Vienna, Austria, June 29—July 1, 1998 9. pp. 11-22. Springer (1998)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.672, + 0.785, + 0.699 + ], + "angle": 0, + "content": "42. Serrano, A., Gutierrez, D., Myszkowski, K., Seidel, H.P., Masia, B.: An intuitive control space for material appearance. arXiv preprint arXiv:1806.04950 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.7, + 0.785, + 0.74 + ], + "angle": 0, + "content": "43. Sitzmann, V., Chan, E., Tucker, R., Snavely, N., Wetzstein, G.: Metasdf: Meta-learning signed distance functions. Advances in Neural Information Processing Systems 33, 10136-10147 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.742, + 0.785, + 0.77 + ], + "angle": 0, + "content": "44. Sitzmann, V., Martel, J.N., Bergman, A.W., Lindell, D.B., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: NeurIPS (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.771, + 0.785, + 0.798 + ], + "angle": 0, + "content": "45. Sun, X., Zhou, K., Chen, Y., Lin, S., Shi, J., Guo, B.: Interactive relighting with dynamic brdfs. In: ACM SIGGRAPH 2007 papers, pp. 27-es (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "46. Sztrajman, A., Rainer, G., Ritschel, T., Weyrich, T.: Neural brdf representation and importance sampling. In: Computer Graphics Forum. vol. 40, pp. 332-346. Wiley Online Library (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Hypernetworks for Generalizable BRDF Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "47. Tancik, M., Srinivasan, P.P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J.T., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.788, + 0.217 + ], + "angle": 0, + "content": "48. Tongbuasirilai, T., Unger, J., Kronander, J., Kurt, M.: Compact and intuitive data-driven brdf models. The Visual Computer 36, 855-872 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.788, + 0.259 + ], + "angle": 0, + "content": "49. Tunwattanapong, B., Fyffe, G., Graham, P., Busch, J., Yu, X., Ghosh, A., Debevec, P.: Acquiring reflectance and shape from continuous spherical harmonic illumination. ACM Transactions on graphics (TOG) 32(4), 1-12 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.26, + 0.788, + 0.327 + ], + "angle": 0, + "content": "50. Walter, B., Marschner, S.R., Li, H., Torrance, K.E.: Microfacet models for refraction through rough surfaces. In: Proceedings of the 18th Eurographics Conference on Rendering Techniques. pp. 195-206. EGSR'07, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland (2007). https://doi.org/10.2312/EGWR/EGSR07/195-206, http://dx.doi.org/10.2312/EGWR/EGSR07/195-206" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.788, + 0.355 + ], + "angle": 0, + "content": "51. Wang, P., Chen, X., Chen, T., Venugopalan, S., Wang, Z., et al.: Is attention all nef needs? arXiv preprint arXiv:2207.13298 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.356, + 0.788, + 0.396 + ], + "angle": 0, + "content": "52. Ward, G.J.: Measuring and modeling anisotropic reflection. In: Proceedings of the 19th annual conference on Computer graphics and interactive techniques. pp. 265-272 (1992)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.788, + 0.453 + ], + "angle": 0, + "content": "53. Yang, H., Hong, L., Li, A., Hu, T., Li, Z., Lee, G.H., Wang, L.: Contranerf: Generalizable neural radiance fields for synthetic-to-real novel view synthesis via contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16508-16517 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.788, + 0.479 + ], + "angle": 0, + "content": "54. Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R.R., Smola, A.J.: Deep sets. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.481, + 0.788, + 0.522 + ], + "angle": 0, + "content": "55. Zheng, C., Zheng, R., Wang, R., Zhao, S., Bao, H.: A compact representation of measured brdfs using neural processes. ACM Transactions on Graphics (TOG) 41(2), 1-15 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.788, + 0.563 + ], + "angle": 0, + "content": "56. Zhong, F., Fogarty, K., Hanji, P., Wu, T., Sztrajman, A., Spielberg, A., Tagliasacchi, A., Bosilj, P., Oztireli, C.: Neural fields with hard constraints of arbitrary differential order. arXiv preprint arXiv:2306.08943 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.788, + 0.605 + ], + "angle": 0, + "content": "57. Zhou, X., Kalantari, N.K.: Adversarial single-image svbrdf estimation with hybrid training. In: Computer Graphics Forum. vol. 40, pp. 315-325. Wiley Online Library (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.605 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_origin.pdf b/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..abd980652224f60f8ec6b74c26656c262b9657e0 --- /dev/null +++ b/2024/Hypernetworks for Generalizable BRDF Representation/cdddefd4-478a-4d91-a158-6666ee1ba068_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:71fd87da54de960b16378da0594a66df5ac6ef71bb7c4d774ebc9d5962b02be7 +size 9204585 diff --git a/2024/Hypernetworks for Generalizable BRDF Representation/full.md b/2024/Hypernetworks for Generalizable BRDF Representation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..ca2cc0b40c8f3e3547d997ea5aa6ca556443fc43 --- /dev/null +++ b/2024/Hypernetworks for Generalizable BRDF Representation/full.md @@ -0,0 +1,269 @@ +# Hypernetworks for Generalizable BRDF Representation + +Fazilet Gokbudak, Alejandro Sztrajman, Chenliang Zhou, Fangcheng Zhong, Rafal Mantiuk, and Cengiz Oztireli + +University of Cambridge, Cambridge, UK + +Abstract. In this paper, we introduce a technique to estimate measured BRDFs from a sparse set of samples. Our approach offers accurate BRDF reconstructions that are generalizable to new materials. This opens the door to BRDF reconstructions from a variety of data sources. The success of our approach relies on the ability of hypernetworks to generate a robust representation of BRDFs and a set encoder that allows us to feed inputs of different sizes to the architecture. The set encoder and the hypernetwork also enable the compression of densely sampled BRDFs. We evaluate our technique both qualitatively and quantitatively on the well-known MERL dataset of 100 isotropic materials. Our approach accurately 1) estimates the BRDFs of unseen materials even for an extremely sparse sampling, 2) compresses the measured BRDFs into very small embeddings, e.g., 7D. + +Keywords: Reflectance $\cdot$ BRDF $\cdot$ Implicit Neural Representations + +# 1 Introduction + +In computer graphics and vision, achieving realistic renderings for intricate surface materials hinges on accurately describing the interaction of light with the surfaces. This is conventionally conveyed through the modeling and reconstruction of a 4D Bidirectional Reflectance Distribution Function (BRDF), which quantifies the relationship between the incident and outgoing light intensities for a specific material. In this work, we propose a novel generalizable BRDF representation model that can estimate the BRDFs of new materials from highly sparse and unstructured point-based samples1 and compress the densely sampled values into very small latent embeddings. + +While there has been prior work that attempts to tackle similar tasks by estimating the free parameters of analytic BRDF functions or the principal components of BRDF functions from images or reflectance measurements, the oversimplified models of the complex BRDF function lead to inaccuracies when predicting real materials, thereby diminishing the realism in renderings [35]. Moreover, the process of fitting through nonlinear optimization is inherently unstable, computationally expensive, and prone to local minima, hindering the + +accurate reconstruction of material appearance [10,15]. Measured BRDFs of real-world materials can also be fraught with errors due to equipment limitations, adding to the complexity of the fitting process [36]. + +![](images/5778f2f64826dc37f5497541b24c55ae5587e88e9524001e143d857f1212f3d8.jpg) +Fig. 1: A room scene rendered with our reconstructed materials, including sparse reconstruction (table top and legs, door, door and picture frames, hinge), compression (two teapots on the left, door handle) and BRDF interpolation (right-most teapot). Scene courtesy of Benedikt Bitterli. + +Recent advances in deep learning have enabled the accurate representation of complex continuous signals (e.g. images, surfaces, volumes, materials, etc.) using a Neural Field [44, 47, 56], i.e. a neural network mapping coordinate inputs to sampled values, without compromising model compactness. Consequently, neural fields have gained substantial popularity for representing continuous BRDFs in recent works [46, 56]. However, reconstructing a neural field representation for BRDFs typically requires training the network with a regression loss function to overfit to a single material, which demands dense sampling and extensive computational resources, while being unable to generalize to new materials. + +More recently, Generalizable Neural Fields [40] (GNFs) have emerged as a promising solution to the aforementioned challenges. Rather than overfitting to individual signals, GNFs are designed to learn a generalized mapping, either deterministic or probabilistic, between sampled signals and their full neural field representations in a fashion similar to supervised learning. The key strategy of GNFs involves conditioning the neural fields with a latent embedding of the signal samples. Popular conditioning mechanisms include concatenated latent vectors [37], hypernetworks [17], and attention-based set latent representations [20]. Once the conditional neural field is properly learned, reconstruction of the full signal can be achieved at inference time, and even with highly sparse and unstructured samples. + +Inspired by GNFs, we propose a novel framework for generalizable neural BRDF representation for both the estimation of unseen materials from sparse and unstructured samples and the compression of measured BRDFs into low-dimensional latent space. In this framework, we employ a multi-layer perceptron (MLP) model as the neural field backbone for BRDF representation, a hypernetwork for conditioning, and a set encoder that allows for mapping an arbitrary number of reflectance measurements from arbitrary directions to a compact latent embedding for conditional BRDF generation. The built-in nonlinear interpolation capability of the hyper-network also offers robust and adaptable material editing and blending across various sample sizes. + +Unlike previous work, our BRDF reconstruction is highly efficient without the need for extensive training to overfit individual materials, while also maintaining state-of-the-art performance in reconstruction accuracy for sample size below 4000; see Figure 4. + +In summary, we offer a novel solution for the challenging task of generalizable BRDF modelling with the following key contributions: + +- Generalizability and Adaptability: Our methodology ensures robustness and adaptability across varying sample sizes and appearances, making it highly effective for estimating the BRDFs of unseen materials from highly sparse and unstructured sampling. Its adaptability also extends to highly compact representation of BRDFs, overall outperforming the prior state-of-the-art compression method; see Table 2. + +- Realism and Accuracy: Our extensive evaluation demonstrates the superior performance of our approach in reconstructing the BRDFs of 20 test materials from a limited number of samples, ranging from 40 to 4000, outperforming prior methods in terms of appearance modeling and color preservation (by at least 2dB in peak-signal-to-noise ratio and 1 in Delta E). + +# 2 Related Work + +# 2.1 Analytic BRDF Models + +Analytic models are the most common representation for BRDFs. Classic BRDF models include Phong [5], Cook-Torrance [7], Ward [52] and GGX [50]. Following models have increased their reconstruction capabilities by combining analytic formulations with data-driven representations of some or all of their components [1, 2, 10]. Notably, the ABC model [26] has been shown to provide an accurate reconstruction of measured materials, while only requiring the fitting of a handful of tunable parameters. These models are usually fast at evaluation, easily editable, and present a low memory footprint. However, they usually rely on oversimplifications of the reflectance distribution shapes, and thus have a limited capacity for the reconstruction of complex real-world materials [15, 35]. Therefore, recent works have started exploring neural representations to overcome these limitations. + +# 2.2 Regression-based BRDF Estimation + +For a simpler representation of measured BRDFs, BRDF decomposition methods, such as PCA decomposition [31, 36, 42], non-negative matrix factorization [23, 24], Gaussian mixture [45], tensor decomposition [4, 48] and non-parametric models [3] have been proposed. The main limitation of PCA and factorization methods is that they have a limited capacity to represent complex functions without overfitting to the training dataset. In contrast, our method can represent the complex BRDFs even with sparse samples while maintaining generalizability. + +Deep learning for BRDF modeling. Multiple methods have been recently proposed for neural BRDF representation [6,13,18,32,38,46,55,56]. These methods usually offer a flexible representation, and thus are well fitted to encode the complex reflectance distributions of real-world measured materials. However, an accurate fitting of these methods usually requires lengthy optimizations and a very large number of sample measurements, typically from $8 \times 10^{5}$ to $1.5 \times 10^{6}$ . [32] learned materials with baked illumination via small fully-connected networks. NBRDF [46] and CNF [56] leveraged neural fields to learn individual BRDF functions. Closer to our work, DeepBRDF [18] and Neural Processes [55] introduce neural network architectures to learn a compressed latent space from a dataset of multiple materials. However, these methods only address the problem of compressing BRDF samples into a low dimensional space, hence overfitting to the dataset. Our method, on the other hand, also offers a generalizable approach for the reliable reconstruction of unseen materials from sparse and unstructured real-world reflectance measurements. + +# 2.3 Efficient BRDF Acquisition + +Realistic reflectance acquisition commonly requires a large amount of physical acquisition samples collected from different directions, making the process time-consuming and data intensive. To take fewer samples, hence reducing the BRDF capture time, optimization of a sample pattern with a linear statistical analysis of a database of BRDFs [36] and the joint optimization of the sample pattern and a non-linear BRDF model [25] have been proposed. + +Spatially-varying BRDFs (SVBRDF): For efficient SVBRDF capture, several methods based on multiplexing-based, also known as illumination-based, acquisition systems [21, 22, 27, 28, 49] have been proposed. A common approach has been to optimize the lighting patterns for efficient acquisition, followed by a BRDF fitting to an analytic model. Recent works have also leveraged deep learning architectures to learn a mapping from images to texture maps of analytic SVBRDF parameters [8, 9, 14, 16, 19, 29, 57]. + +In contrast to those works, our focus is the reconstruction of spatially uniform BRDF that can accurately represent arbitrary complex materials. The works on spatially-varying BRDFs and efficient capture could be considered orthogonal to ours, and those methods could be potentially combined with ours. + +![](images/9081d45e11002abdffc295be161d850c9c35aab6f16dc09e29c56c1c58b332b3.jpg) +Fig. 2: During training, the set encoder and hypernetwork decoder are trained on a set of materials to predict the weights of hyponet (MLP) so that it can reconstruct the training set. The BRDF data is provided as a set of BRDF coordinates, $H_{n}, D_{n}$ , and the corresponding reflectance values $f_{r}(H_{n}, D_{n})$ . To reconstruct a new material from a small set of BRDF reflectance samples, the trained set encoder and hypernetwork decoder are used to predict the weights of hyponet for the unknown material. Once those weights are known, we can query BRDF at any coordinates and for any new materials, conditioned on the embedding of their sampled BRDF values. + +# 2.4 Hypernetworks and GNFs + +The capacity of hypernetworks to dynamically output neural network weights, which allows models to adjust to input conditions, has drawn attention. Its promise in a variety of computer vision tasks, including dynamic network adaptation and generating neural implicit fields, has been demonstrated by recent works, such as HyperGAN [39] and Hyperdiffusion [12]. The concept of a generalizable neural field has also been extensively applied to the reconstruction of neural radiance fields [51, 53], but not sufficiently studied in other domains. These research efforts serve as our source of inspiration as we apply hypernetworks and GNFs to BRDF estimation, improving the model's adaptability to various material appearances. + +# 3 Methodology + +Based on our observation that recent work misses a generalized and adaptable BRDF representation, we propose a novel representation for measured BRDFs that learns compact embeddings of the BRDFs with a hypernetwork model. + +# 3.1 Pre-processing + +Measured BRDFs usually contain high dynamic range (HDR) data, including arbitrarily high values, especially for the specular components. Hence, we preprocess the BRDF data by applying a Log Relative Mapping [36] of the form: + +$$ +\rho^ {\prime} = \ln \left(\frac {\rho + \epsilon}{\rho_ {r e f} + \epsilon} + 1\right) \tag {1} +$$ + +where $\rho$ refers to the BRDF values, $\epsilon = 0.002$ is a small constant value to avoid zero-division, and $\rho_{ref}$ is a reference BRDF value for relative mapping. The reference BRDF value is chosen to be the median value for each angle over the entire dataset. + +We also observe that input parameterization has a strong impact on the reconstruction quality since it guides the neural network model to learn different aspects of the reflectance function. Therefore, similar to NBRDF [46], we express the BRDFs as functions of the Cartesian vectors $H$ and $D$ in the Rusinkiewicz parameterization [41], i.e., $\rho = f_r(H, D)$ , where $H, D \in S^2$ indirectly encode the information about the incident and outgoing light directions. + +Importantly, in this parameterization the directions of specular reflection have a single fixed representation as $H = (0,0,1)$ , which provides an easier pattern for the network to learn than the traditional $\omega_{i}, \omega_{o}$ encoding. + +# 3.2 Hypernetwork + +In Figure 2, we show the diagram of our hypernetwork model [44] for BRDF representation, with three main components: 1) a set encoder that generates compact latent representations $Z$ of BRDFs based on an arbitrary number of directional samples, 2) a hypernetwork decoder that decodes the latent to estimate the parameters of a neural field, and 3) a neural field controlled by the decoder that represents the BRDFs of the material, which we refer to as a hyponet, following the convention of prior work [43]. + +Set Encoder The set encoder takes as input an arbitrary set of samples, $n = 1..N$ , taken from a BRDF measurement. Each measurement consists of directional coordinates $H_{n}, D_{n}$ , given in the Rusinkiewicz parameterization [41], and their corresponding BRDF values $f_{r}(H_{n}, D_{n})$ . The set encoder is composed of four fully-connected layers with two hidden layers of feature size 128 for each. The input is the concatenation of BRDF values $(N, 3)$ and coordinates $(N, 6)$ . The activation function applied after each layer is ReLU. Each sample is encoded into a 40-dimensional embedding, and the sample set is reduced to a single embedding by applying a symmetric operation (averaging). The use of a set encoder, which is commonly adopted in point set networks [54], ensures permutation invariance and provides a high degree of flexibility in terms of the input, enabling the encoding of BRDFs with an arbitrary number of data-points, irregularly sampled, and in no pre-defined order. + +Hypernetwork Decoder and Hyponet The hypernetwork decoder converts the embeddings from the set encoder into the weights of the hyponet that represents the BRDFs of a single material. The hypernetwork decoder is composed + +of 10 blocks of a fully-connected neural network with three layers. Each block outputs the corresponding weights and biases of hyponet. The hyponet consists of five fully-connected layers with input layer of size 6 for coordinates, three hidden layers of size 60 for each, output layer of size 3 for BRDF values. Our neural representation of materials, hyponet, follows the structure of NBRDF [46], but replaces the exponential activation in the last layer with a ReLU activation due to BRDF properties $(\rho \geq 0)$ . This network provides a continuous representation of a BRDF, and has been shown to provide state-of-the-art reconstructions of measured BRDFs, with performances competitive with the fastest analytic BRDF models. + +# 3.3 Training + +We train the hypernetwork by optimizing the following loss, which consists of a reconstruction term $\mathcal{L}_{\mathrm{rec}}$ and two regularization terms $\mathcal{L}_{\mathrm{weights}}$ and $\mathcal{L}_{\mathrm{latent}}$ for the hyponet weights $w$ and the latent embeddings $z$ [17]: + +$$ +\mathcal {L} = \mathcal {L} _ {\mathrm {r e c}} + \lambda_ {1} \underbrace {\frac {1}{W} \sum_ {j = 1} ^ {W} w _ {j} ^ {2}} _ {\mathcal {L} _ {\mathrm {w e i g h t s}}} + \lambda_ {2} \underbrace {\frac {1}{Z} \sum_ {k = 1} ^ {Z} z _ {k} ^ {2}} _ {\mathcal {L} _ {\mathrm {l a t e n t}}} \tag {2} +$$ + +We define the reconstruction loss as the mean squared error between the cosine weighted predicted and ground-truth BRDF values: + +$$ +\mathcal {L} _ {\mathrm {r e c}} = \sum_ {n = 1} ^ {N} \sum_ {m = 1} ^ {M} \frac {\left| \left| \rho_ {n , m} ^ {\mathrm {p r e d}} \cos \theta_ {n , m} - \rho_ {n , m} ^ {\mathrm {t r u e}} \cos \theta_ {n , m} \right| \right| _ {2}}{N M} \tag {3} +$$ + +where $\rho_{n,m}^{\mathrm{pred}}$ and $\rho_{n,m}^{\mathrm{true}}$ indicate the predicted and ground truth BRDF values of the $n$ -th sample of the $m$ -th material, both processed as described in Eqn 1, and $\theta$ measures the angle between the incident ray and the surface normal. The cosine term weighs BRDFs based on the assumption of uniform incoming radiance and leads to more visually accurate results [33]. + +We train our network for 80 epochs with 1458000 samples per material. It takes around 15 minutes with an NVIDIA A100 80GB GPU support. + +Inference: When inferring the reflectance values, our model first estimates hyponet weights from sparse samples of a test material, which takes around 0.01 seconds without GPU. Later, we feed query coordinates to the hyponet to predict the BRDF values of the material. With the conversion of the predicted BRDF into a renderable format, this process takes around 9 seconds without GPU. The continuous representation of BRDFs with the hyponet offers a nonlinear built-in interpolation and, hence, accurately reconstruct unseen materials from even a few samples. + +# 4 Experiments + +# 4.1 Datasets and Baselines + +To show the effectiveness of our method, we use MERL [30] and RGL (51 isotropic materials) [11] datasets, which are the most commonly used BRDF datasets that include isotropic materials. The MERL dataset [30] consists of 100 real-world materials, covering a wide range of appearances. Each material includes reflectance measurements from a dense set of directions, parameterized as the spherical angles $(\theta, \phi)$ of the $H$ and $D$ vectors from the Rusinkiewicz parameterization [41]. Each color channel has a resolution of $90 \times 90 \times 180$ , leading to 1458000 reflectance measurements. + +# 4.2 Sparse BRDF Reconstruction + +For comparison with baselines, we train our hypernetwork model with 80 MERL materials that are randomly selected. We leave the remaining 20 materials for testing. To understand the reconstruction capacity of our model, we first train the model with all available samples (1458000). We observe that reducing the number of samples by around half (640000) results in a similar performance (Section 7 in supplementary). + +We also train our model with a mixed dataset of 80 MERL materials and 51 isotropic RGL materials. We later test the trained model on the same test dataset (20 MERL materials). We apply a separate log relative mapping to RGL materials by computing the median over the isotropic RGL dataset. + +We qualitatively compare our results against the ground truths through renderings of the materials. The renderings are obtained by a Mitsuba renderer with an environment map illumination. Our model can capture the diffuse colors of varying unseen appearances even for the materials with specular components. + +The main advantage of our architecture is that it is flexible in the number of samples fed to the network. That is, we can reconstruct unseen materials with fewer samples than the sample number used during training. Thanks to its built-in nonlinear interpolation that comes from the hyponet, we obtain high quality reconstruction results with fewer samples. + +Considering our architecture, we understand that the gap between reconstruction results with sparse samples relies on the embeddings $z$ (latent vectors). We hence analyse the embeddings for the materials reconstructed with varying number of samples. In Figure 3, we visualize the t-SNE clustering of the test embeddings with different number of samples. It is visible that the embeddings of the same material reconstructed with different sample sizes lie close in the t-SNE space. + +Qualitative Comparison We first compare our results with the ground truth renderings for varying sample sizes. Figure 4 shows that the hypernetwork can still reconstruct test materials even with $N = 40$ samples. However, as we reduce the sample number to 10, the reconstruction quality highly decreases. For + +![](images/8145642d307eea06008049af598f6d6b7352a87d789c6545dc60c4ddd140965b.jpg) +Fig. 3: t-SNE clustering of the test embeddings with different sample sizes, including $N = 8, 40, 160, 4000, 40000, 640000$ . + +additional results with different query sample sizes, please refer to our supplementary. + +During inference time, hypernetwork fits the samples to a BRDF. Even with a few samples, it can still accurately reconstruct test materials. Its success comes from the fact that it learns a prior for material appearance through training with a dataset of multiple materials. Therefore, we validate our generalizable approach by comparing the hypernetwork with NBRDF [46] and PCA with Log Relative Mapping (IPCA) [36]. + +NBRDF [46] is designed to implicitly represent an individual BRDF. It can reconstruct materials with very high accuracy (Structural Similarity Index of around 0.995) when the sample size is high. It first trains the network on a material and then estimates the BRDF values of the same material. For a fair comparison, we first fit an NBRDF model to a material BRDF with the query sample size, then estimate the function with the same sample size. + +We also compare our results with a PCA-based strategy (IPCA). To represent the BRDF data, PCA-based methods [31, 34] construct a matrix $A \in \mathbb{R}^{m \times n}$ , where $\mathrm{n} = 180 \times 90 \times 90 \times 3 = 4374000$ is the feature number, $\mathrm{m} = 80$ is sample number. The matrix is later decomposed into its principal components via Singular Value Decomposition. PCA itself struggles with the decomposition of high dynamic range data. Therefore, the Log Relative Mapping (IPCA) is proposed [36], which is defined in our pre-processing step (Section 3.1). This + +![](images/94141207d8a15185c478d854a536d9a2ef5e8814bcfdf89838f58ba313524932.jpg) +Fig.4: Qualitative comparison results for reconstruction with small sample sizes. Thanks to the prior that our hypernetwork model learns for material appearance through training, it can accurately estimate the BRDFs of unseen materials and preserve the colors better than the baselines. + +improves the reconstruction quility, offering competitive reconstructions against our method as shown in Figure 4. + +For all methods including ours, samples are drawn from a uniform distribution over Rusinkiewicz coordinates. For IPCA results, we split train and test dataset in the same way as ours, i.e., 80 MERL materials for train and 20 for test, and use all available samples for learning the principal components. To reconstruct the test materials from sparse samples, we first run a least-squared-error optimization and predict the weights of the material for the corresponding principal components. To decide the number of components, we ran an additional ablation study, where we computed the average mean squared error over the test dataset for the reconstruction from sparse samples ( $N = 40$ ). We observed that $(N_{PC} = 8)$ gives the minimum error on the test dataset. Hence, we choose the number of principal components as $N_{PC} = 8$ and keep it same for sparse sampling results. + +![](images/de1583087fc61aa4d2b9cc59d358374e64d96dbe4c4bb941f73c85563b22c3ac.jpg) +Fig. 5: Average PSNR, Delta E (CIE 2000), and SSIM results across different sample sizes. + +![](images/7c1360fb89de230e4ac403c73d71d618f7856c798a21054857fc7cb52bd00b3f.jpg) + +![](images/bcad545541c023484c3e67a8931d25e6d317936df3f2dc2a6b369859b8808db0.jpg) + +We keep the range for sparse sample numbers between $N = 40$ and $N = 4000$ . Figure 4 shows the rendering results for the minimum and maximum number of our range. Compared to both IPCA and NBRDF, our hypernetwork can capture the appearances more precisely. Although our approach has difficulty estimating specular components (last two rows in Figure 4), overall it offers reconstructions with much higher accuracy. + +We observe that the diffuse colors of some reconstructed materials by NBRDF can be completely off (natural-209, teflon) due to function fitting with sparse samples. Hypernetwork, on the other hand, can preserve diffuse colors better thanks to the prior it learns through training. + +Quantitative Evaluation We compare our method quantitatively with the aforementioned techniques in multiple image-based error metrics through rendering results. The metrics include peak signal-to-noise ratio (PSNR), Delta E (CIE 2000), and structural similarity index (SSIM). We take the average over the test dataset for each metric. We plot the metric results across five different sample sizes (40, 160, 400, 2000, 4000). Since we optimize IPCA on the test dataset for the $N = 40$ case, it offers more competitive results. Nevertheless, our method can reconstruct the BRDFs of unseen materials more precisely. Figure 5 shows that across all sample sizes, the hypernetwork attains superior performance in terms of PSNR, Delta E (CIE 2000) and SSIM. + +Additionally, Table 1 shows that expanding the training set, even with materials captured from a different point-based setup, helps improve the performance of the hypernetwork. Also, note that compared to MERL materials, the colors of RGL materials are more saturated, which could explain a slight increase in Delta E. + +# 4.3 Compression + +The high capacity of the hypernetwork also allows the compression of the densely sampled BRDF data into low-dimensional latent representations. The hypernetwork can process highly compact BRDF embeddings, and once decoded, reconstructs the BRDF data precisely. We compare our method with Neural Processes + +Table 1: Hypernetwork sparse reconstruction - Average metric results across varying sample sizes $(N)$ over the test set. We highlight best and second best results. + +
NMERLMERL + RGL
PSNR↑Delta E↓SSIM↑PSNR↑Delta E↓SSIM↑
4029.5813.1890.96830.0183.1120.963
16031.3412.6810.97331.9292.4540.962
40032.7432.2720.97933.8552.4320.977
200034.5272.2560.97934.5272.2430.983
400033.1702.1380.97734.3552.1660.982
+ +(NPs) [55], the state-of-the-art BRDF compression method, and show that our hypernetwork model overall performs better in all three metrics. + +To compare our method with NPs, we overfit our model to the mixed dataset of MERL and isotropic RGL materials, consisting of 151 materials in total. Since the latent dimension of NPs is 7D, we also train our network with 7D latent space. It is worth mentioning that NPs cause invalid sample values in certain MERL materials, blacking some parts of the renderings. In contrast, our method consistently decompresses materials with high reconstruction accuracy; see Table 2. Rendering results can be found in our supplementary (Compression.pdf). + +Table 2: Compression - Average metric results over the renderings of the entire MERL dataset. We highlight best and second best results. + +
PSNR ↑Delta E ↓SSIM ↑
Ours (40D)47.6820.5670.994
Ours (7D)47.4920.5740.994
NPs46.1252.4240.935
IPCA29.8923.3150.979
+ +# 4.4 BRDF Editing + +Compared to analytic BRDFs that have a fixed number of parameters to tweak, editing measured BRDFs is rather a nontrivial task due to irregular data structure. On the other hand, our network is capable of BRDF editing thanks to its representation of materials in a low-dimensional space. We can easily reconstruct various appearances by linearly interpolating between the embeddings of two different materials. Figure 7 shows newly-reconstructed materials through linear interpolation between two different embeddings from the reconstructed MERL materials. + +![](images/ec5269031ee55064d7584483e30016266c710cf84c0533cc3bd66091213a40fe.jpg) +Fig. 6: Reconstruction results for BRDF compression (GT: ground truths). + +![](images/035b5ce1183bd56acad634c5ca506959ae8b49a2044f431b72646f4bf2017785.jpg) +Fig. 7: BRDF editing through linear interpolation between the embeddings of two materials. + +# 4.5 Limitations and Future Work + +Specular components: Our network struggles with the estimation of specular components as shown in Figure 4 (last two rows). It is likely because of the high gap between the values of diffuse that are close to zero and the values of specular components that are arbitrarily high. We consider a separate estimation pipeline for each component within the network to improve the results. + +BRDF editing: Our BRDF editing approach is rather non-intuitive with an interpolation approach. Finding a map between the embeddings and certain attributes of the materials, such as diffuse/specular colors or haziness, can lead to more interactive BRDF editing. We plan to map our latent space to material parameter space so that users can easily edit materials through more interpretable parameters. + +SVBRDF representations: In this work, we focused on the task of generalizable neural representations for spatially uniform BRDFs. As the future work, we plan to extend our model to SVBRDF representations. + +# 5 Conclusion + +We presented a hypernetwork model for neural BRDF representation, which is suitable for point-based BRDF acquisition setups. Representing the discrete BRDF values of a material as a continuous generalizable neural field, our method offers (1) accurate reconstructions of unseen materials from a sparse set of samples and (2) compression of the highly densest BRDF values into compact latent representations. + +Thanks to the set encoder that enables an arbitrary number of input samples and the neural field, hyponet, that offers the nonlinear built-in interpolation, we showed that our hypernetwork model can capture the BRDFs of test materials better than our baselines. We also illustrated our model's compression capacity on the entire MERL dataset, showing consistent results across varying materials. + +# Acknowledgements + +This work was supported by a UKRI Future Leaders Fellowship [grant number G104084]. + +# References + +1. Ashikhmin, M., Premoze, S.: Distribution-based brdfs. Tech. rep., Stony Brook University (2007) +2. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016) +3. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016) +4. Bilgili, A., Öztürk, A., Kurt, M.: A general brdf representation based on tensor decomposition. In: Computer Graphics Forum. vol. 30, pp. 2427-2439. Wiley Online Library (2011) +5. Blinn, J.F.: Models of light reflection for computer synthesized pictures. In: Proceedings of the 4th annual conference on Computer graphics and interactive techniques. pp. 192-198 (1977) +6. Chen, Z., Nobuhara, S., Nishino, K.: Invertible neural brdf for object inverse rendering. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(12), 9380-9395 (2021) +7. Cook, R.L., Torrance, K.E.: A reflectance model for computer graphics. ACM Transactions on Graphics (ToG) 1(1), 7-24 (1982) +8. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Single-image svbrdf capture with a rendering-aware deep network. ACM Transactions on Graphics (ToG) 37(4), 1-15 (2018) +9. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Flexible svbrdf capture with a multi-image deep network. In: Computer graphics forum. vol. 38, pp. 1-13. Wiley Online Library (2019) + +10. Dupuy, J., Heitz, E., Iehl, J.C., Poulin, P., Ostromoukhov, V.: Extracting microfacet-based brdf parameters from arbitrary materials with power iterations. Comput. Graph. Forum 34(4), 21-30 (Jul 2015) +11. Dupuy, J., Jakob, W.: An adaptive parameterization for efficient material acquisition and rendering. ACM Transactions on graphics (TOG) 37(6), 1-14 (2018) +12. Erkoc, Z., Ma, F., Shan, Q., Nießner, M., Dai, A.: Hyperdiffusion: Generating implicit neural fields with weight-space diffusion. arXiv preprint arXiv:2303.17015 (2023) +13. Fan, J., Wang, B., Hasan, M., Yang, J., Yan, L.Q.: Neural brdfs: Representation and operations. arXiv preprint arXiv:2111.03797 (2021) +14. Gao, D., Li, X., Dong, Y., Peers, P., Xu, K., Tong, X.: Deep inverse rendering for high-resolution svbrdf estimation from an arbitrary number of images. ACM Trans. Graph. 38(4), 134-1 (2019) +15. Guarnera, D., Guarnera, G., Ghosh, A., Denk, C., Glencross, M.: Brdf representation and acquisition. Computer Graphics Forum 35(2), 625-650 (2016). https://doi.org/https://doi.org/10.1111/cgi.f.12867, https://onlinelibrary.wiley.com/doi/abs/10.1111/cgi.f.12867 +16. Guo, J., Lai, S., Tao, C., Cai, Y., Wang, L., Guo, Y., Yan, L.Q.: Highlight-aware two-stream network for single-image svbrdf acquisition. ACM Transactions on Graphics (TOG) 40(4), 1-14 (2021) +17. Ha, D., Dai, A.M., Le, Q.V.: Hypernetworks. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=rkpAce1lx +18. Hu, B., Guo, J., Chen, Y., Li, M., Guo, Y.: Deepbrdf: A deep representation for manipulating measured brdf. In: Computer Graphics Forum. vol. 39, pp. 157-166. Wiley Online Library (2020) +19. Hui, Z., Sunkavalli, K., Lee, J.Y., Hadap, S., Wang, J., Sankaranarayanan, A.C.: Reflectance capture using univariate sampling of brdfs. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 5362-5370 (2017) +20. Jiang, W., Trulls, E., Hosang, J., Tagliasacchi, A., Yi, K.M.: Cotr: Correspondence transformer for matching across images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6207-6217 (2021) +21. Kang, K., et al.: Efficient reflectance capture using an autoencoder. ACM TOG 37(4), 127-1 (2018). https://doi.org/10.1145/3197517.3201279 +22. Kang, K., et al.: Learning efficient illumination multiplexing for joint capture of reflectance and shape. ACM TOG 38(6), 165-1 (2019) +23. Lawrence, J., Ben-Artzi, A., DeCoro, C., Matusik, W., Pfister, H., Ramamoorthi, R., Rusinkiewicz, S.: Inverse shade trees for non-parametric material representation and editing. ACM Transactions on Graphics (ToG) 25(3), 735-745 (2006) +24. Lawrence, J., Rusinkiewicz, S., Ramamoorthi, R.: Efficient brdf importance sampling using a factored representation. ACM Transactions on Graphics (ToG) 23(3), 496-505 (2004) +25. Liu, C., Fischer, M., Ritschel, T.: Learning to learn and sample brdfs. In: Computer Graphics Forum. vol. 42, pp. 201-211. Wiley Online Library (2023) +26. Löw, J., Kronander, J., Ynnerman, A., Unger, J.: BRDF models for accurate and efficient rendering of glossy surfaces. ACM TOG 31(1), 9:1-9:14 (2012). https://doi.org/10.1145/2077341.2077350 +27. Ma, X., et al.: Free-form scanning of non-planar appearance with neural trace photography. ACM TOG 40(4) (2021) +28. Ma, X., Xu, X., Zhang, L., Zhou, K., Wu, H.: Opensvbrdf: A database of measured spatially-varying reflectance. ACM Transactions on Graphics 42(6) (2023) + +29. Martin, R., Roullier, A., Rouffet, R., Kaiser, A., Boubekeur, T.: Materia: Single image high-resolution material capture in the wild. In: Computer Graphics Forum. vol. 41, pp. 163-177. Wiley Online Library (2022) +30. Matusik, W., Pfister, H., Brand, M., McMillan, L.: A data-driven reflectance model. ACM Transactions on Graphics (TOG) 22(3), 759-769 (Jul 2003). https://doi.org/10.1145/882262.882343, https://www.merl.com/publications/TR2003-83 +31. Matusik, W.: A data-driven reflectance model. Ph.D. thesis, Massachusetts Institute of Technology (2003) +32. Maximov, M., Leal-Taixe, L., Fritz, M., Ritschel, T.: Deep appearance maps. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8729-8738 (2019) +33. Ngan, A., Durand, F., Matusik, W.: Experimental analysis of brdf models. Rendering Techniques 2005(16th), 2 (2005) +34. Ngan, A., Durand, F., Matusik, W.: Image-driven navigation of analytical brdf models. Rendering Techniques 2006, 399-407 (2006) +35. Ngan, A., Durand, F., Matusik, W.: Experimental Analysis of BRDF Models. In: Eurographics Symposium on Rendering. The Eurographics Association (2005). https://doi.org/10.2312/EGWR/EGSR05/117-126 +36. Nielsen, J.B., Jensen, H.W., Ramamoorthi, R.: On optimal, minimal brdf sampling for reflectance acquisition. ACM Transactions on Graphics (TOG) 34(6), 1-11 (2015) +37. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019) +38. Rainer, G., Jakob, W., Ghosh, A., Weyrich, T.: Neural btf compression and interpolation. In: Computer Graphics Forum. vol. 38, pp. 235-244. Wiley Online Library (2019) +39. Ratzlaff, N., Fuxin, L.: Hypergan: A generative model for diverse, performant neural networks. In: International Conference on Machine Learning. pp. 5361-5369. PMLR (2019) +40. Rebain, D., Matthews, M.J., Yi, K.M., Sharma, G., Lagun, D., Tagliasacchi, A.: Attention beats concatenation for conditioning neural fields. arXiv preprint arXiv:2209.10684 (2022) +41. Rusinkiewicz, S.M.: A new change of variables for efficient brdf representation. In: Rendering Techniques' 98: Proceedings of the Eurographics Workshop in Vienna, Austria, June 29—July 1, 1998 9. pp. 11-22. Springer (1998) +42. Serrano, A., Gutierrez, D., Myszkowski, K., Seidel, H.P., Masia, B.: An intuitive control space for material appearance. arXiv preprint arXiv:1806.04950 (2018) +43. Sitzmann, V., Chan, E., Tucker, R., Snavely, N., Wetzstein, G.: Metasdf: Meta-learning signed distance functions. Advances in Neural Information Processing Systems 33, 10136-10147 (2020) +44. Sitzmann, V., Martel, J.N., Bergman, A.W., Lindell, D.B., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: NeurIPS (2020) +45. Sun, X., Zhou, K., Chen, Y., Lin, S., Shi, J., Guo, B.: Interactive relighting with dynamic brdfs. In: ACM SIGGRAPH 2007 papers, pp. 27-es (2007) +46. Sztrajman, A., Rainer, G., Ritschel, T., Weyrich, T.: Neural brdf representation and importance sampling. In: Computer Graphics Forum. vol. 40, pp. 332-346. Wiley Online Library (2021) + +47. Tancik, M., Srinivasan, P.P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J.T., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020) +48. Tongbuasirilai, T., Unger, J., Kronander, J., Kurt, M.: Compact and intuitive data-driven brdf models. The Visual Computer 36, 855-872 (2020) +49. Tunwattanapong, B., Fyffe, G., Graham, P., Busch, J., Yu, X., Ghosh, A., Debevec, P.: Acquiring reflectance and shape from continuous spherical harmonic illumination. ACM Transactions on graphics (TOG) 32(4), 1-12 (2013) +50. Walter, B., Marschner, S.R., Li, H., Torrance, K.E.: Microfacet models for refraction through rough surfaces. In: Proceedings of the 18th Eurographics Conference on Rendering Techniques. pp. 195-206. EGSR'07, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland (2007). https://doi.org/10.2312/EGWR/EGSR07/195-206, http://dx.doi.org/10.2312/EGWR/EGSR07/195-206 +51. Wang, P., Chen, X., Chen, T., Venugopalan, S., Wang, Z., et al.: Is attention all nef needs? arXiv preprint arXiv:2207.13298 (2022) +52. Ward, G.J.: Measuring and modeling anisotropic reflection. In: Proceedings of the 19th annual conference on Computer graphics and interactive techniques. pp. 265-272 (1992) +53. Yang, H., Hong, L., Li, A., Hu, T., Li, Z., Lee, G.H., Wang, L.: Contranerf: Generalizable neural radiance fields for synthetic-to-real novel view synthesis via contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16508-16517 (2023) +54. Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R.R., Smola, A.J.: Deep sets. Advances in neural information processing systems 30 (2017) +55. Zheng, C., Zheng, R., Wang, R., Zhao, S., Bao, H.: A compact representation of measured brdfs using neural processes. ACM Transactions on Graphics (TOG) 41(2), 1-15 (2021) +56. Zhong, F., Fogarty, K., Hanji, P., Wu, T., Sztrajman, A., Spielberg, A., Tagliasacchi, A., Bosilj, P., Oztireli, C.: Neural fields with hard constraints of arbitrary differential order. arXiv preprint arXiv:2306.08943 (2023) +57. Zhou, X., Kalantari, N.K.: Adversarial single-image svbrdf estimation with hybrid training. In: Computer Graphics Forum. vol. 40, pp. 315-325. Wiley Online Library (2021) \ No newline at end of file diff --git a/2024/Hypernetworks for Generalizable BRDF Representation/images.zip b/2024/Hypernetworks for Generalizable BRDF Representation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..f5b2dbf4f215d3adcf2e88e3b99b349fc09ed8b8 --- /dev/null +++ b/2024/Hypernetworks for Generalizable BRDF Representation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:328753eb56b4e11043d65a6fabd33abc2aaf4c2e3b3aeb4601866da0175e133c +size 452167 diff --git a/2024/Hypernetworks for Generalizable BRDF Representation/layout.json b/2024/Hypernetworks for Generalizable BRDF Representation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..17a40f0db9ce03901c937f586dc46f1fcd5cb9f7 --- /dev/null +++ b/2024/Hypernetworks for Generalizable BRDF Representation/layout.json @@ -0,0 +1,7801 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 166, + 111, + 447, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 111, + 447, + 148 + ], + "spans": [ + { + "bbox": [ + 166, + 111, + 447, + 148 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 145, + 168, + 470, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 168, + 470, + 193 + ], + "spans": [ + { + "bbox": [ + 145, + 168, + 470, + 193 + ], + "type": "text", + "content": "Fazilet Gokbudak, Alejandro Sztrajman, Chenliang Zhou, Fangcheng Zhong, Rafal Mantiuk, and Cengiz Oztireli" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 221, + 202, + 392, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 221, + 202, + 392, + 213 + ], + "spans": [ + { + "bbox": [ + 221, + 202, + 392, + 213 + ], + "type": "text", + "content": "University of Cambridge, Cambridge, UK" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 243, + 455, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 243, + 455, + 376 + ], + "spans": [ + { + "bbox": [ + 160, + 243, + 455, + 376 + ], + "type": "text", + "content": "Abstract. In this paper, we introduce a technique to estimate measured BRDFs from a sparse set of samples. Our approach offers accurate BRDF reconstructions that are generalizable to new materials. This opens the door to BRDF reconstructions from a variety of data sources. The success of our approach relies on the ability of hypernetworks to generate a robust representation of BRDFs and a set encoder that allows us to feed inputs of different sizes to the architecture. The set encoder and the hypernetwork also enable the compression of densely sampled BRDFs. We evaluate our technique both qualitatively and quantitatively on the well-known MERL dataset of 100 isotropic materials. Our approach accurately 1) estimates the BRDFs of unseen materials even for an extremely sparse sampling, 2) compresses the measured BRDFs into very small embeddings, e.g., 7D." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 386, + 436, + 397 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 386, + 436, + 397 + ], + "spans": [ + { + "bbox": [ + 160, + 386, + 436, + 397 + ], + "type": "text", + "content": "Keywords: Reflectance " + }, + { + "bbox": [ + 160, + 386, + 436, + 397 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 386, + 436, + 397 + ], + "type": "text", + "content": " BRDF " + }, + { + "bbox": [ + 160, + 386, + 436, + 397 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 386, + 436, + 397 + ], + "type": "text", + "content": " Implicit Neural Representations" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 418, + 230, + 431 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 230, + 431 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 230, + 431 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 444, + 482, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 444, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 444, + 482, + 552 + ], + "type": "text", + "content": "In computer graphics and vision, achieving realistic renderings for intricate surface materials hinges on accurately describing the interaction of light with the surfaces. This is conventionally conveyed through the modeling and reconstruction of a 4D Bidirectional Reflectance Distribution Function (BRDF), which quantifies the relationship between the incident and outgoing light intensities for a specific material. In this work, we propose a novel generalizable BRDF representation model that can estimate the BRDFs of new materials from highly sparse and unstructured point-based samples1 and compress the densely sampled values into very small latent embeddings." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 552, + 482, + 636 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 552, + 482, + 636 + ], + "spans": [ + { + "bbox": [ + 130, + 552, + 482, + 636 + ], + "type": "text", + "content": "While there has been prior work that attempts to tackle similar tasks by estimating the free parameters of analytic BRDF functions or the principal components of BRDF functions from images or reflectance measurements, the oversimplified models of the complex BRDF function lead to inaccuracies when predicting real materials, thereby diminishing the realism in renderings [35]. Moreover, the process of fitting through nonlinear optimization is inherently unstable, computationally expensive, and prone to local minima, hindering the" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "text", + "content": "1 Point-based samples refer to the BRDF values acquired at specific points on a surface with known viewing and lighting directions." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 153 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 153 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 153 + ], + "type": "text", + "content": "accurate reconstruction of material appearance [10,15]. Measured BRDFs of real-world materials can also be fraught with errors due to equipment limitations, adding to the complexity of the fitting process [36]." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 178, + 482, + 344 + ], + "blocks": [ + { + "bbox": [ + 133, + 178, + 482, + 344 + ], + "lines": [ + { + "bbox": [ + 133, + 178, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 133, + 178, + 482, + 344 + ], + "type": "image", + "image_path": "5778f2f64826dc37f5497541b24c55ae5587e88e9524001e143d857f1212f3d8.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 351, + 483, + 396 + ], + "lines": [ + { + "bbox": [ + 130, + 351, + 483, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 351, + 483, + 396 + ], + "type": "text", + "content": "Fig. 1: A room scene rendered with our reconstructed materials, including sparse reconstruction (table top and legs, door, door and picture frames, hinge), compression (two teapots on the left, door handle) and BRDF interpolation (right-most teapot). Scene courtesy of Benedikt Bitterli." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 423, + 482, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 532 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 532 + ], + "type": "text", + "content": "Recent advances in deep learning have enabled the accurate representation of complex continuous signals (e.g. images, surfaces, volumes, materials, etc.) using a Neural Field [44, 47, 56], i.e. a neural network mapping coordinate inputs to sampled values, without compromising model compactness. Consequently, neural fields have gained substantial popularity for representing continuous BRDFs in recent works [46, 56]. However, reconstructing a neural field representation for BRDFs typically requires training the network with a regression loss function to overfit to a single material, which demands dense sampling and extensive computational resources, while being unable to generalize to new materials." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 533, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 483, + 666 + ], + "type": "text", + "content": "More recently, Generalizable Neural Fields [40] (GNFs) have emerged as a promising solution to the aforementioned challenges. Rather than overfitting to individual signals, GNFs are designed to learn a generalized mapping, either deterministic or probabilistic, between sampled signals and their full neural field representations in a fashion similar to supervised learning. The key strategy of GNFs involves conditioning the neural fields with a latent embedding of the signal samples. Popular conditioning mechanisms include concatenated latent vectors [37], hypernetworks [17], and attention-based set latent representations [20]. Once the conditional neural field is properly learned, reconstruction of the full signal can be achieved at inference time, and even with highly sparse and unstructured samples." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 236 + ], + "type": "text", + "content": "Inspired by GNFs, we propose a novel framework for generalizable neural BRDF representation for both the estimation of unseen materials from sparse and unstructured samples and the compression of measured BRDFs into low-dimensional latent space. In this framework, we employ a multi-layer perceptron (MLP) model as the neural field backbone for BRDF representation, a hypernetwork for conditioning, and a set encoder that allows for mapping an arbitrary number of reflectance measurements from arbitrary directions to a compact latent embedding for conditional BRDF generation. The built-in nonlinear interpolation capability of the hyper-network also offers robust and adaptable material editing and blending across various sample sizes." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 480, + 284 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 480, + 284 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 480, + 284 + ], + "type": "text", + "content": "Unlike previous work, our BRDF reconstruction is highly efficient without the need for extensive training to overfit individual materials, while also maintaining state-of-the-art performance in reconstruction accuracy for sample size below 4000; see Figure 4." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 285, + 480, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 285, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 131, + 285, + 480, + 308 + ], + "type": "text", + "content": "In summary, we offer a novel solution for the challenging task of generalizable BRDF modelling with the following key contributions:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 318, + 479, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 318, + 479, + 389 + ], + "spans": [ + { + "bbox": [ + 138, + 318, + 479, + 389 + ], + "type": "text", + "content": "- Generalizability and Adaptability: Our methodology ensures robustness and adaptability across varying sample sizes and appearances, making it highly effective for estimating the BRDFs of unseen materials from highly sparse and unstructured sampling. Its adaptability also extends to highly compact representation of BRDFs, overall outperforming the prior state-of-the-art compression method; see Table 2." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 391, + 480, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 391, + 480, + 450 + ], + "spans": [ + { + "bbox": [ + 138, + 391, + 480, + 450 + ], + "type": "text", + "content": "- Realism and Accuracy: Our extensive evaluation demonstrates the superior performance of our approach in reconstructing the BRDFs of 20 test materials from a limited number of samples, ranging from 40 to 4000, outperforming prior methods in terms of appearance modeling and color preservation (by at least 2dB in peak-signal-to-noise ratio and 1 in Delta E)." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 471, + 236, + 484 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 471, + 236, + 484 + ], + "spans": [ + { + "bbox": [ + 132, + 471, + 236, + 484 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 499, + 280, + 511 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 499, + 280, + 511 + ], + "spans": [ + { + "bbox": [ + 131, + 499, + 280, + 511 + ], + "type": "text", + "content": "2.1 Analytic BRDF Models" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 521, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 480, + 665 + ], + "type": "text", + "content": "Analytic models are the most common representation for BRDFs. Classic BRDF models include Phong [5], Cook-Torrance [7], Ward [52] and GGX [50]. Following models have increased their reconstruction capabilities by combining analytic formulations with data-driven representations of some or all of their components [1, 2, 10]. Notably, the ABC model [26] has been shown to provide an accurate reconstruction of measured materials, while only requiring the fitting of a handful of tunable parameters. These models are usually fast at evaluation, easily editable, and present a low memory footprint. However, they usually rely on oversimplifications of the reflectance distribution shapes, and thus have a limited capacity for the reconstruction of complex real-world materials [15, 35]. Therefore, recent works have started exploring neural representations to overcome these limitations." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 342, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 342, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 342, + 128 + ], + "type": "text", + "content": "2.2 Regression-based BRDF Estimation" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 136, + 482, + 221 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 136, + 482, + 221 + ], + "spans": [ + { + "bbox": [ + 130, + 136, + 482, + 221 + ], + "type": "text", + "content": "For a simpler representation of measured BRDFs, BRDF decomposition methods, such as PCA decomposition [31, 36, 42], non-negative matrix factorization [23, 24], Gaussian mixture [45], tensor decomposition [4, 48] and non-parametric models [3] have been proposed. The main limitation of PCA and factorization methods is that they have a limited capacity to represent complex functions without overfitting to the training dataset. In contrast, our method can represent the complex BRDFs even with sparse samples while maintaining generalizability." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 232, + 482, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 232, + 482, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 232, + 482, + 411 + ], + "type": "text", + "content": "Deep learning for BRDF modeling. Multiple methods have been recently proposed for neural BRDF representation [6,13,18,32,38,46,55,56]. These methods usually offer a flexible representation, and thus are well fitted to encode the complex reflectance distributions of real-world measured materials. However, an accurate fitting of these methods usually requires lengthy optimizations and a very large number of sample measurements, typically from " + }, + { + "bbox": [ + 130, + 232, + 482, + 411 + ], + "type": "inline_equation", + "content": "8 \\times 10^{5}" + }, + { + "bbox": [ + 130, + 232, + 482, + 411 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 232, + 482, + 411 + ], + "type": "inline_equation", + "content": "1.5 \\times 10^{6}" + }, + { + "bbox": [ + 130, + 232, + 482, + 411 + ], + "type": "text", + "content": ". [32] learned materials with baked illumination via small fully-connected networks. NBRDF [46] and CNF [56] leveraged neural fields to learn individual BRDF functions. Closer to our work, DeepBRDF [18] and Neural Processes [55] introduce neural network architectures to learn a compressed latent space from a dataset of multiple materials. However, these methods only address the problem of compressing BRDF samples into a low dimensional space, hence overfitting to the dataset. Our method, on the other hand, also offers a generalizable approach for the reliable reconstruction of unseen materials from sparse and unstructured real-world reflectance measurements." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 430, + 299, + 441 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 299, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 299, + 441 + ], + "type": "text", + "content": "2.3 Efficient BRDF Acquisition" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": "Realistic reflectance acquisition commonly requires a large amount of physical acquisition samples collected from different directions, making the process time-consuming and data intensive. To take fewer samples, hence reducing the BRDF capture time, optimization of a sample pattern with a linear statistical analysis of a database of BRDFs [36] and the joint optimization of the sample pattern and a non-linear BRDF model [25] have been proposed." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "content": "Spatially-varying BRDFs (SVBRDF): For efficient SVBRDF capture, several methods based on multiplexing-based, also known as illumination-based, acquisition systems [21, 22, 27, 28, 49] have been proposed. A common approach has been to optimize the lighting patterns for efficient acquisition, followed by a BRDF fitting to an analytic model. Recent works have also leveraged deep learning architectures to learn a mapping from images to texture maps of analytic SVBRDF parameters [8, 9, 14, 16, 19, 29, 57]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": "In contrast to those works, our focus is the reconstruction of spatially uniform BRDF that can accurately represent arbitrary complex materials. The works on spatially-varying BRDFs and efficient capture could be considered orthogonal to ours, and those methods could be potentially combined with ours." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 117, + 482, + 244 + ], + "blocks": [ + { + "bbox": [ + 133, + 117, + 482, + 244 + ], + "lines": [ + { + "bbox": [ + 133, + 117, + 482, + 244 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 482, + 244 + ], + "type": "image", + "image_path": "9081d45e11002abdffc295be161d850c9c35aab6f16dc09e29c56c1c58b332b3.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 255, + 482, + 344 + ], + "lines": [ + { + "bbox": [ + 130, + 255, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 255, + 482, + 344 + ], + "type": "text", + "content": "Fig. 2: During training, the set encoder and hypernetwork decoder are trained on a set of materials to predict the weights of hyponet (MLP) so that it can reconstruct the training set. The BRDF data is provided as a set of BRDF coordinates, " + }, + { + "bbox": [ + 130, + 255, + 482, + 344 + ], + "type": "inline_equation", + "content": "H_{n}, D_{n}" + }, + { + "bbox": [ + 130, + 255, + 482, + 344 + ], + "type": "text", + "content": ", and the corresponding reflectance values " + }, + { + "bbox": [ + 130, + 255, + 482, + 344 + ], + "type": "inline_equation", + "content": "f_{r}(H_{n}, D_{n})" + }, + { + "bbox": [ + 130, + 255, + 482, + 344 + ], + "type": "text", + "content": ". To reconstruct a new material from a small set of BRDF reflectance samples, the trained set encoder and hypernetwork decoder are used to predict the weights of hyponet for the unknown material. Once those weights are known, we can query BRDF at any coordinates and for any new materials, conditioned on the embedding of their sampled BRDF values." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 367, + 293, + 380 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 367, + 293, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 367, + 293, + 380 + ], + "type": "text", + "content": "2.4 Hypernetworks and GNFs" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 388, + 482, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 510 + ], + "type": "text", + "content": "The capacity of hypernetworks to dynamically output neural network weights, which allows models to adjust to input conditions, has drawn attention. Its promise in a variety of computer vision tasks, including dynamic network adaptation and generating neural implicit fields, has been demonstrated by recent works, such as HyperGAN [39] and Hyperdiffusion [12]. The concept of a generalizable neural field has also been extensively applied to the reconstruction of neural radiance fields [51, 53], but not sufficiently studied in other domains. These research efforts serve as our source of inspiration as we apply hypernetworks and GNFs to BRDF estimation, improving the model's adaptability to various material appearances." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 528, + 233, + 541 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 528, + 233, + 541 + ], + "spans": [ + { + "bbox": [ + 132, + 528, + 233, + 541 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 554, + 482, + 590 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 554, + 482, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 554, + 482, + 590 + ], + "type": "text", + "content": "Based on our observation that recent work misses a generalized and adaptable BRDF representation, we propose a novel representation for measured BRDFs that learns compact embeddings of the BRDFs with a hypernetwork model." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 609, + 236, + 621 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 236, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 236, + 621 + ], + "type": "text", + "content": "3.1 Pre-processing" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "Measured BRDFs usually contain high dynamic range (HDR) data, including arbitrarily high values, especially for the specular components. Hence, we preprocess the BRDF data by applying a Log Relative Mapping [36] of the form:" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 255, + 125, + 481, + 152 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 125, + 481, + 152 + ], + "spans": [ + { + "bbox": [ + 255, + 125, + 481, + 152 + ], + "type": "interline_equation", + "content": "\\rho^ {\\prime} = \\ln \\left(\\frac {\\rho + \\epsilon}{\\rho_ {r e f} + \\epsilon} + 1\\right) \\tag {1}", + "image_path": "77191abb3988fda9b6f53efee7ce5fb99651a4e04b2af890e60a26f85e05110b.jpg" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "spans": [ + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "inline_equation", + "content": "\\rho" + }, + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "text", + "content": " refers to the BRDF values, " + }, + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "inline_equation", + "content": "\\epsilon = 0.002" + }, + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "text", + "content": " is a small constant value to avoid zero-division, and " + }, + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "inline_equation", + "content": "\\rho_{ref}" + }, + { + "bbox": [ + 130, + 156, + 480, + 203 + ], + "type": "text", + "content": " is a reference BRDF value for relative mapping. The reference BRDF value is chosen to be the median value for each angle over the entire dataset." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "text", + "content": "We also observe that input parameterization has a strong impact on the reconstruction quality since it guides the neural network model to learn different aspects of the reflectance function. Therefore, similar to NBRDF [46], we express the BRDFs as functions of the Cartesian vectors " + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "text", + "content": " in the Rusinkiewicz parameterization [41], i.e., " + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "inline_equation", + "content": "\\rho = f_r(H, D)" + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "inline_equation", + "content": "H, D \\in S^2" + }, + { + "bbox": [ + 130, + 205, + 480, + 276 + ], + "type": "text", + "content": " indirectly encode the information about the incident and outgoing light directions." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 277, + 481, + 313 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 277, + 481, + 313 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 481, + 313 + ], + "type": "text", + "content": "Importantly, in this parameterization the directions of specular reflection have a single fixed representation as " + }, + { + "bbox": [ + 130, + 277, + 481, + 313 + ], + "type": "inline_equation", + "content": "H = (0,0,1)" + }, + { + "bbox": [ + 130, + 277, + 481, + 313 + ], + "type": "text", + "content": ", which provides an easier pattern for the network to learn than the traditional " + }, + { + "bbox": [ + 130, + 277, + 481, + 313 + ], + "type": "inline_equation", + "content": "\\omega_{i}, \\omega_{o}" + }, + { + "bbox": [ + 130, + 277, + 481, + 313 + ], + "type": "text", + "content": " encoding." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 331, + 233, + 342 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 331, + 233, + 342 + ], + "spans": [ + { + "bbox": [ + 132, + 331, + 233, + 342 + ], + "type": "text", + "content": "3.2 Hypernetwork" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 352, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 352, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 352, + 482, + 437 + ], + "type": "text", + "content": "In Figure 2, we show the diagram of our hypernetwork model [44] for BRDF representation, with three main components: 1) a set encoder that generates compact latent representations " + }, + { + "bbox": [ + 130, + 352, + 482, + 437 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 352, + 482, + 437 + ], + "type": "text", + "content": " of BRDFs based on an arbitrary number of directional samples, 2) a hypernetwork decoder that decodes the latent to estimate the parameters of a neural field, and 3) a neural field controlled by the decoder that represents the BRDFs of the material, which we refer to as a hyponet, following the convention of prior work [43]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "spans": [ + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "text", + "content": "Set Encoder The set encoder takes as input an arbitrary set of samples, " + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "inline_equation", + "content": "n = 1..N" + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "text", + "content": ", taken from a BRDF measurement. Each measurement consists of directional coordinates " + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "inline_equation", + "content": "H_{n}, D_{n}" + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "text", + "content": ", given in the Rusinkiewicz parameterization [41], and their corresponding BRDF values " + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "inline_equation", + "content": "f_{r}(H_{n}, D_{n})" + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "text", + "content": ". The set encoder is composed of four fully-connected layers with two hidden layers of feature size 128 for each. The input is the concatenation of BRDF values " + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "inline_equation", + "content": "(N, 3)" + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "text", + "content": " and coordinates " + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "inline_equation", + "content": "(N, 6)" + }, + { + "bbox": [ + 130, + 455, + 482, + 611 + ], + "type": "text", + "content": ". The activation function applied after each layer is ReLU. Each sample is encoded into a 40-dimensional embedding, and the sample set is reduced to a single embedding by applying a symmetric operation (averaging). The use of a set encoder, which is commonly adopted in point set networks [54], ensures permutation invariance and provides a high degree of flexibility in terms of the input, enabling the encoding of BRDFs with an arbitrary number of data-points, irregularly sampled, and in no pre-defined order." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "Hypernetwork Decoder and Hyponet The hypernetwork decoder converts the embeddings from the set encoder into the weights of the hyponet that represents the BRDFs of a single material. The hypernetwork decoder is composed" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "of 10 blocks of a fully-connected neural network with three layers. Each block outputs the corresponding weights and biases of hyponet. The hyponet consists of five fully-connected layers with input layer of size 6 for coordinates, three hidden layers of size 60 for each, output layer of size 3 for BRDF values. Our neural representation of materials, hyponet, follows the structure of NBRDF [46], but replaces the exponential activation in the last layer with a ReLU activation due to BRDF properties " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "(\\rho \\geq 0)" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". This network provides a continuous representation of a BRDF, and has been shown to provide state-of-the-art reconstructions of measured BRDFs, with performances competitive with the fastest analytic BRDF models." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 258, + 204, + 270 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 258, + 204, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 258, + 204, + 270 + ], + "type": "text", + "content": "3.3 Training" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": "We train the hypernetwork by optimizing the following loss, which consists of a reconstruction term " + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{rec}}" + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": " and two regularization terms " + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{weights}}" + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{latent}}" + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": " for the hyponet weights " + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": " and the latent embeddings " + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "inline_equation", + "content": "z" + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": " [17]:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 225, + 330, + 481, + 380 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 330, + 481, + 380 + ], + "spans": [ + { + "bbox": [ + 225, + 330, + 481, + 380 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {\\mathrm {r e c}} + \\lambda_ {1} \\underbrace {\\frac {1}{W} \\sum_ {j = 1} ^ {W} w _ {j} ^ {2}} _ {\\mathcal {L} _ {\\mathrm {w e i g h t s}}} + \\lambda_ {2} \\underbrace {\\frac {1}{Z} \\sum_ {k = 1} ^ {Z} z _ {k} ^ {2}} _ {\\mathcal {L} _ {\\mathrm {l a t e n t}}} \\tag {2}", + "image_path": "21ea64c7e2e0680a4db033a6cfb92459efc05d1bd9dd0b5d6e743a674661a493.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 391, + 481, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 391, + 481, + 415 + ], + "spans": [ + { + "bbox": [ + 131, + 391, + 481, + 415 + ], + "type": "text", + "content": "We define the reconstruction loss as the mean squared error between the cosine weighted predicted and ground-truth BRDF values:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 200, + 428, + 481, + 460 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 428, + 481, + 460 + ], + "spans": [ + { + "bbox": [ + 200, + 428, + 481, + 460 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {r e c}} = \\sum_ {n = 1} ^ {N} \\sum_ {m = 1} ^ {M} \\frac {\\left| \\left| \\rho_ {n , m} ^ {\\mathrm {p r e d}} \\cos \\theta_ {n , m} - \\rho_ {n , m} ^ {\\mathrm {t r u e}} \\cos \\theta_ {n , m} \\right| \\right| _ {2}}{N M} \\tag {3}", + "image_path": "e225ce13276c0d87049a81e4991bc0e275be49d36233ddaf2cdf8fa3dd01272d.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\rho_{n,m}^{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\rho_{n,m}^{\\mathrm{true}}" + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "text", + "content": " indicate the predicted and ground truth BRDF values of the " + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "text", + "content": "-th sample of the " + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "text", + "content": "-th material, both processed as described in Eqn 1, and " + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 468, + 482, + 529 + ], + "type": "text", + "content": " measures the angle between the incident ray and the surface normal. The cosine term weighs BRDFs based on the assumption of uniform incoming radiance and leads to more visually accurate results [33]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 529, + 481, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 529, + 481, + 554 + ], + "spans": [ + { + "bbox": [ + 131, + 529, + 481, + 554 + ], + "type": "text", + "content": "We train our network for 80 epochs with 1458000 samples per material. It takes around 15 minutes with an NVIDIA A100 80GB GPU support." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "Inference: When inferring the reflectance values, our model first estimates hyponet weights from sparse samples of a test material, which takes around 0.01 seconds without GPU. Later, we feed query coordinates to the hyponet to predict the BRDF values of the material. With the conversion of the predicted BRDF into a renderable format, this process takes around 9 seconds without GPU. The continuous representation of BRDFs with the hyponet offers a nonlinear built-in interpolation and, hence, accurately reconstruct unseen materials from even a few samples." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 138, + 277, + 150 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 138, + 277, + 150 + ], + "spans": [ + { + "bbox": [ + 132, + 138, + 277, + 150 + ], + "type": "text", + "content": "4.1 Datasets and Baselines" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "spans": [ + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "text", + "content": "To show the effectiveness of our method, we use MERL [30] and RGL (51 isotropic materials) [11] datasets, which are the most commonly used BRDF datasets that include isotropic materials. The MERL dataset [30] consists of 100 real-world materials, covering a wide range of appearances. Each material includes reflectance measurements from a dense set of directions, parameterized as the spherical angles " + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "inline_equation", + "content": "(\\theta, \\phi)" + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "text", + "content": " of the " + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "text", + "content": " vectors from the Rusinkiewicz parameterization [41]. Each color channel has a resolution of " + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "inline_equation", + "content": "90 \\times 90 \\times 180" + }, + { + "bbox": [ + 132, + 157, + 481, + 253 + ], + "type": "text", + "content": ", leading to 1458000 reflectance measurements." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 270, + 309, + 282 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 309, + 282 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 309, + 282 + ], + "type": "text", + "content": "4.2 Sparse BRDF Reconstruction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 289, + 481, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 289, + 481, + 361 + ], + "spans": [ + { + "bbox": [ + 132, + 289, + 481, + 361 + ], + "type": "text", + "content": "For comparison with baselines, we train our hypernetwork model with 80 MERL materials that are randomly selected. We leave the remaining 20 materials for testing. To understand the reconstruction capacity of our model, we first train the model with all available samples (1458000). We observe that reducing the number of samples by around half (640000) results in a similar performance (Section 7 in supplementary)." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 361, + 481, + 409 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 361, + 481, + 409 + ], + "spans": [ + { + "bbox": [ + 132, + 361, + 481, + 409 + ], + "type": "text", + "content": "We also train our model with a mixed dataset of 80 MERL materials and 51 isotropic RGL materials. We later test the trained model on the same test dataset (20 MERL materials). We apply a separate log relative mapping to RGL materials by computing the median over the isotropic RGL dataset." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 410, + 481, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 410, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 410, + 481, + 456 + ], + "type": "text", + "content": "We qualitatively compare our results against the ground truths through renderings of the materials. The renderings are obtained by a Mitsuba renderer with an environment map illumination. Our model can capture the diffuse colors of varying unseen appearances even for the materials with specular components." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 457, + 481, + 516 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 516 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 516 + ], + "type": "text", + "content": "The main advantage of our architecture is that it is flexible in the number of samples fed to the network. That is, we can reconstruct unseen materials with fewer samples than the sample number used during training. Thanks to its built-in nonlinear interpolation that comes from the hyponet, we obtain high quality reconstruction results with fewer samples." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 517, + 481, + 600 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 517, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 517, + 481, + 600 + ], + "type": "text", + "content": "Considering our architecture, we understand that the gap between reconstruction results with sparse samples relies on the embeddings " + }, + { + "bbox": [ + 132, + 517, + 481, + 600 + ], + "type": "inline_equation", + "content": "z" + }, + { + "bbox": [ + 132, + 517, + 481, + 600 + ], + "type": "text", + "content": " (latent vectors). We hence analyse the embeddings for the materials reconstructed with varying number of samples. In Figure 3, we visualize the t-SNE clustering of the test embeddings with different number of samples. It is visible that the embeddings of the same material reconstructed with different sample sizes lie close in the t-SNE space." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "type": "text", + "content": "Qualitative Comparison We first compare our results with the ground truth renderings for varying sample sizes. Figure 4 shows that the hypernetwork can still reconstruct test materials even with " + }, + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "type": "inline_equation", + "content": "N = 40" + }, + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "type": "text", + "content": " samples. However, as we reduce the sample number to 10, the reconstruction quality highly decreases. For" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 173, + 115, + 438, + 342 + ], + "blocks": [ + { + "bbox": [ + 173, + 115, + 438, + 342 + ], + "lines": [ + { + "bbox": [ + 173, + 115, + 438, + 342 + ], + "spans": [ + { + "bbox": [ + 173, + 115, + 438, + 342 + ], + "type": "image", + "image_path": "8145642d307eea06008049af598f6d6b7352a87d789c6545dc60c4ddd140965b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 352, + 482, + 374 + ], + "lines": [ + { + "bbox": [ + 132, + 352, + 482, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 352, + 482, + 374 + ], + "type": "text", + "content": "Fig. 3: t-SNE clustering of the test embeddings with different sample sizes, including " + }, + { + "bbox": [ + 132, + 352, + 482, + 374 + ], + "type": "inline_equation", + "content": "N = 8, 40, 160, 4000, 40000, 640000" + }, + { + "bbox": [ + 132, + 352, + 482, + 374 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 404, + 479, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 404, + 479, + 429 + ], + "spans": [ + { + "bbox": [ + 130, + 404, + 479, + 429 + ], + "type": "text", + "content": "additional results with different query sample sizes, please refer to our supplementary." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 431, + 480, + 504 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 431, + 480, + 504 + ], + "spans": [ + { + "bbox": [ + 130, + 431, + 480, + 504 + ], + "type": "text", + "content": "During inference time, hypernetwork fits the samples to a BRDF. Even with a few samples, it can still accurately reconstruct test materials. Its success comes from the fact that it learns a prior for material appearance through training with a dataset of multiple materials. Therefore, we validate our generalizable approach by comparing the hypernetwork with NBRDF [46] and PCA with Log Relative Mapping (IPCA) [36]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 506, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 482, + 579 + ], + "type": "text", + "content": "NBRDF [46] is designed to implicitly represent an individual BRDF. It can reconstruct materials with very high accuracy (Structural Similarity Index of around 0.995) when the sample size is high. It first trains the network on a material and then estimates the BRDF values of the same material. For a fair comparison, we first fit an NBRDF model to a material BRDF with the query sample size, then estimate the function with the same sample size." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "We also compare our results with a PCA-based strategy (IPCA). To represent the BRDF data, PCA-based methods [31, 34] construct a matrix " + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "A \\in \\mathbb{R}^{m \\times n}" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{n} = 180 \\times 90 \\times 90 \\times 3 = 4374000" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": " is the feature number, " + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{m} = 80" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": " is sample number. The matrix is later decomposed into its principal components via Singular Value Decomposition. PCA itself struggles with the decomposition of high dynamic range data. Therefore, the Log Relative Mapping (IPCA) is proposed [36], which is defined in our pre-processing step (Section 3.1). This" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 147, + 113, + 470, + 408 + ], + "blocks": [ + { + "bbox": [ + 147, + 113, + 470, + 408 + ], + "lines": [ + { + "bbox": [ + 147, + 113, + 470, + 408 + ], + "spans": [ + { + "bbox": [ + 147, + 113, + 470, + 408 + ], + "type": "image", + "image_path": "94141207d8a15185c478d854a536d9a2ef5e8814bcfdf89838f58ba313524932.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 416, + 482, + 462 + ], + "lines": [ + { + "bbox": [ + 130, + 416, + 482, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 416, + 482, + 462 + ], + "type": "text", + "content": "Fig.4: Qualitative comparison results for reconstruction with small sample sizes. Thanks to the prior that our hypernetwork model learns for material appearance through training, it can accurately estimate the BRDFs of unseen materials and preserve the colors better than the baselines." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 494, + 481, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 494, + 481, + 518 + ], + "spans": [ + { + "bbox": [ + 130, + 494, + 481, + 518 + ], + "type": "text", + "content": "improves the reconstruction quility, offering competitive reconstructions against our method as shown in Figure 4." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "For all methods including ours, samples are drawn from a uniform distribution over Rusinkiewicz coordinates. For IPCA results, we split train and test dataset in the same way as ours, i.e., 80 MERL materials for train and 20 for test, and use all available samples for learning the principal components. To reconstruct the test materials from sparse samples, we first run a least-squared-error optimization and predict the weights of the material for the corresponding principal components. To decide the number of components, we ran an additional ablation study, where we computed the average mean squared error over the test dataset for the reconstruction from sparse samples (" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "N = 40" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "). We observed that " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "(N_{PC} = 8)" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " gives the minimum error on the test dataset. Hence, we choose the number of principal components as " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "N_{PC} = 8" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " and keep it same for sparse sampling results." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 114, + 249, + 210 + ], + "blocks": [ + { + "bbox": [ + 137, + 114, + 249, + 210 + ], + "lines": [ + { + "bbox": [ + 137, + 114, + 249, + 210 + ], + "spans": [ + { + "bbox": [ + 137, + 114, + 249, + 210 + ], + "type": "image", + "image_path": "de1583087fc61aa4d2b9cc59d358374e64d96dbe4c4bb941f73c85563b22c3ac.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 220, + 482, + 243 + ], + "lines": [ + { + "bbox": [ + 130, + 220, + 482, + 243 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 482, + 243 + ], + "type": "text", + "content": "Fig. 5: Average PSNR, Delta E (CIE 2000), and SSIM results across different sample sizes." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 251, + 114, + 364, + 211 + ], + "blocks": [ + { + "bbox": [ + 251, + 114, + 364, + 211 + ], + "lines": [ + { + "bbox": [ + 251, + 114, + 364, + 211 + ], + "spans": [ + { + "bbox": [ + 251, + 114, + 364, + 211 + ], + "type": "image", + "image_path": "7c1360fb89de230e4ac403c73d71d618f7856c798a21054857fc7cb52bd00b3f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 365, + 128, + 477, + 211 + ], + "blocks": [ + { + "bbox": [ + 365, + 128, + 477, + 211 + ], + "lines": [ + { + "bbox": [ + 365, + 128, + 477, + 211 + ], + "spans": [ + { + "bbox": [ + 365, + 128, + 477, + 211 + ], + "type": "image", + "image_path": "bcad545541c023484c3e67a8931d25e6d317936df3f2dc2a6b369859b8808db0.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 266, + 479, + 337 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 266, + 479, + 337 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 479, + 337 + ], + "type": "text", + "content": "We keep the range for sparse sample numbers between " + }, + { + "bbox": [ + 130, + 266, + 479, + 337 + ], + "type": "inline_equation", + "content": "N = 40" + }, + { + "bbox": [ + 130, + 266, + 479, + 337 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 266, + 479, + 337 + ], + "type": "inline_equation", + "content": "N = 4000" + }, + { + "bbox": [ + 130, + 266, + 479, + 337 + ], + "type": "text", + "content": ". Figure 4 shows the rendering results for the minimum and maximum number of our range. Compared to both IPCA and NBRDF, our hypernetwork can capture the appearances more precisely. Although our approach has difficulty estimating specular components (last two rows in Figure 4), overall it offers reconstructions with much higher accuracy." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 338, + 480, + 385 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 480, + 385 + ], + "type": "text", + "content": "We observe that the diffuse colors of some reconstructed materials by NBRDF can be completely off (natural-209, teflon) due to function fitting with sparse samples. Hypernetwork, on the other hand, can preserve diffuse colors better thanks to the prior it learns through training." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 402, + 479, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 479, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 479, + 521 + ], + "type": "text", + "content": "Quantitative Evaluation We compare our method quantitatively with the aforementioned techniques in multiple image-based error metrics through rendering results. The metrics include peak signal-to-noise ratio (PSNR), Delta E (CIE 2000), and structural similarity index (SSIM). We take the average over the test dataset for each metric. We plot the metric results across five different sample sizes (40, 160, 400, 2000, 4000). Since we optimize IPCA on the test dataset for the " + }, + { + "bbox": [ + 130, + 402, + 479, + 521 + ], + "type": "inline_equation", + "content": "N = 40" + }, + { + "bbox": [ + 130, + 402, + 479, + 521 + ], + "type": "text", + "content": " case, it offers more competitive results. Nevertheless, our method can reconstruct the BRDFs of unseen materials more precisely. Figure 5 shows that across all sample sizes, the hypernetwork attains superior performance in terms of PSNR, Delta E (CIE 2000) and SSIM." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 522, + 479, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 479, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 479, + 582 + ], + "type": "text", + "content": "Additionally, Table 1 shows that expanding the training set, even with materials captured from a different point-based setup, helps improve the performance of the hypernetwork. Also, note that compared to MERL materials, the colors of RGL materials are more saturated, which could explain a slight increase in Delta E." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 598, + 226, + 611 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 598, + 226, + 611 + ], + "spans": [ + { + "bbox": [ + 131, + 598, + 226, + 611 + ], + "type": "text", + "content": "4.3 Compression" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "text", + "content": "The high capacity of the hypernetwork also allows the compression of the densely sampled BRDF data into low-dimensional latent representations. The hypernetwork can process highly compact BRDF embeddings, and once decoded, reconstructs the BRDF data precisely. We compare our method with Neural Processes" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 151, + 146, + 462, + 240 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "text", + "content": "Table 1: Hypernetwork sparse reconstruction - Average metric results across varying sample sizes " + }, + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "inline_equation", + "content": "(N)" + }, + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "text", + "content": " over the test set. We highlight best and second best results." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 151, + 146, + 462, + 240 + ], + "lines": [ + { + "bbox": [ + 151, + 146, + 462, + 240 + ], + "spans": [ + { + "bbox": [ + 151, + 146, + 462, + 240 + ], + "type": "table", + "html": "
NMERLMERL + RGL
PSNR↑Delta E↓SSIM↑PSNR↑Delta E↓SSIM↑
4029.5813.1890.96830.0183.1120.963
16031.3412.6810.97331.9292.4540.962
40032.7432.2720.97933.8552.4320.977
200034.5272.2560.97934.5272.2430.983
400033.1702.1380.97734.3552.1660.982
", + "image_path": "e7a2130f6efc9e2f42dd9bb730d9075d67e408c43990d4776f611bd52562353f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 265, + 479, + 289 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 265, + 479, + 289 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 479, + 289 + ], + "type": "text", + "content": "(NPs) [55], the state-of-the-art BRDF compression method, and show that our hypernetwork model overall performs better in all three metrics." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 290, + 480, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 290, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 290, + 480, + 373 + ], + "type": "text", + "content": "To compare our method with NPs, we overfit our model to the mixed dataset of MERL and isotropic RGL materials, consisting of 151 materials in total. Since the latent dimension of NPs is 7D, we also train our network with 7D latent space. It is worth mentioning that NPs cause invalid sample values in certain MERL materials, blacking some parts of the renderings. In contrast, our method consistently decompresses materials with high reconstruction accuracy; see Table 2. Rendering results can be found in our supplementary (Compression.pdf)." + } + ] + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 190, + 430, + 423, + 497 + ], + "blocks": [ + { + "bbox": [ + 130, + 397, + 480, + 421 + ], + "lines": [ + { + "bbox": [ + 130, + 397, + 480, + 421 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 480, + 421 + ], + "type": "text", + "content": "Table 2: Compression - Average metric results over the renderings of the entire MERL dataset. We highlight best and second best results." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 190, + 430, + 423, + 497 + ], + "lines": [ + { + "bbox": [ + 190, + 430, + 423, + 497 + ], + "spans": [ + { + "bbox": [ + 190, + 430, + 423, + 497 + ], + "type": "table", + "html": "
PSNR ↑Delta E ↓SSIM ↑
Ours (40D)47.6820.5670.994
Ours (7D)47.4920.5740.994
NPs46.1252.4240.935
IPCA29.8923.3150.979
", + "image_path": "ed20b409cf923f68596311efd8d6181b71e8a70d044a40355f9e00deb9ab0775.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 544, + 235, + 556 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 235, + 556 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 235, + 556 + ], + "type": "text", + "content": "4.4 BRDF Editing" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "Compared to analytic BRDFs that have a fixed number of parameters to tweak, editing measured BRDFs is rather a nontrivial task due to irregular data structure. On the other hand, our network is capable of BRDF editing thanks to its representation of materials in a low-dimensional space. We can easily reconstruct various appearances by linearly interpolating between the embeddings of two different materials. Figure 7 shows newly-reconstructed materials through linear interpolation between two different embeddings from the reconstructed MERL materials." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 112, + 463, + 244 + ], + "blocks": [ + { + "bbox": [ + 149, + 112, + 463, + 244 + ], + "lines": [ + { + "bbox": [ + 149, + 112, + 463, + 244 + ], + "spans": [ + { + "bbox": [ + 149, + 112, + 463, + 244 + ], + "type": "image", + "image_path": "ec5269031ee55064d7584483e30016266c710cf84c0533cc3bd66091213a40fe.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 153, + 253, + 459, + 264 + ], + "lines": [ + { + "bbox": [ + 153, + 253, + 459, + 264 + ], + "spans": [ + { + "bbox": [ + 153, + 253, + 459, + 264 + ], + "type": "text", + "content": "Fig. 6: Reconstruction results for BRDF compression (GT: ground truths)." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 150, + 275, + 463, + 402 + ], + "blocks": [ + { + "bbox": [ + 150, + 275, + 463, + 402 + ], + "lines": [ + { + "bbox": [ + 150, + 275, + 463, + 402 + ], + "spans": [ + { + "bbox": [ + 150, + 275, + 463, + 402 + ], + "type": "image", + "image_path": "035b5ce1183bd56acad634c5ca506959ae8b49a2044f431b72646f4bf2017785.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 411, + 480, + 432 + ], + "lines": [ + { + "bbox": [ + 132, + 411, + 480, + 432 + ], + "spans": [ + { + "bbox": [ + 132, + 411, + 480, + 432 + ], + "type": "text", + "content": "Fig. 7: BRDF editing through linear interpolation between the embeddings of two materials." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 456, + 308, + 467 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 308, + 467 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 308, + 467 + ], + "type": "text", + "content": "4.5 Limitations and Future Work" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 475, + 480, + 535 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 475, + 480, + 535 + ], + "spans": [ + { + "bbox": [ + 130, + 475, + 480, + 535 + ], + "type": "text", + "content": "Specular components: Our network struggles with the estimation of specular components as shown in Figure 4 (last two rows). It is likely because of the high gap between the values of diffuse that are close to zero and the values of specular components that are arbitrarily high. We consider a separate estimation pipeline for each component within the network to improve the results." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 546, + 480, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 480, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 480, + 617 + ], + "type": "text", + "content": "BRDF editing: Our BRDF editing approach is rather non-intuitive with an interpolation approach. Finding a map between the embeddings and certain attributes of the materials, such as diffuse/specular colors or haziness, can lead to more interactive BRDF editing. We plan to map our latent space to material parameter space so that users can easily edit materials through more interpretable parameters." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "content": "SVBRDF representations: In this work, we focused on the task of generalizable neural representations for spatially uniform BRDFs. As the future work, we plan to extend our model to SVBRDF representations." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 220, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 220, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 220, + 127 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 481, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 481, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 481, + 212 + ], + "type": "text", + "content": "We presented a hypernetwork model for neural BRDF representation, which is suitable for point-based BRDF acquisition setups. Representing the discrete BRDF values of a material as a continuous generalizable neural field, our method offers (1) accurate reconstructions of unseen materials from a sparse set of samples and (2) compression of the highly densest BRDF values into compact latent representations." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 213, + 481, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 213, + 481, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 213, + 481, + 274 + ], + "type": "text", + "content": "Thanks to the set encoder that enables an arbitrary number of input samples and the neural field, hyponet, that offers the nonlinear built-in interpolation, we showed that our hypernetwork model can capture the BRDFs of test materials better than our baselines. We also illustrated our model's compression capacity on the entire MERL dataset, showing consistent results across varying materials." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 293, + 247, + 306 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 247, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 247, + 306 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 319, + 481, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 319, + 481, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 319, + 481, + 344 + ], + "type": "text", + "content": "This work was supported by a UKRI Future Leaders Fellowship [grant number G104084]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 363, + 198, + 376 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 198, + 376 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 198, + 376 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 136, + 388, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 136, + 388, + 481, + 411 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 388, + 481, + 411 + ], + "spans": [ + { + "bbox": [ + 136, + 388, + 481, + 411 + ], + "type": "text", + "content": "1. Ashikhmin, M., Premoze, S.: Distribution-based brdfs. Tech. rep., Stony Brook University (2007)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 136, + 411, + 481, + 443 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 411, + 481, + 443 + ], + "spans": [ + { + "bbox": [ + 136, + 411, + 481, + 443 + ], + "type": "text", + "content": "2. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 136, + 444, + 481, + 477 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 444, + 481, + 477 + ], + "spans": [ + { + "bbox": [ + 136, + 444, + 481, + 477 + ], + "type": "text", + "content": "3. Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor micro-facet model for isotropic brdfs. ACM Transactions on Graphics (TOG) 35(5), 1-16 (2016)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 136, + 478, + 481, + 510 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 478, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 136, + 478, + 481, + 510 + ], + "type": "text", + "content": "4. Bilgili, A., Öztürk, A., Kurt, M.: A general brdf representation based on tensor decomposition. In: Computer Graphics Forum. vol. 30, pp. 2427-2439. Wiley Online Library (2011)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 136, + 510, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 510, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 136, + 510, + 481, + 544 + ], + "type": "text", + "content": "5. Blinn, J.F.: Models of light reflection for computer synthesized pictures. In: Proceedings of the 4th annual conference on Computer graphics and interactive techniques. pp. 192-198 (1977)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 136, + 544, + 481, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 544, + 481, + 576 + ], + "spans": [ + { + "bbox": [ + 136, + 544, + 481, + 576 + ], + "type": "text", + "content": "6. Chen, Z., Nobuhara, S., Nishino, K.: Invertible neural brdf for object inverse rendering. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(12), 9380-9395 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 136, + 577, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 577, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 136, + 577, + 481, + 599 + ], + "type": "text", + "content": "7. Cook, R.L., Torrance, K.E.: A reflectance model for computer graphics. ACM Transactions on Graphics (ToG) 1(1), 7-24 (1982)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 136, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 136, + 600, + 481, + 632 + ], + "type": "text", + "content": "8. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Single-image svbrdf capture with a rendering-aware deep network. ACM Transactions on Graphics (ToG) 37(4), 1-15 (2018)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 136, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 136, + 632, + 481, + 665 + ], + "type": "text", + "content": "9. Deschaintre, V., Aittala, M., Durand, F., Drettakis, G., Bousseau, A.: Flexible svbrdf capture with a multi-image deep network. In: Computer graphics forum. vol. 38, pp. 1-13. Wiley Online Library (2019)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "text", + "content": "10. Dupuy, J., Heitz, E., Iehl, J.C., Poulin, P., Ostromoukhov, V.: Extracting microfacet-based brdf parameters from arbitrary materials with power iterations. Comput. Graph. Forum 34(4), 21-30 (Jul 2015)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "type": "text", + "content": "11. Dupuy, J., Jakob, W.: An adaptive parameterization for efficient material acquisition and rendering. ACM Transactions on graphics (TOG) 37(6), 1-14 (2018)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "type": "text", + "content": "12. Erkoc, Z., Ma, F., Shan, Q., Nießner, M., Dai, A.: Hyperdiffusion: Generating implicit neural fields with weight-space diffusion. arXiv preprint arXiv:2303.17015 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 481, + 226 + ], + "type": "text", + "content": "13. Fan, J., Wang, B., Hasan, M., Yang, J., Yan, L.Q.: Neural brdfs: Representation and operations. arXiv preprint arXiv:2111.03797 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 226, + 481, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 226, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 226, + 481, + 259 + ], + "type": "text", + "content": "14. Gao, D., Li, X., Dong, Y., Peers, P., Xu, K., Tong, X.: Deep inverse rendering for high-resolution svbrdf estimation from an arbitrary number of images. ACM Trans. Graph. 38(4), 134-1 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "type": "text", + "content": "15. Guarnera, D., Guarnera, G., Ghosh, A., Denk, C., Glencross, M.: Brdf representation and acquisition. Computer Graphics Forum 35(2), 625-650 (2016). https://doi.org/https://doi.org/10.1111/cgi.f.12867, https://onlinelibrary.wiley.com/doi/abs/10.1111/cgi.f.12867" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "type": "text", + "content": "16. Guo, J., Lai, S., Tao, C., Cai, Y., Wang, L., Guo, Y., Yan, L.Q.: Highlight-aware two-stream network for single-image svbrdf acquisition. ACM Transactions on Graphics (TOG) 40(4), 1-14 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "text", + "content": "17. Ha, D., Dai, A.M., Le, Q.V.: Hypernetworks. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=rkpAce1lx" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 357, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 357, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 481, + 390 + ], + "type": "text", + "content": "18. Hu, B., Guo, J., Chen, Y., Li, M., Guo, Y.: Deepbrdf: A deep representation for manipulating measured brdf. In: Computer Graphics Forum. vol. 39, pp. 157-166. Wiley Online Library (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 390, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 390, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 390, + 481, + 424 + ], + "type": "text", + "content": "19. Hui, Z., Sunkavalli, K., Lee, J.Y., Hadap, S., Wang, J., Sankaranarayanan, A.C.: Reflectance capture using univariate sampling of brdfs. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 5362-5370 (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "text", + "content": "20. Jiang, W., Trulls, E., Hosang, J., Tagliasacchi, A., Yi, K.M.: Cotr: Correspondence transformer for matching across images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6207-6217 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 456, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 481, + 479 + ], + "type": "text", + "content": "21. Kang, K., et al.: Efficient reflectance capture using an autoencoder. ACM TOG 37(4), 127-1 (2018). https://doi.org/10.1145/3197517.3201279" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 479, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 501 + ], + "type": "text", + "content": "22. Kang, K., et al.: Learning efficient illumination multiplexing for joint capture of reflectance and shape. ACM TOG 38(6), 165-1 (2019)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "text", + "content": "23. Lawrence, J., Ben-Artzi, A., DeCoro, C., Matusik, W., Pfister, H., Ramamoorthi, R., Rusinkiewicz, S.: Inverse shade trees for non-parametric material representation and editing. ACM Transactions on Graphics (ToG) 25(3), 735-745 (2006)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 533, + 481, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 533, + 481, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 533, + 481, + 566 + ], + "type": "text", + "content": "24. Lawrence, J., Rusinkiewicz, S., Ramamoorthi, R.: Efficient brdf importance sampling using a factored representation. ACM Transactions on Graphics (ToG) 23(3), 496-505 (2004)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 566, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 566, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 566, + 481, + 588 + ], + "type": "text", + "content": "25. Liu, C., Fischer, M., Ritschel, T.: Learning to learn and sample brdfs. In: Computer Graphics Forum. vol. 42, pp. 201-211. Wiley Online Library (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 588, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 481, + 621 + ], + "type": "text", + "content": "26. Löw, J., Kronander, J., Ynnerman, A., Unger, J.: BRDF models for accurate and efficient rendering of glossy surfaces. ACM TOG 31(1), 9:1-9:14 (2012). https://doi.org/10.1145/2077341.2077350" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 621, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 621, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 621, + 481, + 643 + ], + "type": "text", + "content": "27. Ma, X., et al.: Free-form scanning of non-planar appearance with neural trace photography. ACM TOG 40(4) (2021)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 643, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 666 + ], + "type": "text", + "content": "28. Ma, X., Xu, X., Zhang, L., Zhou, K., Wu, H.: Opensvbrdf: A database of measured spatially-varying reflectance. ACM Transactions on Graphics 42(6) (2023)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "text", + "content": "29. Martin, R., Roullier, A., Rouffet, R., Kaiser, A., Boubekeur, T.: Materia: Single image high-resolution material capture in the wild. In: Computer Graphics Forum. vol. 41, pp. 163-177. Wiley Online Library (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 151, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 151, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 133, + 151, + 480, + 183 + ], + "type": "text", + "content": "30. Matusik, W., Pfister, H., Brand, M., McMillan, L.: A data-driven reflectance model. ACM Transactions on Graphics (TOG) 22(3), 759-769 (Jul 2003). https://doi.org/10.1145/882262.882343, https://www.merl.com/publications/TR2003-83" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 184, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 184, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 184, + 480, + 205 + ], + "type": "text", + "content": "31. Matusik, W.: A data-driven reflectance model. Ph.D. thesis, Massachusetts Institute of Technology (2003)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 206, + 480, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 206, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 206, + 480, + 239 + ], + "type": "text", + "content": "32. Maximov, M., Leal-Taixe, L., Fritz, M., Ritschel, T.: Deep appearance maps. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8729-8738 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 240, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 240, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 240, + 480, + 262 + ], + "type": "text", + "content": "33. Ngan, A., Durand, F., Matusik, W.: Experimental analysis of brdf models. Rendering Techniques 2005(16th), 2 (2005)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 263, + 480, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 263, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 132, + 263, + 480, + 285 + ], + "type": "text", + "content": "34. Ngan, A., Durand, F., Matusik, W.: Image-driven navigation of analytical brdf models. Rendering Techniques 2006, 399-407 (2006)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 285, + 480, + 318 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 480, + 318 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 480, + 318 + ], + "type": "text", + "content": "35. Ngan, A., Durand, F., Matusik, W.: Experimental Analysis of BRDF Models. In: Eurographics Symposium on Rendering. The Eurographics Association (2005). https://doi.org/10.2312/EGWR/EGSR05/117-126" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 319, + 480, + 351 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 319, + 480, + 351 + ], + "spans": [ + { + "bbox": [ + 132, + 319, + 480, + 351 + ], + "type": "text", + "content": "36. Nielsen, J.B., Jensen, H.W., Ramamoorthi, R.: On optimal, minimal brdf sampling for reflectance acquisition. ACM Transactions on Graphics (TOG) 34(6), 1-11 (2015)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 353, + 480, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 353, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 353, + 480, + 396 + ], + "type": "text", + "content": "37. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 397, + 480, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 480, + 430 + ], + "type": "text", + "content": "38. Rainer, G., Jakob, W., Ghosh, A., Weyrich, T.: Neural btf compression and interpolation. In: Computer Graphics Forum. vol. 38, pp. 235-244. Wiley Online Library (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 431, + 480, + 463 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 431, + 480, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 431, + 480, + 463 + ], + "type": "text", + "content": "39. Ratzlaff, N., Fuxin, L.: Hypergan: A generative model for diverse, performant neural networks. In: International Conference on Machine Learning. pp. 5361-5369. PMLR (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 464, + 480, + 496 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 464, + 480, + 496 + ], + "spans": [ + { + "bbox": [ + 133, + 464, + 480, + 496 + ], + "type": "text", + "content": "40. Rebain, D., Matthews, M.J., Yi, K.M., Sharma, G., Lagun, D., Tagliasacchi, A.: Attention beats concatenation for conditioning neural fields. arXiv preprint arXiv:2209.10684 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 498, + 480, + 530 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 480, + 530 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 480, + 530 + ], + "type": "text", + "content": "41. Rusinkiewicz, S.M.: A new change of variables for efficient brdf representation. In: Rendering Techniques' 98: Proceedings of the Eurographics Workshop in Vienna, Austria, June 29—July 1, 1998 9. pp. 11-22. Springer (1998)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 532, + 480, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 480, + 553 + ], + "type": "text", + "content": "42. Serrano, A., Gutierrez, D., Myszkowski, K., Seidel, H.P., Masia, B.: An intuitive control space for material appearance. arXiv preprint arXiv:1806.04950 (2018)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 554, + 480, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 480, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 480, + 586 + ], + "type": "text", + "content": "43. Sitzmann, V., Chan, E., Tucker, R., Snavely, N., Wetzstein, G.: Metasdf: Meta-learning signed distance functions. Advances in Neural Information Processing Systems 33, 10136-10147 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 587, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 587, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 587, + 480, + 609 + ], + "type": "text", + "content": "44. Sitzmann, V., Martel, J.N., Bergman, A.W., Lindell, D.B., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: NeurIPS (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 133, + 610, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 610, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 133, + 610, + 480, + 632 + ], + "type": "text", + "content": "45. Sun, X., Zhou, K., Chen, Y., Lin, S., Shi, J., Guo, B.: Interactive relighting with dynamic brdfs. In: ACM SIGGRAPH 2007 papers, pp. 27-es (2007)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "text", + "content": "46. Sztrajman, A., Rainer, G., Ritschel, T., Weyrich, T.: Neural brdf representation and importance sampling. In: Computer Graphics Forum. vol. 40, pp. 332-346. Wiley Online Library (2021)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "type": "text", + "content": "F. Gokbudak et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 479 + ], + "type": "list", + "angle": 0, + "index": 13, + "blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "text", + "content": "47. Tancik, M., Srinivasan, P.P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J.T., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 482, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 482, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 482, + 171 + ], + "type": "text", + "content": "48. Tongbuasirilai, T., Unger, J., Kronander, J., Kurt, M.: Compact and intuitive data-driven brdf models. The Visual Computer 36, 855-872 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 482, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 482, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 482, + 205 + ], + "type": "text", + "content": "49. Tunwattanapong, B., Fyffe, G., Graham, P., Busch, J., Yu, X., Ghosh, A., Debevec, P.: Acquiring reflectance and shape from continuous spherical harmonic illumination. ACM Transactions on graphics (TOG) 32(4), 1-12 (2013)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 482, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 482, + 258 + ], + "type": "text", + "content": "50. Walter, B., Marschner, S.R., Li, H., Torrance, K.E.: Microfacet models for refraction through rough surfaces. In: Proceedings of the 18th Eurographics Conference on Rendering Techniques. pp. 195-206. EGSR'07, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland (2007). https://doi.org/10.2312/EGWR/EGSR07/195-206, http://dx.doi.org/10.2312/EGWR/EGSR07/195-206" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 482, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 482, + 281 + ], + "type": "text", + "content": "51. Wang, P., Chen, X., Chen, T., Venugopalan, S., Wang, Z., et al.: Is attention all nef needs? arXiv preprint arXiv:2207.13298 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 281, + 482, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 482, + 313 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 482, + 313 + ], + "type": "text", + "content": "52. Ward, G.J.: Measuring and modeling anisotropic reflection. In: Proceedings of the 19th annual conference on Computer graphics and interactive techniques. pp. 265-272 (1992)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 482, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 482, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 482, + 358 + ], + "type": "text", + "content": "53. Yang, H., Hong, L., Li, A., Hu, T., Li, Z., Lee, G.H., Wang, L.: Contranerf: Generalizable neural radiance fields for synthetic-to-real novel view synthesis via contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16508-16517 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 358, + 482, + 379 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 482, + 379 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 482, + 379 + ], + "type": "text", + "content": "54. Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R.R., Smola, A.J.: Deep sets. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 380, + 482, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 482, + 413 + ], + "type": "text", + "content": "55. Zheng, C., Zheng, R., Wang, R., Zhao, S., Bao, H.: A compact representation of measured brdfs using neural processes. ACM Transactions on Graphics (TOG) 41(2), 1-15 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 413, + 482, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 482, + 445 + ], + "type": "text", + "content": "56. Zhong, F., Fogarty, K., Hanji, P., Wu, T., Sztrajman, A., Spielberg, A., Tagliasacchi, A., Bosilj, P., Oztireli, C.: Neural fields with hard constraints of arbitrary differential order. arXiv preprint arXiv:2306.08943 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 446, + 482, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 482, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 482, + 479 + ], + "type": "text", + "content": "57. Zhou, X., Kalantari, N.K.: Adversarial single-image svbrdf estimation with hybrid training. In: Computer Graphics Forum. vol. 40, pp. 315-325. Wiley Online Library (2021)" + } + ] + } + ], + "index": 12 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 445, + 102 + ], + "type": "text", + "content": "Hypernetworks for Generalizable BRDF Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_content_list.json b/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..9f4ef345dff328d8a351c79dda137a6d45d1a1c3 --- /dev/null +++ b/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_content_list.json @@ -0,0 +1,1516 @@ +[ + { + "type": "text", + "text": "I Can't Believe It's Not Scene Flow!", + "text_level": 1, + "bbox": [ + 292, + 142, + 709, + 160 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ishan Khatri $^{1,3*}$ , Kyle Vedder $^{2*}$ , Neehar Peri $^{3}$ , Deva Ramanan $^{3}$ , James Hays $^{4}$", + "bbox": [ + 218, + 188, + 781, + 205 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1Stack AV, 2University of Pennsylvania, 3CMU, 4Georgia Tech", + "bbox": [ + 290, + 215, + 712, + 232 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/ac93c7b587dfd2c2eefffd7f21bb389d064bd06d0394acc44a17701965dff286.jpg", + "image_caption": [ + "(a) Ground Truth" + ], + "image_footnote": [], + "bbox": [ + 246, + 263, + 383, + 358 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/515cadb1123e4688e91e99eb77fd1e334503f510709acc2cd775c5a7a618e952.jpg", + "image_caption": [ + "(b) FastFlow3D [12]" + ], + "image_footnote": [], + "bbox": [ + 428, + 263, + 562, + 357 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/d0efe669bb1331c8ce1b239d3b31d2049572624c46af34b212c1500ce662eb9d.jpg", + "image_caption": [ + "(c) DeFlow [53]" + ], + "image_footnote": [], + "bbox": [ + 612, + 263, + 750, + 357 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/5b8caf28a9ef261952fa1b3e51afbccbefb194a81dfedc02a0f25b0e7ba860ee.jpg", + "image_caption": [ + "(d) NSFP [18]" + ], + "image_footnote": [], + "bbox": [ + 248, + 404, + 383, + 496 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/af9f40f80ca2b3c94119aa46ad6be8ba038c03edda5b5b59f9bfe12ca45b1ebb.jpg", + "image_caption": [ + "(e) ZeroFlow XL 5x [42]" + ], + "image_footnote": [], + "bbox": [ + 428, + 404, + 563, + 496 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/e012151d830a25e7ec78fae36fca6cb5956788c0685a9efb483be8bc9143a0ce.jpg", + "image_caption": [ + "(f) TrackFlow (Ours)", + "Fig. 1: We visualize an example of two pedestrians (walking from left to right), cherry-picked to have unusually high density lidar returns, making it particularly easy to estimate flow. We expect that state-of-the-art scene flow methods should work well in this case, but find that all prior art fails catastrophically. Notably, TrackFlow is the only method to estimate flow for these pedestrians." + ], + "image_footnote": [], + "bbox": [ + 611, + 404, + 746, + 496 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. State-of-the-art scene flow methods broadly fail to describe the motion of small objects, and existing evaluation protocols hide this failure by averaging over many points. To address this limitation, we propose Bucket Normalized EPE, a new class-aware and speed-normalized evaluation protocol that better contextualizes error comparisons between object types that move at vastly different speeds. In addition, we propose TrackFlow, a frustratingly simple supervised scene flow baseline that combines a high-quality 3D object detector (trained using standard class re-balancing techniques) with a simple Kalman filter-based tracker. Notably, TrackFlow achieves state-of-the-art performance on existing metrics and shows large improvements over prior work on our proposed metric. Our results highlight that scene flow evaluation must be class and speed aware, and supervised scene flow methods must address point-level class imbalances. Our evaluation toolkit and code is available on GitHub.", + "bbox": [ + 259, + 619, + 740, + 811 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: LiDAR Scene Flow, Autonomous Vehicles", + "bbox": [ + 261, + 825, + 630, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 143, + 375, + 161 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Scene flow estimation is the task of describing a 3D motion field between temporally successive point clouds [2, 7, 12, 25, 42, 43, 52]. In theory, high quality flow estimators can provide a valuable signal about scene-level dynamics [12, 42] for both online [52] and offline [32] processing. Do state-of-the-art scene flow methods actually work well in practice?", + "bbox": [ + 212, + 175, + 782, + 251 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Status Quo. Standard scene flow metrics suggest that existing methods can estimate motion to centimeter-level accuracy. For example, ZeroFlow XL 5x [42] achieves an average Threeway EPE [5] of only 4.9 centimeters (1.9 inches) and a Dynamic EPE (averaged over points moving faster than $0.5\\mathrm{m / s}$ ) of 11.7 centimeters (4.6 inches). Notably, these errors are relatively small compared to the scale of cars and pedestrians, implying that current scene flow methods produce high quality flow. On the scale of cars and people, these feel like tiny errors and seem to imply that current scene flow methods are high quality.", + "bbox": [ + 212, + 252, + 784, + 371 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Bucket Normalized EPE. We visualize flow predictions from several state-of-the-art supervised (FastFlow3D [12], DeFlow [53]) and unsupervised (NSFP [18 ZeroFlow [42]) approaches and find that all methods underestimate flow for small objects (Fig. 1) with fewer lidar points (e.g. pedestrians and bicyclists). Surprisingly, existing scene flow metrics do not highlight such failure cases on these safety-critical categories because small objects only make up a tiny fraction of the dynamic points in a scene (Fig. 2). To address this limitation, we propose Bucket Normalized EPE, a new evaluation protocol that allows us to directly measure performance disparities across classes of different sizes and speed profiles. Specifically, Bucket Normalized EPE evaluates the percentage of described motion, allowing us to normalize comparisons between objects moving at different speeds. Our proposed evaluation metric takes inspiration from mean Average Precision (mAP), a metric commonly used to evaluate object detectors. Notably, unlike existing scene flow metrics, mAP equally weights the performance of large common objects like cars and small rare objects like strollers. Therefore, state-of-the-art 3D object detectors use data augmentation and class re-balancing techniques [56] to perform well on both common and rare classes.", + "bbox": [ + 212, + 372, + 785, + 628 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "TrackFlow. Based on this observation, we propose TrackFlow, a frustratingly simple baseline that generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track. Specifically, we run a state-of-the-art 3D object detector [46] followed by a simple 3D Kalman filter-based tracker [47] to generate object trajectories. Despite its simplicity, TrackFlow achieves state-of-the-art performance on Threeway EPE and significantly outperforms prior art on our Bucket Normalized EPE metric, capturing an additional $10\\%$ of total motion in general and an additional $20\\%$ of total motion on pedestrians (a $1.5 \\times$ improvement). Importantly, our simple baseline's state-of-the-art performance is an indictment of existing supervised scene flow methods. We argue that utilizing (well established) class re-balancing techniques can improve performance on rare safety-critical categories in real-world datasets, and evaluating scene flow methods using class and speed-aware metrics more closely reflects real-world performance.", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Contributions. We present three primary contributions.", + "bbox": [ + 238, + 146, + 653, + 161 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. We highlight the qualitative failure of state-of-the-art scene flow methods on safety-critical categories like pedestrians and bicycles.", + "2. We introduce Bucket Normalized EPE, a new evaluation protocol that allows us to quantify this qualitative failure on small objects.", + "3. We propose TrackFlow, a frustratingly simple baseline that achieves state-of-the-art performance on standard metrics and significantly outperforms prior art on our class-aware Bucket Normalized EPE metric." + ], + "bbox": [ + 220, + 171, + 782, + 273 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 301, + 387, + 316 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Scene Flow Datasets and Ground Truth", + "text_level": 1, + "bbox": [ + 215, + 333, + 589, + 347 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Unlike next token prediction in language [38] or next frame prediction in vision [48], scene flow is not naively self-supervised: future observations do not provide ground truth scene flow. Therefore, ground truth motion descriptions must be provided by an oracle, typically from human annotators for real data [4, 29, 30, 40, 49] or a data generator for synthetic datasets [28, 55]. For real world datasets (typically from the autonomous vehicle domain) human annotations are provided in the form of 3D bounding boxes and tracks for every object in the scene [5]. Consequently, the generated ground truth flow is assumed to be rigid, even in the case of non-rigid motion like pedestrian gaits.", + "bbox": [ + 212, + 358, + 784, + 494 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.2 Scene Flow Estimation", + "text_level": 1, + "bbox": [ + 215, + 517, + 450, + 531 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Given point clouds $P_{t}$ and $P_{t + 1}$ , scene flow estimators predict $\\hat{F}_{t,t + 1}$ , a 3D vector per point in $P_{t}$ that describes its motion from $t$ to $t + 1$ [6]. Performance is typically measured using Average Endpoint Error (EPE) which is the $L_{2}$ norm between the predicted $(\\hat{F}_{t,t + 1})$ and ground truth flow $(F_{t,t + 1}^{*})$ , as in Equation 1.", + "bbox": [ + 212, + 542, + 782, + 604 + ], + "page_idx": 2 + }, + { + "type": "equation", + "text": "\n$$\n\\text {A v e r a g e} (P _ {t}) = \\frac {1}{\\| P _ {t} \\|} \\sum_ {p \\in P _ {t}} \\left\\| \\hat {F} _ {t, t + 1} (p) - F _ {t, t + 1} ^ {*} (p) \\right\\| _ {2}. \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 313, + 613, + 784, + 646 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Current state-of-the-art methods for scene flow estimation broadly fall into one of two categories: supervised and unsupervised.", + "bbox": [ + 212, + 650, + 782, + 680 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Supervised Scene Flow methods train feedforward networks to perform flow vector regression based on ground truth annotations [1,3,10,12,15,17,21,25,37, 41, 45, 50, 53]. Many of these networks utilize custom point operations such as point-based convolutions [10, 15, 21, 25], making them intractable to train on large point clouds. In contrast, FastFlow3D [12] uses a feedforward architecture based on PointPillars [16], an efficient lidar detector architecture, to train and predict flow on real-world large-scale point clouds. FastFlow3D's speed and quality make it a popular base architecture for both unsupervised and supervised methods like ZeroFlow [42] and DeFlow [53], respectively.", + "bbox": [ + 212, + 703, + 785, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "I Can't Believe It's Not Scene Flow!", + "bbox": [ + 488, + 114, + 730, + 127 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Unsupervised Scene Flow methods tend to use online optimization against surrogate objectives such as Chamfer distance [18], cycle-consistency [31], distance transforms [19], or other hand-designed heuristics [5, 9, 36]. For example, Neural Scene Flow Prior (NSFP) [18] provides high quality scene flow estimates by optimizing a small ReLU MLP at test time to minimize Chamfer distance and maintain cycle-consistency. Other unsupervised methods like ZeroFlow [42] indirectly leverage online optimization. Vedder et. al [42] introduces Scene Flow via Distillation, a framework that uses a slow optimization-based method to pseudolabel unlabeled point cloud pairs and trains a fast feedforward network with these pseudolabels.", + "bbox": [ + 215, + 146, + 787, + 297 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.3 Scene Flow Evaluation Metrics", + "text_level": 1, + "bbox": [ + 215, + 319, + 516, + 333 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In real-world scenes, most points belong to the static background. Consequently, simply computing Average EPE (Equation 1) over all points is dominated by background points. In order to separately measure non-ego dynamics, Chodosh et al. [5] introduces Threeway EPE, which computes a mean over the Average EPE for three disjoint classes of points: Foreground Dynamic (points inside bounding box labels moving greater than $0.5\\mathrm{m / s}$ ), Foreground Static (points inside bounding box labels moving less than $0.5\\mathrm{m / s}$ ), and Background Static. We extend Threeway EPE to consider different class and speed profiles.", + "bbox": [ + 215, + 344, + 787, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.4 3D Object Detection and Tracking", + "text_level": 1, + "bbox": [ + 215, + 486, + 545, + 502 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Object detectors have advanced techniques for training with imbalanced datasets. Notably, modern object detectors use carefully designed losses to mitigate foreground-vs-background imbalances in proposal generation, and data augmentation strategies to train with long-tailed taxonomies. Existing methods address imbalanced foreground-vs-background region proposals using Focal Loss [22] to upweight the importance of foreground regions. More recently, 3D object detectors use class-balanced sampling [56] and copy-paste augmentation to upsample and rebalance the distribution of examples per class. In addition, state-of-the-art 3D object detectors take advantage of multi-modal data to improve detection [27,33,44] of small and rare categories. Since many state-of-the-art tracking algorithms [47] follow the tracking-by-detection paradigm, improving detection quality also significantly improves tracking performance.", + "bbox": [ + 215, + 511, + 815, + 691 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Bucket Normalized EPE: Small Objects (Should) Matter in Scene Flow", + "text_level": 1, + "bbox": [ + 215, + 714, + 730, + 750 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "As shown in Fig. 1 (and further in Fig. 8), existing scene flow methods consistently struggle to describe the motion of safety-critical objects like pedestrians. However, these failures are not captured by Threeway EPE because these objects are small and have few points. Specifically, Threeway EPE's Foreground Dynamic category is dominated by large, common objects with many points like", + "bbox": [ + 215, + 763, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/7eee1aa28f67589199ce68df7bf9e24b1436a02bdbbc53df18c64ffc13ec4e46.jpg", + "image_caption": [ + "Fig. 2: Number of points from each semantic meta-class for Argoverse 2's val split. Although PEDESTRIAN instances are common, they contribute less than $1\\%$ of the total number of points owing to their small instance size relative to CAR and OTHER VEHICLES. Number of points (Y axis) shown on a log scale." + ], + "image_footnote": [], + "bbox": [ + 248, + 142, + 754, + 319 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "cars and other vehicles. As shown in Fig. 2, $15\\%$ of all points are from cars or other vehicles (dominating Foreground Dynamic's Average EPE), while fewer than $1\\%$ of points are from pedestrians and other vulnerable road users (VRUs).", + "bbox": [ + 212, + 417, + 782, + 460 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Additionally, Threeway EPE fails to account for large differences in speed across objects. For example, a $0.5\\mathrm{m / s}$ estimation error on a car moving $20\\mathrm{m / s}$ is negligible $(< 2.5\\%)$ , while a $0.5\\mathrm{m / s}$ estimation error on a pedestrian moving $0.5\\mathrm{m / s}$ fails to describe $100\\%$ of the pedestrian's motion. However, Threeway EPE treats both estimation errors equally.", + "bbox": [ + 212, + 462, + 784, + 537 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We address these two limitations with our Bucket Normalized EPE metric. First, our proposed metric breaks down the object distribution using a taxonomy that human labelers have deemed important (similar to mean Average Precision [23], see Appendix C for discussion on semantics-free evaluation). Second, our proposed metric allows us to contextualize the percentage of object motion being described by normalizing for the speed of the object, allowing us to directly compare performance across object categories.", + "bbox": [ + 212, + 537, + 784, + 643 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We implement our class-aware and speed-normalized metric by accumulating every point into a class-speed matrix (e.g. Appendix B, Table 4) based on its ground truth speed and class, recording an Average EPE as well as a per-bucket average speed. To summarize these results, we report two numbers per class:", + "bbox": [ + 212, + 645, + 784, + 704 + ], + "page_idx": 4 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Static EPE, taken directly from the Average EPE of the first speed bucket for that class (i.e. the first column of Appendix B, Table 4)", + "- Dynamic Normalized EPE, computed from a mean over the Normalized EPE $\\left(\\frac{\\text{Average EPE}}{\\text{average speed}}\\right)$ of each non-empty speed bucket (i.e. an average across the Normalized EPEs of the second column onwards in Appendix B, Table 4)" + ], + "bbox": [ + 225, + 718, + 784, + 795 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Dynamic Normalized EPE measures the fraction of motion not described by the estimated flow vectors across the entire speed spectrum. A method that only", + "bbox": [ + 214, + 809, + 782, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "I Can't Believe It's Not Scene Flow!", + "bbox": [ + 488, + 114, + 730, + 127 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/b9f8782ad3cf989a18a20d2ded1efef8e71b6cf80e8182366effe625a89556cf.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND0.002402-
CAR0.0184420.182092
OTHER VEHICLES0.0814750.312882
PEDESTRIAN0.0528420.396849
WHEELED VRU0.0625730.257647
", + "bbox": [ + 243, + 143, + 753, + 242 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Table 1: TrackFlow's Bucket Normalized EPE on the Argoverse 2 test split. Similar to Threeway EPE, we breakdown our evaluation into static and dynamic buckets. However, we also further breakdown performance by meta-categories and normalize by speed to compare performance disparities on safety-critical categories. TrackFlow is able to capture most dynamic car motion (lower is better), but performs considerably worse on other vehicles and pedestrian.", + "bbox": [ + 212, + 258, + 787, + 343 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "predicts ego motion (e.g. $\\vec{0}$ after ego-motion compensation) will achieve 1.0 Dynamic Normalized EPE, and a method that perfectly describes all motion will have 0.0 Dynamic Normalized EPE. Methods may achieve errors greater than 1.0 by predicting errors with a magnitude greater than the average speed. For example, a method that describes the negative vector of true motion will get exactly 2.0 Dynamic Normalized EPE (every bucket's Average EPE will be exactly $2\\times$ the magnitude of the average speed). The range of Dynamic Normalized EPE is between 0 (perfect) and $\\infty$ , and is undefined for buckets without any points. After normalization, Dynamic Normalized EPE can be directly compared across classes.", + "bbox": [ + 212, + 383, + 787, + 532 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We provide an example per-class performance breakdown in Table 1 for TrackFlow (Section 4). Results can be further summarized into a single tuple of mean Static EPE and mean Dynamic Normalized EPE by taking a mean across classes (similar to mean Average Precision [23]). TrackFlow has a mean Static EPE of 0.076277 and a mean Dynamic Normalized EPE of 0.287368. We rank methods according to their mean Dynamic Normalized EPE.", + "bbox": [ + 212, + 536, + 787, + 628 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 TrackFlow: Scene Flow via Tracking", + "text_level": 1, + "bbox": [ + 214, + 650, + 604, + 670 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To highlight the failure of current supervised scene flow methods on smaller objects, we propose Scene Flow via Tracking, a simple framework that uses bounding box track motion from off-the-shelf 3D detectors and trackers to generate scene flow estimates (Fig. 3). We instantiate Scene Flow via Tracking with LE3DE2E [46] $^1$ , a state-of-the-art 3D detector, and AB3DMOT [47], a Kalman filter-based 3D tracker. As shown in Section 5, TrackFlow achieves state-of-the-art performance on Threeway EPE and beats all prior art by a large margin on Bucket Normalized EPE.", + "bbox": [ + 212, + 683, + 787, + 805 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 5 + }, + { + "type": "page_footnote", + "text": "$^{1}$ LE3DE2E [46] is the winning method from the Argoverse 2 2023 3D Detection, Tracking and Forecasting challenge [33-35].", + "bbox": [ + 217, + 809, + 785, + 840 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/3959e984425ad728f619dbd89b2bc9ede735287f6cb57544c46305657f3b6446.jpg", + "image_caption": [ + "Fig. 3: Overview of the Scene Flow via Tracking framework. Our proposed framework generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track." + ], + "image_footnote": [], + "bbox": [ + 215, + 142, + 787, + 277 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Scene Flow via Tracking works well in practice because it mimics the ground truth flow annotation process. Specifically, ground truth flow is generated using rigid transforms to describe point-level motion within ground truth 3D object tracks (Section 2.1). Therefore, a perfect 3D detector and tracker will achieve perfect flow. However, the power of TrackFlow isn't just derived from its use of bounding boxes; it also greatly benefits from recent advances in class-imbalanced learning [56]. As discussed in Section 2.4, modern detectors are trained with a variety of data augmentation techniques to achieve high precision and recall on all semantic class. TrackFlow leverages the strength of modern 3D detectors to significantly outperform prior art on pedestrians and other small objects.", + "bbox": [ + 212, + 358, + 787, + 508 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Interestingly, we find that the Scene Flow via Tracking framework performs best when using detectors tuned to a low confidence threshold. Typically, detectors are optimized to only predict high confidence boxes (0.7 - 0.9) to minimize the number of false positives. However, our method works best when setting the confidence threshold lower (0.2 for TrackFlow) to increase recall. Specifically, we find that detectors with higher recall and more accurate heading estimation are better suited for Scene Flow via Tracking. We explore detector choice and ablate the impact of confidence thresholds further in Section 5.3.", + "bbox": [ + 212, + 510, + 787, + 630 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 215, + 652, + 375, + 670 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In this section, we compare TrackFlow against state-of-the-art supervised and unsupervised scene flow methods like FastFlow3D [12], DeFlow [53], NSFP [18], and ZeroFlow [42] on the Argoverse 2 benchmark $[49]^2$ .", + "bbox": [ + 212, + 681, + 785, + 729 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 TrackFlow Achieves SOTA Performance on Threeway EPE", + "text_level": 1, + "bbox": [ + 214, + 750, + 750, + 763 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "TrackFlow is state-of-the-art on Threeway EPE (Fig. 4a) on the Argoverse 2 benchmark [49], achieving an overall reduction of $0.0015\\mathrm{m}$ ( $0.15\\mathrm{cm}$ , or $1.5\\mathrm{mm}$ )", + "bbox": [ + 212, + 771, + 785, + 805 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "I Can't Believe It's Not Scene Flow!", + "bbox": [ + 488, + 114, + 732, + 127 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_footnote", + "text": "2 All evaluations are performed with a maximum radius of $35\\mathrm{m}$ from the ego vehicle to maintain consistency with Chodosh et al. [5].", + "bbox": [ + 217, + 810, + 785, + 840 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/2e227c4126a0951cb9d4562f63db8fa895e356d79e497091a393966fb08cee95.jpg", + "image_caption": [ + "(a) Threeway EPE", + "Fig. 4: Threeway EPE and Threeway EPE's Foreground Dynamic performance of recent supervised and unsupervised scene flow methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color is consistent between plots. We find that all recent methods achieve $5\\mathrm{cm}$ error on Threeway EPE, suggesting that these approaches work well in-the-wild. However, this number hides the failure of these methods to describe small object motion." + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 498, + 340 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/8be72f05938353d3d1f72e9330835ed14dc53ca159d36a88514f62b59d0c7710.jpg", + "image_caption": [ + "(b) Threeway EPE's Foreground Dynamic" + ], + "image_footnote": [], + "bbox": [ + 501, + 142, + 779, + 340 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "over the next best method, ZeroFlow XL 5x. Notably, this improvement can be attributed to significantly better Threeway EPE's Dynamic Foreground (Fig. 4b). Is this performance difference meaningful?", + "bbox": [ + 212, + 479, + 787, + 526 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Based on our reduction of $1.5\\mathrm{mm}$ on Threeway EPE (about $4\\times$ the thickness of a human fingernail), it would seem that TrackFlow is only an incremental improvement over prior art. However, TrackFlow qualitatively outperforms prior work on important small objects such as pedestrians (Fig. 1, Fig. 8). As shown in the next section, our proposed evaluation protocol Bucket Normalized EPE makes it quantitatively clear that TrackFlow performs significantly better on safety-critical categories like pedestrians and VRUs.", + "bbox": [ + 212, + 527, + 789, + 633 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5.2 Bucket Normalized EPE Highlights Failures on Small Objects", + "text_level": 1, + "bbox": [ + 214, + 659, + 772, + 676 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Evaluating existing state-of-the-art methods on our class-aware, speed-normalized evaluation, Bucket Normalized EPE, makes it clear that TrackFlow meaningfully outperforms prior art (Fig. 6) — TrackFlow correctly describes almost $10\\%$ additional total motion across meta-classes compared to DeFlow [53]. This difference in dynamic performance becomes even more clear when broken down by meta-class: Fig. 5 shows that TrackFlow is the only method able to describe more than $50\\%$ of pedestrian motion, beating DeFlow [53] by more than $20\\%$ (Fig. 5c), a $1.5 \\times$ improvement. Similarly, other state-of-the-art methods like NSFP [18] and ZeroFlow XL 5x [42] describe less than $30\\%$ and $20\\%$ of pedestrian motion, respectively.", + "bbox": [ + 212, + 688, + 789, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/2d4d3542d9f5fe8431e2f85d72b59b02b0f356d44b2933f718f2da7cca06c136.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 223, + 142, + 500, + 260 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/13a44603e3b35cdc80a121993f3568576d38a9d5d39003db742282d007c4d043.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 509, + 142, + 769, + 261 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/6d5dc4c161fe2d1cd55f405c3df3ad70c33fea71ce799e6da8bb3849958c7593.jpg", + "image_caption": [ + "(a) CAR", + "(c) PEDESTRIAN", + "Fig. 5: Per meta-class Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color and position is consistent between plots. TrackFlow significantly improves over prior work on both pedestrian and wheeled VRUs. Notably, Bucket Normalized EPE quantitatively demonstrates significant method performance differences not highlighted in Threeway EPE." + ], + "image_footnote": [], + "bbox": [ + 225, + 273, + 500, + 392 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/f6881465c6859e08d145d57036d3efba6d56dbf99c49d672a10959c116c7849f.jpg", + "image_caption": [ + "(b) OTHER VEHICLES", + "(d) WHEELLED VRU" + ], + "image_footnote": [], + "bbox": [ + 509, + 273, + 769, + 392 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Bucket Normalized EPE allows practitioners to effectively compare performance between methods that were almost indistinguishable under Threeway EPE. For example, if you only care about flow performance on cars, DeFlow out-performs all other methods including TrackFlow (Fig. 5a), while ZeroFlow XL 5x out-performs all other methods on larger vehicles (Fig. 5b).", + "bbox": [ + 212, + 530, + 787, + 606 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.3 What Makes a Good Detector for TrackFlow?", + "text_level": 1, + "bbox": [ + 214, + 627, + 640, + 642 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "As discussed in Section 4, we tune Scene Flow via Tracking with a low confidence threshold to maximize recall. What makes a good detector for TrackFlow?", + "bbox": [ + 212, + 651, + 785, + 680 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We ablate the impact of detector quality on TrackFlow by replacing LE3DE2E [46] with BEVFusion [26]. We call this new approach TrackFlowBEVF. BEVFusion only has $2\\%$ lower mAP than LE3DE2E on the AV2 detection leaderboard3, but we find that TrackFlowBEVF performs significantly worse than TrackFlow, with $10\\%$ to $22\\%$ drops in performance on Dynamic Normalized EPE (Table 2).", + "bbox": [ + 212, + 681, + 787, + 757 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "This significant degradation is the result of BEVFusion's poor recall at low confidence thresholds (Table 3). In contrast, LE3DE2E has very high recall at low thresholds (Fig. 7), producing many candidate boxes for pedestrians in the", + "bbox": [ + 212, + 757, + 787, + 803 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "I Can't Believe It's Not Scene Flow!", + "bbox": [ + 488, + 114, + 730, + 127 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_footnote", + "text": "$^{3}$ BEVFusion [26] was second on the Argoverse 2 2023 3D Detection, Tracking and Forecasting challenge [33-35].", + "bbox": [ + 217, + 809, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/208570372b3b9002c83ad76845837946224efec5965ec59ccb9fe98e62f5723f.jpg", + "image_caption": [ + "Fig. 6: Average Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Our simple baseline achieves state-of-the-art performance, suggesting that supervised scene flow methods should embrace point-level class rebalancing." + ], + "image_footnote": [], + "bbox": [ + 225, + 143, + 779, + 391 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/6dc0130204eeb8305c383cc350ab44ad47a7bd4ad984fc93833f657d4a4f01b2.jpg", + "image_caption": [ + "Fig. 7: A qualitative comparison of the recall of BEVFusion and LE3DE2E. LE3DE2E has much higher recall, allowing it to pick out pedestrians BEVFusion missed (circled in red), and better quality box heading estimates. Both detectors are using a confidence threshold of 0.2." + ], + "image_footnote": [], + "bbox": [ + 225, + 492, + 777, + 715 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "scene. BEVFusion's false negatives are extremely costly to TrackFlowBEVF, as they result in $\\vec{0}$ flow estimates that miss $100\\%$ of each false positive pedestrian's motion.", + "bbox": [ + 212, + 792, + 787, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/87231a22d5785ed90c8fc808d61f34e72fc0b5faef7326b0c7ec1e0614454c85.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND-0.000228-
CAR+0.039049+0.117944
OTHER VEHICLES+0.009013+0.224830
PEDESTRIAN+0.007187+0.224250
WHEELED VRU-0.025889+0.151373
", + "bbox": [ + 243, + 143, + 753, + 243 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/113fd34f950f142ea67ca9a3b33b8b13dd900ebdc9b88abd0b197dacadc7ad63.jpg", + "table_caption": [ + "Table 2: Relative Bucket Normalized EPE performance of TrackFlowBEVF compared to TrackFlow, on the Argoverse 2's test split. Increases in error (worse) are shown with a + in red, and decreases in error (better) are shown with a - in green. TrackFlow's absolute results are shown in Table 1.BEVFusion only has $2\\%$ lower mAP than LE3DE2E on the AV2 detection leaderboard, but performs significantly worse than TrackFlow on Dynamic Normalized EPE." + ], + "table_footnote": [], + "table_body": "
ConfidenceMean Dynamic Norm EPE
0.10.4816
0.20.4643
0.30.6008
0.40.8176
", + "bbox": [ + 264, + 367, + 733, + 441 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Table 3: Mean Dynamic Bucketed EPE values for TrackFlowBEVF using various confidence thresholds for the detector. Lower confidence with higher recall significantly improve Dynamic Norm EPE performance.", + "bbox": [ + 212, + 455, + 787, + 500 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "More broadly, a good detector for Scene Flow via Tracking isn't necessarily one with a high mAP; it's one with very high recall and accurate heading estimates. Notably, these error characteristics enable the tracker to reject false positives. We believe this interaction between the detector and tracker is an important yet subtle point — two detectors may have the same mAP, but dramatically different performance in our Scene Flow via Tracking framework.", + "bbox": [ + 212, + 542, + 787, + 633 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 214, + 656, + 359, + 672 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In this work, we highlight that current scene flow methods consistently fail to describe motion on pedestrians and other small objects. We demonstrate that current standard evaluation metrics hide this failure and present Bucket Normalized EPE, a new class-aware, speed normalized evaluation protocol, to quantify this failure. In addition, we present TrackFlow, a frustratingly simple supervised scene flow baseline that achieves state-of-the-art on Threeway EPE and Bucket Normalized EPE. We argue that current evaluation protocols fail to reveal performance across the distribution of safety-critical objects, and do not contextualize absolute errors in the context of an object's speed. Moreover, we highlight that class and speed aware evaluation is important even if a method has zero human", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "I Can't Believe It's Not Scene Flow!", + "bbox": [ + 488, + 114, + 730, + 127 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/02c1df415cbcd32d0dec305c9688d1a3a4f21c015ee928a778b061f114e5c497.jpg", + "image_caption": [ + "(a) Ground Truth (b) FastFlow3D", + "(c) DeFlow", + "(d) NSFP", + "(e) ZeroFlow", + "(f) TrackFlow", + "Fig. 8: Visualizations of different methods on diverse scenes in Argoverse 2. Each method is estimating flow from the blue to the green point cloud." + ], + "image_footnote": [], + "bbox": [ + 218, + 142, + 784, + 502 + ], + "page_idx": 11 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "Row 1: Two pedestrians in left foreground with cars moving in the background. Track-Flow is the only method able to describe the pedestrian motion.", + "Row 2: Three pedestrians walking across an intersection in front of a stationary car. DeFlow is able to capture the furthest pedestrian, but only TrackFlow is able to capture the motion of all three. TrackFlow also falsely estimates motion of the moving box truck in the background.", + "Row 3: Top view of pedestrians walking down the sidewalk between a building and several cars parked in the street. TrackFlow is the only method able to describe the pedestrian motion.", + "Row 4: Pedestrians walking down the sidewalk next to a moving car. TrackFlow is the only method able to describe the pedestrian motion.", + "Row 5: Two bicyclists riding across an intersection next to driving cars. Most methods are able to capture the training bicyclists and the moving cars, but only NSFP and TrackFlow are able to capture the lead bicyclist.", + "Row 6: Two pedestrians walk across an intersection while a car drives parallel to them. All methods capture the car motion, but only DeFlow, NSFP, and TrackFlow capture most of the pedestrian motion. TrackFlow also falsely estimates motion of one of the parked cars far down the street in the background." + ], + "bbox": [ + 220, + 575, + 784, + 825 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 269, + 114, + 370, + 126 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "supervision. Importantly, we cannot expect any method to meaningfully generalize to the long tail of unknown objects if it cannot provide high quality motion descriptions on a known set of objects. Lastly, TrackFlow outperforms prior art by a wide margin because it leverages recent advances in class imbalanced learning. Our approach highlights that supervised scene flow methods should adopt many of the lessons learned by the detection community to properly address class and point imbalances.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "6.1 Limitations", + "text_level": 1, + "bbox": [ + 214, + 275, + 356, + 287 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "TrackFlow only predicts rigid flow for objects within LE3DE2E's fixed taxonomy because it uses a closed-world bounding box based detector. However, as discussed in Appendix D, these limitations can be addressed with a different detector architectures, and is not a fundamental limitations of the Scene Flow via Tracking framework.", + "bbox": [ + 212, + 299, + 785, + 375 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Acknowledgements: This work was supported in part by funding from the NSF GRFP (Grant No. DGE2140739). This work was in part supported by the Army Research Office under MURI award W911NF20-1-0080. Any opinions, findings, conclusions, or recommendations expressed in this material are those of the authors and do not necessarily reflect the view of the Army or the US government.", + "bbox": [ + 212, + 375, + 787, + 465 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 489, + 323, + 505 + ], + "page_idx": 12 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Battrawy, R., Schuster, R., Mahani, M.A.N., Stricker, D.: RMS-FlowNet: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Clouds. In: Int. Conf. Rob. Aut. pp. 883-889. IEEE (2022) 3", + "2. Baur, S.A., Emmerichs, D.J., Moosmann, F., Pinggera, P., Ommer, B., Geiger, A.: SLIM: Self-supervised LiDAR scene flow and motion segmentation. In: Int. Conf. Comput. Vis. pp. 13126-13136 (2021) 2", + "3. Behl, A., Paschalidou, D., Donne, S., Geiger, A.: Pointflownet: Learning representations for rigid motion estimation from point clouds. In: Int. Conf. Comput. Vis. pp. 7962-7971 (2019) 3", + "4. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuScenes: A multimodal dataset for autonomous driving. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11621-11631 (2020) 3", + "5. Chodosh, N., Ramanan, D., Lucey, S.: Re-Evaluating LiDAR Scene Flow for Autonomous Driving. arXiv preprint (2023) 2, 3, 4, 7", + "6. Dewan, A., Caselitz, T., Tipaldi, G.D., Burgard, W.: Rigid scene flow for 3d lidar scans. In: Int. Conf. Intel. Rob. Sys. pp. 1765-1770. IEEE (2016) 3", + "7. Erçelik, E., Yurtsever, E., Liu, M., Yang, Z., Zhang, H., Topçam, P., Listl, M., Çaylı, Y.K., Knoll, A.: 3D Object Detection with a Self-supervised Lidar Scene Flow Backbone. In: Avidan, S., Brostow, G., Cisse, M., Farinella, G.M., Hassner, T. (eds.) Computer Vision - ECCV 2022. pp. 247-265. Springer Nature Switzerland, Cham (2022) 2", + "8. Girshick, R.: Fast R-CNN. In: 2015 IEEE International Conference on Computer Vision (ICCV). pp. 1440-1448 (2015) 19" + ], + "bbox": [ + 222, + 521, + 784, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "I Can't Believe It's Not Scene Flow!", + "bbox": [ + 488, + 114, + 730, + 127 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "9. Gojcic, Z., Litany, O., Wieser, A., Guibas, L.J., Birdal, T.: Weakly supervised learning of rigid 3d scene flow. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5692-5703 (2021) 4", + "10. Gu, X., Wang, Y., Wu, C., Lee, Y.J., Wang, P.: Hplflownet: Hierarchical permutohedral lattice flownet for scene flow estimation on large-scale point clouds. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 3254-3263 (2019) 3", + "11. Huang, X., Wang, Y., Guizilini, V.C., Ambrus, R.A., Gaidon, A., Solomon, J.: Representation Learning for Object Detection from Unlabeled Point Cloud Sequences. In: Liu, K., Kulic, D., Ichnowski, J. (eds.) Proceedings of The 6th Conference on Robot Learning (CoRL). Proceedings of Machine Learning Research, vol. 205, pp. 1277-1288 (2023) 19", + "12. Jund, P., Sweeney, C., Abdo, N., Chen, Z., Shlens, J.: Scalable Scene Flow From Point Clouds in the Real World. IEEE Robotics and Automation Letters (12 2021) 1, 2, 3, 7, 17", + "13. Kim, D., Lin, T.Y., Angelova, A., Kweon, I.S., Kuo, W.: Learning open-world object proposals without learning to classify. IEEE Robotics and Automation Letters (RA-L) (2022) 19", + "14. Kim, J., Woo, J., Shin, U., Oh, J., Im, S.: Flow4D: Leveraging 4D Voxel Network for LiDAR Scene Flow Estimation (2024), https://arxiv.org/abs/2407.07995", + "15. Kittenplon, Y., Eldar, Y.C., Raviv, D.: Flowstep3d: Model unrolling for self-supervised scene flow estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4114-4123 (2021) 3", + "16. Lang, A., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: PointPillars: Fast Encoders for Object Detection From Point Clouds. In: Proceedings of the 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 12689-12697 (2019) 3", + "17. Li, R., Lin, G., He, T., Liu, F., Shen, C.: HCRF-Flow: Scene flow from point clouds with continuous high-order CRFs and position-aware flow embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 364-373 (2021) 3", + "18. Li, X., Pontes, J.K., Lucey, S.: Neural Scene Flow Prior. Advances in Neural Information Processing Systems 34 (2021) 1, 2, 4, 7, 8", + "19. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast neural scene flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 4", + "20. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast Neural Scene Flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 17", + "21. Li, Y., Bu, R., Sun, M., Wu, W., Di, X., Chen, B.: Pointcnn: Convolution on x-transformed points. Adv. Neural Inform. Process. Syst. 31 (2018) 3", + "22. Lin, T., Goyal, P., Girshick, R.B., He, K., Dollar, P.: Focal Loss for Dense Object Detection. In: ICCV 2017. pp. 2999-3007 (2017) 4", + "23. Lin, T., Maire, M., Belongie, S.J., Bourdev, L.D., Girshick, R.B., Hays, J., Perona, P., Ramanan, D., Doll'a r, P., Zitnick, C.L.: Microsoft COCO: Common Objects in Context. CoRR (2014) 5, 6", + "24. Lin, Y., Caesar, H.: ICP-Flow: LiDAR Scene Flow Estimation with ICP (2024) 17", + "25. Liu, X., Qi, C.R., Guibas, L.J.: FlowNet3D: Learning Scene Flow in 3D Point Clouds. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2019) 2, 3" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 13 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "26. Liu, Z., Tang, H., Amini, A., Yang, X., Mao, H., Rus, D., Han, S.: Bevfusion: Multi-task multi-sensor fusion with unified bird's-eye view representation. In: IEEE International Conference on Robotics and Automation (ICRA) (2023) 9", + "27. Ma, Y., Peri, N., Wei, S., Hua, W., Ramanan, D., Li, Y., Kong, S.: Long-tailed 3d detection via 2d late fusion. arXiv preprint arXiv:2312.10986 (2023) 4", + "28. Mayer, N., Ilg, E., Häusser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A Large Dataset to Train Convolutional Networks for Disparity, Optical Flow, and Scene Flow Estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 3", + "29. Menze, M., Heipke, C., Geiger, A.: Joint 3D Estimation of Vehicles and Scene Flow. In: ISPRS Workshop on Image Sequence Analysis (ISA) (2015) 3", + "30. Menze, M., Heipke, C., Geiger, A.: Object Scene Flow. ISPRS Journal of Photogrammetry and Remote Sensing (JPRS) (2018) 3", + "31. Mittal, H., Okorn, B., Held, D.: Just Go With the Flow: Self-Supervised Scene Flow Estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. (June 2020) 4", + "32. Najibi, M., Ji, J., Zhou, Y., Qi, C.R., Yan, X., Ettinger, S., Anguelov, D.: Motion Inspired Unsupervised Perception and Prediction in Autonomous Driving. European Conference on Computer Vision (ECCV) (2022) 2", + "33. Peri, N., Dave, A., Ramanan, D., Kong, S.: Towards Long Tailed 3D Detection. CoRL (2022) 4, 6, 9", + "34. Peri, N., Li, M., Wilson, B., Wang, Y.X., Hays, J., Ramanan, D.: An empirical analysis of range for 3d object detection. arXiv preprint arXiv:2308.04054 (2023) 6, 9", + "35. Peri, N., Luiten, J., Li, M., Osep, A., Leal-Taixe, L., Ramanan, D.: Forecasting from lidar via future object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17202-17211 (June 2022) 6, 9", + "36. Pontes, J.K., Hays, J., Lucey, S.: Scene flow from point clouds with or without learning. In: Int. Conf. 3D Vis. pp. 261-270. IEEE (2020) 4", + "37. Puy, G., Boulch, A., Marlet, R.: Flot: Scene flow on point clouds guided by optimal transport. In: Eur. Conf. Comput. Vis. pp. 527-544. Springer (2020) 3", + "38. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I.: Improving language understanding by generative pre-training (2018) 3", + "39. Ren, S., He, K., Girshick, R., Sun, J.: Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(6), 1137-1149 (2017) 19", + "40. Sun, P., Kretzschmar, H., Dotiwalla, X., Chouard, A., Patnaik, V., Tsui, P., Guo, J., Zhou, Y., Chai, Y., Caine, B., Vasudevan, V., Han, W., Ngiam, J., Zhao, H., Timofeev, A., Ettinger, S., Krivokon, M., Gao, A., Joshi, A., Zhang, Y., Shlens, J., Chen, Z., Anguelov, D.: Scalability in Perception for Autonomous Driving: Waymo Open Dataset. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020) 3", + "41. Tishchenko, I., Lombardi, S., Oswald, M.R., Pollefeys, M.: Self-supervised learning of non-rigid residual flow and ego-motion. In: Int. Conf. 3D Vis. pp. 150-159. IEEE (2020) 3", + "42. Vedder, K., Peri, N., Chodosh, N., Khatri, I., Eaton, E., Jayaraman, D., Liu, Y., Ramanan, D., Hays, J.: ZeroFlow: Scalable Scene Flow via Distillation. In: Twelfth International Conference on Learning Representations (ICLR) (2024) 1, 2, 3, 4, 7, 8, 17", + "43. Vedula, S., Baker, S., Rander, P., Collins, R., Kanade, T.: Three-dimensional scene flow. In: Int. Conf. Comput. Vis. vol. 2, pp. 722-729. IEEE (1999) 2" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "I Can't Believe It's Not Scene Flow!", + "bbox": [ + 488, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "44. Vora, S., Lang, A.H., Helou, B., Beijbom, O.: Pointpainting: Sequential fusion for 3d object detection. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4604-4612 (2020) 4", + "45. Wang, J., Li, X., Sullivan, A., Abbott, L., Chen, S.: PointMotionNet: PointWise Motion Learning for Large-Scale LiDAR Point Clouds Sequences. In: 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 4418-4427 (2022) 3", + "46. Wang, Z., Chen, F., Lertniphonphan, K., Chen, S., Bao, J., Zheng, P., Zhang, J., Huang, K., Zhang, T.: Technical report for argoverse challenges on unified sensor-based detection, tracking, and forecasting (2023) 2, 6, 9", + "47. Weng, X., Wang, J., Held, D., Kitani, K.: 3D Multi-Object Tracking: A Baseline and New Evaluation Metrics. IROS (2020) 2, 4, 6", + "48. Weng, X., Wang, J., Levine, S., Kitani, K., Rhinehart, N.: Inverting the pose forecasting pipeline with spf2: Sequential pointcloud forecasting for sequential pose forecasting. In: Conference on robot learning. pp. 11-20. PMLR (2021) 3", + "49. Wilson, B., Qi, W., Agarwal, T., Lambert, J., Singh, J., Khandelwal, S., Pan, B., Kumar, R., Hartnett, A., Pontes, J.K., Ramanan, D., Carr, P., Hays, J.: Argoverse 2: Next Generation Datasets for Self-driving Perception and Forecasting. In: Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks (NeurIPS Datasets and Benchmarks 2021) (2021) 3, 7", + "50. Wu, W., Wang, Z.Y., Li, Z., Liu, W., Fuxin, L.: Pointpwc-net: Cost volume on point clouds for (self-) supervised scene flow estimation. In: Eur. Conf. Comput. Vis. pp. 88-107. Springer (2020) 3", + "51. Yang, J., Zeng, A., Zhang, R., Zhang, L.: UniPose: Detection Any Keypoints. arXiv preprint arXiv:2310.08530 (2023) 19", + "52. Zhai, G., Kong, X., Cui, J., Liu, Y., Yang, Z.: FlowMOT: 3D Multi-Object Tracking by Scene Flow Association. ArXiv abs/2012.07541 (2020) 2", + "53. Zhang, Q., Yang, Y., Fang, H., Geng, R., Jensfelt, P.: DeFlow: Decoder of Scene Flow Network in Autonomous Driving. ICRA (2024) 1, 2, 3, 7, 8, 17", + "54. Zhang, Q., Yang, Y., Li, P., Andersson, O., Jensfelt, P.: Seflow: A self-supervised scene flow method in autonomous driving. arXiv preprint arXiv:2407.01702 (2024) 17", + "55. Zheng, Y., Harley, A.W., Shen, B., Wetzstein, G., Guibas, L.J.: PointOdyssey: A Large-Scale Synthetic Dataset for Long-Term Point Tracking. In: ICCV (2023) 3", + "56. Zhu, B., Jiang, Z., Zhou, X., Li, Z., Yu, G.: Class-balanced Grouping and Sampling for Point Cloud 3D Object Detection. arXiv preprint arXiv:1908.09492 (2019) 2, 4, 7" + ], + "bbox": [ + 215, + 146, + 785, + 657 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "I. Khatri et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_model.json b/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_model.json new file mode 100644 index 0000000000000000000000000000000000000000..ab282992d43a9a149a5fdf4ff61673d2dfa33c04 --- /dev/null +++ b/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_model.json @@ -0,0 +1,2388 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.294, + 0.143, + 0.71, + 0.161 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.189, + 0.782, + 0.207 + ], + "angle": 0, + "content": "Ishan Khatri\\(^{1,3*}\\), Kyle Vedder\\(^{2*}\\), Neehar Peri\\(^{3}\\), Deva Ramanan\\(^{3}\\), James Hays\\(^{4}\\)" + }, + { + "type": "text", + "bbox": [ + 0.291, + 0.216, + 0.713, + 0.233 + ], + "angle": 0, + "content": "1Stack AV, 2University of Pennsylvania, 3CMU, 4Georgia Tech" + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.264, + 0.385, + 0.359 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.265, + 0.377, + 0.372, + 0.39 + ], + "angle": 0, + "content": "(a) Ground Truth" + }, + { + "type": "image", + "bbox": [ + 0.429, + 0.265, + 0.563, + 0.358 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.44, + 0.377, + 0.56, + 0.39 + ], + "angle": 0, + "content": "(b) FastFlow3D [12]" + }, + { + "type": "image", + "bbox": [ + 0.614, + 0.265, + 0.75, + 0.358 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.639, + 0.377, + 0.732, + 0.39 + ], + "angle": 0, + "content": "(c) DeFlow [53]" + }, + { + "type": "image", + "bbox": [ + 0.249, + 0.405, + 0.385, + 0.497 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.279, + 0.517, + 0.364, + 0.529 + ], + "angle": 0, + "content": "(d) NSFP [18]" + }, + { + "type": "image", + "bbox": [ + 0.429, + 0.405, + 0.565, + 0.497 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.431, + 0.517, + 0.573, + 0.529 + ], + "angle": 0, + "content": "(e) ZeroFlow XL 5x [42]" + }, + { + "type": "image", + "bbox": [ + 0.612, + 0.405, + 0.747, + 0.497 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.614, + 0.517, + 0.752, + 0.529 + ], + "angle": 0, + "content": "(f) TrackFlow (Ours)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.541, + 0.788, + 0.61 + ], + "angle": 0, + "content": "Fig. 1: We visualize an example of two pedestrians (walking from left to right), cherry-picked to have unusually high density lidar returns, making it particularly easy to estimate flow. We expect that state-of-the-art scene flow methods should work well in this case, but find that all prior art fails catastrophically. Notably, TrackFlow is the only method to estimate flow for these pedestrians." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.62, + 0.741, + 0.813 + ], + "angle": 0, + "content": "Abstract. State-of-the-art scene flow methods broadly fail to describe the motion of small objects, and existing evaluation protocols hide this failure by averaging over many points. To address this limitation, we propose Bucket Normalized EPE, a new class-aware and speed-normalized evaluation protocol that better contextualizes error comparisons between object types that move at vastly different speeds. In addition, we propose TrackFlow, a frustratingly simple supervised scene flow baseline that combines a high-quality 3D object detector (trained using standard class re-balancing techniques) with a simple Kalman filter-based tracker. Notably, TrackFlow achieves state-of-the-art performance on existing metrics and shows large improvements over prior work on our proposed metric. Our results highlight that scene flow evaluation must be class and speed aware, and supervised scene flow methods must address point-level class imbalances. Our evaluation toolkit and code is available on GitHub." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.826, + 0.632, + 0.84 + ], + "angle": 0, + "content": "Keywords: LiDAR Scene Flow, Autonomous Vehicles" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.377, + 0.162 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.784, + 0.252 + ], + "angle": 0, + "content": "Scene flow estimation is the task of describing a 3D motion field between temporally successive point clouds [2, 7, 12, 25, 42, 43, 52]. In theory, high quality flow estimators can provide a valuable signal about scene-level dynamics [12, 42] for both online [52] and offline [32] processing. Do state-of-the-art scene flow methods actually work well in practice?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.785, + 0.372 + ], + "angle": 0, + "content": "Status Quo. Standard scene flow metrics suggest that existing methods can estimate motion to centimeter-level accuracy. For example, ZeroFlow XL 5x [42] achieves an average Threeway EPE [5] of only 4.9 centimeters (1.9 inches) and a Dynamic EPE (averaged over points moving faster than \\(0.5\\mathrm{m / s}\\)) of 11.7 centimeters (4.6 inches). Notably, these errors are relatively small compared to the scale of cars and pedestrians, implying that current scene flow methods produce high quality flow. On the scale of cars and people, these feel like tiny errors and seem to imply that current scene flow methods are high quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.373, + 0.787, + 0.629 + ], + "angle": 0, + "content": "Bucket Normalized EPE. We visualize flow predictions from several state-of-the-art supervised (FastFlow3D [12], DeFlow [53]) and unsupervised (NSFP [18 ZeroFlow [42]) approaches and find that all methods underestimate flow for small objects (Fig. 1) with fewer lidar points (e.g. pedestrians and bicyclists). Surprisingly, existing scene flow metrics do not highlight such failure cases on these safety-critical categories because small objects only make up a tiny fraction of the dynamic points in a scene (Fig. 2). To address this limitation, we propose Bucket Normalized EPE, a new evaluation protocol that allows us to directly measure performance disparities across classes of different sizes and speed profiles. Specifically, Bucket Normalized EPE evaluates the percentage of described motion, allowing us to normalize comparisons between objects moving at different speeds. Our proposed evaluation metric takes inspiration from mean Average Precision (mAP), a metric commonly used to evaluate object detectors. Notably, unlike existing scene flow metrics, mAP equally weights the performance of large common objects like cars and small rare objects like strollers. Therefore, state-of-the-art 3D object detectors use data augmentation and class re-balancing techniques [56] to perform well on both common and rare classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.788, + 0.841 + ], + "angle": 0, + "content": "TrackFlow. Based on this observation, we propose TrackFlow, a frustratingly simple baseline that generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track. Specifically, we run a state-of-the-art 3D object detector [46] followed by a simple 3D Kalman filter-based tracker [47] to generate object trajectories. Despite its simplicity, TrackFlow achieves state-of-the-art performance on Threeway EPE and significantly outperforms prior art on our Bucket Normalized EPE metric, capturing an additional \\(10\\%\\) of total motion in general and an additional \\(20\\%\\) of total motion on pedestrians (a \\(1.5 \\times\\) improvement). Importantly, our simple baseline's state-of-the-art performance is an indictment of existing supervised scene flow methods. We argue that utilizing (well established) class re-balancing techniques can improve performance on rare safety-critical categories in real-world datasets, and evaluating scene flow methods using class and speed-aware metrics more closely reflects real-world performance." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.489, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.147, + 0.654, + 0.162 + ], + "angle": 0, + "content": "Contributions. We present three primary contributions." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.172, + 0.784, + 0.2 + ], + "angle": 0, + "content": "1. We highlight the qualitative failure of state-of-the-art scene flow methods on safety-critical categories like pedestrians and bicycles." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.203, + 0.784, + 0.231 + ], + "angle": 0, + "content": "2. We introduce Bucket Normalized EPE, a new evaluation protocol that allows us to quantify this qualitative failure on small objects." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.233, + 0.784, + 0.275 + ], + "angle": 0, + "content": "3. We propose TrackFlow, a frustratingly simple baseline that achieves state-of-the-art performance on standard metrics and significantly outperforms prior art on our class-aware Bucket Normalized EPE metric." + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.172, + 0.784, + 0.275 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.302, + 0.388, + 0.318 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.334, + 0.591, + 0.348 + ], + "angle": 0, + "content": "2.1 Scene Flow Datasets and Ground Truth" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.359, + 0.785, + 0.495 + ], + "angle": 0, + "content": "Unlike next token prediction in language [38] or next frame prediction in vision [48], scene flow is not naively self-supervised: future observations do not provide ground truth scene flow. Therefore, ground truth motion descriptions must be provided by an oracle, typically from human annotators for real data [4, 29, 30, 40, 49] or a data generator for synthetic datasets [28, 55]. For real world datasets (typically from the autonomous vehicle domain) human annotations are provided in the form of 3D bounding boxes and tracks for every object in the scene [5]. Consequently, the generated ground truth flow is assumed to be rigid, even in the case of non-rigid motion like pedestrian gaits." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.518, + 0.451, + 0.532 + ], + "angle": 0, + "content": "2.2 Scene Flow Estimation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.543, + 0.784, + 0.605 + ], + "angle": 0, + "content": "Given point clouds \\( P_{t} \\) and \\( P_{t + 1} \\), scene flow estimators predict \\( \\hat{F}_{t,t + 1} \\), a 3D vector per point in \\( P_{t} \\) that describes its motion from \\( t \\) to \\( t + 1 \\) [6]. Performance is typically measured using Average Endpoint Error (EPE) which is the \\( L_{2} \\) norm between the predicted \\( (\\hat{F}_{t,t + 1}) \\) and ground truth flow \\( (F_{t,t + 1}^{*}) \\), as in Equation 1." + }, + { + "type": "equation", + "bbox": [ + 0.315, + 0.614, + 0.785, + 0.647 + ], + "angle": 0, + "content": "\\[\n\\text {A v e r a g e} (P _ {t}) = \\frac {1}{\\| P _ {t} \\|} \\sum_ {p \\in P _ {t}} \\left\\| \\hat {F} _ {t, t + 1} (p) - F _ {t, t + 1} ^ {*} (p) \\right\\| _ {2}. \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.651, + 0.784, + 0.681 + ], + "angle": 0, + "content": "Current state-of-the-art methods for scene flow estimation broadly fall into one of two categories: supervised and unsupervised." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Supervised Scene Flow methods train feedforward networks to perform flow vector regression based on ground truth annotations [1,3,10,12,15,17,21,25,37, 41, 45, 50, 53]. Many of these networks utilize custom point operations such as point-based convolutions [10, 15, 21, 25], making them intractable to train on large point clouds. In contrast, FastFlow3D [12] uses a feedforward architecture based on PointPillars [16], an efficient lidar detector architecture, to train and predict flow on real-world large-scale point clouds. FastFlow3D's speed and quality make it a popular base architecture for both unsupervised and supervised methods like ZeroFlow [42] and DeFlow [53], respectively." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "Unsupervised Scene Flow methods tend to use online optimization against surrogate objectives such as Chamfer distance [18], cycle-consistency [31], distance transforms [19], or other hand-designed heuristics [5, 9, 36]. For example, Neural Scene Flow Prior (NSFP) [18] provides high quality scene flow estimates by optimizing a small ReLU MLP at test time to minimize Chamfer distance and maintain cycle-consistency. Other unsupervised methods like ZeroFlow [42] indirectly leverage online optimization. Vedder et. al [42] introduces Scene Flow via Distillation, a framework that uses a slow optimization-based method to pseudolabel unlabeled point cloud pairs and trains a fast feedforward network with these pseudolabels." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.32, + 0.517, + 0.334 + ], + "angle": 0, + "content": "2.3 Scene Flow Evaluation Metrics" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.345, + 0.788, + 0.466 + ], + "angle": 0, + "content": "In real-world scenes, most points belong to the static background. Consequently, simply computing Average EPE (Equation 1) over all points is dominated by background points. In order to separately measure non-ego dynamics, Chodosh et al. [5] introduces Threeway EPE, which computes a mean over the Average EPE for three disjoint classes of points: Foreground Dynamic (points inside bounding box labels moving greater than \\(0.5\\mathrm{m / s}\\)), Foreground Static (points inside bounding box labels moving less than \\(0.5\\mathrm{m / s}\\)), and Background Static. We extend Threeway EPE to consider different class and speed profiles." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.487, + 0.547, + 0.503 + ], + "angle": 0, + "content": "2.4 3D Object Detection and Tracking" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.512, + 0.816, + 0.693 + ], + "angle": 0, + "content": "Object detectors have advanced techniques for training with imbalanced datasets. Notably, modern object detectors use carefully designed losses to mitigate foreground-vs-background imbalances in proposal generation, and data augmentation strategies to train with long-tailed taxonomies. Existing methods address imbalanced foreground-vs-background region proposals using Focal Loss [22] to upweight the importance of foreground regions. More recently, 3D object detectors use class-balanced sampling [56] and copy-paste augmentation to upsample and rebalance the distribution of examples per class. In addition, state-of-the-art 3D object detectors take advantage of multi-modal data to improve detection [27,33,44] of small and rare categories. Since many state-of-the-art tracking algorithms [47] follow the tracking-by-detection paradigm, improving detection quality also significantly improves tracking performance." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.715, + 0.731, + 0.75 + ], + "angle": 0, + "content": "3 Bucket Normalized EPE: Small Objects (Should) Matter in Scene Flow" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "As shown in Fig. 1 (and further in Fig. 8), existing scene flow methods consistently struggle to describe the motion of safety-critical objects like pedestrians. However, these failures are not captured by Threeway EPE because these objects are small and have few points. Specifically, Threeway EPE's Foreground Dynamic category is dominated by large, common objects with many points like" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.489, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.249, + 0.143, + 0.756, + 0.32 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.331, + 0.788, + 0.388 + ], + "angle": 0, + "content": "Fig. 2: Number of points from each semantic meta-class for Argoverse 2's val split. Although PEDESTRIAN instances are common, they contribute less than \\(1\\%\\) of the total number of points owing to their small instance size relative to CAR and OTHER VEHICLES. Number of points (Y axis) shown on a log scale." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.418, + 0.784, + 0.461 + ], + "angle": 0, + "content": "cars and other vehicles. As shown in Fig. 2, \\(15\\%\\) of all points are from cars or other vehicles (dominating Foreground Dynamic's Average EPE), while fewer than \\(1\\%\\) of points are from pedestrians and other vulnerable road users (VRUs)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.785, + 0.538 + ], + "angle": 0, + "content": "Additionally, Threeway EPE fails to account for large differences in speed across objects. For example, a \\(0.5\\mathrm{m / s}\\) estimation error on a car moving \\(20\\mathrm{m / s}\\) is negligible \\((< 2.5\\%)\\), while a \\(0.5\\mathrm{m / s}\\) estimation error on a pedestrian moving \\(0.5\\mathrm{m / s}\\) fails to describe \\(100\\%\\) of the pedestrian's motion. However, Threeway EPE treats both estimation errors equally." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.539, + 0.785, + 0.644 + ], + "angle": 0, + "content": "We address these two limitations with our Bucket Normalized EPE metric. First, our proposed metric breaks down the object distribution using a taxonomy that human labelers have deemed important (similar to mean Average Precision [23], see Appendix C for discussion on semantics-free evaluation). Second, our proposed metric allows us to contextualize the percentage of object motion being described by normalizing for the speed of the object, allowing us to directly compare performance across object categories." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.646, + 0.785, + 0.705 + ], + "angle": 0, + "content": "We implement our class-aware and speed-normalized metric by accumulating every point into a class-speed matrix (e.g. Appendix B, Table 4) based on its ground truth speed and class, recording an Average EPE as well as a per-bucket average speed. To summarize these results, we report two numbers per class:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.719, + 0.784, + 0.748 + ], + "angle": 0, + "content": "- Static EPE, taken directly from the Average EPE of the first speed bucket for that class (i.e. the first column of Appendix B, Table 4)" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.75, + 0.785, + 0.796 + ], + "angle": 0, + "content": "- Dynamic Normalized EPE, computed from a mean over the Normalized EPE \\(\\left(\\frac{\\text{Average EPE}}{\\text{average speed}}\\right)\\) of each non-empty speed bucket (i.e. an average across the Normalized EPEs of the second column onwards in Appendix B, Table 4)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.719, + 0.785, + 0.796 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Dynamic Normalized EPE measures the fraction of motion not described by the estimated flow vectors across the entire speed spectrum. A method that only" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "table", + "bbox": [ + 0.245, + 0.144, + 0.754, + 0.243 + ], + "angle": 0, + "content": "
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND0.002402-
CAR0.0184420.182092
OTHER VEHICLES0.0814750.312882
PEDESTRIAN0.0528420.396849
WHEELED VRU0.0625730.257647
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.344 + ], + "angle": 0, + "content": "Table 1: TrackFlow's Bucket Normalized EPE on the Argoverse 2 test split. Similar to Threeway EPE, we breakdown our evaluation into static and dynamic buckets. However, we also further breakdown performance by meta-categories and normalize by speed to compare performance disparities on safety-critical categories. TrackFlow is able to capture most dynamic car motion (lower is better), but performs considerably worse on other vehicles and pedestrian." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.384, + 0.788, + 0.534 + ], + "angle": 0, + "content": "predicts ego motion (e.g. \\(\\vec{0}\\) after ego-motion compensation) will achieve 1.0 Dynamic Normalized EPE, and a method that perfectly describes all motion will have 0.0 Dynamic Normalized EPE. Methods may achieve errors greater than 1.0 by predicting errors with a magnitude greater than the average speed. For example, a method that describes the negative vector of true motion will get exactly 2.0 Dynamic Normalized EPE (every bucket's Average EPE will be exactly \\(2\\times\\) the magnitude of the average speed). The range of Dynamic Normalized EPE is between 0 (perfect) and \\(\\infty\\), and is undefined for buckets without any points. After normalization, Dynamic Normalized EPE can be directly compared across classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.537, + 0.788, + 0.629 + ], + "angle": 0, + "content": "We provide an example per-class performance breakdown in Table 1 for TrackFlow (Section 4). Results can be further summarized into a single tuple of mean Static EPE and mean Dynamic Normalized EPE by taking a mean across classes (similar to mean Average Precision [23]). TrackFlow has a mean Static EPE of 0.076277 and a mean Dynamic Normalized EPE of 0.287368. We rank methods according to their mean Dynamic Normalized EPE." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.651, + 0.605, + 0.671 + ], + "angle": 0, + "content": "4 TrackFlow: Scene Flow via Tracking" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.684, + 0.788, + 0.806 + ], + "angle": 0, + "content": "To highlight the failure of current supervised scene flow methods on smaller objects, we propose Scene Flow via Tracking, a simple framework that uses bounding box track motion from off-the-shelf 3D detectors and trackers to generate scene flow estimates (Fig. 3). We instantiate Scene Flow via Tracking with LE3DE2E [46]\\(^1\\), a state-of-the-art 3D detector, and AB3DMOT [47], a Kalman filter-based 3D tracker. As shown in Section 5, TrackFlow achieves state-of-the-art performance on Threeway EPE and beats all prior art by a large margin on Bucket Normalized EPE." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "\\(^{1}\\) LE3DE2E [46] is the winning method from the Argoverse 2 2023 3D Detection, Tracking and Forecasting challenge [33-35]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.489, + 0.115, + 0.733, + 0.128 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.143, + 0.788, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.289, + 0.788, + 0.331 + ], + "angle": 0, + "content": "Fig. 3: Overview of the Scene Flow via Tracking framework. Our proposed framework generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.359, + 0.788, + 0.51 + ], + "angle": 0, + "content": "Scene Flow via Tracking works well in practice because it mimics the ground truth flow annotation process. Specifically, ground truth flow is generated using rigid transforms to describe point-level motion within ground truth 3D object tracks (Section 2.1). Therefore, a perfect 3D detector and tracker will achieve perfect flow. However, the power of TrackFlow isn't just derived from its use of bounding boxes; it also greatly benefits from recent advances in class-imbalanced learning [56]. As discussed in Section 2.4, modern detectors are trained with a variety of data augmentation techniques to achieve high precision and recall on all semantic class. TrackFlow leverages the strength of modern 3D detectors to significantly outperform prior art on pedestrians and other small objects." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.511, + 0.788, + 0.631 + ], + "angle": 0, + "content": "Interestingly, we find that the Scene Flow via Tracking framework performs best when using detectors tuned to a low confidence threshold. Typically, detectors are optimized to only predict high confidence boxes (0.7 - 0.9) to minimize the number of false positives. However, our method works best when setting the confidence threshold lower (0.2 for TrackFlow) to increase recall. Specifically, we find that detectors with higher recall and more accurate heading estimation are better suited for Scene Flow via Tracking. We explore detector choice and ablate the impact of confidence thresholds further in Section 5.3." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.653, + 0.377, + 0.671 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.683, + 0.787, + 0.73 + ], + "angle": 0, + "content": "In this section, we compare TrackFlow against state-of-the-art supervised and unsupervised scene flow methods like FastFlow3D [12], DeFlow [53], NSFP [18], and ZeroFlow [42] on the Argoverse 2 benchmark \\([49]^2\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.75, + 0.75, + 0.765 + ], + "angle": 0, + "content": "5.1 TrackFlow Achieves SOTA Performance on Threeway EPE" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.772, + 0.787, + 0.806 + ], + "angle": 0, + "content": "TrackFlow is state-of-the-art on Threeway EPE (Fig. 4a) on the Argoverse 2 benchmark [49], achieving an overall reduction of \\(0.0015\\mathrm{m}\\) (\\(0.15\\mathrm{cm}\\), or \\(1.5\\mathrm{mm}\\))" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.787, + 0.842 + ], + "angle": 0, + "content": "2 All evaluations are performed with a maximum radius of \\(35\\mathrm{m}\\) from the ego vehicle to maintain consistency with Chodosh et al. [5]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.144, + 0.499, + 0.341 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.307, + 0.342, + 0.42, + 0.355 + ], + "angle": 0, + "content": "(a) Threeway EPE" + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.143, + 0.78, + 0.341 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.516, + 0.342, + 0.766, + 0.356 + ], + "angle": 0, + "content": "(b) Threeway EPE's Foreground Dynamic" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.366, + 0.788, + 0.45 + ], + "angle": 0, + "content": "Fig. 4: Threeway EPE and Threeway EPE's Foreground Dynamic performance of recent supervised and unsupervised scene flow methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color is consistent between plots. We find that all recent methods achieve \\(5\\mathrm{cm}\\) error on Threeway EPE, suggesting that these approaches work well in-the-wild. However, this number hides the failure of these methods to describe small object motion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.481, + 0.789, + 0.527 + ], + "angle": 0, + "content": "over the next best method, ZeroFlow XL 5x. Notably, this improvement can be attributed to significantly better Threeway EPE's Dynamic Foreground (Fig. 4b). Is this performance difference meaningful?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.528, + 0.79, + 0.634 + ], + "angle": 0, + "content": "Based on our reduction of \\(1.5\\mathrm{mm}\\) on Threeway EPE (about \\(4\\times\\) the thickness of a human fingernail), it would seem that TrackFlow is only an incremental improvement over prior art. However, TrackFlow qualitatively outperforms prior work on important small objects such as pedestrians (Fig. 1, Fig. 8). As shown in the next section, our proposed evaluation protocol Bucket Normalized EPE makes it quantitatively clear that TrackFlow performs significantly better on safety-critical categories like pedestrians and VRUs." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.66, + 0.773, + 0.677 + ], + "angle": 0, + "content": "5.2 Bucket Normalized EPE Highlights Failures on Small Objects" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.79, + 0.841 + ], + "angle": 0, + "content": "Evaluating existing state-of-the-art methods on our class-aware, speed-normalized evaluation, Bucket Normalized EPE, makes it clear that TrackFlow meaningfully outperforms prior art (Fig. 6) — TrackFlow correctly describes almost \\(10\\%\\) additional total motion across meta-classes compared to DeFlow [53]. This difference in dynamic performance becomes even more clear when broken down by meta-class: Fig. 5 shows that TrackFlow is the only method able to describe more than \\(50\\%\\) of pedestrian motion, beating DeFlow [53] by more than \\(20\\%\\) (Fig. 5c), a \\(1.5 \\times\\) improvement. Similarly, other state-of-the-art methods like NSFP [18] and ZeroFlow XL 5x [42] describe less than \\(30\\%\\) and \\(20\\%\\) of pedestrian motion, respectively." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.489, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.143, + 0.501, + 0.261 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.343, + 0.264, + 0.386, + 0.276 + ], + "angle": 0, + "content": "(a) CAR" + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.143, + 0.77, + 0.262 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.586, + 0.264, + 0.697, + 0.276 + ], + "angle": 0, + "content": "(b) OTHER VEHICLES" + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.275, + 0.5, + 0.393 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.321, + 0.396, + 0.407, + 0.407 + ], + "angle": 0, + "content": "(c) PEDESTRIAN" + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.275, + 0.771, + 0.393 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.595, + 0.395, + 0.688, + 0.408 + ], + "angle": 0, + "content": "(d) WHEELLED VRU" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.419, + 0.788, + 0.504 + ], + "angle": 0, + "content": "Fig. 5: Per meta-class Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color and position is consistent between plots. TrackFlow significantly improves over prior work on both pedestrian and wheeled VRUs. Notably, Bucket Normalized EPE quantitatively demonstrates significant method performance differences not highlighted in Threeway EPE." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.531, + 0.788, + 0.607 + ], + "angle": 0, + "content": "Bucket Normalized EPE allows practitioners to effectively compare performance between methods that were almost indistinguishable under Threeway EPE. For example, if you only care about flow performance on cars, DeFlow out-performs all other methods including TrackFlow (Fig. 5a), while ZeroFlow XL 5x out-performs all other methods on larger vehicles (Fig. 5b)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.628, + 0.642, + 0.643 + ], + "angle": 0, + "content": "5.3 What Makes a Good Detector for TrackFlow?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.652, + 0.787, + 0.681 + ], + "angle": 0, + "content": "As discussed in Section 4, we tune Scene Flow via Tracking with a low confidence threshold to maximize recall. What makes a good detector for TrackFlow?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.682, + 0.788, + 0.758 + ], + "angle": 0, + "content": "We ablate the impact of detector quality on TrackFlow by replacing LE3DE2E [46] with BEVFusion [26]. We call this new approach TrackFlowBEVF. BEVFusion only has \\(2\\%\\) lower mAP than LE3DE2E on the AV2 detection leaderboard3, but we find that TrackFlowBEVF performs significantly worse than TrackFlow, with \\(10\\%\\) to \\(22\\%\\) drops in performance on Dynamic Normalized EPE (Table 2)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.758, + 0.788, + 0.804 + ], + "angle": 0, + "content": "This significant degradation is the result of BEVFusion's poor recall at low confidence thresholds (Table 3). In contrast, LE3DE2E has very high recall at low thresholds (Fig. 7), producing many candidate boxes for pedestrians in the" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.81, + 0.789, + 0.842 + ], + "angle": 0, + "content": "\\(^{3}\\) BEVFusion [26] was second on the Argoverse 2 2023 3D Detection, Tracking and Forecasting challenge [33-35]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.144, + 0.78, + 0.392 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.403, + 0.788, + 0.473 + ], + "angle": 0, + "content": "Fig. 6: Average Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Our simple baseline achieves state-of-the-art performance, suggesting that supervised scene flow methods should embrace point-level class rebalancing." + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.493, + 0.779, + 0.716 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.73, + 0.788, + 0.788 + ], + "angle": 0, + "content": "Fig. 7: A qualitative comparison of the recall of BEVFusion and LE3DE2E. LE3DE2E has much higher recall, allowing it to pick out pedestrians BEVFusion missed (circled in red), and better quality box heading estimates. Both detectors are using a confidence threshold of 0.2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.793, + 0.788, + 0.84 + ], + "angle": 0, + "content": "scene. BEVFusion's false negatives are extremely costly to TrackFlowBEVF, as they result in \\(\\vec{0}\\) flow estimates that miss \\(100\\%\\) of each false positive pedestrian's motion." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.49, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table", + "bbox": [ + 0.245, + 0.144, + 0.754, + 0.244 + ], + "angle": 0, + "content": "
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND-0.000228-
CAR+0.039049+0.117944
OTHER VEHICLES+0.009013+0.224830
PEDESTRIAN+0.007187+0.224250
WHEELED VRU-0.025889+0.151373
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.342 + ], + "angle": 0, + "content": "Table 2: Relative Bucket Normalized EPE performance of TrackFlowBEVF compared to TrackFlow, on the Argoverse 2's test split. Increases in error (worse) are shown with a + in red, and decreases in error (better) are shown with a - in green. TrackFlow's absolute results are shown in Table 1.BEVFusion only has \\(2\\%\\) lower mAP than LE3DE2E on the AV2 detection leaderboard, but performs significantly worse than TrackFlow on Dynamic Normalized EPE." + }, + { + "type": "table", + "bbox": [ + 0.266, + 0.368, + 0.734, + 0.442 + ], + "angle": 0, + "content": "
ConfidenceMean Dynamic Norm EPE
0.10.4816
0.20.4643
0.30.6008
0.40.8176
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.457, + 0.788, + 0.501 + ], + "angle": 0, + "content": "Table 3: Mean Dynamic Bucketed EPE values for TrackFlowBEVF using various confidence thresholds for the detector. Lower confidence with higher recall significantly improve Dynamic Norm EPE performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.543, + 0.788, + 0.634 + ], + "angle": 0, + "content": "More broadly, a good detector for Scene Flow via Tracking isn't necessarily one with a high mAP; it's one with very high recall and accurate heading estimates. Notably, these error characteristics enable the tracker to reject false positives. We believe this interaction between the detector and tracker is an important yet subtle point — two detectors may have the same mAP, but dramatically different performance in our Scene Flow via Tracking framework." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.657, + 0.36, + 0.673 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.841 + ], + "angle": 0, + "content": "In this work, we highlight that current scene flow methods consistently fail to describe motion on pedestrians and other small objects. We demonstrate that current standard evaluation metrics hide this failure and present Bucket Normalized EPE, a new class-aware, speed normalized evaluation protocol, to quantify this failure. In addition, we present TrackFlow, a frustratingly simple supervised scene flow baseline that achieves state-of-the-art on Threeway EPE and Bucket Normalized EPE. We argue that current evaluation protocols fail to reveal performance across the distribution of safety-critical objects, and do not contextualize absolute errors in the context of an object's speed. Moreover, we highlight that class and speed aware evaluation is important even if a method has zero human" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.143, + 0.785, + 0.503 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.224, + 0.516, + 0.404, + 0.529 + ], + "angle": 0, + "content": "(a) Ground Truth (b) FastFlow3D" + }, + { + "type": "image_caption", + "bbox": [ + 0.427, + 0.517, + 0.488, + 0.529 + ], + "angle": 0, + "content": "(c) DeFlow" + }, + { + "type": "image_caption", + "bbox": [ + 0.525, + 0.517, + 0.58, + 0.528 + ], + "angle": 0, + "content": "(d) NSFP" + }, + { + "type": "image_caption", + "bbox": [ + 0.608, + 0.517, + 0.678, + 0.528 + ], + "angle": 0, + "content": "(e) ZeroFlow" + }, + { + "type": "image_caption", + "bbox": [ + 0.694, + 0.517, + 0.774, + 0.528 + ], + "angle": 0, + "content": "(f) TrackFlow" + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.539, + 0.785, + 0.567 + ], + "angle": 0, + "content": "Fig. 8: Visualizations of different methods on diverse scenes in Argoverse 2. Each method is estimating flow from the blue to the green point cloud." + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.577, + 0.785, + 0.604 + ], + "angle": 0, + "content": "Row 1: Two pedestrians in left foreground with cars moving in the background. Track-Flow is the only method able to describe the pedestrian motion." + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.605, + 0.785, + 0.659 + ], + "angle": 0, + "content": "Row 2: Three pedestrians walking across an intersection in front of a stationary car. DeFlow is able to capture the furthest pedestrian, but only TrackFlow is able to capture the motion of all three. TrackFlow also falsely estimates motion of the moving box truck in the background." + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.66, + 0.785, + 0.701 + ], + "angle": 0, + "content": "Row 3: Top view of pedestrians walking down the sidewalk between a building and several cars parked in the street. TrackFlow is the only method able to describe the pedestrian motion." + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.701, + 0.785, + 0.729 + ], + "angle": 0, + "content": "Row 4: Pedestrians walking down the sidewalk next to a moving car. TrackFlow is the only method able to describe the pedestrian motion." + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.729, + 0.785, + 0.771 + ], + "angle": 0, + "content": "Row 5: Two bicyclists riding across an intersection next to driving cars. Most methods are able to capture the training bicyclists and the moving cars, but only NSFP and TrackFlow are able to capture the lead bicyclist." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.771, + 0.785, + 0.826 + ], + "angle": 0, + "content": "Row 6: Two pedestrians walk across an intersection while a car drives parallel to them. All methods capture the car motion, but only DeFlow, NSFP, and TrackFlow capture most of the pedestrian motion. TrackFlow also falsely estimates motion of one of the parked cars far down the street in the background." + }, + { + "type": "list", + "bbox": [ + 0.221, + 0.577, + 0.785, + 0.826 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.489, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "supervision. Importantly, we cannot expect any method to meaningfully generalize to the long tail of unknown objects if it cannot provide high quality motion descriptions on a known set of objects. Lastly, TrackFlow outperforms prior art by a wide margin because it leverages recent advances in class imbalanced learning. Our approach highlights that supervised scene flow methods should adopt many of the lessons learned by the detection community to properly address class and point imbalances." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.276, + 0.357, + 0.289 + ], + "angle": 0, + "content": "6.1 Limitations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.3, + 0.787, + 0.375 + ], + "angle": 0, + "content": "TrackFlow only predicts rigid flow for objects within LE3DE2E's fixed taxonomy because it uses a closed-world bounding box based detector. However, as discussed in Appendix D, these limitations can be addressed with a different detector architectures, and is not a fundamental limitations of the Scene Flow via Tracking framework." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.376, + 0.788, + 0.466 + ], + "angle": 0, + "content": "Acknowledgements: This work was supported in part by funding from the NSF GRFP (Grant No. DGE2140739). This work was in part supported by the Army Research Office under MURI award W911NF20-1-0080. Any opinions, findings, conclusions, or recommendations expressed in this material are those of the authors and do not necessarily reflect the view of the Army or the US government." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.49, + 0.325, + 0.506 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.522, + 0.785, + 0.564 + ], + "angle": 0, + "content": "1. Battrawy, R., Schuster, R., Mahani, M.A.N., Stricker, D.: RMS-FlowNet: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Clouds. In: Int. Conf. Rob. Aut. pp. 883-889. IEEE (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.565, + 0.785, + 0.605 + ], + "angle": 0, + "content": "2. Baur, S.A., Emmerichs, D.J., Moosmann, F., Pinggera, P., Ommer, B., Geiger, A.: SLIM: Self-supervised LiDAR scene flow and motion segmentation. In: Int. Conf. Comput. Vis. pp. 13126-13136 (2021) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.606, + 0.785, + 0.646 + ], + "angle": 0, + "content": "3. Behl, A., Paschalidou, D., Donne, S., Geiger, A.: Pointflownet: Learning representations for rigid motion estimation from point clouds. In: Int. Conf. Comput. Vis. pp. 7962-7971 (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.647, + 0.785, + 0.688 + ], + "angle": 0, + "content": "4. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuScenes: A multimodal dataset for autonomous driving. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11621-11631 (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.689, + 0.785, + 0.715 + ], + "angle": 0, + "content": "5. Chodosh, N., Ramanan, D., Lucey, S.: Re-Evaluating LiDAR Scene Flow for Autonomous Driving. arXiv preprint (2023) 2, 3, 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.716, + 0.785, + 0.743 + ], + "angle": 0, + "content": "6. Dewan, A., Caselitz, T., Tipaldi, G.D., Burgard, W.: Rigid scene flow for 3d lidar scans. In: Int. Conf. Intel. Rob. Sys. pp. 1765-1770. IEEE (2016) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.744, + 0.785, + 0.812 + ], + "angle": 0, + "content": "7. Erçelik, E., Yurtsever, E., Liu, M., Yang, Z., Zhang, H., Topçam, P., Listl, M., Çaylı, Y.K., Knoll, A.: 3D Object Detection with a Self-supervised Lidar Scene Flow Backbone. In: Avidan, S., Brostow, G., Cisse, M., Farinella, G.M., Hassner, T. (eds.) Computer Vision - ECCV 2022. pp. 247-265. Springer Nature Switzerland, Cham (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "8. Girshick, R.: Fast R-CNN. In: 2015 IEEE International Conference on Computer Vision (ICCV). pp. 1440-1448 (2015) 19" + }, + { + "type": "list", + "bbox": [ + 0.223, + 0.522, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.222, + 0.147, + 0.786, + 0.189 + ], + "angle": 0, + "content": "9. Gojcic, Z., Litany, O., Wieser, A., Guibas, L.J., Birdal, T.: Weakly supervised learning of rigid 3d scene flow. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5692-5703 (2021) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.233 + ], + "angle": 0, + "content": "10. Gu, X., Wang, Y., Wu, C., Lee, Y.J., Wang, P.: Hplflownet: Hierarchical permutohedral lattice flownet for scene flow estimation on large-scale point clouds. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 3254-3263 (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.234, + 0.786, + 0.302 + ], + "angle": 0, + "content": "11. Huang, X., Wang, Y., Guizilini, V.C., Ambrus, R.A., Gaidon, A., Solomon, J.: Representation Learning for Object Detection from Unlabeled Point Cloud Sequences. In: Liu, K., Kulic, D., Ichnowski, J. (eds.) Proceedings of The 6th Conference on Robot Learning (CoRL). Proceedings of Machine Learning Research, vol. 205, pp. 1277-1288 (2023) 19" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.303, + 0.787, + 0.344 + ], + "angle": 0, + "content": "12. Jund, P., Sweeney, C., Abdo, N., Chen, Z., Shlens, J.: Scalable Scene Flow From Point Clouds in the Real World. IEEE Robotics and Automation Letters (12 2021) 1, 2, 3, 7, 17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.346, + 0.787, + 0.387 + ], + "angle": 0, + "content": "13. Kim, D., Lin, T.Y., Angelova, A., Kweon, I.S., Kuo, W.: Learning open-world object proposals without learning to classify. IEEE Robotics and Automation Letters (RA-L) (2022) 19" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.388, + 0.787, + 0.428 + ], + "angle": 0, + "content": "14. Kim, J., Woo, J., Shin, U., Oh, J., Im, S.: Flow4D: Leveraging 4D Voxel Network for LiDAR Scene Flow Estimation (2024), https://arxiv.org/abs/2407.07995" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.43, + 0.787, + 0.472 + ], + "angle": 0, + "content": "15. Kittenplon, Y., Eldar, Y.C., Raviv, D.: Flowstep3d: Model unrolling for self-supervised scene flow estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4114-4123 (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.473, + 0.787, + 0.528 + ], + "angle": 0, + "content": "16. Lang, A., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: PointPillars: Fast Encoders for Object Detection From Point Clouds. In: Proceedings of the 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 12689-12697 (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.529, + 0.787, + 0.571 + ], + "angle": 0, + "content": "17. Li, R., Lin, G., He, T., Liu, F., Shen, C.: HCRF-Flow: Scene flow from point clouds with continuous high-order CRFs and position-aware flow embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 364-373 (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.571, + 0.787, + 0.599 + ], + "angle": 0, + "content": "18. Li, X., Pontes, J.K., Lucey, S.: Neural Scene Flow Prior. Advances in Neural Information Processing Systems 34 (2021) 1, 2, 4, 7, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.6, + 0.787, + 0.642 + ], + "angle": 0, + "content": "19. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast neural scene flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.787, + 0.684 + ], + "angle": 0, + "content": "20. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast Neural Scene Flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.685, + 0.787, + 0.712 + ], + "angle": 0, + "content": "21. Li, Y., Bu, R., Sun, M., Wu, W., Di, X., Chen, B.: Pointcnn: Convolution on x-transformed points. Adv. Neural Inform. Process. Syst. 31 (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.713, + 0.787, + 0.741 + ], + "angle": 0, + "content": "22. Lin, T., Goyal, P., Girshick, R.B., He, K., Dollar, P.: Focal Loss for Dense Object Detection. In: ICCV 2017. pp. 2999-3007 (2017) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.742, + 0.787, + 0.783 + ], + "angle": 0, + "content": "23. Lin, T., Maire, M., Belongie, S.J., Bourdev, L.D., Girshick, R.B., Hays, J., Perona, P., Ramanan, D., Doll'a r, P., Zitnick, C.L.: Microsoft COCO: Common Objects in Context. CoRR (2014) 5, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.784, + 0.787, + 0.798 + ], + "angle": 0, + "content": "24. Lin, Y., Caesar, H.: ICP-Flow: LiDAR Scene Flow Estimation with ICP (2024) 17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "25. Liu, X., Qi, C.R., Guibas, L.J.: FlowNet3D: Learning Scene Flow in 3D Point Clouds. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2019) 2, 3" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.49, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "I Can't Believe It's Not Scene Flow!" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "26. Liu, Z., Tang, H., Amini, A., Yang, X., Mao, H., Rus, D., Han, S.: Bevfusion: Multi-task multi-sensor fusion with unified bird's-eye view representation. In: IEEE International Conference on Robotics and Automation (ICRA) (2023) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.189, + 0.788, + 0.217 + ], + "angle": 0, + "content": "27. Ma, Y., Peri, N., Wei, S., Hua, W., Ramanan, D., Li, Y., Kong, S.: Long-tailed 3d detection via 2d late fusion. arXiv preprint arXiv:2312.10986 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.217, + 0.788, + 0.271 + ], + "angle": 0, + "content": "28. Mayer, N., Ilg, E., Häusser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A Large Dataset to Train Convolutional Networks for Disparity, Optical Flow, and Scene Flow Estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.271, + 0.788, + 0.298 + ], + "angle": 0, + "content": "29. Menze, M., Heipke, C., Geiger, A.: Joint 3D Estimation of Vehicles and Scene Flow. In: ISPRS Workshop on Image Sequence Analysis (ISA) (2015) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.298, + 0.788, + 0.325 + ], + "angle": 0, + "content": "30. Menze, M., Heipke, C., Geiger, A.: Object Scene Flow. ISPRS Journal of Photogrammetry and Remote Sensing (JPRS) (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.325, + 0.788, + 0.352 + ], + "angle": 0, + "content": "31. Mittal, H., Okorn, B., Held, D.: Just Go With the Flow: Self-Supervised Scene Flow Estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. (June 2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.352, + 0.788, + 0.392 + ], + "angle": 0, + "content": "32. Najibi, M., Ji, J., Zhou, Y., Qi, C.R., Yan, X., Ettinger, S., Anguelov, D.: Motion Inspired Unsupervised Perception and Prediction in Autonomous Driving. European Conference on Computer Vision (ECCV) (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.392, + 0.788, + 0.418 + ], + "angle": 0, + "content": "33. Peri, N., Dave, A., Ramanan, D., Kong, S.: Towards Long Tailed 3D Detection. CoRL (2022) 4, 6, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.419, + 0.788, + 0.459 + ], + "angle": 0, + "content": "34. Peri, N., Li, M., Wilson, B., Wang, Y.X., Hays, J., Ramanan, D.: An empirical analysis of range for 3d object detection. arXiv preprint arXiv:2308.04054 (2023) 6, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.459, + 0.788, + 0.514 + ], + "angle": 0, + "content": "35. Peri, N., Luiten, J., Li, M., Osep, A., Leal-Taixe, L., Ramanan, D.: Forecasting from lidar via future object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17202-17211 (June 2022) 6, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.514, + 0.788, + 0.542 + ], + "angle": 0, + "content": "36. Pontes, J.K., Hays, J., Lucey, S.: Scene flow from point clouds with or without learning. In: Int. Conf. 3D Vis. pp. 261-270. IEEE (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.542, + 0.788, + 0.568 + ], + "angle": 0, + "content": "37. Puy, G., Boulch, A., Marlet, R.: Flot: Scene flow on point clouds guided by optimal transport. In: Eur. Conf. Comput. Vis. pp. 527-544. Springer (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.568, + 0.788, + 0.595 + ], + "angle": 0, + "content": "38. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I.: Improving language understanding by generative pre-training (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.595, + 0.788, + 0.636 + ], + "angle": 0, + "content": "39. Ren, S., He, K., Girshick, R., Sun, J.: Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(6), 1137-1149 (2017) 19" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.636, + 0.788, + 0.718 + ], + "angle": 0, + "content": "40. Sun, P., Kretzschmar, H., Dotiwalla, X., Chouard, A., Patnaik, V., Tsui, P., Guo, J., Zhou, Y., Chai, Y., Caine, B., Vasudevan, V., Han, W., Ngiam, J., Zhao, H., Timofeev, A., Ettinger, S., Krivokon, M., Gao, A., Joshi, A., Zhang, Y., Shlens, J., Chen, Z., Anguelov, D.: Scalability in Perception for Autonomous Driving: Waymo Open Dataset. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.718, + 0.788, + 0.759 + ], + "angle": 0, + "content": "41. Tishchenko, I., Lombardi, S., Oswald, M.R., Pollefeys, M.: Self-supervised learning of non-rigid residual flow and ego-motion. In: Int. Conf. 3D Vis. pp. 150-159. IEEE (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.759, + 0.788, + 0.812 + ], + "angle": 0, + "content": "42. Vedder, K., Peri, N., Chodosh, N., Khatri, I., Eaton, E., Jayaraman, D., Liu, Y., Ramanan, D., Hays, J.: ZeroFlow: Scalable Scene Flow via Distillation. In: Twelfth International Conference on Learning Representations (ICLR) (2024) 1, 2, 3, 4, 7, 8, 17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.812, + 0.788, + 0.841 + ], + "angle": 0, + "content": "43. Vedula, S., Baker, S., Rander, P., Collins, R., Kanade, T.: Three-dimensional scene flow. In: Int. Conf. Comput. Vis. vol. 2, pp. 722-729. IEEE (1999) 2" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "I. Khatri et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "44. Vora, S., Lang, A.H., Helou, B., Beijbom, O.: Pointpainting: Sequential fusion for 3d object detection. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4604-4612 (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.245 + ], + "angle": 0, + "content": "45. Wang, J., Li, X., Sullivan, A., Abbott, L., Chen, S.: PointMotionNet: PointWise Motion Learning for Large-Scale LiDAR Point Clouds Sequences. In: 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 4418-4427 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "46. Wang, Z., Chen, F., Lertniphonphan, K., Chen, S., Bao, J., Zheng, P., Zhang, J., Huang, K., Zhang, T.: Technical report for argoverse challenges on unified sensor-based detection, tracking, and forecasting (2023) 2, 6, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.314 + ], + "angle": 0, + "content": "47. Weng, X., Wang, J., Held, D., Kitani, K.: 3D Multi-Object Tracking: A Baseline and New Evaluation Metrics. IROS (2020) 2, 4, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.787, + 0.357 + ], + "angle": 0, + "content": "48. Weng, X., Wang, J., Levine, S., Kitani, K., Rhinehart, N.: Inverting the pose forecasting pipeline with spf2: Sequential pointcloud forecasting for sequential pose forecasting. In: Conference on robot learning. pp. 11-20. PMLR (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.357, + 0.787, + 0.424 + ], + "angle": 0, + "content": "49. Wilson, B., Qi, W., Agarwal, T., Lambert, J., Singh, J., Khandelwal, S., Pan, B., Kumar, R., Hartnett, A., Pontes, J.K., Ramanan, D., Carr, P., Hays, J.: Argoverse 2: Next Generation Datasets for Self-driving Perception and Forecasting. In: Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks (NeurIPS Datasets and Benchmarks 2021) (2021) 3, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.467 + ], + "angle": 0, + "content": "50. Wu, W., Wang, Z.Y., Li, Z., Liu, W., Fuxin, L.: Pointpwc-net: Cost volume on point clouds for (self-) supervised scene flow estimation. In: Eur. Conf. Comput. Vis. pp. 88-107. Springer (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.468, + 0.787, + 0.494 + ], + "angle": 0, + "content": "51. Yang, J., Zeng, A., Zhang, R., Zhang, L.: UniPose: Detection Any Keypoints. arXiv preprint arXiv:2310.08530 (2023) 19" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.787, + 0.522 + ], + "angle": 0, + "content": "52. Zhai, G., Kong, X., Cui, J., Liu, Y., Yang, Z.: FlowMOT: 3D Multi-Object Tracking by Scene Flow Association. ArXiv abs/2012.07541 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.787, + 0.55 + ], + "angle": 0, + "content": "53. Zhang, Q., Yang, Y., Fang, H., Geng, R., Jensfelt, P.: DeFlow: Decoder of Scene Flow Network in Autonomous Driving. ICRA (2024) 1, 2, 3, 7, 8, 17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.787, + 0.589 + ], + "angle": 0, + "content": "54. Zhang, Q., Yang, Y., Li, P., Andersson, O., Jensfelt, P.: Seflow: A self-supervised scene flow method in autonomous driving. arXiv preprint arXiv:2407.01702 (2024) 17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.591, + 0.787, + 0.619 + ], + "angle": 0, + "content": "55. Zheng, Y., Harley, A.W., Shen, B., Wetzstein, G., Guibas, L.J.: PointOdyssey: A Large-Scale Synthetic Dataset for Long-Term Point Tracking. In: ICCV (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.62, + 0.787, + 0.658 + ], + "angle": 0, + "content": "56. Zhu, B., Jiang, Z., Zhou, X., Li, Z., Yu, G.: Class-balanced Grouping and Sampling for Point Cloud 3D Object Detection. arXiv preprint arXiv:1908.09492 (2019) 2, 4, 7" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.658 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_origin.pdf b/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..250ea753bb2a4047a76e296420f3ad9da0b590f8 --- /dev/null +++ b/2024/I Can't Believe It's Not Scene Flow!/e90affb7-7385-4187-88ac-00395bab9e4e_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5ecda7f92bf99d90a6709373059ffe86427e01701c81045bdcdbfaed19669ab3 +size 6313295 diff --git a/2024/I Can't Believe It's Not Scene Flow!/full.md b/2024/I Can't Believe It's Not Scene Flow!/full.md new file mode 100644 index 0000000000000000000000000000000000000000..de8f08f411edbb80b40bb7992bdcb0e531a84893 --- /dev/null +++ b/2024/I Can't Believe It's Not Scene Flow!/full.md @@ -0,0 +1,264 @@ +# I Can't Believe It's Not Scene Flow! + +Ishan Khatri $^{1,3*}$ , Kyle Vedder $^{2*}$ , Neehar Peri $^{3}$ , Deva Ramanan $^{3}$ , James Hays $^{4}$ + +1Stack AV, 2University of Pennsylvania, 3CMU, 4Georgia Tech + +![](images/ac93c7b587dfd2c2eefffd7f21bb389d064bd06d0394acc44a17701965dff286.jpg) +(a) Ground Truth + +![](images/515cadb1123e4688e91e99eb77fd1e334503f510709acc2cd775c5a7a618e952.jpg) +(b) FastFlow3D [12] + +![](images/d0efe669bb1331c8ce1b239d3b31d2049572624c46af34b212c1500ce662eb9d.jpg) +(c) DeFlow [53] + +![](images/5b8caf28a9ef261952fa1b3e51afbccbefb194a81dfedc02a0f25b0e7ba860ee.jpg) +(d) NSFP [18] + +![](images/af9f40f80ca2b3c94119aa46ad6be8ba038c03edda5b5b59f9bfe12ca45b1ebb.jpg) +(e) ZeroFlow XL 5x [42] + +![](images/e012151d830a25e7ec78fae36fca6cb5956788c0685a9efb483be8bc9143a0ce.jpg) +(f) TrackFlow (Ours) +Fig. 1: We visualize an example of two pedestrians (walking from left to right), cherry-picked to have unusually high density lidar returns, making it particularly easy to estimate flow. We expect that state-of-the-art scene flow methods should work well in this case, but find that all prior art fails catastrophically. Notably, TrackFlow is the only method to estimate flow for these pedestrians. + +Abstract. State-of-the-art scene flow methods broadly fail to describe the motion of small objects, and existing evaluation protocols hide this failure by averaging over many points. To address this limitation, we propose Bucket Normalized EPE, a new class-aware and speed-normalized evaluation protocol that better contextualizes error comparisons between object types that move at vastly different speeds. In addition, we propose TrackFlow, a frustratingly simple supervised scene flow baseline that combines a high-quality 3D object detector (trained using standard class re-balancing techniques) with a simple Kalman filter-based tracker. Notably, TrackFlow achieves state-of-the-art performance on existing metrics and shows large improvements over prior work on our proposed metric. Our results highlight that scene flow evaluation must be class and speed aware, and supervised scene flow methods must address point-level class imbalances. Our evaluation toolkit and code is available on GitHub. + +Keywords: LiDAR Scene Flow, Autonomous Vehicles + +# 1 Introduction + +Scene flow estimation is the task of describing a 3D motion field between temporally successive point clouds [2, 7, 12, 25, 42, 43, 52]. In theory, high quality flow estimators can provide a valuable signal about scene-level dynamics [12, 42] for both online [52] and offline [32] processing. Do state-of-the-art scene flow methods actually work well in practice? + +Status Quo. Standard scene flow metrics suggest that existing methods can estimate motion to centimeter-level accuracy. For example, ZeroFlow XL 5x [42] achieves an average Threeway EPE [5] of only 4.9 centimeters (1.9 inches) and a Dynamic EPE (averaged over points moving faster than $0.5\mathrm{m / s}$ ) of 11.7 centimeters (4.6 inches). Notably, these errors are relatively small compared to the scale of cars and pedestrians, implying that current scene flow methods produce high quality flow. On the scale of cars and people, these feel like tiny errors and seem to imply that current scene flow methods are high quality. + +Bucket Normalized EPE. We visualize flow predictions from several state-of-the-art supervised (FastFlow3D [12], DeFlow [53]) and unsupervised (NSFP [18 ZeroFlow [42]) approaches and find that all methods underestimate flow for small objects (Fig. 1) with fewer lidar points (e.g. pedestrians and bicyclists). Surprisingly, existing scene flow metrics do not highlight such failure cases on these safety-critical categories because small objects only make up a tiny fraction of the dynamic points in a scene (Fig. 2). To address this limitation, we propose Bucket Normalized EPE, a new evaluation protocol that allows us to directly measure performance disparities across classes of different sizes and speed profiles. Specifically, Bucket Normalized EPE evaluates the percentage of described motion, allowing us to normalize comparisons between objects moving at different speeds. Our proposed evaluation metric takes inspiration from mean Average Precision (mAP), a metric commonly used to evaluate object detectors. Notably, unlike existing scene flow metrics, mAP equally weights the performance of large common objects like cars and small rare objects like strollers. Therefore, state-of-the-art 3D object detectors use data augmentation and class re-balancing techniques [56] to perform well on both common and rare classes. + +TrackFlow. Based on this observation, we propose TrackFlow, a frustratingly simple baseline that generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track. Specifically, we run a state-of-the-art 3D object detector [46] followed by a simple 3D Kalman filter-based tracker [47] to generate object trajectories. Despite its simplicity, TrackFlow achieves state-of-the-art performance on Threeway EPE and significantly outperforms prior art on our Bucket Normalized EPE metric, capturing an additional $10\%$ of total motion in general and an additional $20\%$ of total motion on pedestrians (a $1.5 \times$ improvement). Importantly, our simple baseline's state-of-the-art performance is an indictment of existing supervised scene flow methods. We argue that utilizing (well established) class re-balancing techniques can improve performance on rare safety-critical categories in real-world datasets, and evaluating scene flow methods using class and speed-aware metrics more closely reflects real-world performance. + +Contributions. We present three primary contributions. + +1. We highlight the qualitative failure of state-of-the-art scene flow methods on safety-critical categories like pedestrians and bicycles. +2. We introduce Bucket Normalized EPE, a new evaluation protocol that allows us to quantify this qualitative failure on small objects. +3. We propose TrackFlow, a frustratingly simple baseline that achieves state-of-the-art performance on standard metrics and significantly outperforms prior art on our class-aware Bucket Normalized EPE metric. + +# 2 Related Work + +# 2.1 Scene Flow Datasets and Ground Truth + +Unlike next token prediction in language [38] or next frame prediction in vision [48], scene flow is not naively self-supervised: future observations do not provide ground truth scene flow. Therefore, ground truth motion descriptions must be provided by an oracle, typically from human annotators for real data [4, 29, 30, 40, 49] or a data generator for synthetic datasets [28, 55]. For real world datasets (typically from the autonomous vehicle domain) human annotations are provided in the form of 3D bounding boxes and tracks for every object in the scene [5]. Consequently, the generated ground truth flow is assumed to be rigid, even in the case of non-rigid motion like pedestrian gaits. + +# 2.2 Scene Flow Estimation + +Given point clouds $P_{t}$ and $P_{t + 1}$ , scene flow estimators predict $\hat{F}_{t,t + 1}$ , a 3D vector per point in $P_{t}$ that describes its motion from $t$ to $t + 1$ [6]. Performance is typically measured using Average Endpoint Error (EPE) which is the $L_{2}$ norm between the predicted $(\hat{F}_{t,t + 1})$ and ground truth flow $(F_{t,t + 1}^{*})$ , as in Equation 1. + +$$ +\text {A v e r a g e} (P _ {t}) = \frac {1}{\| P _ {t} \|} \sum_ {p \in P _ {t}} \left\| \hat {F} _ {t, t + 1} (p) - F _ {t, t + 1} ^ {*} (p) \right\| _ {2}. \tag {1} +$$ + +Current state-of-the-art methods for scene flow estimation broadly fall into one of two categories: supervised and unsupervised. + +Supervised Scene Flow methods train feedforward networks to perform flow vector regression based on ground truth annotations [1,3,10,12,15,17,21,25,37, 41, 45, 50, 53]. Many of these networks utilize custom point operations such as point-based convolutions [10, 15, 21, 25], making them intractable to train on large point clouds. In contrast, FastFlow3D [12] uses a feedforward architecture based on PointPillars [16], an efficient lidar detector architecture, to train and predict flow on real-world large-scale point clouds. FastFlow3D's speed and quality make it a popular base architecture for both unsupervised and supervised methods like ZeroFlow [42] and DeFlow [53], respectively. + +Unsupervised Scene Flow methods tend to use online optimization against surrogate objectives such as Chamfer distance [18], cycle-consistency [31], distance transforms [19], or other hand-designed heuristics [5, 9, 36]. For example, Neural Scene Flow Prior (NSFP) [18] provides high quality scene flow estimates by optimizing a small ReLU MLP at test time to minimize Chamfer distance and maintain cycle-consistency. Other unsupervised methods like ZeroFlow [42] indirectly leverage online optimization. Vedder et. al [42] introduces Scene Flow via Distillation, a framework that uses a slow optimization-based method to pseudolabel unlabeled point cloud pairs and trains a fast feedforward network with these pseudolabels. + +# 2.3 Scene Flow Evaluation Metrics + +In real-world scenes, most points belong to the static background. Consequently, simply computing Average EPE (Equation 1) over all points is dominated by background points. In order to separately measure non-ego dynamics, Chodosh et al. [5] introduces Threeway EPE, which computes a mean over the Average EPE for three disjoint classes of points: Foreground Dynamic (points inside bounding box labels moving greater than $0.5\mathrm{m / s}$ ), Foreground Static (points inside bounding box labels moving less than $0.5\mathrm{m / s}$ ), and Background Static. We extend Threeway EPE to consider different class and speed profiles. + +# 2.4 3D Object Detection and Tracking + +Object detectors have advanced techniques for training with imbalanced datasets. Notably, modern object detectors use carefully designed losses to mitigate foreground-vs-background imbalances in proposal generation, and data augmentation strategies to train with long-tailed taxonomies. Existing methods address imbalanced foreground-vs-background region proposals using Focal Loss [22] to upweight the importance of foreground regions. More recently, 3D object detectors use class-balanced sampling [56] and copy-paste augmentation to upsample and rebalance the distribution of examples per class. In addition, state-of-the-art 3D object detectors take advantage of multi-modal data to improve detection [27,33,44] of small and rare categories. Since many state-of-the-art tracking algorithms [47] follow the tracking-by-detection paradigm, improving detection quality also significantly improves tracking performance. + +# 3 Bucket Normalized EPE: Small Objects (Should) Matter in Scene Flow + +As shown in Fig. 1 (and further in Fig. 8), existing scene flow methods consistently struggle to describe the motion of safety-critical objects like pedestrians. However, these failures are not captured by Threeway EPE because these objects are small and have few points. Specifically, Threeway EPE's Foreground Dynamic category is dominated by large, common objects with many points like + +![](images/7eee1aa28f67589199ce68df7bf9e24b1436a02bdbbc53df18c64ffc13ec4e46.jpg) +Fig. 2: Number of points from each semantic meta-class for Argoverse 2's val split. Although PEDESTRIAN instances are common, they contribute less than $1\%$ of the total number of points owing to their small instance size relative to CAR and OTHER VEHICLES. Number of points (Y axis) shown on a log scale. + +cars and other vehicles. As shown in Fig. 2, $15\%$ of all points are from cars or other vehicles (dominating Foreground Dynamic's Average EPE), while fewer than $1\%$ of points are from pedestrians and other vulnerable road users (VRUs). + +Additionally, Threeway EPE fails to account for large differences in speed across objects. For example, a $0.5\mathrm{m / s}$ estimation error on a car moving $20\mathrm{m / s}$ is negligible $(< 2.5\%)$ , while a $0.5\mathrm{m / s}$ estimation error on a pedestrian moving $0.5\mathrm{m / s}$ fails to describe $100\%$ of the pedestrian's motion. However, Threeway EPE treats both estimation errors equally. + +We address these two limitations with our Bucket Normalized EPE metric. First, our proposed metric breaks down the object distribution using a taxonomy that human labelers have deemed important (similar to mean Average Precision [23], see Appendix C for discussion on semantics-free evaluation). Second, our proposed metric allows us to contextualize the percentage of object motion being described by normalizing for the speed of the object, allowing us to directly compare performance across object categories. + +We implement our class-aware and speed-normalized metric by accumulating every point into a class-speed matrix (e.g. Appendix B, Table 4) based on its ground truth speed and class, recording an Average EPE as well as a per-bucket average speed. To summarize these results, we report two numbers per class: + +- Static EPE, taken directly from the Average EPE of the first speed bucket for that class (i.e. the first column of Appendix B, Table 4) +- Dynamic Normalized EPE, computed from a mean over the Normalized EPE $\left(\frac{\text{Average EPE}}{\text{average speed}}\right)$ of each non-empty speed bucket (i.e. an average across the Normalized EPEs of the second column onwards in Appendix B, Table 4) + +Dynamic Normalized EPE measures the fraction of motion not described by the estimated flow vectors across the entire speed spectrum. A method that only + +
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND0.002402-
CAR0.0184420.182092
OTHER VEHICLES0.0814750.312882
PEDESTRIAN0.0528420.396849
WHEELED VRU0.0625730.257647
+ +Table 1: TrackFlow's Bucket Normalized EPE on the Argoverse 2 test split. Similar to Threeway EPE, we breakdown our evaluation into static and dynamic buckets. However, we also further breakdown performance by meta-categories and normalize by speed to compare performance disparities on safety-critical categories. TrackFlow is able to capture most dynamic car motion (lower is better), but performs considerably worse on other vehicles and pedestrian. + +predicts ego motion (e.g. $\vec{0}$ after ego-motion compensation) will achieve 1.0 Dynamic Normalized EPE, and a method that perfectly describes all motion will have 0.0 Dynamic Normalized EPE. Methods may achieve errors greater than 1.0 by predicting errors with a magnitude greater than the average speed. For example, a method that describes the negative vector of true motion will get exactly 2.0 Dynamic Normalized EPE (every bucket's Average EPE will be exactly $2\times$ the magnitude of the average speed). The range of Dynamic Normalized EPE is between 0 (perfect) and $\infty$ , and is undefined for buckets without any points. After normalization, Dynamic Normalized EPE can be directly compared across classes. + +We provide an example per-class performance breakdown in Table 1 for TrackFlow (Section 4). Results can be further summarized into a single tuple of mean Static EPE and mean Dynamic Normalized EPE by taking a mean across classes (similar to mean Average Precision [23]). TrackFlow has a mean Static EPE of 0.076277 and a mean Dynamic Normalized EPE of 0.287368. We rank methods according to their mean Dynamic Normalized EPE. + +# 4 TrackFlow: Scene Flow via Tracking + +To highlight the failure of current supervised scene flow methods on smaller objects, we propose Scene Flow via Tracking, a simple framework that uses bounding box track motion from off-the-shelf 3D detectors and trackers to generate scene flow estimates (Fig. 3). We instantiate Scene Flow via Tracking with LE3DE2E [46] $^1$ , a state-of-the-art 3D detector, and AB3DMOT [47], a Kalman filter-based 3D tracker. As shown in Section 5, TrackFlow achieves state-of-the-art performance on Threeway EPE and beats all prior art by a large margin on Bucket Normalized EPE. + +![](images/3959e984425ad728f619dbd89b2bc9ede735287f6cb57544c46305657f3b6446.jpg) +Fig. 3: Overview of the Scene Flow via Tracking framework. Our proposed framework generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track. + +Scene Flow via Tracking works well in practice because it mimics the ground truth flow annotation process. Specifically, ground truth flow is generated using rigid transforms to describe point-level motion within ground truth 3D object tracks (Section 2.1). Therefore, a perfect 3D detector and tracker will achieve perfect flow. However, the power of TrackFlow isn't just derived from its use of bounding boxes; it also greatly benefits from recent advances in class-imbalanced learning [56]. As discussed in Section 2.4, modern detectors are trained with a variety of data augmentation techniques to achieve high precision and recall on all semantic class. TrackFlow leverages the strength of modern 3D detectors to significantly outperform prior art on pedestrians and other small objects. + +Interestingly, we find that the Scene Flow via Tracking framework performs best when using detectors tuned to a low confidence threshold. Typically, detectors are optimized to only predict high confidence boxes (0.7 - 0.9) to minimize the number of false positives. However, our method works best when setting the confidence threshold lower (0.2 for TrackFlow) to increase recall. Specifically, we find that detectors with higher recall and more accurate heading estimation are better suited for Scene Flow via Tracking. We explore detector choice and ablate the impact of confidence thresholds further in Section 5.3. + +# 5 Experiments + +In this section, we compare TrackFlow against state-of-the-art supervised and unsupervised scene flow methods like FastFlow3D [12], DeFlow [53], NSFP [18], and ZeroFlow [42] on the Argoverse 2 benchmark $[49]^2$ . + +# 5.1 TrackFlow Achieves SOTA Performance on Threeway EPE + +TrackFlow is state-of-the-art on Threeway EPE (Fig. 4a) on the Argoverse 2 benchmark [49], achieving an overall reduction of $0.0015\mathrm{m}$ ( $0.15\mathrm{cm}$ , or $1.5\mathrm{mm}$ ) + +![](images/2e227c4126a0951cb9d4562f63db8fa895e356d79e497091a393966fb08cee95.jpg) +(a) Threeway EPE +Fig. 4: Threeway EPE and Threeway EPE's Foreground Dynamic performance of recent supervised and unsupervised scene flow methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color is consistent between plots. We find that all recent methods achieve $5\mathrm{cm}$ error on Threeway EPE, suggesting that these approaches work well in-the-wild. However, this number hides the failure of these methods to describe small object motion. + +![](images/8be72f05938353d3d1f72e9330835ed14dc53ca159d36a88514f62b59d0c7710.jpg) +(b) Threeway EPE's Foreground Dynamic + +over the next best method, ZeroFlow XL 5x. Notably, this improvement can be attributed to significantly better Threeway EPE's Dynamic Foreground (Fig. 4b). Is this performance difference meaningful? + +Based on our reduction of $1.5\mathrm{mm}$ on Threeway EPE (about $4\times$ the thickness of a human fingernail), it would seem that TrackFlow is only an incremental improvement over prior art. However, TrackFlow qualitatively outperforms prior work on important small objects such as pedestrians (Fig. 1, Fig. 8). As shown in the next section, our proposed evaluation protocol Bucket Normalized EPE makes it quantitatively clear that TrackFlow performs significantly better on safety-critical categories like pedestrians and VRUs. + +# 5.2 Bucket Normalized EPE Highlights Failures on Small Objects + +Evaluating existing state-of-the-art methods on our class-aware, speed-normalized evaluation, Bucket Normalized EPE, makes it clear that TrackFlow meaningfully outperforms prior art (Fig. 6) — TrackFlow correctly describes almost $10\%$ additional total motion across meta-classes compared to DeFlow [53]. This difference in dynamic performance becomes even more clear when broken down by meta-class: Fig. 5 shows that TrackFlow is the only method able to describe more than $50\%$ of pedestrian motion, beating DeFlow [53] by more than $20\%$ (Fig. 5c), a $1.5 \times$ improvement. Similarly, other state-of-the-art methods like NSFP [18] and ZeroFlow XL 5x [42] describe less than $30\%$ and $20\%$ of pedestrian motion, respectively. + +![](images/2d4d3542d9f5fe8431e2f85d72b59b02b0f356d44b2933f718f2da7cca06c136.jpg) + +![](images/13a44603e3b35cdc80a121993f3568576d38a9d5d39003db742282d007c4d043.jpg) + +![](images/6d5dc4c161fe2d1cd55f405c3df3ad70c33fea71ce799e6da8bb3849958c7593.jpg) +(a) CAR +(c) PEDESTRIAN +Fig. 5: Per meta-class Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color and position is consistent between plots. TrackFlow significantly improves over prior work on both pedestrian and wheeled VRUs. Notably, Bucket Normalized EPE quantitatively demonstrates significant method performance differences not highlighted in Threeway EPE. + +![](images/f6881465c6859e08d145d57036d3efba6d56dbf99c49d672a10959c116c7849f.jpg) +(b) OTHER VEHICLES +(d) WHEELLED VRU + +Bucket Normalized EPE allows practitioners to effectively compare performance between methods that were almost indistinguishable under Threeway EPE. For example, if you only care about flow performance on cars, DeFlow out-performs all other methods including TrackFlow (Fig. 5a), while ZeroFlow XL 5x out-performs all other methods on larger vehicles (Fig. 5b). + +# 5.3 What Makes a Good Detector for TrackFlow? + +As discussed in Section 4, we tune Scene Flow via Tracking with a low confidence threshold to maximize recall. What makes a good detector for TrackFlow? + +We ablate the impact of detector quality on TrackFlow by replacing LE3DE2E [46] with BEVFusion [26]. We call this new approach TrackFlowBEVF. BEVFusion only has $2\%$ lower mAP than LE3DE2E on the AV2 detection leaderboard3, but we find that TrackFlowBEVF performs significantly worse than TrackFlow, with $10\%$ to $22\%$ drops in performance on Dynamic Normalized EPE (Table 2). + +This significant degradation is the result of BEVFusion's poor recall at low confidence thresholds (Table 3). In contrast, LE3DE2E has very high recall at low thresholds (Fig. 7), producing many candidate boxes for pedestrians in the + +![](images/208570372b3b9002c83ad76845837946224efec5965ec59ccb9fe98e62f5723f.jpg) +Fig. 6: Average Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Our simple baseline achieves state-of-the-art performance, suggesting that supervised scene flow methods should embrace point-level class rebalancing. + +![](images/6dc0130204eeb8305c383cc350ab44ad47a7bd4ad984fc93833f657d4a4f01b2.jpg) +Fig. 7: A qualitative comparison of the recall of BEVFusion and LE3DE2E. LE3DE2E has much higher recall, allowing it to pick out pedestrians BEVFusion missed (circled in red), and better quality box heading estimates. Both detectors are using a confidence threshold of 0.2. + +scene. BEVFusion's false negatives are extremely costly to TrackFlowBEVF, as they result in $\vec{0}$ flow estimates that miss $100\%$ of each false positive pedestrian's motion. + +
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND-0.000228-
CAR+0.039049+0.117944
OTHER VEHICLES+0.009013+0.224830
PEDESTRIAN+0.007187+0.224250
WHEELED VRU-0.025889+0.151373
+ +Table 2: Relative Bucket Normalized EPE performance of TrackFlowBEVF compared to TrackFlow, on the Argoverse 2's test split. Increases in error (worse) are shown with a + in red, and decreases in error (better) are shown with a - in green. TrackFlow's absolute results are shown in Table 1.BEVFusion only has $2\%$ lower mAP than LE3DE2E on the AV2 detection leaderboard, but performs significantly worse than TrackFlow on Dynamic Normalized EPE. + +
ConfidenceMean Dynamic Norm EPE
0.10.4816
0.20.4643
0.30.6008
0.40.8176
+ +Table 3: Mean Dynamic Bucketed EPE values for TrackFlowBEVF using various confidence thresholds for the detector. Lower confidence with higher recall significantly improve Dynamic Norm EPE performance. + +More broadly, a good detector for Scene Flow via Tracking isn't necessarily one with a high mAP; it's one with very high recall and accurate heading estimates. Notably, these error characteristics enable the tracker to reject false positives. We believe this interaction between the detector and tracker is an important yet subtle point — two detectors may have the same mAP, but dramatically different performance in our Scene Flow via Tracking framework. + +# 6 Conclusion + +In this work, we highlight that current scene flow methods consistently fail to describe motion on pedestrians and other small objects. We demonstrate that current standard evaluation metrics hide this failure and present Bucket Normalized EPE, a new class-aware, speed normalized evaluation protocol, to quantify this failure. In addition, we present TrackFlow, a frustratingly simple supervised scene flow baseline that achieves state-of-the-art on Threeway EPE and Bucket Normalized EPE. We argue that current evaluation protocols fail to reveal performance across the distribution of safety-critical objects, and do not contextualize absolute errors in the context of an object's speed. Moreover, we highlight that class and speed aware evaluation is important even if a method has zero human + +![](images/02c1df415cbcd32d0dec305c9688d1a3a4f21c015ee928a778b061f114e5c497.jpg) +(a) Ground Truth (b) FastFlow3D +(c) DeFlow +(d) NSFP +(e) ZeroFlow +(f) TrackFlow +Fig. 8: Visualizations of different methods on diverse scenes in Argoverse 2. Each method is estimating flow from the blue to the green point cloud. + +Row 1: Two pedestrians in left foreground with cars moving in the background. Track-Flow is the only method able to describe the pedestrian motion. +Row 2: Three pedestrians walking across an intersection in front of a stationary car. DeFlow is able to capture the furthest pedestrian, but only TrackFlow is able to capture the motion of all three. TrackFlow also falsely estimates motion of the moving box truck in the background. +Row 3: Top view of pedestrians walking down the sidewalk between a building and several cars parked in the street. TrackFlow is the only method able to describe the pedestrian motion. +Row 4: Pedestrians walking down the sidewalk next to a moving car. TrackFlow is the only method able to describe the pedestrian motion. +Row 5: Two bicyclists riding across an intersection next to driving cars. Most methods are able to capture the training bicyclists and the moving cars, but only NSFP and TrackFlow are able to capture the lead bicyclist. +Row 6: Two pedestrians walk across an intersection while a car drives parallel to them. All methods capture the car motion, but only DeFlow, NSFP, and TrackFlow capture most of the pedestrian motion. TrackFlow also falsely estimates motion of one of the parked cars far down the street in the background. + +supervision. Importantly, we cannot expect any method to meaningfully generalize to the long tail of unknown objects if it cannot provide high quality motion descriptions on a known set of objects. Lastly, TrackFlow outperforms prior art by a wide margin because it leverages recent advances in class imbalanced learning. Our approach highlights that supervised scene flow methods should adopt many of the lessons learned by the detection community to properly address class and point imbalances. + +# 6.1 Limitations + +TrackFlow only predicts rigid flow for objects within LE3DE2E's fixed taxonomy because it uses a closed-world bounding box based detector. However, as discussed in Appendix D, these limitations can be addressed with a different detector architectures, and is not a fundamental limitations of the Scene Flow via Tracking framework. + +Acknowledgements: This work was supported in part by funding from the NSF GRFP (Grant No. DGE2140739). This work was in part supported by the Army Research Office under MURI award W911NF20-1-0080. Any opinions, findings, conclusions, or recommendations expressed in this material are those of the authors and do not necessarily reflect the view of the Army or the US government. + +# References + +1. Battrawy, R., Schuster, R., Mahani, M.A.N., Stricker, D.: RMS-FlowNet: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Clouds. In: Int. Conf. Rob. Aut. pp. 883-889. IEEE (2022) 3 +2. Baur, S.A., Emmerichs, D.J., Moosmann, F., Pinggera, P., Ommer, B., Geiger, A.: SLIM: Self-supervised LiDAR scene flow and motion segmentation. In: Int. Conf. Comput. Vis. pp. 13126-13136 (2021) 2 +3. Behl, A., Paschalidou, D., Donne, S., Geiger, A.: Pointflownet: Learning representations for rigid motion estimation from point clouds. In: Int. Conf. Comput. Vis. pp. 7962-7971 (2019) 3 +4. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuScenes: A multimodal dataset for autonomous driving. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11621-11631 (2020) 3 +5. Chodosh, N., Ramanan, D., Lucey, S.: Re-Evaluating LiDAR Scene Flow for Autonomous Driving. arXiv preprint (2023) 2, 3, 4, 7 +6. Dewan, A., Caselitz, T., Tipaldi, G.D., Burgard, W.: Rigid scene flow for 3d lidar scans. In: Int. Conf. Intel. Rob. Sys. pp. 1765-1770. IEEE (2016) 3 +7. Erçelik, E., Yurtsever, E., Liu, M., Yang, Z., Zhang, H., Topçam, P., Listl, M., Çaylı, Y.K., Knoll, A.: 3D Object Detection with a Self-supervised Lidar Scene Flow Backbone. In: Avidan, S., Brostow, G., Cisse, M., Farinella, G.M., Hassner, T. (eds.) Computer Vision - ECCV 2022. pp. 247-265. Springer Nature Switzerland, Cham (2022) 2 +8. Girshick, R.: Fast R-CNN. In: 2015 IEEE International Conference on Computer Vision (ICCV). pp. 1440-1448 (2015) 19 + +9. Gojcic, Z., Litany, O., Wieser, A., Guibas, L.J., Birdal, T.: Weakly supervised learning of rigid 3d scene flow. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5692-5703 (2021) 4 +10. Gu, X., Wang, Y., Wu, C., Lee, Y.J., Wang, P.: Hplflownet: Hierarchical permutohedral lattice flownet for scene flow estimation on large-scale point clouds. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 3254-3263 (2019) 3 +11. Huang, X., Wang, Y., Guizilini, V.C., Ambrus, R.A., Gaidon, A., Solomon, J.: Representation Learning for Object Detection from Unlabeled Point Cloud Sequences. In: Liu, K., Kulic, D., Ichnowski, J. (eds.) Proceedings of The 6th Conference on Robot Learning (CoRL). Proceedings of Machine Learning Research, vol. 205, pp. 1277-1288 (2023) 19 +12. Jund, P., Sweeney, C., Abdo, N., Chen, Z., Shlens, J.: Scalable Scene Flow From Point Clouds in the Real World. IEEE Robotics and Automation Letters (12 2021) 1, 2, 3, 7, 17 +13. Kim, D., Lin, T.Y., Angelova, A., Kweon, I.S., Kuo, W.: Learning open-world object proposals without learning to classify. IEEE Robotics and Automation Letters (RA-L) (2022) 19 +14. Kim, J., Woo, J., Shin, U., Oh, J., Im, S.: Flow4D: Leveraging 4D Voxel Network for LiDAR Scene Flow Estimation (2024), https://arxiv.org/abs/2407.07995 +15. Kittenplon, Y., Eldar, Y.C., Raviv, D.: Flowstep3d: Model unrolling for self-supervised scene flow estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4114-4123 (2021) 3 +16. Lang, A., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: PointPillars: Fast Encoders for Object Detection From Point Clouds. In: Proceedings of the 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 12689-12697 (2019) 3 +17. Li, R., Lin, G., He, T., Liu, F., Shen, C.: HCRF-Flow: Scene flow from point clouds with continuous high-order CRFs and position-aware flow embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 364-373 (2021) 3 +18. Li, X., Pontes, J.K., Lucey, S.: Neural Scene Flow Prior. Advances in Neural Information Processing Systems 34 (2021) 1, 2, 4, 7, 8 +19. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast neural scene flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 4 +20. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast Neural Scene Flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 17 +21. Li, Y., Bu, R., Sun, M., Wu, W., Di, X., Chen, B.: Pointcnn: Convolution on x-transformed points. Adv. Neural Inform. Process. Syst. 31 (2018) 3 +22. Lin, T., Goyal, P., Girshick, R.B., He, K., Dollar, P.: Focal Loss for Dense Object Detection. In: ICCV 2017. pp. 2999-3007 (2017) 4 +23. Lin, T., Maire, M., Belongie, S.J., Bourdev, L.D., Girshick, R.B., Hays, J., Perona, P., Ramanan, D., Doll'a r, P., Zitnick, C.L.: Microsoft COCO: Common Objects in Context. CoRR (2014) 5, 6 +24. Lin, Y., Caesar, H.: ICP-Flow: LiDAR Scene Flow Estimation with ICP (2024) 17 +25. Liu, X., Qi, C.R., Guibas, L.J.: FlowNet3D: Learning Scene Flow in 3D Point Clouds. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2019) 2, 3 + +26. Liu, Z., Tang, H., Amini, A., Yang, X., Mao, H., Rus, D., Han, S.: Bevfusion: Multi-task multi-sensor fusion with unified bird's-eye view representation. In: IEEE International Conference on Robotics and Automation (ICRA) (2023) 9 +27. Ma, Y., Peri, N., Wei, S., Hua, W., Ramanan, D., Li, Y., Kong, S.: Long-tailed 3d detection via 2d late fusion. arXiv preprint arXiv:2312.10986 (2023) 4 +28. Mayer, N., Ilg, E., Häusser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A Large Dataset to Train Convolutional Networks for Disparity, Optical Flow, and Scene Flow Estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 3 +29. Menze, M., Heipke, C., Geiger, A.: Joint 3D Estimation of Vehicles and Scene Flow. In: ISPRS Workshop on Image Sequence Analysis (ISA) (2015) 3 +30. Menze, M., Heipke, C., Geiger, A.: Object Scene Flow. ISPRS Journal of Photogrammetry and Remote Sensing (JPRS) (2018) 3 +31. Mittal, H., Okorn, B., Held, D.: Just Go With the Flow: Self-Supervised Scene Flow Estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. (June 2020) 4 +32. Najibi, M., Ji, J., Zhou, Y., Qi, C.R., Yan, X., Ettinger, S., Anguelov, D.: Motion Inspired Unsupervised Perception and Prediction in Autonomous Driving. European Conference on Computer Vision (ECCV) (2022) 2 +33. Peri, N., Dave, A., Ramanan, D., Kong, S.: Towards Long Tailed 3D Detection. CoRL (2022) 4, 6, 9 +34. Peri, N., Li, M., Wilson, B., Wang, Y.X., Hays, J., Ramanan, D.: An empirical analysis of range for 3d object detection. arXiv preprint arXiv:2308.04054 (2023) 6, 9 +35. Peri, N., Luiten, J., Li, M., Osep, A., Leal-Taixe, L., Ramanan, D.: Forecasting from lidar via future object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17202-17211 (June 2022) 6, 9 +36. Pontes, J.K., Hays, J., Lucey, S.: Scene flow from point clouds with or without learning. In: Int. Conf. 3D Vis. pp. 261-270. IEEE (2020) 4 +37. Puy, G., Boulch, A., Marlet, R.: Flot: Scene flow on point clouds guided by optimal transport. In: Eur. Conf. Comput. Vis. pp. 527-544. Springer (2020) 3 +38. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I.: Improving language understanding by generative pre-training (2018) 3 +39. Ren, S., He, K., Girshick, R., Sun, J.: Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(6), 1137-1149 (2017) 19 +40. Sun, P., Kretzschmar, H., Dotiwalla, X., Chouard, A., Patnaik, V., Tsui, P., Guo, J., Zhou, Y., Chai, Y., Caine, B., Vasudevan, V., Han, W., Ngiam, J., Zhao, H., Timofeev, A., Ettinger, S., Krivokon, M., Gao, A., Joshi, A., Zhang, Y., Shlens, J., Chen, Z., Anguelov, D.: Scalability in Perception for Autonomous Driving: Waymo Open Dataset. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020) 3 +41. Tishchenko, I., Lombardi, S., Oswald, M.R., Pollefeys, M.: Self-supervised learning of non-rigid residual flow and ego-motion. In: Int. Conf. 3D Vis. pp. 150-159. IEEE (2020) 3 +42. Vedder, K., Peri, N., Chodosh, N., Khatri, I., Eaton, E., Jayaraman, D., Liu, Y., Ramanan, D., Hays, J.: ZeroFlow: Scalable Scene Flow via Distillation. In: Twelfth International Conference on Learning Representations (ICLR) (2024) 1, 2, 3, 4, 7, 8, 17 +43. Vedula, S., Baker, S., Rander, P., Collins, R., Kanade, T.: Three-dimensional scene flow. In: Int. Conf. Comput. Vis. vol. 2, pp. 722-729. IEEE (1999) 2 + +44. Vora, S., Lang, A.H., Helou, B., Beijbom, O.: Pointpainting: Sequential fusion for 3d object detection. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4604-4612 (2020) 4 +45. Wang, J., Li, X., Sullivan, A., Abbott, L., Chen, S.: PointMotionNet: PointWise Motion Learning for Large-Scale LiDAR Point Clouds Sequences. In: 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 4418-4427 (2022) 3 +46. Wang, Z., Chen, F., Lertniphonphan, K., Chen, S., Bao, J., Zheng, P., Zhang, J., Huang, K., Zhang, T.: Technical report for argoverse challenges on unified sensor-based detection, tracking, and forecasting (2023) 2, 6, 9 +47. Weng, X., Wang, J., Held, D., Kitani, K.: 3D Multi-Object Tracking: A Baseline and New Evaluation Metrics. IROS (2020) 2, 4, 6 +48. Weng, X., Wang, J., Levine, S., Kitani, K., Rhinehart, N.: Inverting the pose forecasting pipeline with spf2: Sequential pointcloud forecasting for sequential pose forecasting. In: Conference on robot learning. pp. 11-20. PMLR (2021) 3 +49. Wilson, B., Qi, W., Agarwal, T., Lambert, J., Singh, J., Khandelwal, S., Pan, B., Kumar, R., Hartnett, A., Pontes, J.K., Ramanan, D., Carr, P., Hays, J.: Argoverse 2: Next Generation Datasets for Self-driving Perception and Forecasting. In: Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks (NeurIPS Datasets and Benchmarks 2021) (2021) 3, 7 +50. Wu, W., Wang, Z.Y., Li, Z., Liu, W., Fuxin, L.: Pointpwc-net: Cost volume on point clouds for (self-) supervised scene flow estimation. In: Eur. Conf. Comput. Vis. pp. 88-107. Springer (2020) 3 +51. Yang, J., Zeng, A., Zhang, R., Zhang, L.: UniPose: Detection Any Keypoints. arXiv preprint arXiv:2310.08530 (2023) 19 +52. Zhai, G., Kong, X., Cui, J., Liu, Y., Yang, Z.: FlowMOT: 3D Multi-Object Tracking by Scene Flow Association. ArXiv abs/2012.07541 (2020) 2 +53. Zhang, Q., Yang, Y., Fang, H., Geng, R., Jensfelt, P.: DeFlow: Decoder of Scene Flow Network in Autonomous Driving. ICRA (2024) 1, 2, 3, 7, 8, 17 +54. Zhang, Q., Yang, Y., Li, P., Andersson, O., Jensfelt, P.: Seflow: A self-supervised scene flow method in autonomous driving. arXiv preprint arXiv:2407.01702 (2024) 17 +55. Zheng, Y., Harley, A.W., Shen, B., Wetzstein, G., Guibas, L.J.: PointOdyssey: A Large-Scale Synthetic Dataset for Long-Term Point Tracking. In: ICCV (2023) 3 +56. Zhu, B., Jiang, Z., Zhou, X., Li, Z., Yu, G.: Class-balanced Grouping and Sampling for Point Cloud 3D Object Detection. arXiv preprint arXiv:1908.09492 (2019) 2, 4, 7 \ No newline at end of file diff --git a/2024/I Can't Believe It's Not Scene Flow!/images.zip b/2024/I Can't Believe It's Not Scene Flow!/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..d91156a320b7ce2c159cb42241220fe0b9773005 --- /dev/null +++ b/2024/I Can't Believe It's Not Scene Flow!/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e00e65c157e1094e9a6484a06f70cb03be911685a80f7dc6cc02d35f83c391c4 +size 502553 diff --git a/2024/I Can't Believe It's Not Scene Flow!/layout.json b/2024/I Can't Believe It's Not Scene Flow!/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..ec642fe36159c64f2e60249a627af5789afb6608 --- /dev/null +++ b/2024/I Can't Believe It's Not Scene Flow!/layout.json @@ -0,0 +1,8444 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 179, + 113, + 434, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 179, + 113, + 434, + 127 + ], + "spans": [ + { + "bbox": [ + 179, + 113, + 434, + 127 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "spans": [ + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "text", + "content": "Ishan Khatri" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "inline_equation", + "content": "^{1,3*}" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "text", + "content": ", Kyle Vedder" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "inline_equation", + "content": "^{2*}" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "text", + "content": ", Neehar Peri" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "text", + "content": ", Deva Ramanan" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "text", + "content": ", James Hays" + }, + { + "bbox": [ + 134, + 149, + 478, + 163 + ], + "type": "inline_equation", + "content": "^{4}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 178, + 171, + 436, + 184 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 178, + 171, + 436, + 184 + ], + "spans": [ + { + "bbox": [ + 178, + 171, + 436, + 184 + ], + "type": "text", + "content": "1Stack AV, 2University of Pennsylvania, 3CMU, 4Georgia Tech" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 151, + 209, + 235, + 284 + ], + "blocks": [ + { + "bbox": [ + 151, + 209, + 235, + 284 + ], + "lines": [ + { + "bbox": [ + 151, + 209, + 235, + 284 + ], + "spans": [ + { + "bbox": [ + 151, + 209, + 235, + 284 + ], + "type": "image", + "image_path": "ac93c7b587dfd2c2eefffd7f21bb389d064bd06d0394acc44a17701965dff286.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 162, + 298, + 227, + 308 + ], + "lines": [ + { + "bbox": [ + 162, + 298, + 227, + 308 + ], + "spans": [ + { + "bbox": [ + 162, + 298, + 227, + 308 + ], + "type": "text", + "content": "(a) Ground Truth" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 262, + 209, + 344, + 283 + ], + "blocks": [ + { + "bbox": [ + 262, + 209, + 344, + 283 + ], + "lines": [ + { + "bbox": [ + 262, + 209, + 344, + 283 + ], + "spans": [ + { + "bbox": [ + 262, + 209, + 344, + 283 + ], + "type": "image", + "image_path": "515cadb1123e4688e91e99eb77fd1e334503f510709acc2cd775c5a7a618e952.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 269, + 298, + 342, + 308 + ], + "lines": [ + { + "bbox": [ + 269, + 298, + 342, + 308 + ], + "spans": [ + { + "bbox": [ + 269, + 298, + 342, + 308 + ], + "type": "text", + "content": "(b) FastFlow3D [12]" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 375, + 209, + 459, + 283 + ], + "blocks": [ + { + "bbox": [ + 375, + 209, + 459, + 283 + ], + "lines": [ + { + "bbox": [ + 375, + 209, + 459, + 283 + ], + "spans": [ + { + "bbox": [ + 375, + 209, + 459, + 283 + ], + "type": "image", + "image_path": "d0efe669bb1331c8ce1b239d3b31d2049572624c46af34b212c1500ce662eb9d.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 391, + 298, + 447, + 308 + ], + "lines": [ + { + "bbox": [ + 391, + 298, + 447, + 308 + ], + "spans": [ + { + "bbox": [ + 391, + 298, + 447, + 308 + ], + "type": "text", + "content": "(c) DeFlow [53]" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 152, + 320, + 235, + 393 + ], + "blocks": [ + { + "bbox": [ + 152, + 320, + 235, + 393 + ], + "lines": [ + { + "bbox": [ + 152, + 320, + 235, + 393 + ], + "spans": [ + { + "bbox": [ + 152, + 320, + 235, + 393 + ], + "type": "image", + "image_path": "5b8caf28a9ef261952fa1b3e51afbccbefb194a81dfedc02a0f25b0e7ba860ee.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 170, + 409, + 222, + 418 + ], + "lines": [ + { + "bbox": [ + 170, + 409, + 222, + 418 + ], + "spans": [ + { + "bbox": [ + 170, + 409, + 222, + 418 + ], + "type": "text", + "content": "(d) NSFP [18]" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 262, + 320, + 345, + 393 + ], + "blocks": [ + { + "bbox": [ + 262, + 320, + 345, + 393 + ], + "lines": [ + { + "bbox": [ + 262, + 320, + 345, + 393 + ], + "spans": [ + { + "bbox": [ + 262, + 320, + 345, + 393 + ], + "type": "image", + "image_path": "af9f40f80ca2b3c94119aa46ad6be8ba038c03edda5b5b59f9bfe12ca45b1ebb.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 263, + 409, + 350, + 418 + ], + "lines": [ + { + "bbox": [ + 263, + 409, + 350, + 418 + ], + "spans": [ + { + "bbox": [ + 263, + 409, + 350, + 418 + ], + "type": "text", + "content": "(e) ZeroFlow XL 5x [42]" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 374, + 320, + 457, + 393 + ], + "blocks": [ + { + "bbox": [ + 374, + 320, + 457, + 393 + ], + "lines": [ + { + "bbox": [ + 374, + 320, + 457, + 393 + ], + "spans": [ + { + "bbox": [ + 374, + 320, + 457, + 393 + ], + "type": "image", + "image_path": "e012151d830a25e7ec78fae36fca6cb5956788c0685a9efb483be8bc9143a0ce.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 375, + 409, + 460, + 418 + ], + "lines": [ + { + "bbox": [ + 375, + 409, + 460, + 418 + ], + "spans": [ + { + "bbox": [ + 375, + 409, + 460, + 418 + ], + "type": "text", + "content": "(f) TrackFlow (Ours)" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 428, + 482, + 483 + ], + "lines": [ + { + "bbox": [ + 130, + 428, + 482, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 428, + 482, + 483 + ], + "type": "text", + "content": "Fig. 1: We visualize an example of two pedestrians (walking from left to right), cherry-picked to have unusually high density lidar returns, making it particularly easy to estimate flow. We expect that state-of-the-art scene flow methods should work well in this case, but find that all prior art fails catastrophically. Notably, TrackFlow is the only method to estimate flow for these pedestrians." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "bbox": [ + 159, + 491, + 453, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 491, + 453, + 643 + ], + "spans": [ + { + "bbox": [ + 159, + 491, + 453, + 643 + ], + "type": "text", + "content": "Abstract. State-of-the-art scene flow methods broadly fail to describe the motion of small objects, and existing evaluation protocols hide this failure by averaging over many points. To address this limitation, we propose Bucket Normalized EPE, a new class-aware and speed-normalized evaluation protocol that better contextualizes error comparisons between object types that move at vastly different speeds. In addition, we propose TrackFlow, a frustratingly simple supervised scene flow baseline that combines a high-quality 3D object detector (trained using standard class re-balancing techniques) with a simple Kalman filter-based tracker. Notably, TrackFlow achieves state-of-the-art performance on existing metrics and shows large improvements over prior work on our proposed metric. Our results highlight that scene flow evaluation must be class and speed aware, and supervised scene flow methods must address point-level class imbalances. Our evaluation toolkit and code is available on GitHub." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 160, + 654, + 386, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 654, + 386, + 665 + ], + "spans": [ + { + "bbox": [ + 160, + 654, + 386, + 665 + ], + "type": "text", + "content": "Keywords: LiDAR Scene Flow, Autonomous Vehicles" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 230, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 230, + 128 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 230, + 128 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 479, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 479, + 199 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 479, + 199 + ], + "type": "text", + "content": "Scene flow estimation is the task of describing a 3D motion field between temporally successive point clouds [2, 7, 12, 25, 42, 43, 52]. In theory, high quality flow estimators can provide a valuable signal about scene-level dynamics [12, 42] for both online [52] and offline [32] processing. Do state-of-the-art scene flow methods actually work well in practice?" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 200, + 480, + 294 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 480, + 294 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 480, + 294 + ], + "type": "text", + "content": "Status Quo. Standard scene flow metrics suggest that existing methods can estimate motion to centimeter-level accuracy. For example, ZeroFlow XL 5x [42] achieves an average Threeway EPE [5] of only 4.9 centimeters (1.9 inches) and a Dynamic EPE (averaged over points moving faster than " + }, + { + "bbox": [ + 130, + 200, + 480, + 294 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{m / s}" + }, + { + "bbox": [ + 130, + 200, + 480, + 294 + ], + "type": "text", + "content": ") of 11.7 centimeters (4.6 inches). Notably, these errors are relatively small compared to the scale of cars and pedestrians, implying that current scene flow methods produce high quality flow. On the scale of cars and people, these feel like tiny errors and seem to imply that current scene flow methods are high quality." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 295, + 481, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 295, + 481, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 295, + 481, + 498 + ], + "type": "text", + "content": "Bucket Normalized EPE. We visualize flow predictions from several state-of-the-art supervised (FastFlow3D [12], DeFlow [53]) and unsupervised (NSFP [18 ZeroFlow [42]) approaches and find that all methods underestimate flow for small objects (Fig. 1) with fewer lidar points (e.g. pedestrians and bicyclists). Surprisingly, existing scene flow metrics do not highlight such failure cases on these safety-critical categories because small objects only make up a tiny fraction of the dynamic points in a scene (Fig. 2). To address this limitation, we propose Bucket Normalized EPE, a new evaluation protocol that allows us to directly measure performance disparities across classes of different sizes and speed profiles. Specifically, Bucket Normalized EPE evaluates the percentage of described motion, allowing us to normalize comparisons between objects moving at different speeds. Our proposed evaluation metric takes inspiration from mean Average Precision (mAP), a metric commonly used to evaluate object detectors. Notably, unlike existing scene flow metrics, mAP equally weights the performance of large common objects like cars and small rare objects like strollers. Therefore, state-of-the-art 3D object detectors use data augmentation and class re-balancing techniques [56] to perform well on both common and rare classes." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "TrackFlow. Based on this observation, we propose TrackFlow, a frustratingly simple baseline that generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track. Specifically, we run a state-of-the-art 3D object detector [46] followed by a simple 3D Kalman filter-based tracker [47] to generate object trajectories. Despite its simplicity, TrackFlow achieves state-of-the-art performance on Threeway EPE and significantly outperforms prior art on our Bucket Normalized EPE metric, capturing an additional " + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": " of total motion in general and an additional " + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": " of total motion on pedestrians (a " + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "1.5 \\times" + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": " improvement). Importantly, our simple baseline's state-of-the-art performance is an indictment of existing supervised scene flow methods. We argue that utilizing (well established) class re-balancing techniques can improve performance on rare safety-critical categories in real-world datasets, and evaluating scene flow methods using class and speed-aware metrics more closely reflects real-world performance." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 146, + 116, + 400, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 116, + 400, + 128 + ], + "spans": [ + { + "bbox": [ + 146, + 116, + 400, + 128 + ], + "type": "text", + "content": "Contributions. We present three primary contributions." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 135, + 136, + 479, + 217 + ], + "type": "list", + "angle": 0, + "index": 6, + "blocks": [ + { + "bbox": [ + 136, + 136, + 479, + 158 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 136, + 479, + 158 + ], + "spans": [ + { + "bbox": [ + 136, + 136, + 479, + 158 + ], + "type": "text", + "content": "1. We highlight the qualitative failure of state-of-the-art scene flow methods on safety-critical categories like pedestrians and bicycles." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 135, + 160, + 479, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 160, + 479, + 182 + ], + "spans": [ + { + "bbox": [ + 135, + 160, + 479, + 182 + ], + "type": "text", + "content": "2. We introduce Bucket Normalized EPE, a new evaluation protocol that allows us to quantify this qualitative failure on small objects." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 135, + 184, + 479, + 217 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 184, + 479, + 217 + ], + "spans": [ + { + "bbox": [ + 135, + 184, + 479, + 217 + ], + "type": "text", + "content": "3. We propose TrackFlow, a frustratingly simple baseline that achieves state-of-the-art performance on standard metrics and significantly outperforms prior art on our class-aware Bucket Normalized EPE metric." + } + ] + } + ], + "index": 5 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 239, + 237, + 251 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 239, + 237, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 237, + 251 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 264, + 361, + 275 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 264, + 361, + 275 + ], + "spans": [ + { + "bbox": [ + 132, + 264, + 361, + 275 + ], + "type": "text", + "content": "2.1 Scene Flow Datasets and Ground Truth" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 284, + 480, + 392 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 284, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 480, + 392 + ], + "type": "text", + "content": "Unlike next token prediction in language [38] or next frame prediction in vision [48], scene flow is not naively self-supervised: future observations do not provide ground truth scene flow. Therefore, ground truth motion descriptions must be provided by an oracle, typically from human annotators for real data [4, 29, 30, 40, 49] or a data generator for synthetic datasets [28, 55]. For real world datasets (typically from the autonomous vehicle domain) human annotations are provided in the form of 3D bounding boxes and tracks for every object in the scene [5]. Consequently, the generated ground truth flow is assumed to be rigid, even in the case of non-rigid motion like pedestrian gaits." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 410, + 276, + 421 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 410, + 276, + 421 + ], + "spans": [ + { + "bbox": [ + 132, + 410, + 276, + 421 + ], + "type": "text", + "content": "2.2 Scene Flow Estimation" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": "Given point clouds " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "P_{t}" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "P_{t + 1}" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": ", scene flow estimators predict " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "\\hat{F}_{t,t + 1}" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": ", a 3D vector per point in " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "P_{t}" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": " that describes its motion from " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "t + 1" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": " [6]. Performance is typically measured using Average Endpoint Error (EPE) which is the " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "L_{2}" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": " norm between the predicted " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "(\\hat{F}_{t,t + 1})" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": " and ground truth flow " + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "inline_equation", + "content": "(F_{t,t + 1}^{*})" + }, + { + "bbox": [ + 130, + 430, + 479, + 479 + ], + "type": "text", + "content": ", as in Equation 1." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 192, + 486, + 480, + 512 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 486, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 192, + 486, + 480, + 512 + ], + "type": "interline_equation", + "content": "\\text {A v e r a g e} (P _ {t}) = \\frac {1}{\\| P _ {t} \\|} \\sum_ {p \\in P _ {t}} \\left\\| \\hat {F} _ {t, t + 1} (p) - F _ {t, t + 1} ^ {*} (p) \\right\\| _ {2}. \\tag {1}", + "image_path": "cb028f32ecfe0072f11038ce7ad246cfd94f444f22d676872a7e77b1b9520c2c.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 515, + 479, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 515, + 479, + 539 + ], + "spans": [ + { + "bbox": [ + 130, + 515, + 479, + 539 + ], + "type": "text", + "content": "Current state-of-the-art methods for scene flow estimation broadly fall into one of two categories: supervised and unsupervised." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 557, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 481, + 666 + ], + "type": "text", + "content": "Supervised Scene Flow methods train feedforward networks to perform flow vector regression based on ground truth annotations [1,3,10,12,15,17,21,25,37, 41, 45, 50, 53]. Many of these networks utilize custom point operations such as point-based convolutions [10, 15, 21, 25], making them intractable to train on large point clouds. In contrast, FastFlow3D [12] uses a feedforward architecture based on PointPillars [16], an efficient lidar detector architecture, to train and predict flow on real-world large-scale point clouds. FastFlow3D's speed and quality make it a popular base architecture for both unsupervised and supervised methods like ZeroFlow [42] and DeFlow [53], respectively." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 236 + ], + "type": "text", + "content": "Unsupervised Scene Flow methods tend to use online optimization against surrogate objectives such as Chamfer distance [18], cycle-consistency [31], distance transforms [19], or other hand-designed heuristics [5, 9, 36]. For example, Neural Scene Flow Prior (NSFP) [18] provides high quality scene flow estimates by optimizing a small ReLU MLP at test time to minimize Chamfer distance and maintain cycle-consistency. Other unsupervised methods like ZeroFlow [42] indirectly leverage online optimization. Vedder et. al [42] introduces Scene Flow via Distillation, a framework that uses a slow optimization-based method to pseudolabel unlabeled point cloud pairs and trains a fast feedforward network with these pseudolabels." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 253, + 316, + 264 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 253, + 316, + 264 + ], + "spans": [ + { + "bbox": [ + 132, + 253, + 316, + 264 + ], + "type": "text", + "content": "2.3 Scene Flow Evaluation Metrics" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 273, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 273, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 273, + 482, + 369 + ], + "type": "text", + "content": "In real-world scenes, most points belong to the static background. Consequently, simply computing Average EPE (Equation 1) over all points is dominated by background points. In order to separately measure non-ego dynamics, Chodosh et al. [5] introduces Threeway EPE, which computes a mean over the Average EPE for three disjoint classes of points: Foreground Dynamic (points inside bounding box labels moving greater than " + }, + { + "bbox": [ + 132, + 273, + 482, + 369 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{m / s}" + }, + { + "bbox": [ + 132, + 273, + 482, + 369 + ], + "type": "text", + "content": "), Foreground Static (points inside bounding box labels moving less than " + }, + { + "bbox": [ + 132, + 273, + 482, + 369 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{m / s}" + }, + { + "bbox": [ + 132, + 273, + 482, + 369 + ], + "type": "text", + "content": "), and Background Static. We extend Threeway EPE to consider different class and speed profiles." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 385, + 334, + 398 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 385, + 334, + 398 + ], + "spans": [ + { + "bbox": [ + 132, + 385, + 334, + 398 + ], + "type": "text", + "content": "2.4 3D Object Detection and Tracking" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 405, + 499, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 405, + 499, + 548 + ], + "spans": [ + { + "bbox": [ + 132, + 405, + 499, + 548 + ], + "type": "text", + "content": "Object detectors have advanced techniques for training with imbalanced datasets. Notably, modern object detectors use carefully designed losses to mitigate foreground-vs-background imbalances in proposal generation, and data augmentation strategies to train with long-tailed taxonomies. Existing methods address imbalanced foreground-vs-background region proposals using Focal Loss [22] to upweight the importance of foreground regions. More recently, 3D object detectors use class-balanced sampling [56] and copy-paste augmentation to upsample and rebalance the distribution of examples per class. In addition, state-of-the-art 3D object detectors take advantage of multi-modal data to improve detection [27,33,44] of small and rare categories. Since many state-of-the-art tracking algorithms [47] follow the tracking-by-detection paradigm, improving detection quality also significantly improves tracking performance." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 566, + 447, + 594 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 566, + 447, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 566, + 447, + 594 + ], + "type": "text", + "content": "3 Bucket Normalized EPE: Small Objects (Should) Matter in Scene Flow" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 605, + 482, + 665 + ], + "type": "text", + "content": "As shown in Fig. 1 (and further in Fig. 8), existing scene flow methods consistently struggle to describe the motion of safety-critical objects like pedestrians. However, these failures are not captured by Threeway EPE because these objects are small and have few points. Specifically, Threeway EPE's Foreground Dynamic category is dominated by large, common objects with many points like" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 152, + 113, + 462, + 253 + ], + "blocks": [ + { + "bbox": [ + 152, + 113, + 462, + 253 + ], + "lines": [ + { + "bbox": [ + 152, + 113, + 462, + 253 + ], + "spans": [ + { + "bbox": [ + 152, + 113, + 462, + 253 + ], + "type": "image", + "image_path": "7eee1aa28f67589199ce68df7bf9e24b1436a02bdbbc53df18c64ffc13ec4e46.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 262, + 482, + 307 + ], + "lines": [ + { + "bbox": [ + 131, + 262, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 131, + 262, + 482, + 307 + ], + "type": "text", + "content": "Fig. 2: Number of points from each semantic meta-class for Argoverse 2's val split. Although PEDESTRIAN instances are common, they contribute less than " + }, + { + "bbox": [ + 131, + 262, + 482, + 307 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 131, + 262, + 482, + 307 + ], + "type": "text", + "content": " of the total number of points owing to their small instance size relative to CAR and OTHER VEHICLES. Number of points (Y axis) shown on a log scale." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 331, + 479, + 365 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 479, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 479, + 365 + ], + "type": "text", + "content": "cars and other vehicles. As shown in Fig. 2, " + }, + { + "bbox": [ + 130, + 331, + 479, + 365 + ], + "type": "inline_equation", + "content": "15\\%" + }, + { + "bbox": [ + 130, + 331, + 479, + 365 + ], + "type": "text", + "content": " of all points are from cars or other vehicles (dominating Foreground Dynamic's Average EPE), while fewer than " + }, + { + "bbox": [ + 130, + 331, + 479, + 365 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 331, + 479, + 365 + ], + "type": "text", + "content": " of points are from pedestrians and other vulnerable road users (VRUs)." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "content": "Additionally, Threeway EPE fails to account for large differences in speed across objects. For example, a " + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{m / s}" + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "content": " estimation error on a car moving " + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "inline_equation", + "content": "20\\mathrm{m / s}" + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "content": " is negligible " + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "inline_equation", + "content": "(< 2.5\\%)" + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "content": ", while a " + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{m / s}" + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "content": " estimation error on a pedestrian moving " + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "inline_equation", + "content": "0.5\\mathrm{m / s}" + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "content": " fails to describe " + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 366, + 480, + 426 + ], + "type": "text", + "content": " of the pedestrian's motion. However, Threeway EPE treats both estimation errors equally." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 426, + 480, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 480, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 480, + 510 + ], + "type": "text", + "content": "We address these two limitations with our Bucket Normalized EPE metric. First, our proposed metric breaks down the object distribution using a taxonomy that human labelers have deemed important (similar to mean Average Precision [23], see Appendix C for discussion on semantics-free evaluation). Second, our proposed metric allows us to contextualize the percentage of object motion being described by normalizing for the speed of the object, allowing us to directly compare performance across object categories." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 511, + 480, + 558 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 511, + 480, + 558 + ], + "spans": [ + { + "bbox": [ + 130, + 511, + 480, + 558 + ], + "type": "text", + "content": "We implement our class-aware and speed-normalized metric by accumulating every point into a class-speed matrix (e.g. Appendix B, Table 4) based on its ground truth speed and class, recording an Average EPE as well as a per-bucket average speed. To summarize these results, we report two numbers per class:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 569, + 480, + 630 + ], + "type": "list", + "angle": 0, + "index": 10, + "blocks": [ + { + "bbox": [ + 138, + 569, + 479, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 569, + 479, + 592 + ], + "spans": [ + { + "bbox": [ + 138, + 569, + 479, + 592 + ], + "type": "text", + "content": "- Static EPE, taken directly from the Average EPE of the first speed bucket for that class (i.e. the first column of Appendix B, Table 4)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 594, + 480, + 630 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 594, + 480, + 630 + ], + "spans": [ + { + "bbox": [ + 138, + 594, + 480, + 630 + ], + "type": "text", + "content": "- Dynamic Normalized EPE, computed from a mean over the Normalized EPE " + }, + { + "bbox": [ + 138, + 594, + 480, + 630 + ], + "type": "inline_equation", + "content": "\\left(\\frac{\\text{Average EPE}}{\\text{average speed}}\\right)" + }, + { + "bbox": [ + 138, + 594, + 480, + 630 + ], + "type": "text", + "content": " of each non-empty speed bucket (i.e. an average across the Normalized EPEs of the second column onwards in Appendix B, Table 4)" + } + ] + } + ], + "index": 9 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": "Dynamic Normalized EPE measures the fraction of motion not described by the estimated flow vectors across the entire speed spectrum. A method that only" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 149, + 114, + 461, + 192 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 461, + 192 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 461, + 192 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 461, + 192 + ], + "type": "table", + "html": "
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND0.002402-
CAR0.0184420.182092
OTHER VEHICLES0.0814750.312882
PEDESTRIAN0.0528420.396849
WHEELED VRU0.0625730.257647
", + "image_path": "b9f8782ad3cf989a18a20d2ded1efef8e71b6cf80e8182366effe625a89556cf.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 205, + 482, + 272 + ], + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 272 + ], + "type": "text", + "content": "Table 1: TrackFlow's Bucket Normalized EPE on the Argoverse 2 test split. Similar to Threeway EPE, we breakdown our evaluation into static and dynamic buckets. However, we also further breakdown performance by meta-categories and normalize by speed to compare performance disparities on safety-critical categories. TrackFlow is able to capture most dynamic car motion (lower is better), but performs considerably worse on other vehicles and pedestrian." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "text", + "content": "predicts ego motion (e.g. " + }, + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\vec{0}" + }, + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "text", + "content": " after ego-motion compensation) will achieve 1.0 Dynamic Normalized EPE, and a method that perfectly describes all motion will have 0.0 Dynamic Normalized EPE. Methods may achieve errors greater than 1.0 by predicting errors with a magnitude greater than the average speed. For example, a method that describes the negative vector of true motion will get exactly 2.0 Dynamic Normalized EPE (every bucket's Average EPE will be exactly " + }, + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "inline_equation", + "content": "2\\times" + }, + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "text", + "content": " the magnitude of the average speed). The range of Dynamic Normalized EPE is between 0 (perfect) and " + }, + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\infty" + }, + { + "bbox": [ + 130, + 304, + 482, + 422 + ], + "type": "text", + "content": ", and is undefined for buckets without any points. After normalization, Dynamic Normalized EPE can be directly compared across classes." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 425, + 482, + 498 + ], + "type": "text", + "content": "We provide an example per-class performance breakdown in Table 1 for TrackFlow (Section 4). Results can be further summarized into a single tuple of mean Static EPE and mean Dynamic Normalized EPE by taking a mean across classes (similar to mean Average Precision [23]). TrackFlow has a mean Static EPE of 0.076277 and a mean Dynamic Normalized EPE of 0.287368. We rank methods according to their mean Dynamic Normalized EPE." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 515, + 370, + 531 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 515, + 370, + 531 + ], + "spans": [ + { + "bbox": [ + 131, + 515, + 370, + 531 + ], + "type": "text", + "content": "4 TrackFlow: Scene Flow via Tracking" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 541, + 482, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 541, + 482, + 638 + ], + "spans": [ + { + "bbox": [ + 130, + 541, + 482, + 638 + ], + "type": "text", + "content": "To highlight the failure of current supervised scene flow methods on smaller objects, we propose Scene Flow via Tracking, a simple framework that uses bounding box track motion from off-the-shelf 3D detectors and trackers to generate scene flow estimates (Fig. 3). We instantiate Scene Flow via Tracking with LE3DE2E [46]" + }, + { + "bbox": [ + 130, + 541, + 482, + 638 + ], + "type": "inline_equation", + "content": "^1" + }, + { + "bbox": [ + 130, + 541, + 482, + 638 + ], + "type": "text", + "content": ", a state-of-the-art 3D detector, and AB3DMOT [47], a Kalman filter-based 3D tracker. As shown in Section 5, TrackFlow achieves state-of-the-art performance on Threeway EPE and beats all prior art by a large margin on Bucket Normalized EPE." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 641, + 481, + 666 + ], + "type": "text", + "content": " LE3DE2E [46] is the winning method from the Argoverse 2 2023 3D Detection, Tracking and Forecasting challenge [33-35]." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 113, + 482, + 220 + ], + "blocks": [ + { + "bbox": [ + 132, + 113, + 482, + 220 + ], + "lines": [ + { + "bbox": [ + 132, + 113, + 482, + 220 + ], + "spans": [ + { + "bbox": [ + 132, + 113, + 482, + 220 + ], + "type": "image", + "image_path": "3959e984425ad728f619dbd89b2bc9ede735287f6cb57544c46305657f3b6446.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 228, + 482, + 262 + ], + "lines": [ + { + "bbox": [ + 130, + 228, + 482, + 262 + ], + "spans": [ + { + "bbox": [ + 130, + 228, + 482, + 262 + ], + "type": "text", + "content": "Fig. 3: Overview of the Scene Flow via Tracking framework. Our proposed framework generates scene flow estimates using rigid transformations to describe point-level motion within a 3D object track." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 284, + 482, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 284, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 482, + 403 + ], + "type": "text", + "content": "Scene Flow via Tracking works well in practice because it mimics the ground truth flow annotation process. Specifically, ground truth flow is generated using rigid transforms to describe point-level motion within ground truth 3D object tracks (Section 2.1). Therefore, a perfect 3D detector and tracker will achieve perfect flow. However, the power of TrackFlow isn't just derived from its use of bounding boxes; it also greatly benefits from recent advances in class-imbalanced learning [56]. As discussed in Section 2.4, modern detectors are trained with a variety of data augmentation techniques to achieve high precision and recall on all semantic class. TrackFlow leverages the strength of modern 3D detectors to significantly outperform prior art on pedestrians and other small objects." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 404, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 404, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 404, + 482, + 499 + ], + "type": "text", + "content": "Interestingly, we find that the Scene Flow via Tracking framework performs best when using detectors tuned to a low confidence threshold. Typically, detectors are optimized to only predict high confidence boxes (0.7 - 0.9) to minimize the number of false positives. However, our method works best when setting the confidence threshold lower (0.2 for TrackFlow) to increase recall. Specifically, we find that detectors with higher recall and more accurate heading estimation are better suited for Scene Flow via Tracking. We explore detector choice and ablate the impact of confidence thresholds further in Section 5.3." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 517, + 230, + 531 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 517, + 230, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 517, + 230, + 531 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 540, + 481, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 540, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 540, + 481, + 578 + ], + "type": "text", + "content": "In this section, we compare TrackFlow against state-of-the-art supervised and unsupervised scene flow methods like FastFlow3D [12], DeFlow [53], NSFP [18], and ZeroFlow [42] on the Argoverse 2 benchmark " + }, + { + "bbox": [ + 130, + 540, + 481, + 578 + ], + "type": "inline_equation", + "content": "[49]^2" + }, + { + "bbox": [ + 130, + 540, + 481, + 578 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 594, + 459, + 605 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 594, + 459, + 605 + ], + "spans": [ + { + "bbox": [ + 131, + 594, + 459, + 605 + ], + "type": "text", + "content": "5.1 TrackFlow Achieves SOTA Performance on Threeway EPE" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "spans": [ + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "text", + "content": "TrackFlow is state-of-the-art on Threeway EPE (Fig. 4a) on the Argoverse 2 benchmark [49], achieving an overall reduction of " + }, + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "inline_equation", + "content": "0.0015\\mathrm{m}" + }, + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "text", + "content": " (" + }, + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "inline_equation", + "content": "0.15\\mathrm{cm}" + }, + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "text", + "content": ", or " + }, + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "inline_equation", + "content": "1.5\\mathrm{mm}" + }, + { + "bbox": [ + 130, + 611, + 481, + 638 + ], + "type": "text", + "content": ")" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 299, + 91, + 448, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 299, + 91, + 448, + 101 + ], + "spans": [ + { + "bbox": [ + 299, + 91, + 448, + 101 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "type": "text", + "content": "2 All evaluations are performed with a maximum radius of " + }, + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "type": "inline_equation", + "content": "35\\mathrm{m}" + }, + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "type": "text", + "content": " from the ego vehicle to maintain consistency with Chodosh et al. [5]." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 305, + 270 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 305, + 270 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 305, + 270 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 305, + 270 + ], + "type": "image", + "image_path": "2e227c4126a0951cb9d4562f63db8fa895e356d79e497091a393966fb08cee95.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 187, + 270, + 257, + 281 + ], + "lines": [ + { + "bbox": [ + 187, + 270, + 257, + 281 + ], + "spans": [ + { + "bbox": [ + 187, + 270, + 257, + 281 + ], + "type": "text", + "content": "(a) Threeway EPE" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 289, + 482, + 356 + ], + "lines": [ + { + "bbox": [ + 130, + 289, + 482, + 356 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 482, + 356 + ], + "type": "text", + "content": "Fig. 4: Threeway EPE and Threeway EPE's Foreground Dynamic performance of recent supervised and unsupervised scene flow methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color is consistent between plots. We find that all recent methods achieve " + }, + { + "bbox": [ + 130, + 289, + 482, + 356 + ], + "type": "inline_equation", + "content": "5\\mathrm{cm}" + }, + { + "bbox": [ + 130, + 289, + 482, + 356 + ], + "type": "text", + "content": " error on Threeway EPE, suggesting that these approaches work well in-the-wild. However, this number hides the failure of these methods to describe small object motion." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 307, + 113, + 477, + 270 + ], + "blocks": [ + { + "bbox": [ + 307, + 113, + 477, + 270 + ], + "lines": [ + { + "bbox": [ + 307, + 113, + 477, + 270 + ], + "spans": [ + { + "bbox": [ + 307, + 113, + 477, + 270 + ], + "type": "image", + "image_path": "8be72f05938353d3d1f72e9330835ed14dc53ca159d36a88514f62b59d0c7710.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 315, + 270, + 468, + 281 + ], + "lines": [ + { + "bbox": [ + 315, + 270, + 468, + 281 + ], + "spans": [ + { + "bbox": [ + 315, + 270, + 468, + 281 + ], + "type": "text", + "content": "(b) Threeway EPE's Foreground Dynamic" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 380, + 482, + 417 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 417 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 417 + ], + "type": "text", + "content": "over the next best method, ZeroFlow XL 5x. Notably, this improvement can be attributed to significantly better Threeway EPE's Dynamic Foreground (Fig. 4b). Is this performance difference meaningful?" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 418, + 483, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 483, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 483, + 502 + ], + "type": "text", + "content": "Based on our reduction of " + }, + { + "bbox": [ + 130, + 418, + 483, + 502 + ], + "type": "inline_equation", + "content": "1.5\\mathrm{mm}" + }, + { + "bbox": [ + 130, + 418, + 483, + 502 + ], + "type": "text", + "content": " on Threeway EPE (about " + }, + { + "bbox": [ + 130, + 418, + 483, + 502 + ], + "type": "inline_equation", + "content": "4\\times" + }, + { + "bbox": [ + 130, + 418, + 483, + 502 + ], + "type": "text", + "content": " the thickness of a human fingernail), it would seem that TrackFlow is only an incremental improvement over prior art. However, TrackFlow qualitatively outperforms prior work on important small objects such as pedestrians (Fig. 1, Fig. 8). As shown in the next section, our proposed evaluation protocol Bucket Normalized EPE makes it quantitatively clear that TrackFlow performs significantly better on safety-critical categories like pedestrians and VRUs." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 522, + 473, + 536 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 522, + 473, + 536 + ], + "spans": [ + { + "bbox": [ + 131, + 522, + 473, + 536 + ], + "type": "text", + "content": "5.2 Bucket Normalized EPE Highlights Failures on Small Objects" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "content": "Evaluating existing state-of-the-art methods on our class-aware, speed-normalized evaluation, Bucket Normalized EPE, makes it clear that TrackFlow meaningfully outperforms prior art (Fig. 6) — TrackFlow correctly describes almost " + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "content": " additional total motion across meta-classes compared to DeFlow [53]. This difference in dynamic performance becomes even more clear when broken down by meta-class: Fig. 5 shows that TrackFlow is the only method able to describe more than " + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "content": " of pedestrian motion, beating DeFlow [53] by more than " + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "content": " (Fig. 5c), a " + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "inline_equation", + "content": "1.5 \\times" + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "content": " improvement. Similarly, other state-of-the-art methods like NSFP [18] and ZeroFlow XL 5x [42] describe less than " + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "inline_equation", + "content": "30\\%" + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 545, + 483, + 666 + ], + "type": "text", + "content": " of pedestrian motion, respectively." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 113, + 306, + 206 + ], + "blocks": [ + { + "bbox": [ + 137, + 113, + 306, + 206 + ], + "lines": [ + { + "bbox": [ + 137, + 113, + 306, + 206 + ], + "spans": [ + { + "bbox": [ + 137, + 113, + 306, + 206 + ], + "type": "image", + "image_path": "2d4d3542d9f5fe8431e2f85d72b59b02b0f356d44b2933f718f2da7cca06c136.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 312, + 113, + 471, + 207 + ], + "blocks": [ + { + "bbox": [ + 312, + 113, + 471, + 207 + ], + "lines": [ + { + "bbox": [ + 312, + 113, + 471, + 207 + ], + "spans": [ + { + "bbox": [ + 312, + 113, + 471, + 207 + ], + "type": "image", + "image_path": "13a44603e3b35cdc80a121993f3568576d38a9d5d39003db742282d007c4d043.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 138, + 217, + 306, + 311 + ], + "blocks": [ + { + "bbox": [ + 209, + 209, + 236, + 218 + ], + "lines": [ + { + "bbox": [ + 209, + 209, + 236, + 218 + ], + "spans": [ + { + "bbox": [ + 209, + 209, + 236, + 218 + ], + "type": "text", + "content": "(a) CAR" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 138, + 217, + 306, + 311 + ], + "lines": [ + { + "bbox": [ + 138, + 217, + 306, + 311 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 306, + 311 + ], + "type": "image", + "image_path": "6d5dc4c161fe2d1cd55f405c3df3ad70c33fea71ce799e6da8bb3849958c7593.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 196, + 313, + 249, + 322 + ], + "lines": [ + { + "bbox": [ + 196, + 313, + 249, + 322 + ], + "spans": [ + { + "bbox": [ + 196, + 313, + 249, + 322 + ], + "type": "text", + "content": "(c) PEDESTRIAN" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 331, + 482, + 399 + ], + "lines": [ + { + "bbox": [ + 130, + 331, + 482, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 482, + 399 + ], + "type": "text", + "content": "Fig. 5: Per meta-class Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Method color and position is consistent between plots. TrackFlow significantly improves over prior work on both pedestrian and wheeled VRUs. Notably, Bucket Normalized EPE quantitatively demonstrates significant method performance differences not highlighted in Threeway EPE." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 312, + 217, + 471, + 311 + ], + "blocks": [ + { + "bbox": [ + 358, + 209, + 426, + 218 + ], + "lines": [ + { + "bbox": [ + 358, + 209, + 426, + 218 + ], + "spans": [ + { + "bbox": [ + 358, + 209, + 426, + 218 + ], + "type": "text", + "content": "(b) OTHER VEHICLES" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 312, + 217, + 471, + 311 + ], + "lines": [ + { + "bbox": [ + 312, + 217, + 471, + 311 + ], + "spans": [ + { + "bbox": [ + 312, + 217, + 471, + 311 + ], + "type": "image", + "image_path": "f6881465c6859e08d145d57036d3efba6d56dbf99c49d672a10959c116c7849f.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 364, + 312, + 421, + 323 + ], + "lines": [ + { + "bbox": [ + 364, + 312, + 421, + 323 + ], + "spans": [ + { + "bbox": [ + 364, + 312, + 421, + 323 + ], + "type": "text", + "content": "(d) WHEELLED VRU" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 420, + 482, + 480 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 420, + 482, + 480 + ], + "spans": [ + { + "bbox": [ + 130, + 420, + 482, + 480 + ], + "type": "text", + "content": "Bucket Normalized EPE allows practitioners to effectively compare performance between methods that were almost indistinguishable under Threeway EPE. For example, if you only care about flow performance on cars, DeFlow out-performs all other methods including TrackFlow (Fig. 5a), while ZeroFlow XL 5x out-performs all other methods on larger vehicles (Fig. 5b)." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 497, + 392, + 509 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 497, + 392, + 509 + ], + "spans": [ + { + "bbox": [ + 131, + 497, + 392, + 509 + ], + "type": "text", + "content": "5.3 What Makes a Good Detector for TrackFlow?" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 516, + 481, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 516, + 481, + 539 + ], + "spans": [ + { + "bbox": [ + 130, + 516, + 481, + 539 + ], + "type": "text", + "content": "As discussed in Section 4, we tune Scene Flow via Tracking with a low confidence threshold to maximize recall. What makes a good detector for TrackFlow?" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "spans": [ + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "text", + "content": "We ablate the impact of detector quality on TrackFlow by replacing LE3DE2E [46] with BEVFusion [26]. We call this new approach TrackFlowBEVF. BEVFusion only has " + }, + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "text", + "content": " lower mAP than LE3DE2E on the AV2 detection leaderboard3, but we find that TrackFlowBEVF performs significantly worse than TrackFlow, with " + }, + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "inline_equation", + "content": "22\\%" + }, + { + "bbox": [ + 130, + 540, + 482, + 600 + ], + "type": "text", + "content": " drops in performance on Dynamic Normalized EPE (Table 2)." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 600, + 482, + 636 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 600, + 482, + 636 + ], + "spans": [ + { + "bbox": [ + 130, + 600, + 482, + 636 + ], + "type": "text", + "content": "This significant degradation is the result of BEVFusion's poor recall at low confidence thresholds (Table 3). In contrast, LE3DE2E has very high recall at low thresholds (Fig. 7), producing many candidate boxes for pedestrians in the" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 641, + 482, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 133, + 641, + 482, + 666 + ], + "type": "text", + "content": " BEVFusion [26] was second on the Argoverse 2 2023 3D Detection, Tracking and Forecasting challenge [33-35]." + } + ] + } + ], + "index": 16 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 114, + 477, + 310 + ], + "blocks": [ + { + "bbox": [ + 138, + 114, + 477, + 310 + ], + "lines": [ + { + "bbox": [ + 138, + 114, + 477, + 310 + ], + "spans": [ + { + "bbox": [ + 138, + 114, + 477, + 310 + ], + "type": "image", + "image_path": "208570372b3b9002c83ad76845837946224efec5965ec59ccb9fe98e62f5723f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 319, + 482, + 374 + ], + "lines": [ + { + "bbox": [ + 130, + 319, + 482, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 319, + 482, + 374 + ], + "type": "text", + "content": "Fig. 6: Average Dynamic Normalized EPE of recent supervised and unsupervised scene flow estimation methods on Argoverse 2's test split. Supervised methods shown with hatching. Lower is better. Our simple baseline achieves state-of-the-art performance, suggesting that supervised scene flow methods should embrace point-level class rebalancing." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 138, + 390, + 476, + 567 + ], + "blocks": [ + { + "bbox": [ + 138, + 390, + 476, + 567 + ], + "lines": [ + { + "bbox": [ + 138, + 390, + 476, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 390, + 476, + 567 + ], + "type": "image", + "image_path": "6dc0130204eeb8305c383cc350ab44ad47a7bd4ad984fc93833f657d4a4f01b2.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 578, + 482, + 624 + ], + "lines": [ + { + "bbox": [ + 130, + 578, + 482, + 624 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 482, + 624 + ], + "type": "text", + "content": "Fig. 7: A qualitative comparison of the recall of BEVFusion and LE3DE2E. LE3DE2E has much higher recall, allowing it to pick out pedestrians BEVFusion missed (circled in red), and better quality box heading estimates. Both detectors are using a confidence threshold of 0.2." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 628, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 628, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 628, + 482, + 665 + ], + "type": "text", + "content": "scene. BEVFusion's false negatives are extremely costly to TrackFlowBEVF, as they result in " + }, + { + "bbox": [ + 130, + 628, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\vec{0}" + }, + { + "bbox": [ + 130, + 628, + 482, + 665 + ], + "type": "text", + "content": " flow estimates that miss " + }, + { + "bbox": [ + 130, + 628, + 482, + 665 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 628, + 482, + 665 + ], + "type": "text", + "content": " of each false positive pedestrian's motion." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 149, + 114, + 461, + 193 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 461, + 193 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 461, + 193 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 461, + 193 + ], + "type": "table", + "html": "
ClassStatic (Avg EPE)Dynamic (Norm EPE)
BACKGROUND-0.000228-
CAR+0.039049+0.117944
OTHER VEHICLES+0.009013+0.224830
PEDESTRIAN+0.007187+0.224250
WHEELED VRU-0.025889+0.151373
", + "image_path": "87231a22d5785ed90c8fc808d61f34e72fc0b5faef7326b0c7ec1e0614454c85.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 162, + 291, + 449, + 350 + ], + "blocks": [ + { + "bbox": [ + 130, + 205, + 482, + 270 + ], + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 270 + ], + "type": "text", + "content": "Table 2: Relative Bucket Normalized EPE performance of TrackFlowBEVF compared to TrackFlow, on the Argoverse 2's test split. Increases in error (worse) are shown with a + in red, and decreases in error (better) are shown with a - in green. TrackFlow's absolute results are shown in Table 1.BEVFusion only has " + }, + { + "bbox": [ + 130, + 205, + 482, + 270 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 205, + 482, + 270 + ], + "type": "text", + "content": " lower mAP than LE3DE2E on the AV2 detection leaderboard, but performs significantly worse than TrackFlow on Dynamic Normalized EPE." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 162, + 291, + 449, + 350 + ], + "lines": [ + { + "bbox": [ + 162, + 291, + 449, + 350 + ], + "spans": [ + { + "bbox": [ + 162, + 291, + 449, + 350 + ], + "type": "table", + "html": "
ConfidenceMean Dynamic Norm EPE
0.10.4816
0.20.4643
0.30.6008
0.40.8176
", + "image_path": "113fd34f950f142ea67ca9a3b33b8b13dd900ebdc9b88abd0b197dacadc7ad63.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 361, + 482, + 396 + ], + "lines": [ + { + "bbox": [ + 130, + 361, + 482, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 482, + 396 + ], + "type": "text", + "content": "Table 3: Mean Dynamic Bucketed EPE values for TrackFlowBEVF using various confidence thresholds for the detector. Lower confidence with higher recall significantly improve Dynamic Norm EPE performance." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "text", + "content": "More broadly, a good detector for Scene Flow via Tracking isn't necessarily one with a high mAP; it's one with very high recall and accurate heading estimates. Notably, these error characteristics enable the tracker to reject false positives. We believe this interaction between the detector and tracker is an important yet subtle point — two detectors may have the same mAP, but dramatically different performance in our Scene Flow via Tracking framework." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 520, + 220, + 533 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 520, + 220, + 533 + ], + "spans": [ + { + "bbox": [ + 131, + 520, + 220, + 533 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "In this work, we highlight that current scene flow methods consistently fail to describe motion on pedestrians and other small objects. We demonstrate that current standard evaluation metrics hide this failure and present Bucket Normalized EPE, a new class-aware, speed normalized evaluation protocol, to quantify this failure. In addition, we present TrackFlow, a frustratingly simple supervised scene flow baseline that achieves state-of-the-art on Threeway EPE and Bucket Normalized EPE. We argue that current evaluation protocols fail to reveal performance across the distribution of safety-critical objects, and do not contextualize absolute errors in the context of an object's speed. Moreover, we highlight that class and speed aware evaluation is important even if a method has zero human" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 113, + 480, + 398 + ], + "blocks": [ + { + "bbox": [ + 134, + 113, + 480, + 398 + ], + "lines": [ + { + "bbox": [ + 134, + 113, + 480, + 398 + ], + "spans": [ + { + "bbox": [ + 134, + 113, + 480, + 398 + ], + "type": "image", + "image_path": "02c1df415cbcd32d0dec305c9688d1a3a4f21c015ee928a778b061f114e5c497.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 137, + 408, + 247, + 418 + ], + "lines": [ + { + "bbox": [ + 137, + 408, + 247, + 418 + ], + "spans": [ + { + "bbox": [ + 137, + 408, + 247, + 418 + ], + "type": "text", + "content": "(a) Ground Truth (b) FastFlow3D" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 261, + 409, + 298, + 418 + ], + "lines": [ + { + "bbox": [ + 261, + 409, + 298, + 418 + ], + "spans": [ + { + "bbox": [ + 261, + 409, + 298, + 418 + ], + "type": "text", + "content": "(c) DeFlow" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 321, + 409, + 354, + 418 + ], + "lines": [ + { + "bbox": [ + 321, + 409, + 354, + 418 + ], + "spans": [ + { + "bbox": [ + 321, + 409, + 354, + 418 + ], + "type": "text", + "content": "(d) NSFP" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 372, + 409, + 414, + 418 + ], + "lines": [ + { + "bbox": [ + 372, + 409, + 414, + 418 + ], + "spans": [ + { + "bbox": [ + 372, + 409, + 414, + 418 + ], + "type": "text", + "content": "(e) ZeroFlow" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 424, + 409, + 473, + 418 + ], + "lines": [ + { + "bbox": [ + 424, + 409, + 473, + 418 + ], + "spans": [ + { + "bbox": [ + 424, + 409, + 473, + 418 + ], + "type": "text", + "content": "(f) TrackFlow" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 132, + 426, + 480, + 449 + ], + "lines": [ + { + "bbox": [ + 132, + 426, + 480, + 449 + ], + "spans": [ + { + "bbox": [ + 132, + 426, + 480, + 449 + ], + "type": "text", + "content": "Fig. 8: Visualizations of different methods on diverse scenes in Argoverse 2. Each method is estimating flow from the blue to the green point cloud." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 135, + 456, + 480, + 654 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 135, + 456, + 480, + 478 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 456, + 480, + 478 + ], + "spans": [ + { + "bbox": [ + 135, + 456, + 480, + 478 + ], + "type": "text", + "content": "Row 1: Two pedestrians in left foreground with cars moving in the background. Track-Flow is the only method able to describe the pedestrian motion." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 135, + 479, + 480, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 479, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 135, + 479, + 480, + 521 + ], + "type": "text", + "content": "Row 2: Three pedestrians walking across an intersection in front of a stationary car. DeFlow is able to capture the furthest pedestrian, but only TrackFlow is able to capture the motion of all three. TrackFlow also falsely estimates motion of the moving box truck in the background." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 135, + 522, + 480, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 522, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 135, + 522, + 480, + 555 + ], + "type": "text", + "content": "Row 3: Top view of pedestrians walking down the sidewalk between a building and several cars parked in the street. TrackFlow is the only method able to describe the pedestrian motion." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 135, + 555, + 480, + 577 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 555, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 135, + 555, + 480, + 577 + ], + "type": "text", + "content": "Row 4: Pedestrians walking down the sidewalk next to a moving car. TrackFlow is the only method able to describe the pedestrian motion." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 135, + 577, + 480, + 610 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 577, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 135, + 577, + 480, + 610 + ], + "type": "text", + "content": "Row 5: Two bicyclists riding across an intersection next to driving cars. Most methods are able to capture the training bicyclists and the moving cars, but only NSFP and TrackFlow are able to capture the lead bicyclist." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 135, + 610, + 480, + 654 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 610, + 480, + 654 + ], + "spans": [ + { + "bbox": [ + 135, + 610, + 480, + 654 + ], + "type": "text", + "content": "Row 6: Two pedestrians walk across an intersection while a car drives parallel to them. All methods capture the car motion, but only DeFlow, NSFP, and TrackFlow capture most of the pedestrian motion. TrackFlow also falsely estimates motion of one of the parked cars far down the street in the background." + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "supervision. Importantly, we cannot expect any method to meaningfully generalize to the long tail of unknown objects if it cannot provide high quality motion descriptions on a known set of objects. Lastly, TrackFlow outperforms prior art by a wide margin because it leverages recent advances in class imbalanced learning. Our approach highlights that supervised scene flow methods should adopt many of the lessons learned by the detection community to properly address class and point imbalances." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 218, + 218, + 228 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 218, + 218, + 228 + ], + "spans": [ + { + "bbox": [ + 131, + 218, + 218, + 228 + ], + "type": "text", + "content": "6.1 Limitations" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 237, + 481, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 237, + 481, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 481, + 297 + ], + "type": "text", + "content": "TrackFlow only predicts rigid flow for objects within LE3DE2E's fixed taxonomy because it uses a closed-world bounding box based detector. However, as discussed in Appendix D, these limitations can be addressed with a different detector architectures, and is not a fundamental limitations of the Scene Flow via Tracking framework." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 297, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 297, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 297, + 482, + 369 + ], + "type": "text", + "content": "Acknowledgements: This work was supported in part by funding from the NSF GRFP (Grant No. DGE2140739). This work was in part supported by the Army Research Office under MURI award W911NF20-1-0080. Any opinions, findings, conclusions, or recommendations expressed in this material are those of the authors and do not necessarily reflect the view of the Army or the US government." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 388, + 198, + 400 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 388, + 198, + 400 + ], + "spans": [ + { + "bbox": [ + 132, + 388, + 198, + 400 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 136, + 413, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 136, + 413, + 480, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 413, + 480, + 446 + ], + "spans": [ + { + "bbox": [ + 136, + 413, + 480, + 446 + ], + "type": "text", + "content": "1. Battrawy, R., Schuster, R., Mahani, M.A.N., Stricker, D.: RMS-FlowNet: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Clouds. In: Int. Conf. Rob. Aut. pp. 883-889. IEEE (2022) 3" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 136, + 447, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 447, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 136, + 447, + 480, + 479 + ], + "type": "text", + "content": "2. Baur, S.A., Emmerichs, D.J., Moosmann, F., Pinggera, P., Ommer, B., Geiger, A.: SLIM: Self-supervised LiDAR scene flow and motion segmentation. In: Int. Conf. Comput. Vis. pp. 13126-13136 (2021) 2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 136, + 479, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 479, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 136, + 479, + 480, + 511 + ], + "type": "text", + "content": "3. Behl, A., Paschalidou, D., Donne, S., Geiger, A.: Pointflownet: Learning representations for rigid motion estimation from point clouds. In: Int. Conf. Comput. Vis. pp. 7962-7971 (2019) 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 136, + 512, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 512, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 136, + 512, + 480, + 544 + ], + "type": "text", + "content": "4. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuScenes: A multimodal dataset for autonomous driving. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 11621-11631 (2020) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 136, + 545, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 545, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 136, + 545, + 480, + 566 + ], + "type": "text", + "content": "5. Chodosh, N., Ramanan, D., Lucey, S.: Re-Evaluating LiDAR Scene Flow for Autonomous Driving. arXiv preprint (2023) 2, 3, 4, 7" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 136, + 567, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 567, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 136, + 567, + 480, + 588 + ], + "type": "text", + "content": "6. Dewan, A., Caselitz, T., Tipaldi, G.D., Burgard, W.: Rigid scene flow for 3d lidar scans. In: Int. Conf. Intel. Rob. Sys. pp. 1765-1770. IEEE (2016) 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 136, + 589, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 589, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 136, + 589, + 480, + 643 + ], + "type": "text", + "content": "7. Erçelik, E., Yurtsever, E., Liu, M., Yang, Z., Zhang, H., Topçam, P., Listl, M., Çaylı, Y.K., Knoll, A.: 3D Object Detection with a Self-supervised Lidar Scene Flow Backbone. In: Avidan, S., Brostow, G., Cisse, M., Farinella, G.M., Hassner, T. (eds.) Computer Vision - ECCV 2022. pp. 247-265. Springer Nature Switzerland, Cham (2022) 2" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 136, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 136, + 643, + 480, + 665 + ], + "type": "text", + "content": "8. Girshick, R.: Fast R-CNN. In: 2015 IEEE International Conference on Computer Vision (ICCV). pp. 1440-1448 (2015) 19" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 299, + 91, + 447, + 101 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 135, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 135, + 116, + 481, + 149 + ], + "type": "text", + "content": "9. Gojcic, Z., Litany, O., Wieser, A., Guibas, L.J., Birdal, T.: Weakly supervised learning of rigid 3d scene flow. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 5692-5703 (2021) 4" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 184 + ], + "type": "text", + "content": "10. Gu, X., Wang, Y., Wu, C., Lee, Y.J., Wang, P.: Hplflownet: Hierarchical permutohedral lattice flownet for scene flow estimation on large-scale point clouds. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 3254-3263 (2019) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 481, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 481, + 239 + ], + "type": "text", + "content": "11. Huang, X., Wang, Y., Guizilini, V.C., Ambrus, R.A., Gaidon, A., Solomon, J.: Representation Learning for Object Detection from Unlabeled Point Cloud Sequences. In: Liu, K., Kulic, D., Ichnowski, J. (eds.) Proceedings of The 6th Conference on Robot Learning (CoRL). Proceedings of Machine Learning Research, vol. 205, pp. 1277-1288 (2023) 19" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 239, + 481, + 272 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 239, + 481, + 272 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 481, + 272 + ], + "type": "text", + "content": "12. Jund, P., Sweeney, C., Abdo, N., Chen, Z., Shlens, J.: Scalable Scene Flow From Point Clouds in the Real World. IEEE Robotics and Automation Letters (12 2021) 1, 2, 3, 7, 17" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "text", + "content": "13. Kim, D., Lin, T.Y., Angelova, A., Kweon, I.S., Kuo, W.: Learning open-world object proposals without learning to classify. IEEE Robotics and Automation Letters (RA-L) (2022) 19" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 307, + 481, + 338 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 307, + 481, + 338 + ], + "spans": [ + { + "bbox": [ + 132, + 307, + 481, + 338 + ], + "type": "text", + "content": "14. Kim, J., Woo, J., Shin, U., Oh, J., Im, S.: Flow4D: Leveraging 4D Voxel Network for LiDAR Scene Flow Estimation (2024), https://arxiv.org/abs/2407.07995" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 340, + 481, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 340, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 132, + 340, + 481, + 373 + ], + "type": "text", + "content": "15. Kittenplon, Y., Eldar, Y.C., Raviv, D.: Flowstep3d: Model unrolling for self-supervised scene flow estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 4114-4123 (2021) 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 374, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 374, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 374, + 481, + 418 + ], + "type": "text", + "content": "16. Lang, A., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: PointPillars: Fast Encoders for Object Detection From Point Clouds. In: Proceedings of the 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 12689-12697 (2019) 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 418, + 481, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 481, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 481, + 452 + ], + "type": "text", + "content": "17. Li, R., Lin, G., He, T., Liu, F., Shen, C.: HCRF-Flow: Scene flow from point clouds with continuous high-order CRFs and position-aware flow embedding. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 364-373 (2021) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 452, + 481, + 474 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 452, + 481, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 452, + 481, + 474 + ], + "type": "text", + "content": "18. Li, X., Pontes, J.K., Lucey, S.: Neural Scene Flow Prior. Advances in Neural Information Processing Systems 34 (2021) 1, 2, 4, 7, 8" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "text", + "content": "19. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast neural scene flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 4" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 509, + 481, + 541 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 541 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 541 + ], + "type": "text", + "content": "20. Li, X., Zheng, J., Ferroni, F., Pontes, J.K., Lucey, S.: Fast Neural Scene Flow. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 9878-9890 (October 2023) 17" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 542, + 481, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 542, + 481, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 542, + 481, + 563 + ], + "type": "text", + "content": "21. Li, Y., Bu, R., Sun, M., Wu, W., Di, X., Chen, B.: Pointcnn: Convolution on x-transformed points. Adv. Neural Inform. Process. Syst. 31 (2018) 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 564, + 481, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 564, + 481, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 564, + 481, + 586 + ], + "type": "text", + "content": "22. Lin, T., Goyal, P., Girshick, R.B., He, K., Dollar, P.: Focal Loss for Dense Object Detection. In: ICCV 2017. pp. 2999-3007 (2017) 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 587, + 481, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 587, + 481, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 587, + 481, + 620 + ], + "type": "text", + "content": "23. Lin, T., Maire, M., Belongie, S.J., Bourdev, L.D., Girshick, R.B., Hays, J., Perona, P., Ramanan, D., Doll'a r, P., Zitnick, C.L.: Microsoft COCO: Common Objects in Context. CoRR (2014) 5, 6" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 620, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 620, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 620, + 481, + 632 + ], + "type": "text", + "content": "24. Lin, Y., Caesar, H.: ICP-Flow: LiDAR Scene Flow Estimation with ICP (2024) 17" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "25. Liu, X., Qi, C.R., Guibas, L.J.: FlowNet3D: Learning Scene Flow in 3D Point Clouds. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2019) 2, 3" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "26. Liu, Z., Tang, H., Amini, A., Yang, X., Mao, H., Rus, D., Han, S.: Bevfusion: Multi-task multi-sensor fusion with unified bird's-eye view representation. In: IEEE International Conference on Robotics and Automation (ICRA) (2023) 9" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 149, + 482, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 149, + 482, + 171 + ], + "spans": [ + { + "bbox": [ + 130, + 149, + 482, + 171 + ], + "type": "text", + "content": "27. Ma, Y., Peri, N., Wei, S., Hua, W., Ramanan, D., Li, Y., Kong, S.: Long-tailed 3d detection via 2d late fusion. arXiv preprint arXiv:2312.10986 (2023) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 171, + 482, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 171, + 482, + 214 + ], + "spans": [ + { + "bbox": [ + 130, + 171, + 482, + 214 + ], + "type": "text", + "content": "28. Mayer, N., Ilg, E., Häusser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A Large Dataset to Train Convolutional Networks for Disparity, Optical Flow, and Scene Flow Estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 214, + 482, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 214, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 214, + 482, + 236 + ], + "type": "text", + "content": "29. Menze, M., Heipke, C., Geiger, A.: Joint 3D Estimation of Vehicles and Scene Flow. In: ISPRS Workshop on Image Sequence Analysis (ISA) (2015) 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 236, + 482, + 257 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 257 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 257 + ], + "type": "text", + "content": "30. Menze, M., Heipke, C., Geiger, A.: Object Scene Flow. ISPRS Journal of Photogrammetry and Remote Sensing (JPRS) (2018) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 257, + 482, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 257, + 482, + 278 + ], + "spans": [ + { + "bbox": [ + 130, + 257, + 482, + 278 + ], + "type": "text", + "content": "31. Mittal, H., Okorn, B., Held, D.: Just Go With the Flow: Self-Supervised Scene Flow Estimation. In: IEEE Conf. Comput. Vis. Pattern Recog. (June 2020) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 278, + 482, + 310 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 482, + 310 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 482, + 310 + ], + "type": "text", + "content": "32. Najibi, M., Ji, J., Zhou, Y., Qi, C.R., Yan, X., Ettinger, S., Anguelov, D.: Motion Inspired Unsupervised Perception and Prediction in Autonomous Driving. European Conference on Computer Vision (ECCV) (2022) 2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 310, + 482, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 310, + 482, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 310, + 482, + 331 + ], + "type": "text", + "content": "33. Peri, N., Dave, A., Ramanan, D., Kong, S.: Towards Long Tailed 3D Detection. CoRL (2022) 4, 6, 9" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 331, + 482, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 482, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 482, + 363 + ], + "type": "text", + "content": "34. Peri, N., Li, M., Wilson, B., Wang, Y.X., Hays, J., Ramanan, D.: An empirical analysis of range for 3d object detection. arXiv preprint arXiv:2308.04054 (2023) 6, 9" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 363, + 482, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 363, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 363, + 482, + 407 + ], + "type": "text", + "content": "35. Peri, N., Luiten, J., Li, M., Osep, A., Leal-Taixe, L., Ramanan, D.: Forecasting from lidar via future object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17202-17211 (June 2022) 6, 9" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 407, + 482, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 429 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 429 + ], + "type": "text", + "content": "36. Pontes, J.K., Hays, J., Lucey, S.: Scene flow from point clouds with or without learning. In: Int. Conf. 3D Vis. pp. 261-270. IEEE (2020) 4" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 429, + 482, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 429, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 429, + 482, + 449 + ], + "type": "text", + "content": "37. Puy, G., Boulch, A., Marlet, R.: Flot: Scene flow on point clouds guided by optimal transport. In: Eur. Conf. Comput. Vis. pp. 527-544. Springer (2020) 3" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 449, + 482, + 471 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 471 + ], + "type": "text", + "content": "38. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I.: Improving language understanding by generative pre-training (2018) 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 471, + 482, + 503 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 471, + 482, + 503 + ], + "spans": [ + { + "bbox": [ + 130, + 471, + 482, + 503 + ], + "type": "text", + "content": "39. Ren, S., He, K., Girshick, R., Sun, J.: Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(6), 1137-1149 (2017) 19" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 503, + 482, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 503, + 482, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 503, + 482, + 568 + ], + "type": "text", + "content": "40. Sun, P., Kretzschmar, H., Dotiwalla, X., Chouard, A., Patnaik, V., Tsui, P., Guo, J., Zhou, Y., Chai, Y., Caine, B., Vasudevan, V., Han, W., Ngiam, J., Zhao, H., Timofeev, A., Ettinger, S., Krivokon, M., Gao, A., Joshi, A., Zhang, Y., Shlens, J., Chen, Z., Anguelov, D.: Scalability in Perception for Autonomous Driving: Waymo Open Dataset. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020) 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 568, + 482, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 568, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 568, + 482, + 601 + ], + "type": "text", + "content": "41. Tishchenko, I., Lombardi, S., Oswald, M.R., Pollefeys, M.: Self-supervised learning of non-rigid residual flow and ego-motion. In: Int. Conf. 3D Vis. pp. 150-159. IEEE (2020) 3" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 601, + 482, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 601, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 601, + 482, + 643 + ], + "type": "text", + "content": "42. Vedder, K., Peri, N., Chodosh, N., Khatri, I., Eaton, E., Jayaraman, D., Liu, Y., Ramanan, D., Hays, J.: ZeroFlow: Scalable Scene Flow via Distillation. In: Twelfth International Conference on Learning Representations (ICLR) (2024) 1, 2, 3, 4, 7, 8, 17" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 643, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 643, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 643, + 482, + 666 + ], + "type": "text", + "content": "43. Vedula, S., Baker, S., Rander, P., Collins, R., Kanade, T.: Three-dimensional scene flow. In: Int. Conf. Comput. Vis. vol. 2, pp. 722-729. IEEE (1999) 2" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 299, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 299, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 299, + 91, + 447, + 100 + ], + "type": "text", + "content": "I Can't Believe It's Not Scene Flow!" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 521 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "44. Vora, S., Lang, A.H., Helou, B., Beijbom, O.: Pointpainting: Sequential fusion for 3d object detection. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4604-4612 (2020) 4" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "text", + "content": "45. Wang, J., Li, X., Sullivan, A., Abbott, L., Chen, S.: PointMotionNet: PointWise Motion Learning for Large-Scale LiDAR Point Clouds Sequences. In: 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 4418-4427 (2022) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "46. Wang, Z., Chen, F., Lertniphonphan, K., Chen, S., Bao, J., Zheng, P., Zhang, J., Huang, K., Zhang, T.: Technical report for argoverse challenges on unified sensor-based detection, tracking, and forecasting (2023) 2, 6, 9" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 248 + ], + "type": "text", + "content": "47. Weng, X., Wang, J., Held, D., Kitani, K.: 3D Multi-Object Tracking: A Baseline and New Evaluation Metrics. IROS (2020) 2, 4, 6" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "text", + "content": "48. Weng, X., Wang, J., Levine, S., Kitani, K., Rhinehart, N.: Inverting the pose forecasting pipeline with spf2: Sequential pointcloud forecasting for sequential pose forecasting. In: Conference on robot learning. pp. 11-20. PMLR (2021) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 282, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 481, + 335 + ], + "type": "text", + "content": "49. Wilson, B., Qi, W., Agarwal, T., Lambert, J., Singh, J., Khandelwal, S., Pan, B., Kumar, R., Hartnett, A., Pontes, J.K., Ramanan, D., Carr, P., Hays, J.: Argoverse 2: Next Generation Datasets for Self-driving Perception and Forecasting. In: Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks (NeurIPS Datasets and Benchmarks 2021) (2021) 3, 7" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "50. Wu, W., Wang, Z.Y., Li, Z., Liu, W., Fuxin, L.: Pointpwc-net: Cost volume on point clouds for (self-) supervised scene flow estimation. In: Eur. Conf. Comput. Vis. pp. 88-107. Springer (2020) 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 370, + 481, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 370, + 481, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 370, + 481, + 391 + ], + "type": "text", + "content": "51. Yang, J., Zeng, A., Zhang, R., Zhang, L.: UniPose: Detection Any Keypoints. arXiv preprint arXiv:2310.08530 (2023) 19" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 413 + ], + "type": "text", + "content": "52. Zhai, G., Kong, X., Cui, J., Liu, Y., Yang, Z.: FlowMOT: 3D Multi-Object Tracking by Scene Flow Association. ArXiv abs/2012.07541 (2020) 2" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 413, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 481, + 435 + ], + "type": "text", + "content": "53. Zhang, Q., Yang, Y., Fang, H., Geng, R., Jensfelt, P.: DeFlow: Decoder of Scene Flow Network in Autonomous Driving. ICRA (2024) 1, 2, 3, 7, 8, 17" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 435, + 481, + 466 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 481, + 466 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 481, + 466 + ], + "type": "text", + "content": "54. Zhang, Q., Yang, Y., Li, P., Andersson, O., Jensfelt, P.: Seflow: A self-supervised scene flow method in autonomous driving. arXiv preprint arXiv:2407.01702 (2024) 17" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "type": "text", + "content": "55. Zheng, Y., Harley, A.W., Shen, B., Wetzstein, G., Guibas, L.J.: PointOdyssey: A Large-Scale Synthetic Dataset for Long-Term Point Tracking. In: ICCV (2023) 3" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 491, + 481, + 521 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 481, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 481, + 521 + ], + "type": "text", + "content": "56. Zhu, B., Jiang, Z., Zhou, X., Li, Z., Yu, G.: Class-balanced Grouping and Sampling for Point Cloud 3D Object Detection. arXiv preprint arXiv:1908.09492 (2019) 2, 4, 7" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "I. Khatri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_content_list.json b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..2a9de9f7e1112f46f4e8fbeb73f0c7ab5753051d --- /dev/null +++ b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_content_list.json @@ -0,0 +1,1795 @@ +[ + { + "type": "text", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "text_level": 1, + "bbox": [ + 282, + 140, + 718, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Xiaobao Wei $^{1,2,3,*}$ , Jiajun Cao $^{1,4,*}$ , Yizhu Jin $^{1,5}$ , Ming Lu $^{1}$ , Guangyu Wang $^{6}$ , and Shanghang Zhang $^{1,\\dagger}$", + "bbox": [ + 305, + 210, + 692, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ State Key Laboratory of Multimedia Information Processing, School of Computer Science, Peking University $^{2}$ University of Chinese Academy of Sciences $^{3}$ Institute of Software, Chinese Academy of Sciences $^{4}$ Xi'an Jiaotong University $^{5}$ Beihang University $^{6}$ Beijing University of Posts and Telecommunications weixiaobao0210@gmail.com", + "bbox": [ + 225, + 253, + 776, + 324 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. With the development of Deep Neural Networks (DNNs), many efforts have been made to handle medical image segmentation. Traditional methods such as nnUNet train specific segmentation models on the individual datasets. Plenty of recent methods have been proposed to adapt the foundational Segment Anything Model (SAM) to medical image segmentation. However, they still focus on discrete representations to generate pixel-wise predictions, which are spatially inflexible and scale poorly to higher resolution. In contrast, implicit methods learn continuous representations for segmentation, which is crucial for medical image segmentation. In this paper, we propose I-MedSAM, which leverages the benefits of both continuous representations and SAM, to obtain better cross-domain ability and accurate boundary delineation. Since medical image segmentation needs to predict detailed segmentation boundaries, we designed a novel adapter to enhance the SAM features with high-frequency information during Parameter-Efficient Fine-Tuning (PEFT). To convert the SAM features and coordinates into continuous segmentation output, we utilize Implicit Neural Representation (INR) to learn an implicit segmentation decoder. We also propose an uncertainty-guided sampling strategy for efficient learning of INR. Extensive evaluations on 2D medical image segmentation tasks have shown that our proposed method with only 1.6M trainable parameters outperforms existing methods including discrete and implicit methods. The code will be available at: https://github.com/ucwxb/I-MedSAM.", + "bbox": [ + 261, + 349, + 738, + 667 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Medical Image Segmentation $\\cdot$ Implicit Neural Representation $\\cdot$ Segment Anything", + "bbox": [ + 259, + 680, + 740, + 709 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 747, + 375, + 762 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Medical image segmentation, as a pivotal component of auxiliary disease diagnosis, holds a crucial role in medical image applications. The advent of deep", + "bbox": [ + 212, + 773, + 785, + 805 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Equal Contribution.", + "bbox": [ + 218, + 810, + 367, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "† Corresponding Author.", + "bbox": [ + 222, + 824, + 387, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/bb6ffe0efd6da3a6d6d4c3bb12c8a0fc399901924eca34597ec9c6d32f309fee.jpg", + "image_caption": [ + "(a) Illustrations of discrete and continuous representation for medical segmentation." + ], + "image_footnote": [], + "bbox": [ + 223, + 148, + 472, + 292 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/f1175b168ef2a0e9b9e70724fef231cab31571c85ef996025d78a4671b6b12cc.jpg", + "image_caption": [ + "(b) Segmentation quality comparison between our I-MedSAM and baselines.", + "Fig. 1: (a) Continuous representation with implicit decoders exhibits superior scale flexibility. (b) I-MedSAM with the fewest trainable params (1.6M) surpasses the state-of-the-art discrete and implicit approaches and exhibits a solid generalization ability when facing data shifts. Please refer to Sec. 4 for more experiment details." + ], + "image_footnote": [], + "bbox": [ + 488, + 161, + 790, + 296 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "learning has spurred the widespread adoption of neural networks customized for medical images. For example, nnUNet [37] leverages the downsampling and upsampling modules to aggregate multi-scale contextual features. Transformers [41] uses the self-attention mechanism to significantly augment the representation capacity of deep neural networks, improving the accuracy in medical image segmentation [5]. Recent advancements have witnessed the integration of foundation models as backbones in various works. The Segment Anything Model (SAM) [24] demonstrates unprecedented zero-shot segmentation ability. Therefore, diverse adapters based on parameter-efficient fine-tuning (PEFT) are crafted to fine-tune SAM for medical images [29, 42, 43, 46].", + "bbox": [ + 212, + 416, + 787, + 566 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Despite their notable effectiveness, these methods primarily focus on pixelwise or voxel-wise predictions [10,13,19,29,37,46]. While they achieve promising results, the discrete representations present challenges in spatial flexibility and introduce discretization artifacts when scaling to arbitrary input sizes. Additionally, the discrete representations give rise to ambiguity when extracting the nuanced details crucial for precise boundary delineation [31], which is important in medical image analysis. The delineation of boundaries can signify the transitions between different human tissues or anatomical structures, thus providing essential information for accurately separating these instances. Usually, the intricacy and subtlety of this delineation process need additional refinement [1,34].", + "bbox": [ + 212, + 568, + 787, + 718 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Compared with discrete representations, continuous representations learn Implicit Neural Representations (INRs) [32] to transform discrete representations into continuous space. As shown in Fig. 1a, numerous approaches learn a mapping from encoded image features and grid coordinates to the segmentation output, enabling adaptability to various output resolutions [22,33,36,47]. However, current approaches show unsatisfying domain transfer ability due to the limited representation capabilities of their pre-trained image encoders. Additionally, the boundary information of images demonstrates a strong correlation", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "with features in the frequency domain [11, 27], which is also ignored by most previous methodologies. Lastly, existing methods adopt random sampling across coordinates, underestimating the influence of sampling strategies when learning INRs.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To address the aforementioned limitations, we propose I-MedSAM, a model that leverages the benefits of both continuous representations and SAM, aiming to enhance cross-domain capabilities and achieve precise boundary delineation. Given the medical images, I-MedSAM extracts the features from SAM with the proposed frequency adapter, which aggregates high-frequency information from the frequency domain. These features along with the grid coordinates are decoded into segmentation outputs by the learned INRs. We employ a two-stage implicit segmentation decoder, consisting of two INRs in a coarse-to-fine manner. The first INR produces coarse segmentation results and features. Subsequently, a novel uncertainty-guided sampling strategy is applied to sample Top-K variance feature points along with their corresponding grid coordinates. Finally, these selected samples are fed into the second INR to obtain refined segmentation results. Notably, I-MedSAM is trained end-to-end with a minimal number of trainable parameters, yet it achieves state-of-the-art performance compared with all baseline methods. Our main contributions are summarized as follows:", + "bbox": [ + 212, + 207, + 787, + 434 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose I-MedSAM, a novel method that leverages the advantages of SAM and continuous representations.", + "- We propose a novel frequency adapter that utilizes high-frequency information to enhance features, thereby accurately segmenting boundaries.", + "- We propose a novel coarse-to-fine INR decoder with an uncertainty-guided sampling (UGS) strategy, to learn a mapping from features and coordinates to segmentation output.", + "- We perform detailed evaluations of I-MedSAM on 2D medical image segmentation. As shown in Fig. 1b, I-MedSAM outperforms state-of-the-art continuous and discrete methods. Experiments also demonstrate that I-MedSAM is robust to scale and domain shifts." + ], + "bbox": [ + 225, + 446, + 785, + 614 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 638, + 387, + 656 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Implicit Neural Representation. The concept of signal representation is fundamental across various domains, especially in the field of computer vision [31,32]. Traditional methods for encoding signals discretize the input space into pixel or voxel grids [4,6,7,9,10,15,19,37,38,46]. Different from these discrete methods, Implicit Neural Representation (INR) learns generator functions that map input coordinates into the signal values [8]. Numerous studies employ INR for diverse tasks, including medical data reconstruction, rendering, compression, registration, super-resolution and segmentation [2, 25, 30, 32, 44]. For segmentation, conventional methods typically consist of a trained feature encoder and a decoder. The encoder encodes medical data into features, and the decoder subsequently decodes features along with their coordinates into segmentation", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 236, + 114, + 730, + 130 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "output [17, 22, 23, 36, 39, 40, 45, 47]. However, current methods exhibit an imbalance in emphasizing either global or local features and demonstrate relatively low out-of-distribution ability. In contrast, our proposed approach leverages the segmentation foundation model SAM to enrich feature extraction. Moreover, we introduce an innovative uncertainty-guided sampling (UGS) strategy into the INR, enabling the adaptive selection of samples to train the implicit segmentation decoder. Please refer to the appendix for more related work.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 277, + 380, + 296 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we initially provide a concise overview of the implicit image segmentation problem. Then, we proceed to elaborate on the pipeline of I-MedSAM. Finally, we elucidate the novel designs introduced in I-MedSAM.", + "bbox": [ + 212, + 313, + 784, + 359 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/dc0e69c38b65636ec1a32cffdb70d892cd5ae75a2570334f566ea59da8e3d645.jpg", + "image_caption": [ + "Fig. 2: The overall pipeline of I-MedSAM. First, given the medical images and a coarse bounding box as a prompt, I-MedSAM utilizes the medical image encoder and the prompt encoder to generate discrete features. For the medical image encoder, we design low-rank adapters and frequency adapters to extract information from the spatial domain and frequency domain. Then I-MedSAM interpolates all features to align with the encoded coordinates and decodes them in coarse to fine neural fields. We propose an Uncertainty Guided Sampling (UGS) strategy to adaptively choose the highest variance points and refine predictions. I-MedSAM merges the predictions from coarse and fine neural fields as the final prediction maps." + ], + "image_footnote": [], + "bbox": [ + 302, + 383, + 694, + 561 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 751, + 372, + 765 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In traditional discrete segmentation with $C$ classes, neural networks aim to learn a direct mapping from input medical images $X \\in \\mathbb{R}^{H \\times W \\times 3}$ to class probabilities $O \\in \\mathbb{R}^{H \\times W \\times C}$ at the same resolution, in which $H$ and $W$ means height and width of input images, respectively.", + "bbox": [ + 212, + 779, + 785, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "On the other hand, implicit image segmentation seeks to map each pixel of medical images $X$ with its coordinate $p_i = (x,y)$ , where $x,y\\in [-1,1]$ , to class probabilities $\\hat{o}_i\\in \\mathbb{R}^C$ , denoted as $\\mathcal{N}_{\\theta}: (p_i,X_i)\\to \\hat{o}_i$ . Here, $\\mathcal{N}_{\\theta}$ represents a neural network parameterized by weights $\\theta$ . This formulation incorporates coordinates directly on pixels, adjusting the spatial granularity of input coordinates for predictions at arbitrary resolution, from source resolution $H\\times W$ to target resolution $H^{\\prime}\\times W^{\\prime}$ , which can be represented as $X\\in \\mathbb{R}^{H\\times W\\times 3}\\rightarrow O\\in \\mathbb{R}^{H^{\\prime}\\times W^{\\prime}\\times C}$ . Moreover, it allows the direct application of pixel-wise loss functions like Cross Entropy or Dice. Additionally, the zero-isosurface in $\\mathcal{N}_{\\theta}$ 's implicit space represents object boundaries, providing an additional advantage for boundary modeling.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Overall Pipeline", + "text_level": 1, + "bbox": [ + 215, + 321, + 395, + 335 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "As depicted in Fig. 2, I-MedSAM comprises two main parts. The first part integrates an image encoder with its adapters, forming $Enc_{I}$ , and a prompt encoder $Enc_{P}$ , following SAM's design. Specifically, recognizing the significant role of the frequency domain in segmentation boundary representation, a frequency adapter is devised for extracting frequency features. Taking a medical image and a prompt bounding box as inputs, multi-scale features are extracted from both spatial and frequency domains. In scenarios involving cross-resolution, the extracted features need to be interpolated from the source resolution to achieve segmentation output at the target resolution.", + "bbox": [ + 212, + 347, + 787, + 482 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The second part is the implicit segmentation decoder $Dec$ , comprising two stacked INRs: one \"coarse\" $Dec_{c}$ with shallow layers and one \"fine\" $Dec_{f}$ with deeper layers. Typically, $Dec_{c}$ generates a coarse segmentation map, and $Dec_{f}$ refines it on sampled points. The selection of these points is determined by the pixel-wise uncertainty of segmentation predictions, assessed through MC-Dropout and Top-K algorithms. Detailed explanations of these two parts will be provided in the following sections.", + "bbox": [ + 212, + 484, + 787, + 589 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.3 Medical Image Encoder", + "text_level": 1, + "bbox": [ + 215, + 612, + 455, + 628 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we introduce the frequency adapter and low-rank adapter integrated into SAM, to extract features from both frequency and spatial domains.", + "bbox": [ + 212, + 638, + 785, + 667 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Frequency Adapter. Discrete Fourier Transform (DFT) is a common and effective method for transforming an image into the frequency domain. In practice, the Fast Fourier Transform (FFT) is employed for efficient computation of DFT, the spectrum representation of $f_{h,w}$ can be formulated as:", + "bbox": [ + 212, + 669, + 787, + 731 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {F} _ {u, v} = \\sum_ {h = 1} ^ {H} \\sum_ {w = 1} ^ {W} f _ {h, w} \\cdot \\mathrm {e} ^ {- j 2 \\pi \\left(\\frac {h}{H} u + \\frac {w}{W} v\\right)}. \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 743, + 785, + 785 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Subsequently, the amplitude and phase spectrum of $\\mathcal{F}_{u,v}$ can be obtained as $|\\mathcal{F}_{u,v}|$ and $\\arg (\\mathcal{F}_{u,v})$ , respectively. Experiment results in Tab. 6 indicate that the amplitude spectrum exhibits superior representation ability compared to", + "bbox": [ + 215, + 794, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 235, + 113, + 732, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "the phase spectrum. Therefore, we default to using the amplitude spectrum for our proposed frequency adapter (FA).", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As illustrated in Fig. 3, the individual FA comprises a linear down-projection layer, a GELU activation layer, and a linear up-projection layer. In total, we utilize $n$ instances of FA as a sequence, corresponding to the number of Vision Transformer (ViT) Blocks of $Enc_{I}$ .", + "bbox": [ + 212, + 176, + 782, + 236 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Low-Rank Adapter. In contrast to fine-tuning all parameters in the image encoder $Enc_I$ , we leverage the Low-Rank Adapter (LoRA) [16] to update a small fraction of parameters, adapting SAM to medical images, as illustrated in Fig. 3. Given the encoded token sequence $F \\in \\mathbb{R}^{B \\times N \\times C_{in}}$ , the resulting token sequence $\\hat{F} \\in \\mathbb{R}^{B \\times N \\times C_{out}}$ is generated using a projection layer $W_p \\in \\mathbb{R}^{C_{out} \\times C_{in}}$ , denoted as $\\hat{F} = W_pF$ . LoRA proposes that the adjustment to $W_p$ should be gradual and consistent. It recommends utilizing a low-rank approximation $A \\in \\mathbb{R}^{r \\times C_{in}}$ and $B \\in \\mathbb{R}^{C_{out} \\times r}$ to represent this gradual update, which can be formulated as:", + "bbox": [ + 212, + 238, + 517, + 479 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {W} _ {p} = W _ {p} + \\Delta W _ {p} = W _ {p} + B A. \\qquad (2)\n$$\n", + "text_format": "latex", + "bbox": [ + 243, + 489, + 514, + 508 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/8295a7e7bdfc3e3d92c0a125a918736c6060e7d4ca12a82974c3e05fd65ccdd9.jpg", + "image_caption": [ + "Fig. 3: Illustration of the proposed frequency adapter and LoRA in the image encoder. The image/frequency embedding from patch embedding undergoes two separate branches in the encoder." + ], + "image_footnote": [], + "bbox": [ + 542, + 268, + 771, + 409 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As the multi-head attention mechanism determines the regions to focus on, it is reasonable to apply LoRA to the frozen projection layers of query $Q$ , key $K$ , or value $V$ to influence the attention scores. We notice that I-MedSAM performs better when LoRA is applied to the query $Q$ and value $V$ projection layers, which can be expressed as:", + "bbox": [ + 212, + 518, + 782, + 594 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\left\\{ \\begin{array}{l} Q = \\hat {W} _ {q} F = W _ {q} F + B _ {q} A _ {q} F \\\\ K = W _ {k} F \\\\ V = \\hat {W} _ {v} F = W _ {v} F + B _ {v} A _ {v} F \\end{array} \\right. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 604, + 784, + 662 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $W_{q}$ , $W_{k}$ and $W_{v}$ are frozen projection layers from SAM's image encoder, and $A_{q}, B_{q}, A_{v}, B_{v}$ are trainable LoRA parameters.", + "bbox": [ + 212, + 672, + 782, + 705 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.4 Implicit Segmentation Decoder", + "text_level": 1, + "bbox": [ + 214, + 724, + 519, + 739 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we introduce a coarse-to-fine implicit neural representation with an uncertainty-guided sampling (UGS) strategy to decode features from encoders into the segmentation maps at target resolutions.", + "bbox": [ + 212, + 750, + 782, + 794 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Coarse to Fine Implicit Neural Representation. Given features from the image encoder $Enc_I$ and the prompt encoder $Enc_P$ , we interpolate them from source to target resolutions and concatenate them with coordinates $p$ . These", + "bbox": [ + 212, + 795, + 784, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "coordinates $p$ are generated at the target resolutions and normalized to $[-1, 1]$ . To address potential biased learning resulting from the direct use of input coordinates [35], we encode the coordinates into a higher-dimensional space using a high-frequency positional encoding function, which is defined as:", + "bbox": [ + 214, + 146, + 782, + 205 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\gamma (p) = (\\sin (2 ^ {0} \\pi p), \\cos (2 ^ {0} \\pi p), \\dots , \\sin (2 ^ {L - 1} \\pi p), \\cos (2 ^ {L - 1} \\pi p)) \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 287, + 224, + 785, + 242 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where the hyperparameter $L$ is set to 10 in our experiments following the previous work. The encoded coordinates, the encoded features from both the image and prompt encoders are concatenated to feed into the decoder:", + "bbox": [ + 214, + 258, + 782, + 304 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nZ ^ {p} = \\operatorname {C o n c a t} (\\gamma (p), \\operatorname {I n t e r p} \\left(\\operatorname {E n c} _ {I} (X)\\right), \\operatorname {E n c} _ {I} (P)). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 330, + 323, + 784, + 339 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here, $X$ and $P$ represent the input medical image and the corresponding coarse bounding box prompt, respectively. The function Interp refers to the interpolation function based on bilinear algorithms, which is used to interpolate the encoded features from source to target resolution, in alignment with the encoded coordinates.", + "bbox": [ + 214, + 356, + 782, + 430 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Inspired by NeRF [31], we depart from the one-stage INR approaches to introduce a two-stage decoding process. This involves optimizing two INRs simultaneously: one \"coarse\" $Dec_{c}$ , with shallow layers, and one \"fine\" $Dec_{f}$ , with deeper layers. $Dec_{c}$ produces a coarse segmentation map, $\\hat{o}_i^c$ , serving as reference for $Dec_{f}$ to refine. Additionally, $Dec_{c}$ generates coarse features, $z_i^c$ , employed by $Dec_{f}$ in its refinement process.", + "bbox": [ + 214, + 434, + 782, + 525 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We employ MC-dropout to calculate the uncertainty of features $\\hat{\\sigma}_i^c$ for each pixel. Subsequently, a Top-K percentage of feature points is sampled based on this uncertainty, denoted as $z_i^s$ (with $s\\in S$ ). Finally, the predictions from the \"coarse\" and \"fine\" INRs are combined to produce the output of I-MedSAM. The decoding process is formulated as follows:", + "bbox": [ + 214, + 527, + 782, + 603 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\partial} _ {i} ^ {c}, z _ {i} ^ {c} = D e c _ {c} (z _ {i} ^ {p})\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 621, + 501, + 637 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} z _ {i} ^ {s} = U G S \\left(z _ {i} ^ {c}\\right), s \\in \\mathcal {S} \\\\ \\hat {\\partial} _ {i} ^ {f} = D e c _ {f} \\left(z _ {i} ^ {s}\\right) \\end{array} \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 401, + 640, + 784, + 676 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {O} = \\hat {O} ^ {c} (\\mathcal {S} \\setminus s) \\cup \\hat {O} ^ {f} (s), \\hat {\\sigma} _ {i} \\in \\hat {O}.\n$$\n", + "text_format": "latex", + "bbox": [ + 403, + 681, + 625, + 699 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here, $UGS$ represents Uncertainty Guided Sampling, which will be further illustrated in the following section.", + "bbox": [ + 214, + 715, + 782, + 746 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Uncertainty Guided Sampling. In the sampling process, we select feature points that require refinement from the \"coarse\" INR $Dec_{c}$ and feed them into the \"fine\" INR $Dec_{f}$ , based on uncertainty estimation. Drawing inspiration from MC-Dropout methods [12, 14], we apply dropout $T$ times to obtain $T$ prediction results of coarse segmentation probabilities, $\\{o_i^c\\}_{t=1}^T$ , given the input features $z_i^p$ , denoted as $\\{p_t(o_i^c|z_i^p)\\}_{t=1}^T$ . The uncertainty is calculated as the variance of", + "bbox": [ + 214, + 750, + 784, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 235, + 113, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "predictions for each feature point, expressed as:", + "bbox": [ + 215, + 146, + 558, + 162 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\left\\{ \\begin{array}{l} \\mu_ {i} = \\frac {1}{T} \\sum_ {t = 1} ^ {T} \\left(p _ {t} \\left(o _ {i} ^ {c} \\mid z _ {i} ^ {p}\\right)\\right) \\\\ u _ {i} = \\frac {1}{T} \\sum_ {t = 1} ^ {T} \\left(p _ {t} \\left(o _ {i} ^ {c} \\mid z _ {i} ^ {p}\\right) - \\mu_ {i}\\right) ^ {2}. \\end{array} \\right. \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 169, + 785, + 253 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Subsequently, we sample the feature points with the highest Top-K percentage uncertainty to form $z_{i}^{s}$ for $Dec_{f}$ to refine. This estimation of uncertainty reflects the variation in prediction difficulty among different samples. It adaptively selects pixels with higher difficulty for refinement by $Dec_{f}$ , achieving more accurate segmentation results.", + "bbox": [ + 214, + 261, + 787, + 337 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.5 Training I-MedSAM", + "text_level": 1, + "bbox": [ + 215, + 356, + 431, + 372 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To optimize the trainable parameters of I-MedSAM, we freeze the pre-trained image encoder $Enc_I$ , while only unfreezing the proposed adapters, prompt encoder $Enc_P$ and INRs. We utilize SAM's image encoder with LoRA and our proposed frequency adapter to extract features for input medical images $X$ , while extracting prompt features in terms of coarse bounding box $P$ for targeted segmentation objects. The coarse bounding box $P$ is randomly adjusted the height and width following the previous work [46]. Then we concatenate features along with the mapped coordinate values and decode them with the proposed two-stage INR decoder. With the coarse to fine INR and the uncertainty guided sampling strategy, I-MedSAM obtains the coarse and refined point-wise segmentation probabilities $\\{\\hat{o}_i^c,\\hat{o}_i^f\\}_{i\\in X}$ , combined as $\\hat{o}_i$ . For training optimization, we adopt pixel-wise segmentation loss, which can be formulated as:", + "bbox": [ + 214, + 378, + 787, + 561 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nL _ {s e g} \\left(o _ {i}, \\hat {o} _ {i}\\right) = 0. 5 \\cdot L _ {c e} \\left(o _ {i}, \\hat {o} _ {i}\\right) + 0. 5 \\cdot L _ {d c} \\left(o _ {i}, \\hat {o} _ {i}\\right) \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 338, + 569, + 784, + 585 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $L_{ce}$ and $L_{dc}$ stand for Cross Entropy loss and Dice loss respectively. We apply the loss to supervise both coarse and refined segmentation maps progressively. Within the training process, we decrease weights for coarse supervision and increase weights for refined supervision until I-MedSAM converges.", + "bbox": [ + 214, + 593, + 787, + 655 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 674, + 375, + 693 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this section, we present extensive experiments to evaluate the effectiveness of I-MedSAM for medical image segmentation. We first introduce the experimental settings including datasets and training details. Then we compare our method with the SOTA implicit and discrete approaches on the binary polyp segmentation [20] and multi-class organ segmentation [26] qualitatively and quantitatively. We further evaluate the performance and robustness of I-MedSAM when facing data shifts. Finally, we conduct a comprehensive ablation study to evaluate the contribution of each component. Due to space limitations, we provide more details and visualization results in the supplementary material.", + "bbox": [ + 214, + 704, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/635683c70698835ec85f59ae3bab1f1607c2004ba3862b0114d783225a9cd75a.jpg", + "table_caption": [ + "Table 1: Overall segmentation results versus the state-of-the-art discrete approaches and implicit approaches. The Trainable Params columns report unfrozen parameters in training and the Dice columns report averaged scores with standard deviation." + ], + "table_footnote": [], + "table_body": "
Binary Polyp SegmentationMulti-class Organ Segmentation
MethodDice (%)↑Trainable Params (M)↓MethodDice (%)↑Trainable Params (M)↓
Discrete Approaches
U-Net[37]63.89±1.307.9U-Net[37]74.47±1.5716.3
PraNet[10]82.56±1.0830.5UNETR[15]81.14±0.8592.6
Res2UNet[13]81.62±0.9725.4Res2UNet[13]79.23±0.6638.3
nnUNet[19]82.97±0.89126.6nnUNet[19]85.15±0.67126.6
MedSAM[29]82.88±0.554.1MedSAM[29]85.85±0.8152.7
Implicit Approaches
OSSNet[36]76.11±1.145.2OSSNet[36]73.38±1.657.6
IOSNet[22]78.37±0.764.1IOSNet[22]76.75±1.376.2
SwIPE[47]85.05±0.822.7SwIPE[47]81.21±0.944.4
I-MedSAM (ours)91.49±0.521.6I-MedSAM (ours)89.91±0.683.5
", + "bbox": [ + 246, + 198, + 754, + 351 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experimental Settings", + "text_level": 1, + "bbox": [ + 215, + 392, + 444, + 407 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets. We assess the performance of our model on two distinct tasks: binary polyp segmentation and multi-class abdominal organ segmentation. For binary polyp segmentation, we conduct experiments using the challenging Kvasir-Sessile dataset [20], consisting of 196 RGB images of small sessile polyps. Additionally, we evaluate the generalization capability of our model by testing the pre-trained I-MedSAM directly to the CVC-ClinicDB dataset [3], comprising 612 images from 31 colonoscopy sequences.", + "bbox": [ + 212, + 417, + 787, + 521 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For multi-organ segmentation, training is conducted on the BCV dataset [26], comprising 30 CT scans with annotations for 13 organs. Model robustness is also evaluated using the pre-trained I-MedSAM on diverse CT images in AMOS [21] (200 training CTs, maintaining the same setup as in [48]). Since our work is dedicated to showing the effectiveness of 2D medical image segmentation, we just slice-wise segment CT data. Following the data prepossess in SwIPE [47], all datasets are divided with a train:validation:test ratio of 60:20:20, and the reported dice scores are all based on the test set.", + "bbox": [ + 212, + 523, + 787, + 643 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation Details. The training process of I-MedSAM involves fine-tuning the encoder of SAM [24], utilizing ViT-B as the backbone. We set LoRA ranks to 4 and incorporate amplitude information in the frequency adapters. For implicit segmentation decoders, we set latent MLP dimensions as [1024, 512] for $Dec_{c}$ and [512, 256, 256, 128] for $Dec_{f}$ . We sample the highest uncertainty points with a proportion of $12.5\\%$ and set the dropout probabilities to 0.5.", + "bbox": [ + 212, + 643, + 787, + 734 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For multi-organ segmentation, we slightly modify the number of the last layer in $Dec_{c}$ and $Dec_{f}$ to match target segmentation classes. I-MedSAM are optimized by AdamW [28] with $\\alpha = 0.5$ , $\\beta = 0.1$ , and $\\lambda_{ada} = 5 \\times 10^{-5}$ for adapters in the encoder and $\\lambda_{dec} = 1 \\times 10^{-3}$ . For fair comparisons, all methods are trained for 1000 epochs on the same experiment settings. The reported test dice score and Hausdorff Distance [18] correspond to the best validation epoch. Image input sizes are $384 \\times 384$ for Sessile and $512 \\times 512$ for each slice of BCV.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 236, + 114, + 732, + 130 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/3af6c3a6625274c5cd3859a8ba7b06456458a5a0947ab9e2d46c631733f47843.jpg", + "image_caption": [ + "Fig. 4: Qualitative comparison on Kvasir-Sessile dataset for binary polyp segmentation." + ], + "image_footnote": [], + "bbox": [ + 302, + 143, + 702, + 410 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Baselines. We divide baselines into two sets: discrete approaches and implicit (continuous) approaches. Discrete approaches include U-Net [37], PraNet [10], Res2UNet [13], nnUNet [19], UNETR [15] and MedSAM [29]. Specifically, MedSAM [29] is also a SAM-based approach, where SAM's original decoder is directly finetined. Implicit approaches include OSSNet [36], IOSNet [22] and SwIPE [47]. Given the absence of code availability from the prior state-of-the-art SwIPE [47] for extended comparison and the demonstrated superiority of IOSNet [22] over OSSNet [36] in implicit approaches, we primarily compare our method with IOSNet [22] in several experiment settings.", + "bbox": [ + 212, + 462, + 799, + 599 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Quantitative Comparison", + "text_level": 1, + "bbox": [ + 215, + 619, + 470, + 635 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In this section, we first report the dice score compared with baselines. Then we conduct experiments across different resolutions and domains to evaluate the robustness and generalization ability under data shifts. Finally, we implement Hausdorff Distance (HD distance) [18] to compare the quality of the segmentation boundary with baselines across different experiment settings.", + "bbox": [ + 212, + 643, + 784, + 718 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Segmentation Comparison. We make a comparison with both the discrete methods and implicit methods in terms of trainable parameters and Dice score with standard deviation on Polyp Sessile for binary-class segmentation and CT BCV for multi-class segmentation, as demonstrated in Tab. 1. On the smaller polyp dataset, we observe notable improvements over the best-known implicit methods and discrete methods with much fewer trainable parameters (1.26% of nnNet [19] and 59.26% of SwIPE [47]). For multi-organ segmentation on BCV, performance gains are also significant compared with the best-known", + "bbox": [ + 212, + 719, + 785, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/f1885b82ae032fded0c7baa4a11531488cb339fc71b10f047c30a7e7e116dfe7.jpg", + "image_caption": [ + "Fig. 5: Qualitative comparison on BCV dataset for multi-organ segmentation." + ], + "image_footnote": [], + "bbox": [ + 302, + 143, + 702, + 358 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "implicit methods and discrete methods. On the one hand, SAM, with the assistance of the proposed frequency adapters, generates abundant features that enhance the quality of segmentation boundaries. In contrast, SwIPE employs Res2Net-50 [13] as its backbone, which offers less sufficient features compared to SAM's, leading to inferior segmentation quality. On the other hand, with the proposed uncertainty-guided sampling in INR decoders, I-MedSAM adaptively selects and refines uncertain pixels with the highest variance, leading to more accurate segmentation maps.", + "bbox": [ + 212, + 415, + 787, + 535 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Robustness under Data Shifts. We compare the robustness across resolutions and domains with the best discrete and implicit methods on binary-class polyp segmentation.", + "bbox": [ + 212, + 536, + 542, + 597 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Firstly, to adapt the pre-trained I-MedSAM model, originally trained on standard $384 \\times 384$ images, to different target resolutions such as $128 \\times 128$ for lower resolutions and $896 \\times 896$ for higher resolutions, the input coordinates $(384 \\times 384)$ are scaled accordingly to match the target resolutions. Subsequently, the dice score is computed at these corresponding target resolutions. For discrete methods, the resolution of output images remains the same as that of the input images. We input the original images at their source resolution $(384 \\times 384)$ and resize the output segmentation maps to the target resolution for evaluation. Additionally, we denote discrete", + "bbox": [ + 212, + 598, + 544, + 823 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "basielines with the suffix $*$ , where the original medical images are resized to", + "bbox": [ + 212, + 824, + 785, + 839 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/3236ac35066fee6c287e5c7b6a13cff90eb6fc503f84a0e91e7eb04a93bbd793.jpg", + "table_caption": [ + "Table 2: Cross-resolution from ${384} \\times {384}$ to ${128} \\times {128}$ ,from ${384} \\times$ 384 to ${896} \\times {896}$ on Kvasir-Sessile." + ], + "table_footnote": [], + "table_body": "
MethodDice (%)↑
384 → 128384 → 896
Discrete Approaches
PraNet[10]72.6474.95
PraNet*[10]68.7943.92
nnUNet[19]73.9783.56
nnUNet*[19]65.3476.36
MedSAM[29]82.3983.19
MedSAM*[29]82.3783.32
Implicit Approaches
IOSNet[22]76.1878.01
SwIPE[47]81.2684.33
I-MedSAM (ours)91.4591.33
", + "bbox": [ + 563, + 623, + 771, + 785 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 236, + 113, + 732, + 130 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "the target resolution and then provided as input to these methods to directly generate segmentation at the target resolution.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "As shown in Tab. 2, implicit methods exhibit spatial flexibility and consistently outperform discrete methods. Among implicit approaches, our I-MedSAM achieves the highest performance across various output resolutions. This superior performance can be attributed to the efficacy of the proposed frequency adapters and uncertainty-guided sampling, enhancing I-MedSAM's capability to provide accurate predictions at arbitrary resolutions.", + "bbox": [ + 212, + 176, + 599, + 311 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Secondly, we investigate the robustness of model performance across different datasets for the same task. In the binary-class polyp segmentation task, all methods are pre-trained on the Kvasir-Sessile dataset and evaluated directly on the CVC dataset. Similarly, in the multi-class abdominal organ segmentation task, all methods are pre-trained on the BCV dataset and evaluated on the AMOS dataset, focusing solely on the liver class. As shown in Tab. 3, leveraging the generalization ability of SAM, I-MedSAM outperforms the top discrete method, achieving dice scores of $88.83\\%$ and $86.28\\%$ respectively. For additional visualization", + "bbox": [ + 212, + 313, + 599, + 492 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/3847390c9ac25b3245606599487414b4787213e02e7e6b14ca3f9d0807be43b6.jpg", + "table_caption": [ + "Table 3: Cross-domain on binary polyp segmentation and multi-class abdominal organ segmentation." + ], + "table_footnote": [], + "table_body": "
MethodDice (%)
Kvasir-Sessile → CVC
PraNet[10]68.37
nnUNet[19]84.91
MedSAM[29]74.59
IOSNet[22]59.42
SwIPE[47]70.10
I-MedSAM (ours)88.83
BCV → AMOS
UNETR[10]81.75
nnUNet[19]79.63
MedSAM[29]71.98
IOSNet[22]79.48
SwIPE[47]82.81
I-MedSAM (ours)86.28
", + "bbox": [ + 632, + 290, + 767, + 465 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "comparisons regarding data shifts, please refer to the supplementary materials.", + "bbox": [ + 212, + 494, + 782, + 508 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Boundary Comparison. We further utilize the Hausdorff Distance (HD distance) [18] to assess segmentation boundary quality. I-MedSAM achieves a lower HD distance, indicating superior boundary quality. For more detailed boundary visualizations, please refer to Fig.4 and the supplementary materials.", + "bbox": [ + 212, + 508, + 784, + 569 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/f1d60564a92ac270bab814f78ebc3675e4c932f3afb7acad5d4588659d454ddf.jpg", + "table_caption": [ + "Table 4: Hausdorff Distance comparison on various experiment settings." + ], + "table_footnote": [], + "table_body": "
HD distance (↓)Kvasir-SessileKvasir-Sessile → CVC384 → 128384 → 896BCVBCV → AMOS
nnUNet[19]31.3082.3113.6972.316.5080.39
MedSAM[29]21.5330.158.0451.8210.6252.14
IOSNet[22]51.7281.6035.3387.8621.4661.19
I-MedSAM(Ours)11.5919.767.9132.775.9537.53
", + "bbox": [ + 245, + 619, + 753, + 676 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Qualitative Comparison", + "text_level": 1, + "bbox": [ + 215, + 724, + 457, + 742 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "As shown in Fig. 4 and Fig. 5, we conduct qualitative comparisons on Kvasir-Sessile and BCV datasets. Due to the unavailability of code for inference, SwIPE has been omitted from the visual comparison. We also provide input medical images along with corresponding ground truth segmentation masks. The segmentation boundaries are delineated by green lines in Fig. 4. From the figures, it can be witnessed that I-MedSAM obtains better segmentation boundaries. Thanks", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "to the proposed frequency adapters and uncertainty guided sampling techniques, I-MedSAM can efficiently aggregate high-frequency information from the input, which is beneficial to the accuracy of final segmentation maps. Due to the space limitation, please refer to supplementary materials for more qualitative results.", + "bbox": [ + 212, + 146, + 787, + 208 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.4 Ablation Study", + "text_level": 1, + "bbox": [ + 214, + 227, + 390, + 242 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We conduct ablation studies focusing on three aspects: component-wise ablations, the incorporation of frequency adapter, and point numbers for sampling. In each of our ablation experiments, other hyper-parameters remain consistent with the implementation details.", + "bbox": [ + 212, + 251, + 787, + 313 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/8d71472eb6eadc90a87b61b802e9e5d2e6e737c73431ae26882e7ce4e28cfd7f.jpg", + "table_caption": [ + "Table 5: Effectiveness of each component of the pipeline. We evaluate the Dice metric for both cross-domain and cross-resolution tasks." + ], + "table_footnote": [], + "table_body": "
LoRAFAINRKvasir-SessileCross-domainCross-resolution
Kvasir-Sessile → CVC384 → 128384 → 896
✓83.6182.5772.7376.46
✓✓88.7482.6175.6978.59
✓✓88.8383.4088.1688.43
✓✓✓91.4988.8391.4591.33
", + "bbox": [ + 316, + 378, + 683, + 450 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Component-wise ablations. To demonstrate the effectiveness of each component, we conduct a component-wise ablation on Kvasir-Sessile [20], cross-domain and cross-resolution tasks, as can be seen in Tab. 5. We employ LoRA alone as a baseline for binary segmentation, obtaining a competitive performance, which is consistent with the baseline SAMed [46]. Following the incorporation of frequency adapters and INR decoders separately, the model's performance exhibits improvements. It can be observed that the INR decoder exhibits a more pronounced advantage in cross-domain and cross-resolution tasks. Furthermore, simultaneously employing frequency adapters (FA) and INR decoders can achieve a synergistic effect where $1 + 1 > 2$ .", + "bbox": [ + 212, + 477, + 787, + 628 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Incorporating the frequency adapter. Tab. 6 indicates the effectiveness of the frequency adapter, and it can be observed that amplitude information is more helpful for spectrum representation compared to phase information. The results also demonstrate the segmentation boundary benefits from the frequency adapter.", + "bbox": [ + 212, + 628, + 566, + 734 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Points Number for Sampling. Tab. 7 represents ablation on points number for Uncertainty Guided Sampling (UGS). This experiment reveals that I-MedSAM generates high-quality segmentation masks with the help of the proposed uncertainty guided sampling method. Excessive sampling points do not necessarily im", + "bbox": [ + 212, + 734, + 566, + 840 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/bc086b34962031987bef9affe369e310e239126f1e23a144bdb72cc4b8efe27a.jpg", + "table_caption": [ + "Table 6: Ablation study on Frequency Adapter (FA). $\\mathrm{FA}_{pha}$ stands for utilizing of the phase spectrum of DFT, while $\\mathrm{FA}_{amp}$ stands for the amplitude spectrum of DFT." + ], + "table_footnote": [], + "table_body": "
Settingw/o FAFAphaFAamp
Dice (%)88.8390.6091.49
HD15.4412.6711.59
", + "bbox": [ + 581, + 756, + 784, + 801 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 235, + 113, + 732, + 130 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "prove the final segmentation results and may lead to increased memory consumption. Conversely, insufficient sampling points may limit the areas that require refinement. Therefore, a proportion of $12.5\\%$ for UGS is deemed appropriate for I-MedSAM. The parameter can be adjusted according to the specific tasks.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/8e1190bf3cc1331696f5fe6f4e16160db6eeecaefdf89aabcb0cd08fdcef2204.jpg", + "table_caption": [ + "Table 7: Ablation study on the number of sampled feature points for Uncertainty Guided Sampling (UGS). \"Top-K\" denotes the selection of a specified proportion, K%, from all feature points." + ], + "table_footnote": [], + "table_body": "
Settingw/o UGSTop-50%Top-25%Top-12.5%Top-6.25%Top-3.125%
Dice (%)87.7790.2789.5991.4991.0190.48
HD Distance16.1513.8814.1211.5912.9914.53
", + "bbox": [ + 261, + 285, + 738, + 334 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "4.5 Effect of different training annotations", + "text_level": 1, + "bbox": [ + 215, + 378, + 578, + 395 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "To illustrate the generalization ability between I-MedSAM and baselines, we further conduct experiments on different proportions of training annotation amount. Following the experiment settings in SwIPE [47], based on the divided training set, we train I-MedSAM on $10\\%$ , $25\\%$ , $50\\%$ and $100\\%$ of the training set. As shown in Sec. 4.5, our I-MedSAM outperforms all baselines at various training annotation amounts. Thanks to the great generalization ability of SAM's encoder in I-MedSAM, I-MedSAM maintains higher segmentation performance even with relatively limited training annotations.", + "bbox": [ + 212, + 400, + 573, + 595 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 614, + 359, + 632 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/d13b6c8edfa01904a11f90445e0d9b448c9dbeef4796eb770ca552302645ea7d.jpg", + "image_caption": [ + "Fig. 6: Effect on different proportions of training annotation amount." + ], + "image_footnote": [], + "bbox": [ + 586, + 431, + 777, + 566 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we introduce I-MedSAM to enhance cross-domain ability and adaptability to diverse output resolutions in medical image segmenta", + "bbox": [ + 212, + 643, + 573, + 686 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "tion. By integrating SAM's generalized representations into the INR space, I-MedSAM achieves state-of-the-art performance across various experimental scenarios. Specifically addressing the challenge of precise boundary delineation in 2D medical images, we incorporate a frequency adapter for parameter-efficient fine-tuning to SAM, showcasing the potential benefits of complementing spatial domain information with frequency domain insights for foundation models. Additionally, the employment of the uncertainty-guided sampling strategy in coarse-to-fine INRs proves effective in the selection and refinement of challenging samples in continuous space. These findings suggest avenues for future research to establish stronger connections between different representation spaces.", + "bbox": [ + 212, + 688, + 785, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement", + "text_level": 1, + "bbox": [ + 217, + 143, + 392, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Shanghang Zhang is supported by the National Science and Technology Major Project of China (No. 2022ZD0117801).", + "bbox": [ + 215, + 176, + 782, + 205 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 229, + 321, + 244 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Alahmadi, M.D.: Boundary aware u-net for medical image segmentation. Arabian Journal for Science and Engineering 48(8), 9929-9940 (2023)", + "2. Amiranashvili, T., Lüdke, D., Li, H.B., Menze, B., Zachow, S.: Learning shape reconstruction from sparse measurements with neural implicit functions. In: International Conference on Medical Imaging with Deep Learning. pp. 22-34. PMLR (2022)", + "3. Bernal, J., Sánchez, F.J., Fernández-Esparrach, G., Gil, D., Rodríguez, C., Vilarino, F.: WM-DOVA maps for accurate polyp highlighting in colonoscopy: Validation vs. saliency maps from physicians. Computerized Medical Imaging and Graphics 43, 99-111 (2015)", + "4. Bui, N.T., Hoang, D.H., Tran, M.T., Le, N.: Sam3d: Segment anything model in volumetric medical images. arXiv preprint arXiv:2309.03493 (2023)", + "5. Chen, J., Lu, Y., Yu, Q., Luo, X., Adeli, E., Wang, Y., Lu, L., Yuille, A.L., Zhou, Y.: Transunet: Transformers make strong encoders for medical image segmentation. arXiv preprint arXiv:2102.04306 (2021)", + "6. Cheng, J., Ye, J., Deng, Z., Chen, J., Li, T., Wang, H., Su, Y., Huang, Z., Chen, J., Jiang, L., et al.: Sam-med2d. arXiv preprint arXiv:2308.16184 (2023)", + "7. Cheng, Z., Wei, Q., Zhu, H., Wang, Y., Qu, L., Shao, W., Zhou, Y.: Unleashing the potential of sam for medical adaptation via hierarchical decoding. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3511-3522 (2024)", + "8. Chibane, J., Alldieck, T., Pons-Moll, G.: Implicit functions in feature space for 3d shape reconstruction and completion. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6970-6981 (2020)", + "9. Deng, G., Zou, K., Ren, K., Wang, M., Yuan, X., Ying, S., Fu, H.: Sam-u: Multibox prompts triggered uncertainty estimation for reliable sam in medical image. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 368-377. Springer (2023)", + "0. Fan, D., Ji, G., Zhou, T., Chen, G., Fu, H., Shen, J., Shao, L.: PraNet: Parallel reverse attention network for polyp segmentation. In: MICCAI. pp. 263-273. Springer (2020)", + "1. Feng, Z., Wen, L., Wang, P., Yan, B., Wu, X., Zhou, J., Wang, Y.: Diffdp: Radiotherapy dose prediction via a diffusion model. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 191-201. Springer (2023)", + "2. Gal, Y., Ghahramani, Z.: Dropout as a bayesian approximation: Representing model uncertainty in deep learning. international conference on machine learning (2015)", + "3. Gao, S.H., Cheng, M.M., Zhao, K., Zhang, X.Y., Yang, M.H., Torr, P.: Res2Net: A new multi-scale backbone architecture. IEEE TPAMI 43(2), 652-662 (2019)", + "4. Guo, C., Pleiss, G., Sun, Y., Weinberger, K.Q.: On calibration of modern neural networks. international conference on machine learning (2017)" + ], + "bbox": [ + 225, + 258, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 236, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "15. Hatamizadeh, A., Tang, Y., Nath, V., Yang, D., Myronenko, A., Landman, B., Roth, H., Xu, D.: UNETR: Transformers for 3D medical image segmentation. In: IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 574-584 (2022)", + "16. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)", + "17. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: ECCV. pp. 487-505. Springer (2022)", + "18. Huttenlocher, D.P., Klanderman, G.A., Rucklidge, W.J.: Comparing images using the hausdorff distance. IEEE Transactions on pattern analysis and machine intelligence 15(9), 850-863 (1993)", + "19. Isensee, F., Jaeger, P., Kohl, S., Petersen, J., Maier-Hein, K.H.: nnU-Net: A self-configuring method for deep learning-based biomedical image segmentation. Nature Methods 18(2), 203-211 (2021)", + "20. Jha, D., Smedsrud, P.H., Johansen, D., de Lange, T., Johansen, H.D., Halvorsen, P., Riegler, M.A.: A comprehensive study on colorectal polyp segmentation with ResUNet++, conditional random field and test-time augmentation. IEEE Journal of Biomedical and Health Informatics 25(6), 2029-2040 (2021)", + "21. Ji, Y., Bai, H., Yang, J., Ge, C., Zhu, Y., Zhang, R., Li, Z., Zhang, L., Ma, W., Wan, X., et al.: AMOS: A large-scale abdominal multi-organ benchmark for versatile medical image segmentation. ArXiv:2206.08023 (2022)", + "22. Khan, M., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: MICCAI (2022)", + "23. Khan, M.O., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 433-443. Springer (2022)", + "24. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)", + "25. Kuang, K., Zhang, L., Li, J., Li, H., Chen, J., Du, B., Yang, J.: What makes for automatic reconstruction of pulmonary segments. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 495-505. Springer (2022)", + "26. Landman, B., Xu, Z., Igelsias, J., Styner, M., Langerak, T., Klein, A.: Miccai multi-atlas labeling beyond the cranial vault-workshop and challenge. In: Proc. MICCAI Multi-Atlas Labeling Beyond Cranial Vault—Workshop Challenge. vol. 5, p. 12 (2015)", + "27. Li, Y., Shao, H.C., Liang, X., Chen, L., Li, R., Jiang, S., Wang, J., Zhang, Y.: Zero-shot medical image translation via frequency-guided diffusion models. arXiv preprint arXiv:2304.02742 (2023)", + "28. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2017)", + "29. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15, 1-9 (2024)", + "30. McGinnis, J., Shit, S., Li, H.B., Sideri-Lampretsa, V., Graf, R., Dannecker, M., Pan, J., Stolt-Anso, N., Mühlau, M., Kirschke, J.S., et al.: Single-subject multicontrast mri super-resolution via implicit neural representations. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 173-183. Springer (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)", + "32. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023)", + "33. Naval Marimont, S., Tarroni, G.: Implicit field learning for unsupervised anomaly detection in medical images. In: Medical Image Computing and Computer Assisted Intervention-MICCAI 2021: 24th International Conference, Strasbourg, France, September 27-October 1, 2021, Proceedings, Part II 24. pp. 189-198. Springer (2021)", + "34. Pasupathy, A.: The neural basis of image segmentation in the primate brain. Neuroscience 296, 101-109 (2015)", + "35. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: International Conference on Machine Learning. pp. 5301-5310. PMLR (2019)", + "36. Reich, C., Prangemeier, T., Cetin, O., Koeppl, H.: OSS-Net: Memory efficient high resolution semantic segmentation of 3D medical data. In: British Machine Vision Conference (2021)", + "37. Ronneberger, O., Fischer, P., Brox, T.: U-Net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241. Springer (2015)", + "38. Shi, H., Han, S., Huang, S., Liao, Y., Li, G., Kong, X., Zhu, H., Wang, X., Liu, S.: Mask-enhanced segment anything model for tumor lesion semantic segmentation. arXiv preprint arXiv:2403.05912 (2024)", + "39. Sørensen, K., Camara, O., Backer, O., Kofoed, K., Paulsen, R.: NUDF: Neural unsigned distance fields for high resolution 3D medical image segmentation. ISBI pp. 1-5 (2022)", + "40. Stolt-Ansó, N., McGinnis, J., Pan, J., Hammernik, K., Rueckert, D.: Nisf: Neural implicit segmentation functions. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 734-744. Springer (2023)", + "41. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)", + "42. Wei, X., Zhang, R., Wu, J., Liu, J., Lu, M., Guo, Y., Zhang, S.: Nto3d: Neural target object 3d reconstruction with segment anything. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20352-20362 (2024)", + "43. Wu, J., Fu, R., Fang, H., Liu, Y., Wang, Z., Xu, Y., Jin, Y., Arbel, T.: Medical sam adapter: Adapting segment anything model for medical image segmentation. arXiv preprint arXiv:2304.12620 (2023)", + "44. Yang, J., Wickramasinghe, U., Ni, B., Fua, P.: ImplicitAtlas: Learning deformable shape templates in medical imaging. In: CVPR. pp. 15861-15871 (2022)", + "45. You, C., Dai, W., Min, Y., Staib, L., Duncan, J.S.: Implicit anatomical rendering for medical image segmentation with stochastic experts. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 561-571. Springer (2023)", + "46. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything", + "bbox": [ + 236, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "47. Zhang, Y., Gu, P., Sapkota, N., Chen, D.Z.: Swipe: Efficient and robust medical image segmentation with implicit patch embeddings. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 315-326. Springer (2023)", + "48. Zhang, Y., Sapkota, N., Gu, P., Peng, Y., Zheng, H., Chen, D.Z.: Keep your friends close & enemies farther: Debiasing contrastive learning with spatial priors in 3D radiology images. In: 2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). pp. 1824-1829. IEEE (2022)" + ], + "bbox": [ + 217, + 146, + 785, + 258 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "X. Wei et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_model.json b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_model.json new file mode 100644 index 0000000000000000000000000000000000000000..7b131b67b03198a3edf211ff8da42395433c0578 --- /dev/null +++ b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_model.json @@ -0,0 +1,2425 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.284, + 0.141, + 0.72, + 0.187 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "text", + "bbox": [ + 0.307, + 0.212, + 0.694, + 0.244 + ], + "angle": 0, + "content": "Xiaobao Wei\\(^{1,2,3,*}\\), Jiajun Cao\\(^{1,4,*}\\), Yizhu Jin\\(^{1,5}\\), Ming Lu\\(^{1}\\), Guangyu Wang\\(^{6}\\), and Shanghang Zhang\\(^{1,\\dagger}\\)" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.255, + 0.777, + 0.325 + ], + "angle": 0, + "content": "\\(^{1}\\)State Key Laboratory of Multimedia Information Processing, School of Computer Science, Peking University \\(^{2}\\)University of Chinese Academy of Sciences \\(^{3}\\)Institute of Software, Chinese Academy of Sciences \\(^{4}\\)Xi'an Jiaotong University \\(^{5}\\)Beihang University \\(^{6}\\)Beijing University of Posts and Telecommunications weixiaobao0210@gmail.com" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.35, + 0.74, + 0.669 + ], + "angle": 0, + "content": "Abstract. With the development of Deep Neural Networks (DNNs), many efforts have been made to handle medical image segmentation. Traditional methods such as nnUNet train specific segmentation models on the individual datasets. Plenty of recent methods have been proposed to adapt the foundational Segment Anything Model (SAM) to medical image segmentation. However, they still focus on discrete representations to generate pixel-wise predictions, which are spatially inflexible and scale poorly to higher resolution. In contrast, implicit methods learn continuous representations for segmentation, which is crucial for medical image segmentation. In this paper, we propose I-MedSAM, which leverages the benefits of both continuous representations and SAM, to obtain better cross-domain ability and accurate boundary delineation. Since medical image segmentation needs to predict detailed segmentation boundaries, we designed a novel adapter to enhance the SAM features with high-frequency information during Parameter-Efficient Fine-Tuning (PEFT). To convert the SAM features and coordinates into continuous segmentation output, we utilize Implicit Neural Representation (INR) to learn an implicit segmentation decoder. We also propose an uncertainty-guided sampling strategy for efficient learning of INR. Extensive evaluations on 2D medical image segmentation tasks have shown that our proposed method with only 1.6M trainable parameters outperforms existing methods including discrete and implicit methods. The code will be available at: https://github.com/ucwxb/I-MedSAM." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.681, + 0.741, + 0.71 + ], + "angle": 0, + "content": "Keywords: Medical Image Segmentation \\(\\cdot\\) Implicit Neural Representation \\(\\cdot\\) Segment Anything" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.748, + 0.377, + 0.763 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.775, + 0.787, + 0.806 + ], + "angle": 0, + "content": "Medical image segmentation, as a pivotal component of auxiliary disease diagnosis, holds a crucial role in medical image applications. The advent of deep" + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.811, + 0.369, + 0.825 + ], + "angle": 0, + "content": "* Equal Contribution." + }, + { + "type": "page_footnote", + "bbox": [ + 0.223, + 0.825, + 0.388, + 0.84 + ], + "angle": 0, + "content": "† Corresponding Author." + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.811, + 0.388, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.359, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.149, + 0.473, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.218, + 0.298, + 0.48, + 0.32 + ], + "angle": 0, + "content": "(a) Illustrations of discrete and continuous representation for medical segmentation." + }, + { + "type": "image", + "bbox": [ + 0.489, + 0.162, + 0.792, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.489, + 0.298, + 0.786, + 0.319 + ], + "angle": 0, + "content": "(b) Segmentation quality comparison between our I-MedSAM and baselines." + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.331, + 0.788, + 0.388 + ], + "angle": 0, + "content": "Fig. 1: (a) Continuous representation with implicit decoders exhibits superior scale flexibility. (b) I-MedSAM with the fewest trainable params (1.6M) surpasses the state-of-the-art discrete and implicit approaches and exhibits a solid generalization ability when facing data shifts. Please refer to Sec. 4 for more experiment details." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.417, + 0.788, + 0.568 + ], + "angle": 0, + "content": "learning has spurred the widespread adoption of neural networks customized for medical images. For example, nnUNet [37] leverages the downsampling and upsampling modules to aggregate multi-scale contextual features. Transformers [41] uses the self-attention mechanism to significantly augment the representation capacity of deep neural networks, improving the accuracy in medical image segmentation [5]. Recent advancements have witnessed the integration of foundation models as backbones in various works. The Segment Anything Model (SAM) [24] demonstrates unprecedented zero-shot segmentation ability. Therefore, diverse adapters based on parameter-efficient fine-tuning (PEFT) are crafted to fine-tune SAM for medical images [29, 42, 43, 46]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.719 + ], + "angle": 0, + "content": "Despite their notable effectiveness, these methods primarily focus on pixelwise or voxel-wise predictions [10,13,19,29,37,46]. While they achieve promising results, the discrete representations present challenges in spatial flexibility and introduce discretization artifacts when scaling to arbitrary input sizes. Additionally, the discrete representations give rise to ambiguity when extracting the nuanced details crucial for precise boundary delineation [31], which is important in medical image analysis. The delineation of boundaries can signify the transitions between different human tissues or anatomical structures, thus providing essential information for accurately separating these instances. Usually, the intricacy and subtlety of this delineation process need additional refinement [1,34]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Compared with discrete representations, continuous representations learn Implicit Neural Representations (INRs) [32] to transform discrete representations into continuous space. As shown in Fig. 1a, numerous approaches learn a mapping from encoded image features and grid coordinates to the segmentation output, enabling adaptability to various output resolutions [22,33,36,47]. However, current approaches show unsatisfying domain transfer ability due to the limited representation capabilities of their pre-trained image encoders. Additionally, the boundary information of images demonstrates a strong correlation" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.783, + 0.206 + ], + "angle": 0, + "content": "with features in the frequency domain [11, 27], which is also ignored by most previous methodologies. Lastly, existing methods adopt random sampling across coordinates, underestimating the influence of sampling strategies when learning INRs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.788, + 0.435 + ], + "angle": 0, + "content": "To address the aforementioned limitations, we propose I-MedSAM, a model that leverages the benefits of both continuous representations and SAM, aiming to enhance cross-domain capabilities and achieve precise boundary delineation. Given the medical images, I-MedSAM extracts the features from SAM with the proposed frequency adapter, which aggregates high-frequency information from the frequency domain. These features along with the grid coordinates are decoded into segmentation outputs by the learned INRs. We employ a two-stage implicit segmentation decoder, consisting of two INRs in a coarse-to-fine manner. The first INR produces coarse segmentation results and features. Subsequently, a novel uncertainty-guided sampling strategy is applied to sample Top-K variance feature points along with their corresponding grid coordinates. Finally, these selected samples are fed into the second INR to obtain refined segmentation results. Notably, I-MedSAM is trained end-to-end with a minimal number of trainable parameters, yet it achieves state-of-the-art performance compared with all baseline methods. Our main contributions are summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.448, + 0.787, + 0.478 + ], + "angle": 0, + "content": "- We propose I-MedSAM, a novel method that leverages the advantages of SAM and continuous representations." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.48, + 0.787, + 0.509 + ], + "angle": 0, + "content": "- We propose a novel frequency adapter that utilizes high-frequency information to enhance features, thereby accurately segmenting boundaries." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.51, + 0.787, + 0.554 + ], + "angle": 0, + "content": "- We propose a novel coarse-to-fine INR decoder with an uncertainty-guided sampling (UGS) strategy, to learn a mapping from features and coordinates to segmentation output." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.555, + 0.787, + 0.615 + ], + "angle": 0, + "content": "- We perform detailed evaluations of I-MedSAM on 2D medical image segmentation. As shown in Fig. 1b, I-MedSAM outperforms state-of-the-art continuous and discrete methods. Experiments also demonstrate that I-MedSAM is robust to scale and domain shifts." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.448, + 0.787, + 0.615 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.64, + 0.388, + 0.657 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Implicit Neural Representation. The concept of signal representation is fundamental across various domains, especially in the field of computer vision [31,32]. Traditional methods for encoding signals discretize the input space into pixel or voxel grids [4,6,7,9,10,15,19,37,38,46]. Different from these discrete methods, Implicit Neural Representation (INR) learns generator functions that map input coordinates into the signal values [8]. Numerous studies employ INR for diverse tasks, including medical data reconstruction, rendering, compression, registration, super-resolution and segmentation [2, 25, 30, 32, 44]. For segmentation, conventional methods typically consist of a trained feature encoder and a decoder. The encoder encodes medical data into features, and the decoder subsequently decodes features along with their coordinates into segmentation" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "output [17, 22, 23, 36, 39, 40, 45, 47]. However, current methods exhibit an imbalance in emphasizing either global or local features and demonstrate relatively low out-of-distribution ability. In contrast, our proposed approach leverages the segmentation foundation model SAM to enrich feature extraction. Moreover, we introduce an innovative uncertainty-guided sampling (UGS) strategy into the INR, enabling the adaptive selection of samples to train the implicit segmentation decoder. Please refer to the appendix for more related work." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.279, + 0.381, + 0.297 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.785, + 0.36 + ], + "angle": 0, + "content": "In this section, we initially provide a concise overview of the implicit image segmentation problem. Then, we proceed to elaborate on the pipeline of I-MedSAM. Finally, we elucidate the novel designs introduced in I-MedSAM." + }, + { + "type": "image", + "bbox": [ + 0.303, + 0.385, + 0.695, + 0.562 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.57, + 0.788, + 0.696 + ], + "angle": 0, + "content": "Fig. 2: The overall pipeline of I-MedSAM. First, given the medical images and a coarse bounding box as a prompt, I-MedSAM utilizes the medical image encoder and the prompt encoder to generate discrete features. For the medical image encoder, we design low-rank adapters and frequency adapters to extract information from the spatial domain and frequency domain. Then I-MedSAM interpolates all features to align with the encoded coordinates and decodes them in coarse to fine neural fields. We propose an Uncertainty Guided Sampling (UGS) strategy to adaptively choose the highest variance points and refine predictions. I-MedSAM merges the predictions from coarse and fine neural fields as the final prediction maps." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.752, + 0.373, + 0.766 + ], + "angle": 0, + "content": "3.1 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.841 + ], + "angle": 0, + "content": "In traditional discrete segmentation with \\( C \\) classes, neural networks aim to learn a direct mapping from input medical images \\( X \\in \\mathbb{R}^{H \\times W \\times 3} \\) to class probabilities \\( O \\in \\mathbb{R}^{H \\times W \\times C} \\) at the same resolution, in which \\( H \\) and \\( W \\) means height and width of input images, respectively." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.236, + 0.114, + 0.733, + 0.131 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.299 + ], + "angle": 0, + "content": "On the other hand, implicit image segmentation seeks to map each pixel of medical images \\(X\\) with its coordinate \\(p_i = (x,y)\\), where \\(x,y\\in [-1,1]\\), to class probabilities \\(\\hat{o}_i\\in \\mathbb{R}^C\\), denoted as \\(\\mathcal{N}_{\\theta}: (p_i,X_i)\\to \\hat{o}_i\\). Here, \\(\\mathcal{N}_{\\theta}\\) represents a neural network parameterized by weights \\(\\theta\\). This formulation incorporates coordinates directly on pixels, adjusting the spatial granularity of input coordinates for predictions at arbitrary resolution, from source resolution \\(H\\times W\\) to target resolution \\(H^{\\prime}\\times W^{\\prime}\\), which can be represented as \\(X\\in \\mathbb{R}^{H\\times W\\times 3}\\rightarrow O\\in \\mathbb{R}^{H^{\\prime}\\times W^{\\prime}\\times C}\\). Moreover, it allows the direct application of pixel-wise loss functions like Cross Entropy or Dice. Additionally, the zero-isosurface in \\(\\mathcal{N}_{\\theta}\\)'s implicit space represents object boundaries, providing an additional advantage for boundary modeling." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.322, + 0.396, + 0.337 + ], + "angle": 0, + "content": "3.2 Overall Pipeline" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.348, + 0.788, + 0.483 + ], + "angle": 0, + "content": "As depicted in Fig. 2, I-MedSAM comprises two main parts. The first part integrates an image encoder with its adapters, forming \\( Enc_{I} \\), and a prompt encoder \\( Enc_{P} \\), following SAM's design. Specifically, recognizing the significant role of the frequency domain in segmentation boundary representation, a frequency adapter is devised for extracting frequency features. Taking a medical image and a prompt bounding box as inputs, multi-scale features are extracted from both spatial and frequency domains. In scenarios involving cross-resolution, the extracted features need to be interpolated from the source resolution to achieve segmentation output at the target resolution." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.485, + 0.788, + 0.59 + ], + "angle": 0, + "content": "The second part is the implicit segmentation decoder \\(Dec\\), comprising two stacked INRs: one \"coarse\" \\(Dec_{c}\\) with shallow layers and one \"fine\" \\(Dec_{f}\\) with deeper layers. Typically, \\(Dec_{c}\\) generates a coarse segmentation map, and \\(Dec_{f}\\) refines it on sampled points. The selection of these points is determined by the pixel-wise uncertainty of segmentation predictions, assessed through MC-Dropout and Top-K algorithms. Detailed explanations of these two parts will be provided in the following sections." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.613, + 0.457, + 0.629 + ], + "angle": 0, + "content": "3.3 Medical Image Encoder" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.639, + 0.787, + 0.669 + ], + "angle": 0, + "content": "In this section, we introduce the frequency adapter and low-rank adapter integrated into SAM, to extract features from both frequency and spatial domains." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.67, + 0.788, + 0.732 + ], + "angle": 0, + "content": "Frequency Adapter. Discrete Fourier Transform (DFT) is a common and effective method for transforming an image into the frequency domain. In practice, the Fast Fourier Transform (FFT) is employed for efficient computation of DFT, the spectrum representation of \\( f_{h,w} \\) can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.744, + 0.787, + 0.786 + ], + "angle": 0, + "content": "\\[\n\\mathcal {F} _ {u, v} = \\sum_ {h = 1} ^ {H} \\sum_ {w = 1} ^ {W} f _ {h, w} \\cdot \\mathrm {e} ^ {- j 2 \\pi \\left(\\frac {h}{H} u + \\frac {w}{W} v\\right)}. \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Subsequently, the amplitude and phase spectrum of \\(\\mathcal{F}_{u,v}\\) can be obtained as \\(|\\mathcal{F}_{u,v}|\\) and \\(\\arg (\\mathcal{F}_{u,v})\\), respectively. Experiment results in Tab. 6 indicate that the amplitude spectrum exhibits superior representation ability compared to" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "the phase spectrum. Therefore, we default to using the amplitude spectrum for our proposed frequency adapter (FA)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.784, + 0.237 + ], + "angle": 0, + "content": "As illustrated in Fig. 3, the individual FA comprises a linear down-projection layer, a GELU activation layer, and a linear up-projection layer. In total, we utilize \\( n \\) instances of FA as a sequence, corresponding to the number of Vision Transformer (ViT) Blocks of \\( Enc_{I} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.239, + 0.518, + 0.481 + ], + "angle": 0, + "content": "Low-Rank Adapter. In contrast to fine-tuning all parameters in the image encoder \\( Enc_I \\), we leverage the Low-Rank Adapter (LoRA) [16] to update a small fraction of parameters, adapting SAM to medical images, as illustrated in Fig. 3. Given the encoded token sequence \\( F \\in \\mathbb{R}^{B \\times N \\times C_{in}} \\), the resulting token sequence \\( \\hat{F} \\in \\mathbb{R}^{B \\times N \\times C_{out}} \\) is generated using a projection layer \\( W_p \\in \\mathbb{R}^{C_{out} \\times C_{in}} \\), denoted as \\( \\hat{F} = W_pF \\). LoRA proposes that the adjustment to \\( W_p \\) should be gradual and consistent. It recommends utilizing a low-rank approximation \\( A \\in \\mathbb{R}^{r \\times C_{in}} \\) and \\( B \\in \\mathbb{R}^{C_{out} \\times r} \\) to represent this gradual update, which can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.244, + 0.49, + 0.516, + 0.51 + ], + "angle": 0, + "content": "\\[\n\\hat {W} _ {p} = W _ {p} + \\Delta W _ {p} = W _ {p} + B A. \\qquad (2)\n\\]" + }, + { + "type": "image", + "bbox": [ + 0.543, + 0.269, + 0.772, + 0.41 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.525, + 0.42, + 0.788, + 0.492 + ], + "angle": 0, + "content": "Fig. 3: Illustration of the proposed frequency adapter and LoRA in the image encoder. The image/frequency embedding from patch embedding undergoes two separate branches in the encoder." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.519, + 0.784, + 0.595 + ], + "angle": 0, + "content": "As the multi-head attention mechanism determines the regions to focus on, it is reasonable to apply LoRA to the frozen projection layers of query \\( Q \\), key \\( K \\), or value \\( V \\) to influence the attention scores. We notice that I-MedSAM performs better when LoRA is applied to the query \\( Q \\) and value \\( V \\) projection layers, which can be expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.39, + 0.605, + 0.785, + 0.663 + ], + "angle": 0, + "content": "\\[\n\\left\\{ \\begin{array}{l} Q = \\hat {W} _ {q} F = W _ {q} F + B _ {q} A _ {q} F \\\\ K = W _ {k} F \\\\ V = \\hat {W} _ {v} F = W _ {v} F + B _ {v} A _ {v} F \\end{array} \\right. \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.673, + 0.784, + 0.706 + ], + "angle": 0, + "content": "where \\( W_{q} \\), \\( W_{k} \\) and \\( W_{v} \\) are frozen projection layers from SAM's image encoder, and \\( A_{q}, B_{q}, A_{v}, B_{v} \\) are trainable LoRA parameters." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.726, + 0.52, + 0.74 + ], + "angle": 0, + "content": "3.4 Implicit Segmentation Decoder" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.784, + 0.795 + ], + "angle": 0, + "content": "In this section, we introduce a coarse-to-fine implicit neural representation with an uncertainty-guided sampling (UGS) strategy to decode features from encoders into the segmentation maps at target resolutions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Coarse to Fine Implicit Neural Representation. Given features from the image encoder \\( Enc_I \\) and the prompt encoder \\( Enc_P \\), we interpolate them from source to target resolutions and concatenate them with coordinates \\( p \\). These" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.236, + 0.114, + 0.733, + 0.131 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "coordinates \\( p \\) are generated at the target resolutions and normalized to \\([-1, 1]\\). To address potential biased learning resulting from the direct use of input coordinates [35], we encode the coordinates into a higher-dimensional space using a high-frequency positional encoding function, which is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.289, + 0.225, + 0.786, + 0.243 + ], + "angle": 0, + "content": "\\[\n\\gamma (p) = (\\sin (2 ^ {0} \\pi p), \\cos (2 ^ {0} \\pi p), \\dots , \\sin (2 ^ {L - 1} \\pi p), \\cos (2 ^ {L - 1} \\pi p)) \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.26, + 0.784, + 0.305 + ], + "angle": 0, + "content": "where the hyperparameter \\( L \\) is set to 10 in our experiments following the previous work. The encoded coordinates, the encoded features from both the image and prompt encoders are concatenated to feed into the decoder:" + }, + { + "type": "equation", + "bbox": [ + 0.331, + 0.324, + 0.785, + 0.34 + ], + "angle": 0, + "content": "\\[\nZ ^ {p} = \\operatorname {C o n c a t} (\\gamma (p), \\operatorname {I n t e r p} \\left(\\operatorname {E n c} _ {I} (X)\\right), \\operatorname {E n c} _ {I} (P)). \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.357, + 0.784, + 0.431 + ], + "angle": 0, + "content": "Here, \\( X \\) and \\( P \\) represent the input medical image and the corresponding coarse bounding box prompt, respectively. The function Interp refers to the interpolation function based on bilinear algorithms, which is used to interpolate the encoded features from source to target resolution, in alignment with the encoded coordinates." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.435, + 0.784, + 0.526 + ], + "angle": 0, + "content": "Inspired by NeRF [31], we depart from the one-stage INR approaches to introduce a two-stage decoding process. This involves optimizing two INRs simultaneously: one \"coarse\" \\(Dec_{c}\\), with shallow layers, and one \"fine\" \\(Dec_{f}\\), with deeper layers. \\(Dec_{c}\\) produces a coarse segmentation map, \\(\\hat{o}_i^c\\), serving as reference for \\(Dec_{f}\\) to refine. Additionally, \\(Dec_{c}\\) generates coarse features, \\(z_i^c\\), employed by \\(Dec_{f}\\) in its refinement process." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.529, + 0.784, + 0.604 + ], + "angle": 0, + "content": "We employ MC-dropout to calculate the uncertainty of features \\(\\hat{\\sigma}_i^c\\) for each pixel. Subsequently, a Top-K percentage of feature points is sampled based on this uncertainty, denoted as \\(z_i^s\\) (with \\(s\\in S\\)). Finally, the predictions from the \"coarse\" and \"fine\" INRs are combined to produce the output of I-MedSAM. The decoding process is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.378, + 0.622, + 0.503, + 0.638 + ], + "angle": 0, + "content": "\\[\n\\hat {\\partial} _ {i} ^ {c}, z _ {i} ^ {c} = D e c _ {c} (z _ {i} ^ {p})\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.403, + 0.641, + 0.785, + 0.678 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} z _ {i} ^ {s} = U G S \\left(z _ {i} ^ {c}\\right), s \\in \\mathcal {S} \\\\ \\hat {\\partial} _ {i} ^ {f} = D e c _ {f} \\left(z _ {i} ^ {s}\\right) \\end{array} \\tag {6}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.405, + 0.682, + 0.626, + 0.7 + ], + "angle": 0, + "content": "\\[\n\\hat {O} = \\hat {O} ^ {c} (\\mathcal {S} \\setminus s) \\cup \\hat {O} ^ {f} (s), \\hat {\\sigma} _ {i} \\in \\hat {O}.\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.717, + 0.783, + 0.747 + ], + "angle": 0, + "content": "Here, \\( UGS \\) represents Uncertainty Guided Sampling, which will be further illustrated in the following section." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.75, + 0.785, + 0.842 + ], + "angle": 0, + "content": "Uncertainty Guided Sampling. In the sampling process, we select feature points that require refinement from the \"coarse\" INR \\(Dec_{c}\\) and feed them into the \"fine\" INR \\(Dec_{f}\\), based on uncertainty estimation. Drawing inspiration from MC-Dropout methods [12, 14], we apply dropout \\(T\\) times to obtain \\(T\\) prediction results of coarse segmentation probabilities, \\(\\{o_i^c\\}_{t=1}^T\\), given the input features \\(z_i^p\\), denoted as \\(\\{p_t(o_i^c|z_i^p)\\}_{t=1}^T\\). The uncertainty is calculated as the variance of" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.56, + 0.163 + ], + "angle": 0, + "content": "predictions for each feature point, expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.395, + 0.17, + 0.786, + 0.255 + ], + "angle": 0, + "content": "\\[\n\\left\\{ \\begin{array}{l} \\mu_ {i} = \\frac {1}{T} \\sum_ {t = 1} ^ {T} \\left(p _ {t} \\left(o _ {i} ^ {c} \\mid z _ {i} ^ {p}\\right)\\right) \\\\ u _ {i} = \\frac {1}{T} \\sum_ {t = 1} ^ {T} \\left(p _ {t} \\left(o _ {i} ^ {c} \\mid z _ {i} ^ {p}\\right) - \\mu_ {i}\\right) ^ {2}. \\end{array} \\right. \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.262, + 0.788, + 0.338 + ], + "angle": 0, + "content": "Subsequently, we sample the feature points with the highest Top-K percentage uncertainty to form \\( z_{i}^{s} \\) for \\( Dec_{f} \\) to refine. This estimation of uncertainty reflects the variation in prediction difficulty among different samples. It adaptively selects pixels with higher difficulty for refinement by \\( Dec_{f} \\), achieving more accurate segmentation results." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.357, + 0.432, + 0.373 + ], + "angle": 0, + "content": "3.5 Training I-MedSAM" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.379, + 0.789, + 0.562 + ], + "angle": 0, + "content": "To optimize the trainable parameters of I-MedSAM, we freeze the pre-trained image encoder \\( Enc_I \\), while only unfreezing the proposed adapters, prompt encoder \\( Enc_P \\) and INRs. We utilize SAM's image encoder with LoRA and our proposed frequency adapter to extract features for input medical images \\( X \\), while extracting prompt features in terms of coarse bounding box \\( P \\) for targeted segmentation objects. The coarse bounding box \\( P \\) is randomly adjusted the height and width following the previous work [46]. Then we concatenate features along with the mapped coordinate values and decode them with the proposed two-stage INR decoder. With the coarse to fine INR and the uncertainty guided sampling strategy, I-MedSAM obtains the coarse and refined point-wise segmentation probabilities \\( \\{\\hat{o}_i^c,\\hat{o}_i^f\\}_{i\\in X} \\), combined as \\( \\hat{o}_i \\). For training optimization, we adopt pixel-wise segmentation loss, which can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.339, + 0.57, + 0.785, + 0.587 + ], + "angle": 0, + "content": "\\[\nL _ {s e g} \\left(o _ {i}, \\hat {o} _ {i}\\right) = 0. 5 \\cdot L _ {c e} \\left(o _ {i}, \\hat {o} _ {i}\\right) + 0. 5 \\cdot L _ {d c} \\left(o _ {i}, \\hat {o} _ {i}\\right) \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.594, + 0.788, + 0.656 + ], + "angle": 0, + "content": "where \\( L_{ce} \\) and \\( L_{dc} \\) stand for Cross Entropy loss and Dice loss respectively. We apply the loss to supervise both coarse and refined segmentation maps progressively. Within the training process, we decrease weights for coarse supervision and increase weights for refined supervision until I-MedSAM converges." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.675, + 0.377, + 0.694 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.705, + 0.789, + 0.841 + ], + "angle": 0, + "content": "In this section, we present extensive experiments to evaluate the effectiveness of I-MedSAM for medical image segmentation. We first introduce the experimental settings including datasets and training details. Then we compare our method with the SOTA implicit and discrete approaches on the binary polyp segmentation [20] and multi-class organ segmentation [26] qualitatively and quantitatively. We further evaluate the performance and robustness of I-MedSAM when facing data shifts. Finally, we conduct a comprehensive ablation study to evaluate the contribution of each component. Due to space limitations, we provide more details and visualization results in the supplementary material." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.788, + 0.189 + ], + "angle": 0, + "content": "Table 1: Overall segmentation results versus the state-of-the-art discrete approaches and implicit approaches. The Trainable Params columns report unfrozen parameters in training and the Dice columns report averaged scores with standard deviation." + }, + { + "type": "table", + "bbox": [ + 0.248, + 0.199, + 0.756, + 0.352 + ], + "angle": 0, + "content": "
Binary Polyp SegmentationMulti-class Organ Segmentation
MethodDice (%)↑Trainable Params (M)↓MethodDice (%)↑Trainable Params (M)↓
Discrete Approaches
U-Net[37]63.89±1.307.9U-Net[37]74.47±1.5716.3
PraNet[10]82.56±1.0830.5UNETR[15]81.14±0.8592.6
Res2UNet[13]81.62±0.9725.4Res2UNet[13]79.23±0.6638.3
nnUNet[19]82.97±0.89126.6nnUNet[19]85.15±0.67126.6
MedSAM[29]82.88±0.554.1MedSAM[29]85.85±0.8152.7
Implicit Approaches
OSSNet[36]76.11±1.145.2OSSNet[36]73.38±1.657.6
IOSNet[22]78.37±0.764.1IOSNet[22]76.75±1.376.2
SwIPE[47]85.05±0.822.7SwIPE[47]81.21±0.944.4
I-MedSAM (ours)91.49±0.521.6I-MedSAM (ours)89.91±0.683.5
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.393, + 0.446, + 0.409 + ], + "angle": 0, + "content": "4.1 Experimental Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.418, + 0.788, + 0.522 + ], + "angle": 0, + "content": "Datasets. We assess the performance of our model on two distinct tasks: binary polyp segmentation and multi-class abdominal organ segmentation. For binary polyp segmentation, we conduct experiments using the challenging Kvasir-Sessile dataset [20], consisting of 196 RGB images of small sessile polyps. Additionally, we evaluate the generalization capability of our model by testing the pre-trained I-MedSAM directly to the CVC-ClinicDB dataset [3], comprising 612 images from 31 colonoscopy sequences." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.788, + 0.644 + ], + "angle": 0, + "content": "For multi-organ segmentation, training is conducted on the BCV dataset [26], comprising 30 CT scans with annotations for 13 organs. Model robustness is also evaluated using the pre-trained I-MedSAM on diverse CT images in AMOS [21] (200 training CTs, maintaining the same setup as in [48]). Since our work is dedicated to showing the effectiveness of 2D medical image segmentation, we just slice-wise segment CT data. Following the data prepossess in SwIPE [47], all datasets are divided with a train:validation:test ratio of 60:20:20, and the reported dice scores are all based on the test set." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.645, + 0.788, + 0.735 + ], + "angle": 0, + "content": "Implementation Details. The training process of I-MedSAM involves fine-tuning the encoder of SAM [24], utilizing ViT-B as the backbone. We set LoRA ranks to 4 and incorporate amplitude information in the frequency adapters. For implicit segmentation decoders, we set latent MLP dimensions as [1024, 512] for \\(Dec_{c}\\) and [512, 256, 256, 128] for \\(Dec_{f}\\). We sample the highest uncertainty points with a proportion of \\(12.5\\%\\) and set the dropout probabilities to 0.5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "For multi-organ segmentation, we slightly modify the number of the last layer in \\(Dec_{c}\\) and \\(Dec_{f}\\) to match target segmentation classes. I-MedSAM are optimized by AdamW [28] with \\(\\alpha = 0.5\\), \\(\\beta = 0.1\\), and \\(\\lambda_{ada} = 5 \\times 10^{-5}\\) for adapters in the encoder and \\(\\lambda_{dec} = 1 \\times 10^{-3}\\). For fair comparisons, all methods are trained for 1000 epochs on the same experiment settings. The reported test dice score and Hausdorff Distance [18] correspond to the best validation epoch. Image input sizes are \\(384 \\times 384\\) for Sessile and \\(512 \\times 512\\) for each slice of BCV." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "image", + "bbox": [ + 0.303, + 0.144, + 0.703, + 0.411 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.42, + 0.784, + 0.435 + ], + "angle": 0, + "content": "Fig. 4: Qualitative comparison on Kvasir-Sessile dataset for binary polyp segmentation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.8, + 0.601 + ], + "angle": 0, + "content": "Baselines. We divide baselines into two sets: discrete approaches and implicit (continuous) approaches. Discrete approaches include U-Net [37], PraNet [10], Res2UNet [13], nnUNet [19], UNETR [15] and MedSAM [29]. Specifically, MedSAM [29] is also a SAM-based approach, where SAM's original decoder is directly finetined. Implicit approaches include OSSNet [36], IOSNet [22] and SwIPE [47]. Given the absence of code availability from the prior state-of-the-art SwIPE [47] for extended comparison and the demonstrated superiority of IOSNet [22] over OSSNet [36] in implicit approaches, we primarily compare our method with IOSNet [22] in several experiment settings." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.621, + 0.471, + 0.636 + ], + "angle": 0, + "content": "4.2 Quantitative Comparison" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.785, + 0.719 + ], + "angle": 0, + "content": "In this section, we first report the dice score compared with baselines. Then we conduct experiments across different resolutions and domains to evaluate the robustness and generalization ability under data shifts. Finally, we implement Hausdorff Distance (HD distance) [18] to compare the quality of the segmentation boundary with baselines across different experiment settings." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Segmentation Comparison. We make a comparison with both the discrete methods and implicit methods in terms of trainable parameters and Dice score with standard deviation on Polyp Sessile for binary-class segmentation and CT BCV for multi-class segmentation, as demonstrated in Tab. 1. On the smaller polyp dataset, we observe notable improvements over the best-known implicit methods and discrete methods with much fewer trainable parameters (1.26% of nnNet [19] and 59.26% of SwIPE [47]). For multi-organ segmentation on BCV, performance gains are also significant compared with the best-known" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.114, + 0.733, + 0.131 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.303, + 0.144, + 0.703, + 0.359 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.24, + 0.37, + 0.761, + 0.384 + ], + "angle": 0, + "content": "Fig. 5: Qualitative comparison on BCV dataset for multi-organ segmentation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.416, + 0.788, + 0.536 + ], + "angle": 0, + "content": "implicit methods and discrete methods. On the one hand, SAM, with the assistance of the proposed frequency adapters, generates abundant features that enhance the quality of segmentation boundaries. In contrast, SwIPE employs Res2Net-50 [13] as its backbone, which offers less sufficient features compared to SAM's, leading to inferior segmentation quality. On the other hand, with the proposed uncertainty-guided sampling in INR decoders, I-MedSAM adaptively selects and refines uncertain pixels with the highest variance, leading to more accurate segmentation maps." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.537, + 0.544, + 0.598 + ], + "angle": 0, + "content": "Robustness under Data Shifts. We compare the robustness across resolutions and domains with the best discrete and implicit methods on binary-class polyp segmentation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.545, + 0.824 + ], + "angle": 0, + "content": "Firstly, to adapt the pre-trained I-MedSAM model, originally trained on standard \\(384 \\times 384\\) images, to different target resolutions such as \\(128 \\times 128\\) for lower resolutions and \\(896 \\times 896\\) for higher resolutions, the input coordinates \\((384 \\times 384)\\) are scaled accordingly to match the target resolutions. Subsequently, the dice score is computed at these corresponding target resolutions. For discrete methods, the resolution of output images remains the same as that of the input images. We input the original images at their source resolution \\((384 \\times 384)\\) and resize the output segmentation maps to the target resolution for evaluation. Additionally, we denote discrete" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.825, + 0.787, + 0.84 + ], + "angle": 0, + "content": "basielines with the suffix \\(*\\), where the original medical images are resized to" + }, + { + "type": "table_caption", + "bbox": [ + 0.554, + 0.581, + 0.788, + 0.622 + ], + "angle": 0, + "content": "Table 2: Cross-resolution from \\( {384} \\times {384} \\) to \\( {128} \\times {128} \\) ,from \\( {384} \\times \\) 384 to \\( {896} \\times {896} \\) on Kvasir-Sessile." + }, + { + "type": "table", + "bbox": [ + 0.565, + 0.624, + 0.772, + 0.786 + ], + "angle": 0, + "content": "
MethodDice (%)↑
384 → 128384 → 896
Discrete Approaches
PraNet[10]72.6474.95
PraNet*[10]68.7943.92
nnUNet[19]73.9783.56
nnUNet*[19]65.3476.36
MedSAM[29]82.3983.19
MedSAM*[29]82.3783.32
Implicit Approaches
IOSNet[22]76.1878.01
SwIPE[47]81.2684.33
I-MedSAM (ours)91.4591.33
" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "the target resolution and then provided as input to these methods to directly generate segmentation at the target resolution." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.601, + 0.312 + ], + "angle": 0, + "content": "As shown in Tab. 2, implicit methods exhibit spatial flexibility and consistently outperform discrete methods. Among implicit approaches, our I-MedSAM achieves the highest performance across various output resolutions. This superior performance can be attributed to the efficacy of the proposed frequency adapters and uncertainty-guided sampling, enhancing I-MedSAM's capability to provide accurate predictions at arbitrary resolutions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.601, + 0.493 + ], + "angle": 0, + "content": "Secondly, we investigate the robustness of model performance across different datasets for the same task. In the binary-class polyp segmentation task, all methods are pre-trained on the Kvasir-Sessile dataset and evaluated directly on the CVC dataset. Similarly, in the multi-class abdominal organ segmentation task, all methods are pre-trained on the BCV dataset and evaluated on the AMOS dataset, focusing solely on the liver class. As shown in Tab. 3, leveraging the generalization ability of SAM, I-MedSAM outperforms the top discrete method, achieving dice scores of \\(88.83\\%\\) and \\(86.28\\%\\) respectively. For additional visualization" + }, + { + "type": "table_caption", + "bbox": [ + 0.611, + 0.221, + 0.788, + 0.289 + ], + "angle": 0, + "content": "Table 3: Cross-domain on binary polyp segmentation and multi-class abdominal organ segmentation." + }, + { + "type": "table", + "bbox": [ + 0.633, + 0.291, + 0.768, + 0.467 + ], + "angle": 0, + "content": "
MethodDice (%)
Kvasir-Sessile → CVC
PraNet[10]68.37
nnUNet[19]84.91
MedSAM[29]74.59
IOSNet[22]59.42
SwIPE[47]70.10
I-MedSAM (ours)88.83
BCV → AMOS
UNETR[10]81.75
nnUNet[19]79.63
MedSAM[29]71.98
IOSNet[22]79.48
SwIPE[47]82.81
I-MedSAM (ours)86.28
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.495, + 0.784, + 0.51 + ], + "angle": 0, + "content": "comparisons regarding data shifts, please refer to the supplementary materials." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.785, + 0.57 + ], + "angle": 0, + "content": "Boundary Comparison. We further utilize the Hausdorff Distance (HD distance) [18] to assess segmentation boundary quality. I-MedSAM achieves a lower HD distance, indicating superior boundary quality. For more detailed boundary visualizations, please refer to Fig.4 and the supplementary materials." + }, + { + "type": "table_caption", + "bbox": [ + 0.258, + 0.596, + 0.744, + 0.61 + ], + "angle": 0, + "content": "Table 4: Hausdorff Distance comparison on various experiment settings." + }, + { + "type": "table", + "bbox": [ + 0.246, + 0.621, + 0.754, + 0.678 + ], + "angle": 0, + "content": "
HD distance (↓)Kvasir-SessileKvasir-Sessile → CVC384 → 128384 → 896BCVBCV → AMOS
nnUNet[19]31.3082.3113.6972.316.5080.39
MedSAM[29]21.5330.158.0451.8210.6252.14
IOSNet[22]51.7281.6035.3387.8621.4661.19
I-MedSAM(Ours)11.5919.767.9132.775.9537.53
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.726, + 0.459, + 0.743 + ], + "angle": 0, + "content": "4.3 Qualitative Comparison" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "As shown in Fig. 4 and Fig. 5, we conduct qualitative comparisons on Kvasir-Sessile and BCV datasets. Due to the unavailability of code for inference, SwIPE has been omitted from the visual comparison. We also provide input medical images along with corresponding ground truth segmentation masks. The segmentation boundaries are delineated by green lines in Fig. 4. From the figures, it can be witnessed that I-MedSAM obtains better segmentation boundaries. Thanks" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.236, + 0.114, + 0.733, + 0.131 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.209 + ], + "angle": 0, + "content": "to the proposed frequency adapters and uncertainty guided sampling techniques, I-MedSAM can efficiently aggregate high-frequency information from the input, which is beneficial to the accuracy of final segmentation maps. Due to the space limitation, please refer to supplementary materials for more qualitative results." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.228, + 0.391, + 0.243 + ], + "angle": 0, + "content": "4.4 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.252, + 0.788, + 0.314 + ], + "angle": 0, + "content": "We conduct ablation studies focusing on three aspects: component-wise ablations, the incorporation of frequency adapter, and point numbers for sampling. In each of our ablation experiments, other hyper-parameters remain consistent with the implementation details." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.337, + 0.79, + 0.368 + ], + "angle": 0, + "content": "Table 5: Effectiveness of each component of the pipeline. We evaluate the Dice metric for both cross-domain and cross-resolution tasks." + }, + { + "type": "table", + "bbox": [ + 0.317, + 0.379, + 0.684, + 0.451 + ], + "angle": 0, + "content": "
LoRAFAINRKvasir-SessileCross-domainCross-resolution
Kvasir-Sessile → CVC384 → 128384 → 896
✓83.6182.5772.7376.46
✓✓88.7482.6175.6978.59
✓✓88.8383.4088.1688.43
✓✓✓91.4988.8391.4591.33
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.788, + 0.629 + ], + "angle": 0, + "content": "Component-wise ablations. To demonstrate the effectiveness of each component, we conduct a component-wise ablation on Kvasir-Sessile [20], cross-domain and cross-resolution tasks, as can be seen in Tab. 5. We employ LoRA alone as a baseline for binary segmentation, obtaining a competitive performance, which is consistent with the baseline SAMed [46]. Following the incorporation of frequency adapters and INR decoders separately, the model's performance exhibits improvements. It can be observed that the INR decoder exhibits a more pronounced advantage in cross-domain and cross-resolution tasks. Furthermore, simultaneously employing frequency adapters (FA) and INR decoders can achieve a synergistic effect where \\(1 + 1 > 2\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.567, + 0.735 + ], + "angle": 0, + "content": "Incorporating the frequency adapter. Tab. 6 indicates the effectiveness of the frequency adapter, and it can be observed that amplitude information is more helpful for spectrum representation compared to phase information. The results also demonstrate the segmentation boundary benefits from the frequency adapter." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.568, + 0.841 + ], + "angle": 0, + "content": "Points Number for Sampling. Tab. 7 represents ablation on points number for Uncertainty Guided Sampling (UGS). This experiment reveals that I-MedSAM generates high-quality segmentation masks with the help of the proposed uncertainty guided sampling method. Excessive sampling points do not necessarily im" + }, + { + "type": "table_caption", + "bbox": [ + 0.577, + 0.673, + 0.788, + 0.756 + ], + "angle": 0, + "content": "Table 6: Ablation study on Frequency Adapter (FA). \\(\\mathrm{FA}_{pha}\\) stands for utilizing of the phase spectrum of DFT, while \\(\\mathrm{FA}_{amp}\\) stands for the amplitude spectrum of DFT." + }, + { + "type": "table", + "bbox": [ + 0.583, + 0.757, + 0.785, + 0.802 + ], + "angle": 0, + "content": "
Settingw/o FAFAphaFAamp
Dice (%)88.8390.6091.49
HD15.4412.6711.59
" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.783, + 0.207 + ], + "angle": 0, + "content": "prove the final segmentation results and may lead to increased memory consumption. Conversely, insufficient sampling points may limit the areas that require refinement. Therefore, a proportion of \\(12.5\\%\\) for UGS is deemed appropriate for I-MedSAM. The parameter can be adjusted according to the specific tasks." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.231, + 0.784, + 0.273 + ], + "angle": 0, + "content": "Table 7: Ablation study on the number of sampled feature points for Uncertainty Guided Sampling (UGS). \"Top-K\" denotes the selection of a specified proportion, K%, from all feature points." + }, + { + "type": "table", + "bbox": [ + 0.263, + 0.286, + 0.74, + 0.335 + ], + "angle": 0, + "content": "
Settingw/o UGSTop-50%Top-25%Top-12.5%Top-6.25%Top-3.125%
Dice (%)87.7790.2789.5991.4991.0190.48
HD Distance16.1513.8814.1211.5912.9914.53
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.379, + 0.579, + 0.396 + ], + "angle": 0, + "content": "4.5 Effect of different training annotations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.401, + 0.574, + 0.597 + ], + "angle": 0, + "content": "To illustrate the generalization ability between I-MedSAM and baselines, we further conduct experiments on different proportions of training annotation amount. Following the experiment settings in SwIPE [47], based on the divided training set, we train I-MedSAM on \\(10\\%\\), \\(25\\%\\), \\(50\\%\\) and \\(100\\%\\) of the training set. As shown in Sec. 4.5, our I-MedSAM outperforms all baselines at various training annotation amounts. Thanks to the great generalization ability of SAM's encoder in I-MedSAM, I-MedSAM maintains higher segmentation performance even with relatively limited training annotations." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.616, + 0.36, + 0.633 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "image", + "bbox": [ + 0.587, + 0.433, + 0.778, + 0.567 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.583, + 0.578, + 0.788, + 0.618 + ], + "angle": 0, + "content": "Fig. 6: Effect on different proportions of training annotation amount." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.574, + 0.688 + ], + "angle": 0, + "content": "In this paper, we introduce I-MedSAM to enhance cross-domain ability and adaptability to diverse output resolutions in medical image segmenta" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.787, + 0.841 + ], + "angle": 0, + "content": "tion. By integrating SAM's generalized representations into the INR space, I-MedSAM achieves state-of-the-art performance across various experimental scenarios. Specifically addressing the challenge of precise boundary delineation in 2D medical images, we incorporate a frequency adapter for parameter-efficient fine-tuning to SAM, showcasing the potential benefits of complementing spatial domain information with frequency domain insights for foundation models. Additionally, the employment of the uncertainty-guided sampling strategy in coarse-to-fine INRs proves effective in the selection and refinement of challenging samples in continuous space. These findings suggest avenues for future research to establish stronger connections between different representation spaces." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.393, + 0.163 + ], + "angle": 0, + "content": "Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.177, + 0.784, + 0.207 + ], + "angle": 0, + "content": "Shanghang Zhang is supported by the National Science and Technology Major Project of China (No. 2022ZD0117801)." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.23, + 0.323, + 0.246 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.26, + 0.785, + 0.288 + ], + "angle": 0, + "content": "1. Alahmadi, M.D.: Boundary aware u-net for medical image segmentation. Arabian Journal for Science and Engineering 48(8), 9929-9940 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.289, + 0.785, + 0.342 + ], + "angle": 0, + "content": "2. Amiranashvili, T., Lüdke, D., Li, H.B., Menze, B., Zachow, S.: Learning shape reconstruction from sparse measurements with neural implicit functions. In: International Conference on Medical Imaging with Deep Learning. pp. 22-34. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.343, + 0.785, + 0.399 + ], + "angle": 0, + "content": "3. Bernal, J., Sánchez, F.J., Fernández-Esparrach, G., Gil, D., Rodríguez, C., Vilarino, F.: WM-DOVA maps for accurate polyp highlighting in colonoscopy: Validation vs. saliency maps from physicians. Computerized Medical Imaging and Graphics 43, 99-111 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.4, + 0.785, + 0.426 + ], + "angle": 0, + "content": "4. Bui, N.T., Hoang, D.H., Tran, M.T., Le, N.: Sam3d: Segment anything model in volumetric medical images. arXiv preprint arXiv:2309.03493 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.785, + 0.468 + ], + "angle": 0, + "content": "5. Chen, J., Lu, Y., Yu, Q., Luo, X., Adeli, E., Wang, Y., Lu, L., Yuille, A.L., Zhou, Y.: Transunet: Transformers make strong encoders for medical image segmentation. arXiv preprint arXiv:2102.04306 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.785, + 0.496 + ], + "angle": 0, + "content": "6. Cheng, J., Ye, J., Deng, Z., Chen, J., Li, T., Wang, H., Su, Y., Huang, Z., Chen, J., Jiang, L., et al.: Sam-med2d. arXiv preprint arXiv:2308.16184 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.496, + 0.785, + 0.55 + ], + "angle": 0, + "content": "7. Cheng, Z., Wei, Q., Zhu, H., Wang, Y., Qu, L., Shao, W., Zhou, Y.: Unleashing the potential of sam for medical adaptation via hierarchical decoding. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3511-3522 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.55, + 0.785, + 0.592 + ], + "angle": 0, + "content": "8. Chibane, J., Alldieck, T., Pons-Moll, G.: Implicit functions in feature space for 3d shape reconstruction and completion. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6970-6981 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.592, + 0.785, + 0.647 + ], + "angle": 0, + "content": "9. Deng, G., Zou, K., Ren, K., Wang, M., Yuan, X., Ying, S., Fu, H.: Sam-u: Multibox prompts triggered uncertainty estimation for reliable sam in medical image. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 368-377. Springer (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.647, + 0.785, + 0.689 + ], + "angle": 0, + "content": "0. Fan, D., Ji, G., Zhou, T., Chen, G., Fu, H., Shen, J., Shao, L.: PraNet: Parallel reverse attention network for polyp segmentation. In: MICCAI. pp. 263-273. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.785, + 0.744 + ], + "angle": 0, + "content": "1. Feng, Z., Wen, L., Wang, P., Yan, B., Wu, X., Zhou, J., Wang, Y.: Diffdp: Radiotherapy dose prediction via a diffusion model. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 191-201. Springer (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.744, + 0.785, + 0.785 + ], + "angle": 0, + "content": "2. Gal, Y., Ghahramani, Z.: Dropout as a bayesian approximation: Representing model uncertainty in deep learning. international conference on machine learning (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.785, + 0.813 + ], + "angle": 0, + "content": "3. Gao, S.H., Cheng, M.M., Zhao, K., Zhang, X.Y., Yang, M.H., Torr, P.: Res2Net: A new multi-scale backbone architecture. IEEE TPAMI 43(2), 652-662 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "4. Guo, C., Pleiss, G., Sun, Y., Weinberger, K.Q.: On calibration of modern neural networks. international conference on machine learning (2017)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.26, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "15. Hatamizadeh, A., Tang, Y., Nath, V., Yang, D., Myronenko, A., Landman, B., Roth, H., Xu, D.: UNETR: Transformers for 3D medical image segmentation. In: IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 574-584 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.787, + 0.245 + ], + "angle": 0, + "content": "16. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "17. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: ECCV. pp. 487-505. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.328 + ], + "angle": 0, + "content": "18. Huttenlocher, D.P., Klanderman, G.A., Rucklidge, W.J.: Comparing images using the hausdorff distance. IEEE Transactions on pattern analysis and machine intelligence 15(9), 850-863 (1993)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.787, + 0.37 + ], + "angle": 0, + "content": "19. Isensee, F., Jaeger, P., Kohl, S., Petersen, J., Maier-Hein, K.H.: nnU-Net: A self-configuring method for deep learning-based biomedical image segmentation. Nature Methods 18(2), 203-211 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.787, + 0.424 + ], + "angle": 0, + "content": "20. Jha, D., Smedsrud, P.H., Johansen, D., de Lange, T., Johansen, H.D., Halvorsen, P., Riegler, M.A.: A comprehensive study on colorectal polyp segmentation with ResUNet++, conditional random field and test-time augmentation. IEEE Journal of Biomedical and Health Informatics 25(6), 2029-2040 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.467 + ], + "angle": 0, + "content": "21. Ji, Y., Bai, H., Yang, J., Ge, C., Zhu, Y., Zhang, R., Li, Z., Zhang, L., Ma, W., Wan, X., et al.: AMOS: A large-scale abdominal multi-organ benchmark for versatile medical image segmentation. ArXiv:2206.08023 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.787, + 0.495 + ], + "angle": 0, + "content": "22. Khan, M., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: MICCAI (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.787, + 0.536 + ], + "angle": 0, + "content": "23. Khan, M.O., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 433-443. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.787, + 0.577 + ], + "angle": 0, + "content": "24. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.787, + 0.632 + ], + "angle": 0, + "content": "25. Kuang, K., Zhang, L., Li, J., Li, H., Chen, J., Du, B., Yang, J.: What makes for automatic reconstruction of pulmonary segments. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 495-505. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.787, + 0.687 + ], + "angle": 0, + "content": "26. Landman, B., Xu, Z., Igelsias, J., Styner, M., Langerak, T., Klein, A.: Miccai multi-atlas labeling beyond the cranial vault-workshop and challenge. In: Proc. MICCAI Multi-Atlas Labeling Beyond Cranial Vault—Workshop Challenge. vol. 5, p. 12 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.688, + 0.787, + 0.73 + ], + "angle": 0, + "content": "27. Li, Y., Shao, H.C., Liang, X., Chen, L., Li, R., Jiang, S., Wang, J., Zhang, Y.: Zero-shot medical image translation via frequency-guided diffusion models. arXiv preprint arXiv:2304.02742 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.787, + 0.744 + ], + "angle": 0, + "content": "28. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.787, + 0.771 + ], + "angle": 0, + "content": "29. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15, 1-9 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.787, + 0.841 + ], + "angle": 0, + "content": "30. McGinnis, J., Shit, S., Li, H.B., Sideri-Lampretsa, V., Graf, R., Dannecker, M., Pan, J., Stolt-Anso, N., Mühlau, M., Kirschke, J.S., et al.: Single-subject multicontrast mri super-resolution via implicit neural representations. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 173-183. Springer (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.237, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.191, + 0.787, + 0.247 + ], + "angle": 0, + "content": "32. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.248, + 0.787, + 0.316 + ], + "angle": 0, + "content": "33. Naval Marimont, S., Tarroni, G.: Implicit field learning for unsupervised anomaly detection in medical images. In: Medical Image Computing and Computer Assisted Intervention-MICCAI 2021: 24th International Conference, Strasbourg, France, September 27-October 1, 2021, Proceedings, Part II 24. pp. 189-198. Springer (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.317, + 0.787, + 0.345 + ], + "angle": 0, + "content": "34. Pasupathy, A.: The neural basis of image segmentation in the primate brain. Neuroscience 296, 101-109 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.346, + 0.787, + 0.387 + ], + "angle": 0, + "content": "35. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: International Conference on Machine Learning. pp. 5301-5310. PMLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.388, + 0.787, + 0.43 + ], + "angle": 0, + "content": "36. Reich, C., Prangemeier, T., Cetin, O., Koeppl, H.: OSS-Net: Memory efficient high resolution semantic segmentation of 3D medical data. In: British Machine Vision Conference (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.431, + 0.787, + 0.459 + ], + "angle": 0, + "content": "37. Ronneberger, O., Fischer, P., Brox, T.: U-Net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241. Springer (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.459, + 0.787, + 0.5 + ], + "angle": 0, + "content": "38. Shi, H., Han, S., Huang, S., Liao, Y., Li, G., Kong, X., Zhu, H., Wang, X., Liu, S.: Mask-enhanced segment anything model for tumor lesion semantic segmentation. arXiv preprint arXiv:2403.05912 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.501, + 0.787, + 0.543 + ], + "angle": 0, + "content": "39. Sørensen, K., Camara, O., Backer, O., Kofoed, K., Paulsen, R.: NUDF: Neural unsigned distance fields for high resolution 3D medical image segmentation. ISBI pp. 1-5 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.544, + 0.787, + 0.586 + ], + "angle": 0, + "content": "40. Stolt-Ansó, N., McGinnis, J., Pan, J., Hammernik, K., Rueckert, D.: Nisf: Neural implicit segmentation functions. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 734-744. Springer (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.587, + 0.787, + 0.628 + ], + "angle": 0, + "content": "41. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.629, + 0.787, + 0.684 + ], + "angle": 0, + "content": "42. Wei, X., Zhang, R., Wu, J., Liu, J., Lu, M., Guo, Y., Zhang, S.: Nto3d: Neural target object 3d reconstruction with segment anything. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20352-20362 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.685, + 0.787, + 0.727 + ], + "angle": 0, + "content": "43. Wu, J., Fu, R., Fang, H., Liu, Y., Wang, Z., Xu, Y., Jin, Y., Arbel, T.: Medical sam adapter: Adapting segment anything model for medical image segmentation. arXiv preprint arXiv:2304.12620 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.728, + 0.787, + 0.755 + ], + "angle": 0, + "content": "44. Yang, J., Wickramasinghe, U., Ni, B., Fua, P.: ImplicitAtlas: Learning deformable shape templates in medical imaging. In: CVPR. pp. 15861-15871 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.756, + 0.787, + 0.812 + ], + "angle": 0, + "content": "45. You, C., Dai, W., Min, Y., Staib, L., Duncan, J.S.: Implicit anatomical rendering for medical image segmentation with stochastic experts. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 561-571. Springer (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.787, + 0.84 + ], + "angle": 0, + "content": "46. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "X. Wei et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "47. Zhang, Y., Gu, P., Sapkota, N., Chen, D.Z.: Swipe: Efficient and robust medical image segmentation with implicit patch embeddings. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 315-326. Springer (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.787, + 0.26 + ], + "angle": 0, + "content": "48. Zhang, Y., Sapkota, N., Gu, P., Peng, Y., Zheng, H., Chen, D.Z.: Keep your friends close & enemies farther: Debiasing contrastive learning with spatial priors in 3D radiology images. In: 2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). pp. 1824-1829. IEEE (2022)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.26 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_origin.pdf b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0ec6cd3ef12aeb4c04d9e0edcc43bbe87fdb6bb2 --- /dev/null +++ b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/3c7b833c-6f6c-486f-ac98-b9ffa5c4c1d4_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6aefc3eefa922e87565376e5359e8e0779cb99f6d01edbeecfe9fb3a75d15421 +size 3699040 diff --git a/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/full.md b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/full.md new file mode 100644 index 0000000000000000000000000000000000000000..b00ecc8fb8b60e50907f26d34761e7f6e58da4a7 --- /dev/null +++ b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/full.md @@ -0,0 +1,314 @@ +# I-MedSAM: Implicit Medical Image Segmentation with Segment Anything + +Xiaobao Wei $^{1,2,3,*}$ , Jiajun Cao $^{1,4,*}$ , Yizhu Jin $^{1,5}$ , Ming Lu $^{1}$ , Guangyu Wang $^{6}$ , and Shanghang Zhang $^{1,\dagger}$ + +$^{1}$ State Key Laboratory of Multimedia Information Processing, School of Computer Science, Peking University $^{2}$ University of Chinese Academy of Sciences $^{3}$ Institute of Software, Chinese Academy of Sciences $^{4}$ Xi'an Jiaotong University $^{5}$ Beihang University $^{6}$ Beijing University of Posts and Telecommunications weixiaobao0210@gmail.com + +Abstract. With the development of Deep Neural Networks (DNNs), many efforts have been made to handle medical image segmentation. Traditional methods such as nnUNet train specific segmentation models on the individual datasets. Plenty of recent methods have been proposed to adapt the foundational Segment Anything Model (SAM) to medical image segmentation. However, they still focus on discrete representations to generate pixel-wise predictions, which are spatially inflexible and scale poorly to higher resolution. In contrast, implicit methods learn continuous representations for segmentation, which is crucial for medical image segmentation. In this paper, we propose I-MedSAM, which leverages the benefits of both continuous representations and SAM, to obtain better cross-domain ability and accurate boundary delineation. Since medical image segmentation needs to predict detailed segmentation boundaries, we designed a novel adapter to enhance the SAM features with high-frequency information during Parameter-Efficient Fine-Tuning (PEFT). To convert the SAM features and coordinates into continuous segmentation output, we utilize Implicit Neural Representation (INR) to learn an implicit segmentation decoder. We also propose an uncertainty-guided sampling strategy for efficient learning of INR. Extensive evaluations on 2D medical image segmentation tasks have shown that our proposed method with only 1.6M trainable parameters outperforms existing methods including discrete and implicit methods. The code will be available at: https://github.com/ucwxb/I-MedSAM. + +Keywords: Medical Image Segmentation $\cdot$ Implicit Neural Representation $\cdot$ Segment Anything + +# 1 Introduction + +Medical image segmentation, as a pivotal component of auxiliary disease diagnosis, holds a crucial role in medical image applications. The advent of deep + +![](images/bb6ffe0efd6da3a6d6d4c3bb12c8a0fc399901924eca34597ec9c6d32f309fee.jpg) +(a) Illustrations of discrete and continuous representation for medical segmentation. + +![](images/f1175b168ef2a0e9b9e70724fef231cab31571c85ef996025d78a4671b6b12cc.jpg) +(b) Segmentation quality comparison between our I-MedSAM and baselines. +Fig. 1: (a) Continuous representation with implicit decoders exhibits superior scale flexibility. (b) I-MedSAM with the fewest trainable params (1.6M) surpasses the state-of-the-art discrete and implicit approaches and exhibits a solid generalization ability when facing data shifts. Please refer to Sec. 4 for more experiment details. + +learning has spurred the widespread adoption of neural networks customized for medical images. For example, nnUNet [37] leverages the downsampling and upsampling modules to aggregate multi-scale contextual features. Transformers [41] uses the self-attention mechanism to significantly augment the representation capacity of deep neural networks, improving the accuracy in medical image segmentation [5]. Recent advancements have witnessed the integration of foundation models as backbones in various works. The Segment Anything Model (SAM) [24] demonstrates unprecedented zero-shot segmentation ability. Therefore, diverse adapters based on parameter-efficient fine-tuning (PEFT) are crafted to fine-tune SAM for medical images [29, 42, 43, 46]. + +Despite their notable effectiveness, these methods primarily focus on pixelwise or voxel-wise predictions [10,13,19,29,37,46]. While they achieve promising results, the discrete representations present challenges in spatial flexibility and introduce discretization artifacts when scaling to arbitrary input sizes. Additionally, the discrete representations give rise to ambiguity when extracting the nuanced details crucial for precise boundary delineation [31], which is important in medical image analysis. The delineation of boundaries can signify the transitions between different human tissues or anatomical structures, thus providing essential information for accurately separating these instances. Usually, the intricacy and subtlety of this delineation process need additional refinement [1,34]. + +Compared with discrete representations, continuous representations learn Implicit Neural Representations (INRs) [32] to transform discrete representations into continuous space. As shown in Fig. 1a, numerous approaches learn a mapping from encoded image features and grid coordinates to the segmentation output, enabling adaptability to various output resolutions [22,33,36,47]. However, current approaches show unsatisfying domain transfer ability due to the limited representation capabilities of their pre-trained image encoders. Additionally, the boundary information of images demonstrates a strong correlation + +with features in the frequency domain [11, 27], which is also ignored by most previous methodologies. Lastly, existing methods adopt random sampling across coordinates, underestimating the influence of sampling strategies when learning INRs. + +To address the aforementioned limitations, we propose I-MedSAM, a model that leverages the benefits of both continuous representations and SAM, aiming to enhance cross-domain capabilities and achieve precise boundary delineation. Given the medical images, I-MedSAM extracts the features from SAM with the proposed frequency adapter, which aggregates high-frequency information from the frequency domain. These features along with the grid coordinates are decoded into segmentation outputs by the learned INRs. We employ a two-stage implicit segmentation decoder, consisting of two INRs in a coarse-to-fine manner. The first INR produces coarse segmentation results and features. Subsequently, a novel uncertainty-guided sampling strategy is applied to sample Top-K variance feature points along with their corresponding grid coordinates. Finally, these selected samples are fed into the second INR to obtain refined segmentation results. Notably, I-MedSAM is trained end-to-end with a minimal number of trainable parameters, yet it achieves state-of-the-art performance compared with all baseline methods. Our main contributions are summarized as follows: + +- We propose I-MedSAM, a novel method that leverages the advantages of SAM and continuous representations. +- We propose a novel frequency adapter that utilizes high-frequency information to enhance features, thereby accurately segmenting boundaries. +- We propose a novel coarse-to-fine INR decoder with an uncertainty-guided sampling (UGS) strategy, to learn a mapping from features and coordinates to segmentation output. +- We perform detailed evaluations of I-MedSAM on 2D medical image segmentation. As shown in Fig. 1b, I-MedSAM outperforms state-of-the-art continuous and discrete methods. Experiments also demonstrate that I-MedSAM is robust to scale and domain shifts. + +# 2 Related Work + +Implicit Neural Representation. The concept of signal representation is fundamental across various domains, especially in the field of computer vision [31,32]. Traditional methods for encoding signals discretize the input space into pixel or voxel grids [4,6,7,9,10,15,19,37,38,46]. Different from these discrete methods, Implicit Neural Representation (INR) learns generator functions that map input coordinates into the signal values [8]. Numerous studies employ INR for diverse tasks, including medical data reconstruction, rendering, compression, registration, super-resolution and segmentation [2, 25, 30, 32, 44]. For segmentation, conventional methods typically consist of a trained feature encoder and a decoder. The encoder encodes medical data into features, and the decoder subsequently decodes features along with their coordinates into segmentation + +output [17, 22, 23, 36, 39, 40, 45, 47]. However, current methods exhibit an imbalance in emphasizing either global or local features and demonstrate relatively low out-of-distribution ability. In contrast, our proposed approach leverages the segmentation foundation model SAM to enrich feature extraction. Moreover, we introduce an innovative uncertainty-guided sampling (UGS) strategy into the INR, enabling the adaptive selection of samples to train the implicit segmentation decoder. Please refer to the appendix for more related work. + +# 3 Methodology + +In this section, we initially provide a concise overview of the implicit image segmentation problem. Then, we proceed to elaborate on the pipeline of I-MedSAM. Finally, we elucidate the novel designs introduced in I-MedSAM. + +![](images/dc0e69c38b65636ec1a32cffdb70d892cd5ae75a2570334f566ea59da8e3d645.jpg) +Fig. 2: The overall pipeline of I-MedSAM. First, given the medical images and a coarse bounding box as a prompt, I-MedSAM utilizes the medical image encoder and the prompt encoder to generate discrete features. For the medical image encoder, we design low-rank adapters and frequency adapters to extract information from the spatial domain and frequency domain. Then I-MedSAM interpolates all features to align with the encoded coordinates and decodes them in coarse to fine neural fields. We propose an Uncertainty Guided Sampling (UGS) strategy to adaptively choose the highest variance points and refine predictions. I-MedSAM merges the predictions from coarse and fine neural fields as the final prediction maps. + +# 3.1 Preliminaries + +In traditional discrete segmentation with $C$ classes, neural networks aim to learn a direct mapping from input medical images $X \in \mathbb{R}^{H \times W \times 3}$ to class probabilities $O \in \mathbb{R}^{H \times W \times C}$ at the same resolution, in which $H$ and $W$ means height and width of input images, respectively. + +On the other hand, implicit image segmentation seeks to map each pixel of medical images $X$ with its coordinate $p_i = (x,y)$ , where $x,y\in [-1,1]$ , to class probabilities $\hat{o}_i\in \mathbb{R}^C$ , denoted as $\mathcal{N}_{\theta}: (p_i,X_i)\to \hat{o}_i$ . Here, $\mathcal{N}_{\theta}$ represents a neural network parameterized by weights $\theta$ . This formulation incorporates coordinates directly on pixels, adjusting the spatial granularity of input coordinates for predictions at arbitrary resolution, from source resolution $H\times W$ to target resolution $H^{\prime}\times W^{\prime}$ , which can be represented as $X\in \mathbb{R}^{H\times W\times 3}\rightarrow O\in \mathbb{R}^{H^{\prime}\times W^{\prime}\times C}$ . Moreover, it allows the direct application of pixel-wise loss functions like Cross Entropy or Dice. Additionally, the zero-isosurface in $\mathcal{N}_{\theta}$ 's implicit space represents object boundaries, providing an additional advantage for boundary modeling. + +# 3.2 Overall Pipeline + +As depicted in Fig. 2, I-MedSAM comprises two main parts. The first part integrates an image encoder with its adapters, forming $Enc_{I}$ , and a prompt encoder $Enc_{P}$ , following SAM's design. Specifically, recognizing the significant role of the frequency domain in segmentation boundary representation, a frequency adapter is devised for extracting frequency features. Taking a medical image and a prompt bounding box as inputs, multi-scale features are extracted from both spatial and frequency domains. In scenarios involving cross-resolution, the extracted features need to be interpolated from the source resolution to achieve segmentation output at the target resolution. + +The second part is the implicit segmentation decoder $Dec$ , comprising two stacked INRs: one "coarse" $Dec_{c}$ with shallow layers and one "fine" $Dec_{f}$ with deeper layers. Typically, $Dec_{c}$ generates a coarse segmentation map, and $Dec_{f}$ refines it on sampled points. The selection of these points is determined by the pixel-wise uncertainty of segmentation predictions, assessed through MC-Dropout and Top-K algorithms. Detailed explanations of these two parts will be provided in the following sections. + +# 3.3 Medical Image Encoder + +In this section, we introduce the frequency adapter and low-rank adapter integrated into SAM, to extract features from both frequency and spatial domains. + +Frequency Adapter. Discrete Fourier Transform (DFT) is a common and effective method for transforming an image into the frequency domain. In practice, the Fast Fourier Transform (FFT) is employed for efficient computation of DFT, the spectrum representation of $f_{h,w}$ can be formulated as: + +$$ +\mathcal {F} _ {u, v} = \sum_ {h = 1} ^ {H} \sum_ {w = 1} ^ {W} f _ {h, w} \cdot \mathrm {e} ^ {- j 2 \pi \left(\frac {h}{H} u + \frac {w}{W} v\right)}. \tag {1} +$$ + +Subsequently, the amplitude and phase spectrum of $\mathcal{F}_{u,v}$ can be obtained as $|\mathcal{F}_{u,v}|$ and $\arg (\mathcal{F}_{u,v})$ , respectively. Experiment results in Tab. 6 indicate that the amplitude spectrum exhibits superior representation ability compared to + +the phase spectrum. Therefore, we default to using the amplitude spectrum for our proposed frequency adapter (FA). + +As illustrated in Fig. 3, the individual FA comprises a linear down-projection layer, a GELU activation layer, and a linear up-projection layer. In total, we utilize $n$ instances of FA as a sequence, corresponding to the number of Vision Transformer (ViT) Blocks of $Enc_{I}$ . + +Low-Rank Adapter. In contrast to fine-tuning all parameters in the image encoder $Enc_I$ , we leverage the Low-Rank Adapter (LoRA) [16] to update a small fraction of parameters, adapting SAM to medical images, as illustrated in Fig. 3. Given the encoded token sequence $F \in \mathbb{R}^{B \times N \times C_{in}}$ , the resulting token sequence $\hat{F} \in \mathbb{R}^{B \times N \times C_{out}}$ is generated using a projection layer $W_p \in \mathbb{R}^{C_{out} \times C_{in}}$ , denoted as $\hat{F} = W_pF$ . LoRA proposes that the adjustment to $W_p$ should be gradual and consistent. It recommends utilizing a low-rank approximation $A \in \mathbb{R}^{r \times C_{in}}$ and $B \in \mathbb{R}^{C_{out} \times r}$ to represent this gradual update, which can be formulated as: + +$$ +\hat {W} _ {p} = W _ {p} + \Delta W _ {p} = W _ {p} + B A. \qquad (2) +$$ + +![](images/8295a7e7bdfc3e3d92c0a125a918736c6060e7d4ca12a82974c3e05fd65ccdd9.jpg) +Fig. 3: Illustration of the proposed frequency adapter and LoRA in the image encoder. The image/frequency embedding from patch embedding undergoes two separate branches in the encoder. + +As the multi-head attention mechanism determines the regions to focus on, it is reasonable to apply LoRA to the frozen projection layers of query $Q$ , key $K$ , or value $V$ to influence the attention scores. We notice that I-MedSAM performs better when LoRA is applied to the query $Q$ and value $V$ projection layers, which can be expressed as: + +$$ +\left\{ \begin{array}{l} Q = \hat {W} _ {q} F = W _ {q} F + B _ {q} A _ {q} F \\ K = W _ {k} F \\ V = \hat {W} _ {v} F = W _ {v} F + B _ {v} A _ {v} F \end{array} \right. \tag {3} +$$ + +where $W_{q}$ , $W_{k}$ and $W_{v}$ are frozen projection layers from SAM's image encoder, and $A_{q}, B_{q}, A_{v}, B_{v}$ are trainable LoRA parameters. + +# 3.4 Implicit Segmentation Decoder + +In this section, we introduce a coarse-to-fine implicit neural representation with an uncertainty-guided sampling (UGS) strategy to decode features from encoders into the segmentation maps at target resolutions. + +Coarse to Fine Implicit Neural Representation. Given features from the image encoder $Enc_I$ and the prompt encoder $Enc_P$ , we interpolate them from source to target resolutions and concatenate them with coordinates $p$ . These + +coordinates $p$ are generated at the target resolutions and normalized to $[-1, 1]$ . To address potential biased learning resulting from the direct use of input coordinates [35], we encode the coordinates into a higher-dimensional space using a high-frequency positional encoding function, which is defined as: + +$$ +\gamma (p) = (\sin (2 ^ {0} \pi p), \cos (2 ^ {0} \pi p), \dots , \sin (2 ^ {L - 1} \pi p), \cos (2 ^ {L - 1} \pi p)) \tag {4} +$$ + +where the hyperparameter $L$ is set to 10 in our experiments following the previous work. The encoded coordinates, the encoded features from both the image and prompt encoders are concatenated to feed into the decoder: + +$$ +Z ^ {p} = \operatorname {C o n c a t} (\gamma (p), \operatorname {I n t e r p} \left(\operatorname {E n c} _ {I} (X)\right), \operatorname {E n c} _ {I} (P)). \tag {5} +$$ + +Here, $X$ and $P$ represent the input medical image and the corresponding coarse bounding box prompt, respectively. The function Interp refers to the interpolation function based on bilinear algorithms, which is used to interpolate the encoded features from source to target resolution, in alignment with the encoded coordinates. + +Inspired by NeRF [31], we depart from the one-stage INR approaches to introduce a two-stage decoding process. This involves optimizing two INRs simultaneously: one "coarse" $Dec_{c}$ , with shallow layers, and one "fine" $Dec_{f}$ , with deeper layers. $Dec_{c}$ produces a coarse segmentation map, $\hat{o}_i^c$ , serving as reference for $Dec_{f}$ to refine. Additionally, $Dec_{c}$ generates coarse features, $z_i^c$ , employed by $Dec_{f}$ in its refinement process. + +We employ MC-dropout to calculate the uncertainty of features $\hat{\sigma}_i^c$ for each pixel. Subsequently, a Top-K percentage of feature points is sampled based on this uncertainty, denoted as $z_i^s$ (with $s\in S$ ). Finally, the predictions from the "coarse" and "fine" INRs are combined to produce the output of I-MedSAM. The decoding process is formulated as follows: + +$$ +\hat {\partial} _ {i} ^ {c}, z _ {i} ^ {c} = D e c _ {c} (z _ {i} ^ {p}) +$$ + +$$ +\begin{array}{l} z _ {i} ^ {s} = U G S \left(z _ {i} ^ {c}\right), s \in \mathcal {S} \\ \hat {\partial} _ {i} ^ {f} = D e c _ {f} \left(z _ {i} ^ {s}\right) \end{array} \tag {6} +$$ + +$$ +\hat {O} = \hat {O} ^ {c} (\mathcal {S} \setminus s) \cup \hat {O} ^ {f} (s), \hat {\sigma} _ {i} \in \hat {O}. +$$ + +Here, $UGS$ represents Uncertainty Guided Sampling, which will be further illustrated in the following section. + +Uncertainty Guided Sampling. In the sampling process, we select feature points that require refinement from the "coarse" INR $Dec_{c}$ and feed them into the "fine" INR $Dec_{f}$ , based on uncertainty estimation. Drawing inspiration from MC-Dropout methods [12, 14], we apply dropout $T$ times to obtain $T$ prediction results of coarse segmentation probabilities, $\{o_i^c\}_{t=1}^T$ , given the input features $z_i^p$ , denoted as $\{p_t(o_i^c|z_i^p)\}_{t=1}^T$ . The uncertainty is calculated as the variance of + +predictions for each feature point, expressed as: + +$$ +\left\{ \begin{array}{l} \mu_ {i} = \frac {1}{T} \sum_ {t = 1} ^ {T} \left(p _ {t} \left(o _ {i} ^ {c} \mid z _ {i} ^ {p}\right)\right) \\ u _ {i} = \frac {1}{T} \sum_ {t = 1} ^ {T} \left(p _ {t} \left(o _ {i} ^ {c} \mid z _ {i} ^ {p}\right) - \mu_ {i}\right) ^ {2}. \end{array} \right. \tag {7} +$$ + +Subsequently, we sample the feature points with the highest Top-K percentage uncertainty to form $z_{i}^{s}$ for $Dec_{f}$ to refine. This estimation of uncertainty reflects the variation in prediction difficulty among different samples. It adaptively selects pixels with higher difficulty for refinement by $Dec_{f}$ , achieving more accurate segmentation results. + +# 3.5 Training I-MedSAM + +To optimize the trainable parameters of I-MedSAM, we freeze the pre-trained image encoder $Enc_I$ , while only unfreezing the proposed adapters, prompt encoder $Enc_P$ and INRs. We utilize SAM's image encoder with LoRA and our proposed frequency adapter to extract features for input medical images $X$ , while extracting prompt features in terms of coarse bounding box $P$ for targeted segmentation objects. The coarse bounding box $P$ is randomly adjusted the height and width following the previous work [46]. Then we concatenate features along with the mapped coordinate values and decode them with the proposed two-stage INR decoder. With the coarse to fine INR and the uncertainty guided sampling strategy, I-MedSAM obtains the coarse and refined point-wise segmentation probabilities $\{\hat{o}_i^c,\hat{o}_i^f\}_{i\in X}$ , combined as $\hat{o}_i$ . For training optimization, we adopt pixel-wise segmentation loss, which can be formulated as: + +$$ +L _ {s e g} \left(o _ {i}, \hat {o} _ {i}\right) = 0. 5 \cdot L _ {c e} \left(o _ {i}, \hat {o} _ {i}\right) + 0. 5 \cdot L _ {d c} \left(o _ {i}, \hat {o} _ {i}\right) \tag {8} +$$ + +where $L_{ce}$ and $L_{dc}$ stand for Cross Entropy loss and Dice loss respectively. We apply the loss to supervise both coarse and refined segmentation maps progressively. Within the training process, we decrease weights for coarse supervision and increase weights for refined supervision until I-MedSAM converges. + +# 4 Experiments + +In this section, we present extensive experiments to evaluate the effectiveness of I-MedSAM for medical image segmentation. We first introduce the experimental settings including datasets and training details. Then we compare our method with the SOTA implicit and discrete approaches on the binary polyp segmentation [20] and multi-class organ segmentation [26] qualitatively and quantitatively. We further evaluate the performance and robustness of I-MedSAM when facing data shifts. Finally, we conduct a comprehensive ablation study to evaluate the contribution of each component. Due to space limitations, we provide more details and visualization results in the supplementary material. + +Table 1: Overall segmentation results versus the state-of-the-art discrete approaches and implicit approaches. The Trainable Params columns report unfrozen parameters in training and the Dice columns report averaged scores with standard deviation. + +
Binary Polyp SegmentationMulti-class Organ Segmentation
MethodDice (%)↑Trainable Params (M)↓MethodDice (%)↑Trainable Params (M)↓
Discrete Approaches
U-Net[37]63.89±1.307.9U-Net[37]74.47±1.5716.3
PraNet[10]82.56±1.0830.5UNETR[15]81.14±0.8592.6
Res2UNet[13]81.62±0.9725.4Res2UNet[13]79.23±0.6638.3
nnUNet[19]82.97±0.89126.6nnUNet[19]85.15±0.67126.6
MedSAM[29]82.88±0.554.1MedSAM[29]85.85±0.8152.7
Implicit Approaches
OSSNet[36]76.11±1.145.2OSSNet[36]73.38±1.657.6
IOSNet[22]78.37±0.764.1IOSNet[22]76.75±1.376.2
SwIPE[47]85.05±0.822.7SwIPE[47]81.21±0.944.4
I-MedSAM (ours)91.49±0.521.6I-MedSAM (ours)89.91±0.683.5
+ +# 4.1 Experimental Settings + +Datasets. We assess the performance of our model on two distinct tasks: binary polyp segmentation and multi-class abdominal organ segmentation. For binary polyp segmentation, we conduct experiments using the challenging Kvasir-Sessile dataset [20], consisting of 196 RGB images of small sessile polyps. Additionally, we evaluate the generalization capability of our model by testing the pre-trained I-MedSAM directly to the CVC-ClinicDB dataset [3], comprising 612 images from 31 colonoscopy sequences. + +For multi-organ segmentation, training is conducted on the BCV dataset [26], comprising 30 CT scans with annotations for 13 organs. Model robustness is also evaluated using the pre-trained I-MedSAM on diverse CT images in AMOS [21] (200 training CTs, maintaining the same setup as in [48]). Since our work is dedicated to showing the effectiveness of 2D medical image segmentation, we just slice-wise segment CT data. Following the data prepossess in SwIPE [47], all datasets are divided with a train:validation:test ratio of 60:20:20, and the reported dice scores are all based on the test set. + +Implementation Details. The training process of I-MedSAM involves fine-tuning the encoder of SAM [24], utilizing ViT-B as the backbone. We set LoRA ranks to 4 and incorporate amplitude information in the frequency adapters. For implicit segmentation decoders, we set latent MLP dimensions as [1024, 512] for $Dec_{c}$ and [512, 256, 256, 128] for $Dec_{f}$ . We sample the highest uncertainty points with a proportion of $12.5\%$ and set the dropout probabilities to 0.5. + +For multi-organ segmentation, we slightly modify the number of the last layer in $Dec_{c}$ and $Dec_{f}$ to match target segmentation classes. I-MedSAM are optimized by AdamW [28] with $\alpha = 0.5$ , $\beta = 0.1$ , and $\lambda_{ada} = 5 \times 10^{-5}$ for adapters in the encoder and $\lambda_{dec} = 1 \times 10^{-3}$ . For fair comparisons, all methods are trained for 1000 epochs on the same experiment settings. The reported test dice score and Hausdorff Distance [18] correspond to the best validation epoch. Image input sizes are $384 \times 384$ for Sessile and $512 \times 512$ for each slice of BCV. + +![](images/3af6c3a6625274c5cd3859a8ba7b06456458a5a0947ab9e2d46c631733f47843.jpg) +Fig. 4: Qualitative comparison on Kvasir-Sessile dataset for binary polyp segmentation. + +Baselines. We divide baselines into two sets: discrete approaches and implicit (continuous) approaches. Discrete approaches include U-Net [37], PraNet [10], Res2UNet [13], nnUNet [19], UNETR [15] and MedSAM [29]. Specifically, MedSAM [29] is also a SAM-based approach, where SAM's original decoder is directly finetined. Implicit approaches include OSSNet [36], IOSNet [22] and SwIPE [47]. Given the absence of code availability from the prior state-of-the-art SwIPE [47] for extended comparison and the demonstrated superiority of IOSNet [22] over OSSNet [36] in implicit approaches, we primarily compare our method with IOSNet [22] in several experiment settings. + +# 4.2 Quantitative Comparison + +In this section, we first report the dice score compared with baselines. Then we conduct experiments across different resolutions and domains to evaluate the robustness and generalization ability under data shifts. Finally, we implement Hausdorff Distance (HD distance) [18] to compare the quality of the segmentation boundary with baselines across different experiment settings. + +Segmentation Comparison. We make a comparison with both the discrete methods and implicit methods in terms of trainable parameters and Dice score with standard deviation on Polyp Sessile for binary-class segmentation and CT BCV for multi-class segmentation, as demonstrated in Tab. 1. On the smaller polyp dataset, we observe notable improvements over the best-known implicit methods and discrete methods with much fewer trainable parameters (1.26% of nnNet [19] and 59.26% of SwIPE [47]). For multi-organ segmentation on BCV, performance gains are also significant compared with the best-known + +![](images/f1885b82ae032fded0c7baa4a11531488cb339fc71b10f047c30a7e7e116dfe7.jpg) +Fig. 5: Qualitative comparison on BCV dataset for multi-organ segmentation. + +implicit methods and discrete methods. On the one hand, SAM, with the assistance of the proposed frequency adapters, generates abundant features that enhance the quality of segmentation boundaries. In contrast, SwIPE employs Res2Net-50 [13] as its backbone, which offers less sufficient features compared to SAM's, leading to inferior segmentation quality. On the other hand, with the proposed uncertainty-guided sampling in INR decoders, I-MedSAM adaptively selects and refines uncertain pixels with the highest variance, leading to more accurate segmentation maps. + +Robustness under Data Shifts. We compare the robustness across resolutions and domains with the best discrete and implicit methods on binary-class polyp segmentation. + +Firstly, to adapt the pre-trained I-MedSAM model, originally trained on standard $384 \times 384$ images, to different target resolutions such as $128 \times 128$ for lower resolutions and $896 \times 896$ for higher resolutions, the input coordinates $(384 \times 384)$ are scaled accordingly to match the target resolutions. Subsequently, the dice score is computed at these corresponding target resolutions. For discrete methods, the resolution of output images remains the same as that of the input images. We input the original images at their source resolution $(384 \times 384)$ and resize the output segmentation maps to the target resolution for evaluation. Additionally, we denote discrete + +basielines with the suffix $*$ , where the original medical images are resized to + +Table 2: Cross-resolution from ${384} \times {384}$ to ${128} \times {128}$ ,from ${384} \times$ 384 to ${896} \times {896}$ on Kvasir-Sessile. + +
MethodDice (%)↑
384 → 128384 → 896
Discrete Approaches
PraNet[10]72.6474.95
PraNet*[10]68.7943.92
nnUNet[19]73.9783.56
nnUNet*[19]65.3476.36
MedSAM[29]82.3983.19
MedSAM*[29]82.3783.32
Implicit Approaches
IOSNet[22]76.1878.01
SwIPE[47]81.2684.33
I-MedSAM (ours)91.4591.33
+ +the target resolution and then provided as input to these methods to directly generate segmentation at the target resolution. + +As shown in Tab. 2, implicit methods exhibit spatial flexibility and consistently outperform discrete methods. Among implicit approaches, our I-MedSAM achieves the highest performance across various output resolutions. This superior performance can be attributed to the efficacy of the proposed frequency adapters and uncertainty-guided sampling, enhancing I-MedSAM's capability to provide accurate predictions at arbitrary resolutions. + +Secondly, we investigate the robustness of model performance across different datasets for the same task. In the binary-class polyp segmentation task, all methods are pre-trained on the Kvasir-Sessile dataset and evaluated directly on the CVC dataset. Similarly, in the multi-class abdominal organ segmentation task, all methods are pre-trained on the BCV dataset and evaluated on the AMOS dataset, focusing solely on the liver class. As shown in Tab. 3, leveraging the generalization ability of SAM, I-MedSAM outperforms the top discrete method, achieving dice scores of $88.83\%$ and $86.28\%$ respectively. For additional visualization + +Table 3: Cross-domain on binary polyp segmentation and multi-class abdominal organ segmentation. + +
MethodDice (%)
Kvasir-Sessile → CVC
PraNet[10]68.37
nnUNet[19]84.91
MedSAM[29]74.59
IOSNet[22]59.42
SwIPE[47]70.10
I-MedSAM (ours)88.83
BCV → AMOS
UNETR[10]81.75
nnUNet[19]79.63
MedSAM[29]71.98
IOSNet[22]79.48
SwIPE[47]82.81
I-MedSAM (ours)86.28
+ +comparisons regarding data shifts, please refer to the supplementary materials. + +Boundary Comparison. We further utilize the Hausdorff Distance (HD distance) [18] to assess segmentation boundary quality. I-MedSAM achieves a lower HD distance, indicating superior boundary quality. For more detailed boundary visualizations, please refer to Fig.4 and the supplementary materials. + +Table 4: Hausdorff Distance comparison on various experiment settings. + +
HD distance (↓)Kvasir-SessileKvasir-Sessile → CVC384 → 128384 → 896BCVBCV → AMOS
nnUNet[19]31.3082.3113.6972.316.5080.39
MedSAM[29]21.5330.158.0451.8210.6252.14
IOSNet[22]51.7281.6035.3387.8621.4661.19
I-MedSAM(Ours)11.5919.767.9132.775.9537.53
+ +# 4.3 Qualitative Comparison + +As shown in Fig. 4 and Fig. 5, we conduct qualitative comparisons on Kvasir-Sessile and BCV datasets. Due to the unavailability of code for inference, SwIPE has been omitted from the visual comparison. We also provide input medical images along with corresponding ground truth segmentation masks. The segmentation boundaries are delineated by green lines in Fig. 4. From the figures, it can be witnessed that I-MedSAM obtains better segmentation boundaries. Thanks + +to the proposed frequency adapters and uncertainty guided sampling techniques, I-MedSAM can efficiently aggregate high-frequency information from the input, which is beneficial to the accuracy of final segmentation maps. Due to the space limitation, please refer to supplementary materials for more qualitative results. + +# 4.4 Ablation Study + +We conduct ablation studies focusing on three aspects: component-wise ablations, the incorporation of frequency adapter, and point numbers for sampling. In each of our ablation experiments, other hyper-parameters remain consistent with the implementation details. + +Table 5: Effectiveness of each component of the pipeline. We evaluate the Dice metric for both cross-domain and cross-resolution tasks. + +
LoRAFAINRKvasir-SessileCross-domainCross-resolution
Kvasir-Sessile → CVC384 → 128384 → 896
✓83.6182.5772.7376.46
✓✓88.7482.6175.6978.59
✓✓88.8383.4088.1688.43
✓✓✓91.4988.8391.4591.33
+ +Component-wise ablations. To demonstrate the effectiveness of each component, we conduct a component-wise ablation on Kvasir-Sessile [20], cross-domain and cross-resolution tasks, as can be seen in Tab. 5. We employ LoRA alone as a baseline for binary segmentation, obtaining a competitive performance, which is consistent with the baseline SAMed [46]. Following the incorporation of frequency adapters and INR decoders separately, the model's performance exhibits improvements. It can be observed that the INR decoder exhibits a more pronounced advantage in cross-domain and cross-resolution tasks. Furthermore, simultaneously employing frequency adapters (FA) and INR decoders can achieve a synergistic effect where $1 + 1 > 2$ . + +Incorporating the frequency adapter. Tab. 6 indicates the effectiveness of the frequency adapter, and it can be observed that amplitude information is more helpful for spectrum representation compared to phase information. The results also demonstrate the segmentation boundary benefits from the frequency adapter. + +Points Number for Sampling. Tab. 7 represents ablation on points number for Uncertainty Guided Sampling (UGS). This experiment reveals that I-MedSAM generates high-quality segmentation masks with the help of the proposed uncertainty guided sampling method. Excessive sampling points do not necessarily im + +Table 6: Ablation study on Frequency Adapter (FA). $\mathrm{FA}_{pha}$ stands for utilizing of the phase spectrum of DFT, while $\mathrm{FA}_{amp}$ stands for the amplitude spectrum of DFT. + +
Settingw/o FAFAphaFAamp
Dice (%)88.8390.6091.49
HD15.4412.6711.59
+ +prove the final segmentation results and may lead to increased memory consumption. Conversely, insufficient sampling points may limit the areas that require refinement. Therefore, a proportion of $12.5\%$ for UGS is deemed appropriate for I-MedSAM. The parameter can be adjusted according to the specific tasks. + +Table 7: Ablation study on the number of sampled feature points for Uncertainty Guided Sampling (UGS). "Top-K" denotes the selection of a specified proportion, K%, from all feature points. + +
Settingw/o UGSTop-50%Top-25%Top-12.5%Top-6.25%Top-3.125%
Dice (%)87.7790.2789.5991.4991.0190.48
HD Distance16.1513.8814.1211.5912.9914.53
+ +# 4.5 Effect of different training annotations + +To illustrate the generalization ability between I-MedSAM and baselines, we further conduct experiments on different proportions of training annotation amount. Following the experiment settings in SwIPE [47], based on the divided training set, we train I-MedSAM on $10\%$ , $25\%$ , $50\%$ and $100\%$ of the training set. As shown in Sec. 4.5, our I-MedSAM outperforms all baselines at various training annotation amounts. Thanks to the great generalization ability of SAM's encoder in I-MedSAM, I-MedSAM maintains higher segmentation performance even with relatively limited training annotations. + +# 5 Conclusion + +![](images/d13b6c8edfa01904a11f90445e0d9b448c9dbeef4796eb770ca552302645ea7d.jpg) +Fig. 6: Effect on different proportions of training annotation amount. + +In this paper, we introduce I-MedSAM to enhance cross-domain ability and adaptability to diverse output resolutions in medical image segmenta + +tion. By integrating SAM's generalized representations into the INR space, I-MedSAM achieves state-of-the-art performance across various experimental scenarios. Specifically addressing the challenge of precise boundary delineation in 2D medical images, we incorporate a frequency adapter for parameter-efficient fine-tuning to SAM, showcasing the potential benefits of complementing spatial domain information with frequency domain insights for foundation models. Additionally, the employment of the uncertainty-guided sampling strategy in coarse-to-fine INRs proves effective in the selection and refinement of challenging samples in continuous space. These findings suggest avenues for future research to establish stronger connections between different representation spaces. + +# Acknowledgement + +Shanghang Zhang is supported by the National Science and Technology Major Project of China (No. 2022ZD0117801). + +# References + +1. Alahmadi, M.D.: Boundary aware u-net for medical image segmentation. Arabian Journal for Science and Engineering 48(8), 9929-9940 (2023) +2. Amiranashvili, T., Lüdke, D., Li, H.B., Menze, B., Zachow, S.: Learning shape reconstruction from sparse measurements with neural implicit functions. In: International Conference on Medical Imaging with Deep Learning. pp. 22-34. PMLR (2022) +3. Bernal, J., Sánchez, F.J., Fernández-Esparrach, G., Gil, D., Rodríguez, C., Vilarino, F.: WM-DOVA maps for accurate polyp highlighting in colonoscopy: Validation vs. saliency maps from physicians. Computerized Medical Imaging and Graphics 43, 99-111 (2015) +4. Bui, N.T., Hoang, D.H., Tran, M.T., Le, N.: Sam3d: Segment anything model in volumetric medical images. arXiv preprint arXiv:2309.03493 (2023) +5. Chen, J., Lu, Y., Yu, Q., Luo, X., Adeli, E., Wang, Y., Lu, L., Yuille, A.L., Zhou, Y.: Transunet: Transformers make strong encoders for medical image segmentation. arXiv preprint arXiv:2102.04306 (2021) +6. Cheng, J., Ye, J., Deng, Z., Chen, J., Li, T., Wang, H., Su, Y., Huang, Z., Chen, J., Jiang, L., et al.: Sam-med2d. arXiv preprint arXiv:2308.16184 (2023) +7. Cheng, Z., Wei, Q., Zhu, H., Wang, Y., Qu, L., Shao, W., Zhou, Y.: Unleashing the potential of sam for medical adaptation via hierarchical decoding. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3511-3522 (2024) +8. Chibane, J., Alldieck, T., Pons-Moll, G.: Implicit functions in feature space for 3d shape reconstruction and completion. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6970-6981 (2020) +9. Deng, G., Zou, K., Ren, K., Wang, M., Yuan, X., Ying, S., Fu, H.: Sam-u: Multibox prompts triggered uncertainty estimation for reliable sam in medical image. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 368-377. Springer (2023) +0. Fan, D., Ji, G., Zhou, T., Chen, G., Fu, H., Shen, J., Shao, L.: PraNet: Parallel reverse attention network for polyp segmentation. In: MICCAI. pp. 263-273. Springer (2020) +1. Feng, Z., Wen, L., Wang, P., Yan, B., Wu, X., Zhou, J., Wang, Y.: Diffdp: Radiotherapy dose prediction via a diffusion model. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 191-201. Springer (2023) +2. Gal, Y., Ghahramani, Z.: Dropout as a bayesian approximation: Representing model uncertainty in deep learning. international conference on machine learning (2015) +3. Gao, S.H., Cheng, M.M., Zhao, K., Zhang, X.Y., Yang, M.H., Torr, P.: Res2Net: A new multi-scale backbone architecture. IEEE TPAMI 43(2), 652-662 (2019) +4. Guo, C., Pleiss, G., Sun, Y., Weinberger, K.Q.: On calibration of modern neural networks. international conference on machine learning (2017) + +15. Hatamizadeh, A., Tang, Y., Nath, V., Yang, D., Myronenko, A., Landman, B., Roth, H., Xu, D.: UNETR: Transformers for 3D medical image segmentation. In: IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 574-584 (2022) +16. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021) +17. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: ECCV. pp. 487-505. Springer (2022) +18. Huttenlocher, D.P., Klanderman, G.A., Rucklidge, W.J.: Comparing images using the hausdorff distance. IEEE Transactions on pattern analysis and machine intelligence 15(9), 850-863 (1993) +19. Isensee, F., Jaeger, P., Kohl, S., Petersen, J., Maier-Hein, K.H.: nnU-Net: A self-configuring method for deep learning-based biomedical image segmentation. Nature Methods 18(2), 203-211 (2021) +20. Jha, D., Smedsrud, P.H., Johansen, D., de Lange, T., Johansen, H.D., Halvorsen, P., Riegler, M.A.: A comprehensive study on colorectal polyp segmentation with ResUNet++, conditional random field and test-time augmentation. IEEE Journal of Biomedical and Health Informatics 25(6), 2029-2040 (2021) +21. Ji, Y., Bai, H., Yang, J., Ge, C., Zhu, Y., Zhang, R., Li, Z., Zhang, L., Ma, W., Wan, X., et al.: AMOS: A large-scale abdominal multi-organ benchmark for versatile medical image segmentation. ArXiv:2206.08023 (2022) +22. Khan, M., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: MICCAI (2022) +23. Khan, M.O., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 433-443. Springer (2022) +24. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) +25. Kuang, K., Zhang, L., Li, J., Li, H., Chen, J., Du, B., Yang, J.: What makes for automatic reconstruction of pulmonary segments. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 495-505. Springer (2022) +26. Landman, B., Xu, Z., Igelsias, J., Styner, M., Langerak, T., Klein, A.: Miccai multi-atlas labeling beyond the cranial vault-workshop and challenge. In: Proc. MICCAI Multi-Atlas Labeling Beyond Cranial Vault—Workshop Challenge. vol. 5, p. 12 (2015) +27. Li, Y., Shao, H.C., Liang, X., Chen, L., Li, R., Jiang, S., Wang, J., Zhang, Y.: Zero-shot medical image translation via frequency-guided diffusion models. arXiv preprint arXiv:2304.02742 (2023) +28. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2017) +29. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15, 1-9 (2024) +30. McGinnis, J., Shit, S., Li, H.B., Sideri-Lampretsa, V., Graf, R., Dannecker, M., Pan, J., Stolt-Anso, N., Mühlau, M., Kirschke, J.S., et al.: Single-subject multicontrast mri super-resolution via implicit neural representations. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 173-183. Springer (2023) + +31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) +32. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023) +33. Naval Marimont, S., Tarroni, G.: Implicit field learning for unsupervised anomaly detection in medical images. In: Medical Image Computing and Computer Assisted Intervention-MICCAI 2021: 24th International Conference, Strasbourg, France, September 27-October 1, 2021, Proceedings, Part II 24. pp. 189-198. Springer (2021) +34. Pasupathy, A.: The neural basis of image segmentation in the primate brain. Neuroscience 296, 101-109 (2015) +35. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: International Conference on Machine Learning. pp. 5301-5310. PMLR (2019) +36. Reich, C., Prangemeier, T., Cetin, O., Koeppl, H.: OSS-Net: Memory efficient high resolution semantic segmentation of 3D medical data. In: British Machine Vision Conference (2021) +37. Ronneberger, O., Fischer, P., Brox, T.: U-Net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241. Springer (2015) +38. Shi, H., Han, S., Huang, S., Liao, Y., Li, G., Kong, X., Zhu, H., Wang, X., Liu, S.: Mask-enhanced segment anything model for tumor lesion semantic segmentation. arXiv preprint arXiv:2403.05912 (2024) +39. Sørensen, K., Camara, O., Backer, O., Kofoed, K., Paulsen, R.: NUDF: Neural unsigned distance fields for high resolution 3D medical image segmentation. ISBI pp. 1-5 (2022) +40. Stolt-Ansó, N., McGinnis, J., Pan, J., Hammernik, K., Rueckert, D.: Nisf: Neural implicit segmentation functions. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 734-744. Springer (2023) +41. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) +42. Wei, X., Zhang, R., Wu, J., Liu, J., Lu, M., Guo, Y., Zhang, S.: Nto3d: Neural target object 3d reconstruction with segment anything. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20352-20362 (2024) +43. Wu, J., Fu, R., Fang, H., Liu, Y., Wang, Z., Xu, Y., Jin, Y., Arbel, T.: Medical sam adapter: Adapting segment anything model for medical image segmentation. arXiv preprint arXiv:2304.12620 (2023) +44. Yang, J., Wickramasinghe, U., Ni, B., Fua, P.: ImplicitAtlas: Learning deformable shape templates in medical imaging. In: CVPR. pp. 15861-15871 (2022) +45. You, C., Dai, W., Min, Y., Staib, L., Duncan, J.S.: Implicit anatomical rendering for medical image segmentation with stochastic experts. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 561-571. Springer (2023) +46. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023) + +47. Zhang, Y., Gu, P., Sapkota, N., Chen, D.Z.: Swipe: Efficient and robust medical image segmentation with implicit patch embeddings. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 315-326. Springer (2023) +48. Zhang, Y., Sapkota, N., Gu, P., Peng, Y., Zheng, H., Chen, D.Z.: Keep your friends close & enemies farther: Debiasing contrastive learning with spatial priors in 3D radiology images. In: 2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). pp. 1824-1829. IEEE (2022) \ No newline at end of file diff --git a/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/images.zip b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..9b1aaf991a2385647a4a4c8fc8bc219c292e5b0d --- /dev/null +++ b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ee597ae58b3c55b687a4817f631a7457d1ca45450cef1e0ce4339ec1612f6151 +size 477216 diff --git a/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/layout.json b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..8c17015e05cee12d40d080fb834935bf209b0582 --- /dev/null +++ b/2024/I-MedSAM_ Implicit Medical Image Segmentation with Segment Anything/layout.json @@ -0,0 +1,10002 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 173, + 111, + 440, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 111, + 440, + 148 + ], + "spans": [ + { + "bbox": [ + 173, + 111, + 440, + 148 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "spans": [ + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "text", + "content": "Xiaobao Wei" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "inline_equation", + "content": "^{1,2,3,*}" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "text", + "content": ", Jiajun Cao" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "inline_equation", + "content": "^{1,4,*}" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "text", + "content": ", Yizhu Jin" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "inline_equation", + "content": "^{1,5}" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "text", + "content": ", Ming Lu" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "text", + "content": ", Guangyu Wang" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "inline_equation", + "content": "^{6}" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "text", + "content": ", and Shanghang Zhang" + }, + { + "bbox": [ + 187, + 167, + 424, + 193 + ], + "type": "inline_equation", + "content": "^{1,\\dagger}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "spans": [ + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "text", + "content": "State Key Laboratory of Multimedia Information Processing, School of Computer Science, Peking University " + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "text", + "content": "University of Chinese Academy of Sciences " + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "text", + "content": "Institute of Software, Chinese Academy of Sciences " + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "inline_equation", + "content": "^{4}" + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "text", + "content": "Xi'an Jiaotong University " + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "inline_equation", + "content": "^{5}" + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "text", + "content": "Beihang University " + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "inline_equation", + "content": "^{6}" + }, + { + "bbox": [ + 138, + 201, + 475, + 257 + ], + "type": "text", + "content": "Beijing University of Posts and Telecommunications weixiaobao0210@gmail.com" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 277, + 452, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 277, + 452, + 529 + ], + "spans": [ + { + "bbox": [ + 160, + 277, + 452, + 529 + ], + "type": "text", + "content": "Abstract. With the development of Deep Neural Networks (DNNs), many efforts have been made to handle medical image segmentation. Traditional methods such as nnUNet train specific segmentation models on the individual datasets. Plenty of recent methods have been proposed to adapt the foundational Segment Anything Model (SAM) to medical image segmentation. However, they still focus on discrete representations to generate pixel-wise predictions, which are spatially inflexible and scale poorly to higher resolution. In contrast, implicit methods learn continuous representations for segmentation, which is crucial for medical image segmentation. In this paper, we propose I-MedSAM, which leverages the benefits of both continuous representations and SAM, to obtain better cross-domain ability and accurate boundary delineation. Since medical image segmentation needs to predict detailed segmentation boundaries, we designed a novel adapter to enhance the SAM features with high-frequency information during Parameter-Efficient Fine-Tuning (PEFT). To convert the SAM features and coordinates into continuous segmentation output, we utilize Implicit Neural Representation (INR) to learn an implicit segmentation decoder. We also propose an uncertainty-guided sampling strategy for efficient learning of INR. Extensive evaluations on 2D medical image segmentation tasks have shown that our proposed method with only 1.6M trainable parameters outperforms existing methods including discrete and implicit methods. The code will be available at: https://github.com/ucwxb/I-MedSAM." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 539, + 453, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 539, + 453, + 562 + ], + "spans": [ + { + "bbox": [ + 159, + 539, + 453, + 562 + ], + "type": "text", + "content": "Keywords: Medical Image Segmentation " + }, + { + "bbox": [ + 159, + 539, + 453, + 562 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 539, + 453, + 562 + ], + "type": "text", + "content": " Implicit Neural Representation " + }, + { + "bbox": [ + 159, + 539, + 453, + 562 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 539, + 453, + 562 + ], + "type": "text", + "content": " Segment Anything" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 592, + 230, + 604 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 592, + 230, + 604 + ], + "spans": [ + { + "bbox": [ + 132, + 592, + 230, + 604 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 613, + 481, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 613, + 481, + 638 + ], + "spans": [ + { + "bbox": [ + 130, + 613, + 481, + 638 + ], + "type": "text", + "content": "Medical image segmentation, as a pivotal component of auxiliary disease diagnosis, holds a crucial role in medical image applications. The advent of deep" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 134, + 642, + 225, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 642, + 225, + 653 + ], + "spans": [ + { + "bbox": [ + 134, + 642, + 225, + 653 + ], + "type": "text", + "content": "* Equal Contribution." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 136, + 653, + 237, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 653, + 237, + 665 + ], + "spans": [ + { + "bbox": [ + 136, + 653, + 237, + 665 + ], + "type": "text", + "content": "† Corresponding Author." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 118, + 289, + 232 + ], + "blocks": [ + { + "bbox": [ + 137, + 118, + 289, + 232 + ], + "lines": [ + { + "bbox": [ + 137, + 118, + 289, + 232 + ], + "spans": [ + { + "bbox": [ + 137, + 118, + 289, + 232 + ], + "type": "image", + "image_path": "bb6ffe0efd6da3a6d6d4c3bb12c8a0fc399901924eca34597ec9c6d32f309fee.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 133, + 236, + 293, + 253 + ], + "lines": [ + { + "bbox": [ + 133, + 236, + 293, + 253 + ], + "spans": [ + { + "bbox": [ + 133, + 236, + 293, + 253 + ], + "type": "text", + "content": "(a) Illustrations of discrete and continuous representation for medical segmentation." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 299, + 128, + 484, + 235 + ], + "blocks": [ + { + "bbox": [ + 299, + 128, + 484, + 235 + ], + "lines": [ + { + "bbox": [ + 299, + 128, + 484, + 235 + ], + "spans": [ + { + "bbox": [ + 299, + 128, + 484, + 235 + ], + "type": "image", + "image_path": "f1175b168ef2a0e9b9e70724fef231cab31571c85ef996025d78a4671b6b12cc.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 299, + 236, + 481, + 252 + ], + "lines": [ + { + "bbox": [ + 299, + 236, + 481, + 252 + ], + "spans": [ + { + "bbox": [ + 299, + 236, + 481, + 252 + ], + "type": "text", + "content": "(b) Segmentation quality comparison between our I-MedSAM and baselines." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 262, + 482, + 307 + ], + "lines": [ + { + "bbox": [ + 130, + 262, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 262, + 482, + 307 + ], + "type": "text", + "content": "Fig. 1: (a) Continuous representation with implicit decoders exhibits superior scale flexibility. (b) I-MedSAM with the fewest trainable params (1.6M) surpasses the state-of-the-art discrete and implicit approaches and exhibits a solid generalization ability when facing data shifts. Please refer to Sec. 4 for more experiment details." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 330, + 482, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 330, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 330, + 482, + 449 + ], + "type": "text", + "content": "learning has spurred the widespread adoption of neural networks customized for medical images. For example, nnUNet [37] leverages the downsampling and upsampling modules to aggregate multi-scale contextual features. Transformers [41] uses the self-attention mechanism to significantly augment the representation capacity of deep neural networks, improving the accuracy in medical image segmentation [5]. Recent advancements have witnessed the integration of foundation models as backbones in various works. The Segment Anything Model (SAM) [24] demonstrates unprecedented zero-shot segmentation ability. Therefore, diverse adapters based on parameter-efficient fine-tuning (PEFT) are crafted to fine-tune SAM for medical images [29, 42, 43, 46]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 450, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 569 + ], + "type": "text", + "content": "Despite their notable effectiveness, these methods primarily focus on pixelwise or voxel-wise predictions [10,13,19,29,37,46]. While they achieve promising results, the discrete representations present challenges in spatial flexibility and introduce discretization artifacts when scaling to arbitrary input sizes. Additionally, the discrete representations give rise to ambiguity when extracting the nuanced details crucial for precise boundary delineation [31], which is important in medical image analysis. The delineation of boundaries can signify the transitions between different human tissues or anatomical structures, thus providing essential information for accurately separating these instances. Usually, the intricacy and subtlety of this delineation process need additional refinement [1,34]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "Compared with discrete representations, continuous representations learn Implicit Neural Representations (INRs) [32] to transform discrete representations into continuous space. As shown in Fig. 1a, numerous approaches learn a mapping from encoded image features and grid coordinates to the segmentation output, enabling adaptability to various output resolutions [22,33,36,47]. However, current approaches show unsatisfying domain transfer ability due to the limited representation capabilities of their pre-trained image encoders. Additionally, the boundary information of images demonstrates a strong correlation" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "with features in the frequency domain [11, 27], which is also ignored by most previous methodologies. Lastly, existing methods adopt random sampling across coordinates, underestimating the influence of sampling strategies when learning INRs." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 482, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 482, + 344 + ], + "type": "text", + "content": "To address the aforementioned limitations, we propose I-MedSAM, a model that leverages the benefits of both continuous representations and SAM, aiming to enhance cross-domain capabilities and achieve precise boundary delineation. Given the medical images, I-MedSAM extracts the features from SAM with the proposed frequency adapter, which aggregates high-frequency information from the frequency domain. These features along with the grid coordinates are decoded into segmentation outputs by the learned INRs. We employ a two-stage implicit segmentation decoder, consisting of two INRs in a coarse-to-fine manner. The first INR produces coarse segmentation results and features. Subsequently, a novel uncertainty-guided sampling strategy is applied to sample Top-K variance feature points along with their corresponding grid coordinates. Finally, these selected samples are fed into the second INR to obtain refined segmentation results. Notably, I-MedSAM is trained end-to-end with a minimal number of trainable parameters, yet it achieves state-of-the-art performance compared with all baseline methods. Our main contributions are summarized as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 354, + 481, + 487 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 354, + 481, + 378 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 354, + 481, + 378 + ], + "spans": [ + { + "bbox": [ + 138, + 354, + 481, + 378 + ], + "type": "text", + "content": "- We propose I-MedSAM, a novel method that leverages the advantages of SAM and continuous representations." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 380, + 481, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 380, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 380, + 481, + 403 + ], + "type": "text", + "content": "- We propose a novel frequency adapter that utilizes high-frequency information to enhance features, thereby accurately segmenting boundaries." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 403, + 481, + 438 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 481, + 438 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 481, + 438 + ], + "type": "text", + "content": "- We propose a novel coarse-to-fine INR decoder with an uncertainty-guided sampling (UGS) strategy, to learn a mapping from features and coordinates to segmentation output." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 439, + 481, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 439, + 481, + 487 + ], + "spans": [ + { + "bbox": [ + 138, + 439, + 481, + 487 + ], + "type": "text", + "content": "- We perform detailed evaluations of I-MedSAM on 2D medical image segmentation. As shown in Fig. 1b, I-MedSAM outperforms state-of-the-art continuous and discrete methods. Experiments also demonstrate that I-MedSAM is robust to scale and domain shifts." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 506, + 237, + 520 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 506, + 237, + 520 + ], + "spans": [ + { + "bbox": [ + 132, + 506, + 237, + 520 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Implicit Neural Representation. The concept of signal representation is fundamental across various domains, especially in the field of computer vision [31,32]. Traditional methods for encoding signals discretize the input space into pixel or voxel grids [4,6,7,9,10,15,19,37,38,46]. Different from these discrete methods, Implicit Neural Representation (INR) learns generator functions that map input coordinates into the signal values [8]. Numerous studies employ INR for diverse tasks, including medical data reconstruction, rendering, compression, registration, super-resolution and segmentation [2, 25, 30, 32, 44]. For segmentation, conventional methods typically consist of a trained feature encoder and a decoder. The encoder encodes medical data into features, and the decoder subsequently decodes features along with their coordinates into segmentation" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 145, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 145, + 91, + 447, + 103 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "output [17, 22, 23, 36, 39, 40, 45, 47]. However, current methods exhibit an imbalance in emphasizing either global or local features and demonstrate relatively low out-of-distribution ability. In contrast, our proposed approach leverages the segmentation foundation model SAM to enrich feature extraction. Moreover, we introduce an innovative uncertainty-guided sampling (UGS) strategy into the INR, enabling the adaptive selection of samples to train the implicit segmentation decoder. Please refer to the appendix for more related work." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 220, + 233, + 235 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 220, + 233, + 235 + ], + "spans": [ + { + "bbox": [ + 132, + 220, + 233, + 235 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 248, + 480, + 285 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 480, + 285 + ], + "type": "text", + "content": "In this section, we initially provide a concise overview of the implicit image segmentation problem. Then, we proceed to elaborate on the pipeline of I-MedSAM. Finally, we elucidate the novel designs introduced in I-MedSAM." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 185, + 304, + 425, + 445 + ], + "blocks": [ + { + "bbox": [ + 185, + 304, + 425, + 445 + ], + "lines": [ + { + "bbox": [ + 185, + 304, + 425, + 445 + ], + "spans": [ + { + "bbox": [ + 185, + 304, + 425, + 445 + ], + "type": "image", + "image_path": "dc0e69c38b65636ec1a32cffdb70d892cd5ae75a2570334f566ea59da8e3d645.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 451, + 482, + 551 + ], + "lines": [ + { + "bbox": [ + 130, + 451, + 482, + 551 + ], + "spans": [ + { + "bbox": [ + 130, + 451, + 482, + 551 + ], + "type": "text", + "content": "Fig. 2: The overall pipeline of I-MedSAM. First, given the medical images and a coarse bounding box as a prompt, I-MedSAM utilizes the medical image encoder and the prompt encoder to generate discrete features. For the medical image encoder, we design low-rank adapters and frequency adapters to extract information from the spatial domain and frequency domain. Then I-MedSAM interpolates all features to align with the encoded coordinates and decodes them in coarse to fine neural fields. We propose an Uncertainty Guided Sampling (UGS) strategy to adaptively choose the highest variance points and refine predictions. I-MedSAM merges the predictions from coarse and fine neural fields as the final prediction maps." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 595, + 228, + 606 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 595, + 228, + 606 + ], + "spans": [ + { + "bbox": [ + 132, + 595, + 228, + 606 + ], + "type": "text", + "content": "3.1 Preliminaries" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": "In traditional discrete segmentation with " + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": " classes, neural networks aim to learn a direct mapping from input medical images " + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "X \\in \\mathbb{R}^{H \\times W \\times 3}" + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": " to class probabilities " + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "O \\in \\mathbb{R}^{H \\times W \\times C}" + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": " at the same resolution, in which " + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": " means height and width of input images, respectively." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "On the other hand, implicit image segmentation seeks to map each pixel of medical images " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "X" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " with its coordinate " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "p_i = (x,y)" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "x,y\\in [-1,1]" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ", to class probabilities " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\hat{o}_i\\in \\mathbb{R}^C" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ", denoted as " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\mathcal{N}_{\\theta}: (p_i,X_i)\\to \\hat{o}_i" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\mathcal{N}_{\\theta}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " represents a neural network parameterized by weights " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". This formulation incorporates coordinates directly on pixels, adjusting the spatial granularity of input coordinates for predictions at arbitrary resolution, from source resolution " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "H\\times W" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " to target resolution " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "H^{\\prime}\\times W^{\\prime}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ", which can be represented as " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "X\\in \\mathbb{R}^{H\\times W\\times 3}\\rightarrow O\\in \\mathbb{R}^{H^{\\prime}\\times W^{\\prime}\\times C}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". Moreover, it allows the direct application of pixel-wise loss functions like Cross Entropy or Dice. Additionally, the zero-isosurface in " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\mathcal{N}_{\\theta}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "'s implicit space represents object boundaries, providing an additional advantage for boundary modeling." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 255, + 242, + 266 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 255, + 242, + 266 + ], + "spans": [ + { + "bbox": [ + 132, + 255, + 242, + 266 + ], + "type": "text", + "content": "3.2 Overall Pipeline" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 275, + 482, + 382 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 275, + 482, + 382 + ], + "spans": [ + { + "bbox": [ + 130, + 275, + 482, + 382 + ], + "type": "text", + "content": "As depicted in Fig. 2, I-MedSAM comprises two main parts. The first part integrates an image encoder with its adapters, forming " + }, + { + "bbox": [ + 130, + 275, + 482, + 382 + ], + "type": "inline_equation", + "content": "Enc_{I}" + }, + { + "bbox": [ + 130, + 275, + 482, + 382 + ], + "type": "text", + "content": ", and a prompt encoder " + }, + { + "bbox": [ + 130, + 275, + 482, + 382 + ], + "type": "inline_equation", + "content": "Enc_{P}" + }, + { + "bbox": [ + 130, + 275, + 482, + 382 + ], + "type": "text", + "content": ", following SAM's design. Specifically, recognizing the significant role of the frequency domain in segmentation boundary representation, a frequency adapter is devised for extracting frequency features. Taking a medical image and a prompt bounding box as inputs, multi-scale features are extracted from both spatial and frequency domains. In scenarios involving cross-resolution, the extracted features need to be interpolated from the source resolution to achieve segmentation output at the target resolution." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "text", + "content": "The second part is the implicit segmentation decoder " + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "inline_equation", + "content": "Dec" + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "text", + "content": ", comprising two stacked INRs: one \"coarse\" " + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "text", + "content": " with shallow layers and one \"fine\" " + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "text", + "content": " with deeper layers. Typically, " + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "text", + "content": " generates a coarse segmentation map, and " + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 130, + 384, + 482, + 467 + ], + "type": "text", + "content": " refines it on sampled points. The selection of these points is determined by the pixel-wise uncertainty of segmentation predictions, assessed through MC-Dropout and Top-K algorithms. Detailed explanations of these two parts will be provided in the following sections." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 485, + 279, + 498 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 485, + 279, + 498 + ], + "spans": [ + { + "bbox": [ + 132, + 485, + 279, + 498 + ], + "type": "text", + "content": "3.3 Medical Image Encoder" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 506, + 481, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 481, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 481, + 529 + ], + "type": "text", + "content": "In this section, we introduce the frequency adapter and low-rank adapter integrated into SAM, to extract features from both frequency and spatial domains." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 530, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 530, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 530, + 482, + 579 + ], + "type": "text", + "content": "Frequency Adapter. Discrete Fourier Transform (DFT) is a common and effective method for transforming an image into the frequency domain. In practice, the Fast Fourier Transform (FFT) is employed for efficient computation of DFT, the spectrum representation of " + }, + { + "bbox": [ + 130, + 530, + 482, + 579 + ], + "type": "inline_equation", + "content": "f_{h,w}" + }, + { + "bbox": [ + 130, + 530, + 482, + 579 + ], + "type": "text", + "content": " can be formulated as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 227, + 589, + 481, + 622 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 589, + 481, + 622 + ], + "spans": [ + { + "bbox": [ + 227, + 589, + 481, + 622 + ], + "type": "interline_equation", + "content": "\\mathcal {F} _ {u, v} = \\sum_ {h = 1} ^ {H} \\sum_ {w = 1} ^ {W} f _ {h, w} \\cdot \\mathrm {e} ^ {- j 2 \\pi \\left(\\frac {h}{H} u + \\frac {w}{W} v\\right)}. \\tag {1}", + "image_path": "51bcdfa139178b4957a76f0fdadb51726ba7b48440c90c3f8bb1c70e9e2b30c5.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "text", + "content": "Subsequently, the amplitude and phase spectrum of " + }, + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{u,v}" + }, + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "text", + "content": " can be obtained as " + }, + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "|\\mathcal{F}_{u,v}|" + }, + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\arg (\\mathcal{F}_{u,v})" + }, + { + "bbox": [ + 132, + 629, + 482, + 666 + ], + "type": "text", + "content": ", respectively. Experiment results in Tab. 6 indicate that the amplitude spectrum exhibits superior representation ability compared to" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "the phase spectrum. Therefore, we default to using the amplitude spectrum for our proposed frequency adapter (FA)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 479, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 479, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 479, + 187 + ], + "type": "text", + "content": "As illustrated in Fig. 3, the individual FA comprises a linear down-projection layer, a GELU activation layer, and a linear up-projection layer. In total, we utilize " + }, + { + "bbox": [ + 130, + 140, + 479, + 187 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 140, + 479, + 187 + ], + "type": "text", + "content": " instances of FA as a sequence, corresponding to the number of Vision Transformer (ViT) Blocks of " + }, + { + "bbox": [ + 130, + 140, + 479, + 187 + ], + "type": "inline_equation", + "content": "Enc_{I}" + }, + { + "bbox": [ + 130, + 140, + 479, + 187 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": "Low-Rank Adapter. In contrast to fine-tuning all parameters in the image encoder " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "Enc_I" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": ", we leverage the Low-Rank Adapter (LoRA) [16] to update a small fraction of parameters, adapting SAM to medical images, as illustrated in Fig. 3. Given the encoded token sequence " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "F \\in \\mathbb{R}^{B \\times N \\times C_{in}}" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": ", the resulting token sequence " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "\\hat{F} \\in \\mathbb{R}^{B \\times N \\times C_{out}}" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": " is generated using a projection layer " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "W_p \\in \\mathbb{R}^{C_{out} \\times C_{in}}" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": ", denoted as " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "\\hat{F} = W_pF" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": ". LoRA proposes that the adjustment to " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "W_p" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": " should be gradual and consistent. It recommends utilizing a low-rank approximation " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "A \\in \\mathbb{R}^{r \\times C_{in}}" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "inline_equation", + "content": "B \\in \\mathbb{R}^{C_{out} \\times r}" + }, + { + "bbox": [ + 130, + 189, + 317, + 380 + ], + "type": "text", + "content": " to represent this gradual update, which can be formulated as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 149, + 388, + 315, + 403 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 388, + 315, + 403 + ], + "spans": [ + { + "bbox": [ + 149, + 388, + 315, + 403 + ], + "type": "interline_equation", + "content": "\\hat {W} _ {p} = W _ {p} + \\Delta W _ {p} = W _ {p} + B A. \\qquad (2)", + "image_path": "48cbd00b011f59d0e318e35d1e403c36a15a5093731583d308279d9e81b4337f.jpg" + } + ] + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 332, + 213, + 472, + 324 + ], + "blocks": [ + { + "bbox": [ + 332, + 213, + 472, + 324 + ], + "lines": [ + { + "bbox": [ + 332, + 213, + 472, + 324 + ], + "spans": [ + { + "bbox": [ + 332, + 213, + 472, + 324 + ], + "type": "image", + "image_path": "8295a7e7bdfc3e3d92c0a125a918736c6060e7d4ca12a82974c3e05fd65ccdd9.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 321, + 332, + 482, + 389 + ], + "lines": [ + { + "bbox": [ + 321, + 332, + 482, + 389 + ], + "spans": [ + { + "bbox": [ + 321, + 332, + 482, + 389 + ], + "type": "text", + "content": "Fig. 3: Illustration of the proposed frequency adapter and LoRA in the image encoder. The image/frequency embedding from patch embedding undergoes two separate branches in the encoder." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "text", + "content": "As the multi-head attention mechanism determines the regions to focus on, it is reasonable to apply LoRA to the frozen projection layers of query " + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "inline_equation", + "content": "Q" + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "text", + "content": ", key " + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "text", + "content": ", or value " + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "inline_equation", + "content": "V" + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "text", + "content": " to influence the attention scores. We notice that I-MedSAM performs better when LoRA is applied to the query " + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "inline_equation", + "content": "Q" + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "text", + "content": " and value " + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "inline_equation", + "content": "V" + }, + { + "bbox": [ + 130, + 411, + 479, + 471 + ], + "type": "text", + "content": " projection layers, which can be expressed as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 238, + 479, + 480, + 525 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 479, + 480, + 525 + ], + "spans": [ + { + "bbox": [ + 238, + 479, + 480, + 525 + ], + "type": "interline_equation", + "content": "\\left\\{ \\begin{array}{l} Q = \\hat {W} _ {q} F = W _ {q} F + B _ {q} A _ {q} F \\\\ K = W _ {k} F \\\\ V = \\hat {W} _ {v} F = W _ {v} F + B _ {v} A _ {v} F \\end{array} \\right. \\tag {3}", + "image_path": "b356d690ada6d396369eb06d5f684ed7f44849ed0d92820196013cfcaaf65968.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "inline_equation", + "content": "W_{q}" + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "inline_equation", + "content": "W_{k}" + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "inline_equation", + "content": "W_{v}" + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "text", + "content": " are frozen projection layers from SAM's image encoder, and " + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "inline_equation", + "content": "A_{q}, B_{q}, A_{v}, B_{v}" + }, + { + "bbox": [ + 130, + 533, + 479, + 559 + ], + "type": "text", + "content": " are trainable LoRA parameters." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 574, + 318, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 574, + 318, + 586 + ], + "spans": [ + { + "bbox": [ + 131, + 574, + 318, + 586 + ], + "type": "text", + "content": "3.4 Implicit Segmentation Decoder" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 594, + 479, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 479, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 479, + 629 + ], + "type": "text", + "content": "In this section, we introduce a coarse-to-fine implicit neural representation with an uncertainty-guided sampling (UGS) strategy to decode features from encoders into the segmentation maps at target resolutions." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "text", + "content": "Coarse to Fine Implicit Neural Representation. Given features from the image encoder " + }, + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "inline_equation", + "content": "Enc_I" + }, + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "text", + "content": " and the prompt encoder " + }, + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "inline_equation", + "content": "Enc_P" + }, + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "text", + "content": ", we interpolate them from source to target resolutions and concatenate them with coordinates " + }, + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 630, + 480, + 665 + ], + "type": "text", + "content": ". These" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 163 + ], + "type": "text", + "content": "coordinates " + }, + { + "bbox": [ + 131, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 131, + 116, + 479, + 163 + ], + "type": "text", + "content": " are generated at the target resolutions and normalized to " + }, + { + "bbox": [ + 131, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "[-1, 1]" + }, + { + "bbox": [ + 131, + 116, + 479, + 163 + ], + "type": "text", + "content": ". To address potential biased learning resulting from the direct use of input coordinates [35], we encode the coordinates into a higher-dimensional space using a high-frequency positional encoding function, which is defined as:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 176, + 178, + 481, + 192 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 178, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 176, + 178, + 481, + 192 + ], + "type": "interline_equation", + "content": "\\gamma (p) = (\\sin (2 ^ {0} \\pi p), \\cos (2 ^ {0} \\pi p), \\dots , \\sin (2 ^ {L - 1} \\pi p), \\cos (2 ^ {L - 1} \\pi p)) \\tag {4}", + "image_path": "bcf764a48b7a4b2c42b820aa888f1e0d12eaac096379920178cad0566d65cbe7.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 205, + 479, + 241 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 205, + 479, + 241 + ], + "spans": [ + { + "bbox": [ + 131, + 205, + 479, + 241 + ], + "type": "text", + "content": "where the hyperparameter " + }, + { + "bbox": [ + 131, + 205, + 479, + 241 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 131, + 205, + 479, + 241 + ], + "type": "text", + "content": " is set to 10 in our experiments following the previous work. The encoded coordinates, the encoded features from both the image and prompt encoders are concatenated to feed into the decoder:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 202, + 256, + 480, + 269 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 256, + 480, + 269 + ], + "spans": [ + { + "bbox": [ + 202, + 256, + 480, + 269 + ], + "type": "interline_equation", + "content": "Z ^ {p} = \\operatorname {C o n c a t} (\\gamma (p), \\operatorname {I n t e r p} \\left(\\operatorname {E n c} _ {I} (X)\\right), \\operatorname {E n c} _ {I} (P)). \\tag {5}", + "image_path": "af3a9577273cedec8069741bfd5d334b503968a32da9e8cf97bf9013c6b446c9.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 282, + 479, + 341 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 282, + 479, + 341 + ], + "spans": [ + { + "bbox": [ + 131, + 282, + 479, + 341 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 131, + 282, + 479, + 341 + ], + "type": "inline_equation", + "content": "X" + }, + { + "bbox": [ + 131, + 282, + 479, + 341 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 282, + 479, + 341 + ], + "type": "inline_equation", + "content": "P" + }, + { + "bbox": [ + 131, + 282, + 479, + 341 + ], + "type": "text", + "content": " represent the input medical image and the corresponding coarse bounding box prompt, respectively. The function Interp refers to the interpolation function based on bilinear algorithms, which is used to interpolate the encoded features from source to target resolution, in alignment with the encoded coordinates." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "spans": [ + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": "Inspired by NeRF [31], we depart from the one-stage INR approaches to introduce a two-stage decoding process. This involves optimizing two INRs simultaneously: one \"coarse\" " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": ", with shallow layers, and one \"fine\" " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": ", with deeper layers. " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": " produces a coarse segmentation map, " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "\\hat{o}_i^c" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": ", serving as reference for " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": " to refine. Additionally, " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": " generates coarse features, " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "z_i^c" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": ", employed by " + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 131, + 344, + 479, + 416 + ], + "type": "text", + "content": " in its refinement process." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "spans": [ + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "text", + "content": "We employ MC-dropout to calculate the uncertainty of features " + }, + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "inline_equation", + "content": "\\hat{\\sigma}_i^c" + }, + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "text", + "content": " for each pixel. Subsequently, a Top-K percentage of feature points is sampled based on this uncertainty, denoted as " + }, + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "inline_equation", + "content": "z_i^s" + }, + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "text", + "content": " (with " + }, + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "inline_equation", + "content": "s\\in S" + }, + { + "bbox": [ + 131, + 418, + 479, + 478 + ], + "type": "text", + "content": "). Finally, the predictions from the \"coarse\" and \"fine\" INRs are combined to produce the output of I-MedSAM. The decoding process is formulated as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 231, + 492, + 307, + 505 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 492, + 307, + 505 + ], + "spans": [ + { + "bbox": [ + 231, + 492, + 307, + 505 + ], + "type": "interline_equation", + "content": "\\hat {\\partial} _ {i} ^ {c}, z _ {i} ^ {c} = D e c _ {c} (z _ {i} ^ {p})", + "image_path": "b2429bc2486bd59e511b593579ab402f7623a270bfccc4bb122c95d7e74f8b63.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 246, + 507, + 480, + 536 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 246, + 507, + 480, + 536 + ], + "spans": [ + { + "bbox": [ + 246, + 507, + 480, + 536 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} z _ {i} ^ {s} = U G S \\left(z _ {i} ^ {c}\\right), s \\in \\mathcal {S} \\\\ \\hat {\\partial} _ {i} ^ {f} = D e c _ {f} \\left(z _ {i} ^ {s}\\right) \\end{array} \\tag {6}", + "image_path": "f49a3c944f648f84bc1c28b6463e45785a7beab1c88a040cc880aac4e53b79be.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 247, + 540, + 383, + 554 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 540, + 383, + 554 + ], + "spans": [ + { + "bbox": [ + 247, + 540, + 383, + 554 + ], + "type": "interline_equation", + "content": "\\hat {O} = \\hat {O} ^ {c} (\\mathcal {S} \\setminus s) \\cup \\hat {O} ^ {f} (s), \\hat {\\sigma} _ {i} \\in \\hat {O}.", + "image_path": "82858744d7585a4c75d4c02f76da723d984e63f81e7320f4031ecb2bb58f1316.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 567, + 479, + 591 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 567, + 479, + 591 + ], + "spans": [ + { + "bbox": [ + 131, + 567, + 479, + 591 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 131, + 567, + 479, + 591 + ], + "type": "inline_equation", + "content": "UGS" + }, + { + "bbox": [ + 131, + 567, + 479, + 591 + ], + "type": "text", + "content": " represents Uncertainty Guided Sampling, which will be further illustrated in the following section." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": "Uncertainty Guided Sampling. In the sampling process, we select feature points that require refinement from the \"coarse\" INR " + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": " and feed them into the \"fine\" INR " + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": ", based on uncertainty estimation. Drawing inspiration from MC-Dropout methods [12, 14], we apply dropout " + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": " times to obtain " + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": " prediction results of coarse segmentation probabilities, " + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\{o_i^c\\}_{t=1}^T" + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": ", given the input features " + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "inline_equation", + "content": "z_i^p" + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": ", denoted as " + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\{p_t(o_i^c|z_i^p)\\}_{t=1}^T" + }, + { + "bbox": [ + 131, + 594, + 480, + 666 + ], + "type": "text", + "content": ". The uncertainty is calculated as the variance of" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 342, + 129 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 342, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 342, + 129 + ], + "type": "text", + "content": "predictions for each feature point, expressed as:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 241, + 134, + 481, + 201 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 134, + 481, + 201 + ], + "spans": [ + { + "bbox": [ + 241, + 134, + 481, + 201 + ], + "type": "interline_equation", + "content": "\\left\\{ \\begin{array}{l} \\mu_ {i} = \\frac {1}{T} \\sum_ {t = 1} ^ {T} \\left(p _ {t} \\left(o _ {i} ^ {c} \\mid z _ {i} ^ {p}\\right)\\right) \\\\ u _ {i} = \\frac {1}{T} \\sum_ {t = 1} ^ {T} \\left(p _ {t} \\left(o _ {i} ^ {c} \\mid z _ {i} ^ {p}\\right) - \\mu_ {i}\\right) ^ {2}. \\end{array} \\right. \\tag {7}", + "image_path": "5f2180ab142fdb4f73c4276a1ac04d7eb176edf2264d2ad624f6165dd9f61b92.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "spans": [ + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "text", + "content": "Subsequently, we sample the feature points with the highest Top-K percentage uncertainty to form " + }, + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "inline_equation", + "content": "z_{i}^{s}" + }, + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "text", + "content": " to refine. This estimation of uncertainty reflects the variation in prediction difficulty among different samples. It adaptively selects pixels with higher difficulty for refinement by " + }, + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 131, + 207, + 482, + 267 + ], + "type": "text", + "content": ", achieving more accurate segmentation results." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 282, + 264, + 295 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 264, + 295 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 264, + 295 + ], + "type": "text", + "content": "3.5 Training I-MedSAM" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": "To optimize the trainable parameters of I-MedSAM, we freeze the pre-trained image encoder " + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "inline_equation", + "content": "Enc_I" + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": ", while only unfreezing the proposed adapters, prompt encoder " + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "inline_equation", + "content": "Enc_P" + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": " and INRs. We utilize SAM's image encoder with LoRA and our proposed frequency adapter to extract features for input medical images " + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "inline_equation", + "content": "X" + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": ", while extracting prompt features in terms of coarse bounding box " + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "inline_equation", + "content": "P" + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": " for targeted segmentation objects. The coarse bounding box " + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "inline_equation", + "content": "P" + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": " is randomly adjusted the height and width following the previous work [46]. Then we concatenate features along with the mapped coordinate values and decode them with the proposed two-stage INR decoder. With the coarse to fine INR and the uncertainty guided sampling strategy, I-MedSAM obtains the coarse and refined point-wise segmentation probabilities " + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "inline_equation", + "content": "\\{\\hat{o}_i^c,\\hat{o}_i^f\\}_{i\\in X}" + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": ", combined as " + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "inline_equation", + "content": "\\hat{o}_i" + }, + { + "bbox": [ + 131, + 300, + 482, + 445 + ], + "type": "text", + "content": ". For training optimization, we adopt pixel-wise segmentation loss, which can be formulated as:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 207, + 451, + 480, + 464 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 207, + 451, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 207, + 451, + 480, + 464 + ], + "type": "interline_equation", + "content": "L _ {s e g} \\left(o _ {i}, \\hat {o} _ {i}\\right) = 0. 5 \\cdot L _ {c e} \\left(o _ {i}, \\hat {o} _ {i}\\right) + 0. 5 \\cdot L _ {d c} \\left(o _ {i}, \\hat {o} _ {i}\\right) \\tag {8}", + "image_path": "5eb3a8808c85040e3e5b1a7d3a192aebedec27ff50ae5c89cd099088f0c2d07d.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 470, + 482, + 519 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 470, + 482, + 519 + ], + "spans": [ + { + "bbox": [ + 131, + 470, + 482, + 519 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 470, + 482, + 519 + ], + "type": "inline_equation", + "content": "L_{ce}" + }, + { + "bbox": [ + 131, + 470, + 482, + 519 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 470, + 482, + 519 + ], + "type": "inline_equation", + "content": "L_{dc}" + }, + { + "bbox": [ + 131, + 470, + 482, + 519 + ], + "type": "text", + "content": " stand for Cross Entropy loss and Dice loss respectively. We apply the loss to supervise both coarse and refined segmentation maps progressively. Within the training process, we decrease weights for coarse supervision and increase weights for refined supervision until I-MedSAM converges." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 534, + 230, + 549 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 230, + 549 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 230, + 549 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "content": "In this section, we present extensive experiments to evaluate the effectiveness of I-MedSAM for medical image segmentation. We first introduce the experimental settings including datasets and training details. Then we compare our method with the SOTA implicit and discrete approaches on the binary polyp segmentation [20] and multi-class organ segmentation [26] qualitatively and quantitatively. We further evaluate the performance and robustness of I-MedSAM when facing data shifts. Finally, we conduct a comprehensive ablation study to evaluate the contribution of each component. Due to space limitations, we provide more details and visualization results in the supplementary material." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 151, + 157, + 462, + 278 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 482, + 149 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 482, + 149 + ], + "type": "text", + "content": "Table 1: Overall segmentation results versus the state-of-the-art discrete approaches and implicit approaches. The Trainable Params columns report unfrozen parameters in training and the Dice columns report averaged scores with standard deviation." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 151, + 157, + 462, + 278 + ], + "lines": [ + { + "bbox": [ + 151, + 157, + 462, + 278 + ], + "spans": [ + { + "bbox": [ + 151, + 157, + 462, + 278 + ], + "type": "table", + "html": "
Binary Polyp SegmentationMulti-class Organ Segmentation
MethodDice (%)↑Trainable Params (M)↓MethodDice (%)↑Trainable Params (M)↓
Discrete Approaches
U-Net[37]63.89±1.307.9U-Net[37]74.47±1.5716.3
PraNet[10]82.56±1.0830.5UNETR[15]81.14±0.8592.6
Res2UNet[13]81.62±0.9725.4Res2UNet[13]79.23±0.6638.3
nnUNet[19]82.97±0.89126.6nnUNet[19]85.15±0.67126.6
MedSAM[29]82.88±0.554.1MedSAM[29]85.85±0.8152.7
Implicit Approaches
OSSNet[36]76.11±1.145.2OSSNet[36]73.38±1.657.6
IOSNet[22]78.37±0.764.1IOSNet[22]76.75±1.376.2
SwIPE[47]85.05±0.822.7SwIPE[47]81.21±0.944.4
I-MedSAM (ours)91.49±0.521.6I-MedSAM (ours)89.91±0.683.5
", + "image_path": "635683c70698835ec85f59ae3bab1f1607c2004ba3862b0114d783225a9cd75a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 311, + 272, + 323 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 311, + 272, + 323 + ], + "spans": [ + { + "bbox": [ + 132, + 311, + 272, + 323 + ], + "type": "text", + "content": "4.1 Experimental Settings" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 331, + 482, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 482, + 413 + ], + "type": "text", + "content": "Datasets. We assess the performance of our model on two distinct tasks: binary polyp segmentation and multi-class abdominal organ segmentation. For binary polyp segmentation, we conduct experiments using the challenging Kvasir-Sessile dataset [20], consisting of 196 RGB images of small sessile polyps. Additionally, we evaluate the generalization capability of our model by testing the pre-trained I-MedSAM directly to the CVC-ClinicDB dataset [3], comprising 612 images from 31 colonoscopy sequences." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 415, + 482, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 482, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 482, + 510 + ], + "type": "text", + "content": "For multi-organ segmentation, training is conducted on the BCV dataset [26], comprising 30 CT scans with annotations for 13 organs. Model robustness is also evaluated using the pre-trained I-MedSAM on diverse CT images in AMOS [21] (200 training CTs, maintaining the same setup as in [48]). Since our work is dedicated to showing the effectiveness of 2D medical image segmentation, we just slice-wise segment CT data. Following the data prepossess in SwIPE [47], all datasets are divided with a train:validation:test ratio of 60:20:20, and the reported dice scores are all based on the test set." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "text", + "content": "Implementation Details. The training process of I-MedSAM involves fine-tuning the encoder of SAM [24], utilizing ViT-B as the backbone. We set LoRA ranks to 4 and incorporate amplitude information in the frequency adapters. For implicit segmentation decoders, we set latent MLP dimensions as [1024, 512] for " + }, + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "text", + "content": " and [512, 256, 256, 128] for " + }, + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "text", + "content": ". We sample the highest uncertainty points with a proportion of " + }, + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "inline_equation", + "content": "12.5\\%" + }, + { + "bbox": [ + 130, + 510, + 482, + 582 + ], + "type": "text", + "content": " and set the dropout probabilities to 0.5." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "For multi-organ segmentation, we slightly modify the number of the last layer in " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "Dec_{c}" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "Dec_{f}" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": " to match target segmentation classes. I-MedSAM are optimized by AdamW [28] with " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\alpha = 0.5" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\beta = 0.1" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\lambda_{ada} = 5 \\times 10^{-5}" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": " for adapters in the encoder and " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\lambda_{dec} = 1 \\times 10^{-3}" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": ". For fair comparisons, all methods are trained for 1000 epochs on the same experiment settings. The reported test dice score and Hausdorff Distance [18] correspond to the best validation epoch. Image input sizes are " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "384 \\times 384" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": " for Sessile and " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "512 \\times 512" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": " for each slice of BCV." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 145, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 145, + 91, + 448, + 103 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 185, + 114, + 430, + 325 + ], + "blocks": [ + { + "bbox": [ + 185, + 114, + 430, + 325 + ], + "lines": [ + { + "bbox": [ + 185, + 114, + 430, + 325 + ], + "spans": [ + { + "bbox": [ + 185, + 114, + 430, + 325 + ], + "type": "image", + "image_path": "3af6c3a6625274c5cd3859a8ba7b06456458a5a0947ab9e2d46c631733f47843.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 332, + 479, + 344 + ], + "lines": [ + { + "bbox": [ + 132, + 332, + 479, + 344 + ], + "spans": [ + { + "bbox": [ + 132, + 332, + 479, + 344 + ], + "type": "text", + "content": "Fig. 4: Qualitative comparison on Kvasir-Sessile dataset for binary polyp segmentation." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 366, + 489, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 489, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 489, + 475 + ], + "type": "text", + "content": "Baselines. We divide baselines into two sets: discrete approaches and implicit (continuous) approaches. Discrete approaches include U-Net [37], PraNet [10], Res2UNet [13], nnUNet [19], UNETR [15] and MedSAM [29]. Specifically, MedSAM [29] is also a SAM-based approach, where SAM's original decoder is directly finetined. Implicit approaches include OSSNet [36], IOSNet [22] and SwIPE [47]. Given the absence of code availability from the prior state-of-the-art SwIPE [47] for extended comparison and the demonstrated superiority of IOSNet [22] over OSSNet [36] in implicit approaches, we primarily compare our method with IOSNet [22] in several experiment settings." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 491, + 288, + 503 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 288, + 503 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 288, + 503 + ], + "type": "text", + "content": "4.2 Quantitative Comparison" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 510, + 480, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 480, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 480, + 569 + ], + "type": "text", + "content": "In this section, we first report the dice score compared with baselines. Then we conduct experiments across different resolutions and domains to evaluate the robustness and generalization ability under data shifts. Finally, we implement Hausdorff Distance (HD distance) [18] to compare the quality of the segmentation boundary with baselines across different experiment settings." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 481, + 666 + ], + "type": "text", + "content": "Segmentation Comparison. We make a comparison with both the discrete methods and implicit methods in terms of trainable parameters and Dice score with standard deviation on Polyp Sessile for binary-class segmentation and CT BCV for multi-class segmentation, as demonstrated in Tab. 1. On the smaller polyp dataset, we observe notable improvements over the best-known implicit methods and discrete methods with much fewer trainable parameters (1.26% of nnNet [19] and 59.26% of SwIPE [47]). For multi-organ segmentation on BCV, performance gains are also significant compared with the best-known" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 185, + 114, + 430, + 284 + ], + "blocks": [ + { + "bbox": [ + 185, + 114, + 430, + 284 + ], + "lines": [ + { + "bbox": [ + 185, + 114, + 430, + 284 + ], + "spans": [ + { + "bbox": [ + 185, + 114, + 430, + 284 + ], + "type": "image", + "image_path": "f1885b82ae032fded0c7baa4a11531488cb339fc71b10f047c30a7e7e116dfe7.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 146, + 293, + 465, + 304 + ], + "lines": [ + { + "bbox": [ + 146, + 293, + 465, + 304 + ], + "spans": [ + { + "bbox": [ + 146, + 293, + 465, + 304 + ], + "type": "text", + "content": "Fig. 5: Qualitative comparison on BCV dataset for multi-organ segmentation." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 329, + 482, + 424 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 482, + 424 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 482, + 424 + ], + "type": "text", + "content": "implicit methods and discrete methods. On the one hand, SAM, with the assistance of the proposed frequency adapters, generates abundant features that enhance the quality of segmentation boundaries. In contrast, SwIPE employs Res2Net-50 [13] as its backbone, which offers less sufficient features compared to SAM's, leading to inferior segmentation quality. On the other hand, with the proposed uncertainty-guided sampling in INR decoders, I-MedSAM adaptively selects and refines uncertain pixels with the highest variance, leading to more accurate segmentation maps." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 425, + 332, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 425, + 332, + 473 + ], + "spans": [ + { + "bbox": [ + 130, + 425, + 332, + 473 + ], + "type": "text", + "content": "Robustness under Data Shifts. We compare the robustness across resolutions and domains with the best discrete and implicit methods on binary-class polyp segmentation." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "text", + "content": "Firstly, to adapt the pre-trained I-MedSAM model, originally trained on standard " + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "inline_equation", + "content": "384 \\times 384" + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "text", + "content": " images, to different target resolutions such as " + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "inline_equation", + "content": "128 \\times 128" + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "text", + "content": " for lower resolutions and " + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "inline_equation", + "content": "896 \\times 896" + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "text", + "content": " for higher resolutions, the input coordinates " + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "inline_equation", + "content": "(384 \\times 384)" + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "text", + "content": " are scaled accordingly to match the target resolutions. Subsequently, the dice score is computed at these corresponding target resolutions. For discrete methods, the resolution of output images remains the same as that of the input images. We input the original images at their source resolution " + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "inline_equation", + "content": "(384 \\times 384)" + }, + { + "bbox": [ + 130, + 474, + 333, + 652 + ], + "type": "text", + "content": " and resize the output segmentation maps to the target resolution for evaluation. Additionally, we denote discrete" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 653, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 653, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 653, + 481, + 665 + ], + "type": "text", + "content": "basielines with the suffix " + }, + { + "bbox": [ + 130, + 653, + 481, + 665 + ], + "type": "inline_equation", + "content": "*" + }, + { + "bbox": [ + 130, + 653, + 481, + 665 + ], + "type": "text", + "content": ", where the original medical images are resized to" + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 345, + 494, + 472, + 622 + ], + "blocks": [ + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "lines": [ + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "spans": [ + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "text", + "content": "Table 2: Cross-resolution from " + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "inline_equation", + "content": "{384} \\times {384}" + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "inline_equation", + "content": "{128} \\times {128}" + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "text", + "content": " ,from " + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "inline_equation", + "content": "{384} \\times" + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "text", + "content": " 384 to " + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "inline_equation", + "content": "{896} \\times {896}" + }, + { + "bbox": [ + 339, + 460, + 482, + 492 + ], + "type": "text", + "content": " on Kvasir-Sessile." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 345, + 494, + 472, + 622 + ], + "lines": [ + { + "bbox": [ + 345, + 494, + 472, + 622 + ], + "spans": [ + { + "bbox": [ + 345, + 494, + 472, + 622 + ], + "type": "table", + "html": "
MethodDice (%)↑
384 → 128384 → 896
Discrete Approaches
PraNet[10]72.6474.95
PraNet*[10]68.7943.92
nnUNet[19]73.9783.56
nnUNet*[19]65.3476.36
MedSAM[29]82.3983.19
MedSAM*[29]82.3783.32
Implicit Approaches
IOSNet[22]76.1878.01
SwIPE[47]81.2684.33
I-MedSAM (ours)91.4591.33
", + "image_path": "3236ac35066fee6c287e5c7b6a13cff90eb6fc503f84a0e91e7eb04a93bbd793.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 145, + 90, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 90, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 145, + 90, + 448, + 103 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "the target resolution and then provided as input to these methods to directly generate segmentation at the target resolution." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 367, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 367, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 367, + 247 + ], + "type": "text", + "content": "As shown in Tab. 2, implicit methods exhibit spatial flexibility and consistently outperform discrete methods. Among implicit approaches, our I-MedSAM achieves the highest performance across various output resolutions. This superior performance can be attributed to the efficacy of the proposed frequency adapters and uncertainty-guided sampling, enhancing I-MedSAM's capability to provide accurate predictions at arbitrary resolutions." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 248, + 367, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 367, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 367, + 390 + ], + "type": "text", + "content": "Secondly, we investigate the robustness of model performance across different datasets for the same task. In the binary-class polyp segmentation task, all methods are pre-trained on the Kvasir-Sessile dataset and evaluated directly on the CVC dataset. Similarly, in the multi-class abdominal organ segmentation task, all methods are pre-trained on the BCV dataset and evaluated on the AMOS dataset, focusing solely on the liver class. As shown in Tab. 3, leveraging the generalization ability of SAM, I-MedSAM outperforms the top discrete method, achieving dice scores of " + }, + { + "bbox": [ + 130, + 248, + 367, + 390 + ], + "type": "inline_equation", + "content": "88.83\\%" + }, + { + "bbox": [ + 130, + 248, + 367, + 390 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 248, + 367, + 390 + ], + "type": "inline_equation", + "content": "86.28\\%" + }, + { + "bbox": [ + 130, + 248, + 367, + 390 + ], + "type": "text", + "content": " respectively. For additional visualization" + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 387, + 230, + 470, + 369 + ], + "blocks": [ + { + "bbox": [ + 373, + 175, + 482, + 228 + ], + "lines": [ + { + "bbox": [ + 373, + 175, + 482, + 228 + ], + "spans": [ + { + "bbox": [ + 373, + 175, + 482, + 228 + ], + "type": "text", + "content": "Table 3: Cross-domain on binary polyp segmentation and multi-class abdominal organ segmentation." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 387, + 230, + 470, + 369 + ], + "lines": [ + { + "bbox": [ + 387, + 230, + 470, + 369 + ], + "spans": [ + { + "bbox": [ + 387, + 230, + 470, + 369 + ], + "type": "table", + "html": "
MethodDice (%)
Kvasir-Sessile → CVC
PraNet[10]68.37
nnUNet[19]84.91
MedSAM[29]74.59
IOSNet[22]59.42
SwIPE[47]70.10
I-MedSAM (ours)88.83
BCV → AMOS
UNETR[10]81.75
nnUNet[19]79.63
MedSAM[29]71.98
IOSNet[22]79.48
SwIPE[47]82.81
I-MedSAM (ours)86.28
", + "image_path": "3847390c9ac25b3245606599487414b4787213e02e7e6b14ca3f9d0807be43b6.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 392, + 479, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 392, + 479, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 479, + 403 + ], + "type": "text", + "content": "comparisons regarding data shifts, please refer to the supplementary materials." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 403, + 480, + 451 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 480, + 451 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 480, + 451 + ], + "type": "text", + "content": "Boundary Comparison. We further utilize the Hausdorff Distance (HD distance) [18] to assess segmentation boundary quality. I-MedSAM achieves a lower HD distance, indicating superior boundary quality. For more detailed boundary visualizations, please refer to Fig.4 and the supplementary materials." + } + ] + } + ], + "index": 8 + }, + { + "type": "table", + "bbox": [ + 150, + 491, + 461, + 536 + ], + "blocks": [ + { + "bbox": [ + 157, + 472, + 455, + 483 + ], + "lines": [ + { + "bbox": [ + 157, + 472, + 455, + 483 + ], + "spans": [ + { + "bbox": [ + 157, + 472, + 455, + 483 + ], + "type": "text", + "content": "Table 4: Hausdorff Distance comparison on various experiment settings." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 150, + 491, + 461, + 536 + ], + "lines": [ + { + "bbox": [ + 150, + 491, + 461, + 536 + ], + "spans": [ + { + "bbox": [ + 150, + 491, + 461, + 536 + ], + "type": "table", + "html": "
HD distance (↓)Kvasir-SessileKvasir-Sessile → CVC384 → 128384 → 896BCVBCV → AMOS
nnUNet[19]31.3082.3113.6972.316.5080.39
MedSAM[29]21.5330.158.0451.8210.6252.14
IOSNet[22]51.7281.6035.3387.8621.4661.19
I-MedSAM(Ours)11.5919.767.9132.775.9537.53
", + "image_path": "f1d60564a92ac270bab814f78ebc3675e4c932f3afb7acad5d4588659d454ddf.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 574, + 280, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 574, + 280, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 574, + 280, + 588 + ], + "type": "text", + "content": "4.3 Qualitative Comparison" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "As shown in Fig. 4 and Fig. 5, we conduct qualitative comparisons on Kvasir-Sessile and BCV datasets. Due to the unavailability of code for inference, SwIPE has been omitted from the visual comparison. We also provide input medical images along with corresponding ground truth segmentation masks. The segmentation boundaries are delineated by green lines in Fig. 4. From the figures, it can be witnessed that I-MedSAM obtains better segmentation boundaries. Thanks" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 165 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 165 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 165 + ], + "type": "text", + "content": "to the proposed frequency adapters and uncertainty guided sampling techniques, I-MedSAM can efficiently aggregate high-frequency information from the input, which is beneficial to the accuracy of final segmentation maps. Due to the space limitation, please refer to supplementary materials for more qualitative results." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 180, + 239, + 192 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 180, + 239, + 192 + ], + "spans": [ + { + "bbox": [ + 131, + 180, + 239, + 192 + ], + "type": "text", + "content": "4.4 Ablation Study" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 199, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 199, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 199, + 482, + 248 + ], + "type": "text", + "content": "We conduct ablation studies focusing on three aspects: component-wise ablations, the incorporation of frequency adapter, and point numbers for sampling. In each of our ablation experiments, other hyper-parameters remain consistent with the implementation details." + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 194, + 300, + 418, + 357 + ], + "blocks": [ + { + "bbox": [ + 130, + 266, + 483, + 291 + ], + "lines": [ + { + "bbox": [ + 130, + 266, + 483, + 291 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 483, + 291 + ], + "type": "text", + "content": "Table 5: Effectiveness of each component of the pipeline. We evaluate the Dice metric for both cross-domain and cross-resolution tasks." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 194, + 300, + 418, + 357 + ], + "lines": [ + { + "bbox": [ + 194, + 300, + 418, + 357 + ], + "spans": [ + { + "bbox": [ + 194, + 300, + 418, + 357 + ], + "type": "table", + "html": "
LoRAFAINRKvasir-SessileCross-domainCross-resolution
Kvasir-Sessile → CVC384 → 128384 → 896
✓83.6182.5772.7376.46
✓✓88.7482.6175.6978.59
✓✓88.8383.4088.1688.43
✓✓✓91.4988.8391.4591.33
", + "image_path": "8d71472eb6eadc90a87b61b802e9e5d2e6e737c73431ae26882e7ce4e28cfd7f.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 378, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 498 + ], + "type": "text", + "content": "Component-wise ablations. To demonstrate the effectiveness of each component, we conduct a component-wise ablation on Kvasir-Sessile [20], cross-domain and cross-resolution tasks, as can be seen in Tab. 5. We employ LoRA alone as a baseline for binary segmentation, obtaining a competitive performance, which is consistent with the baseline SAMed [46]. Following the incorporation of frequency adapters and INR decoders separately, the model's performance exhibits improvements. It can be observed that the INR decoder exhibits a more pronounced advantage in cross-domain and cross-resolution tasks. Furthermore, simultaneously employing frequency adapters (FA) and INR decoders can achieve a synergistic effect where " + }, + { + "bbox": [ + 130, + 378, + 482, + 498 + ], + "type": "inline_equation", + "content": "1 + 1 > 2" + }, + { + "bbox": [ + 130, + 378, + 482, + 498 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 498, + 347, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 347, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 347, + 582 + ], + "type": "text", + "content": "Incorporating the frequency adapter. Tab. 6 indicates the effectiveness of the frequency adapter, and it can be observed that amplitude information is more helpful for spectrum representation compared to phase information. The results also demonstrate the segmentation boundary benefits from the frequency adapter." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 582, + 347, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 347, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 347, + 666 + ], + "type": "text", + "content": "Points Number for Sampling. Tab. 7 represents ablation on points number for Uncertainty Guided Sampling (UGS). This experiment reveals that I-MedSAM generates high-quality segmentation masks with the help of the proposed uncertainty guided sampling method. Excessive sampling points do not necessarily im" + } + ] + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 356, + 599, + 480, + 635 + ], + "blocks": [ + { + "bbox": [ + 353, + 533, + 482, + 598 + ], + "lines": [ + { + "bbox": [ + 353, + 533, + 482, + 598 + ], + "spans": [ + { + "bbox": [ + 353, + 533, + 482, + 598 + ], + "type": "text", + "content": "Table 6: Ablation study on Frequency Adapter (FA). " + }, + { + "bbox": [ + 353, + 533, + 482, + 598 + ], + "type": "inline_equation", + "content": "\\mathrm{FA}_{pha}" + }, + { + "bbox": [ + 353, + 533, + 482, + 598 + ], + "type": "text", + "content": " stands for utilizing of the phase spectrum of DFT, while " + }, + { + "bbox": [ + 353, + 533, + 482, + 598 + ], + "type": "inline_equation", + "content": "\\mathrm{FA}_{amp}" + }, + { + "bbox": [ + 353, + 533, + 482, + 598 + ], + "type": "text", + "content": " stands for the amplitude spectrum of DFT." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 356, + 599, + 480, + 635 + ], + "lines": [ + { + "bbox": [ + 356, + 599, + 480, + 635 + ], + "spans": [ + { + "bbox": [ + 356, + 599, + 480, + 635 + ], + "type": "table", + "html": "
Settingw/o FAFAphaFAamp
Dice (%)88.8390.6091.49
HD15.4412.6711.59
", + "image_path": "bc086b34962031987bef9affe369e310e239126f1e23a144bdb72cc4b8efe27a.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "table_body" + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 144, + 90, + 448, + 103 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "prove the final segmentation results and may lead to increased memory consumption. Conversely, insufficient sampling points may limit the areas that require refinement. Therefore, a proportion of " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "12.5\\%" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": " for UGS is deemed appropriate for I-MedSAM. The parameter can be adjusted according to the specific tasks." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 160, + 226, + 452, + 265 + ], + "blocks": [ + { + "bbox": [ + 130, + 182, + 479, + 216 + ], + "lines": [ + { + "bbox": [ + 130, + 182, + 479, + 216 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 479, + 216 + ], + "type": "text", + "content": "Table 7: Ablation study on the number of sampled feature points for Uncertainty Guided Sampling (UGS). \"Top-K\" denotes the selection of a specified proportion, K%, from all feature points." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 160, + 226, + 452, + 265 + ], + "lines": [ + { + "bbox": [ + 160, + 226, + 452, + 265 + ], + "spans": [ + { + "bbox": [ + 160, + 226, + 452, + 265 + ], + "type": "table", + "html": "
Settingw/o UGSTop-50%Top-25%Top-12.5%Top-6.25%Top-3.125%
Dice (%)87.7790.2789.5991.4991.0190.48
HD Distance16.1513.8814.1211.5912.9914.53
", + "image_path": "8e1190bf3cc1331696f5fe6f4e16160db6eeecaefdf89aabcb0cd08fdcef2204.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 300, + 354, + 313 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 354, + 313 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 354, + 313 + ], + "type": "text", + "content": "4.5 Effect of different training annotations" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "text", + "content": "To illustrate the generalization ability between I-MedSAM and baselines, we further conduct experiments on different proportions of training annotation amount. Following the experiment settings in SwIPE [47], based on the divided training set, we train I-MedSAM on " + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "inline_equation", + "content": "25\\%" + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 317, + 351, + 472 + ], + "type": "text", + "content": " of the training set. As shown in Sec. 4.5, our I-MedSAM outperforms all baselines at various training annotation amounts. Thanks to the great generalization ability of SAM's encoder in I-MedSAM, I-MedSAM maintains higher segmentation performance even with relatively limited training annotations." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 487, + 220, + 501 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 220, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 220, + 501 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 359, + 342, + 476, + 449 + ], + "blocks": [ + { + "bbox": [ + 359, + 342, + 476, + 449 + ], + "lines": [ + { + "bbox": [ + 359, + 342, + 476, + 449 + ], + "spans": [ + { + "bbox": [ + 359, + 342, + 476, + 449 + ], + "type": "image", + "image_path": "d13b6c8edfa01904a11f90445e0d9b448c9dbeef4796eb770ca552302645ea7d.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 356, + 457, + 482, + 489 + ], + "lines": [ + { + "bbox": [ + 356, + 457, + 482, + 489 + ], + "spans": [ + { + "bbox": [ + 356, + 457, + 482, + 489 + ], + "type": "text", + "content": "Fig. 6: Effect on different proportions of training annotation amount." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 510, + 351, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 351, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 351, + 544 + ], + "type": "text", + "content": "In this paper, we introduce I-MedSAM to enhance cross-domain ability and adaptability to diverse output resolutions in medical image segmenta" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "type": "text", + "content": "tion. By integrating SAM's generalized representations into the INR space, I-MedSAM achieves state-of-the-art performance across various experimental scenarios. Specifically addressing the challenge of precise boundary delineation in 2D medical images, we incorporate a frequency adapter for parameter-efficient fine-tuning to SAM, showcasing the potential benefits of complementing spatial domain information with frequency domain insights for foundation models. Additionally, the employment of the uncertainty-guided sampling strategy in coarse-to-fine INRs proves effective in the selection and refinement of challenging samples in continuous space. These findings suggest avenues for future research to establish stronger connections between different representation spaces." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "text", + "content": "Acknowledgement" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 479, + 163 + ], + "type": "text", + "content": "Shanghang Zhang is supported by the National Science and Technology Major Project of China (No. 2022ZD0117801)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 205, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 205, + 480, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 205, + 480, + 228 + ], + "spans": [ + { + "bbox": [ + 138, + 205, + 480, + 228 + ], + "type": "text", + "content": "1. Alahmadi, M.D.: Boundary aware u-net for medical image segmentation. Arabian Journal for Science and Engineering 48(8), 9929-9940 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 228, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 270 + ], + "type": "text", + "content": "2. Amiranashvili, T., Lüdke, D., Li, H.B., Menze, B., Zachow, S.: Learning shape reconstruction from sparse measurements with neural implicit functions. In: International Conference on Medical Imaging with Deep Learning. pp. 22-34. PMLR (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 271, + 480, + 316 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 271, + 480, + 316 + ], + "spans": [ + { + "bbox": [ + 138, + 271, + 480, + 316 + ], + "type": "text", + "content": "3. Bernal, J., Sánchez, F.J., Fernández-Esparrach, G., Gil, D., Rodríguez, C., Vilarino, F.: WM-DOVA maps for accurate polyp highlighting in colonoscopy: Validation vs. saliency maps from physicians. Computerized Medical Imaging and Graphics 43, 99-111 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 316, + 480, + 337 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 480, + 337 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 480, + 337 + ], + "type": "text", + "content": "4. Bui, N.T., Hoang, D.H., Tran, M.T., Le, N.: Sam3d: Segment anything model in volumetric medical images. arXiv preprint arXiv:2309.03493 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 337, + 480, + 370 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 480, + 370 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 480, + 370 + ], + "type": "text", + "content": "5. Chen, J., Lu, Y., Yu, Q., Luo, X., Adeli, E., Wang, Y., Lu, L., Yuille, A.L., Zhou, Y.: Transunet: Transformers make strong encoders for medical image segmentation. arXiv preprint arXiv:2102.04306 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "type": "text", + "content": "6. Cheng, J., Ye, J., Deng, Z., Chen, J., Li, T., Wang, H., Su, Y., Huang, Z., Chen, J., Jiang, L., et al.: Sam-med2d. arXiv preprint arXiv:2308.16184 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 392, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 480, + 435 + ], + "type": "text", + "content": "7. Cheng, Z., Wei, Q., Zhu, H., Wang, Y., Qu, L., Shao, W., Zhou, Y.: Unleashing the potential of sam for medical adaptation via hierarchical decoding. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3511-3522 (2024)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 435, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 435, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 435, + 480, + 468 + ], + "type": "text", + "content": "8. Chibane, J., Alldieck, T., Pons-Moll, G.: Implicit functions in feature space for 3d shape reconstruction and completion. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6970-6981 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 468, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 480, + 512 + ], + "type": "text", + "content": "9. Deng, G., Zou, K., Ren, K., Wang, M., Yuan, X., Ying, S., Fu, H.: Sam-u: Multibox prompts triggered uncertainty estimation for reliable sam in medical image. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 368-377. Springer (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 512, + 480, + 545 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 512, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 138, + 512, + 480, + 545 + ], + "type": "text", + "content": "0. Fan, D., Ji, G., Zhou, T., Chen, G., Fu, H., Shen, J., Shao, L.: PraNet: Parallel reverse attention network for polyp segmentation. In: MICCAI. pp. 263-273. Springer (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 545, + 480, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 480, + 589 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 480, + 589 + ], + "type": "text", + "content": "1. Feng, Z., Wen, L., Wang, P., Yan, B., Wu, X., Zhou, J., Wang, Y.: Diffdp: Radiotherapy dose prediction via a diffusion model. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 191-201. Springer (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 589, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 589, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 589, + 480, + 621 + ], + "type": "text", + "content": "2. Gal, Y., Ghahramani, Z.: Dropout as a bayesian approximation: Representing model uncertainty in deep learning. international conference on machine learning (2015)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "text", + "content": "3. Gao, S.H., Cheng, M.M., Zhao, K., Zhang, X.Y., Yang, M.H., Torr, P.: Res2Net: A new multi-scale backbone architecture. IEEE TPAMI 43(2), 652-662 (2019)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "4. Guo, C., Pleiss, G., Sun, Y., Weinberger, K.Q.: On calibration of modern neural networks. international conference on machine learning (2017)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 145, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 145, + 91, + 447, + 102 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "15. Hatamizadeh, A., Tang, Y., Nath, V., Yang, D., Myronenko, A., Landman, B., Roth, H., Xu, D.: UNETR: Transformers for 3D medical image segmentation. In: IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 574-584 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "type": "text", + "content": "16. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "17. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: ECCV. pp. 487-505. Springer (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "text", + "content": "18. Huttenlocher, D.P., Klanderman, G.A., Rucklidge, W.J.: Comparing images using the hausdorff distance. IEEE Transactions on pattern analysis and machine intelligence 15(9), 850-863 (1993)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "text", + "content": "19. Isensee, F., Jaeger, P., Kohl, S., Petersen, J., Maier-Hein, K.H.: nnU-Net: A self-configuring method for deep learning-based biomedical image segmentation. Nature Methods 18(2), 203-211 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "text", + "content": "20. Jha, D., Smedsrud, P.H., Johansen, D., de Lange, T., Johansen, H.D., Halvorsen, P., Riegler, M.A.: A comprehensive study on colorectal polyp segmentation with ResUNet++, conditional random field and test-time augmentation. IEEE Journal of Biomedical and Health Informatics 25(6), 2029-2040 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "21. Ji, Y., Bai, H., Yang, J., Ge, C., Zhu, Y., Zhang, R., Li, Z., Zhang, L., Ma, W., Wan, X., et al.: AMOS: A large-scale abdominal multi-organ benchmark for versatile medical image segmentation. ArXiv:2206.08023 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 369, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 392 + ], + "type": "text", + "content": "22. Khan, M., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: MICCAI (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "text", + "content": "23. Khan, M.O., Fang, Y.: Implicit neural representations for medical imaging segmentation. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 433-443. Springer (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "text", + "content": "24. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "type": "text", + "content": "25. Kuang, K., Zhang, L., Li, J., Li, H., Chen, J., Du, B., Yang, J.: What makes for automatic reconstruction of pulmonary segments. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 495-505. Springer (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "text", + "content": "26. Landman, B., Xu, Z., Igelsias, J., Styner, M., Langerak, T., Klein, A.: Miccai multi-atlas labeling beyond the cranial vault-workshop and challenge. In: Proc. MICCAI Multi-Atlas Labeling Beyond Cranial Vault—Workshop Challenge. vol. 5, p. 12 (2015)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 544, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 481, + 578 + ], + "type": "text", + "content": "27. Li, Y., Shao, H.C., Liang, X., Chen, L., Li, R., Jiang, S., Wang, J., Zhang, Y.: Zero-shot medical image translation via frequency-guided diffusion models. arXiv preprint arXiv:2304.02742 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 578, + 481, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 481, + 589 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 481, + 589 + ], + "type": "text", + "content": "28. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 589, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 481, + 610 + ], + "type": "text", + "content": "29. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15, 1-9 (2024)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 611, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 481, + 666 + ], + "type": "text", + "content": "30. McGinnis, J., Shit, S., Li, H.B., Sideri-Lampretsa, V., Graf, R., Dannecker, M., Pan, J., Stolt-Anso, N., Mühlau, M., Kirschke, J.S., et al.: Single-subject multicontrast mri super-resolution via implicit neural representations. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 173-183. Springer (2023)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "text", + "content": "31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 151, + 481, + 195 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 151, + 481, + 195 + ], + "spans": [ + { + "bbox": [ + 132, + 151, + 481, + 195 + ], + "type": "text", + "content": "32. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 196, + 481, + 250 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 196, + 481, + 250 + ], + "spans": [ + { + "bbox": [ + 132, + 196, + 481, + 250 + ], + "type": "text", + "content": "33. Naval Marimont, S., Tarroni, G.: Implicit field learning for unsupervised anomaly detection in medical images. In: Medical Image Computing and Computer Assisted Intervention-MICCAI 2021: 24th International Conference, Strasbourg, France, September 27-October 1, 2021, Proceedings, Part II 24. pp. 189-198. Springer (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 251, + 481, + 273 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 481, + 273 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 481, + 273 + ], + "type": "text", + "content": "34. Pasupathy, A.: The neural basis of image segmentation in the primate brain. Neuroscience 296, 101-109 (2015)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "text", + "content": "35. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: International Conference on Machine Learning. pp. 5301-5310. PMLR (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "spans": [ + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "type": "text", + "content": "36. Reich, C., Prangemeier, T., Cetin, O., Koeppl, H.: OSS-Net: Memory efficient high resolution semantic segmentation of 3D medical data. In: British Machine Vision Conference (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 341, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 341, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 341, + 481, + 363 + ], + "type": "text", + "content": "37. Ronneberger, O., Fischer, P., Brox, T.: U-Net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241. Springer (2015)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "type": "text", + "content": "38. Shi, H., Han, S., Huang, S., Liao, Y., Li, G., Kong, X., Zhu, H., Wang, X., Liu, S.: Mask-enhanced segment anything model for tumor lesion semantic segmentation. arXiv preprint arXiv:2403.05912 (2024)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 396, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 430 + ], + "type": "text", + "content": "39. Sørensen, K., Camara, O., Backer, O., Kofoed, K., Paulsen, R.: NUDF: Neural unsigned distance fields for high resolution 3D medical image segmentation. ISBI pp. 1-5 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 430, + 481, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 481, + 464 + ], + "type": "text", + "content": "40. Stolt-Ansó, N., McGinnis, J., Pan, J., Hammernik, K., Rueckert, D.: Nisf: Neural implicit segmentation functions. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 734-744. Springer (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 464, + 481, + 497 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 481, + 497 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 481, + 497 + ], + "type": "text", + "content": "41. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 498, + 481, + 541 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 481, + 541 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 481, + 541 + ], + "type": "text", + "content": "42. Wei, X., Zhang, R., Wu, J., Liu, J., Lu, M., Guo, Y., Zhang, S.: Nto3d: Neural target object 3d reconstruction with segment anything. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20352-20362 (2024)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 542, + 481, + 575 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 542, + 481, + 575 + ], + "spans": [ + { + "bbox": [ + 132, + 542, + 481, + 575 + ], + "type": "text", + "content": "43. Wu, J., Fu, R., Fang, H., Liu, Y., Wang, Z., Xu, Y., Jin, Y., Arbel, T.: Medical sam adapter: Adapting segment anything model for medical image segmentation. arXiv preprint arXiv:2304.12620 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 576, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 576, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 576, + 481, + 597 + ], + "type": "text", + "content": "44. Yang, J., Wickramasinghe, U., Ni, B., Fua, P.: ImplicitAtlas: Learning deformable shape templates in medical imaging. In: CVPR. pp. 15861-15871 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 598, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 598, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 598, + 481, + 643 + ], + "type": "text", + "content": "45. You, C., Dai, W., Min, Y., Staib, L., Duncan, J.S.: Implicit anatomical rendering for medical image segmentation with stochastic experts. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 561-571. Springer (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "text", + "content": "46. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 145, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 145, + 91, + 447, + 102 + ], + "type": "text", + "content": "I-MedSAM: Implicit Medical Image Segmentation with Segment Anything" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 205 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "47. Zhang, Y., Gu, P., Sapkota, N., Chen, D.Z.: Swipe: Efficient and robust medical image segmentation with implicit patch embeddings. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 315-326. Springer (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 161, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 481, + 205 + ], + "type": "text", + "content": "48. Zhang, Y., Sapkota, N., Gu, P., Peng, Y., Zheng, H., Chen, D.Z.: Keep your friends close & enemies farther: Debiasing contrastive learning with spatial priors in 3D radiology images. In: 2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). pp. 1824-1829. IEEE (2022)" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "X. Wei et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_content_list.json b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..443d6fe1527583e16e132712f68a94e377cf09df --- /dev/null +++ b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_content_list.json @@ -0,0 +1,1800 @@ +[ + { + "type": "text", + "text": "$I^2$ -SLAM: Inverting Imaging Process for Robust Photorealistic Dense SLAM", + "text_level": 1, + "bbox": [ + 271, + 142, + 733, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Gwangtak Bae\\*1, Changwoon Choi\\*1, Hyeongjun Heo\\*1, Sang Min Kim\\*1, and Young Min Kim\\*1,2", + "bbox": [ + 282, + 213, + 720, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Dept. of Electrical and Computer Engineering, Seoul National University $^{2}$ INMC & IPAI, Seoul National University", + "bbox": [ + 250, + 255, + 751, + 286 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/b86726052bc4edb56ecae590dacd25bc63ad03680b6d669c2e17e9b331d25878.jpg", + "image_caption": [ + "Casually Captured Input" + ], + "image_footnote": [], + "bbox": [ + 238, + 321, + 325, + 420 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/fc80d579f3cf3e48e24590bb1c84c2f886acdbf2c290f9651c8abd84a6b02338.jpg", + "image_caption": [ + "Camera Tracking & Mapping" + ], + "image_footnote": [], + "bbox": [ + 333, + 321, + 511, + 419 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/fb531498bd18a9983a925238f912406f66bbcf2f77f92884820d5c1505ffadcc.jpg", + "image_caption": [ + "Varying Appearances", + "Sharp Reconstruction", + "Sharp HDR Radiance Field", + "Fig. 1: We propose $I^2$ -SLAM, a SLAM pipeline with a physical image formation process. We can reconstruct photorealistic and sharp HDR maps from casually captured videos which contain severe motion blur and varying appearances." + ], + "image_footnote": [], + "bbox": [ + 522, + 321, + 674, + 409 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/dae799068a784aafcc70c8ad6cc79dbf59450c79b3af09f6fa76a14544cf744e.jpg", + "image_caption": [ + "Blurry Input" + ], + "image_footnote": [], + "bbox": [ + 676, + 321, + 764, + 357 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/63a30bc451f703cb461c4c671d2830b1055ed4e87cdf1efb5f411ece338201aa.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 676, + 372, + 764, + 407 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. We present an inverse image-formation module that can enhance the robustness of existing visual SLAM pipelines for casually captured scenarios. Casual video captures often suffer from motion blur and varying appearances, which degrade the final quality of coherent 3D visual representation. We propose integrating the physical imaging into the SLAM system, which employs linear HDR radiance maps to collect measurements. Specifically, individual frames aggregate images of multiple poses along the camera trajectory to explain prevalent motion blur in hand-held videos. Additionally, we accommodate per-frame appearance variation by dedicating explicit variables for image formation steps, namely white balance, exposure time, and camera response function. Through joint optimization of additional variables, the SLAM pipeline produces high-quality images with more accurate trajectories. Extensive experiments demonstrate that our approach can be incorporated into recent visual SLAM pipelines using various scene representations, such as neural radiance fields or Gaussian splatting. Project website", + "bbox": [ + 259, + 542, + 740, + 763 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: SLAM $\\cdot$ photorealistic 3D reconstruction $\\cdot$ motion deblurring $\\cdot$ HDR reconstruction", + "bbox": [ + 259, + 777, + 740, + 805 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Authors contributed equally to this work.", + "bbox": [ + 218, + 811, + 511, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "† Young Min Kim is the corresponding author.", + "bbox": [ + 220, + 825, + 532, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 143, + 375, + 160 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Simultaneous localization and mapping (SLAM) builds a map of the environment during deployment, which can be utilized in various applications, including VR/AR [10, 21], robotic navigation [6, 15, 36], and collision handling [8]. Traditional 3D SLAM approaches typically use geometric representations like points/surfels [24, 42, 50, 54, 55], mesh [3], voxel grids [4, 33], or voxel hashing [12, 35]. Recent visual SLAM approaches additionally capture visual appearances incorporating advances in Neural Radiance Fields (NeRF) [31] and its variants [25, 32]. They can synthesize photorealistic images of the environment and open up new possibilities in complex downstream tasks such as detailed semantic scene understanding [20], language-guided manipulation [45], or visual navigation [43]. Additionally, neural representations can fill unseen regions with smooth geometric estimation and require low-memory footprint [37, 47, 51]. 3D visual representations can achieve real-time performance using voxelized hash grid [32] or 3D Gaussian Splatting (3DGS) [25].", + "bbox": [ + 212, + 175, + 787, + 387 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Despite many works that build visual representations using the SLAM framework, most do not maintain their performance in real-world scenarios. Casually captured videos, the standard input for visual SLAM systems, suffer from two prevalent challenges: 1) motion blur due to camera movement and 2) varying appearances resulting from auto exposure and white balancing adjustments as demonstrated in Fig. 1. The degradation in images serves as a critical bottleneck for the accuracy of the map and the pose estimation, and the error accumulates due to the incremental nature of SLAM, significantly reducing the overall quality.", + "bbox": [ + 212, + 387, + 787, + 507 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This work tackles the prevailing challenges by attaching the physical image formation process that directly models the aforementioned variations. Then, we can directly optimize for the correct camera poses and raw measurements via an analysis-by-synthesis approach. Specifically, the motion-blurred image is compared against observations integrated along the estimated camera trajectories during a window of exposure time instead of an image from a single camera pose. Our pipeline approximates the camera poses as a linear movement and optimizes the start and end poses. The global trajectory estimated in the SLAM pipeline guides the initial blur movement with in-camera parameters, such as exposure time. At the same time, we match the per-frame appearance variation against simulated images and jointly optimize a differentiable tone mapper composed of exposure time, white balance function, and camera response function (CRF). We employ high dynamic range (HDR) radiance fields as a map representation to linearize the color space, which reflects the actual light intensity maps. The HDR maps simplify modeling appearance variations and produce significantly more realistic motion blur effects [13].", + "bbox": [ + 212, + 508, + 787, + 750 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "As our formulation, coined $I^2$ -SLAM, inverts the actual measurement steps, the module can augment any dense visual SLAM pipelines that use image inputs, including implicit neural networks and 3D Gaussians. Our extensive experiments demonstrate that it can robustly reconstruct sharp HDR maps from RGB/RGBD streams afflicted with severe motion blur and varying appearances.", + "bbox": [ + 212, + 750, + 787, + 824 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our technical contributions can be summarized as follows:", + "bbox": [ + 238, + 824, + 661, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 113, + 614, + 128 + ], + "page_idx": 1 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We present $I^2$ -SLAM, integrating the image formation process into the visual SLAM approaches to overcome dominant challenges in real-world captures.", + "- Incorporating 3D maps composed of linear radiance values, our formulation jointly optimizes the approximate movement for the motion blur and tonemapbing functions for appearance variations during the SLAM framework.", + "- We propose an initialization and regularization method to stabilize the blur movement optimization to align with the estimated global camera trajectory, utilizing the SLAM setup.", + "- We enhance the robustness and performance of recent visual SLAM approaches in the real-world and our synthetic dataset, which contains severe motion blur and varying appearance." + ], + "bbox": [ + 223, + 145, + 784, + 314 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 340, + 395, + 356 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Dense Visual SLAM Visual SLAM methods use images as input and first started using multi-view geometry between sparse image features to estimate camera trajectories. DTAM [34] further demonstrated building a projective photometric cost volume, a dense map representation that unlocks the opportunity for combining various image-based applications. As deep neural networks prosper in computer vision, parts of the visual SLAM pipeline have also been successfully deployed to use latent representations [2] or assist the depth estimation [50].", + "bbox": [ + 212, + 375, + 784, + 481 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Subsequent advancements in neural visual SLAM benefit from the technical innovations in neural implicit representation or improved novel representations. iMAP [47] employed implicit neural map representation for SLAM. NICE-SLAM [60] demonstrates that the multi-resolution feature grid representation can improve the speed and resolve the forgetting problem in large-scale scenes. Co-SLAM [51] explores the coordinate and parametric encodings to achieve efficient and accurate mapping. NeRF-SLAM [38] eliminates the dependency on depth by utilizing DROID-SLAM [50]. Recent results favor explicit representations when high speed and photometric quality are desired. Point-SLAM [40] creates photorealistic 3D maps using a dynamic neural point cloud. Since the introduction of 3D Gaussian Splatting [25], several concurrent works rapidly deploy them for 3D map representation for SLAM [17,23,29,57].", + "bbox": [ + 212, + 483, + 785, + 662 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Motion Deblurring Motion blur significantly affects the quality of many computer vision tasks and has long been investigated as an active research topic. Traditional approaches assume a convolution kernel for the motion blur and convert the operation via deconvolution [9, 14, 44, 56]. The convolution operation naturally transfers to convolutional neural networks (CNN), and more recent works estimate the non-uniform motion blur field [48], complex Fourier coefficients [5], or dense motion flow [7]. Recent neural representations [31, 32] also suffer from performance degradation when handling blurred input images. Various works account for the blur operation and reconstruct a sharp 3D map even when input images are blurred [28, 52].", + "bbox": [ + 212, + 688, + 785, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 665, + 113, + 730, + 127 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/48c87bfaa6160e155e8e3a1ef2ae0e279a65615b6f0521b65273ddbaef2c1bf7.jpg", + "image_caption": [ + "Fig. 2: Method overview. (a) We reconstruct a sharp HDR radiance field map. (b) Motion blur is simulated by integration of sharp images, which are obtained from virtual camera poses during the exposure time. Then we obtain the blurry LDR image by applying differentiable tone mapping module. (c) SLAM methods simultaneously perform tracking and mapping from degraded images to reconstruct a sharp HDR map." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 785, + 282 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The input measurements for the visual SLAM are susceptible to motion blur, as a moving camera captures an image for a duration of time. We linearize the camera trajectory during the exposure time and optimize the poses to match the blurred input, similar to [52]. However, we further exploit the SLAM setup and regularize the blur movement to be aligned with the estimated camera trajectory.", + "bbox": [ + 212, + 391, + 787, + 468 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "High Dynamic Range Recovery Another critical issue for high-quality visual SLAM is that the pixel values are inconsistent with different exposures in input frames. Classical works on HDR imaging demonstrate that a color space of an HDR radiance map can successfully combine multiple images of different exposures [13]. HDR radiances are linear to the scene radiance values and lead to better results in image processing and image-based modeling [7, 16, 59]. Our map representation also models the actual HDR radiance values, and we provide explicit variables to model the physical process to map the pixel values, namely the exposure time, white balance, and camera response function per frame. Recent works on novel-view synthesis and 3D reconstruction also achieve improved results as they optimize the HDR radiances with exposure times [18, 22, 30, 39]. Our work integrates factors such as exposure time into a coherent formulation for tone mapping and motion blur and stabilizes the overall optimization.", + "bbox": [ + 212, + 487, + 787, + 684 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 704, + 330, + 720 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "$I^2$ -SLAM is a generic method that can be combined with any existing photorealistic dense SLAM methods. In Sec. 3.1, we first review the rendering techniques for two representative map representations used in our experiments: Neural Radiance Fields (NeRF) [30] and 3D Gaussian Splatting (3DGS) [25]. Then we describe our physical image formation process to render motion-blurred and appearance-varying images in Sec. 3.2. Finally, we explain how to integrate our image formation process into existing SLAM pipelines in Sec. 3.3.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 114, + 614, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Preliminaries: Rendering for Photorealistic Dense SLAM", + "text_level": 1, + "bbox": [ + 215, + 146, + 732, + 161 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our approach seamlessly integrates with various methods for generating color c and, optionally, depth $d$ for each pixel for a given camera pose. Owing to their photorealistic quality and ease of training, most recent visual SLAM approaches are based on variations stemming from either NeRF [31] or 3DGS [25]. This section reviews the general formulations of the two approaches, elucidating the process of generating color and depth information.", + "bbox": [ + 212, + 176, + 782, + 265 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Let $\\mathbf{c}(\\mathbf{T},\\mathbf{p})$ and $d(\\mathbf{T},\\mathbf{p})$ denote the color and depth at pixel location $\\mathbf{p}$ with camera pose $\\mathbf{T}$ . For NeRF, we can obtain the color and depth of target pixels by marching rays and utilizing the volume rendering technique:", + "bbox": [ + 212, + 267, + 784, + 313 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {c} (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {N} \\tau_ {i} \\left(1 - e ^ {- \\sigma_ {i} \\delta_ {i}}\\right) \\mathbf {c} _ {i} \\quad \\text {w h e r e} \\tau_ {i} = e ^ {- \\sum_ {j = 1} ^ {i - 1} \\sigma_ {j} \\delta_ {j}}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 303, + 327, + 784, + 367 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nd (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {N} \\tau_ {i} \\left(1 - e ^ {- \\sigma_ {i} \\delta_ {i}}\\right) d _ {i}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 381, + 784, + 421 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $N$ is the number of samples for each ray, and the camera determines the ray pose $\\mathbf{T}$ and pixel location $\\mathbf{p}$ . $\\mathbf{c}_i$ and $d_i$ are the corresponding color and depth of each sample along a ray observed from the camera center. $\\delta$ is the distance between consecutive samples. Color $\\mathbf{c}_i$ and volume density $\\sigma_i$ can be queried from MLP as in iMAP [47], hierarchical feature grid with small MLP [60], or multi-resolution hash grid [38].", + "bbox": [ + 212, + 430, + 782, + 518 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3DGS [25] also adopts the volume rendering formulation, so we can train the map differentiable to input image measurements. However, 3DGS processes sparse explicit samples from 3D Gaussian primitives, which are faster. We can render images by compositing $\\mathcal{N}$ ordered 3D Gaussians as follows:", + "bbox": [ + 212, + 521, + 782, + 580 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {c} (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {\\mathcal {N}} \\mathbf {c} _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {j}), \\text {w h e r e} \\alpha = o e ^ {- (\\mathbf {x} - \\mu) ^ {T} \\Sigma^ {- 1} (\\mathbf {x} - \\mu) / 2}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 274, + 595, + 784, + 637 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nd (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {\\mathcal {N}} d _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {j}), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 392, + 656, + 784, + 698 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathbf{c}$ , $o\\in [0,1]$ , $\\mu \\in \\mathbb{R}^3$ , and $\\Sigma$ are the color, opacity, center position, and the covariance of a 3D Gaussian, respectively.", + "bbox": [ + 212, + 707, + 782, + 738 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Image Formation Process", + "text_level": 1, + "bbox": [ + 214, + 765, + 472, + 780 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "When running a visual SLAM framework, we can augment additional mapping processes from HDR radiance to image measurements. We reconstruct an HDR radiance map by making $c(\\mathbf{T}, \\mathbf{p})$ in Sec. 3.1 to output linear HDR color. The", + "bbox": [ + 212, + 794, + 782, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 665, + 113, + 730, + 127 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "HDR pixel intensity $C_{\\mathrm{HDR}}^i (\\mathbf{p})$ captured during the exposure time $[t_s^i,t_e^i]$ for the ith frame is", + "bbox": [ + 212, + 145, + 782, + 175 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nC _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p}) = \\int_ {t _ {s} ^ {i}} ^ {t _ {e} ^ {i}} \\mathbf {c} (\\mathbf {T} (t), \\mathbf {p}) d t, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 398, + 176, + 785, + 213 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{T}(t)$ is the camera pose at time $t$ , $\\mathbf{c}(\\mathbf{T},\\mathbf{p})$ is HDR color for camera pose $\\mathbf{T}$ at pixel location $\\mathbf{p}$ defined in Eqs. (1) and (3). Motion blur occurs if $\\mathbf{T}(t)$ changes during exposure. We numerically approximate the integral with quadrature:", + "bbox": [ + 214, + 220, + 782, + 266 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nC _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p}) = \\varDelta t ^ {i} \\cdot \\frac {1}{N _ {\\mathrm {c a m}}} \\sum_ {j = 1} ^ {N _ {\\mathrm {c a m}}} \\mathbf {c} \\left(\\mathbf {T} \\left(t _ {s} ^ {i} + \\frac {j - 1}{N _ {\\mathrm {c a m}} - 1} (t _ {e} ^ {i} - t _ {s} ^ {i})\\right), \\mathbf {p}\\right), \\qquad (6)\n$$\n", + "text_format": "latex", + "bbox": [ + 269, + 279, + 785, + 321 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $N_{\\mathrm{cam}}$ is the number of virtual cameras to approximate the continuous integral with discrete summation and $\\Delta t^i = t_e^i - t_s^i$ is exposure time. Throughout, we empirically set $N_{\\mathrm{cam}} = 5$ for experiments. If we assume that the camera velocity is constant during the short exposure time, the camera poses within time range $t \\in [t_s^i, t_e^i]$ can be obtained by linearly interpolating between the start pose $\\mathbf{T}(t_s^i)$ and the end pose $\\mathbf{T}(t_e^i)$ . We interpolate the camera pose at time $t$ , $\\mathbf{T}(t)$ , by decomposing it into rotation $\\mathbf{R}(t)$ and translation $\\mathbf{t}(t)$ :", + "bbox": [ + 214, + 332, + 782, + 439 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {R} (t) = \\operatorname {S l e r p} \\left(\\mathbf {R} \\left(t _ {s} ^ {i}\\right), \\mathbf {R} \\left(t _ {e} ^ {i}\\right), \\frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\\right), \\quad \\mathbf {t} (t) = \\operatorname {L e r p} \\left(\\mathbf {t} \\left(t _ {s} ^ {i}\\right), \\mathbf {t} \\left(t _ {e} ^ {i}\\right), \\frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\\right), \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 230, + 452, + 785, + 486 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where Slerp stands for spherical linear interpolation, Lerp is linear interpolation.", + "bbox": [ + 214, + 496, + 782, + 510 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Then, the final observed color value of the pixel $\\mathbf{p}$ is obtained by applying tone mapping operator $\\varPsi^i$ :", + "bbox": [ + 214, + 511, + 782, + 542 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nC _ {\\mathrm {L D R}} ^ {i} (\\mathbf {p}) = \\Psi^ {i} \\left(C _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p})\\right). \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 408, + 555, + 784, + 571 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The tone mapping operator $\\varPsi^i$ clips the HDR color to low dynamic range (LDR) and maps from linear color space to non-linear color space. Specifically, the tone mapping operation is composed of white balancing $\\mathrm{WB}^i$ and camera response function $\\mathrm{CRF}^i$ with dynamic range clipping:", + "bbox": [ + 214, + 584, + 782, + 645 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\varPsi^ {i} (\\Delta t ^ {i} \\cdot \\mathbf {c}) = \\operatorname {C R F} ^ {i} \\left(\\mathrm {W B} ^ {i} (\\Delta t ^ {i} \\cdot \\mathbf {c})\\right). \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 657, + 784, + 674 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "White balance function $\\mathrm{WB}^i$ is an element-wise product to each color channel:", + "bbox": [ + 214, + 686, + 779, + 702 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathrm {W B} ^ {i} (\\mathbf {c}) = \\left[ w b _ {r} ^ {i} w b _ {g} ^ {i} w b _ {b} ^ {i} \\right] ^ {T} \\odot \\left[ c _ {r} c _ {g} c _ {b} \\right] ^ {T}. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 356, + 714, + 784, + 736 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We parameterize non-linear $\\mathrm{CRF}^i$ with uniformly sampled 256-dimensional grid $g^i$ between [0, 1] for each color channel. CRF should satisfy the two properties: (1) monotonically increasing function and (2) $\\mathrm{CRF}(0) = 0$ and $\\mathrm{CRF}(1) = 1$ [13]. We further adjust CRF to be physically plausible following [27]. We shift the derivatives by the smallest negative derivative and normalize CRF to satisfy the two properties. We employ differentiable grid sampling [19] to query our CRF", + "bbox": [ + 214, + 748, + 782, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 114, + 614, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "value. Instead of hard clipping the dynamic range between $[0,1]$ , we use a leaky clipping function with CRF to backpropagate the gradient:", + "bbox": [ + 214, + 146, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {C R F} _ {\\text {l e a k y}} (c) = \\left\\{ \\begin{array}{l l} \\alpha c & c < 0 \\\\ \\operatorname {C R F} (c) & 0 \\leq c \\leq 1, \\\\ - \\frac {\\alpha}{\\sqrt {c}} + \\alpha + 1 & 1 < c \\end{array} \\right. \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 348, + 185, + 785, + 242 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\alpha$ is a constant parameter. Throughout, we set $\\alpha = 0.01$ for experiments. To summarize, our image formation process can transform the HDR radiances in our map representation into LDR camera pixel values captured with continuous exposure. The learnable parameters are the HDR radiance map, start and end poses $\\mathbf{T}(t_s),\\mathbf{T}(t_e)$ , exposure time $\\Delta t$ , white balance parameters WB, and control points for CRF $g$ . Since all modules are fully differentiable, we can optimize the parameters with a simple gradient-based optimization method by minimizing the objective function with proper regularization, as described in Sec. 3.3.", + "bbox": [ + 214, + 248, + 787, + 369 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Tracking and Mapping", + "text_level": 1, + "bbox": [ + 215, + 388, + 450, + 404 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We optimize camera trajectories during exposure time and reconstruct a sharp HDR 3D map using the rendering loss defined by our image formation process. To optimize the camera trajectory during exposure time, we additionally propose a trajectory loss and a camera trajectory initialization method. Overall loss is sum of an image rendering loss, a depth rendering loss, and a trajectory loss:", + "bbox": [ + 214, + 411, + 782, + 488 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\lambda_ {\\mathrm {i m g}} \\mathcal {L} _ {\\mathrm {i m g}} + \\lambda_ {\\mathrm {d e p t h}} \\mathcal {L} _ {\\mathrm {d e p t h}} + \\lambda_ {\\mathrm {t r a j}} \\mathcal {L} _ {\\mathrm {t r a j}}. \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 354, + 497, + 784, + 512 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Image Rendering Loss We jointly optimize the in-camera parameters and the map representation within the SLAM's tracking and mapping pipeline by applying an image rendering loss function as follows:", + "bbox": [ + 214, + 530, + 782, + 575 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {i m g}} = \\sum_ {i = 1} ^ {N} \\sum_ {\\mathbf {p}} \\left| C _ {\\mathrm {L D R}} ^ {i} (\\mathbf {p}) - \\hat {C} ^ {i} (\\mathbf {p}) \\right|, \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 584, + 784, + 625 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $C_{\\mathrm{LDR}}^i (\\mathbf{p})$ is a rendered color output from our image formation process and $\\hat{C}^i (\\mathbf{p})$ is the observed color at pixel location $\\mathbf{p}$ of frame $i$ . Even if the input images are degraded, the proposed rendering loss accounts for the physical degradation process and can reconstruct a sharp HDR radiance map.", + "bbox": [ + 214, + 633, + 782, + 696 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Depth Rendering Loss We constrain the depth camera pose to be aligned with the color camera's trajectory during exposure time. Specifically, we assign a pose with a minimum depth error as the depth camera pose and apply depth rendering loss for the selected pose as follows:", + "bbox": [ + 214, + 715, + 782, + 776 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {d e p t h}} = \\sum_ {i = 1} ^ {N} \\sum_ {\\mathbf {p}} | d (\\mathbf {T} \\left(t _ {\\mathrm {d}} ^ {i}\\right), \\mathbf {p}) - \\hat {d} ^ {i} (\\mathbf {p}) |, \\text {w h e r e} t _ {\\mathrm {d}} ^ {i} = \\underset {t \\in \\left[ t _ {s} ^ {i}, t _ {e} ^ {i} \\right]} {\\arg \\min } | d (\\mathbf {T} (t), \\mathbf {p}) - \\hat {d} ^ {i} (\\mathbf {p}) |, \\tag {14}\n$$\n", + "text_format": "latex", + "bbox": [ + 227, + 784, + 785, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 665, + 113, + 730, + 127 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $d(\\mathbf{T}(t_{\\mathrm{d}}^{i}), \\mathbf{p})$ is a rendered depth from the depth camera pose $\\mathbf{T}(t_{\\mathrm{d}}^{i})$ and $\\hat{d}^i (\\mathbf{p})$ is the ground-truth depth at pixel location $\\mathbf{p}$ of frame $i$ . Note that the depth rendering loss affects the color camera's trajectory since the depth camera pose is interpolated from $\\mathbf{T}(t_s^i)$ and $\\mathbf{T}(t_e^i)$ . Depth rendering loss ensures that at least one pose along the camera poses during the exposure time outputs accurate depth rendering.", + "bbox": [ + 212, + 145, + 787, + 238 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Unlike the integration process for color pixels, we optimize a single pose for a depth camera, assuming that the depth information is captured at a single moment within the time window. Although the depth camera measures some inaccurate depth values in fast-moving scenarios, most of the noises are filtered as invalid pixels by sensor manufacturers [41]. Depth sensors usually output invalid pixels on object boundaries and black objects, and most RGBD-SLAM methods ignore those regions.", + "bbox": [ + 212, + 239, + 787, + 345 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Trajectory Regularization We propose a trajectory loss that regularizes the camera trajectory during the exposure time. We design the trajectory loss function with two insights. First, the camera poses during the exposure time should be aligned with the global trajectory. As SLAM progressively optimizes the camera poses, the global trajectory can be obtained from previous localization results without additional cost and it gives meaningful information to the temporal sensor movement. We estimate the global trajectory by connecting the pose of the midpoint during each exposure time in the previous frames. Second, the size of the motion blur kernel is determined by the temporal velocity and the exposure time. Namely, the longer the exposure time $\\Delta t^i$ and the faster the temporal velocity, the further the distance between the start and end camera poses.", + "bbox": [ + 212, + 368, + 787, + 534 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our trajectory loss regularizes the temporal camera trajectory during the exposure time to be aligned with the global trajectory and the length of it to be proportional to the exposure time and temporal velocity, assuming piecewise linear velocity:", + "bbox": [ + 212, + 535, + 787, + 595 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {t r a j}} = \\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {t}} + \\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {R}}, \\tag {15}\n$$\n", + "text_format": "latex", + "bbox": [ + 428, + 609, + 784, + 628 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {t}} = \\left\\| \\mathbf {t} \\left(t _ {e} ^ {i - 1}\\right) - \\operatorname {L e r p} \\left(\\mathbf {t} ^ {i - 1}, \\mathbf {t} ^ {i}, a \\Delta t ^ {i - 1}\\right) \\right\\| _ {2} ^ {2} + \\left\\| \\mathbf {t} \\left(t _ {s} ^ {i}\\right) - \\operatorname {L e r p} \\left(\\mathbf {t} ^ {i - 1}, \\mathbf {t} ^ {i}, 1 - a \\Delta t ^ {i}\\right) \\right\\| _ {2} ^ {2}, \\tag {16}\n$$\n", + "text_format": "latex", + "bbox": [ + 225, + 657, + 784, + 683 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\operatorname {t r a j}} ^ {\\mathbf {R}} = \\left\\| \\mathbf {R} \\left(t _ {e} ^ {i - 1}\\right) - \\operatorname {S l e r p} \\left(\\mathbf {R} ^ {i - 1}, \\mathbf {R} ^ {i}, a \\Delta t ^ {i - 1}\\right) \\right\\| _ {2} ^ {2} + \\left\\| \\mathbf {R} \\left(t _ {s} ^ {i}\\right) - \\operatorname {S l e r p} \\left(\\mathbf {R} ^ {i - 1}, \\mathbf {R} ^ {i}, 1 - a \\Delta t ^ {i}\\right) \\right\\| _ {2} ^ {2}, \\tag {17}\n$$\n", + "text_format": "latex", + "bbox": [ + 217, + 710, + 785, + 750 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathbf{t}$ and $\\mathbf{R}$ are the translation and rotation vector of camera pose $\\mathbf{T}$ , and $a$ is an unknown global scale parameter that is related to the input frame rate. $\\mathbf{t}^i$ and $\\mathbf{R}^i$ are the center pose between the start and end pose of frame $i$ . The scale parameter $a$ is also jointly optimized within the tracking process. We further describe the relation between our scale parameter $a$ and the input frame rate in the supplementary material.", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 113, + 614, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We also propose an initialization strategy for robust optimization exploiting the global trajectory. With a constant velocity assumption, we initialize the $i + 1$ th frame's camera poses $\\mathbf{T}(t_s^{i + 1})$ and $\\mathbf{T}(t_e^{i + 1})$ by extrapolating estimated camera poses of $i$ and $i - 1$ th frames. We initialize the start and end poses to be separated with a small predefined distance along the global trajectory.", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 244, + 375, + 263 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We demonstrate that $I^2$ -SLAM can reconstruct a sharp HDR radiance map from casually captured videos with various input modalities. We describe our experimental setup in challenging datasets in Sec. 4.1. We show that $I^2$ -SLAM enhances state-of-the-art dense visual SLAM methods in Sec. 4.2. We conduct ablation studies and runtime analyses in Sec. 4.3 and Sec. 4.4, respectively.", + "bbox": [ + 212, + 277, + 787, + 354 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 214, + 376, + 428, + 393 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Baselines $I^2$ -SLAM serves as a versatile module that can be attached to dense visual SLAM methods to improve its performance. We apply our approach to the state-of-the-art RGB-SLAM method, NeRF-SLAM [38], which employs NeRF as a map representation and uses DROID-SLAM [50] as a tracking backbone. We re-implemented NeRF-SLAM with torch-ngp [49] and notate as NeRF-SLAM†. NeRF-SLAM† uses same loss functions of NeRF-SLAM. We additionally test $I^2$ -SLAM with an RGBD-SLAM approach to tackle challenging sequences in ScanNet [11] where robust learning-based SLAM method, DROID-SLAM, often fails without using additional depth channel. We employ a 3DGS-based RGBD-SLAM method, SplaTAM [23], to test $I^2$ -SLAM in RGBD inputs.", + "bbox": [ + 212, + 401, + 787, + 551 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets Most of the existing synthetic datasets for SLAM evaluation assume the ideal capturing setup, and do not exhibit any camera motion blur or dynamic appearance changes. We therefore propose a new dataset incorporating these effects. The new dataset contains realistic image degradation by simulating motion blur and auto exposure. We render the images and depth information with Cycles path tracer [1]. Also, we test $I^2$ -SLAM on challenging real-world datasets. We use TUM-RGBD [46] and ScanNet [11] dataset for evaluating RGB and RGBD scenarios, respectively.", + "bbox": [ + 212, + 566, + 787, + 689 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Evaluation We report the average values of three runs with different random seeds for all the quantitative evaluations except the ablation study and the runtime analysis. We measure PSNR, SSIM [53], and LPIPS [58] between rendered images from the reconstructed map and sharp ground-truth images which can be obtained from our synthetic dataset. Since there are no ground-truth sharp images in the real-world dataset, we evaluate the view synthesis performance only for the sharp frames that are manually annotated. Also, we run test-time optimization [26] to factor out pose errors in measuring the rendering quality of RGB-SLAMs. We report ATE RMSE [46] for tracking performance evaluation.", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 665, + 113, + 730, + 127 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/874149510d2ffca079429acfc0fc5182940bf5a4cfafb7f0261b0560da2fffa1.jpg", + "table_caption": [ + "Table 1: Rendering quality comparison against the RGB-SLAM baseline on TUM-RGBD [46] and synthetic dataset. $I^2$ -SLAM represents our RGB-SLAM model which is incorporated into our re-implementation of NeRF-SLAM [38], NeRF-SLAM†." + ], + "table_footnote": [], + "table_body": "
MethodsMetricsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1IF2
NeRF-SLAM†[38]PSNR25.9729.9724.7228.6425.4330.2026.0926.70
SSIM0.8250.9000.7270.8100.8320.8670.7890.842
LPIPS0.2220.0930.3660.3280.3230.3270.3020.270
Depth L110.9717.8330.9240.6855.8020.725.0219.76
I2-SLAMPSNR27.2332.0628.9128.9927.5932.3330.1628.89
SSIM0.8350.9160.8330.8270.8750.9020.8980.887
LPIPS0.1860.0740.1930.2840.2600.2860.2110.241
Depth L19.0417.9417.6020.3341.9220.483.5517.28
", + "bbox": [ + 233, + 198, + 769, + 325 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/439ff7817e13dcba3e31deda272acb4b37072fa33b5637e76322beeec76e777d.jpg", + "table_caption": [ + "Table 2: Rendering quality comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. $I^2$ -SLAM in this table represents our RGBD-SLAM model which is incorporated into SplaTAM [23]." + ], + "table_footnote": [], + "table_body": "
MethodsMetricsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1IF2
SplaTAM [23]PSNR21.6024.6424.5019.6321.3819.7824.2222.3623.82
SSIM0.7860.7730.8470.7190.8200.7900.8550.7660.824
LPIPS0.2360.2750.1820.3400.2320.2460.2270.2810.230
I²-SLAMPSNR23.3926.8924.0726.4026.1821.9823.8823.7224.07
SSIM0.7800.7960.8280.7620.8420.7700.7980.7960.826
LPIPS0.1800.2360.1750.2380.1930.2310.2630.2330.205
", + "bbox": [ + 248, + 391, + 754, + 503 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We use the center of camera poses $\\mathbf{T}(t_s^i)$ and $\\mathbf{T}(t_e^i)$ to evaluate our method and use scale-aligned ground-truth trajectory for RGB-SLAM to handle the scale ambiguity. Further details can be found in the supplementary material.", + "bbox": [ + 215, + 532, + 785, + 579 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Experimental Results", + "text_level": 1, + "bbox": [ + 215, + 602, + 441, + 617 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Quantitative Results We report the quantitative results of map rendering performance for keyframes of RGB and RGBD datasets in Tabs. 1 and 2, respectively. We observe that $I^2$ -SLAM enhances the rendering quality of NeRF-SLAM† across all metrics on the both synthetic and real-world TUM-RGBD [46] datasets. $I^2$ -SLAM also substantially enhances the depth accuracy for RGB-SLAM. In the RGBD dataset scenario, $I^2$ -SLAM also shows superior rendering quality in most scenes when attached to SplaTAM [23]. Especially, $I^2$ -SLAM improves the view-synthesis performance of SplaTAM in a large margin in SP of synthetic dataset and 0785-00 of ScanNet [11] dataset, whose appearances are changing dynamically within the videos. It shows that our in-camera model is especially advantageous when combined with the models without view-dependent effects. Furthermore, we report the camera trajectory error of RGB-SLAM methods in Tab. 3. The results show that $I^2$ -SLAM substantially improves the tracking performance of NeRF-SLAM† even if NeRF-SLAM† takes accurate initial tra", + "bbox": [ + 215, + 628, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 113, + 614, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/da4aeddfc87cf03f215a02968714c678868fddf4d6675823af0dd5898562bafd.jpg", + "table_caption": [ + "Table 3: We evaluate the tracking performance of RGB-SLAM methods on TUMRGBD [46] and synthetic dataset in terms of ATE-RMSE (cm)." + ], + "table_footnote": [], + "table_body": "
MethodsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1
NeRF-SLAM†[38]2.080.417.133.973.203.381.14
I²-SLAM1.640.261.951.503.231.590.74
", + "bbox": [ + 305, + 184, + 697, + 246 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/96b29c1a2dbe15846e1db144fdb94c63eae21b640d5ca9bbecf237dd13f398cc.jpg", + "table_caption": [ + "Table 4: Tracking accuracy comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. ATE-RMSE (cm) is measured as an evaluation metric." + ], + "table_footnote": [], + "table_body": "
MethodsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1
SplaTAM [23]1.803.011.135.911.111.502.041.02
I²-SLAM1.413.251.004.590.861.551.961.05
", + "bbox": [ + 305, + 310, + 697, + 373 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "jectory from DROID-SLAM as initial camera poses. It supports our claim that image formation process, when appropriately modeled, can enhance the tracking accuracy of inputs that are casually captured. In RGBD datasets, however, the trajectory accuracy improvement is subtle since the depth information mostly determines the camera poses as reported in Tab. 4.", + "bbox": [ + 215, + 411, + 784, + 487 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Qualitative Results We demonstrate the rendered images of $I^2$ -SLAM with NeRF-SLAM† in Fig. 3. As shown in Fig. 3 (a), $I^2$ -SLAM successfully renders sharp images, whereas NeRF-SLAM† has blurry artifacts come from the degraded input, for example, bricks in Sponza, boundary of the tire in LOU, complex texture of books and thin legs of the chair in Italian-flat-0. More importantly, our approach also shows remarkable performance in reconstructing sharp maps from TUM-RGBD data which contains the real-world camera motion. The texts on the books and objects on the table are clearly rendered with $I^2$ -SLAM when we compare to the results of baseline and blurred input frames. In Fig. 4, we show samples of rendered images in RGBD scenario. We can observe the consistent improvement over SplaTAM in generating a sharp map in our synthetic dataset. The letters on the book cover and the bricks are clearly rendered with $I^2$ -SLAM. Also, we observe significant map quality enhancement in the ScanNet dataset. The letters on the board and tassels in 0024-01, the detection mark and objects on the table in 0736-00, and the pictures in 0785-00 are deblurred with our approach. Furthermore, since the color of Gaussians in SplaTAM is consistent regardless of the exposure of images, SplaTAM does not appropriately model the brightness changes as we can see in the darker color of bricks in Sponza and tiled artifacts in 0785-00. Such artifacts are removed by modeling the tone mapping process.", + "bbox": [ + 215, + 536, + 785, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 665, + 113, + 730, + 127 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/4ec70439d970c11a1476a55bc71b2fe235b9c0f78e5a570af5824fcc3d7b9a24.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 243, + 143, + 754, + 375 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/2d614ad3f846b0b052913d6b539ea971d3cc5544befda2eec4ef67c1e637244b.jpg", + "image_caption": [ + "(a) Synthetic Dataset", + "(b) TUM-RGBD [46]", + "Fig. 3: Qualitative results on applying $I^2$ -SLAM to the RGB-SLAM method." + ], + "image_footnote": [], + "bbox": [ + 243, + 391, + 754, + 694 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 766, + 388, + 782 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We conduct an ablation study in ScanNet [11] dataset. Table 5 shows that each component plays a crucial role in improving tracking or mapping performance. In Tab. 5, Traj. Reg. refers to the trajectory regularization in Sec. 3.3. Motion", + "bbox": [ + 212, + 794, + 785, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 114, + 614, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/6397759484d580a9dcf104260a31766badaf7dfd851c37a7f62d9f15da26a8d3.jpg", + "image_caption": [ + "(a) Synthetic Dataset" + ], + "image_footnote": [], + "bbox": [ + 243, + 145, + 754, + 303 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/9252c2e412c740f8ef7fa24a2da377a596f648c47e29f5755e9983af9b29d44f.jpg", + "image_caption": [ + "(b) ScanNet [11]", + "Fig. 4: Qualitative results on applying $I^2$ -SLAM to the RGBD-SLAM method." + ], + "image_footnote": [], + "bbox": [ + 243, + 320, + 751, + 621 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "blur-aware rendering improves tracking performance by preventing the accumulation of tracking errors. HDR map shows improved rendering quality over LDR representations. Trajectory regularization affects multi-camera optimization, resulting in enhancements in both tracking and mapping.", + "bbox": [ + 212, + 696, + 787, + 756 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.4 Runtime analysis", + "text_level": 1, + "bbox": [ + 215, + 781, + 405, + 796 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We analyze how much our approach affects the runtime and performance with ScanNet 0024-01 in Tab. 6. $I^2$ -SLAM exhibits better ATE-RMSE and PSNR", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 666, + 113, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/44ed9a30310b32e76e1eb539bdf3eeb27c0d71434375b9fd5a5fe516606986b7.jpg", + "table_caption": [ + "Table 5: Ablation study." + ], + "table_footnote": [], + "table_body": "
Traj. Reg.Tone MappingMotion BlurATEPSNRSSIMLPIPSMapping /FrameTracking /FrameATEPSNRSSIMLPIPS
✓✓✓2.5625.620.8010.195I²-SLAM2.058s8.494s1.4224.160.7860.211
X✓✓2.6624.800.7690.203I²-SLAM-S0.436s1.867s1.5023.920.7950.230
✓X✓2.6022.390.7560.226SplaTAM [23]0.424s1.433s1.8122.260.8000.224
XX✓2.6322.360.7550.228SplaTAM-S [23]0.086s0.377s2.4021.430.7770.243
XXX2.7123.050.7930.235
", + "bbox": [ + 218, + 171, + 748, + 246 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/de4be7859ecea5f513829ed60df8f95a219c3896bc5b344d4ae322609e012fe8.jpg", + "image_caption": [ + "(a) ATE-RMSE over iteration time" + ], + "image_footnote": [], + "bbox": [ + 297, + 268, + 478, + 373 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/c4b99d017af7e1436b478696879fdf78ba9491f9ddf8534face733705adb5795.jpg", + "image_caption": [ + "(b) PSNR over iteration time", + "Fig. 5: Performance variations over iteration time of $I^2$ -SLAM and SplaTAM [23]." + ], + "image_footnote": [], + "bbox": [ + 501, + 268, + 683, + 373 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "metrics compared to SplaTAM [23], but it comes at the cost of slower speed. However, $I^2$ -SLAM-S, which uses $20\\%$ iterations, takes a similar runtime but yields better performance. In contrast, SplaTAM-S, which also uses $20\\%$ iterations, shows a significant decrease in performance.", + "bbox": [ + 212, + 438, + 782, + 498 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In Fig. 5, we analyze the trend of performance changes concerning the number of iterations. Four models with different numbers of iterations are compared. In most cases, our method demonstrates better tracking and rendering performance when using a similar runtime.", + "bbox": [ + 212, + 500, + 784, + 559 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 214, + 580, + 357, + 595 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We present $I^2$ -SLAM, a generic module that improves the quality of existing visual SLAM approaches by inverting the image formation process for casually captured videos. We show the effectiveness of our module by incorporating it into the state-of-the-art methods in RGB and RGBD-SLAM approaches. With $I^2$ -SLAM, existing visual SLAM pipelines can effectively handle the varying appearance and motion blur that are prevalent in-the-wild capturing scenarios.", + "bbox": [ + 212, + 608, + 784, + 698 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Although $I^2$ -SLAM is able to reconstruct sharp HDR maps while estimating the camera trajectory from casually captured videos, there are some limitations. The motion blur simulation with the sum of multiple cameras accompanies the longer rendering and optimization time. An efficient approximation method to simulate camera motion blur would be an interesting research direction to improve our approach.", + "bbox": [ + 212, + 699, + 784, + 790 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements This work is supported by the National Research Foundation of Korea(NRF) grant (No. RS-2023-00218601) and IITP grant [NO.RS-", + "bbox": [ + 212, + 809, + 784, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 113, + 614, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] funded by the Korea government(MSIT).", + "bbox": [ + 215, + 146, + 787, + 176 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 199, + 321, + 215 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Blender, O.C.: Blender - a 3D modelling and rendering package. Blender Foundation, Stichting Blender Foundation, Amsterdam (2018), http://www.blender.org", + "2. Bloesch, M., Czarnowski, J., Clark, R., Leutenegger, S., Davison, A.J.: Codeslam—learning a compact, optimisable representation for dense visual slam. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2560–2568 (2018)", + "3. Bloesch, M., Laidlow, T., Clark, R., Leutenegger, S., Davison, A.J.: Learning meshes for dense visual slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5855-5864 (2019)", + "4. Bylow, E., Sturm, J., Kerl, C., Kahl, F., Cremers, D.: Real-time camera tracking and 3d reconstruction using signed distance functions. In: Robotics: Science and Systems. vol. 2, p. 2 (2013)", + "5. Chakrabarti, A.: A neural approach to blind motion deblurring. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 221-235. Springer (2016)", + "6. Chaplot, D.S., Gandhi, D., Gupta, S., Gupta, A., Salakhutdinov, R.: Learning to explore using active neural slam. In: International Conference on Learning Representations (ICLR) (2020)", + "7. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018)", + "8. Chen, T., Culbertson, P., Schwager, M.: Catnips: Collision avoidance through neural implicit probabilistic scenes. arXiv preprint arXiv:2302.12931 (2023)", + "9. Cho, S., Lee, S.: Fast motion deblurring. In: ACM SIGGRAPH Asia 2009 papers, pp. 1-8 (2009)", + "0. Covolan, J.P.M., Sementille, A.C., Sanches, S.R.R.: A mapping of visual slam algorithms and their applications in augmented reality. In: 2020 22nd Symposium on Virtual and Augmented Reality (SVR). pp. 20-29. IEEE (2020)", + "1. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: Scannet: Richly-annotated 3d reconstructions of indoor scenes. In: Proc. Computer Vision and Pattern Recognition (CVPR), IEEE (2017)", + "2. Dai, A., Nießner, M., Zollhöfer, M., Izadi, S., Theobalt, C.: Bundlefusion: Real-time globally consistent 3d reconstruction using on-the-fly surface reintegration. ACM Transactions on Graphics (ToG) 36(4), 1 (2017)", + "3. Debevec, P.E., Malik, J.: Recovering high dynamic range radiance maps from photographs. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques. p. 369-378. SIGGRAPH '97, ACM Press/Addison-Wesley Publishing Co., USA (1997). https://doi.org/10.1145/258734.258884", + "4. Fergus, R., Singh, B., Hertzmann, A., Roweis, S.T., Freeman, W.T.: Removing camera shake from a single photograph. In: Acm Siggraph 2006 Papers, pp. 787-794 (2006)", + "5. Gupta, S., Davidson, J., Levine, S., Sukthankar, R., Malik, J.: Cognitive mapping and planning for visual navigation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2616-2625 (2017)" + ], + "bbox": [ + 225, + 231, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 665, + 113, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018)", + "17. Huang, H., Li, L., Cheng, H., Yeung, S.K.: Photo-slam: Real-time simultaneous localization and photorealistic mapping for monocular, stereo, and rgb-d cameras. arXiv preprint arXiv:2311.16728 (2023)", + "18. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: Hdr-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022)", + "19. Jaderberg, M., Simonyan, K., Zisserman, A., kavukcuoglu, k.: Spatial transformer networks. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 28. Curran Associates, Inc. (2015), https://proceedings.neurips.cc/paper_files/paper/2015/file/33ceb07bf4eeb3da587e268d663aba1a-Paper.pdf", + "20. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Maalouf, A., Li, S., Iyer, G., Saryazdi, S., Keetha, N., et al.: Conceptfusion: Open-set multimodal 3d mapping. arXiv preprint arXiv:2302.07241 (2023)", + "21. Jinyu, L., Bangbang, Y., Danpeng, C., Nan, W., Guofeng, Z., Hujun, B.: Survey and evaluation of monocular visual-inertial slam algorithms for augmented reality. Virtual Reality & Intelligent Hardware 1(4), 386-410 (2019)", + "22. Jun-Seong, K., Yu-Ji, K., Ye-Bin, M., Oh, T.H.: HDR-plenoxels: Self-calibrating high dynamic range radiance fields. In: European Conference on Computer Vision. pp. 384-401. Springer (2022)", + "23. Keetha, N., Karhade, J., Jatavallabhula, K.M., Yang, G., Scherer, S., Ramanan, D., Luiten, J.: Splatam: Splat, track & map 3d gaussians for dense rgb-d slam. arXiv preprint arXiv:2312.02126 (2023)", + "24. Keller, M., Lefloch, D., Lambers, M., Izadi, S., Weyrich, T., Kolb, A.: Real-time 3d reconstruction in dynamic scenes using point-based fusion. In: 2013 International Conference on 3D Vision-3DV 2013. pp. 1-8. IEEE (2013)", + "25. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3d gaussian splatting for real-time radiance field rendering. ACM Transactions on Graphics 42(4) (2023)", + "26. Lin, C.H., Ma, W.C., Torralba, A., Lucey, S.: Barf: Bundle-adjusting neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5741-5751 (2021)", + "27. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020)", + "28. Ma, L., Li, X., Liao, J., Zhang, Q., Wang, X., Wang, J., Sander, P.V.: Deblur-nerf: Neural radiance fields from blurry images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12861-12870 (2022)", + "29. Matsuki, H., Murai, R., Kelly, P.H., Davison, A.J.: Gaussian splatting slam. arXiv preprint arXiv:2312.06741 (2023)", + "30. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022)", + "31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 114, + 614, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022)", + "33. Newcombe, R.A., Izadi, S., Hilliges, O., Molyneaux, D., Kim, D., Davison, A.J., Kohi, P., Shotton, J., Hodges, S., Fitzgibbon, A.: Kinectfusion: Real-time dense surface mapping and tracking. In: 2011 10th IEEE international symposium on mixed and augmented reality. pp. 127-136. IEEE (2011)", + "34. Newcombe, R.A., Lovegrove, S.J., Davison, A.J.: Dtam: Dense tracking and mapping in real-time. In: 2011 international conference on computer vision. pp. 2320-2327. IEEE (2011)", + "35. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013)", + "36. Oleynikova, H., Taylor, Z., Fehr, M., Siegwart, R., Nieto, J.: Voxblox: Incremental 3d euclidean signed distance fields for on-board mav planning. In: 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 1366-1373. IEEE (2017)", + "37. Ortiz, J., Clegg, A., Dong, J., Sucar, E., Novotny, D., Zollhoefer, M., Mukadam, M.: isdf: Real-time neural signed distance fields for robot perception. In: Robotics: Science and Systems (2022)", + "38. Rosinol, A., Leonard, J.J., Carlone, L.: Nerf-slam: Real-time dense monocular slam with neural radiance fields. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 3437-3444. IEEE (2023)", + "39. Rückert, D., Franke, L., Stamminger, M.: Adop: Approximate differentiable one-pixel point rendering. ACM Transactions on Graphics (ToG) 41(4), 1-14 (2022)", + "40. Sandström, E., Li, Y., Van Gool, L., Oswald, M.R.: Point-slam: Dense neural point cloud-based slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18433-18444 (2023)", + "41. Sarbolandi, H., Lefloch, D., Kolb, A.: Kinect range sensing: Structured-light versus time-of-flight kinect. Computer vision and image understanding 139, 1-20 (2015)", + "42. Schops, T., Sattler, T., Pollefeys, M.: Bad slam: Bundle adjusted direct rgb-d slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 134-144 (2019)", + "43. Shafiullah, N.M.M., Paxton, C., Pinto, L., Chintala, S., Szlam, A.: Clipfields: Weakly supervised semantic fields for robotic memory. arXiv preprint arXiv:2210.05663 (2022)", + "44. Shan, Q., Jia, J., Agarwala, A.: High-quality motion deblurring from a single image. Acm transactions on graphics (tog) 27(3), 1-10 (2008)", + "45. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled feature fields enable few-shot language-guided manipulation. In: 7th Annual Conference on Robot Learning (2023)", + "46. Sturm, J., Engelhard, N., Endres, F., Burgard, W., Cremers, D.: A benchmark for the evaluation of rgb-d slam systems. In: 2012 IEEE/RSJ international conference on intelligent robots and systems. pp. 573-580. IEEE (2012)", + "47. Sucar, E., Liu, S., Ortiz, J., Davison, A.J.: imap: Implicit mapping and positioning in real-time. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6229-6238 (2021)", + "48. Sun, J., Cao, W., Xu, Z., Ponce, J.: Learning a convolutional neural network for non-uniform motion blur removal. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 769-777 (2015)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "$I^2$ -SLAM", + "bbox": [ + 665, + 113, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "49. Tang, J.: Torch-ngp: a pytorch implementation of instant-ngp (2022), https://github.com/ashawkey/torch-ngp", + "50. Teed, Z., Deng, J.: Droid-slam: Deep visual slam for monocular, stereo, and rgbd cameras. Advances in neural information processing systems 34, 16558-16569 (2021)", + "51. Wang, H., Wang, J., Agapito, L.: Co-slam: Joint coordinate and sparse parametric encodings for neural real-time slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13293-13302 (2023)", + "52. Wang, P., Zhao, L., Ma, R., Liu, P.: Bad-nerf: Bundle adjusted deblur neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4170-4179 (2023)", + "53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)", + "54. Whelan, T., Leutenegger, S., Salas-Moreno, R., Glocker, B., Davison, A.: Elastic-fusion: Dense slam without a pose graph. Robotics: Science and Systems (2015)", + "55. Whelan, T., Salas-Moreno, R.F., Glocker, B., Davison, A.J., Leutenegger, S.: Elastic fusion: Real-time dense slam and light source estimation. The International Journal of Robotics Research 35(14), 1697-1716 (2016)", + "56. Whyte, O., Sivic, J., Zisserman, A., Ponce, J.: Non-uniform deblurring for shaken images. International journal of computer vision 98, 168-186 (2012)", + "57. Yugay, V., Li, Y., Gevers, T., Oswald, M.R.: Gaussian-slam: Photo-realistic dense slam with gaussian splatting. arXiv preprint arXiv:2312.10070 (2023)", + "58. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)", + "59. Zhang, X., Matzen, K., Nguyen, V., Yao, D., Zhang, Y., Ng, R.: Synthetic defocus and look-ahead autofocus for casual videography. arXiv preprint arXiv:1905.06326 (2019)", + "60. Zhu, Z., Peng, S., Larsson, V., Xu, W., Bao, H., Cui, Z., Oswald, M.R., Pollefeys, M.: Nice-slam: Neural implicit scalable encoding for slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12786-12796 (2022)" + ], + "bbox": [ + 215, + 147, + 784, + 604 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim", + "bbox": [ + 271, + 114, + 614, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_model.json b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_model.json new file mode 100644 index 0000000000000000000000000000000000000000..43046095a29aee0658e004e169fdd1984f054eef --- /dev/null +++ b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_model.json @@ -0,0 +1,2612 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.272, + 0.143, + 0.734, + 0.188 + ], + "angle": 0, + "content": "\\(I^2\\)-SLAM: Inverting Imaging Process for Robust Photorealistic Dense SLAM" + }, + { + "type": "text", + "bbox": [ + 0.283, + 0.214, + 0.721, + 0.246 + ], + "angle": 0, + "content": "Gwangtak Bae\\*1, Changwoon Choi\\*1, Hyeongjun Heo\\*1, Sang Min Kim\\*1, and Young Min Kim\\*1,2" + }, + { + "type": "text", + "bbox": [ + 0.251, + 0.256, + 0.753, + 0.287 + ], + "angle": 0, + "content": "\\(^{1}\\) Dept. of Electrical and Computer Engineering, Seoul National University \\(^{2}\\) INMC & IPAI, Seoul National University" + }, + { + "type": "image", + "bbox": [ + 0.239, + 0.323, + 0.326, + 0.421 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.22, + 0.423, + 0.343, + 0.435 + ], + "angle": 0, + "content": "Casually Captured Input" + }, + { + "type": "image", + "bbox": [ + 0.334, + 0.323, + 0.513, + 0.42 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.35, + 0.423, + 0.498, + 0.435 + ], + "angle": 0, + "content": "Camera Tracking & Mapping" + }, + { + "type": "image", + "bbox": [ + 0.523, + 0.323, + 0.676, + 0.41 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.553, + 0.411, + 0.648, + 0.421 + ], + "angle": 0, + "content": "Varying Appearances" + }, + { + "type": "image", + "bbox": [ + 0.678, + 0.323, + 0.766, + 0.358 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.694, + 0.36, + 0.749, + 0.37 + ], + "angle": 0, + "content": "Blurry Input" + }, + { + "type": "image", + "bbox": [ + 0.678, + 0.373, + 0.766, + 0.408 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.674, + 0.41, + 0.769, + 0.42 + ], + "angle": 0, + "content": "Sharp Reconstruction" + }, + { + "type": "image_caption", + "bbox": [ + 0.577, + 0.423, + 0.713, + 0.435 + ], + "angle": 0, + "content": "Sharp HDR Radiance Field" + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.447, + 0.788, + 0.489 + ], + "angle": 0, + "content": "Fig. 1: We propose \\( I^2 \\)-SLAM, a SLAM pipeline with a physical image formation process. We can reconstruct photorealistic and sharp HDR maps from casually captured videos which contain severe motion blur and varying appearances." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.543, + 0.741, + 0.765 + ], + "angle": 0, + "content": "Abstract. We present an inverse image-formation module that can enhance the robustness of existing visual SLAM pipelines for casually captured scenarios. Casual video captures often suffer from motion blur and varying appearances, which degrade the final quality of coherent 3D visual representation. We propose integrating the physical imaging into the SLAM system, which employs linear HDR radiance maps to collect measurements. Specifically, individual frames aggregate images of multiple poses along the camera trajectory to explain prevalent motion blur in hand-held videos. Additionally, we accommodate per-frame appearance variation by dedicating explicit variables for image formation steps, namely white balance, exposure time, and camera response function. Through joint optimization of additional variables, the SLAM pipeline produces high-quality images with more accurate trajectories. Extensive experiments demonstrate that our approach can be incorporated into recent visual SLAM pipelines using various scene representations, such as neural radiance fields or Gaussian splatting. Project website" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.778, + 0.741, + 0.806 + ], + "angle": 0, + "content": "Keywords: SLAM \\(\\cdot\\) photorealistic 3D reconstruction \\(\\cdot\\) motion deblurring \\(\\cdot\\) HDR reconstruction" + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.812, + 0.512, + 0.825 + ], + "angle": 0, + "content": "* Authors contributed equally to this work." + }, + { + "type": "page_footnote", + "bbox": [ + 0.221, + 0.826, + 0.534, + 0.84 + ], + "angle": 0, + "content": "† Young Min Kim is the corresponding author." + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.812, + 0.534, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.114, + 0.615, + 0.129 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.376, + 0.161 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.388 + ], + "angle": 0, + "content": "Simultaneous localization and mapping (SLAM) builds a map of the environment during deployment, which can be utilized in various applications, including VR/AR [10, 21], robotic navigation [6, 15, 36], and collision handling [8]. Traditional 3D SLAM approaches typically use geometric representations like points/surfels [24, 42, 50, 54, 55], mesh [3], voxel grids [4, 33], or voxel hashing [12, 35]. Recent visual SLAM approaches additionally capture visual appearances incorporating advances in Neural Radiance Fields (NeRF) [31] and its variants [25, 32]. They can synthesize photorealistic images of the environment and open up new possibilities in complex downstream tasks such as detailed semantic scene understanding [20], language-guided manipulation [45], or visual navigation [43]. Additionally, neural representations can fill unseen regions with smooth geometric estimation and require low-memory footprint [37, 47, 51]. 3D visual representations can achieve real-time performance using voxelized hash grid [32] or 3D Gaussian Splatting (3DGS) [25]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.388, + 0.788, + 0.508 + ], + "angle": 0, + "content": "Despite many works that build visual representations using the SLAM framework, most do not maintain their performance in real-world scenarios. Casually captured videos, the standard input for visual SLAM systems, suffer from two prevalent challenges: 1) motion blur due to camera movement and 2) varying appearances resulting from auto exposure and white balancing adjustments as demonstrated in Fig. 1. The degradation in images serves as a critical bottleneck for the accuracy of the map and the pose estimation, and the error accumulates due to the incremental nature of SLAM, significantly reducing the overall quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.75 + ], + "angle": 0, + "content": "This work tackles the prevailing challenges by attaching the physical image formation process that directly models the aforementioned variations. Then, we can directly optimize for the correct camera poses and raw measurements via an analysis-by-synthesis approach. Specifically, the motion-blurred image is compared against observations integrated along the estimated camera trajectories during a window of exposure time instead of an image from a single camera pose. Our pipeline approximates the camera poses as a linear movement and optimizes the start and end poses. The global trajectory estimated in the SLAM pipeline guides the initial blur movement with in-camera parameters, such as exposure time. At the same time, we match the per-frame appearance variation against simulated images and jointly optimize a differentiable tone mapper composed of exposure time, white balance function, and camera response function (CRF). We employ high dynamic range (HDR) radiance fields as a map representation to linearize the color space, which reflects the actual light intensity maps. The HDR maps simplify modeling appearance variations and produce significantly more realistic motion blur effects [13]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.825 + ], + "angle": 0, + "content": "As our formulation, coined \\( I^2 \\)-SLAM, inverts the actual measurement steps, the module can augment any dense visual SLAM pipelines that use image inputs, including implicit neural networks and 3D Gaussians. Our extensive experiments demonstrate that it can robustly reconstruct sharp HDR maps from RGB/RGBD streams afflicted with severe motion blur and varying appearances." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.825, + 0.663, + 0.84 + ], + "angle": 0, + "content": "Our technical contributions can be summarized as follows:" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.146, + 0.784, + 0.177 + ], + "angle": 0, + "content": "- We present \\( I^2 \\)-SLAM, integrating the image formation process into the visual SLAM approaches to overcome dominant challenges in real-world captures." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.179, + 0.785, + 0.223 + ], + "angle": 0, + "content": "- Incorporating 3D maps composed of linear radiance values, our formulation jointly optimizes the approximate movement for the motion blur and tonemapbing functions for appearance variations during the SLAM framework." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.224, + 0.784, + 0.268 + ], + "angle": 0, + "content": "- We propose an initialization and regularization method to stabilize the blur movement optimization to align with the estimated global camera trajectory, utilizing the SLAM setup." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.27, + 0.785, + 0.315 + ], + "angle": 0, + "content": "- We enhance the robustness and performance of recent visual SLAM approaches in the real-world and our synthetic dataset, which contains severe motion blur and varying appearance." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.146, + 0.785, + 0.315 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.341, + 0.396, + 0.357 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.376, + 0.785, + 0.482 + ], + "angle": 0, + "content": "Dense Visual SLAM Visual SLAM methods use images as input and first started using multi-view geometry between sparse image features to estimate camera trajectories. DTAM [34] further demonstrated building a projective photometric cost volume, a dense map representation that unlocks the opportunity for combining various image-based applications. As deep neural networks prosper in computer vision, parts of the visual SLAM pipeline have also been successfully deployed to use latent representations [2] or assist the depth estimation [50]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.484, + 0.787, + 0.664 + ], + "angle": 0, + "content": "Subsequent advancements in neural visual SLAM benefit from the technical innovations in neural implicit representation or improved novel representations. iMAP [47] employed implicit neural map representation for SLAM. NICE-SLAM [60] demonstrates that the multi-resolution feature grid representation can improve the speed and resolve the forgetting problem in large-scale scenes. Co-SLAM [51] explores the coordinate and parametric encodings to achieve efficient and accurate mapping. NeRF-SLAM [38] eliminates the dependency on depth by utilizing DROID-SLAM [50]. Recent results favor explicit representations when high speed and photometric quality are desired. Point-SLAM [40] creates photorealistic 3D maps using a dynamic neural point cloud. Since the introduction of 3D Gaussian Splatting [25], several concurrent works rapidly deploy them for 3D map representation for SLAM [17,23,29,57]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Motion Deblurring Motion blur significantly affects the quality of many computer vision tasks and has long been investigated as an active research topic. Traditional approaches assume a convolution kernel for the motion blur and convert the operation via deconvolution [9, 14, 44, 56]. The convolution operation naturally transfers to convolutional neural networks (CNN), and more recent works estimate the non-uniform motion blur field [48], complex Fourier coefficients [5], or dense motion flow [7]. Recent neural representations [31, 32] also suffer from performance degradation when handling blurred input images. Various works account for the blur operation and reconstruct a sharp 3D map even when input images are blurred [28, 52]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.615, + 0.129 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.787, + 0.284 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.295, + 0.788, + 0.366 + ], + "angle": 0, + "content": "Fig. 2: Method overview. (a) We reconstruct a sharp HDR radiance field map. (b) Motion blur is simulated by integration of sharp images, which are obtained from virtual camera poses during the exposure time. Then we obtain the blurry LDR image by applying differentiable tone mapping module. (c) SLAM methods simultaneously perform tracking and mapping from degraded images to reconstruct a sharp HDR map." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.392, + 0.788, + 0.469 + ], + "angle": 0, + "content": "The input measurements for the visual SLAM are susceptible to motion blur, as a moving camera captures an image for a duration of time. We linearize the camera trajectory during the exposure time and optimize the poses to match the blurred input, similar to [52]. However, we further exploit the SLAM setup and regularize the blur movement to be aligned with the estimated camera trajectory." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.488, + 0.788, + 0.685 + ], + "angle": 0, + "content": "High Dynamic Range Recovery Another critical issue for high-quality visual SLAM is that the pixel values are inconsistent with different exposures in input frames. Classical works on HDR imaging demonstrate that a color space of an HDR radiance map can successfully combine multiple images of different exposures [13]. HDR radiances are linear to the scene radiance values and lead to better results in image processing and image-based modeling [7, 16, 59]. Our map representation also models the actual HDR radiance values, and we provide explicit variables to model the physical process to map the pixel values, namely the exposure time, white balance, and camera response function per frame. Recent works on novel-view synthesis and 3D reconstruction also achieve improved results as they optimize the HDR radiances with exposure times [18, 22, 30, 39]. Our work integrates factors such as exposure time into a coherent formulation for tone mapping and motion blur and stabilizes the overall optimization." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.705, + 0.331, + 0.721 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "\\(I^2\\)-SLAM is a generic method that can be combined with any existing photorealistic dense SLAM methods. In Sec. 3.1, we first review the rendering techniques for two representative map representations used in our experiments: Neural Radiance Fields (NeRF) [30] and 3D Gaussian Splatting (3DGS) [25]. Then we describe our physical image formation process to render motion-blurred and appearance-varying images in Sec. 3.2. Finally, we explain how to integrate our image formation process into existing SLAM pipelines in Sec. 3.3." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.733, + 0.162 + ], + "angle": 0, + "content": "3.1 Preliminaries: Rendering for Photorealistic Dense SLAM" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.177, + 0.784, + 0.266 + ], + "angle": 0, + "content": "Our approach seamlessly integrates with various methods for generating color c and, optionally, depth \\(d\\) for each pixel for a given camera pose. Owing to their photorealistic quality and ease of training, most recent visual SLAM approaches are based on variations stemming from either NeRF [31] or 3DGS [25]. This section reviews the general formulations of the two approaches, elucidating the process of generating color and depth information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.268, + 0.785, + 0.314 + ], + "angle": 0, + "content": "Let \\(\\mathbf{c}(\\mathbf{T},\\mathbf{p})\\) and \\(d(\\mathbf{T},\\mathbf{p})\\) denote the color and depth at pixel location \\(\\mathbf{p}\\) with camera pose \\(\\mathbf{T}\\). For NeRF, we can obtain the color and depth of target pixels by marching rays and utilizing the volume rendering technique:" + }, + { + "type": "equation", + "bbox": [ + 0.304, + 0.328, + 0.785, + 0.368 + ], + "angle": 0, + "content": "\\[\n\\mathbf {c} (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {N} \\tau_ {i} \\left(1 - e ^ {- \\sigma_ {i} \\delta_ {i}}\\right) \\mathbf {c} _ {i} \\quad \\text {w h e r e} \\tau_ {i} = e ^ {- \\sum_ {j = 1} ^ {i - 1} \\sigma_ {j} \\delta_ {j}}, \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.395, + 0.382, + 0.785, + 0.422 + ], + "angle": 0, + "content": "\\[\nd (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {N} \\tau_ {i} \\left(1 - e ^ {- \\sigma_ {i} \\delta_ {i}}\\right) d _ {i}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.784, + 0.52 + ], + "angle": 0, + "content": "where \\(N\\) is the number of samples for each ray, and the camera determines the ray pose \\(\\mathbf{T}\\) and pixel location \\(\\mathbf{p}\\). \\(\\mathbf{c}_i\\) and \\(d_i\\) are the corresponding color and depth of each sample along a ray observed from the camera center. \\(\\delta\\) is the distance between consecutive samples. Color \\(\\mathbf{c}_i\\) and volume density \\(\\sigma_i\\) can be queried from MLP as in iMAP [47], hierarchical feature grid with small MLP [60], or multi-resolution hash grid [38]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.784, + 0.582 + ], + "angle": 0, + "content": "3DGS [25] also adopts the volume rendering formulation, so we can train the map differentiable to input image measurements. However, 3DGS processes sparse explicit samples from 3D Gaussian primitives, which are faster. We can render images by compositing \\(\\mathcal{N}\\) ordered 3D Gaussians as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.276, + 0.596, + 0.785, + 0.638 + ], + "angle": 0, + "content": "\\[\n\\mathbf {c} (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {\\mathcal {N}} \\mathbf {c} _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {j}), \\text {w h e r e} \\alpha = o e ^ {- (\\mathbf {x} - \\mu) ^ {T} \\Sigma^ {- 1} (\\mathbf {x} - \\mu) / 2}, \\tag {3}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.393, + 0.657, + 0.785, + 0.699 + ], + "angle": 0, + "content": "\\[\nd (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {\\mathcal {N}} d _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {j}), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.708, + 0.784, + 0.739 + ], + "angle": 0, + "content": "where \\(\\mathbf{c}\\), \\(o\\in [0,1]\\), \\(\\mu \\in \\mathbb{R}^3\\), and \\(\\Sigma\\) are the color, opacity, center position, and the covariance of a 3D Gaussian, respectively." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.766, + 0.473, + 0.781 + ], + "angle": 0, + "content": "3.2 Image Formation Process" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.784, + 0.84 + ], + "angle": 0, + "content": "When running a visual SLAM framework, we can augment additional mapping processes from HDR radiance to image measurements. We reconstruct an HDR radiance map by making \\( c(\\mathbf{T}, \\mathbf{p}) \\) in Sec. 3.1 to output linear HDR color. The" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.615, + 0.129 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.784, + 0.176 + ], + "angle": 0, + "content": "HDR pixel intensity \\( C_{\\mathrm{HDR}}^i (\\mathbf{p}) \\) captured during the exposure time \\( [t_s^i,t_e^i] \\) for the ith frame is" + }, + { + "type": "equation", + "bbox": [ + 0.399, + 0.177, + 0.786, + 0.214 + ], + "angle": 0, + "content": "\\[\nC _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p}) = \\int_ {t _ {s} ^ {i}} ^ {t _ {e} ^ {i}} \\mathbf {c} (\\mathbf {T} (t), \\mathbf {p}) d t, \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.221, + 0.784, + 0.267 + ], + "angle": 0, + "content": "where \\(\\mathbf{T}(t)\\) is the camera pose at time \\(t\\), \\(\\mathbf{c}(\\mathbf{T},\\mathbf{p})\\) is HDR color for camera pose \\(\\mathbf{T}\\) at pixel location \\(\\mathbf{p}\\) defined in Eqs. (1) and (3). Motion blur occurs if \\(\\mathbf{T}(t)\\) changes during exposure. We numerically approximate the integral with quadrature:" + }, + { + "type": "equation", + "bbox": [ + 0.271, + 0.28, + 0.786, + 0.322 + ], + "angle": 0, + "content": "\\[\nC _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p}) = \\varDelta t ^ {i} \\cdot \\frac {1}{N _ {\\mathrm {c a m}}} \\sum_ {j = 1} ^ {N _ {\\mathrm {c a m}}} \\mathbf {c} \\left(\\mathbf {T} \\left(t _ {s} ^ {i} + \\frac {j - 1}{N _ {\\mathrm {c a m}} - 1} (t _ {e} ^ {i} - t _ {s} ^ {i})\\right), \\mathbf {p}\\right), \\qquad (6)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.333, + 0.784, + 0.44 + ], + "angle": 0, + "content": "where \\( N_{\\mathrm{cam}} \\) is the number of virtual cameras to approximate the continuous integral with discrete summation and \\( \\Delta t^i = t_e^i - t_s^i \\) is exposure time. Throughout, we empirically set \\( N_{\\mathrm{cam}} = 5 \\) for experiments. If we assume that the camera velocity is constant during the short exposure time, the camera poses within time range \\( t \\in [t_s^i, t_e^i] \\) can be obtained by linearly interpolating between the start pose \\( \\mathbf{T}(t_s^i) \\) and the end pose \\( \\mathbf{T}(t_e^i) \\). We interpolate the camera pose at time \\( t \\), \\( \\mathbf{T}(t) \\), by decomposing it into rotation \\( \\mathbf{R}(t) \\) and translation \\( \\mathbf{t}(t) \\):" + }, + { + "type": "equation", + "bbox": [ + 0.232, + 0.453, + 0.786, + 0.487 + ], + "angle": 0, + "content": "\\[\n\\mathbf {R} (t) = \\operatorname {S l e r p} \\left(\\mathbf {R} \\left(t _ {s} ^ {i}\\right), \\mathbf {R} \\left(t _ {e} ^ {i}\\right), \\frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\\right), \\quad \\mathbf {t} (t) = \\operatorname {L e r p} \\left(\\mathbf {t} \\left(t _ {s} ^ {i}\\right), \\mathbf {t} \\left(t _ {e} ^ {i}\\right), \\frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\\right), \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.497, + 0.784, + 0.511 + ], + "angle": 0, + "content": "where Slerp stands for spherical linear interpolation, Lerp is linear interpolation." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.512, + 0.784, + 0.543 + ], + "angle": 0, + "content": "Then, the final observed color value of the pixel \\(\\mathbf{p}\\) is obtained by applying tone mapping operator \\(\\varPsi^i\\):" + }, + { + "type": "equation", + "bbox": [ + 0.41, + 0.556, + 0.785, + 0.573 + ], + "angle": 0, + "content": "\\[\nC _ {\\mathrm {L D R}} ^ {i} (\\mathbf {p}) = \\Psi^ {i} \\left(C _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p})\\right). \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.585, + 0.784, + 0.646 + ], + "angle": 0, + "content": "The tone mapping operator \\(\\varPsi^i\\) clips the HDR color to low dynamic range (LDR) and maps from linear color space to non-linear color space. Specifically, the tone mapping operation is composed of white balancing \\(\\mathrm{WB}^i\\) and camera response function \\(\\mathrm{CRF}^i\\) with dynamic range clipping:" + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.658, + 0.785, + 0.675 + ], + "angle": 0, + "content": "\\[\n\\varPsi^ {i} (\\Delta t ^ {i} \\cdot \\mathbf {c}) = \\operatorname {C R F} ^ {i} \\left(\\mathrm {W B} ^ {i} (\\Delta t ^ {i} \\cdot \\mathbf {c})\\right). \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.687, + 0.78, + 0.703 + ], + "angle": 0, + "content": "White balance function \\(\\mathrm{WB}^i\\) is an element-wise product to each color channel:" + }, + { + "type": "equation", + "bbox": [ + 0.357, + 0.715, + 0.785, + 0.737 + ], + "angle": 0, + "content": "\\[\n\\mathrm {W B} ^ {i} (\\mathbf {c}) = \\left[ w b _ {r} ^ {i} w b _ {g} ^ {i} w b _ {b} ^ {i} \\right] ^ {T} \\odot \\left[ c _ {r} c _ {g} c _ {b} \\right] ^ {T}. \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.749, + 0.784, + 0.841 + ], + "angle": 0, + "content": "We parameterize non-linear \\(\\mathrm{CRF}^i\\) with uniformly sampled 256-dimensional grid \\(g^i\\) between [0, 1] for each color channel. CRF should satisfy the two properties: (1) monotonically increasing function and (2) \\(\\mathrm{CRF}(0) = 0\\) and \\(\\mathrm{CRF}(1) = 1\\) [13]. We further adjust CRF to be physically plausible following [27]. We shift the derivatives by the smallest negative derivative and normalize CRF to satisfy the two properties. We employ differentiable grid sampling [19] to query our CRF" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "value. Instead of hard clipping the dynamic range between \\([0,1]\\), we use a leaky clipping function with CRF to backpropagate the gradient:" + }, + { + "type": "equation", + "bbox": [ + 0.349, + 0.186, + 0.786, + 0.243 + ], + "angle": 0, + "content": "\\[\n\\operatorname {C R F} _ {\\text {l e a k y}} (c) = \\left\\{ \\begin{array}{l l} \\alpha c & c < 0 \\\\ \\operatorname {C R F} (c) & 0 \\leq c \\leq 1, \\\\ - \\frac {\\alpha}{\\sqrt {c}} + \\alpha + 1 & 1 < c \\end{array} \\right. \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.249, + 0.788, + 0.371 + ], + "angle": 0, + "content": "where \\(\\alpha\\) is a constant parameter. Throughout, we set \\(\\alpha = 0.01\\) for experiments. To summarize, our image formation process can transform the HDR radiances in our map representation into LDR camera pixel values captured with continuous exposure. The learnable parameters are the HDR radiance map, start and end poses \\(\\mathbf{T}(t_s),\\mathbf{T}(t_e)\\), exposure time \\(\\Delta t\\), white balance parameters WB, and control points for CRF \\(g\\). Since all modules are fully differentiable, we can optimize the parameters with a simple gradient-based optimization method by minimizing the objective function with proper regularization, as described in Sec. 3.3." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.39, + 0.451, + 0.405 + ], + "angle": 0, + "content": "3.3 Tracking and Mapping" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.412, + 0.784, + 0.489 + ], + "angle": 0, + "content": "We optimize camera trajectories during exposure time and reconstruct a sharp HDR 3D map using the rendering loss defined by our image formation process. To optimize the camera trajectory during exposure time, we additionally propose a trajectory loss and a camera trajectory initialization method. Overall loss is sum of an image rendering loss, a depth rendering loss, and a trajectory loss:" + }, + { + "type": "equation", + "bbox": [ + 0.355, + 0.498, + 0.785, + 0.513 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\lambda_ {\\mathrm {i m g}} \\mathcal {L} _ {\\mathrm {i m g}} + \\lambda_ {\\mathrm {d e p t h}} \\mathcal {L} _ {\\mathrm {d e p t h}} + \\lambda_ {\\mathrm {t r a j}} \\mathcal {L} _ {\\mathrm {t r a j}}. \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.531, + 0.784, + 0.577 + ], + "angle": 0, + "content": "Image Rendering Loss We jointly optimize the in-camera parameters and the map representation within the SLAM's tracking and mapping pipeline by applying an image rendering loss function as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.585, + 0.785, + 0.625 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {i m g}} = \\sum_ {i = 1} ^ {N} \\sum_ {\\mathbf {p}} \\left| C _ {\\mathrm {L D R}} ^ {i} (\\mathbf {p}) - \\hat {C} ^ {i} (\\mathbf {p}) \\right|, \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.634, + 0.784, + 0.698 + ], + "angle": 0, + "content": "where \\( C_{\\mathrm{LDR}}^i (\\mathbf{p}) \\) is a rendered color output from our image formation process and \\( \\hat{C}^i (\\mathbf{p}) \\) is the observed color at pixel location \\( \\mathbf{p} \\) of frame \\( i \\). Even if the input images are degraded, the proposed rendering loss accounts for the physical degradation process and can reconstruct a sharp HDR radiance map." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.716, + 0.784, + 0.777 + ], + "angle": 0, + "content": "Depth Rendering Loss We constrain the depth camera pose to be aligned with the color camera's trajectory during exposure time. Specifically, we assign a pose with a minimum depth error as the depth camera pose and apply depth rendering loss for the selected pose as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.228, + 0.785, + 0.786, + 0.841 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {d e p t h}} = \\sum_ {i = 1} ^ {N} \\sum_ {\\mathbf {p}} | d (\\mathbf {T} \\left(t _ {\\mathrm {d}} ^ {i}\\right), \\mathbf {p}) - \\hat {d} ^ {i} (\\mathbf {p}) |, \\text {w h e r e} t _ {\\mathrm {d}} ^ {i} = \\underset {t \\in \\left[ t _ {s} ^ {i}, t _ {e} ^ {i} \\right]} {\\arg \\min } | d (\\mathbf {T} (t), \\mathbf {p}) - \\hat {d} ^ {i} (\\mathbf {p}) |, \\tag {14}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.114, + 0.615, + 0.129 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.239 + ], + "angle": 0, + "content": "where \\(d(\\mathbf{T}(t_{\\mathrm{d}}^{i}), \\mathbf{p})\\) is a rendered depth from the depth camera pose \\(\\mathbf{T}(t_{\\mathrm{d}}^{i})\\) and \\(\\hat{d}^i (\\mathbf{p})\\) is the ground-truth depth at pixel location \\(\\mathbf{p}\\) of frame \\(i\\). Note that the depth rendering loss affects the color camera's trajectory since the depth camera pose is interpolated from \\(\\mathbf{T}(t_s^i)\\) and \\(\\mathbf{T}(t_e^i)\\). Depth rendering loss ensures that at least one pose along the camera poses during the exposure time outputs accurate depth rendering." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.24, + 0.788, + 0.346 + ], + "angle": 0, + "content": "Unlike the integration process for color pixels, we optimize a single pose for a depth camera, assuming that the depth information is captured at a single moment within the time window. Although the depth camera measures some inaccurate depth values in fast-moving scenarios, most of the noises are filtered as invalid pixels by sensor manufacturers [41]. Depth sensors usually output invalid pixels on object boundaries and black objects, and most RGBD-SLAM methods ignore those regions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.369, + 0.788, + 0.535 + ], + "angle": 0, + "content": "Trajectory Regularization We propose a trajectory loss that regularizes the camera trajectory during the exposure time. We design the trajectory loss function with two insights. First, the camera poses during the exposure time should be aligned with the global trajectory. As SLAM progressively optimizes the camera poses, the global trajectory can be obtained from previous localization results without additional cost and it gives meaningful information to the temporal sensor movement. We estimate the global trajectory by connecting the pose of the midpoint during each exposure time in the previous frames. Second, the size of the motion blur kernel is determined by the temporal velocity and the exposure time. Namely, the longer the exposure time \\(\\Delta t^i\\) and the faster the temporal velocity, the further the distance between the start and end camera poses." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.536, + 0.788, + 0.596 + ], + "angle": 0, + "content": "Our trajectory loss regularizes the temporal camera trajectory during the exposure time to be aligned with the global trajectory and the length of it to be proportional to the exposure time and temporal velocity, assuming piecewise linear velocity:" + }, + { + "type": "equation", + "bbox": [ + 0.429, + 0.611, + 0.785, + 0.63 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {t r a j}} = \\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {t}} + \\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {R}}, \\tag {15}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.227, + 0.658, + 0.785, + 0.684 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {t}} = \\left\\| \\mathbf {t} \\left(t _ {e} ^ {i - 1}\\right) - \\operatorname {L e r p} \\left(\\mathbf {t} ^ {i - 1}, \\mathbf {t} ^ {i}, a \\Delta t ^ {i - 1}\\right) \\right\\| _ {2} ^ {2} + \\left\\| \\mathbf {t} \\left(t _ {s} ^ {i}\\right) - \\operatorname {L e r p} \\left(\\mathbf {t} ^ {i - 1}, \\mathbf {t} ^ {i}, 1 - a \\Delta t ^ {i}\\right) \\right\\| _ {2} ^ {2}, \\tag {16}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.218, + 0.712, + 0.787, + 0.75 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\operatorname {t r a j}} ^ {\\mathbf {R}} = \\left\\| \\mathbf {R} \\left(t _ {e} ^ {i - 1}\\right) - \\operatorname {S l e r p} \\left(\\mathbf {R} ^ {i - 1}, \\mathbf {R} ^ {i}, a \\Delta t ^ {i - 1}\\right) \\right\\| _ {2} ^ {2} + \\left\\| \\mathbf {R} \\left(t _ {s} ^ {i}\\right) - \\operatorname {S l e r p} \\left(\\mathbf {R} ^ {i - 1}, \\mathbf {R} ^ {i}, 1 - a \\Delta t ^ {i}\\right) \\right\\| _ {2} ^ {2}, \\tag {17}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "where \\(\\mathbf{t}\\) and \\(\\mathbf{R}\\) are the translation and rotation vector of camera pose \\(\\mathbf{T}\\), and \\(a\\) is an unknown global scale parameter that is related to the input frame rate. \\(\\mathbf{t}^i\\) and \\(\\mathbf{R}^i\\) are the center pose between the start and end pose of frame \\(i\\). The scale parameter \\(a\\) is also jointly optimized within the tracking process. We further describe the relation between our scale parameter \\(a\\) and the input frame rate in the supplementary material." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "We also propose an initialization strategy for robust optimization exploiting the global trajectory. With a constant velocity assumption, we initialize the \\(i + 1\\)th frame's camera poses \\(\\mathbf{T}(t_s^{i + 1})\\) and \\(\\mathbf{T}(t_e^{i + 1})\\) by extrapolating estimated camera poses of \\(i\\) and \\(i - 1\\)th frames. We initialize the start and end poses to be separated with a small predefined distance along the global trajectory." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.246, + 0.376, + 0.264 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.278, + 0.788, + 0.355 + ], + "angle": 0, + "content": "We demonstrate that \\( I^2 \\)-SLAM can reconstruct a sharp HDR radiance map from casually captured videos with various input modalities. We describe our experimental setup in challenging datasets in Sec. 4.1. We show that \\( I^2 \\)-SLAM enhances state-of-the-art dense visual SLAM methods in Sec. 4.2. We conduct ablation studies and runtime analyses in Sec. 4.3 and Sec. 4.4, respectively." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.377, + 0.429, + 0.394 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.402, + 0.788, + 0.553 + ], + "angle": 0, + "content": "Baselines \\( I^2 \\)-SLAM serves as a versatile module that can be attached to dense visual SLAM methods to improve its performance. We apply our approach to the state-of-the-art RGB-SLAM method, NeRF-SLAM [38], which employs NeRF as a map representation and uses DROID-SLAM [50] as a tracking backbone. We re-implemented NeRF-SLAM with torch-ngp [49] and notate as NeRF-SLAM†. NeRF-SLAM† uses same loss functions of NeRF-SLAM. We additionally test \\( I^2 \\)-SLAM with an RGBD-SLAM approach to tackle challenging sequences in ScanNet [11] where robust learning-based SLAM method, DROID-SLAM, often fails without using additional depth channel. We employ a 3DGS-based RGBD-SLAM method, SplaTAM [23], to test \\( I^2 \\)-SLAM in RGBD inputs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.788, + 0.69 + ], + "angle": 0, + "content": "Datasets Most of the existing synthetic datasets for SLAM evaluation assume the ideal capturing setup, and do not exhibit any camera motion blur or dynamic appearance changes. We therefore propose a new dataset incorporating these effects. The new dataset contains realistic image degradation by simulating motion blur and auto exposure. We render the images and depth information with Cycles path tracer [1]. Also, we test \\( I^2 \\)-SLAM on challenging real-world datasets. We use TUM-RGBD [46] and ScanNet [11] dataset for evaluating RGB and RGBD scenarios, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Evaluation We report the average values of three runs with different random seeds for all the quantitative evaluations except the ablation study and the runtime analysis. We measure PSNR, SSIM [53], and LPIPS [58] between rendered images from the reconstructed map and sharp ground-truth images which can be obtained from our synthetic dataset. Since there are no ground-truth sharp images in the real-world dataset, we evaluate the view synthesis performance only for the sharp frames that are manually annotated. Also, we run test-time optimization [26] to factor out pose errors in measuring the rendering quality of RGB-SLAMs. We report ATE RMSE [46] for tracking performance evaluation." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.114, + 0.615, + 0.129 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.787, + 0.188 + ], + "angle": 0, + "content": "Table 1: Rendering quality comparison against the RGB-SLAM baseline on TUM-RGBD [46] and synthetic dataset. \\( I^2 \\)-SLAM represents our RGB-SLAM model which is incorporated into our re-implementation of NeRF-SLAM [38], NeRF-SLAM†." + }, + { + "type": "table", + "bbox": [ + 0.235, + 0.199, + 0.77, + 0.326 + ], + "angle": 0, + "content": "
MethodsMetricsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1IF2
NeRF-SLAM†[38]PSNR25.9729.9724.7228.6425.4330.2026.0926.70
SSIM0.8250.9000.7270.8100.8320.8670.7890.842
LPIPS0.2220.0930.3660.3280.3230.3270.3020.270
Depth L110.9717.8330.9240.6855.8020.725.0219.76
I2-SLAMPSNR27.2332.0628.9128.9927.5932.3330.1628.89
SSIM0.8350.9160.8330.8270.8750.9020.8980.887
LPIPS0.1860.0740.1930.2840.2600.2860.2110.241
Depth L19.0417.9417.6020.3341.9220.483.5517.28
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.338, + 0.787, + 0.381 + ], + "angle": 0, + "content": "Table 2: Rendering quality comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. \\( I^2 \\)-SLAM in this table represents our RGBD-SLAM model which is incorporated into SplaTAM [23]." + }, + { + "type": "table", + "bbox": [ + 0.249, + 0.392, + 0.756, + 0.505 + ], + "angle": 0, + "content": "
MethodsMetricsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1IF2
SplaTAM [23]PSNR21.6024.6424.5019.6321.3819.7824.2222.3623.82
SSIM0.7860.7730.8470.7190.8200.7900.8550.7660.824
LPIPS0.2360.2750.1820.3400.2320.2460.2270.2810.230
I²-SLAMPSNR23.3926.8924.0726.4026.1821.9823.8823.7224.07
SSIM0.7800.7960.8280.7620.8420.7700.7980.7960.826
LPIPS0.1800.2360.1750.2380.1930.2310.2630.2330.205
" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.533, + 0.787, + 0.58 + ], + "angle": 0, + "content": "We use the center of camera poses \\(\\mathbf{T}(t_s^i)\\) and \\(\\mathbf{T}(t_e^i)\\) to evaluate our method and use scale-aligned ground-truth trajectory for RGB-SLAM to handle the scale ambiguity. Further details can be found in the supplementary material." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.603, + 0.442, + 0.618 + ], + "angle": 0, + "content": "4.2 Experimental Results" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.629, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Quantitative Results We report the quantitative results of map rendering performance for keyframes of RGB and RGBD datasets in Tabs. 1 and 2, respectively. We observe that \\( I^2 \\)-SLAM enhances the rendering quality of NeRF-SLAM† across all metrics on the both synthetic and real-world TUM-RGBD [46] datasets. \\( I^2 \\)-SLAM also substantially enhances the depth accuracy for RGB-SLAM. In the RGBD dataset scenario, \\( I^2 \\)-SLAM also shows superior rendering quality in most scenes when attached to SplaTAM [23]. Especially, \\( I^2 \\)-SLAM improves the view-synthesis performance of SplaTAM in a large margin in SP of synthetic dataset and 0785-00 of ScanNet [11] dataset, whose appearances are changing dynamically within the videos. It shows that our in-camera model is especially advantageous when combined with the models without view-dependent effects. Furthermore, we report the camera trajectory error of RGB-SLAM methods in Tab. 3. The results show that \\( I^2 \\)-SLAM substantially improves the tracking performance of NeRF-SLAM† even if NeRF-SLAM† takes accurate initial tra" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.174 + ], + "angle": 0, + "content": "Table 3: We evaluate the tracking performance of RGB-SLAM methods on TUMRGBD [46] and synthetic dataset in terms of ATE-RMSE (cm)." + }, + { + "type": "table", + "bbox": [ + 0.306, + 0.185, + 0.699, + 0.247 + ], + "angle": 0, + "content": "
MethodsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1
NeRF-SLAM†[38]2.080.417.133.973.203.381.14
I²-SLAM1.640.261.951.503.231.590.74
" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.27, + 0.785, + 0.298 + ], + "angle": 0, + "content": "Table 4: Tracking accuracy comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. ATE-RMSE (cm) is measured as an evaluation metric." + }, + { + "type": "table", + "bbox": [ + 0.307, + 0.311, + 0.699, + 0.374 + ], + "angle": 0, + "content": "
MethodsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1
SplaTAM [23]1.803.011.135.911.111.502.041.02
I²-SLAM1.413.251.004.590.861.551.961.05
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.412, + 0.785, + 0.488 + ], + "angle": 0, + "content": "jectory from DROID-SLAM as initial camera poses. It supports our claim that image formation process, when appropriately modeled, can enhance the tracking accuracy of inputs that are casually captured. In RGBD datasets, however, the trajectory accuracy improvement is subtle since the depth information mostly determines the camera poses as reported in Tab. 4." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.537, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Qualitative Results We demonstrate the rendered images of \\( I^2 \\)-SLAM with NeRF-SLAM† in Fig. 3. As shown in Fig. 3 (a), \\( I^2 \\)-SLAM successfully renders sharp images, whereas NeRF-SLAM† has blurry artifacts come from the degraded input, for example, bricks in Sponza, boundary of the tire in LOU, complex texture of books and thin legs of the chair in Italian-flat-0. More importantly, our approach also shows remarkable performance in reconstructing sharp maps from TUM-RGBD data which contains the real-world camera motion. The texts on the books and objects on the table are clearly rendered with \\( I^2 \\)-SLAM when we compare to the results of baseline and blurred input frames. In Fig. 4, we show samples of rendered images in RGBD scenario. We can observe the consistent improvement over SplaTAM in generating a sharp map in our synthetic dataset. The letters on the book cover and the bricks are clearly rendered with \\( I^2 \\)-SLAM. Also, we observe significant map quality enhancement in the ScanNet dataset. The letters on the board and tassels in 0024-01, the detection mark and objects on the table in 0736-00, and the pictures in 0785-00 are deblurred with our approach. Furthermore, since the color of Gaussians in SplaTAM is consistent regardless of the exposure of images, SplaTAM does not appropriately model the brightness changes as we can see in the darker color of bricks in Sponza and tiled artifacts in 0785-00. Such artifacts are removed by modeling the tone mapping process." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.615, + 0.129 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.145, + 0.756, + 0.375 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.439, + 0.379, + 0.566, + 0.391 + ], + "angle": 0, + "content": "(a) Synthetic Dataset" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.392, + 0.756, + 0.695 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.44, + 0.697, + 0.565, + 0.71 + ], + "angle": 0, + "content": "(b) TUM-RGBD [46]" + }, + { + "type": "image_caption", + "bbox": [ + 0.242, + 0.721, + 0.759, + 0.737 + ], + "angle": 0, + "content": "Fig. 3: Qualitative results on applying \\( I^2 \\)-SLAM to the RGB-SLAM method." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.767, + 0.389, + 0.783 + ], + "angle": 0, + "content": "4.3 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "We conduct an ablation study in ScanNet [11] dataset. Table 5 shows that each component plays a crucial role in improving tracking or mapping performance. In Tab. 5, Traj. Reg. refers to the trajectory regularization in Sec. 3.3. Motion" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.667, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.146, + 0.756, + 0.304 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.439, + 0.307, + 0.566, + 0.319 + ], + "angle": 0, + "content": "(a) Synthetic Dataset" + }, + { + "type": "image", + "bbox": [ + 0.244, + 0.321, + 0.753, + 0.622 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.453, + 0.627, + 0.551, + 0.64 + ], + "angle": 0, + "content": "(b) ScanNet [11]" + }, + { + "type": "image_caption", + "bbox": [ + 0.236, + 0.65, + 0.765, + 0.665 + ], + "angle": 0, + "content": "Fig. 4: Qualitative results on applying \\( I^2 \\)-SLAM to the RGBD-SLAM method." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.697, + 0.788, + 0.757 + ], + "angle": 0, + "content": "blur-aware rendering improves tracking performance by preventing the accumulation of tracking errors. HDR map shows improved rendering quality over LDR representations. Trajectory regularization affects multi-camera optimization, resulting in enhancements in both tracking and mapping." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.782, + 0.406, + 0.797 + ], + "angle": 0, + "content": "4.4 Runtime analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.789, + 0.84 + ], + "angle": 0, + "content": "We analyze how much our approach affects the runtime and performance with ScanNet 0024-01 in Tab. 6. \\( I^2 \\)-SLAM exhibits better ATE-RMSE and PSNR" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.114, + 0.615, + 0.128 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "table_caption", + "bbox": [ + 0.245, + 0.145, + 0.417, + 0.159 + ], + "angle": 0, + "content": "Table 5: Ablation study." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.172, + 0.749, + 0.247 + ], + "angle": 0, + "content": "
Traj. Reg.Tone MappingMotion BlurATEPSNRSSIMLPIPSMapping /FrameTracking /FrameATEPSNRSSIMLPIPS
✓✓✓2.5625.620.8010.195I²-SLAM2.058s8.494s1.4224.160.7860.211
X✓✓2.6624.800.7690.203I²-SLAM-S0.436s1.867s1.5023.920.7950.230
✓X✓2.6022.390.7560.226SplaTAM [23]0.424s1.433s1.8122.260.8000.224
XX✓2.6322.360.7550.228SplaTAM-S [23]0.086s0.377s2.4021.430.7770.243
XXX2.7123.050.7930.235
" + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.269, + 0.48, + 0.374 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.299, + 0.376, + 0.498, + 0.387 + ], + "angle": 0, + "content": "(a) ATE-RMSE over iteration time" + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.269, + 0.684, + 0.374 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.515, + 0.375, + 0.687, + 0.387 + ], + "angle": 0, + "content": "(b) PSNR over iteration time" + }, + { + "type": "image_caption", + "bbox": [ + 0.225, + 0.398, + 0.776, + 0.414 + ], + "angle": 0, + "content": "Fig. 5: Performance variations over iteration time of \\( I^2 \\)-SLAM and SplaTAM [23]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.439, + 0.784, + 0.499 + ], + "angle": 0, + "content": "metrics compared to SplaTAM [23], but it comes at the cost of slower speed. However, \\( I^2 \\)-SLAM-S, which uses \\( 20\\% \\) iterations, takes a similar runtime but yields better performance. In contrast, SplaTAM-S, which also uses \\( 20\\% \\) iterations, shows a significant decrease in performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.5, + 0.785, + 0.56 + ], + "angle": 0, + "content": "In Fig. 5, we analyze the trend of performance changes concerning the number of iterations. Four models with different numbers of iterations are compared. In most cases, our method demonstrates better tracking and rendering performance when using a similar runtime." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.581, + 0.359, + 0.597 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.609, + 0.785, + 0.699 + ], + "angle": 0, + "content": "We present \\( I^2 \\)-SLAM, a generic module that improves the quality of existing visual SLAM approaches by inverting the image formation process for casually captured videos. We show the effectiveness of our module by incorporating it into the state-of-the-art methods in RGB and RGBD-SLAM approaches. With \\( I^2 \\)-SLAM, existing visual SLAM pipelines can effectively handle the varying appearance and motion blur that are prevalent in-the-wild capturing scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.7, + 0.785, + 0.791 + ], + "angle": 0, + "content": "Although \\( I^2 \\)-SLAM is able to reconstruct sharp HDR maps while estimating the camera trajectory from casually captured videos, there are some limitations. The motion blur simulation with the sum of multiple cameras accompanies the longer rendering and optimization time. An efficient approximation method to simulate camera motion blur would be an interesting research direction to improve our approach." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Acknowledgements This work is supported by the National Research Foundation of Korea(NRF) grant (No. RS-2023-00218601) and IITP grant [NO.RS-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.788, + 0.178 + ], + "angle": 0, + "content": "2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] funded by the Korea government(MSIT)." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.2, + 0.323, + 0.216 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.232, + 0.787, + 0.259 + ], + "angle": 0, + "content": "1. Blender, O.C.: Blender - a 3D modelling and rendering package. Blender Foundation, Stichting Blender Foundation, Amsterdam (2018), http://www.blender.org" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.261, + 0.787, + 0.314 + ], + "angle": 0, + "content": "2. Bloesch, M., Czarnowski, J., Clark, R., Leutenegger, S., Davison, A.J.: Codeslam—learning a compact, optimisable representation for dense visual slam. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2560–2568 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.316, + 0.787, + 0.357 + ], + "angle": 0, + "content": "3. Bloesch, M., Laidlow, T., Clark, R., Leutenegger, S., Davison, A.J.: Learning meshes for dense visual slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5855-5864 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.358, + 0.787, + 0.397 + ], + "angle": 0, + "content": "4. Bylow, E., Sturm, J., Kerl, C., Kahl, F., Cremers, D.: Real-time camera tracking and 3d reconstruction using signed distance functions. In: Robotics: Science and Systems. vol. 2, p. 2 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.399, + 0.787, + 0.44 + ], + "angle": 0, + "content": "5. Chakrabarti, A.: A neural approach to blind motion deblurring. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 221-235. Springer (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.441, + 0.787, + 0.481 + ], + "angle": 0, + "content": "6. Chaplot, D.S., Gandhi, D., Gupta, S., Gupta, A., Salakhutdinov, R.: Learning to explore using active neural slam. In: International Conference on Learning Representations (ICLR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.482, + 0.787, + 0.522 + ], + "angle": 0, + "content": "7. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.523, + 0.787, + 0.55 + ], + "angle": 0, + "content": "8. Chen, T., Culbertson, P., Schwager, M.: Catnips: Collision avoidance through neural implicit probabilistic scenes. arXiv preprint arXiv:2302.12931 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.551, + 0.787, + 0.578 + ], + "angle": 0, + "content": "9. Cho, S., Lee, S.: Fast motion deblurring. In: ACM SIGGRAPH Asia 2009 papers, pp. 1-8 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.579, + 0.787, + 0.619 + ], + "angle": 0, + "content": "0. Covolan, J.P.M., Sementille, A.C., Sanches, S.R.R.: A mapping of visual slam algorithms and their applications in augmented reality. In: 2020 22nd Symposium on Virtual and Augmented Reality (SVR). pp. 20-29. IEEE (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.62, + 0.787, + 0.66 + ], + "angle": 0, + "content": "1. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: Scannet: Richly-annotated 3d reconstructions of indoor scenes. In: Proc. Computer Vision and Pattern Recognition (CVPR), IEEE (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.787, + 0.702 + ], + "angle": 0, + "content": "2. Dai, A., Nießner, M., Zollhöfer, M., Izadi, S., Theobalt, C.: Bundlefusion: Real-time globally consistent 3d reconstruction using on-the-fly surface reintegration. ACM Transactions on Graphics (ToG) 36(4), 1 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.703, + 0.787, + 0.757 + ], + "angle": 0, + "content": "3. Debevec, P.E., Malik, J.: Recovering high dynamic range radiance maps from photographs. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques. p. 369-378. SIGGRAPH '97, ACM Press/Addison-Wesley Publishing Co., USA (1997). https://doi.org/10.1145/258734.258884" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.787, + 0.799 + ], + "angle": 0, + "content": "4. Fergus, R., Singh, B., Hertzmann, A., Roweis, S.T., Freeman, W.T.: Removing camera shake from a single photograph. In: Acm Siggraph 2006 Papers, pp. 787-794 (2006)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.787, + 0.84 + ], + "angle": 0, + "content": "5. Gupta, S., Davidson, J., Levine, S., Sukthankar, R., Malik, J.: Cognitive mapping and planning for visual navigation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2616-2625 (2017)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.232, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.615, + 0.128 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.178, + 0.785, + 0.218 + ], + "angle": 0, + "content": "17. Huang, H., Li, L., Cheng, H., Yeung, S.K.: Photo-slam: Real-time simultaneous localization and photorealistic mapping for monocular, stereo, and rgb-d cameras. arXiv preprint arXiv:2311.16728 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.22, + 0.785, + 0.261 + ], + "angle": 0, + "content": "18. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: Hdr-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.262, + 0.785, + 0.33 + ], + "angle": 0, + "content": "19. Jaderberg, M., Simonyan, K., Zisserman, A., kavukcuoglu, k.: Spatial transformer networks. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 28. Curran Associates, Inc. (2015), https://proceedings.neurips.cc/paper_files/paper/2015/file/33ceb07bf4eeb3da587e268d663aba1a-Paper.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.332, + 0.785, + 0.374 + ], + "angle": 0, + "content": "20. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Maalouf, A., Li, S., Iyer, G., Saryazdi, S., Keetha, N., et al.: Conceptfusion: Open-set multimodal 3d mapping. arXiv preprint arXiv:2302.07241 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.375, + 0.785, + 0.416 + ], + "angle": 0, + "content": "21. Jinyu, L., Bangbang, Y., Danpeng, C., Nan, W., Guofeng, Z., Hujun, B.: Survey and evaluation of monocular visual-inertial slam algorithms for augmented reality. Virtual Reality & Intelligent Hardware 1(4), 386-410 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.417, + 0.785, + 0.459 + ], + "angle": 0, + "content": "22. Jun-Seong, K., Yu-Ji, K., Ye-Bin, M., Oh, T.H.: HDR-plenoxels: Self-calibrating high dynamic range radiance fields. In: European Conference on Computer Vision. pp. 384-401. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.46, + 0.785, + 0.5 + ], + "angle": 0, + "content": "23. Keetha, N., Karhade, J., Jatavallabhula, K.M., Yang, G., Scherer, S., Ramanan, D., Luiten, J.: Splatam: Splat, track & map 3d gaussians for dense rgb-d slam. arXiv preprint arXiv:2312.02126 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.785, + 0.543 + ], + "angle": 0, + "content": "24. Keller, M., Lefloch, D., Lambers, M., Izadi, S., Weyrich, T., Kolb, A.: Real-time 3d reconstruction in dynamic scenes using point-based fusion. In: 2013 International Conference on 3D Vision-3DV 2013. pp. 1-8. IEEE (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.545, + 0.785, + 0.572 + ], + "angle": 0, + "content": "25. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3d gaussian splatting for real-time radiance field rendering. ACM Transactions on Graphics 42(4) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.573, + 0.785, + 0.614 + ], + "angle": 0, + "content": "26. Lin, C.H., Ma, W.C., Torralba, A., Lucey, S.: Barf: Bundle-adjusting neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5741-5751 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.616, + 0.785, + 0.67 + ], + "angle": 0, + "content": "27. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.672, + 0.785, + 0.712 + ], + "angle": 0, + "content": "28. Ma, L., Li, X., Liao, J., Zhang, Q., Wang, X., Wang, J., Sander, P.V.: Deblur-nerf: Neural radiance fields from blurry images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12861-12870 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.714, + 0.785, + 0.742 + ], + "angle": 0, + "content": "29. Matsuki, H., Murai, R., Kelly, P.H., Davison, A.J.: Gaussian splatting slam. arXiv preprint arXiv:2312.06741 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.743, + 0.785, + 0.798 + ], + "angle": 0, + "content": "30. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "\\(I^2\\) -SLAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.245 + ], + "angle": 0, + "content": "33. Newcombe, R.A., Izadi, S., Hilliges, O., Molyneaux, D., Kim, D., Davison, A.J., Kohi, P., Shotton, J., Hodges, S., Fitzgibbon, A.: Kinectfusion: Real-time dense surface mapping and tracking. In: 2011 10th IEEE international symposium on mixed and augmented reality. pp. 127-136. IEEE (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "34. Newcombe, R.A., Lovegrove, S.J., Davison, A.J.: Dtam: Dense tracking and mapping in real-time. In: 2011 international conference on computer vision. pp. 2320-2327. IEEE (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.327 + ], + "angle": 0, + "content": "35. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.787, + 0.383 + ], + "angle": 0, + "content": "36. Oleynikova, H., Taylor, Z., Fehr, M., Siegwart, R., Nieto, J.: Voxblox: Incremental 3d euclidean signed distance fields for on-board mav planning. In: 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 1366-1373. IEEE (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.787, + 0.424 + ], + "angle": 0, + "content": "37. Ortiz, J., Clegg, A., Dong, J., Sucar, E., Novotny, D., Zollhoefer, M., Mukadam, M.: isdf: Real-time neural signed distance fields for robot perception. In: Robotics: Science and Systems (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.467 + ], + "angle": 0, + "content": "38. Rosinol, A., Leonard, J.J., Carlone, L.: Nerf-slam: Real-time dense monocular slam with neural radiance fields. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 3437-3444. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.468, + 0.787, + 0.495 + ], + "angle": 0, + "content": "39. Rückert, D., Franke, L., Stamminger, M.: Adop: Approximate differentiable one-pixel point rendering. ACM Transactions on Graphics (ToG) 41(4), 1-14 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.496, + 0.787, + 0.536 + ], + "angle": 0, + "content": "40. Sandström, E., Li, Y., Van Gool, L., Oswald, M.R.: Point-slam: Dense neural point cloud-based slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18433-18444 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.537, + 0.787, + 0.564 + ], + "angle": 0, + "content": "41. Sarbolandi, H., Lefloch, D., Kolb, A.: Kinect range sensing: Structured-light versus time-of-flight kinect. Computer vision and image understanding 139, 1-20 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.787, + 0.605 + ], + "angle": 0, + "content": "42. Schops, T., Sattler, T., Pollefeys, M.: Bad slam: Bundle adjusted direct rgb-d slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 134-144 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.787, + 0.646 + ], + "angle": 0, + "content": "43. Shafiullah, N.M.M., Paxton, C., Pinto, L., Chintala, S., Szlam, A.: Clipfields: Weakly supervised semantic fields for robotic memory. arXiv preprint arXiv:2210.05663 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.787, + 0.674 + ], + "angle": 0, + "content": "44. Shan, Q., Jia, J., Agarwala, A.: High-quality motion deblurring from a single image. Acm transactions on graphics (tog) 27(3), 1-10 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.787, + 0.715 + ], + "angle": 0, + "content": "45. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled feature fields enable few-shot language-guided manipulation. In: 7th Annual Conference on Robot Learning (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.787, + 0.757 + ], + "angle": 0, + "content": "46. Sturm, J., Engelhard, N., Endres, F., Burgard, W., Cremers, D.: A benchmark for the evaluation of rgb-d slam systems. In: 2012 IEEE/RSJ international conference on intelligent robots and systems. pp. 573-580. IEEE (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.758, + 0.787, + 0.799 + ], + "angle": 0, + "content": "47. Sucar, E., Liu, S., Ortiz, J., Davison, A.J.: imap: Implicit mapping and positioning in real-time. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6229-6238 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "48. Sun, J., Cao, W., Xu, Z., Ponce, J.: Learning a convolutional neural network for non-uniform motion blur removal. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 769-777 (2015)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.615, + 0.129 + ], + "angle": 0, + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "49. Tang, J.: Torch-ngp: a pytorch implementation of instant-ngp (2022), https://github.com/ashawkey/torch-ngp" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.217 + ], + "angle": 0, + "content": "50. Teed, Z., Deng, J.: Droid-slam: Deep visual slam for monocular, stereo, and rgbd cameras. Advances in neural information processing systems 34, 16558-16569 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.785, + 0.259 + ], + "angle": 0, + "content": "51. Wang, H., Wang, J., Agapito, L.: Co-slam: Joint coordinate and sparse parametric encodings for neural real-time slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13293-13302 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.26, + 0.785, + 0.3 + ], + "angle": 0, + "content": "52. Wang, P., Zhao, L., Ma, R., Liu, P.: Bad-nerf: Bundle adjusted deblur neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4170-4179 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.301, + 0.785, + 0.341 + ], + "angle": 0, + "content": "53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.343, + 0.785, + 0.37 + ], + "angle": 0, + "content": "54. Whelan, T., Leutenegger, S., Salas-Moreno, R., Glocker, B., Davison, A.: Elastic-fusion: Dense slam without a pose graph. Robotics: Science and Systems (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.371, + 0.785, + 0.411 + ], + "angle": 0, + "content": "55. Whelan, T., Salas-Moreno, R.F., Glocker, B., Davison, A.J., Leutenegger, S.: Elastic fusion: Real-time dense slam and light source estimation. The International Journal of Robotics Research 35(14), 1697-1716 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.412, + 0.785, + 0.439 + ], + "angle": 0, + "content": "56. Whyte, O., Sivic, J., Zisserman, A., Ponce, J.: Non-uniform deblurring for shaken images. International journal of computer vision 98, 168-186 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.44, + 0.785, + 0.467 + ], + "angle": 0, + "content": "57. Yugay, V., Li, Y., Gevers, T., Oswald, M.R.: Gaussian-slam: Photo-realistic dense slam with gaussian splatting. arXiv preprint arXiv:2312.10070 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.468, + 0.785, + 0.508 + ], + "angle": 0, + "content": "58. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.509, + 0.785, + 0.55 + ], + "angle": 0, + "content": "59. Zhang, X., Matzen, K., Nguyen, V., Yao, D., Zhang, Y., Ng, R.: Synthetic defocus and look-ahead autofocus for casual videography. arXiv preprint arXiv:1905.06326 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.55, + 0.785, + 0.605 + ], + "angle": 0, + "content": "60. Zhu, Z., Peng, S., Larsson, V., Xu, W., Bao, H., Cui, Z., Oswald, M.R., Pollefeys, M.: Nice-slam: Neural implicit scalable encoding for slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12786-12796 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.605 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_origin.pdf b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..85b2bf7f37480f5d7c24db54324908a336be7b86 --- /dev/null +++ b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/b2779833-7a9a-492a-ba68-90708cc5b686_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9eaa198ae0f6baa9ad85b70d440ff258c74ae9daf13b75102d586624eb6bd6a2 +size 21087623 diff --git a/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/full.md b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/full.md new file mode 100644 index 0000000000000000000000000000000000000000..6853b5a0fa2a19e867897d5e58796c4ab0b612aa --- /dev/null +++ b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/full.md @@ -0,0 +1,341 @@ +# $I^2$ -SLAM: Inverting Imaging Process for Robust Photorealistic Dense SLAM + +Gwangtak Bae\*1, Changwoon Choi\*1, Hyeongjun Heo\*1, Sang Min Kim\*1, and Young Min Kim\*1,2 + +$^{1}$ Dept. of Electrical and Computer Engineering, Seoul National University $^{2}$ INMC & IPAI, Seoul National University + +![](images/b86726052bc4edb56ecae590dacd25bc63ad03680b6d669c2e17e9b331d25878.jpg) +Casually Captured Input + +![](images/fc80d579f3cf3e48e24590bb1c84c2f886acdbf2c290f9651c8abd84a6b02338.jpg) +Camera Tracking & Mapping + +![](images/fb531498bd18a9983a925238f912406f66bbcf2f77f92884820d5c1505ffadcc.jpg) +Varying Appearances +Sharp Reconstruction +Sharp HDR Radiance Field +Fig. 1: We propose $I^2$ -SLAM, a SLAM pipeline with a physical image formation process. We can reconstruct photorealistic and sharp HDR maps from casually captured videos which contain severe motion blur and varying appearances. + +![](images/dae799068a784aafcc70c8ad6cc79dbf59450c79b3af09f6fa76a14544cf744e.jpg) +Blurry Input + +![](images/63a30bc451f703cb461c4c671d2830b1055ed4e87cdf1efb5f411ece338201aa.jpg) + +Abstract. We present an inverse image-formation module that can enhance the robustness of existing visual SLAM pipelines for casually captured scenarios. Casual video captures often suffer from motion blur and varying appearances, which degrade the final quality of coherent 3D visual representation. We propose integrating the physical imaging into the SLAM system, which employs linear HDR radiance maps to collect measurements. Specifically, individual frames aggregate images of multiple poses along the camera trajectory to explain prevalent motion blur in hand-held videos. Additionally, we accommodate per-frame appearance variation by dedicating explicit variables for image formation steps, namely white balance, exposure time, and camera response function. Through joint optimization of additional variables, the SLAM pipeline produces high-quality images with more accurate trajectories. Extensive experiments demonstrate that our approach can be incorporated into recent visual SLAM pipelines using various scene representations, such as neural radiance fields or Gaussian splatting. Project website + +Keywords: SLAM $\cdot$ photorealistic 3D reconstruction $\cdot$ motion deblurring $\cdot$ HDR reconstruction + +# 1 Introduction + +Simultaneous localization and mapping (SLAM) builds a map of the environment during deployment, which can be utilized in various applications, including VR/AR [10, 21], robotic navigation [6, 15, 36], and collision handling [8]. Traditional 3D SLAM approaches typically use geometric representations like points/surfels [24, 42, 50, 54, 55], mesh [3], voxel grids [4, 33], or voxel hashing [12, 35]. Recent visual SLAM approaches additionally capture visual appearances incorporating advances in Neural Radiance Fields (NeRF) [31] and its variants [25, 32]. They can synthesize photorealistic images of the environment and open up new possibilities in complex downstream tasks such as detailed semantic scene understanding [20], language-guided manipulation [45], or visual navigation [43]. Additionally, neural representations can fill unseen regions with smooth geometric estimation and require low-memory footprint [37, 47, 51]. 3D visual representations can achieve real-time performance using voxelized hash grid [32] or 3D Gaussian Splatting (3DGS) [25]. + +Despite many works that build visual representations using the SLAM framework, most do not maintain their performance in real-world scenarios. Casually captured videos, the standard input for visual SLAM systems, suffer from two prevalent challenges: 1) motion blur due to camera movement and 2) varying appearances resulting from auto exposure and white balancing adjustments as demonstrated in Fig. 1. The degradation in images serves as a critical bottleneck for the accuracy of the map and the pose estimation, and the error accumulates due to the incremental nature of SLAM, significantly reducing the overall quality. + +This work tackles the prevailing challenges by attaching the physical image formation process that directly models the aforementioned variations. Then, we can directly optimize for the correct camera poses and raw measurements via an analysis-by-synthesis approach. Specifically, the motion-blurred image is compared against observations integrated along the estimated camera trajectories during a window of exposure time instead of an image from a single camera pose. Our pipeline approximates the camera poses as a linear movement and optimizes the start and end poses. The global trajectory estimated in the SLAM pipeline guides the initial blur movement with in-camera parameters, such as exposure time. At the same time, we match the per-frame appearance variation against simulated images and jointly optimize a differentiable tone mapper composed of exposure time, white balance function, and camera response function (CRF). We employ high dynamic range (HDR) radiance fields as a map representation to linearize the color space, which reflects the actual light intensity maps. The HDR maps simplify modeling appearance variations and produce significantly more realistic motion blur effects [13]. + +As our formulation, coined $I^2$ -SLAM, inverts the actual measurement steps, the module can augment any dense visual SLAM pipelines that use image inputs, including implicit neural networks and 3D Gaussians. Our extensive experiments demonstrate that it can robustly reconstruct sharp HDR maps from RGB/RGBD streams afflicted with severe motion blur and varying appearances. + +Our technical contributions can be summarized as follows: + +- We present $I^2$ -SLAM, integrating the image formation process into the visual SLAM approaches to overcome dominant challenges in real-world captures. +- Incorporating 3D maps composed of linear radiance values, our formulation jointly optimizes the approximate movement for the motion blur and tonemapbing functions for appearance variations during the SLAM framework. +- We propose an initialization and regularization method to stabilize the blur movement optimization to align with the estimated global camera trajectory, utilizing the SLAM setup. +- We enhance the robustness and performance of recent visual SLAM approaches in the real-world and our synthetic dataset, which contains severe motion blur and varying appearance. + +# 2 Related Works + +Dense Visual SLAM Visual SLAM methods use images as input and first started using multi-view geometry between sparse image features to estimate camera trajectories. DTAM [34] further demonstrated building a projective photometric cost volume, a dense map representation that unlocks the opportunity for combining various image-based applications. As deep neural networks prosper in computer vision, parts of the visual SLAM pipeline have also been successfully deployed to use latent representations [2] or assist the depth estimation [50]. + +Subsequent advancements in neural visual SLAM benefit from the technical innovations in neural implicit representation or improved novel representations. iMAP [47] employed implicit neural map representation for SLAM. NICE-SLAM [60] demonstrates that the multi-resolution feature grid representation can improve the speed and resolve the forgetting problem in large-scale scenes. Co-SLAM [51] explores the coordinate and parametric encodings to achieve efficient and accurate mapping. NeRF-SLAM [38] eliminates the dependency on depth by utilizing DROID-SLAM [50]. Recent results favor explicit representations when high speed and photometric quality are desired. Point-SLAM [40] creates photorealistic 3D maps using a dynamic neural point cloud. Since the introduction of 3D Gaussian Splatting [25], several concurrent works rapidly deploy them for 3D map representation for SLAM [17,23,29,57]. + +Motion Deblurring Motion blur significantly affects the quality of many computer vision tasks and has long been investigated as an active research topic. Traditional approaches assume a convolution kernel for the motion blur and convert the operation via deconvolution [9, 14, 44, 56]. The convolution operation naturally transfers to convolutional neural networks (CNN), and more recent works estimate the non-uniform motion blur field [48], complex Fourier coefficients [5], or dense motion flow [7]. Recent neural representations [31, 32] also suffer from performance degradation when handling blurred input images. Various works account for the blur operation and reconstruct a sharp 3D map even when input images are blurred [28, 52]. + +![](images/48c87bfaa6160e155e8e3a1ef2ae0e279a65615b6f0521b65273ddbaef2c1bf7.jpg) +Fig. 2: Method overview. (a) We reconstruct a sharp HDR radiance field map. (b) Motion blur is simulated by integration of sharp images, which are obtained from virtual camera poses during the exposure time. Then we obtain the blurry LDR image by applying differentiable tone mapping module. (c) SLAM methods simultaneously perform tracking and mapping from degraded images to reconstruct a sharp HDR map. + +The input measurements for the visual SLAM are susceptible to motion blur, as a moving camera captures an image for a duration of time. We linearize the camera trajectory during the exposure time and optimize the poses to match the blurred input, similar to [52]. However, we further exploit the SLAM setup and regularize the blur movement to be aligned with the estimated camera trajectory. + +High Dynamic Range Recovery Another critical issue for high-quality visual SLAM is that the pixel values are inconsistent with different exposures in input frames. Classical works on HDR imaging demonstrate that a color space of an HDR radiance map can successfully combine multiple images of different exposures [13]. HDR radiances are linear to the scene radiance values and lead to better results in image processing and image-based modeling [7, 16, 59]. Our map representation also models the actual HDR radiance values, and we provide explicit variables to model the physical process to map the pixel values, namely the exposure time, white balance, and camera response function per frame. Recent works on novel-view synthesis and 3D reconstruction also achieve improved results as they optimize the HDR radiances with exposure times [18, 22, 30, 39]. Our work integrates factors such as exposure time into a coherent formulation for tone mapping and motion blur and stabilizes the overall optimization. + +# 3 Method + +$I^2$ -SLAM is a generic method that can be combined with any existing photorealistic dense SLAM methods. In Sec. 3.1, we first review the rendering techniques for two representative map representations used in our experiments: Neural Radiance Fields (NeRF) [30] and 3D Gaussian Splatting (3DGS) [25]. Then we describe our physical image formation process to render motion-blurred and appearance-varying images in Sec. 3.2. Finally, we explain how to integrate our image formation process into existing SLAM pipelines in Sec. 3.3. + +# 3.1 Preliminaries: Rendering for Photorealistic Dense SLAM + +Our approach seamlessly integrates with various methods for generating color c and, optionally, depth $d$ for each pixel for a given camera pose. Owing to their photorealistic quality and ease of training, most recent visual SLAM approaches are based on variations stemming from either NeRF [31] or 3DGS [25]. This section reviews the general formulations of the two approaches, elucidating the process of generating color and depth information. + +Let $\mathbf{c}(\mathbf{T},\mathbf{p})$ and $d(\mathbf{T},\mathbf{p})$ denote the color and depth at pixel location $\mathbf{p}$ with camera pose $\mathbf{T}$ . For NeRF, we can obtain the color and depth of target pixels by marching rays and utilizing the volume rendering technique: + +$$ +\mathbf {c} (\mathbf {T}, \mathbf {p}) = \sum_ {i = 1} ^ {N} \tau_ {i} \left(1 - e ^ {- \sigma_ {i} \delta_ {i}}\right) \mathbf {c} _ {i} \quad \text {w h e r e} \tau_ {i} = e ^ {- \sum_ {j = 1} ^ {i - 1} \sigma_ {j} \delta_ {j}}, \tag {1} +$$ + +$$ +d (\mathbf {T}, \mathbf {p}) = \sum_ {i = 1} ^ {N} \tau_ {i} \left(1 - e ^ {- \sigma_ {i} \delta_ {i}}\right) d _ {i}, \tag {2} +$$ + +where $N$ is the number of samples for each ray, and the camera determines the ray pose $\mathbf{T}$ and pixel location $\mathbf{p}$ . $\mathbf{c}_i$ and $d_i$ are the corresponding color and depth of each sample along a ray observed from the camera center. $\delta$ is the distance between consecutive samples. Color $\mathbf{c}_i$ and volume density $\sigma_i$ can be queried from MLP as in iMAP [47], hierarchical feature grid with small MLP [60], or multi-resolution hash grid [38]. + +3DGS [25] also adopts the volume rendering formulation, so we can train the map differentiable to input image measurements. However, 3DGS processes sparse explicit samples from 3D Gaussian primitives, which are faster. We can render images by compositing $\mathcal{N}$ ordered 3D Gaussians as follows: + +$$ +\mathbf {c} (\mathbf {T}, \mathbf {p}) = \sum_ {i = 1} ^ {\mathcal {N}} \mathbf {c} _ {i} \alpha_ {i} \prod_ {j = 1} ^ {i - 1} (1 - \alpha_ {j}), \text {w h e r e} \alpha = o e ^ {- (\mathbf {x} - \mu) ^ {T} \Sigma^ {- 1} (\mathbf {x} - \mu) / 2}, \tag {3} +$$ + +$$ +d (\mathbf {T}, \mathbf {p}) = \sum_ {i = 1} ^ {\mathcal {N}} d _ {i} \alpha_ {i} \prod_ {j = 1} ^ {i - 1} (1 - \alpha_ {j}), \tag {4} +$$ + +where $\mathbf{c}$ , $o\in [0,1]$ , $\mu \in \mathbb{R}^3$ , and $\Sigma$ are the color, opacity, center position, and the covariance of a 3D Gaussian, respectively. + +# 3.2 Image Formation Process + +When running a visual SLAM framework, we can augment additional mapping processes from HDR radiance to image measurements. We reconstruct an HDR radiance map by making $c(\mathbf{T}, \mathbf{p})$ in Sec. 3.1 to output linear HDR color. The + +HDR pixel intensity $C_{\mathrm{HDR}}^i (\mathbf{p})$ captured during the exposure time $[t_s^i,t_e^i]$ for the ith frame is + +$$ +C _ {\mathrm {H D R}} ^ {i} (\mathbf {p}) = \int_ {t _ {s} ^ {i}} ^ {t _ {e} ^ {i}} \mathbf {c} (\mathbf {T} (t), \mathbf {p}) d t, \tag {5} +$$ + +where $\mathbf{T}(t)$ is the camera pose at time $t$ , $\mathbf{c}(\mathbf{T},\mathbf{p})$ is HDR color for camera pose $\mathbf{T}$ at pixel location $\mathbf{p}$ defined in Eqs. (1) and (3). Motion blur occurs if $\mathbf{T}(t)$ changes during exposure. We numerically approximate the integral with quadrature: + +$$ +C _ {\mathrm {H D R}} ^ {i} (\mathbf {p}) = \varDelta t ^ {i} \cdot \frac {1}{N _ {\mathrm {c a m}}} \sum_ {j = 1} ^ {N _ {\mathrm {c a m}}} \mathbf {c} \left(\mathbf {T} \left(t _ {s} ^ {i} + \frac {j - 1}{N _ {\mathrm {c a m}} - 1} (t _ {e} ^ {i} - t _ {s} ^ {i})\right), \mathbf {p}\right), \qquad (6) +$$ + +where $N_{\mathrm{cam}}$ is the number of virtual cameras to approximate the continuous integral with discrete summation and $\Delta t^i = t_e^i - t_s^i$ is exposure time. Throughout, we empirically set $N_{\mathrm{cam}} = 5$ for experiments. If we assume that the camera velocity is constant during the short exposure time, the camera poses within time range $t \in [t_s^i, t_e^i]$ can be obtained by linearly interpolating between the start pose $\mathbf{T}(t_s^i)$ and the end pose $\mathbf{T}(t_e^i)$ . We interpolate the camera pose at time $t$ , $\mathbf{T}(t)$ , by decomposing it into rotation $\mathbf{R}(t)$ and translation $\mathbf{t}(t)$ : + +$$ +\mathbf {R} (t) = \operatorname {S l e r p} \left(\mathbf {R} \left(t _ {s} ^ {i}\right), \mathbf {R} \left(t _ {e} ^ {i}\right), \frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\right), \quad \mathbf {t} (t) = \operatorname {L e r p} \left(\mathbf {t} \left(t _ {s} ^ {i}\right), \mathbf {t} \left(t _ {e} ^ {i}\right), \frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\right), \tag {7} +$$ + +where Slerp stands for spherical linear interpolation, Lerp is linear interpolation. + +Then, the final observed color value of the pixel $\mathbf{p}$ is obtained by applying tone mapping operator $\varPsi^i$ : + +$$ +C _ {\mathrm {L D R}} ^ {i} (\mathbf {p}) = \Psi^ {i} \left(C _ {\mathrm {H D R}} ^ {i} (\mathbf {p})\right). \tag {8} +$$ + +The tone mapping operator $\varPsi^i$ clips the HDR color to low dynamic range (LDR) and maps from linear color space to non-linear color space. Specifically, the tone mapping operation is composed of white balancing $\mathrm{WB}^i$ and camera response function $\mathrm{CRF}^i$ with dynamic range clipping: + +$$ +\varPsi^ {i} (\Delta t ^ {i} \cdot \mathbf {c}) = \operatorname {C R F} ^ {i} \left(\mathrm {W B} ^ {i} (\Delta t ^ {i} \cdot \mathbf {c})\right). \tag {9} +$$ + +White balance function $\mathrm{WB}^i$ is an element-wise product to each color channel: + +$$ +\mathrm {W B} ^ {i} (\mathbf {c}) = \left[ w b _ {r} ^ {i} w b _ {g} ^ {i} w b _ {b} ^ {i} \right] ^ {T} \odot \left[ c _ {r} c _ {g} c _ {b} \right] ^ {T}. \tag {10} +$$ + +We parameterize non-linear $\mathrm{CRF}^i$ with uniformly sampled 256-dimensional grid $g^i$ between [0, 1] for each color channel. CRF should satisfy the two properties: (1) monotonically increasing function and (2) $\mathrm{CRF}(0) = 0$ and $\mathrm{CRF}(1) = 1$ [13]. We further adjust CRF to be physically plausible following [27]. We shift the derivatives by the smallest negative derivative and normalize CRF to satisfy the two properties. We employ differentiable grid sampling [19] to query our CRF + +value. Instead of hard clipping the dynamic range between $[0,1]$ , we use a leaky clipping function with CRF to backpropagate the gradient: + +$$ +\operatorname {C R F} _ {\text {l e a k y}} (c) = \left\{ \begin{array}{l l} \alpha c & c < 0 \\ \operatorname {C R F} (c) & 0 \leq c \leq 1, \\ - \frac {\alpha}{\sqrt {c}} + \alpha + 1 & 1 < c \end{array} \right. \tag {11} +$$ + +where $\alpha$ is a constant parameter. Throughout, we set $\alpha = 0.01$ for experiments. To summarize, our image formation process can transform the HDR radiances in our map representation into LDR camera pixel values captured with continuous exposure. The learnable parameters are the HDR radiance map, start and end poses $\mathbf{T}(t_s),\mathbf{T}(t_e)$ , exposure time $\Delta t$ , white balance parameters WB, and control points for CRF $g$ . Since all modules are fully differentiable, we can optimize the parameters with a simple gradient-based optimization method by minimizing the objective function with proper regularization, as described in Sec. 3.3. + +# 3.3 Tracking and Mapping + +We optimize camera trajectories during exposure time and reconstruct a sharp HDR 3D map using the rendering loss defined by our image formation process. To optimize the camera trajectory during exposure time, we additionally propose a trajectory loss and a camera trajectory initialization method. Overall loss is sum of an image rendering loss, a depth rendering loss, and a trajectory loss: + +$$ +\mathcal {L} = \lambda_ {\mathrm {i m g}} \mathcal {L} _ {\mathrm {i m g}} + \lambda_ {\mathrm {d e p t h}} \mathcal {L} _ {\mathrm {d e p t h}} + \lambda_ {\mathrm {t r a j}} \mathcal {L} _ {\mathrm {t r a j}}. \tag {12} +$$ + +Image Rendering Loss We jointly optimize the in-camera parameters and the map representation within the SLAM's tracking and mapping pipeline by applying an image rendering loss function as follows: + +$$ +\mathcal {L} _ {\mathrm {i m g}} = \sum_ {i = 1} ^ {N} \sum_ {\mathbf {p}} \left| C _ {\mathrm {L D R}} ^ {i} (\mathbf {p}) - \hat {C} ^ {i} (\mathbf {p}) \right|, \tag {13} +$$ + +where $C_{\mathrm{LDR}}^i (\mathbf{p})$ is a rendered color output from our image formation process and $\hat{C}^i (\mathbf{p})$ is the observed color at pixel location $\mathbf{p}$ of frame $i$ . Even if the input images are degraded, the proposed rendering loss accounts for the physical degradation process and can reconstruct a sharp HDR radiance map. + +Depth Rendering Loss We constrain the depth camera pose to be aligned with the color camera's trajectory during exposure time. Specifically, we assign a pose with a minimum depth error as the depth camera pose and apply depth rendering loss for the selected pose as follows: + +$$ +\mathcal {L} _ {\text {d e p t h}} = \sum_ {i = 1} ^ {N} \sum_ {\mathbf {p}} | d (\mathbf {T} \left(t _ {\mathrm {d}} ^ {i}\right), \mathbf {p}) - \hat {d} ^ {i} (\mathbf {p}) |, \text {w h e r e} t _ {\mathrm {d}} ^ {i} = \underset {t \in \left[ t _ {s} ^ {i}, t _ {e} ^ {i} \right]} {\arg \min } | d (\mathbf {T} (t), \mathbf {p}) - \hat {d} ^ {i} (\mathbf {p}) |, \tag {14} +$$ + +where $d(\mathbf{T}(t_{\mathrm{d}}^{i}), \mathbf{p})$ is a rendered depth from the depth camera pose $\mathbf{T}(t_{\mathrm{d}}^{i})$ and $\hat{d}^i (\mathbf{p})$ is the ground-truth depth at pixel location $\mathbf{p}$ of frame $i$ . Note that the depth rendering loss affects the color camera's trajectory since the depth camera pose is interpolated from $\mathbf{T}(t_s^i)$ and $\mathbf{T}(t_e^i)$ . Depth rendering loss ensures that at least one pose along the camera poses during the exposure time outputs accurate depth rendering. + +Unlike the integration process for color pixels, we optimize a single pose for a depth camera, assuming that the depth information is captured at a single moment within the time window. Although the depth camera measures some inaccurate depth values in fast-moving scenarios, most of the noises are filtered as invalid pixels by sensor manufacturers [41]. Depth sensors usually output invalid pixels on object boundaries and black objects, and most RGBD-SLAM methods ignore those regions. + +Trajectory Regularization We propose a trajectory loss that regularizes the camera trajectory during the exposure time. We design the trajectory loss function with two insights. First, the camera poses during the exposure time should be aligned with the global trajectory. As SLAM progressively optimizes the camera poses, the global trajectory can be obtained from previous localization results without additional cost and it gives meaningful information to the temporal sensor movement. We estimate the global trajectory by connecting the pose of the midpoint during each exposure time in the previous frames. Second, the size of the motion blur kernel is determined by the temporal velocity and the exposure time. Namely, the longer the exposure time $\Delta t^i$ and the faster the temporal velocity, the further the distance between the start and end camera poses. + +Our trajectory loss regularizes the temporal camera trajectory during the exposure time to be aligned with the global trajectory and the length of it to be proportional to the exposure time and temporal velocity, assuming piecewise linear velocity: + +$$ +\mathcal {L} _ {\mathrm {t r a j}} = \mathcal {L} _ {\mathrm {t r a j}} ^ {\mathbf {t}} + \mathcal {L} _ {\mathrm {t r a j}} ^ {\mathbf {R}}, \tag {15} +$$ + +$$ +\mathcal {L} _ {\mathrm {t r a j}} ^ {\mathbf {t}} = \left\| \mathbf {t} \left(t _ {e} ^ {i - 1}\right) - \operatorname {L e r p} \left(\mathbf {t} ^ {i - 1}, \mathbf {t} ^ {i}, a \Delta t ^ {i - 1}\right) \right\| _ {2} ^ {2} + \left\| \mathbf {t} \left(t _ {s} ^ {i}\right) - \operatorname {L e r p} \left(\mathbf {t} ^ {i - 1}, \mathbf {t} ^ {i}, 1 - a \Delta t ^ {i}\right) \right\| _ {2} ^ {2}, \tag {16} +$$ + +$$ +\mathcal {L} _ {\operatorname {t r a j}} ^ {\mathbf {R}} = \left\| \mathbf {R} \left(t _ {e} ^ {i - 1}\right) - \operatorname {S l e r p} \left(\mathbf {R} ^ {i - 1}, \mathbf {R} ^ {i}, a \Delta t ^ {i - 1}\right) \right\| _ {2} ^ {2} + \left\| \mathbf {R} \left(t _ {s} ^ {i}\right) - \operatorname {S l e r p} \left(\mathbf {R} ^ {i - 1}, \mathbf {R} ^ {i}, 1 - a \Delta t ^ {i}\right) \right\| _ {2} ^ {2}, \tag {17} +$$ + +where $\mathbf{t}$ and $\mathbf{R}$ are the translation and rotation vector of camera pose $\mathbf{T}$ , and $a$ is an unknown global scale parameter that is related to the input frame rate. $\mathbf{t}^i$ and $\mathbf{R}^i$ are the center pose between the start and end pose of frame $i$ . The scale parameter $a$ is also jointly optimized within the tracking process. We further describe the relation between our scale parameter $a$ and the input frame rate in the supplementary material. + +We also propose an initialization strategy for robust optimization exploiting the global trajectory. With a constant velocity assumption, we initialize the $i + 1$ th frame's camera poses $\mathbf{T}(t_s^{i + 1})$ and $\mathbf{T}(t_e^{i + 1})$ by extrapolating estimated camera poses of $i$ and $i - 1$ th frames. We initialize the start and end poses to be separated with a small predefined distance along the global trajectory. + +# 4 Experiments + +We demonstrate that $I^2$ -SLAM can reconstruct a sharp HDR radiance map from casually captured videos with various input modalities. We describe our experimental setup in challenging datasets in Sec. 4.1. We show that $I^2$ -SLAM enhances state-of-the-art dense visual SLAM methods in Sec. 4.2. We conduct ablation studies and runtime analyses in Sec. 4.3 and Sec. 4.4, respectively. + +# 4.1 Experimental Setup + +Baselines $I^2$ -SLAM serves as a versatile module that can be attached to dense visual SLAM methods to improve its performance. We apply our approach to the state-of-the-art RGB-SLAM method, NeRF-SLAM [38], which employs NeRF as a map representation and uses DROID-SLAM [50] as a tracking backbone. We re-implemented NeRF-SLAM with torch-ngp [49] and notate as NeRF-SLAM†. NeRF-SLAM† uses same loss functions of NeRF-SLAM. We additionally test $I^2$ -SLAM with an RGBD-SLAM approach to tackle challenging sequences in ScanNet [11] where robust learning-based SLAM method, DROID-SLAM, often fails without using additional depth channel. We employ a 3DGS-based RGBD-SLAM method, SplaTAM [23], to test $I^2$ -SLAM in RGBD inputs. + +Datasets Most of the existing synthetic datasets for SLAM evaluation assume the ideal capturing setup, and do not exhibit any camera motion blur or dynamic appearance changes. We therefore propose a new dataset incorporating these effects. The new dataset contains realistic image degradation by simulating motion blur and auto exposure. We render the images and depth information with Cycles path tracer [1]. Also, we test $I^2$ -SLAM on challenging real-world datasets. We use TUM-RGBD [46] and ScanNet [11] dataset for evaluating RGB and RGBD scenarios, respectively. + +Evaluation We report the average values of three runs with different random seeds for all the quantitative evaluations except the ablation study and the runtime analysis. We measure PSNR, SSIM [53], and LPIPS [58] between rendered images from the reconstructed map and sharp ground-truth images which can be obtained from our synthetic dataset. Since there are no ground-truth sharp images in the real-world dataset, we evaluate the view synthesis performance only for the sharp frames that are manually annotated. Also, we run test-time optimization [26] to factor out pose errors in measuring the rendering quality of RGB-SLAMs. We report ATE RMSE [46] for tracking performance evaluation. + +Table 1: Rendering quality comparison against the RGB-SLAM baseline on TUM-RGBD [46] and synthetic dataset. $I^2$ -SLAM represents our RGB-SLAM model which is incorporated into our re-implementation of NeRF-SLAM [38], NeRF-SLAM†. + +
MethodsMetricsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1IF2
NeRF-SLAM†[38]PSNR25.9729.9724.7228.6425.4330.2026.0926.70
SSIM0.8250.9000.7270.8100.8320.8670.7890.842
LPIPS0.2220.0930.3660.3280.3230.3270.3020.270
Depth L110.9717.8330.9240.6855.8020.725.0219.76
I2-SLAMPSNR27.2332.0628.9128.9927.5932.3330.1628.89
SSIM0.8350.9160.8330.8270.8750.9020.8980.887
LPIPS0.1860.0740.1930.2840.2600.2860.2110.241
Depth L19.0417.9417.6020.3341.9220.483.5517.28
+ +Table 2: Rendering quality comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. $I^2$ -SLAM in this table represents our RGBD-SLAM model which is incorporated into SplaTAM [23]. + +
MethodsMetricsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1IF2
SplaTAM [23]PSNR21.6024.6424.5019.6321.3819.7824.2222.3623.82
SSIM0.7860.7730.8470.7190.8200.7900.8550.7660.824
LPIPS0.2360.2750.1820.3400.2320.2460.2270.2810.230
I²-SLAMPSNR23.3926.8924.0726.4026.1821.9823.8823.7224.07
SSIM0.7800.7960.8280.7620.8420.7700.7980.7960.826
LPIPS0.1800.2360.1750.2380.1930.2310.2630.2330.205
+ +We use the center of camera poses $\mathbf{T}(t_s^i)$ and $\mathbf{T}(t_e^i)$ to evaluate our method and use scale-aligned ground-truth trajectory for RGB-SLAM to handle the scale ambiguity. Further details can be found in the supplementary material. + +# 4.2 Experimental Results + +Quantitative Results We report the quantitative results of map rendering performance for keyframes of RGB and RGBD datasets in Tabs. 1 and 2, respectively. We observe that $I^2$ -SLAM enhances the rendering quality of NeRF-SLAM† across all metrics on the both synthetic and real-world TUM-RGBD [46] datasets. $I^2$ -SLAM also substantially enhances the depth accuracy for RGB-SLAM. In the RGBD dataset scenario, $I^2$ -SLAM also shows superior rendering quality in most scenes when attached to SplaTAM [23]. Especially, $I^2$ -SLAM improves the view-synthesis performance of SplaTAM in a large margin in SP of synthetic dataset and 0785-00 of ScanNet [11] dataset, whose appearances are changing dynamically within the videos. It shows that our in-camera model is especially advantageous when combined with the models without view-dependent effects. Furthermore, we report the camera trajectory error of RGB-SLAM methods in Tab. 3. The results show that $I^2$ -SLAM substantially improves the tracking performance of NeRF-SLAM† even if NeRF-SLAM† takes accurate initial tra + +Table 3: We evaluate the tracking performance of RGB-SLAM methods on TUMRGBD [46] and synthetic dataset in terms of ATE-RMSE (cm). + +
MethodsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1
NeRF-SLAM†[38]2.080.417.133.973.203.381.14
I²-SLAM1.640.261.951.503.231.590.74
+ +Table 4: Tracking accuracy comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. ATE-RMSE (cm) is measured as an evaluation metric. + +
MethodsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1
SplaTAM [23]1.803.011.135.911.111.502.041.02
I²-SLAM1.413.251.004.590.861.551.961.05
+ +jectory from DROID-SLAM as initial camera poses. It supports our claim that image formation process, when appropriately modeled, can enhance the tracking accuracy of inputs that are casually captured. In RGBD datasets, however, the trajectory accuracy improvement is subtle since the depth information mostly determines the camera poses as reported in Tab. 4. + +Qualitative Results We demonstrate the rendered images of $I^2$ -SLAM with NeRF-SLAM† in Fig. 3. As shown in Fig. 3 (a), $I^2$ -SLAM successfully renders sharp images, whereas NeRF-SLAM† has blurry artifacts come from the degraded input, for example, bricks in Sponza, boundary of the tire in LOU, complex texture of books and thin legs of the chair in Italian-flat-0. More importantly, our approach also shows remarkable performance in reconstructing sharp maps from TUM-RGBD data which contains the real-world camera motion. The texts on the books and objects on the table are clearly rendered with $I^2$ -SLAM when we compare to the results of baseline and blurred input frames. In Fig. 4, we show samples of rendered images in RGBD scenario. We can observe the consistent improvement over SplaTAM in generating a sharp map in our synthetic dataset. The letters on the book cover and the bricks are clearly rendered with $I^2$ -SLAM. Also, we observe significant map quality enhancement in the ScanNet dataset. The letters on the board and tassels in 0024-01, the detection mark and objects on the table in 0736-00, and the pictures in 0785-00 are deblurred with our approach. Furthermore, since the color of Gaussians in SplaTAM is consistent regardless of the exposure of images, SplaTAM does not appropriately model the brightness changes as we can see in the darker color of bricks in Sponza and tiled artifacts in 0785-00. Such artifacts are removed by modeling the tone mapping process. + +![](images/4ec70439d970c11a1476a55bc71b2fe235b9c0f78e5a570af5824fcc3d7b9a24.jpg) + +![](images/2d614ad3f846b0b052913d6b539ea971d3cc5544befda2eec4ef67c1e637244b.jpg) +(a) Synthetic Dataset +(b) TUM-RGBD [46] +Fig. 3: Qualitative results on applying $I^2$ -SLAM to the RGB-SLAM method. + +# 4.3 Ablation Study + +We conduct an ablation study in ScanNet [11] dataset. Table 5 shows that each component plays a crucial role in improving tracking or mapping performance. In Tab. 5, Traj. Reg. refers to the trajectory regularization in Sec. 3.3. Motion + +![](images/6397759484d580a9dcf104260a31766badaf7dfd851c37a7f62d9f15da26a8d3.jpg) +(a) Synthetic Dataset + +![](images/9252c2e412c740f8ef7fa24a2da377a596f648c47e29f5755e9983af9b29d44f.jpg) +(b) ScanNet [11] +Fig. 4: Qualitative results on applying $I^2$ -SLAM to the RGBD-SLAM method. + +blur-aware rendering improves tracking performance by preventing the accumulation of tracking errors. HDR map shows improved rendering quality over LDR representations. Trajectory regularization affects multi-camera optimization, resulting in enhancements in both tracking and mapping. + +# 4.4 Runtime analysis + +We analyze how much our approach affects the runtime and performance with ScanNet 0024-01 in Tab. 6. $I^2$ -SLAM exhibits better ATE-RMSE and PSNR + +Table 5: Ablation study. + +
Traj. Reg.Tone MappingMotion BlurATEPSNRSSIMLPIPSMapping /FrameTracking /FrameATEPSNRSSIMLPIPS
✓✓✓2.5625.620.8010.195I²-SLAM2.058s8.494s1.4224.160.7860.211
X✓✓2.6624.800.7690.203I²-SLAM-S0.436s1.867s1.5023.920.7950.230
✓X✓2.6022.390.7560.226SplaTAM [23]0.424s1.433s1.8122.260.8000.224
XX✓2.6322.360.7550.228SplaTAM-S [23]0.086s0.377s2.4021.430.7770.243
XXX2.7123.050.7930.235
+ +![](images/de4be7859ecea5f513829ed60df8f95a219c3896bc5b344d4ae322609e012fe8.jpg) +(a) ATE-RMSE over iteration time + +![](images/c4b99d017af7e1436b478696879fdf78ba9491f9ddf8534face733705adb5795.jpg) +(b) PSNR over iteration time +Fig. 5: Performance variations over iteration time of $I^2$ -SLAM and SplaTAM [23]. + +metrics compared to SplaTAM [23], but it comes at the cost of slower speed. However, $I^2$ -SLAM-S, which uses $20\%$ iterations, takes a similar runtime but yields better performance. In contrast, SplaTAM-S, which also uses $20\%$ iterations, shows a significant decrease in performance. + +In Fig. 5, we analyze the trend of performance changes concerning the number of iterations. Four models with different numbers of iterations are compared. In most cases, our method demonstrates better tracking and rendering performance when using a similar runtime. + +# 5 Conclusion + +We present $I^2$ -SLAM, a generic module that improves the quality of existing visual SLAM approaches by inverting the image formation process for casually captured videos. We show the effectiveness of our module by incorporating it into the state-of-the-art methods in RGB and RGBD-SLAM approaches. With $I^2$ -SLAM, existing visual SLAM pipelines can effectively handle the varying appearance and motion blur that are prevalent in-the-wild capturing scenarios. + +Although $I^2$ -SLAM is able to reconstruct sharp HDR maps while estimating the camera trajectory from casually captured videos, there are some limitations. The motion blur simulation with the sum of multiple cameras accompanies the longer rendering and optimization time. An efficient approximation method to simulate camera motion blur would be an interesting research direction to improve our approach. + +Acknowledgements This work is supported by the National Research Foundation of Korea(NRF) grant (No. RS-2023-00218601) and IITP grant [NO.RS- + +2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] funded by the Korea government(MSIT). + +# References + +1. Blender, O.C.: Blender - a 3D modelling and rendering package. Blender Foundation, Stichting Blender Foundation, Amsterdam (2018), http://www.blender.org +2. Bloesch, M., Czarnowski, J., Clark, R., Leutenegger, S., Davison, A.J.: Codeslam—learning a compact, optimisable representation for dense visual slam. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2560–2568 (2018) +3. Bloesch, M., Laidlow, T., Clark, R., Leutenegger, S., Davison, A.J.: Learning meshes for dense visual slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5855-5864 (2019) +4. Bylow, E., Sturm, J., Kerl, C., Kahl, F., Cremers, D.: Real-time camera tracking and 3d reconstruction using signed distance functions. In: Robotics: Science and Systems. vol. 2, p. 2 (2013) +5. Chakrabarti, A.: A neural approach to blind motion deblurring. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 221-235. Springer (2016) +6. Chaplot, D.S., Gandhi, D., Gupta, S., Gupta, A., Salakhutdinov, R.: Learning to explore using active neural slam. In: International Conference on Learning Representations (ICLR) (2020) +7. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018) +8. Chen, T., Culbertson, P., Schwager, M.: Catnips: Collision avoidance through neural implicit probabilistic scenes. arXiv preprint arXiv:2302.12931 (2023) +9. Cho, S., Lee, S.: Fast motion deblurring. In: ACM SIGGRAPH Asia 2009 papers, pp. 1-8 (2009) +0. Covolan, J.P.M., Sementille, A.C., Sanches, S.R.R.: A mapping of visual slam algorithms and their applications in augmented reality. In: 2020 22nd Symposium on Virtual and Augmented Reality (SVR). pp. 20-29. IEEE (2020) +1. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: Scannet: Richly-annotated 3d reconstructions of indoor scenes. In: Proc. Computer Vision and Pattern Recognition (CVPR), IEEE (2017) +2. Dai, A., Nießner, M., Zollhöfer, M., Izadi, S., Theobalt, C.: Bundlefusion: Real-time globally consistent 3d reconstruction using on-the-fly surface reintegration. ACM Transactions on Graphics (ToG) 36(4), 1 (2017) +3. Debevec, P.E., Malik, J.: Recovering high dynamic range radiance maps from photographs. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques. p. 369-378. SIGGRAPH '97, ACM Press/Addison-Wesley Publishing Co., USA (1997). https://doi.org/10.1145/258734.258884 +4. Fergus, R., Singh, B., Hertzmann, A., Roweis, S.T., Freeman, W.T.: Removing camera shake from a single photograph. In: Acm Siggraph 2006 Papers, pp. 787-794 (2006) +5. Gupta, S., Davidson, J., Levine, S., Sukthankar, R., Malik, J.: Cognitive mapping and planning for visual navigation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2616-2625 (2017) + +16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018) +17. Huang, H., Li, L., Cheng, H., Yeung, S.K.: Photo-slam: Real-time simultaneous localization and photorealistic mapping for monocular, stereo, and rgb-d cameras. arXiv preprint arXiv:2311.16728 (2023) +18. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: Hdr-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022) +19. Jaderberg, M., Simonyan, K., Zisserman, A., kavukcuoglu, k.: Spatial transformer networks. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 28. Curran Associates, Inc. (2015), https://proceedings.neurips.cc/paper_files/paper/2015/file/33ceb07bf4eeb3da587e268d663aba1a-Paper.pdf +20. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Maalouf, A., Li, S., Iyer, G., Saryazdi, S., Keetha, N., et al.: Conceptfusion: Open-set multimodal 3d mapping. arXiv preprint arXiv:2302.07241 (2023) +21. Jinyu, L., Bangbang, Y., Danpeng, C., Nan, W., Guofeng, Z., Hujun, B.: Survey and evaluation of monocular visual-inertial slam algorithms for augmented reality. Virtual Reality & Intelligent Hardware 1(4), 386-410 (2019) +22. Jun-Seong, K., Yu-Ji, K., Ye-Bin, M., Oh, T.H.: HDR-plenoxels: Self-calibrating high dynamic range radiance fields. In: European Conference on Computer Vision. pp. 384-401. Springer (2022) +23. Keetha, N., Karhade, J., Jatavallabhula, K.M., Yang, G., Scherer, S., Ramanan, D., Luiten, J.: Splatam: Splat, track & map 3d gaussians for dense rgb-d slam. arXiv preprint arXiv:2312.02126 (2023) +24. Keller, M., Lefloch, D., Lambers, M., Izadi, S., Weyrich, T., Kolb, A.: Real-time 3d reconstruction in dynamic scenes using point-based fusion. In: 2013 International Conference on 3D Vision-3DV 2013. pp. 1-8. IEEE (2013) +25. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3d gaussian splatting for real-time radiance field rendering. ACM Transactions on Graphics 42(4) (2023) +26. Lin, C.H., Ma, W.C., Torralba, A., Lucey, S.: Barf: Bundle-adjusting neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5741-5751 (2021) +27. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020) +28. Ma, L., Li, X., Liao, J., Zhang, Q., Wang, X., Wang, J., Sander, P.V.: Deblur-nerf: Neural radiance fields from blurry images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12861-12870 (2022) +29. Matsuki, H., Murai, R., Kelly, P.H., Davison, A.J.: Gaussian splatting slam. arXiv preprint arXiv:2312.06741 (2023) +30. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022) +31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) + +32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022) +33. Newcombe, R.A., Izadi, S., Hilliges, O., Molyneaux, D., Kim, D., Davison, A.J., Kohi, P., Shotton, J., Hodges, S., Fitzgibbon, A.: Kinectfusion: Real-time dense surface mapping and tracking. In: 2011 10th IEEE international symposium on mixed and augmented reality. pp. 127-136. IEEE (2011) +34. Newcombe, R.A., Lovegrove, S.J., Davison, A.J.: Dtam: Dense tracking and mapping in real-time. In: 2011 international conference on computer vision. pp. 2320-2327. IEEE (2011) +35. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013) +36. Oleynikova, H., Taylor, Z., Fehr, M., Siegwart, R., Nieto, J.: Voxblox: Incremental 3d euclidean signed distance fields for on-board mav planning. In: 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 1366-1373. IEEE (2017) +37. Ortiz, J., Clegg, A., Dong, J., Sucar, E., Novotny, D., Zollhoefer, M., Mukadam, M.: isdf: Real-time neural signed distance fields for robot perception. In: Robotics: Science and Systems (2022) +38. Rosinol, A., Leonard, J.J., Carlone, L.: Nerf-slam: Real-time dense monocular slam with neural radiance fields. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 3437-3444. IEEE (2023) +39. Rückert, D., Franke, L., Stamminger, M.: Adop: Approximate differentiable one-pixel point rendering. ACM Transactions on Graphics (ToG) 41(4), 1-14 (2022) +40. Sandström, E., Li, Y., Van Gool, L., Oswald, M.R.: Point-slam: Dense neural point cloud-based slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18433-18444 (2023) +41. Sarbolandi, H., Lefloch, D., Kolb, A.: Kinect range sensing: Structured-light versus time-of-flight kinect. Computer vision and image understanding 139, 1-20 (2015) +42. Schops, T., Sattler, T., Pollefeys, M.: Bad slam: Bundle adjusted direct rgb-d slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 134-144 (2019) +43. Shafiullah, N.M.M., Paxton, C., Pinto, L., Chintala, S., Szlam, A.: Clipfields: Weakly supervised semantic fields for robotic memory. arXiv preprint arXiv:2210.05663 (2022) +44. Shan, Q., Jia, J., Agarwala, A.: High-quality motion deblurring from a single image. Acm transactions on graphics (tog) 27(3), 1-10 (2008) +45. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled feature fields enable few-shot language-guided manipulation. In: 7th Annual Conference on Robot Learning (2023) +46. Sturm, J., Engelhard, N., Endres, F., Burgard, W., Cremers, D.: A benchmark for the evaluation of rgb-d slam systems. In: 2012 IEEE/RSJ international conference on intelligent robots and systems. pp. 573-580. IEEE (2012) +47. Sucar, E., Liu, S., Ortiz, J., Davison, A.J.: imap: Implicit mapping and positioning in real-time. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6229-6238 (2021) +48. Sun, J., Cao, W., Xu, Z., Ponce, J.: Learning a convolutional neural network for non-uniform motion blur removal. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 769-777 (2015) + +49. Tang, J.: Torch-ngp: a pytorch implementation of instant-ngp (2022), https://github.com/ashawkey/torch-ngp +50. Teed, Z., Deng, J.: Droid-slam: Deep visual slam for monocular, stereo, and rgbd cameras. Advances in neural information processing systems 34, 16558-16569 (2021) +51. Wang, H., Wang, J., Agapito, L.: Co-slam: Joint coordinate and sparse parametric encodings for neural real-time slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13293-13302 (2023) +52. Wang, P., Zhao, L., Ma, R., Liu, P.: Bad-nerf: Bundle adjusted deblur neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4170-4179 (2023) +53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) +54. Whelan, T., Leutenegger, S., Salas-Moreno, R., Glocker, B., Davison, A.: Elastic-fusion: Dense slam without a pose graph. Robotics: Science and Systems (2015) +55. Whelan, T., Salas-Moreno, R.F., Glocker, B., Davison, A.J., Leutenegger, S.: Elastic fusion: Real-time dense slam and light source estimation. The International Journal of Robotics Research 35(14), 1697-1716 (2016) +56. Whyte, O., Sivic, J., Zisserman, A., Ponce, J.: Non-uniform deblurring for shaken images. International journal of computer vision 98, 168-186 (2012) +57. Yugay, V., Li, Y., Gevers, T., Oswald, M.R.: Gaussian-slam: Photo-realistic dense slam with gaussian splatting. arXiv preprint arXiv:2312.10070 (2023) +58. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018) +59. Zhang, X., Matzen, K., Nguyen, V., Yao, D., Zhang, Y., Ng, R.: Synthetic defocus and look-ahead autofocus for casual videography. arXiv preprint arXiv:1905.06326 (2019) +60. Zhu, Z., Peng, S., Larsson, V., Xu, W., Bao, H., Cui, Z., Oswald, M.R., Pollefeys, M.: Nice-slam: Neural implicit scalable encoding for slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12786-12796 (2022) \ No newline at end of file diff --git a/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/images.zip b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..c9978fa04566513023dc05b6ffced57762cf0a17 --- /dev/null +++ b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:976da244300fc50f08f218121fbd57d6aafe646f61703768da4aa9e6dad6e911 +size 712897 diff --git a/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/layout.json b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..0276f4cf5531857fe1b4242df30210a2f086bbf4 --- /dev/null +++ b/2024/I2-SLAM_ Inverting Imaging Process for Robust Photorealistic Dense SLAM/layout.json @@ -0,0 +1,10434 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 166, + 113, + 449, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 113, + 449, + 148 + ], + "spans": [ + { + "bbox": [ + 166, + 113, + 449, + 148 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 166, + 113, + 449, + 148 + ], + "type": "text", + "content": "-SLAM: Inverting Imaging Process for Robust Photorealistic Dense SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 173, + 169, + 441, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 169, + 441, + 194 + ], + "spans": [ + { + "bbox": [ + 173, + 169, + 441, + 194 + ], + "type": "text", + "content": "Gwangtak Bae\\*1, Changwoon Choi\\*1, Hyeongjun Heo\\*1, Sang Min Kim\\*1, and Young Min Kim\\*1,2" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 153, + 202, + 460, + 227 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 202, + 460, + 227 + ], + "spans": [ + { + "bbox": [ + 153, + 202, + 460, + 227 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 153, + 202, + 460, + 227 + ], + "type": "text", + "content": " Dept. of Electrical and Computer Engineering, Seoul National University " + }, + { + "bbox": [ + 153, + 202, + 460, + 227 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 153, + 202, + 460, + 227 + ], + "type": "text", + "content": " INMC & IPAI, Seoul National University" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 146, + 255, + 199, + 333 + ], + "blocks": [ + { + "bbox": [ + 146, + 255, + 199, + 333 + ], + "lines": [ + { + "bbox": [ + 146, + 255, + 199, + 333 + ], + "spans": [ + { + "bbox": [ + 146, + 255, + 199, + 333 + ], + "type": "image", + "image_path": "b86726052bc4edb56ecae590dacd25bc63ad03680b6d669c2e17e9b331d25878.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 134, + 335, + 209, + 344 + ], + "lines": [ + { + "bbox": [ + 134, + 335, + 209, + 344 + ], + "spans": [ + { + "bbox": [ + 134, + 335, + 209, + 344 + ], + "type": "text", + "content": "Casually Captured Input" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 204, + 255, + 313, + 332 + ], + "blocks": [ + { + "bbox": [ + 204, + 255, + 313, + 332 + ], + "lines": [ + { + "bbox": [ + 204, + 255, + 313, + 332 + ], + "spans": [ + { + "bbox": [ + 204, + 255, + 313, + 332 + ], + "type": "image", + "image_path": "fc80d579f3cf3e48e24590bb1c84c2f886acdbf2c290f9651c8abd84a6b02338.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 214, + 335, + 304, + 344 + ], + "lines": [ + { + "bbox": [ + 214, + 335, + 304, + 344 + ], + "spans": [ + { + "bbox": [ + 214, + 335, + 304, + 344 + ], + "type": "text", + "content": "Camera Tracking & Mapping" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 320, + 255, + 413, + 324 + ], + "blocks": [ + { + "bbox": [ + 320, + 255, + 413, + 324 + ], + "lines": [ + { + "bbox": [ + 320, + 255, + 413, + 324 + ], + "spans": [ + { + "bbox": [ + 320, + 255, + 413, + 324 + ], + "type": "image", + "image_path": "fb531498bd18a9983a925238f912406f66bbcf2f77f92884820d5c1505ffadcc.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 338, + 325, + 396, + 333 + ], + "lines": [ + { + "bbox": [ + 338, + 325, + 396, + 333 + ], + "spans": [ + { + "bbox": [ + 338, + 325, + 396, + 333 + ], + "type": "text", + "content": "Varying Appearances" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 412, + 324, + 470, + 332 + ], + "lines": [ + { + "bbox": [ + 412, + 324, + 470, + 332 + ], + "spans": [ + { + "bbox": [ + 412, + 324, + 470, + 332 + ], + "type": "text", + "content": "Sharp Reconstruction" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 353, + 335, + 436, + 344 + ], + "lines": [ + { + "bbox": [ + 353, + 335, + 436, + 344 + ], + "spans": [ + { + "bbox": [ + 353, + 335, + 436, + 344 + ], + "type": "text", + "content": "Sharp HDR Radiance Field" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 132, + 354, + 482, + 387 + ], + "lines": [ + { + "bbox": [ + 132, + 354, + 482, + 387 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 482, + 387 + ], + "type": "text", + "content": "Fig. 1: We propose " + }, + { + "bbox": [ + 132, + 354, + 482, + 387 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 354, + 482, + 387 + ], + "type": "text", + "content": "-SLAM, a SLAM pipeline with a physical image formation process. We can reconstruct photorealistic and sharp HDR maps from casually captured videos which contain severe motion blur and varying appearances." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 414, + 255, + 468, + 283 + ], + "blocks": [ + { + "bbox": [ + 414, + 255, + 468, + 283 + ], + "lines": [ + { + "bbox": [ + 414, + 255, + 468, + 283 + ], + "spans": [ + { + "bbox": [ + 414, + 255, + 468, + 283 + ], + "type": "image", + "image_path": "dae799068a784aafcc70c8ad6cc79dbf59450c79b3af09f6fa76a14544cf744e.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 424, + 285, + 458, + 293 + ], + "lines": [ + { + "bbox": [ + 424, + 285, + 458, + 293 + ], + "spans": [ + { + "bbox": [ + 424, + 285, + 458, + 293 + ], + "type": "text", + "content": "Blurry Input" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 414, + 295, + 468, + 323 + ], + "blocks": [ + { + "bbox": [ + 414, + 295, + 468, + 323 + ], + "lines": [ + { + "bbox": [ + 414, + 295, + 468, + 323 + ], + "spans": [ + { + "bbox": [ + 414, + 295, + 468, + 323 + ], + "type": "image", + "image_path": "63a30bc451f703cb461c4c671d2830b1055ed4e87cdf1efb5f411ece338201aa.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "bbox": [ + 159, + 430, + 453, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 430, + 453, + 605 + ], + "spans": [ + { + "bbox": [ + 159, + 430, + 453, + 605 + ], + "type": "text", + "content": "Abstract. We present an inverse image-formation module that can enhance the robustness of existing visual SLAM pipelines for casually captured scenarios. Casual video captures often suffer from motion blur and varying appearances, which degrade the final quality of coherent 3D visual representation. We propose integrating the physical imaging into the SLAM system, which employs linear HDR radiance maps to collect measurements. Specifically, individual frames aggregate images of multiple poses along the camera trajectory to explain prevalent motion blur in hand-held videos. Additionally, we accommodate per-frame appearance variation by dedicating explicit variables for image formation steps, namely white balance, exposure time, and camera response function. Through joint optimization of additional variables, the SLAM pipeline produces high-quality images with more accurate trajectories. Extensive experiments demonstrate that our approach can be incorporated into recent visual SLAM pipelines using various scene representations, such as neural radiance fields or Gaussian splatting. Project website" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "spans": [ + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "text", + "content": "Keywords: SLAM " + }, + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "text", + "content": " photorealistic 3D reconstruction " + }, + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "text", + "content": " motion deblurring " + }, + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 616, + 453, + 638 + ], + "type": "text", + "content": " HDR reconstruction" + } + ] + } + ], + "index": 16 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 134, + 643, + 313, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 643, + 313, + 653 + ], + "spans": [ + { + "bbox": [ + 134, + 643, + 313, + 653 + ], + "type": "text", + "content": "* Authors contributed equally to this work." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 135, + 654, + 326, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 654, + 326, + 665 + ], + "spans": [ + { + "bbox": [ + 135, + 654, + 326, + 665 + ], + "type": "text", + "content": "† Young Min Kim is the corresponding author." + } + ] + } + ], + "index": 18 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 230, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 230, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 230, + 127 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 307 + ], + "type": "text", + "content": "Simultaneous localization and mapping (SLAM) builds a map of the environment during deployment, which can be utilized in various applications, including VR/AR [10, 21], robotic navigation [6, 15, 36], and collision handling [8]. Traditional 3D SLAM approaches typically use geometric representations like points/surfels [24, 42, 50, 54, 55], mesh [3], voxel grids [4, 33], or voxel hashing [12, 35]. Recent visual SLAM approaches additionally capture visual appearances incorporating advances in Neural Radiance Fields (NeRF) [31] and its variants [25, 32]. They can synthesize photorealistic images of the environment and open up new possibilities in complex downstream tasks such as detailed semantic scene understanding [20], language-guided manipulation [45], or visual navigation [43]. Additionally, neural representations can fill unseen regions with smooth geometric estimation and require low-memory footprint [37, 47, 51]. 3D visual representations can achieve real-time performance using voxelized hash grid [32] or 3D Gaussian Splatting (3DGS) [25]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 307, + 482, + 402 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 307, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 307, + 482, + 402 + ], + "type": "text", + "content": "Despite many works that build visual representations using the SLAM framework, most do not maintain their performance in real-world scenarios. Casually captured videos, the standard input for visual SLAM systems, suffer from two prevalent challenges: 1) motion blur due to camera movement and 2) varying appearances resulting from auto exposure and white balancing adjustments as demonstrated in Fig. 1. The degradation in images serves as a critical bottleneck for the accuracy of the map and the pose estimation, and the error accumulates due to the incremental nature of SLAM, significantly reducing the overall quality." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 403, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 594 + ], + "type": "text", + "content": "This work tackles the prevailing challenges by attaching the physical image formation process that directly models the aforementioned variations. Then, we can directly optimize for the correct camera poses and raw measurements via an analysis-by-synthesis approach. Specifically, the motion-blurred image is compared against observations integrated along the estimated camera trajectories during a window of exposure time instead of an image from a single camera pose. Our pipeline approximates the camera poses as a linear movement and optimizes the start and end poses. The global trajectory estimated in the SLAM pipeline guides the initial blur movement with in-camera parameters, such as exposure time. At the same time, we match the per-frame appearance variation against simulated images and jointly optimize a differentiable tone mapper composed of exposure time, white balance function, and camera response function (CRF). We employ high dynamic range (HDR) radiance fields as a map representation to linearize the color space, which reflects the actual light intensity maps. The HDR maps simplify modeling appearance variations and produce significantly more realistic motion blur effects [13]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 594, + 482, + 653 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 653 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 653 + ], + "type": "text", + "content": "As our formulation, coined " + }, + { + "bbox": [ + 130, + 594, + 482, + 653 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 594, + 482, + 653 + ], + "type": "text", + "content": "-SLAM, inverts the actual measurement steps, the module can augment any dense visual SLAM pipelines that use image inputs, including implicit neural networks and 3D Gaussians. Our extensive experiments demonstrate that it can robustly reconstruct sharp HDR maps from RGB/RGBD streams afflicted with severe motion blur and varying appearances." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 146, + 653, + 405, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 653, + 405, + 665 + ], + "spans": [ + { + "bbox": [ + 146, + 653, + 405, + 665 + ], + "type": "text", + "content": "Our technical contributions can be summarized as follows:" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 115, + 480, + 249 + ], + "type": "list", + "angle": 0, + "index": 6, + "blocks": [ + { + "bbox": [ + 137, + 115, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 115, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 137, + 115, + 479, + 140 + ], + "type": "text", + "content": "- We present " + }, + { + "bbox": [ + 137, + 115, + 479, + 140 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 137, + 115, + 479, + 140 + ], + "type": "text", + "content": "-SLAM, integrating the image formation process into the visual SLAM approaches to overcome dominant challenges in real-world captures." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 141, + 480, + 176 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 141, + 480, + 176 + ], + "spans": [ + { + "bbox": [ + 138, + 141, + 480, + 176 + ], + "type": "text", + "content": "- Incorporating 3D maps composed of linear radiance values, our formulation jointly optimizes the approximate movement for the motion blur and tonemapbing functions for appearance variations during the SLAM framework." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 137, + 177, + 479, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 177, + 479, + 212 + ], + "spans": [ + { + "bbox": [ + 137, + 177, + 479, + 212 + ], + "type": "text", + "content": "- We propose an initialization and regularization method to stabilize the blur movement optimization to align with the estimated global camera trajectory, utilizing the SLAM setup." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 213, + 480, + 249 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 213, + 480, + 249 + ], + "spans": [ + { + "bbox": [ + 137, + 213, + 480, + 249 + ], + "type": "text", + "content": "- We enhance the robustness and performance of recent visual SLAM approaches in the real-world and our synthetic dataset, which contains severe motion blur and varying appearance." + } + ] + } + ], + "index": 5 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 270, + 242, + 282 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 242, + 282 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 242, + 282 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 297, + 480, + 381 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 297, + 480, + 381 + ], + "spans": [ + { + "bbox": [ + 130, + 297, + 480, + 381 + ], + "type": "text", + "content": "Dense Visual SLAM Visual SLAM methods use images as input and first started using multi-view geometry between sparse image features to estimate camera trajectories. DTAM [34] further demonstrated building a projective photometric cost volume, a dense map representation that unlocks the opportunity for combining various image-based applications. As deep neural networks prosper in computer vision, parts of the visual SLAM pipeline have also been successfully deployed to use latent representations [2] or assist the depth estimation [50]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 383, + 481, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 383, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 383, + 481, + 525 + ], + "type": "text", + "content": "Subsequent advancements in neural visual SLAM benefit from the technical innovations in neural implicit representation or improved novel representations. iMAP [47] employed implicit neural map representation for SLAM. NICE-SLAM [60] demonstrates that the multi-resolution feature grid representation can improve the speed and resolve the forgetting problem in large-scale scenes. Co-SLAM [51] explores the coordinate and parametric encodings to achieve efficient and accurate mapping. NeRF-SLAM [38] eliminates the dependency on depth by utilizing DROID-SLAM [50]. Recent results favor explicit representations when high speed and photometric quality are desired. Point-SLAM [40] creates photorealistic 3D maps using a dynamic neural point cloud. Since the introduction of 3D Gaussian Splatting [25], several concurrent works rapidly deploy them for 3D map representation for SLAM [17,23,29,57]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "type": "text", + "content": "Motion Deblurring Motion blur significantly affects the quality of many computer vision tasks and has long been investigated as an active research topic. Traditional approaches assume a convolution kernel for the motion blur and convert the operation via deconvolution [9, 14, 44, 56]. The convolution operation naturally transfers to convolutional neural networks (CNN), and more recent works estimate the non-uniform motion blur field [48], complex Fourier coefficients [5], or dense motion flow [7]. Recent neural representations [31, 32] also suffer from performance degradation when handling blurred input images. Various works account for the blur operation and reconstruct a sharp 3D map even when input images are blurred [28, 52]." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 481, + 224 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 224 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 224 + ], + "type": "image", + "image_path": "48c87bfaa6160e155e8e3a1ef2ae0e279a65615b6f0521b65273ddbaef2c1bf7.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 233, + 482, + 289 + ], + "lines": [ + { + "bbox": [ + 130, + 233, + 482, + 289 + ], + "spans": [ + { + "bbox": [ + 130, + 233, + 482, + 289 + ], + "type": "text", + "content": "Fig. 2: Method overview. (a) We reconstruct a sharp HDR radiance field map. (b) Motion blur is simulated by integration of sharp images, which are obtained from virtual camera poses during the exposure time. Then we obtain the blurry LDR image by applying differentiable tone mapping module. (c) SLAM methods simultaneously perform tracking and mapping from degraded images to reconstruct a sharp HDR map." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 310, + 482, + 371 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 310, + 482, + 371 + ], + "spans": [ + { + "bbox": [ + 130, + 310, + 482, + 371 + ], + "type": "text", + "content": "The input measurements for the visual SLAM are susceptible to motion blur, as a moving camera captures an image for a duration of time. We linearize the camera trajectory during the exposure time and optimize the poses to match the blurred input, similar to [52]. However, we further exploit the SLAM setup and regularize the blur movement to be aligned with the estimated camera trajectory." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 386, + 482, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 386, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 386, + 482, + 542 + ], + "type": "text", + "content": "High Dynamic Range Recovery Another critical issue for high-quality visual SLAM is that the pixel values are inconsistent with different exposures in input frames. Classical works on HDR imaging demonstrate that a color space of an HDR radiance map can successfully combine multiple images of different exposures [13]. HDR radiances are linear to the scene radiance values and lead to better results in image processing and image-based modeling [7, 16, 59]. Our map representation also models the actual HDR radiance values, and we provide explicit variables to model the physical process to map the pixel values, namely the exposure time, white balance, and camera response function per frame. Recent works on novel-view synthesis and 3D reconstruction also achieve improved results as they optimize the HDR radiances with exposure times [18, 22, 30, 39]. Our work integrates factors such as exposure time into a coherent formulation for tone mapping and motion blur and stabilizes the overall optimization." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 558, + 202, + 571 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 202, + 571 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 202, + 571 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "-SLAM is a generic method that can be combined with any existing photorealistic dense SLAM methods. In Sec. 3.1, we first review the rendering techniques for two representative map representations used in our experiments: Neural Radiance Fields (NeRF) [30] and 3D Gaussian Splatting (3DGS) [25]. Then we describe our physical image formation process to render motion-blurred and appearance-varying images in Sec. 3.2. Finally, we explain how to integrate our image formation process into existing SLAM pipelines in Sec. 3.3." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 448, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 448, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 448, + 128 + ], + "type": "text", + "content": "3.1 Preliminaries: Rendering for Photorealistic Dense SLAM" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 479, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 479, + 210 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 479, + 210 + ], + "type": "text", + "content": "Our approach seamlessly integrates with various methods for generating color c and, optionally, depth " + }, + { + "bbox": [ + 130, + 140, + 479, + 210 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 140, + 479, + 210 + ], + "type": "text", + "content": " for each pixel for a given camera pose. Owing to their photorealistic quality and ease of training, most recent visual SLAM approaches are based on variations stemming from either NeRF [31] or 3DGS [25]. This section reviews the general formulations of the two approaches, elucidating the process of generating color and depth information." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "text", + "content": "Let " + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{c}(\\mathbf{T},\\mathbf{p})" + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "inline_equation", + "content": "d(\\mathbf{T},\\mathbf{p})" + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "text", + "content": " denote the color and depth at pixel location " + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "text", + "content": " with camera pose " + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{T}" + }, + { + "bbox": [ + 130, + 212, + 480, + 248 + ], + "type": "text", + "content": ". For NeRF, we can obtain the color and depth of target pixels by marching rays and utilizing the volume rendering technique:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 186, + 259, + 480, + 291 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 186, + 259, + 480, + 291 + ], + "spans": [ + { + "bbox": [ + 186, + 259, + 480, + 291 + ], + "type": "interline_equation", + "content": "\\mathbf {c} (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {N} \\tau_ {i} \\left(1 - e ^ {- \\sigma_ {i} \\delta_ {i}}\\right) \\mathbf {c} _ {i} \\quad \\text {w h e r e} \\tau_ {i} = e ^ {- \\sum_ {j = 1} ^ {i - 1} \\sigma_ {j} \\delta_ {j}}, \\tag {1}", + "image_path": "aebe58c0079fdbd5c0a1e8a571bd3733a6a5a59e9f21da5cba056fd44dc468a7.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 241, + 302, + 480, + 334 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 302, + 480, + 334 + ], + "spans": [ + { + "bbox": [ + 241, + 302, + 480, + 334 + ], + "type": "interline_equation", + "content": "d (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {N} \\tau_ {i} \\left(1 - e ^ {- \\sigma_ {i} \\delta_ {i}}\\right) d _ {i}, \\tag {2}", + "image_path": "73ec99d26d0ce5cca830783969250e53b80c89ad4853dba790fdf573a7d26fbb.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": " is the number of samples for each ray, and the camera determines the ray pose " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{T}" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": " and pixel location " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{c}_i" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "d_i" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": " are the corresponding color and depth of each sample along a ray observed from the camera center. " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": " is the distance between consecutive samples. Color " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{c}_i" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": " and volume density " + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\sigma_i" + }, + { + "bbox": [ + 130, + 341, + 479, + 411 + ], + "type": "text", + "content": " can be queried from MLP as in iMAP [47], hierarchical feature grid with small MLP [60], or multi-resolution hash grid [38]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 413, + 479, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 479, + 460 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 479, + 460 + ], + "type": "text", + "content": "3DGS [25] also adopts the volume rendering formulation, so we can train the map differentiable to input image measurements. However, 3DGS processes sparse explicit samples from 3D Gaussian primitives, which are faster. We can render images by compositing " + }, + { + "bbox": [ + 130, + 413, + 479, + 460 + ], + "type": "inline_equation", + "content": "\\mathcal{N}" + }, + { + "bbox": [ + 130, + 413, + 479, + 460 + ], + "type": "text", + "content": " ordered 3D Gaussians as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 168, + 472, + 480, + 505 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 472, + 480, + 505 + ], + "spans": [ + { + "bbox": [ + 168, + 472, + 480, + 505 + ], + "type": "interline_equation", + "content": "\\mathbf {c} (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {\\mathcal {N}} \\mathbf {c} _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {j}), \\text {w h e r e} \\alpha = o e ^ {- (\\mathbf {x} - \\mu) ^ {T} \\Sigma^ {- 1} (\\mathbf {x} - \\mu) / 2}, \\tag {3}", + "image_path": "819cd8d86e0747d8551daff1982729f8612a1a8513cc28168ce69de95b7cd3d0.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 240, + 520, + 480, + 553 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 240, + 520, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 240, + 520, + 480, + 553 + ], + "type": "interline_equation", + "content": "d (\\mathbf {T}, \\mathbf {p}) = \\sum_ {i = 1} ^ {\\mathcal {N}} d _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {j}), \\tag {4}", + "image_path": "a6417b033afa8dbc1cf927e3f4f78d057e98d6d36b4c38fde4e37ee527937f00.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "spans": [ + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "inline_equation", + "content": "\\mathbf{c}" + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "inline_equation", + "content": "o\\in [0,1]" + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "inline_equation", + "content": "\\mu \\in \\mathbb{R}^3" + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "inline_equation", + "content": "\\Sigma" + }, + { + "bbox": [ + 130, + 560, + 479, + 585 + ], + "type": "text", + "content": " are the color, opacity, center position, and the covariance of a 3D Gaussian, respectively." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 606, + 289, + 618 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 606, + 289, + 618 + ], + "spans": [ + { + "bbox": [ + 131, + 606, + 289, + 618 + ], + "type": "text", + "content": "3.2 Image Formation Process" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "content": "When running a visual SLAM framework, we can augment additional mapping processes from HDR radiance to image measurements. We reconstruct an HDR radiance map by making " + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "inline_equation", + "content": "c(\\mathbf{T}, \\mathbf{p})" + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "content": " in Sec. 3.1 to output linear HDR color. The" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 479, + 139 + ], + "type": "text", + "content": "HDR pixel intensity " + }, + { + "bbox": [ + 130, + 115, + 479, + 139 + ], + "type": "inline_equation", + "content": "C_{\\mathrm{HDR}}^i (\\mathbf{p})" + }, + { + "bbox": [ + 130, + 115, + 479, + 139 + ], + "type": "text", + "content": " captured during the exposure time " + }, + { + "bbox": [ + 130, + 115, + 479, + 139 + ], + "type": "inline_equation", + "content": "[t_s^i,t_e^i]" + }, + { + "bbox": [ + 130, + 115, + 479, + 139 + ], + "type": "text", + "content": " for the ith frame is" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 244, + 140, + 481, + 169 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 140, + 481, + 169 + ], + "spans": [ + { + "bbox": [ + 244, + 140, + 481, + 169 + ], + "type": "interline_equation", + "content": "C _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p}) = \\int_ {t _ {s} ^ {i}} ^ {t _ {e} ^ {i}} \\mathbf {c} (\\mathbf {T} (t), \\mathbf {p}) d t, \\tag {5}", + "image_path": "f0f835dced1ee3a9b34a57d4b5476ec76dc7c6ec482375f60cbc4741ba256c43.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "spans": [ + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t)" + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "content": " is the camera pose at time " + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "inline_equation", + "content": "\\mathbf{c}(\\mathbf{T},\\mathbf{p})" + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "content": " is HDR color for camera pose " + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "inline_equation", + "content": "\\mathbf{T}" + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "content": " at pixel location " + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "content": " defined in Eqs. (1) and (3). Motion blur occurs if " + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t)" + }, + { + "bbox": [ + 131, + 175, + 479, + 211 + ], + "type": "text", + "content": " changes during exposure. We numerically approximate the integral with quadrature:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 165, + 221, + 481, + 255 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 221, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 165, + 221, + 481, + 255 + ], + "type": "interline_equation", + "content": "C _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p}) = \\varDelta t ^ {i} \\cdot \\frac {1}{N _ {\\mathrm {c a m}}} \\sum_ {j = 1} ^ {N _ {\\mathrm {c a m}}} \\mathbf {c} \\left(\\mathbf {T} \\left(t _ {s} ^ {i} + \\frac {j - 1}{N _ {\\mathrm {c a m}} - 1} (t _ {e} ^ {i} - t _ {s} ^ {i})\\right), \\mathbf {p}\\right), \\qquad (6)", + "image_path": "172f233afa87e465a251ba49eeb38a9fe5fe3d2002f847c3d862aca25e37de95.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "spans": [ + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "N_{\\mathrm{cam}}" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": " is the number of virtual cameras to approximate the continuous integral with discrete summation and " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\Delta t^i = t_e^i - t_s^i" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": " is exposure time. Throughout, we empirically set " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "N_{\\mathrm{cam}} = 5" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": " for experiments. If we assume that the camera velocity is constant during the short exposure time, the camera poses within time range " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "t \\in [t_s^i, t_e^i]" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": " can be obtained by linearly interpolating between the start pose " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_s^i)" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": " and the end pose " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_e^i)" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": ". We interpolate the camera pose at time " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t)" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": ", by decomposing it into rotation " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\mathbf{R}(t)" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": " and translation " + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\mathbf{t}(t)" + }, + { + "bbox": [ + 131, + 263, + 479, + 348 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 358, + 481, + 385 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 358, + 481, + 385 + ], + "spans": [ + { + "bbox": [ + 141, + 358, + 481, + 385 + ], + "type": "interline_equation", + "content": "\\mathbf {R} (t) = \\operatorname {S l e r p} \\left(\\mathbf {R} \\left(t _ {s} ^ {i}\\right), \\mathbf {R} \\left(t _ {e} ^ {i}\\right), \\frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\\right), \\quad \\mathbf {t} (t) = \\operatorname {L e r p} \\left(\\mathbf {t} \\left(t _ {s} ^ {i}\\right), \\mathbf {t} \\left(t _ {e} ^ {i}\\right), \\frac {t - t _ {s} ^ {i}}{t _ {e} ^ {i} - t _ {s} ^ {i}}\\right), \\tag {7}", + "image_path": "f704746985abf3a6e7504d739900fedd1e62621bd66b81a7bd637b5f5799520c.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 393, + 479, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 393, + 479, + 404 + ], + "spans": [ + { + "bbox": [ + 131, + 393, + 479, + 404 + ], + "type": "text", + "content": "where Slerp stands for spherical linear interpolation, Lerp is linear interpolation." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 405, + 479, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 405, + 479, + 430 + ], + "spans": [ + { + "bbox": [ + 131, + 405, + 479, + 430 + ], + "type": "text", + "content": "Then, the final observed color value of the pixel " + }, + { + "bbox": [ + 131, + 405, + 479, + 430 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 405, + 479, + 430 + ], + "type": "text", + "content": " is obtained by applying tone mapping operator " + }, + { + "bbox": [ + 131, + 405, + 479, + 430 + ], + "type": "inline_equation", + "content": "\\varPsi^i" + }, + { + "bbox": [ + 131, + 405, + 479, + 430 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 250, + 440, + 480, + 453 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 250, + 440, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 250, + 440, + 480, + 453 + ], + "type": "interline_equation", + "content": "C _ {\\mathrm {L D R}} ^ {i} (\\mathbf {p}) = \\Psi^ {i} \\left(C _ {\\mathrm {H D R}} ^ {i} (\\mathbf {p})\\right). \\tag {8}", + "image_path": "8d318cf791770c75fb2ba70b0e8febe349d9e993d3dbafdec174795cc8cc5c9f.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "spans": [ + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "text", + "content": "The tone mapping operator " + }, + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "inline_equation", + "content": "\\varPsi^i" + }, + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "text", + "content": " clips the HDR color to low dynamic range (LDR) and maps from linear color space to non-linear color space. Specifically, the tone mapping operation is composed of white balancing " + }, + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "inline_equation", + "content": "\\mathrm{WB}^i" + }, + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "text", + "content": " and camera response function " + }, + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "inline_equation", + "content": "\\mathrm{CRF}^i" + }, + { + "bbox": [ + 131, + 463, + 479, + 511 + ], + "type": "text", + "content": " with dynamic range clipping:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 231, + 521, + 480, + 534 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 521, + 480, + 534 + ], + "spans": [ + { + "bbox": [ + 231, + 521, + 480, + 534 + ], + "type": "interline_equation", + "content": "\\varPsi^ {i} (\\Delta t ^ {i} \\cdot \\mathbf {c}) = \\operatorname {C R F} ^ {i} \\left(\\mathrm {W B} ^ {i} (\\Delta t ^ {i} \\cdot \\mathbf {c})\\right). \\tag {9}", + "image_path": "45d5d0b086a680f8a6fd970f6b2d609114661e9e31eb3f8901fdbf31a95b93c3.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 544, + 477, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 544, + 477, + 556 + ], + "spans": [ + { + "bbox": [ + 131, + 544, + 477, + 556 + ], + "type": "text", + "content": "White balance function " + }, + { + "bbox": [ + 131, + 544, + 477, + 556 + ], + "type": "inline_equation", + "content": "\\mathrm{WB}^i" + }, + { + "bbox": [ + 131, + 544, + 477, + 556 + ], + "type": "text", + "content": " is an element-wise product to each color channel:" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 218, + 566, + 480, + 583 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 566, + 480, + 583 + ], + "spans": [ + { + "bbox": [ + 218, + 566, + 480, + 583 + ], + "type": "interline_equation", + "content": "\\mathrm {W B} ^ {i} (\\mathbf {c}) = \\left[ w b _ {r} ^ {i} w b _ {g} ^ {i} w b _ {b} ^ {i} \\right] ^ {T} \\odot \\left[ c _ {r} c _ {g} c _ {b} \\right] ^ {T}. \\tag {10}", + "image_path": "682612992927bec826a5e90d8df490d2031b6acbf39b7b308f0ac7afccab0685.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "text", + "content": "We parameterize non-linear " + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{CRF}^i" + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "text", + "content": " with uniformly sampled 256-dimensional grid " + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "inline_equation", + "content": "g^i" + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "text", + "content": " between [0, 1] for each color channel. CRF should satisfy the two properties: (1) monotonically increasing function and (2) " + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{CRF}(0) = 0" + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{CRF}(1) = 1" + }, + { + "bbox": [ + 131, + 593, + 479, + 666 + ], + "type": "text", + "content": " [13]. We further adjust CRF to be physically plausible following [27]. We shift the derivatives by the smallest negative derivative and normalize CRF to satisfy the two properties. We employ differentiable grid sampling [19] to query our CRF" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "value. Instead of hard clipping the dynamic range between " + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "[0,1]" + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": ", we use a leaky clipping function with CRF to backpropagate the gradient:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 213, + 147, + 481, + 192 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 213, + 147, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 213, + 147, + 481, + 192 + ], + "type": "interline_equation", + "content": "\\operatorname {C R F} _ {\\text {l e a k y}} (c) = \\left\\{ \\begin{array}{l l} \\alpha c & c < 0 \\\\ \\operatorname {C R F} (c) & 0 \\leq c \\leq 1, \\\\ - \\frac {\\alpha}{\\sqrt {c}} + \\alpha + 1 & 1 < c \\end{array} \\right. \\tag {11}", + "image_path": "3192929b9f22f1d05c0899d60ac6a55c54f8bdbd0e95f22f6866364e73314b89.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "text", + "content": " is a constant parameter. Throughout, we set " + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "inline_equation", + "content": "\\alpha = 0.01" + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "text", + "content": " for experiments. To summarize, our image formation process can transform the HDR radiances in our map representation into LDR camera pixel values captured with continuous exposure. The learnable parameters are the HDR radiance map, start and end poses " + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_s),\\mathbf{T}(t_e)" + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "text", + "content": ", exposure time " + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "inline_equation", + "content": "\\Delta t" + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "text", + "content": ", white balance parameters WB, and control points for CRF " + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 131, + 197, + 482, + 293 + ], + "type": "text", + "content": ". Since all modules are fully differentiable, we can optimize the parameters with a simple gradient-based optimization method by minimizing the objective function with proper regularization, as described in Sec. 3.3." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 308, + 276, + 320 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 276, + 320 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 276, + 320 + ], + "type": "text", + "content": "3.3 Tracking and Mapping" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 326, + 479, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 326, + 479, + 387 + ], + "spans": [ + { + "bbox": [ + 131, + 326, + 479, + 387 + ], + "type": "text", + "content": "We optimize camera trajectories during exposure time and reconstruct a sharp HDR 3D map using the rendering loss defined by our image formation process. To optimize the camera trajectory during exposure time, we additionally propose a trajectory loss and a camera trajectory initialization method. Overall loss is sum of an image rendering loss, a depth rendering loss, and a trajectory loss:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 217, + 394, + 480, + 406 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 394, + 480, + 406 + ], + "spans": [ + { + "bbox": [ + 217, + 394, + 480, + 406 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\lambda_ {\\mathrm {i m g}} \\mathcal {L} _ {\\mathrm {i m g}} + \\lambda_ {\\mathrm {d e p t h}} \\mathcal {L} _ {\\mathrm {d e p t h}} + \\lambda_ {\\mathrm {t r a j}} \\mathcal {L} _ {\\mathrm {t r a j}}. \\tag {12}", + "image_path": "adbf82e5fd1f054913ab8f27c5f1cb01aca4b5d4817ab63bec10b415d2db688c.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 420, + 479, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 420, + 479, + 456 + ], + "spans": [ + { + "bbox": [ + 131, + 420, + 479, + 456 + ], + "type": "text", + "content": "Image Rendering Loss We jointly optimize the in-camera parameters and the map representation within the SLAM's tracking and mapping pipeline by applying an image rendering loss function as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 231, + 463, + 480, + 495 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 463, + 480, + 495 + ], + "spans": [ + { + "bbox": [ + 231, + 463, + 480, + 495 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {i m g}} = \\sum_ {i = 1} ^ {N} \\sum_ {\\mathbf {p}} \\left| C _ {\\mathrm {L D R}} ^ {i} (\\mathbf {p}) - \\hat {C} ^ {i} (\\mathbf {p}) \\right|, \\tag {13}", + "image_path": "613e169c32d1f989b44fe0bb50a4171f425dc5a1a9ae26744667de8e40d3706b.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "spans": [ + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "inline_equation", + "content": "C_{\\mathrm{LDR}}^i (\\mathbf{p})" + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "text", + "content": " is a rendered color output from our image formation process and " + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "inline_equation", + "content": "\\hat{C}^i (\\mathbf{p})" + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "text", + "content": " is the observed color at pixel location " + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "text", + "content": " of frame " + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 131, + 502, + 479, + 552 + ], + "type": "text", + "content": ". Even if the input images are degraded, the proposed rendering loss accounts for the physical degradation process and can reconstruct a sharp HDR radiance map." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 567, + 479, + 615 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 567, + 479, + 615 + ], + "spans": [ + { + "bbox": [ + 131, + 567, + 479, + 615 + ], + "type": "text", + "content": "Depth Rendering Loss We constrain the depth camera pose to be aligned with the color camera's trajectory during exposure time. Specifically, we assign a pose with a minimum depth error as the depth camera pose and apply depth rendering loss for the selected pose as follows:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 139, + 621, + 481, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 621, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 139, + 621, + 481, + 666 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {d e p t h}} = \\sum_ {i = 1} ^ {N} \\sum_ {\\mathbf {p}} | d (\\mathbf {T} \\left(t _ {\\mathrm {d}} ^ {i}\\right), \\mathbf {p}) - \\hat {d} ^ {i} (\\mathbf {p}) |, \\text {w h e r e} t _ {\\mathrm {d}} ^ {i} = \\underset {t \\in \\left[ t _ {s} ^ {i}, t _ {e} ^ {i} \\right]} {\\arg \\min } | d (\\mathbf {T} (t), \\mathbf {p}) - \\hat {d} ^ {i} (\\mathbf {p}) |, \\tag {14}", + "image_path": "dae444fb05126c216225010a0fbcfcbf9639f07492e496781f0e96463aa1ba59.jpg" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "inline_equation", + "content": "d(\\mathbf{T}(t_{\\mathrm{d}}^{i}), \\mathbf{p})" + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": " is a rendered depth from the depth camera pose " + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_{\\mathrm{d}}^{i})" + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "inline_equation", + "content": "\\hat{d}^i (\\mathbf{p})" + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": " is the ground-truth depth at pixel location " + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": " of frame " + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": ". Note that the depth rendering loss affects the color camera's trajectory since the depth camera pose is interpolated from " + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_s^i)" + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_e^i)" + }, + { + "bbox": [ + 130, + 115, + 482, + 189 + ], + "type": "text", + "content": ". Depth rendering loss ensures that at least one pose along the camera poses during the exposure time outputs accurate depth rendering." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 190, + 482, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 190, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 190, + 482, + 274 + ], + "type": "text", + "content": "Unlike the integration process for color pixels, we optimize a single pose for a depth camera, assuming that the depth information is captured at a single moment within the time window. Although the depth camera measures some inaccurate depth values in fast-moving scenarios, most of the noises are filtered as invalid pixels by sensor manufacturers [41]. Depth sensors usually output invalid pixels on object boundaries and black objects, and most RGBD-SLAM methods ignore those regions." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 292, + 482, + 423 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 292, + 482, + 423 + ], + "spans": [ + { + "bbox": [ + 130, + 292, + 482, + 423 + ], + "type": "text", + "content": "Trajectory Regularization We propose a trajectory loss that regularizes the camera trajectory during the exposure time. We design the trajectory loss function with two insights. First, the camera poses during the exposure time should be aligned with the global trajectory. As SLAM progressively optimizes the camera poses, the global trajectory can be obtained from previous localization results without additional cost and it gives meaningful information to the temporal sensor movement. We estimate the global trajectory by connecting the pose of the midpoint during each exposure time in the previous frames. Second, the size of the motion blur kernel is determined by the temporal velocity and the exposure time. Namely, the longer the exposure time " + }, + { + "bbox": [ + 130, + 292, + 482, + 423 + ], + "type": "inline_equation", + "content": "\\Delta t^i" + }, + { + "bbox": [ + 130, + 292, + 482, + 423 + ], + "type": "text", + "content": " and the faster the temporal velocity, the further the distance between the start and end camera poses." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 424, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 424, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 482, + 472 + ], + "type": "text", + "content": "Our trajectory loss regularizes the temporal camera trajectory during the exposure time to be aligned with the global trajectory and the length of it to be proportional to the exposure time and temporal velocity, assuming piecewise linear velocity:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 262, + 483, + 480, + 498 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 262, + 483, + 480, + 498 + ], + "spans": [ + { + "bbox": [ + 262, + 483, + 480, + 498 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {t r a j}} = \\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {t}} + \\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {R}}, \\tag {15}", + "image_path": "47fb54aa20ac0f711f3f1e970deee7bfd3481ab6783b57dbff422dd46f9c1d1f.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 521, + 480, + 541 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 521, + 480, + 541 + ], + "spans": [ + { + "bbox": [ + 138, + 521, + 480, + 541 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {t r a j}} ^ {\\mathbf {t}} = \\left\\| \\mathbf {t} \\left(t _ {e} ^ {i - 1}\\right) - \\operatorname {L e r p} \\left(\\mathbf {t} ^ {i - 1}, \\mathbf {t} ^ {i}, a \\Delta t ^ {i - 1}\\right) \\right\\| _ {2} ^ {2} + \\left\\| \\mathbf {t} \\left(t _ {s} ^ {i}\\right) - \\operatorname {L e r p} \\left(\\mathbf {t} ^ {i - 1}, \\mathbf {t} ^ {i}, 1 - a \\Delta t ^ {i}\\right) \\right\\| _ {2} ^ {2}, \\tag {16}", + "image_path": "4a51bd69898120e3af13224944da938f2e5fe8cce5ebe8614670c1bb64602c76.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 563, + 481, + 594 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 563, + 481, + 594 + ], + "spans": [ + { + "bbox": [ + 133, + 563, + 481, + 594 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\operatorname {t r a j}} ^ {\\mathbf {R}} = \\left\\| \\mathbf {R} \\left(t _ {e} ^ {i - 1}\\right) - \\operatorname {S l e r p} \\left(\\mathbf {R} ^ {i - 1}, \\mathbf {R} ^ {i}, a \\Delta t ^ {i - 1}\\right) \\right\\| _ {2} ^ {2} + \\left\\| \\mathbf {R} \\left(t _ {s} ^ {i}\\right) - \\operatorname {S l e r p} \\left(\\mathbf {R} ^ {i - 1}, \\mathbf {R} ^ {i}, 1 - a \\Delta t ^ {i}\\right) \\right\\| _ {2} ^ {2}, \\tag {17}", + "image_path": "5b04c95a725fb430d2786e2c71112af401583d9b83faa287f8ebf5de29b41988.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{t}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{R}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " are the translation and rotation vector of camera pose " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{T}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "a" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " is an unknown global scale parameter that is related to the input frame rate. " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{t}^i" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{R}^i" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " are the center pose between the start and end pose of frame " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ". The scale parameter " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "a" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " is also jointly optimized within the tracking process. We further describe the relation between our scale parameter " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "a" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " and the input frame rate in the supplementary material." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "We also propose an initialization strategy for robust optimization exploiting the global trajectory. With a constant velocity assumption, we initialize the " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "i + 1" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "th frame's camera poses " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_s^{i + 1})" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_e^{i + 1})" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": " by extrapolating estimated camera poses of " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "i - 1" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "th frames. We initialize the start and end poses to be separated with a small predefined distance along the global trajectory." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 194, + 230, + 209 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 194, + 230, + 209 + ], + "spans": [ + { + "bbox": [ + 131, + 194, + 230, + 209 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 220, + 482, + 281 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 220, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 482, + 281 + ], + "type": "text", + "content": "We demonstrate that " + }, + { + "bbox": [ + 130, + 220, + 482, + 281 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 220, + 482, + 281 + ], + "type": "text", + "content": "-SLAM can reconstruct a sharp HDR radiance map from casually captured videos with various input modalities. We describe our experimental setup in challenging datasets in Sec. 4.1. We show that " + }, + { + "bbox": [ + 130, + 220, + 482, + 281 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 220, + 482, + 281 + ], + "type": "text", + "content": "-SLAM enhances state-of-the-art dense visual SLAM methods in Sec. 4.2. We conduct ablation studies and runtime analyses in Sec. 4.3 and Sec. 4.4, respectively." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 298, + 262, + 312 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 298, + 262, + 312 + ], + "spans": [ + { + "bbox": [ + 131, + 298, + 262, + 312 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "text", + "content": "Baselines " + }, + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "text", + "content": "-SLAM serves as a versatile module that can be attached to dense visual SLAM methods to improve its performance. We apply our approach to the state-of-the-art RGB-SLAM method, NeRF-SLAM [38], which employs NeRF as a map representation and uses DROID-SLAM [50] as a tracking backbone. We re-implemented NeRF-SLAM with torch-ngp [49] and notate as NeRF-SLAM†. NeRF-SLAM† uses same loss functions of NeRF-SLAM. We additionally test " + }, + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "text", + "content": "-SLAM with an RGBD-SLAM approach to tackle challenging sequences in ScanNet [11] where robust learning-based SLAM method, DROID-SLAM, often fails without using additional depth channel. We employ a 3DGS-based RGBD-SLAM method, SplaTAM [23], to test " + }, + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 318, + 482, + 437 + ], + "type": "text", + "content": "-SLAM in RGBD inputs." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 449, + 482, + 546 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 546 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 546 + ], + "type": "text", + "content": "Datasets Most of the existing synthetic datasets for SLAM evaluation assume the ideal capturing setup, and do not exhibit any camera motion blur or dynamic appearance changes. We therefore propose a new dataset incorporating these effects. The new dataset contains realistic image degradation by simulating motion blur and auto exposure. We render the images and depth information with Cycles path tracer [1]. Also, we test " + }, + { + "bbox": [ + 130, + 449, + 482, + 546 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 449, + 482, + 546 + ], + "type": "text", + "content": "-SLAM on challenging real-world datasets. We use TUM-RGBD [46] and ScanNet [11] dataset for evaluating RGB and RGBD scenarios, respectively." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "Evaluation We report the average values of three runs with different random seeds for all the quantitative evaluations except the ablation study and the runtime analysis. We measure PSNR, SSIM [53], and LPIPS [58] between rendered images from the reconstructed map and sharp ground-truth images which can be obtained from our synthetic dataset. Since there are no ground-truth sharp images in the real-world dataset, we evaluate the view synthesis performance only for the sharp frames that are manually annotated. Also, we run test-time optimization [26] to factor out pose errors in measuring the rendering quality of RGB-SLAMs. We report ATE RMSE [46] for tracking performance evaluation." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 143, + 157, + 471, + 258 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 481, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 481, + 148 + ], + "type": "text", + "content": "Table 1: Rendering quality comparison against the RGB-SLAM baseline on TUM-RGBD [46] and synthetic dataset. " + }, + { + "bbox": [ + 132, + 114, + 481, + 148 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 114, + 481, + 148 + ], + "type": "text", + "content": "-SLAM represents our RGB-SLAM model which is incorporated into our re-implementation of NeRF-SLAM [38], NeRF-SLAM†." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 143, + 157, + 471, + 258 + ], + "lines": [ + { + "bbox": [ + 143, + 157, + 471, + 258 + ], + "spans": [ + { + "bbox": [ + 143, + 157, + 471, + 258 + ], + "type": "table", + "html": "
MethodsMetricsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1IF2
NeRF-SLAM†[38]PSNR25.9729.9724.7228.6425.4330.2026.0926.70
SSIM0.8250.9000.7270.8100.8320.8670.7890.842
LPIPS0.2220.0930.3660.3280.3230.3270.3020.270
Depth L110.9717.8330.9240.6855.8020.725.0219.76
I2-SLAMPSNR27.2332.0628.9128.9927.5932.3330.1628.89
SSIM0.8350.9160.8330.8270.8750.9020.8980.887
LPIPS0.1860.0740.1930.2840.2600.2860.2110.241
Depth L19.0417.9417.6020.3341.9220.483.5517.28
", + "image_path": "874149510d2ffca079429acfc0fc5182940bf5a4cfafb7f0261b0560da2fffa1.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 152, + 310, + 462, + 399 + ], + "blocks": [ + { + "bbox": [ + 132, + 267, + 481, + 301 + ], + "lines": [ + { + "bbox": [ + 132, + 267, + 481, + 301 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 481, + 301 + ], + "type": "text", + "content": "Table 2: Rendering quality comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. " + }, + { + "bbox": [ + 132, + 267, + 481, + 301 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 267, + 481, + 301 + ], + "type": "text", + "content": "-SLAM in this table represents our RGBD-SLAM model which is incorporated into SplaTAM [23]." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 152, + 310, + 462, + 399 + ], + "lines": [ + { + "bbox": [ + 152, + 310, + 462, + 399 + ], + "spans": [ + { + "bbox": [ + 152, + 310, + 462, + 399 + ], + "type": "table", + "html": "
MethodsMetricsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1IF2
SplaTAM [23]PSNR21.6024.6424.5019.6321.3819.7824.2222.3623.82
SSIM0.7860.7730.8470.7190.8200.7900.8550.7660.824
LPIPS0.2360.2750.1820.3400.2320.2460.2270.2810.230
I²-SLAMPSNR23.3926.8924.0726.4026.1821.9823.8823.7224.07
SSIM0.7800.7960.8280.7620.8420.7700.7980.7960.826
LPIPS0.1800.2360.1750.2380.1930.2310.2630.2330.205
", + "image_path": "439ff7817e13dcba3e31deda272acb4b37072fa33b5637e76322beeec76e777d.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 422, + 481, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 422, + 481, + 459 + ], + "spans": [ + { + "bbox": [ + 132, + 422, + 481, + 459 + ], + "type": "text", + "content": "We use the center of camera poses " + }, + { + "bbox": [ + 132, + 422, + 481, + 459 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_s^i)" + }, + { + "bbox": [ + 132, + 422, + 481, + 459 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 422, + 481, + 459 + ], + "type": "inline_equation", + "content": "\\mathbf{T}(t_e^i)" + }, + { + "bbox": [ + 132, + 422, + 481, + 459 + ], + "type": "text", + "content": " to evaluate our method and use scale-aligned ground-truth trajectory for RGB-SLAM to handle the scale ambiguity. Further details can be found in the supplementary material." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 477, + 270, + 489 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 477, + 270, + 489 + ], + "spans": [ + { + "bbox": [ + 132, + 477, + 270, + 489 + ], + "type": "text", + "content": "4.2 Experimental Results" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "text", + "content": "Quantitative Results We report the quantitative results of map rendering performance for keyframes of RGB and RGBD datasets in Tabs. 1 and 2, respectively. We observe that " + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "text", + "content": "-SLAM enhances the rendering quality of NeRF-SLAM† across all metrics on the both synthetic and real-world TUM-RGBD [46] datasets. " + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "text", + "content": "-SLAM also substantially enhances the depth accuracy for RGB-SLAM. In the RGBD dataset scenario, " + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "text", + "content": "-SLAM also shows superior rendering quality in most scenes when attached to SplaTAM [23]. Especially, " + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "text", + "content": "-SLAM improves the view-synthesis performance of SplaTAM in a large margin in SP of synthetic dataset and 0785-00 of ScanNet [11] dataset, whose appearances are changing dynamically within the videos. It shows that our in-camera model is especially advantageous when combined with the models without view-dependent effects. Furthermore, we report the camera trajectory error of RGB-SLAM methods in Tab. 3. The results show that " + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 498, + 482, + 666 + ], + "type": "text", + "content": "-SLAM substantially improves the tracking performance of NeRF-SLAM† even if NeRF-SLAM† takes accurate initial tra" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 90, + 376, + 102 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 187, + 146, + 427, + 195 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 3: We evaluate the tracking performance of RGB-SLAM methods on TUMRGBD [46] and synthetic dataset in terms of ATE-RMSE (cm)." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 187, + 146, + 427, + 195 + ], + "lines": [ + { + "bbox": [ + 187, + 146, + 427, + 195 + ], + "spans": [ + { + "bbox": [ + 187, + 146, + 427, + 195 + ], + "type": "table", + "html": "
MethodsTUM-RGBD [46]Synthetic
fr1/deskfr2/xyzfr3/officeSPLOUIFOIF1
NeRF-SLAM†[38]2.080.417.133.973.203.381.14
I²-SLAM1.640.261.951.503.231.590.74
", + "image_path": "da4aeddfc87cf03f215a02968714c678868fddf4d6675823af0dd5898562bafd.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 187, + 246, + 427, + 296 + ], + "blocks": [ + { + "bbox": [ + 132, + 213, + 480, + 236 + ], + "lines": [ + { + "bbox": [ + 132, + 213, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 213, + 480, + 236 + ], + "type": "text", + "content": "Table 4: Tracking accuracy comparison against the RGBD-SLAM baseline on ScanNet [11] and synthetic dataset. ATE-RMSE (cm) is measured as an evaluation metric." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 187, + 246, + 427, + 296 + ], + "lines": [ + { + "bbox": [ + 187, + 246, + 427, + 296 + ], + "spans": [ + { + "bbox": [ + 187, + 246, + 427, + 296 + ], + "type": "table", + "html": "
MethodsScanNet [11]Synthetic
0024-010031-000736-000785-00SPLOUIFOIF1
SplaTAM [23]1.803.011.135.911.111.502.041.02
I²-SLAM1.413.251.004.590.861.551.961.05
", + "image_path": "96b29c1a2dbe15846e1db144fdb94c63eae21b640d5ca9bbecf237dd13f398cc.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 326, + 480, + 386 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 480, + 386 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 480, + 386 + ], + "type": "text", + "content": "jectory from DROID-SLAM as initial camera poses. It supports our claim that image formation process, when appropriately modeled, can enhance the tracking accuracy of inputs that are casually captured. In RGBD datasets, however, the trajectory accuracy improvement is subtle since the depth information mostly determines the camera poses as reported in Tab. 4." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "text", + "content": "Qualitative Results We demonstrate the rendered images of " + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "text", + "content": "-SLAM with NeRF-SLAM† in Fig. 3. As shown in Fig. 3 (a), " + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "text", + "content": "-SLAM successfully renders sharp images, whereas NeRF-SLAM† has blurry artifacts come from the degraded input, for example, bricks in Sponza, boundary of the tire in LOU, complex texture of books and thin legs of the chair in Italian-flat-0. More importantly, our approach also shows remarkable performance in reconstructing sharp maps from TUM-RGBD data which contains the real-world camera motion. The texts on the books and objects on the table are clearly rendered with " + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "text", + "content": "-SLAM when we compare to the results of baseline and blurred input frames. In Fig. 4, we show samples of rendered images in RGBD scenario. We can observe the consistent improvement over SplaTAM in generating a sharp map in our synthetic dataset. The letters on the book cover and the bricks are clearly rendered with " + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 132, + 425, + 481, + 666 + ], + "type": "text", + "content": "-SLAM. Also, we observe significant map quality enhancement in the ScanNet dataset. The letters on the board and tassels in 0024-01, the detection mark and objects on the table in 0736-00, and the pictures in 0785-00 are deblurred with our approach. Furthermore, since the color of Gaussians in SplaTAM is consistent regardless of the exposure of images, SplaTAM does not appropriately model the brightness changes as we can see in the darker color of bricks in Sponza and tiled artifacts in 0785-00. Such artifacts are removed by modeling the tone mapping process." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 114, + 462, + 297 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 462, + 297 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 462, + 297 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 462, + 297 + ], + "type": "image", + "image_path": "4ec70439d970c11a1476a55bc71b2fe235b9c0f78e5a570af5824fcc3d7b9a24.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 149, + 310, + 462, + 550 + ], + "blocks": [ + { + "bbox": [ + 268, + 300, + 346, + 309 + ], + "lines": [ + { + "bbox": [ + 268, + 300, + 346, + 309 + ], + "spans": [ + { + "bbox": [ + 268, + 300, + 346, + 309 + ], + "type": "text", + "content": "(a) Synthetic Dataset" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 149, + 310, + 462, + 550 + ], + "lines": [ + { + "bbox": [ + 149, + 310, + 462, + 550 + ], + "spans": [ + { + "bbox": [ + 149, + 310, + 462, + 550 + ], + "type": "image", + "image_path": "2d614ad3f846b0b052913d6b539ea971d3cc5544befda2eec4ef67c1e637244b.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 269, + 552, + 345, + 562 + ], + "lines": [ + { + "bbox": [ + 269, + 552, + 345, + 562 + ], + "spans": [ + { + "bbox": [ + 269, + 552, + 345, + 562 + ], + "type": "text", + "content": "(b) TUM-RGBD [46]" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 148, + 571, + 464, + 583 + ], + "lines": [ + { + "bbox": [ + 148, + 571, + 464, + 583 + ], + "spans": [ + { + "bbox": [ + 148, + 571, + 464, + 583 + ], + "type": "text", + "content": "Fig. 3: Qualitative results on applying " + }, + { + "bbox": [ + 148, + 571, + 464, + 583 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 148, + 571, + 464, + 583 + ], + "type": "text", + "content": "-SLAM to the RGB-SLAM method." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 607, + 238, + 620 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 607, + 238, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 607, + 238, + 620 + ], + "type": "text", + "content": "4.3 Ablation Study" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": "We conduct an ablation study in ScanNet [11] dataset. Table 5 shows that each component plays a crucial role in improving tracking or mapping performance. In Tab. 5, Traj. Reg. refers to the trajectory regularization in Sec. 3.3. Motion" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 115, + 462, + 240 + ], + "blocks": [ + { + "bbox": [ + 149, + 115, + 462, + 240 + ], + "lines": [ + { + "bbox": [ + 149, + 115, + 462, + 240 + ], + "spans": [ + { + "bbox": [ + 149, + 115, + 462, + 240 + ], + "type": "image", + "image_path": "6397759484d580a9dcf104260a31766badaf7dfd851c37a7f62d9f15da26a8d3.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 268, + 243, + 346, + 252 + ], + "lines": [ + { + "bbox": [ + 268, + 243, + 346, + 252 + ], + "spans": [ + { + "bbox": [ + 268, + 243, + 346, + 252 + ], + "type": "text", + "content": "(a) Synthetic Dataset" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 149, + 254, + 460, + 492 + ], + "blocks": [ + { + "bbox": [ + 149, + 254, + 460, + 492 + ], + "lines": [ + { + "bbox": [ + 149, + 254, + 460, + 492 + ], + "spans": [ + { + "bbox": [ + 149, + 254, + 460, + 492 + ], + "type": "image", + "image_path": "9252c2e412c740f8ef7fa24a2da377a596f648c47e29f5755e9983af9b29d44f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 277, + 496, + 337, + 506 + ], + "lines": [ + { + "bbox": [ + 277, + 496, + 337, + 506 + ], + "spans": [ + { + "bbox": [ + 277, + 496, + 337, + 506 + ], + "type": "text", + "content": "(b) ScanNet [11]" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 144, + 514, + 468, + 526 + ], + "lines": [ + { + "bbox": [ + 144, + 514, + 468, + 526 + ], + "spans": [ + { + "bbox": [ + 144, + 514, + 468, + 526 + ], + "type": "text", + "content": "Fig. 4: Qualitative results on applying " + }, + { + "bbox": [ + 144, + 514, + 468, + 526 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 144, + 514, + 468, + 526 + ], + "type": "text", + "content": "-SLAM to the RGBD-SLAM method." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 552, + 482, + 599 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 552, + 482, + 599 + ], + "spans": [ + { + "bbox": [ + 130, + 552, + 482, + 599 + ], + "type": "text", + "content": "blur-aware rendering improves tracking performance by preventing the accumulation of tracking errors. HDR map shows improved rendering quality over LDR representations. Trajectory regularization affects multi-camera optimization, resulting in enhancements in both tracking and mapping." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 619, + 248, + 631 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 619, + 248, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 619, + 248, + 631 + ], + "type": "text", + "content": "4.4 Runtime analysis" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "We analyze how much our approach affects the runtime and performance with ScanNet 0024-01 in Tab. 6. " + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "-SLAM exhibits better ATE-RMSE and PSNR" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 408, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 408, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 408, + 90, + 447, + 100 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 408, + 90, + 447, + 100 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 136, + 458, + 195 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 255, + 125 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 255, + 125 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 255, + 125 + ], + "type": "text", + "content": "Table 5: Ablation study." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 136, + 458, + 195 + ], + "lines": [ + { + "bbox": [ + 134, + 136, + 458, + 195 + ], + "spans": [ + { + "bbox": [ + 134, + 136, + 458, + 195 + ], + "type": "table", + "html": "
Traj. Reg.Tone MappingMotion BlurATEPSNRSSIMLPIPSMapping /FrameTracking /FrameATEPSNRSSIMLPIPS
✓✓✓2.5625.620.8010.195I²-SLAM2.058s8.494s1.4224.160.7860.211
X✓✓2.6624.800.7690.203I²-SLAM-S0.436s1.867s1.5023.920.7950.230
✓X✓2.6022.390.7560.226SplaTAM [23]0.424s1.433s1.8122.260.8000.224
XX✓2.6322.360.7550.228SplaTAM-S [23]0.086s0.377s2.4021.430.7770.243
XXX2.7123.050.7930.235
", + "image_path": "44ed9a30310b32e76e1eb539bdf3eeb27c0d71434375b9fd5a5fe516606986b7.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 182, + 213, + 293, + 296 + ], + "blocks": [ + { + "bbox": [ + 182, + 213, + 293, + 296 + ], + "lines": [ + { + "bbox": [ + 182, + 213, + 293, + 296 + ], + "spans": [ + { + "bbox": [ + 182, + 213, + 293, + 296 + ], + "type": "image", + "image_path": "de4be7859ecea5f513829ed60df8f95a219c3896bc5b344d4ae322609e012fe8.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 182, + 297, + 304, + 306 + ], + "lines": [ + { + "bbox": [ + 182, + 297, + 304, + 306 + ], + "spans": [ + { + "bbox": [ + 182, + 297, + 304, + 306 + ], + "type": "text", + "content": "(a) ATE-RMSE over iteration time" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 307, + 213, + 418, + 296 + ], + "blocks": [ + { + "bbox": [ + 307, + 213, + 418, + 296 + ], + "lines": [ + { + "bbox": [ + 307, + 213, + 418, + 296 + ], + "spans": [ + { + "bbox": [ + 307, + 213, + 418, + 296 + ], + "type": "image", + "image_path": "c4b99d017af7e1436b478696879fdf78ba9491f9ddf8534face733705adb5795.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 315, + 297, + 420, + 306 + ], + "lines": [ + { + "bbox": [ + 315, + 297, + 420, + 306 + ], + "spans": [ + { + "bbox": [ + 315, + 297, + 420, + 306 + ], + "type": "text", + "content": "(b) PSNR over iteration time" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 137, + 315, + 474, + 327 + ], + "lines": [ + { + "bbox": [ + 137, + 315, + 474, + 327 + ], + "spans": [ + { + "bbox": [ + 137, + 315, + 474, + 327 + ], + "type": "text", + "content": "Fig. 5: Performance variations over iteration time of " + }, + { + "bbox": [ + 137, + 315, + 474, + 327 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 137, + 315, + 474, + 327 + ], + "type": "text", + "content": "-SLAM and SplaTAM [23]." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "text", + "content": "metrics compared to SplaTAM [23], but it comes at the cost of slower speed. However, " + }, + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "text", + "content": "-SLAM-S, which uses " + }, + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "text", + "content": " iterations, takes a similar runtime but yields better performance. In contrast, SplaTAM-S, which also uses " + }, + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 347, + 479, + 395 + ], + "type": "text", + "content": " iterations, shows a significant decrease in performance." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 396, + 480, + 443 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 396, + 480, + 443 + ], + "spans": [ + { + "bbox": [ + 130, + 396, + 480, + 443 + ], + "type": "text", + "content": "In Fig. 5, we analyze the trend of performance changes concerning the number of iterations. Four models with different numbers of iterations are compared. In most cases, our method demonstrates better tracking and rendering performance when using a similar runtime." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 460, + 219, + 472 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 460, + 219, + 472 + ], + "spans": [ + { + "bbox": [ + 131, + 460, + 219, + 472 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 482, + 480, + 553 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 482, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 130, + 482, + 480, + 553 + ], + "type": "text", + "content": "We present " + }, + { + "bbox": [ + 130, + 482, + 480, + 553 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 482, + 480, + 553 + ], + "type": "text", + "content": "-SLAM, a generic module that improves the quality of existing visual SLAM approaches by inverting the image formation process for casually captured videos. We show the effectiveness of our module by incorporating it into the state-of-the-art methods in RGB and RGBD-SLAM approaches. With " + }, + { + "bbox": [ + 130, + 482, + 480, + 553 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 482, + 480, + 553 + ], + "type": "text", + "content": "-SLAM, existing visual SLAM pipelines can effectively handle the varying appearance and motion blur that are prevalent in-the-wild capturing scenarios." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 554, + 480, + 626 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 554, + 480, + 626 + ], + "spans": [ + { + "bbox": [ + 130, + 554, + 480, + 626 + ], + "type": "text", + "content": "Although " + }, + { + "bbox": [ + 130, + 554, + 480, + 626 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 130, + 554, + 480, + 626 + ], + "type": "text", + "content": "-SLAM is able to reconstruct sharp HDR maps while estimating the camera trajectory from casually captured videos, there are some limitations. The motion blur simulation with the sum of multiple cameras accompanies the longer rendering and optimization time. An efficient approximation method to simulate camera motion blur would be an interesting research direction to improve our approach." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "type": "text", + "content": "Acknowledgements This work is supported by the National Research Foundation of Korea(NRF) grant (No. RS-2023-00218601) and IITP grant [NO.RS-" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 90, + 376, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 90, + 376, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 90, + 376, + 101 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": "2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] funded by the Korea government(MSIT)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 158, + 197, + 171 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 158, + 197, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 158, + 197, + 171 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 183, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 183, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 183, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 138, + 183, + 481, + 205 + ], + "type": "text", + "content": "1. Blender, O.C.: Blender - a 3D modelling and rendering package. Blender Foundation, Stichting Blender Foundation, Amsterdam (2018), http://www.blender.org" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 206, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 206, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 138, + 206, + 481, + 248 + ], + "type": "text", + "content": "2. Bloesch, M., Czarnowski, J., Clark, R., Leutenegger, S., Davison, A.J.: Codeslam—learning a compact, optimisable representation for dense visual slam. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2560–2568 (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 250, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 250, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 138, + 250, + 481, + 282 + ], + "type": "text", + "content": "3. Bloesch, M., Laidlow, T., Clark, R., Leutenegger, S., Davison, A.J.: Learning meshes for dense visual slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5855-5864 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 283, + 481, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 283, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 138, + 283, + 481, + 314 + ], + "type": "text", + "content": "4. Bylow, E., Sturm, J., Kerl, C., Kahl, F., Cremers, D.: Real-time camera tracking and 3d reconstruction using signed distance functions. In: Robotics: Science and Systems. vol. 2, p. 2 (2013)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 316, + 481, + 348 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 481, + 348 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 481, + 348 + ], + "type": "text", + "content": "5. Chakrabarti, A.: A neural approach to blind motion deblurring. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 221-235. Springer (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 349, + 481, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 349, + 481, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 349, + 481, + 380 + ], + "type": "text", + "content": "6. Chaplot, D.S., Gandhi, D., Gupta, S., Gupta, A., Salakhutdinov, R.: Learning to explore using active neural slam. In: International Conference on Learning Representations (ICLR) (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 381, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 381, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 138, + 381, + 481, + 413 + ], + "type": "text", + "content": "7. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 414, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 414, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 414, + 481, + 435 + ], + "type": "text", + "content": "8. Chen, T., Culbertson, P., Schwager, M.: Catnips: Collision avoidance through neural implicit probabilistic scenes. arXiv preprint arXiv:2302.12931 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 436, + 481, + 457 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 436, + 481, + 457 + ], + "spans": [ + { + "bbox": [ + 138, + 436, + 481, + 457 + ], + "type": "text", + "content": "9. Cho, S., Lee, S.: Fast motion deblurring. In: ACM SIGGRAPH Asia 2009 papers, pp. 1-8 (2009)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 458, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 458, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 138, + 458, + 481, + 490 + ], + "type": "text", + "content": "0. Covolan, J.P.M., Sementille, A.C., Sanches, S.R.R.: A mapping of visual slam algorithms and their applications in augmented reality. In: 2020 22nd Symposium on Virtual and Augmented Reality (SVR). pp. 20-29. IEEE (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 491, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 481, + 522 + ], + "type": "text", + "content": "1. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: Scannet: Richly-annotated 3d reconstructions of indoor scenes. In: Proc. Computer Vision and Pattern Recognition (CVPR), IEEE (2017)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "type": "text", + "content": "2. Dai, A., Nießner, M., Zollhöfer, M., Izadi, S., Theobalt, C.: Bundlefusion: Real-time globally consistent 3d reconstruction using on-the-fly surface reintegration. ACM Transactions on Graphics (ToG) 36(4), 1 (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 556, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 556, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 556, + 481, + 599 + ], + "type": "text", + "content": "3. Debevec, P.E., Malik, J.: Recovering high dynamic range radiance maps from photographs. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques. p. 369-378. SIGGRAPH '97, ACM Press/Addison-Wesley Publishing Co., USA (1997). https://doi.org/10.1145/258734.258884" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "type": "text", + "content": "4. Fergus, R., Singh, B., Hertzmann, A., Roweis, S.T., Freeman, W.T.: Removing camera shake from a single photograph. In: Acm Siggraph 2006 Papers, pp. 787-794 (2006)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "text", + "content": "5. Gupta, S., Davidson, J., Levine, S., Sukthankar, R., Malik, J.: Cognitive mapping and planning for visual navigation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2616-2625 (2017)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 407, + 90, + 447, + 101 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 480, + 172 + ], + "type": "text", + "content": "17. Huang, H., Li, L., Cheng, H., Yeung, S.K.: Photo-slam: Real-time simultaneous localization and photorealistic mapping for monocular, stereo, and rgb-d cameras. arXiv preprint arXiv:2311.16728 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 174, + 480, + 206 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 174, + 480, + 206 + ], + "spans": [ + { + "bbox": [ + 133, + 174, + 480, + 206 + ], + "type": "text", + "content": "18. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: Hdr-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 207, + 480, + 261 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 207, + 480, + 261 + ], + "spans": [ + { + "bbox": [ + 134, + 207, + 480, + 261 + ], + "type": "text", + "content": "19. Jaderberg, M., Simonyan, K., Zisserman, A., kavukcuoglu, k.: Spatial transformer networks. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 28. Curran Associates, Inc. (2015), https://proceedings.neurips.cc/paper_files/paper/2015/file/33ceb07bf4eeb3da587e268d663aba1a-Paper.pdf" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 262, + 480, + 296 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 262, + 480, + 296 + ], + "spans": [ + { + "bbox": [ + 133, + 262, + 480, + 296 + ], + "type": "text", + "content": "20. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Maalouf, A., Li, S., Iyer, G., Saryazdi, S., Keetha, N., et al.: Conceptfusion: Open-set multimodal 3d mapping. arXiv preprint arXiv:2302.07241 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 297, + 480, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 297, + 480, + 329 + ], + "spans": [ + { + "bbox": [ + 132, + 297, + 480, + 329 + ], + "type": "text", + "content": "21. Jinyu, L., Bangbang, Y., Danpeng, C., Nan, W., Guofeng, Z., Hujun, B.: Survey and evaluation of monocular visual-inertial slam algorithms for augmented reality. Virtual Reality & Intelligent Hardware 1(4), 386-410 (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 330, + 480, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 330, + 480, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 330, + 480, + 363 + ], + "type": "text", + "content": "22. Jun-Seong, K., Yu-Ji, K., Ye-Bin, M., Oh, T.H.: HDR-plenoxels: Self-calibrating high dynamic range radiance fields. In: European Conference on Computer Vision. pp. 384-401. Springer (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 364, + 480, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 364, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 364, + 480, + 396 + ], + "type": "text", + "content": "23. Keetha, N., Karhade, J., Jatavallabhula, K.M., Yang, G., Scherer, S., Ramanan, D., Luiten, J.: Splatam: Splat, track & map 3d gaussians for dense rgb-d slam. arXiv preprint arXiv:2312.02126 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 397, + 480, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 480, + 430 + ], + "type": "text", + "content": "24. Keller, M., Lefloch, D., Lambers, M., Izadi, S., Weyrich, T., Kolb, A.: Real-time 3d reconstruction in dynamic scenes using point-based fusion. In: 2013 International Conference on 3D Vision-3DV 2013. pp. 1-8. IEEE (2013)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 431, + 480, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 431, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 431, + 480, + 453 + ], + "type": "text", + "content": "25. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3d gaussian splatting for real-time radiance field rendering. ACM Transactions on Graphics 42(4) (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 453, + 480, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 480, + 486 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 480, + 486 + ], + "type": "text", + "content": "26. Lin, C.H., Ma, W.C., Torralba, A., Lucey, S.: Barf: Bundle-adjusting neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5741-5751 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 487, + 480, + 530 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 480, + 530 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 480, + 530 + ], + "type": "text", + "content": "27. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 532, + 480, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 480, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 480, + 563 + ], + "type": "text", + "content": "28. Ma, L., Li, X., Liao, J., Zhang, Q., Wang, X., Wang, J., Sander, P.V.: Deblur-nerf: Neural radiance fields from blurry images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12861-12870 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 565, + 480, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 565, + 480, + 587 + ], + "spans": [ + { + "bbox": [ + 132, + 565, + 480, + 587 + ], + "type": "text", + "content": "29. Matsuki, H., Murai, R., Kelly, P.H., Davison, A.J.: Gaussian splatting slam. arXiv preprint arXiv:2312.06741 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 588, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 480, + 632 + ], + "type": "text", + "content": "30. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "text", + "content": "31. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 376, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 376, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 376, + 101 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 194 + ], + "type": "text", + "content": "33. Newcombe, R.A., Izadi, S., Hilliges, O., Molyneaux, D., Kim, D., Davison, A.J., Kohi, P., Shotton, J., Hodges, S., Fitzgibbon, A.: Kinectfusion: Real-time dense surface mapping and tracking. In: 2011 10th IEEE international symposium on mixed and augmented reality. pp. 127-136. IEEE (2011)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "34. Newcombe, R.A., Lovegrove, S.J., Davison, A.J.: Dtam: Dense tracking and mapping in real-time. In: 2011 international conference on computer vision. pp. 2320-2327. IEEE (2011)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 258 + ], + "type": "text", + "content": "35. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "type": "text", + "content": "36. Oleynikova, H., Taylor, Z., Fehr, M., Siegwart, R., Nieto, J.: Voxblox: Incremental 3d euclidean signed distance fields for on-board mav planning. In: 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 1366-1373. IEEE (2017)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 304, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 481, + 335 + ], + "type": "text", + "content": "37. Ortiz, J., Clegg, A., Dong, J., Sucar, E., Novotny, D., Zollhoefer, M., Mukadam, M.: isdf: Real-time neural signed distance fields for robot perception. In: Robotics: Science and Systems (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "38. Rosinol, A., Leonard, J.J., Carlone, L.: Nerf-slam: Real-time dense monocular slam with neural radiance fields. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 3437-3444. IEEE (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 370, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 370, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 370, + 481, + 392 + ], + "type": "text", + "content": "39. Rückert, D., Franke, L., Stamminger, M.: Adop: Approximate differentiable one-pixel point rendering. ACM Transactions on Graphics (ToG) 41(4), 1-14 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "text", + "content": "40. Sandström, E., Li, Y., Van Gool, L., Oswald, M.R.: Point-slam: Dense neural point cloud-based slam. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18433-18444 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 425, + 481, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 425, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 132, + 425, + 481, + 446 + ], + "type": "text", + "content": "41. Sarbolandi, H., Lefloch, D., Kolb, A.: Kinect range sensing: Structured-light versus time-of-flight kinect. Computer vision and image understanding 139, 1-20 (2015)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "type": "text", + "content": "42. Schops, T., Sattler, T., Pollefeys, M.: Bad slam: Bundle adjusted direct rgb-d slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 134-144 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "text", + "content": "43. Shafiullah, N.M.M., Paxton, C., Pinto, L., Chintala, S., Szlam, A.: Clipfields: Weakly supervised semantic fields for robotic memory. arXiv preprint arXiv:2210.05663 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "type": "text", + "content": "44. Shan, Q., Jia, J., Agarwala, A.: High-quality motion deblurring from a single image. Acm transactions on graphics (tog) 27(3), 1-10 (2008)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "text", + "content": "45. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled feature fields enable few-shot language-guided manipulation. In: 7th Annual Conference on Robot Learning (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "text", + "content": "46. Sturm, J., Engelhard, N., Endres, F., Burgard, W., Cremers, D.: A benchmark for the evaluation of rgb-d slam systems. In: 2012 IEEE/RSJ international conference on intelligent robots and systems. pp. 573-580. IEEE (2012)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 600, + 481, + 632 + ], + "type": "text", + "content": "47. Sucar, E., Liu, S., Ortiz, J., Davison, A.J.: imap: Implicit mapping and positioning in real-time. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6229-6238 (2021)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "48. Sun, J., Cao, W., Xu, Z., Ponce, J.: Learning a convolutional neural network for non-uniform motion blur removal. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 769-777 (2015)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "inline_equation", + "content": "I^2" + }, + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "text", + "content": " -SLAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 479 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "49. Tang, J.: Torch-ngp: a pytorch implementation of instant-ngp (2022), https://github.com/ashawkey/torch-ngp" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "type": "text", + "content": "50. Teed, Z., Deng, J.: Droid-slam: Deep visual slam for monocular, stereo, and rgbd cameras. Advances in neural information processing systems 34, 16558-16569 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "type": "text", + "content": "51. Wang, H., Wang, J., Agapito, L.: Co-slam: Joint coordinate and sparse parametric encodings for neural real-time slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13293-13302 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 205, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 205, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 134, + 205, + 480, + 237 + ], + "type": "text", + "content": "52. Wang, P., Zhao, L., Ma, R., Liu, P.: Bad-nerf: Bundle adjusted deblur neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4170-4179 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 238, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 238, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 133, + 238, + 480, + 270 + ], + "type": "text", + "content": "53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "type": "text", + "content": "54. Whelan, T., Leutenegger, S., Salas-Moreno, R., Glocker, B., Davison, A.: Elastic-fusion: Dense slam without a pose graph. Robotics: Science and Systems (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 293, + 480, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 293, + 480, + 325 + ], + "spans": [ + { + "bbox": [ + 133, + 293, + 480, + 325 + ], + "type": "text", + "content": "55. Whelan, T., Salas-Moreno, R.F., Glocker, B., Davison, A.J., Leutenegger, S.: Elastic fusion: Real-time dense slam and light source estimation. The International Journal of Robotics Research 35(14), 1697-1716 (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 326, + 480, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 326, + 480, + 347 + ], + "spans": [ + { + "bbox": [ + 133, + 326, + 480, + 347 + ], + "type": "text", + "content": "56. Whyte, O., Sivic, J., Zisserman, A., Ponce, J.: Non-uniform deblurring for shaken images. International journal of computer vision 98, 168-186 (2012)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 348, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 348, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 133, + 348, + 480, + 369 + ], + "type": "text", + "content": "57. Yugay, V., Li, Y., Gevers, T., Oswald, M.R.: Gaussian-slam: Photo-realistic dense slam with gaussian splatting. arXiv preprint arXiv:2312.10070 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 370, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 370, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 133, + 370, + 480, + 402 + ], + "type": "text", + "content": "58. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 403, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 403, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 133, + 403, + 480, + 435 + ], + "type": "text", + "content": "59. Zhang, X., Matzen, K., Nguyen, V., Yao, D., Zhang, Y., Ng, R.: Synthetic defocus and look-ahead autofocus for casual videography. arXiv preprint arXiv:1905.06326 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 435, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 435, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 133, + 435, + 480, + 479 + ], + "type": "text", + "content": "60. Zhu, Z., Peng, S., Larsson, V., Xu, W., Bao, H., Cui, Z., Oswald, M.R., Pollefeys, M.: Nice-slam: Neural implicit scalable encoding for slam. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12786-12796 (2022)" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 376, + 102 + ], + "type": "text", + "content": "G. Bae, C. Choi, H. Heo, S.M. Kim, and Y.M. Kim" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_content_list.json b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..8c5f656d990157c1a7128e1960953e796537dfc2 --- /dev/null +++ b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_content_list.json @@ -0,0 +1,1941 @@ +[ + { + "type": "text", + "text": "IAM-VFI : Interpolate Any Motion for Video Frame Interpolation with motion complexity map", + "text_level": 1, + "bbox": [ + 217, + 140, + 782, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Kihwan Yoon $^{1}$ , Yong Han Kim $^{1}$ , Sungjei Kim $^{2,\\dagger}$ , and Jinwoo Jeong $^{2,\\dagger}$", + "bbox": [ + 225, + 210, + 777, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 University of Seoul, Seoul 02504, Republic of Korea", + "bbox": [ + 321, + 238, + 681, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Korea Electronics Technology Institute, Gyeonggi-do 13488, Republic of Korea", + "bbox": [ + 230, + 253, + 769, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "rlghksdbsgmail.com", + "bbox": [ + 426, + 268, + 576, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "yhkim@uos.ac.kr", + "bbox": [ + 441, + 282, + 560, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{jw.jeong, sungjei.kim}@keti.re.kr", + "bbox": [ + 369, + 296, + 633, + 309 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "https://github.com/rlghksdsb/IAM-VFI", + "bbox": [ + 359, + 310, + 640, + 323 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Within the video, different regions have varying motion complexity, with simple regions containing static or global motion and complex regions containing fast motion or lots of local motion. In recent years, the performance of flow-based Video Frame Interpolation (VFI) algorithms has improved significantly. However, existing training methods train on randomly cropped regions of train data without considering the complexity of the motion. As a result, they cannot handle all regions of the frame that contain varying motion complexity. To solve this problem, we propose a novel VFI approach (IAM-VFI) that can interpolate any motion by considering the motion complexity of all regions in the frame. First, we propose a training data classification method for motion optimization based on each motion complexity. Then, using the proposed data, a flow estimation network generates optimized results for each complexity. Finally, we propose a Motion Complexity Estimation Network (MCENet) to generate a Motion Complexity Map (MCM) that can estimate the motion complexity of each region. Our proposed methods can be easily applied to most flow-based VFI algorithms. Experimental results show that the proposed method can interpolate any motion and significantly improve the performance of existing VFI algorithms.", + "bbox": [ + 259, + 361, + 743, + 625 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Video Frame Interpolation, Optical Flow Estimation, Region-Aware", + "bbox": [ + 261, + 638, + 751, + 665 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 691, + 375, + 709 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Video Frame Interpolation (VFI) is a challenging low-level vision task that increases the frame rate by generating a non-existent intermediate frame between two consecutive frames. VFI can be applied to various tasks such as video restoration [3], novel view synthesis [7, 41], slow motion generation [14, 23], and frame up-conversion [5], etc. With the development of deep learning, the performance of VFI algorithms has significantly improved.", + "bbox": [ + 212, + 724, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "† Co-corresponding authors.", + "bbox": [ + 217, + 824, + 410, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/afac9481a2cb212cf6366bf4cd5b525dc74f8fbc4b0572bf5ac88885b7d7bcbf.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 225, + 143, + 498, + 234 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/d09ec48dbeec24644bdfdf31b7f2281baf0fc6ef69acf1dd2104d7fb53ba9b7a.jpg", + "image_caption": [ + "GT", + "ALL", + "34.08dB", + "Easy", + "33.28dB", + "Me", + "34.56dB", + "Hard", + "34.47dB", + "Fig. 1: Example of subjective results of based on motion complexity. In the case of (a), the motion complexity between the two input frames is classified as a medium, and the model trained on data classified as medium is the best. In contrast, (b) has a fast motion complexity and the model trained on the hard data shows the best results." + ], + "image_footnote": [ + "(a) Interpolation results for region with medium (b) Interpolation results for region with hard motion complexity motion complexity" + ], + "bbox": [ + 225, + 234, + 498, + 315 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/1207a7e07a5590ef84499033073755b16d69f3886b01332bfd23daa09b06aea5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 447, + 143, + 500, + 234 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/7f36a218f9f6f52f899632671fe8cd6259db169afe830aea28fa9b99737adbbe.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 447, + 234, + 500, + 315 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/64a13211d78d0def9a9810239dc6fa17386873896b8f295fc328978453318801.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 503, + 143, + 777, + 234 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/eb6355d20baf03cfda9609aadf8bf668dec970a580338d1816b245a4ba7eeff0.jpg", + "image_caption": [ + "GT", + "ALL", + "27.72dB", + "Easy", + "23.81dB", + "Medium", + "25.98dB", + "Hard", + "28.13dB" + ], + "image_footnote": [], + "bbox": [ + 503, + 234, + 777, + 315 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Existing VFI algorithms are generally divided into two main categories: kernel-based methods [28, 29] and flow-based methods [16, 17, 39]. Kernel-based methods typically use an adaptive convolution to synthesize intermediate frames by local patches. However, it suffers from a limitation when the motion is larger than the kernel size, which degrades the interpolation results. Furthermore, the memory requirement increases when a large kernel size is used. Flow-based methods, on the other hand, estimate the optical flow between two input frames and synthesize the intermediate frame by warping it with the input frames. Flow-based methods have become promising method in recent years due to advances in flow estimation networks [12, 17, 30].", + "bbox": [ + 212, + 459, + 784, + 611 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Within consecutive frames, the distribution of motion complexity varies, with some regions containing simple motion patterns such as stationary motion, global motion, and linear motion, and others containing complex motion patterns such as occlusion, fast motion, and local motion. However, existing flow-based VFI algorithms typically train using patches that are cropped random regions of the training data. The motion complexity within these patches is randomly distributed from easy to hard. When the complexity is distributed over a wide range, it is not possible to train optimally for each complexity because each complexity interferes with the others. As a result, the interpolation results are degraded because it cannot optimally estimate all motions in a video with varying motion complexity. Therefore, to achieve optimal results for motion in all regions, it is necessary to interpolate by considering information about each motion complexity within the frame.", + "bbox": [ + 212, + 612, + 785, + 808 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To address these issues, we propose IAM-VFI, a method that estimates the motion complexity of each region of the intermediate frames and interpolates for", + "bbox": [ + 214, + 809, + 785, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "all motions based on their complexity. First, we analyzed the relation between existing VFI results and motion complexity to further investigate the problem. Then, based on the analysis results, we propose a data classification method that classifies the training data into three classes (easy, medium, and hard) according to the motion complexity to optimize the motion estimation network of VFI for each motion complexity. As shown in the Fig. 1, we can see that simply training with complexity-classified data improves the results for specific complexities.", + "bbox": [ + 212, + 146, + 782, + 252 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Finally, we propose a Motion Complexity Estimation Network (MCENet) that estimate the complexity of the motion in each region of the intermediate frame and adaptively interpolate all the motions according to their complexity. MCENet generates a Motion Complexity Map (MCM) that represents the motion complexity within a frame. Experimental results show that the proposed method can significantly improve performance when applied to existing VFI algorithms.", + "bbox": [ + 212, + 252, + 784, + 356 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, this paper has the following main contributions:", + "bbox": [ + 238, + 358, + 679, + 372 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We analyse the relation between the motion complexity and the interpolation results and propose a dataset classification method.", + "- We propose the IAM-VFI algorithm that can handle any motion within the frame with varying distributions of motion complexity.", + "- We propose a novel network called MCENet and a complexity loss to generate a MCM that to handle all region within the frame.", + "- The proposed methods can be simply applied to previous flow-based VFI algorithms and achieve significant performance." + ], + "bbox": [ + 240, + 382, + 782, + 502 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 523, + 395, + 539 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Flow-based Video Frame Interpolation", + "text_level": 1, + "bbox": [ + 215, + 554, + 578, + 569 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Deep learning based VFI algorithms typically take two consecutive frames $(I_0, I_1)$ as input and generates the intermediate frame $\\hat{I}_t$ , $0 < t < 1$ through a VFI network $\\phi$ with parameters $\\Theta$ .", + "bbox": [ + 215, + 577, + 782, + 622 + ], + "page_idx": 2 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {I} _ {t} = \\phi \\left(I _ {0}, I _ {1}; \\Theta\\right) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 444, + 632, + 784, + 648 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In recent years, advances in optical flow estimation networks have made flow-based methods become a dominant approach for VFI algorithms. Most flow-based VFI algorithms typically involve as following steps. First estimate optical flows $F_{0\\rightarrow 1},F_{1\\rightarrow 0}$ between two frames through a flow network. Then the flows are warped with the input frames to generate intermediate frame. For warping, some algorithms generate $F_{0\\rightarrow t},F_{1\\rightarrow t}$ by scaling the flow between two frames, and then use forward warping to generate two warped frames $I_{0\\rightarrow t},I_{1\\rightarrow t}$ . However, the problem with forward warping is that it creates holes in the interpolated frame. For this reason, most recent VFI algorithms use backward warping by creating $F_{t\\rightarrow 0},F_{t\\rightarrow 1}$ .", + "bbox": [ + 212, + 657, + 784, + 809 + ], + "page_idx": 2 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {I} _ {0 \\rightarrow t} = \\phi_ {w} \\left(I _ {0}, F _ {0 \\rightarrow t}\\right), \\hat {I} _ {1 \\rightarrow t} = \\phi_ {w} \\left(I _ {1}, F _ {1 \\rightarrow t}\\right) \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 351, + 824, + 782, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $\\phi_w$ is a backward warp operation. Then, generate a temporary intermediate frame $\\tilde{I}_t$ with the two warped frames and the mask obtained by the flow network [17, 36].", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {I} _ {t} = M \\odot \\hat {I} _ {0 \\rightarrow t} + (1 - M) \\odot \\hat {I} _ {1 \\rightarrow t} \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 205, + 785, + 223 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Finally, generate an intermediate frame $\\hat{I}_t$ by adding the estimated residuals $\\beta_t$ using the synthesis network [8,33,39].", + "bbox": [ + 214, + 228, + 782, + 260 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {I} _ {t} = \\tilde {I} _ {t} + \\beta \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 462, + 272, + 785, + 290 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Previous flow-based VFI algorithms suffer from the issues that the receptive field size is limited, and therefore it is challenging to handle fast motion with large pixel displacements or complex videos with occlusion and context details. To address this issues, Sim et al. proposed XVFI, a recursive multi-scale structure for processing 4K video with large motion, and also released the X4K1000FPS dataset with extreme motion [34]. To handle large and complex motion, Jin et al. proposed an EBME [17] that guides the flow through correlation volumes. And various flow networks have been proposed in recent years that utilize pyramid structure [16, 17] to enlarge receptive field, and utilize transformer [24, 40] to capture long-range correspondence. As a result, these methods have achieved impressive results for handling large and complex motions.", + "bbox": [ + 212, + 295, + 784, + 460 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "However, interpolating complex frames with many occlusion regions or various motion distributions within the frame still remains as a challenging problem. In addition, there is the problem of poor performance of interpolation on data other than training data.", + "bbox": [ + 212, + 462, + 784, + 522 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Region-aware Image & Video Restoration", + "text_level": 1, + "bbox": [ + 214, + 544, + 606, + 559 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In a video (or image), each region has various characteristics of spatial complexity, such as edges and noise, and temporal complexity, such as the degree of motion between frames. Therefore, in the restoration task, it is important to understand the characteristics of each region for accurate restoration.", + "bbox": [ + 212, + 568, + 782, + 628 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "As an example of utilizing spatial complexity, Rad et al. proposed SROBB [32], which uses different weights for loss based on the OBB (Object, Background, Boundary) labels within the frame. And Kong et al. proposed ClassSR [20], which categorizes each patch in a frame as easy, medium, or hard based on the PSNR and restores each patch appropriately. Recently, the Segmentation Anything Model (SAM) [18] has been utilized for region aware restoration tasks [15, 37].", + "bbox": [ + 214, + 628, + 784, + 733 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In VFI, it is also important to interpolate the intermediate frame with considering the spatial and temporal characteristics of the video. However, existing VFI algorithms have been interpolating without considering these characteristics. As a result, it is difficult to interpolate all regions of large videos with varying distributions of motion complexity. To address the limitations of existing VFI algorithms, we propose IAM-VFI, a method for interpolating all regions in videos with motion complexity.", + "bbox": [ + 212, + 734, + 784, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/fefd59fa597e1df4d2e8f0c15617de10db3f01cc66fe4dd0af88722a25fb24ac.jpg", + "image_caption": [ + "Fig.2: SI & TI distribution of VFI benchmark" + ], + "image_footnote": [], + "bbox": [ + 228, + 165, + 475, + 309 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/e22e6b583e5cd4b9272b2d13820ca89f212c6bbda483643a4787b2640c834e71.jpg", + "table_caption": [ + "Table 1: Interpolation results of subclips in HD data" + ], + "table_footnote": [], + "table_body": "
NamePSNR
HD DatasetParkrun29.587
Shields36.236
Stockholm35.304
Bluesky41.438
Kimono35.983
Parkscene37.482
Sunflower35.994
Sintel Alley230.452
Sintel Market521.077
Sintel Temple127.57
Sintel Temple223.19
", + "bbox": [ + 537, + 185, + 748, + 354 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Proposed Methods", + "text_level": 1, + "bbox": [ + 215, + 383, + 434, + 402 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we first explore the problems with existing algorithms by analysing the relation between video complexity and VFI results in Sec. 3.1. Then, in Sec. 3.2, we describe a data classification method to address the existing problems. Finally, we describe the overall structure of our proposed IAM-VFI to interpolate any motion within the frame in Sec. 3.3, and describe the proposed MCENet to estimate the motion complexity of each region in Sec. 3.4.", + "bbox": [ + 212, + 420, + 787, + 512 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Relation between Video Complexity & Interpolate results", + "text_level": 1, + "bbox": [ + 215, + 537, + 736, + 555 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We conducted the analysis in this section to explore the limitations of existing algorithms. The algorithm we used for the analysis is RIFE [12], a representative flow-based VFI algorithm. And we used Spatial Information (SI) and Temporal Information (TI) [13] to find the relation between the complexity of the video with the interpolation results. SI and TI are often used to ensure that videos span the appropriate range of spatio-temporal complexity and are used to classify video data according to complexity [9, 35]. It is also used when creating source videos to ensure that the distribution of video complexity is appropriate [2], and recently SI/TI has been used as a feature of deep learning-based video quality metrics [10]. SI is a measure of the amount of spatial detail by computing the sobel filter vertically and horizontally to detect edges within a frame and considering the standard deviation of the detected edges:", + "bbox": [ + 212, + 568, + 787, + 750 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nS I = \\operatorname {s t d} _ {\\text {s p a c e}} [ \\operatorname {S o b e l} \\left(F _ {n}\\right) ] \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 408, + 767, + 785, + 785 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Where $F_{n}$ is the $n_{th}$ frame of the video. Higher SI value indicate that the frame contains more detail are has a higher spatial complexity. TI is a measure of the amount of temporal variation in a video sequence. TI first calculates", + "bbox": [ + 212, + 794, + 785, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/fd019c93d50922aec1787622b1287ff6a7c1c3e9bf3ae83aed99f3d9a1221ab6.jpg", + "image_caption": [ + "(a) Relation between TI and PSNR in HD", + "Fig. 3: Relation between spatiotemporal information (SI/TI) & PSNR" + ], + "image_footnote": [], + "bbox": [ + 256, + 162, + 480, + 333 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/55502ad5020d6c37b1c15097051435ae9449511907989aba09d9e018ef5d7abb.jpg", + "image_caption": [ + "(b) Relation between SI and PSNR in HD" + ], + "image_footnote": [], + "bbox": [ + 513, + 162, + 740, + 333 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "the amount of variation between two adjacent frames by calculating the difference between the current frame and the previous frame, and then considers the standard deviation of the variation to calculate temporal complexity.", + "bbox": [ + 212, + 416, + 787, + 463 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nM _ {n} (i, j) = F _ {n} (i, j) - F _ {n - 1} (i, j) \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 385, + 478, + 785, + 497 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nT I = s t d _ {s p a c e} (M _ {n} (i, j)) \\qquad \\qquad (7)\n$$\n", + "text_format": "latex", + "bbox": [ + 413, + 532, + 785, + 551 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Where $M_{n}$ represents the difference between the current frame $F_{n}$ and the previous frame $F_{n - 1}$ . A higher value of TI indicates that more motion is included between two frames.", + "bbox": [ + 212, + 565, + 787, + 609 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Video complexity is an important factor in VFI, so we analysed the relation between SI/TI and interpolation results to find out the reason why the existing VFI algorithms perform poorly on data that deviates from the characteristics of the training data. As shown in the Fig. 2, we can see that the SI/TI distribution of the Vimeo90K [38] train dataset, which is commonly used for training, contains the entire Vimeo90K test dataset. As a result, the existing training methods perform well on interpolate the Vimeo90K test data. However, some of the subclips in the HD [1] dataset have SI/TI that are out of the distribution of the training data. In this case, we can observe that the PSNR of subclips outside the distribution of the training data degrades in Tab. 1. Based on this, we further analyze the relation between SI/TI and PSNR. As shown in Fig. 3a, PSNR is more closely related to TI, which is important for accurately estimating motion in VFI. It shows that PSNR degrades as the complexity of motion between frames increases. In contrast, SI, the spatial complexity of the interpolation, is not closely related to the interpolation result, as shown in Fig. 3b.", + "bbox": [ + 212, + 613, + 789, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/6327e9f934a48630b7d9eea5968bfeb4feac90e301f33b32a2d2a849bb493f69.jpg", + "image_caption": [ + "Fig. 4: Overview of our IAM-VFI. The Flow Network in stage 1 is the Flow Network of the existing VFI algorithm. It is trained with our proposed easy, medium, and hard datasets, respectively, to optimize for the motion complexity. The Synthesis Network in stage 2 is the synthesis network of the existing VFI algorithm." + ], + "image_footnote": [], + "bbox": [ + 259, + 143, + 743, + 335 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 Data classification Method", + "text_level": 1, + "bbox": [ + 215, + 429, + 482, + 441 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Previous training methods typically train with patches cropped from random regions of the input image. However, the complexity of motion within the patch is also randomized, leading to suboptimal training for each complexity. As a result, it suffers from poor results for videos with varying complexity distribution within the video. To address this problem, we propose a data classification method that classifies the existing training dataset into easy, medium, and hard datasets according to motion complexity based on the analysis of Sec. 3.1.", + "bbox": [ + 212, + 450, + 787, + 556 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "First we created Vimeo90K(X2), which is a $\\times 2$ upsampling of Vimeo90K [38] via EDSR [22] to generate more samples for larger motions, and we use both Vimeo90K and Vimeo90K(X2) data for classification. To avoid training randomly cropped regions, we first overlapped parts of the dataset and cropped them into patches of $256 \\times 256$ size. We then calculated the TI to classify the data based on the motion complexity of each cropped patch. Based on the calculated TI, we set a threshold to divide the number of data into three parts: easy, medium, and hard datasets. The effectiveness of our proposed data classification method can be seen in Sec. 5.1.", + "bbox": [ + 212, + 556, + 787, + 691 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 IAM-VFI Overview", + "text_level": 1, + "bbox": [ + 215, + 712, + 424, + 726 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To identify the motion complexity for each region in the frame and to handle all motion, we propose IAM-VFI. Our proposed IAM-VFI is trained in two stages, as shown in Fig. 4. In the first stage, we train a flow estimate network with easy, medium, and hard datasets, each classified by motion complexity, to perform motion optimization for that complexity. The flow estimation network trained on each data generates optimized frames $\\tilde{I}_t^e,\\tilde{I}_t^m,\\tilde{I}_t^h$ , for each complexity. The generated frames are then concatenated and used as input for the second stage.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/cfdbba4f18ee0a2da2304cf77104b368332388e006273beae4f7f88ef2cee080.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 218, + 143, + 787, + 246 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/b62b2bf105cb092f8e2deb77ab32818fc1288ac7cf82bbd03d8b58974cfe6fb6.jpg", + "image_caption": [ + "Fig. 5: The network structure of Motion Complexity Estimation Network" + ], + "image_footnote": [], + "bbox": [ + 217, + 246, + 535, + 333 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/b4402019809d0f8802678456391052a22985b916c8eaa9bc883f2cc094d193f7.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 535, + 247, + 785, + 333 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {I} _ {t} = \\operatorname {C o n c a t} \\left(\\tilde {I} _ {t} ^ {e}, \\tilde {I} _ {t} ^ {m}, \\tilde {I} _ {t} ^ {h}\\right) \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 413, + 402, + 784, + 420 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The second stage receives each optimized frame as input and generates a Motion Complexity Map $(MCM_{t})$ using a Motion Complexity Estimation Network (MCENet) to estimate the complexity of each region in the intermediate frame. Then perform a linear combination of the generated $MCM_{t}$ and the input image $\\tilde{I}_t$ to generate a temporal intermediate frame $\\hat{I}_t$ . And the generated $MCM_{t}$ is used as input to provide information about the motion complexity to the synthesis network of the existing VFI algorithm to estimate the residual. Finally, the residual is added to the temporal intermediate frame to generate the final interpolated frame $I_t$ .", + "bbox": [ + 212, + 428, + 787, + 565 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Motion Complexity Estimation Network", + "text_level": 1, + "bbox": [ + 214, + 588, + 594, + 603 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We propose MCENet, a network for estimating the motion complexity of each region of the intermediate frames to be interpolated and handling them according to the motion complexity of each region. First, MCENet takes as input $\\tilde{I}_t^e,\\tilde{I}_t^m$ , and $\\tilde{I}_t^h$ , the optimized results for each motion complexity, and generates an $MCM_{t}\\in \\mathbb{R}^{3\\times H\\times W}$ that estimate the motion complexity of the region. The generated $MCM_{t}$ consists of three channels, each representing a probability value for whether this region is close to easy, medium, or hard. We then perform a linear combination of multiplying each channel by the $\\tilde{I}_t^e,\\tilde{I}_t^m$ , and $\\tilde{I}_t^h$ frames respectively to generate $\\hat{I}_t$ , the frame that reflects the complexity. As a result, $MCM_{t}$ also controls the region on the boundary of each class by giving more weight to the most probable values among the three classified easy, medium, and hard values.", + "bbox": [ + 212, + 614, + 787, + 796 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {I} _ {t} = \\sum_ {c \\in e, m, h} M C M _ {t} ^ {c} \\tilde {I} _ {t} ^ {c} \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 809, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We construct MCENet with a U-Net structure for simple application to existing VFI algorithms and propose Motion Attention Block (MAB) for estimating motion complexity more efficiently. The detailed architecture of MCENet and MAB can be seen in Fig. 5.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To effectively train $MCM_{t}$ , we propose a novel loss function, complexity loss. The frame $\\hat{I}_{t}$ generated by the $MCM_{t}$ , contains information about the complexity of the motion in each region. Therefore, it is not effective to use a loss function to reduce the error with GT, which does not contain information about complexity. For this reason we generate $MCM_{gt}$ , which contains information about the complexity of the motion. To generate the $MCM_{gt}$ , we compute the error between the optimized frame and the ground truth for each pixel by motion complexity. We then assign a 1 to the channel of the $MCM_{gt}$ that represents the class with the minimum error at each pixel, and a 0 to the other channels. This allows the $MCM_{gt}$ to represent the best motion complexity class at each pixel.", + "bbox": [ + 212, + 207, + 784, + 371 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\nM C M _ {g t} ^ {c} (i, j) = \\left\\{ \\begin{array}{l l} 1, & \\text {i f} c = \\underset {c \\in \\{e, m, h \\}} {\\operatorname {a r g m i n}} \\left(\\left| g t (i, j) - \\tilde {I} _ {t} ^ {c} (i, j) \\right|\\right) \\\\ 0, & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 295, + 383, + 784, + 433 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Finally, we compute a linear combination of the generated MCM and each frame to generate $\\hat{I}_{MCM}$", + "bbox": [ + 214, + 438, + 782, + 469 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {I} _ {M C M} = \\sum_ {c \\in \\{e, m, h \\}} M C M _ {g t} ^ {c} \\tilde {I} _ {t} ^ {c} \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 400, + 482, + 784, + 513 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We update the $MCM_{t}$ by taking the L1 loss between two frames $\\hat{I}_{t}$ and $\\hat{I}_{MCM}$ that contain the motion complexity.", + "bbox": [ + 214, + 522, + 782, + 555 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {c} = \\left\\| \\hat {I} _ {t} - \\hat {I} _ {M C M} \\right\\| _ {1} \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 429, + 566, + 784, + 584 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The effect on $\\mathcal{L}_c$ was verified in Sec. 5.3.", + "bbox": [ + 214, + 593, + 506, + 608 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiment", + "text_level": 1, + "bbox": [ + 214, + 632, + 366, + 648 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Implement details", + "text_level": 1, + "bbox": [ + 214, + 664, + 411, + 679 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Training Dataset. We first trained the flow network using the classified datasets introduced in Sec. 3.2. Then, we freeze the flow network and trained the MCENet and synthesis network. Since the classified datasets are the data proposed to optimize each motion, we used the original Vimeo90K to train MCENet and synthesis network. The Vimeo90K data consists of 51,312 triplets and has a resolution of $448 \\times 256$ .", + "bbox": [ + 212, + 688, + 784, + 777 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Training Strategy. We applied the proposed methods to the flow-based algorithms RIFE [12] and EMA-VFI [40]. The experiments were implemented based on the official code presented in the paper. For both proposed stages, we used the same optimization techniques such as batch size, optimizer, scheduler, and", + "bbox": [ + 212, + 779, + 784, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "learning rate as used in RIFE and EMA-VFI, and trained for the same iterations. Our training was performed on a single NVIDIA RTX A6000.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Loss Function. In the first stage, we used the same loss function used in the original networks for training the flow estimation network. In the second step, we used $\\mathcal{L}_{syn}$ , the reconstruction loss used to train synthesis network in RIFE and EMA-VFI, and $\\mathcal{L}_c$ , the loss function proposed in Sec. 3.4 to train the MCENet.", + "bbox": [ + 212, + 176, + 784, + 237 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {t o t a l}} = \\lambda_ {s} \\mathcal {L} _ {\\text {s y n}} + \\lambda_ {f} \\mathcal {L} _ {c} \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 413, + 252, + 785, + 268 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "where we set $\\lambda_s = 0.5$ , $\\lambda_f = 0.5$ to balance the loss values.", + "bbox": [ + 214, + 272, + 635, + 287 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Benchmarks and Evaluation Metrics", + "text_level": 1, + "bbox": [ + 214, + 306, + 562, + 321 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Our proposed methods are to handle various motion complexities. Therefore, we evaluated our proposed method on the following datasets with various motion complexities.", + "bbox": [ + 212, + 328, + 782, + 372 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "SNU-FILM [4] : 1280x720 resolution with a total of 1240 frames, categorized into easy, medium, hard, and extreme according to the motion magnitude.", + "bbox": [ + 212, + 375, + 782, + 402 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "HD [1] : It consists of 11 videos. The HD dataset consists of four 1080p, three 720p and four 544p videos, and we used the first 100 frames of each video", + "bbox": [ + 212, + 404, + 782, + 431 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "UVG [25]: It consists of 7 videos with 3840x2160 resolution, and we used the first 300 frames of each video.", + "bbox": [ + 212, + 434, + 782, + 463 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Xiph [26]: It contains 19 video sequences, each consisting of 31 consecutive 4K resolution frames. We followed [27] method to downsample and center-crop the 4K images to create a 2K resolution and evaluate both Xiph4K and Xiph2K.", + "bbox": [ + 212, + 464, + 784, + 508 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Metrics. We used Peak Signal-To-Noise Ratio (PSNR) and Structural-Similarity-Image-Metric (SSIM), commonly used objective quality metrics, where a higher PSNR and SSIM indicate better quality. To evaluate runtime, we measured all algorithms at 720p resolution to be fair, and we used a single NVIDIA RTX A6000 GPU.", + "bbox": [ + 212, + 508, + 789, + 583 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5 Results", + "text_level": 1, + "bbox": [ + 214, + 604, + 323, + 619 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.1 Data Classification method", + "text_level": 1, + "bbox": [ + 214, + 633, + 485, + 647 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We first validate our proposed data classification method. The proposed method aims to optimize for the complexity of each motion, so we exclude the influence", + "bbox": [ + 212, + 655, + 782, + 686 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/919bf27fa8365c033f31b4896f8d2a26608ce6bf80b5bae53263228632265d2e.jpg", + "table_caption": [ + "Table 2: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR value)" + ], + "table_footnote": [], + "table_body": "
Benchmark Train DataVimeo90KUVG
easymediumhardeasymediumhard
Vimeo90K43.54336.49532.13148.33836.31730.052
Ourseasy43.95536.40231.72749.02736.29129.338
Oursmedium43.95137.01232.58848.50936.85130.289
Ourshard43.63236.99132.72147.83136.81530.611
", + "bbox": [ + 263, + 750, + 738, + 838 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/ef0ba9afdfdb88a55e863727d627645488bcbbb89c645286c4e1f85cf94c4736.jpg", + "table_caption": [ + "Table 3: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR/SSIM values within each dataset and Blue indicates second best and Green indicates third best.) We followed the test procedures of [12] for HD, [19] for SNU-FILM, and [11] for Xiph to ensure a fair comparison. \"OOM\" indicates \"Out of Memory\" and \"+\" indicates the results we obtained by retraining to compare results." + ], + "table_footnote": [], + "table_body": "
AlgorithmHDSNU-FILMUVGXiph
EasyMediumHardExtreme2K4K
SepConv [29]30.87/0.93039.41/0.99034.97/0.97629.36/0.92524.31/0.84426.11/0.86434.77/0.92932.06/0.880
CAIN [4]31.45/0.93939.91/0.99035.57/0.97729.87/0.92924.73/0.85030.32/0.90235.21/0.93732.56/0.901
AdaCoF [21]31.43/0.93339.84/0.99035.07/0.97529.47/0.92424.31/0.843OOM34.86/0.92832.19/0.882
CDFI [6]31.46/0.93740.11/0.99035.51/0.97729.74/0.92724.54/0.847OOM35.48/0.94032.47/0.903
ABME [31]32.17/0.94339.59/0.99035.51/0.97829.47/0.93625.23/0.863OOM35.18/0.96432.36/0.940
IFRNet [19]32.15/0.94340.02/0.99035.93/0.97930.40/0.93525.05/0.85831.33/0.90436.24/0.96433.38/0.941
M2M-PWC [11]31.23/0.93739.59/0.99035.68/0.97930.27/0.93625.07/0.86030.89/0.91036.40/0.96733.77/0.943
VFIformer [24]OOM40.12/0.99136.09/0.98030.67/0.93725.20/0.863OOMOOMOOM
EBME [17]32.44/0.94539.98/0.99135.74/0.97930.40/0.93525.24/0.86131.79/0.91536.33/0.96533.71/0.942
RIFE† [12]32.08/0.94239.98/0.99035.78/0.97830.14/0.93324.84/0.85331.13/0.90036.15/0.96433.25/0.940
RIFEours32.46/0.94640.18/0.99136.05/0.98030.58/0.93725.35/0.86332.17/0.91736.60/0.96634.20/0.946
EMA-VFI† [40]32.62/0.94840.17/0.99135.97/0.97930.64/0.93525.27/0.85731.19/0.90736.71/0.96633.69/0.944
EMA-VFIours32.89/0.95140.28/0.99236.30/0.98130.88/0.93825.59/0.86432.12/0.91637.01/0.96834.29/0.947
", + "bbox": [ + 220, + 215, + 787, + 421 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "of synthesis networks for accurate validation. We use the proposed easy, medium, and hard datasets to train IFNet, the flow network of RIFE. And warped the estimated flows and input frames then generate temporal intermediate frames using Eq. (3). The Benchmark used for validation was Vimeo90K test and UVG, and was divided into 256x256 patches to avoid varying complexity within the region and the TI of each patch was calculated and classified as easy, medium, or hard.", + "bbox": [ + 212, + 441, + 782, + 545 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "As shown in Tab. 2, we can see that the training with the complexity classified data optimizes the motion estimation performance, resulting in improved PSNR compared to the results trained with the original dataset. This result shows that classification by complexity is effective in optimizing motion.", + "bbox": [ + 212, + 547, + 784, + 609 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.2 Comparison with the State-of-the-Art Methods", + "text_level": 1, + "bbox": [ + 215, + 632, + 653, + 648 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To compare the proposed methods, we used the kernel-based algorithms SepConv [29], AdaCoF [21], and CDFI [6], the flow-based algorithms ABME [31], IFRNet [19], M2M-PWC [11], VFformer [24], EBME [17], and the other method CAIN [4]. We applied our methods to the flow-based algorithms RIFE [12] and EMAVFI [40].", + "bbox": [ + 212, + 657, + 782, + 733 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tab. 3 summarizes the quantitative comparison with existing VFI algorithms on various benchmarks to show the effectiveness of the proposed methods. The performance of the original RIFE is slightly worse compared to the state-of-the-art algorithms, but we can see that our proposed method improves performance on all benchmarks. In particular, for UVG and Xiph4K, which are high-resolution videos with various motion complexity, we can see the PSNR improvements of 1.04 dB and 0.95 dB, respectively, with the best results for UVG data", + "bbox": [ + 212, + 734, + 784, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/81bf6288cf6d90bbd9ae1cb23a2ef93b1afab7183c9c01e7a530c5e0b4928605.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 217, + 143, + 785, + 334 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/c15a4b2c9d9f510fbf3370f92f2677b6cb8566283a6ec7374d2d60d3976f856a.jpg", + "image_caption": [ + "(a) Visual comparison of IAM-VFI applied to EMA-VFI with the SOTA algorithm", + "(b) Visual comparison of IAM-VFI applied to RIFE with the SOTA algorithm", + "Fig. 6: Visual comparison on extreme subset of SNU-FILM [4] and HD [1] benchmarks." + ], + "image_footnote": [], + "bbox": [ + 217, + 353, + 785, + 563 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "compared to the state-of-the-art algorithms. Other benchmarks also achieved second or third best results. And when the IAM-VFI method is applied to the recently proposed EMA-VFI, we can see that it achieves the best performance in all benchmarks except UVG, with an improvement of 0.93 dB in UVG and 0.60 dB in Xiph4K compared to the original algorithm.", + "bbox": [ + 212, + 651, + 787, + 727 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Fig. 6, we compare the subjective image quality of the results of applying IAM-VFI to RIFE and EMA-VFI with other algorithms. In the first column of Fig. 6a, we can see that IAM-VFI can handle large motions and the second column demonstrated that images with complex motion and detail are also improved. In the first column of Fig. 6b, the occlusion regions of the object and background are sharply interpolated and the face is interpolated clearly. And in the second column, the edge regions are also interpolated sharply.", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/23d632b9af9ffeda68aee26f37c8f32accdb6a3172081502217d85f36811f119.jpg", + "image_caption": [ + "Fig. 7: Subjective image quality comparison for the effectiveness of MCM. The first column shows, from left, the overlap of the two input images, each channel of the $MCM_{t}$ representing the probabilities of easy, medium, and hard, and the interpolation results of the original RIFE. The second column shows, from left, the ground truth of the intermediate frames to be interpolated, the intermediate frames optimized to easy, medium and hard using the data classification method, and the interpolation results of IAM-VFI." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 785, + 364 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.3 Ablation Studies", + "text_level": 1, + "bbox": [ + 215, + 507, + 401, + 522 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We performed the ablation study to demonstrate the effectiveness of the proposed methods. For comparison, we used all benchmark datasets and compared the inference time of applying the proposed method to the existing VFI algorithm. In Tab. 4, the baseline without applying all the proposed methods is the original RIFE [12] algorithm.", + "bbox": [ + 212, + 537, + 785, + 611 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effect of MCENet. The second column is the result of simply weighting each of the frames optimized for each class by the classified data by 0.33. We can see that the PSNR degrades for most of the benchmarks because we do not take into account the complexity of each region. In contrast, when we generate an $MCM_{t}$ using MCENet to estimate the complexity of each region and adaptively weight each region, we see that performance improves compared to the baseline for all benchmarks.", + "bbox": [ + 212, + 612, + 785, + 717 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In Fig. 7, we can see the optimized results for each motion and a visualisation of each channel of the $MCM_{t}$ generated by MCENet. We can see that the regions with large motion are classified as hard motion complexity, and the optimized result with hard data interpolates the large motion regions clearly. Also in the occlusion region, we can see that the motion complexity is classified as hard due to the different motion of the two overlapped objects, and the edges are sharply interpolated. And global motions are classified as easy or medium. Finally, when small objects such as branches move, the distribution of their motions varies,", + "bbox": [ + 212, + 719, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/b3ba07c18b76cb1a44529d0ff3a5b5a1af21561a1d899d24a81bbf5391121922.jpg", + "table_caption": [ + "Table 4: Ablation studies for our proposed methods. M.O stands for Motion Optimisation with classified data. (Red indicates the best PSNR)." + ], + "table_footnote": [], + "table_body": "
M.OMCENetLcMABSynMCMHDSNU-FILMUVGXiphRuntime
EasyMediumHardExtreme2K4K
×××××32.0839.9835.7830.1424.8331.1336.1533.2548.3ms
✓××××31.9738.3935.1530.2225.2331.6035.8033.6068.3ms
✓✓×××32.3240.0536.0330.5925.3532.0236.3333.9278.7ms
✓✓✓××32.4240.1136.0430.5825.3432.0836.5634.0678.7ms
✓✓✓✓×32.4540.1436.0530.5925.3532.1536.6034.1282.7ms
✓✓✓✓✓32.4640.1836.0830.6025.3532.1736.6034.2087.5ms
", + "bbox": [ + 220, + 184, + 785, + 285 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "so they are classified as complex motions, and you can see that the previously blurred parts are interpolated clearly.", + "bbox": [ + 212, + 316, + 782, + 345 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Effect of Motion Complexity Loss. The $\\hat{I}_t$ generated by $MCM_t$ contains information about the complexity of each regions. Therefore, we can see that using the loss function for frames with complexity information reflected through $MCM_{qt}$ rather than using the loss with GT is effective.", + "bbox": [ + 212, + 345, + 782, + 406 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Effect of MAB. Each channel of MCM represents the probability value for whether the complexity of the corresponding area falls into easy, medium, or hard. Therefore, the PSNR is improved when MAB is used in MCENet to give attention for each channel.", + "bbox": [ + 212, + 407, + 782, + 465 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Synthesis Network with MCM. Using the $MCM_{t}$ as an additional input to the synthesis network to provide information about motion complexity can improve performance on most of the benchmarks.", + "bbox": [ + 212, + 467, + 782, + 512 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5.4 Limitations", + "text_level": 1, + "bbox": [ + 215, + 542, + 356, + 556 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "By applying the proposed method to the existing algorithm, we achieved a significant improvement in interpolation results, but it still has several limitations. First, the flow network needs to be trained for each classified dataset to optimize for motion, resulting in increased training time. Second, compared to the existing network, the runtime increases. In future work, we will attempt to optimize for all motion complexities using a single flownet.", + "bbox": [ + 212, + 574, + 782, + 664 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 695, + 359, + 710 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This paper aims to address the problem that existing VFI algorithms do not consider motion complexity and therefore fail to perform optimally for all regions. We solve this problem by combining three intermediate frames, which are derived by different flow networks, with motion complexity map. Experimental results show that the proposed method of interpolating frame by considering motion complexity improves the interpolation performance of existing VFI algorithms and achieves enhanced quality for all regions in the video.", + "bbox": [ + 212, + 733, + 782, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2021-0-00087, Development of high-quality conversion technology for SD/HD low-quality media)", + "bbox": [ + 212, + 178, + 782, + 239 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 263, + 321, + 279 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bao, W., Lai, W.S., Zhang, X., Gao, Z., Yang, M.H.: Memc-net: Motion estimation and motion compensation driven neural network for video interpolation and enhancement. IEEE transactions on pattern analysis and machine intelligence 43(3), 933-948 (2019)", + "2. Barman, N., Zadtootaghaj, S., Schmidt, S., Martini, M.G., Möller, S.: Gamingvideoset: a dataset for gaming video streaming applications. In: 2018 16th Annual Workshop on Network and Systems Support for Games (NetGames). pp. 1-6. IEEE (2018)", + "3. Brooks, T., Barron, J.T.: Learning to synthesize motion blur. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6840-6848 (2019)", + "4. Choi, M., Kim, H., Han, B., Xu, N., Lee, K.M.: Channel attention is all you need for video frame interpolation. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 10663-10671 (2020)", + "5. Dar, Y., Bruckstein, A.M.: Motion-compensated coding and frame rate upconversion: Models and analysis. IEEE Transactions on Image Processing 24(7), 2051-2066 (2015)", + "6. Ding, T., Liang, L., Zhu, Z., Zharkov, I.: Cdfi: Compression-driven network design for frame interpolation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8001-8011 (2021)", + "7. Flynn, J., Neulander, I., Philbin, J., Snavely, N.: Deepstereo: Learning to predict new views from the world's imagery. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5515-5524 (2016)", + "8. Fourure, D., Emonet, R., Fromont, E., Muselet, D., Tremeau, A., Wolf, C.: Residual conv-deconv grid network for semantic segmentation. arXiv preprint arXiv:1707.07958 (2017)", + "9. Fremerey, S., Goring, S., Rao, R.R.R., Huang, R., Raake, A.: Subjective test dataset and meta-data-based models for $360^{\\circ}$ streaming video quality. In: 2020 IEEE 22nd International Workshop on Multimedia Signal Processing (MMSP). pp. 1-6. IEEE (2020)", + "10. Göring, S., Rao, R.R.R., Feiten, B., Raake, A.: Modular framework and instances of pixel-based video quality models for uhd-1/4k. IEEE Access 9, 31842-31864 (2021)", + "11. Hu, P., Niklaus, S., Sclaroff, S., Saenko, K.: Many-to-many splatting for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3553-3562 (2022)", + "12. Huang, Z., Zhang, T., Heng, W., Shi, B., Zhou, S.: Real-time intermediate flow estimation for video frame interpolation. In: European Conference on Computer Vision. pp. 624-642. Springer (2022)" + ], + "bbox": [ + 218, + 295, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "13. Installations, T., Line, L.: Subjective video quality assessment methods for multimedia applications. Networks 910(37), 5 (1999)", + "14. Jiang, H., Sun, D., Jampani, V., Yang, M.H., Learned-Miller, E., Kautz, J.: Super slomo: High quality estimation of multiple intermediate frames for video interpolation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 9000-9008 (2018)", + "15. Jiang, J., Holz, C.: Restore anything pipeline: Segment anything meets image restoration. arXiv preprint arXiv:2305.13093 (2023)", + "16. Jin, X., Wu, L., Chen, J., Chen, Y., Koo, J., Hahm, C.h.: A unified pyramid recurrent network for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1578-1587 (2023)", + "17. Jin, X., Wu, L., Shen, G., Chen, Y., Chen, J., Koo, J., Hahm, C.h.: Enhanced bidirectional motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5049-5057 (2023)", + "18. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)", + "19. Kong, L., Jiang, B., Luo, D., Chu, W., Huang, X., Tai, Y., Wang, C., Yang, J.: Ifrnet: Intermediate feature refine network for efficient frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1969-1978 (2022)", + "20. Kong, X., Zhao, H., Qiao, Y., Dong, C.: Classsr: A general framework to accelerate super-resolution networks by data characteristic. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12016-12025 (2021)", + "21. Lee, H., Kim, T., Chung, T.y., Pak, D., Ban, Y., Lee, S.: Adacof: Adaptive collaboration of flows for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5316-5325 (2020)", + "22. Lim, B., Son, S., Kim, H., Nah, S., Mu Lee, K.: Enhanced deep residual networks for single image super-resolution. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 136-144 (2017)", + "23. Liu, Z., Yeh, R.A., Tang, X., Liu, Y., Agarwala, A.: Video frame synthesis using deep voxel flow. In: Proceedings of the IEEE international conference on computer vision. pp. 4463-4471 (2017)", + "24. Lu, L., Wu, R., Lin, H., Lu, J., Jia, J.: Video frame interpolation with transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3532-3542 (2022)", + "25. Mercat, A., Viitanen, M., Vanne, J.: Uvg dataset: 50/120fps 4k sequences for video codec analysis and development. In: Proceedings of the 11th ACM Multimedia Systems Conference. pp. 297-302 (2020)", + "26. Montgomery, C., Lars, H.: Xiph.org video test media (derf's collection). Online, https://media.xiph.org/video/derf 6 (1994)", + "27. Niklaus, S., Liu, F.: Softmax splatting for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5437-5446 (2020)", + "28. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017)", + "29. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017)" + ], + "bbox": [ + 217, + 147, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "K. Yoon et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "30. Park, J., Ko, K., Lee, C., Kim, C.S.: Bmbc: Bilateral motion estimation with bilateral cost volume for video interpolation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 109-125. Springer (2020)", + "31. Park, J., Lee, C., Kim, C.S.: Asymmetric bilateral motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14539-14548 (2021)", + "32. Rad, M.S., Bozorgtabar, B., Marti, U.V., Basler, M., Ekenel, H.K., Thiran, J.P.: Srobb: Targeted perceptual loss for single image super-resolution. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 2710-2719 (2019)", + "33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)", + "34. Sim, H., Oh, J., Kim, M.: Xvfi: extreme video frame interpolation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 14489-14498 (2021)", + "35. Song, L., Tang, X., Zhang, W., Yang, X., Xia, P.: The sjtu 4k video sequence dataset. In: 2013 Fifth International Workshop on Quality of Multimedia Experience (QoMEX). pp. 34-35. IEEE (2013)", + "36. Sun, D., Yang, X., Liu, M.Y., Kautz, J.: Pwc-net: Cnns for optical flow using pyramid, warping, and cost volume. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 8934-8943 (2018)", + "37. Xiao, Z., Bai, J., Lu, Z., Xiong, Z.: A dive into sam prior in image restoration. arXiv preprint arXiv:2305.13620 (2023)", + "38. Xue, T., Chen, B., Wu, J., Wei, D., Freeman, W.T.: Video enhancement with task-oriented flow. International Journal of Computer Vision 127, 1106-1125 (2019)", + "39. Yoon, K., Huh, J., Kim, Y.H., Kim, S., Jeong, J.: Textural detail preservation network for video frame interpolation. IEEE Access (2023)", + "40. Zhang, G., Zhu, Y., Wang, H., Chen, Y., Wu, G., Wang, L.: Extracting motion and appearance via inter-frame attention for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5682-5692 (2023)", + "41. Zhou, T., Tulsiani, S., Sun, W., Malik, J., Efros, A.A.: View synthesis by appearance flow. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part IV 14. pp. 286-301. Springer (2016)" + ], + "bbox": [ + 212, + 146, + 787, + 674 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Interpolate Any Motion for Video Frame Interpolation", + "bbox": [ + 367, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_model.json b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_model.json new file mode 100644 index 0000000000000000000000000000000000000000..6df58ef3988816ddda505f84815f5d828f3cc10e --- /dev/null +++ b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_model.json @@ -0,0 +1,2665 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.218, + 0.141, + 0.784, + 0.187 + ], + "angle": 0, + "content": "IAM-VFI : Interpolate Any Motion for Video Frame Interpolation with motion complexity map" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.212, + 0.778, + 0.229 + ], + "angle": 0, + "content": "Kihwan Yoon\\(^{1}\\), Yong Han Kim\\(^{1}\\), Sungjei Kim\\(^{2,\\dagger}\\), and Jinwoo Jeong\\(^{2,\\dagger}\\)" + }, + { + "type": "text", + "bbox": [ + 0.322, + 0.239, + 0.682, + 0.254 + ], + "angle": 0, + "content": "1 University of Seoul, Seoul 02504, Republic of Korea" + }, + { + "type": "text", + "bbox": [ + 0.232, + 0.254, + 0.77, + 0.269 + ], + "angle": 0, + "content": "\\(^{2}\\) Korea Electronics Technology Institute, Gyeonggi-do 13488, Republic of Korea" + }, + { + "type": "text", + "bbox": [ + 0.427, + 0.27, + 0.578, + 0.283 + ], + "angle": 0, + "content": "rlghksdbsgmail.com" + }, + { + "type": "text", + "bbox": [ + 0.442, + 0.284, + 0.561, + 0.296 + ], + "angle": 0, + "content": "yhkim@uos.ac.kr" + }, + { + "type": "text", + "bbox": [ + 0.37, + 0.297, + 0.635, + 0.31 + ], + "angle": 0, + "content": "{jw.jeong, sungjei.kim}@keti.re.kr" + }, + { + "type": "text", + "bbox": [ + 0.361, + 0.311, + 0.641, + 0.324 + ], + "angle": 0, + "content": "https://github.com/rlghksdsb/IAM-VFI" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.362, + 0.744, + 0.626 + ], + "angle": 0, + "content": "Abstract. Within the video, different regions have varying motion complexity, with simple regions containing static or global motion and complex regions containing fast motion or lots of local motion. In recent years, the performance of flow-based Video Frame Interpolation (VFI) algorithms has improved significantly. However, existing training methods train on randomly cropped regions of train data without considering the complexity of the motion. As a result, they cannot handle all regions of the frame that contain varying motion complexity. To solve this problem, we propose a novel VFI approach (IAM-VFI) that can interpolate any motion by considering the motion complexity of all regions in the frame. First, we propose a training data classification method for motion optimization based on each motion complexity. Then, using the proposed data, a flow estimation network generates optimized results for each complexity. Finally, we propose a Motion Complexity Estimation Network (MCENet) to generate a Motion Complexity Map (MCM) that can estimate the motion complexity of each region. Our proposed methods can be easily applied to most flow-based VFI algorithms. Experimental results show that the proposed method can interpolate any motion and significantly improve the performance of existing VFI algorithms." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.639, + 0.752, + 0.666 + ], + "angle": 0, + "content": "Keywords: Video Frame Interpolation, Optical Flow Estimation, Region-Aware" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.693, + 0.377, + 0.71 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.725, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Video Frame Interpolation (VFI) is a challenging low-level vision task that increases the frame rate by generating a non-existent intermediate frame between two consecutive frames. VFI can be applied to various tasks such as video restoration [3], novel view synthesis [7, 41], slow motion generation [14, 23], and frame up-conversion [5], etc. With the development of deep learning, the performance of VFI algorithms has significantly improved." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.411, + 0.84 + ], + "angle": 0, + "content": "† Co-corresponding authors." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.127 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "image", + "bbox": [ + 0.227, + 0.144, + 0.499, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.227, + 0.236, + 0.499, + 0.316 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.248, + 0.318, + 0.26, + 0.326 + ], + "angle": 0, + "content": "GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.299, + 0.318, + 0.322, + 0.326 + ], + "angle": 0, + "content": "ALL" + }, + { + "type": "image_caption", + "bbox": [ + 0.293, + 0.326, + 0.325, + 0.333 + ], + "angle": 0, + "content": "34.08dB" + }, + { + "type": "image_caption", + "bbox": [ + 0.352, + 0.318, + 0.374, + 0.326 + ], + "angle": 0, + "content": "Easy" + }, + { + "type": "image_caption", + "bbox": [ + 0.349, + 0.326, + 0.379, + 0.333 + ], + "angle": 0, + "content": "33.28dB" + }, + { + "type": "image_caption", + "bbox": [ + 0.394, + 0.318, + 0.417, + 0.326 + ], + "angle": 0, + "content": "Me" + }, + { + "type": "image_caption", + "bbox": [ + 0.403, + 0.326, + 0.434, + 0.333 + ], + "angle": 0, + "content": "34.56dB" + }, + { + "type": "image", + "bbox": [ + 0.449, + 0.144, + 0.501, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.449, + 0.236, + 0.501, + 0.316 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.461, + 0.318, + 0.483, + 0.326 + ], + "angle": 0, + "content": "Hard" + }, + { + "type": "image_caption", + "bbox": [ + 0.461, + 0.326, + 0.491, + 0.333 + ], + "angle": 0, + "content": "34.47dB" + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.144, + 0.778, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.236, + 0.778, + 0.316 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.521, + 0.318, + 0.534, + 0.326 + ], + "angle": 0, + "content": "GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.569, + 0.318, + 0.599, + 0.326 + ], + "angle": 0, + "content": "ALL" + }, + { + "type": "image_caption", + "bbox": [ + 0.569, + 0.326, + 0.6, + 0.333 + ], + "angle": 0, + "content": "27.72dB" + }, + { + "type": "image_caption", + "bbox": [ + 0.628, + 0.318, + 0.651, + 0.326 + ], + "angle": 0, + "content": "Easy" + }, + { + "type": "image_caption", + "bbox": [ + 0.625, + 0.326, + 0.656, + 0.333 + ], + "angle": 0, + "content": "23.81dB" + }, + { + "type": "image_caption", + "bbox": [ + 0.679, + 0.318, + 0.711, + 0.326 + ], + "angle": 0, + "content": "Medium" + }, + { + "type": "image_caption", + "bbox": [ + 0.68, + 0.326, + 0.711, + 0.333 + ], + "angle": 0, + "content": "25.98dB" + }, + { + "type": "image_caption", + "bbox": [ + 0.74, + 0.318, + 0.762, + 0.326 + ], + "angle": 0, + "content": "Hard" + }, + { + "type": "image_caption", + "bbox": [ + 0.735, + 0.326, + 0.766, + 0.333 + ], + "angle": 0, + "content": "28.13dB" + }, + { + "type": "image_footnote", + "bbox": [ + 0.225, + 0.338, + 0.778, + 0.36 + ], + "angle": 0, + "content": "(a) Interpolation results for region with medium (b) Interpolation results for region with hard motion complexity motion complexity" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.372, + 0.785, + 0.427 + ], + "angle": 0, + "content": "Fig. 1: Example of subjective results of based on motion complexity. In the case of (a), the motion complexity between the two input frames is classified as a medium, and the model trained on data classified as medium is the best. In contrast, (b) has a fast motion complexity and the model trained on the hard data shows the best results." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.785, + 0.612 + ], + "angle": 0, + "content": "Existing VFI algorithms are generally divided into two main categories: kernel-based methods [28, 29] and flow-based methods [16, 17, 39]. Kernel-based methods typically use an adaptive convolution to synthesize intermediate frames by local patches. However, it suffers from a limitation when the motion is larger than the kernel size, which degrades the interpolation results. Furthermore, the memory requirement increases when a large kernel size is used. Flow-based methods, on the other hand, estimate the optical flow between two input frames and synthesize the intermediate frame by warping it with the input frames. Flow-based methods have become promising method in recent years due to advances in flow estimation networks [12, 17, 30]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.787, + 0.809 + ], + "angle": 0, + "content": "Within consecutive frames, the distribution of motion complexity varies, with some regions containing simple motion patterns such as stationary motion, global motion, and linear motion, and others containing complex motion patterns such as occlusion, fast motion, and local motion. However, existing flow-based VFI algorithms typically train using patches that are cropped random regions of the training data. The motion complexity within these patches is randomly distributed from easy to hard. When the complexity is distributed over a wide range, it is not possible to train optimally for each complexity because each complexity interferes with the others. As a result, the interpolation results are degraded because it cannot optimally estimate all motions in a video with varying motion complexity. Therefore, to achieve optimal results for motion in all regions, it is necessary to interpolate by considering information about each motion complexity within the frame." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "To address these issues, we propose IAM-VFI, a method that estimates the motion complexity of each region of the intermediate frames and interpolates for" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.253 + ], + "angle": 0, + "content": "all motions based on their complexity. First, we analyzed the relation between existing VFI results and motion complexity to further investigate the problem. Then, based on the analysis results, we propose a data classification method that classifies the training data into three classes (easy, medium, and hard) according to the motion complexity to optimize the motion estimation network of VFI for each motion complexity. As shown in the Fig. 1, we can see that simply training with complexity-classified data improves the results for specific complexities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.785, + 0.357 + ], + "angle": 0, + "content": "Finally, we propose a Motion Complexity Estimation Network (MCENet) that estimate the complexity of the motion in each region of the intermediate frame and adaptively interpolate all the motions according to their complexity. MCENet generates a Motion Complexity Map (MCM) that represents the motion complexity within a frame. Experimental results show that the proposed method can significantly improve performance when applied to existing VFI algorithms." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.359, + 0.68, + 0.373 + ], + "angle": 0, + "content": "In summary, this paper has the following main contributions:" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.383, + 0.784, + 0.413 + ], + "angle": 0, + "content": "- We analyse the relation between the motion complexity and the interpolation results and propose a dataset classification method." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.413, + 0.784, + 0.442 + ], + "angle": 0, + "content": "- We propose the IAM-VFI algorithm that can handle any motion within the frame with varying distributions of motion complexity." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.443, + 0.784, + 0.472 + ], + "angle": 0, + "content": "- We propose a novel network called MCENet and a complexity loss to generate a MCM that to handle all region within the frame." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.473, + 0.784, + 0.503 + ], + "angle": 0, + "content": "- The proposed methods can be simply applied to previous flow-based VFI algorithms and achieve significant performance." + }, + { + "type": "list", + "bbox": [ + 0.241, + 0.383, + 0.784, + 0.503 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.524, + 0.396, + 0.54 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.555, + 0.579, + 0.57 + ], + "angle": 0, + "content": "2.1 Flow-based Video Frame Interpolation" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.578, + 0.784, + 0.623 + ], + "angle": 0, + "content": "Deep learning based VFI algorithms typically take two consecutive frames \\((I_0, I_1)\\) as input and generates the intermediate frame \\(\\hat{I}_t\\), \\(0 < t < 1\\) through a VFI network \\(\\phi\\) with parameters \\(\\Theta\\)." + }, + { + "type": "equation", + "bbox": [ + 0.445, + 0.633, + 0.785, + 0.65 + ], + "angle": 0, + "content": "\\[\n\\hat {I} _ {t} = \\phi \\left(I _ {0}, I _ {1}; \\Theta\\right) \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.785, + 0.81 + ], + "angle": 0, + "content": "In recent years, advances in optical flow estimation networks have made flow-based methods become a dominant approach for VFI algorithms. Most flow-based VFI algorithms typically involve as following steps. First estimate optical flows \\( F_{0\\rightarrow 1},F_{1\\rightarrow 0} \\) between two frames through a flow network. Then the flows are warped with the input frames to generate intermediate frame. For warping, some algorithms generate \\( F_{0\\rightarrow t},F_{1\\rightarrow t} \\) by scaling the flow between two frames, and then use forward warping to generate two warped frames \\( I_{0\\rightarrow t},I_{1\\rightarrow t} \\). However, the problem with forward warping is that it creates holes in the interpolated frame. For this reason, most recent VFI algorithms use backward warping by creating \\( F_{t\\rightarrow 0},F_{t\\rightarrow 1} \\)." + }, + { + "type": "equation", + "bbox": [ + 0.352, + 0.825, + 0.784, + 0.841 + ], + "angle": 0, + "content": "\\[\n\\hat {I} _ {0 \\rightarrow t} = \\phi_ {w} \\left(I _ {0}, F _ {0 \\rightarrow t}\\right), \\hat {I} _ {1 \\rightarrow t} = \\phi_ {w} \\left(I _ {1}, F _ {1 \\rightarrow t}\\right) \\tag {2}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "where \\(\\phi_w\\) is a backward warp operation. Then, generate a temporary intermediate frame \\(\\tilde{I}_t\\) with the two warped frames and the mask obtained by the flow network [17, 36]." + }, + { + "type": "equation", + "bbox": [ + 0.384, + 0.206, + 0.786, + 0.224 + ], + "angle": 0, + "content": "\\[\n\\tilde {I} _ {t} = M \\odot \\hat {I} _ {0 \\rightarrow t} + (1 - M) \\odot \\hat {I} _ {1 \\rightarrow t} \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.229, + 0.784, + 0.261 + ], + "angle": 0, + "content": "Finally, generate an intermediate frame \\(\\hat{I}_t\\) by adding the estimated residuals \\(\\beta_t\\) using the synthesis network [8,33,39]." + }, + { + "type": "equation", + "bbox": [ + 0.464, + 0.273, + 0.786, + 0.291 + ], + "angle": 0, + "content": "\\[\n\\hat {I} _ {t} = \\tilde {I} _ {t} + \\beta \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.296, + 0.785, + 0.462 + ], + "angle": 0, + "content": "Previous flow-based VFI algorithms suffer from the issues that the receptive field size is limited, and therefore it is challenging to handle fast motion with large pixel displacements or complex videos with occlusion and context details. To address this issues, Sim et al. proposed XVFI, a recursive multi-scale structure for processing 4K video with large motion, and also released the X4K1000FPS dataset with extreme motion [34]. To handle large and complex motion, Jin et al. proposed an EBME [17] that guides the flow through correlation volumes. And various flow networks have been proposed in recent years that utilize pyramid structure [16, 17] to enlarge receptive field, and utilize transformer [24, 40] to capture long-range correspondence. As a result, these methods have achieved impressive results for handling large and complex motions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.785, + 0.523 + ], + "angle": 0, + "content": "However, interpolating complex frames with many occlusion regions or various motion distributions within the frame still remains as a challenging problem. In addition, there is the problem of poor performance of interpolation on data other than training data." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.545, + 0.607, + 0.56 + ], + "angle": 0, + "content": "2.2 Region-aware Image & Video Restoration" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.784, + 0.629 + ], + "angle": 0, + "content": "In a video (or image), each region has various characteristics of spatial complexity, such as edges and noise, and temporal complexity, such as the degree of motion between frames. Therefore, in the restoration task, it is important to understand the characteristics of each region for accurate restoration." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.63, + 0.785, + 0.734 + ], + "angle": 0, + "content": "As an example of utilizing spatial complexity, Rad et al. proposed SROBB [32], which uses different weights for loss based on the OBB (Object, Background, Boundary) labels within the frame. And Kong et al. proposed ClassSR [20], which categorizes each patch in a frame as easy, medium, or hard based on the PSNR and restores each patch appropriately. Recently, the Segmentation Anything Model (SAM) [18] has been utilized for region aware restoration tasks [15, 37]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.785, + 0.84 + ], + "angle": 0, + "content": "In VFI, it is also important to interpolate the intermediate frame with considering the spatial and temporal characteristics of the video. However, existing VFI algorithms have been interpolating without considering these characteristics. As a result, it is difficult to interpolate all regions of large videos with varying distributions of motion complexity. To address the limitations of existing VFI algorithms, we propose IAM-VFI, a method for interpolating all regions in videos with motion complexity." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.166, + 0.476, + 0.31 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.324, + 0.504, + 0.351 + ], + "angle": 0, + "content": "Fig.2: SI & TI distribution of VFI benchmark" + }, + { + "type": "table_caption", + "bbox": [ + 0.498, + 0.158, + 0.786, + 0.184 + ], + "angle": 0, + "content": "Table 1: Interpolation results of subclips in HD data" + }, + { + "type": "table", + "bbox": [ + 0.539, + 0.186, + 0.749, + 0.356 + ], + "angle": 0, + "content": "
NamePSNR
HD DatasetParkrun29.587
Shields36.236
Stockholm35.304
Bluesky41.438
Kimono35.983
Parkscene37.482
Sunflower35.994
Sintel Alley230.452
Sintel Market521.077
Sintel Temple127.57
Sintel Temple223.19
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.385, + 0.436, + 0.403 + ], + "angle": 0, + "content": "3 Proposed Methods" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.421, + 0.788, + 0.513 + ], + "angle": 0, + "content": "In this section, we first explore the problems with existing algorithms by analysing the relation between video complexity and VFI results in Sec. 3.1. Then, in Sec. 3.2, we describe a data classification method to address the existing problems. Finally, we describe the overall structure of our proposed IAM-VFI to interpolate any motion within the frame in Sec. 3.3, and describe the proposed MCENet to estimate the motion complexity of each region in Sec. 3.4." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.539, + 0.738, + 0.556 + ], + "angle": 0, + "content": "3.1 Relation between Video Complexity & Interpolate results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.751 + ], + "angle": 0, + "content": "We conducted the analysis in this section to explore the limitations of existing algorithms. The algorithm we used for the analysis is RIFE [12], a representative flow-based VFI algorithm. And we used Spatial Information (SI) and Temporal Information (TI) [13] to find the relation between the complexity of the video with the interpolation results. SI and TI are often used to ensure that videos span the appropriate range of spatio-temporal complexity and are used to classify video data according to complexity [9, 35]. It is also used when creating source videos to ensure that the distribution of video complexity is appropriate [2], and recently SI/TI has been used as a feature of deep learning-based video quality metrics [10]. SI is a measure of the amount of spatial detail by computing the sobel filter vertically and horizontally to detect edges within a frame and considering the standard deviation of the detected edges:" + }, + { + "type": "equation", + "bbox": [ + 0.41, + 0.768, + 0.786, + 0.786 + ], + "angle": 0, + "content": "\\[\nS I = \\operatorname {s t d} _ {\\text {s p a c e}} [ \\operatorname {S o b e l} \\left(F _ {n}\\right) ] \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Where \\( F_{n} \\) is the \\( n_{th} \\) frame of the video. Higher SI value indicate that the frame contains more detail are has a higher spatial complexity. TI is a measure of the amount of temporal variation in a video sequence. TI first calculates" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.128 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "image", + "bbox": [ + 0.257, + 0.164, + 0.481, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.25, + 0.344, + 0.496, + 0.358 + ], + "angle": 0, + "content": "(a) Relation between TI and PSNR in HD" + }, + { + "type": "image", + "bbox": [ + 0.514, + 0.163, + 0.741, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.509, + 0.344, + 0.755, + 0.358 + ], + "angle": 0, + "content": "(b) Relation between SI and PSNR in HD" + }, + { + "type": "image_caption", + "bbox": [ + 0.265, + 0.367, + 0.738, + 0.383 + ], + "angle": 0, + "content": "Fig. 3: Relation between spatiotemporal information (SI/TI) & PSNR" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.417, + 0.789, + 0.464 + ], + "angle": 0, + "content": "the amount of variation between two adjacent frames by calculating the difference between the current frame and the previous frame, and then considers the standard deviation of the variation to calculate temporal complexity." + }, + { + "type": "equation", + "bbox": [ + 0.387, + 0.479, + 0.787, + 0.498 + ], + "angle": 0, + "content": "\\[\nM _ {n} (i, j) = F _ {n} (i, j) - F _ {n - 1} (i, j) \\tag {6}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.414, + 0.534, + 0.787, + 0.553 + ], + "angle": 0, + "content": "\\[\nT I = s t d _ {s p a c e} (M _ {n} (i, j)) \\qquad \\qquad (7)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.566, + 0.789, + 0.61 + ], + "angle": 0, + "content": "Where \\( M_{n} \\) represents the difference between the current frame \\( F_{n} \\) and the previous frame \\( F_{n - 1} \\). A higher value of TI indicates that more motion is included between two frames." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.79, + 0.842 + ], + "angle": 0, + "content": "Video complexity is an important factor in VFI, so we analysed the relation between SI/TI and interpolation results to find out the reason why the existing VFI algorithms perform poorly on data that deviates from the characteristics of the training data. As shown in the Fig. 2, we can see that the SI/TI distribution of the Vimeo90K [38] train dataset, which is commonly used for training, contains the entire Vimeo90K test dataset. As a result, the existing training methods perform well on interpolate the Vimeo90K test data. However, some of the subclips in the HD [1] dataset have SI/TI that are out of the distribution of the training data. In this case, we can observe that the PSNR of subclips outside the distribution of the training data degrades in Tab. 1. Based on this, we further analyze the relation between SI/TI and PSNR. As shown in Fig. 3a, PSNR is more closely related to TI, which is important for accurately estimating motion in VFI. It shows that PSNR degrades as the complexity of motion between frames increases. In contrast, SI, the spatial complexity of the interpolation, is not closely related to the interpolation result, as shown in Fig. 3b." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.26, + 0.144, + 0.744, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.346, + 0.788, + 0.404 + ], + "angle": 0, + "content": "Fig. 4: Overview of our IAM-VFI. The Flow Network in stage 1 is the Flow Network of the existing VFI algorithm. It is trained with our proposed easy, medium, and hard datasets, respectively, to optimize for the motion complexity. The Synthesis Network in stage 2 is the synthesis network of the existing VFI algorithm." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.43, + 0.483, + 0.443 + ], + "angle": 0, + "content": "3.2 Data classification Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.452, + 0.788, + 0.557 + ], + "angle": 0, + "content": "Previous training methods typically train with patches cropped from random regions of the input image. However, the complexity of motion within the patch is also randomized, leading to suboptimal training for each complexity. As a result, it suffers from poor results for videos with varying complexity distribution within the video. To address this problem, we propose a data classification method that classifies the existing training dataset into easy, medium, and hard datasets according to motion complexity based on the analysis of Sec. 3.1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.558, + 0.788, + 0.693 + ], + "angle": 0, + "content": "First we created Vimeo90K(X2), which is a \\(\\times 2\\) upsampling of Vimeo90K [38] via EDSR [22] to generate more samples for larger motions, and we use both Vimeo90K and Vimeo90K(X2) data for classification. To avoid training randomly cropped regions, we first overlapped parts of the dataset and cropped them into patches of \\(256 \\times 256\\) size. We then calculated the TI to classify the data based on the motion complexity of each cropped patch. Based on the calculated TI, we set a threshold to divide the number of data into three parts: easy, medium, and hard datasets. The effectiveness of our proposed data classification method can be seen in Sec. 5.1." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.713, + 0.425, + 0.727 + ], + "angle": 0, + "content": "3.3 IAM-VFI Overview" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "To identify the motion complexity for each region in the frame and to handle all motion, we propose IAM-VFI. Our proposed IAM-VFI is trained in two stages, as shown in Fig. 4. In the first stage, we train a flow estimate network with easy, medium, and hard datasets, each classified by motion complexity, to perform motion optimization for that complexity. The flow estimation network trained on each data generates optimized frames \\(\\tilde{I}_t^e,\\tilde{I}_t^m,\\tilde{I}_t^h\\), for each complexity. The generated frames are then concatenated and used as input for the second stage." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.128 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.144, + 0.788, + 0.247 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.247, + 0.536, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.536, + 0.248, + 0.787, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.254, + 0.344, + 0.747, + 0.358 + ], + "angle": 0, + "content": "Fig. 5: The network structure of Motion Complexity Estimation Network" + }, + { + "type": "equation", + "bbox": [ + 0.415, + 0.403, + 0.785, + 0.421 + ], + "angle": 0, + "content": "\\[\n\\tilde {I} _ {t} = \\operatorname {C o n c a t} \\left(\\tilde {I} _ {t} ^ {e}, \\tilde {I} _ {t} ^ {m}, \\tilde {I} _ {t} ^ {h}\\right) \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.429, + 0.788, + 0.566 + ], + "angle": 0, + "content": "The second stage receives each optimized frame as input and generates a Motion Complexity Map \\((MCM_{t})\\) using a Motion Complexity Estimation Network (MCENet) to estimate the complexity of each region in the intermediate frame. Then perform a linear combination of the generated \\(MCM_{t}\\) and the input image \\(\\tilde{I}_t\\) to generate a temporal intermediate frame \\(\\hat{I}_t\\). And the generated \\(MCM_{t}\\) is used as input to provide information about the motion complexity to the synthesis network of the existing VFI algorithm to estimate the residual. Finally, the residual is added to the temporal intermediate frame to generate the final interpolated frame \\(I_t\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.589, + 0.596, + 0.604 + ], + "angle": 0, + "content": "3.4 Motion Complexity Estimation Network" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.615, + 0.789, + 0.797 + ], + "angle": 0, + "content": "We propose MCENet, a network for estimating the motion complexity of each region of the intermediate frames to be interpolated and handling them according to the motion complexity of each region. First, MCENet takes as input \\(\\tilde{I}_t^e,\\tilde{I}_t^m\\), and \\(\\tilde{I}_t^h\\), the optimized results for each motion complexity, and generates an \\(MCM_{t}\\in \\mathbb{R}^{3\\times H\\times W}\\) that estimate the motion complexity of the region. The generated \\(MCM_{t}\\) consists of three channels, each representing a probability value for whether this region is close to easy, medium, or hard. We then perform a linear combination of multiplying each channel by the \\(\\tilde{I}_t^e,\\tilde{I}_t^m\\), and \\(\\tilde{I}_t^h\\) frames respectively to generate \\(\\hat{I}_t\\), the frame that reflects the complexity. As a result, \\(MCM_{t}\\) also controls the region on the boundary of each class by giving more weight to the most probable values among the three classified easy, medium, and hard values." + }, + { + "type": "equation", + "bbox": [ + 0.42, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "\\[\n\\hat {I} _ {t} = \\sum_ {c \\in e, m, h} M C M _ {t} ^ {c} \\tilde {I} _ {t} ^ {c} \\tag {9}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "We construct MCENet with a U-Net structure for simple application to existing VFI algorithms and propose Motion Attention Block (MAB) for estimating motion complexity more efficiently. The detailed architecture of MCENet and MAB can be seen in Fig. 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.785, + 0.372 + ], + "angle": 0, + "content": "To effectively train \\( MCM_{t} \\), we propose a novel loss function, complexity loss. The frame \\( \\hat{I}_{t} \\) generated by the \\( MCM_{t} \\), contains information about the complexity of the motion in each region. Therefore, it is not effective to use a loss function to reduce the error with GT, which does not contain information about complexity. For this reason we generate \\( MCM_{gt} \\), which contains information about the complexity of the motion. To generate the \\( MCM_{gt} \\), we compute the error between the optimized frame and the ground truth for each pixel by motion complexity. We then assign a 1 to the channel of the \\( MCM_{gt} \\) that represents the class with the minimum error at each pixel, and a 0 to the other channels. This allows the \\( MCM_{gt} \\) to represent the best motion complexity class at each pixel." + }, + { + "type": "equation", + "bbox": [ + 0.297, + 0.385, + 0.785, + 0.434 + ], + "angle": 0, + "content": "\\[\nM C M _ {g t} ^ {c} (i, j) = \\left\\{ \\begin{array}{l l} 1, & \\text {i f} c = \\underset {c \\in \\{e, m, h \\}} {\\operatorname {a r g m i n}} \\left(\\left| g t (i, j) - \\tilde {I} _ {t} ^ {c} (i, j) \\right|\\right) \\\\ 0, & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.439, + 0.784, + 0.47 + ], + "angle": 0, + "content": "Finally, we compute a linear combination of the generated MCM and each frame to generate \\(\\hat{I}_{MCM}\\)" + }, + { + "type": "equation", + "bbox": [ + 0.401, + 0.483, + 0.785, + 0.515 + ], + "angle": 0, + "content": "\\[\n\\hat {I} _ {M C M} = \\sum_ {c \\in \\{e, m, h \\}} M C M _ {g t} ^ {c} \\tilde {I} _ {t} ^ {c} \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.523, + 0.784, + 0.556 + ], + "angle": 0, + "content": "We update the \\( MCM_{t} \\) by taking the L1 loss between two frames \\( \\hat{I}_{t} \\) and \\( \\hat{I}_{MCM} \\) that contain the motion complexity." + }, + { + "type": "equation", + "bbox": [ + 0.431, + 0.567, + 0.785, + 0.585 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {c} = \\left\\| \\hat {I} _ {t} - \\hat {I} _ {M C M} \\right\\| _ {1} \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.594, + 0.508, + 0.609 + ], + "angle": 0, + "content": "The effect on \\(\\mathcal{L}_c\\) was verified in Sec. 5.3." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.633, + 0.367, + 0.65 + ], + "angle": 0, + "content": "4 Experiment" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.665, + 0.412, + 0.68 + ], + "angle": 0, + "content": "4.1 Implement details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.785, + 0.779 + ], + "angle": 0, + "content": "Training Dataset. We first trained the flow network using the classified datasets introduced in Sec. 3.2. Then, we freeze the flow network and trained the MCENet and synthesis network. Since the classified datasets are the data proposed to optimize each motion, we used the original Vimeo90K to train MCENet and synthesis network. The Vimeo90K data consists of 51,312 triplets and has a resolution of \\(448 \\times 256\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.785, + 0.841 + ], + "angle": 0, + "content": "Training Strategy. We applied the proposed methods to the flow-based algorithms RIFE [12] and EMA-VFI [40]. The experiments were implemented based on the official code presented in the paper. For both proposed stages, we used the same optimization techniques such as batch size, optimizer, scheduler, and" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "learning rate as used in RIFE and EMA-VFI, and trained for the same iterations. Our training was performed on a single NVIDIA RTX A6000." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.785, + 0.238 + ], + "angle": 0, + "content": "Loss Function. In the first stage, we used the same loss function used in the original networks for training the flow estimation network. In the second step, we used \\(\\mathcal{L}_{syn}\\), the reconstruction loss used to train synthesis network in RIFE and EMA-VFI, and \\(\\mathcal{L}_c\\), the loss function proposed in Sec. 3.4 to train the MCENet." + }, + { + "type": "equation", + "bbox": [ + 0.415, + 0.253, + 0.786, + 0.269 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {t o t a l}} = \\lambda_ {s} \\mathcal {L} _ {\\text {s y n}} + \\lambda_ {f} \\mathcal {L} _ {c} \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.273, + 0.637, + 0.289 + ], + "angle": 0, + "content": "where we set \\(\\lambda_s = 0.5\\), \\(\\lambda_f = 0.5\\) to balance the loss values." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.307, + 0.563, + 0.322 + ], + "angle": 0, + "content": "4.2 Benchmarks and Evaluation Metrics" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.329, + 0.784, + 0.373 + ], + "angle": 0, + "content": "Our proposed methods are to handle various motion complexities. Therefore, we evaluated our proposed method on the following datasets with various motion complexities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.375, + 0.784, + 0.404 + ], + "angle": 0, + "content": "SNU-FILM [4] : 1280x720 resolution with a total of 1240 frames, categorized into easy, medium, hard, and extreme according to the motion magnitude." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.405, + 0.784, + 0.433 + ], + "angle": 0, + "content": "HD [1] : It consists of 11 videos. The HD dataset consists of four 1080p, three 720p and four 544p videos, and we used the first 100 frames of each video" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.435, + 0.784, + 0.464 + ], + "angle": 0, + "content": "UVG [25]: It consists of 7 videos with 3840x2160 resolution, and we used the first 300 frames of each video." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.465, + 0.785, + 0.509 + ], + "angle": 0, + "content": "Xiph [26]: It contains 19 video sequences, each consisting of 31 consecutive 4K resolution frames. We followed [27] method to downsample and center-crop the 4K images to create a 2K resolution and evaluate both Xiph4K and Xiph2K." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.79, + 0.584 + ], + "angle": 0, + "content": "Metrics. We used Peak Signal-To-Noise Ratio (PSNR) and Structural-Similarity-Image-Metric (SSIM), commonly used objective quality metrics, where a higher PSNR and SSIM indicate better quality. To evaluate runtime, we measured all algorithms at 720p resolution to be fair, and we used a single NVIDIA RTX A6000 GPU." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.606, + 0.325, + 0.621 + ], + "angle": 0, + "content": "5 Results" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.635, + 0.486, + 0.648 + ], + "angle": 0, + "content": "5.1 Data Classification method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.656, + 0.784, + 0.687 + ], + "angle": 0, + "content": "We first validate our proposed data classification method. The proposed method aims to optimize for the complexity of each motion, so we exclude the influence" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.709, + 0.784, + 0.737 + ], + "angle": 0, + "content": "Table 2: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR value)" + }, + { + "type": "table", + "bbox": [ + 0.264, + 0.75, + 0.74, + 0.839 + ], + "angle": 0, + "content": "
Benchmark Train DataVimeo90KUVG
easymediumhardeasymediumhard
Vimeo90K43.54336.49532.13148.33836.31730.052
Ourseasy43.95536.40231.72749.02736.29129.338
Oursmedium43.95137.01232.58848.50936.85130.289
Ourshard43.63236.99132.72147.83136.81530.611
" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 3: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR/SSIM values within each dataset and Blue indicates second best and Green indicates third best.) We followed the test procedures of [12] for HD, [19] for SNU-FILM, and [11] for Xiph to ensure a fair comparison. \"OOM\" indicates \"Out of Memory\" and \"+\" indicates the results we obtained by retraining to compare results." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.217, + 0.789, + 0.422 + ], + "angle": 0, + "content": "
AlgorithmHDSNU-FILMUVGXiph
EasyMediumHardExtreme2K4K
SepConv [29]30.87/0.93039.41/0.99034.97/0.97629.36/0.92524.31/0.84426.11/0.86434.77/0.92932.06/0.880
CAIN [4]31.45/0.93939.91/0.99035.57/0.97729.87/0.92924.73/0.85030.32/0.90235.21/0.93732.56/0.901
AdaCoF [21]31.43/0.93339.84/0.99035.07/0.97529.47/0.92424.31/0.843OOM34.86/0.92832.19/0.882
CDFI [6]31.46/0.93740.11/0.99035.51/0.97729.74/0.92724.54/0.847OOM35.48/0.94032.47/0.903
ABME [31]32.17/0.94339.59/0.99035.51/0.97829.47/0.93625.23/0.863OOM35.18/0.96432.36/0.940
IFRNet [19]32.15/0.94340.02/0.99035.93/0.97930.40/0.93525.05/0.85831.33/0.90436.24/0.96433.38/0.941
M2M-PWC [11]31.23/0.93739.59/0.99035.68/0.97930.27/0.93625.07/0.86030.89/0.91036.40/0.96733.77/0.943
VFIformer [24]OOM40.12/0.99136.09/0.98030.67/0.93725.20/0.863OOMOOMOOM
EBME [17]32.44/0.94539.98/0.99135.74/0.97930.40/0.93525.24/0.86131.79/0.91536.33/0.96533.71/0.942
RIFE† [12]32.08/0.94239.98/0.99035.78/0.97830.14/0.93324.84/0.85331.13/0.90036.15/0.96433.25/0.940
RIFEours32.46/0.94640.18/0.99136.05/0.98030.58/0.93725.35/0.86332.17/0.91736.60/0.96634.20/0.946
EMA-VFI† [40]32.62/0.94840.17/0.99135.97/0.97930.64/0.93525.27/0.85731.19/0.90736.71/0.96633.69/0.944
EMA-VFIours32.89/0.95140.28/0.99236.30/0.98130.88/0.93825.59/0.86432.12/0.91637.01/0.96834.29/0.947
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.443, + 0.784, + 0.546 + ], + "angle": 0, + "content": "of synthesis networks for accurate validation. We use the proposed easy, medium, and hard datasets to train IFNet, the flow network of RIFE. And warped the estimated flows and input frames then generate temporal intermediate frames using Eq. (3). The Benchmark used for validation was Vimeo90K test and UVG, and was divided into 256x256 patches to avoid varying complexity within the region and the TI of each patch was calculated and classified as easy, medium, or hard." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.549, + 0.785, + 0.61 + ], + "angle": 0, + "content": "As shown in Tab. 2, we can see that the training with the complexity classified data optimizes the motion estimation performance, resulting in improved PSNR compared to the results trained with the original dataset. This result shows that classification by complexity is effective in optimizing motion." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.633, + 0.654, + 0.649 + ], + "angle": 0, + "content": "5.2 Comparison with the State-of-the-Art Methods" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.784, + 0.734 + ], + "angle": 0, + "content": "To compare the proposed methods, we used the kernel-based algorithms SepConv [29], AdaCoF [21], and CDFI [6], the flow-based algorithms ABME [31], IFRNet [19], M2M-PWC [11], VFformer [24], EBME [17], and the other method CAIN [4]. We applied our methods to the flow-based algorithms RIFE [12] and EMAVFI [40]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Tab. 3 summarizes the quantitative comparison with existing VFI algorithms on various benchmarks to show the effectiveness of the proposed methods. The performance of the original RIFE is slightly worse compared to the state-of-the-art algorithms, but we can see that our proposed method improves performance on all benchmarks. In particular, for UVG and Xiph4K, which are high-resolution videos with various motion complexity, we can see the PSNR improvements of 1.04 dB and 0.95 dB, respectively, with the best results for UVG data" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.127 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.787, + 0.335 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.264, + 0.342, + 0.741, + 0.353 + ], + "angle": 0, + "content": "(a) Visual comparison of IAM-VFI applied to EMA-VFI with the SOTA algorithm" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.354, + 0.787, + 0.564 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.275, + 0.568, + 0.728, + 0.581 + ], + "angle": 0, + "content": "(b) Visual comparison of IAM-VFI applied to RIFE with the SOTA algorithm" + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.592, + 0.785, + 0.607 + ], + "angle": 0, + "content": "Fig. 6: Visual comparison on extreme subset of SNU-FILM [4] and HD [1] benchmarks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.652, + 0.788, + 0.728 + ], + "angle": 0, + "content": "compared to the state-of-the-art algorithms. Other benchmarks also achieved second or third best results. And when the IAM-VFI method is applied to the recently proposed EMA-VFI, we can see that it achieves the best performance in all benchmarks except UVG, with an improvement of 0.93 dB in UVG and 0.60 dB in Xiph4K compared to the original algorithm." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In Fig. 6, we compare the subjective image quality of the results of applying IAM-VFI to RIFE and EMA-VFI with other algorithms. In the first column of Fig. 6a, we can see that IAM-VFI can handle large motions and the second column demonstrated that images with complex motion and detail are also improved. In the first column of Fig. 6b, the occlusion regions of the object and background are sharply interpolated and the face is interpolated clearly. And in the second column, the edge regions are also interpolated sharply." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.787, + 0.365 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.379, + 0.788, + 0.475 + ], + "angle": 0, + "content": "Fig. 7: Subjective image quality comparison for the effectiveness of MCM. The first column shows, from left, the overlap of the two input images, each channel of the \\(MCM_{t}\\) representing the probabilities of easy, medium, and hard, and the interpolation results of the original RIFE. The second column shows, from left, the ground truth of the intermediate frames to be interpolated, the intermediate frames optimized to easy, medium and hard using the data classification method, and the interpolation results of IAM-VFI." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.508, + 0.402, + 0.523 + ], + "angle": 0, + "content": "5.3 Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.787, + 0.612 + ], + "angle": 0, + "content": "We performed the ablation study to demonstrate the effectiveness of the proposed methods. For comparison, we used all benchmark datasets and compared the inference time of applying the proposed method to the existing VFI algorithm. In Tab. 4, the baseline without applying all the proposed methods is the original RIFE [12] algorithm." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.787, + 0.718 + ], + "angle": 0, + "content": "Effect of MCENet. The second column is the result of simply weighting each of the frames optimized for each class by the classified data by 0.33. We can see that the PSNR degrades for most of the benchmarks because we do not take into account the complexity of each region. In contrast, when we generate an \\( MCM_{t} \\) using MCENet to estimate the complexity of each region and adaptively weight each region, we see that performance improves compared to the baseline for all benchmarks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In Fig. 7, we can see the optimized results for each motion and a visualisation of each channel of the \\( MCM_{t} \\) generated by MCENet. We can see that the regions with large motion are classified as hard motion complexity, and the optimized result with hard data interpolates the large motion regions clearly. Also in the occlusion region, we can see that the motion complexity is classified as hard due to the different motion of the two overlapped objects, and the edges are sharply interpolated. And global motions are classified as easy or medium. Finally, when small objects such as branches move, the distribution of their motions varies," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.784, + 0.173 + ], + "angle": 0, + "content": "Table 4: Ablation studies for our proposed methods. M.O stands for Motion Optimisation with classified data. (Red indicates the best PSNR)." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.185, + 0.787, + 0.286 + ], + "angle": 0, + "content": "
M.OMCENetLcMABSynMCMHDSNU-FILMUVGXiphRuntime
EasyMediumHardExtreme2K4K
×××××32.0839.9835.7830.1424.8331.1336.1533.2548.3ms
✓××××31.9738.3935.1530.2225.2331.6035.8033.6068.3ms
✓✓×××32.3240.0536.0330.5925.3532.0236.3333.9278.7ms
✓✓✓××32.4240.1136.0430.5825.3432.0836.5634.0678.7ms
✓✓✓✓×32.4540.1436.0530.5925.3532.1536.6034.1282.7ms
✓✓✓✓✓32.4640.1836.0830.6025.3532.1736.6034.2087.5ms
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.317, + 0.784, + 0.346 + ], + "angle": 0, + "content": "so they are classified as complex motions, and you can see that the previously blurred parts are interpolated clearly." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.347, + 0.784, + 0.407 + ], + "angle": 0, + "content": "Effect of Motion Complexity Loss. The \\(\\hat{I}_t\\) generated by \\(MCM_t\\) contains information about the complexity of each regions. Therefore, we can see that using the loss function for frames with complexity information reflected through \\(MCM_{qt}\\) rather than using the loss with GT is effective." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.408, + 0.784, + 0.466 + ], + "angle": 0, + "content": "Effect of MAB. Each channel of MCM represents the probability value for whether the complexity of the corresponding area falls into easy, medium, or hard. Therefore, the PSNR is improved when MAB is used in MCENet to give attention for each channel." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.468, + 0.784, + 0.513 + ], + "angle": 0, + "content": "Synthesis Network with MCM. Using the \\(MCM_{t}\\) as an additional input to the synthesis network to provide information about motion complexity can improve performance on most of the benchmarks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.543, + 0.357, + 0.557 + ], + "angle": 0, + "content": "5.4 Limitations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.575, + 0.784, + 0.665 + ], + "angle": 0, + "content": "By applying the proposed method to the existing algorithm, we achieved a significant improvement in interpolation results, but it still has several limitations. First, the flow network needs to be trained for each classified dataset to optimize for motion, resulting in increased training time. Second, compared to the existing network, the runtime increases. In future work, we will attempt to optimize for all motion complexities using a single flownet." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.696, + 0.36, + 0.712 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.784, + 0.84 + ], + "angle": 0, + "content": "This paper aims to address the problem that existing VFI algorithms do not consider motion complexity and therefore fail to perform optimally for all regions. We solve this problem by combining three intermediate frames, which are derived by different flow networks, with motion complexity map. Experimental results show that the proposed method of interpolating frame by considering motion complexity improves the interpolation performance of existing VFI algorithms and achieves enhanced quality for all regions in the video." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.784, + 0.24 + ], + "angle": 0, + "content": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2021-0-00087, Development of high-quality conversion technology for SD/HD low-quality media)" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.264, + 0.323, + 0.28 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.296, + 0.785, + 0.351 + ], + "angle": 0, + "content": "1. Bao, W., Lai, W.S., Zhang, X., Gao, Z., Yang, M.H.: Memc-net: Motion estimation and motion compensation driven neural network for video interpolation and enhancement. IEEE transactions on pattern analysis and machine intelligence 43(3), 933-948 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.354, + 0.785, + 0.407 + ], + "angle": 0, + "content": "2. Barman, N., Zadtootaghaj, S., Schmidt, S., Martini, M.G., Möller, S.: Gamingvideoset: a dataset for gaming video streaming applications. In: 2018 16th Annual Workshop on Network and Systems Support for Games (NetGames). pp. 1-6. IEEE (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.409, + 0.785, + 0.449 + ], + "angle": 0, + "content": "3. Brooks, T., Barron, J.T.: Learning to synthesize motion blur. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6840-6848 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.451, + 0.785, + 0.492 + ], + "angle": 0, + "content": "4. Choi, M., Kim, H., Han, B., Xu, N., Lee, K.M.: Channel attention is all you need for video frame interpolation. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 10663-10671 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.493, + 0.785, + 0.533 + ], + "angle": 0, + "content": "5. Dar, Y., Bruckstein, A.M.: Motion-compensated coding and frame rate upconversion: Models and analysis. IEEE Transactions on Image Processing 24(7), 2051-2066 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.535, + 0.785, + 0.576 + ], + "angle": 0, + "content": "6. Ding, T., Liang, L., Zhu, Z., Zharkov, I.: Cdfi: Compression-driven network design for frame interpolation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8001-8011 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.577, + 0.785, + 0.617 + ], + "angle": 0, + "content": "7. Flynn, J., Neulander, I., Philbin, J., Snavely, N.: Deepstereo: Learning to predict new views from the world's imagery. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5515-5524 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.618, + 0.785, + 0.659 + ], + "angle": 0, + "content": "8. Fourure, D., Emonet, R., Fromont, E., Muselet, D., Tremeau, A., Wolf, C.: Residual conv-deconv grid network for semantic segmentation. arXiv preprint arXiv:1707.07958 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.66, + 0.785, + 0.715 + ], + "angle": 0, + "content": "9. Fremerey, S., Goring, S., Rao, R.R.R., Huang, R., Raake, A.: Subjective test dataset and meta-data-based models for \\(360^{\\circ}\\) streaming video quality. In: 2020 IEEE 22nd International Workshop on Multimedia Signal Processing (MMSP). pp. 1-6. IEEE (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.716, + 0.785, + 0.756 + ], + "angle": 0, + "content": "10. Göring, S., Rao, R.R.R., Feiten, B., Raake, A.: Modular framework and instances of pixel-based video quality models for uhd-1/4k. IEEE Access 9, 31842-31864 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.757, + 0.785, + 0.798 + ], + "angle": 0, + "content": "11. Hu, P., Niklaus, S., Sclaroff, S., Saenko, K.: Many-to-many splatting for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3553-3562 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "12. Huang, Z., Zhang, T., Heng, W., Shi, B., Zhou, S.: Real-time intermediate flow estimation for video frame interpolation. In: European Conference on Computer Vision. pp. 624-642. Springer (2022)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.296, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "K. Yoon et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "13. Installations, T., Line, L.: Subjective video quality assessment methods for multimedia applications. Networks 910(37), 5 (1999)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.175, + 0.787, + 0.23 + ], + "angle": 0, + "content": "14. Jiang, H., Sun, D., Jampani, V., Yang, M.H., Learned-Miller, E., Kautz, J.: Super slomo: High quality estimation of multiple intermediate frames for video interpolation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 9000-9008 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.23, + 0.785, + 0.256 + ], + "angle": 0, + "content": "15. Jiang, J., Holz, C.: Restore anything pipeline: Segment anything meets image restoration. arXiv preprint arXiv:2305.13093 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.256, + 0.785, + 0.298 + ], + "angle": 0, + "content": "16. Jin, X., Wu, L., Chen, J., Chen, Y., Koo, J., Hahm, C.h.: A unified pyramid recurrent network for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1578-1587 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.298, + 0.785, + 0.352 + ], + "angle": 0, + "content": "17. Jin, X., Wu, L., Shen, G., Chen, Y., Chen, J., Koo, J., Hahm, C.h.: Enhanced bidirectional motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5049-5057 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.352, + 0.785, + 0.393 + ], + "angle": 0, + "content": "18. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.393, + 0.785, + 0.447 + ], + "angle": 0, + "content": "19. Kong, L., Jiang, B., Luo, D., Chu, W., Huang, X., Tai, Y., Wang, C., Yang, J.: Ifrnet: Intermediate feature refine network for efficient frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1969-1978 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.447, + 0.785, + 0.488 + ], + "angle": 0, + "content": "20. Kong, X., Zhao, H., Qiao, Y., Dong, C.: Classsr: A general framework to accelerate super-resolution networks by data characteristic. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12016-12025 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.488, + 0.785, + 0.528 + ], + "angle": 0, + "content": "21. Lee, H., Kim, T., Chung, T.y., Pak, D., Ban, Y., Lee, S.: Adacof: Adaptive collaboration of flows for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5316-5325 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.528, + 0.785, + 0.57 + ], + "angle": 0, + "content": "22. Lim, B., Son, S., Kim, H., Nah, S., Mu Lee, K.: Enhanced deep residual networks for single image super-resolution. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 136-144 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.569, + 0.785, + 0.609 + ], + "angle": 0, + "content": "23. Liu, Z., Yeh, R.A., Tang, X., Liu, Y., Agarwala, A.: Video frame synthesis using deep voxel flow. In: Proceedings of the IEEE international conference on computer vision. pp. 4463-4471 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.61, + 0.785, + 0.651 + ], + "angle": 0, + "content": "24. Lu, L., Wu, R., Lin, H., Lu, J., Jia, J.: Video frame interpolation with transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3532-3542 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.651, + 0.785, + 0.692 + ], + "angle": 0, + "content": "25. Mercat, A., Viitanen, M., Vanne, J.: Uvg dataset: 50/120fps 4k sequences for video codec analysis and development. In: Proceedings of the 11th ACM Multimedia Systems Conference. pp. 297-302 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.692, + 0.785, + 0.718 + ], + "angle": 0, + "content": "26. Montgomery, C., Lars, H.: Xiph.org video test media (derf's collection). Online, https://media.xiph.org/video/derf 6 (1994)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.718, + 0.785, + 0.759 + ], + "angle": 0, + "content": "27. Niklaus, S., Liu, F.: Softmax splatting for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5437-5446 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.759, + 0.785, + 0.8 + ], + "angle": 0, + "content": "28. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "29. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.148, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.368, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Interpolate Any Motion for Video Frame Interpolation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.205 + ], + "angle": 0, + "content": "30. Park, J., Ko, K., Lee, C., Kim, C.S.: Bmbc: Bilateral motion estimation with bilateral cost volume for video interpolation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 109-125. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.205, + 0.788, + 0.245 + ], + "angle": 0, + "content": "31. Park, J., Lee, C., Kim, C.S.: Asymmetric bilateral motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14539-14548 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.245, + 0.788, + 0.3 + ], + "angle": 0, + "content": "32. Rad, M.S., Bozorgtabar, B., Marti, U.V., Basler, M., Ekenel, H.K., Thiran, J.P.: Srobb: Targeted perceptual loss for single image super-resolution. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 2710-2719 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.3, + 0.788, + 0.357 + ], + "angle": 0, + "content": "33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.357, + 0.788, + 0.398 + ], + "angle": 0, + "content": "34. Sim, H., Oh, J., Kim, M.: Xvfi: extreme video frame interpolation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 14489-14498 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.398, + 0.788, + 0.439 + ], + "angle": 0, + "content": "35. Song, L., Tang, X., Zhang, W., Yang, X., Xia, P.: The sjtu 4k video sequence dataset. In: 2013 Fifth International Workshop on Quality of Multimedia Experience (QoMEX). pp. 34-35. IEEE (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.439, + 0.788, + 0.482 + ], + "angle": 0, + "content": "36. Sun, D., Yang, X., Liu, M.Y., Kautz, J.: Pwc-net: Cnns for optical flow using pyramid, warping, and cost volume. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 8934-8943 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.482, + 0.788, + 0.509 + ], + "angle": 0, + "content": "37. Xiao, Z., Bai, J., Lu, Z., Xiong, Z.: A dive into sam prior in image restoration. arXiv preprint arXiv:2305.13620 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.536 + ], + "angle": 0, + "content": "38. Xue, T., Chen, B., Wu, J., Wei, D., Freeman, W.T.: Video enhancement with task-oriented flow. International Journal of Computer Vision 127, 1106-1125 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.536, + 0.788, + 0.564 + ], + "angle": 0, + "content": "39. Yoon, K., Huh, J., Kim, Y.H., Kim, S., Jeong, J.: Textural detail preservation network for video frame interpolation. IEEE Access (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.564, + 0.788, + 0.62 + ], + "angle": 0, + "content": "40. Zhang, G., Zhu, Y., Wang, H., Chen, Y., Wu, G., Wang, L.: Extracting motion and appearance via inter-frame attention for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5682-5692 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.62, + 0.788, + 0.675 + ], + "angle": 0, + "content": "41. Zhou, T., Tulsiani, S., Sun, W., Malik, J., Efros, A.A.: View synthesis by appearance flow. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part IV 14. pp. 286-301. Springer (2016)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.675 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_origin.pdf b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5a82cbcae4f39e2609c4897d6034b250bc49ea73 --- /dev/null +++ b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/27484e78-4d3a-4c10-8bb6-c78efe457562_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c0c9a1298fce5787b7c5a6af23b987514595abbba654aa071c6d89c86b5448c4 +size 11738586 diff --git a/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/full.md b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/full.md new file mode 100644 index 0000000000000000000000000000000000000000..7f0fce2cd66a35326c180f0694cc7e19eb30143f --- /dev/null +++ b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/full.md @@ -0,0 +1,358 @@ +# IAM-VFI : Interpolate Any Motion for Video Frame Interpolation with motion complexity map + +Kihwan Yoon $^{1}$ , Yong Han Kim $^{1}$ , Sungjei Kim $^{2,\dagger}$ , and Jinwoo Jeong $^{2,\dagger}$ + +1 University of Seoul, Seoul 02504, Republic of Korea + +$^{2}$ Korea Electronics Technology Institute, Gyeonggi-do 13488, Republic of Korea + +rlghksdbsgmail.com + +yhkim@uos.ac.kr + +{jw.jeong, sungjei.kim}@keti.re.kr + +https://github.com/rlghksdsb/IAM-VFI + +Abstract. Within the video, different regions have varying motion complexity, with simple regions containing static or global motion and complex regions containing fast motion or lots of local motion. In recent years, the performance of flow-based Video Frame Interpolation (VFI) algorithms has improved significantly. However, existing training methods train on randomly cropped regions of train data without considering the complexity of the motion. As a result, they cannot handle all regions of the frame that contain varying motion complexity. To solve this problem, we propose a novel VFI approach (IAM-VFI) that can interpolate any motion by considering the motion complexity of all regions in the frame. First, we propose a training data classification method for motion optimization based on each motion complexity. Then, using the proposed data, a flow estimation network generates optimized results for each complexity. Finally, we propose a Motion Complexity Estimation Network (MCENet) to generate a Motion Complexity Map (MCM) that can estimate the motion complexity of each region. Our proposed methods can be easily applied to most flow-based VFI algorithms. Experimental results show that the proposed method can interpolate any motion and significantly improve the performance of existing VFI algorithms. + +Keywords: Video Frame Interpolation, Optical Flow Estimation, Region-Aware + +# 1 Introduction + +Video Frame Interpolation (VFI) is a challenging low-level vision task that increases the frame rate by generating a non-existent intermediate frame between two consecutive frames. VFI can be applied to various tasks such as video restoration [3], novel view synthesis [7, 41], slow motion generation [14, 23], and frame up-conversion [5], etc. With the development of deep learning, the performance of VFI algorithms has significantly improved. + +![](images/afac9481a2cb212cf6366bf4cd5b525dc74f8fbc4b0572bf5ac88885b7d7bcbf.jpg) + +GT +ALL +34.08dB +Easy +33.28dB +Me +34.56dB +Hard +34.47dB +Fig. 1: Example of subjective results of based on motion complexity. In the case of (a), the motion complexity between the two input frames is classified as a medium, and the model trained on data classified as medium is the best. In contrast, (b) has a fast motion complexity and the model trained on the hard data shows the best results. +![](images/d09ec48dbeec24644bdfdf31b7f2281baf0fc6ef69acf1dd2104d7fb53ba9b7a.jpg) +(a) Interpolation results for region with medium (b) Interpolation results for region with hard motion complexity motion complexity + +![](images/1207a7e07a5590ef84499033073755b16d69f3886b01332bfd23daa09b06aea5.jpg) + +![](images/7f36a218f9f6f52f899632671fe8cd6259db169afe830aea28fa9b99737adbbe.jpg) + +![](images/64a13211d78d0def9a9810239dc6fa17386873896b8f295fc328978453318801.jpg) + +![](images/eb6355d20baf03cfda9609aadf8bf668dec970a580338d1816b245a4ba7eeff0.jpg) +GT +ALL +27.72dB +Easy +23.81dB +Medium +25.98dB +Hard +28.13dB + +Existing VFI algorithms are generally divided into two main categories: kernel-based methods [28, 29] and flow-based methods [16, 17, 39]. Kernel-based methods typically use an adaptive convolution to synthesize intermediate frames by local patches. However, it suffers from a limitation when the motion is larger than the kernel size, which degrades the interpolation results. Furthermore, the memory requirement increases when a large kernel size is used. Flow-based methods, on the other hand, estimate the optical flow between two input frames and synthesize the intermediate frame by warping it with the input frames. Flow-based methods have become promising method in recent years due to advances in flow estimation networks [12, 17, 30]. + +Within consecutive frames, the distribution of motion complexity varies, with some regions containing simple motion patterns such as stationary motion, global motion, and linear motion, and others containing complex motion patterns such as occlusion, fast motion, and local motion. However, existing flow-based VFI algorithms typically train using patches that are cropped random regions of the training data. The motion complexity within these patches is randomly distributed from easy to hard. When the complexity is distributed over a wide range, it is not possible to train optimally for each complexity because each complexity interferes with the others. As a result, the interpolation results are degraded because it cannot optimally estimate all motions in a video with varying motion complexity. Therefore, to achieve optimal results for motion in all regions, it is necessary to interpolate by considering information about each motion complexity within the frame. + +To address these issues, we propose IAM-VFI, a method that estimates the motion complexity of each region of the intermediate frames and interpolates for + +all motions based on their complexity. First, we analyzed the relation between existing VFI results and motion complexity to further investigate the problem. Then, based on the analysis results, we propose a data classification method that classifies the training data into three classes (easy, medium, and hard) according to the motion complexity to optimize the motion estimation network of VFI for each motion complexity. As shown in the Fig. 1, we can see that simply training with complexity-classified data improves the results for specific complexities. + +Finally, we propose a Motion Complexity Estimation Network (MCENet) that estimate the complexity of the motion in each region of the intermediate frame and adaptively interpolate all the motions according to their complexity. MCENet generates a Motion Complexity Map (MCM) that represents the motion complexity within a frame. Experimental results show that the proposed method can significantly improve performance when applied to existing VFI algorithms. + +In summary, this paper has the following main contributions: + +- We analyse the relation between the motion complexity and the interpolation results and propose a dataset classification method. +- We propose the IAM-VFI algorithm that can handle any motion within the frame with varying distributions of motion complexity. +- We propose a novel network called MCENet and a complexity loss to generate a MCM that to handle all region within the frame. +- The proposed methods can be simply applied to previous flow-based VFI algorithms and achieve significant performance. + +# 2 Related Works + +# 2.1 Flow-based Video Frame Interpolation + +Deep learning based VFI algorithms typically take two consecutive frames $(I_0, I_1)$ as input and generates the intermediate frame $\hat{I}_t$ , $0 < t < 1$ through a VFI network $\phi$ with parameters $\Theta$ . + +$$ +\hat {I} _ {t} = \phi \left(I _ {0}, I _ {1}; \Theta\right) \tag {1} +$$ + +In recent years, advances in optical flow estimation networks have made flow-based methods become a dominant approach for VFI algorithms. Most flow-based VFI algorithms typically involve as following steps. First estimate optical flows $F_{0\rightarrow 1},F_{1\rightarrow 0}$ between two frames through a flow network. Then the flows are warped with the input frames to generate intermediate frame. For warping, some algorithms generate $F_{0\rightarrow t},F_{1\rightarrow t}$ by scaling the flow between two frames, and then use forward warping to generate two warped frames $I_{0\rightarrow t},I_{1\rightarrow t}$ . However, the problem with forward warping is that it creates holes in the interpolated frame. For this reason, most recent VFI algorithms use backward warping by creating $F_{t\rightarrow 0},F_{t\rightarrow 1}$ . + +$$ +\hat {I} _ {0 \rightarrow t} = \phi_ {w} \left(I _ {0}, F _ {0 \rightarrow t}\right), \hat {I} _ {1 \rightarrow t} = \phi_ {w} \left(I _ {1}, F _ {1 \rightarrow t}\right) \tag {2} +$$ + +where $\phi_w$ is a backward warp operation. Then, generate a temporary intermediate frame $\tilde{I}_t$ with the two warped frames and the mask obtained by the flow network [17, 36]. + +$$ +\tilde {I} _ {t} = M \odot \hat {I} _ {0 \rightarrow t} + (1 - M) \odot \hat {I} _ {1 \rightarrow t} \tag {3} +$$ + +Finally, generate an intermediate frame $\hat{I}_t$ by adding the estimated residuals $\beta_t$ using the synthesis network [8,33,39]. + +$$ +\hat {I} _ {t} = \tilde {I} _ {t} + \beta \tag {4} +$$ + +Previous flow-based VFI algorithms suffer from the issues that the receptive field size is limited, and therefore it is challenging to handle fast motion with large pixel displacements or complex videos with occlusion and context details. To address this issues, Sim et al. proposed XVFI, a recursive multi-scale structure for processing 4K video with large motion, and also released the X4K1000FPS dataset with extreme motion [34]. To handle large and complex motion, Jin et al. proposed an EBME [17] that guides the flow through correlation volumes. And various flow networks have been proposed in recent years that utilize pyramid structure [16, 17] to enlarge receptive field, and utilize transformer [24, 40] to capture long-range correspondence. As a result, these methods have achieved impressive results for handling large and complex motions. + +However, interpolating complex frames with many occlusion regions or various motion distributions within the frame still remains as a challenging problem. In addition, there is the problem of poor performance of interpolation on data other than training data. + +# 2.2 Region-aware Image & Video Restoration + +In a video (or image), each region has various characteristics of spatial complexity, such as edges and noise, and temporal complexity, such as the degree of motion between frames. Therefore, in the restoration task, it is important to understand the characteristics of each region for accurate restoration. + +As an example of utilizing spatial complexity, Rad et al. proposed SROBB [32], which uses different weights for loss based on the OBB (Object, Background, Boundary) labels within the frame. And Kong et al. proposed ClassSR [20], which categorizes each patch in a frame as easy, medium, or hard based on the PSNR and restores each patch appropriately. Recently, the Segmentation Anything Model (SAM) [18] has been utilized for region aware restoration tasks [15, 37]. + +In VFI, it is also important to interpolate the intermediate frame with considering the spatial and temporal characteristics of the video. However, existing VFI algorithms have been interpolating without considering these characteristics. As a result, it is difficult to interpolate all regions of large videos with varying distributions of motion complexity. To address the limitations of existing VFI algorithms, we propose IAM-VFI, a method for interpolating all regions in videos with motion complexity. + +![](images/fefd59fa597e1df4d2e8f0c15617de10db3f01cc66fe4dd0af88722a25fb24ac.jpg) +Fig.2: SI & TI distribution of VFI benchmark + +Table 1: Interpolation results of subclips in HD data + +
NamePSNR
HD DatasetParkrun29.587
Shields36.236
Stockholm35.304
Bluesky41.438
Kimono35.983
Parkscene37.482
Sunflower35.994
Sintel Alley230.452
Sintel Market521.077
Sintel Temple127.57
Sintel Temple223.19
+ +# 3 Proposed Methods + +In this section, we first explore the problems with existing algorithms by analysing the relation between video complexity and VFI results in Sec. 3.1. Then, in Sec. 3.2, we describe a data classification method to address the existing problems. Finally, we describe the overall structure of our proposed IAM-VFI to interpolate any motion within the frame in Sec. 3.3, and describe the proposed MCENet to estimate the motion complexity of each region in Sec. 3.4. + +# 3.1 Relation between Video Complexity & Interpolate results + +We conducted the analysis in this section to explore the limitations of existing algorithms. The algorithm we used for the analysis is RIFE [12], a representative flow-based VFI algorithm. And we used Spatial Information (SI) and Temporal Information (TI) [13] to find the relation between the complexity of the video with the interpolation results. SI and TI are often used to ensure that videos span the appropriate range of spatio-temporal complexity and are used to classify video data according to complexity [9, 35]. It is also used when creating source videos to ensure that the distribution of video complexity is appropriate [2], and recently SI/TI has been used as a feature of deep learning-based video quality metrics [10]. SI is a measure of the amount of spatial detail by computing the sobel filter vertically and horizontally to detect edges within a frame and considering the standard deviation of the detected edges: + +$$ +S I = \operatorname {s t d} _ {\text {s p a c e}} [ \operatorname {S o b e l} \left(F _ {n}\right) ] \tag {5} +$$ + +Where $F_{n}$ is the $n_{th}$ frame of the video. Higher SI value indicate that the frame contains more detail are has a higher spatial complexity. TI is a measure of the amount of temporal variation in a video sequence. TI first calculates + +![](images/fd019c93d50922aec1787622b1287ff6a7c1c3e9bf3ae83aed99f3d9a1221ab6.jpg) +(a) Relation between TI and PSNR in HD +Fig. 3: Relation between spatiotemporal information (SI/TI) & PSNR + +![](images/55502ad5020d6c37b1c15097051435ae9449511907989aba09d9e018ef5d7abb.jpg) +(b) Relation between SI and PSNR in HD + +the amount of variation between two adjacent frames by calculating the difference between the current frame and the previous frame, and then considers the standard deviation of the variation to calculate temporal complexity. + +$$ +M _ {n} (i, j) = F _ {n} (i, j) - F _ {n - 1} (i, j) \tag {6} +$$ + +$$ +T I = s t d _ {s p a c e} (M _ {n} (i, j)) \qquad \qquad (7) +$$ + +Where $M_{n}$ represents the difference between the current frame $F_{n}$ and the previous frame $F_{n - 1}$ . A higher value of TI indicates that more motion is included between two frames. + +Video complexity is an important factor in VFI, so we analysed the relation between SI/TI and interpolation results to find out the reason why the existing VFI algorithms perform poorly on data that deviates from the characteristics of the training data. As shown in the Fig. 2, we can see that the SI/TI distribution of the Vimeo90K [38] train dataset, which is commonly used for training, contains the entire Vimeo90K test dataset. As a result, the existing training methods perform well on interpolate the Vimeo90K test data. However, some of the subclips in the HD [1] dataset have SI/TI that are out of the distribution of the training data. In this case, we can observe that the PSNR of subclips outside the distribution of the training data degrades in Tab. 1. Based on this, we further analyze the relation between SI/TI and PSNR. As shown in Fig. 3a, PSNR is more closely related to TI, which is important for accurately estimating motion in VFI. It shows that PSNR degrades as the complexity of motion between frames increases. In contrast, SI, the spatial complexity of the interpolation, is not closely related to the interpolation result, as shown in Fig. 3b. + +![](images/6327e9f934a48630b7d9eea5968bfeb4feac90e301f33b32a2d2a849bb493f69.jpg) +Fig. 4: Overview of our IAM-VFI. The Flow Network in stage 1 is the Flow Network of the existing VFI algorithm. It is trained with our proposed easy, medium, and hard datasets, respectively, to optimize for the motion complexity. The Synthesis Network in stage 2 is the synthesis network of the existing VFI algorithm. + +# 3.2 Data classification Method + +Previous training methods typically train with patches cropped from random regions of the input image. However, the complexity of motion within the patch is also randomized, leading to suboptimal training for each complexity. As a result, it suffers from poor results for videos with varying complexity distribution within the video. To address this problem, we propose a data classification method that classifies the existing training dataset into easy, medium, and hard datasets according to motion complexity based on the analysis of Sec. 3.1. + +First we created Vimeo90K(X2), which is a $\times 2$ upsampling of Vimeo90K [38] via EDSR [22] to generate more samples for larger motions, and we use both Vimeo90K and Vimeo90K(X2) data for classification. To avoid training randomly cropped regions, we first overlapped parts of the dataset and cropped them into patches of $256 \times 256$ size. We then calculated the TI to classify the data based on the motion complexity of each cropped patch. Based on the calculated TI, we set a threshold to divide the number of data into three parts: easy, medium, and hard datasets. The effectiveness of our proposed data classification method can be seen in Sec. 5.1. + +# 3.3 IAM-VFI Overview + +To identify the motion complexity for each region in the frame and to handle all motion, we propose IAM-VFI. Our proposed IAM-VFI is trained in two stages, as shown in Fig. 4. In the first stage, we train a flow estimate network with easy, medium, and hard datasets, each classified by motion complexity, to perform motion optimization for that complexity. The flow estimation network trained on each data generates optimized frames $\tilde{I}_t^e,\tilde{I}_t^m,\tilde{I}_t^h$ , for each complexity. The generated frames are then concatenated and used as input for the second stage. + +![](images/cfdbba4f18ee0a2da2304cf77104b368332388e006273beae4f7f88ef2cee080.jpg) + +![](images/b62b2bf105cb092f8e2deb77ab32818fc1288ac7cf82bbd03d8b58974cfe6fb6.jpg) +Fig. 5: The network structure of Motion Complexity Estimation Network + +![](images/b4402019809d0f8802678456391052a22985b916c8eaa9bc883f2cc094d193f7.jpg) + +$$ +\tilde {I} _ {t} = \operatorname {C o n c a t} \left(\tilde {I} _ {t} ^ {e}, \tilde {I} _ {t} ^ {m}, \tilde {I} _ {t} ^ {h}\right) \tag {8} +$$ + +The second stage receives each optimized frame as input and generates a Motion Complexity Map $(MCM_{t})$ using a Motion Complexity Estimation Network (MCENet) to estimate the complexity of each region in the intermediate frame. Then perform a linear combination of the generated $MCM_{t}$ and the input image $\tilde{I}_t$ to generate a temporal intermediate frame $\hat{I}_t$ . And the generated $MCM_{t}$ is used as input to provide information about the motion complexity to the synthesis network of the existing VFI algorithm to estimate the residual. Finally, the residual is added to the temporal intermediate frame to generate the final interpolated frame $I_t$ . + +# 3.4 Motion Complexity Estimation Network + +We propose MCENet, a network for estimating the motion complexity of each region of the intermediate frames to be interpolated and handling them according to the motion complexity of each region. First, MCENet takes as input $\tilde{I}_t^e,\tilde{I}_t^m$ , and $\tilde{I}_t^h$ , the optimized results for each motion complexity, and generates an $MCM_{t}\in \mathbb{R}^{3\times H\times W}$ that estimate the motion complexity of the region. The generated $MCM_{t}$ consists of three channels, each representing a probability value for whether this region is close to easy, medium, or hard. We then perform a linear combination of multiplying each channel by the $\tilde{I}_t^e,\tilde{I}_t^m$ , and $\tilde{I}_t^h$ frames respectively to generate $\hat{I}_t$ , the frame that reflects the complexity. As a result, $MCM_{t}$ also controls the region on the boundary of each class by giving more weight to the most probable values among the three classified easy, medium, and hard values. + +$$ +\hat {I} _ {t} = \sum_ {c \in e, m, h} M C M _ {t} ^ {c} \tilde {I} _ {t} ^ {c} \tag {9} +$$ + +We construct MCENet with a U-Net structure for simple application to existing VFI algorithms and propose Motion Attention Block (MAB) for estimating motion complexity more efficiently. The detailed architecture of MCENet and MAB can be seen in Fig. 5. + +To effectively train $MCM_{t}$ , we propose a novel loss function, complexity loss. The frame $\hat{I}_{t}$ generated by the $MCM_{t}$ , contains information about the complexity of the motion in each region. Therefore, it is not effective to use a loss function to reduce the error with GT, which does not contain information about complexity. For this reason we generate $MCM_{gt}$ , which contains information about the complexity of the motion. To generate the $MCM_{gt}$ , we compute the error between the optimized frame and the ground truth for each pixel by motion complexity. We then assign a 1 to the channel of the $MCM_{gt}$ that represents the class with the minimum error at each pixel, and a 0 to the other channels. This allows the $MCM_{gt}$ to represent the best motion complexity class at each pixel. + +$$ +M C M _ {g t} ^ {c} (i, j) = \left\{ \begin{array}{l l} 1, & \text {i f} c = \underset {c \in \{e, m, h \}} {\operatorname {a r g m i n}} \left(\left| g t (i, j) - \tilde {I} _ {t} ^ {c} (i, j) \right|\right) \\ 0, & \text {o t h e r w i s e} \end{array} \right. \tag {10} +$$ + +Finally, we compute a linear combination of the generated MCM and each frame to generate $\hat{I}_{MCM}$ + +$$ +\hat {I} _ {M C M} = \sum_ {c \in \{e, m, h \}} M C M _ {g t} ^ {c} \tilde {I} _ {t} ^ {c} \tag {11} +$$ + +We update the $MCM_{t}$ by taking the L1 loss between two frames $\hat{I}_{t}$ and $\hat{I}_{MCM}$ that contain the motion complexity. + +$$ +\mathcal {L} _ {c} = \left\| \hat {I} _ {t} - \hat {I} _ {M C M} \right\| _ {1} \tag {12} +$$ + +The effect on $\mathcal{L}_c$ was verified in Sec. 5.3. + +# 4 Experiment + +# 4.1 Implement details + +Training Dataset. We first trained the flow network using the classified datasets introduced in Sec. 3.2. Then, we freeze the flow network and trained the MCENet and synthesis network. Since the classified datasets are the data proposed to optimize each motion, we used the original Vimeo90K to train MCENet and synthesis network. The Vimeo90K data consists of 51,312 triplets and has a resolution of $448 \times 256$ . + +Training Strategy. We applied the proposed methods to the flow-based algorithms RIFE [12] and EMA-VFI [40]. The experiments were implemented based on the official code presented in the paper. For both proposed stages, we used the same optimization techniques such as batch size, optimizer, scheduler, and + +learning rate as used in RIFE and EMA-VFI, and trained for the same iterations. Our training was performed on a single NVIDIA RTX A6000. + +Loss Function. In the first stage, we used the same loss function used in the original networks for training the flow estimation network. In the second step, we used $\mathcal{L}_{syn}$ , the reconstruction loss used to train synthesis network in RIFE and EMA-VFI, and $\mathcal{L}_c$ , the loss function proposed in Sec. 3.4 to train the MCENet. + +$$ +\mathcal {L} _ {\text {t o t a l}} = \lambda_ {s} \mathcal {L} _ {\text {s y n}} + \lambda_ {f} \mathcal {L} _ {c} \tag {13} +$$ + +where we set $\lambda_s = 0.5$ , $\lambda_f = 0.5$ to balance the loss values. + +# 4.2 Benchmarks and Evaluation Metrics + +Our proposed methods are to handle various motion complexities. Therefore, we evaluated our proposed method on the following datasets with various motion complexities. + +SNU-FILM [4] : 1280x720 resolution with a total of 1240 frames, categorized into easy, medium, hard, and extreme according to the motion magnitude. + +HD [1] : It consists of 11 videos. The HD dataset consists of four 1080p, three 720p and four 544p videos, and we used the first 100 frames of each video + +UVG [25]: It consists of 7 videos with 3840x2160 resolution, and we used the first 300 frames of each video. + +Xiph [26]: It contains 19 video sequences, each consisting of 31 consecutive 4K resolution frames. We followed [27] method to downsample and center-crop the 4K images to create a 2K resolution and evaluate both Xiph4K and Xiph2K. + +Metrics. We used Peak Signal-To-Noise Ratio (PSNR) and Structural-Similarity-Image-Metric (SSIM), commonly used objective quality metrics, where a higher PSNR and SSIM indicate better quality. To evaluate runtime, we measured all algorithms at 720p resolution to be fair, and we used a single NVIDIA RTX A6000 GPU. + +# 5 Results + +# 5.1 Data Classification method + +We first validate our proposed data classification method. The proposed method aims to optimize for the complexity of each motion, so we exclude the influence + +Table 2: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR value) + +
Benchmark Train DataVimeo90KUVG
easymediumhardeasymediumhard
Vimeo90K43.54336.49532.13148.33836.31730.052
Ourseasy43.95536.40231.72749.02736.29129.338
Oursmedium43.95137.01232.58848.50936.85130.289
Ourshard43.63236.99132.72147.83136.81530.611
+ +Table 3: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR/SSIM values within each dataset and Blue indicates second best and Green indicates third best.) We followed the test procedures of [12] for HD, [19] for SNU-FILM, and [11] for Xiph to ensure a fair comparison. "OOM" indicates "Out of Memory" and "+" indicates the results we obtained by retraining to compare results. + +
AlgorithmHDSNU-FILMUVGXiph
EasyMediumHardExtreme2K4K
SepConv [29]30.87/0.93039.41/0.99034.97/0.97629.36/0.92524.31/0.84426.11/0.86434.77/0.92932.06/0.880
CAIN [4]31.45/0.93939.91/0.99035.57/0.97729.87/0.92924.73/0.85030.32/0.90235.21/0.93732.56/0.901
AdaCoF [21]31.43/0.93339.84/0.99035.07/0.97529.47/0.92424.31/0.843OOM34.86/0.92832.19/0.882
CDFI [6]31.46/0.93740.11/0.99035.51/0.97729.74/0.92724.54/0.847OOM35.48/0.94032.47/0.903
ABME [31]32.17/0.94339.59/0.99035.51/0.97829.47/0.93625.23/0.863OOM35.18/0.96432.36/0.940
IFRNet [19]32.15/0.94340.02/0.99035.93/0.97930.40/0.93525.05/0.85831.33/0.90436.24/0.96433.38/0.941
M2M-PWC [11]31.23/0.93739.59/0.99035.68/0.97930.27/0.93625.07/0.86030.89/0.91036.40/0.96733.77/0.943
VFIformer [24]OOM40.12/0.99136.09/0.98030.67/0.93725.20/0.863OOMOOMOOM
EBME [17]32.44/0.94539.98/0.99135.74/0.97930.40/0.93525.24/0.86131.79/0.91536.33/0.96533.71/0.942
RIFE† [12]32.08/0.94239.98/0.99035.78/0.97830.14/0.93324.84/0.85331.13/0.90036.15/0.96433.25/0.940
RIFEours32.46/0.94640.18/0.99136.05/0.98030.58/0.93725.35/0.86332.17/0.91736.60/0.96634.20/0.946
EMA-VFI† [40]32.62/0.94840.17/0.99135.97/0.97930.64/0.93525.27/0.85731.19/0.90736.71/0.96633.69/0.944
EMA-VFIours32.89/0.95140.28/0.99236.30/0.98130.88/0.93825.59/0.86432.12/0.91637.01/0.96834.29/0.947
+ +of synthesis networks for accurate validation. We use the proposed easy, medium, and hard datasets to train IFNet, the flow network of RIFE. And warped the estimated flows and input frames then generate temporal intermediate frames using Eq. (3). The Benchmark used for validation was Vimeo90K test and UVG, and was divided into 256x256 patches to avoid varying complexity within the region and the TI of each patch was calculated and classified as easy, medium, or hard. + +As shown in Tab. 2, we can see that the training with the complexity classified data optimizes the motion estimation performance, resulting in improved PSNR compared to the results trained with the original dataset. This result shows that classification by complexity is effective in optimizing motion. + +# 5.2 Comparison with the State-of-the-Art Methods + +To compare the proposed methods, we used the kernel-based algorithms SepConv [29], AdaCoF [21], and CDFI [6], the flow-based algorithms ABME [31], IFRNet [19], M2M-PWC [11], VFformer [24], EBME [17], and the other method CAIN [4]. We applied our methods to the flow-based algorithms RIFE [12] and EMAVFI [40]. + +Tab. 3 summarizes the quantitative comparison with existing VFI algorithms on various benchmarks to show the effectiveness of the proposed methods. The performance of the original RIFE is slightly worse compared to the state-of-the-art algorithms, but we can see that our proposed method improves performance on all benchmarks. In particular, for UVG and Xiph4K, which are high-resolution videos with various motion complexity, we can see the PSNR improvements of 1.04 dB and 0.95 dB, respectively, with the best results for UVG data + +![](images/81bf6288cf6d90bbd9ae1cb23a2ef93b1afab7183c9c01e7a530c5e0b4928605.jpg) + +![](images/c15a4b2c9d9f510fbf3370f92f2677b6cb8566283a6ec7374d2d60d3976f856a.jpg) +(a) Visual comparison of IAM-VFI applied to EMA-VFI with the SOTA algorithm +(b) Visual comparison of IAM-VFI applied to RIFE with the SOTA algorithm +Fig. 6: Visual comparison on extreme subset of SNU-FILM [4] and HD [1] benchmarks. + +compared to the state-of-the-art algorithms. Other benchmarks also achieved second or third best results. And when the IAM-VFI method is applied to the recently proposed EMA-VFI, we can see that it achieves the best performance in all benchmarks except UVG, with an improvement of 0.93 dB in UVG and 0.60 dB in Xiph4K compared to the original algorithm. + +In Fig. 6, we compare the subjective image quality of the results of applying IAM-VFI to RIFE and EMA-VFI with other algorithms. In the first column of Fig. 6a, we can see that IAM-VFI can handle large motions and the second column demonstrated that images with complex motion and detail are also improved. In the first column of Fig. 6b, the occlusion regions of the object and background are sharply interpolated and the face is interpolated clearly. And in the second column, the edge regions are also interpolated sharply. + +![](images/23d632b9af9ffeda68aee26f37c8f32accdb6a3172081502217d85f36811f119.jpg) +Fig. 7: Subjective image quality comparison for the effectiveness of MCM. The first column shows, from left, the overlap of the two input images, each channel of the $MCM_{t}$ representing the probabilities of easy, medium, and hard, and the interpolation results of the original RIFE. The second column shows, from left, the ground truth of the intermediate frames to be interpolated, the intermediate frames optimized to easy, medium and hard using the data classification method, and the interpolation results of IAM-VFI. + +# 5.3 Ablation Studies + +We performed the ablation study to demonstrate the effectiveness of the proposed methods. For comparison, we used all benchmark datasets and compared the inference time of applying the proposed method to the existing VFI algorithm. In Tab. 4, the baseline without applying all the proposed methods is the original RIFE [12] algorithm. + +Effect of MCENet. The second column is the result of simply weighting each of the frames optimized for each class by the classified data by 0.33. We can see that the PSNR degrades for most of the benchmarks because we do not take into account the complexity of each region. In contrast, when we generate an $MCM_{t}$ using MCENet to estimate the complexity of each region and adaptively weight each region, we see that performance improves compared to the baseline for all benchmarks. + +In Fig. 7, we can see the optimized results for each motion and a visualisation of each channel of the $MCM_{t}$ generated by MCENet. We can see that the regions with large motion are classified as hard motion complexity, and the optimized result with hard data interpolates the large motion regions clearly. Also in the occlusion region, we can see that the motion complexity is classified as hard due to the different motion of the two overlapped objects, and the edges are sharply interpolated. And global motions are classified as easy or medium. Finally, when small objects such as branches move, the distribution of their motions varies, + +Table 4: Ablation studies for our proposed methods. M.O stands for Motion Optimisation with classified data. (Red indicates the best PSNR). + +
M.OMCENetLcMABSynMCMHDSNU-FILMUVGXiphRuntime
EasyMediumHardExtreme2K4K
×××××32.0839.9835.7830.1424.8331.1336.1533.2548.3ms
✓××××31.9738.3935.1530.2225.2331.6035.8033.6068.3ms
✓✓×××32.3240.0536.0330.5925.3532.0236.3333.9278.7ms
✓✓✓××32.4240.1136.0430.5825.3432.0836.5634.0678.7ms
✓✓✓✓×32.4540.1436.0530.5925.3532.1536.6034.1282.7ms
✓✓✓✓✓32.4640.1836.0830.6025.3532.1736.6034.2087.5ms
+ +so they are classified as complex motions, and you can see that the previously blurred parts are interpolated clearly. + +Effect of Motion Complexity Loss. The $\hat{I}_t$ generated by $MCM_t$ contains information about the complexity of each regions. Therefore, we can see that using the loss function for frames with complexity information reflected through $MCM_{qt}$ rather than using the loss with GT is effective. + +Effect of MAB. Each channel of MCM represents the probability value for whether the complexity of the corresponding area falls into easy, medium, or hard. Therefore, the PSNR is improved when MAB is used in MCENet to give attention for each channel. + +Synthesis Network with MCM. Using the $MCM_{t}$ as an additional input to the synthesis network to provide information about motion complexity can improve performance on most of the benchmarks. + +# 5.4 Limitations + +By applying the proposed method to the existing algorithm, we achieved a significant improvement in interpolation results, but it still has several limitations. First, the flow network needs to be trained for each classified dataset to optimize for motion, resulting in increased training time. Second, compared to the existing network, the runtime increases. In future work, we will attempt to optimize for all motion complexities using a single flownet. + +# 6 Conclusion + +This paper aims to address the problem that existing VFI algorithms do not consider motion complexity and therefore fail to perform optimally for all regions. We solve this problem by combining three intermediate frames, which are derived by different flow networks, with motion complexity map. Experimental results show that the proposed method of interpolating frame by considering motion complexity improves the interpolation performance of existing VFI algorithms and achieves enhanced quality for all regions in the video. + +# Acknowledgements + +This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2021-0-00087, Development of high-quality conversion technology for SD/HD low-quality media) + +# References + +1. Bao, W., Lai, W.S., Zhang, X., Gao, Z., Yang, M.H.: Memc-net: Motion estimation and motion compensation driven neural network for video interpolation and enhancement. IEEE transactions on pattern analysis and machine intelligence 43(3), 933-948 (2019) +2. Barman, N., Zadtootaghaj, S., Schmidt, S., Martini, M.G., Möller, S.: Gamingvideoset: a dataset for gaming video streaming applications. In: 2018 16th Annual Workshop on Network and Systems Support for Games (NetGames). pp. 1-6. IEEE (2018) +3. Brooks, T., Barron, J.T.: Learning to synthesize motion blur. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6840-6848 (2019) +4. Choi, M., Kim, H., Han, B., Xu, N., Lee, K.M.: Channel attention is all you need for video frame interpolation. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 10663-10671 (2020) +5. Dar, Y., Bruckstein, A.M.: Motion-compensated coding and frame rate upconversion: Models and analysis. IEEE Transactions on Image Processing 24(7), 2051-2066 (2015) +6. Ding, T., Liang, L., Zhu, Z., Zharkov, I.: Cdfi: Compression-driven network design for frame interpolation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8001-8011 (2021) +7. Flynn, J., Neulander, I., Philbin, J., Snavely, N.: Deepstereo: Learning to predict new views from the world's imagery. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5515-5524 (2016) +8. Fourure, D., Emonet, R., Fromont, E., Muselet, D., Tremeau, A., Wolf, C.: Residual conv-deconv grid network for semantic segmentation. arXiv preprint arXiv:1707.07958 (2017) +9. Fremerey, S., Goring, S., Rao, R.R.R., Huang, R., Raake, A.: Subjective test dataset and meta-data-based models for $360^{\circ}$ streaming video quality. In: 2020 IEEE 22nd International Workshop on Multimedia Signal Processing (MMSP). pp. 1-6. IEEE (2020) +10. Göring, S., Rao, R.R.R., Feiten, B., Raake, A.: Modular framework and instances of pixel-based video quality models for uhd-1/4k. IEEE Access 9, 31842-31864 (2021) +11. Hu, P., Niklaus, S., Sclaroff, S., Saenko, K.: Many-to-many splatting for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3553-3562 (2022) +12. Huang, Z., Zhang, T., Heng, W., Shi, B., Zhou, S.: Real-time intermediate flow estimation for video frame interpolation. In: European Conference on Computer Vision. pp. 624-642. Springer (2022) + +13. Installations, T., Line, L.: Subjective video quality assessment methods for multimedia applications. Networks 910(37), 5 (1999) +14. Jiang, H., Sun, D., Jampani, V., Yang, M.H., Learned-Miller, E., Kautz, J.: Super slomo: High quality estimation of multiple intermediate frames for video interpolation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 9000-9008 (2018) +15. Jiang, J., Holz, C.: Restore anything pipeline: Segment anything meets image restoration. arXiv preprint arXiv:2305.13093 (2023) +16. Jin, X., Wu, L., Chen, J., Chen, Y., Koo, J., Hahm, C.h.: A unified pyramid recurrent network for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1578-1587 (2023) +17. Jin, X., Wu, L., Shen, G., Chen, Y., Chen, J., Koo, J., Hahm, C.h.: Enhanced bidirectional motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5049-5057 (2023) +18. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) +19. Kong, L., Jiang, B., Luo, D., Chu, W., Huang, X., Tai, Y., Wang, C., Yang, J.: Ifrnet: Intermediate feature refine network for efficient frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1969-1978 (2022) +20. Kong, X., Zhao, H., Qiao, Y., Dong, C.: Classsr: A general framework to accelerate super-resolution networks by data characteristic. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12016-12025 (2021) +21. Lee, H., Kim, T., Chung, T.y., Pak, D., Ban, Y., Lee, S.: Adacof: Adaptive collaboration of flows for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5316-5325 (2020) +22. Lim, B., Son, S., Kim, H., Nah, S., Mu Lee, K.: Enhanced deep residual networks for single image super-resolution. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 136-144 (2017) +23. Liu, Z., Yeh, R.A., Tang, X., Liu, Y., Agarwala, A.: Video frame synthesis using deep voxel flow. In: Proceedings of the IEEE international conference on computer vision. pp. 4463-4471 (2017) +24. Lu, L., Wu, R., Lin, H., Lu, J., Jia, J.: Video frame interpolation with transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3532-3542 (2022) +25. Mercat, A., Viitanen, M., Vanne, J.: Uvg dataset: 50/120fps 4k sequences for video codec analysis and development. In: Proceedings of the 11th ACM Multimedia Systems Conference. pp. 297-302 (2020) +26. Montgomery, C., Lars, H.: Xiph.org video test media (derf's collection). Online, https://media.xiph.org/video/derf 6 (1994) +27. Niklaus, S., Liu, F.: Softmax splatting for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5437-5446 (2020) +28. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017) +29. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017) + +30. Park, J., Ko, K., Lee, C., Kim, C.S.: Bmbc: Bilateral motion estimation with bilateral cost volume for video interpolation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 109-125. Springer (2020) +31. Park, J., Lee, C., Kim, C.S.: Asymmetric bilateral motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14539-14548 (2021) +32. Rad, M.S., Bozorgtabar, B., Marti, U.V., Basler, M., Ekenel, H.K., Thiran, J.P.: Srobb: Targeted perceptual loss for single image super-resolution. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 2710-2719 (2019) +33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) +34. Sim, H., Oh, J., Kim, M.: Xvfi: extreme video frame interpolation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 14489-14498 (2021) +35. Song, L., Tang, X., Zhang, W., Yang, X., Xia, P.: The sjtu 4k video sequence dataset. In: 2013 Fifth International Workshop on Quality of Multimedia Experience (QoMEX). pp. 34-35. IEEE (2013) +36. Sun, D., Yang, X., Liu, M.Y., Kautz, J.: Pwc-net: Cnns for optical flow using pyramid, warping, and cost volume. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 8934-8943 (2018) +37. Xiao, Z., Bai, J., Lu, Z., Xiong, Z.: A dive into sam prior in image restoration. arXiv preprint arXiv:2305.13620 (2023) +38. Xue, T., Chen, B., Wu, J., Wei, D., Freeman, W.T.: Video enhancement with task-oriented flow. International Journal of Computer Vision 127, 1106-1125 (2019) +39. Yoon, K., Huh, J., Kim, Y.H., Kim, S., Jeong, J.: Textural detail preservation network for video frame interpolation. IEEE Access (2023) +40. Zhang, G., Zhu, Y., Wang, H., Chen, Y., Wu, G., Wang, L.: Extracting motion and appearance via inter-frame attention for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5682-5692 (2023) +41. Zhou, T., Tulsiani, S., Sun, W., Malik, J., Efros, A.A.: View synthesis by appearance flow. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part IV 14. pp. 286-301. Springer (2016) \ No newline at end of file diff --git a/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/images.zip b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..e7f9905d5016b7c2072a47a7c3e2cefc89f09573 --- /dev/null +++ b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:84ae79f4de1c7cf30f940d461cb21efca2d9476b1d37468d0dedbb0a68d98ec6 +size 733960 diff --git a/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/layout.json b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..d246adeec1aee7fb736925f6468129afe01519b8 --- /dev/null +++ b/2024/IAM-VFI _ Interpolate Any Motion for Video Frame Interpolation with motion complexity map/layout.json @@ -0,0 +1,9531 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 133, + 111, + 479, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 111, + 479, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 111, + 479, + 148 + ], + "type": "text", + "content": "IAM-VFI : Interpolate Any Motion for Video Frame Interpolation with motion complexity map" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "spans": [ + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "text", + "content": "Kihwan Yoon" + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "text", + "content": ", Yong Han Kim" + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "text", + "content": ", Sungjei Kim" + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{2,\\dagger}" + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "text", + "content": ", and Jinwoo Jeong" + }, + { + "bbox": [ + 138, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{2,\\dagger}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 197, + 189, + 417, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 189, + 417, + 201 + ], + "spans": [ + { + "bbox": [ + 197, + 189, + 417, + 201 + ], + "type": "text", + "content": "1 University of Seoul, Seoul 02504, Republic of Korea" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 141, + 201, + 471, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 201, + 471, + 213 + ], + "spans": [ + { + "bbox": [ + 141, + 201, + 471, + 213 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 141, + 201, + 471, + 213 + ], + "type": "text", + "content": " Korea Electronics Technology Institute, Gyeonggi-do 13488, Republic of Korea" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 261, + 213, + 353, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 213, + 353, + 224 + ], + "spans": [ + { + "bbox": [ + 261, + 213, + 353, + 224 + ], + "type": "text", + "content": "rlghksdbsgmail.com" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 270, + 224, + 343, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 224, + 343, + 234 + ], + "spans": [ + { + "bbox": [ + 270, + 224, + 343, + 234 + ], + "type": "text", + "content": "yhkim@uos.ac.kr" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 226, + 235, + 388, + 245 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 226, + 235, + 388, + 245 + ], + "spans": [ + { + "bbox": [ + 226, + 235, + 388, + 245 + ], + "type": "text", + "content": "{jw.jeong, sungjei.kim}@keti.re.kr" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 220, + 246, + 392, + 256 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 246, + 392, + 256 + ], + "spans": [ + { + "bbox": [ + 220, + 246, + 392, + 256 + ], + "type": "text", + "content": "https://github.com/rlghksdsb/IAM-VFI" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 159, + 286, + 455, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 286, + 455, + 495 + ], + "spans": [ + { + "bbox": [ + 159, + 286, + 455, + 495 + ], + "type": "text", + "content": "Abstract. Within the video, different regions have varying motion complexity, with simple regions containing static or global motion and complex regions containing fast motion or lots of local motion. In recent years, the performance of flow-based Video Frame Interpolation (VFI) algorithms has improved significantly. However, existing training methods train on randomly cropped regions of train data without considering the complexity of the motion. As a result, they cannot handle all regions of the frame that contain varying motion complexity. To solve this problem, we propose a novel VFI approach (IAM-VFI) that can interpolate any motion by considering the motion complexity of all regions in the frame. First, we propose a training data classification method for motion optimization based on each motion complexity. Then, using the proposed data, a flow estimation network generates optimized results for each complexity. Finally, we propose a Motion Complexity Estimation Network (MCENet) to generate a Motion Complexity Map (MCM) that can estimate the motion complexity of each region. Our proposed methods can be easily applied to most flow-based VFI algorithms. Experimental results show that the proposed method can interpolate any motion and significantly improve the performance of existing VFI algorithms." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 160, + 506, + 460, + 527 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 506, + 460, + 527 + ], + "spans": [ + { + "bbox": [ + 160, + 506, + 460, + 527 + ], + "type": "text", + "content": "Keywords: Video Frame Interpolation, Optical Flow Estimation, Region-Aware" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 548, + 230, + 562 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 230, + 562 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 230, + 562 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "content": "Video Frame Interpolation (VFI) is a challenging low-level vision task that increases the frame rate by generating a non-existent intermediate frame between two consecutive frames. VFI can be applied to various tasks such as video restoration [3], novel view synthesis [7, 41], slow motion generation [14, 23], and frame up-conversion [5], etc. With the development of deep learning, the performance of VFI algorithms has significantly improved." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 251, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 251, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 251, + 665 + ], + "type": "text", + "content": "† Co-corresponding authors." + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 114, + 305, + 186 + ], + "blocks": [ + { + "bbox": [ + 138, + 114, + 305, + 186 + ], + "lines": [ + { + "bbox": [ + 138, + 114, + 305, + 186 + ], + "spans": [ + { + "bbox": [ + 138, + 114, + 305, + 186 + ], + "type": "image", + "image_path": "afac9481a2cb212cf6366bf4cd5b525dc74f8fbc4b0572bf5ac88885b7d7bcbf.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 138, + 186, + 305, + 250 + ], + "blocks": [ + { + "bbox": [ + 138, + 186, + 305, + 250 + ], + "lines": [ + { + "bbox": [ + 138, + 186, + 305, + 250 + ], + "spans": [ + { + "bbox": [ + 138, + 186, + 305, + 250 + ], + "type": "image", + "image_path": "d09ec48dbeec24644bdfdf31b7f2281baf0fc6ef69acf1dd2104d7fb53ba9b7a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 151, + 251, + 159, + 258 + ], + "lines": [ + { + "bbox": [ + 151, + 251, + 159, + 258 + ], + "spans": [ + { + "bbox": [ + 151, + 251, + 159, + 258 + ], + "type": "text", + "content": "GT" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 182, + 251, + 197, + 258 + ], + "lines": [ + { + "bbox": [ + 182, + 251, + 197, + 258 + ], + "spans": [ + { + "bbox": [ + 182, + 251, + 197, + 258 + ], + "type": "text", + "content": "ALL" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 179, + 258, + 198, + 263 + ], + "lines": [ + { + "bbox": [ + 179, + 258, + 198, + 263 + ], + "spans": [ + { + "bbox": [ + 179, + 258, + 198, + 263 + ], + "type": "text", + "content": "34.08dB" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 215, + 251, + 228, + 258 + ], + "lines": [ + { + "bbox": [ + 215, + 251, + 228, + 258 + ], + "spans": [ + { + "bbox": [ + 215, + 251, + 228, + 258 + ], + "type": "text", + "content": "Easy" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 213, + 258, + 231, + 263 + ], + "lines": [ + { + "bbox": [ + 213, + 258, + 231, + 263 + ], + "spans": [ + { + "bbox": [ + 213, + 258, + 231, + 263 + ], + "type": "text", + "content": "33.28dB" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 241, + 251, + 255, + 258 + ], + "lines": [ + { + "bbox": [ + 241, + 251, + 255, + 258 + ], + "spans": [ + { + "bbox": [ + 241, + 251, + 255, + 258 + ], + "type": "text", + "content": "Me" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 246, + 258, + 265, + 263 + ], + "lines": [ + { + "bbox": [ + 246, + 258, + 265, + 263 + ], + "spans": [ + { + "bbox": [ + 246, + 258, + 265, + 263 + ], + "type": "text", + "content": "34.56dB" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 282, + 251, + 295, + 258 + ], + "lines": [ + { + "bbox": [ + 282, + 251, + 295, + 258 + ], + "spans": [ + { + "bbox": [ + 282, + 251, + 295, + 258 + ], + "type": "text", + "content": "Hard" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 282, + 258, + 300, + 263 + ], + "lines": [ + { + "bbox": [ + 282, + 258, + 300, + 263 + ], + "spans": [ + { + "bbox": [ + 282, + 258, + 300, + 263 + ], + "type": "text", + "content": "34.47dB" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 137, + 267, + 476, + 285 + ], + "lines": [ + { + "bbox": [ + 137, + 267, + 476, + 285 + ], + "spans": [ + { + "bbox": [ + 137, + 267, + 476, + 285 + ], + "type": "text", + "content": "(a) Interpolation results for region with medium (b) Interpolation results for region with hard motion complexity motion complexity" + } + ] + } + ], + "index": 26, + "angle": 0, + "type": "image_footnote" + }, + { + "bbox": [ + 131, + 294, + 480, + 338 + ], + "lines": [ + { + "bbox": [ + 131, + 294, + 480, + 338 + ], + "spans": [ + { + "bbox": [ + 131, + 294, + 480, + 338 + ], + "type": "text", + "content": "Fig. 1: Example of subjective results of based on motion complexity. In the case of (a), the motion complexity between the two input frames is classified as a medium, and the model trained on data classified as medium is the best. In contrast, (b) has a fast motion complexity and the model trained on the hard data shows the best results." + } + ] + } + ], + "index": 27, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 274, + 114, + 306, + 186 + ], + "blocks": [ + { + "bbox": [ + 274, + 114, + 306, + 186 + ], + "lines": [ + { + "bbox": [ + 274, + 114, + 306, + 186 + ], + "spans": [ + { + "bbox": [ + 274, + 114, + 306, + 186 + ], + "type": "image", + "image_path": "1207a7e07a5590ef84499033073755b16d69f3886b01332bfd23daa09b06aea5.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 274, + 186, + 306, + 250 + ], + "blocks": [ + { + "bbox": [ + 274, + 186, + 306, + 250 + ], + "lines": [ + { + "bbox": [ + 274, + 186, + 306, + 250 + ], + "spans": [ + { + "bbox": [ + 274, + 186, + 306, + 250 + ], + "type": "image", + "image_path": "7f36a218f9f6f52f899632671fe8cd6259db169afe830aea28fa9b99737adbbe.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 308, + 114, + 476, + 186 + ], + "blocks": [ + { + "bbox": [ + 308, + 114, + 476, + 186 + ], + "lines": [ + { + "bbox": [ + 308, + 114, + 476, + 186 + ], + "spans": [ + { + "bbox": [ + 308, + 114, + 476, + 186 + ], + "type": "image", + "image_path": "64a13211d78d0def9a9810239dc6fa17386873896b8f295fc328978453318801.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 308, + 186, + 476, + 250 + ], + "blocks": [ + { + "bbox": [ + 308, + 186, + 476, + 250 + ], + "lines": [ + { + "bbox": [ + 308, + 186, + 476, + 250 + ], + "spans": [ + { + "bbox": [ + 308, + 186, + 476, + 250 + ], + "type": "image", + "image_path": "eb6355d20baf03cfda9609aadf8bf668dec970a580338d1816b245a4ba7eeff0.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 318, + 251, + 326, + 258 + ], + "lines": [ + { + "bbox": [ + 318, + 251, + 326, + 258 + ], + "spans": [ + { + "bbox": [ + 318, + 251, + 326, + 258 + ], + "type": "text", + "content": "GT" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 348, + 251, + 366, + 258 + ], + "lines": [ + { + "bbox": [ + 348, + 251, + 366, + 258 + ], + "spans": [ + { + "bbox": [ + 348, + 251, + 366, + 258 + ], + "type": "text", + "content": "ALL" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 348, + 258, + 367, + 263 + ], + "lines": [ + { + "bbox": [ + 348, + 258, + 367, + 263 + ], + "spans": [ + { + "bbox": [ + 348, + 258, + 367, + 263 + ], + "type": "text", + "content": "27.72dB" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 384, + 251, + 398, + 258 + ], + "lines": [ + { + "bbox": [ + 384, + 251, + 398, + 258 + ], + "spans": [ + { + "bbox": [ + 384, + 251, + 398, + 258 + ], + "type": "text", + "content": "Easy" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 382, + 258, + 401, + 263 + ], + "lines": [ + { + "bbox": [ + 382, + 258, + 401, + 263 + ], + "spans": [ + { + "bbox": [ + 382, + 258, + 401, + 263 + ], + "type": "text", + "content": "23.81dB" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 415, + 251, + 435, + 258 + ], + "lines": [ + { + "bbox": [ + 415, + 251, + 435, + 258 + ], + "spans": [ + { + "bbox": [ + 415, + 251, + 435, + 258 + ], + "type": "text", + "content": "Medium" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 416, + 258, + 435, + 263 + ], + "lines": [ + { + "bbox": [ + 416, + 258, + 435, + 263 + ], + "spans": [ + { + "bbox": [ + 416, + 258, + 435, + 263 + ], + "type": "text", + "content": "25.98dB" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 452, + 251, + 466, + 258 + ], + "lines": [ + { + "bbox": [ + 452, + 251, + 466, + 258 + ], + "spans": [ + { + "bbox": [ + 452, + 251, + 466, + 258 + ], + "type": "text", + "content": "Hard" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 449, + 258, + 468, + 263 + ], + "lines": [ + { + "bbox": [ + 449, + 258, + 468, + 263 + ], + "spans": [ + { + "bbox": [ + 449, + 258, + 468, + 263 + ], + "type": "text", + "content": "28.13dB" + } + ] + } + ], + "index": 25, + "angle": 0, + "type": "image_caption" + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 364, + 480, + 484 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 480, + 484 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 480, + 484 + ], + "type": "text", + "content": "Existing VFI algorithms are generally divided into two main categories: kernel-based methods [28, 29] and flow-based methods [16, 17, 39]. Kernel-based methods typically use an adaptive convolution to synthesize intermediate frames by local patches. However, it suffers from a limitation when the motion is larger than the kernel size, which degrades the interpolation results. Furthermore, the memory requirement increases when a large kernel size is used. Flow-based methods, on the other hand, estimate the optical flow between two input frames and synthesize the intermediate frame by warping it with the input frames. Flow-based methods have become promising method in recent years due to advances in flow estimation networks [12, 17, 30]." + } + ] + } + ], + "index": 28 + }, + { + "bbox": [ + 130, + 485, + 481, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 481, + 640 + ], + "type": "text", + "content": "Within consecutive frames, the distribution of motion complexity varies, with some regions containing simple motion patterns such as stationary motion, global motion, and linear motion, and others containing complex motion patterns such as occlusion, fast motion, and local motion. However, existing flow-based VFI algorithms typically train using patches that are cropped random regions of the training data. The motion complexity within these patches is randomly distributed from easy to hard. When the complexity is distributed over a wide range, it is not possible to train optimally for each complexity because each complexity interferes with the others. As a result, the interpolation results are degraded because it cannot optimally estimate all motions in a video with varying motion complexity. Therefore, to achieve optimal results for motion in all regions, it is necessary to interpolate by considering information about each motion complexity within the frame." + } + ] + } + ], + "index": 29 + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": "To address these issues, we propose IAM-VFI, a method that estimates the motion complexity of each region of the intermediate frames and interpolates for" + } + ] + } + ], + "index": 30 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": "all motions based on their complexity. First, we analyzed the relation between existing VFI results and motion complexity to further investigate the problem. Then, based on the analysis results, we propose a data classification method that classifies the training data into three classes (easy, medium, and hard) according to the motion complexity to optimize the motion estimation network of VFI for each motion complexity. As shown in the Fig. 1, we can see that simply training with complexity-classified data improves the results for specific complexities." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 200, + 480, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 480, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 480, + 282 + ], + "type": "text", + "content": "Finally, we propose a Motion Complexity Estimation Network (MCENet) that estimate the complexity of the motion in each region of the intermediate frame and adaptively interpolate all the motions according to their complexity. MCENet generates a Motion Complexity Map (MCM) that represents the motion complexity within a frame. Experimental results show that the proposed method can significantly improve performance when applied to existing VFI algorithms." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 284, + 416, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 284, + 416, + 295 + ], + "spans": [ + { + "bbox": [ + 146, + 284, + 416, + 295 + ], + "type": "text", + "content": "In summary, this paper has the following main contributions:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 147, + 303, + 479, + 398 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 147, + 303, + 479, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 303, + 479, + 327 + ], + "spans": [ + { + "bbox": [ + 147, + 303, + 479, + 327 + ], + "type": "text", + "content": "- We analyse the relation between the motion complexity and the interpolation results and propose a dataset classification method." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 147, + 327, + 479, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 327, + 479, + 350 + ], + "spans": [ + { + "bbox": [ + 147, + 327, + 479, + 350 + ], + "type": "text", + "content": "- We propose the IAM-VFI algorithm that can handle any motion within the frame with varying distributions of motion complexity." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 147, + 350, + 479, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 350, + 479, + 373 + ], + "spans": [ + { + "bbox": [ + 147, + 350, + 479, + 373 + ], + "type": "text", + "content": "- We propose a novel network called MCENet and a complexity loss to generate a MCM that to handle all region within the frame." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 147, + 374, + 479, + 398 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 374, + 479, + 398 + ], + "spans": [ + { + "bbox": [ + 147, + 374, + 479, + 398 + ], + "type": "text", + "content": "- The proposed methods can be simply applied to previous flow-based VFI algorithms and achieve significant performance." + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 415, + 242, + 427 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 415, + 242, + 427 + ], + "spans": [ + { + "bbox": [ + 132, + 415, + 242, + 427 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 439, + 354, + 451 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 439, + 354, + 451 + ], + "spans": [ + { + "bbox": [ + 132, + 439, + 354, + 451 + ], + "type": "text", + "content": "2.1 Flow-based Video Frame Interpolation" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "text", + "content": "Deep learning based VFI algorithms typically take two consecutive frames " + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "inline_equation", + "content": "(I_0, I_1)" + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "text", + "content": " as input and generates the intermediate frame " + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "inline_equation", + "content": "\\hat{I}_t" + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "inline_equation", + "content": "0 < t < 1" + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "text", + "content": " through a VFI network " + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "text", + "content": " with parameters " + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "inline_equation", + "content": "\\Theta" + }, + { + "bbox": [ + 132, + 457, + 479, + 493 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 272, + 501, + 480, + 514 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 501, + 480, + 514 + ], + "spans": [ + { + "bbox": [ + 272, + 501, + 480, + 514 + ], + "type": "interline_equation", + "content": "\\hat {I} _ {t} = \\phi \\left(I _ {0}, I _ {1}; \\Theta\\right) \\tag {1}", + "image_path": "fec296184602c35cc9b21556b886075ab73209fbf793270495f9ccdfd6b829cf.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "text", + "content": "In recent years, advances in optical flow estimation networks have made flow-based methods become a dominant approach for VFI algorithms. Most flow-based VFI algorithms typically involve as following steps. First estimate optical flows " + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "inline_equation", + "content": "F_{0\\rightarrow 1},F_{1\\rightarrow 0}" + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "text", + "content": " between two frames through a flow network. Then the flows are warped with the input frames to generate intermediate frame. For warping, some algorithms generate " + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "inline_equation", + "content": "F_{0\\rightarrow t},F_{1\\rightarrow t}" + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "text", + "content": " by scaling the flow between two frames, and then use forward warping to generate two warped frames " + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "inline_equation", + "content": "I_{0\\rightarrow t},I_{1\\rightarrow t}" + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "text", + "content": ". However, the problem with forward warping is that it creates holes in the interpolated frame. For this reason, most recent VFI algorithms use backward warping by creating " + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "inline_equation", + "content": "F_{t\\rightarrow 0},F_{t\\rightarrow 1}" + }, + { + "bbox": [ + 130, + 521, + 480, + 641 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 215, + 653, + 479, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 215, + 653, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 215, + 653, + 479, + 666 + ], + "type": "interline_equation", + "content": "\\hat {I} _ {0 \\rightarrow t} = \\phi_ {w} \\left(I _ {0}, F _ {0 \\rightarrow t}\\right), \\hat {I} _ {1 \\rightarrow t} = \\phi_ {w} \\left(I _ {1}, F _ {1 \\rightarrow t}\\right) \\tag {2}", + "image_path": "7aabe5a3a9cdea49d3cb845b95d819672e0f5c714594b99b63ee69bd180d71b8.jpg" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\phi_w" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " is a backward warp operation. Then, generate a temporary intermediate frame " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\tilde{I}_t" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " with the two warped frames and the mask obtained by the flow network [17, 36]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 235, + 163, + 481, + 177 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 163, + 481, + 177 + ], + "spans": [ + { + "bbox": [ + 235, + 163, + 481, + 177 + ], + "type": "interline_equation", + "content": "\\tilde {I} _ {t} = M \\odot \\hat {I} _ {0 \\rightarrow t} + (1 - M) \\odot \\hat {I} _ {1 \\rightarrow t} \\tag {3}", + "image_path": "1c020a474bb4171d1a043d324f0633b9cea35a8dbb65548629f57508554c689b.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 181, + 479, + 206 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 181, + 479, + 206 + ], + "spans": [ + { + "bbox": [ + 131, + 181, + 479, + 206 + ], + "type": "text", + "content": "Finally, generate an intermediate frame " + }, + { + "bbox": [ + 131, + 181, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\hat{I}_t" + }, + { + "bbox": [ + 131, + 181, + 479, + 206 + ], + "type": "text", + "content": " by adding the estimated residuals " + }, + { + "bbox": [ + 131, + 181, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\beta_t" + }, + { + "bbox": [ + 131, + 181, + 479, + 206 + ], + "type": "text", + "content": " using the synthesis network [8,33,39]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 283, + 216, + 481, + 230 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 283, + 216, + 481, + 230 + ], + "spans": [ + { + "bbox": [ + 283, + 216, + 481, + 230 + ], + "type": "interline_equation", + "content": "\\hat {I} _ {t} = \\tilde {I} _ {t} + \\beta \\tag {4}", + "image_path": "cc30d9516991960bdc85171a3321f36c831ce7df49dd7c2020d9ffb89410dc85.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 234, + 480, + 365 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 234, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 234, + 480, + 365 + ], + "type": "text", + "content": "Previous flow-based VFI algorithms suffer from the issues that the receptive field size is limited, and therefore it is challenging to handle fast motion with large pixel displacements or complex videos with occlusion and context details. To address this issues, Sim et al. proposed XVFI, a recursive multi-scale structure for processing 4K video with large motion, and also released the X4K1000FPS dataset with extreme motion [34]. To handle large and complex motion, Jin et al. proposed an EBME [17] that guides the flow through correlation volumes. And various flow networks have been proposed in recent years that utilize pyramid structure [16, 17] to enlarge receptive field, and utilize transformer [24, 40] to capture long-range correspondence. As a result, these methods have achieved impressive results for handling large and complex motions." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 366, + 480, + 414 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 480, + 414 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 480, + 414 + ], + "type": "text", + "content": "However, interpolating complex frames with many occlusion regions or various motion distributions within the frame still remains as a challenging problem. In addition, there is the problem of poor performance of interpolation on data other than training data." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 431, + 371, + 443 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 431, + 371, + 443 + ], + "spans": [ + { + "bbox": [ + 131, + 431, + 371, + 443 + ], + "type": "text", + "content": "2.2 Region-aware Image & Video Restoration" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 450, + 479, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 479, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 479, + 498 + ], + "type": "text", + "content": "In a video (or image), each region has various characteristics of spatial complexity, such as edges and noise, and temporal complexity, such as the degree of motion between frames. Therefore, in the restoration task, it is important to understand the characteristics of each region for accurate restoration." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 498, + 480, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 498, + 480, + 581 + ], + "spans": [ + { + "bbox": [ + 131, + 498, + 480, + 581 + ], + "type": "text", + "content": "As an example of utilizing spatial complexity, Rad et al. proposed SROBB [32], which uses different weights for loss based on the OBB (Object, Background, Boundary) labels within the frame. And Kong et al. proposed ClassSR [20], which categorizes each patch in a frame as easy, medium, or hard based on the PSNR and restores each patch appropriately. Recently, the Segmentation Anything Model (SAM) [18] has been utilized for region aware restoration tasks [15, 37]." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 582, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 480, + 665 + ], + "type": "text", + "content": "In VFI, it is also important to interpolate the intermediate frame with considering the spatial and temporal characteristics of the video. However, existing VFI algorithms have been interpolating without considering these characteristics. As a result, it is difficult to interpolate all regions of large videos with varying distributions of motion complexity. To address the limitations of existing VFI algorithms, we propose IAM-VFI, a method for interpolating all regions in videos with motion complexity." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 131, + 291, + 245 + ], + "blocks": [ + { + "bbox": [ + 140, + 131, + 291, + 245 + ], + "lines": [ + { + "bbox": [ + 140, + 131, + 291, + 245 + ], + "spans": [ + { + "bbox": [ + 140, + 131, + 291, + 245 + ], + "type": "image", + "image_path": "fefd59fa597e1df4d2e8f0c15617de10db3f01cc66fe4dd0af88722a25fb24ac.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 256, + 308, + 277 + ], + "lines": [ + { + "bbox": [ + 132, + 256, + 308, + 277 + ], + "spans": [ + { + "bbox": [ + 132, + 256, + 308, + 277 + ], + "type": "text", + "content": "Fig.2: SI & TI distribution of VFI benchmark" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 329, + 147, + 458, + 281 + ], + "blocks": [ + { + "bbox": [ + 304, + 125, + 481, + 145 + ], + "lines": [ + { + "bbox": [ + 304, + 125, + 481, + 145 + ], + "spans": [ + { + "bbox": [ + 304, + 125, + 481, + 145 + ], + "type": "text", + "content": "Table 1: Interpolation results of subclips in HD data" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 329, + 147, + 458, + 281 + ], + "lines": [ + { + "bbox": [ + 329, + 147, + 458, + 281 + ], + "spans": [ + { + "bbox": [ + 329, + 147, + 458, + 281 + ], + "type": "table", + "html": "
NamePSNR
HD DatasetParkrun29.587
Shields36.236
Stockholm35.304
Bluesky41.438
Kimono35.983
Parkscene37.482
Sunflower35.994
Sintel Alley230.452
Sintel Market521.077
Sintel Temple127.57
Sintel Temple223.19
", + "image_path": "e22e6b583e5cd4b9272b2d13820ca89f212c6bbda483643a4787b2640c834e71.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 304, + 266, + 319 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 266, + 319 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 266, + 319 + ], + "type": "text", + "content": "3 Proposed Methods" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 333, + 482, + 406 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 333, + 482, + 406 + ], + "spans": [ + { + "bbox": [ + 130, + 333, + 482, + 406 + ], + "type": "text", + "content": "In this section, we first explore the problems with existing algorithms by analysing the relation between video complexity and VFI results in Sec. 3.1. Then, in Sec. 3.2, we describe a data classification method to address the existing problems. Finally, we describe the overall structure of our proposed IAM-VFI to interpolate any motion within the frame in Sec. 3.3, and describe the proposed MCENet to estimate the motion complexity of each region in Sec. 3.4." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 426, + 451, + 440 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 426, + 451, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 426, + 451, + 440 + ], + "type": "text", + "content": "3.1 Relation between Video Complexity & Interpolate results" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 450, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 594 + ], + "type": "text", + "content": "We conducted the analysis in this section to explore the limitations of existing algorithms. The algorithm we used for the analysis is RIFE [12], a representative flow-based VFI algorithm. And we used Spatial Information (SI) and Temporal Information (TI) [13] to find the relation between the complexity of the video with the interpolation results. SI and TI are often used to ensure that videos span the appropriate range of spatio-temporal complexity and are used to classify video data according to complexity [9, 35]. It is also used when creating source videos to ensure that the distribution of video complexity is appropriate [2], and recently SI/TI has been used as a feature of deep learning-based video quality metrics [10]. SI is a measure of the amount of spatial detail by computing the sobel filter vertically and horizontally to detect edges within a frame and considering the standard deviation of the detected edges:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 250, + 608, + 481, + 622 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 250, + 608, + 481, + 622 + ], + "spans": [ + { + "bbox": [ + 250, + 608, + 481, + 622 + ], + "type": "interline_equation", + "content": "S I = \\operatorname {s t d} _ {\\text {s p a c e}} [ \\operatorname {S o b e l} \\left(F _ {n}\\right) ] \\tag {5}", + "image_path": "066cb5aa15ae3b15df380b6af3c2495842c405338260c5c2ef71da18ab67ce56.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": "Where " + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "F_{n}" + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": " is the " + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "n_{th}" + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": " frame of the video. Higher SI value indicate that the frame contains more detail are has a higher spatial complexity. TI is a measure of the amount of temporal variation in a video sequence. TI first calculates" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 157, + 129, + 294, + 264 + ], + "blocks": [ + { + "bbox": [ + 157, + 129, + 294, + 264 + ], + "lines": [ + { + "bbox": [ + 157, + 129, + 294, + 264 + ], + "spans": [ + { + "bbox": [ + 157, + 129, + 294, + 264 + ], + "type": "image", + "image_path": "fd019c93d50922aec1787622b1287ff6a7c1c3e9bf3ae83aed99f3d9a1221ab6.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 153, + 272, + 303, + 283 + ], + "lines": [ + { + "bbox": [ + 153, + 272, + 303, + 283 + ], + "spans": [ + { + "bbox": [ + 153, + 272, + 303, + 283 + ], + "type": "text", + "content": "(a) Relation between TI and PSNR in HD" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 162, + 290, + 451, + 303 + ], + "lines": [ + { + "bbox": [ + 162, + 290, + 451, + 303 + ], + "spans": [ + { + "bbox": [ + 162, + 290, + 451, + 303 + ], + "type": "text", + "content": "Fig. 3: Relation between spatiotemporal information (SI/TI) & PSNR" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 314, + 129, + 453, + 264 + ], + "blocks": [ + { + "bbox": [ + 314, + 129, + 453, + 264 + ], + "lines": [ + { + "bbox": [ + 314, + 129, + 453, + 264 + ], + "spans": [ + { + "bbox": [ + 314, + 129, + 453, + 264 + ], + "type": "image", + "image_path": "55502ad5020d6c37b1c15097051435ae9449511907989aba09d9e018ef5d7abb.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 311, + 272, + 462, + 283 + ], + "lines": [ + { + "bbox": [ + 311, + 272, + 462, + 283 + ], + "spans": [ + { + "bbox": [ + 311, + 272, + 462, + 283 + ], + "type": "text", + "content": "(b) Relation between SI and PSNR in HD" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 330, + 482, + 367 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 330, + 482, + 367 + ], + "spans": [ + { + "bbox": [ + 130, + 330, + 482, + 367 + ], + "type": "text", + "content": "the amount of variation between two adjacent frames by calculating the difference between the current frame and the previous frame, and then considers the standard deviation of the variation to calculate temporal complexity." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 236, + 379, + 481, + 394 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 236, + 379, + 481, + 394 + ], + "spans": [ + { + "bbox": [ + 236, + 379, + 481, + 394 + ], + "type": "interline_equation", + "content": "M _ {n} (i, j) = F _ {n} (i, j) - F _ {n - 1} (i, j) \\tag {6}", + "image_path": "336a26295522874900765156fee7f8f7eaa03346fdc6403e3c30b0d68f98755b.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 253, + 422, + 481, + 437 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 422, + 481, + 437 + ], + "spans": [ + { + "bbox": [ + 253, + 422, + 481, + 437 + ], + "type": "interline_equation", + "content": "T I = s t d _ {s p a c e} (M _ {n} (i, j)) \\qquad \\qquad (7)", + "image_path": "72817af44c65b87d3f58a7f1f36be9ba39feaf882d66411c7e098cfb39aa365d.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "text", + "content": "Where " + }, + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "inline_equation", + "content": "M_{n}" + }, + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "text", + "content": " represents the difference between the current frame " + }, + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "inline_equation", + "content": "F_{n}" + }, + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "text", + "content": " and the previous frame " + }, + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "inline_equation", + "content": "F_{n - 1}" + }, + { + "bbox": [ + 130, + 448, + 482, + 483 + ], + "type": "text", + "content": ". A higher value of TI indicates that more motion is included between two frames." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 486, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 483, + 666 + ], + "type": "text", + "content": "Video complexity is an important factor in VFI, so we analysed the relation between SI/TI and interpolation results to find out the reason why the existing VFI algorithms perform poorly on data that deviates from the characteristics of the training data. As shown in the Fig. 2, we can see that the SI/TI distribution of the Vimeo90K [38] train dataset, which is commonly used for training, contains the entire Vimeo90K test dataset. As a result, the existing training methods perform well on interpolate the Vimeo90K test data. However, some of the subclips in the HD [1] dataset have SI/TI that are out of the distribution of the training data. In this case, we can observe that the PSNR of subclips outside the distribution of the training data degrades in Tab. 1. Based on this, we further analyze the relation between SI/TI and PSNR. As shown in Fig. 3a, PSNR is more closely related to TI, which is important for accurately estimating motion in VFI. It shows that PSNR degrades as the complexity of motion between frames increases. In contrast, SI, the spatial complexity of the interpolation, is not closely related to the interpolation result, as shown in Fig. 3b." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 159, + 114, + 455, + 266 + ], + "blocks": [ + { + "bbox": [ + 159, + 114, + 455, + 266 + ], + "lines": [ + { + "bbox": [ + 159, + 114, + 455, + 266 + ], + "spans": [ + { + "bbox": [ + 159, + 114, + 455, + 266 + ], + "type": "image", + "image_path": "6327e9f934a48630b7d9eea5968bfeb4feac90e301f33b32a2d2a849bb493f69.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 274, + 482, + 319 + ], + "lines": [ + { + "bbox": [ + 130, + 274, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 274, + 482, + 319 + ], + "type": "text", + "content": "Fig. 4: Overview of our IAM-VFI. The Flow Network in stage 1 is the Flow Network of the existing VFI algorithm. It is trained with our proposed easy, medium, and hard datasets, respectively, to optimize for the motion complexity. The Synthesis Network in stage 2 is the synthesis network of the existing VFI algorithm." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 340, + 295, + 350 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 340, + 295, + 350 + ], + "spans": [ + { + "bbox": [ + 132, + 340, + 295, + 350 + ], + "type": "text", + "content": "3.2 Data classification Method" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 357, + 482, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 357, + 482, + 441 + ], + "spans": [ + { + "bbox": [ + 130, + 357, + 482, + 441 + ], + "type": "text", + "content": "Previous training methods typically train with patches cropped from random regions of the input image. However, the complexity of motion within the patch is also randomized, leading to suboptimal training for each complexity. As a result, it suffers from poor results for videos with varying complexity distribution within the video. To address this problem, we propose a data classification method that classifies the existing training dataset into easy, medium, and hard datasets according to motion complexity based on the analysis of Sec. 3.1." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 441, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 482, + 548 + ], + "type": "text", + "content": "First we created Vimeo90K(X2), which is a " + }, + { + "bbox": [ + 130, + 441, + 482, + 548 + ], + "type": "inline_equation", + "content": "\\times 2" + }, + { + "bbox": [ + 130, + 441, + 482, + 548 + ], + "type": "text", + "content": " upsampling of Vimeo90K [38] via EDSR [22] to generate more samples for larger motions, and we use both Vimeo90K and Vimeo90K(X2) data for classification. To avoid training randomly cropped regions, we first overlapped parts of the dataset and cropped them into patches of " + }, + { + "bbox": [ + 130, + 441, + 482, + 548 + ], + "type": "inline_equation", + "content": "256 \\times 256" + }, + { + "bbox": [ + 130, + 441, + 482, + 548 + ], + "type": "text", + "content": " size. We then calculated the TI to classify the data based on the motion complexity of each cropped patch. Based on the calculated TI, we set a threshold to divide the number of data into three parts: easy, medium, and hard datasets. The effectiveness of our proposed data classification method can be seen in Sec. 5.1." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 564, + 260, + 575 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 564, + 260, + 575 + ], + "spans": [ + { + "bbox": [ + 132, + 564, + 260, + 575 + ], + "type": "text", + "content": "3.3 IAM-VFI Overview" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "To identify the motion complexity for each region in the frame and to handle all motion, we propose IAM-VFI. Our proposed IAM-VFI is trained in two stages, as shown in Fig. 4. In the first stage, we train a flow estimate network with easy, medium, and hard datasets, each classified by motion complexity, to perform motion optimization for that complexity. The flow estimation network trained on each data generates optimized frames " + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\tilde{I}_t^e,\\tilde{I}_t^m,\\tilde{I}_t^h" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": ", for each complexity. The generated frames are then concatenated and used as input for the second stage." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 482, + 195 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 482, + 195 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 482, + 195 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 482, + 195 + ], + "type": "image", + "image_path": "cfdbba4f18ee0a2da2304cf77104b368332388e006273beae4f7f88ef2cee080.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 195, + 328, + 264 + ], + "blocks": [ + { + "bbox": [ + 133, + 195, + 328, + 264 + ], + "lines": [ + { + "bbox": [ + 133, + 195, + 328, + 264 + ], + "spans": [ + { + "bbox": [ + 133, + 195, + 328, + 264 + ], + "type": "image", + "image_path": "b62b2bf105cb092f8e2deb77ab32818fc1288ac7cf82bbd03d8b58974cfe6fb6.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 155, + 272, + 457, + 283 + ], + "lines": [ + { + "bbox": [ + 155, + 272, + 457, + 283 + ], + "spans": [ + { + "bbox": [ + 155, + 272, + 457, + 283 + ], + "type": "text", + "content": "Fig. 5: The network structure of Motion Complexity Estimation Network" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 328, + 196, + 481, + 264 + ], + "blocks": [ + { + "bbox": [ + 328, + 196, + 481, + 264 + ], + "lines": [ + { + "bbox": [ + 328, + 196, + 481, + 264 + ], + "spans": [ + { + "bbox": [ + 328, + 196, + 481, + 264 + ], + "type": "image", + "image_path": "b4402019809d0f8802678456391052a22985b916c8eaa9bc883f2cc094d193f7.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 253, + 319, + 480, + 333 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 319, + 480, + 333 + ], + "spans": [ + { + "bbox": [ + 253, + 319, + 480, + 333 + ], + "type": "interline_equation", + "content": "\\tilde {I} _ {t} = \\operatorname {C o n c a t} \\left(\\tilde {I} _ {t} ^ {e}, \\tilde {I} _ {t} ^ {m}, \\tilde {I} _ {t} ^ {h}\\right) \\tag {8}", + "image_path": "ee1376e7663d372aa8d17fceb852ec7531f84ecfc77d15214eafc331cc88522f.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "content": "The second stage receives each optimized frame as input and generates a Motion Complexity Map " + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "inline_equation", + "content": "(MCM_{t})" + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "content": " using a Motion Complexity Estimation Network (MCENet) to estimate the complexity of each region in the intermediate frame. Then perform a linear combination of the generated " + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "content": " and the input image " + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "inline_equation", + "content": "\\tilde{I}_t" + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "content": " to generate a temporal intermediate frame " + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "inline_equation", + "content": "\\hat{I}_t" + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "content": ". And the generated " + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "content": " is used as input to provide information about the motion complexity to the synthesis network of the existing VFI algorithm to estimate the residual. Finally, the residual is added to the temporal intermediate frame to generate the final interpolated frame " + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "inline_equation", + "content": "I_t" + }, + { + "bbox": [ + 130, + 339, + 482, + 448 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 466, + 364, + 478 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 466, + 364, + 478 + ], + "spans": [ + { + "bbox": [ + 131, + 466, + 364, + 478 + ], + "type": "text", + "content": "3.4 Motion Complexity Estimation Network" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": "We propose MCENet, a network for estimating the motion complexity of each region of the intermediate frames to be interpolated and handling them according to the motion complexity of each region. First, MCENet takes as input " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "\\tilde{I}_t^e,\\tilde{I}_t^m" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "\\tilde{I}_t^h" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": ", the optimized results for each motion complexity, and generates an " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "MCM_{t}\\in \\mathbb{R}^{3\\times H\\times W}" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": " that estimate the motion complexity of the region. The generated " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": " consists of three channels, each representing a probability value for whether this region is close to easy, medium, or hard. We then perform a linear combination of multiplying each channel by the " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "\\tilde{I}_t^e,\\tilde{I}_t^m" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "\\tilde{I}_t^h" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": " frames respectively to generate " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "\\hat{I}_t" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": ", the frame that reflects the complexity. As a result, " + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 487, + 482, + 631 + ], + "type": "text", + "content": " also controls the region on the boundary of each class by giving more weight to the most probable values among the three classified easy, medium, and hard values." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 257, + 641, + 481, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 257, + 641, + 481, + 666 + ], + "type": "interline_equation", + "content": "\\hat {I} _ {t} = \\sum_ {c \\in e, m, h} M C M _ {t} ^ {c} \\tilde {I} _ {t} ^ {c} \\tag {9}", + "image_path": "04acd15877d1e89959907fbf71d951789b48c8ea87429474b9f6cc425d89b98d.jpg" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "We construct MCENet with a U-Net structure for simple application to existing VFI algorithms and propose Motion Attention Block (MAB) for estimating motion complexity more efficiently. The detailed architecture of MCENet and MAB can be seen in Fig. 5." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": "To effectively train " + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": ", we propose a novel loss function, complexity loss. The frame " + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "inline_equation", + "content": "\\hat{I}_{t}" + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": " generated by the " + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": ", contains information about the complexity of the motion in each region. Therefore, it is not effective to use a loss function to reduce the error with GT, which does not contain information about complexity. For this reason we generate " + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "inline_equation", + "content": "MCM_{gt}" + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": ", which contains information about the complexity of the motion. To generate the " + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "inline_equation", + "content": "MCM_{gt}" + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": ", we compute the error between the optimized frame and the ground truth for each pixel by motion complexity. We then assign a 1 to the channel of the " + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "inline_equation", + "content": "MCM_{gt}" + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": " that represents the class with the minimum error at each pixel, and a 0 to the other channels. This allows the " + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "inline_equation", + "content": "MCM_{gt}" + }, + { + "bbox": [ + 130, + 164, + 480, + 294 + ], + "type": "text", + "content": " to represent the best motion complexity class at each pixel." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 181, + 304, + 480, + 343 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 304, + 480, + 343 + ], + "spans": [ + { + "bbox": [ + 181, + 304, + 480, + 343 + ], + "type": "interline_equation", + "content": "M C M _ {g t} ^ {c} (i, j) = \\left\\{ \\begin{array}{l l} 1, & \\text {i f} c = \\underset {c \\in \\{e, m, h \\}} {\\operatorname {a r g m i n}} \\left(\\left| g t (i, j) - \\tilde {I} _ {t} ^ {c} (i, j) \\right|\\right) \\\\ 0, & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {10}", + "image_path": "5775239712b34d4286e787d647b7f7e161160e8950527d490f98a97ec0d7c4ed.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 347, + 479, + 372 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 347, + 479, + 372 + ], + "spans": [ + { + "bbox": [ + 131, + 347, + 479, + 372 + ], + "type": "text", + "content": "Finally, we compute a linear combination of the generated MCM and each frame to generate " + }, + { + "bbox": [ + 131, + 347, + 479, + 372 + ], + "type": "inline_equation", + "content": "\\hat{I}_{MCM}" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 245, + 382, + 480, + 407 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 245, + 382, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 245, + 382, + 480, + 407 + ], + "type": "interline_equation", + "content": "\\hat {I} _ {M C M} = \\sum_ {c \\in \\{e, m, h \\}} M C M _ {g t} ^ {c} \\tilde {I} _ {t} ^ {c} \\tag {11}", + "image_path": "063cb4536e8c5740f185ea45c2cf5273096432267fbe5273577717a2f44cdefa.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "spans": [ + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "text", + "content": "We update the " + }, + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "text", + "content": " by taking the L1 loss between two frames " + }, + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "inline_equation", + "content": "\\hat{I}_{t}" + }, + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "inline_equation", + "content": "\\hat{I}_{MCM}" + }, + { + "bbox": [ + 131, + 414, + 479, + 440 + ], + "type": "text", + "content": " that contain the motion complexity." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 263, + 449, + 480, + 463 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 263, + 449, + 480, + 463 + ], + "spans": [ + { + "bbox": [ + 263, + 449, + 480, + 463 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {c} = \\left\\| \\hat {I} _ {t} - \\hat {I} _ {M C M} \\right\\| _ {1} \\tag {12}", + "image_path": "abf613fd96223fc859e7b1886bc5d1f73e7ff0fc27d2022b4d6e68c99a60a76f.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 470, + 310, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 470, + 310, + 482 + ], + "spans": [ + { + "bbox": [ + 131, + 470, + 310, + 482 + ], + "type": "text", + "content": "The effect on " + }, + { + "bbox": [ + 131, + 470, + 310, + 482 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_c" + }, + { + "bbox": [ + 131, + 470, + 310, + 482 + ], + "type": "text", + "content": " was verified in Sec. 5.3." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 501, + 224, + 514 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 501, + 224, + 514 + ], + "spans": [ + { + "bbox": [ + 131, + 501, + 224, + 514 + ], + "type": "text", + "content": "4 Experiment" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 526, + 252, + 538 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 526, + 252, + 538 + ], + "spans": [ + { + "bbox": [ + 131, + 526, + 252, + 538 + ], + "type": "text", + "content": "4.1 Implement details" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 545, + 480, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 480, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 480, + 616 + ], + "type": "text", + "content": "Training Dataset. We first trained the flow network using the classified datasets introduced in Sec. 3.2. Then, we freeze the flow network and trained the MCENet and synthesis network. Since the classified datasets are the data proposed to optimize each motion, we used the original Vimeo90K to train MCENet and synthesis network. The Vimeo90K data consists of 51,312 triplets and has a resolution of " + }, + { + "bbox": [ + 130, + 545, + 480, + 616 + ], + "type": "inline_equation", + "content": "448 \\times 256" + }, + { + "bbox": [ + 130, + 545, + 480, + 616 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 617, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 480, + 666 + ], + "type": "text", + "content": "Training Strategy. We applied the proposed methods to the flow-based algorithms RIFE [12] and EMA-VFI [40]. The experiments were implemented based on the official code presented in the paper. For both proposed stages, we used the same optimization techniques such as batch size, optimizer, scheduler, and" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "learning rate as used in RIFE and EMA-VFI, and trained for the same iterations. Our training was performed on a single NVIDIA RTX A6000." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 480, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 480, + 188 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 480, + 188 + ], + "type": "text", + "content": "Loss Function. In the first stage, we used the same loss function used in the original networks for training the flow estimation network. In the second step, we used " + }, + { + "bbox": [ + 130, + 140, + 480, + 188 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{syn}" + }, + { + "bbox": [ + 130, + 140, + 480, + 188 + ], + "type": "text", + "content": ", the reconstruction loss used to train synthesis network in RIFE and EMA-VFI, and " + }, + { + "bbox": [ + 130, + 140, + 480, + 188 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_c" + }, + { + "bbox": [ + 130, + 140, + 480, + 188 + ], + "type": "text", + "content": ", the loss function proposed in Sec. 3.4 to train the MCENet." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 253, + 200, + 481, + 213 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 200, + 481, + 213 + ], + "spans": [ + { + "bbox": [ + 253, + 200, + 481, + 213 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {t o t a l}} = \\lambda_ {s} \\mathcal {L} _ {\\text {s y n}} + \\lambda_ {f} \\mathcal {L} _ {c} \\tag {13}", + "image_path": "08ab7f7a01328a1d7d0ac3cba8821de061c031844d3d06184e563a18085d2cc0.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 216, + 389, + 228 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 216, + 389, + 228 + ], + "spans": [ + { + "bbox": [ + 131, + 216, + 389, + 228 + ], + "type": "text", + "content": "where we set " + }, + { + "bbox": [ + 131, + 216, + 389, + 228 + ], + "type": "inline_equation", + "content": "\\lambda_s = 0.5" + }, + { + "bbox": [ + 131, + 216, + 389, + 228 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 216, + 389, + 228 + ], + "type": "inline_equation", + "content": "\\lambda_f = 0.5" + }, + { + "bbox": [ + 131, + 216, + 389, + 228 + ], + "type": "text", + "content": " to balance the loss values." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 243, + 344, + 255 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 243, + 344, + 255 + ], + "spans": [ + { + "bbox": [ + 131, + 243, + 344, + 255 + ], + "type": "text", + "content": "4.2 Benchmarks and Evaluation Metrics" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 260, + 479, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 260, + 479, + 295 + ], + "spans": [ + { + "bbox": [ + 130, + 260, + 479, + 295 + ], + "type": "text", + "content": "Our proposed methods are to handle various motion complexities. Therefore, we evaluated our proposed method on the following datasets with various motion complexities." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 297, + 479, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 297, + 479, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 297, + 479, + 319 + ], + "type": "text", + "content": "SNU-FILM [4] : 1280x720 resolution with a total of 1240 frames, categorized into easy, medium, hard, and extreme according to the motion magnitude." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 320, + 479, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 320, + 479, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 320, + 479, + 342 + ], + "type": "text", + "content": "HD [1] : It consists of 11 videos. The HD dataset consists of four 1080p, three 720p and four 544p videos, and we used the first 100 frames of each video" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 344, + 479, + 367 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 344, + 479, + 367 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 479, + 367 + ], + "type": "text", + "content": "UVG [25]: It consists of 7 videos with 3840x2160 resolution, and we used the first 300 frames of each video." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 368, + 480, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 368, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 368, + 480, + 403 + ], + "type": "text", + "content": "Xiph [26]: It contains 19 video sequences, each consisting of 31 consecutive 4K resolution frames. We followed [27] method to downsample and center-crop the 4K images to create a 2K resolution and evaluate both Xiph4K and Xiph2K." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 403, + 483, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 483, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 483, + 462 + ], + "type": "text", + "content": "Metrics. We used Peak Signal-To-Noise Ratio (PSNR) and Structural-Similarity-Image-Metric (SSIM), commonly used objective quality metrics, where a higher PSNR and SSIM indicate better quality. To evaluate runtime, we measured all algorithms at 720p resolution to be fair, and we used a single NVIDIA RTX A6000 GPU." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 479, + 198, + 491 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 479, + 198, + 491 + ], + "spans": [ + { + "bbox": [ + 131, + 479, + 198, + 491 + ], + "type": "text", + "content": "5 Results" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 502, + 297, + 513 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 502, + 297, + 513 + ], + "spans": [ + { + "bbox": [ + 131, + 502, + 297, + 513 + ], + "type": "text", + "content": "5.1 Data Classification method" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 519, + 479, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 519, + 479, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 519, + 479, + 544 + ], + "type": "text", + "content": "We first validate our proposed data classification method. The proposed method aims to optimize for the complexity of each motion, so we exclude the influence" + } + ] + } + ], + "index": 15 + }, + { + "type": "table", + "bbox": [ + 161, + 594, + 452, + 664 + ], + "blocks": [ + { + "bbox": [ + 130, + 561, + 479, + 583 + ], + "lines": [ + { + "bbox": [ + 130, + 561, + 479, + 583 + ], + "spans": [ + { + "bbox": [ + 130, + 561, + 479, + 583 + ], + "type": "text", + "content": "Table 2: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR value)" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 161, + 594, + 452, + 664 + ], + "lines": [ + { + "bbox": [ + 161, + 594, + 452, + 664 + ], + "spans": [ + { + "bbox": [ + 161, + 594, + 452, + 664 + ], + "type": "table", + "html": "
Benchmark Train DataVimeo90KUVG
easymediumhardeasymediumhard
Vimeo90K43.54336.49532.13148.33836.31730.052
Ourseasy43.95536.40231.72749.02736.29129.338
Oursmedium43.95137.01232.58848.50936.85130.289
Ourshard43.63236.99132.72147.83136.81530.611
", + "image_path": "919bf27fa8365c033f31b4896f8d2a26608ce6bf80b5bae53263228632265d2e.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "table_body" + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 171, + 482, + 334 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 3: Quantitative results comparison on benchmark datasets.(Red indicates best PSNR/SSIM values within each dataset and Blue indicates second best and Green indicates third best.) We followed the test procedures of [12] for HD, [19] for SNU-FILM, and [11] for Xiph to ensure a fair comparison. \"OOM\" indicates \"Out of Memory\" and \"+\" indicates the results we obtained by retraining to compare results." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 171, + 482, + 334 + ], + "lines": [ + { + "bbox": [ + 135, + 171, + 482, + 334 + ], + "spans": [ + { + "bbox": [ + 135, + 171, + 482, + 334 + ], + "type": "table", + "html": "
AlgorithmHDSNU-FILMUVGXiph
EasyMediumHardExtreme2K4K
SepConv [29]30.87/0.93039.41/0.99034.97/0.97629.36/0.92524.31/0.84426.11/0.86434.77/0.92932.06/0.880
CAIN [4]31.45/0.93939.91/0.99035.57/0.97729.87/0.92924.73/0.85030.32/0.90235.21/0.93732.56/0.901
AdaCoF [21]31.43/0.93339.84/0.99035.07/0.97529.47/0.92424.31/0.843OOM34.86/0.92832.19/0.882
CDFI [6]31.46/0.93740.11/0.99035.51/0.97729.74/0.92724.54/0.847OOM35.48/0.94032.47/0.903
ABME [31]32.17/0.94339.59/0.99035.51/0.97829.47/0.93625.23/0.863OOM35.18/0.96432.36/0.940
IFRNet [19]32.15/0.94340.02/0.99035.93/0.97930.40/0.93525.05/0.85831.33/0.90436.24/0.96433.38/0.941
M2M-PWC [11]31.23/0.93739.59/0.99035.68/0.97930.27/0.93625.07/0.86030.89/0.91036.40/0.96733.77/0.943
VFIformer [24]OOM40.12/0.99136.09/0.98030.67/0.93725.20/0.863OOMOOMOOM
EBME [17]32.44/0.94539.98/0.99135.74/0.97930.40/0.93525.24/0.86131.79/0.91536.33/0.96533.71/0.942
RIFE† [12]32.08/0.94239.98/0.99035.78/0.97830.14/0.93324.84/0.85331.13/0.90036.15/0.96433.25/0.940
RIFEours32.46/0.94640.18/0.99136.05/0.98030.58/0.93725.35/0.86332.17/0.91736.60/0.96634.20/0.946
EMA-VFI† [40]32.62/0.94840.17/0.99135.97/0.97930.64/0.93525.27/0.85731.19/0.90736.71/0.96633.69/0.944
EMA-VFIours32.89/0.95140.28/0.99236.30/0.98130.88/0.93825.59/0.86432.12/0.91637.01/0.96834.29/0.947
", + "image_path": "ef0ba9afdfdb88a55e863727d627645488bcbbb89c645286c4e1f85cf94c4736.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 350, + 479, + 432 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 479, + 432 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 479, + 432 + ], + "type": "text", + "content": "of synthesis networks for accurate validation. We use the proposed easy, medium, and hard datasets to train IFNet, the flow network of RIFE. And warped the estimated flows and input frames then generate temporal intermediate frames using Eq. (3). The Benchmark used for validation was Vimeo90K test and UVG, and was divided into 256x256 patches to avoid varying complexity within the region and the TI of each patch was calculated and classified as easy, medium, or hard." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 434, + 480, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 480, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 480, + 483 + ], + "type": "text", + "content": "As shown in Tab. 2, we can see that the training with the complexity classified data optimizes the motion estimation performance, resulting in improved PSNR compared to the results trained with the original dataset. This result shows that classification by complexity is effective in optimizing motion." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 501, + 400, + 514 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 400, + 514 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 400, + 514 + ], + "type": "text", + "content": "5.2 Comparison with the State-of-the-Art Methods" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 479, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 479, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 479, + 581 + ], + "type": "text", + "content": "To compare the proposed methods, we used the kernel-based algorithms SepConv [29], AdaCoF [21], and CDFI [6], the flow-based algorithms ABME [31], IFRNet [19], M2M-PWC [11], VFformer [24], EBME [17], and the other method CAIN [4]. We applied our methods to the flow-based algorithms RIFE [12] and EMAVFI [40]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 582, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 480, + 665 + ], + "type": "text", + "content": "Tab. 3 summarizes the quantitative comparison with existing VFI algorithms on various benchmarks to show the effectiveness of the proposed methods. The performance of the original RIFE is slightly worse compared to the state-of-the-art algorithms, but we can see that our proposed method improves performance on all benchmarks. In particular, for UVG and Xiph4K, which are high-resolution videos with various motion complexity, we can see the PSNR improvements of 1.04 dB and 0.95 dB, respectively, with the best results for UVG data" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 481, + 265 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 265 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 265 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 265 + ], + "type": "image", + "image_path": "81bf6288cf6d90bbd9ae1cb23a2ef93b1afab7183c9c01e7a530c5e0b4928605.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 280, + 481, + 446 + ], + "blocks": [ + { + "bbox": [ + 161, + 270, + 453, + 279 + ], + "lines": [ + { + "bbox": [ + 161, + 270, + 453, + 279 + ], + "spans": [ + { + "bbox": [ + 161, + 270, + 453, + 279 + ], + "type": "text", + "content": "(a) Visual comparison of IAM-VFI applied to EMA-VFI with the SOTA algorithm" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 133, + 280, + 481, + 446 + ], + "lines": [ + { + "bbox": [ + 133, + 280, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 133, + 280, + 481, + 446 + ], + "type": "image", + "image_path": "c15a4b2c9d9f510fbf3370f92f2677b6cb8566283a6ec7374d2d60d3976f856a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 168, + 449, + 445, + 460 + ], + "lines": [ + { + "bbox": [ + 168, + 449, + 445, + 460 + ], + "spans": [ + { + "bbox": [ + 168, + 449, + 445, + 460 + ], + "type": "text", + "content": "(b) Visual comparison of IAM-VFI applied to RIFE with the SOTA algorithm" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 132, + 468, + 480, + 480 + ], + "lines": [ + { + "bbox": [ + 132, + 468, + 480, + 480 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 480, + 480 + ], + "type": "text", + "content": "Fig. 6: Visual comparison on extreme subset of SNU-FILM [4] and HD [1] benchmarks." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 516, + 482, + 576 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 516, + 482, + 576 + ], + "spans": [ + { + "bbox": [ + 130, + 516, + 482, + 576 + ], + "type": "text", + "content": "compared to the state-of-the-art algorithms. Other benchmarks also achieved second or third best results. And when the IAM-VFI method is applied to the recently proposed EMA-VFI, we can see that it achieves the best performance in all benchmarks except UVG, with an improvement of 0.93 dB in UVG and 0.60 dB in Xiph4K compared to the original algorithm." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "In Fig. 6, we compare the subjective image quality of the results of applying IAM-VFI to RIFE and EMA-VFI with other algorithms. In the first column of Fig. 6a, we can see that IAM-VFI can handle large motions and the second column demonstrated that images with complex motion and detail are also improved. In the first column of Fig. 6b, the occlusion regions of the object and background are sharply interpolated and the face is interpolated clearly. And in the second column, the edge regions are also interpolated sharply." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 481, + 289 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 289 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 289 + ], + "type": "image", + "image_path": "23d632b9af9ffeda68aee26f37c8f32accdb6a3172081502217d85f36811f119.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 300, + 482, + 376 + ], + "lines": [ + { + "bbox": [ + 130, + 300, + 482, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 482, + 376 + ], + "type": "text", + "content": "Fig. 7: Subjective image quality comparison for the effectiveness of MCM. The first column shows, from left, the overlap of the two input images, each channel of the " + }, + { + "bbox": [ + 130, + 300, + 482, + 376 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 300, + 482, + 376 + ], + "type": "text", + "content": " representing the probabilities of easy, medium, and hard, and the interpolation results of the original RIFE. The second column shows, from left, the ground truth of the intermediate frames to be interpolated, the intermediate frames optimized to easy, medium and hard using the data classification method, and the interpolation results of IAM-VFI." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 402, + 246, + 414 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 246, + 414 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 246, + 414 + ], + "type": "text", + "content": "5.3 Ablation Studies" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 426, + 481, + 484 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 481, + 484 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 481, + 484 + ], + "type": "text", + "content": "We performed the ablation study to demonstrate the effectiveness of the proposed methods. For comparison, we used all benchmark datasets and compared the inference time of applying the proposed method to the existing VFI algorithm. In Tab. 4, the baseline without applying all the proposed methods is the original RIFE [12] algorithm." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 485, + 481, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 481, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 481, + 568 + ], + "type": "text", + "content": "Effect of MCENet. The second column is the result of simply weighting each of the frames optimized for each class by the classified data by 0.33. We can see that the PSNR degrades for most of the benchmarks because we do not take into account the complexity of each region. In contrast, when we generate an " + }, + { + "bbox": [ + 130, + 485, + 481, + 568 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 485, + 481, + 568 + ], + "type": "text", + "content": " using MCENet to estimate the complexity of each region and adaptively weight each region, we see that performance improves compared to the baseline for all benchmarks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "type": "text", + "content": "In Fig. 7, we can see the optimized results for each motion and a visualisation of each channel of the " + }, + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "type": "text", + "content": " generated by MCENet. We can see that the regions with large motion are classified as hard motion complexity, and the optimized result with hard data interpolates the large motion regions clearly. Also in the occlusion region, we can see that the motion complexity is classified as hard due to the different motion of the two overlapped objects, and the edges are sharply interpolated. And global motions are classified as easy or medium. Finally, when small objects such as branches move, the distribution of their motions varies," + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 146, + 481, + 226 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "type": "text", + "content": "Table 4: Ablation studies for our proposed methods. M.O stands for Motion Optimisation with classified data. (Red indicates the best PSNR)." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 146, + 481, + 226 + ], + "lines": [ + { + "bbox": [ + 135, + 146, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 135, + 146, + 481, + 226 + ], + "type": "table", + "html": "
M.OMCENetLcMABSynMCMHDSNU-FILMUVGXiphRuntime
EasyMediumHardExtreme2K4K
×××××32.0839.9835.7830.1424.8331.1336.1533.2548.3ms
✓××××31.9738.3935.1530.2225.2331.6035.8033.6068.3ms
✓✓×××32.3240.0536.0330.5925.3532.0236.3333.9278.7ms
✓✓✓××32.4240.1136.0430.5825.3432.0836.5634.0678.7ms
✓✓✓✓×32.4540.1436.0530.5925.3532.1536.6034.1282.7ms
✓✓✓✓✓32.4640.1836.0830.6025.3532.1736.6034.2087.5ms
", + "image_path": "b3ba07c18b76cb1a44529d0ff3a5b5a1af21561a1d899d24a81bbf5391121922.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 251, + 479, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 479, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 479, + 274 + ], + "type": "text", + "content": "so they are classified as complex motions, and you can see that the previously blurred parts are interpolated clearly." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "spans": [ + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "text", + "content": "Effect of Motion Complexity Loss. The " + }, + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "inline_equation", + "content": "\\hat{I}_t" + }, + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "text", + "content": " generated by " + }, + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "inline_equation", + "content": "MCM_t" + }, + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "text", + "content": " contains information about the complexity of each regions. Therefore, we can see that using the loss function for frames with complexity information reflected through " + }, + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "inline_equation", + "content": "MCM_{qt}" + }, + { + "bbox": [ + 130, + 274, + 479, + 322 + ], + "type": "text", + "content": " rather than using the loss with GT is effective." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 323, + 479, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 479, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 479, + 369 + ], + "type": "text", + "content": "Effect of MAB. Each channel of MCM represents the probability value for whether the complexity of the corresponding area falls into easy, medium, or hard. Therefore, the PSNR is improved when MAB is used in MCENet to give attention for each channel." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 370, + 479, + 406 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 370, + 479, + 406 + ], + "spans": [ + { + "bbox": [ + 130, + 370, + 479, + 406 + ], + "type": "text", + "content": "Synthesis Network with MCM. Using the " + }, + { + "bbox": [ + 130, + 370, + 479, + 406 + ], + "type": "inline_equation", + "content": "MCM_{t}" + }, + { + "bbox": [ + 130, + 370, + 479, + 406 + ], + "type": "text", + "content": " as an additional input to the synthesis network to provide information about motion complexity can improve performance on most of the benchmarks." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 430, + 218, + 441 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 218, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 218, + 441 + ], + "type": "text", + "content": "5.4 Limitations" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 455, + 479, + 526 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 455, + 479, + 526 + ], + "spans": [ + { + "bbox": [ + 130, + 455, + 479, + 526 + ], + "type": "text", + "content": "By applying the proposed method to the existing algorithm, we achieved a significant improvement in interpolation results, but it still has several limitations. First, the flow network needs to be trained for each classified dataset to optimize for motion, resulting in increased training time. Second, compared to the existing network, the runtime increases. In future work, we will attempt to optimize for all motion complexities using a single flownet." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 551, + 220, + 563 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 551, + 220, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 551, + 220, + 563 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 581, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 479, + 665 + ], + "type": "text", + "content": "This paper aims to address the problem that existing VFI algorithms do not consider motion complexity and therefore fail to perform optimally for all regions. We solve this problem by combining three intermediate frames, which are derived by different flow networks, with motion complexity map. Experimental results show that the proposed method of interpolating frame by considering motion complexity improves the interpolation performance of existing VFI algorithms and achieves enhanced quality for all regions in the video." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 479, + 190 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 479, + 190 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 479, + 190 + ], + "type": "text", + "content": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2021-0-00087, Development of high-quality conversion technology for SD/HD low-quality media)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 209, + 197, + 221 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 209, + 197, + 221 + ], + "spans": [ + { + "bbox": [ + 132, + 209, + 197, + 221 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 234, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 234, + 480, + 277 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 234, + 480, + 277 + ], + "spans": [ + { + "bbox": [ + 138, + 234, + 480, + 277 + ], + "type": "text", + "content": "1. Bao, W., Lai, W.S., Zhang, X., Gao, Z., Yang, M.H.: Memc-net: Motion estimation and motion compensation driven neural network for video interpolation and enhancement. IEEE transactions on pattern analysis and machine intelligence 43(3), 933-948 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 280, + 480, + 322 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 280, + 480, + 322 + ], + "spans": [ + { + "bbox": [ + 138, + 280, + 480, + 322 + ], + "type": "text", + "content": "2. Barman, N., Zadtootaghaj, S., Schmidt, S., Martini, M.G., Möller, S.: Gamingvideoset: a dataset for gaming video streaming applications. In: 2018 16th Annual Workshop on Network and Systems Support for Games (NetGames). pp. 1-6. IEEE (2018)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 323, + 480, + 355 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 323, + 480, + 355 + ], + "spans": [ + { + "bbox": [ + 138, + 323, + 480, + 355 + ], + "type": "text", + "content": "3. Brooks, T., Barron, J.T.: Learning to synthesize motion blur. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6840-6848 (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 357, + 480, + 389 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 357, + 480, + 389 + ], + "spans": [ + { + "bbox": [ + 138, + 357, + 480, + 389 + ], + "type": "text", + "content": "4. Choi, M., Kim, H., Han, B., Xu, N., Lee, K.M.: Channel attention is all you need for video frame interpolation. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 10663-10671 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 390, + 480, + 422 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 390, + 480, + 422 + ], + "spans": [ + { + "bbox": [ + 138, + 390, + 480, + 422 + ], + "type": "text", + "content": "5. Dar, Y., Bruckstein, A.M.: Motion-compensated coding and frame rate upconversion: Models and analysis. IEEE Transactions on Image Processing 24(7), 2051-2066 (2015)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 423, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 423, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 138, + 423, + 480, + 456 + ], + "type": "text", + "content": "6. Ding, T., Liang, L., Zhu, Z., Zharkov, I.: Cdfi: Compression-driven network design for frame interpolation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8001-8011 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 456, + 480, + 488 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 456, + 480, + 488 + ], + "spans": [ + { + "bbox": [ + 138, + 456, + 480, + 488 + ], + "type": "text", + "content": "7. Flynn, J., Neulander, I., Philbin, J., Snavely, N.: Deepstereo: Learning to predict new views from the world's imagery. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5515-5524 (2016)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 489, + 480, + 521 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 489, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 138, + 489, + 480, + 521 + ], + "type": "text", + "content": "8. Fourure, D., Emonet, R., Fromont, E., Muselet, D., Tremeau, A., Wolf, C.: Residual conv-deconv grid network for semantic segmentation. arXiv preprint arXiv:1707.07958 (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 522, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 522, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 138, + 522, + 480, + 566 + ], + "type": "text", + "content": "9. Fremerey, S., Goring, S., Rao, R.R.R., Huang, R., Raake, A.: Subjective test dataset and meta-data-based models for " + }, + { + "bbox": [ + 138, + 522, + 480, + 566 + ], + "type": "inline_equation", + "content": "360^{\\circ}" + }, + { + "bbox": [ + 138, + 522, + 480, + 566 + ], + "type": "text", + "content": " streaming video quality. In: 2020 IEEE 22nd International Workshop on Multimedia Signal Processing (MMSP). pp. 1-6. IEEE (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 567, + 480, + 598 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 567, + 480, + 598 + ], + "spans": [ + { + "bbox": [ + 134, + 567, + 480, + 598 + ], + "type": "text", + "content": "10. Göring, S., Rao, R.R.R., Feiten, B., Raake, A.: Modular framework and instances of pixel-based video quality models for uhd-1/4k. IEEE Access 9, 31842-31864 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 599, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 599, + 480, + 632 + ], + "type": "text", + "content": "11. Hu, P., Niklaus, S., Sclaroff, S., Saenko, K.: Many-to-many splatting for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3553-3562 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "text", + "content": "12. Huang, Z., Zhang, T., Heng, W., Shi, B., Zhou, S.: Real-time intermediate flow estimation for video frame interpolation. In: European Conference on Computer Vision. pp. 624-642. Springer (2022)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 117, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "13. Installations, T., Line, L.: Subjective video quality assessment methods for multimedia applications. Networks 910(37), 5 (1999)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 138, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 138, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 138, + 481, + 182 + ], + "type": "text", + "content": "14. Jiang, H., Sun, D., Jampani, V., Yang, M.H., Learned-Miller, E., Kautz, J.: Super slomo: High quality estimation of multiple intermediate frames for video interpolation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 9000-9008 (2018)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 480, + 202 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 480, + 202 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 480, + 202 + ], + "type": "text", + "content": "15. Jiang, J., Holz, C.: Restore anything pipeline: Segment anything meets image restoration. arXiv preprint arXiv:2305.13093 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 202, + 480, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 202, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 133, + 202, + 480, + 236 + ], + "type": "text", + "content": "16. Jin, X., Wu, L., Chen, J., Chen, Y., Koo, J., Hahm, C.h.: A unified pyramid recurrent network for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1578-1587 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 236, + 480, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 236, + 480, + 278 + ], + "spans": [ + { + "bbox": [ + 133, + 236, + 480, + 278 + ], + "type": "text", + "content": "17. Jin, X., Wu, L., Shen, G., Chen, Y., Chen, J., Koo, J., Hahm, C.h.: Enhanced bidirectional motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5049-5057 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 278, + 480, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 278, + 480, + 311 + ], + "spans": [ + { + "bbox": [ + 133, + 278, + 480, + 311 + ], + "type": "text", + "content": "18. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 311, + 480, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 311, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 133, + 311, + 480, + 354 + ], + "type": "text", + "content": "19. Kong, L., Jiang, B., Luo, D., Chu, W., Huang, X., Tai, Y., Wang, C., Yang, J.: Ifrnet: Intermediate feature refine network for efficient frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1969-1978 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 354, + 480, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 354, + 480, + 386 + ], + "spans": [ + { + "bbox": [ + 133, + 354, + 480, + 386 + ], + "type": "text", + "content": "20. Kong, X., Zhao, H., Qiao, Y., Dong, C.: Classsr: A general framework to accelerate super-resolution networks by data characteristic. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12016-12025 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 386, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 386, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 133, + 386, + 480, + 418 + ], + "type": "text", + "content": "21. Lee, H., Kim, T., Chung, T.y., Pak, D., Ban, Y., Lee, S.: Adacof: Adaptive collaboration of flows for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5316-5325 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 418, + 480, + 451 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 418, + 480, + 451 + ], + "spans": [ + { + "bbox": [ + 133, + 418, + 480, + 451 + ], + "type": "text", + "content": "22. Lim, B., Son, S., Kim, H., Nah, S., Mu Lee, K.: Enhanced deep residual networks for single image super-resolution. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 136-144 (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 450, + 480, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 450, + 480, + 482 + ], + "spans": [ + { + "bbox": [ + 133, + 450, + 480, + 482 + ], + "type": "text", + "content": "23. Liu, Z., Yeh, R.A., Tang, X., Liu, Y., Agarwala, A.: Video frame synthesis using deep voxel flow. In: Proceedings of the IEEE international conference on computer vision. pp. 4463-4471 (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 483, + 480, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 483, + 480, + 515 + ], + "spans": [ + { + "bbox": [ + 133, + 483, + 480, + 515 + ], + "type": "text", + "content": "24. Lu, L., Wu, R., Lin, H., Lu, J., Jia, J.: Video frame interpolation with transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3532-3542 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 515, + 480, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 515, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 133, + 515, + 480, + 548 + ], + "type": "text", + "content": "25. Mercat, A., Viitanen, M., Vanne, J.: Uvg dataset: 50/120fps 4k sequences for video codec analysis and development. In: Proceedings of the 11th ACM Multimedia Systems Conference. pp. 297-302 (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 548, + 480, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 548, + 480, + 568 + ], + "spans": [ + { + "bbox": [ + 133, + 548, + 480, + 568 + ], + "type": "text", + "content": "26. Montgomery, C., Lars, H.: Xiph.org video test media (derf's collection). Online, https://media.xiph.org/video/derf 6 (1994)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 568, + 480, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 568, + 480, + 601 + ], + "spans": [ + { + "bbox": [ + 133, + 568, + 480, + 601 + ], + "type": "text", + "content": "27. Niklaus, S., Liu, F.: Softmax splatting for video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5437-5446 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 601, + 480, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 601, + 480, + 633 + ], + "spans": [ + { + "bbox": [ + 133, + 601, + 480, + 633 + ], + "type": "text", + "content": "28. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 133, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 633, + 480, + 665 + ], + "type": "text", + "content": "29. Niklaus, S., Mai, L., Liu, F.: Video frame interpolation via adaptive separable convolution. In: Proceedings of the IEEE international conference on computer vision. pp. 261-270 (2017)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "K. Yoon et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 534 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 162 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 162 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 162 + ], + "type": "text", + "content": "30. Park, J., Ko, K., Lee, C., Kim, C.S.: Bmbc: Bilateral motion estimation with bilateral cost volume for video interpolation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 109-125. Springer (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 162, + 482, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 162, + 482, + 194 + ], + "spans": [ + { + "bbox": [ + 130, + 162, + 482, + 194 + ], + "type": "text", + "content": "31. Park, J., Lee, C., Kim, C.S.: Asymmetric bilateral motion estimation for video frame interpolation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14539-14548 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 194, + 482, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 194, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 482, + 237 + ], + "type": "text", + "content": "32. Rad, M.S., Bozorgtabar, B., Marti, U.V., Basler, M., Ekenel, H.K., Thiran, J.P.: Srobb: Targeted perceptual loss for single image super-resolution. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 2710-2719 (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 237, + 482, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 237, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 482, + 282 + ], + "type": "text", + "content": "33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 282, + 482, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 482, + 315 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 482, + 315 + ], + "type": "text", + "content": "34. Sim, H., Oh, J., Kim, M.: Xvfi: extreme video frame interpolation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 14489-14498 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 315, + 482, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 315, + 482, + 347 + ], + "spans": [ + { + "bbox": [ + 130, + 315, + 482, + 347 + ], + "type": "text", + "content": "35. Song, L., Tang, X., Zhang, W., Yang, X., Xia, P.: The sjtu 4k video sequence dataset. In: 2013 Fifth International Workshop on Quality of Multimedia Experience (QoMEX). pp. 34-35. IEEE (2013)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 347, + 482, + 381 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 482, + 381 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 482, + 381 + ], + "type": "text", + "content": "36. Sun, D., Yang, X., Liu, M.Y., Kautz, J.: Pwc-net: Cnns for optical flow using pyramid, warping, and cost volume. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 8934-8943 (2018)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 381, + 482, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 381, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 381, + 482, + 403 + ], + "type": "text", + "content": "37. Xiao, Z., Bai, J., Lu, Z., Xiong, Z.: A dive into sam prior in image restoration. arXiv preprint arXiv:2305.13620 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 403, + 482, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 424 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 424 + ], + "type": "text", + "content": "38. Xue, T., Chen, B., Wu, J., Wei, D., Freeman, W.T.: Video enhancement with task-oriented flow. International Journal of Computer Vision 127, 1106-1125 (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 424, + 482, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 424, + 482, + 446 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 482, + 446 + ], + "type": "text", + "content": "39. Yoon, K., Huh, J., Kim, Y.H., Kim, S., Jeong, J.: Textural detail preservation network for video frame interpolation. IEEE Access (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 446, + 482, + 491 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 482, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 482, + 491 + ], + "type": "text", + "content": "40. Zhang, G., Zhu, Y., Wang, H., Chen, Y., Wu, G., Wang, L.: Extracting motion and appearance via inter-frame attention for efficient video frame interpolation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5682-5692 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 491, + 482, + 534 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 482, + 534 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 482, + 534 + ], + "type": "text", + "content": "41. Zhou, T., Tulsiani, S., Sun, W., Malik, J., Efros, A.A.: View synthesis by appearance flow. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part IV 14. pp. 286-301. Springer (2016)" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 225, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interpolate Any Motion for Video Frame Interpolation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_content_list.json b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..7e04328b722a798c5b0aec8069fd2ecafba12bda --- /dev/null +++ b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_content_list.json @@ -0,0 +1,1925 @@ +[ + { + "type": "text", + "text": "IDOL: Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation", + "text_level": 1, + "bbox": [ + 230, + 140, + 772, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yuanhao Zhai\\*1, Kevin Lin\\*2, Linjie Li\\*2, Chung-Ching Lin\\*2, Jianfeng Wang\\*2, Zhengyuan Yang\\*2, David Doermann\\*1, Junsong Yuan\\*1, Zicheng Liu\\*3, and Lijuan Wang\\*2", + "bbox": [ + 222, + 210, + 779, + 258 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 State University of New York at Buffalo", + "bbox": [ + 359, + 268, + 642, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 Microsoft", + "bbox": [ + 460, + 282, + 540, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 Advanced Micro Devices", + "bbox": [ + 410, + 296, + 589, + 310 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "https://yhzhai.github.io/idol/", + "bbox": [ + 383, + 311, + 617, + 325 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Significant advances have been made in human-centric video generation, yet the joint video-depth generation problem remains under-explored. Most existing monocular depth estimation methods may not generalize well to synthesized images or videos, and multi-view-based methods have difficulty controlling the human appearance and motion. In this work, we present IDOL (unIfied Dual-mOdal Latent diffusion) for high-quality human-centric joint video-depth generation. Our IDOL consists of two novel designs. First, to enable dual-modal generation and maximize the information exchange between video and depth generation, we propose a unified dual-modal U-Net, a parameter-sharing framework for joint video and depth denoising, wherein a modality label guides the denoising target, and cross-modal attention enables the mutual information flow. Second, to ensure a precise video-depth spatial alignment, we propose a motion consistency loss that enforces consistency between the video and depth feature motion fields, leading to harmonized outputs. Additionally, a cross-attention map consistency loss is applied to align the cross-attention map of the video denoising with that of the depth denoising, further facilitating spatial alignment. Extensive experiments on the TikTok and NTU120 datasets show our superior performance, significantly surpassing existing methods in terms of video FVD and depth accuracy.", + "bbox": [ + 259, + 362, + 743, + 654 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 679, + 375, + 695 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The capacity to control and manipulate human-centric video content – modulating subjects' actions, altering appearance and background – has attracted continual study [29, 42, 62, 63, 68]. With the rapid evolution of generative models, from generative adversarial networks [6, 17] to recent latent diffusion models [56], the quality of the generated video has improved significantly. However, most of the existing research [29, 42, 62, 63, 68] has focused on the generation of 2D content. This imposes a natural limit on applications that require depth perception,", + "bbox": [ + 212, + 710, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Work done during an internship at Microsoft.", + "bbox": [ + 217, + 824, + 537, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/9a4d73b05969ea5ce6b96d69e3e1623f840a09fb4a37e15cdd835299ab987f86.jpg", + "image_caption": [ + "Fig. 1: Given a human foreground image, an arbitrary background image, and a defined pose sequence, our IDOL generates high-fidelity video and the corresponding depth maps, which can be rendered as realistic 2.5D video." + ], + "image_footnote": [], + "bbox": [ + 217, + 146, + 785, + 260 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "such as virtual and augmented reality, as well as advanced video games. In this paper, we explore joint video-depth generation for human actions (e.g., dancing and daily activities), where the video and the corresponding depth map are simultaneously generated. By learning a holistic representation of the human, it not only enhances the visual fidelity of the synthesized content but also paves the way for applications that demand a deeper spatial understanding.", + "bbox": [ + 212, + 347, + 787, + 439 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Existing methods confront several challenges in dealing with this task. First, discriminative monocular depth estimation methods [27, 54], which are typically trained on natural images, have been empirically observed to exhibit degraded performance when applied to generated images [2, 3, 80, 81]. On the other hand, while multi-view-based methods [18, 48, 52, 69, 73] can estimate depth, they primarily focus on the synthesis of individual object/scene. They often struggle with inference from single-view inputs or underperform in manipulating the object's appearance and motion. To address these problems, we propose to jointly generate the video and the corresponding depth.", + "bbox": [ + 212, + 441, + 787, + 578 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, joint video-depth generation presents nontrivial challenges for two primary reasons. First, video and depth are inherently two different modalities: the former is represented as a 3-channel RGB frame sequence and the latter as a scalar depth map sequence [53,54]. Contrarily, prevailing diffusion models are pre-trained on the single-modal image generation task [56]. Thus, designing a dual-modal diffusion model for joint video-depth generation is challenging, not to mention harnessing the power of pre-trained latent diffusion models. Second, spatial layout control has been a long-standing problem in diffusion models [16,22,44,66]. Even with human pose control, maintaining an accurate spatial alignment between the generated video and depth remains a challenge. This challenge can be more pronounced if the denoising process is conducted in the latent space, given the intricate mapping from the latent space to the final output. In addressing these problems, we propose IDOL (unIfied Dual-mOdal Latent diffusion), a framework that aims to generate a human-centric video and the corresponding depth jointly.", + "bbox": [ + 212, + 580, + 789, + 806 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To tackle the problem of distinct video and depth representations, we propose to render depth maps as RGB images by applying a color map to them. This", + "bbox": [ + 212, + 809, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 362, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "conversion reframes the depth generation task as a stylized video generation problem. Besides, existing methods suggest that incorporating depth as input enhances structural understanding and boosts the generation quality [13]. Drawing inspiration from this, we hypothesize that a richer interplay between depth and video generation would be reciprocally beneficial. To this aim, we design a unified dual-modal U-Net that shares parameters across both video and depth denoising processes. Our model leverages a modality label to specify the denoising target, i.e., video or depth. In this way, it enables joint learning of depth and video for better generation quality while remaining parameter-efficient. Furthermore, a cross-modal attention layer is added during the joint denoising process, enabling an explicit correlation between the joint video-depth learning.", + "bbox": [ + 212, + 146, + 787, + 311 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To ensure a precise video-depth alignment, we propose to synchronize the motion pattern of the intermediate video and depth features. Specifically, the intermediate video and depth features within the U-Net contain semantic information, where regions with similar semantic meanings are represented with similar features [5,16,66], as shown in Fig. 3. Thus, by using the proposed motion consistency loss, we enforce a consistent motion between video and depth features, thereby promoting a precise video-depth spatial alignment. Additionally, we propose a cross-attention map consistency loss to further strengthen video-depth alignment. This is drawn inspiration from existing observations [22,49] on the influence of cross-attention maps on the spatial layout. Different from [22,49], we consider spatial alignment across video and depth modalities.", + "bbox": [ + 212, + 313, + 787, + 478 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, our contributions are as follows.", + "bbox": [ + 238, + 479, + 566, + 493 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose IDOL, a pioneering framework for human-centric joint video-depth generation. Our IDOL features a parameter-sharing unified dual-modal U-Net for video-depth denoising. Besides, cross-modal attention modules are used to enable the mutual information flow.", + "- We propose a motion consistency loss and a cross-attention map consistency loss to allow fine-grained video-depth spatial alignment.", + "- We conduct extensive experiments on two distinct datasets: TikTok and NTU120, whose depth maps were obtained using different methods [27,53,54]. The results not only show a significant improvement in video quality and depth accuracy over state-of-the-art methods, but also highlight the flexibility of our method in adapting to different depth maps. Furthermore, our experiments reveal that our IDOL can be easily adapted to different diffusion models." + ], + "bbox": [ + 225, + 501, + 787, + 681 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 703, + 387, + 719 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Controllable diffusion models. Evolving from early diffusion models [12, 24], recent latent diffusion models (LDM) [56] achieves high-quality image generation by conducting the denoising process in the latent space. ControlNet [78], GLIGEN [33] and T2I-Adapter [45] add trainable modules on pre-trained diffusion models, and achieve fine-grained control given additional inputs, such as sketch and depth. HumanSD [29] directly concatenates the pose feature and the noise in the input to avoid potential feature discrepancy problems. In the", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "video generation domain, controllable video diffusion models [11,26,42] leverage the depth/flow/edge sequence to generate a temporally consistent video. Our work builds upon these controllable models, utilizing plug-in modules to facilitate human pose control in IDOL. Our experiments demonstrate our adaptability across various frameworks (e.g., ControlNet [78] and T2I-Adapter [45]).", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Image animation. Image animation involves producing a video wherein an object from the source image moves in congruence with the motion in a target video. Traditional methods require specific knowledge about the target object, such as facial landmarks [21, 50, 77], gestures [65], or semantic segmentation maps [47]. Several methods learn a motion field [62, 70] from the driving videos. First order motion model (FOMM) [62] improves the animation quality by learning a local affine transformation. Motion representation for articulated animation (MRAA) [63] achieves better quality in representing articulated motions, such as the human body. Thin-plate spline (TPS) [79] estimates a more accurate motion, and improves previous methods over large-scale motions. Besides, there exists a line of methods [43, 55] exploiting end-to-end learning frameworks. Based on diffusion models, DreamPose [30] proposes an adapter module, such as to control the appearance of the generated human. DisCo [68] disentangles the human attribute and pose condition learning by employing a two-stage training scheme. Several concurrent works improve DisCo [68] using more advanced appearance and motion control [8, 25, 74]. Furthermore, several methods [31, 42] inject motion/pose prior to pre-trained text-to-image models. Distinctively, our IDOL focuses on the joint video-depth generation, and utilizes depth generation to enhance the overall quality of the animated video, instead of video-only generation.", + "bbox": [ + 212, + 226, + 789, + 513 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Multi-modality synthesis. There exists a line of diffusion models for view synthesis, such as diffusion models using multi-view images [18, 69, 73], point cloud [46], and text-to-3D models [48, 52]. There are also methods developed for human body mesh estimation [34, 39-41]. However, they may struggle with human-centric joint video-depth synthesis, as they typically require multi-view input or lack the ability to precisely control the appearance and motion of the target object/scene. Except for the use of multi-view images, LDM3D [64] modifies the autoencoder in LDM, such that the latent can be decoded into an RGB image and a depth map. MM-Diffusion [58] focuses on the audio-video generation, and features a coupled U-Net structure to simultaneously denoise video and audio latents. Concurrently, HyperHuman [38] proposes structural expert branches to denoise latents of different modalities, such as RGB image, depth and surface normal. To the best of our knowledge, there is no existing method directly working on the joint video-depth generation task, and thus, we modify the backbones of existing multi-modal generation methods for comparison.", + "bbox": [ + 212, + 518, + 789, + 744 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Diffusion models for dense prediction. Diffusion models have been used in various dense prediction tasks, such as segmentation tasks [1, 5, 10, 28, 71, 72], depth estimation [28, 59] and object detection [9]. For depth estimation methods [28, 59], they typically necessitate modifying the output from 3-channel RGB images to scalar depth maps. Such a transformation impedes their ability to harness the power of large-scale pre-trained diffusion models [56]. Concurrently,", + "bbox": [ + 212, + 750, + 789, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 362, + 127 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/f3be8cd5a36e0aa17d9523a45ea60ed4ddbae20efa317a6ee959e057d63d05a5.jpg", + "image_caption": [ + "Fig. 2: Left: Overall model architecture. Our IDOL features a unified dual-modal U-Net (gray boxes), a parameter-sharing design for joint video-depth denoising, wherein the denoising target is controlled by a one-hot modality label ( $y_{\\mathrm{v}}$ for video and $y_{\\mathrm{d}}$ for depth). Right: Individual U-Net block structure. Cross-modal attention is added to enable mutual information flow between video and depth features, with consistency loss terms $\\mathcal{L}_{\\mathrm{mo}}$ and $\\mathcal{L}_{\\mathrm{xattn}}$ ensuring the video-depth alignment. Skip connections are omitted for conciseness." + ], + "image_footnote": [], + "bbox": [ + 215, + 142, + 516, + 281 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/b5f12c0e948ccfc60769db0d2b0c96f9018de2ba1b951ac5cd565bead317633d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 522, + 147, + 785, + 279 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Depth Anything [75] address this problem by leveraging large-scale unlabeled data to improve the estimation quality. Additionally, when applied to synthesized content, existing depth estimation methods tend to underperform [2,3,80,81], failing to generate high-quality depth maps from outputs of image animation methods. To mitigate this problem, we propose IDOL to directly synthesize the video and the corresponding depth, significantly improving the depth accuracy.", + "bbox": [ + 212, + 420, + 785, + 511 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In contrast to existing methods, we reframe the depth synthesis task as a stylized image synthesis task. By rendering target depths as RGB images, we are positioned to directly use pre-trained image generation models with minimal modifications. Furthermore, we propose a unified dual-modal U-Net for improved joint video-depth generation, and enhance video-depth spatial alignment via the proposed consistency losses.", + "bbox": [ + 212, + 512, + 785, + 602 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 626, + 328, + 642 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Problem formulation. We begin by formally defining the task of human-centric joint video-depth generation. Given a human foreground image $f$ , a background image $b$ , and a pose sequence $p = \\{p_1, p_2, \\dots, p_L\\}$ of length $L$ , our objective is to generate a video $v = \\{v_1, v_2, \\dots, v_L\\}$ and the associated depth map sequence $d = \\{d_1, d_2, \\dots, d_L\\}$ . The video $v$ should faithfully animate the human foreground $f$ into the target pose $p$ while integrating it with the background $b$ . The depth map sequence $d$ should correctly represent the depth within the video $v$ . An illustration is shown in Fig. 1.", + "bbox": [ + 212, + 657, + 785, + 777 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Preliminaries. Latent diffusion models (LDM) [56] recently show great success in image generation. It operates in the latent space of a pre-trained autoencoder $\\mathcal{D}(\\mathcal{E}(\\cdot))$ , where a time-conditioned U-Net [57] $\\epsilon_{\\theta}(\\cdot)$ with learnable parameter $\\theta$ is used for denoising the latent feature. Within the U-Net, the conditional signal", + "bbox": [ + 214, + 779, + 785, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "$c$ (e.g., textual prompt) is fed in the cross-attention module after CLIP [51] encoding. During training, the objective is the mean square error (MSE) between the predicted and ground truth noise:", + "bbox": [ + 212, + 146, + 787, + 191 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathbb {E} _ {v, \\epsilon , t, c} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, c) \\| _ {2} ^ {2} \\right], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 392, + 204, + 785, + 220 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\epsilon \\in \\mathcal{N}(0,I)$ is the ground truth noise, and $z_{t}$ is the noisy latent at the $t$ -th reverse step, and can be obtained from $\\mathcal{E}(v)$ and $\\epsilon$ [24]. To enable spatial layout control, ControlNet [78] adds a copy of the U-Net down and middle blocks upon the LDM. The output of ControlNet is added to the original U-Net via skip connections. By manipulating the intermediate features, ControlNet trained with additional conditional input (poses in our case) can control the output image/video [68].", + "bbox": [ + 212, + 231, + 787, + 339 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Unified dual-modal U-Net", + "text_level": 1, + "bbox": [ + 215, + 361, + 478, + 375 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Video and depth are different modalities and typically have distinct representations. Designing a model architecture that can jointly generate both video and depth, and potentially leverage pre-trained diffusion models, presents a significant challenge. In addressing this problem, we propose to reformulate depth synthesis as a stylized image generation task. By rendering the depth map as a heatmap, we bridge the gap between the video and depth modalities. To further harness this approach, we introduce a unified dual-modal U-Net, specially tailored for the joint video-depth denoising.", + "bbox": [ + 212, + 386, + 787, + 507 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Video LDM baseline. We build our model upon 3D U-Net [13], which modifies the 2D U-Net [56] by adding a temporal convolutional layer in the ResBlock, and adding a temporal attention layer after the spatial attention within each block. For the human appearance and pose control, we follow DisCo [68] to feed the CLIP foreground latent $\\mathrm{CLIP}(f)$ via cross-attention, and feed the pose latent $\\mathcal{E}(p)$ via a ControlNet to the U-Net. We show in Sec. 4.1 that our method can be implemented on different pose control modules, such as T2I-Adapter [45]. For the background control, different from DisCo that leverages a ControlNet, we find that adding the background latent $\\mathcal{E}(b)$ to the input noise of the U-Net not only yields comparable results but also reduces the number of parameters. The proposed model architecture is illustrated in Fig. 2.", + "bbox": [ + 212, + 507, + 787, + 672 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Sharing U-Net for joint video-depth denoising. Existing methods [13] have shown that incorporating depth map as conditional input enhances the model's video structure awareness, improving the video generation quality. Building on this insight, we hypothesize that maximizing the information exchange between video and depth during generation can benefit the generation quality for both modalities. Thus, we propose a unified dual-modal U-Net for video and depth denoising, where the architecture and parameters of the U-Net and ControlNet are shared between the two modalities. To indicate the denoising modality, we add a learnable modality embedding to the time step embedding, which is fed to all blocks within the U-Net and the ControlNet, as shown in Fig. 2 right. In this way, given a one-hot modality label, the corresponding modality embedding will", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 362, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "be selected to feed into the model and further control the output modality. Apart from being parameter-efficient, we find that this unified architecture improves both video and depth generation quality (Sec. 4.2).", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Cross-modal attention. Though the unified dual-modal U-Net enables implicit structural information learning, direct information communication during the video and depth denoising process is needed for better alignment. Thus, we add a multi-modality attention at the end of each block (Fig. 2 right). During the joint video-depth denoising process, the video and depth features are concatenated to conduct spatial self-attention. Note that self-attention is only performed in the spatial dimension, as it aims to promote spatial alignment between video and depth, and the preceding temporal layers already ensure the temporal smoothness.", + "bbox": [ + 212, + 191, + 787, + 311 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The joint video-depth denoising objective $\\mathcal{L}_{\\mathrm{denoise}}$ is:", + "bbox": [ + 238, + 313, + 620, + 328 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} _ {\\mathrm {d e n o i s e}} = \\mathbb {E} _ {v, d, \\epsilon_ {\\mathrm {v}}, \\epsilon_ {\\mathrm {d}}, t, f, b, p} \\big [ \\| \\epsilon_ {\\mathrm {v}} - \\epsilon_ {\\theta} (z _ {\\mathrm {v}, t}, t, f, b, p; y _ {\\mathrm {v}}) \\| _ {2} ^ {2} + \\\\ \\begin{array}{l} \\left\\| c _ {V} - c _ {\\theta} \\left(z _ {V, t}, v, f, b, p, y _ {V}\\right) \\right\\| _ {2} ^ {2} + \\\\ \\left\\| \\epsilon_ {d} - \\epsilon_ {\\theta} \\left(z _ {d, t}, t, f, b, p; y _ {d}\\right) \\right\\| _ {2} ^ {2} ], \\end{array} \\tag {2} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 307, + 339, + 784, + 378 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $y_{\\mathrm{v}}$ and $y_{\\mathrm{d}}$ are the modality labels for video and depth, respectively, $\\epsilon_{\\mathrm{v}}, \\epsilon_{\\mathrm{d}} \\in \\mathcal{N}(0, I)$ are independently sampled Gaussian noises, and $f, b, p$ denote the human foreground image, the background image, and the target pose sequence, respectively. In Eq. (2), the first term is the video denoising loss and the second term is the depth denoising loss.", + "bbox": [ + 214, + 388, + 787, + 463 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 Learning video-depth consistency", + "text_level": 1, + "bbox": [ + 215, + 487, + 535, + 503 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Though the pose control ensures the coarse correspondence between the video and depth, we empirically find that only applying the joint denoising objective $\\mathcal{L}_{\\mathrm{denoise}}$ may still lead to misalignment between the generated video and depth, especially when the training data is limited, as shown in the first column of Fig. 3. To promote a precise video-depth alignment, we propose a motion consistency loss $\\mathcal{L}_{\\mathrm{mo}}$ and a cross-attention map consistency loss $\\mathcal{L}_{\\mathrm{xattn}}$ .", + "bbox": [ + 212, + 513, + 787, + 604 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Motion consistency loss. In image diffusion models, the intermediate self-attention features in the U-Net are found to contain semantic information [5,16,66]. We found this finding also holds in our video-depth diffusion model. However, though video and depth features share similar layouts, they may differ in the temporal motion, as illustrated in Fig. 3. Thus, we attribute the video-depth misalignment to the unsynchronized motion between video and depth features. To address this problem, we propose to enforce a synchronized motion between the video and depth features via a motion consistency loss $\\mathcal{L}_{\\mathrm{mo}}$ .", + "bbox": [ + 212, + 604, + 787, + 724 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Specifically, given intermediate video self-attention feature maps at frame $l$ and $l + 1$ : $F_{\\mathrm{v},l}, F_{\\mathrm{v},l + 1} \\in \\mathbb{R}^{H \\times W \\times D}$ , their cost volume $C_{\\mathrm{v},l} \\in \\mathbb{R}^{H \\times W \\times H \\times W}$ can be constructed by conducting cosine similarity between all point pairs on the two frames:", + "bbox": [ + 212, + 726, + 787, + 784 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nc _ {\\mathrm {v}, l, i, j, h, k} = f _ {\\mathrm {v}, l, i, j} \\cdot f _ {\\mathrm {v}, l + 1, h, k}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 398, + 787, + 784, + 803 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $f_{\\mathrm{v},l,i,j}$ is the normalized feature vector on $F_{\\mathrm{v},l}$ at spatial location $i,j$ . The cost volume $C_{\\mathrm{d},r}$ for the depth feature maps can be computed in a similar way.", + "bbox": [ + 212, + 809, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/77f92efe8efffde9042c3afd963e062060abe561071a99c83858b0363a21a869.jpg", + "image_caption": [ + "Fig. 3: Visualization of the video and depth feature maps and their motion fields without consistency losses. We attribute the inconsistent video-depth output (blue circle) to the inconsistent video-depth feature motions (the last row). This problem exists in multiples layers within the U-Net, and we randomly select two layers for visualization. We follow [66] to visualize the feature maps, and different color in the motion file indicates different moving direction." + ], + "image_footnote": [], + "bbox": [ + 215, + 141, + 787, + 296 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem.", + "bbox": [ + 511, + 344, + 787, + 441 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem.", + "bbox": [ + 511, + 344, + 787, + 441 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As the video and depth features may be distributed differently, we further normalize the cost volume via softmax, resulting in a motion field $U_{\\mathrm{v},l}$ :", + "bbox": [ + 215, + 484, + 784, + 516 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nu _ {\\mathrm {v}, l, i, j, h, k} = \\frac {\\exp \\left(c _ {\\mathrm {v} , l , i , j , h , k} / \\tau\\right)}{\\sum_ {h ^ {\\prime}} \\sum_ {k ^ {\\prime}} \\exp \\left(c _ {\\mathrm {v} , l , i , j , h ^ {\\prime} , k ^ {\\prime}} / \\tau\\right)}, \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 525, + 784, + 560 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\tau$ is a temperature hyper-parameter controlling the concentration of the distribution. A high value on the motion field indicates a movement between two points. The motion consistency is achieved by minimizing the MSE loss between the video and depth motion fields:", + "bbox": [ + 215, + 566, + 787, + 628 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {m o}} = \\frac {1}{L H W H W} \\sum_ {l, i, j, h, k} \\| u _ {\\mathrm {v}, l, i, j, h, k} - u _ {\\mathrm {d}, l, i, j, h, k} \\| _ {2} ^ {2}. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 316, + 636, + 784, + 672 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "By enforcing similar motion of video and depth features, it promotes a consistent video and depth output.", + "bbox": [ + 215, + 681, + 784, + 710 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Cross-attention map consistency loss. Except for leveraging the self-attention feature, the cross-attention maps between the foreground image and the input noise are also found to be critical in the image layout control [22,49]. Thus, we additionally enforce the cross-attention maps from the video stream and the depth stream to be similar via an MSE loss $\\mathcal{L}_{\\mathrm{xattn}}$ :", + "bbox": [ + 215, + 712, + 784, + 787 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {x a t t n}} = \\left\\| M _ {\\mathrm {v}} - M _ {\\mathrm {d}} \\right\\| _ {2} ^ {2}, \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 797, + 784, + 815 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $M_{\\mathrm{v}}$ and $M_{\\mathrm{d}}$ represent the video and depth cross-attention map, respectively.", + "bbox": [ + 215, + 824, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As the ControlNet fuses features in the U-Net up blocks, we apply the consistency loss terms only to the U-Net up blocks to efficiently learn the U-Net and the ControlNet. The overall training objective $\\mathcal{L}$ is defined as:", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {\\text {d e n o i s e}} + \\sum_ {n = 1} ^ {N} \\left(w _ {\\mathrm {m o}} \\mathcal {L} _ {\\mathrm {m o}, n} + w _ {\\mathrm {x a t t n}} \\mathcal {L} _ {\\mathrm {x a t t n}, n}\\right), \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 330, + 204, + 785, + 244 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $w_{\\mathrm{mo}}$ and $w_{\\mathrm{xattn}}$ are weighting hyper-parameters, $N$ is the number of up blocks, and $\\mathcal{L}_{\\mathrm{mo},n}$ and $\\mathcal{L}_{\\mathrm{xattn},n}$ are the motion consistency loss and the cross-attention map consistency loss on the $n$ -th up block, respectively.", + "bbox": [ + 212, + 255, + 787, + 301 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.3 Human attribute outpainting pre-training", + "text_level": 1, + "bbox": [ + 214, + 323, + 606, + 339 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To disentangle the pose and background control, DisCo [68] proposes a human attribute pre-training (HAP) task to learn human appearance. Specifically, HAP learns to reconstruct the whole image given human foreground and background images, with the pose ControlNet being removed, as shown in Fig. 4 top. However, we empirically find that such pre-training may lead to an apparent background mask when the target pose deviates from the original position.", + "bbox": [ + 212, + 349, + 784, + 439 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To address this problem, we propose human attribute outpainting pre-training (HAOP). Our HAOP differs from HAP in two ways. First, HAOP extends the background mask through dilation, forcing the model to fill in the background around the foreground. Second, we apply a random crop and resize on the foreground image, prompting the model to extrapolate the partial human attributes. This process not only mitigates the background masking problem but also improves image synthesis, as demonstrated in Fig. 4 and validated in our ablation studies (Sec. 4.2). Formally, the pre-training learning objective is as follows:", + "bbox": [ + 212, + 441, + 787, + 561 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {H A O P}} = \\mathbb {E} _ {v, \\epsilon , t, f _ {\\mathrm {a u g}}, b _ {\\mathrm {a u g}}} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} \\left(z _ {t}, t, f _ {\\mathrm {a u g}}, b _ {\\mathrm {a u g}}\\right) \\| _ {2} ^ {2} \\right], \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 323, + 573, + 784, + 590 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $f_{\\mathrm{aug}}$ and $b_{\\mathrm{aug}}$ represent augmented foreground and background, respectively. Note that the pre-training does not require depth denoising, which significantly lowers the data demand.", + "bbox": [ + 212, + 601, + 787, + 646 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 671, + 375, + 689 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets. We train and evaluate on two public datasets: TikTok [27] and NTU120 [36,61]. The TikTok dataset consists of $\\sim 350$ human dancing videos. We follow DisCo [68] to use 335 videos for training, and use 10 videos for evaluation. The NTU120 dataset consists of daily activities videos, we select 588 videos for training and 72 videos for evaluation. The videos are cropped to center to the subject. We specifically ensure distinct subjects and backgrounds between training and evaluation, and select only certain subjects to better evaluate the generalization ability. Besides, we use Grounded-SAM [32,37] for the human foreground mask estimation, and follow ControlNet [78] to use OpenPose [7]", + "bbox": [ + 212, + 703, + 787, + 842 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/06a2a322eabd9be964ad00b12a072c73d8b0ef6289b41c66cb46bc39e0579447.jpg", + "table_caption": [], + "table_footnote": [ + "Table 1: Quantitative results comparison between our IDOL and existing methods on the TikTok and NTU120 datasets. The ground truth depth is estimated via HDNet [27]. \" $\\ddagger$ \" indicates incapable of generating depth map, \" $\\ddagger$ \" indicates the HDNet-inferred depth from the synthesized image. The best and the second best results are denoted in bold and underscored, respectively." + ], + "table_body": "
MethodMotion controlTikTokNTU120
VideoDepthImageVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓FID-FVD↓FVD↓L2↓FID↓
FOMM [62]38.36404.31-85.0340.341439.50-80.29
MRAA [63]Target video24.11306.49-54.4758.191441.79-97.07
TPS [79]29.20337.79-53.7837.421339.86-61.75
DreamPose [30]DensePose [19]52.62614.07-75.0880.11791.25-116.23
DisCo [68]20.75257.900.0975†39.0226.21458.920.0371†68.53
LDM3D [64]OpenPose [7]45.30553.030.063769.3671.11587.840.0650120.74
MM-Diffusion [58]48.92771.320.036768.4758.44504.050.0404102.77
IDOLOpenPose [7]17.86223.690.033636.0420.23314.820.031750.70
", + "bbox": [ + 215, + 143, + 785, + 271 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "for human pose estimation. For the depth estimation, we leverage two different methods: HDNet [27] for high-fidelity depth estimation on the human foreground, where the background depth is set to a constant; MiDaS [53, 54] for the whole-frame depth estimation, which lacks details on the human foreground. The HDNet depth map is rendered by applying the \"hot\" colormap; the MiDaS depth map is rendered as grayscale images. For pre-training, we follow DisCo [68] to use $\\sim 700\\mathrm{k}$ images from a combined dataset of TikTok [27], COCO [35], SHHQ [14], DeepFashion2 [15], and LAION [60].", + "bbox": [ + 212, + 391, + 787, + 513 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation metrics. We separately evaluate the quality of the generated video and depth. For video quality evaluation, we follow DisCo [68] to use FID-FVD [4] and FVD [67] over every 8-frame snippet. For the evaluation of depth synthesis, for simplicity, we first scale the depth in the range $[0,1]$ , and compute L2 distance between the ground truth depth4 and the generated depth. In addition to evaluating the generated video and depth, we further use FID [23] on the frames to measure the image quality.", + "bbox": [ + 212, + 515, + 787, + 621 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Comparison methods. We adopt state-of-the-art image animation methods FOMM [62], MRAA [63], TPS [79], DreamPose [30], and DisCo [68] for the video and image quality comparison. As a pioneering method in human-centric joint video-depth generation, to our knowledge, there is no direct prior work for the joint video-depth generation quality comparison. Thus, we adapt the most relevant multi-modal generation methods (LDM3D [64] for text to image-depth and MM-Diffusion [58] for text to video-audio), modify their backbones to the same VideoLDM baseline as ours (Sec. 3.1) to enable appearance and pose control, and compare the joint video-depth generation results with them.", + "bbox": [ + 212, + 625, + 787, + 761 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 361, + 126 + ], + "page_idx": 9 + }, + { + "type": "page_footnote", + "text": "4 The depth evaluation is conducted on the synthesized depth and the depth estimated from the ground truth image instead of that estimated from the generated images. This is because we empirically find that the depth estimated from the generated image tends to be noisy (see Fig. 5 and Fig. 6).", + "bbox": [ + 218, + 782, + 787, + 839 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/b702172df842a26278db2eaa3a9fbf2a09529b500916f4e4983538760772d24b.jpg", + "image_caption": [ + "Fig. 5: Qualitative results comparison between TPS [79], DisCo [68], LDM3D [64], MM-Diffusion [58] and our IDOL on the TikTok and NTU120 datasets with HDNet estimated depth [27]. Note that TPS [79] is unable to generate depth, and the depth map for DisCo is estimated via HDNet on its generated frames. Please find video comparison in the supplementary material." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 785, + 383 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.1 Main results", + "text_level": 1, + "bbox": [ + 215, + 493, + 366, + 507 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In our experiments, we use the HDNet depth [27] by default for its high-fidelity human foreground depth estimation. We also train and evaluate on the MiDaS depth [53, 54] to demonstrate the generalization ability of our IDOL.", + "bbox": [ + 212, + 521, + 785, + 566 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Comparison with the state-of-the-art. We compare IDOL with state-of-the-art methods on the TikTok and NTU120 datasets in Tab. 1, with the generated frame and depth visualized in Fig. 5. We make the following observations. (1) We outperform all competing motion transfer and video generation methods [30, 62, 63, 68, 79] in terms of both video and image quality. (2) When adapting multi-modal generation methods [58, 64] for human-centric joint video-depth generation, with the integration of the video LDM baseline (Sec. 3.1), IDOL consistently outperforms them across video, image, and depth metrics on both datasets, demonstrating the effectiveness of our method. (3) Applying HDNet depth estimation to the previous state-of-the-art DisCo generated frames leads to suboptimal results, with incomplete, fragmentary or overly simplistic estimations, as shown in Fig. 5. As the estimation result deviates from the ground truth, the HDNet results lead to a high depth L2, as listed in the DisCo row of Tab. 1. This finding indicates the limited generalization ability of monocular depth methods, and highlights the need for multi-modal generation approaches.", + "bbox": [ + 212, + 566, + 787, + 792 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Comparison on synthesizing different types of depth map. Tab. 2 compares the results on using the MiDaS grayscale depth map [53, 54] for the joint video-depth generation. The results consistently show that our IDOL outperforms", + "bbox": [ + 212, + 794, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/51a4650787d8f661d5a2d4b88761dda3217082085956af501bca4b3dde774605.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
TikTokDisCo [68]20.75257.900.1758‡39.02
LDM3D [64]42.09529.430.064672.30
MM-Diffusion [58]52.37715.280.104070.09
IDOL19.01216.960.027139.76
NTU120DisCo [68]26.21458.920.0695‡68.53
LDM3D [64]77.04591.030.0244115.16
MM-Diffusion [58]73.47503.530.0260117.22
IDOL20.56439.630.021055.70
", + "bbox": [ + 215, + 146, + 491, + 251 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/eee27acbe36b0d0e7d4b898f05d464ab0b9c64c2f06d1528ac7bffe352748957.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 500, + 157, + 589, + 196 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/c41d8a161a0e359a56be8583c3ca1e3493a50747f6882e00183aa4dfe7926b61.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 500, + 227, + 589, + 265 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/a565573d72ac68762bbe260afec7a4955e5b52ac49e0e5005598bea2d3ae4f6b.jpg", + "image_caption": [ + "Reference image Target pose", + "Fig. 6: Qualitative results comparison on MiDaS [53,54] grayscale whole-frame depth map generation." + ], + "image_footnote": [], + "bbox": [ + 596, + 143, + 785, + 296 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/652f435b2d06f708aace9bfe1f41705d3cb750c5c909882f8520c787b2284a73.jpg", + "table_caption": [ + "Table 2: Quantitative comparison between our method and existing methods on the TikTok and NTU120 datasets with MiDaS estimated depth [53,54]. \"‡\" indicates the MiDaS estimated depth from the synthesized image." + ], + "table_footnote": [], + "table_body": "
Motion repr.Temporal modelingPose controlVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
OpenPose [7]HandcraftedControlNet [78]17.86223.690.033636.04
OpenPose [7]AnimateDiff [20]ControlNet [78]19.58201.830.035033.14
DWPose [76]AnimateDiff [20]ControlNet [78]16.73179.200.024531.06
DWPose [76]AnimateDiff [20]T2I-Adapter [45]14.40188.160.019530.06
", + "bbox": [ + 259, + 364, + 738, + 439 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Table 3: Quantitative result of our IDOL generalize to different motion representations, temporal modeling designs, and pose control module on TikTok [27] with HDNet depth [27]. The gray row indicates our default setting. Please find our supplementary material for additional implementation details.", + "bbox": [ + 212, + 439, + 787, + 494 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "existing multi-modal generation methods [58,64] in both video and depth quality. This further highlights IDOL's effectiveness and its adaptability to different types of depth maps. Additionally, as shown in the DisCo row of Fig. 6, applying MiDaS on the DisCo generated frames also yields suboptimal results, blurring the areas surrounding the human subject, and leads to poorer depth accuracy (measured by L2 norm) than that achieved by generative approaches.", + "bbox": [ + 212, + 537, + 787, + 628 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Generalization ability. Our IDOL follows DisCo [68] for setting the default motion representations (OpenPose [7]) and backbone architectures (ControlNet [78]). In Tab. 3 and Fig. 7, we further show that our IDOL can be easily adapted to other motion representations, temporal modeling modules, and pose control modules. First, IDOL can benefit from the motion prior from pre-trainedAnimateDiff [20] to improve the video quality. Besides, our IDOL can be conditioned to more fine-grained DWPose [76], which provides additional facial and hand keypoints, to improve the video and depth quality. Impressively, even when using OpenPose, which lacks hand keypoint as condition, IDOL effectively generates plausible human hands, demonstrating its robust human attribute learning capabilities. Furthermore, our IDOL can be implemented with different pose control modules, such as ControlNet [78] and T2I-Adapter [45], achieving similar quantitative and qualitative results. Such results demonstrate that our IDOL can be generalized to different design options.", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 361, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/3ebad1a5126aef49fab8d2a5a1e59373a7b0aa52394c4fecd9b557c07eafc1d0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 217, + 142, + 326, + 224 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/0ff9e66f6046805ada1a8f623a7150f5364a8876f39f0bfcc8557942e1c1cabb.jpg", + "image_caption": [ + "Reference image & Target motion representation" + ], + "image_footnote": [], + "bbox": [ + 217, + 224, + 326, + 313 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/da1baf164798d03cf11cf6c8e2b6cefc7bd94a6f510a7aef13c611ee2a1c3cd0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 330, + 142, + 498, + 224 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5539d45dc7ebfa130c47b66c97e05f8a9856df3f507f74f31eca03fee9e639cb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 330, + 224, + 498, + 267 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/276e0e657dafa55b29bdd2b6c2a54b76352241b2e0cc927d9ab1a2aa612834cb.jpg", + "image_caption": [ + "OpenPose ControlNet (default)", + "DWPose DWPose ControlNet T2I-Adapter" + ], + "image_footnote": [], + "bbox": [ + 330, + 267, + 496, + 309 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5afece29b1430a661451f34bc3307a421dddcb5d954ec0cea207c723f8a0c08a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 506, + 170, + 609, + 213 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/4696bc0e773e35cc6d9ad1e5c3dc3191c0dcf41ec2c9a999d0908362df84a0a8.jpg", + "image_caption": [ + "Fig. 7: Qualitative results of our IDOL generalize to different motion representations and pose control modules." + ], + "image_footnote": [], + "bbox": [ + 506, + 250, + 609, + 292 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d89fefb444076440b4d7320c850f1c409cce8510c808e07f1cb4dc3d821f99a5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 617, + 150, + 785, + 273 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/e10ff127018cb90fa7ae37f934f35b5543b9077956675cc39821527785258e54.jpg", + "image_caption": [ + "Reference image Target pose", + "Fig. 8: Qualitative comparison between the baseline video LDM, unified dual-modal U-Net w/o and w/ consistency losses." + ], + "image_footnote": [], + "bbox": [ + 617, + 273, + 779, + 335 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/19b4fd3e044076a763384f5358ff3758283b030a4ca53dccd320ebb6b3a92ff6.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Settings#Param.VideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
Sep. U-Net for joint denoise2 × 1.39B24.28282.500.082241.72
Share U-Net for joint denoise1.39B22.10272.370.036939.43
+ Cross-modal attn.1.41B19.28260.650.036039.01
", + "bbox": [ + 215, + 410, + 531, + 455 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/d94813ee603b22c75d43b917a58c4f52729667a2c804266d8a1a6bea1e55d508.jpg", + "table_caption": [ + "Table 4: Ablation study on the joint video-depth learning and the unified dual-modal U-Net design." + ], + "table_footnote": [], + "table_body": "
\\( {\\mathcal{L}}_{\\text{xatt }} \\)\\( {\\mathcal{L}}_{\\text{mo }} \\)VideoDepthImage
FID-FVD \\( \\downarrow \\)FVD \\( \\downarrow \\)L2 \\( \\downarrow \\)FID \\( \\downarrow \\)
19.29260.650.036039.01
✓19.29244.580.035137.89
✓✓17.86223.690.033636.04
", + "bbox": [ + 563, + 410, + 761, + 455 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 5: Ablation study on the videodepth consistency loss functions $\\mathcal{L}_{\\mathrm{mo}}$ and $\\mathcal{L}_{\\mathrm{xattn}}$", + "bbox": [ + 537, + 455, + 787, + 497 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.2 Ablation studies", + "text_level": 1, + "bbox": [ + 215, + 541, + 397, + 555 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We conduct a set of ablation studies on the TikTok dataset [27] with HDNet depth [27] to demonstrate the effectiveness of our proposed method. These studies are conducted accumulatively, layering each component to assess its incremental impact on the overall performance.", + "bbox": [ + 212, + 566, + 785, + 627 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Unified dual-modal U-Net for joint video-depth denoising. We analyze whether joint video-depth learning improves the performance, and the effectiveness of the designs proposed in the unified dual-modal U-Net in Tab. 4. The key observations are as follows. (1) Jointly video-depth learning with a shared U-Net is beneficial for both video and depth generation (the second row), while using only half the parameters compared to the separate counterpart. Such a result underscores the significance of our structurally-aware shared U-Net. (2) The explicit cross-modal information exchange between the video and depth denoising (the third row), i.e., through cross-modal attention, further improves both the video and depth generation quality. Moreover, as shown in Fig. 8, our unified dual-modal U-Net markedly improves frame and depth quality compared to the separate U-Net baseline. Such results confirm the effectiveness of our design.", + "bbox": [ + 212, + 628, + 785, + 809 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Learning video-depth consistency. In our IDOL, we introduce a motion consistency loss $\\mathcal{L}_{\\mathrm{mo}}$ and a cross-attention map consistency loss $\\mathcal{L}_{\\mathrm{xattn}}$ to enhance", + "bbox": [ + 214, + 809, + 785, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/7f5b508f44af5b80ba3c30fb2101537fe9244aea3963f9f237546e563792aa18.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Pre-training strategyVideoDepthImageMethodFLOPs (T) #Param. (B) GPU mem. (MB) Infer. time (s)
FID-FVD↓FVD↓L2↓FID↓
w/o pre-training39.24452.810.036356.80LDM3D [64]48.801.61766142.02
HAP [68]19.83227.860.033638.71MM-Diffusion [58]41.022.781465113.49
HAOP (ours)17.86223.690.033636.04IDOL (ours)39.351.411025112.23
", + "bbox": [ + 215, + 143, + 787, + 191 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 6: Ablation study on the pre- Table 7: Computational complexity comparison training. son.", + "bbox": [ + 215, + 191, + 787, + 217 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "video-depth alignment. We analyze their impact in Tab. 5, where the results demonstrate that both of them improve the depth generation quality, and the motion consistency loss improves all video, depth, and image generation results. The final column of Fig. 8 further illustrates how these consistency loss terms effectively refine video-depth alignment in our model.", + "bbox": [ + 212, + 265, + 785, + 340 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Human attribute outpainting pre-training. We analyze the effectiveness of our human attribute outpainting pre-training (HAOP) in Tab. 6. The results reveal that HAOP surpasses human attribute pre-training (HAP) [68] across all metrics, confirming its efficacy. Notably, even without pre-training, our IDOL already outperforms other competing multi-modal generation methods [58,64].", + "bbox": [ + 212, + 342, + 785, + 417 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Complexity and computational requirements. We analyzed the complexity of generating an 8-frame video-depth sequence on a single V100 GPU, comparing our method with other multi-modal generation methods in Tab. 7. Thanks to our unified U-Net design, IDOL requires the fewest FLOPs, has the lowest number of trainable parameters, and the shortest inference time, demonstrating our efficiency.", + "bbox": [ + 212, + 419, + 785, + 510 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 541, + 359, + 556 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we propose IDOL, a framework tailed for human-centric joint video-depth generation. Our proposed unified dual-modal U-Net improves the video and depth synthesis by implicit video structure learning, with cross-modal attention explicitly bridging the joint video-depth denoising process. Our motion consistency loss and cross-attention map consistency loss promote spatial alignment between the generated video and depth. Extensive experiments on the TikTok and NTU120 datasets show our superior performance compared with existing methods, and the adaption ability to different kinds of depth maps. Our IDOL is also able to generalize to different motion representations and pose control modules.", + "bbox": [ + 212, + 580, + 785, + 717 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations. Despite the performance advantage of our IDOL, it faces several major limitations. First, the computational demands of processing dual-modal data, particularly at high resolutions, hinder its suitability for real-time applications, highlighting a need for further optimization. Additionally, the reliance on high-quality depth maps for training limits its applicability in scenarios where such data is limited or of low quality. Addressing this, future work may explore unsupervised methods or data augmentation strategies to mitigate the data quality constraint.", + "bbox": [ + 212, + 719, + 785, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work is supported in part by the Defense Advanced Research Projects Agency (DARPA) under Contract No. HR001120C0124. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the Defense Advanced Research Projects Agency (DARPA).", + "bbox": [ + 212, + 176, + 787, + 251 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 273, + 321, + 289 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Amit, T., Shaharbany, T., Nachmani, E., Wolf, L.: Segdiff: Image segmentation with diffusion probabilistic models. arXiv preprint arXiv:2112.00390 (2021)", + "2. Atapour-Abarghouei, A., Breckon, T.P.: Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer. In: CVPR. pp. 2800-2810 (2018)", + "3. Bae, J., Moon, S., Im, S.: Deep digging into the generalization of self-supervised monocular depth estimation. In: AAAI. vol. 37, pp. 187-196 (2023)", + "4. Balaji, Y., Min, M.R., Bai, B., Chellappa, R., Graf, H.P.: Conditional gan with discriminative filter generation for text-to-video synthesis. In: IJCAI. vol. 1, p. 2 (2019)", + "5. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models. arXiv preprint arXiv:2112.03126 (2021)", + "6. Brock, A., Donahue, J., Simonyan, K.: Large scale gan training for high fidelity natural image synthesis. arXiv preprint arXiv:1809.11096 (2018)", + "7. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: CVPR. pp. 7291-7299 (2017)", + "8. Chang, D., Shi, Y., Gao, Q., Fu, J., Xu, H., Song, G., Yan, Q., Yang, X., Soleymani, M.: Magicdance: Realistic human dance video generation with motions & facial expressions transfer. arXiv preprint arXiv:2311.12052 (2023)", + "9. Chen, S., Sun, P., Song, Y., Luo, P.: Diffusiondet: Diffusion model for object detection. In: ICCV. pp. 19830-19843 (2023)", + "10. Chen, T., Li, L., Saxena, S., Hinton, G., Fleet, D.J.: A generalist framework for panoptic segmentation of images and videos. In: ICCV. pp. 909-919 (2023)", + "1. Chen, W., Wu, J., Xie, P., Wu, H., Li, J., Xia, X., Xiao, X., Lin, L.: Control-a-video: Controllable text-to-video generation with diffusion models. arXiv preprint arXiv:2305.13840 (2023)", + "2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021)", + "3. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. In: ICCV. pp. 7346-7356 (2023)", + "4. Fu, J., Li, S., Jiang, Y., Lin, K.Y., Qian, C., Loy, C.C., Wu, W., Liu, Z.: Stylegan-human: A data-centric odyssey of human generation. In: ECCV. pp. 1-19 (2022)", + "5. Ge, Y., Zhang, R., Wang, X., Tang, X., Luo, P.: Deepfashion2: A versatile benchmark for detection, pose estimation, segmentation and re-identification of clothing images In: CVPR. pp. 5337-5345 (2019)", + "6. Geyer, M., Bar-Tal, O., Bagon, S., Dekel, T.: Tokenflow: Consistent diffusion features for consistent video editing. arXiv preprint arXiv:2307.10373 (2023)" + ], + "bbox": [ + 225, + 303, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)", + "18. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. pp. 11808-11826 (2023)", + "19. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: CVPR. pp. 7297-7306 (2018)", + "20. Guo, Y., Yang, C., Rao, A., Wang, Y., Qiao, Y., Lin, D., Dai, B.: Animatediff: animate your personalized text-to-image diffusion models without specific tuning. arXiv preprint arXiv:2307.04725 (2023)", + "21. Ha, S., Kersner, M., Kim, B., Seo, S., Kim, D.: Marionette: Few-shot face reenactment preserving identity of unseen targets. In: AAAI. vol. 34, pp. 10893-10900 (2020)", + "22. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022)", + "23. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. NeurIPS 30 (2017)", + "24. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. NeurIPS 33, 6840-6851 (2020)", + "25. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023)", + "26. Hu, Z., Xu, D.: Videocontrolnet: A motion-guided video-to-video translation framework by using diffusion model with controlnet. arXiv preprint arXiv:2307.14073 (2023)", + "27. Jafarian, Y., Park, H.S.: Learning high fidelity depths of dressed humans by watching social media dance videos. In: CVPR. pp. 12753-12762 (2021)", + "28. Ji, Y., Chen, Z., Xie, E., Hong, L., Liu, X., Liu, Z., Lu, T., Li, Z., Luo, P.: Ddp: Diffusion model for dense visual prediction. arXiv preprint arXiv:2303.17559 (2023)", + "29. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. arXiv preprint arXiv:2304.04269 (2023)", + "30. Karras, J., Holynski, A., Wang, T.C., Kemelmacher-Shlizerman, I.: Dreampose: Fashion image-to-video synthesis via stable diffusion. arXiv preprint arXiv:2304.06025 (2023)", + "31. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023)", + "32. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)", + "33. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: CVPR. pp. 22511-22521 (2023)", + "34. Lin, K., Wang, L., Liu, Z.: End-to-end human pose and mesh reconstruction with transformers. In: CVPR. pp. 1954-1963 (2021)", + "35. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 361, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "36. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: Ntu rgb+ d 120: A large-scale benchmark for 3d human activity understanding. IEEE TPAMI 42(10), 2684-2701 (2019)", + "37. Liu, S., Zeng, Z., Ren, T., Li, F., Zhang, H., Yang, J., Li, C., Yang, J., Su, H., Zhu, J., et al.: Grounding dino: Marrying dino with grounded pre-training for open-set object detection. arXiv preprint arXiv:2303.05499 (2023)", + "38. Liu, X., Ren, J., Siarohin, A., Skorokhodov, I., Li, Y., Lin, D., Liu, X., Liu, Z., Tulyakov, S.: Hyperhuman: Hyper-realistic human generation with latent structural diffusion. arXiv preprint arXiv:2310.08579 (2023)", + "39. Luan, T., Li, Z., Chen, L., Gong, X., Chen, L., Xu, Y., Yuan, J.: Spectrum auc difference (saucd): Human-aligned 3d shape evaluation. In: CVPR. pp. 20155-20164 (2024)", + "40. Luan, T., Wang, Y., Zhang, J., Wang, Z., Zhou, Z., Qiao, Y.: Pc-hmr: Pose calibration for 3d human mesh recovery from 2d images/videos. In: AAAI (2021)", + "41. Luan, T., Zhai, Y., Meng, J., Li, Z., Chen, Z., Xu, Y., Yuan, J.: High fidelity 3d hand shape reconstruction via scalable graph frequency decomposition. In: CVPR. pp. 16795-16804 (2023)", + "42. Ma, Y., He, Y., Cun, X., Wang, X., Shan, Y., Li, X., Chen, Q.: Follow your pose: Pose-guided text-to-video generation using pose-free videos. arXiv preprint arXiv:2304.01186 (2023)", + "43. Mallya, A., Wang, T.C., Liu, M.Y.: Implicit warping for animation with image sets. NeurIPS 35, 22438-22450 (2022)", + "44. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: CVPR. pp. 6038-6047 (2023)", + "45. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)", + "46. Nichol, A., Jun, H., Dhariwal, P., Mishkin, P., Chen, M.: Point-e: A system for generating 3d point clouds from complex prompts. arXiv preprint arXiv:2212.08751 (2022)", + "47. Nirkin, Y., Keller, Y., Hassner, T.: Fsgan: Subject agnostic face swapping and reenactment. In: ICCV. pp. 7184-7193 (2019)", + "48. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022)", + "49. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023)", + "50. Qian, S., Lin, K.Y., Wu, W., Liu, Y., Wang, Q., Shen, F., Qian, C., He, R.: Make a face: Towards arbitrary high fidelity face manipulation. In: ICCV. pp. 10033-10042 (2019)", + "51. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. pp. 8748-8763 (2021)", + "52. Raj, A., Kaza, S., Poole, B., Niemeyer, M., Ruiz, N., Mildenhall, B., Zada, S., Aberman, K., Rubinstein, M., Barron, J., et al.: Dreambooth3d: Subject-driven text-to-3d generation. arXiv preprint arXiv:2303.13508 (2023)", + "53. Ranftl, R., Bochkovskiy, A., Koltun, V.: Vision transformers for dense prediction. In: ICCV. pp. 12179-12188 (2021)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "54. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE TPAMI 44(3), 1623-1637 (2020)", + "55. Reda, F., Kontkanen, J., Tabellion, E., Sun, D., Pantofaru, C., Curless, B.: Film: Frame interpolation for large motion. In: ECCV. pp. 250-266. Springer (2022)", + "56. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022)", + "57. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241 (2015)", + "58. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: CVPR. pp. 10219-10228 (2023)", + "59. Saxena, S., Kar, A., Norouzi, M., Fleet, D.J.: Monocular depth estimation using diffusion models. arXiv preprint arXiv:2302.14816 (2023)", + "60. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)", + "61. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: Ntu $\\mathrm{rgb + }$ d: A large scale dataset for 3d human activity analysis. In: CVPR. pp. 1010-1019 (2016)", + "62. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: Animating arbitrary objects via deep motion transfer. In: CVPR (2019)", + "63. Siarohin, A., Woodford, O.J., Ren, J., Chai, M., Tulyakov, S.: Motion representations for articulated animation. In: CVPR (2021)", + "64. Stan, G.B.M., Wofk, D., Fox, S., Redden, A., Saxton, W., Yu, J., Aflalo, E., Tseng, S.Y., Nonato, F., Muller, M., et al.: Ldm3d: Latent diffusion model for 3d. arXiv preprint arXiv:2305.10853 (2023)", + "65. Tang, H., Wang, W., Xu, D., Yan, Y., Sebe, N.: Gestureegan for hand gesture-to-gesture translation in the wild. In: ACM MM. pp. 774-782 (2018)", + "66. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. In: CVPR. pp. 1921-1930 (2023)", + "67. Unterthiner, T., Van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018)", + "68. Wang, T., Li, L., Lin, K., Zhai, Y., Lin, C.C., Yang, Z., Zhang, H., Liu, Z., Wang, L.: Disco: Disentangled control for referring human dance generation in real world. In: CVPR (2024)", + "69. Watson, D., Chan, W., Martin-Brualla, R., Ho, J., Tagliasacchi, A., Norouzi, M.: Novel view synthesis with diffusion models. arXiv preprint arXiv:2210.04628 (2022)", + "70. Wiles, O., Koepke, A., Zisserman, A.: X2face: A network for controlling face generation using images, audio, and pose codes. In: ECCV. pp. 670-686 (2018)", + "71. Wolleb, J., Sandkuhler, R., Bieder, F., Valmaggia, P., Cattin, P.C.: Diffusion models for implicit image segmentation ensembles. In: International Conference on Medical Imaging with Deep Learning. pp. 1336-1348. PMLR (2022)", + "72. Wu, J., Fang, H., Zhang, Y., Yang, Y., Xu, Y.: Medsegdiff: Medical image segmentation with diffusion probabilistic model. arXiv preprint arXiv:2211.00611 (2022)", + "73. Wynn, J., Turmukhambetov, D.: Diffusionerf: Regularizing neural radiance fields with denoising diffusion models. In: CVPR. pp. 4180-4189 (2023)", + "74. Xu, Z., Zhang, J., Liew, J.H., Yan, H., Liu, J.W., Zhang, C., Feng, J., Shou, M.Z.: Magicanimate: Temporally consistent human image animation using diffusion model. arXiv preprint arXiv:2311.16498 (2023)" + ], + "bbox": [ + 215, + 147, + 785, + 840 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Y. Zhai et al.", + "bbox": [ + 271, + 114, + 361, + 126 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "75. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth anything: Unleashing the power of large-scale unlabeled data. In: CVPR (2024)", + "76. Yang, Z., Zeng, A., Yuan, C., Li, Y.: Effective whole-body pose estimation with two-stages distillation. In: ICCV. pp. 4210-4220 (2023)", + "77. Zakharov, E., Shysheya, A., Burkov, E., Lempitsky, V.: Few-shot adversarial learning of realistic neural talking head models. In: ICCV. pp. 9459-9468 (2019)", + "78. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV. pp. 3836-3847 (2023)", + "79. Zhao, J., Zhang, H.: Thin-plate spline motion model for image animation. In: CVPR (2022)", + "80. Zhao, S., Fu, H., Gong, M., Tao, D.: Geometry-aware symmetric domain adaptation for monocular depth estimation. In: CVPR. pp. 9788-9798 (2019)", + "81. Zheng, C., Cham, T.J., Cai, J.: T2net: Synthetic-to-realistic translation for solving single-image depth estimation tasks. In: ECCV. pp. 767-783 (2018)" + ], + "bbox": [ + 212, + 146, + 787, + 340 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "IDOL for Human-Centric Joint Video-Depth Generation", + "bbox": [ + 354, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_model.json b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_model.json new file mode 100644 index 0000000000000000000000000000000000000000..4d7eace087ac92d9a581519d05a8427fe0ea5825 --- /dev/null +++ b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_model.json @@ -0,0 +1,2856 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.232, + 0.141, + 0.773, + 0.187 + ], + "angle": 0, + "content": "IDOL: Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.212, + 0.781, + 0.26 + ], + "angle": 0, + "content": "Yuanhao Zhai\\*1, Kevin Lin\\*2, Linjie Li\\*2, Chung-Ching Lin\\*2, Jianfeng Wang\\*2, Zhengyuan Yang\\*2, David Doermann\\*1, Junsong Yuan\\*1, Zicheng Liu\\*3, and Lijuan Wang\\*2" + }, + { + "type": "text", + "bbox": [ + 0.36, + 0.269, + 0.643, + 0.283 + ], + "angle": 0, + "content": "1 State University of New York at Buffalo" + }, + { + "type": "text", + "bbox": [ + 0.462, + 0.284, + 0.541, + 0.296 + ], + "angle": 0, + "content": "2 Microsoft" + }, + { + "type": "text", + "bbox": [ + 0.411, + 0.297, + 0.591, + 0.311 + ], + "angle": 0, + "content": "3 Advanced Micro Devices" + }, + { + "type": "text", + "bbox": [ + 0.385, + 0.313, + 0.619, + 0.326 + ], + "angle": 0, + "content": "https://yhzhai.github.io/idol/" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.363, + 0.744, + 0.655 + ], + "angle": 0, + "content": "Abstract. Significant advances have been made in human-centric video generation, yet the joint video-depth generation problem remains under-explored. Most existing monocular depth estimation methods may not generalize well to synthesized images or videos, and multi-view-based methods have difficulty controlling the human appearance and motion. In this work, we present IDOL (unIfied Dual-mOdal Latent diffusion) for high-quality human-centric joint video-depth generation. Our IDOL consists of two novel designs. First, to enable dual-modal generation and maximize the information exchange between video and depth generation, we propose a unified dual-modal U-Net, a parameter-sharing framework for joint video and depth denoising, wherein a modality label guides the denoising target, and cross-modal attention enables the mutual information flow. Second, to ensure a precise video-depth spatial alignment, we propose a motion consistency loss that enforces consistency between the video and depth feature motion fields, leading to harmonized outputs. Additionally, a cross-attention map consistency loss is applied to align the cross-attention map of the video denoising with that of the depth denoising, further facilitating spatial alignment. Extensive experiments on the TikTok and NTU120 datasets show our superior performance, significantly surpassing existing methods in terms of video FVD and depth accuracy." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.68, + 0.377, + 0.696 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.711, + 0.788, + 0.818 + ], + "angle": 0, + "content": "The capacity to control and manipulate human-centric video content – modulating subjects' actions, altering appearance and background – has attracted continual study [29, 42, 62, 63, 68]. With the rapid evolution of generative models, from generative adversarial networks [6, 17] to recent latent diffusion models [56], the quality of the generated video has improved significantly. However, most of the existing research [29, 42, 62, 63, 68] has focused on the generation of 2D content. This imposes a natural limit on applications that require depth perception," + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.538, + 0.84 + ], + "angle": 0, + "content": "* Work done during an internship at Microsoft." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.128 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.261 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.27, + 0.788, + 0.313 + ], + "angle": 0, + "content": "Fig. 1: Given a human foreground image, an arbitrary background image, and a defined pose sequence, our IDOL generates high-fidelity video and the corresponding depth maps, which can be rendered as realistic 2.5D video." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.348, + 0.788, + 0.44 + ], + "angle": 0, + "content": "such as virtual and augmented reality, as well as advanced video games. In this paper, we explore joint video-depth generation for human actions (e.g., dancing and daily activities), where the video and the corresponding depth map are simultaneously generated. By learning a holistic representation of the human, it not only enhances the visual fidelity of the synthesized content but also paves the way for applications that demand a deeper spatial understanding." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.442, + 0.789, + 0.579 + ], + "angle": 0, + "content": "Existing methods confront several challenges in dealing with this task. First, discriminative monocular depth estimation methods [27, 54], which are typically trained on natural images, have been empirically observed to exhibit degraded performance when applied to generated images [2, 3, 80, 81]. On the other hand, while multi-view-based methods [18, 48, 52, 69, 73] can estimate depth, they primarily focus on the synthesis of individual object/scene. They often struggle with inference from single-view inputs or underperform in manipulating the object's appearance and motion. To address these problems, we propose to jointly generate the video and the corresponding depth." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.581, + 0.79, + 0.808 + ], + "angle": 0, + "content": "However, joint video-depth generation presents nontrivial challenges for two primary reasons. First, video and depth are inherently two different modalities: the former is represented as a 3-channel RGB frame sequence and the latter as a scalar depth map sequence [53,54]. Contrarily, prevailing diffusion models are pre-trained on the single-modal image generation task [56]. Thus, designing a dual-modal diffusion model for joint video-depth generation is challenging, not to mention harnessing the power of pre-trained latent diffusion models. Second, spatial layout control has been a long-standing problem in diffusion models [16,22,44,66]. Even with human pose control, maintaining an accurate spatial alignment between the generated video and depth remains a challenge. This challenge can be more pronounced if the denoising process is conducted in the latent space, given the intricate mapping from the latent space to the final output. In addressing these problems, we propose IDOL (unIfied Dual-mOdal Latent diffusion), a framework that aims to generate a human-centric video and the corresponding depth jointly." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.789, + 0.842 + ], + "angle": 0, + "content": "To tackle the problem of distinct video and depth representations, we propose to render depth maps as RGB images by applying a color map to them. This" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.313 + ], + "angle": 0, + "content": "conversion reframes the depth generation task as a stylized video generation problem. Besides, existing methods suggest that incorporating depth as input enhances structural understanding and boosts the generation quality [13]. Drawing inspiration from this, we hypothesize that a richer interplay between depth and video generation would be reciprocally beneficial. To this aim, we design a unified dual-modal U-Net that shares parameters across both video and depth denoising processes. Our model leverages a modality label to specify the denoising target, i.e., video or depth. In this way, it enables joint learning of depth and video for better generation quality while remaining parameter-efficient. Furthermore, a cross-modal attention layer is added during the joint denoising process, enabling an explicit correlation between the joint video-depth learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.788, + 0.479 + ], + "angle": 0, + "content": "To ensure a precise video-depth alignment, we propose to synchronize the motion pattern of the intermediate video and depth features. Specifically, the intermediate video and depth features within the U-Net contain semantic information, where regions with similar semantic meanings are represented with similar features [5,16,66], as shown in Fig. 3. Thus, by using the proposed motion consistency loss, we enforce a consistent motion between video and depth features, thereby promoting a precise video-depth spatial alignment. Additionally, we propose a cross-attention map consistency loss to further strengthen video-depth alignment. This is drawn inspiration from existing observations [22,49] on the influence of cross-attention maps on the spatial layout. Different from [22,49], we consider spatial alignment across video and depth modalities." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.48, + 0.568, + 0.494 + ], + "angle": 0, + "content": "In summary, our contributions are as follows." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.502, + 0.787, + 0.561 + ], + "angle": 0, + "content": "- We propose IDOL, a pioneering framework for human-centric joint video-depth generation. Our IDOL features a parameter-sharing unified dual-modal U-Net for video-depth denoising. Besides, cross-modal attention modules are used to enable the mutual information flow." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.563, + 0.787, + 0.592 + ], + "angle": 0, + "content": "- We propose a motion consistency loss and a cross-attention map consistency loss to allow fine-grained video-depth spatial alignment." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.592, + 0.788, + 0.682 + ], + "angle": 0, + "content": "- We conduct extensive experiments on two distinct datasets: TikTok and NTU120, whose depth maps were obtained using different methods [27,53,54]. The results not only show a significant improvement in video quality and depth accuracy over state-of-the-art methods, but also highlight the flexibility of our method in adapting to different depth maps. Furthermore, our experiments reveal that our IDOL can be easily adapted to different diffusion models." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.502, + 0.788, + 0.682 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.704, + 0.388, + 0.72 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Controllable diffusion models. Evolving from early diffusion models [12, 24], recent latent diffusion models (LDM) [56] achieves high-quality image generation by conducting the denoising process in the latent space. ControlNet [78], GLIGEN [33] and T2I-Adapter [45] add trainable modules on pre-trained diffusion models, and achieve fine-grained control given additional inputs, such as sketch and depth. HumanSD [29] directly concatenates the pose feature and the noise in the input to avoid potential feature discrepancy problems. In the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.363, + 0.128 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "video generation domain, controllable video diffusion models [11,26,42] leverage the depth/flow/edge sequence to generate a temporally consistent video. Our work builds upon these controllable models, utilizing plug-in modules to facilitate human pose control in IDOL. Our experiments demonstrate our adaptability across various frameworks (e.g., ControlNet [78] and T2I-Adapter [45])." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.227, + 0.79, + 0.515 + ], + "angle": 0, + "content": "Image animation. Image animation involves producing a video wherein an object from the source image moves in congruence with the motion in a target video. Traditional methods require specific knowledge about the target object, such as facial landmarks [21, 50, 77], gestures [65], or semantic segmentation maps [47]. Several methods learn a motion field [62, 70] from the driving videos. First order motion model (FOMM) [62] improves the animation quality by learning a local affine transformation. Motion representation for articulated animation (MRAA) [63] achieves better quality in representing articulated motions, such as the human body. Thin-plate spline (TPS) [79] estimates a more accurate motion, and improves previous methods over large-scale motions. Besides, there exists a line of methods [43, 55] exploiting end-to-end learning frameworks. Based on diffusion models, DreamPose [30] proposes an adapter module, such as to control the appearance of the generated human. DisCo [68] disentangles the human attribute and pose condition learning by employing a two-stage training scheme. Several concurrent works improve DisCo [68] using more advanced appearance and motion control [8, 25, 74]. Furthermore, several methods [31, 42] inject motion/pose prior to pre-trained text-to-image models. Distinctively, our IDOL focuses on the joint video-depth generation, and utilizes depth generation to enhance the overall quality of the animated video, instead of video-only generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.519, + 0.79, + 0.746 + ], + "angle": 0, + "content": "Multi-modality synthesis. There exists a line of diffusion models for view synthesis, such as diffusion models using multi-view images [18, 69, 73], point cloud [46], and text-to-3D models [48, 52]. There are also methods developed for human body mesh estimation [34, 39-41]. However, they may struggle with human-centric joint video-depth synthesis, as they typically require multi-view input or lack the ability to precisely control the appearance and motion of the target object/scene. Except for the use of multi-view images, LDM3D [64] modifies the autoencoder in LDM, such that the latent can be decoded into an RGB image and a depth map. MM-Diffusion [58] focuses on the audio-video generation, and features a coupled U-Net structure to simultaneously denoise video and audio latents. Concurrently, HyperHuman [38] proposes structural expert branches to denoise latents of different modalities, such as RGB image, depth and surface normal. To the best of our knowledge, there is no existing method directly working on the joint video-depth generation task, and thus, we modify the backbones of existing multi-modal generation methods for comparison." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.79, + 0.842 + ], + "angle": 0, + "content": "Diffusion models for dense prediction. Diffusion models have been used in various dense prediction tasks, such as segmentation tasks [1, 5, 10, 28, 71, 72], depth estimation [28, 59] and object detection [9]. For depth estimation methods [28, 59], they typically necessitate modifying the output from 3-channel RGB images to scalar depth maps. Such a transformation impedes their ability to harness the power of large-scale pre-trained diffusion models [56]. Concurrently," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.143, + 0.517, + 0.282 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.524, + 0.148, + 0.787, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.293, + 0.788, + 0.39 + ], + "angle": 0, + "content": "Fig. 2: Left: Overall model architecture. Our IDOL features a unified dual-modal U-Net (gray boxes), a parameter-sharing design for joint video-depth denoising, wherein the denoising target is controlled by a one-hot modality label (\\( y_{\\mathrm{v}} \\) for video and \\( y_{\\mathrm{d}} \\) for depth). Right: Individual U-Net block structure. Cross-modal attention is added to enable mutual information flow between video and depth features, with consistency loss terms \\( \\mathcal{L}_{\\mathrm{mo}} \\) and \\( \\mathcal{L}_{\\mathrm{xattn}} \\) ensuring the video-depth alignment. Skip connections are omitted for conciseness." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.421, + 0.787, + 0.512 + ], + "angle": 0, + "content": "Depth Anything [75] address this problem by leveraging large-scale unlabeled data to improve the estimation quality. Additionally, when applied to synthesized content, existing depth estimation methods tend to underperform [2,3,80,81], failing to generate high-quality depth maps from outputs of image animation methods. To mitigate this problem, we propose IDOL to directly synthesize the video and the corresponding depth, significantly improving the depth accuracy." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.513, + 0.787, + 0.603 + ], + "angle": 0, + "content": "In contrast to existing methods, we reframe the depth synthesis task as a stylized image synthesis task. By rendering target depths as RGB images, we are positioned to directly use pre-trained image generation models with minimal modifications. Furthermore, we propose a unified dual-modal U-Net for improved joint video-depth generation, and enhance video-depth spatial alignment via the proposed consistency losses." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.627, + 0.33, + 0.643 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.787, + 0.779 + ], + "angle": 0, + "content": "Problem formulation. We begin by formally defining the task of human-centric joint video-depth generation. Given a human foreground image \\( f \\), a background image \\( b \\), and a pose sequence \\( p = \\{p_1, p_2, \\dots, p_L\\} \\) of length \\( L \\), our objective is to generate a video \\( v = \\{v_1, v_2, \\dots, v_L\\} \\) and the associated depth map sequence \\( d = \\{d_1, d_2, \\dots, d_L\\} \\). The video \\( v \\) should faithfully animate the human foreground \\( f \\) into the target pose \\( p \\) while integrating it with the background \\( b \\). The depth map sequence \\( d \\) should correctly represent the depth within the video \\( v \\). An illustration is shown in Fig. 1." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.78, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Preliminaries. Latent diffusion models (LDM) [56] recently show great success in image generation. It operates in the latent space of a pre-trained autoencoder \\(\\mathcal{D}(\\mathcal{E}(\\cdot))\\), where a time-conditioned U-Net [57] \\(\\epsilon_{\\theta}(\\cdot)\\) with learnable parameter \\(\\theta\\) is used for denoising the latent feature. Within the U-Net, the conditional signal" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.128 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "\\(c\\) (e.g., textual prompt) is fed in the cross-attention module after CLIP [51] encoding. During training, the objective is the mean square error (MSE) between the predicted and ground truth noise:" + }, + { + "type": "equation", + "bbox": [ + 0.393, + 0.205, + 0.786, + 0.222 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathbb {E} _ {v, \\epsilon , t, c} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, c) \\| _ {2} ^ {2} \\right], \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.232, + 0.789, + 0.34 + ], + "angle": 0, + "content": "where \\(\\epsilon \\in \\mathcal{N}(0,I)\\) is the ground truth noise, and \\(z_{t}\\) is the noisy latent at the \\(t\\)-th reverse step, and can be obtained from \\(\\mathcal{E}(v)\\) and \\(\\epsilon\\) [24]. To enable spatial layout control, ControlNet [78] adds a copy of the U-Net down and middle blocks upon the LDM. The output of ControlNet is added to the original U-Net via skip connections. By manipulating the intermediate features, ControlNet trained with additional conditional input (poses in our case) can control the output image/video [68]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.362, + 0.479, + 0.375 + ], + "angle": 0, + "content": "3.1 Unified dual-modal U-Net" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.387, + 0.789, + 0.508 + ], + "angle": 0, + "content": "Video and depth are different modalities and typically have distinct representations. Designing a model architecture that can jointly generate both video and depth, and potentially leverage pre-trained diffusion models, presents a significant challenge. In addressing this problem, we propose to reformulate depth synthesis as a stylized image generation task. By rendering the depth map as a heatmap, we bridge the gap between the video and depth modalities. To further harness this approach, we introduce a unified dual-modal U-Net, specially tailored for the joint video-depth denoising." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.789, + 0.674 + ], + "angle": 0, + "content": "Video LDM baseline. We build our model upon 3D U-Net [13], which modifies the 2D U-Net [56] by adding a temporal convolutional layer in the ResBlock, and adding a temporal attention layer after the spatial attention within each block. For the human appearance and pose control, we follow DisCo [68] to feed the CLIP foreground latent \\(\\mathrm{CLIP}(f)\\) via cross-attention, and feed the pose latent \\(\\mathcal{E}(p)\\) via a ControlNet to the U-Net. We show in Sec. 4.1 that our method can be implemented on different pose control modules, such as T2I-Adapter [45]. For the background control, different from DisCo that leverages a ControlNet, we find that adding the background latent \\(\\mathcal{E}(b)\\) to the input noise of the U-Net not only yields comparable results but also reduces the number of parameters. The proposed model architecture is illustrated in Fig. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Sharing U-Net for joint video-depth denoising. Existing methods [13] have shown that incorporating depth map as conditional input enhances the model's video structure awareness, improving the video generation quality. Building on this insight, we hypothesize that maximizing the information exchange between video and depth during generation can benefit the generation quality for both modalities. Thus, we propose a unified dual-modal U-Net for video and depth denoising, where the architecture and parameters of the U-Net and ControlNet are shared between the two modalities. To indicate the denoising modality, we add a learnable modality embedding to the time step embedding, which is fed to all blocks within the U-Net and the ControlNet, as shown in Fig. 2 right. In this way, given a one-hot modality label, the corresponding modality embedding will" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "be selected to feed into the model and further control the output modality. Apart from being parameter-efficient, we find that this unified architecture improves both video and depth generation quality (Sec. 4.2)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.193, + 0.788, + 0.313 + ], + "angle": 0, + "content": "Cross-modal attention. Though the unified dual-modal U-Net enables implicit structural information learning, direct information communication during the video and depth denoising process is needed for better alignment. Thus, we add a multi-modality attention at the end of each block (Fig. 2 right). During the joint video-depth denoising process, the video and depth features are concatenated to conduct spatial self-attention. Note that self-attention is only performed in the spatial dimension, as it aims to promote spatial alignment between video and depth, and the preceding temporal layers already ensure the temporal smoothness." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.314, + 0.621, + 0.329 + ], + "angle": 0, + "content": "The joint video-depth denoising objective \\(\\mathcal{L}_{\\mathrm{denoise}}\\) is:" + }, + { + "type": "equation", + "bbox": [ + 0.308, + 0.34, + 0.785, + 0.379 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} _ {\\mathrm {d e n o i s e}} = \\mathbb {E} _ {v, d, \\epsilon_ {\\mathrm {v}}, \\epsilon_ {\\mathrm {d}}, t, f, b, p} \\big [ \\| \\epsilon_ {\\mathrm {v}} - \\epsilon_ {\\theta} (z _ {\\mathrm {v}, t}, t, f, b, p; y _ {\\mathrm {v}}) \\| _ {2} ^ {2} + \\\\ \\begin{array}{l} \\left\\| c _ {V} - c _ {\\theta} \\left(z _ {V, t}, v, f, b, p, y _ {V}\\right) \\right\\| _ {2} ^ {2} + \\\\ \\left\\| \\epsilon_ {d} - \\epsilon_ {\\theta} \\left(z _ {d, t}, t, f, b, p; y _ {d}\\right) \\right\\| _ {2} ^ {2} ], \\end{array} \\tag {2} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.389, + 0.788, + 0.464 + ], + "angle": 0, + "content": "where \\(y_{\\mathrm{v}}\\) and \\(y_{\\mathrm{d}}\\) are the modality labels for video and depth, respectively, \\(\\epsilon_{\\mathrm{v}}, \\epsilon_{\\mathrm{d}} \\in \\mathcal{N}(0, I)\\) are independently sampled Gaussian noises, and \\(f, b, p\\) denote the human foreground image, the background image, and the target pose sequence, respectively. In Eq. (2), the first term is the video denoising loss and the second term is the depth denoising loss." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.488, + 0.536, + 0.504 + ], + "angle": 0, + "content": "3.2 Learning video-depth consistency" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.514, + 0.788, + 0.605 + ], + "angle": 0, + "content": "Though the pose control ensures the coarse correspondence between the video and depth, we empirically find that only applying the joint denoising objective \\(\\mathcal{L}_{\\mathrm{denoise}}\\) may still lead to misalignment between the generated video and depth, especially when the training data is limited, as shown in the first column of Fig. 3. To promote a precise video-depth alignment, we propose a motion consistency loss \\(\\mathcal{L}_{\\mathrm{mo}}\\) and a cross-attention map consistency loss \\(\\mathcal{L}_{\\mathrm{xattn}}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.606, + 0.788, + 0.726 + ], + "angle": 0, + "content": "Motion consistency loss. In image diffusion models, the intermediate self-attention features in the U-Net are found to contain semantic information [5,16,66]. We found this finding also holds in our video-depth diffusion model. However, though video and depth features share similar layouts, they may differ in the temporal motion, as illustrated in Fig. 3. Thus, we attribute the video-depth misalignment to the unsynchronized motion between video and depth features. To address this problem, we propose to enforce a synchronized motion between the video and depth features via a motion consistency loss \\(\\mathcal{L}_{\\mathrm{mo}}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.727, + 0.788, + 0.785 + ], + "angle": 0, + "content": "Specifically, given intermediate video self-attention feature maps at frame \\(l\\) and \\(l + 1\\): \\(F_{\\mathrm{v},l}, F_{\\mathrm{v},l + 1} \\in \\mathbb{R}^{H \\times W \\times D}\\), their cost volume \\(C_{\\mathrm{v},l} \\in \\mathbb{R}^{H \\times W \\times H \\times W}\\) can be constructed by conducting cosine similarity between all point pairs on the two frames:" + }, + { + "type": "equation", + "bbox": [ + 0.399, + 0.788, + 0.785, + 0.804 + ], + "angle": 0, + "content": "\\[\nc _ {\\mathrm {v}, l, i, j, h, k} = f _ {\\mathrm {v}, l, i, j} \\cdot f _ {\\mathrm {v}, l + 1, h, k}, \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.841 + ], + "angle": 0, + "content": "where \\( f_{\\mathrm{v},l,i,j} \\) is the normalized feature vector on \\( F_{\\mathrm{v},l} \\) at spatial location \\( i,j \\). The cost volume \\( C_{\\mathrm{d},r} \\) for the depth feature maps can be computed in a similar way." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.142, + 0.788, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.304, + 0.506, + 0.456 + ], + "angle": 0, + "content": "Fig. 3: Visualization of the video and depth feature maps and their motion fields without consistency losses. We attribute the inconsistent video-depth output (blue circle) to the inconsistent video-depth feature motions (the last row). This problem exists in multiples layers within the U-Net, and we randomly select two layers for visualization. We follow [66] to visualize the feature maps, and different color in the motion file indicates different moving direction." + }, + { + "type": "image_caption", + "bbox": [ + 0.512, + 0.345, + 0.789, + 0.443 + ], + "angle": 0, + "content": "Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem." + }, + { + "type": "image_caption", + "bbox": [ + 0.512, + 0.345, + 0.789, + 0.443 + ], + "angle": 0, + "content": "Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.485, + 0.785, + 0.517 + ], + "angle": 0, + "content": "As the video and depth features may be distributed differently, we further normalize the cost volume via softmax, resulting in a motion field \\( U_{\\mathrm{v},l} \\):" + }, + { + "type": "equation", + "bbox": [ + 0.353, + 0.526, + 0.785, + 0.561 + ], + "angle": 0, + "content": "\\[\nu _ {\\mathrm {v}, l, i, j, h, k} = \\frac {\\exp \\left(c _ {\\mathrm {v} , l , i , j , h , k} / \\tau\\right)}{\\sum_ {h ^ {\\prime}} \\sum_ {k ^ {\\prime}} \\exp \\left(c _ {\\mathrm {v} , l , i , j , h ^ {\\prime} , k ^ {\\prime}} / \\tau\\right)}, \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.568, + 0.788, + 0.629 + ], + "angle": 0, + "content": "where \\(\\tau\\) is a temperature hyper-parameter controlling the concentration of the distribution. A high value on the motion field indicates a movement between two points. The motion consistency is achieved by minimizing the MSE loss between the video and depth motion fields:" + }, + { + "type": "equation", + "bbox": [ + 0.318, + 0.637, + 0.785, + 0.673 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {m o}} = \\frac {1}{L H W H W} \\sum_ {l, i, j, h, k} \\| u _ {\\mathrm {v}, l, i, j, h, k} - u _ {\\mathrm {d}, l, i, j, h, k} \\| _ {2} ^ {2}. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.683, + 0.785, + 0.712 + ], + "angle": 0, + "content": "By enforcing similar motion of video and depth features, it promotes a consistent video and depth output." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.713, + 0.785, + 0.789 + ], + "angle": 0, + "content": "Cross-attention map consistency loss. Except for leveraging the self-attention feature, the cross-attention maps between the foreground image and the input noise are also found to be critical in the image layout control [22,49]. Thus, we additionally enforce the cross-attention maps from the video stream and the depth stream to be similar via an MSE loss \\(\\mathcal{L}_{\\mathrm{xattn}}\\):" + }, + { + "type": "equation", + "bbox": [ + 0.418, + 0.798, + 0.785, + 0.816 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {x a t t n}} = \\left\\| M _ {\\mathrm {v}} - M _ {\\mathrm {d}} \\right\\| _ {2} ^ {2}, \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.825, + 0.787, + 0.842 + ], + "angle": 0, + "content": "where \\(M_{\\mathrm{v}}\\) and \\(M_{\\mathrm{d}}\\) represent the video and depth cross-attention map, respectively." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.355, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "As the ControlNet fuses features in the U-Net up blocks, we apply the consistency loss terms only to the U-Net up blocks to efficiently learn the U-Net and the ControlNet. The overall training objective \\(\\mathcal{L}\\) is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.331, + 0.205, + 0.786, + 0.245 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {\\text {d e n o i s e}} + \\sum_ {n = 1} ^ {N} \\left(w _ {\\mathrm {m o}} \\mathcal {L} _ {\\mathrm {m o}, n} + w _ {\\mathrm {x a t t n}} \\mathcal {L} _ {\\mathrm {x a t t n}, n}\\right), \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.256, + 0.788, + 0.302 + ], + "angle": 0, + "content": "where \\( w_{\\mathrm{mo}} \\) and \\( w_{\\mathrm{xattn}} \\) are weighting hyper-parameters, \\( N \\) is the number of up blocks, and \\( \\mathcal{L}_{\\mathrm{mo},n} \\) and \\( \\mathcal{L}_{\\mathrm{xattn},n} \\) are the motion consistency loss and the cross-attention map consistency loss on the \\( n \\)-th up block, respectively." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.324, + 0.607, + 0.34 + ], + "angle": 0, + "content": "3.3 Human attribute outpainting pre-training" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.35, + 0.785, + 0.44 + ], + "angle": 0, + "content": "To disentangle the pose and background control, DisCo [68] proposes a human attribute pre-training (HAP) task to learn human appearance. Specifically, HAP learns to reconstruct the whole image given human foreground and background images, with the pose ControlNet being removed, as shown in Fig. 4 top. However, we empirically find that such pre-training may lead to an apparent background mask when the target pose deviates from the original position." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.442, + 0.788, + 0.562 + ], + "angle": 0, + "content": "To address this problem, we propose human attribute outpainting pre-training (HAOP). Our HAOP differs from HAP in two ways. First, HAOP extends the background mask through dilation, forcing the model to fill in the background around the foreground. Second, we apply a random crop and resize on the foreground image, prompting the model to extrapolate the partial human attributes. This process not only mitigates the background masking problem but also improves image synthesis, as demonstrated in Fig. 4 and validated in our ablation studies (Sec. 4.2). Formally, the pre-training learning objective is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.324, + 0.574, + 0.785, + 0.592 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {H A O P}} = \\mathbb {E} _ {v, \\epsilon , t, f _ {\\mathrm {a u g}}, b _ {\\mathrm {a u g}}} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} \\left(z _ {t}, t, f _ {\\mathrm {a u g}}, b _ {\\mathrm {a u g}}\\right) \\| _ {2} ^ {2} \\right], \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.602, + 0.788, + 0.647 + ], + "angle": 0, + "content": "where \\( f_{\\mathrm{aug}} \\) and \\( b_{\\mathrm{aug}} \\) represent augmented foreground and background, respectively. Note that the pre-training does not require depth denoising, which significantly lowers the data demand." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.672, + 0.377, + 0.69 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Datasets. We train and evaluate on two public datasets: TikTok [27] and NTU120 [36,61]. The TikTok dataset consists of \\(\\sim 350\\) human dancing videos. We follow DisCo [68] to use 335 videos for training, and use 10 videos for evaluation. The NTU120 dataset consists of daily activities videos, we select 588 videos for training and 72 videos for evaluation. The videos are cropped to center to the subject. We specifically ensure distinct subjects and backgrounds between training and evaluation, and select only certain subjects to better evaluate the generalization ability. Besides, we use Grounded-SAM [32,37] for the human foreground mask estimation, and follow ControlNet [78] to use OpenPose [7]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.127 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.144, + 0.787, + 0.272 + ], + "angle": 0, + "content": "
MethodMotion controlTikTokNTU120
VideoDepthImageVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓FID-FVD↓FVD↓L2↓FID↓
FOMM [62]38.36404.31-85.0340.341439.50-80.29
MRAA [63]Target video24.11306.49-54.4758.191441.79-97.07
TPS [79]29.20337.79-53.7837.421339.86-61.75
DreamPose [30]DensePose [19]52.62614.07-75.0880.11791.25-116.23
DisCo [68]20.75257.900.0975†39.0226.21458.920.0371†68.53
LDM3D [64]OpenPose [7]45.30553.030.063769.3671.11587.840.0650120.74
MM-Diffusion [58]48.92771.320.036768.4758.44504.050.0404102.77
IDOLOpenPose [7]17.86223.690.033636.0420.23314.820.031750.70
" + }, + { + "type": "table_footnote", + "bbox": [ + 0.214, + 0.274, + 0.788, + 0.342 + ], + "angle": 0, + "content": "Table 1: Quantitative results comparison between our IDOL and existing methods on the TikTok and NTU120 datasets. The ground truth depth is estimated via HDNet [27]. \" \\( \\ddagger \\) \" indicates incapable of generating depth map, \" \\( \\ddagger \\) \" indicates the HDNet-inferred depth from the synthesized image. The best and the second best results are denoted in bold and underscored, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.392, + 0.788, + 0.514 + ], + "angle": 0, + "content": "for human pose estimation. For the depth estimation, we leverage two different methods: HDNet [27] for high-fidelity depth estimation on the human foreground, where the background depth is set to a constant; MiDaS [53, 54] for the whole-frame depth estimation, which lacks details on the human foreground. The HDNet depth map is rendered by applying the \"hot\" colormap; the MiDaS depth map is rendered as grayscale images. For pre-training, we follow DisCo [68] to use \\(\\sim 700\\mathrm{k}\\) images from a combined dataset of TikTok [27], COCO [35], SHHQ [14], DeepFashion2 [15], and LAION [60]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.516, + 0.788, + 0.622 + ], + "angle": 0, + "content": "Evaluation metrics. We separately evaluate the quality of the generated video and depth. For video quality evaluation, we follow DisCo [68] to use FID-FVD [4] and FVD [67] over every 8-frame snippet. For the evaluation of depth synthesis, for simplicity, we first scale the depth in the range \\([0,1]\\), and compute L2 distance between the ground truth depth4 and the generated depth. In addition to evaluating the generated video and depth, we further use FID [23] on the frames to measure the image quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.625, + 0.788, + 0.762 + ], + "angle": 0, + "content": "Comparison methods. We adopt state-of-the-art image animation methods FOMM [62], MRAA [63], TPS [79], DreamPose [30], and DisCo [68] for the video and image quality comparison. As a pioneering method in human-centric joint video-depth generation, to our knowledge, there is no direct prior work for the joint video-depth generation quality comparison. Thus, we adapt the most relevant multi-modal generation methods (LDM3D [64] for text to image-depth and MM-Diffusion [58] for text to video-audio), modify their backbones to the same VideoLDM baseline as ours (Sec. 3.1) to enable appearance and pose control, and compare the joint video-depth generation results with them." + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.784, + 0.788, + 0.84 + ], + "angle": 0, + "content": "4 The depth evaluation is conducted on the synthesized depth and the depth estimated from the ground truth image instead of that estimated from the generated images. This is because we empirically find that the depth estimated from the generated image tends to be noisy (see Fig. 5 and Fig. 6)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.787, + 0.384 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.392, + 0.788, + 0.462 + ], + "angle": 0, + "content": "Fig. 5: Qualitative results comparison between TPS [79], DisCo [68], LDM3D [64], MM-Diffusion [58] and our IDOL on the TikTok and NTU120 datasets with HDNet estimated depth [27]. Note that TPS [79] is unable to generate depth, and the depth map for DisCo is estimated via HDNet on its generated frames. Please find video comparison in the supplementary material." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.494, + 0.367, + 0.508 + ], + "angle": 0, + "content": "4.1 Main results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.787, + 0.568 + ], + "angle": 0, + "content": "In our experiments, we use the HDNet depth [27] by default for its high-fidelity human foreground depth estimation. We also train and evaluate on the MiDaS depth [53, 54] to demonstrate the generalization ability of our IDOL." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.789, + 0.794 + ], + "angle": 0, + "content": "Comparison with the state-of-the-art. We compare IDOL with state-of-the-art methods on the TikTok and NTU120 datasets in Tab. 1, with the generated frame and depth visualized in Fig. 5. We make the following observations. (1) We outperform all competing motion transfer and video generation methods [30, 62, 63, 68, 79] in terms of both video and image quality. (2) When adapting multi-modal generation methods [58, 64] for human-centric joint video-depth generation, with the integration of the video LDM baseline (Sec. 3.1), IDOL consistently outperforms them across video, image, and depth metrics on both datasets, demonstrating the effectiveness of our method. (3) Applying HDNet depth estimation to the previous state-of-the-art DisCo generated frames leads to suboptimal results, with incomplete, fragmentary or overly simplistic estimations, as shown in Fig. 5. As the estimation result deviates from the ground truth, the HDNet results lead to a high depth L2, as listed in the DisCo row of Tab. 1. This finding indicates the limited generalization ability of monocular depth methods, and highlights the need for multi-modal generation approaches." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Comparison on synthesizing different types of depth map. Tab. 2 compares the results on using the MiDaS grayscale depth map [53, 54] for the joint video-depth generation. The results consistently show that our IDOL outperforms" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.127 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.147, + 0.492, + 0.252 + ], + "angle": 0, + "content": "
MethodVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
TikTokDisCo [68]20.75257.900.1758‡39.02
LDM3D [64]42.09529.430.064672.30
MM-Diffusion [58]52.37715.280.104070.09
IDOL19.01216.960.027139.76
NTU120DisCo [68]26.21458.920.0695‡68.53
LDM3D [64]77.04591.030.0244115.16
MM-Diffusion [58]73.47503.530.0260117.22
IDOL20.56439.630.021055.70
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.265, + 0.493, + 0.348 + ], + "angle": 0, + "content": "Table 2: Quantitative comparison between our method and existing methods on the TikTok and NTU120 datasets with MiDaS estimated depth [53,54]. \"‡\" indicates the MiDaS estimated depth from the synthesized image." + }, + { + "type": "image", + "bbox": [ + 0.501, + 0.159, + 0.591, + 0.198 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.501, + 0.228, + 0.591, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.506, + 0.284, + 0.588, + 0.298 + ], + "angle": 0, + "content": "Reference image Target pose" + }, + { + "type": "image", + "bbox": [ + 0.597, + 0.144, + 0.787, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.498, + 0.309, + 0.785, + 0.352 + ], + "angle": 0, + "content": "Fig. 6: Qualitative results comparison on MiDaS [53,54] grayscale whole-frame depth map generation." + }, + { + "type": "table", + "bbox": [ + 0.26, + 0.366, + 0.74, + 0.44 + ], + "angle": 0, + "content": "
Motion repr.Temporal modelingPose controlVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
OpenPose [7]HandcraftedControlNet [78]17.86223.690.033636.04
OpenPose [7]AnimateDiff [20]ControlNet [78]19.58201.830.035033.14
DWPose [76]AnimateDiff [20]ControlNet [78]16.73179.200.024531.06
DWPose [76]AnimateDiff [20]T2I-Adapter [45]14.40188.160.019530.06
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.44, + 0.788, + 0.495 + ], + "angle": 0, + "content": "Table 3: Quantitative result of our IDOL generalize to different motion representations, temporal modeling designs, and pose control module on TikTok [27] with HDNet depth [27]. The gray row indicates our default setting. Please find our supplementary material for additional implementation details." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.788, + 0.629 + ], + "angle": 0, + "content": "existing multi-modal generation methods [58,64] in both video and depth quality. This further highlights IDOL's effectiveness and its adaptability to different types of depth maps. Additionally, as shown in the DisCo row of Fig. 6, applying MiDaS on the DisCo generated frames also yields suboptimal results, blurring the areas surrounding the human subject, and leads to poorer depth accuracy (measured by L2 norm) than that achieved by generative approaches." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Generalization ability. Our IDOL follows DisCo [68] for setting the default motion representations (OpenPose [7]) and backbone architectures (ControlNet [78]). In Tab. 3 and Fig. 7, we further show that our IDOL can be easily adapted to other motion representations, temporal modeling modules, and pose control modules. First, IDOL can benefit from the motion prior from pre-trainedAnimateDiff [20] to improve the video quality. Besides, our IDOL can be conditioned to more fine-grained DWPose [76], which provides additional facial and hand keypoints, to improve the video and depth quality. Impressively, even when using OpenPose, which lacks hand keypoint as condition, IDOL effectively generates plausible human hands, demonstrating its robust human attribute learning capabilities. Furthermore, our IDOL can be implemented with different pose control modules, such as ControlNet [78] and T2I-Adapter [45], achieving similar quantitative and qualitative results. Such results demonstrate that our IDOL can be generalized to different design options." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.143, + 0.327, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.226, + 0.327, + 0.314 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.218, + 0.316, + 0.327, + 0.343 + ], + "angle": 0, + "content": "Reference image & Target motion representation" + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.143, + 0.499, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.226, + 0.499, + 0.268 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.268, + 0.498, + 0.31 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.345, + 0.318, + 0.388, + 0.343 + ], + "angle": 0, + "content": "OpenPose ControlNet (default)" + }, + { + "type": "image_caption", + "bbox": [ + 0.397, + 0.319, + 0.494, + 0.343 + ], + "angle": 0, + "content": "DWPose DWPose ControlNet T2I-Adapter" + }, + { + "type": "image", + "bbox": [ + 0.507, + 0.171, + 0.61, + 0.214 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.507, + 0.25, + 0.61, + 0.293 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.514, + 0.317, + 0.606, + 0.334 + ], + "angle": 0, + "content": "Reference image Target pose" + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.151, + 0.787, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.275, + 0.78, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.353, + 0.5, + 0.395 + ], + "angle": 0, + "content": "Fig. 7: Qualitative results of our IDOL generalize to different motion representations and pose control modules." + }, + { + "type": "image_caption", + "bbox": [ + 0.504, + 0.346, + 0.789, + 0.388 + ], + "angle": 0, + "content": "Fig. 8: Qualitative comparison between the baseline video LDM, unified dual-modal U-Net w/o and w/ consistency losses." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.411, + 0.532, + 0.456 + ], + "angle": 0, + "content": "
Settings#Param.VideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
Sep. U-Net for joint denoise2 × 1.39B24.28282.500.082241.72
Share U-Net for joint denoise1.39B22.10272.370.036939.43
+ Cross-modal attn.1.41B19.28260.650.036039.01
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.457, + 0.532, + 0.498 + ], + "angle": 0, + "content": "Table 4: Ablation study on the joint video-depth learning and the unified dual-modal U-Net design." + }, + { + "type": "table", + "bbox": [ + 0.564, + 0.411, + 0.763, + 0.456 + ], + "angle": 0, + "content": "
\\( {\\mathcal{L}}_{\\text{xatt }} \\)\\( {\\mathcal{L}}_{\\text{mo }} \\)VideoDepthImage
FID-FVD \\( \\downarrow \\)FVD \\( \\downarrow \\)L2 \\( \\downarrow \\)FID \\( \\downarrow \\)
19.29260.650.036039.01
✓19.29244.580.035137.89
✓✓17.86223.690.033636.04
" + }, + { + "type": "table_caption", + "bbox": [ + 0.539, + 0.457, + 0.788, + 0.498 + ], + "angle": 0, + "content": "Table 5: Ablation study on the videodepth consistency loss functions \\(\\mathcal{L}_{\\mathrm{mo}}\\) and \\(\\mathcal{L}_{\\mathrm{xattn}}\\)" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.542, + 0.398, + 0.556 + ], + "angle": 0, + "content": "4.2 Ablation studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.786, + 0.628 + ], + "angle": 0, + "content": "We conduct a set of ablation studies on the TikTok dataset [27] with HDNet depth [27] to demonstrate the effectiveness of our proposed method. These studies are conducted accumulatively, layering each component to assess its incremental impact on the overall performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.787, + 0.81 + ], + "angle": 0, + "content": "Unified dual-modal U-Net for joint video-depth denoising. We analyze whether joint video-depth learning improves the performance, and the effectiveness of the designs proposed in the unified dual-modal U-Net in Tab. 4. The key observations are as follows. (1) Jointly video-depth learning with a shared U-Net is beneficial for both video and depth generation (the second row), while using only half the parameters compared to the separate counterpart. Such a result underscores the significance of our structurally-aware shared U-Net. (2) The explicit cross-modal information exchange between the video and depth denoising (the third row), i.e., through cross-modal attention, further improves both the video and depth generation quality. Moreover, as shown in Fig. 8, our unified dual-modal U-Net markedly improves frame and depth quality compared to the separate U-Net baseline. Such results confirm the effectiveness of our design." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Learning video-depth consistency. In our IDOL, we introduce a motion consistency loss \\(\\mathcal{L}_{\\mathrm{mo}}\\) and a cross-attention map consistency loss \\(\\mathcal{L}_{\\mathrm{xattn}}\\) to enhance" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.144, + 0.788, + 0.192 + ], + "angle": 0, + "content": "
Pre-training strategyVideoDepthImageMethodFLOPs (T) #Param. (B) GPU mem. (MB) Infer. time (s)
FID-FVD↓FVD↓L2↓FID↓
w/o pre-training39.24452.810.036356.80LDM3D [64]48.801.61766142.02
HAP [68]19.83227.860.033638.71MM-Diffusion [58]41.022.781465113.49
HAOP (ours)17.86223.690.033636.04IDOL (ours)39.351.411025112.23
" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.193, + 0.788, + 0.218 + ], + "angle": 0, + "content": "Table 6: Ablation study on the pre- Table 7: Computational complexity comparison training. son." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.266, + 0.787, + 0.341 + ], + "angle": 0, + "content": "video-depth alignment. We analyze their impact in Tab. 5, where the results demonstrate that both of them improve the depth generation quality, and the motion consistency loss improves all video, depth, and image generation results. The final column of Fig. 8 further illustrates how these consistency loss terms effectively refine video-depth alignment in our model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.343, + 0.787, + 0.419 + ], + "angle": 0, + "content": "Human attribute outpainting pre-training. We analyze the effectiveness of our human attribute outpainting pre-training (HAOP) in Tab. 6. The results reveal that HAOP surpasses human attribute pre-training (HAP) [68] across all metrics, confirming its efficacy. Notably, even without pre-training, our IDOL already outperforms other competing multi-modal generation methods [58,64]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.42, + 0.787, + 0.511 + ], + "angle": 0, + "content": "Complexity and computational requirements. We analyzed the complexity of generating an 8-frame video-depth sequence on a single V100 GPU, comparing our method with other multi-modal generation methods in Tab. 7. Thanks to our unified U-Net design, IDOL requires the fewest FLOPs, has the lowest number of trainable parameters, and the shortest inference time, demonstrating our efficiency." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.542, + 0.36, + 0.558 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.582, + 0.787, + 0.718 + ], + "angle": 0, + "content": "In this paper, we propose IDOL, a framework tailed for human-centric joint video-depth generation. Our proposed unified dual-modal U-Net improves the video and depth synthesis by implicit video structure learning, with cross-modal attention explicitly bridging the joint video-depth denoising process. Our motion consistency loss and cross-attention map consistency loss promote spatial alignment between the generated video and depth. Extensive experiments on the TikTok and NTU120 datasets show our superior performance compared with existing methods, and the adaption ability to different kinds of depth maps. Our IDOL is also able to generalize to different motion representations and pose control modules." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Limitations. Despite the performance advantage of our IDOL, it faces several major limitations. First, the computational demands of processing dual-modal data, particularly at high resolutions, hinder its suitability for real-time applications, highlighting a need for further optimization. Additionally, the reliance on high-quality depth maps for training limits its applicability in scenarios where such data is limited or of low quality. Addressing this, future work may explore unsupervised methods or data augmentation strategies to mitigate the data quality constraint." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.177, + 0.788, + 0.252 + ], + "angle": 0, + "content": "This work is supported in part by the Defense Advanced Research Projects Agency (DARPA) under Contract No. HR001120C0124. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the Defense Advanced Research Projects Agency (DARPA)." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.274, + 0.323, + 0.29 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.304, + 0.785, + 0.331 + ], + "angle": 0, + "content": "1. Amit, T., Shaharbany, T., Nachmani, E., Wolf, L.: Segdiff: Image segmentation with diffusion probabilistic models. arXiv preprint arXiv:2112.00390 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.333, + 0.787, + 0.374 + ], + "angle": 0, + "content": "2. Atapour-Abarghouei, A., Breckon, T.P.: Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer. In: CVPR. pp. 2800-2810 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.374, + 0.785, + 0.401 + ], + "angle": 0, + "content": "3. Bae, J., Moon, S., Im, S.: Deep digging into the generalization of self-supervised monocular depth estimation. In: AAAI. vol. 37, pp. 187-196 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.402, + 0.785, + 0.441 + ], + "angle": 0, + "content": "4. Balaji, Y., Min, M.R., Bai, B., Chellappa, R., Graf, H.P.: Conditional gan with discriminative filter generation for text-to-video synthesis. In: IJCAI. vol. 1, p. 2 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.443, + 0.785, + 0.482 + ], + "angle": 0, + "content": "5. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models. arXiv preprint arXiv:2112.03126 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.484, + 0.785, + 0.511 + ], + "angle": 0, + "content": "6. Brock, A., Donahue, J., Simonyan, K.: Large scale gan training for high fidelity natural image synthesis. arXiv preprint arXiv:1809.11096 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.512, + 0.785, + 0.538 + ], + "angle": 0, + "content": "7. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: CVPR. pp. 7291-7299 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.539, + 0.785, + 0.58 + ], + "angle": 0, + "content": "8. Chang, D., Shi, Y., Gao, Q., Fu, J., Xu, H., Song, G., Yan, Q., Yang, X., Soleymani, M.: Magicdance: Realistic human dance video generation with motions & facial expressions transfer. arXiv preprint arXiv:2311.12052 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.581, + 0.785, + 0.607 + ], + "angle": 0, + "content": "9. Chen, S., Sun, P., Song, Y., Luo, P.: Diffusiondet: Diffusion model for object detection. In: ICCV. pp. 19830-19843 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.608, + 0.785, + 0.635 + ], + "angle": 0, + "content": "10. Chen, T., Li, L., Saxena, S., Hinton, G., Fleet, D.J.: A generalist framework for panoptic segmentation of images and videos. In: ICCV. pp. 909-919 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.636, + 0.785, + 0.675 + ], + "angle": 0, + "content": "1. Chen, W., Wu, J., Xie, P., Wu, H., Li, J., Xia, X., Xiao, X., Lin, L.: Control-a-video: Controllable text-to-video generation with diffusion models. arXiv preprint arXiv:2305.13840 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.676, + 0.785, + 0.702 + ], + "angle": 0, + "content": "2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.703, + 0.785, + 0.744 + ], + "angle": 0, + "content": "3. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. In: ICCV. pp. 7346-7356 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.745, + 0.785, + 0.771 + ], + "angle": 0, + "content": "4. Fu, J., Li, S., Jiang, Y., Lin, K.Y., Qian, C., Loy, C.C., Wu, W., Liu, Z.: Stylegan-human: A data-centric odyssey of human generation. In: ECCV. pp. 1-19 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "5. Ge, Y., Zhang, R., Wang, X., Tang, X., Luo, P.: Deepfashion2: A versatile benchmark for detection, pose estimation, segmentation and re-identification of clothing images In: CVPR. pp. 5337-5345 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "6. Geyer, M., Bar-Tal, O., Bagon, S., Dekel, T.: Tokenflow: Consistent diffusion features for consistent video editing. arXiv preprint arXiv:2307.10373 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.304, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.127 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "17. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.787, + 0.23 + ], + "angle": 0, + "content": "18. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. pp. 11808-11826 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.23, + 0.787, + 0.256 + ], + "angle": 0, + "content": "19. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: CVPR. pp. 7297-7306 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.257, + 0.787, + 0.298 + ], + "angle": 0, + "content": "20. Guo, Y., Yang, C., Rao, A., Wang, Y., Qiao, Y., Lin, D., Dai, B.: Animatediff: animate your personalized text-to-image diffusion models without specific tuning. arXiv preprint arXiv:2307.04725 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.298, + 0.787, + 0.338 + ], + "angle": 0, + "content": "21. Ha, S., Kersner, M., Kim, B., Seo, S., Kim, D.: Marionette: Few-shot face reenactment preserving identity of unseen targets. In: AAAI. vol. 34, pp. 10893-10900 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.338, + 0.787, + 0.379 + ], + "angle": 0, + "content": "22. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.379, + 0.787, + 0.42 + ], + "angle": 0, + "content": "23. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. NeurIPS 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.421, + 0.787, + 0.446 + ], + "angle": 0, + "content": "24. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. NeurIPS 33, 6840-6851 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.447, + 0.787, + 0.488 + ], + "angle": 0, + "content": "25. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.488, + 0.787, + 0.528 + ], + "angle": 0, + "content": "26. Hu, Z., Xu, D.: Videocontrolnet: A motion-guided video-to-video translation framework by using diffusion model with controlnet. arXiv preprint arXiv:2307.14073 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.529, + 0.787, + 0.555 + ], + "angle": 0, + "content": "27. Jafarian, Y., Park, H.S.: Learning high fidelity depths of dressed humans by watching social media dance videos. In: CVPR. pp. 12753-12762 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.556, + 0.787, + 0.582 + ], + "angle": 0, + "content": "28. Ji, Y., Chen, Z., Xie, E., Hong, L., Liu, X., Liu, Z., Lu, T., Li, Z., Luo, P.: Ddp: Diffusion model for dense visual prediction. arXiv preprint arXiv:2303.17559 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.583, + 0.787, + 0.623 + ], + "angle": 0, + "content": "29. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. arXiv preprint arXiv:2304.04269 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.623, + 0.787, + 0.664 + ], + "angle": 0, + "content": "30. Karras, J., Holynski, A., Wang, T.C., Kemelmacher-Shlizerman, I.: Dreampose: Fashion image-to-video synthesis via stable diffusion. arXiv preprint arXiv:2304.06025 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.664, + 0.787, + 0.704 + ], + "angle": 0, + "content": "31. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.705, + 0.787, + 0.745 + ], + "angle": 0, + "content": "32. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.745, + 0.787, + 0.772 + ], + "angle": 0, + "content": "33. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: CVPR. pp. 22511-22521 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.787, + 0.799 + ], + "angle": 0, + "content": "34. Lin, K., Wang, L., Liu, Z.: End-to-end human pose and mesh reconstruction with transformers. In: CVPR. pp. 1954-1963 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "35. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "36. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: Ntu rgb+ d 120: A large-scale benchmark for 3d human activity understanding. IEEE TPAMI 42(10), 2684-2701 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "37. Liu, S., Zeng, Z., Ren, T., Li, F., Zhang, H., Yang, J., Li, C., Yang, J., Su, H., Zhu, J., et al.: Grounding dino: Marrying dino with grounded pre-training for open-set object detection. arXiv preprint arXiv:2303.05499 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.233, + 0.788, + 0.274 + ], + "angle": 0, + "content": "38. Liu, X., Ren, J., Siarohin, A., Skorokhodov, I., Li, Y., Lin, D., Liu, X., Liu, Z., Tulyakov, S.: Hyperhuman: Hyper-realistic human generation with latent structural diffusion. arXiv preprint arXiv:2310.08579 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.276, + 0.788, + 0.317 + ], + "angle": 0, + "content": "39. Luan, T., Li, Z., Chen, L., Gong, X., Chen, L., Xu, Y., Yuan, J.: Spectrum auc difference (saucd): Human-aligned 3d shape evaluation. In: CVPR. pp. 20155-20164 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.318, + 0.788, + 0.346 + ], + "angle": 0, + "content": "40. Luan, T., Wang, Y., Zhang, J., Wang, Z., Zhou, Z., Qiao, Y.: Pc-hmr: Pose calibration for 3d human mesh recovery from 2d images/videos. In: AAAI (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.347, + 0.788, + 0.388 + ], + "angle": 0, + "content": "41. Luan, T., Zhai, Y., Meng, J., Li, Z., Chen, Z., Xu, Y., Yuan, J.: High fidelity 3d hand shape reconstruction via scalable graph frequency decomposition. In: CVPR. pp. 16795-16804 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.389, + 0.788, + 0.43 + ], + "angle": 0, + "content": "42. Ma, Y., He, Y., Cun, X., Wang, X., Shan, Y., Li, X., Chen, Q.: Follow your pose: Pose-guided text-to-video generation using pose-free videos. arXiv preprint arXiv:2304.01186 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.431, + 0.788, + 0.458 + ], + "angle": 0, + "content": "43. Mallya, A., Wang, T.C., Liu, M.Y.: Implicit warping for animation with image sets. NeurIPS 35, 22438-22450 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.459, + 0.788, + 0.5 + ], + "angle": 0, + "content": "44. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: CVPR. pp. 6038-6047 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.501, + 0.788, + 0.543 + ], + "angle": 0, + "content": "45. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.544, + 0.788, + 0.585 + ], + "angle": 0, + "content": "46. Nichol, A., Jun, H., Dhariwal, P., Mishkin, P., Chen, M.: Point-e: A system for generating 3d point clouds from complex prompts. arXiv preprint arXiv:2212.08751 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.587, + 0.788, + 0.614 + ], + "angle": 0, + "content": "47. Nirkin, Y., Keller, Y., Hassner, T.: Fsgan: Subject agnostic face swapping and reenactment. In: ICCV. pp. 7184-7193 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.615, + 0.788, + 0.642 + ], + "angle": 0, + "content": "48. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.643, + 0.788, + 0.685 + ], + "angle": 0, + "content": "49. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.686, + 0.788, + 0.727 + ], + "angle": 0, + "content": "50. Qian, S., Lin, K.Y., Wu, W., Liu, Y., Wang, Q., Shen, F., Qian, C., He, R.: Make a face: Towards arbitrary high fidelity face manipulation. In: ICCV. pp. 10033-10042 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.728, + 0.788, + 0.77 + ], + "angle": 0, + "content": "51. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. pp. 8748-8763 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.771, + 0.788, + 0.812 + ], + "angle": 0, + "content": "52. Raj, A., Kaza, S., Poole, B., Niemeyer, M., Ruiz, N., Mildenhall, B., Zada, S., Aberman, K., Rubinstein, M., Barron, J., et al.: Dreambooth3d: Subject-driven text-to-3d generation. arXiv preprint arXiv:2303.13508 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.813, + 0.788, + 0.84 + ], + "angle": 0, + "content": "53. Ranftl, R., Bochkovskiy, A., Koltun, V.: Vision transformers for dense prediction. In: ICCV. pp. 12179-12188 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.127 + ], + "angle": 0, + "content": "Y. Zhai et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.787, + 0.189 + ], + "angle": 0, + "content": "54. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE TPAMI 44(3), 1623-1637 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.218 + ], + "angle": 0, + "content": "55. Reda, F., Kontkanen, J., Tabellion, E., Sun, D., Pantofaru, C., Curless, B.: Film: Frame interpolation for large motion. In: ECCV. pp. 250-266. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.786, + 0.245 + ], + "angle": 0, + "content": "56. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.245, + 0.786, + 0.273 + ], + "angle": 0, + "content": "57. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.787, + 0.314 + ], + "angle": 0, + "content": "58. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: CVPR. pp. 10219-10228 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.314, + 0.787, + 0.342 + ], + "angle": 0, + "content": "59. Saxena, S., Kar, A., Norouzi, M., Fleet, D.J.: Monocular depth estimation using diffusion models. arXiv preprint arXiv:2302.14816 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.342, + 0.787, + 0.383 + ], + "angle": 0, + "content": "60. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.383, + 0.787, + 0.412 + ], + "angle": 0, + "content": "61. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: Ntu \\(\\mathrm{rgb + }\\) d: A large scale dataset for 3d human activity analysis. In: CVPR. pp. 1010-1019 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.787, + 0.439 + ], + "angle": 0, + "content": "62. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: Animating arbitrary objects via deep motion transfer. In: CVPR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.787, + 0.466 + ], + "angle": 0, + "content": "63. Siarohin, A., Woodford, O.J., Ren, J., Chai, M., Tulyakov, S.: Motion representations for articulated animation. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.466, + 0.787, + 0.509 + ], + "angle": 0, + "content": "64. Stan, G.B.M., Wofk, D., Fox, S., Redden, A., Saxton, W., Yu, J., Aflalo, E., Tseng, S.Y., Nonato, F., Muller, M., et al.: Ldm3d: Latent diffusion model for 3d. arXiv preprint arXiv:2305.10853 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.787, + 0.536 + ], + "angle": 0, + "content": "65. Tang, H., Wang, W., Xu, D., Yan, Y., Sebe, N.: Gestureegan for hand gesture-to-gesture translation in the wild. In: ACM MM. pp. 774-782 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.787, + 0.563 + ], + "angle": 0, + "content": "66. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. In: CVPR. pp. 1921-1930 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.787, + 0.605 + ], + "angle": 0, + "content": "67. Unterthiner, T., Van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.605, + 0.787, + 0.646 + ], + "angle": 0, + "content": "68. Wang, T., Li, L., Lin, K., Zhai, Y., Lin, C.C., Yang, Z., Zhang, H., Liu, Z., Wang, L.: Disco: Disentangled control for referring human dance generation in real world. In: CVPR (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.646, + 0.787, + 0.674 + ], + "angle": 0, + "content": "69. Watson, D., Chan, W., Martin-Brualla, R., Ho, J., Tagliasacchi, A., Norouzi, M.: Novel view synthesis with diffusion models. arXiv preprint arXiv:2210.04628 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.674, + 0.787, + 0.702 + ], + "angle": 0, + "content": "70. Wiles, O., Koepke, A., Zisserman, A.: X2face: A network for controlling face generation using images, audio, and pose codes. In: ECCV. pp. 670-686 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.787, + 0.743 + ], + "angle": 0, + "content": "71. Wolleb, J., Sandkuhler, R., Bieder, F., Valmaggia, P., Cattin, P.C.: Diffusion models for implicit image segmentation ensembles. In: International Conference on Medical Imaging with Deep Learning. pp. 1336-1348. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.743, + 0.787, + 0.771 + ], + "angle": 0, + "content": "72. Wu, J., Fang, H., Zhang, Y., Yang, Y., Xu, Y.: Medsegdiff: Medical image segmentation with diffusion probabilistic model. arXiv preprint arXiv:2211.00611 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.771, + 0.787, + 0.799 + ], + "angle": 0, + "content": "73. Wynn, J., Turmukhambetov, D.: Diffusionerf: Regularizing neural radiance fields with denoising diffusion models. In: CVPR. pp. 4180-4189 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "74. Xu, Z., Zhang, J., Liew, J.H., Yan, H., Liu, J.W., Zhang, C., Feng, J., Shou, M.Z.: Magicanimate: Temporally consistent human image animation using diffusion model. arXiv preprint arXiv:2311.16498 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.356, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.175 + ], + "angle": 0, + "content": "75. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth anything: Unleashing the power of large-scale unlabeled data. In: CVPR (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.175, + 0.788, + 0.203 + ], + "angle": 0, + "content": "76. Yang, Z., Zeng, A., Yuan, C., Li, Y.: Effective whole-body pose estimation with two-stages distillation. In: ICCV. pp. 4210-4220 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.203, + 0.788, + 0.231 + ], + "angle": 0, + "content": "77. Zakharov, E., Shysheya, A., Burkov, E., Lempitsky, V.: Few-shot adversarial learning of realistic neural talking head models. In: ICCV. pp. 9459-9468 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.231, + 0.788, + 0.259 + ], + "angle": 0, + "content": "78. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV. pp. 3836-3847 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.285 + ], + "angle": 0, + "content": "79. Zhao, J., Zhang, H.: Thin-plate spline motion model for image animation. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.285, + 0.788, + 0.314 + ], + "angle": 0, + "content": "80. Zhao, S., Fu, H., Gong, M., Tao, D.: Geometry-aware symmetric domain adaptation for monocular depth estimation. In: CVPR. pp. 9788-9798 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.314, + 0.788, + 0.342 + ], + "angle": 0, + "content": "81. Zheng, C., Cham, T.J., Cai, J.: T2net: Synthetic-to-realistic translation for solving single-image depth estimation tasks. In: ECCV. pp. 767-783 (2018)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.342 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_origin.pdf b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9cab65764e807bdbad483e4da25cf32c941e51f4 --- /dev/null +++ b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/936a163c-2a44-4375-899b-7f720c040bba_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:968ef66edbc0e9aff674748b0f7fafe2002e187aed56ab2aa2ed00e619a8426e +size 3141943 diff --git a/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/full.md b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..ced4731b32b848aac3e11d72e5e2479ff754b9d5 --- /dev/null +++ b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/full.md @@ -0,0 +1,349 @@ +# IDOL: Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation + +Yuanhao Zhai\*1, Kevin Lin\*2, Linjie Li\*2, Chung-Ching Lin\*2, Jianfeng Wang\*2, Zhengyuan Yang\*2, David Doermann\*1, Junsong Yuan\*1, Zicheng Liu\*3, and Lijuan Wang\*2 + +1 State University of New York at Buffalo + +2 Microsoft + +3 Advanced Micro Devices + +https://yhzhai.github.io/idol/ + +Abstract. Significant advances have been made in human-centric video generation, yet the joint video-depth generation problem remains under-explored. Most existing monocular depth estimation methods may not generalize well to synthesized images or videos, and multi-view-based methods have difficulty controlling the human appearance and motion. In this work, we present IDOL (unIfied Dual-mOdal Latent diffusion) for high-quality human-centric joint video-depth generation. Our IDOL consists of two novel designs. First, to enable dual-modal generation and maximize the information exchange between video and depth generation, we propose a unified dual-modal U-Net, a parameter-sharing framework for joint video and depth denoising, wherein a modality label guides the denoising target, and cross-modal attention enables the mutual information flow. Second, to ensure a precise video-depth spatial alignment, we propose a motion consistency loss that enforces consistency between the video and depth feature motion fields, leading to harmonized outputs. Additionally, a cross-attention map consistency loss is applied to align the cross-attention map of the video denoising with that of the depth denoising, further facilitating spatial alignment. Extensive experiments on the TikTok and NTU120 datasets show our superior performance, significantly surpassing existing methods in terms of video FVD and depth accuracy. + +# 1 Introduction + +The capacity to control and manipulate human-centric video content – modulating subjects' actions, altering appearance and background – has attracted continual study [29, 42, 62, 63, 68]. With the rapid evolution of generative models, from generative adversarial networks [6, 17] to recent latent diffusion models [56], the quality of the generated video has improved significantly. However, most of the existing research [29, 42, 62, 63, 68] has focused on the generation of 2D content. This imposes a natural limit on applications that require depth perception, + +![](images/9a4d73b05969ea5ce6b96d69e3e1623f840a09fb4a37e15cdd835299ab987f86.jpg) +Fig. 1: Given a human foreground image, an arbitrary background image, and a defined pose sequence, our IDOL generates high-fidelity video and the corresponding depth maps, which can be rendered as realistic 2.5D video. + +such as virtual and augmented reality, as well as advanced video games. In this paper, we explore joint video-depth generation for human actions (e.g., dancing and daily activities), where the video and the corresponding depth map are simultaneously generated. By learning a holistic representation of the human, it not only enhances the visual fidelity of the synthesized content but also paves the way for applications that demand a deeper spatial understanding. + +Existing methods confront several challenges in dealing with this task. First, discriminative monocular depth estimation methods [27, 54], which are typically trained on natural images, have been empirically observed to exhibit degraded performance when applied to generated images [2, 3, 80, 81]. On the other hand, while multi-view-based methods [18, 48, 52, 69, 73] can estimate depth, they primarily focus on the synthesis of individual object/scene. They often struggle with inference from single-view inputs or underperform in manipulating the object's appearance and motion. To address these problems, we propose to jointly generate the video and the corresponding depth. + +However, joint video-depth generation presents nontrivial challenges for two primary reasons. First, video and depth are inherently two different modalities: the former is represented as a 3-channel RGB frame sequence and the latter as a scalar depth map sequence [53,54]. Contrarily, prevailing diffusion models are pre-trained on the single-modal image generation task [56]. Thus, designing a dual-modal diffusion model for joint video-depth generation is challenging, not to mention harnessing the power of pre-trained latent diffusion models. Second, spatial layout control has been a long-standing problem in diffusion models [16,22,44,66]. Even with human pose control, maintaining an accurate spatial alignment between the generated video and depth remains a challenge. This challenge can be more pronounced if the denoising process is conducted in the latent space, given the intricate mapping from the latent space to the final output. In addressing these problems, we propose IDOL (unIfied Dual-mOdal Latent diffusion), a framework that aims to generate a human-centric video and the corresponding depth jointly. + +To tackle the problem of distinct video and depth representations, we propose to render depth maps as RGB images by applying a color map to them. This + +conversion reframes the depth generation task as a stylized video generation problem. Besides, existing methods suggest that incorporating depth as input enhances structural understanding and boosts the generation quality [13]. Drawing inspiration from this, we hypothesize that a richer interplay between depth and video generation would be reciprocally beneficial. To this aim, we design a unified dual-modal U-Net that shares parameters across both video and depth denoising processes. Our model leverages a modality label to specify the denoising target, i.e., video or depth. In this way, it enables joint learning of depth and video for better generation quality while remaining parameter-efficient. Furthermore, a cross-modal attention layer is added during the joint denoising process, enabling an explicit correlation between the joint video-depth learning. + +To ensure a precise video-depth alignment, we propose to synchronize the motion pattern of the intermediate video and depth features. Specifically, the intermediate video and depth features within the U-Net contain semantic information, where regions with similar semantic meanings are represented with similar features [5,16,66], as shown in Fig. 3. Thus, by using the proposed motion consistency loss, we enforce a consistent motion between video and depth features, thereby promoting a precise video-depth spatial alignment. Additionally, we propose a cross-attention map consistency loss to further strengthen video-depth alignment. This is drawn inspiration from existing observations [22,49] on the influence of cross-attention maps on the spatial layout. Different from [22,49], we consider spatial alignment across video and depth modalities. + +In summary, our contributions are as follows. + +- We propose IDOL, a pioneering framework for human-centric joint video-depth generation. Our IDOL features a parameter-sharing unified dual-modal U-Net for video-depth denoising. Besides, cross-modal attention modules are used to enable the mutual information flow. +- We propose a motion consistency loss and a cross-attention map consistency loss to allow fine-grained video-depth spatial alignment. +- We conduct extensive experiments on two distinct datasets: TikTok and NTU120, whose depth maps were obtained using different methods [27,53,54]. The results not only show a significant improvement in video quality and depth accuracy over state-of-the-art methods, but also highlight the flexibility of our method in adapting to different depth maps. Furthermore, our experiments reveal that our IDOL can be easily adapted to different diffusion models. + +# 2 Related Work + +Controllable diffusion models. Evolving from early diffusion models [12, 24], recent latent diffusion models (LDM) [56] achieves high-quality image generation by conducting the denoising process in the latent space. ControlNet [78], GLIGEN [33] and T2I-Adapter [45] add trainable modules on pre-trained diffusion models, and achieve fine-grained control given additional inputs, such as sketch and depth. HumanSD [29] directly concatenates the pose feature and the noise in the input to avoid potential feature discrepancy problems. In the + +video generation domain, controllable video diffusion models [11,26,42] leverage the depth/flow/edge sequence to generate a temporally consistent video. Our work builds upon these controllable models, utilizing plug-in modules to facilitate human pose control in IDOL. Our experiments demonstrate our adaptability across various frameworks (e.g., ControlNet [78] and T2I-Adapter [45]). + +Image animation. Image animation involves producing a video wherein an object from the source image moves in congruence with the motion in a target video. Traditional methods require specific knowledge about the target object, such as facial landmarks [21, 50, 77], gestures [65], or semantic segmentation maps [47]. Several methods learn a motion field [62, 70] from the driving videos. First order motion model (FOMM) [62] improves the animation quality by learning a local affine transformation. Motion representation for articulated animation (MRAA) [63] achieves better quality in representing articulated motions, such as the human body. Thin-plate spline (TPS) [79] estimates a more accurate motion, and improves previous methods over large-scale motions. Besides, there exists a line of methods [43, 55] exploiting end-to-end learning frameworks. Based on diffusion models, DreamPose [30] proposes an adapter module, such as to control the appearance of the generated human. DisCo [68] disentangles the human attribute and pose condition learning by employing a two-stage training scheme. Several concurrent works improve DisCo [68] using more advanced appearance and motion control [8, 25, 74]. Furthermore, several methods [31, 42] inject motion/pose prior to pre-trained text-to-image models. Distinctively, our IDOL focuses on the joint video-depth generation, and utilizes depth generation to enhance the overall quality of the animated video, instead of video-only generation. + +Multi-modality synthesis. There exists a line of diffusion models for view synthesis, such as diffusion models using multi-view images [18, 69, 73], point cloud [46], and text-to-3D models [48, 52]. There are also methods developed for human body mesh estimation [34, 39-41]. However, they may struggle with human-centric joint video-depth synthesis, as they typically require multi-view input or lack the ability to precisely control the appearance and motion of the target object/scene. Except for the use of multi-view images, LDM3D [64] modifies the autoencoder in LDM, such that the latent can be decoded into an RGB image and a depth map. MM-Diffusion [58] focuses on the audio-video generation, and features a coupled U-Net structure to simultaneously denoise video and audio latents. Concurrently, HyperHuman [38] proposes structural expert branches to denoise latents of different modalities, such as RGB image, depth and surface normal. To the best of our knowledge, there is no existing method directly working on the joint video-depth generation task, and thus, we modify the backbones of existing multi-modal generation methods for comparison. + +Diffusion models for dense prediction. Diffusion models have been used in various dense prediction tasks, such as segmentation tasks [1, 5, 10, 28, 71, 72], depth estimation [28, 59] and object detection [9]. For depth estimation methods [28, 59], they typically necessitate modifying the output from 3-channel RGB images to scalar depth maps. Such a transformation impedes their ability to harness the power of large-scale pre-trained diffusion models [56]. Concurrently, + +![](images/f3be8cd5a36e0aa17d9523a45ea60ed4ddbae20efa317a6ee959e057d63d05a5.jpg) +Fig. 2: Left: Overall model architecture. Our IDOL features a unified dual-modal U-Net (gray boxes), a parameter-sharing design for joint video-depth denoising, wherein the denoising target is controlled by a one-hot modality label ( $y_{\mathrm{v}}$ for video and $y_{\mathrm{d}}$ for depth). Right: Individual U-Net block structure. Cross-modal attention is added to enable mutual information flow between video and depth features, with consistency loss terms $\mathcal{L}_{\mathrm{mo}}$ and $\mathcal{L}_{\mathrm{xattn}}$ ensuring the video-depth alignment. Skip connections are omitted for conciseness. + +![](images/b5f12c0e948ccfc60769db0d2b0c96f9018de2ba1b951ac5cd565bead317633d.jpg) + +Depth Anything [75] address this problem by leveraging large-scale unlabeled data to improve the estimation quality. Additionally, when applied to synthesized content, existing depth estimation methods tend to underperform [2,3,80,81], failing to generate high-quality depth maps from outputs of image animation methods. To mitigate this problem, we propose IDOL to directly synthesize the video and the corresponding depth, significantly improving the depth accuracy. + +In contrast to existing methods, we reframe the depth synthesis task as a stylized image synthesis task. By rendering target depths as RGB images, we are positioned to directly use pre-trained image generation models with minimal modifications. Furthermore, we propose a unified dual-modal U-Net for improved joint video-depth generation, and enhance video-depth spatial alignment via the proposed consistency losses. + +# 3 Method + +Problem formulation. We begin by formally defining the task of human-centric joint video-depth generation. Given a human foreground image $f$ , a background image $b$ , and a pose sequence $p = \{p_1, p_2, \dots, p_L\}$ of length $L$ , our objective is to generate a video $v = \{v_1, v_2, \dots, v_L\}$ and the associated depth map sequence $d = \{d_1, d_2, \dots, d_L\}$ . The video $v$ should faithfully animate the human foreground $f$ into the target pose $p$ while integrating it with the background $b$ . The depth map sequence $d$ should correctly represent the depth within the video $v$ . An illustration is shown in Fig. 1. + +Preliminaries. Latent diffusion models (LDM) [56] recently show great success in image generation. It operates in the latent space of a pre-trained autoencoder $\mathcal{D}(\mathcal{E}(\cdot))$ , where a time-conditioned U-Net [57] $\epsilon_{\theta}(\cdot)$ with learnable parameter $\theta$ is used for denoising the latent feature. Within the U-Net, the conditional signal + +$c$ (e.g., textual prompt) is fed in the cross-attention module after CLIP [51] encoding. During training, the objective is the mean square error (MSE) between the predicted and ground truth noise: + +$$ +\mathcal {L} = \mathbb {E} _ {v, \epsilon , t, c} \left[ \| \epsilon - \epsilon_ {\theta} (z _ {t}, t, c) \| _ {2} ^ {2} \right], \tag {1} +$$ + +where $\epsilon \in \mathcal{N}(0,I)$ is the ground truth noise, and $z_{t}$ is the noisy latent at the $t$ -th reverse step, and can be obtained from $\mathcal{E}(v)$ and $\epsilon$ [24]. To enable spatial layout control, ControlNet [78] adds a copy of the U-Net down and middle blocks upon the LDM. The output of ControlNet is added to the original U-Net via skip connections. By manipulating the intermediate features, ControlNet trained with additional conditional input (poses in our case) can control the output image/video [68]. + +# 3.1 Unified dual-modal U-Net + +Video and depth are different modalities and typically have distinct representations. Designing a model architecture that can jointly generate both video and depth, and potentially leverage pre-trained diffusion models, presents a significant challenge. In addressing this problem, we propose to reformulate depth synthesis as a stylized image generation task. By rendering the depth map as a heatmap, we bridge the gap between the video and depth modalities. To further harness this approach, we introduce a unified dual-modal U-Net, specially tailored for the joint video-depth denoising. + +Video LDM baseline. We build our model upon 3D U-Net [13], which modifies the 2D U-Net [56] by adding a temporal convolutional layer in the ResBlock, and adding a temporal attention layer after the spatial attention within each block. For the human appearance and pose control, we follow DisCo [68] to feed the CLIP foreground latent $\mathrm{CLIP}(f)$ via cross-attention, and feed the pose latent $\mathcal{E}(p)$ via a ControlNet to the U-Net. We show in Sec. 4.1 that our method can be implemented on different pose control modules, such as T2I-Adapter [45]. For the background control, different from DisCo that leverages a ControlNet, we find that adding the background latent $\mathcal{E}(b)$ to the input noise of the U-Net not only yields comparable results but also reduces the number of parameters. The proposed model architecture is illustrated in Fig. 2. + +Sharing U-Net for joint video-depth denoising. Existing methods [13] have shown that incorporating depth map as conditional input enhances the model's video structure awareness, improving the video generation quality. Building on this insight, we hypothesize that maximizing the information exchange between video and depth during generation can benefit the generation quality for both modalities. Thus, we propose a unified dual-modal U-Net for video and depth denoising, where the architecture and parameters of the U-Net and ControlNet are shared between the two modalities. To indicate the denoising modality, we add a learnable modality embedding to the time step embedding, which is fed to all blocks within the U-Net and the ControlNet, as shown in Fig. 2 right. In this way, given a one-hot modality label, the corresponding modality embedding will + +be selected to feed into the model and further control the output modality. Apart from being parameter-efficient, we find that this unified architecture improves both video and depth generation quality (Sec. 4.2). + +Cross-modal attention. Though the unified dual-modal U-Net enables implicit structural information learning, direct information communication during the video and depth denoising process is needed for better alignment. Thus, we add a multi-modality attention at the end of each block (Fig. 2 right). During the joint video-depth denoising process, the video and depth features are concatenated to conduct spatial self-attention. Note that self-attention is only performed in the spatial dimension, as it aims to promote spatial alignment between video and depth, and the preceding temporal layers already ensure the temporal smoothness. + +The joint video-depth denoising objective $\mathcal{L}_{\mathrm{denoise}}$ is: + +$$ +\begin{array}{l} \mathcal {L} _ {\mathrm {d e n o i s e}} = \mathbb {E} _ {v, d, \epsilon_ {\mathrm {v}}, \epsilon_ {\mathrm {d}}, t, f, b, p} \big [ \| \epsilon_ {\mathrm {v}} - \epsilon_ {\theta} (z _ {\mathrm {v}, t}, t, f, b, p; y _ {\mathrm {v}}) \| _ {2} ^ {2} + \\ \begin{array}{l} \left\| c _ {V} - c _ {\theta} \left(z _ {V, t}, v, f, b, p, y _ {V}\right) \right\| _ {2} ^ {2} + \\ \left\| \epsilon_ {d} - \epsilon_ {\theta} \left(z _ {d, t}, t, f, b, p; y _ {d}\right) \right\| _ {2} ^ {2} ], \end{array} \tag {2} \\ \end{array} +$$ + +where $y_{\mathrm{v}}$ and $y_{\mathrm{d}}$ are the modality labels for video and depth, respectively, $\epsilon_{\mathrm{v}}, \epsilon_{\mathrm{d}} \in \mathcal{N}(0, I)$ are independently sampled Gaussian noises, and $f, b, p$ denote the human foreground image, the background image, and the target pose sequence, respectively. In Eq. (2), the first term is the video denoising loss and the second term is the depth denoising loss. + +# 3.2 Learning video-depth consistency + +Though the pose control ensures the coarse correspondence between the video and depth, we empirically find that only applying the joint denoising objective $\mathcal{L}_{\mathrm{denoise}}$ may still lead to misalignment between the generated video and depth, especially when the training data is limited, as shown in the first column of Fig. 3. To promote a precise video-depth alignment, we propose a motion consistency loss $\mathcal{L}_{\mathrm{mo}}$ and a cross-attention map consistency loss $\mathcal{L}_{\mathrm{xattn}}$ . + +Motion consistency loss. In image diffusion models, the intermediate self-attention features in the U-Net are found to contain semantic information [5,16,66]. We found this finding also holds in our video-depth diffusion model. However, though video and depth features share similar layouts, they may differ in the temporal motion, as illustrated in Fig. 3. Thus, we attribute the video-depth misalignment to the unsynchronized motion between video and depth features. To address this problem, we propose to enforce a synchronized motion between the video and depth features via a motion consistency loss $\mathcal{L}_{\mathrm{mo}}$ . + +Specifically, given intermediate video self-attention feature maps at frame $l$ and $l + 1$ : $F_{\mathrm{v},l}, F_{\mathrm{v},l + 1} \in \mathbb{R}^{H \times W \times D}$ , their cost volume $C_{\mathrm{v},l} \in \mathbb{R}^{H \times W \times H \times W}$ can be constructed by conducting cosine similarity between all point pairs on the two frames: + +$$ +c _ {\mathrm {v}, l, i, j, h, k} = f _ {\mathrm {v}, l, i, j} \cdot f _ {\mathrm {v}, l + 1, h, k}, \tag {3} +$$ + +where $f_{\mathrm{v},l,i,j}$ is the normalized feature vector on $F_{\mathrm{v},l}$ at spatial location $i,j$ . The cost volume $C_{\mathrm{d},r}$ for the depth feature maps can be computed in a similar way. + +![](images/77f92efe8efffde9042c3afd963e062060abe561071a99c83858b0363a21a869.jpg) +Fig. 3: Visualization of the video and depth feature maps and their motion fields without consistency losses. We attribute the inconsistent video-depth output (blue circle) to the inconsistent video-depth feature motions (the last row). This problem exists in multiples layers within the U-Net, and we randomly select two layers for visualization. We follow [66] to visualize the feature maps, and different color in the motion file indicates different moving direction. + +Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem. + +Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem. + +As the video and depth features may be distributed differently, we further normalize the cost volume via softmax, resulting in a motion field $U_{\mathrm{v},l}$ : + +$$ +u _ {\mathrm {v}, l, i, j, h, k} = \frac {\exp \left(c _ {\mathrm {v} , l , i , j , h , k} / \tau\right)}{\sum_ {h ^ {\prime}} \sum_ {k ^ {\prime}} \exp \left(c _ {\mathrm {v} , l , i , j , h ^ {\prime} , k ^ {\prime}} / \tau\right)}, \tag {4} +$$ + +where $\tau$ is a temperature hyper-parameter controlling the concentration of the distribution. A high value on the motion field indicates a movement between two points. The motion consistency is achieved by minimizing the MSE loss between the video and depth motion fields: + +$$ +\mathcal {L} _ {\mathrm {m o}} = \frac {1}{L H W H W} \sum_ {l, i, j, h, k} \| u _ {\mathrm {v}, l, i, j, h, k} - u _ {\mathrm {d}, l, i, j, h, k} \| _ {2} ^ {2}. \tag {5} +$$ + +By enforcing similar motion of video and depth features, it promotes a consistent video and depth output. + +Cross-attention map consistency loss. Except for leveraging the self-attention feature, the cross-attention maps between the foreground image and the input noise are also found to be critical in the image layout control [22,49]. Thus, we additionally enforce the cross-attention maps from the video stream and the depth stream to be similar via an MSE loss $\mathcal{L}_{\mathrm{xattn}}$ : + +$$ +\mathcal {L} _ {\mathrm {x a t t n}} = \left\| M _ {\mathrm {v}} - M _ {\mathrm {d}} \right\| _ {2} ^ {2}, \tag {6} +$$ + +where $M_{\mathrm{v}}$ and $M_{\mathrm{d}}$ represent the video and depth cross-attention map, respectively. + +As the ControlNet fuses features in the U-Net up blocks, we apply the consistency loss terms only to the U-Net up blocks to efficiently learn the U-Net and the ControlNet. The overall training objective $\mathcal{L}$ is defined as: + +$$ +\mathcal {L} = \mathcal {L} _ {\text {d e n o i s e}} + \sum_ {n = 1} ^ {N} \left(w _ {\mathrm {m o}} \mathcal {L} _ {\mathrm {m o}, n} + w _ {\mathrm {x a t t n}} \mathcal {L} _ {\mathrm {x a t t n}, n}\right), \tag {7} +$$ + +where $w_{\mathrm{mo}}$ and $w_{\mathrm{xattn}}$ are weighting hyper-parameters, $N$ is the number of up blocks, and $\mathcal{L}_{\mathrm{mo},n}$ and $\mathcal{L}_{\mathrm{xattn},n}$ are the motion consistency loss and the cross-attention map consistency loss on the $n$ -th up block, respectively. + +# 3.3 Human attribute outpainting pre-training + +To disentangle the pose and background control, DisCo [68] proposes a human attribute pre-training (HAP) task to learn human appearance. Specifically, HAP learns to reconstruct the whole image given human foreground and background images, with the pose ControlNet being removed, as shown in Fig. 4 top. However, we empirically find that such pre-training may lead to an apparent background mask when the target pose deviates from the original position. + +To address this problem, we propose human attribute outpainting pre-training (HAOP). Our HAOP differs from HAP in two ways. First, HAOP extends the background mask through dilation, forcing the model to fill in the background around the foreground. Second, we apply a random crop and resize on the foreground image, prompting the model to extrapolate the partial human attributes. This process not only mitigates the background masking problem but also improves image synthesis, as demonstrated in Fig. 4 and validated in our ablation studies (Sec. 4.2). Formally, the pre-training learning objective is as follows: + +$$ +\mathcal {L} _ {\mathrm {H A O P}} = \mathbb {E} _ {v, \epsilon , t, f _ {\mathrm {a u g}}, b _ {\mathrm {a u g}}} \left[ \| \epsilon - \epsilon_ {\theta} \left(z _ {t}, t, f _ {\mathrm {a u g}}, b _ {\mathrm {a u g}}\right) \| _ {2} ^ {2} \right], \tag {8} +$$ + +where $f_{\mathrm{aug}}$ and $b_{\mathrm{aug}}$ represent augmented foreground and background, respectively. Note that the pre-training does not require depth denoising, which significantly lowers the data demand. + +# 4 Experiments + +Datasets. We train and evaluate on two public datasets: TikTok [27] and NTU120 [36,61]. The TikTok dataset consists of $\sim 350$ human dancing videos. We follow DisCo [68] to use 335 videos for training, and use 10 videos for evaluation. The NTU120 dataset consists of daily activities videos, we select 588 videos for training and 72 videos for evaluation. The videos are cropped to center to the subject. We specifically ensure distinct subjects and backgrounds between training and evaluation, and select only certain subjects to better evaluate the generalization ability. Besides, we use Grounded-SAM [32,37] for the human foreground mask estimation, and follow ControlNet [78] to use OpenPose [7] + +
MethodMotion controlTikTokNTU120
VideoDepthImageVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓FID-FVD↓FVD↓L2↓FID↓
FOMM [62]38.36404.31-85.0340.341439.50-80.29
MRAA [63]Target video24.11306.49-54.4758.191441.79-97.07
TPS [79]29.20337.79-53.7837.421339.86-61.75
DreamPose [30]DensePose [19]52.62614.07-75.0880.11791.25-116.23
DisCo [68]20.75257.900.0975†39.0226.21458.920.0371†68.53
LDM3D [64]OpenPose [7]45.30553.030.063769.3671.11587.840.0650120.74
MM-Diffusion [58]48.92771.320.036768.4758.44504.050.0404102.77
IDOLOpenPose [7]17.86223.690.033636.0420.23314.820.031750.70
+ +Table 1: Quantitative results comparison between our IDOL and existing methods on the TikTok and NTU120 datasets. The ground truth depth is estimated via HDNet [27]. " $\ddagger$ " indicates incapable of generating depth map, " $\ddagger$ " indicates the HDNet-inferred depth from the synthesized image. The best and the second best results are denoted in bold and underscored, respectively. + +for human pose estimation. For the depth estimation, we leverage two different methods: HDNet [27] for high-fidelity depth estimation on the human foreground, where the background depth is set to a constant; MiDaS [53, 54] for the whole-frame depth estimation, which lacks details on the human foreground. The HDNet depth map is rendered by applying the "hot" colormap; the MiDaS depth map is rendered as grayscale images. For pre-training, we follow DisCo [68] to use $\sim 700\mathrm{k}$ images from a combined dataset of TikTok [27], COCO [35], SHHQ [14], DeepFashion2 [15], and LAION [60]. + +Evaluation metrics. We separately evaluate the quality of the generated video and depth. For video quality evaluation, we follow DisCo [68] to use FID-FVD [4] and FVD [67] over every 8-frame snippet. For the evaluation of depth synthesis, for simplicity, we first scale the depth in the range $[0,1]$ , and compute L2 distance between the ground truth depth4 and the generated depth. In addition to evaluating the generated video and depth, we further use FID [23] on the frames to measure the image quality. + +Comparison methods. We adopt state-of-the-art image animation methods FOMM [62], MRAA [63], TPS [79], DreamPose [30], and DisCo [68] for the video and image quality comparison. As a pioneering method in human-centric joint video-depth generation, to our knowledge, there is no direct prior work for the joint video-depth generation quality comparison. Thus, we adapt the most relevant multi-modal generation methods (LDM3D [64] for text to image-depth and MM-Diffusion [58] for text to video-audio), modify their backbones to the same VideoLDM baseline as ours (Sec. 3.1) to enable appearance and pose control, and compare the joint video-depth generation results with them. + +![](images/b702172df842a26278db2eaa3a9fbf2a09529b500916f4e4983538760772d24b.jpg) +Fig. 5: Qualitative results comparison between TPS [79], DisCo [68], LDM3D [64], MM-Diffusion [58] and our IDOL on the TikTok and NTU120 datasets with HDNet estimated depth [27]. Note that TPS [79] is unable to generate depth, and the depth map for DisCo is estimated via HDNet on its generated frames. Please find video comparison in the supplementary material. + +# 4.1 Main results + +In our experiments, we use the HDNet depth [27] by default for its high-fidelity human foreground depth estimation. We also train and evaluate on the MiDaS depth [53, 54] to demonstrate the generalization ability of our IDOL. + +Comparison with the state-of-the-art. We compare IDOL with state-of-the-art methods on the TikTok and NTU120 datasets in Tab. 1, with the generated frame and depth visualized in Fig. 5. We make the following observations. (1) We outperform all competing motion transfer and video generation methods [30, 62, 63, 68, 79] in terms of both video and image quality. (2) When adapting multi-modal generation methods [58, 64] for human-centric joint video-depth generation, with the integration of the video LDM baseline (Sec. 3.1), IDOL consistently outperforms them across video, image, and depth metrics on both datasets, demonstrating the effectiveness of our method. (3) Applying HDNet depth estimation to the previous state-of-the-art DisCo generated frames leads to suboptimal results, with incomplete, fragmentary or overly simplistic estimations, as shown in Fig. 5. As the estimation result deviates from the ground truth, the HDNet results lead to a high depth L2, as listed in the DisCo row of Tab. 1. This finding indicates the limited generalization ability of monocular depth methods, and highlights the need for multi-modal generation approaches. + +Comparison on synthesizing different types of depth map. Tab. 2 compares the results on using the MiDaS grayscale depth map [53, 54] for the joint video-depth generation. The results consistently show that our IDOL outperforms + +
MethodVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
TikTokDisCo [68]20.75257.900.1758‡39.02
LDM3D [64]42.09529.430.064672.30
MM-Diffusion [58]52.37715.280.104070.09
IDOL19.01216.960.027139.76
NTU120DisCo [68]26.21458.920.0695‡68.53
LDM3D [64]77.04591.030.0244115.16
MM-Diffusion [58]73.47503.530.0260117.22
IDOL20.56439.630.021055.70
+ +![](images/eee27acbe36b0d0e7d4b898f05d464ab0b9c64c2f06d1528ac7bffe352748957.jpg) + +![](images/c41d8a161a0e359a56be8583c3ca1e3493a50747f6882e00183aa4dfe7926b61.jpg) + +![](images/a565573d72ac68762bbe260afec7a4955e5b52ac49e0e5005598bea2d3ae4f6b.jpg) +Reference image Target pose +Fig. 6: Qualitative results comparison on MiDaS [53,54] grayscale whole-frame depth map generation. + +Table 2: Quantitative comparison between our method and existing methods on the TikTok and NTU120 datasets with MiDaS estimated depth [53,54]. "‡" indicates the MiDaS estimated depth from the synthesized image. + +
Motion repr.Temporal modelingPose controlVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
OpenPose [7]HandcraftedControlNet [78]17.86223.690.033636.04
OpenPose [7]AnimateDiff [20]ControlNet [78]19.58201.830.035033.14
DWPose [76]AnimateDiff [20]ControlNet [78]16.73179.200.024531.06
DWPose [76]AnimateDiff [20]T2I-Adapter [45]14.40188.160.019530.06
+ +Table 3: Quantitative result of our IDOL generalize to different motion representations, temporal modeling designs, and pose control module on TikTok [27] with HDNet depth [27]. The gray row indicates our default setting. Please find our supplementary material for additional implementation details. + +existing multi-modal generation methods [58,64] in both video and depth quality. This further highlights IDOL's effectiveness and its adaptability to different types of depth maps. Additionally, as shown in the DisCo row of Fig. 6, applying MiDaS on the DisCo generated frames also yields suboptimal results, blurring the areas surrounding the human subject, and leads to poorer depth accuracy (measured by L2 norm) than that achieved by generative approaches. + +Generalization ability. Our IDOL follows DisCo [68] for setting the default motion representations (OpenPose [7]) and backbone architectures (ControlNet [78]). In Tab. 3 and Fig. 7, we further show that our IDOL can be easily adapted to other motion representations, temporal modeling modules, and pose control modules. First, IDOL can benefit from the motion prior from pre-trainedAnimateDiff [20] to improve the video quality. Besides, our IDOL can be conditioned to more fine-grained DWPose [76], which provides additional facial and hand keypoints, to improve the video and depth quality. Impressively, even when using OpenPose, which lacks hand keypoint as condition, IDOL effectively generates plausible human hands, demonstrating its robust human attribute learning capabilities. Furthermore, our IDOL can be implemented with different pose control modules, such as ControlNet [78] and T2I-Adapter [45], achieving similar quantitative and qualitative results. Such results demonstrate that our IDOL can be generalized to different design options. + +![](images/3ebad1a5126aef49fab8d2a5a1e59373a7b0aa52394c4fecd9b557c07eafc1d0.jpg) + +![](images/0ff9e66f6046805ada1a8f623a7150f5364a8876f39f0bfcc8557942e1c1cabb.jpg) +Reference image & Target motion representation + +![](images/da1baf164798d03cf11cf6c8e2b6cefc7bd94a6f510a7aef13c611ee2a1c3cd0.jpg) + +![](images/5539d45dc7ebfa130c47b66c97e05f8a9856df3f507f74f31eca03fee9e639cb.jpg) + +![](images/276e0e657dafa55b29bdd2b6c2a54b76352241b2e0cc927d9ab1a2aa612834cb.jpg) +OpenPose ControlNet (default) +DWPose DWPose ControlNet T2I-Adapter + +![](images/5afece29b1430a661451f34bc3307a421dddcb5d954ec0cea207c723f8a0c08a.jpg) + +![](images/4696bc0e773e35cc6d9ad1e5c3dc3191c0dcf41ec2c9a999d0908362df84a0a8.jpg) +Fig. 7: Qualitative results of our IDOL generalize to different motion representations and pose control modules. + +![](images/d89fefb444076440b4d7320c850f1c409cce8510c808e07f1cb4dc3d821f99a5.jpg) + +![](images/e10ff127018cb90fa7ae37f934f35b5543b9077956675cc39821527785258e54.jpg) +Reference image Target pose +Fig. 8: Qualitative comparison between the baseline video LDM, unified dual-modal U-Net w/o and w/ consistency losses. + +
Settings#Param.VideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
Sep. U-Net for joint denoise2 × 1.39B24.28282.500.082241.72
Share U-Net for joint denoise1.39B22.10272.370.036939.43
+ Cross-modal attn.1.41B19.28260.650.036039.01
+ +Table 4: Ablation study on the joint video-depth learning and the unified dual-modal U-Net design. + +
\( {\mathcal{L}}_{\text{xatt }} \)\( {\mathcal{L}}_{\text{mo }} \)VideoDepthImage
FID-FVD \( \downarrow \)FVD \( \downarrow \)L2 \( \downarrow \)FID \( \downarrow \)
19.29260.650.036039.01
✓19.29244.580.035137.89
✓✓17.86223.690.033636.04
+ +Table 5: Ablation study on the videodepth consistency loss functions $\mathcal{L}_{\mathrm{mo}}$ and $\mathcal{L}_{\mathrm{xattn}}$ + +# 4.2 Ablation studies + +We conduct a set of ablation studies on the TikTok dataset [27] with HDNet depth [27] to demonstrate the effectiveness of our proposed method. These studies are conducted accumulatively, layering each component to assess its incremental impact on the overall performance. + +Unified dual-modal U-Net for joint video-depth denoising. We analyze whether joint video-depth learning improves the performance, and the effectiveness of the designs proposed in the unified dual-modal U-Net in Tab. 4. The key observations are as follows. (1) Jointly video-depth learning with a shared U-Net is beneficial for both video and depth generation (the second row), while using only half the parameters compared to the separate counterpart. Such a result underscores the significance of our structurally-aware shared U-Net. (2) The explicit cross-modal information exchange between the video and depth denoising (the third row), i.e., through cross-modal attention, further improves both the video and depth generation quality. Moreover, as shown in Fig. 8, our unified dual-modal U-Net markedly improves frame and depth quality compared to the separate U-Net baseline. Such results confirm the effectiveness of our design. + +Learning video-depth consistency. In our IDOL, we introduce a motion consistency loss $\mathcal{L}_{\mathrm{mo}}$ and a cross-attention map consistency loss $\mathcal{L}_{\mathrm{xattn}}$ to enhance + +
Pre-training strategyVideoDepthImageMethodFLOPs (T) #Param. (B) GPU mem. (MB) Infer. time (s)
FID-FVD↓FVD↓L2↓FID↓
w/o pre-training39.24452.810.036356.80LDM3D [64]48.801.61766142.02
HAP [68]19.83227.860.033638.71MM-Diffusion [58]41.022.781465113.49
HAOP (ours)17.86223.690.033636.04IDOL (ours)39.351.411025112.23
+ +Table 6: Ablation study on the pre- Table 7: Computational complexity comparison training. son. + +video-depth alignment. We analyze their impact in Tab. 5, where the results demonstrate that both of them improve the depth generation quality, and the motion consistency loss improves all video, depth, and image generation results. The final column of Fig. 8 further illustrates how these consistency loss terms effectively refine video-depth alignment in our model. + +Human attribute outpainting pre-training. We analyze the effectiveness of our human attribute outpainting pre-training (HAOP) in Tab. 6. The results reveal that HAOP surpasses human attribute pre-training (HAP) [68] across all metrics, confirming its efficacy. Notably, even without pre-training, our IDOL already outperforms other competing multi-modal generation methods [58,64]. + +Complexity and computational requirements. We analyzed the complexity of generating an 8-frame video-depth sequence on a single V100 GPU, comparing our method with other multi-modal generation methods in Tab. 7. Thanks to our unified U-Net design, IDOL requires the fewest FLOPs, has the lowest number of trainable parameters, and the shortest inference time, demonstrating our efficiency. + +# 5 Conclusion + +In this paper, we propose IDOL, a framework tailed for human-centric joint video-depth generation. Our proposed unified dual-modal U-Net improves the video and depth synthesis by implicit video structure learning, with cross-modal attention explicitly bridging the joint video-depth denoising process. Our motion consistency loss and cross-attention map consistency loss promote spatial alignment between the generated video and depth. Extensive experiments on the TikTok and NTU120 datasets show our superior performance compared with existing methods, and the adaption ability to different kinds of depth maps. Our IDOL is also able to generalize to different motion representations and pose control modules. + +Limitations. Despite the performance advantage of our IDOL, it faces several major limitations. First, the computational demands of processing dual-modal data, particularly at high resolutions, hinder its suitability for real-time applications, highlighting a need for further optimization. Additionally, the reliance on high-quality depth maps for training limits its applicability in scenarios where such data is limited or of low quality. Addressing this, future work may explore unsupervised methods or data augmentation strategies to mitigate the data quality constraint. + +# Acknowledgements + +This work is supported in part by the Defense Advanced Research Projects Agency (DARPA) under Contract No. HR001120C0124. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the Defense Advanced Research Projects Agency (DARPA). + +# References + +1. Amit, T., Shaharbany, T., Nachmani, E., Wolf, L.: Segdiff: Image segmentation with diffusion probabilistic models. arXiv preprint arXiv:2112.00390 (2021) +2. Atapour-Abarghouei, A., Breckon, T.P.: Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer. In: CVPR. pp. 2800-2810 (2018) +3. Bae, J., Moon, S., Im, S.: Deep digging into the generalization of self-supervised monocular depth estimation. In: AAAI. vol. 37, pp. 187-196 (2023) +4. Balaji, Y., Min, M.R., Bai, B., Chellappa, R., Graf, H.P.: Conditional gan with discriminative filter generation for text-to-video synthesis. In: IJCAI. vol. 1, p. 2 (2019) +5. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models. arXiv preprint arXiv:2112.03126 (2021) +6. Brock, A., Donahue, J., Simonyan, K.: Large scale gan training for high fidelity natural image synthesis. arXiv preprint arXiv:1809.11096 (2018) +7. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: CVPR. pp. 7291-7299 (2017) +8. Chang, D., Shi, Y., Gao, Q., Fu, J., Xu, H., Song, G., Yan, Q., Yang, X., Soleymani, M.: Magicdance: Realistic human dance video generation with motions & facial expressions transfer. arXiv preprint arXiv:2311.12052 (2023) +9. Chen, S., Sun, P., Song, Y., Luo, P.: Diffusiondet: Diffusion model for object detection. In: ICCV. pp. 19830-19843 (2023) +10. Chen, T., Li, L., Saxena, S., Hinton, G., Fleet, D.J.: A generalist framework for panoptic segmentation of images and videos. In: ICCV. pp. 909-919 (2023) +1. Chen, W., Wu, J., Xie, P., Wu, H., Li, J., Xia, X., Xiao, X., Lin, L.: Control-a-video: Controllable text-to-video generation with diffusion models. arXiv preprint arXiv:2305.13840 (2023) +2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021) +3. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. In: ICCV. pp. 7346-7356 (2023) +4. Fu, J., Li, S., Jiang, Y., Lin, K.Y., Qian, C., Loy, C.C., Wu, W., Liu, Z.: Stylegan-human: A data-centric odyssey of human generation. In: ECCV. pp. 1-19 (2022) +5. Ge, Y., Zhang, R., Wang, X., Tang, X., Luo, P.: Deepfashion2: A versatile benchmark for detection, pose estimation, segmentation and re-identification of clothing images In: CVPR. pp. 5337-5345 (2019) +6. Geyer, M., Bar-Tal, O., Bagon, S., Dekel, T.: Tokenflow: Consistent diffusion features for consistent video editing. arXiv preprint arXiv:2307.10373 (2023) + +17. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020) +18. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. pp. 11808-11826 (2023) +19. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: CVPR. pp. 7297-7306 (2018) +20. Guo, Y., Yang, C., Rao, A., Wang, Y., Qiao, Y., Lin, D., Dai, B.: Animatediff: animate your personalized text-to-image diffusion models without specific tuning. arXiv preprint arXiv:2307.04725 (2023) +21. Ha, S., Kersner, M., Kim, B., Seo, S., Kim, D.: Marionette: Few-shot face reenactment preserving identity of unseen targets. In: AAAI. vol. 34, pp. 10893-10900 (2020) +22. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022) +23. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. NeurIPS 30 (2017) +24. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. NeurIPS 33, 6840-6851 (2020) +25. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023) +26. Hu, Z., Xu, D.: Videocontrolnet: A motion-guided video-to-video translation framework by using diffusion model with controlnet. arXiv preprint arXiv:2307.14073 (2023) +27. Jafarian, Y., Park, H.S.: Learning high fidelity depths of dressed humans by watching social media dance videos. In: CVPR. pp. 12753-12762 (2021) +28. Ji, Y., Chen, Z., Xie, E., Hong, L., Liu, X., Liu, Z., Lu, T., Li, Z., Luo, P.: Ddp: Diffusion model for dense visual prediction. arXiv preprint arXiv:2303.17559 (2023) +29. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. arXiv preprint arXiv:2304.04269 (2023) +30. Karras, J., Holynski, A., Wang, T.C., Kemelmacher-Shlizerman, I.: Dreampose: Fashion image-to-video synthesis via stable diffusion. arXiv preprint arXiv:2304.06025 (2023) +31. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023) +32. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) +33. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: CVPR. pp. 22511-22521 (2023) +34. Lin, K., Wang, L., Liu, Z.: End-to-end human pose and mesh reconstruction with transformers. In: CVPR. pp. 1954-1963 (2021) +35. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014) + +36. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: Ntu rgb+ d 120: A large-scale benchmark for 3d human activity understanding. IEEE TPAMI 42(10), 2684-2701 (2019) +37. Liu, S., Zeng, Z., Ren, T., Li, F., Zhang, H., Yang, J., Li, C., Yang, J., Su, H., Zhu, J., et al.: Grounding dino: Marrying dino with grounded pre-training for open-set object detection. arXiv preprint arXiv:2303.05499 (2023) +38. Liu, X., Ren, J., Siarohin, A., Skorokhodov, I., Li, Y., Lin, D., Liu, X., Liu, Z., Tulyakov, S.: Hyperhuman: Hyper-realistic human generation with latent structural diffusion. arXiv preprint arXiv:2310.08579 (2023) +39. Luan, T., Li, Z., Chen, L., Gong, X., Chen, L., Xu, Y., Yuan, J.: Spectrum auc difference (saucd): Human-aligned 3d shape evaluation. In: CVPR. pp. 20155-20164 (2024) +40. Luan, T., Wang, Y., Zhang, J., Wang, Z., Zhou, Z., Qiao, Y.: Pc-hmr: Pose calibration for 3d human mesh recovery from 2d images/videos. In: AAAI (2021) +41. Luan, T., Zhai, Y., Meng, J., Li, Z., Chen, Z., Xu, Y., Yuan, J.: High fidelity 3d hand shape reconstruction via scalable graph frequency decomposition. In: CVPR. pp. 16795-16804 (2023) +42. Ma, Y., He, Y., Cun, X., Wang, X., Shan, Y., Li, X., Chen, Q.: Follow your pose: Pose-guided text-to-video generation using pose-free videos. arXiv preprint arXiv:2304.01186 (2023) +43. Mallya, A., Wang, T.C., Liu, M.Y.: Implicit warping for animation with image sets. NeurIPS 35, 22438-22450 (2022) +44. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: CVPR. pp. 6038-6047 (2023) +45. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023) +46. Nichol, A., Jun, H., Dhariwal, P., Mishkin, P., Chen, M.: Point-e: A system for generating 3d point clouds from complex prompts. arXiv preprint arXiv:2212.08751 (2022) +47. Nirkin, Y., Keller, Y., Hassner, T.: Fsgan: Subject agnostic face swapping and reenactment. In: ICCV. pp. 7184-7193 (2019) +48. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022) +49. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023) +50. Qian, S., Lin, K.Y., Wu, W., Liu, Y., Wang, Q., Shen, F., Qian, C., He, R.: Make a face: Towards arbitrary high fidelity face manipulation. In: ICCV. pp. 10033-10042 (2019) +51. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. pp. 8748-8763 (2021) +52. Raj, A., Kaza, S., Poole, B., Niemeyer, M., Ruiz, N., Mildenhall, B., Zada, S., Aberman, K., Rubinstein, M., Barron, J., et al.: Dreambooth3d: Subject-driven text-to-3d generation. arXiv preprint arXiv:2303.13508 (2023) +53. Ranftl, R., Bochkovskiy, A., Koltun, V.: Vision transformers for dense prediction. In: ICCV. pp. 12179-12188 (2021) + +54. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE TPAMI 44(3), 1623-1637 (2020) +55. Reda, F., Kontkanen, J., Tabellion, E., Sun, D., Pantofaru, C., Curless, B.: Film: Frame interpolation for large motion. In: ECCV. pp. 250-266. Springer (2022) +56. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022) +57. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241 (2015) +58. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: CVPR. pp. 10219-10228 (2023) +59. Saxena, S., Kar, A., Norouzi, M., Fleet, D.J.: Monocular depth estimation using diffusion models. arXiv preprint arXiv:2302.14816 (2023) +60. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021) +61. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: Ntu $\mathrm{rgb + }$ d: A large scale dataset for 3d human activity analysis. In: CVPR. pp. 1010-1019 (2016) +62. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: Animating arbitrary objects via deep motion transfer. In: CVPR (2019) +63. Siarohin, A., Woodford, O.J., Ren, J., Chai, M., Tulyakov, S.: Motion representations for articulated animation. In: CVPR (2021) +64. Stan, G.B.M., Wofk, D., Fox, S., Redden, A., Saxton, W., Yu, J., Aflalo, E., Tseng, S.Y., Nonato, F., Muller, M., et al.: Ldm3d: Latent diffusion model for 3d. arXiv preprint arXiv:2305.10853 (2023) +65. Tang, H., Wang, W., Xu, D., Yan, Y., Sebe, N.: Gestureegan for hand gesture-to-gesture translation in the wild. In: ACM MM. pp. 774-782 (2018) +66. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. In: CVPR. pp. 1921-1930 (2023) +67. Unterthiner, T., Van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018) +68. Wang, T., Li, L., Lin, K., Zhai, Y., Lin, C.C., Yang, Z., Zhang, H., Liu, Z., Wang, L.: Disco: Disentangled control for referring human dance generation in real world. In: CVPR (2024) +69. Watson, D., Chan, W., Martin-Brualla, R., Ho, J., Tagliasacchi, A., Norouzi, M.: Novel view synthesis with diffusion models. arXiv preprint arXiv:2210.04628 (2022) +70. Wiles, O., Koepke, A., Zisserman, A.: X2face: A network for controlling face generation using images, audio, and pose codes. In: ECCV. pp. 670-686 (2018) +71. Wolleb, J., Sandkuhler, R., Bieder, F., Valmaggia, P., Cattin, P.C.: Diffusion models for implicit image segmentation ensembles. In: International Conference on Medical Imaging with Deep Learning. pp. 1336-1348. PMLR (2022) +72. Wu, J., Fang, H., Zhang, Y., Yang, Y., Xu, Y.: Medsegdiff: Medical image segmentation with diffusion probabilistic model. arXiv preprint arXiv:2211.00611 (2022) +73. Wynn, J., Turmukhambetov, D.: Diffusionerf: Regularizing neural radiance fields with denoising diffusion models. In: CVPR. pp. 4180-4189 (2023) +74. Xu, Z., Zhang, J., Liew, J.H., Yan, H., Liu, J.W., Zhang, C., Feng, J., Shou, M.Z.: Magicanimate: Temporally consistent human image animation using diffusion model. arXiv preprint arXiv:2311.16498 (2023) + +75. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth anything: Unleashing the power of large-scale unlabeled data. In: CVPR (2024) +76. Yang, Z., Zeng, A., Yuan, C., Li, Y.: Effective whole-body pose estimation with two-stages distillation. In: ICCV. pp. 4210-4220 (2023) +77. Zakharov, E., Shysheya, A., Burkov, E., Lempitsky, V.: Few-shot adversarial learning of realistic neural talking head models. In: ICCV. pp. 9459-9468 (2019) +78. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV. pp. 3836-3847 (2023) +79. Zhao, J., Zhang, H.: Thin-plate spline motion model for image animation. In: CVPR (2022) +80. Zhao, S., Fu, H., Gong, M., Tao, D.: Geometry-aware symmetric domain adaptation for monocular depth estimation. In: CVPR. pp. 9788-9798 (2019) +81. Zheng, C., Cham, T.J., Cai, J.: T2net: Synthetic-to-realistic translation for solving single-image depth estimation tasks. In: ECCV. pp. 767-783 (2018) \ No newline at end of file diff --git a/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/images.zip b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..e8f24775aef483bdc533ac28afe2e8d1d0207672 --- /dev/null +++ b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7cda2be52907fb1259847ac283516f8cf15aeea7cea952eed15a3ae9f1f38db1 +size 567744 diff --git a/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/layout.json b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..68df1026f3ccbc19e95b1731da2d4c48a7d48254 --- /dev/null +++ b/2024/IDOL_ Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation/layout.json @@ -0,0 +1,10199 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 141, + 111, + 473, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 111, + 473, + 148 + ], + "spans": [ + { + "bbox": [ + 141, + 111, + 473, + 148 + ], + "type": "text", + "content": "IDOL: Unified Dual-Modal Latent Diffusion for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 136, + 167, + 477, + 205 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 167, + 477, + 205 + ], + "spans": [ + { + "bbox": [ + 136, + 167, + 477, + 205 + ], + "type": "text", + "content": "Yuanhao Zhai\\*1, Kevin Lin\\*2, Linjie Li\\*2, Chung-Ching Lin\\*2, Jianfeng Wang\\*2, Zhengyuan Yang\\*2, David Doermann\\*1, Junsong Yuan\\*1, Zicheng Liu\\*3, and Lijuan Wang\\*2" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 220, + 213, + 393, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 213, + 393, + 224 + ], + "spans": [ + { + "bbox": [ + 220, + 213, + 393, + 224 + ], + "type": "text", + "content": "1 State University of New York at Buffalo" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 282, + 224, + 331, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 282, + 224, + 331, + 234 + ], + "spans": [ + { + "bbox": [ + 282, + 224, + 331, + 234 + ], + "type": "text", + "content": "2 Microsoft" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 251, + 235, + 361, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 251, + 235, + 361, + 246 + ], + "spans": [ + { + "bbox": [ + 251, + 235, + 361, + 246 + ], + "type": "text", + "content": "3 Advanced Micro Devices" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 235, + 247, + 378, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 247, + 378, + 258 + ], + "spans": [ + { + "bbox": [ + 235, + 247, + 378, + 258 + ], + "type": "text", + "content": "https://yhzhai.github.io/idol/" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 287, + 455, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 287, + 455, + 518 + ], + "spans": [ + { + "bbox": [ + 159, + 287, + 455, + 518 + ], + "type": "text", + "content": "Abstract. Significant advances have been made in human-centric video generation, yet the joint video-depth generation problem remains under-explored. Most existing monocular depth estimation methods may not generalize well to synthesized images or videos, and multi-view-based methods have difficulty controlling the human appearance and motion. In this work, we present IDOL (unIfied Dual-mOdal Latent diffusion) for high-quality human-centric joint video-depth generation. Our IDOL consists of two novel designs. First, to enable dual-modal generation and maximize the information exchange between video and depth generation, we propose a unified dual-modal U-Net, a parameter-sharing framework for joint video and depth denoising, wherein a modality label guides the denoising target, and cross-modal attention enables the mutual information flow. Second, to ensure a precise video-depth spatial alignment, we propose a motion consistency loss that enforces consistency between the video and depth feature motion fields, leading to harmonized outputs. Additionally, a cross-attention map consistency loss is applied to align the cross-attention map of the video denoising with that of the depth denoising, further facilitating spatial alignment. Extensive experiments on the TikTok and NTU120 datasets show our superior performance, significantly surpassing existing methods in terms of video FVD and depth accuracy." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 538, + 230, + 551 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 538, + 230, + 551 + ], + "spans": [ + { + "bbox": [ + 132, + 538, + 230, + 551 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "content": "The capacity to control and manipulate human-centric video content – modulating subjects' actions, altering appearance and background – has attracted continual study [29, 42, 62, 63, 68]. With the rapid evolution of generative models, from generative adversarial networks [6, 17] to recent latent diffusion models [56], the quality of the generated video has improved significantly. However, most of the existing research [29, 42, 62, 63, 68] has focused on the generation of 2D content. This imposes a natural limit on applications that require depth perception," + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 329, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 329, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 329, + 665 + ], + "type": "text", + "content": "* Work done during an internship at Microsoft." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 116, + 481, + 206 + ], + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 206 + ], + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 206 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 206 + ], + "type": "image", + "image_path": "9a4d73b05969ea5ce6b96d69e3e1623f840a09fb4a37e15cdd835299ab987f86.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 213, + 482, + 247 + ], + "lines": [ + { + "bbox": [ + 132, + 213, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 213, + 482, + 247 + ], + "type": "text", + "content": "Fig. 1: Given a human foreground image, an arbitrary background image, and a defined pose sequence, our IDOL generates high-fidelity video and the corresponding depth maps, which can be rendered as realistic 2.5D video." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 275, + 482, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 275, + 482, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 275, + 482, + 348 + ], + "type": "text", + "content": "such as virtual and augmented reality, as well as advanced video games. In this paper, we explore joint video-depth generation for human actions (e.g., dancing and daily activities), where the video and the corresponding depth map are simultaneously generated. By learning a holistic representation of the human, it not only enhances the visual fidelity of the synthesized content but also paves the way for applications that demand a deeper spatial understanding." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 350, + 482, + 458 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 458 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 458 + ], + "type": "text", + "content": "Existing methods confront several challenges in dealing with this task. First, discriminative monocular depth estimation methods [27, 54], which are typically trained on natural images, have been empirically observed to exhibit degraded performance when applied to generated images [2, 3, 80, 81]. On the other hand, while multi-view-based methods [18, 48, 52, 69, 73] can estimate depth, they primarily focus on the synthesis of individual object/scene. They often struggle with inference from single-view inputs or underperform in manipulating the object's appearance and motion. To address these problems, we propose to jointly generate the video and the corresponding depth." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 460, + 483, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 483, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 483, + 639 + ], + "type": "text", + "content": "However, joint video-depth generation presents nontrivial challenges for two primary reasons. First, video and depth are inherently two different modalities: the former is represented as a 3-channel RGB frame sequence and the latter as a scalar depth map sequence [53,54]. Contrarily, prevailing diffusion models are pre-trained on the single-modal image generation task [56]. Thus, designing a dual-modal diffusion model for joint video-depth generation is challenging, not to mention harnessing the power of pre-trained latent diffusion models. Second, spatial layout control has been a long-standing problem in diffusion models [16,22,44,66]. Even with human pose control, maintaining an accurate spatial alignment between the generated video and depth remains a challenge. This challenge can be more pronounced if the denoising process is conducted in the latent space, given the intricate mapping from the latent space to the final output. In addressing these problems, we propose IDOL (unIfied Dual-mOdal Latent diffusion), a framework that aims to generate a human-centric video and the corresponding depth jointly." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": "To tackle the problem of distinct video and depth representations, we propose to render depth maps as RGB images by applying a color map to them. This" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "type": "text", + "content": "conversion reframes the depth generation task as a stylized video generation problem. Besides, existing methods suggest that incorporating depth as input enhances structural understanding and boosts the generation quality [13]. Drawing inspiration from this, we hypothesize that a richer interplay between depth and video generation would be reciprocally beneficial. To this aim, we design a unified dual-modal U-Net that shares parameters across both video and depth denoising processes. Our model leverages a modality label to specify the denoising target, i.e., video or depth. In this way, it enables joint learning of depth and video for better generation quality while remaining parameter-efficient. Furthermore, a cross-modal attention layer is added during the joint denoising process, enabling an explicit correlation between the joint video-depth learning." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 248, + 482, + 379 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 379 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 379 + ], + "type": "text", + "content": "To ensure a precise video-depth alignment, we propose to synchronize the motion pattern of the intermediate video and depth features. Specifically, the intermediate video and depth features within the U-Net contain semantic information, where regions with similar semantic meanings are represented with similar features [5,16,66], as shown in Fig. 3. Thus, by using the proposed motion consistency loss, we enforce a consistent motion between video and depth features, thereby promoting a precise video-depth spatial alignment. Additionally, we propose a cross-attention map consistency loss to further strengthen video-depth alignment. This is drawn inspiration from existing observations [22,49] on the influence of cross-attention maps on the spatial layout. Different from [22,49], we consider spatial alignment across video and depth modalities." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 380, + 347, + 391 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 380, + 347, + 391 + ], + "spans": [ + { + "bbox": [ + 146, + 380, + 347, + 391 + ], + "type": "text", + "content": "In summary, our contributions are as follows." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 397, + 482, + 540 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 397, + 481, + 444 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 397, + 481, + 444 + ], + "spans": [ + { + "bbox": [ + 138, + 397, + 481, + 444 + ], + "type": "text", + "content": "- We propose IDOL, a pioneering framework for human-centric joint video-depth generation. Our IDOL features a parameter-sharing unified dual-modal U-Net for video-depth denoising. Besides, cross-modal attention modules are used to enable the mutual information flow." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 445, + 481, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 445, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 445, + 481, + 468 + ], + "type": "text", + "content": "- We propose a motion consistency loss and a cross-attention map consistency loss to allow fine-grained video-depth spatial alignment." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 468, + 482, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 482, + 540 + ], + "type": "text", + "content": "- We conduct extensive experiments on two distinct datasets: TikTok and NTU120, whose depth maps were obtained using different methods [27,53,54]. The results not only show a significant improvement in video quality and depth accuracy over state-of-the-art methods, but also highlight the flexibility of our method in adapting to different depth maps. Furthermore, our experiments reveal that our IDOL can be easily adapted to different diffusion models." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 557, + 237, + 570 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 237, + 570 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 237, + 570 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Controllable diffusion models. Evolving from early diffusion models [12, 24], recent latent diffusion models (LDM) [56] achieves high-quality image generation by conducting the denoising process in the latent space. ControlNet [78], GLIGEN [33] and T2I-Adapter [45] add trainable modules on pre-trained diffusion models, and achieve fine-grained control given additional inputs, such as sketch and depth. HumanSD [29] directly concatenates the pose feature and the noise in the input to avoid potential feature discrepancy problems. In the" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "video generation domain, controllable video diffusion models [11,26,42] leverage the depth/flow/edge sequence to generate a temporally consistent video. Our work builds upon these controllable models, utilizing plug-in modules to facilitate human pose control in IDOL. Our experiments demonstrate our adaptability across various frameworks (e.g., ControlNet [78] and T2I-Adapter [45])." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 179, + 483, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 179, + 483, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 179, + 483, + 407 + ], + "type": "text", + "content": "Image animation. Image animation involves producing a video wherein an object from the source image moves in congruence with the motion in a target video. Traditional methods require specific knowledge about the target object, such as facial landmarks [21, 50, 77], gestures [65], or semantic segmentation maps [47]. Several methods learn a motion field [62, 70] from the driving videos. First order motion model (FOMM) [62] improves the animation quality by learning a local affine transformation. Motion representation for articulated animation (MRAA) [63] achieves better quality in representing articulated motions, such as the human body. Thin-plate spline (TPS) [79] estimates a more accurate motion, and improves previous methods over large-scale motions. Besides, there exists a line of methods [43, 55] exploiting end-to-end learning frameworks. Based on diffusion models, DreamPose [30] proposes an adapter module, such as to control the appearance of the generated human. DisCo [68] disentangles the human attribute and pose condition learning by employing a two-stage training scheme. Several concurrent works improve DisCo [68] using more advanced appearance and motion control [8, 25, 74]. Furthermore, several methods [31, 42] inject motion/pose prior to pre-trained text-to-image models. Distinctively, our IDOL focuses on the joint video-depth generation, and utilizes depth generation to enhance the overall quality of the animated video, instead of video-only generation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 411, + 483, + 590 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 483, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 483, + 590 + ], + "type": "text", + "content": "Multi-modality synthesis. There exists a line of diffusion models for view synthesis, such as diffusion models using multi-view images [18, 69, 73], point cloud [46], and text-to-3D models [48, 52]. There are also methods developed for human body mesh estimation [34, 39-41]. However, they may struggle with human-centric joint video-depth synthesis, as they typically require multi-view input or lack the ability to precisely control the appearance and motion of the target object/scene. Except for the use of multi-view images, LDM3D [64] modifies the autoencoder in LDM, such that the latent can be decoded into an RGB image and a depth map. MM-Diffusion [58] focuses on the audio-video generation, and features a coupled U-Net structure to simultaneously denoise video and audio latents. Concurrently, HyperHuman [38] proposes structural expert branches to denoise latents of different modalities, such as RGB image, depth and surface normal. To the best of our knowledge, there is no existing method directly working on the joint video-depth generation task, and thus, we modify the backbones of existing multi-modal generation methods for comparison." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": "Diffusion models for dense prediction. Diffusion models have been used in various dense prediction tasks, such as segmentation tasks [1, 5, 10, 28, 71, 72], depth estimation [28, 59] and object detection [9]. For depth estimation methods [28, 59], they typically necessitate modifying the output from 3-channel RGB images to scalar depth maps. Such a transformation impedes their ability to harness the power of large-scale pre-trained diffusion models [56]. Concurrently," + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 113, + 316, + 223 + ], + "blocks": [ + { + "bbox": [ + 132, + 113, + 316, + 223 + ], + "lines": [ + { + "bbox": [ + 132, + 113, + 316, + 223 + ], + "spans": [ + { + "bbox": [ + 132, + 113, + 316, + 223 + ], + "type": "image", + "image_path": "f3be8cd5a36e0aa17d9523a45ea60ed4ddbae20efa317a6ee959e057d63d05a5.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "lines": [ + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "text", + "content": "Fig. 2: Left: Overall model architecture. Our IDOL features a unified dual-modal U-Net (gray boxes), a parameter-sharing design for joint video-depth denoising, wherein the denoising target is controlled by a one-hot modality label (" + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "inline_equation", + "content": "y_{\\mathrm{v}}" + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "text", + "content": " for video and " + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "inline_equation", + "content": "y_{\\mathrm{d}}" + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "text", + "content": " for depth). Right: Individual U-Net block structure. Cross-modal attention is added to enable mutual information flow between video and depth features, with consistency loss terms " + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{mo}}" + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{xattn}}" + }, + { + "bbox": [ + 130, + 232, + 482, + 308 + ], + "type": "text", + "content": " ensuring the video-depth alignment. Skip connections are omitted for conciseness." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 320, + 117, + 481, + 221 + ], + "blocks": [ + { + "bbox": [ + 320, + 117, + 481, + 221 + ], + "lines": [ + { + "bbox": [ + 320, + 117, + 481, + 221 + ], + "spans": [ + { + "bbox": [ + 320, + 117, + 481, + 221 + ], + "type": "image", + "image_path": "b5f12c0e948ccfc60769db0d2b0c96f9018de2ba1b951ac5cd565bead317633d.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 333, + 481, + 405 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 333, + 481, + 405 + ], + "spans": [ + { + "bbox": [ + 130, + 333, + 481, + 405 + ], + "type": "text", + "content": "Depth Anything [75] address this problem by leveraging large-scale unlabeled data to improve the estimation quality. Additionally, when applied to synthesized content, existing depth estimation methods tend to underperform [2,3,80,81], failing to generate high-quality depth maps from outputs of image animation methods. To mitigate this problem, we propose IDOL to directly synthesize the video and the corresponding depth, significantly improving the depth accuracy." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 406, + 481, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 481, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 481, + 477 + ], + "type": "text", + "content": "In contrast to existing methods, we reframe the depth synthesis task as a stylized image synthesis task. By rendering target depths as RGB images, we are positioned to directly use pre-trained image generation models with minimal modifications. Furthermore, we propose a unified dual-modal U-Net for improved joint video-depth generation, and enhance video-depth spatial alignment via the proposed consistency losses." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 496, + 201, + 509 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 496, + 201, + 509 + ], + "spans": [ + { + "bbox": [ + 132, + 496, + 201, + 509 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": "Problem formulation. We begin by formally defining the task of human-centric joint video-depth generation. Given a human foreground image " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": ", a background image " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "b" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": ", and a pose sequence " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "p = \\{p_1, p_2, \\dots, p_L\\}" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": " of length " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": ", our objective is to generate a video " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "v = \\{v_1, v_2, \\dots, v_L\\}" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": " and the associated depth map sequence " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "d = \\{d_1, d_2, \\dots, d_L\\}" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": ". The video " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": " should faithfully animate the human foreground " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": " into the target pose " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": " while integrating it with the background " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "b" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": ". The depth map sequence " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": " should correctly represent the depth within the video " + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 130, + 521, + 481, + 616 + ], + "type": "text", + "content": ". An illustration is shown in Fig. 1." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "text", + "content": "Preliminaries. Latent diffusion models (LDM) [56] recently show great success in image generation. It operates in the latent space of a pre-trained autoencoder " + }, + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{D}(\\mathcal{E}(\\cdot))" + }, + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "text", + "content": ", where a time-conditioned U-Net [57] " + }, + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(\\cdot)" + }, + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "text", + "content": " with learnable parameter " + }, + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 617, + 481, + 666 + ], + "type": "text", + "content": " is used for denoising the latent feature. Within the U-Net, the conditional signal" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": " (e.g., textual prompt) is fed in the cross-attention module after CLIP [51] encoding. During training, the objective is the mean square error (MSE) between the predicted and ground truth noise:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 240, + 162, + 481, + 175 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 240, + 162, + 481, + 175 + ], + "spans": [ + { + "bbox": [ + 240, + 162, + 481, + 175 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathbb {E} _ {v, \\epsilon , t, c} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, c) \\| _ {2} ^ {2} \\right], \\tag {1}", + "image_path": "db670371354d07eb71fe2cef30c6523cf48de3fb3ee2d2dbe23084511cc1adbc.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "inline_equation", + "content": "\\epsilon \\in \\mathcal{N}(0,I)" + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "text", + "content": " is the ground truth noise, and " + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "text", + "content": " is the noisy latent at the " + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "text", + "content": "-th reverse step, and can be obtained from " + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(v)" + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 183, + 482, + 269 + ], + "type": "text", + "content": " [24]. To enable spatial layout control, ControlNet [78] adds a copy of the U-Net down and middle blocks upon the LDM. The output of ControlNet is added to the original U-Net via skip connections. By manipulating the intermediate features, ControlNet trained with additional conditional input (poses in our case) can control the output image/video [68]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 286, + 293, + 297 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 286, + 293, + 297 + ], + "spans": [ + { + "bbox": [ + 132, + 286, + 293, + 297 + ], + "type": "text", + "content": "3.1 Unified dual-modal U-Net" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 306, + 482, + 402 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 306, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 306, + 482, + 402 + ], + "type": "text", + "content": "Video and depth are different modalities and typically have distinct representations. Designing a model architecture that can jointly generate both video and depth, and potentially leverage pre-trained diffusion models, presents a significant challenge. In addressing this problem, we propose to reformulate depth synthesis as a stylized image generation task. By rendering the depth map as a heatmap, we bridge the gap between the video and depth modalities. To further harness this approach, we introduce a unified dual-modal U-Net, specially tailored for the joint video-depth denoising." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "text", + "content": "Video LDM baseline. We build our model upon 3D U-Net [13], which modifies the 2D U-Net [56] by adding a temporal convolutional layer in the ResBlock, and adding a temporal attention layer after the spatial attention within each block. For the human appearance and pose control, we follow DisCo [68] to feed the CLIP foreground latent " + }, + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathrm{CLIP}(f)" + }, + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "text", + "content": " via cross-attention, and feed the pose latent " + }, + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(p)" + }, + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "text", + "content": " via a ControlNet to the U-Net. We show in Sec. 4.1 that our method can be implemented on different pose control modules, such as T2I-Adapter [45]. For the background control, different from DisCo that leverages a ControlNet, we find that adding the background latent " + }, + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(b)" + }, + { + "bbox": [ + 130, + 402, + 482, + 533 + ], + "type": "text", + "content": " to the input noise of the U-Net not only yields comparable results but also reduces the number of parameters. The proposed model architecture is illustrated in Fig. 2." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Sharing U-Net for joint video-depth denoising. Existing methods [13] have shown that incorporating depth map as conditional input enhances the model's video structure awareness, improving the video generation quality. Building on this insight, we hypothesize that maximizing the information exchange between video and depth during generation can benefit the generation quality for both modalities. Thus, we propose a unified dual-modal U-Net for video and depth denoising, where the architecture and parameters of the U-Net and ControlNet are shared between the two modalities. To indicate the denoising modality, we add a learnable modality embedding to the time step embedding, which is fed to all blocks within the U-Net and the ControlNet, as shown in Fig. 2 right. In this way, given a one-hot modality label, the corresponding modality embedding will" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 101 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "be selected to feed into the model and further control the output modality. Apart from being parameter-efficient, we find that this unified architecture improves both video and depth generation quality (Sec. 4.2)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 482, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 482, + 247 + ], + "type": "text", + "content": "Cross-modal attention. Though the unified dual-modal U-Net enables implicit structural information learning, direct information communication during the video and depth denoising process is needed for better alignment. Thus, we add a multi-modality attention at the end of each block (Fig. 2 right). During the joint video-depth denoising process, the video and depth features are concatenated to conduct spatial self-attention. Note that self-attention is only performed in the spatial dimension, as it aims to promote spatial alignment between video and depth, and the preceding temporal layers already ensure the temporal smoothness." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 248, + 380, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 248, + 380, + 260 + ], + "spans": [ + { + "bbox": [ + 146, + 248, + 380, + 260 + ], + "type": "text", + "content": "The joint video-depth denoising objective " + }, + { + "bbox": [ + 146, + 248, + 380, + 260 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{denoise}}" + }, + { + "bbox": [ + 146, + 248, + 380, + 260 + ], + "type": "text", + "content": " is:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 188, + 269, + 480, + 300 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 188, + 269, + 480, + 300 + ], + "spans": [ + { + "bbox": [ + 188, + 269, + 480, + 300 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} _ {\\mathrm {d e n o i s e}} = \\mathbb {E} _ {v, d, \\epsilon_ {\\mathrm {v}}, \\epsilon_ {\\mathrm {d}}, t, f, b, p} \\big [ \\| \\epsilon_ {\\mathrm {v}} - \\epsilon_ {\\theta} (z _ {\\mathrm {v}, t}, t, f, b, p; y _ {\\mathrm {v}}) \\| _ {2} ^ {2} + \\\\ \\begin{array}{l} \\left\\| c _ {V} - c _ {\\theta} \\left(z _ {V, t}, v, f, b, p, y _ {V}\\right) \\right\\| _ {2} ^ {2} + \\\\ \\left\\| \\epsilon_ {d} - \\epsilon_ {\\theta} \\left(z _ {d, t}, t, f, b, p; y _ {d}\\right) \\right\\| _ {2} ^ {2} ], \\end{array} \\tag {2} \\\\ \\end{array}", + "image_path": "56b8ef974769e37061dbd1cd517f31e644ddf8041fd2855dc5c6ca10d97f9535.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "spans": [ + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "inline_equation", + "content": "y_{\\mathrm{v}}" + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "inline_equation", + "content": "y_{\\mathrm{d}}" + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "text", + "content": " are the modality labels for video and depth, respectively, " + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\mathrm{v}}, \\epsilon_{\\mathrm{d}} \\in \\mathcal{N}(0, I)" + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "text", + "content": " are independently sampled Gaussian noises, and " + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "inline_equation", + "content": "f, b, p" + }, + { + "bbox": [ + 131, + 308, + 482, + 367 + ], + "type": "text", + "content": " denote the human foreground image, the background image, and the target pose sequence, respectively. In Eq. (2), the first term is the video denoising loss and the second term is the depth denoising loss." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 386, + 328, + 399 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 328, + 399 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 328, + 399 + ], + "type": "text", + "content": "3.2 Learning video-depth consistency" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "text", + "content": "Though the pose control ensures the coarse correspondence between the video and depth, we empirically find that only applying the joint denoising objective " + }, + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{denoise}}" + }, + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "text", + "content": " may still lead to misalignment between the generated video and depth, especially when the training data is limited, as shown in the first column of Fig. 3. To promote a precise video-depth alignment, we propose a motion consistency loss " + }, + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{mo}}" + }, + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "text", + "content": " and a cross-attention map consistency loss " + }, + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{xattn}}" + }, + { + "bbox": [ + 130, + 407, + 482, + 479 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 479, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 574 + ], + "type": "text", + "content": "Motion consistency loss. In image diffusion models, the intermediate self-attention features in the U-Net are found to contain semantic information [5,16,66]. We found this finding also holds in our video-depth diffusion model. However, though video and depth features share similar layouts, they may differ in the temporal motion, as illustrated in Fig. 3. Thus, we attribute the video-depth misalignment to the unsynchronized motion between video and depth features. To address this problem, we propose to enforce a synchronized motion between the video and depth features via a motion consistency loss " + }, + { + "bbox": [ + 130, + 479, + 482, + 574 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{mo}}" + }, + { + "bbox": [ + 130, + 479, + 482, + 574 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "spans": [ + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "text", + "content": "Specifically, given intermediate video self-attention feature maps at frame " + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "inline_equation", + "content": "l" + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "inline_equation", + "content": "l + 1" + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "text", + "content": ": " + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "inline_equation", + "content": "F_{\\mathrm{v},l}, F_{\\mathrm{v},l + 1} \\in \\mathbb{R}^{H \\times W \\times D}" + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "text", + "content": ", their cost volume " + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "inline_equation", + "content": "C_{\\mathrm{v},l} \\in \\mathbb{R}^{H \\times W \\times H \\times W}" + }, + { + "bbox": [ + 130, + 575, + 482, + 621 + ], + "type": "text", + "content": " can be constructed by conducting cosine similarity between all point pairs on the two frames:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 244, + 624, + 480, + 636 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 624, + 480, + 636 + ], + "spans": [ + { + "bbox": [ + 244, + 624, + 480, + 636 + ], + "type": "interline_equation", + "content": "c _ {\\mathrm {v}, l, i, j, h, k} = f _ {\\mathrm {v}, l, i, j} \\cdot f _ {\\mathrm {v}, l + 1, h, k}, \\tag {3}", + "image_path": "884029e0cb6384060d9ea2d535e5a4e1e859ca7bad72201c350aee038b533e39.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "f_{\\mathrm{v},l,i,j}" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": " is the normalized feature vector on " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "F_{\\mathrm{v},l}" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": " at spatial location " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "i,j" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": ". The cost volume " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "C_{\\mathrm{d},r}" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": " for the depth feature maps can be computed in a similar way." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 112, + 482, + 235 + ], + "blocks": [ + { + "bbox": [ + 132, + 112, + 482, + 235 + ], + "lines": [ + { + "bbox": [ + 132, + 112, + 482, + 235 + ], + "spans": [ + { + "bbox": [ + 132, + 112, + 482, + 235 + ], + "type": "image", + "image_path": "77f92efe8efffde9042c3afd963e062060abe561071a99c83858b0363a21a869.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 240, + 309, + 361 + ], + "lines": [ + { + "bbox": [ + 132, + 240, + 309, + 361 + ], + "spans": [ + { + "bbox": [ + 132, + 240, + 309, + 361 + ], + "type": "text", + "content": "Fig. 3: Visualization of the video and depth feature maps and their motion fields without consistency losses. We attribute the inconsistent video-depth output (blue circle) to the inconsistent video-depth feature motions (the last row). This problem exists in multiples layers within the U-Net, and we randomly select two layers for visualization. We follow [66] to visualize the feature maps, and different color in the motion file indicates different moving direction." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 313, + 273, + 482, + 350 + ], + "angle": 0, + "lines": [ + { + "bbox": [ + 313, + 273, + 482, + 350 + ], + "spans": [ + { + "bbox": [ + 313, + 273, + 482, + 350 + ], + "type": "text", + "content": "Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem." + } + ] + } + ], + "index": 4, + "type": "text" + }, + { + "bbox": [ + 313, + 273, + 482, + 350 + ], + "angle": 0, + "lines": [ + { + "bbox": [ + 313, + 273, + 482, + 350 + ], + "spans": [ + { + "bbox": [ + 313, + 273, + 482, + 350 + ], + "type": "text", + "content": "Fig. 4: Comparison between human attribute pre-training (HAP) [68] and our human attribute outpainting pre-training (HAOP). HAP may result in an apparent background mask when the target pose deviates from the original position, while our HAOP mitigates this problem." + } + ] + } + ], + "index": 5, + "type": "text" + }, + { + "bbox": [ + 132, + 384, + 480, + 409 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 384, + 480, + 409 + ], + "spans": [ + { + "bbox": [ + 132, + 384, + 480, + 409 + ], + "type": "text", + "content": "As the video and depth features may be distributed differently, we further normalize the cost volume via softmax, resulting in a motion field " + }, + { + "bbox": [ + 132, + 384, + 480, + 409 + ], + "type": "inline_equation", + "content": "U_{\\mathrm{v},l}" + }, + { + "bbox": [ + 132, + 384, + 480, + 409 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 216, + 416, + 480, + 444 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 416, + 480, + 444 + ], + "spans": [ + { + "bbox": [ + 216, + 416, + 480, + 444 + ], + "type": "interline_equation", + "content": "u _ {\\mathrm {v}, l, i, j, h, k} = \\frac {\\exp \\left(c _ {\\mathrm {v} , l , i , j , h , k} / \\tau\\right)}{\\sum_ {h ^ {\\prime}} \\sum_ {k ^ {\\prime}} \\exp \\left(c _ {\\mathrm {v} , l , i , j , h ^ {\\prime} , k ^ {\\prime}} / \\tau\\right)}, \\tag {4}", + "image_path": "9afbc97b09dea580dc95541ad173b9fb05bac8a42ca6439810f95faed8933125.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 449, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 449, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 132, + 449, + 482, + 498 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 449, + 482, + 498 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 132, + 449, + 482, + 498 + ], + "type": "text", + "content": " is a temperature hyper-parameter controlling the concentration of the distribution. A high value on the motion field indicates a movement between two points. The motion consistency is achieved by minimizing the MSE loss between the video and depth motion fields:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 194, + 504, + 480, + 533 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 194, + 504, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 194, + 504, + 480, + 533 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {m o}} = \\frac {1}{L H W H W} \\sum_ {l, i, j, h, k} \\| u _ {\\mathrm {v}, l, i, j, h, k} - u _ {\\mathrm {d}, l, i, j, h, k} \\| _ {2} ^ {2}. \\tag {5}", + "image_path": "80f837efb505d1391301640b7381d7bcd58ed2a5f24afb2eaa1d1f853cfa9449.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 540, + 480, + 563 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 540, + 480, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 540, + 480, + 563 + ], + "type": "text", + "content": "By enforcing similar motion of video and depth features, it promotes a consistent video and depth output." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 564, + 480, + 624 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 564, + 480, + 624 + ], + "spans": [ + { + "bbox": [ + 132, + 564, + 480, + 624 + ], + "type": "text", + "content": "Cross-attention map consistency loss. Except for leveraging the self-attention feature, the cross-attention maps between the foreground image and the input noise are also found to be critical in the image layout control [22,49]. Thus, we additionally enforce the cross-attention maps from the video stream and the depth stream to be similar via an MSE loss " + }, + { + "bbox": [ + 132, + 564, + 480, + 624 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{xattn}}" + }, + { + "bbox": [ + 132, + 564, + 480, + 624 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 255, + 632, + 480, + 646 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 632, + 480, + 646 + ], + "spans": [ + { + "bbox": [ + 255, + 632, + 480, + 646 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {x a t t n}} = \\left\\| M _ {\\mathrm {v}} - M _ {\\mathrm {d}} \\right\\| _ {2} ^ {2}, \\tag {6}", + "image_path": "6a8076f85e037a20a388ae9ee589883f05a0e6c3bd6cc7f704d150bb6c07905b.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 653, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 653, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 653, + 481, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 653, + 481, + 666 + ], + "type": "inline_equation", + "content": "M_{\\mathrm{v}}" + }, + { + "bbox": [ + 132, + 653, + 481, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 653, + 481, + 666 + ], + "type": "inline_equation", + "content": "M_{\\mathrm{d}}" + }, + { + "bbox": [ + 132, + 653, + 481, + 666 + ], + "type": "text", + "content": " represent the video and depth cross-attention map, respectively." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "As the ControlNet fuses features in the U-Net up blocks, we apply the consistency loss terms only to the U-Net up blocks to efficiently learn the U-Net and the ControlNet. The overall training objective " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathcal{L}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " is defined as:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 202, + 162, + 481, + 194 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 162, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 202, + 162, + 481, + 194 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {\\text {d e n o i s e}} + \\sum_ {n = 1} ^ {N} \\left(w _ {\\mathrm {m o}} \\mathcal {L} _ {\\mathrm {m o}, n} + w _ {\\mathrm {x a t t n}} \\mathcal {L} _ {\\mathrm {x a t t n}, n}\\right), \\tag {7}", + "image_path": "dc45687569f1bc2f5f93801847ad8246236f1355ffd6a6852cd256e0e5bcd057.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "spans": [ + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "inline_equation", + "content": "w_{\\mathrm{mo}}" + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "inline_equation", + "content": "w_{\\mathrm{xattn}}" + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "content": " are weighting hyper-parameters, " + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "content": " is the number of up blocks, and " + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{mo},n}" + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{xattn},n}" + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "content": " are the motion consistency loss and the cross-attention map consistency loss on the " + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 202, + 482, + 239 + ], + "type": "text", + "content": "-th up block, respectively." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 256, + 371, + 269 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 256, + 371, + 269 + ], + "spans": [ + { + "bbox": [ + 131, + 256, + 371, + 269 + ], + "type": "text", + "content": "3.3 Human attribute outpainting pre-training" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 277, + 480, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 277, + 480, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 480, + 348 + ], + "type": "text", + "content": "To disentangle the pose and background control, DisCo [68] proposes a human attribute pre-training (HAP) task to learn human appearance. Specifically, HAP learns to reconstruct the whole image given human foreground and background images, with the pose ControlNet being removed, as shown in Fig. 4 top. However, we empirically find that such pre-training may lead to an apparent background mask when the target pose deviates from the original position." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 350, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 445 + ], + "type": "text", + "content": "To address this problem, we propose human attribute outpainting pre-training (HAOP). Our HAOP differs from HAP in two ways. First, HAOP extends the background mask through dilation, forcing the model to fill in the background around the foreground. Second, we apply a random crop and resize on the foreground image, prompting the model to extrapolate the partial human attributes. This process not only mitigates the background masking problem but also improves image synthesis, as demonstrated in Fig. 4 and validated in our ablation studies (Sec. 4.2). Formally, the pre-training learning objective is as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 198, + 454, + 480, + 468 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 198, + 454, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 198, + 454, + 480, + 468 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {H A O P}} = \\mathbb {E} _ {v, \\epsilon , t, f _ {\\mathrm {a u g}}, b _ {\\mathrm {a u g}}} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} \\left(z _ {t}, t, f _ {\\mathrm {a u g}}, b _ {\\mathrm {a u g}}\\right) \\| _ {2} ^ {2} \\right], \\tag {8}", + "image_path": "67b7f87102c265e31017312a073361035d5916f62e7d375b4373a0604edf8cae.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 476, + 482, + 512 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 476, + 482, + 512 + ], + "spans": [ + { + "bbox": [ + 130, + 476, + 482, + 512 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 476, + 482, + 512 + ], + "type": "inline_equation", + "content": "f_{\\mathrm{aug}}" + }, + { + "bbox": [ + 130, + 476, + 482, + 512 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 476, + 482, + 512 + ], + "type": "inline_equation", + "content": "b_{\\mathrm{aug}}" + }, + { + "bbox": [ + 130, + 476, + 482, + 512 + ], + "type": "text", + "content": " represent augmented foreground and background, respectively. Note that the pre-training does not require depth denoising, which significantly lowers the data demand." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 532, + 230, + 546 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 532, + 230, + 546 + ], + "spans": [ + { + "bbox": [ + 131, + 532, + 230, + 546 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": "Datasets. We train and evaluate on two public datasets: TikTok [27] and NTU120 [36,61]. The TikTok dataset consists of " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\sim 350" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": " human dancing videos. We follow DisCo [68] to use 335 videos for training, and use 10 videos for evaluation. The NTU120 dataset consists of daily activities videos, we select 588 videos for training and 72 videos for evaluation. The videos are cropped to center to the subject. We specifically ensure distinct subjects and backgrounds between training and evaluation, and select only certain subjects to better evaluate the generalization ability. Besides, we use Grounded-SAM [32,37] for the human foreground mask estimation, and follow ControlNet [78] to use OpenPose [7]" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 114, + 481, + 215 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 481, + 215 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 481, + 215 + ], + "type": "table", + "html": "
MethodMotion controlTikTokNTU120
VideoDepthImageVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓FID-FVD↓FVD↓L2↓FID↓
FOMM [62]38.36404.31-85.0340.341439.50-80.29
MRAA [63]Target video24.11306.49-54.4758.191441.79-97.07
TPS [79]29.20337.79-53.7837.421339.86-61.75
DreamPose [30]DensePose [19]52.62614.07-75.0880.11791.25-116.23
DisCo [68]20.75257.900.0975†39.0226.21458.920.0371†68.53
LDM3D [64]OpenPose [7]45.30553.030.063769.3671.11587.840.0650120.74
MM-Diffusion [58]48.92771.320.036768.4758.44504.050.0404102.77
IDOLOpenPose [7]17.86223.690.033636.0420.23314.820.031750.70
", + "image_path": "06a2a322eabd9be964ad00b12a072c73d8b0ef6289b41c66cb46bc39e0579447.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + }, + { + "bbox": [ + 130, + 217, + 482, + 270 + ], + "lines": [ + { + "bbox": [ + 130, + 217, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 217, + 482, + 270 + ], + "type": "text", + "content": "Table 1: Quantitative results comparison between our IDOL and existing methods on the TikTok and NTU120 datasets. The ground truth depth is estimated via HDNet [27]. \" " + }, + { + "bbox": [ + 130, + 217, + 482, + 270 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 217, + 482, + 270 + ], + "type": "text", + "content": " \" indicates incapable of generating depth map, \" " + }, + { + "bbox": [ + 130, + 217, + 482, + 270 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 217, + 482, + 270 + ], + "type": "text", + "content": " \" indicates the HDNet-inferred depth from the synthesized image. The best and the second best results are denoted in bold and underscored, respectively." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_footnote" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 310, + 482, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 310, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 310, + 482, + 407 + ], + "type": "text", + "content": "for human pose estimation. For the depth estimation, we leverage two different methods: HDNet [27] for high-fidelity depth estimation on the human foreground, where the background depth is set to a constant; MiDaS [53, 54] for the whole-frame depth estimation, which lacks details on the human foreground. The HDNet depth map is rendered by applying the \"hot\" colormap; the MiDaS depth map is rendered as grayscale images. For pre-training, we follow DisCo [68] to use " + }, + { + "bbox": [ + 130, + 310, + 482, + 407 + ], + "type": "inline_equation", + "content": "\\sim 700\\mathrm{k}" + }, + { + "bbox": [ + 130, + 310, + 482, + 407 + ], + "type": "text", + "content": " images from a combined dataset of TikTok [27], COCO [35], SHHQ [14], DeepFashion2 [15], and LAION [60]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 408, + 482, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 408, + 482, + 492 + ], + "spans": [ + { + "bbox": [ + 130, + 408, + 482, + 492 + ], + "type": "text", + "content": "Evaluation metrics. We separately evaluate the quality of the generated video and depth. For video quality evaluation, we follow DisCo [68] to use FID-FVD [4] and FVD [67] over every 8-frame snippet. For the evaluation of depth synthesis, for simplicity, we first scale the depth in the range " + }, + { + "bbox": [ + 130, + 408, + 482, + 492 + ], + "type": "inline_equation", + "content": "[0,1]" + }, + { + "bbox": [ + 130, + 408, + 482, + 492 + ], + "type": "text", + "content": ", and compute L2 distance between the ground truth depth4 and the generated depth. In addition to evaluating the generated video and depth, we further use FID [23] on the frames to measure the image quality." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "spans": [ + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": "Comparison methods. We adopt state-of-the-art image animation methods FOMM [62], MRAA [63], TPS [79], DreamPose [30], and DisCo [68] for the video and image quality comparison. As a pioneering method in human-centric joint video-depth generation, to our knowledge, there is no direct prior work for the joint video-depth generation quality comparison. Thus, we adapt the most relevant multi-modal generation methods (LDM3D [64] for text to image-depth and MM-Diffusion [58] for text to video-audio), modify their backbones to the same VideoLDM baseline as ours (Sec. 3.1) to enable appearance and pose control, and compare the joint video-depth generation results with them." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 134, + 620, + 482, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 620, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 620, + 482, + 665 + ], + "type": "text", + "content": "4 The depth evaluation is conducted on the synthesized depth and the depth estimated from the ground truth image instead of that estimated from the generated images. This is because we empirically find that the depth estimated from the generated image tends to be noisy (see Fig. 5 and Fig. 6)." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 481, + 304 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 304 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 304 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 304 + ], + "type": "image", + "image_path": "b702172df842a26278db2eaa3a9fbf2a09529b500916f4e4983538760772d24b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 310, + 482, + 365 + ], + "lines": [ + { + "bbox": [ + 130, + 310, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 310, + 482, + 365 + ], + "type": "text", + "content": "Fig. 5: Qualitative results comparison between TPS [79], DisCo [68], LDM3D [64], MM-Diffusion [58] and our IDOL on the TikTok and NTU120 datasets with HDNet estimated depth [27]. Note that TPS [79] is unable to generate depth, and the depth map for DisCo is estimated via HDNet on its generated frames. Please find video comparison in the supplementary material." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 391, + 224, + 402 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 391, + 224, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 391, + 224, + 402 + ], + "type": "text", + "content": "4.1 Main results" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 413, + 481, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 481, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 481, + 449 + ], + "type": "text", + "content": "In our experiments, we use the HDNet depth [27] by default for its high-fidelity human foreground depth estimation. We also train and evaluate on the MiDaS depth [53, 54] to demonstrate the generalization ability of our IDOL." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 449, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 628 + ], + "type": "text", + "content": "Comparison with the state-of-the-art. We compare IDOL with state-of-the-art methods on the TikTok and NTU120 datasets in Tab. 1, with the generated frame and depth visualized in Fig. 5. We make the following observations. (1) We outperform all competing motion transfer and video generation methods [30, 62, 63, 68, 79] in terms of both video and image quality. (2) When adapting multi-modal generation methods [58, 64] for human-centric joint video-depth generation, with the integration of the video LDM baseline (Sec. 3.1), IDOL consistently outperforms them across video, image, and depth metrics on both datasets, demonstrating the effectiveness of our method. (3) Applying HDNet depth estimation to the previous state-of-the-art DisCo generated frames leads to suboptimal results, with incomplete, fragmentary or overly simplistic estimations, as shown in Fig. 5. As the estimation result deviates from the ground truth, the HDNet results lead to a high depth L2, as listed in the DisCo row of Tab. 1. This finding indicates the limited generalization ability of monocular depth methods, and highlights the need for multi-modal generation approaches." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "content": "Comparison on synthesizing different types of depth map. Tab. 2 compares the results on using the MiDaS grayscale depth map [53, 54] for the joint video-depth generation. The results consistently show that our IDOL outperforms" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 116, + 301, + 199 + ], + "blocks": [ + { + "bbox": [ + 132, + 116, + 301, + 199 + ], + "lines": [ + { + "bbox": [ + 132, + 116, + 301, + 199 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 301, + 199 + ], + "type": "table", + "html": "
MethodVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
TikTokDisCo [68]20.75257.900.1758‡39.02
LDM3D [64]42.09529.430.064672.30
MM-Diffusion [58]52.37715.280.104070.09
IDOL19.01216.960.027139.76
NTU120DisCo [68]26.21458.920.0695‡68.53
LDM3D [64]77.04591.030.0244115.16
MM-Diffusion [58]73.47503.530.0260117.22
IDOL20.56439.630.021055.70
", + "image_path": "51a4650787d8f661d5a2d4b88761dda3217082085956af501bca4b3dde774605.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 306, + 125, + 361, + 156 + ], + "blocks": [ + { + "bbox": [ + 306, + 125, + 361, + 156 + ], + "lines": [ + { + "bbox": [ + 306, + 125, + 361, + 156 + ], + "spans": [ + { + "bbox": [ + 306, + 125, + 361, + 156 + ], + "type": "image", + "image_path": "eee27acbe36b0d0e7d4b898f05d464ab0b9c64c2f06d1528ac7bffe352748957.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 306, + 180, + 361, + 210 + ], + "blocks": [ + { + "bbox": [ + 306, + 180, + 361, + 210 + ], + "lines": [ + { + "bbox": [ + 306, + 180, + 361, + 210 + ], + "spans": [ + { + "bbox": [ + 306, + 180, + 361, + 210 + ], + "type": "image", + "image_path": "c41d8a161a0e359a56be8583c3ca1e3493a50747f6882e00183aa4dfe7926b61.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 365, + 114, + 481, + 235 + ], + "blocks": [ + { + "bbox": [ + 309, + 224, + 359, + 236 + ], + "lines": [ + { + "bbox": [ + 309, + 224, + 359, + 236 + ], + "spans": [ + { + "bbox": [ + 309, + 224, + 359, + 236 + ], + "type": "text", + "content": "Reference image Target pose" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 365, + 114, + 481, + 235 + ], + "lines": [ + { + "bbox": [ + 365, + 114, + 481, + 235 + ], + "spans": [ + { + "bbox": [ + 365, + 114, + 481, + 235 + ], + "type": "image", + "image_path": "a565573d72ac68762bbe260afec7a4955e5b52ac49e0e5005598bea2d3ae4f6b.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 244, + 480, + 278 + ], + "lines": [ + { + "bbox": [ + 304, + 244, + 480, + 278 + ], + "spans": [ + { + "bbox": [ + 304, + 244, + 480, + 278 + ], + "type": "text", + "content": "Fig. 6: Qualitative results comparison on MiDaS [53,54] grayscale whole-frame depth map generation." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 159, + 289, + 452, + 348 + ], + "blocks": [ + { + "bbox": [ + 132, + 209, + 301, + 275 + ], + "lines": [ + { + "bbox": [ + 132, + 209, + 301, + 275 + ], + "spans": [ + { + "bbox": [ + 132, + 209, + 301, + 275 + ], + "type": "text", + "content": "Table 2: Quantitative comparison between our method and existing methods on the TikTok and NTU120 datasets with MiDaS estimated depth [53,54]. \"‡\" indicates the MiDaS estimated depth from the synthesized image." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 159, + 289, + 452, + 348 + ], + "lines": [ + { + "bbox": [ + 159, + 289, + 452, + 348 + ], + "spans": [ + { + "bbox": [ + 159, + 289, + 452, + 348 + ], + "type": "table", + "html": "
Motion repr.Temporal modelingPose controlVideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
OpenPose [7]HandcraftedControlNet [78]17.86223.690.033636.04
OpenPose [7]AnimateDiff [20]ControlNet [78]19.58201.830.035033.14
DWPose [76]AnimateDiff [20]ControlNet [78]16.73179.200.024531.06
DWPose [76]AnimateDiff [20]T2I-Adapter [45]14.40188.160.019530.06
", + "image_path": "652f435b2d06f708aace9bfe1f41705d3cb750c5c909882f8520c787b2284a73.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 348, + 482, + 392 + ], + "lines": [ + { + "bbox": [ + 130, + 348, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 130, + 348, + 482, + 392 + ], + "type": "text", + "content": "Table 3: Quantitative result of our IDOL generalize to different motion representations, temporal modeling designs, and pose control module on TikTok [27] with HDNet depth [27]. The gray row indicates our default setting. Please find our supplementary material for additional implementation details." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 426, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 498 + ], + "type": "text", + "content": "existing multi-modal generation methods [58,64] in both video and depth quality. This further highlights IDOL's effectiveness and its adaptability to different types of depth maps. Additionally, as shown in the DisCo row of Fig. 6, applying MiDaS on the DisCo generated frames also yields suboptimal results, blurring the areas surrounding the human subject, and leads to poorer depth accuracy (measured by L2 norm) than that achieved by generative approaches." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "Generalization ability. Our IDOL follows DisCo [68] for setting the default motion representations (OpenPose [7]) and backbone architectures (ControlNet [78]). In Tab. 3 and Fig. 7, we further show that our IDOL can be easily adapted to other motion representations, temporal modeling modules, and pose control modules. First, IDOL can benefit from the motion prior from pre-trainedAnimateDiff [20] to improve the video quality. Besides, our IDOL can be conditioned to more fine-grained DWPose [76], which provides additional facial and hand keypoints, to improve the video and depth quality. Impressively, even when using OpenPose, which lacks hand keypoint as condition, IDOL effectively generates plausible human hands, demonstrating its robust human attribute learning capabilities. Furthermore, our IDOL can be implemented with different pose control modules, such as ControlNet [78] and T2I-Adapter [45], achieving similar quantitative and qualitative results. Such results demonstrate that our IDOL can be generalized to different design options." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 113, + 200, + 178 + ], + "blocks": [ + { + "bbox": [ + 133, + 113, + 200, + 178 + ], + "lines": [ + { + "bbox": [ + 133, + 113, + 200, + 178 + ], + "spans": [ + { + "bbox": [ + 133, + 113, + 200, + 178 + ], + "type": "image", + "image_path": "3ebad1a5126aef49fab8d2a5a1e59373a7b0aa52394c4fecd9b557c07eafc1d0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 178, + 200, + 248 + ], + "blocks": [ + { + "bbox": [ + 133, + 178, + 200, + 248 + ], + "lines": [ + { + "bbox": [ + 133, + 178, + 200, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 178, + 200, + 248 + ], + "type": "image", + "image_path": "0ff9e66f6046805ada1a8f623a7150f5364a8876f39f0bfcc8557942e1c1cabb.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 133, + 250, + 200, + 271 + ], + "lines": [ + { + "bbox": [ + 133, + 250, + 200, + 271 + ], + "spans": [ + { + "bbox": [ + 133, + 250, + 200, + 271 + ], + "type": "text", + "content": "Reference image & Target motion representation" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 202, + 113, + 305, + 178 + ], + "blocks": [ + { + "bbox": [ + 202, + 113, + 305, + 178 + ], + "lines": [ + { + "bbox": [ + 202, + 113, + 305, + 178 + ], + "spans": [ + { + "bbox": [ + 202, + 113, + 305, + 178 + ], + "type": "image", + "image_path": "da1baf164798d03cf11cf6c8e2b6cefc7bd94a6f510a7aef13c611ee2a1c3cd0.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 202, + 178, + 305, + 212 + ], + "blocks": [ + { + "bbox": [ + 202, + 178, + 305, + 212 + ], + "lines": [ + { + "bbox": [ + 202, + 178, + 305, + 212 + ], + "spans": [ + { + "bbox": [ + 202, + 178, + 305, + 212 + ], + "type": "image", + "image_path": "5539d45dc7ebfa130c47b66c97e05f8a9856df3f507f74f31eca03fee9e639cb.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 202, + 212, + 304, + 245 + ], + "blocks": [ + { + "bbox": [ + 202, + 212, + 304, + 245 + ], + "lines": [ + { + "bbox": [ + 202, + 212, + 304, + 245 + ], + "spans": [ + { + "bbox": [ + 202, + 212, + 304, + 245 + ], + "type": "image", + "image_path": "276e0e657dafa55b29bdd2b6c2a54b76352241b2e0cc927d9ab1a2aa612834cb.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 211, + 251, + 237, + 271 + ], + "lines": [ + { + "bbox": [ + 211, + 251, + 237, + 271 + ], + "spans": [ + { + "bbox": [ + 211, + 251, + 237, + 271 + ], + "type": "text", + "content": "OpenPose ControlNet (default)" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 242, + 252, + 302, + 271 + ], + "lines": [ + { + "bbox": [ + 242, + 252, + 302, + 271 + ], + "spans": [ + { + "bbox": [ + 242, + 252, + 302, + 271 + ], + "type": "text", + "content": "DWPose DWPose ControlNet T2I-Adapter" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 310, + 135, + 373, + 169 + ], + "blocks": [ + { + "bbox": [ + 310, + 135, + 373, + 169 + ], + "lines": [ + { + "bbox": [ + 310, + 135, + 373, + 169 + ], + "spans": [ + { + "bbox": [ + 310, + 135, + 373, + 169 + ], + "type": "image", + "image_path": "5afece29b1430a661451f34bc3307a421dddcb5d954ec0cea207c723f8a0c08a.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 310, + 198, + 373, + 232 + ], + "blocks": [ + { + "bbox": [ + 310, + 198, + 373, + 232 + ], + "lines": [ + { + "bbox": [ + 310, + 198, + 373, + 232 + ], + "spans": [ + { + "bbox": [ + 310, + 198, + 373, + 232 + ], + "type": "image", + "image_path": "4696bc0e773e35cc6d9ad1e5c3dc3191c0dcf41ec2c9a999d0908362df84a0a8.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 279, + 306, + 312 + ], + "lines": [ + { + "bbox": [ + 132, + 279, + 306, + 312 + ], + "spans": [ + { + "bbox": [ + 132, + 279, + 306, + 312 + ], + "type": "text", + "content": "Fig. 7: Qualitative results of our IDOL generalize to different motion representations and pose control modules." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 378, + 119, + 481, + 217 + ], + "blocks": [ + { + "bbox": [ + 378, + 119, + 481, + 217 + ], + "lines": [ + { + "bbox": [ + 378, + 119, + 481, + 217 + ], + "spans": [ + { + "bbox": [ + 378, + 119, + 481, + 217 + ], + "type": "image", + "image_path": "d89fefb444076440b4d7320c850f1c409cce8510c808e07f1cb4dc3d821f99a5.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 378, + 217, + 477, + 266 + ], + "blocks": [ + { + "bbox": [ + 314, + 251, + 370, + 264 + ], + "lines": [ + { + "bbox": [ + 314, + 251, + 370, + 264 + ], + "spans": [ + { + "bbox": [ + 314, + 251, + 370, + 264 + ], + "type": "text", + "content": "Reference image Target pose" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 378, + 217, + 477, + 266 + ], + "lines": [ + { + "bbox": [ + 378, + 217, + 477, + 266 + ], + "spans": [ + { + "bbox": [ + 378, + 217, + 477, + 266 + ], + "type": "image", + "image_path": "e10ff127018cb90fa7ae37f934f35b5543b9077956675cc39821527785258e54.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 308, + 274, + 482, + 307 + ], + "lines": [ + { + "bbox": [ + 308, + 274, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 308, + 274, + 482, + 307 + ], + "type": "text", + "content": "Fig. 8: Qualitative comparison between the baseline video LDM, unified dual-modal U-Net w/o and w/ consistency losses." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "table", + "bbox": [ + 132, + 325, + 325, + 361 + ], + "blocks": [ + { + "bbox": [ + 132, + 325, + 325, + 361 + ], + "lines": [ + { + "bbox": [ + 132, + 325, + 325, + 361 + ], + "spans": [ + { + "bbox": [ + 132, + 325, + 325, + 361 + ], + "type": "table", + "html": "
Settings#Param.VideoDepthImage
FID-FVD↓FVD↓L2↓FID↓
Sep. U-Net for joint denoise2 × 1.39B24.28282.500.082241.72
Share U-Net for joint denoise1.39B22.10272.370.036939.43
+ Cross-modal attn.1.41B19.28260.650.036039.01
", + "image_path": "19b4fd3e044076a763384f5358ff3758283b030a4ca53dccd320ebb6b3a92ff6.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "table_body" + } + ], + "index": 17 + }, + { + "type": "table", + "bbox": [ + 345, + 325, + 466, + 361 + ], + "blocks": [ + { + "bbox": [ + 132, + 361, + 325, + 394 + ], + "lines": [ + { + "bbox": [ + 132, + 361, + 325, + 394 + ], + "spans": [ + { + "bbox": [ + 132, + 361, + 325, + 394 + ], + "type": "text", + "content": "Table 4: Ablation study on the joint video-depth learning and the unified dual-modal U-Net design." + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 345, + 325, + 466, + 361 + ], + "lines": [ + { + "bbox": [ + 345, + 325, + 466, + 361 + ], + "spans": [ + { + "bbox": [ + 345, + 325, + 466, + 361 + ], + "type": "table", + "html": "
\\( {\\mathcal{L}}_{\\text{xatt }} \\)\\( {\\mathcal{L}}_{\\text{mo }} \\)VideoDepthImage
FID-FVD \\( \\downarrow \\)FVD \\( \\downarrow \\)L2 \\( \\downarrow \\)FID \\( \\downarrow \\)
19.29260.650.036039.01
✓19.29244.580.035137.89
✓✓17.86223.690.033636.04
", + "image_path": "d94813ee603b22c75d43b917a58c4f52729667a2c804266d8a1a6bea1e55d508.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "table_body" + } + ], + "index": 19 + }, + { + "bbox": [ + 329, + 361, + 482, + 394 + ], + "lines": [ + { + "bbox": [ + 329, + 361, + 482, + 394 + ], + "spans": [ + { + "bbox": [ + 329, + 361, + 482, + 394 + ], + "type": "text", + "content": "Table 5: Ablation study on the videodepth consistency loss functions " + }, + { + "bbox": [ + 329, + 361, + 482, + 394 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{mo}}" + }, + { + "bbox": [ + 329, + 361, + 482, + 394 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 329, + 361, + 482, + 394 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{xattn}}" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 429, + 243, + 440 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 429, + 243, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 429, + 243, + 440 + ], + "type": "text", + "content": "4.2 Ablation studies" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 130, + 449, + 481, + 497 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 481, + 497 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 481, + 497 + ], + "type": "text", + "content": "We conduct a set of ablation studies on the TikTok dataset [27] with HDNet depth [27] to demonstrate the effectiveness of our proposed method. These studies are conducted accumulatively, layering each component to assess its incremental impact on the overall performance." + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 130, + 498, + 481, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 481, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 481, + 641 + ], + "type": "text", + "content": "Unified dual-modal U-Net for joint video-depth denoising. We analyze whether joint video-depth learning improves the performance, and the effectiveness of the designs proposed in the unified dual-modal U-Net in Tab. 4. The key observations are as follows. (1) Jointly video-depth learning with a shared U-Net is beneficial for both video and depth generation (the second row), while using only half the parameters compared to the separate counterpart. Such a result underscores the significance of our structurally-aware shared U-Net. (2) The explicit cross-modal information exchange between the video and depth denoising (the third row), i.e., through cross-modal attention, further improves both the video and depth generation quality. Moreover, as shown in Fig. 8, our unified dual-modal U-Net markedly improves frame and depth quality compared to the separate U-Net baseline. Such results confirm the effectiveness of our design." + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": "Learning video-depth consistency. In our IDOL, we introduce a motion consistency loss " + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{mo}}" + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": " and a cross-attention map consistency loss " + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{xattn}}" + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": " to enhance" + } + ] + } + ], + "index": 24 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 114, + 482, + 152 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 152 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 152 + ], + "type": "table", + "html": "
Pre-training strategyVideoDepthImageMethodFLOPs (T) #Param. (B) GPU mem. (MB) Infer. time (s)
FID-FVD↓FVD↓L2↓FID↓
w/o pre-training39.24452.810.036356.80LDM3D [64]48.801.61766142.02
HAP [68]19.83227.860.033638.71MM-Diffusion [58]41.022.781465113.49
HAOP (ours)17.86223.690.033636.04IDOL (ours)39.351.411025112.23
", + "image_path": "7f5b508f44af5b80ba3c30fb2101537fe9244aea3963f9f237546e563792aa18.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 152, + 482, + 172 + ], + "lines": [ + { + "bbox": [ + 132, + 152, + 482, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 152, + 482, + 172 + ], + "type": "text", + "content": "Table 6: Ablation study on the pre- Table 7: Computational complexity comparison training. son." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 210, + 481, + 270 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 210, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 210, + 481, + 270 + ], + "type": "text", + "content": "video-depth alignment. We analyze their impact in Tab. 5, where the results demonstrate that both of them improve the depth generation quality, and the motion consistency loss improves all video, depth, and image generation results. The final column of Fig. 8 further illustrates how these consistency loss terms effectively refine video-depth alignment in our model." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 271, + 481, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 271, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 271, + 481, + 331 + ], + "type": "text", + "content": "Human attribute outpainting pre-training. We analyze the effectiveness of our human attribute outpainting pre-training (HAOP) in Tab. 6. The results reveal that HAOP surpasses human attribute pre-training (HAP) [68] across all metrics, confirming its efficacy. Notably, even without pre-training, our IDOL already outperforms other competing multi-modal generation methods [58,64]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 332, + 481, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 481, + 404 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 481, + 404 + ], + "type": "text", + "content": "Complexity and computational requirements. We analyzed the complexity of generating an 8-frame video-depth sequence on a single V100 GPU, comparing our method with other multi-modal generation methods in Tab. 7. Thanks to our unified U-Net design, IDOL requires the fewest FLOPs, has the lowest number of trainable parameters, and the shortest inference time, demonstrating our efficiency." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 429, + 220, + 441 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 429, + 220, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 429, + 220, + 441 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 460, + 481, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 481, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 481, + 568 + ], + "type": "text", + "content": "In this paper, we propose IDOL, a framework tailed for human-centric joint video-depth generation. Our proposed unified dual-modal U-Net improves the video and depth synthesis by implicit video structure learning, with cross-modal attention explicitly bridging the joint video-depth denoising process. Our motion consistency loss and cross-attention map consistency loss promote spatial alignment between the generated video and depth. Extensive experiments on the TikTok and NTU120 datasets show our superior performance compared with existing methods, and the adaption ability to different kinds of depth maps. Our IDOL is also able to generalize to different motion representations and pose control modules." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 570, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 481, + 666 + ], + "type": "text", + "content": "Limitations. Despite the performance advantage of our IDOL, it faces several major limitations. First, the computational demands of processing dual-modal data, particularly at high resolutions, hinder its suitability for real-time applications, highlighting a need for further optimization. Additionally, the reliance on high-quality depth maps for training limits its applicability in scenarios where such data is limited or of low quality. Addressing this, future work may explore unsupervised methods or data augmentation strategies to mitigate the data quality constraint." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 199 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 199 + ], + "type": "text", + "content": "This work is supported in part by the Defense Advanced Research Projects Agency (DARPA) under Contract No. HR001120C0124. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the Defense Advanced Research Projects Agency (DARPA)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 217, + 197, + 229 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 217, + 197, + 229 + ], + "spans": [ + { + "bbox": [ + 133, + 217, + 197, + 229 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 240, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "type": "text", + "content": "1. Amit, T., Shaharbany, T., Nachmani, E., Wolf, L.: Segdiff: Image segmentation with diffusion probabilistic models. arXiv preprint arXiv:2112.00390 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 263, + 481, + 296 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 263, + 481, + 296 + ], + "spans": [ + { + "bbox": [ + 138, + 263, + 481, + 296 + ], + "type": "text", + "content": "2. Atapour-Abarghouei, A., Breckon, T.P.: Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer. In: CVPR. pp. 2800-2810 (2018)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 296, + 480, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 296, + 480, + 317 + ], + "spans": [ + { + "bbox": [ + 138, + 296, + 480, + 317 + ], + "type": "text", + "content": "3. Bae, J., Moon, S., Im, S.: Deep digging into the generalization of self-supervised monocular depth estimation. In: AAAI. vol. 37, pp. 187-196 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 318, + 480, + 349 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 318, + 480, + 349 + ], + "spans": [ + { + "bbox": [ + 138, + 318, + 480, + 349 + ], + "type": "text", + "content": "4. Balaji, Y., Min, M.R., Bai, B., Chellappa, R., Graf, H.P.: Conditional gan with discriminative filter generation for text-to-video synthesis. In: IJCAI. vol. 1, p. 2 (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 350, + 480, + 381 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 350, + 480, + 381 + ], + "spans": [ + { + "bbox": [ + 138, + 350, + 480, + 381 + ], + "type": "text", + "content": "5. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models. arXiv preprint arXiv:2112.03126 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 383, + 480, + 404 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 383, + 480, + 404 + ], + "spans": [ + { + "bbox": [ + 138, + 383, + 480, + 404 + ], + "type": "text", + "content": "6. Brock, A., Donahue, J., Simonyan, K.: Large scale gan training for high fidelity natural image synthesis. arXiv preprint arXiv:1809.11096 (2018)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 405, + 480, + 426 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 405, + 480, + 426 + ], + "spans": [ + { + "bbox": [ + 138, + 405, + 480, + 426 + ], + "type": "text", + "content": "7. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: CVPR. pp. 7291-7299 (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 426, + 480, + 459 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 426, + 480, + 459 + ], + "spans": [ + { + "bbox": [ + 138, + 426, + 480, + 459 + ], + "type": "text", + "content": "8. Chang, D., Shi, Y., Gao, Q., Fu, J., Xu, H., Song, G., Yan, Q., Yang, X., Soleymani, M.: Magicdance: Realistic human dance video generation with motions & facial expressions transfer. arXiv preprint arXiv:2311.12052 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 460, + 480, + 480 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 460, + 480, + 480 + ], + "spans": [ + { + "bbox": [ + 138, + 460, + 480, + 480 + ], + "type": "text", + "content": "9. Chen, S., Sun, P., Song, Y., Luo, P.: Diffusiondet: Diffusion model for object detection. In: ICCV. pp. 19830-19843 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 481, + 480, + 502 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 481, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 138, + 481, + 480, + 502 + ], + "type": "text", + "content": "10. Chen, T., Li, L., Saxena, S., Hinton, G., Fleet, D.J.: A generalist framework for panoptic segmentation of images and videos. In: ICCV. pp. 909-919 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 503, + 480, + 534 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 503, + 480, + 534 + ], + "spans": [ + { + "bbox": [ + 138, + 503, + 480, + 534 + ], + "type": "text", + "content": "1. Chen, W., Wu, J., Xie, P., Wu, H., Li, J., Xia, X., Xiao, X., Lin, L.: Control-a-video: Controllable text-to-video generation with diffusion models. arXiv preprint arXiv:2305.13840 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 535, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 535, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 535, + 480, + 555 + ], + "type": "text", + "content": "2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 556, + 480, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 556, + 480, + 589 + ], + "spans": [ + { + "bbox": [ + 138, + 556, + 480, + 589 + ], + "type": "text", + "content": "3. Esser, P., Chiu, J., Atighehchian, P., Granskog, J., Germanidis, A.: Structure and content-guided video synthesis with diffusion models. In: ICCV. pp. 7346-7356 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 590, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 590, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 138, + 590, + 480, + 610 + ], + "type": "text", + "content": "4. Fu, J., Li, S., Jiang, Y., Lin, K.Y., Qian, C., Loy, C.C., Wu, W., Liu, Z.: Stylegan-human: A data-centric odyssey of human generation. In: ECCV. pp. 1-19 (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "type": "text", + "content": "5. Ge, Y., Zhang, R., Wang, X., Tang, X., Luo, P.: Deepfashion2: A versatile benchmark for detection, pose estimation, segmentation and re-identification of clothing images In: CVPR. pp. 5337-5345 (2019)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "6. Geyer, M., Bar-Tal, O., Bagon, S., Dekel, T.: Tokenflow: Consistent diffusion features for consistent video editing. arXiv preprint arXiv:2307.10373 (2023)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "17. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "type": "text", + "content": "18. Gu, J., Trevithick, A., Lin, K.E., Susskind, J.M., Theobalt, C., Liu, L., Ramamoorthi, R.: Nerfdiff: Single-image view synthesis with nef-guided distillation from 3d-aware diffusion. pp. 11808-11826 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 182, + 481, + 202 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 481, + 202 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 481, + 202 + ], + "type": "text", + "content": "19. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: CVPR. pp. 7297-7306 (2018)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 203, + 481, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 203, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 203, + 481, + 236 + ], + "type": "text", + "content": "20. Guo, Y., Yang, C., Rao, A., Wang, Y., Qiao, Y., Lin, D., Dai, B.: Animatediff: animate your personalized text-to-image diffusion models without specific tuning. arXiv preprint arXiv:2307.04725 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 236, + 481, + 267 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 481, + 267 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 481, + 267 + ], + "type": "text", + "content": "21. Ha, S., Kersner, M., Kim, B., Seo, S., Kim, D.: Marionette: Few-shot face reenactment preserving identity of unseen targets. In: AAAI. vol. 34, pp. 10893-10900 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 267, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 267, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 481, + 300 + ], + "type": "text", + "content": "22. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "type": "text", + "content": "23. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. NeurIPS 30 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 333, + 481, + 353 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 333, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 132, + 333, + 481, + 353 + ], + "type": "text", + "content": "24. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. NeurIPS 33, 6840-6851 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 354, + 481, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 481, + 386 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 481, + 386 + ], + "type": "text", + "content": "25. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 386, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 481, + 418 + ], + "type": "text", + "content": "26. Hu, Z., Xu, D.: Videocontrolnet: A motion-guided video-to-video translation framework by using diffusion model with controlnet. arXiv preprint arXiv:2307.14073 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 418, + 481, + 439 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 481, + 439 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 481, + 439 + ], + "type": "text", + "content": "27. Jafarian, Y., Park, H.S.: Learning high fidelity depths of dressed humans by watching social media dance videos. In: CVPR. pp. 12753-12762 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 440, + 481, + 460 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 440, + 481, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 440, + 481, + 460 + ], + "type": "text", + "content": "28. Ji, Y., Chen, Z., Xie, E., Hong, L., Liu, X., Liu, Z., Lu, T., Li, Z., Luo, P.: Ddp: Diffusion model for dense visual prediction. arXiv preprint arXiv:2303.17559 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 461, + 481, + 493 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 461, + 481, + 493 + ], + "spans": [ + { + "bbox": [ + 132, + 461, + 481, + 493 + ], + "type": "text", + "content": "29. Ju, X., Zeng, A., Zhao, C., Wang, J., Zhang, L., Xu, Q.: Humansd: A native skeleton-guided diffusion model for human image generation. arXiv preprint arXiv:2304.04269 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 493, + 481, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 493, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 493, + 481, + 525 + ], + "type": "text", + "content": "30. Karras, J., Holynski, A., Wang, T.C., Kemelmacher-Shlizerman, I.: Dreampose: Fashion image-to-video synthesis via stable diffusion. arXiv preprint arXiv:2304.06025 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "text", + "content": "31. Khachatryan, L., Movsisyan, A., Tadevosyan, V., Henschel, R., Wang, Z., Navasardyan, S., Shi, H.: Text2video-zero: Text-to-image diffusion models are zero-shot video generators. arXiv preprint arXiv:2303.13439 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 558, + 481, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 481, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 481, + 590 + ], + "type": "text", + "content": "32. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 590, + 481, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 590, + 481, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 590, + 481, + 611 + ], + "type": "text", + "content": "33. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: CVPR. pp. 22511-22521 (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 611, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 481, + 632 + ], + "type": "text", + "content": "34. Lin, K., Wang, L., Liu, Z.: End-to-end human pose and mesh reconstruction with transformers. In: CVPR. pp. 1954-1963 (2021)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "35. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "36. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: Ntu rgb+ d 120: A large-scale benchmark for 3d human activity understanding. IEEE TPAMI 42(10), 2684-2701 (2019)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "text", + "content": "37. Liu, S., Zeng, Z., Ren, T., Li, F., Zhang, H., Yang, J., Li, C., Yang, J., Su, H., Zhu, J., et al.: Grounding dino: Marrying dino with grounded pre-training for open-set object detection. arXiv preprint arXiv:2303.05499 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 184, + 482, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 184, + 482, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 184, + 482, + 217 + ], + "type": "text", + "content": "38. Liu, X., Ren, J., Siarohin, A., Skorokhodov, I., Li, Y., Lin, D., Liu, X., Liu, Z., Tulyakov, S.: Hyperhuman: Hyper-realistic human generation with latent structural diffusion. arXiv preprint arXiv:2310.08579 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 218, + 482, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 218, + 482, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 218, + 482, + 251 + ], + "type": "text", + "content": "39. Luan, T., Li, Z., Chen, L., Gong, X., Chen, L., Xu, Y., Yuan, J.: Spectrum auc difference (saucd): Human-aligned 3d shape evaluation. In: CVPR. pp. 20155-20164 (2024)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 251, + 482, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 482, + 274 + ], + "type": "text", + "content": "40. Luan, T., Wang, Y., Zhang, J., Wang, Z., Zhou, Z., Qiao, Y.: Pc-hmr: Pose calibration for 3d human mesh recovery from 2d images/videos. In: AAAI (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 274, + 482, + 307 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 482, + 307 + ], + "type": "text", + "content": "41. Luan, T., Zhai, Y., Meng, J., Li, Z., Chen, Z., Xu, Y., Yuan, J.: High fidelity 3d hand shape reconstruction via scalable graph frequency decomposition. In: CVPR. pp. 16795-16804 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 308, + 482, + 340 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 482, + 340 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 482, + 340 + ], + "type": "text", + "content": "42. Ma, Y., He, Y., Cun, X., Wang, X., Shan, Y., Li, X., Chen, Q.: Follow your pose: Pose-guided text-to-video generation using pose-free videos. arXiv preprint arXiv:2304.01186 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 341, + 482, + 362 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 341, + 482, + 362 + ], + "spans": [ + { + "bbox": [ + 132, + 341, + 482, + 362 + ], + "type": "text", + "content": "43. Mallya, A., Wang, T.C., Liu, M.Y.: Implicit warping for animation with image sets. NeurIPS 35, 22438-22450 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 363, + 482, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 482, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 482, + 396 + ], + "type": "text", + "content": "44. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: CVPR. pp. 6038-6047 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 396, + 482, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 482, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 482, + 430 + ], + "type": "text", + "content": "45. Mou, C., Wang, X., Xie, L., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 430, + 482, + 463 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 482, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 482, + 463 + ], + "type": "text", + "content": "46. Nichol, A., Jun, H., Dhariwal, P., Mishkin, P., Chen, M.: Point-e: A system for generating 3d point clouds from complex prompts. arXiv preprint arXiv:2212.08751 (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 464, + 482, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 482, + 486 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 482, + 486 + ], + "type": "text", + "content": "47. Nirkin, Y., Keller, Y., Hassner, T.: Fsgan: Subject agnostic face swapping and reenactment. In: ICCV. pp. 7184-7193 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 487, + 482, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 482, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 482, + 508 + ], + "type": "text", + "content": "48. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 509, + 482, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 482, + 542 + ], + "type": "text", + "content": "49. Qi, C., Cun, X., Zhang, Y., Lei, C., Wang, X., Shan, Y., Chen, Q.: Fatezero: Fusing attentions for zero-shot text-based video editing. arXiv preprint arXiv:2303.09535 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 543, + 482, + 575 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 482, + 575 + ], + "type": "text", + "content": "50. Qian, S., Lin, K.Y., Wu, W., Liu, Y., Wang, Q., Shen, F., Qian, C., He, R.: Make a face: Towards arbitrary high fidelity face manipulation. In: ICCV. pp. 10033-10042 (2019)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 576, + 482, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 576, + 482, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 576, + 482, + 609 + ], + "type": "text", + "content": "51. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. pp. 8748-8763 (2021)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 610, + 482, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 482, + 643 + ], + "type": "text", + "content": "52. Raj, A., Kaza, S., Poole, B., Niemeyer, M., Ruiz, N., Mildenhall, B., Zada, S., Aberman, K., Rubinstein, M., Barron, J., et al.: Dreambooth3d: Subject-driven text-to-3d generation. arXiv preprint arXiv:2303.13508 (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 643, + 482, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 482, + 665 + ], + "type": "text", + "content": "53. Ranftl, R., Bochkovskiy, A., Koltun, V.: Vision transformers for dense prediction. In: ICCV. pp. 12179-12188 (2021)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 133, + 117, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 481, + 149 + ], + "type": "text", + "content": "54. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE TPAMI 44(3), 1623-1637 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "type": "text", + "content": "55. Reda, F., Kontkanen, J., Tabellion, E., Sun, D., Pantofaru, C., Curless, B.: Film: Frame interpolation for large motion. In: ECCV. pp. 250-266. Springer (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 194 + ], + "type": "text", + "content": "56. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "text", + "content": "57. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI. pp. 234-241 (2015)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "text", + "content": "58. Ruan, L., Ma, Y., Yang, H., He, H., Liu, B., Fu, J., Yuan, N.J., Jin, Q., Guo, B.: Mm-diffusion: Learning multi-modal diffusion models for joint audio and video generation. In: CVPR. pp. 10219-10228 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "type": "text", + "content": "59. Saxena, S., Kar, A., Norouzi, M., Fleet, D.J.: Monocular depth estimation using diffusion models. arXiv preprint arXiv:2302.14816 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "type": "text", + "content": "60. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 303, + 481, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 303, + 481, + 326 + ], + "spans": [ + { + "bbox": [ + 132, + 303, + 481, + 326 + ], + "type": "text", + "content": "61. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: Ntu " + }, + { + "bbox": [ + 132, + 303, + 481, + 326 + ], + "type": "inline_equation", + "content": "\\mathrm{rgb + }" + }, + { + "bbox": [ + 132, + 303, + 481, + 326 + ], + "type": "text", + "content": " d: A large scale dataset for 3d human activity analysis. In: CVPR. pp. 1010-1019 (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 326, + 481, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 481, + 347 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 481, + 347 + ], + "type": "text", + "content": "62. Siarohin, A., Lathuilière, S., Tulyakov, S., Ricci, E., Sebe, N.: Animating arbitrary objects via deep motion transfer. In: CVPR (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "text", + "content": "63. Siarohin, A., Woodford, O.J., Ren, J., Chai, M., Tulyakov, S.: Motion representations for articulated animation. In: CVPR (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "type": "text", + "content": "64. Stan, G.B.M., Wofk, D., Fox, S., Redden, A., Saxton, W., Yu, J., Aflalo, E., Tseng, S.Y., Nonato, F., Muller, M., et al.: Ldm3d: Latent diffusion model for 3d. arXiv preprint arXiv:2305.10853 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 403, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 481, + 424 + ], + "type": "text", + "content": "65. Tang, H., Wang, W., Xu, D., Yan, Y., Sebe, N.: Gestureegan for hand gesture-to-gesture translation in the wild. In: ACM MM. pp. 774-782 (2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 424, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 445 + ], + "type": "text", + "content": "66. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. In: CVPR. pp. 1921-1930 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "text", + "content": "67. Unterthiner, T., Van Steenkiste, S., Kurach, K., Marinier, R., Michalski, M., Gelly, S.: Towards accurate generative models of video: A new metric & challenges. arXiv preprint arXiv:1812.01717 (2018)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "text", + "content": "68. Wang, T., Li, L., Lin, K., Zhai, Y., Lin, C.C., Yang, Z., Zhang, H., Liu, Z., Wang, L.: Disco: Disentangled control for referring human dance generation in real world. In: CVPR (2024)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 511, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 511, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 511, + 481, + 533 + ], + "type": "text", + "content": "69. Watson, D., Chan, W., Martin-Brualla, R., Ho, J., Tagliasacchi, A., Norouzi, M.: Novel view synthesis with diffusion models. arXiv preprint arXiv:2210.04628 (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "type": "text", + "content": "70. Wiles, O., Koepke, A., Zisserman, A.: X2face: A network for controlling face generation using images, audio, and pose codes. In: ECCV. pp. 670-686 (2018)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "type": "text", + "content": "71. Wolleb, J., Sandkuhler, R., Bieder, F., Valmaggia, P., Cattin, P.C.: Diffusion models for implicit image segmentation ensembles. In: International Conference on Medical Imaging with Deep Learning. pp. 1336-1348. PMLR (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 588, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 481, + 610 + ], + "type": "text", + "content": "72. Wu, J., Fang, H., Zhang, Y., Yang, Y., Xu, Y.: Medsegdiff: Medical image segmentation with diffusion probabilistic model. arXiv preprint arXiv:2211.00611 (2022)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 610, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 481, + 632 + ], + "type": "text", + "content": "73. Wynn, J., Turmukhambetov, D.: Diffusionerf: Regularizing neural radiance fields with denoising diffusion models. In: CVPR. pp. 4180-4189 (2023)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "74. Xu, Z., Zhang, J., Liew, J.H., Yan, H., Liu, J.W., Zhang, C., Feng, J., Shou, M.Z.: Magicanimate: Temporally consistent human image animation using diffusion model. arXiv preprint arXiv:2311.16498 (2023)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 100 + ], + "type": "text", + "content": "Y. Zhai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 270 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "text", + "content": "75. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth anything: Unleashing the power of large-scale unlabeled data. In: CVPR (2024)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "type": "text", + "content": "76. Yang, Z., Zeng, A., Yuan, C., Li, Y.: Effective whole-body pose estimation with two-stages distillation. In: ICCV. pp. 4210-4220 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 160, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 482, + 182 + ], + "type": "text", + "content": "77. Zakharov, E., Shysheya, A., Burkov, E., Lempitsky, V.: Few-shot adversarial learning of realistic neural talking head models. In: ICCV. pp. 9459-9468 (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 182, + 482, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 482, + 205 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 482, + 205 + ], + "type": "text", + "content": "78. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV. pp. 3836-3847 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 205, + 482, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 225 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 225 + ], + "type": "text", + "content": "79. Zhao, J., Zhang, H.: Thin-plate spline motion model for image animation. In: CVPR (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "type": "text", + "content": "80. Zhao, S., Fu, H., Gong, M., Tao, D.: Geometry-aware symmetric domain adaptation for monocular depth estimation. In: CVPR. pp. 9788-9798 (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 248, + 482, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 270 + ], + "type": "text", + "content": "81. Zheng, C., Cham, T.J., Cai, J.: T2net: Synthetic-to-realistic translation for solving single-image depth estimation tasks. In: ECCV. pp. 767-783 (2018)" + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 217, + 91, + 447, + 102 + ], + "type": "text", + "content": "IDOL for Human-Centric Joint Video-Depth Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_content_list.json b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..8f8b5fbe84a1da70a4d3289bb6cbbf42aff6e31c --- /dev/null +++ b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_content_list.json @@ -0,0 +1,1612 @@ +[ + { + "type": "text", + "text": "IFTR: An Instance-Level Fusion Transformer for Visual Collaborative Perception", + "text_level": 1, + "bbox": [ + 223, + 140, + 779, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Shaohong Wang $^{1}$ , Lu Bin $^{1}$ , Xinyu Xiao $^{2}$ , Zhiyu Xiang $^{1}$ , Hangguan Shan $^{1}$ , and Eryun Liu $^{1*}$", + "bbox": [ + 217, + 210, + 782, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Zhejiang University, Hangzhou, China {wangsh0111,lubin2022, xiangzy, hshan, eryunliu}@zju.edu.cn $^{2}$ Institute of Automation of Chinese Academy of Sciences, Beijing, China xinyu.xiao@nlpr.ia.ac.cn", + "bbox": [ + 251, + 253, + 750, + 311 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Multi-agent collaborative perception has emerged as a widely recognized technology in the field of autonomous driving in recent years. However, current collaborative perception predominantly relies on Li-DAR point clouds, with significantly less attention given to methods using camera images. This severely impedes the development of budget-constrained collaborative systems and the exploitation of the advantages offered by the camera modality. This work proposes an instance-level fusion transformer for visual collaborative perception (IFTR), which enhances the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. To capture the visual information from multiple agents, we design an instance feature aggregation that interacts with the visual features of individual agents using predefined grid-shaped bird eye view (BEV) queries, generating more comprehensive and accurate BEV features. Additionally, we devise a cross-domain query adaptation as a heuristic to fuse 2D priors, implicitly encoding the candidate positions of targets. Furthermore, IFTR optimizes communication efficiency by sending instance-level features, achieving an optimal performance-bandwidth trade-off. We evaluate the proposed IFTR on a real dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, achieving performance improvements of $57.96\\%$ , $9.23\\%$ and $12.99\\%$ in AP@70 metrics compared to the previous SOTAs, respectively. Extensive experiments demonstrate the superiority of IFTR and the effectiveness of its key components. The code is available at https://github.com/wangsh0111/IFTR.", + "bbox": [ + 261, + 349, + 743, + 684 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: BEV Queries, Query Adaptation, Visual Collaborative Perception, Transformer", + "bbox": [ + 259, + 696, + 740, + 724 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 752, + 375, + 767 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3D object detection is a fundamental task in computer vision, aiming to locate objects in 3D physical space given sensor inputs. It is crucial in various", + "bbox": [ + 212, + 785, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author.", + "bbox": [ + 217, + 824, + 385, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "applications such as autonomous driving [17, 27, 44, 48], robotics [14], and unmanned aerial vehicles [10]. Despite significant advancements in LiDAR-based methods [5, 13, 46, 50], camera-based approaches [26, 29, 35, 38, 46] have garnered widespread attention in recent years. In comparison to LiDAR, cameras have lower deployment costs, are more easily scalable, and provide valuable visual cues for detecting distant objects and identifying vision-based road elements (such as traffic lights and lane markings) [17]. However, due to the lack of depth information in RGB images, solely camera-based 3D object detection is often noticeably inferior to lidar-based detection in most scenarios.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The latest advancements in V2X communication technology and Intelligent Transportation Systems enable intelligent agents to share information between each other [1,8,28,32,47]. Through multi-agent interactions, the limitations of individual agent perception, such as occlusion and long-range issues, can be alleviated, thereby enhancing the performance of camera-based 3D object detection. Currently, the prevailing frameworks for collaborative perception [9, 36, 41-43] primarily involve the fusion at the Bird's Eye View (BEV) feature level. However, this paradigm is highly sensitive to the accuracy of BEV features for individual agents and faces challenges in spatial alignment, imposing stringent requirements on real-time poses between agents, leading to insufficient robustness in feature fusion. Nevertheless, due to the lack of depth information in RGB images, generating BEV features from a 2D plane is ill-posed. Therefore, the detection performance of visual collaborative perception methods based solely on BEV features level in camera settings is impacted by compounded errors, where inaccurate BEV features can severely impact the final performance.", + "bbox": [ + 212, + 287, + 787, + 513 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Diverging from multi-camera 3D object detection, V2X collaborative perception must also account for the constraints of communication bandwidth. It is crucial to address how to reduce communication bandwidth while ensuring collaborative perception performance. Each agent must select visual features with the maximum information content to optimize communication efficiency.", + "bbox": [ + 212, + 518, + 787, + 594 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we propose IFTR, a robust and efficient transformer-based instance-level feature fusion framework. Our central idea is to extract spatial features from regions of interest in cross-agent camera views to generate BEV features, and implicitly encode candidate positions of objects in 3D space through a heuristic adaptive approach. Specifically, IFTR incorporates three key designs: i) Instance feature aggregation, aggregating spatial information from visual features of multiple agent camera views using predefined grid-shaped BEV queries. This is achieved through a transformer to implement robust and adaptive feature fusion, avoiding strict spatial alignment requirements in BEV feature-level fusion strategies. It also eliminates the dependency on high-accuracy single-agent BEV features and real-time pose accuracy. ii) Message selection and feature map reconstruction, reducing bandwidth consumption by sharing instance-level visual features rather than entire image features. iii) Cross-domain query adaptation, encoding instance-level features as object queries, combining them with the original learnable object queries to form the new hybrid object queries. This is then input into a deformable DETR head [2,51] for end-to-end 3D object detection.", + "bbox": [ + 212, + 598, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To evaluate IFTR, we conduct extensive experiments on a real-world dataset, DAIR-V2X [47], and two simulated datasets, OPV2V [43] and V2XSet [42]. The experimental results indicate that IFTR significantly outperforms previous works in the performance-bandwidth trade-off across multiple datasets. To sum up, the main contributions are as follows:", + "bbox": [ + 212, + 146, + 787, + 220 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We introduce IFTR, a superior camera-only instance-level feature fusion framework based on transformers. This framework addresses occlusion and long-range issues through multi-agent collaboration, achieving more accurate and complete 3D object detection.", + "- We devise an instance feature aggregation that utilizes learnable BEV queries to aggregate spatial information from multiple agents, resulting in more accurate BEV features.", + "- We design a cross-domain query adaptation module by encoding instance-level features as object queries, facilitating the implicit encoding of candidate positions for targets in 3D space, which alleviates the problem of target spatial distribution differences between the training set and the test set.", + "- We develop communication-efficient collaboration techniques by sharing the most informative visual features to reduce communication overhead. Our IFTR achieves state-of-the-art performance on a real world dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, with AP@70 metrics improving by $57.96\\%$ , $9.23\\%$ and $12.99\\%$ compared to the previous SOTAs, respectively." + ], + "bbox": [ + 225, + 234, + 782, + 492 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 518, + 387, + 535 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Camera-based 3D Object Detection", + "text_level": 1, + "bbox": [ + 215, + 554, + 555, + 569 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Given an RGB image and the corresponding camera parameters, the purpose of image-based 3D object detection is to classify and locate the objects of interest. Since images lack depth information, this problem is ill-posed and more challenging compared to 2D detection. FCOS3D [35] and SMOKE [23] extend 2D detection networks by utilizing fully convolutional networks to directly regress the depth for each object. Pseudo LiDAR [37] employs a depth estimation network to transform 2D images into 3D pseudo-point cloud signals, followed by the use of a lidar-based detection network for 3D detection. DETR3D [38] utilizes a set of sparse 3D queries to index 2D features extracted from multi-view images, samples corresponding features, enabling end-to-end 3D detection box prediction without the need for time-consuming post-processing like NMS (Non-Maximum Suppression).", + "bbox": [ + 212, + 582, + 787, + 763 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Recently, there has been widespread attention on BEV representations due to their ability to clearly depict object positions and scales, coupled with efficient computational efficiency. OFT [30] and ImVoxelNet [31] project predefined voxels onto image features, generating voxel representations of the scene. LSS [26] and CaDDN [29] utilize view transformation modules to convert dense 2D image", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 428, + 114, + 732, + 127 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "features into BEV space. CVT [49] leverages position encoding from camera perception and dense cross-attention to correlate perspective view and BEV view features. BEVDet [11, 12] and BEVDepth [16] use lift-splat operations for view transformation. PETR [21, 22] utilizes 3D position encoding and global cross-attention for feature fusion, transforming 2D features into 3D position-aware representations. BEVFormer [17, 45] effectively aggregates spatio-temporal features from a surround-view camera and historical BEV features using deformable attention, generating unified BEV features. SparseBEV [19] adapts self-attention with an adaptive receptive field for feature aggregation in BEV space, enjoying the advantages of BEV space without explicitly constructing dense BEV features. In this work, we choose the single-scale and history-free BEVFormer-S [17] as the single-agent 3D object detector for computational efficiency.", + "bbox": [ + 212, + 146, + 787, + 328 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Collaborative Perception", + "text_level": 1, + "bbox": [ + 215, + 348, + 467, + 364 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Collaborative perception is an emerging application in multi-agent systems, aiming to enhance perceptual performance by facilitating communication among other agents for the shared exchange of information. Based on its message sharing strategy, it can be categorized into three types: early fusion (i.e. sharing raw sensor information), intermediate fusion (i.e. sharing intermediate layer features of neural networks), and late fusion (i.e. sharing 3D detection results, such as 3D bounding box position and confidence score). Early fusion usually requires large transmission bandwidth, while late fusion cannot provide valuable scenario context. Intermediate fusion achieves a better trade-off between performance and bandwidth. When2com [20] introduces a handshake mechanism to determine when to communicate and create sparse communication graph. OPV2V [43] utilizes a single-head self-attention module to fuse features, while F-Cooper [3] employs a maxout [7] fusion operation. V2VNet [36] utilizes a spatially aware graph neural network to aggregate shared feature representations among multiple vehicles. DiscoNet [15] adopts knowledge distillation to leverage the advantages of both early and intermediate collaboration. V2X-ViT [42] introduces a novel heterogeneous multi-agent attention module to fuse information across heterogeneous agents. Where2comm [9] introduces a spatial confidence map to reduce communication bandwidth consumption. TransIFF [4] further reduces communication bandwidth consumption by transmitting object queries. CoAlign [25] employs learnable or mathematical methods to correct pose errors for more accurate collaborative perception. HM-ViT [39] and HEAL [24] investigate multi-agent heterogeneous modality collaborative perception problems with different sensor modalities, expanding the scale of collaboration.", + "bbox": [ + 212, + 371, + 787, + 734 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "However, prior collaborative perception efforts [4,9,25,36,42,43] have primarily focused on lidar-based 3D object detection, yielding suboptimal performance in a camera-only setup. We speculate that the reason lies in the inferior quality of BEV features from a single-agent compared to lidar-based methods, resulting in suboptimal solutions at the BEV feature level. In this paper, we propose a novel camera-only instance-level feature fusion framework with lower communication bandwidth consumption. It generates more accurate BEV features and", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/475ad1900580ae917a777d25ddc0167d17151dd23e4632ecbbfe55123b222293.jpg", + "image_caption": [ + "Fig. 1: Overall architecture of IFTR. i) We employ the message selection and feature map reconstruction module to share instance-level features, reducing bandwidth consumption; ii) In instance feature aggregation (IFA), each BEV query interacts only with image features from regions of interest from multiple views; iii) In CDQA, we encode the feature map information and 3D positional information of each instance into 3D object query." + ], + "image_footnote": [], + "bbox": [ + 223, + 143, + 779, + 388 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3D object queries tailored to each instance by leveraging instance-level features shared among multiple agents, thereby achieving more efficient and practical collaborative perception.", + "bbox": [ + 212, + 515, + 787, + 561 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 IFTR", + "text_level": 1, + "bbox": [ + 215, + 590, + 308, + 606 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "This section presents IFTR, a robust and efficient camera-only instance-level feature fusion framework for collaborative perception. As depicted in Fig. 1, IFTR comprises an image encoder, message selection and feature map reconstruction, cascade instance feature aggregation, cross-domain query adaptation, and a DETR decoder. The image encoder is utilized to extract visual features from the input images. The proposed message selection and feature map reconstruction module are employed at the sender and receiver ends, respectively, for instance-level visual feature filtering and image feature reconstruction, effectively saving communication bandwidth. Based on visual features from multiple camera views, the proposed cascade instance feature aggregation generates comprehensive and accurate BEV features; the proposed cross-domain query adaptation module encodes instance-level visual features into object queries to encode candidate positions for the targets, combining them with the original learnable object queries to form the hybrid object queries. Ultimately, the DETR decoder", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 429, + 114, + 730, + 127 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "takes the BEV features and the hybrid object queries as inputs to predict the target's category and location information.", + "bbox": [ + 215, + 146, + 784, + 176 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Image Encoder", + "text_level": 1, + "bbox": [ + 215, + 199, + 385, + 214 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We leverage EfficientNet [33, 34] to extract visual features from the input images because of its high performance and low computational complexity. Given $L$ agents and $N_{\\text{cams}}$ camera views for each agent, $F_i^k \\in \\mathbb{R}^{fC \\times fH \\times fW}$ is used to represent the extracted feature map of the $k$ -th camera view of the $i$ -th agent, where $fC$ , $fH$ and $fW$ are the channel, height and width of the feature map. Considering different agents may have different camera views, the feature maps of views that not exist are set to zero when the actual number of camera views less than $N_{\\text{cams}}$ and use a mask to indicate the valid feature maps.", + "bbox": [ + 212, + 224, + 782, + 345 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Message Selection and Feature Map Reconstruction", + "text_level": 1, + "bbox": [ + 215, + 367, + 687, + 383 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To achieve accurate and comprehensive 3D object detection, it is imperative for each agent to exchange visual features and leverage complementary information. We propose communication-efficient collaborative techniques by sharing the most informative visual features to reduce communication overhead. The intuition is that foreground regions contain more informative content than background regions. During collaboration, visual features of regions with objects can assist in recovering missed objects due to occlusion or long-range issues, while background regions can be omitted to reduce the system's communication load.", + "bbox": [ + 212, + 392, + 784, + 513 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Given a feature map $F_{j}^{k}$ , the message sent for sharing is selected by the following steps:", + "bbox": [ + 215, + 513, + 784, + 542 + ], + "page_idx": 5 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. Extracting a set of candidate object instances by a 2D object detector. All the confidence values of instance are greater than a predefined threshold, $c_{\\text{thre}}$ .", + "2. Cropping the feature map of each instance by the predicted bounding box in inference stage or by the ground truth bounding box in the training stage.", + "3. The cropped feature map of the $n$ -th selected instance, $F_{j \\to i}^{k,n}$ , and bounding box are sent to the $i$ -th agent for sharing." + ], + "bbox": [ + 220, + 553, + 784, + 659 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "At the side of ego agent (or the $i$ -th agent), the received object instance feature maps of the $k$ -th camera view of the $j$ -th agent are first combined together to reconstruct the feature map, $\\mathcal{F}_{j\\rightarrow i}^{k}$ , of foreground regions of original feature map $F_{j}^{k}$ by filling back the cropped features. The features in background region are set to zero.", + "bbox": [ + 212, + 669, + 784, + 746 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Instance Feature Aggregation", + "text_level": 1, + "bbox": [ + 215, + 768, + 504, + 784 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Given a set of received foreground feature maps, $\\{\\mathcal{F}_{j\\rightarrow i}^k |j = 1,2,\\dots ,N_{agent},k = 1,2,\\ldots ,N_{cams}\\}$ , where $N_{agent}$ is the number of agents, the purpose of instance feature aggregation (IFA) module is to form a BEV feature map by aggregating", + "bbox": [ + 215, + 794, + 784, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/94f6ba6d5f9bdf75129c817f733913abc2700fb451f9edcb779e6b9e07d133b5.jpg", + "image_caption": [ + "(a) IFA", + "Fig. 2: (a) The architecture of our proposed Instance Feature Aggregation (IFA); (b) Multi-View Feature Aggregation (MVFA) illustrated in Sec. 3.3" + ], + "image_footnote": [], + "bbox": [ + 223, + 143, + 416, + 349 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/596de059f390cf23d7aa4f650497239fb170d235f3adca501ff241120ca40440.jpg", + "image_caption": [ + "(b) MVFA" + ], + "image_footnote": [], + "bbox": [ + 428, + 145, + 777, + 349 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "features from all received foreground feature maps. Since all camera views are treated equally in IFA module, for simplicity, we represent all the foreground feature maps by $\\{\\mathcal{F}_v|v = 1,2,\\dots ,N_v\\}$ , where the total number of views is $N_{v} = N_{agent}\\times N_{cams}$ .", + "bbox": [ + 212, + 438, + 782, + 500 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The BEV space around the ego agent is divided into a discrete grid space of size $H \\times W$ . The origin of ego coordinate is at the center of BEV grid. To construct a feature map on the BEV space of the ego agent by fusing reconstructed feature maps $\\{\\mathcal{F}_i | i = 1,2,\\dots,N_v\\}$ from all collaborative views, we propose a deformable attention based cascade instance feature aggregation (IFA) module (see Fig. 2). The BEV feature map is obtained by the following steps:", + "bbox": [ + 212, + 500, + 784, + 590 + ], + "page_idx": 6 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. A set of learnable parameters $Q_{\\mathrm{bev}} \\in \\mathbb{R}^{C \\times H \\times W}$ is predefined and randomly initialized at the first IFA block.", + "2. For a given grid centered at $(x,y)$ , a set of points $\\{(x,y,z_h)|h = 1,2,\\dots,N_{ref}\\}$ is selected as reference points, where $\\{z_h|h = 1,2,\\dots,N_{ref}\\}$ are predefined heights for each grid. The reference points are used as feature indices to gather information from collaborative feature maps.", + "3. For a reference point $(x,y,z_h)$ at grid $(x,y)$ , the corresponding feature vector is aggregated by" + ], + "bbox": [ + 220, + 603, + 790, + 728 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nF _ {b e v} ^ {h} (x, y) = \\frac {1}{| w |} \\sum_ {v = 1} ^ {N _ {v}} w _ {v} f _ {v} ^ {h},\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 729, + 609, + 770 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $w_v \\in \\{0,1\\}$ indicates whether the reference point $(x,y,z_h)$ is projected inside the image space of the $v$ -th camera view, and $|w| = \\sum_v w_v$ is total number of views observing the reference point, and $f_v^h$ is the output of a deformable attention module, which will be described later in this section.", + "bbox": [ + 240, + 779, + 784, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 428, + 114, + 732, + 127 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "4. The aggregated BEV feature $F_{bev}$ is the average feature over all $N_{ref}$ reference points for each grid and followed by a feed forward network (FFN) and an Add&Norm module to get the output $\\hat{F}_{bev}$ of IFA module.", + "5. The above four steps assemble an IFA module. To sufficiently fuse all camera view features, we cascade 6 IFA modules sequentially, with the previous IFA output $\\hat{F}_{\\text{bev}}$ as the input $Q_{\\text{bev}}$ of the next IFA." + ], + "bbox": [ + 220, + 146, + 784, + 237 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Given a reference point $(x,y,z_h)$ at grid $(x,y)$ and the feature map $\\mathcal{F}_v$ of $v$ -th camera view, if point $(x,y,z_h)$ is observed by the $v$ -th camera view, the deformable attention first takes a feature vector $\\hat{Q}_{\\mathrm{bev}}(x,y)$ from $\\hat{Q}_{\\mathrm{bev}}$ and the vector $\\hat{Q}_{\\mathrm{bev}}(x,y)$ is then fed into a MLP layer. The MLP layer output a list of offset vectors $(o_1,o_2,\\dots,o_{N_{da}})$ and a weight vector $\\lambda = (\\lambda_1,\\lambda_2,\\dots,\\lambda_{N_{da}})$ , where $N_{da}$ is the number of positions in attention, the output of deformable attention is", + "bbox": [ + 215, + 247, + 785, + 351 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nf _ {v} ^ {h} = \\sum_ {i = 1} ^ {N _ {d a}} \\lambda_ {i} \\mathcal {F} _ {v} (p + o _ {i}),\n$$\n", + "text_format": "latex", + "bbox": [ + 421, + 352, + 584, + 391 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $p$ is the projected image coordinate of $(x,y,z_h)$ on $v$ -th view.", + "bbox": [ + 215, + 398, + 702, + 415 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Cross-Domain Query Adaptation", + "text_level": 1, + "bbox": [ + 215, + 438, + 534, + 454 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The object decoder of BEVformer [17] is a DETR [2,51] decoder that receives a set of learned embeddings as object queries, aiming to learn potential locations of target objects during training. However, it takes a considerable amount of time for randomly initialized embeddings to converge to suitable positions. Additionally, during inference, object queries remain fixed for all images, while the spatial distribution of target objects may vary, leading to potentially inaccurate results. To address this issue, we employ a cross-domain query adaptation (CDQA) module to initialize object queries for decoder. This module implicitly encodes candidate positions for the target, making it easier for the detection head to capture the target object accurately.", + "bbox": [ + 212, + 465, + 787, + 614 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The maximum number of queries for decoder is set to $N_{Q}$ . The initial set of queries consists of two parts. The first part of queries is obtained from selected instances of all ego and collaborative camera views and the second part (the rest) of queries is randomly initialized.", + "bbox": [ + 212, + 617, + 785, + 676 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Given a set of shared instance features $\\{(\\mathcal{I}_n,B_n)|n = 1,2,\\ldots ,N_I\\}$ from all collaborative and ego views, where $N_{I}$ is total number of instances, $\\mathcal{I}_n$ is the $n$ -th cropped instance feature map, and $B_{n}$ is the bounding box coordinates, the queries is obtained as following", + "bbox": [ + 212, + 676, + 785, + 738 + ], + "page_idx": 7 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. Global average pooling (GAP) on instance feature maps and then followed by a MLP module to get a set of feature vector $\\{\\mathcal{I}_n^p | n = 1, 2, \\dots, N_I\\}$ .", + "2. Encode the instance position information into a vector by a MLP layer, obtaining a set of position embeddings $\\{\\mathcal{V}_n|n = 1,2,\\ldots ,N_I\\}$ . The input to the MLP is the concatenate of three coordinates $(p_1,p_2,c)$ , where $p_1,p_2$ are the 3D coordinates of left-top and bottom-right point of instance bounding" + ], + "bbox": [ + 220, + 748, + 784, + 838 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "box on the focal plane and $c$ is the coordinate of corresponding camera origin. All coordinates are projected to the ego coordinate system. The three points indicate a cone where the object lies.", + "bbox": [ + 240, + 146, + 782, + 190 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3. Combine the feature vectors and position embeddings by adding, obtaining the instance feature initialized set of queries $\\{\\mathcal{I}_n^p +\\mathcal{V}_n|n = 1,2,\\ldots ,N_I\\}$ for object decoder.", + "bbox": [ + 220, + 191, + 782, + 236 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The union, $Q_{\\mathrm{hybrid}}$ , of the instance feature initialized set of queries and the randomly initialized set of queries is then used as queries of object decoder.", + "bbox": [ + 212, + 244, + 782, + 275 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.5 Object Decoder", + "text_level": 1, + "bbox": [ + 215, + 295, + 392, + 311 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The object decoder of IFTR employs a deformable DETR detection head, taking the BEV features $\\hat{F}_{bev} \\in \\mathbb{R}^{C \\times H \\times W}$ and the hybrid object queries $Q_{\\mathrm{hybrid}} \\in \\mathbb{R}^{N_Q \\times C}$ as input, producing detection results $\\mathcal{O} = \\Phi_{\\mathrm{dec}}(\\hat{F}_{bev}, Q_{\\mathrm{hybrid}}) \\in \\mathbb{R}^{N_Q \\times 8}$ . Each position of $\\mathcal{O}$ represents a rotated box with class $(c, x, y, z, w, l, h, \\theta)$ , denoting class confidence, position, size and angle. The objects are the final output of the proposed collaborative perception system. We utilize the $\\ell_1$ loss for regression and the focal loss [18] for classification.", + "bbox": [ + 212, + 319, + 784, + 426 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 448, + 375, + 465 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 478, + 426, + 494 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets. To evaluate the performance of IFTR on the visual collaborative perception task, we conduct extensive experiments on three multi-agent datasets, including V2XSet [42], OPV2V [43], and DAIR-V2X [47]. V2XSet [42] is a simulated dataset supporting V2X perception, co-simulated by CARLA [6] and OpenCDA [40]. It comprises 73 representative scenes with 2 to 5 connected agents and 11,447 annotated 3D frames, with an image resolution of $600 \\times 800$ . OPV2V [43] is a large-scale vehicle-to-vehicle collaborative perception dataset, comprising 12,000 LiDAR point cloud frames and RGB images with 230,000 annotations of 3D bounding boxes, with an image resolution of $600 \\times 800$ . DAIR-V2X [47] is a real-world vehicle-to-infrastructure collaborative perception dataset, consists of 100 realistic scenes and 18,000 data samples, with an image resolution of $1080 \\times 1920$ .", + "bbox": [ + 212, + 501, + 784, + 681 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation details. We use the single-scale and history-free BEVFormerS [17] as the 3D object detector for single agent. We employ EfficientNet [33,34] as the image backbone for better computation efficiency and utilize a smaller grid resolution $(0.4\\mathrm{m})$ to retain fine-trained spatial details. The intermediate BEV feature map has a dimension of $256\\times 256\\times 256$ , with a perception range defined as $x\\in [-51.2\\mathrm{m},51.2\\mathrm{m}]$ and $y\\in [-51.2\\mathrm{m},51.2\\mathrm{m}]$ . Following prior research [41-43], we only modified the fusion module of different intermediate fusion methods while keeping the other components such as camera feature extractor and detection head the same. As IFTR involves instance-level fusion of", + "bbox": [ + 212, + 703, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 428, + 114, + 730, + 127 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/56b7cd0d4466367b8e3c66a2d585b4b6cb133eb30756733cbae1188258b4d043.jpg", + "table_caption": [ + "Table 1: 3D detection performance comparison on the V2XSet [42], OPV2V [43] and DAIR-V2X [47] datasets. The results are reported in Average Precision (AP) at IoU=0.30, 0.50 and 0.70 on perfect settings." + ], + "table_footnote": [], + "table_body": "
MethodV2XSetOPV2VDAIR-V2X
AP@30AP@50AP@70AP@30AP@50AP@70AP@30AP@50AP@70
No Collaboration0.43430.30370.13790.56520.45940.25560.21020.07090.0080
Late Fusion0.68030.51410.25590.87890.77620.51920.29520.16310.0421
V2VNet [36]0.68860.59540.39000.86820.79060.57590.25810.13540.0276
V2X-ViT [42]0.66900.59140.41230.85120.78410.58380.25440.14020.0277
Where2comm [9]0.69690.61690.43960.84710.77140.58600.26130.14240.0296
CoBEVT [41]0.66290.58840.40810.87090.80260.59340.26080.14530.0255
CoAlign [25]0.75640.64790.39640.86890.80210.60460.26450.14700.0262
IFTR0.80570.71730.49670.92330.85560.66040.38550.20580.0665
", + "bbox": [ + 215, + 198, + 810, + 342 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "2D image features, we construct it following the method proposed in Sec. 3 and straightforwardly add a late fusion strategy to explore its combined effects with other fusion strategies.", + "bbox": [ + 212, + 369, + 785, + 415 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation metrics. We evaluate the detection performance using Average Precision (AP) metrics with Intersection over Union (IoU) thresholds of 0.30, 0.50, and 0.70. Additionally, the communication volume follows the standard setting as [4,9,42,43] that counts the message size by byte in log scale with base 2.", + "bbox": [ + 212, + 436, + 787, + 511 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Quantitative Evaluation", + "text_level": 1, + "bbox": [ + 215, + 535, + 459, + 550 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Benchmark comparison. Tab. 1 compares the proposed IFTR with previous collaborative methods. We consider single-agent detection without collaboration (No collaboration), V2VNet [36], V2XViT [42], Where2comm [9], CoBEVT [41], CoAlign [25] and late fusion, where late fusion directly exchanges 3D detection boxes. We observe that the proposed IFTR outperforms previous methods on both real-world and simulated datasets, demonstrating the superiority of our model and its robustness to various realistic noises. Specifically, the SOTA performance of AP@70 on the V2XSet, OPV2V and DAIR-V2X datasets is improved by $12.99\\%$ , $9.23\\%$ and $57.96\\%$ , respectively. Compared to previous collaboration methods at the BEV level, IFTR significantly enhances the quality of BEV features through instance feature aggregation, and adapts the cross-domain query adaption to implicitly encode the positions of the target in 3D space, achieving more accurate perception.", + "bbox": [ + 212, + 560, + 787, + 758 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Number of agents. In this experiment, we investigate the impact of the quantity of agents on the perceptual performance of IFTR on the OPV2V dataset. As depicted in Fig. 3a, the perceptual performance positively increases as more agents engage in cooperative perception. From Fig. 3b, it can be observed that, in", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/eb472464f083fac7355029529b3a737669b04816b63dada118a25dda8a664be6.jpg", + "image_caption": [ + "(a) All scenes on OPV2V" + ], + "image_footnote": [], + "bbox": [ + 241, + 148, + 485, + 337 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/0385df63854ed85ba374b260b9190ba45be533ce26b2186436287d4d5d772eec.jpg", + "image_caption": [ + "(b) A certain scene on OPV2V", + "Fig. 3: IFTR steadily improves 3D detection performance as the number of agents grows. (a) The relationship between 3D detection performance and the maximum collaboration count on the OPV2V test set; (b) The relationship between 3D detection performance and collaboration count in a certain scene on the OPV2V test set." + ], + "image_footnote": [], + "bbox": [ + 516, + 148, + 764, + 335 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "a simple perception environment, the IFTR performance exceeds that of the single LiDAR-based detector [13] when the collaboration count is 2 for the AP@50 metric. Similarly, for the AP@70 metric, the IFTR performance surpasses the single LiDAR-based detector when the collaboration count is 5. It is noteworthy that the detection performance consistently improves with the increase in the number of collaborative agents. Even upon reaching the maximum collaboration quantity in the dataset, a rising trend in performance persists. Therefore, we advocate for active collaboration among more agents to achieve increasingly advanced perceptual performance.", + "bbox": [ + 212, + 457, + 787, + 592 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Robustness to localization noise. We follow the localization noise settings in V2X-ViT [42] (Gaussian noise with a mean of 0m and a variance of 0m-0.6m) and validate the robustness of IFTR against realistic localization noise. Fig. 4 illustrates the detection performances as a function of localization noise level in V2XSet and DAIR-V2X datasets, respectively. We see: i) with the increasing localization noise, the performance of all intermediate collaborative methods deteriorates due to the misalignment of feature maps, while IFTR outperforms previous SOTAs at all the localization noise levels; ii) IFTR consistently outperforms the No Collaboration by a significant margin. The reason is the powerful transformer architecture in IFA can capture crucial perceptual cues and holistic information across agents.", + "bbox": [ + 212, + 625, + 787, + 792 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Ablation Studies", + "text_level": 1, + "bbox": [ + 215, + 824, + 401, + 838 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 428, + 114, + 732, + 127 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/254c35cb64b1f23407ca6cfd1fa883df27b596d303c5df883186cc27ef63b645.jpg", + "image_caption": [ + "(a) DAIR-V2X" + ], + "image_footnote": [], + "bbox": [ + 241, + 148, + 485, + 335 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/47f1dc893bf140d7e49abd06efb6bdf4e73f85663a2e7bbc1e23f5361c699432.jpg", + "image_caption": [ + "(b) V2XSet", + "Fig. 4: Robustness to localization noise on the DAIR-V2X and V2XSet datasets. Gaussian noise with zero mean and a varying variance is introduced. IFTR consistently outperforms previous SOTAs." + ], + "image_footnote": [], + "bbox": [ + 516, + 148, + 764, + 335 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/d15705666b9858bbb8efbd95d2defdd764a3b21decacaf06094c3e237b533c88.jpg", + "table_caption": [ + "Table 2: Ablation Study results of the proposed components on the OPV2V and DAIR-V2X datasets. IFA, CDQA respectively represent the incorporation of i) instance feature aggregation, and ii) cross-domain query adaptation. MASK denotes interacting exclusively with the foreground features of collaborators in the multi-view feature aggregation module." + ], + "table_footnote": [], + "table_body": "
IFA CDQA MASKOPV2VDAIR-V2X
AP@50AP@70CommAP@50AP@70Comm
0.77620.519211.450.16310.042112.04
✓0.84800.648724.230.19980.057421.91
✓✓0.85560.660424.230.20580.066521.91
✓✓✓0.84580.630020.610.19780.061818.23
", + "bbox": [ + 274, + 508, + 730, + 597 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Effectiveness of different modules in IFTR. Here we investigate the effectiveness of various components in IFTR, with the base model being BEVFormerS incorporating a late fusion strategy. We progressively adding i) IFA, ii) CDQA, and iii) MASK to assess the impact of each component on detection performance and communication volume, where MASK refers to interacting only with the foreground features of collaborators in the MVFA module. As Tab. 2 demonstrates i) IFA contributes the most significant performance gain, increasing AP@70 on OPV2V and DAIR-V2X by $24.94\\%$ and $36.34\\%$ , respectively. This is attributed to the MVFA design in IFA, which significantly improves the quality of BEV features for individual agents, enhancing BEV features and further improving the perceptual effectiveness of late fusion; ii) CDQA increases AP@70 on OPV2V and DAIR-V2X by $1.80\\%$ and $15.85\\%$ , respectively. This is because CDQA encodes 2D instances into 3D object queries, making the detection head less dependent on the initially learned object queries during training (i.e., gen", + "bbox": [ + 212, + 628, + 787, + 843 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/281593920bcd74a35f605e0f2ad6bf47434f8b3bc32d2e1f0429b45f192eed2c.jpg", + "table_caption": [ + "Table 3: Comparison of different positional encoding strategies in the CDQA module on the OPV2V and DAIR-V2X datasets. None denotes not using positional encoding, Learned denotes the use of trainable positional encoding, and CE stands for employing the proposed cone encoding." + ], + "table_footnote": [], + "table_body": "
StrategyOPV2VDAIR-V2X
AP@50AP@70AP@50AP@70
None0.84930.65320.19500.0610
Learned0.85320.65880.20250.0628
CE0.85560.66040.20580.0665
", + "bbox": [ + 362, + 212, + 638, + 287 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "erating object queries adaptively based on 2D instances that are more suitable for 3D detection of the instance). It effectively alleviates the problem of differences in spatial distribution between the test set and the training set, and we speculate that this module will bring more significant performance improvement when there is a greater spatial distribution difference; iii) MASK reduces communication overhead by 12.30 times on the OPV2V dataset and 12.82 times on the DAIR-V2X dataset, the detection performance only decreased by $4.60\\%$ and $7.07\\%$ on the respective datasets for the AP@70 metric. This is highly useful for bandwidth-constrained application scenarios. It is worth noting that our proposed IFTR can also be combined with other fusion methods (such as CoBEVT [41] and CoAlign [25]), and we encourage researchers to explore their combined usage, believing it will lead to more advanced detection performance.", + "bbox": [ + 215, + 311, + 787, + 492 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Different positional encoding schemes in CDQA. Due to the crucial importance of positional encoding in transformer-based architectures, in this subsection, we compare cone encoding with other commonly used positional encoding methods. As can be seen from Tab. 3, the performance using cone encoding is superior to other methods. This is attributed to cone encoding providing a potential cone space prior for instances, which can alleviate the difficulty of the detection head in capturing targets.", + "bbox": [ + 215, + 511, + 787, + 618 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.4 Qualitative Evaluation", + "text_level": 1, + "bbox": [ + 217, + 636, + 446, + 651 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Visualization of detection results. We conducted a qualitative analysis of the model's performance using typical samples from the OPV2V dataset, as illustrated in Fig. 5. The first column (a) shows the perception results of no collaboration, the second column (b) shows results with late fusion, and the third column (c) shows results using IFTR for collaborative perception. Overall, our approach generates more prediction bounding boxes that perfectly align with the ground truth. This improvement can be attributed to two main factors: i) the proposed IFA integrates meaningful information from nearby agents, significantly enhancing the quality of BEV features, and thereby improving detection performance; ii) the proposed CDQA provides effective spatial cues for objects in the scene, effectively compensating for the differences in target spatial distribution between the test set and the training set.", + "bbox": [ + 215, + 657, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 429, + 114, + 730, + 127 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/83ce0d7cc6c4b8a00a99d169c51f12542f7ef7938fbc854021ceec5b66dc4fea.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 281, + 152, + 424, + 263 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/123974b7aeec11a1038823d818c9b39ae5155dbf0f1a7efff3651269968dd4c2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 431, + 152, + 573, + 263 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/a240f4cd859598651338460a3da04a52e8e6a8113f29b38dd3872dcdd1907b7b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 578, + 152, + 720, + 263 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/a61c28e93f3095aedb589d473a125b2d7713ca97d72fca9e73cbfd85209cf574.jpg", + "image_caption": [ + "(a) No Collaboration" + ], + "image_footnote": [], + "bbox": [ + 281, + 268, + 424, + 378 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/c658854fb0ed171094908d76c923e1cc60e0f538ce2bc9a5bc5511f8512199c5.jpg", + "image_caption": [ + "(b) Late Fusion" + ], + "image_footnote": [], + "bbox": [ + 431, + 268, + 573, + 378 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/43cd472602488f548c2ad3f0c790cd0f76d78f6bb1ed6c89d1caef8fa7d53224.jpg", + "image_caption": [ + "(c) IFTR", + "Fig. 5: Visualization of predictions from (a) No Collaboration, (b) Late Fusion and (c) IFTR on the OPV2V test set. Green and red 3D bounding boxes represent the ground truth and prediction respectively." + ], + "image_footnote": [], + "bbox": [ + 578, + 268, + 720, + 378 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 489, + 357, + 506 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "IFTR is an instance-level feature fusion framework based on transformer that aims to enhance the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. It comprises three key components: message selection and feature map reconstruction, instance feature aggregation, and cross-domain query adaptation. The message selection and feature map reconstruction module optimize communication efficiency by transmitting instance-level features. Instance feature aggregation interacts with the visual features of individual agents using predefined grid-shaped BEV queries, generating more comprehensive and accurate BEV features. The cross-domain query adaptation implicitly encodes candidate positions of targets, heuristically integrating 2D priors. Extensive experiments on several multi-agent datasets show the effectiveness of IFTR and the necessity of all its components.", + "bbox": [ + 212, + 523, + 787, + 705 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 729, + 401, + 748 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The work was supported by the Key Research & Development Plan of Zhejiang Province under Grant 2021C01196, in part by the Zhejiang Provincial Natural Science Foundation of China under Grant LR23F010006, in part by the Open Research Project Programme funded by the Science and Technology Development Fund (SKL-IOTSC(UM)-2024-2026) and the State Key Laboratory of Internet", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "of Things for Smart City (University of Macau) (Ref. No.: SKL-IoTSC(UM)-2024-2026/ORP/GA01/2023).", + "bbox": [ + 215, + 145, + 782, + 176 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 199, + 321, + 215 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Betz, J., Zheng, H., Liniger, A., Rosolia, U., Karle, P., Behl, M., Krovi, V., Mangharam, R.: Autonomous vehicles on the edge: A survey on autonomous vehicle racing. IEEE Open Journal of Intelligent Transportation Systems 3, 458-488 (2022)", + "2. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020)", + "3. Chen, Q., Ma, X., Tang, S., Guo, J., Yang, Q., Fu, S.: F-cooper: Feature based cooperative perception for autonomous vehicle edge computing system using 3d point clouds. In: Proceedings of the 4th ACM/IEEE Symposium on Edge Computing. pp. 88-100 (2019)", + "4. Chen, Z., Shi, Y., Jia, J.: Transiff: An instance-level feature fusion framework for vehicle-infrastructure cooperative 3d detection with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18205-18214 (2023)", + "5. Deng, J., Shi, S., Li, P., Zhou, W., Zhang, Y., Li, H.: Voxel r-cnn: Towards high performance voxel-based 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 1201-1209 (2021)", + "6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: Carla: An open urban driving simulator. In: Conference on robot learning. pp. 1-16. PMLR (2017)", + "7. Goodfellow, I., Warde-Farley, D., Mirza, M., Courville, A., Bengio, Y.: Maxout networks. In: International conference on machine learning. pp. 1319-1327. PMLR (2013)", + "8. Guo, Y., Ma, J., Leslie, E., Huang, Z.: Evaluating the effectiveness of integrated connected automated vehicle applications applied to freeway managed lanes. IEEE Transactions on Intelligent Transportation Systems 23(1), 522-536 (2020)", + "9. Hu, Y., Fang, S., Lei, Z., Zhong, Y., Chen, S.: Where2comm: Communication-efficient collaborative perception via spatial confidence maps. Advances in neural information processing systems 35, 4874-4886 (2022)", + "10. Hu, Y., Fang, S., Xie, W., Chen, S.: Aerial monocular 3d object detection. IEEE Robotics and Automation Letters 8(4), 1959-1966 (2023)", + "1. Huang, J., Huang, G.: Bevdet4d: Exploit temporal cues in multi-camera 3d object detection. arXiv preprint arXiv:2203.17054 (2022)", + "2. Huang, J., Huang, G., Zhu, Z., Ye, Y., Du, D.: Bevdet: High-performance multicamera 3d object detection in bird-eye-view. arXiv preprint arXiv:2112.11790 (2021)", + "3. Lang, A.H., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: Pointpillars: Fast encoders for object detection from point clouds. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12697-12705 (2019)", + "4. Li, J., Li, R., Li, J., Wang, J., Wu, Q., Liu, X.: Dual-view 3d object recognition and detection via lidar point cloud and camera image. Robotics and Autonomous Systems 150, 103999 (2022)", + "5. Li, Y., Ren, S., Wu, P., Chen, S., Feng, C., Zhang, W.: Learning distilled collaboration graph for multi-agent perception. Advances in Neural Information Processing Systems 34, 29541-29552 (2021)" + ], + "bbox": [ + 225, + 231, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 429, + 114, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "16. Li, Y., Ge, Z., Yu, G., Yang, J., Wang, Z., Shi, Y., Sun, J., Li, Z.: Bevdepth: Acquisition of reliable depth for multi-view 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 1477-1485 (2023)", + "17. Li, Z., Wang, W., Li, H., Xie, E., Sima, C., Lu, T., Qiao, Y., Dai, J.: Bevformer: Learning bird's-eye-view representation from multi-camera images via spatiotemporal transformers. In: European conference on computer vision. pp. 1-18. Springer (2022)", + "18. Lin, T.Y., Goyal, P., Girshick, R., He, K., Dollar, P.: Focal loss for dense object detection. In: Proceedings of the IEEE international conference on computer vision. pp. 2980-2988 (2017)", + "19. Liu, H., Teng, Y., Lu, T., Wang, H., Wang, L.: Sparsebev: High-performance sparse 3d object detection from multi-camera videos. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18580-18590 (2023)", + "20. Liu, Y.C., Tian, J., Glaser, N., Kira, Z.: When2com: Multi-agent perception via communication graph grouping. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 4106-4115 (2020)", + "21. Liu, Y., Wang, T., Zhang, X., Sun, J.: Petr: Position embedding transformation for multi-view 3d object detection. In: European Conference on Computer Vision. pp. 531-548. Springer (2022)", + "22. Liu, Y., Yan, J., Jia, F., Li, S., Gao, A., Wang, T., Zhang, X.: Petrov2: A unified framework for 3d perception from multi-camera images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3262-3272 (2023)", + "23. Liu, Z., Wu, Z., Toth, R.: Smoke: Single-stage monocular 3d object detection via keypoint estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 996-997 (2020)", + "24. Lu, Y., Hu, Y., Zhong, Y., Wang, D., Chen, S., Wang, Y.: An extensible framework for open heterogeneous collaborative perception. arXiv preprint arXiv:2401.13964 (2024)", + "25. Lu, Y., Li, Q., Liu, B., Dianati, M., Feng, C., Chen, S., Wang, Y.: Robust collaborative 3d object detection in presence of pose errors. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 4812-4818. IEEE (2023)", + "26. Philion, J., Fidler, S.: Lift, splat, shoot: Encoding images from arbitrary camera rigs by implicitly unprojecting to 3d. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 194-210. Springer (2020)", + "27. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 652-660 (2017)", + "28. Raboy, K., Ma, J., Leslie, E., Zhou, F.: A proof-of-concept field experiment on cooperative lane change maneuvers using a prototype connected automated vehicle testing platform. Journal of Intelligent Transportation Systems 25(1), 77-92 (2021)", + "29. Reading, C., Harakeh, A., Chae, J., Waslander, S.L.: Categorical depth distribution network for monocular 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8555-8564 (2021)", + "30. Roddick, T., Kendall, A., Cipolla, R.: Orthographic feature transform for monoc- ular 3d object detection. arXiv preprint arXiv:1811.08188 (2018)", + "31. Rukhovich, D., Vorontsova, A., Konushin, A.: Imvoxelnet: Image to voxels projection for monocular and multi-view general-purpose 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2397-2406 (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "32. Shladover, S.E.: Opportunities and challenges in cooperative road vehicle automation. IEEE Open Journal of Intelligent Transportation Systems 2, 216-224 (2021)", + "33. Tan, M., Le, Q.: Efficientnet: Rethinking model scaling for convolutional neural networks. In: International conference on machine learning. pp. 6105-6114. PMLR (2019)", + "34. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021)", + "35. Wang, T., Zhu, X., Pang, J., Lin, D.: Fcos3d: Fully convolutional one-stage monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 913-922 (2021)", + "36. Wang, T.H., Manivasagam, S., Liang, M., Yang, B., Zeng, W., Urtasun, R.: V2vnet: Vehicle-to-vehicle communication for joint perception and prediction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part II 16. pp. 605–621. Springer (2020)", + "37. Wang, Y., Chao, W.L., Garg, D., Hariharan, B., Campbell, M., Weinberger, K.Q.: Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8445-8453 (2019)", + "38. Wang, Y., Guizilini, V.C., Zhang, T., Wang, Y., Zhao, H., Solomon, J.: Detr3d: 3d object detection from multi-view images via 3d-to-2d queries. In: Conference on Robot Learning. pp. 180-191. PMLR (2022)", + "39. Xiang, H., Xu, R., Ma, J.: Hm-vit: Hetero-modal vehicle-to-vehicle cooperative perception with vision transformer. arXiv preprint arXiv:2304.10628 (2023)", + "40. Xu, R., Guo, Y., Han, X., Xia, X., Xiang, H., Ma, J.: Opencda: an open cooperative driving automation framework integrated with co-simulation. In: 2021 IEEE International Intelligent Transportation Systems Conference (ITSC). pp. 1155-1162. IEEE (2021)", + "41. Xu, R., Tu, Z., Xiang, H., Shao, W., Zhou, B., Ma, J.: Cobevt: Cooperative bird's eye view semantic segmentation with sparse transformers. arXiv preprint arXiv:2207.02202 (2022)", + "42. Xu, R., Xiang, H., Tu, Z., Xia, X., Yang, M.H., Ma, J.: V2x-vit: Vehicle-to-everything cooperative perception with vision transformer. In: European conference on computer vision. pp. 107-124. Springer (2022)", + "43. Xu, R., Xiang, H., Xia, X., Han, X., Li, J., Ma, J.: Opv2v: An open benchmark dataset and fusion pipeline for perception with vehicle-to-vehicle communication. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 2583-2589. IEEE (2022)", + "44. Yan, Y., Mao, Y., Li, B.: Second: Sparsely embedded convolutional detection. Sensors 18(10), 3337 (2018)", + "45. Yang, C., Chen, Y., Tian, H., Tao, C., Zhu, X., Zhang, Z., Huang, G., Li, H., Qiao, Y., Lu, L., et al.: Bevformer v2: Adapting modern image backbones to bird's-eye-view recognition via perspective supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17830-17839 (2023)", + "46. Yin, T., Zhou, X., Krahenbuhl, P.: Center-based 3d object detection and tracking. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11784-11793 (2021)", + "47. Yu, H., Luo, Y., Shu, M., Huo, Y., Yang, Z., Shi, Y., Guo, Z., Li, H., Hu, X., Yuan, J., et al.: Dair-v2x: A large-scale dataset for vehicle-infrastructure cooperative 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21361-21370 (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IFTR: An Instance-Level Fusion Transformer", + "bbox": [ + 429, + 114, + 730, + 127 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "48. Zhang, R., Qiu, H., Wang, T., Guo, Z., Cui, Z., Qiao, Y., Li, H., Gao, P.: Monodetr: Depth-guided transformer for monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9155-9166 (2023)", + "49. Zhou, B., Krahenbihl, P.: Cross-view transformers for real-time map-view semantic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13760-13769 (2022)", + "50. Zhou, Y., Tuzel, O.: Voxelnet: End-to-end learning for point cloud based 3d object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4490-4499 (2018)", + "51. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020)" + ], + "bbox": [ + 215, + 146, + 785, + 314 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "S. Wang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_model.json b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_model.json new file mode 100644 index 0000000000000000000000000000000000000000..0927411e4b365b4bafc0dbdccce5cfff453e1ee2 --- /dev/null +++ b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_model.json @@ -0,0 +1,2381 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.224, + 0.141, + 0.78, + 0.187 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer for Visual Collaborative Perception" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.212, + 0.784, + 0.245 + ], + "angle": 0, + "content": "Shaohong Wang\\(^{1}\\), Lu Bin\\(^{1}\\), Xinyu Xiao\\(^{2}\\), Zhiyu Xiang\\(^{1}\\), Hangguan Shan\\(^{1}\\), and Eryun Liu\\(^{1*}\\)" + }, + { + "type": "text", + "bbox": [ + 0.253, + 0.255, + 0.751, + 0.313 + ], + "angle": 0, + "content": "\\(^{1}\\) Zhejiang University, Hangzhou, China {wangsh0111,lubin2022, xiangzy, hshan, eryunliu}@zju.edu.cn \\(^{2}\\) Institute of Automation of Chinese Academy of Sciences, Beijing, China xinyu.xiao@nlpr.ia.ac.cn" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.351, + 0.744, + 0.685 + ], + "angle": 0, + "content": "Abstract. Multi-agent collaborative perception has emerged as a widely recognized technology in the field of autonomous driving in recent years. However, current collaborative perception predominantly relies on Li-DAR point clouds, with significantly less attention given to methods using camera images. This severely impedes the development of budget-constrained collaborative systems and the exploitation of the advantages offered by the camera modality. This work proposes an instance-level fusion transformer for visual collaborative perception (IFTR), which enhances the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. To capture the visual information from multiple agents, we design an instance feature aggregation that interacts with the visual features of individual agents using predefined grid-shaped bird eye view (BEV) queries, generating more comprehensive and accurate BEV features. Additionally, we devise a cross-domain query adaptation as a heuristic to fuse 2D priors, implicitly encoding the candidate positions of targets. Furthermore, IFTR optimizes communication efficiency by sending instance-level features, achieving an optimal performance-bandwidth trade-off. We evaluate the proposed IFTR on a real dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, achieving performance improvements of \\(57.96\\%\\), \\(9.23\\%\\) and \\(12.99\\%\\) in AP@70 metrics compared to the previous SOTAs, respectively. Extensive experiments demonstrate the superiority of IFTR and the effectiveness of its key components. The code is available at https://github.com/wangsh0111/IFTR." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.697, + 0.741, + 0.726 + ], + "angle": 0, + "content": "Keywords: BEV Queries, Query Adaptation, Visual Collaborative Perception, Transformer" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.753, + 0.377, + 0.768 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.786, + 0.788, + 0.817 + ], + "angle": 0, + "content": "3D object detection is a fundamental task in computer vision, aiming to locate objects in 3D physical space given sensor inputs. It is crucial in various" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.386, + 0.84 + ], + "angle": 0, + "content": "* Corresponding author." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.283 + ], + "angle": 0, + "content": "applications such as autonomous driving [17, 27, 44, 48], robotics [14], and unmanned aerial vehicles [10]. Despite significant advancements in LiDAR-based methods [5, 13, 46, 50], camera-based approaches [26, 29, 35, 38, 46] have garnered widespread attention in recent years. In comparison to LiDAR, cameras have lower deployment costs, are more easily scalable, and provide valuable visual cues for detecting distant objects and identifying vision-based road elements (such as traffic lights and lane markings) [17]. However, due to the lack of depth information in RGB images, solely camera-based 3D object detection is often noticeably inferior to lidar-based detection in most scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.288, + 0.789, + 0.515 + ], + "angle": 0, + "content": "The latest advancements in V2X communication technology and Intelligent Transportation Systems enable intelligent agents to share information between each other [1,8,28,32,47]. Through multi-agent interactions, the limitations of individual agent perception, such as occlusion and long-range issues, can be alleviated, thereby enhancing the performance of camera-based 3D object detection. Currently, the prevailing frameworks for collaborative perception [9, 36, 41-43] primarily involve the fusion at the Bird's Eye View (BEV) feature level. However, this paradigm is highly sensitive to the accuracy of BEV features for individual agents and faces challenges in spatial alignment, imposing stringent requirements on real-time poses between agents, leading to insufficient robustness in feature fusion. Nevertheless, due to the lack of depth information in RGB images, generating BEV features from a 2D plane is ill-posed. Therefore, the detection performance of visual collaborative perception methods based solely on BEV features level in camera settings is impacted by compounded errors, where inaccurate BEV features can severely impact the final performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.519, + 0.788, + 0.595 + ], + "angle": 0, + "content": "Diverging from multi-camera 3D object detection, V2X collaborative perception must also account for the constraints of communication bandwidth. It is crucial to address how to reduce communication bandwidth while ensuring collaborative perception performance. Each agent must select visual features with the maximum information content to optimize communication efficiency." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.789, + 0.842 + ], + "angle": 0, + "content": "In this paper, we propose IFTR, a robust and efficient transformer-based instance-level feature fusion framework. Our central idea is to extract spatial features from regions of interest in cross-agent camera views to generate BEV features, and implicitly encode candidate positions of objects in 3D space through a heuristic adaptive approach. Specifically, IFTR incorporates three key designs: i) Instance feature aggregation, aggregating spatial information from visual features of multiple agent camera views using predefined grid-shaped BEV queries. This is achieved through a transformer to implement robust and adaptive feature fusion, avoiding strict spatial alignment requirements in BEV feature-level fusion strategies. It also eliminates the dependency on high-accuracy single-agent BEV features and real-time pose accuracy. ii) Message selection and feature map reconstruction, reducing bandwidth consumption by sharing instance-level visual features rather than entire image features. iii) Cross-domain query adaptation, encoding instance-level features as object queries, combining them with the original learnable object queries to form the new hybrid object queries. This is then input into a deformable DETR head [2,51] for end-to-end 3D object detection." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.429, + 0.115, + 0.733, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.222 + ], + "angle": 0, + "content": "To evaluate IFTR, we conduct extensive experiments on a real-world dataset, DAIR-V2X [47], and two simulated datasets, OPV2V [43] and V2XSet [42]. The experimental results indicate that IFTR significantly outperforms previous works in the performance-bandwidth trade-off across multiple datasets. To sum up, the main contributions are as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.235, + 0.784, + 0.295 + ], + "angle": 0, + "content": "- We introduce IFTR, a superior camera-only instance-level feature fusion framework based on transformers. This framework addresses occlusion and long-range issues through multi-agent collaboration, achieving more accurate and complete 3D object detection." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.296, + 0.784, + 0.34 + ], + "angle": 0, + "content": "- We devise an instance feature aggregation that utilizes learnable BEV queries to aggregate spatial information from multiple agents, resulting in more accurate BEV features." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.342, + 0.784, + 0.402 + ], + "angle": 0, + "content": "- We design a cross-domain query adaptation module by encoding instance-level features as object queries, facilitating the implicit encoding of candidate positions for targets in 3D space, which alleviates the problem of target spatial distribution differences between the training set and the test set." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.403, + 0.784, + 0.493 + ], + "angle": 0, + "content": "- We develop communication-efficient collaboration techniques by sharing the most informative visual features to reduce communication overhead. Our IFTR achieves state-of-the-art performance on a real world dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, with AP@70 metrics improving by \\(57.96\\%\\), \\(9.23\\%\\) and \\(12.99\\%\\) compared to the previous SOTAs, respectively." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.235, + 0.784, + 0.493 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.52, + 0.388, + 0.536 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.555, + 0.557, + 0.57 + ], + "angle": 0, + "content": "2.1 Camera-based 3D Object Detection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.583, + 0.788, + 0.764 + ], + "angle": 0, + "content": "Given an RGB image and the corresponding camera parameters, the purpose of image-based 3D object detection is to classify and locate the objects of interest. Since images lack depth information, this problem is ill-posed and more challenging compared to 2D detection. FCOS3D [35] and SMOKE [23] extend 2D detection networks by utilizing fully convolutional networks to directly regress the depth for each object. Pseudo LiDAR [37] employs a depth estimation network to transform 2D images into 3D pseudo-point cloud signals, followed by the use of a lidar-based detection network for 3D detection. DETR3D [38] utilizes a set of sparse 3D queries to index 2D features extracted from multi-view images, samples corresponding features, enabling end-to-end 3D detection box prediction without the need for time-consuming post-processing like NMS (Non-Maximum Suppression)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Recently, there has been widespread attention on BEV representations due to their ability to clearly depict object positions and scales, coupled with efficient computational efficiency. OFT [30] and ImVoxelNet [31] project predefined voxels onto image features, generating voxel representations of the scene. LSS [26] and CaDDN [29] utilize view transformation modules to convert dense 2D image" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.329 + ], + "angle": 0, + "content": "features into BEV space. CVT [49] leverages position encoding from camera perception and dense cross-attention to correlate perspective view and BEV view features. BEVDet [11, 12] and BEVDepth [16] use lift-splat operations for view transformation. PETR [21, 22] utilizes 3D position encoding and global cross-attention for feature fusion, transforming 2D features into 3D position-aware representations. BEVFormer [17, 45] effectively aggregates spatio-temporal features from a surround-view camera and historical BEV features using deformable attention, generating unified BEV features. SparseBEV [19] adapts self-attention with an adaptive receptive field for feature aggregation in BEV space, enjoying the advantages of BEV space without explicitly constructing dense BEV features. In this work, we choose the single-scale and history-free BEVFormer-S [17] as the single-agent 3D object detector for computational efficiency." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.349, + 0.468, + 0.365 + ], + "angle": 0, + "content": "2.2 Collaborative Perception" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.372, + 0.789, + 0.735 + ], + "angle": 0, + "content": "Collaborative perception is an emerging application in multi-agent systems, aiming to enhance perceptual performance by facilitating communication among other agents for the shared exchange of information. Based on its message sharing strategy, it can be categorized into three types: early fusion (i.e. sharing raw sensor information), intermediate fusion (i.e. sharing intermediate layer features of neural networks), and late fusion (i.e. sharing 3D detection results, such as 3D bounding box position and confidence score). Early fusion usually requires large transmission bandwidth, while late fusion cannot provide valuable scenario context. Intermediate fusion achieves a better trade-off between performance and bandwidth. When2com [20] introduces a handshake mechanism to determine when to communicate and create sparse communication graph. OPV2V [43] utilizes a single-head self-attention module to fuse features, while F-Cooper [3] employs a maxout [7] fusion operation. V2VNet [36] utilizes a spatially aware graph neural network to aggregate shared feature representations among multiple vehicles. DiscoNet [15] adopts knowledge distillation to leverage the advantages of both early and intermediate collaboration. V2X-ViT [42] introduces a novel heterogeneous multi-agent attention module to fuse information across heterogeneous agents. Where2comm [9] introduces a spatial confidence map to reduce communication bandwidth consumption. TransIFF [4] further reduces communication bandwidth consumption by transmitting object queries. CoAlign [25] employs learnable or mathematical methods to correct pose errors for more accurate collaborative perception. HM-ViT [39] and HEAL [24] investigate multi-agent heterogeneous modality collaborative perception problems with different sensor modalities, expanding the scale of collaboration." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "However, prior collaborative perception efforts [4,9,25,36,42,43] have primarily focused on lidar-based 3D object detection, yielding suboptimal performance in a camera-only setup. We speculate that the reason lies in the inferior quality of BEV features from a single-agent compared to lidar-based methods, resulting in suboptimal solutions at the BEV feature level. In this paper, we propose a novel camera-only instance-level feature fusion framework with lower communication bandwidth consumption. It generates more accurate BEV features and" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.43, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.145, + 0.78, + 0.389 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.4, + 0.788, + 0.484 + ], + "angle": 0, + "content": "Fig. 1: Overall architecture of IFTR. i) We employ the message selection and feature map reconstruction module to share instance-level features, reducing bandwidth consumption; ii) In instance feature aggregation (IFA), each BEV query interacts only with image features from regions of interest from multiple views; iii) In CDQA, we encode the feature map information and 3D positional information of each instance into 3D object query." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.516, + 0.788, + 0.562 + ], + "angle": 0, + "content": "3D object queries tailored to each instance by leveraging instance-level features shared among multiple agents, thereby achieving more efficient and practical collaborative perception." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.591, + 0.309, + 0.607 + ], + "angle": 0, + "content": "3 IFTR" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.789, + 0.842 + ], + "angle": 0, + "content": "This section presents IFTR, a robust and efficient camera-only instance-level feature fusion framework for collaborative perception. As depicted in Fig. 1, IFTR comprises an image encoder, message selection and feature map reconstruction, cascade instance feature aggregation, cross-domain query adaptation, and a DETR decoder. The image encoder is utilized to extract visual features from the input images. The proposed message selection and feature map reconstruction module are employed at the sender and receiver ends, respectively, for instance-level visual feature filtering and image feature reconstruction, effectively saving communication bandwidth. Based on visual features from multiple camera views, the proposed cascade instance feature aggregation generates comprehensive and accurate BEV features; the proposed cross-domain query adaptation module encodes instance-level visual features into object queries to encode candidate positions for the targets, combining them with the original learnable object queries to form the hybrid object queries. Ultimately, the DETR decoder" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.785, + 0.178 + ], + "angle": 0, + "content": "takes the BEV features and the hybrid object queries as inputs to predict the target's category and location information." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.2, + 0.387, + 0.215 + ], + "angle": 0, + "content": "3.1 Image Encoder" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.225, + 0.784, + 0.346 + ], + "angle": 0, + "content": "We leverage EfficientNet [33, 34] to extract visual features from the input images because of its high performance and low computational complexity. Given \\( L \\) agents and \\( N_{\\text{cams}} \\) camera views for each agent, \\( F_i^k \\in \\mathbb{R}^{fC \\times fH \\times fW} \\) is used to represent the extracted feature map of the \\( k \\)-th camera view of the \\( i \\)-th agent, where \\( fC \\), \\( fH \\) and \\( fW \\) are the channel, height and width of the feature map. Considering different agents may have different camera views, the feature maps of views that not exist are set to zero when the actual number of camera views less than \\( N_{\\text{cams}} \\) and use a mask to indicate the valid feature maps." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.368, + 0.689, + 0.384 + ], + "angle": 0, + "content": "3.2 Message Selection and Feature Map Reconstruction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.393, + 0.785, + 0.514 + ], + "angle": 0, + "content": "To achieve accurate and comprehensive 3D object detection, it is imperative for each agent to exchange visual features and leverage complementary information. We propose communication-efficient collaborative techniques by sharing the most informative visual features to reduce communication overhead. The intuition is that foreground regions contain more informative content than background regions. During collaboration, visual features of regions with objects can assist in recovering missed objects due to occlusion or long-range issues, while background regions can be omitted to reduce the system's communication load." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.515, + 0.785, + 0.544 + ], + "angle": 0, + "content": "Given a feature map \\( F_{j}^{k} \\), the message sent for sharing is selected by the following steps:" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.554, + 0.784, + 0.599 + ], + "angle": 0, + "content": "1. Extracting a set of candidate object instances by a 2D object detector. All the confidence values of instance are greater than a predefined threshold, \\( c_{\\text{thre}} \\)." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.599, + 0.785, + 0.629 + ], + "angle": 0, + "content": "2. Cropping the feature map of each instance by the predicted bounding box in inference stage or by the ground truth bounding box in the training stage." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.629, + 0.785, + 0.66 + ], + "angle": 0, + "content": "3. The cropped feature map of the \\(n\\)-th selected instance, \\(F_{j \\to i}^{k,n}\\), and bounding box are sent to the \\(i\\)-th agent for sharing." + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.554, + 0.785, + 0.66 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.67, + 0.785, + 0.747 + ], + "angle": 0, + "content": "At the side of ego agent (or the \\(i\\)-th agent), the received object instance feature maps of the \\(k\\)-th camera view of the \\(j\\)-th agent are first combined together to reconstruct the feature map, \\(\\mathcal{F}_{j\\rightarrow i}^{k}\\), of foreground regions of original feature map \\(F_{j}^{k}\\) by filling back the cropped features. The features in background region are set to zero." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.77, + 0.506, + 0.785 + ], + "angle": 0, + "content": "3.3 Instance Feature Aggregation" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.795, + 0.785, + 0.841 + ], + "angle": 0, + "content": "Given a set of received foreground feature maps, \\(\\{\\mathcal{F}_{j\\rightarrow i}^k |j = 1,2,\\dots ,N_{agent},k = 1,2,\\ldots ,N_{cams}\\}\\), where \\(N_{agent}\\) is the number of agents, the purpose of instance feature aggregation (IFA) module is to form a BEV feature map by aggregating" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.429, + 0.115, + 0.733, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.145, + 0.418, + 0.35 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.295, + 0.352, + 0.327, + 0.362 + ], + "angle": 0, + "content": "(a) IFA" + }, + { + "type": "image", + "bbox": [ + 0.429, + 0.146, + 0.779, + 0.35 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.581, + 0.352, + 0.627, + 0.362 + ], + "angle": 0, + "content": "(b) MVFA" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.379, + 0.785, + 0.407 + ], + "angle": 0, + "content": "Fig. 2: (a) The architecture of our proposed Instance Feature Aggregation (IFA); (b) Multi-View Feature Aggregation (MVFA) illustrated in Sec. 3.3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.439, + 0.784, + 0.5 + ], + "angle": 0, + "content": "features from all received foreground feature maps. Since all camera views are treated equally in IFA module, for simplicity, we represent all the foreground feature maps by \\(\\{\\mathcal{F}_v|v = 1,2,\\dots ,N_v\\}\\), where the total number of views is \\(N_{v} = N_{agent}\\times N_{cams}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.501, + 0.785, + 0.591 + ], + "angle": 0, + "content": "The BEV space around the ego agent is divided into a discrete grid space of size \\( H \\times W \\). The origin of ego coordinate is at the center of BEV grid. To construct a feature map on the BEV space of the ego agent by fusing reconstructed feature maps \\( \\{\\mathcal{F}_i | i = 1,2,\\dots,N_v\\} \\) from all collaborative views, we propose a deformable attention based cascade instance feature aggregation (IFA) module (see Fig. 2). The BEV feature map is obtained by the following steps:" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.604, + 0.785, + 0.634 + ], + "angle": 0, + "content": "1. A set of learnable parameters \\( Q_{\\mathrm{bev}} \\in \\mathbb{R}^{C \\times H \\times W} \\) is predefined and randomly initialized at the first IFA block." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.636, + 0.791, + 0.697 + ], + "angle": 0, + "content": "2. For a given grid centered at \\((x,y)\\), a set of points \\(\\{(x,y,z_h)|h = 1,2,\\dots,N_{ref}\\}\\) is selected as reference points, where \\(\\{z_h|h = 1,2,\\dots,N_{ref}\\}\\) are predefined heights for each grid. The reference points are used as feature indices to gather information from collaborative feature maps." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.698, + 0.785, + 0.729 + ], + "angle": 0, + "content": "3. For a reference point \\((x,y,z_h)\\) at grid \\((x,y)\\), the corresponding feature vector is aggregated by" + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.604, + 0.791, + 0.729 + ], + "angle": 0, + "content": null + }, + { + "type": "equation", + "bbox": [ + 0.42, + 0.73, + 0.61, + 0.771 + ], + "angle": 0, + "content": "\\[\nF _ {b e v} ^ {h} (x, y) = \\frac {1}{| w |} \\sum_ {v = 1} ^ {N _ {v}} w _ {v} f _ {v} ^ {h},\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.78, + 0.785, + 0.84 + ], + "angle": 0, + "content": "where \\( w_v \\in \\{0,1\\} \\) indicates whether the reference point \\( (x,y,z_h) \\) is projected inside the image space of the \\( v \\)-th camera view, and \\( |w| = \\sum_v w_v \\) is total number of views observing the reference point, and \\( f_v^h \\) is the output of a deformable attention module, which will be described later in this section." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.147, + 0.784, + 0.191 + ], + "angle": 0, + "content": "4. The aggregated BEV feature \\( F_{bev} \\) is the average feature over all \\( N_{ref} \\) reference points for each grid and followed by a feed forward network (FFN) and an Add&Norm module to get the output \\( \\hat{F}_{bev} \\) of IFA module." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.192, + 0.785, + 0.238 + ], + "angle": 0, + "content": "5. The above four steps assemble an IFA module. To sufficiently fuse all camera view features, we cascade 6 IFA modules sequentially, with the previous IFA output \\(\\hat{F}_{\\text{bev}}\\) as the input \\(Q_{\\text{bev}}\\) of the next IFA." + }, + { + "type": "list", + "bbox": [ + 0.221, + 0.147, + 0.785, + 0.238 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.248, + 0.787, + 0.352 + ], + "angle": 0, + "content": "Given a reference point \\((x,y,z_h)\\) at grid \\((x,y)\\) and the feature map \\(\\mathcal{F}_v\\) of \\(v\\)-th camera view, if point \\((x,y,z_h)\\) is observed by the \\(v\\)-th camera view, the deformable attention first takes a feature vector \\(\\hat{Q}_{\\mathrm{bev}}(x,y)\\) from \\(\\hat{Q}_{\\mathrm{bev}}\\) and the vector \\(\\hat{Q}_{\\mathrm{bev}}(x,y)\\) is then fed into a MLP layer. The MLP layer output a list of offset vectors \\((o_1,o_2,\\dots,o_{N_{da}})\\) and a weight vector \\(\\lambda = (\\lambda_1,\\lambda_2,\\dots,\\lambda_{N_{da}})\\), where \\(N_{da}\\) is the number of positions in attention, the output of deformable attention is" + }, + { + "type": "equation", + "bbox": [ + 0.422, + 0.353, + 0.585, + 0.392 + ], + "angle": 0, + "content": "\\[\nf _ {v} ^ {h} = \\sum_ {i = 1} ^ {N _ {d a}} \\lambda_ {i} \\mathcal {F} _ {v} (p + o _ {i}),\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.4, + 0.704, + 0.416 + ], + "angle": 0, + "content": "where \\(p\\) is the projected image coordinate of \\((x,y,z_h)\\) on \\(v\\)-th view." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.439, + 0.535, + 0.455 + ], + "angle": 0, + "content": "3.4 Cross-Domain Query Adaptation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.466, + 0.788, + 0.616 + ], + "angle": 0, + "content": "The object decoder of BEVformer [17] is a DETR [2,51] decoder that receives a set of learned embeddings as object queries, aiming to learn potential locations of target objects during training. However, it takes a considerable amount of time for randomly initialized embeddings to converge to suitable positions. Additionally, during inference, object queries remain fixed for all images, while the spatial distribution of target objects may vary, leading to potentially inaccurate results. To address this issue, we employ a cross-domain query adaptation (CDQA) module to initialize object queries for decoder. This module implicitly encodes candidate positions for the target, making it easier for the detection head to capture the target object accurately." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.618, + 0.787, + 0.677 + ], + "angle": 0, + "content": "The maximum number of queries for decoder is set to \\( N_{Q} \\). The initial set of queries consists of two parts. The first part of queries is obtained from selected instances of all ego and collaborative camera views and the second part (the rest) of queries is randomly initialized." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.678, + 0.787, + 0.739 + ], + "angle": 0, + "content": "Given a set of shared instance features \\(\\{(\\mathcal{I}_n,B_n)|n = 1,2,\\ldots ,N_I\\}\\) from all collaborative and ego views, where \\(N_{I}\\) is total number of instances, \\(\\mathcal{I}_n\\) is the \\(n\\)-th cropped instance feature map, and \\(B_{n}\\) is the bounding box coordinates, the queries is obtained as following" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.749, + 0.784, + 0.779 + ], + "angle": 0, + "content": "1. Global average pooling (GAP) on instance feature maps and then followed by a MLP module to get a set of feature vector \\(\\{\\mathcal{I}_n^p | n = 1, 2, \\dots, N_I\\}\\)." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.78, + 0.785, + 0.839 + ], + "angle": 0, + "content": "2. Encode the instance position information into a vector by a MLP layer, obtaining a set of position embeddings \\(\\{\\mathcal{V}_n|n = 1,2,\\ldots ,N_I\\}\\). The input to the MLP is the concatenate of three coordinates \\((p_1,p_2,c)\\), where \\(p_1,p_2\\) are the 3D coordinates of left-top and bottom-right point of instance bounding" + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.749, + 0.785, + 0.839 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.429, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.147, + 0.784, + 0.191 + ], + "angle": 0, + "content": "box on the focal plane and \\( c \\) is the coordinate of corresponding camera origin. All coordinates are projected to the ego coordinate system. The three points indicate a cone where the object lies." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.192, + 0.784, + 0.237 + ], + "angle": 0, + "content": "3. Combine the feature vectors and position embeddings by adding, obtaining the instance feature initialized set of queries \\(\\{\\mathcal{I}_n^p +\\mathcal{V}_n|n = 1,2,\\ldots ,N_I\\}\\) for object decoder." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.245, + 0.784, + 0.276 + ], + "angle": 0, + "content": "The union, \\( Q_{\\mathrm{hybrid}} \\), of the instance feature initialized set of queries and the randomly initialized set of queries is then used as queries of object decoder." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.296, + 0.393, + 0.312 + ], + "angle": 0, + "content": "3.5 Object Decoder" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.32, + 0.785, + 0.428 + ], + "angle": 0, + "content": "The object decoder of IFTR employs a deformable DETR detection head, taking the BEV features \\(\\hat{F}_{bev} \\in \\mathbb{R}^{C \\times H \\times W}\\) and the hybrid object queries \\(Q_{\\mathrm{hybrid}} \\in \\mathbb{R}^{N_Q \\times C}\\) as input, producing detection results \\(\\mathcal{O} = \\Phi_{\\mathrm{dec}}(\\hat{F}_{bev}, Q_{\\mathrm{hybrid}}) \\in \\mathbb{R}^{N_Q \\times 8}\\). Each position of \\(\\mathcal{O}\\) represents a rotated box with class \\((c, x, y, z, w, l, h, \\theta)\\), denoting class confidence, position, size and angle. The objects are the final output of the proposed collaborative perception system. We utilize the \\(\\ell_1\\) loss for regression and the focal loss [18] for classification." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.449, + 0.376, + 0.466 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.479, + 0.427, + 0.495 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.502, + 0.785, + 0.683 + ], + "angle": 0, + "content": "Datasets. To evaluate the performance of IFTR on the visual collaborative perception task, we conduct extensive experiments on three multi-agent datasets, including V2XSet [42], OPV2V [43], and DAIR-V2X [47]. V2XSet [42] is a simulated dataset supporting V2X perception, co-simulated by CARLA [6] and OpenCDA [40]. It comprises 73 representative scenes with 2 to 5 connected agents and 11,447 annotated 3D frames, with an image resolution of \\(600 \\times 800\\). OPV2V [43] is a large-scale vehicle-to-vehicle collaborative perception dataset, comprising 12,000 LiDAR point cloud frames and RGB images with 230,000 annotations of 3D bounding boxes, with an image resolution of \\(600 \\times 800\\). DAIR-V2X [47] is a real-world vehicle-to-infrastructure collaborative perception dataset, consists of 100 realistic scenes and 18,000 data samples, with an image resolution of \\(1080 \\times 1920\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Implementation details. We use the single-scale and history-free BEVFormerS [17] as the 3D object detector for single agent. We employ EfficientNet [33,34] as the image backbone for better computation efficiency and utilize a smaller grid resolution \\((0.4\\mathrm{m})\\) to retain fine-trained spatial details. The intermediate BEV feature map has a dimension of \\(256\\times 256\\times 256\\), with a perception range defined as \\(x\\in [-51.2\\mathrm{m},51.2\\mathrm{m}]\\) and \\(y\\in [-51.2\\mathrm{m},51.2\\mathrm{m}]\\). Following prior research [41-43], we only modified the fusion module of different intermediate fusion methods while keeping the other components such as camera feature extractor and detection head the same. As IFTR involves instance-level fusion of" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.144, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Table 1: 3D detection performance comparison on the V2XSet [42], OPV2V [43] and DAIR-V2X [47] datasets. The results are reported in Average Precision (AP) at IoU=0.30, 0.50 and 0.70 on perfect settings." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.199, + 0.812, + 0.343 + ], + "angle": 0, + "content": "
MethodV2XSetOPV2VDAIR-V2X
AP@30AP@50AP@70AP@30AP@50AP@70AP@30AP@50AP@70
No Collaboration0.43430.30370.13790.56520.45940.25560.21020.07090.0080
Late Fusion0.68030.51410.25590.87890.77620.51920.29520.16310.0421
V2VNet [36]0.68860.59540.39000.86820.79060.57590.25810.13540.0276
V2X-ViT [42]0.66900.59140.41230.85120.78410.58380.25440.14020.0277
Where2comm [9]0.69690.61690.43960.84710.77140.58600.26130.14240.0296
CoBEVT [41]0.66290.58840.40810.87090.80260.59340.26080.14530.0255
CoAlign [25]0.75640.64790.39640.86890.80210.60460.26450.14700.0262
IFTR0.80570.71730.49670.92330.85560.66040.38550.20580.0665
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.37, + 0.786, + 0.416 + ], + "angle": 0, + "content": "2D image features, we construct it following the method proposed in Sec. 3 and straightforwardly add a late fusion strategy to explore its combined effects with other fusion strategies." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.438, + 0.788, + 0.512 + ], + "angle": 0, + "content": "Evaluation metrics. We evaluate the detection performance using Average Precision (AP) metrics with Intersection over Union (IoU) thresholds of 0.30, 0.50, and 0.70. Additionally, the communication volume follows the standard setting as [4,9,42,43] that counts the message size by byte in log scale with base 2." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.536, + 0.46, + 0.551 + ], + "angle": 0, + "content": "4.2 Quantitative Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.561, + 0.788, + 0.759 + ], + "angle": 0, + "content": "Benchmark comparison. Tab. 1 compares the proposed IFTR with previous collaborative methods. We consider single-agent detection without collaboration (No collaboration), V2VNet [36], V2XViT [42], Where2comm [9], CoBEVT [41], CoAlign [25] and late fusion, where late fusion directly exchanges 3D detection boxes. We observe that the proposed IFTR outperforms previous methods on both real-world and simulated datasets, demonstrating the superiority of our model and its robustness to various realistic noises. Specifically, the SOTA performance of AP@70 on the V2XSet, OPV2V and DAIR-V2X datasets is improved by \\(12.99\\%\\), \\(9.23\\%\\) and \\(57.96\\%\\), respectively. Compared to previous collaboration methods at the BEV level, IFTR significantly enhances the quality of BEV features through instance feature aggregation, and adapts the cross-domain query adaption to implicitly encode the positions of the target in 3D space, achieving more accurate perception." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Number of agents. In this experiment, we investigate the impact of the quantity of agents on the perceptual performance of IFTR on the OPV2V dataset. As depicted in Fig. 3a, the perceptual performance positively increases as more agents engage in cooperative perception. From Fig. 3b, it can be observed that, in" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.429, + 0.115, + 0.733, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.242, + 0.149, + 0.486, + 0.338 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.289, + 0.344, + 0.438, + 0.357 + ], + "angle": 0, + "content": "(a) All scenes on OPV2V" + }, + { + "type": "image", + "bbox": [ + 0.517, + 0.149, + 0.765, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.549, + 0.344, + 0.731, + 0.357 + ], + "angle": 0, + "content": "(b) A certain scene on OPV2V" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.367, + 0.788, + 0.424 + ], + "angle": 0, + "content": "Fig. 3: IFTR steadily improves 3D detection performance as the number of agents grows. (a) The relationship between 3D detection performance and the maximum collaboration count on the OPV2V test set; (b) The relationship between 3D detection performance and collaboration count in a certain scene on the OPV2V test set." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.458, + 0.788, + 0.593 + ], + "angle": 0, + "content": "a simple perception environment, the IFTR performance exceeds that of the single LiDAR-based detector [13] when the collaboration count is 2 for the AP@50 metric. Similarly, for the AP@70 metric, the IFTR performance surpasses the single LiDAR-based detector when the collaboration count is 5. It is noteworthy that the detection performance consistently improves with the increase in the number of collaborative agents. Even upon reaching the maximum collaboration quantity in the dataset, a rising trend in performance persists. Therefore, we advocate for active collaboration among more agents to achieve increasingly advanced perceptual performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.626, + 0.788, + 0.793 + ], + "angle": 0, + "content": "Robustness to localization noise. We follow the localization noise settings in V2X-ViT [42] (Gaussian noise with a mean of 0m and a variance of 0m-0.6m) and validate the robustness of IFTR against realistic localization noise. Fig. 4 illustrates the detection performances as a function of localization noise level in V2XSet and DAIR-V2X datasets, respectively. We see: i) with the increasing localization noise, the performance of all intermediate collaborative methods deteriorates due to the misalignment of feature maps, while IFTR outperforms previous SOTAs at all the localization noise levels; ii) IFTR consistently outperforms the No Collaboration by a significant margin. The reason is the powerful transformer architecture in IFA can capture crucial perceptual cues and holistic information across agents." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.825, + 0.402, + 0.839 + ], + "angle": 0, + "content": "4.3 Ablation Studies" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "image", + "bbox": [ + 0.242, + 0.149, + 0.486, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.32, + 0.344, + 0.408, + 0.357 + ], + "angle": 0, + "content": "(a) DAIR-V2X" + }, + { + "type": "image", + "bbox": [ + 0.517, + 0.149, + 0.765, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.605, + 0.344, + 0.675, + 0.357 + ], + "angle": 0, + "content": "(b) V2XSet" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.367, + 0.785, + 0.41 + ], + "angle": 0, + "content": "Fig. 4: Robustness to localization noise on the DAIR-V2X and V2XSet datasets. Gaussian noise with zero mean and a varying variance is introduced. IFTR consistently outperforms previous SOTAs." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.428, + 0.788, + 0.498 + ], + "angle": 0, + "content": "Table 2: Ablation Study results of the proposed components on the OPV2V and DAIR-V2X datasets. IFA, CDQA respectively represent the incorporation of i) instance feature aggregation, and ii) cross-domain query adaptation. MASK denotes interacting exclusively with the foreground features of collaborators in the multi-view feature aggregation module." + }, + { + "type": "table", + "bbox": [ + 0.275, + 0.509, + 0.731, + 0.598 + ], + "angle": 0, + "content": "
IFA CDQA MASKOPV2VDAIR-V2X
AP@50AP@70CommAP@50AP@70Comm
0.77620.519211.450.16310.042112.04
✓0.84800.648724.230.19980.057421.91
✓✓0.85560.660424.230.20580.066521.91
✓✓✓0.84580.630020.610.19780.061818.23
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.844 + ], + "angle": 0, + "content": "Effectiveness of different modules in IFTR. Here we investigate the effectiveness of various components in IFTR, with the base model being BEVFormerS incorporating a late fusion strategy. We progressively adding i) IFA, ii) CDQA, and iii) MASK to assess the impact of each component on detection performance and communication volume, where MASK refers to interacting only with the foreground features of collaborators in the MVFA module. As Tab. 2 demonstrates i) IFA contributes the most significant performance gain, increasing AP@70 on OPV2V and DAIR-V2X by \\(24.94\\%\\) and \\(36.34\\%\\), respectively. This is attributed to the MVFA design in IFA, which significantly improves the quality of BEV features for individual agents, enhancing BEV features and further improving the perceptual effectiveness of late fusion; ii) CDQA increases AP@70 on OPV2V and DAIR-V2X by \\(1.80\\%\\) and \\(15.85\\%\\), respectively. This is because CDQA encodes 2D instances into 3D object queries, making the detection head less dependent on the initially learned object queries during training (i.e., gen" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.43, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 3: Comparison of different positional encoding strategies in the CDQA module on the OPV2V and DAIR-V2X datasets. None denotes not using positional encoding, Learned denotes the use of trainable positional encoding, and CE stands for employing the proposed cone encoding." + }, + { + "type": "table", + "bbox": [ + 0.364, + 0.213, + 0.64, + 0.288 + ], + "angle": 0, + "content": "
StrategyOPV2VDAIR-V2X
AP@50AP@70AP@50AP@70
None0.84930.65320.19500.0610
Learned0.85320.65880.20250.0628
CE0.85560.66040.20580.0665
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.312, + 0.788, + 0.493 + ], + "angle": 0, + "content": "erating object queries adaptively based on 2D instances that are more suitable for 3D detection of the instance). It effectively alleviates the problem of differences in spatial distribution between the test set and the training set, and we speculate that this module will bring more significant performance improvement when there is a greater spatial distribution difference; iii) MASK reduces communication overhead by 12.30 times on the OPV2V dataset and 12.82 times on the DAIR-V2X dataset, the detection performance only decreased by \\(4.60\\%\\) and \\(7.07\\%\\) on the respective datasets for the AP@70 metric. This is highly useful for bandwidth-constrained application scenarios. It is worth noting that our proposed IFTR can also be combined with other fusion methods (such as CoBEVT [41] and CoAlign [25]), and we encourage researchers to explore their combined usage, believing it will lead to more advanced detection performance." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.512, + 0.788, + 0.619 + ], + "angle": 0, + "content": "Different positional encoding schemes in CDQA. Due to the crucial importance of positional encoding in transformer-based architectures, in this subsection, we compare cone encoding with other commonly used positional encoding methods. As can be seen from Tab. 3, the performance using cone encoding is superior to other methods. This is attributed to cone encoding providing a potential cone space prior for instances, which can alleviate the difficulty of the detection head in capturing targets." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.637, + 0.447, + 0.652 + ], + "angle": 0, + "content": "4.4 Qualitative Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.659, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Visualization of detection results. We conducted a qualitative analysis of the model's performance using typical samples from the OPV2V dataset, as illustrated in Fig. 5. The first column (a) shows the perception results of no collaboration, the second column (b) shows results with late fusion, and the third column (c) shows results using IFTR for collaborative perception. Overall, our approach generates more prediction bounding boxes that perfectly align with the ground truth. This improvement can be attributed to two main factors: i) the proposed IFA integrates meaningful information from nearby agents, significantly enhancing the quality of BEV features, and thereby improving detection performance; ii) the proposed CDQA provides effective spatial cues for objects in the scene, effectively compensating for the differences in target spatial distribution between the test set and the training set." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "image", + "bbox": [ + 0.282, + 0.154, + 0.425, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.433, + 0.154, + 0.574, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.579, + 0.154, + 0.722, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.282, + 0.269, + 0.425, + 0.38 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.302, + 0.387, + 0.404, + 0.398 + ], + "angle": 0, + "content": "(a) No Collaboration" + }, + { + "type": "image", + "bbox": [ + 0.433, + 0.269, + 0.574, + 0.38 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.463, + 0.387, + 0.54, + 0.398 + ], + "angle": 0, + "content": "(b) Late Fusion" + }, + { + "type": "image", + "bbox": [ + 0.58, + 0.269, + 0.722, + 0.38 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.628, + 0.387, + 0.672, + 0.398 + ], + "angle": 0, + "content": "(c) IFTR" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.419, + 0.787, + 0.461 + ], + "angle": 0, + "content": "Fig. 5: Visualization of predictions from (a) No Collaboration, (b) Late Fusion and (c) IFTR on the OPV2V test set. Green and red 3D bounding boxes represent the ground truth and prediction respectively." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.491, + 0.359, + 0.507 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.788, + 0.707 + ], + "angle": 0, + "content": "IFTR is an instance-level feature fusion framework based on transformer that aims to enhance the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. It comprises three key components: message selection and feature map reconstruction, instance feature aggregation, and cross-domain query adaptation. The message selection and feature map reconstruction module optimize communication efficiency by transmitting instance-level features. Instance feature aggregation interacts with the visual features of individual agents using predefined grid-shaped BEV queries, generating more comprehensive and accurate BEV features. The cross-domain query adaptation implicitly encodes candidate positions of targets, heuristically integrating 2D priors. Extensive experiments on several multi-agent datasets show the effectiveness of IFTR and the necessity of all its components." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.731, + 0.403, + 0.749 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The work was supported by the Key Research & Development Plan of Zhejiang Province under Grant 2021C01196, in part by the Zhejiang Provincial Natural Science Foundation of China under Grant LR23F010006, in part by the Open Research Project Programme funded by the Science and Technology Development Fund (SKL-IOTSC(UM)-2024-2026) and the State Key Laboratory of Internet" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.43, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.146, + 0.784, + 0.178 + ], + "angle": 0, + "content": "of Things for Smart City (University of Macau) (Ref. No.: SKL-IoTSC(UM)-2024-2026/ORP/GA01/2023)." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.2, + 0.323, + 0.216 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.232, + 0.784, + 0.273 + ], + "angle": 0, + "content": "1. Betz, J., Zheng, H., Liniger, A., Rosolia, U., Karle, P., Behl, M., Krovi, V., Mangharam, R.: Autonomous vehicles on the edge: A survey on autonomous vehicle racing. IEEE Open Journal of Intelligent Transportation Systems 3, 458-488 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.785, + 0.315 + ], + "angle": 0, + "content": "2. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.316, + 0.785, + 0.37 + ], + "angle": 0, + "content": "3. Chen, Q., Ma, X., Tang, S., Guo, J., Yang, Q., Fu, S.: F-cooper: Feature based cooperative perception for autonomous vehicle edge computing system using 3d point clouds. In: Proceedings of the 4th ACM/IEEE Symposium on Edge Computing. pp. 88-100 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.371, + 0.785, + 0.425 + ], + "angle": 0, + "content": "4. Chen, Z., Shi, Y., Jia, J.: Transiff: An instance-level feature fusion framework for vehicle-infrastructure cooperative 3d detection with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18205-18214 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.785, + 0.468 + ], + "angle": 0, + "content": "5. Deng, J., Shi, S., Li, P., Zhou, W., Zhang, Y., Li, H.: Voxel r-cnn: Towards high performance voxel-based 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 1201-1209 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.785, + 0.495 + ], + "angle": 0, + "content": "6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: Carla: An open urban driving simulator. In: Conference on robot learning. pp. 1-16. PMLR (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.496, + 0.785, + 0.536 + ], + "angle": 0, + "content": "7. Goodfellow, I., Warde-Farley, D., Mirza, M., Courville, A., Bengio, Y.: Maxout networks. In: International conference on machine learning. pp. 1319-1327. PMLR (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.537, + 0.785, + 0.578 + ], + "angle": 0, + "content": "8. Guo, Y., Ma, J., Leslie, E., Huang, Z.: Evaluating the effectiveness of integrated connected automated vehicle applications applied to freeway managed lanes. IEEE Transactions on Intelligent Transportation Systems 23(1), 522-536 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.579, + 0.785, + 0.619 + ], + "angle": 0, + "content": "9. Hu, Y., Fang, S., Lei, Z., Zhong, Y., Chen, S.: Where2comm: Communication-efficient collaborative perception via spatial confidence maps. Advances in neural information processing systems 35, 4874-4886 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.62, + 0.785, + 0.647 + ], + "angle": 0, + "content": "10. Hu, Y., Fang, S., Xie, W., Chen, S.: Aerial monocular 3d object detection. IEEE Robotics and Automation Letters 8(4), 1959-1966 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.648, + 0.785, + 0.674 + ], + "angle": 0, + "content": "1. Huang, J., Huang, G.: Bevdet4d: Exploit temporal cues in multi-camera 3d object detection. arXiv preprint arXiv:2203.17054 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.675, + 0.785, + 0.716 + ], + "angle": 0, + "content": "2. Huang, J., Huang, G., Zhu, Z., Ye, Y., Du, D.: Bevdet: High-performance multicamera 3d object detection in bird-eye-view. arXiv preprint arXiv:2112.11790 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.717, + 0.785, + 0.758 + ], + "angle": 0, + "content": "3. Lang, A.H., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: Pointpillars: Fast encoders for object detection from point clouds. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12697-12705 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.785, + 0.799 + ], + "angle": 0, + "content": "4. Li, J., Li, R., Li, J., Wang, J., Wu, Q., Liu, X.: Dual-view 3d object recognition and detection via lidar point cloud and camera image. Robotics and Autonomous Systems 150, 103999 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "5. Li, Y., Ren, S., Wu, P., Chen, S., Feng, C., Zhang, W.: Learning distilled collaboration graph for multi-agent perception. Advances in Neural Information Processing Systems 34, 29541-29552 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.232, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "16. Li, Y., Ge, Z., Yu, G., Yang, J., Wang, Z., Shi, Y., Sun, J., Li, Z.: Bevdepth: Acquisition of reliable depth for multi-view 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 1477-1485 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.245 + ], + "angle": 0, + "content": "17. Li, Z., Wang, W., Li, H., Xie, E., Sima, C., Lu, T., Qiao, Y., Dai, J.: Bevformer: Learning bird's-eye-view representation from multi-camera images via spatiotemporal transformers. In: European conference on computer vision. pp. 1-18. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "18. Lin, T.Y., Goyal, P., Girshick, R., He, K., Dollar, P.: Focal loss for dense object detection. In: Proceedings of the IEEE international conference on computer vision. pp. 2980-2988 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.328 + ], + "angle": 0, + "content": "19. Liu, H., Teng, Y., Lu, T., Wang, H., Wang, L.: Sparsebev: High-performance sparse 3d object detection from multi-camera videos. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18580-18590 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.329, + 0.787, + 0.37 + ], + "angle": 0, + "content": "20. Liu, Y.C., Tian, J., Glaser, N., Kira, Z.: When2com: Multi-agent perception via communication graph grouping. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 4106-4115 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.787, + 0.411 + ], + "angle": 0, + "content": "21. Liu, Y., Wang, T., Zhang, X., Sun, J.: Petr: Position embedding transformation for multi-view 3d object detection. In: European Conference on Computer Vision. pp. 531-548. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.787, + 0.453 + ], + "angle": 0, + "content": "22. Liu, Y., Yan, J., Jia, F., Li, S., Gao, A., Wang, T., Zhang, X.: Petrov2: A unified framework for 3d perception from multi-camera images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3262-3272 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.787, + 0.495 + ], + "angle": 0, + "content": "23. Liu, Z., Wu, Z., Toth, R.: Smoke: Single-stage monocular 3d object detection via keypoint estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 996-997 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.787, + 0.536 + ], + "angle": 0, + "content": "24. Lu, Y., Hu, Y., Zhong, Y., Wang, D., Chen, S., Wang, Y.: An extensible framework for open heterogeneous collaborative perception. arXiv preprint arXiv:2401.13964 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.787, + 0.577 + ], + "angle": 0, + "content": "25. Lu, Y., Li, Q., Liu, B., Dianati, M., Feng, C., Chen, S., Wang, Y.: Robust collaborative 3d object detection in presence of pose errors. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 4812-4818. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.787, + 0.633 + ], + "angle": 0, + "content": "26. Philion, J., Fidler, S.: Lift, splat, shoot: Encoding images from arbitrary camera rigs by implicitly unprojecting to 3d. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 194-210. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.634, + 0.787, + 0.674 + ], + "angle": 0, + "content": "27. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 652-660 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.787, + 0.716 + ], + "angle": 0, + "content": "28. Raboy, K., Ma, J., Leslie, E., Zhou, F.: A proof-of-concept field experiment on cooperative lane change maneuvers using a prototype connected automated vehicle testing platform. Journal of Intelligent Transportation Systems 25(1), 77-92 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.717, + 0.787, + 0.758 + ], + "angle": 0, + "content": "29. Reading, C., Harakeh, A., Chae, J., Waslander, S.L.: Categorical depth distribution network for monocular 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8555-8564 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.787, + 0.785 + ], + "angle": 0, + "content": "30. Roddick, T., Kendall, A., Cipolla, R.: Orthographic feature transform for monoc- ular 3d object detection. arXiv preprint arXiv:1811.08188 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.786, + 0.787, + 0.84 + ], + "angle": 0, + "content": "31. Rukhovich, D., Vorontsova, A., Konushin, A.: Imvoxelnet: Image to voxels projection for monocular and multi-view general-purpose 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2397-2406 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.43, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "IFTR: An Instance-Level Fusion Transformer" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.175 + ], + "angle": 0, + "content": "32. Shladover, S.E.: Opportunities and challenges in cooperative road vehicle automation. IEEE Open Journal of Intelligent Transportation Systems 2, 216-224 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.177, + 0.788, + 0.217 + ], + "angle": 0, + "content": "33. Tan, M., Le, Q.: Efficientnet: Rethinking model scaling for convolutional neural networks. In: International conference on machine learning. pp. 6105-6114. PMLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.218, + 0.787, + 0.245 + ], + "angle": 0, + "content": "34. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "35. Wang, T., Zhu, X., Pang, J., Lin, D.: Fcos3d: Fully convolutional one-stage monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 913-922 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.287, + 0.787, + 0.342 + ], + "angle": 0, + "content": "36. Wang, T.H., Manivasagam, S., Liang, M., Yang, B., Zeng, W., Urtasun, R.: V2vnet: Vehicle-to-vehicle communication for joint perception and prediction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part II 16. pp. 605–621. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.343, + 0.787, + 0.397 + ], + "angle": 0, + "content": "37. Wang, Y., Chao, W.L., Garg, D., Hariharan, B., Campbell, M., Weinberger, K.Q.: Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8445-8453 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.398, + 0.787, + 0.438 + ], + "angle": 0, + "content": "38. Wang, Y., Guizilini, V.C., Zhang, T., Wang, Y., Zhao, H., Solomon, J.: Detr3d: 3d object detection from multi-view images via 3d-to-2d queries. In: Conference on Robot Learning. pp. 180-191. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.439, + 0.787, + 0.466 + ], + "angle": 0, + "content": "39. Xiang, H., Xu, R., Ma, J.: Hm-vit: Hetero-modal vehicle-to-vehicle cooperative perception with vision transformer. arXiv preprint arXiv:2304.10628 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.467, + 0.787, + 0.522 + ], + "angle": 0, + "content": "40. Xu, R., Guo, Y., Han, X., Xia, X., Xiang, H., Ma, J.: Opencda: an open cooperative driving automation framework integrated with co-simulation. In: 2021 IEEE International Intelligent Transportation Systems Conference (ITSC). pp. 1155-1162. IEEE (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.523, + 0.787, + 0.563 + ], + "angle": 0, + "content": "41. Xu, R., Tu, Z., Xiang, H., Shao, W., Zhou, B., Ma, J.: Cobevt: Cooperative bird's eye view semantic segmentation with sparse transformers. arXiv preprint arXiv:2207.02202 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.565, + 0.787, + 0.605 + ], + "angle": 0, + "content": "42. Xu, R., Xiang, H., Tu, Z., Xia, X., Yang, M.H., Ma, J.: V2x-vit: Vehicle-to-everything cooperative perception with vision transformer. In: European conference on computer vision. pp. 107-124. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.606, + 0.787, + 0.66 + ], + "angle": 0, + "content": "43. Xu, R., Xiang, H., Xia, X., Han, X., Li, J., Ma, J.: Opv2v: An open benchmark dataset and fusion pipeline for perception with vehicle-to-vehicle communication. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 2583-2589. IEEE (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.661, + 0.787, + 0.688 + ], + "angle": 0, + "content": "44. Yan, Y., Mao, Y., Li, B.: Second: Sparsely embedded convolutional detection. Sensors 18(10), 3337 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.689, + 0.787, + 0.743 + ], + "angle": 0, + "content": "45. Yang, C., Chen, Y., Tian, H., Tao, C., Zhu, X., Zhang, Z., Huang, G., Li, H., Qiao, Y., Lu, L., et al.: Bevformer v2: Adapting modern image backbones to bird's-eye-view recognition via perspective supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17830-17839 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.744, + 0.787, + 0.785 + ], + "angle": 0, + "content": "46. Yin, T., Zhou, X., Krahenbuhl, P.: Center-based 3d object detection and tracking. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11784-11793 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.786, + 0.787, + 0.84 + ], + "angle": 0, + "content": "47. Yu, H., Luo, Y., Shu, M., Huo, Y., Yang, Z., Shi, Y., Guo, Z., Li, H., Hu, X., Yuan, J., et al.: Dair-v2x: A large-scale dataset for vehicle-infrastructure cooperative 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21361-21370 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "S. Wang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "48. Zhang, R., Qiu, H., Wang, T., Guo, Z., Cui, Z., Qiao, Y., Li, H., Gao, P.: Monodetr: Depth-guided transformer for monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9155-9166 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.231 + ], + "angle": 0, + "content": "49. Zhou, B., Krahenbihl, P.: Cross-view transformers for real-time map-view semantic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13760-13769 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.787, + 0.272 + ], + "angle": 0, + "content": "50. Zhou, Y., Tuzel, O.: Voxelnet: End-to-end learning for point cloud based 3d object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4490-4499 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.787, + 0.315 + ], + "angle": 0, + "content": "51. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.315 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_origin.pdf b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..536419d1ac140d0e9922ba36f23c79e2909f47e0 --- /dev/null +++ b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/64d575fa-b556-4d63-89b7-604e93669af8_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:978b5f0956df9d0c7ec8eb443d3877b64b17955f2502a1ea0640d9a52c15d48c +size 6946698 diff --git a/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/full.md b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/full.md new file mode 100644 index 0000000000000000000000000000000000000000..0eab05ce58d7eb68e092ba2c48d6604432b64ce4 --- /dev/null +++ b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/full.md @@ -0,0 +1,271 @@ +# IFTR: An Instance-Level Fusion Transformer for Visual Collaborative Perception + +Shaohong Wang $^{1}$ , Lu Bin $^{1}$ , Xinyu Xiao $^{2}$ , Zhiyu Xiang $^{1}$ , Hangguan Shan $^{1}$ , and Eryun Liu $^{1*}$ + +$^{1}$ Zhejiang University, Hangzhou, China {wangsh0111,lubin2022, xiangzy, hshan, eryunliu}@zju.edu.cn $^{2}$ Institute of Automation of Chinese Academy of Sciences, Beijing, China xinyu.xiao@nlpr.ia.ac.cn + +Abstract. Multi-agent collaborative perception has emerged as a widely recognized technology in the field of autonomous driving in recent years. However, current collaborative perception predominantly relies on Li-DAR point clouds, with significantly less attention given to methods using camera images. This severely impedes the development of budget-constrained collaborative systems and the exploitation of the advantages offered by the camera modality. This work proposes an instance-level fusion transformer for visual collaborative perception (IFTR), which enhances the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. To capture the visual information from multiple agents, we design an instance feature aggregation that interacts with the visual features of individual agents using predefined grid-shaped bird eye view (BEV) queries, generating more comprehensive and accurate BEV features. Additionally, we devise a cross-domain query adaptation as a heuristic to fuse 2D priors, implicitly encoding the candidate positions of targets. Furthermore, IFTR optimizes communication efficiency by sending instance-level features, achieving an optimal performance-bandwidth trade-off. We evaluate the proposed IFTR on a real dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, achieving performance improvements of $57.96\%$ , $9.23\%$ and $12.99\%$ in AP@70 metrics compared to the previous SOTAs, respectively. Extensive experiments demonstrate the superiority of IFTR and the effectiveness of its key components. The code is available at https://github.com/wangsh0111/IFTR. + +Keywords: BEV Queries, Query Adaptation, Visual Collaborative Perception, Transformer + +# 1 Introduction + +3D object detection is a fundamental task in computer vision, aiming to locate objects in 3D physical space given sensor inputs. It is crucial in various + +applications such as autonomous driving [17, 27, 44, 48], robotics [14], and unmanned aerial vehicles [10]. Despite significant advancements in LiDAR-based methods [5, 13, 46, 50], camera-based approaches [26, 29, 35, 38, 46] have garnered widespread attention in recent years. In comparison to LiDAR, cameras have lower deployment costs, are more easily scalable, and provide valuable visual cues for detecting distant objects and identifying vision-based road elements (such as traffic lights and lane markings) [17]. However, due to the lack of depth information in RGB images, solely camera-based 3D object detection is often noticeably inferior to lidar-based detection in most scenarios. + +The latest advancements in V2X communication technology and Intelligent Transportation Systems enable intelligent agents to share information between each other [1,8,28,32,47]. Through multi-agent interactions, the limitations of individual agent perception, such as occlusion and long-range issues, can be alleviated, thereby enhancing the performance of camera-based 3D object detection. Currently, the prevailing frameworks for collaborative perception [9, 36, 41-43] primarily involve the fusion at the Bird's Eye View (BEV) feature level. However, this paradigm is highly sensitive to the accuracy of BEV features for individual agents and faces challenges in spatial alignment, imposing stringent requirements on real-time poses between agents, leading to insufficient robustness in feature fusion. Nevertheless, due to the lack of depth information in RGB images, generating BEV features from a 2D plane is ill-posed. Therefore, the detection performance of visual collaborative perception methods based solely on BEV features level in camera settings is impacted by compounded errors, where inaccurate BEV features can severely impact the final performance. + +Diverging from multi-camera 3D object detection, V2X collaborative perception must also account for the constraints of communication bandwidth. It is crucial to address how to reduce communication bandwidth while ensuring collaborative perception performance. Each agent must select visual features with the maximum information content to optimize communication efficiency. + +In this paper, we propose IFTR, a robust and efficient transformer-based instance-level feature fusion framework. Our central idea is to extract spatial features from regions of interest in cross-agent camera views to generate BEV features, and implicitly encode candidate positions of objects in 3D space through a heuristic adaptive approach. Specifically, IFTR incorporates three key designs: i) Instance feature aggregation, aggregating spatial information from visual features of multiple agent camera views using predefined grid-shaped BEV queries. This is achieved through a transformer to implement robust and adaptive feature fusion, avoiding strict spatial alignment requirements in BEV feature-level fusion strategies. It also eliminates the dependency on high-accuracy single-agent BEV features and real-time pose accuracy. ii) Message selection and feature map reconstruction, reducing bandwidth consumption by sharing instance-level visual features rather than entire image features. iii) Cross-domain query adaptation, encoding instance-level features as object queries, combining them with the original learnable object queries to form the new hybrid object queries. This is then input into a deformable DETR head [2,51] for end-to-end 3D object detection. + +To evaluate IFTR, we conduct extensive experiments on a real-world dataset, DAIR-V2X [47], and two simulated datasets, OPV2V [43] and V2XSet [42]. The experimental results indicate that IFTR significantly outperforms previous works in the performance-bandwidth trade-off across multiple datasets. To sum up, the main contributions are as follows: + +- We introduce IFTR, a superior camera-only instance-level feature fusion framework based on transformers. This framework addresses occlusion and long-range issues through multi-agent collaboration, achieving more accurate and complete 3D object detection. +- We devise an instance feature aggregation that utilizes learnable BEV queries to aggregate spatial information from multiple agents, resulting in more accurate BEV features. +- We design a cross-domain query adaptation module by encoding instance-level features as object queries, facilitating the implicit encoding of candidate positions for targets in 3D space, which alleviates the problem of target spatial distribution differences between the training set and the test set. +- We develop communication-efficient collaboration techniques by sharing the most informative visual features to reduce communication overhead. Our IFTR achieves state-of-the-art performance on a real world dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, with AP@70 metrics improving by $57.96\%$ , $9.23\%$ and $12.99\%$ compared to the previous SOTAs, respectively. + +# 2 Related Work + +# 2.1 Camera-based 3D Object Detection + +Given an RGB image and the corresponding camera parameters, the purpose of image-based 3D object detection is to classify and locate the objects of interest. Since images lack depth information, this problem is ill-posed and more challenging compared to 2D detection. FCOS3D [35] and SMOKE [23] extend 2D detection networks by utilizing fully convolutional networks to directly regress the depth for each object. Pseudo LiDAR [37] employs a depth estimation network to transform 2D images into 3D pseudo-point cloud signals, followed by the use of a lidar-based detection network for 3D detection. DETR3D [38] utilizes a set of sparse 3D queries to index 2D features extracted from multi-view images, samples corresponding features, enabling end-to-end 3D detection box prediction without the need for time-consuming post-processing like NMS (Non-Maximum Suppression). + +Recently, there has been widespread attention on BEV representations due to their ability to clearly depict object positions and scales, coupled with efficient computational efficiency. OFT [30] and ImVoxelNet [31] project predefined voxels onto image features, generating voxel representations of the scene. LSS [26] and CaDDN [29] utilize view transformation modules to convert dense 2D image + +features into BEV space. CVT [49] leverages position encoding from camera perception and dense cross-attention to correlate perspective view and BEV view features. BEVDet [11, 12] and BEVDepth [16] use lift-splat operations for view transformation. PETR [21, 22] utilizes 3D position encoding and global cross-attention for feature fusion, transforming 2D features into 3D position-aware representations. BEVFormer [17, 45] effectively aggregates spatio-temporal features from a surround-view camera and historical BEV features using deformable attention, generating unified BEV features. SparseBEV [19] adapts self-attention with an adaptive receptive field for feature aggregation in BEV space, enjoying the advantages of BEV space without explicitly constructing dense BEV features. In this work, we choose the single-scale and history-free BEVFormer-S [17] as the single-agent 3D object detector for computational efficiency. + +# 2.2 Collaborative Perception + +Collaborative perception is an emerging application in multi-agent systems, aiming to enhance perceptual performance by facilitating communication among other agents for the shared exchange of information. Based on its message sharing strategy, it can be categorized into three types: early fusion (i.e. sharing raw sensor information), intermediate fusion (i.e. sharing intermediate layer features of neural networks), and late fusion (i.e. sharing 3D detection results, such as 3D bounding box position and confidence score). Early fusion usually requires large transmission bandwidth, while late fusion cannot provide valuable scenario context. Intermediate fusion achieves a better trade-off between performance and bandwidth. When2com [20] introduces a handshake mechanism to determine when to communicate and create sparse communication graph. OPV2V [43] utilizes a single-head self-attention module to fuse features, while F-Cooper [3] employs a maxout [7] fusion operation. V2VNet [36] utilizes a spatially aware graph neural network to aggregate shared feature representations among multiple vehicles. DiscoNet [15] adopts knowledge distillation to leverage the advantages of both early and intermediate collaboration. V2X-ViT [42] introduces a novel heterogeneous multi-agent attention module to fuse information across heterogeneous agents. Where2comm [9] introduces a spatial confidence map to reduce communication bandwidth consumption. TransIFF [4] further reduces communication bandwidth consumption by transmitting object queries. CoAlign [25] employs learnable or mathematical methods to correct pose errors for more accurate collaborative perception. HM-ViT [39] and HEAL [24] investigate multi-agent heterogeneous modality collaborative perception problems with different sensor modalities, expanding the scale of collaboration. + +However, prior collaborative perception efforts [4,9,25,36,42,43] have primarily focused on lidar-based 3D object detection, yielding suboptimal performance in a camera-only setup. We speculate that the reason lies in the inferior quality of BEV features from a single-agent compared to lidar-based methods, resulting in suboptimal solutions at the BEV feature level. In this paper, we propose a novel camera-only instance-level feature fusion framework with lower communication bandwidth consumption. It generates more accurate BEV features and + +![](images/475ad1900580ae917a777d25ddc0167d17151dd23e4632ecbbfe55123b222293.jpg) +Fig. 1: Overall architecture of IFTR. i) We employ the message selection and feature map reconstruction module to share instance-level features, reducing bandwidth consumption; ii) In instance feature aggregation (IFA), each BEV query interacts only with image features from regions of interest from multiple views; iii) In CDQA, we encode the feature map information and 3D positional information of each instance into 3D object query. + +3D object queries tailored to each instance by leveraging instance-level features shared among multiple agents, thereby achieving more efficient and practical collaborative perception. + +# 3 IFTR + +This section presents IFTR, a robust and efficient camera-only instance-level feature fusion framework for collaborative perception. As depicted in Fig. 1, IFTR comprises an image encoder, message selection and feature map reconstruction, cascade instance feature aggregation, cross-domain query adaptation, and a DETR decoder. The image encoder is utilized to extract visual features from the input images. The proposed message selection and feature map reconstruction module are employed at the sender and receiver ends, respectively, for instance-level visual feature filtering and image feature reconstruction, effectively saving communication bandwidth. Based on visual features from multiple camera views, the proposed cascade instance feature aggregation generates comprehensive and accurate BEV features; the proposed cross-domain query adaptation module encodes instance-level visual features into object queries to encode candidate positions for the targets, combining them with the original learnable object queries to form the hybrid object queries. Ultimately, the DETR decoder + +takes the BEV features and the hybrid object queries as inputs to predict the target's category and location information. + +# 3.1 Image Encoder + +We leverage EfficientNet [33, 34] to extract visual features from the input images because of its high performance and low computational complexity. Given $L$ agents and $N_{\text{cams}}$ camera views for each agent, $F_i^k \in \mathbb{R}^{fC \times fH \times fW}$ is used to represent the extracted feature map of the $k$ -th camera view of the $i$ -th agent, where $fC$ , $fH$ and $fW$ are the channel, height and width of the feature map. Considering different agents may have different camera views, the feature maps of views that not exist are set to zero when the actual number of camera views less than $N_{\text{cams}}$ and use a mask to indicate the valid feature maps. + +# 3.2 Message Selection and Feature Map Reconstruction + +To achieve accurate and comprehensive 3D object detection, it is imperative for each agent to exchange visual features and leverage complementary information. We propose communication-efficient collaborative techniques by sharing the most informative visual features to reduce communication overhead. The intuition is that foreground regions contain more informative content than background regions. During collaboration, visual features of regions with objects can assist in recovering missed objects due to occlusion or long-range issues, while background regions can be omitted to reduce the system's communication load. + +Given a feature map $F_{j}^{k}$ , the message sent for sharing is selected by the following steps: + +1. Extracting a set of candidate object instances by a 2D object detector. All the confidence values of instance are greater than a predefined threshold, $c_{\text{thre}}$ . +2. Cropping the feature map of each instance by the predicted bounding box in inference stage or by the ground truth bounding box in the training stage. +3. The cropped feature map of the $n$ -th selected instance, $F_{j \to i}^{k,n}$ , and bounding box are sent to the $i$ -th agent for sharing. + +At the side of ego agent (or the $i$ -th agent), the received object instance feature maps of the $k$ -th camera view of the $j$ -th agent are first combined together to reconstruct the feature map, $\mathcal{F}_{j\rightarrow i}^{k}$ , of foreground regions of original feature map $F_{j}^{k}$ by filling back the cropped features. The features in background region are set to zero. + +# 3.3 Instance Feature Aggregation + +Given a set of received foreground feature maps, $\{\mathcal{F}_{j\rightarrow i}^k |j = 1,2,\dots ,N_{agent},k = 1,2,\ldots ,N_{cams}\}$ , where $N_{agent}$ is the number of agents, the purpose of instance feature aggregation (IFA) module is to form a BEV feature map by aggregating + +![](images/94f6ba6d5f9bdf75129c817f733913abc2700fb451f9edcb779e6b9e07d133b5.jpg) +(a) IFA +Fig. 2: (a) The architecture of our proposed Instance Feature Aggregation (IFA); (b) Multi-View Feature Aggregation (MVFA) illustrated in Sec. 3.3 + +![](images/596de059f390cf23d7aa4f650497239fb170d235f3adca501ff241120ca40440.jpg) +(b) MVFA + +features from all received foreground feature maps. Since all camera views are treated equally in IFA module, for simplicity, we represent all the foreground feature maps by $\{\mathcal{F}_v|v = 1,2,\dots ,N_v\}$ , where the total number of views is $N_{v} = N_{agent}\times N_{cams}$ . + +The BEV space around the ego agent is divided into a discrete grid space of size $H \times W$ . The origin of ego coordinate is at the center of BEV grid. To construct a feature map on the BEV space of the ego agent by fusing reconstructed feature maps $\{\mathcal{F}_i | i = 1,2,\dots,N_v\}$ from all collaborative views, we propose a deformable attention based cascade instance feature aggregation (IFA) module (see Fig. 2). The BEV feature map is obtained by the following steps: + +1. A set of learnable parameters $Q_{\mathrm{bev}} \in \mathbb{R}^{C \times H \times W}$ is predefined and randomly initialized at the first IFA block. +2. For a given grid centered at $(x,y)$ , a set of points $\{(x,y,z_h)|h = 1,2,\dots,N_{ref}\}$ is selected as reference points, where $\{z_h|h = 1,2,\dots,N_{ref}\}$ are predefined heights for each grid. The reference points are used as feature indices to gather information from collaborative feature maps. +3. For a reference point $(x,y,z_h)$ at grid $(x,y)$ , the corresponding feature vector is aggregated by + +$$ +F _ {b e v} ^ {h} (x, y) = \frac {1}{| w |} \sum_ {v = 1} ^ {N _ {v}} w _ {v} f _ {v} ^ {h}, +$$ + +where $w_v \in \{0,1\}$ indicates whether the reference point $(x,y,z_h)$ is projected inside the image space of the $v$ -th camera view, and $|w| = \sum_v w_v$ is total number of views observing the reference point, and $f_v^h$ is the output of a deformable attention module, which will be described later in this section. + +4. The aggregated BEV feature $F_{bev}$ is the average feature over all $N_{ref}$ reference points for each grid and followed by a feed forward network (FFN) and an Add&Norm module to get the output $\hat{F}_{bev}$ of IFA module. +5. The above four steps assemble an IFA module. To sufficiently fuse all camera view features, we cascade 6 IFA modules sequentially, with the previous IFA output $\hat{F}_{\text{bev}}$ as the input $Q_{\text{bev}}$ of the next IFA. + +Given a reference point $(x,y,z_h)$ at grid $(x,y)$ and the feature map $\mathcal{F}_v$ of $v$ -th camera view, if point $(x,y,z_h)$ is observed by the $v$ -th camera view, the deformable attention first takes a feature vector $\hat{Q}_{\mathrm{bev}}(x,y)$ from $\hat{Q}_{\mathrm{bev}}$ and the vector $\hat{Q}_{\mathrm{bev}}(x,y)$ is then fed into a MLP layer. The MLP layer output a list of offset vectors $(o_1,o_2,\dots,o_{N_{da}})$ and a weight vector $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_{N_{da}})$ , where $N_{da}$ is the number of positions in attention, the output of deformable attention is + +$$ +f _ {v} ^ {h} = \sum_ {i = 1} ^ {N _ {d a}} \lambda_ {i} \mathcal {F} _ {v} (p + o _ {i}), +$$ + +where $p$ is the projected image coordinate of $(x,y,z_h)$ on $v$ -th view. + +# 3.4 Cross-Domain Query Adaptation + +The object decoder of BEVformer [17] is a DETR [2,51] decoder that receives a set of learned embeddings as object queries, aiming to learn potential locations of target objects during training. However, it takes a considerable amount of time for randomly initialized embeddings to converge to suitable positions. Additionally, during inference, object queries remain fixed for all images, while the spatial distribution of target objects may vary, leading to potentially inaccurate results. To address this issue, we employ a cross-domain query adaptation (CDQA) module to initialize object queries for decoder. This module implicitly encodes candidate positions for the target, making it easier for the detection head to capture the target object accurately. + +The maximum number of queries for decoder is set to $N_{Q}$ . The initial set of queries consists of two parts. The first part of queries is obtained from selected instances of all ego and collaborative camera views and the second part (the rest) of queries is randomly initialized. + +Given a set of shared instance features $\{(\mathcal{I}_n,B_n)|n = 1,2,\ldots ,N_I\}$ from all collaborative and ego views, where $N_{I}$ is total number of instances, $\mathcal{I}_n$ is the $n$ -th cropped instance feature map, and $B_{n}$ is the bounding box coordinates, the queries is obtained as following + +1. Global average pooling (GAP) on instance feature maps and then followed by a MLP module to get a set of feature vector $\{\mathcal{I}_n^p | n = 1, 2, \dots, N_I\}$ . +2. Encode the instance position information into a vector by a MLP layer, obtaining a set of position embeddings $\{\mathcal{V}_n|n = 1,2,\ldots ,N_I\}$ . The input to the MLP is the concatenate of three coordinates $(p_1,p_2,c)$ , where $p_1,p_2$ are the 3D coordinates of left-top and bottom-right point of instance bounding + +box on the focal plane and $c$ is the coordinate of corresponding camera origin. All coordinates are projected to the ego coordinate system. The three points indicate a cone where the object lies. + +3. Combine the feature vectors and position embeddings by adding, obtaining the instance feature initialized set of queries $\{\mathcal{I}_n^p +\mathcal{V}_n|n = 1,2,\ldots ,N_I\}$ for object decoder. + +The union, $Q_{\mathrm{hybrid}}$ , of the instance feature initialized set of queries and the randomly initialized set of queries is then used as queries of object decoder. + +# 3.5 Object Decoder + +The object decoder of IFTR employs a deformable DETR detection head, taking the BEV features $\hat{F}_{bev} \in \mathbb{R}^{C \times H \times W}$ and the hybrid object queries $Q_{\mathrm{hybrid}} \in \mathbb{R}^{N_Q \times C}$ as input, producing detection results $\mathcal{O} = \Phi_{\mathrm{dec}}(\hat{F}_{bev}, Q_{\mathrm{hybrid}}) \in \mathbb{R}^{N_Q \times 8}$ . Each position of $\mathcal{O}$ represents a rotated box with class $(c, x, y, z, w, l, h, \theta)$ , denoting class confidence, position, size and angle. The objects are the final output of the proposed collaborative perception system. We utilize the $\ell_1$ loss for regression and the focal loss [18] for classification. + +# 4 Experiments + +# 4.1 Experimental Setup + +Datasets. To evaluate the performance of IFTR on the visual collaborative perception task, we conduct extensive experiments on three multi-agent datasets, including V2XSet [42], OPV2V [43], and DAIR-V2X [47]. V2XSet [42] is a simulated dataset supporting V2X perception, co-simulated by CARLA [6] and OpenCDA [40]. It comprises 73 representative scenes with 2 to 5 connected agents and 11,447 annotated 3D frames, with an image resolution of $600 \times 800$ . OPV2V [43] is a large-scale vehicle-to-vehicle collaborative perception dataset, comprising 12,000 LiDAR point cloud frames and RGB images with 230,000 annotations of 3D bounding boxes, with an image resolution of $600 \times 800$ . DAIR-V2X [47] is a real-world vehicle-to-infrastructure collaborative perception dataset, consists of 100 realistic scenes and 18,000 data samples, with an image resolution of $1080 \times 1920$ . + +Implementation details. We use the single-scale and history-free BEVFormerS [17] as the 3D object detector for single agent. We employ EfficientNet [33,34] as the image backbone for better computation efficiency and utilize a smaller grid resolution $(0.4\mathrm{m})$ to retain fine-trained spatial details. The intermediate BEV feature map has a dimension of $256\times 256\times 256$ , with a perception range defined as $x\in [-51.2\mathrm{m},51.2\mathrm{m}]$ and $y\in [-51.2\mathrm{m},51.2\mathrm{m}]$ . Following prior research [41-43], we only modified the fusion module of different intermediate fusion methods while keeping the other components such as camera feature extractor and detection head the same. As IFTR involves instance-level fusion of + +Table 1: 3D detection performance comparison on the V2XSet [42], OPV2V [43] and DAIR-V2X [47] datasets. The results are reported in Average Precision (AP) at IoU=0.30, 0.50 and 0.70 on perfect settings. + +
MethodV2XSetOPV2VDAIR-V2X
AP@30AP@50AP@70AP@30AP@50AP@70AP@30AP@50AP@70
No Collaboration0.43430.30370.13790.56520.45940.25560.21020.07090.0080
Late Fusion0.68030.51410.25590.87890.77620.51920.29520.16310.0421
V2VNet [36]0.68860.59540.39000.86820.79060.57590.25810.13540.0276
V2X-ViT [42]0.66900.59140.41230.85120.78410.58380.25440.14020.0277
Where2comm [9]0.69690.61690.43960.84710.77140.58600.26130.14240.0296
CoBEVT [41]0.66290.58840.40810.87090.80260.59340.26080.14530.0255
CoAlign [25]0.75640.64790.39640.86890.80210.60460.26450.14700.0262
IFTR0.80570.71730.49670.92330.85560.66040.38550.20580.0665
+ +2D image features, we construct it following the method proposed in Sec. 3 and straightforwardly add a late fusion strategy to explore its combined effects with other fusion strategies. + +Evaluation metrics. We evaluate the detection performance using Average Precision (AP) metrics with Intersection over Union (IoU) thresholds of 0.30, 0.50, and 0.70. Additionally, the communication volume follows the standard setting as [4,9,42,43] that counts the message size by byte in log scale with base 2. + +# 4.2 Quantitative Evaluation + +Benchmark comparison. Tab. 1 compares the proposed IFTR with previous collaborative methods. We consider single-agent detection without collaboration (No collaboration), V2VNet [36], V2XViT [42], Where2comm [9], CoBEVT [41], CoAlign [25] and late fusion, where late fusion directly exchanges 3D detection boxes. We observe that the proposed IFTR outperforms previous methods on both real-world and simulated datasets, demonstrating the superiority of our model and its robustness to various realistic noises. Specifically, the SOTA performance of AP@70 on the V2XSet, OPV2V and DAIR-V2X datasets is improved by $12.99\%$ , $9.23\%$ and $57.96\%$ , respectively. Compared to previous collaboration methods at the BEV level, IFTR significantly enhances the quality of BEV features through instance feature aggregation, and adapts the cross-domain query adaption to implicitly encode the positions of the target in 3D space, achieving more accurate perception. + +Number of agents. In this experiment, we investigate the impact of the quantity of agents on the perceptual performance of IFTR on the OPV2V dataset. As depicted in Fig. 3a, the perceptual performance positively increases as more agents engage in cooperative perception. From Fig. 3b, it can be observed that, in + +![](images/eb472464f083fac7355029529b3a737669b04816b63dada118a25dda8a664be6.jpg) +(a) All scenes on OPV2V + +![](images/0385df63854ed85ba374b260b9190ba45be533ce26b2186436287d4d5d772eec.jpg) +(b) A certain scene on OPV2V +Fig. 3: IFTR steadily improves 3D detection performance as the number of agents grows. (a) The relationship between 3D detection performance and the maximum collaboration count on the OPV2V test set; (b) The relationship between 3D detection performance and collaboration count in a certain scene on the OPV2V test set. + +a simple perception environment, the IFTR performance exceeds that of the single LiDAR-based detector [13] when the collaboration count is 2 for the AP@50 metric. Similarly, for the AP@70 metric, the IFTR performance surpasses the single LiDAR-based detector when the collaboration count is 5. It is noteworthy that the detection performance consistently improves with the increase in the number of collaborative agents. Even upon reaching the maximum collaboration quantity in the dataset, a rising trend in performance persists. Therefore, we advocate for active collaboration among more agents to achieve increasingly advanced perceptual performance. + +Robustness to localization noise. We follow the localization noise settings in V2X-ViT [42] (Gaussian noise with a mean of 0m and a variance of 0m-0.6m) and validate the robustness of IFTR against realistic localization noise. Fig. 4 illustrates the detection performances as a function of localization noise level in V2XSet and DAIR-V2X datasets, respectively. We see: i) with the increasing localization noise, the performance of all intermediate collaborative methods deteriorates due to the misalignment of feature maps, while IFTR outperforms previous SOTAs at all the localization noise levels; ii) IFTR consistently outperforms the No Collaboration by a significant margin. The reason is the powerful transformer architecture in IFA can capture crucial perceptual cues and holistic information across agents. + +# 4.3 Ablation Studies + +![](images/254c35cb64b1f23407ca6cfd1fa883df27b596d303c5df883186cc27ef63b645.jpg) +(a) DAIR-V2X + +![](images/47f1dc893bf140d7e49abd06efb6bdf4e73f85663a2e7bbc1e23f5361c699432.jpg) +(b) V2XSet +Fig. 4: Robustness to localization noise on the DAIR-V2X and V2XSet datasets. Gaussian noise with zero mean and a varying variance is introduced. IFTR consistently outperforms previous SOTAs. + +Table 2: Ablation Study results of the proposed components on the OPV2V and DAIR-V2X datasets. IFA, CDQA respectively represent the incorporation of i) instance feature aggregation, and ii) cross-domain query adaptation. MASK denotes interacting exclusively with the foreground features of collaborators in the multi-view feature aggregation module. + +
IFA CDQA MASKOPV2VDAIR-V2X
AP@50AP@70CommAP@50AP@70Comm
0.77620.519211.450.16310.042112.04
✓0.84800.648724.230.19980.057421.91
✓✓0.85560.660424.230.20580.066521.91
✓✓✓0.84580.630020.610.19780.061818.23
+ +Effectiveness of different modules in IFTR. Here we investigate the effectiveness of various components in IFTR, with the base model being BEVFormerS incorporating a late fusion strategy. We progressively adding i) IFA, ii) CDQA, and iii) MASK to assess the impact of each component on detection performance and communication volume, where MASK refers to interacting only with the foreground features of collaborators in the MVFA module. As Tab. 2 demonstrates i) IFA contributes the most significant performance gain, increasing AP@70 on OPV2V and DAIR-V2X by $24.94\%$ and $36.34\%$ , respectively. This is attributed to the MVFA design in IFA, which significantly improves the quality of BEV features for individual agents, enhancing BEV features and further improving the perceptual effectiveness of late fusion; ii) CDQA increases AP@70 on OPV2V and DAIR-V2X by $1.80\%$ and $15.85\%$ , respectively. This is because CDQA encodes 2D instances into 3D object queries, making the detection head less dependent on the initially learned object queries during training (i.e., gen + +Table 3: Comparison of different positional encoding strategies in the CDQA module on the OPV2V and DAIR-V2X datasets. None denotes not using positional encoding, Learned denotes the use of trainable positional encoding, and CE stands for employing the proposed cone encoding. + +
StrategyOPV2VDAIR-V2X
AP@50AP@70AP@50AP@70
None0.84930.65320.19500.0610
Learned0.85320.65880.20250.0628
CE0.85560.66040.20580.0665
+ +erating object queries adaptively based on 2D instances that are more suitable for 3D detection of the instance). It effectively alleviates the problem of differences in spatial distribution between the test set and the training set, and we speculate that this module will bring more significant performance improvement when there is a greater spatial distribution difference; iii) MASK reduces communication overhead by 12.30 times on the OPV2V dataset and 12.82 times on the DAIR-V2X dataset, the detection performance only decreased by $4.60\%$ and $7.07\%$ on the respective datasets for the AP@70 metric. This is highly useful for bandwidth-constrained application scenarios. It is worth noting that our proposed IFTR can also be combined with other fusion methods (such as CoBEVT [41] and CoAlign [25]), and we encourage researchers to explore their combined usage, believing it will lead to more advanced detection performance. + +Different positional encoding schemes in CDQA. Due to the crucial importance of positional encoding in transformer-based architectures, in this subsection, we compare cone encoding with other commonly used positional encoding methods. As can be seen from Tab. 3, the performance using cone encoding is superior to other methods. This is attributed to cone encoding providing a potential cone space prior for instances, which can alleviate the difficulty of the detection head in capturing targets. + +# 4.4 Qualitative Evaluation + +Visualization of detection results. We conducted a qualitative analysis of the model's performance using typical samples from the OPV2V dataset, as illustrated in Fig. 5. The first column (a) shows the perception results of no collaboration, the second column (b) shows results with late fusion, and the third column (c) shows results using IFTR for collaborative perception. Overall, our approach generates more prediction bounding boxes that perfectly align with the ground truth. This improvement can be attributed to two main factors: i) the proposed IFA integrates meaningful information from nearby agents, significantly enhancing the quality of BEV features, and thereby improving detection performance; ii) the proposed CDQA provides effective spatial cues for objects in the scene, effectively compensating for the differences in target spatial distribution between the test set and the training set. + +![](images/83ce0d7cc6c4b8a00a99d169c51f12542f7ef7938fbc854021ceec5b66dc4fea.jpg) + +![](images/123974b7aeec11a1038823d818c9b39ae5155dbf0f1a7efff3651269968dd4c2.jpg) + +![](images/a240f4cd859598651338460a3da04a52e8e6a8113f29b38dd3872dcdd1907b7b.jpg) + +![](images/a61c28e93f3095aedb589d473a125b2d7713ca97d72fca9e73cbfd85209cf574.jpg) +(a) No Collaboration + +![](images/c658854fb0ed171094908d76c923e1cc60e0f538ce2bc9a5bc5511f8512199c5.jpg) +(b) Late Fusion + +![](images/43cd472602488f548c2ad3f0c790cd0f76d78f6bb1ed6c89d1caef8fa7d53224.jpg) +(c) IFTR +Fig. 5: Visualization of predictions from (a) No Collaboration, (b) Late Fusion and (c) IFTR on the OPV2V test set. Green and red 3D bounding boxes represent the ground truth and prediction respectively. + +# 5 Conclusion + +IFTR is an instance-level feature fusion framework based on transformer that aims to enhance the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. It comprises three key components: message selection and feature map reconstruction, instance feature aggregation, and cross-domain query adaptation. The message selection and feature map reconstruction module optimize communication efficiency by transmitting instance-level features. Instance feature aggregation interacts with the visual features of individual agents using predefined grid-shaped BEV queries, generating more comprehensive and accurate BEV features. The cross-domain query adaptation implicitly encodes candidate positions of targets, heuristically integrating 2D priors. Extensive experiments on several multi-agent datasets show the effectiveness of IFTR and the necessity of all its components. + +# Acknowledgements + +The work was supported by the Key Research & Development Plan of Zhejiang Province under Grant 2021C01196, in part by the Zhejiang Provincial Natural Science Foundation of China under Grant LR23F010006, in part by the Open Research Project Programme funded by the Science and Technology Development Fund (SKL-IOTSC(UM)-2024-2026) and the State Key Laboratory of Internet + +of Things for Smart City (University of Macau) (Ref. No.: SKL-IoTSC(UM)-2024-2026/ORP/GA01/2023). + +# References + +1. Betz, J., Zheng, H., Liniger, A., Rosolia, U., Karle, P., Behl, M., Krovi, V., Mangharam, R.: Autonomous vehicles on the edge: A survey on autonomous vehicle racing. IEEE Open Journal of Intelligent Transportation Systems 3, 458-488 (2022) +2. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020) +3. Chen, Q., Ma, X., Tang, S., Guo, J., Yang, Q., Fu, S.: F-cooper: Feature based cooperative perception for autonomous vehicle edge computing system using 3d point clouds. In: Proceedings of the 4th ACM/IEEE Symposium on Edge Computing. pp. 88-100 (2019) +4. Chen, Z., Shi, Y., Jia, J.: Transiff: An instance-level feature fusion framework for vehicle-infrastructure cooperative 3d detection with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18205-18214 (2023) +5. Deng, J., Shi, S., Li, P., Zhou, W., Zhang, Y., Li, H.: Voxel r-cnn: Towards high performance voxel-based 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 1201-1209 (2021) +6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: Carla: An open urban driving simulator. In: Conference on robot learning. pp. 1-16. PMLR (2017) +7. Goodfellow, I., Warde-Farley, D., Mirza, M., Courville, A., Bengio, Y.: Maxout networks. In: International conference on machine learning. pp. 1319-1327. PMLR (2013) +8. Guo, Y., Ma, J., Leslie, E., Huang, Z.: Evaluating the effectiveness of integrated connected automated vehicle applications applied to freeway managed lanes. IEEE Transactions on Intelligent Transportation Systems 23(1), 522-536 (2020) +9. Hu, Y., Fang, S., Lei, Z., Zhong, Y., Chen, S.: Where2comm: Communication-efficient collaborative perception via spatial confidence maps. Advances in neural information processing systems 35, 4874-4886 (2022) +10. Hu, Y., Fang, S., Xie, W., Chen, S.: Aerial monocular 3d object detection. IEEE Robotics and Automation Letters 8(4), 1959-1966 (2023) +1. Huang, J., Huang, G.: Bevdet4d: Exploit temporal cues in multi-camera 3d object detection. arXiv preprint arXiv:2203.17054 (2022) +2. Huang, J., Huang, G., Zhu, Z., Ye, Y., Du, D.: Bevdet: High-performance multicamera 3d object detection in bird-eye-view. arXiv preprint arXiv:2112.11790 (2021) +3. Lang, A.H., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: Pointpillars: Fast encoders for object detection from point clouds. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12697-12705 (2019) +4. Li, J., Li, R., Li, J., Wang, J., Wu, Q., Liu, X.: Dual-view 3d object recognition and detection via lidar point cloud and camera image. Robotics and Autonomous Systems 150, 103999 (2022) +5. Li, Y., Ren, S., Wu, P., Chen, S., Feng, C., Zhang, W.: Learning distilled collaboration graph for multi-agent perception. Advances in Neural Information Processing Systems 34, 29541-29552 (2021) + +16. Li, Y., Ge, Z., Yu, G., Yang, J., Wang, Z., Shi, Y., Sun, J., Li, Z.: Bevdepth: Acquisition of reliable depth for multi-view 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 1477-1485 (2023) +17. Li, Z., Wang, W., Li, H., Xie, E., Sima, C., Lu, T., Qiao, Y., Dai, J.: Bevformer: Learning bird's-eye-view representation from multi-camera images via spatiotemporal transformers. In: European conference on computer vision. pp. 1-18. Springer (2022) +18. Lin, T.Y., Goyal, P., Girshick, R., He, K., Dollar, P.: Focal loss for dense object detection. In: Proceedings of the IEEE international conference on computer vision. pp. 2980-2988 (2017) +19. Liu, H., Teng, Y., Lu, T., Wang, H., Wang, L.: Sparsebev: High-performance sparse 3d object detection from multi-camera videos. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18580-18590 (2023) +20. Liu, Y.C., Tian, J., Glaser, N., Kira, Z.: When2com: Multi-agent perception via communication graph grouping. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 4106-4115 (2020) +21. Liu, Y., Wang, T., Zhang, X., Sun, J.: Petr: Position embedding transformation for multi-view 3d object detection. In: European Conference on Computer Vision. pp. 531-548. Springer (2022) +22. Liu, Y., Yan, J., Jia, F., Li, S., Gao, A., Wang, T., Zhang, X.: Petrov2: A unified framework for 3d perception from multi-camera images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3262-3272 (2023) +23. Liu, Z., Wu, Z., Toth, R.: Smoke: Single-stage monocular 3d object detection via keypoint estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 996-997 (2020) +24. Lu, Y., Hu, Y., Zhong, Y., Wang, D., Chen, S., Wang, Y.: An extensible framework for open heterogeneous collaborative perception. arXiv preprint arXiv:2401.13964 (2024) +25. Lu, Y., Li, Q., Liu, B., Dianati, M., Feng, C., Chen, S., Wang, Y.: Robust collaborative 3d object detection in presence of pose errors. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 4812-4818. IEEE (2023) +26. Philion, J., Fidler, S.: Lift, splat, shoot: Encoding images from arbitrary camera rigs by implicitly unprojecting to 3d. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 194-210. Springer (2020) +27. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 652-660 (2017) +28. Raboy, K., Ma, J., Leslie, E., Zhou, F.: A proof-of-concept field experiment on cooperative lane change maneuvers using a prototype connected automated vehicle testing platform. Journal of Intelligent Transportation Systems 25(1), 77-92 (2021) +29. Reading, C., Harakeh, A., Chae, J., Waslander, S.L.: Categorical depth distribution network for monocular 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8555-8564 (2021) +30. Roddick, T., Kendall, A., Cipolla, R.: Orthographic feature transform for monoc- ular 3d object detection. arXiv preprint arXiv:1811.08188 (2018) +31. Rukhovich, D., Vorontsova, A., Konushin, A.: Imvoxelnet: Image to voxels projection for monocular and multi-view general-purpose 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2397-2406 (2022) + +32. Shladover, S.E.: Opportunities and challenges in cooperative road vehicle automation. IEEE Open Journal of Intelligent Transportation Systems 2, 216-224 (2021) +33. Tan, M., Le, Q.: Efficientnet: Rethinking model scaling for convolutional neural networks. In: International conference on machine learning. pp. 6105-6114. PMLR (2019) +34. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021) +35. Wang, T., Zhu, X., Pang, J., Lin, D.: Fcos3d: Fully convolutional one-stage monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 913-922 (2021) +36. Wang, T.H., Manivasagam, S., Liang, M., Yang, B., Zeng, W., Urtasun, R.: V2vnet: Vehicle-to-vehicle communication for joint perception and prediction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part II 16. pp. 605–621. Springer (2020) +37. Wang, Y., Chao, W.L., Garg, D., Hariharan, B., Campbell, M., Weinberger, K.Q.: Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8445-8453 (2019) +38. Wang, Y., Guizilini, V.C., Zhang, T., Wang, Y., Zhao, H., Solomon, J.: Detr3d: 3d object detection from multi-view images via 3d-to-2d queries. In: Conference on Robot Learning. pp. 180-191. PMLR (2022) +39. Xiang, H., Xu, R., Ma, J.: Hm-vit: Hetero-modal vehicle-to-vehicle cooperative perception with vision transformer. arXiv preprint arXiv:2304.10628 (2023) +40. Xu, R., Guo, Y., Han, X., Xia, X., Xiang, H., Ma, J.: Opencda: an open cooperative driving automation framework integrated with co-simulation. In: 2021 IEEE International Intelligent Transportation Systems Conference (ITSC). pp. 1155-1162. IEEE (2021) +41. Xu, R., Tu, Z., Xiang, H., Shao, W., Zhou, B., Ma, J.: Cobevt: Cooperative bird's eye view semantic segmentation with sparse transformers. arXiv preprint arXiv:2207.02202 (2022) +42. Xu, R., Xiang, H., Tu, Z., Xia, X., Yang, M.H., Ma, J.: V2x-vit: Vehicle-to-everything cooperative perception with vision transformer. In: European conference on computer vision. pp. 107-124. Springer (2022) +43. Xu, R., Xiang, H., Xia, X., Han, X., Li, J., Ma, J.: Opv2v: An open benchmark dataset and fusion pipeline for perception with vehicle-to-vehicle communication. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 2583-2589. IEEE (2022) +44. Yan, Y., Mao, Y., Li, B.: Second: Sparsely embedded convolutional detection. Sensors 18(10), 3337 (2018) +45. Yang, C., Chen, Y., Tian, H., Tao, C., Zhu, X., Zhang, Z., Huang, G., Li, H., Qiao, Y., Lu, L., et al.: Bevformer v2: Adapting modern image backbones to bird's-eye-view recognition via perspective supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17830-17839 (2023) +46. Yin, T., Zhou, X., Krahenbuhl, P.: Center-based 3d object detection and tracking. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11784-11793 (2021) +47. Yu, H., Luo, Y., Shu, M., Huo, Y., Yang, Z., Shi, Y., Guo, Z., Li, H., Hu, X., Yuan, J., et al.: Dair-v2x: A large-scale dataset for vehicle-infrastructure cooperative 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21361-21370 (2022) + +48. Zhang, R., Qiu, H., Wang, T., Guo, Z., Cui, Z., Qiao, Y., Li, H., Gao, P.: Monodetr: Depth-guided transformer for monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9155-9166 (2023) +49. Zhou, B., Krahenbihl, P.: Cross-view transformers for real-time map-view semantic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13760-13769 (2022) +50. Zhou, Y., Tuzel, O.: Voxelnet: End-to-end learning for point cloud based 3d object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4490-4499 (2018) +51. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020) \ No newline at end of file diff --git a/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/images.zip b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..e648bddadc8295aaa853c57271b8ce42435d0cbc --- /dev/null +++ b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bdd8b1b9c149c30ec05f30f367b1692b6b1dfe93a6cc257a9370c7ddefd06073 +size 369259 diff --git a/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/layout.json b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..8becf8f806a9d3af0c646fdaab810291c4afc49f --- /dev/null +++ b/2024/IFTR_ An Instance-Level Fusion Transformer for Visual Collaborative Perception/layout.json @@ -0,0 +1,9339 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 137, + 111, + 477, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 111, + 477, + 148 + ], + "spans": [ + { + "bbox": [ + 137, + 111, + 477, + 148 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer for Visual Collaborative Perception" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "content": "Shaohong Wang" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "content": ", Lu Bin" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "content": ", Xinyu Xiao" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "content": ", Zhiyu Xiang" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "content": ", Hangguan Shan" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "content": ", and Eryun Liu" + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "inline_equation", + "content": "^{1*}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 154, + 201, + 459, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 201, + 459, + 247 + ], + "spans": [ + { + "bbox": [ + 154, + 201, + 459, + 247 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 154, + 201, + 459, + 247 + ], + "type": "text", + "content": " Zhejiang University, Hangzhou, China {wangsh0111,lubin2022, xiangzy, hshan, eryunliu}@zju.edu.cn " + }, + { + "bbox": [ + 154, + 201, + 459, + 247 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 154, + 201, + 459, + 247 + ], + "type": "text", + "content": " Institute of Automation of Chinese Academy of Sciences, Beijing, China xinyu.xiao@nlpr.ia.ac.cn" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "spans": [ + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "text", + "content": "Abstract. Multi-agent collaborative perception has emerged as a widely recognized technology in the field of autonomous driving in recent years. However, current collaborative perception predominantly relies on Li-DAR point clouds, with significantly less attention given to methods using camera images. This severely impedes the development of budget-constrained collaborative systems and the exploitation of the advantages offered by the camera modality. This work proposes an instance-level fusion transformer for visual collaborative perception (IFTR), which enhances the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. To capture the visual information from multiple agents, we design an instance feature aggregation that interacts with the visual features of individual agents using predefined grid-shaped bird eye view (BEV) queries, generating more comprehensive and accurate BEV features. Additionally, we devise a cross-domain query adaptation as a heuristic to fuse 2D priors, implicitly encoding the candidate positions of targets. Furthermore, IFTR optimizes communication efficiency by sending instance-level features, achieving an optimal performance-bandwidth trade-off. We evaluate the proposed IFTR on a real dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, achieving performance improvements of " + }, + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "inline_equation", + "content": "57.96\\%" + }, + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "inline_equation", + "content": "9.23\\%" + }, + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "inline_equation", + "content": "12.99\\%" + }, + { + "bbox": [ + 160, + 277, + 455, + 542 + ], + "type": "text", + "content": " in AP@70 metrics compared to the previous SOTAs, respectively. Extensive experiments demonstrate the superiority of IFTR and the effectiveness of its key components. The code is available at https://github.com/wangsh0111/IFTR." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 552, + 453, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 552, + 453, + 574 + ], + "spans": [ + { + "bbox": [ + 159, + 552, + 453, + 574 + ], + "type": "text", + "content": "Keywords: BEV Queries, Query Adaptation, Visual Collaborative Perception, Transformer" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 596, + 230, + 608 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 596, + 230, + 608 + ], + "spans": [ + { + "bbox": [ + 132, + 596, + 230, + 608 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 622, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 622, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 622, + 482, + 647 + ], + "type": "text", + "content": "3D object detection is a fundamental task in computer vision, aiming to locate objects in 3D physical space given sensor inputs. It is crucial in various" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "text", + "content": "* Corresponding author." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "applications such as autonomous driving [17, 27, 44, 48], robotics [14], and unmanned aerial vehicles [10]. Despite significant advancements in LiDAR-based methods [5, 13, 46, 50], camera-based approaches [26, 29, 35, 38, 46] have garnered widespread attention in recent years. In comparison to LiDAR, cameras have lower deployment costs, are more easily scalable, and provide valuable visual cues for detecting distant objects and identifying vision-based road elements (such as traffic lights and lane markings) [17]. However, due to the lack of depth information in RGB images, solely camera-based 3D object detection is often noticeably inferior to lidar-based detection in most scenarios." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 228, + 482, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 228, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 228, + 482, + 407 + ], + "type": "text", + "content": "The latest advancements in V2X communication technology and Intelligent Transportation Systems enable intelligent agents to share information between each other [1,8,28,32,47]. Through multi-agent interactions, the limitations of individual agent perception, such as occlusion and long-range issues, can be alleviated, thereby enhancing the performance of camera-based 3D object detection. Currently, the prevailing frameworks for collaborative perception [9, 36, 41-43] primarily involve the fusion at the Bird's Eye View (BEV) feature level. However, this paradigm is highly sensitive to the accuracy of BEV features for individual agents and faces challenges in spatial alignment, imposing stringent requirements on real-time poses between agents, leading to insufficient robustness in feature fusion. Nevertheless, due to the lack of depth information in RGB images, generating BEV features from a 2D plane is ill-posed. Therefore, the detection performance of visual collaborative perception methods based solely on BEV features level in camera settings is impacted by compounded errors, where inaccurate BEV features can severely impact the final performance." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 411, + 482, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 471 + ], + "type": "text", + "content": "Diverging from multi-camera 3D object detection, V2X collaborative perception must also account for the constraints of communication bandwidth. It is crucial to address how to reduce communication bandwidth while ensuring collaborative perception performance. Each agent must select visual features with the maximum information content to optimize communication efficiency." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 474, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 666 + ], + "type": "text", + "content": "In this paper, we propose IFTR, a robust and efficient transformer-based instance-level feature fusion framework. Our central idea is to extract spatial features from regions of interest in cross-agent camera views to generate BEV features, and implicitly encode candidate positions of objects in 3D space through a heuristic adaptive approach. Specifically, IFTR incorporates three key designs: i) Instance feature aggregation, aggregating spatial information from visual features of multiple agent camera views using predefined grid-shaped BEV queries. This is achieved through a transformer to implement robust and adaptive feature fusion, avoiding strict spatial alignment requirements in BEV feature-level fusion strategies. It also eliminates the dependency on high-accuracy single-agent BEV features and real-time pose accuracy. ii) Message selection and feature map reconstruction, reducing bandwidth consumption by sharing instance-level visual features rather than entire image features. iii) Cross-domain query adaptation, encoding instance-level features as object queries, combining them with the original learnable object queries to form the new hybrid object queries. This is then input into a deformable DETR head [2,51] for end-to-end 3D object detection." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": "To evaluate IFTR, we conduct extensive experiments on a real-world dataset, DAIR-V2X [47], and two simulated datasets, OPV2V [43] and V2XSet [42]. The experimental results indicate that IFTR significantly outperforms previous works in the performance-bandwidth trade-off across multiple datasets. To sum up, the main contributions are as follows:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 186, + 479, + 390 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 186, + 479, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 186, + 479, + 233 + ], + "spans": [ + { + "bbox": [ + 138, + 186, + 479, + 233 + ], + "type": "text", + "content": "- We introduce IFTR, a superior camera-only instance-level feature fusion framework based on transformers. This framework addresses occlusion and long-range issues through multi-agent collaboration, achieving more accurate and complete 3D object detection." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 234, + 479, + 269 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 234, + 479, + 269 + ], + "spans": [ + { + "bbox": [ + 138, + 234, + 479, + 269 + ], + "type": "text", + "content": "- We devise an instance feature aggregation that utilizes learnable BEV queries to aggregate spatial information from multiple agents, resulting in more accurate BEV features." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 270, + 479, + 318 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 270, + 479, + 318 + ], + "spans": [ + { + "bbox": [ + 138, + 270, + 479, + 318 + ], + "type": "text", + "content": "- We design a cross-domain query adaptation module by encoding instance-level features as object queries, facilitating the implicit encoding of candidate positions for targets in 3D space, which alleviates the problem of target spatial distribution differences between the training set and the test set." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "spans": [ + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "text", + "content": "- We develop communication-efficient collaboration techniques by sharing the most informative visual features to reduce communication overhead. Our IFTR achieves state-of-the-art performance on a real world dataset, DAIR-V2X, and two simulated datasets, OPV2V and V2XSet, with AP@70 metrics improving by " + }, + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "inline_equation", + "content": "57.96\\%" + }, + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "inline_equation", + "content": "9.23\\%" + }, + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "inline_equation", + "content": "12.99\\%" + }, + { + "bbox": [ + 138, + 319, + 479, + 390 + ], + "type": "text", + "content": " compared to the previous SOTAs, respectively." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 411, + 237, + 424 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 411, + 237, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 411, + 237, + 424 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 439, + 340, + 451 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 439, + 340, + 451 + ], + "spans": [ + { + "bbox": [ + 132, + 439, + 340, + 451 + ], + "type": "text", + "content": "2.1 Camera-based 3D Object Detection" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 461, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 461, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 461, + 482, + 605 + ], + "type": "text", + "content": "Given an RGB image and the corresponding camera parameters, the purpose of image-based 3D object detection is to classify and locate the objects of interest. Since images lack depth information, this problem is ill-posed and more challenging compared to 2D detection. FCOS3D [35] and SMOKE [23] extend 2D detection networks by utilizing fully convolutional networks to directly regress the depth for each object. Pseudo LiDAR [37] employs a depth estimation network to transform 2D images into 3D pseudo-point cloud signals, followed by the use of a lidar-based detection network for 3D detection. DETR3D [38] utilizes a set of sparse 3D queries to index 2D features extracted from multi-view images, samples corresponding features, enabling end-to-end 3D detection box prediction without the need for time-consuming post-processing like NMS (Non-Maximum Suppression)." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "Recently, there has been widespread attention on BEV representations due to their ability to clearly depict object positions and scales, coupled with efficient computational efficiency. OFT [30] and ImVoxelNet [31] project predefined voxels onto image features, generating voxel representations of the scene. LSS [26] and CaDDN [29] utilize view transformation modules to convert dense 2D image" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "spans": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "content": "features into BEV space. CVT [49] leverages position encoding from camera perception and dense cross-attention to correlate perspective view and BEV view features. BEVDet [11, 12] and BEVDepth [16] use lift-splat operations for view transformation. PETR [21, 22] utilizes 3D position encoding and global cross-attention for feature fusion, transforming 2D features into 3D position-aware representations. BEVFormer [17, 45] effectively aggregates spatio-temporal features from a surround-view camera and historical BEV features using deformable attention, generating unified BEV features. SparseBEV [19] adapts self-attention with an adaptive receptive field for feature aggregation in BEV space, enjoying the advantages of BEV space without explicitly constructing dense BEV features. In this work, we choose the single-scale and history-free BEVFormer-S [17] as the single-agent 3D object detector for computational efficiency." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 276, + 286, + 289 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 276, + 286, + 289 + ], + "spans": [ + { + "bbox": [ + 132, + 276, + 286, + 289 + ], + "type": "text", + "content": "2.2 Collaborative Perception" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 294, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 294, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 294, + 482, + 582 + ], + "type": "text", + "content": "Collaborative perception is an emerging application in multi-agent systems, aiming to enhance perceptual performance by facilitating communication among other agents for the shared exchange of information. Based on its message sharing strategy, it can be categorized into three types: early fusion (i.e. sharing raw sensor information), intermediate fusion (i.e. sharing intermediate layer features of neural networks), and late fusion (i.e. sharing 3D detection results, such as 3D bounding box position and confidence score). Early fusion usually requires large transmission bandwidth, while late fusion cannot provide valuable scenario context. Intermediate fusion achieves a better trade-off between performance and bandwidth. When2com [20] introduces a handshake mechanism to determine when to communicate and create sparse communication graph. OPV2V [43] utilizes a single-head self-attention module to fuse features, while F-Cooper [3] employs a maxout [7] fusion operation. V2VNet [36] utilizes a spatially aware graph neural network to aggregate shared feature representations among multiple vehicles. DiscoNet [15] adopts knowledge distillation to leverage the advantages of both early and intermediate collaboration. V2X-ViT [42] introduces a novel heterogeneous multi-agent attention module to fuse information across heterogeneous agents. Where2comm [9] introduces a spatial confidence map to reduce communication bandwidth consumption. TransIFF [4] further reduces communication bandwidth consumption by transmitting object queries. CoAlign [25] employs learnable or mathematical methods to correct pose errors for more accurate collaborative perception. HM-ViT [39] and HEAL [24] investigate multi-agent heterogeneous modality collaborative perception problems with different sensor modalities, expanding the scale of collaboration." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "However, prior collaborative perception efforts [4,9,25,36,42,43] have primarily focused on lidar-based 3D object detection, yielding suboptimal performance in a camera-only setup. We speculate that the reason lies in the inferior quality of BEV features from a single-agent compared to lidar-based methods, resulting in suboptimal solutions at the BEV feature level. In this paper, we propose a novel camera-only instance-level feature fusion framework with lower communication bandwidth consumption. It generates more accurate BEV features and" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 114, + 477, + 308 + ], + "blocks": [ + { + "bbox": [ + 137, + 114, + 477, + 308 + ], + "lines": [ + { + "bbox": [ + 137, + 114, + 477, + 308 + ], + "spans": [ + { + "bbox": [ + 137, + 114, + 477, + 308 + ], + "type": "image", + "image_path": "475ad1900580ae917a777d25ddc0167d17151dd23e4632ecbbfe55123b222293.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 316, + 482, + 383 + ], + "lines": [ + { + "bbox": [ + 130, + 316, + 482, + 383 + ], + "spans": [ + { + "bbox": [ + 130, + 316, + 482, + 383 + ], + "type": "text", + "content": "Fig. 1: Overall architecture of IFTR. i) We employ the message selection and feature map reconstruction module to share instance-level features, reducing bandwidth consumption; ii) In instance feature aggregation (IFA), each BEV query interacts only with image features from regions of interest from multiple views; iii) In CDQA, we encode the feature map information and 3D positional information of each instance into 3D object query." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 408, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 408, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 408, + 482, + 445 + ], + "type": "text", + "content": "3D object queries tailored to each instance by leveraging instance-level features shared among multiple agents, thereby achieving more efficient and practical collaborative perception." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 468, + 189, + 480 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 189, + 480 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 189, + 480 + ], + "type": "text", + "content": "3 IFTR" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "This section presents IFTR, a robust and efficient camera-only instance-level feature fusion framework for collaborative perception. As depicted in Fig. 1, IFTR comprises an image encoder, message selection and feature map reconstruction, cascade instance feature aggregation, cross-domain query adaptation, and a DETR decoder. The image encoder is utilized to extract visual features from the input images. The proposed message selection and feature map reconstruction module are employed at the sender and receiver ends, respectively, for instance-level visual feature filtering and image feature reconstruction, effectively saving communication bandwidth. Based on visual features from multiple camera views, the proposed cascade instance feature aggregation generates comprehensive and accurate BEV features; the proposed cross-domain query adaptation module encodes instance-level visual features into object queries to encode candidate positions for the targets, combining them with the original learnable object queries to form the hybrid object queries. Ultimately, the DETR decoder" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "type": "text", + "content": "takes the BEV features and the hybrid object queries as inputs to predict the target's category and location information." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 158, + 236, + 170 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 158, + 236, + 170 + ], + "spans": [ + { + "bbox": [ + 132, + 158, + 236, + 170 + ], + "type": "text", + "content": "3.1 Image Encoder" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": "We leverage EfficientNet [33, 34] to extract visual features from the input images because of its high performance and low computational complexity. Given " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": " agents and " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "N_{\\text{cams}}" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": " camera views for each agent, " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "F_i^k \\in \\mathbb{R}^{fC \\times fH \\times fW}" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": " is used to represent the extracted feature map of the " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": "-th camera view of the " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": "-th agent, where " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "fC" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "fH" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "fW" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": " are the channel, height and width of the feature map. Considering different agents may have different camera views, the feature maps of views that not exist are set to zero when the actual number of camera views less than " + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "inline_equation", + "content": "N_{\\text{cams}}" + }, + { + "bbox": [ + 130, + 178, + 479, + 274 + ], + "type": "text", + "content": " and use a mask to indicate the valid feature maps." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 291, + 421, + 304 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 291, + 421, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 291, + 421, + 304 + ], + "type": "text", + "content": "3.2 Message Selection and Feature Map Reconstruction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 311, + 480, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 480, + 407 + ], + "type": "text", + "content": "To achieve accurate and comprehensive 3D object detection, it is imperative for each agent to exchange visual features and leverage complementary information. We propose communication-efficient collaborative techniques by sharing the most informative visual features to reduce communication overhead. The intuition is that foreground regions contain more informative content than background regions. During collaboration, visual features of regions with objects can assist in recovering missed objects due to occlusion or long-range issues, while background regions can be omitted to reduce the system's communication load." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 407, + 480, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 480, + 430 + ], + "type": "text", + "content": "Given a feature map " + }, + { + "bbox": [ + 132, + 407, + 480, + 430 + ], + "type": "inline_equation", + "content": "F_{j}^{k}" + }, + { + "bbox": [ + 132, + 407, + 480, + 430 + ], + "type": "text", + "content": ", the message sent for sharing is selected by the following steps:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 135, + 438, + 480, + 522 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 135, + 438, + 479, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 438, + 479, + 474 + ], + "spans": [ + { + "bbox": [ + 135, + 438, + 479, + 474 + ], + "type": "text", + "content": "1. Extracting a set of candidate object instances by a 2D object detector. All the confidence values of instance are greater than a predefined threshold, " + }, + { + "bbox": [ + 135, + 438, + 479, + 474 + ], + "type": "inline_equation", + "content": "c_{\\text{thre}}" + }, + { + "bbox": [ + 135, + 438, + 479, + 474 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 135, + 474, + 480, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 474, + 480, + 498 + ], + "spans": [ + { + "bbox": [ + 135, + 474, + 480, + 498 + ], + "type": "text", + "content": "2. Cropping the feature map of each instance by the predicted bounding box in inference stage or by the ground truth bounding box in the training stage." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "text", + "content": "3. The cropped feature map of the " + }, + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "text", + "content": "-th selected instance, " + }, + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "inline_equation", + "content": "F_{j \\to i}^{k,n}" + }, + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "text", + "content": ", and bounding box are sent to the " + }, + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 135, + 498, + 480, + 522 + ], + "type": "text", + "content": "-th agent for sharing." + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "spans": [ + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "text", + "content": "At the side of ego agent (or the " + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "text", + "content": "-th agent), the received object instance feature maps of the " + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "text", + "content": "-th camera view of the " + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "text", + "content": "-th agent are first combined together to reconstruct the feature map, " + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{j\\rightarrow i}^{k}" + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "text", + "content": ", of foreground regions of original feature map " + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "inline_equation", + "content": "F_{j}^{k}" + }, + { + "bbox": [ + 130, + 530, + 480, + 591 + ], + "type": "text", + "content": " by filling back the cropped features. The features in background region are set to zero." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 609, + 309, + 621 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 309, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 309, + 621 + ], + "type": "text", + "content": "3.3 Instance Feature Aggregation" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 629, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 480, + 666 + ], + "type": "text", + "content": "Given a set of received foreground feature maps, " + }, + { + "bbox": [ + 132, + 629, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{F}_{j\\rightarrow i}^k |j = 1,2,\\dots ,N_{agent},k = 1,2,\\ldots ,N_{cams}\\}" + }, + { + "bbox": [ + 132, + 629, + 480, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 132, + 629, + 480, + 666 + ], + "type": "inline_equation", + "content": "N_{agent}" + }, + { + "bbox": [ + 132, + 629, + 480, + 666 + ], + "type": "text", + "content": " is the number of agents, the purpose of instance feature aggregation (IFA) module is to form a BEV feature map by aggregating" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 114, + 255, + 277 + ], + "blocks": [ + { + "bbox": [ + 137, + 114, + 255, + 277 + ], + "lines": [ + { + "bbox": [ + 137, + 114, + 255, + 277 + ], + "spans": [ + { + "bbox": [ + 137, + 114, + 255, + 277 + ], + "type": "image", + "image_path": "94f6ba6d5f9bdf75129c817f733913abc2700fb451f9edcb779e6b9e07d133b5.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 180, + 278, + 200, + 286 + ], + "lines": [ + { + "bbox": [ + 180, + 278, + 200, + 286 + ], + "spans": [ + { + "bbox": [ + 180, + 278, + 200, + 286 + ], + "type": "text", + "content": "(a) IFA" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 300, + 480, + 322 + ], + "lines": [ + { + "bbox": [ + 131, + 300, + 480, + 322 + ], + "spans": [ + { + "bbox": [ + 131, + 300, + 480, + 322 + ], + "type": "text", + "content": "Fig. 2: (a) The architecture of our proposed Instance Feature Aggregation (IFA); (b) Multi-View Feature Aggregation (MVFA) illustrated in Sec. 3.3" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 262, + 115, + 476, + 277 + ], + "blocks": [ + { + "bbox": [ + 262, + 115, + 476, + 277 + ], + "lines": [ + { + "bbox": [ + 262, + 115, + 476, + 277 + ], + "spans": [ + { + "bbox": [ + 262, + 115, + 476, + 277 + ], + "type": "image", + "image_path": "596de059f390cf23d7aa4f650497239fb170d235f3adca501ff241120ca40440.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 355, + 278, + 383, + 286 + ], + "lines": [ + { + "bbox": [ + 355, + 278, + 383, + 286 + ], + "spans": [ + { + "bbox": [ + 355, + 278, + 383, + 286 + ], + "type": "text", + "content": "(b) MVFA" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 347, + 479, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 479, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 479, + 396 + ], + "type": "text", + "content": "features from all received foreground feature maps. Since all camera views are treated equally in IFA module, for simplicity, we represent all the foreground feature maps by " + }, + { + "bbox": [ + 130, + 347, + 479, + 396 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{F}_v|v = 1,2,\\dots ,N_v\\}" + }, + { + "bbox": [ + 130, + 347, + 479, + 396 + ], + "type": "text", + "content": ", where the total number of views is " + }, + { + "bbox": [ + 130, + 347, + 479, + 396 + ], + "type": "inline_equation", + "content": "N_{v} = N_{agent}\\times N_{cams}" + }, + { + "bbox": [ + 130, + 347, + 479, + 396 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 396, + 480, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 396, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 396, + 480, + 468 + ], + "type": "text", + "content": "The BEV space around the ego agent is divided into a discrete grid space of size " + }, + { + "bbox": [ + 130, + 396, + 480, + 468 + ], + "type": "inline_equation", + "content": "H \\times W" + }, + { + "bbox": [ + 130, + 396, + 480, + 468 + ], + "type": "text", + "content": ". The origin of ego coordinate is at the center of BEV grid. To construct a feature map on the BEV space of the ego agent by fusing reconstructed feature maps " + }, + { + "bbox": [ + 130, + 396, + 480, + 468 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{F}_i | i = 1,2,\\dots,N_v\\}" + }, + { + "bbox": [ + 130, + 396, + 480, + 468 + ], + "type": "text", + "content": " from all collaborative views, we propose a deformable attention based cascade instance feature aggregation (IFA) module (see Fig. 2). The BEV feature map is obtained by the following steps:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 135, + 478, + 484, + 577 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 135, + 478, + 480, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 478, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 135, + 478, + 480, + 502 + ], + "type": "text", + "content": "1. A set of learnable parameters " + }, + { + "bbox": [ + 135, + 478, + 480, + 502 + ], + "type": "inline_equation", + "content": "Q_{\\mathrm{bev}} \\in \\mathbb{R}^{C \\times H \\times W}" + }, + { + "bbox": [ + 135, + 478, + 480, + 502 + ], + "type": "text", + "content": " is predefined and randomly initialized at the first IFA block." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "spans": [ + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "text", + "content": "2. For a given grid centered at " + }, + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "text", + "content": ", a set of points " + }, + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "inline_equation", + "content": "\\{(x,y,z_h)|h = 1,2,\\dots,N_{ref}\\}" + }, + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "text", + "content": " is selected as reference points, where " + }, + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "inline_equation", + "content": "\\{z_h|h = 1,2,\\dots,N_{ref}\\}" + }, + { + "bbox": [ + 135, + 503, + 484, + 552 + ], + "type": "text", + "content": " are predefined heights for each grid. The reference points are used as feature indices to gather information from collaborative feature maps." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 135, + 552, + 480, + 577 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 552, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 135, + 552, + 480, + 577 + ], + "type": "text", + "content": "3. For a reference point " + }, + { + "bbox": [ + 135, + 552, + 480, + 577 + ], + "type": "inline_equation", + "content": "(x,y,z_h)" + }, + { + "bbox": [ + 135, + 552, + 480, + 577 + ], + "type": "text", + "content": " at grid " + }, + { + "bbox": [ + 135, + 552, + 480, + 577 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 135, + 552, + 480, + 577 + ], + "type": "text", + "content": ", the corresponding feature vector is aggregated by" + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 257, + 578, + 373, + 610 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 578, + 373, + 610 + ], + "spans": [ + { + "bbox": [ + 257, + 578, + 373, + 610 + ], + "type": "interline_equation", + "content": "F _ {b e v} ^ {h} (x, y) = \\frac {1}{| w |} \\sum_ {v = 1} ^ {N _ {v}} w _ {v} f _ {v} ^ {h},", + "image_path": "a0255754e6e2aeddc697324031ef2e92045049cbfd600617c10eb5e5eb6c0c5c.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "inline_equation", + "content": "w_v \\in \\{0,1\\}" + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "text", + "content": " indicates whether the reference point " + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "inline_equation", + "content": "(x,y,z_h)" + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "text", + "content": " is projected inside the image space of the " + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "text", + "content": "-th camera view, and " + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "inline_equation", + "content": "|w| = \\sum_v w_v" + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "text", + "content": " is total number of views observing the reference point, and " + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "inline_equation", + "content": "f_v^h" + }, + { + "bbox": [ + 147, + 617, + 480, + 665 + ], + "type": "text", + "content": " is the output of a deformable attention module, which will be described later in this section." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "spans": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 135, + 116, + 480, + 188 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "spans": [ + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "text", + "content": "4. The aggregated BEV feature " + }, + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "inline_equation", + "content": "F_{bev}" + }, + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "text", + "content": " is the average feature over all " + }, + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "inline_equation", + "content": "N_{ref}" + }, + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "text", + "content": " reference points for each grid and followed by a feed forward network (FFN) and an Add&Norm module to get the output " + }, + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "inline_equation", + "content": "\\hat{F}_{bev}" + }, + { + "bbox": [ + 135, + 116, + 479, + 151 + ], + "type": "text", + "content": " of IFA module." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 135, + 152, + 480, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 152, + 480, + 188 + ], + "spans": [ + { + "bbox": [ + 135, + 152, + 480, + 188 + ], + "type": "text", + "content": "5. The above four steps assemble an IFA module. To sufficiently fuse all camera view features, we cascade 6 IFA modules sequentially, with the previous IFA output " + }, + { + "bbox": [ + 135, + 152, + 480, + 188 + ], + "type": "inline_equation", + "content": "\\hat{F}_{\\text{bev}}" + }, + { + "bbox": [ + 135, + 152, + 480, + 188 + ], + "type": "text", + "content": " as the input " + }, + { + "bbox": [ + 135, + 152, + 480, + 188 + ], + "type": "inline_equation", + "content": "Q_{\\text{bev}}" + }, + { + "bbox": [ + 135, + 152, + 480, + 188 + ], + "type": "text", + "content": " of the next IFA." + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": "Given a reference point " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "(x,y,z_h)" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " at grid " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " and the feature map " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_v" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " of " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": "-th camera view, if point " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "(x,y,z_h)" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " is observed by the " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": "-th camera view, the deformable attention first takes a feature vector " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "\\hat{Q}_{\\mathrm{bev}}(x,y)" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "\\hat{Q}_{\\mathrm{bev}}" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " and the vector " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "\\hat{Q}_{\\mathrm{bev}}(x,y)" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " is then fed into a MLP layer. The MLP layer output a list of offset vectors " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "(o_1,o_2,\\dots,o_{N_{da}})" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " and a weight vector " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "\\lambda = (\\lambda_1,\\lambda_2,\\dots,\\lambda_{N_{da}})" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "inline_equation", + "content": "N_{da}" + }, + { + "bbox": [ + 132, + 196, + 481, + 278 + ], + "type": "text", + "content": " is the number of positions in attention, the output of deformable attention is" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 258, + 279, + 358, + 310 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 279, + 358, + 310 + ], + "spans": [ + { + "bbox": [ + 258, + 279, + 358, + 310 + ], + "type": "interline_equation", + "content": "f _ {v} ^ {h} = \\sum_ {i = 1} ^ {N _ {d a}} \\lambda_ {i} \\mathcal {F} _ {v} (p + o _ {i}),", + "image_path": "d67deab16d4a51c4d904fa63195b6fc48ad66ab5fd460c5f7c872a1a398ccefb.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "spans": [ + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "text", + "content": " is the projected image coordinate of " + }, + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "inline_equation", + "content": "(x,y,z_h)" + }, + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "text", + "content": " on " + }, + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 132, + 316, + 430, + 329 + ], + "type": "text", + "content": "-th view." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 347, + 327, + 360 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 327, + 360 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 327, + 360 + ], + "type": "text", + "content": "3.4 Cross-Domain Query Adaptation" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 369, + 482, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 487 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 487 + ], + "type": "text", + "content": "The object decoder of BEVformer [17] is a DETR [2,51] decoder that receives a set of learned embeddings as object queries, aiming to learn potential locations of target objects during training. However, it takes a considerable amount of time for randomly initialized embeddings to converge to suitable positions. Additionally, during inference, object queries remain fixed for all images, while the spatial distribution of target objects may vary, leading to potentially inaccurate results. To address this issue, we employ a cross-domain query adaptation (CDQA) module to initialize object queries for decoder. This module implicitly encodes candidate positions for the target, making it easier for the detection head to capture the target object accurately." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 489, + 481, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 489, + 481, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 489, + 481, + 536 + ], + "type": "text", + "content": "The maximum number of queries for decoder is set to " + }, + { + "bbox": [ + 130, + 489, + 481, + 536 + ], + "type": "inline_equation", + "content": "N_{Q}" + }, + { + "bbox": [ + 130, + 489, + 481, + 536 + ], + "type": "text", + "content": ". The initial set of queries consists of two parts. The first part of queries is obtained from selected instances of all ego and collaborative camera views and the second part (the rest) of queries is randomly initialized." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "spans": [ + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "text", + "content": "Given a set of shared instance features " + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "inline_equation", + "content": "\\{(\\mathcal{I}_n,B_n)|n = 1,2,\\ldots ,N_I\\}" + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "text", + "content": " from all collaborative and ego views, where " + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "inline_equation", + "content": "N_{I}" + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "text", + "content": " is total number of instances, " + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "inline_equation", + "content": "\\mathcal{I}_n" + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "text", + "content": " is the " + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "text", + "content": "-th cropped instance feature map, and " + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "inline_equation", + "content": "B_{n}" + }, + { + "bbox": [ + 130, + 536, + 481, + 585 + ], + "type": "text", + "content": " is the bounding box coordinates, the queries is obtained as following" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 135, + 593, + 480, + 664 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 135, + 593, + 479, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 593, + 479, + 616 + ], + "spans": [ + { + "bbox": [ + 135, + 593, + 479, + 616 + ], + "type": "text", + "content": "1. Global average pooling (GAP) on instance feature maps and then followed by a MLP module to get a set of feature vector " + }, + { + "bbox": [ + 135, + 593, + 479, + 616 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{I}_n^p | n = 1, 2, \\dots, N_I\\}" + }, + { + "bbox": [ + 135, + 593, + 479, + 616 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "spans": [ + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "text", + "content": "2. Encode the instance position information into a vector by a MLP layer, obtaining a set of position embeddings " + }, + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{V}_n|n = 1,2,\\ldots ,N_I\\}" + }, + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "text", + "content": ". The input to the MLP is the concatenate of three coordinates " + }, + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "inline_equation", + "content": "(p_1,p_2,c)" + }, + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "inline_equation", + "content": "p_1,p_2" + }, + { + "bbox": [ + 135, + 617, + 480, + 664 + ], + "type": "text", + "content": " are the 3D coordinates of left-top and bottom-right point of instance bounding" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 147, + 116, + 479, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 116, + 479, + 151 + ], + "spans": [ + { + "bbox": [ + 147, + 116, + 479, + 151 + ], + "type": "text", + "content": "box on the focal plane and " + }, + { + "bbox": [ + 147, + 116, + 479, + 151 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 147, + 116, + 479, + 151 + ], + "type": "text", + "content": " is the coordinate of corresponding camera origin. All coordinates are projected to the ego coordinate system. The three points indicate a cone where the object lies." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 135, + 152, + 479, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 152, + 479, + 187 + ], + "spans": [ + { + "bbox": [ + 135, + 152, + 479, + 187 + ], + "type": "text", + "content": "3. Combine the feature vectors and position embeddings by adding, obtaining the instance feature initialized set of queries " + }, + { + "bbox": [ + 135, + 152, + 479, + 187 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{I}_n^p +\\mathcal{V}_n|n = 1,2,\\ldots ,N_I\\}" + }, + { + "bbox": [ + 135, + 152, + 479, + 187 + ], + "type": "text", + "content": " for object decoder." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 194, + 479, + 218 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 194, + 479, + 218 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 479, + 218 + ], + "type": "text", + "content": "The union, " + }, + { + "bbox": [ + 130, + 194, + 479, + 218 + ], + "type": "inline_equation", + "content": "Q_{\\mathrm{hybrid}}" + }, + { + "bbox": [ + 130, + 194, + 479, + 218 + ], + "type": "text", + "content": ", of the instance feature initialized set of queries and the randomly initialized set of queries is then used as queries of object decoder." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 234, + 240, + 247 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 234, + 240, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 234, + 240, + 247 + ], + "type": "text", + "content": "3.5 Object Decoder" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "spans": [ + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "content": "The object decoder of IFTR employs a deformable DETR detection head, taking the BEV features " + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "inline_equation", + "content": "\\hat{F}_{bev} \\in \\mathbb{R}^{C \\times H \\times W}" + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "content": " and the hybrid object queries " + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "inline_equation", + "content": "Q_{\\mathrm{hybrid}} \\in \\mathbb{R}^{N_Q \\times C}" + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "content": " as input, producing detection results " + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "inline_equation", + "content": "\\mathcal{O} = \\Phi_{\\mathrm{dec}}(\\hat{F}_{bev}, Q_{\\mathrm{hybrid}}) \\in \\mathbb{R}^{N_Q \\times 8}" + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "content": ". Each position of " + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "inline_equation", + "content": "\\mathcal{O}" + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "content": " represents a rotated box with class " + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "inline_equation", + "content": "(c, x, y, z, w, l, h, \\theta)" + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "content": ", denoting class confidence, position, size and angle. The objects are the final output of the proposed collaborative perception system. We utilize the " + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "inline_equation", + "content": "\\ell_1" + }, + { + "bbox": [ + 130, + 253, + 480, + 338 + ], + "type": "text", + "content": " loss for regression and the focal loss [18] for classification." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 355, + 230, + 369 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 355, + 230, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 355, + 230, + 369 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 379, + 261, + 392 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 379, + 261, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 379, + 261, + 392 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "text", + "content": "Datasets. To evaluate the performance of IFTR on the visual collaborative perception task, we conduct extensive experiments on three multi-agent datasets, including V2XSet [42], OPV2V [43], and DAIR-V2X [47]. V2XSet [42] is a simulated dataset supporting V2X perception, co-simulated by CARLA [6] and OpenCDA [40]. It comprises 73 representative scenes with 2 to 5 connected agents and 11,447 annotated 3D frames, with an image resolution of " + }, + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "inline_equation", + "content": "600 \\times 800" + }, + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "text", + "content": ". OPV2V [43] is a large-scale vehicle-to-vehicle collaborative perception dataset, comprising 12,000 LiDAR point cloud frames and RGB images with 230,000 annotations of 3D bounding boxes, with an image resolution of " + }, + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "inline_equation", + "content": "600 \\times 800" + }, + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "text", + "content": ". DAIR-V2X [47] is a real-world vehicle-to-infrastructure collaborative perception dataset, consists of 100 realistic scenes and 18,000 data samples, with an image resolution of " + }, + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "inline_equation", + "content": "1080 \\times 1920" + }, + { + "bbox": [ + 130, + 397, + 480, + 540 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "text", + "content": "Implementation details. We use the single-scale and history-free BEVFormerS [17] as the 3D object detector for single agent. We employ EfficientNet [33,34] as the image backbone for better computation efficiency and utilize a smaller grid resolution " + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "inline_equation", + "content": "(0.4\\mathrm{m})" + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "text", + "content": " to retain fine-trained spatial details. The intermediate BEV feature map has a dimension of " + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "inline_equation", + "content": "256\\times 256\\times 256" + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "text", + "content": ", with a perception range defined as " + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "inline_equation", + "content": "x\\in [-51.2\\mathrm{m},51.2\\mathrm{m}]" + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "inline_equation", + "content": "y\\in [-51.2\\mathrm{m},51.2\\mathrm{m}]" + }, + { + "bbox": [ + 130, + 557, + 481, + 665 + ], + "type": "text", + "content": ". Following prior research [41-43], we only modified the fusion module of different intermediate fusion methods while keeping the other components such as camera feature extractor and detection head the same. As IFTR involves instance-level fusion of" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 262, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 262, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 262, + 91, + 447, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 157, + 496, + 271 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 1: 3D detection performance comparison on the V2XSet [42], OPV2V [43] and DAIR-V2X [47] datasets. The results are reported in Average Precision (AP) at IoU=0.30, 0.50 and 0.70 on perfect settings." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 157, + 496, + 271 + ], + "lines": [ + { + "bbox": [ + 132, + 157, + 496, + 271 + ], + "spans": [ + { + "bbox": [ + 132, + 157, + 496, + 271 + ], + "type": "table", + "html": "
MethodV2XSetOPV2VDAIR-V2X
AP@30AP@50AP@70AP@30AP@50AP@70AP@30AP@50AP@70
No Collaboration0.43430.30370.13790.56520.45940.25560.21020.07090.0080
Late Fusion0.68030.51410.25590.87890.77620.51920.29520.16310.0421
V2VNet [36]0.68860.59540.39000.86820.79060.57590.25810.13540.0276
V2X-ViT [42]0.66900.59140.41230.85120.78410.58380.25440.14020.0277
Where2comm [9]0.69690.61690.43960.84710.77140.58600.26130.14240.0296
CoBEVT [41]0.66290.58840.40810.87090.80260.59340.26080.14530.0255
CoAlign [25]0.75640.64790.39640.86890.80210.60460.26450.14700.0262
IFTR0.80570.71730.49670.92330.85560.66040.38550.20580.0665
", + "image_path": "56b7cd0d4466367b8e3c66a2d585b4b6cb133eb30756733cbae1188258b4d043.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 293, + 481, + 329 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 481, + 329 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 481, + 329 + ], + "type": "text", + "content": "2D image features, we construct it following the method proposed in Sec. 3 and straightforwardly add a late fusion strategy to explore its combined effects with other fusion strategies." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 346, + 482, + 405 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 346, + 482, + 405 + ], + "spans": [ + { + "bbox": [ + 130, + 346, + 482, + 405 + ], + "type": "text", + "content": "Evaluation metrics. We evaluate the detection performance using Average Precision (AP) metrics with Intersection over Union (IoU) thresholds of 0.30, 0.50, and 0.70. Additionally, the communication volume follows the standard setting as [4,9,42,43] that counts the message size by byte in log scale with base 2." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 424, + 281, + 436 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 281, + 436 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 281, + 436 + ], + "type": "text", + "content": "4.2 Quantitative Evaluation" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "text", + "content": "Benchmark comparison. Tab. 1 compares the proposed IFTR with previous collaborative methods. We consider single-agent detection without collaboration (No collaboration), V2VNet [36], V2XViT [42], Where2comm [9], CoBEVT [41], CoAlign [25] and late fusion, where late fusion directly exchanges 3D detection boxes. We observe that the proposed IFTR outperforms previous methods on both real-world and simulated datasets, demonstrating the superiority of our model and its robustness to various realistic noises. Specifically, the SOTA performance of AP@70 on the V2XSet, OPV2V and DAIR-V2X datasets is improved by " + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "inline_equation", + "content": "12.99\\%" + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "inline_equation", + "content": "9.23\\%" + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "inline_equation", + "content": "57.96\\%" + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "text", + "content": ", respectively. Compared to previous collaboration methods at the BEV level, IFTR significantly enhances the quality of BEV features through instance feature aggregation, and adapts the cross-domain query adaption to implicitly encode the positions of the target in 3D space, achieving more accurate perception." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Number of agents. In this experiment, we investigate the impact of the quantity of agents on the perceptual performance of IFTR on the OPV2V dataset. As depicted in Fig. 3a, the perceptual performance positively increases as more agents engage in cooperative perception. From Fig. 3b, it can be observed that, in" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 148, + 118, + 297, + 267 + ], + "blocks": [ + { + "bbox": [ + 148, + 118, + 297, + 267 + ], + "lines": [ + { + "bbox": [ + 148, + 118, + 297, + 267 + ], + "spans": [ + { + "bbox": [ + 148, + 118, + 297, + 267 + ], + "type": "image", + "image_path": "eb472464f083fac7355029529b3a737669b04816b63dada118a25dda8a664be6.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 176, + 272, + 268, + 282 + ], + "lines": [ + { + "bbox": [ + 176, + 272, + 268, + 282 + ], + "spans": [ + { + "bbox": [ + 176, + 272, + 268, + 282 + ], + "type": "text", + "content": "(a) All scenes on OPV2V" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 316, + 118, + 468, + 266 + ], + "blocks": [ + { + "bbox": [ + 316, + 118, + 468, + 266 + ], + "lines": [ + { + "bbox": [ + 316, + 118, + 468, + 266 + ], + "spans": [ + { + "bbox": [ + 316, + 118, + 468, + 266 + ], + "type": "image", + "image_path": "0385df63854ed85ba374b260b9190ba45be533ce26b2186436287d4d5d772eec.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 335, + 272, + 447, + 282 + ], + "lines": [ + { + "bbox": [ + 335, + 272, + 447, + 282 + ], + "spans": [ + { + "bbox": [ + 335, + 272, + 447, + 282 + ], + "type": "text", + "content": "(b) A certain scene on OPV2V" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 290, + 482, + 335 + ], + "lines": [ + { + "bbox": [ + 130, + 290, + 482, + 335 + ], + "spans": [ + { + "bbox": [ + 130, + 290, + 482, + 335 + ], + "type": "text", + "content": "Fig. 3: IFTR steadily improves 3D detection performance as the number of agents grows. (a) The relationship between 3D detection performance and the maximum collaboration count on the OPV2V test set; (b) The relationship between 3D detection performance and collaboration count in a certain scene on the OPV2V test set." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 362, + 482, + 469 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 362, + 482, + 469 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 482, + 469 + ], + "type": "text", + "content": "a simple perception environment, the IFTR performance exceeds that of the single LiDAR-based detector [13] when the collaboration count is 2 for the AP@50 metric. Similarly, for the AP@70 metric, the IFTR performance surpasses the single LiDAR-based detector when the collaboration count is 5. It is noteworthy that the detection performance consistently improves with the increase in the number of collaborative agents. Even upon reaching the maximum collaboration quantity in the dataset, a rising trend in performance persists. Therefore, we advocate for active collaboration among more agents to achieve increasingly advanced perceptual performance." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 495, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 495, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 495, + 482, + 628 + ], + "type": "text", + "content": "Robustness to localization noise. We follow the localization noise settings in V2X-ViT [42] (Gaussian noise with a mean of 0m and a variance of 0m-0.6m) and validate the robustness of IFTR against realistic localization noise. Fig. 4 illustrates the detection performances as a function of localization noise level in V2XSet and DAIR-V2X datasets, respectively. We see: i) with the increasing localization noise, the performance of all intermediate collaborative methods deteriorates due to the misalignment of feature maps, while IFTR outperforms previous SOTAs at all the localization noise levels; ii) IFTR consistently outperforms the No Collaboration by a significant margin. The reason is the powerful transformer architecture in IFA can capture crucial perceptual cues and holistic information across agents." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 653, + 246, + 664 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 653, + 246, + 664 + ], + "spans": [ + { + "bbox": [ + 132, + 653, + 246, + 664 + ], + "type": "text", + "content": "4.3 Ablation Studies" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "spans": [ + { + "bbox": [ + 262, + 91, + 448, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 148, + 118, + 297, + 266 + ], + "blocks": [ + { + "bbox": [ + 148, + 118, + 297, + 266 + ], + "lines": [ + { + "bbox": [ + 148, + 118, + 297, + 266 + ], + "spans": [ + { + "bbox": [ + 148, + 118, + 297, + 266 + ], + "type": "image", + "image_path": "254c35cb64b1f23407ca6cfd1fa883df27b596d303c5df883186cc27ef63b645.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 195, + 272, + 249, + 282 + ], + "lines": [ + { + "bbox": [ + 195, + 272, + 249, + 282 + ], + "spans": [ + { + "bbox": [ + 195, + 272, + 249, + 282 + ], + "type": "text", + "content": "(a) DAIR-V2X" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 316, + 118, + 468, + 266 + ], + "blocks": [ + { + "bbox": [ + 316, + 118, + 468, + 266 + ], + "lines": [ + { + "bbox": [ + 316, + 118, + 468, + 266 + ], + "spans": [ + { + "bbox": [ + 316, + 118, + 468, + 266 + ], + "type": "image", + "image_path": "47f1dc893bf140d7e49abd06efb6bdf4e73f85663a2e7bbc1e23f5361c699432.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 370, + 272, + 413, + 282 + ], + "lines": [ + { + "bbox": [ + 370, + 272, + 413, + 282 + ], + "spans": [ + { + "bbox": [ + 370, + 272, + 413, + 282 + ], + "type": "text", + "content": "(b) V2XSet" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 290, + 480, + 324 + ], + "lines": [ + { + "bbox": [ + 130, + 290, + 480, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 290, + 480, + 324 + ], + "type": "text", + "content": "Fig. 4: Robustness to localization noise on the DAIR-V2X and V2XSet datasets. Gaussian noise with zero mean and a varying variance is introduced. IFTR consistently outperforms previous SOTAs." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 168, + 403, + 447, + 473 + ], + "blocks": [ + { + "bbox": [ + 130, + 338, + 482, + 394 + ], + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 394 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 394 + ], + "type": "text", + "content": "Table 2: Ablation Study results of the proposed components on the OPV2V and DAIR-V2X datasets. IFA, CDQA respectively represent the incorporation of i) instance feature aggregation, and ii) cross-domain query adaptation. MASK denotes interacting exclusively with the foreground features of collaborators in the multi-view feature aggregation module." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 168, + 403, + 447, + 473 + ], + "lines": [ + { + "bbox": [ + 168, + 403, + 447, + 473 + ], + "spans": [ + { + "bbox": [ + 168, + 403, + 447, + 473 + ], + "type": "table", + "html": "
IFA CDQA MASKOPV2VDAIR-V2X
AP@50AP@70CommAP@50AP@70Comm
0.77620.519211.450.16310.042112.04
✓0.84800.648724.230.19980.057421.91
✓✓0.85560.660424.230.20580.066521.91
✓✓✓0.84580.630020.610.19780.061818.23
", + "image_path": "d15705666b9858bbb8efbd95d2defdd764a3b21decacaf06094c3e237b533c88.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": "Effectiveness of different modules in IFTR. Here we investigate the effectiveness of various components in IFTR, with the base model being BEVFormerS incorporating a late fusion strategy. We progressively adding i) IFA, ii) CDQA, and iii) MASK to assess the impact of each component on detection performance and communication volume, where MASK refers to interacting only with the foreground features of collaborators in the MVFA module. As Tab. 2 demonstrates i) IFA contributes the most significant performance gain, increasing AP@70 on OPV2V and DAIR-V2X by " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "24.94\\%" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "36.34\\%" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": ", respectively. This is attributed to the MVFA design in IFA, which significantly improves the quality of BEV features for individual agents, enhancing BEV features and further improving the perceptual effectiveness of late fusion; ii) CDQA increases AP@70 on OPV2V and DAIR-V2X by " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "1.80\\%" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "15.85\\%" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": ", respectively. This is because CDQA encodes 2D instances into 3D object queries, making the detection head less dependent on the initially learned object queries during training (i.e., gen" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 222, + 168, + 391, + 228 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 3: Comparison of different positional encoding strategies in the CDQA module on the OPV2V and DAIR-V2X datasets. None denotes not using positional encoding, Learned denotes the use of trainable positional encoding, and CE stands for employing the proposed cone encoding." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 222, + 168, + 391, + 228 + ], + "lines": [ + { + "bbox": [ + 222, + 168, + 391, + 228 + ], + "spans": [ + { + "bbox": [ + 222, + 168, + 391, + 228 + ], + "type": "table", + "html": "
StrategyOPV2VDAIR-V2X
AP@50AP@70AP@50AP@70
None0.84930.65320.19500.0610
Learned0.85320.65880.20250.0628
CE0.85560.66040.20580.0665
", + "image_path": "281593920bcd74a35f605e0f2ad6bf47434f8b3bc32d2e1f0429b45f192eed2c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 247, + 482, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 247, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 482, + 390 + ], + "type": "text", + "content": "erating object queries adaptively based on 2D instances that are more suitable for 3D detection of the instance). It effectively alleviates the problem of differences in spatial distribution between the test set and the training set, and we speculate that this module will bring more significant performance improvement when there is a greater spatial distribution difference; iii) MASK reduces communication overhead by 12.30 times on the OPV2V dataset and 12.82 times on the DAIR-V2X dataset, the detection performance only decreased by " + }, + { + "bbox": [ + 132, + 247, + 482, + 390 + ], + "type": "inline_equation", + "content": "4.60\\%" + }, + { + "bbox": [ + 132, + 247, + 482, + 390 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 247, + 482, + 390 + ], + "type": "inline_equation", + "content": "7.07\\%" + }, + { + "bbox": [ + 132, + 247, + 482, + 390 + ], + "type": "text", + "content": " on the respective datasets for the AP@70 metric. This is highly useful for bandwidth-constrained application scenarios. It is worth noting that our proposed IFTR can also be combined with other fusion methods (such as CoBEVT [41] and CoAlign [25]), and we encourage researchers to explore their combined usage, believing it will lead to more advanced detection performance." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 405, + 482, + 490 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 405, + 482, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 405, + 482, + 490 + ], + "type": "text", + "content": "Different positional encoding schemes in CDQA. Due to the crucial importance of positional encoding in transformer-based architectures, in this subsection, we compare cone encoding with other commonly used positional encoding methods. As can be seen from Tab. 3, the performance using cone encoding is superior to other methods. This is attributed to cone encoding providing a potential cone space prior for instances, which can alleviate the difficulty of the detection head in capturing targets." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 504, + 273, + 516 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 504, + 273, + 516 + ], + "spans": [ + { + "bbox": [ + 133, + 504, + 273, + 516 + ], + "type": "text", + "content": "4.4 Qualitative Evaluation" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 521, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 521, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 521, + 482, + 665 + ], + "type": "text", + "content": "Visualization of detection results. We conducted a qualitative analysis of the model's performance using typical samples from the OPV2V dataset, as illustrated in Fig. 5. The first column (a) shows the perception results of no collaboration, the second column (b) shows results with late fusion, and the third column (c) shows results using IFTR for collaborative perception. Overall, our approach generates more prediction bounding boxes that perfectly align with the ground truth. This improvement can be attributed to two main factors: i) the proposed IFA integrates meaningful information from nearby agents, significantly enhancing the quality of BEV features, and thereby improving detection performance; ii) the proposed CDQA provides effective spatial cues for objects in the scene, effectively compensating for the differences in target spatial distribution between the test set and the training set." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 172, + 121, + 260, + 209 + ], + "blocks": [ + { + "bbox": [ + 172, + 121, + 260, + 209 + ], + "lines": [ + { + "bbox": [ + 172, + 121, + 260, + 209 + ], + "spans": [ + { + "bbox": [ + 172, + 121, + 260, + 209 + ], + "type": "image", + "image_path": "83ce0d7cc6c4b8a00a99d169c51f12542f7ef7938fbc854021ceec5b66dc4fea.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 264, + 121, + 351, + 209 + ], + "blocks": [ + { + "bbox": [ + 264, + 121, + 351, + 209 + ], + "lines": [ + { + "bbox": [ + 264, + 121, + 351, + 209 + ], + "spans": [ + { + "bbox": [ + 264, + 121, + 351, + 209 + ], + "type": "image", + "image_path": "123974b7aeec11a1038823d818c9b39ae5155dbf0f1a7efff3651269968dd4c2.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 354, + 121, + 441, + 209 + ], + "blocks": [ + { + "bbox": [ + 354, + 121, + 441, + 209 + ], + "lines": [ + { + "bbox": [ + 354, + 121, + 441, + 209 + ], + "spans": [ + { + "bbox": [ + 354, + 121, + 441, + 209 + ], + "type": "image", + "image_path": "a240f4cd859598651338460a3da04a52e8e6a8113f29b38dd3872dcdd1907b7b.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 172, + 213, + 260, + 300 + ], + "blocks": [ + { + "bbox": [ + 172, + 213, + 260, + 300 + ], + "lines": [ + { + "bbox": [ + 172, + 213, + 260, + 300 + ], + "spans": [ + { + "bbox": [ + 172, + 213, + 260, + 300 + ], + "type": "image", + "image_path": "a61c28e93f3095aedb589d473a125b2d7713ca97d72fca9e73cbfd85209cf574.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 184, + 306, + 247, + 315 + ], + "lines": [ + { + "bbox": [ + 184, + 306, + 247, + 315 + ], + "spans": [ + { + "bbox": [ + 184, + 306, + 247, + 315 + ], + "type": "text", + "content": "(a) No Collaboration" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 264, + 213, + 351, + 300 + ], + "blocks": [ + { + "bbox": [ + 264, + 213, + 351, + 300 + ], + "lines": [ + { + "bbox": [ + 264, + 213, + 351, + 300 + ], + "spans": [ + { + "bbox": [ + 264, + 213, + 351, + 300 + ], + "type": "image", + "image_path": "c658854fb0ed171094908d76c923e1cc60e0f538ce2bc9a5bc5511f8512199c5.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 283, + 306, + 330, + 315 + ], + "lines": [ + { + "bbox": [ + 283, + 306, + 330, + 315 + ], + "spans": [ + { + "bbox": [ + 283, + 306, + 330, + 315 + ], + "type": "text", + "content": "(b) Late Fusion" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 354, + 213, + 441, + 300 + ], + "blocks": [ + { + "bbox": [ + 354, + 213, + 441, + 300 + ], + "lines": [ + { + "bbox": [ + 354, + 213, + 441, + 300 + ], + "spans": [ + { + "bbox": [ + 354, + 213, + 441, + 300 + ], + "type": "image", + "image_path": "43cd472602488f548c2ad3f0c790cd0f76d78f6bb1ed6c89d1caef8fa7d53224.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 384, + 306, + 411, + 315 + ], + "lines": [ + { + "bbox": [ + 384, + 306, + 411, + 315 + ], + "spans": [ + { + "bbox": [ + 384, + 306, + 411, + 315 + ], + "type": "text", + "content": "(c) IFTR" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 331, + 481, + 365 + ], + "lines": [ + { + "bbox": [ + 131, + 331, + 481, + 365 + ], + "spans": [ + { + "bbox": [ + 131, + 331, + 481, + 365 + ], + "type": "text", + "content": "Fig. 5: Visualization of predictions from (a) No Collaboration, (b) Late Fusion and (c) IFTR on the OPV2V test set. Green and red 3D bounding boxes represent the ground truth and prediction respectively." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 388, + 219, + 401 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 388, + 219, + 401 + ], + "spans": [ + { + "bbox": [ + 132, + 388, + 219, + 401 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 415, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 482, + 559 + ], + "type": "text", + "content": "IFTR is an instance-level feature fusion framework based on transformer that aims to enhance the detection performance of camera-only collaborative perception systems through the communication and sharing of visual features. It comprises three key components: message selection and feature map reconstruction, instance feature aggregation, and cross-domain query adaptation. The message selection and feature map reconstruction module optimize communication efficiency by transmitting instance-level features. Instance feature aggregation interacts with the visual features of individual agents using predefined grid-shaped BEV queries, generating more comprehensive and accurate BEV features. The cross-domain query adaptation implicitly encodes candidate positions of targets, heuristically integrating 2D priors. Extensive experiments on several multi-agent datasets show the effectiveness of IFTR and the necessity of all its components." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 578, + 246, + 593 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 246, + 593 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 246, + 593 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "The work was supported by the Key Research & Development Plan of Zhejiang Province under Grant 2021C01196, in part by the Zhejiang Provincial Natural Science Foundation of China under Grant LR23F010006, in part by the Open Research Project Programme funded by the Science and Technology Development Fund (SKL-IOTSC(UM)-2024-2026) and the State Key Laboratory of Internet" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 115, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 115, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 115, + 479, + 140 + ], + "type": "text", + "content": "of Things for Smart City (University of Macau) (Ref. No.: SKL-IoTSC(UM)-2024-2026/ORP/GA01/2023)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 158, + 197, + 171 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 158, + 197, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 158, + 197, + 171 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 183, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 183, + 479, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 183, + 479, + 216 + ], + "spans": [ + { + "bbox": [ + 138, + 183, + 479, + 216 + ], + "type": "text", + "content": "1. Betz, J., Zheng, H., Liniger, A., Rosolia, U., Karle, P., Behl, M., Krovi, V., Mangharam, R.: Autonomous vehicles on the edge: A survey on autonomous vehicle racing. IEEE Open Journal of Intelligent Transportation Systems 3, 458-488 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 217, + 480, + 249 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 480, + 249 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 480, + 249 + ], + "type": "text", + "content": "2. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 250, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 250, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 250, + 480, + 293 + ], + "type": "text", + "content": "3. Chen, Q., Ma, X., Tang, S., Guo, J., Yang, Q., Fu, S.: F-cooper: Feature based cooperative perception for autonomous vehicle edge computing system using 3d point clouds. In: Proceedings of the 4th ACM/IEEE Symposium on Edge Computing. pp. 88-100 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 293, + 480, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 293, + 480, + 336 + ], + "spans": [ + { + "bbox": [ + 138, + 293, + 480, + 336 + ], + "type": "text", + "content": "4. Chen, Z., Shi, Y., Jia, J.: Transiff: An instance-level feature fusion framework for vehicle-infrastructure cooperative 3d detection with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18205-18214 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 337, + 480, + 370 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 480, + 370 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 480, + 370 + ], + "type": "text", + "content": "5. Deng, J., Shi, S., Li, P., Zhou, W., Zhang, Y., Li, H.: Voxel r-cnn: Towards high performance voxel-based 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 1201-1209 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "type": "text", + "content": "6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: Carla: An open urban driving simulator. In: Conference on robot learning. pp. 1-16. PMLR (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "text", + "content": "7. Goodfellow, I., Warde-Farley, D., Mirza, M., Courville, A., Bengio, Y.: Maxout networks. In: International conference on machine learning. pp. 1319-1327. PMLR (2013)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 425, + 480, + 457 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 425, + 480, + 457 + ], + "spans": [ + { + "bbox": [ + 138, + 425, + 480, + 457 + ], + "type": "text", + "content": "8. Guo, Y., Ma, J., Leslie, E., Huang, Z.: Evaluating the effectiveness of integrated connected automated vehicle applications applied to freeway managed lanes. IEEE Transactions on Intelligent Transportation Systems 23(1), 522-536 (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 458, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 458, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 138, + 458, + 480, + 490 + ], + "type": "text", + "content": "9. Hu, Y., Fang, S., Lei, Z., Zhong, Y., Chen, S.: Where2comm: Communication-efficient collaborative perception via spatial confidence maps. Advances in neural information processing systems 35, 4874-4886 (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 491, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 480, + 512 + ], + "type": "text", + "content": "10. Hu, Y., Fang, S., Xie, W., Chen, S.: Aerial monocular 3d object detection. IEEE Robotics and Automation Letters 8(4), 1959-1966 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 513, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 513, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 513, + 480, + 533 + ], + "type": "text", + "content": "1. Huang, J., Huang, G.: Bevdet4d: Exploit temporal cues in multi-camera 3d object detection. arXiv preprint arXiv:2203.17054 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 534, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 534, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 534, + 480, + 567 + ], + "type": "text", + "content": "2. Huang, J., Huang, G., Zhu, Z., Ye, Y., Du, D.: Bevdet: High-performance multicamera 3d object detection in bird-eye-view. arXiv preprint arXiv:2112.11790 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 567, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 480, + 600 + ], + "type": "text", + "content": "3. Lang, A.H., Vora, S., Caesar, H., Zhou, L., Yang, J., Beijbom, O.: Pointpillars: Fast encoders for object detection from point clouds. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12697-12705 (2019)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "text", + "content": "4. Li, J., Li, R., Li, J., Wang, J., Wu, Q., Liu, X.: Dual-view 3d object recognition and detection via lidar point cloud and camera image. Robotics and Autonomous Systems 150, 103999 (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "text", + "content": "5. Li, Y., Ren, S., Wu, P., Chen, S., Feng, C., Zhang, W.: Learning distilled collaboration graph for multi-agent perception. Advances in Neural Information Processing Systems 34, 29541-29552 (2021)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "16. Li, Y., Ge, Z., Yu, G., Yang, J., Wang, Z., Shi, Y., Sun, J., Li, Z.: Bevdepth: Acquisition of reliable depth for multi-view 3d object detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 1477-1485 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "text", + "content": "17. Li, Z., Wang, W., Li, H., Xie, E., Sima, C., Lu, T., Qiao, Y., Dai, J.: Bevformer: Learning bird's-eye-view representation from multi-camera images via spatiotemporal transformers. In: European conference on computer vision. pp. 1-18. Springer (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "18. Lin, T.Y., Goyal, P., Girshick, R., He, K., Dollar, P.: Focal loss for dense object detection. In: Proceedings of the IEEE international conference on computer vision. pp. 2980-2988 (2017)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "text", + "content": "19. Liu, H., Teng, Y., Lu, T., Wang, H., Wang, L.: Sparsebev: High-performance sparse 3d object detection from multi-camera videos. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18580-18590 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 260, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 260, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 260, + 481, + 293 + ], + "type": "text", + "content": "20. Liu, Y.C., Tian, J., Glaser, N., Kira, Z.: When2com: Multi-agent perception via communication graph grouping. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 4106-4115 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "text", + "content": "21. Liu, Y., Wang, T., Zhang, X., Sun, J.: Petr: Position embedding transformation for multi-view 3d object detection. In: European Conference on Computer Vision. pp. 531-548. Springer (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "type": "text", + "content": "22. Liu, Y., Yan, J., Jia, F., Li, S., Gao, A., Wang, T., Zhang, X.: Petrov2: A unified framework for 3d perception from multi-camera images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3262-3272 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "text", + "content": "23. Liu, Z., Wu, Z., Toth, R.: Smoke: Single-stage monocular 3d object detection via keypoint estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 996-997 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "text", + "content": "24. Lu, Y., Hu, Y., Zhong, Y., Wang, D., Chen, S., Wang, Y.: An extensible framework for open heterogeneous collaborative perception. arXiv preprint arXiv:2401.13964 (2024)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "text", + "content": "25. Lu, Y., Li, Q., Liu, B., Dianati, M., Feng, C., Chen, S., Wang, Y.: Robust collaborative 3d object detection in presence of pose errors. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 4812-4818. IEEE (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 457, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 501 + ], + "type": "text", + "content": "26. Philion, J., Fidler, S.: Lift, splat, shoot: Encoding images from arbitrary camera rigs by implicitly unprojecting to 3d. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV 16. pp. 194-210. Springer (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 502, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 502, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 502, + 481, + 533 + ], + "type": "text", + "content": "27. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 652-660 (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 534, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 567 + ], + "type": "text", + "content": "28. Raboy, K., Ma, J., Leslie, E., Zhou, F.: A proof-of-concept field experiment on cooperative lane change maneuvers using a prototype connected automated vehicle testing platform. Journal of Intelligent Transportation Systems 25(1), 77-92 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "text", + "content": "29. Reading, C., Harakeh, A., Chae, J., Waslander, S.L.: Categorical depth distribution network for monocular 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8555-8564 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 601, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 621 + ], + "type": "text", + "content": "30. Roddick, T., Kendall, A., Cipolla, R.: Orthographic feature transform for monoc- ular 3d object detection. arXiv preprint arXiv:1811.08188 (2018)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "text", + "content": "31. Rukhovich, D., Vorontsova, A., Konushin, A.: Imvoxelnet: Image to voxels projection for monocular and multi-view general-purpose 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2397-2406 (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "text", + "content": "32. Shladover, S.E.: Opportunities and challenges in cooperative road vehicle automation. IEEE Open Journal of Intelligent Transportation Systems 2, 216-224 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 171 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 171 + ], + "type": "text", + "content": "33. Tan, M., Le, Q.: Efficientnet: Rethinking model scaling for convolutional neural networks. In: International conference on machine learning. pp. 6105-6114. PMLR (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 194 + ], + "type": "text", + "content": "34. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "35. Wang, T., Zhu, X., Pang, J., Lin, D.: Fcos3d: Fully convolutional one-stage monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 913-922 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 227, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 270 + ], + "type": "text", + "content": "36. Wang, T.H., Manivasagam, S., Liang, M., Yang, B., Zeng, W., Urtasun, R.: V2vnet: Vehicle-to-vehicle communication for joint perception and prediction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part II 16. pp. 605–621. Springer (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 271, + 481, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 481, + 314 + ], + "type": "text", + "content": "37. Wang, Y., Chao, W.L., Garg, D., Hariharan, B., Campbell, M., Weinberger, K.Q.: Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8445-8453 (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "type": "text", + "content": "38. Wang, Y., Guizilini, V.C., Zhang, T., Wang, Y., Zhao, H., Solomon, J.: Detr3d: 3d object detection from multi-view images via 3d-to-2d queries. In: Conference on Robot Learning. pp. 180-191. PMLR (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "text", + "content": "39. Xiang, H., Xu, R., Ma, J.: Hm-vit: Hetero-modal vehicle-to-vehicle cooperative perception with vision transformer. arXiv preprint arXiv:2304.10628 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 413 + ], + "type": "text", + "content": "40. Xu, R., Guo, Y., Han, X., Xia, X., Xiang, H., Ma, J.: Opencda: an open cooperative driving automation framework integrated with co-simulation. In: 2021 IEEE International Intelligent Transportation Systems Conference (ITSC). pp. 1155-1162. IEEE (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 414, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 414, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 481, + 445 + ], + "type": "text", + "content": "41. Xu, R., Tu, Z., Xiang, H., Shao, W., Zhou, B., Ma, J.: Cobevt: Cooperative bird's eye view semantic segmentation with sparse transformers. arXiv preprint arXiv:2207.02202 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "type": "text", + "content": "42. Xu, R., Xiang, H., Tu, Z., Xia, X., Yang, M.H., Ma, J.: V2x-vit: Vehicle-to-everything cooperative perception with vision transformer. In: European conference on computer vision. pp. 107-124. Springer (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 522 + ], + "type": "text", + "content": "43. Xu, R., Xiang, H., Xia, X., Han, X., Li, J., Ma, J.: Opv2v: An open benchmark dataset and fusion pipeline for perception with vehicle-to-vehicle communication. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 2583-2589. IEEE (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 523, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 523, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 523, + 481, + 544 + ], + "type": "text", + "content": "44. Yan, Y., Mao, Y., Li, B.: Second: Sparsely embedded convolutional detection. Sensors 18(10), 3337 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 545, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 481, + 588 + ], + "type": "text", + "content": "45. Yang, C., Chen, Y., Tian, H., Tao, C., Zhu, X., Zhang, Z., Huang, G., Li, H., Qiao, Y., Lu, L., et al.: Bevformer v2: Adapting modern image backbones to bird's-eye-view recognition via perspective supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17830-17839 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "type": "text", + "content": "46. Yin, T., Zhou, X., Krahenbuhl, P.: Center-based 3d object detection and tracking. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11784-11793 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "text", + "content": "47. Yu, H., Luo, Y., Shu, M., Huo, Y., Yang, Z., Shi, Y., Guo, Z., Li, H., Hu, X., Yuan, J., et al.: Dair-v2x: A large-scale dataset for vehicle-infrastructure cooperative 3d object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21361-21370 (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 263, + 91, + 447, + 101 + ], + "type": "text", + "content": "IFTR: An Instance-Level Fusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 249 + ], + "type": "list", + "angle": 0, + "index": 6, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "48. Zhang, R., Qiu, H., Wang, T., Guo, Z., Cui, Z., Qiao, Y., Li, H., Gao, P.: Monodetr: Depth-guided transformer for monocular 3d object detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9155-9166 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 182 + ], + "type": "text", + "content": "49. Zhou, B., Krahenbihl, P.: Cross-view transformers for real-time map-view semantic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13760-13769 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "type": "text", + "content": "50. Zhou, Y., Tuzel, O.: Voxelnet: End-to-end learning for point cloud based 3d object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4490-4499 (2018)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 249 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 249 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 249 + ], + "type": "text", + "content": "51. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020)" + } + ] + } + ], + "index": 5 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "S. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_content_list.json b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..de7585c175b50046be684d0a60d824c19ada4633 --- /dev/null +++ b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_content_list.json @@ -0,0 +1,1722 @@ +[ + { + "type": "text", + "text": "IG Captioner: Information Gain Captioners are Strong Zero-shot Classifiers", + "text_level": 1, + "bbox": [ + 251, + 140, + 751, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Chenglin Yang $^{1}$ , Siyuan Qiao $^{2}$ , Yuan Cao $^{2}$ , Yu Zhang $^{2}$ , Tao Zhu $^{2}$ , Alan Yuille $^{1}$ , and Jiahui Yu $^{2}$", + "bbox": [ + 300, + 210, + 700, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Johns Hopkins University 2 Google DeepMind", + "bbox": [ + 406, + 253, + 596, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "DOG = \"A photo of a west highland white terrier\" \nHORSE = \"A photo of a common sorrel horse\"", + "bbox": [ + 220, + 306, + 395, + 328 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Language Model Output", + "bbox": [ + 243, + 345, + 352, + 356 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$\\log P(\\mathrm{DOG}) = -3.3$ $\\log P(\\mathrm{HORSE}) = -4.$", + "bbox": [ + 256, + 364, + 328, + 385 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "(a) Linguistic prior", + "bbox": [ + 254, + 426, + 336, + 436 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/be7d9c5a7d0461075970e412a91daef8647b99be06512df5345b56b179aaa8e8.jpg", + "image_caption": [ + "Fig. 1: The prediction of a captioner-based classifier is influenced by the linguistic priors in pure text modality. The Information Gain (IG) evaluation reduces such impact and makes the predictions more grounded on the visual inputs. We illustrate with real predictions on zero-shot ImageNet [9] classification in this figure. (a) The language model was trained on Laion-5B [43] captions only. (b) The captioner was trained on the Laion-5B dataset with both the images and captions. The IG evaluation in (b) uses the outputs of both the captioner and the language model in (a)." + ], + "image_footnote": [], + "bbox": [ + 418, + 304, + 787, + 438 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Generative training has been demonstrated to be powerful for building visual-language models. However, on zero-shot discriminative benchmarks, there is still a performance gap between models trained with generative and discriminative objectives. In this paper, we aim to narrow this gap by improving the efficacy of generative training on classification tasks, without any finetuning processes or additional modules. Specifically, we focus on narrowing the gap between the generative captioner and the CLIP classifier. We begin by analysing the predictions made by the captioner and classifier and observe that the caption generation inherits the distribution bias from the language model trained with pure text modality, making it less grounded on the visual signal. To tackle this problem, we redesign the scoring objective for the captioner to alleviate the distributional bias and focus on measuring the gain of information brought by the visual inputs. We further design a generative training objective to match the evaluation objective. We name our model trained and evaluated from the novel procedures as Information Gain (IG) captioner. We pretrain the models on the public Laion-5B dataset and perform a series of discriminative evaluations. For the zero-shot classification on ImageNet, IG captioner achieves $>18\\%$", + "bbox": [ + 259, + 575, + 740, + 840 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "improvements over the standard captioner, achieving comparable performances with the CLIP classifier. IG captioner also demonstrated strong performance on zero-shot image-text retrieval tasks on MSCOCO and Flickr30K. We hope this paper inspires further research towards unifying generative and discriminative training procedures for visual-language models.", + "bbox": [ + 259, + 147, + 743, + 229 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 258, + 375, + 275 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Generative training has been shown to be highly effective for both the language [4] and vision models [16, 44]. These generative models demonstrate remarkable zero-shot generation capabilities and have led to the developments of many impressive AI applications [31, 40]. On the other hand, discriminative training is still an effective procedure for building the large vision-language models like CLIP [36] and CoCa [49]. Models trained with discriminative objectives naturally performs strongly on discriminative tasks like classification.", + "bbox": [ + 212, + 294, + 785, + 400 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The inconsistent setups between generative and discriminative training raises an intriguing topic, which we aim to address in this paper: Can generative training procedure also perform well on zero-shot discriminative tasks? Concretely, we study the performance gap between generative captioners and discriminative models on zero-shot classification tasks, and propose novel approaches to narrow the gap.", + "bbox": [ + 212, + 401, + 785, + 491 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To obtain an effective zero-shot generative classifier, we start with evaluating a standard generative captioner with the Maximum Likelihood Estimation (MLE) objective on classification tasks. Specifically, we pretrain a captioner on the public Laion-5B [43] dataset and evaluate it on the ImageNet [9]. We also pretrain a CLIP classifier with the same experimental setting. We observe a large performance gap between the captioner and the CLIP classifier. We find that the predictions of the captioner are less grounded on the visual inputs. Instead, they are biased by the linguistic priors, which is illustrated in Fig. 1. These observations indicate that we should discount the influence by predictions from pure text modality in multimodal generative classification setup.", + "bbox": [ + 212, + 491, + 785, + 643 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To deal with this problem, we propose an Information Gain (IG) evaluation objective, as depicted in Fig. 2. This objective demonstrates a significant performance boost on top of a captioner trained with conventional procedure. Furthermore, we propose a generative training objective to match the IG evaluation. We name the captioner, trained and evaluated with our proposed objectives, as Information Gain (IG) captioner. We pretrain the models on the Laion-5B dataset and evaluate multiple zero-shot discriminative tasks. All the models have the same training and evaluation settings to ensure the fair comparisons. For zero-shot ImageNet classification, IG captioner with ViT-B/ViT-L [10] image encoder shows $19.7\\% / 18.1\\%$ improvements on top-1 accuracy over the standard captioner. It is even better than the CLIP classifier by $0.5\\% / 1.6\\%$ top-1 accuracy. For zero-shot image-text retrieval on MSCOCO [5] dataset, IG captioner demonstrates $>22\\%$ accuracy improvements on all of image-to-text R@1, R@5", + "bbox": [ + 212, + 643, + 785, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/b6806dd5d58c4919e0aac9f56c0414a855deb161150960533dfbf0fc68fce31f.jpg", + "image_caption": [ + "Fig. 2: The inference pipeline of IG captioner. $I$ and $T$ represent the input image and caption. IG captioner consists of a image encoder and a text decoder. The text decoder is able to provide both the multimodal and unimodal predictions. The unimodal predictions can be cached for different input images. Both the image and object classes are from the ImageNet dataset." + ], + "image_footnote": [], + "bbox": [ + 222, + 145, + 478, + 391 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/45d7b69921891430d017b79fdcacb9763f31b55994697f9d27524fc96216701a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 552, + 220, + 777, + 305 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "and R@10 over the captioner, significantly reducing the gap from the captioner to the CLIP classifier. Interestingly, we observe the superior performances on text-to-image recalls of both the captioner and IG captioner over the CLIP classifier. The superiority of IG captioner is also demonstrated on Flickr30K [34] dataset.", + "bbox": [ + 212, + 511, + 787, + 585 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our main contributions can be summarized in the following:", + "bbox": [ + 238, + 588, + 676, + 604 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We convert a generative captioner into a zero-shot classifier. We identify the root cause of its poor performance and observe that its predictions are negatively influenced by the linguistic priors and less grounded on the visual inputs.", + "- We propose the Information Gain (IG) method to evaluate a generative classifier. We demonstrate that the IG evaluation is able to significantly improve its performance without any changes in the training process.", + "- To couple with the IG evaluation, we propose a generative training objective to further boost the performance of the generative classifier which we name Information Gain (IG) captioner.", + "- We show that IG captioner is a strong zero-shot classifier, evidenced by the significant improvements over the captioner and comparable performance with the CLIP classifier on the zero-shot ImageNet classification, MSCOCO and Flickr30K image-text retrieval tasks." + ], + "bbox": [ + 223, + 622, + 784, + 835 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 542, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 143, + 388, + 160 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Text-to-image Generative Classifiers. The classic approach [15,38] of using generative models to perform recognition tasks is the Bayes algorithm [29]. During training, this algorithm models the data distribution while during inference, it provides predictions by solving a maximum likelihood estimation (MLE) problem. Recently, there have been the methods [7,19] proposed to convert the text-to-image diffusion models, Stable Diffusion [40] or Imagen [41], into a zero-shot classifier using the Bayes algorithm.", + "bbox": [ + 212, + 175, + 787, + 281 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The focus of IG captioner is different with these previous arts. First, we explore the possibility of achieving a good classifier solely through the generative training, instead of how to convert a generative model into a classifier. The Stable Diffusion used by the above diffusion model classifiers [7, 19] is not suitable for our goal because it uses the CLIP text encoder pretrained with contrastive loss to provide the text guidance. Second, we identify the negative impact of the text priors inherited from the pretraining data and propose methods to reduce this impact for zero-shot classification tasks. Besides, IG captioner is an image-to-text generative captioner. We also perform the comparisons in Tab. 8.", + "bbox": [ + 212, + 281, + 787, + 416 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Classifier-Free Guidance (CFG). CFG [17] is an important approach to improving the sample quality of text-to-image generative models [11,30,37,42, 50]. During training, CFG requires the model to generate images both with and without text conditions. During inference, the output image is sampled according to a linear combination of both the conditional and unconditional predictions to improve text-image alignment, which relates CFG to IG captioner from a high level. In contrast, IG captioner is an image-to-text captioner that uses the probability gain from unconditionally to conditionally generating captions with the aim of reducing the bias from text priors for zero-shot classification tasks.", + "bbox": [ + 212, + 417, + 787, + 551 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Contrast in Text Generation. In the field of text generation, researchers have been investigating the use of contrast, including avoiding the text degeneration and undesirable repetitions [45], generating pan sentences [14], and language detoxification [25]. Contrastive decoding [24] uses the log-likelihood difference between a large expert and a small amateur model to improve the quality of the open-ended text generation. Li et al. [21] propose to use the mutual information between an input message and its responses as the decoding objective to avoid the generic and meaningless conversations. Differently, in this paper, IG captioner uses the Information Gain (IG) to address the problem of evaluating a vision-language generative model as a zero-shot classifier. Importantly, the IG evaluation is used to mitigate the negative influence of linguistic priors inherited from the pretraining dataset.", + "bbox": [ + 212, + 553, + 787, + 734 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Image-to-text Multimodal Language Models. Multimodal language models have become the dominant approaches for image captioning, including OFA [48], Flamingo [2], BLIP [22, 23], CoCa [49], LLaVA [26, 28], MiniGPT-4 [51], InstructBLIP [8], Kosmos [18, 33], Qwen-VL [3], VFC [12], LLaVA-NeXT [20, 27], Gemini [39, 46], and GPT-4 [1]. Differently, IG captioner demonstrates the potential of pure generative training on discriminative tasks using public datasets.", + "bbox": [ + 212, + 734, + 799, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 230, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 143, + 330, + 160 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we introduce Information Gain (IG) captioner. First, we illustrate how to evaluate a conventional captioner on the zero-shot classification task and diagnose its problem. Second, we propose an evaluation approach using the information gain to tackle the problem. Third, we design a training objective to couple with the IG evaluation. Combining the above evaluation and training procedures, we propose IG captioner.", + "bbox": [ + 212, + 174, + 787, + 267 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Evaluating Captioners on Discriminative Tasks", + "text_level": 1, + "bbox": [ + 214, + 286, + 648, + 303 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A captioner is a generative model that generates caption for a given image. It is by nature not trained as a classifier and its output can not be used directly for such tasks like image classification or image-text retrieval. Therefore, to evaluate a captioner on discriminative tasks, we need to adapt the evaluation procedure.", + "bbox": [ + 212, + 310, + 785, + 371 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Maximum Likelihood Estimation (MLE) Objective. Let $I \\in \\mathbb{R}^{H \\times W \\times 3}$ , $T \\in \\mathbb{R}^{N \\times D}$ and $t \\in \\mathbb{R}^D$ be the image, caption and the word in the caption, where $H$ , $W$ are the height and width of the image and $N$ , $D$ are the number of text tokens and the token dimension. A captioner is a function $F_{\\theta}: I \\to T$ where $\\theta$ is the model parameter.", + "bbox": [ + 214, + 390, + 787, + 465 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Discriminative tasks require the model to pick the most appropriate text from a set of candidates $C = \\{T_i\\}$ to describe an image, where $i$ is the index of captions. During inference, the standard MLE evaluation objective is:", + "bbox": [ + 212, + 467, + 787, + 513 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\underset {i} {\\arg \\max } [ \\log P (T _ {i} | I) ] \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 426, + 523, + 785, + 546 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We omit the normalization factor $1 / N_{i}$ when calculating the evaluation objectives throughout this paper for simplicity. $N_{i}$ is the token length of the $t^{\\mathrm{th}}$ caption.", + "bbox": [ + 214, + 556, + 785, + 602 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Low Performance Using MLE Objective. To study the effectiveness of MLE as objective, we pretrain a captioner on Laion-5B and use it to perform zero-shot ImageNet classification. We set up a strong baseline: a CLIP classifier which is pretrained with contrastive loss and tailored for classification tasks. The captioner has a image encoder and a text decoder while the CLIP classifier has a image encoder and a text encoder. Both of them have the same model size, training and evaluation settings to ensure fair comparisons. The results are shown in Tab. 1. When directly using the MLE objective (Eqn. (1)) the captioner shows $>19\\%$ top-1 accuracy degradation compared with the CLIP classifier.", + "bbox": [ + 212, + 622, + 787, + 758 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Result Analysis of MLE Evaluation. Since the captioner is a vision-language model, we are interested in understanding how much visual information is provided by the visual inputs and utilized by the model. We pretrain a language model that has the same architecture as the text decoder of the captioner.", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 540, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/b6c5ee9efab5d175611fe172abe0e668714b0f44b466daf860a15ef2b3f10a8f.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
modelspretrain losszero-shot IN acc. (%)
CLIP classifiercontrast63.8
captionergenerate44.6
", + "bbox": [ + 331, + 143, + 671, + 200 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/33a0f99c2c0957adc03595a2242679f10483484f59c54ce8f4dba513ab8ed19e.jpg", + "table_caption": [ + "Table 1: The large performance gap between the standard captioner and the CLIP classifier on zero-shot ImageNet classification. All the models are trained with the Laion-5B dataset. The CLIP classifier is trained with contrastive loss while the captioner with generative loss. The CLIP classifier has a 12-layer image encoder and a 12-layer text encoder and the captioner has a 12-layer image encoder and a 12-layer text decoder." + ], + "table_footnote": [], + "table_body": "
variable 1variable 2rvar1, var2
log P(T)log P(T|I)0.77
log P(T)log P(T|I) - log P(T)-0.39
", + "bbox": [ + 359, + 310, + 643, + 367 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Table 2: Mean Pearson Correlation Coefficient (PCC) measurements of zero-shot predictions on ImageNet. $\\log P(T)$ is predicted by the unimodal language model which is trained with the Laion-5B captions. $\\log P(T|I)$ is predicted by the standard captioner trained with both the Laion-5B images and captions. Given one image, there are 80K (1K classes, 80 prompts) observations of these two variables to compute the PCC. The mean PCC is obtained by averaging the PCC on 50K ImageNet validation images.", + "bbox": [ + 212, + 367, + 787, + 450 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "It models the captions in the Laion-5B dataset and is able to predict $\\log P(T)$ . There are 1K classes on ImageNet and for each class we use the 80 prompts proposed by CLIP. In total, there are 80K unique captions. Given an image $I$ , we consider $\\log P(T|I)$ and $\\log P(T)$ as two variables and compute their Pearson correlation coefficient (PCC) [13, 32] with 80K observations in Tab. 2. We observe a strong correlation between $\\log P(T|I)$ and $\\log P(T)$ , which indicates that the captioner is strongly biased by the text priors and tends to ignore the visual information. The correlation is also visualized in Fig. 3.", + "bbox": [ + 212, + 493, + 787, + 614 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Evaluating Captioners with the Information Gain (IG)", + "text_level": 1, + "bbox": [ + 214, + 638, + 712, + 655 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To alleviate the problem of strong correlation between caption likelihood conditioned on the image and caption priors, we tun to the following evaluation objective:", + "bbox": [ + 212, + 665, + 785, + 709 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\underset {i} {\\arg \\max } \\left[ \\log \\frac {P \\left(T _ {i} \\mid I\\right)}{P \\left(T _ {i}\\right)} \\right] \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 710, + 785, + 743 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Intuitively, this log-ratio measures the likelihood gain of the text $T_{i}$ given the image $I$ . It is called pointwise mutual information [6]. The expectation of it over all the texts $T$ is the information gain [35]. In this paper, we refer to pointwise mutual information as information gain.", + "bbox": [ + 212, + 750, + 787, + 808 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We measure the correlation of $\\log P(T_i)$ and $[\\log P(T_i|I) - \\log P(T_i)]$ in Tab. 2. It shows that the correlation is significantly reduced. Using this objective, we", + "bbox": [ + 212, + 809, + 790, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/897e100f50c7016be85f2696aa0ef15feb7226e21d2dc5d07d1d2fe94599fd7a.jpg", + "image_caption": [ + "Fig. 3: See correlations between the green line $(- \\log P(T|I))$ and the orange line $(- \\log P(T))$ on zero-shot ImageNet classification. $\\log P(T|I)$ is predicted by a multimodal captioner trained on the Laion-5B dataset. $\\log P(T)$ is predicted by an unimodal language model trained on the Laion-5B captions only. 100 ImageNet classes are randomly sampled due to the limited space. The numerical correlation measurements between $\\log P(T|I)$ and $\\log P(T)$ for the whole 1000 classes are shown in Tab. 2." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 785, + 296 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "observe the performance gain in our ablation studies in Sec. 5.1. However, we notice that this quantity is negatively correlated with the caption priors, which is expected due to the existence of term $-\\log P(T_i)$ in Eqn. (2).", + "bbox": [ + 212, + 426, + 782, + 470 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To deal with this negative correlation problem, we further propose the following evaluation objective:", + "bbox": [ + 212, + 470, + 782, + 502 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\underset {i} {\\arg \\max } [ \\log P (T _ {i} | I) - \\alpha \\log P (T _ {i}) ] \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 375, + 513, + 785, + 537 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\alpha \\in [0,1]$ adjusts the degree of the text prior removal. Our thorough ablation study on $\\alpha$ can be found in Sec. 5.1.", + "bbox": [ + 212, + 547, + 782, + 580 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Training Information Gain Captioners", + "text_level": 1, + "bbox": [ + 214, + 602, + 576, + 618 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Without any changes on the training process, we observe the performance improvement of the captioner on the zero-shot classification task when using IG evaluation, which is shown in Sec. 5.3. But in order to keep the training and evaluation consistent, we propose a two-objective approach to train the captioner, which is illustrated in Fig. 4.", + "bbox": [ + 212, + 627, + 782, + 702 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The first objective is the standard generative loss. Given an image, it supervises the captioner to predict the words of its caption in an autoregressive way:", + "bbox": [ + 212, + 702, + 782, + 733 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nl _ {\\text {m u l t i m o d a l}} = \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\frac {1}{N ^ {i}} \\sum_ {n = 1} ^ {N ^ {i}} \\log \\frac {1}{P \\left(t _ {t} ^ {i} \\mid t _ {1 : n - 1} ^ {i} , I ^ {i}\\right)} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 334, + 744, + 785, + 787 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $i$ is the index of a image-text pair $(I^i, T^i)$ in one batch of size $B$ . $N^i$ is the text token length. Since this objective models the probability of a caption conditioned on an image, we call this objective the multimodal loss.", + "bbox": [ + 212, + 794, + 785, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 542, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/6e58cb3c095cf7b31b87674c0acef5cc0b8131b0204a13a4af364c10c53d6b72.jpg", + "image_caption": [ + "Fig. 4: The training pipeline of IG captioner. IG captioner has two modes. Without any given images, IG captioner is an unimodal language model. When given an input image, IG captioner becomes the multimodal captioner that models the conditional probability of its caption. The image and caption are from the Laion-5B dataset." + ], + "image_footnote": [], + "bbox": [ + 228, + 146, + 767, + 282 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The second objective makes the captioner an autoregressive language model that is able to generate captions without given any image:", + "bbox": [ + 214, + 392, + 784, + 422 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nl _ {\\text {u n i m o d a l}} = \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\frac {1}{N ^ {i}} \\sum_ {n = 1} ^ {N ^ {i}} \\log \\frac {1}{P \\left(t _ {n} ^ {i} \\mid t _ {1 : n - 1} ^ {i}\\right)} \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 349, + 431, + 784, + 472 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We call this objective the unimodal loss.", + "bbox": [ + 215, + 479, + 509, + 493 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Finally, we combine the above two losses in the following:", + "bbox": [ + 238, + 494, + 653, + 508 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nL = \\beta l _ {\\text {m u l t i m o d a l}} + \\gamma l _ {\\text {u n i m o d a l}} \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 397, + 518, + 784, + 534 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\beta$ and $\\gamma$ are the weights for each loss. We perform an ablation study on the loss weights in Sec. 5.5. We name the captioner which is trained and evaluated with our proposed objectives IG captioner.", + "bbox": [ + 214, + 542, + 784, + 587 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 608, + 375, + 625 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Zero-shot ImageNet classification", + "text_level": 1, + "bbox": [ + 215, + 636, + 535, + 651 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Settings. We use the English subset of the public Laion-5B [43] dataset as the pretraining dataset for all experiments. After pretraining, we perform zero-shot image classification on the ImageNet [9] validation dataset. There are 1000 classes in this validation set and each class has 50 images. We build the captioner and IG captioner with an image encoder and a text decoder, and build the CLIP [36] classifier with an image encoder and a text encoder. All the models consist of standard transformer blocks [47]. We set the layer number of image encoder and text decoder / text encoder the same. We use a batch size 4096 for all the experiments. During evaluation, we follow CLIP to use 80 prompts for each class. We use the voting mechanism to combine the predictions from different prompts for the captioner and IG captioner. All the training and evaluation procedures are the same to ensure fair comparisons.", + "bbox": [ + 214, + 657, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/68fc60f41a3885aad693fd939f54f4010206e5391ba921430f674676ae5082b0.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
modelencoderpretrain losstop-1 acc. (%)
CLIP classifierViT-Bcontrast63.8
captionerViT-Bgenerate44.6
IG captionerViT-Bgenerate64.3
CLIP classifierViT-Lcontrast68.2
captionerViT-Lgenerate51.7
IG captionerViT-Lgenerate69.8
", + "bbox": [ + 326, + 143, + 674, + 262 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Table 3: Zero-shot ImageNet classification. All the models are pretrained with the public Laion-5B dataset. The image encoder, text decoder in captioner and IG captioner, and text encoder in CLIP classifier have the same layer number, and they are all built with standard transformer blocks.", + "bbox": [ + 212, + 262, + 787, + 316 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Results. The results are summarized in Tab. 3. First, compared with standard captioners, IG captioner achieves $19.7\\%$ and $18.1\\%$ top-1 accuracy improvements when using ViT-B and ViT-L [10] as the image encoders. Second, compared with the strong discriminative baselines, CLIP classifiers, IG captioner achieves $0.5\\%$ / $1.6\\%$ top-1 accuracy improvements when using the image encoder ViT-B / ViT-L. These improvements demonstrate that IG captioner is a strong zero-shot classifier as a pure generative model. We measure the correlations of the evaluation objective and the caption prior in Sec. 5.1 to validate the effectiveness of the design of IG captioner. Besides, we perform the ablation studies in Sec. 5.3 to demonstrate the efficacy of the IG evaluation on the standard captioner.", + "bbox": [ + 212, + 359, + 787, + 512 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Zero-shot Image-text Retrieval on MSCOCO and Flickr30K", + "text_level": 1, + "bbox": [ + 214, + 532, + 756, + 549 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Settings. We use the same models in Sec. 4.1 pretrained on Laion-5B to perform zero-shot image-text retrieval on MSCOCO 5K and Flickr30K 1K test sets. There are 5 captions for each image. In order to measure the recalls, we compute a similarity matrix $\\mathbf{M}_{a\\times b}$ where $a$ and $b$ are the number of images and captions. For the CLIP classifier, $\\mathbf{M}_{i,j} = \\mathrm{E}_{I_i}\\cdot \\mathrm{E}_{T_j}$ , where $\\mathrm{E}_{T_j}$ and $\\mathrm{E}_{I_i}$ are the embeddings of the $i^{\\mathrm{th}}$ image and $j^{\\mathrm{th}}$ caption. For the captioner, we compute $\\mathbf{M}_{i,j} = \\log P(T_j|I_i)$ while for the IG captioner, we compute $\\mathbf{M}_{i,j} = \\log P(T_j|I_i) - \\log P(T_j)$ .", + "bbox": [ + 212, + 559, + 787, + 670 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Results on MSCOCO. We summarize the results on MSCOCO in Tab. 4. For the image $\\rightarrow$ text retrieval, IG captioner significantly boosts the performance of a generative captioner. IG captioner shows $22.7\\% / 25.5\\% / 22.8\\%$ improvements over the captioner on R@1 / R@5 and R@10 with the ViT-B image encoder, and shows $22.9\\% / 24.1\\% / 20.3\\%$ improvements with the ViT-L image encoder. Furthermore, IG captioner achieves comparable performances with the CLIP classifier. The performance gaps between the IG captioner and the CLIP classifier are $8.9\\% / 6.6\\% / 5.0\\%$ on R@1 / R@5 / R@10 with the ViT-B encoder. While with the ViT-L image encoder, the gaps are further decreased to $6.5\\% / 5.1\\% / 3.5\\%$ on R@1 / R@5 / R@10.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 540, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/dd1ddd847a23ffe8d7025520f0fff26c5804ea68526a74f2a129a9012460cd01.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
modelencoderpretrain lossMSCOCO (5K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast56.380.387.538.564.774.6
captionerViT-Bgenerate24.748.259.745.168.977.5
IG captionerViT-Bgenerate47.473.782.542.967.476.1
CLIP classifierViT-Lcontrast59.383.089.542.167.977.4
captionerViT-Lgenerate29.953.865.749.272.880.8
IG captionerViT-Lgenerate52.877.986.048.571.680.2
", + "bbox": [ + 254, + 143, + 748, + 295 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/ea9ca0292f07141d5a50b5b137748dc67940b8235c31b2bef81f990be1654869.jpg", + "table_caption": [ + "Table 4: Zero-shot image-text retrieval on MSCOCO [5]dataset. All the models are pretrained on Laion-5B dataset." + ], + "table_footnote": [], + "table_body": "
modelencoderpretrain lossFlickr30K (1K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast85.297.298.768.288.993.6
captionerViT-Bgenerate46.973.181.572.290.894.3
IG captionerViT-Bgenerate60.690.094.770.089.393.6
CLIP classifierViT-Lcontrast88.098.399.071.190.894.7
captionerViT-Lgenerate56.682.088.177.993.196.1
IG captionerViT-Lgenerate64.793.497.776.292.695.6
", + "bbox": [ + 254, + 354, + 748, + 505 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Table 5: Zero-shot image-text retrieval on Flickr30K [34] dataset. All the models are pretrained on Laion-5B dataset.", + "bbox": [ + 215, + 506, + 785, + 532 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Interestingly, for the text $\\rightarrow$ image retrieval, we find that both the captioner and IG captioner have better performances than the CLIP classifier. Since our approach is to remove the bias in the text prediction, it does not affect the text $\\rightarrow$ image retrieval. We leave this for the future research.", + "bbox": [ + 215, + 580, + 785, + 642 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results on Flickr30K. The results are summarized in Tab. 4. We observe the similar phenomena on MSCOCO. For the image $\\rightarrow$ text retrieval, on the one hand, IG captioner shows significant improvements over the captioner. With the ViT-B image encoder, IG captioner improves the R@1 / R@5 / R@10 by $13.7\\%$ / $16.9\\%$ / $13.2\\%$ , and with the ViT-L image encoder, the improvements are $8.1\\%$ / $11.4\\%$ / $9.6\\%$ . On the other hand, the performance gaps between the IG captioner and the CLIP classifier are significantly reduced. For R@1, the gaps are $24.6\\%$ / $23.3\\%$ with ViT-B / ViT-L image encoder. However, for R@5 / R@10, the gaps become $7.2\\%$ / $4.0\\%$ with ViT-B encoder, and $4.9\\%$ / $1.3\\%$ with ViT-L encoder. For the text $\\rightarrow$ image retrieval, we observe the similar superiority of both the captioner and IG captioner over the CLIP classifier.", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/3f4274a16aca41a5b3da7e3efc825c6e7fd2f6767c818a6630ef16532bcf62dc.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
αImageNet-1KMSCOCO image → text (%)Flickr30K image → text (%)
top-1 acc. (%) rlogP(T),OIGR@1R@5R@10rlogP(T),OIGR@1R@5R@10rlogP(T),OIG
0.045.40.8322.044.356.20.8742.268.476.80.90
0.149.10.8024.948.360.90.8545.671.981.30.88
0.252.50.7628.853.265.00.8150.276.884.70.85
0.355.60.7033.058.268.40.7754.580.087.70.81
0.458.40.6236.761.772.60.7158.284.290.30.76
0.560.70.5240.265.775.90.6261.686.492.30.70
0.662.70.4043.269.478.80.5163.288.293.60.61
0.763.80.2546.272.080.90.3663.489.094.00.48
0.864.30.0847.473.782.50.1960.690.094.70.32
0.963.9-0.1046.473.282.50.056.189.795.80.12
1.062.9-0.2743.370.681.4-0.2150.586.794.5-0.09
", + "bbox": [ + 215, + 143, + 782, + 345 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Table 6: Ablations on the $\\alpha$ of the IG captioner evaluation objective, $O_{\\mathrm{IG}} = \\log P(T|I) - \\alpha \\log P(T)$ . All the performances are reported on zero-shot tasks. The IG captioner is pretrained on the Laion-5B dataset with the ViT-B image encoder. $r$ is the Pearson Correlation Coefficient (PCC). The text $\\rightarrow$ image recalls for the retrieval tasks are not reported because the value of $\\alpha$ does affect the image $\\rightarrow$ text predictions. The best accuracies, recalls and PCCs are marked with the color SpringGreen.", + "bbox": [ + 212, + 345, + 787, + 429 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5 Ablation Studies", + "text_level": 1, + "bbox": [ + 215, + 469, + 415, + 486 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.1 Weights of the Text Prior Removal and Correlation Measurements", + "text_level": 1, + "bbox": [ + 215, + 502, + 699, + 532 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Settings. In this section, we ablate the $\\alpha$ in the evaluation objective of IG captioner, $\\log P(T|I) - \\alpha \\log P(T)$ . We use the same training and evaluation settings as the main experiments. We pretrain the IG captioner with the ViT-B encoder on the Laion-5B dataset and perform zero-shot ImageNet classification and zero-shot image-text retrieval on MSCOCO and Flickr30K. We ablation the $\\alpha$ from 0.0 to 1.0 with a step size 0.1. For the retrieval tasks, we do not list the text $\\rightarrow$ image recalls because the value of $\\alpha$ does not affect the predictions of text $\\rightarrow$ image retrieval. In order to validate our goal of removing the bias from text priors, we report the Pearson Correlation Coefficient (PCC) of $\\log P(T)$ and the evaluation objective when varying the value of $\\alpha$ .", + "bbox": [ + 212, + 544, + 787, + 696 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Results. We summarize the results in Tab. 6. On the one hand, the smaller correlation between $\\log P(T|I)$ and $\\log P(T)$ generally corresponds to better performances. For the ImageNet classification, when $\\alpha = 0.08$ , the best PCC 0.08 and performance $64.3\\%$ are achieved at the same time. For the retrieval tasks on MSCOCO / Flickr30K, the best PCC, $0.0 / 0.12$ , and the highest R@10, $82.5\\% / 95.8\\%$ , are obtained simultaneously with $\\alpha = 0.9$ . On the other hand, it requires a degree of text priors to achieve the best fine-grained performances on specific datasets. The highest R@1, $47.4\\% / 63.4\\%$ , correspond to the PCC, $0.19 / 0.48$ ,", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 542, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/a7a9efa710438ffeba30ce1470b5e028f6ffeb16cb1ab3bcc9bb0196b5c7d97f.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
approachencodereval obj ↑top-1 acc. (%)
LM + CapViT-Blog Pθ(T|I) - log Pψ(T)64.0
IG captionerViT-Blog Pθ(T|I) - log Pθ(T)64.3
LM + CapViT-Llog Pθ(T|I) - log Pψ(T)68.9
IG captionerViT-Llog Pθ(T|I) - log Pθ(T)69.8
", + "bbox": [ + 297, + 143, + 702, + 233 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Table 7: Approach ablations on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. LM + Cap stands for the approach that uses an unimodal Language Model (LM) and a standard multimodal captioner (Cap). The LM is trained with the captions only. $\\psi$ represents the parameters of the LM while $\\theta$ the parameters of the Cap.", + "bbox": [ + 212, + 234, + 787, + 303 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "on MSCOCO / Flickr30K. $\\alpha = 0.0$ corresponds to the bad strong correlations, resulting in the poor performances. $\\alpha = 1.0$ causes the negative correlations and produces the unsatisfying performances. According to the ImageNet classification results with ViT-B encoder, we set $\\alpha = 0.8$ for all experiments in this paper. For the ImageNet classification with ViT-L encoder and all the image-text retrieval tasks, we do not change this $\\alpha$ .", + "bbox": [ + 212, + 348, + 787, + 441 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.2 Language Model + Captioner versus IG Captioner", + "text_level": 1, + "bbox": [ + 212, + 465, + 679, + 483 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Settings. IG captioner has a text decoder that is able to predict both $\\log P(T|I)$ and $\\log P(T)$ . One variant of IG captioner consists of a pair of models. One of them is the unimodal Language Model (LM) to predict $\\log P(T)$ . The other one is the multimodal captioner, a standard captioner to predict $\\log P(T|I)$ . During inference, the prediction is based on the subtraction of their outputs. We call this LM + Cap approach.", + "bbox": [ + 212, + 496, + 787, + 589 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Results. We report the results in Tab. 7. It is observed that the LM + Cap approach performs worse than the IG captioner. Besides, it is less efficient due to the extra language model. From another perspective, it demonstrates that the text decoder of IG captioner is able to perform both the multimodal and unimodal tasks well.", + "bbox": [ + 212, + 614, + 787, + 691 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.3 IG Evaluation", + "text_level": 1, + "bbox": [ + 214, + 718, + 380, + 734 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Settings. IG captioner differs from a standard captioner in both the training and evaluation phases. In this section, we study whether the IG evaluation will improve a standard captioner as a classifier. The IG evaluation requires the prediction of $\\log P(T)$ . Since the standard captioner can not directly predict this, we feed the captioner zero-intensity images to compute $\\log P(T|\\mathbf{0})$ as the approximation.", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/fc817456419a8b93122a704a2fee1f6f780c88762fda3ab624245834e4c74a3e.jpg", + "image_caption": [ + "Fig. 5: Ablations of the Information Gain (IG) evaluation on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. Captioner + IG eval uses the evaluation objective, $\\log P(T|I) - \\alpha \\log P(T|\\mathbf{0})$ . $\\log P(T|\\mathbf{0})$ is the prediction of the captioner with the input being the zero-intensity image. It is used to approximate $\\log P(T)$ , because the standard captioner after training is not able to directly predict $\\log P(T)$ ." + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 781, + 237 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/447785eb18aeaec54790f2945ec2fcc91367522aaaddaa76369dde3a4e732512.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
generative classifiermodel typepretrain dataparamstop-1 acc. (%)
Imagen [7,41]text-to-imageL5B + Psy2B62.7
Stable Diffusion 2.0 [19,40]text-to-imageL5B1.45B61.4
IG captionerimage-to-textL5B1.07B69.8
", + "bbox": [ + 238, + 358, + 764, + 429 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 8: Comparisons of generative classifiers on zero-shot ImageNet classification. L5B and Psy represent the Laion-5B dataset and a proprietary dataset.", + "bbox": [ + 214, + 429, + 782, + 458 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Results. We show the results in Tab. 5. The IG evaluation is able to significantly improve the performance of the captioners. Specifically, with the ViT-B / ViT-L image encoder, IG evaluation increases the zero-shot top-1 ImageNet classification accuracy by $9.0\\%$ / $7.9\\%$ . Adding the training part of IG captioner, the performances will be further improved by $10.7\\%$ / $10.2\\%$ .", + "bbox": [ + 212, + 503, + 787, + 582 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.4 Comparisons to Text-to-image Generative Classifiers", + "text_level": 1, + "bbox": [ + 214, + 614, + 697, + 631 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Settings. There are two kinds of vision-language generative models: text-to-image generative models and image-to-text captioners. There have been recent works [7,19] that successfully convert the large text-to-image diffusion models to the zero-shot generative classifiers. We compare IG captioner with these models.", + "bbox": [ + 212, + 652, + 787, + 715 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Results. The results are summarized in Tab. 8. With the same or smaller amount of pretraining data, IG captioner demonstrates the best performances. Compared with the Text-to-Image Classifiers [7] and Diffusion Classifier [19] usingImagen [41] and Stable Diffusion [40], respectively, IG captioner shows $7.1\\%$ / $8.4\\%$ zero-shot top-1 accuracy improvements on ImageNet. Besides, IG captioner is a more compact model and only uses $53.5\\%$ / $73.8\\%$ of their parameters.", + "bbox": [ + 212, + 748, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 540, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/fffa463b2c2636af03e2ee1de42153d883109a213acb270e7912fc61f6d1cd91.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
training loss weightstop-1 acc. (%)
β: log P(T|I) γ: log P(T)
1.01.063.0
1.50.564.3
1.90.162.8
", + "bbox": [ + 215, + 143, + 496, + 233 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/73ea43e689505c4a9df83fbf8aca0406fff8f6601a60016840b27969b400f1b1.jpg", + "table_caption": [ + "Table 9: Ablations of the training loss weights on zero-shot ImageNet classification. The performances are obtained from the IG captioners trained on the Laion-5B dataset with ViT-B encoder. $\\beta$ and $\\gamma$ are the weights of the multimodal and unimodal training objectives in Eqn. (6)" + ], + "table_footnote": [], + "table_body": "
modelsVQAv2 test-standard acc. (%)
CLIPN/A
captioner74.5
IG captioner75.2
", + "bbox": [ + 526, + 152, + 787, + 224 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 10: Generative evaluation on VQAv2. All the models are pretrained on the Laion-5B dataset with ViT-L encoder and fine-tuned on the VQAv2 dataset. CLIP can not perform the VQA task as a discriminative model.", + "bbox": [ + 526, + 224, + 787, + 306 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5.5 Weights of the Multimodal and Unimodal Training Losses", + "text_level": 1, + "bbox": [ + 212, + 383, + 740, + 401 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Settings and Results. We ablate the multimodal loss weight $\\beta$ and the unimodal loss weight $\\gamma$ in the training objective of IG captioner (Eqn. (6)). We train the IG captioners with ViT-B encoder on the Laion-5B dataset and evaluate them on zero-shot ImageNet classification. The results are shown in Tab. 9. The equal weights do not produce the optimal results. We notice that image encoder is only trained with the multimodal loss while the text decoder is supervised by both the losses. We set the multimodal loss weight $\\beta = 1.5$ and the unimodal loss $\\gamma = 0.5$ for all the other experiments.", + "bbox": [ + 212, + 407, + 787, + 532 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5.6 Generative Evaluation of IG Captioner", + "text_level": 1, + "bbox": [ + 214, + 549, + 584, + 566 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Settings and Results. We evaluate the generative capability of IG captioner in this section. Specifically, after pertaining on the Laion-5B dataset, we perform the generative fine-tuning on the VQAv2 dataset. The results are shown in Tab. 10. The IG captioner outperforms the captioner, showing that the information gain approach improves the captioner in both discriminative and generative tasks.", + "bbox": [ + 212, + 571, + 787, + 662 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 214, + 684, + 359, + 700 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we address the challenge of using a generative captioner for zero-shot classification tasks. We identify and mitigate the issue of linguistic priors dominating visual signals by introducing the Information Gain (IG) captioner with novel training and evaluation methods. Our results show that the IG captioner is an effective zero-shot classifier.", + "bbox": [ + 212, + 713, + 787, + 789 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements We gratefully acknowledge supports from ONR with N00014-23-1-2641.", + "bbox": [ + 214, + 809, + 807, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023)", + "2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. Advances in neural information processing systems 35, 23716-23736 (2022)", + "3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A versatile vision-language model for understanding, localization, text reading, and beyond (2023)", + "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)", + "5. Chen, X., Fang, H., Lin, T.Y., Vedantam, R., Gupta, S., Dollar, P., Zitnick, C.L.: Microsoft coco captions: Data collection and evaluation server. arXiv preprint arXiv:1504.00325 (2015)", + "6. Church, K., Hanks, P.: Word association norms, mutual information, and lexicography. Computational linguistics 16(1), 22-29 (1990)", + "7. Clark, K., Jaini, P.: Text-to-image diffusion models are zero-shot classifiers. arXiv preprint arXiv:2303.15233 (2023)", + "8. Dai, W., Li, J., Li, D., Tiong, A.M.H., Zhao, J., Wang, W., Li, B., Fung, P., Hoi, S.: Instructblip: Towards general-purpose vision-language models with instruction tuning (2023)", + "9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)", + "10. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)", + "1. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106. Springer (2022)", + "2. Ge, Y., Zeng, X., Huffman, J.S., Lin, T.Y., Liu, M.Y., Cui, Y.: Visual fact checker: Enabling high-fidelity detailed caption generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14033-14042 (2024)", + "3. te Grotenhuis, M., Matthijssen, A.: Basic SPSS tutorial. Sage Publications (2015)", + "4. He, H., Peng, N., Liang, P.: Pun generation with surprise. arXiv preprint arXiv:1904.06828 (2019)", + "5. Hinton, G.E.: To recognize shapes, first learn to generate images. Progress in brain research 165, 535-547 (2007)", + "6. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)", + "7. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)", + "8. Huang, S., Dong, L., Wang, W., Hao, Y., Singhal, S., Ma, S., Lv, T., Cui, L., Mohammed, O.K., Liu, Q., Aggarwal, K., Chi, Z., Bjorck, J., Chaudhary, V., Som," + ], + "bbox": [ + 225, + 176, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 540, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "S., Song, X., Wei, F.: Language is not all you need: Aligning perception with language models. ArXiv abs/2302.14045 (2023)", + "19. Li, A.C., Prabhudesai, M., Duggal, S., Brown, E., Pathak, D.: Your diffusion model is secretly a zero-shot classifier. arXiv preprint arXiv:2303.16203 (2023)", + "20. Li, B., Zhang, K., Zhang, H., Guo, D., Zhang, R., Li, F., Zhang, Y., Liu, Z., Li, C.: Llava-last: Stronger llms supercharge multimodal capabilities in the wild (May 2024), https://llava-v1.github.io/blog/2024-05-10-llava-last-stronger-llms/", + "21. Li, J., Galley, M., Brockett, C., Gao, J., Dolan, B.: A diversity-promoting objective function for neural conversation models. arXiv preprint arXiv:1510.03055 (2015)", + "22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. In: International conference on machine learning. pp. 19730-19742. PMLR (2023)", + "23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International conference on machine learning. pp. 12888-12900. PMLR (2022)", + "24. Li, X.L., Holtzman, A., Fried, D., Liang, P., Eisner, J., Hashimoto, T., Zettlemoyer, L., Lewis, M.: Contrastive decoding: Open-ended text generation as optimization. arXiv preprint arXiv:2210.15097 (2022)", + "25. Liu, A., Sap, M., Lu, X., Swayamdipta, S., Bhagavatula, C., Smith, N.A., Choi, Y.: Dexperts: Decoding-time controlled text generation with experts and anti-experts. arXiv preprint arXiv:2105.03023 (2021)", + "26. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning (2023)", + "27. Liu, H., Li, C., Li, Y., Li, B., Zhang, Y., Shen, S., Lee, Y.J.: Llava-last: Improved reasoning,OCR,and world knowledge (January 2024),https://llava-v1.github.io/blog/2024-01-30-llava-last/", + "28. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024)", + "29. Ng, A., Jordan, M.: On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. Advances in neural information processing systems 14 (2001)", + "30. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)", + "31. OpenAI: Gpt-4 technical report. ArXiv abs/2303.08774 (2023), https://arxiv.org/abs/2303.08774", + "32. Pearson, K.: VII. note on regression and inheritance in the case of two parents. proceedings of the royal society of London 58(347-352), 240-242 (1895)", + "33. Peng, Z., Wang, W., Dong, L., Hao, Y., Huang, S., Ma, S., Wei, F.: Kosmos-2: Grounding multimodal large language models to the world. arXiv preprint arXiv:2306.14824 (2023)", + "34. Plummer, B.A., Wang, L., Cervantes, C.M., Caicedo, J.C., Hockenmaier, J., Lazebnik, S.: Flickr30k entities: Collecting region-to-phrase correspondences for richer image-to-sentence models. In: Proceedings of the IEEE international conference on computer vision. pp. 2641-2649 (2015)", + "35. Quinlan, J.R.: Induction of decision trees. Machine learning 1, 81-106 (1986)", + "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "C. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents, 2022. URL https://arxiv.org/abs/2204.061257 (2022)", + "38. Ranzato, M., Susskind, J., Mnih, V., Hinton, G.: On deep generative models with applications to recognition. In: CVPR 2011. pp. 2857-2864. IEEE (2011)", + "39. Reid, M., Savinov, N., Teplyashin, D., Lepikhin, D., Lillicrap, T., Alayrac, J.b., Soricut, R., Lazaridou, A., First, O., Schrittwieser, J., et al.: Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context. arXiv preprint arXiv:2403.05530 (2024)", + "40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)", + "41. Sahara, C., Chan, W., Chang, H., Lee, C., Ho, J., Salimans, T., Fleet, D., Norouzi, M.: Palette: Image-to-image diffusion models. In: ACM SIGGRAPH 2022 Conference Proceedings. pp. 1-10 (2022)", + "42. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)", + "43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022)", + "44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015)", + "45. Su, Y., Lan, T., Wang, Y., Yogatama, D., Kong, L., Collier, N.: A contrastive framework for neural text generation. Advances in Neural Information Processing Systems 35, 21548-21561 (2022)", + "46. Team, G., Anil, R., Borgeaud, S., Wu, Y., Alayrac, J.B., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., et al.: Gemini: a family of highly capable multimodal models. arXiv preprint arXiv:2312.11805 (2023)", + "47. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)", + "48. Wang, P., Yang, A., Men, R., Lin, J., Bai, S., Li, Z., Ma, J., Zhou, C., Zhou, J., Yang, H.: Ofa: Unifying architectures, tasks, and modalities through a simple sequence-to-sequence learning framework. In: International conference on machine learning. pp. 23318-23340. PMLR (2022)", + "49. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022)", + "50. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022)", + "51. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023)" + ], + "bbox": [ + 212, + 146, + 787, + 811 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Information-Gain Captioner", + "bbox": [ + 540, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_model.json b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_model.json new file mode 100644 index 0000000000000000000000000000000000000000..7781f5906a9509847fe2eb2a432043fd87557f53 --- /dev/null +++ b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_model.json @@ -0,0 +1,2313 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.252, + 0.141, + 0.753, + 0.187 + ], + "angle": 0, + "content": "IG Captioner: Information Gain Captioners are Strong Zero-shot Classifiers" + }, + { + "type": "text", + "bbox": [ + 0.301, + 0.212, + 0.701, + 0.244 + ], + "angle": 0, + "content": "Chenglin Yang\\(^{1}\\), Siyuan Qiao\\(^{2}\\), Yuan Cao\\(^{2}\\), Yu Zhang\\(^{2}\\), Tao Zhu\\(^{2}\\), Alan Yuille\\(^{1}\\), and Jiahui Yu\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.407, + 0.254, + 0.597, + 0.283 + ], + "angle": 0, + "content": "1 Johns Hopkins University 2 Google DeepMind" + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.307, + 0.396, + 0.329 + ], + "angle": 0, + "content": "DOG = \"A photo of a west highland white terrier\" \nHORSE = \"A photo of a common sorrel horse\"" + }, + { + "type": "text", + "bbox": [ + 0.245, + 0.346, + 0.353, + 0.357 + ], + "angle": 0, + "content": "Language Model Output" + }, + { + "type": "text", + "bbox": [ + 0.258, + 0.365, + 0.329, + 0.386 + ], + "angle": 0, + "content": "\\(\\log P(\\mathrm{DOG}) = -3.3\\) \\(\\log P(\\mathrm{HORSE}) = -4.\\)" + }, + { + "type": "text", + "bbox": [ + 0.256, + 0.427, + 0.337, + 0.438 + ], + "angle": 0, + "content": "(a) Linguistic prior" + }, + { + "type": "image", + "bbox": [ + 0.419, + 0.305, + 0.788, + 0.439 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.458, + 0.789, + 0.556 + ], + "angle": 0, + "content": "Fig. 1: The prediction of a captioner-based classifier is influenced by the linguistic priors in pure text modality. The Information Gain (IG) evaluation reduces such impact and makes the predictions more grounded on the visual inputs. We illustrate with real predictions on zero-shot ImageNet [9] classification in this figure. (a) The language model was trained on Laion-5B [43] captions only. (b) The captioner was trained on the Laion-5B dataset with both the images and captions. The IG evaluation in (b) uses the outputs of both the captioner and the language model in (a)." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.577, + 0.741, + 0.841 + ], + "angle": 0, + "content": "Abstract. Generative training has been demonstrated to be powerful for building visual-language models. However, on zero-shot discriminative benchmarks, there is still a performance gap between models trained with generative and discriminative objectives. In this paper, we aim to narrow this gap by improving the efficacy of generative training on classification tasks, without any finetuning processes or additional modules. Specifically, we focus on narrowing the gap between the generative captioner and the CLIP classifier. We begin by analysing the predictions made by the captioner and classifier and observe that the caption generation inherits the distribution bias from the language model trained with pure text modality, making it less grounded on the visual signal. To tackle this problem, we redesign the scoring objective for the captioner to alleviate the distributional bias and focus on measuring the gain of information brought by the visual inputs. We further design a generative training objective to match the evaluation objective. We name our model trained and evaluated from the novel procedures as Information Gain (IG) captioner. We pretrain the models on the public Laion-5B dataset and perform a series of discriminative evaluations. For the zero-shot classification on ImageNet, IG captioner achieves \\(>18\\%\\)" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.148, + 0.744, + 0.231 + ], + "angle": 0, + "content": "improvements over the standard captioner, achieving comparable performances with the CLIP classifier. IG captioner also demonstrated strong performance on zero-shot image-text retrieval tasks on MSCOCO and Flickr30K. We hope this paper inspires further research towards unifying generative and discriminative training procedures for visual-language models." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.26, + 0.377, + 0.276 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.295, + 0.787, + 0.401 + ], + "angle": 0, + "content": "Generative training has been shown to be highly effective for both the language [4] and vision models [16, 44]. These generative models demonstrate remarkable zero-shot generation capabilities and have led to the developments of many impressive AI applications [31, 40]. On the other hand, discriminative training is still an effective procedure for building the large vision-language models like CLIP [36] and CoCa [49]. Models trained with discriminative objectives naturally performs strongly on discriminative tasks like classification." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.402, + 0.787, + 0.492 + ], + "angle": 0, + "content": "The inconsistent setups between generative and discriminative training raises an intriguing topic, which we aim to address in this paper: Can generative training procedure also perform well on zero-shot discriminative tasks? Concretely, we study the performance gap between generative captioners and discriminative models on zero-shot classification tasks, and propose novel approaches to narrow the gap." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.787, + 0.644 + ], + "angle": 0, + "content": "To obtain an effective zero-shot generative classifier, we start with evaluating a standard generative captioner with the Maximum Likelihood Estimation (MLE) objective on classification tasks. Specifically, we pretrain a captioner on the public Laion-5B [43] dataset and evaluate it on the ImageNet [9]. We also pretrain a CLIP classifier with the same experimental setting. We observe a large performance gap between the captioner and the CLIP classifier. We find that the predictions of the captioner are less grounded on the visual inputs. Instead, they are biased by the linguistic priors, which is illustrated in Fig. 1. These observations indicate that we should discount the influence by predictions from pure text modality in multimodal generative classification setup." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.787, + 0.841 + ], + "angle": 0, + "content": "To deal with this problem, we propose an Information Gain (IG) evaluation objective, as depicted in Fig. 2. This objective demonstrates a significant performance boost on top of a captioner trained with conventional procedure. Furthermore, we propose a generative training objective to match the IG evaluation. We name the captioner, trained and evaluated with our proposed objectives, as Information Gain (IG) captioner. We pretrain the models on the Laion-5B dataset and evaluate multiple zero-shot discriminative tasks. All the models have the same training and evaluation settings to ensure the fair comparisons. For zero-shot ImageNet classification, IG captioner with ViT-B/ViT-L [10] image encoder shows \\(19.7\\% / 18.1\\%\\) improvements on top-1 accuracy over the standard captioner. It is even better than the CLIP classifier by \\(0.5\\% / 1.6\\%\\) top-1 accuracy. For zero-shot image-text retrieval on MSCOCO [5] dataset, IG captioner demonstrates \\(>22\\%\\) accuracy improvements on all of image-to-text R@1, R@5" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.543, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.146, + 0.48, + 0.392 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.553, + 0.221, + 0.778, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.395, + 0.788, + 0.465 + ], + "angle": 0, + "content": "Fig. 2: The inference pipeline of IG captioner. \\( I \\) and \\( T \\) represent the input image and caption. IG captioner consists of a image encoder and a text decoder. The text decoder is able to provide both the multimodal and unimodal predictions. The unimodal predictions can be cached for different input images. Both the image and object classes are from the ImageNet dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.512, + 0.788, + 0.586 + ], + "angle": 0, + "content": "and R@10 over the captioner, significantly reducing the gap from the captioner to the CLIP classifier. Interestingly, we observe the superior performances on text-to-image recalls of both the captioner and IG captioner over the CLIP classifier. The superiority of IG captioner is also demonstrated on Flickr30K [34] dataset." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.589, + 0.678, + 0.605 + ], + "angle": 0, + "content": "Our main contributions can be summarized in the following:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.623, + 0.785, + 0.68 + ], + "angle": 0, + "content": "- We convert a generative captioner into a zero-shot classifier. We identify the root cause of its poor performance and observe that its predictions are negatively influenced by the linguistic priors and less grounded on the visual inputs." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.685, + 0.785, + 0.729 + ], + "angle": 0, + "content": "- We propose the Information Gain (IG) method to evaluate a generative classifier. We demonstrate that the IG evaluation is able to significantly improve its performance without any changes in the training process." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.733, + 0.785, + 0.775 + ], + "angle": 0, + "content": "- To couple with the IG evaluation, we propose a generative training objective to further boost the performance of the generative classifier which we name Information Gain (IG) captioner." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.78, + 0.785, + 0.837 + ], + "angle": 0, + "content": "- We show that IG captioner is a strong zero-shot classifier, evidenced by the significant improvements over the captioner and comparable performance with the CLIP classifier on the zero-shot ImageNet classification, MSCOCO and Flickr30K image-text retrieval tasks." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.623, + 0.785, + 0.837 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.232, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.39, + 0.161 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.282 + ], + "angle": 0, + "content": "Text-to-image Generative Classifiers. The classic approach [15,38] of using generative models to perform recognition tasks is the Bayes algorithm [29]. During training, this algorithm models the data distribution while during inference, it provides predictions by solving a maximum likelihood estimation (MLE) problem. Recently, there have been the methods [7,19] proposed to convert the text-to-image diffusion models, Stable Diffusion [40] or Imagen [41], into a zero-shot classifier using the Bayes algorithm." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.282, + 0.788, + 0.417 + ], + "angle": 0, + "content": "The focus of IG captioner is different with these previous arts. First, we explore the possibility of achieving a good classifier solely through the generative training, instead of how to convert a generative model into a classifier. The Stable Diffusion used by the above diffusion model classifiers [7, 19] is not suitable for our goal because it uses the CLIP text encoder pretrained with contrastive loss to provide the text guidance. Second, we identify the negative impact of the text priors inherited from the pretraining data and propose methods to reduce this impact for zero-shot classification tasks. Besides, IG captioner is an image-to-text generative captioner. We also perform the comparisons in Tab. 8." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.418, + 0.788, + 0.553 + ], + "angle": 0, + "content": "Classifier-Free Guidance (CFG). CFG [17] is an important approach to improving the sample quality of text-to-image generative models [11,30,37,42, 50]. During training, CFG requires the model to generate images both with and without text conditions. During inference, the output image is sampled according to a linear combination of both the conditional and unconditional predictions to improve text-image alignment, which relates CFG to IG captioner from a high level. In contrast, IG captioner is an image-to-text captioner that uses the probability gain from unconditionally to conditionally generating captions with the aim of reducing the bias from text priors for zero-shot classification tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.554, + 0.788, + 0.735 + ], + "angle": 0, + "content": "Contrast in Text Generation. In the field of text generation, researchers have been investigating the use of contrast, including avoiding the text degeneration and undesirable repetitions [45], generating pan sentences [14], and language detoxification [25]. Contrastive decoding [24] uses the log-likelihood difference between a large expert and a small amateur model to improve the quality of the open-ended text generation. Li et al. [21] propose to use the mutual information between an input message and its responses as the decoding objective to avoid the generic and meaningless conversations. Differently, in this paper, IG captioner uses the Information Gain (IG) to address the problem of evaluating a vision-language generative model as a zero-shot classifier. Importantly, the IG evaluation is used to mitigate the negative influence of linguistic priors inherited from the pretraining dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.8, + 0.84 + ], + "angle": 0, + "content": "Image-to-text Multimodal Language Models. Multimodal language models have become the dominant approaches for image captioning, including OFA [48], Flamingo [2], BLIP [22, 23], CoCa [49], LLaVA [26, 28], MiniGPT-4 [51], InstructBLIP [8], Kosmos [18, 33], Qwen-VL [3], VFC [12], LLaVA-NeXT [20, 27], Gemini [39, 46], and GPT-4 [1]. Differently, IG captioner demonstrates the potential of pure generative training on discriminative tasks using public datasets." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.542, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.331, + 0.161 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.175, + 0.788, + 0.268 + ], + "angle": 0, + "content": "In this section, we introduce Information Gain (IG) captioner. First, we illustrate how to evaluate a conventional captioner on the zero-shot classification task and diagnose its problem. Second, we propose an evaluation approach using the information gain to tackle the problem. Third, we design a training objective to couple with the IG evaluation. Combining the above evaluation and training procedures, we propose IG captioner." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.287, + 0.65, + 0.304 + ], + "angle": 0, + "content": "3.1 Evaluating Captioners on Discriminative Tasks" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.311, + 0.787, + 0.372 + ], + "angle": 0, + "content": "A captioner is a generative model that generates caption for a given image. It is by nature not trained as a classifier and its output can not be used directly for such tasks like image classification or image-text retrieval. Therefore, to evaluate a captioner on discriminative tasks, we need to adapt the evaluation procedure." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.391, + 0.788, + 0.467 + ], + "angle": 0, + "content": "Maximum Likelihood Estimation (MLE) Objective. Let \\( I \\in \\mathbb{R}^{H \\times W \\times 3} \\), \\( T \\in \\mathbb{R}^{N \\times D} \\) and \\( t \\in \\mathbb{R}^D \\) be the image, caption and the word in the caption, where \\( H \\), \\( W \\) are the height and width of the image and \\( N \\), \\( D \\) are the number of text tokens and the token dimension. A captioner is a function \\( F_{\\theta}: I \\to T \\) where \\( \\theta \\) is the model parameter." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.468, + 0.788, + 0.515 + ], + "angle": 0, + "content": "Discriminative tasks require the model to pick the most appropriate text from a set of candidates \\( C = \\{T_i\\} \\) to describe an image, where \\( i \\) is the index of captions. During inference, the standard MLE evaluation objective is:" + }, + { + "type": "equation", + "bbox": [ + 0.428, + 0.524, + 0.786, + 0.547 + ], + "angle": 0, + "content": "\\[\n\\underset {i} {\\arg \\max } [ \\log P (T _ {i} | I) ] \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.557, + 0.787, + 0.603 + ], + "angle": 0, + "content": "We omit the normalization factor \\( 1 / N_{i} \\) when calculating the evaluation objectives throughout this paper for simplicity. \\( N_{i} \\) is the token length of the \\( t^{\\mathrm{th}} \\) caption." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.623, + 0.788, + 0.76 + ], + "angle": 0, + "content": "Low Performance Using MLE Objective. To study the effectiveness of MLE as objective, we pretrain a captioner on Laion-5B and use it to perform zero-shot ImageNet classification. We set up a strong baseline: a CLIP classifier which is pretrained with contrastive loss and tailored for classification tasks. The captioner has a image encoder and a text decoder while the CLIP classifier has a image encoder and a text encoder. Both of them have the same model size, training and evaluation settings to ensure fair comparisons. The results are shown in Tab. 1. When directly using the MLE objective (Eqn. (1)) the captioner shows \\(>19\\%\\) top-1 accuracy degradation compared with the CLIP classifier." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Result Analysis of MLE Evaluation. Since the captioner is a vision-language model, we are interested in understanding how much visual information is provided by the visual inputs and utilized by the model. We pretrain a language model that has the same architecture as the text decoder of the captioner." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "table", + "bbox": [ + 0.333, + 0.144, + 0.673, + 0.201 + ], + "angle": 0, + "content": "
modelspretrain losszero-shot IN acc. (%)
CLIP classifiercontrast63.8
captionergenerate44.6
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.2, + 0.788, + 0.284 + ], + "angle": 0, + "content": "Table 1: The large performance gap between the standard captioner and the CLIP classifier on zero-shot ImageNet classification. All the models are trained with the Laion-5B dataset. The CLIP classifier is trained with contrastive loss while the captioner with generative loss. The CLIP classifier has a 12-layer image encoder and a 12-layer text encoder and the captioner has a 12-layer image encoder and a 12-layer text decoder." + }, + { + "type": "table", + "bbox": [ + 0.361, + 0.311, + 0.644, + 0.368 + ], + "angle": 0, + "content": "
variable 1variable 2rvar1, var2
log P(T)log P(T|I)0.77
log P(T)log P(T|I) - log P(T)-0.39
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.368, + 0.788, + 0.452 + ], + "angle": 0, + "content": "Table 2: Mean Pearson Correlation Coefficient (PCC) measurements of zero-shot predictions on ImageNet. \\(\\log P(T)\\) is predicted by the unimodal language model which is trained with the Laion-5B captions. \\(\\log P(T|I)\\) is predicted by the standard captioner trained with both the Laion-5B images and captions. Given one image, there are 80K (1K classes, 80 prompts) observations of these two variables to compute the PCC. The mean PCC is obtained by averaging the PCC on 50K ImageNet validation images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.494, + 0.788, + 0.616 + ], + "angle": 0, + "content": "It models the captions in the Laion-5B dataset and is able to predict \\(\\log P(T)\\). There are 1K classes on ImageNet and for each class we use the 80 prompts proposed by CLIP. In total, there are 80K unique captions. Given an image \\(I\\), we consider \\(\\log P(T|I)\\) and \\(\\log P(T)\\) as two variables and compute their Pearson correlation coefficient (PCC) [13, 32] with 80K observations in Tab. 2. We observe a strong correlation between \\(\\log P(T|I)\\) and \\(\\log P(T)\\), which indicates that the captioner is strongly biased by the text priors and tends to ignore the visual information. The correlation is also visualized in Fig. 3." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.639, + 0.714, + 0.656 + ], + "angle": 0, + "content": "3.2 Evaluating Captioners with the Information Gain (IG)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.666, + 0.787, + 0.71 + ], + "angle": 0, + "content": "To alleviate the problem of strong correlation between caption likelihood conditioned on the image and caption priors, we tun to the following evaluation objective:" + }, + { + "type": "equation", + "bbox": [ + 0.42, + 0.711, + 0.786, + 0.744 + ], + "angle": 0, + "content": "\\[\n\\underset {i} {\\arg \\max } \\left[ \\log \\frac {P \\left(T _ {i} \\mid I\\right)}{P \\left(T _ {i}\\right)} \\right] \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.809 + ], + "angle": 0, + "content": "Intuitively, this log-ratio measures the likelihood gain of the text \\( T_{i} \\) given the image \\( I \\). It is called pointwise mutual information [6]. The expectation of it over all the texts \\( T \\) is the information gain [35]. In this paper, we refer to pointwise mutual information as information gain." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.792, + 0.842 + ], + "angle": 0, + "content": "We measure the correlation of \\(\\log P(T_i)\\) and \\([\\log P(T_i|I) - \\log P(T_i)]\\) in Tab. 2. It shows that the correlation is significantly reduced. Using this objective, we" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.543, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.787, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.3, + 0.788, + 0.385 + ], + "angle": 0, + "content": "Fig. 3: See correlations between the green line \\((- \\log P(T|I))\\) and the orange line \\((- \\log P(T))\\) on zero-shot ImageNet classification. \\(\\log P(T|I)\\) is predicted by a multimodal captioner trained on the Laion-5B dataset. \\(\\log P(T)\\) is predicted by an unimodal language model trained on the Laion-5B captions only. 100 ImageNet classes are randomly sampled due to the limited space. The numerical correlation measurements between \\(\\log P(T|I)\\) and \\(\\log P(T)\\) for the whole 1000 classes are shown in Tab. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.784, + 0.472 + ], + "angle": 0, + "content": "observe the performance gain in our ablation studies in Sec. 5.1. However, we notice that this quantity is negatively correlated with the caption priors, which is expected due to the existence of term \\(-\\log P(T_i)\\) in Eqn. (2)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.472, + 0.784, + 0.503 + ], + "angle": 0, + "content": "To deal with this negative correlation problem, we further propose the following evaluation objective:" + }, + { + "type": "equation", + "bbox": [ + 0.377, + 0.514, + 0.786, + 0.539 + ], + "angle": 0, + "content": "\\[\n\\underset {i} {\\arg \\max } [ \\log P (T _ {i} | I) - \\alpha \\log P (T _ {i}) ] \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.549, + 0.784, + 0.581 + ], + "angle": 0, + "content": "where \\(\\alpha \\in [0,1]\\) adjusts the degree of the text prior removal. Our thorough ablation study on \\(\\alpha\\) can be found in Sec. 5.1." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.603, + 0.578, + 0.619 + ], + "angle": 0, + "content": "3.3 Training Information Gain Captioners" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.628, + 0.784, + 0.703 + ], + "angle": 0, + "content": "Without any changes on the training process, we observe the performance improvement of the captioner on the zero-shot classification task when using IG evaluation, which is shown in Sec. 5.3. But in order to keep the training and evaluation consistent, we propose a two-objective approach to train the captioner, which is illustrated in Fig. 4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.703, + 0.784, + 0.734 + ], + "angle": 0, + "content": "The first objective is the standard generative loss. Given an image, it supervises the captioner to predict the words of its caption in an autoregressive way:" + }, + { + "type": "equation", + "bbox": [ + 0.335, + 0.745, + 0.786, + 0.788 + ], + "angle": 0, + "content": "\\[\nl _ {\\text {m u l t i m o d a l}} = \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\frac {1}{N ^ {i}} \\sum_ {n = 1} ^ {N ^ {i}} \\log \\frac {1}{P \\left(t _ {t} ^ {i} \\mid t _ {1 : n - 1} ^ {i} , I ^ {i}\\right)} \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.786, + 0.84 + ], + "angle": 0, + "content": "where \\( i \\) is the index of a image-text pair \\( (I^i, T^i) \\) in one batch of size \\( B \\). \\( N^i \\) is the text token length. Since this objective models the probability of a caption conditioned on an image, we call this objective the multimodal loss." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.23, + 0.147, + 0.768, + 0.284 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.297, + 0.788, + 0.355 + ], + "angle": 0, + "content": "Fig. 4: The training pipeline of IG captioner. IG captioner has two modes. Without any given images, IG captioner is an unimodal language model. When given an input image, IG captioner becomes the multimodal captioner that models the conditional probability of its caption. The image and caption are from the Laion-5B dataset." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.393, + 0.785, + 0.424 + ], + "angle": 0, + "content": "The second objective makes the captioner an autoregressive language model that is able to generate captions without given any image:" + }, + { + "type": "equation", + "bbox": [ + 0.35, + 0.432, + 0.785, + 0.473 + ], + "angle": 0, + "content": "\\[\nl _ {\\text {u n i m o d a l}} = \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\frac {1}{N ^ {i}} \\sum_ {n = 1} ^ {N ^ {i}} \\log \\frac {1}{P \\left(t _ {n} ^ {i} \\mid t _ {1 : n - 1} ^ {i}\\right)} \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.48, + 0.51, + 0.494 + ], + "angle": 0, + "content": "We call this objective the unimodal loss." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.496, + 0.655, + 0.51 + ], + "angle": 0, + "content": "Finally, we combine the above two losses in the following:" + }, + { + "type": "equation", + "bbox": [ + 0.398, + 0.519, + 0.785, + 0.535 + ], + "angle": 0, + "content": "\\[\nL = \\beta l _ {\\text {m u l t i m o d a l}} + \\gamma l _ {\\text {u n i m o d a l}} \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.543, + 0.785, + 0.588 + ], + "angle": 0, + "content": "where \\(\\beta\\) and \\(\\gamma\\) are the weights for each loss. We perform an ablation study on the loss weights in Sec. 5.5. We name the captioner which is trained and evaluated with our proposed objectives IG captioner." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.609, + 0.376, + 0.626 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.637, + 0.537, + 0.652 + ], + "angle": 0, + "content": "4.1 Zero-shot ImageNet classification" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Settings. We use the English subset of the public Laion-5B [43] dataset as the pretraining dataset for all experiments. After pretraining, we perform zero-shot image classification on the ImageNet [9] validation dataset. There are 1000 classes in this validation set and each class has 50 images. We build the captioner and IG captioner with an image encoder and a text decoder, and build the CLIP [36] classifier with an image encoder and a text encoder. All the models consist of standard transformer blocks [47]. We set the layer number of image encoder and text decoder / text encoder the same. We use a batch size 4096 for all the experiments. During evaluation, we follow CLIP to use 80 prompts for each class. We use the voting mechanism to combine the predictions from different prompts for the captioner and IG captioner. All the training and evaluation procedures are the same to ensure fair comparisons." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.542, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table", + "bbox": [ + 0.328, + 0.144, + 0.675, + 0.263 + ], + "angle": 0, + "content": "
modelencoderpretrain losstop-1 acc. (%)
CLIP classifierViT-Bcontrast63.8
captionerViT-Bgenerate44.6
IG captionerViT-Bgenerate64.3
CLIP classifierViT-Lcontrast68.2
captionerViT-Lgenerate51.7
IG captionerViT-Lgenerate69.8
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.263, + 0.788, + 0.318 + ], + "angle": 0, + "content": "Table 3: Zero-shot ImageNet classification. All the models are pretrained with the public Laion-5B dataset. The image encoder, text decoder in captioner and IG captioner, and text encoder in CLIP classifier have the same layer number, and they are all built with standard transformer blocks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.361, + 0.788, + 0.513 + ], + "angle": 0, + "content": "Results. The results are summarized in Tab. 3. First, compared with standard captioners, IG captioner achieves \\(19.7\\%\\) and \\(18.1\\%\\) top-1 accuracy improvements when using ViT-B and ViT-L [10] as the image encoders. Second, compared with the strong discriminative baselines, CLIP classifiers, IG captioner achieves \\(0.5\\%\\) / \\(1.6\\%\\) top-1 accuracy improvements when using the image encoder ViT-B / ViT-L. These improvements demonstrate that IG captioner is a strong zero-shot classifier as a pure generative model. We measure the correlations of the evaluation objective and the caption prior in Sec. 5.1 to validate the effectiveness of the design of IG captioner. Besides, we perform the ablation studies in Sec. 5.3 to demonstrate the efficacy of the IG evaluation on the standard captioner." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.534, + 0.757, + 0.55 + ], + "angle": 0, + "content": "4.2 Zero-shot Image-text Retrieval on MSCOCO and Flickr30K" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.56, + 0.788, + 0.671 + ], + "angle": 0, + "content": "Settings. We use the same models in Sec. 4.1 pretrained on Laion-5B to perform zero-shot image-text retrieval on MSCOCO 5K and Flickr30K 1K test sets. There are 5 captions for each image. In order to measure the recalls, we compute a similarity matrix \\(\\mathbf{M}_{a\\times b}\\) where \\(a\\) and \\(b\\) are the number of images and captions. For the CLIP classifier, \\(\\mathbf{M}_{i,j} = \\mathrm{E}_{I_i}\\cdot \\mathrm{E}_{T_j}\\), where \\(\\mathrm{E}_{T_j}\\) and \\(\\mathrm{E}_{I_i}\\) are the embeddings of the \\(i^{\\mathrm{th}}\\) image and \\(j^{\\mathrm{th}}\\) caption. For the captioner, we compute \\(\\mathbf{M}_{i,j} = \\log P(T_j|I_i)\\) while for the IG captioner, we compute \\(\\mathbf{M}_{i,j} = \\log P(T_j|I_i) - \\log P(T_j)\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Results on MSCOCO. We summarize the results on MSCOCO in Tab. 4. For the image \\(\\rightarrow\\) text retrieval, IG captioner significantly boosts the performance of a generative captioner. IG captioner shows \\(22.7\\% / 25.5\\% / 22.8\\%\\) improvements over the captioner on R@1 / R@5 and R@10 with the ViT-B image encoder, and shows \\(22.9\\% / 24.1\\% / 20.3\\%\\) improvements with the ViT-L image encoder. Furthermore, IG captioner achieves comparable performances with the CLIP classifier. The performance gaps between the IG captioner and the CLIP classifier are \\(8.9\\% / 6.6\\% / 5.0\\%\\) on R@1 / R@5 / R@10 with the ViT-B encoder. While with the ViT-L image encoder, the gaps are further decreased to \\(6.5\\% / 5.1\\% / 3.5\\%\\) on R@1 / R@5 / R@10." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "table", + "bbox": [ + 0.256, + 0.144, + 0.749, + 0.296 + ], + "angle": 0, + "content": "
modelencoderpretrain lossMSCOCO (5K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast56.380.387.538.564.774.6
captionerViT-Bgenerate24.748.259.745.168.977.5
IG captionerViT-Bgenerate47.473.782.542.967.476.1
CLIP classifierViT-Lcontrast59.383.089.542.167.977.4
captionerViT-Lgenerate29.953.865.749.272.880.8
IG captionerViT-Lgenerate52.877.986.048.571.680.2
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.297, + 0.786, + 0.325 + ], + "angle": 0, + "content": "Table 4: Zero-shot image-text retrieval on MSCOCO [5]dataset. All the models are pretrained on Laion-5B dataset." + }, + { + "type": "table", + "bbox": [ + 0.256, + 0.355, + 0.749, + 0.506 + ], + "angle": 0, + "content": "
modelencoderpretrain lossFlickr30K (1K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast85.297.298.768.288.993.6
captionerViT-Bgenerate46.973.181.572.290.894.3
IG captionerViT-Bgenerate60.690.094.770.089.393.6
CLIP classifierViT-Lcontrast88.098.399.071.190.894.7
captionerViT-Lgenerate56.682.088.177.993.196.1
IG captionerViT-Lgenerate64.793.497.776.292.695.6
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.507, + 0.787, + 0.534 + ], + "angle": 0, + "content": "Table 5: Zero-shot image-text retrieval on Flickr30K [34] dataset. All the models are pretrained on Laion-5B dataset." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.581, + 0.787, + 0.643 + ], + "angle": 0, + "content": "Interestingly, for the text \\(\\rightarrow\\) image retrieval, we find that both the captioner and IG captioner have better performances than the CLIP classifier. Since our approach is to remove the bias in the text prediction, it does not affect the text \\(\\rightarrow\\) image retrieval. We leave this for the future research." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Results on Flickr30K. The results are summarized in Tab. 4. We observe the similar phenomena on MSCOCO. For the image \\(\\rightarrow\\) text retrieval, on the one hand, IG captioner shows significant improvements over the captioner. With the ViT-B image encoder, IG captioner improves the R@1 / R@5 / R@10 by \\(13.7\\%\\) / \\(16.9\\%\\) / \\(13.2\\%\\) , and with the ViT-L image encoder, the improvements are \\(8.1\\%\\) / \\(11.4\\%\\) / \\(9.6\\%\\) . On the other hand, the performance gaps between the IG captioner and the CLIP classifier are significantly reduced. For R@1, the gaps are \\(24.6\\%\\) / \\(23.3\\%\\) with ViT-B / ViT-L image encoder. However, for R@5 / R@10, the gaps become \\(7.2\\%\\) / \\(4.0\\%\\) with ViT-B encoder, and \\(4.9\\%\\) / \\(1.3\\%\\) with ViT-L encoder. For the text \\(\\rightarrow\\) image retrieval, we observe the similar superiority of both the captioner and IG captioner over the CLIP classifier." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.543, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.144, + 0.784, + 0.346 + ], + "angle": 0, + "content": "
αImageNet-1KMSCOCO image → text (%)Flickr30K image → text (%)
top-1 acc. (%) rlogP(T),OIGR@1R@5R@10rlogP(T),OIGR@1R@5R@10rlogP(T),OIG
0.045.40.8322.044.356.20.8742.268.476.80.90
0.149.10.8024.948.360.90.8545.671.981.30.88
0.252.50.7628.853.265.00.8150.276.884.70.85
0.355.60.7033.058.268.40.7754.580.087.70.81
0.458.40.6236.761.772.60.7158.284.290.30.76
0.560.70.5240.265.775.90.6261.686.492.30.70
0.662.70.4043.269.478.80.5163.288.293.60.61
0.763.80.2546.272.080.90.3663.489.094.00.48
0.864.30.0847.473.782.50.1960.690.094.70.32
0.963.9-0.1046.473.282.50.056.189.795.80.12
1.062.9-0.2743.370.681.4-0.2150.586.794.5-0.09
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.347, + 0.788, + 0.43 + ], + "angle": 0, + "content": "Table 6: Ablations on the \\(\\alpha\\) of the IG captioner evaluation objective, \\(O_{\\mathrm{IG}} = \\log P(T|I) - \\alpha \\log P(T)\\). All the performances are reported on zero-shot tasks. The IG captioner is pretrained on the Laion-5B dataset with the ViT-B image encoder. \\(r\\) is the Pearson Correlation Coefficient (PCC). The text \\(\\rightarrow\\) image recalls for the retrieval tasks are not reported because the value of \\(\\alpha\\) does affect the image \\(\\rightarrow\\) text predictions. The best accuracies, recalls and PCCs are marked with the color SpringGreen." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.47, + 0.416, + 0.487 + ], + "angle": 0, + "content": "5 Ablation Studies" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.503, + 0.7, + 0.533 + ], + "angle": 0, + "content": "5.1 Weights of the Text Prior Removal and Correlation Measurements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.545, + 0.788, + 0.697 + ], + "angle": 0, + "content": "Settings. In this section, we ablate the \\(\\alpha\\) in the evaluation objective of IG captioner, \\(\\log P(T|I) - \\alpha \\log P(T)\\). We use the same training and evaluation settings as the main experiments. We pretrain the IG captioner with the ViT-B encoder on the Laion-5B dataset and perform zero-shot ImageNet classification and zero-shot image-text retrieval on MSCOCO and Flickr30K. We ablation the \\(\\alpha\\) from 0.0 to 1.0 with a step size 0.1. For the retrieval tasks, we do not list the text \\(\\rightarrow\\) image recalls because the value of \\(\\alpha\\) does not affect the predictions of text \\(\\rightarrow\\) image retrieval. In order to validate our goal of removing the bias from text priors, we report the Pearson Correlation Coefficient (PCC) of \\(\\log P(T)\\) and the evaluation objective when varying the value of \\(\\alpha\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Results. We summarize the results in Tab. 6. On the one hand, the smaller correlation between \\(\\log P(T|I)\\) and \\(\\log P(T)\\) generally corresponds to better performances. For the ImageNet classification, when \\(\\alpha = 0.08\\), the best PCC 0.08 and performance \\(64.3\\%\\) are achieved at the same time. For the retrieval tasks on MSCOCO / Flickr30K, the best PCC, \\(0.0 / 0.12\\), and the highest R@10, \\(82.5\\% / 95.8\\%\\), are obtained simultaneously with \\(\\alpha = 0.9\\). On the other hand, it requires a degree of text priors to achieve the best fine-grained performances on specific datasets. The highest R@1, \\(47.4\\% / 63.4\\%\\), correspond to the PCC, \\(0.19 / 0.48\\)," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "table", + "bbox": [ + 0.299, + 0.144, + 0.704, + 0.234 + ], + "angle": 0, + "content": "
approachencodereval obj ↑top-1 acc. (%)
LM + CapViT-Blog Pθ(T|I) - log Pψ(T)64.0
IG captionerViT-Blog Pθ(T|I) - log Pθ(T)64.3
LM + CapViT-Llog Pθ(T|I) - log Pψ(T)68.9
IG captionerViT-Llog Pθ(T|I) - log Pθ(T)69.8
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.235, + 0.788, + 0.304 + ], + "angle": 0, + "content": "Table 7: Approach ablations on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. LM + Cap stands for the approach that uses an unimodal Language Model (LM) and a standard multimodal captioner (Cap). The LM is trained with the captions only. \\(\\psi\\) represents the parameters of the LM while \\(\\theta\\) the parameters of the Cap." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.349, + 0.788, + 0.442 + ], + "angle": 0, + "content": "on MSCOCO / Flickr30K. \\(\\alpha = 0.0\\) corresponds to the bad strong correlations, resulting in the poor performances. \\(\\alpha = 1.0\\) causes the negative correlations and produces the unsatisfying performances. According to the ImageNet classification results with ViT-B encoder, we set \\(\\alpha = 0.8\\) for all experiments in this paper. For the ImageNet classification with ViT-L encoder and all the image-text retrieval tasks, we do not change this \\(\\alpha\\)." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.467, + 0.681, + 0.484 + ], + "angle": 0, + "content": "5.2 Language Model + Captioner versus IG Captioner" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.497, + 0.788, + 0.59 + ], + "angle": 0, + "content": "Settings. IG captioner has a text decoder that is able to predict both \\(\\log P(T|I)\\) and \\(\\log P(T)\\). One variant of IG captioner consists of a pair of models. One of them is the unimodal Language Model (LM) to predict \\(\\log P(T)\\). The other one is the multimodal captioner, a standard captioner to predict \\(\\log P(T|I)\\). During inference, the prediction is based on the subtraction of their outputs. We call this LM + Cap approach." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.615, + 0.788, + 0.693 + ], + "angle": 0, + "content": "Results. We report the results in Tab. 7. It is observed that the LM + Cap approach performs worse than the IG captioner. Besides, it is less efficient due to the extra language model. From another perspective, it demonstrates that the text decoder of IG captioner is able to perform both the multimodal and unimodal tasks well." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.719, + 0.381, + 0.735 + ], + "angle": 0, + "content": "5.3 IG Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Settings. IG captioner differs from a standard captioner in both the training and evaluation phases. In this section, we study whether the IG evaluation will improve a standard captioner as a classifier. The IG evaluation requires the prediction of \\(\\log P(T)\\). Since the standard captioner can not directly predict this, we feed the captioner zero-intensity images to compute \\(\\log P(T|\\mathbf{0})\\) as the approximation." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.542, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.145, + 0.782, + 0.238 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.244, + 0.788, + 0.329 + ], + "angle": 0, + "content": "Fig. 5: Ablations of the Information Gain (IG) evaluation on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. Captioner + IG eval uses the evaluation objective, \\(\\log P(T|I) - \\alpha \\log P(T|\\mathbf{0})\\). \\(\\log P(T|\\mathbf{0})\\) is the prediction of the captioner with the input being the zero-intensity image. It is used to approximate \\(\\log P(T)\\), because the standard captioner after training is not able to directly predict \\(\\log P(T)\\)." + }, + { + "type": "table", + "bbox": [ + 0.24, + 0.359, + 0.766, + 0.43 + ], + "angle": 0, + "content": "
generative classifiermodel typepretrain dataparamstop-1 acc. (%)
Imagen [7,41]text-to-imageL5B + Psy2B62.7
Stable Diffusion 2.0 [19,40]text-to-imageL5B1.45B61.4
IG captionerimage-to-textL5B1.07B69.8
" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.43, + 0.784, + 0.459 + ], + "angle": 0, + "content": "Table 8: Comparisons of generative classifiers on zero-shot ImageNet classification. L5B and Psy represent the Laion-5B dataset and a proprietary dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.505, + 0.788, + 0.583 + ], + "angle": 0, + "content": "Results. We show the results in Tab. 5. The IG evaluation is able to significantly improve the performance of the captioners. Specifically, with the ViT-B / ViT-L image encoder, IG evaluation increases the zero-shot top-1 ImageNet classification accuracy by \\(9.0\\%\\) / \\(7.9\\%\\). Adding the training part of IG captioner, the performances will be further improved by \\(10.7\\%\\) / \\(10.2\\%\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.616, + 0.698, + 0.632 + ], + "angle": 0, + "content": "5.4 Comparisons to Text-to-image Generative Classifiers" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.654, + 0.788, + 0.716 + ], + "angle": 0, + "content": "Settings. There are two kinds of vision-language generative models: text-to-image generative models and image-to-text captioners. There have been recent works [7,19] that successfully convert the large text-to-image diffusion models to the zero-shot generative classifiers. We compare IG captioner with these models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Results. The results are summarized in Tab. 8. With the same or smaller amount of pretraining data, IG captioner demonstrates the best performances. Compared with the Text-to-Image Classifiers [7] and Diffusion Classifier [19] usingImagen [41] and Stable Diffusion [40], respectively, IG captioner shows \\(7.1\\%\\) / \\(8.4\\%\\) zero-shot top-1 accuracy improvements on ImageNet. Besides, IG captioner is a more compact model and only uses \\(53.5\\%\\) / \\(73.8\\%\\) of their parameters." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.144, + 0.497, + 0.234 + ], + "angle": 0, + "content": "
training loss weightstop-1 acc. (%)
β: log P(T|I) γ: log P(T)
1.01.063.0
1.50.564.3
1.90.162.8
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.235, + 0.479, + 0.346 + ], + "angle": 0, + "content": "Table 9: Ablations of the training loss weights on zero-shot ImageNet classification. The performances are obtained from the IG captioners trained on the Laion-5B dataset with ViT-B encoder. \\(\\beta\\) and \\(\\gamma\\) are the weights of the multimodal and unimodal training objectives in Eqn. (6)" + }, + { + "type": "table", + "bbox": [ + 0.527, + 0.154, + 0.788, + 0.226 + ], + "angle": 0, + "content": "
modelsVQAv2 test-standard acc. (%)
CLIPN/A
captioner74.5
IG captioner75.2
" + }, + { + "type": "table_caption", + "bbox": [ + 0.527, + 0.226, + 0.788, + 0.308 + ], + "angle": 0, + "content": "Table 10: Generative evaluation on VQAv2. All the models are pretrained on the Laion-5B dataset with ViT-L encoder and fine-tuned on the VQAv2 dataset. CLIP can not perform the VQA task as a discriminative model." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.385, + 0.741, + 0.402 + ], + "angle": 0, + "content": "5.5 Weights of the Multimodal and Unimodal Training Losses" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.408, + 0.789, + 0.533 + ], + "angle": 0, + "content": "Settings and Results. We ablate the multimodal loss weight \\(\\beta\\) and the unimodal loss weight \\(\\gamma\\) in the training objective of IG captioner (Eqn. (6)). We train the IG captioners with ViT-B encoder on the Laion-5B dataset and evaluate them on zero-shot ImageNet classification. The results are shown in Tab. 9. The equal weights do not produce the optimal results. We notice that image encoder is only trained with the multimodal loss while the text decoder is supervised by both the losses. We set the multimodal loss weight \\(\\beta = 1.5\\) and the unimodal loss \\(\\gamma = 0.5\\) for all the other experiments." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.55, + 0.585, + 0.567 + ], + "angle": 0, + "content": "5.6 Generative Evaluation of IG Captioner" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.572, + 0.789, + 0.664 + ], + "angle": 0, + "content": "Settings and Results. We evaluate the generative capability of IG captioner in this section. Specifically, after pertaining on the Laion-5B dataset, we perform the generative fine-tuning on the VQAv2 dataset. The results are shown in Tab. 10. The IG captioner outperforms the captioner, showing that the information gain approach improves the captioner in both discriminative and generative tasks." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.685, + 0.36, + 0.701 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.714, + 0.788, + 0.79 + ], + "angle": 0, + "content": "In this paper, we address the challenge of using a generative captioner for zero-shot classification tasks. We identify and mitigate the issue of linguistic priors dominating visual signals by introducing the Information Gain (IG) captioner with novel training and evaluation methods. Our results show that the IG captioner is an effective zero-shot classifier." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.808, + 0.84 + ], + "angle": 0, + "content": "Acknowledgements We gratefully acknowledge supports from ONR with N00014-23-1-2641." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.542, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.218 + ], + "angle": 0, + "content": "1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.219, + 0.785, + 0.272 + ], + "angle": 0, + "content": "2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. Advances in neural information processing systems 35, 23716-23736 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.273, + 0.785, + 0.314 + ], + "angle": 0, + "content": "3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A versatile vision-language model for understanding, localization, text reading, and beyond (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.315, + 0.785, + 0.357 + ], + "angle": 0, + "content": "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.357, + 0.785, + 0.398 + ], + "angle": 0, + "content": "5. Chen, X., Fang, H., Lin, T.Y., Vedantam, R., Gupta, S., Dollar, P., Zitnick, C.L.: Microsoft coco captions: Data collection and evaluation server. arXiv preprint arXiv:1504.00325 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.398, + 0.785, + 0.426 + ], + "angle": 0, + "content": "6. Church, K., Hanks, P.: Word association norms, mutual information, and lexicography. Computational linguistics 16(1), 22-29 (1990)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.785, + 0.453 + ], + "angle": 0, + "content": "7. Clark, K., Jaini, P.: Text-to-image diffusion models are zero-shot classifiers. arXiv preprint arXiv:2303.15233 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.453, + 0.785, + 0.495 + ], + "angle": 0, + "content": "8. Dai, W., Li, J., Li, D., Tiong, A.M.H., Zhao, J., Wang, W., Li, B., Fung, P., Hoi, S.: Instructblip: Towards general-purpose vision-language models with instruction tuning (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.495, + 0.785, + 0.536 + ], + "angle": 0, + "content": "9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.536, + 0.785, + 0.591 + ], + "angle": 0, + "content": "10. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.591, + 0.785, + 0.633 + ], + "angle": 0, + "content": "1. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.633, + 0.785, + 0.688 + ], + "angle": 0, + "content": "2. Ge, Y., Zeng, X., Huffman, J.S., Lin, T.Y., Liu, M.Y., Cui, Y.: Visual fact checker: Enabling high-fidelity detailed caption generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14033-14042 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.688, + 0.785, + 0.702 + ], + "angle": 0, + "content": "3. te Grotenhuis, M., Matthijssen, A.: Basic SPSS tutorial. Sage Publications (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.702, + 0.785, + 0.73 + ], + "angle": 0, + "content": "4. He, H., Peng, N., Liang, P.: Pun generation with surprise. arXiv preprint arXiv:1904.06828 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.73, + 0.785, + 0.757 + ], + "angle": 0, + "content": "5. Hinton, G.E.: To recognize shapes, first learn to generate images. Progress in brain research 165, 535-547 (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.757, + 0.785, + 0.785 + ], + "angle": 0, + "content": "6. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.785, + 0.812 + ], + "angle": 0, + "content": "7. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.812, + 0.785, + 0.84 + ], + "angle": 0, + "content": "8. Huang, S., Dong, L., Wang, W., Hao, Y., Singhal, S., Ma, S., Lv, T., Cui, L., Mohammed, O.K., Liu, Q., Aggarwal, K., Chi, Z., Bjorck, J., Chaudhary, V., Som," + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "C. Yang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.241, + 0.147, + 0.786, + 0.175 + ], + "angle": 0, + "content": "S., Song, X., Wei, F.: Language is not all you need: Aligning perception with language models. ArXiv abs/2302.14045 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.786, + 0.202 + ], + "angle": 0, + "content": "19. Li, A.C., Prabhudesai, M., Duggal, S., Brown, E., Pathak, D.: Your diffusion model is secretly a zero-shot classifier. arXiv preprint arXiv:2303.16203 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.203, + 0.787, + 0.255 + ], + "angle": 0, + "content": "20. Li, B., Zhang, K., Zhang, H., Guo, D., Zhang, R., Li, F., Zhang, Y., Liu, Z., Li, C.: Llava-last: Stronger llms supercharge multimodal capabilities in the wild (May 2024), https://llava-v1.github.io/blog/2024-05-10-llava-last-stronger-llms/" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.257, + 0.786, + 0.284 + ], + "angle": 0, + "content": "21. Li, J., Galley, M., Brockett, C., Gao, J., Dolan, B.: A diversity-promoting objective function for neural conversation models. arXiv preprint arXiv:1510.03055 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.285, + 0.786, + 0.324 + ], + "angle": 0, + "content": "22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. In: International conference on machine learning. pp. 19730-19742. PMLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.326, + 0.786, + 0.365 + ], + "angle": 0, + "content": "23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International conference on machine learning. pp. 12888-12900. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.367, + 0.786, + 0.405 + ], + "angle": 0, + "content": "24. Li, X.L., Holtzman, A., Fried, D., Liang, P., Eisner, J., Hashimoto, T., Zettlemoyer, L., Lewis, M.: Contrastive decoding: Open-ended text generation as optimization. arXiv preprint arXiv:2210.15097 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.407, + 0.786, + 0.447 + ], + "angle": 0, + "content": "25. Liu, A., Sap, M., Lu, X., Swayamdipta, S., Bhagavatula, C., Smith, N.A., Choi, Y.: Dexperts: Decoding-time controlled text generation with experts and anti-experts. arXiv preprint arXiv:2105.03023 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.448, + 0.786, + 0.473 + ], + "angle": 0, + "content": "26. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.475, + 0.786, + 0.514 + ], + "angle": 0, + "content": "27. Liu, H., Li, C., Li, Y., Li, B., Zhang, Y., Shen, S., Lee, Y.J.: Llava-last: Improved reasoning,OCR,and world knowledge (January 2024),https://llava-v1.github.io/blog/2024-01-30-llava-last/" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.516, + 0.786, + 0.541 + ], + "angle": 0, + "content": "28. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.543, + 0.786, + 0.581 + ], + "angle": 0, + "content": "29. Ng, A., Jordan, M.: On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. Advances in neural information processing systems 14 (2001)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.583, + 0.786, + 0.622 + ], + "angle": 0, + "content": "30. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.624, + 0.786, + 0.649 + ], + "angle": 0, + "content": "31. OpenAI: Gpt-4 technical report. ArXiv abs/2303.08774 (2023), https://arxiv.org/abs/2303.08774" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.65, + 0.786, + 0.676 + ], + "angle": 0, + "content": "32. Pearson, K.: VII. note on regression and inheritance in the case of two parents. proceedings of the royal society of London 58(347-352), 240-242 (1895)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.677, + 0.786, + 0.716 + ], + "angle": 0, + "content": "33. Peng, Z., Wang, W., Dong, L., Hao, Y., Huang, S., Ma, S., Wei, F.: Kosmos-2: Grounding multimodal large language models to the world. arXiv preprint arXiv:2306.14824 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.718, + 0.786, + 0.771 + ], + "angle": 0, + "content": "34. Plummer, B.A., Wang, L., Cervantes, C.M., Caicedo, J.C., Hockenmaier, J., Lazebnik, S.: Flickr30k entities: Collecting region-to-phrase correspondences for richer image-to-sentence models. In: Proceedings of the IEEE international conference on computer vision. pp. 2641-2649 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.773, + 0.758, + 0.785 + ], + "angle": 0, + "content": "35. Quinlan, J.R.: Induction of decision trees. Machine learning 1, 81-106 (1986)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.786, + 0.786, + 0.84 + ], + "angle": 0, + "content": "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.542, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Information-Gain Captioner" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents, 2022. URL https://arxiv.org/abs/2204.061257 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.787, + 0.218 + ], + "angle": 0, + "content": "38. Ranzato, M., Susskind, J., Mnih, V., Hinton, G.: On deep generative models with applications to recognition. In: CVPR 2011. pp. 2857-2864. IEEE (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.218, + 0.787, + 0.272 + ], + "angle": 0, + "content": "39. Reid, M., Savinov, N., Teplyashin, D., Lepikhin, D., Lillicrap, T., Alayrac, J.b., Soricut, R., Lazaridou, A., First, O., Schrittwieser, J., et al.: Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context. arXiv preprint arXiv:2403.05530 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.273, + 0.787, + 0.314 + ], + "angle": 0, + "content": "40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.315, + 0.787, + 0.357 + ], + "angle": 0, + "content": "41. Sahara, C., Chan, W., Chang, H., Lee, C., Ho, J., Salimans, T., Fleet, D., Norouzi, M.: Palette: Image-to-image diffusion models. In: ACM SIGGRAPH 2022 Conference Proceedings. pp. 1-10 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.357, + 0.787, + 0.412 + ], + "angle": 0, + "content": "42. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.412, + 0.787, + 0.467 + ], + "angle": 0, + "content": "43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.467, + 0.787, + 0.509 + ], + "angle": 0, + "content": "44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.509, + 0.787, + 0.55 + ], + "angle": 0, + "content": "45. Su, Y., Lan, T., Wang, Y., Yogatama, D., Kong, L., Collier, N.: A contrastive framework for neural text generation. Advances in Neural Information Processing Systems 35, 21548-21561 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.55, + 0.787, + 0.592 + ], + "angle": 0, + "content": "46. Team, G., Anil, R., Borgeaud, S., Wu, Y., Alayrac, J.B., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., et al.: Gemini: a family of highly capable multimodal models. arXiv preprint arXiv:2312.11805 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.592, + 0.787, + 0.633 + ], + "angle": 0, + "content": "47. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.633, + 0.787, + 0.688 + ], + "angle": 0, + "content": "48. Wang, P., Yang, A., Men, R., Lin, J., Bai, S., Li, Z., Ma, J., Zhou, C., Zhou, J., Yang, H.: Ofa: Unifying architectures, tasks, and modalities through a simple sequence-to-sequence learning framework. In: International conference on machine learning. pp. 23318-23340. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.689, + 0.787, + 0.73 + ], + "angle": 0, + "content": "49. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.73, + 0.787, + 0.772 + ], + "angle": 0, + "content": "50. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.772, + 0.787, + 0.813 + ], + "angle": 0, + "content": "51. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.813 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_origin.pdf b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..841badf6d48b84a47a8301932fda19a418ddfd48 --- /dev/null +++ b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/a2380845-e30a-41d2-b780-f5170e99303a_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1e7a15400866563e5a885b1418817cbd3c228c3febb5d89c1456021cb2ef0184 +size 788296 diff --git a/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/full.md b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/full.md new file mode 100644 index 0000000000000000000000000000000000000000..6d53da215ce696b708457c0e106f90268d8c37ce --- /dev/null +++ b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/full.md @@ -0,0 +1,297 @@ +# IG Captioner: Information Gain Captioners are Strong Zero-shot Classifiers + +Chenglin Yang $^{1}$ , Siyuan Qiao $^{2}$ , Yuan Cao $^{2}$ , Yu Zhang $^{2}$ , Tao Zhu $^{2}$ , Alan Yuille $^{1}$ , and Jiahui Yu $^{2}$ + +1 Johns Hopkins University 2 Google DeepMind + +DOG = "A photo of a west highland white terrier" +HORSE = "A photo of a common sorrel horse" + +Language Model Output + +$\log P(\mathrm{DOG}) = -3.3$ $\log P(\mathrm{HORSE}) = -4.$ + +(a) Linguistic prior + +![](images/be7d9c5a7d0461075970e412a91daef8647b99be06512df5345b56b179aaa8e8.jpg) +Fig. 1: The prediction of a captioner-based classifier is influenced by the linguistic priors in pure text modality. The Information Gain (IG) evaluation reduces such impact and makes the predictions more grounded on the visual inputs. We illustrate with real predictions on zero-shot ImageNet [9] classification in this figure. (a) The language model was trained on Laion-5B [43] captions only. (b) The captioner was trained on the Laion-5B dataset with both the images and captions. The IG evaluation in (b) uses the outputs of both the captioner and the language model in (a). + +Abstract. Generative training has been demonstrated to be powerful for building visual-language models. However, on zero-shot discriminative benchmarks, there is still a performance gap between models trained with generative and discriminative objectives. In this paper, we aim to narrow this gap by improving the efficacy of generative training on classification tasks, without any finetuning processes or additional modules. Specifically, we focus on narrowing the gap between the generative captioner and the CLIP classifier. We begin by analysing the predictions made by the captioner and classifier and observe that the caption generation inherits the distribution bias from the language model trained with pure text modality, making it less grounded on the visual signal. To tackle this problem, we redesign the scoring objective for the captioner to alleviate the distributional bias and focus on measuring the gain of information brought by the visual inputs. We further design a generative training objective to match the evaluation objective. We name our model trained and evaluated from the novel procedures as Information Gain (IG) captioner. We pretrain the models on the public Laion-5B dataset and perform a series of discriminative evaluations. For the zero-shot classification on ImageNet, IG captioner achieves $>18\%$ + +improvements over the standard captioner, achieving comparable performances with the CLIP classifier. IG captioner also demonstrated strong performance on zero-shot image-text retrieval tasks on MSCOCO and Flickr30K. We hope this paper inspires further research towards unifying generative and discriminative training procedures for visual-language models. + +# 1 Introduction + +Generative training has been shown to be highly effective for both the language [4] and vision models [16, 44]. These generative models demonstrate remarkable zero-shot generation capabilities and have led to the developments of many impressive AI applications [31, 40]. On the other hand, discriminative training is still an effective procedure for building the large vision-language models like CLIP [36] and CoCa [49]. Models trained with discriminative objectives naturally performs strongly on discriminative tasks like classification. + +The inconsistent setups between generative and discriminative training raises an intriguing topic, which we aim to address in this paper: Can generative training procedure also perform well on zero-shot discriminative tasks? Concretely, we study the performance gap between generative captioners and discriminative models on zero-shot classification tasks, and propose novel approaches to narrow the gap. + +To obtain an effective zero-shot generative classifier, we start with evaluating a standard generative captioner with the Maximum Likelihood Estimation (MLE) objective on classification tasks. Specifically, we pretrain a captioner on the public Laion-5B [43] dataset and evaluate it on the ImageNet [9]. We also pretrain a CLIP classifier with the same experimental setting. We observe a large performance gap between the captioner and the CLIP classifier. We find that the predictions of the captioner are less grounded on the visual inputs. Instead, they are biased by the linguistic priors, which is illustrated in Fig. 1. These observations indicate that we should discount the influence by predictions from pure text modality in multimodal generative classification setup. + +To deal with this problem, we propose an Information Gain (IG) evaluation objective, as depicted in Fig. 2. This objective demonstrates a significant performance boost on top of a captioner trained with conventional procedure. Furthermore, we propose a generative training objective to match the IG evaluation. We name the captioner, trained and evaluated with our proposed objectives, as Information Gain (IG) captioner. We pretrain the models on the Laion-5B dataset and evaluate multiple zero-shot discriminative tasks. All the models have the same training and evaluation settings to ensure the fair comparisons. For zero-shot ImageNet classification, IG captioner with ViT-B/ViT-L [10] image encoder shows $19.7\% / 18.1\%$ improvements on top-1 accuracy over the standard captioner. It is even better than the CLIP classifier by $0.5\% / 1.6\%$ top-1 accuracy. For zero-shot image-text retrieval on MSCOCO [5] dataset, IG captioner demonstrates $>22\%$ accuracy improvements on all of image-to-text R@1, R@5 + +![](images/b6806dd5d58c4919e0aac9f56c0414a855deb161150960533dfbf0fc68fce31f.jpg) +Fig. 2: The inference pipeline of IG captioner. $I$ and $T$ represent the input image and caption. IG captioner consists of a image encoder and a text decoder. The text decoder is able to provide both the multimodal and unimodal predictions. The unimodal predictions can be cached for different input images. Both the image and object classes are from the ImageNet dataset. + +![](images/45d7b69921891430d017b79fdcacb9763f31b55994697f9d27524fc96216701a.jpg) + +and R@10 over the captioner, significantly reducing the gap from the captioner to the CLIP classifier. Interestingly, we observe the superior performances on text-to-image recalls of both the captioner and IG captioner over the CLIP classifier. The superiority of IG captioner is also demonstrated on Flickr30K [34] dataset. + +Our main contributions can be summarized in the following: + +- We convert a generative captioner into a zero-shot classifier. We identify the root cause of its poor performance and observe that its predictions are negatively influenced by the linguistic priors and less grounded on the visual inputs. +- We propose the Information Gain (IG) method to evaluate a generative classifier. We demonstrate that the IG evaluation is able to significantly improve its performance without any changes in the training process. +- To couple with the IG evaluation, we propose a generative training objective to further boost the performance of the generative classifier which we name Information Gain (IG) captioner. +- We show that IG captioner is a strong zero-shot classifier, evidenced by the significant improvements over the captioner and comparable performance with the CLIP classifier on the zero-shot ImageNet classification, MSCOCO and Flickr30K image-text retrieval tasks. + +# 2 Related Work + +Text-to-image Generative Classifiers. The classic approach [15,38] of using generative models to perform recognition tasks is the Bayes algorithm [29]. During training, this algorithm models the data distribution while during inference, it provides predictions by solving a maximum likelihood estimation (MLE) problem. Recently, there have been the methods [7,19] proposed to convert the text-to-image diffusion models, Stable Diffusion [40] or Imagen [41], into a zero-shot classifier using the Bayes algorithm. + +The focus of IG captioner is different with these previous arts. First, we explore the possibility of achieving a good classifier solely through the generative training, instead of how to convert a generative model into a classifier. The Stable Diffusion used by the above diffusion model classifiers [7, 19] is not suitable for our goal because it uses the CLIP text encoder pretrained with contrastive loss to provide the text guidance. Second, we identify the negative impact of the text priors inherited from the pretraining data and propose methods to reduce this impact for zero-shot classification tasks. Besides, IG captioner is an image-to-text generative captioner. We also perform the comparisons in Tab. 8. + +Classifier-Free Guidance (CFG). CFG [17] is an important approach to improving the sample quality of text-to-image generative models [11,30,37,42, 50]. During training, CFG requires the model to generate images both with and without text conditions. During inference, the output image is sampled according to a linear combination of both the conditional and unconditional predictions to improve text-image alignment, which relates CFG to IG captioner from a high level. In contrast, IG captioner is an image-to-text captioner that uses the probability gain from unconditionally to conditionally generating captions with the aim of reducing the bias from text priors for zero-shot classification tasks. + +Contrast in Text Generation. In the field of text generation, researchers have been investigating the use of contrast, including avoiding the text degeneration and undesirable repetitions [45], generating pan sentences [14], and language detoxification [25]. Contrastive decoding [24] uses the log-likelihood difference between a large expert and a small amateur model to improve the quality of the open-ended text generation. Li et al. [21] propose to use the mutual information between an input message and its responses as the decoding objective to avoid the generic and meaningless conversations. Differently, in this paper, IG captioner uses the Information Gain (IG) to address the problem of evaluating a vision-language generative model as a zero-shot classifier. Importantly, the IG evaluation is used to mitigate the negative influence of linguistic priors inherited from the pretraining dataset. + +Image-to-text Multimodal Language Models. Multimodal language models have become the dominant approaches for image captioning, including OFA [48], Flamingo [2], BLIP [22, 23], CoCa [49], LLaVA [26, 28], MiniGPT-4 [51], InstructBLIP [8], Kosmos [18, 33], Qwen-VL [3], VFC [12], LLaVA-NeXT [20, 27], Gemini [39, 46], and GPT-4 [1]. Differently, IG captioner demonstrates the potential of pure generative training on discriminative tasks using public datasets. + +# 3 Method + +In this section, we introduce Information Gain (IG) captioner. First, we illustrate how to evaluate a conventional captioner on the zero-shot classification task and diagnose its problem. Second, we propose an evaluation approach using the information gain to tackle the problem. Third, we design a training objective to couple with the IG evaluation. Combining the above evaluation and training procedures, we propose IG captioner. + +# 3.1 Evaluating Captioners on Discriminative Tasks + +A captioner is a generative model that generates caption for a given image. It is by nature not trained as a classifier and its output can not be used directly for such tasks like image classification or image-text retrieval. Therefore, to evaluate a captioner on discriminative tasks, we need to adapt the evaluation procedure. + +Maximum Likelihood Estimation (MLE) Objective. Let $I \in \mathbb{R}^{H \times W \times 3}$ , $T \in \mathbb{R}^{N \times D}$ and $t \in \mathbb{R}^D$ be the image, caption and the word in the caption, where $H$ , $W$ are the height and width of the image and $N$ , $D$ are the number of text tokens and the token dimension. A captioner is a function $F_{\theta}: I \to T$ where $\theta$ is the model parameter. + +Discriminative tasks require the model to pick the most appropriate text from a set of candidates $C = \{T_i\}$ to describe an image, where $i$ is the index of captions. During inference, the standard MLE evaluation objective is: + +$$ +\underset {i} {\arg \max } [ \log P (T _ {i} | I) ] \tag {1} +$$ + +We omit the normalization factor $1 / N_{i}$ when calculating the evaluation objectives throughout this paper for simplicity. $N_{i}$ is the token length of the $t^{\mathrm{th}}$ caption. + +Low Performance Using MLE Objective. To study the effectiveness of MLE as objective, we pretrain a captioner on Laion-5B and use it to perform zero-shot ImageNet classification. We set up a strong baseline: a CLIP classifier which is pretrained with contrastive loss and tailored for classification tasks. The captioner has a image encoder and a text decoder while the CLIP classifier has a image encoder and a text encoder. Both of them have the same model size, training and evaluation settings to ensure fair comparisons. The results are shown in Tab. 1. When directly using the MLE objective (Eqn. (1)) the captioner shows $>19\%$ top-1 accuracy degradation compared with the CLIP classifier. + +Result Analysis of MLE Evaluation. Since the captioner is a vision-language model, we are interested in understanding how much visual information is provided by the visual inputs and utilized by the model. We pretrain a language model that has the same architecture as the text decoder of the captioner. + +
modelspretrain losszero-shot IN acc. (%)
CLIP classifiercontrast63.8
captionergenerate44.6
+ +Table 1: The large performance gap between the standard captioner and the CLIP classifier on zero-shot ImageNet classification. All the models are trained with the Laion-5B dataset. The CLIP classifier is trained with contrastive loss while the captioner with generative loss. The CLIP classifier has a 12-layer image encoder and a 12-layer text encoder and the captioner has a 12-layer image encoder and a 12-layer text decoder. + +
variable 1variable 2rvar1, var2
log P(T)log P(T|I)0.77
log P(T)log P(T|I) - log P(T)-0.39
+ +Table 2: Mean Pearson Correlation Coefficient (PCC) measurements of zero-shot predictions on ImageNet. $\log P(T)$ is predicted by the unimodal language model which is trained with the Laion-5B captions. $\log P(T|I)$ is predicted by the standard captioner trained with both the Laion-5B images and captions. Given one image, there are 80K (1K classes, 80 prompts) observations of these two variables to compute the PCC. The mean PCC is obtained by averaging the PCC on 50K ImageNet validation images. + +It models the captions in the Laion-5B dataset and is able to predict $\log P(T)$ . There are 1K classes on ImageNet and for each class we use the 80 prompts proposed by CLIP. In total, there are 80K unique captions. Given an image $I$ , we consider $\log P(T|I)$ and $\log P(T)$ as two variables and compute their Pearson correlation coefficient (PCC) [13, 32] with 80K observations in Tab. 2. We observe a strong correlation between $\log P(T|I)$ and $\log P(T)$ , which indicates that the captioner is strongly biased by the text priors and tends to ignore the visual information. The correlation is also visualized in Fig. 3. + +# 3.2 Evaluating Captioners with the Information Gain (IG) + +To alleviate the problem of strong correlation between caption likelihood conditioned on the image and caption priors, we tun to the following evaluation objective: + +$$ +\underset {i} {\arg \max } \left[ \log \frac {P \left(T _ {i} \mid I\right)}{P \left(T _ {i}\right)} \right] \tag {2} +$$ + +Intuitively, this log-ratio measures the likelihood gain of the text $T_{i}$ given the image $I$ . It is called pointwise mutual information [6]. The expectation of it over all the texts $T$ is the information gain [35]. In this paper, we refer to pointwise mutual information as information gain. + +We measure the correlation of $\log P(T_i)$ and $[\log P(T_i|I) - \log P(T_i)]$ in Tab. 2. It shows that the correlation is significantly reduced. Using this objective, we + +![](images/897e100f50c7016be85f2696aa0ef15feb7226e21d2dc5d07d1d2fe94599fd7a.jpg) +Fig. 3: See correlations between the green line $(- \log P(T|I))$ and the orange line $(- \log P(T))$ on zero-shot ImageNet classification. $\log P(T|I)$ is predicted by a multimodal captioner trained on the Laion-5B dataset. $\log P(T)$ is predicted by an unimodal language model trained on the Laion-5B captions only. 100 ImageNet classes are randomly sampled due to the limited space. The numerical correlation measurements between $\log P(T|I)$ and $\log P(T)$ for the whole 1000 classes are shown in Tab. 2. + +observe the performance gain in our ablation studies in Sec. 5.1. However, we notice that this quantity is negatively correlated with the caption priors, which is expected due to the existence of term $-\log P(T_i)$ in Eqn. (2). + +To deal with this negative correlation problem, we further propose the following evaluation objective: + +$$ +\underset {i} {\arg \max } [ \log P (T _ {i} | I) - \alpha \log P (T _ {i}) ] \tag {3} +$$ + +where $\alpha \in [0,1]$ adjusts the degree of the text prior removal. Our thorough ablation study on $\alpha$ can be found in Sec. 5.1. + +# 3.3 Training Information Gain Captioners + +Without any changes on the training process, we observe the performance improvement of the captioner on the zero-shot classification task when using IG evaluation, which is shown in Sec. 5.3. But in order to keep the training and evaluation consistent, we propose a two-objective approach to train the captioner, which is illustrated in Fig. 4. + +The first objective is the standard generative loss. Given an image, it supervises the captioner to predict the words of its caption in an autoregressive way: + +$$ +l _ {\text {m u l t i m o d a l}} = \frac {1}{B} \sum_ {i = 1} ^ {B} \frac {1}{N ^ {i}} \sum_ {n = 1} ^ {N ^ {i}} \log \frac {1}{P \left(t _ {t} ^ {i} \mid t _ {1 : n - 1} ^ {i} , I ^ {i}\right)} \tag {4} +$$ + +where $i$ is the index of a image-text pair $(I^i, T^i)$ in one batch of size $B$ . $N^i$ is the text token length. Since this objective models the probability of a caption conditioned on an image, we call this objective the multimodal loss. + +![](images/6e58cb3c095cf7b31b87674c0acef5cc0b8131b0204a13a4af364c10c53d6b72.jpg) +Fig. 4: The training pipeline of IG captioner. IG captioner has two modes. Without any given images, IG captioner is an unimodal language model. When given an input image, IG captioner becomes the multimodal captioner that models the conditional probability of its caption. The image and caption are from the Laion-5B dataset. + +The second objective makes the captioner an autoregressive language model that is able to generate captions without given any image: + +$$ +l _ {\text {u n i m o d a l}} = \frac {1}{B} \sum_ {i = 1} ^ {B} \frac {1}{N ^ {i}} \sum_ {n = 1} ^ {N ^ {i}} \log \frac {1}{P \left(t _ {n} ^ {i} \mid t _ {1 : n - 1} ^ {i}\right)} \tag {5} +$$ + +We call this objective the unimodal loss. + +Finally, we combine the above two losses in the following: + +$$ +L = \beta l _ {\text {m u l t i m o d a l}} + \gamma l _ {\text {u n i m o d a l}} \tag {6} +$$ + +where $\beta$ and $\gamma$ are the weights for each loss. We perform an ablation study on the loss weights in Sec. 5.5. We name the captioner which is trained and evaluated with our proposed objectives IG captioner. + +# 4 Experiments + +# 4.1 Zero-shot ImageNet classification + +Settings. We use the English subset of the public Laion-5B [43] dataset as the pretraining dataset for all experiments. After pretraining, we perform zero-shot image classification on the ImageNet [9] validation dataset. There are 1000 classes in this validation set and each class has 50 images. We build the captioner and IG captioner with an image encoder and a text decoder, and build the CLIP [36] classifier with an image encoder and a text encoder. All the models consist of standard transformer blocks [47]. We set the layer number of image encoder and text decoder / text encoder the same. We use a batch size 4096 for all the experiments. During evaluation, we follow CLIP to use 80 prompts for each class. We use the voting mechanism to combine the predictions from different prompts for the captioner and IG captioner. All the training and evaluation procedures are the same to ensure fair comparisons. + +
modelencoderpretrain losstop-1 acc. (%)
CLIP classifierViT-Bcontrast63.8
captionerViT-Bgenerate44.6
IG captionerViT-Bgenerate64.3
CLIP classifierViT-Lcontrast68.2
captionerViT-Lgenerate51.7
IG captionerViT-Lgenerate69.8
+ +Table 3: Zero-shot ImageNet classification. All the models are pretrained with the public Laion-5B dataset. The image encoder, text decoder in captioner and IG captioner, and text encoder in CLIP classifier have the same layer number, and they are all built with standard transformer blocks. + +Results. The results are summarized in Tab. 3. First, compared with standard captioners, IG captioner achieves $19.7\%$ and $18.1\%$ top-1 accuracy improvements when using ViT-B and ViT-L [10] as the image encoders. Second, compared with the strong discriminative baselines, CLIP classifiers, IG captioner achieves $0.5\%$ / $1.6\%$ top-1 accuracy improvements when using the image encoder ViT-B / ViT-L. These improvements demonstrate that IG captioner is a strong zero-shot classifier as a pure generative model. We measure the correlations of the evaluation objective and the caption prior in Sec. 5.1 to validate the effectiveness of the design of IG captioner. Besides, we perform the ablation studies in Sec. 5.3 to demonstrate the efficacy of the IG evaluation on the standard captioner. + +# 4.2 Zero-shot Image-text Retrieval on MSCOCO and Flickr30K + +Settings. We use the same models in Sec. 4.1 pretrained on Laion-5B to perform zero-shot image-text retrieval on MSCOCO 5K and Flickr30K 1K test sets. There are 5 captions for each image. In order to measure the recalls, we compute a similarity matrix $\mathbf{M}_{a\times b}$ where $a$ and $b$ are the number of images and captions. For the CLIP classifier, $\mathbf{M}_{i,j} = \mathrm{E}_{I_i}\cdot \mathrm{E}_{T_j}$ , where $\mathrm{E}_{T_j}$ and $\mathrm{E}_{I_i}$ are the embeddings of the $i^{\mathrm{th}}$ image and $j^{\mathrm{th}}$ caption. For the captioner, we compute $\mathbf{M}_{i,j} = \log P(T_j|I_i)$ while for the IG captioner, we compute $\mathbf{M}_{i,j} = \log P(T_j|I_i) - \log P(T_j)$ . + +Results on MSCOCO. We summarize the results on MSCOCO in Tab. 4. For the image $\rightarrow$ text retrieval, IG captioner significantly boosts the performance of a generative captioner. IG captioner shows $22.7\% / 25.5\% / 22.8\%$ improvements over the captioner on R@1 / R@5 and R@10 with the ViT-B image encoder, and shows $22.9\% / 24.1\% / 20.3\%$ improvements with the ViT-L image encoder. Furthermore, IG captioner achieves comparable performances with the CLIP classifier. The performance gaps between the IG captioner and the CLIP classifier are $8.9\% / 6.6\% / 5.0\%$ on R@1 / R@5 / R@10 with the ViT-B encoder. While with the ViT-L image encoder, the gaps are further decreased to $6.5\% / 5.1\% / 3.5\%$ on R@1 / R@5 / R@10. + +
modelencoderpretrain lossMSCOCO (5K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast56.380.387.538.564.774.6
captionerViT-Bgenerate24.748.259.745.168.977.5
IG captionerViT-Bgenerate47.473.782.542.967.476.1
CLIP classifierViT-Lcontrast59.383.089.542.167.977.4
captionerViT-Lgenerate29.953.865.749.272.880.8
IG captionerViT-Lgenerate52.877.986.048.571.680.2
+ +Table 4: Zero-shot image-text retrieval on MSCOCO [5]dataset. All the models are pretrained on Laion-5B dataset. + +
modelencoderpretrain lossFlickr30K (1K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast85.297.298.768.288.993.6
captionerViT-Bgenerate46.973.181.572.290.894.3
IG captionerViT-Bgenerate60.690.094.770.089.393.6
CLIP classifierViT-Lcontrast88.098.399.071.190.894.7
captionerViT-Lgenerate56.682.088.177.993.196.1
IG captionerViT-Lgenerate64.793.497.776.292.695.6
+ +Table 5: Zero-shot image-text retrieval on Flickr30K [34] dataset. All the models are pretrained on Laion-5B dataset. + +Interestingly, for the text $\rightarrow$ image retrieval, we find that both the captioner and IG captioner have better performances than the CLIP classifier. Since our approach is to remove the bias in the text prediction, it does not affect the text $\rightarrow$ image retrieval. We leave this for the future research. + +Results on Flickr30K. The results are summarized in Tab. 4. We observe the similar phenomena on MSCOCO. For the image $\rightarrow$ text retrieval, on the one hand, IG captioner shows significant improvements over the captioner. With the ViT-B image encoder, IG captioner improves the R@1 / R@5 / R@10 by $13.7\%$ / $16.9\%$ / $13.2\%$ , and with the ViT-L image encoder, the improvements are $8.1\%$ / $11.4\%$ / $9.6\%$ . On the other hand, the performance gaps between the IG captioner and the CLIP classifier are significantly reduced. For R@1, the gaps are $24.6\%$ / $23.3\%$ with ViT-B / ViT-L image encoder. However, for R@5 / R@10, the gaps become $7.2\%$ / $4.0\%$ with ViT-B encoder, and $4.9\%$ / $1.3\%$ with ViT-L encoder. For the text $\rightarrow$ image retrieval, we observe the similar superiority of both the captioner and IG captioner over the CLIP classifier. + +
αImageNet-1KMSCOCO image → text (%)Flickr30K image → text (%)
top-1 acc. (%) rlogP(T),OIGR@1R@5R@10rlogP(T),OIGR@1R@5R@10rlogP(T),OIG
0.045.40.8322.044.356.20.8742.268.476.80.90
0.149.10.8024.948.360.90.8545.671.981.30.88
0.252.50.7628.853.265.00.8150.276.884.70.85
0.355.60.7033.058.268.40.7754.580.087.70.81
0.458.40.6236.761.772.60.7158.284.290.30.76
0.560.70.5240.265.775.90.6261.686.492.30.70
0.662.70.4043.269.478.80.5163.288.293.60.61
0.763.80.2546.272.080.90.3663.489.094.00.48
0.864.30.0847.473.782.50.1960.690.094.70.32
0.963.9-0.1046.473.282.50.056.189.795.80.12
1.062.9-0.2743.370.681.4-0.2150.586.794.5-0.09
+ +Table 6: Ablations on the $\alpha$ of the IG captioner evaluation objective, $O_{\mathrm{IG}} = \log P(T|I) - \alpha \log P(T)$ . All the performances are reported on zero-shot tasks. The IG captioner is pretrained on the Laion-5B dataset with the ViT-B image encoder. $r$ is the Pearson Correlation Coefficient (PCC). The text $\rightarrow$ image recalls for the retrieval tasks are not reported because the value of $\alpha$ does affect the image $\rightarrow$ text predictions. The best accuracies, recalls and PCCs are marked with the color SpringGreen. + +# 5 Ablation Studies + +# 5.1 Weights of the Text Prior Removal and Correlation Measurements + +Settings. In this section, we ablate the $\alpha$ in the evaluation objective of IG captioner, $\log P(T|I) - \alpha \log P(T)$ . We use the same training and evaluation settings as the main experiments. We pretrain the IG captioner with the ViT-B encoder on the Laion-5B dataset and perform zero-shot ImageNet classification and zero-shot image-text retrieval on MSCOCO and Flickr30K. We ablation the $\alpha$ from 0.0 to 1.0 with a step size 0.1. For the retrieval tasks, we do not list the text $\rightarrow$ image recalls because the value of $\alpha$ does not affect the predictions of text $\rightarrow$ image retrieval. In order to validate our goal of removing the bias from text priors, we report the Pearson Correlation Coefficient (PCC) of $\log P(T)$ and the evaluation objective when varying the value of $\alpha$ . + +Results. We summarize the results in Tab. 6. On the one hand, the smaller correlation between $\log P(T|I)$ and $\log P(T)$ generally corresponds to better performances. For the ImageNet classification, when $\alpha = 0.08$ , the best PCC 0.08 and performance $64.3\%$ are achieved at the same time. For the retrieval tasks on MSCOCO / Flickr30K, the best PCC, $0.0 / 0.12$ , and the highest R@10, $82.5\% / 95.8\%$ , are obtained simultaneously with $\alpha = 0.9$ . On the other hand, it requires a degree of text priors to achieve the best fine-grained performances on specific datasets. The highest R@1, $47.4\% / 63.4\%$ , correspond to the PCC, $0.19 / 0.48$ , + +
approachencodereval obj ↑top-1 acc. (%)
LM + CapViT-Blog Pθ(T|I) - log Pψ(T)64.0
IG captionerViT-Blog Pθ(T|I) - log Pθ(T)64.3
LM + CapViT-Llog Pθ(T|I) - log Pψ(T)68.9
IG captionerViT-Llog Pθ(T|I) - log Pθ(T)69.8
+ +Table 7: Approach ablations on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. LM + Cap stands for the approach that uses an unimodal Language Model (LM) and a standard multimodal captioner (Cap). The LM is trained with the captions only. $\psi$ represents the parameters of the LM while $\theta$ the parameters of the Cap. + +on MSCOCO / Flickr30K. $\alpha = 0.0$ corresponds to the bad strong correlations, resulting in the poor performances. $\alpha = 1.0$ causes the negative correlations and produces the unsatisfying performances. According to the ImageNet classification results with ViT-B encoder, we set $\alpha = 0.8$ for all experiments in this paper. For the ImageNet classification with ViT-L encoder and all the image-text retrieval tasks, we do not change this $\alpha$ . + +# 5.2 Language Model + Captioner versus IG Captioner + +Settings. IG captioner has a text decoder that is able to predict both $\log P(T|I)$ and $\log P(T)$ . One variant of IG captioner consists of a pair of models. One of them is the unimodal Language Model (LM) to predict $\log P(T)$ . The other one is the multimodal captioner, a standard captioner to predict $\log P(T|I)$ . During inference, the prediction is based on the subtraction of their outputs. We call this LM + Cap approach. + +Results. We report the results in Tab. 7. It is observed that the LM + Cap approach performs worse than the IG captioner. Besides, it is less efficient due to the extra language model. From another perspective, it demonstrates that the text decoder of IG captioner is able to perform both the multimodal and unimodal tasks well. + +# 5.3 IG Evaluation + +Settings. IG captioner differs from a standard captioner in both the training and evaluation phases. In this section, we study whether the IG evaluation will improve a standard captioner as a classifier. The IG evaluation requires the prediction of $\log P(T)$ . Since the standard captioner can not directly predict this, we feed the captioner zero-intensity images to compute $\log P(T|\mathbf{0})$ as the approximation. + +![](images/fc817456419a8b93122a704a2fee1f6f780c88762fda3ab624245834e4c74a3e.jpg) +Fig. 5: Ablations of the Information Gain (IG) evaluation on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. Captioner + IG eval uses the evaluation objective, $\log P(T|I) - \alpha \log P(T|\mathbf{0})$ . $\log P(T|\mathbf{0})$ is the prediction of the captioner with the input being the zero-intensity image. It is used to approximate $\log P(T)$ , because the standard captioner after training is not able to directly predict $\log P(T)$ . + +
generative classifiermodel typepretrain dataparamstop-1 acc. (%)
Imagen [7,41]text-to-imageL5B + Psy2B62.7
Stable Diffusion 2.0 [19,40]text-to-imageL5B1.45B61.4
IG captionerimage-to-textL5B1.07B69.8
+ +Table 8: Comparisons of generative classifiers on zero-shot ImageNet classification. L5B and Psy represent the Laion-5B dataset and a proprietary dataset. + +Results. We show the results in Tab. 5. The IG evaluation is able to significantly improve the performance of the captioners. Specifically, with the ViT-B / ViT-L image encoder, IG evaluation increases the zero-shot top-1 ImageNet classification accuracy by $9.0\%$ / $7.9\%$ . Adding the training part of IG captioner, the performances will be further improved by $10.7\%$ / $10.2\%$ . + +# 5.4 Comparisons to Text-to-image Generative Classifiers + +Settings. There are two kinds of vision-language generative models: text-to-image generative models and image-to-text captioners. There have been recent works [7,19] that successfully convert the large text-to-image diffusion models to the zero-shot generative classifiers. We compare IG captioner with these models. + +Results. The results are summarized in Tab. 8. With the same or smaller amount of pretraining data, IG captioner demonstrates the best performances. Compared with the Text-to-Image Classifiers [7] and Diffusion Classifier [19] usingImagen [41] and Stable Diffusion [40], respectively, IG captioner shows $7.1\%$ / $8.4\%$ zero-shot top-1 accuracy improvements on ImageNet. Besides, IG captioner is a more compact model and only uses $53.5\%$ / $73.8\%$ of their parameters. + +
training loss weightstop-1 acc. (%)
β: log P(T|I) γ: log P(T)
1.01.063.0
1.50.564.3
1.90.162.8
+ +Table 9: Ablations of the training loss weights on zero-shot ImageNet classification. The performances are obtained from the IG captioners trained on the Laion-5B dataset with ViT-B encoder. $\beta$ and $\gamma$ are the weights of the multimodal and unimodal training objectives in Eqn. (6) + +
modelsVQAv2 test-standard acc. (%)
CLIPN/A
captioner74.5
IG captioner75.2
+ +Table 10: Generative evaluation on VQAv2. All the models are pretrained on the Laion-5B dataset with ViT-L encoder and fine-tuned on the VQAv2 dataset. CLIP can not perform the VQA task as a discriminative model. + +# 5.5 Weights of the Multimodal and Unimodal Training Losses + +Settings and Results. We ablate the multimodal loss weight $\beta$ and the unimodal loss weight $\gamma$ in the training objective of IG captioner (Eqn. (6)). We train the IG captioners with ViT-B encoder on the Laion-5B dataset and evaluate them on zero-shot ImageNet classification. The results are shown in Tab. 9. The equal weights do not produce the optimal results. We notice that image encoder is only trained with the multimodal loss while the text decoder is supervised by both the losses. We set the multimodal loss weight $\beta = 1.5$ and the unimodal loss $\gamma = 0.5$ for all the other experiments. + +# 5.6 Generative Evaluation of IG Captioner + +Settings and Results. We evaluate the generative capability of IG captioner in this section. Specifically, after pertaining on the Laion-5B dataset, we perform the generative fine-tuning on the VQAv2 dataset. The results are shown in Tab. 10. The IG captioner outperforms the captioner, showing that the information gain approach improves the captioner in both discriminative and generative tasks. + +# 6 Conclusion + +In this paper, we address the challenge of using a generative captioner for zero-shot classification tasks. We identify and mitigate the issue of linguistic priors dominating visual signals by introducing the Information Gain (IG) captioner with novel training and evaluation methods. Our results show that the IG captioner is an effective zero-shot classifier. + +Acknowledgements We gratefully acknowledge supports from ONR with N00014-23-1-2641. + +# References + +1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023) +2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. Advances in neural information processing systems 35, 23716-23736 (2022) +3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A versatile vision-language model for understanding, localization, text reading, and beyond (2023) +4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020) +5. Chen, X., Fang, H., Lin, T.Y., Vedantam, R., Gupta, S., Dollar, P., Zitnick, C.L.: Microsoft coco captions: Data collection and evaluation server. arXiv preprint arXiv:1504.00325 (2015) +6. Church, K., Hanks, P.: Word association norms, mutual information, and lexicography. Computational linguistics 16(1), 22-29 (1990) +7. Clark, K., Jaini, P.: Text-to-image diffusion models are zero-shot classifiers. arXiv preprint arXiv:2303.15233 (2023) +8. Dai, W., Li, J., Li, D., Tiong, A.M.H., Zhao, J., Wang, W., Li, B., Fung, P., Hoi, S.: Instructblip: Towards general-purpose vision-language models with instruction tuning (2023) +9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009) +10. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020) +1. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106. Springer (2022) +2. Ge, Y., Zeng, X., Huffman, J.S., Lin, T.Y., Liu, M.Y., Cui, Y.: Visual fact checker: Enabling high-fidelity detailed caption generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14033-14042 (2024) +3. te Grotenhuis, M., Matthijssen, A.: Basic SPSS tutorial. Sage Publications (2015) +4. He, H., Peng, N., Liang, P.: Pun generation with surprise. arXiv preprint arXiv:1904.06828 (2019) +5. Hinton, G.E.: To recognize shapes, first learn to generate images. Progress in brain research 165, 535-547 (2007) +6. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020) +7. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) +8. Huang, S., Dong, L., Wang, W., Hao, Y., Singhal, S., Ma, S., Lv, T., Cui, L., Mohammed, O.K., Liu, Q., Aggarwal, K., Chi, Z., Bjorck, J., Chaudhary, V., Som, + +S., Song, X., Wei, F.: Language is not all you need: Aligning perception with language models. ArXiv abs/2302.14045 (2023) +19. Li, A.C., Prabhudesai, M., Duggal, S., Brown, E., Pathak, D.: Your diffusion model is secretly a zero-shot classifier. arXiv preprint arXiv:2303.16203 (2023) +20. Li, B., Zhang, K., Zhang, H., Guo, D., Zhang, R., Li, F., Zhang, Y., Liu, Z., Li, C.: Llava-last: Stronger llms supercharge multimodal capabilities in the wild (May 2024), https://llava-v1.github.io/blog/2024-05-10-llava-last-stronger-llms/ +21. Li, J., Galley, M., Brockett, C., Gao, J., Dolan, B.: A diversity-promoting objective function for neural conversation models. arXiv preprint arXiv:1510.03055 (2015) +22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. In: International conference on machine learning. pp. 19730-19742. PMLR (2023) +23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International conference on machine learning. pp. 12888-12900. PMLR (2022) +24. Li, X.L., Holtzman, A., Fried, D., Liang, P., Eisner, J., Hashimoto, T., Zettlemoyer, L., Lewis, M.: Contrastive decoding: Open-ended text generation as optimization. arXiv preprint arXiv:2210.15097 (2022) +25. Liu, A., Sap, M., Lu, X., Swayamdipta, S., Bhagavatula, C., Smith, N.A., Choi, Y.: Dexperts: Decoding-time controlled text generation with experts and anti-experts. arXiv preprint arXiv:2105.03023 (2021) +26. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning (2023) +27. Liu, H., Li, C., Li, Y., Li, B., Zhang, Y., Shen, S., Lee, Y.J.: Llava-last: Improved reasoning,OCR,and world knowledge (January 2024),https://llava-v1.github.io/blog/2024-01-30-llava-last/ +28. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024) +29. Ng, A., Jordan, M.: On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. Advances in neural information processing systems 14 (2001) +30. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021) +31. OpenAI: Gpt-4 technical report. ArXiv abs/2303.08774 (2023), https://arxiv.org/abs/2303.08774 +32. Pearson, K.: VII. note on regression and inheritance in the case of two parents. proceedings of the royal society of London 58(347-352), 240-242 (1895) +33. Peng, Z., Wang, W., Dong, L., Hao, Y., Huang, S., Ma, S., Wei, F.: Kosmos-2: Grounding multimodal large language models to the world. arXiv preprint arXiv:2306.14824 (2023) +34. Plummer, B.A., Wang, L., Cervantes, C.M., Caicedo, J.C., Hockenmaier, J., Lazebnik, S.: Flickr30k entities: Collecting region-to-phrase correspondences for richer image-to-sentence models. In: Proceedings of the IEEE international conference on computer vision. pp. 2641-2649 (2015) +35. Quinlan, J.R.: Induction of decision trees. Machine learning 1, 81-106 (1986) +36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) + +37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents, 2022. URL https://arxiv.org/abs/2204.061257 (2022) +38. Ranzato, M., Susskind, J., Mnih, V., Hinton, G.: On deep generative models with applications to recognition. In: CVPR 2011. pp. 2857-2864. IEEE (2011) +39. Reid, M., Savinov, N., Teplyashin, D., Lepikhin, D., Lillicrap, T., Alayrac, J.b., Soricut, R., Lazaridou, A., First, O., Schrittwieser, J., et al.: Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context. arXiv preprint arXiv:2403.05530 (2024) +40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) +41. Sahara, C., Chan, W., Chang, H., Lee, C., Ho, J., Salimans, T., Fleet, D., Norouzi, M.: Palette: Image-to-image diffusion models. In: ACM SIGGRAPH 2022 Conference Proceedings. pp. 1-10 (2022) +42. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) +43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022) +44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015) +45. Su, Y., Lan, T., Wang, Y., Yogatama, D., Kong, L., Collier, N.: A contrastive framework for neural text generation. Advances in Neural Information Processing Systems 35, 21548-21561 (2022) +46. Team, G., Anil, R., Borgeaud, S., Wu, Y., Alayrac, J.B., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., et al.: Gemini: a family of highly capable multimodal models. arXiv preprint arXiv:2312.11805 (2023) +47. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) +48. Wang, P., Yang, A., Men, R., Lin, J., Bai, S., Li, Z., Ma, J., Zhou, C., Zhou, J., Yang, H.: Ofa: Unifying architectures, tasks, and modalities through a simple sequence-to-sequence learning framework. In: International conference on machine learning. pp. 23318-23340. PMLR (2022) +49. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022) +50. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022) +51. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023) \ No newline at end of file diff --git a/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/images.zip b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..3a1f3d2f4be22c6ddab98886640c91bd49c97458 --- /dev/null +++ b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:982b5828993c341dd2a94f0577ccd6e6fa52da73e49e2663875b11f461220108 +size 474919 diff --git a/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/layout.json b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..74eac140759c3e3cc20f0797457dfba1dc2497c1 --- /dev/null +++ b/2024/IG Captioner_ Information Gain Captioners are Strong Zero-shot Classifiers/layout.json @@ -0,0 +1,10025 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 154, + 111, + 460, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 111, + 460, + 148 + ], + "spans": [ + { + "bbox": [ + 154, + 111, + 460, + 148 + ], + "type": "text", + "content": "IG Captioner: Information Gain Captioners are Strong Zero-shot Classifiers" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "spans": [ + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "content": "Chenglin Yang" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "content": ", Siyuan Qiao" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "content": ", Yuan Cao" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "content": ", Yu Zhang" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "content": ", Tao Zhu" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "content": ", Alan Yuille" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "text", + "content": ", and Jiahui Yu" + }, + { + "bbox": [ + 184, + 167, + 429, + 193 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 249, + 201, + 365, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 249, + 201, + 365, + 224 + ], + "spans": [ + { + "bbox": [ + 249, + 201, + 365, + 224 + ], + "type": "text", + "content": "1 Johns Hopkins University 2 Google DeepMind" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 135, + 243, + 242, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 243, + 242, + 260 + ], + "spans": [ + { + "bbox": [ + 135, + 243, + 242, + 260 + ], + "type": "text", + "content": "DOG = \"A photo of a west highland white terrier\" \nHORSE = \"A photo of a common sorrel horse\"" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 149, + 274, + 216, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 274, + 216, + 282 + ], + "spans": [ + { + "bbox": [ + 149, + 274, + 216, + 282 + ], + "type": "text", + "content": "Language Model Output" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 157, + 289, + 201, + 305 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 157, + 289, + 201, + 305 + ], + "spans": [ + { + "bbox": [ + 157, + 289, + 201, + 305 + ], + "type": "inline_equation", + "content": "\\log P(\\mathrm{DOG}) = -3.3" + }, + { + "bbox": [ + 157, + 289, + 201, + 305 + ], + "type": "inline_equation", + "content": "\\log P(\\mathrm{HORSE}) = -4." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 156, + 338, + 206, + 346 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 338, + 206, + 346 + ], + "spans": [ + { + "bbox": [ + 156, + 338, + 206, + 346 + ], + "type": "text", + "content": "(a) Linguistic prior" + } + ] + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 256, + 241, + 482, + 347 + ], + "blocks": [ + { + "bbox": [ + 256, + 241, + 482, + 347 + ], + "lines": [ + { + "bbox": [ + 256, + 241, + 482, + 347 + ], + "spans": [ + { + "bbox": [ + 256, + 241, + 482, + 347 + ], + "type": "image", + "image_path": "be7d9c5a7d0461075970e412a91daef8647b99be06512df5345b56b179aaa8e8.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 362, + 482, + 440 + ], + "lines": [ + { + "bbox": [ + 130, + 362, + 482, + 440 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 482, + 440 + ], + "type": "text", + "content": "Fig. 1: The prediction of a captioner-based classifier is influenced by the linguistic priors in pure text modality. The Information Gain (IG) evaluation reduces such impact and makes the predictions more grounded on the visual inputs. We illustrate with real predictions on zero-shot ImageNet [9] classification in this figure. (a) The language model was trained on Laion-5B [43] captions only. (b) The captioner was trained on the Laion-5B dataset with both the images and captions. The IG evaluation in (b) uses the outputs of both the captioner and the language model in (a)." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 159, + 456, + 453, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 456, + 453, + 666 + ], + "spans": [ + { + "bbox": [ + 159, + 456, + 453, + 666 + ], + "type": "text", + "content": "Abstract. Generative training has been demonstrated to be powerful for building visual-language models. However, on zero-shot discriminative benchmarks, there is still a performance gap between models trained with generative and discriminative objectives. In this paper, we aim to narrow this gap by improving the efficacy of generative training on classification tasks, without any finetuning processes or additional modules. Specifically, we focus on narrowing the gap between the generative captioner and the CLIP classifier. We begin by analysing the predictions made by the captioner and classifier and observe that the caption generation inherits the distribution bias from the language model trained with pure text modality, making it less grounded on the visual signal. To tackle this problem, we redesign the scoring objective for the captioner to alleviate the distributional bias and focus on measuring the gain of information brought by the visual inputs. We further design a generative training objective to match the evaluation objective. We name our model trained and evaluated from the novel procedures as Information Gain (IG) captioner. We pretrain the models on the public Laion-5B dataset and perform a series of discriminative evaluations. For the zero-shot classification on ImageNet, IG captioner achieves " + }, + { + "bbox": [ + 159, + 456, + 453, + 666 + ], + "type": "inline_equation", + "content": ">18\\%" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 159, + 117, + 455, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 117, + 455, + 182 + ], + "spans": [ + { + "bbox": [ + 159, + 117, + 455, + 182 + ], + "type": "text", + "content": "improvements over the standard captioner, achieving comparable performances with the CLIP classifier. IG captioner also demonstrated strong performance on zero-shot image-text retrieval tasks on MSCOCO and Flickr30K. We hope this paper inspires further research towards unifying generative and discriminative training procedures for visual-language models." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 205, + 230, + 218 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 230, + 218 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 230, + 218 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 233, + 481, + 317 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 233, + 481, + 317 + ], + "spans": [ + { + "bbox": [ + 130, + 233, + 481, + 317 + ], + "type": "text", + "content": "Generative training has been shown to be highly effective for both the language [4] and vision models [16, 44]. These generative models demonstrate remarkable zero-shot generation capabilities and have led to the developments of many impressive AI applications [31, 40]. On the other hand, discriminative training is still an effective procedure for building the large vision-language models like CLIP [36] and CoCa [49]. Models trained with discriminative objectives naturally performs strongly on discriminative tasks like classification." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 318, + 481, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 318, + 481, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 318, + 481, + 389 + ], + "type": "text", + "content": "The inconsistent setups between generative and discriminative training raises an intriguing topic, which we aim to address in this paper: Can generative training procedure also perform well on zero-shot discriminative tasks? Concretely, we study the performance gap between generative captioners and discriminative models on zero-shot classification tasks, and propose novel approaches to narrow the gap." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 389, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 481, + 510 + ], + "type": "text", + "content": "To obtain an effective zero-shot generative classifier, we start with evaluating a standard generative captioner with the Maximum Likelihood Estimation (MLE) objective on classification tasks. Specifically, we pretrain a captioner on the public Laion-5B [43] dataset and evaluate it on the ImageNet [9]. We also pretrain a CLIP classifier with the same experimental setting. We observe a large performance gap between the captioner and the CLIP classifier. We find that the predictions of the captioner are less grounded on the visual inputs. Instead, they are biased by the linguistic priors, which is illustrated in Fig. 1. These observations indicate that we should discount the influence by predictions from pure text modality in multimodal generative classification setup." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "text", + "content": "To deal with this problem, we propose an Information Gain (IG) evaluation objective, as depicted in Fig. 2. This objective demonstrates a significant performance boost on top of a captioner trained with conventional procedure. Furthermore, we propose a generative training objective to match the IG evaluation. We name the captioner, trained and evaluated with our proposed objectives, as Information Gain (IG) captioner. We pretrain the models on the Laion-5B dataset and evaluate multiple zero-shot discriminative tasks. All the models have the same training and evaluation settings to ensure the fair comparisons. For zero-shot ImageNet classification, IG captioner with ViT-B/ViT-L [10] image encoder shows " + }, + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "inline_equation", + "content": "19.7\\% / 18.1\\%" + }, + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "text", + "content": " improvements on top-1 accuracy over the standard captioner. It is even better than the CLIP classifier by " + }, + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "inline_equation", + "content": "0.5\\% / 1.6\\%" + }, + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "text", + "content": " top-1 accuracy. For zero-shot image-text retrieval on MSCOCO [5] dataset, IG captioner demonstrates " + }, + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "inline_equation", + "content": ">22\\%" + }, + { + "bbox": [ + 130, + 510, + 481, + 666 + ], + "type": "text", + "content": " accuracy improvements on all of image-to-text R@1, R@5" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 115, + 293, + 310 + ], + "blocks": [ + { + "bbox": [ + 136, + 115, + 293, + 310 + ], + "lines": [ + { + "bbox": [ + 136, + 115, + 293, + 310 + ], + "spans": [ + { + "bbox": [ + 136, + 115, + 293, + 310 + ], + "type": "image", + "image_path": "b6806dd5d58c4919e0aac9f56c0414a855deb161150960533dfbf0fc68fce31f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 312, + 482, + 368 + ], + "lines": [ + { + "bbox": [ + 130, + 312, + 482, + 368 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 482, + 368 + ], + "type": "text", + "content": "Fig. 2: The inference pipeline of IG captioner. " + }, + { + "bbox": [ + 130, + 312, + 482, + 368 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 312, + 482, + 368 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 312, + 482, + 368 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 312, + 482, + 368 + ], + "type": "text", + "content": " represent the input image and caption. IG captioner consists of a image encoder and a text decoder. The text decoder is able to provide both the multimodal and unimodal predictions. The unimodal predictions can be cached for different input images. Both the image and object classes are from the ImageNet dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 338, + 175, + 476, + 242 + ], + "blocks": [ + { + "bbox": [ + 338, + 175, + 476, + 242 + ], + "lines": [ + { + "bbox": [ + 338, + 175, + 476, + 242 + ], + "spans": [ + { + "bbox": [ + 338, + 175, + 476, + 242 + ], + "type": "image", + "image_path": "45d7b69921891430d017b79fdcacb9763f31b55994697f9d27524fc96216701a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 405, + 482, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 405, + 482, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 405, + 482, + 464 + ], + "type": "text", + "content": "and R@10 over the captioner, significantly reducing the gap from the captioner to the CLIP classifier. Interestingly, we observe the superior performances on text-to-image recalls of both the captioner and IG captioner over the CLIP classifier. The superiority of IG captioner is also demonstrated on Flickr30K [34] dataset." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 146, + 466, + 414, + 479 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 466, + 414, + 479 + ], + "spans": [ + { + "bbox": [ + 146, + 466, + 414, + 479 + ], + "type": "text", + "content": "Our main contributions can be summarized in the following:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 137, + 493, + 480, + 662 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 138, + 493, + 480, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 493, + 480, + 538 + ], + "spans": [ + { + "bbox": [ + 138, + 493, + 480, + 538 + ], + "type": "text", + "content": "- We convert a generative captioner into a zero-shot classifier. We identify the root cause of its poor performance and observe that its predictions are negatively influenced by the linguistic priors and less grounded on the visual inputs." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 137, + 542, + 480, + 577 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 542, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 137, + 542, + 480, + 577 + ], + "type": "text", + "content": "- We propose the Information Gain (IG) method to evaluate a generative classifier. We demonstrate that the IG evaluation is able to significantly improve its performance without any changes in the training process." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 137, + 580, + 480, + 613 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 580, + 480, + 613 + ], + "spans": [ + { + "bbox": [ + 137, + 580, + 480, + 613 + ], + "type": "text", + "content": "- To couple with the IG evaluation, we propose a generative training objective to further boost the performance of the generative classifier which we name Information Gain (IG) captioner." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 137, + 617, + 480, + 662 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 617, + 480, + 662 + ], + "spans": [ + { + "bbox": [ + 137, + 617, + 480, + 662 + ], + "type": "text", + "content": "- We show that IG captioner is a strong zero-shot classifier, evidenced by the significant improvements over the captioner and comparable performance with the CLIP classifier on the zero-shot ImageNet classification, MSCOCO and Flickr30K image-text retrieval tasks." + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 238, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 238, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 238, + 127 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 223 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 223 + ], + "type": "text", + "content": "Text-to-image Generative Classifiers. The classic approach [15,38] of using generative models to perform recognition tasks is the Bayes algorithm [29]. During training, this algorithm models the data distribution while during inference, it provides predictions by solving a maximum likelihood estimation (MLE) problem. Recently, there have been the methods [7,19] proposed to convert the text-to-image diffusion models, Stable Diffusion [40] or Imagen [41], into a zero-shot classifier using the Bayes algorithm." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 223, + 482, + 330 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 223, + 482, + 330 + ], + "spans": [ + { + "bbox": [ + 130, + 223, + 482, + 330 + ], + "type": "text", + "content": "The focus of IG captioner is different with these previous arts. First, we explore the possibility of achieving a good classifier solely through the generative training, instead of how to convert a generative model into a classifier. The Stable Diffusion used by the above diffusion model classifiers [7, 19] is not suitable for our goal because it uses the CLIP text encoder pretrained with contrastive loss to provide the text guidance. Second, we identify the negative impact of the text priors inherited from the pretraining data and propose methods to reduce this impact for zero-shot classification tasks. Besides, IG captioner is an image-to-text generative captioner. We also perform the comparisons in Tab. 8." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 331, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 482, + 437 + ], + "type": "text", + "content": "Classifier-Free Guidance (CFG). CFG [17] is an important approach to improving the sample quality of text-to-image generative models [11,30,37,42, 50]. During training, CFG requires the model to generate images both with and without text conditions. During inference, the output image is sampled according to a linear combination of both the conditional and unconditional predictions to improve text-image alignment, which relates CFG to IG captioner from a high level. In contrast, IG captioner is an image-to-text captioner that uses the probability gain from unconditionally to conditionally generating captions with the aim of reducing the bias from text priors for zero-shot classification tasks." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 438, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 438, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 482, + 582 + ], + "type": "text", + "content": "Contrast in Text Generation. In the field of text generation, researchers have been investigating the use of contrast, including avoiding the text degeneration and undesirable repetitions [45], generating pan sentences [14], and language detoxification [25]. Contrastive decoding [24] uses the log-likelihood difference between a large expert and a small amateur model to improve the quality of the open-ended text generation. Li et al. [21] propose to use the mutual information between an input message and its responses as the decoding objective to avoid the generic and meaningless conversations. Differently, in this paper, IG captioner uses the Information Gain (IG) to address the problem of evaluating a vision-language generative model as a zero-shot classifier. Importantly, the IG evaluation is used to mitigate the negative influence of linguistic priors inherited from the pretraining dataset." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 582, + 489, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 489, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 489, + 665 + ], + "type": "text", + "content": "Image-to-text Multimodal Language Models. Multimodal language models have become the dominant approaches for image captioning, including OFA [48], Flamingo [2], BLIP [22, 23], CoCa [49], LLaVA [26, 28], MiniGPT-4 [51], InstructBLIP [8], Kosmos [18, 33], Qwen-VL [3], VFC [12], LLaVA-NeXT [20, 27], Gemini [39, 46], and GPT-4 [1]. Differently, IG captioner demonstrates the potential of pure generative training on discriminative tasks using public datasets." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 202, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 202, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 202, + 127 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "type": "text", + "content": "In this section, we introduce Information Gain (IG) captioner. First, we illustrate how to evaluate a conventional captioner on the zero-shot classification task and diagnose its problem. Second, we propose an evaluation approach using the information gain to tackle the problem. Third, we design a training objective to couple with the IG evaluation. Combining the above evaluation and training procedures, we propose IG captioner." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 227, + 397, + 240 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 227, + 397, + 240 + ], + "spans": [ + { + "bbox": [ + 131, + 227, + 397, + 240 + ], + "type": "text", + "content": "3.1 Evaluating Captioners on Discriminative Tasks" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 246, + 481, + 294 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 246, + 481, + 294 + ], + "spans": [ + { + "bbox": [ + 130, + 246, + 481, + 294 + ], + "type": "text", + "content": "A captioner is a generative model that generates caption for a given image. It is by nature not trained as a classifier and its output can not be used directly for such tasks like image classification or image-text retrieval. Therefore, to evaluate a captioner on discriminative tasks, we need to adapt the evaluation procedure." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": "Maximum Likelihood Estimation (MLE) Objective. Let " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "I \\in \\mathbb{R}^{H \\times W \\times 3}" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "T \\in \\mathbb{R}^{N \\times D}" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "t \\in \\mathbb{R}^D" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": " be the image, caption and the word in the caption, where " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": " are the height and width of the image and " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": " are the number of text tokens and the token dimension. A captioner is a function " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "F_{\\theta}: I \\to T" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 309, + 482, + 369 + ], + "type": "text", + "content": " is the model parameter." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 370, + 482, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 370, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 370, + 482, + 407 + ], + "type": "text", + "content": "Discriminative tasks require the model to pick the most appropriate text from a set of candidates " + }, + { + "bbox": [ + 130, + 370, + 482, + 407 + ], + "type": "inline_equation", + "content": "C = \\{T_i\\}" + }, + { + "bbox": [ + 130, + 370, + 482, + 407 + ], + "type": "text", + "content": " to describe an image, where " + }, + { + "bbox": [ + 130, + 370, + 482, + 407 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 370, + 482, + 407 + ], + "type": "text", + "content": " is the index of captions. During inference, the standard MLE evaluation objective is:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 261, + 415, + 481, + 433 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 415, + 481, + 433 + ], + "spans": [ + { + "bbox": [ + 261, + 415, + 481, + 433 + ], + "type": "interline_equation", + "content": "\\underset {i} {\\arg \\max } [ \\log P (T _ {i} | I) ] \\tag {1}", + "image_path": "2d4d2fbbe552e2f969839c84c49001ce0596cd2db4907c0e4d020381d67dc4c5.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "spans": [ + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "text", + "content": "We omit the normalization factor " + }, + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "inline_equation", + "content": "1 / N_{i}" + }, + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "text", + "content": " when calculating the evaluation objectives throughout this paper for simplicity. " + }, + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "inline_equation", + "content": "N_{i}" + }, + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "text", + "content": " is the token length of the " + }, + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "inline_equation", + "content": "t^{\\mathrm{th}}" + }, + { + "bbox": [ + 131, + 441, + 481, + 477 + ], + "type": "text", + "content": " caption." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "content": "Low Performance Using MLE Objective. To study the effectiveness of MLE as objective, we pretrain a captioner on Laion-5B and use it to perform zero-shot ImageNet classification. We set up a strong baseline: a CLIP classifier which is pretrained with contrastive loss and tailored for classification tasks. The captioner has a image encoder and a text decoder while the CLIP classifier has a image encoder and a text encoder. Both of them have the same model size, training and evaluation settings to ensure fair comparisons. The results are shown in Tab. 1. When directly using the MLE objective (Eqn. (1)) the captioner shows " + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "inline_equation", + "content": ">19\\%" + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "content": " top-1 accuracy degradation compared with the CLIP classifier." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Result Analysis of MLE Evaluation. Since the captioner is a vision-language model, we are interested in understanding how much visual information is provided by the visual inputs and utilized by the model. We pretrain a language model that has the same architecture as the text decoder of the captioner." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 203, + 114, + 411, + 159 + ], + "blocks": [ + { + "bbox": [ + 203, + 114, + 411, + 159 + ], + "lines": [ + { + "bbox": [ + 203, + 114, + 411, + 159 + ], + "spans": [ + { + "bbox": [ + 203, + 114, + 411, + 159 + ], + "type": "table", + "html": "
modelspretrain losszero-shot IN acc. (%)
CLIP classifiercontrast63.8
captionergenerate44.6
", + "image_path": "b6c5ee9efab5d175611fe172abe0e668714b0f44b466daf860a15ef2b3f10a8f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 220, + 246, + 394, + 291 + ], + "blocks": [ + { + "bbox": [ + 130, + 158, + 482, + 224 + ], + "lines": [ + { + "bbox": [ + 130, + 158, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 158, + 482, + 224 + ], + "type": "text", + "content": "Table 1: The large performance gap between the standard captioner and the CLIP classifier on zero-shot ImageNet classification. All the models are trained with the Laion-5B dataset. The CLIP classifier is trained with contrastive loss while the captioner with generative loss. The CLIP classifier has a 12-layer image encoder and a 12-layer text encoder and the captioner has a 12-layer image encoder and a 12-layer text decoder." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 220, + 246, + 394, + 291 + ], + "lines": [ + { + "bbox": [ + 220, + 246, + 394, + 291 + ], + "spans": [ + { + "bbox": [ + 220, + 246, + 394, + 291 + ], + "type": "table", + "html": "
variable 1variable 2rvar1, var2
log P(T)log P(T|I)0.77
log P(T)log P(T|I) - log P(T)-0.39
", + "image_path": "33a0f99c2c0957adc03595a2242679f10483484f59c54ce8f4dba513ab8ed19e.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 291, + 482, + 357 + ], + "lines": [ + { + "bbox": [ + 130, + 291, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 291, + 482, + 357 + ], + "type": "text", + "content": "Table 2: Mean Pearson Correlation Coefficient (PCC) measurements of zero-shot predictions on ImageNet. " + }, + { + "bbox": [ + 130, + 291, + 482, + 357 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 291, + 482, + 357 + ], + "type": "text", + "content": " is predicted by the unimodal language model which is trained with the Laion-5B captions. " + }, + { + "bbox": [ + 130, + 291, + 482, + 357 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 291, + 482, + 357 + ], + "type": "text", + "content": " is predicted by the standard captioner trained with both the Laion-5B images and captions. Given one image, there are 80K (1K classes, 80 prompts) observations of these two variables to compute the PCC. The mean PCC is obtained by averaging the PCC on 50K ImageNet validation images." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "spans": [ + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "content": "It models the captions in the Laion-5B dataset and is able to predict " + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "content": ". There are 1K classes on ImageNet and for each class we use the 80 prompts proposed by CLIP. In total, there are 80K unique captions. Given an image " + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "content": ", we consider " + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "content": " as two variables and compute their Pearson correlation coefficient (PCC) [13, 32] with 80K observations in Tab. 2. We observe a strong correlation between " + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 391, + 482, + 487 + ], + "type": "text", + "content": ", which indicates that the captioner is strongly biased by the text priors and tends to ignore the visual information. The correlation is also visualized in Fig. 3." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 506, + 436, + 519 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 506, + 436, + 519 + ], + "spans": [ + { + "bbox": [ + 131, + 506, + 436, + 519 + ], + "type": "text", + "content": "3.2 Evaluating Captioners with the Information Gain (IG)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 527, + 481, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 527, + 481, + 562 + ], + "spans": [ + { + "bbox": [ + 130, + 527, + 481, + 562 + ], + "type": "text", + "content": "To alleviate the problem of strong correlation between caption likelihood conditioned on the image and caption priors, we tun to the following evaluation objective:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 257, + 563, + 481, + 589 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 563, + 481, + 589 + ], + "spans": [ + { + "bbox": [ + 257, + 563, + 481, + 589 + ], + "type": "interline_equation", + "content": "\\underset {i} {\\arg \\max } \\left[ \\log \\frac {P \\left(T _ {i} \\mid I\\right)}{P \\left(T _ {i}\\right)} \\right] \\tag {2}", + "image_path": "d3e1585bc853674d49e6abfb928505dda6694da96cd9bf89df2a25fc16f4386c.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "text", + "content": "Intuitively, this log-ratio measures the likelihood gain of the text " + }, + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "inline_equation", + "content": "T_{i}" + }, + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "text", + "content": " given the image " + }, + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "text", + "content": ". It is called pointwise mutual information [6]. The expectation of it over all the texts " + }, + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 594, + 482, + 640 + ], + "type": "text", + "content": " is the information gain [35]. In this paper, we refer to pointwise mutual information as information gain." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 484, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 484, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 484, + 666 + ], + "type": "text", + "content": "We measure the correlation of " + }, + { + "bbox": [ + 130, + 641, + 484, + 666 + ], + "type": "inline_equation", + "content": "\\log P(T_i)" + }, + { + "bbox": [ + 130, + 641, + 484, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 641, + 484, + 666 + ], + "type": "inline_equation", + "content": "[\\log P(T_i|I) - \\log P(T_i)]" + }, + { + "bbox": [ + 130, + 641, + 484, + 666 + ], + "type": "text", + "content": " in Tab. 2. It shows that the correlation is significantly reduced. Using this objective, we" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 481, + 235 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 235 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 235 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 235 + ], + "type": "image", + "image_path": "897e100f50c7016be85f2696aa0ef15feb7226e21d2dc5d07d1d2fe94599fd7a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "lines": [ + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "text", + "content": "Fig. 3: See correlations between the green line " + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "inline_equation", + "content": "(- \\log P(T|I))" + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "text", + "content": " and the orange line " + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "inline_equation", + "content": "(- \\log P(T))" + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "text", + "content": " on zero-shot ImageNet classification. " + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "text", + "content": " is predicted by a multimodal captioner trained on the Laion-5B dataset. " + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "text", + "content": " is predicted by an unimodal language model trained on the Laion-5B captions only. 100 ImageNet classes are randomly sampled due to the limited space. The numerical correlation measurements between " + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 237, + 482, + 304 + ], + "type": "text", + "content": " for the whole 1000 classes are shown in Tab. 2." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 338, + 479, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 479, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 479, + 373 + ], + "type": "text", + "content": "observe the performance gain in our ablation studies in Sec. 5.1. However, we notice that this quantity is negatively correlated with the caption priors, which is expected due to the existence of term " + }, + { + "bbox": [ + 130, + 338, + 479, + 373 + ], + "type": "inline_equation", + "content": "-\\log P(T_i)" + }, + { + "bbox": [ + 130, + 338, + 479, + 373 + ], + "type": "text", + "content": " in Eqn. (2)." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 373, + 479, + 398 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 373, + 479, + 398 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 479, + 398 + ], + "type": "text", + "content": "To deal with this negative correlation problem, we further propose the following evaluation objective:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 230, + 407, + 481, + 426 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 230, + 407, + 481, + 426 + ], + "spans": [ + { + "bbox": [ + 230, + 407, + 481, + 426 + ], + "type": "interline_equation", + "content": "\\underset {i} {\\arg \\max } [ \\log P (T _ {i} | I) - \\alpha \\log P (T _ {i}) ] \\tag {3}", + "image_path": "f9c0d033feb463207f76f408dbdb80a2885a0cd5a45526df30371b787d8ba12f.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 434, + 479, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 479, + 460 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 479, + 460 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 434, + 479, + 460 + ], + "type": "inline_equation", + "content": "\\alpha \\in [0,1]" + }, + { + "bbox": [ + 130, + 434, + 479, + 460 + ], + "type": "text", + "content": " adjusts the degree of the text prior removal. Our thorough ablation study on " + }, + { + "bbox": [ + 130, + 434, + 479, + 460 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 434, + 479, + 460 + ], + "type": "text", + "content": " can be found in Sec. 5.1." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 477, + 353, + 490 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 477, + 353, + 490 + ], + "spans": [ + { + "bbox": [ + 131, + 477, + 353, + 490 + ], + "type": "text", + "content": "3.3 Training Information Gain Captioners" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 497, + 479, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 497, + 479, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 497, + 479, + 556 + ], + "type": "text", + "content": "Without any changes on the training process, we observe the performance improvement of the captioner on the zero-shot classification task when using IG evaluation, which is shown in Sec. 5.3. But in order to keep the training and evaluation consistent, we propose a two-objective approach to train the captioner, which is illustrated in Fig. 4." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 556, + 479, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 556, + 479, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 556, + 479, + 581 + ], + "type": "text", + "content": "The first objective is the standard generative loss. Given an image, it supervises the captioner to predict the words of its caption in an autoregressive way:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 205, + 590, + 481, + 624 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 590, + 481, + 624 + ], + "spans": [ + { + "bbox": [ + 205, + 590, + 481, + 624 + ], + "type": "interline_equation", + "content": "l _ {\\text {m u l t i m o d a l}} = \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\frac {1}{N ^ {i}} \\sum_ {n = 1} ^ {N ^ {i}} \\log \\frac {1}{P \\left(t _ {t} ^ {i} \\mid t _ {1 : n - 1} ^ {i} , I ^ {i}\\right)} \\tag {4}", + "image_path": "3d488e9b13435b99e2ea43fd960c70dacdf256ad4b27664a4acbd089ee61bfbc.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": " is the index of a image-text pair " + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "(I^i, T^i)" + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": " in one batch of size " + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "B" + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "N^i" + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": " is the text token length. Since this objective models the probability of a caption conditioned on an image, we call this objective the multimodal loss." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 116, + 470, + 224 + ], + "blocks": [ + { + "bbox": [ + 140, + 116, + 470, + 224 + ], + "lines": [ + { + "bbox": [ + 140, + 116, + 470, + 224 + ], + "spans": [ + { + "bbox": [ + 140, + 116, + 470, + 224 + ], + "type": "image", + "image_path": "6e58cb3c095cf7b31b87674c0acef5cc0b8131b0204a13a4af364c10c53d6b72.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 235, + 482, + 281 + ], + "lines": [ + { + "bbox": [ + 131, + 235, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 131, + 235, + 482, + 281 + ], + "type": "text", + "content": "Fig. 4: The training pipeline of IG captioner. IG captioner has two modes. Without any given images, IG captioner is an unimodal language model. When given an input image, IG captioner becomes the multimodal captioner that models the conditional probability of its caption. The image and caption are from the Laion-5B dataset." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 311, + 480, + 335 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 311, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 131, + 311, + 480, + 335 + ], + "type": "text", + "content": "The second objective makes the captioner an autoregressive language model that is able to generate captions without given any image:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 214, + 342, + 480, + 374 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 342, + 480, + 374 + ], + "spans": [ + { + "bbox": [ + 214, + 342, + 480, + 374 + ], + "type": "interline_equation", + "content": "l _ {\\text {u n i m o d a l}} = \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\frac {1}{N ^ {i}} \\sum_ {n = 1} ^ {N ^ {i}} \\log \\frac {1}{P \\left(t _ {n} ^ {i} \\mid t _ {1 : n - 1} ^ {i}\\right)} \\tag {5}", + "image_path": "f802b23b54e102f10f8409008b26e6bad7d546ae11db9d67c8b0ab5efa9b805f.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 380, + 312, + 391 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 312, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 312, + 391 + ], + "type": "text", + "content": "We call this objective the unimodal loss." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 146, + 392, + 400, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 392, + 400, + 403 + ], + "spans": [ + { + "bbox": [ + 146, + 392, + 400, + 403 + ], + "type": "text", + "content": "Finally, we combine the above two losses in the following:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 243, + 411, + 480, + 423 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 243, + 411, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 243, + 411, + 480, + 423 + ], + "type": "interline_equation", + "content": "L = \\beta l _ {\\text {m u l t i m o d a l}} + \\gamma l _ {\\text {u n i m o d a l}} \\tag {6}", + "image_path": "91af9670c436f129480337558daa79efdccae74f00794ace5de4dd8a667146b9.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 430, + 480, + 465 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 430, + 480, + 465 + ], + "spans": [ + { + "bbox": [ + 131, + 430, + 480, + 465 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 430, + 480, + 465 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 131, + 430, + 480, + 465 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 430, + 480, + 465 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 131, + 430, + 480, + 465 + ], + "type": "text", + "content": " are the weights for each loss. We perform an ablation study on the loss weights in Sec. 5.5. We name the captioner which is trained and evaluated with our proposed objectives IG captioner." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 482, + 230, + 495 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 482, + 230, + 495 + ], + "spans": [ + { + "bbox": [ + 132, + 482, + 230, + 495 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 504, + 328, + 516 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 504, + 328, + 516 + ], + "spans": [ + { + "bbox": [ + 132, + 504, + 328, + 516 + ], + "type": "text", + "content": "4.1 Zero-shot ImageNet classification" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 521, + 482, + 666 + ], + "type": "text", + "content": "Settings. We use the English subset of the public Laion-5B [43] dataset as the pretraining dataset for all experiments. After pretraining, we perform zero-shot image classification on the ImageNet [9] validation dataset. There are 1000 classes in this validation set and each class has 50 images. We build the captioner and IG captioner with an image encoder and a text decoder, and build the CLIP [36] classifier with an image encoder and a text encoder. All the models consist of standard transformer blocks [47]. We set the layer number of image encoder and text decoder / text encoder the same. We use a batch size 4096 for all the experiments. During evaluation, we follow CLIP to use 80 prompts for each class. We use the voting mechanism to combine the predictions from different prompts for the captioner and IG captioner. All the training and evaluation procedures are the same to ensure fair comparisons." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 200, + 114, + 413, + 208 + ], + "blocks": [ + { + "bbox": [ + 200, + 114, + 413, + 208 + ], + "lines": [ + { + "bbox": [ + 200, + 114, + 413, + 208 + ], + "spans": [ + { + "bbox": [ + 200, + 114, + 413, + 208 + ], + "type": "table", + "html": "
modelencoderpretrain losstop-1 acc. (%)
CLIP classifierViT-Bcontrast63.8
captionerViT-Bgenerate44.6
IG captionerViT-Bgenerate64.3
CLIP classifierViT-Lcontrast68.2
captionerViT-Lgenerate51.7
IG captionerViT-Lgenerate69.8
", + "image_path": "68fc60f41a3885aad693fd939f54f4010206e5391ba921430f674676ae5082b0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 208, + 482, + 251 + ], + "lines": [ + { + "bbox": [ + 130, + 208, + 482, + 251 + ], + "spans": [ + { + "bbox": [ + 130, + 208, + 482, + 251 + ], + "type": "text", + "content": "Table 3: Zero-shot ImageNet classification. All the models are pretrained with the public Laion-5B dataset. The image encoder, text decoder in captioner and IG captioner, and text encoder in CLIP classifier have the same layer number, and they are all built with standard transformer blocks." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "text", + "content": "Results. The results are summarized in Tab. 3. First, compared with standard captioners, IG captioner achieves " + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "inline_equation", + "content": "19.7\\%" + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "inline_equation", + "content": "18.1\\%" + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "text", + "content": " top-1 accuracy improvements when using ViT-B and ViT-L [10] as the image encoders. Second, compared with the strong discriminative baselines, CLIP classifiers, IG captioner achieves " + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "inline_equation", + "content": "0.5\\%" + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "inline_equation", + "content": "1.6\\%" + }, + { + "bbox": [ + 130, + 285, + 482, + 406 + ], + "type": "text", + "content": " top-1 accuracy improvements when using the image encoder ViT-B / ViT-L. These improvements demonstrate that IG captioner is a strong zero-shot classifier as a pure generative model. We measure the correlations of the evaluation objective and the caption prior in Sec. 5.1 to validate the effectiveness of the design of IG captioner. Besides, we perform the ablation studies in Sec. 5.3 to demonstrate the efficacy of the IG evaluation on the standard captioner." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 422, + 463, + 435 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 422, + 463, + 435 + ], + "spans": [ + { + "bbox": [ + 131, + 422, + 463, + 435 + ], + "type": "text", + "content": "4.2 Zero-shot Image-text Retrieval on MSCOCO and Flickr30K" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "spans": [ + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": "Settings. We use the same models in Sec. 4.1 pretrained on Laion-5B to perform zero-shot image-text retrieval on MSCOCO 5K and Flickr30K 1K test sets. There are 5 captions for each image. In order to measure the recalls, we compute a similarity matrix " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "\\mathbf{M}_{a\\times b}" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "a" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "b" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " are the number of images and captions. For the CLIP classifier, " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "\\mathbf{M}_{i,j} = \\mathrm{E}_{I_i}\\cdot \\mathrm{E}_{T_j}" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "\\mathrm{E}_{T_j}" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "\\mathrm{E}_{I_i}" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " are the embeddings of the " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "i^{\\mathrm{th}}" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " image and " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "j^{\\mathrm{th}}" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " caption. For the captioner, we compute " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "\\mathbf{M}_{i,j} = \\log P(T_j|I_i)" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": " while for the IG captioner, we compute " + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "inline_equation", + "content": "\\mathbf{M}_{i,j} = \\log P(T_j|I_i) - \\log P(T_j)" + }, + { + "bbox": [ + 130, + 443, + 482, + 531 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Results on MSCOCO. We summarize the results on MSCOCO in Tab. 4. For the image " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " text retrieval, IG captioner significantly boosts the performance of a generative captioner. IG captioner shows " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "22.7\\% / 25.5\\% / 22.8\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " improvements over the captioner on R@1 / R@5 and R@10 with the ViT-B image encoder, and shows " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "22.9\\% / 24.1\\% / 20.3\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " improvements with the ViT-L image encoder. Furthermore, IG captioner achieves comparable performances with the CLIP classifier. The performance gaps between the IG captioner and the CLIP classifier are " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "8.9\\% / 6.6\\% / 5.0\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " on R@1 / R@5 / R@10 with the ViT-B encoder. While with the ViT-L image encoder, the gaps are further decreased to " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "6.5\\% / 5.1\\% / 3.5\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " on R@1 / R@5 / R@10." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 156, + 114, + 458, + 234 + ], + "blocks": [ + { + "bbox": [ + 156, + 114, + 458, + 234 + ], + "lines": [ + { + "bbox": [ + 156, + 114, + 458, + 234 + ], + "spans": [ + { + "bbox": [ + 156, + 114, + 458, + 234 + ], + "type": "table", + "html": "
modelencoderpretrain lossMSCOCO (5K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast56.380.387.538.564.774.6
captionerViT-Bgenerate24.748.259.745.168.977.5
IG captionerViT-Bgenerate47.473.782.542.967.476.1
CLIP classifierViT-Lcontrast59.383.089.542.167.977.4
captionerViT-Lgenerate29.953.865.749.272.880.8
IG captionerViT-Lgenerate52.877.986.048.571.680.2
", + "image_path": "dd1ddd847a23ffe8d7025520f0fff26c5804ea68526a74f2a129a9012460cd01.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 156, + 281, + 458, + 400 + ], + "blocks": [ + { + "bbox": [ + 132, + 235, + 481, + 257 + ], + "lines": [ + { + "bbox": [ + 132, + 235, + 481, + 257 + ], + "spans": [ + { + "bbox": [ + 132, + 235, + 481, + 257 + ], + "type": "text", + "content": "Table 4: Zero-shot image-text retrieval on MSCOCO [5]dataset. All the models are pretrained on Laion-5B dataset." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 156, + 281, + 458, + 400 + ], + "lines": [ + { + "bbox": [ + 156, + 281, + 458, + 400 + ], + "spans": [ + { + "bbox": [ + 156, + 281, + 458, + 400 + ], + "type": "table", + "html": "
modelencoderpretrain lossFlickr30K (1K test set) image → text (%)text → image (%)
R@1R@5R@10R@1R@5R@10
CLIP classifierViT-Bcontrast85.297.298.768.288.993.6
captionerViT-Bgenerate46.973.181.572.290.894.3
IG captionerViT-Bgenerate60.690.094.770.089.393.6
CLIP classifierViT-Lcontrast88.098.399.071.190.894.7
captionerViT-Lgenerate56.682.088.177.993.196.1
IG captionerViT-Lgenerate64.793.497.776.292.695.6
", + "image_path": "ea9ca0292f07141d5a50b5b137748dc67940b8235c31b2bef81f990be1654869.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 401, + 481, + 422 + ], + "lines": [ + { + "bbox": [ + 132, + 401, + 481, + 422 + ], + "spans": [ + { + "bbox": [ + 132, + 401, + 481, + 422 + ], + "type": "text", + "content": "Table 5: Zero-shot image-text retrieval on Flickr30K [34] dataset. All the models are pretrained on Laion-5B dataset." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 460, + 481, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 460, + 481, + 509 + ], + "spans": [ + { + "bbox": [ + 132, + 460, + 481, + 509 + ], + "type": "text", + "content": "Interestingly, for the text " + }, + { + "bbox": [ + 132, + 460, + 481, + 509 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 132, + 460, + 481, + 509 + ], + "type": "text", + "content": " image retrieval, we find that both the captioner and IG captioner have better performances than the CLIP classifier. Since our approach is to remove the bias in the text prediction, it does not affect the text " + }, + { + "bbox": [ + 132, + 460, + 481, + 509 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 132, + 460, + 481, + 509 + ], + "type": "text", + "content": " image retrieval. We leave this for the future research." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Results on Flickr30K. The results are summarized in Tab. 4. We observe the similar phenomena on MSCOCO. For the image " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " text retrieval, on the one hand, IG captioner shows significant improvements over the captioner. With the ViT-B image encoder, IG captioner improves the R@1 / R@5 / R@10 by " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "13.7\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "16.9\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "13.2\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " , and with the ViT-L image encoder, the improvements are " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "8.1\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "11.4\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "9.6\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " . On the other hand, the performance gaps between the IG captioner and the CLIP classifier are significantly reduced. For R@1, the gaps are " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "24.6\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "23.3\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " with ViT-B / ViT-L image encoder. However, for R@5 / R@10, the gaps become " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "7.2\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "4.0\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " with ViT-B encoder, and " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "4.9\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "1.3\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " with ViT-L encoder. For the text " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": " image retrieval, we observe the similar superiority of both the captioner and IG captioner over the CLIP classifier." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 114, + 479, + 274 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 479, + 274 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 479, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 479, + 274 + ], + "type": "table", + "html": "
αImageNet-1KMSCOCO image → text (%)Flickr30K image → text (%)
top-1 acc. (%) rlogP(T),OIGR@1R@5R@10rlogP(T),OIGR@1R@5R@10rlogP(T),OIG
0.045.40.8322.044.356.20.8742.268.476.80.90
0.149.10.8024.948.360.90.8545.671.981.30.88
0.252.50.7628.853.265.00.8150.276.884.70.85
0.355.60.7033.058.268.40.7754.580.087.70.81
0.458.40.6236.761.772.60.7158.284.290.30.76
0.560.70.5240.265.775.90.6261.686.492.30.70
0.662.70.4043.269.478.80.5163.288.293.60.61
0.763.80.2546.272.080.90.3663.489.094.00.48
0.864.30.0847.473.782.50.1960.690.094.70.32
0.963.9-0.1046.473.282.50.056.189.795.80.12
1.062.9-0.2743.370.681.4-0.2150.586.794.5-0.09
", + "image_path": "3f4274a16aca41a5b3da7e3efc825c6e7fd2f6767c818a6630ef16532bcf62dc.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "lines": [ + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "spans": [ + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "text", + "content": "Table 6: Ablations on the " + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "text", + "content": " of the IG captioner evaluation objective, " + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "inline_equation", + "content": "O_{\\mathrm{IG}} = \\log P(T|I) - \\alpha \\log P(T)" + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "text", + "content": ". All the performances are reported on zero-shot tasks. The IG captioner is pretrained on the Laion-5B dataset with the ViT-B image encoder. " + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "inline_equation", + "content": "r" + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "text", + "content": " is the Pearson Correlation Coefficient (PCC). The text " + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "text", + "content": " image recalls for the retrieval tasks are not reported because the value of " + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "text", + "content": " does affect the image " + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 130, + 274, + 482, + 340 + ], + "type": "text", + "content": " text predictions. The best accuracies, recalls and PCCs are marked with the color SpringGreen." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 372, + 254, + 385 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 372, + 254, + 385 + ], + "spans": [ + { + "bbox": [ + 132, + 372, + 254, + 385 + ], + "type": "text", + "content": "5 Ablation Studies" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 398, + 428, + 422 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 398, + 428, + 422 + ], + "spans": [ + { + "bbox": [ + 132, + 398, + 428, + 422 + ], + "type": "text", + "content": "5.1 Weights of the Text Prior Removal and Correlation Measurements" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": "Settings. In this section, we ablate the " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": " in the evaluation objective of IG captioner, " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\log P(T|I) - \\alpha \\log P(T)" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": ". We use the same training and evaluation settings as the main experiments. We pretrain the IG captioner with the ViT-B encoder on the Laion-5B dataset and perform zero-shot ImageNet classification and zero-shot image-text retrieval on MSCOCO and Flickr30K. We ablation the " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": " from 0.0 to 1.0 with a step size 0.1. For the retrieval tasks, we do not list the text " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": " image recalls because the value of " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": " does not affect the predictions of text " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": " image retrieval. In order to validate our goal of removing the bias from text priors, we report the Pearson Correlation Coefficient (PCC) of " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": " and the evaluation objective when varying the value of " + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 431, + 482, + 552 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "Results. We summarize the results in Tab. 6. On the one hand, the smaller correlation between " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " generally corresponds to better performances. For the ImageNet classification, when " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\alpha = 0.08" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": ", the best PCC 0.08 and performance " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "64.3\\%" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " are achieved at the same time. For the retrieval tasks on MSCOCO / Flickr30K, the best PCC, " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "0.0 / 0.12" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": ", and the highest R@10, " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "82.5\\% / 95.8\\%" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": ", are obtained simultaneously with " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\alpha = 0.9" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": ". On the other hand, it requires a degree of text priors to achieve the best fine-grained performances on specific datasets. The highest R@1, " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "47.4\\% / 63.4\\%" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": ", correspond to the PCC, " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "0.19 / 0.48" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "," + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 332, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 182, + 114, + 430, + 185 + ], + "blocks": [ + { + "bbox": [ + 182, + 114, + 430, + 185 + ], + "lines": [ + { + "bbox": [ + 182, + 114, + 430, + 185 + ], + "spans": [ + { + "bbox": [ + 182, + 114, + 430, + 185 + ], + "type": "table", + "html": "
approachencodereval obj ↑top-1 acc. (%)
LM + CapViT-Blog Pθ(T|I) - log Pψ(T)64.0
IG captionerViT-Blog Pθ(T|I) - log Pθ(T)64.3
LM + CapViT-Llog Pθ(T|I) - log Pψ(T)68.9
IG captionerViT-Llog Pθ(T|I) - log Pθ(T)69.8
", + "image_path": "a7a9efa710438ffeba30ce1470b5e028f6ffeb16cb1ab3bcc9bb0196b5c7d97f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 186, + 482, + 240 + ], + "lines": [ + { + "bbox": [ + 130, + 186, + 482, + 240 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 482, + 240 + ], + "type": "text", + "content": "Table 7: Approach ablations on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. LM + Cap stands for the approach that uses an unimodal Language Model (LM) and a standard multimodal captioner (Cap). The LM is trained with the captions only. " + }, + { + "bbox": [ + 130, + 186, + 482, + 240 + ], + "type": "inline_equation", + "content": "\\psi" + }, + { + "bbox": [ + 130, + 186, + 482, + 240 + ], + "type": "text", + "content": " represents the parameters of the LM while " + }, + { + "bbox": [ + 130, + 186, + 482, + 240 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 186, + 482, + 240 + ], + "type": "text", + "content": " the parameters of the Cap." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "spans": [ + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "text", + "content": "on MSCOCO / Flickr30K. " + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\alpha = 0.0" + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "text", + "content": " corresponds to the bad strong correlations, resulting in the poor performances. " + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\alpha = 1.0" + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "text", + "content": " causes the negative correlations and produces the unsatisfying performances. According to the ImageNet classification results with ViT-B encoder, we set " + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\alpha = 0.8" + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "text", + "content": " for all experiments in this paper. For the ImageNet classification with ViT-L encoder and all the image-text retrieval tasks, we do not change this " + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 276, + 482, + 350 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 369, + 416, + 383 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 416, + 383 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 416, + 383 + ], + "type": "text", + "content": "5.2 Language Model + Captioner versus IG Captioner" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "spans": [ + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "text", + "content": "Settings. IG captioner has a text decoder that is able to predict both " + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "text", + "content": ". One variant of IG captioner consists of a pair of models. One of them is the unimodal Language Model (LM) to predict " + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "text", + "content": ". The other one is the multimodal captioner, a standard captioner to predict " + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "inline_equation", + "content": "\\log P(T|I)" + }, + { + "bbox": [ + 130, + 393, + 482, + 467 + ], + "type": "text", + "content": ". During inference, the prediction is based on the subtraction of their outputs. We call this LM + Cap approach." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 487, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 482, + 548 + ], + "type": "text", + "content": "Results. We report the results in Tab. 7. It is observed that the LM + Cap approach performs worse than the IG captioner. Besides, it is less efficient due to the extra language model. From another perspective, it demonstrates that the text decoder of IG captioner is able to perform both the multimodal and unimodal tasks well." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 569, + 233, + 582 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 569, + 233, + 582 + ], + "spans": [ + { + "bbox": [ + 131, + 569, + 233, + 582 + ], + "type": "text", + "content": "5.3 IG Evaluation" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Settings. IG captioner differs from a standard captioner in both the training and evaluation phases. In this section, we study whether the IG evaluation will improve a standard captioner as a classifier. The IG evaluation requires the prediction of " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": ". Since the standard captioner can not directly predict this, we feed the captioner zero-intensity images to compute " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\log P(T|\\mathbf{0})" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " as the approximation." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 478, + 188 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 478, + 188 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 478, + 188 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 478, + 188 + ], + "type": "image", + "image_path": "fc817456419a8b93122a704a2fee1f6f780c88762fda3ab624245834e4c74a3e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "lines": [ + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "text", + "content": "Fig. 5: Ablations of the Information Gain (IG) evaluation on zero-shot ImageNet classification. All the models are trained on the Laion-5B dataset. Captioner + IG eval uses the evaluation objective, " + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "inline_equation", + "content": "\\log P(T|I) - \\alpha \\log P(T|\\mathbf{0})" + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "inline_equation", + "content": "\\log P(T|\\mathbf{0})" + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "text", + "content": " is the prediction of the captioner with the input being the zero-intensity image. It is used to approximate " + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "text", + "content": ", because the standard captioner after training is not able to directly predict " + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "inline_equation", + "content": "\\log P(T)" + }, + { + "bbox": [ + 130, + 193, + 482, + 260 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 146, + 284, + 468, + 340 + ], + "blocks": [ + { + "bbox": [ + 146, + 284, + 468, + 340 + ], + "lines": [ + { + "bbox": [ + 146, + 284, + 468, + 340 + ], + "spans": [ + { + "bbox": [ + 146, + 284, + 468, + 340 + ], + "type": "table", + "html": "
generative classifiermodel typepretrain dataparamstop-1 acc. (%)
Imagen [7,41]text-to-imageL5B + Psy2B62.7
Stable Diffusion 2.0 [19,40]text-to-imageL5B1.45B61.4
IG captionerimage-to-textL5B1.07B69.8
", + "image_path": "447785eb18aeaec54790f2945ec2fcc91367522aaaddaa76369dde3a4e732512.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 340, + 479, + 363 + ], + "lines": [ + { + "bbox": [ + 131, + 340, + 479, + 363 + ], + "spans": [ + { + "bbox": [ + 131, + 340, + 479, + 363 + ], + "type": "text", + "content": "Table 8: Comparisons of generative classifiers on zero-shot ImageNet classification. L5B and Psy represent the Laion-5B dataset and a proprietary dataset." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "text", + "content": "Results. We show the results in Tab. 5. The IG evaluation is able to significantly improve the performance of the captioners. Specifically, with the ViT-B / ViT-L image encoder, IG evaluation increases the zero-shot top-1 ImageNet classification accuracy by " + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "inline_equation", + "content": "9.0\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "inline_equation", + "content": "7.9\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "text", + "content": ". Adding the training part of IG captioner, the performances will be further improved by " + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "inline_equation", + "content": "10.7\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "inline_equation", + "content": "10.2\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 461 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 487, + 427, + 500 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 487, + 427, + 500 + ], + "spans": [ + { + "bbox": [ + 131, + 487, + 427, + 500 + ], + "type": "text", + "content": "5.4 Comparisons to Text-to-image Generative Classifiers" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 517, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 517, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 517, + 482, + 567 + ], + "type": "text", + "content": "Settings. There are two kinds of vision-language generative models: text-to-image generative models and image-to-text captioners. There have been recent works [7,19] that successfully convert the large text-to-image diffusion models to the zero-shot generative classifiers. We compare IG captioner with these models." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": "Results. The results are summarized in Tab. 8. With the same or smaller amount of pretraining data, IG captioner demonstrates the best performances. Compared with the Text-to-Image Classifiers [7] and Diffusion Classifier [19] usingImagen [41] and Stable Diffusion [40], respectively, IG captioner shows " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "7.1\\%" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "8.4\\%" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": " zero-shot top-1 accuracy improvements on ImageNet. Besides, IG captioner is a more compact model and only uses " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "53.5\\%" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": " / " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "73.8\\%" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": " of their parameters." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 114, + 304, + 185 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 304, + 185 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 304, + 185 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 304, + 185 + ], + "type": "table", + "html": "
training loss weightstop-1 acc. (%)
β: log P(T|I) γ: log P(T)
1.01.063.0
1.50.564.3
1.90.162.8
", + "image_path": "fffa463b2c2636af03e2ee1de42153d883109a213acb270e7912fc61f6d1cd91.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 322, + 121, + 482, + 178 + ], + "blocks": [ + { + "bbox": [ + 132, + 186, + 293, + 274 + ], + "lines": [ + { + "bbox": [ + 132, + 186, + 293, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 186, + 293, + 274 + ], + "type": "text", + "content": "Table 9: Ablations of the training loss weights on zero-shot ImageNet classification. The performances are obtained from the IG captioners trained on the Laion-5B dataset with ViT-B encoder. " + }, + { + "bbox": [ + 132, + 186, + 293, + 274 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 132, + 186, + 293, + 274 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 186, + 293, + 274 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 132, + 186, + 293, + 274 + ], + "type": "text", + "content": " are the weights of the multimodal and unimodal training objectives in Eqn. (6)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 322, + 121, + 482, + 178 + ], + "lines": [ + { + "bbox": [ + 322, + 121, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 322, + 121, + 482, + 178 + ], + "type": "table", + "html": "
modelsVQAv2 test-standard acc. (%)
CLIPN/A
captioner74.5
IG captioner75.2
", + "image_path": "73ea43e689505c4a9df83fbf8aca0406fff8f6601a60016840b27969b400f1b1.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 322, + 178, + 482, + 243 + ], + "lines": [ + { + "bbox": [ + 322, + 178, + 482, + 243 + ], + "spans": [ + { + "bbox": [ + 322, + 178, + 482, + 243 + ], + "type": "text", + "content": "Table 10: Generative evaluation on VQAv2. All the models are pretrained on the Laion-5B dataset with ViT-L encoder and fine-tuned on the VQAv2 dataset. CLIP can not perform the VQA task as a discriminative model." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 304, + 453, + 318 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 453, + 318 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 453, + 318 + ], + "type": "text", + "content": "5.5 Weights of the Multimodal and Unimodal Training Losses" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "text", + "content": "Settings and Results. We ablate the multimodal loss weight " + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "text", + "content": " and the unimodal loss weight " + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "text", + "content": " in the training objective of IG captioner (Eqn. (6)). We train the IG captioners with ViT-B encoder on the Laion-5B dataset and evaluate them on zero-shot ImageNet classification. The results are shown in Tab. 9. The equal weights do not produce the optimal results. We notice that image encoder is only trained with the multimodal loss while the text decoder is supervised by both the losses. We set the multimodal loss weight " + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\beta = 1.5" + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "text", + "content": " and the unimodal loss " + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\gamma = 0.5" + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "text", + "content": " for all the other experiments." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 435, + 358, + 449 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 435, + 358, + 449 + ], + "spans": [ + { + "bbox": [ + 131, + 435, + 358, + 449 + ], + "type": "text", + "content": "5.6 Generative Evaluation of IG Captioner" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 453, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 482, + 525 + ], + "type": "text", + "content": "Settings and Results. We evaluate the generative capability of IG captioner in this section. Specifically, after pertaining on the Laion-5B dataset, we perform the generative fine-tuning on the VQAv2 dataset. The results are shown in Tab. 10. The IG captioner outperforms the captioner, showing that the information gain approach improves the captioner in both discriminative and generative tasks." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 542, + 220, + 555 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 542, + 220, + 555 + ], + "spans": [ + { + "bbox": [ + 131, + 542, + 220, + 555 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 565, + 482, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 565, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 565, + 482, + 625 + ], + "type": "text", + "content": "In this paper, we address the challenge of using a generative captioner for zero-shot classification tasks. We identify and mitigate the issue of linguistic priors dominating visual signals by introducing the Information Gain (IG) captioner with novel training and evaluation methods. Our results show that the IG captioner is an effective zero-shot classifier." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 641, + 494, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 494, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 494, + 665 + ], + "type": "text", + "content": "Acknowledgements We gratefully acknowledge supports from ONR with N00014-23-1-2641." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 138, + 140, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 480, + 172 + ], + "type": "text", + "content": "1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 173, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 173, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 138, + 173, + 480, + 215 + ], + "type": "text", + "content": "2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. Advances in neural information processing systems 35, 23716-23736 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 216, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 216, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 138, + 216, + 480, + 248 + ], + "type": "text", + "content": "3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A versatile vision-language model for understanding, localization, text reading, and beyond (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 249, + 480, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 249, + 480, + 282 + ], + "spans": [ + { + "bbox": [ + 138, + 249, + 480, + 282 + ], + "type": "text", + "content": "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 282, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 282, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 138, + 282, + 480, + 315 + ], + "type": "text", + "content": "5. Chen, X., Fang, H., Lin, T.Y., Vedantam, R., Gupta, S., Dollar, P., Zitnick, C.L.: Microsoft coco captions: Data collection and evaluation server. arXiv preprint arXiv:1504.00325 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 315, + 480, + 337 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 315, + 480, + 337 + ], + "spans": [ + { + "bbox": [ + 138, + 315, + 480, + 337 + ], + "type": "text", + "content": "6. Church, K., Hanks, P.: Word association norms, mutual information, and lexicography. Computational linguistics 16(1), 22-29 (1990)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 337, + 480, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 480, + 358 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 480, + 358 + ], + "type": "text", + "content": "7. Clark, K., Jaini, P.: Text-to-image diffusion models are zero-shot classifiers. arXiv preprint arXiv:2303.15233 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 358, + 480, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 358, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 138, + 358, + 480, + 392 + ], + "type": "text", + "content": "8. Dai, W., Li, J., Li, D., Tiong, A.M.H., Zhao, J., Wang, W., Li, B., Fung, P., Hoi, S.: Instructblip: Towards general-purpose vision-language models with instruction tuning (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "text", + "content": "9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 424, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 424, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 424, + 480, + 468 + ], + "type": "text", + "content": "10. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 468, + 480, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 480, + 501 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 480, + 501 + ], + "type": "text", + "content": "1. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. In: European Conference on Computer Vision. pp. 89-106. Springer (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 501, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 501, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 501, + 480, + 544 + ], + "type": "text", + "content": "2. Ge, Y., Zeng, X., Huffman, J.S., Lin, T.Y., Liu, M.Y., Cui, Y.: Visual fact checker: Enabling high-fidelity detailed caption generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14033-14042 (2024)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 544, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 555 + ], + "type": "text", + "content": "3. te Grotenhuis, M., Matthijssen, A.: Basic SPSS tutorial. Sage Publications (2015)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 555, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 555, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 555, + 480, + 578 + ], + "type": "text", + "content": "4. He, H., Peng, N., Liang, P.: Pun generation with surprise. arXiv preprint arXiv:1904.06828 (2019)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "type": "text", + "content": "5. Hinton, G.E.: To recognize shapes, first learn to generate images. Progress in brain research 165, 535-547 (2007)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 599, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 599, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 599, + 480, + 621 + ], + "type": "text", + "content": "6. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "text", + "content": "7. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "8. Huang, S., Dong, L., Wang, W., Hao, Y., Singhal, S., Ma, S., Lv, T., Cui, L., Mohammed, O.K., Liu, Q., Aggarwal, K., Chi, Z., Bjorck, J., Chaudhary, V., Som," + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "type": "text", + "content": "S., Song, X., Wei, F.: Language is not all you need: Aligning perception with language models. ArXiv abs/2302.14045 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 481, + 159 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 481, + 159 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 481, + 159 + ], + "type": "text", + "content": "19. Li, A.C., Prabhudesai, M., Duggal, S., Brown, E., Pathak, D.: Your diffusion model is secretly a zero-shot classifier. arXiv preprint arXiv:2303.16203 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 160, + 481, + 201 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 160, + 481, + 201 + ], + "spans": [ + { + "bbox": [ + 132, + 160, + 481, + 201 + ], + "type": "text", + "content": "20. Li, B., Zhang, K., Zhang, H., Guo, D., Zhang, R., Li, F., Zhang, Y., Liu, Z., Li, C.: Llava-last: Stronger llms supercharge multimodal capabilities in the wild (May 2024), https://llava-v1.github.io/blog/2024-05-10-llava-last-stronger-llms/" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 203, + 481, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 203, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 132, + 203, + 481, + 224 + ], + "type": "text", + "content": "21. Li, J., Galley, M., Brockett, C., Gao, J., Dolan, B.: A diversity-promoting objective function for neural conversation models. arXiv preprint arXiv:1510.03055 (2015)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 225, + 481, + 256 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 225, + 481, + 256 + ], + "spans": [ + { + "bbox": [ + 132, + 225, + 481, + 256 + ], + "type": "text", + "content": "22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. In: International conference on machine learning. pp. 19730-19742. PMLR (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 258, + 481, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 258, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 132, + 258, + 481, + 289 + ], + "type": "text", + "content": "23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International conference on machine learning. pp. 12888-12900. PMLR (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 290, + 481, + 320 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 290, + 481, + 320 + ], + "spans": [ + { + "bbox": [ + 132, + 290, + 481, + 320 + ], + "type": "text", + "content": "24. Li, X.L., Holtzman, A., Fried, D., Liang, P., Eisner, J., Hashimoto, T., Zettlemoyer, L., Lewis, M.: Contrastive decoding: Open-ended text generation as optimization. arXiv preprint arXiv:2210.15097 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 322, + 481, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 322, + 481, + 354 + ], + "spans": [ + { + "bbox": [ + 132, + 322, + 481, + 354 + ], + "type": "text", + "content": "25. Liu, A., Sap, M., Lu, X., Swayamdipta, S., Bhagavatula, C., Smith, N.A., Choi, Y.: Dexperts: Decoding-time controlled text generation with experts and anti-experts. arXiv preprint arXiv:2105.03023 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 354, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 481, + 374 + ], + "type": "text", + "content": "26. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 376, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 376, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 481, + 407 + ], + "type": "text", + "content": "27. Liu, H., Li, C., Li, Y., Li, B., Zhang, Y., Shen, S., Lee, Y.J.: Llava-last: Improved reasoning,OCR,and world knowledge (January 2024),https://llava-v1.github.io/blog/2024-01-30-llava-last/" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 408, + 481, + 428 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 481, + 428 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 481, + 428 + ], + "type": "text", + "content": "28. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 430, + 481, + 460 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 481, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 481, + 460 + ], + "type": "text", + "content": "29. Ng, A., Jordan, M.: On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. Advances in neural information processing systems 14 (2001)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 461, + 481, + 492 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 461, + 481, + 492 + ], + "spans": [ + { + "bbox": [ + 132, + 461, + 481, + 492 + ], + "type": "text", + "content": "30. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 494, + 481, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 494, + 481, + 514 + ], + "spans": [ + { + "bbox": [ + 132, + 494, + 481, + 514 + ], + "type": "text", + "content": "31. OpenAI: Gpt-4 technical report. ArXiv abs/2303.08774 (2023), https://arxiv.org/abs/2303.08774" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 514, + 481, + 535 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 514, + 481, + 535 + ], + "spans": [ + { + "bbox": [ + 132, + 514, + 481, + 535 + ], + "type": "text", + "content": "32. Pearson, K.: VII. note on regression and inheritance in the case of two parents. proceedings of the royal society of London 58(347-352), 240-242 (1895)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 536, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 536, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 536, + 481, + 567 + ], + "type": "text", + "content": "33. Peng, Z., Wang, W., Dong, L., Hao, Y., Huang, S., Ma, S., Wei, F.: Kosmos-2: Grounding multimodal large language models to the world. arXiv preprint arXiv:2306.14824 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 568, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 568, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 568, + 481, + 610 + ], + "type": "text", + "content": "34. Plummer, B.A., Wang, L., Cervantes, C.M., Caicedo, J.C., Hockenmaier, J., Lazebnik, S.: Flickr30k entities: Collecting region-to-phrase correspondences for richer image-to-sentence models. In: Proceedings of the IEEE international conference on computer vision. pp. 2641-2649 (2015)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 612, + 463, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 612, + 463, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 612, + 463, + 621 + ], + "type": "text", + "content": "35. Quinlan, J.R.: Induction of decision trees. Machine learning 1, 81-106 (1986)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 481, + 665 + ], + "type": "text", + "content": "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "C. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 643 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents, 2022. URL https://arxiv.org/abs/2204.061257 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 481, + 172 + ], + "type": "text", + "content": "38. Ranzato, M., Susskind, J., Mnih, V., Hinton, G.: On deep generative models with applications to recognition. In: CVPR 2011. pp. 2857-2864. IEEE (2011)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 215 + ], + "type": "text", + "content": "39. Reid, M., Savinov, N., Teplyashin, D., Lepikhin, D., Lillicrap, T., Alayrac, J.b., Soricut, R., Lazaridou, A., First, O., Schrittwieser, J., et al.: Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context. arXiv preprint arXiv:2403.05530 (2024)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "text", + "content": "40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "text", + "content": "41. Sahara, C., Chan, W., Chang, H., Lee, C., Ho, J., Salimans, T., Fleet, D., Norouzi, M.: Palette: Image-to-image diffusion models. In: ACM SIGGRAPH 2022 Conference Proceedings. pp. 1-10 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 282, + 481, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 481, + 326 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 481, + 326 + ], + "type": "text", + "content": "42. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 326, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 481, + 369 + ], + "type": "text", + "content": "43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278-25294 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 403 + ], + "type": "text", + "content": "44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 403, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 481, + 435 + ], + "type": "text", + "content": "45. Su, Y., Lan, T., Wang, Y., Yogatama, D., Kong, L., Collier, N.: A contrastive framework for neural text generation. Advances in Neural Information Processing Systems 35, 21548-21561 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "type": "text", + "content": "46. Team, G., Anil, R., Borgeaud, S., Wu, Y., Alayrac, J.B., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., et al.: Gemini: a family of highly capable multimodal models. arXiv preprint arXiv:2312.11805 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 468, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 481, + 501 + ], + "type": "text", + "content": "47. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "text", + "content": "48. Wang, P., Yang, A., Men, R., Lin, J., Bai, S., Li, Z., Ma, J., Zhou, C., Zhou, J., Yang, H.: Ofa: Unifying architectures, tasks, and modalities through a simple sequence-to-sequence learning framework. In: International conference on machine learning. pp. 23318-23340. PMLR (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 545, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 481, + 578 + ], + "type": "text", + "content": "49. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 578, + 481, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 481, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 481, + 611 + ], + "type": "text", + "content": "50. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "type": "text", + "content": "51. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 331, + 91, + 447, + 102 + ], + "type": "text", + "content": "Information-Gain Captioner" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_content_list.json b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..debf0349bb1060c9845088185bcd13fddb57744a --- /dev/null +++ b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_content_list.json @@ -0,0 +1,1700 @@ +[ + { + "type": "text", + "text": "IGNORE: Information Gap-based False Negative Loss Rejection Single Positive Multi-Label Learning", + "text_level": 1, + "bbox": [ + 305, + 140, + 730, + 209 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "GyeongRyeol Song, Noo-ri Kim, Jin-Seop Lee, and Jee-Hyong Lee*", + "bbox": [ + 236, + 234, + 764, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Sungkyunkwan University, Suwon, South Korea {thd7524, pd99j, wlstjq0602, john}@skku.edu", + "bbox": [ + 333, + 262, + 669, + 292 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Single Positive Multi-Label Learning (SPML) is a method for a scarcely annotated setting, in which each image is assigned only one positive label while the other labels remain unannotated. Most approaches for SPML assume unannotated labels as negatives (\"Assumed Negative\", AN). However, with this assumption, some positive labels are inevitably regarded as negative (false negative), resulting in model performance degradation. Therefore, identifying false negatives is the most important with AN assumption. Previous approaches identified false negative labels using the model outputs of assumed negative labels. However, models were trained with noisy negative labels, their outputs were not reliable. Therefore, it is necessary to consider effectively utilizing the most reliable information in SPML for identifying false negative labels. In this paper, we propose the Information Gap-based False Negative LOss REjection (IGNORE) method for SPML. We generate the masked image that all parts are removed except for the discriminative area of the single positive label. It is reasonable that when there is no information of an object in the masked image, the model's logit for that object is low. Based on this intuition, we identify the false negative labels if they have a significant model's logit gap between the masked image and the original image. Also, by rejecting false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on four datasets: Pascal VOC 2012, MS COCO, NUSWIDE, and CUB. Compared to previous state-of-the-art methods in SPML, our method outperforms them on most of the datasets.", + "bbox": [ + 261, + 325, + 743, + 674 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Multi-Label Learning $\\cdot$ Single Positive Multi-Label Learning $\\cdot$ Information Gap $\\cdot$ False Negative Rejection", + "bbox": [ + 259, + 686, + 740, + 714 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 739, + 375, + 755 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Multi-label learning is an approach that trains a model using images with multiple labels, aiming to build a model that is able to predict all relevant labels for the images with multiple labels. Unlike multi-class learning, where the model aims to", + "bbox": [ + 212, + 771, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author", + "bbox": [ + 217, + 824, + 382, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/034e28894c18cad2fe922649c08d07ffcb1124e0d587209914bf74658ce3a6e4.jpg", + "image_caption": [ + "Fig. 1: Example of an image for Single Positive Multi-Label Learning (SPML) and our main idea for SPML. Ground truth is 1 if there is a corresponding object, otherwise 0. In SPML, only one positive label is given, and all the other labels are not given, i.e., unannotated. In Assumed Negative (AN) assumption, all unannotated labels are assumed to be negative. Here, false negative labels mean the unannotated positive labels, which are incorrectly assumed to be negative. To identify the false negative labels, we first extract the discriminative areas of the single positive label and generate the masked image. Then, we utilize the information gap between the original image and the masked image." + ], + "image_footnote": [], + "bbox": [ + 222, + 150, + 400, + 292 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/99d881203f7f43047434d8efc057eecda92656e56710303c54223007c0ef6539.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 401, + 148, + 620, + 292 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/a6d3bdeea3a07784a45340baf1917d3cf21ecc7bb2399cdc9e40b3492ec358c0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 622, + 148, + 781, + 296 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "predict only a single label for the input image, multi-label learning is much more challenging because the model aims to predict multiple labels associated with the input image. Moreover, multi-label learning is more practical and realistic than multi-class learning, as the majority of real-world images contain multiple objects [2,3,17,20,22,31]. To achieve effective multi-label learning, similar to other supervised learning tasks, a fully labeled dataset is required. However, real-world images typically contain tens to thousands of different classes, and fully annotating all of them is extremely labor-intensive and practically unfeasible.", + "bbox": [ + 212, + 470, + 787, + 593 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To reduce labor-intensive costs, researches on Single Positive Multi-Label Learning (SPML) have been increasing recently [5,12,13,26,29,33]. As shown in Fig. 1, in SPML, only one positive label is given and the others are unannotated for each images. To deal with unannotated labels in SPML, most approaches [12,13,26,29] assumed unannotated labels as negative (Assumed Negative, AN). This assumption has the advantage of providing supervision for all unannotated labels. Also, this assumption is reasonable because most multi-label datasets are dominated by negatives. However, by assuming all unannotated labels as negatives, it inevitably provides incorrect supervision for actually positive labels among the unannotated ones. In other words, these labels are false negative labels. These false negative labels can consistently cause confusion during model training, and impair the model's generalization ability.", + "bbox": [ + 212, + 595, + 787, + 777 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Therefore, most studies [5,12,13,26,29] are focusing on identifying false negatives in SPML. They usually identify false negatives by utilizing model output's confidence or losses. In more detail, they identify the labels with abnormally high values of the model's outputs [26, 29] or losses [12, 13] as false negative labels.", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/9419fe6d63fb140200cc934a1b48e32f7c2d8e52d46f376bee5461df52277036.jpg", + "image_caption": [ + "Fig. 2: Overview of the proposed method. In our method, we generate a masked image through the single positive label. Then, we utilize the logit gap between the masked image and the original image to identify false negatives and reject them in training $(\\mathcal{L}_{\\text{IGNORE}})$ ." + ], + "image_footnote": [], + "bbox": [ + 222, + 147, + 781, + 343 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Because it implies that unannotated labels could be positive labels. However, the confidence or losses for the false negative labels are not reliable because models could learn them with noisy labels. To address this issue, it is necessary to consider robust criterion that are insensitive to noisy labels.", + "bbox": [ + 212, + 443, + 782, + 503 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Since the single positive labels are the most reliable information in SPML, the model's output for the single positive label is reliable. Therefore, we can capture the discriminative areas [11, 15, 28, 32, 34] of objects and generate a masked image that includes only the discriminative areas of the single positive label (see Fig. 1). The masked image contains only the information corresponding to the single positive label. On the other hand, the original image contains information corresponding to ground truth labels. It is reasonable that when there is no information of an object in the image, the model's output for that object is low. Therefore, for false negatives, the model's output for the original image is expected to be higher than the model's output for the masked image. By utilizing the model's output gap resulting from the information gap between the images, false positive labels would be effectively identified.", + "bbox": [ + 212, + 505, + 787, + 684 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this paper, we propose the Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. By rejecting the false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on various benchmark datasets such as PASCAL VOC 2012 [9], MS COCO [16], NUSWISE [4], and CUB [27]. Our method also outperforms most of the state-of-the-art methods in SPML.", + "bbox": [ + 212, + 686, + 787, + 791 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 114, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 143, + 397, + 160 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Problems with AN loss. In SPML, Assume Negative (AN) is the main approach that provides supervision to unannotated labels. Since multi-label datasets are dominated by negatives [21], assuming unannotated labels as negatives can be a reasonable and straightforward approach in situations where most of the label information is unknown. Also, Binary Cross-Entropy (BCE) loss in AN is referred to as AN loss. With AN loss, losses of all unannotated labels are calculated through the negative term of BCE. Thus, the model erroneously learns the unannotated positive labels (false negative labels) as negative labels. This confusion in multi-label learning results in bias to false negative labels and model performance drop. There are researches that point out issues caused by false negative label learning with AN loss [13,33]. In training with AN loss, BoostLU [13] observed that the attribution score of Class-Activation Map (CAM) is damaged due to false negative labels. To address this issue, they proposed an activation function that can boost the damaged CAM. EM [33] pointed out the issue that AN loss incurs the high loss gradient propagation problem for false negative labels. They proposed an entropy maximization loss that suppresses the gradient for unannotated labels with high prediction, without assuming unannotated labels as negatives.", + "bbox": [ + 212, + 194, + 787, + 467 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In summary, learning false negative labels causes confusion in model training by continuously propagating the incorrect information to the model and affects the model's output. Therefore, it is necessary to consider the false negative labels when utilizing AN loss in SPML.", + "bbox": [ + 212, + 467, + 787, + 527 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Approaches and Challenges for False Negatives. There are approaches that reject the identified false negative labels or regard them as positive labels. PLC [29] adopted a model prediction-based pseudo-labeling method. While training with AN loss, they generated pseudo-labels for unannotated labels using a fixed threshold. Using these pseudo-labels, They trained the model with unannotated labels once again. SCL [26] identified labels as false negatives with significantly high values of model predictions, and other methods [12, 13] used losses to identify false negatives. These methods proposed utilizing identified false negatives as positives in training or rejecting them from training.", + "bbox": [ + 212, + 551, + 787, + 688 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In multi-label learning, usually the number of negatives overwhelms the number of positives in each sample. Therefore, it is challenging to identify as many false negatives as desired with high precision. Additionally, if the model incorrectly learns actual negative labels as positive, it can lead to significant bias in the model for those labels. As a result, generally rejecting the identified false negatives from training showed better performance.", + "bbox": [ + 212, + 688, + 787, + 779 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Despite consideration of false negatives, however, because these methods are based on the AN loss, the model is easy to learn incorrect label information. The model learns assumed negative labels with incorrect label information, the distinct model outputs associated with false negative labels (e.g., high loss or high", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 230, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "probability) gradually become more similar to those of true negatives. That is, it becomes more challenging to identify false negatives from true negative labels using the information from assumed negative labels. Therefore, it is necessary to identify false negatives through new criterion rather than relying on the information from assumed negative labels.", + "bbox": [ + 212, + 146, + 782, + 220 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Proposed Method", + "text_level": 1, + "bbox": [ + 215, + 246, + 426, + 263 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we propose the method of identifying and rejecting false negatives based on the information gap between the masked image and the original image. Firstly, we introduce the preliminary in Sec. 3.1. Then, we explain the proposed method in the following sections.", + "bbox": [ + 212, + 277, + 782, + 338 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Preliminary", + "text_level": 1, + "bbox": [ + 215, + 361, + 359, + 376 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "For single positive multi-label learning tasks, a dataset $\\mathcal{D} = \\{\\mathbf{x}_n,\\mathbf{y}_n\\}_{n = 1}^N$ is given, where $\\mathbf{x}_n$ is an image and $\\mathbf{y}_n\\in \\mathcal{V} = \\{u,1\\} ^C$ is the vector of labels. $N$ is the number of images, and $C$ is the number of classes. The $\\mathbf{y}_n$ consists of a single positive label and unknown labels. Except for the single positive, the others are unannotated labels. The single positive label is indicated by 1 and unannotated labels are indicated by $u$ .", + "bbox": [ + 212, + 388, + 784, + 477 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In SPML, most approaches assumed unannotated labels as negative, and trained models using AN (Assume Negative) loss as follows:", + "bbox": [ + 214, + 479, + 782, + 508 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} _ {A N} = - \\frac {1}{B C} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} [ \\mathbb {I} [ y _ {i j} = 1 ] \\cdot \\log (p _ {i j}) \\tag {1} \\\\ + \\mathbb {I} [ y _ {i j} = u ] \\cdot \\log (1 - p _ {i j}) ] \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 523, + 784, + 583 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $y_{ij}$ is the label of the $j$ -th class for the $i$ -th image, and $p_{ij}$ is the model's prediction for $y_{ij}$ . $B$ is the batch size, $C$ is the number of classes, and $\\mathbb{I}$ is the indicator function that returns 1 if the condition is true and 0 otherwise. Since the AN loss is useful to give supervision to unannotated labels, our approach also based on the AN loss. However, the AN loss inevitably provides incorrect supervision for actually positive labels among the unannotated ones. Therefore, it is necessary to consider that effectively utilizing the most reliable information in SPML to minimize false negative problems.", + "bbox": [ + 212, + 595, + 784, + 715 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Overview of Proposed Method", + "text_level": 1, + "bbox": [ + 214, + 738, + 514, + 753 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this paper, we propose our Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. The method for identifying false negative labels based on the information gap proceeds through the following steps. Firstly, we generate the masked image that all parts are removed except the discriminative area of the single positive label (see Fig. 2). Then, we compare", + "bbox": [ + 212, + 763, + 782, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 114, + 730, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "the model's logit gap between the masked image and the original image. If there is an object in the masked-out areas of the masked image, there is likely to be a substantial gap in the model's logit between the masked image and the original image. Because the object is absent in the masked image, in contrast to the original image. Based on this intuition, we identified the false negative labels if they have a significant model's output gap between the two images. The details of UNUSED's components are discussed in Sec. 3.3. As shown in Fig. 2, after identifying the false negative labels, we reject the losses of the corresponding negative labels to prevent the model from learning incorrect label information.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Components of False Negative Loss Rejection", + "text_level": 1, + "bbox": [ + 214, + 301, + 637, + 316 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we first introduce the process of generating the masked images that provide information to identify false negatives in our proposed method. And then, we introduce the logit gap threshold and the logit average threshold that compose our information gap-based false negative loss rejection, UNUSED.", + "bbox": [ + 212, + 325, + 784, + 387 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Generation of Masked Image. We identify and reject the false negative labels based on the information gap between the masked image and the original image. In this section, we discuss the method of generating the masked images through the single positive labels. It is well-known that the class-activation map (CAM) [23, 32] focuses on the discriminative areas of objects [11, 15, 28, 34]. Furthermore, BoostLU [13] reported that the model trained with AN loss can extract reliable CAM compared to the CAM extracted by a model trained with fully-labeled dataset. Therefore, we extract the CAM for the single positive labels from the original image $\\mathbf{x}$ . The detailed explanation for extracting the CAM is in the supplementary material. Based on the CAM, we generate the mask as follows:", + "bbox": [ + 212, + 405, + 787, + 568 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nM _ {i j} = \\left\\{ \\begin{array}{l l} 1 & \\text {i f} A _ {i j} > \\gamma \\\\ 0 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 421, + 568, + 784, + 606 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $A$ and $M$ indicate the CAM and the mask, respectively. Also, $\\gamma$ is a CAM threshold to capture discriminative area for the positive label. By multiplying this mask with the original image $\\mathbf{x}$ element-wise, we can generate a masked image $\\mathbf{x}^M$ where the areas only related to single positive labels are preserved, and the rest of the image is masked out as follows:", + "bbox": [ + 212, + 609, + 787, + 686 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {x} ^ {M} = \\mathbf {x} \\odot M \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 454, + 695, + 784, + 710 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The masked image is used to establish the Logit Gap Threshold for identifying the false negative labels.", + "bbox": [ + 212, + 719, + 784, + 750 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Logit Gap Threshold. We design the criterion for identifying the false negative labels based on the logit gap between the masked image $\\mathbf{x}^M$ and the original image $\\mathbf{x}$ . The logit gap $G$ is defined as follows:", + "bbox": [ + 212, + 768, + 787, + 816 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nG _ {i j} = \\left| h \\left(f \\left(\\mathbf {x} _ {i}\\right)\\right) _ {j} - h \\left(f \\left(\\mathbf {x} _ {i} ^ {M}\\right)\\right) _ {j} \\right| \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 392, + 824, + 784, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $f$ and $h$ denotes image encoder and classification head, respectively. We define the logit for the image as $h(f(\\mathbf{x}))$ , and the logit for the $j$ -th class of the $i$ -th image as $h(f(\\mathbf{x}_i))_j$ . Among the assumed negative labels, the labels with a high $G$ are more likely to be false negatives.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As shown in Fig. 2, in the masked image, the object of the single positive label retains some of its information, but any information of the other objects is completely eliminated in the masked image. The value of $G$ for the other objects in the image will be larger than the value of $G$ for the single positive label. Based on this observation, we set the threshold $\\tau$ using the average $G$ value of the single positive labels. The $\\tau$ is defined as follows:", + "bbox": [ + 212, + 207, + 784, + 297 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\tau^ {t} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} t = 0 \\\\ \\lambda \\tau^ {t - 1} + (1 - \\lambda) \\frac {\\sum_ {j = 1} ^ {C} \\sum_ {i = 1} ^ {B} I \\left[ y _ {i j} = 1 \\right] G _ {i j}}{B} & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 305, + 311, + 784, + 352 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $B$ denotes the batch size. The gap threshold $\\tau$ is adaptively updated at each iteration $t$ using Exponential Moving Average (EMA). $\\lambda$ is a hyperparameter that determines the momentum decay of the EMA.", + "bbox": [ + 212, + 357, + 782, + 402 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Logit Average Threshold. In this section, we introduce logit average threshold. We identify the false negatives that are actually present in the original image with the logit gap resulting from the information gap between the images. Therefore, even if a large logit gap occurs for labels that are not actually present in the original image, we do not need to identify these labels as false negatives labels with low logit values in the original image are likely to be true negatives that did not originally exist in the original image. To prevent these rejection of true negatives in our rejection method, we propose the logit average threshold.", + "bbox": [ + 212, + 426, + 784, + 547 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "It is evident that the logits of true negative labels are relatively low. Therefore, we only consider the rejection of the labels with a logit higher than the average of the logits for each class. We set the threshold $\\mu$ as the average logit of assumed negative labels for each class. We select the labels with logits higher than the threshold $\\mu$ . Through this process, we only reject the selected labels. Additionally, $\\mu$ is self-adaptively updated using Exponential Moving Average (EMA) at each iteration. The threshold $\\mu_j^t$ for the j-th class at time step $t$ is as follows:", + "bbox": [ + 212, + 547, + 784, + 667 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mu_ {j} ^ {t} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} t = 0 \\\\ \\lambda \\mu_ {j} ^ {t - 1} + (1 - \\lambda) \\frac {1}{N _ {j}} \\sum_ {i = 1} ^ {N _ {j}} \\mathbb {I} [ y _ {i j} = u ] \\cdot h (f (\\mathbf {x} _ {i})) _ {j} & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 271, + 678, + 784, + 719 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $N_{j}$ denotes the number of assumed negative labels for the j-th class.", + "bbox": [ + 214, + 729, + 751, + 744 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.4 Training with False Negative Loss Rejection", + "text_level": 1, + "bbox": [ + 214, + 768, + 625, + 782 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Information Gap-based False Negative Loss Rejection. In this section, we describe our rejection function that incorporates both the logit average threshold and the logit gap threshold. The rejection function $R$ incorporating the logit", + "bbox": [ + 212, + 794, + 782, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 113, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "average threshold and the logit gap threshold is defined as follows:", + "bbox": [ + 215, + 146, + 694, + 161 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nR _ {i j} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} h \\left(f \\left(\\mathbf {x} _ {i}\\right)\\right) _ {j} > \\mu_ {j} ^ {t} \\text {a n d} G _ {i j} > \\tau^ {t} \\\\ 1 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 348, + 169, + 785, + 209 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The rejection function $R$ rejects the labels with $G$ higher than the $\\tau$ and a logit higher than $\\mu$ . In other words, it identifies the labels with high logit values for the original image and a significant logit gap between the two images, then rejects them from the training.", + "bbox": [ + 212, + 215, + 782, + 275 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "By incorporating this function into the negative term of the AN loss, identified false negatives are rejected from the model training. Our IgnORE method that combined with AN loss and the rejection function $R$ is as follows:", + "bbox": [ + 212, + 276, + 784, + 321 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} _ {\\text {I G N O R E}} = - \\frac {1}{S} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\left(\\mathbb {I} \\left[ y _ {i j} = 1 \\right] \\cdot \\log \\left(p _ {i j} ^ {s}\\right) \\right. \\tag {8} \\\\ + \\mathbb {I} [ y _ {i j} = u ] \\cdot R _ {i j} \\cdot \\log \\left(1 - p _ {i j} ^ {s}\\right)) \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 344, + 329, + 785, + 392 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $S$ denotes the sum of the single positive labels and the labels that are not rejected negative labels. $p_{ij}^{s}$ denotes $\\sigma (h(f(\\mathbf{x}_i^s)_j)$ and $\\sigma$ denotes sigmoid function. $\\mathbf{x}^s$ denotes strong augmented image. It is well known that strong augmentation improves the generalization ability of deep learning models across most datasets [1, 6, 7, 24, 30]. Therefore, we utilize the strong augmented images to enhance model generalization.", + "bbox": [ + 212, + 398, + 782, + 488 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Single Positive Binary Classification (SPBC). We utilize the CAM of the single positive labels. Therefore, it is necessary to train the model with correct supervision for the single positive labels. The model learns given single positive labels through binary classification for a single positive class. Single Positive Binary Classification (SPBC) is defined as follows:", + "bbox": [ + 212, + 508, + 782, + 584 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {S P B C} = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\mathbb {I} [ y _ {i j} = 1 ] \\cdot \\log (p _ {i j}) \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 593, + 785, + 635 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Consistency Regularization. Our method identifies the false negatives based on the model's logits. Therefore, our model needs to output consistent logits on similar images. To ensure such consistency, we take into account the consistency regularization between original images and strongly augmented images used in our framework. We propose the consistency regularization to the logits between original images and strongly augmented images, enabling the model to have consistency across differently augmented images. This ensures that the model produces consistent logits for different views of the same image. Our consistency regularization is defined as follows:", + "bbox": [ + 212, + 652, + 787, + 789 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {r e g} = - \\frac {1}{B C} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\left| h \\left(f \\left(\\mathbf {x} _ {i}\\right) _ {j} - h \\left(f \\left(\\mathbf {x} _ {i} ^ {s}\\right)\\right) _ {j} \\right| ^ {2} \\right. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 343, + 801, + 785, + 842 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Overall loss. The overall loss is as follows:", + "bbox": [ + 215, + 146, + 532, + 160 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\lambda_ {S P B C} \\cdot \\mathcal {L} _ {S P B C} + \\mathcal {L} _ {I G N O R E} + \\lambda_ {r e g} \\cdot \\mathcal {L} _ {r e g} \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 336, + 176, + 785, + 193 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\lambda_{SPBC}$ and $\\lambda_{reg}$ are hyperparameters that denote the weights assigned to the respective loss terms.", + "bbox": [ + 212, + 199, + 784, + 229 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 253, + 375, + 271 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section, we present our experimental results and compare them with previous SPML approaches. Furthermore, we conduct an ablation study to analyze why our method is effective in SPML. We use mean average precision (mAP) as the comparison metric with previous approaches.", + "bbox": [ + 212, + 285, + 782, + 347 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 368, + 426, + 383 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets. We use four benchmark datasets to demonstrate our experimental results: PASCAL VOC 2012 [9], MS COCO 2014 [16], NUSWIDE [4], and CUB [27]. Following the settings of previous research [5], we create a single positive multi-label setting for the four benchmark datasets by randomly retaining one positive label and removing all other annotations. In particular, for the CUB dataset [27], we use bird attributes as target classes instead of bird categories, following the setup of ROLE [5]. For each dataset, we reserve $20\\%$ of the train set as a validation set, and select the best model based on its performance on the validation set.", + "bbox": [ + 212, + 393, + 784, + 529 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Models. For a fair comparison with previous approaches [5,12,13,19,29,33], we conduct experiments with two models [10, 17]. One of the models is a ResNet-50 [10] that is pre-trained on ImageNet [8]. For ResNet-50, We employ the architecture of a convolutional layer followed by a 1x1 convolutional layer and global average pooling, the same as BoostLU [13].", + "bbox": [ + 212, + 551, + 784, + 628 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The other one is a model with a transformer [25] architecture called Q2L [17]. For the image encoder of Q2L [17], we utilize the ResNet-50 [10] that is pretrained on ImageNet [8]. We explain the details on how to obtain CAMs for each model in Supplementary details.", + "bbox": [ + 212, + 628, + 784, + 688 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Hyperparameter Settings. For Q2L, we set batch sizes in $\\{8, 16\\}$ , learning rates in $\\{1e-4, 1e-5\\}$ . We use AdamW [18] as optimizer and OneCycleLR as scheduler. For ResNet-50, we set batch sizes in $\\{8, 12, 16\\}$ , learning rates in $\\{1e-4, 1e-5\\}$ , and use Adam [14] as optimizer. Each image is resized to $448 \\times 448$ . Only random HorizontalFlip is used for original images, while random horizontal flip and RandAugmentation [7] are used for strong augmented images CAM threshold $\\gamma$ is set to 0.4 for ResNet-50 and 0.8 for Q2L, respectively. In Q2L, we set the CAM threshold to 0.8. And, we set loss weights $\\lambda_{reg}$ to 0.5, and $\\lambda_{SPBC}$ to 0.5 except COCO dataset. On COCO dataset, we set loss weights $\\lambda_{reg}$ to 0.1,", + "bbox": [ + 212, + 703, + 785, + 842 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 113, + 730, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/9e7945ecb7c4e9d0db5886b7ca50b68c8db6d022415d0d6db7da0170efa6d614.jpg", + "table_caption": [ + "Table 1: Experimental results of our method with Q2L model on four SPML benchmark datasets. Metric presented in the table is mAP (mean Average Precision). Additionally, bold font indicates the highest performance, while underlining indicates the second highest performance. Our method demonstrates the highest performance on most datasets." + ], + "table_footnote": [], + "table_body": "
MethodDataset
VOCCOCONUSCUB
AN87.672.348.518.6
WAN [5]89.273.548.522.5
EPR [5]88.872.749.323.1
AN-LS [5]88.070.947.116.3
ROLE [5]88.169.644.514.2
EM [33]89.273.248.722.2
EM + APL [33]89.273.148.623.6
PLC + LAC [29]89.675.651.123.3
Ours90.176.352.823.4
", + "bbox": [ + 359, + 226, + 645, + 422 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "and $\\lambda_{SPBC}$ to 0.5. In ResNet-50, we set the CAM threshold in $\\{0.4, 0.5\\}$ . And, we set the loss weights $\\lambda_{reg}$ to 0.5, and $\\lambda_{SPBC}$ to 0.1 except CUB dataset. On CUB dataset, we set loss weights $\\lambda_{reg}$ to 0.5, and $\\lambda_{SPBC}$ to 0.5. Considering that the updates for the threshold $\\tau$ might not be sufficient in the early stages of training, we set the warm-up phase. In warm-up phase, our model is trained with AN loss.", + "bbox": [ + 212, + 452, + 787, + 542 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Experimental Results", + "text_level": 1, + "bbox": [ + 215, + 570, + 441, + 585 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Performance with Q2L model. We compare our experimental results with recent approaches for the Q2L model on four datasets: Weak Assume Negative (WAN) [5], Expected Positive Regularization (EPR) [5], Assume Negative-Label Smoothing (AN-LS) [5], ROLE [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], and Pseudo-Labeling Consistency Regularization (PLC) with Label-Aware Global Consistency Regularization (LAC) [29].", + "bbox": [ + 212, + 599, + 785, + 690 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "As shown in Tab. 1, our method outperforms recent approaches on the VOC, COCO, and NUSWIDE datasets. In particular, on the NUSWIDE dataset, our method achieved an mAP of 1.7, higher than the previous best-performed approach. For CUB, our method do not achieve the best performance, but it shows the second-best results. The gap in performance with the best-performed approach is very small, so it can be considered comparable.", + "bbox": [ + 212, + 691, + 785, + 782 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Performance with ResNet-50 model. For ResNet-50, we compare the experimental results with the following recent approaches: Label-Smoothing (LS) [19],", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/a2b7798711dfa69e678d72942c95384009e9267941de022e984864e18280dc2a.jpg", + "table_caption": [ + "Table 2: Experimental results of our method with ResNet-50 model on four SPML benchmark datasets. Detailed ingredient of the table (metrics, bold, and underline) is the same as in Table 1." + ], + "table_footnote": [], + "table_body": "
MethodDataset
VOCCOCONUSCUB
AN85.8964.9242.2718.31
LS [19]87.9067.1543.7716.26
ASL [21]87.7668.7846.9318.81
ROLE [5]87.7767.0441.6313.66
ROLE + LI [5]88.2669.1245.9814.86
EM [33]89.0970.7047.1520.85
EM + APL [33]89.1970.8747.5921.84
LL-R [12]88.2770.7048.7619.56
+ BoostLU [13]89.2972.8949.5919.80
Ours89.1972.0050.0821.90
", + "bbox": [ + 352, + 198, + 651, + 422 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Assymmetric loss (ASL) [21], ROLE [5], ROLE with LinearInit (LI) [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], Large Loss Rejection (LL-R) [12], and Large Loss Rejection (LL-R) [12] with BoostLU [13].", + "bbox": [ + 215, + 450, + 784, + 497 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "As shown in Tab. 2, our method exhibited the highest performances on the NUSWIDE and CUB dataset compared to recent approaches. On VOC and COCO, our method achieves the second-best performances. While not achieving the best performance on all datasets, We observe that our method with ResNet-50 performs well enough to be comparable to state-of-the-art approaches.", + "bbox": [ + 215, + 498, + 784, + 574 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Ablation Studies", + "text_level": 1, + "bbox": [ + 217, + 599, + 398, + 614 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We analyze the effectiveness of our framework components, analysis of logit gap, effectiveness of logit average threshold, comparison for false negative identification, and sensitivity analysis of CAM threshold.", + "bbox": [ + 215, + 630, + 782, + 675 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/101e80407782cc044a98184a1d8a603a708edd039d6214aee0bc4ed32639d3da.jpg", + "table_caption": [ + "Table 3: Ablation study of our method with Q2L model." + ], + "table_footnote": [], + "table_body": "
Consistency Reg.IGNORE + SPBCw/ Logit Avg. ThresholdVOCCOCONUSWIDECUB
87.973.549.219.7
✓88.873.647.511.1
✓✓90.076.252.022.8
✓✓✓90.176.352.823.4
", + "bbox": [ + 274, + 729, + 722, + 808 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 114, + 730, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Analysis of Proposed Components. To demonstrate the effectiveness of the components in our framework, we conduct an ablation study using the PASCAL VOC, COCO, NUSWIDE and CUB datasets. In Tab. 3, the first row is the case where the model is trained with only AN loss. As shown in Tab. 3, when all components are included, the highest performance is achieved. The logit average threshold shows meaningful improvements in NUSWIDE and CUB. Considering that NUSWIDE and CUB have a relatively large number of classes, it is evident that the logit average threshold works more effectively in datasets with a larger number of classes. Also, when only consistency regularization is applied without ignore and SPBC, there was a significant performance drop in NUSWIDE and CUB. This observation indicates that simply applying consistency regularization alone does not significantly improve performance. In contrast, applying it with ignore and SPBC results in notable performance improvements. It means that our regularization is mutually effective when combined with our ignore method.", + "bbox": [ + 212, + 146, + 787, + 375 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/71a6e1c337a11011772ffa5a07a20db3dfa441a90e80cedf6d7099a13fb6cf43.jpg", + "image_caption": [ + "(a) Logit Gap Distribution" + ], + "image_footnote": [], + "bbox": [ + 246, + 390, + 472, + 513 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/ed426926680e5a1d640c5182c23a6a5d5ecacfa8aedbed77914fe2545ef12ea3.jpg", + "image_caption": [ + "(b) Ablation Study of Logit Average Threshold", + "Fig. 3: Analysis of Logit Gap Threshold and Logit Average Threshold on PASCAL VOC 2012. SP, TN, and FN indicate the single positive, true negative, and false negative, respectively." + ], + "image_footnote": [], + "bbox": [ + 521, + 390, + 764, + 513 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Analysis of Logit Gap. In this section, we examine whether there is a significant difference in the logit gap between true negatives and false negatives. Additionally, by observing the logit gap of single positives, we validate the effectiveness of the logit gap threshold. Figure 3a depicts the average logit gap per epoch observed during model training with our framework. As shown in Fig. 3a, there is a significant difference in the gap between false negatives and true negatives. Furthermore, it is observed that the gap for the single positives is lower than that of the false negatives. In other words, during model training with our framework, the logit gap is a suitable criterion for identifying false negatives, and the logit gap threshold works effectively.", + "bbox": [ + 212, + 638, + 787, + 791 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Effectiveness of Logit Average Threshold. In the process of rejecting false negatives, to minimize incorrect rejections (rejections of true negatives), we pro-", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "posed the logit average threshold. To verify the effectiveness of the logit gap threshold, we examine in this section how the logit average threshold mitigates the rejection of true negatives. Figure 3b illustrates the rejection ratio starting from the end of the warm-up phase. The y-axis represents FN/TN ratio, where FN is the number of unannotated positives (False Negatives) rejected by our method, and TN is the number of true negatives rejected by our method. As shown in Fig. 3b, when logit average threshold is applied, FN/TN noticeably decreases. This indicates that our logit average threshold effectively mitigates the rejection of true negatives.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/95e8e17921f57296e0339b49576540d4fff55a41da61851c94955547df2a6300.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 222, + 301, + 493, + 383 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/b81f31b313607b99d61c22bb631309ce64cf48352c6549674477e512a8f774e0.jpg", + "image_caption": [ + "(a) P&R Comparison with PLC [29]", + "(c) P&R Comparison with BoostLU [13]", + "Fig. 4: Comparison with recent approaches. Experiments are conducted on PASCAL VOC 2012 dataset. Q2L model is used in comparison with PLC [29] and ResNet-50 is used in comparison with BoostLU [13]. BoostLU represents the case where BoostLU is applied to LL-R [12]. P and R represent precision and recall, respectively." + ], + "image_footnote": [], + "bbox": [ + 230, + 400, + 483, + 481 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5e84944b3f494820fcc61026d16f79536faab6c6baae9060509e44a6649c868c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 513, + 301, + 771, + 383 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/75907e121fc2077637978e6ee72d067c41084b15fd92c104aa623f9740836741.jpg", + "image_caption": [ + "(b) F1 Comparison with PLC [29]", + "(d) F1 Comparison with BoostLU [13]" + ], + "image_footnote": [], + "bbox": [ + 522, + 400, + 764, + 481 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Comparison for False Negative Identification. We show our method's ability to identify false negatives through a comparison with recent approaches [13, 29]. We compare with PLC [29] and BoostLU [13], which include LL-R [12].", + "bbox": [ + 212, + 598, + 785, + 643 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For PLC [29], precision is very high; however, as a trade-off, recall is very low (see Fig. 4a). Therefore, many false negative labels are not identified, and the model continuously learns these labels with incorrect label information. For BoostLU [13], as training progresses, recall becomes very high. Therefore, it could identify many false negative labels. However, due to the significant decrease of precision, a large number of true negative labels are also incorrectly identified as false negatives.", + "bbox": [ + 212, + 643, + 787, + 748 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Compared to these methods, our approach does not exhibit a significant trade-off between precision and recall. Furthermore, as shown in Fig. 4b and 4d, F1 score of our approach exhibits a relatively high score and becomes increases, while the F1 scores of other methods become sharply decrease. This observation demonstrates that our method, based on logit gap threshold and logit average threshold, has an remarkable ability in identifying false negatives.", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 113, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/9bcf2dc1d26fae4e68168cc88c9046e0be35c471b55f47025e9c9807566ba4a2.jpg", + "image_caption": [ + "(a) Comparison of mAP according to CAM threshold" + ], + "image_footnote": [], + "bbox": [ + 230, + 145, + 475, + 250 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/0eb711c71d2c4e0cc08591b6a124a4c0741cd19258c3862587fe8e6668378fc0.jpg", + "image_caption": [ + "(b) Variation of the Gap threshold according to CAM threshold", + "Fig. 5: Analysis of CAM Threshold and Gap Threshold." + ], + "image_footnote": [], + "bbox": [ + 519, + 146, + 805, + 250 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Sensitivity Analysis of CAM Threshold. We analyze the sensitivity of the model performance according to changes in the CAM threshold. Fig. 5a shows that the model's performance is not sensitive to the CAM threshold. Also, Fig. 5b indicates that as the CAM threshold $\\gamma$ increases, the logit gap threshold $\\tau$ also automatically increases.", + "bbox": [ + 212, + 335, + 785, + 412 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "With a higher CAM threshold, the region exceeding the threshold in the CAM area decreases, causing more areas of the image to be obscured in the masked image. Consequently, the information gap between the masked image and the original image for a single positive label becomes large.", + "bbox": [ + 212, + 414, + 785, + 474 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Our gap threshold is the average logit gap between the original image and the masked image for a single positive label. Therefore, as the CAM threshold increases, the gap threshold automatically increases as well. In other words, the gap threshold we propose can adapt dynamically to changes in the hyperparameter CAM threshold.", + "bbox": [ + 212, + 477, + 785, + 551 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 585, + 359, + 602 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We proposed a new approach for identifying false negative labels in SPML. Our approach was based on the model's output gap resulting from the information gap between the images. With rejecting the false negative labels, we trained the models with minimizing bias to false negative labels. Through various experimental results, we demonstrated the superiority of our proposed for identifying false negative labels in assumed negative labels. Our approach showed performance improvements, and achieved state-of-the-art results in most datasets. Our proposed method generated the masked image with the CAM of the single positive label. Then, we identified false negatives with the information gap between the masked image and the original image. By rejecting identified false negatives, we prevented the model from being biased to false negative labels and built more reliable models. In future work, we would consider utilizing modules for more precise CAM extraction or leveraging the foundational model for generating the masked images.", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements. This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00421, AI Graduate School Support Program), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (RS-2024-00352717), and institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.RS-2024-00437633, Development of Open-ended Alignment Fluxional AI for Ever-changing Environment and Value)", + "bbox": [ + 212, + 146, + 787, + 268 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 295, + 321, + 310 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019)", + "2. Beyer, L., Henaff, O.J., Kolesnikov, A., Zhai, X., Oord, A.v.d.: Are we done with imagenet? arXiv preprint arXiv:2006.07159 (2020)", + "3. Chen, Z.M., Wei, X.S., Wang, P., Guo, Y.: Multi-label image recognition with graph convolutional networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5177-5186 (2019)", + "4. Chua, T.S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.: Nus-wide: a real-world web image database from national university ofSingapore. In: Proceedings of the ACM international conference on image and video retrieval. pp. 1-9 (2009)", + "5. Cole, E., Mac Aodha, O., Lorieul, T., Perona, P., Morris, D., Jojic, N.: Multi-label learning from single positive labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 933-942 (2021)", + "6. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.V.: Autoaugment: Learning augmentation policies from data. arXiv preprint arXiv:1805.09501 (2018)", + "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020)", + "8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)", + "9. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes challenge: A retrospective. International journal of computer vision 111, 98-136 (2015)", + "10. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)", + "11. Jiang, P.T., Yang, Y., Hou, Q., Wei, Y.: L2g: A simple local-to-global knowledge transfer framework for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16886-16896 (2022)", + "12. Kim, Y., Kim, J.M., Akata, Z., Lee, J.: Large loss matters in weakly supervised multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14156-14165 (2022)" + ], + "bbox": [ + 217, + 330, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "13. Kim, Y., Kim, J.M., Jeong, J., Schmid, C., Akata, Z., Lee, J.: Bridging the gap between model explanations in partially annotated multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3408-3417 (2023)", + "14. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)", + "15. Lee, S., Lee, M., Lee, J., Shim, H.: Railroad is not a train: Saliency as pseudo-pixel supervision for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5495-5505 (June 2021)", + "16. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)", + "17. Liu, S., Zhang, L., Yang, X., Su, H., Zhu, J.: Query2label: A simple transformer way to multi-label classification. arXiv preprint arXiv:2107.10834 (2021)", + "18. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017)", + "19. Lukasik, M., Bhojanapalli, S., Menon, A., Kumar, S.: Does label smoothing mitigate label noise? In: International Conference on Machine Learning. pp. 6448-6458. PMLR (2020)", + "20. Rajeswar, S., Rodriguez, P., Singhal, S., Vazquez, D., Courville, A.: Multi-label iterated learning for image classification with label ambiguity. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4783-4793 (2022)", + "21. Ridnik, T., Ben-Baruch, E., Zamir, N., Noy, A., Friedman, I., Protter, M., Zelnik-Manor, L.: Asymmetric loss for multi-label classification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 82-91 (2021)", + "22. Ridnik, T., Sharir, G., Ben-Cohen, A., Ben-Baruch, E., Noy, A.: ML-decoder: Scalable and versatile classification head. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 32-41 (2023)", + "23. Selvaraju, R.R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., Batra, D.: Gradcam: Visual explanations from deep networks via gradient-based localization. In: Proceedings of the IEEE international conference on computer vision. pp. 618-626 (2017)", + "24. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020)", + "25. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)", + "26. Verelst, T., Rubenstein, P.K., Eichner, M., Tuytelaars, T., Berman, M.: Spatial consistency loss for training multi-label classifiers from single-label annotations. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3879-3889 (2023)", + "27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)", + "28. Wang, Y., Zhang, J., Kan, M., Shan, S., Chen, X.: Self-supervised equivariant attention mechanism for weakly supervised semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + ], + "bbox": [ + 217, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "G. Song et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "29. Xie, M.K., Xiao, J., Huang, S.J.: Label-aware global consistency for multi-label learning with single positive labels. Advances in Neural Information Processing Systems 35, 18430-18441 (2022)", + "30. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020)", + "31. Yun, S., Oh, S.J., Heo, B., Han, D., Choe, J., Chun, S.: Re-labeling imagenet: from single to multi-labels, from global to localized labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2340-2350 (2021)", + "32. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2921-2929 (2016)", + "33. Zhou, D., Chen, P., Wang, Q., Chen, G., Heng, P.A.: Acknowledging the unknown for multi-label learning with single positive labels. In: European Conference on Computer Vision. pp. 423-440. Springer (2022)", + "34. Zhou, T., Zhang, M., Zhao, F., Li, J.: Regional semantic contrast and aggregation for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4299-4309 (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 411 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IGNORE", + "bbox": [ + 665, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_model.json b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_model.json new file mode 100644 index 0000000000000000000000000000000000000000..4577c949c5da24b22c20617b687b3a778fe55d09 --- /dev/null +++ b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_model.json @@ -0,0 +1,2159 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.307, + 0.141, + 0.732, + 0.21 + ], + "angle": 0, + "content": "IGNORE: Information Gap-based False Negative Loss Rejection Single Positive Multi-Label Learning" + }, + { + "type": "text", + "bbox": [ + 0.237, + 0.235, + 0.766, + 0.252 + ], + "angle": 0, + "content": "GyeongRyeol Song, Noo-ri Kim, Jin-Seop Lee, and Jee-Hyong Lee*" + }, + { + "type": "text", + "bbox": [ + 0.334, + 0.263, + 0.671, + 0.293 + ], + "angle": 0, + "content": "Sungkyunkwan University, Suwon, South Korea {thd7524, pd99j, wlstjq0602, john}@skku.edu" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.327, + 0.744, + 0.675 + ], + "angle": 0, + "content": "Abstract. Single Positive Multi-Label Learning (SPML) is a method for a scarcely annotated setting, in which each image is assigned only one positive label while the other labels remain unannotated. Most approaches for SPML assume unannotated labels as negatives (\"Assumed Negative\", AN). However, with this assumption, some positive labels are inevitably regarded as negative (false negative), resulting in model performance degradation. Therefore, identifying false negatives is the most important with AN assumption. Previous approaches identified false negative labels using the model outputs of assumed negative labels. However, models were trained with noisy negative labels, their outputs were not reliable. Therefore, it is necessary to consider effectively utilizing the most reliable information in SPML for identifying false negative labels. In this paper, we propose the Information Gap-based False Negative LOss REjection (IGNORE) method for SPML. We generate the masked image that all parts are removed except for the discriminative area of the single positive label. It is reasonable that when there is no information of an object in the masked image, the model's logit for that object is low. Based on this intuition, we identify the false negative labels if they have a significant model's logit gap between the masked image and the original image. Also, by rejecting false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on four datasets: Pascal VOC 2012, MS COCO, NUSWIDE, and CUB. Compared to previous state-of-the-art methods in SPML, our method outperforms them on most of the datasets." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.687, + 0.741, + 0.715 + ], + "angle": 0, + "content": "Keywords: Multi-Label Learning \\(\\cdot\\) Single Positive Multi-Label Learning \\(\\cdot\\) Information Gap \\(\\cdot\\) False Negative Rejection" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.741, + 0.377, + 0.756 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.772, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Multi-label learning is an approach that trains a model using images with multiple labels, aiming to build a model that is able to predict all relevant labels for the images with multiple labels. Unlike multi-class learning, where the model aims to" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.383, + 0.841 + ], + "angle": 0, + "content": "* Corresponding author" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.151, + 0.401, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.403, + 0.149, + 0.621, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.623, + 0.149, + 0.782, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.312, + 0.789, + 0.438 + ], + "angle": 0, + "content": "Fig. 1: Example of an image for Single Positive Multi-Label Learning (SPML) and our main idea for SPML. Ground truth is 1 if there is a corresponding object, otherwise 0. In SPML, only one positive label is given, and all the other labels are not given, i.e., unannotated. In Assumed Negative (AN) assumption, all unannotated labels are assumed to be negative. Here, false negative labels mean the unannotated positive labels, which are incorrectly assumed to be negative. To identify the false negative labels, we first extract the discriminative areas of the single positive label and generate the masked image. Then, we utilize the information gap between the original image and the masked image." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.472, + 0.789, + 0.594 + ], + "angle": 0, + "content": "predict only a single label for the input image, multi-label learning is much more challenging because the model aims to predict multiple labels associated with the input image. Moreover, multi-label learning is more practical and realistic than multi-class learning, as the majority of real-world images contain multiple objects [2,3,17,20,22,31]. To achieve effective multi-label learning, similar to other supervised learning tasks, a fully labeled dataset is required. However, real-world images typically contain tens to thousands of different classes, and fully annotating all of them is extremely labor-intensive and practically unfeasible." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.789, + 0.778 + ], + "angle": 0, + "content": "To reduce labor-intensive costs, researches on Single Positive Multi-Label Learning (SPML) have been increasing recently [5,12,13,26,29,33]. As shown in Fig. 1, in SPML, only one positive label is given and the others are unannotated for each images. To deal with unannotated labels in SPML, most approaches [12,13,26,29] assumed unannotated labels as negative (Assumed Negative, AN). This assumption has the advantage of providing supervision for all unannotated labels. Also, this assumption is reasonable because most multi-label datasets are dominated by negatives. However, by assuming all unannotated labels as negatives, it inevitably provides incorrect supervision for actually positive labels among the unannotated ones. In other words, these labels are false negative labels. These false negative labels can consistently cause confusion during model training, and impair the model's generalization ability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Therefore, most studies [5,12,13,26,29] are focusing on identifying false negatives in SPML. They usually identify false negatives by utilizing model output's confidence or losses. In more detail, they identify the labels with abnormally high values of the model's outputs [26, 29] or losses [12, 13] as false negative labels." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.148, + 0.782, + 0.344 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.359, + 0.788, + 0.414 + ], + "angle": 0, + "content": "Fig. 2: Overview of the proposed method. In our method, we generate a masked image through the single positive label. Then, we utilize the logit gap between the masked image and the original image to identify false negatives and reject them in training \\((\\mathcal{L}_{\\text{IGNORE}})\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.444, + 0.784, + 0.504 + ], + "angle": 0, + "content": "Because it implies that unannotated labels could be positive labels. However, the confidence or losses for the false negative labels are not reliable because models could learn them with noisy labels. To address this issue, it is necessary to consider robust criterion that are insensitive to noisy labels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.506, + 0.788, + 0.685 + ], + "angle": 0, + "content": "Since the single positive labels are the most reliable information in SPML, the model's output for the single positive label is reliable. Therefore, we can capture the discriminative areas [11, 15, 28, 32, 34] of objects and generate a masked image that includes only the discriminative areas of the single positive label (see Fig. 1). The masked image contains only the information corresponding to the single positive label. On the other hand, the original image contains information corresponding to ground truth labels. It is reasonable that when there is no information of an object in the image, the model's output for that object is low. Therefore, for false negatives, the model's output for the original image is expected to be higher than the model's output for the masked image. By utilizing the model's output gap resulting from the information gap between the images, false positive labels would be effectively identified." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.687, + 0.788, + 0.792 + ], + "angle": 0, + "content": "In this paper, we propose the Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. By rejecting the false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on various benchmark datasets such as PASCAL VOC 2012 [9], MS COCO [16], NUSWISE [4], and CUB [27]. Our method also outperforms most of the state-of-the-art methods in SPML." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.232, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.398, + 0.161 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.195, + 0.788, + 0.468 + ], + "angle": 0, + "content": "Problems with AN loss. In SPML, Assume Negative (AN) is the main approach that provides supervision to unannotated labels. Since multi-label datasets are dominated by negatives [21], assuming unannotated labels as negatives can be a reasonable and straightforward approach in situations where most of the label information is unknown. Also, Binary Cross-Entropy (BCE) loss in AN is referred to as AN loss. With AN loss, losses of all unannotated labels are calculated through the negative term of BCE. Thus, the model erroneously learns the unannotated positive labels (false negative labels) as negative labels. This confusion in multi-label learning results in bias to false negative labels and model performance drop. There are researches that point out issues caused by false negative label learning with AN loss [13,33]. In training with AN loss, BoostLU [13] observed that the attribution score of Class-Activation Map (CAM) is damaged due to false negative labels. To address this issue, they proposed an activation function that can boost the damaged CAM. EM [33] pointed out the issue that AN loss incurs the high loss gradient propagation problem for false negative labels. They proposed an entropy maximization loss that suppresses the gradient for unannotated labels with high prediction, without assuming unannotated labels as negatives." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.468, + 0.788, + 0.529 + ], + "angle": 0, + "content": "In summary, learning false negative labels causes confusion in model training by continuously propagating the incorrect information to the model and affects the model's output. Therefore, it is necessary to consider the false negative labels when utilizing AN loss in SPML." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.788, + 0.689 + ], + "angle": 0, + "content": "Approaches and Challenges for False Negatives. There are approaches that reject the identified false negative labels or regard them as positive labels. PLC [29] adopted a model prediction-based pseudo-labeling method. While training with AN loss, they generated pseudo-labels for unannotated labels using a fixed threshold. Using these pseudo-labels, They trained the model with unannotated labels once again. SCL [26] identified labels as false negatives with significantly high values of model predictions, and other methods [12, 13] used losses to identify false negatives. These methods proposed utilizing identified false negatives as positives in training or rejecting them from training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.78 + ], + "angle": 0, + "content": "In multi-label learning, usually the number of negatives overwhelms the number of positives in each sample. Therefore, it is challenging to identify as many false negatives as desired with high precision. Additionally, if the model incorrectly learns actual negative labels as positive, it can lead to significant bias in the model for those labels. As a result, generally rejecting the identified false negatives from training showed better performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Despite consideration of false negatives, however, because these methods are based on the AN loss, the model is easy to learn incorrect label information. The model learns assumed negative labels with incorrect label information, the distinct model outputs associated with false negative labels (e.g., high loss or high" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.222 + ], + "angle": 0, + "content": "probability) gradually become more similar to those of true negatives. That is, it becomes more challenging to identify false negatives from true negative labels using the information from assumed negative labels. Therefore, it is necessary to identify false negatives through new criterion rather than relying on the information from assumed negative labels." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.247, + 0.427, + 0.264 + ], + "angle": 0, + "content": "3 Proposed Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.279, + 0.784, + 0.339 + ], + "angle": 0, + "content": "In this section, we propose the method of identifying and rejecting false negatives based on the information gap between the masked image and the original image. Firstly, we introduce the preliminary in Sec. 3.1. Then, we explain the proposed method in the following sections." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.362, + 0.36, + 0.377 + ], + "angle": 0, + "content": "3.1 Preliminary" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.389, + 0.785, + 0.478 + ], + "angle": 0, + "content": "For single positive multi-label learning tasks, a dataset \\(\\mathcal{D} = \\{\\mathbf{x}_n,\\mathbf{y}_n\\}_{n = 1}^N\\) is given, where \\(\\mathbf{x}_n\\) is an image and \\(\\mathbf{y}_n\\in \\mathcal{V} = \\{u,1\\} ^C\\) is the vector of labels. \\(N\\) is the number of images, and \\(C\\) is the number of classes. The \\(\\mathbf{y}_n\\) consists of a single positive label and unknown labels. Except for the single positive, the others are unannotated labels. The single positive label is indicated by 1 and unannotated labels are indicated by \\(u\\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.48, + 0.784, + 0.51 + ], + "angle": 0, + "content": "In SPML, most approaches assumed unannotated labels as negative, and trained models using AN (Assume Negative) loss as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.358, + 0.524, + 0.785, + 0.584 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} _ {A N} = - \\frac {1}{B C} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} [ \\mathbb {I} [ y _ {i j} = 1 ] \\cdot \\log (p _ {i j}) \\tag {1} \\\\ + \\mathbb {I} [ y _ {i j} = u ] \\cdot \\log (1 - p _ {i j}) ] \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.596, + 0.785, + 0.716 + ], + "angle": 0, + "content": "where \\( y_{ij} \\) is the label of the \\( j \\)-th class for the \\( i \\)-th image, and \\( p_{ij} \\) is the model's prediction for \\( y_{ij} \\). \\( B \\) is the batch size, \\( C \\) is the number of classes, and \\( \\mathbb{I} \\) is the indicator function that returns 1 if the condition is true and 0 otherwise. Since the AN loss is useful to give supervision to unannotated labels, our approach also based on the AN loss. However, the AN loss inevitably provides incorrect supervision for actually positive labels among the unannotated ones. Therefore, it is necessary to consider that effectively utilizing the most reliable information in SPML to minimize false negative problems." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.739, + 0.515, + 0.755 + ], + "angle": 0, + "content": "3.2 Overview of Proposed Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.784, + 0.84 + ], + "angle": 0, + "content": "In this paper, we propose our Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. The method for identifying false negative labels based on the information gap proceeds through the following steps. Firstly, we generate the masked image that all parts are removed except the discriminative area of the single positive label (see Fig. 2). Then, we compare" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "the model's logit gap between the masked image and the original image. If there is an object in the masked-out areas of the masked image, there is likely to be a substantial gap in the model's logit between the masked image and the original image. Because the object is absent in the masked image, in contrast to the original image. Based on this intuition, we identified the false negative labels if they have a significant model's output gap between the two images. The details of UNUSED's components are discussed in Sec. 3.3. As shown in Fig. 2, after identifying the false negative labels, we reject the losses of the corresponding negative labels to prevent the model from learning incorrect label information." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.303, + 0.638, + 0.318 + ], + "angle": 0, + "content": "3.3 Components of False Negative Loss Rejection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.326, + 0.785, + 0.388 + ], + "angle": 0, + "content": "In this section, we first introduce the process of generating the masked images that provide information to identify false negatives in our proposed method. And then, we introduce the logit gap threshold and the logit average threshold that compose our information gap-based false negative loss rejection, UNUSED." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.406, + 0.788, + 0.569 + ], + "angle": 0, + "content": "Generation of Masked Image. We identify and reject the false negative labels based on the information gap between the masked image and the original image. In this section, we discuss the method of generating the masked images through the single positive labels. It is well-known that the class-activation map (CAM) [23, 32] focuses on the discriminative areas of objects [11, 15, 28, 34]. Furthermore, BoostLU [13] reported that the model trained with AN loss can extract reliable CAM compared to the CAM extracted by a model trained with fully-labeled dataset. Therefore, we extract the CAM for the single positive labels from the original image \\(\\mathbf{x}\\). The detailed explanation for extracting the CAM is in the supplementary material. Based on the CAM, we generate the mask as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.423, + 0.569, + 0.785, + 0.607 + ], + "angle": 0, + "content": "\\[\nM _ {i j} = \\left\\{ \\begin{array}{l l} 1 & \\text {i f} A _ {i j} > \\gamma \\\\ 0 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.611, + 0.788, + 0.687 + ], + "angle": 0, + "content": "where \\( A \\) and \\( M \\) indicate the CAM and the mask, respectively. Also, \\( \\gamma \\) is a CAM threshold to capture discriminative area for the positive label. By multiplying this mask with the original image \\( \\mathbf{x} \\) element-wise, we can generate a masked image \\( \\mathbf{x}^M \\) where the areas only related to single positive labels are preserved, and the rest of the image is masked out as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.455, + 0.696, + 0.785, + 0.712 + ], + "angle": 0, + "content": "\\[\n\\mathbf {x} ^ {M} = \\mathbf {x} \\odot M \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.785, + 0.751 + ], + "angle": 0, + "content": "The masked image is used to establish the Logit Gap Threshold for identifying the false negative labels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.77, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Logit Gap Threshold. We design the criterion for identifying the false negative labels based on the logit gap between the masked image \\(\\mathbf{x}^M\\) and the original image \\(\\mathbf{x}\\). The logit gap \\(G\\) is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.393, + 0.825, + 0.785, + 0.843 + ], + "angle": 0, + "content": "\\[\nG _ {i j} = \\left| h \\left(f \\left(\\mathbf {x} _ {i}\\right)\\right) _ {j} - h \\left(f \\left(\\mathbf {x} _ {i} ^ {M}\\right)\\right) _ {j} \\right| \\tag {4}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "where \\( f \\) and \\( h \\) denotes image encoder and classification head, respectively. We define the logit for the image as \\( h(f(\\mathbf{x})) \\), and the logit for the \\( j \\)-th class of the \\( i \\)-th image as \\( h(f(\\mathbf{x}_i))_j \\). Among the assumed negative labels, the labels with a high \\( G \\) are more likely to be false negatives." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.785, + 0.298 + ], + "angle": 0, + "content": "As shown in Fig. 2, in the masked image, the object of the single positive label retains some of its information, but any information of the other objects is completely eliminated in the masked image. The value of \\( G \\) for the other objects in the image will be larger than the value of \\( G \\) for the single positive label. Based on this observation, we set the threshold \\( \\tau \\) using the average \\( G \\) value of the single positive labels. The \\( \\tau \\) is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.307, + 0.313, + 0.785, + 0.353 + ], + "angle": 0, + "content": "\\[\n\\tau^ {t} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} t = 0 \\\\ \\lambda \\tau^ {t - 1} + (1 - \\lambda) \\frac {\\sum_ {j = 1} ^ {C} \\sum_ {i = 1} ^ {B} I \\left[ y _ {i j} = 1 \\right] G _ {i j}}{B} & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.358, + 0.784, + 0.403 + ], + "angle": 0, + "content": "where \\( B \\) denotes the batch size. The gap threshold \\( \\tau \\) is adaptively updated at each iteration \\( t \\) using Exponential Moving Average (EMA). \\( \\lambda \\) is a hyperparameter that determines the momentum decay of the EMA." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.428, + 0.785, + 0.548 + ], + "angle": 0, + "content": "Logit Average Threshold. In this section, we introduce logit average threshold. We identify the false negatives that are actually present in the original image with the logit gap resulting from the information gap between the images. Therefore, even if a large logit gap occurs for labels that are not actually present in the original image, we do not need to identify these labels as false negatives labels with low logit values in the original image are likely to be true negatives that did not originally exist in the original image. To prevent these rejection of true negatives in our rejection method, we propose the logit average threshold." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.549, + 0.785, + 0.669 + ], + "angle": 0, + "content": "It is evident that the logits of true negative labels are relatively low. Therefore, we only consider the rejection of the labels with a logit higher than the average of the logits for each class. We set the threshold \\(\\mu\\) as the average logit of assumed negative labels for each class. We select the labels with logits higher than the threshold \\(\\mu\\). Through this process, we only reject the selected labels. Additionally, \\(\\mu\\) is self-adaptively updated using Exponential Moving Average (EMA) at each iteration. The threshold \\(\\mu_j^t\\) for the j-th class at time step \\(t\\) is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.272, + 0.679, + 0.785, + 0.72 + ], + "angle": 0, + "content": "\\[\n\\mu_ {j} ^ {t} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} t = 0 \\\\ \\lambda \\mu_ {j} ^ {t - 1} + (1 - \\lambda) \\frac {1}{N _ {j}} \\sum_ {i = 1} ^ {N _ {j}} \\mathbb {I} [ y _ {i j} = u ] \\cdot h (f (\\mathbf {x} _ {i})) _ {j} & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.73, + 0.753, + 0.745 + ], + "angle": 0, + "content": "where \\(N_{j}\\) denotes the number of assumed negative labels for the j-th class." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.769, + 0.627, + 0.784 + ], + "angle": 0, + "content": "3.4 Training with False Negative Loss Rejection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.784, + 0.841 + ], + "angle": 0, + "content": "Information Gap-based False Negative Loss Rejection. In this section, we describe our rejection function that incorporates both the logit average threshold and the logit gap threshold. The rejection function \\( R \\) incorporating the logit" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.695, + 0.162 + ], + "angle": 0, + "content": "average threshold and the logit gap threshold is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.349, + 0.17, + 0.786, + 0.21 + ], + "angle": 0, + "content": "\\[\nR _ {i j} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} h \\left(f \\left(\\mathbf {x} _ {i}\\right)\\right) _ {j} > \\mu_ {j} ^ {t} \\text {a n d} G _ {i j} > \\tau^ {t} \\\\ 1 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.216, + 0.784, + 0.276 + ], + "angle": 0, + "content": "The rejection function \\( R \\) rejects the labels with \\( G \\) higher than the \\( \\tau \\) and a logit higher than \\( \\mu \\). In other words, it identifies the labels with high logit values for the original image and a significant logit gap between the two images, then rejects them from the training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.277, + 0.785, + 0.322 + ], + "angle": 0, + "content": "By incorporating this function into the negative term of the AN loss, identified false negatives are rejected from the model training. Our IgnORE method that combined with AN loss and the rejection function \\( R \\) is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.346, + 0.33, + 0.786, + 0.393 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} _ {\\text {I G N O R E}} = - \\frac {1}{S} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\left(\\mathbb {I} \\left[ y _ {i j} = 1 \\right] \\cdot \\log \\left(p _ {i j} ^ {s}\\right) \\right. \\tag {8} \\\\ + \\mathbb {I} [ y _ {i j} = u ] \\cdot R _ {i j} \\cdot \\log \\left(1 - p _ {i j} ^ {s}\\right)) \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.399, + 0.784, + 0.489 + ], + "angle": 0, + "content": "where \\(S\\) denotes the sum of the single positive labels and the labels that are not rejected negative labels. \\(p_{ij}^{s}\\) denotes \\(\\sigma (h(f(\\mathbf{x}_i^s)_j)\\) and \\(\\sigma\\) denotes sigmoid function. \\(\\mathbf{x}^s\\) denotes strong augmented image. It is well known that strong augmentation improves the generalization ability of deep learning models across most datasets [1, 6, 7, 24, 30]. Therefore, we utilize the strong augmented images to enhance model generalization." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.784, + 0.585 + ], + "angle": 0, + "content": "Single Positive Binary Classification (SPBC). We utilize the CAM of the single positive labels. Therefore, it is necessary to train the model with correct supervision for the single positive labels. The model learns given single positive labels through binary classification for a single positive class. Single Positive Binary Classification (SPBC) is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.358, + 0.594, + 0.786, + 0.636 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {S P B C} = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\mathbb {I} [ y _ {i j} = 1 ] \\cdot \\log (p _ {i j}) \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.653, + 0.788, + 0.79 + ], + "angle": 0, + "content": "Consistency Regularization. Our method identifies the false negatives based on the model's logits. Therefore, our model needs to output consistent logits on similar images. To ensure such consistency, we take into account the consistency regularization between original images and strongly augmented images used in our framework. We propose the consistency regularization to the logits between original images and strongly augmented images, enabling the model to have consistency across differently augmented images. This ensures that the model produces consistent logits for different views of the same image. Our consistency regularization is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.344, + 0.802, + 0.786, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {r e g} = - \\frac {1}{B C} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\left| h \\left(f \\left(\\mathbf {x} _ {i}\\right) _ {j} - h \\left(f \\left(\\mathbf {x} _ {i} ^ {s}\\right)\\right) _ {j} \\right| ^ {2} \\right. \\tag {10}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.534, + 0.161 + ], + "angle": 0, + "content": "Overall loss. The overall loss is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.338, + 0.178, + 0.786, + 0.194 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\lambda_ {S P B C} \\cdot \\mathcal {L} _ {S P B C} + \\mathcal {L} _ {I G N O R E} + \\lambda_ {r e g} \\cdot \\mathcal {L} _ {r e g} \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.2, + 0.785, + 0.23 + ], + "angle": 0, + "content": "where \\(\\lambda_{SPBC}\\) and \\(\\lambda_{reg}\\) are hyperparameters that denote the weights assigned to the respective loss terms." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.254, + 0.376, + 0.272 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.286, + 0.784, + 0.348 + ], + "angle": 0, + "content": "In this section, we present our experimental results and compare them with previous SPML approaches. Furthermore, we conduct an ablation study to analyze why our method is effective in SPML. We use mean average precision (mAP) as the comparison metric with previous approaches." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.369, + 0.427, + 0.385 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.394, + 0.785, + 0.53 + ], + "angle": 0, + "content": "Datasets. We use four benchmark datasets to demonstrate our experimental results: PASCAL VOC 2012 [9], MS COCO 2014 [16], NUSWIDE [4], and CUB [27]. Following the settings of previous research [5], we create a single positive multi-label setting for the four benchmark datasets by randomly retaining one positive label and removing all other annotations. In particular, for the CUB dataset [27], we use bird attributes as target classes instead of bird categories, following the setup of ROLE [5]. For each dataset, we reserve \\(20\\%\\) of the train set as a validation set, and select the best model based on its performance on the validation set." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.785, + 0.629 + ], + "angle": 0, + "content": "Models. For a fair comparison with previous approaches [5,12,13,19,29,33], we conduct experiments with two models [10, 17]. One of the models is a ResNet-50 [10] that is pre-trained on ImageNet [8]. For ResNet-50, We employ the architecture of a convolutional layer followed by a 1x1 convolutional layer and global average pooling, the same as BoostLU [13]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.785, + 0.689 + ], + "angle": 0, + "content": "The other one is a model with a transformer [25] architecture called Q2L [17]. For the image encoder of Q2L [17], we utilize the ResNet-50 [10] that is pretrained on ImageNet [8]. We explain the details on how to obtain CAMs for each model in Supplementary details." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.787, + 0.843 + ], + "angle": 0, + "content": "Hyperparameter Settings. For Q2L, we set batch sizes in \\(\\{8, 16\\}\\), learning rates in \\(\\{1e-4, 1e-5\\}\\). We use AdamW [18] as optimizer and OneCycleLR as scheduler. For ResNet-50, we set batch sizes in \\(\\{8, 12, 16\\}\\), learning rates in \\(\\{1e-4, 1e-5\\}\\), and use Adam [14] as optimizer. Each image is resized to \\(448 \\times 448\\). Only random HorizontalFlip is used for original images, while random horizontal flip and RandAugmentation [7] are used for strong augmented images CAM threshold \\(\\gamma\\) is set to 0.4 for ResNet-50 and 0.8 for Q2L, respectively. In Q2L, we set the CAM threshold to 0.8. And, we set loss weights \\(\\lambda_{reg}\\) to 0.5, and \\(\\lambda_{SPBC}\\) to 0.5 except COCO dataset. On COCO dataset, we set loss weights \\(\\lambda_{reg}\\) to 0.1," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.214 + ], + "angle": 0, + "content": "Table 1: Experimental results of our method with Q2L model on four SPML benchmark datasets. Metric presented in the table is mAP (mean Average Precision). Additionally, bold font indicates the highest performance, while underlining indicates the second highest performance. Our method demonstrates the highest performance on most datasets." + }, + { + "type": "table", + "bbox": [ + 0.36, + 0.227, + 0.646, + 0.424 + ], + "angle": 0, + "content": "
MethodDataset
VOCCOCONUSCUB
AN87.672.348.518.6
WAN [5]89.273.548.522.5
EPR [5]88.872.749.323.1
AN-LS [5]88.070.947.116.3
ROLE [5]88.169.644.514.2
EM [33]89.273.248.722.2
EM + APL [33]89.273.148.623.6
PLC + LAC [29]89.675.651.123.3
Ours90.176.352.823.4
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.543 + ], + "angle": 0, + "content": "and \\(\\lambda_{SPBC}\\) to 0.5. In ResNet-50, we set the CAM threshold in \\(\\{0.4, 0.5\\}\\). And, we set the loss weights \\(\\lambda_{reg}\\) to 0.5, and \\(\\lambda_{SPBC}\\) to 0.1 except CUB dataset. On CUB dataset, we set loss weights \\(\\lambda_{reg}\\) to 0.5, and \\(\\lambda_{SPBC}\\) to 0.5. Considering that the updates for the threshold \\(\\tau\\) might not be sufficient in the early stages of training, we set the warm-up phase. In warm-up phase, our model is trained with AN loss." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.571, + 0.442, + 0.587 + ], + "angle": 0, + "content": "4.2 Experimental Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.601, + 0.787, + 0.691 + ], + "angle": 0, + "content": "Performance with Q2L model. We compare our experimental results with recent approaches for the Q2L model on four datasets: Weak Assume Negative (WAN) [5], Expected Positive Regularization (EPR) [5], Assume Negative-Label Smoothing (AN-LS) [5], ROLE [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], and Pseudo-Labeling Consistency Regularization (PLC) with Label-Aware Global Consistency Regularization (LAC) [29]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.692, + 0.787, + 0.784 + ], + "angle": 0, + "content": "As shown in Tab. 1, our method outperforms recent approaches on the VOC, COCO, and NUSWIDE datasets. In particular, on the NUSWIDE dataset, our method achieved an mAP of 1.7, higher than the previous best-performed approach. For CUB, our method do not achieve the best performance, but it shows the second-best results. The gap in performance with the best-performed approach is very small, so it can be considered comparable." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Performance with ResNet-50 model. For ResNet-50, we compare the experimental results with the following recent approaches: Label-Smoothing (LS) [19]," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.186 + ], + "angle": 0, + "content": "Table 2: Experimental results of our method with ResNet-50 model on four SPML benchmark datasets. Detailed ingredient of the table (metrics, bold, and underline) is the same as in Table 1." + }, + { + "type": "table", + "bbox": [ + 0.353, + 0.199, + 0.652, + 0.423 + ], + "angle": 0, + "content": "
MethodDataset
VOCCOCONUSCUB
AN85.8964.9242.2718.31
LS [19]87.9067.1543.7716.26
ASL [21]87.7668.7846.9318.81
ROLE [5]87.7767.0441.6313.66
ROLE + LI [5]88.2669.1245.9814.86
EM [33]89.0970.7047.1520.85
EM + APL [33]89.1970.8747.5921.84
LL-R [12]88.2770.7048.7619.56
+ BoostLU [13]89.2972.8949.5919.80
Ours89.1972.0050.0821.90
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.452, + 0.785, + 0.498 + ], + "angle": 0, + "content": "Assymmetric loss (ASL) [21], ROLE [5], ROLE with LinearInit (LI) [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], Large Loss Rejection (LL-R) [12], and Large Loss Rejection (LL-R) [12] with BoostLU [13]." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.499, + 0.785, + 0.575 + ], + "angle": 0, + "content": "As shown in Tab. 2, our method exhibited the highest performances on the NUSWIDE and CUB dataset compared to recent approaches. On VOC and COCO, our method achieves the second-best performances. While not achieving the best performance on all datasets, We observe that our method with ResNet-50 performs well enough to be comparable to state-of-the-art approaches." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.601, + 0.4, + 0.615 + ], + "angle": 0, + "content": "4.3 Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.631, + 0.784, + 0.676 + ], + "angle": 0, + "content": "We analyze the effectiveness of our framework components, analysis of logit gap, effectiveness of logit average threshold, comparison for false negative identification, and sensitivity analysis of CAM threshold." + }, + { + "type": "table_caption", + "bbox": [ + 0.31, + 0.705, + 0.692, + 0.719 + ], + "angle": 0, + "content": "Table 3: Ablation study of our method with Q2L model." + }, + { + "type": "table", + "bbox": [ + 0.276, + 0.731, + 0.723, + 0.809 + ], + "angle": 0, + "content": "
Consistency Reg.IGNORE + SPBCw/ Logit Avg. ThresholdVOCCOCONUSWIDECUB
87.973.549.219.7
✓88.873.647.511.1
✓✓90.076.252.022.8
✓✓✓90.176.352.823.4
" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.375 + ], + "angle": 0, + "content": "Analysis of Proposed Components. To demonstrate the effectiveness of the components in our framework, we conduct an ablation study using the PASCAL VOC, COCO, NUSWIDE and CUB datasets. In Tab. 3, the first row is the case where the model is trained with only AN loss. As shown in Tab. 3, when all components are included, the highest performance is achieved. The logit average threshold shows meaningful improvements in NUSWIDE and CUB. Considering that NUSWIDE and CUB have a relatively large number of classes, it is evident that the logit average threshold works more effectively in datasets with a larger number of classes. Also, when only consistency regularization is applied without ignore and SPBC, there was a significant performance drop in NUSWIDE and CUB. This observation indicates that simply applying consistency regularization alone does not significantly improve performance. In contrast, applying it with ignore and SPBC results in notable performance improvements. It means that our regularization is mutually effective when combined with our ignore method." + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.391, + 0.473, + 0.514 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.281, + 0.518, + 0.438, + 0.53 + ], + "angle": 0, + "content": "(a) Logit Gap Distribution" + }, + { + "type": "image", + "bbox": [ + 0.522, + 0.391, + 0.765, + 0.514 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.508, + 0.517, + 0.782, + 0.531 + ], + "angle": 0, + "content": "(b) Ablation Study of Logit Average Threshold" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.555, + 0.788, + 0.598 + ], + "angle": 0, + "content": "Fig. 3: Analysis of Logit Gap Threshold and Logit Average Threshold on PASCAL VOC 2012. SP, TN, and FN indicate the single positive, true negative, and false negative, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.64, + 0.788, + 0.792 + ], + "angle": 0, + "content": "Analysis of Logit Gap. In this section, we examine whether there is a significant difference in the logit gap between true negatives and false negatives. Additionally, by observing the logit gap of single positives, we validate the effectiveness of the logit gap threshold. Figure 3a depicts the average logit gap per epoch observed during model training with our framework. As shown in Fig. 3a, there is a significant difference in the gap between false negatives and true negatives. Furthermore, it is observed that the gap for the single positives is lower than that of the false negatives. In other words, during model training with our framework, the logit gap is a suitable criterion for identifying false negatives, and the logit gap threshold works effectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Effectiveness of Logit Average Threshold. In the process of rejecting false negatives, to minimize incorrect rejections (rejections of true negatives), we pro-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "posed the logit average threshold. To verify the effectiveness of the logit gap threshold, we examine in this section how the logit average threshold mitigates the rejection of true negatives. Figure 3b illustrates the rejection ratio starting from the end of the warm-up phase. The y-axis represents FN/TN ratio, where FN is the number of unannotated positives (False Negatives) rejected by our method, and TN is the number of true negatives rejected by our method. As shown in Fig. 3b, when logit average threshold is applied, FN/TN noticeably decreases. This indicates that our logit average threshold effectively mitigates the rejection of true negatives." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.303, + 0.495, + 0.385 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.255, + 0.388, + 0.465, + 0.4 + ], + "angle": 0, + "content": "(a) P&R Comparison with PLC [29]" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.401, + 0.484, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.243, + 0.485, + 0.477, + 0.497 + ], + "angle": 0, + "content": "(c) P&R Comparison with BoostLU [13]" + }, + { + "type": "image", + "bbox": [ + 0.514, + 0.303, + 0.772, + 0.385 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.546, + 0.388, + 0.744, + 0.4 + ], + "angle": 0, + "content": "(b) F1 Comparison with PLC [29]" + }, + { + "type": "image", + "bbox": [ + 0.523, + 0.401, + 0.765, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.534, + 0.485, + 0.756, + 0.497 + ], + "angle": 0, + "content": "(d) F1 Comparison with BoostLU [13]" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.566 + ], + "angle": 0, + "content": "Fig. 4: Comparison with recent approaches. Experiments are conducted on PASCAL VOC 2012 dataset. Q2L model is used in comparison with PLC [29] and ResNet-50 is used in comparison with BoostLU [13]. BoostLU represents the case where BoostLU is applied to LL-R [12]. P and R represent precision and recall, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.787, + 0.645 + ], + "angle": 0, + "content": "Comparison for False Negative Identification. We show our method's ability to identify false negatives through a comparison with recent approaches [13, 29]. We compare with PLC [29] and BoostLU [13], which include LL-R [12]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.645, + 0.788, + 0.749 + ], + "angle": 0, + "content": "For PLC [29], precision is very high; however, as a trade-off, recall is very low (see Fig. 4a). Therefore, many false negative labels are not identified, and the model continuously learns these labels with incorrect label information. For BoostLU [13], as training progresses, recall becomes very high. Therefore, it could identify many false negative labels. However, due to the significant decrease of precision, a large number of true negative labels are also incorrectly identified as false negatives." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Compared to these methods, our approach does not exhibit a significant trade-off between precision and recall. Furthermore, as shown in Fig. 4b and 4d, F1 score of our approach exhibits a relatively high score and becomes increases, while the F1 scores of other methods become sharply decrease. This observation demonstrates that our method, based on logit gap threshold and logit average threshold, has an remarkable ability in identifying false negatives." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.366, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.146, + 0.476, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.27, + 0.256, + 0.436, + 0.277 + ], + "angle": 0, + "content": "(a) Comparison of mAP according to CAM threshold" + }, + { + "type": "image", + "bbox": [ + 0.52, + 0.147, + 0.807, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.55, + 0.256, + 0.753, + 0.277 + ], + "angle": 0, + "content": "(b) Variation of the Gap threshold according to CAM threshold" + }, + { + "type": "image_caption", + "bbox": [ + 0.312, + 0.289, + 0.691, + 0.304 + ], + "angle": 0, + "content": "Fig. 5: Analysis of CAM Threshold and Gap Threshold." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.337, + 0.787, + 0.413 + ], + "angle": 0, + "content": "Sensitivity Analysis of CAM Threshold. We analyze the sensitivity of the model performance according to changes in the CAM threshold. Fig. 5a shows that the model's performance is not sensitive to the CAM threshold. Also, Fig. 5b indicates that as the CAM threshold \\(\\gamma\\) increases, the logit gap threshold \\(\\tau\\) also automatically increases." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.415, + 0.787, + 0.476 + ], + "angle": 0, + "content": "With a higher CAM threshold, the region exceeding the threshold in the CAM area decreases, causing more areas of the image to be obscured in the masked image. Consequently, the information gap between the masked image and the original image for a single positive label becomes large." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.787, + 0.552 + ], + "angle": 0, + "content": "Our gap threshold is the average logit gap between the original image and the masked image for a single positive label. Therefore, as the CAM threshold increases, the gap threshold automatically increases as well. In other words, the gap threshold we propose can adapt dynamically to changes in the hyperparameter CAM threshold." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.587, + 0.36, + 0.603 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We proposed a new approach for identifying false negative labels in SPML. Our approach was based on the model's output gap resulting from the information gap between the images. With rejecting the false negative labels, we trained the models with minimizing bias to false negative labels. Through various experimental results, we demonstrated the superiority of our proposed for identifying false negative labels in assumed negative labels. Our approach showed performance improvements, and achieved state-of-the-art results in most datasets. Our proposed method generated the masked image with the CAM of the single positive label. Then, we identified false negatives with the information gap between the masked image and the original image. By rejecting identified false negatives, we prevented the model from being biased to false negative labels and built more reliable models. In future work, we would consider utilizing modules for more precise CAM extraction or leveraging the foundational model for generating the masked images." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.269 + ], + "angle": 0, + "content": "Acknowledgements. This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00421, AI Graduate School Support Program), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (RS-2024-00352717), and institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.RS-2024-00437633, Development of Open-ended Alignment Fluxional AI for Ever-changing Environment and Value)" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.296, + 0.323, + 0.311 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.332, + 0.784, + 0.374 + ], + "angle": 0, + "content": "1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.375, + 0.785, + 0.402 + ], + "angle": 0, + "content": "2. Beyer, L., Henaff, O.J., Kolesnikov, A., Zhai, X., Oord, A.v.d.: Are we done with imagenet? arXiv preprint arXiv:2006.07159 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.403, + 0.785, + 0.445 + ], + "angle": 0, + "content": "3. Chen, Z.M., Wei, X.S., Wang, P., Guo, Y.: Multi-label image recognition with graph convolutional networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5177-5186 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.446, + 0.785, + 0.487 + ], + "angle": 0, + "content": "4. Chua, T.S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.: Nus-wide: a real-world web image database from national university ofSingapore. In: Proceedings of the ACM international conference on image and video retrieval. pp. 1-9 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.488, + 0.785, + 0.53 + ], + "angle": 0, + "content": "5. Cole, E., Mac Aodha, O., Lorieul, T., Perona, P., Morris, D., Jojic, N.: Multi-label learning from single positive labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 933-942 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.531, + 0.785, + 0.558 + ], + "angle": 0, + "content": "6. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.V.: Autoaugment: Learning augmentation policies from data. arXiv preprint arXiv:1805.09501 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.559, + 0.785, + 0.613 + ], + "angle": 0, + "content": "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.615, + 0.785, + 0.657 + ], + "angle": 0, + "content": "8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.658, + 0.785, + 0.699 + ], + "angle": 0, + "content": "9. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes challenge: A retrospective. International journal of computer vision 111, 98-136 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.7, + 0.785, + 0.741 + ], + "angle": 0, + "content": "10. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.742, + 0.785, + 0.797 + ], + "angle": 0, + "content": "11. Jiang, P.T., Yang, Y., Hou, Q., Wei, Y.: L2g: A simple local-to-global knowledge transfer framework for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16886-16896 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.798, + 0.785, + 0.84 + ], + "angle": 0, + "content": "12. Kim, Y., Kim, J.M., Akata, Z., Lee, J.: Large loss matters in weakly supervised multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14156-14165 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.332, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "G. Song et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "13. Kim, Y., Kim, J.M., Jeong, J., Schmid, C., Akata, Z., Lee, J.: Bridging the gap between model explanations in partially annotated multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3408-3417 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.203, + 0.787, + 0.23 + ], + "angle": 0, + "content": "14. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.23, + 0.787, + 0.285 + ], + "angle": 0, + "content": "15. Lee, S., Lee, M., Lee, J., Shim, H.: Railroad is not a train: Saliency as pseudo-pixel supervision for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5495-5505 (June 2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.285, + 0.787, + 0.339 + ], + "angle": 0, + "content": "16. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.339, + 0.787, + 0.366 + ], + "angle": 0, + "content": "17. Liu, S., Zhang, L., Yang, X., Su, H., Zhu, J.: Query2label: A simple transformer way to multi-label classification. arXiv preprint arXiv:2107.10834 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.366, + 0.787, + 0.393 + ], + "angle": 0, + "content": "18. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.393, + 0.787, + 0.433 + ], + "angle": 0, + "content": "19. Lukasik, M., Bhojanapalli, S., Menon, A., Kumar, S.: Does label smoothing mitigate label noise? In: International Conference on Machine Learning. pp. 6448-6458. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.433, + 0.787, + 0.487 + ], + "angle": 0, + "content": "20. Rajeswar, S., Rodriguez, P., Singhal, S., Vazquez, D., Courville, A.: Multi-label iterated learning for image classification with label ambiguity. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4783-4793 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.487, + 0.787, + 0.528 + ], + "angle": 0, + "content": "21. Ridnik, T., Ben-Baruch, E., Zamir, N., Noy, A., Friedman, I., Protter, M., Zelnik-Manor, L.: Asymmetric loss for multi-label classification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 82-91 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.528, + 0.787, + 0.569 + ], + "angle": 0, + "content": "22. Ridnik, T., Sharir, G., Ben-Cohen, A., Ben-Baruch, E., Noy, A.: ML-decoder: Scalable and versatile classification head. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 32-41 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.569, + 0.787, + 0.623 + ], + "angle": 0, + "content": "23. Selvaraju, R.R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., Batra, D.: Gradcam: Visual explanations from deep networks via gradient-based localization. In: Proceedings of the IEEE international conference on computer vision. pp. 618-626 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.623, + 0.787, + 0.678 + ], + "angle": 0, + "content": "24. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.678, + 0.787, + 0.718 + ], + "angle": 0, + "content": "25. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.718, + 0.787, + 0.772 + ], + "angle": 0, + "content": "26. Verelst, T., Rubenstein, P.K., Eichner, M., Tuytelaars, T., Berman, M.: Spatial consistency loss for training multi-label classifiers from single-label annotations. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3879-3889 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.772, + 0.787, + 0.799 + ], + "angle": 0, + "content": "27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "28. Wang, Y., Zhang, J., Kan, M., Shan, S., Chen, X.: Self-supervised equivariant attention mechanism for weakly supervised semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.666, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IGNORE" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "29. Xie, M.K., Xiao, J., Huang, S.J.: Label-aware global consistency for multi-label learning with single positive labels. Advances in Neural Information Processing Systems 35, 18430-18441 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.231 + ], + "angle": 0, + "content": "30. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.231, + 0.788, + 0.286 + ], + "angle": 0, + "content": "31. Yun, S., Oh, S.J., Heo, B., Han, D., Choe, J., Chun, S.: Re-labeling imagenet: from single to multi-labels, from global to localized labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2340-2350 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.286, + 0.788, + 0.328 + ], + "angle": 0, + "content": "32. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2921-2929 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.328, + 0.788, + 0.37 + ], + "angle": 0, + "content": "33. Zhou, D., Chen, P., Wang, Q., Chen, G., Heng, P.A.: Acknowledging the unknown for multi-label learning with single positive labels. In: European Conference on Computer Vision. pp. 423-440. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.37, + 0.788, + 0.412 + ], + "angle": 0, + "content": "34. Zhou, T., Zhang, M., Zhao, F., Li, J.: Regional semantic contrast and aggregation for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4299-4309 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.412 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_origin.pdf b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..222a75e0e2065a950d5af110014081c14cdb3170 --- /dev/null +++ b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/83df006d-a5d7-46c3-a42b-ce3969981c0d_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6202580ddf7af2d4b7d512b9d12f34831c77cd316de63866fe41b94603417b35 +size 781390 diff --git a/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/full.md b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/full.md new file mode 100644 index 0000000000000000000000000000000000000000..5b065d7fd87ddbcc358c8ed872fb72b0c7a39675 --- /dev/null +++ b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/full.md @@ -0,0 +1,291 @@ +# IGNORE: Information Gap-based False Negative Loss Rejection Single Positive Multi-Label Learning + +GyeongRyeol Song, Noo-ri Kim, Jin-Seop Lee, and Jee-Hyong Lee* + +Sungkyunkwan University, Suwon, South Korea {thd7524, pd99j, wlstjq0602, john}@skku.edu + +Abstract. Single Positive Multi-Label Learning (SPML) is a method for a scarcely annotated setting, in which each image is assigned only one positive label while the other labels remain unannotated. Most approaches for SPML assume unannotated labels as negatives ("Assumed Negative", AN). However, with this assumption, some positive labels are inevitably regarded as negative (false negative), resulting in model performance degradation. Therefore, identifying false negatives is the most important with AN assumption. Previous approaches identified false negative labels using the model outputs of assumed negative labels. However, models were trained with noisy negative labels, their outputs were not reliable. Therefore, it is necessary to consider effectively utilizing the most reliable information in SPML for identifying false negative labels. In this paper, we propose the Information Gap-based False Negative LOss REjection (IGNORE) method for SPML. We generate the masked image that all parts are removed except for the discriminative area of the single positive label. It is reasonable that when there is no information of an object in the masked image, the model's logit for that object is low. Based on this intuition, we identify the false negative labels if they have a significant model's logit gap between the masked image and the original image. Also, by rejecting false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on four datasets: Pascal VOC 2012, MS COCO, NUSWIDE, and CUB. Compared to previous state-of-the-art methods in SPML, our method outperforms them on most of the datasets. + +Keywords: Multi-Label Learning $\cdot$ Single Positive Multi-Label Learning $\cdot$ Information Gap $\cdot$ False Negative Rejection + +# 1 Introduction + +Multi-label learning is an approach that trains a model using images with multiple labels, aiming to build a model that is able to predict all relevant labels for the images with multiple labels. Unlike multi-class learning, where the model aims to + +![](images/034e28894c18cad2fe922649c08d07ffcb1124e0d587209914bf74658ce3a6e4.jpg) +Fig. 1: Example of an image for Single Positive Multi-Label Learning (SPML) and our main idea for SPML. Ground truth is 1 if there is a corresponding object, otherwise 0. In SPML, only one positive label is given, and all the other labels are not given, i.e., unannotated. In Assumed Negative (AN) assumption, all unannotated labels are assumed to be negative. Here, false negative labels mean the unannotated positive labels, which are incorrectly assumed to be negative. To identify the false negative labels, we first extract the discriminative areas of the single positive label and generate the masked image. Then, we utilize the information gap between the original image and the masked image. + +![](images/99d881203f7f43047434d8efc057eecda92656e56710303c54223007c0ef6539.jpg) + +![](images/a6d3bdeea3a07784a45340baf1917d3cf21ecc7bb2399cdc9e40b3492ec358c0.jpg) + +predict only a single label for the input image, multi-label learning is much more challenging because the model aims to predict multiple labels associated with the input image. Moreover, multi-label learning is more practical and realistic than multi-class learning, as the majority of real-world images contain multiple objects [2,3,17,20,22,31]. To achieve effective multi-label learning, similar to other supervised learning tasks, a fully labeled dataset is required. However, real-world images typically contain tens to thousands of different classes, and fully annotating all of them is extremely labor-intensive and practically unfeasible. + +To reduce labor-intensive costs, researches on Single Positive Multi-Label Learning (SPML) have been increasing recently [5,12,13,26,29,33]. As shown in Fig. 1, in SPML, only one positive label is given and the others are unannotated for each images. To deal with unannotated labels in SPML, most approaches [12,13,26,29] assumed unannotated labels as negative (Assumed Negative, AN). This assumption has the advantage of providing supervision for all unannotated labels. Also, this assumption is reasonable because most multi-label datasets are dominated by negatives. However, by assuming all unannotated labels as negatives, it inevitably provides incorrect supervision for actually positive labels among the unannotated ones. In other words, these labels are false negative labels. These false negative labels can consistently cause confusion during model training, and impair the model's generalization ability. + +Therefore, most studies [5,12,13,26,29] are focusing on identifying false negatives in SPML. They usually identify false negatives by utilizing model output's confidence or losses. In more detail, they identify the labels with abnormally high values of the model's outputs [26, 29] or losses [12, 13] as false negative labels. + +![](images/9419fe6d63fb140200cc934a1b48e32f7c2d8e52d46f376bee5461df52277036.jpg) +Fig. 2: Overview of the proposed method. In our method, we generate a masked image through the single positive label. Then, we utilize the logit gap between the masked image and the original image to identify false negatives and reject them in training $(\mathcal{L}_{\text{IGNORE}})$ . + +Because it implies that unannotated labels could be positive labels. However, the confidence or losses for the false negative labels are not reliable because models could learn them with noisy labels. To address this issue, it is necessary to consider robust criterion that are insensitive to noisy labels. + +Since the single positive labels are the most reliable information in SPML, the model's output for the single positive label is reliable. Therefore, we can capture the discriminative areas [11, 15, 28, 32, 34] of objects and generate a masked image that includes only the discriminative areas of the single positive label (see Fig. 1). The masked image contains only the information corresponding to the single positive label. On the other hand, the original image contains information corresponding to ground truth labels. It is reasonable that when there is no information of an object in the image, the model's output for that object is low. Therefore, for false negatives, the model's output for the original image is expected to be higher than the model's output for the masked image. By utilizing the model's output gap resulting from the information gap between the images, false positive labels would be effectively identified. + +In this paper, we propose the Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. By rejecting the false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on various benchmark datasets such as PASCAL VOC 2012 [9], MS COCO [16], NUSWISE [4], and CUB [27]. Our method also outperforms most of the state-of-the-art methods in SPML. + +# 2 Related Works + +Problems with AN loss. In SPML, Assume Negative (AN) is the main approach that provides supervision to unannotated labels. Since multi-label datasets are dominated by negatives [21], assuming unannotated labels as negatives can be a reasonable and straightforward approach in situations where most of the label information is unknown. Also, Binary Cross-Entropy (BCE) loss in AN is referred to as AN loss. With AN loss, losses of all unannotated labels are calculated through the negative term of BCE. Thus, the model erroneously learns the unannotated positive labels (false negative labels) as negative labels. This confusion in multi-label learning results in bias to false negative labels and model performance drop. There are researches that point out issues caused by false negative label learning with AN loss [13,33]. In training with AN loss, BoostLU [13] observed that the attribution score of Class-Activation Map (CAM) is damaged due to false negative labels. To address this issue, they proposed an activation function that can boost the damaged CAM. EM [33] pointed out the issue that AN loss incurs the high loss gradient propagation problem for false negative labels. They proposed an entropy maximization loss that suppresses the gradient for unannotated labels with high prediction, without assuming unannotated labels as negatives. + +In summary, learning false negative labels causes confusion in model training by continuously propagating the incorrect information to the model and affects the model's output. Therefore, it is necessary to consider the false negative labels when utilizing AN loss in SPML. + +Approaches and Challenges for False Negatives. There are approaches that reject the identified false negative labels or regard them as positive labels. PLC [29] adopted a model prediction-based pseudo-labeling method. While training with AN loss, they generated pseudo-labels for unannotated labels using a fixed threshold. Using these pseudo-labels, They trained the model with unannotated labels once again. SCL [26] identified labels as false negatives with significantly high values of model predictions, and other methods [12, 13] used losses to identify false negatives. These methods proposed utilizing identified false negatives as positives in training or rejecting them from training. + +In multi-label learning, usually the number of negatives overwhelms the number of positives in each sample. Therefore, it is challenging to identify as many false negatives as desired with high precision. Additionally, if the model incorrectly learns actual negative labels as positive, it can lead to significant bias in the model for those labels. As a result, generally rejecting the identified false negatives from training showed better performance. + +Despite consideration of false negatives, however, because these methods are based on the AN loss, the model is easy to learn incorrect label information. The model learns assumed negative labels with incorrect label information, the distinct model outputs associated with false negative labels (e.g., high loss or high + +probability) gradually become more similar to those of true negatives. That is, it becomes more challenging to identify false negatives from true negative labels using the information from assumed negative labels. Therefore, it is necessary to identify false negatives through new criterion rather than relying on the information from assumed negative labels. + +# 3 Proposed Method + +In this section, we propose the method of identifying and rejecting false negatives based on the information gap between the masked image and the original image. Firstly, we introduce the preliminary in Sec. 3.1. Then, we explain the proposed method in the following sections. + +# 3.1 Preliminary + +For single positive multi-label learning tasks, a dataset $\mathcal{D} = \{\mathbf{x}_n,\mathbf{y}_n\}_{n = 1}^N$ is given, where $\mathbf{x}_n$ is an image and $\mathbf{y}_n\in \mathcal{V} = \{u,1\} ^C$ is the vector of labels. $N$ is the number of images, and $C$ is the number of classes. The $\mathbf{y}_n$ consists of a single positive label and unknown labels. Except for the single positive, the others are unannotated labels. The single positive label is indicated by 1 and unannotated labels are indicated by $u$ . + +In SPML, most approaches assumed unannotated labels as negative, and trained models using AN (Assume Negative) loss as follows: + +$$ +\begin{array}{l} \mathcal {L} _ {A N} = - \frac {1}{B C} \sum_ {i = 1} ^ {B} \sum_ {j = 1} ^ {C} [ \mathbb {I} [ y _ {i j} = 1 ] \cdot \log (p _ {i j}) \tag {1} \\ + \mathbb {I} [ y _ {i j} = u ] \cdot \log (1 - p _ {i j}) ] \\ \end{array} +$$ + +where $y_{ij}$ is the label of the $j$ -th class for the $i$ -th image, and $p_{ij}$ is the model's prediction for $y_{ij}$ . $B$ is the batch size, $C$ is the number of classes, and $\mathbb{I}$ is the indicator function that returns 1 if the condition is true and 0 otherwise. Since the AN loss is useful to give supervision to unannotated labels, our approach also based on the AN loss. However, the AN loss inevitably provides incorrect supervision for actually positive labels among the unannotated ones. Therefore, it is necessary to consider that effectively utilizing the most reliable information in SPML to minimize false negative problems. + +# 3.2 Overview of Proposed Method + +In this paper, we propose our Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. The method for identifying false negative labels based on the information gap proceeds through the following steps. Firstly, we generate the masked image that all parts are removed except the discriminative area of the single positive label (see Fig. 2). Then, we compare + +the model's logit gap between the masked image and the original image. If there is an object in the masked-out areas of the masked image, there is likely to be a substantial gap in the model's logit between the masked image and the original image. Because the object is absent in the masked image, in contrast to the original image. Based on this intuition, we identified the false negative labels if they have a significant model's output gap between the two images. The details of UNUSED's components are discussed in Sec. 3.3. As shown in Fig. 2, after identifying the false negative labels, we reject the losses of the corresponding negative labels to prevent the model from learning incorrect label information. + +# 3.3 Components of False Negative Loss Rejection + +In this section, we first introduce the process of generating the masked images that provide information to identify false negatives in our proposed method. And then, we introduce the logit gap threshold and the logit average threshold that compose our information gap-based false negative loss rejection, UNUSED. + +Generation of Masked Image. We identify and reject the false negative labels based on the information gap between the masked image and the original image. In this section, we discuss the method of generating the masked images through the single positive labels. It is well-known that the class-activation map (CAM) [23, 32] focuses on the discriminative areas of objects [11, 15, 28, 34]. Furthermore, BoostLU [13] reported that the model trained with AN loss can extract reliable CAM compared to the CAM extracted by a model trained with fully-labeled dataset. Therefore, we extract the CAM for the single positive labels from the original image $\mathbf{x}$ . The detailed explanation for extracting the CAM is in the supplementary material. Based on the CAM, we generate the mask as follows: + +$$ +M _ {i j} = \left\{ \begin{array}{l l} 1 & \text {i f} A _ {i j} > \gamma \\ 0 & \text {o t h e r w i s e} \end{array} \right. \tag {2} +$$ + +where $A$ and $M$ indicate the CAM and the mask, respectively. Also, $\gamma$ is a CAM threshold to capture discriminative area for the positive label. By multiplying this mask with the original image $\mathbf{x}$ element-wise, we can generate a masked image $\mathbf{x}^M$ where the areas only related to single positive labels are preserved, and the rest of the image is masked out as follows: + +$$ +\mathbf {x} ^ {M} = \mathbf {x} \odot M \tag {3} +$$ + +The masked image is used to establish the Logit Gap Threshold for identifying the false negative labels. + +Logit Gap Threshold. We design the criterion for identifying the false negative labels based on the logit gap between the masked image $\mathbf{x}^M$ and the original image $\mathbf{x}$ . The logit gap $G$ is defined as follows: + +$$ +G _ {i j} = \left| h \left(f \left(\mathbf {x} _ {i}\right)\right) _ {j} - h \left(f \left(\mathbf {x} _ {i} ^ {M}\right)\right) _ {j} \right| \tag {4} +$$ + +where $f$ and $h$ denotes image encoder and classification head, respectively. We define the logit for the image as $h(f(\mathbf{x}))$ , and the logit for the $j$ -th class of the $i$ -th image as $h(f(\mathbf{x}_i))_j$ . Among the assumed negative labels, the labels with a high $G$ are more likely to be false negatives. + +As shown in Fig. 2, in the masked image, the object of the single positive label retains some of its information, but any information of the other objects is completely eliminated in the masked image. The value of $G$ for the other objects in the image will be larger than the value of $G$ for the single positive label. Based on this observation, we set the threshold $\tau$ using the average $G$ value of the single positive labels. The $\tau$ is defined as follows: + +$$ +\tau^ {t} = \left\{ \begin{array}{l l} 0 & \text {i f} t = 0 \\ \lambda \tau^ {t - 1} + (1 - \lambda) \frac {\sum_ {j = 1} ^ {C} \sum_ {i = 1} ^ {B} I \left[ y _ {i j} = 1 \right] G _ {i j}}{B} & \text {o t h e r w i s e} \end{array} \right. \tag {5} +$$ + +where $B$ denotes the batch size. The gap threshold $\tau$ is adaptively updated at each iteration $t$ using Exponential Moving Average (EMA). $\lambda$ is a hyperparameter that determines the momentum decay of the EMA. + +Logit Average Threshold. In this section, we introduce logit average threshold. We identify the false negatives that are actually present in the original image with the logit gap resulting from the information gap between the images. Therefore, even if a large logit gap occurs for labels that are not actually present in the original image, we do not need to identify these labels as false negatives labels with low logit values in the original image are likely to be true negatives that did not originally exist in the original image. To prevent these rejection of true negatives in our rejection method, we propose the logit average threshold. + +It is evident that the logits of true negative labels are relatively low. Therefore, we only consider the rejection of the labels with a logit higher than the average of the logits for each class. We set the threshold $\mu$ as the average logit of assumed negative labels for each class. We select the labels with logits higher than the threshold $\mu$ . Through this process, we only reject the selected labels. Additionally, $\mu$ is self-adaptively updated using Exponential Moving Average (EMA) at each iteration. The threshold $\mu_j^t$ for the j-th class at time step $t$ is as follows: + +$$ +\mu_ {j} ^ {t} = \left\{ \begin{array}{l l} 0 & \text {i f} t = 0 \\ \lambda \mu_ {j} ^ {t - 1} + (1 - \lambda) \frac {1}{N _ {j}} \sum_ {i = 1} ^ {N _ {j}} \mathbb {I} [ y _ {i j} = u ] \cdot h (f (\mathbf {x} _ {i})) _ {j} & \text {o t h e r w i s e} \end{array} \right. \tag {6} +$$ + +where $N_{j}$ denotes the number of assumed negative labels for the j-th class. + +# 3.4 Training with False Negative Loss Rejection + +Information Gap-based False Negative Loss Rejection. In this section, we describe our rejection function that incorporates both the logit average threshold and the logit gap threshold. The rejection function $R$ incorporating the logit + +average threshold and the logit gap threshold is defined as follows: + +$$ +R _ {i j} = \left\{ \begin{array}{l l} 0 & \text {i f} h \left(f \left(\mathbf {x} _ {i}\right)\right) _ {j} > \mu_ {j} ^ {t} \text {a n d} G _ {i j} > \tau^ {t} \\ 1 & \text {o t h e r w i s e} \end{array} \right. \tag {7} +$$ + +The rejection function $R$ rejects the labels with $G$ higher than the $\tau$ and a logit higher than $\mu$ . In other words, it identifies the labels with high logit values for the original image and a significant logit gap between the two images, then rejects them from the training. + +By incorporating this function into the negative term of the AN loss, identified false negatives are rejected from the model training. Our IgnORE method that combined with AN loss and the rejection function $R$ is as follows: + +$$ +\begin{array}{l} \mathcal {L} _ {\text {I G N O R E}} = - \frac {1}{S} \sum_ {i = 1} ^ {B} \sum_ {j = 1} ^ {C} \left(\mathbb {I} \left[ y _ {i j} = 1 \right] \cdot \log \left(p _ {i j} ^ {s}\right) \right. \tag {8} \\ + \mathbb {I} [ y _ {i j} = u ] \cdot R _ {i j} \cdot \log \left(1 - p _ {i j} ^ {s}\right)) \\ \end{array} +$$ + +where $S$ denotes the sum of the single positive labels and the labels that are not rejected negative labels. $p_{ij}^{s}$ denotes $\sigma (h(f(\mathbf{x}_i^s)_j)$ and $\sigma$ denotes sigmoid function. $\mathbf{x}^s$ denotes strong augmented image. It is well known that strong augmentation improves the generalization ability of deep learning models across most datasets [1, 6, 7, 24, 30]. Therefore, we utilize the strong augmented images to enhance model generalization. + +Single Positive Binary Classification (SPBC). We utilize the CAM of the single positive labels. Therefore, it is necessary to train the model with correct supervision for the single positive labels. The model learns given single positive labels through binary classification for a single positive class. Single Positive Binary Classification (SPBC) is defined as follows: + +$$ +\mathcal {L} _ {S P B C} = - \frac {1}{B} \sum_ {i = 1} ^ {B} \sum_ {j = 1} ^ {C} \mathbb {I} [ y _ {i j} = 1 ] \cdot \log (p _ {i j}) \tag {9} +$$ + +Consistency Regularization. Our method identifies the false negatives based on the model's logits. Therefore, our model needs to output consistent logits on similar images. To ensure such consistency, we take into account the consistency regularization between original images and strongly augmented images used in our framework. We propose the consistency regularization to the logits between original images and strongly augmented images, enabling the model to have consistency across differently augmented images. This ensures that the model produces consistent logits for different views of the same image. Our consistency regularization is defined as follows: + +$$ +\mathcal {L} _ {r e g} = - \frac {1}{B C} \sum_ {i = 1} ^ {B} \sum_ {j = 1} ^ {C} \left| h \left(f \left(\mathbf {x} _ {i}\right) _ {j} - h \left(f \left(\mathbf {x} _ {i} ^ {s}\right)\right) _ {j} \right| ^ {2} \right. \tag {10} +$$ + +Overall loss. The overall loss is as follows: + +$$ +\mathcal {L} = \lambda_ {S P B C} \cdot \mathcal {L} _ {S P B C} + \mathcal {L} _ {I G N O R E} + \lambda_ {r e g} \cdot \mathcal {L} _ {r e g} \tag {11} +$$ + +where $\lambda_{SPBC}$ and $\lambda_{reg}$ are hyperparameters that denote the weights assigned to the respective loss terms. + +# 4 Experiments + +In this section, we present our experimental results and compare them with previous SPML approaches. Furthermore, we conduct an ablation study to analyze why our method is effective in SPML. We use mean average precision (mAP) as the comparison metric with previous approaches. + +# 4.1 Experimental Setup + +Datasets. We use four benchmark datasets to demonstrate our experimental results: PASCAL VOC 2012 [9], MS COCO 2014 [16], NUSWIDE [4], and CUB [27]. Following the settings of previous research [5], we create a single positive multi-label setting for the four benchmark datasets by randomly retaining one positive label and removing all other annotations. In particular, for the CUB dataset [27], we use bird attributes as target classes instead of bird categories, following the setup of ROLE [5]. For each dataset, we reserve $20\%$ of the train set as a validation set, and select the best model based on its performance on the validation set. + +Models. For a fair comparison with previous approaches [5,12,13,19,29,33], we conduct experiments with two models [10, 17]. One of the models is a ResNet-50 [10] that is pre-trained on ImageNet [8]. For ResNet-50, We employ the architecture of a convolutional layer followed by a 1x1 convolutional layer and global average pooling, the same as BoostLU [13]. + +The other one is a model with a transformer [25] architecture called Q2L [17]. For the image encoder of Q2L [17], we utilize the ResNet-50 [10] that is pretrained on ImageNet [8]. We explain the details on how to obtain CAMs for each model in Supplementary details. + +Hyperparameter Settings. For Q2L, we set batch sizes in $\{8, 16\}$ , learning rates in $\{1e-4, 1e-5\}$ . We use AdamW [18] as optimizer and OneCycleLR as scheduler. For ResNet-50, we set batch sizes in $\{8, 12, 16\}$ , learning rates in $\{1e-4, 1e-5\}$ , and use Adam [14] as optimizer. Each image is resized to $448 \times 448$ . Only random HorizontalFlip is used for original images, while random horizontal flip and RandAugmentation [7] are used for strong augmented images CAM threshold $\gamma$ is set to 0.4 for ResNet-50 and 0.8 for Q2L, respectively. In Q2L, we set the CAM threshold to 0.8. And, we set loss weights $\lambda_{reg}$ to 0.5, and $\lambda_{SPBC}$ to 0.5 except COCO dataset. On COCO dataset, we set loss weights $\lambda_{reg}$ to 0.1, + +Table 1: Experimental results of our method with Q2L model on four SPML benchmark datasets. Metric presented in the table is mAP (mean Average Precision). Additionally, bold font indicates the highest performance, while underlining indicates the second highest performance. Our method demonstrates the highest performance on most datasets. + +
MethodDataset
VOCCOCONUSCUB
AN87.672.348.518.6
WAN [5]89.273.548.522.5
EPR [5]88.872.749.323.1
AN-LS [5]88.070.947.116.3
ROLE [5]88.169.644.514.2
EM [33]89.273.248.722.2
EM + APL [33]89.273.148.623.6
PLC + LAC [29]89.675.651.123.3
Ours90.176.352.823.4
+ +and $\lambda_{SPBC}$ to 0.5. In ResNet-50, we set the CAM threshold in $\{0.4, 0.5\}$ . And, we set the loss weights $\lambda_{reg}$ to 0.5, and $\lambda_{SPBC}$ to 0.1 except CUB dataset. On CUB dataset, we set loss weights $\lambda_{reg}$ to 0.5, and $\lambda_{SPBC}$ to 0.5. Considering that the updates for the threshold $\tau$ might not be sufficient in the early stages of training, we set the warm-up phase. In warm-up phase, our model is trained with AN loss. + +# 4.2 Experimental Results + +Performance with Q2L model. We compare our experimental results with recent approaches for the Q2L model on four datasets: Weak Assume Negative (WAN) [5], Expected Positive Regularization (EPR) [5], Assume Negative-Label Smoothing (AN-LS) [5], ROLE [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], and Pseudo-Labeling Consistency Regularization (PLC) with Label-Aware Global Consistency Regularization (LAC) [29]. + +As shown in Tab. 1, our method outperforms recent approaches on the VOC, COCO, and NUSWIDE datasets. In particular, on the NUSWIDE dataset, our method achieved an mAP of 1.7, higher than the previous best-performed approach. For CUB, our method do not achieve the best performance, but it shows the second-best results. The gap in performance with the best-performed approach is very small, so it can be considered comparable. + +Performance with ResNet-50 model. For ResNet-50, we compare the experimental results with the following recent approaches: Label-Smoothing (LS) [19], + +Table 2: Experimental results of our method with ResNet-50 model on four SPML benchmark datasets. Detailed ingredient of the table (metrics, bold, and underline) is the same as in Table 1. + +
MethodDataset
VOCCOCONUSCUB
AN85.8964.9242.2718.31
LS [19]87.9067.1543.7716.26
ASL [21]87.7668.7846.9318.81
ROLE [5]87.7767.0441.6313.66
ROLE + LI [5]88.2669.1245.9814.86
EM [33]89.0970.7047.1520.85
EM + APL [33]89.1970.8747.5921.84
LL-R [12]88.2770.7048.7619.56
+ BoostLU [13]89.2972.8949.5919.80
Ours89.1972.0050.0821.90
+ +Assymmetric loss (ASL) [21], ROLE [5], ROLE with LinearInit (LI) [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], Large Loss Rejection (LL-R) [12], and Large Loss Rejection (LL-R) [12] with BoostLU [13]. + +As shown in Tab. 2, our method exhibited the highest performances on the NUSWIDE and CUB dataset compared to recent approaches. On VOC and COCO, our method achieves the second-best performances. While not achieving the best performance on all datasets, We observe that our method with ResNet-50 performs well enough to be comparable to state-of-the-art approaches. + +# 4.3 Ablation Studies + +We analyze the effectiveness of our framework components, analysis of logit gap, effectiveness of logit average threshold, comparison for false negative identification, and sensitivity analysis of CAM threshold. + +Table 3: Ablation study of our method with Q2L model. + +
Consistency Reg.IGNORE + SPBCw/ Logit Avg. ThresholdVOCCOCONUSWIDECUB
87.973.549.219.7
✓88.873.647.511.1
✓✓90.076.252.022.8
✓✓✓90.176.352.823.4
+ +Analysis of Proposed Components. To demonstrate the effectiveness of the components in our framework, we conduct an ablation study using the PASCAL VOC, COCO, NUSWIDE and CUB datasets. In Tab. 3, the first row is the case where the model is trained with only AN loss. As shown in Tab. 3, when all components are included, the highest performance is achieved. The logit average threshold shows meaningful improvements in NUSWIDE and CUB. Considering that NUSWIDE and CUB have a relatively large number of classes, it is evident that the logit average threshold works more effectively in datasets with a larger number of classes. Also, when only consistency regularization is applied without ignore and SPBC, there was a significant performance drop in NUSWIDE and CUB. This observation indicates that simply applying consistency regularization alone does not significantly improve performance. In contrast, applying it with ignore and SPBC results in notable performance improvements. It means that our regularization is mutually effective when combined with our ignore method. + +![](images/71a6e1c337a11011772ffa5a07a20db3dfa441a90e80cedf6d7099a13fb6cf43.jpg) +(a) Logit Gap Distribution + +![](images/ed426926680e5a1d640c5182c23a6a5d5ecacfa8aedbed77914fe2545ef12ea3.jpg) +(b) Ablation Study of Logit Average Threshold +Fig. 3: Analysis of Logit Gap Threshold and Logit Average Threshold on PASCAL VOC 2012. SP, TN, and FN indicate the single positive, true negative, and false negative, respectively. + +Analysis of Logit Gap. In this section, we examine whether there is a significant difference in the logit gap between true negatives and false negatives. Additionally, by observing the logit gap of single positives, we validate the effectiveness of the logit gap threshold. Figure 3a depicts the average logit gap per epoch observed during model training with our framework. As shown in Fig. 3a, there is a significant difference in the gap between false negatives and true negatives. Furthermore, it is observed that the gap for the single positives is lower than that of the false negatives. In other words, during model training with our framework, the logit gap is a suitable criterion for identifying false negatives, and the logit gap threshold works effectively. + +Effectiveness of Logit Average Threshold. In the process of rejecting false negatives, to minimize incorrect rejections (rejections of true negatives), we pro- + +posed the logit average threshold. To verify the effectiveness of the logit gap threshold, we examine in this section how the logit average threshold mitigates the rejection of true negatives. Figure 3b illustrates the rejection ratio starting from the end of the warm-up phase. The y-axis represents FN/TN ratio, where FN is the number of unannotated positives (False Negatives) rejected by our method, and TN is the number of true negatives rejected by our method. As shown in Fig. 3b, when logit average threshold is applied, FN/TN noticeably decreases. This indicates that our logit average threshold effectively mitigates the rejection of true negatives. + +![](images/95e8e17921f57296e0339b49576540d4fff55a41da61851c94955547df2a6300.jpg) + +![](images/b81f31b313607b99d61c22bb631309ce64cf48352c6549674477e512a8f774e0.jpg) +(a) P&R Comparison with PLC [29] +(c) P&R Comparison with BoostLU [13] +Fig. 4: Comparison with recent approaches. Experiments are conducted on PASCAL VOC 2012 dataset. Q2L model is used in comparison with PLC [29] and ResNet-50 is used in comparison with BoostLU [13]. BoostLU represents the case where BoostLU is applied to LL-R [12]. P and R represent precision and recall, respectively. + +![](images/5e84944b3f494820fcc61026d16f79536faab6c6baae9060509e44a6649c868c.jpg) + +![](images/75907e121fc2077637978e6ee72d067c41084b15fd92c104aa623f9740836741.jpg) +(b) F1 Comparison with PLC [29] +(d) F1 Comparison with BoostLU [13] + +Comparison for False Negative Identification. We show our method's ability to identify false negatives through a comparison with recent approaches [13, 29]. We compare with PLC [29] and BoostLU [13], which include LL-R [12]. + +For PLC [29], precision is very high; however, as a trade-off, recall is very low (see Fig. 4a). Therefore, many false negative labels are not identified, and the model continuously learns these labels with incorrect label information. For BoostLU [13], as training progresses, recall becomes very high. Therefore, it could identify many false negative labels. However, due to the significant decrease of precision, a large number of true negative labels are also incorrectly identified as false negatives. + +Compared to these methods, our approach does not exhibit a significant trade-off between precision and recall. Furthermore, as shown in Fig. 4b and 4d, F1 score of our approach exhibits a relatively high score and becomes increases, while the F1 scores of other methods become sharply decrease. This observation demonstrates that our method, based on logit gap threshold and logit average threshold, has an remarkable ability in identifying false negatives. + +![](images/9bcf2dc1d26fae4e68168cc88c9046e0be35c471b55f47025e9c9807566ba4a2.jpg) +(a) Comparison of mAP according to CAM threshold + +![](images/0eb711c71d2c4e0cc08591b6a124a4c0741cd19258c3862587fe8e6668378fc0.jpg) +(b) Variation of the Gap threshold according to CAM threshold +Fig. 5: Analysis of CAM Threshold and Gap Threshold. + +Sensitivity Analysis of CAM Threshold. We analyze the sensitivity of the model performance according to changes in the CAM threshold. Fig. 5a shows that the model's performance is not sensitive to the CAM threshold. Also, Fig. 5b indicates that as the CAM threshold $\gamma$ increases, the logit gap threshold $\tau$ also automatically increases. + +With a higher CAM threshold, the region exceeding the threshold in the CAM area decreases, causing more areas of the image to be obscured in the masked image. Consequently, the information gap between the masked image and the original image for a single positive label becomes large. + +Our gap threshold is the average logit gap between the original image and the masked image for a single positive label. Therefore, as the CAM threshold increases, the gap threshold automatically increases as well. In other words, the gap threshold we propose can adapt dynamically to changes in the hyperparameter CAM threshold. + +# 5 Conclusion + +We proposed a new approach for identifying false negative labels in SPML. Our approach was based on the model's output gap resulting from the information gap between the images. With rejecting the false negative labels, we trained the models with minimizing bias to false negative labels. Through various experimental results, we demonstrated the superiority of our proposed for identifying false negative labels in assumed negative labels. Our approach showed performance improvements, and achieved state-of-the-art results in most datasets. Our proposed method generated the masked image with the CAM of the single positive label. Then, we identified false negatives with the information gap between the masked image and the original image. By rejecting identified false negatives, we prevented the model from being biased to false negative labels and built more reliable models. In future work, we would consider utilizing modules for more precise CAM extraction or leveraging the foundational model for generating the masked images. + +Acknowledgements. This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00421, AI Graduate School Support Program), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (RS-2024-00352717), and institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.RS-2024-00437633, Development of Open-ended Alignment Fluxional AI for Ever-changing Environment and Value) + +# References + +1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019) +2. Beyer, L., Henaff, O.J., Kolesnikov, A., Zhai, X., Oord, A.v.d.: Are we done with imagenet? arXiv preprint arXiv:2006.07159 (2020) +3. Chen, Z.M., Wei, X.S., Wang, P., Guo, Y.: Multi-label image recognition with graph convolutional networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5177-5186 (2019) +4. Chua, T.S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.: Nus-wide: a real-world web image database from national university ofSingapore. In: Proceedings of the ACM international conference on image and video retrieval. pp. 1-9 (2009) +5. Cole, E., Mac Aodha, O., Lorieul, T., Perona, P., Morris, D., Jojic, N.: Multi-label learning from single positive labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 933-942 (2021) +6. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.V.: Autoaugment: Learning augmentation policies from data. arXiv preprint arXiv:1805.09501 (2018) +7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020) +8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009) +9. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes challenge: A retrospective. International journal of computer vision 111, 98-136 (2015) +10. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) +11. Jiang, P.T., Yang, Y., Hou, Q., Wei, Y.: L2g: A simple local-to-global knowledge transfer framework for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16886-16896 (2022) +12. Kim, Y., Kim, J.M., Akata, Z., Lee, J.: Large loss matters in weakly supervised multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14156-14165 (2022) + +13. Kim, Y., Kim, J.M., Jeong, J., Schmid, C., Akata, Z., Lee, J.: Bridging the gap between model explanations in partially annotated multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3408-3417 (2023) +14. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) +15. Lee, S., Lee, M., Lee, J., Shim, H.: Railroad is not a train: Saliency as pseudo-pixel supervision for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5495-5505 (June 2021) +16. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014) +17. Liu, S., Zhang, L., Yang, X., Su, H., Zhu, J.: Query2label: A simple transformer way to multi-label classification. arXiv preprint arXiv:2107.10834 (2021) +18. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017) +19. Lukasik, M., Bhojanapalli, S., Menon, A., Kumar, S.: Does label smoothing mitigate label noise? In: International Conference on Machine Learning. pp. 6448-6458. PMLR (2020) +20. Rajeswar, S., Rodriguez, P., Singhal, S., Vazquez, D., Courville, A.: Multi-label iterated learning for image classification with label ambiguity. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4783-4793 (2022) +21. Ridnik, T., Ben-Baruch, E., Zamir, N., Noy, A., Friedman, I., Protter, M., Zelnik-Manor, L.: Asymmetric loss for multi-label classification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 82-91 (2021) +22. Ridnik, T., Sharir, G., Ben-Cohen, A., Ben-Baruch, E., Noy, A.: ML-decoder: Scalable and versatile classification head. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 32-41 (2023) +23. Selvaraju, R.R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., Batra, D.: Gradcam: Visual explanations from deep networks via gradient-based localization. In: Proceedings of the IEEE international conference on computer vision. pp. 618-626 (2017) +24. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020) +25. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) +26. Verelst, T., Rubenstein, P.K., Eichner, M., Tuytelaars, T., Berman, M.: Spatial consistency loss for training multi-label classifiers from single-label annotations. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3879-3889 (2023) +27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) +28. Wang, Y., Zhang, J., Kan, M., Shan, S., Chen, X.: Self-supervised equivariant attention mechanism for weakly supervised semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020) + +29. Xie, M.K., Xiao, J., Huang, S.J.: Label-aware global consistency for multi-label learning with single positive labels. Advances in Neural Information Processing Systems 35, 18430-18441 (2022) +30. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020) +31. Yun, S., Oh, S.J., Heo, B., Han, D., Choe, J., Chun, S.: Re-labeling imagenet: from single to multi-labels, from global to localized labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2340-2350 (2021) +32. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2921-2929 (2016) +33. Zhou, D., Chen, P., Wang, Q., Chen, G., Heng, P.A.: Acknowledging the unknown for multi-label learning with single positive labels. In: European Conference on Computer Vision. pp. 423-440. Springer (2022) +34. Zhou, T., Zhang, M., Zhao, F., Li, J.: Regional semantic contrast and aggregation for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4299-4309 (2022) \ No newline at end of file diff --git a/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/images.zip b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..4d0b9a2e344ebaa6118cba9046cd04d53448fc82 --- /dev/null +++ b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b0d8a5880bcb71231ae4c90e907a958d4ac58aed530f3a2a019c3e57bf292f90 +size 388078 diff --git a/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/layout.json b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..d8f9e1060c1549ddf157dc2325af476d9b06e3ab --- /dev/null +++ b/2024/IGNORE_ Information Gap-based False Negative Loss Rejection for Single Positive Multi-Label Learning/layout.json @@ -0,0 +1,8339 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 187, + 111, + 447, + 166 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 111, + 447, + 166 + ], + "spans": [ + { + "bbox": [ + 187, + 111, + 447, + 166 + ], + "type": "text", + "content": "IGNORE: Information Gap-based False Negative Loss Rejection Single Positive Multi-Label Learning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 145, + 186, + 468, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 186, + 468, + 199 + ], + "spans": [ + { + "bbox": [ + 145, + 186, + 468, + 199 + ], + "type": "text", + "content": "GyeongRyeol Song, Noo-ri Kim, Jin-Seop Lee, and Jee-Hyong Lee*" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 204, + 208, + 410, + 232 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 204, + 208, + 410, + 232 + ], + "spans": [ + { + "bbox": [ + 204, + 208, + 410, + 232 + ], + "type": "text", + "content": "Sungkyunkwan University, Suwon, South Korea {thd7524, pd99j, wlstjq0602, john}@skku.edu" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 258, + 455, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 258, + 455, + 534 + ], + "spans": [ + { + "bbox": [ + 160, + 258, + 455, + 534 + ], + "type": "text", + "content": "Abstract. Single Positive Multi-Label Learning (SPML) is a method for a scarcely annotated setting, in which each image is assigned only one positive label while the other labels remain unannotated. Most approaches for SPML assume unannotated labels as negatives (\"Assumed Negative\", AN). However, with this assumption, some positive labels are inevitably regarded as negative (false negative), resulting in model performance degradation. Therefore, identifying false negatives is the most important with AN assumption. Previous approaches identified false negative labels using the model outputs of assumed negative labels. However, models were trained with noisy negative labels, their outputs were not reliable. Therefore, it is necessary to consider effectively utilizing the most reliable information in SPML for identifying false negative labels. In this paper, we propose the Information Gap-based False Negative LOss REjection (IGNORE) method for SPML. We generate the masked image that all parts are removed except for the discriminative area of the single positive label. It is reasonable that when there is no information of an object in the masked image, the model's logit for that object is low. Based on this intuition, we identify the false negative labels if they have a significant model's logit gap between the masked image and the original image. Also, by rejecting false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on four datasets: Pascal VOC 2012, MS COCO, NUSWIDE, and CUB. Compared to previous state-of-the-art methods in SPML, our method outperforms them on most of the datasets." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "spans": [ + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "text", + "content": "Keywords: Multi-Label Learning " + }, + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "text", + "content": " Single Positive Multi-Label Learning " + }, + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "text", + "content": " Information Gap " + }, + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 544, + 453, + 566 + ], + "type": "text", + "content": " False Negative Rejection" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 586, + 230, + 598 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 586, + 230, + 598 + ], + "spans": [ + { + "bbox": [ + 132, + 586, + 230, + 598 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 611, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 611, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 611, + 482, + 647 + ], + "type": "text", + "content": "Multi-label learning is an approach that trains a model using images with multiple labels, aiming to build a model that is able to predict all relevant labels for the images with multiple labels. Unlike multi-class learning, where the model aims to" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 234, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 234, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 234, + 666 + ], + "type": "text", + "content": "* Corresponding author" + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 119, + 245, + 232 + ], + "blocks": [ + { + "bbox": [ + 136, + 119, + 245, + 232 + ], + "lines": [ + { + "bbox": [ + 136, + 119, + 245, + 232 + ], + "spans": [ + { + "bbox": [ + 136, + 119, + 245, + 232 + ], + "type": "image", + "image_path": "034e28894c18cad2fe922649c08d07ffcb1124e0d587209914bf74658ce3a6e4.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 247, + 482, + 346 + ], + "lines": [ + { + "bbox": [ + 130, + 247, + 482, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 247, + 482, + 346 + ], + "type": "text", + "content": "Fig. 1: Example of an image for Single Positive Multi-Label Learning (SPML) and our main idea for SPML. Ground truth is 1 if there is a corresponding object, otherwise 0. In SPML, only one positive label is given, and all the other labels are not given, i.e., unannotated. In Assumed Negative (AN) assumption, all unannotated labels are assumed to be negative. Here, false negative labels mean the unannotated positive labels, which are incorrectly assumed to be negative. To identify the false negative labels, we first extract the discriminative areas of the single positive label and generate the masked image. Then, we utilize the information gap between the original image and the masked image." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 246, + 118, + 380, + 232 + ], + "blocks": [ + { + "bbox": [ + 246, + 118, + 380, + 232 + ], + "lines": [ + { + "bbox": [ + 246, + 118, + 380, + 232 + ], + "spans": [ + { + "bbox": [ + 246, + 118, + 380, + 232 + ], + "type": "image", + "image_path": "99d881203f7f43047434d8efc057eecda92656e56710303c54223007c0ef6539.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 381, + 118, + 478, + 235 + ], + "blocks": [ + { + "bbox": [ + 381, + 118, + 478, + 235 + ], + "lines": [ + { + "bbox": [ + 381, + 118, + 478, + 235 + ], + "spans": [ + { + "bbox": [ + 381, + 118, + 478, + 235 + ], + "type": "image", + "image_path": "a6d3bdeea3a07784a45340baf1917d3cf21ecc7bb2399cdc9e40b3492ec358c0.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 373, + 482, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 373, + 482, + 470 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 482, + 470 + ], + "type": "text", + "content": "predict only a single label for the input image, multi-label learning is much more challenging because the model aims to predict multiple labels associated with the input image. Moreover, multi-label learning is more practical and realistic than multi-class learning, as the majority of real-world images contain multiple objects [2,3,17,20,22,31]. To achieve effective multi-label learning, similar to other supervised learning tasks, a fully labeled dataset is required. However, real-world images typically contain tens to thousands of different classes, and fully annotating all of them is extremely labor-intensive and practically unfeasible." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 472, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 616 + ], + "type": "text", + "content": "To reduce labor-intensive costs, researches on Single Positive Multi-Label Learning (SPML) have been increasing recently [5,12,13,26,29,33]. As shown in Fig. 1, in SPML, only one positive label is given and the others are unannotated for each images. To deal with unannotated labels in SPML, most approaches [12,13,26,29] assumed unannotated labels as negative (Assumed Negative, AN). This assumption has the advantage of providing supervision for all unannotated labels. Also, this assumption is reasonable because most multi-label datasets are dominated by negatives. However, by assuming all unannotated labels as negatives, it inevitably provides incorrect supervision for actually positive labels among the unannotated ones. In other words, these labels are false negative labels. These false negative labels can consistently cause confusion during model training, and impair the model's generalization ability." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Therefore, most studies [5,12,13,26,29] are focusing on identifying false negatives in SPML. They usually identify false negatives by utilizing model output's confidence or losses. In more detail, they identify the labels with abnormally high values of the model's outputs [26, 29] or losses [12, 13] as false negative labels." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 117, + 478, + 272 + ], + "blocks": [ + { + "bbox": [ + 136, + 117, + 478, + 272 + ], + "lines": [ + { + "bbox": [ + 136, + 117, + 478, + 272 + ], + "spans": [ + { + "bbox": [ + 136, + 117, + 478, + 272 + ], + "type": "image", + "image_path": "9419fe6d63fb140200cc934a1b48e32f7c2d8e52d46f376bee5461df52277036.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 284, + 482, + 327 + ], + "lines": [ + { + "bbox": [ + 130, + 284, + 482, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 482, + 327 + ], + "type": "text", + "content": "Fig. 2: Overview of the proposed method. In our method, we generate a masked image through the single positive label. Then, we utilize the logit gap between the masked image and the original image to identify false negatives and reject them in training " + }, + { + "bbox": [ + 130, + 284, + 482, + 327 + ], + "type": "inline_equation", + "content": "(\\mathcal{L}_{\\text{IGNORE}})" + }, + { + "bbox": [ + 130, + 284, + 482, + 327 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 351, + 479, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 351, + 479, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 351, + 479, + 399 + ], + "type": "text", + "content": "Because it implies that unannotated labels could be positive labels. However, the confidence or losses for the false negative labels are not reliable because models could learn them with noisy labels. To address this issue, it is necessary to consider robust criterion that are insensitive to noisy labels." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 400, + 482, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 400, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 400, + 482, + 542 + ], + "type": "text", + "content": "Since the single positive labels are the most reliable information in SPML, the model's output for the single positive label is reliable. Therefore, we can capture the discriminative areas [11, 15, 28, 32, 34] of objects and generate a masked image that includes only the discriminative areas of the single positive label (see Fig. 1). The masked image contains only the information corresponding to the single positive label. On the other hand, the original image contains information corresponding to ground truth labels. It is reasonable that when there is no information of an object in the image, the model's output for that object is low. Therefore, for false negatives, the model's output for the original image is expected to be higher than the model's output for the masked image. By utilizing the model's output gap resulting from the information gap between the images, false positive labels would be effectively identified." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 544, + 482, + 627 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 627 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 627 + ], + "type": "text", + "content": "In this paper, we propose the Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. By rejecting the false negatives in the model training, we can prevent the model from being biased to false negative labels, and build more reliable models. We evaluate our method on various benchmark datasets such as PASCAL VOC 2012 [9], MS COCO [16], NUSWISE [4], and CUB [27]. Our method also outperforms most of the state-of-the-art methods in SPML." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 243, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 243, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 243, + 127 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 154, + 482, + 370 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 154, + 482, + 370 + ], + "spans": [ + { + "bbox": [ + 130, + 154, + 482, + 370 + ], + "type": "text", + "content": "Problems with AN loss. In SPML, Assume Negative (AN) is the main approach that provides supervision to unannotated labels. Since multi-label datasets are dominated by negatives [21], assuming unannotated labels as negatives can be a reasonable and straightforward approach in situations where most of the label information is unknown. Also, Binary Cross-Entropy (BCE) loss in AN is referred to as AN loss. With AN loss, losses of all unannotated labels are calculated through the negative term of BCE. Thus, the model erroneously learns the unannotated positive labels (false negative labels) as negative labels. This confusion in multi-label learning results in bias to false negative labels and model performance drop. There are researches that point out issues caused by false negative label learning with AN loss [13,33]. In training with AN loss, BoostLU [13] observed that the attribution score of Class-Activation Map (CAM) is damaged due to false negative labels. To address this issue, they proposed an activation function that can boost the damaged CAM. EM [33] pointed out the issue that AN loss incurs the high loss gradient propagation problem for false negative labels. They proposed an entropy maximization loss that suppresses the gradient for unannotated labels with high prediction, without assuming unannotated labels as negatives." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 370, + 482, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 370, + 482, + 418 + ], + "spans": [ + { + "bbox": [ + 130, + 370, + 482, + 418 + ], + "type": "text", + "content": "In summary, learning false negative labels causes confusion in model training by continuously propagating the incorrect information to the model and affects the model's output. Therefore, it is necessary to consider the false negative labels when utilizing AN loss in SPML." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 437, + 482, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 545 + ], + "type": "text", + "content": "Approaches and Challenges for False Negatives. There are approaches that reject the identified false negative labels or regard them as positive labels. PLC [29] adopted a model prediction-based pseudo-labeling method. While training with AN loss, they generated pseudo-labels for unannotated labels using a fixed threshold. Using these pseudo-labels, They trained the model with unannotated labels once again. SCL [26] identified labels as false negatives with significantly high values of model predictions, and other methods [12, 13] used losses to identify false negatives. These methods proposed utilizing identified false negatives as positives in training or rejecting them from training." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 545, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 617 + ], + "type": "text", + "content": "In multi-label learning, usually the number of negatives overwhelms the number of positives in each sample. Therefore, it is challenging to identify as many false negatives as desired with high precision. Additionally, if the model incorrectly learns actual negative labels as positive, it can lead to significant bias in the model for those labels. As a result, generally rejecting the identified false negatives from training showed better performance." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Despite consideration of false negatives, however, because these methods are based on the AN loss, the model is easy to learn incorrect label information. The model learns assumed negative labels with incorrect label information, the distinct model outputs associated with false negative labels (e.g., high loss or high" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": "probability) gradually become more similar to those of true negatives. That is, it becomes more challenging to identify false negatives from true negative labels using the information from assumed negative labels. Therefore, it is necessary to identify false negatives through new criterion rather than relying on the information from assumed negative labels." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 195, + 261, + 209 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 195, + 261, + 209 + ], + "spans": [ + { + "bbox": [ + 132, + 195, + 261, + 209 + ], + "type": "text", + "content": "3 Proposed Method" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 220, + 479, + 268 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 220, + 479, + 268 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 479, + 268 + ], + "type": "text", + "content": "In this section, we propose the method of identifying and rejecting false negatives based on the information gap between the masked image and the original image. Firstly, we introduce the preliminary in Sec. 3.1. Then, we explain the proposed method in the following sections." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 286, + 220, + 298 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 286, + 220, + 298 + ], + "spans": [ + { + "bbox": [ + 132, + 286, + 220, + 298 + ], + "type": "text", + "content": "3.1 Preliminary" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": "For single positive multi-label learning tasks, a dataset " + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "inline_equation", + "content": "\\mathcal{D} = \\{\\mathbf{x}_n,\\mathbf{y}_n\\}_{n = 1}^N" + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": " is given, where " + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_n" + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": " is an image and " + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "inline_equation", + "content": "\\mathbf{y}_n\\in \\mathcal{V} = \\{u,1\\} ^C" + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": " is the vector of labels. " + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": " is the number of images, and " + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": " is the number of classes. The " + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "inline_equation", + "content": "\\mathbf{y}_n" + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": " consists of a single positive label and unknown labels. Except for the single positive, the others are unannotated labels. The single positive label is indicated by 1 and unannotated labels are indicated by " + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 130, + 308, + 480, + 378 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 380, + 479, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 380, + 479, + 403 + ], + "spans": [ + { + "bbox": [ + 131, + 380, + 479, + 403 + ], + "type": "text", + "content": "In SPML, most approaches assumed unannotated labels as negative, and trained models using AN (Assume Negative) loss as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 219, + 415, + 480, + 462 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 415, + 480, + 462 + ], + "spans": [ + { + "bbox": [ + 219, + 415, + 480, + 462 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} _ {A N} = - \\frac {1}{B C} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} [ \\mathbb {I} [ y _ {i j} = 1 ] \\cdot \\log (p _ {i j}) \\tag {1} \\\\ + \\mathbb {I} [ y _ {i j} = u ] \\cdot \\log (1 - p _ {i j}) ] \\\\ \\end{array}", + "image_path": "8a8f2721974f4528067cd0a3bbab58f0e4db294083f0d461241db7453fc8371d.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "y_{ij}" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": " is the label of the " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": "-th class for the " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": "-th image, and " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "p_{ij}" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": " is the model's prediction for " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "y_{ij}" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "B" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": " is the batch size, " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": " is the number of classes, and " + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "inline_equation", + "content": "\\mathbb{I}" + }, + { + "bbox": [ + 130, + 472, + 480, + 567 + ], + "type": "text", + "content": " is the indicator function that returns 1 if the condition is true and 0 otherwise. Since the AN loss is useful to give supervision to unannotated labels, our approach also based on the AN loss. However, the AN loss inevitably provides incorrect supervision for actually positive labels among the unannotated ones. Therefore, it is necessary to consider that effectively utilizing the most reliable information in SPML to minimize false negative problems." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 585, + 315, + 597 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 585, + 315, + 597 + ], + "spans": [ + { + "bbox": [ + 131, + 585, + 315, + 597 + ], + "type": "text", + "content": "3.2 Overview of Proposed Method" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 479, + 665 + ], + "type": "text", + "content": "In this paper, we propose our Information Gap-based false Negative LOss REjection (IGNORE) method for SPML. The method for identifying false negative labels based on the information gap proceeds through the following steps. Firstly, we generate the masked image that all parts are removed except the discriminative area of the single positive label (see Fig. 2). Then, we compare" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "the model's logit gap between the masked image and the original image. If there is an object in the masked-out areas of the masked image, there is likely to be a substantial gap in the model's logit between the masked image and the original image. Because the object is absent in the masked image, in contrast to the original image. Based on this intuition, we identified the false negative labels if they have a significant model's output gap between the two images. The details of UNUSED's components are discussed in Sec. 3.3. As shown in Fig. 2, after identifying the false negative labels, we reject the losses of the corresponding negative labels to prevent the model from learning incorrect label information." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 239, + 390, + 251 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 239, + 390, + 251 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 390, + 251 + ], + "type": "text", + "content": "3.3 Components of False Negative Loss Rejection" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 258, + 480, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 258, + 480, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 480, + 307 + ], + "type": "text", + "content": "In this section, we first introduce the process of generating the masked images that provide information to identify false negatives in our proposed method. And then, we introduce the logit gap threshold and the logit average threshold that compose our information gap-based false negative loss rejection, UNUSED." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 321, + 482, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 321, + 482, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 321, + 482, + 450 + ], + "type": "text", + "content": "Generation of Masked Image. We identify and reject the false negative labels based on the information gap between the masked image and the original image. In this section, we discuss the method of generating the masked images through the single positive labels. It is well-known that the class-activation map (CAM) [23, 32] focuses on the discriminative areas of objects [11, 15, 28, 34]. Furthermore, BoostLU [13] reported that the model trained with AN loss can extract reliable CAM compared to the CAM extracted by a model trained with fully-labeled dataset. Therefore, we extract the CAM for the single positive labels from the original image " + }, + { + "bbox": [ + 130, + 321, + 482, + 450 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 321, + 482, + 450 + ], + "type": "text", + "content": ". The detailed explanation for extracting the CAM is in the supplementary material. Based on the CAM, we generate the mask as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 258, + 450, + 480, + 480 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 450, + 480, + 480 + ], + "spans": [ + { + "bbox": [ + 258, + 450, + 480, + 480 + ], + "type": "interline_equation", + "content": "M _ {i j} = \\left\\{ \\begin{array}{l l} 1 & \\text {i f} A _ {i j} > \\gamma \\\\ 0 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {2}", + "image_path": "39d9d216c170042c4b2b34c6b92dece080ec5a74ca437f8abf40311b3aa90a27.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "inline_equation", + "content": "A" + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "text", + "content": " indicate the CAM and the mask, respectively. Also, " + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "text", + "content": " is a CAM threshold to capture discriminative area for the positive label. By multiplying this mask with the original image " + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "text", + "content": " element-wise, we can generate a masked image " + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\mathbf{x}^M" + }, + { + "bbox": [ + 130, + 483, + 482, + 544 + ], + "type": "text", + "content": " where the areas only related to single positive labels are preserved, and the rest of the image is masked out as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 278, + 551, + 480, + 563 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 551, + 480, + 563 + ], + "spans": [ + { + "bbox": [ + 278, + 551, + 480, + 563 + ], + "type": "interline_equation", + "content": "\\mathbf {x} ^ {M} = \\mathbf {x} \\odot M \\tag {3}", + "image_path": "88e716191f0e1469d480b92b9ec174a49ade0ae5868f06858064ddf68cfb39bf.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 570, + 480, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 480, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 480, + 594 + ], + "type": "text", + "content": "The masked image is used to establish the Logit Gap Threshold for identifying the false negative labels." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "text", + "content": "Logit Gap Threshold. We design the criterion for identifying the false negative labels based on the logit gap between the masked image " + }, + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\mathbf{x}^M" + }, + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "text", + "content": " and the original image " + }, + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "text", + "content": ". The logit gap " + }, + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 130, + 609, + 482, + 647 + ], + "type": "text", + "content": " is defined as follows:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 240, + 653, + 480, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 240, + 653, + 480, + 667 + ], + "spans": [ + { + "bbox": [ + 240, + 653, + 480, + 667 + ], + "type": "interline_equation", + "content": "G _ {i j} = \\left| h \\left(f \\left(\\mathbf {x} _ {i}\\right)\\right) _ {j} - h \\left(f \\left(\\mathbf {x} _ {i} ^ {M}\\right)\\right) _ {j} \\right| \\tag {4}", + "image_path": "8502e67914620bb75d2b5866fb62f899e93f87b152d48ebf74183d1ceb9128e8.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": " denotes image encoder and classification head, respectively. We define the logit for the image as " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "h(f(\\mathbf{x}))" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": ", and the logit for the " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "-th class of the " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "-th image as " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "h(f(\\mathbf{x}_i))_j" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": ". Among the assumed negative labels, the labels with a high " + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": " are more likely to be false negatives." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "text", + "content": "As shown in Fig. 2, in the masked image, the object of the single positive label retains some of its information, but any information of the other objects is completely eliminated in the masked image. The value of " + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "text", + "content": " for the other objects in the image will be larger than the value of " + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "text", + "content": " for the single positive label. Based on this observation, we set the threshold " + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "text", + "content": " using the average " + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "text", + "content": " value of the single positive labels. The " + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 164, + 480, + 236 + ], + "type": "text", + "content": " is defined as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 187, + 247, + 480, + 279 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 247, + 480, + 279 + ], + "spans": [ + { + "bbox": [ + 187, + 247, + 480, + 279 + ], + "type": "interline_equation", + "content": "\\tau^ {t} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} t = 0 \\\\ \\lambda \\tau^ {t - 1} + (1 - \\lambda) \\frac {\\sum_ {j = 1} ^ {C} \\sum_ {i = 1} ^ {B} I \\left[ y _ {i j} = 1 \\right] G _ {i j}}{B} & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {5}", + "image_path": "4cadbab8562bc2eb079a789ef7f9dcad7d599f1e6c7a478b331f12bc1e8b324b.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "inline_equation", + "content": "B" + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "text", + "content": " denotes the batch size. The gap threshold " + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "text", + "content": " is adaptively updated at each iteration " + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "text", + "content": " using Exponential Moving Average (EMA). " + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 283, + 479, + 319 + ], + "type": "text", + "content": " is a hyperparameter that determines the momentum decay of the EMA." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 338, + 480, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 480, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 480, + 434 + ], + "type": "text", + "content": "Logit Average Threshold. In this section, we introduce logit average threshold. We identify the false negatives that are actually present in the original image with the logit gap resulting from the information gap between the images. Therefore, even if a large logit gap occurs for labels that are not actually present in the original image, we do not need to identify these labels as false negatives labels with low logit values in the original image are likely to be true negatives that did not originally exist in the original image. To prevent these rejection of true negatives in our rejection method, we propose the logit average threshold." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "text", + "content": "It is evident that the logits of true negative labels are relatively low. Therefore, we only consider the rejection of the labels with a logit higher than the average of the logits for each class. We set the threshold " + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "text", + "content": " as the average logit of assumed negative labels for each class. We select the labels with logits higher than the threshold " + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "text", + "content": ". Through this process, we only reject the selected labels. Additionally, " + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "text", + "content": " is self-adaptively updated using Exponential Moving Average (EMA) at each iteration. The threshold " + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "inline_equation", + "content": "\\mu_j^t" + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "text", + "content": " for the j-th class at time step " + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 434, + 480, + 529 + ], + "type": "text", + "content": " is as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 166, + 537, + 480, + 570 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 537, + 480, + 570 + ], + "spans": [ + { + "bbox": [ + 166, + 537, + 480, + 570 + ], + "type": "interline_equation", + "content": "\\mu_ {j} ^ {t} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} t = 0 \\\\ \\lambda \\mu_ {j} ^ {t - 1} + (1 - \\lambda) \\frac {1}{N _ {j}} \\sum_ {i = 1} ^ {N _ {j}} \\mathbb {I} [ y _ {i j} = u ] \\cdot h (f (\\mathbf {x} _ {i})) _ {j} & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {6}", + "image_path": "ee64b1e7a5adf7e70125cbfc3d48556743309f1402c5018942f12471b52fbe7d.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 578, + 460, + 590 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 578, + 460, + 590 + ], + "spans": [ + { + "bbox": [ + 131, + 578, + 460, + 590 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 578, + 460, + 590 + ], + "type": "inline_equation", + "content": "N_{j}" + }, + { + "bbox": [ + 131, + 578, + 460, + 590 + ], + "type": "text", + "content": " denotes the number of assumed negative labels for the j-th class." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 609, + 383, + 620 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 609, + 383, + 620 + ], + "spans": [ + { + "bbox": [ + 131, + 609, + 383, + 620 + ], + "type": "text", + "content": "3.4 Training with False Negative Loss Rejection" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "text", + "content": "Information Gap-based False Negative Loss Rejection. In this section, we describe our rejection function that incorporates both the logit average threshold and the logit gap threshold. The rejection function " + }, + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "text", + "content": " incorporating the logit" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 425, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 425, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 425, + 128 + ], + "type": "text", + "content": "average threshold and the logit gap threshold is defined as follows:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 213, + 134, + 481, + 166 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 213, + 134, + 481, + 166 + ], + "spans": [ + { + "bbox": [ + 213, + 134, + 481, + 166 + ], + "type": "interline_equation", + "content": "R _ {i j} = \\left\\{ \\begin{array}{l l} 0 & \\text {i f} h \\left(f \\left(\\mathbf {x} _ {i}\\right)\\right) _ {j} > \\mu_ {j} ^ {t} \\text {a n d} G _ {i j} > \\tau^ {t} \\\\ 1 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {7}", + "image_path": "3cf20b29357d53ae8d2bd4eddcef8ce57d106d6cd699e27b160a90d33819f84c.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "spans": [ + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "text", + "content": "The rejection function " + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "text", + "content": " rejects the labels with " + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "text", + "content": " higher than the " + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "text", + "content": " and a logit higher than " + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 171, + 479, + 218 + ], + "type": "text", + "content": ". In other words, it identifies the labels with high logit values for the original image and a significant logit gap between the two images, then rejects them from the training." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 219, + 480, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 219, + 480, + 255 + ], + "spans": [ + { + "bbox": [ + 130, + 219, + 480, + 255 + ], + "type": "text", + "content": "By incorporating this function into the negative term of the AN loss, identified false negatives are rejected from the model training. Our IgnORE method that combined with AN loss and the rejection function " + }, + { + "bbox": [ + 130, + 219, + 480, + 255 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 130, + 219, + 480, + 255 + ], + "type": "text", + "content": " is as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 211, + 261, + 481, + 311 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 261, + 481, + 311 + ], + "spans": [ + { + "bbox": [ + 211, + 261, + 481, + 311 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} _ {\\text {I G N O R E}} = - \\frac {1}{S} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\left(\\mathbb {I} \\left[ y _ {i j} = 1 \\right] \\cdot \\log \\left(p _ {i j} ^ {s}\\right) \\right. \\tag {8} \\\\ + \\mathbb {I} [ y _ {i j} = u ] \\cdot R _ {i j} \\cdot \\log \\left(1 - p _ {i j} ^ {s}\\right)) \\\\ \\end{array}", + "image_path": "e4be1c919fc78a893c812d602a9a90963b9e2fd4db13bd76269a79e29d3e6941.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "text", + "content": " denotes the sum of the single positive labels and the labels that are not rejected negative labels. " + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "inline_equation", + "content": "p_{ij}^{s}" + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "text", + "content": " denotes " + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "inline_equation", + "content": "\\sigma (h(f(\\mathbf{x}_i^s)_j)" + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "text", + "content": " denotes sigmoid function. " + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "inline_equation", + "content": "\\mathbf{x}^s" + }, + { + "bbox": [ + 130, + 316, + 479, + 387 + ], + "type": "text", + "content": " denotes strong augmented image. It is well known that strong augmentation improves the generalization ability of deep learning models across most datasets [1, 6, 7, 24, 30]. Therefore, we utilize the strong augmented images to enhance model generalization." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 403, + 479, + 463 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 479, + 463 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 479, + 463 + ], + "type": "text", + "content": "Single Positive Binary Classification (SPBC). We utilize the CAM of the single positive labels. Therefore, it is necessary to train the model with correct supervision for the single positive labels. The model learns given single positive labels through binary classification for a single positive class. Single Positive Binary Classification (SPBC) is defined as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 219, + 470, + 481, + 503 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 470, + 481, + 503 + ], + "spans": [ + { + "bbox": [ + 219, + 470, + 481, + 503 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {S P B C} = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\mathbb {I} [ y _ {i j} = 1 ] \\cdot \\log (p _ {i j}) \\tag {9}", + "image_path": "c81435d74c418dcb4f139403b835f360f8d08f5ce7c6f4a52dec8d792032120f.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 517, + 482, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 517, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 517, + 482, + 625 + ], + "type": "text", + "content": "Consistency Regularization. Our method identifies the false negatives based on the model's logits. Therefore, our model needs to output consistent logits on similar images. To ensure such consistency, we take into account the consistency regularization between original images and strongly augmented images used in our framework. We propose the consistency regularization to the logits between original images and strongly augmented images, enabling the model to have consistency across differently augmented images. This ensures that the model produces consistent logits for different views of the same image. Our consistency regularization is defined as follows:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 210, + 635, + 481, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 635, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 210, + 635, + 481, + 667 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {r e g} = - \\frac {1}{B C} \\sum_ {i = 1} ^ {B} \\sum_ {j = 1} ^ {C} \\left| h \\left(f \\left(\\mathbf {x} _ {i}\\right) _ {j} - h \\left(f \\left(\\mathbf {x} _ {i} ^ {s}\\right)\\right) _ {j} \\right| ^ {2} \\right. \\tag {10}", + "image_path": "38e545010422bdcf2a063712203525eadc58f5a963811d46c1e552d2022cc150.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 326, + 127 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 326, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 326, + 127 + ], + "type": "text", + "content": "Overall loss. The overall loss is as follows:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 206, + 140, + 481, + 153 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 206, + 140, + 481, + 153 + ], + "spans": [ + { + "bbox": [ + 206, + 140, + 481, + 153 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\lambda_ {S P B C} \\cdot \\mathcal {L} _ {S P B C} + \\mathcal {L} _ {I G N O R E} + \\lambda_ {r e g} \\cdot \\mathcal {L} _ {r e g} \\tag {11}", + "image_path": "e04688b9d58f652b681ba1371cc822efa21daef68a17f6329961b216feef8970.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 158, + 480, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 158, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 158, + 480, + 182 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 158, + 480, + 182 + ], + "type": "inline_equation", + "content": "\\lambda_{SPBC}" + }, + { + "bbox": [ + 130, + 158, + 480, + 182 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 158, + 480, + 182 + ], + "type": "inline_equation", + "content": "\\lambda_{reg}" + }, + { + "bbox": [ + 130, + 158, + 480, + 182 + ], + "type": "text", + "content": " are hyperparameters that denote the weights assigned to the respective loss terms." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 201, + 230, + 215 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 201, + 230, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 201, + 230, + 215 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 226, + 479, + 275 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 479, + 275 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 479, + 275 + ], + "type": "text", + "content": "In this section, we present our experimental results and compare them with previous SPML approaches. Furthermore, we conduct an ablation study to analyze why our method is effective in SPML. We use mean average precision (mAP) as the comparison metric with previous approaches." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 292, + 261, + 304 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 292, + 261, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 292, + 261, + 304 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 312, + 480, + 419 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 312, + 480, + 419 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 480, + 419 + ], + "type": "text", + "content": "Datasets. We use four benchmark datasets to demonstrate our experimental results: PASCAL VOC 2012 [9], MS COCO 2014 [16], NUSWIDE [4], and CUB [27]. Following the settings of previous research [5], we create a single positive multi-label setting for the four benchmark datasets by randomly retaining one positive label and removing all other annotations. In particular, for the CUB dataset [27], we use bird attributes as target classes instead of bird categories, following the setup of ROLE [5]. For each dataset, we reserve " + }, + { + "bbox": [ + 130, + 312, + 480, + 419 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 312, + 480, + 419 + ], + "type": "text", + "content": " of the train set as a validation set, and select the best model based on its performance on the validation set." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 437, + 480, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 480, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 480, + 498 + ], + "type": "text", + "content": "Models. For a fair comparison with previous approaches [5,12,13,19,29,33], we conduct experiments with two models [10, 17]. One of the models is a ResNet-50 [10] that is pre-trained on ImageNet [8]. For ResNet-50, We employ the architecture of a convolutional layer followed by a 1x1 convolutional layer and global average pooling, the same as BoostLU [13]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 498, + 480, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 480, + 545 + ], + "type": "text", + "content": "The other one is a model with a transformer [25] architecture called Q2L [17]. For the image encoder of Q2L [17], we utilize the ResNet-50 [10] that is pretrained on ImageNet [8]. We explain the details on how to obtain CAMs for each model in Supplementary details." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": "Hyperparameter Settings. For Q2L, we set batch sizes in " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\{8, 16\\}" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": ", learning rates in " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\{1e-4, 1e-5\\}" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": ". We use AdamW [18] as optimizer and OneCycleLR as scheduler. For ResNet-50, we set batch sizes in " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\{8, 12, 16\\}" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": ", learning rates in " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\{1e-4, 1e-5\\}" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": ", and use Adam [14] as optimizer. Each image is resized to " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "448 \\times 448" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": ". Only random HorizontalFlip is used for original images, while random horizontal flip and RandAugmentation [7] are used for strong augmented images CAM threshold " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": " is set to 0.4 for ResNet-50 and 0.8 for Q2L, respectively. In Q2L, we set the CAM threshold to 0.8. And, we set loss weights " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\lambda_{reg}" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": " to 0.5, and " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\lambda_{SPBC}" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": " to 0.5 except COCO dataset. On COCO dataset, we set loss weights " + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\lambda_{reg}" + }, + { + "bbox": [ + 130, + 557, + 481, + 667 + ], + "type": "text", + "content": " to 0.1," + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 220, + 179, + 395, + 335 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 169 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 169 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 169 + ], + "type": "text", + "content": "Table 1: Experimental results of our method with Q2L model on four SPML benchmark datasets. Metric presented in the table is mAP (mean Average Precision). Additionally, bold font indicates the highest performance, while underlining indicates the second highest performance. Our method demonstrates the highest performance on most datasets." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 220, + 179, + 395, + 335 + ], + "lines": [ + { + "bbox": [ + 220, + 179, + 395, + 335 + ], + "spans": [ + { + "bbox": [ + 220, + 179, + 395, + 335 + ], + "type": "table", + "html": "
MethodDataset
VOCCOCONUSCUB
AN87.672.348.518.6
WAN [5]89.273.548.522.5
EPR [5]88.872.749.323.1
AN-LS [5]88.070.947.116.3
ROLE [5]88.169.644.514.2
EM [33]89.273.248.722.2
EM + APL [33]89.273.148.623.6
PLC + LAC [29]89.675.651.123.3
Ours90.176.352.823.4
", + "image_path": "9e7945ecb7c4e9d0db5886b7ca50b68c8db6d022415d0d6db7da0170efa6d614.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": "and " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\lambda_{SPBC}" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " to 0.5. In ResNet-50, we set the CAM threshold in " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\{0.4, 0.5\\}" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": ". And, we set the loss weights " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\lambda_{reg}" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " to 0.5, and " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\lambda_{SPBC}" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " to 0.1 except CUB dataset. On CUB dataset, we set loss weights " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\lambda_{reg}" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " to 0.5, and " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\lambda_{SPBC}" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " to 0.5. Considering that the updates for the threshold " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " might not be sufficient in the early stages of training, we set the warm-up phase. In warm-up phase, our model is trained with AN loss." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 452, + 270, + 464 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 452, + 270, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 452, + 270, + 464 + ], + "type": "text", + "content": "4.2 Experimental Results" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 475, + 481, + 547 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 475, + 481, + 547 + ], + "spans": [ + { + "bbox": [ + 130, + 475, + 481, + 547 + ], + "type": "text", + "content": "Performance with Q2L model. We compare our experimental results with recent approaches for the Q2L model on four datasets: Weak Assume Negative (WAN) [5], Expected Positive Regularization (EPR) [5], Assume Negative-Label Smoothing (AN-LS) [5], ROLE [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], and Pseudo-Labeling Consistency Regularization (PLC) with Label-Aware Global Consistency Regularization (LAC) [29]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 548, + 481, + 620 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 548, + 481, + 620 + ], + "spans": [ + { + "bbox": [ + 130, + 548, + 481, + 620 + ], + "type": "text", + "content": "As shown in Tab. 1, our method outperforms recent approaches on the VOC, COCO, and NUSWIDE datasets. In particular, on the NUSWIDE dataset, our method achieved an mAP of 1.7, higher than the previous best-performed approach. For CUB, our method do not achieve the best performance, but it shows the second-best results. The gap in performance with the best-performed approach is very small, so it can be considered comparable." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Performance with ResNet-50 model. For ResNet-50, we compare the experimental results with the following recent approaches: Label-Smoothing (LS) [19]," + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 216, + 157, + 399, + 335 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 147 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 147 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 147 + ], + "type": "text", + "content": "Table 2: Experimental results of our method with ResNet-50 model on four SPML benchmark datasets. Detailed ingredient of the table (metrics, bold, and underline) is the same as in Table 1." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 216, + 157, + 399, + 335 + ], + "lines": [ + { + "bbox": [ + 216, + 157, + 399, + 335 + ], + "spans": [ + { + "bbox": [ + 216, + 157, + 399, + 335 + ], + "type": "table", + "html": "
MethodDataset
VOCCOCONUSCUB
AN85.8964.9242.2718.31
LS [19]87.9067.1543.7716.26
ASL [21]87.7668.7846.9318.81
ROLE [5]87.7767.0441.6313.66
ROLE + LI [5]88.2669.1245.9814.86
EM [33]89.0970.7047.1520.85
EM + APL [33]89.1970.8747.5921.84
LL-R [12]88.2770.7048.7619.56
+ BoostLU [13]89.2972.8949.5919.80
Ours89.1972.0050.0821.90
", + "image_path": "a2b7798711dfa69e678d72942c95384009e9267941de022e984864e18280dc2a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 357, + 480, + 394 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 357, + 480, + 394 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 480, + 394 + ], + "type": "text", + "content": "Assymmetric loss (ASL) [21], ROLE [5], ROLE with LinearInit (LI) [5], Entropy-maximization (EM) with Asymmetric Pseudo-Labeling (APL) [33], Large Loss Rejection (LL-R) [12], and Large Loss Rejection (LL-R) [12] with BoostLU [13]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 395, + 480, + 455 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 395, + 480, + 455 + ], + "spans": [ + { + "bbox": [ + 132, + 395, + 480, + 455 + ], + "type": "text", + "content": "As shown in Tab. 2, our method exhibited the highest performances on the NUSWIDE and CUB dataset compared to recent approaches. On VOC and COCO, our method achieves the second-best performances. While not achieving the best performance on all datasets, We observe that our method with ResNet-50 performs well enough to be comparable to state-of-the-art approaches." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 475, + 244, + 487 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 475, + 244, + 487 + ], + "spans": [ + { + "bbox": [ + 133, + 475, + 244, + 487 + ], + "type": "text", + "content": "4.3 Ablation Studies" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 499, + 479, + 535 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 499, + 479, + 535 + ], + "spans": [ + { + "bbox": [ + 132, + 499, + 479, + 535 + ], + "type": "text", + "content": "We analyze the effectiveness of our framework components, analysis of logit gap, effectiveness of logit average threshold, comparison for false negative identification, and sensitivity analysis of CAM threshold." + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 168, + 578, + 442, + 640 + ], + "blocks": [ + { + "bbox": [ + 189, + 558, + 423, + 569 + ], + "lines": [ + { + "bbox": [ + 189, + 558, + 423, + 569 + ], + "spans": [ + { + "bbox": [ + 189, + 558, + 423, + 569 + ], + "type": "text", + "content": "Table 3: Ablation study of our method with Q2L model." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 168, + 578, + 442, + 640 + ], + "lines": [ + { + "bbox": [ + 168, + 578, + 442, + 640 + ], + "spans": [ + { + "bbox": [ + 168, + 578, + 442, + 640 + ], + "type": "table", + "html": "
Consistency Reg.IGNORE + SPBCw/ Logit Avg. ThresholdVOCCOCONUSWIDECUB
87.973.549.219.7
✓88.873.647.511.1
✓✓90.076.252.022.8
✓✓✓90.176.352.823.4
", + "image_path": "101e80407782cc044a98184a1d8a603a708edd039d6214aee0bc4ed32639d3da.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "content": "Analysis of Proposed Components. To demonstrate the effectiveness of the components in our framework, we conduct an ablation study using the PASCAL VOC, COCO, NUSWIDE and CUB datasets. In Tab. 3, the first row is the case where the model is trained with only AN loss. As shown in Tab. 3, when all components are included, the highest performance is achieved. The logit average threshold shows meaningful improvements in NUSWIDE and CUB. Considering that NUSWIDE and CUB have a relatively large number of classes, it is evident that the logit average threshold works more effectively in datasets with a larger number of classes. Also, when only consistency regularization is applied without ignore and SPBC, there was a significant performance drop in NUSWIDE and CUB. This observation indicates that simply applying consistency regularization alone does not significantly improve performance. In contrast, applying it with ignore and SPBC results in notable performance improvements. It means that our regularization is mutually effective when combined with our ignore method." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 151, + 309, + 289, + 407 + ], + "blocks": [ + { + "bbox": [ + 151, + 309, + 289, + 407 + ], + "lines": [ + { + "bbox": [ + 151, + 309, + 289, + 407 + ], + "spans": [ + { + "bbox": [ + 151, + 309, + 289, + 407 + ], + "type": "image", + "image_path": "71a6e1c337a11011772ffa5a07a20db3dfa441a90e80cedf6d7099a13fb6cf43.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 171, + 410, + 268, + 419 + ], + "lines": [ + { + "bbox": [ + 171, + 410, + 268, + 419 + ], + "spans": [ + { + "bbox": [ + 171, + 410, + 268, + 419 + ], + "type": "text", + "content": "(a) Logit Gap Distribution" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 319, + 309, + 468, + 407 + ], + "blocks": [ + { + "bbox": [ + 319, + 309, + 468, + 407 + ], + "lines": [ + { + "bbox": [ + 319, + 309, + 468, + 407 + ], + "spans": [ + { + "bbox": [ + 319, + 309, + 468, + 407 + ], + "type": "image", + "image_path": "ed426926680e5a1d640c5182c23a6a5d5ecacfa8aedbed77914fe2545ef12ea3.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 310, + 409, + 478, + 420 + ], + "lines": [ + { + "bbox": [ + 310, + 409, + 478, + 420 + ], + "spans": [ + { + "bbox": [ + 310, + 409, + 478, + 420 + ], + "type": "text", + "content": "(b) Ablation Study of Logit Average Threshold" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 439, + 482, + 473 + ], + "lines": [ + { + "bbox": [ + 130, + 439, + 482, + 473 + ], + "spans": [ + { + "bbox": [ + 130, + 439, + 482, + 473 + ], + "type": "text", + "content": "Fig. 3: Analysis of Logit Gap Threshold and Logit Average Threshold on PASCAL VOC 2012. SP, TN, and FN indicate the single positive, true negative, and false negative, respectively." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 506, + 482, + 627 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 482, + 627 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 482, + 627 + ], + "type": "text", + "content": "Analysis of Logit Gap. In this section, we examine whether there is a significant difference in the logit gap between true negatives and false negatives. Additionally, by observing the logit gap of single positives, we validate the effectiveness of the logit gap threshold. Figure 3a depicts the average logit gap per epoch observed during model training with our framework. As shown in Fig. 3a, there is a significant difference in the gap between false negatives and true negatives. Furthermore, it is observed that the gap for the single positives is lower than that of the false negatives. In other words, during model training with our framework, the logit gap is a suitable criterion for identifying false negatives, and the logit gap threshold works effectively." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Effectiveness of Logit Average Threshold. In the process of rejecting false negatives, to minimize incorrect rejections (rejections of true negatives), we pro-" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "posed the logit average threshold. To verify the effectiveness of the logit gap threshold, we examine in this section how the logit average threshold mitigates the rejection of true negatives. Figure 3b illustrates the rejection ratio starting from the end of the warm-up phase. The y-axis represents FN/TN ratio, where FN is the number of unannotated positives (False Negatives) rejected by our method, and TN is the number of true negatives rejected by our method. As shown in Fig. 3b, when logit average threshold is applied, FN/TN noticeably decreases. This indicates that our logit average threshold effectively mitigates the rejection of true negatives." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 136, + 239, + 302, + 304 + ], + "blocks": [ + { + "bbox": [ + 136, + 239, + 302, + 304 + ], + "lines": [ + { + "bbox": [ + 136, + 239, + 302, + 304 + ], + "spans": [ + { + "bbox": [ + 136, + 239, + 302, + 304 + ], + "type": "image", + "image_path": "95e8e17921f57296e0339b49576540d4fff55a41da61851c94955547df2a6300.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 141, + 317, + 296, + 381 + ], + "blocks": [ + { + "bbox": [ + 156, + 307, + 284, + 316 + ], + "lines": [ + { + "bbox": [ + 156, + 307, + 284, + 316 + ], + "spans": [ + { + "bbox": [ + 156, + 307, + 284, + 316 + ], + "type": "text", + "content": "(a) P&R Comparison with PLC [29]" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 141, + 317, + 296, + 381 + ], + "lines": [ + { + "bbox": [ + 141, + 317, + 296, + 381 + ], + "spans": [ + { + "bbox": [ + 141, + 317, + 296, + 381 + ], + "type": "image", + "image_path": "b81f31b313607b99d61c22bb631309ce64cf48352c6549674477e512a8f774e0.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 148, + 384, + 291, + 393 + ], + "lines": [ + { + "bbox": [ + 148, + 384, + 291, + 393 + ], + "spans": [ + { + "bbox": [ + 148, + 384, + 291, + 393 + ], + "type": "text", + "content": "(c) P&R Comparison with BoostLU [13]" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 403, + 482, + 448 + ], + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 448 + ], + "type": "text", + "content": "Fig. 4: Comparison with recent approaches. Experiments are conducted on PASCAL VOC 2012 dataset. Q2L model is used in comparison with PLC [29] and ResNet-50 is used in comparison with BoostLU [13]. BoostLU represents the case where BoostLU is applied to LL-R [12]. P and R represent precision and recall, respectively." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 314, + 239, + 472, + 304 + ], + "blocks": [ + { + "bbox": [ + 314, + 239, + 472, + 304 + ], + "lines": [ + { + "bbox": [ + 314, + 239, + 472, + 304 + ], + "spans": [ + { + "bbox": [ + 314, + 239, + 472, + 304 + ], + "type": "image", + "image_path": "5e84944b3f494820fcc61026d16f79536faab6c6baae9060509e44a6649c868c.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 320, + 317, + 468, + 381 + ], + "blocks": [ + { + "bbox": [ + 334, + 307, + 455, + 316 + ], + "lines": [ + { + "bbox": [ + 334, + 307, + 455, + 316 + ], + "spans": [ + { + "bbox": [ + 334, + 307, + 455, + 316 + ], + "type": "text", + "content": "(b) F1 Comparison with PLC [29]" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 320, + 317, + 468, + 381 + ], + "lines": [ + { + "bbox": [ + 320, + 317, + 468, + 381 + ], + "spans": [ + { + "bbox": [ + 320, + 317, + 468, + 381 + ], + "type": "image", + "image_path": "75907e121fc2077637978e6ee72d067c41084b15fd92c104aa623f9740836741.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 326, + 384, + 462, + 393 + ], + "lines": [ + { + "bbox": [ + 326, + 384, + 462, + 393 + ], + "spans": [ + { + "bbox": [ + 326, + 384, + 462, + 393 + ], + "type": "text", + "content": "(d) F1 Comparison with BoostLU [13]" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 474, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 481, + 510 + ], + "type": "text", + "content": "Comparison for False Negative Identification. We show our method's ability to identify false negatives through a comparison with recent approaches [13, 29]. We compare with PLC [29] and BoostLU [13], which include LL-R [12]." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "type": "text", + "content": "For PLC [29], precision is very high; however, as a trade-off, recall is very low (see Fig. 4a). Therefore, many false negative labels are not identified, and the model continuously learns these labels with incorrect label information. For BoostLU [13], as training progresses, recall becomes very high. Therefore, it could identify many false negative labels. However, due to the significant decrease of precision, a large number of true negative labels are also incorrectly identified as false negatives." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Compared to these methods, our approach does not exhibit a significant trade-off between precision and recall. Furthermore, as shown in Fig. 4b and 4d, F1 score of our approach exhibits a relatively high score and becomes increases, while the F1 scores of other methods become sharply decrease. This observation demonstrates that our method, based on logit gap threshold and logit average threshold, has an remarkable ability in identifying false negatives." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 90, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 115, + 291, + 198 + ], + "blocks": [ + { + "bbox": [ + 141, + 115, + 291, + 198 + ], + "lines": [ + { + "bbox": [ + 141, + 115, + 291, + 198 + ], + "spans": [ + { + "bbox": [ + 141, + 115, + 291, + 198 + ], + "type": "image", + "image_path": "9bcf2dc1d26fae4e68168cc88c9046e0be35c471b55f47025e9c9807566ba4a2.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 165, + 202, + 266, + 219 + ], + "lines": [ + { + "bbox": [ + 165, + 202, + 266, + 219 + ], + "spans": [ + { + "bbox": [ + 165, + 202, + 266, + 219 + ], + "type": "text", + "content": "(a) Comparison of mAP according to CAM threshold" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 318, + 116, + 493, + 198 + ], + "blocks": [ + { + "bbox": [ + 318, + 116, + 493, + 198 + ], + "lines": [ + { + "bbox": [ + 318, + 116, + 493, + 198 + ], + "spans": [ + { + "bbox": [ + 318, + 116, + 493, + 198 + ], + "type": "image", + "image_path": "0eb711c71d2c4e0cc08591b6a124a4c0741cd19258c3862587fe8e6668378fc0.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 336, + 202, + 460, + 219 + ], + "lines": [ + { + "bbox": [ + 336, + 202, + 460, + 219 + ], + "spans": [ + { + "bbox": [ + 336, + 202, + 460, + 219 + ], + "type": "text", + "content": "(b) Variation of the Gap threshold according to CAM threshold" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 190, + 228, + 422, + 240 + ], + "lines": [ + { + "bbox": [ + 190, + 228, + 422, + 240 + ], + "spans": [ + { + "bbox": [ + 190, + 228, + 422, + 240 + ], + "type": "text", + "content": "Fig. 5: Analysis of CAM Threshold and Gap Threshold." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 266, + 481, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 266, + 481, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 481, + 327 + ], + "type": "text", + "content": "Sensitivity Analysis of CAM Threshold. We analyze the sensitivity of the model performance according to changes in the CAM threshold. Fig. 5a shows that the model's performance is not sensitive to the CAM threshold. Also, Fig. 5b indicates that as the CAM threshold " + }, + { + "bbox": [ + 130, + 266, + 481, + 327 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 266, + 481, + 327 + ], + "type": "text", + "content": " increases, the logit gap threshold " + }, + { + "bbox": [ + 130, + 266, + 481, + 327 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 266, + 481, + 327 + ], + "type": "text", + "content": " also automatically increases." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 328, + 481, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 328, + 481, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 328, + 481, + 376 + ], + "type": "text", + "content": "With a higher CAM threshold, the region exceeding the threshold in the CAM area decreases, causing more areas of the image to be obscured in the masked image. Consequently, the information gap between the masked image and the original image for a single positive label becomes large." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 378, + 481, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 481, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 481, + 437 + ], + "type": "text", + "content": "Our gap threshold is the average logit gap between the original image and the masked image for a single positive label. Therefore, as the CAM threshold increases, the gap threshold automatically increases as well. In other words, the gap threshold we propose can adapt dynamically to changes in the hyperparameter CAM threshold." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 464, + 220, + 477 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 220, + 477 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 220, + 477 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "We proposed a new approach for identifying false negative labels in SPML. Our approach was based on the model's output gap resulting from the information gap between the images. With rejecting the false negative labels, we trained the models with minimizing bias to false negative labels. Through various experimental results, we demonstrated the superiority of our proposed for identifying false negative labels in assumed negative labels. Our approach showed performance improvements, and achieved state-of-the-art results in most datasets. Our proposed method generated the masked image with the CAM of the single positive label. Then, we identified false negatives with the information gap between the masked image and the original image. By rejecting identified false negatives, we prevented the model from being biased to false negative labels and built more reliable models. In future work, we would consider utilizing modules for more precise CAM extraction or leveraging the foundational model for generating the masked images." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": "Acknowledgements. This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00421, AI Graduate School Support Program), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (RS-2024-00352717), and institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.RS-2024-00437633, Development of Open-ended Alignment Fluxional AI for Ever-changing Environment and Value)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 234, + 197, + 246 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 234, + 197, + 246 + ], + "spans": [ + { + "bbox": [ + 133, + 234, + 197, + 246 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 262, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 138, + 262, + 479, + 296 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 262, + 479, + 296 + ], + "spans": [ + { + "bbox": [ + 138, + 262, + 479, + 296 + ], + "type": "text", + "content": "1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 297, + 480, + 318 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 297, + 480, + 318 + ], + "spans": [ + { + "bbox": [ + 138, + 297, + 480, + 318 + ], + "type": "text", + "content": "2. Beyer, L., Henaff, O.J., Kolesnikov, A., Zhai, X., Oord, A.v.d.: Are we done with imagenet? arXiv preprint arXiv:2006.07159 (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 319, + 480, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 319, + 480, + 352 + ], + "spans": [ + { + "bbox": [ + 138, + 319, + 480, + 352 + ], + "type": "text", + "content": "3. Chen, Z.M., Wei, X.S., Wang, P., Guo, Y.: Multi-label image recognition with graph convolutional networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5177-5186 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 353, + 480, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 353, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 138, + 353, + 480, + 385 + ], + "type": "text", + "content": "4. Chua, T.S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.: Nus-wide: a real-world web image database from national university ofSingapore. In: Proceedings of the ACM international conference on image and video retrieval. pp. 1-9 (2009)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 386, + 480, + 419 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 386, + 480, + 419 + ], + "spans": [ + { + "bbox": [ + 138, + 386, + 480, + 419 + ], + "type": "text", + "content": "5. Cole, E., Mac Aodha, O., Lorieul, T., Perona, P., Morris, D., Jojic, N.: Multi-label learning from single positive labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 933-942 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 420, + 480, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 420, + 480, + 441 + ], + "spans": [ + { + "bbox": [ + 138, + 420, + 480, + 441 + ], + "type": "text", + "content": "6. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.V.: Autoaugment: Learning augmentation policies from data. arXiv preprint arXiv:1805.09501 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 442, + 480, + 485 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 442, + 480, + 485 + ], + "spans": [ + { + "bbox": [ + 138, + 442, + 480, + 485 + ], + "type": "text", + "content": "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 487, + 480, + 520 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 487, + 480, + 520 + ], + "spans": [ + { + "bbox": [ + 138, + 487, + 480, + 520 + ], + "type": "text", + "content": "8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 521, + 480, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 521, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 138, + 521, + 480, + 553 + ], + "type": "text", + "content": "9. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes challenge: A retrospective. International journal of computer vision 111, 98-136 (2015)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 134, + 554, + 480, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 554, + 480, + 586 + ], + "spans": [ + { + "bbox": [ + 134, + 554, + 480, + 586 + ], + "type": "text", + "content": "10. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 587, + 480, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 587, + 480, + 631 + ], + "spans": [ + { + "bbox": [ + 133, + 587, + 480, + 631 + ], + "type": "text", + "content": "11. Jiang, P.T., Yang, Y., Hou, Q., Wei, Y.: L2g: A simple local-to-global knowledge transfer framework for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16886-16896 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 632, + 480, + 665 + ], + "type": "text", + "content": "12. Kim, Y., Kim, J.M., Akata, Z., Lee, J.: Large loss matters in weakly supervised multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14156-14165 (2022)" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "13. Kim, Y., Kim, J.M., Jeong, J., Schmid, C., Akata, Z., Lee, J.: Bridging the gap between model explanations in partially annotated multi-label classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3408-3417 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 160, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 160, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 160, + 481, + 182 + ], + "type": "text", + "content": "14. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "type": "text", + "content": "15. Lee, S., Lee, M., Lee, J., Shim, H.: Railroad is not a train: Saliency as pseudo-pixel supervision for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5495-5505 (June 2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 225, + 481, + 268 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 225, + 481, + 268 + ], + "spans": [ + { + "bbox": [ + 133, + 225, + 481, + 268 + ], + "type": "text", + "content": "16. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 268, + 481, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 268, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 133, + 268, + 481, + 289 + ], + "type": "text", + "content": "17. Liu, S., Zhang, L., Yang, X., Su, H., Zhu, J.: Query2label: A simple transformer way to multi-label classification. arXiv preprint arXiv:2107.10834 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 289, + 481, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 289, + 481, + 311 + ], + "spans": [ + { + "bbox": [ + 133, + 289, + 481, + 311 + ], + "type": "text", + "content": "18. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 311, + 481, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 311, + 481, + 342 + ], + "spans": [ + { + "bbox": [ + 133, + 311, + 481, + 342 + ], + "type": "text", + "content": "19. Lukasik, M., Bhojanapalli, S., Menon, A., Kumar, S.: Does label smoothing mitigate label noise? In: International Conference on Machine Learning. pp. 6448-6458. PMLR (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 342, + 481, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 342, + 481, + 385 + ], + "spans": [ + { + "bbox": [ + 133, + 342, + 481, + 385 + ], + "type": "text", + "content": "20. Rajeswar, S., Rodriguez, P., Singhal, S., Vazquez, D., Courville, A.: Multi-label iterated learning for image classification with label ambiguity. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4783-4793 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 385, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 385, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 133, + 385, + 481, + 418 + ], + "type": "text", + "content": "21. Ridnik, T., Ben-Baruch, E., Zamir, N., Noy, A., Friedman, I., Protter, M., Zelnik-Manor, L.: Asymmetric loss for multi-label classification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 82-91 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 418, + 481, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 418, + 481, + 450 + ], + "spans": [ + { + "bbox": [ + 133, + 418, + 481, + 450 + ], + "type": "text", + "content": "22. Ridnik, T., Sharir, G., Ben-Cohen, A., Ben-Baruch, E., Noy, A.: ML-decoder: Scalable and versatile classification head. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 32-41 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 450, + 481, + 493 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 450, + 481, + 493 + ], + "spans": [ + { + "bbox": [ + 133, + 450, + 481, + 493 + ], + "type": "text", + "content": "23. Selvaraju, R.R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., Batra, D.: Gradcam: Visual explanations from deep networks via gradient-based localization. In: Proceedings of the IEEE international conference on computer vision. pp. 618-626 (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 493, + 481, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 493, + 481, + 536 + ], + "spans": [ + { + "bbox": [ + 133, + 493, + 481, + 536 + ], + "type": "text", + "content": "24. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 536, + 481, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 536, + 481, + 568 + ], + "spans": [ + { + "bbox": [ + 133, + 536, + 481, + 568 + ], + "type": "text", + "content": "25. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 568, + 481, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 568, + 481, + 611 + ], + "spans": [ + { + "bbox": [ + 133, + 568, + 481, + 611 + ], + "type": "text", + "content": "26. Verelst, T., Rubenstein, P.K., Eichner, M., Tuytelaars, T., Berman, M.: Spatial consistency loss for training multi-label classifiers from single-label annotations. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3879-3889 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 611, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 611, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 133, + 611, + 481, + 632 + ], + "type": "text", + "content": "27. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "type": "text", + "content": "28. Wang, Y., Zhang, J., Kan, M., Shan, S., Chen, X.: Self-supervised equivariant attention mechanism for weakly supervised semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "G. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 326 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "29. Xie, M.K., Xiao, J., Huang, S.J.: Label-aware global consistency for multi-label learning with single positive labels. Advances in Neural Information Processing Systems 35, 18430-18441 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "type": "text", + "content": "30. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 182, + 482, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 482, + 226 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 482, + 226 + ], + "type": "text", + "content": "31. Yun, S., Oh, S.J., Heo, B., Han, D., Choe, J., Chun, S.: Re-labeling imagenet: from single to multi-labels, from global to localized labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2340-2350 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 226, + 482, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 259 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 259 + ], + "type": "text", + "content": "32. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2921-2929 (2016)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 259, + 482, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 259, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 259, + 482, + 293 + ], + "type": "text", + "content": "33. Zhou, D., Chen, P., Wang, Q., Chen, G., Heng, P.A.: Acknowledging the unknown for multi-label learning with single positive labels. In: European Conference on Computer Vision. pp. 423-440. Springer (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 293, + 482, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 326 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 326 + ], + "type": "text", + "content": "34. Zhou, T., Zhang, M., Zhao, F., Li, J.: Regional semantic contrast and aggregation for weakly supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4299-4309 (2022)" + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 407, + 91, + 447, + 100 + ], + "type": "text", + "content": "IGNORE" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_content_list.json b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..52a9cebcd8ac23aa3b605510ccf05ecc8a215392 --- /dev/null +++ b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_content_list.json @@ -0,0 +1,2404 @@ +[ + { + "type": "text", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "text_level": 1, + "bbox": [ + 217, + 140, + 785, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Amber Yijia Zheng Raymond A. Yeh", + "bbox": [ + 349, + 212, + 651, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Department of Computer Science, Purdue University {zheng709, rayyeh}@purdue.edu", + "bbox": [ + 323, + 239, + 676, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Advancements in open-sourced text-to-image models and fine-tuning methods have led to the increasing risk of malicious adaptation, i.e., fine-tuning to generate harmful/ unauthorized content. Recent works, e.g., Glaze or MIST, have developed data-poisoning techniques which protect the data against adaptation methods. In this work, we consider an alternative paradigm for protection. We propose to \"immunize\" the model by learning model parameters that are difficult for the adaptation methods when fine-tuning malicious content; in short IMMA. Specifically, IMMA should be applied before the release of the model weights to mitigate these risks. Empirical results show IMMA's effectiveness against malicious adaptations, including mimicking the artistic style and learning of inappropriate/unauthorized content, over three adaptation methods: LoRA, Textual-Inversion, and DreamBooth. The code is available at https://github.com/amberyzheng/IMMA.", + "bbox": [ + 261, + 303, + 743, + 498 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 521, + 375, + 537 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "With the open-source of large-scale text-to-image models [8, 38] the entry barrier to generating images has been drastically lowered. Building on top of these models, methods such as Textual Inversion [12], DreamBooth [39], and LoRA [20] allow quick adaptation to generate personalized content. These newly introduced capabilities come with great responsibility and trust in individuals to do good instead of harm to society. Unfortunately, the capabilities of adapting text-to-image generative models have already had negative impacts, e.g., the generation of sexual content [16], copying artists' work without consent [17, 32], duplicating celebrity images [30], etc. We broadly encapsulate all these harmful fine-tuning of models under the term malicious adaptation.", + "bbox": [ + 212, + 551, + 787, + 704 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "To countermeasure these adaptations, open-source models have users agree that they will not use the software for \"the purpose of harming others\" in their licenses [6] or implement safety checks that would censor inappropriate generated content [36]. Nonetheless, these approaches do not have real enforcing power. Users can trivially disregard the license and remove the safety filters [45].", + "bbox": [ + 212, + 704, + 787, + 780 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "To address these loopholes, recent data poisoning techniques have shown a promising path towards preventing malicious adaptations [27, 41, 44]. The main idea is to protect images by modifying them with imperceivable changes, e.g., adversarial noise, such that adaptation methods confuse the style and content of", + "bbox": [ + 212, + 780, + 787, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "the images and fail to generalize. A key shortcoming of these methods is that the burden of enforcement is on content creators. The artists need to apply these techniques before releasing their artwork. Contrarily, we present an alternative paradigm that places this burden on the releaser of open-source models.", + "bbox": [ + 212, + 146, + 787, + 205 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we propose to \"Immunize\" Models, i.e., make them more resilient, against Malicious Adaptation; in short IMMA. The goal of IMMA is to make adaptation more difficult for concepts that are deemed malicious while maintaining the models' adaptability for other concepts. At a high level, we propose an algorithm to learn model parameters that perform poorly when being adapted to malicious concepts, e.g., mimicry artistic style. In Fig. 1, we illustrate the effect of IMMA when mimicking Picasso's style; the model", + "bbox": [ + 212, + 207, + 488, + 433 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/f99c41e71bab2f28c8c2af6ab27bc584c4aa9ae5b9d2ca0013f22d8aa3b430d3.jpg", + "image_caption": [ + "Fig. 1: IMMA on artistic style mimicry. Higher 1 - LPIPS indicates more similar to the reference images. IMMA successfully prevented the mimicking of the artistic style." + ], + "image_footnote": [], + "bbox": [ + 496, + 210, + 781, + 356 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To demonstrate the effectiveness of IMMA, we consider three adaptation methods, namely, Textual Inversion [12], DreamBooth [39], and LORA [20]. We experimented with immunizing against several malicious settings, including, mimicking artistic styles, restoring erased concepts, and learning personalized concepts. Overall, IMMA successfully makes text-to-image models more resilient against adaptation to malicious concepts while maintaining the usability of the model. Our contributions are as follows:", + "bbox": [ + 212, + 434, + 787, + 537 + ], + "page_idx": 1 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose a novel paradigm for preventing malicious adaptations. In contrast to the data poisoning for protection paradigm, we aim to protect the model instead of the data. See Fig. 2.", + "- We present an algorithm (IMMA) that learns difficult model initialization for the adaptation methods.", + "- We conduct extensive experiments evaluating IMMA against various malicious adaptations." + ], + "bbox": [ + 223, + 540, + 784, + 646 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 670, + 387, + 686 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Diffusion models. By learning to reverse a process of transforming data into noise, diffusion models achieve impressive generative capabilities [10, 19, 46]. With the aid of Internet-scale datasets [43], these models are capable of generating diverse images with high realism [7, 8, 31, 33, 35, 38, 40]. This progress led to new excitements in artificial intelligence generated content (AIGC) and interest in how to mitigate the associated risks, which we discuss next.", + "bbox": [ + 212, + 702, + 787, + 792 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Preventing generative AI misuse. There are many potential risks associated with the advancement in generative capabilities [4, 34]. Recent works have started to address these risks. For example, Wang et al. [49] study how to detect", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 446, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/5259b1ca8f85734bb3579469495ff09e9c411eff6d20506f0fcdf9c694237c2f.jpg", + "image_caption": [ + "Fig.2: Paradigms for preventing malicious adaptation. Data poisoning: modify training images $\\mathbf{x}'$ with imperceivable changes, such that $\\mathcal{A}$ fails to capture $\\mathbf{c}'$ by training with modified images. Model immunization (ours): modify pre-trained model weights $\\theta^p$ with immunization methods $\\mathcal{I}$ before adaptation $\\mathcal{A}$ , such that $\\mathcal{A}$ fails to capture $\\mathbf{c}'$ by training on immunized model weights $\\mathcal{I}(\\theta^p)$ ." + ], + "image_footnote": [], + "bbox": [ + 230, + 143, + 426, + 253 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/40ff95258068cbe3c6007ca3c1e6ed578f449fbc307f709fbcdf7326a8eda493.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 449, + 143, + 789, + 253 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "unauthorized images that are used in the training set of these models. Schramowski et al. [42] study how to suppress the generation of inappropriate content, e.g., nudity, self-harm, etc., during diffusion's generation process. Other works [13, 14, 18, 23, 51], take a further step in trying to remove these inappropriate content from the diffusion models.", + "bbox": [ + 212, + 344, + 787, + 417 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "More closely related to this work, GLAZE [44], MIST [26, 27], and EUDP [53] studied the misuse of artistic mimicry, i.e., preventing diffusion models from being used to copy artistic styles. Salman et al. [41] have also studied how to raise the cost of image manipulation using diffusion models. Notably, these works aim to protect the image, i.e., a form of data-poisoning [3, 29] which modifies the data, e.g., adding adversarial noise [15], such that the adaptation techniques fail. Different from these works, we protect the model, against misuse, i.e., model immunization. We illustrate the difference between our proposed model immunization vs. data poisoning in Fig. 2.", + "bbox": [ + 212, + 419, + 787, + 556 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Meta-learning. As our approach to model immunization is based on learning against an adaptation method, we briefly review meta-learning; also known as learning to learn. The area covers learning many aspects of a learning algorithm, e.g., learning good initialization suitable to adaptation [11], or other hyperparameters, e.g., learning rate, or weight decay, via hypergradient [2, 25, 28, 37, 50, 54, 55]. Various hypergradients approximations have been proposed, e.g., MAML [11] uses a single step gradient unrolling, with a summary provided by Lorraine et al. [28]. Different from these works, we aim to learn poor initializations for the adaptation methods to prevent the misuse of generative models.", + "bbox": [ + 212, + 556, + 789, + 693 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 715, + 382, + 732 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We briefly review the concepts necessary to understand our approach and introduce a common notation.", + "bbox": [ + 212, + 748, + 787, + 777 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Text-to-image diffusion models. The goal of a text-to-image diffusion model [38] is to learn a conditional distribution of images $\\mathbf{x}$ given concept embedding $\\mathbf{c}$ , i.e., modeling $p(\\mathbf{x}|\\mathbf{c};\\theta)$ , where $\\theta$ denotes the model parameters. The learning objective is formulated via variational lower bound [19, 21] or from a denoising", + "bbox": [ + 212, + 779, + 792, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 730, + 130 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "score-matching perspective [47, 48] which boils down to minimizing", + "bbox": [ + 215, + 146, + 702, + 162 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\nL (\\mathbf {x}, \\mathbf {c}; \\theta) = \\mathbb {E} _ {t, \\epsilon \\sim \\mathcal {N} (0, I)} \\left[ w _ {t} \\| \\epsilon_ {\\theta} (\\mathbf {x} _ {t}, \\mathbf {c}, t) - \\epsilon \\| _ {2} ^ {2} \\right], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 334, + 165, + 787, + 185 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\epsilon_{\\theta}$ denotes the denoising network, $\\mathbf{x}_t$ and $w_t$ denote the noised images and loss weights for a given time-step $t \\sim \\mathcal{U}\\{0, T\\}$ sampled from a discrete uniform distribution.", + "bbox": [ + 212, + 189, + 785, + 233 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Concept erasing methods. To erase a target concept $c'$ from a model, erasing algorithms [13, 23] fine-tunes a pre-trained model's parameters $\\theta^p$ such that the model no longer generate images corresponding to that concept, i.e.,", + "bbox": [ + 214, + 234, + 785, + 281 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\np \\left(\\tilde {\\boldsymbol {x}} \\mid \\mathbf {c} ^ {\\prime}; \\theta_ {- \\mathbf {c} ^ {\\prime}} ^ {p}\\right) \\approx 0, \\forall \\tilde {\\boldsymbol {x}} \\sim p \\left(\\mathbf {x} \\mid \\mathbf {c} ^ {\\prime}; \\theta^ {p}\\right), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 369, + 285, + 787, + 304 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\theta_{-\\mathbf{c}'}^p$ denotes the parameters of the erased model after fine-tuning. The main idea is to train the target concept to generate images of some other concept. A common choice is an empty token, i.e., the model performs unconditional generation when prompted with the target concept $c'$ .", + "bbox": [ + 212, + 308, + 785, + 369 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Personalization of text-to-image diffusion models. In contrast to erasing a concept, personalization algorithms aim to add a novel concept to the pre-trained model. Given a set of images $\\{\\mathbf{x}'\\}$ representative of the concept $\\mathbf{c}'$ . Personalization methods introduce a novel token $[V]$ in the word space and train the model to associate $[V]$ to the new concept. To learn this new concept, the model is trained using the data pair $(\\mathbf{x}', \\mathbf{c}')$ , where $\\mathbf{c}' \\triangleq \\Gamma([V])$ is extracted with the text encoder $\\Gamma$ using the novel word token $[V]$ . We broadly use the notation $L_{\\mathcal{A}}(\\mathbf{x}', \\mathbf{c'}; \\theta, \\phi)$ to denote the loss function of each adaptation method $\\mathcal{A}$ , where $\\phi$ denotes the parameters that are being fine-tuned. For example, DreamBooth [24, 39] finetunes on a subset of parameters, e.g., cross-attention layers, whereas Textual Inversion [12] only optimizes the new word token.", + "bbox": [ + 214, + 369, + 787, + 536 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Another common approach to make the fine-tuning more data efficient is to use Low-Rank Adaptation (LoRA) [20]. Given a pre-trained weight $\\theta^p \\in \\mathbb{R}^{n \\times d}$ , LoRA aims to learn an adaptor $\\Delta$ , such that the final weights become $\\hat{\\theta} = \\theta^p + \\Delta$ . LoRA specifically restricts the $\\Delta$ to be low-rank, i.e., $\\Delta = AB$ where $A \\in \\mathbb{R}^{n \\times r}$ and $B \\in \\mathbb{R}^{r \\times d}$ with $r \\ll \\min(n, d)$ . In this work, we show that LoRA can easily learn back the concepts that were previously erased which highlights the need for our proposed research direction of model immunization.", + "bbox": [ + 214, + 537, + 789, + 643 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4 Approach", + "text_level": 1, + "bbox": [ + 215, + 661, + 346, + 679 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Given a pre-trained text-to-image model with parameters $\\theta^p$ , e.g., StableDiffusion [38], existing adaptation methods $\\mathcal{A}$ [12, 20, 24, 39] can fine-tune $\\theta^p$ such that the model generates images of a concept $\\mathbf{c}'$ . Our goal is to prevent the adaptation methods from successfully doing so on harmful concepts, e.g., unauthorized artistic style. To accomplish this, we present an algorithm IMMA $\\mathcal{I}$ that takes pre-trained parameters $\\theta^p$ as input, and outputs the immunized parameters $\\theta^I$ . When applying adaptation $\\mathcal{A}$ with $\\theta^I$ , it should fail to learn the concept $\\mathbf{c}'$ , i.e., the model is \"immunized\" against adaptation. At a high level, IMMA aims to learn a poor model initialization when being fine-tuned by the adaptation methods. We now describe the algorithmic details.", + "bbox": [ + 214, + 688, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 446, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4.1 Model immunization", + "text_level": 1, + "bbox": [ + 215, + 146, + 433, + 160 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To achieve this goal of learning a poor initialization for adaptation, we propose the following bi-level program:", + "bbox": [ + 212, + 170, + 784, + 200 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\overbrace {\\max _ {\\theta \\in \\mathcal {S}} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {I}} ^ {\\prime} , \\mathbf {c} ^ {\\prime} ; \\theta , \\phi^ {\\star}\\right)} ^ {\\text {u p p e r - l e v e l t a k}} \\text {s . t .} \\phi^ {\\star} = \\overbrace {\\operatorname* {a r g m i n} _ {\\phi} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {\\prime} , \\mathbf {c} ^ {\\prime} ; \\theta , \\phi\\right)} ^ {\\text {l o w e r - l e v e l t a k}}. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 299, + 210, + 787, + 251 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Here, the set $\\mathcal{S}$ denotes a subset of $\\theta$ that is trained by IMMA. This set is a hyperparameter that we choose empirically. Given a dataset of images $\\mathcal{D} = \\{\\mathbf{x}'\\}$ representative of the concept $\\mathbf{c}'$ , we sample the training data $\\mathbf{x}_{\\mathcal{A}}'$ and $\\mathbf{x}_{\\mathcal{D}}'$ independently. As reviewed in Sec. 3, $\\phi$ denotes the parameters modified by the adaptation method $\\mathcal{A}$ . Note, $\\phi$ may include newly introduced parameters by $\\mathcal{A}$ or the parameters in the pre-trained model. We use the notation $\\mathcal{U}$ to be the set of overlapping parameters between $\\phi$ and $\\theta$ .", + "bbox": [ + 212, + 261, + 782, + 366 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Intuitively, the lower-level task simply performs the adaptation $\\mathcal{A}$ given the model initialization $\\theta$ by minimizing the loss function $L_{\\mathcal{A}}$ with respect to (w.r.t.) $\\phi$ . On the other hand, the upper-level task is maximizing the loss function of $\\mathcal{A}$ w.r.t. $\\theta$ . That is, the upper-level task aims for $\\theta$ that results in poor performance when the adaptation method $\\mathcal{A}$ is applied to the target concept $\\mathbf{c}'$ . The worse the performance is when adapted by $\\mathcal{A}$ , the more immunized a model is.", + "bbox": [ + 212, + 366, + 784, + 455 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To solve the program in Eq. (3), we use gradient-based methods to solve the upper-level optimization. This leads to the following update steps:", + "bbox": [ + 212, + 457, + 784, + 488 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\phi^ {\\star} \\leftarrow \\arg \\min _ {\\phi} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {\\prime}, \\mathbf {c} ^ {\\prime}; \\theta^ {i - 1}, \\phi\\right) \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 364, + 497, + 787, + 520 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\theta^ {i} \\leftarrow \\theta^ {i - 1} + \\alpha \\nabla_ {\\theta} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {I}} ^ {\\prime}, \\mathbf {c} ^ {\\prime}; \\theta^ {i - 1}, \\phi^ {\\star}\\right), \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 369, + 523, + 785, + 542 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Algorithm 1 IMMA (Our method)", + "text_level": 1, + "bbox": [ + 217, + 560, + 478, + 575 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Input: pre-trained model $\\theta^p$ , images $\\mathcal{D} = \\{\\mathbf{x}'\\}$ representative of the concept $\\mathbf{c}'$ , learning rate $\\alpha$ , IMMA-modified parameters set $\\mathcal{S}$ , adaptation loss $L_{A}$", + "bbox": [ + 217, + 580, + 504, + 635 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Output: Immunized model $\\theta^I$", + "bbox": [ + 217, + 636, + 424, + 648 + ], + "page_idx": 4 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1: Initialize $\\theta^0 = \\theta^p$", + "2: Initialize $\\phi^0$ based on $\\mathcal{A}$", + "3: for $i = 1$ to $I$ do", + "4: Sample batch $\\mathbf{x}_{\\mathcal{A}}^{\\prime}$ and $\\mathbf{x}_{\\mathcal{I}}^{\\prime}$ from $\\mathcal{D}$", + "5: $\\phi \\gets \\phi^{i - 1} \\# \\text{Initialize } \\phi \\text{ from the previous iteration}$", + "6: $\\phi^i\\gets \\arg \\min_{\\phi}L_{\\mathcal{A}}(\\mathbf{x}_{\\mathcal{A}}',\\mathbf{c}';\\theta^{i - 1},\\phi)$", + "7: $\\theta_{\\in \\mathcal{U}}^{i - 1}\\gets \\phi^i\\# Assign$ the overlaps between $\\theta$ and $\\phi$", + "8: $\\theta_{\\in S}^{i}\\gets \\theta_{\\in S}^{i - 1} + \\alpha \\nabla_{\\theta}L_{\\mathcal{A}}(\\mathbf{x}_{\\mathcal{I}}^{\\prime},\\mathbf{c}^{\\prime};\\theta^{i - 1},\\phi^{i})$", + "9: end for", + "10: return $\\theta^I$" + ], + "bbox": [ + 223, + 648, + 503, + 814 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\alpha$ denotes learning rate. We summarized the procedure in Alg. 1. Given the pre-trained model parameters $\\theta^p$ , the algorithm returns an immunized parameter $\\theta^I$ . We will next describe the subtle choices that were made regarding re-initialization and overlapping parameters during the optimization of $\\theta$ and $\\phi$ .", + "bbox": [ + 511, + 551, + 787, + 686 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Details on updating $\\phi$ and $\\theta$ . In Alg. 1 line 5, in theory, we should reinitialize $\\phi$ following the initialize scheme of $\\mathcal{A}$ , as the lower-level task is performing the adaptation. In practice, computing the lower-level task until convergence for each outer-loop iteration is prohibitively expensive. To reduce computation, we only solve the", + "bbox": [ + 511, + 686, + 787, + 824 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "lower-level task with a fixed number of update steps. However, this leads to", + "bbox": [ + 212, + 824, + 784, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "lower-level tasks being not very well trained due to the small number of updates on $\\phi$ . To address this, we initialize $\\phi$ from $\\phi^{i-1}$ , i.e., the result from the previous outer-loop iteration. Empirically, this leads to faster convergence of the lower-level tasks; we suspect that this is because $\\theta^i$ and $\\theta^{i-1}$ remain quite similar after one outer-loop update.", + "bbox": [ + 212, + 146, + 787, + 220 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The next subtle detail is when updating $\\theta$ in Alg. 1 line 7. Recall, that depending on the adaptation method, the pre-trained parameters $\\theta$ and adapted parameters $\\phi$ may overlap. In such a scenario, there are two ways to compute the upper-level task's gradient: (a) we assume that $\\theta^{i-1}$ and $\\phi^i$ are separate parameters, i.e., the result of $\\phi^i$ will not change $\\theta^{i-1}$ ; (b) we update the overlapping parameters in $\\mathcal{U}$ with the value from $\\phi^i$ , leading to line 7 in Alg. 1. Empirically, we found (b) to perform better. We conduct an ablation study for Alg. 1 lines 5 and 7 in Sec. 5.3, where we found both to improve immunization quality.", + "bbox": [ + 212, + 222, + 787, + 343 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Implementation details. To apply IMMA in practice, we approximate the solution of the lower-level task by taking a single gradient step for each of the adaptation methods. For the upper-level task, we use the Adam optimizer [22]. We choose $S$ in Eq. (3) to contain only the cross-attention layer, i.e., only these layers are being optimized. This choice follows the intuition that cross-attention layers are important as they mix the features of the target concept and image representation. Additional hyperparameters and experiment details are documented in the appendix.", + "bbox": [ + 212, + 345, + 787, + 467 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.2 Applications of model immunization", + "text_level": 1, + "bbox": [ + 215, + 492, + 560, + 508 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Immunizing concept erased models. Recent works [13, 23, 51], reviewed", + "bbox": [ + 212, + 523, + 785, + 537 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "in Sec. 3, have shown that they can erase concepts from diffusion models without retraining the model from scratch. After a target concept $\\mathbf{c}'$ is erased, the erased model $\\theta_{-\\mathbf{c}'}^p$ can no longer generate that object or style given the concept's text prompt. However, in our experiments, we show that the model can easily re-learn the target concept again in just a few training epochs by using LoRA [20]. In Fig. 3, we illustrate that the erased stable diffusion (ESD [13])", + "bbox": [ + 212, + 539, + 460, + 750 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/2bbe67807bfb4b1e5d3b7863404298a913a19d99eb84b95f7b57f8c35794ed15.jpg", + "image_caption": [ + "Fig. 3: IMMA's result against re-learning. pt of artists' style." + ], + "image_footnote": [], + "bbox": [ + 470, + 539, + 630, + 732 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/d5f3caeb49a23b5ef797f682cdcb29fa14df015ad91f666663dbc596e165dde2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 635, + 541, + 779, + 729 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This motivated us to immunize the concept erased model $\\theta_{-\\mathbf{c}'}^p$ to make the adaptation of re-learning $\\mathbf{c}'$ more difficult. Ideally, the immunized model is no longer able to generate images of the target concept, i.e.,", + "bbox": [ + 212, + 766, + 787, + 811 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\np (\\tilde {\\mathbf {x}} | \\mathbf {c} ^ {\\prime}; \\mathcal {A} [ \\mathcal {I} (\\boldsymbol {\\theta} _ {- \\mathbf {c} ^ {\\prime}} ^ {p}) ]) \\approx 0, \\forall \\tilde {\\mathbf {x}} \\sim p (\\mathbf {x} | \\mathbf {c} ^ {\\prime}; \\boldsymbol {\\theta} ^ {p}). \\qquad (6)\n$$\n", + "text_format": "latex", + "bbox": [ + 346, + 823, + 787, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 446, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Immunizing against personalization adaptation. Another potential for misuse is with personalization adaptation. Methods such as DreamBooth [39] or Textual Inversion [12] allow for a stable diffusion model to quickly learn to generate a personalized/unique concept given a few images of the unique concept. This motivated us to study immunization against these personalization adaptations. In practice, IMMA will be applied before a pre-trained model's release such that it fails to generate the unique concept even after adaptation.", + "bbox": [ + 212, + 157, + 787, + 265 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 214, + 286, + 375, + 304 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To evaluate IMMA, we conduct comprehensive experiments over multiple applications and adaptation methods.", + "bbox": [ + 212, + 316, + 789, + 348 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 Immunizing erased models against re-learning", + "text_level": 1, + "bbox": [ + 214, + 369, + 640, + 386 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Experiment setup. We employ LoRA as the adaptation method, and the pre-trained erased models are from ESD [13] using their publicly released code base. Following ESD, we consider experiments on eight artistic styles including both well-recognized and modern artists, and ten object classes from a subset of ImageNet [9]. For immunization, we use 20 images generated by Stable Diffusion (SD V1-4), prior to erasing, with the prompt of the target artistic style or object class. For adaptation, we generate different 20 images for each dataset and use LoRA to fine-tune the erased model for 20 epochs. For style, the prompt used in the evaluation is \"An artwork by {artist name}\" For object, the prompt used in evaluation is \"a {concept}\", for example, \"a parachute\". We also evaluate on re-learning Not-Safe-For-Work (NSFW) content where we followed I2P prompts proposed by Schramowski et al. [42].", + "bbox": [ + 212, + 393, + 787, + 575 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Evaluation metrics. To measure the effect of immunization against re-learning, we aim for a metric that measures the performance gap with and without IMMA, where the larger value indicates a stronger effect of IMMA, and vice versa. For this, we propose Similarity Gap Ratio (SGR). Let $\\mathbf{x}_{\\mathcal{I}}$ and $\\mathbf{x}_A$ denote the generated images with and without IMMA, and $\\mathbf{x}_r$ to be the reference images of the target concept then SGR is defined as follows:", + "bbox": [ + 212, + 575, + 789, + 667 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {S G R} \\left(\\mathbf {x} _ {\\mathcal {I}}, \\mathbf {x} _ {\\mathcal {A}}, \\mathbf {x} _ {r}\\right) = \\frac {\\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {A}}\\right) - \\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {I}}\\right)}{\\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {A}}\\right)}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 334, + 676, + 787, + 710 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathcal{M}$ is an image similarity metric. Common choices, following prior works [12, 13, 39], include Learned Perceptual Image Patch Similarity [52] (LPIPS), and similarity measured in the feature space of CLIP [12] or DINO [5] each denoted as SGR (L), SGR (C), and SGR (D). For consistency, we report one minus LPIPS, such that larger values for all three metrics mean higher image similarity.", + "bbox": [ + 212, + 718, + 787, + 795 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "User study. To check the quantitative metrics against human perception, we prepare four reference images and one pair of generated images (w/ and w/o IMMA) for the participants to select the generated image that is more similar to", + "bbox": [ + 212, + 795, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "the reference images in terms of content and quality.", + "bbox": [ + 215, + 146, + 594, + 161 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Results on style. In Tab. 1, we report SGR for re-learning artist styles for erased models. Over eight artists, we consistently observe a positive gap among all three SGR based on LPIPS, CLIP, and DINO with averages of $21.84\\%$ , $5.5\\%$ , and $23.35\\%$ .", + "bbox": [ + 212, + 176, + 488, + 282 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In Fig. 4, we directly show the LPIPS, CLIP, and DINO metrics at each epoch during the LoRA finetuning to visualize the gap. A lower value represents that the generated images are less similar to the reference images. Across all of the plots, we observe models without IMMA $\\uparrow$ (orange) are more similar to the reference images than models with IMMA $\\downarrow$ (blue). For artistic styles, the gap remains steady throughout the epochs. Overall, models with IMMA struggle to generate images containing the target concepts.", + "bbox": [ + 212, + 289, + 490, + 517 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In Fig. 3, we provide qualitative comparisons. We observe that LoRA successfully re-learned the target concept (third column). On the other hand, the model with IMMA (last column) either generates an image with lower quality or an unrelated image. Our user study also validates this observation. All of the 30 respondents selected generations without IMMA as the one with high similarity and quality across all compared samples. This shows that models with IMMA generate worse images of the target styles.", + "bbox": [ + 212, + 521, + 488, + 747 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Results on objects. As in artistic styles, we report SGR of re-learning target objects for the erased models in Tab. 2. The average SGR (L), SGR (C), and SGR (D) across ten classes are $21.84\\%$ , $11.41\\%$ , and $41.62\\%$ . We also", + "bbox": [ + 212, + 748, + 488, + 839 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/4203342fcf118cab30fed34fac50b13df75b4e3fe236f94d69c792421f3e4f8c.jpg", + "table_caption": [ + "Table 1: SGR $\\uparrow (\\%)$ on artistic styles for ESD with LoRA adaptation." + ], + "table_footnote": [], + "table_body": "
SGRVan GoghPablo PicassoTyler EdlinKelly McKernanKilian EngClaude MonetThomas KinkadeKirby Fagan
(L)17.6128.0828.6723.3426.7831.1418.4716.18
(C)4.774.565.879.344.597.279.441.18
(D)18.421.8126.0514.9925.7331.4839.5915.07
", + "bbox": [ + 500, + 207, + 784, + 253 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/1fb2838313990c043ddde319766fd4f172c13258316fafa8a4073ea62010f425.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 503, + 265, + 638, + 325 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/b0eb41385e14ced321c4f08e82756cd73414879d000fa86b6d4ffb0520cd6868.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 265, + 779, + 325 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/58494ce09c3c6a5d269b67dd65d7848933c0c36a847f862dc2832f063c6b2788.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 503, + 328, + 638, + 388 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/7858bfb59716c21bec63af284be45011b9aa2efecd1a1ba5f8458216564d3ead.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 328, + 779, + 388 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/078a520e807a8eddd2818aea14760bb666f7aeafceeba6433e4bc3932c28db52.jpg", + "image_caption": [ + "Fig. 4: Similarity vs. epochs for LoRA on styles. Models with IMMA achieve lower similarity throughout LoRA's epochs." + ], + "image_footnote": [], + "bbox": [ + 503, + 390, + 638, + 450 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/d4ab72431c0f47ab00bf69a6f817ef0fb9315352166b52f58f6b05adcf69ad30.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 390, + 777, + 450 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/300b9a461c90c56cc670dd976ead2db61495da82945ed301c40fa0f85d35d8eb.jpg", + "table_caption": [ + "Table 2: SGR ↑(%) on objects for ESD with LoRA adaptation." + ], + "table_footnote": [], + "table_body": "
SGRCass. playerGarbage truckGas pumpChain sawEn. springerGolf ballchurchFrench hornParachuteTrench
(L)11.667.4816.6427.3322.4241.9610.096.8850.9739.14
(C)3.665.1819.728.7215.0810.6712.518.1119.3411.07
(D)12.1620.031.3150.8668.8558.0914.3330.2568.5661.84
", + "bbox": [ + 500, + 553, + 782, + 601 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/fdbf8aff4a614b25dea595a0c45f596fe356c6b341fa1974e635622bc92d3160.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 503, + 611, + 638, + 672 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/c254d8fac75ab5ec054ccc4d279d6d3c35ec0193cda9ead1a352dad7624d12cb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 611, + 777, + 672 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/db1ac2764db1c95837b3ff550bce7b19e32de4efc72a0d39669d4ba3daed3722.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 503, + 674, + 638, + 733 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/3caf703fa086183bc1af640e07c1ff9d975dbdbfa015dc1f565659eb7a8d41a9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 674, + 777, + 733 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/f2b1312f102456f67760df31c2be1ccf770d84a8366bd01db4f0325bfe8cfffc.jpg", + "image_caption": [ + "Fig.5: Similarity vs. epochs for LoRA on objects. Models with IMMA achieve lower similarity throughout LoRA's epochs." + ], + "image_footnote": [], + "bbox": [ + 503, + 737, + 638, + 796 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/8c1604116a7a6133fcc9eb4b45065ca1e0437cfebf13d42ac1be338820d96b08.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 737, + 777, + 796 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 446, + 127 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/dcd0f57d4ac28cf0e8886b8b5ab9defd5d31a845e02a05150f5b38b1a6bbd53f.jpg", + "table_caption": [ + "Table 3: Acc. (\\%) of object erased models on 500 images. Col. 1: Original ESD model with the target concept erased. Col. 2: ESD without IMMA after LoRA. We observe that the target concept is successfully relearned. Col. 3: ESD with IMMA after LoRA. Col. 4 & 5: Acc. of other objects of ESD before and after IMMA." + ], + "table_footnote": [], + "table_body": "
Class name / MethodsAcc. of LoRA's target (↓)Acc. of others (↑)
ESDw/o IMMAw/ IMMAESDw/ IMMA
Cassette player0.22.00.272.046.4
Garbage truck3.040.87.663.825.5
Gas pump0.063.40.062.739.8
Chain saw0.015.20.879.352.5
EN springer0.415.60.867.249.6
Golf ball0.422.40.056.436.7
Church5.673.411.882.370.0
French horn0.280.20.464.957.6
Parachute2.091.00.078.858.9
Tench1.050.80.478.055.5
Average1.345.52.270.649.3
", + "bbox": [ + 282, + 212, + 715, + 402 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "visualize LPIPS, CLIP, and DINO in Fig. 5. Overall, we observe the same trend as in the result for artistic styles. Similarity metrics across all the plots drop for models with IMMA. That is, with the same number of fine-tuning epochs, generations from models with IMMA exhibit lower quality or are less related to the object.", + "bbox": [ + 212, + 438, + 787, + 515 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "As the target concept contains objects, we consider classification accuracy (ResNet50 pre-trained on ImageNet) for evaluation reported in Tab. 3. First, without IMMA, ESD can relearn to generate the object. With a mere three epochs of LoRA, the average accuracy of the target concept increased from $1.3\\%$ to $45.5\\%$ . On the other hand, ESD with IMMA, the average accuracy remains low at $2.2\\%$ , demonstrating the effectiveness of IMMA at preventing relearning.", + "bbox": [ + 212, + 518, + 787, + 609 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Thus far, the evaluation has focused on the target concept for IMMA models. We are also interested in how well IMMA preserves the other concepts. We define \"other concepts\" to be the remaining nine object categories beside the target object that is being adapted. In Tab. 3 (rightmost two columns), we observe that the original ESD has an average of $70.6\\%$ and after IMMA the accuracy", + "bbox": [ + 212, + 613, + 787, + 688 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "dropped to $49.3\\%$ . We fully acknowledge that this is a limitation of IMMA. Prevention against certain target concepts may degrade other concepts. IMMA roughly trades off $43\\%$ in the target concept with $20\\%$ in other concepts. Finally, qualitative comparisons are shown in Fig. 6, where we observe the same conclusion that IMMA is effective against re-learning.", + "bbox": [ + 212, + 689, + 488, + 839 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/1fe0eb63460460c35b79595b72ae7cffc33d124280365b257f8472d4d8b10b0d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 493, + 689, + 787, + 843 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/caec41ed7bbd26e7c38943c390b6fcd2e85c34e0951c96efa0c4e95a6c7b8ead.jpg", + "image_caption": [ + "Fig. 7: IMMA on NSFW content. We report the $\\%$ of change, relative to SD V1-4, in the number of detected nudity content after LoRA on the nudity-erased model." + ], + "image_footnote": [], + "bbox": [ + 287, + 143, + 700, + 280 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results on NSFW. For experiments on NSFW concepts, we use SD V1-4 to generate 4,703 unsafe images, among which 351 images contain 454 nudity counts based on NudeNet [1] with a threshold of 0.05. We randomly select two sets of 50 images containing nudity and their corresponding prompts for relearning adaptation and the other for IMMA. The evaluation is conducted on the remaining 251 unsafe prompts.", + "bbox": [ + 212, + 316, + 787, + 407 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In Fig. 7, we compare the percentage of change before and after IMMA adaptation with respect to the base SD V1-4 model. We observe that IMMA successfully generated less nudity content after LoRA, i.e., w/ IMMA achieved a negative $80\\%$ of change in the detected nudity content compared to the negative $60\\%$ change for the model without IMMA. This shows that IMMA successfully immunized the model making it more difficult to re-learn nudity from unsafe images/prompts.", + "bbox": [ + 212, + 409, + 787, + 513 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.2 Immunizing against personalized content", + "text_level": 1, + "bbox": [ + 214, + 523, + 599, + 537 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Experiment setup. We consider three adaptation methods for learning new unique/personalized concepts: Textual Inversion (TI) [12], DreamBooth (DB) [39], and DreamBooth LoRA. For DreamBooth LoRA (DB LoRA), instead of modifying all of the parameters during fine-tuning, LoRA is applied on top of the cross-attention layers. We follow the exact adaptation procedures following prior works [12, 39], i.e., adding a special token for the new unique concept. Note, we use different novel tokens during adaptation and IMMA. This is because, for a realistic evaluation, we would not know the novel token that would be used during the adaptation.", + "bbox": [ + 212, + 544, + 787, + 680 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We perform experiments on ten different datasets released by Kumari et al. [24] which include a variety of unique objects. Each of them contains four to six images taken in the real world. The evaluation prompt for all concepts in this section is \"A $[V]$ on the beach\" following DreamBooth.", + "bbox": [ + 212, + 681, + 787, + 741 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation metrics. In this task, we report SGR in Eq. (7) with CLIP and DINO following DreamBooth [39]. Next, to show that the model maintains its capability to be personalized for other concepts, we propose Relative Similarity Gap Ratio (RSGR), which is given by", + "bbox": [ + 212, + 742, + 787, + 804 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {R S G R} \\left(\\mathbf {x} _ {\\mathcal {I}}, \\mathbf {x} _ {\\mathcal {A}}, \\mathbf {x} _ {\\mathcal {I}} ^ {o}, \\mathbf {x} _ {\\mathcal {A}} ^ {o}\\right) = \\frac {\\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {o} , \\mathbf {x} _ {\\mathcal {I}} ^ {o}\\right) - \\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} , \\mathbf {x} _ {\\mathcal {I}}\\right)}{\\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {o} , \\mathbf {x} _ {\\mathcal {I}} ^ {o}\\right)}, \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 313, + 809, + 787, + 844 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 444, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/d712d042c32ef143214f88dabb3d30a0a03fa8508cf38930fcfefda1f29e70b4.jpg", + "table_caption": [ + "Table 4: SGR (%) on personalized content adaptation. Higher positive values indicate better immunization quality." + ], + "table_footnote": [], + "table_body": "
castlecarchairglassesinstrumentwoodenpotlighthousemotorbikehouseplantpurseAverage
TISGR(C)9.358.328.5513.788.610.757.8212.1615.355.809.05
SGR(D)53.4937.0840.1928.5048.857.0436.3348.3641.2324.4336.55
DBSGR(C)2.0314.44-8.600.912.185.80-1.192.371.213.592.27
SGR(D)12.5627.01-14.6713.3724.6429.31-7.410.759.2124.9711.97
DBSGR(C)8.6017.490.2511.7313.662.167.670.980.053.586.62
LoraSGR(D)43.2134.378.9437.6340.3832.7048.366.4024.880.5227.74
", + "bbox": [ + 218, + 174, + 782, + 253 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/1e58eb776ab6f552465827041cbd1f4636ca5c5d1857bd96924bc953c21d521a.jpg", + "table_caption": [ + "Table 5: RSGR (%) on personalized content adaptation. Higher positive values indicate better performance at maintaining other concepts." + ], + "table_footnote": [], + "table_body": "
castle car chair glasses instrument woodenpot lighthouse motorbike houseplant purse Average
TIRSGR (C)15.2420.198.499.7819.148.8920.5718.5916.320.9913.82
RSGR (D)70.6963.5722.540.157.6634.1551.8567.1855.228.8847.18
DBRSGR (C)19.6613.636.624.974.444.6116.536.085.1210.369.20
RSGR (D)36.9935.9817.7232.0424.5923.2835.062.6025.0550.128.34
DBRSGR (C)17.5521.004.493.8912.248.4224.288.6711.774.8311.71
LoRARSGR (D)49.6641.5718.925.4129.9235.9253.1228.6341.0224.7434.89
", + "bbox": [ + 218, + 294, + 782, + 375 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "where $\\mathbf{x}_{\\mathcal{A}}^o$ and $\\mathbf{x}_{\\mathcal{I}}^o$ are generated images without and with IMMA on other unique concepts.", + "bbox": [ + 212, + 392, + 784, + 422 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The term $\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}^{o},\\mathbf{x}_{\\mathcal{I}}^{o})$ captures image similarity for other concepts with and without IMMA. Ideally, this term should be high as IMMA should not affect other concepts. The term $\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}},\\mathbf{x}_{\\mathcal{I}})$ captures the image similarity for target concepts with and without IMMA. In this case, the similarity should be low. RSGR reports the difference between these two terms as a ratio. Intuitively, larger RSGR indicates IMMA is better at preserving the other concepts while removing the target concept.", + "bbox": [ + 212, + 439, + 488, + 650 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/f410812149081ef4c33f74d8a8e3d6aa899b61122761ba58875f8407e35ba48f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 498, + 425, + 643, + 483 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/c11688e062e4fac67893e06f9800803d0ab5cfe752b96f7091182dad5da56996.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 648, + 425, + 779, + 483 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/626aa3f290a5cea882a594c1f4c32d5633ef2edfa137530af0560e36c3c36b15.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 498, + 484, + 643, + 542 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/35cab22c3a5d7c5e82a34a0aba94fbb3ad18ad06b202708a57c49b4c97be6a0c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 648, + 484, + 779, + 542 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/08aaddc213d7b4d62ac869e42ced5f5a53f7dc313de49f989fd5a8e15fac77a7.jpg", + "image_caption": [ + "Fig. 8: CLIP and DINO similarity on other concept vs. target concept. The gap between the two lines shows RSGR." + ], + "image_footnote": [], + "bbox": [ + 498, + 544, + 643, + 602 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/128e4444461358a97d9476a144de3408573df8f598218793b8402c80528389f8.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 648, + 544, + 779, + 602 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We also conducted a user study for personalized adaptation using the setting as in Sec. 5.1.", + "bbox": [ + 212, + 652, + 782, + 681 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Results on personalization. In Tab. 4 we observe a positive ratio among most of the SGR metrics, except for \"furniture chair\" and \"lighthouse\" with Dreambooth highlighted in red. We show the generations with negative SGR in the appendix. Overall, IMMA effectively prevents the pre-trained model from learning personalization concepts across the three adaptation methods.", + "bbox": [ + 212, + 686, + 782, + 762 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Next, Tab. 5 reports RSGR to evaluate how well IMMA preserves the ability to personalize other concepts. As we can see, the RSGR values are consistently positive across all the datasets. This indicates IMMA immunizes against the target concept without hurting the adaptability for personalizing for other concepts. We directly visualize this relative gap in Fig. 8. As shown, the lines of the nine concepts", + "bbox": [ + 212, + 763, + 784, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/2b18cbca2614bd7f021f3bbedf468f7d2cf49d4565fa5864654343a1e9e316f7.jpg", + "image_caption": [ + "Reference", + "YNNNI O/A" + ], + "image_footnote": [], + "bbox": [ + 297, + 160, + 390, + 231 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/a3cb0dca82a613a6dea6c1796961f5e73a52f78a7623bb8f747ee42742a12efb.jpg", + "image_caption": [ + "TI" + ], + "image_footnote": [], + "bbox": [ + 418, + 160, + 506, + 231 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/83273643c336a8e1ca9148ef5452eb757eb9c3f4bc2577a47463f923a1a987fc.jpg", + "image_caption": [ + "DB" + ], + "image_footnote": [], + "bbox": [ + 509, + 160, + 599, + 231 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/80f781a4cb70f738d1a3b4ca08def454f4df6262f2ef3fd6bf9b91d0926a0054.jpg", + "image_caption": [ + "DB LoRA" + ], + "image_footnote": [], + "bbox": [ + 602, + 160, + 694, + 231 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/72d709677703e90f9ab12e497e4036999ea5f7345d92fb0b8ec2e688fbde9401.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 297, + 233, + 390, + 305 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/7958a1dc4b4a51ac2be21ece31db329dc52bbf137baa390762a57dd6757a89ed.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 395, + 233, + 506, + 305 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/2382d2db04feaf03d8a571612359a400b2352aa446a7b616e3af717af38c9334.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 509, + 233, + 599, + 305 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/ecdbde225c15398f70eca1561f94a6e5abc7f23ce5d6cb5ec555d840c75705ee.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 602, + 233, + 694, + 305 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/69ef5946a71474dfc4fcda53d9dc8c329d13f3cc57da4171f6991d9c21f0e641.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 297, + 309, + 390, + 383 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/33012a06ff0eb067de9a3ae4baceb69aa4b19ad4c1b27e2f2feb453842a8015d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 395, + 309, + 506, + 382 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/8edc84088288cbc98674c035805a18df8e35226c097fd5ce9297c4fee2d2c9e8.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 509, + 309, + 599, + 382 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/86d01e88503b46e1b9776e96f771e5a69175e4c4e845e8f65411bcd08eecad7d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 602, + 309, + 694, + 382 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/b26dee41bf2a6fc9ffbdc9b9d41d24c6d336cfcd626093eea2673e2f32b549d6.jpg", + "image_caption": [ + "Fig. 9: Personalization adaptation w/ and w/o IMMA." + ], + "image_footnote": [], + "bbox": [ + 297, + 383, + 390, + 455 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/635c8e01f422752a4c8e2f9fd2fc9fbe85e674ae7de68502ef80026986a55cda.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 395, + 383, + 506, + 455 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/64553925d2cd9526c7657e66b348a347c4ea31e4d3e30d7eefc741564a124f9a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 509, + 383, + 599, + 455 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/50816ec7f463cc7c7c19a3353d69879d0e9315a0eae7d68d2db99636b0824c21.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 602, + 383, + 694, + 455 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "$(\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}^{o}, \\mathbf{x}_{\\mathcal{I}}^{o}) \\uparrow$ in green) and the adaptation of the target concept $(\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}, \\mathbf{x}_{\\mathcal{I}}) \\downarrow$ in blue) can be easily distinguished; consistent with results in Tab. 5.", + "bbox": [ + 212, + 481, + 784, + 510 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Lastly, we show the generated images in Fig. 9. Comparing the generated images with and without IMMA, we observe models with IMMA are either unable to learn the target concept or generate unrealistic images. We also conducted a user study to validate this observation. All of the 30 participants selected generation without IMMA to be more similar to reference images, i.e., models after IMMA fail to generate the target concepts.", + "bbox": [ + 212, + 512, + 785, + 602 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.3 Additional discussion", + "text_level": 1, + "bbox": [ + 214, + 619, + 436, + 632 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Comparison with data poisoning. We compare IMMA with MIST [27], one of the data poisoning (DP) methods in the personalized content setup. In Fig. 10 (top-row) we show both MIST and IMMA successfully prevent the model from learning the target concept after Textual Inversion.", + "bbox": [ + 212, + 642, + 784, + 702 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "This observation is also supported by a user study. On seven out of ten evaluated datasets, the majority of the 30 users found the generation without MIST to be of higher quality and more similar to the reference images.", + "bbox": [ + 212, + 703, + 784, + 747 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Adaption on images with JPEG compression. As reported in MIST [27], one way to weaken the effect of poisoned data is by compressing the images with JPEG after adaptation. On the other hand, IMMA can defend against JPEG compression by including JPEG images in the training data. In Fig. 10 (bottom row), we observe that after compression, MIST fails to prevent generating the target concept, while IMMA remains robust against JPEG.", + "bbox": [ + 212, + 750, + 785, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 444, + 127 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/63f3427d9ec611b3cfb9cb43bb0ae1344228abfaa531195efa93185bb197496e.jpg", + "image_caption": [ + "eae" + ], + "image_footnote": [], + "bbox": [ + 318, + 143, + 429, + 243 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/54b3272ab78b9e454fa00c62ce1ccfe891866e6d7e0169af837962565cc4af15.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 320, + 244, + 431, + 329 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/0e3dbd70393ad40a34ff7da532000eeed6b29520c501d58f545a8fc26ea91828.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 452, + 143, + 563, + 243 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/da31ed2a409d03ad0390d6a96c5be317d9e131362c2ef90aa0f96dbe4c6b9a14.jpg", + "image_caption": [ + "Fig. 10: MIST vs. IMMA. Generation with Textual Inversion on training images w/ and w/o JPEG compression." + ], + "image_footnote": [], + "bbox": [ + 454, + 244, + 563, + 330 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/cb0376106f6cdd15d651865bb47fa7aa62332a5cf1708077e2c61e309ebd5357.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 566, + 143, + 676, + 243 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d49af8f767c8515beaaf863624532b312d0441e29a23ffb2063bc6cce279f45e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 566, + 244, + 676, + 330 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/e730396aa651afa82bb9b682cfbb0a4df3066914a01a2d81561a4954b38f0208.jpg", + "image_caption": [ + "Fig. 11: Ablation on direct maximization. DreamBooth adaptation on \"luggage purse\" after immunization on \"woodenpot\"." + ], + "image_footnote": [], + "bbox": [ + 328, + 364, + 439, + 463 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/9f43012597a731f0a9c036fb64bab70de7f96a4957ae8d770e1ae0b2b1075448.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 442, + 364, + 553, + 462 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/e8703a69a8fa8250adc31b9cc995a28c5c6e01f210ec51f3c2c82ad9ca2a3ad1.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 557, + 364, + 668, + 462 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablation studies. We conduct ablations using the DreamBooth personalization setup in Sec. 5.2. First, we experiment with a direct maximization baseline, i.e., only the upper-level task in Eq. (3). Results are shown in Fig. 11. We observe that direct maximization ruins the immunized model, i.e., low image quality when being adapted for another concept.", + "bbox": [ + 212, + 515, + 787, + 590 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Next, we ablate line 5 and line 7 in Alg. 1 and report CLIP similarity. Shown in Fig. 12 (left), without line 5, the adaptation can learn the target concept, i.e., high CLIP similarity. Next, we ablate whether to update the overlapping parameters in $\\phi$ by removing line 7. The result is shown in Fig. 12 (right). We observe that without line 7, the adaptation successfully learns the target concept. These results show the necessity of the proposed steps in Alg. 1.", + "bbox": [ + 212, + 592, + 787, + 683 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Crossed adaptation with IMMA. Thus far, we report results for IMMA by immunizing the model against the same adaptation method $\\mathcal{A}$ . We now investigate whether IMMA remains effective under a different adaptation method during IMMA and adaptation. In other words, we consider IMMA with crossed adaptation methods, where we immunize the pre-trained model using $\\mathcal{A}_1$ and perform malicious adaptation on $\\mathcal{A}_2$ . Fig. 13 shows the qualitative results across DB and TI. We observe that the model with IMMA against DreamBooth is also effective when being adapted with Textual Inversion, and vice versa.", + "bbox": [ + 212, + 685, + 787, + 806 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Limitations. Our proposed IMMA and experiments focus on the immunization of a single concept. In this work, we methodically study a variety of adaptation", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/b75c203745bbd3955820db724a67ef2acb28613a3f4e4631bcb50856e33e490f.jpg", + "image_caption": [ + "Fig. 12: Ablation on line 5 and line 7 of Alg. 1." + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 496, + 265 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/714e86832f9d713d6f2ff6ba9aca24002f48125f3bfbd42362ebb2f96ce55477.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 496, + 143, + 776, + 266 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/d2b8b6fd5a9083c8b558ab1d5d16cc41740ea7e9b8abb0796b8d241843f0e0ab.jpg", + "image_caption": [ + "Fig. 13: Results on crossed adaptation immunization. First row: DB after IMMA with either DB or TI. Second row: TI after IMMA the model with either DB or TI." + ], + "image_footnote": [], + "bbox": [ + 308, + 292, + 684, + 494 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "settings and leave the support for multiple concepts for future work. We believe that results in a single concept demonstrate a convincing step towards model immunization. If the reader is interested, we present preliminary results in the Appendix showing that IMMA can generalize to multiple concepts, albeit, not as comprehensive as the single concept study.", + "bbox": [ + 212, + 545, + 787, + 621 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 643, + 359, + 657 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We propose to Immunize Models against Malicious Adaptation (IMMA). Unlike the data-poisoning paradigm, which protects images, our method focuses on protecting pre-trained models from being used by adaptation methods. We formulate \"Immunization\" as a bi-level optimization program to learn a poor model initialization that would make adaptation more difficult. To validate the efficacy of IMMA, we conduct extensive experiments on relearning concepts for erased models and immunizing against the adaptation of personalized content. We believe that model immunization is a promising paradigm for combatting the risk of malicious adaptation, and that IMMA is an encouraging first step. We are hopeful that the advancement of IMMA will result in safer open-source text-to-image models, benefiting both the research community and society.", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 444, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bedapudi, P.: NudeNet: Neural nets for nudity classification, detection and selective censoring. https://github.com/plateminto/NudeNetClassifier (2019)", + "2. Bengio, Y.: Gradient-based optimization of hyperparameters. Neural Computation (2000)", + "3. Biggio, B., Nelson, B., Laskov, P.: Support vector machines under adversarial label noise. In: Proc. ACML (2011)", + "4. Bird, C., Ungless, E., Kasirzadeh, A.: Typology of risks of generative text-to-image models. In: Proc. AIES (2023)", + "5. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. CVPR (2021)", + "6. CreativeML Open RAIL-M: Stable Diffusion LICENSE File (2023), URL https://github.com/CompVis/stable-diffusion/blob/main/License", + "7. Dai, X., Hou, J., Ma, C.Y., Tsai, S., Wang, J., Wang, R., Zhang, P., Vandenhende, S., Wang, X., Dubey, A., Yu, M., Kadian, A., Radenovic, F., Mahajan, D., Li, K., Zhao, Y., Petrovic, V., Singh, M.K., Motwani, S., Wen, Y., Song, Y., Sumbaly, R., Ramanathan, V., He, Z., Vajda, P., Parikh, D.: Emu: Enhancing image generation models using photogenic needles in a haystack. arXiv preprint arXiv:2309.15807 (2023)", + "8. DeepFloyd Lab at StabilityAI: DeepFloyd IF. https://github.com/deepfloyd/IF (2023)", + "9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: ImageNet: A large-scale hierarchical image database. In: Proc. CVPR (2009)", + "10. Dhariwal, P., Nichol, A.: Diffusion models beat GANs on image synthesis. In: Proc. NeurIPS (2021)", + "1. Finn, C., Abbeel, P., Levine, S.: Model-agnostic meta-learning for fast adaptation of deep networks. In: Proc. ICML (2017)", + "2. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: Proc. ICLR (2023)", + "3. Gandikota, R., Materzyńska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. In: Proc. ICCV (2023)", + "4. Gandikota, R., Orgad, H., Belinkov, Y., Materzyńska, J., Bau, D.: Unified concept editing in diffusion models. In: Proc. WACV (2024)", + "5. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: Proc. ICLR (2015)", + "6. Harwell, D.: AI-generated child sex images spawn new nightmare for the web. The Washington Post (2023), URL https://www.washingtonpost.com/technology/2023/06/19/artificial-intelligence-child-sex-abuse-images/", + "7. Heikkilä, M.: This artist is dominating ai-generated art. and he's not happy about it. MIT Technology Review. Retrieved March 16, 2023 (2022)" + ], + "bbox": [ + 225, + 178, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. arXiv preprint arXiv:2305.10120 (2023)", + "19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Proc. NeurIPS (2020)", + "20. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: LoRA: Low-rank adaptation of large language models. In: Proc. ICLR (2022)", + "21. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: Proc. NeurIPS (2021)", + "22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: Proc. ICLR (2015)", + "23. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: Proc. ICCV (2023)", + "24. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proc. CVPR (2023)", + "25. Larsen, J., Hansen, L.K., Svarer, C., Ohlsson, M.: Design and regularization of neural networks: the optimal use of a validation set. In: IEEE Signal Processing Society Workshop (1996)", + "26. Liang, C., Wu, X.: Mist: Towards improved adversarial examples for diffusion models (2023)", + "27. Liang, C., Wu, X., Hua, Y., Zhang, J., Xue, Y., Song, T., Xue, Z., Ma, R., Guan, H.: Adversarial example does good: Preventing painting imitation from diffusion models via adversarial examples. In: Proc. ICML (2023)", + "28. Lorraine, J., Vicol, P., Duvenaud, D.: Optimizing millions of hyperparameters by implicit differentiation. In: Proc. AISTATS (2020)", + "29. Mei, S., Zhu, X.: Using machine teaching to identify optimal training-set attacks on machine learners. In: Proc. AAAI (2015)", + "30. Moore, S.: Can the law prevent AI from duplicating actors? It's complicated. Forbes (Jul 2023), URL https://www.forbes.com/sites/schuylermoore/2023/07/13/proTECTing-celebrities-including-all-actors-from-ai-with-the-right-of-publicity/?sh=5c56ba4159ec", + "31. Nichol, A.Q., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., Mcgrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. In: Proc. ICML (2022)", + "32. Noveck, J., O'Brien, M.: Visual artists sue ai companies in sf federal court for repurposing their work. Associated Press (2023)", + "33. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: SDXL: improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)", + "34. Qu, Y., Shen, X., He, X., Backes, M., Zannettou, S., Zhang, Y.: Unsafe diffusion: On the generation of unsafe images and hateful memes from text-to-image models. arXiv preprint arXiv:2305.13873 (2023)", + "35. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with CLIP latents. arXiv preprint arXiv:2204.06125 (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 444, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "36. Rando, J., Paleka, D., Lindner, D., Heim, L., Tramér, F.: Red-teaming the stable diffusion safety filter. In: Proc. NeurIPS ML Safety Workshop (2022)", + "37. Ren, Z., Yeh, R., Schwing, A.: Not all unlabeled data are equal: Learning to weight data in semi-supervised learning (2020)", + "38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proc. CVPR (2022)", + "39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: DreamBooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proc. CVPR (2023)", + "40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: Proc. NeurIPS (2022)", + "41. Salman, H., Khaddaj, A., Leclerc, G., Ilyas, A., Madry, A.: Raising the cost of malicious AI-powered image editing. In: Proc. ICML (2023)", + "42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proc. CVPR (2023)", + "43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5B: An open large-scale dataset for training next generation image-text models. In: Proc. NeurIPS (2022)", + "44. Shan, S., Cryan, J., Wenger, E., Zheng, H., Hanocka, R., Zhao, B.Y.: Glaze: Protecting artists from style mimicry by text-to-image models. In: USENIX Security Symposium (2023)", + "45. SmithMano: Tutorial: How to remove the safety filter in 5 seconds. Reddit (2022)", + "46. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: Proc. ICML (2015)", + "47. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: Proc. NeurIPS (2019)", + "48. Vincent, P.: A connection between score matching and denoising autoencoders. Neural computation (2011)", + "49. Wang, Z., Chen, C., Liu, Y., Lyu, L., Metaxas, D., Ma, S.: How to detect unauthorized data usages in text-to-image diffusion models. arXiv preprint arXiv:2307.03108 (2023)", + "50. Yeh, R.A., Hu, Y.T., Hasegawa-Johnson, M., Schwing, A.: Equivariance discovery by learned parameter-sharing. In: Proc. AISTATS (2022)", + "51. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023)", + "52. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proc. CVPR (2018)" + ], + "bbox": [ + 212, + 145, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IMMA: Immunizing text-to-image Models against Malicious Adaptation", + "bbox": [ + 251, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "53. Zhao, Z., Duan, J., Hu, X., Xu, K., Wang, C., Zhang, R., Du, Z., Guo, Q., Chen, Y.: Unlearnable examples for diffusion models: Protect data from unauthorized exploitation. arXiv preprint arXiv:2306.01902 (2023)", + "54. Zheng, A.Y., He, T., Qiu, Y., Wang, M., Wipf, D.: Graph machine learning through the lens of bilevel optimization. In: Proc. AISTATS (2024)", + "55. Zheng, A.Y., Yang, C.A., Yeh, R.A.: Learning to obstruct few-shot image classification over restricted classes. In: Proc. ECCV (2024)" + ], + "bbox": [ + 215, + 145, + 787, + 252 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "A.Y. Zheng and R.A. Yeh", + "bbox": [ + 271, + 114, + 444, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_model.json b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_model.json new file mode 100644 index 0000000000000000000000000000000000000000..061d35c2979f630446fbd37ad31a372b12c7fa04 --- /dev/null +++ b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_model.json @@ -0,0 +1,3173 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.218, + 0.141, + 0.787, + 0.187 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "text", + "bbox": [ + 0.35, + 0.213, + 0.653, + 0.228 + ], + "angle": 0, + "content": "Amber Yijia Zheng Raymond A. Yeh" + }, + { + "type": "text", + "bbox": [ + 0.325, + 0.24, + 0.678, + 0.269 + ], + "angle": 0, + "content": "Department of Computer Science, Purdue University {zheng709, rayyeh}@purdue.edu" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.304, + 0.744, + 0.499 + ], + "angle": 0, + "content": "Abstract. Advancements in open-sourced text-to-image models and fine-tuning methods have led to the increasing risk of malicious adaptation, i.e., fine-tuning to generate harmful/ unauthorized content. Recent works, e.g., Glaze or MIST, have developed data-poisoning techniques which protect the data against adaptation methods. In this work, we consider an alternative paradigm for protection. We propose to \"immunize\" the model by learning model parameters that are difficult for the adaptation methods when fine-tuning malicious content; in short IMMA. Specifically, IMMA should be applied before the release of the model weights to mitigate these risks. Empirical results show IMMA's effectiveness against malicious adaptations, including mimicking the artistic style and learning of inappropriate/unauthorized content, over three adaptation methods: LoRA, Textual-Inversion, and DreamBooth. The code is available at https://github.com/amberyzheng/IMMA." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.522, + 0.377, + 0.538 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.788, + 0.705 + ], + "angle": 0, + "content": "With the open-source of large-scale text-to-image models [8, 38] the entry barrier to generating images has been drastically lowered. Building on top of these models, methods such as Textual Inversion [12], DreamBooth [39], and LoRA [20] allow quick adaptation to generate personalized content. These newly introduced capabilities come with great responsibility and trust in individuals to do good instead of harm to society. Unfortunately, the capabilities of adapting text-to-image generative models have already had negative impacts, e.g., the generation of sexual content [16], copying artists' work without consent [17, 32], duplicating celebrity images [30], etc. We broadly encapsulate all these harmful fine-tuning of models under the term malicious adaptation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.781 + ], + "angle": 0, + "content": "To countermeasure these adaptations, open-source models have users agree that they will not use the software for \"the purpose of harming others\" in their licenses [6] or implement safety checks that would censor inappropriate generated content [36]. Nonetheless, these approaches do not have real enforcing power. Users can trivially disregard the license and remove the safety filters [45]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.781, + 0.788, + 0.84 + ], + "angle": 0, + "content": "To address these loopholes, recent data poisoning techniques have shown a promising path towards preventing malicious adaptations [27, 41, 44]. The main idea is to protect images by modifying them with imperceivable changes, e.g., adversarial noise, such that adaptation methods confuse the style and content of" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.447, + 0.129 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.207 + ], + "angle": 0, + "content": "the images and fail to generalize. A key shortcoming of these methods is that the burden of enforcement is on content creators. The artists need to apply these techniques before releasing their artwork. Contrarily, we present an alternative paradigm that places this burden on the releaser of open-source models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.49, + 0.434 + ], + "angle": 0, + "content": "In this paper, we propose to \"Immunize\" Models, i.e., make them more resilient, against Malicious Adaptation; in short IMMA. The goal of IMMA is to make adaptation more difficult for concepts that are deemed malicious while maintaining the models' adaptability for other concepts. At a high level, we propose an algorithm to learn model parameters that perform poorly when being adapted to malicious concepts, e.g., mimicry artistic style. In Fig. 1, we illustrate the effect of IMMA when mimicking Picasso's style; the model" + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.211, + 0.782, + 0.357 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.361, + 0.788, + 0.417 + ], + "angle": 0, + "content": "Fig. 1: IMMA on artistic style mimicry. Higher 1 - LPIPS indicates more similar to the reference images. IMMA successfully prevented the mimicking of the artistic style." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.435, + 0.788, + 0.538 + ], + "angle": 0, + "content": "To demonstrate the effectiveness of IMMA, we consider three adaptation methods, namely, Textual Inversion [12], DreamBooth [39], and LORA [20]. We experimented with immunizing against several malicious settings, including, mimicking artistic styles, restoring erased concepts, and learning personalized concepts. Overall, IMMA successfully makes text-to-image models more resilient against adaptation to malicious concepts while maintaining the usability of the model. Our contributions are as follows:" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.541, + 0.785, + 0.586 + ], + "angle": 0, + "content": "- We propose a novel paradigm for preventing malicious adaptations. In contrast to the data poisoning for protection paradigm, we aim to protect the model instead of the data. See Fig. 2." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.586, + 0.785, + 0.615 + ], + "angle": 0, + "content": "- We present an algorithm (IMMA) that learns difficult model initialization for the adaptation methods." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.617, + 0.785, + 0.647 + ], + "angle": 0, + "content": "- We conduct extensive experiments evaluating IMMA against various malicious adaptations." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.541, + 0.785, + 0.647 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.671, + 0.388, + 0.687 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.703, + 0.788, + 0.794 + ], + "angle": 0, + "content": "Diffusion models. By learning to reverse a process of transforming data into noise, diffusion models achieve impressive generative capabilities [10, 19, 46]. With the aid of Internet-scale datasets [43], these models are capable of generating diverse images with high realism [7, 8, 31, 33, 35, 38, 40]. This progress led to new excitements in artificial intelligence generated content (AIGC) and interest in how to mitigate the associated risks, which we discuss next." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Preventing generative AI misuse. There are many potential risks associated with the advancement in generative capabilities [4, 34]. Recent works have started to address these risks. For example, Wang et al. [49] study how to detect" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.252, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.145, + 0.428, + 0.255 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.45, + 0.144, + 0.79, + 0.254 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.33 + ], + "angle": 0, + "content": "Fig.2: Paradigms for preventing malicious adaptation. Data poisoning: modify training images \\(\\mathbf{x}'\\) with imperceivable changes, such that \\(\\mathcal{A}\\) fails to capture \\(\\mathbf{c}'\\) by training with modified images. Model immunization (ours): modify pre-trained model weights \\(\\theta^p\\) with immunization methods \\(\\mathcal{I}\\) before adaptation \\(\\mathcal{A}\\), such that \\(\\mathcal{A}\\) fails to capture \\(\\mathbf{c}'\\) by training on immunized model weights \\(\\mathcal{I}(\\theta^p)\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.345, + 0.789, + 0.419 + ], + "angle": 0, + "content": "unauthorized images that are used in the training set of these models. Schramowski et al. [42] study how to suppress the generation of inappropriate content, e.g., nudity, self-harm, etc., during diffusion's generation process. Other works [13, 14, 18, 23, 51], take a further step in trying to remove these inappropriate content from the diffusion models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.42, + 0.789, + 0.557 + ], + "angle": 0, + "content": "More closely related to this work, GLAZE [44], MIST [26, 27], and EUDP [53] studied the misuse of artistic mimicry, i.e., preventing diffusion models from being used to copy artistic styles. Salman et al. [41] have also studied how to raise the cost of image manipulation using diffusion models. Notably, these works aim to protect the image, i.e., a form of data-poisoning [3, 29] which modifies the data, e.g., adding adversarial noise [15], such that the adaptation techniques fail. Different from these works, we protect the model, against misuse, i.e., model immunization. We illustrate the difference between our proposed model immunization vs. data poisoning in Fig. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.558, + 0.79, + 0.694 + ], + "angle": 0, + "content": "Meta-learning. As our approach to model immunization is based on learning against an adaptation method, we briefly review meta-learning; also known as learning to learn. The area covers learning many aspects of a learning algorithm, e.g., learning good initialization suitable to adaptation [11], or other hyperparameters, e.g., learning rate, or weight decay, via hypergradient [2, 25, 28, 37, 50, 54, 55]. Various hypergradients approximations have been proposed, e.g., MAML [11] uses a single step gradient unrolling, with a summary provided by Lorraine et al. [28]. Different from these works, we aim to learn poor initializations for the adaptation methods to prevent the misuse of generative models." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.717, + 0.383, + 0.733 + ], + "angle": 0, + "content": "3 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.778 + ], + "angle": 0, + "content": "We briefly review the concepts necessary to understand our approach and introduce a common notation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.794, + 0.842 + ], + "angle": 0, + "content": "Text-to-image diffusion models. The goal of a text-to-image diffusion model [38] is to learn a conditional distribution of images \\(\\mathbf{x}\\) given concept embedding \\(\\mathbf{c}\\), i.e., modeling \\(p(\\mathbf{x}|\\mathbf{c};\\theta)\\), where \\(\\theta\\) denotes the model parameters. The learning objective is formulated via variational lower bound [19, 21] or from a denoising" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.447, + 0.129 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.704, + 0.163 + ], + "angle": 0, + "content": "score-matching perspective [47, 48] which boils down to minimizing" + }, + { + "type": "equation", + "bbox": [ + 0.336, + 0.166, + 0.788, + 0.186 + ], + "angle": 0, + "content": "\\[\nL (\\mathbf {x}, \\mathbf {c}; \\theta) = \\mathbb {E} _ {t, \\epsilon \\sim \\mathcal {N} (0, I)} \\left[ w _ {t} \\| \\epsilon_ {\\theta} (\\mathbf {x} _ {t}, \\mathbf {c}, t) - \\epsilon \\| _ {2} ^ {2} \\right], \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.19, + 0.786, + 0.234 + ], + "angle": 0, + "content": "where \\(\\epsilon_{\\theta}\\) denotes the denoising network, \\(\\mathbf{x}_t\\) and \\(w_t\\) denote the noised images and loss weights for a given time-step \\(t \\sim \\mathcal{U}\\{0, T\\}\\) sampled from a discrete uniform distribution." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.236, + 0.787, + 0.282 + ], + "angle": 0, + "content": "Concept erasing methods. To erase a target concept \\( c' \\) from a model, erasing algorithms [13, 23] fine-tunes a pre-trained model's parameters \\( \\theta^p \\) such that the model no longer generate images corresponding to that concept, i.e.," + }, + { + "type": "equation", + "bbox": [ + 0.37, + 0.286, + 0.788, + 0.305 + ], + "angle": 0, + "content": "\\[\np \\left(\\tilde {\\boldsymbol {x}} \\mid \\mathbf {c} ^ {\\prime}; \\theta_ {- \\mathbf {c} ^ {\\prime}} ^ {p}\\right) \\approx 0, \\forall \\tilde {\\boldsymbol {x}} \\sim p \\left(\\mathbf {x} \\mid \\mathbf {c} ^ {\\prime}; \\theta^ {p}\\right), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.309, + 0.787, + 0.37 + ], + "angle": 0, + "content": "where \\(\\theta_{-\\mathbf{c}'}^p\\) denotes the parameters of the erased model after fine-tuning. The main idea is to train the target concept to generate images of some other concept. A common choice is an empty token, i.e., the model performs unconditional generation when prompted with the target concept \\(c'\\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.371, + 0.789, + 0.537 + ], + "angle": 0, + "content": "Personalization of text-to-image diffusion models. In contrast to erasing a concept, personalization algorithms aim to add a novel concept to the pre-trained model. Given a set of images \\(\\{\\mathbf{x}'\\}\\) representative of the concept \\(\\mathbf{c}'\\). Personalization methods introduce a novel token \\([V]\\) in the word space and train the model to associate \\([V]\\) to the new concept. To learn this new concept, the model is trained using the data pair \\((\\mathbf{x}', \\mathbf{c}')\\), where \\(\\mathbf{c}' \\triangleq \\Gamma([V])\\) is extracted with the text encoder \\(\\Gamma\\) using the novel word token \\([V]\\). We broadly use the notation \\(L_{\\mathcal{A}}(\\mathbf{x}', \\mathbf{c'}; \\theta, \\phi)\\) to denote the loss function of each adaptation method \\(\\mathcal{A}\\), where \\(\\phi\\) denotes the parameters that are being fine-tuned. For example, DreamBooth [24, 39] finetunes on a subset of parameters, e.g., cross-attention layers, whereas Textual Inversion [12] only optimizes the new word token." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.538, + 0.79, + 0.645 + ], + "angle": 0, + "content": "Another common approach to make the fine-tuning more data efficient is to use Low-Rank Adaptation (LoRA) [20]. Given a pre-trained weight \\(\\theta^p \\in \\mathbb{R}^{n \\times d}\\), LoRA aims to learn an adaptor \\(\\Delta\\), such that the final weights become \\(\\hat{\\theta} = \\theta^p + \\Delta\\). LoRA specifically restricts the \\(\\Delta\\) to be low-rank, i.e., \\(\\Delta = AB\\) where \\(A \\in \\mathbb{R}^{n \\times r}\\) and \\(B \\in \\mathbb{R}^{r \\times d}\\) with \\(r \\ll \\min(n, d)\\). In this work, we show that LoRA can easily learn back the concepts that were previously erased which highlights the need for our proposed research direction of model immunization." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.662, + 0.348, + 0.68 + ], + "angle": 0, + "content": "4 Approach" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.689, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Given a pre-trained text-to-image model with parameters \\(\\theta^p\\), e.g., StableDiffusion [38], existing adaptation methods \\(\\mathcal{A}\\) [12, 20, 24, 39] can fine-tune \\(\\theta^p\\) such that the model generates images of a concept \\(\\mathbf{c}'\\). Our goal is to prevent the adaptation methods from successfully doing so on harmful concepts, e.g., unauthorized artistic style. To accomplish this, we present an algorithm IMMA \\(\\mathcal{I}\\) that takes pre-trained parameters \\(\\theta^p\\) as input, and outputs the immunized parameters \\(\\theta^I\\). When applying adaptation \\(\\mathcal{A}\\) with \\(\\theta^I\\), it should fail to learn the concept \\(\\mathbf{c}'\\), i.e., the model is \"immunized\" against adaptation. At a high level, IMMA aims to learn a poor model initialization when being fine-tuned by the adaptation methods. We now describe the algorithmic details." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.252, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.434, + 0.161 + ], + "angle": 0, + "content": "4.1 Model immunization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.785, + 0.202 + ], + "angle": 0, + "content": "To achieve this goal of learning a poor initialization for adaptation, we propose the following bi-level program:" + }, + { + "type": "equation", + "bbox": [ + 0.3, + 0.211, + 0.788, + 0.252 + ], + "angle": 0, + "content": "\\[\n\\overbrace {\\max _ {\\theta \\in \\mathcal {S}} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {I}} ^ {\\prime} , \\mathbf {c} ^ {\\prime} ; \\theta , \\phi^ {\\star}\\right)} ^ {\\text {u p p e r - l e v e l t a k}} \\text {s . t .} \\phi^ {\\star} = \\overbrace {\\operatorname* {a r g m i n} _ {\\phi} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {\\prime} , \\mathbf {c} ^ {\\prime} ; \\theta , \\phi\\right)} ^ {\\text {l o w e r - l e v e l t a k}}. \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.262, + 0.784, + 0.367 + ], + "angle": 0, + "content": "Here, the set \\( \\mathcal{S} \\) denotes a subset of \\( \\theta \\) that is trained by IMMA. This set is a hyperparameter that we choose empirically. Given a dataset of images \\( \\mathcal{D} = \\{\\mathbf{x}'\\} \\) representative of the concept \\( \\mathbf{c}' \\), we sample the training data \\( \\mathbf{x}_{\\mathcal{A}}' \\) and \\( \\mathbf{x}_{\\mathcal{D}}' \\) independently. As reviewed in Sec. 3, \\( \\phi \\) denotes the parameters modified by the adaptation method \\( \\mathcal{A} \\). Note, \\( \\phi \\) may include newly introduced parameters by \\( \\mathcal{A} \\) or the parameters in the pre-trained model. We use the notation \\( \\mathcal{U} \\) to be the set of overlapping parameters between \\( \\phi \\) and \\( \\theta \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.367, + 0.785, + 0.457 + ], + "angle": 0, + "content": "Intuitively, the lower-level task simply performs the adaptation \\(\\mathcal{A}\\) given the model initialization \\(\\theta\\) by minimizing the loss function \\(L_{\\mathcal{A}}\\) with respect to (w.r.t.) \\(\\phi\\). On the other hand, the upper-level task is maximizing the loss function of \\(\\mathcal{A}\\) w.r.t. \\(\\theta\\). That is, the upper-level task aims for \\(\\theta\\) that results in poor performance when the adaptation method \\(\\mathcal{A}\\) is applied to the target concept \\(\\mathbf{c}'\\). The worse the performance is when adapted by \\(\\mathcal{A}\\), the more immunized a model is." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.458, + 0.785, + 0.489 + ], + "angle": 0, + "content": "To solve the program in Eq. (3), we use gradient-based methods to solve the upper-level optimization. This leads to the following update steps:" + }, + { + "type": "equation", + "bbox": [ + 0.365, + 0.498, + 0.788, + 0.521 + ], + "angle": 0, + "content": "\\[\n\\phi^ {\\star} \\leftarrow \\arg \\min _ {\\phi} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {\\prime}, \\mathbf {c} ^ {\\prime}; \\theta^ {i - 1}, \\phi\\right) \\tag {4}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.37, + 0.524, + 0.787, + 0.543 + ], + "angle": 0, + "content": "\\[\n\\theta^ {i} \\leftarrow \\theta^ {i - 1} + \\alpha \\nabla_ {\\theta} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {I}} ^ {\\prime}, \\mathbf {c} ^ {\\prime}; \\theta^ {i - 1}, \\phi^ {\\star}\\right), \\tag {5}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.561, + 0.48, + 0.577 + ], + "angle": 0, + "content": "Algorithm 1 IMMA (Our method)" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.581, + 0.505, + 0.636 + ], + "angle": 0, + "content": "Input: pre-trained model \\(\\theta^p\\), images \\(\\mathcal{D} = \\{\\mathbf{x}'\\}\\) representative of the concept \\(\\mathbf{c}'\\), learning rate \\(\\alpha\\), IMMA-modified parameters set \\(\\mathcal{S}\\), adaptation loss \\(L_{A}\\)" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.637, + 0.425, + 0.649 + ], + "angle": 0, + "content": "Output: Immunized model \\(\\theta^I\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.65, + 0.358, + 0.663 + ], + "angle": 0, + "content": "1: Initialize \\(\\theta^0 = \\theta^p\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.664, + 0.405, + 0.677 + ], + "angle": 0, + "content": "2: Initialize \\(\\phi^0\\) based on \\(\\mathcal{A}\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.679, + 0.361, + 0.691 + ], + "angle": 0, + "content": "3: for \\( i = 1 \\) to \\( I \\) do" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.692, + 0.482, + 0.706 + ], + "angle": 0, + "content": "4: Sample batch \\(\\mathbf{x}_{\\mathcal{A}}^{\\prime}\\) and \\(\\mathbf{x}_{\\mathcal{I}}^{\\prime}\\) from \\(\\mathcal{D}\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.706, + 0.504, + 0.732 + ], + "angle": 0, + "content": "5: \\(\\phi \\gets \\phi^{i - 1} \\# \\text{Initialize } \\phi \\text{ from the previous iteration}\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.733, + 0.481, + 0.747 + ], + "angle": 0, + "content": "6: \\(\\phi^i\\gets \\arg \\min_{\\phi}L_{\\mathcal{A}}(\\mathbf{x}_{\\mathcal{A}}',\\mathbf{c}';\\theta^{i - 1},\\phi)\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.747, + 0.504, + 0.773 + ], + "angle": 0, + "content": "7: \\(\\theta_{\\in \\mathcal{U}}^{i - 1}\\gets \\phi^i\\# Assign\\) the overlaps between \\(\\theta\\) and \\(\\phi\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.774, + 0.504, + 0.79 + ], + "angle": 0, + "content": "8: \\(\\theta_{\\in S}^{i}\\gets \\theta_{\\in S}^{i - 1} + \\alpha \\nabla_{\\theta}L_{\\mathcal{A}}(\\mathbf{x}_{\\mathcal{I}}^{\\prime},\\mathbf{c}^{\\prime};\\theta^{i - 1},\\phi^{i})\\)" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.79, + 0.3, + 0.801 + ], + "angle": 0, + "content": "9: end for" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.802, + 0.319, + 0.815 + ], + "angle": 0, + "content": "10: return \\(\\theta^I\\)" + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.65, + 0.504, + 0.815 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.513, + 0.553, + 0.788, + 0.687 + ], + "angle": 0, + "content": "where \\(\\alpha\\) denotes learning rate. We summarized the procedure in Alg. 1. Given the pre-trained model parameters \\(\\theta^p\\), the algorithm returns an immunized parameter \\(\\theta^I\\). We will next describe the subtle choices that were made regarding re-initialization and overlapping parameters during the optimization of \\(\\theta\\) and \\(\\phi\\)." + }, + { + "type": "text", + "bbox": [ + 0.513, + 0.688, + 0.788, + 0.825 + ], + "angle": 0, + "content": "Details on updating \\(\\phi\\) and \\(\\theta\\). In Alg. 1 line 5, in theory, we should reinitialize \\(\\phi\\) following the initialize scheme of \\(\\mathcal{A}\\), as the lower-level task is performing the adaptation. In practice, computing the lower-level task until convergence for each outer-loop iteration is prohibitively expensive. To reduce computation, we only solve the" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.825, + 0.785, + 0.84 + ], + "angle": 0, + "content": "lower-level task with a fixed number of update steps. However, this leads to" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.447, + 0.129 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.222 + ], + "angle": 0, + "content": "lower-level tasks being not very well trained due to the small number of updates on \\(\\phi\\). To address this, we initialize \\(\\phi\\) from \\(\\phi^{i-1}\\), i.e., the result from the previous outer-loop iteration. Empirically, this leads to faster convergence of the lower-level tasks; we suspect that this is because \\(\\theta^i\\) and \\(\\theta^{i-1}\\) remain quite similar after one outer-loop update." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.223, + 0.788, + 0.344 + ], + "angle": 0, + "content": "The next subtle detail is when updating \\(\\theta\\) in Alg. 1 line 7. Recall, that depending on the adaptation method, the pre-trained parameters \\(\\theta\\) and adapted parameters \\(\\phi\\) may overlap. In such a scenario, there are two ways to compute the upper-level task's gradient: (a) we assume that \\(\\theta^{i-1}\\) and \\(\\phi^i\\) are separate parameters, i.e., the result of \\(\\phi^i\\) will not change \\(\\theta^{i-1}\\); (b) we update the overlapping parameters in \\(\\mathcal{U}\\) with the value from \\(\\phi^i\\), leading to line 7 in Alg. 1. Empirically, we found (b) to perform better. We conduct an ablation study for Alg. 1 lines 5 and 7 in Sec. 5.3, where we found both to improve immunization quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.346, + 0.788, + 0.468 + ], + "angle": 0, + "content": "Implementation details. To apply IMMA in practice, we approximate the solution of the lower-level task by taking a single gradient step for each of the adaptation methods. For the upper-level task, we use the Adam optimizer [22]. We choose \\( S \\) in Eq. (3) to contain only the cross-attention layer, i.e., only these layers are being optimized. This choice follows the intuition that cross-attention layers are important as they mix the features of the target concept and image representation. Additional hyperparameters and experiment details are documented in the appendix." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.493, + 0.561, + 0.509 + ], + "angle": 0, + "content": "4.2 Applications of model immunization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.786, + 0.539 + ], + "angle": 0, + "content": "Immunizing concept erased models. Recent works [13, 23, 51], reviewed" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.54, + 0.461, + 0.751 + ], + "angle": 0, + "content": "in Sec. 3, have shown that they can erase concepts from diffusion models without retraining the model from scratch. After a target concept \\(\\mathbf{c}'\\) is erased, the erased model \\(\\theta_{-\\mathbf{c}'}^p\\) can no longer generate that object or style given the concept's text prompt. However, in our experiments, we show that the model can easily re-learn the target concept again in just a few training epochs by using LoRA [20]. In Fig. 3, we illustrate that the erased stable diffusion (ESD [13])" + }, + { + "type": "image", + "bbox": [ + 0.472, + 0.54, + 0.632, + 0.733 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.637, + 0.542, + 0.781, + 0.731 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.471, + 0.736, + 0.785, + 0.765 + ], + "angle": 0, + "content": "Fig. 3: IMMA's result against re-learning. pt of artists' style." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.767, + 0.788, + 0.813 + ], + "angle": 0, + "content": "This motivated us to immunize the concept erased model \\(\\theta_{-\\mathbf{c}'}^p\\) to make the adaptation of re-learning \\(\\mathbf{c}'\\) more difficult. Ideally, the immunized model is no longer able to generate images of the target concept, i.e.," + }, + { + "type": "equation", + "bbox": [ + 0.348, + 0.824, + 0.788, + 0.843 + ], + "angle": 0, + "content": "\\[\np (\\tilde {\\mathbf {x}} | \\mathbf {c} ^ {\\prime}; \\mathcal {A} [ \\mathcal {I} (\\boldsymbol {\\theta} _ {- \\mathbf {c} ^ {\\prime}} ^ {p}) ]) \\approx 0, \\forall \\tilde {\\mathbf {x}} \\sim p (\\mathbf {x} | \\mathbf {c} ^ {\\prime}; \\boldsymbol {\\theta} ^ {p}). \\qquad (6)\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.252, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.159, + 0.788, + 0.266 + ], + "angle": 0, + "content": "Immunizing against personalization adaptation. Another potential for misuse is with personalization adaptation. Methods such as DreamBooth [39] or Textual Inversion [12] allow for a stable diffusion model to quickly learn to generate a personalized/unique concept given a few images of the unique concept. This motivated us to study immunization against these personalization adaptations. In practice, IMMA will be applied before a pre-trained model's release such that it fails to generate the unique concept even after adaptation." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.287, + 0.377, + 0.305 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.318, + 0.79, + 0.349 + ], + "angle": 0, + "content": "To evaluate IMMA, we conduct comprehensive experiments over multiple applications and adaptation methods." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.37, + 0.642, + 0.387 + ], + "angle": 0, + "content": "5.1 Immunizing erased models against re-learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.394, + 0.789, + 0.576 + ], + "angle": 0, + "content": "Experiment setup. We employ LoRA as the adaptation method, and the pre-trained erased models are from ESD [13] using their publicly released code base. Following ESD, we consider experiments on eight artistic styles including both well-recognized and modern artists, and ten object classes from a subset of ImageNet [9]. For immunization, we use 20 images generated by Stable Diffusion (SD V1-4), prior to erasing, with the prompt of the target artistic style or object class. For adaptation, we generate different 20 images for each dataset and use LoRA to fine-tune the erased model for 20 epochs. For style, the prompt used in the evaluation is \"An artwork by {artist name}\" For object, the prompt used in evaluation is \"a {concept}\", for example, \"a parachute\". We also evaluate on re-learning Not-Safe-For-Work (NSFW) content where we followed I2P prompts proposed by Schramowski et al. [42]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.577, + 0.79, + 0.668 + ], + "angle": 0, + "content": "Evaluation metrics. To measure the effect of immunization against re-learning, we aim for a metric that measures the performance gap with and without IMMA, where the larger value indicates a stronger effect of IMMA, and vice versa. For this, we propose Similarity Gap Ratio (SGR). Let \\(\\mathbf{x}_{\\mathcal{I}}\\) and \\(\\mathbf{x}_A\\) denote the generated images with and without IMMA, and \\(\\mathbf{x}_r\\) to be the reference images of the target concept then SGR is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.336, + 0.677, + 0.788, + 0.711 + ], + "angle": 0, + "content": "\\[\n\\operatorname {S G R} \\left(\\mathbf {x} _ {\\mathcal {I}}, \\mathbf {x} _ {\\mathcal {A}}, \\mathbf {x} _ {r}\\right) = \\frac {\\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {A}}\\right) - \\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {I}}\\right)}{\\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {A}}\\right)}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.789, + 0.796 + ], + "angle": 0, + "content": "where \\(\\mathcal{M}\\) is an image similarity metric. Common choices, following prior works [12, 13, 39], include Learned Perceptual Image Patch Similarity [52] (LPIPS), and similarity measured in the feature space of CLIP [12] or DINO [5] each denoted as SGR (L), SGR (C), and SGR (D). For consistency, we report one minus LPIPS, such that larger values for all three metrics mean higher image similarity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.789, + 0.842 + ], + "angle": 0, + "content": "User study. To check the quantitative metrics against human perception, we prepare four reference images and one pair of generated images (w/ and w/o IMMA) for the participants to select the generated image that is more similar to" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.447, + 0.128 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.595, + 0.162 + ], + "angle": 0, + "content": "the reference images in terms of content and quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.177, + 0.49, + 0.284 + ], + "angle": 0, + "content": "Results on style. In Tab. 1, we report SGR for re-learning artist styles for erased models. Over eight artists, we consistently observe a positive gap among all three SGR based on LPIPS, CLIP, and DINO with averages of \\(21.84\\%\\), \\(5.5\\%\\), and \\(23.35\\%\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.29, + 0.491, + 0.518 + ], + "angle": 0, + "content": "In Fig. 4, we directly show the LPIPS, CLIP, and DINO metrics at each epoch during the LoRA finetuning to visualize the gap. A lower value represents that the generated images are less similar to the reference images. Across all of the plots, we observe models without IMMA \\(\\uparrow\\) (orange) are more similar to the reference images than models with IMMA \\(\\downarrow\\) (blue). For artistic styles, the gap remains steady throughout the epochs. Overall, models with IMMA struggle to generate images containing the target concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.49, + 0.748 + ], + "angle": 0, + "content": "In Fig. 3, we provide qualitative comparisons. We observe that LoRA successfully re-learned the target concept (third column). On the other hand, the model with IMMA (last column) either generates an image with lower quality or an unrelated image. Our user study also validates this observation. All of the 30 respondents selected generations without IMMA as the one with high similarity and quality across all compared samples. This shows that models with IMMA generate worse images of the target styles." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.49, + 0.84 + ], + "angle": 0, + "content": "Results on objects. As in artistic styles, we report SGR of re-learning target objects for the erased models in Tab. 2. The average SGR (L), SGR (C), and SGR (D) across ten classes are \\(21.84\\%\\), \\(11.41\\%\\), and \\(41.62\\%\\). We also" + }, + { + "type": "table_caption", + "bbox": [ + 0.498, + 0.178, + 0.787, + 0.206 + ], + "angle": 0, + "content": "Table 1: SGR \\(\\uparrow (\\%)\\) on artistic styles for ESD with LoRA adaptation." + }, + { + "type": "table", + "bbox": [ + 0.501, + 0.208, + 0.785, + 0.255 + ], + "angle": 0, + "content": "
SGRVan GoghPablo PicassoTyler EdlinKelly McKernanKilian EngClaude MonetThomas KinkadeKirby Fagan
(L)17.6128.0828.6723.3426.7831.1418.4716.18
(C)4.774.565.879.344.597.279.441.18
(D)18.421.8126.0514.9925.7331.4839.5915.07
" + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.266, + 0.64, + 0.327 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.645, + 0.266, + 0.78, + 0.326 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.329, + 0.639, + 0.389 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.644, + 0.329, + 0.78, + 0.389 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.391, + 0.639, + 0.451 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.644, + 0.391, + 0.779, + 0.451 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.453, + 0.788, + 0.495 + ], + "angle": 0, + "content": "Fig. 4: Similarity vs. epochs for LoRA on styles. Models with IMMA achieve lower similarity throughout LoRA's epochs." + }, + { + "type": "table_caption", + "bbox": [ + 0.497, + 0.524, + 0.785, + 0.553 + ], + "angle": 0, + "content": "Table 2: SGR ↑(%) on objects for ESD with LoRA adaptation." + }, + { + "type": "table", + "bbox": [ + 0.5, + 0.554, + 0.784, + 0.602 + ], + "angle": 0, + "content": "
SGRCass. playerGarbage truckGas pumpChain sawEn. springerGolf ballchurchFrench hornParachuteTrench
(L)11.667.4816.6427.3322.4241.9610.096.8850.9739.14
(C)3.665.1819.728.7215.0810.6712.518.1119.3411.07
(D)12.1620.031.3150.8668.8558.0914.3330.2568.5661.84
" + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.612, + 0.639, + 0.673 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.645, + 0.612, + 0.779, + 0.673 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.675, + 0.639, + 0.734 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.645, + 0.675, + 0.779, + 0.734 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.738, + 0.639, + 0.797 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.645, + 0.738, + 0.779, + 0.797 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.798, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Fig.5: Similarity vs. epochs for LoRA on objects. Models with IMMA achieve lower similarity throughout LoRA's epochs." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.252, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 3: Acc. (\\%) of object erased models on 500 images. Col. 1: Original ESD model with the target concept erased. Col. 2: ESD without IMMA after LoRA. We observe that the target concept is successfully relearned. Col. 3: ESD with IMMA after LoRA. Col. 4 & 5: Acc. of other objects of ESD before and after IMMA." + }, + { + "type": "table", + "bbox": [ + 0.284, + 0.213, + 0.716, + 0.404 + ], + "angle": 0, + "content": "
Class name / MethodsAcc. of LoRA's target (↓)Acc. of others (↑)
ESDw/o IMMAw/ IMMAESDw/ IMMA
Cassette player0.22.00.272.046.4
Garbage truck3.040.87.663.825.5
Gas pump0.063.40.062.739.8
Chain saw0.015.20.879.352.5
EN springer0.415.60.867.249.6
Golf ball0.422.40.056.436.7
Church5.673.411.882.370.0
French horn0.280.20.464.957.6
Parachute2.091.00.078.858.9
Tench1.050.80.478.055.5
Average1.345.52.270.649.3
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.439, + 0.788, + 0.516 + ], + "angle": 0, + "content": "visualize LPIPS, CLIP, and DINO in Fig. 5. Overall, we observe the same trend as in the result for artistic styles. Similarity metrics across all the plots drop for models with IMMA. That is, with the same number of fine-tuning epochs, generations from models with IMMA exhibit lower quality or are less related to the object." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.52, + 0.788, + 0.61 + ], + "angle": 0, + "content": "As the target concept contains objects, we consider classification accuracy (ResNet50 pre-trained on ImageNet) for evaluation reported in Tab. 3. First, without IMMA, ESD can relearn to generate the object. With a mere three epochs of LoRA, the average accuracy of the target concept increased from \\(1.3\\%\\) to \\(45.5\\%\\). On the other hand, ESD with IMMA, the average accuracy remains low at \\(2.2\\%\\), demonstrating the effectiveness of IMMA at preventing relearning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.689 + ], + "angle": 0, + "content": "Thus far, the evaluation has focused on the target concept for IMMA models. We are also interested in how well IMMA preserves the other concepts. We define \"other concepts\" to be the remaining nine object categories beside the target object that is being adapted. In Tab. 3 (rightmost two columns), we observe that the original ESD has an average of \\(70.6\\%\\) and after IMMA the accuracy" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.49, + 0.84 + ], + "angle": 0, + "content": "dropped to \\(49.3\\%\\). We fully acknowledge that this is a limitation of IMMA. Prevention against certain target concepts may degrade other concepts. IMMA roughly trades off \\(43\\%\\) in the target concept with \\(20\\%\\) in other concepts. Finally, qualitative comparisons are shown in Fig. 6, where we observe the same conclusion that IMMA is effective against re-learning." + }, + { + "type": "image", + "bbox": [ + 0.494, + 0.69, + 0.788, + 0.844 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.446, + 0.128 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "image", + "bbox": [ + 0.288, + 0.145, + 0.701, + 0.281 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.285, + 0.789, + 0.314 + ], + "angle": 0, + "content": "Fig. 7: IMMA on NSFW content. We report the \\(\\%\\) of change, relative to SD V1-4, in the number of detected nudity content after LoRA on the nudity-erased model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.318, + 0.789, + 0.409 + ], + "angle": 0, + "content": "Results on NSFW. For experiments on NSFW concepts, we use SD V1-4 to generate 4,703 unsafe images, among which 351 images contain 454 nudity counts based on NudeNet [1] with a threshold of 0.05. We randomly select two sets of 50 images containing nudity and their corresponding prompts for relearning adaptation and the other for IMMA. The evaluation is conducted on the remaining 251 unsafe prompts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.41, + 0.789, + 0.515 + ], + "angle": 0, + "content": "In Fig. 7, we compare the percentage of change before and after IMMA adaptation with respect to the base SD V1-4 model. We observe that IMMA successfully generated less nudity content after LoRA, i.e., w/ IMMA achieved a negative \\(80\\%\\) of change in the detected nudity content compared to the negative \\(60\\%\\) change for the model without IMMA. This shows that IMMA successfully immunized the model making it more difficult to re-learn nudity from unsafe images/prompts." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.524, + 0.6, + 0.539 + ], + "angle": 0, + "content": "5.2 Immunizing against personalized content" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.545, + 0.789, + 0.681 + ], + "angle": 0, + "content": "Experiment setup. We consider three adaptation methods for learning new unique/personalized concepts: Textual Inversion (TI) [12], DreamBooth (DB) [39], and DreamBooth LoRA. For DreamBooth LoRA (DB LoRA), instead of modifying all of the parameters during fine-tuning, LoRA is applied on top of the cross-attention layers. We follow the exact adaptation procedures following prior works [12, 39], i.e., adding a special token for the new unique concept. Note, we use different novel tokens during adaptation and IMMA. This is because, for a realistic evaluation, we would not know the novel token that would be used during the adaptation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.682, + 0.789, + 0.742 + ], + "angle": 0, + "content": "We perform experiments on ten different datasets released by Kumari et al. [24] which include a variety of unique objects. Each of them contains four to six images taken in the real world. The evaluation prompt for all concepts in this section is \"A \\([V]\\) on the beach\" following DreamBooth." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.743, + 0.789, + 0.805 + ], + "angle": 0, + "content": "Evaluation metrics. In this task, we report SGR in Eq. (7) with CLIP and DINO following DreamBooth [39]. Next, to show that the model maintains its capability to be personalized for other concepts, we propose Relative Similarity Gap Ratio (RSGR), which is given by" + }, + { + "type": "equation", + "bbox": [ + 0.314, + 0.81, + 0.788, + 0.845 + ], + "angle": 0, + "content": "\\[\n\\operatorname {R S G R} \\left(\\mathbf {x} _ {\\mathcal {I}}, \\mathbf {x} _ {\\mathcal {A}}, \\mathbf {x} _ {\\mathcal {I}} ^ {o}, \\mathbf {x} _ {\\mathcal {A}} ^ {o}\\right) = \\frac {\\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {o} , \\mathbf {x} _ {\\mathcal {I}} ^ {o}\\right) - \\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} , \\mathbf {x} _ {\\mathcal {I}}\\right)}{\\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {o} , \\mathbf {x} _ {\\mathcal {I}} ^ {o}\\right)}, \\tag {8}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.252, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.784, + 0.173 + ], + "angle": 0, + "content": "Table 4: SGR (%) on personalized content adaptation. Higher positive values indicate better immunization quality." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.175, + 0.783, + 0.255 + ], + "angle": 0, + "content": "
castlecarchairglassesinstrumentwoodenpotlighthousemotorbikehouseplantpurseAverage
TISGR(C)9.358.328.5513.788.610.757.8212.1615.355.809.05
SGR(D)53.4937.0840.1928.5048.857.0436.3348.3641.2324.4336.55
DBSGR(C)2.0314.44-8.600.912.185.80-1.192.371.213.592.27
SGR(D)12.5627.01-14.6713.3724.6429.31-7.410.759.2124.9711.97
DBSGR(C)8.6017.490.2511.7313.662.167.670.980.053.586.62
LoraSGR(D)43.2134.378.9437.6340.3832.7048.366.4024.880.5227.74
" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.265, + 0.784, + 0.292 + ], + "angle": 0, + "content": "Table 5: RSGR (%) on personalized content adaptation. Higher positive values indicate better performance at maintaining other concepts." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.295, + 0.783, + 0.376 + ], + "angle": 0, + "content": "
castle car chair glasses instrument woodenpot lighthouse motorbike houseplant purse Average
TIRSGR (C)15.2420.198.499.7819.148.8920.5718.5916.320.9913.82
RSGR (D)70.6963.5722.540.157.6634.1551.8567.1855.228.8847.18
DBRSGR (C)19.6613.636.624.974.444.6116.536.085.1210.369.20
RSGR (D)36.9935.9817.7232.0424.5923.2835.062.6025.0550.128.34
DBRSGR (C)17.5521.004.493.8912.248.4224.288.6711.774.8311.71
LoRARSGR (D)49.6641.5718.925.4129.9235.9253.1228.6341.0224.7434.89
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.393, + 0.785, + 0.423 + ], + "angle": 0, + "content": "where \\(\\mathbf{x}_{\\mathcal{A}}^o\\) and \\(\\mathbf{x}_{\\mathcal{I}}^o\\) are generated images without and with IMMA on other unique concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.44, + 0.489, + 0.651 + ], + "angle": 0, + "content": "The term \\(\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}^{o},\\mathbf{x}_{\\mathcal{I}}^{o})\\) captures image similarity for other concepts with and without IMMA. Ideally, this term should be high as IMMA should not affect other concepts. The term \\(\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}},\\mathbf{x}_{\\mathcal{I}})\\) captures the image similarity for target concepts with and without IMMA. In this case, the similarity should be low. RSGR reports the difference between these two terms as a ratio. Intuitively, larger RSGR indicates IMMA is better at preserving the other concepts while removing the target concept." + }, + { + "type": "image", + "bbox": [ + 0.499, + 0.426, + 0.645, + 0.484 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.649, + 0.426, + 0.78, + 0.484 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.499, + 0.485, + 0.645, + 0.543 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.649, + 0.485, + 0.78, + 0.543 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.499, + 0.545, + 0.645, + 0.603 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.65, + 0.545, + 0.78, + 0.603 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.604, + 0.785, + 0.646 + ], + "angle": 0, + "content": "Fig. 8: CLIP and DINO similarity on other concept vs. target concept. The gap between the two lines shows RSGR." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.654, + 0.784, + 0.683 + ], + "angle": 0, + "content": "We also conducted a user study for personalized adaptation using the setting as in Sec. 5.1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.687, + 0.784, + 0.763 + ], + "angle": 0, + "content": "Results on personalization. In Tab. 4 we observe a positive ratio among most of the SGR metrics, except for \"furniture chair\" and \"lighthouse\" with Dreambooth highlighted in red. We show the generations with negative SGR in the appendix. Overall, IMMA effectively prevents the pre-trained model from learning personalization concepts across the three adaptation methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Next, Tab. 5 reports RSGR to evaluate how well IMMA preserves the ability to personalize other concepts. As we can see, the RSGR values are consistently positive across all the datasets. This indicates IMMA immunizes against the target concept without hurting the adaptability for personalizing for other concepts. We directly visualize this relative gap in Fig. 8. As shown, the lines of the nine concepts" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.446, + 0.128 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "image_caption", + "bbox": [ + 0.312, + 0.147, + 0.379, + 0.159 + ], + "angle": 0, + "content": "Reference" + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.161, + 0.391, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.393, + 0.165, + 0.413, + 0.229 + ], + "angle": 0, + "content": "YNNNI O/A" + }, + { + "type": "image_caption", + "bbox": [ + 0.452, + 0.147, + 0.471, + 0.158 + ], + "angle": 0, + "content": "TI" + }, + { + "type": "image", + "bbox": [ + 0.419, + 0.161, + 0.508, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.545, + 0.147, + 0.567, + 0.159 + ], + "angle": 0, + "content": "DB" + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.161, + 0.601, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.614, + 0.147, + 0.682, + 0.159 + ], + "angle": 0, + "content": "DB LoRA" + }, + { + "type": "image", + "bbox": [ + 0.603, + 0.161, + 0.695, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.234, + 0.392, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.396, + 0.234, + 0.508, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.234, + 0.601, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.603, + 0.234, + 0.695, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.31, + 0.391, + 0.384 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.397, + 0.31, + 0.508, + 0.383 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.31, + 0.601, + 0.383 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.603, + 0.31, + 0.695, + 0.383 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.385, + 0.391, + 0.456 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.397, + 0.385, + 0.508, + 0.456 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.385, + 0.601, + 0.456 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.603, + 0.385, + 0.695, + 0.456 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.289, + 0.461, + 0.706, + 0.476 + ], + "angle": 0, + "content": "Fig. 9: Personalization adaptation w/ and w/o IMMA." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.482, + 0.785, + 0.511 + ], + "angle": 0, + "content": "\\((\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}^{o}, \\mathbf{x}_{\\mathcal{I}}^{o}) \\uparrow\\) in green) and the adaptation of the target concept \\((\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}, \\mathbf{x}_{\\mathcal{I}}) \\downarrow\\) in blue) can be easily distinguished; consistent with results in Tab. 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.513, + 0.787, + 0.603 + ], + "angle": 0, + "content": "Lastly, we show the generated images in Fig. 9. Comparing the generated images with and without IMMA, we observe models with IMMA are either unable to learn the target concept or generate unrealistic images. We also conducted a user study to validate this observation. All of the 30 participants selected generation without IMMA to be more similar to reference images, i.e., models after IMMA fail to generate the target concepts." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.62, + 0.437, + 0.633 + ], + "angle": 0, + "content": "5.3 Additional discussion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.643, + 0.785, + 0.703 + ], + "angle": 0, + "content": "Comparison with data poisoning. We compare IMMA with MIST [27], one of the data poisoning (DP) methods in the personalized content setup. In Fig. 10 (top-row) we show both MIST and IMMA successfully prevent the model from learning the target concept after Textual Inversion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.785, + 0.748 + ], + "angle": 0, + "content": "This observation is also supported by a user study. On seven out of ten evaluated datasets, the majority of the 30 users found the generation without MIST to be of higher quality and more similar to the reference images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Adaption on images with JPEG compression. As reported in MIST [27], one way to weaken the effect of poisoned data is by compressing the images with JPEG after adaptation. On the other hand, IMMA can defend against JPEG compression by including JPEG images in the training data. In Fig. 10 (bottom row), we observe that after compression, MIST fails to prevent generating the target concept, while IMMA remains robust against JPEG." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.252, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.319, + 0.145, + 0.431, + 0.244 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.321, + 0.246, + 0.432, + 0.33 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.434, + 0.181, + 0.45, + 0.223 + ], + "angle": 0, + "content": "eae" + }, + { + "type": "image", + "bbox": [ + 0.453, + 0.145, + 0.565, + 0.244 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.455, + 0.245, + 0.565, + 0.331 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.567, + 0.145, + 0.678, + 0.244 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.568, + 0.245, + 0.678, + 0.331 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.332, + 0.788, + 0.361 + ], + "angle": 0, + "content": "Fig. 10: MIST vs. IMMA. Generation with Textual Inversion on training images w/ and w/o JPEG compression." + }, + { + "type": "image", + "bbox": [ + 0.329, + 0.365, + 0.441, + 0.464 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.443, + 0.365, + 0.555, + 0.463 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.558, + 0.365, + 0.669, + 0.463 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.464, + 0.788, + 0.493 + ], + "angle": 0, + "content": "Fig. 11: Ablation on direct maximization. DreamBooth adaptation on \"luggage purse\" after immunization on \"woodenpot\"." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.516, + 0.789, + 0.592 + ], + "angle": 0, + "content": "Ablation studies. We conduct ablations using the DreamBooth personalization setup in Sec. 5.2. First, we experiment with a direct maximization baseline, i.e., only the upper-level task in Eq. (3). Results are shown in Fig. 11. We observe that direct maximization ruins the immunized model, i.e., low image quality when being adapted for another concept." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.593, + 0.789, + 0.684 + ], + "angle": 0, + "content": "Next, we ablate line 5 and line 7 in Alg. 1 and report CLIP similarity. Shown in Fig. 12 (left), without line 5, the adaptation can learn the target concept, i.e., high CLIP similarity. Next, we ablate whether to update the overlapping parameters in \\(\\phi\\) by removing line 7. The result is shown in Fig. 12 (right). We observe that without line 7, the adaptation successfully learns the target concept. These results show the necessity of the proposed steps in Alg. 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.686, + 0.789, + 0.807 + ], + "angle": 0, + "content": "Crossed adaptation with IMMA. Thus far, we report results for IMMA by immunizing the model against the same adaptation method \\(\\mathcal{A}\\). We now investigate whether IMMA remains effective under a different adaptation method during IMMA and adaptation. In other words, we consider IMMA with crossed adaptation methods, where we immunize the pre-trained model using \\(\\mathcal{A}_1\\) and perform malicious adaptation on \\(\\mathcal{A}_2\\). Fig. 13 shows the qualitative results across DB and TI. We observe that the model with IMMA against DreamBooth is also effective when being adapted with Textual Inversion, and vice versa." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Limitations. Our proposed IMMA and experiments focus on the immunization of a single concept. In this work, we methodically study a variety of adaptation" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.446, + 0.128 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.144, + 0.498, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.144, + 0.777, + 0.267 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.321, + 0.27, + 0.68, + 0.284 + ], + "angle": 0, + "content": "Fig. 12: Ablation on line 5 and line 7 of Alg. 1." + }, + { + "type": "image", + "bbox": [ + 0.31, + 0.294, + 0.685, + 0.495 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.504, + 0.788, + 0.531 + ], + "angle": 0, + "content": "Fig. 13: Results on crossed adaptation immunization. First row: DB after IMMA with either DB or TI. Second row: TI after IMMA the model with either DB or TI." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.546, + 0.788, + 0.622 + ], + "angle": 0, + "content": "settings and leave the support for multiple concepts for future work. We believe that results in a single concept demonstrate a convincing step towards model immunization. If the reader is interested, we present preliminary results in the Appendix showing that IMMA can generalize to multiple concepts, albeit, not as comprehensive as the single concept study." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.644, + 0.36, + 0.659 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.789, + 0.841 + ], + "angle": 0, + "content": "We propose to Immunize Models against Malicious Adaptation (IMMA). Unlike the data-poisoning paradigm, which protects images, our method focuses on protecting pre-trained models from being used by adaptation methods. We formulate \"Immunization\" as a bi-level optimization program to learn a poor model initialization that would make adaptation more difficult. To validate the efficacy of IMMA, we conduct extensive experiments on relearning concepts for erased models and immunizing against the adaptation of personalized content. We believe that model immunization is a promising paradigm for combatting the risk of malicious adaptation, and that IMMA is an encouraging first step. We are hopeful that the advancement of IMMA will result in safer open-source text-to-image models, benefiting both the research community and society." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.252, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.179, + 0.787, + 0.225 + ], + "angle": 0, + "content": "1. Bedapudi, P.: NudeNet: Neural nets for nudity classification, detection and selective censoring. https://github.com/plateminto/NudeNetClassifier (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.226, + 0.787, + 0.255 + ], + "angle": 0, + "content": "2. Bengio, Y.: Gradient-based optimization of hyperparameters. Neural Computation (2000)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.257, + 0.787, + 0.286 + ], + "angle": 0, + "content": "3. Biggio, B., Nelson, B., Laskov, P.: Support vector machines under adversarial label noise. In: Proc. ACML (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.288, + 0.787, + 0.318 + ], + "angle": 0, + "content": "4. Bird, C., Ungless, E., Kasirzadeh, A.: Typology of risks of generative text-to-image models. In: Proc. AIES (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.319, + 0.787, + 0.363 + ], + "angle": 0, + "content": "5. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.365, + 0.787, + 0.394 + ], + "angle": 0, + "content": "6. CreativeML Open RAIL-M: Stable Diffusion LICENSE File (2023), URL https://github.com/CompVis/stable-diffusion/blob/main/License" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.396, + 0.787, + 0.486 + ], + "angle": 0, + "content": "7. Dai, X., Hou, J., Ma, C.Y., Tsai, S., Wang, J., Wang, R., Zhang, P., Vandenhende, S., Wang, X., Dubey, A., Yu, M., Kadian, A., Radenovic, F., Mahajan, D., Li, K., Zhao, Y., Petrovic, V., Singh, M.K., Motwani, S., Wen, Y., Song, Y., Sumbaly, R., Ramanathan, V., He, Z., Vajda, P., Parikh, D.: Emu: Enhancing image generation models using photogenic needles in a haystack. arXiv preprint arXiv:2309.15807 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.488, + 0.787, + 0.517 + ], + "angle": 0, + "content": "8. DeepFloyd Lab at StabilityAI: DeepFloyd IF. https://github.com/deepfloyd/IF (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.518, + 0.787, + 0.548 + ], + "angle": 0, + "content": "9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: ImageNet: A large-scale hierarchical image database. In: Proc. CVPR (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.549, + 0.787, + 0.578 + ], + "angle": 0, + "content": "10. Dhariwal, P., Nichol, A.: Diffusion models beat GANs on image synthesis. In: Proc. NeurIPS (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.58, + 0.787, + 0.609 + ], + "angle": 0, + "content": "1. Finn, C., Abbeel, P., Levine, S.: Model-agnostic meta-learning for fast adaptation of deep networks. In: Proc. ICML (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.611, + 0.787, + 0.655 + ], + "angle": 0, + "content": "2. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: Proc. ICLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.657, + 0.787, + 0.686 + ], + "angle": 0, + "content": "3. Gandikota, R., Materzyńska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. In: Proc. ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.688, + 0.787, + 0.717 + ], + "angle": 0, + "content": "4. Gandikota, R., Orgad, H., Belinkov, Y., Materzyńska, J., Bau, D.: Unified concept editing in diffusion models. In: Proc. WACV (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.719, + 0.787, + 0.748 + ], + "angle": 0, + "content": "5. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: Proc. ICLR (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.75, + 0.787, + 0.809 + ], + "angle": 0, + "content": "6. Harwell, D.: AI-generated child sex images spawn new nightmare for the web. The Washington Post (2023), URL https://www.washingtonpost.com/technology/2023/06/19/artificial-intelligence-child-sex-abuse-images/" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.811, + 0.787, + 0.84 + ], + "angle": 0, + "content": "7. Heikkilä, M.: This artist is dominating ai-generated art. and he's not happy about it. MIT Technology Review. Retrieved March 16, 2023 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.179, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.446, + 0.128 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.177 + ], + "angle": 0, + "content": "18. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. arXiv preprint arXiv:2305.10120 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.179, + 0.787, + 0.208 + ], + "angle": 0, + "content": "19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Proc. NeurIPS (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.21, + 0.787, + 0.254 + ], + "angle": 0, + "content": "20. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: LoRA: Low-rank adaptation of large language models. In: Proc. ICLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.256, + 0.787, + 0.285 + ], + "angle": 0, + "content": "21. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: Proc. NeurIPS (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.316 + ], + "angle": 0, + "content": "22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: Proc. ICLR (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.318, + 0.787, + 0.348 + ], + "angle": 0, + "content": "23. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: Proc. ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.349, + 0.787, + 0.379 + ], + "angle": 0, + "content": "24. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proc. CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.38, + 0.787, + 0.425 + ], + "angle": 0, + "content": "25. Larsen, J., Hansen, L.K., Svarer, C., Ohlsson, M.: Design and regularization of neural networks: the optimal use of a validation set. In: IEEE Signal Processing Society Workshop (1996)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.426, + 0.787, + 0.455 + ], + "angle": 0, + "content": "26. Liang, C., Wu, X.: Mist: Towards improved adversarial examples for diffusion models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.457, + 0.787, + 0.502 + ], + "angle": 0, + "content": "27. Liang, C., Wu, X., Hua, Y., Zhang, J., Xue, Y., Song, T., Xue, Z., Ma, R., Guan, H.: Adversarial example does good: Preventing painting imitation from diffusion models via adversarial examples. In: Proc. ICML (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.504, + 0.787, + 0.533 + ], + "angle": 0, + "content": "28. Lorraine, J., Vicol, P., Duvenaud, D.: Optimizing millions of hyperparameters by implicit differentiation. In: Proc. AISTATS (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.535, + 0.787, + 0.564 + ], + "angle": 0, + "content": "29. Mei, S., Zhu, X.: Using machine teaching to identify optimal training-set attacks on machine learners. In: Proc. AAAI (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.787, + 0.624 + ], + "angle": 0, + "content": "30. Moore, S.: Can the law prevent AI from duplicating actors? It's complicated. Forbes (Jul 2023), URL https://www.forbes.com/sites/schuylermoore/2023/07/13/proTECTing-celebrities-including-all-actors-from-ai-with-the-right-of-publicity/?sh=5c56ba4159ec" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.626, + 0.787, + 0.671 + ], + "angle": 0, + "content": "31. Nichol, A.Q., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., Mcgrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. In: Proc. ICML (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.673, + 0.787, + 0.702 + ], + "angle": 0, + "content": "32. Noveck, J., O'Brien, M.: Visual artists sue ai companies in sf federal court for repurposing their work. Associated Press (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.704, + 0.787, + 0.748 + ], + "angle": 0, + "content": "33. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: SDXL: improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.749, + 0.787, + 0.794 + ], + "angle": 0, + "content": "34. Qu, Y., Shen, X., He, X., Backes, M., Zannettou, S., Zhang, Y.: Unsafe diffusion: On the generation of unsafe images and hateful memes from text-to-image models. arXiv preprint arXiv:2305.13873 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.796, + 0.787, + 0.84 + ], + "angle": 0, + "content": "35. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with CLIP latents. arXiv preprint arXiv:2204.06125 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.253, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.177 + ], + "angle": 0, + "content": "36. Rando, J., Paleka, D., Lindner, D., Heim, L., Tramér, F.: Red-teaming the stable diffusion safety filter. In: Proc. NeurIPS ML Safety Workshop (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.208 + ], + "angle": 0, + "content": "37. Ren, Z., Yeh, R., Schwing, A.: Not all unlabeled data are equal: Learning to weight data in semi-supervised learning (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.209, + 0.788, + 0.252 + ], + "angle": 0, + "content": "38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proc. CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.253, + 0.788, + 0.298 + ], + "angle": 0, + "content": "39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: DreamBooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proc. CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.299, + 0.788, + 0.358 + ], + "angle": 0, + "content": "40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: Proc. NeurIPS (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.359, + 0.788, + 0.389 + ], + "angle": 0, + "content": "41. Salman, H., Khaddaj, A., Leclerc, G., Ilyas, A., Madry, A.: Raising the cost of malicious AI-powered image editing. In: Proc. ICML (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.39, + 0.788, + 0.433 + ], + "angle": 0, + "content": "42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proc. CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.434, + 0.788, + 0.508 + ], + "angle": 0, + "content": "43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5B: An open large-scale dataset for training next generation image-text models. In: Proc. NeurIPS (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.554 + ], + "angle": 0, + "content": "44. Shan, S., Cryan, J., Wenger, E., Zheng, H., Hanocka, R., Zhao, B.Y.: Glaze: Protecting artists from style mimicry by text-to-image models. In: USENIX Security Symposium (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.555, + 0.788, + 0.584 + ], + "angle": 0, + "content": "45. SmithMano: Tutorial: How to remove the safety filter in 5 seconds. Reddit (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.585, + 0.788, + 0.629 + ], + "angle": 0, + "content": "46. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: Proc. ICML (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.63, + 0.788, + 0.659 + ], + "angle": 0, + "content": "47. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: Proc. NeurIPS (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.69 + ], + "angle": 0, + "content": "48. Vincent, P.: A connection between score matching and denoising autoencoders. Neural computation (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.691, + 0.788, + 0.734 + ], + "angle": 0, + "content": "49. Wang, Z., Chen, C., Liu, Y., Lyu, L., Metaxas, D., Ma, S.: How to detect unauthorized data usages in text-to-image diffusion models. arXiv preprint arXiv:2307.03108 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.765 + ], + "angle": 0, + "content": "50. Yeh, R.A., Hu, Y.T., Hasegawa-Johnson, M., Schwing, A.: Equivariance discovery by learned parameter-sharing. In: Proc. AISTATS (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.766, + 0.788, + 0.809 + ], + "angle": 0, + "content": "51. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.84 + ], + "angle": 0, + "content": "52. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proc. CVPR (2018)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.446, + 0.129 + ], + "angle": 0, + "content": "A.Y. Zheng and R.A. Yeh" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.146, + 0.788, + 0.192 + ], + "angle": 0, + "content": "53. Zhao, Z., Duan, J., Hu, X., Xu, K., Wang, C., Zhang, R., Du, Z., Guo, Q., Chen, Y.: Unlearnable examples for diffusion models: Protect data from unauthorized exploitation. arXiv preprint arXiv:2306.01902 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.193, + 0.787, + 0.223 + ], + "angle": 0, + "content": "54. Zheng, A.Y., He, T., Qiu, Y., Wang, M., Wipf, D.: Graph machine learning through the lens of bilevel optimization. In: Proc. AISTATS (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.224, + 0.787, + 0.253 + ], + "angle": 0, + "content": "55. Zheng, A.Y., Yang, C.A., Yeh, R.A.: Learning to obstruct few-shot image classification over restricted classes. In: Proc. ECCV (2024)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.146, + 0.788, + 0.253 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_origin.pdf b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5b96f051270917efe63ac5353f75bc52e095b78b --- /dev/null +++ b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/22ff8807-f0da-4fdc-91ca-432433406e4d_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6f0516f70c3c2eb0ddeebbe32ab263f01d31a725f8c01798f81b0ce5c86cd392 +size 10575168 diff --git a/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/full.md b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..43fd75354438c15b5438a8211462646357dee7a5 --- /dev/null +++ b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/full.md @@ -0,0 +1,425 @@ +# IMMA: Immunizing text-to-image Models against Malicious Adaptation + +Amber Yijia Zheng Raymond A. Yeh + +Department of Computer Science, Purdue University {zheng709, rayyeh}@purdue.edu + +Abstract. Advancements in open-sourced text-to-image models and fine-tuning methods have led to the increasing risk of malicious adaptation, i.e., fine-tuning to generate harmful/ unauthorized content. Recent works, e.g., Glaze or MIST, have developed data-poisoning techniques which protect the data against adaptation methods. In this work, we consider an alternative paradigm for protection. We propose to "immunize" the model by learning model parameters that are difficult for the adaptation methods when fine-tuning malicious content; in short IMMA. Specifically, IMMA should be applied before the release of the model weights to mitigate these risks. Empirical results show IMMA's effectiveness against malicious adaptations, including mimicking the artistic style and learning of inappropriate/unauthorized content, over three adaptation methods: LoRA, Textual-Inversion, and DreamBooth. The code is available at https://github.com/amberyzheng/IMMA. + +# 1 Introduction + +With the open-source of large-scale text-to-image models [8, 38] the entry barrier to generating images has been drastically lowered. Building on top of these models, methods such as Textual Inversion [12], DreamBooth [39], and LoRA [20] allow quick adaptation to generate personalized content. These newly introduced capabilities come with great responsibility and trust in individuals to do good instead of harm to society. Unfortunately, the capabilities of adapting text-to-image generative models have already had negative impacts, e.g., the generation of sexual content [16], copying artists' work without consent [17, 32], duplicating celebrity images [30], etc. We broadly encapsulate all these harmful fine-tuning of models under the term malicious adaptation. + +To countermeasure these adaptations, open-source models have users agree that they will not use the software for "the purpose of harming others" in their licenses [6] or implement safety checks that would censor inappropriate generated content [36]. Nonetheless, these approaches do not have real enforcing power. Users can trivially disregard the license and remove the safety filters [45]. + +To address these loopholes, recent data poisoning techniques have shown a promising path towards preventing malicious adaptations [27, 41, 44]. The main idea is to protect images by modifying them with imperceivable changes, e.g., adversarial noise, such that adaptation methods confuse the style and content of + +the images and fail to generalize. A key shortcoming of these methods is that the burden of enforcement is on content creators. The artists need to apply these techniques before releasing their artwork. Contrarily, we present an alternative paradigm that places this burden on the releaser of open-source models. + +In this paper, we propose to "Immunize" Models, i.e., make them more resilient, against Malicious Adaptation; in short IMMA. The goal of IMMA is to make adaptation more difficult for concepts that are deemed malicious while maintaining the models' adaptability for other concepts. At a high level, we propose an algorithm to learn model parameters that perform poorly when being adapted to malicious concepts, e.g., mimicry artistic style. In Fig. 1, we illustrate the effect of IMMA when mimicking Picasso's style; the model + +![](images/f99c41e71bab2f28c8c2af6ab27bc584c4aa9ae5b9d2ca0013f22d8aa3b430d3.jpg) +Fig. 1: IMMA on artistic style mimicry. Higher 1 - LPIPS indicates more similar to the reference images. IMMA successfully prevented the mimicking of the artistic style. + +To demonstrate the effectiveness of IMMA, we consider three adaptation methods, namely, Textual Inversion [12], DreamBooth [39], and LORA [20]. We experimented with immunizing against several malicious settings, including, mimicking artistic styles, restoring erased concepts, and learning personalized concepts. Overall, IMMA successfully makes text-to-image models more resilient against adaptation to malicious concepts while maintaining the usability of the model. Our contributions are as follows: + +- We propose a novel paradigm for preventing malicious adaptations. In contrast to the data poisoning for protection paradigm, we aim to protect the model instead of the data. See Fig. 2. +- We present an algorithm (IMMA) that learns difficult model initialization for the adaptation methods. +- We conduct extensive experiments evaluating IMMA against various malicious adaptations. + +# 2 Related Work + +Diffusion models. By learning to reverse a process of transforming data into noise, diffusion models achieve impressive generative capabilities [10, 19, 46]. With the aid of Internet-scale datasets [43], these models are capable of generating diverse images with high realism [7, 8, 31, 33, 35, 38, 40]. This progress led to new excitements in artificial intelligence generated content (AIGC) and interest in how to mitigate the associated risks, which we discuss next. + +Preventing generative AI misuse. There are many potential risks associated with the advancement in generative capabilities [4, 34]. Recent works have started to address these risks. For example, Wang et al. [49] study how to detect + +![](images/5259b1ca8f85734bb3579469495ff09e9c411eff6d20506f0fcdf9c694237c2f.jpg) +Fig.2: Paradigms for preventing malicious adaptation. Data poisoning: modify training images $\mathbf{x}'$ with imperceivable changes, such that $\mathcal{A}$ fails to capture $\mathbf{c}'$ by training with modified images. Model immunization (ours): modify pre-trained model weights $\theta^p$ with immunization methods $\mathcal{I}$ before adaptation $\mathcal{A}$ , such that $\mathcal{A}$ fails to capture $\mathbf{c}'$ by training on immunized model weights $\mathcal{I}(\theta^p)$ . + +![](images/40ff95258068cbe3c6007ca3c1e6ed578f449fbc307f709fbcdf7326a8eda493.jpg) + +unauthorized images that are used in the training set of these models. Schramowski et al. [42] study how to suppress the generation of inappropriate content, e.g., nudity, self-harm, etc., during diffusion's generation process. Other works [13, 14, 18, 23, 51], take a further step in trying to remove these inappropriate content from the diffusion models. + +More closely related to this work, GLAZE [44], MIST [26, 27], and EUDP [53] studied the misuse of artistic mimicry, i.e., preventing diffusion models from being used to copy artistic styles. Salman et al. [41] have also studied how to raise the cost of image manipulation using diffusion models. Notably, these works aim to protect the image, i.e., a form of data-poisoning [3, 29] which modifies the data, e.g., adding adversarial noise [15], such that the adaptation techniques fail. Different from these works, we protect the model, against misuse, i.e., model immunization. We illustrate the difference between our proposed model immunization vs. data poisoning in Fig. 2. + +Meta-learning. As our approach to model immunization is based on learning against an adaptation method, we briefly review meta-learning; also known as learning to learn. The area covers learning many aspects of a learning algorithm, e.g., learning good initialization suitable to adaptation [11], or other hyperparameters, e.g., learning rate, or weight decay, via hypergradient [2, 25, 28, 37, 50, 54, 55]. Various hypergradients approximations have been proposed, e.g., MAML [11] uses a single step gradient unrolling, with a summary provided by Lorraine et al. [28]. Different from these works, we aim to learn poor initializations for the adaptation methods to prevent the misuse of generative models. + +# 3 Preliminaries + +We briefly review the concepts necessary to understand our approach and introduce a common notation. + +Text-to-image diffusion models. The goal of a text-to-image diffusion model [38] is to learn a conditional distribution of images $\mathbf{x}$ given concept embedding $\mathbf{c}$ , i.e., modeling $p(\mathbf{x}|\mathbf{c};\theta)$ , where $\theta$ denotes the model parameters. The learning objective is formulated via variational lower bound [19, 21] or from a denoising + +score-matching perspective [47, 48] which boils down to minimizing + +$$ +L (\mathbf {x}, \mathbf {c}; \theta) = \mathbb {E} _ {t, \epsilon \sim \mathcal {N} (0, I)} \left[ w _ {t} \| \epsilon_ {\theta} (\mathbf {x} _ {t}, \mathbf {c}, t) - \epsilon \| _ {2} ^ {2} \right], \tag {1} +$$ + +where $\epsilon_{\theta}$ denotes the denoising network, $\mathbf{x}_t$ and $w_t$ denote the noised images and loss weights for a given time-step $t \sim \mathcal{U}\{0, T\}$ sampled from a discrete uniform distribution. + +Concept erasing methods. To erase a target concept $c'$ from a model, erasing algorithms [13, 23] fine-tunes a pre-trained model's parameters $\theta^p$ such that the model no longer generate images corresponding to that concept, i.e., + +$$ +p \left(\tilde {\boldsymbol {x}} \mid \mathbf {c} ^ {\prime}; \theta_ {- \mathbf {c} ^ {\prime}} ^ {p}\right) \approx 0, \forall \tilde {\boldsymbol {x}} \sim p \left(\mathbf {x} \mid \mathbf {c} ^ {\prime}; \theta^ {p}\right), \tag {2} +$$ + +where $\theta_{-\mathbf{c}'}^p$ denotes the parameters of the erased model after fine-tuning. The main idea is to train the target concept to generate images of some other concept. A common choice is an empty token, i.e., the model performs unconditional generation when prompted with the target concept $c'$ . + +Personalization of text-to-image diffusion models. In contrast to erasing a concept, personalization algorithms aim to add a novel concept to the pre-trained model. Given a set of images $\{\mathbf{x}'\}$ representative of the concept $\mathbf{c}'$ . Personalization methods introduce a novel token $[V]$ in the word space and train the model to associate $[V]$ to the new concept. To learn this new concept, the model is trained using the data pair $(\mathbf{x}', \mathbf{c}')$ , where $\mathbf{c}' \triangleq \Gamma([V])$ is extracted with the text encoder $\Gamma$ using the novel word token $[V]$ . We broadly use the notation $L_{\mathcal{A}}(\mathbf{x}', \mathbf{c'}; \theta, \phi)$ to denote the loss function of each adaptation method $\mathcal{A}$ , where $\phi$ denotes the parameters that are being fine-tuned. For example, DreamBooth [24, 39] finetunes on a subset of parameters, e.g., cross-attention layers, whereas Textual Inversion [12] only optimizes the new word token. + +Another common approach to make the fine-tuning more data efficient is to use Low-Rank Adaptation (LoRA) [20]. Given a pre-trained weight $\theta^p \in \mathbb{R}^{n \times d}$ , LoRA aims to learn an adaptor $\Delta$ , such that the final weights become $\hat{\theta} = \theta^p + \Delta$ . LoRA specifically restricts the $\Delta$ to be low-rank, i.e., $\Delta = AB$ where $A \in \mathbb{R}^{n \times r}$ and $B \in \mathbb{R}^{r \times d}$ with $r \ll \min(n, d)$ . In this work, we show that LoRA can easily learn back the concepts that were previously erased which highlights the need for our proposed research direction of model immunization. + +# 4 Approach + +Given a pre-trained text-to-image model with parameters $\theta^p$ , e.g., StableDiffusion [38], existing adaptation methods $\mathcal{A}$ [12, 20, 24, 39] can fine-tune $\theta^p$ such that the model generates images of a concept $\mathbf{c}'$ . Our goal is to prevent the adaptation methods from successfully doing so on harmful concepts, e.g., unauthorized artistic style. To accomplish this, we present an algorithm IMMA $\mathcal{I}$ that takes pre-trained parameters $\theta^p$ as input, and outputs the immunized parameters $\theta^I$ . When applying adaptation $\mathcal{A}$ with $\theta^I$ , it should fail to learn the concept $\mathbf{c}'$ , i.e., the model is "immunized" against adaptation. At a high level, IMMA aims to learn a poor model initialization when being fine-tuned by the adaptation methods. We now describe the algorithmic details. + +# 4.1 Model immunization + +To achieve this goal of learning a poor initialization for adaptation, we propose the following bi-level program: + +$$ +\overbrace {\max _ {\theta \in \mathcal {S}} L _ {\mathcal {A}} \left(\mathbf {x} _ {\mathcal {I}} ^ {\prime} , \mathbf {c} ^ {\prime} ; \theta , \phi^ {\star}\right)} ^ {\text {u p p e r - l e v e l t a k}} \text {s . t .} \phi^ {\star} = \overbrace {\operatorname* {a r g m i n} _ {\phi} L _ {\mathcal {A}} \left(\mathbf {x} _ {\mathcal {A}} ^ {\prime} , \mathbf {c} ^ {\prime} ; \theta , \phi\right)} ^ {\text {l o w e r - l e v e l t a k}}. \tag {3} +$$ + +Here, the set $\mathcal{S}$ denotes a subset of $\theta$ that is trained by IMMA. This set is a hyperparameter that we choose empirically. Given a dataset of images $\mathcal{D} = \{\mathbf{x}'\}$ representative of the concept $\mathbf{c}'$ , we sample the training data $\mathbf{x}_{\mathcal{A}}'$ and $\mathbf{x}_{\mathcal{D}}'$ independently. As reviewed in Sec. 3, $\phi$ denotes the parameters modified by the adaptation method $\mathcal{A}$ . Note, $\phi$ may include newly introduced parameters by $\mathcal{A}$ or the parameters in the pre-trained model. We use the notation $\mathcal{U}$ to be the set of overlapping parameters between $\phi$ and $\theta$ . + +Intuitively, the lower-level task simply performs the adaptation $\mathcal{A}$ given the model initialization $\theta$ by minimizing the loss function $L_{\mathcal{A}}$ with respect to (w.r.t.) $\phi$ . On the other hand, the upper-level task is maximizing the loss function of $\mathcal{A}$ w.r.t. $\theta$ . That is, the upper-level task aims for $\theta$ that results in poor performance when the adaptation method $\mathcal{A}$ is applied to the target concept $\mathbf{c}'$ . The worse the performance is when adapted by $\mathcal{A}$ , the more immunized a model is. + +To solve the program in Eq. (3), we use gradient-based methods to solve the upper-level optimization. This leads to the following update steps: + +$$ +\phi^ {\star} \leftarrow \arg \min _ {\phi} L _ {\mathcal {A}} \left(\mathbf {x} _ {\mathcal {A}} ^ {\prime}, \mathbf {c} ^ {\prime}; \theta^ {i - 1}, \phi\right) \tag {4} +$$ + +$$ +\theta^ {i} \leftarrow \theta^ {i - 1} + \alpha \nabla_ {\theta} L _ {\mathcal {A}} \left(\mathbf {x} _ {\mathcal {I}} ^ {\prime}, \mathbf {c} ^ {\prime}; \theta^ {i - 1}, \phi^ {\star}\right), \tag {5} +$$ + +# Algorithm 1 IMMA (Our method) + +Input: pre-trained model $\theta^p$ , images $\mathcal{D} = \{\mathbf{x}'\}$ representative of the concept $\mathbf{c}'$ , learning rate $\alpha$ , IMMA-modified parameters set $\mathcal{S}$ , adaptation loss $L_{A}$ + +Output: Immunized model $\theta^I$ + +1: Initialize $\theta^0 = \theta^p$ +2: Initialize $\phi^0$ based on $\mathcal{A}$ +3: for $i = 1$ to $I$ do +4: Sample batch $\mathbf{x}_{\mathcal{A}}^{\prime}$ and $\mathbf{x}_{\mathcal{I}}^{\prime}$ from $\mathcal{D}$ +5: $\phi \gets \phi^{i - 1} \# \text{Initialize } \phi \text{ from the previous iteration}$ +6: $\phi^i\gets \arg \min_{\phi}L_{\mathcal{A}}(\mathbf{x}_{\mathcal{A}}',\mathbf{c}';\theta^{i - 1},\phi)$ +7: $\theta_{\in \mathcal{U}}^{i - 1}\gets \phi^i\# Assign$ the overlaps between $\theta$ and $\phi$ +8: $\theta_{\in S}^{i}\gets \theta_{\in S}^{i - 1} + \alpha \nabla_{\theta}L_{\mathcal{A}}(\mathbf{x}_{\mathcal{I}}^{\prime},\mathbf{c}^{\prime};\theta^{i - 1},\phi^{i})$ +9: end for +10: return $\theta^I$ + +where $\alpha$ denotes learning rate. We summarized the procedure in Alg. 1. Given the pre-trained model parameters $\theta^p$ , the algorithm returns an immunized parameter $\theta^I$ . We will next describe the subtle choices that were made regarding re-initialization and overlapping parameters during the optimization of $\theta$ and $\phi$ . + +Details on updating $\phi$ and $\theta$ . In Alg. 1 line 5, in theory, we should reinitialize $\phi$ following the initialize scheme of $\mathcal{A}$ , as the lower-level task is performing the adaptation. In practice, computing the lower-level task until convergence for each outer-loop iteration is prohibitively expensive. To reduce computation, we only solve the + +lower-level task with a fixed number of update steps. However, this leads to + +lower-level tasks being not very well trained due to the small number of updates on $\phi$ . To address this, we initialize $\phi$ from $\phi^{i-1}$ , i.e., the result from the previous outer-loop iteration. Empirically, this leads to faster convergence of the lower-level tasks; we suspect that this is because $\theta^i$ and $\theta^{i-1}$ remain quite similar after one outer-loop update. + +The next subtle detail is when updating $\theta$ in Alg. 1 line 7. Recall, that depending on the adaptation method, the pre-trained parameters $\theta$ and adapted parameters $\phi$ may overlap. In such a scenario, there are two ways to compute the upper-level task's gradient: (a) we assume that $\theta^{i-1}$ and $\phi^i$ are separate parameters, i.e., the result of $\phi^i$ will not change $\theta^{i-1}$ ; (b) we update the overlapping parameters in $\mathcal{U}$ with the value from $\phi^i$ , leading to line 7 in Alg. 1. Empirically, we found (b) to perform better. We conduct an ablation study for Alg. 1 lines 5 and 7 in Sec. 5.3, where we found both to improve immunization quality. + +Implementation details. To apply IMMA in practice, we approximate the solution of the lower-level task by taking a single gradient step for each of the adaptation methods. For the upper-level task, we use the Adam optimizer [22]. We choose $S$ in Eq. (3) to contain only the cross-attention layer, i.e., only these layers are being optimized. This choice follows the intuition that cross-attention layers are important as they mix the features of the target concept and image representation. Additional hyperparameters and experiment details are documented in the appendix. + +# 4.2 Applications of model immunization + +Immunizing concept erased models. Recent works [13, 23, 51], reviewed + +in Sec. 3, have shown that they can erase concepts from diffusion models without retraining the model from scratch. After a target concept $\mathbf{c}'$ is erased, the erased model $\theta_{-\mathbf{c}'}^p$ can no longer generate that object or style given the concept's text prompt. However, in our experiments, we show that the model can easily re-learn the target concept again in just a few training epochs by using LoRA [20]. In Fig. 3, we illustrate that the erased stable diffusion (ESD [13]) + +![](images/2bbe67807bfb4b1e5d3b7863404298a913a19d99eb84b95f7b57f8c35794ed15.jpg) +Fig. 3: IMMA's result against re-learning. pt of artists' style. + +![](images/d5f3caeb49a23b5ef797f682cdcb29fa14df015ad91f666663dbc596e165dde2.jpg) + +This motivated us to immunize the concept erased model $\theta_{-\mathbf{c}'}^p$ to make the adaptation of re-learning $\mathbf{c}'$ more difficult. Ideally, the immunized model is no longer able to generate images of the target concept, i.e., + +$$ +p (\tilde {\mathbf {x}} | \mathbf {c} ^ {\prime}; \mathcal {A} [ \mathcal {I} (\boldsymbol {\theta} _ {- \mathbf {c} ^ {\prime}} ^ {p}) ]) \approx 0, \forall \tilde {\mathbf {x}} \sim p (\mathbf {x} | \mathbf {c} ^ {\prime}; \boldsymbol {\theta} ^ {p}). \qquad (6) +$$ + +Immunizing against personalization adaptation. Another potential for misuse is with personalization adaptation. Methods such as DreamBooth [39] or Textual Inversion [12] allow for a stable diffusion model to quickly learn to generate a personalized/unique concept given a few images of the unique concept. This motivated us to study immunization against these personalization adaptations. In practice, IMMA will be applied before a pre-trained model's release such that it fails to generate the unique concept even after adaptation. + +# 5 Experiments + +To evaluate IMMA, we conduct comprehensive experiments over multiple applications and adaptation methods. + +# 5.1 Immunizing erased models against re-learning + +Experiment setup. We employ LoRA as the adaptation method, and the pre-trained erased models are from ESD [13] using their publicly released code base. Following ESD, we consider experiments on eight artistic styles including both well-recognized and modern artists, and ten object classes from a subset of ImageNet [9]. For immunization, we use 20 images generated by Stable Diffusion (SD V1-4), prior to erasing, with the prompt of the target artistic style or object class. For adaptation, we generate different 20 images for each dataset and use LoRA to fine-tune the erased model for 20 epochs. For style, the prompt used in the evaluation is "An artwork by {artist name}" For object, the prompt used in evaluation is "a {concept}", for example, "a parachute". We also evaluate on re-learning Not-Safe-For-Work (NSFW) content where we followed I2P prompts proposed by Schramowski et al. [42]. + +Evaluation metrics. To measure the effect of immunization against re-learning, we aim for a metric that measures the performance gap with and without IMMA, where the larger value indicates a stronger effect of IMMA, and vice versa. For this, we propose Similarity Gap Ratio (SGR). Let $\mathbf{x}_{\mathcal{I}}$ and $\mathbf{x}_A$ denote the generated images with and without IMMA, and $\mathbf{x}_r$ to be the reference images of the target concept then SGR is defined as follows: + +$$ +\operatorname {S G R} \left(\mathbf {x} _ {\mathcal {I}}, \mathbf {x} _ {\mathcal {A}}, \mathbf {x} _ {r}\right) = \frac {\mathcal {M} \left(\mathbf {x} _ {r} , \mathbf {x} _ {\mathcal {A}}\right) - \mathcal {M} \left(\mathbf {x} _ {r} , \mathbf {x} _ {\mathcal {I}}\right)}{\mathcal {M} \left(\mathbf {x} _ {r} , \mathbf {x} _ {\mathcal {A}}\right)}, \tag {7} +$$ + +where $\mathcal{M}$ is an image similarity metric. Common choices, following prior works [12, 13, 39], include Learned Perceptual Image Patch Similarity [52] (LPIPS), and similarity measured in the feature space of CLIP [12] or DINO [5] each denoted as SGR (L), SGR (C), and SGR (D). For consistency, we report one minus LPIPS, such that larger values for all three metrics mean higher image similarity. + +User study. To check the quantitative metrics against human perception, we prepare four reference images and one pair of generated images (w/ and w/o IMMA) for the participants to select the generated image that is more similar to + +the reference images in terms of content and quality. + +Results on style. In Tab. 1, we report SGR for re-learning artist styles for erased models. Over eight artists, we consistently observe a positive gap among all three SGR based on LPIPS, CLIP, and DINO with averages of $21.84\%$ , $5.5\%$ , and $23.35\%$ . + +In Fig. 4, we directly show the LPIPS, CLIP, and DINO metrics at each epoch during the LoRA finetuning to visualize the gap. A lower value represents that the generated images are less similar to the reference images. Across all of the plots, we observe models without IMMA $\uparrow$ (orange) are more similar to the reference images than models with IMMA $\downarrow$ (blue). For artistic styles, the gap remains steady throughout the epochs. Overall, models with IMMA struggle to generate images containing the target concepts. + +In Fig. 3, we provide qualitative comparisons. We observe that LoRA successfully re-learned the target concept (third column). On the other hand, the model with IMMA (last column) either generates an image with lower quality or an unrelated image. Our user study also validates this observation. All of the 30 respondents selected generations without IMMA as the one with high similarity and quality across all compared samples. This shows that models with IMMA generate worse images of the target styles. + +Results on objects. As in artistic styles, we report SGR of re-learning target objects for the erased models in Tab. 2. The average SGR (L), SGR (C), and SGR (D) across ten classes are $21.84\%$ , $11.41\%$ , and $41.62\%$ . We also + +Table 1: SGR $\uparrow (\%)$ on artistic styles for ESD with LoRA adaptation. + +
SGRVan GoghPablo PicassoTyler EdlinKelly McKernanKilian EngClaude MonetThomas KinkadeKirby Fagan
(L)17.6128.0828.6723.3426.7831.1418.4716.18
(C)4.774.565.879.344.597.279.441.18
(D)18.421.8126.0514.9925.7331.4839.5915.07
+ +![](images/1fb2838313990c043ddde319766fd4f172c13258316fafa8a4073ea62010f425.jpg) + +![](images/b0eb41385e14ced321c4f08e82756cd73414879d000fa86b6d4ffb0520cd6868.jpg) + +![](images/58494ce09c3c6a5d269b67dd65d7848933c0c36a847f862dc2832f063c6b2788.jpg) + +![](images/7858bfb59716c21bec63af284be45011b9aa2efecd1a1ba5f8458216564d3ead.jpg) + +![](images/078a520e807a8eddd2818aea14760bb666f7aeafceeba6433e4bc3932c28db52.jpg) +Fig. 4: Similarity vs. epochs for LoRA on styles. Models with IMMA achieve lower similarity throughout LoRA's epochs. + +![](images/d4ab72431c0f47ab00bf69a6f817ef0fb9315352166b52f58f6b05adcf69ad30.jpg) + +Table 2: SGR ↑(%) on objects for ESD with LoRA adaptation. + +
SGRCass. playerGarbage truckGas pumpChain sawEn. springerGolf ballchurchFrench hornParachuteTrench
(L)11.667.4816.6427.3322.4241.9610.096.8850.9739.14
(C)3.665.1819.728.7215.0810.6712.518.1119.3411.07
(D)12.1620.031.3150.8668.8558.0914.3330.2568.5661.84
+ +![](images/fdbf8aff4a614b25dea595a0c45f596fe356c6b341fa1974e635622bc92d3160.jpg) + +![](images/c254d8fac75ab5ec054ccc4d279d6d3c35ec0193cda9ead1a352dad7624d12cb.jpg) + +![](images/db1ac2764db1c95837b3ff550bce7b19e32de4efc72a0d39669d4ba3daed3722.jpg) + +![](images/3caf703fa086183bc1af640e07c1ff9d975dbdbfa015dc1f565659eb7a8d41a9.jpg) + +![](images/f2b1312f102456f67760df31c2be1ccf770d84a8366bd01db4f0325bfe8cfffc.jpg) +Fig.5: Similarity vs. epochs for LoRA on objects. Models with IMMA achieve lower similarity throughout LoRA's epochs. + +![](images/8c1604116a7a6133fcc9eb4b45065ca1e0437cfebf13d42ac1be338820d96b08.jpg) + +Table 3: Acc. (\%) of object erased models on 500 images. Col. 1: Original ESD model with the target concept erased. Col. 2: ESD without IMMA after LoRA. We observe that the target concept is successfully relearned. Col. 3: ESD with IMMA after LoRA. Col. 4 & 5: Acc. of other objects of ESD before and after IMMA. + +
Class name / MethodsAcc. of LoRA's target (↓)Acc. of others (↑)
ESDw/o IMMAw/ IMMAESDw/ IMMA
Cassette player0.22.00.272.046.4
Garbage truck3.040.87.663.825.5
Gas pump0.063.40.062.739.8
Chain saw0.015.20.879.352.5
EN springer0.415.60.867.249.6
Golf ball0.422.40.056.436.7
Church5.673.411.882.370.0
French horn0.280.20.464.957.6
Parachute2.091.00.078.858.9
Tench1.050.80.478.055.5
Average1.345.52.270.649.3
+ +visualize LPIPS, CLIP, and DINO in Fig. 5. Overall, we observe the same trend as in the result for artistic styles. Similarity metrics across all the plots drop for models with IMMA. That is, with the same number of fine-tuning epochs, generations from models with IMMA exhibit lower quality or are less related to the object. + +As the target concept contains objects, we consider classification accuracy (ResNet50 pre-trained on ImageNet) for evaluation reported in Tab. 3. First, without IMMA, ESD can relearn to generate the object. With a mere three epochs of LoRA, the average accuracy of the target concept increased from $1.3\%$ to $45.5\%$ . On the other hand, ESD with IMMA, the average accuracy remains low at $2.2\%$ , demonstrating the effectiveness of IMMA at preventing relearning. + +Thus far, the evaluation has focused on the target concept for IMMA models. We are also interested in how well IMMA preserves the other concepts. We define "other concepts" to be the remaining nine object categories beside the target object that is being adapted. In Tab. 3 (rightmost two columns), we observe that the original ESD has an average of $70.6\%$ and after IMMA the accuracy + +dropped to $49.3\%$ . We fully acknowledge that this is a limitation of IMMA. Prevention against certain target concepts may degrade other concepts. IMMA roughly trades off $43\%$ in the target concept with $20\%$ in other concepts. Finally, qualitative comparisons are shown in Fig. 6, where we observe the same conclusion that IMMA is effective against re-learning. + +![](images/1fe0eb63460460c35b79595b72ae7cffc33d124280365b257f8472d4d8b10b0d.jpg) + +![](images/caec41ed7bbd26e7c38943c390b6fcd2e85c34e0951c96efa0c4e95a6c7b8ead.jpg) +Fig. 7: IMMA on NSFW content. We report the $\%$ of change, relative to SD V1-4, in the number of detected nudity content after LoRA on the nudity-erased model. + +Results on NSFW. For experiments on NSFW concepts, we use SD V1-4 to generate 4,703 unsafe images, among which 351 images contain 454 nudity counts based on NudeNet [1] with a threshold of 0.05. We randomly select two sets of 50 images containing nudity and their corresponding prompts for relearning adaptation and the other for IMMA. The evaluation is conducted on the remaining 251 unsafe prompts. + +In Fig. 7, we compare the percentage of change before and after IMMA adaptation with respect to the base SD V1-4 model. We observe that IMMA successfully generated less nudity content after LoRA, i.e., w/ IMMA achieved a negative $80\%$ of change in the detected nudity content compared to the negative $60\%$ change for the model without IMMA. This shows that IMMA successfully immunized the model making it more difficult to re-learn nudity from unsafe images/prompts. + +# 5.2 Immunizing against personalized content + +Experiment setup. We consider three adaptation methods for learning new unique/personalized concepts: Textual Inversion (TI) [12], DreamBooth (DB) [39], and DreamBooth LoRA. For DreamBooth LoRA (DB LoRA), instead of modifying all of the parameters during fine-tuning, LoRA is applied on top of the cross-attention layers. We follow the exact adaptation procedures following prior works [12, 39], i.e., adding a special token for the new unique concept. Note, we use different novel tokens during adaptation and IMMA. This is because, for a realistic evaluation, we would not know the novel token that would be used during the adaptation. + +We perform experiments on ten different datasets released by Kumari et al. [24] which include a variety of unique objects. Each of them contains four to six images taken in the real world. The evaluation prompt for all concepts in this section is "A $[V]$ on the beach" following DreamBooth. + +Evaluation metrics. In this task, we report SGR in Eq. (7) with CLIP and DINO following DreamBooth [39]. Next, to show that the model maintains its capability to be personalized for other concepts, we propose Relative Similarity Gap Ratio (RSGR), which is given by + +$$ +\operatorname {R S G R} \left(\mathbf {x} _ {\mathcal {I}}, \mathbf {x} _ {\mathcal {A}}, \mathbf {x} _ {\mathcal {I}} ^ {o}, \mathbf {x} _ {\mathcal {A}} ^ {o}\right) = \frac {\mathcal {M} \left(\mathbf {x} _ {\mathcal {A}} ^ {o} , \mathbf {x} _ {\mathcal {I}} ^ {o}\right) - \mathcal {M} \left(\mathbf {x} _ {\mathcal {A}} , \mathbf {x} _ {\mathcal {I}}\right)}{\mathcal {M} \left(\mathbf {x} _ {\mathcal {A}} ^ {o} , \mathbf {x} _ {\mathcal {I}} ^ {o}\right)}, \tag {8} +$$ + +Table 4: SGR (%) on personalized content adaptation. Higher positive values indicate better immunization quality. + +
castlecarchairglassesinstrumentwoodenpotlighthousemotorbikehouseplantpurseAverage
TISGR(C)9.358.328.5513.788.610.757.8212.1615.355.809.05
SGR(D)53.4937.0840.1928.5048.857.0436.3348.3641.2324.4336.55
DBSGR(C)2.0314.44-8.600.912.185.80-1.192.371.213.592.27
SGR(D)12.5627.01-14.6713.3724.6429.31-7.410.759.2124.9711.97
DBSGR(C)8.6017.490.2511.7313.662.167.670.980.053.586.62
LoraSGR(D)43.2134.378.9437.6340.3832.7048.366.4024.880.5227.74
+ +Table 5: RSGR (%) on personalized content adaptation. Higher positive values indicate better performance at maintaining other concepts. + +
castle car chair glasses instrument woodenpot lighthouse motorbike houseplant purse Average
TIRSGR (C)15.2420.198.499.7819.148.8920.5718.5916.320.9913.82
RSGR (D)70.6963.5722.540.157.6634.1551.8567.1855.228.8847.18
DBRSGR (C)19.6613.636.624.974.444.6116.536.085.1210.369.20
RSGR (D)36.9935.9817.7232.0424.5923.2835.062.6025.0550.128.34
DBRSGR (C)17.5521.004.493.8912.248.4224.288.6711.774.8311.71
LoRARSGR (D)49.6641.5718.925.4129.9235.9253.1228.6341.0224.7434.89
+ +where $\mathbf{x}_{\mathcal{A}}^o$ and $\mathbf{x}_{\mathcal{I}}^o$ are generated images without and with IMMA on other unique concepts. + +The term $\mathcal{M}(\mathbf{x}_{\mathcal{A}}^{o},\mathbf{x}_{\mathcal{I}}^{o})$ captures image similarity for other concepts with and without IMMA. Ideally, this term should be high as IMMA should not affect other concepts. The term $\mathcal{M}(\mathbf{x}_{\mathcal{A}},\mathbf{x}_{\mathcal{I}})$ captures the image similarity for target concepts with and without IMMA. In this case, the similarity should be low. RSGR reports the difference between these two terms as a ratio. Intuitively, larger RSGR indicates IMMA is better at preserving the other concepts while removing the target concept. + +![](images/f410812149081ef4c33f74d8a8e3d6aa899b61122761ba58875f8407e35ba48f.jpg) + +![](images/c11688e062e4fac67893e06f9800803d0ab5cfe752b96f7091182dad5da56996.jpg) + +![](images/626aa3f290a5cea882a594c1f4c32d5633ef2edfa137530af0560e36c3c36b15.jpg) + +![](images/35cab22c3a5d7c5e82a34a0aba94fbb3ad18ad06b202708a57c49b4c97be6a0c.jpg) + +![](images/08aaddc213d7b4d62ac869e42ced5f5a53f7dc313de49f989fd5a8e15fac77a7.jpg) +Fig. 8: CLIP and DINO similarity on other concept vs. target concept. The gap between the two lines shows RSGR. + +![](images/128e4444461358a97d9476a144de3408573df8f598218793b8402c80528389f8.jpg) + +We also conducted a user study for personalized adaptation using the setting as in Sec. 5.1. + +Results on personalization. In Tab. 4 we observe a positive ratio among most of the SGR metrics, except for "furniture chair" and "lighthouse" with Dreambooth highlighted in red. We show the generations with negative SGR in the appendix. Overall, IMMA effectively prevents the pre-trained model from learning personalization concepts across the three adaptation methods. + +Next, Tab. 5 reports RSGR to evaluate how well IMMA preserves the ability to personalize other concepts. As we can see, the RSGR values are consistently positive across all the datasets. This indicates IMMA immunizes against the target concept without hurting the adaptability for personalizing for other concepts. We directly visualize this relative gap in Fig. 8. As shown, the lines of the nine concepts + +![](images/2b18cbca2614bd7f021f3bbedf468f7d2cf49d4565fa5864654343a1e9e316f7.jpg) +Reference +YNNNI O/A + +![](images/a3cb0dca82a613a6dea6c1796961f5e73a52f78a7623bb8f747ee42742a12efb.jpg) +TI + +![](images/83273643c336a8e1ca9148ef5452eb757eb9c3f4bc2577a47463f923a1a987fc.jpg) +DB + +![](images/80f781a4cb70f738d1a3b4ca08def454f4df6262f2ef3fd6bf9b91d0926a0054.jpg) +DB LoRA + +![](images/72d709677703e90f9ab12e497e4036999ea5f7345d92fb0b8ec2e688fbde9401.jpg) + +![](images/7958a1dc4b4a51ac2be21ece31db329dc52bbf137baa390762a57dd6757a89ed.jpg) + +![](images/2382d2db04feaf03d8a571612359a400b2352aa446a7b616e3af717af38c9334.jpg) + +![](images/ecdbde225c15398f70eca1561f94a6e5abc7f23ce5d6cb5ec555d840c75705ee.jpg) + +![](images/69ef5946a71474dfc4fcda53d9dc8c329d13f3cc57da4171f6991d9c21f0e641.jpg) + +![](images/33012a06ff0eb067de9a3ae4baceb69aa4b19ad4c1b27e2f2feb453842a8015d.jpg) + +![](images/8edc84088288cbc98674c035805a18df8e35226c097fd5ce9297c4fee2d2c9e8.jpg) + +![](images/86d01e88503b46e1b9776e96f771e5a69175e4c4e845e8f65411bcd08eecad7d.jpg) + +![](images/b26dee41bf2a6fc9ffbdc9b9d41d24c6d336cfcd626093eea2673e2f32b549d6.jpg) +Fig. 9: Personalization adaptation w/ and w/o IMMA. + +![](images/635c8e01f422752a4c8e2f9fd2fc9fbe85e674ae7de68502ef80026986a55cda.jpg) + +![](images/64553925d2cd9526c7657e66b348a347c4ea31e4d3e30d7eefc741564a124f9a.jpg) + +![](images/50816ec7f463cc7c7c19a3353d69879d0e9315a0eae7d68d2db99636b0824c21.jpg) + +$(\mathcal{M}(\mathbf{x}_{\mathcal{A}}^{o}, \mathbf{x}_{\mathcal{I}}^{o}) \uparrow$ in green) and the adaptation of the target concept $(\mathcal{M}(\mathbf{x}_{\mathcal{A}}, \mathbf{x}_{\mathcal{I}}) \downarrow$ in blue) can be easily distinguished; consistent with results in Tab. 5. + +Lastly, we show the generated images in Fig. 9. Comparing the generated images with and without IMMA, we observe models with IMMA are either unable to learn the target concept or generate unrealistic images. We also conducted a user study to validate this observation. All of the 30 participants selected generation without IMMA to be more similar to reference images, i.e., models after IMMA fail to generate the target concepts. + +# 5.3 Additional discussion + +Comparison with data poisoning. We compare IMMA with MIST [27], one of the data poisoning (DP) methods in the personalized content setup. In Fig. 10 (top-row) we show both MIST and IMMA successfully prevent the model from learning the target concept after Textual Inversion. + +This observation is also supported by a user study. On seven out of ten evaluated datasets, the majority of the 30 users found the generation without MIST to be of higher quality and more similar to the reference images. + +Adaption on images with JPEG compression. As reported in MIST [27], one way to weaken the effect of poisoned data is by compressing the images with JPEG after adaptation. On the other hand, IMMA can defend against JPEG compression by including JPEG images in the training data. In Fig. 10 (bottom row), we observe that after compression, MIST fails to prevent generating the target concept, while IMMA remains robust against JPEG. + +![](images/63f3427d9ec611b3cfb9cb43bb0ae1344228abfaa531195efa93185bb197496e.jpg) +eae + +![](images/54b3272ab78b9e454fa00c62ce1ccfe891866e6d7e0169af837962565cc4af15.jpg) + +![](images/0e3dbd70393ad40a34ff7da532000eeed6b29520c501d58f545a8fc26ea91828.jpg) + +![](images/da31ed2a409d03ad0390d6a96c5be317d9e131362c2ef90aa0f96dbe4c6b9a14.jpg) +Fig. 10: MIST vs. IMMA. Generation with Textual Inversion on training images w/ and w/o JPEG compression. + +![](images/cb0376106f6cdd15d651865bb47fa7aa62332a5cf1708077e2c61e309ebd5357.jpg) + +![](images/d49af8f767c8515beaaf863624532b312d0441e29a23ffb2063bc6cce279f45e.jpg) + +![](images/e730396aa651afa82bb9b682cfbb0a4df3066914a01a2d81561a4954b38f0208.jpg) +Fig. 11: Ablation on direct maximization. DreamBooth adaptation on "luggage purse" after immunization on "woodenpot". + +![](images/9f43012597a731f0a9c036fb64bab70de7f96a4957ae8d770e1ae0b2b1075448.jpg) + +![](images/e8703a69a8fa8250adc31b9cc995a28c5c6e01f210ec51f3c2c82ad9ca2a3ad1.jpg) + +Ablation studies. We conduct ablations using the DreamBooth personalization setup in Sec. 5.2. First, we experiment with a direct maximization baseline, i.e., only the upper-level task in Eq. (3). Results are shown in Fig. 11. We observe that direct maximization ruins the immunized model, i.e., low image quality when being adapted for another concept. + +Next, we ablate line 5 and line 7 in Alg. 1 and report CLIP similarity. Shown in Fig. 12 (left), without line 5, the adaptation can learn the target concept, i.e., high CLIP similarity. Next, we ablate whether to update the overlapping parameters in $\phi$ by removing line 7. The result is shown in Fig. 12 (right). We observe that without line 7, the adaptation successfully learns the target concept. These results show the necessity of the proposed steps in Alg. 1. + +Crossed adaptation with IMMA. Thus far, we report results for IMMA by immunizing the model against the same adaptation method $\mathcal{A}$ . We now investigate whether IMMA remains effective under a different adaptation method during IMMA and adaptation. In other words, we consider IMMA with crossed adaptation methods, where we immunize the pre-trained model using $\mathcal{A}_1$ and perform malicious adaptation on $\mathcal{A}_2$ . Fig. 13 shows the qualitative results across DB and TI. We observe that the model with IMMA against DreamBooth is also effective when being adapted with Textual Inversion, and vice versa. + +Limitations. Our proposed IMMA and experiments focus on the immunization of a single concept. In this work, we methodically study a variety of adaptation + +![](images/b75c203745bbd3955820db724a67ef2acb28613a3f4e4631bcb50856e33e490f.jpg) +Fig. 12: Ablation on line 5 and line 7 of Alg. 1. + +![](images/714e86832f9d713d6f2ff6ba9aca24002f48125f3bfbd42362ebb2f96ce55477.jpg) + +![](images/d2b8b6fd5a9083c8b558ab1d5d16cc41740ea7e9b8abb0796b8d241843f0e0ab.jpg) +Fig. 13: Results on crossed adaptation immunization. First row: DB after IMMA with either DB or TI. Second row: TI after IMMA the model with either DB or TI. + +settings and leave the support for multiple concepts for future work. We believe that results in a single concept demonstrate a convincing step towards model immunization. If the reader is interested, we present preliminary results in the Appendix showing that IMMA can generalize to multiple concepts, albeit, not as comprehensive as the single concept study. + +# 6 Conclusion + +We propose to Immunize Models against Malicious Adaptation (IMMA). Unlike the data-poisoning paradigm, which protects images, our method focuses on protecting pre-trained models from being used by adaptation methods. We formulate "Immunization" as a bi-level optimization program to learn a poor model initialization that would make adaptation more difficult. To validate the efficacy of IMMA, we conduct extensive experiments on relearning concepts for erased models and immunizing against the adaptation of personalized content. We believe that model immunization is a promising paradigm for combatting the risk of malicious adaptation, and that IMMA is an encouraging first step. We are hopeful that the advancement of IMMA will result in safer open-source text-to-image models, benefiting both the research community and society. + +# References + +1. Bedapudi, P.: NudeNet: Neural nets for nudity classification, detection and selective censoring. https://github.com/plateminto/NudeNetClassifier (2019) +2. Bengio, Y.: Gradient-based optimization of hyperparameters. Neural Computation (2000) +3. Biggio, B., Nelson, B., Laskov, P.: Support vector machines under adversarial label noise. In: Proc. ACML (2011) +4. Bird, C., Ungless, E., Kasirzadeh, A.: Typology of risks of generative text-to-image models. In: Proc. AIES (2023) +5. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. CVPR (2021) +6. CreativeML Open RAIL-M: Stable Diffusion LICENSE File (2023), URL https://github.com/CompVis/stable-diffusion/blob/main/License +7. Dai, X., Hou, J., Ma, C.Y., Tsai, S., Wang, J., Wang, R., Zhang, P., Vandenhende, S., Wang, X., Dubey, A., Yu, M., Kadian, A., Radenovic, F., Mahajan, D., Li, K., Zhao, Y., Petrovic, V., Singh, M.K., Motwani, S., Wen, Y., Song, Y., Sumbaly, R., Ramanathan, V., He, Z., Vajda, P., Parikh, D.: Emu: Enhancing image generation models using photogenic needles in a haystack. arXiv preprint arXiv:2309.15807 (2023) +8. DeepFloyd Lab at StabilityAI: DeepFloyd IF. https://github.com/deepfloyd/IF (2023) +9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: ImageNet: A large-scale hierarchical image database. In: Proc. CVPR (2009) +10. Dhariwal, P., Nichol, A.: Diffusion models beat GANs on image synthesis. In: Proc. NeurIPS (2021) +1. Finn, C., Abbeel, P., Levine, S.: Model-agnostic meta-learning for fast adaptation of deep networks. In: Proc. ICML (2017) +2. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: Proc. ICLR (2023) +3. Gandikota, R., Materzyńska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. In: Proc. ICCV (2023) +4. Gandikota, R., Orgad, H., Belinkov, Y., Materzyńska, J., Bau, D.: Unified concept editing in diffusion models. In: Proc. WACV (2024) +5. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: Proc. ICLR (2015) +6. Harwell, D.: AI-generated child sex images spawn new nightmare for the web. The Washington Post (2023), URL https://www.washingtonpost.com/technology/2023/06/19/artificial-intelligence-child-sex-abuse-images/ +7. Heikkilä, M.: This artist is dominating ai-generated art. and he's not happy about it. MIT Technology Review. Retrieved March 16, 2023 (2022) + +18. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. arXiv preprint arXiv:2305.10120 (2023) +19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Proc. NeurIPS (2020) +20. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: LoRA: Low-rank adaptation of large language models. In: Proc. ICLR (2022) +21. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: Proc. NeurIPS (2021) +22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: Proc. ICLR (2015) +23. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: Proc. ICCV (2023) +24. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proc. CVPR (2023) +25. Larsen, J., Hansen, L.K., Svarer, C., Ohlsson, M.: Design and regularization of neural networks: the optimal use of a validation set. In: IEEE Signal Processing Society Workshop (1996) +26. Liang, C., Wu, X.: Mist: Towards improved adversarial examples for diffusion models (2023) +27. Liang, C., Wu, X., Hua, Y., Zhang, J., Xue, Y., Song, T., Xue, Z., Ma, R., Guan, H.: Adversarial example does good: Preventing painting imitation from diffusion models via adversarial examples. In: Proc. ICML (2023) +28. Lorraine, J., Vicol, P., Duvenaud, D.: Optimizing millions of hyperparameters by implicit differentiation. In: Proc. AISTATS (2020) +29. Mei, S., Zhu, X.: Using machine teaching to identify optimal training-set attacks on machine learners. In: Proc. AAAI (2015) +30. Moore, S.: Can the law prevent AI from duplicating actors? It's complicated. Forbes (Jul 2023), URL https://www.forbes.com/sites/schuylermoore/2023/07/13/proTECTing-celebrities-including-all-actors-from-ai-with-the-right-of-publicity/?sh=5c56ba4159ec +31. Nichol, A.Q., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., Mcgrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. In: Proc. ICML (2022) +32. Noveck, J., O'Brien, M.: Visual artists sue ai companies in sf federal court for repurposing their work. Associated Press (2023) +33. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: SDXL: improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023) +34. Qu, Y., Shen, X., He, X., Backes, M., Zannettou, S., Zhang, Y.: Unsafe diffusion: On the generation of unsafe images and hateful memes from text-to-image models. arXiv preprint arXiv:2305.13873 (2023) +35. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with CLIP latents. arXiv preprint arXiv:2204.06125 (2022) + +36. Rando, J., Paleka, D., Lindner, D., Heim, L., Tramér, F.: Red-teaming the stable diffusion safety filter. In: Proc. NeurIPS ML Safety Workshop (2022) +37. Ren, Z., Yeh, R., Schwing, A.: Not all unlabeled data are equal: Learning to weight data in semi-supervised learning (2020) +38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proc. CVPR (2022) +39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: DreamBooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proc. CVPR (2023) +40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: Proc. NeurIPS (2022) +41. Salman, H., Khaddaj, A., Leclerc, G., Ilyas, A., Madry, A.: Raising the cost of malicious AI-powered image editing. In: Proc. ICML (2023) +42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proc. CVPR (2023) +43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5B: An open large-scale dataset for training next generation image-text models. In: Proc. NeurIPS (2022) +44. Shan, S., Cryan, J., Wenger, E., Zheng, H., Hanocka, R., Zhao, B.Y.: Glaze: Protecting artists from style mimicry by text-to-image models. In: USENIX Security Symposium (2023) +45. SmithMano: Tutorial: How to remove the safety filter in 5 seconds. Reddit (2022) +46. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: Proc. ICML (2015) +47. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: Proc. NeurIPS (2019) +48. Vincent, P.: A connection between score matching and denoising autoencoders. Neural computation (2011) +49. Wang, Z., Chen, C., Liu, Y., Lyu, L., Metaxas, D., Ma, S.: How to detect unauthorized data usages in text-to-image diffusion models. arXiv preprint arXiv:2307.03108 (2023) +50. Yeh, R.A., Hu, Y.T., Hasegawa-Johnson, M., Schwing, A.: Equivariance discovery by learned parameter-sharing. In: Proc. AISTATS (2022) +51. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023) +52. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proc. CVPR (2018) + +53. Zhao, Z., Duan, J., Hu, X., Xu, K., Wang, C., Zhang, R., Du, Z., Guo, Q., Chen, Y.: Unlearnable examples for diffusion models: Protect data from unauthorized exploitation. arXiv preprint arXiv:2306.01902 (2023) +54. Zheng, A.Y., He, T., Qiu, Y., Wang, M., Wipf, D.: Graph machine learning through the lens of bilevel optimization. In: Proc. AISTATS (2024) +55. Zheng, A.Y., Yang, C.A., Yeh, R.A.: Learning to obstruct few-shot image classification over restricted classes. In: Proc. ECCV (2024) \ No newline at end of file diff --git a/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/images.zip b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..73f8db4fd53e16b4c19cb8cbc0b799e43900a79e --- /dev/null +++ b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d6f2a40d4297e41f64e1e75af43f402b3eda1f003a06ae082dba1b83d057fab6 +size 842893 diff --git a/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/layout.json b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..f8080682ed43698d1519f93ea009745a1d21e0a4 --- /dev/null +++ b/2024/IMMA_ Immunizing text-to-image Models against Malicious Adaptation/layout.json @@ -0,0 +1,13233 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 214, + 168, + 399, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 168, + 399, + 180 + ], + "spans": [ + { + "bbox": [ + 214, + 168, + 399, + 180 + ], + "type": "text", + "content": "Amber Yijia Zheng Raymond A. Yeh" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 198, + 190, + 414, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 198, + 190, + 414, + 213 + ], + "spans": [ + { + "bbox": [ + 198, + 190, + 414, + 213 + ], + "type": "text", + "content": "Department of Computer Science, Purdue University {zheng709, rayyeh}@purdue.edu" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 240, + 455, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 240, + 455, + 395 + ], + "spans": [ + { + "bbox": [ + 160, + 240, + 455, + 395 + ], + "type": "text", + "content": "Abstract. Advancements in open-sourced text-to-image models and fine-tuning methods have led to the increasing risk of malicious adaptation, i.e., fine-tuning to generate harmful/ unauthorized content. Recent works, e.g., Glaze or MIST, have developed data-poisoning techniques which protect the data against adaptation methods. In this work, we consider an alternative paradigm for protection. We propose to \"immunize\" the model by learning model parameters that are difficult for the adaptation methods when fine-tuning malicious content; in short IMMA. Specifically, IMMA should be applied before the release of the model weights to mitigate these risks. Empirical results show IMMA's effectiveness against malicious adaptations, including mimicking the artistic style and learning of inappropriate/unauthorized content, over three adaptation methods: LoRA, Textual-Inversion, and DreamBooth. The code is available at https://github.com/amberyzheng/IMMA." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 413, + 230, + 426 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 230, + 426 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 230, + 426 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 437, + 482, + 558 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 558 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 558 + ], + "type": "text", + "content": "With the open-source of large-scale text-to-image models [8, 38] the entry barrier to generating images has been drastically lowered. Building on top of these models, methods such as Textual Inversion [12], DreamBooth [39], and LoRA [20] allow quick adaptation to generate personalized content. These newly introduced capabilities come with great responsibility and trust in individuals to do good instead of harm to society. Unfortunately, the capabilities of adapting text-to-image generative models have already had negative impacts, e.g., the generation of sexual content [16], copying artists' work without consent [17, 32], duplicating celebrity images [30], etc. We broadly encapsulate all these harmful fine-tuning of models under the term malicious adaptation." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 558, + 482, + 618 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 618 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 618 + ], + "type": "text", + "content": "To countermeasure these adaptations, open-source models have users agree that they will not use the software for \"the purpose of harming others\" in their licenses [6] or implement safety checks that would censor inappropriate generated content [36]. Nonetheless, these approaches do not have real enforcing power. Users can trivially disregard the license and remove the safety filters [45]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 618, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 618, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 618, + 482, + 665 + ], + "type": "text", + "content": "To address these loopholes, recent data poisoning techniques have shown a promising path towards preventing malicious adaptations [27, 41, 44]. The main idea is to protect images by modifying them with imperceivable changes, e.g., adversarial noise, such that adaptation methods confuse the style and content of" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": "the images and fail to generalize. A key shortcoming of these methods is that the burden of enforcement is on content creators. The artists need to apply these techniques before releasing their artwork. Contrarily, we present an alternative paradigm that places this burden on the releaser of open-source models." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 299, + 343 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 299, + 343 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 299, + 343 + ], + "type": "text", + "content": "In this paper, we propose to \"Immunize\" Models, i.e., make them more resilient, against Malicious Adaptation; in short IMMA. The goal of IMMA is to make adaptation more difficult for concepts that are deemed malicious while maintaining the models' adaptability for other concepts. At a high level, we propose an algorithm to learn model parameters that perform poorly when being adapted to malicious concepts, e.g., mimicry artistic style. In Fig. 1, we illustrate the effect of IMMA when mimicking Picasso's style; the model" + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 304, + 167, + 478, + 282 + ], + "blocks": [ + { + "bbox": [ + 304, + 167, + 478, + 282 + ], + "lines": [ + { + "bbox": [ + 304, + 167, + 478, + 282 + ], + "spans": [ + { + "bbox": [ + 304, + 167, + 478, + 282 + ], + "type": "image", + "image_path": "f99c41e71bab2f28c8c2af6ab27bc584c4aa9ae5b9d2ca0013f22d8aa3b430d3.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 285, + 482, + 330 + ], + "lines": [ + { + "bbox": [ + 304, + 285, + 482, + 330 + ], + "spans": [ + { + "bbox": [ + 304, + 285, + 482, + 330 + ], + "type": "text", + "content": "Fig. 1: IMMA on artistic style mimicry. Higher 1 - LPIPS indicates more similar to the reference images. IMMA successfully prevented the mimicking of the artistic style." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 344, + 482, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 344, + 482, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 482, + 426 + ], + "type": "text", + "content": "To demonstrate the effectiveness of IMMA, we consider three adaptation methods, namely, Textual Inversion [12], DreamBooth [39], and LORA [20]. We experimented with immunizing against several malicious settings, including, mimicking artistic styles, restoring erased concepts, and learning personalized concepts. Overall, IMMA successfully makes text-to-image models more resilient against adaptation to malicious concepts while maintaining the usability of the model. Our contributions are as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 137, + 428, + 480, + 512 + ], + "type": "list", + "angle": 0, + "index": 10, + "blocks": [ + { + "bbox": [ + 137, + 428, + 480, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 428, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 137, + 428, + 480, + 464 + ], + "type": "text", + "content": "- We propose a novel paradigm for preventing malicious adaptations. In contrast to the data poisoning for protection paradigm, we aim to protect the model instead of the data. See Fig. 2." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 464, + 480, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 464, + 480, + 487 + ], + "spans": [ + { + "bbox": [ + 138, + 464, + 480, + 487 + ], + "type": "text", + "content": "- We present an algorithm (IMMA) that learns difficult model initialization for the adaptation methods." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 137, + 488, + 480, + 512 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 488, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 137, + 488, + 480, + 512 + ], + "type": "text", + "content": "- We conduct extensive experiments evaluating IMMA against various malicious adaptations." + } + ] + } + ], + "index": 9 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 556, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 556, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 556, + 482, + 628 + ], + "type": "text", + "content": "Diffusion models. By learning to reverse a process of transforming data into noise, diffusion models achieve impressive generative capabilities [10, 19, 46]. With the aid of Internet-scale datasets [43], these models are capable of generating diverse images with high realism [7, 8, 31, 33, 35, 38, 40]. This progress led to new excitements in artificial intelligence generated content (AIGC) and interest in how to mitigate the associated risks, which we discuss next." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Preventing generative AI misuse. There are many potential risks associated with the advancement in generative capabilities [4, 34]. Recent works have started to address these risks. For example, Wang et al. [49] study how to detect" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 114, + 261, + 201 + ], + "blocks": [ + { + "bbox": [ + 141, + 114, + 261, + 201 + ], + "lines": [ + { + "bbox": [ + 141, + 114, + 261, + 201 + ], + "spans": [ + { + "bbox": [ + 141, + 114, + 261, + 201 + ], + "type": "image", + "image_path": "5259b1ca8f85734bb3579469495ff09e9c411eff6d20506f0fcdf9c694237c2f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": "Fig.2: Paradigms for preventing malicious adaptation. Data poisoning: modify training images " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathbf{x}'" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": " with imperceivable changes, such that " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": " fails to capture " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": " by training with modified images. Model immunization (ours): modify pre-trained model weights " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\theta^p" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": " with immunization methods " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathcal{I}" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": " before adaptation " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": ", such that " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": " fails to capture " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": " by training on immunized model weights " + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "inline_equation", + "content": "\\mathcal{I}(\\theta^p)" + }, + { + "bbox": [ + 130, + 205, + 482, + 261 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 275, + 114, + 483, + 201 + ], + "blocks": [ + { + "bbox": [ + 275, + 114, + 483, + 201 + ], + "lines": [ + { + "bbox": [ + 275, + 114, + 483, + 201 + ], + "spans": [ + { + "bbox": [ + 275, + 114, + 483, + 201 + ], + "type": "image", + "image_path": "40ff95258068cbe3c6007ca3c1e6ed578f449fbc307f709fbcdf7326a8eda493.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 273, + 482, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 273, + 482, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 273, + 482, + 331 + ], + "type": "text", + "content": "unauthorized images that are used in the training set of these models. Schramowski et al. [42] study how to suppress the generation of inappropriate content, e.g., nudity, self-harm, etc., during diffusion's generation process. Other works [13, 14, 18, 23, 51], take a further step in trying to remove these inappropriate content from the diffusion models." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 482, + 441 + ], + "type": "text", + "content": "More closely related to this work, GLAZE [44], MIST [26, 27], and EUDP [53] studied the misuse of artistic mimicry, i.e., preventing diffusion models from being used to copy artistic styles. Salman et al. [41] have also studied how to raise the cost of image manipulation using diffusion models. Notably, these works aim to protect the image, i.e., a form of data-poisoning [3, 29] which modifies the data, e.g., adding adversarial noise [15], such that the adaptation techniques fail. Different from these works, we protect the model, against misuse, i.e., model immunization. We illustrate the difference between our proposed model immunization vs. data poisoning in Fig. 2." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 441, + 483, + 549 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 483, + 549 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 483, + 549 + ], + "type": "text", + "content": "Meta-learning. As our approach to model immunization is based on learning against an adaptation method, we briefly review meta-learning; also known as learning to learn. The area covers learning many aspects of a learning algorithm, e.g., learning good initialization suitable to adaptation [11], or other hyperparameters, e.g., learning rate, or weight decay, via hypergradient [2, 25, 28, 37, 50, 54, 55]. Various hypergradients approximations have been proposed, e.g., MAML [11] uses a single step gradient unrolling, with a summary provided by Lorraine et al. [28]. Different from these works, we aim to learn poor initializations for the adaptation methods to prevent the misuse of generative models." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 567, + 234, + 580 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 234, + 580 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 234, + 580 + ], + "type": "text", + "content": "3 Preliminaries" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 593, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 616 + ], + "type": "text", + "content": "We briefly review the concepts necessary to understand our approach and introduce a common notation." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "text", + "content": "Text-to-image diffusion models. The goal of a text-to-image diffusion model [38] is to learn a conditional distribution of images " + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "text", + "content": " given concept embedding " + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{c}" + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "text", + "content": ", i.e., modeling " + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "inline_equation", + "content": "p(\\mathbf{x}|\\mathbf{c};\\theta)" + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 617, + 485, + 666 + ], + "type": "text", + "content": " denotes the model parameters. The learning objective is formulated via variational lower bound [19, 21] or from a denoising" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 447, + 103 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 430, + 129 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 430, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 430, + 129 + ], + "type": "text", + "content": "score-matching perspective [47, 48] which boils down to minimizing" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 205, + 131, + 482, + 147 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 131, + 482, + 147 + ], + "spans": [ + { + "bbox": [ + 205, + 131, + 482, + 147 + ], + "type": "interline_equation", + "content": "L (\\mathbf {x}, \\mathbf {c}; \\theta) = \\mathbb {E} _ {t, \\epsilon \\sim \\mathcal {N} (0, I)} \\left[ w _ {t} \\| \\epsilon_ {\\theta} (\\mathbf {x} _ {t}, \\mathbf {c}, t) - \\epsilon \\| _ {2} ^ {2} \\right], \\tag {1}", + "image_path": "61a9a2f51da0d1b666058ec2fbdd75af9e4bbe6f4d038b61286c8d3ebaca8563.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "text", + "content": " denotes the denoising network, " + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t" + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "inline_equation", + "content": "w_t" + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "text", + "content": " denote the noised images and loss weights for a given time-step " + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "inline_equation", + "content": "t \\sim \\mathcal{U}\\{0, T\\}" + }, + { + "bbox": [ + 130, + 150, + 481, + 185 + ], + "type": "text", + "content": " sampled from a discrete uniform distribution." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 186, + 481, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 186, + 481, + 223 + ], + "spans": [ + { + "bbox": [ + 131, + 186, + 481, + 223 + ], + "type": "text", + "content": "Concept erasing methods. To erase a target concept " + }, + { + "bbox": [ + 131, + 186, + 481, + 223 + ], + "type": "inline_equation", + "content": "c'" + }, + { + "bbox": [ + 131, + 186, + 481, + 223 + ], + "type": "text", + "content": " from a model, erasing algorithms [13, 23] fine-tunes a pre-trained model's parameters " + }, + { + "bbox": [ + 131, + 186, + 481, + 223 + ], + "type": "inline_equation", + "content": "\\theta^p" + }, + { + "bbox": [ + 131, + 186, + 481, + 223 + ], + "type": "text", + "content": " such that the model no longer generate images corresponding to that concept, i.e.," + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 226, + 226, + 482, + 241 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 226, + 226, + 482, + 241 + ], + "spans": [ + { + "bbox": [ + 226, + 226, + 482, + 241 + ], + "type": "interline_equation", + "content": "p \\left(\\tilde {\\boldsymbol {x}} \\mid \\mathbf {c} ^ {\\prime}; \\theta_ {- \\mathbf {c} ^ {\\prime}} ^ {p}\\right) \\approx 0, \\forall \\tilde {\\boldsymbol {x}} \\sim p \\left(\\mathbf {x} \\mid \\mathbf {c} ^ {\\prime}; \\theta^ {p}\\right), \\tag {2}", + "image_path": "3047db6b3f16578643df8a5f96f92ed30507a6b92244fe464e89b21c0a691fae.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "inline_equation", + "content": "\\theta_{-\\mathbf{c}'}^p" + }, + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "text", + "content": " denotes the parameters of the erased model after fine-tuning. The main idea is to train the target concept to generate images of some other concept. A common choice is an empty token, i.e., the model performs unconditional generation when prompted with the target concept " + }, + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "inline_equation", + "content": "c'" + }, + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "spans": [ + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": "Personalization of text-to-image diffusion models. In contrast to erasing a concept, personalization algorithms aim to add a novel concept to the pre-trained model. Given a set of images " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{x}'\\}" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": " representative of the concept " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": ". Personalization methods introduce a novel token " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "[V]" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": " in the word space and train the model to associate " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "[V]" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": " to the new concept. To learn this new concept, the model is trained using the data pair " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "(\\mathbf{x}', \\mathbf{c}')" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathbf{c}' \\triangleq \\Gamma([V])" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": " is extracted with the text encoder " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\Gamma" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": " using the novel word token " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "[V]" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": ". We broadly use the notation " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "L_{\\mathcal{A}}(\\mathbf{x}', \\mathbf{c'}; \\theta, \\phi)" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": " to denote the loss function of each adaptation method " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 131, + 293, + 482, + 425 + ], + "type": "text", + "content": " denotes the parameters that are being fine-tuned. For example, DreamBooth [24, 39] finetunes on a subset of parameters, e.g., cross-attention layers, whereas Textual Inversion [12] only optimizes the new word token." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "spans": [ + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": "Another common approach to make the fine-tuning more data efficient is to use Low-Rank Adaptation (LoRA) [20]. Given a pre-trained weight " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "\\theta^p \\in \\mathbb{R}^{n \\times d}" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": ", LoRA aims to learn an adaptor " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "\\Delta" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": ", such that the final weights become " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "\\hat{\\theta} = \\theta^p + \\Delta" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": ". LoRA specifically restricts the " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "\\Delta" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": " to be low-rank, i.e., " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "\\Delta = AB" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "A \\in \\mathbb{R}^{n \\times r}" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "B \\in \\mathbb{R}^{r \\times d}" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "inline_equation", + "content": "r \\ll \\min(n, d)" + }, + { + "bbox": [ + 131, + 426, + 483, + 510 + ], + "type": "text", + "content": ". In this work, we show that LoRA can easily learn back the concepts that were previously erased which highlights the need for our proposed research direction of model immunization." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 524, + 212, + 538 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 524, + 212, + 538 + ], + "spans": [ + { + "bbox": [ + 132, + 524, + 212, + 538 + ], + "type": "text", + "content": "4 Approach" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": "Given a pre-trained text-to-image model with parameters " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\theta^p" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": ", e.g., StableDiffusion [38], existing adaptation methods " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": " [12, 20, 24, 39] can fine-tune " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\theta^p" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": " such that the model generates images of a concept " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": ". Our goal is to prevent the adaptation methods from successfully doing so on harmful concepts, e.g., unauthorized artistic style. To accomplish this, we present an algorithm IMMA " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{I}" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": " that takes pre-trained parameters " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\theta^p" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": " as input, and outputs the immunized parameters " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\theta^I" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": ". When applying adaptation " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\theta^I" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": ", it should fail to learn the concept " + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 131, + 545, + 482, + 666 + ], + "type": "text", + "content": ", i.e., the model is \"immunized\" against adaptation. At a high level, IMMA aims to learn a poor model initialization when being fine-tuned by the adaptation methods. We now describe the algorithmic details." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 265, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 265, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 265, + 127 + ], + "type": "text", + "content": "4.1 Model immunization" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 480, + 159 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 480, + 159 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 480, + 159 + ], + "type": "text", + "content": "To achieve this goal of learning a poor initialization for adaptation, we propose the following bi-level program:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 183, + 167, + 482, + 199 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 183, + 167, + 482, + 199 + ], + "spans": [ + { + "bbox": [ + 183, + 167, + 482, + 199 + ], + "type": "interline_equation", + "content": "\\overbrace {\\max _ {\\theta \\in \\mathcal {S}} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {I}} ^ {\\prime} , \\mathbf {c} ^ {\\prime} ; \\theta , \\phi^ {\\star}\\right)} ^ {\\text {u p p e r - l e v e l t a k}} \\text {s . t .} \\phi^ {\\star} = \\overbrace {\\operatorname* {a r g m i n} _ {\\phi} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {\\prime} , \\mathbf {c} ^ {\\prime} ; \\theta , \\phi\\right)} ^ {\\text {l o w e r - l e v e l t a k}}. \\tag {3}", + "image_path": "a7435f3edf61242d96d23b23284a1ae830ec5c7cdbe9bf33ee1b39467271d80b.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "spans": [ + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": "Here, the set " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathcal{S}" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " denotes a subset of " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " that is trained by IMMA. This set is a hyperparameter that we choose empirically. Given a dataset of images " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathcal{D} = \\{\\mathbf{x}'\\}" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " representative of the concept " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": ", we sample the training data " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathcal{A}}'" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathcal{D}}'" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " independently. As reviewed in Sec. 3, " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " denotes the parameters modified by the adaptation method " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": ". Note, " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " may include newly introduced parameters by " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " or the parameters in the pre-trained model. We use the notation " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\mathcal{U}" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " to be the set of overlapping parameters between " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 207, + 479, + 290 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": "Intuitively, the lower-level task simply performs the adaptation " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": " given the model initialization " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": " by minimizing the loss function " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "L_{\\mathcal{A}}" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": " with respect to (w.r.t.) " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": ". On the other hand, the upper-level task is maximizing the loss function of " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": " w.r.t. " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": ". That is, the upper-level task aims for " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": " that results in poor performance when the adaptation method " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": " is applied to the target concept " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": ". The worse the performance is when adapted by " + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 290, + 480, + 361 + ], + "type": "text", + "content": ", the more immunized a model is." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 362, + 480, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 362, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 480, + 387 + ], + "type": "text", + "content": "To solve the program in Eq. (3), we use gradient-based methods to solve the upper-level optimization. This leads to the following update steps:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 223, + 394, + 482, + 412 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 394, + 482, + 412 + ], + "spans": [ + { + "bbox": [ + 223, + 394, + 482, + 412 + ], + "type": "interline_equation", + "content": "\\phi^ {\\star} \\leftarrow \\arg \\min _ {\\phi} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {\\prime}, \\mathbf {c} ^ {\\prime}; \\theta^ {i - 1}, \\phi\\right) \\tag {4}", + "image_path": "eebb1e764d6ef562b69d0b1759f92a290f1ec6f9b6a61e4c477e6ac1ebc01835.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 226, + 415, + 481, + 430 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 226, + 415, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 226, + 415, + 481, + 430 + ], + "type": "interline_equation", + "content": "\\theta^ {i} \\leftarrow \\theta^ {i - 1} + \\alpha \\nabla_ {\\theta} L _ {\\mathcal {A}} \\left(\\mathbf {x} _ {\\mathcal {I}} ^ {\\prime}, \\mathbf {c} ^ {\\prime}; \\theta^ {i - 1}, \\phi^ {\\star}\\right), \\tag {5}", + "image_path": "9f434649f5b1b521f6c4c5a8c2a07c11a35498575155850ff55b77532f4af25d.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 444, + 293, + 456 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 444, + 293, + 456 + ], + "spans": [ + { + "bbox": [ + 133, + 444, + 293, + 456 + ], + "type": "text", + "content": "Algorithm 1 IMMA (Our method)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "spans": [ + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "text", + "content": "Input: pre-trained model " + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "inline_equation", + "content": "\\theta^p" + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "text", + "content": ", images " + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "inline_equation", + "content": "\\mathcal{D} = \\{\\mathbf{x}'\\}" + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "text", + "content": " representative of the concept " + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "text", + "content": ", learning rate " + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "text", + "content": ", IMMA-modified parameters set " + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "inline_equation", + "content": "\\mathcal{S}" + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "text", + "content": ", adaptation loss " + }, + { + "bbox": [ + 133, + 460, + 309, + 503 + ], + "type": "inline_equation", + "content": "L_{A}" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 504, + 260, + 514 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 504, + 260, + 514 + ], + "spans": [ + { + "bbox": [ + 133, + 504, + 260, + 514 + ], + "type": "text", + "content": "Output: Immunized model " + }, + { + "bbox": [ + 133, + 504, + 260, + 514 + ], + "type": "inline_equation", + "content": "\\theta^I" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 137, + 514, + 308, + 645 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 137, + 514, + 219, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 514, + 219, + 525 + ], + "spans": [ + { + "bbox": [ + 137, + 514, + 219, + 525 + ], + "type": "text", + "content": "1: Initialize " + }, + { + "bbox": [ + 137, + 514, + 219, + 525 + ], + "type": "inline_equation", + "content": "\\theta^0 = \\theta^p" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 137, + 525, + 247, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 525, + 247, + 536 + ], + "spans": [ + { + "bbox": [ + 137, + 525, + 247, + 536 + ], + "type": "text", + "content": "2: Initialize " + }, + { + "bbox": [ + 137, + 525, + 247, + 536 + ], + "type": "inline_equation", + "content": "\\phi^0" + }, + { + "bbox": [ + 137, + 525, + 247, + 536 + ], + "type": "text", + "content": " based on " + }, + { + "bbox": [ + 137, + 525, + 247, + 536 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 137, + 537, + 220, + 547 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 537, + 220, + 547 + ], + "spans": [ + { + "bbox": [ + 137, + 537, + 220, + 547 + ], + "type": "text", + "content": "3: for " + }, + { + "bbox": [ + 137, + 537, + 220, + 547 + ], + "type": "inline_equation", + "content": "i = 1" + }, + { + "bbox": [ + 137, + 537, + 220, + 547 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 137, + 537, + 220, + 547 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 137, + 537, + 220, + 547 + ], + "type": "text", + "content": " do" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "spans": [ + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "type": "text", + "content": "4: Sample batch " + }, + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathcal{A}}^{\\prime}" + }, + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathcal{I}}^{\\prime}" + }, + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 137, + 548, + 294, + 559 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 137, + 559, + 308, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 559, + 308, + 579 + ], + "spans": [ + { + "bbox": [ + 137, + 559, + 308, + 579 + ], + "type": "text", + "content": "5: " + }, + { + "bbox": [ + 137, + 559, + 308, + 579 + ], + "type": "inline_equation", + "content": "\\phi \\gets \\phi^{i - 1} \\# \\text{Initialize } \\phi \\text{ from the previous iteration}" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 137, + 580, + 294, + 591 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 580, + 294, + 591 + ], + "spans": [ + { + "bbox": [ + 137, + 580, + 294, + 591 + ], + "type": "text", + "content": "6: " + }, + { + "bbox": [ + 137, + 580, + 294, + 591 + ], + "type": "inline_equation", + "content": "\\phi^i\\gets \\arg \\min_{\\phi}L_{\\mathcal{A}}(\\mathbf{x}_{\\mathcal{A}}',\\mathbf{c}';\\theta^{i - 1},\\phi)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "spans": [ + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "type": "text", + "content": "7: " + }, + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "type": "inline_equation", + "content": "\\theta_{\\in \\mathcal{U}}^{i - 1}\\gets \\phi^i\\# Assign" + }, + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "type": "text", + "content": " the overlaps between " + }, + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 137, + 591, + 308, + 612 + ], + "type": "inline_equation", + "content": "\\phi" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 137, + 613, + 308, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 613, + 308, + 625 + ], + "spans": [ + { + "bbox": [ + 137, + 613, + 308, + 625 + ], + "type": "text", + "content": "8: " + }, + { + "bbox": [ + 137, + 613, + 308, + 625 + ], + "type": "inline_equation", + "content": "\\theta_{\\in S}^{i}\\gets \\theta_{\\in S}^{i - 1} + \\alpha \\nabla_{\\theta}L_{\\mathcal{A}}(\\mathbf{x}_{\\mathcal{I}}^{\\prime},\\mathbf{c}^{\\prime};\\theta^{i - 1},\\phi^{i})" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 137, + 625, + 183, + 634 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 625, + 183, + 634 + ], + "spans": [ + { + "bbox": [ + 137, + 625, + 183, + 634 + ], + "type": "text", + "content": "9: end for" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 137, + 635, + 195, + 645 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 635, + 195, + 645 + ], + "spans": [ + { + "bbox": [ + 137, + 635, + 195, + 645 + ], + "type": "text", + "content": "10: return " + }, + { + "bbox": [ + 137, + 635, + 195, + 645 + ], + "type": "inline_equation", + "content": "\\theta^I" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "text", + "content": " denotes learning rate. We summarized the procedure in Alg. 1. Given the pre-trained model parameters " + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\theta^p" + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "text", + "content": ", the algorithm returns an immunized parameter " + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\theta^I" + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "text", + "content": ". We will next describe the subtle choices that were made regarding re-initialization and overlapping parameters during the optimization of " + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 313, + 437, + 482, + 544 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 24 + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "spans": [ + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "text", + "content": "Details on updating " + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "text", + "content": ". In Alg. 1 line 5, in theory, we should reinitialize " + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "text", + "content": " following the initialize scheme of " + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 313, + 544, + 482, + 653 + ], + "type": "text", + "content": ", as the lower-level task is performing the adaptation. In practice, computing the lower-level task until convergence for each outer-loop iteration is prohibitively expensive. To reduce computation, we only solve the" + } + ] + } + ], + "index": 25 + }, + { + "bbox": [ + 130, + 653, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 653, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 653, + 480, + 665 + ], + "type": "text", + "content": "lower-level task with a fixed number of update steps. However, this leads to" + } + ] + } + ], + "index": 26 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": "lower-level tasks being not very well trained due to the small number of updates on " + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": ". To address this, we initialize " + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "inline_equation", + "content": "\\phi^{i-1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": ", i.e., the result from the previous outer-loop iteration. Empirically, this leads to faster convergence of the lower-level tasks; we suspect that this is because " + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "inline_equation", + "content": "\\theta^i" + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "inline_equation", + "content": "\\theta^{i-1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": " remain quite similar after one outer-loop update." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": "The next subtle detail is when updating " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": " in Alg. 1 line 7. Recall, that depending on the adaptation method, the pre-trained parameters " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": " and adapted parameters " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": " may overlap. In such a scenario, there are two ways to compute the upper-level task's gradient: (a) we assume that " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\theta^{i-1}" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\phi^i" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": " are separate parameters, i.e., the result of " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\phi^i" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": " will not change " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\theta^{i-1}" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": "; (b) we update the overlapping parameters in " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\mathcal{U}" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": " with the value from " + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\phi^i" + }, + { + "bbox": [ + 130, + 176, + 482, + 272 + ], + "type": "text", + "content": ", leading to line 7 in Alg. 1. Empirically, we found (b) to perform better. We conduct an ablation study for Alg. 1 lines 5 and 7 in Sec. 5.3, where we found both to improve immunization quality." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 274, + 482, + 370 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 274, + 482, + 370 + ], + "spans": [ + { + "bbox": [ + 130, + 274, + 482, + 370 + ], + "type": "text", + "content": "Implementation details. To apply IMMA in practice, we approximate the solution of the lower-level task by taking a single gradient step for each of the adaptation methods. For the upper-level task, we use the Adam optimizer [22]. We choose " + }, + { + "bbox": [ + 130, + 274, + 482, + 370 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 274, + 482, + 370 + ], + "type": "text", + "content": " in Eq. (3) to contain only the cross-attention layer, i.e., only these layers are being optimized. This choice follows the intuition that cross-attention layers are important as they mix the features of the target concept and image representation. Additional hyperparameters and experiment details are documented in the appendix." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 390, + 343, + 403 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 390, + 343, + 403 + ], + "spans": [ + { + "bbox": [ + 132, + 390, + 343, + 403 + ], + "type": "text", + "content": "4.2 Applications of model immunization" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 415, + 481, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 481, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 481, + 426 + ], + "type": "text", + "content": "Immunizing concept erased models. Recent works [13, 23, 51], reviewed" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 427, + 282, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 427, + 282, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 427, + 282, + 594 + ], + "type": "text", + "content": "in Sec. 3, have shown that they can erase concepts from diffusion models without retraining the model from scratch. After a target concept " + }, + { + "bbox": [ + 130, + 427, + 282, + 594 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 130, + 427, + 282, + 594 + ], + "type": "text", + "content": " is erased, the erased model " + }, + { + "bbox": [ + 130, + 427, + 282, + 594 + ], + "type": "inline_equation", + "content": "\\theta_{-\\mathbf{c}'}^p" + }, + { + "bbox": [ + 130, + 427, + 282, + 594 + ], + "type": "text", + "content": " can no longer generate that object or style given the concept's text prompt. However, in our experiments, we show that the model can easily re-learn the target concept again in just a few training epochs by using LoRA [20]. In Fig. 3, we illustrate that the erased stable diffusion (ESD [13])" + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 288, + 427, + 386, + 580 + ], + "blocks": [ + { + "bbox": [ + 288, + 427, + 386, + 580 + ], + "lines": [ + { + "bbox": [ + 288, + 427, + 386, + 580 + ], + "spans": [ + { + "bbox": [ + 288, + 427, + 386, + 580 + ], + "type": "image", + "image_path": "2bbe67807bfb4b1e5d3b7863404298a913a19d99eb84b95f7b57f8c35794ed15.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 288, + 582, + 480, + 605 + ], + "lines": [ + { + "bbox": [ + 288, + 582, + 480, + 605 + ], + "spans": [ + { + "bbox": [ + 288, + 582, + 480, + 605 + ], + "type": "text", + "content": "Fig. 3: IMMA's result against re-learning. pt of artists' style." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 389, + 429, + 477, + 578 + ], + "blocks": [ + { + "bbox": [ + 389, + 429, + 477, + 578 + ], + "lines": [ + { + "bbox": [ + 389, + 429, + 477, + 578 + ], + "spans": [ + { + "bbox": [ + 389, + 429, + 477, + 578 + ], + "type": "image", + "image_path": "d5f3caeb49a23b5ef797f682cdcb29fa14df015ad91f666663dbc596e165dde2.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 607, + 482, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 607, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 607, + 482, + 643 + ], + "type": "text", + "content": "This motivated us to immunize the concept erased model " + }, + { + "bbox": [ + 130, + 607, + 482, + 643 + ], + "type": "inline_equation", + "content": "\\theta_{-\\mathbf{c}'}^p" + }, + { + "bbox": [ + 130, + 607, + 482, + 643 + ], + "type": "text", + "content": " to make the adaptation of re-learning " + }, + { + "bbox": [ + 130, + 607, + 482, + 643 + ], + "type": "inline_equation", + "content": "\\mathbf{c}'" + }, + { + "bbox": [ + 130, + 607, + 482, + 643 + ], + "type": "text", + "content": " more difficult. Ideally, the immunized model is no longer able to generate images of the target concept, i.e.," + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 212, + 652, + 482, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 212, + 652, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 212, + 652, + 482, + 667 + ], + "type": "interline_equation", + "content": "p (\\tilde {\\mathbf {x}} | \\mathbf {c} ^ {\\prime}; \\mathcal {A} [ \\mathcal {I} (\\boldsymbol {\\theta} _ {- \\mathbf {c} ^ {\\prime}} ^ {p}) ]) \\approx 0, \\forall \\tilde {\\mathbf {x}} \\sim p (\\mathbf {x} | \\mathbf {c} ^ {\\prime}; \\boldsymbol {\\theta} ^ {p}). \\qquad (6)", + "image_path": "0498bcbc076e927c86e00731cd9fe538a5b1cf7c9b3564fb7315ad732ef8f867.jpg" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 273, + 102 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 125, + 482, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 125, + 482, + 210 + ], + "spans": [ + { + "bbox": [ + 130, + 125, + 482, + 210 + ], + "type": "text", + "content": "Immunizing against personalization adaptation. Another potential for misuse is with personalization adaptation. Methods such as DreamBooth [39] or Textual Inversion [12] allow for a stable diffusion model to quickly learn to generate a personalized/unique concept given a few images of the unique concept. This motivated us to study immunization against these personalization adaptations. In practice, IMMA will be applied before a pre-trained model's release such that it fails to generate the unique concept even after adaptation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 227, + 230, + 241 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 227, + 230, + 241 + ], + "spans": [ + { + "bbox": [ + 131, + 227, + 230, + 241 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 251, + 483, + 276 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 483, + 276 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 483, + 276 + ], + "type": "text", + "content": "To evaluate IMMA, we conduct comprehensive experiments over multiple applications and adaptation methods." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 293, + 392, + 306 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 293, + 392, + 306 + ], + "spans": [ + { + "bbox": [ + 131, + 293, + 392, + 306 + ], + "type": "text", + "content": "5.1 Immunizing erased models against re-learning" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 312, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 312, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 482, + 456 + ], + "type": "text", + "content": "Experiment setup. We employ LoRA as the adaptation method, and the pre-trained erased models are from ESD [13] using their publicly released code base. Following ESD, we consider experiments on eight artistic styles including both well-recognized and modern artists, and ten object classes from a subset of ImageNet [9]. For immunization, we use 20 images generated by Stable Diffusion (SD V1-4), prior to erasing, with the prompt of the target artistic style or object class. For adaptation, we generate different 20 images for each dataset and use LoRA to fine-tune the erased model for 20 epochs. For style, the prompt used in the evaluation is \"An artwork by {artist name}\" For object, the prompt used in evaluation is \"a {concept}\", for example, \"a parachute\". We also evaluate on re-learning Not-Safe-For-Work (NSFW) content where we followed I2P prompts proposed by Schramowski et al. [42]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "text", + "content": "Evaluation metrics. To measure the effect of immunization against re-learning, we aim for a metric that measures the performance gap with and without IMMA, where the larger value indicates a stronger effect of IMMA, and vice versa. For this, we propose Similarity Gap Ratio (SGR). Let " + }, + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_A" + }, + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "text", + "content": " denote the generated images with and without IMMA, and " + }, + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_r" + }, + { + "bbox": [ + 130, + 456, + 483, + 529 + ], + "type": "text", + "content": " to be the reference images of the target concept then SGR is defined as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 205, + 536, + 482, + 563 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 536, + 482, + 563 + ], + "spans": [ + { + "bbox": [ + 205, + 536, + 482, + 563 + ], + "type": "interline_equation", + "content": "\\operatorname {S G R} \\left(\\mathbf {x} _ {\\mathcal {I}}, \\mathbf {x} _ {\\mathcal {A}}, \\mathbf {x} _ {r}\\right) = \\frac {\\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {A}}\\right) - \\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {I}}\\right)}{\\mathcal {M} \\left(\\mathbf {x} _ {r} , \\mathbf {x} _ {\\mathcal {A}}\\right)}, \\tag {7}", + "image_path": "8321fc372e0e111f55e529b66839b7d2a2dea04dd6d61e5cac2171ecb375afd9.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 569, + 482, + 630 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 630 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 630 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 569, + 482, + 630 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 569, + 482, + 630 + ], + "type": "text", + "content": " is an image similarity metric. Common choices, following prior works [12, 13, 39], include Learned Perceptual Image Patch Similarity [52] (LPIPS), and similarity measured in the feature space of CLIP [12] or DINO [5] each denoted as SGR (L), SGR (C), and SGR (D). For consistency, we report one minus LPIPS, such that larger values for all three metrics mean higher image similarity." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": "User study. To check the quantitative metrics against human perception, we prepare four reference images and one pair of generated images (w/ and w/o IMMA) for the participants to select the generated image that is more similar to" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 448, + 103 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 364, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 364, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 364, + 128 + ], + "type": "text", + "content": "the reference images in terms of content and quality." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "text", + "content": "Results on style. In Tab. 1, we report SGR for re-learning artist styles for erased models. Over eight artists, we consistently observe a positive gap among all three SGR based on LPIPS, CLIP, and DINO with averages of " + }, + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "inline_equation", + "content": "21.84\\%" + }, + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "inline_equation", + "content": "5.5\\%" + }, + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "inline_equation", + "content": "23.35\\%" + }, + { + "bbox": [ + 130, + 140, + 299, + 224 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 229, + 300, + 410 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 229, + 300, + 410 + ], + "spans": [ + { + "bbox": [ + 130, + 229, + 300, + 410 + ], + "type": "text", + "content": "In Fig. 4, we directly show the LPIPS, CLIP, and DINO metrics at each epoch during the LoRA finetuning to visualize the gap. A lower value represents that the generated images are less similar to the reference images. Across all of the plots, we observe models without IMMA " + }, + { + "bbox": [ + 130, + 229, + 300, + 410 + ], + "type": "inline_equation", + "content": "\\uparrow" + }, + { + "bbox": [ + 130, + 229, + 300, + 410 + ], + "type": "text", + "content": " (orange) are more similar to the reference images than models with IMMA " + }, + { + "bbox": [ + 130, + 229, + 300, + 410 + ], + "type": "inline_equation", + "content": "\\downarrow" + }, + { + "bbox": [ + 130, + 229, + 300, + 410 + ], + "type": "text", + "content": " (blue). For artistic styles, the gap remains steady throughout the epochs. Overall, models with IMMA struggle to generate images containing the target concepts." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 413, + 299, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 299, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 299, + 592 + ], + "type": "text", + "content": "In Fig. 3, we provide qualitative comparisons. We observe that LoRA successfully re-learned the target concept (third column). On the other hand, the model with IMMA (last column) either generates an image with lower quality or an unrelated image. Our user study also validates this observation. All of the 30 respondents selected generations without IMMA as the one with high similarity and quality across all compared samples. This shows that models with IMMA generate worse images of the target styles." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "text", + "content": "Results on objects. As in artistic styles, we report SGR of re-learning target objects for the erased models in Tab. 2. The average SGR (L), SGR (C), and SGR (D) across ten classes are " + }, + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "inline_equation", + "content": "21.84\\%" + }, + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "inline_equation", + "content": "11.41\\%" + }, + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "inline_equation", + "content": "41.62\\%" + }, + { + "bbox": [ + 130, + 593, + 299, + 665 + ], + "type": "text", + "content": ". We also" + } + ] + } + ], + "index": 6 + }, + { + "type": "table", + "bbox": [ + 306, + 164, + 480, + 201 + ], + "blocks": [ + { + "bbox": [ + 304, + 140, + 481, + 163 + ], + "lines": [ + { + "bbox": [ + 304, + 140, + 481, + 163 + ], + "spans": [ + { + "bbox": [ + 304, + 140, + 481, + 163 + ], + "type": "text", + "content": "Table 1: SGR " + }, + { + "bbox": [ + 304, + 140, + 481, + 163 + ], + "type": "inline_equation", + "content": "\\uparrow (\\%)" + }, + { + "bbox": [ + 304, + 140, + 481, + 163 + ], + "type": "text", + "content": " on artistic styles for ESD with LoRA adaptation." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 306, + 164, + 480, + 201 + ], + "lines": [ + { + "bbox": [ + 306, + 164, + 480, + 201 + ], + "spans": [ + { + "bbox": [ + 306, + 164, + 480, + 201 + ], + "type": "table", + "html": "
SGRVan GoghPablo PicassoTyler EdlinKelly McKernanKilian EngClaude MonetThomas KinkadeKirby Fagan
(L)17.6128.0828.6723.3426.7831.1418.4716.18
(C)4.774.565.879.344.597.279.441.18
(D)18.421.8126.0514.9925.7331.4839.5915.07
", + "image_path": "4203342fcf118cab30fed34fac50b13df75b4e3fe236f94d69c792421f3e4f8c.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 308, + 210, + 391, + 258 + ], + "blocks": [ + { + "bbox": [ + 308, + 210, + 391, + 258 + ], + "lines": [ + { + "bbox": [ + 308, + 210, + 391, + 258 + ], + "spans": [ + { + "bbox": [ + 308, + 210, + 391, + 258 + ], + "type": "image", + "image_path": "1fb2838313990c043ddde319766fd4f172c13258316fafa8a4073ea62010f425.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 394, + 210, + 477, + 258 + ], + "blocks": [ + { + "bbox": [ + 394, + 210, + 477, + 258 + ], + "lines": [ + { + "bbox": [ + 394, + 210, + 477, + 258 + ], + "spans": [ + { + "bbox": [ + 394, + 210, + 477, + 258 + ], + "type": "image", + "image_path": "b0eb41385e14ced321c4f08e82756cd73414879d000fa86b6d4ffb0520cd6868.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 308, + 260, + 391, + 308 + ], + "blocks": [ + { + "bbox": [ + 308, + 260, + 391, + 308 + ], + "lines": [ + { + "bbox": [ + 308, + 260, + 391, + 308 + ], + "spans": [ + { + "bbox": [ + 308, + 260, + 391, + 308 + ], + "type": "image", + "image_path": "58494ce09c3c6a5d269b67dd65d7848933c0c36a847f862dc2832f063c6b2788.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 394, + 260, + 477, + 308 + ], + "blocks": [ + { + "bbox": [ + 394, + 260, + 477, + 308 + ], + "lines": [ + { + "bbox": [ + 394, + 260, + 477, + 308 + ], + "spans": [ + { + "bbox": [ + 394, + 260, + 477, + 308 + ], + "type": "image", + "image_path": "7858bfb59716c21bec63af284be45011b9aa2efecd1a1ba5f8458216564d3ead.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 308, + 309, + 391, + 357 + ], + "blocks": [ + { + "bbox": [ + 308, + 309, + 391, + 357 + ], + "lines": [ + { + "bbox": [ + 308, + 309, + 391, + 357 + ], + "spans": [ + { + "bbox": [ + 308, + 309, + 391, + 357 + ], + "type": "image", + "image_path": "078a520e807a8eddd2818aea14760bb666f7aeafceeba6433e4bc3932c28db52.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 358, + 482, + 392 + ], + "lines": [ + { + "bbox": [ + 304, + 358, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 304, + 358, + 482, + 392 + ], + "type": "text", + "content": "Fig. 4: Similarity vs. epochs for LoRA on styles. Models with IMMA achieve lower similarity throughout LoRA's epochs." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 394, + 309, + 476, + 357 + ], + "blocks": [ + { + "bbox": [ + 394, + 309, + 476, + 357 + ], + "lines": [ + { + "bbox": [ + 394, + 309, + 476, + 357 + ], + "spans": [ + { + "bbox": [ + 394, + 309, + 476, + 357 + ], + "type": "image", + "image_path": "d4ab72431c0f47ab00bf69a6f817ef0fb9315352166b52f58f6b05adcf69ad30.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + } + ], + "index": 14 + }, + { + "type": "table", + "bbox": [ + 306, + 438, + 479, + 476 + ], + "blocks": [ + { + "bbox": [ + 304, + 415, + 480, + 437 + ], + "lines": [ + { + "bbox": [ + 304, + 415, + 480, + 437 + ], + "spans": [ + { + "bbox": [ + 304, + 415, + 480, + 437 + ], + "type": "text", + "content": "Table 2: SGR ↑(%) on objects for ESD with LoRA adaptation." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 306, + 438, + 479, + 476 + ], + "lines": [ + { + "bbox": [ + 306, + 438, + 479, + 476 + ], + "spans": [ + { + "bbox": [ + 306, + 438, + 479, + 476 + ], + "type": "table", + "html": "
SGRCass. playerGarbage truckGas pumpChain sawEn. springerGolf ballchurchFrench hornParachuteTrench
(L)11.667.4816.6427.3322.4241.9610.096.8850.9739.14
(C)3.665.1819.728.7215.0810.6712.518.1119.3411.07
(D)12.1620.031.3150.8668.8558.0914.3330.2568.5661.84
", + "image_path": "300b9a461c90c56cc670dd976ead2db61495da82945ed301c40fa0f85d35d8eb.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "table_body" + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 308, + 484, + 391, + 533 + ], + "blocks": [ + { + "bbox": [ + 308, + 484, + 391, + 533 + ], + "lines": [ + { + "bbox": [ + 308, + 484, + 391, + 533 + ], + "spans": [ + { + "bbox": [ + 308, + 484, + 391, + 533 + ], + "type": "image", + "image_path": "fdbf8aff4a614b25dea595a0c45f596fe356c6b341fa1974e635622bc92d3160.jpg" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_body" + } + ], + "index": 18 + }, + { + "type": "image", + "bbox": [ + 394, + 484, + 476, + 533 + ], + "blocks": [ + { + "bbox": [ + 394, + 484, + 476, + 533 + ], + "lines": [ + { + "bbox": [ + 394, + 484, + 476, + 533 + ], + "spans": [ + { + "bbox": [ + 394, + 484, + 476, + 533 + ], + "type": "image", + "image_path": "c254d8fac75ab5ec054ccc4d279d6d3c35ec0193cda9ead1a352dad7624d12cb.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 308, + 534, + 391, + 581 + ], + "blocks": [ + { + "bbox": [ + 308, + 534, + 391, + 581 + ], + "lines": [ + { + "bbox": [ + 308, + 534, + 391, + 581 + ], + "spans": [ + { + "bbox": [ + 308, + 534, + 391, + 581 + ], + "type": "image", + "image_path": "db1ac2764db1c95837b3ff550bce7b19e32de4efc72a0d39669d4ba3daed3722.jpg" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_body" + } + ], + "index": 20 + }, + { + "type": "image", + "bbox": [ + 394, + 534, + 476, + 581 + ], + "blocks": [ + { + "bbox": [ + 394, + 534, + 476, + 581 + ], + "lines": [ + { + "bbox": [ + 394, + 534, + 476, + 581 + ], + "spans": [ + { + "bbox": [ + 394, + 534, + 476, + 581 + ], + "type": "image", + "image_path": "3caf703fa086183bc1af640e07c1ff9d975dbdbfa015dc1f565659eb7a8d41a9.jpg" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_body" + } + ], + "index": 21 + }, + { + "type": "image", + "bbox": [ + 308, + 584, + 391, + 631 + ], + "blocks": [ + { + "bbox": [ + 308, + 584, + 391, + 631 + ], + "lines": [ + { + "bbox": [ + 308, + 584, + 391, + 631 + ], + "spans": [ + { + "bbox": [ + 308, + 584, + 391, + 631 + ], + "type": "image", + "image_path": "f2b1312f102456f67760df31c2be1ccf770d84a8366bd01db4f0325bfe8cfffc.jpg" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 632, + 481, + 665 + ], + "lines": [ + { + "bbox": [ + 304, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 304, + 632, + 481, + 665 + ], + "type": "text", + "content": "Fig.5: Similarity vs. epochs for LoRA on objects. Models with IMMA achieve lower similarity throughout LoRA's epochs." + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_caption" + } + ], + "index": 22 + }, + { + "type": "image", + "bbox": [ + 394, + 584, + 476, + 631 + ], + "blocks": [ + { + "bbox": [ + 394, + 584, + 476, + 631 + ], + "lines": [ + { + "bbox": [ + 394, + 584, + 476, + 631 + ], + "spans": [ + { + "bbox": [ + 394, + 584, + 476, + 631 + ], + "type": "image", + "image_path": "8c1604116a7a6133fcc9eb4b45065ca1e0437cfebf13d42ac1be338820d96b08.jpg" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_body" + } + ], + "index": 23 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 273, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 273, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 273, + 101 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 173, + 168, + 438, + 319 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 3: Acc. (\\%) of object erased models on 500 images. Col. 1: Original ESD model with the target concept erased. Col. 2: ESD without IMMA after LoRA. We observe that the target concept is successfully relearned. Col. 3: ESD with IMMA after LoRA. Col. 4 & 5: Acc. of other objects of ESD before and after IMMA." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 173, + 168, + 438, + 319 + ], + "lines": [ + { + "bbox": [ + 173, + 168, + 438, + 319 + ], + "spans": [ + { + "bbox": [ + 173, + 168, + 438, + 319 + ], + "type": "table", + "html": "
Class name / MethodsAcc. of LoRA's target (↓)Acc. of others (↑)
ESDw/o IMMAw/ IMMAESDw/ IMMA
Cassette player0.22.00.272.046.4
Garbage truck3.040.87.663.825.5
Gas pump0.063.40.062.739.8
Chain saw0.015.20.879.352.5
EN springer0.415.60.867.249.6
Golf ball0.422.40.056.436.7
Church5.673.411.882.370.0
French horn0.280.20.464.957.6
Parachute2.091.00.078.858.9
Tench1.050.80.478.055.5
Average1.345.52.270.649.3
", + "image_path": "dcd0f57d4ac28cf0e8886b8b5ab9defd5d31a845e02a05150f5b38b1a6bbd53f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 347, + 482, + 408 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 482, + 408 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 482, + 408 + ], + "type": "text", + "content": "visualize LPIPS, CLIP, and DINO in Fig. 5. Overall, we observe the same trend as in the result for artistic styles. Similarity metrics across all the plots drop for models with IMMA. That is, with the same number of fine-tuning epochs, generations from models with IMMA exhibit lower quality or are less related to the object." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "text", + "content": "As the target concept contains objects, we consider classification accuracy (ResNet50 pre-trained on ImageNet) for evaluation reported in Tab. 3. First, without IMMA, ESD can relearn to generate the object. With a mere three epochs of LoRA, the average accuracy of the target concept increased from " + }, + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "inline_equation", + "content": "1.3\\%" + }, + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "inline_equation", + "content": "45.5\\%" + }, + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "text", + "content": ". On the other hand, ESD with IMMA, the average accuracy remains low at " + }, + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "inline_equation", + "content": "2.2\\%" + }, + { + "bbox": [ + 130, + 411, + 482, + 483 + ], + "type": "text", + "content": ", demonstrating the effectiveness of IMMA at preventing relearning." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 486, + 482, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 545 + ], + "type": "text", + "content": "Thus far, the evaluation has focused on the target concept for IMMA models. We are also interested in how well IMMA preserves the other concepts. We define \"other concepts\" to be the remaining nine object categories beside the target object that is being adapted. In Tab. 3 (rightmost two columns), we observe that the original ESD has an average of " + }, + { + "bbox": [ + 130, + 486, + 482, + 545 + ], + "type": "inline_equation", + "content": "70.6\\%" + }, + { + "bbox": [ + 130, + 486, + 482, + 545 + ], + "type": "text", + "content": " and after IMMA the accuracy" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "text", + "content": "dropped to " + }, + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "inline_equation", + "content": "49.3\\%" + }, + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "text", + "content": ". We fully acknowledge that this is a limitation of IMMA. Prevention against certain target concepts may degrade other concepts. IMMA roughly trades off " + }, + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "inline_equation", + "content": "43\\%" + }, + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "text", + "content": " in the target concept with " + }, + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 546, + 299, + 665 + ], + "type": "text", + "content": " in other concepts. Finally, qualitative comparisons are shown in Fig. 6, where we observe the same conclusion that IMMA is effective against re-learning." + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 302, + 546, + 482, + 668 + ], + "blocks": [ + { + "bbox": [ + 302, + 546, + 482, + 668 + ], + "lines": [ + { + "bbox": [ + 302, + 546, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 302, + 546, + 482, + 668 + ], + "type": "image", + "image_path": "1fe0eb63460460c35b79595b72ae7cffc33d124280365b257f8472d4d8b10b0d.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 176, + 114, + 429, + 222 + ], + "blocks": [ + { + "bbox": [ + 176, + 114, + 429, + 222 + ], + "lines": [ + { + "bbox": [ + 176, + 114, + 429, + 222 + ], + "spans": [ + { + "bbox": [ + 176, + 114, + 429, + 222 + ], + "type": "image", + "image_path": "caec41ed7bbd26e7c38943c390b6fcd2e85c34e0951c96efa0c4e95a6c7b8ead.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "lines": [ + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "type": "text", + "content": "Fig. 7: IMMA on NSFW content. We report the " + }, + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\%" + }, + { + "bbox": [ + 130, + 225, + 482, + 248 + ], + "type": "text", + "content": " of change, relative to SD V1-4, in the number of detected nudity content after LoRA on the nudity-erased model." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 251, + 482, + 323 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 482, + 323 + ], + "type": "text", + "content": "Results on NSFW. For experiments on NSFW concepts, we use SD V1-4 to generate 4,703 unsafe images, among which 351 images contain 454 nudity counts based on NudeNet [1] with a threshold of 0.05. We randomly select two sets of 50 images containing nudity and their corresponding prompts for relearning adaptation and the other for IMMA. The evaluation is conducted on the remaining 251 unsafe prompts." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 324, + 482, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 324, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 324, + 482, + 407 + ], + "type": "text", + "content": "In Fig. 7, we compare the percentage of change before and after IMMA adaptation with respect to the base SD V1-4 model. We observe that IMMA successfully generated less nudity content after LoRA, i.e., w/ IMMA achieved a negative " + }, + { + "bbox": [ + 130, + 324, + 482, + 407 + ], + "type": "inline_equation", + "content": "80\\%" + }, + { + "bbox": [ + 130, + 324, + 482, + 407 + ], + "type": "text", + "content": " of change in the detected nudity content compared to the negative " + }, + { + "bbox": [ + 130, + 324, + 482, + 407 + ], + "type": "inline_equation", + "content": "60\\%" + }, + { + "bbox": [ + 130, + 324, + 482, + 407 + ], + "type": "text", + "content": " change for the model without IMMA. This shows that IMMA successfully immunized the model making it more difficult to re-learn nudity from unsafe images/prompts." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 415, + 367, + 426 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 415, + 367, + 426 + ], + "spans": [ + { + "bbox": [ + 131, + 415, + 367, + 426 + ], + "type": "text", + "content": "5.2 Immunizing against personalized content" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 431, + 482, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 431, + 482, + 539 + ], + "spans": [ + { + "bbox": [ + 130, + 431, + 482, + 539 + ], + "type": "text", + "content": "Experiment setup. We consider three adaptation methods for learning new unique/personalized concepts: Textual Inversion (TI) [12], DreamBooth (DB) [39], and DreamBooth LoRA. For DreamBooth LoRA (DB LoRA), instead of modifying all of the parameters during fine-tuning, LoRA is applied on top of the cross-attention layers. We follow the exact adaptation procedures following prior works [12, 39], i.e., adding a special token for the new unique concept. Note, we use different novel tokens during adaptation and IMMA. This is because, for a realistic evaluation, we would not know the novel token that would be used during the adaptation." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 540, + 482, + 587 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 540, + 482, + 587 + ], + "spans": [ + { + "bbox": [ + 130, + 540, + 482, + 587 + ], + "type": "text", + "content": "We perform experiments on ten different datasets released by Kumari et al. [24] which include a variety of unique objects. Each of them contains four to six images taken in the real world. The evaluation prompt for all concepts in this section is \"A " + }, + { + "bbox": [ + 130, + 540, + 482, + 587 + ], + "type": "inline_equation", + "content": "[V]" + }, + { + "bbox": [ + 130, + 540, + 482, + 587 + ], + "type": "text", + "content": " on the beach\" following DreamBooth." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 588, + 482, + 637 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 588, + 482, + 637 + ], + "spans": [ + { + "bbox": [ + 130, + 588, + 482, + 637 + ], + "type": "text", + "content": "Evaluation metrics. In this task, we report SGR in Eq. (7) with CLIP and DINO following DreamBooth [39]. Next, to show that the model maintains its capability to be personalized for other concepts, we propose Relative Similarity Gap Ratio (RSGR), which is given by" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 192, + 641, + 482, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 641, + 482, + 669 + ], + "spans": [ + { + "bbox": [ + 192, + 641, + 482, + 669 + ], + "type": "interline_equation", + "content": "\\operatorname {R S G R} \\left(\\mathbf {x} _ {\\mathcal {I}}, \\mathbf {x} _ {\\mathcal {A}}, \\mathbf {x} _ {\\mathcal {I}} ^ {o}, \\mathbf {x} _ {\\mathcal {A}} ^ {o}\\right) = \\frac {\\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {o} , \\mathbf {x} _ {\\mathcal {I}} ^ {o}\\right) - \\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} , \\mathbf {x} _ {\\mathcal {I}}\\right)}{\\mathcal {M} \\left(\\mathbf {x} _ {\\mathcal {A}} ^ {o} , \\mathbf {x} _ {\\mathcal {I}} ^ {o}\\right)}, \\tag {8}", + "image_path": "d3489b604a77a0a627e49ea2cb011578e6d672adef689867a77ee92e52d4e93c.jpg" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 138, + 479, + 201 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "type": "text", + "content": "Table 4: SGR (%) on personalized content adaptation. Higher positive values indicate better immunization quality." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 138, + 479, + 201 + ], + "lines": [ + { + "bbox": [ + 134, + 138, + 479, + 201 + ], + "spans": [ + { + "bbox": [ + 134, + 138, + 479, + 201 + ], + "type": "table", + "html": "
castlecarchairglassesinstrumentwoodenpotlighthousemotorbikehouseplantpurseAverage
TISGR(C)9.358.328.5513.788.610.757.8212.1615.355.809.05
SGR(D)53.4937.0840.1928.5048.857.0436.3348.3641.2324.4336.55
DBSGR(C)2.0314.44-8.600.912.185.80-1.192.371.213.592.27
SGR(D)12.5627.01-14.6713.3724.6429.31-7.410.759.2124.9711.97
DBSGR(C)8.6017.490.2511.7313.662.167.670.980.053.586.62
LoraSGR(D)43.2134.378.9437.6340.3832.7048.366.4024.880.5227.74
", + "image_path": "d712d042c32ef143214f88dabb3d30a0a03fa8508cf38930fcfefda1f29e70b4.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 134, + 233, + 479, + 297 + ], + "blocks": [ + { + "bbox": [ + 131, + 209, + 479, + 231 + ], + "lines": [ + { + "bbox": [ + 131, + 209, + 479, + 231 + ], + "spans": [ + { + "bbox": [ + 131, + 209, + 479, + 231 + ], + "type": "text", + "content": "Table 5: RSGR (%) on personalized content adaptation. Higher positive values indicate better performance at maintaining other concepts." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 233, + 479, + 297 + ], + "lines": [ + { + "bbox": [ + 134, + 233, + 479, + 297 + ], + "spans": [ + { + "bbox": [ + 134, + 233, + 479, + 297 + ], + "type": "table", + "html": "
castle car chair glasses instrument woodenpot lighthouse motorbike houseplant purse Average
TIRSGR (C)15.2420.198.499.7819.148.8920.5718.5916.320.9913.82
RSGR (D)70.6963.5722.540.157.6634.1551.8567.1855.228.8847.18
DBRSGR (C)19.6613.636.624.974.444.6116.536.085.1210.369.20
RSGR (D)36.9935.9817.7232.0424.5923.2835.062.6025.0550.128.34
DBRSGR (C)17.5521.004.493.8912.248.4224.288.6711.774.8311.71
LoRARSGR (D)49.6641.5718.925.4129.9235.9253.1228.6341.0224.7434.89
", + "image_path": "1e58eb776ab6f552465827041cbd1f4636ca5c5d1857bd96924bc953c21d521a.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 311, + 480, + 335 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 480, + 335 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 311, + 480, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathcal{A}}^o" + }, + { + "bbox": [ + 130, + 311, + 480, + 335 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 311, + 480, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathcal{I}}^o" + }, + { + "bbox": [ + 130, + 311, + 480, + 335 + ], + "type": "text", + "content": " are generated images without and with IMMA on other unique concepts." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 348, + 299, + 515 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 348, + 299, + 515 + ], + "spans": [ + { + "bbox": [ + 130, + 348, + 299, + 515 + ], + "type": "text", + "content": "The term " + }, + { + "bbox": [ + 130, + 348, + 299, + 515 + ], + "type": "inline_equation", + "content": "\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}^{o},\\mathbf{x}_{\\mathcal{I}}^{o})" + }, + { + "bbox": [ + 130, + 348, + 299, + 515 + ], + "type": "text", + "content": " captures image similarity for other concepts with and without IMMA. Ideally, this term should be high as IMMA should not affect other concepts. The term " + }, + { + "bbox": [ + 130, + 348, + 299, + 515 + ], + "type": "inline_equation", + "content": "\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}},\\mathbf{x}_{\\mathcal{I}})" + }, + { + "bbox": [ + 130, + 348, + 299, + 515 + ], + "type": "text", + "content": " captures the image similarity for target concepts with and without IMMA. In this case, the similarity should be low. RSGR reports the difference between these two terms as a ratio. Intuitively, larger RSGR indicates IMMA is better at preserving the other concepts while removing the target concept." + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 305, + 337, + 394, + 383 + ], + "blocks": [ + { + "bbox": [ + 305, + 337, + 394, + 383 + ], + "lines": [ + { + "bbox": [ + 305, + 337, + 394, + 383 + ], + "spans": [ + { + "bbox": [ + 305, + 337, + 394, + 383 + ], + "type": "image", + "image_path": "f410812149081ef4c33f74d8a8e3d6aa899b61122761ba58875f8407e35ba48f.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 397, + 337, + 477, + 383 + ], + "blocks": [ + { + "bbox": [ + 397, + 337, + 477, + 383 + ], + "lines": [ + { + "bbox": [ + 397, + 337, + 477, + 383 + ], + "spans": [ + { + "bbox": [ + 397, + 337, + 477, + 383 + ], + "type": "image", + "image_path": "c11688e062e4fac67893e06f9800803d0ab5cfe752b96f7091182dad5da56996.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 305, + 384, + 394, + 430 + ], + "blocks": [ + { + "bbox": [ + 305, + 384, + 394, + 430 + ], + "lines": [ + { + "bbox": [ + 305, + 384, + 394, + 430 + ], + "spans": [ + { + "bbox": [ + 305, + 384, + 394, + 430 + ], + "type": "image", + "image_path": "626aa3f290a5cea882a594c1f4c32d5633ef2edfa137530af0560e36c3c36b15.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 397, + 384, + 477, + 430 + ], + "blocks": [ + { + "bbox": [ + 397, + 384, + 477, + 430 + ], + "lines": [ + { + "bbox": [ + 397, + 384, + 477, + 430 + ], + "spans": [ + { + "bbox": [ + 397, + 384, + 477, + 430 + ], + "type": "image", + "image_path": "35cab22c3a5d7c5e82a34a0aba94fbb3ad18ad06b202708a57c49b4c97be6a0c.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 305, + 431, + 394, + 477 + ], + "blocks": [ + { + "bbox": [ + 305, + 431, + 394, + 477 + ], + "lines": [ + { + "bbox": [ + 305, + 431, + 394, + 477 + ], + "spans": [ + { + "bbox": [ + 305, + 431, + 394, + 477 + ], + "type": "image", + "image_path": "08aaddc213d7b4d62ac869e42ced5f5a53f7dc313de49f989fd5a8e15fac77a7.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 478, + 480, + 511 + ], + "lines": [ + { + "bbox": [ + 304, + 478, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 304, + 478, + 480, + 511 + ], + "type": "text", + "content": "Fig. 8: CLIP and DINO similarity on other concept vs. target concept. The gap between the two lines shows RSGR." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 397, + 431, + 477, + 477 + ], + "blocks": [ + { + "bbox": [ + 397, + 431, + 477, + 477 + ], + "lines": [ + { + "bbox": [ + 397, + 431, + 477, + 477 + ], + "spans": [ + { + "bbox": [ + 397, + 431, + 477, + 477 + ], + "type": "image", + "image_path": "128e4444461358a97d9476a144de3408573df8f598218793b8402c80528389f8.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 517, + 479, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 517, + 479, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 517, + 479, + 540 + ], + "type": "text", + "content": "We also conducted a user study for personalized adaptation using the setting as in Sec. 5.1." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 544, + 479, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 479, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 479, + 604 + ], + "type": "text", + "content": "Results on personalization. In Tab. 4 we observe a positive ratio among most of the SGR metrics, except for \"furniture chair\" and \"lighthouse\" with Dreambooth highlighted in red. We show the generations with negative SGR in the appendix. Overall, IMMA effectively prevents the pre-trained model from learning personalization concepts across the three adaptation methods." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "type": "text", + "content": "Next, Tab. 5 reports RSGR to evaluate how well IMMA preserves the ability to personalize other concepts. As we can see, the RSGR values are consistently positive across all the datasets. This indicates IMMA immunizes against the target concept without hurting the adaptability for personalizing for other concepts. We directly visualize this relative gap in Fig. 8. As shown, the lines of the nine concepts" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 182, + 127, + 239, + 183 + ], + "blocks": [ + { + "bbox": [ + 190, + 116, + 231, + 125 + ], + "lines": [ + { + "bbox": [ + 190, + 116, + 231, + 125 + ], + "spans": [ + { + "bbox": [ + 190, + 116, + 231, + 125 + ], + "type": "text", + "content": "Reference" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 182, + 127, + 239, + 183 + ], + "lines": [ + { + "bbox": [ + 182, + 127, + 239, + 183 + ], + "spans": [ + { + "bbox": [ + 182, + 127, + 239, + 183 + ], + "type": "image", + "image_path": "2b18cbca2614bd7f021f3bbedf468f7d2cf49d4565fa5864654343a1e9e316f7.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 240, + 130, + 252, + 181 + ], + "lines": [ + { + "bbox": [ + 240, + 130, + 252, + 181 + ], + "spans": [ + { + "bbox": [ + 240, + 130, + 252, + 181 + ], + "type": "text", + "content": "YNNNI O/A" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 256, + 127, + 310, + 183 + ], + "blocks": [ + { + "bbox": [ + 276, + 116, + 288, + 125 + ], + "lines": [ + { + "bbox": [ + 276, + 116, + 288, + 125 + ], + "spans": [ + { + "bbox": [ + 276, + 116, + 288, + 125 + ], + "type": "text", + "content": "TI" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 256, + 127, + 310, + 183 + ], + "lines": [ + { + "bbox": [ + 256, + 127, + 310, + 183 + ], + "spans": [ + { + "bbox": [ + 256, + 127, + 310, + 183 + ], + "type": "image", + "image_path": "a3cb0dca82a613a6dea6c1796961f5e73a52f78a7623bb8f747ee42742a12efb.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 312, + 127, + 367, + 183 + ], + "blocks": [ + { + "bbox": [ + 333, + 116, + 347, + 125 + ], + "lines": [ + { + "bbox": [ + 333, + 116, + 347, + 125 + ], + "spans": [ + { + "bbox": [ + 333, + 116, + 347, + 125 + ], + "type": "text", + "content": "DB" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 312, + 127, + 367, + 183 + ], + "lines": [ + { + "bbox": [ + 312, + 127, + 367, + 183 + ], + "spans": [ + { + "bbox": [ + 312, + 127, + 367, + 183 + ], + "type": "image", + "image_path": "83273643c336a8e1ca9148ef5452eb757eb9c3f4bc2577a47463f923a1a987fc.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 369, + 127, + 425, + 183 + ], + "blocks": [ + { + "bbox": [ + 375, + 116, + 417, + 125 + ], + "lines": [ + { + "bbox": [ + 375, + 116, + 417, + 125 + ], + "spans": [ + { + "bbox": [ + 375, + 116, + 417, + 125 + ], + "type": "text", + "content": "DB LoRA" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 369, + 127, + 425, + 183 + ], + "lines": [ + { + "bbox": [ + 369, + 127, + 425, + 183 + ], + "spans": [ + { + "bbox": [ + 369, + 127, + 425, + 183 + ], + "type": "image", + "image_path": "80f781a4cb70f738d1a3b4ca08def454f4df6262f2ef3fd6bf9b91d0926a0054.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 182, + 185, + 239, + 242 + ], + "blocks": [ + { + "bbox": [ + 182, + 185, + 239, + 242 + ], + "lines": [ + { + "bbox": [ + 182, + 185, + 239, + 242 + ], + "spans": [ + { + "bbox": [ + 182, + 185, + 239, + 242 + ], + "type": "image", + "image_path": "72d709677703e90f9ab12e497e4036999ea5f7345d92fb0b8ec2e688fbde9401.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 242, + 185, + 310, + 242 + ], + "blocks": [ + { + "bbox": [ + 242, + 185, + 310, + 242 + ], + "lines": [ + { + "bbox": [ + 242, + 185, + 310, + 242 + ], + "spans": [ + { + "bbox": [ + 242, + 185, + 310, + 242 + ], + "type": "image", + "image_path": "7958a1dc4b4a51ac2be21ece31db329dc52bbf137baa390762a57dd6757a89ed.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 312, + 185, + 367, + 242 + ], + "blocks": [ + { + "bbox": [ + 312, + 185, + 367, + 242 + ], + "lines": [ + { + "bbox": [ + 312, + 185, + 367, + 242 + ], + "spans": [ + { + "bbox": [ + 312, + 185, + 367, + 242 + ], + "type": "image", + "image_path": "2382d2db04feaf03d8a571612359a400b2352aa446a7b616e3af717af38c9334.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 369, + 185, + 425, + 242 + ], + "blocks": [ + { + "bbox": [ + 369, + 185, + 425, + 242 + ], + "lines": [ + { + "bbox": [ + 369, + 185, + 425, + 242 + ], + "spans": [ + { + "bbox": [ + 369, + 185, + 425, + 242 + ], + "type": "image", + "image_path": "ecdbde225c15398f70eca1561f94a6e5abc7f23ce5d6cb5ec555d840c75705ee.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 182, + 245, + 239, + 304 + ], + "blocks": [ + { + "bbox": [ + 182, + 245, + 239, + 304 + ], + "lines": [ + { + "bbox": [ + 182, + 245, + 239, + 304 + ], + "spans": [ + { + "bbox": [ + 182, + 245, + 239, + 304 + ], + "type": "image", + "image_path": "69ef5946a71474dfc4fcda53d9dc8c329d13f3cc57da4171f6991d9c21f0e641.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 242, + 245, + 310, + 303 + ], + "blocks": [ + { + "bbox": [ + 242, + 245, + 310, + 303 + ], + "lines": [ + { + "bbox": [ + 242, + 245, + 310, + 303 + ], + "spans": [ + { + "bbox": [ + 242, + 245, + 310, + 303 + ], + "type": "image", + "image_path": "33012a06ff0eb067de9a3ae4baceb69aa4b19ad4c1b27e2f2feb453842a8015d.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 312, + 245, + 367, + 303 + ], + "blocks": [ + { + "bbox": [ + 312, + 245, + 367, + 303 + ], + "lines": [ + { + "bbox": [ + 312, + 245, + 367, + 303 + ], + "spans": [ + { + "bbox": [ + 312, + 245, + 367, + 303 + ], + "type": "image", + "image_path": "8edc84088288cbc98674c035805a18df8e35226c097fd5ce9297c4fee2d2c9e8.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 369, + 245, + 425, + 303 + ], + "blocks": [ + { + "bbox": [ + 369, + 245, + 425, + 303 + ], + "lines": [ + { + "bbox": [ + 369, + 245, + 425, + 303 + ], + "spans": [ + { + "bbox": [ + 369, + 245, + 425, + 303 + ], + "type": "image", + "image_path": "86d01e88503b46e1b9776e96f771e5a69175e4c4e845e8f65411bcd08eecad7d.jpg" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_body" + } + ], + "index": 18 + }, + { + "type": "image", + "bbox": [ + 182, + 304, + 239, + 361 + ], + "blocks": [ + { + "bbox": [ + 182, + 304, + 239, + 361 + ], + "lines": [ + { + "bbox": [ + 182, + 304, + 239, + 361 + ], + "spans": [ + { + "bbox": [ + 182, + 304, + 239, + 361 + ], + "type": "image", + "image_path": "b26dee41bf2a6fc9ffbdc9b9d41d24c6d336cfcd626093eea2673e2f32b549d6.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 176, + 365, + 432, + 376 + ], + "lines": [ + { + "bbox": [ + 176, + 365, + 432, + 376 + ], + "spans": [ + { + "bbox": [ + 176, + 365, + 432, + 376 + ], + "type": "text", + "content": "Fig. 9: Personalization adaptation w/ and w/o IMMA." + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_caption" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 242, + 304, + 310, + 361 + ], + "blocks": [ + { + "bbox": [ + 242, + 304, + 310, + 361 + ], + "lines": [ + { + "bbox": [ + 242, + 304, + 310, + 361 + ], + "spans": [ + { + "bbox": [ + 242, + 304, + 310, + 361 + ], + "type": "image", + "image_path": "635c8e01f422752a4c8e2f9fd2fc9fbe85e674ae7de68502ef80026986a55cda.jpg" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_body" + } + ], + "index": 20 + }, + { + "type": "image", + "bbox": [ + 312, + 304, + 367, + 361 + ], + "blocks": [ + { + "bbox": [ + 312, + 304, + 367, + 361 + ], + "lines": [ + { + "bbox": [ + 312, + 304, + 367, + 361 + ], + "spans": [ + { + "bbox": [ + 312, + 304, + 367, + 361 + ], + "type": "image", + "image_path": "64553925d2cd9526c7657e66b348a347c4ea31e4d3e30d7eefc741564a124f9a.jpg" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_body" + } + ], + "index": 21 + }, + { + "type": "image", + "bbox": [ + 369, + 304, + 425, + 361 + ], + "blocks": [ + { + "bbox": [ + 369, + 304, + 425, + 361 + ], + "lines": [ + { + "bbox": [ + 369, + 304, + 425, + 361 + ], + "spans": [ + { + "bbox": [ + 369, + 304, + 425, + 361 + ], + "type": "image", + "image_path": "50816ec7f463cc7c7c19a3353d69879d0e9315a0eae7d68d2db99636b0824c21.jpg" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_body" + } + ], + "index": 22 + }, + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "spans": [ + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "inline_equation", + "content": "(\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}^{o}, \\mathbf{x}_{\\mathcal{I}}^{o}) \\uparrow" + }, + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "text", + "content": " in green) and the adaptation of the target concept " + }, + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "inline_equation", + "content": "(\\mathcal{M}(\\mathbf{x}_{\\mathcal{A}}, \\mathbf{x}_{\\mathcal{I}}) \\downarrow" + }, + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "text", + "content": " in blue) can be easily distinguished; consistent with results in Tab. 5." + } + ] + } + ], + "index": 24 + }, + { + "bbox": [ + 130, + 406, + 481, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 481, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 481, + 477 + ], + "type": "text", + "content": "Lastly, we show the generated images in Fig. 9. Comparing the generated images with and without IMMA, we observe models with IMMA are either unable to learn the target concept or generate unrealistic images. We also conducted a user study to validate this observation. All of the 30 participants selected generation without IMMA to be more similar to reference images, i.e., models after IMMA fail to generate the target concepts." + } + ] + } + ], + "index": 25 + }, + { + "bbox": [ + 131, + 491, + 267, + 501 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 491, + 267, + 501 + ], + "spans": [ + { + "bbox": [ + 131, + 491, + 267, + 501 + ], + "type": "text", + "content": "5.3 Additional discussion" + } + ] + } + ], + "index": 26 + }, + { + "bbox": [ + 130, + 509, + 480, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 509, + 480, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 509, + 480, + 556 + ], + "type": "text", + "content": "Comparison with data poisoning. We compare IMMA with MIST [27], one of the data poisoning (DP) methods in the personalized content setup. In Fig. 10 (top-row) we show both MIST and IMMA successfully prevent the model from learning the target concept after Textual Inversion." + } + ] + } + ], + "index": 27 + }, + { + "bbox": [ + 130, + 557, + 480, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 480, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 480, + 592 + ], + "type": "text", + "content": "This observation is also supported by a user study. On seven out of ten evaluated datasets, the majority of the 30 users found the generation without MIST to be of higher quality and more similar to the reference images." + } + ] + } + ], + "index": 28 + }, + { + "bbox": [ + 130, + 594, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 481, + 665 + ], + "type": "text", + "content": "Adaption on images with JPEG compression. As reported in MIST [27], one way to weaken the effect of poisoned data is by compressing the images with JPEG after adaptation. On the other hand, IMMA can defend against JPEG compression by including JPEG images in the training data. In Fig. 10 (bottom row), we observe that after compression, MIST fails to prevent generating the target concept, while IMMA remains robust against JPEG." + } + ] + } + ], + "index": 29 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 195, + 114, + 263, + 193 + ], + "blocks": [ + { + "bbox": [ + 195, + 114, + 263, + 193 + ], + "lines": [ + { + "bbox": [ + 195, + 114, + 263, + 193 + ], + "spans": [ + { + "bbox": [ + 195, + 114, + 263, + 193 + ], + "type": "image", + "image_path": "63f3427d9ec611b3cfb9cb43bb0ae1344228abfaa531195efa93185bb197496e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 265, + 143, + 275, + 176 + ], + "lines": [ + { + "bbox": [ + 265, + 143, + 275, + 176 + ], + "spans": [ + { + "bbox": [ + 265, + 143, + 275, + 176 + ], + "type": "text", + "content": "eae" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 196, + 194, + 264, + 261 + ], + "blocks": [ + { + "bbox": [ + 196, + 194, + 264, + 261 + ], + "lines": [ + { + "bbox": [ + 196, + 194, + 264, + 261 + ], + "spans": [ + { + "bbox": [ + 196, + 194, + 264, + 261 + ], + "type": "image", + "image_path": "54b3272ab78b9e454fa00c62ce1ccfe891866e6d7e0169af837962565cc4af15.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 277, + 114, + 345, + 193 + ], + "blocks": [ + { + "bbox": [ + 277, + 114, + 345, + 193 + ], + "lines": [ + { + "bbox": [ + 277, + 114, + 345, + 193 + ], + "spans": [ + { + "bbox": [ + 277, + 114, + 345, + 193 + ], + "type": "image", + "image_path": "0e3dbd70393ad40a34ff7da532000eeed6b29520c501d58f545a8fc26ea91828.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 278, + 194, + 345, + 262 + ], + "blocks": [ + { + "bbox": [ + 278, + 194, + 345, + 262 + ], + "lines": [ + { + "bbox": [ + 278, + 194, + 345, + 262 + ], + "spans": [ + { + "bbox": [ + 278, + 194, + 345, + 262 + ], + "type": "image", + "image_path": "da31ed2a409d03ad0390d6a96c5be317d9e131362c2ef90aa0f96dbe4c6b9a14.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 262, + 482, + 285 + ], + "lines": [ + { + "bbox": [ + 131, + 262, + 482, + 285 + ], + "spans": [ + { + "bbox": [ + 131, + 262, + 482, + 285 + ], + "type": "text", + "content": "Fig. 10: MIST vs. IMMA. Generation with Textual Inversion on training images w/ and w/o JPEG compression." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 347, + 114, + 414, + 193 + ], + "blocks": [ + { + "bbox": [ + 347, + 114, + 414, + 193 + ], + "lines": [ + { + "bbox": [ + 347, + 114, + 414, + 193 + ], + "spans": [ + { + "bbox": [ + 347, + 114, + 414, + 193 + ], + "type": "image", + "image_path": "cb0376106f6cdd15d651865bb47fa7aa62332a5cf1708077e2c61e309ebd5357.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 347, + 194, + 414, + 262 + ], + "blocks": [ + { + "bbox": [ + 347, + 194, + 414, + 262 + ], + "lines": [ + { + "bbox": [ + 347, + 194, + 414, + 262 + ], + "spans": [ + { + "bbox": [ + 347, + 194, + 414, + 262 + ], + "type": "image", + "image_path": "d49af8f767c8515beaaf863624532b312d0441e29a23ffb2063bc6cce279f45e.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 201, + 289, + 269, + 367 + ], + "blocks": [ + { + "bbox": [ + 201, + 289, + 269, + 367 + ], + "lines": [ + { + "bbox": [ + 201, + 289, + 269, + 367 + ], + "spans": [ + { + "bbox": [ + 201, + 289, + 269, + 367 + ], + "type": "image", + "image_path": "e730396aa651afa82bb9b682cfbb0a4df3066914a01a2d81561a4954b38f0208.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 367, + 482, + 390 + ], + "lines": [ + { + "bbox": [ + 131, + 367, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 131, + 367, + 482, + 390 + ], + "type": "text", + "content": "Fig. 11: Ablation on direct maximization. DreamBooth adaptation on \"luggage purse\" after immunization on \"woodenpot\"." + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 271, + 289, + 339, + 366 + ], + "blocks": [ + { + "bbox": [ + 271, + 289, + 339, + 366 + ], + "lines": [ + { + "bbox": [ + 271, + 289, + 339, + 366 + ], + "spans": [ + { + "bbox": [ + 271, + 289, + 339, + 366 + ], + "type": "image", + "image_path": "9f43012597a731f0a9c036fb64bab70de7f96a4957ae8d770e1ae0b2b1075448.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 341, + 289, + 409, + 366 + ], + "blocks": [ + { + "bbox": [ + 341, + 289, + 409, + 366 + ], + "lines": [ + { + "bbox": [ + 341, + 289, + 409, + 366 + ], + "spans": [ + { + "bbox": [ + 341, + 289, + 409, + 366 + ], + "type": "image", + "image_path": "e8703a69a8fa8250adc31b9cc995a28c5c6e01f210ec51f3c2c82ad9ca2a3ad1.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 408, + 482, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 408, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 408, + 482, + 468 + ], + "type": "text", + "content": "Ablation studies. We conduct ablations using the DreamBooth personalization setup in Sec. 5.2. First, we experiment with a direct maximization baseline, i.e., only the upper-level task in Eq. (3). Results are shown in Fig. 11. We observe that direct maximization ruins the immunized model, i.e., low image quality when being adapted for another concept." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 469, + 482, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 469, + 482, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 469, + 482, + 541 + ], + "type": "text", + "content": "Next, we ablate line 5 and line 7 in Alg. 1 and report CLIP similarity. Shown in Fig. 12 (left), without line 5, the adaptation can learn the target concept, i.e., high CLIP similarity. Next, we ablate whether to update the overlapping parameters in " + }, + { + "bbox": [ + 130, + 469, + 482, + 541 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 469, + 482, + 541 + ], + "type": "text", + "content": " by removing line 7. The result is shown in Fig. 12 (right). We observe that without line 7, the adaptation successfully learns the target concept. These results show the necessity of the proposed steps in Alg. 1." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "text", + "content": "Crossed adaptation with IMMA. Thus far, we report results for IMMA by immunizing the model against the same adaptation method " + }, + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "text", + "content": ". We now investigate whether IMMA remains effective under a different adaptation method during IMMA and adaptation. In other words, we consider IMMA with crossed adaptation methods, where we immunize the pre-trained model using " + }, + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_1" + }, + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "text", + "content": " and perform malicious adaptation on " + }, + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_2" + }, + { + "bbox": [ + 130, + 543, + 482, + 639 + ], + "type": "text", + "content": ". Fig. 13 shows the qualitative results across DB and TI. We observe that the model with IMMA against DreamBooth is also effective when being adapted with Textual Inversion, and vice versa." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "Limitations. Our proposed IMMA and experiments focus on the immunization of a single concept. In this work, we methodically study a variety of adaptation" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 304, + 210 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 304, + 210 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 304, + 210 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 304, + 210 + ], + "type": "image", + "image_path": "b75c203745bbd3955820db724a67ef2acb28613a3f4e4631bcb50856e33e490f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 196, + 213, + 416, + 224 + ], + "lines": [ + { + "bbox": [ + 196, + 213, + 416, + 224 + ], + "spans": [ + { + "bbox": [ + 196, + 213, + 416, + 224 + ], + "type": "text", + "content": "Fig. 12: Ablation on line 5 and line 7 of Alg. 1." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 304, + 114, + 475, + 211 + ], + "blocks": [ + { + "bbox": [ + 304, + 114, + 475, + 211 + ], + "lines": [ + { + "bbox": [ + 304, + 114, + 475, + 211 + ], + "spans": [ + { + "bbox": [ + 304, + 114, + 475, + 211 + ], + "type": "image", + "image_path": "714e86832f9d713d6f2ff6ba9aca24002f48125f3bfbd42362ebb2f96ce55477.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 189, + 232, + 419, + 392 + ], + "blocks": [ + { + "bbox": [ + 189, + 232, + 419, + 392 + ], + "lines": [ + { + "bbox": [ + 189, + 232, + 419, + 392 + ], + "spans": [ + { + "bbox": [ + 189, + 232, + 419, + 392 + ], + "type": "image", + "image_path": "d2b8b6fd5a9083c8b558ab1d5d16cc41740ea7e9b8abb0796b8d241843f0e0ab.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 399, + 482, + 420 + ], + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 420 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 420 + ], + "type": "text", + "content": "Fig. 13: Results on crossed adaptation immunization. First row: DB after IMMA with either DB or TI. Second row: TI after IMMA the model with either DB or TI." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 432, + 482, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 432, + 482, + 492 + ], + "spans": [ + { + "bbox": [ + 130, + 432, + 482, + 492 + ], + "type": "text", + "content": "settings and leave the support for multiple concepts for future work. We believe that results in a single concept demonstrate a convincing step towards model immunization. If the reader is interested, we present preliminary results in the Appendix showing that IMMA can generalize to multiple concepts, albeit, not as comprehensive as the single concept study." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 510, + 220, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 220, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 220, + 521 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "We propose to Immunize Models against Malicious Adaptation (IMMA). Unlike the data-poisoning paradigm, which protects images, our method focuses on protecting pre-trained models from being used by adaptation methods. We formulate \"Immunization\" as a bi-level optimization program to learn a poor model initialization that would make adaptation more difficult. To validate the efficacy of IMMA, we conduct extensive experiments on relearning concepts for erased models and immunizing against the adaptation of personalized content. We believe that model immunization is a promising paradigm for combatting the risk of malicious adaptation, and that IMMA is an encouraging first step. We are hopeful that the advancement of IMMA will result in safer open-source text-to-image models, benefiting both the research community and society." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 141, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 138, + 141, + 481, + 178 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 141, + 481, + 178 + ], + "spans": [ + { + "bbox": [ + 138, + 141, + 481, + 178 + ], + "type": "text", + "content": "1. Bedapudi, P.: NudeNet: Neural nets for nudity classification, detection and selective censoring. https://github.com/plateminto/NudeNetClassifier (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 178, + 481, + 201 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 178, + 481, + 201 + ], + "spans": [ + { + "bbox": [ + 138, + 178, + 481, + 201 + ], + "type": "text", + "content": "2. Bengio, Y.: Gradient-based optimization of hyperparameters. Neural Computation (2000)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 203, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 203, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 138, + 203, + 481, + 226 + ], + "type": "text", + "content": "3. Biggio, B., Nelson, B., Laskov, P.: Support vector machines under adversarial label noise. In: Proc. ACML (2011)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 228, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 481, + 251 + ], + "type": "text", + "content": "4. Bird, C., Ungless, E., Kasirzadeh, A.: Typology of risks of generative text-to-image models. In: Proc. AIES (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 252, + 481, + 287 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 252, + 481, + 287 + ], + "spans": [ + { + "bbox": [ + 138, + 252, + 481, + 287 + ], + "type": "text", + "content": "5. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. CVPR (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 289, + 481, + 312 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 289, + 481, + 312 + ], + "spans": [ + { + "bbox": [ + 138, + 289, + 481, + 312 + ], + "type": "text", + "content": "6. CreativeML Open RAIL-M: Stable Diffusion LICENSE File (2023), URL https://github.com/CompVis/stable-diffusion/blob/main/License" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 313, + 481, + 384 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 313, + 481, + 384 + ], + "spans": [ + { + "bbox": [ + 138, + 313, + 481, + 384 + ], + "type": "text", + "content": "7. Dai, X., Hou, J., Ma, C.Y., Tsai, S., Wang, J., Wang, R., Zhang, P., Vandenhende, S., Wang, X., Dubey, A., Yu, M., Kadian, A., Radenovic, F., Mahajan, D., Li, K., Zhao, Y., Petrovic, V., Singh, M.K., Motwani, S., Wen, Y., Song, Y., Sumbaly, R., Ramanathan, V., He, Z., Vajda, P., Parikh, D.: Emu: Enhancing image generation models using photogenic needles in a haystack. arXiv preprint arXiv:2309.15807 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 386, + 481, + 409 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 386, + 481, + 409 + ], + "spans": [ + { + "bbox": [ + 138, + 386, + 481, + 409 + ], + "type": "text", + "content": "8. DeepFloyd Lab at StabilityAI: DeepFloyd IF. https://github.com/deepfloyd/IF (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 410, + 481, + 434 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 410, + 481, + 434 + ], + "spans": [ + { + "bbox": [ + 138, + 410, + 481, + 434 + ], + "type": "text", + "content": "9. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: ImageNet: A large-scale hierarchical image database. In: Proc. CVPR (2009)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 434, + 481, + 457 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 434, + 481, + 457 + ], + "spans": [ + { + "bbox": [ + 138, + 434, + 481, + 457 + ], + "type": "text", + "content": "10. Dhariwal, P., Nichol, A.: Diffusion models beat GANs on image synthesis. In: Proc. NeurIPS (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 459, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 459, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 138, + 459, + 481, + 482 + ], + "type": "text", + "content": "1. Finn, C., Abbeel, P., Levine, S.: Model-agnostic meta-learning for fast adaptation of deep networks. In: Proc. ICML (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 483, + 481, + 518 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 483, + 481, + 518 + ], + "spans": [ + { + "bbox": [ + 138, + 483, + 481, + 518 + ], + "type": "text", + "content": "2. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. In: Proc. ICLR (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 520, + 481, + 543 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 520, + 481, + 543 + ], + "spans": [ + { + "bbox": [ + 138, + 520, + 481, + 543 + ], + "type": "text", + "content": "3. Gandikota, R., Materzyńska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. In: Proc. ICCV (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 544, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 481, + 567 + ], + "type": "text", + "content": "4. Gandikota, R., Orgad, H., Belinkov, Y., Materzyńska, J., Bau, D.: Unified concept editing in diffusion models. In: Proc. WACV (2024)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 569, + 481, + 592 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 569, + 481, + 592 + ], + "spans": [ + { + "bbox": [ + 138, + 569, + 481, + 592 + ], + "type": "text", + "content": "5. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: Proc. ICLR (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 594, + 481, + 640 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 594, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 138, + 594, + 481, + 640 + ], + "type": "text", + "content": "6. Harwell, D.: AI-generated child sex images spawn new nightmare for the web. The Washington Post (2023), URL https://www.washingtonpost.com/technology/2023/06/19/artificial-intelligence-child-sex-abuse-images/" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 642, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 642, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 642, + 481, + 665 + ], + "type": "text", + "content": "7. Heikkilä, M.: This artist is dominating ai-generated art. and he's not happy about it. MIT Technology Review. Retrieved March 16, 2023 (2022)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 140 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 140 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 140 + ], + "type": "text", + "content": "18. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. arXiv preprint arXiv:2305.10120 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 141, + 481, + 164 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 141, + 481, + 164 + ], + "spans": [ + { + "bbox": [ + 132, + 141, + 481, + 164 + ], + "type": "text", + "content": "19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Proc. NeurIPS (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 166, + 481, + 201 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 166, + 481, + 201 + ], + "spans": [ + { + "bbox": [ + 132, + 166, + 481, + 201 + ], + "type": "text", + "content": "20. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: LoRA: Low-rank adaptation of large language models. In: Proc. ICLR (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 202, + 481, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 202, + 481, + 225 + ], + "spans": [ + { + "bbox": [ + 132, + 202, + 481, + 225 + ], + "type": "text", + "content": "21. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: Proc. NeurIPS (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 227, + 481, + 250 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 250 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 250 + ], + "type": "text", + "content": "22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: Proc. ICLR (2015)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 251, + 481, + 275 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 481, + 275 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 481, + 275 + ], + "type": "text", + "content": "23. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: Proc. ICCV (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 276, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 276, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 276, + 481, + 300 + ], + "type": "text", + "content": "24. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proc. CVPR (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 300, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 481, + 336 + ], + "type": "text", + "content": "25. Larsen, J., Hansen, L.K., Svarer, C., Ohlsson, M.: Design and regularization of neural networks: the optimal use of a validation set. In: IEEE Signal Processing Society Workshop (1996)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 337, + 481, + 360 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 337, + 481, + 360 + ], + "spans": [ + { + "bbox": [ + 132, + 337, + 481, + 360 + ], + "type": "text", + "content": "26. Liang, C., Wu, X.: Mist: Towards improved adversarial examples for diffusion models (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 361, + 481, + 397 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 361, + 481, + 397 + ], + "spans": [ + { + "bbox": [ + 132, + 361, + 481, + 397 + ], + "type": "text", + "content": "27. Liang, C., Wu, X., Hua, Y., Zhang, J., Xue, Y., Song, T., Xue, Z., Ma, R., Guan, H.: Adversarial example does good: Preventing painting imitation from diffusion models via adversarial examples. In: Proc. ICML (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 399, + 481, + 422 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 399, + 481, + 422 + ], + "spans": [ + { + "bbox": [ + 132, + 399, + 481, + 422 + ], + "type": "text", + "content": "28. Lorraine, J., Vicol, P., Duvenaud, D.: Optimizing millions of hyperparameters by implicit differentiation. In: Proc. AISTATS (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 423, + 481, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 423, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 132, + 423, + 481, + 446 + ], + "type": "text", + "content": "29. Mei, S., Zhu, X.: Using machine teaching to identify optimal training-set attacks on machine learners. In: Proc. AAAI (2015)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 447, + 481, + 494 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 481, + 494 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 481, + 494 + ], + "type": "text", + "content": "30. Moore, S.: Can the law prevent AI from duplicating actors? It's complicated. Forbes (Jul 2023), URL https://www.forbes.com/sites/schuylermoore/2023/07/13/proTECTing-celebrities-including-all-actors-from-ai-with-the-right-of-publicity/?sh=5c56ba4159ec" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 495, + 481, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 495, + 481, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 495, + 481, + 531 + ], + "type": "text", + "content": "31. Nichol, A.Q., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., Mcgrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. In: Proc. ICML (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "type": "text", + "content": "32. Noveck, J., O'Brien, M.: Visual artists sue ai companies in sf federal court for repurposing their work. Associated Press (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 557, + 481, + 592 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 481, + 592 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 481, + 592 + ], + "type": "text", + "content": "33. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: SDXL: improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 593, + 481, + 628 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 593, + 481, + 628 + ], + "spans": [ + { + "bbox": [ + 132, + 593, + 481, + 628 + ], + "type": "text", + "content": "34. Qu, Y., Shen, X., He, X., Backes, M., Zannettou, S., Zhang, Y.: Unsafe diffusion: On the generation of unsafe images and hateful memes from text-to-image models. arXiv preprint arXiv:2305.13873 (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 630, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 630, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 630, + 481, + 665 + ], + "type": "text", + "content": "35. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with CLIP latents. arXiv preprint arXiv:2204.06125 (2022)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 272, + 101 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 140 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 140 + ], + "type": "text", + "content": "36. Rando, J., Paleka, D., Lindner, D., Heim, L., Tramér, F.: Red-teaming the stable diffusion safety filter. In: Proc. NeurIPS ML Safety Workshop (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 164 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 164 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 164 + ], + "type": "text", + "content": "37. Ren, Z., Yeh, R., Schwing, A.: Not all unlabeled data are equal: Learning to weight data in semi-supervised learning (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 165, + 482, + 199 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 165, + 482, + 199 + ], + "spans": [ + { + "bbox": [ + 130, + 165, + 482, + 199 + ], + "type": "text", + "content": "38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proc. CVPR (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 200, + 482, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 482, + 236 + ], + "type": "text", + "content": "39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: DreamBooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proc. CVPR (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "text", + "content": "40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., Ho, J., Fleet, D.J., Norouzi, M.: Photorealistic text-to-image diffusion models with deep language understanding. In: Proc. NeurIPS (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 284, + 482, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 284, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 482, + 308 + ], + "type": "text", + "content": "41. Salman, H., Khaddaj, A., Leclerc, G., Ilyas, A., Madry, A.: Raising the cost of malicious AI-powered image editing. In: Proc. ICML (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 308, + 482, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 342 + ], + "type": "text", + "content": "42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proc. CVPR (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 343, + 482, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 343, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 343, + 482, + 402 + ], + "type": "text", + "content": "43. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5B: An open large-scale dataset for training next generation image-text models. In: Proc. NeurIPS (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 403, + 482, + 438 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 438 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 438 + ], + "type": "text", + "content": "44. Shan, S., Cryan, J., Wenger, E., Zheng, H., Hanocka, R., Zhao, B.Y.: Glaze: Protecting artists from style mimicry by text-to-image models. In: USENIX Security Symposium (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 439, + 482, + 462 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 439, + 482, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 439, + 482, + 462 + ], + "type": "text", + "content": "45. SmithMano: Tutorial: How to remove the safety filter in 5 seconds. Reddit (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 463, + 482, + 498 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 463, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 463, + 482, + 498 + ], + "type": "text", + "content": "46. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: Proc. ICML (2015)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 498, + 482, + 521 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 521 + ], + "type": "text", + "content": "47. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: Proc. NeurIPS (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 522, + 482, + 546 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 546 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 546 + ], + "type": "text", + "content": "48. Vincent, P.: A connection between score matching and denoising autoencoders. Neural computation (2011)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 547, + 482, + 581 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 547, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 547, + 482, + 581 + ], + "type": "text", + "content": "49. Wang, Z., Chen, C., Liu, Y., Lyu, L., Metaxas, D., Ma, S.: How to detect unauthorized data usages in text-to-image diffusion models. arXiv preprint arXiv:2307.03108 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 582, + 482, + 605 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 605 + ], + "type": "text", + "content": "50. Yeh, R.A., Hu, Y.T., Hasegawa-Johnson, M., Schwing, A.: Equivariance discovery by learned parameter-sharing. In: Proc. AISTATS (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 606, + 482, + 640 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 482, + 640 + ], + "type": "text", + "content": "51. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "52. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proc. CVPR (2018)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 154, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMMA: Immunizing text-to-image Models against Malicious Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 115, + 482, + 200 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 132, + 115, + 482, + 152 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 115, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 132, + 115, + 482, + 152 + ], + "type": "text", + "content": "53. Zhao, Z., Duan, J., Hu, X., Xu, K., Wang, C., Zhang, R., Du, Z., Guo, Q., Chen, Y.: Unlearnable examples for diffusion models: Protect data from unauthorized exploitation. arXiv preprint arXiv:2306.01902 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 152, + 481, + 176 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 152, + 481, + 176 + ], + "spans": [ + { + "bbox": [ + 132, + 152, + 481, + 176 + ], + "type": "text", + "content": "54. Zheng, A.Y., He, T., Qiu, Y., Wang, M., Wipf, D.: Graph machine learning through the lens of bilevel optimization. In: Proc. AISTATS (2024)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 177, + 481, + 200 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 177, + 481, + 200 + ], + "spans": [ + { + "bbox": [ + 132, + 177, + 481, + 200 + ], + "type": "text", + "content": "55. Zheng, A.Y., Yang, C.A., Yeh, R.A.: Learning to obstruct few-shot image classification over restricted classes. In: Proc. ECCV (2024)" + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 272, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 272, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 272, + 102 + ], + "type": "text", + "content": "A.Y. Zheng and R.A. Yeh" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_content_list.json b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..8e7a3d9c784c5a0670362fdaf648c9c4f63cafd4 --- /dev/null +++ b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_content_list.json @@ -0,0 +1,1716 @@ +[ + { + "type": "text", + "text": "INTRA: Interaction Relationship-aware Weakly Supervised Affordance Grounding", + "text_level": 1, + "bbox": [ + 261, + 140, + 738, + 185 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ji Ha Jang $^{1*}$ , Hoigi Seo $^{1*}$ , and Se Young Chun $^{1,2\\dagger}$", + "bbox": [ + 299, + 210, + 700, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Dept. of Electrical and Computer Engineering, $^{2}$ INMC & IPAI Seoul National University, Republic of Korea {jeeit17, sehoiki3215, sychun}@snu.ac.kr", + "bbox": [ + 287, + 238, + 712, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Affordance denotes the potential interactions inherent in objects. The perception of affordance can enable intelligent agents to navigate and interact with new environments efficiently. Weakly supervised affordance grounding teaches agents the concept of affordance without costly pixel-level annotations, but with exocentric images. Although recent advances in weakly supervised affordance grounding yielded promising results, there remain challenges including the requirement for paired exocentric and egocentric image dataset, and the complexity in grounding diverse affordances for a single object. To address them, we propose INTERaction Relationship-aware weakly supervised Affordance grounding (INTRA). Unlike prior arts, INTRA recasts this problem as representation learning to identify unique features of interactions through contrastive learning with exocentric images only, eliminating the need for paired datasets. Moreover, we leverage vision-language model embeddings for performing affordance grounding flexibly with any text, designing text-conditioned affordance map generation to reflect interaction relationship for contrastive learning and enhancing robustness with our text synonym augmentation. Our method outperformed prior arts on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD. Additionally, experimental results demonstrate that our method has remarkable domain scalability for synthesized images / illustrations and is capable of performing affordance grounding for novel interactions and objects. Project page: https://jeeit17.github.io/INTRA", + "bbox": [ + 261, + 316, + 738, + 635 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Affordance grounding $\\cdot$ Weak supervision $\\cdot$ Exocentric image $\\cdot$ Contrastive learning $\\cdot$ Interaction relation", + "bbox": [ + 259, + 648, + 740, + 676 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 724, + 375, + 739 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Affordance [17] refers to the perceived possible interactions based on an object's inherent or recognized properties (e.g., the rim of a wine glass affords sipping while stem of it affords holding). Humans can identify affordances of objects and interact with proper parts despite the diversity in their physical attributes.", + "bbox": [ + 212, + 755, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "*Authors contributed equally. † Corresponding author.", + "bbox": [ + 217, + 823, + 591, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/7020819b9d47883bc814855fff9dacc26e639943e4f4c868997a02d87a17dcce.jpg", + "image_caption": [ + "Fig. 1: Prior works on weakly-supervised affordance grounding like LOCATE [25] often failed to ground different affordances for the same object. However, our proposed INTRA yielded finer and more accurate grounding results for them that are closer to the ground truth (GT) by considering interaction relationship among them." + ], + "image_footnote": [], + "bbox": [ + 235, + 146, + 769, + 299 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This ability can be acquired through individual learning, by directly interacting with objects, and observational learning [8], by observing others' interactions. The sense of affordance enables effective interaction in new environments or with novel objects, without step-by-step instructions [57]. Affordance plays an essential role across numerous applications involving intelligent agents, enabling them to provide flexible and timely responses in complex, dynamic environments [5]. These applications include task planning, robot grasping, manipulation, scene understanding and action prediction [2,6,7,16,51,62].", + "bbox": [ + 212, + 400, + 787, + 521 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Affordance grounding is the task to teach intelligent systems how to locate possible action regions in objects for a certain interaction. While fully supervised learning [4, 18, 42, 58] is the most straightforward approach, its reliance on costly annotations may limit its applicability across diverse contexts. Another approach is weakly supervised learning, similar to human's observational learning [8], that does not require GT, but weak labels. In this setting, exocentric images illustrating human-object interactions, along with corresponding egocentric images depicting the objects, are provided during training. During inference, intelligent systems perform affordance grounding on the egocentric images, identifying object parts relevant to the given interactions. Recent advances in weakly supervised affordance grounding [25, 31, 32, 41] proposed to use pairs of exocentric and egocentric images, yielding great performance. The deep neural networks learn affordances by pulling features from exocentric and egocentric images closer, aiming to focus on object parts related to interactions.", + "bbox": [ + 212, + 522, + 787, + 734 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, weakly supervised affordance grounding remains challenging. Firstly, the requirement for current weak labels with pairs of exocentric and egocentric images is still strong. Note that human observational learning does not usually require egocentric images. Secondly, a complex relationship between interactions exists, which has not been adequately addressed in prior works. Many instances in object-interaction relationships exhibit intricate many-to-many associations, occasionally with one entailing another. For example, some distinct", + "bbox": [ + 212, + 734, + 789, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "interactions represent the same affordance regions (e.g., 'wash' and 'brush with' a tooth brush), and there are closely related interactions that always come together (e.g., 'sip' usually includes 'hold'. 'ride' usually includes 'sit on'). This complexity poses challenges in extracting interaction-relevant features based on image-level affordance labels, introducing biases towards objects in affordance grounding as illustrated in Fig. 1 (LOCATE [25] often yielded similar affordance grounding with different interactions for the same object).", + "bbox": [ + 212, + 146, + 782, + 252 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Here, we propose a novel weakly supervised affordance grounding method, INTRA (INTeraction Relationship-aware weakly supervised Affordance grounding) to address these unexplored challenges. While previous studies [31,41] solved the weak supervision problem as supervised learning by pulling object features of exocentric and egocentric images closer and LOCATE [25] enhanced this approach by generating more localized pseudo labels based on prior information for exocentric images for supervised learning (i.e., containing human, object part, and background), our INTRA framework recasts the weak supervision problem as representation learning. This novel reformulation allows us to use weaker labels (i.e., exocentric images only) for training so that the requirement to use pairs of exocentric / egocentric images is now alleviated. Moreover, unlike prior works, our INTRA method actively exploits large language model (LLM) as well as the text encoder of the vision-language model (VLM) to leverage linguistic information and existing textual knowledge on affordances, which further enhances our interaction relationship-guided contrastive learning. This novel scheme also allows excellent scalability for unseen objects across diverse domains as well as zero-shot inference for novel interactions, which was not possible in prior arts. In summary, our main contributions are three-fold as follows:", + "bbox": [ + 212, + 252, + 787, + 523 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose a novel approach for weakly supervised affordance grounding by recasting the problem as representation learning and by leveraging VLM, leading to relaxing the need for paired training datasets for more weak supervision and enhancing scalability across domains for unseen objects.", + "- We proposed INTRA, a novel method that consists of text synonym augmentation and text-conditioned affordance map generation module along with interaction relationship-guided contrastive learning, so that inference on unseen interactions is possible.", + "- Our INTRA outperforms the prior arts in weakly supervised affordance grounding on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD, demonstrating both qualitative and quantitative excellence (see Fig. 1)." + ], + "bbox": [ + 225, + 532, + 782, + 699 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 722, + 395, + 738 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Affordance Grounding", + "text_level": 1, + "bbox": [ + 215, + 753, + 446, + 768 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Supervised affordance grounding. Supervised affordance grounding methods [10, 14] analyze interaction videos / images to predict affordance regions on an object, trained with pixel-level GT masks / heat maps. Though successful in localizing fine-grained affordance regions through supervised learning, they are", + "bbox": [ + 212, + 779, + 784, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 372, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "limited by the costly GT mask annotation process and their limited generalizability to unseen objects. Furthermore, they require paired demonstration videos and target object images, making real-world application challenging.", + "bbox": [ + 215, + 146, + 784, + 191 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Weakly supervised affordance grounding. Weakly supervised affordance grounding methods [13,20,23,25,31-33,41,47] offer the advantage of not requiring GT, but requiring weak labels such as exocentric images with interaction text labels. Prior works [25,31,32,41] mainly align interaction-relevant object features from both egocentric and exocentric images without considering the intrinsic properties of interactions. The framework in [41] predicts object features engaged in interactions by analyzing human-object interaction videos. The works of [31, 32] preserve the correlation of affordance features from exocentric and egocentric images to learn affordances. The work of [25] enhances object feature extraction by adopting DINO-ViT [9] based Class Activation Maps (CAM) [64] and k-means clustering [35] for more explicit guidance. However, focusing solely on object features may introduce biases towards object, hindering the inference of multiple affordances for a single object. Our INTRA addresses this issue by considering the complex relationships between interactions using interaction relationship-guided contrastive loss, while ensuring the network remains attentive to the objects using object-variance mitigation loss.", + "bbox": [ + 215, + 213, + 787, + 455 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Foundation Models for Affordance Grounding", + "text_level": 1, + "bbox": [ + 215, + 476, + 638, + 492 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Self-supervised transformer. Self-supervised transformers, extensively trained on large-scale datasets and scalability, possess robust representation power. Previous works [25,52] have explored their potential in affordance grounding. DINO-ViT [9], a vision transformer foundation model trained in a self-supervised manner, can identify both high-semantics such as overall information of the image and low-semantics such as details regarding specific object parts. This versatility has led advancements in various tasks, including classification, semantic segmentation [4, 24] and semantic correspondence [61]. LOCATE [25] leverages DINO-ViT to extract low-semantic information, resulting in performance improvements in affordance grounding. Our INTRA employed DINOv2 [46] as an image encoder to extract information about objects and their constituent parts.", + "bbox": [ + 215, + 500, + 792, + 667 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Vision-language model. The Vision-Language Model (VLM) is a class of models jointly pretrained on visual and language data for various downstream tasks [45, 56, 60]. VLM text encoders, trained through contrastive learning with image-text pairs, capture representations in the joint space of the images and text [26-28, 50]. These text encoders, incorporating visual information, have demonstrated excellent performance across multiple tasks. ALBEF [28] notably enhances vision and language representation learning by aligning image and text features before fusing them. While supervised affordance grounding methods leveraging VLM text encoders [44] have been explored, their application in weakly supervised affordance grounding remains underexplored. We propose a", + "bbox": [ + 215, + 688, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/c7dda98a940578a5a159642fae60980216b791e327e9f2a8f5a1c8421e41c57e.jpg", + "image_caption": [ + "Fig. 2: Overall frameworks of (a) LOCATE [25] and (b) INTRA (Ours). LOCATE takes paired exocentric and egocentric images to generate interaction-aware affordance maps (CAMs) for predefined interactions and then selects an interaction-related CAM by the given interaction label. In contrast, INTRA takes only exocentric images and interaction labels to yield an affordance map through our affordance map generation module. Training is done via interaction relationship-guided contrastive learning on exocentric features from affordance maps. Note that all encoder parameters are frozen." + ], + "image_footnote": [], + "bbox": [ + 215, + 143, + 787, + 303 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "framework leveraging the text encoder of ALBEF to enable novel interactions, diverging from prior arts limited to inferring predetermined sets of affordances.", + "bbox": [ + 212, + 444, + 782, + 474 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Large language model. Understanding affordance relationships is crucial for affordance grounding, as it enables extending and linking learned visual cues, and reasoning about affordances for new objects, interactions, or situations. While prior works like [19] leverage semantically similar object properties and [32] utilize affordance feature correlation, none directly exploit these relationships. We use these intricate relationships in affordance learning by adopting Large Language Models (LLMs). LLMs have gained prominence in robotics due to their profound natural language understanding, providing valuable priors about interactions and their complex relationships. Previous works [3,29,54,63] focus on extracting action knowledge, deriving task-specific plans, and grounding them in the physical world. LLMs have also been widely used in previous affordance studies [37,55], demonstrating their exceptional understanding of interactions.", + "bbox": [ + 212, + 497, + 787, + 679 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 702, + 328, + 718 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Prior arts in weakly supervised affordance grounding [25, 31, 32, 41] typically align object features of paired exocentric (interaction with object) and egocentric (object only) images to learn interaction-related features. For example, as illustrated in Fig. 2(a), LOCATE [25] generates CAMs (affordance maps) from exocentric and egocentric images for a pre-determined interaction label, extracts egocentric feature as well as exocentric object parts feature selected by PartS-select module (pseudo label), and then trains the model by optimizing cosine", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 374, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "similarity to align (pull) egocentric and exocentric object parts features. In contrast, we propose an alternative approach, INTRA, whose overall framework is illustrated in Fig. 2(b). Our text-conditioned affordance grounding framework of INTRA leverages VLM text encoder in affordance map generation module and employs text synonym augmentation to enhance robustness, as will be described in Sec. 3.1. Then, INTRA learn affordance grounding via our interaction relationship-guided contrastive learning, detailed in Sec. 3.2. The framework of INTRA as depicted in Fig. 2(b) clearly suggests two advantages over prior arts including LOCATE [25]: 1) it exploits exocentric images only and 2) INTRA admits novel interactions outside the pre-defined interaction set.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Text-conditioned Affordance Grounding Framework", + "text_level": 1, + "bbox": [ + 214, + 318, + 689, + 333 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To utilize the semantic meanings inherent in interaction labels and enable flexible inference on novel verbs, our text-conditioned affordance grounding framework generates affordance maps by conditioning image features with text features via our affordance map generation module where text and image features extracted from separately pre-trained text and image encoders are fused. In specific, as depicted in Fig. 2(b), deep features $\\mathcal{F}_{exo} \\in \\mathbb{R}^{(h \\times w) \\times d}$ are obtained from the input exocentric images using DINOv2 [46], where $h$ and $w$ represent the height and width of the affordance map, and $d$ refers to the dimension of the feature. The text feature $\\mathcal{F}_{text}$ of the given interaction is obtained using the ALBEF text encoder [28]. See the supplementary material for further details on the rationale for employing DINOv2 and the ablation study on the text encoder.", + "bbox": [ + 212, + 343, + 787, + 510 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Affordance map generation module. Before fusing text and image features, the class token of $\\mathcal{F}_{text}$ passes through a single linear layer to align the separately pre-trained image and text embedding spaces and connect them, as shown to be effective in previous works [30,65]. Subsequently, image features $\\mathcal{F}_{exo}$ and the class token of text features are concatenated and processed through a transformer encoder for conditioning. The image feature part of the resulting vector is then projected using a multi-layered convolutional network and normalized using min-max normalization to obtain the affordance map $\\mathcal{M}_{aff} \\in \\mathbb{R}^{h \\times w}$ . This affordance map represents the image regions in exocentric images most relevant to interactions. During inference, $\\mathcal{M}_{aff}$ functions directly as an output heatmap, indicating the image regions in egocentric images most relevant to interactions.", + "bbox": [ + 212, + 531, + 787, + 699 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Text synonym augmentation. To enhance the robustness of text conditioning, we integrate text synonym augmentation into our interaction embeddings. Initially, we generate $k_{s}$ synonyms for each interaction label using LLM. Subsequently, any synonyms overlapping with other interaction labels are removed. These synonyms are then randomly selected to substitute the text conditioning interaction embedding, while the original interaction label is retained for interaction relationship-guided contrastive learning. This module enhances overall performance by providing models with enriched interpretations of interactions.", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Interaction Relationship-guided Contrastive Learning", + "text_level": 1, + "bbox": [ + 215, + 146, + 702, + 162 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Our INTRA learns via interaction relationship-guided contrastive learning by comparing exocentric image features across diverse interactions. Our contrastive learning consists of two key components, 1) extracting exocentric image features with affordance map and 2) designing loss for interaction relationship-guided contrastive learning, that enable the grounding of multiple affordances on a single object.", + "bbox": [ + 212, + 170, + 787, + 263 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Exocentric image feature extraction with affordance map. As described in Sec 3.1, a text-conditioned affordance map, $\\mathcal{M}_{aff}$ , is generated to represent interaction-relevant image regions of exocentric images. Then, the exocentric image features $f_{exo}$ corresponding to the affordance map are extracted as follows:", + "bbox": [ + 214, + 282, + 787, + 345 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nf _ {e x o} = (1 / h w) \\Sigma_ {i = 1} ^ {h} \\Sigma_ {j = 1} ^ {w} \\mathcal {F} _ {e x o} (i, j) \\cdot \\mathcal {M} _ {a f f} (i, j) \\in \\mathbb {R} ^ {d}. \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 316, + 358, + 784, + 376 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The resulting $f_{exo}$ is then projected and normalized to obtain the exocentric image feature $z_{exo}$ using an MLP layer, which will be used for training. This projection layer was also used in previous works [11, 12, 59], which have demonstrated the necessity and efficiency of it.", + "bbox": [ + 214, + 380, + 787, + 441 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Loss design for interaction relationship-guided contrastive learning. Supervised contrastive learning [21] effectively derives good representations for each class by focusing on common characteristics in positive pairs while disregarding those in negative pairs like other classes. However, in affordance grounding tasks, treating all other interaction classes as negative pairs may be inadequate due to the complex relationship among interactions. To mitigate this issue, we propose interaction relationship-guided contrastive loss, $\\mathcal{L}_{inter}$ . Furthermore, considering the subtle meaning variations within single interaction classes depending on the object and context, we also propose object-variance mitigation loss, $\\mathcal{L}_{obj}$ . Thus, the total loss for our INTRA is formulated as follows:", + "bbox": [ + 214, + 462, + 787, + 616 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {t o t a l}} = \\mathcal {L} _ {\\text {i n t e r}} + \\lambda_ {\\text {o b j}} \\mathcal {L} _ {\\text {o b j}} \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 410, + 626, + 784, + 642 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\lambda_{obj}$ denotes the control parameter of $\\mathcal{L}_{obj}$ .", + "bbox": [ + 215, + 651, + 573, + 667 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Interaction relationship-guided contrastive loss. In affordance grounding, treating all other interaction classes as negative pairs is inadequate due to the intricate relationships between interactions. For example, 'Wash' and 'Brush with' toothbrush or 'Pour' and 'Seal' bottle represent distinct interactions but act on the same object parts. Manually finding these relationships is time-consuming and impractical as the number of pairs grows quadratically with the number of interaction (see the supplementary). Moreover, although linguistic relationships like synonyms or co-occurrence were considered as substitutes, they are often inadequate and degrade performance. For example, 'Sip' entails 'Hold', but they act on different part of objects, and 'Wash' and 'Cut with' a knife have different", + "bbox": [ + 214, + 689, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 372, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/22f128a0339f15560399fc51d418c53c5104f1412ee116348f91632746573786.jpg", + "image_caption": [ + "Fig. 3: The overall scheme of interaction-relationship map $(\\mathcal{R})$ generation. LLM classifies all pairs of interactions in the dataset as positive or negative through chain of thoughts. This process is based on reasoning if interactions occur on same object parts." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 787, + 289 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "meanings, but they act on the same blade. To mitigate this, we leverage LLM to determine if interaction pairs act on the same object part. Through Chain of Thoughts (CoT), interaction pairs are categorized as positive or negative in three steps as described in Fig. 3. In Step 1, LLM deduces five different objects where both interactions could be performed. In Step 2, LLM identifies object parts where these interactions could occur by considering five objects one by one, not simultaneously. In Step 3, if the identified parts of the interaction pair are the same, the pair is classified as positive; otherwise, negative. Positive pairs are assigned 1 in the interaction-relationship map $\\mathcal{R}$ , and negative pairs are assigned 0. We propose interaction-relationship guided contrastive loss by integrating $\\mathcal{R}$ into supervised contrastive learning as follows:", + "bbox": [ + 212, + 378, + 787, + 544 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {i n t e r} = \\sum_ {i = 1} ^ {2 N} \\frac {- 1}{2 N y _ {i} - 1} \\sum_ {j = 1} ^ {2 N} \\mathcal {R} _ {\\left(y _ {i}, y _ {j}\\right)} \\cdot \\log \\frac {\\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {j} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 N} \\mathbf {1} _ {i \\neq k} \\cdot \\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {k} / \\tau\\right)} \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 277, + 564, + 785, + 614 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $i, j$ are sample indices, $y_{i}, y_{j}$ are class labels, $N_{y_i}$ is the number of samples in the batch labeled with $y_{i}$ , $N$ is the total number of distinct samples in the batch, $z_{exo}^{j}$ is the exocentric image feature vector of each sample, $\\tau$ is the temperature, and $\\mathcal{R}_{(y_i,y_j)}$ is the value of $(y_{i},y_{j})$ pair in interaction-relationship map.", + "bbox": [ + 212, + 632, + 787, + 709 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Object-variance mitigation loss. In the context of affordance, the interpretation of the same interaction can vary significantly based on the object and context. For instance, 'Hold' a baseball bat and a cup may seem similar since both involve grasping an object. However, the former involves gripping the bat's slender part, while the latter entails holding the cup's rounded, protruding part. To address this variance within the same interaction category, we implemented", + "bbox": [ + 212, + 748, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "an object-variance mitigation loss $\\mathcal{L}_{obj}$ as follows:", + "bbox": [ + 215, + 146, + 576, + 164 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\sum_ {i = 1} ^ {2 N} \\frac {- 1}{2 N o _ {i} - 1} \\sum_ {j = 1} ^ {2 N} \\mathbf {1} _ {o _ {i} = o _ {j}} \\cdot \\log \\frac {\\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {j} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 N} \\mathbf {1} _ {i \\neq k} \\cdot \\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {k} / \\tau\\right)} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 313, + 172, + 785, + 219 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $o_i$ , $o_j$ denote object class of $i$ and $j$ .", + "bbox": [ + 215, + 227, + 526, + 242 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 263, + 375, + 280 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experimental Setting", + "text_level": 1, + "bbox": [ + 215, + 292, + 439, + 309 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Dataset and metrics. We conducted an evaluation of our method using the Affordance Grounding Dataset (AGD20K) [32]. AGD20K comprises both exocentric and egocentric images, with 20,061 exocentric images and 3,755 egocentric images labeled with 36 affordances. The dataset support evaluation under two settings: 1) the 'Seen' setting, where the object categories of the training and testing sets are identical, and 2) the 'Unseen' setting, where no objects overlap between the training and test sets. Our approach only used exocentric images in training for all experiments, while other approaches were trained using both egocentric and exocentric images. We employed three evaluation metrics commonly employed in previous affordance grounding methodologies: 1) Kullback-Leibler Divergence (KLD), 2) Similarity (SIM), 3) and Normalized Scanpath Saliency (NSS). These metrics were utilized to quantify the similarity between the distributions of ground truth heatmaps and predicted affordance grounding.", + "bbox": [ + 215, + 316, + 787, + 513 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation details. We employed DINOv2 as the image encoder and ALBEF, fine-tuned with RefCOCO+, as the text encoder. ChatGPT-4 [1] served as the LLM. Images were resized to $384 \\times 384$ , then cropped to $336 \\times 336$ . Training utilized the Adam optimizer [22] with a learning rate of 2e-4 and a batch size of 256. The hyperparameter $\\lambda_{obj}$ was set to 4, and all experiments were conducted on a single NVIDIA A100 GPU. More details are provided in the supplementary.", + "bbox": [ + 215, + 532, + 787, + 625 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Comparison to State-of-the-art Methods", + "text_level": 1, + "bbox": [ + 215, + 645, + 596, + 660 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To comprehensively assess our method, we conduct quantitative and qualitative comparisons with state-of-the-art weakly-supervised grounding methods, incorporating a user study. We further expand our experiments to include additional datasets [40, 43, 53] for a comprehensive evaluation. Refer to the supplementary materials for more details on the experimental settings.", + "bbox": [ + 215, + 667, + 787, + 744 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Quantitative results. We evaluated previous works [15, 25, 31, 32, 36, 41, 48] and our method based on the metrics mentioned above. Tab. 1 shows the quantitative comparison results of our method with prior arts. In both 'Seen' and 'Unseen' setting, our approach surpasses the baseline performances across all three metrics: KLD, SIM, and NSS, thereby setting a new state-of-the-art.", + "bbox": [ + 215, + 763, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 372, + 114, + 732, + 130 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 127 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/031e356e5786dfd7d4b9c43d33fdefd8ad3c6d26d244c95c1c326e688649251b.jpg", + "table_caption": [ + "Table 1: Quantitative results of ours and other baselines [15,25,31,32,36,41,48] on the AGD20K dataset. $\\uparrow / \\downarrow$ indicates that higher / lower the metric is, the better the model performs. INTRA outperformed all baselines, despite being trained only with exocentric images, whereas other models incorporated both exocentric and egocentric images during training." + ], + "table_footnote": [], + "table_body": "
Prior worksSeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Weakly Supervised Object LocalizationEIL [36]1.9310.2850.5222.1670.2270.330
SPA [48]5.5280.2210.3577.4250.1670.262
TS-CAM [15]1.8420.2600.3362.1040.2010.151
Weakly Supervised Affordance GroundingHotspots [41]1.7730.2780.6151.9940.2370.557
Cross-view-AG [32]1.5380.3340.9271.7870.2850.829
Cross-view-AG+ [31]1.4890.3420.9811.7650.2790.882
LOCATE [25]1.2260.4011.1771.4050.3721.157
ExoINTRA (Ours)1.1990.4071.2391.3650.3751.209
", + "bbox": [ + 215, + 224, + 785, + 345 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/629c3a15f95f2ba2f0b040fd6c914daec28572d1e4e24ca58d7e4f4d1cca06d7.jpg", + "table_caption": [ + "Table 2: Quantitative results on the modified IIT-AFF, CAD, and UMD dataset for our method and other baselines [25,31,32]. Models were trained in the 'Seen' setting of AGD20K and tested on the datasets without additional training. INTRA outperformed all baselines on all metrics across all datasets. * Objects with affordances that prior works are unable to predict were eliminated from the datasets for fairness, wheares our method can infer affordances on novel interactions." + ], + "table_footnote": [], + "table_body": "
IIT-AFF* [43]CAD* [53]UMD* [40]
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Cross-View-AG [32]3.8560.0960.8492.5680.1730.5894.7210.0141.287
Cross-View-AG+ [31]3.9200.0951.0722.5290.1760.6634.7530.0131.227
LOCATE [25]3.3150.1151.7092.5280.1870.5584.0830.0262.699
INTRA(Ours)2.6630.1482.5112.0950.2431.2593.0810.0624.195
", + "bbox": [ + 220, + 455, + 782, + 534 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results on additional datasets. We evaluated the generalization and robustness of the INTRA framework, along with previous works [25, 31, 32] trained in the 'Seen' setting of AGD20K, on the IIT-AFF [43], CAD [53], and UMD [40] datasets. The experiment was conducted in the 'Seen' setting due to overlapping objects between these datasets and AGD20K. Each GT was processed in the same way as when evaluating the AGD20K test set. Despite significant domain gaps across datasets, INTRA outperformed in all metrics on all datasets, demonstrating its superior generalizability as shown in Tab. 2. Further details of the experiment can be found in the supplementary material.", + "bbox": [ + 212, + 564, + 787, + 702 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Qualitative results. Fig. 4 and Fig. 5 show our superior grounding precision compared to the baselines, being closer to the GT and finer in granularity. INTRA precisely identifies the exact object part for a given affordance, unlike the baselines, which ground the same parts regardless of the affordances provided.", + "bbox": [ + 212, + 724, + 787, + 787 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "User study. Affordance grounding can be ambiguous depending on context and interpretation, thus relying solely on metrics for evaluation has limita-", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/5660ef248a7789bc692b3e2c07f9f0242a234ceeb81c0e3d225979f9a95cae86.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 236, + 188, + 767, + 397 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/e5117f8a6906506a643262e7c95b6ff5299f42cc7a6fb724033dea422488351e.jpg", + "image_caption": [ + "Fig. 4: Qualitative results of INTRA (Ours) and baseline models [25,31,32] on grounding affordances of multiple potential interactions on a single object. INTRA precisely localizes relevant interaction spots for each interaction. For example, with a knife, it grounds the handle for 'Hold' and the blade for 'Cut with'. For a motorcycle, it accurately grounds the saddle for 'Sit on'. Additionally, for 'Ride', it grounds both the handle and saddle, slightly deviating from the GT but still producing reasonable results, as we usually interacts with handle and saddle to 'Ride' a motorcycle.", + "Fig. 5: Qualitative results comparison between our approach and other baselines [25, 31,32]. Our approach, INTRA, demonstrates superior precision and detail in grounding affordances compared to the baselines. For instance, in the example of 'Drag', while baselines either fail to localize the handle or erroneously ground several other parts, INTRA accurately identifies and grounds the handle of a suitcase with finesse." + ], + "image_footnote": [], + "bbox": [ + 217, + 512, + 784, + 720 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 374, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/582ce9ac3f92e787ef411d91925c98a1017feeef296ee1858f7335a32061cd4b.jpg", + "table_caption": [ + "Table 3: The result of user study on validity, finesse, and separability. Users were asked to score a 5-point scale, and we averaged it for mean opinion score (MOS)." + ], + "table_footnote": [], + "table_body": "
ValidityFinesseSeparability
Cross-View-AG+ [31]2.8973.0222.732
LOCATE [25]3.0542.5732.651
INTRA (Ours)3.1343.1123.221
Ground Truth2.9053.3343.160
", + "bbox": [ + 269, + 184, + 733, + 258 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/b951eddabfb114a66903a4321090a9413115d6adc32c8027ad02c78abf3d0a91.jpg", + "table_caption": [ + "Table 4: Quantitative results of ablation Table 5: Quantitative results of ablation study on our loss design. We incrementally mention study on different $\\mathcal{R}$ . $\\mathcal{L}_{WordNet}$ , added each component of the losses to ex- $\\mathcal{L}_{Word2Vec}$ are calculated using word similarity from WordNet [39], Word2Vec [38]," + ], + "table_footnote": [], + "table_body": "
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
baseline1.6780.3380.8911.5810.3001.100
Linter1.4390.3341.0311.5690.2921.133
Lobj1.3360.3871.2181.5210.3341.042
Linter+Lobj1.1990.4071.2391.3650.3751.209
", + "bbox": [ + 215, + 338, + 496, + 398 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/4a9917b2701d9369c7b11b12b15b10e4c39071a44841954a43f6e5be944dd6fa.jpg", + "table_caption": [ + "respectively. $\\mathcal{L}_{Co - occur}$ used cooccurrence probability in GloVe [49]." + ], + "table_footnote": [], + "table_body": "
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
LWordNet1.7010.2820.7101.6980.2770.937
LCo-occur.1.5190.3090.9881.6390.2741.101
LWord2Vec1.5470.3020.9581.6790.2700.980
Linter(Ours)1.4390.3341.0311.5690.2921.133
", + "bbox": [ + 500, + 367, + 779, + 425 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "tions. Hence, we conducted a user study comparing Cross-View-AG+ [31], LOCATE [25], GT, and INTRA (Ours) across three categories: 1) Validity: assessing heatmap reasonableness, 2) Finesse: measuring heatmap detail, 3) Separability: determining the accuracy of the heatmap when different affordances are assigned to the same object. A total of 936 responses were collected for randomly selected samples from 104 respondents. Results presented in Tab. 3 demonstrate that our approach outperforms baselines and par on GT based on human perception.", + "bbox": [ + 212, + 452, + 787, + 559 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Ablation Studies", + "text_level": 1, + "bbox": [ + 215, + 579, + 401, + 592 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We validate our pipeline design choices and parameters with ablation studies. This section includes ablation studies on loss design, adoption of LLM, and text synonym augmentation. Refer to the supplementary for further ablation studies.", + "bbox": [ + 212, + 602, + 785, + 648 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation study on loss design. To assess the individual impact of the components comprising loss on its overall performance, we analyzed by incrementally adding components. We started with the most basic element: a normal supervised contrastive loss. Subsequently, we sequentially added an interaction relationship-guided loss and an object-variance mitigation loss. The performance outcomes of these incremental modifications were thoroughly evaluated to understand their contributions, as represented in the Tab. 4.", + "bbox": [ + 212, + 667, + 787, + 773 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation study on adoption of LLM. Adopting LLM to create the relationship map was essential given the intricate nature of affordances. We experimented with various methods to create the relationship map to validate this", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/cd03b425f1121cc4d387f2bb7e3ea6d9e874dbbb64a0badf91808b19e843bb8d.jpg", + "image_caption": [ + "(a) Overall training scheme", + "Fig. 6: An illustration of interaction relationship-guided contrastive learning and t-SNE [34] visualization of feature distribution. (a) In interaction relationship-guided contrastive learning, positive interaction pairs attract each other, while others repel. (b) t-SNE visualization of DINOv2 [46] class token and $f_{exo}$ from INTRA, showing that features of positive interaction pairs become closer as learning progresses." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 436, + 220 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/2f28eef7242e00b72dddbec94a7baea632df2c5bb7d5a4fd14cd866560aa4e7f.jpg", + "image_caption": [ + "(b) Feature t-SNE before (left) / after (right) training" + ], + "image_footnote": [], + "bbox": [ + 460, + 146, + 776, + 219 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "choice. We measured the similarity of interaction pairs using WordNet [39] and Word2Vec [38], or computed co-occurrence probability of interaction pairs with Glove [49]. Based on these measurements, we created an Interaction-relationship Map and trained the INTRA framework. The results are in the Tab. 5.", + "bbox": [ + 212, + 340, + 787, + 402 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablation study on text synonym augmentation. We conducted an ablation study on the effectiveness of text synonym augmentation on overall performance. We compared performance with and without the module. The module improved performance by up to $21.93\\%$ , particularly in the 'Unseen' setting, enriching models with varied meanings of interactions. Additionally, to test its effectiveness on novel verb inference, we deliberately omitted the subset 'Hold' $(24.17\\%$ of training data) and then performed inference on 'Hold'. The module boosted performance for novel verbs by up to $58.06\\%$ . Similar tendencies were observed for other verbs. Detailed results are available in the supplementary.", + "bbox": [ + 212, + 421, + 787, + 556 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Discussion", + "text_level": 1, + "bbox": [ + 215, + 577, + 354, + 593 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.1 Effect of Interaction Relationship-guided Contrastive Loss", + "text_level": 1, + "bbox": [ + 212, + 606, + 740, + 622 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Our rationale for learning affordance grounding solely with exocentric images relies on the consistent presence of humans within these images. By repelling common features of negative pairs, such as human parts, the images effectively exclude irrelevant elements. Conversely, positive pairs, sharing the desired feature of the object—specifically, the rim of the object near the face—facilitate learning by attracting these relevant features (see Fig. 6(a)). To visualize the effectiveness of our loss in learning interaction-relevant features in similar images, we examine the feature distributions of 'Hold' and 'Sip' a wine glass, involving distinct affordances. Prior to training, these distributions overlap. However, after training with our loss function, the feature distribution for 'Hold wine glass' aligns more closely with 'Hold baseball bat' than with 'Sip wine glass'. This indicates that our loss function effectively discriminates between the characteristics of different interactions without exhibiting bias towards objects (see Fig. 6(b)). Detailed explanation is illustrated in the supplementary.", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 372, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/15beebd5b9e48617d6b475afa0f523683f104eaaf76111c33295ceeb71a3b55e.jpg", + "image_caption": [ + "LOCATE", + "I" + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 349, + 193 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/9a088ffbdca4c0668c0cdda3e51ad906048ea60a2ef9e7bcdc30e1e1d57b2d53.jpg", + "image_caption": [ + "NTRA (Ours)" + ], + "image_footnote": [], + "bbox": [ + 300, + 143, + 352, + 193 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/3c2ed3fcff53b2073ea464166f73eb8a568ebf1c9828d6f9fd7518a6f731995a.jpg", + "image_caption": [ + "LOCATE", + "INTRA (Ours)" + ], + "image_footnote": [], + "bbox": [ + 352, + 143, + 480, + 193 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/5a78434d2b3c40acf354603f86c9f38c7091ea3b19291267bda5b87faeefe66a.jpg", + "image_caption": [ + "LOCATE" + ], + "image_footnote": [], + "bbox": [ + 503, + 143, + 553, + 193 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/27b6617b1f9ab4ac8713a58350ece750ab4b9c4ec0ab3814637ea722fd48a7c7.jpg", + "image_caption": [ + "INTRA (Ours)" + ], + "image_footnote": [], + "bbox": [ + 555, + 143, + 630, + 193 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/19f0fdcb0706975354da39ab1e45e84a751b42c4f04b9cd29c24d073d732e0a0.jpg", + "image_caption": [ + "LOCATE" + ], + "image_footnote": [], + "bbox": [ + 632, + 143, + 702, + 193 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/fa02b5539059f4fc628065abe31a73813c59c7f746aae32e6226c33cbbad62d6.jpg", + "image_caption": [ + "INTRA (Ours)" + ], + "image_footnote": [], + "bbox": [ + 705, + 143, + 779, + 193 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/e1520ca8e27c6b1e5bf6533121065a435d3b8273e45f8faba9e9c3118bf57289.jpg", + "image_caption": [ + "(a) Qualitative results on images with large domain gap", + "LOCATE", + "INTRA (Ours)", + "(b) Qualitative results on novel object", + "Fig. 7: Qualitative results of feasibility study: (a) Inference on diverse images with significant domain gap such as pixel arts and paintings. (b) Inference on novel objects that were not in the training data. (c) Inference on unseen novel interactions. INTRA demonstrates superior grounding accuracy in (a)-(c) compared to LOCATE [25], showing proper affordance region inference without explicit training." + ], + "image_footnote": [], + "bbox": [ + 222, + 222, + 352, + 273 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/4f8fee92a96460febad49c8ac69422710c337eff1aefd471cf43b32edc1cffce.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 354, + 222, + 382, + 273 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/2c0d4dcf1d0097afa88e3a54ff337f4a04ab6e18ded2dc7cbbb3d9c7234865d4.jpg", + "image_caption": [ + "LOCATE" + ], + "image_footnote": [], + "bbox": [ + 383, + 222, + 421, + 273 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/3599100b474b887a6d85e7d4983d38ebbc9396a2862fcd3930f81c45942dc174.jpg", + "image_caption": [ + "INTRA (Ours)" + ], + "image_footnote": [], + "bbox": [ + 421, + 222, + 447, + 273 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/efeea2d7dc02216fe05e0fc483d751561b9e11f0feaadbd451155e41f7937c2e.jpg", + "image_caption": [ + "(c) Qualitative results on novel interaction" + ], + "image_footnote": [], + "bbox": [ + 524, + 222, + 643, + 273 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/a0d3af061ce5c842bdef17af318a0c05b64339c91b8e19435449cc21bf968ccc.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 645, + 222, + 779, + 273 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5.2 Feasibility Study on Generalization Property of INTRA", + "text_level": 1, + "bbox": [ + 214, + 410, + 720, + 425 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "INTRA excels in affordance grounding on images with large domain gaps, such as pixel art and paintings, as illustrated in Fig. 7(a). Furthermore, our method showcases strong generalization abilities for novel objects like a horse and quill, not present in the training set, as shown in Fig. 7(b). Additionally, despite deliberately not being trained on specific interaction classes like 'Hold' and 'Take photo' for experiment, INTRA successfully infers their affordances, as depicted in Fig. 7(c). More results and detailed experimental settings are in the supplementary. One possible explanation for this generalization property is that our INTRA employs VLM so that diverse domains and novel object can be dealt with without explicitly tuning for them. Another explanation is INTRA's contrastive training that may achieve better representation learning.", + "bbox": [ + 212, + 446, + 787, + 613 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 214, + 646, + 359, + 662 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we introduce INTRA, a novel framework reformulating the weakly supervised affordance grounding with representation learning. We suggest interaction relationship-guided contrastive learning, informed by affordance knowledge from LLM. Furthermore, INTRA actively leverages VLM text embedding in proposed text-conditioned affordance map generation for flexible affordance grounding, further bolstered by text synonym augmentation for robustness. INTRA achieves state-of-the-art performance across diverse datasets, relying solely on exocentric images for training, unlike prior methods that also use egocentric images. Moreover, our method demonstrates generalization feasibility on novel objects, interactions, and images with significant domain gaps.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)], the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. NRF-2022M3C1A309202211) and AI-Bio Research Grant through Seoul National University. Also, the authors acknowledged the financial support from the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University.", + "bbox": [ + 212, + 176, + 787, + 299 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 321, + 321, + 337 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023)", + "2. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Fu, C., Gopalakrishnan, K., Hausman, K., Herzog, A., Ho, D., Hsu, J., Ibarz, J., Ichter, B., Irpan, A., Jang, E., Ruano, R.J., Jeffrey, K., Jesmonth, S., Joshi, N., Julian, R., Kalashnikov, D., Kuang, Y., Lee, K.H., Levine, S., Lu, Y., Luu, L., Parada, C., Pastor, P., Quiambao, J., Rao, K., Rettinghouse, J., Reyes, D., Sermanet, P., Sievers, N., Tan, C., Toshev, A., Vanhoucke, V., Xia, F., Xiao, T., Xu, P., Xu, S., Yan, M., Zeng, A.: Do as i can and not as i say: Grounding language in robotic affordances. In: arXiv:2204.01691 (2022)", + "3. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Gopalakrishnan, K., Hausman, K., Herzog, A., et al.: Do as i can, not as i say: Grounding language in robotic affordances. arXiv:2204.01691 (2022)", + "4. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv:2112.05814 (2021)", + "5. Ardón, P., Pairet, É., Lohan, K.S., Ramamoorthy, S., Petrick, R.: Affordances in robotic tasks-a survey. arXiv:2004.07400 (2020)", + "6. Ardón, P., Pairet, E., Petrick, R.P., Ramamoorthy, S., Lohan, K.S.: Learning grasp affordance reasoning through semantic relations. RA-L pp. 4571-4578 (2019)", + "7. Bahl, S., Mendonca, R., Chen, L., Jain, U., Pathak, D.: Affordances from human videos as a versatile representation for robotics. In: CVPR. pp. 13778-13790 (2023)", + "8. Burke, C.J., Tobler, P.N., Baddeley, M., Schultz, W.: Neural mechanisms of observational learning. PNAS pp. 14431-14436 (2010)", + "9. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021)", + "0. Chen, J., Gao, D., Lin, K.Q., Shou, M.Z.: Affordance grounding from demonstration video to target image. In: CVPR. pp. 6799-6808 (2023)", + "1. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)", + "2. Chen, X., He, K.: Exploring simple siamese representation learning. In: CVPR. pp. 15750-15758 (2021)", + "3. Cornia, M., Baraldi, L., Serra, G., Cucchiara, R.: A deep multi-level network for saliency prediction. In: ICPR. pp. 3488-3493 (2016)" + ], + "bbox": [ + 225, + 353, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 372, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Fang, K., Wu, T.L., Yang, D., Savarese, S., Lim, J.J.: Demo2vec: Reasoning object affordances from online videos. In: CVPR. pp. 2139-2147 (2018)", + "15. Gao, W., Wan, F., Pan, X., Peng, Z., Tian, Q., Han, Z., Zhou, B., Ye, Q.: Ts-cam: Token semantic coupled attention map for weakly supervised object localization. In: ICCV. pp. 2886-2895 (2021)", + "16. Geng, Y., An, B., Geng, H., Chen, Y., Yang, Y., Dong, H.: Rlafford: End-to-end affordance learning for robotic manipulation. In: ICRA. pp. 5880-5886 (2023)", + "17. Gibson, J.: The Ecological Approach to Visual Perception. Resources for ecological psychology, Lawrence Erlbaum Associates (1986)", + "18. Hadjivelichkov, D., Zwane, S., Agapito, L., Deisenroth, M.P., Kanoulas, D.: One-shot transfer of affordance regions? affcorrs! In: CoRL. pp. 550-560 (2023)", + "19. Hou, Z., Yu, B., Qiao, Y., Peng, X., Tao, D.: Affordance transfer learning for human-object interaction detection. In: CVPR. pp. 495-504 (2021)", + "20. Huang, Y., Cai, M., Li, Z., Sato, Y.: Predicting gaze in egocentric video by learning task-dependent attention transition. In: ECCV. pp. 754-769 (2018)", + "21. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS 33, 18661-18673 (2020)", + "22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv:1412.6980 (2014)", + "23. Kümmerer, M., Wallis, T.S., Bethge, M.: Deepgaze ii: Reading fixations from deep features trained on object recognition. arXiv:1610.01563 (2016)", + "24. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask dino: Towards a unified transformer-based framework for object detection and segmentation. In: CVPR. pp. 3041-3050 (2023)", + "25. Li, G., Jampani, V., Sun, D., Sevilla-Lara, L.: Locate: Localize and transfer object parts for weakly supervised affordance grounding. In: CVPR. pp. 10922-10931 (2023)", + "26. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv:2301.12597 (2023)", + "27. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: ICML. pp. 12888-12900 (2022)", + "28. Li, J., Selvaraju, R., Gotmare, A., Joty, S., Xiong, C., Hoi, S.C.H.: Align before fuse: Vision and language representation learning with momentum distillation. NeurIPS pp. 9694-9705 (2021)", + "29. Liang, J., Huang, W., Xia, F., Xu, P., Hausman, K., Ichter, B., Florence, P., Zeng, A.: Code as policies: Language model programs for embodied control. In: ICRA. pp. 9493-9500 (2023)", + "30. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. NeurIPS (2023)", + "31. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Grounded affordance from exocentric view. arXiv:2208.13196 (2022)", + "32. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning affordance grounding from exocentric images. In: CVPR. pp. 2252-2261 (2022)", + "33. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning visual affordance grounding from demonstration videos. IEEE Transactions on Neural Networks and Learning Systems (2023)", + "34. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research (2008)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "35. MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. vol. 1, pp. 281-297. Oakland, CA, USA (1967)", + "36. Mai, J., Yang, M., Luo, W.: Erasing integrated learning: A simple yet effective approach for weakly supervised object localization. In: CVPR. pp. 8766-8775 (2020)", + "37. Mees, O., Borja-Diaz, J., Burgard, W.: Grounding language with visual affordances over unstructured data. In: ICRA. pp. 11576-11582 (2023)", + "38. Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. ICLR (2013)", + "39. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM pp. 39-41 (1995)", + "40. Myers, A., Teo, C.L., Fermüller, C., Aloimonos, Y.: Affordance detection of tool parts from geometric features. In: ICRA. pp. 1374-1381 (2015)", + "41. Nagarajan, T., Feichtenhofer, C., Grauman, K.: Grounded human-object interaction hotspots from video. In: ICCV. pp. 8688-8697 (2019)", + "42. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Detecting object affordances with convolutional neural networks. In: IROS. pp. 2765-2770 (2016)", + "43. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Object-based affordances detection with convolutional neural networks and dense conditional random fields. In: IROS. pp. 5908-5915 (2017)", + "44. Nguyen, T., Vu, M.N., Vuong, A., Nguyen, D., Vo, T., Le, N., Nguyen, A.: Open-vocabulary affordance detection in 3d point clouds. In: IROS. pp. 5692-5698 (2023)", + "45. Ning, S., Qiu, L., Liu, Y., He, X.: Hoiclip: Efficient knowledge transfer for hoi detection with vision-language models. In: CVPR. pp. 23507-23517 (2023)", + "46. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv:2304.07193 (2023)", + "47. Pan, J., Ferrer, C.C., McGuinness, K., O'Connor, N.E., Torres, J., Sayrol, E., Giro-i Nieto, X.: Salgan: Visual saliency prediction with generative adversarial networks. arXiv:1701.01081 (2017)", + "48. Pan, X., Gao, Y., Lin, Z., Tang, F., Dong, W., Yuan, H., Huang, F., Xu, C.: Unveiling the potential of structure preserving for weakly supervised object localization. In: CVPR. pp. 11642-11651 (2021)", + "49. Pennington, J., Socher, R., Manning, C.D.: Glove: Global vectors for word representation. In: EMNLP. pp. 1532-1543 (2014)", + "50. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021)", + "51. Rana, K., Haviland, J., Garg, S., Abou-Chakra, J., Reid, I., Suenderhauf, N.: Say-plan: Grounding large language models using 3d scene graphs for scalable task planning. In: CoRL (2023)", + "52. Rashid, A., Sharma, S., Kim, C.M., Kerr, J., Chen, L.Y., Kanazawa, A., Goldberg, K.: Language embedded radiance fields for zero-shot task-oriented grasping. In: CoRL (2023)", + "53. Sawatzky, J., Srikantha, A., Gall, J.: Weakly supervised affordance detection. In: CVPR. pp. 2795-2804 (2017)", + "54. Singh, I., Blukis, V., Mousavian, A., Goyal, A., Xu, D., Tremblay, J., Fox, D., Thomason, J., Garg, A.: Progprompt: Generating situated robot task plans using large language models. In: ICRA. pp. 11523-11530 (2023)", + "55. Tang, J., Zheng, G., Yu, J., Yang, S.: Cotdet: Affordance knowledge prompting for task driven object detection. In: ICCV. pp. 3068-3078 (2023)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Interaction Relationship-aware Affordance Grounding", + "bbox": [ + 374, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "56. Wan, B., Tuytelaars, T.: Exploiting clip for zero-shot hoi detection requires knowledge distillation at multiple levels. In: WACV. pp. 1805-1815 (2024)", + "57. Warren, W.: Perceiving affordances: Visual guidance of stair climbing. Journal of experimental psychology. Human perception and performance pp. 683-703 (1984)", + "58. Xu, R., Chu, F.J., Tang, C., Liu, W., Vela, P.A.: An affordance keypoint detection network for robot manipulation. IEEE RA-L pp. 2870-2877 (2021)", + "59. Xue, Y., Gan, E., Ni, J., Joshi, S., Mirzasoleiman, B.: Investigating the benefits of projection head for representation learning. In: ICLR (2024)", + "60. Yu, S., Seo, P.H., Son, J.: Zero-shot referring image segmentation with global-local context features. In: CVPR. pp. 19456-19465 (2023)", + "61. Zhang, J., Herrmann, C., Hur, J., Cabrera, L.P., Jampani, V., Sun, D., Yang, M.H.: A tale of two features: Stable diffusion complements dino for zero-shot semantic correspondence. arXiv:2305.15347 (2023)", + "62. Zhang, X., Wang, D., Han, S., Li, W., Zhao, B., Wang, Z., Duan, X., Fang, C., Li, X., He, J.: Affordance-driven next-best-view planning for robotic grasping. In: CoRL (2023)", + "63. Zhao, X., Li, M., Weber, C., Hafez, M.B., Wermter, S.: Chat with the environment: Interactive multimodal perception using large language models. arXiv:2303.08268 (2023)", + "64. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: CVPR. pp. 2921-2929 (2016)", + "65. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv:2304.10592 (2023)" + ], + "bbox": [ + 215, + 147, + 785, + 479 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Jang & Seo et al.", + "bbox": [ + 271, + 114, + 387, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_model.json b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_model.json new file mode 100644 index 0000000000000000000000000000000000000000..3c39362b344bd905078414ec704b540235784cc9 --- /dev/null +++ b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_model.json @@ -0,0 +1,2623 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.263, + 0.141, + 0.74, + 0.186 + ], + "angle": 0, + "content": "INTRA: Interaction Relationship-aware Weakly Supervised Affordance Grounding" + }, + { + "type": "text", + "bbox": [ + 0.3, + 0.212, + 0.701, + 0.228 + ], + "angle": 0, + "content": "Ji Ha Jang\\(^{1*}\\), Hoigi Seo\\(^{1*}\\), and Se Young Chun\\(^{1,2\\dagger}\\)" + }, + { + "type": "text", + "bbox": [ + 0.289, + 0.239, + 0.714, + 0.282 + ], + "angle": 0, + "content": "\\(^{1}\\)Dept. of Electrical and Computer Engineering, \\(^{2}\\)INMC & IPAI Seoul National University, Republic of Korea {jeeit17, sehoiki3215, sychun}@snu.ac.kr" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.317, + 0.74, + 0.636 + ], + "angle": 0, + "content": "Abstract. Affordance denotes the potential interactions inherent in objects. The perception of affordance can enable intelligent agents to navigate and interact with new environments efficiently. Weakly supervised affordance grounding teaches agents the concept of affordance without costly pixel-level annotations, but with exocentric images. Although recent advances in weakly supervised affordance grounding yielded promising results, there remain challenges including the requirement for paired exocentric and egocentric image dataset, and the complexity in grounding diverse affordances for a single object. To address them, we propose INTERaction Relationship-aware weakly supervised Affordance grounding (INTRA). Unlike prior arts, INTRA recasts this problem as representation learning to identify unique features of interactions through contrastive learning with exocentric images only, eliminating the need for paired datasets. Moreover, we leverage vision-language model embeddings for performing affordance grounding flexibly with any text, designing text-conditioned affordance map generation to reflect interaction relationship for contrastive learning and enhancing robustness with our text synonym augmentation. Our method outperformed prior arts on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD. Additionally, experimental results demonstrate that our method has remarkable domain scalability for synthesized images / illustrations and is capable of performing affordance grounding for novel interactions and objects. Project page: https://jeeit17.github.io/INTRA" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.65, + 0.741, + 0.678 + ], + "angle": 0, + "content": "Keywords: Affordance grounding \\(\\cdot\\) Weak supervision \\(\\cdot\\) Exocentric image \\(\\cdot\\) Contrastive learning \\(\\cdot\\) Interaction relation" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.725, + 0.377, + 0.74 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.756, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Affordance [17] refers to the perceived possible interactions based on an object's inherent or recognized properties (e.g., the rim of a wine glass affords sipping while stem of it affords holding). Humans can identify affordances of objects and interact with proper parts despite the diversity in their physical attributes." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.593, + 0.841 + ], + "angle": 0, + "content": "*Authors contributed equally. † Corresponding author." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.128 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "image", + "bbox": [ + 0.236, + 0.147, + 0.77, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.313, + 0.788, + 0.371 + ], + "angle": 0, + "content": "Fig. 1: Prior works on weakly-supervised affordance grounding like LOCATE [25] often failed to ground different affordances for the same object. However, our proposed INTRA yielded finer and more accurate grounding results for them that are closer to the ground truth (GT) by considering interaction relationship among them." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.401, + 0.789, + 0.522 + ], + "angle": 0, + "content": "This ability can be acquired through individual learning, by directly interacting with objects, and observational learning [8], by observing others' interactions. The sense of affordance enables effective interaction in new environments or with novel objects, without step-by-step instructions [57]. Affordance plays an essential role across numerous applications involving intelligent agents, enabling them to provide flexible and timely responses in complex, dynamic environments [5]. These applications include task planning, robot grasping, manipulation, scene understanding and action prediction [2,6,7,16,51,62]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.523, + 0.789, + 0.735 + ], + "angle": 0, + "content": "Affordance grounding is the task to teach intelligent systems how to locate possible action regions in objects for a certain interaction. While fully supervised learning [4, 18, 42, 58] is the most straightforward approach, its reliance on costly annotations may limit its applicability across diverse contexts. Another approach is weakly supervised learning, similar to human's observational learning [8], that does not require GT, but weak labels. In this setting, exocentric images illustrating human-object interactions, along with corresponding egocentric images depicting the objects, are provided during training. During inference, intelligent systems perform affordance grounding on the egocentric images, identifying object parts relevant to the given interactions. Recent advances in weakly supervised affordance grounding [25, 31, 32, 41] proposed to use pairs of exocentric and egocentric images, yielding great performance. The deep neural networks learn affordances by pulling features from exocentric and egocentric images closer, aiming to focus on object parts related to interactions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.79, + 0.84 + ], + "angle": 0, + "content": "However, weakly supervised affordance grounding remains challenging. Firstly, the requirement for current weak labels with pairs of exocentric and egocentric images is still strong. Note that human observational learning does not usually require egocentric images. Secondly, a complex relationship between interactions exists, which has not been adequately addressed in prior works. Many instances in object-interaction relationships exhibit intricate many-to-many associations, occasionally with one entailing another. For example, some distinct" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.374, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.253 + ], + "angle": 0, + "content": "interactions represent the same affordance regions (e.g., 'wash' and 'brush with' a tooth brush), and there are closely related interactions that always come together (e.g., 'sip' usually includes 'hold'. 'ride' usually includes 'sit on'). This complexity poses challenges in extracting interaction-relevant features based on image-level affordance labels, introducing biases towards objects in affordance grounding as illustrated in Fig. 1 (LOCATE [25] often yielded similar affordance grounding with different interactions for the same object)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.788, + 0.525 + ], + "angle": 0, + "content": "Here, we propose a novel weakly supervised affordance grounding method, INTRA (INTeraction Relationship-aware weakly supervised Affordance grounding) to address these unexplored challenges. While previous studies [31,41] solved the weak supervision problem as supervised learning by pulling object features of exocentric and egocentric images closer and LOCATE [25] enhanced this approach by generating more localized pseudo labels based on prior information for exocentric images for supervised learning (i.e., containing human, object part, and background), our INTRA framework recasts the weak supervision problem as representation learning. This novel reformulation allows us to use weaker labels (i.e., exocentric images only) for training so that the requirement to use pairs of exocentric / egocentric images is now alleviated. Moreover, unlike prior works, our INTRA method actively exploits large language model (LLM) as well as the text encoder of the vision-language model (VLM) to leverage linguistic information and existing textual knowledge on affordances, which further enhances our interaction relationship-guided contrastive learning. This novel scheme also allows excellent scalability for unseen objects across diverse domains as well as zero-shot inference for novel interactions, which was not possible in prior arts. In summary, our main contributions are three-fold as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.534, + 0.784, + 0.594 + ], + "angle": 0, + "content": "- We propose a novel approach for weakly supervised affordance grounding by recasting the problem as representation learning and by leveraging VLM, leading to relaxing the need for paired training datasets for more weak supervision and enhancing scalability across domains for unseen objects." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.595, + 0.784, + 0.653 + ], + "angle": 0, + "content": "- We proposed INTRA, a novel method that consists of text synonym augmentation and text-conditioned affordance map generation module along with interaction relationship-guided contrastive learning, so that inference on unseen interactions is possible." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.655, + 0.784, + 0.7 + ], + "angle": 0, + "content": "- Our INTRA outperforms the prior arts in weakly supervised affordance grounding on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD, demonstrating both qualitative and quantitative excellence (see Fig. 1)." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.534, + 0.784, + 0.7 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.723, + 0.396, + 0.739 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.755, + 0.447, + 0.77 + ], + "angle": 0, + "content": "2.1 Affordance Grounding" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Supervised affordance grounding. Supervised affordance grounding methods [10, 14] analyze interaction videos / images to predict affordance regions on an object, trained with pixel-level GT masks / heat maps. Though successful in localizing fine-grained affordance regions through supervised learning, they are" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.129 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.193 + ], + "angle": 0, + "content": "limited by the costly GT mask annotation process and their limited generalizability to unseen objects. Furthermore, they require paired demonstration videos and target object images, making real-world application challenging." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.214, + 0.788, + 0.456 + ], + "angle": 0, + "content": "Weakly supervised affordance grounding. Weakly supervised affordance grounding methods [13,20,23,25,31-33,41,47] offer the advantage of not requiring GT, but requiring weak labels such as exocentric images with interaction text labels. Prior works [25,31,32,41] mainly align interaction-relevant object features from both egocentric and exocentric images without considering the intrinsic properties of interactions. The framework in [41] predicts object features engaged in interactions by analyzing human-object interaction videos. The works of [31, 32] preserve the correlation of affordance features from exocentric and egocentric images to learn affordances. The work of [25] enhances object feature extraction by adopting DINO-ViT [9] based Class Activation Maps (CAM) [64] and k-means clustering [35] for more explicit guidance. However, focusing solely on object features may introduce biases towards object, hindering the inference of multiple affordances for a single object. Our INTRA addresses this issue by considering the complex relationships between interactions using interaction relationship-guided contrastive loss, while ensuring the network remains attentive to the objects using object-variance mitigation loss." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.477, + 0.64, + 0.493 + ], + "angle": 0, + "content": "2.2 Foundation Models for Affordance Grounding" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.501, + 0.794, + 0.669 + ], + "angle": 0, + "content": "Self-supervised transformer. Self-supervised transformers, extensively trained on large-scale datasets and scalability, possess robust representation power. Previous works [25,52] have explored their potential in affordance grounding. DINO-ViT [9], a vision transformer foundation model trained in a self-supervised manner, can identify both high-semantics such as overall information of the image and low-semantics such as details regarding specific object parts. This versatility has led advancements in various tasks, including classification, semantic segmentation [4, 24] and semantic correspondence [61]. LOCATE [25] leverages DINO-ViT to extract low-semantic information, resulting in performance improvements in affordance grounding. Our INTRA employed DINOv2 [46] as an image encoder to extract information about objects and their constituent parts." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Vision-language model. The Vision-Language Model (VLM) is a class of models jointly pretrained on visual and language data for various downstream tasks [45, 56, 60]. VLM text encoders, trained through contrastive learning with image-text pairs, capture representations in the joint space of the images and text [26-28, 50]. These text encoders, incorporating visual information, have demonstrated excellent performance across multiple tasks. ALBEF [28] notably enhances vision and language representation learning by aligning image and text features before fusing them. While supervised affordance grounding methods leveraging VLM text encoders [44] have been explored, their application in weakly supervised affordance grounding remains underexplored. We propose a" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.144, + 0.788, + 0.304 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.317, + 0.785, + 0.415 + ], + "angle": 0, + "content": "Fig. 2: Overall frameworks of (a) LOCATE [25] and (b) INTRA (Ours). LOCATE takes paired exocentric and egocentric images to generate interaction-aware affordance maps (CAMs) for predefined interactions and then selects an interaction-related CAM by the given interaction label. In contrast, INTRA takes only exocentric images and interaction labels to yield an affordance map through our affordance map generation module. Training is done via interaction relationship-guided contrastive learning on exocentric features from affordance maps. Note that all encoder parameters are frozen." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.445, + 0.784, + 0.476 + ], + "angle": 0, + "content": "framework leveraging the text encoder of ALBEF to enable novel interactions, diverging from prior arts limited to inferring predetermined sets of affordances." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.498, + 0.788, + 0.68 + ], + "angle": 0, + "content": "Large language model. Understanding affordance relationships is crucial for affordance grounding, as it enables extending and linking learned visual cues, and reasoning about affordances for new objects, interactions, or situations. While prior works like [19] leverage semantically similar object properties and [32] utilize affordance feature correlation, none directly exploit these relationships. We use these intricate relationships in affordance learning by adopting Large Language Models (LLMs). LLMs have gained prominence in robotics due to their profound natural language understanding, providing valuable priors about interactions and their complex relationships. Previous works [3,29,54,63] focus on extracting action knowledge, deriving task-specific plans, and grounding them in the physical world. LLMs have also been widely used in previous affordance studies [37,55], demonstrating their exceptional understanding of interactions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.703, + 0.33, + 0.719 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Prior arts in weakly supervised affordance grounding [25, 31, 32, 41] typically align object features of paired exocentric (interaction with object) and egocentric (object only) images to learn interaction-related features. For example, as illustrated in Fig. 2(a), LOCATE [25] generates CAMs (affordance maps) from exocentric and egocentric images for a pre-determined interaction label, extracts egocentric feature as well as exocentric object parts feature selected by PartS-select module (pseudo label), and then trains the model by optimizing cosine" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.129 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "similarity to align (pull) egocentric and exocentric object parts features. In contrast, we propose an alternative approach, INTRA, whose overall framework is illustrated in Fig. 2(b). Our text-conditioned affordance grounding framework of INTRA leverages VLM text encoder in affordance map generation module and employs text synonym augmentation to enhance robustness, as will be described in Sec. 3.1. Then, INTRA learn affordance grounding via our interaction relationship-guided contrastive learning, detailed in Sec. 3.2. The framework of INTRA as depicted in Fig. 2(b) clearly suggests two advantages over prior arts including LOCATE [25]: 1) it exploits exocentric images only and 2) INTRA admits novel interactions outside the pre-defined interaction set." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.319, + 0.691, + 0.334 + ], + "angle": 0, + "content": "3.1 Text-conditioned Affordance Grounding Framework" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.344, + 0.789, + 0.511 + ], + "angle": 0, + "content": "To utilize the semantic meanings inherent in interaction labels and enable flexible inference on novel verbs, our text-conditioned affordance grounding framework generates affordance maps by conditioning image features with text features via our affordance map generation module where text and image features extracted from separately pre-trained text and image encoders are fused. In specific, as depicted in Fig. 2(b), deep features \\(\\mathcal{F}_{exo} \\in \\mathbb{R}^{(h \\times w) \\times d}\\) are obtained from the input exocentric images using DINOv2 [46], where \\(h\\) and \\(w\\) represent the height and width of the affordance map, and \\(d\\) refers to the dimension of the feature. The text feature \\(\\mathcal{F}_{text}\\) of the given interaction is obtained using the ALBEF text encoder [28]. See the supplementary material for further details on the rationale for employing DINOv2 and the ablation study on the text encoder." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.532, + 0.789, + 0.7 + ], + "angle": 0, + "content": "Affordance map generation module. Before fusing text and image features, the class token of \\(\\mathcal{F}_{text}\\) passes through a single linear layer to align the separately pre-trained image and text embedding spaces and connect them, as shown to be effective in previous works [30,65]. Subsequently, image features \\(\\mathcal{F}_{exo}\\) and the class token of text features are concatenated and processed through a transformer encoder for conditioning. The image feature part of the resulting vector is then projected using a multi-layered convolutional network and normalized using min-max normalization to obtain the affordance map \\(\\mathcal{M}_{aff} \\in \\mathbb{R}^{h \\times w}\\). This affordance map represents the image regions in exocentric images most relevant to interactions. During inference, \\(\\mathcal{M}_{aff}\\) functions directly as an output heatmap, indicating the image regions in egocentric images most relevant to interactions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Text synonym augmentation. To enhance the robustness of text conditioning, we integrate text synonym augmentation into our interaction embeddings. Initially, we generate \\( k_{s} \\) synonyms for each interaction label using LLM. Subsequently, any synonyms overlapping with other interaction labels are removed. These synonyms are then randomly selected to substitute the text conditioning interaction embedding, while the original interaction label is retained for interaction relationship-guided contrastive learning. This module enhances overall performance by providing models with enriched interpretations of interactions." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.374, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.703, + 0.163 + ], + "angle": 0, + "content": "3.2 Interaction Relationship-guided Contrastive Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.788, + 0.264 + ], + "angle": 0, + "content": "Our INTRA learns via interaction relationship-guided contrastive learning by comparing exocentric image features across diverse interactions. Our contrastive learning consists of two key components, 1) extracting exocentric image features with affordance map and 2) designing loss for interaction relationship-guided contrastive learning, that enable the grounding of multiple affordances on a single object." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.284, + 0.789, + 0.346 + ], + "angle": 0, + "content": "Exocentric image feature extraction with affordance map. As described in Sec 3.1, a text-conditioned affordance map, \\(\\mathcal{M}_{aff}\\), is generated to represent interaction-relevant image regions of exocentric images. Then, the exocentric image features \\(f_{exo}\\) corresponding to the affordance map are extracted as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.318, + 0.359, + 0.785, + 0.377 + ], + "angle": 0, + "content": "\\[\nf _ {e x o} = (1 / h w) \\Sigma_ {i = 1} ^ {h} \\Sigma_ {j = 1} ^ {w} \\mathcal {F} _ {e x o} (i, j) \\cdot \\mathcal {M} _ {a f f} (i, j) \\in \\mathbb {R} ^ {d}. \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.381, + 0.789, + 0.442 + ], + "angle": 0, + "content": "The resulting \\( f_{exo} \\) is then projected and normalized to obtain the exocentric image feature \\( z_{exo} \\) using an MLP layer, which will be used for training. This projection layer was also used in previous works [11, 12, 59], which have demonstrated the necessity and efficiency of it." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.463, + 0.789, + 0.617 + ], + "angle": 0, + "content": "Loss design for interaction relationship-guided contrastive learning. Supervised contrastive learning [21] effectively derives good representations for each class by focusing on common characteristics in positive pairs while disregarding those in negative pairs like other classes. However, in affordance grounding tasks, treating all other interaction classes as negative pairs may be inadequate due to the complex relationship among interactions. To mitigate this issue, we propose interaction relationship-guided contrastive loss, \\(\\mathcal{L}_{inter}\\). Furthermore, considering the subtle meaning variations within single interaction classes depending on the object and context, we also propose object-variance mitigation loss, \\(\\mathcal{L}_{obj}\\). Thus, the total loss for our INTRA is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.411, + 0.627, + 0.785, + 0.643 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {t o t a l}} = \\mathcal {L} _ {\\text {i n t e r}} + \\lambda_ {\\text {o b j}} \\mathcal {L} _ {\\text {o b j}} \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.652, + 0.574, + 0.669 + ], + "angle": 0, + "content": "where \\(\\lambda_{obj}\\) denotes the control parameter of \\(\\mathcal{L}_{obj}\\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.69, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Interaction relationship-guided contrastive loss. In affordance grounding, treating all other interaction classes as negative pairs is inadequate due to the intricate relationships between interactions. For example, 'Wash' and 'Brush with' toothbrush or 'Pour' and 'Seal' bottle represent distinct interactions but act on the same object parts. Manually finding these relationships is time-consuming and impractical as the number of pairs grows quadratically with the number of interaction (see the supplementary). Moreover, although linguistic relationships like synonyms or co-occurrence were considered as substitutes, they are often inadequate and degrade performance. For example, 'Sip' entails 'Hold', but they act on different part of objects, and 'Wash' and 'Cut with' a knife have different" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.128 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.144, + 0.788, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.299, + 0.789, + 0.343 + ], + "angle": 0, + "content": "Fig. 3: The overall scheme of interaction-relationship map \\((\\mathcal{R})\\) generation. LLM classifies all pairs of interactions in the dataset as positive or negative through chain of thoughts. This process is based on reasoning if interactions occur on same object parts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.379, + 0.789, + 0.545 + ], + "angle": 0, + "content": "meanings, but they act on the same blade. To mitigate this, we leverage LLM to determine if interaction pairs act on the same object part. Through Chain of Thoughts (CoT), interaction pairs are categorized as positive or negative in three steps as described in Fig. 3. In Step 1, LLM deduces five different objects where both interactions could be performed. In Step 2, LLM identifies object parts where these interactions could occur by considering five objects one by one, not simultaneously. In Step 3, if the identified parts of the interaction pair are the same, the pair is classified as positive; otherwise, negative. Positive pairs are assigned 1 in the interaction-relationship map \\(\\mathcal{R}\\), and negative pairs are assigned 0. We propose interaction-relationship guided contrastive loss by integrating \\(\\mathcal{R}\\) into supervised contrastive learning as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.278, + 0.565, + 0.787, + 0.615 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {i n t e r} = \\sum_ {i = 1} ^ {2 N} \\frac {- 1}{2 N y _ {i} - 1} \\sum_ {j = 1} ^ {2 N} \\mathcal {R} _ {\\left(y _ {i}, y _ {j}\\right)} \\cdot \\log \\frac {\\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {j} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 N} \\mathbf {1} _ {i \\neq k} \\cdot \\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {k} / \\tau\\right)} \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.71 + ], + "angle": 0, + "content": "where \\(i, j\\) are sample indices, \\(y_{i}, y_{j}\\) are class labels, \\(N_{y_i}\\) is the number of samples in the batch labeled with \\(y_{i}\\), \\(N\\) is the total number of distinct samples in the batch, \\(z_{exo}^{j}\\) is the exocentric image feature vector of each sample, \\(\\tau\\) is the temperature, and \\(\\mathcal{R}_{(y_i,y_j)}\\) is the value of \\((y_{i},y_{j})\\) pair in interaction-relationship map." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Object-variance mitigation loss. In the context of affordance, the interpretation of the same interaction can vary significantly based on the object and context. For instance, 'Hold' a baseball bat and a cup may seem similar since both involve grasping an object. However, the former involves gripping the bat's slender part, while the latter entails holding the cup's rounded, protruding part. To address this variance within the same interaction category, we implemented" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.374, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.128 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.577, + 0.165 + ], + "angle": 0, + "content": "an object-variance mitigation loss \\(\\mathcal{L}_{obj}\\) as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.315, + 0.173, + 0.786, + 0.22 + ], + "angle": 0, + "content": "\\[\n\\sum_ {i = 1} ^ {2 N} \\frac {- 1}{2 N o _ {i} - 1} \\sum_ {j = 1} ^ {2 N} \\mathbf {1} _ {o _ {i} = o _ {j}} \\cdot \\log \\frac {\\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {j} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 N} \\mathbf {1} _ {i \\neq k} \\cdot \\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {k} / \\tau\\right)} \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.228, + 0.527, + 0.243 + ], + "angle": 0, + "content": "where \\(o_i\\), \\(o_j\\) denote object class of \\(i\\) and \\(j\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.264, + 0.377, + 0.281 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.294, + 0.441, + 0.31 + ], + "angle": 0, + "content": "4.1 Experimental Setting" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.317, + 0.788, + 0.515 + ], + "angle": 0, + "content": "Dataset and metrics. We conducted an evaluation of our method using the Affordance Grounding Dataset (AGD20K) [32]. AGD20K comprises both exocentric and egocentric images, with 20,061 exocentric images and 3,755 egocentric images labeled with 36 affordances. The dataset support evaluation under two settings: 1) the 'Seen' setting, where the object categories of the training and testing sets are identical, and 2) the 'Unseen' setting, where no objects overlap between the training and test sets. Our approach only used exocentric images in training for all experiments, while other approaches were trained using both egocentric and exocentric images. We employed three evaluation metrics commonly employed in previous affordance grounding methodologies: 1) Kullback-Leibler Divergence (KLD), 2) Similarity (SIM), 3) and Normalized Scanpath Saliency (NSS). These metrics were utilized to quantify the similarity between the distributions of ground truth heatmaps and predicted affordance grounding." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.534, + 0.788, + 0.626 + ], + "angle": 0, + "content": "Implementation details. We employed DINOv2 as the image encoder and ALBEF, fine-tuned with RefCOCO+, as the text encoder. ChatGPT-4 [1] served as the LLM. Images were resized to \\(384 \\times 384\\), then cropped to \\(336 \\times 336\\). Training utilized the Adam optimizer [22] with a learning rate of 2e-4 and a batch size of 256. The hyperparameter \\(\\lambda_{obj}\\) was set to 4, and all experiments were conducted on a single NVIDIA A100 GPU. More details are provided in the supplementary." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.646, + 0.597, + 0.661 + ], + "angle": 0, + "content": "4.2 Comparison to State-of-the-art Methods" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.669, + 0.788, + 0.745 + ], + "angle": 0, + "content": "To comprehensively assess our method, we conduct quantitative and qualitative comparisons with state-of-the-art weakly-supervised grounding methods, incorporating a user study. We further expand our experiments to include additional datasets [40, 43, 53] for a comprehensive evaluation. Refer to the supplementary materials for more details on the experimental settings." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.765, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Quantitative results. We evaluated previous works [15, 25, 31, 32, 36, 41, 48] and our method based on the metrics mentioned above. Tab. 1 shows the quantitative comparison results of our method with prior arts. In both 'Seen' and 'Unseen' setting, our approach surpasses the baseline performances across all three metrics: KLD, SIM, and NSS, thereby setting a new state-of-the-art." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.129 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Quantitative results of ours and other baselines [15,25,31,32,36,41,48] on the AGD20K dataset. \\(\\uparrow / \\downarrow\\) indicates that higher / lower the metric is, the better the model performs. INTRA outperformed all baselines, despite being trained only with exocentric images, whereas other models incorporated both exocentric and egocentric images during training." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.226, + 0.787, + 0.347 + ], + "angle": 0, + "content": "
Prior worksSeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Weakly Supervised Object LocalizationEIL [36]1.9310.2850.5222.1670.2270.330
SPA [48]5.5280.2210.3577.4250.1670.262
TS-CAM [15]1.8420.2600.3362.1040.2010.151
Weakly Supervised Affordance GroundingHotspots [41]1.7730.2780.6151.9940.2370.557
Cross-view-AG [32]1.5380.3340.9271.7870.2850.829
Cross-view-AG+ [31]1.4890.3420.9811.7650.2790.882
LOCATE [25]1.2260.4011.1771.4050.3721.157
ExoINTRA (Ours)1.1990.4071.2391.3650.3751.209
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.361, + 0.788, + 0.445 + ], + "angle": 0, + "content": "Table 2: Quantitative results on the modified IIT-AFF, CAD, and UMD dataset for our method and other baselines [25,31,32]. Models were trained in the 'Seen' setting of AGD20K and tested on the datasets without additional training. INTRA outperformed all baselines on all metrics across all datasets. * Objects with affordances that prior works are unable to predict were eliminated from the datasets for fairness, wheares our method can infer affordances on novel interactions." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.456, + 0.784, + 0.535 + ], + "angle": 0, + "content": "
IIT-AFF* [43]CAD* [53]UMD* [40]
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Cross-View-AG [32]3.8560.0960.8492.5680.1730.5894.7210.0141.287
Cross-View-AG+ [31]3.9200.0951.0722.5290.1760.6634.7530.0131.227
LOCATE [25]3.3150.1151.7092.5280.1870.5584.0830.0262.699
INTRA(Ours)2.6630.1482.5112.0950.2431.2593.0810.0624.195
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.565, + 0.788, + 0.703 + ], + "angle": 0, + "content": "Results on additional datasets. We evaluated the generalization and robustness of the INTRA framework, along with previous works [25, 31, 32] trained in the 'Seen' setting of AGD20K, on the IIT-AFF [43], CAD [53], and UMD [40] datasets. The experiment was conducted in the 'Seen' setting due to overlapping objects between these datasets and AGD20K. Each GT was processed in the same way as when evaluating the AGD20K test set. Despite significant domain gaps across datasets, INTRA outperformed in all metrics on all datasets, demonstrating its superior generalizability as shown in Tab. 2. Further details of the experiment can be found in the supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.725, + 0.788, + 0.788 + ], + "angle": 0, + "content": "Qualitative results. Fig. 4 and Fig. 5 show our superior grounding precision compared to the baselines, being closer to the GT and finer in granularity. INTRA precisely identifies the exact object part for a given affordance, unlike the baselines, which ground the same parts regardless of the affordances provided." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "User study. Affordance grounding can be ambiguous depending on context and interpretation, thus relying solely on metrics for evaluation has limita-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.237, + 0.189, + 0.768, + 0.398 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.414, + 0.788, + 0.512 + ], + "angle": 0, + "content": "Fig. 4: Qualitative results of INTRA (Ours) and baseline models [25,31,32] on grounding affordances of multiple potential interactions on a single object. INTRA precisely localizes relevant interaction spots for each interaction. For example, with a knife, it grounds the handle for 'Hold' and the blade for 'Cut with'. For a motorcycle, it accurately grounds the saddle for 'Sit on'. Additionally, for 'Ride', it grounds both the handle and saddle, slightly deviating from the GT but still producing reasonable results, as we usually interacts with handle and saddle to 'Ride' a motorcycle." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.513, + 0.785, + 0.721 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.731, + 0.788, + 0.801 + ], + "angle": 0, + "content": "Fig. 5: Qualitative results comparison between our approach and other baselines [25, 31,32]. Our approach, INTRA, demonstrates superior precision and detail in grounding affordances compared to the baselines. For instance, in the example of 'Drag', while baselines either fail to localize the handle or erroneously ground several other parts, INTRA accurately identifies and grounds the handle of a suitcase with finesse." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.129 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.174 + ], + "angle": 0, + "content": "Table 3: The result of user study on validity, finesse, and separability. Users were asked to score a 5-point scale, and we averaged it for mean opinion score (MOS)." + }, + { + "type": "table", + "bbox": [ + 0.27, + 0.185, + 0.734, + 0.26 + ], + "angle": 0, + "content": "
ValidityFinesseSeparability
Cross-View-AG+ [31]2.8973.0222.732
LOCATE [25]3.0542.5732.651
INTRA (Ours)3.1343.1123.221
Ground Truth2.9053.3343.160
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.271, + 0.781, + 0.327 + ], + "angle": 0, + "content": "Table 4: Quantitative results of ablation Table 5: Quantitative results of ablation study on our loss design. We incrementally mention study on different \\(\\mathcal{R}\\). \\(\\mathcal{L}_{WordNet}\\), added each component of the losses to ex- \\(\\mathcal{L}_{Word2Vec}\\) are calculated using word similarity from WordNet [39], Word2Vec [38]," + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.339, + 0.497, + 0.4 + ], + "angle": 0, + "content": "
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
baseline1.6780.3380.8911.5810.3001.100
Linter1.4390.3341.0311.5690.2921.133
Lobj1.3360.3871.2181.5210.3341.042
Linter+Lobj1.1990.4071.2391.3650.3751.209
" + }, + { + "type": "table_caption", + "bbox": [ + 0.5, + 0.328, + 0.78, + 0.356 + ], + "angle": 0, + "content": "respectively. \\(\\mathcal{L}_{Co - occur}\\) used cooccurrence probability in GloVe [49]." + }, + { + "type": "table", + "bbox": [ + 0.5, + 0.368, + 0.78, + 0.426 + ], + "angle": 0, + "content": "
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
LWordNet1.7010.2820.7101.6980.2770.937
LCo-occur.1.5190.3090.9881.6390.2741.101
LWord2Vec1.5470.3020.9581.6790.2700.980
Linter(Ours)1.4390.3341.0311.5690.2921.133
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.56 + ], + "angle": 0, + "content": "tions. Hence, we conducted a user study comparing Cross-View-AG+ [31], LOCATE [25], GT, and INTRA (Ours) across three categories: 1) Validity: assessing heatmap reasonableness, 2) Finesse: measuring heatmap detail, 3) Separability: determining the accuracy of the heatmap when different affordances are assigned to the same object. A total of 936 responses were collected for randomly selected samples from 104 respondents. Results presented in Tab. 3 demonstrate that our approach outperforms baselines and par on GT based on human perception." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.58, + 0.402, + 0.593 + ], + "angle": 0, + "content": "4.3 Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.603, + 0.787, + 0.649 + ], + "angle": 0, + "content": "We validate our pipeline design choices and parameters with ablation studies. This section includes ablation studies on loss design, adoption of LLM, and text synonym augmentation. Refer to the supplementary for further ablation studies." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.669, + 0.788, + 0.775 + ], + "angle": 0, + "content": "Ablation study on loss design. To assess the individual impact of the components comprising loss on its overall performance, we analyzed by incrementally adding components. We started with the most basic element: a normal supervised contrastive loss. Subsequently, we sequentially added an interaction relationship-guided loss and an object-variance mitigation loss. The performance outcomes of these incremental modifications were thoroughly evaluated to understand their contributions, as represented in the Tab. 4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Ablation study on adoption of LLM. Adopting LLM to create the relationship map was essential given the intricate nature of affordances. We experimented with various methods to create the relationship map to validate this" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.374, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.437, + 0.222 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.26, + 0.222, + 0.41, + 0.234 + ], + "angle": 0, + "content": "(a) Overall training scheme" + }, + { + "type": "image", + "bbox": [ + 0.461, + 0.147, + 0.777, + 0.22 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.477, + 0.221, + 0.76, + 0.235 + ], + "angle": 0, + "content": "(b) Feature t-SNE before (left) / after (right) training" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.245, + 0.788, + 0.316 + ], + "angle": 0, + "content": "Fig. 6: An illustration of interaction relationship-guided contrastive learning and t-SNE [34] visualization of feature distribution. (a) In interaction relationship-guided contrastive learning, positive interaction pairs attract each other, while others repel. (b) t-SNE visualization of DINOv2 [46] class token and \\( f_{exo} \\) from INTRA, showing that features of positive interaction pairs become closer as learning progresses." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.341, + 0.788, + 0.403 + ], + "angle": 0, + "content": "choice. We measured the similarity of interaction pairs using WordNet [39] and Word2Vec [38], or computed co-occurrence probability of interaction pairs with Glove [49]. Based on these measurements, we created an Interaction-relationship Map and trained the INTRA framework. The results are in the Tab. 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.422, + 0.788, + 0.558 + ], + "angle": 0, + "content": "Ablation study on text synonym augmentation. We conducted an ablation study on the effectiveness of text synonym augmentation on overall performance. We compared performance with and without the module. The module improved performance by up to \\(21.93\\%\\), particularly in the 'Unseen' setting, enriching models with varied meanings of interactions. Additionally, to test its effectiveness on novel verb inference, we deliberately omitted the subset 'Hold' \\((24.17\\%\\) of training data) and then performed inference on 'Hold'. The module boosted performance for novel verbs by up to \\(58.06\\%\\). Similar tendencies were observed for other verbs. Detailed results are available in the supplementary." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.578, + 0.355, + 0.594 + ], + "angle": 0, + "content": "5 Discussion" + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.607, + 0.741, + 0.623 + ], + "angle": 0, + "content": "5.1 Effect of Interaction Relationship-guided Contrastive Loss" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Our rationale for learning affordance grounding solely with exocentric images relies on the consistent presence of humans within these images. By repelling common features of negative pairs, such as human parts, the images effectively exclude irrelevant elements. Conversely, positive pairs, sharing the desired feature of the object—specifically, the rim of the object near the face—facilitate learning by attracting these relevant features (see Fig. 6(a)). To visualize the effectiveness of our loss in learning interaction-relevant features in similar images, we examine the feature distributions of 'Hold' and 'Sip' a wine glass, involving distinct affordances. Prior to training, these distributions overlap. However, after training with our loss function, the feature distribution for 'Hold wine glass' aligns more closely with 'Hold baseball bat' than with 'Sip wine glass'. This indicates that our loss function effectively discriminates between the characteristics of different interactions without exhibiting bias towards objects (see Fig. 6(b)). Detailed explanation is illustrated in the supplementary." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.128 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.144, + 0.351, + 0.194 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.237, + 0.195, + 0.274, + 0.202 + ], + "angle": 0, + "content": "LOCATE" + }, + { + "type": "image_caption", + "bbox": [ + 0.278, + 0.195, + 0.299, + 0.202 + ], + "angle": 0, + "content": "I" + }, + { + "type": "image", + "bbox": [ + 0.301, + 0.144, + 0.353, + 0.194 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.302, + 0.195, + 0.348, + 0.202 + ], + "angle": 0, + "content": "NTRA (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.354, + 0.144, + 0.481, + 0.194 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.363, + 0.195, + 0.4, + 0.202 + ], + "angle": 0, + "content": "LOCATE" + }, + { + "type": "image_caption", + "bbox": [ + 0.423, + 0.195, + 0.478, + 0.202 + ], + "angle": 0, + "content": "INTRA (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.144, + 0.554, + 0.194 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.505, + 0.195, + 0.54, + 0.202 + ], + "angle": 0, + "content": "LOCATE" + }, + { + "type": "image", + "bbox": [ + 0.557, + 0.144, + 0.631, + 0.194 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.564, + 0.195, + 0.62, + 0.202 + ], + "angle": 0, + "content": "INTRA (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.633, + 0.144, + 0.703, + 0.194 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.653, + 0.195, + 0.69, + 0.202 + ], + "angle": 0, + "content": "LOCATE" + }, + { + "type": "image", + "bbox": [ + 0.706, + 0.144, + 0.781, + 0.194 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.715, + 0.195, + 0.771, + 0.202 + ], + "angle": 0, + "content": "INTRA (Ours)" + }, + { + "type": "image_caption", + "bbox": [ + 0.338, + 0.205, + 0.664, + 0.218 + ], + "angle": 0, + "content": "(a) Qualitative results on images with large domain gap" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.223, + 0.354, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.247, + 0.274, + 0.282, + 0.282 + ], + "angle": 0, + "content": "LOCATE" + }, + { + "type": "image", + "bbox": [ + 0.355, + 0.223, + 0.383, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.315, + 0.274, + 0.369, + 0.282 + ], + "angle": 0, + "content": "INTRA (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.385, + 0.223, + 0.422, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.397, + 0.275, + 0.434, + 0.282 + ], + "angle": 0, + "content": "LOCATE" + }, + { + "type": "image", + "bbox": [ + 0.423, + 0.223, + 0.449, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.454, + 0.274, + 0.509, + 0.282 + ], + "angle": 0, + "content": "INTRA (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.526, + 0.223, + 0.645, + 0.275 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.527, + 0.281, + 0.776, + 0.294 + ], + "angle": 0, + "content": "(c) Qualitative results on novel interaction" + }, + { + "type": "image", + "bbox": [ + 0.646, + 0.223, + 0.781, + 0.275 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.247, + 0.283, + 0.475, + 0.296 + ], + "angle": 0, + "content": "(b) Qualitative results on novel object" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.307, + 0.785, + 0.377 + ], + "angle": 0, + "content": "Fig. 7: Qualitative results of feasibility study: (a) Inference on diverse images with significant domain gap such as pixel arts and paintings. (b) Inference on novel objects that were not in the training data. (c) Inference on unseen novel interactions. INTRA demonstrates superior grounding accuracy in (a)-(c) compared to LOCATE [25], showing proper affordance region inference without explicit training." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.411, + 0.722, + 0.426 + ], + "angle": 0, + "content": "5.2 Feasibility Study on Generalization Property of INTRA" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.447, + 0.788, + 0.614 + ], + "angle": 0, + "content": "INTRA excels in affordance grounding on images with large domain gaps, such as pixel art and paintings, as illustrated in Fig. 7(a). Furthermore, our method showcases strong generalization abilities for novel objects like a horse and quill, not present in the training set, as shown in Fig. 7(b). Additionally, despite deliberately not being trained on specific interaction classes like 'Hold' and 'Take photo' for experiment, INTRA successfully infers their affordances, as depicted in Fig. 7(c). More results and detailed experimental settings are in the supplementary. One possible explanation for this generalization property is that our INTRA employs VLM so that diverse domains and novel object can be dealt with without explicitly tuning for them. Another explanation is INTRA's contrastive training that may achieve better representation learning." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.647, + 0.36, + 0.663 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In this paper, we introduce INTRA, a novel framework reformulating the weakly supervised affordance grounding with representation learning. We suggest interaction relationship-guided contrastive learning, informed by affordance knowledge from LLM. Furthermore, INTRA actively leverages VLM text embedding in proposed text-conditioned affordance map generation for flexible affordance grounding, further bolstered by text synonym augmentation for robustness. INTRA achieves state-of-the-art performance across diverse datasets, relying solely on exocentric images for training, unlike prior methods that also use egocentric images. Moreover, our method demonstrates generalization feasibility on novel objects, interactions, and images with significant domain gaps." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.374, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.3 + ], + "angle": 0, + "content": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)], the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. NRF-2022M3C1A309202211) and AI-Bio Research Grant through Seoul National University. Also, the authors acknowledged the financial support from the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.322, + 0.323, + 0.338 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.354, + 0.785, + 0.396 + ], + "angle": 0, + "content": "1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.397, + 0.785, + 0.507 + ], + "angle": 0, + "content": "2. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Fu, C., Gopalakrishnan, K., Hausman, K., Herzog, A., Ho, D., Hsu, J., Ibarz, J., Ichter, B., Irpan, A., Jang, E., Ruano, R.J., Jeffrey, K., Jesmonth, S., Joshi, N., Julian, R., Kalashnikov, D., Kuang, Y., Lee, K.H., Levine, S., Lu, Y., Luu, L., Parada, C., Pastor, P., Quiambao, J., Rao, K., Rettinghouse, J., Reyes, D., Sermanet, P., Sievers, N., Tan, C., Toshev, A., Vanhoucke, V., Xia, F., Xiao, T., Xu, P., Xu, S., Yan, M., Zeng, A.: Do as i can and not as i say: Grounding language in robotic affordances. In: arXiv:2204.01691 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.508, + 0.785, + 0.548 + ], + "angle": 0, + "content": "3. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Gopalakrishnan, K., Hausman, K., Herzog, A., et al.: Do as i can, not as i say: Grounding language in robotic affordances. arXiv:2204.01691 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.549, + 0.785, + 0.576 + ], + "angle": 0, + "content": "4. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv:2112.05814 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.577, + 0.785, + 0.604 + ], + "angle": 0, + "content": "5. Ardón, P., Pairet, É., Lohan, K.S., Ramamoorthy, S., Petrick, R.: Affordances in robotic tasks-a survey. arXiv:2004.07400 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.605, + 0.785, + 0.632 + ], + "angle": 0, + "content": "6. Ardón, P., Pairet, E., Petrick, R.P., Ramamoorthy, S., Lohan, K.S.: Learning grasp affordance reasoning through semantic relations. RA-L pp. 4571-4578 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.633, + 0.785, + 0.659 + ], + "angle": 0, + "content": "7. Bahl, S., Mendonca, R., Chen, L., Jain, U., Pathak, D.: Affordances from human videos as a versatile representation for robotics. In: CVPR. pp. 13778-13790 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.66, + 0.785, + 0.687 + ], + "angle": 0, + "content": "8. Burke, C.J., Tobler, P.N., Baddeley, M., Schultz, W.: Neural mechanisms of observational learning. PNAS pp. 14431-14436 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.688, + 0.785, + 0.729 + ], + "angle": 0, + "content": "9. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.785, + 0.757 + ], + "angle": 0, + "content": "0. Chen, J., Gao, D., Lin, K.Q., Shou, M.Z.: Affordance grounding from demonstration video to target image. In: CVPR. pp. 6799-6808 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.784 + ], + "angle": 0, + "content": "1. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.785, + 0.812 + ], + "angle": 0, + "content": "2. Chen, X., He, K.: Exploring simple siamese representation learning. In: CVPR. pp. 15750-15758 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "3. Cornia, M., Baraldi, L., Serra, G., Cucchiara, R.: A deep multi-level network for saliency prediction. In: ICPR. pp. 3488-3493 (2016)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.354, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.128 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "14. Fang, K., Wu, T.L., Yang, D., Savarese, S., Lim, J.J.: Demo2vec: Reasoning object affordances from online videos. In: CVPR. pp. 2139-2147 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.177, + 0.785, + 0.217 + ], + "angle": 0, + "content": "15. Gao, W., Wan, F., Pan, X., Peng, Z., Tian, Q., Han, Z., Zhou, B., Ye, Q.: Ts-cam: Token semantic coupled attention map for weakly supervised object localization. In: ICCV. pp. 2886-2895 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.785, + 0.244 + ], + "angle": 0, + "content": "16. Geng, Y., An, B., Geng, H., Chen, Y., Yang, Y., Dong, H.: Rlafford: End-to-end affordance learning for robotic manipulation. In: ICRA. pp. 5880-5886 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.246, + 0.785, + 0.272 + ], + "angle": 0, + "content": "17. Gibson, J.: The Ecological Approach to Visual Perception. Resources for ecological psychology, Lawrence Erlbaum Associates (1986)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.273, + 0.785, + 0.3 + ], + "angle": 0, + "content": "18. Hadjivelichkov, D., Zwane, S., Agapito, L., Deisenroth, M.P., Kanoulas, D.: One-shot transfer of affordance regions? affcorrs! In: CoRL. pp. 550-560 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.301, + 0.785, + 0.327 + ], + "angle": 0, + "content": "19. Hou, Z., Yu, B., Qiao, Y., Peng, X., Tao, D.: Affordance transfer learning for human-object interaction detection. In: CVPR. pp. 495-504 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.328, + 0.785, + 0.355 + ], + "angle": 0, + "content": "20. Huang, Y., Cai, M., Li, Z., Sato, Y.: Predicting gaze in egocentric video by learning task-dependent attention transition. In: ECCV. pp. 754-769 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.357, + 0.785, + 0.396 + ], + "angle": 0, + "content": "21. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS 33, 18661-18673 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.424 + ], + "angle": 0, + "content": "22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv:1412.6980 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.452 + ], + "angle": 0, + "content": "23. Kümmerer, M., Wallis, T.S., Bethge, M.: Deepgaze ii: Reading fixations from deep features trained on object recognition. arXiv:1610.01563 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.785, + 0.493 + ], + "angle": 0, + "content": "24. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask dino: Towards a unified transformer-based framework for object detection and segmentation. In: CVPR. pp. 3041-3050 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.494, + 0.785, + 0.535 + ], + "angle": 0, + "content": "25. Li, G., Jampani, V., Sun, D., Sevilla-Lara, L.: Locate: Localize and transfer object parts for weakly supervised affordance grounding. In: CVPR. pp. 10922-10931 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.785, + 0.577 + ], + "angle": 0, + "content": "26. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv:2301.12597 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.785, + 0.618 + ], + "angle": 0, + "content": "27. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: ICML. pp. 12888-12900 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.619, + 0.785, + 0.66 + ], + "angle": 0, + "content": "28. Li, J., Selvaraju, R., Gotmare, A., Joty, S., Xiong, C., Hoi, S.C.H.: Align before fuse: Vision and language representation learning with momentum distillation. NeurIPS pp. 9694-9705 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.661, + 0.785, + 0.702 + ], + "angle": 0, + "content": "29. Liang, J., Huang, W., Xia, F., Xu, P., Hausman, K., Ichter, B., Florence, P., Zeng, A.: Code as policies: Language model programs for embodied control. In: ICRA. pp. 9493-9500 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.753, + 0.716 + ], + "angle": 0, + "content": "30. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. NeurIPS (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.717, + 0.785, + 0.743 + ], + "angle": 0, + "content": "31. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Grounded affordance from exocentric view. arXiv:2208.13196 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.785, + 0.771 + ], + "angle": 0, + "content": "32. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning affordance grounding from exocentric images. In: CVPR. pp. 2252-2261 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "33. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning visual affordance grounding from demonstration videos. IEEE Transactions on Neural Networks and Learning Systems (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "34. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research (2008)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Interaction Relationship-aware Affordance Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "35. MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. vol. 1, pp. 281-297. Oakland, CA, USA (1967)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.189, + 0.787, + 0.217 + ], + "angle": 0, + "content": "36. Mai, J., Yang, M., Luo, W.: Erasing integrated learning: A simple yet effective approach for weakly supervised object localization. In: CVPR. pp. 8766-8775 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.217, + 0.787, + 0.243 + ], + "angle": 0, + "content": "37. Mees, O., Borja-Diaz, J., Burgard, W.: Grounding language with visual affordances over unstructured data. In: ICRA. pp. 11576-11582 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.243, + 0.787, + 0.27 + ], + "angle": 0, + "content": "38. Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. ICLR (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.27, + 0.787, + 0.298 + ], + "angle": 0, + "content": "39. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM pp. 39-41 (1995)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.298, + 0.787, + 0.325 + ], + "angle": 0, + "content": "40. Myers, A., Teo, C.L., Fermüller, C., Aloimonos, Y.: Affordance detection of tool parts from geometric features. In: ICRA. pp. 1374-1381 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.325, + 0.787, + 0.352 + ], + "angle": 0, + "content": "41. Nagarajan, T., Feichtenhofer, C., Grauman, K.: Grounded human-object interaction hotspots from video. In: ICCV. pp. 8688-8697 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.352, + 0.787, + 0.379 + ], + "angle": 0, + "content": "42. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Detecting object affordances with convolutional neural networks. In: IROS. pp. 2765-2770 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.379, + 0.787, + 0.419 + ], + "angle": 0, + "content": "43. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Object-based affordances detection with convolutional neural networks and dense conditional random fields. In: IROS. pp. 5908-5915 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.42, + 0.787, + 0.446 + ], + "angle": 0, + "content": "44. Nguyen, T., Vu, M.N., Vuong, A., Nguyen, D., Vo, T., Le, N., Nguyen, A.: Open-vocabulary affordance detection in 3d point clouds. In: IROS. pp. 5692-5698 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.446, + 0.787, + 0.473 + ], + "angle": 0, + "content": "45. Ning, S., Qiu, L., Liu, Y., He, X.: Hoiclip: Efficient knowledge transfer for hoi detection with vision-language models. In: CVPR. pp. 23507-23517 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.473, + 0.787, + 0.514 + ], + "angle": 0, + "content": "46. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv:2304.07193 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.514, + 0.787, + 0.554 + ], + "angle": 0, + "content": "47. Pan, J., Ferrer, C.C., McGuinness, K., O'Connor, N.E., Torres, J., Sayrol, E., Giro-i Nieto, X.: Salgan: Visual saliency prediction with generative adversarial networks. arXiv:1701.01081 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.554, + 0.787, + 0.596 + ], + "angle": 0, + "content": "48. Pan, X., Gao, Y., Lin, Z., Tang, F., Dong, W., Yuan, H., Huang, F., Xu, C.: Unveiling the potential of structure preserving for weakly supervised object localization. In: CVPR. pp. 11642-11651 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.596, + 0.787, + 0.622 + ], + "angle": 0, + "content": "49. Pennington, J., Socher, R., Manning, C.D.: Glove: Global vectors for word representation. In: EMNLP. pp. 1532-1543 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.622, + 0.787, + 0.663 + ], + "angle": 0, + "content": "50. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.663, + 0.787, + 0.704 + ], + "angle": 0, + "content": "51. Rana, K., Haviland, J., Garg, S., Abou-Chakra, J., Reid, I., Suenderhauf, N.: Say-plan: Grounding large language models using 3d scene graphs for scalable task planning. In: CoRL (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.704, + 0.787, + 0.745 + ], + "angle": 0, + "content": "52. Rashid, A., Sharma, S., Kim, C.M., Kerr, J., Chen, L.Y., Kanazawa, A., Goldberg, K.: Language embedded radiance fields for zero-shot task-oriented grasping. In: CoRL (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.745, + 0.787, + 0.772 + ], + "angle": 0, + "content": "53. Sawatzky, J., Srikantha, A., Gall, J.: Weakly supervised affordance detection. In: CVPR. pp. 2795-2804 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.772, + 0.787, + 0.813 + ], + "angle": 0, + "content": "54. Singh, I., Blukis, V., Mousavian, A., Goyal, A., Xu, D., Tremblay, J., Fox, D., Thomason, J., Garg, A.: Progprompt: Generating situated robot task plans using large language models. In: ICRA. pp. 11523-11530 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.813, + 0.787, + 0.84 + ], + "angle": 0, + "content": "55. Tang, J., Zheng, G., Yu, J., Yang, S.: Cotdet: Affordance knowledge prompting for task driven object detection. In: ICCV. pp. 3068-3078 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.388, + 0.129 + ], + "angle": 0, + "content": "Jang & Seo et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "56. Wan, B., Tuytelaars, T.: Exploiting clip for zero-shot hoi detection requires knowledge distillation at multiple levels. In: WACV. pp. 1805-1815 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.787, + 0.203 + ], + "angle": 0, + "content": "57. Warren, W.: Perceiving affordances: Visual guidance of stair climbing. Journal of experimental psychology. Human perception and performance pp. 683-703 (1984)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.785, + 0.231 + ], + "angle": 0, + "content": "58. Xu, R., Chu, F.J., Tang, C., Liu, W., Vela, P.A.: An affordance keypoint detection network for robot manipulation. IEEE RA-L pp. 2870-2877 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.785, + 0.259 + ], + "angle": 0, + "content": "59. Xue, Y., Gan, E., Ni, J., Joshi, S., Mirzasoleiman, B.: Investigating the benefits of projection head for representation learning. In: ICLR (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.26, + 0.785, + 0.285 + ], + "angle": 0, + "content": "60. Yu, S., Seo, P.H., Son, J.: Zero-shot referring image segmentation with global-local context features. In: CVPR. pp. 19456-19465 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.785, + 0.327 + ], + "angle": 0, + "content": "61. Zhang, J., Herrmann, C., Hur, J., Cabrera, L.P., Jampani, V., Sun, D., Yang, M.H.: A tale of two features: Stable diffusion complements dino for zero-shot semantic correspondence. arXiv:2305.15347 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.369 + ], + "angle": 0, + "content": "62. Zhang, X., Wang, D., Han, S., Li, W., Zhao, B., Wang, Z., Duan, X., Fang, C., Li, X., He, J.: Affordance-driven next-best-view planning for robotic grasping. In: CoRL (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.37, + 0.785, + 0.41 + ], + "angle": 0, + "content": "63. Zhao, X., Li, M., Weber, C., Hafez, M.B., Wermter, S.: Chat with the environment: Interactive multimodal perception using large language models. arXiv:2303.08268 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.411, + 0.785, + 0.438 + ], + "angle": 0, + "content": "64. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: CVPR. pp. 2921-2929 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.44, + 0.785, + 0.48 + ], + "angle": 0, + "content": "65. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv:2304.10592 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.787, + 0.48 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_origin.pdf b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0076082b7953253c0d02e600fd92fe910f6d5bbb --- /dev/null +++ b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/8f180f14-23fa-4c9e-b483-c083835b4c1f_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cba9f637c0dedf63b2bc57cd7843a86171e80b13c6e6d85396c2678b05d3283b +size 4798966 diff --git a/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/full.md b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/full.md new file mode 100644 index 0000000000000000000000000000000000000000..1443fc5b997b87162eec3226a4659c4fddfa5b82 --- /dev/null +++ b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/full.md @@ -0,0 +1,309 @@ +# INTRA: Interaction Relationship-aware Weakly Supervised Affordance Grounding + +Ji Ha Jang $^{1*}$ , Hoigi Seo $^{1*}$ , and Se Young Chun $^{1,2\dagger}$ + +$^{1}$ Dept. of Electrical and Computer Engineering, $^{2}$ INMC & IPAI Seoul National University, Republic of Korea {jeeit17, sehoiki3215, sychun}@snu.ac.kr + +Abstract. Affordance denotes the potential interactions inherent in objects. The perception of affordance can enable intelligent agents to navigate and interact with new environments efficiently. Weakly supervised affordance grounding teaches agents the concept of affordance without costly pixel-level annotations, but with exocentric images. Although recent advances in weakly supervised affordance grounding yielded promising results, there remain challenges including the requirement for paired exocentric and egocentric image dataset, and the complexity in grounding diverse affordances for a single object. To address them, we propose INTERaction Relationship-aware weakly supervised Affordance grounding (INTRA). Unlike prior arts, INTRA recasts this problem as representation learning to identify unique features of interactions through contrastive learning with exocentric images only, eliminating the need for paired datasets. Moreover, we leverage vision-language model embeddings for performing affordance grounding flexibly with any text, designing text-conditioned affordance map generation to reflect interaction relationship for contrastive learning and enhancing robustness with our text synonym augmentation. Our method outperformed prior arts on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD. Additionally, experimental results demonstrate that our method has remarkable domain scalability for synthesized images / illustrations and is capable of performing affordance grounding for novel interactions and objects. Project page: https://jeeit17.github.io/INTRA + +Keywords: Affordance grounding $\cdot$ Weak supervision $\cdot$ Exocentric image $\cdot$ Contrastive learning $\cdot$ Interaction relation + +# 1 Introduction + +Affordance [17] refers to the perceived possible interactions based on an object's inherent or recognized properties (e.g., the rim of a wine glass affords sipping while stem of it affords holding). Humans can identify affordances of objects and interact with proper parts despite the diversity in their physical attributes. + +![](images/7020819b9d47883bc814855fff9dacc26e639943e4f4c868997a02d87a17dcce.jpg) +Fig. 1: Prior works on weakly-supervised affordance grounding like LOCATE [25] often failed to ground different affordances for the same object. However, our proposed INTRA yielded finer and more accurate grounding results for them that are closer to the ground truth (GT) by considering interaction relationship among them. + +This ability can be acquired through individual learning, by directly interacting with objects, and observational learning [8], by observing others' interactions. The sense of affordance enables effective interaction in new environments or with novel objects, without step-by-step instructions [57]. Affordance plays an essential role across numerous applications involving intelligent agents, enabling them to provide flexible and timely responses in complex, dynamic environments [5]. These applications include task planning, robot grasping, manipulation, scene understanding and action prediction [2,6,7,16,51,62]. + +Affordance grounding is the task to teach intelligent systems how to locate possible action regions in objects for a certain interaction. While fully supervised learning [4, 18, 42, 58] is the most straightforward approach, its reliance on costly annotations may limit its applicability across diverse contexts. Another approach is weakly supervised learning, similar to human's observational learning [8], that does not require GT, but weak labels. In this setting, exocentric images illustrating human-object interactions, along with corresponding egocentric images depicting the objects, are provided during training. During inference, intelligent systems perform affordance grounding on the egocentric images, identifying object parts relevant to the given interactions. Recent advances in weakly supervised affordance grounding [25, 31, 32, 41] proposed to use pairs of exocentric and egocentric images, yielding great performance. The deep neural networks learn affordances by pulling features from exocentric and egocentric images closer, aiming to focus on object parts related to interactions. + +However, weakly supervised affordance grounding remains challenging. Firstly, the requirement for current weak labels with pairs of exocentric and egocentric images is still strong. Note that human observational learning does not usually require egocentric images. Secondly, a complex relationship between interactions exists, which has not been adequately addressed in prior works. Many instances in object-interaction relationships exhibit intricate many-to-many associations, occasionally with one entailing another. For example, some distinct + +interactions represent the same affordance regions (e.g., 'wash' and 'brush with' a tooth brush), and there are closely related interactions that always come together (e.g., 'sip' usually includes 'hold'. 'ride' usually includes 'sit on'). This complexity poses challenges in extracting interaction-relevant features based on image-level affordance labels, introducing biases towards objects in affordance grounding as illustrated in Fig. 1 (LOCATE [25] often yielded similar affordance grounding with different interactions for the same object). + +Here, we propose a novel weakly supervised affordance grounding method, INTRA (INTeraction Relationship-aware weakly supervised Affordance grounding) to address these unexplored challenges. While previous studies [31,41] solved the weak supervision problem as supervised learning by pulling object features of exocentric and egocentric images closer and LOCATE [25] enhanced this approach by generating more localized pseudo labels based on prior information for exocentric images for supervised learning (i.e., containing human, object part, and background), our INTRA framework recasts the weak supervision problem as representation learning. This novel reformulation allows us to use weaker labels (i.e., exocentric images only) for training so that the requirement to use pairs of exocentric / egocentric images is now alleviated. Moreover, unlike prior works, our INTRA method actively exploits large language model (LLM) as well as the text encoder of the vision-language model (VLM) to leverage linguistic information and existing textual knowledge on affordances, which further enhances our interaction relationship-guided contrastive learning. This novel scheme also allows excellent scalability for unseen objects across diverse domains as well as zero-shot inference for novel interactions, which was not possible in prior arts. In summary, our main contributions are three-fold as follows: + +- We propose a novel approach for weakly supervised affordance grounding by recasting the problem as representation learning and by leveraging VLM, leading to relaxing the need for paired training datasets for more weak supervision and enhancing scalability across domains for unseen objects. +- We proposed INTRA, a novel method that consists of text synonym augmentation and text-conditioned affordance map generation module along with interaction relationship-guided contrastive learning, so that inference on unseen interactions is possible. +- Our INTRA outperforms the prior arts in weakly supervised affordance grounding on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD, demonstrating both qualitative and quantitative excellence (see Fig. 1). + +# 2 Related Works + +# 2.1 Affordance Grounding + +Supervised affordance grounding. Supervised affordance grounding methods [10, 14] analyze interaction videos / images to predict affordance regions on an object, trained with pixel-level GT masks / heat maps. Though successful in localizing fine-grained affordance regions through supervised learning, they are + +limited by the costly GT mask annotation process and their limited generalizability to unseen objects. Furthermore, they require paired demonstration videos and target object images, making real-world application challenging. + +Weakly supervised affordance grounding. Weakly supervised affordance grounding methods [13,20,23,25,31-33,41,47] offer the advantage of not requiring GT, but requiring weak labels such as exocentric images with interaction text labels. Prior works [25,31,32,41] mainly align interaction-relevant object features from both egocentric and exocentric images without considering the intrinsic properties of interactions. The framework in [41] predicts object features engaged in interactions by analyzing human-object interaction videos. The works of [31, 32] preserve the correlation of affordance features from exocentric and egocentric images to learn affordances. The work of [25] enhances object feature extraction by adopting DINO-ViT [9] based Class Activation Maps (CAM) [64] and k-means clustering [35] for more explicit guidance. However, focusing solely on object features may introduce biases towards object, hindering the inference of multiple affordances for a single object. Our INTRA addresses this issue by considering the complex relationships between interactions using interaction relationship-guided contrastive loss, while ensuring the network remains attentive to the objects using object-variance mitigation loss. + +# 2.2 Foundation Models for Affordance Grounding + +Self-supervised transformer. Self-supervised transformers, extensively trained on large-scale datasets and scalability, possess robust representation power. Previous works [25,52] have explored their potential in affordance grounding. DINO-ViT [9], a vision transformer foundation model trained in a self-supervised manner, can identify both high-semantics such as overall information of the image and low-semantics such as details regarding specific object parts. This versatility has led advancements in various tasks, including classification, semantic segmentation [4, 24] and semantic correspondence [61]. LOCATE [25] leverages DINO-ViT to extract low-semantic information, resulting in performance improvements in affordance grounding. Our INTRA employed DINOv2 [46] as an image encoder to extract information about objects and their constituent parts. + +Vision-language model. The Vision-Language Model (VLM) is a class of models jointly pretrained on visual and language data for various downstream tasks [45, 56, 60]. VLM text encoders, trained through contrastive learning with image-text pairs, capture representations in the joint space of the images and text [26-28, 50]. These text encoders, incorporating visual information, have demonstrated excellent performance across multiple tasks. ALBEF [28] notably enhances vision and language representation learning by aligning image and text features before fusing them. While supervised affordance grounding methods leveraging VLM text encoders [44] have been explored, their application in weakly supervised affordance grounding remains underexplored. We propose a + +![](images/c7dda98a940578a5a159642fae60980216b791e327e9f2a8f5a1c8421e41c57e.jpg) +Fig. 2: Overall frameworks of (a) LOCATE [25] and (b) INTRA (Ours). LOCATE takes paired exocentric and egocentric images to generate interaction-aware affordance maps (CAMs) for predefined interactions and then selects an interaction-related CAM by the given interaction label. In contrast, INTRA takes only exocentric images and interaction labels to yield an affordance map through our affordance map generation module. Training is done via interaction relationship-guided contrastive learning on exocentric features from affordance maps. Note that all encoder parameters are frozen. + +framework leveraging the text encoder of ALBEF to enable novel interactions, diverging from prior arts limited to inferring predetermined sets of affordances. + +Large language model. Understanding affordance relationships is crucial for affordance grounding, as it enables extending and linking learned visual cues, and reasoning about affordances for new objects, interactions, or situations. While prior works like [19] leverage semantically similar object properties and [32] utilize affordance feature correlation, none directly exploit these relationships. We use these intricate relationships in affordance learning by adopting Large Language Models (LLMs). LLMs have gained prominence in robotics due to their profound natural language understanding, providing valuable priors about interactions and their complex relationships. Previous works [3,29,54,63] focus on extracting action knowledge, deriving task-specific plans, and grounding them in the physical world. LLMs have also been widely used in previous affordance studies [37,55], demonstrating their exceptional understanding of interactions. + +# 3 Method + +Prior arts in weakly supervised affordance grounding [25, 31, 32, 41] typically align object features of paired exocentric (interaction with object) and egocentric (object only) images to learn interaction-related features. For example, as illustrated in Fig. 2(a), LOCATE [25] generates CAMs (affordance maps) from exocentric and egocentric images for a pre-determined interaction label, extracts egocentric feature as well as exocentric object parts feature selected by PartS-select module (pseudo label), and then trains the model by optimizing cosine + +similarity to align (pull) egocentric and exocentric object parts features. In contrast, we propose an alternative approach, INTRA, whose overall framework is illustrated in Fig. 2(b). Our text-conditioned affordance grounding framework of INTRA leverages VLM text encoder in affordance map generation module and employs text synonym augmentation to enhance robustness, as will be described in Sec. 3.1. Then, INTRA learn affordance grounding via our interaction relationship-guided contrastive learning, detailed in Sec. 3.2. The framework of INTRA as depicted in Fig. 2(b) clearly suggests two advantages over prior arts including LOCATE [25]: 1) it exploits exocentric images only and 2) INTRA admits novel interactions outside the pre-defined interaction set. + +# 3.1 Text-conditioned Affordance Grounding Framework + +To utilize the semantic meanings inherent in interaction labels and enable flexible inference on novel verbs, our text-conditioned affordance grounding framework generates affordance maps by conditioning image features with text features via our affordance map generation module where text and image features extracted from separately pre-trained text and image encoders are fused. In specific, as depicted in Fig. 2(b), deep features $\mathcal{F}_{exo} \in \mathbb{R}^{(h \times w) \times d}$ are obtained from the input exocentric images using DINOv2 [46], where $h$ and $w$ represent the height and width of the affordance map, and $d$ refers to the dimension of the feature. The text feature $\mathcal{F}_{text}$ of the given interaction is obtained using the ALBEF text encoder [28]. See the supplementary material for further details on the rationale for employing DINOv2 and the ablation study on the text encoder. + +Affordance map generation module. Before fusing text and image features, the class token of $\mathcal{F}_{text}$ passes through a single linear layer to align the separately pre-trained image and text embedding spaces and connect them, as shown to be effective in previous works [30,65]. Subsequently, image features $\mathcal{F}_{exo}$ and the class token of text features are concatenated and processed through a transformer encoder for conditioning. The image feature part of the resulting vector is then projected using a multi-layered convolutional network and normalized using min-max normalization to obtain the affordance map $\mathcal{M}_{aff} \in \mathbb{R}^{h \times w}$ . This affordance map represents the image regions in exocentric images most relevant to interactions. During inference, $\mathcal{M}_{aff}$ functions directly as an output heatmap, indicating the image regions in egocentric images most relevant to interactions. + +Text synonym augmentation. To enhance the robustness of text conditioning, we integrate text synonym augmentation into our interaction embeddings. Initially, we generate $k_{s}$ synonyms for each interaction label using LLM. Subsequently, any synonyms overlapping with other interaction labels are removed. These synonyms are then randomly selected to substitute the text conditioning interaction embedding, while the original interaction label is retained for interaction relationship-guided contrastive learning. This module enhances overall performance by providing models with enriched interpretations of interactions. + +# 3.2 Interaction Relationship-guided Contrastive Learning + +Our INTRA learns via interaction relationship-guided contrastive learning by comparing exocentric image features across diverse interactions. Our contrastive learning consists of two key components, 1) extracting exocentric image features with affordance map and 2) designing loss for interaction relationship-guided contrastive learning, that enable the grounding of multiple affordances on a single object. + +Exocentric image feature extraction with affordance map. As described in Sec 3.1, a text-conditioned affordance map, $\mathcal{M}_{aff}$ , is generated to represent interaction-relevant image regions of exocentric images. Then, the exocentric image features $f_{exo}$ corresponding to the affordance map are extracted as follows: + +$$ +f _ {e x o} = (1 / h w) \Sigma_ {i = 1} ^ {h} \Sigma_ {j = 1} ^ {w} \mathcal {F} _ {e x o} (i, j) \cdot \mathcal {M} _ {a f f} (i, j) \in \mathbb {R} ^ {d}. \tag {1} +$$ + +The resulting $f_{exo}$ is then projected and normalized to obtain the exocentric image feature $z_{exo}$ using an MLP layer, which will be used for training. This projection layer was also used in previous works [11, 12, 59], which have demonstrated the necessity and efficiency of it. + +Loss design for interaction relationship-guided contrastive learning. Supervised contrastive learning [21] effectively derives good representations for each class by focusing on common characteristics in positive pairs while disregarding those in negative pairs like other classes. However, in affordance grounding tasks, treating all other interaction classes as negative pairs may be inadequate due to the complex relationship among interactions. To mitigate this issue, we propose interaction relationship-guided contrastive loss, $\mathcal{L}_{inter}$ . Furthermore, considering the subtle meaning variations within single interaction classes depending on the object and context, we also propose object-variance mitigation loss, $\mathcal{L}_{obj}$ . Thus, the total loss for our INTRA is formulated as follows: + +$$ +\mathcal {L} _ {\text {t o t a l}} = \mathcal {L} _ {\text {i n t e r}} + \lambda_ {\text {o b j}} \mathcal {L} _ {\text {o b j}} \tag {2} +$$ + +where $\lambda_{obj}$ denotes the control parameter of $\mathcal{L}_{obj}$ . + +Interaction relationship-guided contrastive loss. In affordance grounding, treating all other interaction classes as negative pairs is inadequate due to the intricate relationships between interactions. For example, 'Wash' and 'Brush with' toothbrush or 'Pour' and 'Seal' bottle represent distinct interactions but act on the same object parts. Manually finding these relationships is time-consuming and impractical as the number of pairs grows quadratically with the number of interaction (see the supplementary). Moreover, although linguistic relationships like synonyms or co-occurrence were considered as substitutes, they are often inadequate and degrade performance. For example, 'Sip' entails 'Hold', but they act on different part of objects, and 'Wash' and 'Cut with' a knife have different + +![](images/22f128a0339f15560399fc51d418c53c5104f1412ee116348f91632746573786.jpg) +Fig. 3: The overall scheme of interaction-relationship map $(\mathcal{R})$ generation. LLM classifies all pairs of interactions in the dataset as positive or negative through chain of thoughts. This process is based on reasoning if interactions occur on same object parts. + +meanings, but they act on the same blade. To mitigate this, we leverage LLM to determine if interaction pairs act on the same object part. Through Chain of Thoughts (CoT), interaction pairs are categorized as positive or negative in three steps as described in Fig. 3. In Step 1, LLM deduces five different objects where both interactions could be performed. In Step 2, LLM identifies object parts where these interactions could occur by considering five objects one by one, not simultaneously. In Step 3, if the identified parts of the interaction pair are the same, the pair is classified as positive; otherwise, negative. Positive pairs are assigned 1 in the interaction-relationship map $\mathcal{R}$ , and negative pairs are assigned 0. We propose interaction-relationship guided contrastive loss by integrating $\mathcal{R}$ into supervised contrastive learning as follows: + +$$ +\mathcal {L} _ {i n t e r} = \sum_ {i = 1} ^ {2 N} \frac {- 1}{2 N y _ {i} - 1} \sum_ {j = 1} ^ {2 N} \mathcal {R} _ {\left(y _ {i}, y _ {j}\right)} \cdot \log \frac {\exp \left(z _ {e x o} ^ {i} \cdot z _ {e x o} ^ {j} / \tau\right)}{\sum_ {k = 1} ^ {2 N} \mathbf {1} _ {i \neq k} \cdot \exp \left(z _ {e x o} ^ {i} \cdot z _ {e x o} ^ {k} / \tau\right)} \tag {3} +$$ + +where $i, j$ are sample indices, $y_{i}, y_{j}$ are class labels, $N_{y_i}$ is the number of samples in the batch labeled with $y_{i}$ , $N$ is the total number of distinct samples in the batch, $z_{exo}^{j}$ is the exocentric image feature vector of each sample, $\tau$ is the temperature, and $\mathcal{R}_{(y_i,y_j)}$ is the value of $(y_{i},y_{j})$ pair in interaction-relationship map. + +Object-variance mitigation loss. In the context of affordance, the interpretation of the same interaction can vary significantly based on the object and context. For instance, 'Hold' a baseball bat and a cup may seem similar since both involve grasping an object. However, the former involves gripping the bat's slender part, while the latter entails holding the cup's rounded, protruding part. To address this variance within the same interaction category, we implemented + +an object-variance mitigation loss $\mathcal{L}_{obj}$ as follows: + +$$ +\sum_ {i = 1} ^ {2 N} \frac {- 1}{2 N o _ {i} - 1} \sum_ {j = 1} ^ {2 N} \mathbf {1} _ {o _ {i} = o _ {j}} \cdot \log \frac {\exp \left(z _ {e x o} ^ {i} \cdot z _ {e x o} ^ {j} / \tau\right)}{\sum_ {k = 1} ^ {2 N} \mathbf {1} _ {i \neq k} \cdot \exp \left(z _ {e x o} ^ {i} \cdot z _ {e x o} ^ {k} / \tau\right)} \tag {4} +$$ + +where $o_i$ , $o_j$ denote object class of $i$ and $j$ . + +# 4 Experiments + +# 4.1 Experimental Setting + +Dataset and metrics. We conducted an evaluation of our method using the Affordance Grounding Dataset (AGD20K) [32]. AGD20K comprises both exocentric and egocentric images, with 20,061 exocentric images and 3,755 egocentric images labeled with 36 affordances. The dataset support evaluation under two settings: 1) the 'Seen' setting, where the object categories of the training and testing sets are identical, and 2) the 'Unseen' setting, where no objects overlap between the training and test sets. Our approach only used exocentric images in training for all experiments, while other approaches were trained using both egocentric and exocentric images. We employed three evaluation metrics commonly employed in previous affordance grounding methodologies: 1) Kullback-Leibler Divergence (KLD), 2) Similarity (SIM), 3) and Normalized Scanpath Saliency (NSS). These metrics were utilized to quantify the similarity between the distributions of ground truth heatmaps and predicted affordance grounding. + +Implementation details. We employed DINOv2 as the image encoder and ALBEF, fine-tuned with RefCOCO+, as the text encoder. ChatGPT-4 [1] served as the LLM. Images were resized to $384 \times 384$ , then cropped to $336 \times 336$ . Training utilized the Adam optimizer [22] with a learning rate of 2e-4 and a batch size of 256. The hyperparameter $\lambda_{obj}$ was set to 4, and all experiments were conducted on a single NVIDIA A100 GPU. More details are provided in the supplementary. + +# 4.2 Comparison to State-of-the-art Methods + +To comprehensively assess our method, we conduct quantitative and qualitative comparisons with state-of-the-art weakly-supervised grounding methods, incorporating a user study. We further expand our experiments to include additional datasets [40, 43, 53] for a comprehensive evaluation. Refer to the supplementary materials for more details on the experimental settings. + +Quantitative results. We evaluated previous works [15, 25, 31, 32, 36, 41, 48] and our method based on the metrics mentioned above. Tab. 1 shows the quantitative comparison results of our method with prior arts. In both 'Seen' and 'Unseen' setting, our approach surpasses the baseline performances across all three metrics: KLD, SIM, and NSS, thereby setting a new state-of-the-art. + +Table 1: Quantitative results of ours and other baselines [15,25,31,32,36,41,48] on the AGD20K dataset. $\uparrow / \downarrow$ indicates that higher / lower the metric is, the better the model performs. INTRA outperformed all baselines, despite being trained only with exocentric images, whereas other models incorporated both exocentric and egocentric images during training. + +
Prior worksSeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Weakly Supervised Object LocalizationEIL [36]1.9310.2850.5222.1670.2270.330
SPA [48]5.5280.2210.3577.4250.1670.262
TS-CAM [15]1.8420.2600.3362.1040.2010.151
Weakly Supervised Affordance GroundingHotspots [41]1.7730.2780.6151.9940.2370.557
Cross-view-AG [32]1.5380.3340.9271.7870.2850.829
Cross-view-AG+ [31]1.4890.3420.9811.7650.2790.882
LOCATE [25]1.2260.4011.1771.4050.3721.157
ExoINTRA (Ours)1.1990.4071.2391.3650.3751.209
+ +Table 2: Quantitative results on the modified IIT-AFF, CAD, and UMD dataset for our method and other baselines [25,31,32]. Models were trained in the 'Seen' setting of AGD20K and tested on the datasets without additional training. INTRA outperformed all baselines on all metrics across all datasets. * Objects with affordances that prior works are unable to predict were eliminated from the datasets for fairness, wheares our method can infer affordances on novel interactions. + +
IIT-AFF* [43]CAD* [53]UMD* [40]
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Cross-View-AG [32]3.8560.0960.8492.5680.1730.5894.7210.0141.287
Cross-View-AG+ [31]3.9200.0951.0722.5290.1760.6634.7530.0131.227
LOCATE [25]3.3150.1151.7092.5280.1870.5584.0830.0262.699
INTRA(Ours)2.6630.1482.5112.0950.2431.2593.0810.0624.195
+ +Results on additional datasets. We evaluated the generalization and robustness of the INTRA framework, along with previous works [25, 31, 32] trained in the 'Seen' setting of AGD20K, on the IIT-AFF [43], CAD [53], and UMD [40] datasets. The experiment was conducted in the 'Seen' setting due to overlapping objects between these datasets and AGD20K. Each GT was processed in the same way as when evaluating the AGD20K test set. Despite significant domain gaps across datasets, INTRA outperformed in all metrics on all datasets, demonstrating its superior generalizability as shown in Tab. 2. Further details of the experiment can be found in the supplementary material. + +Qualitative results. Fig. 4 and Fig. 5 show our superior grounding precision compared to the baselines, being closer to the GT and finer in granularity. INTRA precisely identifies the exact object part for a given affordance, unlike the baselines, which ground the same parts regardless of the affordances provided. + +User study. Affordance grounding can be ambiguous depending on context and interpretation, thus relying solely on metrics for evaluation has limita- + +![](images/5660ef248a7789bc692b3e2c07f9f0242a234ceeb81c0e3d225979f9a95cae86.jpg) + +![](images/e5117f8a6906506a643262e7c95b6ff5299f42cc7a6fb724033dea422488351e.jpg) +Fig. 4: Qualitative results of INTRA (Ours) and baseline models [25,31,32] on grounding affordances of multiple potential interactions on a single object. INTRA precisely localizes relevant interaction spots for each interaction. For example, with a knife, it grounds the handle for 'Hold' and the blade for 'Cut with'. For a motorcycle, it accurately grounds the saddle for 'Sit on'. Additionally, for 'Ride', it grounds both the handle and saddle, slightly deviating from the GT but still producing reasonable results, as we usually interacts with handle and saddle to 'Ride' a motorcycle. +Fig. 5: Qualitative results comparison between our approach and other baselines [25, 31,32]. Our approach, INTRA, demonstrates superior precision and detail in grounding affordances compared to the baselines. For instance, in the example of 'Drag', while baselines either fail to localize the handle or erroneously ground several other parts, INTRA accurately identifies and grounds the handle of a suitcase with finesse. + +Table 3: The result of user study on validity, finesse, and separability. Users were asked to score a 5-point scale, and we averaged it for mean opinion score (MOS). + +
ValidityFinesseSeparability
Cross-View-AG+ [31]2.8973.0222.732
LOCATE [25]3.0542.5732.651
INTRA (Ours)3.1343.1123.221
Ground Truth2.9053.3343.160
+ +Table 4: Quantitative results of ablation Table 5: Quantitative results of ablation study on our loss design. We incrementally mention study on different $\mathcal{R}$ . $\mathcal{L}_{WordNet}$ , added each component of the losses to ex- $\mathcal{L}_{Word2Vec}$ are calculated using word similarity from WordNet [39], Word2Vec [38], + +
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
baseline1.6780.3380.8911.5810.3001.100
Linter1.4390.3341.0311.5690.2921.133
Lobj1.3360.3871.2181.5210.3341.042
Linter+Lobj1.1990.4071.2391.3650.3751.209
+ +respectively. $\mathcal{L}_{Co - occur}$ used cooccurrence probability in GloVe [49]. + +
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
LWordNet1.7010.2820.7101.6980.2770.937
LCo-occur.1.5190.3090.9881.6390.2741.101
LWord2Vec1.5470.3020.9581.6790.2700.980
Linter(Ours)1.4390.3341.0311.5690.2921.133
+ +tions. Hence, we conducted a user study comparing Cross-View-AG+ [31], LOCATE [25], GT, and INTRA (Ours) across three categories: 1) Validity: assessing heatmap reasonableness, 2) Finesse: measuring heatmap detail, 3) Separability: determining the accuracy of the heatmap when different affordances are assigned to the same object. A total of 936 responses were collected for randomly selected samples from 104 respondents. Results presented in Tab. 3 demonstrate that our approach outperforms baselines and par on GT based on human perception. + +# 4.3 Ablation Studies + +We validate our pipeline design choices and parameters with ablation studies. This section includes ablation studies on loss design, adoption of LLM, and text synonym augmentation. Refer to the supplementary for further ablation studies. + +Ablation study on loss design. To assess the individual impact of the components comprising loss on its overall performance, we analyzed by incrementally adding components. We started with the most basic element: a normal supervised contrastive loss. Subsequently, we sequentially added an interaction relationship-guided loss and an object-variance mitigation loss. The performance outcomes of these incremental modifications were thoroughly evaluated to understand their contributions, as represented in the Tab. 4. + +Ablation study on adoption of LLM. Adopting LLM to create the relationship map was essential given the intricate nature of affordances. We experimented with various methods to create the relationship map to validate this + +![](images/cd03b425f1121cc4d387f2bb7e3ea6d9e874dbbb64a0badf91808b19e843bb8d.jpg) +(a) Overall training scheme +Fig. 6: An illustration of interaction relationship-guided contrastive learning and t-SNE [34] visualization of feature distribution. (a) In interaction relationship-guided contrastive learning, positive interaction pairs attract each other, while others repel. (b) t-SNE visualization of DINOv2 [46] class token and $f_{exo}$ from INTRA, showing that features of positive interaction pairs become closer as learning progresses. + +![](images/2f28eef7242e00b72dddbec94a7baea632df2c5bb7d5a4fd14cd866560aa4e7f.jpg) +(b) Feature t-SNE before (left) / after (right) training + +choice. We measured the similarity of interaction pairs using WordNet [39] and Word2Vec [38], or computed co-occurrence probability of interaction pairs with Glove [49]. Based on these measurements, we created an Interaction-relationship Map and trained the INTRA framework. The results are in the Tab. 5. + +Ablation study on text synonym augmentation. We conducted an ablation study on the effectiveness of text synonym augmentation on overall performance. We compared performance with and without the module. The module improved performance by up to $21.93\%$ , particularly in the 'Unseen' setting, enriching models with varied meanings of interactions. Additionally, to test its effectiveness on novel verb inference, we deliberately omitted the subset 'Hold' $(24.17\%$ of training data) and then performed inference on 'Hold'. The module boosted performance for novel verbs by up to $58.06\%$ . Similar tendencies were observed for other verbs. Detailed results are available in the supplementary. + +# 5 Discussion + +# 5.1 Effect of Interaction Relationship-guided Contrastive Loss + +Our rationale for learning affordance grounding solely with exocentric images relies on the consistent presence of humans within these images. By repelling common features of negative pairs, such as human parts, the images effectively exclude irrelevant elements. Conversely, positive pairs, sharing the desired feature of the object—specifically, the rim of the object near the face—facilitate learning by attracting these relevant features (see Fig. 6(a)). To visualize the effectiveness of our loss in learning interaction-relevant features in similar images, we examine the feature distributions of 'Hold' and 'Sip' a wine glass, involving distinct affordances. Prior to training, these distributions overlap. However, after training with our loss function, the feature distribution for 'Hold wine glass' aligns more closely with 'Hold baseball bat' than with 'Sip wine glass'. This indicates that our loss function effectively discriminates between the characteristics of different interactions without exhibiting bias towards objects (see Fig. 6(b)). Detailed explanation is illustrated in the supplementary. + +![](images/15beebd5b9e48617d6b475afa0f523683f104eaaf76111c33295ceeb71a3b55e.jpg) +LOCATE +I + +![](images/9a088ffbdca4c0668c0cdda3e51ad906048ea60a2ef9e7bcdc30e1e1d57b2d53.jpg) +NTRA (Ours) + +![](images/3c2ed3fcff53b2073ea464166f73eb8a568ebf1c9828d6f9fd7518a6f731995a.jpg) +LOCATE +INTRA (Ours) + +![](images/5a78434d2b3c40acf354603f86c9f38c7091ea3b19291267bda5b87faeefe66a.jpg) +LOCATE + +![](images/27b6617b1f9ab4ac8713a58350ece750ab4b9c4ec0ab3814637ea722fd48a7c7.jpg) +INTRA (Ours) + +![](images/19f0fdcb0706975354da39ab1e45e84a751b42c4f04b9cd29c24d073d732e0a0.jpg) +LOCATE + +![](images/fa02b5539059f4fc628065abe31a73813c59c7f746aae32e6226c33cbbad62d6.jpg) +INTRA (Ours) + +![](images/e1520ca8e27c6b1e5bf6533121065a435d3b8273e45f8faba9e9c3118bf57289.jpg) +(a) Qualitative results on images with large domain gap +LOCATE +INTRA (Ours) +(b) Qualitative results on novel object +Fig. 7: Qualitative results of feasibility study: (a) Inference on diverse images with significant domain gap such as pixel arts and paintings. (b) Inference on novel objects that were not in the training data. (c) Inference on unseen novel interactions. INTRA demonstrates superior grounding accuracy in (a)-(c) compared to LOCATE [25], showing proper affordance region inference without explicit training. + +![](images/4f8fee92a96460febad49c8ac69422710c337eff1aefd471cf43b32edc1cffce.jpg) + +![](images/2c0d4dcf1d0097afa88e3a54ff337f4a04ab6e18ded2dc7cbbb3d9c7234865d4.jpg) +LOCATE + +![](images/3599100b474b887a6d85e7d4983d38ebbc9396a2862fcd3930f81c45942dc174.jpg) +INTRA (Ours) + +![](images/efeea2d7dc02216fe05e0fc483d751561b9e11f0feaadbd451155e41f7937c2e.jpg) +(c) Qualitative results on novel interaction + +![](images/a0d3af061ce5c842bdef17af318a0c05b64339c91b8e19435449cc21bf968ccc.jpg) + +# 5.2 Feasibility Study on Generalization Property of INTRA + +INTRA excels in affordance grounding on images with large domain gaps, such as pixel art and paintings, as illustrated in Fig. 7(a). Furthermore, our method showcases strong generalization abilities for novel objects like a horse and quill, not present in the training set, as shown in Fig. 7(b). Additionally, despite deliberately not being trained on specific interaction classes like 'Hold' and 'Take photo' for experiment, INTRA successfully infers their affordances, as depicted in Fig. 7(c). More results and detailed experimental settings are in the supplementary. One possible explanation for this generalization property is that our INTRA employs VLM so that diverse domains and novel object can be dealt with without explicitly tuning for them. Another explanation is INTRA's contrastive training that may achieve better representation learning. + +# 6 Conclusion + +In this paper, we introduce INTRA, a novel framework reformulating the weakly supervised affordance grounding with representation learning. We suggest interaction relationship-guided contrastive learning, informed by affordance knowledge from LLM. Furthermore, INTRA actively leverages VLM text embedding in proposed text-conditioned affordance map generation for flexible affordance grounding, further bolstered by text synonym augmentation for robustness. INTRA achieves state-of-the-art performance across diverse datasets, relying solely on exocentric images for training, unlike prior methods that also use egocentric images. Moreover, our method demonstrates generalization feasibility on novel objects, interactions, and images with significant domain gaps. + +# Acknowledgements + +This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)], the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. NRF-2022M3C1A309202211) and AI-Bio Research Grant through Seoul National University. Also, the authors acknowledged the financial support from the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University. + +# References + +1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023) +2. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Fu, C., Gopalakrishnan, K., Hausman, K., Herzog, A., Ho, D., Hsu, J., Ibarz, J., Ichter, B., Irpan, A., Jang, E., Ruano, R.J., Jeffrey, K., Jesmonth, S., Joshi, N., Julian, R., Kalashnikov, D., Kuang, Y., Lee, K.H., Levine, S., Lu, Y., Luu, L., Parada, C., Pastor, P., Quiambao, J., Rao, K., Rettinghouse, J., Reyes, D., Sermanet, P., Sievers, N., Tan, C., Toshev, A., Vanhoucke, V., Xia, F., Xiao, T., Xu, P., Xu, S., Yan, M., Zeng, A.: Do as i can and not as i say: Grounding language in robotic affordances. In: arXiv:2204.01691 (2022) +3. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Gopalakrishnan, K., Hausman, K., Herzog, A., et al.: Do as i can, not as i say: Grounding language in robotic affordances. arXiv:2204.01691 (2022) +4. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv:2112.05814 (2021) +5. Ardón, P., Pairet, É., Lohan, K.S., Ramamoorthy, S., Petrick, R.: Affordances in robotic tasks-a survey. arXiv:2004.07400 (2020) +6. Ardón, P., Pairet, E., Petrick, R.P., Ramamoorthy, S., Lohan, K.S.: Learning grasp affordance reasoning through semantic relations. RA-L pp. 4571-4578 (2019) +7. Bahl, S., Mendonca, R., Chen, L., Jain, U., Pathak, D.: Affordances from human videos as a versatile representation for robotics. In: CVPR. pp. 13778-13790 (2023) +8. Burke, C.J., Tobler, P.N., Baddeley, M., Schultz, W.: Neural mechanisms of observational learning. PNAS pp. 14431-14436 (2010) +9. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021) +0. Chen, J., Gao, D., Lin, K.Q., Shou, M.Z.: Affordance grounding from demonstration video to target image. In: CVPR. pp. 6799-6808 (2023) +1. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020) +2. Chen, X., He, K.: Exploring simple siamese representation learning. In: CVPR. pp. 15750-15758 (2021) +3. Cornia, M., Baraldi, L., Serra, G., Cucchiara, R.: A deep multi-level network for saliency prediction. In: ICPR. pp. 3488-3493 (2016) + +14. Fang, K., Wu, T.L., Yang, D., Savarese, S., Lim, J.J.: Demo2vec: Reasoning object affordances from online videos. In: CVPR. pp. 2139-2147 (2018) +15. Gao, W., Wan, F., Pan, X., Peng, Z., Tian, Q., Han, Z., Zhou, B., Ye, Q.: Ts-cam: Token semantic coupled attention map for weakly supervised object localization. In: ICCV. pp. 2886-2895 (2021) +16. Geng, Y., An, B., Geng, H., Chen, Y., Yang, Y., Dong, H.: Rlafford: End-to-end affordance learning for robotic manipulation. In: ICRA. pp. 5880-5886 (2023) +17. Gibson, J.: The Ecological Approach to Visual Perception. Resources for ecological psychology, Lawrence Erlbaum Associates (1986) +18. Hadjivelichkov, D., Zwane, S., Agapito, L., Deisenroth, M.P., Kanoulas, D.: One-shot transfer of affordance regions? affcorrs! In: CoRL. pp. 550-560 (2023) +19. Hou, Z., Yu, B., Qiao, Y., Peng, X., Tao, D.: Affordance transfer learning for human-object interaction detection. In: CVPR. pp. 495-504 (2021) +20. Huang, Y., Cai, M., Li, Z., Sato, Y.: Predicting gaze in egocentric video by learning task-dependent attention transition. In: ECCV. pp. 754-769 (2018) +21. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS 33, 18661-18673 (2020) +22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv:1412.6980 (2014) +23. Kümmerer, M., Wallis, T.S., Bethge, M.: Deepgaze ii: Reading fixations from deep features trained on object recognition. arXiv:1610.01563 (2016) +24. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask dino: Towards a unified transformer-based framework for object detection and segmentation. In: CVPR. pp. 3041-3050 (2023) +25. Li, G., Jampani, V., Sun, D., Sevilla-Lara, L.: Locate: Localize and transfer object parts for weakly supervised affordance grounding. In: CVPR. pp. 10922-10931 (2023) +26. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv:2301.12597 (2023) +27. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: ICML. pp. 12888-12900 (2022) +28. Li, J., Selvaraju, R., Gotmare, A., Joty, S., Xiong, C., Hoi, S.C.H.: Align before fuse: Vision and language representation learning with momentum distillation. NeurIPS pp. 9694-9705 (2021) +29. Liang, J., Huang, W., Xia, F., Xu, P., Hausman, K., Ichter, B., Florence, P., Zeng, A.: Code as policies: Language model programs for embodied control. In: ICRA. pp. 9493-9500 (2023) +30. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. NeurIPS (2023) +31. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Grounded affordance from exocentric view. arXiv:2208.13196 (2022) +32. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning affordance grounding from exocentric images. In: CVPR. pp. 2252-2261 (2022) +33. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning visual affordance grounding from demonstration videos. IEEE Transactions on Neural Networks and Learning Systems (2023) +34. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research (2008) + +35. MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. vol. 1, pp. 281-297. Oakland, CA, USA (1967) +36. Mai, J., Yang, M., Luo, W.: Erasing integrated learning: A simple yet effective approach for weakly supervised object localization. In: CVPR. pp. 8766-8775 (2020) +37. Mees, O., Borja-Diaz, J., Burgard, W.: Grounding language with visual affordances over unstructured data. In: ICRA. pp. 11576-11582 (2023) +38. Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. ICLR (2013) +39. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM pp. 39-41 (1995) +40. Myers, A., Teo, C.L., Fermüller, C., Aloimonos, Y.: Affordance detection of tool parts from geometric features. In: ICRA. pp. 1374-1381 (2015) +41. Nagarajan, T., Feichtenhofer, C., Grauman, K.: Grounded human-object interaction hotspots from video. In: ICCV. pp. 8688-8697 (2019) +42. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Detecting object affordances with convolutional neural networks. In: IROS. pp. 2765-2770 (2016) +43. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Object-based affordances detection with convolutional neural networks and dense conditional random fields. In: IROS. pp. 5908-5915 (2017) +44. Nguyen, T., Vu, M.N., Vuong, A., Nguyen, D., Vo, T., Le, N., Nguyen, A.: Open-vocabulary affordance detection in 3d point clouds. In: IROS. pp. 5692-5698 (2023) +45. Ning, S., Qiu, L., Liu, Y., He, X.: Hoiclip: Efficient knowledge transfer for hoi detection with vision-language models. In: CVPR. pp. 23507-23517 (2023) +46. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv:2304.07193 (2023) +47. Pan, J., Ferrer, C.C., McGuinness, K., O'Connor, N.E., Torres, J., Sayrol, E., Giro-i Nieto, X.: Salgan: Visual saliency prediction with generative adversarial networks. arXiv:1701.01081 (2017) +48. Pan, X., Gao, Y., Lin, Z., Tang, F., Dong, W., Yuan, H., Huang, F., Xu, C.: Unveiling the potential of structure preserving for weakly supervised object localization. In: CVPR. pp. 11642-11651 (2021) +49. Pennington, J., Socher, R., Manning, C.D.: Glove: Global vectors for word representation. In: EMNLP. pp. 1532-1543 (2014) +50. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021) +51. Rana, K., Haviland, J., Garg, S., Abou-Chakra, J., Reid, I., Suenderhauf, N.: Say-plan: Grounding large language models using 3d scene graphs for scalable task planning. In: CoRL (2023) +52. Rashid, A., Sharma, S., Kim, C.M., Kerr, J., Chen, L.Y., Kanazawa, A., Goldberg, K.: Language embedded radiance fields for zero-shot task-oriented grasping. In: CoRL (2023) +53. Sawatzky, J., Srikantha, A., Gall, J.: Weakly supervised affordance detection. In: CVPR. pp. 2795-2804 (2017) +54. Singh, I., Blukis, V., Mousavian, A., Goyal, A., Xu, D., Tremblay, J., Fox, D., Thomason, J., Garg, A.: Progprompt: Generating situated robot task plans using large language models. In: ICRA. pp. 11523-11530 (2023) +55. Tang, J., Zheng, G., Yu, J., Yang, S.: Cotdet: Affordance knowledge prompting for task driven object detection. In: ICCV. pp. 3068-3078 (2023) + +56. Wan, B., Tuytelaars, T.: Exploiting clip for zero-shot hoi detection requires knowledge distillation at multiple levels. In: WACV. pp. 1805-1815 (2024) +57. Warren, W.: Perceiving affordances: Visual guidance of stair climbing. Journal of experimental psychology. Human perception and performance pp. 683-703 (1984) +58. Xu, R., Chu, F.J., Tang, C., Liu, W., Vela, P.A.: An affordance keypoint detection network for robot manipulation. IEEE RA-L pp. 2870-2877 (2021) +59. Xue, Y., Gan, E., Ni, J., Joshi, S., Mirzasoleiman, B.: Investigating the benefits of projection head for representation learning. In: ICLR (2024) +60. Yu, S., Seo, P.H., Son, J.: Zero-shot referring image segmentation with global-local context features. In: CVPR. pp. 19456-19465 (2023) +61. Zhang, J., Herrmann, C., Hur, J., Cabrera, L.P., Jampani, V., Sun, D., Yang, M.H.: A tale of two features: Stable diffusion complements dino for zero-shot semantic correspondence. arXiv:2305.15347 (2023) +62. Zhang, X., Wang, D., Han, S., Li, W., Zhao, B., Wang, Z., Duan, X., Fang, C., Li, X., He, J.: Affordance-driven next-best-view planning for robotic grasping. In: CoRL (2023) +63. Zhao, X., Li, M., Weber, C., Hafez, M.B., Wermter, S.: Chat with the environment: Interactive multimodal perception using large language models. arXiv:2303.08268 (2023) +64. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: CVPR. pp. 2921-2929 (2016) +65. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv:2304.10592 (2023) \ No newline at end of file diff --git a/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/images.zip b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..98f9b6690f9f2a979d32a30e91918fd7c2e1c14a --- /dev/null +++ b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fca70e12cc8ba9b678f5104f5e4ffe7440ee0a8927fd31482b85431ddfb9086e +size 603972 diff --git a/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/layout.json b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..4a067ffee5b0a95d75230526fe0ab7f1846a135f --- /dev/null +++ b/2024/INTRA_ Interaction Relationship-aware Weakly Supervised Affordance Grounding/layout.json @@ -0,0 +1,9273 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 160, + 111, + 452, + 147 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 111, + 452, + 147 + ], + "spans": [ + { + "bbox": [ + 160, + 111, + 452, + 147 + ], + "type": "text", + "content": "INTRA: Interaction Relationship-aware Weakly Supervised Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "spans": [ + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "type": "text", + "content": "Ji Ha Jang" + }, + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "type": "inline_equation", + "content": "^{1*}" + }, + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "type": "text", + "content": ", Hoigi Seo" + }, + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "type": "inline_equation", + "content": "^{1*}" + }, + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "type": "text", + "content": ", and Se Young Chun" + }, + { + "bbox": [ + 183, + 167, + 429, + 180 + ], + "type": "inline_equation", + "content": "^{1,2\\dagger}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 176, + 189, + 436, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 189, + 436, + 223 + ], + "spans": [ + { + "bbox": [ + 176, + 189, + 436, + 223 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 176, + 189, + 436, + 223 + ], + "type": "text", + "content": "Dept. of Electrical and Computer Engineering, " + }, + { + "bbox": [ + 176, + 189, + 436, + 223 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 176, + 189, + 436, + 223 + ], + "type": "text", + "content": "INMC & IPAI Seoul National University, Republic of Korea {jeeit17, sehoiki3215, sychun}@snu.ac.kr" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 251, + 452, + 503 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 251, + 452, + 503 + ], + "spans": [ + { + "bbox": [ + 160, + 251, + 452, + 503 + ], + "type": "text", + "content": "Abstract. Affordance denotes the potential interactions inherent in objects. The perception of affordance can enable intelligent agents to navigate and interact with new environments efficiently. Weakly supervised affordance grounding teaches agents the concept of affordance without costly pixel-level annotations, but with exocentric images. Although recent advances in weakly supervised affordance grounding yielded promising results, there remain challenges including the requirement for paired exocentric and egocentric image dataset, and the complexity in grounding diverse affordances for a single object. To address them, we propose INTERaction Relationship-aware weakly supervised Affordance grounding (INTRA). Unlike prior arts, INTRA recasts this problem as representation learning to identify unique features of interactions through contrastive learning with exocentric images only, eliminating the need for paired datasets. Moreover, we leverage vision-language model embeddings for performing affordance grounding flexibly with any text, designing text-conditioned affordance map generation to reflect interaction relationship for contrastive learning and enhancing robustness with our text synonym augmentation. Our method outperformed prior arts on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD. Additionally, experimental results demonstrate that our method has remarkable domain scalability for synthesized images / illustrations and is capable of performing affordance grounding for novel interactions and objects. Project page: https://jeeit17.github.io/INTRA" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "spans": [ + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "text", + "content": "Keywords: Affordance grounding " + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "text", + "content": " Weak supervision " + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "text", + "content": " Exocentric image " + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "text", + "content": " Contrastive learning " + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 514, + 453, + 536 + ], + "type": "text", + "content": " Interaction relation" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 574, + 230, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 574, + 230, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 574, + 230, + 586 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "text", + "content": "Affordance [17] refers to the perceived possible interactions based on an object's inherent or recognized properties (e.g., the rim of a wine glass affords sipping while stem of it affords holding). Humans can identify affordances of objects and interact with proper parts despite the diversity in their physical attributes." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 652, + 362, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 362, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 362, + 666 + ], + "type": "text", + "content": "*Authors contributed equally. † Corresponding author." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 144, + 116, + 471, + 237 + ], + "blocks": [ + { + "bbox": [ + 144, + 116, + 471, + 237 + ], + "lines": [ + { + "bbox": [ + 144, + 116, + 471, + 237 + ], + "spans": [ + { + "bbox": [ + 144, + 116, + 471, + 237 + ], + "type": "image", + "image_path": "7020819b9d47883bc814855fff9dacc26e639943e4f4c868997a02d87a17dcce.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 247, + 482, + 293 + ], + "lines": [ + { + "bbox": [ + 132, + 247, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 482, + 293 + ], + "type": "text", + "content": "Fig. 1: Prior works on weakly-supervised affordance grounding like LOCATE [25] often failed to ground different affordances for the same object. However, our proposed INTRA yielded finer and more accurate grounding results for them that are closer to the ground truth (GT) by considering interaction relationship among them." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 317, + 482, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 317, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 317, + 482, + 413 + ], + "type": "text", + "content": "This ability can be acquired through individual learning, by directly interacting with objects, and observational learning [8], by observing others' interactions. The sense of affordance enables effective interaction in new environments or with novel objects, without step-by-step instructions [57]. Affordance plays an essential role across numerous applications involving intelligent agents, enabling them to provide flexible and timely responses in complex, dynamic environments [5]. These applications include task planning, robot grasping, manipulation, scene understanding and action prediction [2,6,7,16,51,62]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 414, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 414, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 414, + 482, + 582 + ], + "type": "text", + "content": "Affordance grounding is the task to teach intelligent systems how to locate possible action regions in objects for a certain interaction. While fully supervised learning [4, 18, 42, 58] is the most straightforward approach, its reliance on costly annotations may limit its applicability across diverse contexts. Another approach is weakly supervised learning, similar to human's observational learning [8], that does not require GT, but weak labels. In this setting, exocentric images illustrating human-object interactions, along with corresponding egocentric images depicting the objects, are provided during training. During inference, intelligent systems perform affordance grounding on the egocentric images, identifying object parts relevant to the given interactions. Recent advances in weakly supervised affordance grounding [25, 31, 32, 41] proposed to use pairs of exocentric and egocentric images, yielding great performance. The deep neural networks learn affordances by pulling features from exocentric and egocentric images closer, aiming to focus on object parts related to interactions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 483, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 483, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 483, + 665 + ], + "type": "text", + "content": "However, weakly supervised affordance grounding remains challenging. Firstly, the requirement for current weak labels with pairs of exocentric and egocentric images is still strong. Note that human observational learning does not usually require egocentric images. Secondly, a complex relationship between interactions exists, which has not been adequately addressed in prior works. Many instances in object-interaction relationships exhibit intricate many-to-many associations, occasionally with one entailing another. For example, some distinct" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": "interactions represent the same affordance regions (e.g., 'wash' and 'brush with' a tooth brush), and there are closely related interactions that always come together (e.g., 'sip' usually includes 'hold'. 'ride' usually includes 'sit on'). This complexity poses challenges in extracting interaction-relevant features based on image-level affordance labels, introducing biases towards objects in affordance grounding as illustrated in Fig. 1 (LOCATE [25] often yielded similar affordance grounding with different interactions for the same object)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 200, + 482, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 482, + 415 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 482, + 415 + ], + "type": "text", + "content": "Here, we propose a novel weakly supervised affordance grounding method, INTRA (INTeraction Relationship-aware weakly supervised Affordance grounding) to address these unexplored challenges. While previous studies [31,41] solved the weak supervision problem as supervised learning by pulling object features of exocentric and egocentric images closer and LOCATE [25] enhanced this approach by generating more localized pseudo labels based on prior information for exocentric images for supervised learning (i.e., containing human, object part, and background), our INTRA framework recasts the weak supervision problem as representation learning. This novel reformulation allows us to use weaker labels (i.e., exocentric images only) for training so that the requirement to use pairs of exocentric / egocentric images is now alleviated. Moreover, unlike prior works, our INTRA method actively exploits large language model (LLM) as well as the text encoder of the vision-language model (VLM) to leverage linguistic information and existing textual knowledge on affordances, which further enhances our interaction relationship-guided contrastive learning. This novel scheme also allows excellent scalability for unseen objects across diverse domains as well as zero-shot inference for novel interactions, which was not possible in prior arts. In summary, our main contributions are three-fold as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 422, + 479, + 554 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 422, + 479, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 422, + 479, + 470 + ], + "spans": [ + { + "bbox": [ + 138, + 422, + 479, + 470 + ], + "type": "text", + "content": "- We propose a novel approach for weakly supervised affordance grounding by recasting the problem as representation learning and by leveraging VLM, leading to relaxing the need for paired training datasets for more weak supervision and enhancing scalability across domains for unseen objects." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 471, + 479, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 471, + 479, + 517 + ], + "spans": [ + { + "bbox": [ + 138, + 471, + 479, + 517 + ], + "type": "text", + "content": "- We proposed INTRA, a novel method that consists of text synonym augmentation and text-conditioned affordance map generation module along with interaction relationship-guided contrastive learning, so that inference on unseen interactions is possible." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 518, + 479, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 518, + 479, + 554 + ], + "spans": [ + { + "bbox": [ + 138, + 518, + 479, + 554 + ], + "type": "text", + "content": "- Our INTRA outperforms the prior arts in weakly supervised affordance grounding on diverse datasets such as AGD20K, IIT-AFF, CAD and UMD, demonstrating both qualitative and quantitative excellence (see Fig. 1)." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 572, + 242, + 585 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 572, + 242, + 585 + ], + "spans": [ + { + "bbox": [ + 132, + 572, + 242, + 585 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 597, + 273, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 597, + 273, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 597, + 273, + 609 + ], + "type": "text", + "content": "2.1 Affordance Grounding" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "content": "Supervised affordance grounding. Supervised affordance grounding methods [10, 14] analyze interaction videos / images to predict affordance regions on an object, trained with pixel-level GT masks / heat maps. Though successful in localizing fine-grained affordance regions through supervised learning, they are" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 228, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 228, + 91, + 448, + 102 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 152 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 152 + ], + "type": "text", + "content": "limited by the costly GT mask annotation process and their limited generalizability to unseen objects. Furthermore, they require paired demonstration videos and target object images, making real-world application challenging." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 169, + 482, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 169, + 482, + 361 + ], + "spans": [ + { + "bbox": [ + 132, + 169, + 482, + 361 + ], + "type": "text", + "content": "Weakly supervised affordance grounding. Weakly supervised affordance grounding methods [13,20,23,25,31-33,41,47] offer the advantage of not requiring GT, but requiring weak labels such as exocentric images with interaction text labels. Prior works [25,31,32,41] mainly align interaction-relevant object features from both egocentric and exocentric images without considering the intrinsic properties of interactions. The framework in [41] predicts object features engaged in interactions by analyzing human-object interaction videos. The works of [31, 32] preserve the correlation of affordance features from exocentric and egocentric images to learn affordances. The work of [25] enhances object feature extraction by adopting DINO-ViT [9] based Class Activation Maps (CAM) [64] and k-means clustering [35] for more explicit guidance. However, focusing solely on object features may introduce biases towards object, hindering the inference of multiple affordances for a single object. Our INTRA addresses this issue by considering the complex relationships between interactions using interaction relationship-guided contrastive loss, while ensuring the network remains attentive to the objects using object-variance mitigation loss." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 377, + 391, + 390 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 377, + 391, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 377, + 391, + 390 + ], + "type": "text", + "content": "2.2 Foundation Models for Affordance Grounding" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 396, + 485, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 485, + 529 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 485, + 529 + ], + "type": "text", + "content": "Self-supervised transformer. Self-supervised transformers, extensively trained on large-scale datasets and scalability, possess robust representation power. Previous works [25,52] have explored their potential in affordance grounding. DINO-ViT [9], a vision transformer foundation model trained in a self-supervised manner, can identify both high-semantics such as overall information of the image and low-semantics such as details regarding specific object parts. This versatility has led advancements in various tasks, including classification, semantic segmentation [4, 24] and semantic correspondence [61]. LOCATE [25] leverages DINO-ViT to extract low-semantic information, resulting in performance improvements in affordance grounding. Our INTRA employed DINOv2 [46] as an image encoder to extract information about objects and their constituent parts." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 482, + 666 + ], + "type": "text", + "content": "Vision-language model. The Vision-Language Model (VLM) is a class of models jointly pretrained on visual and language data for various downstream tasks [45, 56, 60]. VLM text encoders, trained through contrastive learning with image-text pairs, capture representations in the joint space of the images and text [26-28, 50]. These text encoders, incorporating visual information, have demonstrated excellent performance across multiple tasks. ALBEF [28] notably enhances vision and language representation learning by aligning image and text features before fusing them. While supervised affordance grounding methods leveraging VLM text encoders [44] have been explored, their application in weakly supervised affordance grounding remains underexplored. We propose a" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 114, + 482, + 240 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 240 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 240 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 240 + ], + "type": "image", + "image_path": "c7dda98a940578a5a159642fae60980216b791e327e9f2a8f5a1c8421e41c57e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 251, + 480, + 328 + ], + "lines": [ + { + "bbox": [ + 130, + 251, + 480, + 328 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 480, + 328 + ], + "type": "text", + "content": "Fig. 2: Overall frameworks of (a) LOCATE [25] and (b) INTRA (Ours). LOCATE takes paired exocentric and egocentric images to generate interaction-aware affordance maps (CAMs) for predefined interactions and then selects an interaction-related CAM by the given interaction label. In contrast, INTRA takes only exocentric images and interaction labels to yield an affordance map through our affordance map generation module. Training is done via interaction relationship-guided contrastive learning on exocentric features from affordance maps. Note that all encoder parameters are frozen." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 352, + 479, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 352, + 479, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 352, + 479, + 376 + ], + "type": "text", + "content": "framework leveraging the text encoder of ALBEF to enable novel interactions, diverging from prior arts limited to inferring predetermined sets of affordances." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 394, + 482, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 394, + 482, + 538 + ], + "spans": [ + { + "bbox": [ + 130, + 394, + 482, + 538 + ], + "type": "text", + "content": "Large language model. Understanding affordance relationships is crucial for affordance grounding, as it enables extending and linking learned visual cues, and reasoning about affordances for new objects, interactions, or situations. While prior works like [19] leverage semantically similar object properties and [32] utilize affordance feature correlation, none directly exploit these relationships. We use these intricate relationships in affordance learning by adopting Large Language Models (LLMs). LLMs have gained prominence in robotics due to their profound natural language understanding, providing valuable priors about interactions and their complex relationships. Previous works [3,29,54,63] focus on extracting action knowledge, deriving task-specific plans, and grounding them in the physical world. LLMs have also been widely used in previous affordance studies [37,55], demonstrating their exceptional understanding of interactions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 556, + 201, + 569 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 556, + 201, + 569 + ], + "spans": [ + { + "bbox": [ + 132, + 556, + 201, + 569 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Prior arts in weakly supervised affordance grounding [25, 31, 32, 41] typically align object features of paired exocentric (interaction with object) and egocentric (object only) images to learn interaction-related features. For example, as illustrated in Fig. 2(a), LOCATE [25] generates CAMs (affordance maps) from exocentric and egocentric images for a pre-determined interaction label, extracts egocentric feature as well as exocentric object parts feature selected by PartS-select module (pseudo label), and then trains the model by optimizing cosine" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "similarity to align (pull) egocentric and exocentric object parts features. In contrast, we propose an alternative approach, INTRA, whose overall framework is illustrated in Fig. 2(b). Our text-conditioned affordance grounding framework of INTRA leverages VLM text encoder in affordance map generation module and employs text synonym augmentation to enhance robustness, as will be described in Sec. 3.1. Then, INTRA learn affordance grounding via our interaction relationship-guided contrastive learning, detailed in Sec. 3.2. The framework of INTRA as depicted in Fig. 2(b) clearly suggests two advantages over prior arts including LOCATE [25]: 1) it exploits exocentric images only and 2) INTRA admits novel interactions outside the pre-defined interaction set." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 252, + 422, + 264 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 252, + 422, + 264 + ], + "spans": [ + { + "bbox": [ + 131, + 252, + 422, + 264 + ], + "type": "text", + "content": "3.1 Text-conditioned Affordance Grounding Framework" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "spans": [ + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "text", + "content": "To utilize the semantic meanings inherent in interaction labels and enable flexible inference on novel verbs, our text-conditioned affordance grounding framework generates affordance maps by conditioning image features with text features via our affordance map generation module where text and image features extracted from separately pre-trained text and image encoders are fused. In specific, as depicted in Fig. 2(b), deep features " + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{exo} \\in \\mathbb{R}^{(h \\times w) \\times d}" + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "text", + "content": " are obtained from the input exocentric images using DINOv2 [46], where " + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "text", + "content": " represent the height and width of the affordance map, and " + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "text", + "content": " refers to the dimension of the feature. The text feature " + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{text}" + }, + { + "bbox": [ + 130, + 272, + 482, + 404 + ], + "type": "text", + "content": " of the given interaction is obtained using the ALBEF text encoder [28]. See the supplementary material for further details on the rationale for employing DINOv2 and the ablation study on the text encoder." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "spans": [ + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "text", + "content": "Affordance map generation module. Before fusing text and image features, the class token of " + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{text}" + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "text", + "content": " passes through a single linear layer to align the separately pre-trained image and text embedding spaces and connect them, as shown to be effective in previous works [30,65]. Subsequently, image features " + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{exo}" + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "text", + "content": " and the class token of text features are concatenated and processed through a transformer encoder for conditioning. The image feature part of the resulting vector is then projected using a multi-layered convolutional network and normalized using min-max normalization to obtain the affordance map " + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_{aff} \\in \\mathbb{R}^{h \\times w}" + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "text", + "content": ". This affordance map represents the image regions in exocentric images most relevant to interactions. During inference, " + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_{aff}" + }, + { + "bbox": [ + 130, + 421, + 482, + 554 + ], + "type": "text", + "content": " functions directly as an output heatmap, indicating the image regions in egocentric images most relevant to interactions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "Text synonym augmentation. To enhance the robustness of text conditioning, we integrate text synonym augmentation into our interaction embeddings. Initially, we generate " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "k_{s}" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " synonyms for each interaction label using LLM. Subsequently, any synonyms overlapping with other interaction labels are removed. These synonyms are then randomly selected to substitute the text conditioning interaction embedding, while the original interaction label is retained for interaction relationship-guided contrastive learning. This module enhances overall performance by providing models with enriched interpretations of interactions." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 430, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 430, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 430, + 129 + ], + "type": "text", + "content": "3.2 Interaction Relationship-guided Contrastive Learning" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 482, + 209 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 482, + 209 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 482, + 209 + ], + "type": "text", + "content": "Our INTRA learns via interaction relationship-guided contrastive learning by comparing exocentric image features across diverse interactions. Our contrastive learning consists of two key components, 1) extracting exocentric image features with affordance map and 2) designing loss for interaction relationship-guided contrastive learning, that enable the grounding of multiple affordances on a single object." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 224, + 482, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 224, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 131, + 224, + 482, + 274 + ], + "type": "text", + "content": "Exocentric image feature extraction with affordance map. As described in Sec 3.1, a text-conditioned affordance map, " + }, + { + "bbox": [ + 131, + 224, + 482, + 274 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_{aff}" + }, + { + "bbox": [ + 131, + 224, + 482, + 274 + ], + "type": "text", + "content": ", is generated to represent interaction-relevant image regions of exocentric images. Then, the exocentric image features " + }, + { + "bbox": [ + 131, + 224, + 482, + 274 + ], + "type": "inline_equation", + "content": "f_{exo}" + }, + { + "bbox": [ + 131, + 224, + 482, + 274 + ], + "type": "text", + "content": " corresponding to the affordance map are extracted as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 194, + 284, + 480, + 298 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 194, + 284, + 480, + 298 + ], + "spans": [ + { + "bbox": [ + 194, + 284, + 480, + 298 + ], + "type": "interline_equation", + "content": "f _ {e x o} = (1 / h w) \\Sigma_ {i = 1} ^ {h} \\Sigma_ {j = 1} ^ {w} \\mathcal {F} _ {e x o} (i, j) \\cdot \\mathcal {M} _ {a f f} (i, j) \\in \\mathbb {R} ^ {d}. \\tag {1}", + "image_path": "9071b0e964c7a9b93847a04d03177328896a8e21f9265334c63d21eef23ba247.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 301, + 482, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 301, + 482, + 350 + ], + "spans": [ + { + "bbox": [ + 131, + 301, + 482, + 350 + ], + "type": "text", + "content": "The resulting " + }, + { + "bbox": [ + 131, + 301, + 482, + 350 + ], + "type": "inline_equation", + "content": "f_{exo}" + }, + { + "bbox": [ + 131, + 301, + 482, + 350 + ], + "type": "text", + "content": " is then projected and normalized to obtain the exocentric image feature " + }, + { + "bbox": [ + 131, + 301, + 482, + 350 + ], + "type": "inline_equation", + "content": "z_{exo}" + }, + { + "bbox": [ + 131, + 301, + 482, + 350 + ], + "type": "text", + "content": " using an MLP layer, which will be used for training. This projection layer was also used in previous works [11, 12, 59], which have demonstrated the necessity and efficiency of it." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 366, + 482, + 488 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 366, + 482, + 488 + ], + "spans": [ + { + "bbox": [ + 131, + 366, + 482, + 488 + ], + "type": "text", + "content": "Loss design for interaction relationship-guided contrastive learning. Supervised contrastive learning [21] effectively derives good representations for each class by focusing on common characteristics in positive pairs while disregarding those in negative pairs like other classes. However, in affordance grounding tasks, treating all other interaction classes as negative pairs may be inadequate due to the complex relationship among interactions. To mitigate this issue, we propose interaction relationship-guided contrastive loss, " + }, + { + "bbox": [ + 131, + 366, + 482, + 488 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{inter}" + }, + { + "bbox": [ + 131, + 366, + 482, + 488 + ], + "type": "text", + "content": ". Furthermore, considering the subtle meaning variations within single interaction classes depending on the object and context, we also propose object-variance mitigation loss, " + }, + { + "bbox": [ + 131, + 366, + 482, + 488 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{obj}" + }, + { + "bbox": [ + 131, + 366, + 482, + 488 + ], + "type": "text", + "content": ". Thus, the total loss for our INTRA is formulated as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 251, + 496, + 480, + 509 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 251, + 496, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 251, + 496, + 480, + 509 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {t o t a l}} = \\mathcal {L} _ {\\text {i n t e r}} + \\lambda_ {\\text {o b j}} \\mathcal {L} _ {\\text {o b j}} \\tag {2}", + "image_path": "58fc028dd4c8c89ff74485b7dabe4946afd527d0fc5ead77815f22124e816598.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 516, + 351, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 516, + 351, + 529 + ], + "spans": [ + { + "bbox": [ + 132, + 516, + 351, + 529 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 516, + 351, + 529 + ], + "type": "inline_equation", + "content": "\\lambda_{obj}" + }, + { + "bbox": [ + 132, + 516, + 351, + 529 + ], + "type": "text", + "content": " denotes the control parameter of " + }, + { + "bbox": [ + 132, + 516, + 351, + 529 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{obj}" + }, + { + "bbox": [ + 132, + 516, + 351, + 529 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 546, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 546, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 546, + 482, + 666 + ], + "type": "text", + "content": "Interaction relationship-guided contrastive loss. In affordance grounding, treating all other interaction classes as negative pairs is inadequate due to the intricate relationships between interactions. For example, 'Wash' and 'Brush with' toothbrush or 'Pour' and 'Seal' bottle represent distinct interactions but act on the same object parts. Manually finding these relationships is time-consuming and impractical as the number of pairs grows quadratically with the number of interaction (see the supplementary). Moreover, although linguistic relationships like synonyms or co-occurrence were considered as substitutes, they are often inadequate and degrade performance. For example, 'Sip' entails 'Hold', but they act on different part of objects, and 'Wash' and 'Cut with' a knife have different" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 228, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 228, + 91, + 448, + 103 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 482, + 229 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 482, + 229 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 482, + 229 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 482, + 229 + ], + "type": "image", + "image_path": "22f128a0339f15560399fc51d418c53c5104f1412ee116348f91632746573786.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 236, + 482, + 271 + ], + "lines": [ + { + "bbox": [ + 131, + 236, + 482, + 271 + ], + "spans": [ + { + "bbox": [ + 131, + 236, + 482, + 271 + ], + "type": "text", + "content": "Fig. 3: The overall scheme of interaction-relationship map " + }, + { + "bbox": [ + 131, + 236, + 482, + 271 + ], + "type": "inline_equation", + "content": "(\\mathcal{R})" + }, + { + "bbox": [ + 131, + 236, + 482, + 271 + ], + "type": "text", + "content": " generation. LLM classifies all pairs of interactions in the dataset as positive or negative through chain of thoughts. This process is based on reasoning if interactions occur on same object parts." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 300, + 482, + 431 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 482, + 431 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 482, + 431 + ], + "type": "text", + "content": "meanings, but they act on the same blade. To mitigate this, we leverage LLM to determine if interaction pairs act on the same object part. Through Chain of Thoughts (CoT), interaction pairs are categorized as positive or negative in three steps as described in Fig. 3. In Step 1, LLM deduces five different objects where both interactions could be performed. In Step 2, LLM identifies object parts where these interactions could occur by considering five objects one by one, not simultaneously. In Step 3, if the identified parts of the interaction pair are the same, the pair is classified as positive; otherwise, negative. Positive pairs are assigned 1 in the interaction-relationship map " + }, + { + "bbox": [ + 130, + 300, + 482, + 431 + ], + "type": "inline_equation", + "content": "\\mathcal{R}" + }, + { + "bbox": [ + 130, + 300, + 482, + 431 + ], + "type": "text", + "content": ", and negative pairs are assigned 0. We propose interaction-relationship guided contrastive loss by integrating " + }, + { + "bbox": [ + 130, + 300, + 482, + 431 + ], + "type": "inline_equation", + "content": "\\mathcal{R}" + }, + { + "bbox": [ + 130, + 300, + 482, + 431 + ], + "type": "text", + "content": " into supervised contrastive learning as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 170, + 447, + 481, + 487 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 170, + 447, + 481, + 487 + ], + "spans": [ + { + "bbox": [ + 170, + 447, + 481, + 487 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {i n t e r} = \\sum_ {i = 1} ^ {2 N} \\frac {- 1}{2 N y _ {i} - 1} \\sum_ {j = 1} ^ {2 N} \\mathcal {R} _ {\\left(y _ {i}, y _ {j}\\right)} \\cdot \\log \\frac {\\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {j} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 N} \\mathbf {1} _ {i \\neq k} \\cdot \\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {k} / \\tau\\right)} \\tag {3}", + "image_path": "2d30add23f6edb857b163cdb5c29e578f6d52d3274f86cfade85d82a375bd411.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "i, j" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " are sample indices, " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "y_{i}, y_{j}" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " are class labels, " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "N_{y_i}" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " is the number of samples in the batch labeled with " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "y_{i}" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " is the total number of distinct samples in the batch, " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "z_{exo}^{j}" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " is the exocentric image feature vector of each sample, " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " is the temperature, and " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_{(y_i,y_j)}" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " is the value of " + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "inline_equation", + "content": "(y_{i},y_{j})" + }, + { + "bbox": [ + 130, + 501, + 482, + 562 + ], + "type": "text", + "content": " pair in interaction-relationship map." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": "Object-variance mitigation loss. In the context of affordance, the interpretation of the same interaction can vary significantly based on the object and context. For instance, 'Hold' a baseball bat and a cup may seem similar since both involve grasping an object. However, the former involves gripping the bat's slender part, while the latter entails holding the cup's rounded, protruding part. To address this variance within the same interaction category, we implemented" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 353, + 130 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 353, + 130 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 353, + 130 + ], + "type": "text", + "content": "an object-variance mitigation loss " + }, + { + "bbox": [ + 132, + 116, + 353, + 130 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{obj}" + }, + { + "bbox": [ + 132, + 116, + 353, + 130 + ], + "type": "text", + "content": " as follows:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 192, + 137, + 481, + 174 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 137, + 481, + 174 + ], + "spans": [ + { + "bbox": [ + 192, + 137, + 481, + 174 + ], + "type": "interline_equation", + "content": "\\sum_ {i = 1} ^ {2 N} \\frac {- 1}{2 N o _ {i} - 1} \\sum_ {j = 1} ^ {2 N} \\mathbf {1} _ {o _ {i} = o _ {j}} \\cdot \\log \\frac {\\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {j} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 N} \\mathbf {1} _ {i \\neq k} \\cdot \\exp \\left(z _ {e x o} ^ {i} \\cdot z _ {e x o} ^ {k} / \\tau\\right)} \\tag {4}", + "image_path": "5ac8a155863fff73bf42fcd9a72f85e11bb83334691264d8a8183faf1ee99747.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "spans": [ + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "inline_equation", + "content": "o_i" + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "inline_equation", + "content": "o_j" + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "text", + "content": " denote object class of " + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 132, + 180, + 322, + 192 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 209, + 230, + 222 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 209, + 230, + 222 + ], + "spans": [ + { + "bbox": [ + 132, + 209, + 230, + 222 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 232, + 269, + 245 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 232, + 269, + 245 + ], + "spans": [ + { + "bbox": [ + 132, + 232, + 269, + 245 + ], + "type": "text", + "content": "4.1 Experimental Setting" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 251, + 482, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 482, + 407 + ], + "type": "text", + "content": "Dataset and metrics. We conducted an evaluation of our method using the Affordance Grounding Dataset (AGD20K) [32]. AGD20K comprises both exocentric and egocentric images, with 20,061 exocentric images and 3,755 egocentric images labeled with 36 affordances. The dataset support evaluation under two settings: 1) the 'Seen' setting, where the object categories of the training and testing sets are identical, and 2) the 'Unseen' setting, where no objects overlap between the training and test sets. Our approach only used exocentric images in training for all experiments, while other approaches were trained using both egocentric and exocentric images. We employed three evaluation metrics commonly employed in previous affordance grounding methodologies: 1) Kullback-Leibler Divergence (KLD), 2) Similarity (SIM), 3) and Normalized Scanpath Saliency (NSS). These metrics were utilized to quantify the similarity between the distributions of ground truth heatmaps and predicted affordance grounding." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "text", + "content": "Implementation details. We employed DINOv2 as the image encoder and ALBEF, fine-tuned with RefCOCO+, as the text encoder. ChatGPT-4 [1] served as the LLM. Images were resized to " + }, + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "inline_equation", + "content": "384 \\times 384" + }, + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "text", + "content": ", then cropped to " + }, + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "inline_equation", + "content": "336 \\times 336" + }, + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "text", + "content": ". Training utilized the Adam optimizer [22] with a learning rate of 2e-4 and a batch size of 256. The hyperparameter " + }, + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "inline_equation", + "content": "\\lambda_{obj}" + }, + { + "bbox": [ + 132, + 422, + 482, + 495 + ], + "type": "text", + "content": " was set to 4, and all experiments were conducted on a single NVIDIA A100 GPU. More details are provided in the supplementary." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 511, + 365, + 523 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 511, + 365, + 523 + ], + "spans": [ + { + "bbox": [ + 132, + 511, + 365, + 523 + ], + "type": "text", + "content": "4.2 Comparison to State-of-the-art Methods" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 529, + 482, + 590 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 529, + 482, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 529, + 482, + 590 + ], + "type": "text", + "content": "To comprehensively assess our method, we conduct quantitative and qualitative comparisons with state-of-the-art weakly-supervised grounding methods, incorporating a user study. We further expand our experiments to include additional datasets [40, 43, 53] for a comprehensive evaluation. Refer to the supplementary materials for more details on the experimental settings." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 605, + 482, + 666 + ], + "type": "text", + "content": "Quantitative results. We evaluated previous works [15, 25, 31, 32, 36, 41, 48] and our method based on the metrics mentioned above. Tab. 1 shows the quantitative comparison results of our method with prior arts. In both 'Seen' and 'Unseen' setting, our approach surpasses the baseline performances across all three metrics: KLD, SIM, and NSS, thereby setting a new state-of-the-art." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 228, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 228, + 91, + 448, + 103 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 178, + 481, + 274 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Quantitative results of ours and other baselines [15,25,31,32,36,41,48] on the AGD20K dataset. " + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "inline_equation", + "content": "\\uparrow / \\downarrow" + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": " indicates that higher / lower the metric is, the better the model performs. INTRA outperformed all baselines, despite being trained only with exocentric images, whereas other models incorporated both exocentric and egocentric images during training." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 178, + 481, + 274 + ], + "lines": [ + { + "bbox": [ + 132, + 178, + 481, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 178, + 481, + 274 + ], + "type": "table", + "html": "
Prior worksSeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Weakly Supervised Object LocalizationEIL [36]1.9310.2850.5222.1670.2270.330
SPA [48]5.5280.2210.3577.4250.1670.262
TS-CAM [15]1.8420.2600.3362.1040.2010.151
Weakly Supervised Affordance GroundingHotspots [41]1.7730.2780.6151.9940.2370.557
Cross-view-AG [32]1.5380.3340.9271.7870.2850.829
Cross-view-AG+ [31]1.4890.3420.9811.7650.2790.882
LOCATE [25]1.2260.4011.1771.4050.3721.157
ExoINTRA (Ours)1.1990.4071.2391.3650.3751.209
", + "image_path": "031e356e5786dfd7d4b9c43d33fdefd8ad3c6d26d244c95c1c326e688649251b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 361, + 479, + 423 + ], + "blocks": [ + { + "bbox": [ + 130, + 285, + 482, + 352 + ], + "lines": [ + { + "bbox": [ + 130, + 285, + 482, + 352 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 482, + 352 + ], + "type": "text", + "content": "Table 2: Quantitative results on the modified IIT-AFF, CAD, and UMD dataset for our method and other baselines [25,31,32]. Models were trained in the 'Seen' setting of AGD20K and tested on the datasets without additional training. INTRA outperformed all baselines on all metrics across all datasets. * Objects with affordances that prior works are unable to predict were eliminated from the datasets for fairness, wheares our method can infer affordances on novel interactions." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 361, + 479, + 423 + ], + "lines": [ + { + "bbox": [ + 135, + 361, + 479, + 423 + ], + "spans": [ + { + "bbox": [ + 135, + 361, + 479, + 423 + ], + "type": "table", + "html": "
IIT-AFF* [43]CAD* [53]UMD* [40]
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
Cross-View-AG [32]3.8560.0960.8492.5680.1730.5894.7210.0141.287
Cross-View-AG+ [31]3.9200.0951.0722.5290.1760.6634.7530.0131.227
LOCATE [25]3.3150.1151.7092.5280.1870.5584.0830.0262.699
INTRA(Ours)2.6630.1482.5112.0950.2431.2593.0810.0624.195
", + "image_path": "629c3a15f95f2ba2f0b040fd6c914daec28572d1e4e24ca58d7e4f4d1cca06d7.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 447, + 482, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 447, + 482, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 447, + 482, + 556 + ], + "type": "text", + "content": "Results on additional datasets. We evaluated the generalization and robustness of the INTRA framework, along with previous works [25, 31, 32] trained in the 'Seen' setting of AGD20K, on the IIT-AFF [43], CAD [53], and UMD [40] datasets. The experiment was conducted in the 'Seen' setting due to overlapping objects between these datasets and AGD20K. Each GT was processed in the same way as when evaluating the AGD20K test set. Despite significant domain gaps across datasets, INTRA outperformed in all metrics on all datasets, demonstrating its superior generalizability as shown in Tab. 2. Further details of the experiment can be found in the supplementary material." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 574, + 482, + 624 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 574, + 482, + 624 + ], + "spans": [ + { + "bbox": [ + 130, + 574, + 482, + 624 + ], + "type": "text", + "content": "Qualitative results. Fig. 4 and Fig. 5 show our superior grounding precision compared to the baselines, being closer to the GT and finer in granularity. INTRA precisely identifies the exact object part for a given affordance, unlike the baselines, which ground the same parts regardless of the affordances provided." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "User study. Affordance grounding can be ambiguous depending on context and interpretation, thus relying solely on metrics for evaluation has limita-" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 145, + 149, + 470, + 315 + ], + "blocks": [ + { + "bbox": [ + 145, + 149, + 470, + 315 + ], + "lines": [ + { + "bbox": [ + 145, + 149, + 470, + 315 + ], + "spans": [ + { + "bbox": [ + 145, + 149, + 470, + 315 + ], + "type": "image", + "image_path": "5660ef248a7789bc692b3e2c07f9f0242a234ceeb81c0e3d225979f9a95cae86.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 406, + 480, + 571 + ], + "blocks": [ + { + "bbox": [ + 130, + 327, + 482, + 405 + ], + "lines": [ + { + "bbox": [ + 130, + 327, + 482, + 405 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 482, + 405 + ], + "type": "text", + "content": "Fig. 4: Qualitative results of INTRA (Ours) and baseline models [25,31,32] on grounding affordances of multiple potential interactions on a single object. INTRA precisely localizes relevant interaction spots for each interaction. For example, with a knife, it grounds the handle for 'Hold' and the blade for 'Cut with'. For a motorcycle, it accurately grounds the saddle for 'Sit on'. Additionally, for 'Ride', it grounds both the handle and saddle, slightly deviating from the GT but still producing reasonable results, as we usually interacts with handle and saddle to 'Ride' a motorcycle." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 133, + 406, + 480, + 571 + ], + "lines": [ + { + "bbox": [ + 133, + 406, + 480, + 571 + ], + "spans": [ + { + "bbox": [ + 133, + 406, + 480, + 571 + ], + "type": "image", + "image_path": "e5117f8a6906506a643262e7c95b6ff5299f42cc7a6fb724033dea422488351e.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 578, + 482, + 634 + ], + "lines": [ + { + "bbox": [ + 130, + 578, + 482, + 634 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 482, + 634 + ], + "type": "text", + "content": "Fig. 5: Qualitative results comparison between our approach and other baselines [25, 31,32]. Our approach, INTRA, demonstrates superior precision and detail in grounding affordances compared to the baselines. For instance, in the example of 'Drag', while baselines either fail to localize the handle or erroneously ground several other parts, INTRA accurately identifies and grounds the handle of a suitcase with finesse." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 165, + 146, + 449, + 205 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "text", + "content": "Table 3: The result of user study on validity, finesse, and separability. Users were asked to score a 5-point scale, and we averaged it for mean opinion score (MOS)." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 165, + 146, + 449, + 205 + ], + "lines": [ + { + "bbox": [ + 165, + 146, + 449, + 205 + ], + "spans": [ + { + "bbox": [ + 165, + 146, + 449, + 205 + ], + "type": "table", + "html": "
ValidityFinesseSeparability
Cross-View-AG+ [31]2.8973.0222.732
LOCATE [25]3.0542.5732.651
INTRA (Ours)3.1343.1123.221
Ground Truth2.9053.3343.160
", + "image_path": "582ce9ac3f92e787ef411d91925c98a1017feeef296ee1858f7335a32061cd4b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 132, + 268, + 304, + 316 + ], + "blocks": [ + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "lines": [ + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "type": "text", + "content": "Table 4: Quantitative results of ablation Table 5: Quantitative results of ablation study on our loss design. We incrementally mention study on different " + }, + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "type": "inline_equation", + "content": "\\mathcal{R}" + }, + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{WordNet}" + }, + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "type": "text", + "content": ", added each component of the losses to ex- " + }, + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{Word2Vec}" + }, + { + "bbox": [ + 132, + 214, + 477, + 258 + ], + "type": "text", + "content": " are calculated using word similarity from WordNet [39], Word2Vec [38]," + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 268, + 304, + 316 + ], + "lines": [ + { + "bbox": [ + 132, + 268, + 304, + 316 + ], + "spans": [ + { + "bbox": [ + 132, + 268, + 304, + 316 + ], + "type": "table", + "html": "
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
baseline1.6780.3380.8911.5810.3001.100
Linter1.4390.3341.0311.5690.2921.133
Lobj1.3360.3871.2181.5210.3341.042
Linter+Lobj1.1990.4071.2391.3650.3751.209
", + "image_path": "b951eddabfb114a66903a4321090a9413115d6adc32c8027ad02c78abf3d0a91.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 306, + 291, + 477, + 337 + ], + "blocks": [ + { + "bbox": [ + 306, + 259, + 477, + 281 + ], + "lines": [ + { + "bbox": [ + 306, + 259, + 477, + 281 + ], + "spans": [ + { + "bbox": [ + 306, + 259, + 477, + 281 + ], + "type": "text", + "content": "respectively. " + }, + { + "bbox": [ + 306, + 259, + 477, + 281 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{Co - occur}" + }, + { + "bbox": [ + 306, + 259, + 477, + 281 + ], + "type": "text", + "content": " used cooccurrence probability in GloVe [49]." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 306, + 291, + 477, + 337 + ], + "lines": [ + { + "bbox": [ + 306, + 291, + 477, + 337 + ], + "spans": [ + { + "bbox": [ + 306, + 291, + 477, + 337 + ], + "type": "table", + "html": "
SeenUnseen
mKLD↓mSIM↑mNSS↑mKLD↓mSIM↑mNSS↑
LWordNet1.7010.2820.7101.6980.2770.937
LCo-occur.1.5190.3090.9881.6390.2741.101
LWord2Vec1.5470.3020.9581.6790.2700.980
Linter(Ours)1.4390.3341.0311.5690.2921.133
", + "image_path": "4a9917b2701d9369c7b11b12b15b10e4c39071a44841954a43f6e5be944dd6fa.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 358, + 482, + 443 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 443 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 443 + ], + "type": "text", + "content": "tions. Hence, we conducted a user study comparing Cross-View-AG+ [31], LOCATE [25], GT, and INTRA (Ours) across three categories: 1) Validity: assessing heatmap reasonableness, 2) Finesse: measuring heatmap detail, 3) Separability: determining the accuracy of the heatmap when different affordances are assigned to the same object. A total of 936 responses were collected for randomly selected samples from 104 respondents. Results presented in Tab. 3 demonstrate that our approach outperforms baselines and par on GT based on human perception." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 459, + 246, + 469 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 459, + 246, + 469 + ], + "spans": [ + { + "bbox": [ + 132, + 459, + 246, + 469 + ], + "type": "text", + "content": "4.3 Ablation Studies" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 477, + 481, + 514 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 477, + 481, + 514 + ], + "spans": [ + { + "bbox": [ + 130, + 477, + 481, + 514 + ], + "type": "text", + "content": "We validate our pipeline design choices and parameters with ablation studies. This section includes ablation studies on loss design, adoption of LLM, and text synonym augmentation. Refer to the supplementary for further ablation studies." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 529, + 482, + 613 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 529, + 482, + 613 + ], + "spans": [ + { + "bbox": [ + 130, + 529, + 482, + 613 + ], + "type": "text", + "content": "Ablation study on loss design. To assess the individual impact of the components comprising loss on its overall performance, we analyzed by incrementally adding components. We started with the most basic element: a normal supervised contrastive loss. Subsequently, we sequentially added an interaction relationship-guided loss and an object-variance mitigation loss. The performance outcomes of these incremental modifications were thoroughly evaluated to understand their contributions, as represented in the Tab. 4." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Ablation study on adoption of LLM. Adopting LLM to create the relationship map was essential given the intricate nature of affordances. We experimented with various methods to create the relationship map to validate this" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 267, + 175 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 267, + 175 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 267, + 175 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 267, + 175 + ], + "type": "image", + "image_path": "cd03b425f1121cc4d387f2bb7e3ea6d9e874dbbb64a0badf91808b19e843bb8d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 159, + 175, + 250, + 185 + ], + "lines": [ + { + "bbox": [ + 159, + 175, + 250, + 185 + ], + "spans": [ + { + "bbox": [ + 159, + 175, + 250, + 185 + ], + "type": "text", + "content": "(a) Overall training scheme" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 194, + 482, + 250 + ], + "lines": [ + { + "bbox": [ + 130, + 194, + 482, + 250 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 482, + 250 + ], + "type": "text", + "content": "Fig. 6: An illustration of interaction relationship-guided contrastive learning and t-SNE [34] visualization of feature distribution. (a) In interaction relationship-guided contrastive learning, positive interaction pairs attract each other, while others repel. (b) t-SNE visualization of DINOv2 [46] class token and " + }, + { + "bbox": [ + 130, + 194, + 482, + 250 + ], + "type": "inline_equation", + "content": "f_{exo}" + }, + { + "bbox": [ + 130, + 194, + 482, + 250 + ], + "type": "text", + "content": " from INTRA, showing that features of positive interaction pairs become closer as learning progresses." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 282, + 116, + 475, + 174 + ], + "blocks": [ + { + "bbox": [ + 282, + 116, + 475, + 174 + ], + "lines": [ + { + "bbox": [ + 282, + 116, + 475, + 174 + ], + "spans": [ + { + "bbox": [ + 282, + 116, + 475, + 174 + ], + "type": "image", + "image_path": "2f28eef7242e00b72dddbec94a7baea632df2c5bb7d5a4fd14cd866560aa4e7f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 291, + 175, + 465, + 186 + ], + "lines": [ + { + "bbox": [ + 291, + 175, + 465, + 186 + ], + "spans": [ + { + "bbox": [ + 291, + 175, + 465, + 186 + ], + "type": "text", + "content": "(b) Feature t-SNE before (left) / after (right) training" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 270, + 482, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 319 + ], + "type": "text", + "content": "choice. We measured the similarity of interaction pairs using WordNet [39] and Word2Vec [38], or computed co-occurrence probability of interaction pairs with Glove [49]. Based on these measurements, we created an Interaction-relationship Map and trained the INTRA framework. The results are in the Tab. 5." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "text", + "content": "Ablation study on text synonym augmentation. We conducted an ablation study on the effectiveness of text synonym augmentation on overall performance. We compared performance with and without the module. The module improved performance by up to " + }, + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "inline_equation", + "content": "21.93\\%" + }, + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "text", + "content": ", particularly in the 'Unseen' setting, enriching models with varied meanings of interactions. Additionally, to test its effectiveness on novel verb inference, we deliberately omitted the subset 'Hold' " + }, + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "inline_equation", + "content": "(24.17\\%" + }, + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "text", + "content": " of training data) and then performed inference on 'Hold'. The module boosted performance for novel verbs by up to " + }, + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "inline_equation", + "content": "58.06\\%" + }, + { + "bbox": [ + 130, + 334, + 482, + 441 + ], + "type": "text", + "content": ". Similar tendencies were observed for other verbs. Detailed results are available in the supplementary." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 457, + 217, + 470 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 217, + 470 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 217, + 470 + ], + "type": "text", + "content": "5 Discussion" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 480, + 453, + 493 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 480, + 453, + 493 + ], + "spans": [ + { + "bbox": [ + 130, + 480, + 453, + 493 + ], + "type": "text", + "content": "5.1 Effect of Interaction Relationship-guided Contrastive Loss" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "Our rationale for learning affordance grounding solely with exocentric images relies on the consistent presence of humans within these images. By repelling common features of negative pairs, such as human parts, the images effectively exclude irrelevant elements. Conversely, positive pairs, sharing the desired feature of the object—specifically, the rim of the object near the face—facilitate learning by attracting these relevant features (see Fig. 6(a)). To visualize the effectiveness of our loss in learning interaction-relevant features in similar images, we examine the feature distributions of 'Hold' and 'Sip' a wine glass, involving distinct affordances. Prior to training, these distributions overlap. However, after training with our loss function, the feature distribution for 'Hold wine glass' aligns more closely with 'Hold baseball bat' than with 'Sip wine glass'. This indicates that our loss function effectively discriminates between the characteristics of different interactions without exhibiting bias towards objects (see Fig. 6(b)). Detailed explanation is illustrated in the supplementary." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 228, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 228, + 91, + 448, + 102 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 214, + 153 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 214, + 153 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 214, + 153 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 214, + 153 + ], + "type": "image", + "image_path": "15beebd5b9e48617d6b475afa0f523683f104eaaf76111c33295ceeb71a3b55e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 145, + 154, + 167, + 159 + ], + "lines": [ + { + "bbox": [ + 145, + 154, + 167, + 159 + ], + "spans": [ + { + "bbox": [ + 145, + 154, + 167, + 159 + ], + "type": "text", + "content": "LOCATE" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 170, + 154, + 182, + 159 + ], + "lines": [ + { + "bbox": [ + 170, + 154, + 182, + 159 + ], + "spans": [ + { + "bbox": [ + 170, + 154, + 182, + 159 + ], + "type": "text", + "content": "I" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 184, + 114, + 216, + 153 + ], + "blocks": [ + { + "bbox": [ + 184, + 114, + 216, + 153 + ], + "lines": [ + { + "bbox": [ + 184, + 114, + 216, + 153 + ], + "spans": [ + { + "bbox": [ + 184, + 114, + 216, + 153 + ], + "type": "image", + "image_path": "9a088ffbdca4c0668c0cdda3e51ad906048ea60a2ef9e7bcdc30e1e1d57b2d53.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 184, + 154, + 212, + 159 + ], + "lines": [ + { + "bbox": [ + 184, + 154, + 212, + 159 + ], + "spans": [ + { + "bbox": [ + 184, + 154, + 212, + 159 + ], + "type": "text", + "content": "NTRA (Ours)" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 216, + 114, + 294, + 153 + ], + "blocks": [ + { + "bbox": [ + 216, + 114, + 294, + 153 + ], + "lines": [ + { + "bbox": [ + 216, + 114, + 294, + 153 + ], + "spans": [ + { + "bbox": [ + 216, + 114, + 294, + 153 + ], + "type": "image", + "image_path": "3c2ed3fcff53b2073ea464166f73eb8a568ebf1c9828d6f9fd7518a6f731995a.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 222, + 154, + 244, + 159 + ], + "lines": [ + { + "bbox": [ + 222, + 154, + 244, + 159 + ], + "spans": [ + { + "bbox": [ + 222, + 154, + 244, + 159 + ], + "type": "text", + "content": "LOCATE" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 258, + 154, + 292, + 159 + ], + "lines": [ + { + "bbox": [ + 258, + 154, + 292, + 159 + ], + "spans": [ + { + "bbox": [ + 258, + 154, + 292, + 159 + ], + "type": "text", + "content": "INTRA (Ours)" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 308, + 114, + 339, + 153 + ], + "blocks": [ + { + "bbox": [ + 308, + 114, + 339, + 153 + ], + "lines": [ + { + "bbox": [ + 308, + 114, + 339, + 153 + ], + "spans": [ + { + "bbox": [ + 308, + 114, + 339, + 153 + ], + "type": "image", + "image_path": "5a78434d2b3c40acf354603f86c9f38c7091ea3b19291267bda5b87faeefe66a.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 309, + 154, + 330, + 159 + ], + "lines": [ + { + "bbox": [ + 309, + 154, + 330, + 159 + ], + "spans": [ + { + "bbox": [ + 309, + 154, + 330, + 159 + ], + "type": "text", + "content": "LOCATE" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 340, + 114, + 386, + 153 + ], + "blocks": [ + { + "bbox": [ + 340, + 114, + 386, + 153 + ], + "lines": [ + { + "bbox": [ + 340, + 114, + 386, + 153 + ], + "spans": [ + { + "bbox": [ + 340, + 114, + 386, + 153 + ], + "type": "image", + "image_path": "27b6617b1f9ab4ac8713a58350ece750ab4b9c4ec0ab3814637ea722fd48a7c7.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 345, + 154, + 379, + 159 + ], + "lines": [ + { + "bbox": [ + 345, + 154, + 379, + 159 + ], + "spans": [ + { + "bbox": [ + 345, + 154, + 379, + 159 + ], + "type": "text", + "content": "INTRA (Ours)" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 387, + 114, + 430, + 153 + ], + "blocks": [ + { + "bbox": [ + 387, + 114, + 430, + 153 + ], + "lines": [ + { + "bbox": [ + 387, + 114, + 430, + 153 + ], + "spans": [ + { + "bbox": [ + 387, + 114, + 430, + 153 + ], + "type": "image", + "image_path": "19f0fdcb0706975354da39ab1e45e84a751b42c4f04b9cd29c24d073d732e0a0.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 399, + 154, + 422, + 159 + ], + "lines": [ + { + "bbox": [ + 399, + 154, + 422, + 159 + ], + "spans": [ + { + "bbox": [ + 399, + 154, + 422, + 159 + ], + "type": "text", + "content": "LOCATE" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 432, + 114, + 477, + 153 + ], + "blocks": [ + { + "bbox": [ + 432, + 114, + 477, + 153 + ], + "lines": [ + { + "bbox": [ + 432, + 114, + 477, + 153 + ], + "spans": [ + { + "bbox": [ + 432, + 114, + 477, + 153 + ], + "type": "image", + "image_path": "fa02b5539059f4fc628065abe31a73813c59c7f746aae32e6226c33cbbad62d6.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 437, + 154, + 471, + 159 + ], + "lines": [ + { + "bbox": [ + 437, + 154, + 471, + 159 + ], + "spans": [ + { + "bbox": [ + 437, + 154, + 471, + 159 + ], + "type": "text", + "content": "INTRA (Ours)" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 136, + 176, + 216, + 217 + ], + "blocks": [ + { + "bbox": [ + 206, + 162, + 406, + 172 + ], + "lines": [ + { + "bbox": [ + 206, + 162, + 406, + 172 + ], + "spans": [ + { + "bbox": [ + 206, + 162, + 406, + 172 + ], + "type": "text", + "content": "(a) Qualitative results on images with large domain gap" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 136, + 176, + 216, + 217 + ], + "lines": [ + { + "bbox": [ + 136, + 176, + 216, + 217 + ], + "spans": [ + { + "bbox": [ + 136, + 176, + 216, + 217 + ], + "type": "image", + "image_path": "e1520ca8e27c6b1e5bf6533121065a435d3b8273e45f8faba9e9c3118bf57289.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 151, + 217, + 172, + 223 + ], + "lines": [ + { + "bbox": [ + 151, + 217, + 172, + 223 + ], + "spans": [ + { + "bbox": [ + 151, + 217, + 172, + 223 + ], + "type": "text", + "content": "LOCATE" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 192, + 217, + 225, + 223 + ], + "lines": [ + { + "bbox": [ + 192, + 217, + 225, + 223 + ], + "spans": [ + { + "bbox": [ + 192, + 217, + 225, + 223 + ], + "type": "text", + "content": "INTRA (Ours)" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 151, + 224, + 290, + 234 + ], + "lines": [ + { + "bbox": [ + 151, + 224, + 290, + 234 + ], + "spans": [ + { + "bbox": [ + 151, + 224, + 290, + 234 + ], + "type": "text", + "content": "(b) Qualitative results on novel object" + } + ] + } + ], + "index": 30, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 243, + 480, + 298 + ], + "lines": [ + { + "bbox": [ + 130, + 243, + 480, + 298 + ], + "spans": [ + { + "bbox": [ + 130, + 243, + 480, + 298 + ], + "type": "text", + "content": "Fig. 7: Qualitative results of feasibility study: (a) Inference on diverse images with significant domain gap such as pixel arts and paintings. (b) Inference on novel objects that were not in the training data. (c) Inference on unseen novel interactions. INTRA demonstrates superior grounding accuracy in (a)-(c) compared to LOCATE [25], showing proper affordance region inference without explicit training." + } + ] + } + ], + "index": 31, + "angle": 0, + "type": "image_caption" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 217, + 176, + 234, + 217 + ], + "blocks": [ + { + "bbox": [ + 217, + 176, + 234, + 217 + ], + "lines": [ + { + "bbox": [ + 217, + 176, + 234, + 217 + ], + "spans": [ + { + "bbox": [ + 217, + 176, + 234, + 217 + ], + "type": "image", + "image_path": "4f8fee92a96460febad49c8ac69422710c337eff1aefd471cf43b32edc1cffce.jpg" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_body" + } + ], + "index": 21 + }, + { + "type": "image", + "bbox": [ + 235, + 176, + 258, + 217 + ], + "blocks": [ + { + "bbox": [ + 235, + 176, + 258, + 217 + ], + "lines": [ + { + "bbox": [ + 235, + 176, + 258, + 217 + ], + "spans": [ + { + "bbox": [ + 235, + 176, + 258, + 217 + ], + "type": "image", + "image_path": "2c0d4dcf1d0097afa88e3a54ff337f4a04ab6e18ded2dc7cbbb3d9c7234865d4.jpg" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 242, + 217, + 265, + 223 + ], + "lines": [ + { + "bbox": [ + 242, + 217, + 265, + 223 + ], + "spans": [ + { + "bbox": [ + 242, + 217, + 265, + 223 + ], + "type": "text", + "content": "LOCATE" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_caption" + } + ], + "index": 23 + }, + { + "type": "image", + "bbox": [ + 258, + 176, + 274, + 217 + ], + "blocks": [ + { + "bbox": [ + 258, + 176, + 274, + 217 + ], + "lines": [ + { + "bbox": [ + 258, + 176, + 274, + 217 + ], + "spans": [ + { + "bbox": [ + 258, + 176, + 274, + 217 + ], + "type": "image", + "image_path": "3599100b474b887a6d85e7d4983d38ebbc9396a2862fcd3930f81c45942dc174.jpg" + } + ] + } + ], + "index": 25, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 277, + 217, + 311, + 223 + ], + "lines": [ + { + "bbox": [ + 277, + 217, + 311, + 223 + ], + "spans": [ + { + "bbox": [ + 277, + 217, + 311, + 223 + ], + "type": "text", + "content": "INTRA (Ours)" + } + ] + } + ], + "index": 26, + "angle": 0, + "type": "image_caption" + } + ], + "index": 25 + }, + { + "type": "image", + "bbox": [ + 321, + 176, + 394, + 217 + ], + "blocks": [ + { + "bbox": [ + 321, + 176, + 394, + 217 + ], + "lines": [ + { + "bbox": [ + 321, + 176, + 394, + 217 + ], + "spans": [ + { + "bbox": [ + 321, + 176, + 394, + 217 + ], + "type": "image", + "image_path": "efeea2d7dc02216fe05e0fc483d751561b9e11f0feaadbd451155e41f7937c2e.jpg" + } + ] + } + ], + "index": 27, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 322, + 222, + 474, + 232 + ], + "lines": [ + { + "bbox": [ + 322, + 222, + 474, + 232 + ], + "spans": [ + { + "bbox": [ + 322, + 222, + 474, + 232 + ], + "type": "text", + "content": "(c) Qualitative results on novel interaction" + } + ] + } + ], + "index": 28, + "angle": 0, + "type": "image_caption" + } + ], + "index": 27 + }, + { + "type": "image", + "bbox": [ + 395, + 176, + 477, + 217 + ], + "blocks": [ + { + "bbox": [ + 395, + 176, + 477, + 217 + ], + "lines": [ + { + "bbox": [ + 395, + 176, + 477, + 217 + ], + "spans": [ + { + "bbox": [ + 395, + 176, + 477, + 217 + ], + "type": "image", + "image_path": "a0d3af061ce5c842bdef17af318a0c05b64339c91b8e19435449cc21bf968ccc.jpg" + } + ] + } + ], + "index": 29, + "angle": 0, + "type": "image_body" + } + ], + "index": 29 + }, + { + "bbox": [ + 131, + 325, + 441, + 337 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 325, + 441, + 337 + ], + "spans": [ + { + "bbox": [ + 131, + 325, + 441, + 337 + ], + "type": "text", + "content": "5.2 Feasibility Study on Generalization Property of INTRA" + } + ] + } + ], + "index": 32 + }, + { + "bbox": [ + 130, + 354, + 482, + 486 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 486 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 486 + ], + "type": "text", + "content": "INTRA excels in affordance grounding on images with large domain gaps, such as pixel art and paintings, as illustrated in Fig. 7(a). Furthermore, our method showcases strong generalization abilities for novel objects like a horse and quill, not present in the training set, as shown in Fig. 7(b). Additionally, despite deliberately not being trained on specific interaction classes like 'Hold' and 'Take photo' for experiment, INTRA successfully infers their affordances, as depicted in Fig. 7(c). More results and detailed experimental settings are in the supplementary. One possible explanation for this generalization property is that our INTRA employs VLM so that diverse domains and novel object can be dealt with without explicitly tuning for them. Another explanation is INTRA's contrastive training that may achieve better representation learning." + } + ] + } + ], + "index": 33 + }, + { + "bbox": [ + 131, + 512, + 220, + 525 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 512, + 220, + 525 + ], + "spans": [ + { + "bbox": [ + 131, + 512, + 220, + 525 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 34 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "In this paper, we introduce INTRA, a novel framework reformulating the weakly supervised affordance grounding with representation learning. We suggest interaction relationship-guided contrastive learning, informed by affordance knowledge from LLM. Furthermore, INTRA actively leverages VLM text embedding in proposed text-conditioned affordance map generation for flexible affordance grounding, further bolstered by text synonym augmentation for robustness. INTRA achieves state-of-the-art performance across diverse datasets, relying solely on exocentric images for training, unlike prior methods that also use egocentric images. Moreover, our method demonstrates generalization feasibility on novel objects, interactions, and images with significant domain gaps." + } + ] + } + ], + "index": 35 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 237 + ], + "type": "text", + "content": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)], the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. NRF-2022M3C1A309202211) and AI-Bio Research Grant through Seoul National University. Also, the authors acknowledged the financial support from the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 255, + 197, + 267 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 255, + 197, + 267 + ], + "spans": [ + { + "bbox": [ + 133, + 255, + 197, + 267 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 280, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 280, + 480, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 280, + 480, + 313 + ], + "spans": [ + { + "bbox": [ + 138, + 280, + 480, + 313 + ], + "type": "text", + "content": "1. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 314, + 480, + 401 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 314, + 480, + 401 + ], + "spans": [ + { + "bbox": [ + 138, + 314, + 480, + 401 + ], + "type": "text", + "content": "2. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Fu, C., Gopalakrishnan, K., Hausman, K., Herzog, A., Ho, D., Hsu, J., Ibarz, J., Ichter, B., Irpan, A., Jang, E., Ruano, R.J., Jeffrey, K., Jesmonth, S., Joshi, N., Julian, R., Kalashnikov, D., Kuang, Y., Lee, K.H., Levine, S., Lu, Y., Luu, L., Parada, C., Pastor, P., Quiambao, J., Rao, K., Rettinghouse, J., Reyes, D., Sermanet, P., Sievers, N., Tan, C., Toshev, A., Vanhoucke, V., Xia, F., Xiao, T., Xu, P., Xu, S., Yan, M., Zeng, A.: Do as i can and not as i say: Grounding language in robotic affordances. In: arXiv:2204.01691 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 402, + 480, + 434 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 402, + 480, + 434 + ], + "spans": [ + { + "bbox": [ + 138, + 402, + 480, + 434 + ], + "type": "text", + "content": "3. Ahn, M., Brohan, A., Brown, N., Chebotar, Y., Cortes, O., David, B., Finn, C., Gopalakrishnan, K., Hausman, K., Herzog, A., et al.: Do as i can, not as i say: Grounding language in robotic affordances. arXiv:2204.01691 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 434, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 434, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 138, + 434, + 480, + 456 + ], + "type": "text", + "content": "4. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv:2112.05814 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 456, + 480, + 478 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 456, + 480, + 478 + ], + "spans": [ + { + "bbox": [ + 138, + 456, + 480, + 478 + ], + "type": "text", + "content": "5. Ardón, P., Pairet, É., Lohan, K.S., Ramamoorthy, S., Petrick, R.: Affordances in robotic tasks-a survey. arXiv:2004.07400 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 479, + 480, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 480, + 500 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 480, + 500 + ], + "type": "text", + "content": "6. Ardón, P., Pairet, E., Petrick, R.P., Ramamoorthy, S., Lohan, K.S.: Learning grasp affordance reasoning through semantic relations. RA-L pp. 4571-4578 (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 501, + 480, + 521 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 501, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 138, + 501, + 480, + 521 + ], + "type": "text", + "content": "7. Bahl, S., Mendonca, R., Chen, L., Jain, U., Pathak, D.: Affordances from human videos as a versatile representation for robotics. In: CVPR. pp. 13778-13790 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 522, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 522, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 522, + 480, + 544 + ], + "type": "text", + "content": "8. Burke, C.J., Tobler, P.N., Baddeley, M., Schultz, W.: Neural mechanisms of observational learning. PNAS pp. 14431-14436 (2010)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 544, + 480, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 577 + ], + "type": "text", + "content": "9. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 577, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 480, + 599 + ], + "type": "text", + "content": "0. Chen, J., Gao, D., Lin, K.Q., Shou, M.Z.: Affordance grounding from demonstration video to target image. In: CVPR. pp. 6799-6808 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 600, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 620 + ], + "type": "text", + "content": "1. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "text", + "content": "2. Chen, X., He, K.: Exploring simple siamese representation learning. In: CVPR. pp. 15750-15758 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "3. Cornia, M., Baraldi, L., Serra, G., Cucchiara, R.: A deep multi-level network for saliency prediction. In: ICPR. pp. 3488-3493 (2016)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 228, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 228, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "14. Fang, K., Wu, T.L., Yang, D., Savarese, S., Lim, J.J.: Demo2vec: Reasoning object affordances from online videos. In: CVPR. pp. 2139-2147 (2018)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 480, + 171 + ], + "type": "text", + "content": "15. Gao, W., Wan, F., Pan, X., Peng, Z., Tian, Q., Han, Z., Zhou, B., Ye, Q.: Ts-cam: Token semantic coupled attention map for weakly supervised object localization. In: ICCV. pp. 2886-2895 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 480, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 480, + 193 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 480, + 193 + ], + "type": "text", + "content": "16. Geng, Y., An, B., Geng, H., Chen, Y., Yang, Y., Dong, H.: Rlafford: End-to-end affordance learning for robotic manipulation. In: ICRA. pp. 5880-5886 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 194, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 480, + 215 + ], + "type": "text", + "content": "17. Gibson, J.: The Ecological Approach to Visual Perception. Resources for ecological psychology, Lawrence Erlbaum Associates (1986)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 216, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 216, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 133, + 216, + 480, + 237 + ], + "type": "text", + "content": "18. Hadjivelichkov, D., Zwane, S., Agapito, L., Deisenroth, M.P., Kanoulas, D.: One-shot transfer of affordance regions? affcorrs! In: CoRL. pp. 550-560 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 238, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 238, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 133, + 238, + 480, + 258 + ], + "type": "text", + "content": "19. Hou, Z., Yu, B., Qiao, Y., Peng, X., Tao, D.: Affordance transfer learning for human-object interaction detection. In: CVPR. pp. 495-504 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 259, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 259, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 133, + 259, + 480, + 281 + ], + "type": "text", + "content": "20. Huang, Y., Cai, M., Li, Z., Sato, Y.: Predicting gaze in egocentric video by learning task-dependent attention transition. In: ECCV. pp. 754-769 (2018)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 282, + 480, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 282, + 480, + 313 + ], + "spans": [ + { + "bbox": [ + 133, + 282, + 480, + 313 + ], + "type": "text", + "content": "21. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS 33, 18661-18673 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "text", + "content": "22. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv:1412.6980 (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "type": "text", + "content": "23. Kümmerer, M., Wallis, T.S., Bethge, M.: Deepgaze ii: Reading fixations from deep features trained on object recognition. arXiv:1610.01563 (2016)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 358, + 480, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 480, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 480, + 390 + ], + "type": "text", + "content": "24. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask dino: Towards a unified transformer-based framework for object detection and segmentation. In: CVPR. pp. 3041-3050 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 391, + 480, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 391, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 391, + 480, + 423 + ], + "type": "text", + "content": "25. Li, G., Jampani, V., Sun, D., Sevilla-Lara, L.: Locate: Localize and transfer object parts for weakly supervised affordance grounding. In: CVPR. pp. 10922-10931 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "type": "text", + "content": "26. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv:2301.12597 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 457, + 480, + 489 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 480, + 489 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 480, + 489 + ], + "type": "text", + "content": "27. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: ICML. pp. 12888-12900 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 490, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 490, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 490, + 480, + 522 + ], + "type": "text", + "content": "28. Li, J., Selvaraju, R., Gotmare, A., Joty, S., Xiong, C., Hoi, S.C.H.: Align before fuse: Vision and language representation learning with momentum distillation. NeurIPS pp. 9694-9705 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "type": "text", + "content": "29. Liang, J., Huang, W., Xia, F., Xu, P., Hausman, K., Ichter, B., Florence, P., Zeng, A.: Code as policies: Language model programs for embodied control. In: ICRA. pp. 9493-9500 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 555, + 460, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 460, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 460, + 567 + ], + "type": "text", + "content": "30. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. NeurIPS (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 567, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 480, + 588 + ], + "type": "text", + "content": "31. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Grounded affordance from exocentric view. arXiv:2208.13196 (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "type": "text", + "content": "32. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning affordance grounding from exocentric images. In: CVPR. pp. 2252-2261 (2022)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "text", + "content": "33. Luo, H., Zhai, W., Zhang, J., Cao, Y., Tao, D.: Learning visual affordance grounding from demonstration videos. IEEE Transactions on Neural Networks and Learning Systems (2023)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "text", + "content": "34. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research (2008)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 101 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "35. MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. vol. 1, pp. 281-297. Oakland, CA, USA (1967)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 149, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 149, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 130, + 149, + 481, + 171 + ], + "type": "text", + "content": "36. Mai, J., Yang, M., Luo, W.: Erasing integrated learning: A simple yet effective approach for weakly supervised object localization. In: CVPR. pp. 8766-8775 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 171, + 481, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 171, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 130, + 171, + 481, + 192 + ], + "type": "text", + "content": "37. Mees, O., Borja-Diaz, J., Burgard, W.: Grounding language with visual affordances over unstructured data. In: ICRA. pp. 11576-11582 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 192, + 481, + 213 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 192, + 481, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 192, + 481, + 213 + ], + "type": "text", + "content": "38. Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. ICLR (2013)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 213, + 481, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 213, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 213, + 481, + 236 + ], + "type": "text", + "content": "39. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM pp. 39-41 (1995)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 236, + 481, + 257 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 481, + 257 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 481, + 257 + ], + "type": "text", + "content": "40. Myers, A., Teo, C.L., Fermüller, C., Aloimonos, Y.: Affordance detection of tool parts from geometric features. In: ICRA. pp. 1374-1381 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 257, + 481, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 257, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 130, + 257, + 481, + 278 + ], + "type": "text", + "content": "41. Nagarajan, T., Feichtenhofer, C., Grauman, K.: Grounded human-object interaction hotspots from video. In: ICCV. pp. 8688-8697 (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 278, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 481, + 300 + ], + "type": "text", + "content": "42. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Detecting object affordances with convolutional neural networks. In: IROS. pp. 2765-2770 (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 300, + 481, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 481, + 331 + ], + "type": "text", + "content": "43. Nguyen, A., Kanoulas, D., Caldwell, D.G., Tsagarakis, N.G.: Object-based affordances detection with convolutional neural networks and dense conditional random fields. In: IROS. pp. 5908-5915 (2017)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 332, + 481, + 353 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 481, + 353 + ], + "type": "text", + "content": "44. Nguyen, T., Vu, M.N., Vuong, A., Nguyen, D., Vo, T., Le, N., Nguyen, A.: Open-vocabulary affordance detection in 3d point clouds. In: IROS. pp. 5692-5698 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 353, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 353, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 353, + 481, + 374 + ], + "type": "text", + "content": "45. Ning, S., Qiu, L., Liu, Y., He, X.: Hoiclip: Efficient knowledge transfer for hoi detection with vision-language models. In: CVPR. pp. 23507-23517 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 374, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 374, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 374, + 481, + 407 + ], + "type": "text", + "content": "46. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv:2304.07193 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 407, + 481, + 438 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 481, + 438 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 481, + 438 + ], + "type": "text", + "content": "47. Pan, J., Ferrer, C.C., McGuinness, K., O'Connor, N.E., Torres, J., Sayrol, E., Giro-i Nieto, X.: Salgan: Visual saliency prediction with generative adversarial networks. arXiv:1701.01081 (2017)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 438, + 481, + 472 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 438, + 481, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 481, + 472 + ], + "type": "text", + "content": "48. Pan, X., Gao, Y., Lin, Z., Tang, F., Dong, W., Yuan, H., Huang, F., Xu, C.: Unveiling the potential of structure preserving for weakly supervised object localization. In: CVPR. pp. 11642-11651 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 472, + 481, + 492 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 481, + 492 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 481, + 492 + ], + "type": "text", + "content": "49. Pennington, J., Socher, R., Manning, C.D.: Glove: Global vectors for word representation. In: EMNLP. pp. 1532-1543 (2014)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 492, + 481, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 492, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 492, + 481, + 525 + ], + "type": "text", + "content": "50. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML. pp. 8748-8763 (2021)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 525, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 481, + 557 + ], + "type": "text", + "content": "51. Rana, K., Haviland, J., Garg, S., Abou-Chakra, J., Reid, I., Suenderhauf, N.: Say-plan: Grounding large language models using 3d scene graphs for scalable task planning. In: CoRL (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 557, + 481, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 481, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 481, + 590 + ], + "type": "text", + "content": "52. Rashid, A., Sharma, S., Kim, C.M., Kerr, J., Chen, L.Y., Kanazawa, A., Goldberg, K.: Language embedded radiance fields for zero-shot task-oriented grasping. In: CoRL (2023)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 590, + 481, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 481, + 611 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 481, + 611 + ], + "type": "text", + "content": "53. Sawatzky, J., Srikantha, A., Gall, J.: Weakly supervised affordance detection. In: CVPR. pp. 2795-2804 (2017)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 611, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 611, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 611, + 481, + 643 + ], + "type": "text", + "content": "54. Singh, I., Blukis, V., Mousavian, A., Goyal, A., Xu, D., Tremblay, J., Fox, D., Thomason, J., Garg, A.: Progprompt: Generating situated robot task plans using large language models. In: ICRA. pp. 11523-11530 (2023)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 130, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 643, + 481, + 665 + ], + "type": "text", + "content": "55. Tang, J., Zheng, G., Yu, J., Yang, S.: Cotdet: Affordance knowledge prompting for task driven object detection. In: ICCV. pp. 3068-3078 (2023)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "text", + "content": "Interaction Relationship-aware Affordance Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 481, + 380 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "text", + "content": "56. Wan, B., Tuytelaars, T.: Exploiting clip for zero-shot hoi detection requires knowledge distillation at multiple levels. In: WACV. pp. 1805-1815 (2024)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 481, + 160 + ], + "type": "text", + "content": "57. Warren, W.: Perceiving affordances: Visual guidance of stair climbing. Journal of experimental psychology. Human perception and performance pp. 683-703 (1984)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "text", + "content": "58. Xu, R., Chu, F.J., Tang, C., Liu, W., Vela, P.A.: An affordance keypoint detection network for robot manipulation. IEEE RA-L pp. 2870-2877 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "type": "text", + "content": "59. Xue, Y., Gan, E., Ni, J., Joshi, S., Mirzasoleiman, B.: Investigating the benefits of projection head for representation learning. In: ICLR (2024)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 205, + 480, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 480, + 225 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 480, + 225 + ], + "type": "text", + "content": "60. Yu, S., Seo, P.H., Son, J.: Zero-shot referring image segmentation with global-local context features. In: CVPR. pp. 19456-19465 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "text", + "content": "61. Zhang, J., Herrmann, C., Hur, J., Cabrera, L.P., Jampani, V., Sun, D., Yang, M.H.: A tale of two features: Stable diffusion complements dino for zero-shot semantic correspondence. arXiv:2305.15347 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 259, + 480, + 292 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 292 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 292 + ], + "type": "text", + "content": "62. Zhang, X., Wang, D., Han, S., Li, W., Zhao, B., Wang, Z., Duan, X., Fang, C., Li, X., He, J.: Affordance-driven next-best-view planning for robotic grasping. In: CoRL (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 293, + 480, + 324 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 324 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 324 + ], + "type": "text", + "content": "63. Zhao, X., Li, M., Weber, C., Hafez, M.B., Wermter, S.: Chat with the environment: Interactive multimodal perception using large language models. arXiv:2303.08268 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 325, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 325, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 325, + 480, + 346 + ], + "type": "text", + "content": "64. Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: CVPR. pp. 2921-2929 (2016)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 348, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 348, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 348, + 480, + 380 + ], + "type": "text", + "content": "65. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv:2304.10592 (2023)" + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 237, + 102 + ], + "type": "text", + "content": "Jang & Seo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_content_list.json b/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..74bd9b982bacf781f105ae26a5d83ece440fed2b --- /dev/null +++ b/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_content_list.json @@ -0,0 +1,1764 @@ +[ + { + "type": "text", + "text": "IRGen: Generative Modeling for Image Retrieval", + "text_level": 1, + "bbox": [ + 220, + 141, + 781, + 162 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yidan Zhang $^{12}$ , Ting Zhang $^{1*}$ , Dong Chen $^{3}$ , Yujing Wang $^{3}$ , Qi Chen $^{3}$ , Xing Xie $^{3}$ , Hao Sun $^{3}$ , Weiwei Deng $^{3}$ , Qi Zhang $^{3}$ , Fan Yang $^{3}$ , Mao Yang $^{3}$ , Qingmin Liao $^{5}$ , Jingdong Wang $^{4}$ , and Baining Guo $^{3}$", + "bbox": [ + 236, + 188, + 764, + 236 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1Beijing Normal University 2The University of Tokyo 3Microsoft 4Baidu 5Shenzhen International Graduate School, Tsinghua University", + "bbox": [ + 235, + 244, + 767, + 276 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. While generative modeling has become prevalent across numerous research fields, its integration into the realm of image retrieval remains largely unexplored and underjustified. In this paper, we present a novel methodology, reframing image retrieval as a variant of generative modeling and employing a sequence-to-sequence model. This approach is harmoniously aligned with the current trend towards unification in research, presenting a cohesive framework that allows for end-to-end differentiable searching. This, in turn, facilitates superior performance via direct optimization techniques. The development of our model, dubbed IRGen, addresses the critical technical challenge of converting an image into a concise sequence of semantic units, which is pivotal for enabling efficient and effective search. Extensive experiments demonstrate that our model achieves state-of-the-art performance on three widely-used image retrieval benchmarks as well as two million-scale datasets, yielding significant improvement compared to prior competitive retrieval methods. In addition, the notable surge in precision scores facilitated by generative modeling presents the potential to bypass the reranking phase, which is traditionally indispensable in practical retrieval workflows. The code is publicly available at https://github.com/yakt00/IRGen.", + "bbox": [ + 261, + 329, + 743, + 593 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Image Retrieval $\\cdot$ Autoregressive Model $\\cdot$ Generative Model", + "bbox": [ + 261, + 606, + 740, + 619 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 647, + 375, + 662 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Generative modeling has made significant progress in a wide range of tasks including machine translation [89], conversational modeling [1, 12, 28, 67], image captioning [108], image classification [17], text-to-image synthesis [30, 73], and many more. Originating from language and then expanding to other modalities with specially designed tokenizers, such a universal modeling approach provides a promising direction for unifying different tasks into a versatile pretrained model, which has attracted widespread attention [2, 56, 67, 94]. Yet its potential in image retrieval has been unexplored. This paper aims to take the unified trend one step further and investigates generative modeling for image retrieval.", + "bbox": [ + 212, + 679, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "*Corresponding author: tingzhang@bnu.edu.cn.", + "bbox": [ + 230, + 825, + 550, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "A practical retrieval system generally consists of two stages: feature representation learning [33, 54, 60, 105] and Approximate Nearest Neighbor (ANN) search [6, 18, 39, 47]. Most image retrieval methods focus only on one individual stage while ignoring the fact that both stages are inherently and deeply connected in actual service. Thus, the practical system often requires careful per-task hyperparameter tuning to make the most out of the coordination of the feature extraction and ANN search. While some efforts have been dedicated to joint learning of embedding and compression (or indexing), such as deep quantization / hashing [16, 19, 49, 112, 113], they still rely on a post process conducting non-exhaustive search.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we cast image retrieval as a form of generative modeling and utilize standard Transformer architecture, as in GPT [12, 71, 72], to enable end-to-end differentiable search. Our model, IRGen, is a sequence-to-sequence model that directly generates identifiers corresponding to the given query image's nearest neighbors. Specifically, the model takes a query image as input and autoregressively predicts discrete visual tokens, which are considered as the identifier of an image. The predicted visual tokens are supposed to point to the query image's nearest neighbor. As such, IRGen can be trained directly from the final retrieval target starting with raw images.", + "bbox": [ + 212, + 300, + 787, + 436 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Two fundamental concerns need to be addressed to enable efficient and effective image retrieval using generative modeling. First, autoregressive generative modeling is notable for its slow inference speed due to the inherently sequential nature, thus the run-time cost for retrieval increases quadratically with the length of the input sequence. Second, it is particularly difficult to model the semantic relationship between the identifiers if we drastically shortened the image identifier. Therefore, a semantic tokenizer specially designed for image retrieval is an immediate problem.", + "bbox": [ + 212, + 440, + 787, + 560 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We observe that existing image tokenizers [53, 88], intended for image generation, are not suitable for image retrieval task, leading to poor performance as we will demonstrate in our experiments. We hence propose several key ingredients that first inject semantic information by applying image-level supervision rather than pixel-level reconstructive supervision, then generate dependent tokens in a sequence by leveraging the recursive property of residual quantization, and lastly ensure fast inference speed by tremendously reducing the length of the sequence via exploiting the global feature instead of spatial patch embeddings. Afterwards, we intentionally adopt the standard Transformer architecture so that we could scale up the model using existing techniques and infrastructures.", + "bbox": [ + 212, + 564, + 787, + 715 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The proposed IRGen achieves state-of-the-art performance across a diverse range of image retrieval datasets, owing to its end-to-end differentiable search capability. A comprehensive empirical study over three image retrieval benchmarks proves that our model is superior to prior state-of-the-art baselines, sometimes even surpassing linear scan search methods. For instance, compared with the best baseline method, including linear scan search, our model achieves remarkable improvement, such as a $20.2\\%$ increase in precision@10 on In-shop Clothes [61], a $6.0\\%$ boost in precision@2 on CUB200 [90] and a $2.4\\%$ enhancement in preci", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "sion@2 on Cars196 [50]. To assess the scalability of our model, we further experiment on million-level datasets, namely ImageNet [27] and Places365 [115], and consistently demonstrate superior performance in these challenging scenarios.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "It is our belief that generative models have the potential to redefine the landscape of image retrieval. The application of generative modeling to image retrieval tasks represents an exciting opportunity to unify information retrieval across various modalities. At a technical level, our model, IRGen, effortlessly bridges the gap between feature representation learning and approximate nonexhaustive search (bypassing vector compression), creating an end-to-end differentiable framework that enables direct optimization based on ultimate retrieval goal. Furthermore, the entire framework is conceptually straightforward, with all components relying on the standard Transformer architecture, renowned for its remarkable scalability [21,32,79,104].", + "bbox": [ + 212, + 191, + 784, + 343 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our contributions are concluded as:", + "bbox": [ + 240, + 344, + 500, + 357 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "* To the best of our knowledge, our work represents the first effort in employing a sequence-to-sequence generative model to address image retrieval in a fully end-to-end manner that directly generates the nearest neighbor's identifier given the query.", + "* We introduce a semantic image tokenizer explicitly designed for image retrieval to obtain image identifiers, facilitating autoregressive training. It is essential to note that this tokenizer differs significantly from previous quantization models, as our identifier solely represents the image and is not employed for distance computation, as is the case in quantization.", + "* Extensive experiments show that our approach exhibits substantial improvements, achieving new state-of-the-art results. We have demonstrated its scalability to million-scale datasets and provided throughput number, showcasing its near-real-time performance." + ], + "bbox": [ + 227, + 369, + 782, + 566 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 594, + 387, + 609 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Image retrieval. Traditionally, hand-crafted features are heuristically designed to describe the image content based on its color [92, 99], texture [68, 95] or shape [14]. Typical features include GIST [80], SIFT [62], SURF [8], VLAD [46] and so on. Recent years have witnessed the explosive research on deep learning based features trained over labeled images. Besides the evolvement of the network architecture designs [40, 51, 89], numerous efforts [33, 100] have been dedicated to various loss functions including classification loss [111, 117], triplet loss [110], contrastive loss [33, 48], center loss [100] and so on. The similarity is calculated through distance measure between features or evaluated through re-ranking techniques [77]. Another different line of research centers on approximate nearest neighbor search to speed up the search process, accepting a certain level of compromise in search accuracy. One way is to enable fast distance computation through hashing or quantization techniques such as LSH [41], min-Hash [22], ITQ [37], PQ [45], and many others [36, 93, 119]. The other way is to reduce the", + "bbox": [ + 212, + 628, + 787, + 843 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "number of distance comparison by retrieving a small number of candidates. Typical methods include partition-based indexing [6, 102] that partitions the feature space into non-overlapping clusters and graph-based indexing [44] that builds a neighborhood graph with edges connecting similar images. To improve the recall rate while ensuring fast search speed, hierarchical course-to-fine strategy [63] has been the popular choice that the retrieved candidates are refined level by level. Additionally, a number of works have introduced hybrid indexing [18], leveraging the best of both indexing schemes while avoiding their limitations.", + "bbox": [ + 212, + 146, + 787, + 267 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Generative modeling. Deep autoregressive networks are generative sequential models that assume a product rule for factoring the joint likelihood and model each conditional distribution through a neural network. AR models have shown powerful progress in generative tasks across multiple domains such as image [17, 109], text [72, 106], audio [23, 29], and video [97, 101]. The key component involves linearizing data into a sequence of symbols with notable works such as VQ-VAE [88], RQ-VAE [53]. Recently, a number of works [25, 86, 96] further explored AR model to empower entity retrieval and document retrieval. Most related to our work are NCI [96] and DSI [86], which are concerned with document retrieval. However, these approaches utilize hierarchical k-means clustering applied to document embeddings derived from a small pretrained language model to obtain document identifiers. In contrast, we put forward a novel approach that involves learning the identifier directly from semantic supervision, and showcase its effectiveness in the context of image retrieval. We posit that this discovery can also be advantageous for document retrieval tasks.", + "bbox": [ + 212, + 267, + 787, + 492 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Joint learning. There is a growing interest [19,42,43,112] in the study of joint learning to improve search accuracy. For example, JPQ [113] jointly learns the deep retrieval model (equivalent to an embedding model) and the embedding index (compression). DQN [16] combines PQ and embedding learning but does not optimize the PQ clusters. DPQ [49] incorporates PQ clusters for supervised joint learning, specifically targeting image retrieval. HashGAN [31] and BGAN [84] adversarially learn binary hash codes jointly with the embedding model in an unsupervised way. However, all these prior works focus on end-to-end training of encoding and compression together while overlooking the indexing part (meaning non-exhaustive search), which is challenging to formulate as differentiable. They leverage quantization (compression index) for distance approximation but still rely on linear scan in their experiments. In contrast, our approach reframes retrieval as a completely novel end-to-end task, eliminating explicit distinctions between embedding, compression, and indexing.", + "bbox": [ + 212, + 493, + 787, + 705 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 726, + 330, + 742 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Semantic Image Tokenizer", + "text_level": 1, + "bbox": [ + 215, + 756, + 478, + 771 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "As Transformer becomes the ubiquitous architecture in computer vision, it has emerged many successful image tokenizers such as VQ-VAE [35,74,88,107], RQ-VAE [53] and so on. Despite its success in image generation, they may not be well-suited for the retrieval task for several reasons. First, the process of", + "bbox": [ + 212, + 779, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "decoding latent codes to reconstruct raw images is essential for generating images in synthesis tasks but is redundant for retrieval tasks. Second, the autoregressive model's inference speed is heavily influenced by the length of the code sequence, where a shorter sequence is vital for efficient searching in our context. Presently, code sequences tend to be lengthy (for example, an $8 \\times 8$ feature map with a depth of 4 in RQ-VAE leads to a sequence of 256), underscoring the need to significantly reduce sequence length. Moreover, retrieval tasks require the embedding of semantic information within the latent codes. However, the current approach to learning latent codes through image reconstruction loss primarily captures low-level details, such as inconsequential local nuances and noise, which may not be beneficial for retrieval.", + "bbox": [ + 212, + 146, + 782, + 311 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Building on the insights mentioned earlier, we suggest investigating the global feature extracted from the class token, rather than relying on the default spatial tokens. This approach offers a substantial reduction in sequence length, reducing it from 64 tokens to a single token. Moreover, as a result of this approach, the class token inherently contains a condensed, high-level semantic representation. Let $\\mathbf{f}_{cls}$ denote the $d$ -dimensional feature vector outputted from the class token, which is taken as the image representation. We adopt residual quantization (RQ) or stacked composite quantization to approximate this feature. Suppose there are $M$ codebooks with each containing $L$ elements, $\\mathcal{C}_m = \\{\\mathbf{c}_{m1},\\dots ,\\mathbf{c}_{mL}\\}$ , RQ recursively maps the embedding $\\mathbf{f}_{cls}$ to a sequentially ordered $M$ codes, $\\mathbf{f}_{cls} \\rightarrow \\{l_1,l_2,\\dots ,l_M\\} \\in [\\mathbb{L}]^M$ . Let $\\mathbf{r}_0 = \\mathbf{f}_{cls}$ , we have", + "bbox": [ + 212, + 313, + 784, + 479 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nl _ {m} = \\arg \\min _ {l \\in [ \\mathbb {L} ]} \\| \\mathbf {r} _ {m - 1} - \\mathbf {c} _ {m l} \\| _ {2} ^ {2}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 492, + 784, + 508 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {r} _ {m} = \\mathbf {r} _ {m - 1} - \\mathbf {c} _ {m l _ {m}}, m = 1, 2, \\dots , M. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 367, + 513, + 784, + 529 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The process of sequentially generating discrete codes is inherently compatible with sequential autoregressive generation. This alignment helps alleviate the optimization challenges associated with modeling the relationships within identifiers. A figure illustrating the image tokenizer can be seen in the supplementary.", + "bbox": [ + 212, + 541, + 782, + 599 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To further inject semantic prior, we propose to train the network under classification loss over both the original embeddings as well as the reconstructed embeddings. In particular, we consider a series of reconstruction levels denoted as $\\hat{\\mathbf{f}}_{cls}^{\\leq m} = \\sum_{i=1}^{m} \\mathbf{c}_{il_i}, m = 1,2,\\dots,M$ . Each prefix code thus encodes semantic information to a certain degree. Adding up the $M$ levels of partial reconstruction error, the complete objective function is then formulated as,", + "bbox": [ + 212, + 602, + 782, + 691 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {c l s} (\\mathbf {f} _ {c l s}) + \\lambda_ {1} \\sum_ {m = 1} ^ {M} \\mathcal {L} _ {c l s} \\left(\\hat {\\mathbf {f}} _ {c l s} ^ {\\leq m}\\right) + \\lambda_ {2} \\sum_ {m = 1} ^ {M} \\| \\mathbf {r} _ {m} \\| _ {2} ^ {2}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 323, + 705, + 784, + 744 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {r} _ {m} = \\mathbf {f} _ {c l s} - \\operatorname {s g} \\left[ \\hat {\\mathbf {f}} _ {c l s} ^ {\\leq m} \\right], m = 1, 2, \\dots , M, \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 323, + 750, + 784, + 767 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathcal{L}_{cls}$ is the softmax cross-entropy loss and $\\mathrm{sg}[\\cdot ]$ is the stop gradient operator. During training, we adopt alternative optimization to update the codebook and the network. For computing the gradient of $\\mathcal{L}_{cls}(\\hat{\\mathbf{f}}_{cls}^{\\leq m})$ , we follow the straight-through estimator [9] as in [88]. After optimization, we hope that images with", + "bbox": [ + 212, + 779, + 782, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "similar classes have close codes. In the experiments, we present comparison with other discrete identifiers including random codes and codes from hierarchical k-means algorithm as well as from RQ-VAE.", + "bbox": [ + 212, + 146, + 787, + 191 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Encoder-Decoder for Autoregressive Retrieval", + "text_level": 1, + "bbox": [ + 214, + 215, + 642, + 231 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Once we have established a robust discrete latent structure equipped with semantic prior information, our next step is to train a powerful autoregressive sequence-to-sequence model solely on these discrete random variables without referring their visual content. Our encoder-decoder architecture decouples the input embedding from the generation of discrete codes. The training process involves image pairs $(x_{1},x_{2})$ , where $x_{2}$ is the nearest neighbor of $x_{1}$ . Our model's objective is to predict the identifiers of $x_{2}$ when given $x_{1}$ as input. This setup allows the model to learn the semantic relationships between images in the dataset. The left of Fig. 1 provides a concise view of our training pipeline. After training, the model begins by taking a query image as input to obtain the query embedding, which is decoded to the discrete codes. It is worth noting that the yielded discrete codes represent the query's nearest neighbor images within the database rather than for the query.", + "bbox": [ + 212, + 242, + 787, + 438 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To be specific, let the encoder be denoted as $\\mathbb{E}$ based on the ViT base architecture and the decoder be $\\mathbb{D}$ , a standard Transformer that includes causal self-attention, cross-attention and MLP layers. We leverage the spatial tokens outputted from the encoder as the input embedding, $\\mathbf{e} = \\mathbb{E}(x_1)$ , which is injected into the decoder through cross attention. Our training objective involves predicting the next token in the image identifier sequence. Specifically, we aim to maximize the probability of the $i$ -th token of the image identifier given the input embedding and the previously predicted tokens, $p(l_i|x_1,l_1,\\dots ,l_{i - 1},\\theta)$ , where $\\theta$ denotes the parameters of both $\\mathbb{D}$ and $\\mathbb{E}$ , and $l_{1},l_{2},\\dots ,l_{M}$ are the $M$ tokens that make up the image identifier for $x_{2}$ , generated by the image tokenizer. By maximizing the probability of each token, we effectively maximize the likelihood of generating the image identifier of an image,", + "bbox": [ + 212, + 439, + 789, + 621 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\np \\left(l _ {1}, \\dots , l _ {M} \\mid x _ {1}, \\theta\\right) = \\prod_ {m = 1} ^ {M} p \\left(l _ {i} \\mid x _ {1}, l _ {1}, \\dots , l _ {m - 1}, \\theta\\right). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 328, + 633, + 785, + 672 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We apply a softmax cross-entropy loss on a vocabulary of $M$ discrete tokens during training.", + "bbox": [ + 214, + 683, + 787, + 714 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Beam Search", + "text_level": 1, + "bbox": [ + 214, + 737, + 372, + 752 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "During inference, given a query image $\\mathbf{q}$ , we first calculate the query embedding processed by the encoder $\\mathbb{E}$ and then generate discrete codes through the decoder $\\mathbb{D}$ based on the query embedding in an autoregressive manner. These discrete codes represent an image that is considered as the nearest neighbor to the query image. This illustrates the process of Top-1 retrieval by generating", + "bbox": [ + 212, + 763, + 787, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/9a707bc90dec012ff1e566e3b10991447e7d58e36cf4d04fd75f68b6f640520e.jpg", + "image_caption": [ + "Fig. 1: The left of the figure illustrates the training pipeline of encoder-decoder architecture for autoregressive retrieval. The training objective is to autoregressively predict the identifier of the query's nearest neighbor image. The right of the figure illustrates the procedure of beam search with code length is 2 and beam size K is 3." + ], + "image_footnote": [], + "bbox": [ + 233, + 152, + 769, + 258 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "the sequence codes one by one according to the argmax probability. To perform Top-K retrieval, our model utilize beam search integrated into the generating process, allowing us to find the top- $K$ images that are the closest matches.", + "bbox": [ + 212, + 340, + 782, + 387 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As illustrated in right of Fig. 1, this procedure begins by defining a beam size, denoted as $\\mathrm{K}$ in our case. Initially, the beam comprises the start-of-sequence token, and the algorithm extends the current set of candidate sequences by considering the next potential tokens in the sequence. For each candidate sequence, the algorithm outputs probabilities for multiple potential next tokens and adds them to the beam. The expanded set of sequences is then scored based on the probabilities assigned by the model, which are computed as the product of the probabilities associated with their individual elements. The top-k sequences with the highest scores are retained, while the others are discarded. This selection process, which can be implemented with a priority queue in linear time with the candidate list size, is repeated until the last token is decoded.", + "bbox": [ + 212, + 391, + 787, + 556 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "It's important to note that not all generated identifiers are necessarily valid, meaning that an identifier belonging to the set $[\\mathbb{L}]^{M}$ may not correspond to any images within the retrieval database. Therefore, we must validate the generated image identifier at each step, which can be a time-consuming process. However, we address this challenge by constructing a prefix tree containing valid codes. In the case of beam search with a prefix tree, the search process is constrained to only consider valid next tokens, as determined by the prefix tree, rather than all the possible next tokens. This constraint ensures that the search process results in valid images, largely enhancing the efficiency of the retrieval process.", + "bbox": [ + 212, + 563, + 787, + 700 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Beam search vs. ANN search. Indeed, beam search can be regarded as a tree-based manner to perform approximate nearest neighbor (ANN) search. However, compared to prior methods, there is a significant difference in how they calculate the score to choose the current node. Traditional methods usually rely on calculating the distance between the query feature and the node's associated feature, using a predefined distance metric to determine the score. Conversely, in beam search, the score or likelihood is produced by a differentiable neural network conditioned on the query. This distinction allows the retrieval process to be refined end-to-end.", + "bbox": [ + 212, + 704, + 787, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/bd891bf653722b773fccfee93c1899168193f0a82f612ca1ffc2836f1de27682.jpg", + "table_caption": [ + "Table 1: Precision comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. Our model adopts beam search for retrieval, achieving significant improvement and performing even better than linear scan search." + ], + "table_footnote": [], + "table_body": "
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.710.27.15.846.843.639.934.925.922.018.515.4
CLIP57.522.816.614.166.063.559.453.870.867.863.357.2
CGD(repro)83.247.840.237.076.775.573.771.487.186.184.682.6
\\( IRT_R(repro) \\)92.759.651.147.679.377.775.071.475.673.168.361.7
FT-CLIP91.466.858.955.479.277.676.073.288.487.787.185.8
Faisss IVF PQ search
CGD(repro)60.430.524.522.071.670.869.968.784.884.484.183.3
\\( IRT_R(repro) \\)68.635.729.326.668.967.666.263.459.157.554.751.7
FT-CLIP63.737.030.728.072.672.171.269.786.586.386.286.0
ScaNN search
CGD(repro)83.047.740.337.276.775.273.871.487.186.184.582.6
\\( IRT_R(repro) \\)92.058.250.046.679.377.775.171.475.472.868.161.6
FT-CLIP90.464.656.953.579.277.576.073.288.387.787.185.8
SPANN search
CGD(repro)83.047.740.337.176.775.573.771.487.086.184.682.6
\\( IRT_R(repro) \\)91.456.247.944.579.377.675.071.474.872.467.661.1
FT-CLIP90.262.955.151.878.577.676.073.288.688.187.586.3
Beam search
IRGen (ours)92.487.086.686.582.782.783.082.890.189.990.290.5
", + "bbox": [ + 240, + 220, + 764, + 535 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 547, + 375, + 565 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We evaluate our method on common image retrieval datasets and on two large-scale datasets, ImageNet [27] and Places365 [115]. For a detailed description of the datasets and implementation details, please refer to the supplementary.", + "bbox": [ + 212, + 582, + 785, + 627 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Baselines. We evaluate our model's performance in comparison to five competitive baselines: 1) ResNet-101 [40] trained from ImageNet dataset, denoted as Res101-Img, which is commonly used as a feature extraction tool for various tasks; 2) CLIP [70] trained on 400M image-text pairs, known for powerful zero-shot capability; 3) CGD [48], a state-of-the-art method based on ResNet; 4) IRT [33], a Transformer-based model for image retrieval and we use the best-performing model $\\mathrm{IRT}_{\\mathbb{R}}$ ; 5) FT-CLIP, a baseline finetuned from CLIP on the target dataset. For both CGD and IRT, we have reproduced these models to ensure consistent data processing and comparable model sizes. Specifically, we use ResNet-101 for CGD and DeiT-B for IRT. We also provide their best results from their original papers for reference.", + "bbox": [ + 212, + 628, + 787, + 792 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Search process. The baseline models primarily focus on effective feature learning. After training, these models are utilized to extract features for the database images. During the search process, a given query image is initially passed through", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/635faa0103dccb777d31b9bc3ec1862f74d496a0d4ce36bcd91cbcd3c9ccc0cc.jpg", + "table_caption": [ + "Table 2: Recall comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. we include the best result of CGD and IRT from their original papers for context with * denotation. Our model adopt beam search for retrieval, achieving comparable performance in most cases." + ], + "table_footnote": [], + "table_body": "
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.755.962.766.846.859.971.780.825.935.64759.7
CLIP57.583.087.589.766.078.187.793.570.882.691.195.9
CGD*91.998.198.799.079.286.692.095.194.897.198.298.8
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}^{ * } \\)91.998.198.799.076.685.091.194.3----
FT-CLIP91.497.398.198.579.285.089.392.088.490.592.593.8
Faisss IVF PQ search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)60.476.077.177.471.677.481.584.284.888.089.891.0
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)68.679.280.080.268.977.985.089.359.170.478.283.4
FT-CLIP63.770.771.171.272.678.082.385.286.586.987.287.5
ScaNN search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)83.094.896.296.776.783.588.091.887.191.794.696.6
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)92.097.898.398.479.386.891.994.775.484.790.995.0
FT-CLIP90.495.996.696.979.285.089.292.788.390.592.493.7
SPANN search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)83.095.096.496.976.783.487.991.887.091.794.696.7
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)91.497.297.697.779.386.891.994.774.884.390.594.7
FT-CLIP90.295.896.797.078.585.089.492.988.690.792.594.2
Beam search
IRGen (ours)92.496.897.697.982.786.489.291.490.192.193.293.7
", + "bbox": [ + 240, + 234, + 764, + 550 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "the model to obtain its query feature. Subsequently, this query feature is compared with the features of database images using a specific distance metric. Following the conventions established in previous works such as [33, 48, 70], we employ the cosine distance for the CLIP model and the Euclidean distance for the other baseline models. We evaluate two search strategies: linear scan search (K-nearest neighbors or KNN) and approximate nearest neighbor search (ANN). Linear scan search is known for its accuracy but is computationally intensive. In contrast, ANN is significantly more efficient. For ANN, we explore: (i) the popular Faiss IVF PQ [47]; (ii) the state-of-the-art memory-based algorithm ScaNN [39] with the default setting; and (iii) the state-of-the-art disk-based SPANN algorithm [18]. These evaluation strategies allow us to assess the retrieval performance of our model against a variety of search methods.", + "bbox": [ + 212, + 564, + 787, + 746 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Results", + "text_level": 1, + "bbox": [ + 215, + 768, + 323, + 782 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Tab. 1 presents a detailed performance comparison in terms of precision@ $K$ , which assesses the percentage of retrieved candidates that share the same class as the query among the top $K$ results. Our model consistently outperforms all", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "other models, even surpassing those employing linear scan search. Notably, we achieve remarkable improvements, such as a $20.2\\%$ boost in precision@10 on the In-shop Clothes dataset, a $6.0\\%$ increase in precision@2 on the CUB200 dataset, and a $2.4\\%$ gain in precision@2 on the Cars196 dataset. Furthermore, several observations can be made: 1) Finetuned models, tailored to specific datasets, exhibit significantly better performance compared to off-the-shelf feature extractors like CLIP and ImageNet-pretrained ResNet-101. 2) Generally, models equipped with ANN algorithms perform slightly worse than their counterparts using linear scan search. However, there are exceptions, such as FT-CLIP with SPANN search on the Cars196 dataset, which demonstrates the importance of end-to-end optimization. 3) Our model consistently maintains high precision scores as $K$ increases, while other models experience a substantial drop.", + "bbox": [ + 212, + 146, + 787, + 327 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tab. 2 provides a comparison of different models using the Recall@K metric. Recall@K measures the proportion of queries for which at least one image among the top $K$ retrieved candidates shares the same label as the query image, yielding a score of 1 if true and 0 otherwise. The table also includes the best recall results of CGD and IRT from their respective original papers for reference. It's important to note that these models may have different data preprocessing, model sizes, and additional training techniques. Here are the key observations: 1) Our IRGen model achieves the highest Recall@1 score compared to all other models. However, for other recall scores, our model performs similarly or slightly worse. This discrepancy may arise from the current objective loss used in autoregressive models, which heavily optimizes for Recall@1 while giving less emphasis to other recall values. One potential solution is to incorporate the beam search process into training for joint optimization. 2) Different combinations of feature extractors and ANN algorithms exhibit significant variations across the three datasets, highlighting the challenges of achieving coordination in practical scenarios. 3) Notably, despite the high recall achieved by baselines, they often require an additional re-ranking stage to improve precision, whereas our model already attains high precision scores without the need for re-ranking.", + "bbox": [ + 212, + 330, + 787, + 604 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Fig. 2 illustrates the precision-recall curve, where recall represents the true positive rate. Our approach, IRGen, consistently delivers outstanding performance, maintaining high precision and recall simultaneously. In addition to precision-recall analysis, we evaluate our model using the mean reciprocal rank (MRR) metric, which measures the inverse of the rank of the first relevant item. We compute MRR for four different values: 1, 2, 4, and 8, and display the corresponding curves in Fig. 3. The baselines employ the SPANN retrieval algorithm. Our IRGen model consistently outperforms the baselines across all evaluated metrics, confirming the effectiveness of our framework. Notably, there is significant variability in the performance gap between each baseline and our model across the three datasets, highlighting the challenges and dataset-dependent nature of retrieval tasks.", + "bbox": [ + 212, + 608, + 787, + 789 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results on million-level datasets. We further experiment our approach with ImageNet dataset [27] that contains 1,281,167 images and Places365-Standard [115] containing about $1.8M$ images from 365 scene categories. We compare with", + "bbox": [ + 214, + 794, + 787, + 842 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/5f13ce87060fa2e0026cd4685191eeb6d03a71b7dc1f351d6611e5d5c32e9c93.jpg", + "image_caption": [ + "Fig. 2: Precision-Recall (TPR) curve comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset." + ], + "image_footnote": [], + "bbox": [ + 217, + 148, + 401, + 250 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/50f68bce7dd1a95dfd0a7bf9f0a5e4491c8d81f1201d510c7e6fd0e6a34bca06.jpg", + "image_caption": [ + "(b)" + ], + "image_footnote": [], + "bbox": [ + 444, + 148, + 607, + 250 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/ac6a4068cb5987febe7b226a78f01ef90dbbc1e51993f238c90f18c51bd0b3d9.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 648, + 148, + 810, + 250 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/3fbf9aeff8f70bf139b1b6c8e3d7991b461bc309e52b7489ac1678eb4e891176.jpg", + "image_caption": [ + "Fig. 3: MRR with respect to 1,2,4,8 comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset." + ], + "image_footnote": [], + "bbox": [ + 217, + 297, + 401, + 398 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/018b6ae5551ea8837fbbec753530cdff141dc4a7b06bcfda6a909dcce02d962c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 421, + 299, + 604, + 398 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/9420660c28bf6f4760b9b7879f80c441e842e67eec84b78c10c0214f3ff0bbda.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 627, + 299, + 807, + 398 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "the strong baselines including CLIP model as well as FT-CLIP model finetuned based on CLIP model. The comparison is reported in Fig. 4 and Tab. 3, focusing on precision@K and MAP@100. Our IRGen model consistently outperforms the baselines, achieving the best results in terms of precision@K and MAP@100. The precision values for our model remain consistently high as $K$ increases, while the baselines experience noticeable performance degradation. These results confirm the effectiveness of our model in handling large-scale datasets like ImageNet, where it maintains high precision across varying values of $K$ and outperforms the baseline models.", + "bbox": [ + 212, + 452, + 787, + 585 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Comparison to supervised deep quantization methods. We make the comparison with recent supervised deep quantization methods on ImageNet, including the state-of-the-art methods ADSVQ [116] and DPQ [49]. Notably, these methods exclusively utilize 100 classes from ImageNet, as indicated in their original papers, making it a substantially easier case. According to the original paper, DPQ [49] employed ResNet-50 (25.56M parameters), ADSVQ [116] utilized AlexNet (60.3M parameters), and DTQ [58] also used AlexNet. To ensure fair comparison, we employ a smaller network, ViT-S (22.1M parameters) and rerun over 100 classes. Tab. 4 illustrates the superiority of our approach.", + "bbox": [ + 212, + 589, + 787, + 724 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.2 Ablations", + "text_level": 1, + "bbox": [ + 215, + 751, + 341, + 763 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The effect of identifiers. In our study of image identifiers, we compared four different approaches: (1) assigning random identifiers to images, (2) hierarchical k-means (HKM), (3) Product Quantization (PQ) and (4) using the image tokenizer RQ-VAE [11]. The results of this comparison are summarized in Tab. 6.", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/444b3143d2d513f2a0df3a41c8a614860eca168264baa2b9dd315304421c1d70.jpg", + "table_caption": [ + "Table 3: MAP@100 on two million- Table 4: MAP@1000 for 32 bits level datasets. The results of CLIP and (equivalent to the length of our identiFT-CLIP are retrieved by SPANN. -fier) comparison on ImageNet dataset." + ], + "table_footnote": [], + "table_body": "
ModelDatasetMethodMAP@1000 for 32 bits
ImageNetPlaces365DTQ [58]68.12
CLIP44.122.1ADSVQ [116]75.21
FT-CLIP65.530.3DPQ [49]87.70
IRGen(Ours)76.044.3IRGen(Ours)93.52
", + "bbox": [ + 241, + 198, + 772, + 277 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/d745a4405e5b4b03ca6934c0ab53affe37b1a3e8fb4b4a56f39542f4158d87fe.jpg", + "table_caption": [ + "Table 5: Generalize to new data. We split $5\\%$ of the training data from the ImageNet dataset for inference and remained unseen during training." + ], + "table_footnote": [], + "table_body": "
ModelPrecision
110100
FT-CLIP + Linear Scan70.665.055.6
IRGen (Ours)77.077.977.4
", + "bbox": [ + 339, + 325, + 663, + 386 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The random assignment of identifiers to images yielded expectedly lower performance. This performance gap can be attributed to the fact that models with random identifiers need to learn not only the interaction between queries and image identifiers but also allocate capacity to learn relationships within the identifiers themselves. On the other hand, HKM showed superior performance compared to random assignment, underscoring the significance of semantic identifiers. However, our proposed semantic image identifiers demonstrated a clear improvement over HKM, highlighting their effectiveness in enhancing retrieval performance. PQ codes perform worse than the random assigned identifiers. This underperformance may stem from the model's challenges in constructing semantic information from PQ codes, which might be incompatible with autoregressive prediction mechanism. This highlights the significance of our sequence order in autoregressive training process. In contrast, the performance of RQ-VAE significantly trailed behind our model, with a performance less than 10 percent. We attribute this difference to the sequence length in RQ-VAE which is too long for the model to effectively capture relationships within the identifiers.", + "bbox": [ + 212, + 401, + 785, + 642 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Generalize to new data. Addressing the inclusion of fresh data holds particular significance, especially in the context of search scenarios. To assess this capacity, we conduct an experiment where we intentionally withheld $5\\%$ of the training data from the ImageNet dataset during the training phase and introduced it during inference, all without updating the existing codebook and AR model. In this experiment, we compare our model with the formidable baseline FT-CLIP, which is equipped with a linear scan search. The results, as displayed in Tab. 5, reveal that our model maintains superior performance even when confronted with new data. This observation highlights our model's ability to effectively generalize to previously unseen data. In scenarios where more new data come in with vastly different semantic structure, leading to the distribution of gallery data change drastically, all data-dependent component such as embedding model as well as joint learning methods including IRGen, have to", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/1ccefc47b807cb75dfe50f645edc717bc00099a988d1bcf99f2957236a1f0289.jpg", + "image_caption": [ + "Fig. 4: Precision comparison on large scale datasets: ImageNet and Places365." + ], + "image_footnote": [], + "bbox": [ + 225, + 145, + 493, + 306 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/8c3a38dfd2c20474700e30ed2d4ffa50a796207363f0751401fc65bd2d3a7fc3.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 504, + 143, + 774, + 306 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/ea5f06df81ff411efe3de0f93fec0ecf12e8ae29edf17e04dd4374b147eb09e8.jpg", + "table_caption": [ + "Table 6: Ablation study on the image identifier (T=length)." + ], + "table_footnote": [], + "table_body": "
IdentifierTPrecisionRecall
11020301102030
Random487.675.470.868.387.695.196.096.1
\\( \\mathrm{HKM}_{100} \\)488.280.078.277.387.293.194.395.0
\\( \\mathrm{HKM}_{200} \\)389.081.679.879.089.093.994.995.8
\\( \\mathrm{HKM}_{500} \\)289.581.779.878.989.595.396.597.0
PQ473.866.161.859.273.890.293.394.5
Ours492.189.789.589.592.196.897.597.7
", + "bbox": [ + 282, + 358, + 720, + 476 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "re-train the model and re-construct the data index. Essentially, generalization (or dynamic updates) only supports a small number of new data that do not substantially alter the distribution which we have demonstrated in our case. In future we may extend IRGen to an adaptive structure capable of capturing the evolving distribution of new data during training.", + "bbox": [ + 212, + 489, + 784, + 565 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Storage requirement and Inference throuput. We first provide a comprehensive comparison of model capacity on the ImageNet dataset and the comparison is shown in the Tab. 7. It is crucial to emphasize that a retrieval system's storage considerations extend beyond just the model; it must also store features for all database vectors, constituting a substantial portion of storage requirements, especially in the context of a large database. While compression can alleviate this concern, the performance is severely compromised due to quantization. Our GPU inference cost, tested on a Tesla P100 PCIe 16GB GPU, is 0.037s/image, which is near-real-time, considering practical retrieval times at the order of 10 milliseconds. Moreover, our approach achieves $76\\%$ MAP@100, Moreover, our approach achieves $76\\%$ MAP@100, significantly surpassing the FT-CLIP with SPANN result of $65.5\\%$ , and is competitive with FT-CLIP utilizing linear scan, which achieves $77\\%$ . Notably, however, the FT-CLIP with linear scan method demands 0.14 seconds per image and considerable memory usage.", + "bbox": [ + 212, + 566, + 785, + 777 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We further report additional inference throughput on Inshop dataset for 100 queries, with beam sizes set at 1, 10, 20, and 30 for comparison. This analysis is conducted on an NVIDIA V100-16G GPU and we break down the time cost of each component during autoregressive retrieval. As shown in Fig. 5, the encoder", + "bbox": [ + 212, + 779, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/c9e5041b9a4ae1b25ab37e0b7f36256d5e5f2ca08216d37759f95ffacc723a82.jpg", + "table_caption": [ + "Table 7: Comprehensive comparison of storage requirement and inference cost." + ], + "table_footnote": [], + "table_body": "
MethodModel(Params)Database storage
IRGenViT-base encoder(86M)+24-layer decoder(307M)4.9MB: 4 bytes/image
FT-CLIPViT-base(86M)3.67GB: 768x4 bytes/image
", + "bbox": [ + 217, + 167, + 816, + 215 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/fee9b7080db75d046001dfbc17acd2e41b1b34eecac480e331d2024274efa03e.jpg", + "image_caption": [ + "Fig. 5: Illustrating the search speed using beam search." + ], + "image_footnote": [], + "bbox": [ + 333, + 229, + 671, + 324 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "is quite fast, while the autoregressive decoder becomes the major bottleneck, especially as the beam size increases. Additional time is consumed for checking the validity of predictions, as it's possible that the predicted identifier may not exist in the database. Overall, the time cost is within an acceptable range. For instance, it takes approximately 0.07 seconds (with a beam size of 10) or 0.19 seconds (with a beam size of 30) per query.", + "bbox": [ + 212, + 351, + 785, + 441 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For inference speed, we anticipate that the prevalent reliance on GPUs will swiftly lead to newer GPU generations with increased processing power, more efficient memory management, and improved hardware support, enhancing the speed of our autoregressive retrieval. Additionally, our model, being GPT-based, can leverage rapidly developed acceleration techniques designed for GPT.", + "bbox": [ + 212, + 441, + 785, + 518 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 537, + 359, + 555 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we delve into the realm of generative modeling to enable end-to-end image retrieval, a process that directly connects a query image to its closest match. With the introduction of semantic image tokenizer, we've demonstrated that our model excels at achieving remarkable precision without compromising recall. Through extensive ablation studies and evaluations, we've underscored the superior performance of our approach. We believe that this innovative approach to generative modeling in image retrieval not only pushes the boundaries of this field but also holds potential for broader applications.", + "bbox": [ + 212, + 566, + 785, + 688 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations. While our model has shown significant performance improvements, it's important to acknowledge its limitations. First, though our model has demonstrated scalability to million-scale datasets, dealing with billion-scale datasets is a complex challenge. It may necessitate even larger models with higher capacity, potentially impacting inference speed. Striking a balance between model capacity and speed is an area that warrants exploration for efficient and effective billion-scale search. Second Training large autoregressive models requires substantial computational resources, which raises environmental concerns. Research efforts to enable efficient training, such as fast fine-tuning of pretrained models, are crucial to mitigate energy consumption and environmental impact.", + "bbox": [ + 212, + 688, + 785, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work is supported by Fundamental Research Funds for the Central Universities (2243100004).", + "bbox": [ + 212, + 178, + 782, + 209 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 233, + 321, + 250 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Adiwardana, D., Luong, M.T., So, D.R., Hall, J., Fiedel, N., Thoppilan, R., Yang, Z., Kulshreshtha, A., Nemade, G., Lu, Y., et al.: Towards a human-like open-domain chatbot. arXiv preprint arXiv:2001.09977 (2020)", + "2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. arXiv preprint arXiv:2204.14198 (2022)", + "3. Alzu'bi, A., Amira, A., Ramzan, N.: Semantic content-based image retrieval: A comprehensive study. Journal of Visual Communication and Image Representation 32, 20-54 (2015)", + "4. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM 51(1), 117-122 (2008)", + "5. Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 931-938 (2014)", + "6. Babenko, A., Lempitsky, V.: The inverted multi-index. IEEE transactions on pattern analysis and machine intelligence 37(6), 1247-1260 (2014)", + "7. Bai, S., Tang, P., Torr, P.H., Latecki, L.J.: Re-ranking via metric fusion for object retrieval and person re-identification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 740-749 (2019)", + "8. Bay, H., Tuytelaars, T., Van Gool, L.: Surf: Speeded up robust features. In: European conference on computer vision. pp. 404-417. Springer (2006)", + "9. Bengio, Y., Léonard, N., Courville, A.: Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432 (2013)", + "10. Bentley, J.L.: K-d trees for semidynamic point sets. In: Proceedings of the sixth annual symposium on Computational geometry. pp. 187-197 (1990)", + "11. Bevilacqua, M., Ottaviano, G., Lewis, P., Yih, W.t., Riedel, S., Petroni, F.: Autoregressive search engines: Generating substrings as document identifiers. arXiv preprint arXiv:2204.10628 (2022)", + "12. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)", + "13. Cao, B., Araujo, A., Sim, J.: Unifying deep local and global features for image search. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 726-743. Springer (2020)", + "14. Cao, Y., Wang, C., Zhang, L., Zhang, L.: Edgel index for large-scale sketch-based image search. In: CVPR 2011. pp. 761-768. IEEE (2011)", + "15. Cao, Y., Long, M., Wang, J., Liu, S.: Collective deep quantization for efficient cross-modal retrieval. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 31 (2017)" + ], + "bbox": [ + 225, + 266, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "16. Cao, Y., Long, M., Wang, J., Zhu, H., Wen, Q.: Deep quantization network for efficient image retrieval. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. p. 3457-3463. AAAI'16, AAAI Press (2016)", + "17. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative pretraining from pixels. In: International conference on machine learning. pp. 1691-1703. PMLR (2020)", + "18. Chen, Q., Zhao, B., Wang, H., Li, M., Liu, C., Li, Z., Yang, M., Wang, J.: Spann: Highly-efficient billion-scale approximate nearest neighborhood search. Advances in Neural Information Processing Systems 34, 5199-5212 (2021)", + "19. Chen, T., Li, L., Sun, Y.: Differentiable product quantization for end-to-end embedding compression. In: International Conference on Machine Learning. pp. 1617-1626. PMLR (2020)", + "20. Cho, J., Lu, J., Schwenk, D., Hajishirzi, H., Kembhavi, A.: X-lxmert: Paint, caption and answer questions with multi-modal transformers. arXiv preprint arXiv:2009.11278 (2020)", + "21. Chowdhery, A., Narang, S., Devlin, J., Bosma, M., Mishra, G., Roberts, A., Barham, P., Chung, H.W., Sutton, C., Gehrmann, S., et al.: Palm: Scaling language modeling with pathways. arXiv preprint arXiv:2204.02311 (2022)", + "22. Chum, O., Philbin, J., Zisserman, A., et al.: Near duplicate image detection: Min-cache and tfidf weighting. In: Bmvc. vol. 810, pp. 812-815 (2008)", + "23. Chung, Y.A., Hsu, W.N., Tang, H., Glass, J.: An unsupervised autoregressive model for speech representation learning. arXiv preprint arXiv:1904.03240 (2019)", + "24. De Cao, N., Aziz, W., Titov, I.: Highly parallel autoregressive entity linking with discriminative correction. arXiv preprint arXiv:2109.03792 (2021)", + "25. De Cao, N., Izacard, G., Riedel, S., Petroni, F.: Autoregressive entity retrieval. arXiv preprint arXiv:2010.00904 (2020)", + "26. De Cao, N., Wu, L., Popat, K., Artetxe, M., Goyal, N., Plekhanov, M., Zettlemoyer, L., Cancedda, N., Riedel, S., Petroni, F.: Multilingual autoregressive entity linking. Transactions of the Association for Computational Linguistics 10, 274-290 (2022)", + "27. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)", + "28. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018)", + "29. Dhariwal, P., Jun, H., Payne, C., Kim, J.W., Radford, A., Sutskever, I.: Jukebox: A generative model for music. arXiv preprint arXiv:2005.00341 (2020)", + "30. Ding, M., Zheng, W., Hong, W., Tang, J.: Cogview2: Faster and better text-to-image generation via hierarchical transformers. arXiv preprint arXiv:2204.14217 (2022)", + "31. Dizaji, K.G., Zheng, F., Sadoughi, N., Yang, Y., Deng, C., Huang, H.: Unsupervised deep generative adversarial hashing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3664-3673 (2018)", + "32. Du, N., Huang, Y., Dai, A.M., Tong, S., Lepikhin, D., Xu, Y., Krikun, M., Zhou, Y., Yu, A.W., First, O., et al.: Glam: Efficient scaling of language models with mixture-of-experts. In: International Conference on Machine Learning. pp. 5547-5569. PMLR (2022)", + "33. El-Nouby, A., Neverova, N., Laptev, I., Jégou, H.: Training vision transformers for image retrieval. arXiv preprint arXiv:2102.05644 (2021)" + ], + "bbox": [ + 225, + 146, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "34. Erin Liong, V., Lu, J., Wang, G., Moulin, P., Zhou, J.: Deep hashing for compact binary codes learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2475-2483 (2015)", + "35. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. arXiv preprint arXiv:2203.13131 (2022)", + "36. Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization. IEEE transactions on pattern analysis and machine intelligence 36(4), 744-755 (2013)", + "37. Gong, Y., Lazebnik, S., Gordo, A., Perronnin, F.: Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE transactions on pattern analysis and machine intelligence 35(12), 2916-2929 (2012)", + "38. Gulrajani, I., Kumar, K., Ahmed, F., Taiga, A.A., Visin, F., Vazquez, D., Courville, A.: Pixelvae: A latent variable model for natural images. arXiv preprint arXiv:1611.05013 (2016)", + "39. Guo, R., Sun, P., Lindgren, E., Geng, Q., Simcha, D., Chern, F., Kumar, S.: Accelerating large-scale inference with anisotropic vector quantization. In: International Conference on Machine Learning. pp. 3887-3896. PMLR (2020)", + "40. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)", + "41. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing. pp. 604-613 (1998)", + "42. Jang, Y.K., Cho, N.I.: Generalized product quantization network for semi-supervised image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3420-3429 (2020)", + "43. Jang, Y.K., Cho, N.I.: Self-supervised product quantization for deep unsupervised image retrieval. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12085-12094 (2021)", + "44. Jayaram Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: Diskann: Fast accurate billion-point nearest neighbor search on a single node. Advances in Neural Information Processing Systems 32 (2019)", + "45. Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence 33(1), 117-128 (2010)", + "46. Jégou, H., Douze, M., Schmid, C., Pérez, P.: Aggregating local descriptors into a compact image representation. In: 2010 IEEE computer society conference on computer vision and pattern recognition. pp. 3304-3311. IEEE (2010)", + "47. Johnson, J., Douze, M., Jégou, H.: Billion-scale similarity search with gpus. IEEE Transactions on Big Data 7(3), 535-547 (2019)", + "48. Jun, H., Ko, B., Kim, Y., Kim, I., Kim, J.: Combination of multiple global descriptors for image retrieval. arXiv preprint arXiv:1903.10663 (2019)", + "49. Klein, B., Wolf, L.: End-to-end supervised product quantization for image search and retrieval. In: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5036-5045 (2019). https://doi.org/10.1109/CVPR.2019.00518", + "50. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013)" + ], + "bbox": [ + 225, + 146, + 784, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "51. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Communications of the ACM 60(6), 84-90 (2017)", + "52. Lagunes-Fortiz, M., Damen, D., Mayol-Cuevas, W.: Centroids triplet network and temporally-consistent embeddings for in-situ object recognition. In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10796-10802. IEEE (2020)", + "53. Lee, D., Kim, C., Kim, S., Cho, M., Han, W.S.: Autoregressive image generation using residual quantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11523-11532 (2022)", + "54. Lee, S., Seong, H., Lee, S., Kim, E.: Correlation verification for image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5374-5384 (2022)", + "55. Lew, M.S., Sebe, N., Djeraba, C., Jain, R.: Content-based multimedia information retrieval: State of the art and challenges. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 2(1), 1-19 (2006)", + "56. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023)", + "57. Li, X., Uricchio, T., Ballan, L., Bertini, M., Snoek, C.G., Bimbo, A.D.: Socializing the semantic gap: A comparative survey on image tag assignment, refinement, and retrieval. ACM Computing Surveys (CSUR) 49(1), 1-39 (2016)", + "58. Liu, B., Cao, Y., Long, M., Wang, J., Wang, J.: Deep triplet quantization. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 755-763 (2018)", + "59. Liu, Y., Zhang, D., Lu, G., Ma, W.Y.: A survey of content-based image retrieval with high-level semantics. Pattern recognition 40(1), 262-282 (2007)", + "60. Liu, Z., Cheng, K.T., Huang, D., Xing, E.P., Shen, Z.: Nonuniform-to-uniform quantization: Towards accurate quantization via generalized straight-through estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4942-4952 (2022)", + "61. Liu, Z., Luo, P., Qiu, S., Wang, X., Tang, X.: Deepfashion: Powering robust clothes recognition and retrieval with rich annotations. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1096-1104 (2016)", + "62. Lowe, D.G.: Object recognition from local scale-invariant features. In: Proceedings of the seventh IEEE international conference on computer vision. vol. 2, pp. 1150-1157. Ieee (1999)", + "63. Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence 42(4), 824-836 (2018)", + "64. Martinez, J., Hoos, H.H., Little, J.J.: Stacked quantizers for compositional vector compression. arXiv preprint arXiv:1411.2173 (2014)", + "65. Noh, H., Araujo, A., Sim, J., Weyand, T., Han, B.: Large-scale image retrieval with attentive deep local features. In: Proceedings of the IEEE international conference on computer vision. pp. 3456-3465 (2017)", + "66. Norouzi, M., Fleet, D.J.: Cartesian k-means. In: Proceedings of the IEEE Conference on computer Vision and Pattern Recognition. pp. 3017-3024 (2013)", + "67. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. arXiv preprint arXiv:2203.02155 (2022)" + ], + "bbox": [ + 223, + 146, + 785, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "68. Park, M., Jin, J.S., Wilson, L.S.: Fast content-based image retrieval using quasigabor filter and reduction of image feature dimension. In: Proceedings fifth IEEE southwest symposium on image analysis and interpretation. pp. 178-182. IEEE (2002)", + "69. Qiu, Z., Yao, T., Mei, T.: Deep quantization: Encoding convolutional activations with deep generative model. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 6759-6768 (2017)", + "70. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021)", + "71. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I., et al.: Improving language understanding by generative pre-training (2018)", + "72. Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I., et al.: Language models are unsupervised multitask learners. OpenAI blog 1(8), 9 (2019)", + "73. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022)", + "74. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)", + "75. Razavian, A.S., Sullivan, J., Carlsson, S., Maki, A.: Visual instance retrieval with deep convolutional networks. ITE Transactions on Media Technology and Applications 4(3), 251-258 (2016)", + "76. Ren, J., Zhang, M., Li, D.: Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory. Advances in Neural Information Processing Systems 33, 10672-10684 (2020)", + "77. Revaud, J., Almazán, J., Rezende, R.S., Souza, C.R.d.: Learning with average precision: Training image retrieval with a listwise loss. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5107-5116 (2019)", + "78. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014)", + "79. Shoeybi, M., Patwary, M., Puri, R., LeGresley, P., Casper, J., Catanzaro, B.: Megatron-lm: Training multi-billion parameter language models using model parallelism. arXiv preprint arXiv:1909.08053 (2019)", + "80. Siagian, C., Itti, L.: Rapid biologically-inspired scene classification using features shared with visual attention. IEEE transactions on pattern analysis and machine intelligence 29(2), 300-312 (2007)", + "81. Simeoni, O., Avrithis, Y., Chum, O.: Local features and visual words emerge in activations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11651-11660 (2019)", + "82. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)", + "83. Smeulders, A.W., Worring, M., Santini, S., Gupta, A., Jain, R.: Content-based image retrieval at the end of the early years. IEEE Transactions on pattern analysis and machine intelligence 22(12), 1349-1380 (2000)", + "84. Song, J., He, T., Gao, L., Xu, X., Hanjalic, A., Shen, H.T.: Binary generative adversarial networks for image retrieval. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018)" + ], + "bbox": [ + 225, + 146, + 785, + 839 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 18 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "85. Tan, F., Yuan, J., Ordonez, V.: Instance-level image retrieval using reranking transformers. In: proceedings of the IEEE/CVF international conference on computer vision. pp. 12105-12115 (2021)", + "86. Tay, Y., Tran, V.Q., Dehghani, M., Ni, J., Bahri, D., Mehta, H., Qin, Z., Hui, K., Zhao, Z., Gupta, J., et al.: Transformer memory as a differentiable search index. arXiv preprint arXiv:2202.06991 (2022)", + "87. Teichmann, M., Araujo, A., Zhu, M., Sim, J.: Detect-to-retrieve: Efficient regional aggregation for image search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5109-5118 (2019)", + "88. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017)", + "89. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)", + "90. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)", + "91. Wang, J., Wang, J., Song, J., Xu, X.S., Shen, H.T., Li, S.: Optimized cartesian k-means. IEEE Transactions on Knowledge and Data Engineering 27(1), 180-192 (2014)", + "92. Wang, J., Hua, X.S.: Interactive image search by color map. ACM Transactions on Intelligent Systems and Technology (TIST) 3(1), 1-23 (2011)", + "93. Wang, J., Zhang, T.: Composite quantization. IEEE transactions on pattern analysis and machine intelligence 41(6), 1308-1322 (2018)", + "94. Wang, W., Bao, H., Dong, L., Bjorck, J., Peng, Z., Liu, Q., Aggarwal, K., Mohammed, O.K., Singhal, S., Som, S., et al.: Image as a foreign language: Beit pretraining for all vision and vision-language tasks. arXiv preprint arXiv:2208.10442 (2022)", + "95. Wang, X.Y., Zhang, B.B., Yang, H.Y.: Content-based image retrieval by integrating color and texture features. Multimedia tools and applications 68(3), 545-569 (2014)", + "96. Wang, Y., Hou, Y., Wang, H., Miao, Z., Wu, S., Sun, H., Chen, Q., Xia, Y., Chi, C., Zhao, G., et al.: A neural corpus indexer for document retrieval. arXiv preprint arXiv:2206.02743 (2022)", + "97. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019)", + "98. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: European conference on computer vision. pp. 499-515. Springer (2016)", + "99. Wengert, C., Douze, M., Jégou, H.: Bag-of-colors for improved image search. In: Proceedings of the 19th ACM international conference on Multimedia. pp. 1437-1440 (2011)", + "00. Wieczorek, M., Michalowski, A., Wroblewska, A., Dabrowski, J.: A strong baseline for fashion retrieval with person re-identification models. In: International Conference on Neural Information Processing. pp. 294–301. Springer (2020)", + "01. Wu, C., Liang, J., Ji, L., Yang, F., Fang, Y., Jiang, D., Duan, N.: Niwa: Visual synthesis pre-training for neural visual world creation. In: European Conference on Computer Vision. pp. 720-736. Springer (2022)", + "02. Xia, Y., He, K., Wen, F., Sun, J.: Joint inverted indexing. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 3416-3423 (2013)" + ], + "bbox": [ + 225, + 147, + 784, + 839 + ], + "page_idx": 19 + }, + { + "type": "page_number", + "text": "20", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 19 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 19 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "103. Xiao, T., Li, H., Ouyang, W., Wang, X.: Learning deep feature representations with domain guided dropout for person re-identification. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1249-1258 (2016)", + "104. Xu, Y., Lee, H., Chen, D., Hechtman, B., Huang, Y., Joshi, R., Krikun, M., Lepikhin, D., Ly, A., Maggioni, M., et al.: Gspmd: general and scalable parallelization for ml computation graphs. arXiv preprint arXiv:2105.04663 (2021)", + "105. Yang, M., He, D., Fan, M., Shi, B., Xue, X., Li, F., Ding, E., Huang, J.: Dolg: Single-stage image retrieval with deep orthogonal fusion of local and global features. In: Proceedings of the IEEE/CVF International conference on Computer Vision. pp. 11772-11781 (2021)", + "106. Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R.R., Le, Q.V.: Xlnet: Generalized autoregressive pretraining for language understanding. Advances in neural information processing systems 32 (2019)", + "107. Yu, J., Li, X., Koh, J.Y., Zhang, H., Pang, R., Qin, J., Ku, A., Xu, Y., Baldridge, J., Wu, Y.: Vector-quantized image modeling with improved vqgan. arXiv preprint arXiv:2110.04627 (2021)", + "108. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022)", + "109. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022)", + "110. Yuan, Y., Chen, W., Yang, Y., Wang, Z.: In defense of the triplet loss again: Learning robust person re-identification with fast approximated triplet loss and label distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 354-355 (2020)", + "111. Zhai, A., Wu, H.Y.: Classification is a strong baseline for deep metric learning. arXiv preprint arXiv:1811.12649 (2018)", + "112. Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., Ma, S.: Jointly optimizing query encoder and product quantization to improve retrieval performance. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management. pp. 2487-2496 (2021)", + "113. Zhang, H., Shen, H., Qiu, Y., Jiang, Y., Wang, S., Xu, S., Xiao, Y., Long, B., Yang, W.Y.: Joint learning of deep retrieval model and product quantization based embedding index. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. pp. 1718-1722 (2021)", + "114. Zhang, L., Rui, Y.: Image search—from thousands to billions in 20 years. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 9(1s), 1-20 (2013)", + "115. Zhou, B., Lapedriza, A., Khosla, A., Oliva, A., Torralba, A.: Places: A 10 million image database for scene recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (2017)", + "116. Zhou, C., Po, L.M., Ou, W.: Angular deep supervised vector quantization for image retrieval. IEEE Transactions on Neural Networks and Learning Systems 33(4), 1638-1649 (2020)", + "117. Zhou, K., Yang, Y., Cavallaro, A., Xiang, T.: Omni-scale feature learning for person re-identification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3702-3712 (2019)" + ], + "bbox": [ + 217, + 146, + 785, + 840 + ], + "page_idx": 20 + }, + { + "type": "header", + "text": "IRGen: Generative Modeling for Image Retrieval", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 20 + }, + { + "type": "page_number", + "text": "21", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 20 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "118. Zhou, W., Li, H., Tian, Q.: Recent advance in content-based image retrieval: A literature survey. arXiv preprint arXiv:1706.06064 (2017)", + "119. Zhu, H., Long, M., Wang, J., Cao, Y.: Deep hashing network for efficient similarity retrieval. In: Proceedings of the AAAI conference on Artificial Intelligence. vol. 30 (2016)" + ], + "bbox": [ + 217, + 146, + 785, + 215 + ], + "page_idx": 21 + }, + { + "type": "page_number", + "text": "22", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 21 + }, + { + "type": "header", + "text": "Y. Zhang et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 21 + } +] \ No newline at end of file diff --git a/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_model.json b/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_model.json new file mode 100644 index 0000000000000000000000000000000000000000..97b8a938e76082c7ba315e362c6850b2d767a1d9 --- /dev/null +++ b/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_model.json @@ -0,0 +1,3071 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.221, + 0.142, + 0.782, + 0.163 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "text", + "bbox": [ + 0.238, + 0.189, + 0.765, + 0.237 + ], + "angle": 0, + "content": "Yidan Zhang\\(^{12}\\), Ting Zhang\\(^{1*}\\), Dong Chen\\(^{3}\\), Yujing Wang\\(^{3}\\), Qi Chen\\(^{3}\\), Xing Xie\\(^{3}\\), Hao Sun\\(^{3}\\), Weiwei Deng\\(^{3}\\), Qi Zhang\\(^{3}\\), Fan Yang\\(^{3}\\), Mao Yang\\(^{3}\\), Qingmin Liao\\(^{5}\\), Jingdong Wang\\(^{4}\\), and Baining Guo\\(^{3}\\)" + }, + { + "type": "text", + "bbox": [ + 0.236, + 0.246, + 0.768, + 0.277 + ], + "angle": 0, + "content": "1Beijing Normal University 2The University of Tokyo 3Microsoft 4Baidu 5Shenzhen International Graduate School, Tsinghua University" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.33, + 0.744, + 0.594 + ], + "angle": 0, + "content": "Abstract. While generative modeling has become prevalent across numerous research fields, its integration into the realm of image retrieval remains largely unexplored and underjustified. In this paper, we present a novel methodology, reframing image retrieval as a variant of generative modeling and employing a sequence-to-sequence model. This approach is harmoniously aligned with the current trend towards unification in research, presenting a cohesive framework that allows for end-to-end differentiable searching. This, in turn, facilitates superior performance via direct optimization techniques. The development of our model, dubbed IRGen, addresses the critical technical challenge of converting an image into a concise sequence of semantic units, which is pivotal for enabling efficient and effective search. Extensive experiments demonstrate that our model achieves state-of-the-art performance on three widely-used image retrieval benchmarks as well as two million-scale datasets, yielding significant improvement compared to prior competitive retrieval methods. In addition, the notable surge in precision scores facilitated by generative modeling presents the potential to bypass the reranking phase, which is traditionally indispensable in practical retrieval workflows. The code is publicly available at https://github.com/yakt00/IRGen." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.607, + 0.741, + 0.621 + ], + "angle": 0, + "content": "Keywords: Image Retrieval \\(\\cdot\\) Autoregressive Model \\(\\cdot\\) Generative Model" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.648, + 0.377, + 0.663 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.68, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Generative modeling has made significant progress in a wide range of tasks including machine translation [89], conversational modeling [1, 12, 28, 67], image captioning [108], image classification [17], text-to-image synthesis [30, 73], and many more. Originating from language and then expanding to other modalities with specially designed tokenizers, such a universal modeling approach provides a promising direction for unifying different tasks into a versatile pretrained model, which has attracted widespread attention [2, 56, 67, 94]. Yet its potential in image retrieval has been unexplored. This paper aims to take the unified trend one step further and investigates generative modeling for image retrieval." + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.826, + 0.551, + 0.84 + ], + "angle": 0, + "content": "*Corresponding author: tingzhang@bnu.edu.cn." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.374, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "A practical retrieval system generally consists of two stages: feature representation learning [33, 54, 60, 105] and Approximate Nearest Neighbor (ANN) search [6, 18, 39, 47]. Most image retrieval methods focus only on one individual stage while ignoring the fact that both stages are inherently and deeply connected in actual service. Thus, the practical system often requires careful per-task hyperparameter tuning to make the most out of the coordination of the feature extraction and ANN search. While some efforts have been dedicated to joint learning of embedding and compression (or indexing), such as deep quantization / hashing [16, 19, 49, 112, 113], they still rely on a post process conducting non-exhaustive search." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.301, + 0.788, + 0.438 + ], + "angle": 0, + "content": "In this paper, we cast image retrieval as a form of generative modeling and utilize standard Transformer architecture, as in GPT [12, 71, 72], to enable end-to-end differentiable search. Our model, IRGen, is a sequence-to-sequence model that directly generates identifiers corresponding to the given query image's nearest neighbors. Specifically, the model takes a query image as input and autoregressively predicts discrete visual tokens, which are considered as the identifier of an image. The predicted visual tokens are supposed to point to the query image's nearest neighbor. As such, IRGen can be trained directly from the final retrieval target starting with raw images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.788, + 0.561 + ], + "angle": 0, + "content": "Two fundamental concerns need to be addressed to enable efficient and effective image retrieval using generative modeling. First, autoregressive generative modeling is notable for its slow inference speed due to the inherently sequential nature, thus the run-time cost for retrieval increases quadratically with the length of the input sequence. Second, it is particularly difficult to model the semantic relationship between the identifiers if we drastically shortened the image identifier. Therefore, a semantic tokenizer specially designed for image retrieval is an immediate problem." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.565, + 0.788, + 0.716 + ], + "angle": 0, + "content": "We observe that existing image tokenizers [53, 88], intended for image generation, are not suitable for image retrieval task, leading to poor performance as we will demonstrate in our experiments. We hence propose several key ingredients that first inject semantic information by applying image-level supervision rather than pixel-level reconstructive supervision, then generate dependent tokens in a sequence by leveraging the recursive property of residual quantization, and lastly ensure fast inference speed by tremendously reducing the length of the sequence via exploiting the global feature instead of spatial patch embeddings. Afterwards, we intentionally adopt the standard Transformer architecture so that we could scale up the model using existing techniques and infrastructures." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The proposed IRGen achieves state-of-the-art performance across a diverse range of image retrieval datasets, owing to its end-to-end differentiable search capability. A comprehensive empirical study over three image retrieval benchmarks proves that our model is superior to prior state-of-the-art baselines, sometimes even surpassing linear scan search methods. For instance, compared with the best baseline method, including linear scan search, our model achieves remarkable improvement, such as a \\(20.2\\%\\) increase in precision@10 on In-shop Clothes [61], a \\(6.0\\%\\) boost in precision@2 on CUB200 [90] and a \\(2.4\\%\\) enhancement in preci" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "sion@2 on Cars196 [50]. To assess the scalability of our model, we further experiment on million-level datasets, namely ImageNet [27] and Places365 [115], and consistently demonstrate superior performance in these challenging scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.193, + 0.785, + 0.344 + ], + "angle": 0, + "content": "It is our belief that generative models have the potential to redefine the landscape of image retrieval. The application of generative modeling to image retrieval tasks represents an exciting opportunity to unify information retrieval across various modalities. At a technical level, our model, IRGen, effortlessly bridges the gap between feature representation learning and approximate nonexhaustive search (bypassing vector compression), creating an end-to-end differentiable framework that enables direct optimization based on ultimate retrieval goal. Furthermore, the entire framework is conceptually straightforward, with all components relying on the standard Transformer architecture, renowned for its remarkable scalability [21,32,79,104]." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.345, + 0.5, + 0.358 + ], + "angle": 0, + "content": "Our contributions are concluded as:" + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.371, + 0.784, + 0.431 + ], + "angle": 0, + "content": "* To the best of our knowledge, our work represents the first effort in employing a sequence-to-sequence generative model to address image retrieval in a fully end-to-end manner that directly generates the nearest neighbor's identifier given the query." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.432, + 0.784, + 0.507 + ], + "angle": 0, + "content": "* We introduce a semantic image tokenizer explicitly designed for image retrieval to obtain image identifiers, facilitating autoregressive training. It is essential to note that this tokenizer differs significantly from previous quantization models, as our identifier solely represents the image and is not employed for distance computation, as is the case in quantization." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.508, + 0.784, + 0.568 + ], + "angle": 0, + "content": "* Extensive experiments show that our approach exhibits substantial improvements, achieving new state-of-the-art results. We have demonstrated its scalability to million-scale datasets and provided throughput number, showcasing its near-real-time performance." + }, + { + "type": "list", + "bbox": [ + 0.228, + 0.371, + 0.784, + 0.568 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.595, + 0.388, + 0.61 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.844 + ], + "angle": 0, + "content": "Image retrieval. Traditionally, hand-crafted features are heuristically designed to describe the image content based on its color [92, 99], texture [68, 95] or shape [14]. Typical features include GIST [80], SIFT [62], SURF [8], VLAD [46] and so on. Recent years have witnessed the explosive research on deep learning based features trained over labeled images. Besides the evolvement of the network architecture designs [40, 51, 89], numerous efforts [33, 100] have been dedicated to various loss functions including classification loss [111, 117], triplet loss [110], contrastive loss [33, 48], center loss [100] and so on. The similarity is calculated through distance measure between features or evaluated through re-ranking techniques [77]. Another different line of research centers on approximate nearest neighbor search to speed up the search process, accepting a certain level of compromise in search accuracy. One way is to enable fast distance computation through hashing or quantization techniques such as LSH [41], min-Hash [22], ITQ [37], PQ [45], and many others [36, 93, 119]. The other way is to reduce the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.268 + ], + "angle": 0, + "content": "number of distance comparison by retrieving a small number of candidates. Typical methods include partition-based indexing [6, 102] that partitions the feature space into non-overlapping clusters and graph-based indexing [44] that builds a neighborhood graph with edges connecting similar images. To improve the recall rate while ensuring fast search speed, hierarchical course-to-fine strategy [63] has been the popular choice that the retrieved candidates are refined level by level. Additionally, a number of works have introduced hybrid indexing [18], leveraging the best of both indexing schemes while avoiding their limitations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.268, + 0.788, + 0.493 + ], + "angle": 0, + "content": "Generative modeling. Deep autoregressive networks are generative sequential models that assume a product rule for factoring the joint likelihood and model each conditional distribution through a neural network. AR models have shown powerful progress in generative tasks across multiple domains such as image [17, 109], text [72, 106], audio [23, 29], and video [97, 101]. The key component involves linearizing data into a sequence of symbols with notable works such as VQ-VAE [88], RQ-VAE [53]. Recently, a number of works [25, 86, 96] further explored AR model to empower entity retrieval and document retrieval. Most related to our work are NCI [96] and DSI [86], which are concerned with document retrieval. However, these approaches utilize hierarchical k-means clustering applied to document embeddings derived from a small pretrained language model to obtain document identifiers. In contrast, we put forward a novel approach that involves learning the identifier directly from semantic supervision, and showcase its effectiveness in the context of image retrieval. We posit that this discovery can also be advantageous for document retrieval tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.494, + 0.788, + 0.706 + ], + "angle": 0, + "content": "Joint learning. There is a growing interest [19,42,43,112] in the study of joint learning to improve search accuracy. For example, JPQ [113] jointly learns the deep retrieval model (equivalent to an embedding model) and the embedding index (compression). DQN [16] combines PQ and embedding learning but does not optimize the PQ clusters. DPQ [49] incorporates PQ clusters for supervised joint learning, specifically targeting image retrieval. HashGAN [31] and BGAN [84] adversarially learn binary hash codes jointly with the embedding model in an unsupervised way. However, all these prior works focus on end-to-end training of encoding and compression together while overlooking the indexing part (meaning non-exhaustive search), which is challenging to formulate as differentiable. They leverage quantization (compression index) for distance approximation but still rely on linear scan in their experiments. In contrast, our approach reframes retrieval as a completely novel end-to-end task, eliminating explicit distinctions between embedding, compression, and indexing." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.727, + 0.331, + 0.743 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.757, + 0.48, + 0.772 + ], + "angle": 0, + "content": "3.1 Semantic Image Tokenizer" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "As Transformer becomes the ubiquitous architecture in computer vision, it has emerged many successful image tokenizers such as VQ-VAE [35,74,88,107], RQ-VAE [53] and so on. Despite its success in image generation, they may not be well-suited for the retrieval task for several reasons. First, the process of" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.312 + ], + "angle": 0, + "content": "decoding latent codes to reconstruct raw images is essential for generating images in synthesis tasks but is redundant for retrieval tasks. Second, the autoregressive model's inference speed is heavily influenced by the length of the code sequence, where a shorter sequence is vital for efficient searching in our context. Presently, code sequences tend to be lengthy (for example, an \\(8 \\times 8\\) feature map with a depth of 4 in RQ-VAE leads to a sequence of 256), underscoring the need to significantly reduce sequence length. Moreover, retrieval tasks require the embedding of semantic information within the latent codes. However, the current approach to learning latent codes through image reconstruction loss primarily captures low-level details, such as inconsequential local nuances and noise, which may not be beneficial for retrieval." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.785, + 0.48 + ], + "angle": 0, + "content": "Building on the insights mentioned earlier, we suggest investigating the global feature extracted from the class token, rather than relying on the default spatial tokens. This approach offers a substantial reduction in sequence length, reducing it from 64 tokens to a single token. Moreover, as a result of this approach, the class token inherently contains a condensed, high-level semantic representation. Let \\(\\mathbf{f}_{cls}\\) denote the \\(d\\)-dimensional feature vector outputted from the class token, which is taken as the image representation. We adopt residual quantization (RQ) or stacked composite quantization to approximate this feature. Suppose there are \\(M\\) codebooks with each containing \\(L\\) elements, \\(\\mathcal{C}_m = \\{\\mathbf{c}_{m1},\\dots ,\\mathbf{c}_{mL}\\}\\), RQ recursively maps the embedding \\(\\mathbf{f}_{cls}\\) to a sequentially ordered \\(M\\) codes, \\(\\mathbf{f}_{cls} \\rightarrow \\{l_1,l_2,\\dots ,l_M\\} \\in [\\mathbb{L}]^M\\). Let \\(\\mathbf{r}_0 = \\mathbf{f}_{cls}\\), we have" + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.493, + 0.785, + 0.51 + ], + "angle": 0, + "content": "\\[\nl _ {m} = \\arg \\min _ {l \\in [ \\mathbb {L} ]} \\| \\mathbf {r} _ {m - 1} - \\mathbf {c} _ {m l} \\| _ {2} ^ {2}, \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.369, + 0.515, + 0.785, + 0.53 + ], + "angle": 0, + "content": "\\[\n\\mathbf {r} _ {m} = \\mathbf {r} _ {m - 1} - \\mathbf {c} _ {m l _ {m}}, m = 1, 2, \\dots , M. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.542, + 0.784, + 0.601 + ], + "angle": 0, + "content": "The process of sequentially generating discrete codes is inherently compatible with sequential autoregressive generation. This alignment helps alleviate the optimization challenges associated with modeling the relationships within identifiers. A figure illustrating the image tokenizer can be seen in the supplementary." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.603, + 0.784, + 0.692 + ], + "angle": 0, + "content": "To further inject semantic prior, we propose to train the network under classification loss over both the original embeddings as well as the reconstructed embeddings. In particular, we consider a series of reconstruction levels denoted as \\(\\hat{\\mathbf{f}}_{cls}^{\\leq m} = \\sum_{i=1}^{m} \\mathbf{c}_{il_i}, m = 1,2,\\dots,M\\). Each prefix code thus encodes semantic information to a certain degree. Adding up the \\(M\\) levels of partial reconstruction error, the complete objective function is then formulated as," + }, + { + "type": "equation", + "bbox": [ + 0.325, + 0.707, + 0.785, + 0.746 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {c l s} (\\mathbf {f} _ {c l s}) + \\lambda_ {1} \\sum_ {m = 1} ^ {M} \\mathcal {L} _ {c l s} \\left(\\hat {\\mathbf {f}} _ {c l s} ^ {\\leq m}\\right) + \\lambda_ {2} \\sum_ {m = 1} ^ {M} \\| \\mathbf {r} _ {m} \\| _ {2} ^ {2}, \\tag {3}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.324, + 0.751, + 0.785, + 0.768 + ], + "angle": 0, + "content": "\\[\n\\mathbf {r} _ {m} = \\mathbf {f} _ {c l s} - \\operatorname {s g} \\left[ \\hat {\\mathbf {f}} _ {c l s} ^ {\\leq m} \\right], m = 1, 2, \\dots , M, \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.784, + 0.84 + ], + "angle": 0, + "content": "where \\(\\mathcal{L}_{cls}\\) is the softmax cross-entropy loss and \\(\\mathrm{sg}[\\cdot ]\\) is the stop gradient operator. During training, we adopt alternative optimization to update the codebook and the network. For computing the gradient of \\(\\mathcal{L}_{cls}(\\hat{\\mathbf{f}}_{cls}^{\\leq m})\\), we follow the straight-through estimator [9] as in [88]. After optimization, we hope that images with" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.374, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "similar classes have close codes. In the experiments, we present comparison with other discrete identifiers including random codes and codes from hierarchical k-means algorithm as well as from RQ-VAE." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.216, + 0.643, + 0.232 + ], + "angle": 0, + "content": "3.2 Encoder-Decoder for Autoregressive Retrieval" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.243, + 0.789, + 0.439 + ], + "angle": 0, + "content": "Once we have established a robust discrete latent structure equipped with semantic prior information, our next step is to train a powerful autoregressive sequence-to-sequence model solely on these discrete random variables without referring their visual content. Our encoder-decoder architecture decouples the input embedding from the generation of discrete codes. The training process involves image pairs \\((x_{1},x_{2})\\), where \\(x_{2}\\) is the nearest neighbor of \\(x_{1}\\). Our model's objective is to predict the identifiers of \\(x_{2}\\) when given \\(x_{1}\\) as input. This setup allows the model to learn the semantic relationships between images in the dataset. The left of Fig. 1 provides a concise view of our training pipeline. After training, the model begins by taking a query image as input to obtain the query embedding, which is decoded to the discrete codes. It is worth noting that the yielded discrete codes represent the query's nearest neighbor images within the database rather than for the query." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.44, + 0.79, + 0.622 + ], + "angle": 0, + "content": "To be specific, let the encoder be denoted as \\(\\mathbb{E}\\) based on the ViT base architecture and the decoder be \\(\\mathbb{D}\\), a standard Transformer that includes causal self-attention, cross-attention and MLP layers. We leverage the spatial tokens outputted from the encoder as the input embedding, \\(\\mathbf{e} = \\mathbb{E}(x_1)\\), which is injected into the decoder through cross attention. Our training objective involves predicting the next token in the image identifier sequence. Specifically, we aim to maximize the probability of the \\(i\\)-th token of the image identifier given the input embedding and the previously predicted tokens, \\(p(l_i|x_1,l_1,\\dots ,l_{i - 1},\\theta)\\), where \\(\\theta\\) denotes the parameters of both \\(\\mathbb{D}\\) and \\(\\mathbb{E}\\), and \\(l_{1},l_{2},\\dots ,l_{M}\\) are the \\(M\\) tokens that make up the image identifier for \\(x_{2}\\), generated by the image tokenizer. By maximizing the probability of each token, we effectively maximize the likelihood of generating the image identifier of an image," + }, + { + "type": "equation", + "bbox": [ + 0.329, + 0.634, + 0.787, + 0.674 + ], + "angle": 0, + "content": "\\[\np \\left(l _ {1}, \\dots , l _ {M} \\mid x _ {1}, \\theta\\right) = \\prod_ {m = 1} ^ {M} p \\left(l _ {i} \\mid x _ {1}, l _ {1}, \\dots , l _ {m - 1}, \\theta\\right). \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.684, + 0.788, + 0.715 + ], + "angle": 0, + "content": "We apply a softmax cross-entropy loss on a vocabulary of \\( M \\) discrete tokens during training." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.738, + 0.373, + 0.753 + ], + "angle": 0, + "content": "3.3 Beam Search" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.843 + ], + "angle": 0, + "content": "During inference, given a query image \\(\\mathbf{q}\\), we first calculate the query embedding processed by the encoder \\(\\mathbb{E}\\) and then generate discrete codes through the decoder \\(\\mathbb{D}\\) based on the query embedding in an autoregressive manner. These discrete codes represent an image that is considered as the nearest neighbor to the query image. This illustrates the process of Top-1 retrieval by generating" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.154, + 0.77, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.268, + 0.788, + 0.325 + ], + "angle": 0, + "content": "Fig. 1: The left of the figure illustrates the training pipeline of encoder-decoder architecture for autoregressive retrieval. The training objective is to autoregressively predict the identifier of the query's nearest neighbor image. The right of the figure illustrates the procedure of beam search with code length is 2 and beam size K is 3." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.342, + 0.784, + 0.388 + ], + "angle": 0, + "content": "the sequence codes one by one according to the argmax probability. To perform Top-K retrieval, our model utilize beam search integrated into the generating process, allowing us to find the top- \\( K \\) images that are the closest matches." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.392, + 0.789, + 0.558 + ], + "angle": 0, + "content": "As illustrated in right of Fig. 1, this procedure begins by defining a beam size, denoted as \\( \\mathrm{K} \\) in our case. Initially, the beam comprises the start-of-sequence token, and the algorithm extends the current set of candidate sequences by considering the next potential tokens in the sequence. For each candidate sequence, the algorithm outputs probabilities for multiple potential next tokens and adds them to the beam. The expanded set of sequences is then scored based on the probabilities assigned by the model, which are computed as the product of the probabilities associated with their individual elements. The top-k sequences with the highest scores are retained, while the others are discarded. This selection process, which can be implemented with a priority queue in linear time with the candidate list size, is repeated until the last token is decoded." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.564, + 0.789, + 0.701 + ], + "angle": 0, + "content": "It's important to note that not all generated identifiers are necessarily valid, meaning that an identifier belonging to the set \\([\\mathbb{L}]^{M}\\) may not correspond to any images within the retrieval database. Therefore, we must validate the generated image identifier at each step, which can be a time-consuming process. However, we address this challenge by constructing a prefix tree containing valid codes. In the case of beam search with a prefix tree, the search process is constrained to only consider valid next tokens, as determined by the prefix tree, rather than all the possible next tokens. This constraint ensures that the search process results in valid images, largely enhancing the efficiency of the retrieval process." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Beam search vs. ANN search. Indeed, beam search can be regarded as a tree-based manner to perform approximate nearest neighbor (ANN) search. However, compared to prior methods, there is a significant difference in how they calculate the score to choose the current node. Traditional methods usually rely on calculating the distance between the query feature and the node's associated feature, using a predefined distance metric to determine the score. Conversely, in beam search, the score or likelihood is produced by a differentiable neural network conditioned on the query. This distinction allows the retrieval process to be refined end-to-end." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Precision comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. Our model adopts beam search for retrieval, achieving significant improvement and performing even better than linear scan search." + }, + { + "type": "table", + "bbox": [ + 0.241, + 0.222, + 0.765, + 0.536 + ], + "angle": 0, + "content": "
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.710.27.15.846.843.639.934.925.922.018.515.4
CLIP57.522.816.614.166.063.559.453.870.867.863.357.2
CGD(repro)83.247.840.237.076.775.573.771.487.186.184.682.6
\\( IRT_R(repro) \\)92.759.651.147.679.377.775.071.475.673.168.361.7
FT-CLIP91.466.858.955.479.277.676.073.288.487.787.185.8
Faisss IVF PQ search
CGD(repro)60.430.524.522.071.670.869.968.784.884.484.183.3
\\( IRT_R(repro) \\)68.635.729.326.668.967.666.263.459.157.554.751.7
FT-CLIP63.737.030.728.072.672.171.269.786.586.386.286.0
ScaNN search
CGD(repro)83.047.740.337.276.775.273.871.487.186.184.582.6
\\( IRT_R(repro) \\)92.058.250.046.679.377.775.171.475.472.868.161.6
FT-CLIP90.464.656.953.579.277.576.073.288.387.787.185.8
SPANN search
CGD(repro)83.047.740.337.176.775.573.771.487.086.184.682.6
\\( IRT_R(repro) \\)91.456.247.944.579.377.675.071.474.872.467.661.1
FT-CLIP90.262.955.151.878.577.676.073.288.688.187.586.3
Beam search
IRGen (ours)92.487.086.686.582.782.783.082.890.189.990.290.5
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.549, + 0.377, + 0.566 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.583, + 0.787, + 0.628 + ], + "angle": 0, + "content": "We evaluate our method on common image retrieval datasets and on two large-scale datasets, ImageNet [27] and Places365 [115]. For a detailed description of the datasets and implementation details, please refer to the supplementary." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.788, + 0.794 + ], + "angle": 0, + "content": "Baselines. We evaluate our model's performance in comparison to five competitive baselines: 1) ResNet-101 [40] trained from ImageNet dataset, denoted as Res101-Img, which is commonly used as a feature extraction tool for various tasks; 2) CLIP [70] trained on 400M image-text pairs, known for powerful zero-shot capability; 3) CGD [48], a state-of-the-art method based on ResNet; 4) IRT [33], a Transformer-based model for image retrieval and we use the best-performing model \\(\\mathrm{IRT}_{\\mathbb{R}}\\); 5) FT-CLIP, a baseline finetuned from CLIP on the target dataset. For both CGD and IRT, we have reproduced these models to ensure consistent data processing and comparable model sizes. Specifically, we use ResNet-101 for CGD and DeiT-B for IRT. We also provide their best results from their original papers for reference." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Search process. The baseline models primarily focus on effective feature learning. After training, these models are utilized to extract features for the database images. During the search process, a given query image is initially passed through" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.228 + ], + "angle": 0, + "content": "Table 2: Recall comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. we include the best result of CGD and IRT from their original papers for context with * denotation. Our model adopt beam search for retrieval, achieving comparable performance in most cases." + }, + { + "type": "table", + "bbox": [ + 0.241, + 0.236, + 0.765, + 0.551 + ], + "angle": 0, + "content": "
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.755.962.766.846.859.971.780.825.935.64759.7
CLIP57.583.087.589.766.078.187.793.570.882.691.195.9
CGD*91.998.198.799.079.286.692.095.194.897.198.298.8
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}^{ * } \\)91.998.198.799.076.685.091.194.3----
FT-CLIP91.497.398.198.579.285.089.392.088.490.592.593.8
Faisss IVF PQ search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)60.476.077.177.471.677.481.584.284.888.089.891.0
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)68.679.280.080.268.977.985.089.359.170.478.283.4
FT-CLIP63.770.771.171.272.678.082.385.286.586.987.287.5
ScaNN search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)83.094.896.296.776.783.588.091.887.191.794.696.6
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)92.097.898.398.479.386.891.994.775.484.790.995.0
FT-CLIP90.495.996.696.979.285.089.292.788.390.592.493.7
SPANN search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)83.095.096.496.976.783.487.991.887.091.794.696.7
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)91.497.297.697.779.386.891.994.774.884.390.594.7
FT-CLIP90.295.896.797.078.585.089.492.988.690.792.594.2
Beam search
IRGen (ours)92.496.897.697.982.786.489.291.490.192.193.293.7
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.565, + 0.788, + 0.747 + ], + "angle": 0, + "content": "the model to obtain its query feature. Subsequently, this query feature is compared with the features of database images using a specific distance metric. Following the conventions established in previous works such as [33, 48, 70], we employ the cosine distance for the CLIP model and the Euclidean distance for the other baseline models. We evaluate two search strategies: linear scan search (K-nearest neighbors or KNN) and approximate nearest neighbor search (ANN). Linear scan search is known for its accuracy but is computationally intensive. In contrast, ANN is significantly more efficient. For ANN, we explore: (i) the popular Faiss IVF PQ [47]; (ii) the state-of-the-art memory-based algorithm ScaNN [39] with the default setting; and (iii) the state-of-the-art disk-based SPANN algorithm [18]. These evaluation strategies allow us to assess the retrieval performance of our model against a variety of search methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.769, + 0.325, + 0.784 + ], + "angle": 0, + "content": "4.1 Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Tab. 1 presents a detailed performance comparison in terms of precision@ \\( K \\), which assesses the percentage of retrieved candidates that share the same class as the query among the top \\( K \\) results. Our model consistently outperforms all" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.374, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.328 + ], + "angle": 0, + "content": "other models, even surpassing those employing linear scan search. Notably, we achieve remarkable improvements, such as a \\(20.2\\%\\) boost in precision@10 on the In-shop Clothes dataset, a \\(6.0\\%\\) increase in precision@2 on the CUB200 dataset, and a \\(2.4\\%\\) gain in precision@2 on the Cars196 dataset. Furthermore, several observations can be made: 1) Finetuned models, tailored to specific datasets, exhibit significantly better performance compared to off-the-shelf feature extractors like CLIP and ImageNet-pretrained ResNet-101. 2) Generally, models equipped with ANN algorithms perform slightly worse than their counterparts using linear scan search. However, there are exceptions, such as FT-CLIP with SPANN search on the Cars196 dataset, which demonstrates the importance of end-to-end optimization. 3) Our model consistently maintains high precision scores as \\(K\\) increases, while other models experience a substantial drop." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.332, + 0.788, + 0.605 + ], + "angle": 0, + "content": "Tab. 2 provides a comparison of different models using the Recall@K metric. Recall@K measures the proportion of queries for which at least one image among the top \\( K \\) retrieved candidates shares the same label as the query image, yielding a score of 1 if true and 0 otherwise. The table also includes the best recall results of CGD and IRT from their respective original papers for reference. It's important to note that these models may have different data preprocessing, model sizes, and additional training techniques. Here are the key observations: 1) Our IRGen model achieves the highest Recall@1 score compared to all other models. However, for other recall scores, our model performs similarly or slightly worse. This discrepancy may arise from the current objective loss used in autoregressive models, which heavily optimizes for Recall@1 while giving less emphasis to other recall values. One potential solution is to incorporate the beam search process into training for joint optimization. 2) Different combinations of feature extractors and ANN algorithms exhibit significant variations across the three datasets, highlighting the challenges of achieving coordination in practical scenarios. 3) Notably, despite the high recall achieved by baselines, they often require an additional re-ranking stage to improve precision, whereas our model already attains high precision scores without the need for re-ranking." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.609, + 0.788, + 0.79 + ], + "angle": 0, + "content": "Fig. 2 illustrates the precision-recall curve, where recall represents the true positive rate. Our approach, IRGen, consistently delivers outstanding performance, maintaining high precision and recall simultaneously. In addition to precision-recall analysis, we evaluate our model using the mean reciprocal rank (MRR) metric, which measures the inverse of the rank of the first relevant item. We compute MRR for four different values: 1, 2, 4, and 8, and display the corresponding curves in Fig. 3. The baselines employ the SPANN retrieval algorithm. Our IRGen model consistently outperforms the baselines across all evaluated metrics, confirming the effectiveness of our framework. Notably, there is significant variability in the performance gap between each baseline and our model across the three datasets, highlighting the challenges and dataset-dependent nature of retrieval tasks." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.795, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Results on million-level datasets. We further experiment our approach with ImageNet dataset [27] that contains 1,281,167 images and Places365-Standard [115] containing about \\(1.8M\\) images from 365 scene categories. We compare with" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.149, + 0.402, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.422, + 0.237, + 0.445, + 0.251 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.446, + 0.149, + 0.609, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.629, + 0.237, + 0.648, + 0.251 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image", + "bbox": [ + 0.65, + 0.149, + 0.812, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.262, + 0.785, + 0.29 + ], + "angle": 0, + "content": "Fig. 2: Precision-Recall (TPR) curve comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.299, + 0.402, + 0.4 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.423, + 0.3, + 0.605, + 0.4 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.629, + 0.3, + 0.808, + 0.4 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.411, + 0.785, + 0.44 + ], + "angle": 0, + "content": "Fig. 3: MRR with respect to 1,2,4,8 comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.587 + ], + "angle": 0, + "content": "the strong baselines including CLIP model as well as FT-CLIP model finetuned based on CLIP model. The comparison is reported in Fig. 4 and Tab. 3, focusing on precision@K and MAP@100. Our IRGen model consistently outperforms the baselines, achieving the best results in terms of precision@K and MAP@100. The precision values for our model remain consistently high as \\( K \\) increases, while the baselines experience noticeable performance degradation. These results confirm the effectiveness of our model in handling large-scale datasets like ImageNet, where it maintains high precision across varying values of \\( K \\) and outperforms the baseline models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.59, + 0.788, + 0.726 + ], + "angle": 0, + "content": "Comparison to supervised deep quantization methods. We make the comparison with recent supervised deep quantization methods on ImageNet, including the state-of-the-art methods ADSVQ [116] and DPQ [49]. Notably, these methods exclusively utilize 100 classes from ImageNet, as indicated in their original papers, making it a substantially easier case. According to the original paper, DPQ [49] employed ResNet-50 (25.56M parameters), ADSVQ [116] utilized AlexNet (60.3M parameters), and DTQ [58] also used AlexNet. To ensure fair comparison, we employ a smaller network, ViT-S (22.1M parameters) and rerun over 100 classes. Tab. 4 illustrates the superiority of our approach." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.752, + 0.342, + 0.765 + ], + "angle": 0, + "content": "4.2 Ablations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The effect of identifiers. In our study of image identifiers, we compared four different approaches: (1) assigning random identifiers to images, (2) hierarchical k-means (HKM), (3) Product Quantization (PQ) and (4) using the image tokenizer RQ-VAE [11]. The results of this comparison are summarized in Tab. 6." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.241, + 0.145, + 0.761, + 0.187 + ], + "angle": 0, + "content": "Table 3: MAP@100 on two million- Table 4: MAP@1000 for 32 bits level datasets. The results of CLIP and (equivalent to the length of our identiFT-CLIP are retrieved by SPANN. -fier) comparison on ImageNet dataset." + }, + { + "type": "table", + "bbox": [ + 0.242, + 0.199, + 0.774, + 0.278 + ], + "angle": 0, + "content": "
ModelDatasetMethodMAP@1000 for 32 bits
ImageNetPlaces365DTQ [58]68.12
CLIP44.122.1ADSVQ [116]75.21
FT-CLIP65.530.3DPQ [49]87.70
IRGen(Ours)76.044.3IRGen(Ours)93.52
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.292, + 0.786, + 0.32 + ], + "angle": 0, + "content": "Table 5: Generalize to new data. We split \\(5\\%\\) of the training data from the ImageNet dataset for inference and remained unseen during training." + }, + { + "type": "table", + "bbox": [ + 0.34, + 0.326, + 0.665, + 0.387 + ], + "angle": 0, + "content": "
ModelPrecision
110100
FT-CLIP + Linear Scan70.665.055.6
IRGen (Ours)77.077.977.4
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.402, + 0.787, + 0.643 + ], + "angle": 0, + "content": "The random assignment of identifiers to images yielded expectedly lower performance. This performance gap can be attributed to the fact that models with random identifiers need to learn not only the interaction between queries and image identifiers but also allocate capacity to learn relationships within the identifiers themselves. On the other hand, HKM showed superior performance compared to random assignment, underscoring the significance of semantic identifiers. However, our proposed semantic image identifiers demonstrated a clear improvement over HKM, highlighting their effectiveness in enhancing retrieval performance. PQ codes perform worse than the random assigned identifiers. This underperformance may stem from the model's challenges in constructing semantic information from PQ codes, which might be incompatible with autoregressive prediction mechanism. This highlights the significance of our sequence order in autoregressive training process. In contrast, the performance of RQ-VAE significantly trailed behind our model, with a performance less than 10 percent. We attribute this difference to the sequence length in RQ-VAE which is too long for the model to effectively capture relationships within the identifiers." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Generalize to new data. Addressing the inclusion of fresh data holds particular significance, especially in the context of search scenarios. To assess this capacity, we conduct an experiment where we intentionally withheld \\(5\\%\\) of the training data from the ImageNet dataset during the training phase and introduced it during inference, all without updating the existing codebook and AR model. In this experiment, we compare our model with the formidable baseline FT-CLIP, which is equipped with a linear scan search. The results, as displayed in Tab. 5, reveal that our model maintains superior performance even when confronted with new data. This observation highlights our model's ability to effectively generalize to previously unseen data. In scenarios where more new data come in with vastly different semantic structure, leading to the distribution of gallery data change drastically, all data-dependent component such as embedding model as well as joint learning methods including IRGen, have to" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.227, + 0.146, + 0.495, + 0.307 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.145, + 0.776, + 0.307 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.239, + 0.306, + 0.761, + 0.32 + ], + "angle": 0, + "content": "Fig. 4: Precision comparison on large scale datasets: ImageNet and Places365." + }, + { + "type": "table_caption", + "bbox": [ + 0.297, + 0.337, + 0.704, + 0.351 + ], + "angle": 0, + "content": "Table 6: Ablation study on the image identifier (T=length)." + }, + { + "type": "table", + "bbox": [ + 0.284, + 0.359, + 0.721, + 0.477 + ], + "angle": 0, + "content": "
IdentifierTPrecisionRecall
11020301102030
Random487.675.470.868.387.695.196.096.1
\\( \\mathrm{HKM}_{100} \\)488.280.078.277.387.293.194.395.0
\\( \\mathrm{HKM}_{200} \\)389.081.679.879.089.093.994.995.8
\\( \\mathrm{HKM}_{500} \\)289.581.779.878.989.595.396.597.0
PQ473.866.161.859.273.890.293.394.5
Ours492.189.789.589.592.196.897.597.7
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.491, + 0.785, + 0.566 + ], + "angle": 0, + "content": "re-train the model and re-construct the data index. Essentially, generalization (or dynamic updates) only supports a small number of new data that do not substantially alter the distribution which we have demonstrated in our case. In future we may extend IRGen to an adaptive structure capable of capturing the evolving distribution of new data during training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.787, + 0.779 + ], + "angle": 0, + "content": "Storage requirement and Inference throuput. We first provide a comprehensive comparison of model capacity on the ImageNet dataset and the comparison is shown in the Tab. 7. It is crucial to emphasize that a retrieval system's storage considerations extend beyond just the model; it must also store features for all database vectors, constituting a substantial portion of storage requirements, especially in the context of a large database. While compression can alleviate this concern, the performance is severely compromised due to quantization. Our GPU inference cost, tested on a Tesla P100 PCIe 16GB GPU, is 0.037s/image, which is near-real-time, considering practical retrieval times at the order of 10 milliseconds. Moreover, our approach achieves \\(76\\%\\) MAP@100, Moreover, our approach achieves \\(76\\%\\) MAP@100, significantly surpassing the FT-CLIP with SPANN result of \\(65.5\\%\\), and is competitive with FT-CLIP utilizing linear scan, which achieves \\(77\\%\\). Notably, however, the FT-CLIP with linear scan method demands 0.14 seconds per image and considerable memory usage." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.84 + ], + "angle": 0, + "content": "We further report additional inference throughput on Inshop dataset for 100 queries, with beam sizes set at 1, 10, 20, and 30 for comparison. This analysis is conducted on an NVIDIA V100-16G GPU and we break down the time cost of each component during autoregressive retrieval. As shown in Fig. 5, the encoder" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.236, + 0.145, + 0.767, + 0.16 + ], + "angle": 0, + "content": "Table 7: Comprehensive comparison of storage requirement and inference cost." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.168, + 0.817, + 0.217 + ], + "angle": 0, + "content": "
MethodModel(Params)Database storage
IRGenViT-base encoder(86M)+24-layer decoder(307M)4.9MB: 4 bytes/image
FT-CLIPViT-base(86M)3.67GB: 768x4 bytes/image
" + }, + { + "type": "image", + "bbox": [ + 0.334, + 0.23, + 0.672, + 0.325 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.315, + 0.325, + 0.687, + 0.339 + ], + "angle": 0, + "content": "Fig. 5: Illustrating the search speed using beam search." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.352, + 0.787, + 0.442 + ], + "angle": 0, + "content": "is quite fast, while the autoregressive decoder becomes the major bottleneck, especially as the beam size increases. Additional time is consumed for checking the validity of predictions, as it's possible that the predicted identifier may not exist in the database. Overall, the time cost is within an acceptable range. For instance, it takes approximately 0.07 seconds (with a beam size of 10) or 0.19 seconds (with a beam size of 30) per query." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.443, + 0.787, + 0.519 + ], + "angle": 0, + "content": "For inference speed, we anticipate that the prevalent reliance on GPUs will swiftly lead to newer GPU generations with increased processing power, more efficient memory management, and improved hardware support, enhancing the speed of our autoregressive retrieval. Additionally, our model, being GPT-based, can leverage rapidly developed acceleration techniques designed for GPT." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.539, + 0.36, + 0.556 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.787, + 0.689 + ], + "angle": 0, + "content": "In this paper, we delve into the realm of generative modeling to enable end-to-end image retrieval, a process that directly connects a query image to its closest match. With the introduction of semantic image tokenizer, we've demonstrated that our model excels at achieving remarkable precision without compromising recall. Through extensive ablation studies and evaluations, we've underscored the superior performance of our approach. We believe that this innovative approach to generative modeling in image retrieval not only pushes the boundaries of this field but also holds potential for broader applications." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Limitations. While our model has shown significant performance improvements, it's important to acknowledge its limitations. First, though our model has demonstrated scalability to million-scale datasets, dealing with billion-scale datasets is a complex challenge. It may necessitate even larger models with higher capacity, potentially impacting inference speed. Striking a balance between model capacity and speed is an area that warrants exploration for efficient and effective billion-scale search. Second Training large autoregressive models requires substantial computational resources, which raises environmental concerns. Research efforts to enable efficient training, such as fast fine-tuning of pretrained models, are crucial to mitigate energy consumption and environmental impact." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.784, + 0.21 + ], + "angle": 0, + "content": "This work is supported by Fundamental Research Funds for the Central Universities (2243100004)." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.234, + 0.323, + 0.25 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.267, + 0.785, + 0.309 + ], + "angle": 0, + "content": "1. Adiwardana, D., Luong, M.T., So, D.R., Hall, J., Fiedel, N., Thoppilan, R., Yang, Z., Kulshreshtha, A., Nemade, G., Lu, Y., et al.: Towards a human-like open-domain chatbot. arXiv preprint arXiv:2001.09977 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.311, + 0.785, + 0.351 + ], + "angle": 0, + "content": "2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. arXiv preprint arXiv:2204.14198 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.353, + 0.785, + 0.393 + ], + "angle": 0, + "content": "3. Alzu'bi, A., Amira, A., Ramzan, N.: Semantic content-based image retrieval: A comprehensive study. Journal of Visual Communication and Image Representation 32, 20-54 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.395, + 0.785, + 0.422 + ], + "angle": 0, + "content": "4. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM 51(1), 117-122 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.423, + 0.785, + 0.463 + ], + "angle": 0, + "content": "5. Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 931-938 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.465, + 0.785, + 0.491 + ], + "angle": 0, + "content": "6. Babenko, A., Lempitsky, V.: The inverted multi-index. IEEE transactions on pattern analysis and machine intelligence 37(6), 1247-1260 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.493, + 0.785, + 0.533 + ], + "angle": 0, + "content": "7. Bai, S., Tang, P., Torr, P.H., Latecki, L.J.: Re-ranking via metric fusion for object retrieval and person re-identification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 740-749 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.535, + 0.785, + 0.561 + ], + "angle": 0, + "content": "8. Bay, H., Tuytelaars, T., Van Gool, L.: Surf: Speeded up robust features. In: European conference on computer vision. pp. 404-417. Springer (2006)" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.563, + 0.785, + 0.603 + ], + "angle": 0, + "content": "9. Bengio, Y., Léonard, N., Courville, A.: Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.605, + 0.785, + 0.631 + ], + "angle": 0, + "content": "10. Bentley, J.L.: K-d trees for semidynamic point sets. In: Proceedings of the sixth annual symposium on Computational geometry. pp. 187-197 (1990)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.633, + 0.785, + 0.672 + ], + "angle": 0, + "content": "11. Bevilacqua, M., Ottaviano, G., Lewis, P., Yih, W.t., Riedel, S., Petroni, F.: Autoregressive search engines: Generating substrings as document identifiers. arXiv preprint arXiv:2204.10628 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.674, + 0.785, + 0.728 + ], + "angle": 0, + "content": "12. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.73, + 0.785, + 0.77 + ], + "angle": 0, + "content": "13. Cao, B., Araujo, A., Sim, J.: Unifying deep local and global features for image search. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 726-743. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.772, + 0.785, + 0.798 + ], + "angle": 0, + "content": "14. Cao, Y., Wang, C., Zhang, L., Zhang, L.: Edgel index for large-scale sketch-based image search. In: CVPR 2011. pp. 761-768. IEEE (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "15. Cao, Y., Long, M., Wang, J., Liu, S.: Collective deep quantization for efficient cross-modal retrieval. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 31 (2017)" + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.267, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "16. Cao, Y., Long, M., Wang, J., Zhu, H., Wen, Q.: Deep quantization network for efficient image retrieval. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. p. 3457-3463. AAAI'16, AAAI Press (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.19, + 0.785, + 0.232 + ], + "angle": 0, + "content": "17. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative pretraining from pixels. In: International conference on machine learning. pp. 1691-1703. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.232, + 0.785, + 0.272 + ], + "angle": 0, + "content": "18. Chen, Q., Zhao, B., Wang, H., Li, M., Liu, C., Li, Z., Yang, M., Wang, J.: Spann: Highly-efficient billion-scale approximate nearest neighborhood search. Advances in Neural Information Processing Systems 34, 5199-5212 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.273, + 0.785, + 0.314 + ], + "angle": 0, + "content": "19. Chen, T., Li, L., Sun, Y.: Differentiable product quantization for end-to-end embedding compression. In: International Conference on Machine Learning. pp. 1617-1626. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.315, + 0.785, + 0.355 + ], + "angle": 0, + "content": "20. Cho, J., Lu, J., Schwenk, D., Hajishirzi, H., Kembhavi, A.: X-lxmert: Paint, caption and answer questions with multi-modal transformers. arXiv preprint arXiv:2009.11278 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.356, + 0.785, + 0.398 + ], + "angle": 0, + "content": "21. Chowdhery, A., Narang, S., Devlin, J., Bosma, M., Mishra, G., Roberts, A., Barham, P., Chung, H.W., Sutton, C., Gehrmann, S., et al.: Palm: Scaling language modeling with pathways. arXiv preprint arXiv:2204.02311 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.398, + 0.785, + 0.425 + ], + "angle": 0, + "content": "22. Chum, O., Philbin, J., Zisserman, A., et al.: Near duplicate image detection: Min-cache and tfidf weighting. In: Bmvc. vol. 810, pp. 812-815 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.425, + 0.785, + 0.452 + ], + "angle": 0, + "content": "23. Chung, Y.A., Hsu, W.N., Tang, H., Glass, J.: An unsupervised autoregressive model for speech representation learning. arXiv preprint arXiv:1904.03240 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.453, + 0.785, + 0.479 + ], + "angle": 0, + "content": "24. De Cao, N., Aziz, W., Titov, I.: Highly parallel autoregressive entity linking with discriminative correction. arXiv preprint arXiv:2109.03792 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.48, + 0.785, + 0.508 + ], + "angle": 0, + "content": "25. De Cao, N., Izacard, G., Riedel, S., Petroni, F.: Autoregressive entity retrieval. arXiv preprint arXiv:2010.00904 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.509, + 0.785, + 0.563 + ], + "angle": 0, + "content": "26. De Cao, N., Wu, L., Popat, K., Artetxe, M., Goyal, N., Plekhanov, M., Zettlemoyer, L., Cancedda, N., Riedel, S., Petroni, F.: Multilingual autoregressive entity linking. Transactions of the Association for Computational Linguistics 10, 274-290 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.564, + 0.785, + 0.605 + ], + "angle": 0, + "content": "27. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.606, + 0.785, + 0.646 + ], + "angle": 0, + "content": "28. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.647, + 0.785, + 0.674 + ], + "angle": 0, + "content": "29. Dhariwal, P., Jun, H., Payne, C., Kim, J.W., Radford, A., Sutskever, I.: Jukebox: A generative model for music. arXiv preprint arXiv:2005.00341 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.675, + 0.785, + 0.715 + ], + "angle": 0, + "content": "30. Ding, M., Zheng, W., Hong, W., Tang, J.: Cogview2: Faster and better text-to-image generation via hierarchical transformers. arXiv preprint arXiv:2204.14217 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.716, + 0.785, + 0.757 + ], + "angle": 0, + "content": "31. Dizaji, K.G., Zheng, F., Sadoughi, N., Yang, Y., Deng, C., Huang, H.: Unsupervised deep generative adversarial hashing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3664-3673 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.813 + ], + "angle": 0, + "content": "32. Du, N., Huang, Y., Dai, A.M., Tong, S., Lepikhin, D., Xu, Y., Krikun, M., Zhou, Y., Yu, A.W., First, O., et al.: Glam: Efficient scaling of language models with mixture-of-experts. In: International Conference on Machine Learning. pp. 5547-5569. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "33. El-Nouby, A., Neverova, N., Laptev, I., Jégou, H.: Training vision transformers for image retrieval. arXiv preprint arXiv:2102.05644 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "34. Erin Liong, V., Lu, J., Wang, G., Moulin, P., Zhou, J.: Deep hashing for compact binary codes learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2475-2483 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.19, + 0.785, + 0.232 + ], + "angle": 0, + "content": "35. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. arXiv preprint arXiv:2203.13131 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.232, + 0.785, + 0.259 + ], + "angle": 0, + "content": "36. Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization. IEEE transactions on pattern analysis and machine intelligence 36(4), 744-755 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.26, + 0.785, + 0.313 + ], + "angle": 0, + "content": "37. Gong, Y., Lazebnik, S., Gordo, A., Perronnin, F.: Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE transactions on pattern analysis and machine intelligence 35(12), 2916-2929 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.315, + 0.785, + 0.355 + ], + "angle": 0, + "content": "38. Gulrajani, I., Kumar, K., Ahmed, F., Taiga, A.A., Visin, F., Vazquez, D., Courville, A.: Pixelvae: A latent variable model for natural images. arXiv preprint arXiv:1611.05013 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.357, + 0.785, + 0.397 + ], + "angle": 0, + "content": "39. Guo, R., Sun, P., Lindgren, E., Geng, Q., Simcha, D., Chern, F., Kumar, S.: Accelerating large-scale inference with anisotropic vector quantization. In: International Conference on Machine Learning. pp. 3887-3896. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.398, + 0.785, + 0.439 + ], + "angle": 0, + "content": "40. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.44, + 0.785, + 0.481 + ], + "angle": 0, + "content": "41. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing. pp. 604-613 (1998)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.482, + 0.785, + 0.522 + ], + "angle": 0, + "content": "42. Jang, Y.K., Cho, N.I.: Generalized product quantization network for semi-supervised image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3420-3429 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.523, + 0.785, + 0.563 + ], + "angle": 0, + "content": "43. Jang, Y.K., Cho, N.I.: Self-supervised product quantization for deep unsupervised image retrieval. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12085-12094 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.565, + 0.785, + 0.605 + ], + "angle": 0, + "content": "44. Jayaram Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: Diskann: Fast accurate billion-point nearest neighbor search on a single node. Advances in Neural Information Processing Systems 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.606, + 0.785, + 0.646 + ], + "angle": 0, + "content": "45. Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence 33(1), 117-128 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.647, + 0.785, + 0.688 + ], + "angle": 0, + "content": "46. Jégou, H., Douze, M., Schmid, C., Pérez, P.: Aggregating local descriptors into a compact image representation. In: 2010 IEEE computer society conference on computer vision and pattern recognition. pp. 3304-3311. IEEE (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.785, + 0.716 + ], + "angle": 0, + "content": "47. Johnson, J., Douze, M., Jégou, H.: Billion-scale similarity search with gpus. IEEE Transactions on Big Data 7(3), 535-547 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.717, + 0.785, + 0.743 + ], + "angle": 0, + "content": "48. Jun, H., Ko, B., Kim, Y., Kim, I., Kim, J.: Combination of multiple global descriptors for image retrieval. arXiv preprint arXiv:1903.10663 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.744, + 0.785, + 0.797 + ], + "angle": 0, + "content": "49. Klein, B., Wolf, L.: End-to-end supervised product quantization for image search and retrieval. In: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5036-5045 (2019). https://doi.org/10.1109/CVPR.2019.00518" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "50. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.147, + 0.785, + 0.176 + ], + "angle": 0, + "content": "51. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Communications of the ACM 60(6), 84-90 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.177, + 0.787, + 0.233 + ], + "angle": 0, + "content": "52. Lagunes-Fortiz, M., Damen, D., Mayol-Cuevas, W.: Centroids triplet network and temporally-consistent embeddings for in-situ object recognition. In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10796-10802. IEEE (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.234, + 0.785, + 0.275 + ], + "angle": 0, + "content": "53. Lee, D., Kim, C., Kim, S., Cho, M., Han, W.S.: Autoregressive image generation using residual quantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11523-11532 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.276, + 0.785, + 0.317 + ], + "angle": 0, + "content": "54. Lee, S., Seong, H., Lee, S., Kim, E.: Correlation verification for image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5374-5384 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.359 + ], + "angle": 0, + "content": "55. Lew, M.S., Sebe, N., Djeraba, C., Jain, R.: Content-based multimedia information retrieval: State of the art and challenges. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 2(1), 1-19 (2006)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.36, + 0.785, + 0.402 + ], + "angle": 0, + "content": "56. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.403, + 0.785, + 0.445 + ], + "angle": 0, + "content": "57. Li, X., Uricchio, T., Ballan, L., Bertini, M., Snoek, C.G., Bimbo, A.D.: Socializing the semantic gap: A comparative survey on image tag assignment, refinement, and retrieval. ACM Computing Surveys (CSUR) 49(1), 1-39 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.445, + 0.785, + 0.487 + ], + "angle": 0, + "content": "58. Liu, B., Cao, Y., Long, M., Wang, J., Wang, J.: Deep triplet quantization. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 755-763 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.488, + 0.785, + 0.515 + ], + "angle": 0, + "content": "59. Liu, Y., Zhang, D., Lu, G., Ma, W.Y.: A survey of content-based image retrieval with high-level semantics. Pattern recognition 40(1), 262-282 (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.516, + 0.785, + 0.572 + ], + "angle": 0, + "content": "60. Liu, Z., Cheng, K.T., Huang, D., Xing, E.P., Shen, Z.: Nonuniform-to-uniform quantization: Towards accurate quantization via generalized straight-through estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4942-4952 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.573, + 0.785, + 0.614 + ], + "angle": 0, + "content": "61. Liu, Z., Luo, P., Qiu, S., Wang, X., Tang, X.: Deepfashion: Powering robust clothes recognition and retrieval with rich annotations. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1096-1104 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.615, + 0.785, + 0.655 + ], + "angle": 0, + "content": "62. Lowe, D.G.: Object recognition from local scale-invariant features. In: Proceedings of the seventh IEEE international conference on computer vision. vol. 2, pp. 1150-1157. Ieee (1999)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.657, + 0.785, + 0.699 + ], + "angle": 0, + "content": "63. Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence 42(4), 824-836 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.7, + 0.785, + 0.727 + ], + "angle": 0, + "content": "64. Martinez, J., Hoos, H.H., Little, J.J.: Stacked quantizers for compositional vector compression. arXiv preprint arXiv:1411.2173 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.728, + 0.785, + 0.769 + ], + "angle": 0, + "content": "65. Noh, H., Araujo, A., Sim, J., Weyand, T., Han, B.: Large-scale image retrieval with attentive deep local features. In: Proceedings of the IEEE international conference on computer vision. pp. 3456-3465 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.77, + 0.785, + 0.798 + ], + "angle": 0, + "content": "66. Norouzi, M., Fleet, D.J.: Cartesian k-means. In: Proceedings of the IEEE Conference on computer Vision and Pattern Recognition. pp. 3017-3024 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "67. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. arXiv preprint arXiv:2203.02155 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.786, + 0.203 + ], + "angle": 0, + "content": "68. Park, M., Jin, J.S., Wilson, L.S.: Fast content-based image retrieval using quasigabor filter and reduction of image feature dimension. In: Proceedings fifth IEEE southwest symposium on image analysis and interpretation. pp. 178-182. IEEE (2002)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.203, + 0.787, + 0.244 + ], + "angle": 0, + "content": "69. Qiu, Z., Yao, T., Mei, T.: Deep quantization: Encoding convolutional activations with deep generative model. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 6759-6768 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.244, + 0.786, + 0.298 + ], + "angle": 0, + "content": "70. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.298, + 0.786, + 0.327 + ], + "angle": 0, + "content": "71. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I., et al.: Improving language understanding by generative pre-training (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.326, + 0.786, + 0.353 + ], + "angle": 0, + "content": "72. Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I., et al.: Language models are unsupervised multitask learners. OpenAI blog 1(8), 9 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.353, + 0.786, + 0.393 + ], + "angle": 0, + "content": "73. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.393, + 0.786, + 0.434 + ], + "angle": 0, + "content": "74. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.434, + 0.786, + 0.473 + ], + "angle": 0, + "content": "75. Razavian, A.S., Sullivan, J., Carlsson, S., Maki, A.: Visual instance retrieval with deep convolutional networks. ITE Transactions on Media Technology and Applications 4(3), 251-258 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.473, + 0.786, + 0.514 + ], + "angle": 0, + "content": "76. Ren, J., Zhang, M., Li, D.: Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory. Advances in Neural Information Processing Systems 33, 10672-10684 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.514, + 0.786, + 0.556 + ], + "angle": 0, + "content": "77. Revaud, J., Almazán, J., Rezende, R.S., Souza, C.R.d.: Learning with average precision: Training image retrieval with a listwise loss. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5107-5116 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.556, + 0.786, + 0.609 + ], + "angle": 0, + "content": "78. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.61, + 0.786, + 0.651 + ], + "angle": 0, + "content": "79. Shoeybi, M., Patwary, M., Puri, R., LeGresley, P., Casper, J., Catanzaro, B.: Megatron-lm: Training multi-billion parameter language models using model parallelism. arXiv preprint arXiv:1909.08053 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.651, + 0.786, + 0.692 + ], + "angle": 0, + "content": "80. Siagian, C., Itti, L.: Rapid biologically-inspired scene classification using features shared with visual attention. IEEE transactions on pattern analysis and machine intelligence 29(2), 300-312 (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.692, + 0.786, + 0.733 + ], + "angle": 0, + "content": "81. Simeoni, O., Avrithis, Y., Chum, O.: Local features and visual words emerge in activations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11651-11660 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.733, + 0.786, + 0.759 + ], + "angle": 0, + "content": "82. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.786, + 0.8 + ], + "angle": 0, + "content": "83. Smeulders, A.W., Worring, M., Santini, S., Gupta, A., Jain, R.: Content-based image retrieval at the end of the early years. IEEE Transactions on pattern analysis and machine intelligence 22(12), 1349-1380 (2000)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.786, + 0.84 + ], + "angle": 0, + "content": "84. Song, J., He, T., Gao, L., Xu, X., Hanjalic, A., Shen, H.T.: Binary generative adversarial networks for image retrieval. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "20" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "85. Tan, F., Yuan, J., Ordonez, V.: Instance-level image retrieval using reranking transformers. In: proceedings of the IEEE/CVF international conference on computer vision. pp. 12105-12115 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.191, + 0.785, + 0.232 + ], + "angle": 0, + "content": "86. Tay, Y., Tran, V.Q., Dehghani, M., Ni, J., Bahri, D., Mehta, H., Qin, Z., Hui, K., Zhao, Z., Gupta, J., et al.: Transformer memory as a differentiable search index. arXiv preprint arXiv:2202.06991 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.234, + 0.785, + 0.274 + ], + "angle": 0, + "content": "87. Teichmann, M., Araujo, A., Zhu, M., Sim, J.: Detect-to-retrieve: Efficient regional aggregation for image search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5109-5118 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.276, + 0.785, + 0.303 + ], + "angle": 0, + "content": "88. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.305, + 0.785, + 0.345 + ], + "angle": 0, + "content": "89. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.347, + 0.785, + 0.373 + ], + "angle": 0, + "content": "90. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.375, + 0.785, + 0.415 + ], + "angle": 0, + "content": "91. Wang, J., Wang, J., Song, J., Xu, X.S., Shen, H.T., Li, S.: Optimized cartesian k-means. IEEE Transactions on Knowledge and Data Engineering 27(1), 180-192 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.418, + 0.785, + 0.445 + ], + "angle": 0, + "content": "92. Wang, J., Hua, X.S.: Interactive image search by color map. ACM Transactions on Intelligent Systems and Technology (TIST) 3(1), 1-23 (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.446, + 0.785, + 0.472 + ], + "angle": 0, + "content": "93. Wang, J., Zhang, T.: Composite quantization. IEEE transactions on pattern analysis and machine intelligence 41(6), 1308-1322 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.475, + 0.785, + 0.528 + ], + "angle": 0, + "content": "94. Wang, W., Bao, H., Dong, L., Bjorck, J., Peng, Z., Liu, Q., Aggarwal, K., Mohammed, O.K., Singhal, S., Som, S., et al.: Image as a foreign language: Beit pretraining for all vision and vision-language tasks. arXiv preprint arXiv:2208.10442 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.531, + 0.785, + 0.571 + ], + "angle": 0, + "content": "95. Wang, X.Y., Zhang, B.B., Yang, H.Y.: Content-based image retrieval by integrating color and texture features. Multimedia tools and applications 68(3), 545-569 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.573, + 0.785, + 0.613 + ], + "angle": 0, + "content": "96. Wang, Y., Hou, Y., Wang, H., Miao, Z., Wu, S., Sun, H., Chen, Q., Xia, Y., Chi, C., Zhao, G., et al.: A neural corpus indexer for document retrieval. arXiv preprint arXiv:2206.02743 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.616, + 0.785, + 0.642 + ], + "angle": 0, + "content": "97. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.644, + 0.785, + 0.685 + ], + "angle": 0, + "content": "98. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: European conference on computer vision. pp. 499-515. Springer (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.687, + 0.785, + 0.727 + ], + "angle": 0, + "content": "99. Wengert, C., Douze, M., Jégou, H.: Bag-of-colors for improved image search. In: Proceedings of the 19th ACM international conference on Multimedia. pp. 1437-1440 (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.785, + 0.77 + ], + "angle": 0, + "content": "00. Wieczorek, M., Michalowski, A., Wroblewska, A., Dabrowski, J.: A strong baseline for fashion retrieval with person re-identification models. In: International Conference on Neural Information Processing. pp. 294–301. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "01. Wu, C., Liang, J., Ji, L., Yang, F., Fang, Y., Jiang, D., Duan, N.: Niwa: Visual synthesis pre-training for neural visual world creation. In: European Conference on Computer Vision. pp. 720-736. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "02. Xia, Y., He, K., Wen, F., Sun, J.: Joint inverted indexing. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 3416-3423 (2013)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IRGen: Generative Modeling for Image Retrieval" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "21" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "103. Xiao, T., Li, H., Ouyang, W., Wang, X.: Learning deep feature representations with domain guided dropout for person re-identification. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1249-1258 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.787, + 0.245 + ], + "angle": 0, + "content": "104. Xu, Y., Lee, H., Chen, D., Hechtman, B., Huang, Y., Joshi, R., Krikun, M., Lepikhin, D., Ly, A., Maggioni, M., et al.: Gspmd: general and scalable parallelization for ml computation graphs. arXiv preprint arXiv:2105.04663 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.245, + 0.787, + 0.3 + ], + "angle": 0, + "content": "105. Yang, M., He, D., Fan, M., Shi, B., Xue, X., Li, F., Ding, E., Huang, J.: Dolg: Single-stage image retrieval with deep orthogonal fusion of local and global features. In: Proceedings of the IEEE/CVF International conference on Computer Vision. pp. 11772-11781 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.3, + 0.787, + 0.342 + ], + "angle": 0, + "content": "106. Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R.R., Le, Q.V.: Xlnet: Generalized autoregressive pretraining for language understanding. Advances in neural information processing systems 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.342, + 0.787, + 0.383 + ], + "angle": 0, + "content": "107. Yu, J., Li, X., Koh, J.Y., Zhang, H., Pang, R., Qin, J., Ku, A., Xu, Y., Baldridge, J., Wu, Y.: Vector-quantized image modeling with improved vqgan. arXiv preprint arXiv:2110.04627 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.383, + 0.787, + 0.424 + ], + "angle": 0, + "content": "108. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.424, + 0.787, + 0.467 + ], + "angle": 0, + "content": "109. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.467, + 0.787, + 0.522 + ], + "angle": 0, + "content": "110. Yuan, Y., Chen, W., Yang, Y., Wang, Z.: In defense of the triplet loss again: Learning robust person re-identification with fast approximated triplet loss and label distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 354-355 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.522, + 0.787, + 0.55 + ], + "angle": 0, + "content": "111. Zhai, A., Wu, H.Y.: Classification is a strong baseline for deep metric learning. arXiv preprint arXiv:1811.12649 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.55, + 0.787, + 0.605 + ], + "angle": 0, + "content": "112. Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., Ma, S.: Jointly optimizing query encoder and product quantization to improve retrieval performance. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management. pp. 2487-2496 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.605, + 0.787, + 0.674 + ], + "angle": 0, + "content": "113. Zhang, H., Shen, H., Qiu, Y., Jiang, Y., Wang, S., Xu, S., Xiao, Y., Long, B., Yang, W.Y.: Joint learning of deep retrieval model and product quantization based embedding index. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. pp. 1718-1722 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.674, + 0.787, + 0.715 + ], + "angle": 0, + "content": "114. Zhang, L., Rui, Y.: Image search—from thousands to billions in 20 years. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 9(1s), 1-20 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.715, + 0.787, + 0.758 + ], + "angle": 0, + "content": "115. Zhou, B., Lapedriza, A., Khosla, A., Oliva, A., Torralba, A.: Places: A 10 million image database for scene recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.758, + 0.787, + 0.799 + ], + "angle": 0, + "content": "116. Zhou, C., Po, L.M., Ou, W.: Angular deep supervised vector quantization for image retrieval. IEEE Transactions on Neural Networks and Learning Systems 33(4), 1638-1649 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "117. Zhou, K., Yang, Y., Cavallaro, A., Xiang, T.: Omni-scale feature learning for person re-identification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3702-3712 (2019)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "22" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "Y. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "118. Zhou, W., Li, H., Tian, Q.: Recent advance in content-based image retrieval: A literature survey. arXiv preprint arXiv:1706.06064 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.787, + 0.217 + ], + "angle": 0, + "content": "119. Zhu, H., Long, M., Wang, J., Cao, Y.: Deep hashing network for efficient similarity retrieval. In: Proceedings of the AAAI conference on Artificial Intelligence. vol. 30 (2016)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.217 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_origin.pdf b/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..719e027982830e1214af0503a647f8448c760346 --- /dev/null +++ b/2024/IRGen_ Generative Modeling for Image Retrieval/6de261b8-a64e-4f2e-ac8c-9a7c553f77a3_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6217c11a1aedf47b692930505acf7576e64fbeed528b7124f3fdc005255e52f0 +size 968459 diff --git a/2024/IRGen_ Generative Modeling for Image Retrieval/full.md b/2024/IRGen_ Generative Modeling for Image Retrieval/full.md new file mode 100644 index 0000000000000000000000000000000000000000..8bb20edc2526f9e29deb70b7f6064fbadf7c701a --- /dev/null +++ b/2024/IRGen_ Generative Modeling for Image Retrieval/full.md @@ -0,0 +1,335 @@ +# IRGen: Generative Modeling for Image Retrieval + +Yidan Zhang $^{12}$ , Ting Zhang $^{1*}$ , Dong Chen $^{3}$ , Yujing Wang $^{3}$ , Qi Chen $^{3}$ , Xing Xie $^{3}$ , Hao Sun $^{3}$ , Weiwei Deng $^{3}$ , Qi Zhang $^{3}$ , Fan Yang $^{3}$ , Mao Yang $^{3}$ , Qingmin Liao $^{5}$ , Jingdong Wang $^{4}$ , and Baining Guo $^{3}$ + +1Beijing Normal University 2The University of Tokyo 3Microsoft 4Baidu 5Shenzhen International Graduate School, Tsinghua University + +Abstract. While generative modeling has become prevalent across numerous research fields, its integration into the realm of image retrieval remains largely unexplored and underjustified. In this paper, we present a novel methodology, reframing image retrieval as a variant of generative modeling and employing a sequence-to-sequence model. This approach is harmoniously aligned with the current trend towards unification in research, presenting a cohesive framework that allows for end-to-end differentiable searching. This, in turn, facilitates superior performance via direct optimization techniques. The development of our model, dubbed IRGen, addresses the critical technical challenge of converting an image into a concise sequence of semantic units, which is pivotal for enabling efficient and effective search. Extensive experiments demonstrate that our model achieves state-of-the-art performance on three widely-used image retrieval benchmarks as well as two million-scale datasets, yielding significant improvement compared to prior competitive retrieval methods. In addition, the notable surge in precision scores facilitated by generative modeling presents the potential to bypass the reranking phase, which is traditionally indispensable in practical retrieval workflows. The code is publicly available at https://github.com/yakt00/IRGen. + +Keywords: Image Retrieval $\cdot$ Autoregressive Model $\cdot$ Generative Model + +# 1 Introduction + +Generative modeling has made significant progress in a wide range of tasks including machine translation [89], conversational modeling [1, 12, 28, 67], image captioning [108], image classification [17], text-to-image synthesis [30, 73], and many more. Originating from language and then expanding to other modalities with specially designed tokenizers, such a universal modeling approach provides a promising direction for unifying different tasks into a versatile pretrained model, which has attracted widespread attention [2, 56, 67, 94]. Yet its potential in image retrieval has been unexplored. This paper aims to take the unified trend one step further and investigates generative modeling for image retrieval. + +A practical retrieval system generally consists of two stages: feature representation learning [33, 54, 60, 105] and Approximate Nearest Neighbor (ANN) search [6, 18, 39, 47]. Most image retrieval methods focus only on one individual stage while ignoring the fact that both stages are inherently and deeply connected in actual service. Thus, the practical system often requires careful per-task hyperparameter tuning to make the most out of the coordination of the feature extraction and ANN search. While some efforts have been dedicated to joint learning of embedding and compression (or indexing), such as deep quantization / hashing [16, 19, 49, 112, 113], they still rely on a post process conducting non-exhaustive search. + +In this paper, we cast image retrieval as a form of generative modeling and utilize standard Transformer architecture, as in GPT [12, 71, 72], to enable end-to-end differentiable search. Our model, IRGen, is a sequence-to-sequence model that directly generates identifiers corresponding to the given query image's nearest neighbors. Specifically, the model takes a query image as input and autoregressively predicts discrete visual tokens, which are considered as the identifier of an image. The predicted visual tokens are supposed to point to the query image's nearest neighbor. As such, IRGen can be trained directly from the final retrieval target starting with raw images. + +Two fundamental concerns need to be addressed to enable efficient and effective image retrieval using generative modeling. First, autoregressive generative modeling is notable for its slow inference speed due to the inherently sequential nature, thus the run-time cost for retrieval increases quadratically with the length of the input sequence. Second, it is particularly difficult to model the semantic relationship between the identifiers if we drastically shortened the image identifier. Therefore, a semantic tokenizer specially designed for image retrieval is an immediate problem. + +We observe that existing image tokenizers [53, 88], intended for image generation, are not suitable for image retrieval task, leading to poor performance as we will demonstrate in our experiments. We hence propose several key ingredients that first inject semantic information by applying image-level supervision rather than pixel-level reconstructive supervision, then generate dependent tokens in a sequence by leveraging the recursive property of residual quantization, and lastly ensure fast inference speed by tremendously reducing the length of the sequence via exploiting the global feature instead of spatial patch embeddings. Afterwards, we intentionally adopt the standard Transformer architecture so that we could scale up the model using existing techniques and infrastructures. + +The proposed IRGen achieves state-of-the-art performance across a diverse range of image retrieval datasets, owing to its end-to-end differentiable search capability. A comprehensive empirical study over three image retrieval benchmarks proves that our model is superior to prior state-of-the-art baselines, sometimes even surpassing linear scan search methods. For instance, compared with the best baseline method, including linear scan search, our model achieves remarkable improvement, such as a $20.2\%$ increase in precision@10 on In-shop Clothes [61], a $6.0\%$ boost in precision@2 on CUB200 [90] and a $2.4\%$ enhancement in preci + +sion@2 on Cars196 [50]. To assess the scalability of our model, we further experiment on million-level datasets, namely ImageNet [27] and Places365 [115], and consistently demonstrate superior performance in these challenging scenarios. + +It is our belief that generative models have the potential to redefine the landscape of image retrieval. The application of generative modeling to image retrieval tasks represents an exciting opportunity to unify information retrieval across various modalities. At a technical level, our model, IRGen, effortlessly bridges the gap between feature representation learning and approximate nonexhaustive search (bypassing vector compression), creating an end-to-end differentiable framework that enables direct optimization based on ultimate retrieval goal. Furthermore, the entire framework is conceptually straightforward, with all components relying on the standard Transformer architecture, renowned for its remarkable scalability [21,32,79,104]. + +Our contributions are concluded as: + +* To the best of our knowledge, our work represents the first effort in employing a sequence-to-sequence generative model to address image retrieval in a fully end-to-end manner that directly generates the nearest neighbor's identifier given the query. +* We introduce a semantic image tokenizer explicitly designed for image retrieval to obtain image identifiers, facilitating autoregressive training. It is essential to note that this tokenizer differs significantly from previous quantization models, as our identifier solely represents the image and is not employed for distance computation, as is the case in quantization. +* Extensive experiments show that our approach exhibits substantial improvements, achieving new state-of-the-art results. We have demonstrated its scalability to million-scale datasets and provided throughput number, showcasing its near-real-time performance. + +# 2 Related Work + +Image retrieval. Traditionally, hand-crafted features are heuristically designed to describe the image content based on its color [92, 99], texture [68, 95] or shape [14]. Typical features include GIST [80], SIFT [62], SURF [8], VLAD [46] and so on. Recent years have witnessed the explosive research on deep learning based features trained over labeled images. Besides the evolvement of the network architecture designs [40, 51, 89], numerous efforts [33, 100] have been dedicated to various loss functions including classification loss [111, 117], triplet loss [110], contrastive loss [33, 48], center loss [100] and so on. The similarity is calculated through distance measure between features or evaluated through re-ranking techniques [77]. Another different line of research centers on approximate nearest neighbor search to speed up the search process, accepting a certain level of compromise in search accuracy. One way is to enable fast distance computation through hashing or quantization techniques such as LSH [41], min-Hash [22], ITQ [37], PQ [45], and many others [36, 93, 119]. The other way is to reduce the + +number of distance comparison by retrieving a small number of candidates. Typical methods include partition-based indexing [6, 102] that partitions the feature space into non-overlapping clusters and graph-based indexing [44] that builds a neighborhood graph with edges connecting similar images. To improve the recall rate while ensuring fast search speed, hierarchical course-to-fine strategy [63] has been the popular choice that the retrieved candidates are refined level by level. Additionally, a number of works have introduced hybrid indexing [18], leveraging the best of both indexing schemes while avoiding their limitations. + +Generative modeling. Deep autoregressive networks are generative sequential models that assume a product rule for factoring the joint likelihood and model each conditional distribution through a neural network. AR models have shown powerful progress in generative tasks across multiple domains such as image [17, 109], text [72, 106], audio [23, 29], and video [97, 101]. The key component involves linearizing data into a sequence of symbols with notable works such as VQ-VAE [88], RQ-VAE [53]. Recently, a number of works [25, 86, 96] further explored AR model to empower entity retrieval and document retrieval. Most related to our work are NCI [96] and DSI [86], which are concerned with document retrieval. However, these approaches utilize hierarchical k-means clustering applied to document embeddings derived from a small pretrained language model to obtain document identifiers. In contrast, we put forward a novel approach that involves learning the identifier directly from semantic supervision, and showcase its effectiveness in the context of image retrieval. We posit that this discovery can also be advantageous for document retrieval tasks. + +Joint learning. There is a growing interest [19,42,43,112] in the study of joint learning to improve search accuracy. For example, JPQ [113] jointly learns the deep retrieval model (equivalent to an embedding model) and the embedding index (compression). DQN [16] combines PQ and embedding learning but does not optimize the PQ clusters. DPQ [49] incorporates PQ clusters for supervised joint learning, specifically targeting image retrieval. HashGAN [31] and BGAN [84] adversarially learn binary hash codes jointly with the embedding model in an unsupervised way. However, all these prior works focus on end-to-end training of encoding and compression together while overlooking the indexing part (meaning non-exhaustive search), which is challenging to formulate as differentiable. They leverage quantization (compression index) for distance approximation but still rely on linear scan in their experiments. In contrast, our approach reframes retrieval as a completely novel end-to-end task, eliminating explicit distinctions between embedding, compression, and indexing. + +# 3 Method + +# 3.1 Semantic Image Tokenizer + +As Transformer becomes the ubiquitous architecture in computer vision, it has emerged many successful image tokenizers such as VQ-VAE [35,74,88,107], RQ-VAE [53] and so on. Despite its success in image generation, they may not be well-suited for the retrieval task for several reasons. First, the process of + +decoding latent codes to reconstruct raw images is essential for generating images in synthesis tasks but is redundant for retrieval tasks. Second, the autoregressive model's inference speed is heavily influenced by the length of the code sequence, where a shorter sequence is vital for efficient searching in our context. Presently, code sequences tend to be lengthy (for example, an $8 \times 8$ feature map with a depth of 4 in RQ-VAE leads to a sequence of 256), underscoring the need to significantly reduce sequence length. Moreover, retrieval tasks require the embedding of semantic information within the latent codes. However, the current approach to learning latent codes through image reconstruction loss primarily captures low-level details, such as inconsequential local nuances and noise, which may not be beneficial for retrieval. + +Building on the insights mentioned earlier, we suggest investigating the global feature extracted from the class token, rather than relying on the default spatial tokens. This approach offers a substantial reduction in sequence length, reducing it from 64 tokens to a single token. Moreover, as a result of this approach, the class token inherently contains a condensed, high-level semantic representation. Let $\mathbf{f}_{cls}$ denote the $d$ -dimensional feature vector outputted from the class token, which is taken as the image representation. We adopt residual quantization (RQ) or stacked composite quantization to approximate this feature. Suppose there are $M$ codebooks with each containing $L$ elements, $\mathcal{C}_m = \{\mathbf{c}_{m1},\dots ,\mathbf{c}_{mL}\}$ , RQ recursively maps the embedding $\mathbf{f}_{cls}$ to a sequentially ordered $M$ codes, $\mathbf{f}_{cls} \rightarrow \{l_1,l_2,\dots ,l_M\} \in [\mathbb{L}]^M$ . Let $\mathbf{r}_0 = \mathbf{f}_{cls}$ , we have + +$$ +l _ {m} = \arg \min _ {l \in [ \mathbb {L} ]} \| \mathbf {r} _ {m - 1} - \mathbf {c} _ {m l} \| _ {2} ^ {2}, \tag {1} +$$ + +$$ +\mathbf {r} _ {m} = \mathbf {r} _ {m - 1} - \mathbf {c} _ {m l _ {m}}, m = 1, 2, \dots , M. \tag {2} +$$ + +The process of sequentially generating discrete codes is inherently compatible with sequential autoregressive generation. This alignment helps alleviate the optimization challenges associated with modeling the relationships within identifiers. A figure illustrating the image tokenizer can be seen in the supplementary. + +To further inject semantic prior, we propose to train the network under classification loss over both the original embeddings as well as the reconstructed embeddings. In particular, we consider a series of reconstruction levels denoted as $\hat{\mathbf{f}}_{cls}^{\leq m} = \sum_{i=1}^{m} \mathbf{c}_{il_i}, m = 1,2,\dots,M$ . Each prefix code thus encodes semantic information to a certain degree. Adding up the $M$ levels of partial reconstruction error, the complete objective function is then formulated as, + +$$ +\mathcal {L} = \mathcal {L} _ {c l s} (\mathbf {f} _ {c l s}) + \lambda_ {1} \sum_ {m = 1} ^ {M} \mathcal {L} _ {c l s} \left(\hat {\mathbf {f}} _ {c l s} ^ {\leq m}\right) + \lambda_ {2} \sum_ {m = 1} ^ {M} \| \mathbf {r} _ {m} \| _ {2} ^ {2}, \tag {3} +$$ + +$$ +\mathbf {r} _ {m} = \mathbf {f} _ {c l s} - \operatorname {s g} \left[ \hat {\mathbf {f}} _ {c l s} ^ {\leq m} \right], m = 1, 2, \dots , M, \tag {4} +$$ + +where $\mathcal{L}_{cls}$ is the softmax cross-entropy loss and $\mathrm{sg}[\cdot ]$ is the stop gradient operator. During training, we adopt alternative optimization to update the codebook and the network. For computing the gradient of $\mathcal{L}_{cls}(\hat{\mathbf{f}}_{cls}^{\leq m})$ , we follow the straight-through estimator [9] as in [88]. After optimization, we hope that images with + +similar classes have close codes. In the experiments, we present comparison with other discrete identifiers including random codes and codes from hierarchical k-means algorithm as well as from RQ-VAE. + +# 3.2 Encoder-Decoder for Autoregressive Retrieval + +Once we have established a robust discrete latent structure equipped with semantic prior information, our next step is to train a powerful autoregressive sequence-to-sequence model solely on these discrete random variables without referring their visual content. Our encoder-decoder architecture decouples the input embedding from the generation of discrete codes. The training process involves image pairs $(x_{1},x_{2})$ , where $x_{2}$ is the nearest neighbor of $x_{1}$ . Our model's objective is to predict the identifiers of $x_{2}$ when given $x_{1}$ as input. This setup allows the model to learn the semantic relationships between images in the dataset. The left of Fig. 1 provides a concise view of our training pipeline. After training, the model begins by taking a query image as input to obtain the query embedding, which is decoded to the discrete codes. It is worth noting that the yielded discrete codes represent the query's nearest neighbor images within the database rather than for the query. + +To be specific, let the encoder be denoted as $\mathbb{E}$ based on the ViT base architecture and the decoder be $\mathbb{D}$ , a standard Transformer that includes causal self-attention, cross-attention and MLP layers. We leverage the spatial tokens outputted from the encoder as the input embedding, $\mathbf{e} = \mathbb{E}(x_1)$ , which is injected into the decoder through cross attention. Our training objective involves predicting the next token in the image identifier sequence. Specifically, we aim to maximize the probability of the $i$ -th token of the image identifier given the input embedding and the previously predicted tokens, $p(l_i|x_1,l_1,\dots ,l_{i - 1},\theta)$ , where $\theta$ denotes the parameters of both $\mathbb{D}$ and $\mathbb{E}$ , and $l_{1},l_{2},\dots ,l_{M}$ are the $M$ tokens that make up the image identifier for $x_{2}$ , generated by the image tokenizer. By maximizing the probability of each token, we effectively maximize the likelihood of generating the image identifier of an image, + +$$ +p \left(l _ {1}, \dots , l _ {M} \mid x _ {1}, \theta\right) = \prod_ {m = 1} ^ {M} p \left(l _ {i} \mid x _ {1}, l _ {1}, \dots , l _ {m - 1}, \theta\right). \tag {5} +$$ + +We apply a softmax cross-entropy loss on a vocabulary of $M$ discrete tokens during training. + +# 3.3 Beam Search + +During inference, given a query image $\mathbf{q}$ , we first calculate the query embedding processed by the encoder $\mathbb{E}$ and then generate discrete codes through the decoder $\mathbb{D}$ based on the query embedding in an autoregressive manner. These discrete codes represent an image that is considered as the nearest neighbor to the query image. This illustrates the process of Top-1 retrieval by generating + +![](images/9a707bc90dec012ff1e566e3b10991447e7d58e36cf4d04fd75f68b6f640520e.jpg) +Fig. 1: The left of the figure illustrates the training pipeline of encoder-decoder architecture for autoregressive retrieval. The training objective is to autoregressively predict the identifier of the query's nearest neighbor image. The right of the figure illustrates the procedure of beam search with code length is 2 and beam size K is 3. + +the sequence codes one by one according to the argmax probability. To perform Top-K retrieval, our model utilize beam search integrated into the generating process, allowing us to find the top- $K$ images that are the closest matches. + +As illustrated in right of Fig. 1, this procedure begins by defining a beam size, denoted as $\mathrm{K}$ in our case. Initially, the beam comprises the start-of-sequence token, and the algorithm extends the current set of candidate sequences by considering the next potential tokens in the sequence. For each candidate sequence, the algorithm outputs probabilities for multiple potential next tokens and adds them to the beam. The expanded set of sequences is then scored based on the probabilities assigned by the model, which are computed as the product of the probabilities associated with their individual elements. The top-k sequences with the highest scores are retained, while the others are discarded. This selection process, which can be implemented with a priority queue in linear time with the candidate list size, is repeated until the last token is decoded. + +It's important to note that not all generated identifiers are necessarily valid, meaning that an identifier belonging to the set $[\mathbb{L}]^{M}$ may not correspond to any images within the retrieval database. Therefore, we must validate the generated image identifier at each step, which can be a time-consuming process. However, we address this challenge by constructing a prefix tree containing valid codes. In the case of beam search with a prefix tree, the search process is constrained to only consider valid next tokens, as determined by the prefix tree, rather than all the possible next tokens. This constraint ensures that the search process results in valid images, largely enhancing the efficiency of the retrieval process. + +Beam search vs. ANN search. Indeed, beam search can be regarded as a tree-based manner to perform approximate nearest neighbor (ANN) search. However, compared to prior methods, there is a significant difference in how they calculate the score to choose the current node. Traditional methods usually rely on calculating the distance between the query feature and the node's associated feature, using a predefined distance metric to determine the score. Conversely, in beam search, the score or likelihood is produced by a differentiable neural network conditioned on the query. This distinction allows the retrieval process to be refined end-to-end. + +Table 1: Precision comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. Our model adopts beam search for retrieval, achieving significant improvement and performing even better than linear scan search. + +
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.710.27.15.846.843.639.934.925.922.018.515.4
CLIP57.522.816.614.166.063.559.453.870.867.863.357.2
CGD(repro)83.247.840.237.076.775.573.771.487.186.184.682.6
\( IRT_R(repro) \)92.759.651.147.679.377.775.071.475.673.168.361.7
FT-CLIP91.466.858.955.479.277.676.073.288.487.787.185.8
Faisss IVF PQ search
CGD(repro)60.430.524.522.071.670.869.968.784.884.484.183.3
\( IRT_R(repro) \)68.635.729.326.668.967.666.263.459.157.554.751.7
FT-CLIP63.737.030.728.072.672.171.269.786.586.386.286.0
ScaNN search
CGD(repro)83.047.740.337.276.775.273.871.487.186.184.582.6
\( IRT_R(repro) \)92.058.250.046.679.377.775.171.475.472.868.161.6
FT-CLIP90.464.656.953.579.277.576.073.288.387.787.185.8
SPANN search
CGD(repro)83.047.740.337.176.775.573.771.487.086.184.682.6
\( IRT_R(repro) \)91.456.247.944.579.377.675.071.474.872.467.661.1
FT-CLIP90.262.955.151.878.577.676.073.288.688.187.586.3
Beam search
IRGen (ours)92.487.086.686.582.782.783.082.890.189.990.290.5
+ +# 4 Experiments + +We evaluate our method on common image retrieval datasets and on two large-scale datasets, ImageNet [27] and Places365 [115]. For a detailed description of the datasets and implementation details, please refer to the supplementary. + +Baselines. We evaluate our model's performance in comparison to five competitive baselines: 1) ResNet-101 [40] trained from ImageNet dataset, denoted as Res101-Img, which is commonly used as a feature extraction tool for various tasks; 2) CLIP [70] trained on 400M image-text pairs, known for powerful zero-shot capability; 3) CGD [48], a state-of-the-art method based on ResNet; 4) IRT [33], a Transformer-based model for image retrieval and we use the best-performing model $\mathrm{IRT}_{\mathbb{R}}$ ; 5) FT-CLIP, a baseline finetuned from CLIP on the target dataset. For both CGD and IRT, we have reproduced these models to ensure consistent data processing and comparable model sizes. Specifically, we use ResNet-101 for CGD and DeiT-B for IRT. We also provide their best results from their original papers for reference. + +Search process. The baseline models primarily focus on effective feature learning. After training, these models are utilized to extract features for the database images. During the search process, a given query image is initially passed through + +Table 2: Recall comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. we include the best result of CGD and IRT from their original papers for context with * denotation. Our model adopt beam search for retrieval, achieving comparable performance in most cases. + +
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.755.962.766.846.859.971.780.825.935.64759.7
CLIP57.583.087.589.766.078.187.793.570.882.691.195.9
CGD*91.998.198.799.079.286.692.095.194.897.198.298.8
\( \mathrm {IR}_{\mathrm {T}}{}_{\mathrm {R}}{}^{ * } \)91.998.198.799.076.685.091.194.3----
FT-CLIP91.497.398.198.579.285.089.392.088.490.592.593.8
Faisss IVF PQ search
\( \mathrm {CGD}_{\text{(repro)}} \)60.476.077.177.471.677.481.584.284.888.089.891.0
\( \mathrm {IR}_{\mathrm {T}}{}_{\mathrm {R}}{}_{\mathrm {repro}} \)68.679.280.080.268.977.985.089.359.170.478.283.4
FT-CLIP63.770.771.171.272.678.082.385.286.586.987.287.5
ScaNN search
\( \mathrm {CGD}_{\text{(repro)}} \)83.094.896.296.776.783.588.091.887.191.794.696.6
\( \mathrm {IR}_{\mathrm {T}}{}_{\mathrm {R}}{}_{\mathrm {repro}} \)92.097.898.398.479.386.891.994.775.484.790.995.0
FT-CLIP90.495.996.696.979.285.089.292.788.390.592.493.7
SPANN search
\( \mathrm {CGD}_{\text{(repro)}} \)83.095.096.496.976.783.487.991.887.091.794.696.7
\( \mathrm {IR}_{\mathrm {T}}{}_{\mathrm {R}}{}_{\mathrm {repro}} \)91.497.297.697.779.386.891.994.774.884.390.594.7
FT-CLIP90.295.896.797.078.585.089.492.988.690.792.594.2
Beam search
IRGen (ours)92.496.897.697.982.786.489.291.490.192.193.293.7
+ +the model to obtain its query feature. Subsequently, this query feature is compared with the features of database images using a specific distance metric. Following the conventions established in previous works such as [33, 48, 70], we employ the cosine distance for the CLIP model and the Euclidean distance for the other baseline models. We evaluate two search strategies: linear scan search (K-nearest neighbors or KNN) and approximate nearest neighbor search (ANN). Linear scan search is known for its accuracy but is computationally intensive. In contrast, ANN is significantly more efficient. For ANN, we explore: (i) the popular Faiss IVF PQ [47]; (ii) the state-of-the-art memory-based algorithm ScaNN [39] with the default setting; and (iii) the state-of-the-art disk-based SPANN algorithm [18]. These evaluation strategies allow us to assess the retrieval performance of our model against a variety of search methods. + +# 4.1 Results + +Tab. 1 presents a detailed performance comparison in terms of precision@ $K$ , which assesses the percentage of retrieved candidates that share the same class as the query among the top $K$ results. Our model consistently outperforms all + +other models, even surpassing those employing linear scan search. Notably, we achieve remarkable improvements, such as a $20.2\%$ boost in precision@10 on the In-shop Clothes dataset, a $6.0\%$ increase in precision@2 on the CUB200 dataset, and a $2.4\%$ gain in precision@2 on the Cars196 dataset. Furthermore, several observations can be made: 1) Finetuned models, tailored to specific datasets, exhibit significantly better performance compared to off-the-shelf feature extractors like CLIP and ImageNet-pretrained ResNet-101. 2) Generally, models equipped with ANN algorithms perform slightly worse than their counterparts using linear scan search. However, there are exceptions, such as FT-CLIP with SPANN search on the Cars196 dataset, which demonstrates the importance of end-to-end optimization. 3) Our model consistently maintains high precision scores as $K$ increases, while other models experience a substantial drop. + +Tab. 2 provides a comparison of different models using the Recall@K metric. Recall@K measures the proportion of queries for which at least one image among the top $K$ retrieved candidates shares the same label as the query image, yielding a score of 1 if true and 0 otherwise. The table also includes the best recall results of CGD and IRT from their respective original papers for reference. It's important to note that these models may have different data preprocessing, model sizes, and additional training techniques. Here are the key observations: 1) Our IRGen model achieves the highest Recall@1 score compared to all other models. However, for other recall scores, our model performs similarly or slightly worse. This discrepancy may arise from the current objective loss used in autoregressive models, which heavily optimizes for Recall@1 while giving less emphasis to other recall values. One potential solution is to incorporate the beam search process into training for joint optimization. 2) Different combinations of feature extractors and ANN algorithms exhibit significant variations across the three datasets, highlighting the challenges of achieving coordination in practical scenarios. 3) Notably, despite the high recall achieved by baselines, they often require an additional re-ranking stage to improve precision, whereas our model already attains high precision scores without the need for re-ranking. + +Fig. 2 illustrates the precision-recall curve, where recall represents the true positive rate. Our approach, IRGen, consistently delivers outstanding performance, maintaining high precision and recall simultaneously. In addition to precision-recall analysis, we evaluate our model using the mean reciprocal rank (MRR) metric, which measures the inverse of the rank of the first relevant item. We compute MRR for four different values: 1, 2, 4, and 8, and display the corresponding curves in Fig. 3. The baselines employ the SPANN retrieval algorithm. Our IRGen model consistently outperforms the baselines across all evaluated metrics, confirming the effectiveness of our framework. Notably, there is significant variability in the performance gap between each baseline and our model across the three datasets, highlighting the challenges and dataset-dependent nature of retrieval tasks. + +Results on million-level datasets. We further experiment our approach with ImageNet dataset [27] that contains 1,281,167 images and Places365-Standard [115] containing about $1.8M$ images from 365 scene categories. We compare with + +![](images/5f13ce87060fa2e0026cd4685191eeb6d03a71b7dc1f351d6611e5d5c32e9c93.jpg) +Fig. 2: Precision-Recall (TPR) curve comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset. + +![](images/50f68bce7dd1a95dfd0a7bf9f0a5e4491c8d81f1201d510c7e6fd0e6a34bca06.jpg) +(b) + +![](images/ac6a4068cb5987febe7b226a78f01ef90dbbc1e51993f238c90f18c51bd0b3d9.jpg) +(c) + +![](images/3fbf9aeff8f70bf139b1b6c8e3d7991b461bc309e52b7489ac1678eb4e891176.jpg) +Fig. 3: MRR with respect to 1,2,4,8 comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset. + +![](images/018b6ae5551ea8837fbbec753530cdff141dc4a7b06bcfda6a909dcce02d962c.jpg) + +![](images/9420660c28bf6f4760b9b7879f80c441e842e67eec84b78c10c0214f3ff0bbda.jpg) + +the strong baselines including CLIP model as well as FT-CLIP model finetuned based on CLIP model. The comparison is reported in Fig. 4 and Tab. 3, focusing on precision@K and MAP@100. Our IRGen model consistently outperforms the baselines, achieving the best results in terms of precision@K and MAP@100. The precision values for our model remain consistently high as $K$ increases, while the baselines experience noticeable performance degradation. These results confirm the effectiveness of our model in handling large-scale datasets like ImageNet, where it maintains high precision across varying values of $K$ and outperforms the baseline models. + +Comparison to supervised deep quantization methods. We make the comparison with recent supervised deep quantization methods on ImageNet, including the state-of-the-art methods ADSVQ [116] and DPQ [49]. Notably, these methods exclusively utilize 100 classes from ImageNet, as indicated in their original papers, making it a substantially easier case. According to the original paper, DPQ [49] employed ResNet-50 (25.56M parameters), ADSVQ [116] utilized AlexNet (60.3M parameters), and DTQ [58] also used AlexNet. To ensure fair comparison, we employ a smaller network, ViT-S (22.1M parameters) and rerun over 100 classes. Tab. 4 illustrates the superiority of our approach. + +# 4.2 Ablations + +The effect of identifiers. In our study of image identifiers, we compared four different approaches: (1) assigning random identifiers to images, (2) hierarchical k-means (HKM), (3) Product Quantization (PQ) and (4) using the image tokenizer RQ-VAE [11]. The results of this comparison are summarized in Tab. 6. + +Table 3: MAP@100 on two million- Table 4: MAP@1000 for 32 bits level datasets. The results of CLIP and (equivalent to the length of our identiFT-CLIP are retrieved by SPANN. -fier) comparison on ImageNet dataset. + +
ModelDatasetMethodMAP@1000 for 32 bits
ImageNetPlaces365DTQ [58]68.12
CLIP44.122.1ADSVQ [116]75.21
FT-CLIP65.530.3DPQ [49]87.70
IRGen(Ours)76.044.3IRGen(Ours)93.52
+ +Table 5: Generalize to new data. We split $5\%$ of the training data from the ImageNet dataset for inference and remained unseen during training. + +
ModelPrecision
110100
FT-CLIP + Linear Scan70.665.055.6
IRGen (Ours)77.077.977.4
+ +The random assignment of identifiers to images yielded expectedly lower performance. This performance gap can be attributed to the fact that models with random identifiers need to learn not only the interaction between queries and image identifiers but also allocate capacity to learn relationships within the identifiers themselves. On the other hand, HKM showed superior performance compared to random assignment, underscoring the significance of semantic identifiers. However, our proposed semantic image identifiers demonstrated a clear improvement over HKM, highlighting their effectiveness in enhancing retrieval performance. PQ codes perform worse than the random assigned identifiers. This underperformance may stem from the model's challenges in constructing semantic information from PQ codes, which might be incompatible with autoregressive prediction mechanism. This highlights the significance of our sequence order in autoregressive training process. In contrast, the performance of RQ-VAE significantly trailed behind our model, with a performance less than 10 percent. We attribute this difference to the sequence length in RQ-VAE which is too long for the model to effectively capture relationships within the identifiers. + +Generalize to new data. Addressing the inclusion of fresh data holds particular significance, especially in the context of search scenarios. To assess this capacity, we conduct an experiment where we intentionally withheld $5\%$ of the training data from the ImageNet dataset during the training phase and introduced it during inference, all without updating the existing codebook and AR model. In this experiment, we compare our model with the formidable baseline FT-CLIP, which is equipped with a linear scan search. The results, as displayed in Tab. 5, reveal that our model maintains superior performance even when confronted with new data. This observation highlights our model's ability to effectively generalize to previously unseen data. In scenarios where more new data come in with vastly different semantic structure, leading to the distribution of gallery data change drastically, all data-dependent component such as embedding model as well as joint learning methods including IRGen, have to + +![](images/1ccefc47b807cb75dfe50f645edc717bc00099a988d1bcf99f2957236a1f0289.jpg) +Fig. 4: Precision comparison on large scale datasets: ImageNet and Places365. + +![](images/8c3a38dfd2c20474700e30ed2d4ffa50a796207363f0751401fc65bd2d3a7fc3.jpg) + +Table 6: Ablation study on the image identifier (T=length). + +
IdentifierTPrecisionRecall
11020301102030
Random487.675.470.868.387.695.196.096.1
\( \mathrm{HKM}_{100} \)488.280.078.277.387.293.194.395.0
\( \mathrm{HKM}_{200} \)389.081.679.879.089.093.994.995.8
\( \mathrm{HKM}_{500} \)289.581.779.878.989.595.396.597.0
PQ473.866.161.859.273.890.293.394.5
Ours492.189.789.589.592.196.897.597.7
+ +re-train the model and re-construct the data index. Essentially, generalization (or dynamic updates) only supports a small number of new data that do not substantially alter the distribution which we have demonstrated in our case. In future we may extend IRGen to an adaptive structure capable of capturing the evolving distribution of new data during training. + +Storage requirement and Inference throuput. We first provide a comprehensive comparison of model capacity on the ImageNet dataset and the comparison is shown in the Tab. 7. It is crucial to emphasize that a retrieval system's storage considerations extend beyond just the model; it must also store features for all database vectors, constituting a substantial portion of storage requirements, especially in the context of a large database. While compression can alleviate this concern, the performance is severely compromised due to quantization. Our GPU inference cost, tested on a Tesla P100 PCIe 16GB GPU, is 0.037s/image, which is near-real-time, considering practical retrieval times at the order of 10 milliseconds. Moreover, our approach achieves $76\%$ MAP@100, Moreover, our approach achieves $76\%$ MAP@100, significantly surpassing the FT-CLIP with SPANN result of $65.5\%$ , and is competitive with FT-CLIP utilizing linear scan, which achieves $77\%$ . Notably, however, the FT-CLIP with linear scan method demands 0.14 seconds per image and considerable memory usage. + +We further report additional inference throughput on Inshop dataset for 100 queries, with beam sizes set at 1, 10, 20, and 30 for comparison. This analysis is conducted on an NVIDIA V100-16G GPU and we break down the time cost of each component during autoregressive retrieval. As shown in Fig. 5, the encoder + +Table 7: Comprehensive comparison of storage requirement and inference cost. + +
MethodModel(Params)Database storage
IRGenViT-base encoder(86M)+24-layer decoder(307M)4.9MB: 4 bytes/image
FT-CLIPViT-base(86M)3.67GB: 768x4 bytes/image
+ +![](images/fee9b7080db75d046001dfbc17acd2e41b1b34eecac480e331d2024274efa03e.jpg) +Fig. 5: Illustrating the search speed using beam search. + +is quite fast, while the autoregressive decoder becomes the major bottleneck, especially as the beam size increases. Additional time is consumed for checking the validity of predictions, as it's possible that the predicted identifier may not exist in the database. Overall, the time cost is within an acceptable range. For instance, it takes approximately 0.07 seconds (with a beam size of 10) or 0.19 seconds (with a beam size of 30) per query. + +For inference speed, we anticipate that the prevalent reliance on GPUs will swiftly lead to newer GPU generations with increased processing power, more efficient memory management, and improved hardware support, enhancing the speed of our autoregressive retrieval. Additionally, our model, being GPT-based, can leverage rapidly developed acceleration techniques designed for GPT. + +# 5 Conclusion + +In this paper, we delve into the realm of generative modeling to enable end-to-end image retrieval, a process that directly connects a query image to its closest match. With the introduction of semantic image tokenizer, we've demonstrated that our model excels at achieving remarkable precision without compromising recall. Through extensive ablation studies and evaluations, we've underscored the superior performance of our approach. We believe that this innovative approach to generative modeling in image retrieval not only pushes the boundaries of this field but also holds potential for broader applications. + +Limitations. While our model has shown significant performance improvements, it's important to acknowledge its limitations. First, though our model has demonstrated scalability to million-scale datasets, dealing with billion-scale datasets is a complex challenge. It may necessitate even larger models with higher capacity, potentially impacting inference speed. Striking a balance between model capacity and speed is an area that warrants exploration for efficient and effective billion-scale search. Second Training large autoregressive models requires substantial computational resources, which raises environmental concerns. Research efforts to enable efficient training, such as fast fine-tuning of pretrained models, are crucial to mitigate energy consumption and environmental impact. + +# Acknowledgements + +This work is supported by Fundamental Research Funds for the Central Universities (2243100004). + +# References + +1. Adiwardana, D., Luong, M.T., So, D.R., Hall, J., Fiedel, N., Thoppilan, R., Yang, Z., Kulshreshtha, A., Nemade, G., Lu, Y., et al.: Towards a human-like open-domain chatbot. arXiv preprint arXiv:2001.09977 (2020) +2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. arXiv preprint arXiv:2204.14198 (2022) +3. Alzu'bi, A., Amira, A., Ramzan, N.: Semantic content-based image retrieval: A comprehensive study. Journal of Visual Communication and Image Representation 32, 20-54 (2015) +4. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM 51(1), 117-122 (2008) +5. Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 931-938 (2014) +6. Babenko, A., Lempitsky, V.: The inverted multi-index. IEEE transactions on pattern analysis and machine intelligence 37(6), 1247-1260 (2014) +7. Bai, S., Tang, P., Torr, P.H., Latecki, L.J.: Re-ranking via metric fusion for object retrieval and person re-identification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 740-749 (2019) +8. Bay, H., Tuytelaars, T., Van Gool, L.: Surf: Speeded up robust features. In: European conference on computer vision. pp. 404-417. Springer (2006) +9. Bengio, Y., Léonard, N., Courville, A.: Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432 (2013) +10. Bentley, J.L.: K-d trees for semidynamic point sets. In: Proceedings of the sixth annual symposium on Computational geometry. pp. 187-197 (1990) +11. Bevilacqua, M., Ottaviano, G., Lewis, P., Yih, W.t., Riedel, S., Petroni, F.: Autoregressive search engines: Generating substrings as document identifiers. arXiv preprint arXiv:2204.10628 (2022) +12. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020) +13. Cao, B., Araujo, A., Sim, J.: Unifying deep local and global features for image search. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 726-743. Springer (2020) +14. Cao, Y., Wang, C., Zhang, L., Zhang, L.: Edgel index for large-scale sketch-based image search. In: CVPR 2011. pp. 761-768. IEEE (2011) +15. Cao, Y., Long, M., Wang, J., Liu, S.: Collective deep quantization for efficient cross-modal retrieval. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 31 (2017) + +16. Cao, Y., Long, M., Wang, J., Zhu, H., Wen, Q.: Deep quantization network for efficient image retrieval. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. p. 3457-3463. AAAI'16, AAAI Press (2016) +17. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative pretraining from pixels. In: International conference on machine learning. pp. 1691-1703. PMLR (2020) +18. Chen, Q., Zhao, B., Wang, H., Li, M., Liu, C., Li, Z., Yang, M., Wang, J.: Spann: Highly-efficient billion-scale approximate nearest neighborhood search. Advances in Neural Information Processing Systems 34, 5199-5212 (2021) +19. Chen, T., Li, L., Sun, Y.: Differentiable product quantization for end-to-end embedding compression. In: International Conference on Machine Learning. pp. 1617-1626. PMLR (2020) +20. Cho, J., Lu, J., Schwenk, D., Hajishirzi, H., Kembhavi, A.: X-lxmert: Paint, caption and answer questions with multi-modal transformers. arXiv preprint arXiv:2009.11278 (2020) +21. Chowdhery, A., Narang, S., Devlin, J., Bosma, M., Mishra, G., Roberts, A., Barham, P., Chung, H.W., Sutton, C., Gehrmann, S., et al.: Palm: Scaling language modeling with pathways. arXiv preprint arXiv:2204.02311 (2022) +22. Chum, O., Philbin, J., Zisserman, A., et al.: Near duplicate image detection: Min-cache and tfidf weighting. In: Bmvc. vol. 810, pp. 812-815 (2008) +23. Chung, Y.A., Hsu, W.N., Tang, H., Glass, J.: An unsupervised autoregressive model for speech representation learning. arXiv preprint arXiv:1904.03240 (2019) +24. De Cao, N., Aziz, W., Titov, I.: Highly parallel autoregressive entity linking with discriminative correction. arXiv preprint arXiv:2109.03792 (2021) +25. De Cao, N., Izacard, G., Riedel, S., Petroni, F.: Autoregressive entity retrieval. arXiv preprint arXiv:2010.00904 (2020) +26. De Cao, N., Wu, L., Popat, K., Artetxe, M., Goyal, N., Plekhanov, M., Zettlemoyer, L., Cancedda, N., Riedel, S., Petroni, F.: Multilingual autoregressive entity linking. Transactions of the Association for Computational Linguistics 10, 274-290 (2022) +27. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009) +28. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) +29. Dhariwal, P., Jun, H., Payne, C., Kim, J.W., Radford, A., Sutskever, I.: Jukebox: A generative model for music. arXiv preprint arXiv:2005.00341 (2020) +30. Ding, M., Zheng, W., Hong, W., Tang, J.: Cogview2: Faster and better text-to-image generation via hierarchical transformers. arXiv preprint arXiv:2204.14217 (2022) +31. Dizaji, K.G., Zheng, F., Sadoughi, N., Yang, Y., Deng, C., Huang, H.: Unsupervised deep generative adversarial hashing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3664-3673 (2018) +32. Du, N., Huang, Y., Dai, A.M., Tong, S., Lepikhin, D., Xu, Y., Krikun, M., Zhou, Y., Yu, A.W., First, O., et al.: Glam: Efficient scaling of language models with mixture-of-experts. In: International Conference on Machine Learning. pp. 5547-5569. PMLR (2022) +33. El-Nouby, A., Neverova, N., Laptev, I., Jégou, H.: Training vision transformers for image retrieval. arXiv preprint arXiv:2102.05644 (2021) + +34. Erin Liong, V., Lu, J., Wang, G., Moulin, P., Zhou, J.: Deep hashing for compact binary codes learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2475-2483 (2015) +35. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. arXiv preprint arXiv:2203.13131 (2022) +36. Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization. IEEE transactions on pattern analysis and machine intelligence 36(4), 744-755 (2013) +37. Gong, Y., Lazebnik, S., Gordo, A., Perronnin, F.: Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE transactions on pattern analysis and machine intelligence 35(12), 2916-2929 (2012) +38. Gulrajani, I., Kumar, K., Ahmed, F., Taiga, A.A., Visin, F., Vazquez, D., Courville, A.: Pixelvae: A latent variable model for natural images. arXiv preprint arXiv:1611.05013 (2016) +39. Guo, R., Sun, P., Lindgren, E., Geng, Q., Simcha, D., Chern, F., Kumar, S.: Accelerating large-scale inference with anisotropic vector quantization. In: International Conference on Machine Learning. pp. 3887-3896. PMLR (2020) +40. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) +41. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing. pp. 604-613 (1998) +42. Jang, Y.K., Cho, N.I.: Generalized product quantization network for semi-supervised image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3420-3429 (2020) +43. Jang, Y.K., Cho, N.I.: Self-supervised product quantization for deep unsupervised image retrieval. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12085-12094 (2021) +44. Jayaram Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: Diskann: Fast accurate billion-point nearest neighbor search on a single node. Advances in Neural Information Processing Systems 32 (2019) +45. Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence 33(1), 117-128 (2010) +46. Jégou, H., Douze, M., Schmid, C., Pérez, P.: Aggregating local descriptors into a compact image representation. In: 2010 IEEE computer society conference on computer vision and pattern recognition. pp. 3304-3311. IEEE (2010) +47. Johnson, J., Douze, M., Jégou, H.: Billion-scale similarity search with gpus. IEEE Transactions on Big Data 7(3), 535-547 (2019) +48. Jun, H., Ko, B., Kim, Y., Kim, I., Kim, J.: Combination of multiple global descriptors for image retrieval. arXiv preprint arXiv:1903.10663 (2019) +49. Klein, B., Wolf, L.: End-to-end supervised product quantization for image search and retrieval. In: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5036-5045 (2019). https://doi.org/10.1109/CVPR.2019.00518 +50. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013) + +51. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Communications of the ACM 60(6), 84-90 (2017) +52. Lagunes-Fortiz, M., Damen, D., Mayol-Cuevas, W.: Centroids triplet network and temporally-consistent embeddings for in-situ object recognition. In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10796-10802. IEEE (2020) +53. Lee, D., Kim, C., Kim, S., Cho, M., Han, W.S.: Autoregressive image generation using residual quantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11523-11532 (2022) +54. Lee, S., Seong, H., Lee, S., Kim, E.: Correlation verification for image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5374-5384 (2022) +55. Lew, M.S., Sebe, N., Djeraba, C., Jain, R.: Content-based multimedia information retrieval: State of the art and challenges. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 2(1), 1-19 (2006) +56. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023) +57. Li, X., Uricchio, T., Ballan, L., Bertini, M., Snoek, C.G., Bimbo, A.D.: Socializing the semantic gap: A comparative survey on image tag assignment, refinement, and retrieval. ACM Computing Surveys (CSUR) 49(1), 1-39 (2016) +58. Liu, B., Cao, Y., Long, M., Wang, J., Wang, J.: Deep triplet quantization. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 755-763 (2018) +59. Liu, Y., Zhang, D., Lu, G., Ma, W.Y.: A survey of content-based image retrieval with high-level semantics. Pattern recognition 40(1), 262-282 (2007) +60. Liu, Z., Cheng, K.T., Huang, D., Xing, E.P., Shen, Z.: Nonuniform-to-uniform quantization: Towards accurate quantization via generalized straight-through estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4942-4952 (2022) +61. Liu, Z., Luo, P., Qiu, S., Wang, X., Tang, X.: Deepfashion: Powering robust clothes recognition and retrieval with rich annotations. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1096-1104 (2016) +62. Lowe, D.G.: Object recognition from local scale-invariant features. In: Proceedings of the seventh IEEE international conference on computer vision. vol. 2, pp. 1150-1157. Ieee (1999) +63. Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence 42(4), 824-836 (2018) +64. Martinez, J., Hoos, H.H., Little, J.J.: Stacked quantizers for compositional vector compression. arXiv preprint arXiv:1411.2173 (2014) +65. Noh, H., Araujo, A., Sim, J., Weyand, T., Han, B.: Large-scale image retrieval with attentive deep local features. In: Proceedings of the IEEE international conference on computer vision. pp. 3456-3465 (2017) +66. Norouzi, M., Fleet, D.J.: Cartesian k-means. In: Proceedings of the IEEE Conference on computer Vision and Pattern Recognition. pp. 3017-3024 (2013) +67. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. arXiv preprint arXiv:2203.02155 (2022) + +68. Park, M., Jin, J.S., Wilson, L.S.: Fast content-based image retrieval using quasigabor filter and reduction of image feature dimension. In: Proceedings fifth IEEE southwest symposium on image analysis and interpretation. pp. 178-182. IEEE (2002) +69. Qiu, Z., Yao, T., Mei, T.: Deep quantization: Encoding convolutional activations with deep generative model. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 6759-6768 (2017) +70. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021) +71. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I., et al.: Improving language understanding by generative pre-training (2018) +72. Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I., et al.: Language models are unsupervised multitask learners. OpenAI blog 1(8), 9 (2019) +73. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022) +74. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021) +75. Razavian, A.S., Sullivan, J., Carlsson, S., Maki, A.: Visual instance retrieval with deep convolutional networks. ITE Transactions on Media Technology and Applications 4(3), 251-258 (2016) +76. Ren, J., Zhang, M., Li, D.: Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory. Advances in Neural Information Processing Systems 33, 10672-10684 (2020) +77. Revaud, J., Almazán, J., Rezende, R.S., Souza, C.R.d.: Learning with average precision: Training image retrieval with a listwise loss. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5107-5116 (2019) +78. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014) +79. Shoeybi, M., Patwary, M., Puri, R., LeGresley, P., Casper, J., Catanzaro, B.: Megatron-lm: Training multi-billion parameter language models using model parallelism. arXiv preprint arXiv:1909.08053 (2019) +80. Siagian, C., Itti, L.: Rapid biologically-inspired scene classification using features shared with visual attention. IEEE transactions on pattern analysis and machine intelligence 29(2), 300-312 (2007) +81. Simeoni, O., Avrithis, Y., Chum, O.: Local features and visual words emerge in activations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11651-11660 (2019) +82. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014) +83. Smeulders, A.W., Worring, M., Santini, S., Gupta, A., Jain, R.: Content-based image retrieval at the end of the early years. IEEE Transactions on pattern analysis and machine intelligence 22(12), 1349-1380 (2000) +84. Song, J., He, T., Gao, L., Xu, X., Hanjalic, A., Shen, H.T.: Binary generative adversarial networks for image retrieval. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018) + +85. Tan, F., Yuan, J., Ordonez, V.: Instance-level image retrieval using reranking transformers. In: proceedings of the IEEE/CVF international conference on computer vision. pp. 12105-12115 (2021) +86. Tay, Y., Tran, V.Q., Dehghani, M., Ni, J., Bahri, D., Mehta, H., Qin, Z., Hui, K., Zhao, Z., Gupta, J., et al.: Transformer memory as a differentiable search index. arXiv preprint arXiv:2202.06991 (2022) +87. Teichmann, M., Araujo, A., Zhu, M., Sim, J.: Detect-to-retrieve: Efficient regional aggregation for image search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5109-5118 (2019) +88. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017) +89. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) +90. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) +91. Wang, J., Wang, J., Song, J., Xu, X.S., Shen, H.T., Li, S.: Optimized cartesian k-means. IEEE Transactions on Knowledge and Data Engineering 27(1), 180-192 (2014) +92. Wang, J., Hua, X.S.: Interactive image search by color map. ACM Transactions on Intelligent Systems and Technology (TIST) 3(1), 1-23 (2011) +93. Wang, J., Zhang, T.: Composite quantization. IEEE transactions on pattern analysis and machine intelligence 41(6), 1308-1322 (2018) +94. Wang, W., Bao, H., Dong, L., Bjorck, J., Peng, Z., Liu, Q., Aggarwal, K., Mohammed, O.K., Singhal, S., Som, S., et al.: Image as a foreign language: Beit pretraining for all vision and vision-language tasks. arXiv preprint arXiv:2208.10442 (2022) +95. Wang, X.Y., Zhang, B.B., Yang, H.Y.: Content-based image retrieval by integrating color and texture features. Multimedia tools and applications 68(3), 545-569 (2014) +96. Wang, Y., Hou, Y., Wang, H., Miao, Z., Wu, S., Sun, H., Chen, Q., Xia, Y., Chi, C., Zhao, G., et al.: A neural corpus indexer for document retrieval. arXiv preprint arXiv:2206.02743 (2022) +97. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019) +98. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: European conference on computer vision. pp. 499-515. Springer (2016) +99. Wengert, C., Douze, M., Jégou, H.: Bag-of-colors for improved image search. In: Proceedings of the 19th ACM international conference on Multimedia. pp. 1437-1440 (2011) +00. Wieczorek, M., Michalowski, A., Wroblewska, A., Dabrowski, J.: A strong baseline for fashion retrieval with person re-identification models. In: International Conference on Neural Information Processing. pp. 294–301. Springer (2020) +01. Wu, C., Liang, J., Ji, L., Yang, F., Fang, Y., Jiang, D., Duan, N.: Niwa: Visual synthesis pre-training for neural visual world creation. In: European Conference on Computer Vision. pp. 720-736. Springer (2022) +02. Xia, Y., He, K., Wen, F., Sun, J.: Joint inverted indexing. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 3416-3423 (2013) + +103. Xiao, T., Li, H., Ouyang, W., Wang, X.: Learning deep feature representations with domain guided dropout for person re-identification. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1249-1258 (2016) +104. Xu, Y., Lee, H., Chen, D., Hechtman, B., Huang, Y., Joshi, R., Krikun, M., Lepikhin, D., Ly, A., Maggioni, M., et al.: Gspmd: general and scalable parallelization for ml computation graphs. arXiv preprint arXiv:2105.04663 (2021) +105. Yang, M., He, D., Fan, M., Shi, B., Xue, X., Li, F., Ding, E., Huang, J.: Dolg: Single-stage image retrieval with deep orthogonal fusion of local and global features. In: Proceedings of the IEEE/CVF International conference on Computer Vision. pp. 11772-11781 (2021) +106. Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R.R., Le, Q.V.: Xlnet: Generalized autoregressive pretraining for language understanding. Advances in neural information processing systems 32 (2019) +107. Yu, J., Li, X., Koh, J.Y., Zhang, H., Pang, R., Qin, J., Ku, A., Xu, Y., Baldridge, J., Wu, Y.: Vector-quantized image modeling with improved vqgan. arXiv preprint arXiv:2110.04627 (2021) +108. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022) +109. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022) +110. Yuan, Y., Chen, W., Yang, Y., Wang, Z.: In defense of the triplet loss again: Learning robust person re-identification with fast approximated triplet loss and label distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 354-355 (2020) +111. Zhai, A., Wu, H.Y.: Classification is a strong baseline for deep metric learning. arXiv preprint arXiv:1811.12649 (2018) +112. Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., Ma, S.: Jointly optimizing query encoder and product quantization to improve retrieval performance. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management. pp. 2487-2496 (2021) +113. Zhang, H., Shen, H., Qiu, Y., Jiang, Y., Wang, S., Xu, S., Xiao, Y., Long, B., Yang, W.Y.: Joint learning of deep retrieval model and product quantization based embedding index. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. pp. 1718-1722 (2021) +114. Zhang, L., Rui, Y.: Image search—from thousands to billions in 20 years. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 9(1s), 1-20 (2013) +115. Zhou, B., Lapedriza, A., Khosla, A., Oliva, A., Torralba, A.: Places: A 10 million image database for scene recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (2017) +116. Zhou, C., Po, L.M., Ou, W.: Angular deep supervised vector quantization for image retrieval. IEEE Transactions on Neural Networks and Learning Systems 33(4), 1638-1649 (2020) +117. Zhou, K., Yang, Y., Cavallaro, A., Xiang, T.: Omni-scale feature learning for person re-identification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3702-3712 (2019) + +118. Zhou, W., Li, H., Tian, Q.: Recent advance in content-based image retrieval: A literature survey. arXiv preprint arXiv:1706.06064 (2017) +119. Zhu, H., Long, M., Wang, J., Cao, Y.: Deep hashing network for efficient similarity retrieval. In: Proceedings of the AAAI conference on Artificial Intelligence. vol. 30 (2016) \ No newline at end of file diff --git a/2024/IRGen_ Generative Modeling for Image Retrieval/images.zip b/2024/IRGen_ Generative Modeling for Image Retrieval/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..d59602f5925180db2e885d1c258d20eae4b4b12a --- /dev/null +++ b/2024/IRGen_ Generative Modeling for Image Retrieval/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0a5decb16deb48de4a9f150f7196ee9a9ac5f26a12a15176d656dba6d4cc4796 +size 522218 diff --git a/2024/IRGen_ Generative Modeling for Image Retrieval/layout.json b/2024/IRGen_ Generative Modeling for Image Retrieval/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..50b21421784713d84aed7a70c94ef5064f2a2a7b --- /dev/null +++ b/2024/IRGen_ Generative Modeling for Image Retrieval/layout.json @@ -0,0 +1,10825 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 135, + 112, + 478, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 112, + 478, + 129 + ], + "spans": [ + { + "bbox": [ + 135, + 112, + 478, + 129 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "spans": [ + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": "Yidan Zhang" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{12}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Ting Zhang" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{1*}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Dong Chen" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Yujing Wang" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Qi Chen" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Xing Xie" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Hao Sun" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Weiwei Deng" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Qi Zhang" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Fan Yang" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Mao Yang" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Qingmin Liao" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{5}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", Jingdong Wang" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{4}" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "text", + "content": ", and Baining Guo" + }, + { + "bbox": [ + 145, + 149, + 468, + 187 + ], + "type": "inline_equation", + "content": "^{3}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 144, + 194, + 470, + 219 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 194, + 470, + 219 + ], + "spans": [ + { + "bbox": [ + 144, + 194, + 470, + 219 + ], + "type": "text", + "content": "1Beijing Normal University 2The University of Tokyo 3Microsoft 4Baidu 5Shenzhen International Graduate School, Tsinghua University" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 261, + 455, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 261, + 455, + 470 + ], + "spans": [ + { + "bbox": [ + 160, + 261, + 455, + 470 + ], + "type": "text", + "content": "Abstract. While generative modeling has become prevalent across numerous research fields, its integration into the realm of image retrieval remains largely unexplored and underjustified. In this paper, we present a novel methodology, reframing image retrieval as a variant of generative modeling and employing a sequence-to-sequence model. This approach is harmoniously aligned with the current trend towards unification in research, presenting a cohesive framework that allows for end-to-end differentiable searching. This, in turn, facilitates superior performance via direct optimization techniques. The development of our model, dubbed IRGen, addresses the critical technical challenge of converting an image into a concise sequence of semantic units, which is pivotal for enabling efficient and effective search. Extensive experiments demonstrate that our model achieves state-of-the-art performance on three widely-used image retrieval benchmarks as well as two million-scale datasets, yielding significant improvement compared to prior competitive retrieval methods. In addition, the notable surge in precision scores facilitated by generative modeling presents the potential to bypass the reranking phase, which is traditionally indispensable in practical retrieval workflows. The code is publicly available at https://github.com/yakt00/IRGen." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 480, + 453, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 480, + 453, + 491 + ], + "spans": [ + { + "bbox": [ + 160, + 480, + 453, + 491 + ], + "type": "text", + "content": "Keywords: Image Retrieval " + }, + { + "bbox": [ + 160, + 480, + 453, + 491 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 480, + 453, + 491 + ], + "type": "text", + "content": " Autoregressive Model " + }, + { + "bbox": [ + 160, + 480, + 453, + 491 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 480, + 453, + 491 + ], + "type": "text", + "content": " Generative Model" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 513, + 230, + 525 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 513, + 230, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 513, + 230, + 525 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 538, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 538, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 538, + 482, + 647 + ], + "type": "text", + "content": "Generative modeling has made significant progress in a wide range of tasks including machine translation [89], conversational modeling [1, 12, 28, 67], image captioning [108], image classification [17], text-to-image synthesis [30, 73], and many more. Originating from language and then expanding to other modalities with specially designed tokenizers, such a universal modeling approach provides a promising direction for unifying different tasks into a versatile pretrained model, which has attracted widespread attention [2, 56, 67, 94]. Yet its potential in image retrieval has been unexplored. This paper aims to take the unified trend one step further and investigates generative modeling for image retrieval." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 654, + 337, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 654, + 337, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 654, + 337, + 665 + ], + "type": "text", + "content": "*Corresponding author: tingzhang@bnu.edu.cn." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "A practical retrieval system generally consists of two stages: feature representation learning [33, 54, 60, 105] and Approximate Nearest Neighbor (ANN) search [6, 18, 39, 47]. Most image retrieval methods focus only on one individual stage while ignoring the fact that both stages are inherently and deeply connected in actual service. Thus, the practical system often requires careful per-task hyperparameter tuning to make the most out of the coordination of the feature extraction and ANN search. While some efforts have been dedicated to joint learning of embedding and compression (or indexing), such as deep quantization / hashing [16, 19, 49, 112, 113], they still rely on a post process conducting non-exhaustive search." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 238, + 482, + 346 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 238, + 482, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 238, + 482, + 346 + ], + "type": "text", + "content": "In this paper, we cast image retrieval as a form of generative modeling and utilize standard Transformer architecture, as in GPT [12, 71, 72], to enable end-to-end differentiable search. Our model, IRGen, is a sequence-to-sequence model that directly generates identifiers corresponding to the given query image's nearest neighbors. Specifically, the model takes a query image as input and autoregressively predicts discrete visual tokens, which are considered as the identifier of an image. The predicted visual tokens are supposed to point to the query image's nearest neighbor. As such, IRGen can be trained directly from the final retrieval target starting with raw images." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 349, + 482, + 444 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 482, + 444 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 482, + 444 + ], + "type": "text", + "content": "Two fundamental concerns need to be addressed to enable efficient and effective image retrieval using generative modeling. First, autoregressive generative modeling is notable for its slow inference speed due to the inherently sequential nature, thus the run-time cost for retrieval increases quadratically with the length of the input sequence. Second, it is particularly difficult to model the semantic relationship between the identifiers if we drastically shortened the image identifier. Therefore, a semantic tokenizer specially designed for image retrieval is an immediate problem." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 447, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 447, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 447, + 482, + 567 + ], + "type": "text", + "content": "We observe that existing image tokenizers [53, 88], intended for image generation, are not suitable for image retrieval task, leading to poor performance as we will demonstrate in our experiments. We hence propose several key ingredients that first inject semantic information by applying image-level supervision rather than pixel-level reconstructive supervision, then generate dependent tokens in a sequence by leveraging the recursive property of residual quantization, and lastly ensure fast inference speed by tremendously reducing the length of the sequence via exploiting the global feature instead of spatial patch embeddings. Afterwards, we intentionally adopt the standard Transformer architecture so that we could scale up the model using existing techniques and infrastructures." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "The proposed IRGen achieves state-of-the-art performance across a diverse range of image retrieval datasets, owing to its end-to-end differentiable search capability. A comprehensive empirical study over three image retrieval benchmarks proves that our model is superior to prior state-of-the-art baselines, sometimes even surpassing linear scan search methods. For instance, compared with the best baseline method, including linear scan search, our model achieves remarkable improvement, such as a " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "20.2\\%" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " increase in precision@10 on In-shop Clothes [61], a " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "6.0\\%" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " boost in precision@2 on CUB200 [90] and a " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "2.4\\%" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " enhancement in preci" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "sion@2 on Cars196 [50]. To assess the scalability of our model, we further experiment on million-level datasets, namely ImageNet [27] and Places365 [115], and consistently demonstrate superior performance in these challenging scenarios." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 480, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 480, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 480, + 272 + ], + "type": "text", + "content": "It is our belief that generative models have the potential to redefine the landscape of image retrieval. The application of generative modeling to image retrieval tasks represents an exciting opportunity to unify information retrieval across various modalities. At a technical level, our model, IRGen, effortlessly bridges the gap between feature representation learning and approximate nonexhaustive search (bypassing vector compression), creating an end-to-end differentiable framework that enables direct optimization based on ultimate retrieval goal. Furthermore, the entire framework is conceptually straightforward, with all components relying on the standard Transformer architecture, renowned for its remarkable scalability [21,32,79,104]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 147, + 273, + 306, + 283 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 273, + 306, + 283 + ], + "spans": [ + { + "bbox": [ + 147, + 273, + 306, + 283 + ], + "type": "text", + "content": "Our contributions are concluded as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 139, + 293, + 479, + 449 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 139, + 293, + 479, + 341 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 293, + 479, + 341 + ], + "spans": [ + { + "bbox": [ + 139, + 293, + 479, + 341 + ], + "type": "text", + "content": "* To the best of our knowledge, our work represents the first effort in employing a sequence-to-sequence generative model to address image retrieval in a fully end-to-end manner that directly generates the nearest neighbor's identifier given the query." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 139, + 342, + 479, + 401 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 342, + 479, + 401 + ], + "spans": [ + { + "bbox": [ + 139, + 342, + 479, + 401 + ], + "type": "text", + "content": "* We introduce a semantic image tokenizer explicitly designed for image retrieval to obtain image identifiers, facilitating autoregressive training. It is essential to note that this tokenizer differs significantly from previous quantization models, as our identifier solely represents the image and is not employed for distance computation, as is the case in quantization." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 139, + 402, + 479, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 402, + 479, + 449 + ], + "spans": [ + { + "bbox": [ + 139, + 402, + 479, + 449 + ], + "type": "text", + "content": "* Extensive experiments show that our approach exhibits substantial improvements, achieving new state-of-the-art results. We have demonstrated its scalability to million-scale datasets and provided throughput number, showcasing its near-real-time performance." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 471, + 237, + 483 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 471, + 237, + 483 + ], + "spans": [ + { + "bbox": [ + 132, + 471, + 237, + 483 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": "Image retrieval. Traditionally, hand-crafted features are heuristically designed to describe the image content based on its color [92, 99], texture [68, 95] or shape [14]. Typical features include GIST [80], SIFT [62], SURF [8], VLAD [46] and so on. Recent years have witnessed the explosive research on deep learning based features trained over labeled images. Besides the evolvement of the network architecture designs [40, 51, 89], numerous efforts [33, 100] have been dedicated to various loss functions including classification loss [111, 117], triplet loss [110], contrastive loss [33, 48], center loss [100] and so on. The similarity is calculated through distance measure between features or evaluated through re-ranking techniques [77]. Another different line of research centers on approximate nearest neighbor search to speed up the search process, accepting a certain level of compromise in search accuracy. One way is to enable fast distance computation through hashing or quantization techniques such as LSH [41], min-Hash [22], ITQ [37], PQ [45], and many others [36, 93, 119]. The other way is to reduce the" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "content": "number of distance comparison by retrieving a small number of candidates. Typical methods include partition-based indexing [6, 102] that partitions the feature space into non-overlapping clusters and graph-based indexing [44] that builds a neighborhood graph with edges connecting similar images. To improve the recall rate while ensuring fast search speed, hierarchical course-to-fine strategy [63] has been the popular choice that the retrieved candidates are refined level by level. Additionally, a number of works have introduced hybrid indexing [18], leveraging the best of both indexing schemes while avoiding their limitations." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 212, + 482, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 212, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 212, + 482, + 390 + ], + "type": "text", + "content": "Generative modeling. Deep autoregressive networks are generative sequential models that assume a product rule for factoring the joint likelihood and model each conditional distribution through a neural network. AR models have shown powerful progress in generative tasks across multiple domains such as image [17, 109], text [72, 106], audio [23, 29], and video [97, 101]. The key component involves linearizing data into a sequence of symbols with notable works such as VQ-VAE [88], RQ-VAE [53]. Recently, a number of works [25, 86, 96] further explored AR model to empower entity retrieval and document retrieval. Most related to our work are NCI [96] and DSI [86], which are concerned with document retrieval. However, these approaches utilize hierarchical k-means clustering applied to document embeddings derived from a small pretrained language model to obtain document identifiers. In contrast, we put forward a novel approach that involves learning the identifier directly from semantic supervision, and showcase its effectiveness in the context of image retrieval. We posit that this discovery can also be advantageous for document retrieval tasks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 391, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 391, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 391, + 482, + 559 + ], + "type": "text", + "content": "Joint learning. There is a growing interest [19,42,43,112] in the study of joint learning to improve search accuracy. For example, JPQ [113] jointly learns the deep retrieval model (equivalent to an embedding model) and the embedding index (compression). DQN [16] combines PQ and embedding learning but does not optimize the PQ clusters. DPQ [49] incorporates PQ clusters for supervised joint learning, specifically targeting image retrieval. HashGAN [31] and BGAN [84] adversarially learn binary hash codes jointly with the embedding model in an unsupervised way. However, all these prior works focus on end-to-end training of encoding and compression together while overlooking the indexing part (meaning non-exhaustive search), which is challenging to formulate as differentiable. They leverage quantization (compression index) for distance approximation but still rely on linear scan in their experiments. In contrast, our approach reframes retrieval as a completely novel end-to-end task, eliminating explicit distinctions between embedding, compression, and indexing." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 575, + 202, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 575, + 202, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 575, + 202, + 588 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 599, + 293, + 611 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 293, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 293, + 611 + ], + "type": "text", + "content": "3.1 Semantic Image Tokenizer" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": "As Transformer becomes the ubiquitous architecture in computer vision, it has emerged many successful image tokenizers such as VQ-VAE [35,74,88,107], RQ-VAE [53] and so on. Despite its success in image generation, they may not be well-suited for the retrieval task for several reasons. First, the process of" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 247 + ], + "type": "text", + "content": "decoding latent codes to reconstruct raw images is essential for generating images in synthesis tasks but is redundant for retrieval tasks. Second, the autoregressive model's inference speed is heavily influenced by the length of the code sequence, where a shorter sequence is vital for efficient searching in our context. Presently, code sequences tend to be lengthy (for example, an " + }, + { + "bbox": [ + 130, + 116, + 479, + 247 + ], + "type": "inline_equation", + "content": "8 \\times 8" + }, + { + "bbox": [ + 130, + 116, + 479, + 247 + ], + "type": "text", + "content": " feature map with a depth of 4 in RQ-VAE leads to a sequence of 256), underscoring the need to significantly reduce sequence length. Moreover, retrieval tasks require the embedding of semantic information within the latent codes. However, the current approach to learning latent codes through image reconstruction loss primarily captures low-level details, such as inconsequential local nuances and noise, which may not be beneficial for retrieval." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": "Building on the insights mentioned earlier, we suggest investigating the global feature extracted from the class token, rather than relying on the default spatial tokens. This approach offers a substantial reduction in sequence length, reducing it from 64 tokens to a single token. Moreover, as a result of this approach, the class token inherently contains a condensed, high-level semantic representation. Let " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{cls}" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": " denote the " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": "-dimensional feature vector outputted from the class token, which is taken as the image representation. We adopt residual quantization (RQ) or stacked composite quantization to approximate this feature. Suppose there are " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": " codebooks with each containing " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": " elements, " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "\\mathcal{C}_m = \\{\\mathbf{c}_{m1},\\dots ,\\mathbf{c}_{mL}\\}" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": ", RQ recursively maps the embedding " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{cls}" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": " to a sequentially ordered " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": " codes, " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{cls} \\rightarrow \\{l_1,l_2,\\dots ,l_M\\} \\in [\\mathbb{L}]^M" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": ". Let " + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "inline_equation", + "content": "\\mathbf{r}_0 = \\mathbf{f}_{cls}" + }, + { + "bbox": [ + 130, + 248, + 480, + 380 + ], + "type": "text", + "content": ", we have" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 227, + 390, + 480, + 403 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 390, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 227, + 390, + 480, + 403 + ], + "type": "interline_equation", + "content": "l _ {m} = \\arg \\min _ {l \\in [ \\mathbb {L} ]} \\| \\mathbf {r} _ {m - 1} - \\mathbf {c} _ {m l} \\| _ {2} ^ {2}, \\tag {1}", + "image_path": "efa6107884806b9a55eef2e3dbe35ba4df2d5d885fd24251e540b6fd20c8cb71.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 225, + 407, + 480, + 419 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 407, + 480, + 419 + ], + "spans": [ + { + "bbox": [ + 225, + 407, + 480, + 419 + ], + "type": "interline_equation", + "content": "\\mathbf {r} _ {m} = \\mathbf {r} _ {m - 1} - \\mathbf {c} _ {m l _ {m}}, m = 1, 2, \\dots , M. \\tag {2}", + "image_path": "c0106f35cd0330ccf930ccc0a6fbc8d8f4a58693362e7a969cfd2d4eeeaa5157.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 429, + 479, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 429, + 479, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 429, + 479, + 475 + ], + "type": "text", + "content": "The process of sequentially generating discrete codes is inherently compatible with sequential autoregressive generation. This alignment helps alleviate the optimization challenges associated with modeling the relationships within identifiers. A figure illustrating the image tokenizer can be seen in the supplementary." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 477, + 479, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 477, + 479, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 477, + 479, + 548 + ], + "type": "text", + "content": "To further inject semantic prior, we propose to train the network under classification loss over both the original embeddings as well as the reconstructed embeddings. In particular, we consider a series of reconstruction levels denoted as " + }, + { + "bbox": [ + 130, + 477, + 479, + 548 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{f}}_{cls}^{\\leq m} = \\sum_{i=1}^{m} \\mathbf{c}_{il_i}, m = 1,2,\\dots,M" + }, + { + "bbox": [ + 130, + 477, + 479, + 548 + ], + "type": "text", + "content": ". Each prefix code thus encodes semantic information to a certain degree. Adding up the " + }, + { + "bbox": [ + 130, + 477, + 479, + 548 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 477, + 479, + 548 + ], + "type": "text", + "content": " levels of partial reconstruction error, the complete objective function is then formulated as," + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 198, + 559, + 480, + 590 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 198, + 559, + 480, + 590 + ], + "spans": [ + { + "bbox": [ + 198, + 559, + 480, + 590 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {c l s} (\\mathbf {f} _ {c l s}) + \\lambda_ {1} \\sum_ {m = 1} ^ {M} \\mathcal {L} _ {c l s} \\left(\\hat {\\mathbf {f}} _ {c l s} ^ {\\leq m}\\right) + \\lambda_ {2} \\sum_ {m = 1} ^ {M} \\| \\mathbf {r} _ {m} \\| _ {2} ^ {2}, \\tag {3}", + "image_path": "dd1f535a605da1953d0d0534a16d41cb57d2ddea2c41c1d17a7fa8e780c59ea9.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 198, + 594, + 480, + 608 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 198, + 594, + 480, + 608 + ], + "spans": [ + { + "bbox": [ + 198, + 594, + 480, + 608 + ], + "type": "interline_equation", + "content": "\\mathbf {r} _ {m} = \\mathbf {f} _ {c l s} - \\operatorname {s g} \\left[ \\hat {\\mathbf {f}} _ {c l s} ^ {\\leq m} \\right], m = 1, 2, \\dots , M, \\tag {4}", + "image_path": "b563c01ebe15ae93e98c6b1835880560dcd6f6724e29763c903bc2df77db2c02.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}" + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "text", + "content": " is the softmax cross-entropy loss and " + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathrm{sg}[\\cdot ]" + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "text", + "content": " is the stop gradient operator. During training, we adopt alternative optimization to update the codebook and the network. For computing the gradient of " + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}(\\hat{\\mathbf{f}}_{cls}^{\\leq m})" + }, + { + "bbox": [ + 130, + 617, + 479, + 665 + ], + "type": "text", + "content": ", we follow the straight-through estimator [9] as in [88]. After optimization, we hope that images with" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": "similar classes have close codes. In the experiments, we present comparison with other discrete identifiers including random codes and codes from hierarchical k-means algorithm as well as from RQ-VAE." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 171, + 393, + 183 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 171, + 393, + 183 + ], + "spans": [ + { + "bbox": [ + 131, + 171, + 393, + 183 + ], + "type": "text", + "content": "3.2 Encoder-Decoder for Autoregressive Retrieval" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "spans": [ + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "text", + "content": "Once we have established a robust discrete latent structure equipped with semantic prior information, our next step is to train a powerful autoregressive sequence-to-sequence model solely on these discrete random variables without referring their visual content. Our encoder-decoder architecture decouples the input embedding from the generation of discrete codes. The training process involves image pairs " + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "inline_equation", + "content": "(x_{1},x_{2})" + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "inline_equation", + "content": "x_{2}" + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "text", + "content": " is the nearest neighbor of " + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "inline_equation", + "content": "x_{1}" + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "text", + "content": ". Our model's objective is to predict the identifiers of " + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "inline_equation", + "content": "x_{2}" + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "text", + "content": " when given " + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "inline_equation", + "content": "x_{1}" + }, + { + "bbox": [ + 130, + 192, + 482, + 347 + ], + "type": "text", + "content": " as input. This setup allows the model to learn the semantic relationships between images in the dataset. The left of Fig. 1 provides a concise view of our training pipeline. After training, the model begins by taking a query image as input to obtain the query embedding, which is decoded to the discrete codes. It is worth noting that the yielded discrete codes represent the query's nearest neighbor images within the database rather than for the query." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "spans": [ + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": "To be specific, let the encoder be denoted as " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "\\mathbb{E}" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": " based on the ViT base architecture and the decoder be " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "\\mathbb{D}" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": ", a standard Transformer that includes causal self-attention, cross-attention and MLP layers. We leverage the spatial tokens outputted from the encoder as the input embedding, " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "\\mathbf{e} = \\mathbb{E}(x_1)" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": ", which is injected into the decoder through cross attention. Our training objective involves predicting the next token in the image identifier sequence. Specifically, we aim to maximize the probability of the " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": "-th token of the image identifier given the input embedding and the previously predicted tokens, " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "p(l_i|x_1,l_1,\\dots ,l_{i - 1},\\theta)" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": " denotes the parameters of both " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "\\mathbb{D}" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "\\mathbb{E}" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "l_{1},l_{2},\\dots ,l_{M}" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": " are the " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": " tokens that make up the image identifier for " + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "inline_equation", + "content": "x_{2}" + }, + { + "bbox": [ + 130, + 348, + 483, + 492 + ], + "type": "text", + "content": ", generated by the image tokenizer. By maximizing the probability of each token, we effectively maximize the likelihood of generating the image identifier of an image," + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 201, + 502, + 481, + 533 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 201, + 502, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 201, + 502, + 481, + 533 + ], + "type": "interline_equation", + "content": "p \\left(l _ {1}, \\dots , l _ {M} \\mid x _ {1}, \\theta\\right) = \\prod_ {m = 1} ^ {M} p \\left(l _ {i} \\mid x _ {1}, l _ {1}, \\dots , l _ {m - 1}, \\theta\\right). \\tag {5}", + "image_path": "4553784f1a0ef979de31078fd9b5948a692dd5df5883220d38aa2d2993312931.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 541, + 482, + 566 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 541, + 482, + 566 + ], + "spans": [ + { + "bbox": [ + 131, + 541, + 482, + 566 + ], + "type": "text", + "content": "We apply a softmax cross-entropy loss on a vocabulary of " + }, + { + "bbox": [ + 131, + 541, + 482, + 566 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 131, + 541, + 482, + 566 + ], + "type": "text", + "content": " discrete tokens during training." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 584, + 228, + 596 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 584, + 228, + 596 + ], + "spans": [ + { + "bbox": [ + 131, + 584, + 228, + 596 + ], + "type": "text", + "content": "3.3 Beam Search" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "content": "During inference, given a query image " + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{q}" + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "content": ", we first calculate the query embedding processed by the encoder " + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbb{E}" + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "content": " and then generate discrete codes through the decoder " + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbb{D}" + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "content": " based on the query embedding in an autoregressive manner. These discrete codes represent an image that is considered as the nearest neighbor to the query image. This illustrates the process of Top-1 retrieval by generating" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 121, + 471, + 205 + ], + "blocks": [ + { + "bbox": [ + 143, + 121, + 471, + 205 + ], + "lines": [ + { + "bbox": [ + 143, + 121, + 471, + 205 + ], + "spans": [ + { + "bbox": [ + 143, + 121, + 471, + 205 + ], + "type": "image", + "image_path": "9a707bc90dec012ff1e566e3b10991447e7d58e36cf4d04fd75f68b6f640520e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 212, + 482, + 257 + ], + "lines": [ + { + "bbox": [ + 131, + 212, + 482, + 257 + ], + "spans": [ + { + "bbox": [ + 131, + 212, + 482, + 257 + ], + "type": "text", + "content": "Fig. 1: The left of the figure illustrates the training pipeline of encoder-decoder architecture for autoregressive retrieval. The training objective is to autoregressively predict the identifier of the query's nearest neighbor image. The right of the figure illustrates the procedure of beam search with code length is 2 and beam size K is 3." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 270, + 479, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 479, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 479, + 307 + ], + "type": "text", + "content": "the sequence codes one by one according to the argmax probability. To perform Top-K retrieval, our model utilize beam search integrated into the generating process, allowing us to find the top- " + }, + { + "bbox": [ + 130, + 270, + 479, + 307 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 270, + 479, + 307 + ], + "type": "text", + "content": " images that are the closest matches." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 310, + 482, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 310, + 482, + 441 + ], + "spans": [ + { + "bbox": [ + 130, + 310, + 482, + 441 + ], + "type": "text", + "content": "As illustrated in right of Fig. 1, this procedure begins by defining a beam size, denoted as " + }, + { + "bbox": [ + 130, + 310, + 482, + 441 + ], + "type": "inline_equation", + "content": "\\mathrm{K}" + }, + { + "bbox": [ + 130, + 310, + 482, + 441 + ], + "type": "text", + "content": " in our case. Initially, the beam comprises the start-of-sequence token, and the algorithm extends the current set of candidate sequences by considering the next potential tokens in the sequence. For each candidate sequence, the algorithm outputs probabilities for multiple potential next tokens and adds them to the beam. The expanded set of sequences is then scored based on the probabilities assigned by the model, which are computed as the product of the probabilities associated with their individual elements. The top-k sequences with the highest scores are retained, while the others are discarded. This selection process, which can be implemented with a priority queue in linear time with the candidate list size, is repeated until the last token is decoded." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "type": "text", + "content": "It's important to note that not all generated identifiers are necessarily valid, meaning that an identifier belonging to the set " + }, + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "type": "inline_equation", + "content": "[\\mathbb{L}]^{M}" + }, + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "type": "text", + "content": " may not correspond to any images within the retrieval database. Therefore, we must validate the generated image identifier at each step, which can be a time-consuming process. However, we address this challenge by constructing a prefix tree containing valid codes. In the case of beam search with a prefix tree, the search process is constrained to only consider valid next tokens, as determined by the prefix tree, rather than all the possible next tokens. This constraint ensures that the search process results in valid images, largely enhancing the efficiency of the retrieval process." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "content": "Beam search vs. ANN search. Indeed, beam search can be regarded as a tree-based manner to perform approximate nearest neighbor (ANN) search. However, compared to prior methods, there is a significant difference in how they calculate the score to choose the current node. Traditional methods usually rely on calculating the distance between the query feature and the node's associated feature, using a predefined distance metric to determine the score. Conversely, in beam search, the score or likelihood is produced by a differentiable neural network conditioned on the query. This distinction allows the retrieval process to be refined end-to-end." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 147, + 175, + 468, + 424 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Precision comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. Our model adopts beam search for retrieval, achieving significant improvement and performing even better than linear scan search." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 147, + 175, + 468, + 424 + ], + "lines": [ + { + "bbox": [ + 147, + 175, + 468, + 424 + ], + "spans": [ + { + "bbox": [ + 147, + 175, + 468, + 424 + ], + "type": "table", + "html": "
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.710.27.15.846.843.639.934.925.922.018.515.4
CLIP57.522.816.614.166.063.559.453.870.867.863.357.2
CGD(repro)83.247.840.237.076.775.573.771.487.186.184.682.6
\\( IRT_R(repro) \\)92.759.651.147.679.377.775.071.475.673.168.361.7
FT-CLIP91.466.858.955.479.277.676.073.288.487.787.185.8
Faisss IVF PQ search
CGD(repro)60.430.524.522.071.670.869.968.784.884.484.183.3
\\( IRT_R(repro) \\)68.635.729.326.668.967.666.263.459.157.554.751.7
FT-CLIP63.737.030.728.072.672.171.269.786.586.386.286.0
ScaNN search
CGD(repro)83.047.740.337.276.775.273.871.487.186.184.582.6
\\( IRT_R(repro) \\)92.058.250.046.679.377.775.171.475.472.868.161.6
FT-CLIP90.464.656.953.579.277.576.073.288.387.787.185.8
SPANN search
CGD(repro)83.047.740.337.176.775.573.771.487.086.184.682.6
\\( IRT_R(repro) \\)91.456.247.944.579.377.675.071.474.872.467.661.1
FT-CLIP90.262.955.151.878.577.676.073.288.688.187.586.3
Beam search
IRGen (ours)92.487.086.686.582.782.783.082.890.189.990.290.5
", + "image_path": "bd891bf653722b773fccfee93c1899168193f0a82f612ca1ffc2836f1de27682.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 434, + 230, + 448 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 434, + 230, + 448 + ], + "spans": [ + { + "bbox": [ + 132, + 434, + 230, + 448 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 461, + 481, + 497 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 461, + 481, + 497 + ], + "spans": [ + { + "bbox": [ + 130, + 461, + 481, + 497 + ], + "type": "text", + "content": "We evaluate our method on common image retrieval datasets and on two large-scale datasets, ImageNet [27] and Places365 [115]. For a detailed description of the datasets and implementation details, please refer to the supplementary." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "type": "text", + "content": "Baselines. We evaluate our model's performance in comparison to five competitive baselines: 1) ResNet-101 [40] trained from ImageNet dataset, denoted as Res101-Img, which is commonly used as a feature extraction tool for various tasks; 2) CLIP [70] trained on 400M image-text pairs, known for powerful zero-shot capability; 3) CGD [48], a state-of-the-art method based on ResNet; 4) IRT [33], a Transformer-based model for image retrieval and we use the best-performing model " + }, + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "type": "inline_equation", + "content": "\\mathrm{IRT}_{\\mathbb{R}}" + }, + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "type": "text", + "content": "; 5) FT-CLIP, a baseline finetuned from CLIP on the target dataset. For both CGD and IRT, we have reproduced these models to ensure consistent data processing and comparable model sizes. Specifically, we use ResNet-101 for CGD and DeiT-B for IRT. We also provide their best results from their original papers for reference." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Search process. The baseline models primarily focus on effective feature learning. After training, these models are utilized to extract features for the database images. During the search process, a given query image is initially passed through" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 147, + 186, + 468, + 436 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "text", + "content": "Table 2: Recall comparison with different baselines, for which we consider linear scan search, Faiss IVF search and SPANN search. (repro) denotes the model reproduced by ourselves to ensure the same data process and comparable model size for fair comparison. we include the best result of CGD and IRT from their original papers for context with * denotation. Our model adopt beam search for retrieval, achieving comparable performance in most cases." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 147, + 186, + 468, + 436 + ], + "lines": [ + { + "bbox": [ + 147, + 186, + 468, + 436 + ], + "spans": [ + { + "bbox": [ + 147, + 186, + 468, + 436 + ], + "type": "table", + "html": "
ModelIn-shopCUB200Cars196
110203012481248
Linear scan search
Res101-Img30.755.962.766.846.859.971.780.825.935.64759.7
CLIP57.583.087.589.766.078.187.793.570.882.691.195.9
CGD*91.998.198.799.079.286.692.095.194.897.198.298.8
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}^{ * } \\)91.998.198.799.076.685.091.194.3----
FT-CLIP91.497.398.198.579.285.089.392.088.490.592.593.8
Faisss IVF PQ search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)60.476.077.177.471.677.481.584.284.888.089.891.0
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)68.679.280.080.268.977.985.089.359.170.478.283.4
FT-CLIP63.770.771.171.272.678.082.385.286.586.987.287.5
ScaNN search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)83.094.896.296.776.783.588.091.887.191.794.696.6
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)92.097.898.398.479.386.891.994.775.484.790.995.0
FT-CLIP90.495.996.696.979.285.089.292.788.390.592.493.7
SPANN search
\\( \\mathrm {CGD}_{\\text{(repro)}} \\)83.095.096.496.976.783.487.991.887.091.794.696.7
\\( \\mathrm {IR}_{\\mathrm {T}}{}_{\\mathrm {R}}{}_{\\mathrm {repro}} \\)91.497.297.697.779.386.891.994.774.884.390.594.7
FT-CLIP90.295.896.797.078.585.089.492.988.690.792.594.2
Beam search
IRGen (ours)92.496.897.697.982.786.489.291.490.192.193.293.7
", + "image_path": "635faa0103dccb777d31b9bc3ec1862f74d496a0d4ce36bcd91cbcd3c9ccc0cc.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 447, + 482, + 591 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 447, + 482, + 591 + ], + "spans": [ + { + "bbox": [ + 130, + 447, + 482, + 591 + ], + "type": "text", + "content": "the model to obtain its query feature. Subsequently, this query feature is compared with the features of database images using a specific distance metric. Following the conventions established in previous works such as [33, 48, 70], we employ the cosine distance for the CLIP model and the Euclidean distance for the other baseline models. We evaluate two search strategies: linear scan search (K-nearest neighbors or KNN) and approximate nearest neighbor search (ANN). Linear scan search is known for its accuracy but is computationally intensive. In contrast, ANN is significantly more efficient. For ANN, we explore: (i) the popular Faiss IVF PQ [47]; (ii) the state-of-the-art memory-based algorithm ScaNN [39] with the default setting; and (iii) the state-of-the-art disk-based SPANN algorithm [18]. These evaluation strategies allow us to assess the retrieval performance of our model against a variety of search methods." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 609, + 198, + 620 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 198, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 198, + 620 + ], + "type": "text", + "content": "4.1 Results" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "Tab. 1 presents a detailed performance comparison in terms of precision@ " + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": ", which assesses the percentage of retrieved candidates that share the same class as the query among the top " + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": " results. Our model consistently outperforms all" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": "other models, even surpassing those employing linear scan search. Notably, we achieve remarkable improvements, such as a " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "20.2\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " boost in precision@10 on the In-shop Clothes dataset, a " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "6.0\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " increase in precision@2 on the CUB200 dataset, and a " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "2.4\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " gain in precision@2 on the Cars196 dataset. Furthermore, several observations can be made: 1) Finetuned models, tailored to specific datasets, exhibit significantly better performance compared to off-the-shelf feature extractors like CLIP and ImageNet-pretrained ResNet-101. 2) Generally, models equipped with ANN algorithms perform slightly worse than their counterparts using linear scan search. However, there are exceptions, such as FT-CLIP with SPANN search on the Cars196 dataset, which demonstrates the importance of end-to-end optimization. 3) Our model consistently maintains high precision scores as " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " increases, while other models experience a substantial drop." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 262, + 482, + 479 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 262, + 482, + 479 + ], + "spans": [ + { + "bbox": [ + 130, + 262, + 482, + 479 + ], + "type": "text", + "content": "Tab. 2 provides a comparison of different models using the Recall@K metric. Recall@K measures the proportion of queries for which at least one image among the top " + }, + { + "bbox": [ + 130, + 262, + 482, + 479 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 262, + 482, + 479 + ], + "type": "text", + "content": " retrieved candidates shares the same label as the query image, yielding a score of 1 if true and 0 otherwise. The table also includes the best recall results of CGD and IRT from their respective original papers for reference. It's important to note that these models may have different data preprocessing, model sizes, and additional training techniques. Here are the key observations: 1) Our IRGen model achieves the highest Recall@1 score compared to all other models. However, for other recall scores, our model performs similarly or slightly worse. This discrepancy may arise from the current objective loss used in autoregressive models, which heavily optimizes for Recall@1 while giving less emphasis to other recall values. One potential solution is to incorporate the beam search process into training for joint optimization. 2) Different combinations of feature extractors and ANN algorithms exhibit significant variations across the three datasets, highlighting the challenges of achieving coordination in practical scenarios. 3) Notably, despite the high recall achieved by baselines, they often require an additional re-ranking stage to improve precision, whereas our model already attains high precision scores without the need for re-ranking." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 482, + 482, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 482, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 482, + 482, + 625 + ], + "type": "text", + "content": "Fig. 2 illustrates the precision-recall curve, where recall represents the true positive rate. Our approach, IRGen, consistently delivers outstanding performance, maintaining high precision and recall simultaneously. In addition to precision-recall analysis, we evaluate our model using the mean reciprocal rank (MRR) metric, which measures the inverse of the rank of the first relevant item. We compute MRR for four different values: 1, 2, 4, and 8, and display the corresponding curves in Fig. 3. The baselines employ the SPANN retrieval algorithm. Our IRGen model consistently outperforms the baselines across all evaluated metrics, confirming the effectiveness of our framework. Notably, there is significant variability in the performance gap between each baseline and our model across the three datasets, highlighting the challenges and dataset-dependent nature of retrieval tasks." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 131, + 629, + 482, + 667 + ], + "type": "text", + "content": "Results on million-level datasets. We further experiment our approach with ImageNet dataset [27] that contains 1,281,167 images and Places365-Standard [115] containing about " + }, + { + "bbox": [ + 131, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "1.8M" + }, + { + "bbox": [ + 131, + 629, + 482, + 667 + ], + "type": "text", + "content": " images from 365 scene categories. We compare with" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 118, + 246, + 198 + ], + "blocks": [ + { + "bbox": [ + 133, + 118, + 246, + 198 + ], + "lines": [ + { + "bbox": [ + 133, + 118, + 246, + 198 + ], + "spans": [ + { + "bbox": [ + 133, + 118, + 246, + 198 + ], + "type": "image", + "image_path": "5f13ce87060fa2e0026cd4685191eeb6d03a71b7dc1f351d6611e5d5c32e9c93.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 207, + 480, + 229 + ], + "lines": [ + { + "bbox": [ + 132, + 207, + 480, + 229 + ], + "spans": [ + { + "bbox": [ + 132, + 207, + 480, + 229 + ], + "type": "text", + "content": "Fig. 2: Precision-Recall (TPR) curve comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 272, + 118, + 372, + 198 + ], + "blocks": [ + { + "bbox": [ + 258, + 187, + 272, + 198 + ], + "lines": [ + { + "bbox": [ + 258, + 187, + 272, + 198 + ], + "spans": [ + { + "bbox": [ + 258, + 187, + 272, + 198 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 272, + 118, + 372, + 198 + ], + "lines": [ + { + "bbox": [ + 272, + 118, + 372, + 198 + ], + "spans": [ + { + "bbox": [ + 272, + 118, + 372, + 198 + ], + "type": "image", + "image_path": "50f68bce7dd1a95dfd0a7bf9f0a5e4491c8d81f1201d510c7e6fd0e6a34bca06.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 397, + 118, + 496, + 198 + ], + "blocks": [ + { + "bbox": [ + 384, + 187, + 396, + 198 + ], + "lines": [ + { + "bbox": [ + 384, + 187, + 396, + 198 + ], + "spans": [ + { + "bbox": [ + 384, + 187, + 396, + 198 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 397, + 118, + 496, + 198 + ], + "lines": [ + { + "bbox": [ + 397, + 118, + 496, + 198 + ], + "spans": [ + { + "bbox": [ + 397, + 118, + 496, + 198 + ], + "type": "image", + "image_path": "ac6a4068cb5987febe7b226a78f01ef90dbbc1e51993f238c90f18c51bd0b3d9.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 133, + 236, + 246, + 316 + ], + "blocks": [ + { + "bbox": [ + 133, + 236, + 246, + 316 + ], + "lines": [ + { + "bbox": [ + 133, + 236, + 246, + 316 + ], + "spans": [ + { + "bbox": [ + 133, + 236, + 246, + 316 + ], + "type": "image", + "image_path": "3fbf9aeff8f70bf139b1b6c8e3d7991b461bc309e52b7489ac1678eb4e891176.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 325, + 480, + 348 + ], + "lines": [ + { + "bbox": [ + 131, + 325, + 480, + 348 + ], + "spans": [ + { + "bbox": [ + 131, + 325, + 480, + 348 + ], + "type": "text", + "content": "Fig. 3: MRR with respect to 1,2,4,8 comparison for different methods on (a) In-shop Clothes, (b) CUB200 and (c) Cars196 dataset." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 258, + 237, + 370, + 316 + ], + "blocks": [ + { + "bbox": [ + 258, + 237, + 370, + 316 + ], + "lines": [ + { + "bbox": [ + 258, + 237, + 370, + 316 + ], + "spans": [ + { + "bbox": [ + 258, + 237, + 370, + 316 + ], + "type": "image", + "image_path": "018b6ae5551ea8837fbbec753530cdff141dc4a7b06bcfda6a909dcce02d962c.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 384, + 237, + 494, + 316 + ], + "blocks": [ + { + "bbox": [ + 384, + 237, + 494, + 316 + ], + "lines": [ + { + "bbox": [ + 384, + 237, + 494, + 316 + ], + "spans": [ + { + "bbox": [ + 384, + 237, + 494, + 316 + ], + "type": "image", + "image_path": "9420660c28bf6f4760b9b7879f80c441e842e67eec84b78c10c0214f3ff0bbda.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 358, + 482, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 464 + ], + "type": "text", + "content": "the strong baselines including CLIP model as well as FT-CLIP model finetuned based on CLIP model. The comparison is reported in Fig. 4 and Tab. 3, focusing on precision@K and MAP@100. Our IRGen model consistently outperforms the baselines, achieving the best results in terms of precision@K and MAP@100. The precision values for our model remain consistently high as " + }, + { + "bbox": [ + 130, + 358, + 482, + 464 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 358, + 482, + 464 + ], + "type": "text", + "content": " increases, while the baselines experience noticeable performance degradation. These results confirm the effectiveness of our model in handling large-scale datasets like ImageNet, where it maintains high precision across varying values of " + }, + { + "bbox": [ + 130, + 358, + 482, + 464 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 358, + 482, + 464 + ], + "type": "text", + "content": " and outperforms the baseline models." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 467, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 467, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 467, + 482, + 574 + ], + "type": "text", + "content": "Comparison to supervised deep quantization methods. We make the comparison with recent supervised deep quantization methods on ImageNet, including the state-of-the-art methods ADSVQ [116] and DPQ [49]. Notably, these methods exclusively utilize 100 classes from ImageNet, as indicated in their original papers, making it a substantially easier case. According to the original paper, DPQ [49] employed ResNet-50 (25.56M parameters), ADSVQ [116] utilized AlexNet (60.3M parameters), and DTQ [58] also used AlexNet. To ensure fair comparison, we employ a smaller network, ViT-S (22.1M parameters) and rerun over 100 classes. Tab. 4 illustrates the superiority of our approach." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 595, + 209, + 605 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 595, + 209, + 605 + ], + "spans": [ + { + "bbox": [ + 132, + 595, + 209, + 605 + ], + "type": "text", + "content": "4.2 Ablations" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "The effect of identifiers. In our study of image identifiers, we compared four different approaches: (1) assigning random identifiers to images, (2) hierarchical k-means (HKM), (3) Product Quantization (PQ) and (4) using the image tokenizer RQ-VAE [11]. The results of this comparison are summarized in Tab. 6." + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 157, + 473, + 220 + ], + "blocks": [ + { + "bbox": [ + 147, + 114, + 465, + 148 + ], + "lines": [ + { + "bbox": [ + 147, + 114, + 465, + 148 + ], + "spans": [ + { + "bbox": [ + 147, + 114, + 465, + 148 + ], + "type": "text", + "content": "Table 3: MAP@100 on two million- Table 4: MAP@1000 for 32 bits level datasets. The results of CLIP and (equivalent to the length of our identiFT-CLIP are retrieved by SPANN. -fier) comparison on ImageNet dataset." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 157, + 473, + 220 + ], + "lines": [ + { + "bbox": [ + 148, + 157, + 473, + 220 + ], + "spans": [ + { + "bbox": [ + 148, + 157, + 473, + 220 + ], + "type": "table", + "html": "
ModelDatasetMethodMAP@1000 for 32 bits
ImageNetPlaces365DTQ [58]68.12
CLIP44.122.1ADSVQ [116]75.21
FT-CLIP65.530.3DPQ [49]87.70
IRGen(Ours)76.044.3IRGen(Ours)93.52
", + "image_path": "444b3143d2d513f2a0df3a41c8a614860eca168264baa2b9dd315304421c1d70.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 208, + 258, + 406, + 306 + ], + "blocks": [ + { + "bbox": [ + 132, + 231, + 481, + 253 + ], + "lines": [ + { + "bbox": [ + 132, + 231, + 481, + 253 + ], + "spans": [ + { + "bbox": [ + 132, + 231, + 481, + 253 + ], + "type": "text", + "content": "Table 5: Generalize to new data. We split " + }, + { + "bbox": [ + 132, + 231, + 481, + 253 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 132, + 231, + 481, + 253 + ], + "type": "text", + "content": " of the training data from the ImageNet dataset for inference and remained unseen during training." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 208, + 258, + 406, + 306 + ], + "lines": [ + { + "bbox": [ + 208, + 258, + 406, + 306 + ], + "spans": [ + { + "bbox": [ + 208, + 258, + 406, + 306 + ], + "type": "table", + "html": "
ModelPrecision
110100
FT-CLIP + Linear Scan70.665.055.6
IRGen (Ours)77.077.977.4
", + "image_path": "d745a4405e5b4b03ca6934c0ab53affe37b1a3e8fb4b4a56f39542f4158d87fe.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 318, + 481, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 318, + 481, + 509 + ], + "spans": [ + { + "bbox": [ + 130, + 318, + 481, + 509 + ], + "type": "text", + "content": "The random assignment of identifiers to images yielded expectedly lower performance. This performance gap can be attributed to the fact that models with random identifiers need to learn not only the interaction between queries and image identifiers but also allocate capacity to learn relationships within the identifiers themselves. On the other hand, HKM showed superior performance compared to random assignment, underscoring the significance of semantic identifiers. However, our proposed semantic image identifiers demonstrated a clear improvement over HKM, highlighting their effectiveness in enhancing retrieval performance. PQ codes perform worse than the random assigned identifiers. This underperformance may stem from the model's challenges in constructing semantic information from PQ codes, which might be incompatible with autoregressive prediction mechanism. This highlights the significance of our sequence order in autoregressive training process. In contrast, the performance of RQ-VAE significantly trailed behind our model, with a performance less than 10 percent. We attribute this difference to the sequence length in RQ-VAE which is too long for the model to effectively capture relationships within the identifiers." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "Generalize to new data. Addressing the inclusion of fresh data holds particular significance, especially in the context of search scenarios. To assess this capacity, we conduct an experiment where we intentionally withheld " + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": " of the training data from the ImageNet dataset during the training phase and introduced it during inference, all without updating the existing codebook and AR model. In this experiment, we compare our model with the formidable baseline FT-CLIP, which is equipped with a linear scan search. The results, as displayed in Tab. 5, reveal that our model maintains superior performance even when confronted with new data. This observation highlights our model's ability to effectively generalize to previously unseen data. In scenarios where more new data come in with vastly different semantic structure, leading to the distribution of gallery data change drastically, all data-dependent component such as embedding model as well as joint learning methods including IRGen, have to" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 115, + 302, + 243 + ], + "blocks": [ + { + "bbox": [ + 138, + 115, + 302, + 243 + ], + "lines": [ + { + "bbox": [ + 138, + 115, + 302, + 243 + ], + "spans": [ + { + "bbox": [ + 138, + 115, + 302, + 243 + ], + "type": "image", + "image_path": "1ccefc47b807cb75dfe50f645edc717bc00099a988d1bcf99f2957236a1f0289.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 146, + 242, + 465, + 253 + ], + "lines": [ + { + "bbox": [ + 146, + 242, + 465, + 253 + ], + "spans": [ + { + "bbox": [ + 146, + 242, + 465, + 253 + ], + "type": "text", + "content": "Fig. 4: Precision comparison on large scale datasets: ImageNet and Places365." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 309, + 114, + 474, + 243 + ], + "blocks": [ + { + "bbox": [ + 309, + 114, + 474, + 243 + ], + "lines": [ + { + "bbox": [ + 309, + 114, + 474, + 243 + ], + "spans": [ + { + "bbox": [ + 309, + 114, + 474, + 243 + ], + "type": "image", + "image_path": "8c3a38dfd2c20474700e30ed2d4ffa50a796207363f0751401fc65bd2d3a7fc3.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 173, + 284, + 441, + 377 + ], + "blocks": [ + { + "bbox": [ + 181, + 266, + 430, + 277 + ], + "lines": [ + { + "bbox": [ + 181, + 266, + 430, + 277 + ], + "spans": [ + { + "bbox": [ + 181, + 266, + 430, + 277 + ], + "type": "text", + "content": "Table 6: Ablation study on the image identifier (T=length)." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 173, + 284, + 441, + 377 + ], + "lines": [ + { + "bbox": [ + 173, + 284, + 441, + 377 + ], + "spans": [ + { + "bbox": [ + 173, + 284, + 441, + 377 + ], + "type": "table", + "html": "
IdentifierTPrecisionRecall
11020301102030
Random487.675.470.868.387.695.196.096.1
\\( \\mathrm{HKM}_{100} \\)488.280.078.277.387.293.194.395.0
\\( \\mathrm{HKM}_{200} \\)389.081.679.879.089.093.994.995.8
\\( \\mathrm{HKM}_{500} \\)289.581.779.878.989.595.396.597.0
PQ473.866.161.859.273.890.293.394.5
Ours492.189.789.589.592.196.897.597.7
", + "image_path": "ea5f06df81ff411efe3de0f93fec0ecf12e8ae29edf17e04dd4374b147eb09e8.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 388, + 480, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 480, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 480, + 448 + ], + "type": "text", + "content": "re-train the model and re-construct the data index. Essentially, generalization (or dynamic updates) only supports a small number of new data that do not substantially alter the distribution which we have demonstrated in our case. In future we may extend IRGen to an adaptive structure capable of capturing the evolving distribution of new data during training." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "text", + "content": "Storage requirement and Inference throuput. We first provide a comprehensive comparison of model capacity on the ImageNet dataset and the comparison is shown in the Tab. 7. It is crucial to emphasize that a retrieval system's storage considerations extend beyond just the model; it must also store features for all database vectors, constituting a substantial portion of storage requirements, especially in the context of a large database. While compression can alleviate this concern, the performance is severely compromised due to quantization. Our GPU inference cost, tested on a Tesla P100 PCIe 16GB GPU, is 0.037s/image, which is near-real-time, considering practical retrieval times at the order of 10 milliseconds. Moreover, our approach achieves " + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "inline_equation", + "content": "76\\%" + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "text", + "content": " MAP@100, Moreover, our approach achieves " + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "inline_equation", + "content": "76\\%" + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "text", + "content": " MAP@100, significantly surpassing the FT-CLIP with SPANN result of " + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "inline_equation", + "content": "65.5\\%" + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "text", + "content": ", and is competitive with FT-CLIP utilizing linear scan, which achieves " + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "inline_equation", + "content": "77\\%" + }, + { + "bbox": [ + 130, + 449, + 481, + 616 + ], + "type": "text", + "content": ". Notably, however, the FT-CLIP with linear scan method demands 0.14 seconds per image and considerable memory usage." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "content": "We further report additional inference throughput on Inshop dataset for 100 queries, with beam sizes set at 1, 10, 20, and 30 for comparison. This analysis is conducted on an NVIDIA V100-16G GPU and we break down the time cost of each component during autoregressive retrieval. As shown in Fig. 5, the encoder" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 133, + 500, + 171 + ], + "blocks": [ + { + "bbox": [ + 144, + 114, + 469, + 126 + ], + "lines": [ + { + "bbox": [ + 144, + 114, + 469, + 126 + ], + "spans": [ + { + "bbox": [ + 144, + 114, + 469, + 126 + ], + "type": "text", + "content": "Table 7: Comprehensive comparison of storage requirement and inference cost." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 133, + 500, + 171 + ], + "lines": [ + { + "bbox": [ + 133, + 133, + 500, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 133, + 500, + 171 + ], + "type": "table", + "html": "
MethodModel(Params)Database storage
IRGenViT-base encoder(86M)+24-layer decoder(307M)4.9MB: 4 bytes/image
FT-CLIPViT-base(86M)3.67GB: 768x4 bytes/image
", + "image_path": "c9e5041b9a4ae1b25ab37e0b7f36256d5e5f2ca08216d37759f95ffacc723a82.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 204, + 182, + 411, + 257 + ], + "blocks": [ + { + "bbox": [ + 204, + 182, + 411, + 257 + ], + "lines": [ + { + "bbox": [ + 204, + 182, + 411, + 257 + ], + "spans": [ + { + "bbox": [ + 204, + 182, + 411, + 257 + ], + "type": "image", + "image_path": "fee9b7080db75d046001dfbc17acd2e41b1b34eecac480e331d2024274efa03e.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 192, + 257, + 420, + 268 + ], + "lines": [ + { + "bbox": [ + 192, + 257, + 420, + 268 + ], + "spans": [ + { + "bbox": [ + 192, + 257, + 420, + 268 + ], + "type": "text", + "content": "Fig. 5: Illustrating the search speed using beam search." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 278, + 481, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 481, + 350 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 481, + 350 + ], + "type": "text", + "content": "is quite fast, while the autoregressive decoder becomes the major bottleneck, especially as the beam size increases. Additional time is consumed for checking the validity of predictions, as it's possible that the predicted identifier may not exist in the database. Overall, the time cost is within an acceptable range. For instance, it takes approximately 0.07 seconds (with a beam size of 10) or 0.19 seconds (with a beam size of 30) per query." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 350, + 481, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 481, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 481, + 411 + ], + "type": "text", + "content": "For inference speed, we anticipate that the prevalent reliance on GPUs will swiftly lead to newer GPU generations with increased processing power, more efficient memory management, and improved hardware support, enhancing the speed of our autoregressive retrieval. Additionally, our model, being GPT-based, can leverage rapidly developed acceleration techniques designed for GPT." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 426, + 220, + 440 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 426, + 220, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 426, + 220, + 440 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 449, + 481, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 481, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 481, + 545 + ], + "type": "text", + "content": "In this paper, we delve into the realm of generative modeling to enable end-to-end image retrieval, a process that directly connects a query image to its closest match. With the introduction of semantic image tokenizer, we've demonstrated that our model excels at achieving remarkable precision without compromising recall. Through extensive ablation studies and evaluations, we've underscored the superior performance of our approach. We believe that this innovative approach to generative modeling in image retrieval not only pushes the boundaries of this field but also holds potential for broader applications." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 481, + 666 + ], + "type": "text", + "content": "Limitations. While our model has shown significant performance improvements, it's important to acknowledge its limitations. First, though our model has demonstrated scalability to million-scale datasets, dealing with billion-scale datasets is a complex challenge. It may necessitate even larger models with higher capacity, potentially impacting inference speed. Striking a balance between model capacity and speed is an area that warrants exploration for efficient and effective billion-scale search. Second Training large autoregressive models requires substantial computational resources, which raises environmental concerns. Research efforts to enable efficient training, such as fast fine-tuning of pretrained models, are crucial to mitigate energy consumption and environmental impact." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 479, + 166 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 479, + 166 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 479, + 166 + ], + "type": "text", + "content": "This work is supported by Fundamental Research Funds for the Central Universities (2243100004)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 197, + 198 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 197, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 197, + 198 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 211, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 142, + 211, + 480, + 244 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 211, + 480, + 244 + ], + "spans": [ + { + "bbox": [ + 142, + 211, + 480, + 244 + ], + "type": "text", + "content": "1. Adiwardana, D., Luong, M.T., So, D.R., Hall, J., Fiedel, N., Thoppilan, R., Yang, Z., Kulshreshtha, A., Nemade, G., Lu, Y., et al.: Towards a human-like open-domain chatbot. arXiv preprint arXiv:2001.09977 (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 142, + 246, + 480, + 277 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 246, + 480, + 277 + ], + "spans": [ + { + "bbox": [ + 142, + 246, + 480, + 277 + ], + "type": "text", + "content": "2. Alayrac, J.B., Donahue, J., Luc, P., Miech, A., Barr, I., Hasson, Y., Lenc, K., Mensch, A., Millican, K., Reynolds, M., et al.: Flamingo: a visual language model for few-shot learning. arXiv preprint arXiv:2204.14198 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 142, + 279, + 480, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 279, + 480, + 311 + ], + "spans": [ + { + "bbox": [ + 142, + 279, + 480, + 311 + ], + "type": "text", + "content": "3. Alzu'bi, A., Amira, A., Ramzan, N.: Semantic content-based image retrieval: A comprehensive study. Journal of Visual Communication and Image Representation 32, 20-54 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 312, + 480, + 334 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 312, + 480, + 334 + ], + "spans": [ + { + "bbox": [ + 142, + 312, + 480, + 334 + ], + "type": "text", + "content": "4. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM 51(1), 117-122 (2008)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 142, + 335, + 480, + 366 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 335, + 480, + 366 + ], + "spans": [ + { + "bbox": [ + 142, + 335, + 480, + 366 + ], + "type": "text", + "content": "5. Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 931-938 (2014)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 142, + 368, + 480, + 388 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 368, + 480, + 388 + ], + "spans": [ + { + "bbox": [ + 142, + 368, + 480, + 388 + ], + "type": "text", + "content": "6. Babenko, A., Lempitsky, V.: The inverted multi-index. IEEE transactions on pattern analysis and machine intelligence 37(6), 1247-1260 (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 390, + 480, + 422 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 390, + 480, + 422 + ], + "spans": [ + { + "bbox": [ + 142, + 390, + 480, + 422 + ], + "type": "text", + "content": "7. Bai, S., Tang, P., Torr, P.H., Latecki, L.J.: Re-ranking via metric fusion for object retrieval and person re-identification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 740-749 (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 142, + 423, + 480, + 444 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 423, + 480, + 444 + ], + "spans": [ + { + "bbox": [ + 142, + 423, + 480, + 444 + ], + "type": "text", + "content": "8. Bay, H., Tuytelaars, T., Van Gool, L.: Surf: Speeded up robust features. In: European conference on computer vision. pp. 404-417. Springer (2006)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 142, + 445, + 480, + 477 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 445, + 480, + 477 + ], + "spans": [ + { + "bbox": [ + 142, + 445, + 480, + 477 + ], + "type": "text", + "content": "9. Bengio, Y., Léonard, N., Courville, A.: Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432 (2013)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 479, + 480, + 499 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 480, + 499 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 480, + 499 + ], + "type": "text", + "content": "10. Bentley, J.L.: K-d trees for semidynamic point sets. In: Proceedings of the sixth annual symposium on Computational geometry. pp. 187-197 (1990)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 501, + 480, + 532 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 501, + 480, + 532 + ], + "spans": [ + { + "bbox": [ + 138, + 501, + 480, + 532 + ], + "type": "text", + "content": "11. Bevilacqua, M., Ottaviano, G., Lewis, P., Yih, W.t., Riedel, S., Petroni, F.: Autoregressive search engines: Generating substrings as document identifiers. arXiv preprint arXiv:2204.10628 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 533, + 480, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 533, + 480, + 576 + ], + "spans": [ + { + "bbox": [ + 138, + 533, + 480, + 576 + ], + "type": "text", + "content": "12. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 578, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 609 + ], + "type": "text", + "content": "13. Cao, B., Araujo, A., Sim, J.: Unifying deep local and global features for image search. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 726-743. Springer (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 611, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 480, + 632 + ], + "type": "text", + "content": "14. Cao, Y., Wang, C., Zhang, L., Zhang, L.: Edgel index for large-scale sketch-based image search. In: CVPR 2011. pp. 761-768. IEEE (2011)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "text", + "content": "15. Cao, Y., Long, M., Wang, J., Liu, S.: Collective deep quantization for efficient cross-modal retrieval. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 31 (2017)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "type": "text", + "content": "16. Cao, Y., Long, M., Wang, J., Zhu, H., Wen, Q.: Deep quantization network for efficient image retrieval. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. p. 3457-3463. AAAI'16, AAAI Press (2016)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 150, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 150, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 150, + 480, + 183 + ], + "type": "text", + "content": "17. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative pretraining from pixels. In: International conference on machine learning. pp. 1691-1703. PMLR (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 183, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 183, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 138, + 183, + 480, + 215 + ], + "type": "text", + "content": "18. Chen, Q., Zhao, B., Wang, H., Li, M., Liu, C., Li, Z., Yang, M., Wang, J.: Spann: Highly-efficient billion-scale approximate nearest neighborhood search. Advances in Neural Information Processing Systems 34, 5199-5212 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 216, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 216, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 138, + 216, + 480, + 248 + ], + "type": "text", + "content": "19. Chen, T., Li, L., Sun, Y.: Differentiable product quantization for end-to-end embedding compression. In: International Conference on Machine Learning. pp. 1617-1626. PMLR (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 249, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 249, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 138, + 249, + 480, + 281 + ], + "type": "text", + "content": "20. Cho, J., Lu, J., Schwenk, D., Hajishirzi, H., Kembhavi, A.: X-lxmert: Paint, caption and answer questions with multi-modal transformers. arXiv preprint arXiv:2009.11278 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 281, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 281, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 138, + 281, + 480, + 315 + ], + "type": "text", + "content": "21. Chowdhery, A., Narang, S., Devlin, J., Bosma, M., Mishra, G., Roberts, A., Barham, P., Chung, H.W., Sutton, C., Gehrmann, S., et al.: Palm: Scaling language modeling with pathways. arXiv preprint arXiv:2204.02311 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 315, + 480, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 315, + 480, + 336 + ], + "spans": [ + { + "bbox": [ + 138, + 315, + 480, + 336 + ], + "type": "text", + "content": "22. Chum, O., Philbin, J., Zisserman, A., et al.: Near duplicate image detection: Min-cache and tfidf weighting. In: Bmvc. vol. 810, pp. 812-815 (2008)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 336, + 480, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 336, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 138, + 336, + 480, + 357 + ], + "type": "text", + "content": "23. Chung, Y.A., Hsu, W.N., Tang, H., Glass, J.: An unsupervised autoregressive model for speech representation learning. arXiv preprint arXiv:1904.03240 (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 358, + 480, + 379 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 358, + 480, + 379 + ], + "spans": [ + { + "bbox": [ + 138, + 358, + 480, + 379 + ], + "type": "text", + "content": "24. De Cao, N., Aziz, W., Titov, I.: Highly parallel autoregressive entity linking with discriminative correction. arXiv preprint arXiv:2109.03792 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 380, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 380, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 138, + 380, + 480, + 402 + ], + "type": "text", + "content": "25. De Cao, N., Izacard, G., Riedel, S., Petroni, F.: Autoregressive entity retrieval. arXiv preprint arXiv:2010.00904 (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 403, + 480, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 480, + 445 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 480, + 445 + ], + "type": "text", + "content": "26. De Cao, N., Wu, L., Popat, K., Artetxe, M., Goyal, N., Plekhanov, M., Zettlemoyer, L., Cancedda, N., Riedel, S., Petroni, F.: Multilingual autoregressive entity linking. Transactions of the Association for Computational Linguistics 10, 274-290 (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 446, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 446, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 446, + 480, + 479 + ], + "type": "text", + "content": "27. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 479, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 480, + 511 + ], + "type": "text", + "content": "28. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 512, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 512, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 512, + 480, + 533 + ], + "type": "text", + "content": "29. Dhariwal, P., Jun, H., Payne, C., Kim, J.W., Radford, A., Sutskever, I.: Jukebox: A generative model for music. arXiv preprint arXiv:2005.00341 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 534, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 534, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 138, + 534, + 480, + 566 + ], + "type": "text", + "content": "30. Ding, M., Zheng, W., Hong, W., Tang, J.: Cogview2: Faster and better text-to-image generation via hierarchical transformers. arXiv preprint arXiv:2204.14217 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 567, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 480, + 599 + ], + "type": "text", + "content": "31. Dizaji, K.G., Zheng, F., Sadoughi, N., Yang, Y., Deng, C., Huang, H.: Unsupervised deep generative adversarial hashing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3664-3673 (2018)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 600, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 643 + ], + "type": "text", + "content": "32. Du, N., Huang, Y., Dai, A.M., Tong, S., Lepikhin, D., Xu, Y., Krikun, M., Zhou, Y., Yu, A.W., First, O., et al.: Glam: Efficient scaling of language models with mixture-of-experts. In: International Conference on Machine Learning. pp. 5547-5569. PMLR (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "text", + "content": "33. El-Nouby, A., Neverova, N., Laptev, I., Jégou, H.: Training vision transformers for image retrieval. arXiv preprint arXiv:2102.05644 (2021)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "type": "text", + "content": "34. Erin Liong, V., Lu, J., Wang, G., Moulin, P., Zhou, J.: Deep hashing for compact binary codes learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2475-2483 (2015)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 150, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 150, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 150, + 480, + 183 + ], + "type": "text", + "content": "35. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Make-a-scene: Scene-based text-to-image generation with human priors. arXiv preprint arXiv:2203.13131 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 183, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 183, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 138, + 183, + 480, + 205 + ], + "type": "text", + "content": "36. Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization. IEEE transactions on pattern analysis and machine intelligence 36(4), 744-755 (2013)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 205, + 480, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 205, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 138, + 205, + 480, + 247 + ], + "type": "text", + "content": "37. Gong, Y., Lazebnik, S., Gordo, A., Perronnin, F.: Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE transactions on pattern analysis and machine intelligence 35(12), 2916-2929 (2012)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 249, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 249, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 138, + 249, + 480, + 281 + ], + "type": "text", + "content": "38. Gulrajani, I., Kumar, K., Ahmed, F., Taiga, A.A., Visin, F., Vazquez, D., Courville, A.: Pixelvae: A latent variable model for natural images. arXiv preprint arXiv:1611.05013 (2016)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "type": "text", + "content": "39. Guo, R., Sun, P., Lindgren, E., Geng, Q., Simcha, D., Chern, F., Kumar, S.: Accelerating large-scale inference with anisotropic vector quantization. In: International Conference on Machine Learning. pp. 3887-3896. PMLR (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 315, + 480, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 315, + 480, + 347 + ], + "spans": [ + { + "bbox": [ + 138, + 315, + 480, + 347 + ], + "type": "text", + "content": "40. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 348, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 348, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 348, + 480, + 380 + ], + "type": "text", + "content": "41. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing. pp. 604-613 (1998)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 381, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 381, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 138, + 381, + 480, + 413 + ], + "type": "text", + "content": "42. Jang, Y.K., Cho, N.I.: Generalized product quantization network for semi-supervised image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3420-3429 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 414, + 480, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 414, + 480, + 445 + ], + "spans": [ + { + "bbox": [ + 138, + 414, + 480, + 445 + ], + "type": "text", + "content": "43. Jang, Y.K., Cho, N.I.: Self-supervised product quantization for deep unsupervised image retrieval. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12085-12094 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 447, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 447, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 447, + 480, + 479 + ], + "type": "text", + "content": "44. Jayaram Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: Diskann: Fast accurate billion-point nearest neighbor search on a single node. Advances in Neural Information Processing Systems 32 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 479, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 480, + 511 + ], + "type": "text", + "content": "45. Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence 33(1), 117-128 (2010)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 512, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 512, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 512, + 480, + 544 + ], + "type": "text", + "content": "46. Jégou, H., Douze, M., Schmid, C., Pérez, P.: Aggregating local descriptors into a compact image representation. In: 2010 IEEE computer society conference on computer vision and pattern recognition. pp. 3304-3311. IEEE (2010)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 545, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 480, + 567 + ], + "type": "text", + "content": "47. Johnson, J., Douze, M., Jégou, H.: Billion-scale similarity search with gpus. IEEE Transactions on Big Data 7(3), 535-547 (2019)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 567, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 480, + 588 + ], + "type": "text", + "content": "48. Jun, H., Ko, B., Kim, Y., Kim, I., Kim, J.: Combination of multiple global descriptors for image retrieval. arXiv preprint arXiv:1903.10663 (2019)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 589, + 480, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 589, + 480, + 631 + ], + "spans": [ + { + "bbox": [ + 138, + 589, + 480, + 631 + ], + "type": "text", + "content": "49. Klein, B., Wolf, L.: End-to-end supervised product quantization for image search and retrieval. In: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 5036-5045 (2019). https://doi.org/10.1109/CVPR.2019.00518" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "50. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 137, + 116, + 480, + 139 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 116, + 480, + 139 + ], + "spans": [ + { + "bbox": [ + 137, + 116, + 480, + 139 + ], + "type": "text", + "content": "51. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Communications of the ACM 60(6), 84-90 (2017)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 137, + 140, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 140, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 137, + 140, + 481, + 184 + ], + "type": "text", + "content": "52. Lagunes-Fortiz, M., Damen, D., Mayol-Cuevas, W.: Centroids triplet network and temporally-consistent embeddings for in-situ object recognition. In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10796-10802. IEEE (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "spans": [ + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "type": "text", + "content": "53. Lee, D., Kim, C., Kim, S., Cho, M., Han, W.S.: Autoregressive image generation using residual quantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11523-11532 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 218, + 480, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 218, + 480, + 251 + ], + "spans": [ + { + "bbox": [ + 138, + 218, + 480, + 251 + ], + "type": "text", + "content": "54. Lee, S., Seong, H., Lee, S., Kim, E.: Correlation verification for image retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5374-5384 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 251, + 480, + 284 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 480, + 284 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 480, + 284 + ], + "type": "text", + "content": "55. Lew, M.S., Sebe, N., Djeraba, C., Jain, R.: Content-based multimedia information retrieval: State of the art and challenges. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 2(1), 1-19 (2006)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 285, + 480, + 318 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 480, + 318 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 480, + 318 + ], + "type": "text", + "content": "56. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 319, + 480, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 319, + 480, + 352 + ], + "spans": [ + { + "bbox": [ + 138, + 319, + 480, + 352 + ], + "type": "text", + "content": "57. Li, X., Uricchio, T., Ballan, L., Bertini, M., Snoek, C.G., Bimbo, A.D.: Socializing the semantic gap: A comparative survey on image tag assignment, refinement, and retrieval. ACM Computing Surveys (CSUR) 49(1), 1-39 (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 352, + 480, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 352, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 138, + 352, + 480, + 385 + ], + "type": "text", + "content": "58. Liu, B., Cao, Y., Long, M., Wang, J., Wang, J.: Deep triplet quantization. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 755-763 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 386, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 386, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 386, + 480, + 407 + ], + "type": "text", + "content": "59. Liu, Y., Zhang, D., Lu, G., Ma, W.Y.: A survey of content-based image retrieval with high-level semantics. Pattern recognition 40(1), 262-282 (2007)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 408, + 480, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 408, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 138, + 408, + 480, + 453 + ], + "type": "text", + "content": "60. Liu, Z., Cheng, K.T., Huang, D., Xing, E.P., Shen, Z.: Nonuniform-to-uniform quantization: Towards accurate quantization via generalized straight-through estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4942-4952 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 453, + 480, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 453, + 480, + 486 + ], + "spans": [ + { + "bbox": [ + 138, + 453, + 480, + 486 + ], + "type": "text", + "content": "61. Liu, Z., Luo, P., Qiu, S., Wang, X., Tang, X.: Deepfashion: Powering robust clothes recognition and retrieval with rich annotations. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1096-1104 (2016)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 487, + 480, + 518 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 487, + 480, + 518 + ], + "spans": [ + { + "bbox": [ + 138, + 487, + 480, + 518 + ], + "type": "text", + "content": "62. Lowe, D.G.: Object recognition from local scale-invariant features. In: Proceedings of the seventh IEEE international conference on computer vision. vol. 2, pp. 1150-1157. Ieee (1999)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 520, + 480, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 520, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 138, + 520, + 480, + 553 + ], + "type": "text", + "content": "63. Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence 42(4), 824-836 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 554, + 480, + 575 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 554, + 480, + 575 + ], + "spans": [ + { + "bbox": [ + 138, + 554, + 480, + 575 + ], + "type": "text", + "content": "64. Martinez, J., Hoos, H.H., Little, J.J.: Stacked quantizers for compositional vector compression. arXiv preprint arXiv:1411.2173 (2014)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 576, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 576, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 138, + 576, + 480, + 609 + ], + "type": "text", + "content": "65. Noh, H., Araujo, A., Sim, J., Weyand, T., Han, B.: Large-scale image retrieval with attentive deep local features. In: Proceedings of the IEEE international conference on computer vision. pp. 3456-3465 (2017)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 609, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 609, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 609, + 480, + 632 + ], + "type": "text", + "content": "66. Norouzi, M., Fleet, D.J.: Cartesian k-means. In: Proceedings of the IEEE Conference on computer Vision and Pattern Recognition. pp. 3017-3024 (2013)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "67. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. arXiv preprint arXiv:2203.02155 (2022)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "type": "text", + "content": "68. Park, M., Jin, J.S., Wilson, L.S.: Fast content-based image retrieval using quasigabor filter and reduction of image feature dimension. In: Proceedings fifth IEEE southwest symposium on image analysis and interpretation. pp. 178-182. IEEE (2002)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 160, + 481, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 160, + 481, + 193 + ], + "spans": [ + { + "bbox": [ + 138, + 160, + 481, + 193 + ], + "type": "text", + "content": "69. Qiu, Z., Yao, T., Mei, T.: Deep quantization: Encoding convolutional activations with deep generative model. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 6759-6768 (2017)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 193, + 481, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 193, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 138, + 193, + 481, + 236 + ], + "type": "text", + "content": "70. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 236, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 236, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 138, + 236, + 481, + 258 + ], + "type": "text", + "content": "71. Radford, A., Narasimhan, K., Salimans, T., Sutskever, I., et al.: Improving language understanding by generative pre-training (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 258, + 481, + 279 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 258, + 481, + 279 + ], + "spans": [ + { + "bbox": [ + 138, + 258, + 481, + 279 + ], + "type": "text", + "content": "72. Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I., et al.: Language models are unsupervised multitask learners. OpenAI blog 1(8), 9 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 279, + 481, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 279, + 481, + 311 + ], + "spans": [ + { + "bbox": [ + 138, + 279, + 481, + 311 + ], + "type": "text", + "content": "73. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 311, + 481, + 343 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 311, + 481, + 343 + ], + "spans": [ + { + "bbox": [ + 138, + 311, + 481, + 343 + ], + "type": "text", + "content": "74. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 343, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 343, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 138, + 343, + 481, + 374 + ], + "type": "text", + "content": "75. Razavian, A.S., Sullivan, J., Carlsson, S., Maki, A.: Visual instance retrieval with deep convolutional networks. ITE Transactions on Media Technology and Applications 4(3), 251-258 (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 374, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 374, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 374, + 481, + 407 + ], + "type": "text", + "content": "76. Ren, J., Zhang, M., Li, D.: Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory. Advances in Neural Information Processing Systems 33, 10672-10684 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 407, + 481, + 440 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 407, + 481, + 440 + ], + "spans": [ + { + "bbox": [ + 138, + 407, + 481, + 440 + ], + "type": "text", + "content": "77. Revaud, J., Almazán, J., Rezende, R.S., Souza, C.R.d.: Learning with average precision: Training image retrieval with a listwise loss. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5107-5116 (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 440, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 440, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 138, + 440, + 481, + 482 + ], + "type": "text", + "content": "78. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 483, + 481, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 483, + 481, + 515 + ], + "spans": [ + { + "bbox": [ + 138, + 483, + 481, + 515 + ], + "type": "text", + "content": "79. Shoeybi, M., Patwary, M., Puri, R., LeGresley, P., Casper, J., Catanzaro, B.: Megatron-lm: Training multi-billion parameter language models using model parallelism. arXiv preprint arXiv:1909.08053 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 515, + 481, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 515, + 481, + 548 + ], + "spans": [ + { + "bbox": [ + 138, + 515, + 481, + 548 + ], + "type": "text", + "content": "80. Siagian, C., Itti, L.: Rapid biologically-inspired scene classification using features shared with visual attention. IEEE transactions on pattern analysis and machine intelligence 29(2), 300-312 (2007)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 548, + 481, + 580 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 548, + 481, + 580 + ], + "spans": [ + { + "bbox": [ + 138, + 548, + 481, + 580 + ], + "type": "text", + "content": "81. Simeoni, O., Avrithis, Y., Chum, O.: Local features and visual words emerge in activations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11651-11660 (2019)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 580, + 481, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 580, + 481, + 601 + ], + "spans": [ + { + "bbox": [ + 138, + 580, + 481, + 601 + ], + "type": "text", + "content": "82. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 601, + 481, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 481, + 633 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 481, + 633 + ], + "type": "text", + "content": "83. Smeulders, A.W., Worring, M., Santini, S., Gupta, A., Jain, R.: Content-based image retrieval at the end of the early years. IEEE Transactions on pattern analysis and machine intelligence 22(12), 1349-1380 (2000)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "text", + "content": "84. Song, J., He, T., Gao, L., Xu, X., Hanjalic, A., Shen, H.T.: Binary generative adversarial networks for image retrieval. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32 (2018)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 138, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 138, + 117, + 480, + 149 + ], + "type": "text", + "content": "85. Tan, F., Yuan, J., Ordonez, V.: Instance-level image retrieval using reranking transformers. In: proceedings of the IEEE/CVF international conference on computer vision. pp. 12105-12115 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 151, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 151, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 151, + 480, + 183 + ], + "type": "text", + "content": "86. Tay, Y., Tran, V.Q., Dehghani, M., Ni, J., Bahri, D., Mehta, H., Qin, Z., Hui, K., Zhao, Z., Gupta, J., et al.: Transformer memory as a differentiable search index. arXiv preprint arXiv:2202.06991 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "spans": [ + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "type": "text", + "content": "87. Teichmann, M., Araujo, A., Zhu, M., Sim, J.: Detect-to-retrieve: Efficient regional aggregation for image search. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5109-5118 (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 218, + 480, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 218, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 138, + 218, + 480, + 239 + ], + "type": "text", + "content": "88. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 241, + 480, + 273 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 241, + 480, + 273 + ], + "spans": [ + { + "bbox": [ + 138, + 241, + 480, + 273 + ], + "type": "text", + "content": "89. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 274, + 480, + 295 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 274, + 480, + 295 + ], + "spans": [ + { + "bbox": [ + 138, + 274, + 480, + 295 + ], + "type": "text", + "content": "90. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 297, + 480, + 328 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 297, + 480, + 328 + ], + "spans": [ + { + "bbox": [ + 138, + 297, + 480, + 328 + ], + "type": "text", + "content": "91. Wang, J., Wang, J., Song, J., Xu, X.S., Shen, H.T., Li, S.: Optimized cartesian k-means. IEEE Transactions on Knowledge and Data Engineering 27(1), 180-192 (2014)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 331, + 480, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 331, + 480, + 352 + ], + "spans": [ + { + "bbox": [ + 138, + 331, + 480, + 352 + ], + "type": "text", + "content": "92. Wang, J., Hua, X.S.: Interactive image search by color map. ACM Transactions on Intelligent Systems and Technology (TIST) 3(1), 1-23 (2011)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 353, + 480, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 353, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 138, + 353, + 480, + 373 + ], + "type": "text", + "content": "93. Wang, J., Zhang, T.: Composite quantization. IEEE transactions on pattern analysis and machine intelligence 41(6), 1308-1322 (2018)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 376, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 376, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 376, + 480, + 418 + ], + "type": "text", + "content": "94. Wang, W., Bao, H., Dong, L., Bjorck, J., Peng, Z., Liu, Q., Aggarwal, K., Mohammed, O.K., Singhal, S., Som, S., et al.: Image as a foreign language: Beit pretraining for all vision and vision-language tasks. arXiv preprint arXiv:2208.10442 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 420, + 480, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 420, + 480, + 452 + ], + "spans": [ + { + "bbox": [ + 138, + 420, + 480, + 452 + ], + "type": "text", + "content": "95. Wang, X.Y., Zhang, B.B., Yang, H.Y.: Content-based image retrieval by integrating color and texture features. Multimedia tools and applications 68(3), 545-569 (2014)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 453, + 480, + 485 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 453, + 480, + 485 + ], + "spans": [ + { + "bbox": [ + 138, + 453, + 480, + 485 + ], + "type": "text", + "content": "96. Wang, Y., Hou, Y., Wang, H., Miao, Z., Wu, S., Sun, H., Chen, Q., Xia, Y., Chi, C., Zhao, G., et al.: A neural corpus indexer for document retrieval. arXiv preprint arXiv:2206.02743 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 487, + 480, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 487, + 480, + 508 + ], + "spans": [ + { + "bbox": [ + 138, + 487, + 480, + 508 + ], + "type": "text", + "content": "97. Weissenborn, D., Täckström, O., Uszkoreit, J.: Scaling autoregressive video models. arXiv preprint arXiv:1906.02634 (2019)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "text", + "content": "98. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: European conference on computer vision. pp. 499-515. Springer (2016)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 544, + 480, + 575 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 575 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 575 + ], + "type": "text", + "content": "99. Wengert, C., Douze, M., Jégou, H.: Bag-of-colors for improved image search. In: Proceedings of the 19th ACM international conference on Multimedia. pp. 1437-1440 (2011)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 577, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 480, + 609 + ], + "type": "text", + "content": "00. Wieczorek, M., Michalowski, A., Wroblewska, A., Dabrowski, J.: A strong baseline for fashion retrieval with person re-identification models. In: International Conference on Neural Information Processing. pp. 294–301. Springer (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "type": "text", + "content": "01. Wu, C., Liang, J., Ji, L., Yang, F., Fang, Y., Jiang, D., Duan, N.: Niwa: Visual synthesis pre-training for neural visual world creation. In: European Conference on Computer Vision. pp. 720-736. Springer (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "text", + "content": "02. Xia, Y., He, K., Wen, F., Sun, J.: Joint inverted indexing. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 3416-3423 (2013)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "20" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 19 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "103. Xiao, T., Li, H., Ouyang, W., Wang, X.: Learning deep feature representations with domain guided dropout for person re-identification. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1249-1258 (2016)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "type": "text", + "content": "104. Xu, Y., Lee, H., Chen, D., Hechtman, B., Huang, Y., Joshi, R., Krikun, M., Lepikhin, D., Ly, A., Maggioni, M., et al.: Gspmd: general and scalable parallelization for ml computation graphs. arXiv preprint arXiv:2105.04663 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 194, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 481, + 237 + ], + "type": "text", + "content": "105. Yang, M., He, D., Fan, M., Shi, B., Xue, X., Li, F., Ding, E., Huang, J.: Dolg: Single-stage image retrieval with deep orthogonal fusion of local and global features. In: Proceedings of the IEEE/CVF International conference on Computer Vision. pp. 11772-11781 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 237, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 237, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 133, + 237, + 481, + 270 + ], + "type": "text", + "content": "106. Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R.R., Le, Q.V.: Xlnet: Generalized autoregressive pretraining for language understanding. Advances in neural information processing systems 32 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 270, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 270, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 133, + 270, + 481, + 303 + ], + "type": "text", + "content": "107. Yu, J., Li, X., Koh, J.Y., Zhang, H., Pang, R., Qin, J., Ku, A., Xu, Y., Baldridge, J., Wu, Y.: Vector-quantized image modeling with improved vqgan. arXiv preprint arXiv:2110.04627 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 303, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 303, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 133, + 303, + 481, + 335 + ], + "type": "text", + "content": "108. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 335, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 335, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 133, + 335, + 481, + 369 + ], + "type": "text", + "content": "109. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. arXiv preprint arXiv:2206.10789 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 369, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 369, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 133, + 369, + 481, + 413 + ], + "type": "text", + "content": "110. Yuan, Y., Chen, W., Yang, Y., Wang, Z.: In defense of the triplet loss again: Learning robust person re-identification with fast approximated triplet loss and label distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 354-355 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 413, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 413, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 133, + 413, + 481, + 435 + ], + "type": "text", + "content": "111. Zhai, A., Wu, H.Y.: Classification is a strong baseline for deep metric learning. arXiv preprint arXiv:1811.12649 (2018)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 435, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 435, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 133, + 435, + 481, + 479 + ], + "type": "text", + "content": "112. Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., Ma, S.: Jointly optimizing query encoder and product quantization to improve retrieval performance. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management. pp. 2487-2496 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 479, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 479, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 133, + 479, + 481, + 533 + ], + "type": "text", + "content": "113. Zhang, H., Shen, H., Qiu, Y., Jiang, Y., Wang, S., Xu, S., Xiao, Y., Long, B., Yang, W.Y.: Joint learning of deep retrieval model and product quantization based embedding index. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. pp. 1718-1722 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 533, + 481, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 533, + 481, + 566 + ], + "spans": [ + { + "bbox": [ + 133, + 533, + 481, + 566 + ], + "type": "text", + "content": "114. Zhang, L., Rui, Y.: Image search—from thousands to billions in 20 years. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 9(1s), 1-20 (2013)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 566, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 566, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 133, + 566, + 481, + 600 + ], + "type": "text", + "content": "115. Zhou, B., Lapedriza, A., Khosla, A., Oliva, A., Torralba, A.: Places: A 10 million image database for scene recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (2017)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 133, + 600, + 481, + 632 + ], + "type": "text", + "content": "116. Zhou, C., Po, L.M., Ou, W.: Angular deep supervised vector quantization for image retrieval. IEEE Transactions on Neural Networks and Learning Systems 33(4), 1638-1649 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "type": "text", + "content": "117. Zhou, K., Yang, Y., Cavallaro, A., Xiang, T.: Omni-scale feature learning for person re-identification. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3702-3712 (2019)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "IRGen: Generative Modeling for Image Retrieval" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "21" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 20 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 171 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "text", + "content": "118. Zhou, W., Li, H., Tian, Q.: Recent advance in content-based image retrieval: A literature survey. arXiv preprint arXiv:1706.06064 (2017)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "type": "text", + "content": "119. Zhu, H., Long, M., Wang, J., Cao, Y.: Deep hashing network for efficient similarity retrieval. In: Proceedings of the AAAI conference on Artificial Intelligence. vol. 30 (2016)" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "22" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "Y. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 21 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_content_list.json b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..ada753f349e6732440b3e2e40838d4a90b5c786f --- /dev/null +++ b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_content_list.json @@ -0,0 +1,1693 @@ +[ + { + "type": "text", + "text": "IRSAM: Advancing Segment Anything Model for Infrared Small Target Detection", + "text_level": 1, + "bbox": [ + 218, + 140, + 782, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Mingjin Zhang $^{1}$ , Yuchun Wang $^{1}$ , Jie Guo $^{1}$ , Yunsong Li $^{1}$ , Xinbo Gao $^{1,2}$ , and Jing Zhang $^{3}$", + "bbox": [ + 245, + 212, + 754, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Xidian University, Xi'an, China {mjinzhang, 22011210918, jguo, ysli}@xidian.edu.cn", + "bbox": [ + 305, + 253, + 694, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Chongqing University of Posts and Telecommunications, Chongqing, China \n $^{3}$ The University of Sydney, Sydney, Australia", + "bbox": [ + 243, + 282, + 756, + 310 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. The recent Segment Anything Model (SAM) is a significant advancement in natural image segmentation, exhibiting potent zero-shot performance suitable for various downstream image segmentation tasks. However, directly utilizing the pretrained SAM for Infrared Small Target Detection (IRSTD) task falls short in achieving satisfying performance due to a notable domain gap between natural and infrared images. Unlike a visible light camera, a thermal imager reveals an object's temperature distribution by capturing infrared radiation. Small targets often show a subtle temperature transition at the object's boundaries. To address this issue, we propose the IRSAM model for IRSTD, which improves SAM's encoder-decoder architecture to learn better feature representation of infrared small objects. Specifically, we design a Perona-Malik diffusion (PMD)-based block and incorporate it into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder to capture structural information that may be lost in long-distance modeling. Extensive experiments on the public datasets, including NUAA-SIRST, NUDT-SIRST, and IRSTD-1K, validate the design choice of IRSAM and its significant superiority over representative state-of-the-art methods. The source code are available at: github.com/IPIC-Lab/IRSAM.", + "bbox": [ + 259, + 352, + 743, + 645 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Infrared small target detection $\\cdot$ Segment anything model $\\cdot$ Perona-Malik diffusion equation $\\cdot$ Granularity-Aware Decoder", + "bbox": [ + 259, + 657, + 740, + 686 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 714, + 375, + 729 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Infrared small target detection (IRSTD) plays a crucial role in various real-world applications, including traffic management and maritime rescue [9,27,34]. Infrared imaging uniquely captures thermal radiation, less affected by atmospheric scattering than visible light. Thus, under challenging visible light conditions like fog or rain, infrared images provide richer target information, making them more suitable for detecting obscured or indistinguishable targets, especially", + "bbox": [ + 212, + 748, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "small ones. Consequently, IRSTD has been a prominent focus in computer vision for decades [32, 47].", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The traditional IRSTD methods can be divided into three subgroups: filter-", + "bbox": [ + 212, + 181, + 782, + 196 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "based, human visual system (HVS)-based, and low-rank representatior-based methods [45]. However, these methods are effective only in high contrast or simple background scenarios, struggling in more challenging conditions due to heavy reliance on hyperparameter tuning and handcrafted features with limited representation ability. Recent advancements in deep learning and the availability of IRSTD public datasets offer a new solution. Approaches us", + "bbox": [ + 212, + 196, + 416, + 482 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "ing deep learning for IRSTD include generative adversarial networks (GANs) [29, 40, 41, 49], U-Net-based networks [7, 8, 30, 47] and transformer-based methods [38].", + "bbox": [ + 212, + 483, + 782, + 529 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Although these methods hold promise, their efficacy heavily relies on the architecture's specific design and the scale of training data. Obtaining such data is inherently more challenging compared to natural image datasets. With extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18,25] in mitigating generalization issues with limited training data for downstream tasks, a crucial question arises: Can a well-designed model pre-trained on a large-scale natural image dataset effectively kickstart the IRSTD task?", + "bbox": [ + 212, + 532, + 785, + 652 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Segment Anything Model (SAM) [20] has recently sparked a surge of interest in the field of computer vision image segmentation. Built upon the plain vision transformer-based encoder-decoder architecture and trained on the world's largest segmentation dataset, its powerful zero-shot segmentation capability has inspired many studies that apply SAM to various image segmentation tasks [17, 19, 23, 35]. While SAM shows promising results, they are not tailored for the IRSTD problem, facing challenges due to significant differences between infrared and natural images. (1) Infrared small target images, characterized by the small size of distant targets and substantial background noise and clutter, face challenges in distinguishing targets from the background when employing SAM directly due to a low signal-to-noise ratio (SNR). (2) Infrared imaging relies on the thermal radiation of objects, differing from optical imaging. The", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/caaa39fd844c95e7cafbb416c756fed8890f308e440304bd1d90f00557645e06.jpg", + "image_caption": [ + "Fig. 1: Visual Comparison. Segmentation results of different methods on complex structured targets." + ], + "image_footnote": [], + "bbox": [ + 450, + 227, + 750, + 406 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "gradual radiation difference between the object and the background in infrared images results in a blurred target edge. This fuzzy edge makes SAM prone to segmenting the original gap into targets, especially when dealing with targets with complex structures, as demonstrated in Fig. 1. To address these issues, we aim to advance SAM for IRSTD through transfer learning, with a particular emphasis on refining its architecture to learn better feature representation for infrared small objects.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To this end, we propose the IRSAM model for IRSTD. It builds upon SAM with carefully designed blocks to improve its encoder and decoder, enhancing its ability to detect arbitrary infrared small objects in the context of background noise and clutter. Specifically, inspired by the Perona-Malik diffusion (PMD) equation used in image processing for image denoising and edge preservation, we design a Wavelet-based Perona-Malik Diffusion (WpMD) module by leveraging the wavelet transform to substitute the gradient term in the PMD equation. WpMD is incorporated into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder via a two-way transformer to enhance the mask representation of objects in various sizes and shapes. To reduce the model size and computational complexity, we adopt the lightweight Mobile-SAM [33] as the base model and integrated the WpMD module and GAD to build our IRSAM.", + "bbox": [ + 212, + 252, + 789, + 464 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The contributions of this paper can be summarized as:", + "bbox": [ + 240, + 464, + 635, + 479 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We introduce IRSAM by redesigning the general vision segmentation model SAM for the IRSTD task for the first time. IRSAM outperforms the vanilla SAM model and state-of-the-art (SOTA) methods on challenging benchmarks in terms of both objective metrics and subjective evaluation, demonstrating superior performance.", + "- We design a WpMD module to enhance the ability of SAM's encoder to preserve edge-related features while suppressing the noise in the infrared images, effectively addressing the low-SNR issue in the IRSTD task.", + "- We design an GAD to reconstruct the target structural feature lost in capturing long-distance dependence by fusing the multi-granularity feature from the encoder via a carefully designed edge token, effectively enhancing the mask representation of objects in various sizes and shapes." + ], + "bbox": [ + 225, + 488, + 785, + 671 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 705, + 387, + 722 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Infrared Small Target Detection", + "text_level": 1, + "bbox": [ + 215, + 738, + 527, + 753 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The traditional IRSTD methods including Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26] based on hand-crafted features are tailored to specific scenarios, limiting their generalization to challenging situations. The deep learning-based methods have shown significant progress in IRSTD. For example, MDvsFA [29] applies", + "bbox": [ + 212, + 763, + 795, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 676, + 114, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/cb8242379aed5dd9af4c54037ed377d19160103fa368f94226f14a095ac8a0fd.jpg", + "image_caption": [ + "Fig. 2: Overall Architecture of IRSAM. Utilizing an encoder-decoder structure rooted in SAM, IRSAM incorporates two novel modules: WpMD and GAD, crafted specifically for the IRSTD task." + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 787, + 313 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "conditional generative adversarial networks to address the IRSTD problem by achieving the trade-off between missed detection and false detection. Based on the U-Net structure, ACMNet [7] introduces a novel feature fusion approach employing asymmetric context modulation, while UIUNet [30] integrates multiple nested U-Net networks. In addition, Zhang et al. [38] present a transformer-based method for IRSTD called RKformer with random-connection attention. Considering the shape characteristics, Zhang et al. [47] design a Taylor finite difference-inspired edge block, developing ISNet. To enhance SNR, Zhang et al. [48] devise a Dim2Clear from the perspective of image enhancement and super-resolution reconstruction. To explore a lightweight network architecture, Zhang et al. [43] make the first attempt to propose an IRPruneDet model tailored for the IRSTD task through network pruning. Although these methods have shown promising results, they typically require large-scale labeled data for training. Obtaining such data is inherently more challenging compared to natural image datasets. Recently, Li et al. [21] and Ying et al. [32] recently introduce a cost-effective weakly supervised approach for IRSTD, leveraging single-point supervision to reduce annotation expenses. In this paper, we tackle this challenge from a different perspective. Given the extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18, 25] in mitigating generalization issues with limited training data for downstream tasks, we propose harnessing a foundation segmentation model pre-trained on a large-scale natural image dataset for the IRSTD task.", + "bbox": [ + 212, + 398, + 787, + 732 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Segment Anything Model", + "text_level": 1, + "bbox": [ + 215, + 753, + 475, + 768 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Transformer [28, 46] has found widespread application in computer vision tasks, yielding competitive results in various domains. SAM, a Transformer-based model tailored for semantic segmentation [20], allows users to segment objects with prompts in any image. Following that, some researchers fine-tune the structure", + "bbox": [ + 212, + 779, + 789, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 116, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "of SAM to improve its performance on complex tasks such as shadow detection and medical image detection [4, 17, 23, 35]. To reduce the computation complexity of SAM, lightweight variants like Mobile SAM [33] and Fast SAM [50] have been proposed. Some attempts have been made to enhance the decoder of SAM for improved segmentation under challenging conditions [19]. However, these methods still rely on prompts to guide the segmentation process, restricting their applicability and efficiency for the IRSTD task. Besides, the inherent domain gap between natural and infrared images hampers SAM's performance in IRSTD. To address this challenge, we introduce the IRSAM model, enhancing SAM's encoder-decoder architecture to capture more effective feature representations for small infrared objects while leveraging its pre-trained knowledge for segmentation.", + "bbox": [ + 212, + 146, + 787, + 328 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.3 Diffusion Equation for Image Processing", + "text_level": 1, + "bbox": [ + 214, + 347, + 596, + 363 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The nonlinear diffusion equation, addressing anisotropic diffusion, has been used to adapt the diffusion coefficient based on local image features like gradient or curvature [42, 44] to preserve edge and texture information while eliminating noise. PMD equation [24] introduces gradient-based diffusion coefficient functions for image denoising and edge preservation. Chen et al. [5] apply PMD to medical image denoising, enhancing contrast and SNR by selecting suitable diffusion coefficient functions and parameters. Guo et al. [14] devise an adaptive PMD using variable exponent function spaces. Zhang et al. [39] propose a PMD neural module implemented in SAR-optical neural networks to reduce speckle noise in SAR images. Nevertheless, directly integrating PMD into neural networks presents challenges, including boundary blurring and reduced robustness to noise interference. In this work, we develop a WpMD module by incorporating the high-frequency component from wavelet transform as the image differential in the PMD equation, aiming to preserve structural information while mitigating noise impact.", + "bbox": [ + 212, + 368, + 789, + 595 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 214, + 614, + 380, + 632 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Overall Architecture", + "text_level": 1, + "bbox": [ + 214, + 642, + 433, + 657 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Fig. 2 illustrates the overall architecture of the proposed IRSAM, which adopts an encoder-decoder structure. The encoder of IRSAM comprises a pre-trained ViT-Tiny backbone and WpMD blocks. ViT-Tiny aggregates the edge features extracted by WpMD at each layer. For the decoder, unlike the original SAM decoder architecture, we fuse the features at different granularities from the encoder and use the output token to interact with image features and generate the final high-quality target mask.", + "bbox": [ + 212, + 662, + 787, + 771 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Wavelet transform-based PMD Block", + "text_level": 1, + "bbox": [ + 214, + 787, + 571, + 803 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Perona-Malik diffusion equation [24] is mainly used in image processing. The characteristic of anisotropic diffusion enables it to promote diffusion (smoothing)", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 678, + 114, + 730, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "in smoother regions while suppressing diffusion at the edges, thereby achieving the effect of improving image quality, enhancing image structure, and suppressing noise [14,31]. Infrared images are often corrupted by noise and have blurred object boundaries, which pose great challenges for the transfer of SAM to the IRSTD task. Therefore, we propose to explore PMD to preserve essential structural information and eliminate noises simultaneously in this transfer process. Instead of using the convolutions operator, we propose to use the high-frequency component from wavelet transform as the image differential in the PMD equation. As a result, the output of WpMD would be a smoother version of the input, preserving essential structural information while eliminating noise.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Given a picture $u$ , its corresponding PMD equation is given by:", + "bbox": [ + 238, + 297, + 699, + 313 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\frac {\\partial u}{\\partial t} = \\operatorname {d i v} (g (| \\nabla u |) \\nabla u), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 324, + 785, + 353 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where diffusion coefficient $g(|\\nabla u|) = 1 / (1 + |\\nabla u|^2 / k^2)$ . $k$ is a positive constant used to control the degree of diffusion. $t$ represents the step [14]. From Eq. (1), it can be seen that when the gradient magnitude $|\\nabla u|$ of the smooth region is small, the diffusion coefficient $g(|\\nabla u|)$ is large. Consequently, the diffusion is strong and the noise is effectively removed. In the edge part, the gradient magnitude $|\\nabla u|$ is large and the diffusion coefficient $g(|\\nabla u|)$ is small. Thus, the diffusion is weak and the edge information is retained.", + "bbox": [ + 212, + 364, + 787, + 470 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Eq. (1) can be expressed in the following form:", + "bbox": [ + 238, + 473, + 580, + 488 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\frac {\\partial u}{\\partial t} = \\frac {\\partial}{\\partial x} \\left\\{g \\left(\\sqrt {\\left(\\frac {\\partial u}{\\partial x}\\right) ^ {2} + \\left(\\frac {\\partial u}{\\partial y}\\right) ^ {2}}\\right) \\frac {\\partial u}{\\partial x} \\right\\} + \\frac {\\partial}{\\partial y} \\left\\{g \\left(\\sqrt {\\left(\\frac {\\partial u}{\\partial x}\\right) ^ {2} + \\left(\\frac {\\partial u}{\\partial y}\\right) ^ {2}}\\right) \\frac {\\partial u}{\\partial y} \\right\\}. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 218, + 500, + 785, + 556 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "On the other hand, the 2D wavelet transform of an image can be represented:", + "bbox": [ + 238, + 556, + 785, + 571 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nu _ {w} = F _ {w} (u), w \\in \\{L L, L H, H L, H H \\}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 364, + 588, + 785, + 604 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $F(\\cdot)$ represents the filtering operation. $L$ and $H$ stand for low-pass and high-pass, respectively. Building upon the concept of approximating a differential equation $\\frac{\\partial}{\\partial x}$ or $\\frac{\\partial}{\\partial y}$ with a wavelet frame $F_{LH}(\\cdot)$ and $F_{HL}(\\cdot)$ as discussed in [11] and setting the diffusion step size $\\triangle t$ to one, we can transform the Eq. (2) into a discrete format:", + "bbox": [ + 212, + 611, + 787, + 686 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nu _ {k} - u _ {k - 1} = F _ {L H} (g (\\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \\cdot u _ {L H}) + F _ {H L} (g (\\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \\cdot u _ {H L}). (4)\n$$\n", + "text_format": "latex", + "bbox": [ + 227, + 698, + 785, + 724 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As shown in the Fig. 3, after the diffusion process, we use a convolutional layer to map the obtained structural features to the same dimension as the encoder features of each layer. By incorporating multiple WpMD modules into the SAM encoder at different layers, the SAM encoder enhances its ability to suppress noise while preserving the structural features of the infrared images, which effectively addresses the issue of low SNR and blurred target edge in the IRSTD task.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/49dd411b36a0bd3be3a0e037813c4f4e19f03df9e4df51a7a70a85a0d0790fb9.jpg", + "image_caption": [ + "Fig. 3: Structure of the WpMD." + ], + "image_footnote": [], + "bbox": [ + 285, + 148, + 718, + 351 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Granularity-Aware Decoder", + "text_level": 1, + "bbox": [ + 215, + 407, + 490, + 422 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Small infrared targets usually have limited visual features and are easily confounded with the background or similar targets. To improve the performance of infrared small target segmentation, it is necessary to consider both the global context information, which can help extract the overall semantics of the image and enhance the detection of small objects, as well as the local boundary information, which can help preserve the spatial details of small objects and improve the precision of segmentation boundaries. SAM adopts the ViT architecture, which excels at capturing long-term dependence and global information. The early layer of the ViT structure has been demonstrated to preserve more general image boundary details in previous works while the deep layer contains higher-level semantics [13, 19]. To improve the performance of SAM in the IRSTD task, we devise the Granularity-Aware Decoder to fuse the multi-granularity features By feeding global semantic context and local fine-grained features to the decoder, GAD enjoys a richer multi-view knowledge, as shown in Fig. 2.", + "bbox": [ + 212, + 430, + 787, + 641 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "First, we perform two-way cross attention on the image embeddings $X \\in R^{64 \\times 64 \\times 256}$ from the encoder and output tokens $T_{tokens}$ consisting of mask tokens $T_{mask} \\in R^{4 \\times 256}$ and a newly designed edge token $T_{edge} \\in R^{1 \\times 256}$ , i.e., image-to-token cross attention and token-to-image cross attention:", + "bbox": [ + 214, + 642, + 787, + 702 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nX _ {\\text {c o a r s e}}, \\widetilde {T} _ {\\text {t o k e n s}} = \\text {C r o s s A t t e n t i o n} (X, T _ {\\text {t o k e n s}}). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 328, + 714, + 784, + 733 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The $\\widetilde{T}_{\\text{tokens}}$ after the cross-attention update has integrated global image context as well as the information of other tokens and the edge token $T_{edge}$ is learnable and randomly initialized in the decoder like the mask tokens $T_{mask}$ . We then upsample $X_{\\text{coarse}} \\in R^{64 \\times 64 \\times 256}$ and fuse it with the multi-granularity feature $X_{\\text{multi}}$ to get the refined image features:", + "bbox": [ + 214, + 738, + 787, + 816 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nX _ {\\text {f i n e}} = \\operatorname {T C o n v} \\left(X _ {\\text {c o a r s e}}\\right) + X _ {\\text {m u l t i}}. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 824, + 784, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 676, + 114, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 125 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here, TConv denotes transposed convolution which is used to match the size of $X_{\\text{coarse}}$ and $X_{\\text{multi}}$ . $X_{\\text{multi}}$ is obtained as follows:", + "bbox": [ + 215, + 146, + 787, + 176 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} X _ {m u l t i} = \\operatorname {C o n v} (\\operatorname {R e L U} (\\operatorname {N o r m} (\\operatorname {C o n v} (X _ {s h a l l o w})))) \\\\ + \\operatorname {T C o n v} (\\operatorname {R e L U} (\\operatorname {N o r m} (\\operatorname {T C o n v} (X _ {\\text {d e e p}})))) \\tag {7} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 330, + 188, + 784, + 222 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $X_{shallow} \\in R^{128 \\times 128 \\times 128}$ and $X_{deep} \\in R^{64 \\times 64 \\times 256}$ represent the features of the shallow layer (i.e., the first layer) and deep layer (i.e., the fourth layer) of the encoder, respectively. Conv, Norm, and ReLU stand for convolution, layer normalization, and the ReLU activation function, respectively.", + "bbox": [ + 212, + 233, + 785, + 294 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Finally, we use MLPs to generate dynamic convolution kernels from the updated tokens $\\widetilde{T}_{\\text{tokens}}$ in Eq. (5) and apply them to $X_{fine} \\in R^{256 \\times 256 \\times 32}$ and upsampled $X_{coarse} \\in R^{256 \\times 256 \\times 32}$ in Eq. (6) via Hadamard product to get the high-quality edge prediction and mask prediction. This process can be expressed:", + "bbox": [ + 212, + 295, + 785, + 356 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nX _ {e d g e} = \\operatorname {M L P} \\left(\\widetilde {T} _ {e d g e}\\right) \\odot X _ {f i n e}, \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 366, + 785, + 391 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nX _ {\\text {m a s k}} = \\operatorname {M L P} \\left(\\widetilde {T} _ {\\text {m a s k}}\\right) \\odot X _ {\\text {c o a r s e}}, \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 375, + 404, + 784, + 428 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\odot$ stands for dot product. Finally, the obtained edge is used to improve the shape and size of the mask. Through the above process, the proposed GAD achieves the fusion of multi-granularity features in the decoder, integrates global context and local boundary information into the tokens, and finally obtains high-quality infrared small target masks.", + "bbox": [ + 212, + 433, + 785, + 508 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Loss Functions", + "text_level": 1, + "bbox": [ + 215, + 531, + 383, + 544 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Dice Loss: Dice loss is a commonly used method to evaluate the difference between the predicted mask and the ground truth, which is defined as follows:", + "bbox": [ + 212, + 556, + 785, + 585 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nL _ {D i c e} = 1 - 2 \\times \\frac {\\left| Y _ {L a b e l} + Y _ {P r e d} \\right|}{\\left| Y _ {L a b e l} \\right| + \\left| Y _ {P r e d} \\right|}, \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 597, + 785, + 630 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $|Y_{Label} \\cap Y_{Pred}|$ is the intersection of the ground truth $Y_{Label}$ and the prediction $Y_{Pred}$ . $|\\cdot|$ is the number of target pixels in the mask.", + "bbox": [ + 212, + 638, + 785, + 669 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "BCE Loss: Binary Cross Entropy (BCE) Loss is a common loss function for binary classification tasks. It is used to measure the difference between the edge prediction $Y_{PredEdge}$ and the ground truth edge $Y_{Edge}$ , which is defined as:", + "bbox": [ + 212, + 670, + 785, + 715 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nL _ {B C E} = - Y _ {E d g e} \\times \\log \\left(Y _ {P r e d E d g e}\\right) - (1 - Y _ {L a b e l}) \\times \\log \\left(1 - Y _ {P r e d E d g e}\\right). \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 238, + 728, + 785, + 744 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The final loss consisting of the Dice loss $L_{Dice}$ and BCE loss $L_{BCE}$ is used to supervise the training of IRSAM:", + "bbox": [ + 212, + 753, + 785, + 785 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nL = L _ {D i c e} + \\lambda L _ {B C E}, \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 426, + 797, + 785, + 813 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\lambda$ is a hyper-parameter to balance the two losses and set to 10 empirically.", + "bbox": [ + 212, + 824, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/e07b2b853241d31af3a9aeff08dc3e3c3a28dbee067e9638a341689be8c34f4f.jpg", + "table_caption": [ + "Table 1: Comparison with representative methods on IRSTD-1k, NUDT-SIRST and NUAA-SIRST in Params(M), FPS(/s), IoU(%, nIoU(%, $P_d(\\%)$ , $F_a(10^{-6})$ ." + ], + "table_footnote": [], + "table_body": "
MethodParams↓FPS↑IRSTD-1kNUDT-SIRSTNUAA-SIRST
IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓
Top-Hat [1]--10.067.43875.11143222.4037.5689.90174.11.5083.08479.7416456
Max-Median [10]--6.9983.05165.2159.7312.7517.4780.1360.116.02225.3584.34774.3
WSLCM [15]--3.4520.67872.4466191.8097.25875.89595.36.39328.3188.744462
TLLCM [2]--3.3110.78477.3967381.6836.97775.5611314.24012.0988.376243
IPI [12]--27.9220.4681.3716.1830.9335.9981.9817.991.0950.2387.0530467
NRAM [36]--15.259.89970.6816.936.936.1956.4019.2713.5418.9560.0425.23
RIPT [6]--14.118.09377.5528.3129.6737.5791.6565.3016.7920.6569.7659.33
PSTNN [37]--24.5717.9371.9935.2627.8639.3174.7094.3130.3033.6772.8048.99
MSLSTIPT [26]--11.435.93279.0315248.347.9747.408811.0800.8140.0528.183
MDvsFA [29]3.9213949.5047.4182.1180.3375.1473.8590.4725.3460.3058.2689.3556.35
ACMNet [7]0.5256560.9758.0290.5821.7867.0865.395.9710.1872.3371.4396.339.33
ALCNet [8]0.5453462.0559.5890.5821.7881.4080.7196.519.2674.3173.1297.3420.21
Dim2Clear [48]--66.3464.2793.7520.9381.3780.9696.239.1777.2975.2499.106.72
UIUNet [30]50.545972.9168.6094.5910.1988.9189.6097.197.5478.8176.0999.084.97
DNANet [22]4.701669.8068.2994.2813.8987.0985.8798.737.0877.4776.3998.485.35
ISNet [47]1.0810868.7764.8495.5615.3984.9484.1395.798.9080.0278.1299.184.92
IRSAM (ours)12.3310373.6968.9796.927.5592.5993.2998.876.9480.7878.3999.533.95
", + "bbox": [ + 220, + 184, + 785, + 377 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 406, + 374, + 422 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experiment Details", + "text_level": 1, + "bbox": [ + 215, + 436, + 421, + 452 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets. We perform experiments on three datasets, including NUAA-SIRST [7], IRSTD-1k [47], and NUDT-SIRST [22]. They contain 427 and 1,000 real infrared images having one or more small targets, respectively, while NUDT-SIRST consists of 1,327 synthetic infrared images of small targets. All images in the datasets are resized to $512 \\times 512$ . For each dataset, we use $50\\%$ of the images as the train set, $30\\%$ as the validation set, and $20\\%$ as the test set, respectively. Evaluation Metrics. We compare the proposed IRSAM against SOTA methods using pixel-level metrics such as Intersection over Union (IoU) and Normalized Intersection over Union (nIoU) [7] and object-level metrics, including Probability of Detection $(P_d)$ and False-Alarm Rate $(F_a)$ for evaluation.", + "bbox": [ + 215, + 460, + 785, + 612 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation Details We adopt the AdamW optimizer with a learning rate of 0.0001 and the Cosine Decay Learning Rate Scheduler to train our IRSAM. The model is trained for 500 epochs with a batch size of 4. The experiments are conducted on a single Nvidia GeForce 4090 GPU. For comparison, we choose CNN-based IRSTD methods: ISNet [47], UIUNet [30], DNANet [22], Dim2Clear [48], ALCNet [8], ACMNet [7], and MDvsFA [29], and select traditional methods: Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26].", + "bbox": [ + 215, + 613, + 785, + 733 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Quantitative Results", + "text_level": 1, + "bbox": [ + 215, + 755, + 431, + 768 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "As shown in Tab. 1, traditional hand-crafted features-based methods have limited capabilities in handling challenging scenarios, thereby yielding significantly worse performance compared to CNN-based methods. However, CNN-based methods exhibit limitations in detecting small targets, leading to inaccurate mask", + "bbox": [ + 215, + 780, + 792, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 678, + 114, + 730, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/46e51ef68cbbc6d342b7a27583b689416bbfe62d98abff37e9972a3b3b409ccf.jpg", + "image_caption": [ + "Fig. 4: Visualization results using different IRSTD methods. The closed views are shown at the border. In each prediction result, red, blue, and yellow boxes represent the correct detection, miss detection, and false detection, respectively." + ], + "image_footnote": [], + "bbox": [ + 218, + 146, + 784, + 458 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/d7eb2843f37d45f291af51adfcf1b6dc5d3518a282243f7d7c276c23ed26ade2.jpg", + "image_caption": [ + "Fig. 5: 3D views of the detection results obtained by different methods." + ], + "image_footnote": [], + "bbox": [ + 246, + 532, + 759, + 715 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "predictions with lower IoU and nIoU. Moreover, their efficiency in learning discriminative target representation is compromised in the presence of background noise, resulting in inefficient detection or missed detection. The proposed IR-SAM outperforms SOTA methods in all evaluation metrics on NUAA-SIRST,", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "IRSTD-1k, and NUDT-SIRST datasets. The results show that IRSAM can effectively extract the structural information of the target, which is attributed to the proposed WpMD and GAD that improve the learning ability of the vanilla SAM architecture for IRSTD as well as the strong generic segmentation ability of SAM.", + "bbox": [ + 212, + 145, + 787, + 208 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We also plot the ROC curves of the results of different methods on NUASIRST as shown in Fig. 6. The results clearly demonstrate that our IRSAM outperforms the other methods by a substantial margin. The area under the ROC curve (AUC) for the proposed IR-SAM is notably larger than that of both the traditional and CNN-based methods.", + "bbox": [ + 212, + 220, + 433, + 416 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "As depicted in Tab. 2, we compare our IRSAM with several SAM models that use different Transformer backbones with weights from MetaAI.", + "bbox": [ + 212, + 417, + 450, + 492 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/ab56123fd99cfeb5b7fefedda6767f8d9d1337b79ecf22e996d428367689619c.jpg", + "image_caption": [ + "Fig. 6: ROC curves of different methods." + ], + "image_footnote": [], + "bbox": [ + 455, + 250, + 759, + 434 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The SAM models are adapted to the IRSTD task by fine-tuning the decoder or applying LoRA [3,16] on the encoder, while keeping the original encoder parameters frozen due to the prohibitive computation cost of fully fine-tuning. Notably, our IRSAM only employs a lightweight ViT-Tiny backbone, offering greater computational efficiency. IRSAM outperforms other SAM models across all metrics. In addition, our WpMD method demonstrates superior application of SAM to IRSTD tasks compared to other fine-tuning approaches, validating the effectiveness of the proposed modules in transferring a well-trained segmentation model from large-scale natural image datasets to IRSTD.", + "bbox": [ + 212, + 493, + 787, + 630 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Visual Results", + "text_level": 1, + "bbox": [ + 214, + 650, + 382, + 664 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In Fig. 4, we present some detection results obtained by IRSAM and other IRSTD methods. As shown in the first test image that contains an aircraft, most of the traditional methods and CNN-based methods suffer from false detection and fail to segment the target correctly. In contrast, the proposed IRSAM not only segments the target accurately but also outperforms other methods in the segmentation of the gap between the wing and the main body of the aircraft, indicating that the proposed method has a good ability to segment complex shape targets. In addition, from the 3rd and 5th test images, it can be observed that our method can successfully segment two adjacent objects, whereas other methods may fail. Besides, the result of the 6th figure shows that our method can make more realistic prediction for a long and narrow object. We attribute", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 676, + 113, + 730, + 127 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/ecc6859b40265c212862db48f0c42fc3e560e01150bf4b840cf16e90470392ab.jpg", + "table_caption": [ + "Table 2: Comparison with fine-tuned SAM models on NUAA-SIRST in IoU, nIoU, $P_d$ , $F_a$ , Flops(G), Params(M)." + ], + "table_footnote": [], + "table_body": "
MethodIoU↑nIoU↑Pd↑Fa↓Flops↓Params↓
SAM(ViT-B) with finetuned decoder67.4564.4195.4151.0537190
SAM(ViT-L) with finetuned decoder69.5567.3898.1744.491314308
SAM(ViT-H) with finetuned decoder70.9668.9297.2540.762736635
SAM(ViT-B) with adaptformer [3]67.9065.2595.4144.1837291
SAM(ViT-L) with adaptformer [3]69.1565.5996.3340.501315308
SAM(ViT-H) with adaptformer [3]69.4866.3197.2526.82738636
SAM(ViT-B) with WpMD74.1570.8597.2512.11611108
SAM(ViT-L) with WpMD75.0472.1498.178.781719338
SAM(ViT-H) with WpMD75.9673.4899.085.653341680
IRSAM80.7878.3999.533.9571.6312.33
", + "bbox": [ + 222, + 184, + 776, + 344 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/9c6807b7dd5e670657ab19c79911f0b6a4ba1f86431552139725a968283fa239.jpg", + "table_caption": [ + "Table 3: Ablation study of the WPMD and GAD in IoU, $nIoU$ , $P_d$ , $F_a$ ." + ], + "table_footnote": [], + "table_body": "
MethodIoU↑nIoU↑Pd↑Fa↓
w/o WpMD+GAD75.8473.2998.178.21
w/o GAD79.0076.2999.532.13
w/o WpMD78.7376.3999.0811.18
IRSAM80.7878.3999.533.95
", + "bbox": [ + 228, + 383, + 769, + 460 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "the excellent performance of IRSAM in the above scenarios to the proposed WpMD block, which can effectively preserve the structural information of the target while suppressing the noise. Moreover, from all the given test images, it can be seen that the masks predicted by IRSAM are closer to the ground truth than other methods in both shape and completeness, validating the idea of introducing multi-granularity features to the decoder for obtaining higher-quality predictions. In addition, we show the 3D views of prediction results in Fig. 5. The proposed IRSAM performs well in segmenting multiple objects that are close to each other.", + "bbox": [ + 212, + 488, + 787, + 625 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 647, + 388, + 662 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Impact of WpMD and GAD. As shown in Tab. 3, we conduct ablation studies to validate the effectiveness of WpMD and GAD on NUAA-dataset. For IRSAM without WpMD, we use the ViT-Tiny backbone for feature extraction in the encoder. Removing WpMD significantly reduces the IoU and $nIoU$ scores, indicating the model's diminished ability to handle the target edge. $P_{d}$ remains stable while $F_{a}$ increases a lot. For IRSAM without GAD, we adopt the original decoder from SAM. Removing GAD reduces IoU and $nIoU$ scores, validating the effectiveness of integrating multi-granularity features in the decoder for enhancing the segmentation performance. Furthermore, the Mobile-SAM baseline without both WpMD and GAD (first row) performs worse than the proposed IRSAM across all metrics.", + "bbox": [ + 212, + 672, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/e36a60d9d91cb3d76572d1ff36c5d96d18822ed13af87cd9efff62f9855c66ae.jpg", + "image_caption": [ + "Fig. 7: Visualization of feature maps from encoders with different numbers of WpMD." + ], + "image_footnote": [], + "bbox": [ + 250, + 143, + 753, + 454 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/de1a3729a0718dadbd4dbc6c4bf071aa19af22bf6fe0164b7ccab955eef28c1a.jpg", + "image_caption": [ + "Fig. 8: Comparison of the edge maps utilizing various methods." + ], + "image_footnote": [], + "bbox": [ + 263, + 496, + 746, + 575 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/6b72d67d25c724ffffdf7aa26e77a5ae3ab732e597218beabd8842be97fedc45.jpg", + "table_caption": [ + "Table 4: Ablation study on different number of WpMD blocks in IoU, nIoU, $P_d$ , $F_a$ ." + ], + "table_footnote": [], + "table_body": "
NumberIoU↑nIoU↑Pd↑Fa↓
176.1773.7098.1710.16
277.6975.1599.089.76
378.2576.0199.086.12
479.0076.2899.532.13
", + "bbox": [ + 300, + 643, + 697, + 720 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Impact of the Number of WpMD Modules. We also conduct ablation experiments to investigate the effect of using different numbers of WpMD modules in the encoder. As can be seen from Tab. 4, when the number of WpMD feature blocks is 4, the performance is better than others. This conclusion can also be verified by investigating the feature maps obtained by different numbers of WpMD. As shown in Fig. 7, when the number of WpMD blocks is 4, the target", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 676, + 114, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/f1483dc186ec76f797e3dbe680ada2ec8c4a1d929ff52b051f918866301dd5ac.jpg", + "table_caption": [ + "Table 5: Ablation study on the design choice of GAD in IoU, nIoU, $P_d$ , $F_a$ ." + ], + "table_footnote": [], + "table_body": "
TypeIoU↑nIoU↑Pd↑Fa↓
baseline78.6476.3499.085.50
+ shallow feature79.2276.5899.084.52
+ deep feature79.5877.1699.084.17
+ shallow&deep features80.7878.3999.533.95
", + "bbox": [ + 295, + 170, + 702, + 247 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "features in the obtained feature maps are significantly stronger than others. In addition, as visualized in Fig. 8, the use of WpMD effectively preserves internal details and eliminates noises, achievements not paralleled by the Laplacian or Sobel operators. This comparison further demonstrates the effectiveness of our method in preserving essential structural information.", + "bbox": [ + 212, + 272, + 785, + 348 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Impact of design choice of GAD We also conduct ablation experiments to investigate the effect of encoder layer information for GAD. As shown in Tab. 5, When GAD leverages both shallow and deep features simultaneously, it outperforms other options. This suggests that GAD benefits from a richer multiview understanding by providing both global semantic context and local fine-grained features, resulting in a significant performance boost.", + "bbox": [ + 212, + 348, + 785, + 439 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 459, + 359, + 474 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This paper introduces IRSAM, a novel approach for the IRSTD task. Leveraging the generic segmentation capability of the SAM foundation model, which is trained on a large scale of natural images, IRSAM enhances performance for IRSTD through two specifically designed modules: WpMD and GAD. WpMD improves the encoder's edge feature extraction, while GAD integrates multi-granularity features in the decoder for enhanced shape representation. Experimental results on public datasets, including NUAA-SIRST, IRSTD-1k, and NUDT-SIRST, demonstrate IRSAM's superiority over state-of-the-art methods in both objective metrics and subjective evaluation.", + "bbox": [ + 212, + 487, + 787, + 625 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement", + "text_level": 1, + "bbox": [ + 215, + 643, + 395, + 662 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This work was supported in part by the National Natural Science Foundation of China under Grant 62272363, Grant 62036007, Grant U21A20514, Grant 62061047, and Grant 62076190; in part by the National Key Research and Development Program of China under Grant 2023YFA100860; in part by the Young Elite Scientists Sponsorship Program by China Association for Science and Technology (CAST) under Grant 2021QNRC001; in part by the Joint Laboratory for Innovation in Satellite-Borne Computers and Electronics Technology Open Fund 2023 under Grant 2024KFKT001-1; in part by the Key Industrial Innovation Chain Project in Industrial Domain under Grant 2022ZDLGY01-11, and in part by the Key Research and Development Project of Xi'an under Grant 23ZDCYJSGG0022-2023.", + "bbox": [ + 212, + 672, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bai, X., Zhou, F.: Analysis of new top-hat transformation and the application for infrared dim small target detection. Pattern Recognition 43(6), 2145-2156 (2010)", + "2. Chen, C.P., Li, H., Wei, Y., Xia, T., Tang, Y.Y.: A local contrast method for small infrared target detection. IEEE Transactions on Geoscience and Remote Sensing 52(1), 574-581 (2013)", + "3. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. Advances in Neural Information Processing Systems 35, 16664-16678 (2022)", + "4. Chen, T., Zhu, L., Ding, C., Cao, R., Zhang, S., Wang, Y., Li, Z., Sun, L., Mao, P., Zang, Y.: Sam fails to segment anything?—sam-adapter: Adapting sam in underperformed scenes: Camouflage, shadow, and more. arXiv preprint arXiv:2304.09148 (2023)", + "5. Chen, Y., Yan, Z., Qian, Y.: An anisotropic diffusion model for medical image smoothing by using the lattice boltzmann method. In: 7th Asian-Pacific Conference on Medical and Biological Engineering: APCMBE 2008 22-25 April 2008 Beijing, China. pp. 255-259. Springer (2008)", + "6. Dai, Y., Wu, Y.: Reweighted infrared patch-tensor model with both nonlocal and local priors for single-frame small target detection. IEEE journal of selected topics in applied earth observations and remote sensing 10(8), 3752-3767 (2017)", + "7. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Asymmetric contextual modulation for infrared small target detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 950-959 (2021)", + "8. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Attentional local contrast networks for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 59(11), 9813-9824 (2021)", + "9. Deng, H., Sun, X., Liu, M., Ye, C., Zhou, X.: Small infrared target detection based on weighted local difference measure. IEEE Transactions on Geoscience and Remote Sensing 54(7), 4204-4214 (2016)", + "0. Deshpande, S.D., Er, M.H., Venkateswarlu, R., Chan, P.: Max-mean and maxmedian filters for detection of small targets. In: Signal and Data Processing of Small Targets 1999. vol. 3809, pp. 74-83. SPIE (1999)", + "1. Dong, B., Jiang, Q., Shen, Z.: Image restoration: Wavelet frame shrinkage, nonlinear evolution pdes, and beyond. Multiscale Modeling & Simulation 15(1), 606-660 (2017)", + "2. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE Transactions on Image Processing 22(12), 4996-5009 (2013)", + "3. Ghiasi, A., Kazemi, H., Borgnia, E., Reich, S., Shu, M., Goldblum, M., Wilson, A.G., Goldstein, T.: What do vision transformers learn? a visual exploration. arXiv preprint arXiv:2212.06727 (2022)", + "4. Guo, Z., Sun, J., Zhang, D., Wu, B.: Adaptive perona-malik model based on the variable exponent for image denoising. IEEE Transactions on Image Processing 21(3), 958-967 (2011)", + "5. Han, J., Moradi, S., Faramarzi, I., Zhang, H., Zhao, Q., Zhang, X., Li, N.: Infrared small target detection based on the weighted strengthened local contrast measure. IEEE Geoscience and Remote Sensing Letters 18(9), 1670-1674 (2020)", + "6. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)" + ], + "bbox": [ + 225, + 172, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 678, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Huang, Y., Yang, X., Liu, L., Zhou, H., Chang, A., Zhou, X., Chen, R., Yu, J., Chen, J., Chen, C., et al.: Segment anything model for medical images? arXiv preprint arXiv:2304.14660 (2023)", + "18. Jain, S., Salman, H., Khaddaj, A., Wong, E., Park, S.M., Madry, A.: A data-based perspective on transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3613-3622 (2023)", + "19. Ke, L., Ye, M., Danelljan, M., Tai, Y.W., Tang, C.K., Yu, F., et al.: Segment anything in high quality. Advances in Neural Information Processing Systems 36 (2024)", + "20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4015-4026 (2023)", + "21. Li, B., Wang, Y., Wang, L., Zhang, F., Liu, T., Lin, Z., An, W., Guo, Y.: Monte carlo linear clustering with single-point supervision is enough for infrared small target detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)", + "22. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022)", + "23. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15(1), 654 (2024)", + "24. Perona, P., Shiota, T., Malik, J.: Anisotropic diffusion. Geometry-driven diffusion in computer vision pp. 73-92 (1994)", + "25. Sohn, K., Chang, H., Lezama, J., Polania, L., Zhang, H., Hao, Y., Essa, I., Jiang, L.: Visual prompt tuning for generative transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19840-19851 (2023)", + "26. Sun, Y., Yang, J., An, W.: Infrared dim and small target detection via multiple subspace learning and spatial-temporal patch-tensor model. IEEE Transactions on Geoscience and Remote Sensing 59(5), 3737-3752 (2020)", + "27. Teutsch, M., Krüger, W.: Classification of small boats in infrared images for maritime surveillance. In: 2010 International WaterSide Security Conference. pp. 1-7. IEEE (2010)", + "28. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.u., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems. vol. 30 (2017)", + "29. Wang, H., Zhou, L., Wang, L.: Miss detection vs. false alarm: Adversarial learning for small object segmentation in infrared images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8509-8518 (2019)", + "30. Wu, X., Hong, D., Chanussot, J.: Uiu-net: U-net in u-net for infrared small object detection. IEEE Transactions on Image Processing 32, 364-376 (2022)", + "31. Yang, M., Liang, J., Zhang, J., Gao, H., Meng, F., Xingdong, L., Song, S.J.: Nonlocal means theory based perona-malik model for image denosing. Neurocomputing 120, 262-267 (2013)", + "32. Ying, X., Liu, L., Wang, Y., Li, R., Chen, N., Lin, Z., Sheng, W., Zhou, S.: Mapping degeneration meets label evolution: Learning infrared small target detection with single point supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15528-15538 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "33. Zhang, C., Han, D., Qiao, Y., Kim, J.U., Bae, S.H., Lee, S., Hong, C.S.: Faster segment anything: Towards lightweight sam for mobile applications. arXiv preprint arXiv:2306.14289 (2023)", + "34. Zhang, J., Tao, D.: Empowering things with intelligence: A survey of the progress, challenges, and opportunities in artificial intelligence of things. IEEE Internet of Things Journal 8(10), 7789-7817 (2020)", + "35. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023)", + "36. Zhang, L., Peng, L., Zhang, T., Cao, S., Peng, Z.: Infrared small target detection via non-convex rank approximation minimization joint 12, 1 norm. Remote Sensing 10(11), 1821 (2018)", + "37. Zhang, L., Peng, Z.: Infrared small target detection based on partial sum of the tensor nuclear norm. Remote Sensing 11(4), 382 (2019)", + "38. Zhang, M., Bai, H., Zhang, J., Zhang, R., Wang, C., Guo, J., Gao, X.: Rkformer: Runge-kutta transformer with random-connection attention for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1730-1738 (2022)", + "39. Zhang, M., He, C., Zhang, J., Yang, Y., Peng, X., Guo, J.: Sar-to-optical image translation via neural partial differential equations. IJCAI. ijcai. org pp. 1644-1650 (2022)", + "40. Zhang, M., Wang, N., Li, Y., Gao, X.: Deep latent low-rank representation for face sketch synthesis. IEEE transactions on neural networks and learning systems 30(10), 3109-3123 (2019)", + "41. Zhang, M., Wang, N., Li, Y., Gao, X.: Neural probabilistic graphical model for face sketch synthesis. IEEE transactions on neural networks and learning systems 31(7), 2623-2637 (2019)", + "42. Zhang, M., Xin, J., Zhang, J., Tao, D., Gao, X.: Curvature consistent network for microscope chip image super-resolution. IEEE Transactions on Neural Networks and Learning Systems 34(12), 10538-10551 (2023)", + "43. Zhang, M., Yang, H., Guo, J., Li, Y., Gao, X., Zhang, J.: Irprunedet: efficient infrared small target detection via wavelet structure-regularized soft channel pruning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7224-7232 (2024)", + "44. Zhang, M., Yue, K., Li, B., Guo, J., Li, Y., Gao, X.: Single-frame infrared small target detection via gaussian curvature inspired network. IEEE Transactions on Geoscience and Remote Sensing pp. 1-15 (2024). https://doi.org/10.1109/TGRS.2024.3423492", + "45. Zhang, M., Yue, K., Zhang, J., Li, Y., Gao, X.: Exploring feature compensation and cross-level correlation for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1857-1865 (2022)", + "46. Zhang, M., Zhang, C., Zhang, Q., Guo, J., Gao, X., Zhang, J.: Essaformer: Efficient transformer for hyperspectral image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 23073-23084 (2023)", + "47. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022)", + "48. Zhang, M., Zhang, R., Zhang, J., Guo, J., Li, Y., Gao, X.: Dim2clear network for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 61, 1-14 (2023)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IRSAM", + "bbox": [ + 678, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "49. Zhao, B., Wang, C., Fu, Q., Han, Z.: A novel pattern for infrared small target detection with generative adversarial network. IEEE Transactions on Geoscience and Remote Sensing 59(5), 4481-4492 (2020)", + "50. Zhao, X., Ding, W., An, Y., Du, Y., Yu, T., Li, M., Tang, M., Wang, J.: Fast segment anything. arXiv preprint arXiv:2306.12156 (2023)" + ], + "bbox": [ + 215, + 146, + 787, + 217 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "M Zhang and Y Wang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_model.json b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_model.json new file mode 100644 index 0000000000000000000000000000000000000000..797605dff7c3a776e58d9d66463b75e9f4adf50e --- /dev/null +++ b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_model.json @@ -0,0 +1,2304 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.22, + 0.141, + 0.783, + 0.187 + ], + "angle": 0, + "content": "IRSAM: Advancing Segment Anything Model for Infrared Small Target Detection" + }, + { + "type": "text", + "bbox": [ + 0.246, + 0.213, + 0.756, + 0.245 + ], + "angle": 0, + "content": "Mingjin Zhang\\(^{1}\\), Yuchun Wang\\(^{1}\\), Jie Guo\\(^{1}\\), Yunsong Li\\(^{1}\\), Xinbo Gao\\(^{1,2}\\), and Jing Zhang\\(^{3}\\)" + }, + { + "type": "text", + "bbox": [ + 0.306, + 0.255, + 0.696, + 0.284 + ], + "angle": 0, + "content": "\\(^{1}\\) Xidian University, Xi'an, China {mjinzhang, 22011210918, jguo, ysli}@xidian.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.244, + 0.284, + 0.758, + 0.311 + ], + "angle": 0, + "content": "\\(^{2}\\) Chongqing University of Posts and Telecommunications, Chongqing, China \n\\(^{3}\\) The University of Sydney, Sydney, Australia" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.353, + 0.744, + 0.646 + ], + "angle": 0, + "content": "Abstract. The recent Segment Anything Model (SAM) is a significant advancement in natural image segmentation, exhibiting potent zero-shot performance suitable for various downstream image segmentation tasks. However, directly utilizing the pretrained SAM for Infrared Small Target Detection (IRSTD) task falls short in achieving satisfying performance due to a notable domain gap between natural and infrared images. Unlike a visible light camera, a thermal imager reveals an object's temperature distribution by capturing infrared radiation. Small targets often show a subtle temperature transition at the object's boundaries. To address this issue, we propose the IRSAM model for IRSTD, which improves SAM's encoder-decoder architecture to learn better feature representation of infrared small objects. Specifically, we design a Perona-Malik diffusion (PMD)-based block and incorporate it into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder to capture structural information that may be lost in long-distance modeling. Extensive experiments on the public datasets, including NUAA-SIRST, NUDT-SIRST, and IRSTD-1K, validate the design choice of IRSAM and its significant superiority over representative state-of-the-art methods. The source code are available at: github.com/IPIC-Lab/IRSAM." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.658, + 0.741, + 0.687 + ], + "angle": 0, + "content": "Keywords: Infrared small target detection \\(\\cdot\\) Segment anything model \\(\\cdot\\) Perona-Malik diffusion equation \\(\\cdot\\) Granularity-Aware Decoder" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.715, + 0.376, + 0.731 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Infrared small target detection (IRSTD) plays a crucial role in various real-world applications, including traffic management and maritime rescue [9,27,34]. Infrared imaging uniquely captures thermal radiation, less affected by atmospheric scattering than visible light. Thus, under challenging visible light conditions like fog or rain, infrared images provide richer target information, making them more suitable for detecting obscured or indistinguishable targets, especially" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "small ones. Consequently, IRSTD has been a prominent focus in computer vision for decades [32, 47]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.182, + 0.784, + 0.197 + ], + "angle": 0, + "content": "The traditional IRSTD methods can be divided into three subgroups: filter-" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.197, + 0.418, + 0.483 + ], + "angle": 0, + "content": "based, human visual system (HVS)-based, and low-rank representatior-based methods [45]. However, these methods are effective only in high contrast or simple background scenarios, struggling in more challenging conditions due to heavy reliance on hyperparameter tuning and handcrafted features with limited representation ability. Recent advancements in deep learning and the availability of IRSTD public datasets offer a new solution. Approaches us" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.484, + 0.784, + 0.53 + ], + "angle": 0, + "content": "ing deep learning for IRSTD include generative adversarial networks (GANs) [29, 40, 41, 49], U-Net-based networks [7, 8, 30, 47] and transformer-based methods [38]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.534, + 0.787, + 0.653 + ], + "angle": 0, + "content": "Although these methods hold promise, their efficacy heavily relies on the architecture's specific design and the scale of training data. Obtaining such data is inherently more challenging compared to natural image datasets. With extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18,25] in mitigating generalization issues with limited training data for downstream tasks, a crucial question arises: Can a well-designed model pre-trained on a large-scale natural image dataset effectively kickstart the IRSTD task?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Segment Anything Model (SAM) [20] has recently sparked a surge of interest in the field of computer vision image segmentation. Built upon the plain vision transformer-based encoder-decoder architecture and trained on the world's largest segmentation dataset, its powerful zero-shot segmentation capability has inspired many studies that apply SAM to various image segmentation tasks [17, 19, 23, 35]. While SAM shows promising results, they are not tailored for the IRSTD problem, facing challenges due to significant differences between infrared and natural images. (1) Infrared small target images, characterized by the small size of distant targets and substantial background noise and clutter, face challenges in distinguishing targets from the background when employing SAM directly due to a low signal-to-noise ratio (SNR). (2) Infrared imaging relies on the thermal radiation of objects, differing from optical imaging. The" + }, + { + "type": "image", + "bbox": [ + 0.452, + 0.228, + 0.75, + 0.407 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.413, + 0.418, + 0.788, + 0.446 + ], + "angle": 0, + "content": "Fig. 1: Visual Comparison. Segmentation results of different methods on complex structured targets." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.678, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "gradual radiation difference between the object and the background in infrared images results in a blurred target edge. This fuzzy edge makes SAM prone to segmenting the original gap into targets, especially when dealing with targets with complex structures, as demonstrated in Fig. 1. To address these issues, we aim to advance SAM for IRSTD through transfer learning, with a particular emphasis on refining its architecture to learn better feature representation for infrared small objects." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.79, + 0.465 + ], + "angle": 0, + "content": "To this end, we propose the IRSAM model for IRSTD. It builds upon SAM with carefully designed blocks to improve its encoder and decoder, enhancing its ability to detect arbitrary infrared small objects in the context of background noise and clutter. Specifically, inspired by the Perona-Malik diffusion (PMD) equation used in image processing for image denoising and edge preservation, we design a Wavelet-based Perona-Malik Diffusion (WpMD) module by leveraging the wavelet transform to substitute the gradient term in the PMD equation. WpMD is incorporated into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder via a two-way transformer to enhance the mask representation of objects in various sizes and shapes. To reduce the model size and computational complexity, we adopt the lightweight Mobile-SAM [33] as the base model and integrated the WpMD module and GAD to build our IRSAM." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.465, + 0.637, + 0.48 + ], + "angle": 0, + "content": "The contributions of this paper can be summarized as:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.489, + 0.787, + 0.564 + ], + "angle": 0, + "content": "- We introduce IRSAM by redesigning the general vision segmentation model SAM for the IRSTD task for the first time. IRSAM outperforms the vanilla SAM model and state-of-the-art (SOTA) methods on challenging benchmarks in terms of both objective metrics and subjective evaluation, demonstrating superior performance." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.566, + 0.787, + 0.61 + ], + "angle": 0, + "content": "- We design a WpMD module to enhance the ability of SAM's encoder to preserve edge-related features while suppressing the noise in the infrared images, effectively addressing the low-SNR issue in the IRSTD task." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.611, + 0.787, + 0.672 + ], + "angle": 0, + "content": "- We design an GAD to reconstruct the target structural feature lost in capturing long-distance dependence by fusing the multi-granularity feature from the encoder via a carefully designed edge token, effectively enhancing the mask representation of objects in various sizes and shapes." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.489, + 0.787, + 0.672 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.706, + 0.388, + 0.723 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.739, + 0.528, + 0.755 + ], + "angle": 0, + "content": "2.1 Infrared Small Target Detection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.797, + 0.842 + ], + "angle": 0, + "content": "The traditional IRSTD methods including Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26] based on hand-crafted features are tailored to specific scenarios, limiting their generalization to challenging situations. The deep learning-based methods have shown significant progress in IRSTD. For example, MDvsFA [29] applies" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.117, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.145, + 0.788, + 0.314 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.327, + 0.788, + 0.37 + ], + "angle": 0, + "content": "Fig. 2: Overall Architecture of IRSAM. Utilizing an encoder-decoder structure rooted in SAM, IRSAM incorporates two novel modules: WpMD and GAD, crafted specifically for the IRSTD task." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.399, + 0.789, + 0.733 + ], + "angle": 0, + "content": "conditional generative adversarial networks to address the IRSTD problem by achieving the trade-off between missed detection and false detection. Based on the U-Net structure, ACMNet [7] introduces a novel feature fusion approach employing asymmetric context modulation, while UIUNet [30] integrates multiple nested U-Net networks. In addition, Zhang et al. [38] present a transformer-based method for IRSTD called RKformer with random-connection attention. Considering the shape characteristics, Zhang et al. [47] design a Taylor finite difference-inspired edge block, developing ISNet. To enhance SNR, Zhang et al. [48] devise a Dim2Clear from the perspective of image enhancement and super-resolution reconstruction. To explore a lightweight network architecture, Zhang et al. [43] make the first attempt to propose an IRPruneDet model tailored for the IRSTD task through network pruning. Although these methods have shown promising results, they typically require large-scale labeled data for training. Obtaining such data is inherently more challenging compared to natural image datasets. Recently, Li et al. [21] and Ying et al. [32] recently introduce a cost-effective weakly supervised approach for IRSTD, leveraging single-point supervision to reduce annotation expenses. In this paper, we tackle this challenge from a different perspective. Given the extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18, 25] in mitigating generalization issues with limited training data for downstream tasks, we propose harnessing a foundation segmentation model pre-trained on a large-scale natural image dataset for the IRSTD task." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.755, + 0.476, + 0.77 + ], + "angle": 0, + "content": "2.2 Segment Anything Model" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.79, + 0.842 + ], + "angle": 0, + "content": "Transformer [28, 46] has found widespread application in computer vision tasks, yielding competitive results in various domains. SAM, a Transformer-based model tailored for semantic segmentation [20], allows users to segment objects with prompts in any image. Following that, some researchers fine-tune the structure" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.679, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.329 + ], + "angle": 0, + "content": "of SAM to improve its performance on complex tasks such as shadow detection and medical image detection [4, 17, 23, 35]. To reduce the computation complexity of SAM, lightweight variants like Mobile SAM [33] and Fast SAM [50] have been proposed. Some attempts have been made to enhance the decoder of SAM for improved segmentation under challenging conditions [19]. However, these methods still rely on prompts to guide the segmentation process, restricting their applicability and efficiency for the IRSTD task. Besides, the inherent domain gap between natural and infrared images hampers SAM's performance in IRSTD. To address this challenge, we introduce the IRSAM model, enhancing SAM's encoder-decoder architecture to capture more effective feature representations for small infrared objects while leveraging its pre-trained knowledge for segmentation." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.348, + 0.597, + 0.364 + ], + "angle": 0, + "content": "2.3 Diffusion Equation for Image Processing" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.369, + 0.79, + 0.596 + ], + "angle": 0, + "content": "The nonlinear diffusion equation, addressing anisotropic diffusion, has been used to adapt the diffusion coefficient based on local image features like gradient or curvature [42, 44] to preserve edge and texture information while eliminating noise. PMD equation [24] introduces gradient-based diffusion coefficient functions for image denoising and edge preservation. Chen et al. [5] apply PMD to medical image denoising, enhancing contrast and SNR by selecting suitable diffusion coefficient functions and parameters. Guo et al. [14] devise an adaptive PMD using variable exponent function spaces. Zhang et al. [39] propose a PMD neural module implemented in SAR-optical neural networks to reduce speckle noise in SAR images. Nevertheless, directly integrating PMD into neural networks presents challenges, including boundary blurring and reduced robustness to noise interference. In this work, we develop a WpMD module by incorporating the high-frequency component from wavelet transform as the image differential in the PMD equation, aiming to preserve structural information while mitigating noise impact." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.615, + 0.381, + 0.633 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.643, + 0.434, + 0.658 + ], + "angle": 0, + "content": "3.1 Overall Architecture" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.664, + 0.788, + 0.772 + ], + "angle": 0, + "content": "Fig. 2 illustrates the overall architecture of the proposed IRSAM, which adopts an encoder-decoder structure. The encoder of IRSAM comprises a pre-trained ViT-Tiny backbone and WpMD blocks. ViT-Tiny aggregates the edge features extracted by WpMD at each layer. For the decoder, unlike the original SAM decoder architecture, we fuse the features at different granularities from the encoder and use the output token to interact with image features and generate the final high-quality target mask." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.789, + 0.573, + 0.804 + ], + "angle": 0, + "content": "3.2 Wavelet transform-based PMD Block" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Perona-Malik diffusion equation [24] is mainly used in image processing. The characteristic of anisotropic diffusion enables it to promote diffusion (smoothing)" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "in smoother regions while suppressing diffusion at the edges, thereby achieving the effect of improving image quality, enhancing image structure, and suppressing noise [14,31]. Infrared images are often corrupted by noise and have blurred object boundaries, which pose great challenges for the transfer of SAM to the IRSTD task. Therefore, we propose to explore PMD to preserve essential structural information and eliminate noises simultaneously in this transfer process. Instead of using the convolutions operator, we propose to use the high-frequency component from wavelet transform as the image differential in the PMD equation. As a result, the output of WpMD would be a smoother version of the input, preserving essential structural information while eliminating noise." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.299, + 0.7, + 0.314 + ], + "angle": 0, + "content": "Given a picture \\( u \\), its corresponding PMD equation is given by:" + }, + { + "type": "equation", + "bbox": [ + 0.417, + 0.325, + 0.786, + 0.354 + ], + "angle": 0, + "content": "\\[\n\\frac {\\partial u}{\\partial t} = \\operatorname {d i v} (g (| \\nabla u |) \\nabla u), \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.366, + 0.789, + 0.472 + ], + "angle": 0, + "content": "where diffusion coefficient \\( g(|\\nabla u|) = 1 / (1 + |\\nabla u|^2 / k^2) \\). \\( k \\) is a positive constant used to control the degree of diffusion. \\( t \\) represents the step [14]. From Eq. (1), it can be seen that when the gradient magnitude \\( |\\nabla u| \\) of the smooth region is small, the diffusion coefficient \\( g(|\\nabla u|) \\) is large. Consequently, the diffusion is strong and the noise is effectively removed. In the edge part, the gradient magnitude \\( |\\nabla u| \\) is large and the diffusion coefficient \\( g(|\\nabla u|) \\) is small. Thus, the diffusion is weak and the edge information is retained." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.474, + 0.581, + 0.489 + ], + "angle": 0, + "content": "Eq. (1) can be expressed in the following form:" + }, + { + "type": "equation", + "bbox": [ + 0.22, + 0.501, + 0.786, + 0.557 + ], + "angle": 0, + "content": "\\[\n\\frac {\\partial u}{\\partial t} = \\frac {\\partial}{\\partial x} \\left\\{g \\left(\\sqrt {\\left(\\frac {\\partial u}{\\partial x}\\right) ^ {2} + \\left(\\frac {\\partial u}{\\partial y}\\right) ^ {2}}\\right) \\frac {\\partial u}{\\partial x} \\right\\} + \\frac {\\partial}{\\partial y} \\left\\{g \\left(\\sqrt {\\left(\\frac {\\partial u}{\\partial x}\\right) ^ {2} + \\left(\\frac {\\partial u}{\\partial y}\\right) ^ {2}}\\right) \\frac {\\partial u}{\\partial y} \\right\\}. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.558, + 0.786, + 0.573 + ], + "angle": 0, + "content": "On the other hand, the 2D wavelet transform of an image can be represented:" + }, + { + "type": "equation", + "bbox": [ + 0.365, + 0.589, + 0.786, + 0.605 + ], + "angle": 0, + "content": "\\[\nu _ {w} = F _ {w} (u), w \\in \\{L L, L H, H L, H H \\}, \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.612, + 0.788, + 0.688 + ], + "angle": 0, + "content": "where \\( F(\\cdot) \\) represents the filtering operation. \\( L \\) and \\( H \\) stand for low-pass and high-pass, respectively. Building upon the concept of approximating a differential equation \\( \\frac{\\partial}{\\partial x} \\) or \\( \\frac{\\partial}{\\partial y} \\) with a wavelet frame \\( F_{LH}(\\cdot) \\) and \\( F_{HL}(\\cdot) \\) as discussed in [11] and setting the diffusion step size \\( \\triangle t \\) to one, we can transform the Eq. (2) into a discrete format:" + }, + { + "type": "equation", + "bbox": [ + 0.228, + 0.699, + 0.786, + 0.726 + ], + "angle": 0, + "content": "\\[\nu _ {k} - u _ {k - 1} = F _ {L H} (g (\\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \\cdot u _ {L H}) + F _ {H L} (g (\\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \\cdot u _ {H L}). (4)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "As shown in the Fig. 3, after the diffusion process, we use a convolutional layer to map the obtained structural features to the same dimension as the encoder features of each layer. By incorporating multiple WpMD modules into the SAM encoder at different layers, the SAM encoder enhances its ability to suppress noise while preserving the structural features of the infrared images, which effectively addresses the issue of low SNR and blurred target edge in the IRSTD task." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.678, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.126 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.286, + 0.149, + 0.72, + 0.352 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.39, + 0.366, + 0.611, + 0.38 + ], + "angle": 0, + "content": "Fig. 3: Structure of the WpMD." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.408, + 0.491, + 0.423 + ], + "angle": 0, + "content": "3.3 Granularity-Aware Decoder" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.642 + ], + "angle": 0, + "content": "Small infrared targets usually have limited visual features and are easily confounded with the background or similar targets. To improve the performance of infrared small target segmentation, it is necessary to consider both the global context information, which can help extract the overall semantics of the image and enhance the detection of small objects, as well as the local boundary information, which can help preserve the spatial details of small objects and improve the precision of segmentation boundaries. SAM adopts the ViT architecture, which excels at capturing long-term dependence and global information. The early layer of the ViT structure has been demonstrated to preserve more general image boundary details in previous works while the deep layer contains higher-level semantics [13, 19]. To improve the performance of SAM in the IRSTD task, we devise the Granularity-Aware Decoder to fuse the multi-granularity features By feeding global semantic context and local fine-grained features to the decoder, GAD enjoys a richer multi-view knowledge, as shown in Fig. 2." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.643, + 0.788, + 0.703 + ], + "angle": 0, + "content": "First, we perform two-way cross attention on the image embeddings \\( X \\in R^{64 \\times 64 \\times 256} \\) from the encoder and output tokens \\( T_{tokens} \\) consisting of mask tokens \\( T_{mask} \\in R^{4 \\times 256} \\) and a newly designed edge token \\( T_{edge} \\in R^{1 \\times 256} \\), i.e., image-to-token cross attention and token-to-image cross attention:" + }, + { + "type": "equation", + "bbox": [ + 0.329, + 0.715, + 0.785, + 0.734 + ], + "angle": 0, + "content": "\\[\nX _ {\\text {c o a r s e}}, \\widetilde {T} _ {\\text {t o k e n s}} = \\text {C r o s s A t t e n t i o n} (X, T _ {\\text {t o k e n s}}). \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.739, + 0.788, + 0.817 + ], + "angle": 0, + "content": "The \\(\\widetilde{T}_{\\text{tokens}}\\) after the cross-attention update has integrated global image context as well as the information of other tokens and the edge token \\(T_{edge}\\) is learnable and randomly initialized in the decoder like the mask tokens \\(T_{mask}\\). We then upsample \\(X_{\\text{coarse}} \\in R^{64 \\times 64 \\times 256}\\) and fuse it with the multi-granularity feature \\(X_{\\text{multi}}\\) to get the refined image features:" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.825, + 0.785, + 0.842 + ], + "angle": 0, + "content": "\\[\nX _ {\\text {f i n e}} = \\operatorname {T C o n v} \\left(X _ {\\text {c o a r s e}}\\right) + X _ {\\text {m u l t i}}. \\tag {6}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.788, + 0.178 + ], + "angle": 0, + "content": "Here, TConv denotes transposed convolution which is used to match the size of \\( X_{\\text{coarse}} \\) and \\( X_{\\text{multi}} \\). \\( X_{\\text{multi}} \\) is obtained as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.331, + 0.189, + 0.785, + 0.223 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} X _ {m u l t i} = \\operatorname {C o n v} (\\operatorname {R e L U} (\\operatorname {N o r m} (\\operatorname {C o n v} (X _ {s h a l l o w})))) \\\\ + \\operatorname {T C o n v} (\\operatorname {R e L U} (\\operatorname {N o r m} (\\operatorname {T C o n v} (X _ {\\text {d e e p}})))) \\tag {7} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.234, + 0.786, + 0.295 + ], + "angle": 0, + "content": "where \\(X_{shallow} \\in R^{128 \\times 128 \\times 128}\\) and \\(X_{deep} \\in R^{64 \\times 64 \\times 256}\\) represent the features of the shallow layer (i.e., the first layer) and deep layer (i.e., the fourth layer) of the encoder, respectively. Conv, Norm, and ReLU stand for convolution, layer normalization, and the ReLU activation function, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.296, + 0.787, + 0.357 + ], + "angle": 0, + "content": "Finally, we use MLPs to generate dynamic convolution kernels from the updated tokens \\(\\widetilde{T}_{\\text{tokens}}\\) in Eq. (5) and apply them to \\(X_{fine} \\in R^{256 \\times 256 \\times 32}\\) and upsampled \\(X_{coarse} \\in R^{256 \\times 256 \\times 32}\\) in Eq. (6) via Hadamard product to get the high-quality edge prediction and mask prediction. This process can be expressed:" + }, + { + "type": "equation", + "bbox": [ + 0.389, + 0.367, + 0.786, + 0.392 + ], + "angle": 0, + "content": "\\[\nX _ {e d g e} = \\operatorname {M L P} \\left(\\widetilde {T} _ {e d g e}\\right) \\odot X _ {f i n e}, \\tag {8}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.377, + 0.405, + 0.785, + 0.429 + ], + "angle": 0, + "content": "\\[\nX _ {\\text {m a s k}} = \\operatorname {M L P} \\left(\\widetilde {T} _ {\\text {m a s k}}\\right) \\odot X _ {\\text {c o a r s e}}, \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.434, + 0.786, + 0.51 + ], + "angle": 0, + "content": "where \\(\\odot\\) stands for dot product. Finally, the obtained edge is used to improve the shape and size of the mask. Through the above process, the proposed GAD achieves the fusion of multi-granularity features in the decoder, integrates global context and local boundary information into the tokens, and finally obtains high-quality infrared small target masks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.532, + 0.384, + 0.545 + ], + "angle": 0, + "content": "3.4 Loss Functions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.557, + 0.786, + 0.587 + ], + "angle": 0, + "content": "Dice Loss: Dice loss is a commonly used method to evaluate the difference between the predicted mask and the ground truth, which is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.598, + 0.786, + 0.631 + ], + "angle": 0, + "content": "\\[\nL _ {D i c e} = 1 - 2 \\times \\frac {\\left| Y _ {L a b e l} + Y _ {P r e d} \\right|}{\\left| Y _ {L a b e l} \\right| + \\left| Y _ {P r e d} \\right|}, \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.64, + 0.786, + 0.67 + ], + "angle": 0, + "content": "where \\( |Y_{Label} \\cap Y_{Pred}| \\) is the intersection of the ground truth \\( Y_{Label} \\) and the prediction \\( Y_{Pred} \\). \\( |\\cdot| \\) is the number of target pixels in the mask." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.671, + 0.787, + 0.717 + ], + "angle": 0, + "content": "BCE Loss: Binary Cross Entropy (BCE) Loss is a common loss function for binary classification tasks. It is used to measure the difference between the edge prediction \\( Y_{PredEdge} \\) and the ground truth edge \\( Y_{Edge} \\), which is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.239, + 0.729, + 0.786, + 0.745 + ], + "angle": 0, + "content": "\\[\nL _ {B C E} = - Y _ {E d g e} \\times \\log \\left(Y _ {P r e d E d g e}\\right) - (1 - Y _ {L a b e l}) \\times \\log \\left(1 - Y _ {P r e d E d g e}\\right). \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.786, + 0.786 + ], + "angle": 0, + "content": "The final loss consisting of the Dice loss \\( L_{Dice} \\) and BCE loss \\( L_{BCE} \\) is used to supervise the training of IRSAM:" + }, + { + "type": "equation", + "bbox": [ + 0.428, + 0.799, + 0.786, + 0.814 + ], + "angle": 0, + "content": "\\[\nL = L _ {D i c e} + \\lambda L _ {B C E}, \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.825, + 0.786, + 0.841 + ], + "angle": 0, + "content": "where \\(\\lambda\\) is a hyper-parameter to balance the two losses and set to 10 empirically." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.679, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.174 + ], + "angle": 0, + "content": "Table 1: Comparison with representative methods on IRSTD-1k, NUDT-SIRST and NUAA-SIRST in Params(M), FPS(/s), IoU(%, nIoU(%, \\(P_d(\\%)\\), \\(F_a(10^{-6})\\)." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.185, + 0.786, + 0.378 + ], + "angle": 0, + "content": "
MethodParams↓FPS↑IRSTD-1kNUDT-SIRSTNUAA-SIRST
IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓
Top-Hat [1]--10.067.43875.11143222.4037.5689.90174.11.5083.08479.7416456
Max-Median [10]--6.9983.05165.2159.7312.7517.4780.1360.116.02225.3584.34774.3
WSLCM [15]--3.4520.67872.4466191.8097.25875.89595.36.39328.3188.744462
TLLCM [2]--3.3110.78477.3967381.6836.97775.5611314.24012.0988.376243
IPI [12]--27.9220.4681.3716.1830.9335.9981.9817.991.0950.2387.0530467
NRAM [36]--15.259.89970.6816.936.936.1956.4019.2713.5418.9560.0425.23
RIPT [6]--14.118.09377.5528.3129.6737.5791.6565.3016.7920.6569.7659.33
PSTNN [37]--24.5717.9371.9935.2627.8639.3174.7094.3130.3033.6772.8048.99
MSLSTIPT [26]--11.435.93279.0315248.347.9747.408811.0800.8140.0528.183
MDvsFA [29]3.9213949.5047.4182.1180.3375.1473.8590.4725.3460.3058.2689.3556.35
ACMNet [7]0.5256560.9758.0290.5821.7867.0865.395.9710.1872.3371.4396.339.33
ALCNet [8]0.5453462.0559.5890.5821.7881.4080.7196.519.2674.3173.1297.3420.21
Dim2Clear [48]--66.3464.2793.7520.9381.3780.9696.239.1777.2975.2499.106.72
UIUNet [30]50.545972.9168.6094.5910.1988.9189.6097.197.5478.8176.0999.084.97
DNANet [22]4.701669.8068.2994.2813.8987.0985.8798.737.0877.4776.3998.485.35
ISNet [47]1.0810868.7764.8495.5615.3984.9484.1395.798.9080.0278.1299.184.92
IRSAM (ours)12.3310373.6968.9796.927.5592.5993.2998.876.9480.7878.3999.533.95
" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.407, + 0.375, + 0.424 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.438, + 0.423, + 0.453 + ], + "angle": 0, + "content": "4.1 Experiment Details" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.462, + 0.787, + 0.613 + ], + "angle": 0, + "content": "Datasets. We perform experiments on three datasets, including NUAA-SIRST [7], IRSTD-1k [47], and NUDT-SIRST [22]. They contain 427 and 1,000 real infrared images having one or more small targets, respectively, while NUDT-SIRST consists of 1,327 synthetic infrared images of small targets. All images in the datasets are resized to \\(512 \\times 512\\). For each dataset, we use \\(50\\%\\) of the images as the train set, \\(30\\%\\) as the validation set, and \\(20\\%\\) as the test set, respectively. Evaluation Metrics. We compare the proposed IRSAM against SOTA methods using pixel-level metrics such as Intersection over Union (IoU) and Normalized Intersection over Union (nIoU) [7] and object-level metrics, including Probability of Detection \\((P_d)\\) and False-Alarm Rate \\((F_a)\\) for evaluation." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.614, + 0.787, + 0.734 + ], + "angle": 0, + "content": "Implementation Details We adopt the AdamW optimizer with a learning rate of 0.0001 and the Cosine Decay Learning Rate Scheduler to train our IRSAM. The model is trained for 500 epochs with a batch size of 4. The experiments are conducted on a single Nvidia GeForce 4090 GPU. For comparison, we choose CNN-based IRSTD methods: ISNet [47], UIUNet [30], DNANet [22], Dim2Clear [48], ALCNet [8], ACMNet [7], and MDvsFA [29], and select traditional methods: Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26]." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.756, + 0.432, + 0.77 + ], + "angle": 0, + "content": "4.2 Quantitative Results" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.781, + 0.793, + 0.84 + ], + "angle": 0, + "content": "As shown in Tab. 1, traditional hand-crafted features-based methods have limited capabilities in handling challenging scenarios, thereby yielding significantly worse performance compared to CNN-based methods. However, CNN-based methods exhibit limitations in detecting small targets, leading to inaccurate mask" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.147, + 0.785, + 0.459 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.47, + 0.788, + 0.514 + ], + "angle": 0, + "content": "Fig. 4: Visualization results using different IRSTD methods. The closed views are shown at the border. In each prediction result, red, blue, and yellow boxes represent the correct detection, miss detection, and false detection, respectively." + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.534, + 0.76, + 0.717 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.26, + 0.73, + 0.741, + 0.744 + ], + "angle": 0, + "content": "Fig. 5: 3D views of the detection results obtained by different methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "predictions with lower IoU and nIoU. Moreover, their efficiency in learning discriminative target representation is compromised in the presence of background noise, resulting in inefficient detection or missed detection. The proposed IR-SAM outperforms SOTA methods in all evaluation metrics on NUAA-SIRST," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.678, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.209 + ], + "angle": 0, + "content": "IRSTD-1k, and NUDT-SIRST datasets. The results show that IRSAM can effectively extract the structural information of the target, which is attributed to the proposed WpMD and GAD that improve the learning ability of the vanilla SAM architecture for IRSTD as well as the strong generic segmentation ability of SAM." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.222, + 0.434, + 0.417 + ], + "angle": 0, + "content": "We also plot the ROC curves of the results of different methods on NUASIRST as shown in Fig. 6. The results clearly demonstrate that our IRSAM outperforms the other methods by a substantial margin. The area under the ROC curve (AUC) for the proposed IR-SAM is notably larger than that of both the traditional and CNN-based methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.419, + 0.452, + 0.493 + ], + "angle": 0, + "content": "As depicted in Tab. 2, we compare our IRSAM with several SAM models that use different Transformer backbones with weights from MetaAI." + }, + { + "type": "image", + "bbox": [ + 0.457, + 0.251, + 0.761, + 0.435 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.476, + 0.448, + 0.752, + 0.463 + ], + "angle": 0, + "content": "Fig. 6: ROC curves of different methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.494, + 0.788, + 0.631 + ], + "angle": 0, + "content": "The SAM models are adapted to the IRSTD task by fine-tuning the decoder or applying LoRA [3,16] on the encoder, while keeping the original encoder parameters frozen due to the prohibitive computation cost of fully fine-tuning. Notably, our IRSAM only employs a lightweight ViT-Tiny backbone, offering greater computational efficiency. IRSAM outperforms other SAM models across all metrics. In addition, our WpMD method demonstrates superior application of SAM to IRSTD tasks compared to other fine-tuning approaches, validating the effectiveness of the proposed modules in transferring a well-trained segmentation model from large-scale natural image datasets to IRSTD." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.651, + 0.383, + 0.665 + ], + "angle": 0, + "content": "4.3 Visual Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In Fig. 4, we present some detection results obtained by IRSAM and other IRSTD methods. As shown in the first test image that contains an aircraft, most of the traditional methods and CNN-based methods suffer from false detection and fail to segment the target correctly. In contrast, the proposed IRSAM not only segments the target accurately but also outperforms other methods in the segmentation of the gap between the wing and the main body of the aircraft, indicating that the proposed method has a good ability to segment complex shape targets. In addition, from the 3rd and 5th test images, it can be observed that our method can successfully segment two adjacent objects, whereas other methods may fail. Besides, the result of the 6th figure shows that our method can make more realistic prediction for a long and narrow object. We attribute" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.174 + ], + "angle": 0, + "content": "Table 2: Comparison with fine-tuned SAM models on NUAA-SIRST in IoU, nIoU, \\( P_d \\), \\( F_a \\), Flops(G), Params(M)." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.185, + 0.777, + 0.345 + ], + "angle": 0, + "content": "
MethodIoU↑nIoU↑Pd↑Fa↓Flops↓Params↓
SAM(ViT-B) with finetuned decoder67.4564.4195.4151.0537190
SAM(ViT-L) with finetuned decoder69.5567.3898.1744.491314308
SAM(ViT-H) with finetuned decoder70.9668.9297.2540.762736635
SAM(ViT-B) with adaptformer [3]67.9065.2595.4144.1837291
SAM(ViT-L) with adaptformer [3]69.1565.5996.3340.501315308
SAM(ViT-H) with adaptformer [3]69.4866.3197.2526.82738636
SAM(ViT-B) with WpMD74.1570.8597.2512.11611108
SAM(ViT-L) with WpMD75.0472.1498.178.781719338
SAM(ViT-H) with WpMD75.9673.4899.085.653341680
IRSAM80.7878.3999.533.9571.6312.33
" + }, + { + "type": "table_caption", + "bbox": [ + 0.257, + 0.358, + 0.744, + 0.373 + ], + "angle": 0, + "content": "Table 3: Ablation study of the WPMD and GAD in IoU, \\( nIoU \\), \\( P_d \\), \\( F_a \\)." + }, + { + "type": "table", + "bbox": [ + 0.229, + 0.384, + 0.77, + 0.461 + ], + "angle": 0, + "content": "
MethodIoU↑nIoU↑Pd↑Fa↓
w/o WpMD+GAD75.8473.2998.178.21
w/o GAD79.0076.2999.532.13
w/o WpMD78.7376.3999.0811.18
IRSAM80.7878.3999.533.95
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.489, + 0.788, + 0.625 + ], + "angle": 0, + "content": "the excellent performance of IRSAM in the above scenarios to the proposed WpMD block, which can effectively preserve the structural information of the target while suppressing the noise. Moreover, from all the given test images, it can be seen that the masks predicted by IRSAM are closer to the ground truth than other methods in both shape and completeness, validating the idea of introducing multi-granularity features to the decoder for obtaining higher-quality predictions. In addition, we show the 3D views of prediction results in Fig. 5. The proposed IRSAM performs well in segmenting multiple objects that are close to each other." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.648, + 0.39, + 0.664 + ], + "angle": 0, + "content": "4.4 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Impact of WpMD and GAD. As shown in Tab. 3, we conduct ablation studies to validate the effectiveness of WpMD and GAD on NUAA-dataset. For IRSAM without WpMD, we use the ViT-Tiny backbone for feature extraction in the encoder. Removing WpMD significantly reduces the IoU and \\( nIoU \\) scores, indicating the model's diminished ability to handle the target edge. \\( P_{d} \\) remains stable while \\( F_{a} \\) increases a lot. For IRSAM without GAD, we adopt the original decoder from SAM. Removing GAD reduces IoU and \\( nIoU \\) scores, validating the effectiveness of integrating multi-granularity features in the decoder for enhancing the segmentation performance. Furthermore, the Mobile-SAM baseline without both WpMD and GAD (first row) performs worse than the proposed IRSAM across all metrics." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.678, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.251, + 0.144, + 0.754, + 0.455 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.465, + 0.785, + 0.48 + ], + "angle": 0, + "content": "Fig. 7: Visualization of feature maps from encoders with different numbers of WpMD." + }, + { + "type": "image", + "bbox": [ + 0.264, + 0.497, + 0.747, + 0.577 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.287, + 0.59, + 0.714, + 0.605 + ], + "angle": 0, + "content": "Fig. 8: Comparison of the edge maps utilizing various methods." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.619, + 0.784, + 0.634 + ], + "angle": 0, + "content": "Table 4: Ablation study on different number of WpMD blocks in IoU, nIoU, \\(P_d\\), \\(F_a\\)." + }, + { + "type": "table", + "bbox": [ + 0.301, + 0.645, + 0.698, + 0.721 + ], + "angle": 0, + "content": "
NumberIoU↑nIoU↑Pd↑Fa↓
176.1773.7098.1710.16
277.6975.1599.089.76
378.2576.0199.086.12
479.0076.2899.532.13
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Impact of the Number of WpMD Modules. We also conduct ablation experiments to investigate the effect of using different numbers of WpMD modules in the encoder. As can be seen from Tab. 4, when the number of WpMD feature blocks is 4, the performance is better than others. This conclusion can also be verified by investigating the feature maps obtained by different numbers of WpMD. As shown in Fig. 7, when the number of WpMD blocks is 4, the target" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.244, + 0.145, + 0.758, + 0.159 + ], + "angle": 0, + "content": "Table 5: Ablation study on the design choice of GAD in IoU, nIoU, \\(P_d\\), \\(F_a\\)." + }, + { + "type": "table", + "bbox": [ + 0.297, + 0.171, + 0.703, + 0.248 + ], + "angle": 0, + "content": "
TypeIoU↑nIoU↑Pd↑Fa↓
baseline78.6476.3499.085.50
+ shallow feature79.2276.5899.084.52
+ deep feature79.5877.1699.084.17
+ shallow&deep features80.7878.3999.533.95
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.273, + 0.786, + 0.349 + ], + "angle": 0, + "content": "features in the obtained feature maps are significantly stronger than others. In addition, as visualized in Fig. 8, the use of WpMD effectively preserves internal details and eliminates noises, achievements not paralleled by the Laplacian or Sobel operators. This comparison further demonstrates the effectiveness of our method in preserving essential structural information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.349, + 0.787, + 0.44 + ], + "angle": 0, + "content": "Impact of design choice of GAD We also conduct ablation experiments to investigate the effect of encoder layer information for GAD. As shown in Tab. 5, When GAD leverages both shallow and deep features simultaneously, it outperforms other options. This suggests that GAD benefits from a richer multiview understanding by providing both global semantic context and local fine-grained features, resulting in a significant performance boost." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.46, + 0.36, + 0.475 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.488, + 0.788, + 0.625 + ], + "angle": 0, + "content": "This paper introduces IRSAM, a novel approach for the IRSTD task. Leveraging the generic segmentation capability of the SAM foundation model, which is trained on a large scale of natural images, IRSAM enhances performance for IRSTD through two specifically designed modules: WpMD and GAD. WpMD improves the encoder's edge feature extraction, while GAD integrates multi-granularity features in the decoder for enhanced shape representation. Experimental results on public datasets, including NUAA-SIRST, IRSTD-1k, and NUDT-SIRST, demonstrate IRSAM's superiority over state-of-the-art methods in both objective metrics and subjective evaluation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.645, + 0.396, + 0.663 + ], + "angle": 0, + "content": "Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.84 + ], + "angle": 0, + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant 62272363, Grant 62036007, Grant U21A20514, Grant 62061047, and Grant 62076190; in part by the National Key Research and Development Program of China under Grant 2023YFA100860; in part by the Young Elite Scientists Sponsorship Program by China Association for Science and Technology (CAST) under Grant 2021QNRC001; in part by the Joint Laboratory for Innovation in Satellite-Borne Computers and Electronics Technology Open Fund 2023 under Grant 2024KFKT001-1; in part by the Key Industrial Innovation Chain Project in Industrial Domain under Grant 2022ZDLGY01-11, and in part by the Key Research and Development Project of Xi'an under Grant 23ZDCYJSGG0022-2023." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.679, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.173, + 0.785, + 0.2 + ], + "angle": 0, + "content": "1. Bai, X., Zhou, F.: Analysis of new top-hat transformation and the application for infrared dim small target detection. Pattern Recognition 43(6), 2145-2156 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.201, + 0.785, + 0.241 + ], + "angle": 0, + "content": "2. Chen, C.P., Li, H., Wei, Y., Xia, T., Tang, Y.Y.: A local contrast method for small infrared target detection. IEEE Transactions on Geoscience and Remote Sensing 52(1), 574-581 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.242, + 0.785, + 0.282 + ], + "angle": 0, + "content": "3. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. Advances in Neural Information Processing Systems 35, 16664-16678 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.283, + 0.785, + 0.336 + ], + "angle": 0, + "content": "4. Chen, T., Zhu, L., Ding, C., Cao, R., Zhang, S., Wang, Y., Li, Z., Sun, L., Mao, P., Zang, Y.: Sam fails to segment anything?—sam-adapter: Adapting sam in underperformed scenes: Camouflage, shadow, and more. arXiv preprint arXiv:2304.09148 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.337, + 0.785, + 0.392 + ], + "angle": 0, + "content": "5. Chen, Y., Yan, Z., Qian, Y.: An anisotropic diffusion model for medical image smoothing by using the lattice boltzmann method. In: 7th Asian-Pacific Conference on Medical and Biological Engineering: APCMBE 2008 22-25 April 2008 Beijing, China. pp. 255-259. Springer (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.392, + 0.785, + 0.433 + ], + "angle": 0, + "content": "6. Dai, Y., Wu, Y.: Reweighted infrared patch-tensor model with both nonlocal and local priors for single-frame small target detection. IEEE journal of selected topics in applied earth observations and remote sensing 10(8), 3752-3767 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.433, + 0.785, + 0.472 + ], + "angle": 0, + "content": "7. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Asymmetric contextual modulation for infrared small target detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 950-959 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.473, + 0.785, + 0.514 + ], + "angle": 0, + "content": "8. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Attentional local contrast networks for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 59(11), 9813-9824 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.514, + 0.785, + 0.554 + ], + "angle": 0, + "content": "9. Deng, H., Sun, X., Liu, M., Ye, C., Zhou, X.: Small infrared target detection based on weighted local difference measure. IEEE Transactions on Geoscience and Remote Sensing 54(7), 4204-4214 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.555, + 0.785, + 0.595 + ], + "angle": 0, + "content": "0. Deshpande, S.D., Er, M.H., Venkateswarlu, R., Chan, P.: Max-mean and maxmedian filters for detection of small targets. In: Signal and Data Processing of Small Targets 1999. vol. 3809, pp. 74-83. SPIE (1999)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.596, + 0.785, + 0.636 + ], + "angle": 0, + "content": "1. Dong, B., Jiang, Q., Shen, Z.: Image restoration: Wavelet frame shrinkage, nonlinear evolution pdes, and beyond. Multiscale Modeling & Simulation 15(1), 606-660 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.636, + 0.785, + 0.677 + ], + "angle": 0, + "content": "2. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE Transactions on Image Processing 22(12), 4996-5009 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.678, + 0.785, + 0.717 + ], + "angle": 0, + "content": "3. Ghiasi, A., Kazemi, H., Borgnia, E., Reich, S., Shu, M., Goldblum, M., Wilson, A.G., Goldstein, T.: What do vision transformers learn? a visual exploration. arXiv preprint arXiv:2212.06727 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.718, + 0.785, + 0.758 + ], + "angle": 0, + "content": "4. Guo, Z., Sun, J., Zhang, D., Wu, B.: Adaptive perona-malik model based on the variable exponent for image denoising. IEEE Transactions on Image Processing 21(3), 958-967 (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.785, + 0.799 + ], + "angle": 0, + "content": "5. Han, J., Moradi, S., Faramarzi, I., Zhang, H., Zhao, Q., Zhang, X., Li, N.: Infrared small target detection based on the weighted strengthened local contrast measure. IEEE Geoscience and Remote Sensing Letters 18(9), 1670-1674 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "6. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.173, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "17. Huang, Y., Yang, X., Liu, L., Zhou, H., Chang, A., Zhou, X., Chen, R., Yu, J., Chen, J., Chen, C., et al.: Segment anything model for medical images? arXiv preprint arXiv:2304.14660 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.233 + ], + "angle": 0, + "content": "18. Jain, S., Salman, H., Khaddaj, A., Wong, E., Park, S.M., Madry, A.: A data-based perspective on transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3613-3622 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.234, + 0.787, + 0.274 + ], + "angle": 0, + "content": "19. Ke, L., Ye, M., Danelljan, M., Tai, Y.W., Tang, C.K., Yu, F., et al.: Segment anything in high quality. Advances in Neural Information Processing Systems 36 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.276, + 0.787, + 0.331 + ], + "angle": 0, + "content": "20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4015-4026 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.332, + 0.787, + 0.387 + ], + "angle": 0, + "content": "21. Li, B., Wang, Y., Wang, L., Zhang, F., Liu, T., Lin, Z., An, W., Guo, Y.: Monte carlo linear clustering with single-point supervision is enough for infrared small target detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.388, + 0.787, + 0.43 + ], + "angle": 0, + "content": "22. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.431, + 0.787, + 0.459 + ], + "angle": 0, + "content": "23. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15(1), 654 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.46, + 0.787, + 0.487 + ], + "angle": 0, + "content": "24. Perona, P., Shiota, T., Malik, J.: Anisotropic diffusion. Geometry-driven diffusion in computer vision pp. 73-92 (1994)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.488, + 0.787, + 0.543 + ], + "angle": 0, + "content": "25. Sohn, K., Chang, H., Lezama, J., Polania, L., Zhang, H., Hao, Y., Essa, I., Jiang, L.: Visual prompt tuning for generative transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19840-19851 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.545, + 0.787, + 0.586 + ], + "angle": 0, + "content": "26. Sun, Y., Yang, J., An, W.: Infrared dim and small target detection via multiple subspace learning and spatial-temporal patch-tensor model. IEEE Transactions on Geoscience and Remote Sensing 59(5), 3737-3752 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.587, + 0.787, + 0.628 + ], + "angle": 0, + "content": "27. Teutsch, M., Krüger, W.: Classification of small boats in infrared images for maritime surveillance. In: 2010 International WaterSide Security Conference. pp. 1-7. IEEE (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.629, + 0.787, + 0.671 + ], + "angle": 0, + "content": "28. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.u., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems. vol. 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.672, + 0.787, + 0.713 + ], + "angle": 0, + "content": "29. Wang, H., Zhou, L., Wang, L.: Miss detection vs. false alarm: Adversarial learning for small object segmentation in infrared images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8509-8518 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.714, + 0.787, + 0.742 + ], + "angle": 0, + "content": "30. Wu, X., Hong, D., Chanussot, J.: Uiu-net: U-net in u-net for infrared small object detection. IEEE Transactions on Image Processing 32, 364-376 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.743, + 0.787, + 0.784 + ], + "angle": 0, + "content": "31. Yang, M., Liang, J., Zhang, J., Gao, H., Meng, F., Xingdong, L., Song, S.J.: Nonlocal means theory based perona-malik model for image denosing. Neurocomputing 120, 262-267 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.785, + 0.787, + 0.84 + ], + "angle": 0, + "content": "32. Ying, X., Liu, L., Wang, Y., Li, R., Chen, N., Lin, Z., Sheng, W., Zhou, S.: Mapping degeneration meets label evolution: Learning infrared small target detection with single point supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15528-15538 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.679, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IRSAM" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "33. Zhang, C., Han, D., Qiao, Y., Kim, J.U., Bae, S.H., Lee, S., Hong, C.S.: Faster segment anything: Towards lightweight sam for mobile applications. arXiv preprint arXiv:2306.14289 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.191, + 0.787, + 0.233 + ], + "angle": 0, + "content": "34. Zhang, J., Tao, D.: Empowering things with intelligence: A survey of the progress, challenges, and opportunities in artificial intelligence of things. IEEE Internet of Things Journal 8(10), 7789-7817 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.234, + 0.785, + 0.261 + ], + "angle": 0, + "content": "35. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.262, + 0.785, + 0.303 + ], + "angle": 0, + "content": "36. Zhang, L., Peng, L., Zhang, T., Cao, S., Peng, Z.: Infrared small target detection via non-convex rank approximation minimization joint 12, 1 norm. Remote Sensing 10(11), 1821 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.305, + 0.785, + 0.332 + ], + "angle": 0, + "content": "37. Zhang, L., Peng, Z.: Infrared small target detection based on partial sum of the tensor nuclear norm. Remote Sensing 11(4), 382 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.333, + 0.785, + 0.387 + ], + "angle": 0, + "content": "38. Zhang, M., Bai, H., Zhang, J., Zhang, R., Wang, C., Guo, J., Gao, X.: Rkformer: Runge-kutta transformer with random-connection attention for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1730-1738 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.389, + 0.785, + 0.431 + ], + "angle": 0, + "content": "39. Zhang, M., He, C., Zhang, J., Yang, Y., Peng, X., Guo, J.: Sar-to-optical image translation via neural partial differential equations. IJCAI. ijcai. org pp. 1644-1650 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.432, + 0.785, + 0.473 + ], + "angle": 0, + "content": "40. Zhang, M., Wang, N., Li, Y., Gao, X.: Deep latent low-rank representation for face sketch synthesis. IEEE transactions on neural networks and learning systems 30(10), 3109-3123 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.475, + 0.785, + 0.515 + ], + "angle": 0, + "content": "41. Zhang, M., Wang, N., Li, Y., Gao, X.: Neural probabilistic graphical model for face sketch synthesis. IEEE transactions on neural networks and learning systems 31(7), 2623-2637 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.517, + 0.785, + 0.558 + ], + "angle": 0, + "content": "42. Zhang, M., Xin, J., Zhang, J., Tao, D., Gao, X.: Curvature consistent network for microscope chip image super-resolution. IEEE Transactions on Neural Networks and Learning Systems 34(12), 10538-10551 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.56, + 0.785, + 0.613 + ], + "angle": 0, + "content": "43. Zhang, M., Yang, H., Guo, J., Li, Y., Gao, X., Zhang, J.: Irprunedet: efficient infrared small target detection via wavelet structure-regularized soft channel pruning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7224-7232 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.615, + 0.785, + 0.669 + ], + "angle": 0, + "content": "44. Zhang, M., Yue, K., Li, B., Guo, J., Li, Y., Gao, X.: Single-frame infrared small target detection via gaussian curvature inspired network. IEEE Transactions on Geoscience and Remote Sensing pp. 1-15 (2024). https://doi.org/10.1109/TGRS.2024.3423492" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.671, + 0.785, + 0.713 + ], + "angle": 0, + "content": "45. Zhang, M., Yue, K., Zhang, J., Li, Y., Gao, X.: Exploring feature compensation and cross-level correlation for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1857-1865 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.715, + 0.785, + 0.755 + ], + "angle": 0, + "content": "46. Zhang, M., Zhang, C., Zhang, Q., Guo, J., Gao, X., Zhang, J.: Essaformer: Efficient transformer for hyperspectral image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 23073-23084 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.785, + 0.798 + ], + "angle": 0, + "content": "47. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "48. Zhang, M., Zhang, R., Zhang, J., Guo, J., Li, Y., Gao, X.: Dim2clear network for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 61, 1-14 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.129 + ], + "angle": 0, + "content": "M Zhang and Y Wang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "49. Zhao, B., Wang, C., Fu, Q., Han, Z.: A novel pattern for infrared small target detection with generative adversarial network. IEEE Transactions on Geoscience and Remote Sensing 59(5), 4481-4492 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.786, + 0.218 + ], + "angle": 0, + "content": "50. Zhao, X., Ding, W., An, Y., Du, Y., Yu, T., Li, M., Tang, M., Wang, J.: Fast segment anything. arXiv preprint arXiv:2306.12156 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.218 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_origin.pdf b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..558eb8705807257707e931979d4359df5d53825d --- /dev/null +++ b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/1951067b-70fe-4b51-a641-6a218131792c_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6c808042c309449bcd72253853a5d86a0a1dd1007464ca44debc38e4a6a01ecc +size 2331060 diff --git a/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/full.md b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/full.md new file mode 100644 index 0000000000000000000000000000000000000000..a9ca5d5f26882f2a1517a17395a7e073c17ac9f0 --- /dev/null +++ b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/full.md @@ -0,0 +1,302 @@ +# IRSAM: Advancing Segment Anything Model for Infrared Small Target Detection + +Mingjin Zhang $^{1}$ , Yuchun Wang $^{1}$ , Jie Guo $^{1}$ , Yunsong Li $^{1}$ , Xinbo Gao $^{1,2}$ , and Jing Zhang $^{3}$ + +$^{1}$ Xidian University, Xi'an, China {mjinzhang, 22011210918, jguo, ysli}@xidian.edu.cn + +$^{2}$ Chongqing University of Posts and Telecommunications, Chongqing, China + $^{3}$ The University of Sydney, Sydney, Australia + +Abstract. The recent Segment Anything Model (SAM) is a significant advancement in natural image segmentation, exhibiting potent zero-shot performance suitable for various downstream image segmentation tasks. However, directly utilizing the pretrained SAM for Infrared Small Target Detection (IRSTD) task falls short in achieving satisfying performance due to a notable domain gap between natural and infrared images. Unlike a visible light camera, a thermal imager reveals an object's temperature distribution by capturing infrared radiation. Small targets often show a subtle temperature transition at the object's boundaries. To address this issue, we propose the IRSAM model for IRSTD, which improves SAM's encoder-decoder architecture to learn better feature representation of infrared small objects. Specifically, we design a Perona-Malik diffusion (PMD)-based block and incorporate it into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder to capture structural information that may be lost in long-distance modeling. Extensive experiments on the public datasets, including NUAA-SIRST, NUDT-SIRST, and IRSTD-1K, validate the design choice of IRSAM and its significant superiority over representative state-of-the-art methods. The source code are available at: github.com/IPIC-Lab/IRSAM. + +Keywords: Infrared small target detection $\cdot$ Segment anything model $\cdot$ Perona-Malik diffusion equation $\cdot$ Granularity-Aware Decoder + +# 1 Introduction + +Infrared small target detection (IRSTD) plays a crucial role in various real-world applications, including traffic management and maritime rescue [9,27,34]. Infrared imaging uniquely captures thermal radiation, less affected by atmospheric scattering than visible light. Thus, under challenging visible light conditions like fog or rain, infrared images provide richer target information, making them more suitable for detecting obscured or indistinguishable targets, especially + +small ones. Consequently, IRSTD has been a prominent focus in computer vision for decades [32, 47]. + +The traditional IRSTD methods can be divided into three subgroups: filter- + +based, human visual system (HVS)-based, and low-rank representatior-based methods [45]. However, these methods are effective only in high contrast or simple background scenarios, struggling in more challenging conditions due to heavy reliance on hyperparameter tuning and handcrafted features with limited representation ability. Recent advancements in deep learning and the availability of IRSTD public datasets offer a new solution. Approaches us + +ing deep learning for IRSTD include generative adversarial networks (GANs) [29, 40, 41, 49], U-Net-based networks [7, 8, 30, 47] and transformer-based methods [38]. + +Although these methods hold promise, their efficacy heavily relies on the architecture's specific design and the scale of training data. Obtaining such data is inherently more challenging compared to natural image datasets. With extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18,25] in mitigating generalization issues with limited training data for downstream tasks, a crucial question arises: Can a well-designed model pre-trained on a large-scale natural image dataset effectively kickstart the IRSTD task? + +Segment Anything Model (SAM) [20] has recently sparked a surge of interest in the field of computer vision image segmentation. Built upon the plain vision transformer-based encoder-decoder architecture and trained on the world's largest segmentation dataset, its powerful zero-shot segmentation capability has inspired many studies that apply SAM to various image segmentation tasks [17, 19, 23, 35]. While SAM shows promising results, they are not tailored for the IRSTD problem, facing challenges due to significant differences between infrared and natural images. (1) Infrared small target images, characterized by the small size of distant targets and substantial background noise and clutter, face challenges in distinguishing targets from the background when employing SAM directly due to a low signal-to-noise ratio (SNR). (2) Infrared imaging relies on the thermal radiation of objects, differing from optical imaging. The + +![](images/caaa39fd844c95e7cafbb416c756fed8890f308e440304bd1d90f00557645e06.jpg) +Fig. 1: Visual Comparison. Segmentation results of different methods on complex structured targets. + +gradual radiation difference between the object and the background in infrared images results in a blurred target edge. This fuzzy edge makes SAM prone to segmenting the original gap into targets, especially when dealing with targets with complex structures, as demonstrated in Fig. 1. To address these issues, we aim to advance SAM for IRSTD through transfer learning, with a particular emphasis on refining its architecture to learn better feature representation for infrared small objects. + +To this end, we propose the IRSAM model for IRSTD. It builds upon SAM with carefully designed blocks to improve its encoder and decoder, enhancing its ability to detect arbitrary infrared small objects in the context of background noise and clutter. Specifically, inspired by the Perona-Malik diffusion (PMD) equation used in image processing for image denoising and edge preservation, we design a Wavelet-based Perona-Malik Diffusion (WpMD) module by leveraging the wavelet transform to substitute the gradient term in the PMD equation. WpMD is incorporated into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder via a two-way transformer to enhance the mask representation of objects in various sizes and shapes. To reduce the model size and computational complexity, we adopt the lightweight Mobile-SAM [33] as the base model and integrated the WpMD module and GAD to build our IRSAM. + +The contributions of this paper can be summarized as: + +- We introduce IRSAM by redesigning the general vision segmentation model SAM for the IRSTD task for the first time. IRSAM outperforms the vanilla SAM model and state-of-the-art (SOTA) methods on challenging benchmarks in terms of both objective metrics and subjective evaluation, demonstrating superior performance. +- We design a WpMD module to enhance the ability of SAM's encoder to preserve edge-related features while suppressing the noise in the infrared images, effectively addressing the low-SNR issue in the IRSTD task. +- We design an GAD to reconstruct the target structural feature lost in capturing long-distance dependence by fusing the multi-granularity feature from the encoder via a carefully designed edge token, effectively enhancing the mask representation of objects in various sizes and shapes. + +# 2 Related Work + +# 2.1 Infrared Small Target Detection + +The traditional IRSTD methods including Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26] based on hand-crafted features are tailored to specific scenarios, limiting their generalization to challenging situations. The deep learning-based methods have shown significant progress in IRSTD. For example, MDvsFA [29] applies + +![](images/cb8242379aed5dd9af4c54037ed377d19160103fa368f94226f14a095ac8a0fd.jpg) +Fig. 2: Overall Architecture of IRSAM. Utilizing an encoder-decoder structure rooted in SAM, IRSAM incorporates two novel modules: WpMD and GAD, crafted specifically for the IRSTD task. + +conditional generative adversarial networks to address the IRSTD problem by achieving the trade-off between missed detection and false detection. Based on the U-Net structure, ACMNet [7] introduces a novel feature fusion approach employing asymmetric context modulation, while UIUNet [30] integrates multiple nested U-Net networks. In addition, Zhang et al. [38] present a transformer-based method for IRSTD called RKformer with random-connection attention. Considering the shape characteristics, Zhang et al. [47] design a Taylor finite difference-inspired edge block, developing ISNet. To enhance SNR, Zhang et al. [48] devise a Dim2Clear from the perspective of image enhancement and super-resolution reconstruction. To explore a lightweight network architecture, Zhang et al. [43] make the first attempt to propose an IRPruneDet model tailored for the IRSTD task through network pruning. Although these methods have shown promising results, they typically require large-scale labeled data for training. Obtaining such data is inherently more challenging compared to natural image datasets. Recently, Li et al. [21] and Ying et al. [32] recently introduce a cost-effective weakly supervised approach for IRSTD, leveraging single-point supervision to reduce annotation expenses. In this paper, we tackle this challenge from a different perspective. Given the extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18, 25] in mitigating generalization issues with limited training data for downstream tasks, we propose harnessing a foundation segmentation model pre-trained on a large-scale natural image dataset for the IRSTD task. + +# 2.2 Segment Anything Model + +Transformer [28, 46] has found widespread application in computer vision tasks, yielding competitive results in various domains. SAM, a Transformer-based model tailored for semantic segmentation [20], allows users to segment objects with prompts in any image. Following that, some researchers fine-tune the structure + +of SAM to improve its performance on complex tasks such as shadow detection and medical image detection [4, 17, 23, 35]. To reduce the computation complexity of SAM, lightweight variants like Mobile SAM [33] and Fast SAM [50] have been proposed. Some attempts have been made to enhance the decoder of SAM for improved segmentation under challenging conditions [19]. However, these methods still rely on prompts to guide the segmentation process, restricting their applicability and efficiency for the IRSTD task. Besides, the inherent domain gap between natural and infrared images hampers SAM's performance in IRSTD. To address this challenge, we introduce the IRSAM model, enhancing SAM's encoder-decoder architecture to capture more effective feature representations for small infrared objects while leveraging its pre-trained knowledge for segmentation. + +# 2.3 Diffusion Equation for Image Processing + +The nonlinear diffusion equation, addressing anisotropic diffusion, has been used to adapt the diffusion coefficient based on local image features like gradient or curvature [42, 44] to preserve edge and texture information while eliminating noise. PMD equation [24] introduces gradient-based diffusion coefficient functions for image denoising and edge preservation. Chen et al. [5] apply PMD to medical image denoising, enhancing contrast and SNR by selecting suitable diffusion coefficient functions and parameters. Guo et al. [14] devise an adaptive PMD using variable exponent function spaces. Zhang et al. [39] propose a PMD neural module implemented in SAR-optical neural networks to reduce speckle noise in SAR images. Nevertheless, directly integrating PMD into neural networks presents challenges, including boundary blurring and reduced robustness to noise interference. In this work, we develop a WpMD module by incorporating the high-frequency component from wavelet transform as the image differential in the PMD equation, aiming to preserve structural information while mitigating noise impact. + +# 3 Methodology + +# 3.1 Overall Architecture + +Fig. 2 illustrates the overall architecture of the proposed IRSAM, which adopts an encoder-decoder structure. The encoder of IRSAM comprises a pre-trained ViT-Tiny backbone and WpMD blocks. ViT-Tiny aggregates the edge features extracted by WpMD at each layer. For the decoder, unlike the original SAM decoder architecture, we fuse the features at different granularities from the encoder and use the output token to interact with image features and generate the final high-quality target mask. + +# 3.2 Wavelet transform-based PMD Block + +Perona-Malik diffusion equation [24] is mainly used in image processing. The characteristic of anisotropic diffusion enables it to promote diffusion (smoothing) + +in smoother regions while suppressing diffusion at the edges, thereby achieving the effect of improving image quality, enhancing image structure, and suppressing noise [14,31]. Infrared images are often corrupted by noise and have blurred object boundaries, which pose great challenges for the transfer of SAM to the IRSTD task. Therefore, we propose to explore PMD to preserve essential structural information and eliminate noises simultaneously in this transfer process. Instead of using the convolutions operator, we propose to use the high-frequency component from wavelet transform as the image differential in the PMD equation. As a result, the output of WpMD would be a smoother version of the input, preserving essential structural information while eliminating noise. + +Given a picture $u$ , its corresponding PMD equation is given by: + +$$ +\frac {\partial u}{\partial t} = \operatorname {d i v} (g (| \nabla u |) \nabla u), \tag {1} +$$ + +where diffusion coefficient $g(|\nabla u|) = 1 / (1 + |\nabla u|^2 / k^2)$ . $k$ is a positive constant used to control the degree of diffusion. $t$ represents the step [14]. From Eq. (1), it can be seen that when the gradient magnitude $|\nabla u|$ of the smooth region is small, the diffusion coefficient $g(|\nabla u|)$ is large. Consequently, the diffusion is strong and the noise is effectively removed. In the edge part, the gradient magnitude $|\nabla u|$ is large and the diffusion coefficient $g(|\nabla u|)$ is small. Thus, the diffusion is weak and the edge information is retained. + +Eq. (1) can be expressed in the following form: + +$$ +\frac {\partial u}{\partial t} = \frac {\partial}{\partial x} \left\{g \left(\sqrt {\left(\frac {\partial u}{\partial x}\right) ^ {2} + \left(\frac {\partial u}{\partial y}\right) ^ {2}}\right) \frac {\partial u}{\partial x} \right\} + \frac {\partial}{\partial y} \left\{g \left(\sqrt {\left(\frac {\partial u}{\partial x}\right) ^ {2} + \left(\frac {\partial u}{\partial y}\right) ^ {2}}\right) \frac {\partial u}{\partial y} \right\}. \tag {2} +$$ + +On the other hand, the 2D wavelet transform of an image can be represented: + +$$ +u _ {w} = F _ {w} (u), w \in \{L L, L H, H L, H H \}, \tag {3} +$$ + +where $F(\cdot)$ represents the filtering operation. $L$ and $H$ stand for low-pass and high-pass, respectively. Building upon the concept of approximating a differential equation $\frac{\partial}{\partial x}$ or $\frac{\partial}{\partial y}$ with a wavelet frame $F_{LH}(\cdot)$ and $F_{HL}(\cdot)$ as discussed in [11] and setting the diffusion step size $\triangle t$ to one, we can transform the Eq. (2) into a discrete format: + +$$ +u _ {k} - u _ {k - 1} = F _ {L H} (g (\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \cdot u _ {L H}) + F _ {H L} (g (\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \cdot u _ {H L}). (4) +$$ + +As shown in the Fig. 3, after the diffusion process, we use a convolutional layer to map the obtained structural features to the same dimension as the encoder features of each layer. By incorporating multiple WpMD modules into the SAM encoder at different layers, the SAM encoder enhances its ability to suppress noise while preserving the structural features of the infrared images, which effectively addresses the issue of low SNR and blurred target edge in the IRSTD task. + +![](images/49dd411b36a0bd3be3a0e037813c4f4e19f03df9e4df51a7a70a85a0d0790fb9.jpg) +Fig. 3: Structure of the WpMD. + +# 3.3 Granularity-Aware Decoder + +Small infrared targets usually have limited visual features and are easily confounded with the background or similar targets. To improve the performance of infrared small target segmentation, it is necessary to consider both the global context information, which can help extract the overall semantics of the image and enhance the detection of small objects, as well as the local boundary information, which can help preserve the spatial details of small objects and improve the precision of segmentation boundaries. SAM adopts the ViT architecture, which excels at capturing long-term dependence and global information. The early layer of the ViT structure has been demonstrated to preserve more general image boundary details in previous works while the deep layer contains higher-level semantics [13, 19]. To improve the performance of SAM in the IRSTD task, we devise the Granularity-Aware Decoder to fuse the multi-granularity features By feeding global semantic context and local fine-grained features to the decoder, GAD enjoys a richer multi-view knowledge, as shown in Fig. 2. + +First, we perform two-way cross attention on the image embeddings $X \in R^{64 \times 64 \times 256}$ from the encoder and output tokens $T_{tokens}$ consisting of mask tokens $T_{mask} \in R^{4 \times 256}$ and a newly designed edge token $T_{edge} \in R^{1 \times 256}$ , i.e., image-to-token cross attention and token-to-image cross attention: + +$$ +X _ {\text {c o a r s e}}, \widetilde {T} _ {\text {t o k e n s}} = \text {C r o s s A t t e n t i o n} (X, T _ {\text {t o k e n s}}). \tag {5} +$$ + +The $\widetilde{T}_{\text{tokens}}$ after the cross-attention update has integrated global image context as well as the information of other tokens and the edge token $T_{edge}$ is learnable and randomly initialized in the decoder like the mask tokens $T_{mask}$ . We then upsample $X_{\text{coarse}} \in R^{64 \times 64 \times 256}$ and fuse it with the multi-granularity feature $X_{\text{multi}}$ to get the refined image features: + +$$ +X _ {\text {f i n e}} = \operatorname {T C o n v} \left(X _ {\text {c o a r s e}}\right) + X _ {\text {m u l t i}}. \tag {6} +$$ + +Here, TConv denotes transposed convolution which is used to match the size of $X_{\text{coarse}}$ and $X_{\text{multi}}$ . $X_{\text{multi}}$ is obtained as follows: + +$$ +\begin{array}{l} X _ {m u l t i} = \operatorname {C o n v} (\operatorname {R e L U} (\operatorname {N o r m} (\operatorname {C o n v} (X _ {s h a l l o w})))) \\ + \operatorname {T C o n v} (\operatorname {R e L U} (\operatorname {N o r m} (\operatorname {T C o n v} (X _ {\text {d e e p}})))) \tag {7} \\ \end{array} +$$ + +where $X_{shallow} \in R^{128 \times 128 \times 128}$ and $X_{deep} \in R^{64 \times 64 \times 256}$ represent the features of the shallow layer (i.e., the first layer) and deep layer (i.e., the fourth layer) of the encoder, respectively. Conv, Norm, and ReLU stand for convolution, layer normalization, and the ReLU activation function, respectively. + +Finally, we use MLPs to generate dynamic convolution kernels from the updated tokens $\widetilde{T}_{\text{tokens}}$ in Eq. (5) and apply them to $X_{fine} \in R^{256 \times 256 \times 32}$ and upsampled $X_{coarse} \in R^{256 \times 256 \times 32}$ in Eq. (6) via Hadamard product to get the high-quality edge prediction and mask prediction. This process can be expressed: + +$$ +X _ {e d g e} = \operatorname {M L P} \left(\widetilde {T} _ {e d g e}\right) \odot X _ {f i n e}, \tag {8} +$$ + +$$ +X _ {\text {m a s k}} = \operatorname {M L P} \left(\widetilde {T} _ {\text {m a s k}}\right) \odot X _ {\text {c o a r s e}}, \tag {9} +$$ + +where $\odot$ stands for dot product. Finally, the obtained edge is used to improve the shape and size of the mask. Through the above process, the proposed GAD achieves the fusion of multi-granularity features in the decoder, integrates global context and local boundary information into the tokens, and finally obtains high-quality infrared small target masks. + +# 3.4 Loss Functions + +Dice Loss: Dice loss is a commonly used method to evaluate the difference between the predicted mask and the ground truth, which is defined as follows: + +$$ +L _ {D i c e} = 1 - 2 \times \frac {\left| Y _ {L a b e l} + Y _ {P r e d} \right|}{\left| Y _ {L a b e l} \right| + \left| Y _ {P r e d} \right|}, \tag {10} +$$ + +where $|Y_{Label} \cap Y_{Pred}|$ is the intersection of the ground truth $Y_{Label}$ and the prediction $Y_{Pred}$ . $|\cdot|$ is the number of target pixels in the mask. + +BCE Loss: Binary Cross Entropy (BCE) Loss is a common loss function for binary classification tasks. It is used to measure the difference between the edge prediction $Y_{PredEdge}$ and the ground truth edge $Y_{Edge}$ , which is defined as: + +$$ +L _ {B C E} = - Y _ {E d g e} \times \log \left(Y _ {P r e d E d g e}\right) - (1 - Y _ {L a b e l}) \times \log \left(1 - Y _ {P r e d E d g e}\right). \tag {11} +$$ + +The final loss consisting of the Dice loss $L_{Dice}$ and BCE loss $L_{BCE}$ is used to supervise the training of IRSAM: + +$$ +L = L _ {D i c e} + \lambda L _ {B C E}, \tag {12} +$$ + +where $\lambda$ is a hyper-parameter to balance the two losses and set to 10 empirically. + +Table 1: Comparison with representative methods on IRSTD-1k, NUDT-SIRST and NUAA-SIRST in Params(M), FPS(/s), IoU(%, nIoU(%, $P_d(\%)$ , $F_a(10^{-6})$ . + +
MethodParams↓FPS↑IRSTD-1kNUDT-SIRSTNUAA-SIRST
IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓
Top-Hat [1]--10.067.43875.11143222.4037.5689.90174.11.5083.08479.7416456
Max-Median [10]--6.9983.05165.2159.7312.7517.4780.1360.116.02225.3584.34774.3
WSLCM [15]--3.4520.67872.4466191.8097.25875.89595.36.39328.3188.744462
TLLCM [2]--3.3110.78477.3967381.6836.97775.5611314.24012.0988.376243
IPI [12]--27.9220.4681.3716.1830.9335.9981.9817.991.0950.2387.0530467
NRAM [36]--15.259.89970.6816.936.936.1956.4019.2713.5418.9560.0425.23
RIPT [6]--14.118.09377.5528.3129.6737.5791.6565.3016.7920.6569.7659.33
PSTNN [37]--24.5717.9371.9935.2627.8639.3174.7094.3130.3033.6772.8048.99
MSLSTIPT [26]--11.435.93279.0315248.347.9747.408811.0800.8140.0528.183
MDvsFA [29]3.9213949.5047.4182.1180.3375.1473.8590.4725.3460.3058.2689.3556.35
ACMNet [7]0.5256560.9758.0290.5821.7867.0865.395.9710.1872.3371.4396.339.33
ALCNet [8]0.5453462.0559.5890.5821.7881.4080.7196.519.2674.3173.1297.3420.21
Dim2Clear [48]--66.3464.2793.7520.9381.3780.9696.239.1777.2975.2499.106.72
UIUNet [30]50.545972.9168.6094.5910.1988.9189.6097.197.5478.8176.0999.084.97
DNANet [22]4.701669.8068.2994.2813.8987.0985.8798.737.0877.4776.3998.485.35
ISNet [47]1.0810868.7764.8495.5615.3984.9484.1395.798.9080.0278.1299.184.92
IRSAM (ours)12.3310373.6968.9796.927.5592.5993.2998.876.9480.7878.3999.533.95
+ +# 4 Experiments + +# 4.1 Experiment Details + +Datasets. We perform experiments on three datasets, including NUAA-SIRST [7], IRSTD-1k [47], and NUDT-SIRST [22]. They contain 427 and 1,000 real infrared images having one or more small targets, respectively, while NUDT-SIRST consists of 1,327 synthetic infrared images of small targets. All images in the datasets are resized to $512 \times 512$ . For each dataset, we use $50\%$ of the images as the train set, $30\%$ as the validation set, and $20\%$ as the test set, respectively. Evaluation Metrics. We compare the proposed IRSAM against SOTA methods using pixel-level metrics such as Intersection over Union (IoU) and Normalized Intersection over Union (nIoU) [7] and object-level metrics, including Probability of Detection $(P_d)$ and False-Alarm Rate $(F_a)$ for evaluation. + +Implementation Details We adopt the AdamW optimizer with a learning rate of 0.0001 and the Cosine Decay Learning Rate Scheduler to train our IRSAM. The model is trained for 500 epochs with a batch size of 4. The experiments are conducted on a single Nvidia GeForce 4090 GPU. For comparison, we choose CNN-based IRSTD methods: ISNet [47], UIUNet [30], DNANet [22], Dim2Clear [48], ALCNet [8], ACMNet [7], and MDvsFA [29], and select traditional methods: Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26]. + +# 4.2 Quantitative Results + +As shown in Tab. 1, traditional hand-crafted features-based methods have limited capabilities in handling challenging scenarios, thereby yielding significantly worse performance compared to CNN-based methods. However, CNN-based methods exhibit limitations in detecting small targets, leading to inaccurate mask + +![](images/46e51ef68cbbc6d342b7a27583b689416bbfe62d98abff37e9972a3b3b409ccf.jpg) +Fig. 4: Visualization results using different IRSTD methods. The closed views are shown at the border. In each prediction result, red, blue, and yellow boxes represent the correct detection, miss detection, and false detection, respectively. + +![](images/d7eb2843f37d45f291af51adfcf1b6dc5d3518a282243f7d7c276c23ed26ade2.jpg) +Fig. 5: 3D views of the detection results obtained by different methods. + +predictions with lower IoU and nIoU. Moreover, their efficiency in learning discriminative target representation is compromised in the presence of background noise, resulting in inefficient detection or missed detection. The proposed IR-SAM outperforms SOTA methods in all evaluation metrics on NUAA-SIRST, + +IRSTD-1k, and NUDT-SIRST datasets. The results show that IRSAM can effectively extract the structural information of the target, which is attributed to the proposed WpMD and GAD that improve the learning ability of the vanilla SAM architecture for IRSTD as well as the strong generic segmentation ability of SAM. + +We also plot the ROC curves of the results of different methods on NUASIRST as shown in Fig. 6. The results clearly demonstrate that our IRSAM outperforms the other methods by a substantial margin. The area under the ROC curve (AUC) for the proposed IR-SAM is notably larger than that of both the traditional and CNN-based methods. + +As depicted in Tab. 2, we compare our IRSAM with several SAM models that use different Transformer backbones with weights from MetaAI. + +![](images/ab56123fd99cfeb5b7fefedda6767f8d9d1337b79ecf22e996d428367689619c.jpg) +Fig. 6: ROC curves of different methods. + +The SAM models are adapted to the IRSTD task by fine-tuning the decoder or applying LoRA [3,16] on the encoder, while keeping the original encoder parameters frozen due to the prohibitive computation cost of fully fine-tuning. Notably, our IRSAM only employs a lightweight ViT-Tiny backbone, offering greater computational efficiency. IRSAM outperforms other SAM models across all metrics. In addition, our WpMD method demonstrates superior application of SAM to IRSTD tasks compared to other fine-tuning approaches, validating the effectiveness of the proposed modules in transferring a well-trained segmentation model from large-scale natural image datasets to IRSTD. + +# 4.3 Visual Results + +In Fig. 4, we present some detection results obtained by IRSAM and other IRSTD methods. As shown in the first test image that contains an aircraft, most of the traditional methods and CNN-based methods suffer from false detection and fail to segment the target correctly. In contrast, the proposed IRSAM not only segments the target accurately but also outperforms other methods in the segmentation of the gap between the wing and the main body of the aircraft, indicating that the proposed method has a good ability to segment complex shape targets. In addition, from the 3rd and 5th test images, it can be observed that our method can successfully segment two adjacent objects, whereas other methods may fail. Besides, the result of the 6th figure shows that our method can make more realistic prediction for a long and narrow object. We attribute + +Table 2: Comparison with fine-tuned SAM models on NUAA-SIRST in IoU, nIoU, $P_d$ , $F_a$ , Flops(G), Params(M). + +
MethodIoU↑nIoU↑Pd↑Fa↓Flops↓Params↓
SAM(ViT-B) with finetuned decoder67.4564.4195.4151.0537190
SAM(ViT-L) with finetuned decoder69.5567.3898.1744.491314308
SAM(ViT-H) with finetuned decoder70.9668.9297.2540.762736635
SAM(ViT-B) with adaptformer [3]67.9065.2595.4144.1837291
SAM(ViT-L) with adaptformer [3]69.1565.5996.3340.501315308
SAM(ViT-H) with adaptformer [3]69.4866.3197.2526.82738636
SAM(ViT-B) with WpMD74.1570.8597.2512.11611108
SAM(ViT-L) with WpMD75.0472.1498.178.781719338
SAM(ViT-H) with WpMD75.9673.4899.085.653341680
IRSAM80.7878.3999.533.9571.6312.33
+ +Table 3: Ablation study of the WPMD and GAD in IoU, $nIoU$ , $P_d$ , $F_a$ . + +
MethodIoU↑nIoU↑Pd↑Fa↓
w/o WpMD+GAD75.8473.2998.178.21
w/o GAD79.0076.2999.532.13
w/o WpMD78.7376.3999.0811.18
IRSAM80.7878.3999.533.95
+ +the excellent performance of IRSAM in the above scenarios to the proposed WpMD block, which can effectively preserve the structural information of the target while suppressing the noise. Moreover, from all the given test images, it can be seen that the masks predicted by IRSAM are closer to the ground truth than other methods in both shape and completeness, validating the idea of introducing multi-granularity features to the decoder for obtaining higher-quality predictions. In addition, we show the 3D views of prediction results in Fig. 5. The proposed IRSAM performs well in segmenting multiple objects that are close to each other. + +# 4.4 Ablation Study + +Impact of WpMD and GAD. As shown in Tab. 3, we conduct ablation studies to validate the effectiveness of WpMD and GAD on NUAA-dataset. For IRSAM without WpMD, we use the ViT-Tiny backbone for feature extraction in the encoder. Removing WpMD significantly reduces the IoU and $nIoU$ scores, indicating the model's diminished ability to handle the target edge. $P_{d}$ remains stable while $F_{a}$ increases a lot. For IRSAM without GAD, we adopt the original decoder from SAM. Removing GAD reduces IoU and $nIoU$ scores, validating the effectiveness of integrating multi-granularity features in the decoder for enhancing the segmentation performance. Furthermore, the Mobile-SAM baseline without both WpMD and GAD (first row) performs worse than the proposed IRSAM across all metrics. + +![](images/e36a60d9d91cb3d76572d1ff36c5d96d18822ed13af87cd9efff62f9855c66ae.jpg) +Fig. 7: Visualization of feature maps from encoders with different numbers of WpMD. + +![](images/de1a3729a0718dadbd4dbc6c4bf071aa19af22bf6fe0164b7ccab955eef28c1a.jpg) +Fig. 8: Comparison of the edge maps utilizing various methods. + +Table 4: Ablation study on different number of WpMD blocks in IoU, nIoU, $P_d$ , $F_a$ . + +
NumberIoU↑nIoU↑Pd↑Fa↓
176.1773.7098.1710.16
277.6975.1599.089.76
378.2576.0199.086.12
479.0076.2899.532.13
+ +Impact of the Number of WpMD Modules. We also conduct ablation experiments to investigate the effect of using different numbers of WpMD modules in the encoder. As can be seen from Tab. 4, when the number of WpMD feature blocks is 4, the performance is better than others. This conclusion can also be verified by investigating the feature maps obtained by different numbers of WpMD. As shown in Fig. 7, when the number of WpMD blocks is 4, the target + +Table 5: Ablation study on the design choice of GAD in IoU, nIoU, $P_d$ , $F_a$ . + +
TypeIoU↑nIoU↑Pd↑Fa↓
baseline78.6476.3499.085.50
+ shallow feature79.2276.5899.084.52
+ deep feature79.5877.1699.084.17
+ shallow&deep features80.7878.3999.533.95
+ +features in the obtained feature maps are significantly stronger than others. In addition, as visualized in Fig. 8, the use of WpMD effectively preserves internal details and eliminates noises, achievements not paralleled by the Laplacian or Sobel operators. This comparison further demonstrates the effectiveness of our method in preserving essential structural information. + +Impact of design choice of GAD We also conduct ablation experiments to investigate the effect of encoder layer information for GAD. As shown in Tab. 5, When GAD leverages both shallow and deep features simultaneously, it outperforms other options. This suggests that GAD benefits from a richer multiview understanding by providing both global semantic context and local fine-grained features, resulting in a significant performance boost. + +# 5 Conclusion + +This paper introduces IRSAM, a novel approach for the IRSTD task. Leveraging the generic segmentation capability of the SAM foundation model, which is trained on a large scale of natural images, IRSAM enhances performance for IRSTD through two specifically designed modules: WpMD and GAD. WpMD improves the encoder's edge feature extraction, while GAD integrates multi-granularity features in the decoder for enhanced shape representation. Experimental results on public datasets, including NUAA-SIRST, IRSTD-1k, and NUDT-SIRST, demonstrate IRSAM's superiority over state-of-the-art methods in both objective metrics and subjective evaluation. + +# Acknowledgement + +This work was supported in part by the National Natural Science Foundation of China under Grant 62272363, Grant 62036007, Grant U21A20514, Grant 62061047, and Grant 62076190; in part by the National Key Research and Development Program of China under Grant 2023YFA100860; in part by the Young Elite Scientists Sponsorship Program by China Association for Science and Technology (CAST) under Grant 2021QNRC001; in part by the Joint Laboratory for Innovation in Satellite-Borne Computers and Electronics Technology Open Fund 2023 under Grant 2024KFKT001-1; in part by the Key Industrial Innovation Chain Project in Industrial Domain under Grant 2022ZDLGY01-11, and in part by the Key Research and Development Project of Xi'an under Grant 23ZDCYJSGG0022-2023. + +# References + +1. Bai, X., Zhou, F.: Analysis of new top-hat transformation and the application for infrared dim small target detection. Pattern Recognition 43(6), 2145-2156 (2010) +2. Chen, C.P., Li, H., Wei, Y., Xia, T., Tang, Y.Y.: A local contrast method for small infrared target detection. IEEE Transactions on Geoscience and Remote Sensing 52(1), 574-581 (2013) +3. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. Advances in Neural Information Processing Systems 35, 16664-16678 (2022) +4. Chen, T., Zhu, L., Ding, C., Cao, R., Zhang, S., Wang, Y., Li, Z., Sun, L., Mao, P., Zang, Y.: Sam fails to segment anything?—sam-adapter: Adapting sam in underperformed scenes: Camouflage, shadow, and more. arXiv preprint arXiv:2304.09148 (2023) +5. Chen, Y., Yan, Z., Qian, Y.: An anisotropic diffusion model for medical image smoothing by using the lattice boltzmann method. In: 7th Asian-Pacific Conference on Medical and Biological Engineering: APCMBE 2008 22-25 April 2008 Beijing, China. pp. 255-259. Springer (2008) +6. Dai, Y., Wu, Y.: Reweighted infrared patch-tensor model with both nonlocal and local priors for single-frame small target detection. IEEE journal of selected topics in applied earth observations and remote sensing 10(8), 3752-3767 (2017) +7. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Asymmetric contextual modulation for infrared small target detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 950-959 (2021) +8. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Attentional local contrast networks for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 59(11), 9813-9824 (2021) +9. Deng, H., Sun, X., Liu, M., Ye, C., Zhou, X.: Small infrared target detection based on weighted local difference measure. IEEE Transactions on Geoscience and Remote Sensing 54(7), 4204-4214 (2016) +0. Deshpande, S.D., Er, M.H., Venkateswarlu, R., Chan, P.: Max-mean and maxmedian filters for detection of small targets. In: Signal and Data Processing of Small Targets 1999. vol. 3809, pp. 74-83. SPIE (1999) +1. Dong, B., Jiang, Q., Shen, Z.: Image restoration: Wavelet frame shrinkage, nonlinear evolution pdes, and beyond. Multiscale Modeling & Simulation 15(1), 606-660 (2017) +2. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE Transactions on Image Processing 22(12), 4996-5009 (2013) +3. Ghiasi, A., Kazemi, H., Borgnia, E., Reich, S., Shu, M., Goldblum, M., Wilson, A.G., Goldstein, T.: What do vision transformers learn? a visual exploration. arXiv preprint arXiv:2212.06727 (2022) +4. Guo, Z., Sun, J., Zhang, D., Wu, B.: Adaptive perona-malik model based on the variable exponent for image denoising. IEEE Transactions on Image Processing 21(3), 958-967 (2011) +5. Han, J., Moradi, S., Faramarzi, I., Zhang, H., Zhao, Q., Zhang, X., Li, N.: Infrared small target detection based on the weighted strengthened local contrast measure. IEEE Geoscience and Remote Sensing Letters 18(9), 1670-1674 (2020) +6. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021) + +17. Huang, Y., Yang, X., Liu, L., Zhou, H., Chang, A., Zhou, X., Chen, R., Yu, J., Chen, J., Chen, C., et al.: Segment anything model for medical images? arXiv preprint arXiv:2304.14660 (2023) +18. Jain, S., Salman, H., Khaddaj, A., Wong, E., Park, S.M., Madry, A.: A data-based perspective on transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3613-3622 (2023) +19. Ke, L., Ye, M., Danelljan, M., Tai, Y.W., Tang, C.K., Yu, F., et al.: Segment anything in high quality. Advances in Neural Information Processing Systems 36 (2024) +20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4015-4026 (2023) +21. Li, B., Wang, Y., Wang, L., Zhang, F., Liu, T., Lin, Z., An, W., Guo, Y.: Monte carlo linear clustering with single-point supervision is enough for infrared small target detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023) +22. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022) +23. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15(1), 654 (2024) +24. Perona, P., Shiota, T., Malik, J.: Anisotropic diffusion. Geometry-driven diffusion in computer vision pp. 73-92 (1994) +25. Sohn, K., Chang, H., Lezama, J., Polania, L., Zhang, H., Hao, Y., Essa, I., Jiang, L.: Visual prompt tuning for generative transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19840-19851 (2023) +26. Sun, Y., Yang, J., An, W.: Infrared dim and small target detection via multiple subspace learning and spatial-temporal patch-tensor model. IEEE Transactions on Geoscience and Remote Sensing 59(5), 3737-3752 (2020) +27. Teutsch, M., Krüger, W.: Classification of small boats in infrared images for maritime surveillance. In: 2010 International WaterSide Security Conference. pp. 1-7. IEEE (2010) +28. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.u., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems. vol. 30 (2017) +29. Wang, H., Zhou, L., Wang, L.: Miss detection vs. false alarm: Adversarial learning for small object segmentation in infrared images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8509-8518 (2019) +30. Wu, X., Hong, D., Chanussot, J.: Uiu-net: U-net in u-net for infrared small object detection. IEEE Transactions on Image Processing 32, 364-376 (2022) +31. Yang, M., Liang, J., Zhang, J., Gao, H., Meng, F., Xingdong, L., Song, S.J.: Nonlocal means theory based perona-malik model for image denosing. Neurocomputing 120, 262-267 (2013) +32. Ying, X., Liu, L., Wang, Y., Li, R., Chen, N., Lin, Z., Sheng, W., Zhou, S.: Mapping degeneration meets label evolution: Learning infrared small target detection with single point supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15528-15538 (2023) + +33. Zhang, C., Han, D., Qiao, Y., Kim, J.U., Bae, S.H., Lee, S., Hong, C.S.: Faster segment anything: Towards lightweight sam for mobile applications. arXiv preprint arXiv:2306.14289 (2023) +34. Zhang, J., Tao, D.: Empowering things with intelligence: A survey of the progress, challenges, and opportunities in artificial intelligence of things. IEEE Internet of Things Journal 8(10), 7789-7817 (2020) +35. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023) +36. Zhang, L., Peng, L., Zhang, T., Cao, S., Peng, Z.: Infrared small target detection via non-convex rank approximation minimization joint 12, 1 norm. Remote Sensing 10(11), 1821 (2018) +37. Zhang, L., Peng, Z.: Infrared small target detection based on partial sum of the tensor nuclear norm. Remote Sensing 11(4), 382 (2019) +38. Zhang, M., Bai, H., Zhang, J., Zhang, R., Wang, C., Guo, J., Gao, X.: Rkformer: Runge-kutta transformer with random-connection attention for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1730-1738 (2022) +39. Zhang, M., He, C., Zhang, J., Yang, Y., Peng, X., Guo, J.: Sar-to-optical image translation via neural partial differential equations. IJCAI. ijcai. org pp. 1644-1650 (2022) +40. Zhang, M., Wang, N., Li, Y., Gao, X.: Deep latent low-rank representation for face sketch synthesis. IEEE transactions on neural networks and learning systems 30(10), 3109-3123 (2019) +41. Zhang, M., Wang, N., Li, Y., Gao, X.: Neural probabilistic graphical model for face sketch synthesis. IEEE transactions on neural networks and learning systems 31(7), 2623-2637 (2019) +42. Zhang, M., Xin, J., Zhang, J., Tao, D., Gao, X.: Curvature consistent network for microscope chip image super-resolution. IEEE Transactions on Neural Networks and Learning Systems 34(12), 10538-10551 (2023) +43. Zhang, M., Yang, H., Guo, J., Li, Y., Gao, X., Zhang, J.: Irprunedet: efficient infrared small target detection via wavelet structure-regularized soft channel pruning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7224-7232 (2024) +44. Zhang, M., Yue, K., Li, B., Guo, J., Li, Y., Gao, X.: Single-frame infrared small target detection via gaussian curvature inspired network. IEEE Transactions on Geoscience and Remote Sensing pp. 1-15 (2024). https://doi.org/10.1109/TGRS.2024.3423492 +45. Zhang, M., Yue, K., Zhang, J., Li, Y., Gao, X.: Exploring feature compensation and cross-level correlation for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1857-1865 (2022) +46. Zhang, M., Zhang, C., Zhang, Q., Guo, J., Gao, X., Zhang, J.: Essaformer: Efficient transformer for hyperspectral image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 23073-23084 (2023) +47. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022) +48. Zhang, M., Zhang, R., Zhang, J., Guo, J., Li, Y., Gao, X.: Dim2clear network for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 61, 1-14 (2023) + +49. Zhao, B., Wang, C., Fu, Q., Han, Z.: A novel pattern for infrared small target detection with generative adversarial network. IEEE Transactions on Geoscience and Remote Sensing 59(5), 4481-4492 (2020) +50. Zhao, X., Ding, W., An, Y., Du, Y., Yu, T., Li, M., Tang, M., Wang, J.: Fast segment anything. arXiv preprint arXiv:2306.12156 (2023) \ No newline at end of file diff --git a/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/images.zip b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..d908369f8f641bb4ea26dfa5cb0c357c49199d4c --- /dev/null +++ b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ef936479a27a7515d313d5975510264be7e872659b4921400375610cb6490946 +size 653393 diff --git a/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/layout.json b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..672bff1315b794131412d08c8988bcc33df39396 --- /dev/null +++ b/2024/IRSAM_ Advancing Segment Anything Model for Infrared Small Target Detection/layout.json @@ -0,0 +1,8569 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 134, + 111, + 479, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 111, + 479, + 148 + ], + "spans": [ + { + "bbox": [ + 134, + 111, + 479, + 148 + ], + "type": "text", + "content": "IRSAM: Advancing Segment Anything Model for Infrared Small Target Detection" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "spans": [ + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "text", + "content": "Mingjin Zhang" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "text", + "content": ", Yuchun Wang" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "text", + "content": ", Jie Guo" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "text", + "content": ", Yunsong Li" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "text", + "content": ", Xinbo Gao" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "text", + "content": ", and Jing Zhang" + }, + { + "bbox": [ + 150, + 168, + 462, + 194 + ], + "type": "inline_equation", + "content": "^{3}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 187, + 201, + 425, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 201, + 425, + 224 + ], + "spans": [ + { + "bbox": [ + 187, + 201, + 425, + 224 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 187, + 201, + 425, + 224 + ], + "type": "text", + "content": " Xidian University, Xi'an, China {mjinzhang, 22011210918, jguo, ysli}@xidian.edu.cn" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 149, + 224, + 463, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 224, + 463, + 246 + ], + "spans": [ + { + "bbox": [ + 149, + 224, + 463, + 246 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 149, + 224, + 463, + 246 + ], + "type": "text", + "content": " Chongqing University of Posts and Telecommunications, Chongqing, China \n" + }, + { + "bbox": [ + 149, + 224, + 463, + 246 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 149, + 224, + 463, + 246 + ], + "type": "text", + "content": " The University of Sydney, Sydney, Australia" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 279, + 455, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 279, + 455, + 511 + ], + "spans": [ + { + "bbox": [ + 159, + 279, + 455, + 511 + ], + "type": "text", + "content": "Abstract. The recent Segment Anything Model (SAM) is a significant advancement in natural image segmentation, exhibiting potent zero-shot performance suitable for various downstream image segmentation tasks. However, directly utilizing the pretrained SAM for Infrared Small Target Detection (IRSTD) task falls short in achieving satisfying performance due to a notable domain gap between natural and infrared images. Unlike a visible light camera, a thermal imager reveals an object's temperature distribution by capturing infrared radiation. Small targets often show a subtle temperature transition at the object's boundaries. To address this issue, we propose the IRSAM model for IRSTD, which improves SAM's encoder-decoder architecture to learn better feature representation of infrared small objects. Specifically, we design a Perona-Malik diffusion (PMD)-based block and incorporate it into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder to capture structural information that may be lost in long-distance modeling. Extensive experiments on the public datasets, including NUAA-SIRST, NUDT-SIRST, and IRSTD-1K, validate the design choice of IRSAM and its significant superiority over representative state-of-the-art methods. The source code are available at: github.com/IPIC-Lab/IRSAM." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "spans": [ + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "text", + "content": "Keywords: Infrared small target detection " + }, + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "text", + "content": " Segment anything model " + }, + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "text", + "content": " Perona-Malik diffusion equation " + }, + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 521, + 453, + 544 + ], + "type": "text", + "content": " Granularity-Aware Decoder" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 566, + 230, + 578 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 566, + 230, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 566, + 230, + 578 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": "Infrared small target detection (IRSTD) plays a crucial role in various real-world applications, including traffic management and maritime rescue [9,27,34]. Infrared imaging uniquely captures thermal radiation, less affected by atmospheric scattering than visible light. Thus, under challenging visible light conditions like fog or rain, infrared images provide richer target information, making them more suitable for detecting obscured or indistinguishable targets, especially" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "small ones. Consequently, IRSTD has been a prominent focus in computer vision for decades [32, 47]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 144, + 479, + 156 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 144, + 479, + 156 + ], + "spans": [ + { + "bbox": [ + 130, + 144, + 479, + 156 + ], + "type": "text", + "content": "The traditional IRSTD methods can be divided into three subgroups: filter-" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 156, + 255, + 382 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 156, + 255, + 382 + ], + "spans": [ + { + "bbox": [ + 130, + 156, + 255, + 382 + ], + "type": "text", + "content": "based, human visual system (HVS)-based, and low-rank representatior-based methods [45]. However, these methods are effective only in high contrast or simple background scenarios, struggling in more challenging conditions due to heavy reliance on hyperparameter tuning and handcrafted features with limited representation ability. Recent advancements in deep learning and the availability of IRSTD public datasets offer a new solution. Approaches us" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 383, + 479, + 419 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 383, + 479, + 419 + ], + "spans": [ + { + "bbox": [ + 130, + 383, + 479, + 419 + ], + "type": "text", + "content": "ing deep learning for IRSTD include generative adversarial networks (GANs) [29, 40, 41, 49], U-Net-based networks [7, 8, 30, 47] and transformer-based methods [38]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 422, + 481, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 481, + 517 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 481, + 517 + ], + "type": "text", + "content": "Although these methods hold promise, their efficacy heavily relies on the architecture's specific design and the scale of training data. Obtaining such data is inherently more challenging compared to natural image datasets. With extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18,25] in mitigating generalization issues with limited training data for downstream tasks, a crucial question arises: Can a well-designed model pre-trained on a large-scale natural image dataset effectively kickstart the IRSTD task?" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "Segment Anything Model (SAM) [20] has recently sparked a surge of interest in the field of computer vision image segmentation. Built upon the plain vision transformer-based encoder-decoder architecture and trained on the world's largest segmentation dataset, its powerful zero-shot segmentation capability has inspired many studies that apply SAM to various image segmentation tasks [17, 19, 23, 35]. While SAM shows promising results, they are not tailored for the IRSTD problem, facing challenges due to significant differences between infrared and natural images. (1) Infrared small target images, characterized by the small size of distant targets and substantial background noise and clutter, face challenges in distinguishing targets from the background when employing SAM directly due to a low signal-to-noise ratio (SNR). (2) Infrared imaging relies on the thermal radiation of objects, differing from optical imaging. The" + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 276, + 180, + 459, + 322 + ], + "blocks": [ + { + "bbox": [ + 276, + 180, + 459, + 322 + ], + "lines": [ + { + "bbox": [ + 276, + 180, + 459, + 322 + ], + "spans": [ + { + "bbox": [ + 276, + 180, + 459, + 322 + ], + "type": "image", + "image_path": "caaa39fd844c95e7cafbb416c756fed8890f308e440304bd1d90f00557645e06.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 252, + 331, + 482, + 353 + ], + "lines": [ + { + "bbox": [ + 252, + 331, + 482, + 353 + ], + "spans": [ + { + "bbox": [ + 252, + 331, + 482, + 353 + ], + "type": "text", + "content": "Fig. 1: Visual Comparison. Segmentation results of different methods on complex structured targets." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "gradual radiation difference between the object and the background in infrared images results in a blurred target edge. This fuzzy edge makes SAM prone to segmenting the original gap into targets, especially when dealing with targets with complex structures, as demonstrated in Fig. 1. To address these issues, we aim to advance SAM for IRSTD through transfer learning, with a particular emphasis on refining its architecture to learn better feature representation for infrared small objects." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 200, + 483, + 368 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 483, + 368 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 483, + 368 + ], + "type": "text", + "content": "To this end, we propose the IRSAM model for IRSTD. It builds upon SAM with carefully designed blocks to improve its encoder and decoder, enhancing its ability to detect arbitrary infrared small objects in the context of background noise and clutter. Specifically, inspired by the Perona-Malik diffusion (PMD) equation used in image processing for image denoising and edge preservation, we design a Wavelet-based Perona-Malik Diffusion (WpMD) module by leveraging the wavelet transform to substitute the gradient term in the PMD equation. WpMD is incorporated into multiple levels of SAM's encoder to help it capture essential structural features while suppressing noise. Additionally, we devise a Granularity-Aware Decoder (GAD) to fuse the multi-granularity feature from the encoder via a two-way transformer to enhance the mask representation of objects in various sizes and shapes. To reduce the model size and computational complexity, we adopt the lightweight Mobile-SAM [33] as the base model and integrated the WpMD module and GAD to build our IRSAM." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 147, + 368, + 389, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 368, + 389, + 380 + ], + "spans": [ + { + "bbox": [ + 147, + 368, + 389, + 380 + ], + "type": "text", + "content": "The contributions of this paper can be summarized as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 387, + 481, + 532 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 387, + 481, + 446 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 387, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 387, + 481, + 446 + ], + "type": "text", + "content": "- We introduce IRSAM by redesigning the general vision segmentation model SAM for the IRSTD task for the first time. IRSAM outperforms the vanilla SAM model and state-of-the-art (SOTA) methods on challenging benchmarks in terms of both objective metrics and subjective evaluation, demonstrating superior performance." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 448, + 481, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 448, + 481, + 483 + ], + "spans": [ + { + "bbox": [ + 138, + 448, + 481, + 483 + ], + "type": "text", + "content": "- We design a WpMD module to enhance the ability of SAM's encoder to preserve edge-related features while suppressing the noise in the infrared images, effectively addressing the low-SNR issue in the IRSTD task." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 483, + 481, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 483, + 481, + 532 + ], + "spans": [ + { + "bbox": [ + 138, + 483, + 481, + 532 + ], + "type": "text", + "content": "- We design an GAD to reconstruct the target structural feature lost in capturing long-distance dependence by fusing the multi-granularity feature from the encoder via a carefully designed edge token, effectively enhancing the mask representation of objects in various sizes and shapes." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 559, + 237, + 572 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 559, + 237, + 572 + ], + "spans": [ + { + "bbox": [ + 132, + 559, + 237, + 572 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 585, + 323, + 597 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 585, + 323, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 585, + 323, + 597 + ], + "type": "text", + "content": "2.1 Infrared Small Target Detection" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 487, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 487, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 487, + 666 + ], + "type": "text", + "content": "The traditional IRSTD methods including Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26] based on hand-crafted features are tailored to specific scenarios, limiting their generalization to challenging situations. The deep learning-based methods have shown significant progress in IRSTD. For example, MDvsFA [29] applies" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 482, + 248 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 482, + 248 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 482, + 248 + ], + "type": "image", + "image_path": "cb8242379aed5dd9af4c54037ed377d19160103fa368f94226f14a095ac8a0fd.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 258, + 482, + 293 + ], + "lines": [ + { + "bbox": [ + 130, + 258, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 482, + 293 + ], + "type": "text", + "content": "Fig. 2: Overall Architecture of IRSAM. Utilizing an encoder-decoder structure rooted in SAM, IRSAM incorporates two novel modules: WpMD and GAD, crafted specifically for the IRSTD task." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 316, + 482, + 580 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 316, + 482, + 580 + ], + "spans": [ + { + "bbox": [ + 130, + 316, + 482, + 580 + ], + "type": "text", + "content": "conditional generative adversarial networks to address the IRSTD problem by achieving the trade-off between missed detection and false detection. Based on the U-Net structure, ACMNet [7] introduces a novel feature fusion approach employing asymmetric context modulation, while UIUNet [30] integrates multiple nested U-Net networks. In addition, Zhang et al. [38] present a transformer-based method for IRSTD called RKformer with random-connection attention. Considering the shape characteristics, Zhang et al. [47] design a Taylor finite difference-inspired edge block, developing ISNet. To enhance SNR, Zhang et al. [48] devise a Dim2Clear from the perspective of image enhancement and super-resolution reconstruction. To explore a lightweight network architecture, Zhang et al. [43] make the first attempt to propose an IRPruneDet model tailored for the IRSTD task through network pruning. Although these methods have shown promising results, they typically require large-scale labeled data for training. Obtaining such data is inherently more challenging compared to natural image datasets. Recently, Li et al. [21] and Ying et al. [32] recently introduce a cost-effective weakly supervised approach for IRSTD, leveraging single-point supervision to reduce annotation expenses. In this paper, we tackle this challenge from a different perspective. Given the extensive research on deep models in the natural image domain and the proven effectiveness of transfer learning [18, 25] in mitigating generalization issues with limited training data for downstream tasks, we propose harnessing a foundation segmentation model pre-trained on a large-scale natural image dataset for the IRSTD task." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 597, + 291, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 597, + 291, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 597, + 291, + 609 + ], + "type": "text", + "content": "2.2 Segment Anything Model" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 617, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 483, + 666 + ], + "type": "text", + "content": "Transformer [28, 46] has found widespread application in computer vision tasks, yielding competitive results in various domains. SAM, a Transformer-based model tailored for semantic segmentation [20], allows users to segment objects with prompts in any image. Following that, some researchers fine-tune the structure" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "content": "of SAM to improve its performance on complex tasks such as shadow detection and medical image detection [4, 17, 23, 35]. To reduce the computation complexity of SAM, lightweight variants like Mobile SAM [33] and Fast SAM [50] have been proposed. Some attempts have been made to enhance the decoder of SAM for improved segmentation under challenging conditions [19]. However, these methods still rely on prompts to guide the segmentation process, restricting their applicability and efficiency for the IRSTD task. Besides, the inherent domain gap between natural and infrared images hampers SAM's performance in IRSTD. To address this challenge, we introduce the IRSAM model, enhancing SAM's encoder-decoder architecture to capture more effective feature representations for small infrared objects while leveraging its pre-trained knowledge for segmentation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 275, + 365, + 288 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 275, + 365, + 288 + ], + "spans": [ + { + "bbox": [ + 131, + 275, + 365, + 288 + ], + "type": "text", + "content": "2.3 Diffusion Equation for Image Processing" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 292, + 483, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 292, + 483, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 292, + 483, + 472 + ], + "type": "text", + "content": "The nonlinear diffusion equation, addressing anisotropic diffusion, has been used to adapt the diffusion coefficient based on local image features like gradient or curvature [42, 44] to preserve edge and texture information while eliminating noise. PMD equation [24] introduces gradient-based diffusion coefficient functions for image denoising and edge preservation. Chen et al. [5] apply PMD to medical image denoising, enhancing contrast and SNR by selecting suitable diffusion coefficient functions and parameters. Guo et al. [14] devise an adaptive PMD using variable exponent function spaces. Zhang et al. [39] propose a PMD neural module implemented in SAR-optical neural networks to reduce speckle noise in SAR images. Nevertheless, directly integrating PMD into neural networks presents challenges, including boundary blurring and reduced robustness to noise interference. In this work, we develop a WpMD module by incorporating the high-frequency component from wavelet transform as the image differential in the PMD equation, aiming to preserve structural information while mitigating noise impact." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 487, + 233, + 501 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 487, + 233, + 501 + ], + "spans": [ + { + "bbox": [ + 131, + 487, + 233, + 501 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 509, + 265, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 509, + 265, + 521 + ], + "spans": [ + { + "bbox": [ + 131, + 509, + 265, + 521 + ], + "type": "text", + "content": "3.1 Overall Architecture" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 525, + 482, + 611 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 611 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 611 + ], + "type": "text", + "content": "Fig. 2 illustrates the overall architecture of the proposed IRSAM, which adopts an encoder-decoder structure. The encoder of IRSAM comprises a pre-trained ViT-Tiny backbone and WpMD blocks. ViT-Tiny aggregates the edge features extracted by WpMD at each layer. For the decoder, unlike the original SAM decoder architecture, we fuse the features at different granularities from the encoder and use the output token to interact with image features and generate the final high-quality target mask." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 624, + 350, + 636 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 624, + 350, + 636 + ], + "spans": [ + { + "bbox": [ + 131, + 624, + 350, + 636 + ], + "type": "text", + "content": "3.2 Wavelet transform-based PMD Block" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Perona-Malik diffusion equation [24] is mainly used in image processing. The characteristic of anisotropic diffusion enables it to promote diffusion (smoothing)" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "in smoother regions while suppressing diffusion at the edges, thereby achieving the effect of improving image quality, enhancing image structure, and suppressing noise [14,31]. Infrared images are often corrupted by noise and have blurred object boundaries, which pose great challenges for the transfer of SAM to the IRSTD task. Therefore, we propose to explore PMD to preserve essential structural information and eliminate noises simultaneously in this transfer process. Instead of using the convolutions operator, we propose to use the high-frequency component from wavelet transform as the image differential in the PMD equation. As a result, the output of WpMD would be a smoother version of the input, preserving essential structural information while eliminating noise." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 236, + 428, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 236, + 428, + 248 + ], + "spans": [ + { + "bbox": [ + 146, + 236, + 428, + 248 + ], + "type": "text", + "content": "Given a picture " + }, + { + "bbox": [ + 146, + 236, + 428, + 248 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 146, + 236, + 428, + 248 + ], + "type": "text", + "content": ", its corresponding PMD equation is given by:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 255, + 257, + 481, + 280 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 257, + 481, + 280 + ], + "spans": [ + { + "bbox": [ + 255, + 257, + 481, + 280 + ], + "type": "interline_equation", + "content": "\\frac {\\partial u}{\\partial t} = \\operatorname {d i v} (g (| \\nabla u |) \\nabla u), \\tag {1}", + "image_path": "2b5b33f350b3f5393a6efb059409d472bb7f2d83bc334c5f587778e1aba89135.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": "where diffusion coefficient " + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "inline_equation", + "content": "g(|\\nabla u|) = 1 / (1 + |\\nabla u|^2 / k^2)" + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": " is a positive constant used to control the degree of diffusion. " + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": " represents the step [14]. From Eq. (1), it can be seen that when the gradient magnitude " + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "inline_equation", + "content": "|\\nabla u|" + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": " of the smooth region is small, the diffusion coefficient " + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "inline_equation", + "content": "g(|\\nabla u|)" + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": " is large. Consequently, the diffusion is strong and the noise is effectively removed. In the edge part, the gradient magnitude " + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "inline_equation", + "content": "|\\nabla u|" + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": " is large and the diffusion coefficient " + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "inline_equation", + "content": "g(|\\nabla u|)" + }, + { + "bbox": [ + 130, + 289, + 482, + 373 + ], + "type": "text", + "content": " is small. Thus, the diffusion is weak and the edge information is retained." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 146, + 375, + 355, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 375, + 355, + 387 + ], + "spans": [ + { + "bbox": [ + 146, + 375, + 355, + 387 + ], + "type": "text", + "content": "Eq. (1) can be expressed in the following form:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 396, + 481, + 441 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 396, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 134, + 396, + 481, + 441 + ], + "type": "interline_equation", + "content": "\\frac {\\partial u}{\\partial t} = \\frac {\\partial}{\\partial x} \\left\\{g \\left(\\sqrt {\\left(\\frac {\\partial u}{\\partial x}\\right) ^ {2} + \\left(\\frac {\\partial u}{\\partial y}\\right) ^ {2}}\\right) \\frac {\\partial u}{\\partial x} \\right\\} + \\frac {\\partial}{\\partial y} \\left\\{g \\left(\\sqrt {\\left(\\frac {\\partial u}{\\partial x}\\right) ^ {2} + \\left(\\frac {\\partial u}{\\partial y}\\right) ^ {2}}\\right) \\frac {\\partial u}{\\partial y} \\right\\}. \\tag {2}", + "image_path": "b768724e7562b6fa880ddcd70c1c2f956b088d838b024e9204f5201ade226a21.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 146, + 441, + 481, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 441, + 481, + 453 + ], + "spans": [ + { + "bbox": [ + 146, + 441, + 481, + 453 + ], + "type": "text", + "content": "On the other hand, the 2D wavelet transform of an image can be represented:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 223, + 466, + 481, + 479 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 466, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 223, + 466, + 481, + 479 + ], + "type": "interline_equation", + "content": "u _ {w} = F _ {w} (u), w \\in \\{L L, L H, H L, H H \\}, \\tag {3}", + "image_path": "6bdc1da3811ed66da072c44cef43a69603f9393666b7f3d9856ccb9b8eb83ead.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "F(\\cdot)" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " represents the filtering operation. " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " stand for low-pass and high-pass, respectively. Building upon the concept of approximating a differential equation " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\frac{\\partial}{\\partial x}" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\frac{\\partial}{\\partial y}" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " with a wavelet frame " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "F_{LH}(\\cdot)" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "F_{HL}(\\cdot)" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " as discussed in [11] and setting the diffusion step size " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\triangle t" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " to one, we can transform the Eq. (2) into a discrete format:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 139, + 553, + 481, + 574 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 553, + 481, + 574 + ], + "spans": [ + { + "bbox": [ + 139, + 553, + 481, + 574 + ], + "type": "interline_equation", + "content": "u _ {k} - u _ {k - 1} = F _ {L H} (g (\\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \\cdot u _ {L H}) + F _ {H L} (g (\\sqrt {u _ {L H} ^ {2} + u _ {H L} ^ {2}}) \\cdot u _ {H L}). (4)", + "image_path": "7e4072e13f26fc18664305bcc6a63408e7c7777587aead078904939572d3feef.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "As shown in the Fig. 3, after the diffusion process, we use a convolutional layer to map the obtained structural features to the same dimension as the encoder features of each layer. By incorporating multiple WpMD modules into the SAM encoder at different layers, the SAM encoder enhances its ability to suppress noise while preserving the structural features of the infrared images, which effectively addresses the issue of low SNR and blurred target edge in the IRSTD task." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 175, + 118, + 440, + 278 + ], + "blocks": [ + { + "bbox": [ + 175, + 118, + 440, + 278 + ], + "lines": [ + { + "bbox": [ + 175, + 118, + 440, + 278 + ], + "spans": [ + { + "bbox": [ + 175, + 118, + 440, + 278 + ], + "type": "image", + "image_path": "49dd411b36a0bd3be3a0e037813c4f4e19f03df9e4df51a7a70a85a0d0790fb9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 238, + 289, + 373, + 300 + ], + "lines": [ + { + "bbox": [ + 238, + 289, + 373, + 300 + ], + "spans": [ + { + "bbox": [ + 238, + 289, + 373, + 300 + ], + "type": "text", + "content": "Fig. 3: Structure of the WpMD." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 323, + 300, + 335 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 323, + 300, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 323, + 300, + 335 + ], + "type": "text", + "content": "3.3 Granularity-Aware Decoder" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 341, + 482, + 508 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 508 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 508 + ], + "type": "text", + "content": "Small infrared targets usually have limited visual features and are easily confounded with the background or similar targets. To improve the performance of infrared small target segmentation, it is necessary to consider both the global context information, which can help extract the overall semantics of the image and enhance the detection of small objects, as well as the local boundary information, which can help preserve the spatial details of small objects and improve the precision of segmentation boundaries. SAM adopts the ViT architecture, which excels at capturing long-term dependence and global information. The early layer of the ViT structure has been demonstrated to preserve more general image boundary details in previous works while the deep layer contains higher-level semantics [13, 19]. To improve the performance of SAM in the IRSTD task, we devise the Granularity-Aware Decoder to fuse the multi-granularity features By feeding global semantic context and local fine-grained features to the decoder, GAD enjoys a richer multi-view knowledge, as shown in Fig. 2." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "spans": [ + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "text", + "content": "First, we perform two-way cross attention on the image embeddings " + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "inline_equation", + "content": "X \\in R^{64 \\times 64 \\times 256}" + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "text", + "content": " from the encoder and output tokens " + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "inline_equation", + "content": "T_{tokens}" + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "text", + "content": " consisting of mask tokens " + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "inline_equation", + "content": "T_{mask} \\in R^{4 \\times 256}" + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "text", + "content": " and a newly designed edge token " + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "inline_equation", + "content": "T_{edge} \\in R^{1 \\times 256}" + }, + { + "bbox": [ + 131, + 509, + 482, + 556 + ], + "type": "text", + "content": ", i.e., image-to-token cross attention and token-to-image cross attention:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 201, + 566, + 480, + 581 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 201, + 566, + 480, + 581 + ], + "spans": [ + { + "bbox": [ + 201, + 566, + 480, + 581 + ], + "type": "interline_equation", + "content": "X _ {\\text {c o a r s e}}, \\widetilde {T} _ {\\text {t o k e n s}} = \\text {C r o s s A t t e n t i o n} (X, T _ {\\text {t o k e n s}}). \\tag {5}", + "image_path": "ea0568fb36c5475b0aab8f9af0ff3c9f0df53b6cd3e34cec1c2b19dd536e8146.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "text", + "content": "The " + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\widetilde{T}_{\\text{tokens}}" + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "text", + "content": " after the cross-attention update has integrated global image context as well as the information of other tokens and the edge token " + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "inline_equation", + "content": "T_{edge}" + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "text", + "content": " is learnable and randomly initialized in the decoder like the mask tokens " + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "inline_equation", + "content": "T_{mask}" + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "text", + "content": ". We then upsample " + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "inline_equation", + "content": "X_{\\text{coarse}} \\in R^{64 \\times 64 \\times 256}" + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "text", + "content": " and fuse it with the multi-granularity feature " + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "inline_equation", + "content": "X_{\\text{multi}}" + }, + { + "bbox": [ + 131, + 585, + 482, + 647 + ], + "type": "text", + "content": " to get the refined image features:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 228, + 653, + 480, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 653, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 228, + 653, + 480, + 666 + ], + "type": "interline_equation", + "content": "X _ {\\text {f i n e}} = \\operatorname {T C o n v} \\left(X _ {\\text {c o a r s e}}\\right) + X _ {\\text {m u l t i}}. \\tag {6}", + "image_path": "0940dfc5bf5aeb8048e348c3533d03bcc73df004d3d0d5dbe57f7e3de1ddf41e.jpg" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": "Here, TConv denotes transposed convolution which is used to match the size of " + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "X_{\\text{coarse}}" + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "X_{\\text{multi}}" + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "X_{\\text{multi}}" + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": " is obtained as follows:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 202, + 149, + 480, + 176 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 149, + 480, + 176 + ], + "spans": [ + { + "bbox": [ + 202, + 149, + 480, + 176 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} X _ {m u l t i} = \\operatorname {C o n v} (\\operatorname {R e L U} (\\operatorname {N o r m} (\\operatorname {C o n v} (X _ {s h a l l o w})))) \\\\ + \\operatorname {T C o n v} (\\operatorname {R e L U} (\\operatorname {N o r m} (\\operatorname {T C o n v} (X _ {\\text {d e e p}})))) \\tag {7} \\\\ \\end{array}", + "image_path": "74f4cddd57fc16d26c6eeea3b95573bb0d63ca8bf8ba1538510cf0c25e87824f.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 185, + 481, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 185, + 481, + 233 + ], + "spans": [ + { + "bbox": [ + 130, + 185, + 481, + 233 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 185, + 481, + 233 + ], + "type": "inline_equation", + "content": "X_{shallow} \\in R^{128 \\times 128 \\times 128}" + }, + { + "bbox": [ + 130, + 185, + 481, + 233 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 185, + 481, + 233 + ], + "type": "inline_equation", + "content": "X_{deep} \\in R^{64 \\times 64 \\times 256}" + }, + { + "bbox": [ + 130, + 185, + 481, + 233 + ], + "type": "text", + "content": " represent the features of the shallow layer (i.e., the first layer) and deep layer (i.e., the fourth layer) of the encoder, respectively. Conv, Norm, and ReLU stand for convolution, layer normalization, and the ReLU activation function, respectively." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "text", + "content": "Finally, we use MLPs to generate dynamic convolution kernels from the updated tokens " + }, + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "inline_equation", + "content": "\\widetilde{T}_{\\text{tokens}}" + }, + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "text", + "content": " in Eq. (5) and apply them to " + }, + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "inline_equation", + "content": "X_{fine} \\in R^{256 \\times 256 \\times 32}" + }, + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "text", + "content": " and upsampled " + }, + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "inline_equation", + "content": "X_{coarse} \\in R^{256 \\times 256 \\times 32}" + }, + { + "bbox": [ + 130, + 234, + 481, + 282 + ], + "type": "text", + "content": " in Eq. (6) via Hadamard product to get the high-quality edge prediction and mask prediction. This process can be expressed:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 238, + 290, + 481, + 310 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 290, + 481, + 310 + ], + "spans": [ + { + "bbox": [ + 238, + 290, + 481, + 310 + ], + "type": "interline_equation", + "content": "X _ {e d g e} = \\operatorname {M L P} \\left(\\widetilde {T} _ {e d g e}\\right) \\odot X _ {f i n e}, \\tag {8}", + "image_path": "19e0ab71229bacf25325029ca0d4610624767874ab5ee9d4ad2b08e3dab71195.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 230, + 320, + 480, + 339 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 230, + 320, + 480, + 339 + ], + "spans": [ + { + "bbox": [ + 230, + 320, + 480, + 339 + ], + "type": "interline_equation", + "content": "X _ {\\text {m a s k}} = \\operatorname {M L P} \\left(\\widetilde {T} _ {\\text {m a s k}}\\right) \\odot X _ {\\text {c o a r s e}}, \\tag {9}", + "image_path": "7db564024b99f85f15d6cace3c2919e1871a1d2bb1c779a19932a45ad9fbb236.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 343, + 481, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 343, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 343, + 481, + 403 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 343, + 481, + 403 + ], + "type": "inline_equation", + "content": "\\odot" + }, + { + "bbox": [ + 130, + 343, + 481, + 403 + ], + "type": "text", + "content": " stands for dot product. Finally, the obtained edge is used to improve the shape and size of the mask. Through the above process, the proposed GAD achieves the fusion of multi-granularity features in the decoder, integrates global context and local boundary information into the tokens, and finally obtains high-quality infrared small target masks." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 421, + 235, + 431 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 421, + 235, + 431 + ], + "spans": [ + { + "bbox": [ + 132, + 421, + 235, + 431 + ], + "type": "text", + "content": "3.4 Loss Functions" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 441, + 481, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 481, + 464 + ], + "type": "text", + "content": "Dice Loss: Dice loss is a commonly used method to evaluate the difference between the predicted mask and the ground truth, which is defined as follows:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 231, + 473, + 481, + 499 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 473, + 481, + 499 + ], + "spans": [ + { + "bbox": [ + 231, + 473, + 481, + 499 + ], + "type": "interline_equation", + "content": "L _ {D i c e} = 1 - 2 \\times \\frac {\\left| Y _ {L a b e l} + Y _ {P r e d} \\right|}{\\left| Y _ {L a b e l} \\right| + \\left| Y _ {P r e d} \\right|}, \\tag {10}", + "image_path": "51c5eb3fd3ebd978dca544a05dfb3681095ef6474c65b2d9865a54388de8aeb1.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "inline_equation", + "content": "|Y_{Label} \\cap Y_{Pred}|" + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "text", + "content": " is the intersection of the ground truth " + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "inline_equation", + "content": "Y_{Label}" + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "text", + "content": " and the prediction " + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "inline_equation", + "content": "Y_{Pred}" + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "inline_equation", + "content": "|\\cdot|" + }, + { + "bbox": [ + 130, + 506, + 481, + 530 + ], + "type": "text", + "content": " is the number of target pixels in the mask." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "content": "BCE Loss: Binary Cross Entropy (BCE) Loss is a common loss function for binary classification tasks. It is used to measure the difference between the edge prediction " + }, + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "inline_equation", + "content": "Y_{PredEdge}" + }, + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "content": " and the ground truth edge " + }, + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "inline_equation", + "content": "Y_{Edge}" + }, + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "content": ", which is defined as:" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 146, + 577, + 481, + 590 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 577, + 481, + 590 + ], + "spans": [ + { + "bbox": [ + 146, + 577, + 481, + 590 + ], + "type": "interline_equation", + "content": "L _ {B C E} = - Y _ {E d g e} \\times \\log \\left(Y _ {P r e d E d g e}\\right) - (1 - Y _ {L a b e l}) \\times \\log \\left(1 - Y _ {P r e d E d g e}\\right). \\tag {11}", + "image_path": "adfbc904ba991169a2e89dacb79171185f7227804192e9b6caa9664c25404307.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 597, + 481, + 622 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 481, + 622 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 481, + 622 + ], + "type": "text", + "content": "The final loss consisting of the Dice loss " + }, + { + "bbox": [ + 130, + 597, + 481, + 622 + ], + "type": "inline_equation", + "content": "L_{Dice}" + }, + { + "bbox": [ + 130, + 597, + 481, + 622 + ], + "type": "text", + "content": " and BCE loss " + }, + { + "bbox": [ + 130, + 597, + 481, + 622 + ], + "type": "inline_equation", + "content": "L_{BCE}" + }, + { + "bbox": [ + 130, + 597, + 481, + 622 + ], + "type": "text", + "content": " is used to supervise the training of IRSAM:" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 261, + 632, + 481, + 644 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 632, + 481, + 644 + ], + "spans": [ + { + "bbox": [ + 261, + 632, + 481, + 644 + ], + "type": "interline_equation", + "content": "L = L _ {D i c e} + \\lambda L _ {B C E}, \\tag {12}", + "image_path": "33a0872037b0028f5e5478a6d1244efdce1e430a74f6e127052aab0d2739632a.jpg" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 653, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 653, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 653, + 481, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 653, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 653, + 481, + 666 + ], + "type": "text", + "content": " is a hyper-parameter to balance the two losses and set to 10 empirically." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 146, + 481, + 299 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 1: Comparison with representative methods on IRSTD-1k, NUDT-SIRST and NUAA-SIRST in Params(M), FPS(/s), IoU(%, nIoU(%, " + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "inline_equation", + "content": "P_d(\\%)" + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "inline_equation", + "content": "F_a(10^{-6})" + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 146, + 481, + 299 + ], + "lines": [ + { + "bbox": [ + 135, + 146, + 481, + 299 + ], + "spans": [ + { + "bbox": [ + 135, + 146, + 481, + 299 + ], + "type": "table", + "html": "
MethodParams↓FPS↑IRSTD-1kNUDT-SIRSTNUAA-SIRST
IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓IoU↑nIoU↑Pd↑Fa↓
Top-Hat [1]--10.067.43875.11143222.4037.5689.90174.11.5083.08479.7416456
Max-Median [10]--6.9983.05165.2159.7312.7517.4780.1360.116.02225.3584.34774.3
WSLCM [15]--3.4520.67872.4466191.8097.25875.89595.36.39328.3188.744462
TLLCM [2]--3.3110.78477.3967381.6836.97775.5611314.24012.0988.376243
IPI [12]--27.9220.4681.3716.1830.9335.9981.9817.991.0950.2387.0530467
NRAM [36]--15.259.89970.6816.936.936.1956.4019.2713.5418.9560.0425.23
RIPT [6]--14.118.09377.5528.3129.6737.5791.6565.3016.7920.6569.7659.33
PSTNN [37]--24.5717.9371.9935.2627.8639.3174.7094.3130.3033.6772.8048.99
MSLSTIPT [26]--11.435.93279.0315248.347.9747.408811.0800.8140.0528.183
MDvsFA [29]3.9213949.5047.4182.1180.3375.1473.8590.4725.3460.3058.2689.3556.35
ACMNet [7]0.5256560.9758.0290.5821.7867.0865.395.9710.1872.3371.4396.339.33
ALCNet [8]0.5453462.0559.5890.5821.7881.4080.7196.519.2674.3173.1297.3420.21
Dim2Clear [48]--66.3464.2793.7520.9381.3780.9696.239.1777.2975.2499.106.72
UIUNet [30]50.545972.9168.6094.5910.1988.9189.6097.197.5478.8176.0999.084.97
DNANet [22]4.701669.8068.2994.2813.8987.0985.8798.737.0877.4776.3998.485.35
ISNet [47]1.0810868.7764.8495.5615.3984.9484.1395.798.9080.0278.1299.184.92
IRSAM (ours)12.3310373.6968.9796.927.5592.5993.2998.876.9480.7878.3999.533.95
", + "image_path": "e07b2b853241d31af3a9aeff08dc3e3c3a28dbee067e9638a341689be8c34f4f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 322, + 229, + 335 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 322, + 229, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 322, + 229, + 335 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 346, + 258, + 358 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 346, + 258, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 346, + 258, + 358 + ], + "type": "text", + "content": "4.1 Experiment Details" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "content": "Datasets. We perform experiments on three datasets, including NUAA-SIRST [7], IRSTD-1k [47], and NUDT-SIRST [22]. They contain 427 and 1,000 real infrared images having one or more small targets, respectively, while NUDT-SIRST consists of 1,327 synthetic infrared images of small targets. All images in the datasets are resized to " + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "inline_equation", + "content": "512 \\times 512" + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "content": ". For each dataset, we use " + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "content": " of the images as the train set, " + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "inline_equation", + "content": "30\\%" + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "content": " as the validation set, and " + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "content": " as the test set, respectively. Evaluation Metrics. We compare the proposed IRSAM against SOTA methods using pixel-level metrics such as Intersection over Union (IoU) and Normalized Intersection over Union (nIoU) [7] and object-level metrics, including Probability of Detection " + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "inline_equation", + "content": "(P_d)" + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "content": " and False-Alarm Rate " + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "inline_equation", + "content": "(F_a)" + }, + { + "bbox": [ + 132, + 365, + 481, + 485 + ], + "type": "text", + "content": " for evaluation." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 486, + 481, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 486, + 481, + 581 + ], + "spans": [ + { + "bbox": [ + 132, + 486, + 481, + 581 + ], + "type": "text", + "content": "Implementation Details We adopt the AdamW optimizer with a learning rate of 0.0001 and the Cosine Decay Learning Rate Scheduler to train our IRSAM. The model is trained for 500 epochs with a batch size of 4. The experiments are conducted on a single Nvidia GeForce 4090 GPU. For comparison, we choose CNN-based IRSTD methods: ISNet [47], UIUNet [30], DNANet [22], Dim2Clear [48], ALCNet [8], ACMNet [7], and MDvsFA [29], and select traditional methods: Top-Hat [1], Max-Median [10], WSLCM [15], TLLCM [2], IPI [12], NRAM [36], RIPT [6], PSTNN [37], and MSLSTIPT [26]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 598, + 264, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 598, + 264, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 598, + 264, + 609 + ], + "type": "text", + "content": "4.2 Quantitative Results" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 618, + 485, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 618, + 485, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 618, + 485, + 665 + ], + "type": "text", + "content": "As shown in Tab. 1, traditional hand-crafted features-based methods have limited capabilities in handling challenging scenarios, thereby yielding significantly worse performance compared to CNN-based methods. However, CNN-based methods exhibit limitations in detecting small targets, leading to inaccurate mask" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 116, + 480, + 363 + ], + "blocks": [ + { + "bbox": [ + 134, + 116, + 480, + 363 + ], + "lines": [ + { + "bbox": [ + 134, + 116, + 480, + 363 + ], + "spans": [ + { + "bbox": [ + 134, + 116, + 480, + 363 + ], + "type": "image", + "image_path": "46e51ef68cbbc6d342b7a27583b689416bbfe62d98abff37e9972a3b3b409ccf.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 372, + 482, + 407 + ], + "lines": [ + { + "bbox": [ + 130, + 372, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 372, + 482, + 407 + ], + "type": "text", + "content": "Fig. 4: Visualization results using different IRSTD methods. The closed views are shown at the border. In each prediction result, red, blue, and yellow boxes represent the correct detection, miss detection, and false detection, respectively." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 151, + 422, + 465, + 567 + ], + "blocks": [ + { + "bbox": [ + 151, + 422, + 465, + 567 + ], + "lines": [ + { + "bbox": [ + 151, + 422, + 465, + 567 + ], + "spans": [ + { + "bbox": [ + 151, + 422, + 465, + 567 + ], + "type": "image", + "image_path": "d7eb2843f37d45f291af51adfcf1b6dc5d3518a282243f7d7c276c23ed26ade2.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 159, + 578, + 453, + 589 + ], + "lines": [ + { + "bbox": [ + 159, + 578, + 453, + 589 + ], + "spans": [ + { + "bbox": [ + 159, + 578, + 453, + 589 + ], + "type": "text", + "content": "Fig. 5: 3D views of the detection results obtained by different methods." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "predictions with lower IoU and nIoU. Moreover, their efficiency in learning discriminative target representation is compromised in the presence of background noise, resulting in inefficient detection or missed detection. The proposed IR-SAM outperforms SOTA methods in all evaluation metrics on NUAA-SIRST," + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 165 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 165 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 165 + ], + "type": "text", + "content": "IRSTD-1k, and NUDT-SIRST datasets. The results show that IRSAM can effectively extract the structural information of the target, which is attributed to the proposed WpMD and GAD that improve the learning ability of the vanilla SAM architecture for IRSTD as well as the strong generic segmentation ability of SAM." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 175, + 265, + 330 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 175, + 265, + 330 + ], + "spans": [ + { + "bbox": [ + 130, + 175, + 265, + 330 + ], + "type": "text", + "content": "We also plot the ROC curves of the results of different methods on NUASIRST as shown in Fig. 6. The results clearly demonstrate that our IRSAM outperforms the other methods by a substantial margin. The area under the ROC curve (AUC) for the proposed IR-SAM is notably larger than that of both the traditional and CNN-based methods." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 331, + 276, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 276, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 276, + 390 + ], + "type": "text", + "content": "As depicted in Tab. 2, we compare our IRSAM with several SAM models that use different Transformer backbones with weights from MetaAI." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 279, + 198, + 465, + 344 + ], + "blocks": [ + { + "bbox": [ + 279, + 198, + 465, + 344 + ], + "lines": [ + { + "bbox": [ + 279, + 198, + 465, + 344 + ], + "spans": [ + { + "bbox": [ + 279, + 198, + 465, + 344 + ], + "type": "image", + "image_path": "ab56123fd99cfeb5b7fefedda6767f8d9d1337b79ecf22e996d428367689619c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 291, + 354, + 460, + 366 + ], + "lines": [ + { + "bbox": [ + 291, + 354, + 460, + 366 + ], + "spans": [ + { + "bbox": [ + 291, + 354, + 460, + 366 + ], + "type": "text", + "content": "Fig. 6: ROC curves of different methods." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 391, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 391, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 391, + 482, + 499 + ], + "type": "text", + "content": "The SAM models are adapted to the IRSTD task by fine-tuning the decoder or applying LoRA [3,16] on the encoder, while keeping the original encoder parameters frozen due to the prohibitive computation cost of fully fine-tuning. Notably, our IRSAM only employs a lightweight ViT-Tiny backbone, offering greater computational efficiency. IRSAM outperforms other SAM models across all metrics. In addition, our WpMD method demonstrates superior application of SAM to IRSTD tasks compared to other fine-tuning approaches, validating the effectiveness of the proposed modules in transferring a well-trained segmentation model from large-scale natural image datasets to IRSTD." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 515, + 234, + 526 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 515, + 234, + 526 + ], + "spans": [ + { + "bbox": [ + 131, + 515, + 234, + 526 + ], + "type": "text", + "content": "4.3 Visual Results" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "In Fig. 4, we present some detection results obtained by IRSAM and other IRSTD methods. As shown in the first test image that contains an aircraft, most of the traditional methods and CNN-based methods suffer from false detection and fail to segment the target correctly. In contrast, the proposed IRSAM not only segments the target accurately but also outperforms other methods in the segmentation of the gap between the wing and the main body of the aircraft, indicating that the proposed method has a good ability to segment complex shape targets. In addition, from the 3rd and 5th test images, it can be observed that our method can successfully segment two adjacent objects, whereas other methods may fail. Besides, the result of the 6th figure shows that our method can make more realistic prediction for a long and narrow object. We attribute" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 414, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 414, + 90, + 447, + 101 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 146, + 475, + 273 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 2: Comparison with fine-tuned SAM models on NUAA-SIRST in IoU, nIoU, " + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "inline_equation", + "content": "P_d" + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "inline_equation", + "content": "F_a" + }, + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": ", Flops(G), Params(M)." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 146, + 475, + 273 + ], + "lines": [ + { + "bbox": [ + 136, + 146, + 475, + 273 + ], + "spans": [ + { + "bbox": [ + 136, + 146, + 475, + 273 + ], + "type": "table", + "html": "
MethodIoU↑nIoU↑Pd↑Fa↓Flops↓Params↓
SAM(ViT-B) with finetuned decoder67.4564.4195.4151.0537190
SAM(ViT-L) with finetuned decoder69.5567.3898.1744.491314308
SAM(ViT-H) with finetuned decoder70.9668.9297.2540.762736635
SAM(ViT-B) with adaptformer [3]67.9065.2595.4144.1837291
SAM(ViT-L) with adaptformer [3]69.1565.5996.3340.501315308
SAM(ViT-H) with adaptformer [3]69.4866.3197.2526.82738636
SAM(ViT-B) with WpMD74.1570.8597.2512.11611108
SAM(ViT-L) with WpMD75.0472.1498.178.781719338
SAM(ViT-H) with WpMD75.9673.4899.085.653341680
IRSAM80.7878.3999.533.9571.6312.33
", + "image_path": "ecc6859b40265c212862db48f0c42fc3e560e01150bf4b840cf16e90470392ab.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 140, + 304, + 471, + 365 + ], + "blocks": [ + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "lines": [ + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "spans": [ + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "type": "text", + "content": "Table 3: Ablation study of the WPMD and GAD in IoU, " + }, + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "type": "inline_equation", + "content": "nIoU" + }, + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "type": "inline_equation", + "content": "P_d" + }, + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "type": "inline_equation", + "content": "F_a" + }, + { + "bbox": [ + 157, + 283, + 455, + 295 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 140, + 304, + 471, + 365 + ], + "lines": [ + { + "bbox": [ + 140, + 304, + 471, + 365 + ], + "spans": [ + { + "bbox": [ + 140, + 304, + 471, + 365 + ], + "type": "table", + "html": "
MethodIoU↑nIoU↑Pd↑Fa↓
w/o WpMD+GAD75.8473.2998.178.21
w/o GAD79.0076.2999.532.13
w/o WpMD78.7376.3999.0811.18
IRSAM80.7878.3999.533.95
", + "image_path": "9c6807b7dd5e670657ab19c79911f0b6a4ba1f86431552139725a968283fa239.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 387, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 387, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 387, + 482, + 495 + ], + "type": "text", + "content": "the excellent performance of IRSAM in the above scenarios to the proposed WpMD block, which can effectively preserve the structural information of the target while suppressing the noise. Moreover, from all the given test images, it can be seen that the masks predicted by IRSAM are closer to the ground truth than other methods in both shape and completeness, validating the idea of introducing multi-granularity features to the decoder for obtaining higher-quality predictions. In addition, we show the 3D views of prediction results in Fig. 5. The proposed IRSAM performs well in segmenting multiple objects that are close to each other." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 513, + 238, + 525 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 513, + 238, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 513, + 238, + 525 + ], + "type": "text", + "content": "4.4 Ablation Study" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": "Impact of WpMD and GAD. As shown in Tab. 3, we conduct ablation studies to validate the effectiveness of WpMD and GAD on NUAA-dataset. For IRSAM without WpMD, we use the ViT-Tiny backbone for feature extraction in the encoder. Removing WpMD significantly reduces the IoU and " + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "inline_equation", + "content": "nIoU" + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": " scores, indicating the model's diminished ability to handle the target edge. " + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "inline_equation", + "content": "P_{d}" + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": " remains stable while " + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "inline_equation", + "content": "F_{a}" + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": " increases a lot. For IRSAM without GAD, we adopt the original decoder from SAM. Removing GAD reduces IoU and " + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "inline_equation", + "content": "nIoU" + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": " scores, validating the effectiveness of integrating multi-granularity features in the decoder for enhancing the segmentation performance. Furthermore, the Mobile-SAM baseline without both WpMD and GAD (first row) performs worse than the proposed IRSAM across all metrics." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 153, + 114, + 461, + 360 + ], + "blocks": [ + { + "bbox": [ + 153, + 114, + 461, + 360 + ], + "lines": [ + { + "bbox": [ + 153, + 114, + 461, + 360 + ], + "spans": [ + { + "bbox": [ + 153, + 114, + 461, + 360 + ], + "type": "image", + "image_path": "e36a60d9d91cb3d76572d1ff36c5d96d18822ed13af87cd9efff62f9855c66ae.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 368, + 480, + 380 + ], + "lines": [ + { + "bbox": [ + 132, + 368, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 368, + 480, + 380 + ], + "type": "text", + "content": "Fig. 7: Visualization of feature maps from encoders with different numbers of WpMD." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 161, + 393, + 457, + 456 + ], + "blocks": [ + { + "bbox": [ + 161, + 393, + 457, + 456 + ], + "lines": [ + { + "bbox": [ + 161, + 393, + 457, + 456 + ], + "spans": [ + { + "bbox": [ + 161, + 393, + 457, + 456 + ], + "type": "image", + "image_path": "de1a3729a0718dadbd4dbc6c4bf071aa19af22bf6fe0164b7ccab955eef28c1a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 175, + 467, + 436, + 479 + ], + "lines": [ + { + "bbox": [ + 175, + 467, + 436, + 479 + ], + "spans": [ + { + "bbox": [ + 175, + 467, + 436, + 479 + ], + "type": "text", + "content": "Fig. 8: Comparison of the edge maps utilizing various methods." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 184, + 510, + 427, + 571 + ], + "blocks": [ + { + "bbox": [ + 132, + 490, + 479, + 502 + ], + "lines": [ + { + "bbox": [ + 132, + 490, + 479, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 490, + 479, + 502 + ], + "type": "text", + "content": "Table 4: Ablation study on different number of WpMD blocks in IoU, nIoU, " + }, + { + "bbox": [ + 132, + 490, + 479, + 502 + ], + "type": "inline_equation", + "content": "P_d" + }, + { + "bbox": [ + 132, + 490, + 479, + 502 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 490, + 479, + 502 + ], + "type": "inline_equation", + "content": "F_a" + }, + { + "bbox": [ + 132, + 490, + 479, + 502 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 184, + 510, + 427, + 571 + ], + "lines": [ + { + "bbox": [ + 184, + 510, + 427, + 571 + ], + "spans": [ + { + "bbox": [ + 184, + 510, + 427, + 571 + ], + "type": "table", + "html": "
NumberIoU↑nIoU↑Pd↑Fa↓
176.1773.7098.1710.16
277.6975.1599.089.76
378.2576.0199.086.12
479.0076.2899.532.13
", + "image_path": "6b72d67d25c724ffffdf7aa26e77a5ae3ab732e597218beabd8842be97fedc45.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Impact of the Number of WpMD Modules. We also conduct ablation experiments to investigate the effect of using different numbers of WpMD modules in the encoder. As can be seen from Tab. 4, when the number of WpMD feature blocks is 4, the performance is better than others. This conclusion can also be verified by investigating the feature maps obtained by different numbers of WpMD. As shown in Fig. 7, when the number of WpMD blocks is 4, the target" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 181, + 135, + 430, + 196 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 463, + 125 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 463, + 125 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 463, + 125 + ], + "type": "text", + "content": "Table 5: Ablation study on the design choice of GAD in IoU, nIoU, " + }, + { + "bbox": [ + 149, + 114, + 463, + 125 + ], + "type": "inline_equation", + "content": "P_d" + }, + { + "bbox": [ + 149, + 114, + 463, + 125 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 149, + 114, + 463, + 125 + ], + "type": "inline_equation", + "content": "F_a" + }, + { + "bbox": [ + 149, + 114, + 463, + 125 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 181, + 135, + 430, + 196 + ], + "lines": [ + { + "bbox": [ + 181, + 135, + 430, + 196 + ], + "spans": [ + { + "bbox": [ + 181, + 135, + 430, + 196 + ], + "type": "table", + "html": "
TypeIoU↑nIoU↑Pd↑Fa↓
baseline78.6476.3499.085.50
+ shallow feature79.2276.5899.084.52
+ deep feature79.5877.1699.084.17
+ shallow&deep features80.7878.3999.533.95
", + "image_path": "f1483dc186ec76f797e3dbe680ada2ec8c4a1d929ff52b051f918866301dd5ac.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 216, + 481, + 276 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 216, + 481, + 276 + ], + "spans": [ + { + "bbox": [ + 130, + 216, + 481, + 276 + ], + "type": "text", + "content": "features in the obtained feature maps are significantly stronger than others. In addition, as visualized in Fig. 8, the use of WpMD effectively preserves internal details and eliminates noises, achievements not paralleled by the Laplacian or Sobel operators. This comparison further demonstrates the effectiveness of our method in preserving essential structural information." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 276, + 481, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 276, + 481, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 276, + 481, + 348 + ], + "type": "text", + "content": "Impact of design choice of GAD We also conduct ablation experiments to investigate the effect of encoder layer information for GAD. As shown in Tab. 5, When GAD leverages both shallow and deep features simultaneously, it outperforms other options. This suggests that GAD benefits from a richer multiview understanding by providing both global semantic context and local fine-grained features, resulting in a significant performance boost." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 364, + 220, + 376 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 364, + 220, + 376 + ], + "spans": [ + { + "bbox": [ + 132, + 364, + 220, + 376 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 386, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 386, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 386, + 482, + 495 + ], + "type": "text", + "content": "This paper introduces IRSAM, a novel approach for the IRSTD task. Leveraging the generic segmentation capability of the SAM foundation model, which is trained on a large scale of natural images, IRSAM enhances performance for IRSTD through two specifically designed modules: WpMD and GAD. WpMD improves the encoder's edge feature extraction, while GAD integrates multi-granularity features in the decoder for enhanced shape representation. Experimental results on public datasets, including NUAA-SIRST, IRSTD-1k, and NUDT-SIRST, demonstrate IRSAM's superiority over state-of-the-art methods in both objective metrics and subjective evaluation." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 510, + 242, + 525 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 242, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 242, + 525 + ], + "type": "text", + "content": "Acknowledgement" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant 62272363, Grant 62036007, Grant U21A20514, Grant 62061047, and Grant 62076190; in part by the National Key Research and Development Program of China under Grant 2023YFA100860; in part by the Young Elite Scientists Sponsorship Program by China Association for Science and Technology (CAST) under Grant 2021QNRC001; in part by the Joint Laboratory for Innovation in Satellite-Borne Computers and Electronics Technology Open Fund 2023 under Grant 2024KFKT001-1; in part by the Key Industrial Innovation Chain Project in Industrial Domain under Grant 2022ZDLGY01-11, and in part by the Key Research and Development Project of Xi'an under Grant 23ZDCYJSGG0022-2023." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 137, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 137, + 480, + 158 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 137, + 480, + 158 + ], + "spans": [ + { + "bbox": [ + 138, + 137, + 480, + 158 + ], + "type": "text", + "content": "1. Bai, X., Zhou, F.: Analysis of new top-hat transformation and the application for infrared dim small target detection. Pattern Recognition 43(6), 2145-2156 (2010)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 159, + 480, + 190 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 159, + 480, + 190 + ], + "spans": [ + { + "bbox": [ + 138, + 159, + 480, + 190 + ], + "type": "text", + "content": "2. Chen, C.P., Li, H., Wei, Y., Xia, T., Tang, Y.Y.: A local contrast method for small infrared target detection. IEEE Transactions on Geoscience and Remote Sensing 52(1), 574-581 (2013)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 191, + 480, + 223 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 191, + 480, + 223 + ], + "spans": [ + { + "bbox": [ + 138, + 191, + 480, + 223 + ], + "type": "text", + "content": "3. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. Advances in Neural Information Processing Systems 35, 16664-16678 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 224, + 480, + 266 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 224, + 480, + 266 + ], + "spans": [ + { + "bbox": [ + 138, + 224, + 480, + 266 + ], + "type": "text", + "content": "4. Chen, T., Zhu, L., Ding, C., Cao, R., Zhang, S., Wang, Y., Li, Z., Sun, L., Mao, P., Zang, Y.: Sam fails to segment anything?—sam-adapter: Adapting sam in underperformed scenes: Camouflage, shadow, and more. arXiv preprint arXiv:2304.09148 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 266, + 480, + 310 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 266, + 480, + 310 + ], + "spans": [ + { + "bbox": [ + 138, + 266, + 480, + 310 + ], + "type": "text", + "content": "5. Chen, Y., Yan, Z., Qian, Y.: An anisotropic diffusion model for medical image smoothing by using the lattice boltzmann method. In: 7th Asian-Pacific Conference on Medical and Biological Engineering: APCMBE 2008 22-25 April 2008 Beijing, China. pp. 255-259. Springer (2008)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 310, + 480, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 310, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 138, + 310, + 480, + 342 + ], + "type": "text", + "content": "6. Dai, Y., Wu, Y.: Reweighted infrared patch-tensor model with both nonlocal and local priors for single-frame small target detection. IEEE journal of selected topics in applied earth observations and remote sensing 10(8), 3752-3767 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 342, + 480, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 342, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 138, + 342, + 480, + 373 + ], + "type": "text", + "content": "7. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Asymmetric contextual modulation for infrared small target detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 950-959 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 374, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 374, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 374, + 480, + 407 + ], + "type": "text", + "content": "8. Dai, Y., Wu, Y., Zhou, F., Barnard, K.: Attentional local contrast networks for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 59(11), 9813-9824 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 407, + 480, + 438 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 407, + 480, + 438 + ], + "spans": [ + { + "bbox": [ + 138, + 407, + 480, + 438 + ], + "type": "text", + "content": "9. Deng, H., Sun, X., Liu, M., Ye, C., Zhou, X.: Small infrared target detection based on weighted local difference measure. IEEE Transactions on Geoscience and Remote Sensing 54(7), 4204-4214 (2016)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 439, + 480, + 471 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 439, + 480, + 471 + ], + "spans": [ + { + "bbox": [ + 138, + 439, + 480, + 471 + ], + "type": "text", + "content": "0. Deshpande, S.D., Er, M.H., Venkateswarlu, R., Chan, P.: Max-mean and maxmedian filters for detection of small targets. In: Signal and Data Processing of Small Targets 1999. vol. 3809, pp. 74-83. SPIE (1999)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 472, + 480, + 503 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 472, + 480, + 503 + ], + "spans": [ + { + "bbox": [ + 138, + 472, + 480, + 503 + ], + "type": "text", + "content": "1. Dong, B., Jiang, Q., Shen, Z.: Image restoration: Wavelet frame shrinkage, nonlinear evolution pdes, and beyond. Multiscale Modeling & Simulation 15(1), 606-660 (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 503, + 480, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 503, + 480, + 536 + ], + "spans": [ + { + "bbox": [ + 138, + 503, + 480, + 536 + ], + "type": "text", + "content": "2. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE Transactions on Image Processing 22(12), 4996-5009 (2013)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 536, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 536, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 536, + 480, + 567 + ], + "type": "text", + "content": "3. Ghiasi, A., Kazemi, H., Borgnia, E., Reich, S., Shu, M., Goldblum, M., Wilson, A.G., Goldstein, T.: What do vision transformers learn? a visual exploration. arXiv preprint arXiv:2212.06727 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 568, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 568, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 568, + 480, + 600 + ], + "type": "text", + "content": "4. Guo, Z., Sun, J., Zhang, D., Wu, B.: Adaptive perona-malik model based on the variable exponent for image denoising. IEEE Transactions on Image Processing 21(3), 958-967 (2011)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "text", + "content": "5. Han, J., Moradi, S., Faramarzi, I., Zhang, H., Zhao, Q., Zhang, X., Li, N.: Infrared small target detection based on the weighted strengthened local contrast measure. IEEE Geoscience and Remote Sensing Letters 18(9), 1670-1674 (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "text", + "content": "6. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "17. Huang, Y., Yang, X., Liu, L., Zhou, H., Chang, A., Zhou, X., Chen, R., Yu, J., Chen, J., Chen, C., et al.: Segment anything model for medical images? arXiv preprint arXiv:2304.14660 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "type": "text", + "content": "18. Jain, S., Salman, H., Khaddaj, A., Wong, E., Park, S.M., Madry, A.: A data-based perspective on transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3613-3622 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 481, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 481, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 481, + 217 + ], + "type": "text", + "content": "19. Ke, L., Ye, M., Danelljan, M., Tai, Y.W., Tang, C.K., Yu, F., et al.: Segment anything in high quality. Advances in Neural Information Processing Systems 36 (2024)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 218, + 481, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 218, + 481, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 218, + 481, + 262 + ], + "type": "text", + "content": "20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4015-4026 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 262, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 262, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 262, + 481, + 306 + ], + "type": "text", + "content": "21. Li, B., Wang, Y., Wang, L., Zhang, F., Liu, T., Lin, Z., An, W., Guo, Y.: Monte carlo linear clustering with single-point supervision is enough for infrared small target detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "spans": [ + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "type": "text", + "content": "22. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 341, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 341, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 341, + 481, + 363 + ], + "type": "text", + "content": "23. Ma, J., He, Y., Li, F., Han, L., You, C., Wang, B.: Segment anything in medical images. Nature Communications 15(1), 654 (2024)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 364, + 481, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 364, + 481, + 385 + ], + "spans": [ + { + "bbox": [ + 132, + 364, + 481, + 385 + ], + "type": "text", + "content": "24. Perona, P., Shiota, T., Malik, J.: Anisotropic diffusion. Geometry-driven diffusion in computer vision pp. 73-92 (1994)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 386, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 481, + 430 + ], + "type": "text", + "content": "25. Sohn, K., Chang, H., Lezama, J., Polania, L., Zhang, H., Hao, Y., Essa, I., Jiang, L.: Visual prompt tuning for generative transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19840-19851 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 431, + 481, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 431, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 431, + 481, + 464 + ], + "type": "text", + "content": "26. Sun, Y., Yang, J., An, W.: Infrared dim and small target detection via multiple subspace learning and spatial-temporal patch-tensor model. IEEE Transactions on Geoscience and Remote Sensing 59(5), 3737-3752 (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 464, + 481, + 497 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 481, + 497 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 481, + 497 + ], + "type": "text", + "content": "27. Teutsch, M., Krüger, W.: Classification of small boats in infrared images for maritime surveillance. In: 2010 International WaterSide Security Conference. pp. 1-7. IEEE (2010)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 498, + 481, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 481, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 481, + 531 + ], + "type": "text", + "content": "28. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.u., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems. vol. 30 (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 532, + 481, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 481, + 564 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 481, + 564 + ], + "type": "text", + "content": "29. Wang, H., Zhou, L., Wang, L.: Miss detection vs. false alarm: Adversarial learning for small object segmentation in infrared images. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8509-8518 (2019)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 565, + 481, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 565, + 481, + 587 + ], + "spans": [ + { + "bbox": [ + 132, + 565, + 481, + 587 + ], + "type": "text", + "content": "30. Wu, X., Hong, D., Chanussot, J.: Uiu-net: U-net in u-net for infrared small object detection. IEEE Transactions on Image Processing 32, 364-376 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 588, + 481, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 481, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 481, + 620 + ], + "type": "text", + "content": "31. Yang, M., Liang, J., Zhang, J., Gao, H., Meng, F., Xingdong, L., Song, S.J.: Nonlocal means theory based perona-malik model for image denosing. Neurocomputing 120, 262-267 (2013)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "type": "text", + "content": "32. Ying, X., Liu, L., Wang, Y., Li, R., Chen, N., Lin, Z., Sheng, W., Zhou, S.: Mapping degeneration meets label evolution: Learning infrared small target detection with single point supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15528-15538 (2023)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "33. Zhang, C., Han, D., Qiao, Y., Kim, J.U., Bae, S.H., Lee, S., Hong, C.S.: Faster segment anything: Towards lightweight sam for mobile applications. arXiv preprint arXiv:2306.14289 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 151, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 151, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 132, + 151, + 481, + 184 + ], + "type": "text", + "content": "34. Zhang, J., Tao, D.: Empowering things with intelligence: A survey of the progress, challenges, and opportunities in artificial intelligence of things. IEEE Internet of Things Journal 8(10), 7789-7817 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 480, + 206 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 480, + 206 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 480, + 206 + ], + "type": "text", + "content": "35. Zhang, K., Liu, D.: Customized segment anything model for medical image segmentation. arXiv preprint arXiv:2304.13785 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "type": "text", + "content": "36. Zhang, L., Peng, L., Zhang, T., Cao, S., Peng, Z.: Infrared small target detection via non-convex rank approximation minimization joint 12, 1 norm. Remote Sensing 10(11), 1821 (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 241, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 241, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 241, + 480, + 262 + ], + "type": "text", + "content": "37. Zhang, L., Peng, Z.: Infrared small target detection based on partial sum of the tensor nuclear norm. Remote Sensing 11(4), 382 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 263, + 480, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 263, + 480, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 263, + 480, + 306 + ], + "type": "text", + "content": "38. Zhang, M., Bai, H., Zhang, J., Zhang, R., Wang, C., Guo, J., Gao, X.: Rkformer: Runge-kutta transformer with random-connection attention for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1730-1738 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 308, + 480, + 341 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 480, + 341 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 480, + 341 + ], + "type": "text", + "content": "39. Zhang, M., He, C., Zhang, J., Yang, Y., Peng, X., Guo, J.: Sar-to-optical image translation via neural partial differential equations. IJCAI. ijcai. org pp. 1644-1650 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 342, + 480, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 342, + 480, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 342, + 480, + 374 + ], + "type": "text", + "content": "40. Zhang, M., Wang, N., Li, Y., Gao, X.: Deep latent low-rank representation for face sketch synthesis. IEEE transactions on neural networks and learning systems 30(10), 3109-3123 (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 376, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 376, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 480, + 407 + ], + "type": "text", + "content": "41. Zhang, M., Wang, N., Li, Y., Gao, X.: Neural probabilistic graphical model for face sketch synthesis. IEEE transactions on neural networks and learning systems 31(7), 2623-2637 (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 409, + 480, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 409, + 480, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 409, + 480, + 441 + ], + "type": "text", + "content": "42. Zhang, M., Xin, J., Zhang, J., Tao, D., Gao, X.: Curvature consistent network for microscope chip image super-resolution. IEEE Transactions on Neural Networks and Learning Systems 34(12), 10538-10551 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 443, + 480, + 485 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 443, + 480, + 485 + ], + "spans": [ + { + "bbox": [ + 132, + 443, + 480, + 485 + ], + "type": "text", + "content": "43. Zhang, M., Yang, H., Guo, J., Li, Y., Gao, X., Zhang, J.: Irprunedet: efficient infrared small target detection via wavelet structure-regularized soft channel pruning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7224-7232 (2024)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 487, + 480, + 529 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 480, + 529 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 480, + 529 + ], + "type": "text", + "content": "44. Zhang, M., Yue, K., Li, B., Guo, J., Li, Y., Gao, X.: Single-frame infrared small target detection via gaussian curvature inspired network. IEEE Transactions on Geoscience and Remote Sensing pp. 1-15 (2024). https://doi.org/10.1109/TGRS.2024.3423492" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 531, + 480, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 531, + 480, + 564 + ], + "spans": [ + { + "bbox": [ + 132, + 531, + 480, + 564 + ], + "type": "text", + "content": "45. Zhang, M., Yue, K., Zhang, J., Li, Y., Gao, X.: Exploring feature compensation and cross-level correlation for infrared small target detection. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 1857-1865 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 566, + 480, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 566, + 480, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 566, + 480, + 597 + ], + "type": "text", + "content": "46. Zhang, M., Zhang, C., Zhang, Q., Guo, J., Gao, X., Zhang, J.: Essaformer: Efficient transformer for hyperspectral image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 23073-23084 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "text", + "content": "47. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "text", + "content": "48. Zhang, M., Zhang, R., Zhang, J., Guo, J., Li, Y., Gao, X.: Dim2clear network for infrared small target detection. IEEE Transactions on Geoscience and Remote Sensing 61, 1-14 (2023)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 415, + 91, + 447, + 100 + ], + "type": "text", + "content": "IRSAM" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 172 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "text", + "content": "49. Zhao, B., Wang, C., Fu, Q., Han, Z.: A novel pattern for infrared small target detection with generative adversarial network. IEEE Transactions on Geoscience and Remote Sensing 59(5), 4481-4492 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "type": "text", + "content": "50. Zhao, X., Ding, W., An, Y., Du, Y., Yu, T., Li, M., Tang, M., Wang, J.: Fast segment anything. arXiv preprint arXiv:2306.12156 (2023)" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "M Zhang and Y Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_content_list.json b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..e3d68148a76245190f09c5af5c349d9a9cd84366 --- /dev/null +++ b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_content_list.json @@ -0,0 +1,1491 @@ +[ + { + "type": "text", + "text": "IVTP: Instruction-guided Visual Token Pruning for Large Vision-Language Models", + "text_level": 1, + "bbox": [ + 228, + 140, + 776, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Kai Huang*, Hao Zou*, Ye Xi, BoChen Wang, Zhen Xie, and Liang Yu", + "bbox": [ + 243, + 212, + 756, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Alibaba Group, China \n{zhouwan.hk, zh372956, yx150449, bochen.wbc, xiezhen.xz, liangyu.yl}@alibaba-inc.com", + "bbox": [ + 282, + 239, + 715, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Inspired by the remarkable achievements of Large Language Models (LLMs), Large Vision-Language Models (LVLMs) have likewise experienced significant advancements. However, the increased computational cost and token budget occupancy associated with lengthy visual tokens pose significant challenge to the practical applications. Considering that not all visual tokens are essential to the final response, selectively pruning redundant visual tokens can effectively alleviate this challenge. In this paper, we present a novel Instruction-guided Visual Token Pruning (IVTP) approach for LVLMs, which is designed to strike a better balance between computational efficiency and the performance. Specifically, a Group-wise Token Pruning (GTP) module based on attention rollout is integrated into the grouped transformer layer to achieve intra-group attention aggregation via residual connection, thereby improving the assessment of visual token importance, especially for LVLMs with a frozen visual encoder. We then extend the module to LLM in order to further filter out visual tokens that are pertinent to the current textual instructions, by introducing a semantically related pseudo CLS token to serve as a reference for token pruning. This two-stage token pruning mechanism permits a systematic and efficient reduction in the quantity of visual tokens while preserving essential visual information. We apply the proposed method to the most representative LVLM, i.e. LLaVA-1.5. Experimental results demonstrate that when the number of visual tokens is reduced by $88.9\\%$ , the computational complexity is decreased by over $46\\%$ , with only an average $1.0\\%$ accuracy drop across 12 benchmarks, and remarkably surpasses the state-of-the-art token pruning methods.", + "bbox": [ + 261, + 321, + 738, + 667 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Visual Token Pruning, Large Vision-Language Models (LVLMs)", + "bbox": [ + 261, + 680, + 764, + 696 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 722, + 375, + 738 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Large Vision-Language Models (LVLMs) have garnered widespread interest from both the academic and industrial communities due to their impressive ability in handling cross-modality tasks [3,20,22,26,41]. Despite the remarkable progress of LVLMs, they still face challenges of high computational costs caused by lengthy", + "bbox": [ + 212, + 753, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Equal contribution.", + "bbox": [ + 218, + 825, + 364, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "image tokens. As a result, considerable works have been devoted to optimizing the trade-off between computational efficiency and model effectiveness in large models. To reduce the number of image tokens fed into Large Language Models (LLMs), some approaches [3,20,22] employ a trainable token compression module placed after the visual encoder, as shown in Fig. 1(a). Though capable of effectively pruning redundant visual tokens, the above methods are often tightly coupled with the model architecture, and the effectiveness of these structures often lacks comprehensive validation, which makes them difficult to transfer to other model frameworks. Building on the advancements in token pruning for traditional visual tasks [4,8,24,31,39], one direct approach is to adapt these existing vision-only pruning methods to LVLMs, where token pruning is performed only in the visual encoder, as shown in Fig. 1(b). Although these methods are transferable, the standard practice of freezing the visual encoder in LVLMs prevents the pruning process from being optimized end-to-end with the training of the LVLMs, consequently suffering from suboptimal stability.", + "bbox": [ + 212, + 146, + 787, + 375 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this work, we propose an Instruction-guided Visual Token Pruning (IVTP) method to address the aforementioned issues, achieving a balance between accuracy and computational efficiency while also offering improved transferability and stability. As illustrated in Fig. 1(c), we divide the visual token pruning into two stages. The first stage is similar to vision-only token pruning, where re", + "bbox": [ + 212, + 387, + 444, + 583 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "dundant visual tokens with low informative content are eliminated in the ViT based on the attention connections within tokens. The second stage occurs within the LLM, it aims to remove visual tokens that exhibit a low correlation with the current textual instructions. Specifically, we determine the significance of each patch token by calculating its attentiveness in relation to the CLS token within the visual encoder. In order to ensure that the importance assessment of visual tokens remains effective within a frozen ViT, a Group-wise Token Pruning (GTP) module based on attention rollout [1] is proposed to integrate into the grouped visual transformer layers to achieve hierarchical attention weight aggregation. However, the continuous decrease in visual tokens results in less visual information being conveyed to the LLM, hindering its ability to follow diverse and variable visual instructions. To adaptively adjust the visual information contained by visual patch tokens according to different instructions, we further integrate the GTP into the LLM for instruction-guided visual token pruning. Since decoder-only LLMs do not incorporate a CLS token to represent text semantics, aggregating all textual tokens indiscriminately may introduce noise information that is not referred to image. The text encoder branch of CLIP [30], aligned with", + "bbox": [ + 212, + 583, + 787, + 843 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/ec66c7f91381c9eded6a97a02d646a702fddecd1ee1956ccc49d4d268610e7ed.jpg", + "image_caption": [ + "Fig.1: Comparison of different token pruning schemes for LVLMs." + ], + "image_footnote": [], + "bbox": [ + 457, + 383, + 784, + 513 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "the visual encoder of LVLMs, is introduced to filter out irrelevant textual tokens by calculating the token-wise relevance with the visual CLS token. Text tokens that match to the visual content are aggregated to form a textual pseudo CLS token so that the GTP module can be extended to LLM.", + "bbox": [ + 212, + 146, + 784, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our main contributions are: (1) We present a novel two-stage visual token pruning method for LVLMs, which can significantly reduce the visual tokens while preserving essential visual information, leading to a substantial increase in model computational efficiency with minimal loss of accuracy. (2) We propose a module that can work compatibly both within the ViT and the LLM, named Group-wise Token Pruning (GTP). Benefiting from the aggregation of attention weights based on attention rollout within groups across layers, the importance assessment of visual tokens is more robust and precise. Furthermore, a textual pseudo CLS gathered from visual relevant textual tokens, is used in GTP to introduce instruction preferences, thereby filtering out semantically irrelevant visual patch tokens and further compressing the number of visual tokens. (3) We introduce the IVTP to LLaVA-1.5 [25], the extensive experimentation on 12 standard benchmarks demonstrate that the proposed method achieves a superior trade-off between accuracy and computational efficiency.", + "bbox": [ + 212, + 207, + 787, + 419 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 443, + 387, + 459 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Large Vision-Language Models. Inspired by the success of LLMs [2, 29, 34], recent advancements in LVLMs have also demonstrated satisfying performance, such as [3, 22, 26, 41]. These approaches typically combine a pre-trained visual encoder with an LLM, enabling the LLM to handle multimodal data involving images. Furthermore, to align the multimodal data, a projection layer is appended after the visual encoder, such as a Q-former, linear mapping, or cross attention. BLIP2 [20] achieves stronger performance at a lower computation cost by freezing the visual encoder and LLM and only updating the weights of Q-former, which serves as the bridge for the modality gap. LLaVA [26] utilizes multimodal language-image instruction-following data generated by GPT-4 [2] for visual instruction tuning. Visual instruction tuning enables the LLaVA to accommodate users' diverse requests for instructions that involve visual content. During the training phase, QWen-VL [3] enhances the performance of model by updating the parameters of the visual encoder and utilizing higher-resolution images. Although increasing the number of model parameters and the resolution of input images can effectively improve the performance of LLMs, the computational cost that they bring cannot be ignored. Our proposed ITVP can be directly integrated into a LVLM without training, reducing the computational cost of the LVLM by pruning redundant image tokens.", + "bbox": [ + 212, + 477, + 787, + 763 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Token Pruning. Token pruning aims to retain attentive tokens and prune inattentive ones by designing importance evaluation strategies to create more efficient transformers in both natural language processing (NLP) and Computer Vision (CV). Benefiting from the success of BERT [7], many works [10, 16, 17, 38] in the NLP field have achieved text token pruning based on BERT, but these", + "bbox": [ + 212, + 765, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 114, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "methods require training and are difficult to adapt to the current LLMs. In the CV field, a classic method is DynamicViT [31], which inserts a trainable prediction module into the transformer to predict the importance score of each token. Subsequent works [8, 39] go further by sampling tokens with an input-dependent number. To address the issue of information loss in token pruning, [18, 24, 37] retain inattentive tokens by collapsing the pruned tokens into one through token reorganization. The above methods perform token pruning based on importance scores, but tokens that are close in the feature space will be assigned similar scores, leading to the possibility that similar tokens may be simultaneously retained or removed. Another classic approach is ToMe [4], which achieves token pruning by calculating the similarity between different tokens and merging tokens with high similarity. However, merging tokens can cause image distortion, making it difficult for the model to capture fine-grained information. Recent approaches [35, 36] attempt to mitigate the shortcomings of both types by combining the two methods, but how to effectively combine them remains an area for exploration. Based on [21], recent studies [12, 15] simultaneously utilize the CLS token of the visual branch and the CLS token of the text branch to implement image token pruning. The aforementioned methods of directly incorporating all textual information to guide the selection of visual tokens may introduce additional noise information, potentially causing instability in token selection. In this paper, we utilize the text branch of the CLIP to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions.", + "bbox": [ + 212, + 146, + 787, + 508 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 532, + 380, + 549 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "This research represents a preliminary effort to investigate the visual token pruning for LVLMs that achieves an optimal balance among performance, speed, cost and numbers of visual tokens. As shown in Fig. 2, our method is fundamentally based on established LVLMs, such as LLaVA-1.5 [25], which are succinctly reviewed in Sec. 3.1. Sec. 3.2 delves into the details of group-wise token pruning that leverages attention rollout to facilitate coarse-grained pruning within visual transformers. In Sec. 3.3, we further demonstrate the visual token pruning in LLMs guided by textual instruction. Finally, details of the two-stage manner applied to the ViT and LLM of LVLMs are presented in Sec. 3.4.", + "bbox": [ + 212, + 563, + 787, + 700 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Revisit of Large Vision-Language Models", + "text_level": 1, + "bbox": [ + 215, + 720, + 602, + 736 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The mechanism of a LLM is complex and involves multiple layers of neural networks. Mathematically, a simplified conceptual representation could be expressed through the following formula:", + "bbox": [ + 212, + 744, + 785, + 792 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\np (\\mathbf {X}) = \\prod_ {i = 1} ^ {M} p \\left(x _ {i} ^ {L} \\mid x _ {1} ^ {V}, \\dots , x _ {F} ^ {V}, x _ {1} ^ {L}, \\dots , x _ {i - 1} ^ {L}; \\Theta\\right), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 338, + 801, + 785, + 844 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/2550924eef1300820adca22d87c0917dd00b4696c63e53c7d393b4b51221e3e9.jpg", + "image_caption": [ + "Fig. 2: Overview of Instruction-guided Visual Token Pruning (IVTP) for large vision-language models. The entire process is divided into two stages: The first stage takes place within the visual encoder of the LVLM, where a Group-wise Token Pruning (GTP) module is employed to discard redundant tokens with low informative content based on the inherent visual CLS token in ViT. The second stage operates on the first $W$ layers of the LLM, in which we aggregate text instructions into a textual CLS token by introducing a frozen CLIP text encoder, and once again integrate GTP to remove visual tokens with low relevance to the current query." + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 558, + 351 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/38adcc0ee3cba2d3bada9936c9cc67c4d13f5e2a52b23999138887e4c8f843a7.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 558, + 143, + 785, + 351 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $p(\\mathbf{X})$ represents the joint probability distribution of the entire sequence, and $x_{i}$ denotes the $i$ th token in the sequence. However, unlike the uniform token type in the standard LLMs, the input to the LLM in LVLMs consists of both visual tokens $x^{V}$ and language tokens $x^{L}$ . It predicts the next language token given the complete set of $F$ visual tokens and the preceding $i - 1$ language tokens. Generally, the visual tokens of an image are derived from the flattened grid features with a visual encoder, which are then mapped into the word embedding space. An image with a resolution of 336px results in 576 tokens when using ViT-L/14 as the visual transformer. Handling such a high number of tokens becomes challenging under the standard LLM's input limit of 2048 tokens. This limitation not only results in increased training and inference time consumption for LVLMs but also restricts the ability to process higher resolution or multiple images within the limited token budget.", + "bbox": [ + 212, + 503, + 787, + 700 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Group-wise Token Pruning", + "text_level": 1, + "bbox": [ + 214, + 723, + 485, + 739 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Similar to vision-only pruning approaches, we aim to evaluate the significance of each patch token by examining their importance scores in LVLMs, which allows us to selectively prune patch tokens with minimal influence. Existing token pruning methods relied on importance scores are typically conducted in an incremental layer-specific manner, in which each layer prunes a certain number of tokens according to its importance scores, cumulatively achieving the overall to", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 114, + 730, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "ken reduction goal. However, assessing token significance solely based on importance score from individual layer introduces a considerable amount of instability. It is essential to retrain the ViT to optimize the aggregation of patch information, while this makes it challenging in LVLMs as the visual encoder is typically kept frozen. To mitigate this, we employ an attention rollout mechanism [1] to derive group-wise token importance metric based on the aggregated attention weights across successive layers, which takes into account the inter-layer transfer of attention information. Compared to the original single-layer attention, the importance scores obtained from the attention with attention rollout exhibit a higher correlation with contributions to the prediction output. In NLP prediction tasks and visual visualization based on the transformer [1,6], the attention derived from attention rollout has been proven to be more stable and effective. Consequently, we intend to incorporate it into visual token pruning to enhance token decision-making for the frozen ViT.", + "bbox": [ + 212, + 146, + 787, + 356 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In the transformer architecture, the attention weight $A$ in the self-attention layer is calculated by the scaled dot product of the queries $\\mathbf{Q} \\in \\mathbb{R}^{(N + 1)\\times d}$ and keys $\\mathbf{K} \\in \\mathbb{R}^{(N + 1)\\times d}$ :", + "bbox": [ + 212, + 357, + 787, + 402 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {A} = \\operatorname {S o f t m a x} \\left(\\mathbf {Q} \\mathbf {K} ^ {T} / \\sqrt {d} + \\mathbf {A} _ {\\text {m a s k}}\\right) \\in \\mathbb {R} ^ {(N + 1) \\times (N + 1)}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 318, + 407, + 784, + 426 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{A}_{\\mathrm{mask}}$ is the attention mask, which is None in the visual encoder and a causal matrix in the LLMs, $N$ is the number of patch tokens and $d$ is the embedding dimension. As previously described, we perform the attention rollout to better model the transfer of attention across layers by considering the residual connections within the network, thereby rendering the attention-based token importance assessment more reliable. Specifically, it adds an identity matrix to the attention matrix and subsequently re-normalizing the weights. To integrate the attention spanning from layer $l_{1}$ to layer $l_{2}$ , a recursive multiplication is applied to the attention weights across all the corresponding range of layers as:", + "bbox": [ + 212, + 434, + 787, + 571 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {\\mathbf {A}} ^ {l} = \\left\\{ \\begin{array}{l l} \\mathbf {A} ^ {l _ {1}}, & \\text {i f} l = l _ {1}, \\\\ \\left(\\mathbf {A} ^ {l} + \\mathbf {I}\\right) \\tilde {\\mathbf {A}} ^ {l - 1}, & \\text {i f} l _ {1} < l \\leq l _ {2}. \\end{array} \\right. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 367, + 575, + 784, + 617 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The re-normalize operation is omitted to simplify the formula. To preserve the exceptional traits of hierarchical token pruning [4, 18, 31], we divide the entire network into groups. Within each group, we perform attention rollout to aggregate attention information from adjacent layers, and execute token pruning at the topmost layer of each group. Similar to [8], the normalized values of patch tokens $\\mathbf{V} \\in \\mathbb{R}^{N \\times d}$ are weighted by their corresponding entries in the CLS row of the attention matrix, taking into account both the positions and the corresponding strength of activation. The final importance score of $i$ th patch $S_{i}$ is derived from the normalization as:", + "bbox": [ + 212, + 622, + 787, + 758 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {S} _ {i} = \\frac {\\tilde {\\mathbf {A}} _ {\\mathrm {c l s} , i} \\times \\| \\mathbf {V} _ {i} \\|}{\\sum_ {j} \\tilde {\\mathbf {A}} _ {\\mathrm {c l s} , j} \\times \\| \\mathbf {V} _ {j} \\|} \\in \\mathbb {R} ^ {1 \\times N}, \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 762, + 784, + 801 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\tilde{\\mathbf{A}}_{\\mathrm{cls}}$ represents the row from the attention weight matrix associated with the CLS token, after excluding the CLS token itself. By ranking the patch tokens", + "bbox": [ + 212, + 808, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "according to their corresponding importance scores, we can selectively discard those low importance patch tokens within each group.", + "bbox": [ + 214, + 146, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Instruction-guided Token Pruning in LLM", + "text_level": 1, + "bbox": [ + 214, + 200, + 609, + 215 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As the number of remaining patch tokens diminishes, the granularity of information preserved by the visual patch tokens also decreases. This reduction is inconsequential for standard visual token pruning methods, which are predominantly applied to classification tasks focused on extracting salient subject information. Moreover, hierarchical pruning provides an opportunity for the CLS token to aggregate information from patch tokens before they are dropped, thereby mitigating potential information loss. LVLMs are tasked with extracting pertinent detailed information from visual patches in response to diverse linguistic instructions. Consequently, the correlation between the residual visual patches and the instructions critically influences the performance in visual question answering.", + "bbox": [ + 212, + 226, + 784, + 376 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "A plausible strategy involves leveraging the instruction to guide the assessment of visual token significance, with the aim of selectively retaining those patch tokens that bear the most relevance to the text. Nonetheless, this approach encounters a significant challenge that the decoder-only LLM does not incorporate a CLS token representative of the semantic information, and aggregating all textual tokens in a crude manner also introduces the interference of noise. Therefore, the text branch of the CLIP is utilized to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions. Specifically, given the text $T$ , we can obtain its corresponding sequence of textual tokens $\\{\\bar{x}_1^L,\\dots ,\\bar{x}_{S'}^L\\}$ after being processed by the pre-trained text encoder of CLIP as:", + "bbox": [ + 212, + 377, + 785, + 556 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\{\\bar {x} _ {1} ^ {L}, \\dots , \\bar {x} _ {S ^ {\\prime}} ^ {L} \\} = \\mathcal {T} (T) \\in \\mathbb {R} ^ {S ^ {\\prime} \\times d}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 569, + 784, + 588 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathcal{T}$ is the text encoder of CLIP and $S^{\\prime}$ denotes the length of textual tokens. Then, the visual relevance of textual tokens can be ascertained by computing the cosine similarity between the sequence of CLIP text tokens and the visual CLS tokens:", + "bbox": [ + 214, + 599, + 782, + 657 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nc _ {i} = \\frac {x _ {\\mathrm {c l s}} ^ {\\mathrm {V}} \\bar {x} _ {i} ^ {L}}{\\| x _ {\\mathrm {c l s}} \\| \\left\\| \\bar {x} _ {i} ^ {L} \\right\\|}, \\text {f o r} i \\in 1, \\dots , S ^ {\\prime}. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 375, + 657, + 784, + 691 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Given that both the CLIP text encoder and general LLMs utilize tokenization derived from Byte Pair Encoding (BPE) [32], we can readily map the visual relevance computed by CLIP to the textual tokens of the LLMs as:", + "bbox": [ + 214, + 696, + 782, + 743 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {C} _ {i} = \\frac {1}{K + 1} \\sum_ {k = j} ^ {j + K} c _ {k}, \\text {w i t h} T _ {\\mathrm {L L M}} (i) \\subseteq \\left\\{T _ {\\mathrm {C L I P}} (j), \\dots , T _ {\\mathrm {C L I P}} (j + K) \\right\\}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 264, + 756, + 784, + 797 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $T_{\\mathrm{LLM}}(i)$ is the $i$ th character string tokenized by LLM, and $T_{\\mathrm{CLIP}}(j)$ is the $j$ th character string tokenized by text encoder of CLIP. Considering that", + "bbox": [ + 214, + 809, + 782, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 114, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "BPE may fragment a single word into multiple subword units, it is possible to encounter the situation where one token in LLMs corresponds to several tokens in the text encoder of CLIP. In such scenario, we take the average relevance of these $K + 1$ tokens as the final mapping relevance. When $K$ is zero, it means that the character string tokenized by the LLMs constitutes a substring within the text encoder of CLIP, and in this case, the current relevance can be used directly. By using the calculated visual relevance and applying average pooling with a predefined truncation threshold, we can pinpoint and extract the key textual tokens from the instructions that are most relevant to the corresponding image:", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {x} _ {\\mathrm {c l s}} ^ {T} = \\left\\{ \\begin{array}{l l} x _ {\\mathrm {c l s}} ^ {V}, & \\text {i f} \\sum \\mathbb {I} _ {\\{\\mathcal {C} \\geq \\tau \\}} = 0, \\\\ \\frac {1}{\\sum \\mathbb {I} _ {\\{c \\geq \\tau \\}}} \\sum_ {i = 1} ^ {S} x _ {i} ^ {L} \\mathbb {I} _ {\\{\\mathcal {C} _ {i} \\geq \\tau \\}}, & \\text {O t h e r w i s e ,} \\end{array} \\right. \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 313, + 301, + 785, + 342 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\hat{x}_{\\mathrm{cls}}^T$ is the textual pseudo CLS token of LLMs, $S$ represents the length of tokens tokenized by LLMs and $\\mathbb{I}(\\cdot)$ is an indicator function. If the relevance scores for the entire sequence of text tokens fall below the predefined threshold $\\tau$ , it indicates that the current instructions do not specify particular visual details. In such scenario, we directly use the visual CLS token as the pseudo CLS token.", + "bbox": [ + 212, + 351, + 784, + 428 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Building upon the methodology in Sec. 3.2, we continue to reuse the GTP module in the LLMs, and consider the attention weights corresponding to the pseudo CLS token as the basis to calculate the importance scores of each visual token. The calculated importance scores are then methodically used to inform the process of token pruning. Given the nature of the causal mask within the LLMs, we position the pseudo CLS token in between the sequence of visual tokens and textual tokens during the attention weights computation. This placement ensures that the pseudo CLS token can assess the entire sequence of visual tokens without being affected by subsequent textual tokens. Note that the role of the pseudo CLS token is confined to assisting in the token pruning process, and it does not serve as an actual token during the model's training and inference.", + "bbox": [ + 212, + 430, + 787, + 595 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Two-stage Token Pruning Manner for LVLMs", + "text_level": 1, + "bbox": [ + 214, + 625, + 638, + 641 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Based on the above discussion, we divide the entire pruning process into two stages. The first stage operates across the entire ViT, where the GTP module is executed within the grouped visual transformer layers to eliminate tokens of low informational content based on the association between patch tokens and the visual CLS token. The second stage focuses on a subset of LLM layers, selectively dropping visual tokens unrelated to the current instruction. This decision is informed by the attention between the remaining visual tokens and the textual pseudo CLS token, which aggregates from selected key tokens of the instructions. By adopting this two-stage process, the proposed method can significantly reduce the number of visual tokens while effectively retaining essential visual information. Detailed information regarding the algorithm can be found in the appendix.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 143, + 375, + 162 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 176, + 428, + 193 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In the following, we describe our experimental setup including datasets and evaluation, implementation details, and specifics of the comparison.", + "bbox": [ + 212, + 202, + 782, + 232 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets and Evaluation. The datasets employed for both training and evaluation in our study strictly conform to the specifications of LLaVA-1.5 [25]. In the pretraining phase, the 558K subset of the LAION-CC-SBU dataset with BLIP [21] captions are utilized. For instruction tuning, a comprehensive dataset with a diverse mix of 665K instruction-based examples are employed. We assess the performance of methods across 12 evaluation benchmarks, with the mean accuracy across these datasets as the principal metric for comparison. The scores of MME dataset [9] are normalized against the theoretical maximum value to facilitate uniformity in the scale of measurement. In the LLaVA-1.5 [25] framework, we primary experiment involved reducing visual tokens from 576 to 64.", + "bbox": [ + 212, + 233, + 784, + 382 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation Details. We perform token pruning every three layers, with the final count of visual tokens determined by the number pruned in each time. To balance model performance and efficiency, we employ all layers of the ViT and the initial 12 layers of the LLM for token pruning. The relevance threshold $\\tau$ is empirically set to 0.2. The model training and inference configurations are strictly aligned with the original settings of LLaVA-1.5 [25] for a fair comparison, and all experiments are conducted on $8\\times \\mathrm{A}100$ GPUs.", + "bbox": [ + 212, + 383, + 784, + 488 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Comparison Details. We primarily compare three categories of token pruning methods. The first includes straightforward token sampling or linear aggregation approaches, such as random sampling, topK based on patch token similarity with the CLS token, subsampling predicated on spatial correlations. The second category encompasses state-of-the-art methods in vision-only tasks, such as EViT [24] and ToMe [4]. The third category features token pruning methods that have recently emerged in LVLMs, including the abstractor structure from Honeybee [5], context attention in LLaMA-ViD [22], and the visual adapter in Qwen-VL [3]. For the sake of brevity, we directly use the model names to represent these structures. To eliminate the influence of factors such as model architecture, data, and training strategies, we reapply the aforementioned methods within the LLaVA-1.5 [25] framework to conduct a fair and thorough comparison. Specific details regarding the application can be found in the appendix.", + "bbox": [ + 212, + 489, + 785, + 685 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Experimental Results", + "text_level": 1, + "bbox": [ + 215, + 709, + 441, + 724 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Main Results. Table 1 and 2 demonstrate the comparison of performance with various methods as the number of visual tokens is reduced from 576 to 64 under the LLaVA-1.5-7B and LLaVA-1.5-13B frameworks [25] respectively. Despite some discrepancies between the replicated results and those reported in the literature across different datasets, the overall average differences are negligible, with the replication showing a slight edge in performance. Consequently, the replicated results is adopted as the baseline for comparison. The tables", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 113, + 730, + 127 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/40fd5c906a3939ccfe3195694f8c0dc2bf02f6922af7fb1b18350054475bc1c8.jpg", + "table_caption": [ + "Table 1: The comparison of the visual token pruning methods with Vicuna-7B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens." + ], + "table_footnote": [], + "table_body": "
Method\\( {\\mathrm{{VQAV}}}^{2} \\) [1]GQA [14]VisWiz [13]\\( {\\mathrm{{SQAI}}}^{3} \\) [28]\\( {\\mathrm{{VQAT}}}^{3} \\) [33]POPE [23]MME [9]MMB [27]MMBCN [27]SEED [19]LLaVAW \\( {}^{2} \\) [26]MM-Vet [40]Avg. \\( \\uparrow \\)TFLOPs \\( \\downarrow \\)
LLaVA-1.5-TB [25]78.562.050.066.858.285.975.564.358.358.663.430.562.715.4
LLaVA-1.5-TB* [25]79.162.749.067.858.686.372.866.259.358.563.731.763.015.4
Random sampling69.057.137.967.248.582.565.655.448.051.055.823.655.1 (-7.9)8.0 (-48.1%)
TopK72.458.147.066.952.583.867.163.355.254.559.226.558.9 (-4.1)8.0 (-48.1%)
Spatial pooling73.959.646.567.752.582.368.563.356.654.959.728.359.5 (-3.5)8.1 (-47.4%)
EViT [24]74.159.447.067.754.782.869.263.557.855.460.027.359.9 (-3.1)8.0 (-48.1%)
ToMe [4]75.160.047.167.555.382.470.463.956.555.260.526.660.0 (-3.0)8.0 (-48.1%)
Honeybee [5]74.859.047.267.850.984.068.761.657.855.259.427.159.5 (-3.5)8.1 (-47.4%)
LLaMA-VID [22]74.359.246.867.951.483.169.763.557.055.458.929.759.7 (-3.3)8.2 (-46.8%)
Qwen-VL [3]74.958.947.368.154.483.469.463.257.455.059.227.259.9 (-3.1)8.1 (-47.4%)
IVTP (Ours)77.860.447.967.858.285.772.666.157.456.462.830.562.0 (-1.0)8.2 (-46.8%)
", + "bbox": [ + 217, + 199, + 784, + 301 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/29218547f52609cacbdb5b79ce668ab01656117f107daac3071756837c791ba0.jpg", + "table_caption": [ + "Table 2: The comparison of the visual token pruning methods with Vicuna-13B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens." + ], + "table_footnote": [], + "table_body": "
MethodVQAV2 [11]GQA [14]VisWiz [13]SQA1[28]VQAT[33]POPE [23]MME [9]MMB [27]MMBCN[27]SEED [19]LLVaW2[26]MM-Vet [40]Avg. ↑TFLOPs ↓
LLvA-1.5-13B [25]80.063.353.671.661.385.976.667.763.661.670.735.465.929.4
LLvA-1.5-13B* [25]80.063.454.570.460.086.478.468.363.160.869.436.866.029.4
Random sampling72.356.746.668.051.583.364.958.054.853.058.824.657.7 (-8.3)15.4 (47.5%)
TopK74.758.550.869.354.285.468.064.559.654.562.826.660.7 (-5.3)15.4 (47.5%)
Spatial pooling75.159.751.169.955.084.871.664.260.254.963.327.461.4 (-4.6)15.6 (46.9%)
EViT [24]77.260.253.470.157.984.673.665.360.155.464.928.662.6 (-3.4)15.4 (47.5%)
ToMe [4]76.961.453.970.157.685.373.165.061.256.065.932.663.3 (-2.7)15.4 (47.5%)
Honeybee [5]76.261.252.170.559.783.673.563.261.255.766.532.063.0 (-3.0)15.4 (47.5%)
LLvA-VID [22]76.561.752.970.457.283.374.464.260.555.266.032.762.9 (-3.1)15.5 (47.3%)
Qwen-VL [3]77.361.152.170.856.484.071.765.861.756.366.731.563.0 (-3.0)15.4 (47.5%)
IVTP (Ours)78.462.354.170.160.085.477.167.763.359.368.635.565.2 (-0.8)15.6 (46.9%)
", + "bbox": [ + 217, + 364, + 784, + 467 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "show that despite reducing visual tokens by approximately $88.9\\%$ , the proposed method incurs an average performance decline of only about $1\\%$ across 12 evaluation datasets, coupled with over $46\\%$ reduction in computational demand. Our method exceeds the performance of other token pruning methods by over $2\\%$ , despite incurring a slightly higher TFLOPs due to hierarchical token pruning in the LLM. Table 3 further illustrates the change in TFLOPs corresponding to an increase in text tokens from 128 to 1024. It is clear that as the number of text tokens reduced, the proportion of visual tokens becomes more significant, thereby intensifying their influence on the computational demands of the model. As a result, the effectiveness of visual token pruning in reducing computational demand becomes more evident.", + "bbox": [ + 212, + 503, + 787, + 669 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Inference-only Results. Since the proposed method does not need any extra modules that require parameter optimization, it can be seamlessly integrated with pre-trained models. This eliminates the need for retraining and simultaneously enhances computational efficiency during inference. Fig. 3 presents a performance comparison of various methods in a pure inference scenario when reducing the number of visual tokens from 16 to 512. As the number of target tokens decreases, the advantages of our proposed method become more pronounced. Notably, when the number of visual tokens is reduced to 16, our method surpasses other approaches by approximately $5\\%$ . The proposed method guided by instruction semantics can more effectively maintain the task relevant visual information, thereby achieving better results.", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/bb90811892570cdf29e2e44e3141c11c14885a1bd11893cf62a099d9ddf87fbc.jpg", + "table_caption": [ + "Table 3: Comparison results of TFLOPs across different methods as text token count varies from 128 to 1024." + ], + "table_footnote": [], + "table_body": "
Methods1282565121024
LLaVA-1.5-7B [25]9.911.715.422.9
TopK2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
ToMe [4]2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
Honeybee [5]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.4 (-32.8%)
Qwen-VL [3]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.3 (-33.2%)
IVTP (Ours)3.0 (-69.7%)4.7 (-59.8%)8.2 (-46.8%)15.5 (-32.3%)
", + "bbox": [ + 217, + 217, + 500, + 305 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/6dc69f5faae39958e47a2f14226119e8942b30b5ce7bd785f181246b18c45db8.jpg", + "image_caption": [ + "Fig. 3: Comparison of model performance with pure inference setting." + ], + "image_footnote": [], + "bbox": [ + 540, + 143, + 774, + 284 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Ablation and Analysis", + "text_level": 1, + "bbox": [ + 215, + 354, + 444, + 369 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To analyze different setups of our IVTP, we perform extensive ablation studies. All the experiments are conducted with LLaVA-1.5-7B [25] as the backbone, and report the average accuracy across the aforementioned 12 evaluation datasets in both retraining mode and pure inference mode (PI).", + "bbox": [ + 212, + 383, + 784, + 445 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Attention Rollout. As outlined in Sec. 3.2, we organize several contiguous layers into a group and apply attention rollout through the residual aggregation of intra-group attention weights. This process is intended to simulate the flow of information through hidden layer features, thereby yielding more reliable and effective attention weights for assessing the significance of visual patch tokens. Table 4 shows that substituting the group-wise attention rollout with a variant that uses only the CLS token's attention weight of current layer results in a performance decrease of $4.5\\%$ in pure inference mode and $3.9\\%$ in retraining mode. When switching from group-wise to layer-wise, the performance is improved, yet there is still a noticeable gap compared to the method using group-wise attention rollout. Although the proposed method requires to prune a greater number of tokens each time compared to layer-wise, it achieves better results with similar TFLOPs. This improvement is due to the more stable and efficient aggregation of attention, where the attention scores can more accurately reflect the contribution of patch tokens. Table 5 delves deeper into the impact of different attention information aggregation strategies. We evaluate several approaches for aggregating attention weights produced by different layers within a group, such as averaging, selecting the maximum, and implementing element-wise multiplication. The finding demonstrates that the residual method employed in our approach yields superior performance, owing to its improved alignment with the forward propagation of visual tokens.", + "bbox": [ + 212, + 446, + 787, + 762 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Instruction Guided Selection. Another fundamental component of the proposed approach is the further selection of visual tokens guided by textual instructions, as elaborated in Sec. 3.3. To validate the effectiveness of this module, we also perform a series of ablation studies, which are presented in Table 6. As shown in the first row of the table, the attention weights of the visual", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 114, + 730, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/326ed9ef3c7326a56cb261824f1a4cb1e9937142b2c581c083ed64a6535129be.jpg", + "table_caption": [ + "Table 4: Ablation study of the weights of attention rollout and vanilla attention. The metrics for comparison with the original LLaVA-1.5-7B are indicated in parentheses." + ], + "table_footnote": [], + "table_body": "
ModelAvg. Acc (PI)Avg. AccTFLOPs
Group-wise55.1 (-7.9)58.1 (-4.9)8.2 (-46.8%)
Layer-wise56.2 (-6.8)59.5 (-3.5)8.2 (-46.8%)
Rollout59.6 (-3.4)62.0 (-1.0)8.2 (-46.8%)
", + "bbox": [ + 238, + 214, + 524, + 292 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/4bf3c27499346f22ac7527b5f1520f26b73a65b6e9ffc1dface2ec3fcbee289a.jpg", + "table_caption": [ + "Table 5: Comparison with different attention weights aggregation strategies." + ], + "table_footnote": [], + "table_body": "
ModelAvg. Acc (PI)Avg. Acc
mean56.1 (-6.9)60.1 (-2.9)
max55.9 (-7.1)60.7 (-2.3)
multiply56.7 (-6.3)60.5 (-2.5)
Residual59.6 (-3.4)62.0 (-1.0)
", + "bbox": [ + 563, + 200, + 769, + 292 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/e38133f7dc2f8a94c0a6c74ca494ab0ad6f339ee5c57902781919f739a9084c7.jpg", + "table_caption": [ + "Table 6: Ablation study of instruction guided selection. 'OTT', 'TE', and 'RT' refer to original textual tokens, CLIP text encoder, and relevance threshold, respectively." + ], + "table_footnote": [], + "table_body": "
OTTTERTAvg.Acc (PI)Avg.ACC
56.7(-6.3)59.2(-3.8)
✓58.3(-4.7)60.2(-2.8)
✓✓57.3(-5.7)59.9(-3.1)
✓✓✓59.6(-3.4)62.0(-1.0)
", + "bbox": [ + 251, + 387, + 493, + 481 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/571ec16db9be27f8ed70eb725c46654aa637b8096feeaac3226ddb39806f9db1.jpg", + "table_caption": [ + "Table 7: ${}^{ + }$ Extending token pruning to LLM with other methods." + ], + "table_footnote": [], + "table_body": "
ModelAvg. Acc (PI)Avg. Acc
TopK54.1 (-8.9)58.9 (-4.1)
TopK+54.9 (-8.1)58.7 (-4.3)
ToMe [4]57.5 (-5.5)60.0 (-3.0)
ToMe+57.7 (-5.3)60.1 (-2.9)
IVTP-V58.5 (-4.5)60.8 (-2.2)
IVTP59.6 (-3.4)62.0 (-1.0)
", + "bbox": [ + 537, + 349, + 751, + 489 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "CLS token are used as the foundation for token selection within the LLM, establishing the baseline for these experiments. We then aggregate the original textual instruction tokens into a pseudo CLS token via average pooling to steer the token selection process. This approach yields a significant improvement over the baseline, demonstrating that guiding the pruning of visual tokens with textual instructions effectively isolates instruction-relevant visual patches through cross-modal associations, thus further reducing the number of required visual tokens. To minimize the influence of irrelevant noise in the textual instructions, we introduced a relevance threshold to selectively extracts key textual tokens. However, due to the lack of associative contrastive training between the visual CLS token and the original textual tokens of LLM, directly calculating vector correlation and applying a threshold for filtration is insufficient for isolating key textual tokens. The last row of the table demonstrates that integrating the CLIP text encoder, which naturally excels in image-text alignment, enables the precise identification of relevant sections within the textual tokens.", + "bbox": [ + 212, + 521, + 787, + 747 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Pruning in LLM. We also extend our two-stage visual token pruning to TopK and ToMe [4], denoted as $\\mathrm{TopK^{+}}$ and $\\mathrm{ToMe^{+}}$ in Table 7, respectively. For a direct comparison, we apply the proposed method solely to the visual encoder, indicated as IVTP-V in the table. It calculation that extending the purely visual methods to LLM does not yield significant improvements. This is because performing token pruning solely within visual patches through representational", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/c2c318d921186fd50b4dbfbcc3ede030e44c4ad9672bac5abfa75df78c04905a.jpg", + "table_caption": [ + "Table 8: Comparison with the numbers of layers in token pruning groups." + ], + "table_footnote": [], + "table_body": "
LayersAvg.Acc (PI)Avg.Acc
ALL56.7(-6.3)58.2(-4.8)
258.8(-4.2)60.1(-2.9)
359.6(-3.4)62.0(-1.0)
459.1(-3.9)61.5(-1.5)
658.6(-4.4)59.9(-3.1)
", + "bbox": [ + 245, + 191, + 444, + 290 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/12aae31b954923419e36bc2ec40770eae1c96a56a5f089ba072ca4d952e3ab41.jpg", + "table_caption": [ + "Table 9: Computational complexity with different methods (TFLOPs)." + ], + "table_footnote": [], + "table_body": "
MethodsViTLLMextraTotal
LLaVA-1.5-7B [25]0.36115.003-15.364
TopK0.1907.772-7.962
ToMe [4]0.1907.772-7.962
Qwen-VL [3]0.3607.7720.0038.135
IVTP (our)0.2027.9460.0808.228
", + "bbox": [ + 232, + 329, + 457, + 422 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/81d9bb336254f5cd5cddab7aedd2fa674914e7a53dca0fdfd5b7db05029b9b29.jpg", + "image_caption": [ + "Fig. 4: Performance comparison with token pruning scaling. We show the average accuracy over all 12 benchmarks with the target number of visual tokens varying from 16 to 512 under comparable TFLOPs." + ], + "image_footnote": [], + "bbox": [ + 493, + 156, + 785, + 328 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "similarity fails to address the scenario with sparse target tokens. Rather than applying the token pruning from the visual encoder to the LLM directly, we select relevant visual tokens based on the diverse instructions.", + "bbox": [ + 212, + 455, + 784, + 500 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Scaling the Token Pruning. Figure 4 illustrates the trade-off between TFLOPs and average accuracy by adjusting the final count of visual tokens from 576 down to a range between 16 and 512. The trend shown in the figure indicates that when the final number of visual tokens is reduced to between 256 and 512, the performance of most methods are nearly identical to those of the original model. The proposed method even slightly exceeds the original model while achieving a $10\\%$ to $30\\%$ reduction in TFLOPs. This suggests that reducing the number of visual tokens to an optimal level can not only preserve essential visual information but also minimizes interference from irrelevant visual tokens. As the number of visual tokens is further reduced, relying solely on the relevance and uniqueness of patch tokens becomes inadequate for preserving visual information. To overcome this limitation, the proposed method introduces an instruction-guided mechanism that adaptively selects visual tokens highly relevant to the specific given prompt, thereby completing VQA tasks with fewer visual tokens.", + "bbox": [ + 212, + 503, + 787, + 715 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Group Layers. We vary the number of layers in each token pruning group, with a specific focus on the scenario in which all layers of the ViT and all the first 12 layers of the LLM are employed. Table 8 shows the optimal performance is achieved with each group consists of three layers. Groups comprising fewer layers yield less effective attention rollout aggregation, whereas groups with more layers require pruning more tokens, hindering the layer-wise interaction within tokens.", + "bbox": [ + 212, + 715, + 787, + 808 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Computational complexity. Table 9 shows the comparison of computational complexity among different models. We itemize the computational costs of the", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 114, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/95a95625d696e98f649cbc465ee57c8fe780f18c7f8ca7001273365b7a222e6a.jpg", + "image_caption": [ + "Fig. 5: Visualization of the visual token pruning results. Each sample, viewed from left to right, consists of the raw image, the token pruning by the TopK, and the token pruning by the proposed method, respectively." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 785, + 308 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "visual encoder, LLM and extra structures separately to provide a detailed breakdown. It is clear that the LLM contributes the most to the overall computational complexity of the LVLM, due to its significantly higher number of parameters compared to the ViT and other supplementary structures. Consequently, the disparities in TFLOPs observed with purely visual methods are not discernible when these methods are incorporated into the LVLMs. Although our method inputs more visual tokens into the LLM compared to other pruning methods, by limiting pruning to the initial 12 layers of the LLM, we manage to keep the computational complexity within $2\\%$ of that achieved by single-stage approaches. Visualizations. We further visualize the results of token pruning for a more intuitive understanding in Fig. 5. key textual tokens are highlighted in the instruction text and discarded visual tokens are masked in the input image. Our observations indicate that the proposed method excels at precisely identifying essential textual tokens related to visual content and adeptly preserving the most relevant visual tokens aligned with the semantics of diverse instructions.", + "bbox": [ + 212, + 388, + 787, + 617 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 638, + 359, + 656 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This paper presents a visual token pruning technique for Large Vision-Language Models (LVLMs). It introduces a group-wise token pruning (GTP) module aimed at improving the stability and robustness of patch token importance assessment within a frozen visual encoder of LVLMs. The proposed method extends the designed GTP module to LLM with incorporating instruction semantics as guidance, thereby discarding irrelevant visual tokens based on instructional preferences. Comprehensive experiments and in-depth ablation studies show that the proposed method can prune more visual tokens with minimal loss of accuracy, as well as accelerate the training and inference of LVLMs. The reduction of visual tokens can also be transferred to multi-image or video tasks in LVLMs to boost their performance, which will be a key focus of our future work.", + "bbox": [ + 212, + 671, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Abnar, S., Zuidema, W.: Quantifying attention flow in transformers. arXiv preprint arXiv:2005.00928 (2020) 2, 6", + "2. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023) 3", + "3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A frontier large vision-language model with versatile abilities. arXiv preprint arXiv:2308.12966 (2023) 1, 2, 3, 9, 10, 11, 13", + "4. Bolya, D., Fu, C.Y., Dai, X., Zhang, P., Feichtenhofer, C., Hoffman, J.: Token merging: Your vit but faster. In: The Eleventh International Conference on Learning Representations (2022) 2, 4, 6, 9, 10, 11, 12, 13", + "5. Cha, J., Kang, W., Mun, J., Roh, B.: Honeybee: Locality-enhanced projector for multimodal llm. arXiv preprint arXiv:2312.06742 (2023) 9, 10, 11", + "6. Chefer, H., Gur, S., Wolf, L.: Transformer interpretability beyond attention visualization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 782-791 (2021) 6", + "7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 3", + "8. Fayyaz, M., Koohpayegani, S.A., Jafari, F.R., Sengupta, S., Joze, H.R.V., Sommerlade, E., Pirsiavash, H., Gall, J.: Adaptive token sampling for efficient vision transformers. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 396-414. Springer (2022) 2, 4, 6", + "9. Fu, C., Chen, P., Shen, Y., Qin, Y., Zhang, M., Lin, X., Yang, J., Zheng, X., Li, K., Sun, X., et al.: Mme: A comprehensive evaluation benchmark for multimodal large language models. arXiv preprint arXiv:2306.13394 (2023) 9, 10", + "10. Goyal, S., Choudhury, A.R., Raje, S., Chakaravarthy, V., Sabharwal, Y., Verma, A.: Power-bert: Accelerating bert inference via progressive word-vector elimination. In: International Conference on Machine Learning. pp. 3690-3699. PMLR (2020) 3", + "11. Goyal, Y., Khot, T., Summers-Stay, D., Batra, D., Parikh, D.: Making the v in vqa matter: Elevating the role of image understanding in visual question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6904-6913 (2017) 10", + "12. Guo, Y., Zhang, H., Nie, L., Wong, Y., Kankanhalli, M.: Elip: Efficient language-image pre-training with fewer vision tokens. arXiv preprint arXiv:2309.16738 (2023) 4", + "13. Gurari, D., Li, Q., Stangl, A.J., Guo, A., Lin, C., Grauman, K., Luo, J., Bigham, J.P.: Vizwiz grand challenge: Answering visual questions from blind people. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3608-3617 (2018) 10", + "14. Hudson, D.A., Manning, C.D.: Gqa: A new dataset for real-world visual reasoning and compositional question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6700-6709 (2019) 10", + "15. Jiang, C., Xu, H., Ye, W., Ye, Q., Li, C., Yan, M., Bi, B., Zhang, S., Huang, F., Huang, S.: Bus: Efficient and effective vision-language pre-training with bottom-up patch summarization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2900-2910 (2023) 4" + ], + "bbox": [ + 217, + 175, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "16. Kim, G., Cho, K.: Length-adaptive transformer: Train once with length drop, use anytime with search. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing. pp. 6501-6511 (2021) 3", + "17. Kim, S., Shen, S., Thorsley, D., Gholami, A., Kwon, W., Hassoun, J., Keutzer, K.: Learned token pruning for transformers. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 784-794 (2022) 3", + "18. Kong, Z., Dong, P., Ma, X., Meng, X., Niu, W., Sun, M., Shen, X., Yuan, G., Ren, B., Tang, H., et al.: Spvit: Enabling faster vision transformers via latency-aware soft token pruning. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 620-640. Springer (2022) 4, 6", + "19. Li, B., Wang, R., Wang, G., Ge, Y., Ge, Y., Shan, Y.: Seed-bench: Benchmarking multimodal llms with generative comprehension. arXiv preprint arXiv:2307.16125 (2023) 10", + "20. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023) 1, 2, 3", + "21. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022) 4, 9", + "22. Li, Y., Wang, C., Jia, J.: Llama-vid: An image is worth 2 tokens in large language models. arXiv preprint arXiv:2311.17043 (2023) 1, 2, 3, 9, 10", + "23. Li, Y., Du, Y., Zhou, K., Wang, J., Zhao, W.X., Wen, J.R.: Evaluating object hallucination in large vision-language models. arXiv preprint arXiv:2305.10355 (2023) 10", + "24. Liang, Y., Chongjian, G., Tong, Z., Song, Y., Wang, J., Xie, P.: Evit: Expediting vision transformers via token reorganizations. In: International Conference on Learning Representations (2021) 2, 4, 9, 10", + "25. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. arXiv preprint arXiv:2310.03744 (2023) 3, 4, 9, 10, 11, 13", + "26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024) 1, 3, 10", + "27. Liu, Y., Duan, H., Zhang, Y., Li, B., Zhang, S., Zhao, W., Yuan, Y., Wang, J., He, C., Liu, Z., et al.: Mmbench: Is your multi-modal model an all-around player? arXiv preprint arXiv:2307.06281 (2023) 10", + "28. Lu, P., Mishra, S., Xia, T., Qiu, L., Chang, K.W., Zhu, S.C., Tafjord, O., Clark, P., Kalyan, A.: Learn to explain: Multimodal reasoning via thought chains for science question answering. Advances in Neural Information Processing Systems 35, 2507-2521 (2022) 10", + "29. OpenAI: Chatgpt. https://openai.com/blog/chatgpt/, 2023. 1, 2 (2023) 3", + "30. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 2", + "31. Rao, Y., Zhao, W., Liu, B., Lu, J., Zhou, J., Hsieh, C.J.: Dynamicvit: Efficient vision transformers with dynamic token sparsification. Advances in neural information processing systems 34, 13937-13949 (2021) 2, 4, 6", + "32. Sennrich, R., Haddow, B., Birch, A.: Neural machine translation of rare words with subword units. arXiv preprint arXiv:1508.07909 (2015) 7" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "K. Huang et al.", + "bbox": [ + 271, + 114, + 377, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "33. Singh, A., Natarajan, V., Shah, M., Jiang, Y., Chen, X., Batra, D., Parikh, D., Rohrbach, M.: Towards vqa models that can read. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8317-8326 (2019) 10", + "34. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al.: Llama: Open and efficient foundation language models. arXiv preprint arXiv:2302.13971 (2023) 3", + "35. Wei, S., Ye, T., Zhang, S., Tang, Y., Liang, J.: Joint token pruning and squeezing towards more aggressive compression of vision transformers. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2092-2101 (2023) 4", + "36. Wu, X., Zeng, F., Wang, X., Wang, Y., Chen, X.: Ppt: Token pruning and pooling for efficient vision transformers. arXiv preprint arXiv:2310.01812 (2023) 4", + "37. Xu, Y., Zhang, Z., Zhang, M., Sheng, K., Li, K., Dong, W., Zhang, L., Xu, C., Sun, X.: Evo-vit: Slow-fast token evolution for dynamic vision transformer. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 2964-2972 (2022) 4", + "38. Ye, D., Lin, Y., Huang, Y., Sun, M.: Tr-bert: Dynamic token reduction for accelerating bert inference. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5798-5809 (2021) 3", + "39. Yin, H., Vahdat, A., Alvarez, J.M., Mallya, A., Kautz, J., Molchanov, P.: A-vit: Adaptive tokens for efficient vision transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10809-10818 (2022) 2, 4", + "40. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023) 10", + "41. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023) 1, 3" + ], + "bbox": [ + 212, + 146, + 787, + 575 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IVTP", + "bbox": [ + 689, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_model.json b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_model.json new file mode 100644 index 0000000000000000000000000000000000000000..f2a717b7b86b828263822b9e7b6756f41d489c54 --- /dev/null +++ b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_model.json @@ -0,0 +1,1994 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.229, + 0.141, + 0.777, + 0.187 + ], + "angle": 0, + "content": "IVTP: Instruction-guided Visual Token Pruning for Large Vision-Language Models" + }, + { + "type": "text", + "bbox": [ + 0.245, + 0.213, + 0.758, + 0.229 + ], + "angle": 0, + "content": "Kai Huang*, Hao Zou*, Ye Xi, BoChen Wang, Zhen Xie, and Liang Yu" + }, + { + "type": "text", + "bbox": [ + 0.283, + 0.241, + 0.717, + 0.283 + ], + "angle": 0, + "content": "Alibaba Group, China \n{zhouwan.hk, zh372956, yx150449, bochen.wbc, xiezhen.xz, liangyu.yl}@alibaba-inc.com" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.322, + 0.74, + 0.668 + ], + "angle": 0, + "content": "Abstract. Inspired by the remarkable achievements of Large Language Models (LLMs), Large Vision-Language Models (LVLMs) have likewise experienced significant advancements. However, the increased computational cost and token budget occupancy associated with lengthy visual tokens pose significant challenge to the practical applications. Considering that not all visual tokens are essential to the final response, selectively pruning redundant visual tokens can effectively alleviate this challenge. In this paper, we present a novel Instruction-guided Visual Token Pruning (IVTP) approach for LVLMs, which is designed to strike a better balance between computational efficiency and the performance. Specifically, a Group-wise Token Pruning (GTP) module based on attention rollout is integrated into the grouped transformer layer to achieve intra-group attention aggregation via residual connection, thereby improving the assessment of visual token importance, especially for LVLMs with a frozen visual encoder. We then extend the module to LLM in order to further filter out visual tokens that are pertinent to the current textual instructions, by introducing a semantically related pseudo CLS token to serve as a reference for token pruning. This two-stage token pruning mechanism permits a systematic and efficient reduction in the quantity of visual tokens while preserving essential visual information. We apply the proposed method to the most representative LVLM, i.e. LLaVA-1.5. Experimental results demonstrate that when the number of visual tokens is reduced by \\(88.9\\%\\), the computational complexity is decreased by over \\(46\\%\\), with only an average \\(1.0\\%\\) accuracy drop across 12 benchmarks, and remarkably surpasses the state-of-the-art token pruning methods." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.681, + 0.766, + 0.697 + ], + "angle": 0, + "content": "Keywords: Visual Token Pruning, Large Vision-Language Models (LVLMs)" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.723, + 0.377, + 0.739 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Large Vision-Language Models (LVLMs) have garnered widespread interest from both the academic and industrial communities due to their impressive ability in handling cross-modality tasks [3,20,22,26,41]. Despite the remarkable progress of LVLMs, they still face challenges of high computational costs caused by lengthy" + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.826, + 0.365, + 0.84 + ], + "angle": 0, + "content": "* Equal contribution." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.375 + ], + "angle": 0, + "content": "image tokens. As a result, considerable works have been devoted to optimizing the trade-off between computational efficiency and model effectiveness in large models. To reduce the number of image tokens fed into Large Language Models (LLMs), some approaches [3,20,22] employ a trainable token compression module placed after the visual encoder, as shown in Fig. 1(a). Though capable of effectively pruning redundant visual tokens, the above methods are often tightly coupled with the model architecture, and the effectiveness of these structures often lacks comprehensive validation, which makes them difficult to transfer to other model frameworks. Building on the advancements in token pruning for traditional visual tasks [4,8,24,31,39], one direct approach is to adapt these existing vision-only pruning methods to LVLMs, where token pruning is performed only in the visual encoder, as shown in Fig. 1(b). Although these methods are transferable, the standard practice of freezing the visual encoder in LVLMs prevents the pruning process from being optimized end-to-end with the training of the LVLMs, consequently suffering from suboptimal stability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.388, + 0.446, + 0.584 + ], + "angle": 0, + "content": "In this work, we propose an Instruction-guided Visual Token Pruning (IVTP) method to address the aforementioned issues, achieving a balance between accuracy and computational efficiency while also offering improved transferability and stability. As illustrated in Fig. 1(c), we divide the visual token pruning into two stages. The first stage is similar to vision-only token pruning, where re" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.788, + 0.844 + ], + "angle": 0, + "content": "dundant visual tokens with low informative content are eliminated in the ViT based on the attention connections within tokens. The second stage occurs within the LLM, it aims to remove visual tokens that exhibit a low correlation with the current textual instructions. Specifically, we determine the significance of each patch token by calculating its attentiveness in relation to the CLS token within the visual encoder. In order to ensure that the importance assessment of visual tokens remains effective within a frozen ViT, a Group-wise Token Pruning (GTP) module based on attention rollout [1] is proposed to integrate into the grouped visual transformer layers to achieve hierarchical attention weight aggregation. However, the continuous decrease in visual tokens results in less visual information being conveyed to the LLM, hindering its ability to follow diverse and variable visual instructions. To adaptively adjust the visual information contained by visual patch tokens according to different instructions, we further integrate the GTP into the LLM for instruction-guided visual token pruning. Since decoder-only LLMs do not incorporate a CLS token to represent text semantics, aggregating all textual tokens indiscriminately may introduce noise information that is not referred to image. The text encoder branch of CLIP [30], aligned with" + }, + { + "type": "image", + "bbox": [ + 0.459, + 0.385, + 0.785, + 0.515 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.456, + 0.528, + 0.788, + 0.556 + ], + "angle": 0, + "content": "Fig.1: Comparison of different token pruning schemes for LVLMs." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.785, + 0.207 + ], + "angle": 0, + "content": "the visual encoder of LVLMs, is introduced to filter out irrelevant textual tokens by calculating the token-wise relevance with the visual CLS token. Text tokens that match to the visual content are aggregated to form a textual pseudo CLS token so that the GTP module can be extended to LLM." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.788, + 0.42 + ], + "angle": 0, + "content": "Our main contributions are: (1) We present a novel two-stage visual token pruning method for LVLMs, which can significantly reduce the visual tokens while preserving essential visual information, leading to a substantial increase in model computational efficiency with minimal loss of accuracy. (2) We propose a module that can work compatibly both within the ViT and the LLM, named Group-wise Token Pruning (GTP). Benefiting from the aggregation of attention weights based on attention rollout within groups across layers, the importance assessment of visual tokens is more robust and precise. Furthermore, a textual pseudo CLS gathered from visual relevant textual tokens, is used in GTP to introduce instruction preferences, thereby filtering out semantically irrelevant visual patch tokens and further compressing the number of visual tokens. (3) We introduce the IVTP to LLaVA-1.5 [25], the extensive experimentation on 12 standard benchmarks demonstrate that the proposed method achieves a superior trade-off between accuracy and computational efficiency." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.444, + 0.388, + 0.46 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.788, + 0.765 + ], + "angle": 0, + "content": "Large Vision-Language Models. Inspired by the success of LLMs [2, 29, 34], recent advancements in LVLMs have also demonstrated satisfying performance, such as [3, 22, 26, 41]. These approaches typically combine a pre-trained visual encoder with an LLM, enabling the LLM to handle multimodal data involving images. Furthermore, to align the multimodal data, a projection layer is appended after the visual encoder, such as a Q-former, linear mapping, or cross attention. BLIP2 [20] achieves stronger performance at a lower computation cost by freezing the visual encoder and LLM and only updating the weights of Q-former, which serves as the bridge for the modality gap. LLaVA [26] utilizes multimodal language-image instruction-following data generated by GPT-4 [2] for visual instruction tuning. Visual instruction tuning enables the LLaVA to accommodate users' diverse requests for instructions that involve visual content. During the training phase, QWen-VL [3] enhances the performance of model by updating the parameters of the visual encoder and utilizing higher-resolution images. Although increasing the number of model parameters and the resolution of input images can effectively improve the performance of LLMs, the computational cost that they bring cannot be ignored. Our proposed ITVP can be directly integrated into a LVLM without training, reducing the computational cost of the LVLM by pruning redundant image tokens." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Token Pruning. Token pruning aims to retain attentive tokens and prune inattentive ones by designing importance evaluation strategies to create more efficient transformers in both natural language processing (NLP) and Computer Vision (CV). Benefiting from the success of BERT [7], many works [10, 16, 17, 38] in the NLP field have achieved text token pruning based on BERT, but these" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.509 + ], + "angle": 0, + "content": "methods require training and are difficult to adapt to the current LLMs. In the CV field, a classic method is DynamicViT [31], which inserts a trainable prediction module into the transformer to predict the importance score of each token. Subsequent works [8, 39] go further by sampling tokens with an input-dependent number. To address the issue of information loss in token pruning, [18, 24, 37] retain inattentive tokens by collapsing the pruned tokens into one through token reorganization. The above methods perform token pruning based on importance scores, but tokens that are close in the feature space will be assigned similar scores, leading to the possibility that similar tokens may be simultaneously retained or removed. Another classic approach is ToMe [4], which achieves token pruning by calculating the similarity between different tokens and merging tokens with high similarity. However, merging tokens can cause image distortion, making it difficult for the model to capture fine-grained information. Recent approaches [35, 36] attempt to mitigate the shortcomings of both types by combining the two methods, but how to effectively combine them remains an area for exploration. Based on [21], recent studies [12, 15] simultaneously utilize the CLS token of the visual branch and the CLS token of the text branch to implement image token pruning. The aforementioned methods of directly incorporating all textual information to guide the selection of visual tokens may introduce additional noise information, potentially causing instability in token selection. In this paper, we utilize the text branch of the CLIP to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.533, + 0.381, + 0.55 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.564, + 0.788, + 0.701 + ], + "angle": 0, + "content": "This research represents a preliminary effort to investigate the visual token pruning for LVLMs that achieves an optimal balance among performance, speed, cost and numbers of visual tokens. As shown in Fig. 2, our method is fundamentally based on established LVLMs, such as LLaVA-1.5 [25], which are succinctly reviewed in Sec. 3.1. Sec. 3.2 delves into the details of group-wise token pruning that leverages attention rollout to facilitate coarse-grained pruning within visual transformers. In Sec. 3.3, we further demonstrate the visual token pruning in LLMs guided by textual instruction. Finally, details of the two-stage manner applied to the ViT and LLM of LVLMs are presented in Sec. 3.4." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.722, + 0.604, + 0.737 + ], + "angle": 0, + "content": "3.1 Revisit of Large Vision-Language Models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.746, + 0.787, + 0.793 + ], + "angle": 0, + "content": "The mechanism of a LLM is complex and involves multiple layers of neural networks. Mathematically, a simplified conceptual representation could be expressed through the following formula:" + }, + { + "type": "equation", + "bbox": [ + 0.339, + 0.803, + 0.787, + 0.845 + ], + "angle": 0, + "content": "\\[\np (\\mathbf {X}) = \\prod_ {i = 1} ^ {M} p \\left(x _ {i} ^ {L} \\mid x _ {1} ^ {V}, \\dots , x _ {F} ^ {V}, x _ {1} ^ {L}, \\dots , x _ {i - 1} ^ {L}; \\Theta\\right), \\tag {1}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.145, + 0.56, + 0.352 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.145, + 0.787, + 0.352 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.362, + 0.788, + 0.473 + ], + "angle": 0, + "content": "Fig. 2: Overview of Instruction-guided Visual Token Pruning (IVTP) for large vision-language models. The entire process is divided into two stages: The first stage takes place within the visual encoder of the LVLM, where a Group-wise Token Pruning (GTP) module is employed to discard redundant tokens with low informative content based on the inherent visual CLS token in ViT. The second stage operates on the first \\( W \\) layers of the LLM, in which we aggregate text instructions into a textual CLS token by introducing a frozen CLIP text encoder, and once again integrate GTP to remove visual tokens with low relevance to the current query." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.504, + 0.789, + 0.701 + ], + "angle": 0, + "content": "where \\( p(\\mathbf{X}) \\) represents the joint probability distribution of the entire sequence, and \\( x_{i} \\) denotes the \\( i \\)th token in the sequence. However, unlike the uniform token type in the standard LLMs, the input to the LLM in LVLMs consists of both visual tokens \\( x^{V} \\) and language tokens \\( x^{L} \\). It predicts the next language token given the complete set of \\( F \\) visual tokens and the preceding \\( i - 1 \\) language tokens. Generally, the visual tokens of an image are derived from the flattened grid features with a visual encoder, which are then mapped into the word embedding space. An image with a resolution of 336px results in 576 tokens when using ViT-L/14 as the visual transformer. Handling such a high number of tokens becomes challenging under the standard LLM's input limit of 2048 tokens. This limitation not only results in increased training and inference time consumption for LVLMs but also restricts the ability to process higher resolution or multiple images within the limited token budget." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.724, + 0.486, + 0.74 + ], + "angle": 0, + "content": "3.2 Group-wise Token Pruning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Similar to vision-only pruning approaches, we aim to evaluate the significance of each patch token by examining their importance scores in LVLMs, which allows us to selectively prune patch tokens with minimal influence. Existing token pruning methods relied on importance scores are typically conducted in an incremental layer-specific manner, in which each layer prunes a certain number of tokens according to its importance scores, cumulatively achieving the overall to" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.357 + ], + "angle": 0, + "content": "ken reduction goal. However, assessing token significance solely based on importance score from individual layer introduces a considerable amount of instability. It is essential to retrain the ViT to optimize the aggregation of patch information, while this makes it challenging in LVLMs as the visual encoder is typically kept frozen. To mitigate this, we employ an attention rollout mechanism [1] to derive group-wise token importance metric based on the aggregated attention weights across successive layers, which takes into account the inter-layer transfer of attention information. Compared to the original single-layer attention, the importance scores obtained from the attention with attention rollout exhibit a higher correlation with contributions to the prediction output. In NLP prediction tasks and visual visualization based on the transformer [1,6], the attention derived from attention rollout has been proven to be more stable and effective. Consequently, we intend to incorporate it into visual token pruning to enhance token decision-making for the frozen ViT." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.358, + 0.788, + 0.403 + ], + "angle": 0, + "content": "In the transformer architecture, the attention weight \\( A \\) in the self-attention layer is calculated by the scaled dot product of the queries \\( \\mathbf{Q} \\in \\mathbb{R}^{(N + 1)\\times d} \\) and keys \\( \\mathbf{K} \\in \\mathbb{R}^{(N + 1)\\times d} \\):" + }, + { + "type": "equation", + "bbox": [ + 0.32, + 0.409, + 0.785, + 0.428 + ], + "angle": 0, + "content": "\\[\n\\mathbf {A} = \\operatorname {S o f t m a x} \\left(\\mathbf {Q} \\mathbf {K} ^ {T} / \\sqrt {d} + \\mathbf {A} _ {\\text {m a s k}}\\right) \\in \\mathbb {R} ^ {(N + 1) \\times (N + 1)}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.435, + 0.788, + 0.572 + ], + "angle": 0, + "content": "where \\(\\mathbf{A}_{\\mathrm{mask}}\\) is the attention mask, which is None in the visual encoder and a causal matrix in the LLMs, \\(N\\) is the number of patch tokens and \\(d\\) is the embedding dimension. As previously described, we perform the attention rollout to better model the transfer of attention across layers by considering the residual connections within the network, thereby rendering the attention-based token importance assessment more reliable. Specifically, it adds an identity matrix to the attention matrix and subsequently re-normalizing the weights. To integrate the attention spanning from layer \\(l_{1}\\) to layer \\(l_{2}\\), a recursive multiplication is applied to the attention weights across all the corresponding range of layers as:" + }, + { + "type": "equation", + "bbox": [ + 0.368, + 0.577, + 0.785, + 0.618 + ], + "angle": 0, + "content": "\\[\n\\tilde {\\mathbf {A}} ^ {l} = \\left\\{ \\begin{array}{l l} \\mathbf {A} ^ {l _ {1}}, & \\text {i f} l = l _ {1}, \\\\ \\left(\\mathbf {A} ^ {l} + \\mathbf {I}\\right) \\tilde {\\mathbf {A}} ^ {l - 1}, & \\text {i f} l _ {1} < l \\leq l _ {2}. \\end{array} \\right. \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.623, + 0.788, + 0.759 + ], + "angle": 0, + "content": "The re-normalize operation is omitted to simplify the formula. To preserve the exceptional traits of hierarchical token pruning [4, 18, 31], we divide the entire network into groups. Within each group, we perform attention rollout to aggregate attention information from adjacent layers, and execute token pruning at the topmost layer of each group. Similar to [8], the normalized values of patch tokens \\(\\mathbf{V} \\in \\mathbb{R}^{N \\times d}\\) are weighted by their corresponding entries in the CLS row of the attention matrix, taking into account both the positions and the corresponding strength of activation. The final importance score of \\(i\\)th patch \\(S_{i}\\) is derived from the normalization as:" + }, + { + "type": "equation", + "bbox": [ + 0.384, + 0.763, + 0.785, + 0.802 + ], + "angle": 0, + "content": "\\[\n\\mathcal {S} _ {i} = \\frac {\\tilde {\\mathbf {A}} _ {\\mathrm {c l s} , i} \\times \\| \\mathbf {V} _ {i} \\|}{\\sum_ {j} \\tilde {\\mathbf {A}} _ {\\mathrm {c l s} , j} \\times \\| \\mathbf {V} _ {j} \\|} \\in \\mathbb {R} ^ {1 \\times N}, \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.809, + 0.788, + 0.842 + ], + "angle": 0, + "content": "where \\(\\tilde{\\mathbf{A}}_{\\mathrm{cls}}\\) represents the row from the attention weight matrix associated with the CLS token, after excluding the CLS token itself. By ranking the patch tokens" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "according to their corresponding importance scores, we can selectively discard those low importance patch tokens within each group." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.201, + 0.611, + 0.216 + ], + "angle": 0, + "content": "3.3 Instruction-guided Token Pruning in LLM" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.227, + 0.785, + 0.377 + ], + "angle": 0, + "content": "As the number of remaining patch tokens diminishes, the granularity of information preserved by the visual patch tokens also decreases. This reduction is inconsequential for standard visual token pruning methods, which are predominantly applied to classification tasks focused on extracting salient subject information. Moreover, hierarchical pruning provides an opportunity for the CLS token to aggregate information from patch tokens before they are dropped, thereby mitigating potential information loss. LVLMs are tasked with extracting pertinent detailed information from visual patches in response to diverse linguistic instructions. Consequently, the correlation between the residual visual patches and the instructions critically influences the performance in visual question answering." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.378, + 0.787, + 0.558 + ], + "angle": 0, + "content": "A plausible strategy involves leveraging the instruction to guide the assessment of visual token significance, with the aim of selectively retaining those patch tokens that bear the most relevance to the text. Nonetheless, this approach encounters a significant challenge that the decoder-only LLM does not incorporate a CLS token representative of the semantic information, and aggregating all textual tokens in a crude manner also introduces the interference of noise. Therefore, the text branch of the CLIP is utilized to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions. Specifically, given the text \\( T \\), we can obtain its corresponding sequence of textual tokens \\( \\{\\bar{x}_1^L,\\dots ,\\bar{x}_{S'}^L\\} \\) after being processed by the pre-trained text encoder of CLIP as:" + }, + { + "type": "equation", + "bbox": [ + 0.391, + 0.57, + 0.785, + 0.589 + ], + "angle": 0, + "content": "\\[\n\\{\\bar {x} _ {1} ^ {L}, \\dots , \\bar {x} _ {S ^ {\\prime}} ^ {L} \\} = \\mathcal {T} (T) \\in \\mathbb {R} ^ {S ^ {\\prime} \\times d}, \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.6, + 0.784, + 0.658 + ], + "angle": 0, + "content": "where \\(\\mathcal{T}\\) is the text encoder of CLIP and \\(S^{\\prime}\\) denotes the length of textual tokens. Then, the visual relevance of textual tokens can be ascertained by computing the cosine similarity between the sequence of CLIP text tokens and the visual CLS tokens:" + }, + { + "type": "equation", + "bbox": [ + 0.377, + 0.658, + 0.785, + 0.693 + ], + "angle": 0, + "content": "\\[\nc _ {i} = \\frac {x _ {\\mathrm {c l s}} ^ {\\mathrm {V}} \\bar {x} _ {i} ^ {L}}{\\| x _ {\\mathrm {c l s}} \\| \\left\\| \\bar {x} _ {i} ^ {L} \\right\\|}, \\text {f o r} i \\in 1, \\dots , S ^ {\\prime}. \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.698, + 0.784, + 0.744 + ], + "angle": 0, + "content": "Given that both the CLIP text encoder and general LLMs utilize tokenization derived from Byte Pair Encoding (BPE) [32], we can readily map the visual relevance computed by CLIP to the textual tokens of the LLMs as:" + }, + { + "type": "equation", + "bbox": [ + 0.266, + 0.757, + 0.785, + 0.799 + ], + "angle": 0, + "content": "\\[\n\\mathcal {C} _ {i} = \\frac {1}{K + 1} \\sum_ {k = j} ^ {j + K} c _ {k}, \\text {w i t h} T _ {\\mathrm {L L M}} (i) \\subseteq \\left\\{T _ {\\mathrm {C L I P}} (j), \\dots , T _ {\\mathrm {C L I P}} (j + K) \\right\\}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "where \\( T_{\\mathrm{LLM}}(i) \\) is the \\( i \\)th character string tokenized by LLM, and \\( T_{\\mathrm{CLIP}}(j) \\) is the \\( j \\)th character string tokenized by text encoder of CLIP. Considering that" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "BPE may fragment a single word into multiple subword units, it is possible to encounter the situation where one token in LLMs corresponds to several tokens in the text encoder of CLIP. In such scenario, we take the average relevance of these \\( K + 1 \\) tokens as the final mapping relevance. When \\( K \\) is zero, it means that the character string tokenized by the LLMs constitutes a substring within the text encoder of CLIP, and in this case, the current relevance can be used directly. By using the calculated visual relevance and applying average pooling with a predefined truncation threshold, we can pinpoint and extract the key textual tokens from the instructions that are most relevant to the corresponding image:" + }, + { + "type": "equation", + "bbox": [ + 0.315, + 0.302, + 0.786, + 0.343 + ], + "angle": 0, + "content": "\\[\n\\hat {x} _ {\\mathrm {c l s}} ^ {T} = \\left\\{ \\begin{array}{l l} x _ {\\mathrm {c l s}} ^ {V}, & \\text {i f} \\sum \\mathbb {I} _ {\\{\\mathcal {C} \\geq \\tau \\}} = 0, \\\\ \\frac {1}{\\sum \\mathbb {I} _ {\\{c \\geq \\tau \\}}} \\sum_ {i = 1} ^ {S} x _ {i} ^ {L} \\mathbb {I} _ {\\{\\mathcal {C} _ {i} \\geq \\tau \\}}, & \\text {O t h e r w i s e ,} \\end{array} \\right. \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.352, + 0.785, + 0.429 + ], + "angle": 0, + "content": "where \\(\\hat{x}_{\\mathrm{cls}}^T\\) is the textual pseudo CLS token of LLMs, \\(S\\) represents the length of tokens tokenized by LLMs and \\(\\mathbb{I}(\\cdot)\\) is an indicator function. If the relevance scores for the entire sequence of text tokens fall below the predefined threshold \\(\\tau\\), it indicates that the current instructions do not specify particular visual details. In such scenario, we directly use the visual CLS token as the pseudo CLS token." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.597 + ], + "angle": 0, + "content": "Building upon the methodology in Sec. 3.2, we continue to reuse the GTP module in the LLMs, and consider the attention weights corresponding to the pseudo CLS token as the basis to calculate the importance scores of each visual token. The calculated importance scores are then methodically used to inform the process of token pruning. Given the nature of the causal mask within the LLMs, we position the pseudo CLS token in between the sequence of visual tokens and textual tokens during the attention weights computation. This placement ensures that the pseudo CLS token can assess the entire sequence of visual tokens without being affected by subsequent textual tokens. Note that the role of the pseudo CLS token is confined to assisting in the token pruning process, and it does not serve as an actual token during the model's training and inference." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.626, + 0.64, + 0.642 + ], + "angle": 0, + "content": "3.4 Two-stage Token Pruning Manner for LVLMs" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Based on the above discussion, we divide the entire pruning process into two stages. The first stage operates across the entire ViT, where the GTP module is executed within the grouped visual transformer layers to eliminate tokens of low informational content based on the association between patch tokens and the visual CLS token. The second stage focuses on a subset of LLM layers, selectively dropping visual tokens unrelated to the current instruction. This decision is informed by the attention between the remaining visual tokens and the textual pseudo CLS token, which aggregates from selected key tokens of the instructions. By adopting this two-stage process, the proposed method can significantly reduce the number of visual tokens while effectively retaining essential visual information. Detailed information regarding the algorithm can be found in the appendix." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.377, + 0.163 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.178, + 0.429, + 0.194 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.203, + 0.784, + 0.233 + ], + "angle": 0, + "content": "In the following, we describe our experimental setup including datasets and evaluation, implementation details, and specifics of the comparison." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.234, + 0.785, + 0.383 + ], + "angle": 0, + "content": "Datasets and Evaluation. The datasets employed for both training and evaluation in our study strictly conform to the specifications of LLaVA-1.5 [25]. In the pretraining phase, the 558K subset of the LAION-CC-SBU dataset with BLIP [21] captions are utilized. For instruction tuning, a comprehensive dataset with a diverse mix of 665K instruction-based examples are employed. We assess the performance of methods across 12 evaluation benchmarks, with the mean accuracy across these datasets as the principal metric for comparison. The scores of MME dataset [9] are normalized against the theoretical maximum value to facilitate uniformity in the scale of measurement. In the LLaVA-1.5 [25] framework, we primary experiment involved reducing visual tokens from 576 to 64." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.385, + 0.785, + 0.489 + ], + "angle": 0, + "content": "Implementation Details. We perform token pruning every three layers, with the final count of visual tokens determined by the number pruned in each time. To balance model performance and efficiency, we employ all layers of the ViT and the initial 12 layers of the LLM for token pruning. The relevance threshold \\(\\tau\\) is empirically set to 0.2. The model training and inference configurations are strictly aligned with the original settings of LLaVA-1.5 [25] for a fair comparison, and all experiments are conducted on \\(8\\times \\mathrm{A}100\\) GPUs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.49, + 0.787, + 0.686 + ], + "angle": 0, + "content": "Comparison Details. We primarily compare three categories of token pruning methods. The first includes straightforward token sampling or linear aggregation approaches, such as random sampling, topK based on patch token similarity with the CLS token, subsampling predicated on spatial correlations. The second category encompasses state-of-the-art methods in vision-only tasks, such as EViT [24] and ToMe [4]. The third category features token pruning methods that have recently emerged in LVLMs, including the abstractor structure from Honeybee [5], context attention in LLaMA-ViD [22], and the visual adapter in Qwen-VL [3]. For the sake of brevity, we directly use the model names to represent these structures. To eliminate the influence of factors such as model architecture, data, and training strategies, we reapply the aforementioned methods within the LLaVA-1.5 [25] framework to conduct a fair and thorough comparison. Specific details regarding the application can be found in the appendix." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.71, + 0.442, + 0.725 + ], + "angle": 0, + "content": "4.2 Experimental Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Main Results. Table 1 and 2 demonstrate the comparison of performance with various methods as the number of visual tokens is reduced from 576 to 64 under the LLaVA-1.5-7B and LLaVA-1.5-13B frameworks [25] respectively. Despite some discrepancies between the replicated results and those reported in the literature across different datasets, the overall average differences are negligible, with the replication showing a slight edge in performance. Consequently, the replicated results is adopted as the baseline for comparison. The tables" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.158, + 0.788, + 0.199 + ], + "angle": 0, + "content": "Table 1: The comparison of the visual token pruning methods with Vicuna-7B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.2, + 0.785, + 0.303 + ], + "angle": 0, + "content": "
Method\\( {\\mathrm{{VQAV}}}^{2} \\) [1]GQA [14]VisWiz [13]\\( {\\mathrm{{SQAI}}}^{3} \\) [28]\\( {\\mathrm{{VQAT}}}^{3} \\) [33]POPE [23]MME [9]MMB [27]MMBCN [27]SEED [19]LLaVAW \\( {}^{2} \\) [26]MM-Vet [40]Avg. \\( \\uparrow \\)TFLOPs \\( \\downarrow \\)
LLaVA-1.5-TB [25]78.562.050.066.858.285.975.564.358.358.663.430.562.715.4
LLaVA-1.5-TB* [25]79.162.749.067.858.686.372.866.259.358.563.731.763.015.4
Random sampling69.057.137.967.248.582.565.655.448.051.055.823.655.1 (-7.9)8.0 (-48.1%)
TopK72.458.147.066.952.583.867.163.355.254.559.226.558.9 (-4.1)8.0 (-48.1%)
Spatial pooling73.959.646.567.752.582.368.563.356.654.959.728.359.5 (-3.5)8.1 (-47.4%)
EViT [24]74.159.447.067.754.782.869.263.557.855.460.027.359.9 (-3.1)8.0 (-48.1%)
ToMe [4]75.160.047.167.555.382.470.463.956.555.260.526.660.0 (-3.0)8.0 (-48.1%)
Honeybee [5]74.859.047.267.850.984.068.761.657.855.259.427.159.5 (-3.5)8.1 (-47.4%)
LLaMA-VID [22]74.359.246.867.951.483.169.763.557.055.458.929.759.7 (-3.3)8.2 (-46.8%)
Qwen-VL [3]74.958.947.368.154.483.469.463.257.455.059.227.259.9 (-3.1)8.1 (-47.4%)
IVTP (Ours)77.860.447.967.858.285.772.666.157.456.462.830.562.0 (-1.0)8.2 (-46.8%)
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.324, + 0.787, + 0.364 + ], + "angle": 0, + "content": "Table 2: The comparison of the visual token pruning methods with Vicuna-13B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.366, + 0.785, + 0.468 + ], + "angle": 0, + "content": "
MethodVQAV2 [11]GQA [14]VisWiz [13]SQA1[28]VQAT[33]POPE [23]MME [9]MMB [27]MMBCN[27]SEED [19]LLVaW2[26]MM-Vet [40]Avg. ↑TFLOPs ↓
LLvA-1.5-13B [25]80.063.353.671.661.385.976.667.763.661.670.735.465.929.4
LLvA-1.5-13B* [25]80.063.454.570.460.086.478.468.363.160.869.436.866.029.4
Random sampling72.356.746.668.051.583.364.958.054.853.058.824.657.7 (-8.3)15.4 (47.5%)
TopK74.758.550.869.354.285.468.064.559.654.562.826.660.7 (-5.3)15.4 (47.5%)
Spatial pooling75.159.751.169.955.084.871.664.260.254.963.327.461.4 (-4.6)15.6 (46.9%)
EViT [24]77.260.253.470.157.984.673.665.360.155.464.928.662.6 (-3.4)15.4 (47.5%)
ToMe [4]76.961.453.970.157.685.373.165.061.256.065.932.663.3 (-2.7)15.4 (47.5%)
Honeybee [5]76.261.252.170.559.783.673.563.261.255.766.532.063.0 (-3.0)15.4 (47.5%)
LLvA-VID [22]76.561.752.970.457.283.374.464.260.555.266.032.762.9 (-3.1)15.5 (47.3%)
Qwen-VL [3]77.361.152.170.856.484.071.765.861.756.366.731.563.0 (-3.0)15.4 (47.5%)
IVTP (Ours)78.462.354.170.160.085.477.167.763.359.368.635.565.2 (-0.8)15.6 (46.9%)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.505, + 0.788, + 0.67 + ], + "angle": 0, + "content": "show that despite reducing visual tokens by approximately \\(88.9\\%\\), the proposed method incurs an average performance decline of only about \\(1\\%\\) across 12 evaluation datasets, coupled with over \\(46\\%\\) reduction in computational demand. Our method exceeds the performance of other token pruning methods by over \\(2\\%\\), despite incurring a slightly higher TFLOPs due to hierarchical token pruning in the LLM. Table 3 further illustrates the change in TFLOPs corresponding to an increase in text tokens from 128 to 1024. It is clear that as the number of text tokens reduced, the proportion of visual tokens becomes more significant, thereby intensifying their influence on the computational demands of the model. As a result, the effectiveness of visual token pruning in reducing computational demand becomes more evident." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Inference-only Results. Since the proposed method does not need any extra modules that require parameter optimization, it can be seamlessly integrated with pre-trained models. This eliminates the need for retraining and simultaneously enhances computational efficiency during inference. Fig. 3 presents a performance comparison of various methods in a pure inference scenario when reducing the number of visual tokens from 16 to 512. As the number of target tokens decreases, the advantages of our proposed method become more pronounced. Notably, when the number of visual tokens is reduced to 16, our method surpasses other approaches by approximately \\(5\\%\\). The proposed method guided by instruction semantics can more effectively maintain the task relevant visual information, thereby achieving better results." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.176, + 0.505, + 0.217 + ], + "angle": 0, + "content": "Table 3: Comparison results of TFLOPs across different methods as text token count varies from 128 to 1024." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.218, + 0.501, + 0.306 + ], + "angle": 0, + "content": "
Methods1282565121024
LLaVA-1.5-7B [25]9.911.715.422.9
TopK2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
ToMe [4]2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
Honeybee [5]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.4 (-32.8%)
Qwen-VL [3]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.3 (-33.2%)
IVTP (Ours)3.0 (-69.7%)4.7 (-59.8%)8.2 (-46.8%)15.5 (-32.3%)
" + }, + { + "type": "image", + "bbox": [ + 0.541, + 0.145, + 0.775, + 0.285 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.527, + 0.294, + 0.787, + 0.323 + ], + "angle": 0, + "content": "Fig. 3: Comparison of model performance with pure inference setting." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.355, + 0.446, + 0.37 + ], + "angle": 0, + "content": "4.3 Ablation and Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.385, + 0.785, + 0.446 + ], + "angle": 0, + "content": "To analyze different setups of our IVTP, we perform extensive ablation studies. All the experiments are conducted with LLaVA-1.5-7B [25] as the backbone, and report the average accuracy across the aforementioned 12 evaluation datasets in both retraining mode and pure inference mode (PI)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.447, + 0.788, + 0.763 + ], + "angle": 0, + "content": "Attention Rollout. As outlined in Sec. 3.2, we organize several contiguous layers into a group and apply attention rollout through the residual aggregation of intra-group attention weights. This process is intended to simulate the flow of information through hidden layer features, thereby yielding more reliable and effective attention weights for assessing the significance of visual patch tokens. Table 4 shows that substituting the group-wise attention rollout with a variant that uses only the CLS token's attention weight of current layer results in a performance decrease of \\(4.5\\%\\) in pure inference mode and \\(3.9\\%\\) in retraining mode. When switching from group-wise to layer-wise, the performance is improved, yet there is still a noticeable gap compared to the method using group-wise attention rollout. Although the proposed method requires to prune a greater number of tokens each time compared to layer-wise, it achieves better results with similar TFLOPs. This improvement is due to the more stable and efficient aggregation of attention, where the attention scores can more accurately reflect the contribution of patch tokens. Table 5 delves deeper into the impact of different attention information aggregation strategies. We evaluate several approaches for aggregating attention weights produced by different layers within a group, such as averaging, selecting the maximum, and implementing element-wise multiplication. The finding demonstrates that the residual method employed in our approach yields superior performance, owing to its improved alignment with the forward propagation of visual tokens." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Instruction Guided Selection. Another fundamental component of the proposed approach is the further selection of visual tokens guided by textual instructions, as elaborated in Sec. 3.3. To validate the effectiveness of this module, we also perform a series of ablation studies, which are presented in Table 6. As shown in the first row of the table, the attention weights of the visual" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.218, + 0.159, + 0.544, + 0.214 + ], + "angle": 0, + "content": "Table 4: Ablation study of the weights of attention rollout and vanilla attention. The metrics for comparison with the original LLaVA-1.5-7B are indicated in parentheses." + }, + { + "type": "table", + "bbox": [ + 0.239, + 0.215, + 0.526, + 0.294 + ], + "angle": 0, + "content": "
ModelAvg. Acc (PI)Avg. AccTFLOPs
Group-wise55.1 (-7.9)58.1 (-4.9)8.2 (-46.8%)
Layer-wise56.2 (-6.8)59.5 (-3.5)8.2 (-46.8%)
Rollout59.6 (-3.4)62.0 (-1.0)8.2 (-46.8%)
" + }, + { + "type": "table_caption", + "bbox": [ + 0.55, + 0.158, + 0.782, + 0.199 + ], + "angle": 0, + "content": "Table 5: Comparison with different attention weights aggregation strategies." + }, + { + "type": "table", + "bbox": [ + 0.564, + 0.201, + 0.77, + 0.294 + ], + "angle": 0, + "content": "
ModelAvg. Acc (PI)Avg. Acc
mean56.1 (-6.9)60.1 (-2.9)
max55.9 (-7.1)60.7 (-2.3)
multiply56.7 (-6.3)60.5 (-2.5)
Residual59.6 (-3.4)62.0 (-1.0)
" + }, + { + "type": "table_caption", + "bbox": [ + 0.218, + 0.332, + 0.526, + 0.387 + ], + "angle": 0, + "content": "Table 6: Ablation study of instruction guided selection. 'OTT', 'TE', and 'RT' refer to original textual tokens, CLIP text encoder, and relevance threshold, respectively." + }, + { + "type": "table", + "bbox": [ + 0.253, + 0.388, + 0.495, + 0.482 + ], + "angle": 0, + "content": "
OTTTERTAvg.Acc (PI)Avg.ACC
56.7(-6.3)59.2(-3.8)
✓58.3(-4.7)60.2(-2.8)
✓✓57.3(-5.7)59.9(-3.1)
✓✓✓59.6(-3.4)62.0(-1.0)
" + }, + { + "type": "table_caption", + "bbox": [ + 0.533, + 0.322, + 0.782, + 0.349 + ], + "angle": 0, + "content": "Table 7: \\( {}^{ + } \\) Extending token pruning to LLM with other methods." + }, + { + "type": "table", + "bbox": [ + 0.539, + 0.351, + 0.752, + 0.491 + ], + "angle": 0, + "content": "
ModelAvg. Acc (PI)Avg. Acc
TopK54.1 (-8.9)58.9 (-4.1)
TopK+54.9 (-8.1)58.7 (-4.3)
ToMe [4]57.5 (-5.5)60.0 (-3.0)
ToMe+57.7 (-5.3)60.1 (-2.9)
IVTP-V58.5 (-4.5)60.8 (-2.2)
IVTP59.6 (-3.4)62.0 (-1.0)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.788, + 0.748 + ], + "angle": 0, + "content": "CLS token are used as the foundation for token selection within the LLM, establishing the baseline for these experiments. We then aggregate the original textual instruction tokens into a pseudo CLS token via average pooling to steer the token selection process. This approach yields a significant improvement over the baseline, demonstrating that guiding the pruning of visual tokens with textual instructions effectively isolates instruction-relevant visual patches through cross-modal associations, thus further reducing the number of required visual tokens. To minimize the influence of irrelevant noise in the textual instructions, we introduced a relevance threshold to selectively extracts key textual tokens. However, due to the lack of associative contrastive training between the visual CLS token and the original textual tokens of LLM, directly calculating vector correlation and applying a threshold for filtration is insufficient for isolating key textual tokens. The last row of the table demonstrates that integrating the CLIP text encoder, which naturally excels in image-text alignment, enables the precise identification of relevant sections within the textual tokens." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Pruning in LLM. We also extend our two-stage visual token pruning to TopK and ToMe [4], denoted as \\(\\mathrm{TopK^{+}}\\) and \\(\\mathrm{ToMe^{+}}\\) in Table 7, respectively. For a direct comparison, we apply the proposed method solely to the visual encoder, indicated as IVTP-V in the table. It calculation that extending the purely visual methods to LLM does not yield significant improvements. This is because performing token pruning solely within visual patches through representational" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.158, + 0.475, + 0.186 + ], + "angle": 0, + "content": "Table 8: Comparison with the numbers of layers in token pruning groups." + }, + { + "type": "table", + "bbox": [ + 0.246, + 0.193, + 0.446, + 0.291 + ], + "angle": 0, + "content": "
LayersAvg.Acc (PI)Avg.Acc
ALL56.7(-6.3)58.2(-4.8)
258.8(-4.2)60.1(-2.9)
359.6(-3.4)62.0(-1.0)
459.1(-3.9)61.5(-1.5)
658.6(-4.4)59.9(-3.1)
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.303, + 0.474, + 0.33 + ], + "angle": 0, + "content": "Table 9: Computational complexity with different methods (TFLOPs)." + }, + { + "type": "table", + "bbox": [ + 0.233, + 0.33, + 0.459, + 0.424 + ], + "angle": 0, + "content": "
MethodsViTLLMextraTotal
LLaVA-1.5-7B [25]0.36115.003-15.364
TopK0.1907.772-7.962
ToMe [4]0.1907.772-7.962
Qwen-VL [3]0.3607.7720.0038.135
IVTP (our)0.2027.9460.0808.228
" + }, + { + "type": "image", + "bbox": [ + 0.495, + 0.157, + 0.787, + 0.329 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.491, + 0.341, + 0.788, + 0.41 + ], + "angle": 0, + "content": "Fig. 4: Performance comparison with token pruning scaling. We show the average accuracy over all 12 benchmarks with the target number of visual tokens varying from 16 to 512 under comparable TFLOPs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.457, + 0.785, + 0.501 + ], + "angle": 0, + "content": "similarity fails to address the scenario with sparse target tokens. Rather than applying the token pruning from the visual encoder to the LLM directly, we select relevant visual tokens based on the diverse instructions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.504, + 0.788, + 0.716 + ], + "angle": 0, + "content": "Scaling the Token Pruning. Figure 4 illustrates the trade-off between TFLOPs and average accuracy by adjusting the final count of visual tokens from 576 down to a range between 16 and 512. The trend shown in the figure indicates that when the final number of visual tokens is reduced to between 256 and 512, the performance of most methods are nearly identical to those of the original model. The proposed method even slightly exceeds the original model while achieving a \\(10\\%\\) to \\(30\\%\\) reduction in TFLOPs. This suggests that reducing the number of visual tokens to an optimal level can not only preserve essential visual information but also minimizes interference from irrelevant visual tokens. As the number of visual tokens is further reduced, relying solely on the relevance and uniqueness of patch tokens becomes inadequate for preserving visual information. To overcome this limitation, the proposed method introduces an instruction-guided mechanism that adaptively selects visual tokens highly relevant to the specific given prompt, thereby completing VQA tasks with fewer visual tokens." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.717, + 0.788, + 0.809 + ], + "angle": 0, + "content": "Group Layers. We vary the number of layers in each token pruning group, with a specific focus on the scenario in which all layers of the ViT and all the first 12 layers of the LLM are employed. Table 8 shows the optimal performance is achieved with each group consists of three layers. Groups comprising fewer layers yield less effective attention rollout aggregation, whereas groups with more layers require pruning more tokens, hindering the layer-wise interaction within tokens." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Computational complexity. Table 9 shows the comparison of computational complexity among different models. We itemize the computational costs of the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.787, + 0.309 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.318, + 0.788, + 0.361 + ], + "angle": 0, + "content": "Fig. 5: Visualization of the visual token pruning results. Each sample, viewed from left to right, consists of the raw image, the token pruning by the TopK, and the token pruning by the proposed method, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.39, + 0.789, + 0.618 + ], + "angle": 0, + "content": "visual encoder, LLM and extra structures separately to provide a detailed breakdown. It is clear that the LLM contributes the most to the overall computational complexity of the LVLM, due to its significantly higher number of parameters compared to the ViT and other supplementary structures. Consequently, the disparities in TFLOPs observed with purely visual methods are not discernible when these methods are incorporated into the LVLMs. Although our method inputs more visual tokens into the LLM compared to other pruning methods, by limiting pruning to the initial 12 layers of the LLM, we manage to keep the computational complexity within \\(2\\%\\) of that achieved by single-stage approaches. Visualizations. We further visualize the results of token pruning for a more intuitive understanding in Fig. 5. key textual tokens are highlighted in the instruction text and discarded visual tokens are masked in the input image. Our observations indicate that the proposed method excels at precisely identifying essential textual tokens related to visual content and adeptly preserving the most relevant visual tokens aligned with the semantics of diverse instructions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.64, + 0.36, + 0.657 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.672, + 0.788, + 0.84 + ], + "angle": 0, + "content": "This paper presents a visual token pruning technique for Large Vision-Language Models (LVLMs). It introduces a group-wise token pruning (GTP) module aimed at improving the stability and robustness of patch token importance assessment within a frozen visual encoder of LVLMs. The proposed method extends the designed GTP module to LLM with incorporating instruction semantics as guidance, thereby discarding irrelevant visual tokens based on instructional preferences. Comprehensive experiments and in-depth ablation studies show that the proposed method can prune more visual tokens with minimal loss of accuracy, as well as accelerate the training and inference of LVLMs. The reduction of visual tokens can also be transferred to multi-image or video tasks in LVLMs to boost their performance, which will be a key focus of our future work." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.176, + 0.785, + 0.204 + ], + "angle": 0, + "content": "1. Abnar, S., Zuidema, W.: Quantifying attention flow in transformers. arXiv preprint arXiv:2005.00928 (2020) 2, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.205, + 0.785, + 0.245 + ], + "angle": 0, + "content": "2. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.247, + 0.785, + 0.286 + ], + "angle": 0, + "content": "3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A frontier large vision-language model with versatile abilities. arXiv preprint arXiv:2308.12966 (2023) 1, 2, 3, 9, 10, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.288, + 0.785, + 0.327 + ], + "angle": 0, + "content": "4. Bolya, D., Fu, C.Y., Dai, X., Zhang, P., Feichtenhofer, C., Hoffman, J.: Token merging: Your vit but faster. In: The Eleventh International Conference on Learning Representations (2022) 2, 4, 6, 9, 10, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.329, + 0.785, + 0.355 + ], + "angle": 0, + "content": "5. Cha, J., Kang, W., Mun, J., Roh, B.: Honeybee: Locality-enhanced projector for multimodal llm. arXiv preprint arXiv:2312.06742 (2023) 9, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.357, + 0.785, + 0.397 + ], + "angle": 0, + "content": "6. Chefer, H., Gur, S., Wolf, L.: Transformer interpretability beyond attention visualization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 782-791 (2021) 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.398, + 0.785, + 0.439 + ], + "angle": 0, + "content": "7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.44, + 0.785, + 0.494 + ], + "angle": 0, + "content": "8. Fayyaz, M., Koohpayegani, S.A., Jafari, F.R., Sengupta, S., Joze, H.R.V., Sommerlade, E., Pirsiavash, H., Gall, J.: Adaptive token sampling for efficient vision transformers. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 396-414. Springer (2022) 2, 4, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.496, + 0.785, + 0.535 + ], + "angle": 0, + "content": "9. Fu, C., Chen, P., Shen, Y., Qin, Y., Zhang, M., Lin, X., Yang, J., Zheng, X., Li, K., Sun, X., et al.: Mme: A comprehensive evaluation benchmark for multimodal large language models. arXiv preprint arXiv:2306.13394 (2023) 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.537, + 0.785, + 0.588 + ], + "angle": 0, + "content": "10. Goyal, S., Choudhury, A.R., Raje, S., Chakaravarthy, V., Sabharwal, Y., Verma, A.: Power-bert: Accelerating bert inference via progressive word-vector elimination. In: International Conference on Machine Learning. pp. 3690-3699. PMLR (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.591, + 0.785, + 0.646 + ], + "angle": 0, + "content": "11. Goyal, Y., Khot, T., Summers-Stay, D., Batra, D., Parikh, D.: Making the v in vqa matter: Elevating the role of image understanding in visual question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6904-6913 (2017) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.647, + 0.785, + 0.687 + ], + "angle": 0, + "content": "12. Guo, Y., Zhang, H., Nie, L., Wong, Y., Kankanhalli, M.: Elip: Efficient language-image pre-training with fewer vision tokens. arXiv preprint arXiv:2309.16738 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.689, + 0.785, + 0.743 + ], + "angle": 0, + "content": "13. Gurari, D., Li, Q., Stangl, A.J., Guo, A., Lin, C., Grauman, K., Luo, J., Bigham, J.P.: Vizwiz grand challenge: Answering visual questions from blind people. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3608-3617 (2018) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.745, + 0.785, + 0.784 + ], + "angle": 0, + "content": "14. Hudson, D.A., Manning, C.D.: Gqa: A new dataset for real-world visual reasoning and compositional question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6700-6709 (2019) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.786, + 0.785, + 0.84 + ], + "angle": 0, + "content": "15. Jiang, C., Xu, H., Ye, W., Ye, Q., Li, C., Yan, M., Bi, B., Zhang, S., Huang, F., Huang, S.: Bus: Efficient and effective vision-language pre-training with bottom-up patch summarization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2900-2910 (2023) 4" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.176, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.378, + 0.129 + ], + "angle": 0, + "content": "K. Huang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "16. Kim, G., Cho, K.: Length-adaptive transformer: Train once with length drop, use anytime with search. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing. pp. 6501-6511 (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.205, + 0.786, + 0.247 + ], + "angle": 0, + "content": "17. Kim, S., Shen, S., Thorsley, D., Gholami, A., Kwon, W., Hassoun, J., Keutzer, K.: Learned token pruning for transformers. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 784-794 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.247, + 0.787, + 0.302 + ], + "angle": 0, + "content": "18. Kong, Z., Dong, P., Ma, X., Meng, X., Niu, W., Sun, M., Shen, X., Yuan, G., Ren, B., Tang, H., et al.: Spvit: Enabling faster vision transformers via latency-aware soft token pruning. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 620-640. Springer (2022) 4, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.303, + 0.787, + 0.345 + ], + "angle": 0, + "content": "19. Li, B., Wang, R., Wang, G., Ge, Y., Ge, Y., Shan, Y.: Seed-bench: Benchmarking multimodal llms with generative comprehension. arXiv preprint arXiv:2307.16125 (2023) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.346, + 0.787, + 0.387 + ], + "angle": 0, + "content": "20. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023) 1, 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.388, + 0.787, + 0.43 + ], + "angle": 0, + "content": "21. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022) 4, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.43, + 0.787, + 0.458 + ], + "angle": 0, + "content": "22. Li, Y., Wang, C., Jia, J.: Llama-vid: An image is worth 2 tokens in large language models. arXiv preprint arXiv:2311.17043 (2023) 1, 2, 3, 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.459, + 0.787, + 0.499 + ], + "angle": 0, + "content": "23. Li, Y., Du, Y., Zhou, K., Wang, J., Zhao, W.X., Wen, J.R.: Evaluating object hallucination in large vision-language models. arXiv preprint arXiv:2305.10355 (2023) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.501, + 0.787, + 0.543 + ], + "angle": 0, + "content": "24. Liang, Y., Chongjian, G., Tong, Z., Song, Y., Wang, J., Xie, P.: Evit: Expediting vision transformers via token reorganizations. In: International Conference on Learning Representations (2021) 2, 4, 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.544, + 0.787, + 0.572 + ], + "angle": 0, + "content": "25. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. arXiv preprint arXiv:2310.03744 (2023) 3, 4, 9, 10, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.573, + 0.787, + 0.6 + ], + "angle": 0, + "content": "26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024) 1, 3, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.601, + 0.787, + 0.642 + ], + "angle": 0, + "content": "27. Liu, Y., Duan, H., Zhang, Y., Li, B., Zhang, S., Zhao, W., Yuan, Y., Wang, J., He, C., Liu, Z., et al.: Mmbench: Is your multi-modal model an all-around player? arXiv preprint arXiv:2307.06281 (2023) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.787, + 0.698 + ], + "angle": 0, + "content": "28. Lu, P., Mishra, S., Xia, T., Qiu, L., Chang, K.W., Zhu, S.C., Tafjord, O., Clark, P., Kalyan, A.: Learn to explain: Multimodal reasoning via thought chains for science question answering. Advances in Neural Information Processing Systems 35, 2507-2521 (2022) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.7, + 0.736, + 0.714 + ], + "angle": 0, + "content": "29. OpenAI: Chatgpt. https://openai.com/blog/chatgpt/, 2023. 1, 2 (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.714, + 0.787, + 0.769 + ], + "angle": 0, + "content": "30. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.77, + 0.787, + 0.812 + ], + "angle": 0, + "content": "31. Rao, Y., Zhao, W., Liu, B., Lu, J., Zhou, J., Hsieh, C.J.: Dynamicvit: Efficient vision transformers with dynamic token sparsification. Advances in neural information processing systems 34, 13937-13949 (2021) 2, 4, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.787, + 0.84 + ], + "angle": 0, + "content": "32. Sennrich, R., Haddow, B., Birch, A.: Neural machine translation of rare words with subword units. arXiv preprint arXiv:1508.07909 (2015) 7" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.69, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "IVTP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.203 + ], + "angle": 0, + "content": "33. Singh, A., Natarajan, V., Shah, M., Jiang, Y., Chen, X., Batra, D., Parikh, D., Rohrbach, M.: Towards vqa models that can read. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8317-8326 (2019) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.204, + 0.787, + 0.245 + ], + "angle": 0, + "content": "34. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al.: Llama: Open and efficient foundation language models. arXiv preprint arXiv:2302.13971 (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.246, + 0.787, + 0.3 + ], + "angle": 0, + "content": "35. Wei, S., Ye, T., Zhang, S., Tang, Y., Liang, J.: Joint token pruning and squeezing towards more aggressive compression of vision transformers. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2092-2101 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.3, + 0.787, + 0.328 + ], + "angle": 0, + "content": "36. Wu, X., Zeng, F., Wang, X., Wang, Y., Chen, X.: Ppt: Token pruning and pooling for efficient vision transformers. arXiv preprint arXiv:2310.01812 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.328, + 0.787, + 0.383 + ], + "angle": 0, + "content": "37. Xu, Y., Zhang, Z., Zhang, M., Sheng, K., Li, K., Dong, W., Zhang, L., Xu, C., Sun, X.: Evo-vit: Slow-fast token evolution for dynamic vision transformer. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 2964-2972 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.383, + 0.787, + 0.438 + ], + "angle": 0, + "content": "38. Ye, D., Lin, Y., Huang, Y., Sun, M.: Tr-bert: Dynamic token reduction for accelerating bert inference. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5798-5809 (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.439, + 0.787, + 0.493 + ], + "angle": 0, + "content": "39. Yin, H., Vahdat, A., Alvarez, J.M., Mallya, A., Kautz, J., Molchanov, P.: A-vit: Adaptive tokens for efficient vision transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10809-10818 (2022) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.493, + 0.787, + 0.535 + ], + "angle": 0, + "content": "40. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.535, + 0.787, + 0.577 + ], + "angle": 0, + "content": "41. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023) 1, 3" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.577 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_origin.pdf b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..fc364f6fea82396f0fe2bb545dcda8655e4d46ff --- /dev/null +++ b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/dc23e47d-6ef5-417d-a382-d275c9d72743_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9433ba2c58d801ab0b3448ba35c39c5cb02d9797e91cb1ad7b8739e460b59d5d +size 4845168 diff --git a/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/full.md b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/full.md new file mode 100644 index 0000000000000000000000000000000000000000..49969aa5d539c8412ba038f1b673ec151fa9ee57 --- /dev/null +++ b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/full.md @@ -0,0 +1,257 @@ +# IVTP: Instruction-guided Visual Token Pruning for Large Vision-Language Models + +Kai Huang*, Hao Zou*, Ye Xi, BoChen Wang, Zhen Xie, and Liang Yu + +Alibaba Group, China +{zhouwan.hk, zh372956, yx150449, bochen.wbc, xiezhen.xz, liangyu.yl}@alibaba-inc.com + +Abstract. Inspired by the remarkable achievements of Large Language Models (LLMs), Large Vision-Language Models (LVLMs) have likewise experienced significant advancements. However, the increased computational cost and token budget occupancy associated with lengthy visual tokens pose significant challenge to the practical applications. Considering that not all visual tokens are essential to the final response, selectively pruning redundant visual tokens can effectively alleviate this challenge. In this paper, we present a novel Instruction-guided Visual Token Pruning (IVTP) approach for LVLMs, which is designed to strike a better balance between computational efficiency and the performance. Specifically, a Group-wise Token Pruning (GTP) module based on attention rollout is integrated into the grouped transformer layer to achieve intra-group attention aggregation via residual connection, thereby improving the assessment of visual token importance, especially for LVLMs with a frozen visual encoder. We then extend the module to LLM in order to further filter out visual tokens that are pertinent to the current textual instructions, by introducing a semantically related pseudo CLS token to serve as a reference for token pruning. This two-stage token pruning mechanism permits a systematic and efficient reduction in the quantity of visual tokens while preserving essential visual information. We apply the proposed method to the most representative LVLM, i.e. LLaVA-1.5. Experimental results demonstrate that when the number of visual tokens is reduced by $88.9\%$ , the computational complexity is decreased by over $46\%$ , with only an average $1.0\%$ accuracy drop across 12 benchmarks, and remarkably surpasses the state-of-the-art token pruning methods. + +Keywords: Visual Token Pruning, Large Vision-Language Models (LVLMs) + +# 1 Introduction + +Large Vision-Language Models (LVLMs) have garnered widespread interest from both the academic and industrial communities due to their impressive ability in handling cross-modality tasks [3,20,22,26,41]. Despite the remarkable progress of LVLMs, they still face challenges of high computational costs caused by lengthy + +image tokens. As a result, considerable works have been devoted to optimizing the trade-off between computational efficiency and model effectiveness in large models. To reduce the number of image tokens fed into Large Language Models (LLMs), some approaches [3,20,22] employ a trainable token compression module placed after the visual encoder, as shown in Fig. 1(a). Though capable of effectively pruning redundant visual tokens, the above methods are often tightly coupled with the model architecture, and the effectiveness of these structures often lacks comprehensive validation, which makes them difficult to transfer to other model frameworks. Building on the advancements in token pruning for traditional visual tasks [4,8,24,31,39], one direct approach is to adapt these existing vision-only pruning methods to LVLMs, where token pruning is performed only in the visual encoder, as shown in Fig. 1(b). Although these methods are transferable, the standard practice of freezing the visual encoder in LVLMs prevents the pruning process from being optimized end-to-end with the training of the LVLMs, consequently suffering from suboptimal stability. + +In this work, we propose an Instruction-guided Visual Token Pruning (IVTP) method to address the aforementioned issues, achieving a balance between accuracy and computational efficiency while also offering improved transferability and stability. As illustrated in Fig. 1(c), we divide the visual token pruning into two stages. The first stage is similar to vision-only token pruning, where re + +dundant visual tokens with low informative content are eliminated in the ViT based on the attention connections within tokens. The second stage occurs within the LLM, it aims to remove visual tokens that exhibit a low correlation with the current textual instructions. Specifically, we determine the significance of each patch token by calculating its attentiveness in relation to the CLS token within the visual encoder. In order to ensure that the importance assessment of visual tokens remains effective within a frozen ViT, a Group-wise Token Pruning (GTP) module based on attention rollout [1] is proposed to integrate into the grouped visual transformer layers to achieve hierarchical attention weight aggregation. However, the continuous decrease in visual tokens results in less visual information being conveyed to the LLM, hindering its ability to follow diverse and variable visual instructions. To adaptively adjust the visual information contained by visual patch tokens according to different instructions, we further integrate the GTP into the LLM for instruction-guided visual token pruning. Since decoder-only LLMs do not incorporate a CLS token to represent text semantics, aggregating all textual tokens indiscriminately may introduce noise information that is not referred to image. The text encoder branch of CLIP [30], aligned with + +![](images/ec66c7f91381c9eded6a97a02d646a702fddecd1ee1956ccc49d4d268610e7ed.jpg) +Fig.1: Comparison of different token pruning schemes for LVLMs. + +the visual encoder of LVLMs, is introduced to filter out irrelevant textual tokens by calculating the token-wise relevance with the visual CLS token. Text tokens that match to the visual content are aggregated to form a textual pseudo CLS token so that the GTP module can be extended to LLM. + +Our main contributions are: (1) We present a novel two-stage visual token pruning method for LVLMs, which can significantly reduce the visual tokens while preserving essential visual information, leading to a substantial increase in model computational efficiency with minimal loss of accuracy. (2) We propose a module that can work compatibly both within the ViT and the LLM, named Group-wise Token Pruning (GTP). Benefiting from the aggregation of attention weights based on attention rollout within groups across layers, the importance assessment of visual tokens is more robust and precise. Furthermore, a textual pseudo CLS gathered from visual relevant textual tokens, is used in GTP to introduce instruction preferences, thereby filtering out semantically irrelevant visual patch tokens and further compressing the number of visual tokens. (3) We introduce the IVTP to LLaVA-1.5 [25], the extensive experimentation on 12 standard benchmarks demonstrate that the proposed method achieves a superior trade-off between accuracy and computational efficiency. + +# 2 Related Work + +Large Vision-Language Models. Inspired by the success of LLMs [2, 29, 34], recent advancements in LVLMs have also demonstrated satisfying performance, such as [3, 22, 26, 41]. These approaches typically combine a pre-trained visual encoder with an LLM, enabling the LLM to handle multimodal data involving images. Furthermore, to align the multimodal data, a projection layer is appended after the visual encoder, such as a Q-former, linear mapping, or cross attention. BLIP2 [20] achieves stronger performance at a lower computation cost by freezing the visual encoder and LLM and only updating the weights of Q-former, which serves as the bridge for the modality gap. LLaVA [26] utilizes multimodal language-image instruction-following data generated by GPT-4 [2] for visual instruction tuning. Visual instruction tuning enables the LLaVA to accommodate users' diverse requests for instructions that involve visual content. During the training phase, QWen-VL [3] enhances the performance of model by updating the parameters of the visual encoder and utilizing higher-resolution images. Although increasing the number of model parameters and the resolution of input images can effectively improve the performance of LLMs, the computational cost that they bring cannot be ignored. Our proposed ITVP can be directly integrated into a LVLM without training, reducing the computational cost of the LVLM by pruning redundant image tokens. + +Token Pruning. Token pruning aims to retain attentive tokens and prune inattentive ones by designing importance evaluation strategies to create more efficient transformers in both natural language processing (NLP) and Computer Vision (CV). Benefiting from the success of BERT [7], many works [10, 16, 17, 38] in the NLP field have achieved text token pruning based on BERT, but these + +methods require training and are difficult to adapt to the current LLMs. In the CV field, a classic method is DynamicViT [31], which inserts a trainable prediction module into the transformer to predict the importance score of each token. Subsequent works [8, 39] go further by sampling tokens with an input-dependent number. To address the issue of information loss in token pruning, [18, 24, 37] retain inattentive tokens by collapsing the pruned tokens into one through token reorganization. The above methods perform token pruning based on importance scores, but tokens that are close in the feature space will be assigned similar scores, leading to the possibility that similar tokens may be simultaneously retained or removed. Another classic approach is ToMe [4], which achieves token pruning by calculating the similarity between different tokens and merging tokens with high similarity. However, merging tokens can cause image distortion, making it difficult for the model to capture fine-grained information. Recent approaches [35, 36] attempt to mitigate the shortcomings of both types by combining the two methods, but how to effectively combine them remains an area for exploration. Based on [21], recent studies [12, 15] simultaneously utilize the CLS token of the visual branch and the CLS token of the text branch to implement image token pruning. The aforementioned methods of directly incorporating all textual information to guide the selection of visual tokens may introduce additional noise information, potentially causing instability in token selection. In this paper, we utilize the text branch of the CLIP to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions. + +# 3 Methodology + +This research represents a preliminary effort to investigate the visual token pruning for LVLMs that achieves an optimal balance among performance, speed, cost and numbers of visual tokens. As shown in Fig. 2, our method is fundamentally based on established LVLMs, such as LLaVA-1.5 [25], which are succinctly reviewed in Sec. 3.1. Sec. 3.2 delves into the details of group-wise token pruning that leverages attention rollout to facilitate coarse-grained pruning within visual transformers. In Sec. 3.3, we further demonstrate the visual token pruning in LLMs guided by textual instruction. Finally, details of the two-stage manner applied to the ViT and LLM of LVLMs are presented in Sec. 3.4. + +# 3.1 Revisit of Large Vision-Language Models + +The mechanism of a LLM is complex and involves multiple layers of neural networks. Mathematically, a simplified conceptual representation could be expressed through the following formula: + +$$ +p (\mathbf {X}) = \prod_ {i = 1} ^ {M} p \left(x _ {i} ^ {L} \mid x _ {1} ^ {V}, \dots , x _ {F} ^ {V}, x _ {1} ^ {L}, \dots , x _ {i - 1} ^ {L}; \Theta\right), \tag {1} +$$ + +![](images/2550924eef1300820adca22d87c0917dd00b4696c63e53c7d393b4b51221e3e9.jpg) +Fig. 2: Overview of Instruction-guided Visual Token Pruning (IVTP) for large vision-language models. The entire process is divided into two stages: The first stage takes place within the visual encoder of the LVLM, where a Group-wise Token Pruning (GTP) module is employed to discard redundant tokens with low informative content based on the inherent visual CLS token in ViT. The second stage operates on the first $W$ layers of the LLM, in which we aggregate text instructions into a textual CLS token by introducing a frozen CLIP text encoder, and once again integrate GTP to remove visual tokens with low relevance to the current query. + +![](images/38adcc0ee3cba2d3bada9936c9cc67c4d13f5e2a52b23999138887e4c8f843a7.jpg) + +where $p(\mathbf{X})$ represents the joint probability distribution of the entire sequence, and $x_{i}$ denotes the $i$ th token in the sequence. However, unlike the uniform token type in the standard LLMs, the input to the LLM in LVLMs consists of both visual tokens $x^{V}$ and language tokens $x^{L}$ . It predicts the next language token given the complete set of $F$ visual tokens and the preceding $i - 1$ language tokens. Generally, the visual tokens of an image are derived from the flattened grid features with a visual encoder, which are then mapped into the word embedding space. An image with a resolution of 336px results in 576 tokens when using ViT-L/14 as the visual transformer. Handling such a high number of tokens becomes challenging under the standard LLM's input limit of 2048 tokens. This limitation not only results in increased training and inference time consumption for LVLMs but also restricts the ability to process higher resolution or multiple images within the limited token budget. + +# 3.2 Group-wise Token Pruning + +Similar to vision-only pruning approaches, we aim to evaluate the significance of each patch token by examining their importance scores in LVLMs, which allows us to selectively prune patch tokens with minimal influence. Existing token pruning methods relied on importance scores are typically conducted in an incremental layer-specific manner, in which each layer prunes a certain number of tokens according to its importance scores, cumulatively achieving the overall to + +ken reduction goal. However, assessing token significance solely based on importance score from individual layer introduces a considerable amount of instability. It is essential to retrain the ViT to optimize the aggregation of patch information, while this makes it challenging in LVLMs as the visual encoder is typically kept frozen. To mitigate this, we employ an attention rollout mechanism [1] to derive group-wise token importance metric based on the aggregated attention weights across successive layers, which takes into account the inter-layer transfer of attention information. Compared to the original single-layer attention, the importance scores obtained from the attention with attention rollout exhibit a higher correlation with contributions to the prediction output. In NLP prediction tasks and visual visualization based on the transformer [1,6], the attention derived from attention rollout has been proven to be more stable and effective. Consequently, we intend to incorporate it into visual token pruning to enhance token decision-making for the frozen ViT. + +In the transformer architecture, the attention weight $A$ in the self-attention layer is calculated by the scaled dot product of the queries $\mathbf{Q} \in \mathbb{R}^{(N + 1)\times d}$ and keys $\mathbf{K} \in \mathbb{R}^{(N + 1)\times d}$ : + +$$ +\mathbf {A} = \operatorname {S o f t m a x} \left(\mathbf {Q} \mathbf {K} ^ {T} / \sqrt {d} + \mathbf {A} _ {\text {m a s k}}\right) \in \mathbb {R} ^ {(N + 1) \times (N + 1)}, \tag {2} +$$ + +where $\mathbf{A}_{\mathrm{mask}}$ is the attention mask, which is None in the visual encoder and a causal matrix in the LLMs, $N$ is the number of patch tokens and $d$ is the embedding dimension. As previously described, we perform the attention rollout to better model the transfer of attention across layers by considering the residual connections within the network, thereby rendering the attention-based token importance assessment more reliable. Specifically, it adds an identity matrix to the attention matrix and subsequently re-normalizing the weights. To integrate the attention spanning from layer $l_{1}$ to layer $l_{2}$ , a recursive multiplication is applied to the attention weights across all the corresponding range of layers as: + +$$ +\tilde {\mathbf {A}} ^ {l} = \left\{ \begin{array}{l l} \mathbf {A} ^ {l _ {1}}, & \text {i f} l = l _ {1}, \\ \left(\mathbf {A} ^ {l} + \mathbf {I}\right) \tilde {\mathbf {A}} ^ {l - 1}, & \text {i f} l _ {1} < l \leq l _ {2}. \end{array} \right. \tag {3} +$$ + +The re-normalize operation is omitted to simplify the formula. To preserve the exceptional traits of hierarchical token pruning [4, 18, 31], we divide the entire network into groups. Within each group, we perform attention rollout to aggregate attention information from adjacent layers, and execute token pruning at the topmost layer of each group. Similar to [8], the normalized values of patch tokens $\mathbf{V} \in \mathbb{R}^{N \times d}$ are weighted by their corresponding entries in the CLS row of the attention matrix, taking into account both the positions and the corresponding strength of activation. The final importance score of $i$ th patch $S_{i}$ is derived from the normalization as: + +$$ +\mathcal {S} _ {i} = \frac {\tilde {\mathbf {A}} _ {\mathrm {c l s} , i} \times \| \mathbf {V} _ {i} \|}{\sum_ {j} \tilde {\mathbf {A}} _ {\mathrm {c l s} , j} \times \| \mathbf {V} _ {j} \|} \in \mathbb {R} ^ {1 \times N}, \tag {4} +$$ + +where $\tilde{\mathbf{A}}_{\mathrm{cls}}$ represents the row from the attention weight matrix associated with the CLS token, after excluding the CLS token itself. By ranking the patch tokens + +according to their corresponding importance scores, we can selectively discard those low importance patch tokens within each group. + +# 3.3 Instruction-guided Token Pruning in LLM + +As the number of remaining patch tokens diminishes, the granularity of information preserved by the visual patch tokens also decreases. This reduction is inconsequential for standard visual token pruning methods, which are predominantly applied to classification tasks focused on extracting salient subject information. Moreover, hierarchical pruning provides an opportunity for the CLS token to aggregate information from patch tokens before they are dropped, thereby mitigating potential information loss. LVLMs are tasked with extracting pertinent detailed information from visual patches in response to diverse linguistic instructions. Consequently, the correlation between the residual visual patches and the instructions critically influences the performance in visual question answering. + +A plausible strategy involves leveraging the instruction to guide the assessment of visual token significance, with the aim of selectively retaining those patch tokens that bear the most relevance to the text. Nonetheless, this approach encounters a significant challenge that the decoder-only LLM does not incorporate a CLS token representative of the semantic information, and aggregating all textual tokens in a crude manner also introduces the interference of noise. Therefore, the text branch of the CLIP is utilized to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions. Specifically, given the text $T$ , we can obtain its corresponding sequence of textual tokens $\{\bar{x}_1^L,\dots ,\bar{x}_{S'}^L\}$ after being processed by the pre-trained text encoder of CLIP as: + +$$ +\{\bar {x} _ {1} ^ {L}, \dots , \bar {x} _ {S ^ {\prime}} ^ {L} \} = \mathcal {T} (T) \in \mathbb {R} ^ {S ^ {\prime} \times d}, \tag {5} +$$ + +where $\mathcal{T}$ is the text encoder of CLIP and $S^{\prime}$ denotes the length of textual tokens. Then, the visual relevance of textual tokens can be ascertained by computing the cosine similarity between the sequence of CLIP text tokens and the visual CLS tokens: + +$$ +c _ {i} = \frac {x _ {\mathrm {c l s}} ^ {\mathrm {V}} \bar {x} _ {i} ^ {L}}{\| x _ {\mathrm {c l s}} \| \left\| \bar {x} _ {i} ^ {L} \right\|}, \text {f o r} i \in 1, \dots , S ^ {\prime}. \tag {6} +$$ + +Given that both the CLIP text encoder and general LLMs utilize tokenization derived from Byte Pair Encoding (BPE) [32], we can readily map the visual relevance computed by CLIP to the textual tokens of the LLMs as: + +$$ +\mathcal {C} _ {i} = \frac {1}{K + 1} \sum_ {k = j} ^ {j + K} c _ {k}, \text {w i t h} T _ {\mathrm {L L M}} (i) \subseteq \left\{T _ {\mathrm {C L I P}} (j), \dots , T _ {\mathrm {C L I P}} (j + K) \right\}, \tag {7} +$$ + +where $T_{\mathrm{LLM}}(i)$ is the $i$ th character string tokenized by LLM, and $T_{\mathrm{CLIP}}(j)$ is the $j$ th character string tokenized by text encoder of CLIP. Considering that + +BPE may fragment a single word into multiple subword units, it is possible to encounter the situation where one token in LLMs corresponds to several tokens in the text encoder of CLIP. In such scenario, we take the average relevance of these $K + 1$ tokens as the final mapping relevance. When $K$ is zero, it means that the character string tokenized by the LLMs constitutes a substring within the text encoder of CLIP, and in this case, the current relevance can be used directly. By using the calculated visual relevance and applying average pooling with a predefined truncation threshold, we can pinpoint and extract the key textual tokens from the instructions that are most relevant to the corresponding image: + +$$ +\hat {x} _ {\mathrm {c l s}} ^ {T} = \left\{ \begin{array}{l l} x _ {\mathrm {c l s}} ^ {V}, & \text {i f} \sum \mathbb {I} _ {\{\mathcal {C} \geq \tau \}} = 0, \\ \frac {1}{\sum \mathbb {I} _ {\{c \geq \tau \}}} \sum_ {i = 1} ^ {S} x _ {i} ^ {L} \mathbb {I} _ {\{\mathcal {C} _ {i} \geq \tau \}}, & \text {O t h e r w i s e ,} \end{array} \right. \tag {8} +$$ + +where $\hat{x}_{\mathrm{cls}}^T$ is the textual pseudo CLS token of LLMs, $S$ represents the length of tokens tokenized by LLMs and $\mathbb{I}(\cdot)$ is an indicator function. If the relevance scores for the entire sequence of text tokens fall below the predefined threshold $\tau$ , it indicates that the current instructions do not specify particular visual details. In such scenario, we directly use the visual CLS token as the pseudo CLS token. + +Building upon the methodology in Sec. 3.2, we continue to reuse the GTP module in the LLMs, and consider the attention weights corresponding to the pseudo CLS token as the basis to calculate the importance scores of each visual token. The calculated importance scores are then methodically used to inform the process of token pruning. Given the nature of the causal mask within the LLMs, we position the pseudo CLS token in between the sequence of visual tokens and textual tokens during the attention weights computation. This placement ensures that the pseudo CLS token can assess the entire sequence of visual tokens without being affected by subsequent textual tokens. Note that the role of the pseudo CLS token is confined to assisting in the token pruning process, and it does not serve as an actual token during the model's training and inference. + +# 3.4 Two-stage Token Pruning Manner for LVLMs + +Based on the above discussion, we divide the entire pruning process into two stages. The first stage operates across the entire ViT, where the GTP module is executed within the grouped visual transformer layers to eliminate tokens of low informational content based on the association between patch tokens and the visual CLS token. The second stage focuses on a subset of LLM layers, selectively dropping visual tokens unrelated to the current instruction. This decision is informed by the attention between the remaining visual tokens and the textual pseudo CLS token, which aggregates from selected key tokens of the instructions. By adopting this two-stage process, the proposed method can significantly reduce the number of visual tokens while effectively retaining essential visual information. Detailed information regarding the algorithm can be found in the appendix. + +# 4 Experiments + +# 4.1 Experimental Setup + +In the following, we describe our experimental setup including datasets and evaluation, implementation details, and specifics of the comparison. + +Datasets and Evaluation. The datasets employed for both training and evaluation in our study strictly conform to the specifications of LLaVA-1.5 [25]. In the pretraining phase, the 558K subset of the LAION-CC-SBU dataset with BLIP [21] captions are utilized. For instruction tuning, a comprehensive dataset with a diverse mix of 665K instruction-based examples are employed. We assess the performance of methods across 12 evaluation benchmarks, with the mean accuracy across these datasets as the principal metric for comparison. The scores of MME dataset [9] are normalized against the theoretical maximum value to facilitate uniformity in the scale of measurement. In the LLaVA-1.5 [25] framework, we primary experiment involved reducing visual tokens from 576 to 64. + +Implementation Details. We perform token pruning every three layers, with the final count of visual tokens determined by the number pruned in each time. To balance model performance and efficiency, we employ all layers of the ViT and the initial 12 layers of the LLM for token pruning. The relevance threshold $\tau$ is empirically set to 0.2. The model training and inference configurations are strictly aligned with the original settings of LLaVA-1.5 [25] for a fair comparison, and all experiments are conducted on $8\times \mathrm{A}100$ GPUs. + +Comparison Details. We primarily compare three categories of token pruning methods. The first includes straightforward token sampling or linear aggregation approaches, such as random sampling, topK based on patch token similarity with the CLS token, subsampling predicated on spatial correlations. The second category encompasses state-of-the-art methods in vision-only tasks, such as EViT [24] and ToMe [4]. The third category features token pruning methods that have recently emerged in LVLMs, including the abstractor structure from Honeybee [5], context attention in LLaMA-ViD [22], and the visual adapter in Qwen-VL [3]. For the sake of brevity, we directly use the model names to represent these structures. To eliminate the influence of factors such as model architecture, data, and training strategies, we reapply the aforementioned methods within the LLaVA-1.5 [25] framework to conduct a fair and thorough comparison. Specific details regarding the application can be found in the appendix. + +# 4.2 Experimental Results + +Main Results. Table 1 and 2 demonstrate the comparison of performance with various methods as the number of visual tokens is reduced from 576 to 64 under the LLaVA-1.5-7B and LLaVA-1.5-13B frameworks [25] respectively. Despite some discrepancies between the replicated results and those reported in the literature across different datasets, the overall average differences are negligible, with the replication showing a slight edge in performance. Consequently, the replicated results is adopted as the baseline for comparison. The tables + +Table 1: The comparison of the visual token pruning methods with Vicuna-7B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens. + +
Method\( {\mathrm{{VQAV}}}^{2} \) [1]GQA [14]VisWiz [13]\( {\mathrm{{SQAI}}}^{3} \) [28]\( {\mathrm{{VQAT}}}^{3} \) [33]POPE [23]MME [9]MMB [27]MMBCN [27]SEED [19]LLaVAW \( {}^{2} \) [26]MM-Vet [40]Avg. \( \uparrow \)TFLOPs \( \downarrow \)
LLaVA-1.5-TB [25]78.562.050.066.858.285.975.564.358.358.663.430.562.715.4
LLaVA-1.5-TB* [25]79.162.749.067.858.686.372.866.259.358.563.731.763.015.4
Random sampling69.057.137.967.248.582.565.655.448.051.055.823.655.1 (-7.9)8.0 (-48.1%)
TopK72.458.147.066.952.583.867.163.355.254.559.226.558.9 (-4.1)8.0 (-48.1%)
Spatial pooling73.959.646.567.752.582.368.563.356.654.959.728.359.5 (-3.5)8.1 (-47.4%)
EViT [24]74.159.447.067.754.782.869.263.557.855.460.027.359.9 (-3.1)8.0 (-48.1%)
ToMe [4]75.160.047.167.555.382.470.463.956.555.260.526.660.0 (-3.0)8.0 (-48.1%)
Honeybee [5]74.859.047.267.850.984.068.761.657.855.259.427.159.5 (-3.5)8.1 (-47.4%)
LLaMA-VID [22]74.359.246.867.951.483.169.763.557.055.458.929.759.7 (-3.3)8.2 (-46.8%)
Qwen-VL [3]74.958.947.368.154.483.469.463.257.455.059.227.259.9 (-3.1)8.1 (-47.4%)
IVTP (Ours)77.860.447.967.858.285.772.666.157.456.462.830.562.0 (-1.0)8.2 (-46.8%)
+ +Table 2: The comparison of the visual token pruning methods with Vicuna-13B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens. + +
MethodVQAV2 [11]GQA [14]VisWiz [13]SQA1[28]VQAT[33]POPE [23]MME [9]MMB [27]MMBCN[27]SEED [19]LLVaW2[26]MM-Vet [40]Avg. ↑TFLOPs ↓
LLvA-1.5-13B [25]80.063.353.671.661.385.976.667.763.661.670.735.465.929.4
LLvA-1.5-13B* [25]80.063.454.570.460.086.478.468.363.160.869.436.866.029.4
Random sampling72.356.746.668.051.583.364.958.054.853.058.824.657.7 (-8.3)15.4 (47.5%)
TopK74.758.550.869.354.285.468.064.559.654.562.826.660.7 (-5.3)15.4 (47.5%)
Spatial pooling75.159.751.169.955.084.871.664.260.254.963.327.461.4 (-4.6)15.6 (46.9%)
EViT [24]77.260.253.470.157.984.673.665.360.155.464.928.662.6 (-3.4)15.4 (47.5%)
ToMe [4]76.961.453.970.157.685.373.165.061.256.065.932.663.3 (-2.7)15.4 (47.5%)
Honeybee [5]76.261.252.170.559.783.673.563.261.255.766.532.063.0 (-3.0)15.4 (47.5%)
LLvA-VID [22]76.561.752.970.457.283.374.464.260.555.266.032.762.9 (-3.1)15.5 (47.3%)
Qwen-VL [3]77.361.152.170.856.484.071.765.861.756.366.731.563.0 (-3.0)15.4 (47.5%)
IVTP (Ours)78.462.354.170.160.085.477.167.763.359.368.635.565.2 (-0.8)15.6 (46.9%)
+ +show that despite reducing visual tokens by approximately $88.9\%$ , the proposed method incurs an average performance decline of only about $1\%$ across 12 evaluation datasets, coupled with over $46\%$ reduction in computational demand. Our method exceeds the performance of other token pruning methods by over $2\%$ , despite incurring a slightly higher TFLOPs due to hierarchical token pruning in the LLM. Table 3 further illustrates the change in TFLOPs corresponding to an increase in text tokens from 128 to 1024. It is clear that as the number of text tokens reduced, the proportion of visual tokens becomes more significant, thereby intensifying their influence on the computational demands of the model. As a result, the effectiveness of visual token pruning in reducing computational demand becomes more evident. + +Inference-only Results. Since the proposed method does not need any extra modules that require parameter optimization, it can be seamlessly integrated with pre-trained models. This eliminates the need for retraining and simultaneously enhances computational efficiency during inference. Fig. 3 presents a performance comparison of various methods in a pure inference scenario when reducing the number of visual tokens from 16 to 512. As the number of target tokens decreases, the advantages of our proposed method become more pronounced. Notably, when the number of visual tokens is reduced to 16, our method surpasses other approaches by approximately $5\%$ . The proposed method guided by instruction semantics can more effectively maintain the task relevant visual information, thereby achieving better results. + +Table 3: Comparison results of TFLOPs across different methods as text token count varies from 128 to 1024. + +
Methods1282565121024
LLaVA-1.5-7B [25]9.911.715.422.9
TopK2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
ToMe [4]2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
Honeybee [5]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.4 (-32.8%)
Qwen-VL [3]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.3 (-33.2%)
IVTP (Ours)3.0 (-69.7%)4.7 (-59.8%)8.2 (-46.8%)15.5 (-32.3%)
+ +![](images/6dc69f5faae39958e47a2f14226119e8942b30b5ce7bd785f181246b18c45db8.jpg) +Fig. 3: Comparison of model performance with pure inference setting. + +# 4.3 Ablation and Analysis + +To analyze different setups of our IVTP, we perform extensive ablation studies. All the experiments are conducted with LLaVA-1.5-7B [25] as the backbone, and report the average accuracy across the aforementioned 12 evaluation datasets in both retraining mode and pure inference mode (PI). + +Attention Rollout. As outlined in Sec. 3.2, we organize several contiguous layers into a group and apply attention rollout through the residual aggregation of intra-group attention weights. This process is intended to simulate the flow of information through hidden layer features, thereby yielding more reliable and effective attention weights for assessing the significance of visual patch tokens. Table 4 shows that substituting the group-wise attention rollout with a variant that uses only the CLS token's attention weight of current layer results in a performance decrease of $4.5\%$ in pure inference mode and $3.9\%$ in retraining mode. When switching from group-wise to layer-wise, the performance is improved, yet there is still a noticeable gap compared to the method using group-wise attention rollout. Although the proposed method requires to prune a greater number of tokens each time compared to layer-wise, it achieves better results with similar TFLOPs. This improvement is due to the more stable and efficient aggregation of attention, where the attention scores can more accurately reflect the contribution of patch tokens. Table 5 delves deeper into the impact of different attention information aggregation strategies. We evaluate several approaches for aggregating attention weights produced by different layers within a group, such as averaging, selecting the maximum, and implementing element-wise multiplication. The finding demonstrates that the residual method employed in our approach yields superior performance, owing to its improved alignment with the forward propagation of visual tokens. + +Instruction Guided Selection. Another fundamental component of the proposed approach is the further selection of visual tokens guided by textual instructions, as elaborated in Sec. 3.3. To validate the effectiveness of this module, we also perform a series of ablation studies, which are presented in Table 6. As shown in the first row of the table, the attention weights of the visual + +Table 4: Ablation study of the weights of attention rollout and vanilla attention. The metrics for comparison with the original LLaVA-1.5-7B are indicated in parentheses. + +
ModelAvg. Acc (PI)Avg. AccTFLOPs
Group-wise55.1 (-7.9)58.1 (-4.9)8.2 (-46.8%)
Layer-wise56.2 (-6.8)59.5 (-3.5)8.2 (-46.8%)
Rollout59.6 (-3.4)62.0 (-1.0)8.2 (-46.8%)
+ +Table 5: Comparison with different attention weights aggregation strategies. + +
ModelAvg. Acc (PI)Avg. Acc
mean56.1 (-6.9)60.1 (-2.9)
max55.9 (-7.1)60.7 (-2.3)
multiply56.7 (-6.3)60.5 (-2.5)
Residual59.6 (-3.4)62.0 (-1.0)
+ +Table 6: Ablation study of instruction guided selection. 'OTT', 'TE', and 'RT' refer to original textual tokens, CLIP text encoder, and relevance threshold, respectively. + +
OTTTERTAvg.Acc (PI)Avg.ACC
56.7(-6.3)59.2(-3.8)
✓58.3(-4.7)60.2(-2.8)
✓✓57.3(-5.7)59.9(-3.1)
✓✓✓59.6(-3.4)62.0(-1.0)
+ +Table 7: ${}^{ + }$ Extending token pruning to LLM with other methods. + +
ModelAvg. Acc (PI)Avg. Acc
TopK54.1 (-8.9)58.9 (-4.1)
TopK+54.9 (-8.1)58.7 (-4.3)
ToMe [4]57.5 (-5.5)60.0 (-3.0)
ToMe+57.7 (-5.3)60.1 (-2.9)
IVTP-V58.5 (-4.5)60.8 (-2.2)
IVTP59.6 (-3.4)62.0 (-1.0)
+ +CLS token are used as the foundation for token selection within the LLM, establishing the baseline for these experiments. We then aggregate the original textual instruction tokens into a pseudo CLS token via average pooling to steer the token selection process. This approach yields a significant improvement over the baseline, demonstrating that guiding the pruning of visual tokens with textual instructions effectively isolates instruction-relevant visual patches through cross-modal associations, thus further reducing the number of required visual tokens. To minimize the influence of irrelevant noise in the textual instructions, we introduced a relevance threshold to selectively extracts key textual tokens. However, due to the lack of associative contrastive training between the visual CLS token and the original textual tokens of LLM, directly calculating vector correlation and applying a threshold for filtration is insufficient for isolating key textual tokens. The last row of the table demonstrates that integrating the CLIP text encoder, which naturally excels in image-text alignment, enables the precise identification of relevant sections within the textual tokens. + +Pruning in LLM. We also extend our two-stage visual token pruning to TopK and ToMe [4], denoted as $\mathrm{TopK^{+}}$ and $\mathrm{ToMe^{+}}$ in Table 7, respectively. For a direct comparison, we apply the proposed method solely to the visual encoder, indicated as IVTP-V in the table. It calculation that extending the purely visual methods to LLM does not yield significant improvements. This is because performing token pruning solely within visual patches through representational + +Table 8: Comparison with the numbers of layers in token pruning groups. + +
LayersAvg.Acc (PI)Avg.Acc
ALL56.7(-6.3)58.2(-4.8)
258.8(-4.2)60.1(-2.9)
359.6(-3.4)62.0(-1.0)
459.1(-3.9)61.5(-1.5)
658.6(-4.4)59.9(-3.1)
+ +Table 9: Computational complexity with different methods (TFLOPs). + +
MethodsViTLLMextraTotal
LLaVA-1.5-7B [25]0.36115.003-15.364
TopK0.1907.772-7.962
ToMe [4]0.1907.772-7.962
Qwen-VL [3]0.3607.7720.0038.135
IVTP (our)0.2027.9460.0808.228
+ +![](images/81d9bb336254f5cd5cddab7aedd2fa674914e7a53dca0fdfd5b7db05029b9b29.jpg) +Fig. 4: Performance comparison with token pruning scaling. We show the average accuracy over all 12 benchmarks with the target number of visual tokens varying from 16 to 512 under comparable TFLOPs. + +similarity fails to address the scenario with sparse target tokens. Rather than applying the token pruning from the visual encoder to the LLM directly, we select relevant visual tokens based on the diverse instructions. + +Scaling the Token Pruning. Figure 4 illustrates the trade-off between TFLOPs and average accuracy by adjusting the final count of visual tokens from 576 down to a range between 16 and 512. The trend shown in the figure indicates that when the final number of visual tokens is reduced to between 256 and 512, the performance of most methods are nearly identical to those of the original model. The proposed method even slightly exceeds the original model while achieving a $10\%$ to $30\%$ reduction in TFLOPs. This suggests that reducing the number of visual tokens to an optimal level can not only preserve essential visual information but also minimizes interference from irrelevant visual tokens. As the number of visual tokens is further reduced, relying solely on the relevance and uniqueness of patch tokens becomes inadequate for preserving visual information. To overcome this limitation, the proposed method introduces an instruction-guided mechanism that adaptively selects visual tokens highly relevant to the specific given prompt, thereby completing VQA tasks with fewer visual tokens. + +Group Layers. We vary the number of layers in each token pruning group, with a specific focus on the scenario in which all layers of the ViT and all the first 12 layers of the LLM are employed. Table 8 shows the optimal performance is achieved with each group consists of three layers. Groups comprising fewer layers yield less effective attention rollout aggregation, whereas groups with more layers require pruning more tokens, hindering the layer-wise interaction within tokens. + +Computational complexity. Table 9 shows the comparison of computational complexity among different models. We itemize the computational costs of the + +![](images/95a95625d696e98f649cbc465ee57c8fe780f18c7f8ca7001273365b7a222e6a.jpg) +Fig. 5: Visualization of the visual token pruning results. Each sample, viewed from left to right, consists of the raw image, the token pruning by the TopK, and the token pruning by the proposed method, respectively. + +visual encoder, LLM and extra structures separately to provide a detailed breakdown. It is clear that the LLM contributes the most to the overall computational complexity of the LVLM, due to its significantly higher number of parameters compared to the ViT and other supplementary structures. Consequently, the disparities in TFLOPs observed with purely visual methods are not discernible when these methods are incorporated into the LVLMs. Although our method inputs more visual tokens into the LLM compared to other pruning methods, by limiting pruning to the initial 12 layers of the LLM, we manage to keep the computational complexity within $2\%$ of that achieved by single-stage approaches. Visualizations. We further visualize the results of token pruning for a more intuitive understanding in Fig. 5. key textual tokens are highlighted in the instruction text and discarded visual tokens are masked in the input image. Our observations indicate that the proposed method excels at precisely identifying essential textual tokens related to visual content and adeptly preserving the most relevant visual tokens aligned with the semantics of diverse instructions. + +# 5 Conclusion + +This paper presents a visual token pruning technique for Large Vision-Language Models (LVLMs). It introduces a group-wise token pruning (GTP) module aimed at improving the stability and robustness of patch token importance assessment within a frozen visual encoder of LVLMs. The proposed method extends the designed GTP module to LLM with incorporating instruction semantics as guidance, thereby discarding irrelevant visual tokens based on instructional preferences. Comprehensive experiments and in-depth ablation studies show that the proposed method can prune more visual tokens with minimal loss of accuracy, as well as accelerate the training and inference of LVLMs. The reduction of visual tokens can also be transferred to multi-image or video tasks in LVLMs to boost their performance, which will be a key focus of our future work. + +# References + +1. Abnar, S., Zuidema, W.: Quantifying attention flow in transformers. arXiv preprint arXiv:2005.00928 (2020) 2, 6 +2. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023) 3 +3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A frontier large vision-language model with versatile abilities. arXiv preprint arXiv:2308.12966 (2023) 1, 2, 3, 9, 10, 11, 13 +4. Bolya, D., Fu, C.Y., Dai, X., Zhang, P., Feichtenhofer, C., Hoffman, J.: Token merging: Your vit but faster. In: The Eleventh International Conference on Learning Representations (2022) 2, 4, 6, 9, 10, 11, 12, 13 +5. Cha, J., Kang, W., Mun, J., Roh, B.: Honeybee: Locality-enhanced projector for multimodal llm. arXiv preprint arXiv:2312.06742 (2023) 9, 10, 11 +6. Chefer, H., Gur, S., Wolf, L.: Transformer interpretability beyond attention visualization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 782-791 (2021) 6 +7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 3 +8. Fayyaz, M., Koohpayegani, S.A., Jafari, F.R., Sengupta, S., Joze, H.R.V., Sommerlade, E., Pirsiavash, H., Gall, J.: Adaptive token sampling for efficient vision transformers. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 396-414. Springer (2022) 2, 4, 6 +9. Fu, C., Chen, P., Shen, Y., Qin, Y., Zhang, M., Lin, X., Yang, J., Zheng, X., Li, K., Sun, X., et al.: Mme: A comprehensive evaluation benchmark for multimodal large language models. arXiv preprint arXiv:2306.13394 (2023) 9, 10 +10. Goyal, S., Choudhury, A.R., Raje, S., Chakaravarthy, V., Sabharwal, Y., Verma, A.: Power-bert: Accelerating bert inference via progressive word-vector elimination. In: International Conference on Machine Learning. pp. 3690-3699. PMLR (2020) 3 +11. Goyal, Y., Khot, T., Summers-Stay, D., Batra, D., Parikh, D.: Making the v in vqa matter: Elevating the role of image understanding in visual question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6904-6913 (2017) 10 +12. Guo, Y., Zhang, H., Nie, L., Wong, Y., Kankanhalli, M.: Elip: Efficient language-image pre-training with fewer vision tokens. arXiv preprint arXiv:2309.16738 (2023) 4 +13. Gurari, D., Li, Q., Stangl, A.J., Guo, A., Lin, C., Grauman, K., Luo, J., Bigham, J.P.: Vizwiz grand challenge: Answering visual questions from blind people. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3608-3617 (2018) 10 +14. Hudson, D.A., Manning, C.D.: Gqa: A new dataset for real-world visual reasoning and compositional question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6700-6709 (2019) 10 +15. Jiang, C., Xu, H., Ye, W., Ye, Q., Li, C., Yan, M., Bi, B., Zhang, S., Huang, F., Huang, S.: Bus: Efficient and effective vision-language pre-training with bottom-up patch summarization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2900-2910 (2023) 4 + +16. Kim, G., Cho, K.: Length-adaptive transformer: Train once with length drop, use anytime with search. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing. pp. 6501-6511 (2021) 3 +17. Kim, S., Shen, S., Thorsley, D., Gholami, A., Kwon, W., Hassoun, J., Keutzer, K.: Learned token pruning for transformers. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 784-794 (2022) 3 +18. Kong, Z., Dong, P., Ma, X., Meng, X., Niu, W., Sun, M., Shen, X., Yuan, G., Ren, B., Tang, H., et al.: Spvit: Enabling faster vision transformers via latency-aware soft token pruning. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 620-640. Springer (2022) 4, 6 +19. Li, B., Wang, R., Wang, G., Ge, Y., Ge, Y., Shan, Y.: Seed-bench: Benchmarking multimodal llms with generative comprehension. arXiv preprint arXiv:2307.16125 (2023) 10 +20. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023) 1, 2, 3 +21. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022) 4, 9 +22. Li, Y., Wang, C., Jia, J.: Llama-vid: An image is worth 2 tokens in large language models. arXiv preprint arXiv:2311.17043 (2023) 1, 2, 3, 9, 10 +23. Li, Y., Du, Y., Zhou, K., Wang, J., Zhao, W.X., Wen, J.R.: Evaluating object hallucination in large vision-language models. arXiv preprint arXiv:2305.10355 (2023) 10 +24. Liang, Y., Chongjian, G., Tong, Z., Song, Y., Wang, J., Xie, P.: Evit: Expediting vision transformers via token reorganizations. In: International Conference on Learning Representations (2021) 2, 4, 9, 10 +25. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. arXiv preprint arXiv:2310.03744 (2023) 3, 4, 9, 10, 11, 13 +26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024) 1, 3, 10 +27. Liu, Y., Duan, H., Zhang, Y., Li, B., Zhang, S., Zhao, W., Yuan, Y., Wang, J., He, C., Liu, Z., et al.: Mmbench: Is your multi-modal model an all-around player? arXiv preprint arXiv:2307.06281 (2023) 10 +28. Lu, P., Mishra, S., Xia, T., Qiu, L., Chang, K.W., Zhu, S.C., Tafjord, O., Clark, P., Kalyan, A.: Learn to explain: Multimodal reasoning via thought chains for science question answering. Advances in Neural Information Processing Systems 35, 2507-2521 (2022) 10 +29. OpenAI: Chatgpt. https://openai.com/blog/chatgpt/, 2023. 1, 2 (2023) 3 +30. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 2 +31. Rao, Y., Zhao, W., Liu, B., Lu, J., Zhou, J., Hsieh, C.J.: Dynamicvit: Efficient vision transformers with dynamic token sparsification. Advances in neural information processing systems 34, 13937-13949 (2021) 2, 4, 6 +32. Sennrich, R., Haddow, B., Birch, A.: Neural machine translation of rare words with subword units. arXiv preprint arXiv:1508.07909 (2015) 7 + +33. Singh, A., Natarajan, V., Shah, M., Jiang, Y., Chen, X., Batra, D., Parikh, D., Rohrbach, M.: Towards vqa models that can read. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8317-8326 (2019) 10 +34. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al.: Llama: Open and efficient foundation language models. arXiv preprint arXiv:2302.13971 (2023) 3 +35. Wei, S., Ye, T., Zhang, S., Tang, Y., Liang, J.: Joint token pruning and squeezing towards more aggressive compression of vision transformers. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2092-2101 (2023) 4 +36. Wu, X., Zeng, F., Wang, X., Wang, Y., Chen, X.: Ppt: Token pruning and pooling for efficient vision transformers. arXiv preprint arXiv:2310.01812 (2023) 4 +37. Xu, Y., Zhang, Z., Zhang, M., Sheng, K., Li, K., Dong, W., Zhang, L., Xu, C., Sun, X.: Evo-vit: Slow-fast token evolution for dynamic vision transformer. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 2964-2972 (2022) 4 +38. Ye, D., Lin, Y., Huang, Y., Sun, M.: Tr-bert: Dynamic token reduction for accelerating bert inference. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5798-5809 (2021) 3 +39. Yin, H., Vahdat, A., Alvarez, J.M., Mallya, A., Kautz, J., Molchanov, P.: A-vit: Adaptive tokens for efficient vision transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10809-10818 (2022) 2, 4 +40. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023) 10 +41. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023) 1, 3 \ No newline at end of file diff --git a/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/images.zip b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..030384b6635c19f76b1b42d935576383b676ab88 --- /dev/null +++ b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9515d53db8eec56e0b667cc47a5cafb572bc52b9d37bac0e87f8104b111e4226 +size 456139 diff --git a/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/layout.json b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..52f4b539d2f115cb527150bab9528f8d2aa333ac --- /dev/null +++ b/2024/IVTP_ Instruction-guided Visual Token Pruning for Large Vision-Language Models/layout.json @@ -0,0 +1,7247 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 140, + 111, + 475, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 111, + 475, + 148 + ], + "spans": [ + { + "bbox": [ + 140, + 111, + 475, + 148 + ], + "type": "text", + "content": "IVTP: Instruction-guided Visual Token Pruning for Large Vision-Language Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 149, + 168, + 463, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 168, + 463, + 181 + ], + "spans": [ + { + "bbox": [ + 149, + 168, + 463, + 181 + ], + "type": "text", + "content": "Kai Huang*, Hao Zou*, Ye Xi, BoChen Wang, Zhen Xie, and Liang Yu" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 173, + 190, + 438, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 190, + 438, + 224 + ], + "spans": [ + { + "bbox": [ + 173, + 190, + 438, + 224 + ], + "type": "text", + "content": "Alibaba Group, China \n{zhouwan.hk, zh372956, yx150449, bochen.wbc, xiezhen.xz, liangyu.yl}@alibaba-inc.com" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "spans": [ + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "text", + "content": "Abstract. Inspired by the remarkable achievements of Large Language Models (LLMs), Large Vision-Language Models (LVLMs) have likewise experienced significant advancements. However, the increased computational cost and token budget occupancy associated with lengthy visual tokens pose significant challenge to the practical applications. Considering that not all visual tokens are essential to the final response, selectively pruning redundant visual tokens can effectively alleviate this challenge. In this paper, we present a novel Instruction-guided Visual Token Pruning (IVTP) approach for LVLMs, which is designed to strike a better balance between computational efficiency and the performance. Specifically, a Group-wise Token Pruning (GTP) module based on attention rollout is integrated into the grouped transformer layer to achieve intra-group attention aggregation via residual connection, thereby improving the assessment of visual token importance, especially for LVLMs with a frozen visual encoder. We then extend the module to LLM in order to further filter out visual tokens that are pertinent to the current textual instructions, by introducing a semantically related pseudo CLS token to serve as a reference for token pruning. This two-stage token pruning mechanism permits a systematic and efficient reduction in the quantity of visual tokens while preserving essential visual information. We apply the proposed method to the most representative LVLM, i.e. LLaVA-1.5. Experimental results demonstrate that when the number of visual tokens is reduced by " + }, + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "inline_equation", + "content": "88.9\\%" + }, + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "text", + "content": ", the computational complexity is decreased by over " + }, + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "inline_equation", + "content": "46\\%" + }, + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "text", + "content": ", with only an average " + }, + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "inline_equation", + "content": "1.0\\%" + }, + { + "bbox": [ + 160, + 255, + 452, + 529 + ], + "type": "text", + "content": " accuracy drop across 12 benchmarks, and remarkably surpasses the state-of-the-art token pruning methods." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 539, + 468, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 539, + 468, + 552 + ], + "spans": [ + { + "bbox": [ + 160, + 539, + 468, + 552 + ], + "type": "text", + "content": "Keywords: Visual Token Pruning, Large Vision-Language Models (LVLMs)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 572, + 230, + 585 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 572, + 230, + 585 + ], + "spans": [ + { + "bbox": [ + 132, + 572, + 230, + 585 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "content": "Large Vision-Language Models (LVLMs) have garnered widespread interest from both the academic and industrial communities due to their impressive ability in handling cross-modality tasks [3,20,22,26,41]. Despite the remarkable progress of LVLMs, they still face challenges of high computational costs caused by lengthy" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 134, + 654, + 223, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 654, + 223, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 654, + 223, + 665 + ], + "type": "text", + "content": "* Equal contribution." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "content": "image tokens. As a result, considerable works have been devoted to optimizing the trade-off between computational efficiency and model effectiveness in large models. To reduce the number of image tokens fed into Large Language Models (LLMs), some approaches [3,20,22] employ a trainable token compression module placed after the visual encoder, as shown in Fig. 1(a). Though capable of effectively pruning redundant visual tokens, the above methods are often tightly coupled with the model architecture, and the effectiveness of these structures often lacks comprehensive validation, which makes them difficult to transfer to other model frameworks. Building on the advancements in token pruning for traditional visual tasks [4,8,24,31,39], one direct approach is to adapt these existing vision-only pruning methods to LVLMs, where token pruning is performed only in the visual encoder, as shown in Fig. 1(b). Although these methods are transferable, the standard practice of freezing the visual encoder in LVLMs prevents the pruning process from being optimized end-to-end with the training of the LVLMs, consequently suffering from suboptimal stability." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 307, + 272, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 307, + 272, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 307, + 272, + 462 + ], + "type": "text", + "content": "In this work, we propose an Instruction-guided Visual Token Pruning (IVTP) method to address the aforementioned issues, achieving a balance between accuracy and computational efficiency while also offering improved transferability and stability. As illustrated in Fig. 1(c), we divide the visual token pruning into two stages. The first stage is similar to vision-only token pruning, where re" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 462, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 482, + 668 + ], + "type": "text", + "content": "dundant visual tokens with low informative content are eliminated in the ViT based on the attention connections within tokens. The second stage occurs within the LLM, it aims to remove visual tokens that exhibit a low correlation with the current textual instructions. Specifically, we determine the significance of each patch token by calculating its attentiveness in relation to the CLS token within the visual encoder. In order to ensure that the importance assessment of visual tokens remains effective within a frozen ViT, a Group-wise Token Pruning (GTP) module based on attention rollout [1] is proposed to integrate into the grouped visual transformer layers to achieve hierarchical attention weight aggregation. However, the continuous decrease in visual tokens results in less visual information being conveyed to the LLM, hindering its ability to follow diverse and variable visual instructions. To adaptively adjust the visual information contained by visual patch tokens according to different instructions, we further integrate the GTP into the LLM for instruction-guided visual token pruning. Since decoder-only LLMs do not incorporate a CLS token to represent text semantics, aggregating all textual tokens indiscriminately may introduce noise information that is not referred to image. The text encoder branch of CLIP [30], aligned with" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 280, + 304, + 480, + 407 + ], + "blocks": [ + { + "bbox": [ + 280, + 304, + 480, + 407 + ], + "lines": [ + { + "bbox": [ + 280, + 304, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 280, + 304, + 480, + 407 + ], + "type": "image", + "image_path": "ec66c7f91381c9eded6a97a02d646a702fddecd1ee1956ccc49d4d268610e7ed.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 279, + 418, + 482, + 440 + ], + "lines": [ + { + "bbox": [ + 279, + 418, + 482, + 440 + ], + "spans": [ + { + "bbox": [ + 279, + 418, + 482, + 440 + ], + "type": "text", + "content": "Fig.1: Comparison of different token pruning schemes for LVLMs." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 480, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 480, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 480, + 163 + ], + "type": "text", + "content": "the visual encoder of LVLMs, is introduced to filter out irrelevant textual tokens by calculating the token-wise relevance with the visual CLS token. Text tokens that match to the visual content are aggregated to form a textual pseudo CLS token so that the GTP module can be extended to LLM." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 482, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 482, + 332 + ], + "type": "text", + "content": "Our main contributions are: (1) We present a novel two-stage visual token pruning method for LVLMs, which can significantly reduce the visual tokens while preserving essential visual information, leading to a substantial increase in model computational efficiency with minimal loss of accuracy. (2) We propose a module that can work compatibly both within the ViT and the LLM, named Group-wise Token Pruning (GTP). Benefiting from the aggregation of attention weights based on attention rollout within groups across layers, the importance assessment of visual tokens is more robust and precise. Furthermore, a textual pseudo CLS gathered from visual relevant textual tokens, is used in GTP to introduce instruction preferences, thereby filtering out semantically irrelevant visual patch tokens and further compressing the number of visual tokens. (3) We introduce the IVTP to LLaVA-1.5 [25], the extensive experimentation on 12 standard benchmarks demonstrate that the proposed method achieves a superior trade-off between accuracy and computational efficiency." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 351, + 237, + 364 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 351, + 237, + 364 + ], + "spans": [ + { + "bbox": [ + 132, + 351, + 237, + 364 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 378, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 605 + ], + "type": "text", + "content": "Large Vision-Language Models. Inspired by the success of LLMs [2, 29, 34], recent advancements in LVLMs have also demonstrated satisfying performance, such as [3, 22, 26, 41]. These approaches typically combine a pre-trained visual encoder with an LLM, enabling the LLM to handle multimodal data involving images. Furthermore, to align the multimodal data, a projection layer is appended after the visual encoder, such as a Q-former, linear mapping, or cross attention. BLIP2 [20] achieves stronger performance at a lower computation cost by freezing the visual encoder and LLM and only updating the weights of Q-former, which serves as the bridge for the modality gap. LLaVA [26] utilizes multimodal language-image instruction-following data generated by GPT-4 [2] for visual instruction tuning. Visual instruction tuning enables the LLaVA to accommodate users' diverse requests for instructions that involve visual content. During the training phase, QWen-VL [3] enhances the performance of model by updating the parameters of the visual encoder and utilizing higher-resolution images. Although increasing the number of model parameters and the resolution of input images can effectively improve the performance of LLMs, the computational cost that they bring cannot be ignored. Our proposed ITVP can be directly integrated into a LVLM without training, reducing the computational cost of the LVLM by pruning redundant image tokens." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "type": "text", + "content": "Token Pruning. Token pruning aims to retain attentive tokens and prune inattentive ones by designing importance evaluation strategies to create more efficient transformers in both natural language processing (NLP) and Computer Vision (CV). Benefiting from the success of BERT [7], many works [10, 16, 17, 38] in the NLP field have achieved text token pruning based on BERT, but these" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 403 + ], + "type": "text", + "content": "methods require training and are difficult to adapt to the current LLMs. In the CV field, a classic method is DynamicViT [31], which inserts a trainable prediction module into the transformer to predict the importance score of each token. Subsequent works [8, 39] go further by sampling tokens with an input-dependent number. To address the issue of information loss in token pruning, [18, 24, 37] retain inattentive tokens by collapsing the pruned tokens into one through token reorganization. The above methods perform token pruning based on importance scores, but tokens that are close in the feature space will be assigned similar scores, leading to the possibility that similar tokens may be simultaneously retained or removed. Another classic approach is ToMe [4], which achieves token pruning by calculating the similarity between different tokens and merging tokens with high similarity. However, merging tokens can cause image distortion, making it difficult for the model to capture fine-grained information. Recent approaches [35, 36] attempt to mitigate the shortcomings of both types by combining the two methods, but how to effectively combine them remains an area for exploration. Based on [21], recent studies [12, 15] simultaneously utilize the CLS token of the visual branch and the CLS token of the text branch to implement image token pruning. The aforementioned methods of directly incorporating all textual information to guide the selection of visual tokens may introduce additional noise information, potentially causing instability in token selection. In this paper, we utilize the text branch of the CLIP to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 422, + 233, + 435 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 422, + 233, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 422, + 233, + 435 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 482, + 555 + ], + "type": "text", + "content": "This research represents a preliminary effort to investigate the visual token pruning for LVLMs that achieves an optimal balance among performance, speed, cost and numbers of visual tokens. As shown in Fig. 2, our method is fundamentally based on established LVLMs, such as LLaVA-1.5 [25], which are succinctly reviewed in Sec. 3.1. Sec. 3.2 delves into the details of group-wise token pruning that leverages attention rollout to facilitate coarse-grained pruning within visual transformers. In Sec. 3.3, we further demonstrate the visual token pruning in LLMs guided by textual instruction. Finally, details of the two-stage manner applied to the ViT and LLM of LVLMs are presented in Sec. 3.4." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 571, + 369, + 583 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 571, + 369, + 583 + ], + "spans": [ + { + "bbox": [ + 132, + 571, + 369, + 583 + ], + "type": "text", + "content": "3.1 Revisit of Large Vision-Language Models" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 590, + 481, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 481, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 481, + 628 + ], + "type": "text", + "content": "The mechanism of a LLM is complex and involves multiple layers of neural networks. Mathematically, a simplified conceptual representation could be expressed through the following formula:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 207, + 635, + 481, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 207, + 635, + 481, + 669 + ], + "spans": [ + { + "bbox": [ + 207, + 635, + 481, + 669 + ], + "type": "interline_equation", + "content": "p (\\mathbf {X}) = \\prod_ {i = 1} ^ {M} p \\left(x _ {i} ^ {L} \\mid x _ {1} ^ {V}, \\dots , x _ {F} ^ {V}, x _ {1} ^ {L}, \\dots , x _ {i - 1} ^ {L}; \\Theta\\right), \\tag {1}", + "image_path": "c92a14a743c7c6c00209faf3561b027232fe0183ce84675d900001ffa1e0126c.jpg" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 342, + 278 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 342, + 278 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 342, + 278 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 342, + 278 + ], + "type": "image", + "image_path": "2550924eef1300820adca22d87c0917dd00b4696c63e53c7d393b4b51221e3e9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 286, + 482, + 374 + ], + "lines": [ + { + "bbox": [ + 130, + 286, + 482, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 286, + 482, + 374 + ], + "type": "text", + "content": "Fig. 2: Overview of Instruction-guided Visual Token Pruning (IVTP) for large vision-language models. The entire process is divided into two stages: The first stage takes place within the visual encoder of the LVLM, where a Group-wise Token Pruning (GTP) module is employed to discard redundant tokens with low informative content based on the inherent visual CLS token in ViT. The second stage operates on the first " + }, + { + "bbox": [ + 130, + 286, + 482, + 374 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 286, + 482, + 374 + ], + "type": "text", + "content": " layers of the LLM, in which we aggregate text instructions into a textual CLS token by introducing a frozen CLIP text encoder, and once again integrate GTP to remove visual tokens with low relevance to the current query." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 342, + 114, + 481, + 278 + ], + "blocks": [ + { + "bbox": [ + 342, + 114, + 481, + 278 + ], + "lines": [ + { + "bbox": [ + 342, + 114, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 342, + 114, + 481, + 278 + ], + "type": "image", + "image_path": "38adcc0ee3cba2d3bada9936c9cc67c4d13f5e2a52b23999138887e4c8f843a7.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "p(\\mathbf{X})" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " represents the joint probability distribution of the entire sequence, and " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_{i}" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " denotes the " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": "th token in the sequence. However, unlike the uniform token type in the standard LLMs, the input to the LLM in LVLMs consists of both visual tokens " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x^{V}" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " and language tokens " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x^{L}" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": ". It predicts the next language token given the complete set of " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " visual tokens and the preceding " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "i - 1" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " language tokens. Generally, the visual tokens of an image are derived from the flattened grid features with a visual encoder, which are then mapped into the word embedding space. An image with a resolution of 336px results in 576 tokens when using ViT-L/14 as the visual transformer. Handling such a high number of tokens becomes challenging under the standard LLM's input limit of 2048 tokens. This limitation not only results in increased training and inference time consumption for LVLMs but also restricts the ability to process higher resolution or multiple images within the limited token budget." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 573, + 297, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 573, + 297, + 586 + ], + "spans": [ + { + "bbox": [ + 131, + 573, + 297, + 586 + ], + "type": "text", + "content": "3.2 Group-wise Token Pruning" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Similar to vision-only pruning approaches, we aim to evaluate the significance of each patch token by examining their importance scores in LVLMs, which allows us to selectively prune patch tokens with minimal influence. Existing token pruning methods relied on importance scores are typically conducted in an incremental layer-specific manner, in which each layer prunes a certain number of tokens according to its importance scores, cumulatively achieving the overall to" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 282 + ], + "type": "text", + "content": "ken reduction goal. However, assessing token significance solely based on importance score from individual layer introduces a considerable amount of instability. It is essential to retrain the ViT to optimize the aggregation of patch information, while this makes it challenging in LVLMs as the visual encoder is typically kept frozen. To mitigate this, we employ an attention rollout mechanism [1] to derive group-wise token importance metric based on the aggregated attention weights across successive layers, which takes into account the inter-layer transfer of attention information. Compared to the original single-layer attention, the importance scores obtained from the attention with attention rollout exhibit a higher correlation with contributions to the prediction output. In NLP prediction tasks and visual visualization based on the transformer [1,6], the attention derived from attention rollout has been proven to be more stable and effective. Consequently, we intend to incorporate it into visual token pruning to enhance token decision-making for the frozen ViT." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "text", + "content": "In the transformer architecture, the attention weight " + }, + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "inline_equation", + "content": "A" + }, + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "text", + "content": " in the self-attention layer is calculated by the scaled dot product of the queries " + }, + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "inline_equation", + "content": "\\mathbf{Q} \\in \\mathbb{R}^{(N + 1)\\times d}" + }, + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "text", + "content": " and keys " + }, + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "inline_equation", + "content": "\\mathbf{K} \\in \\mathbb{R}^{(N + 1)\\times d}" + }, + { + "bbox": [ + 130, + 283, + 482, + 319 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 195, + 323, + 480, + 338 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 195, + 323, + 480, + 338 + ], + "spans": [ + { + "bbox": [ + 195, + 323, + 480, + 338 + ], + "type": "interline_equation", + "content": "\\mathbf {A} = \\operatorname {S o f t m a x} \\left(\\mathbf {Q} \\mathbf {K} ^ {T} / \\sqrt {d} + \\mathbf {A} _ {\\text {m a s k}}\\right) \\in \\mathbb {R} ^ {(N + 1) \\times (N + 1)}, \\tag {2}", + "image_path": "3c2870912f8207bbe3352f76e06a1eeced4d1aee75b29716a9b99b5ab42f1a41.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "inline_equation", + "content": "\\mathbf{A}_{\\mathrm{mask}}" + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "text", + "content": " is the attention mask, which is None in the visual encoder and a causal matrix in the LLMs, " + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "text", + "content": " is the number of patch tokens and " + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "text", + "content": " is the embedding dimension. As previously described, we perform the attention rollout to better model the transfer of attention across layers by considering the residual connections within the network, thereby rendering the attention-based token importance assessment more reliable. Specifically, it adds an identity matrix to the attention matrix and subsequently re-normalizing the weights. To integrate the attention spanning from layer " + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "inline_equation", + "content": "l_{1}" + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "text", + "content": " to layer " + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "inline_equation", + "content": "l_{2}" + }, + { + "bbox": [ + 130, + 344, + 482, + 453 + ], + "type": "text", + "content": ", a recursive multiplication is applied to the attention weights across all the corresponding range of layers as:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 225, + 456, + 480, + 489 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 456, + 480, + 489 + ], + "spans": [ + { + "bbox": [ + 225, + 456, + 480, + 489 + ], + "type": "interline_equation", + "content": "\\tilde {\\mathbf {A}} ^ {l} = \\left\\{ \\begin{array}{l l} \\mathbf {A} ^ {l _ {1}}, & \\text {i f} l = l _ {1}, \\\\ \\left(\\mathbf {A} ^ {l} + \\mathbf {I}\\right) \\tilde {\\mathbf {A}} ^ {l - 1}, & \\text {i f} l _ {1} < l \\leq l _ {2}. \\end{array} \\right. \\tag {3}", + "image_path": "43784df504b8fd48c2388045c4e72599fd0038d41b20801e68c3ece89bde01c3.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "content": "The re-normalize operation is omitted to simplify the formula. To preserve the exceptional traits of hierarchical token pruning [4, 18, 31], we divide the entire network into groups. Within each group, we perform attention rollout to aggregate attention information from adjacent layers, and execute token pruning at the topmost layer of each group. Similar to [8], the normalized values of patch tokens " + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathbf{V} \\in \\mathbb{R}^{N \\times d}" + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "content": " are weighted by their corresponding entries in the CLS row of the attention matrix, taking into account both the positions and the corresponding strength of activation. The final importance score of " + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "content": "th patch " + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "inline_equation", + "content": "S_{i}" + }, + { + "bbox": [ + 130, + 493, + 482, + 601 + ], + "type": "text", + "content": " is derived from the normalization as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 235, + 604, + 480, + 635 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 604, + 480, + 635 + ], + "spans": [ + { + "bbox": [ + 235, + 604, + 480, + 635 + ], + "type": "interline_equation", + "content": "\\mathcal {S} _ {i} = \\frac {\\tilde {\\mathbf {A}} _ {\\mathrm {c l s} , i} \\times \\| \\mathbf {V} _ {i} \\|}{\\sum_ {j} \\tilde {\\mathbf {A}} _ {\\mathrm {c l s} , j} \\times \\| \\mathbf {V} _ {j} \\|} \\in \\mathbb {R} ^ {1 \\times N}, \\tag {4}", + "image_path": "caa68611a2ca6c46cd0c3c16a701cdec4825fe7b99d045f3879a9790dabfad76.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 640, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 640, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 640, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 640, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\tilde{\\mathbf{A}}_{\\mathrm{cls}}" + }, + { + "bbox": [ + 130, + 640, + 482, + 666 + ], + "type": "text", + "content": " represents the row from the attention weight matrix associated with the CLS token, after excluding the CLS token itself. By ranking the patch tokens" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "according to their corresponding importance scores, we can selectively discard those low importance patch tokens within each group." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 159, + 373, + 171 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 159, + 373, + 171 + ], + "spans": [ + { + "bbox": [ + 131, + 159, + 373, + 171 + ], + "type": "text", + "content": "3.3 Instruction-guided Token Pruning in LLM" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 179, + 480, + 298 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 179, + 480, + 298 + ], + "spans": [ + { + "bbox": [ + 130, + 179, + 480, + 298 + ], + "type": "text", + "content": "As the number of remaining patch tokens diminishes, the granularity of information preserved by the visual patch tokens also decreases. This reduction is inconsequential for standard visual token pruning methods, which are predominantly applied to classification tasks focused on extracting salient subject information. Moreover, hierarchical pruning provides an opportunity for the CLS token to aggregate information from patch tokens before they are dropped, thereby mitigating potential information loss. LVLMs are tasked with extracting pertinent detailed information from visual patches in response to diverse linguistic instructions. Consequently, the correlation between the residual visual patches and the instructions critically influences the performance in visual question answering." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 299, + 481, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 299, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 130, + 299, + 481, + 441 + ], + "type": "text", + "content": "A plausible strategy involves leveraging the instruction to guide the assessment of visual token significance, with the aim of selectively retaining those patch tokens that bear the most relevance to the text. Nonetheless, this approach encounters a significant challenge that the decoder-only LLM does not incorporate a CLS token representative of the semantic information, and aggregating all textual tokens in a crude manner also introduces the interference of noise. Therefore, the text branch of the CLIP is utilized to facilitate a more focused selection of visual tokens that are relevant to the provided instructions, thereby ensuring a refined filtration process to align with the context of the instructions. Specifically, given the text " + }, + { + "bbox": [ + 130, + 299, + 481, + 441 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 299, + 481, + 441 + ], + "type": "text", + "content": ", we can obtain its corresponding sequence of textual tokens " + }, + { + "bbox": [ + 130, + 299, + 481, + 441 + ], + "type": "inline_equation", + "content": "\\{\\bar{x}_1^L,\\dots ,\\bar{x}_{S'}^L\\}" + }, + { + "bbox": [ + 130, + 299, + 481, + 441 + ], + "type": "text", + "content": " after being processed by the pre-trained text encoder of CLIP as:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 239, + 451, + 480, + 466 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 451, + 480, + 466 + ], + "spans": [ + { + "bbox": [ + 239, + 451, + 480, + 466 + ], + "type": "interline_equation", + "content": "\\{\\bar {x} _ {1} ^ {L}, \\dots , \\bar {x} _ {S ^ {\\prime}} ^ {L} \\} = \\mathcal {T} (T) \\in \\mathbb {R} ^ {S ^ {\\prime} \\times d}, \\tag {5}", + "image_path": "3058ca4cb8f47c38296db9a1ce8a2170939431123af44f117da1fe2628ff5b06.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 475, + 479, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 475, + 479, + 521 + ], + "spans": [ + { + "bbox": [ + 131, + 475, + 479, + 521 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 475, + 479, + 521 + ], + "type": "inline_equation", + "content": "\\mathcal{T}" + }, + { + "bbox": [ + 131, + 475, + 479, + 521 + ], + "type": "text", + "content": " is the text encoder of CLIP and " + }, + { + "bbox": [ + 131, + 475, + 479, + 521 + ], + "type": "inline_equation", + "content": "S^{\\prime}" + }, + { + "bbox": [ + 131, + 475, + 479, + 521 + ], + "type": "text", + "content": " denotes the length of textual tokens. Then, the visual relevance of textual tokens can be ascertained by computing the cosine similarity between the sequence of CLIP text tokens and the visual CLS tokens:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 230, + 521, + 480, + 548 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 230, + 521, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 230, + 521, + 480, + 548 + ], + "type": "interline_equation", + "content": "c _ {i} = \\frac {x _ {\\mathrm {c l s}} ^ {\\mathrm {V}} \\bar {x} _ {i} ^ {L}}{\\| x _ {\\mathrm {c l s}} \\| \\left\\| \\bar {x} _ {i} ^ {L} \\right\\|}, \\text {f o r} i \\in 1, \\dots , S ^ {\\prime}. \\tag {6}", + "image_path": "7ebc25308daba4bc528c88af957ea870620f022bf2bbe6528a0ebc490244d0a0.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 552, + 479, + 589 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 552, + 479, + 589 + ], + "spans": [ + { + "bbox": [ + 131, + 552, + 479, + 589 + ], + "type": "text", + "content": "Given that both the CLIP text encoder and general LLMs utilize tokenization derived from Byte Pair Encoding (BPE) [32], we can readily map the visual relevance computed by CLIP to the textual tokens of the LLMs as:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 162, + 599, + 480, + 632 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 162, + 599, + 480, + 632 + ], + "type": "interline_equation", + "content": "\\mathcal {C} _ {i} = \\frac {1}{K + 1} \\sum_ {k = j} ^ {j + K} c _ {k}, \\text {w i t h} T _ {\\mathrm {L L M}} (i) \\subseteq \\left\\{T _ {\\mathrm {C L I P}} (j), \\dots , T _ {\\mathrm {C L I P}} (j + K) \\right\\}, \\tag {7}", + "image_path": "a1d11d58b7103e67296bb72cbb63d3bc7d2fa5386523966560d1ff431c09b62e.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{LLM}}(i)" + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": " is the " + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": "th character string tokenized by LLM, and " + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{CLIP}}(j)" + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": " is the " + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": "th character string tokenized by text encoder of CLIP. Considering that" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "BPE may fragment a single word into multiple subword units, it is possible to encounter the situation where one token in LLMs corresponds to several tokens in the text encoder of CLIP. In such scenario, we take the average relevance of these " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "K + 1" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " tokens as the final mapping relevance. When " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " is zero, it means that the character string tokenized by the LLMs constitutes a substring within the text encoder of CLIP, and in this case, the current relevance can be used directly. By using the calculated visual relevance and applying average pooling with a predefined truncation threshold, we can pinpoint and extract the key textual tokens from the instructions that are most relevant to the corresponding image:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 192, + 239, + 481, + 271 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 239, + 481, + 271 + ], + "spans": [ + { + "bbox": [ + 192, + 239, + 481, + 271 + ], + "type": "interline_equation", + "content": "\\hat {x} _ {\\mathrm {c l s}} ^ {T} = \\left\\{ \\begin{array}{l l} x _ {\\mathrm {c l s}} ^ {V}, & \\text {i f} \\sum \\mathbb {I} _ {\\{\\mathcal {C} \\geq \\tau \\}} = 0, \\\\ \\frac {1}{\\sum \\mathbb {I} _ {\\{c \\geq \\tau \\}}} \\sum_ {i = 1} ^ {S} x _ {i} ^ {L} \\mathbb {I} _ {\\{\\mathcal {C} _ {i} \\geq \\tau \\}}, & \\text {O t h e r w i s e ,} \\end{array} \\right. \\tag {8}", + "image_path": "e17511a2239f37cec9b4977a1550a289ed0ba95b9a20becc110e3bc80a203644.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "inline_equation", + "content": "\\hat{x}_{\\mathrm{cls}}^T" + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "text", + "content": " is the textual pseudo CLS token of LLMs, " + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "text", + "content": " represents the length of tokens tokenized by LLMs and " + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "inline_equation", + "content": "\\mathbb{I}(\\cdot)" + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "text", + "content": " is an indicator function. If the relevance scores for the entire sequence of text tokens fall below the predefined threshold " + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 278, + 480, + 339 + ], + "type": "text", + "content": ", it indicates that the current instructions do not specify particular visual details. In such scenario, we directly use the visual CLS token as the pseudo CLS token." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 341, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 472 + ], + "type": "text", + "content": "Building upon the methodology in Sec. 3.2, we continue to reuse the GTP module in the LLMs, and consider the attention weights corresponding to the pseudo CLS token as the basis to calculate the importance scores of each visual token. The calculated importance scores are then methodically used to inform the process of token pruning. Given the nature of the causal mask within the LLMs, we position the pseudo CLS token in between the sequence of visual tokens and textual tokens during the attention weights computation. This placement ensures that the pseudo CLS token can assess the entire sequence of visual tokens without being affected by subsequent textual tokens. Note that the role of the pseudo CLS token is confined to assisting in the token pruning process, and it does not serve as an actual token during the model's training and inference." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 495, + 391, + 508 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 495, + 391, + 508 + ], + "spans": [ + { + "bbox": [ + 131, + 495, + 391, + 508 + ], + "type": "text", + "content": "3.4 Two-stage Token Pruning Manner for LVLMs" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "Based on the above discussion, we divide the entire pruning process into two stages. The first stage operates across the entire ViT, where the GTP module is executed within the grouped visual transformer layers to eliminate tokens of low informational content based on the association between patch tokens and the visual CLS token. The second stage focuses on a subset of LLM layers, selectively dropping visual tokens unrelated to the current instruction. This decision is informed by the attention between the remaining visual tokens and the textual pseudo CLS token, which aggregates from selected key tokens of the instructions. By adopting this two-stage process, the proposed method can significantly reduce the number of visual tokens while effectively retaining essential visual information. Detailed information regarding the algorithm can be found in the appendix." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 262, + 153 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 262, + 153 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 262, + 153 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 160, + 479, + 184 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 479, + 184 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 479, + 184 + ], + "type": "text", + "content": "In the following, we describe our experimental setup including datasets and evaluation, implementation details, and specifics of the comparison." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 185, + 480, + 303 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 185, + 480, + 303 + ], + "spans": [ + { + "bbox": [ + 130, + 185, + 480, + 303 + ], + "type": "text", + "content": "Datasets and Evaluation. The datasets employed for both training and evaluation in our study strictly conform to the specifications of LLaVA-1.5 [25]. In the pretraining phase, the 558K subset of the LAION-CC-SBU dataset with BLIP [21] captions are utilized. For instruction tuning, a comprehensive dataset with a diverse mix of 665K instruction-based examples are employed. We assess the performance of methods across 12 evaluation benchmarks, with the mean accuracy across these datasets as the principal metric for comparison. The scores of MME dataset [9] are normalized against the theoretical maximum value to facilitate uniformity in the scale of measurement. In the LLaVA-1.5 [25] framework, we primary experiment involved reducing visual tokens from 576 to 64." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 304, + 480, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 480, + 387 + ], + "type": "text", + "content": "Implementation Details. We perform token pruning every three layers, with the final count of visual tokens determined by the number pruned in each time. To balance model performance and efficiency, we employ all layers of the ViT and the initial 12 layers of the LLM for token pruning. The relevance threshold " + }, + { + "bbox": [ + 130, + 304, + 480, + 387 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 304, + 480, + 387 + ], + "type": "text", + "content": " is empirically set to 0.2. The model training and inference configurations are strictly aligned with the original settings of LLaVA-1.5 [25] for a fair comparison, and all experiments are conducted on " + }, + { + "bbox": [ + 130, + 304, + 480, + 387 + ], + "type": "inline_equation", + "content": "8\\times \\mathrm{A}100" + }, + { + "bbox": [ + 130, + 304, + 480, + 387 + ], + "type": "text", + "content": " GPUs." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 388, + 481, + 543 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 481, + 543 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 481, + 543 + ], + "type": "text", + "content": "Comparison Details. We primarily compare three categories of token pruning methods. The first includes straightforward token sampling or linear aggregation approaches, such as random sampling, topK based on patch token similarity with the CLS token, subsampling predicated on spatial correlations. The second category encompasses state-of-the-art methods in vision-only tasks, such as EViT [24] and ToMe [4]. The third category features token pruning methods that have recently emerged in LVLMs, including the abstractor structure from Honeybee [5], context attention in LLaMA-ViD [22], and the visual adapter in Qwen-VL [3]. For the sake of brevity, we directly use the model names to represent these structures. To eliminate the influence of factors such as model architecture, data, and training strategies, we reapply the aforementioned methods within the LLaVA-1.5 [25] framework to conduct a fair and thorough comparison. Specific details regarding the application can be found in the appendix." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 562, + 270, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 562, + 270, + 574 + ], + "spans": [ + { + "bbox": [ + 132, + 562, + 270, + 574 + ], + "type": "text", + "content": "4.2 Experimental Results" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Main Results. Table 1 and 2 demonstrate the comparison of performance with various methods as the number of visual tokens is reduced from 576 to 64 under the LLaVA-1.5-7B and LLaVA-1.5-13B frameworks [25] respectively. Despite some discrepancies between the replicated results and those reported in the literature across different datasets, the overall average differences are negligible, with the replication showing a slight edge in performance. Consequently, the replicated results is adopted as the baseline for comparison. The tables" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 422, + 90, + 447, + 101 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 158, + 480, + 239 + ], + "blocks": [ + { + "bbox": [ + 132, + 125, + 482, + 157 + ], + "lines": [ + { + "bbox": [ + 132, + 125, + 482, + 157 + ], + "spans": [ + { + "bbox": [ + 132, + 125, + 482, + 157 + ], + "type": "text", + "content": "Table 1: The comparison of the visual token pruning methods with Vicuna-7B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 158, + 480, + 239 + ], + "lines": [ + { + "bbox": [ + 133, + 158, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 133, + 158, + 480, + 239 + ], + "type": "table", + "html": "
Method\\( {\\mathrm{{VQAV}}}^{2} \\) [1]GQA [14]VisWiz [13]\\( {\\mathrm{{SQAI}}}^{3} \\) [28]\\( {\\mathrm{{VQAT}}}^{3} \\) [33]POPE [23]MME [9]MMB [27]MMBCN [27]SEED [19]LLaVAW \\( {}^{2} \\) [26]MM-Vet [40]Avg. \\( \\uparrow \\)TFLOPs \\( \\downarrow \\)
LLaVA-1.5-TB [25]78.562.050.066.858.285.975.564.358.358.663.430.562.715.4
LLaVA-1.5-TB* [25]79.162.749.067.858.686.372.866.259.358.563.731.763.015.4
Random sampling69.057.137.967.248.582.565.655.448.051.055.823.655.1 (-7.9)8.0 (-48.1%)
TopK72.458.147.066.952.583.867.163.355.254.559.226.558.9 (-4.1)8.0 (-48.1%)
Spatial pooling73.959.646.567.752.582.368.563.356.654.959.728.359.5 (-3.5)8.1 (-47.4%)
EViT [24]74.159.447.067.754.782.869.263.557.855.460.027.359.9 (-3.1)8.0 (-48.1%)
ToMe [4]75.160.047.167.555.382.470.463.956.555.260.526.660.0 (-3.0)8.0 (-48.1%)
Honeybee [5]74.859.047.267.850.984.068.761.657.855.259.427.159.5 (-3.5)8.1 (-47.4%)
LLaMA-VID [22]74.359.246.867.951.483.169.763.557.055.458.929.759.7 (-3.3)8.2 (-46.8%)
Qwen-VL [3]74.958.947.368.154.483.469.463.257.455.059.227.259.9 (-3.1)8.1 (-47.4%)
IVTP (Ours)77.860.447.967.858.285.772.666.157.456.462.830.562.0 (-1.0)8.2 (-46.8%)
", + "image_path": "40fd5c906a3939ccfe3195694f8c0dc2bf02f6922af7fb1b18350054475bc1c8.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 289, + 480, + 370 + ], + "blocks": [ + { + "bbox": [ + 132, + 256, + 481, + 288 + ], + "lines": [ + { + "bbox": [ + 132, + 256, + 481, + 288 + ], + "spans": [ + { + "bbox": [ + 132, + 256, + 481, + 288 + ], + "type": "text", + "content": "Table 2: The comparison of the visual token pruning methods with Vicuna-13B on 12 benchmarks. *The replicate results with same experimental setting. The TFLOPs is measured with batch size of 1 as well as 512 text tokens." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 289, + 480, + 370 + ], + "lines": [ + { + "bbox": [ + 133, + 289, + 480, + 370 + ], + "spans": [ + { + "bbox": [ + 133, + 289, + 480, + 370 + ], + "type": "table", + "html": "
MethodVQAV2 [11]GQA [14]VisWiz [13]SQA1[28]VQAT[33]POPE [23]MME [9]MMB [27]MMBCN[27]SEED [19]LLVaW2[26]MM-Vet [40]Avg. ↑TFLOPs ↓
LLvA-1.5-13B [25]80.063.353.671.661.385.976.667.763.661.670.735.465.929.4
LLvA-1.5-13B* [25]80.063.454.570.460.086.478.468.363.160.869.436.866.029.4
Random sampling72.356.746.668.051.583.364.958.054.853.058.824.657.7 (-8.3)15.4 (47.5%)
TopK74.758.550.869.354.285.468.064.559.654.562.826.660.7 (-5.3)15.4 (47.5%)
Spatial pooling75.159.751.169.955.084.871.664.260.254.963.327.461.4 (-4.6)15.6 (46.9%)
EViT [24]77.260.253.470.157.984.673.665.360.155.464.928.662.6 (-3.4)15.4 (47.5%)
ToMe [4]76.961.453.970.157.685.373.165.061.256.065.932.663.3 (-2.7)15.4 (47.5%)
Honeybee [5]76.261.252.170.559.783.673.563.261.255.766.532.063.0 (-3.0)15.4 (47.5%)
LLvA-VID [22]76.561.752.970.457.283.374.464.260.555.266.032.762.9 (-3.1)15.5 (47.3%)
Qwen-VL [3]77.361.152.170.856.484.071.765.861.756.366.731.563.0 (-3.0)15.4 (47.5%)
IVTP (Ours)78.462.354.170.160.085.477.167.763.359.368.635.565.2 (-0.8)15.6 (46.9%)
", + "image_path": "29218547f52609cacbdb5b79ce668ab01656117f107daac3071756837c791ba0.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "text", + "content": "show that despite reducing visual tokens by approximately " + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "inline_equation", + "content": "88.9\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "text", + "content": ", the proposed method incurs an average performance decline of only about " + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "text", + "content": " across 12 evaluation datasets, coupled with over " + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "inline_equation", + "content": "46\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "text", + "content": " reduction in computational demand. Our method exceeds the performance of other token pruning methods by over " + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 530 + ], + "type": "text", + "content": ", despite incurring a slightly higher TFLOPs due to hierarchical token pruning in the LLM. Table 3 further illustrates the change in TFLOPs corresponding to an increase in text tokens from 128 to 1024. It is clear that as the number of text tokens reduced, the proportion of visual tokens becomes more significant, thereby intensifying their influence on the computational demands of the model. As a result, the effectiveness of visual token pruning in reducing computational demand becomes more evident." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Inference-only Results. Since the proposed method does not need any extra modules that require parameter optimization, it can be seamlessly integrated with pre-trained models. This eliminates the need for retraining and simultaneously enhances computational efficiency during inference. Fig. 3 presents a performance comparison of various methods in a pure inference scenario when reducing the number of visual tokens from 16 to 512. As the number of target tokens decreases, the advantages of our proposed method become more pronounced. Notably, when the number of visual tokens is reduced to 16, our method surpasses other approaches by approximately " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": ". The proposed method guided by instruction semantics can more effectively maintain the task relevant visual information, thereby achieving better results." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 172, + 306, + 242 + ], + "blocks": [ + { + "bbox": [ + 132, + 139, + 309, + 171 + ], + "lines": [ + { + "bbox": [ + 132, + 139, + 309, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 309, + 171 + ], + "type": "text", + "content": "Table 3: Comparison results of TFLOPs across different methods as text token count varies from 128 to 1024." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 172, + 306, + 242 + ], + "lines": [ + { + "bbox": [ + 133, + 172, + 306, + 242 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 306, + 242 + ], + "type": "table", + "html": "
Methods1282565121024
LLaVA-1.5-7B [25]9.911.715.422.9
TopK2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
ToMe [4]2.7 (-72.7%)4.5 (-61.5%)8.0 (-48.1%)15.2 (-33.6%)
Honeybee [5]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.4 (-32.8%)
Qwen-VL [3]2.9 (-70.7%)4.6 (-60.7%)8.1 (-47.4%)15.3 (-33.2%)
IVTP (Ours)3.0 (-69.7%)4.7 (-59.8%)8.2 (-46.8%)15.5 (-32.3%)
", + "image_path": "bb90811892570cdf29e2e44e3141c11c14885a1bd11893cf62a099d9ddf87fbc.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 331, + 114, + 474, + 225 + ], + "blocks": [ + { + "bbox": [ + 331, + 114, + 474, + 225 + ], + "lines": [ + { + "bbox": [ + 331, + 114, + 474, + 225 + ], + "spans": [ + { + "bbox": [ + 331, + 114, + 474, + 225 + ], + "type": "image", + "image_path": "6dc69f5faae39958e47a2f14226119e8942b30b5ce7bd785f181246b18c45db8.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 322, + 232, + 481, + 255 + ], + "lines": [ + { + "bbox": [ + 322, + 232, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 322, + 232, + 481, + 255 + ], + "type": "text", + "content": "Fig. 3: Comparison of model performance with pure inference setting." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 281, + 272, + 293 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 272, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 272, + 293 + ], + "type": "text", + "content": "4.3 Ablation and Analysis" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 304, + 480, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 480, + 353 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 480, + 353 + ], + "type": "text", + "content": "To analyze different setups of our IVTP, we perform extensive ablation studies. All the experiments are conducted with LLaVA-1.5-7B [25] as the backbone, and report the average accuracy across the aforementioned 12 evaluation datasets in both retraining mode and pure inference mode (PI)." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 354, + 482, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 604 + ], + "type": "text", + "content": "Attention Rollout. As outlined in Sec. 3.2, we organize several contiguous layers into a group and apply attention rollout through the residual aggregation of intra-group attention weights. This process is intended to simulate the flow of information through hidden layer features, thereby yielding more reliable and effective attention weights for assessing the significance of visual patch tokens. Table 4 shows that substituting the group-wise attention rollout with a variant that uses only the CLS token's attention weight of current layer results in a performance decrease of " + }, + { + "bbox": [ + 130, + 354, + 482, + 604 + ], + "type": "inline_equation", + "content": "4.5\\%" + }, + { + "bbox": [ + 130, + 354, + 482, + 604 + ], + "type": "text", + "content": " in pure inference mode and " + }, + { + "bbox": [ + 130, + 354, + 482, + 604 + ], + "type": "inline_equation", + "content": "3.9\\%" + }, + { + "bbox": [ + 130, + 354, + 482, + 604 + ], + "type": "text", + "content": " in retraining mode. When switching from group-wise to layer-wise, the performance is improved, yet there is still a noticeable gap compared to the method using group-wise attention rollout. Although the proposed method requires to prune a greater number of tokens each time compared to layer-wise, it achieves better results with similar TFLOPs. This improvement is due to the more stable and efficient aggregation of attention, where the attention scores can more accurately reflect the contribution of patch tokens. Table 5 delves deeper into the impact of different attention information aggregation strategies. We evaluate several approaches for aggregating attention weights produced by different layers within a group, such as averaging, selecting the maximum, and implementing element-wise multiplication. The finding demonstrates that the residual method employed in our approach yields superior performance, owing to its improved alignment with the forward propagation of visual tokens." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "Instruction Guided Selection. Another fundamental component of the proposed approach is the further selection of visual tokens guided by textual instructions, as elaborated in Sec. 3.3. To validate the effectiveness of this module, we also perform a series of ablation studies, which are presented in Table 6. As shown in the first row of the table, the attention weights of the visual" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 146, + 170, + 321, + 232 + ], + "blocks": [ + { + "bbox": [ + 133, + 125, + 332, + 169 + ], + "lines": [ + { + "bbox": [ + 133, + 125, + 332, + 169 + ], + "spans": [ + { + "bbox": [ + 133, + 125, + 332, + 169 + ], + "type": "text", + "content": "Table 4: Ablation study of the weights of attention rollout and vanilla attention. The metrics for comparison with the original LLaVA-1.5-7B are indicated in parentheses." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 146, + 170, + 321, + 232 + ], + "lines": [ + { + "bbox": [ + 146, + 170, + 321, + 232 + ], + "spans": [ + { + "bbox": [ + 146, + 170, + 321, + 232 + ], + "type": "table", + "html": "
ModelAvg. Acc (PI)Avg. AccTFLOPs
Group-wise55.1 (-7.9)58.1 (-4.9)8.2 (-46.8%)
Layer-wise56.2 (-6.8)59.5 (-3.5)8.2 (-46.8%)
Rollout59.6 (-3.4)62.0 (-1.0)8.2 (-46.8%)
", + "image_path": "326ed9ef3c7326a56cb261824f1a4cb1e9937142b2c581c083ed64a6535129be.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 345, + 159, + 471, + 232 + ], + "blocks": [ + { + "bbox": [ + 336, + 125, + 478, + 157 + ], + "lines": [ + { + "bbox": [ + 336, + 125, + 478, + 157 + ], + "spans": [ + { + "bbox": [ + 336, + 125, + 478, + 157 + ], + "type": "text", + "content": "Table 5: Comparison with different attention weights aggregation strategies." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 345, + 159, + 471, + 232 + ], + "lines": [ + { + "bbox": [ + 345, + 159, + 471, + 232 + ], + "spans": [ + { + "bbox": [ + 345, + 159, + 471, + 232 + ], + "type": "table", + "html": "
ModelAvg. Acc (PI)Avg. Acc
mean56.1 (-6.9)60.1 (-2.9)
max55.9 (-7.1)60.7 (-2.3)
multiply56.7 (-6.3)60.5 (-2.5)
Residual59.6 (-3.4)62.0 (-1.0)
", + "image_path": "4bf3c27499346f22ac7527b5f1520f26b73a65b6e9ffc1dface2ec3fcbee289a.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 154, + 307, + 302, + 381 + ], + "blocks": [ + { + "bbox": [ + 133, + 262, + 321, + 306 + ], + "lines": [ + { + "bbox": [ + 133, + 262, + 321, + 306 + ], + "spans": [ + { + "bbox": [ + 133, + 262, + 321, + 306 + ], + "type": "text", + "content": "Table 6: Ablation study of instruction guided selection. 'OTT', 'TE', and 'RT' refer to original textual tokens, CLIP text encoder, and relevance threshold, respectively." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 154, + 307, + 302, + 381 + ], + "lines": [ + { + "bbox": [ + 154, + 307, + 302, + 381 + ], + "spans": [ + { + "bbox": [ + 154, + 307, + 302, + 381 + ], + "type": "table", + "html": "
OTTTERTAvg.Acc (PI)Avg.ACC
56.7(-6.3)59.2(-3.8)
✓58.3(-4.7)60.2(-2.8)
✓✓57.3(-5.7)59.9(-3.1)
✓✓✓59.6(-3.4)62.0(-1.0)
", + "image_path": "e38133f7dc2f8a94c0a6c74ca494ab0ad6f339ee5c57902781919f739a9084c7.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 329, + 277, + 460, + 388 + ], + "blocks": [ + { + "bbox": [ + 326, + 255, + 478, + 276 + ], + "lines": [ + { + "bbox": [ + 326, + 255, + 478, + 276 + ], + "spans": [ + { + "bbox": [ + 326, + 255, + 478, + 276 + ], + "type": "text", + "content": "Table 7: " + }, + { + "bbox": [ + 326, + 255, + 478, + 276 + ], + "type": "inline_equation", + "content": "{}^{ + }" + }, + { + "bbox": [ + 326, + 255, + 478, + 276 + ], + "type": "text", + "content": " Extending token pruning to LLM with other methods." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 329, + 277, + 460, + 388 + ], + "lines": [ + { + "bbox": [ + 329, + 277, + 460, + 388 + ], + "spans": [ + { + "bbox": [ + 329, + 277, + 460, + 388 + ], + "type": "table", + "html": "
ModelAvg. Acc (PI)Avg. Acc
TopK54.1 (-8.9)58.9 (-4.1)
TopK+54.9 (-8.1)58.7 (-4.3)
ToMe [4]57.5 (-5.5)60.0 (-3.0)
ToMe+57.7 (-5.3)60.1 (-2.9)
IVTP-V58.5 (-4.5)60.8 (-2.2)
IVTP59.6 (-3.4)62.0 (-1.0)
", + "image_path": "571ec16db9be27f8ed70eb725c46654aa637b8096feeaac3226ddb39806f9db1.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 413, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 592 + ], + "type": "text", + "content": "CLS token are used as the foundation for token selection within the LLM, establishing the baseline for these experiments. We then aggregate the original textual instruction tokens into a pseudo CLS token via average pooling to steer the token selection process. This approach yields a significant improvement over the baseline, demonstrating that guiding the pruning of visual tokens with textual instructions effectively isolates instruction-relevant visual patches through cross-modal associations, thus further reducing the number of required visual tokens. To minimize the influence of irrelevant noise in the textual instructions, we introduced a relevance threshold to selectively extracts key textual tokens. However, due to the lack of associative contrastive training between the visual CLS token and the original textual tokens of LLM, directly calculating vector correlation and applying a threshold for filtration is insufficient for isolating key textual tokens. The last row of the table demonstrates that integrating the CLIP text encoder, which naturally excels in image-text alignment, enables the precise identification of relevant sections within the textual tokens." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Pruning in LLM. We also extend our two-stage visual token pruning to TopK and ToMe [4], denoted as " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{TopK^{+}}" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{ToMe^{+}}" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " in Table 7, respectively. For a direct comparison, we apply the proposed method solely to the visual encoder, indicated as IVTP-V in the table. It calculation that extending the purely visual methods to LLM does not yield significant improvements. This is because performing token pruning solely within visual patches through representational" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 150, + 152, + 272, + 230 + ], + "blocks": [ + { + "bbox": [ + 132, + 125, + 290, + 147 + ], + "lines": [ + { + "bbox": [ + 132, + 125, + 290, + 147 + ], + "spans": [ + { + "bbox": [ + 132, + 125, + 290, + 147 + ], + "type": "text", + "content": "Table 8: Comparison with the numbers of layers in token pruning groups." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 150, + 152, + 272, + 230 + ], + "lines": [ + { + "bbox": [ + 150, + 152, + 272, + 230 + ], + "spans": [ + { + "bbox": [ + 150, + 152, + 272, + 230 + ], + "type": "table", + "html": "
LayersAvg.Acc (PI)Avg.Acc
ALL56.7(-6.3)58.2(-4.8)
258.8(-4.2)60.1(-2.9)
359.6(-3.4)62.0(-1.0)
459.1(-3.9)61.5(-1.5)
658.6(-4.4)59.9(-3.1)
", + "image_path": "c2c318d921186fd50b4dbfbcc3ede030e44c4ad9672bac5abfa75df78c04905a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 142, + 261, + 280, + 335 + ], + "blocks": [ + { + "bbox": [ + 132, + 239, + 290, + 261 + ], + "lines": [ + { + "bbox": [ + 132, + 239, + 290, + 261 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 290, + 261 + ], + "type": "text", + "content": "Table 9: Computational complexity with different methods (TFLOPs)." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 142, + 261, + 280, + 335 + ], + "lines": [ + { + "bbox": [ + 142, + 261, + 280, + 335 + ], + "spans": [ + { + "bbox": [ + 142, + 261, + 280, + 335 + ], + "type": "table", + "html": "
MethodsViTLLMextraTotal
LLaVA-1.5-7B [25]0.36115.003-15.364
TopK0.1907.772-7.962
ToMe [4]0.1907.772-7.962
Qwen-VL [3]0.3607.7720.0038.135
IVTP (our)0.2027.9460.0808.228
", + "image_path": "12aae31b954923419e36bc2ec40770eae1c96a56a5f089ba072ca4d952e3ab41.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 302, + 124, + 481, + 260 + ], + "blocks": [ + { + "bbox": [ + 302, + 124, + 481, + 260 + ], + "lines": [ + { + "bbox": [ + 302, + 124, + 481, + 260 + ], + "spans": [ + { + "bbox": [ + 302, + 124, + 481, + 260 + ], + "type": "image", + "image_path": "81d9bb336254f5cd5cddab7aedd2fa674914e7a53dca0fdfd5b7db05029b9b29.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 300, + 270, + 482, + 324 + ], + "lines": [ + { + "bbox": [ + 300, + 270, + 482, + 324 + ], + "spans": [ + { + "bbox": [ + 300, + 270, + 482, + 324 + ], + "type": "text", + "content": "Fig. 4: Performance comparison with token pruning scaling. We show the average accuracy over all 12 benchmarks with the target number of visual tokens varying from 16 to 512 under comparable TFLOPs." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 361, + 480, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 361, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 480, + 396 + ], + "type": "text", + "content": "similarity fails to address the scenario with sparse target tokens. Rather than applying the token pruning from the visual encoder to the LLM directly, we select relevant visual tokens based on the diverse instructions." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 399, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 567 + ], + "type": "text", + "content": "Scaling the Token Pruning. Figure 4 illustrates the trade-off between TFLOPs and average accuracy by adjusting the final count of visual tokens from 576 down to a range between 16 and 512. The trend shown in the figure indicates that when the final number of visual tokens is reduced to between 256 and 512, the performance of most methods are nearly identical to those of the original model. The proposed method even slightly exceeds the original model while achieving a " + }, + { + "bbox": [ + 130, + 399, + 482, + 567 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 567 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 399, + 482, + 567 + ], + "type": "inline_equation", + "content": "30\\%" + }, + { + "bbox": [ + 130, + 399, + 482, + 567 + ], + "type": "text", + "content": " reduction in TFLOPs. This suggests that reducing the number of visual tokens to an optimal level can not only preserve essential visual information but also minimizes interference from irrelevant visual tokens. As the number of visual tokens is further reduced, relying solely on the relevance and uniqueness of patch tokens becomes inadequate for preserving visual information. To overcome this limitation, the proposed method introduces an instruction-guided mechanism that adaptively selects visual tokens highly relevant to the specific given prompt, thereby completing VQA tasks with fewer visual tokens." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 567, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 567, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 567, + 482, + 640 + ], + "type": "text", + "content": "Group Layers. We vary the number of layers in each token pruning group, with a specific focus on the scenario in which all layers of the ViT and all the first 12 layers of the LLM are employed. Table 8 shows the optimal performance is achieved with each group consists of three layers. Groups comprising fewer layers yield less effective attention rollout aggregation, whereas groups with more layers require pruning more tokens, hindering the layer-wise interaction within tokens." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "Computational complexity. Table 9 shows the comparison of computational complexity among different models. We itemize the computational costs of the" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 481, + 244 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 244 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 244 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 244 + ], + "type": "image", + "image_path": "95a95625d696e98f649cbc465ee57c8fe780f18c7f8ca7001273365b7a222e6a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 251, + 482, + 285 + ], + "lines": [ + { + "bbox": [ + 130, + 251, + 482, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 482, + 285 + ], + "type": "text", + "content": "Fig. 5: Visualization of the visual token pruning results. Each sample, viewed from left to right, consists of the raw image, the token pruning by the TopK, and the token pruning by the proposed method, respectively." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 308, + 482, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 489 + ], + "type": "text", + "content": "visual encoder, LLM and extra structures separately to provide a detailed breakdown. It is clear that the LLM contributes the most to the overall computational complexity of the LVLM, due to its significantly higher number of parameters compared to the ViT and other supplementary structures. Consequently, the disparities in TFLOPs observed with purely visual methods are not discernible when these methods are incorporated into the LVLMs. Although our method inputs more visual tokens into the LLM compared to other pruning methods, by limiting pruning to the initial 12 layers of the LLM, we manage to keep the computational complexity within " + }, + { + "bbox": [ + 130, + 308, + 482, + 489 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 308, + 482, + 489 + ], + "type": "text", + "content": " of that achieved by single-stage approaches. Visualizations. We further visualize the results of token pruning for a more intuitive understanding in Fig. 5. key textual tokens are highlighted in the instruction text and discarded visual tokens are masked in the input image. Our observations indicate that the proposed method excels at precisely identifying essential textual tokens related to visual content and adeptly preserving the most relevant visual tokens aligned with the semantics of diverse instructions." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 506, + 220, + 520 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 506, + 220, + 520 + ], + "spans": [ + { + "bbox": [ + 132, + 506, + 220, + 520 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 532, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 532, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 532, + 482, + 665 + ], + "type": "text", + "content": "This paper presents a visual token pruning technique for Large Vision-Language Models (LVLMs). It introduces a group-wise token pruning (GTP) module aimed at improving the stability and robustness of patch token importance assessment within a frozen visual encoder of LVLMs. The proposed method extends the designed GTP module to LLM with incorporating instruction semantics as guidance, thereby discarding irrelevant visual tokens based on instructional preferences. Comprehensive experiments and in-depth ablation studies show that the proposed method can prune more visual tokens with minimal loss of accuracy, as well as accelerate the training and inference of LVLMs. The reduction of visual tokens can also be transferred to multi-image or video tasks in LVLMs to boost their performance, which will be a key focus of our future work." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 139, + 480, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 139, + 480, + 161 + ], + "spans": [ + { + "bbox": [ + 138, + 139, + 480, + 161 + ], + "type": "text", + "content": "1. Abnar, S., Zuidema, W.: Quantifying attention flow in transformers. arXiv preprint arXiv:2005.00928 (2020) 2, 6" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 162, + 480, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 162, + 480, + 194 + ], + "spans": [ + { + "bbox": [ + 138, + 162, + 480, + 194 + ], + "type": "text", + "content": "2. Achiam, J., Adler, S., Agarwal, S., Ahmad, L., Akkaya, I., Aleman, F.L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al.: Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023) 3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 195, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 195, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 138, + 195, + 480, + 226 + ], + "type": "text", + "content": "3. Bai, J., Bai, S., Yang, S., Wang, S., Tan, S., Wang, P., Lin, J., Zhou, C., Zhou, J.: Qwen-vl: A frontier large vision-language model with versatile abilities. arXiv preprint arXiv:2308.12966 (2023) 1, 2, 3, 9, 10, 11, 13" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 228, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 258 + ], + "type": "text", + "content": "4. Bolya, D., Fu, C.Y., Dai, X., Zhang, P., Feichtenhofer, C., Hoffman, J.: Token merging: Your vit but faster. In: The Eleventh International Conference on Learning Representations (2022) 2, 4, 6, 9, 10, 11, 12, 13" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 260, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 260, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 138, + 260, + 480, + 281 + ], + "type": "text", + "content": "5. Cha, J., Kang, W., Mun, J., Roh, B.: Honeybee: Locality-enhanced projector for multimodal llm. arXiv preprint arXiv:2312.06742 (2023) 9, 10, 11" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "type": "text", + "content": "6. Chefer, H., Gur, S., Wolf, L.: Transformer interpretability beyond attention visualization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 782-791 (2021) 6" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 315, + 480, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 315, + 480, + 347 + ], + "spans": [ + { + "bbox": [ + 138, + 315, + 480, + 347 + ], + "type": "text", + "content": "7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 348, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 348, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 138, + 348, + 480, + 391 + ], + "type": "text", + "content": "8. Fayyaz, M., Koohpayegani, S.A., Jafari, F.R., Sengupta, S., Joze, H.R.V., Sommerlade, E., Pirsiavash, H., Gall, J.: Adaptive token sampling for efficient vision transformers. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 396-414. Springer (2022) 2, 4, 6" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 392, + 480, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 480, + 423 + ], + "type": "text", + "content": "9. Fu, C., Chen, P., Shen, Y., Qin, Y., Zhang, M., Lin, X., Yang, J., Zheng, X., Li, K., Sun, X., et al.: Mme: A comprehensive evaluation benchmark for multimodal large language models. arXiv preprint arXiv:2306.13394 (2023) 9, 10" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 134, + 425, + 480, + 465 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 425, + 480, + 465 + ], + "spans": [ + { + "bbox": [ + 134, + 425, + 480, + 465 + ], + "type": "text", + "content": "10. Goyal, S., Choudhury, A.R., Raje, S., Chakaravarthy, V., Sabharwal, Y., Verma, A.: Power-bert: Accelerating bert inference via progressive word-vector elimination. In: International Conference on Machine Learning. pp. 3690-3699. PMLR (2020) 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 468, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 468, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 133, + 468, + 480, + 511 + ], + "type": "text", + "content": "11. Goyal, Y., Khot, T., Summers-Stay, D., Batra, D., Parikh, D.: Making the v in vqa matter: Elevating the role of image understanding in visual question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6904-6913 (2017) 10" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 512, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 512, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 133, + 512, + 480, + 544 + ], + "type": "text", + "content": "12. Guo, Y., Zhang, H., Nie, L., Wong, Y., Kankanhalli, M.: Elip: Efficient language-image pre-training with fewer vision tokens. arXiv preprint arXiv:2309.16738 (2023) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 545, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 545, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 133, + 545, + 480, + 588 + ], + "type": "text", + "content": "13. Gurari, D., Li, Q., Stangl, A.J., Guo, A., Lin, C., Grauman, K., Luo, J., Bigham, J.P.: Vizwiz grand challenge: Answering visual questions from blind people. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3608-3617 (2018) 10" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 590, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 590, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 133, + 590, + 480, + 620 + ], + "type": "text", + "content": "14. Hudson, D.A., Manning, C.D.: Gqa: A new dataset for real-world visual reasoning and compositional question answering. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6700-6709 (2019) 10" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 622, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 622, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 622, + 480, + 665 + ], + "type": "text", + "content": "15. Jiang, C., Xu, H., Ye, W., Ye, Q., Li, C., Yan, M., Bi, B., Zhang, S., Huang, F., Huang, S.: Bus: Efficient and effective vision-language pre-training with bottom-up patch summarization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2900-2910 (2023) 4" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "16. Kim, G., Cho, K.: Length-adaptive transformer: Train once with length drop, use anytime with search. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing. pp. 6501-6511 (2021) 3" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 162, + 481, + 195 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 162, + 481, + 195 + ], + "spans": [ + { + "bbox": [ + 132, + 162, + 481, + 195 + ], + "type": "text", + "content": "17. Kim, S., Shen, S., Thorsley, D., Gholami, A., Kwon, W., Hassoun, J., Keutzer, K.: Learned token pruning for transformers. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 784-794 (2022) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 195, + 481, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 195, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 195, + 481, + 239 + ], + "type": "text", + "content": "18. Kong, Z., Dong, P., Ma, X., Meng, X., Niu, W., Sun, M., Shen, X., Yuan, G., Ren, B., Tang, H., et al.: Spvit: Enabling faster vision transformers via latency-aware soft token pruning. In: Proceedings of the IEEE/CVF European Conference on Computer Vision. pp. 620-640. Springer (2022) 4, 6" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 239, + 481, + 273 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 239, + 481, + 273 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 481, + 273 + ], + "type": "text", + "content": "19. Li, B., Wang, R., Wang, G., Ge, Y., Ge, Y., Shan, Y.: Seed-bench: Benchmarking multimodal llms with generative comprehension. arXiv preprint arXiv:2307.16125 (2023) 10" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "text", + "content": "20. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. arXiv preprint arXiv:2301.12597 (2023) 1, 2, 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "spans": [ + { + "bbox": [ + 132, + 307, + 481, + 340 + ], + "type": "text", + "content": "21. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022) 4, 9" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 340, + 481, + 362 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 340, + 481, + 362 + ], + "spans": [ + { + "bbox": [ + 132, + 340, + 481, + 362 + ], + "type": "text", + "content": "22. Li, Y., Wang, C., Jia, J.: Llama-vid: An image is worth 2 tokens in large language models. arXiv preprint arXiv:2311.17043 (2023) 1, 2, 3, 9, 10" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 363, + 481, + 395 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 481, + 395 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 481, + 395 + ], + "type": "text", + "content": "23. Li, Y., Du, Y., Zhou, K., Wang, J., Zhao, W.X., Wen, J.R.: Evaluating object hallucination in large vision-language models. arXiv preprint arXiv:2305.10355 (2023) 10" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 396, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 430 + ], + "type": "text", + "content": "24. Liang, Y., Chongjian, G., Tong, Z., Song, Y., Wang, J., Xie, P.: Evit: Expediting vision transformers via token reorganizations. In: International Conference on Learning Representations (2021) 2, 4, 9, 10" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 430, + 481, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 481, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 481, + 453 + ], + "type": "text", + "content": "25. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. arXiv preprint arXiv:2310.03744 (2023) 3, 4, 9, 10, 11, 13" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 453, + 481, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 481, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 481, + 475 + ], + "type": "text", + "content": "26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. Advances in neural information processing systems 36 (2024) 1, 3, 10" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "text", + "content": "27. Liu, Y., Duan, H., Zhang, Y., Li, B., Zhang, S., Zhao, W., Yuan, Y., Wang, J., He, C., Liu, Z., et al.: Mmbench: Is your multi-modal model an all-around player? arXiv preprint arXiv:2307.06281 (2023) 10" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 509, + 481, + 552 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 552 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 552 + ], + "type": "text", + "content": "28. Lu, P., Mishra, S., Xia, T., Qiu, L., Chang, K.W., Zhu, S.C., Tafjord, O., Clark, P., Kalyan, A.: Learn to explain: Multimodal reasoning via thought chains for science question answering. Advances in Neural Information Processing Systems 35, 2507-2521 (2022) 10" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 554, + 450, + 565 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 450, + 565 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 450, + 565 + ], + "type": "text", + "content": "29. OpenAI: Chatgpt. https://openai.com/blog/chatgpt/, 2023. 1, 2 (2023) 3" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 565, + 481, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 565, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 565, + 481, + 609 + ], + "type": "text", + "content": "30. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 609, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 481, + 643 + ], + "type": "text", + "content": "31. Rao, Y., Zhao, W., Liu, B., Lu, J., Zhou, J., Hsieh, C.J.: Dynamicvit: Efficient vision transformers with dynamic token sparsification. Advances in neural information processing systems 34, 13937-13949 (2021) 2, 4, 6" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "text", + "content": "32. Sennrich, R., Haddow, B., Birch, A.: Neural machine translation of rare words with subword units. arXiv preprint arXiv:1508.07909 (2015) 7" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 231, + 102 + ], + "type": "text", + "content": "K. Huang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 456 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "text", + "content": "33. Singh, A., Natarajan, V., Shah, M., Jiang, Y., Chen, X., Batra, D., Parikh, D., Rohrbach, M.: Towards vqa models that can read. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8317-8326 (2019) 10" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 130, + 161, + 481, + 194 + ], + "type": "text", + "content": "34. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al.: Llama: Open and efficient foundation language models. arXiv preprint arXiv:2302.13971 (2023) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 237 + ], + "type": "text", + "content": "35. Wei, S., Ye, T., Zhang, S., Tang, Y., Liang, J.: Joint token pruning and squeezing towards more aggressive compression of vision transformers. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2092-2101 (2023) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 237, + 481, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 481, + 259 + ], + "type": "text", + "content": "36. Wu, X., Zeng, F., Wang, X., Wang, Y., Chen, X.: Ppt: Token pruning and pooling for efficient vision transformers. arXiv preprint arXiv:2310.01812 (2023) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 303 + ], + "type": "text", + "content": "37. Xu, Y., Zhang, Z., Zhang, M., Sheng, K., Li, K., Dong, W., Zhang, L., Xu, C., Sun, X.: Evo-vit: Slow-fast token evolution for dynamic vision transformer. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 2964-2972 (2022) 4" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 303, + 481, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 303, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 303, + 481, + 346 + ], + "type": "text", + "content": "38. Ye, D., Lin, Y., Huang, Y., Sun, M.: Tr-bert: Dynamic token reduction for accelerating bert inference. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5798-5809 (2021) 3" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "type": "text", + "content": "39. Yin, H., Vahdat, A., Alvarez, J.M., Mallya, A., Kautz, J., Molchanov, P.: A-vit: Adaptive tokens for efficient vision transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10809-10818 (2022) 2, 4" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 390, + 481, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 390, + 481, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 390, + 481, + 423 + ], + "type": "text", + "content": "40. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023) 10" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 423, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 423, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 423, + 481, + 456 + ], + "type": "text", + "content": "41. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. arXiv preprint arXiv:2304.10592 (2023) 1, 3" + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 422, + 91, + 447, + 100 + ], + "type": "text", + "content": "IVTP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_content_list.json b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..edc2d7b57da78c80789c174e6e79039cc83dc6f1 --- /dev/null +++ b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_content_list.json @@ -0,0 +1,2622 @@ +[ + { + "type": "text", + "text": "Idea2Img: Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation", + "text_level": 1, + "bbox": [ + 217, + 140, + 785, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zhengyuan Yang, Jianfeng Wang, Linjie Li, Kevin Lin, Chung-Ching Lin, Zicheng Liu, and Lijuan Wang", + "bbox": [ + 217, + 210, + 782, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Microsoft \n{zhengyang, jianfw, lindsey.li, keli, chungching.lin, zliu, lijuanw}@microsoft.com \nhttps://idea2img.github.io/", + "bbox": [ + 215, + 255, + 805, + 297 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. We introduce \"Idea to Image,\"1 an agent system that enables multimodal iterative self-refinement with GPT-4V(ison) for automatic image design and generation. Humans can quickly identify the characteristics of different text-to-image (T2I) models via iterative explorations. This enables them to efficiently convert their high-level generation ideas into effective T2I prompts that can produce good images. We investigate if systems based on large multimodal models (LMMs) can develop analogous multimodal self-refinement abilities that enable exploring unknown models or environments via self-refining tries. Idea2Img cyclically generates revised T2I prompts to synthesize draft images, and provides directional feedback for prompt revision, both conditioned on its memory of the probed T2I model's characteristics. The iterative self-refinement brings Idea2Img various advantages over vanilla T2I models. Notably, Idea2Img can process input ideas with interleaved image-text sequences, follow ideas with design instructions, and generate images of better semantic and visual qualities. The user preference study validates the efficacy of Idea2Img on automatic image design and generation via multimodal iterative self-refinement.", + "bbox": [ + 259, + 329, + 743, + 580 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Multimodal Agents $\\cdot$ Large Multimodal Models $\\cdot$ Image Design and Generation", + "bbox": [ + 259, + 592, + 740, + 621 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 643, + 375, + 659 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "\"Image design and generation\" aims to create an image from a high-level user idea. This input IDEA can contain interleaved reference images, such as \"the dog looks like the one in the image,\" or with instructional texts specifying the intended design usage, such as \"a logo for the Idea2Img system.\" To convert IDEA into an image, humans may first draft detailed descriptions of the imagined image, and then use text-to-image (T2I) models [34, 37, 38, 40, 61] to generate the image. This manual process for users to search for an ideal detailed description (i.e., T2I prompt) that fits the T2I model typically involves iterative exploration [49, 65]. As shown in Figure 1, humans may first design and draft an", + "bbox": [ + 212, + 674, + 787, + 811 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "1 Short for \"Idea2Img.\" System logo design", + "bbox": [ + 217, + 823, + 508, + 839 + ], + "page_idx": 0 + }, + { + "type": "footer", + "text": "assisted by Idea2Img.", + "bbox": [ + 511, + 821, + 684, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/96ec1432c7adcc603d1e1d5a8afdf74c0202bc636eed433b3523ce5bb9dbbcfa.jpg", + "image_caption": [ + "Fig. 1: Idea2Img framework enables LMMs to mimic human-like exploration to use a T2I model, enabling the design and generation of an imagined image specified as a multimodal input IDEA. The iterative process involves LMMs functioning in different roles to refine the image creation. Specifically, LMMs will (1) generate and revise text prompts for the T2I model, (2) select the best draft images, and (3) provide feedback on the errors and revision directions. This multimodal iterative self-refinement process requires LMMs to memorize the T2I model's characteristics observed in previous iterations as humans and adjust T2I prompts accordingly." + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 782, + 344 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "initial T2I prompt based on their imagined IDEA to generate. Then, they can obtain multiple draft images with a T2I model, select the most promising draft, write text feedback, and further revise the T2I prompt. As this iteration progresses, we humans can swiftly grasp the characteristics of a specific T2I model, such as words that the model can not understand, finally producing a good image generated by a suitable T2I prompt. Given the remarkable capabilities of large multimodal models (LMMs) [14, 29, 55], we explore if we can build systems based on LMMs to develop similar iterative self-refinement ability, thereby relieving humans from the tedious process of converting ideas to images.", + "bbox": [ + 212, + 503, + 787, + 641 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Iterative self-refinement is one intrinsic ability humans possess when exploring unknown environments and solving complicated problems. Large language models (LLMs) agent systems [9,25,44] have demonstrated the effectiveness of self-refinement in better addressing natural language processing tasks, such as acronym generation, sentiment retrieval, text-based environment exploration, etc. Transitioning from text-only tasks to multimodal environments poses new challenges of improving, assessing, and verifying multimodal contents, such as multiple interleaved image-text sequences. For example, when learning to use T2I models, LMMs need to improve the generation with revised T2I prompts, assess multiple images in detail to select the best draft, and verify the draft image with the multimodal IDEA to provide text feedback. These steps, each requiring different multimodal understanding capabilities, jointly enable the intriguing multimodal iterative self-refinement ability. Such an LMM framework can au", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "IDEA", + "bbox": [ + 233, + 146, + 259, + 155 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "T21", + "bbox": [ + 295, + 147, + 310, + 155 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Idea2Img", + "bbox": [ + 344, + 147, + 390, + 156 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "IDEA", + "bbox": [ + 426, + 147, + 450, + 155 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "T21", + "bbox": [ + 486, + 147, + 503, + 155 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Idea2Img", + "bbox": [ + 535, + 147, + 583, + 156 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "IDEA", + "bbox": [ + 619, + 146, + 643, + 155 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "T21", + "bbox": [ + 676, + 147, + 697, + 155 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Idea2Img", + "bbox": [ + 727, + 147, + 774, + 155 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Object count", + "text_level": 1, + "bbox": [ + 223, + 159, + 287, + 167 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "5 people sitting around a table drinking beer and eating buffalo wings", + "bbox": [ + 220, + 171, + 267, + 213 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/5e13ef01c1210e5877d8c3ed8f0028b1e258330f5291f056b59eea75838c15e5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 271, + 169, + 334, + 217 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/615e24616c711460af3e8995ea583b55482f9a56df119d25021fae8e16e164a4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 336, + 169, + 398, + 217 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Knowledge", + "text_level": 1, + "bbox": [ + 413, + 159, + 470, + 167 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/c0907f7224cdf5a003d939cd996df99e0feeb44fb06bc624a28d825f32f260da.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 413, + 169, + 500, + 217 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/9acc7e2252db2c7931ab584971aea2a49f297c79a44c2ee404ca62224354782e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 504, + 169, + 589, + 217 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Visual design", + "text_level": 1, + "bbox": [ + 606, + 159, + 671, + 167 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/dde28c707e42cb7cdd3f9d560e9e083aee0f0ee5e37ce6ce9079776fa4d43de1.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 604, + 169, + 717, + 217 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/6d25c985509051fe656024ac42a3a0a55d59c668836fe3f87f28021378b57772.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 722, + 169, + 782, + 217 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Scene text", + "text_level": 1, + "bbox": [ + 223, + 220, + 274, + 228 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "a whole cake on the table with words Azure Research written on the cake", + "bbox": [ + 220, + 229, + 267, + 268 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/a57471431eb286f6d21cb899dbcde2039f4e87c50403d8a0ef23091f2e090cf9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 271, + 229, + 334, + 277 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/3121ab905d3ae8896ce1303d73c0a4e6dcb144fa5695ecef228bfed6dabc5b74.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 336, + 229, + 398, + 277 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Prompt following", + "text_level": 1, + "bbox": [ + 413, + 220, + 500, + 228 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "a plan that has no barriers or obstacles; there is a glass without orange juice next to it", + "bbox": [ + 413, + 229, + 462, + 268 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/ca32aed4598040e85792a99fd8bebe2beb4a793ed6594256da1c6ef5a27463a0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 464, + 229, + 589, + 277 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Intended usage", + "text_level": 1, + "bbox": [ + 607, + 220, + 683, + 228 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "an image of a car perfect for a children's painting competition", + "bbox": [ + 604, + 229, + 651, + 268 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/f8f62c1c5f89dbcc558a7ebde421fecfc6ca47fb478c4996e16966a2045a4743.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 653, + 229, + 717, + 277 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/d8682c0070598df6acbc14c405f873d399ee47e84fe44c2d259814709a665e85.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 720, + 229, + 782, + 277 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Concept customization & visual pointing", + "text_level": 1, + "bbox": [ + 223, + 282, + 419, + 291 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "photo of the obje by the blue arrow brown corgi dog", + "bbox": [ + 222, + 292, + 267, + 338 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/ad23c7881fbedb4c69735105f2bafe0a141a118a7ee8fdca82b697ddf363c4fe.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 297, + 292, + 357, + 338 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/7f071f2c9e591e3232ee6379bce623a73e59ea5b1ffb90e07fedf786595e7211.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 370, + 292, + 433, + 339 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/68f5fdd755ec40f10316a622495a7fa48c7cb119fe1bb1c44abab67df66a039a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 434, + 292, + 500, + 339 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Visual attribute referring", + "text_level": 1, + "bbox": [ + 504, + 282, + 627, + 291 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/bb40aa58800fc30699d13f0db48a942fe7af31b39c2770e1b98b7b0c1372dbeb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 506, + 292, + 643, + 339 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/df07e30f24e538768846a0e9ebf4c04837f573d7460847f40f75ce2f6b8f1203.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 653, + 292, + 717, + 339 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/66f475d4174a3e443aafbd56ebd14e56e57f54ecaa37b315009e73843f4651cd.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 720, + 292, + 782, + 339 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Style transfer", + "text_level": 1, + "bbox": [ + 223, + 343, + 289, + 351 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "painting of a corgistyle similar to theimage", + "bbox": [ + 222, + 352, + 267, + 388 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/1f21a76ed0a19268c34c3e8d1c0e81d7c09e406cc79aa3d491fa95a5631f02d9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 297, + 353, + 357, + 398 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/3d29a2e40a7bad267e0760e03b89c11e9b3afb7f3debcb82a06bb14ed6eb07e7.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 370, + 352, + 433, + 401 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/4d163b486b7dc4d45446e4c3376b21989a60752c708c04eacbff17cf01ad52e9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 434, + 352, + 500, + 401 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Opposite style transfer", + "text_level": 1, + "bbox": [ + 504, + 343, + 619, + 352 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "painting of a corgi dog with style different from the image", + "bbox": [ + 506, + 353, + 576, + 386 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/a13c249e594bead09c65206026e0661932bd7282930dd559442eab58df435f53.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 584, + 353, + 642, + 398 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/fbc46284f4b1621b2859dfd91dde707f94e818255f03cae9729ebc823a4f1f95.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 653, + 352, + 717, + 401 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/16e0dfd709fa70f1129d92e8b79e960746513941ebec7a6e0d05c2f02a06b5f3.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 720, + 352, + 782, + 401 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Image manipulation", + "text_level": 1, + "bbox": [ + 223, + 405, + 321, + 412 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "a drawing with the background chain", + "bbox": [ + 222, + 414, + 267, + 445 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/6c443abaf74902e3dd66d77f34e2bd0674c2c13d592ef8cca0b401a359f9e924.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 297, + 414, + 362, + 460 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/16557e08d1a037697d57d102e130bea58ae64543f22b0bfc195443ca49048b12.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 370, + 414, + 433, + 460 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/2d26672c68ecd8824ad0e0af1d6733ae5e44ffd183483b3c715cf605a630932b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 434, + 412, + 500, + 460 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A hand drawing of room\nThe people can sleep and study. Hand drawing shows\nthe sketch and looks like the\ngiven image.", + "bbox": [ + 504, + 414, + 576, + 452 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/f6d911c64cd008d4a9632319f9c15a7bed8ad06c7fc5c858bf018119fbe77343.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 584, + 414, + 642, + 460 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/244fe835042e89c35167f1e84bd503a508c7756383c2f5f991bc6485a1cd0b5d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 653, + 412, + 717, + 460 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/043c8d6813b94323dabfd7b8a17dcdd65361acae9c030a3a38be5a0e0d0d5c81.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 720, + 414, + 782, + 460 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In-context entity and style transfer", + "text_level": 1, + "bbox": [ + 223, + 465, + 392, + 473 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Find the the image style pattern in the left two dog images and apply it on the to right people in tree pose. Find the text in detail description that keeps the content in the people in tree pose image, with the correct style pattern.", + "bbox": [ + 222, + 474, + 297, + 523 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/e904bacfa14eb290c2accdb99b9ebd5c85ef1ae1bd1d5f122701a289ca0a8146.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 297, + 474, + 362, + 522 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/5a682e2ce9e2e8e6ba0877a6b9d704a3231f80c878bbf9da1c2f24eecc9eb621.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 370, + 474, + 433, + 522 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/08a40902270550b3aa9ab0a1f02248f49a1f8680cb25a2434271d34665850d5f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 434, + 474, + 500, + 522 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Photo of Bill Gates with the same cloth as in the given image", + "bbox": [ + 504, + 474, + 558, + 522 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/8b4ab19bdc4d774addf2ef12343a28383771084374721cbad500f82203eda336.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 560, + 474, + 625, + 521 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/9c31092f8037c4fe15d99649c4b6113cb3bf280ab223da2093cc908df60bcefc.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 627, + 474, + 717, + 522 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/485eb795f8a5365e9ff96144305bc63d27a457f13532f9bb878300fa08d1df88.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 720, + 473, + 782, + 522 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Visual attribute referring & style transfer", + "text_level": 1, + "bbox": [ + 223, + 525, + 421, + 534 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A painting of a tennis game", + "bbox": [ + 222, + 536, + 267, + 575 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/c8b3a7c85f9adf62af751ab8d909f31f715f26e8b7a338a34f573cd02f7e2630.jpg", + "image_caption": [ + "Fig. 2: Overview of the image design and generation scenarios enabled by Idea2Img. In each sub-figure, the image and text in the left green box are the user input IDEA. The center image is the baseline results directly generated by the same T2I model with a human-written T2I prompt, and the image on the right is generated with the T2I prompt discovered by Idea2Img's iterative self-refinement exploration." + ], + "image_footnote": [], + "bbox": [ + 297, + 536, + 343, + 575 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/13d44f666f5e9c28160dfc8482c179e93771cd7f82d8b7cbcf69f201a6c642d6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 344, + 536, + 433, + 582 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/8dfe9fab3d5a057fd083b76b392aaffe996a2e7f3aca760bd65e9c8527a46472.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 434, + 536, + 500, + 582 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A logo with a design that naturally blends the two given colors as a new logo. The first image is", + "bbox": [ + 504, + 536, + 558, + 583 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/b004832f502ca769d25897eadca35c6022c80365f44a6276231b3a45b866ec2f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 560, + 536, + 625, + 582 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/be6185a0bd954b001d0c04ba16f8430ca08379f002b3f52f14a7b105f6b05bd7.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 627, + 536, + 651, + 582 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/fe1d10b4d08b3c8639c8362045b14a6e6b531158e36ce4a110384d001da28f5c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 666, + 541, + 705, + 578 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/aadac95d1d882a8c210a27e6ea05af46ee54ecfb18c7b1759536193391f72812.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 732, + 541, + 769, + 578 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "IDEA", + "bbox": [ + 282, + 585, + 307, + 594 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "T21", + "bbox": [ + 392, + 585, + 408, + 594 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Idea2Img", + "bbox": [ + 442, + 585, + 491, + 595 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "IDEA", + "bbox": [ + 566, + 585, + 591, + 594 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "T21", + "bbox": [ + 676, + 585, + 692, + 594 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Idea2Img", + "bbox": [ + 727, + 585, + 774, + 595 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "tomatically learn to tackle various real-world problems [55] via self-exploration, such as navigating GUI to use electronic devices, exploring unknown physical environments via an embodied agent, engaging in electronic games, and so on. In this study, we focus on \"image design and generation\" as the task to study the multimodal iterative self-refinement ability.", + "bbox": [ + 212, + 715, + 784, + 791 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To this end, we introduce Idea2Img, a multimodal iterative self-refinement framework for automatic image design and generation. As illustrated in Figure 1, Idea2Img involves an LMM, GPT-4V(ison) [1, 29-31], interacting with a", + "bbox": [ + 212, + 794, + 784, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 266, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "T2I model to probe its usage and find an effective T2I prompt. The LMM will act in different roles to analyze the return signal from the T2I model (i.e., draft images) and design the next round's queries (i.e., text T2I prompts). The three roles of generating T2I prompts, selecting draft images, and reflecting feedback together enable the multimodal iterative self-refinement ability. Specifically, (1) Prompt generation: GPT-4V generates $N$ text prompts that correspond to the input multimodal user IDEA, conditioned on the previous text feedback and refinement history; (2) Draft image selection: GPT-4V carefully compares $N$ draft images for the same IDEA and select the most promising one; (3) Feedback reflection: GPT-4V examines the discrepancy between the draft image and the IDEA. GPT-4V then provides feedback on what is incorrect, the plausible causes, and how T2I prompts may be revised to obtain a better image. Furthermore, Idea2Img is enhanced with a memory module that stores all prompt exploration histories, including previous draft images, text prompts, and feedback. The Idea2Img framework iterates among these three steps with GPT-4V for automatic image design and generation.", + "bbox": [ + 212, + 146, + 787, + 388 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To users, Idea2Img functions as an enhanced image design and generation assistant. Compared with T2I models, Idea2Img can handle design instructions instead of requiring detailed image description, support the multimodal IDEA input, and generate images of better semantic and visual qualities. We overview representative image design and generation scenarios in Figure 2. For example, Idea2Img can incorporate the visual design and intended usage description in IDEA, extract arbitrary visual information from the input image, and process IDEA with arbitrarily interleaved image-text sequences. Built upon these new functionalities and scenarios of interest, we develop an evaluation IDEA set with 104 samples, containing complicated queries that humans may fail in their first trials. We perform user preference studies on Idea2Img with different T2I models. The consistent user preference score improvements on different image generation models, e.g., $+26.9\\%$ with SDXL [34], indicate the effectiveness of Idea2Img in image design and generation.", + "bbox": [ + 212, + 390, + 787, + 601 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Our contributions are summarized as follows.", + "bbox": [ + 238, + 604, + 566, + 618 + ], + "page_idx": 3 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We study \"automatic image design and generation,\" which aims to create an image from an input IDEA. This new multimodal IDEA input enables visual creation with reference image inputs and instructions on desired designs.", + "- We explore the multimodal iterative self-refinement ability in GPT-4V-based agent systems, showcasing its effectiveness in improving, assessing, and verifying multimodal contents.", + "- We propose Idea2Img, a multimodal iterative self-refinement framework that enhances any image generation model for visual design, enabling various new image creation functionalities, and achieving better generation qualities.", + "- We present an evaluation set with 104 challenging multimodal IDEA. The consistent user preference score improvements, when experimented on different image generation models, indicate Idea2Img's effectiveness in automatic image design and generation." + ], + "bbox": [ + 223, + 637, + 784, + 835 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 143, + 387, + 160 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "LLM-based self-refinement. Idea2Img is inspired by the effectiveness of iterative self-refinement in LLM-based agent systems [25,32,44] in exploring unknown environments and tasks, built upon the successful LLM agents [15,33,35,41,54, 59,64]. Self-refine [25] takes the same LLM to iteratively critique its outputs and leverage this feedback to enhance its predictions, showing effectiveness across various NLP tasks. Reflexion [44] explores a self-reflective LLM system on the text-based environment exploration task [45] and multi-hop QA [58]. Despite the success, LLM-based self-refinement naturally can not understand multimodal inputs. Consequently, the explored tasks and environments are limited to the natural language description, such as AlfWorld [45]. Idea2Img explores the potential of an LMM-based iterative self-refinement system for multimodal environment exploration, from a simple T2I model to other more complicated environments.", + "bbox": [ + 212, + 208, + 787, + 391 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Multimodal agents. Our Idea2Img is related to multimodal agents [16, 22, 24, 42, 47, 50, 56, 62] that chain external tools such as T2I or vision-language models with LLMs for multimodal tasks. For instance, MM-ReAct [56] integrates ChatGPT with multiple vision tools for multimodal reasoning and action, enabling it to solve various complicated visual understanding tasks. Visual ChatGPT [50] empowers ChatGPT to allocate various image generation models, such as Stable Diffusion [38], img2img model [26], ControlNet [63], enabling multi-step visual editing and generation. The primary difference between Idea2Img and existing multimodal agent studies [50, 56] lies in the approach to understand the tool usage. Existing studies assume the knowledge of how to best use each tool and provide such information to LLMs via text instructions or in-context examples. In contrast, the optimal usage of the tool remains unknown in Idea2Img and requires iterative exploration. Another minor distinction is that Idea2Img utilizes LMMs instead of LLMs, thereby does not require general visual understanding tools such as a caption model [48, 51].", + "bbox": [ + 212, + 395, + 787, + 625 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Extensions of base T2I models. Idea2Img provides a more natural way for users to design and produce their desired visual content. This framework, which extends T2I models for new functionalities, is related to various works in improving base T2I models [34, 37, 38, 40, 61]. These studies include extending the base T2I model to better follow user prompts [5, 7, 10, 12], finding magic words in T2I prompts for better visual quality [49, 65], supporting extra image input for image manipulation [6, 17, 18, 26], style transfer [13], visual concept customization [2, 8, 19, 39, 43], and so on. While specialized T2I extensions can address a single specific functionality, Idea2Img offers a more unified and widely applicable framework. That is, a single Idea2Img framework can handle various generation scenarios, ranging from style transfer to attribute customization, without requiring separate models or task-specific model design and finetune. More importantly, Idea2Img effectively collaborates with those enhanced generative models, consistently improving them by exploring suitable text prompts.", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 264, + 113, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/f77c1b2c1de8419a4a8c23b24d62bc3301ce94f04f992d98fda7e76db2c72724.jpg", + "image_caption": [ + "Fig. 3: The framework overview of Idea2Img, which takes an LMM [29,30] to explore a T2I model via multimodal iterative self-refinement, leading to an effective T2I prompt for the input user IDEA. The rounded rectangle shape indicates a GPT-4V call." + ], + "image_footnote": [], + "bbox": [ + 220, + 148, + 782, + 338 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3 Idea2Img Framework", + "text_level": 1, + "bbox": [ + 215, + 421, + 459, + 439 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 3 illustrates the Idea2Img framework. Idea2Img framework involves two core pre-trained models, i.e., the GPT-4V(ison) as the LMM $\\mathcal{M}$ and a text-conditioned image generation model $^2$ to explore $\\mathcal{G}$ . Idea2Img also contains a memory $m$ that stores insights on $\\mathcal{G}$ discovered by $\\mathcal{M}$ during previous iterations. Execution flow. We begin with an overview of the key steps in $\\mathcal{M}$ iteratively exploring the use of $\\mathcal{G}$ . Starting from the top-left of Figure 3, \"initial prompt generation\" converts the input multimodal user IDEA into T2I text prompts, later producing multiple draft images with T2I model $\\mathcal{G}$ . \"Draft image selection\" then selects the best draft image among them for the current iteration. The selected image is either output as the final prediction or continues for further refinement, depending on the stop condition. For the latter, \"feedback reflection\" compares the current best draft image with the multimodal IDEA, and summarizes the major discrepancy as text feedback. With the iteration history and text feedback, \"revised prompt generation\" then drafts revised T2I prompts and continues the iterative self-refinement with the new set of draft images.", + "bbox": [ + 212, + 454, + 787, + 680 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "$\\Theta$ Initial prompt generation. This step generates $N$ initial T2I prompts $\\{y_0^0,\\dots ,y_0^{N - 1}\\}$ following the input user IDEA $x$ , by prompting $\\mathcal{M}$ with LMM prompt $p_{gen}$ :", + "bbox": [ + 215, + 681, + 787, + 731 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\left\\{y _ {0} ^ {0}, \\dots , y _ {0} ^ {N - 1} \\right\\} = \\mathcal {M} (x, p _ {\\text {g e n}}) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 729, + 785, + 750 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The \"initial prompt generation\" requires $\\mathcal{M}$ to understand multimodal user IDEA $x$ and convert design IDEA into descriptive T2I prompts. LMM prompt $p_{gen}$ is a zero-shot prompt without in-context examples.", + "bbox": [ + 212, + 753, + 787, + 801 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 5 + }, + { + "type": "page_footnote", + "text": "2 We will show image generation models other than T2I later in experiments. For clarity, we use T2I as a representative generation model to introduce Idea2Img.", + "bbox": [ + 217, + 810, + 785, + 840 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "With the \"initial prompt generation\" step, Idea2Img can understand user IDEA with interleaved image-text sequences, instead of the text-only T2I prompts containing the image description. Specifically, (1) IDEA can be a high-level design or usage instead of the detailed image description, such as \"a car image for a children's painting competition\"; and (2) IDEA can take multiple images and use interleaved text instruction to extract arbitrary visual information of interest, including image style, visual entity, object attributes, etc. Then, in iteration $t = 0$ as well as future iterations $t = t$ , each T2I prompt $y_{t}^{n}$ is separately sent to the T2I model $\\mathcal{G}$ , resulting in $N$ draft images $i_{t}^{n} = \\mathcal{G}(y_{t}^{n})$ , $n = 0, \\dots, N - 1$ .", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "$\\boxed{2}$ Draft image selection. With the $N$ draft images in iteration $t$ , \"draft image selection\" selects the best draft image $i_t^*$ by prompting $\\mathcal{M}$ with LMM prompt $p_{select}$ :", + "bbox": [ + 212, + 284, + 787, + 330 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\ni _ {t} ^ {*} = \\mathcal {M} \\left(i _ {t} ^ {0}, \\dots , i _ {t} ^ {N - 1}, x, p _ {\\text {s e l e c t}}\\right). \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 330, + 784, + 347 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The design of a \"draft image selection\" step is motivated by the observation that T2I models could generate bad images with good prompts. This step is designed to filter out low-quality images, and avoid the quality perturbation to dominate the iterative refinement.", + "bbox": [ + 212, + 354, + 787, + 412 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The task of selecting the best image requires $\\mathcal{M}$ to compare and grade both the semantics and visual quality of $N$ similar draft images. We find such a \"spot the difference\" task challenging for LMMs, and only the very recent models [29, 55] are capable of performing the selection reliably.", + "bbox": [ + 212, + 415, + 787, + 474 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "③ Feedback reflection. After obtaining the selected image $i_{t}^{*}$ , the framework checks the stop condition, such as if the current iteration $t$ exceeds the maximum $T$ . Idea2Img then outputs $i_{t}^{*}$ as the output image or proceeds the refinement process to the \"feedback reflection\" step accordingly.", + "bbox": [ + 212, + 477, + 787, + 537 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "\"Feedback reflection\" aims to provide text feedback $f_{t}$ that describes the direction to improve for draft image $i_{t}^{*}$ . The steps prompts $\\mathcal{M}$ with LMM prompt $p_{fb}$ , conditioned on the draft image $i_{t}^{*}$ and memory $m$ :", + "bbox": [ + 212, + 539, + 787, + 585 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nf _ {t} = \\mathcal {M} \\left(i _ {t} ^ {*}, m, x, p _ {f b}\\right). \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 424, + 598, + 784, + 614 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "\"Feedback reflection\" takes $\\mathcal{M}$ to compare an image $i_t^*$ with the multimodal user $IDEAx$ , and summarize the gap as text feedback $f_{t}$ . The step not only requires $\\mathcal{M}$ to identify the discrepancy between image $i_t^*$ and $IDEAx$ , but also benefits from writing the major errors to make the iteration effective. In practice, we find it helpful to explicitly specify the aspects to check, such as style, entity, attributes, appearance, etc., via text instructions or in-context examples in LMM prompt $p_{fb}$ . Furthermore, we add text instructions to $p_{fb}$ to have $\\mathcal{M}$ \"focus on one thing to improve in each feedback,\" and \"provide a high-level explanation of how to modify prompts to address the given feedback.\"", + "bbox": [ + 212, + 625, + 787, + 761 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "$\\boxed{4} / \\boxed{1}$ Revised prompt generation. Finally, \"prompt generation\" takes text feedback $f_{t}$ and memory $m$ to draft $N$ revised prompt $\\{y_{t+1}^{0}, \\ldots, y_{t+1}^{N-1}\\}$ , by prompting $\\mathcal{M}$ with LMM prompt $p_{\\text{revise}}$ :", + "bbox": [ + 212, + 762, + 787, + 811 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\left\\{y _ {t + 1} ^ {0}, \\dots , y _ {t + 1} ^ {N - 1} \\right\\} = \\mathcal {M} \\left(f _ {t}, m, x, p _ {\\text {r e v i s e}}\\right). \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 359, + 823, + 784, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 264, + 113, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Generating revised prompts requires $\\mathcal{M}$ to understand the property of $\\mathcal{G}$ stored in memory $m$ , thereby drafting new T2I prompts that could most likely address the issue identified in $f_{t}$ . We empirically demonstrate that Idea2Img can generate better prompts for $\\mathcal{G}$ via iterative self-refinement.", + "bbox": [ + 212, + 146, + 787, + 205 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Memory module. Memory $m$ is one important design in Idea2Img. $m$ has the format of interleaved image-text sequences that store all previous iterations' feedback, selected draft image, and the corresponding text prompts:", + "bbox": [ + 212, + 207, + 787, + 253 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nm _ {t} = \\left[ y _ {0} ^ {*}, i _ {0} ^ {*}, f _ {0}, \\dots , y _ {t - 1} ^ {*}, i _ {t - 1} ^ {*}, f _ {t - 1} \\right]. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 263, + 785, + 281 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "It allows LMM $\\mathcal{M}$ to understand the properties and capabilities of the T2I model $\\mathcal{G}$ in use, such as a keyword that $\\mathcal{G}$ may not understand or a complicated scene that $\\mathcal{G}$ fail to generate, and incorporate such knowledge in generating the revised T2I prompts $y$ . For example, it may describe the appearance of a yoga pose in detail, instead of only mentioning its name in $y$ . Examples are shown in Appendix Figures A-D, when comparing initial and refined prompts $y_0$ and $y_T$ .", + "bbox": [ + 212, + 290, + 787, + 383 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 402, + 375, + 421 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Experiment Settings", + "text_level": 1, + "bbox": [ + 214, + 434, + 431, + 450 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Compared model variants. We mainly compare the following three models in image generation.", + "bbox": [ + 212, + 459, + 787, + 491 + ], + "page_idx": 7 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- \"Initial-round manual prompt\" is the baseline T2I prompt written by humans with minor prompt engineering. It serves as the baseline of a T2I prompt that merely contains key information in IDEA.", + "- \"Initial-round Idea2Img prompt\" is the LMM-generated T2I prompt in the initial round. Specifically, the max iteration $T = 1$ , and LMM $\\mathcal{M}$ is only used for initial prompt generation and draft image selection, but not feedback reflection nor revised prompt generation. This Idea2Img variant is used to ablate Idea2Img's gain from prompt generation and selection, vs. the further iterative refinement.", + "- \"Iterative self-refined Idea2Img prompt\" is complete Idea2Img pipeline with the max iteration $T = 3$ ." + ], + "bbox": [ + 223, + 498, + 784, + 661 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Evaluation samples and metrics. For the quantitative evaluation, we collect a dataset of 104 user IDEA as input queries. Among them, 33 queries contain text only, 43 queries contain an image-text sequence with a single image, and the remaining 28 contains a sequence with two or more images. The text in most IDEA contains not only descriptive content text that describes the scene to generate, but also instructional text such as \"a logo for commercial advertising\" or \"generate the pointed dog in blue.\" All test queries are manually composed.", + "bbox": [ + 212, + 672, + 787, + 779 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We then perform the user preference study as the main quantitative metric. Users are presented with the IDEA and multiple images to select the best one for each IDEA. The evaluation script automatically shuffles the order during evaluation to prevent the influence of image orders.", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/b827b6c2cf0e26ab34abd13c15022bec22754713ab1b551ccdf614557e23fce6.jpg", + "table_caption": [ + "Table 1: User preference scores when applying Idea2Img onto different image generation models (compare the three scores in the middle section within each row individually). We observe that \"Iterative self-refined Idea2Img prompt\" is consistently favored across all experimented image generation models. $\\varDelta_{\\mathrm{iteration}}$ reports the preference gain from the iterative Idea2Img over the initial-round Idea2Img." + ], + "table_footnote": [], + "table_body": "
User preference score (%)Initial-round manual promptInitial-round Idea2Img promptIterative self-refined Idea2Img promptΔiteration
SDXL v1.013.529.856.7+26.9
DeepFloyd IF14.434.651.0+16.3
SD v2.113.540.446.2+5.8
SD v1.58.643.348.1+4.8
SDXL-img2img8.634.656.7+16.3
IF-img2img8.638.552.9+14.4
", + "bbox": [ + 230, + 224, + 767, + 342 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/61af0acc3da68a8818044962d683f9fc14f60170ae2426ea12876ef7182a9606.jpg", + "image_caption": [ + "Fig. 4: User preference scores among T2I models before and after iterative self-refinement. We observe that the initially favored T2I model, SDXL, benefits more from the Idea2Img iteration." + ], + "image_footnote": [], + "bbox": [ + 330, + 354, + 671, + 498 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Experimented T2I models. We experiment Idea2Img on a wide variety of T2I model $\\mathcal{G}$ with diverse model capacities and functionalities. Specifically, we study Stable Diffusion (SD) v1.5 [38], SD v2.1, SDXL v1.0 with refiner [34], and DeepFloyd IF (IF-I-XL and IF-II-L) [20]. Other than T2I models, we also consider the img2img pipeline (i.e., SDEdit [26]) for SDXL and DeepFloyd IF, as a demonstration of using Idea2Img for the text-conditioned image-to-image generation. The default strength $t_0$ in the img2img pipeline is 1.00. SDXL-img2img and IF-img2img are the same as SDXL and IF (i.e., T2I) when IDEA contains text only, and condition on the first image with IDEA contains multiple images. LMM prompts $p_{gen}, p_{select}, p_{fb}, p_{revise}$ are kept the same for all experimented T2I models. Appendix Section B shows the complete LMM prompts.", + "bbox": [ + 212, + 580, + 787, + 750 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Image Generation Results", + "text_level": 1, + "bbox": [ + 214, + 768, + 478, + 784 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "User preference evaluation. Table 1 compares the user preference when selecting from the three images generated by \"initial-round manual prompt,\" \"initial-round Idea2Img prompt,\" and \"iterative self-refined Idea2Img prompt.\"", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "for each user IDEA with the same T2I model. Among T2I models with different model sizes and functionalities, Idea2Img leads to consistent improvements in user preference. The initial-round Idea2Img prompt already improves the initial-round manual prompt, by effectively understanding the multimodal user IDEA and selecting the best draft images. The full Idea2Img framework further improves from the initial-round Idea2Img results with the multimodal iterative self-refinement. For example, when using SDXL v1.0, users prefer the images generated by Idea2Img $59/104 = 56.7\\%$ times, compared with the baseline of $14/104 = 13.5\\%$ . Similar improvements are observed on all experimented T2I models, as shown in the bolded column \"iterative self-refined Idea2Img prompt.\"", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Furthermore, we examine which T2I model benefits the most from the LMM iterative self-refinement. By comparing the $\\Delta_{\\mathrm{iteration}}$ in Table 1 that represents the difference between first-round and iterative Idea2Img user preference, we observe that stronger T2I models tend to benefit more from LMM refinements. For example, SDXL and IF become more favored $26.9\\%$ and $16.3\\%$ times after iteration, compared with the $5.8\\%$ and $4.8\\%$ for SD v2.1 and SD v1.5. The trend that stronger T2I models benefit more from Idea2Img is also observed in Figure 4's analysis, where users pick their preferred image generated by different T2I models. After Idea2Img's iterative refinement, the initially favored model SDXL benefits more from the iteration, resulting in an even higher user preference rate, from $46.2\\%$ to $65.4\\%$ . We conjecture that the better language understanding ability in stronger T2I models enables them to better follow revised T2I prompts. They also have a better image generation capability that makes it possible to generate challenging scenes, when given a good T2I prompt optimized by Idea2Img. Nonetheless, Idea2Img is effective across T2I models of varying capacities, consistently leading to a higher user preference score.", + "bbox": [ + 212, + 301, + 787, + 544 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Qualitative comparisons. Idea2Img could help users generate images that better follow IDEA, such as the correct object counts in Figure 5(a). Idea2Img enables visual content design, in contrast to conventional T2I that requires a detailed visual content description. For example in Figure 5(b), Idea2Img designs visual logo based on the instruction of \"a logo for a 2024 conference in Seattle.\" The power of LMMs allows Idea2Img to extract arbitrary information from the input image for visual generation. This could be any object in the image like \"the circled dog\" in Figure 5(c) or the image style like in Figure 5(d). Such general visual conditioning ability can be seamlessly extended to compose multiple visual and text conditions, such as composing the camera angle and image style in Figure 5(e) and two objects in Figure 5(f).", + "bbox": [ + 212, + 547, + 789, + 715 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Other than SDXL, Idea2Img is effective in finding text prompts for other image generation models. This includes arbitrary T2I models (e.g., SD v2.1 [38], DeepFloyd IF [20], DALL-E 3 [28], etc.), text-conditioned image-to-image models (e.g., SDXL-img2img and IF-img2img with SDEdit [26]), and other specialist generation models (e.g., reward-tuned T2I [11,21], region-controlled generators [23,57,63], and other specialist models [3,6,39]). Figure 6 overviews Idea2Img working with different image generation models. We show additional qualitative results and discussions in Appendix Section A.1.", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/ff6e2f54ee9ff98dcb1231dc24be3a07b3607f28e4499cfd797b2810b0243791.jpg", + "image_caption": [ + "Fig. 5: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with SDXL [34] as the T2I model." + ], + "image_footnote": [], + "bbox": [ + 246, + 146, + 754, + 462 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "How Idea2Img may assist humans? We use selected qualitative results to highlight the scenarios where humans might find Idea2Img most helpful in image design and generation, compared with conventional T2I generation.", + "bbox": [ + 215, + 530, + 787, + 575 + ], + "page_idx": 10 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. New functionalities with multimodal IDEA inputs. Idea2Img provides a more natural way for human interaction, where users do not have to describe their desired image solely through texts and painstakingly search for the right prompt word. Instead, the multimodal IDEA allows Idea2Img to precisely extract specific elements from one or multiple input images, such as the dog breed and color, pointed objects, artist style, camera view, and more, as shown in Figure 5. Finding proper words that the T2I model can understand for such visual concepts could be tedious for humans, e.g., the art style \"with bold lines and bright colors, with a cubist and surrealistic style, with a focus on geometric shapes and patterns.\" in Figure 5(d). Idea2Img automates this process via Idea2Img iterative self-refinement.", + "2. New functionalities with instructional inputs. Vanilla T2I models struggle to understand T2I prompts that describe the intended visual design or purpose of the generated image, such as \"a logo for a 2024 conference held in Seattle\" in Figure 5(b). Instead, the prompt needs to be a comprehensive description of the image to generate, demanding extra drafting effort from users, such as \"...the Seattle skyline in the center and the conference title" + ], + "bbox": [ + 220, + 583, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 266, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/98782994c053252840956b8e7315d7dc1269296e36a7cf5c2ab2cad15b38983c.jpg", + "image_caption": [ + "Fig. 6: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with different image generation models. Additional qualitative results and discussions are in Appendix A.1." + ], + "image_footnote": [], + "bbox": [ + 246, + 143, + 754, + 439 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "below it ...\". In contrast, Idea2Img effectively understands the instructional texts in IDEA and creates images accordingly.", + "bbox": [ + 240, + 523, + 784, + 553 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "3. Better semantic and visual quality. Finally, the iterative refinement allows Idea2Img to generate images with better semantic and visual qualities, leading to an effective automatic image creation assistant.", + "bbox": [ + 220, + 554, + 784, + 599 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 LMM Feedback, Revision, and Selection", + "text_level": 1, + "bbox": [ + 215, + 632, + 591, + 647 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We show representative LMM outputs for \"feedback reflection,\" \"revised prompt generation,\" and \"draft image selection.\" Additional results are in Appendix A.2. Feedback reflection. Figure 7(a) shows the text feedback generated by GPT-4V for the user IDEA and the draft image and T2I prompt. Idea2Img can effectively check if the generated image is correct, and verify if the draft image corresponds to the visual descriptions in IDEA. This includes the breed of the dog in (a.1), as well as art styles, objects, visual attributes, etc. In addition to identifying the discrepancy, Idea2Img also points to the plausible directions that may improve the T2I prompt in the text feedback. For example, in (a.2), Idea2Img provides guidance to have generated images better follow the user intention of \"an image for a children's painting competition,\" by \"specifically mentioning that the car should be simple and cartoon-like.\"", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/0efa328db2f0df6b87158593670c825d0028bf463d6e56677785975bf0714bfb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 236, + 145, + 387, + 258 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d514d8be8b74ae2cf14a8ab3635b658c11d438fc4ea862f76ea027b78ba3a5a6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 395, + 145, + 517, + 258 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/a20eb9469b23a5124a9bf92f5ace2ea5b3951eb5b188ccff9d144bfa8be9a10d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 589, + 145, + 764, + 258 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/dd191f143c0e204985253e35e8ed203665e98373a7504f6aabd22b696e5f0ec1.jpg", + "image_caption": [ + "(a) Feedback reflection: The right column shows the examples of generated text feedback." + ], + "image_footnote": [], + "bbox": [ + 238, + 273, + 387, + 334 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/dd3538bdb1722f43422b9a4ea5e5ae175a24bb3183e3fe207bf41aab4ce6b6dc.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 395, + 275, + 602, + 335 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/1ecf56695e6ffa93363acf9e0cbb3eab527099f2a093a79083f3c4688fa3b0e2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 609, + 275, + 764, + 335 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/6b202203dcf4289450c9b511bd6694c93806925d3383b93505255933746a6d5f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 238, + 337, + 387, + 387 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5f75030b4a5c3a053463a85268a71ede8285cc389e2bb3b4dd344a49e7371b59.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 395, + 337, + 602, + 388 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/a0414c5df664e9b973c4ff07a101370ab2093ca9ea536e7e7a21f553f8b25abf.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 609, + 337, + 763, + 388 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d43770d4933eb5bbb4b94e09f3bc4bf9a9d270097fa81e50afd2146df565f33b.jpg", + "image_caption": [ + "(b) Revised prompt generation: The right column shows the examples of revised prompts." + ], + "image_footnote": [], + "bbox": [ + 238, + 404, + 387, + 463 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/8c2c91a41b987998e35f7b1a741c3b94402d5d7a47c009c24491884607bf08a9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 395, + 405, + 602, + 465 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/1dcce2754b33014d3cc2e39b77725f21bd42b49056b50b192c3803c6c369fa89.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 609, + 405, + 764, + 465 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d71f25e363574f77f808930acfce4bf278a14c0b106e0ec8f9276f6d7d7ea692.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 238, + 469, + 387, + 520 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/0e92a7c4196c9296c9efc25f9459be58c76f19e9b231186b2d1248cde54747fb.jpg", + "image_caption": [ + "(c) Draft image selection: The right column shows the examples of the draft image selection index and justification.", + "Fig. 7: GPT-4V's outputs in Idea2Img for image feedback, revision, and selection." + ], + "image_footnote": [], + "bbox": [ + 395, + 467, + 602, + 522 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d799b1de86dcc992ff7612ac2ee84744e4b8e1b0382e7af753c03aa9d9c41369.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 609, + 469, + 763, + 522 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Revised prompt generation. Figure 7(b) compares the T2I prompts before and after the prompt revision, showcasing how text feedback may help the refinement. For example, in (b.1), the revised T2I prompt specifies \"an empty plate with no other objects\" to preclude the T2I model from generating bananas, which occurred with the previous prompt \"no bananas.\" In (b.2), the revised T2I prompt includes a detailed description of \"a yellow tennis outfit\" and \"a Yorkshire Terrier\" to generate the queried clothing and dog.", + "bbox": [ + 212, + 609, + 787, + 715 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Draft image selection. Performing draft image selection requires LMMs to compare multiple similar draft images and pick the one that best matches the multimodal input $IDEA$ . Figure 7(c) shows the selection results generated by $Idea2Img$ . GPT-4V is prompted to give justifications and scores for each draft image, in addition to the final selection. We observe that $Idea2Img$ could comprehensively judges different aspects in $IDEA$ , and gives reasonable scores and selection indexes. E.g., finding the image with both sleep and study area in (c.1), verifying content and style in (c.2), and other examples in Appendix Figure G.", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 266, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Limitation and Discussion", + "text_level": 1, + "bbox": [ + 215, + 143, + 504, + 160 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Tasks beyond image generation. Idea2Img explores the emergent ability of multimodal self-refinement in LMM-based systems, through the image design and generation task. Specifically, Idea2Img views the T2I model to use as an unknown multimodal environment to explore, and iteratively refines T2I prompts to find its optimal usage. This concept mirrors the intrinsic human approach of iterative problem-solving when faced with unknown environments or challenges. We leave its extension to other intriguing tasks, e.g., GUI navigation [53], embodied agents [27], and complicated visual reasoning [36, 52], for future exploration.", + "bbox": [ + 212, + 186, + 787, + 308 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "From a single image generation model to multiple tools. Idea2Img explores using a single image generation model, such as a text-to-image model [38] or a text-conditioned image-to-image model [26]. When needed, other specialized generative models like ControlNet [63], inpainting [3], region-controlled T2I generation [23,57], customized generation [8,39], and video generation [46,60] can be seamlessly switched and supported. That is, Idea2Img could broadly boost different visual generation models of diverse specialties by exploring their optimal text description or instruction prompts. Beyond a single generation model, Idea2Img can also be used to allocate multiple tools as in multimodal agent studies [50,56]. In this case, Idea2Img isn't limited to optimizing the use of individual tools but also investigates their effective collaboration when used together, such as generator selection and multi-step visual generation.", + "bbox": [ + 212, + 309, + 787, + 489 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Consolidating explored knowledge. We have shown the effectiveness of LMM iterative self-refinement in automatic image design and generation. Idea2Img can also help to consolidate or distill the explored knowledge into T2I model parameters, such that no inference-time iterative refinement is needed when encountering seen generation scenarios. One could collect a dataset using Idea2Img for a scenario of interest, and fine-tune a T2I model with the explored self-refinement trajectory. Storing the probed knowledge as sample-agnostic prompt for each image generation model is another promising direction [15, 35, 64]. Finally, with minimal extra computation, we find it helpful to use the explored T2I prompt history as in-context examples for prompt re-writing and expansion, improving from the zero-shot expansion like the one in ChatGPT-Dalle-3 [1, 4].", + "bbox": [ + 212, + 492, + 795, + 659 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 691, + 359, + 709 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We have presented Idea2Img, a multimodal iterative self-refinement framework that leverages GPT-4V(ison) for image design and generation. Idea2Img explores the emergent capabilities of iterative self-refinement in LMM-based agent systems, showcasing its effectiveness in improving, assessing, and verifying the generated multimodal content. The user preference study demonstrates Idea2Img's capability in assisting humans to find the optimal usage of generation models for automatic image design and generation.", + "bbox": [ + 212, + 733, + 797, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 364, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgment", + "text_level": 1, + "bbox": [ + 217, + 146, + 359, + 161 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We are deeply grateful to OpenAI for providing access to their exceptional tool [1, 29-31]. We also extend heartfelt thanks to our Microsoft colleagues for their insights, with special acknowledgment to Faisal Ahmed, Ehsan Azarnasab, and Lin Liang for their constructive feedback.", + "bbox": [ + 215, + 171, + 784, + 231 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 253, + 321, + 271 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Chatgpt can now see, hear, and speak. https://openai.com/blog/chatgpt-can-now-see-hear-and-speak (2023)", + "2. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-a-scene: Extracting multiple concepts from a single image. arXiv preprint arXiv:2305.16311 (2023)", + "3. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18208-18218 (2022)", + "4. Betker, J., Goh, G., Li, J., Brooks, T., Wang, J., Li, L., Ouyang, L., Zhuang, J., Lee, J., Guo, Y., Manassra, W., Dhariwal, P., Chu, C., Jiao, Y., Ramesh, A.: Improving image generation with better captions (2023)", + "5. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023)", + "6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18392-18402 (2023)", + "7. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models. arXiv preprint arXiv:2301.13826 (2023)", + "8. Chen, W., Hu, H., Li, Y., Rui, N., Jia, X., Chang, M.W., Cohen, W.W.: Subject-driven text-to-image generation via apprenticeship learning. arXiv preprint arXiv:2304.00186 (2023)", + "9. Chen, X., Lin, M., Scharli, N., Zhou, D.: Teaching large language models to self-debug. arXiv preprint arXiv:2304.05128 (2023)", + "10. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Dpok: Reinforcement learning for fine-tuning text-to-image diffusion models. arXiv preprint arXiv:2305.16381 (2023)", + "11. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Reinforcement learning for fine-tuning text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024)", + "12. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A.R., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis. In: The Eleventh International Conference on Learning Representations (2022)", + "13. Gatys, L.A., Ecker, A.S., Bethge, M.: A neural algorithm of artistic style. arXiv preprint arXiv:1508.06576 (2015)", + "14. Google: Bard. https://bard.google.com (2023), accessed: 2023-07-17", + "15. Guo, Y., Liang, Y., Wu, C., Wu, W., Zhao, D., Duan, N.: Learning to program with natural language. arXiv preprint arXiv:2304.10464 (2023)" + ], + "bbox": [ + 218, + 286, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "16. Gupta, T., Kembhavi, A.: Visual programming: Compositional visual reasoning without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14953-14962 (2023)", + "17. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-or, D.: Prompt-to-prompt image editing with cross-attention control. In: The Eleventh International Conference on Learning Representations (2022)", + "18. Kawar, B., Zada, S., Lang, O., Tov, O., Chang, H., Dekel, T., Mosseri, I., Irani, M.: Imagic: Text-based real image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6007-6017 (2023)", + "19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023)", + "20. Lab, D.: Deepfloyd if. https://github.com/deep-floyd/IF (2023)", + "21. Lee, K., Liu, H., Ryu, M., Watkins, O., Du, Y., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Gu, S.S.: Aligning text-to-image models using human feedback. arXiv preprint arXiv:2302.12192 (2023)", + "22. Li, C., Gan, Z., Yang, Z., Yang, J., Li, L., Wang, L., Gao, J.: Multimodal foundation models: From specialists to general-purpose assistants. arXiv preprint arXiv:2309.10020 (2023)", + "23. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)", + "24. Lu, P., Peng, B., Cheng, H., Galley, M., Chang, K.W., Wu, Y.N., Zhu, S.C., Gao, J.: Chameleon: Plug-and-play compositional reasoning with large language models. arXiv preprint arXiv:2304.09842 (2023)", + "25. Madaan, A., Tandon, N., Gupta, P., Hallinan, S., Gao, L., Wiegreffe, S., Alon, U., Dziri, N., Prabhumoye, S., Yang, Y., et al.: Self-refine: Iterative refinement with self-feedback. arXiv preprint arXiv:2303.17651 (2023)", + "26. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021)", + "27. Nasiriany, S., Xia, F., Yu, W., Xiao, T., Liang, J., Dasgupta, I., Xie, A., Driess, D., Wahid, A., Xu, Z., et al.: Pivot: Iterative visual prompting elicits actionable knowledge for vlms. arXiv preprint arXiv:2402.07872 (2024)", + "28. OpenAI: Dall-e 3 system card. https://cdn.openai.com/papers/DALL_E_3_System/Card.pdf (2023)", + "29. OpenAI: Gpt-4 technical report (2023)", + "30. OpenAI: Gpt-4v(ision) system card (2023), https://cdn.openai.com/papers/GPTV_System_Card.pdf", + "31. OpenAI: Gpt-4v(ision) technical work and authors. https://cdn.openai.com/contributions/gpt-4v.pdf (2023)", + "32. Pan, L., Saxon, M., Xu, W., Nathani, D., Wang, X., Wang, W.Y.: Automatically correcting large language models: Surveying the landscape of diverse self-correction strategies. arXiv preprint arXiv:2308.03188 (2023)", + "33. Paranjape, B., Lundberg, S., Singh, S., Hajishirzi, H., Zettlemoyer, L., Ribeiro, M.T.: Art: Automatic multi-step reasoning and tool-use for large language models. arXiv preprint arXiv:2303.09014 (2023)", + "34. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "35. Pryzant, R., Iter, D., Li, J., Lee, Y.T., Zhu, C., Zeng, M.: Automatic prompt optimization with \"gradient descent\" and beam search. arXiv preprint arXiv:2305.03495 (2023)", + "36. Qi, J., Ding, M., Wang, W., Bai, Y., Lv, Q., Hong, W., Xu, B., Hou, L., Li, J., Dong, Y., et al.: Cogcom: Train large vision-language models diving into details through chain of manipulations. arXiv preprint arXiv:2402.04236 (2024)", + "37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022)", + "38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022)", + "39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023)", + "40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E., Ghasemipour, S.K.S., Ayan, B.K., Mahdavi, S.S., Lopes, R.G., et al.: Photorealistic text-to-image diffusion models with deep language understanding. arXiv preprint arXiv:2205.11487 (2022)", + "41. Schick, T., Dwivedi-Yu, J., Dessi, R., Raileanu, R., Lomeli, M., Zettlemoyer, L., Cancedda, N., Scialom, T.: Toolformer: Language models can teach themselves to use tools. arXiv preprint arXiv:2302.04761 (2023)", + "42. Shen, Y., Song, K., Tan, X., Li, D., Lu, W., Zhuang, Y.: Huggingppt: Solving ai tasks with chatgpt and its friends in huggingface. arXiv preprint arXiv:2303.17580 (2023)", + "43. Shi, J., Xiong, W., Lin, Z., Jung, H.J.: Instantbooth: Personalized text-to-image generation without test-time finetuning. arXiv preprint arXiv:2304.03411 (2023)", + "44. Shinn, N., Cassano, F., Labash, B., Gopinath, A., Narasimhan, K., Yao, S.: Reflexion: Language agents with verbal reinforcement learning (2023)", + "45. Shridhar, M., Yuan, X., Côté, M.A., Bisk, Y., Trischler, A., Hausknecht, M.: Alfworld: Aligning text and embodied environments for interactive learning. arXiv preprint arXiv:2010.03768 (2020)", + "46. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. arXiv preprint arXiv:2209.14792 (2022)", + "47. Surís, D., Menon, S., Vondrick, C.: Vipergpt: Visual inference via python execution for reasoning. arXiv preprint arXiv:2303.08128 (2023)", + "48. Wang, J., Yang, Z., Hu, X., Li, L., Lin, K., Gan, Z., Liu, Z., Liu, C., Wang, L.: Git: A generative image-to-text transformer for vision and language. arXiv preprint arXiv:2205.14100 (2022)", + "49. Wang, Z.J., Montoya, E., Munechika, D., Yang, H., Hoover, B., Chau, D.H.: Diffusiondb: A large-scale prompt gallery dataset for text-to-image generative models. arXiv preprint arXiv:2210.14896 (2022)", + "50. Wu, C., Yin, S., Qi, W., Wang, X., Tang, Z., Duan, N.: Visual chatgpt: Talking, drawing and editing with visual foundation models. arXiv preprint arXiv:2303.04671 (2023)", + "51. Wu, J., Wang, J., Yang, Z., Gan, Z., Liu, Z., Yuan, J., Wang, L.: Grit: A generative region-to-text transformer for object understanding. arXiv preprint arXiv:2212.00280 (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation", + "bbox": [ + 266, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "52. Wu, P., Xie, S.: V*: Guided visual search as a core mechanism in multimodal llms. arXiv preprint arXiv:2312.14135 17 (2023)", + "53. Yan, A., Yang, Z., Zhu, W., Lin, K., Li, L., Wang, J., Yang, J., Zhong, Y., McAuley, J., Gao, J., et al.: Gpt-4v in wonderland: Large multimodal models for zero-shot smartphone gui navigation. arXiv preprint arXiv:2311.07562 (2023)", + "54. Yang, C., Wang, X., Lu, Y., Liu, H., Le, Q.V., Zhou, D., Chen, X.: Large language models as optimizers. arXiv preprint arXiv:2309.03409 (2023)", + "55. Yang, Z., Li, L., Lin, K., Wang, J., Lin, C.C., Liu, Z., Wang, L.: The dawn of Imms: Preliminary explorations with gpt-4v (ision). arXiv preprint arXiv:2309.17421 (2023)", + "56. Yang*, Z., Li*, L., Wang*, J., Lin*, K., Azarnasab*, E., Ahmed*, F., Liu, Z., Liu, C., Zeng, M., Wang, L.: Mm-react: Prompting chatgpt for multimodal reasoning and action. arXiv preprint arXiv:2303.11381 (2023)", + "57. Yang, Z., Wang, J., Gan, Z., Li, L., Lin, K., Wu, C., Duan, N., Liu, Z., Liu, C., Zeng, M., et al.: Reco: Region-controlled text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14246-14255 (2023)", + "58. Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W.W., Salakhutdinov, R., Manning, C.D.: Hotpotqa: A dataset for diverse, explainable multi-hop question answering. arXiv preprint arXiv:1809.09600 (2018)", + "59. Yao, S., Zhao, J., Yu, D., Du, N., Shafran, I., Narasimhan, K., Cao, Y.: React: Synergizing reasoning and acting in language models. arXiv preprint arXiv:2210.03629 (2022)", + "60. Yin, S., Wu, C., Yang, H., Wang, J., Wang, X., Ni, M., Yang, Z., Li, L., Liu, S., Yang, F., et al.: Nuwa-xl: Diffusion over diffusion for extremely long video generation. arXiv preprint arXiv:2303.12346 (2023)", + "61. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. Transactions on Machine Learning Research (2022)", + "62. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023)", + "63. Zhang, L., Agrawala, M.: Adding conditional control to text-to-image diffusion models. arXiv preprint arXiv:2302.05543 (2023)", + "64. Zhao, A., Huang, D., Xu, Q., Lin, M., Liu, Y.J., Huang, G.: Expel: Llm agents are experiential learners. arXiv preprint arXiv:2308.10144 (2023)", + "65. Zhu, W., Wang, X., Lu, Y., Fu, T.J., Wang, X.E., Eckstein, M., Wang, W.Y.: Collaborative generative ai: Integrating gpt-k for efficient editing in text-to-image generation. arXiv preprint arXiv:2305.11317 (2023)" + ], + "bbox": [ + 215, + 146, + 784, + 686 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Z. Yang et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_model.json b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_model.json new file mode 100644 index 0000000000000000000000000000000000000000..490bcc8d20fb43cef99730d07bd023d206995bdd --- /dev/null +++ b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_model.json @@ -0,0 +1,3327 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.218, + 0.141, + 0.787, + 0.187 + ], + "angle": 0, + "content": "Idea2Img: Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.212, + 0.784, + 0.245 + ], + "angle": 0, + "content": "Zhengyuan Yang, Jianfeng Wang, Linjie Li, Kevin Lin, Chung-Ching Lin, Zicheng Liu, and Lijuan Wang" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.256, + 0.806, + 0.298 + ], + "angle": 0, + "content": "Microsoft \n{zhengyang, jianfw, lindsey.li, keli, chungching.lin, zliu, lijuanw}@microsoft.com \nhttps://idea2img.github.io/" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.33, + 0.744, + 0.581 + ], + "angle": 0, + "content": "Abstract. We introduce \"Idea to Image,\"1 an agent system that enables multimodal iterative self-refinement with GPT-4V(ison) for automatic image design and generation. Humans can quickly identify the characteristics of different text-to-image (T2I) models via iterative explorations. This enables them to efficiently convert their high-level generation ideas into effective T2I prompts that can produce good images. We investigate if systems based on large multimodal models (LMMs) can develop analogous multimodal self-refinement abilities that enable exploring unknown models or environments via self-refining tries. Idea2Img cyclically generates revised T2I prompts to synthesize draft images, and provides directional feedback for prompt revision, both conditioned on its memory of the probed T2I model's characteristics. The iterative self-refinement brings Idea2Img various advantages over vanilla T2I models. Notably, Idea2Img can process input ideas with interleaved image-text sequences, follow ideas with design instructions, and generate images of better semantic and visual qualities. The user preference study validates the efficacy of Idea2Img on automatic image design and generation via multimodal iterative self-refinement." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.593, + 0.741, + 0.622 + ], + "angle": 0, + "content": "Keywords: Multimodal Agents \\(\\cdot\\) Large Multimodal Models \\(\\cdot\\) Image Design and Generation" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.645, + 0.377, + 0.66 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.788, + 0.812 + ], + "angle": 0, + "content": "\"Image design and generation\" aims to create an image from a high-level user idea. This input IDEA can contain interleaved reference images, such as \"the dog looks like the one in the image,\" or with instructional texts specifying the intended design usage, such as \"a logo for the Idea2Img system.\" To convert IDEA into an image, humans may first draft detailed descriptions of the imagined image, and then use text-to-image (T2I) models [34, 37, 38, 40, 61] to generate the image. This manual process for users to search for an ideal detailed description (i.e., T2I prompt) that fits the T2I model typically involves iterative exploration [49, 65]. As shown in Figure 1, humans may first design and draft an" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.509, + 0.84 + ], + "angle": 0, + "content": "1 Short for \"Idea2Img.\" System logo design" + }, + { + "type": "footer", + "bbox": [ + 0.512, + 0.822, + 0.686, + 0.842 + ], + "angle": 0, + "content": "assisted by Idea2Img." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.145, + 0.784, + 0.345 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.357, + 0.788, + 0.469 + ], + "angle": 0, + "content": "Fig. 1: Idea2Img framework enables LMMs to mimic human-like exploration to use a T2I model, enabling the design and generation of an imagined image specified as a multimodal input IDEA. The iterative process involves LMMs functioning in different roles to refine the image creation. Specifically, LMMs will (1) generate and revise text prompts for the T2I model, (2) select the best draft images, and (3) provide feedback on the errors and revision directions. This multimodal iterative self-refinement process requires LMMs to memorize the T2I model's characteristics observed in previous iterations as humans and adjust T2I prompts accordingly." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.505, + 0.788, + 0.642 + ], + "angle": 0, + "content": "initial T2I prompt based on their imagined IDEA to generate. Then, they can obtain multiple draft images with a T2I model, select the most promising draft, write text feedback, and further revise the T2I prompt. As this iteration progresses, we humans can swiftly grasp the characteristics of a specific T2I model, such as words that the model can not understand, finally producing a good image generated by a suitable T2I prompt. Given the remarkable capabilities of large multimodal models (LMMs) [14, 29, 55], we explore if we can build systems based on LMMs to develop similar iterative self-refinement ability, thereby relieving humans from the tedious process of converting ideas to images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Iterative self-refinement is one intrinsic ability humans possess when exploring unknown environments and solving complicated problems. Large language models (LLMs) agent systems [9,25,44] have demonstrated the effectiveness of self-refinement in better addressing natural language processing tasks, such as acronym generation, sentiment retrieval, text-based environment exploration, etc. Transitioning from text-only tasks to multimodal environments poses new challenges of improving, assessing, and verifying multimodal contents, such as multiple interleaved image-text sequences. For example, when learning to use T2I models, LMMs need to improve the generation with revised T2I prompts, assess multiple images in detail to select the best draft, and verify the draft image with the multimodal IDEA to provide text feedback. These steps, each requiring different multimodal understanding capabilities, jointly enable the intriguing multimodal iterative self-refinement ability. Such an LMM framework can au" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.267, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.234, + 0.147, + 0.26, + 0.156 + ], + "angle": 0, + "content": "IDEA" + }, + { + "type": "text", + "bbox": [ + 0.296, + 0.148, + 0.312, + 0.156 + ], + "angle": 0, + "content": "T21" + }, + { + "type": "text", + "bbox": [ + 0.345, + 0.148, + 0.392, + 0.157 + ], + "angle": 0, + "content": "Idea2Img" + }, + { + "type": "text", + "bbox": [ + 0.428, + 0.148, + 0.452, + 0.156 + ], + "angle": 0, + "content": "IDEA" + }, + { + "type": "text", + "bbox": [ + 0.487, + 0.148, + 0.504, + 0.156 + ], + "angle": 0, + "content": "T21" + }, + { + "type": "text", + "bbox": [ + 0.536, + 0.148, + 0.584, + 0.157 + ], + "angle": 0, + "content": "Idea2Img" + }, + { + "type": "text", + "bbox": [ + 0.62, + 0.147, + 0.644, + 0.156 + ], + "angle": 0, + "content": "IDEA" + }, + { + "type": "text", + "bbox": [ + 0.678, + 0.148, + 0.699, + 0.156 + ], + "angle": 0, + "content": "T21" + }, + { + "type": "text", + "bbox": [ + 0.728, + 0.148, + 0.776, + 0.156 + ], + "angle": 0, + "content": "Idea2Img" + }, + { + "type": "title", + "bbox": [ + 0.225, + 0.16, + 0.288, + 0.169 + ], + "angle": 0, + "content": "Object count" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.172, + 0.268, + 0.214 + ], + "angle": 0, + "content": "5 people sitting around a table drinking beer and eating buffalo wings" + }, + { + "type": "image", + "bbox": [ + 0.272, + 0.17, + 0.335, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.337, + 0.17, + 0.4, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.415, + 0.16, + 0.472, + 0.169 + ], + "angle": 0, + "content": "Knowledge" + }, + { + "type": "image", + "bbox": [ + 0.414, + 0.17, + 0.5, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.505, + 0.17, + 0.591, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.607, + 0.16, + 0.672, + 0.169 + ], + "angle": 0, + "content": "Visual design" + }, + { + "type": "image", + "bbox": [ + 0.606, + 0.17, + 0.718, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.723, + 0.17, + 0.783, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.225, + 0.221, + 0.276, + 0.229 + ], + "angle": 0, + "content": "Scene text" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.231, + 0.269, + 0.269 + ], + "angle": 0, + "content": "a whole cake on the table with words Azure Research written on the cake" + }, + { + "type": "image", + "bbox": [ + 0.272, + 0.23, + 0.335, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.337, + 0.23, + 0.4, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.415, + 0.221, + 0.501, + 0.229 + ], + "angle": 0, + "content": "Prompt following" + }, + { + "type": "text", + "bbox": [ + 0.414, + 0.231, + 0.464, + 0.269 + ], + "angle": 0, + "content": "a plan that has no barriers or obstacles; there is a glass without orange juice next to it" + }, + { + "type": "image", + "bbox": [ + 0.465, + 0.23, + 0.59, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.608, + 0.221, + 0.684, + 0.229 + ], + "angle": 0, + "content": "Intended usage" + }, + { + "type": "text", + "bbox": [ + 0.606, + 0.23, + 0.653, + 0.269 + ], + "angle": 0, + "content": "an image of a car perfect for a children's painting competition" + }, + { + "type": "image", + "bbox": [ + 0.655, + 0.23, + 0.718, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.721, + 0.23, + 0.783, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.225, + 0.283, + 0.42, + 0.292 + ], + "angle": 0, + "content": "Concept customization & visual pointing" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.293, + 0.269, + 0.339 + ], + "angle": 0, + "content": "photo of the obje by the blue arrow brown corgi dog" + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.293, + 0.359, + 0.339 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.371, + 0.293, + 0.434, + 0.34 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.436, + 0.293, + 0.5, + 0.34 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.505, + 0.283, + 0.629, + 0.292 + ], + "angle": 0, + "content": "Visual attribute referring" + }, + { + "type": "image", + "bbox": [ + 0.507, + 0.293, + 0.645, + 0.34 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.655, + 0.293, + 0.718, + 0.34 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.721, + 0.293, + 0.783, + 0.34 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.225, + 0.344, + 0.29, + 0.352 + ], + "angle": 0, + "content": "Style transfer" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.353, + 0.269, + 0.39 + ], + "angle": 0, + "content": "painting of a corgistyle similar to theimage" + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.354, + 0.359, + 0.399 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.371, + 0.353, + 0.434, + 0.402 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.436, + 0.353, + 0.5, + 0.402 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.505, + 0.344, + 0.62, + 0.353 + ], + "angle": 0, + "content": "Opposite style transfer" + }, + { + "type": "text", + "bbox": [ + 0.507, + 0.354, + 0.578, + 0.387 + ], + "angle": 0, + "content": "painting of a corgi dog with style different from the image" + }, + { + "type": "image", + "bbox": [ + 0.585, + 0.354, + 0.643, + 0.4 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.654, + 0.353, + 0.718, + 0.402 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.721, + 0.353, + 0.783, + 0.402 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.225, + 0.406, + 0.323, + 0.414 + ], + "angle": 0, + "content": "Image manipulation" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.415, + 0.269, + 0.446 + ], + "angle": 0, + "content": "a drawing with the background chain" + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.415, + 0.364, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.371, + 0.415, + 0.434, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.436, + 0.414, + 0.5, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.505, + 0.415, + 0.578, + 0.453 + ], + "angle": 0, + "content": "A hand drawing of room\nThe people can sleep and study. Hand drawing shows\nthe sketch and looks like the\ngiven image." + }, + { + "type": "image", + "bbox": [ + 0.585, + 0.415, + 0.643, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.654, + 0.414, + 0.718, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.721, + 0.415, + 0.783, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.225, + 0.466, + 0.393, + 0.474 + ], + "angle": 0, + "content": "In-context entity and style transfer" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.476, + 0.298, + 0.524 + ], + "angle": 0, + "content": "Find the the image style pattern in the left two dog images and apply it on the to right people in tree pose. Find the text in detail description that keeps the content in the people in tree pose image, with the correct style pattern." + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.476, + 0.364, + 0.523 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.371, + 0.476, + 0.434, + 0.523 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.436, + 0.475, + 0.5, + 0.523 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.505, + 0.476, + 0.56, + 0.523 + ], + "angle": 0, + "content": "Photo of Bill Gates with the same cloth as in the given image" + }, + { + "type": "image", + "bbox": [ + 0.562, + 0.476, + 0.627, + 0.522 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.628, + 0.476, + 0.718, + 0.523 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.721, + 0.474, + 0.783, + 0.523 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.225, + 0.526, + 0.422, + 0.535 + ], + "angle": 0, + "content": "Visual attribute referring & style transfer" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.537, + 0.269, + 0.576 + ], + "angle": 0, + "content": "A painting of a tennis game" + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.537, + 0.344, + 0.577 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.346, + 0.537, + 0.434, + 0.583 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.436, + 0.537, + 0.5, + 0.583 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.505, + 0.537, + 0.56, + 0.584 + ], + "angle": 0, + "content": "A logo with a design that naturally blends the two given colors as a new logo. The first image is" + }, + { + "type": "image", + "bbox": [ + 0.562, + 0.537, + 0.627, + 0.583 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.628, + 0.537, + 0.653, + 0.583 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.668, + 0.542, + 0.706, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.733, + 0.542, + 0.77, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.283, + 0.587, + 0.308, + 0.595 + ], + "angle": 0, + "content": "IDEA" + }, + { + "type": "text", + "bbox": [ + 0.393, + 0.587, + 0.41, + 0.595 + ], + "angle": 0, + "content": "T21" + }, + { + "type": "text", + "bbox": [ + 0.444, + 0.587, + 0.493, + 0.596 + ], + "angle": 0, + "content": "Idea2Img" + }, + { + "type": "text", + "bbox": [ + 0.567, + 0.587, + 0.592, + 0.595 + ], + "angle": 0, + "content": "IDEA" + }, + { + "type": "text", + "bbox": [ + 0.677, + 0.587, + 0.694, + 0.595 + ], + "angle": 0, + "content": "T21" + }, + { + "type": "text", + "bbox": [ + 0.728, + 0.587, + 0.776, + 0.596 + ], + "angle": 0, + "content": "Idea2Img" + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.612, + 0.785, + 0.681 + ], + "angle": 0, + "content": "Fig. 2: Overview of the image design and generation scenarios enabled by Idea2Img. In each sub-figure, the image and text in the left green box are the user input IDEA. The center image is the baseline results directly generated by the same T2I model with a human-written T2I prompt, and the image on the right is generated with the T2I prompt discovered by Idea2Img's iterative self-refinement exploration." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.717, + 0.785, + 0.792 + ], + "angle": 0, + "content": "tomatically learn to tackle various real-world problems [55] via self-exploration, such as navigating GUI to use electronic devices, exploring unknown physical environments via an embodied agent, engaging in electronic games, and so on. In this study, we focus on \"image design and generation\" as the task to study the multimodal iterative self-refinement ability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.785, + 0.841 + ], + "angle": 0, + "content": "To this end, we introduce Idea2Img, a multimodal iterative self-refinement framework for automatic image design and generation. As illustrated in Figure 1, Idea2Img involves an LMM, GPT-4V(ison) [1, 29-31], interacting with a" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.389 + ], + "angle": 0, + "content": "T2I model to probe its usage and find an effective T2I prompt. The LMM will act in different roles to analyze the return signal from the T2I model (i.e., draft images) and design the next round's queries (i.e., text T2I prompts). The three roles of generating T2I prompts, selecting draft images, and reflecting feedback together enable the multimodal iterative self-refinement ability. Specifically, (1) Prompt generation: GPT-4V generates \\(N\\) text prompts that correspond to the input multimodal user IDEA, conditioned on the previous text feedback and refinement history; (2) Draft image selection: GPT-4V carefully compares \\(N\\) draft images for the same IDEA and select the most promising one; (3) Feedback reflection: GPT-4V examines the discrepancy between the draft image and the IDEA. GPT-4V then provides feedback on what is incorrect, the plausible causes, and how T2I prompts may be revised to obtain a better image. Furthermore, Idea2Img is enhanced with a memory module that stores all prompt exploration histories, including previous draft images, text prompts, and feedback. The Idea2Img framework iterates among these three steps with GPT-4V for automatic image design and generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.391, + 0.788, + 0.602 + ], + "angle": 0, + "content": "To users, Idea2Img functions as an enhanced image design and generation assistant. Compared with T2I models, Idea2Img can handle design instructions instead of requiring detailed image description, support the multimodal IDEA input, and generate images of better semantic and visual qualities. We overview representative image design and generation scenarios in Figure 2. For example, Idea2Img can incorporate the visual design and intended usage description in IDEA, extract arbitrary visual information from the input image, and process IDEA with arbitrarily interleaved image-text sequences. Built upon these new functionalities and scenarios of interest, we develop an evaluation IDEA set with 104 samples, containing complicated queries that humans may fail in their first trials. We perform user preference studies on Idea2Img with different T2I models. The consistent user preference score improvements on different image generation models, e.g., \\(+26.9\\%\\) with SDXL [34], indicate the effectiveness of Idea2Img in image design and generation." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.605, + 0.568, + 0.619 + ], + "angle": 0, + "content": "Our contributions are summarized as follows." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.638, + 0.785, + 0.68 + ], + "angle": 0, + "content": "- We study \"automatic image design and generation,\" which aims to create an image from an input IDEA. This new multimodal IDEA input enables visual creation with reference image inputs and instructions on desired designs." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.685, + 0.785, + 0.728 + ], + "angle": 0, + "content": "- We explore the multimodal iterative self-refinement ability in GPT-4V-based agent systems, showcasing its effectiveness in improving, assessing, and verifying multimodal contents." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.733, + 0.784, + 0.775 + ], + "angle": 0, + "content": "- We propose Idea2Img, a multimodal iterative self-refinement framework that enhances any image generation model for visual design, enabling various new image creation functionalities, and achieving better generation qualities." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.781, + 0.785, + 0.837 + ], + "angle": 0, + "content": "- We present an evaluation set with 104 challenging multimodal IDEA. The consistent user preference score improvements, when experimented on different image generation models, indicate Idea2Img's effectiveness in automatic image design and generation." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.638, + 0.785, + 0.837 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.266, + 0.114, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.388, + 0.161 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.209, + 0.788, + 0.392 + ], + "angle": 0, + "content": "LLM-based self-refinement. Idea2Img is inspired by the effectiveness of iterative self-refinement in LLM-based agent systems [25,32,44] in exploring unknown environments and tasks, built upon the successful LLM agents [15,33,35,41,54, 59,64]. Self-refine [25] takes the same LLM to iteratively critique its outputs and leverage this feedback to enhance its predictions, showing effectiveness across various NLP tasks. Reflexion [44] explores a self-reflective LLM system on the text-based environment exploration task [45] and multi-hop QA [58]. Despite the success, LLM-based self-refinement naturally can not understand multimodal inputs. Consequently, the explored tasks and environments are limited to the natural language description, such as AlfWorld [45]. Idea2Img explores the potential of an LMM-based iterative self-refinement system for multimodal environment exploration, from a simple T2I model to other more complicated environments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.396, + 0.788, + 0.625 + ], + "angle": 0, + "content": "Multimodal agents. Our Idea2Img is related to multimodal agents [16, 22, 24, 42, 47, 50, 56, 62] that chain external tools such as T2I or vision-language models with LLMs for multimodal tasks. For instance, MM-ReAct [56] integrates ChatGPT with multiple vision tools for multimodal reasoning and action, enabling it to solve various complicated visual understanding tasks. Visual ChatGPT [50] empowers ChatGPT to allocate various image generation models, such as Stable Diffusion [38], img2img model [26], ControlNet [63], enabling multi-step visual editing and generation. The primary difference between Idea2Img and existing multimodal agent studies [50, 56] lies in the approach to understand the tool usage. Existing studies assume the knowledge of how to best use each tool and provide such information to LLMs via text instructions or in-context examples. In contrast, the optimal usage of the tool remains unknown in Idea2Img and requires iterative exploration. Another minor distinction is that Idea2Img utilizes LMMs instead of LLMs, thereby does not require general visual understanding tools such as a caption model [48, 51]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Extensions of base T2I models. Idea2Img provides a more natural way for users to design and produce their desired visual content. This framework, which extends T2I models for new functionalities, is related to various works in improving base T2I models [34, 37, 38, 40, 61]. These studies include extending the base T2I model to better follow user prompts [5, 7, 10, 12], finding magic words in T2I prompts for better visual quality [49, 65], supporting extra image input for image manipulation [6, 17, 18, 26], style transfer [13], visual concept customization [2, 8, 19, 39, 43], and so on. While specialized T2I extensions can address a single specific functionality, Idea2Img offers a more unified and widely applicable framework. That is, a single Idea2Img framework can handle various generation scenarios, ranging from style transfer to attribute customization, without requiring separate models or task-specific model design and finetune. More importantly, Idea2Img effectively collaborates with those enhanced generative models, consistently improving them by exploring suitable text prompts." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.149, + 0.784, + 0.339 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.351, + 0.788, + 0.394 + ], + "angle": 0, + "content": "Fig. 3: The framework overview of Idea2Img, which takes an LMM [29,30] to explore a T2I model via multimodal iterative self-refinement, leading to an effective T2I prompt for the input user IDEA. The rounded rectangle shape indicates a GPT-4V call." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.422, + 0.46, + 0.44 + ], + "angle": 0, + "content": "3 Idea2Img Framework" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.455, + 0.788, + 0.681 + ], + "angle": 0, + "content": "Figure 3 illustrates the Idea2Img framework. Idea2Img framework involves two core pre-trained models, i.e., the GPT-4V(ison) as the LMM \\(\\mathcal{M}\\) and a text-conditioned image generation model\\(^2\\) to explore \\(\\mathcal{G}\\). Idea2Img also contains a memory \\(m\\) that stores insights on \\(\\mathcal{G}\\) discovered by \\(\\mathcal{M}\\) during previous iterations. Execution flow. We begin with an overview of the key steps in \\(\\mathcal{M}\\) iteratively exploring the use of \\(\\mathcal{G}\\). Starting from the top-left of Figure 3, \"initial prompt generation\" converts the input multimodal user IDEA into T2I text prompts, later producing multiple draft images with T2I model \\(\\mathcal{G}\\). \"Draft image selection\" then selects the best draft image among them for the current iteration. The selected image is either output as the final prediction or continues for further refinement, depending on the stop condition. For the latter, \"feedback reflection\" compares the current best draft image with the multimodal IDEA, and summarizes the major discrepancy as text feedback. With the iteration history and text feedback, \"revised prompt generation\" then drafts revised T2I prompts and continues the iterative self-refinement with the new set of draft images." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.683, + 0.788, + 0.732 + ], + "angle": 0, + "content": "\\(\\Theta\\) Initial prompt generation. This step generates \\(N\\) initial T2I prompts \\(\\{y_0^0,\\dots ,y_0^{N - 1}\\}\\) following the input user IDEA \\(x\\), by prompting \\(\\mathcal{M}\\) with LMM prompt \\(p_{gen}\\):" + }, + { + "type": "equation", + "bbox": [ + 0.395, + 0.731, + 0.786, + 0.75 + ], + "angle": 0, + "content": "\\[\n\\left\\{y _ {0} ^ {0}, \\dots , y _ {0} ^ {N - 1} \\right\\} = \\mathcal {M} (x, p _ {\\text {g e n}}) \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.788, + 0.803 + ], + "angle": 0, + "content": "The \"initial prompt generation\" requires \\(\\mathcal{M}\\) to understand multimodal user IDEA \\(x\\) and convert design IDEA into descriptive T2I prompts. LMM prompt \\(p_{gen}\\) is a zero-shot prompt without in-context examples." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.787, + 0.841 + ], + "angle": 0, + "content": "2 We will show image generation models other than T2I later in experiments. For clarity, we use T2I as a representative generation model to introduce Idea2Img." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.266, + 0.114, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "With the \"initial prompt generation\" step, Idea2Img can understand user IDEA with interleaved image-text sequences, instead of the text-only T2I prompts containing the image description. Specifically, (1) IDEA can be a high-level design or usage instead of the detailed image description, such as \"a car image for a children's painting competition\"; and (2) IDEA can take multiple images and use interleaved text instruction to extract arbitrary visual information of interest, including image style, visual entity, object attributes, etc. Then, in iteration \\( t = 0 \\) as well as future iterations \\( t = t \\), each T2I prompt \\( y_{t}^{n} \\) is separately sent to the T2I model \\( \\mathcal{G} \\), resulting in \\( N \\) draft images \\( i_{t}^{n} = \\mathcal{G}(y_{t}^{n}) \\), \\( n = 0, \\dots, N - 1 \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.285, + 0.788, + 0.331 + ], + "angle": 0, + "content": "\\(\\boxed{2}\\) Draft image selection. With the \\(N\\) draft images in iteration \\(t\\), \"draft image selection\" selects the best draft image \\(i_t^*\\) by prompting \\(\\mathcal{M}\\) with LMM prompt \\(p_{select}\\):" + }, + { + "type": "equation", + "bbox": [ + 0.391, + 0.331, + 0.785, + 0.348 + ], + "angle": 0, + "content": "\\[\ni _ {t} ^ {*} = \\mathcal {M} \\left(i _ {t} ^ {0}, \\dots , i _ {t} ^ {N - 1}, x, p _ {\\text {s e l e c t}}\\right). \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.355, + 0.788, + 0.414 + ], + "angle": 0, + "content": "The design of a \"draft image selection\" step is motivated by the observation that T2I models could generate bad images with good prompts. This step is designed to filter out low-quality images, and avoid the quality perturbation to dominate the iterative refinement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.416, + 0.788, + 0.476 + ], + "angle": 0, + "content": "The task of selecting the best image requires \\(\\mathcal{M}\\) to compare and grade both the semantics and visual quality of \\(N\\) similar draft images. We find such a \"spot the difference\" task challenging for LMMs, and only the very recent models [29, 55] are capable of performing the selection reliably." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.788, + 0.539 + ], + "angle": 0, + "content": "③ Feedback reflection. After obtaining the selected image \\( i_{t}^{*} \\), the framework checks the stop condition, such as if the current iteration \\( t \\) exceeds the maximum \\( T \\). Idea2Img then outputs \\( i_{t}^{*} \\) as the output image or proceeds the refinement process to the \"feedback reflection\" step accordingly." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.54, + 0.788, + 0.587 + ], + "angle": 0, + "content": "\"Feedback reflection\" aims to provide text feedback \\( f_{t} \\) that describes the direction to improve for draft image \\( i_{t}^{*} \\). The steps prompts \\( \\mathcal{M} \\) with LMM prompt \\( p_{fb} \\), conditioned on the draft image \\( i_{t}^{*} \\) and memory \\( m \\):" + }, + { + "type": "equation", + "bbox": [ + 0.426, + 0.599, + 0.785, + 0.615 + ], + "angle": 0, + "content": "\\[\nf _ {t} = \\mathcal {M} \\left(i _ {t} ^ {*}, m, x, p _ {f b}\\right). \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.626, + 0.788, + 0.762 + ], + "angle": 0, + "content": "\"Feedback reflection\" takes \\(\\mathcal{M}\\) to compare an image \\(i_t^*\\) with the multimodal user \\(IDEAx\\), and summarize the gap as text feedback \\(f_{t}\\). The step not only requires \\(\\mathcal{M}\\) to identify the discrepancy between image \\(i_t^*\\) and \\(IDEAx\\), but also benefits from writing the major errors to make the iteration effective. In practice, we find it helpful to explicitly specify the aspects to check, such as style, entity, attributes, appearance, etc., via text instructions or in-context examples in LMM prompt \\(p_{fb}\\). Furthermore, we add text instructions to \\(p_{fb}\\) to have \\(\\mathcal{M}\\) \"focus on one thing to improve in each feedback,\" and \"provide a high-level explanation of how to modify prompts to address the given feedback.\"" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.763, + 0.788, + 0.813 + ], + "angle": 0, + "content": "\\(\\boxed{4} / \\boxed{1}\\) Revised prompt generation. Finally, \"prompt generation\" takes text feedback \\(f_{t}\\) and memory \\(m\\) to draft \\(N\\) revised prompt \\(\\{y_{t+1}^{0}, \\ldots, y_{t+1}^{N-1}\\}\\), by prompting \\(\\mathcal{M}\\) with LMM prompt \\(p_{\\text{revise}}\\):" + }, + { + "type": "equation", + "bbox": [ + 0.361, + 0.824, + 0.785, + 0.842 + ], + "angle": 0, + "content": "\\[\n\\left\\{y _ {t + 1} ^ {0}, \\dots , y _ {t + 1} ^ {N - 1} \\right\\} = \\mathcal {M} \\left(f _ {t}, m, x, p _ {\\text {r e v i s e}}\\right). \\tag {4}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.207 + ], + "angle": 0, + "content": "Generating revised prompts requires \\(\\mathcal{M}\\) to understand the property of \\(\\mathcal{G}\\) stored in memory \\(m\\), thereby drafting new T2I prompts that could most likely address the issue identified in \\(f_{t}\\). We empirically demonstrate that Idea2Img can generate better prompts for \\(\\mathcal{G}\\) via iterative self-refinement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.788, + 0.254 + ], + "angle": 0, + "content": "Memory module. Memory \\( m \\) is one important design in Idea2Img. \\( m \\) has the format of interleaved image-text sequences that store all previous iterations' feedback, selected draft image, and the corresponding text prompts:" + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.264, + 0.786, + 0.282 + ], + "angle": 0, + "content": "\\[\nm _ {t} = \\left[ y _ {0} ^ {*}, i _ {0} ^ {*}, f _ {0}, \\dots , y _ {t - 1} ^ {*}, i _ {t - 1} ^ {*}, f _ {t - 1} \\right]. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.291, + 0.789, + 0.385 + ], + "angle": 0, + "content": "It allows LMM \\(\\mathcal{M}\\) to understand the properties and capabilities of the T2I model \\(\\mathcal{G}\\) in use, such as a keyword that \\(\\mathcal{G}\\) may not understand or a complicated scene that \\(\\mathcal{G}\\) fail to generate, and incorporate such knowledge in generating the revised T2I prompts \\(y\\). For example, it may describe the appearance of a yoga pose in detail, instead of only mentioning its name in \\(y\\). Examples are shown in Appendix Figures A-D, when comparing initial and refined prompts \\(y_0\\) and \\(y_T\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.404, + 0.377, + 0.422 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.435, + 0.433, + 0.451 + ], + "angle": 0, + "content": "4.1 Experiment Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.788, + 0.492 + ], + "angle": 0, + "content": "Compared model variants. We mainly compare the following three models in image generation." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.499, + 0.785, + 0.542 + ], + "angle": 0, + "content": "- \"Initial-round manual prompt\" is the baseline T2I prompt written by humans with minor prompt engineering. It serves as the baseline of a T2I prompt that merely contains key information in IDEA." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.545, + 0.785, + 0.631 + ], + "angle": 0, + "content": "- \"Initial-round Idea2Img prompt\" is the LMM-generated T2I prompt in the initial round. Specifically, the max iteration \\(T = 1\\), and LMM \\(\\mathcal{M}\\) is only used for initial prompt generation and draft image selection, but not feedback reflection nor revised prompt generation. This Idea2Img variant is used to ablate Idea2Img's gain from prompt generation and selection, vs. the further iterative refinement." + }, + { + "type": "text", + "bbox": [ + 0.224, + 0.634, + 0.784, + 0.662 + ], + "angle": 0, + "content": "- \"Iterative self-refined Idea2Img prompt\" is complete Idea2Img pipeline with the max iteration \\( T = 3 \\)." + }, + { + "type": "list", + "bbox": [ + 0.224, + 0.499, + 0.785, + 0.662 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.78 + ], + "angle": 0, + "content": "Evaluation samples and metrics. For the quantitative evaluation, we collect a dataset of 104 user IDEA as input queries. Among them, 33 queries contain text only, 43 queries contain an image-text sequence with a single image, and the remaining 28 contains a sequence with two or more images. The text in most IDEA contains not only descriptive content text that describes the scene to generate, but also instructional text such as \"a logo for commercial advertising\" or \"generate the pointed dog in blue.\" All test queries are manually composed." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We then perform the user preference study as the main quantitative metric. Users are presented with the IDEA and multiple images to select the best one for each IDEA. The evaluation script automatically shuffles the order during evaluation to prevent the influence of image orders." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.266, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: User preference scores when applying Idea2Img onto different image generation models (compare the three scores in the middle section within each row individually). We observe that \"Iterative self-refined Idea2Img prompt\" is consistently favored across all experimented image generation models. \\(\\varDelta_{\\mathrm{iteration}}\\) reports the preference gain from the iterative Idea2Img over the initial-round Idea2Img." + }, + { + "type": "table", + "bbox": [ + 0.231, + 0.226, + 0.769, + 0.343 + ], + "angle": 0, + "content": "
User preference score (%)Initial-round manual promptInitial-round Idea2Img promptIterative self-refined Idea2Img promptΔiteration
SDXL v1.013.529.856.7+26.9
DeepFloyd IF14.434.651.0+16.3
SD v2.113.540.446.2+5.8
SD v1.58.643.348.1+4.8
SDXL-img2img8.634.656.7+16.3
IF-img2img8.638.552.9+14.4
" + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.356, + 0.673, + 0.499 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.51, + 0.788, + 0.553 + ], + "angle": 0, + "content": "Fig. 4: User preference scores among T2I models before and after iterative self-refinement. We observe that the initially favored T2I model, SDXL, benefits more from the Idea2Img iteration." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.581, + 0.789, + 0.75 + ], + "angle": 0, + "content": "Experimented T2I models. We experiment Idea2Img on a wide variety of T2I model \\(\\mathcal{G}\\) with diverse model capacities and functionalities. Specifically, we study Stable Diffusion (SD) v1.5 [38], SD v2.1, SDXL v1.0 with refiner [34], and DeepFloyd IF (IF-I-XL and IF-II-L) [20]. Other than T2I models, we also consider the img2img pipeline (i.e., SDEdit [26]) for SDXL and DeepFloyd IF, as a demonstration of using Idea2Img for the text-conditioned image-to-image generation. The default strength \\(t_0\\) in the img2img pipeline is 1.00. SDXL-img2img and IF-img2img are the same as SDXL and IF (i.e., T2I) when IDEA contains text only, and condition on the first image with IDEA contains multiple images. LMM prompts \\(p_{gen}, p_{select}, p_{fb}, p_{revise}\\) are kept the same for all experimented T2I models. Appendix Section B shows the complete LMM prompts." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.77, + 0.48, + 0.785 + ], + "angle": 0, + "content": "4.2 Image Generation Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.843 + ], + "angle": 0, + "content": "User preference evaluation. Table 1 compares the user preference when selecting from the three images generated by \"initial-round manual prompt,\" \"initial-round Idea2Img prompt,\" and \"iterative self-refined Idea2Img prompt.\"" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.299 + ], + "angle": 0, + "content": "for each user IDEA with the same T2I model. Among T2I models with different model sizes and functionalities, Idea2Img leads to consistent improvements in user preference. The initial-round Idea2Img prompt already improves the initial-round manual prompt, by effectively understanding the multimodal user IDEA and selecting the best draft images. The full Idea2Img framework further improves from the initial-round Idea2Img results with the multimodal iterative self-refinement. For example, when using SDXL v1.0, users prefer the images generated by Idea2Img \\(59/104 = 56.7\\%\\) times, compared with the baseline of \\(14/104 = 13.5\\%\\). Similar improvements are observed on all experimented T2I models, as shown in the bolded column \"iterative self-refined Idea2Img prompt.\"" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.303, + 0.789, + 0.545 + ], + "angle": 0, + "content": "Furthermore, we examine which T2I model benefits the most from the LMM iterative self-refinement. By comparing the \\(\\Delta_{\\mathrm{iteration}}\\) in Table 1 that represents the difference between first-round and iterative Idea2Img user preference, we observe that stronger T2I models tend to benefit more from LMM refinements. For example, SDXL and IF become more favored \\(26.9\\%\\) and \\(16.3\\%\\) times after iteration, compared with the \\(5.8\\%\\) and \\(4.8\\%\\) for SD v2.1 and SD v1.5. The trend that stronger T2I models benefit more from Idea2Img is also observed in Figure 4's analysis, where users pick their preferred image generated by different T2I models. After Idea2Img's iterative refinement, the initially favored model SDXL benefits more from the iteration, resulting in an even higher user preference rate, from \\(46.2\\%\\) to \\(65.4\\%\\). We conjecture that the better language understanding ability in stronger T2I models enables them to better follow revised T2I prompts. They also have a better image generation capability that makes it possible to generate challenging scenes, when given a good T2I prompt optimized by Idea2Img. Nonetheless, Idea2Img is effective across T2I models of varying capacities, consistently leading to a higher user preference score." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.549, + 0.79, + 0.716 + ], + "angle": 0, + "content": "Qualitative comparisons. Idea2Img could help users generate images that better follow IDEA, such as the correct object counts in Figure 5(a). Idea2Img enables visual content design, in contrast to conventional T2I that requires a detailed visual content description. For example in Figure 5(b), Idea2Img designs visual logo based on the instruction of \"a logo for a 2024 conference in Seattle.\" The power of LMMs allows Idea2Img to extract arbitrary information from the input image for visual generation. This could be any object in the image like \"the circled dog\" in Figure 5(c) or the image style like in Figure 5(d). Such general visual conditioning ability can be seamlessly extended to compose multiple visual and text conditions, such as composing the camera angle and image style in Figure 5(e) and two objects in Figure 5(f)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Other than SDXL, Idea2Img is effective in finding text prompts for other image generation models. This includes arbitrary T2I models (e.g., SD v2.1 [38], DeepFloyd IF [20], DALL-E 3 [28], etc.), text-conditioned image-to-image models (e.g., SDXL-img2img and IF-img2img with SDEdit [26]), and other specialist generation models (e.g., reward-tuned T2I [11,21], region-controlled generators [23,57,63], and other specialist models [3,6,39]). Figure 6 overviews Idea2Img working with different image generation models. We show additional qualitative results and discussions in Appendix Section A.1." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.267, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.147, + 0.756, + 0.463 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.475, + 0.788, + 0.504 + ], + "angle": 0, + "content": "Fig. 5: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with SDXL [34] as the T2I model." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.531, + 0.788, + 0.577 + ], + "angle": 0, + "content": "How Idea2Img may assist humans? We use selected qualitative results to highlight the scenarios where humans might find Idea2Img most helpful in image design and generation, compared with conventional T2I generation." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.584, + 0.789, + 0.75 + ], + "angle": 0, + "content": "1. New functionalities with multimodal IDEA inputs. Idea2Img provides a more natural way for human interaction, where users do not have to describe their desired image solely through texts and painstakingly search for the right prompt word. Instead, the multimodal IDEA allows Idea2Img to precisely extract specific elements from one or multiple input images, such as the dog breed and color, pointed objects, artist style, camera view, and more, as shown in Figure 5. Finding proper words that the T2I model can understand for such visual concepts could be tedious for humans, e.g., the art style \"with bold lines and bright colors, with a cubist and surrealistic style, with a focus on geometric shapes and patterns.\" in Figure 5(d). Idea2Img automates this process via Idea2Img iterative self-refinement." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.75, + 0.789, + 0.84 + ], + "angle": 0, + "content": "2. New functionalities with instructional inputs. Vanilla T2I models struggle to understand T2I prompts that describe the intended visual design or purpose of the generated image, such as \"a logo for a 2024 conference held in Seattle\" in Figure 5(b). Instead, the prompt needs to be a comprehensive description of the image to generate, demanding extra drafting effort from users, such as \"...the Seattle skyline in the center and the conference title" + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.584, + 0.789, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.145, + 0.756, + 0.44 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.452, + 0.788, + 0.495 + ], + "angle": 0, + "content": "Fig. 6: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with different image generation models. Additional qualitative results and discussions are in Appendix A.1." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.524, + 0.785, + 0.554 + ], + "angle": 0, + "content": "below it ...\". In contrast, Idea2Img effectively understands the instructional texts in IDEA and creates images accordingly." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.555, + 0.785, + 0.601 + ], + "angle": 0, + "content": "3. Better semantic and visual quality. Finally, the iterative refinement allows Idea2Img to generate images with better semantic and visual qualities, leading to an effective automatic image creation assistant." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.633, + 0.593, + 0.648 + ], + "angle": 0, + "content": "4.3 LMM Feedback, Revision, and Selection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We show representative LMM outputs for \"feedback reflection,\" \"revised prompt generation,\" and \"draft image selection.\" Additional results are in Appendix A.2. Feedback reflection. Figure 7(a) shows the text feedback generated by GPT-4V for the user IDEA and the draft image and T2I prompt. Idea2Img can effectively check if the generated image is correct, and verify if the draft image corresponds to the visual descriptions in IDEA. This includes the breed of the dog in (a.1), as well as art styles, objects, visual attributes, etc. In addition to identifying the discrepancy, Idea2Img also points to the plausible directions that may improve the T2I prompt in the text feedback. For example, in (a.2), Idea2Img provides guidance to have generated images better follow the user intention of \"an image for a children's painting competition,\" by \"specifically mentioning that the car should be simple and cartoon-like.\"" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.267, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.237, + 0.146, + 0.388, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.396, + 0.146, + 0.519, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.59, + 0.146, + 0.766, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.238, + 0.262, + 0.765, + 0.274 + ], + "angle": 0, + "content": "(a) Feedback reflection: The right column shows the examples of generated text feedback." + }, + { + "type": "image", + "bbox": [ + 0.239, + 0.275, + 0.388, + 0.335 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.396, + 0.276, + 0.604, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.61, + 0.276, + 0.765, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.24, + 0.338, + 0.388, + 0.388 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.396, + 0.338, + 0.604, + 0.389 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.61, + 0.338, + 0.764, + 0.389 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.238, + 0.392, + 0.765, + 0.404 + ], + "angle": 0, + "content": "(b) Revised prompt generation: The right column shows the examples of revised prompts." + }, + { + "type": "image", + "bbox": [ + 0.239, + 0.405, + 0.388, + 0.464 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.396, + 0.406, + 0.604, + 0.466 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.61, + 0.406, + 0.765, + 0.466 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.24, + 0.47, + 0.388, + 0.521 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.396, + 0.468, + 0.604, + 0.523 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.61, + 0.47, + 0.764, + 0.523 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.236, + 0.526, + 0.765, + 0.548 + ], + "angle": 0, + "content": "(c) Draft image selection: The right column shows the examples of the draft image selection index and justification." + }, + { + "type": "image_caption", + "bbox": [ + 0.226, + 0.559, + 0.775, + 0.573 + ], + "angle": 0, + "content": "Fig. 7: GPT-4V's outputs in Idea2Img for image feedback, revision, and selection." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.61, + 0.788, + 0.716 + ], + "angle": 0, + "content": "Revised prompt generation. Figure 7(b) compares the T2I prompts before and after the prompt revision, showcasing how text feedback may help the refinement. For example, in (b.1), the revised T2I prompt specifies \"an empty plate with no other objects\" to preclude the T2I model from generating bananas, which occurred with the previous prompt \"no bananas.\" In (b.2), the revised T2I prompt includes a detailed description of \"a yellow tennis outfit\" and \"a Yorkshire Terrier\" to generate the queried clothing and dog." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Draft image selection. Performing draft image selection requires LMMs to compare multiple similar draft images and pick the one that best matches the multimodal input \\(IDEA\\). Figure 7(c) shows the selection results generated by \\(Idea2Img\\). GPT-4V is prompted to give justifications and scores for each draft image, in addition to the final selection. We observe that \\(Idea2Img\\) could comprehensively judges different aspects in \\(IDEA\\), and gives reasonable scores and selection indexes. E.g., finding the image with both sleep and study area in (c.1), verifying content and style in (c.2), and other examples in Appendix Figure G." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.505, + 0.161 + ], + "angle": 0, + "content": "5 Limitation and Discussion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.187, + 0.788, + 0.309 + ], + "angle": 0, + "content": "Tasks beyond image generation. Idea2Img explores the emergent ability of multimodal self-refinement in LMM-based systems, through the image design and generation task. Specifically, Idea2Img views the T2I model to use as an unknown multimodal environment to explore, and iteratively refines T2I prompts to find its optimal usage. This concept mirrors the intrinsic human approach of iterative problem-solving when faced with unknown environments or challenges. We leave its extension to other intriguing tasks, e.g., GUI navigation [53], embodied agents [27], and complicated visual reasoning [36, 52], for future exploration." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.31, + 0.788, + 0.491 + ], + "angle": 0, + "content": "From a single image generation model to multiple tools. Idea2Img explores using a single image generation model, such as a text-to-image model [38] or a text-conditioned image-to-image model [26]. When needed, other specialized generative models like ControlNet [63], inpainting [3], region-controlled T2I generation [23,57], customized generation [8,39], and video generation [46,60] can be seamlessly switched and supported. That is, Idea2Img could broadly boost different visual generation models of diverse specialties by exploring their optimal text description or instruction prompts. Beyond a single generation model, Idea2Img can also be used to allocate multiple tools as in multimodal agent studies [50,56]. In this case, Idea2Img isn't limited to optimizing the use of individual tools but also investigates their effective collaboration when used together, such as generator selection and multi-step visual generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.493, + 0.796, + 0.66 + ], + "angle": 0, + "content": "Consolidating explored knowledge. We have shown the effectiveness of LMM iterative self-refinement in automatic image design and generation. Idea2Img can also help to consolidate or distill the explored knowledge into T2I model parameters, such that no inference-time iterative refinement is needed when encountering seen generation scenarios. One could collect a dataset using Idea2Img for a scenario of interest, and fine-tune a T2I model with the explored self-refinement trajectory. Storing the probed knowledge as sample-agnostic prompt for each image generation model is another promising direction [15, 35, 64]. Finally, with minimal extra computation, we find it helpful to use the explored T2I prompt history as in-context examples for prompt re-writing and expansion, improving from the zero-shot expansion like the one in ChatGPT-Dalle-3 [1, 4]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.693, + 0.36, + 0.71 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.799, + 0.841 + ], + "angle": 0, + "content": "We have presented Idea2Img, a multimodal iterative self-refinement framework that leverages GPT-4V(ison) for image design and generation. Idea2Img explores the emergent capabilities of iterative self-refinement in LMM-based agent systems, showcasing its effectiveness in improving, assessing, and verifying the generated multimodal content. The user preference study demonstrates Idea2Img's capability in assisting humans to find the optimal usage of generation models for automatic image design and generation." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.266, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.147, + 0.36, + 0.162 + ], + "angle": 0, + "content": "Acknowledgment" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.172, + 0.785, + 0.232 + ], + "angle": 0, + "content": "We are deeply grateful to OpenAI for providing access to their exceptional tool [1, 29-31]. We also extend heartfelt thanks to our Microsoft colleagues for their insights, with special acknowledgment to Faisal Ahmed, Ehsan Azarnasab, and Lin Liang for their constructive feedback." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.255, + 0.323, + 0.272 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.287, + 0.784, + 0.314 + ], + "angle": 0, + "content": "1. Chatgpt can now see, hear, and speak. https://openai.com/blog/chatgpt-can-now-see-hear-and-speak (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.316, + 0.785, + 0.354 + ], + "angle": 0, + "content": "2. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-a-scene: Extracting multiple concepts from a single image. arXiv preprint arXiv:2305.16311 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.357, + 0.785, + 0.397 + ], + "angle": 0, + "content": "3. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18208-18218 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.399, + 0.785, + 0.438 + ], + "angle": 0, + "content": "4. Betker, J., Goh, G., Li, J., Brooks, T., Wang, J., Li, L., Ouyang, L., Zhuang, J., Lee, J., Guo, Y., Manassra, W., Dhariwal, P., Chu, C., Jiao, Y., Ramesh, A.: Improving image generation with better captions (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.44, + 0.785, + 0.466 + ], + "angle": 0, + "content": "5. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.785, + 0.508 + ], + "angle": 0, + "content": "6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18392-18402 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.51, + 0.785, + 0.55 + ], + "angle": 0, + "content": "7. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models. arXiv preprint arXiv:2301.13826 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.551, + 0.785, + 0.591 + ], + "angle": 0, + "content": "8. Chen, W., Hu, H., Li, Y., Rui, N., Jia, X., Chang, M.W., Cohen, W.W.: Subject-driven text-to-image generation via apprenticeship learning. arXiv preprint arXiv:2304.00186 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.592, + 0.785, + 0.619 + ], + "angle": 0, + "content": "9. Chen, X., Lin, M., Scharli, N., Zhou, D.: Teaching large language models to self-debug. arXiv preprint arXiv:2304.05128 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.62, + 0.785, + 0.66 + ], + "angle": 0, + "content": "10. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Dpok: Reinforcement learning for fine-tuning text-to-image diffusion models. arXiv preprint arXiv:2305.16381 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.661, + 0.785, + 0.715 + ], + "angle": 0, + "content": "11. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Reinforcement learning for fine-tuning text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.717, + 0.785, + 0.77 + ], + "angle": 0, + "content": "12. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A.R., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis. In: The Eleventh International Conference on Learning Representations (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.772, + 0.785, + 0.799 + ], + "angle": 0, + "content": "13. Gatys, L.A., Ecker, A.S., Bethge, M.: A neural algorithm of artistic style. arXiv preprint arXiv:1508.06576 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.8, + 0.711, + 0.812 + ], + "angle": 0, + "content": "14. Google: Bard. https://bard.google.com (2023), accessed: 2023-07-17" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "15. Guo, Y., Liang, Y., Wu, C., Wu, W., Zhao, D., Duan, N.: Learning to program with natural language. arXiv preprint arXiv:2304.10464 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.219, + 0.287, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "16. Gupta, T., Kembhavi, A.: Visual programming: Compositional visual reasoning without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14953-14962 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.787, + 0.23 + ], + "angle": 0, + "content": "17. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-or, D.: Prompt-to-prompt image editing with cross-attention control. In: The Eleventh International Conference on Learning Representations (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.23, + 0.787, + 0.285 + ], + "angle": 0, + "content": "18. Kawar, B., Zada, S., Lang, O., Tov, O., Chang, H., Dekel, T., Mosseri, I., Irani, M.: Imagic: Text-based real image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6007-6017 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.285, + 0.787, + 0.326 + ], + "angle": 0, + "content": "19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.326, + 0.69, + 0.338 + ], + "angle": 0, + "content": "20. Lab, D.: Deepfloyd if. https://github.com/deep-floyd/IF (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.338, + 0.787, + 0.379 + ], + "angle": 0, + "content": "21. Lee, K., Liu, H., Ryu, M., Watkins, O., Du, Y., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Gu, S.S.: Aligning text-to-image models using human feedback. arXiv preprint arXiv:2302.12192 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.379, + 0.787, + 0.42 + ], + "angle": 0, + "content": "22. Li, C., Gan, Z., Yang, Z., Yang, J., Li, L., Wang, L., Gao, J.: Multimodal foundation models: From specialists to general-purpose assistants. arXiv preprint arXiv:2309.10020 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.42, + 0.787, + 0.461 + ], + "angle": 0, + "content": "23. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.461, + 0.787, + 0.502 + ], + "angle": 0, + "content": "24. Lu, P., Peng, B., Cheng, H., Galley, M., Chang, K.W., Wu, Y.N., Zhu, S.C., Gao, J.: Chameleon: Plug-and-play compositional reasoning with large language models. arXiv preprint arXiv:2304.09842 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.787, + 0.543 + ], + "angle": 0, + "content": "25. Madaan, A., Tandon, N., Gupta, P., Hallinan, S., Gao, L., Wiegreffe, S., Alon, U., Dziri, N., Prabhumoye, S., Yang, Y., et al.: Self-refine: Iterative refinement with self-feedback. arXiv preprint arXiv:2303.17651 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.543, + 0.787, + 0.583 + ], + "angle": 0, + "content": "26. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.583, + 0.787, + 0.624 + ], + "angle": 0, + "content": "27. Nasiriany, S., Xia, F., Yu, W., Xiao, T., Liang, J., Dasgupta, I., Xie, A., Driess, D., Wahid, A., Xu, Z., et al.: Pivot: Iterative visual prompting elicits actionable knowledge for vlms. arXiv preprint arXiv:2402.07872 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.624, + 0.787, + 0.652 + ], + "angle": 0, + "content": "28. OpenAI: Dall-e 3 system card. https://cdn.openai.com/papers/DALL_E_3_System/Card.pdf (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.652, + 0.503, + 0.664 + ], + "angle": 0, + "content": "29. OpenAI: Gpt-4 technical report (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.664, + 0.787, + 0.692 + ], + "angle": 0, + "content": "30. OpenAI: Gpt-4v(ision) system card (2023), https://cdn.openai.com/papers/GPTV_System_Card.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.692, + 0.787, + 0.718 + ], + "angle": 0, + "content": "31. OpenAI: Gpt-4v(ision) technical work and authors. https://cdn.openai.com/contributions/gpt-4v.pdf (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.718, + 0.787, + 0.759 + ], + "angle": 0, + "content": "32. Pan, L., Saxon, M., Xu, W., Nathani, D., Wang, X., Wang, W.Y.: Automatically correcting large language models: Surveying the landscape of diverse self-correction strategies. arXiv preprint arXiv:2308.03188 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.787, + 0.8 + ], + "angle": 0, + "content": "33. Paranjape, B., Lundberg, S., Singh, S., Hajishirzi, H., Zettlemoyer, L., Ribeiro, M.T.: Art: Automatic multi-step reasoning and tool-use for large language models. arXiv preprint arXiv:2303.09014 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.787, + 0.841 + ], + "angle": 0, + "content": "34. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.267, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.189 + ], + "angle": 0, + "content": "35. Pryzant, R., Iter, D., Li, J., Lee, Y.T., Zhu, C., Zeng, M.: Automatic prompt optimization with \"gradient descent\" and beam search. arXiv preprint arXiv:2305.03495 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.232 + ], + "angle": 0, + "content": "36. Qi, J., Ding, M., Wang, W., Bai, Y., Lv, Q., Hong, W., Xu, B., Hou, L., Li, J., Dong, Y., et al.: Cogcom: Train large vision-language models diving into details through chain of manipulations. arXiv preprint arXiv:2402.04236 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.786, + 0.272 + ], + "angle": 0, + "content": "37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.786, + 0.314 + ], + "angle": 0, + "content": "38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.786, + 0.37 + ], + "angle": 0, + "content": "39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.786, + 0.424 + ], + "angle": 0, + "content": "40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E., Ghasemipour, S.K.S., Ayan, B.K., Mahdavi, S.S., Lopes, R.G., et al.: Photorealistic text-to-image diffusion models with deep language understanding. arXiv preprint arXiv:2205.11487 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.786, + 0.467 + ], + "angle": 0, + "content": "41. Schick, T., Dwivedi-Yu, J., Dessi, R., Raileanu, R., Lomeli, M., Zettlemoyer, L., Cancedda, N., Scialom, T.: Toolformer: Language models can teach themselves to use tools. arXiv preprint arXiv:2302.04761 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.468, + 0.786, + 0.508 + ], + "angle": 0, + "content": "42. Shen, Y., Song, K., Tan, X., Li, D., Lu, W., Zhuang, Y.: Huggingppt: Solving ai tasks with chatgpt and its friends in huggingface. arXiv preprint arXiv:2303.17580 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.786, + 0.536 + ], + "angle": 0, + "content": "43. Shi, J., Xiong, W., Lin, Z., Jung, H.J.: Instantbooth: Personalized text-to-image generation without test-time finetuning. arXiv preprint arXiv:2304.03411 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.537, + 0.786, + 0.563 + ], + "angle": 0, + "content": "44. Shinn, N., Cassano, F., Labash, B., Gopinath, A., Narasimhan, K., Yao, S.: Reflexion: Language agents with verbal reinforcement learning (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.786, + 0.605 + ], + "angle": 0, + "content": "45. Shridhar, M., Yuan, X., Côté, M.A., Bisk, Y., Trischler, A., Hausknecht, M.: Alfworld: Aligning text and embodied environments for interactive learning. arXiv preprint arXiv:2010.03768 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.786, + 0.647 + ], + "angle": 0, + "content": "46. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. arXiv preprint arXiv:2209.14792 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.648, + 0.786, + 0.674 + ], + "angle": 0, + "content": "47. Surís, D., Menon, S., Vondrick, C.: Vipergpt: Visual inference via python execution for reasoning. arXiv preprint arXiv:2303.08128 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.786, + 0.715 + ], + "angle": 0, + "content": "48. Wang, J., Yang, Z., Hu, X., Li, L., Lin, K., Gan, Z., Liu, Z., Liu, C., Wang, L.: Git: A generative image-to-text transformer for vision and language. arXiv preprint arXiv:2205.14100 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.786, + 0.758 + ], + "angle": 0, + "content": "49. Wang, Z.J., Montoya, E., Munechika, D., Yang, H., Hoover, B., Chau, D.H.: Diffusiondb: A large-scale prompt gallery dataset for text-to-image generative models. arXiv preprint arXiv:2210.14896 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.786, + 0.799 + ], + "angle": 0, + "content": "50. Wu, C., Yin, S., Qi, W., Wang, X., Tang, Z., Duan, N.: Visual chatgpt: Talking, drawing and editing with visual foundation models. arXiv preprint arXiv:2303.04671 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.786, + 0.84 + ], + "angle": 0, + "content": "51. Wu, J., Wang, J., Yang, Z., Gan, Z., Liu, Z., Yuan, J., Wang, L.: Grit: A generative region-to-text transformer for object understanding. arXiv preprint arXiv:2212.00280 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Yang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "52. Wu, P., Xie, S.: V*: Guided visual search as a core mechanism in multimodal llms. arXiv preprint arXiv:2312.14135 17 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.176, + 0.785, + 0.217 + ], + "angle": 0, + "content": "53. Yan, A., Yang, Z., Zhu, W., Lin, K., Li, L., Wang, J., Yang, J., Zhong, Y., McAuley, J., Gao, J., et al.: Gpt-4v in wonderland: Large multimodal models for zero-shot smartphone gui navigation. arXiv preprint arXiv:2311.07562 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.785, + 0.244 + ], + "angle": 0, + "content": "54. Yang, C., Wang, X., Lu, Y., Liu, H., Le, Q.V., Zhou, D., Chen, X.: Large language models as optimizers. arXiv preprint arXiv:2309.03409 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.245, + 0.785, + 0.286 + ], + "angle": 0, + "content": "55. Yang, Z., Li, L., Lin, K., Wang, J., Lin, C.C., Liu, Z., Wang, L.: The dawn of Imms: Preliminary explorations with gpt-4v (ision). arXiv preprint arXiv:2309.17421 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.785, + 0.327 + ], + "angle": 0, + "content": "56. Yang*, Z., Li*, L., Wang*, J., Lin*, K., Azarnasab*, E., Ahmed*, F., Liu, Z., Liu, C., Zeng, M., Wang, L.: Mm-react: Prompting chatgpt for multimodal reasoning and action. arXiv preprint arXiv:2303.11381 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.383 + ], + "angle": 0, + "content": "57. Yang, Z., Wang, J., Gan, Z., Li, L., Lin, K., Wu, C., Duan, N., Liu, Z., Liu, C., Zeng, M., et al.: Reco: Region-controlled text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14246-14255 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.785, + 0.424 + ], + "angle": 0, + "content": "58. Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W.W., Salakhutdinov, R., Manning, C.D.: Hotpotqa: A dataset for diverse, explainable multi-hop question answering. arXiv preprint arXiv:1809.09600 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.466 + ], + "angle": 0, + "content": "59. Yao, S., Zhao, J., Yu, D., Du, N., Shafran, I., Narasimhan, K., Cao, Y.: React: Synergizing reasoning and acting in language models. arXiv preprint arXiv:2210.03629 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.508 + ], + "angle": 0, + "content": "60. Yin, S., Wu, C., Yang, H., Wang, J., Wang, X., Ni, M., Yang, Z., Li, L., Liu, S., Yang, F., et al.: Nuwa-xl: Diffusion over diffusion for extremely long video generation. arXiv preprint arXiv:2303.12346 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.508, + 0.785, + 0.55 + ], + "angle": 0, + "content": "61. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. Transactions on Machine Learning Research (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.785, + 0.591 + ], + "angle": 0, + "content": "62. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.591, + 0.785, + 0.619 + ], + "angle": 0, + "content": "63. Zhang, L., Agrawala, M.: Adding conditional control to text-to-image diffusion models. arXiv preprint arXiv:2302.05543 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.619, + 0.785, + 0.646 + ], + "angle": 0, + "content": "64. Zhao, A., Huang, D., Xu, Q., Lin, M., Liu, Y.J., Huang, G.: Expel: Llm agents are experiential learners. arXiv preprint arXiv:2308.10144 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.646, + 0.785, + 0.688 + ], + "angle": 0, + "content": "65. Zhu, W., Wang, X., Lu, Y., Fu, T.J., Wang, X.E., Eckstein, M., Wang, W.Y.: Collaborative generative ai: Integrating gpt-k for efficient editing in text-to-image generation. arXiv preprint arXiv:2305.11317 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.688 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_origin.pdf b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e55793c486246496e113e12a2f26a99a95964e93 --- /dev/null +++ b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/9e10ba68-fdfe-43e3-8fb6-0d308a0b6cb9_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:68adfc8ed5ed7e16f36e74f187773052db4877edaa65cebdebe5b4eae5495388 +size 9714085 diff --git a/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/full.md b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..453185bb208859d7e8f37f198f809ea8bf19b2ca --- /dev/null +++ b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/full.md @@ -0,0 +1,447 @@ +# Idea2Img: Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation + +Zhengyuan Yang, Jianfeng Wang, Linjie Li, Kevin Lin, Chung-Ching Lin, Zicheng Liu, and Lijuan Wang + +Microsoft +{zhengyang, jianfw, lindsey.li, keli, chungching.lin, zliu, lijuanw}@microsoft.com +https://idea2img.github.io/ + +Abstract. We introduce "Idea to Image,"1 an agent system that enables multimodal iterative self-refinement with GPT-4V(ison) for automatic image design and generation. Humans can quickly identify the characteristics of different text-to-image (T2I) models via iterative explorations. This enables them to efficiently convert their high-level generation ideas into effective T2I prompts that can produce good images. We investigate if systems based on large multimodal models (LMMs) can develop analogous multimodal self-refinement abilities that enable exploring unknown models or environments via self-refining tries. Idea2Img cyclically generates revised T2I prompts to synthesize draft images, and provides directional feedback for prompt revision, both conditioned on its memory of the probed T2I model's characteristics. The iterative self-refinement brings Idea2Img various advantages over vanilla T2I models. Notably, Idea2Img can process input ideas with interleaved image-text sequences, follow ideas with design instructions, and generate images of better semantic and visual qualities. The user preference study validates the efficacy of Idea2Img on automatic image design and generation via multimodal iterative self-refinement. + +Keywords: Multimodal Agents $\cdot$ Large Multimodal Models $\cdot$ Image Design and Generation + +# 1 Introduction + +"Image design and generation" aims to create an image from a high-level user idea. This input IDEA can contain interleaved reference images, such as "the dog looks like the one in the image," or with instructional texts specifying the intended design usage, such as "a logo for the Idea2Img system." To convert IDEA into an image, humans may first draft detailed descriptions of the imagined image, and then use text-to-image (T2I) models [34, 37, 38, 40, 61] to generate the image. This manual process for users to search for an ideal detailed description (i.e., T2I prompt) that fits the T2I model typically involves iterative exploration [49, 65]. As shown in Figure 1, humans may first design and draft an + +![](images/96ec1432c7adcc603d1e1d5a8afdf74c0202bc636eed433b3523ce5bb9dbbcfa.jpg) +Fig. 1: Idea2Img framework enables LMMs to mimic human-like exploration to use a T2I model, enabling the design and generation of an imagined image specified as a multimodal input IDEA. The iterative process involves LMMs functioning in different roles to refine the image creation. Specifically, LMMs will (1) generate and revise text prompts for the T2I model, (2) select the best draft images, and (3) provide feedback on the errors and revision directions. This multimodal iterative self-refinement process requires LMMs to memorize the T2I model's characteristics observed in previous iterations as humans and adjust T2I prompts accordingly. + +initial T2I prompt based on their imagined IDEA to generate. Then, they can obtain multiple draft images with a T2I model, select the most promising draft, write text feedback, and further revise the T2I prompt. As this iteration progresses, we humans can swiftly grasp the characteristics of a specific T2I model, such as words that the model can not understand, finally producing a good image generated by a suitable T2I prompt. Given the remarkable capabilities of large multimodal models (LMMs) [14, 29, 55], we explore if we can build systems based on LMMs to develop similar iterative self-refinement ability, thereby relieving humans from the tedious process of converting ideas to images. + +Iterative self-refinement is one intrinsic ability humans possess when exploring unknown environments and solving complicated problems. Large language models (LLMs) agent systems [9,25,44] have demonstrated the effectiveness of self-refinement in better addressing natural language processing tasks, such as acronym generation, sentiment retrieval, text-based environment exploration, etc. Transitioning from text-only tasks to multimodal environments poses new challenges of improving, assessing, and verifying multimodal contents, such as multiple interleaved image-text sequences. For example, when learning to use T2I models, LMMs need to improve the generation with revised T2I prompts, assess multiple images in detail to select the best draft, and verify the draft image with the multimodal IDEA to provide text feedback. These steps, each requiring different multimodal understanding capabilities, jointly enable the intriguing multimodal iterative self-refinement ability. Such an LMM framework can au + +IDEA + +T21 + +Idea2Img + +IDEA + +T21 + +Idea2Img + +IDEA + +T21 + +Idea2Img + +# Object count + +5 people sitting around a table drinking beer and eating buffalo wings + +![](images/5e13ef01c1210e5877d8c3ed8f0028b1e258330f5291f056b59eea75838c15e5.jpg) + +![](images/615e24616c711460af3e8995ea583b55482f9a56df119d25021fae8e16e164a4.jpg) + +# Knowledge + +![](images/c0907f7224cdf5a003d939cd996df99e0feeb44fb06bc624a28d825f32f260da.jpg) + +![](images/9acc7e2252db2c7931ab584971aea2a49f297c79a44c2ee404ca62224354782e.jpg) + +# Visual design + +![](images/dde28c707e42cb7cdd3f9d560e9e083aee0f0ee5e37ce6ce9079776fa4d43de1.jpg) + +![](images/6d25c985509051fe656024ac42a3a0a55d59c668836fe3f87f28021378b57772.jpg) + +# Scene text + +a whole cake on the table with words Azure Research written on the cake + +![](images/a57471431eb286f6d21cb899dbcde2039f4e87c50403d8a0ef23091f2e090cf9.jpg) + +![](images/3121ab905d3ae8896ce1303d73c0a4e6dcb144fa5695ecef228bfed6dabc5b74.jpg) + +# Prompt following + +a plan that has no barriers or obstacles; there is a glass without orange juice next to it + +![](images/ca32aed4598040e85792a99fd8bebe2beb4a793ed6594256da1c6ef5a27463a0.jpg) + +# Intended usage + +an image of a car perfect for a children's painting competition + +![](images/f8f62c1c5f89dbcc558a7ebde421fecfc6ca47fb478c4996e16966a2045a4743.jpg) + +![](images/d8682c0070598df6acbc14c405f873d399ee47e84fe44c2d259814709a665e85.jpg) + +# Concept customization & visual pointing + +photo of the obje by the blue arrow brown corgi dog + +![](images/ad23c7881fbedb4c69735105f2bafe0a141a118a7ee8fdca82b697ddf363c4fe.jpg) + +![](images/7f071f2c9e591e3232ee6379bce623a73e59ea5b1ffb90e07fedf786595e7211.jpg) + +![](images/68f5fdd755ec40f10316a622495a7fa48c7cb119fe1bb1c44abab67df66a039a.jpg) + +# Visual attribute referring + +![](images/bb40aa58800fc30699d13f0db48a942fe7af31b39c2770e1b98b7b0c1372dbeb.jpg) + +![](images/df07e30f24e538768846a0e9ebf4c04837f573d7460847f40f75ce2f6b8f1203.jpg) + +![](images/66f475d4174a3e443aafbd56ebd14e56e57f54ecaa37b315009e73843f4651cd.jpg) + +# Style transfer + +painting of a corgistyle similar to theimage + +![](images/1f21a76ed0a19268c34c3e8d1c0e81d7c09e406cc79aa3d491fa95a5631f02d9.jpg) + +![](images/3d29a2e40a7bad267e0760e03b89c11e9b3afb7f3debcb82a06bb14ed6eb07e7.jpg) + +![](images/4d163b486b7dc4d45446e4c3376b21989a60752c708c04eacbff17cf01ad52e9.jpg) + +# Opposite style transfer + +painting of a corgi dog with style different from the image + +![](images/a13c249e594bead09c65206026e0661932bd7282930dd559442eab58df435f53.jpg) + +![](images/fbc46284f4b1621b2859dfd91dde707f94e818255f03cae9729ebc823a4f1f95.jpg) + +![](images/16e0dfd709fa70f1129d92e8b79e960746513941ebec7a6e0d05c2f02a06b5f3.jpg) + +# Image manipulation + +a drawing with the background chain + +![](images/6c443abaf74902e3dd66d77f34e2bd0674c2c13d592ef8cca0b401a359f9e924.jpg) + +![](images/16557e08d1a037697d57d102e130bea58ae64543f22b0bfc195443ca49048b12.jpg) + +![](images/2d26672c68ecd8824ad0e0af1d6733ae5e44ffd183483b3c715cf605a630932b.jpg) + +A hand drawing of room +The people can sleep and study. Hand drawing shows +the sketch and looks like the +given image. + +![](images/f6d911c64cd008d4a9632319f9c15a7bed8ad06c7fc5c858bf018119fbe77343.jpg) + +![](images/244fe835042e89c35167f1e84bd503a508c7756383c2f5f991bc6485a1cd0b5d.jpg) + +![](images/043c8d6813b94323dabfd7b8a17dcdd65361acae9c030a3a38be5a0e0d0d5c81.jpg) + +# In-context entity and style transfer + +Find the the image style pattern in the left two dog images and apply it on the to right people in tree pose. Find the text in detail description that keeps the content in the people in tree pose image, with the correct style pattern. + +![](images/e904bacfa14eb290c2accdb99b9ebd5c85ef1ae1bd1d5f122701a289ca0a8146.jpg) + +![](images/5a682e2ce9e2e8e6ba0877a6b9d704a3231f80c878bbf9da1c2f24eecc9eb621.jpg) + +![](images/08a40902270550b3aa9ab0a1f02248f49a1f8680cb25a2434271d34665850d5f.jpg) + +Photo of Bill Gates with the same cloth as in the given image + +![](images/8b4ab19bdc4d774addf2ef12343a28383771084374721cbad500f82203eda336.jpg) + +![](images/9c31092f8037c4fe15d99649c4b6113cb3bf280ab223da2093cc908df60bcefc.jpg) + +![](images/485eb795f8a5365e9ff96144305bc63d27a457f13532f9bb878300fa08d1df88.jpg) + +# Visual attribute referring & style transfer + +A painting of a tennis game + +![](images/c8b3a7c85f9adf62af751ab8d909f31f715f26e8b7a338a34f573cd02f7e2630.jpg) +Fig. 2: Overview of the image design and generation scenarios enabled by Idea2Img. In each sub-figure, the image and text in the left green box are the user input IDEA. The center image is the baseline results directly generated by the same T2I model with a human-written T2I prompt, and the image on the right is generated with the T2I prompt discovered by Idea2Img's iterative self-refinement exploration. + +![](images/13d44f666f5e9c28160dfc8482c179e93771cd7f82d8b7cbcf69f201a6c642d6.jpg) + +![](images/8dfe9fab3d5a057fd083b76b392aaffe996a2e7f3aca760bd65e9c8527a46472.jpg) + +A logo with a design that naturally blends the two given colors as a new logo. The first image is + +![](images/b004832f502ca769d25897eadca35c6022c80365f44a6276231b3a45b866ec2f.jpg) + +![](images/be6185a0bd954b001d0c04ba16f8430ca08379f002b3f52f14a7b105f6b05bd7.jpg) + +![](images/fe1d10b4d08b3c8639c8362045b14a6e6b531158e36ce4a110384d001da28f5c.jpg) + +![](images/aadac95d1d882a8c210a27e6ea05af46ee54ecfb18c7b1759536193391f72812.jpg) + +IDEA + +T21 + +Idea2Img + +IDEA + +T21 + +Idea2Img + +tomatically learn to tackle various real-world problems [55] via self-exploration, such as navigating GUI to use electronic devices, exploring unknown physical environments via an embodied agent, engaging in electronic games, and so on. In this study, we focus on "image design and generation" as the task to study the multimodal iterative self-refinement ability. + +To this end, we introduce Idea2Img, a multimodal iterative self-refinement framework for automatic image design and generation. As illustrated in Figure 1, Idea2Img involves an LMM, GPT-4V(ison) [1, 29-31], interacting with a + +T2I model to probe its usage and find an effective T2I prompt. The LMM will act in different roles to analyze the return signal from the T2I model (i.e., draft images) and design the next round's queries (i.e., text T2I prompts). The three roles of generating T2I prompts, selecting draft images, and reflecting feedback together enable the multimodal iterative self-refinement ability. Specifically, (1) Prompt generation: GPT-4V generates $N$ text prompts that correspond to the input multimodal user IDEA, conditioned on the previous text feedback and refinement history; (2) Draft image selection: GPT-4V carefully compares $N$ draft images for the same IDEA and select the most promising one; (3) Feedback reflection: GPT-4V examines the discrepancy between the draft image and the IDEA. GPT-4V then provides feedback on what is incorrect, the plausible causes, and how T2I prompts may be revised to obtain a better image. Furthermore, Idea2Img is enhanced with a memory module that stores all prompt exploration histories, including previous draft images, text prompts, and feedback. The Idea2Img framework iterates among these three steps with GPT-4V for automatic image design and generation. + +To users, Idea2Img functions as an enhanced image design and generation assistant. Compared with T2I models, Idea2Img can handle design instructions instead of requiring detailed image description, support the multimodal IDEA input, and generate images of better semantic and visual qualities. We overview representative image design and generation scenarios in Figure 2. For example, Idea2Img can incorporate the visual design and intended usage description in IDEA, extract arbitrary visual information from the input image, and process IDEA with arbitrarily interleaved image-text sequences. Built upon these new functionalities and scenarios of interest, we develop an evaluation IDEA set with 104 samples, containing complicated queries that humans may fail in their first trials. We perform user preference studies on Idea2Img with different T2I models. The consistent user preference score improvements on different image generation models, e.g., $+26.9\%$ with SDXL [34], indicate the effectiveness of Idea2Img in image design and generation. + +Our contributions are summarized as follows. + +- We study "automatic image design and generation," which aims to create an image from an input IDEA. This new multimodal IDEA input enables visual creation with reference image inputs and instructions on desired designs. +- We explore the multimodal iterative self-refinement ability in GPT-4V-based agent systems, showcasing its effectiveness in improving, assessing, and verifying multimodal contents. +- We propose Idea2Img, a multimodal iterative self-refinement framework that enhances any image generation model for visual design, enabling various new image creation functionalities, and achieving better generation qualities. +- We present an evaluation set with 104 challenging multimodal IDEA. The consistent user preference score improvements, when experimented on different image generation models, indicate Idea2Img's effectiveness in automatic image design and generation. + +# 2 Related Work + +LLM-based self-refinement. Idea2Img is inspired by the effectiveness of iterative self-refinement in LLM-based agent systems [25,32,44] in exploring unknown environments and tasks, built upon the successful LLM agents [15,33,35,41,54, 59,64]. Self-refine [25] takes the same LLM to iteratively critique its outputs and leverage this feedback to enhance its predictions, showing effectiveness across various NLP tasks. Reflexion [44] explores a self-reflective LLM system on the text-based environment exploration task [45] and multi-hop QA [58]. Despite the success, LLM-based self-refinement naturally can not understand multimodal inputs. Consequently, the explored tasks and environments are limited to the natural language description, such as AlfWorld [45]. Idea2Img explores the potential of an LMM-based iterative self-refinement system for multimodal environment exploration, from a simple T2I model to other more complicated environments. + +Multimodal agents. Our Idea2Img is related to multimodal agents [16, 22, 24, 42, 47, 50, 56, 62] that chain external tools such as T2I or vision-language models with LLMs for multimodal tasks. For instance, MM-ReAct [56] integrates ChatGPT with multiple vision tools for multimodal reasoning and action, enabling it to solve various complicated visual understanding tasks. Visual ChatGPT [50] empowers ChatGPT to allocate various image generation models, such as Stable Diffusion [38], img2img model [26], ControlNet [63], enabling multi-step visual editing and generation. The primary difference between Idea2Img and existing multimodal agent studies [50, 56] lies in the approach to understand the tool usage. Existing studies assume the knowledge of how to best use each tool and provide such information to LLMs via text instructions or in-context examples. In contrast, the optimal usage of the tool remains unknown in Idea2Img and requires iterative exploration. Another minor distinction is that Idea2Img utilizes LMMs instead of LLMs, thereby does not require general visual understanding tools such as a caption model [48, 51]. + +Extensions of base T2I models. Idea2Img provides a more natural way for users to design and produce their desired visual content. This framework, which extends T2I models for new functionalities, is related to various works in improving base T2I models [34, 37, 38, 40, 61]. These studies include extending the base T2I model to better follow user prompts [5, 7, 10, 12], finding magic words in T2I prompts for better visual quality [49, 65], supporting extra image input for image manipulation [6, 17, 18, 26], style transfer [13], visual concept customization [2, 8, 19, 39, 43], and so on. While specialized T2I extensions can address a single specific functionality, Idea2Img offers a more unified and widely applicable framework. That is, a single Idea2Img framework can handle various generation scenarios, ranging from style transfer to attribute customization, without requiring separate models or task-specific model design and finetune. More importantly, Idea2Img effectively collaborates with those enhanced generative models, consistently improving them by exploring suitable text prompts. + +![](images/f77c1b2c1de8419a4a8c23b24d62bc3301ce94f04f992d98fda7e76db2c72724.jpg) +Fig. 3: The framework overview of Idea2Img, which takes an LMM [29,30] to explore a T2I model via multimodal iterative self-refinement, leading to an effective T2I prompt for the input user IDEA. The rounded rectangle shape indicates a GPT-4V call. + +# 3 Idea2Img Framework + +Figure 3 illustrates the Idea2Img framework. Idea2Img framework involves two core pre-trained models, i.e., the GPT-4V(ison) as the LMM $\mathcal{M}$ and a text-conditioned image generation model $^2$ to explore $\mathcal{G}$ . Idea2Img also contains a memory $m$ that stores insights on $\mathcal{G}$ discovered by $\mathcal{M}$ during previous iterations. Execution flow. We begin with an overview of the key steps in $\mathcal{M}$ iteratively exploring the use of $\mathcal{G}$ . Starting from the top-left of Figure 3, "initial prompt generation" converts the input multimodal user IDEA into T2I text prompts, later producing multiple draft images with T2I model $\mathcal{G}$ . "Draft image selection" then selects the best draft image among them for the current iteration. The selected image is either output as the final prediction or continues for further refinement, depending on the stop condition. For the latter, "feedback reflection" compares the current best draft image with the multimodal IDEA, and summarizes the major discrepancy as text feedback. With the iteration history and text feedback, "revised prompt generation" then drafts revised T2I prompts and continues the iterative self-refinement with the new set of draft images. + +$\Theta$ Initial prompt generation. This step generates $N$ initial T2I prompts $\{y_0^0,\dots ,y_0^{N - 1}\}$ following the input user IDEA $x$ , by prompting $\mathcal{M}$ with LMM prompt $p_{gen}$ : + +$$ +\left\{y _ {0} ^ {0}, \dots , y _ {0} ^ {N - 1} \right\} = \mathcal {M} (x, p _ {\text {g e n}}) \tag {1} +$$ + +The "initial prompt generation" requires $\mathcal{M}$ to understand multimodal user IDEA $x$ and convert design IDEA into descriptive T2I prompts. LMM prompt $p_{gen}$ is a zero-shot prompt without in-context examples. + +With the "initial prompt generation" step, Idea2Img can understand user IDEA with interleaved image-text sequences, instead of the text-only T2I prompts containing the image description. Specifically, (1) IDEA can be a high-level design or usage instead of the detailed image description, such as "a car image for a children's painting competition"; and (2) IDEA can take multiple images and use interleaved text instruction to extract arbitrary visual information of interest, including image style, visual entity, object attributes, etc. Then, in iteration $t = 0$ as well as future iterations $t = t$ , each T2I prompt $y_{t}^{n}$ is separately sent to the T2I model $\mathcal{G}$ , resulting in $N$ draft images $i_{t}^{n} = \mathcal{G}(y_{t}^{n})$ , $n = 0, \dots, N - 1$ . + +$\boxed{2}$ Draft image selection. With the $N$ draft images in iteration $t$ , "draft image selection" selects the best draft image $i_t^*$ by prompting $\mathcal{M}$ with LMM prompt $p_{select}$ : + +$$ +i _ {t} ^ {*} = \mathcal {M} \left(i _ {t} ^ {0}, \dots , i _ {t} ^ {N - 1}, x, p _ {\text {s e l e c t}}\right). \tag {2} +$$ + +The design of a "draft image selection" step is motivated by the observation that T2I models could generate bad images with good prompts. This step is designed to filter out low-quality images, and avoid the quality perturbation to dominate the iterative refinement. + +The task of selecting the best image requires $\mathcal{M}$ to compare and grade both the semantics and visual quality of $N$ similar draft images. We find such a "spot the difference" task challenging for LMMs, and only the very recent models [29, 55] are capable of performing the selection reliably. + +③ Feedback reflection. After obtaining the selected image $i_{t}^{*}$ , the framework checks the stop condition, such as if the current iteration $t$ exceeds the maximum $T$ . Idea2Img then outputs $i_{t}^{*}$ as the output image or proceeds the refinement process to the "feedback reflection" step accordingly. + +"Feedback reflection" aims to provide text feedback $f_{t}$ that describes the direction to improve for draft image $i_{t}^{*}$ . The steps prompts $\mathcal{M}$ with LMM prompt $p_{fb}$ , conditioned on the draft image $i_{t}^{*}$ and memory $m$ : + +$$ +f _ {t} = \mathcal {M} \left(i _ {t} ^ {*}, m, x, p _ {f b}\right). \tag {3} +$$ + +"Feedback reflection" takes $\mathcal{M}$ to compare an image $i_t^*$ with the multimodal user $IDEAx$ , and summarize the gap as text feedback $f_{t}$ . The step not only requires $\mathcal{M}$ to identify the discrepancy between image $i_t^*$ and $IDEAx$ , but also benefits from writing the major errors to make the iteration effective. In practice, we find it helpful to explicitly specify the aspects to check, such as style, entity, attributes, appearance, etc., via text instructions or in-context examples in LMM prompt $p_{fb}$ . Furthermore, we add text instructions to $p_{fb}$ to have $\mathcal{M}$ "focus on one thing to improve in each feedback," and "provide a high-level explanation of how to modify prompts to address the given feedback." + +$\boxed{4} / \boxed{1}$ Revised prompt generation. Finally, "prompt generation" takes text feedback $f_{t}$ and memory $m$ to draft $N$ revised prompt $\{y_{t+1}^{0}, \ldots, y_{t+1}^{N-1}\}$ , by prompting $\mathcal{M}$ with LMM prompt $p_{\text{revise}}$ : + +$$ +\left\{y _ {t + 1} ^ {0}, \dots , y _ {t + 1} ^ {N - 1} \right\} = \mathcal {M} \left(f _ {t}, m, x, p _ {\text {r e v i s e}}\right). \tag {4} +$$ + +Generating revised prompts requires $\mathcal{M}$ to understand the property of $\mathcal{G}$ stored in memory $m$ , thereby drafting new T2I prompts that could most likely address the issue identified in $f_{t}$ . We empirically demonstrate that Idea2Img can generate better prompts for $\mathcal{G}$ via iterative self-refinement. + +Memory module. Memory $m$ is one important design in Idea2Img. $m$ has the format of interleaved image-text sequences that store all previous iterations' feedback, selected draft image, and the corresponding text prompts: + +$$ +m _ {t} = \left[ y _ {0} ^ {*}, i _ {0} ^ {*}, f _ {0}, \dots , y _ {t - 1} ^ {*}, i _ {t - 1} ^ {*}, f _ {t - 1} \right]. \tag {5} +$$ + +It allows LMM $\mathcal{M}$ to understand the properties and capabilities of the T2I model $\mathcal{G}$ in use, such as a keyword that $\mathcal{G}$ may not understand or a complicated scene that $\mathcal{G}$ fail to generate, and incorporate such knowledge in generating the revised T2I prompts $y$ . For example, it may describe the appearance of a yoga pose in detail, instead of only mentioning its name in $y$ . Examples are shown in Appendix Figures A-D, when comparing initial and refined prompts $y_0$ and $y_T$ . + +# 4 Experiments + +# 4.1 Experiment Settings + +Compared model variants. We mainly compare the following three models in image generation. + +- "Initial-round manual prompt" is the baseline T2I prompt written by humans with minor prompt engineering. It serves as the baseline of a T2I prompt that merely contains key information in IDEA. +- "Initial-round Idea2Img prompt" is the LMM-generated T2I prompt in the initial round. Specifically, the max iteration $T = 1$ , and LMM $\mathcal{M}$ is only used for initial prompt generation and draft image selection, but not feedback reflection nor revised prompt generation. This Idea2Img variant is used to ablate Idea2Img's gain from prompt generation and selection, vs. the further iterative refinement. +- "Iterative self-refined Idea2Img prompt" is complete Idea2Img pipeline with the max iteration $T = 3$ . + +Evaluation samples and metrics. For the quantitative evaluation, we collect a dataset of 104 user IDEA as input queries. Among them, 33 queries contain text only, 43 queries contain an image-text sequence with a single image, and the remaining 28 contains a sequence with two or more images. The text in most IDEA contains not only descriptive content text that describes the scene to generate, but also instructional text such as "a logo for commercial advertising" or "generate the pointed dog in blue." All test queries are manually composed. + +We then perform the user preference study as the main quantitative metric. Users are presented with the IDEA and multiple images to select the best one for each IDEA. The evaluation script automatically shuffles the order during evaluation to prevent the influence of image orders. + +Table 1: User preference scores when applying Idea2Img onto different image generation models (compare the three scores in the middle section within each row individually). We observe that "Iterative self-refined Idea2Img prompt" is consistently favored across all experimented image generation models. $\varDelta_{\mathrm{iteration}}$ reports the preference gain from the iterative Idea2Img over the initial-round Idea2Img. + +
User preference score (%)Initial-round manual promptInitial-round Idea2Img promptIterative self-refined Idea2Img promptΔiteration
SDXL v1.013.529.856.7+26.9
DeepFloyd IF14.434.651.0+16.3
SD v2.113.540.446.2+5.8
SD v1.58.643.348.1+4.8
SDXL-img2img8.634.656.7+16.3
IF-img2img8.638.552.9+14.4
+ +![](images/61af0acc3da68a8818044962d683f9fc14f60170ae2426ea12876ef7182a9606.jpg) +Fig. 4: User preference scores among T2I models before and after iterative self-refinement. We observe that the initially favored T2I model, SDXL, benefits more from the Idea2Img iteration. + +Experimented T2I models. We experiment Idea2Img on a wide variety of T2I model $\mathcal{G}$ with diverse model capacities and functionalities. Specifically, we study Stable Diffusion (SD) v1.5 [38], SD v2.1, SDXL v1.0 with refiner [34], and DeepFloyd IF (IF-I-XL and IF-II-L) [20]. Other than T2I models, we also consider the img2img pipeline (i.e., SDEdit [26]) for SDXL and DeepFloyd IF, as a demonstration of using Idea2Img for the text-conditioned image-to-image generation. The default strength $t_0$ in the img2img pipeline is 1.00. SDXL-img2img and IF-img2img are the same as SDXL and IF (i.e., T2I) when IDEA contains text only, and condition on the first image with IDEA contains multiple images. LMM prompts $p_{gen}, p_{select}, p_{fb}, p_{revise}$ are kept the same for all experimented T2I models. Appendix Section B shows the complete LMM prompts. + +# 4.2 Image Generation Results + +User preference evaluation. Table 1 compares the user preference when selecting from the three images generated by "initial-round manual prompt," "initial-round Idea2Img prompt," and "iterative self-refined Idea2Img prompt." + +for each user IDEA with the same T2I model. Among T2I models with different model sizes and functionalities, Idea2Img leads to consistent improvements in user preference. The initial-round Idea2Img prompt already improves the initial-round manual prompt, by effectively understanding the multimodal user IDEA and selecting the best draft images. The full Idea2Img framework further improves from the initial-round Idea2Img results with the multimodal iterative self-refinement. For example, when using SDXL v1.0, users prefer the images generated by Idea2Img $59/104 = 56.7\%$ times, compared with the baseline of $14/104 = 13.5\%$ . Similar improvements are observed on all experimented T2I models, as shown in the bolded column "iterative self-refined Idea2Img prompt." + +Furthermore, we examine which T2I model benefits the most from the LMM iterative self-refinement. By comparing the $\Delta_{\mathrm{iteration}}$ in Table 1 that represents the difference between first-round and iterative Idea2Img user preference, we observe that stronger T2I models tend to benefit more from LMM refinements. For example, SDXL and IF become more favored $26.9\%$ and $16.3\%$ times after iteration, compared with the $5.8\%$ and $4.8\%$ for SD v2.1 and SD v1.5. The trend that stronger T2I models benefit more from Idea2Img is also observed in Figure 4's analysis, where users pick their preferred image generated by different T2I models. After Idea2Img's iterative refinement, the initially favored model SDXL benefits more from the iteration, resulting in an even higher user preference rate, from $46.2\%$ to $65.4\%$ . We conjecture that the better language understanding ability in stronger T2I models enables them to better follow revised T2I prompts. They also have a better image generation capability that makes it possible to generate challenging scenes, when given a good T2I prompt optimized by Idea2Img. Nonetheless, Idea2Img is effective across T2I models of varying capacities, consistently leading to a higher user preference score. + +Qualitative comparisons. Idea2Img could help users generate images that better follow IDEA, such as the correct object counts in Figure 5(a). Idea2Img enables visual content design, in contrast to conventional T2I that requires a detailed visual content description. For example in Figure 5(b), Idea2Img designs visual logo based on the instruction of "a logo for a 2024 conference in Seattle." The power of LMMs allows Idea2Img to extract arbitrary information from the input image for visual generation. This could be any object in the image like "the circled dog" in Figure 5(c) or the image style like in Figure 5(d). Such general visual conditioning ability can be seamlessly extended to compose multiple visual and text conditions, such as composing the camera angle and image style in Figure 5(e) and two objects in Figure 5(f). + +Other than SDXL, Idea2Img is effective in finding text prompts for other image generation models. This includes arbitrary T2I models (e.g., SD v2.1 [38], DeepFloyd IF [20], DALL-E 3 [28], etc.), text-conditioned image-to-image models (e.g., SDXL-img2img and IF-img2img with SDEdit [26]), and other specialist generation models (e.g., reward-tuned T2I [11,21], region-controlled generators [23,57,63], and other specialist models [3,6,39]). Figure 6 overviews Idea2Img working with different image generation models. We show additional qualitative results and discussions in Appendix Section A.1. + +![](images/ff6e2f54ee9ff98dcb1231dc24be3a07b3607f28e4499cfd797b2810b0243791.jpg) +Fig. 5: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with SDXL [34] as the T2I model. + +How Idea2Img may assist humans? We use selected qualitative results to highlight the scenarios where humans might find Idea2Img most helpful in image design and generation, compared with conventional T2I generation. + +1. New functionalities with multimodal IDEA inputs. Idea2Img provides a more natural way for human interaction, where users do not have to describe their desired image solely through texts and painstakingly search for the right prompt word. Instead, the multimodal IDEA allows Idea2Img to precisely extract specific elements from one or multiple input images, such as the dog breed and color, pointed objects, artist style, camera view, and more, as shown in Figure 5. Finding proper words that the T2I model can understand for such visual concepts could be tedious for humans, e.g., the art style "with bold lines and bright colors, with a cubist and surrealistic style, with a focus on geometric shapes and patterns." in Figure 5(d). Idea2Img automates this process via Idea2Img iterative self-refinement. +2. New functionalities with instructional inputs. Vanilla T2I models struggle to understand T2I prompts that describe the intended visual design or purpose of the generated image, such as "a logo for a 2024 conference held in Seattle" in Figure 5(b). Instead, the prompt needs to be a comprehensive description of the image to generate, demanding extra drafting effort from users, such as "...the Seattle skyline in the center and the conference title + +![](images/98782994c053252840956b8e7315d7dc1269296e36a7cf5c2ab2cad15b38983c.jpg) +Fig. 6: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with different image generation models. Additional qualitative results and discussions are in Appendix A.1. + +below it ...". In contrast, Idea2Img effectively understands the instructional texts in IDEA and creates images accordingly. + +3. Better semantic and visual quality. Finally, the iterative refinement allows Idea2Img to generate images with better semantic and visual qualities, leading to an effective automatic image creation assistant. + +# 4.3 LMM Feedback, Revision, and Selection + +We show representative LMM outputs for "feedback reflection," "revised prompt generation," and "draft image selection." Additional results are in Appendix A.2. Feedback reflection. Figure 7(a) shows the text feedback generated by GPT-4V for the user IDEA and the draft image and T2I prompt. Idea2Img can effectively check if the generated image is correct, and verify if the draft image corresponds to the visual descriptions in IDEA. This includes the breed of the dog in (a.1), as well as art styles, objects, visual attributes, etc. In addition to identifying the discrepancy, Idea2Img also points to the plausible directions that may improve the T2I prompt in the text feedback. For example, in (a.2), Idea2Img provides guidance to have generated images better follow the user intention of "an image for a children's painting competition," by "specifically mentioning that the car should be simple and cartoon-like." + +![](images/0efa328db2f0df6b87158593670c825d0028bf463d6e56677785975bf0714bfb.jpg) + +![](images/d514d8be8b74ae2cf14a8ab3635b658c11d438fc4ea862f76ea027b78ba3a5a6.jpg) + +![](images/a20eb9469b23a5124a9bf92f5ace2ea5b3951eb5b188ccff9d144bfa8be9a10d.jpg) + +![](images/dd191f143c0e204985253e35e8ed203665e98373a7504f6aabd22b696e5f0ec1.jpg) +(a) Feedback reflection: The right column shows the examples of generated text feedback. + +![](images/dd3538bdb1722f43422b9a4ea5e5ae175a24bb3183e3fe207bf41aab4ce6b6dc.jpg) + +![](images/1ecf56695e6ffa93363acf9e0cbb3eab527099f2a093a79083f3c4688fa3b0e2.jpg) + +![](images/6b202203dcf4289450c9b511bd6694c93806925d3383b93505255933746a6d5f.jpg) + +![](images/5f75030b4a5c3a053463a85268a71ede8285cc389e2bb3b4dd344a49e7371b59.jpg) + +![](images/a0414c5df664e9b973c4ff07a101370ab2093ca9ea536e7e7a21f553f8b25abf.jpg) + +![](images/d43770d4933eb5bbb4b94e09f3bc4bf9a9d270097fa81e50afd2146df565f33b.jpg) +(b) Revised prompt generation: The right column shows the examples of revised prompts. + +![](images/8c2c91a41b987998e35f7b1a741c3b94402d5d7a47c009c24491884607bf08a9.jpg) + +![](images/1dcce2754b33014d3cc2e39b77725f21bd42b49056b50b192c3803c6c369fa89.jpg) + +![](images/d71f25e363574f77f808930acfce4bf278a14c0b106e0ec8f9276f6d7d7ea692.jpg) + +![](images/0e92a7c4196c9296c9efc25f9459be58c76f19e9b231186b2d1248cde54747fb.jpg) +(c) Draft image selection: The right column shows the examples of the draft image selection index and justification. +Fig. 7: GPT-4V's outputs in Idea2Img for image feedback, revision, and selection. + +![](images/d799b1de86dcc992ff7612ac2ee84744e4b8e1b0382e7af753c03aa9d9c41369.jpg) + +Revised prompt generation. Figure 7(b) compares the T2I prompts before and after the prompt revision, showcasing how text feedback may help the refinement. For example, in (b.1), the revised T2I prompt specifies "an empty plate with no other objects" to preclude the T2I model from generating bananas, which occurred with the previous prompt "no bananas." In (b.2), the revised T2I prompt includes a detailed description of "a yellow tennis outfit" and "a Yorkshire Terrier" to generate the queried clothing and dog. + +Draft image selection. Performing draft image selection requires LMMs to compare multiple similar draft images and pick the one that best matches the multimodal input $IDEA$ . Figure 7(c) shows the selection results generated by $Idea2Img$ . GPT-4V is prompted to give justifications and scores for each draft image, in addition to the final selection. We observe that $Idea2Img$ could comprehensively judges different aspects in $IDEA$ , and gives reasonable scores and selection indexes. E.g., finding the image with both sleep and study area in (c.1), verifying content and style in (c.2), and other examples in Appendix Figure G. + +# 5 Limitation and Discussion + +Tasks beyond image generation. Idea2Img explores the emergent ability of multimodal self-refinement in LMM-based systems, through the image design and generation task. Specifically, Idea2Img views the T2I model to use as an unknown multimodal environment to explore, and iteratively refines T2I prompts to find its optimal usage. This concept mirrors the intrinsic human approach of iterative problem-solving when faced with unknown environments or challenges. We leave its extension to other intriguing tasks, e.g., GUI navigation [53], embodied agents [27], and complicated visual reasoning [36, 52], for future exploration. + +From a single image generation model to multiple tools. Idea2Img explores using a single image generation model, such as a text-to-image model [38] or a text-conditioned image-to-image model [26]. When needed, other specialized generative models like ControlNet [63], inpainting [3], region-controlled T2I generation [23,57], customized generation [8,39], and video generation [46,60] can be seamlessly switched and supported. That is, Idea2Img could broadly boost different visual generation models of diverse specialties by exploring their optimal text description or instruction prompts. Beyond a single generation model, Idea2Img can also be used to allocate multiple tools as in multimodal agent studies [50,56]. In this case, Idea2Img isn't limited to optimizing the use of individual tools but also investigates their effective collaboration when used together, such as generator selection and multi-step visual generation. + +Consolidating explored knowledge. We have shown the effectiveness of LMM iterative self-refinement in automatic image design and generation. Idea2Img can also help to consolidate or distill the explored knowledge into T2I model parameters, such that no inference-time iterative refinement is needed when encountering seen generation scenarios. One could collect a dataset using Idea2Img for a scenario of interest, and fine-tune a T2I model with the explored self-refinement trajectory. Storing the probed knowledge as sample-agnostic prompt for each image generation model is another promising direction [15, 35, 64]. Finally, with minimal extra computation, we find it helpful to use the explored T2I prompt history as in-context examples for prompt re-writing and expansion, improving from the zero-shot expansion like the one in ChatGPT-Dalle-3 [1, 4]. + +# 6 Conclusion + +We have presented Idea2Img, a multimodal iterative self-refinement framework that leverages GPT-4V(ison) for image design and generation. Idea2Img explores the emergent capabilities of iterative self-refinement in LMM-based agent systems, showcasing its effectiveness in improving, assessing, and verifying the generated multimodal content. The user preference study demonstrates Idea2Img's capability in assisting humans to find the optimal usage of generation models for automatic image design and generation. + +# Acknowledgment + +We are deeply grateful to OpenAI for providing access to their exceptional tool [1, 29-31]. We also extend heartfelt thanks to our Microsoft colleagues for their insights, with special acknowledgment to Faisal Ahmed, Ehsan Azarnasab, and Lin Liang for their constructive feedback. + +# References + +1. Chatgpt can now see, hear, and speak. https://openai.com/blog/chatgpt-can-now-see-hear-and-speak (2023) +2. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-a-scene: Extracting multiple concepts from a single image. arXiv preprint arXiv:2305.16311 (2023) +3. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18208-18218 (2022) +4. Betker, J., Goh, G., Li, J., Brooks, T., Wang, J., Li, L., Ouyang, L., Zhuang, J., Lee, J., Guo, Y., Manassra, W., Dhariwal, P., Chu, C., Jiao, Y., Ramesh, A.: Improving image generation with better captions (2023) +5. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023) +6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18392-18402 (2023) +7. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models. arXiv preprint arXiv:2301.13826 (2023) +8. Chen, W., Hu, H., Li, Y., Rui, N., Jia, X., Chang, M.W., Cohen, W.W.: Subject-driven text-to-image generation via apprenticeship learning. arXiv preprint arXiv:2304.00186 (2023) +9. Chen, X., Lin, M., Scharli, N., Zhou, D.: Teaching large language models to self-debug. arXiv preprint arXiv:2304.05128 (2023) +10. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Dpok: Reinforcement learning for fine-tuning text-to-image diffusion models. arXiv preprint arXiv:2305.16381 (2023) +11. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Reinforcement learning for fine-tuning text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024) +12. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A.R., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis. In: The Eleventh International Conference on Learning Representations (2022) +13. Gatys, L.A., Ecker, A.S., Bethge, M.: A neural algorithm of artistic style. arXiv preprint arXiv:1508.06576 (2015) +14. Google: Bard. https://bard.google.com (2023), accessed: 2023-07-17 +15. Guo, Y., Liang, Y., Wu, C., Wu, W., Zhao, D., Duan, N.: Learning to program with natural language. arXiv preprint arXiv:2304.10464 (2023) + +16. Gupta, T., Kembhavi, A.: Visual programming: Compositional visual reasoning without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14953-14962 (2023) +17. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-or, D.: Prompt-to-prompt image editing with cross-attention control. In: The Eleventh International Conference on Learning Representations (2022) +18. Kawar, B., Zada, S., Lang, O., Tov, O., Chang, H., Dekel, T., Mosseri, I., Irani, M.: Imagic: Text-based real image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6007-6017 (2023) +19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023) +20. Lab, D.: Deepfloyd if. https://github.com/deep-floyd/IF (2023) +21. Lee, K., Liu, H., Ryu, M., Watkins, O., Du, Y., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Gu, S.S.: Aligning text-to-image models using human feedback. arXiv preprint arXiv:2302.12192 (2023) +22. Li, C., Gan, Z., Yang, Z., Yang, J., Li, L., Wang, L., Gao, J.: Multimodal foundation models: From specialists to general-purpose assistants. arXiv preprint arXiv:2309.10020 (2023) +23. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023) +24. Lu, P., Peng, B., Cheng, H., Galley, M., Chang, K.W., Wu, Y.N., Zhu, S.C., Gao, J.: Chameleon: Plug-and-play compositional reasoning with large language models. arXiv preprint arXiv:2304.09842 (2023) +25. Madaan, A., Tandon, N., Gupta, P., Hallinan, S., Gao, L., Wiegreffe, S., Alon, U., Dziri, N., Prabhumoye, S., Yang, Y., et al.: Self-refine: Iterative refinement with self-feedback. arXiv preprint arXiv:2303.17651 (2023) +26. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021) +27. Nasiriany, S., Xia, F., Yu, W., Xiao, T., Liang, J., Dasgupta, I., Xie, A., Driess, D., Wahid, A., Xu, Z., et al.: Pivot: Iterative visual prompting elicits actionable knowledge for vlms. arXiv preprint arXiv:2402.07872 (2024) +28. OpenAI: Dall-e 3 system card. https://cdn.openai.com/papers/DALL_E_3_System/Card.pdf (2023) +29. OpenAI: Gpt-4 technical report (2023) +30. OpenAI: Gpt-4v(ision) system card (2023), https://cdn.openai.com/papers/GPTV_System_Card.pdf +31. OpenAI: Gpt-4v(ision) technical work and authors. https://cdn.openai.com/contributions/gpt-4v.pdf (2023) +32. Pan, L., Saxon, M., Xu, W., Nathani, D., Wang, X., Wang, W.Y.: Automatically correcting large language models: Surveying the landscape of diverse self-correction strategies. arXiv preprint arXiv:2308.03188 (2023) +33. Paranjape, B., Lundberg, S., Singh, S., Hajishirzi, H., Zettlemoyer, L., Ribeiro, M.T.: Art: Automatic multi-step reasoning and tool-use for large language models. arXiv preprint arXiv:2303.09014 (2023) +34. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023) + +35. Pryzant, R., Iter, D., Li, J., Lee, Y.T., Zhu, C., Zeng, M.: Automatic prompt optimization with "gradient descent" and beam search. arXiv preprint arXiv:2305.03495 (2023) +36. Qi, J., Ding, M., Wang, W., Bai, Y., Lv, Q., Hong, W., Xu, B., Hou, L., Li, J., Dong, Y., et al.: Cogcom: Train large vision-language models diving into details through chain of manipulations. arXiv preprint arXiv:2402.04236 (2024) +37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022) +38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022) +39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023) +40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E., Ghasemipour, S.K.S., Ayan, B.K., Mahdavi, S.S., Lopes, R.G., et al.: Photorealistic text-to-image diffusion models with deep language understanding. arXiv preprint arXiv:2205.11487 (2022) +41. Schick, T., Dwivedi-Yu, J., Dessi, R., Raileanu, R., Lomeli, M., Zettlemoyer, L., Cancedda, N., Scialom, T.: Toolformer: Language models can teach themselves to use tools. arXiv preprint arXiv:2302.04761 (2023) +42. Shen, Y., Song, K., Tan, X., Li, D., Lu, W., Zhuang, Y.: Huggingppt: Solving ai tasks with chatgpt and its friends in huggingface. arXiv preprint arXiv:2303.17580 (2023) +43. Shi, J., Xiong, W., Lin, Z., Jung, H.J.: Instantbooth: Personalized text-to-image generation without test-time finetuning. arXiv preprint arXiv:2304.03411 (2023) +44. Shinn, N., Cassano, F., Labash, B., Gopinath, A., Narasimhan, K., Yao, S.: Reflexion: Language agents with verbal reinforcement learning (2023) +45. Shridhar, M., Yuan, X., Côté, M.A., Bisk, Y., Trischler, A., Hausknecht, M.: Alfworld: Aligning text and embodied environments for interactive learning. arXiv preprint arXiv:2010.03768 (2020) +46. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. arXiv preprint arXiv:2209.14792 (2022) +47. Surís, D., Menon, S., Vondrick, C.: Vipergpt: Visual inference via python execution for reasoning. arXiv preprint arXiv:2303.08128 (2023) +48. Wang, J., Yang, Z., Hu, X., Li, L., Lin, K., Gan, Z., Liu, Z., Liu, C., Wang, L.: Git: A generative image-to-text transformer for vision and language. arXiv preprint arXiv:2205.14100 (2022) +49. Wang, Z.J., Montoya, E., Munechika, D., Yang, H., Hoover, B., Chau, D.H.: Diffusiondb: A large-scale prompt gallery dataset for text-to-image generative models. arXiv preprint arXiv:2210.14896 (2022) +50. Wu, C., Yin, S., Qi, W., Wang, X., Tang, Z., Duan, N.: Visual chatgpt: Talking, drawing and editing with visual foundation models. arXiv preprint arXiv:2303.04671 (2023) +51. Wu, J., Wang, J., Yang, Z., Gan, Z., Liu, Z., Yuan, J., Wang, L.: Grit: A generative region-to-text transformer for object understanding. arXiv preprint arXiv:2212.00280 (2022) + +52. Wu, P., Xie, S.: V*: Guided visual search as a core mechanism in multimodal llms. arXiv preprint arXiv:2312.14135 17 (2023) +53. Yan, A., Yang, Z., Zhu, W., Lin, K., Li, L., Wang, J., Yang, J., Zhong, Y., McAuley, J., Gao, J., et al.: Gpt-4v in wonderland: Large multimodal models for zero-shot smartphone gui navigation. arXiv preprint arXiv:2311.07562 (2023) +54. Yang, C., Wang, X., Lu, Y., Liu, H., Le, Q.V., Zhou, D., Chen, X.: Large language models as optimizers. arXiv preprint arXiv:2309.03409 (2023) +55. Yang, Z., Li, L., Lin, K., Wang, J., Lin, C.C., Liu, Z., Wang, L.: The dawn of Imms: Preliminary explorations with gpt-4v (ision). arXiv preprint arXiv:2309.17421 (2023) +56. Yang*, Z., Li*, L., Wang*, J., Lin*, K., Azarnasab*, E., Ahmed*, F., Liu, Z., Liu, C., Zeng, M., Wang, L.: Mm-react: Prompting chatgpt for multimodal reasoning and action. arXiv preprint arXiv:2303.11381 (2023) +57. Yang, Z., Wang, J., Gan, Z., Li, L., Lin, K., Wu, C., Duan, N., Liu, Z., Liu, C., Zeng, M., et al.: Reco: Region-controlled text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14246-14255 (2023) +58. Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W.W., Salakhutdinov, R., Manning, C.D.: Hotpotqa: A dataset for diverse, explainable multi-hop question answering. arXiv preprint arXiv:1809.09600 (2018) +59. Yao, S., Zhao, J., Yu, D., Du, N., Shafran, I., Narasimhan, K., Cao, Y.: React: Synergizing reasoning and acting in language models. arXiv preprint arXiv:2210.03629 (2022) +60. Yin, S., Wu, C., Yang, H., Wang, J., Wang, X., Ni, M., Yang, Z., Li, L., Liu, S., Yang, F., et al.: Nuwa-xl: Diffusion over diffusion for extremely long video generation. arXiv preprint arXiv:2303.12346 (2023) +61. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. Transactions on Machine Learning Research (2022) +62. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023) +63. Zhang, L., Agrawala, M.: Adding conditional control to text-to-image diffusion models. arXiv preprint arXiv:2302.05543 (2023) +64. Zhao, A., Huang, D., Xu, Q., Lin, M., Liu, Y.J., Huang, G.: Expel: Llm agents are experiential learners. arXiv preprint arXiv:2308.10144 (2023) +65. Zhu, W., Wang, X., Lu, Y., Fu, T.J., Wang, X.E., Eckstein, M., Wang, W.Y.: Collaborative generative ai: Integrating gpt-k for efficient editing in text-to-image generation. arXiv preprint arXiv:2305.11317 (2023) \ No newline at end of file diff --git a/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/images.zip b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..30e8f51fa34eecd768f5a082daf7c13a364487ca --- /dev/null +++ b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:597eef6041709df840a30eabd8d750f7ec833b92c8f30156e1f581189548186c +size 785304 diff --git a/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/layout.json b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..5d3f6958ef7469fad4e13c067d6b1892fb28e4ed --- /dev/null +++ b/2024/Idea2Img_ Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation/layout.json @@ -0,0 +1,12670 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "text", + "content": "Idea2Img: Iterative Self-Refinement with GPT-4V for Automatic Image Design and Generation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 167, + 479, + 194 + ], + "type": "text", + "content": "Zhengyuan Yang, Jianfeng Wang, Linjie Li, Kevin Lin, Chung-Ching Lin, Zicheng Liu, and Lijuan Wang" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 132, + 202, + 493, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 202, + 493, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 202, + 493, + 236 + ], + "type": "text", + "content": "Microsoft \n{zhengyang, jianfw, lindsey.li, keli, chungching.lin, zliu, lijuanw}@microsoft.com \nhttps://idea2img.github.io/" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 159, + 261, + 455, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 261, + 455, + 460 + ], + "spans": [ + { + "bbox": [ + 159, + 261, + 455, + 460 + ], + "type": "text", + "content": "Abstract. We introduce \"Idea to Image,\"1 an agent system that enables multimodal iterative self-refinement with GPT-4V(ison) for automatic image design and generation. Humans can quickly identify the characteristics of different text-to-image (T2I) models via iterative explorations. This enables them to efficiently convert their high-level generation ideas into effective T2I prompts that can produce good images. We investigate if systems based on large multimodal models (LMMs) can develop analogous multimodal self-refinement abilities that enable exploring unknown models or environments via self-refining tries. Idea2Img cyclically generates revised T2I prompts to synthesize draft images, and provides directional feedback for prompt revision, both conditioned on its memory of the probed T2I model's characteristics. The iterative self-refinement brings Idea2Img various advantages over vanilla T2I models. Notably, Idea2Img can process input ideas with interleaved image-text sequences, follow ideas with design instructions, and generate images of better semantic and visual qualities. The user preference study validates the efficacy of Idea2Img on automatic image design and generation via multimodal iterative self-refinement." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 469, + 453, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 469, + 453, + 492 + ], + "spans": [ + { + "bbox": [ + 159, + 469, + 453, + 492 + ], + "type": "text", + "content": "Keywords: Multimodal Agents " + }, + { + "bbox": [ + 159, + 469, + 453, + 492 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 469, + 453, + 492 + ], + "type": "text", + "content": " Large Multimodal Models " + }, + { + "bbox": [ + 159, + 469, + 453, + 492 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 469, + 453, + 492 + ], + "type": "text", + "content": " Image Design and Generation" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 510, + 230, + 522 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 230, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 230, + 522 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 534, + 482, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 482, + 643 + ], + "type": "text", + "content": "\"Image design and generation\" aims to create an image from a high-level user idea. This input IDEA can contain interleaved reference images, such as \"the dog looks like the one in the image,\" or with instructional texts specifying the intended design usage, such as \"a logo for the Idea2Img system.\" To convert IDEA into an image, humans may first draft detailed descriptions of the imagined image, and then use text-to-image (T2I) models [34, 37, 38, 40, 61] to generate the image. This manual process for users to search for an ideal detailed description (i.e., T2I prompt) that fits the T2I model typically involves iterative exploration [49, 65]. As shown in Figure 1, humans may first design and draft an" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 652, + 311, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 311, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 311, + 665 + ], + "type": "text", + "content": "1 Short for \"Idea2Img.\" System logo design" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 313, + 651, + 419, + 666 + ], + "type": "footer", + "angle": 0, + "lines": [ + { + "bbox": [ + 313, + 651, + 419, + 666 + ], + "spans": [ + { + "bbox": [ + 313, + 651, + 419, + 666 + ], + "type": "text", + "content": "assisted by Idea2Img." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 479, + 273 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 479, + 273 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 479, + 273 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 479, + 273 + ], + "type": "image", + "image_path": "96ec1432c7adcc603d1e1d5a8afdf74c0202bc636eed433b3523ce5bb9dbbcfa.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 282, + 482, + 371 + ], + "lines": [ + { + "bbox": [ + 130, + 282, + 482, + 371 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 482, + 371 + ], + "type": "text", + "content": "Fig. 1: Idea2Img framework enables LMMs to mimic human-like exploration to use a T2I model, enabling the design and generation of an imagined image specified as a multimodal input IDEA. The iterative process involves LMMs functioning in different roles to refine the image creation. Specifically, LMMs will (1) generate and revise text prompts for the T2I model, (2) select the best draft images, and (3) provide feedback on the errors and revision directions. This multimodal iterative self-refinement process requires LMMs to memorize the T2I model's characteristics observed in previous iterations as humans and adjust T2I prompts accordingly." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 399, + 482, + 508 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 508 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 508 + ], + "type": "text", + "content": "initial T2I prompt based on their imagined IDEA to generate. Then, they can obtain multiple draft images with a T2I model, select the most promising draft, write text feedback, and further revise the T2I prompt. As this iteration progresses, we humans can swiftly grasp the characteristics of a specific T2I model, such as words that the model can not understand, finally producing a good image generated by a suitable T2I prompt. Given the remarkable capabilities of large multimodal models (LMMs) [14, 29, 55], we explore if we can build systems based on LMMs to develop similar iterative self-refinement ability, thereby relieving humans from the tedious process of converting ideas to images." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "Iterative self-refinement is one intrinsic ability humans possess when exploring unknown environments and solving complicated problems. Large language models (LLMs) agent systems [9,25,44] have demonstrated the effectiveness of self-refinement in better addressing natural language processing tasks, such as acronym generation, sentiment retrieval, text-based environment exploration, etc. Transitioning from text-only tasks to multimodal environments poses new challenges of improving, assessing, and verifying multimodal contents, such as multiple interleaved image-text sequences. For example, when learning to use T2I models, LMMs need to improve the generation with revised T2I prompts, assess multiple images in detail to select the best draft, and verify the draft image with the multimodal IDEA to provide text feedback. These steps, each requiring different multimodal understanding capabilities, jointly enable the intriguing multimodal iterative self-refinement ability. Such an LMM framework can au" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 143, + 116, + 159, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 116, + 159, + 123 + ], + "spans": [ + { + "bbox": [ + 143, + 116, + 159, + 123 + ], + "type": "text", + "content": "IDEA" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 181, + 117, + 190, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 117, + 190, + 123 + ], + "spans": [ + { + "bbox": [ + 181, + 117, + 190, + 123 + ], + "type": "text", + "content": "T21" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 211, + 117, + 239, + 124 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 117, + 239, + 124 + ], + "spans": [ + { + "bbox": [ + 211, + 117, + 239, + 124 + ], + "type": "text", + "content": "Idea2Img" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 261, + 117, + 276, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 117, + 276, + 123 + ], + "spans": [ + { + "bbox": [ + 261, + 117, + 276, + 123 + ], + "type": "text", + "content": "IDEA" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 298, + 117, + 308, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 298, + 117, + 308, + 123 + ], + "spans": [ + { + "bbox": [ + 298, + 117, + 308, + 123 + ], + "type": "text", + "content": "T21" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 328, + 117, + 357, + 124 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 328, + 117, + 357, + 124 + ], + "spans": [ + { + "bbox": [ + 328, + 117, + 357, + 124 + ], + "type": "text", + "content": "Idea2Img" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 379, + 116, + 394, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 379, + 116, + 394, + 123 + ], + "spans": [ + { + "bbox": [ + 379, + 116, + 394, + 123 + ], + "type": "text", + "content": "IDEA" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 414, + 117, + 427, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 117, + 427, + 123 + ], + "spans": [ + { + "bbox": [ + 414, + 117, + 427, + 123 + ], + "type": "text", + "content": "T21" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 445, + 117, + 474, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 445, + 117, + 474, + 123 + ], + "spans": [ + { + "bbox": [ + 445, + 117, + 474, + 123 + ], + "type": "text", + "content": "Idea2Img" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 137, + 126, + 176, + 133 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 126, + 176, + 133 + ], + "spans": [ + { + "bbox": [ + 137, + 126, + 176, + 133 + ], + "type": "text", + "content": "Object count" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 135, + 136, + 164, + 169 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 136, + 164, + 169 + ], + "spans": [ + { + "bbox": [ + 135, + 136, + 164, + 169 + ], + "type": "text", + "content": "5 people sitting around a table drinking beer and eating buffalo wings" + } + ] + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 166, + 134, + 205, + 172 + ], + "blocks": [ + { + "bbox": [ + 166, + 134, + 205, + 172 + ], + "lines": [ + { + "bbox": [ + 166, + 134, + 205, + 172 + ], + "spans": [ + { + "bbox": [ + 166, + 134, + 205, + 172 + ], + "type": "image", + "image_path": "5e13ef01c1210e5877d8c3ed8f0028b1e258330f5291f056b59eea75838c15e5.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 206, + 134, + 244, + 172 + ], + "blocks": [ + { + "bbox": [ + 206, + 134, + 244, + 172 + ], + "lines": [ + { + "bbox": [ + 206, + 134, + 244, + 172 + ], + "spans": [ + { + "bbox": [ + 206, + 134, + 244, + 172 + ], + "type": "image", + "image_path": "615e24616c711460af3e8995ea583b55482f9a56df119d25021fae8e16e164a4.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + } + ], + "index": 14 + }, + { + "bbox": [ + 253, + 126, + 288, + 133 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 126, + 288, + 133 + ], + "spans": [ + { + "bbox": [ + 253, + 126, + 288, + 133 + ], + "type": "text", + "content": "Knowledge" + } + ] + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 253, + 134, + 306, + 172 + ], + "blocks": [ + { + "bbox": [ + 253, + 134, + 306, + 172 + ], + "lines": [ + { + "bbox": [ + 253, + 134, + 306, + 172 + ], + "spans": [ + { + "bbox": [ + 253, + 134, + 306, + 172 + ], + "type": "image", + "image_path": "c0907f7224cdf5a003d939cd996df99e0feeb44fb06bc624a28d825f32f260da.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 309, + 134, + 361, + 172 + ], + "blocks": [ + { + "bbox": [ + 309, + 134, + 361, + 172 + ], + "lines": [ + { + "bbox": [ + 309, + 134, + 361, + 172 + ], + "spans": [ + { + "bbox": [ + 309, + 134, + 361, + 172 + ], + "type": "image", + "image_path": "9acc7e2252db2c7931ab584971aea2a49f297c79a44c2ee404ca62224354782e.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + } + ], + "index": 17 + }, + { + "bbox": [ + 371, + 126, + 411, + 133 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 371, + 126, + 411, + 133 + ], + "spans": [ + { + "bbox": [ + 371, + 126, + 411, + 133 + ], + "type": "text", + "content": "Visual design" + } + ] + } + ], + "index": 18 + }, + { + "type": "image", + "bbox": [ + 370, + 134, + 439, + 172 + ], + "blocks": [ + { + "bbox": [ + 370, + 134, + 439, + 172 + ], + "lines": [ + { + "bbox": [ + 370, + 134, + 439, + 172 + ], + "spans": [ + { + "bbox": [ + 370, + 134, + 439, + 172 + ], + "type": "image", + "image_path": "dde28c707e42cb7cdd3f9d560e9e083aee0f0ee5e37ce6ce9079776fa4d43de1.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 442, + 134, + 479, + 172 + ], + "blocks": [ + { + "bbox": [ + 442, + 134, + 479, + 172 + ], + "lines": [ + { + "bbox": [ + 442, + 134, + 479, + 172 + ], + "spans": [ + { + "bbox": [ + 442, + 134, + 479, + 172 + ], + "type": "image", + "image_path": "6d25c985509051fe656024ac42a3a0a55d59c668836fe3f87f28021378b57772.jpg" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_body" + } + ], + "index": 20 + }, + { + "bbox": [ + 137, + 175, + 168, + 181 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 175, + 168, + 181 + ], + "spans": [ + { + "bbox": [ + 137, + 175, + 168, + 181 + ], + "type": "text", + "content": "Scene text" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 135, + 182, + 164, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 182, + 164, + 213 + ], + "spans": [ + { + "bbox": [ + 135, + 182, + 164, + 213 + ], + "type": "text", + "content": "a whole cake on the table with words Azure Research written on the cake" + } + ] + } + ], + "index": 22 + }, + { + "type": "image", + "bbox": [ + 166, + 182, + 205, + 220 + ], + "blocks": [ + { + "bbox": [ + 166, + 182, + 205, + 220 + ], + "lines": [ + { + "bbox": [ + 166, + 182, + 205, + 220 + ], + "spans": [ + { + "bbox": [ + 166, + 182, + 205, + 220 + ], + "type": "image", + "image_path": "a57471431eb286f6d21cb899dbcde2039f4e87c50403d8a0ef23091f2e090cf9.jpg" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_body" + } + ], + "index": 23 + }, + { + "type": "image", + "bbox": [ + 206, + 182, + 244, + 220 + ], + "blocks": [ + { + "bbox": [ + 206, + 182, + 244, + 220 + ], + "lines": [ + { + "bbox": [ + 206, + 182, + 244, + 220 + ], + "spans": [ + { + "bbox": [ + 206, + 182, + 244, + 220 + ], + "type": "image", + "image_path": "3121ab905d3ae8896ce1303d73c0a4e6dcb144fa5695ecef228bfed6dabc5b74.jpg" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_body" + } + ], + "index": 24 + }, + { + "bbox": [ + 253, + 175, + 306, + 181 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 175, + 306, + 181 + ], + "spans": [ + { + "bbox": [ + 253, + 175, + 306, + 181 + ], + "type": "text", + "content": "Prompt following" + } + ] + } + ], + "index": 25 + }, + { + "bbox": [ + 253, + 182, + 283, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 182, + 283, + 213 + ], + "spans": [ + { + "bbox": [ + 253, + 182, + 283, + 213 + ], + "type": "text", + "content": "a plan that has no barriers or obstacles; there is a glass without orange juice next to it" + } + ] + } + ], + "index": 26 + }, + { + "type": "image", + "bbox": [ + 284, + 182, + 361, + 220 + ], + "blocks": [ + { + "bbox": [ + 284, + 182, + 361, + 220 + ], + "lines": [ + { + "bbox": [ + 284, + 182, + 361, + 220 + ], + "spans": [ + { + "bbox": [ + 284, + 182, + 361, + 220 + ], + "type": "image", + "image_path": "ca32aed4598040e85792a99fd8bebe2beb4a793ed6594256da1c6ef5a27463a0.jpg" + } + ] + } + ], + "index": 27, + "angle": 0, + "type": "image_body" + } + ], + "index": 27 + }, + { + "bbox": [ + 372, + 175, + 418, + 181 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 372, + 175, + 418, + 181 + ], + "spans": [ + { + "bbox": [ + 372, + 175, + 418, + 181 + ], + "type": "text", + "content": "Intended usage" + } + ] + } + ], + "index": 28 + }, + { + "bbox": [ + 370, + 182, + 399, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 370, + 182, + 399, + 213 + ], + "spans": [ + { + "bbox": [ + 370, + 182, + 399, + 213 + ], + "type": "text", + "content": "an image of a car perfect for a children's painting competition" + } + ] + } + ], + "index": 29 + }, + { + "type": "image", + "bbox": [ + 400, + 182, + 439, + 220 + ], + "blocks": [ + { + "bbox": [ + 400, + 182, + 439, + 220 + ], + "lines": [ + { + "bbox": [ + 400, + 182, + 439, + 220 + ], + "spans": [ + { + "bbox": [ + 400, + 182, + 439, + 220 + ], + "type": "image", + "image_path": "f8f62c1c5f89dbcc558a7ebde421fecfc6ca47fb478c4996e16966a2045a4743.jpg" + } + ] + } + ], + "index": 30, + "angle": 0, + "type": "image_body" + } + ], + "index": 30 + }, + { + "type": "image", + "bbox": [ + 441, + 182, + 479, + 220 + ], + "blocks": [ + { + "bbox": [ + 441, + 182, + 479, + 220 + ], + "lines": [ + { + "bbox": [ + 441, + 182, + 479, + 220 + ], + "spans": [ + { + "bbox": [ + 441, + 182, + 479, + 220 + ], + "type": "image", + "image_path": "d8682c0070598df6acbc14c405f873d399ee47e84fe44c2d259814709a665e85.jpg" + } + ] + } + ], + "index": 31, + "angle": 0, + "type": "image_body" + } + ], + "index": 31 + }, + { + "bbox": [ + 137, + 224, + 257, + 231 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 224, + 257, + 231 + ], + "spans": [ + { + "bbox": [ + 137, + 224, + 257, + 231 + ], + "type": "text", + "content": "Concept customization & visual pointing" + } + ] + } + ], + "index": 32 + }, + { + "bbox": [ + 136, + 232, + 164, + 268 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 232, + 164, + 268 + ], + "spans": [ + { + "bbox": [ + 136, + 232, + 164, + 268 + ], + "type": "text", + "content": "photo of the obje by the blue arrow brown corgi dog" + } + ] + } + ], + "index": 33 + }, + { + "type": "image", + "bbox": [ + 182, + 232, + 219, + 268 + ], + "blocks": [ + { + "bbox": [ + 182, + 232, + 219, + 268 + ], + "lines": [ + { + "bbox": [ + 182, + 232, + 219, + 268 + ], + "spans": [ + { + "bbox": [ + 182, + 232, + 219, + 268 + ], + "type": "image", + "image_path": "ad23c7881fbedb4c69735105f2bafe0a141a118a7ee8fdca82b697ddf363c4fe.jpg" + } + ] + } + ], + "index": 34, + "angle": 0, + "type": "image_body" + } + ], + "index": 34 + }, + { + "type": "image", + "bbox": [ + 227, + 232, + 265, + 269 + ], + "blocks": [ + { + "bbox": [ + 227, + 232, + 265, + 269 + ], + "lines": [ + { + "bbox": [ + 227, + 232, + 265, + 269 + ], + "spans": [ + { + "bbox": [ + 227, + 232, + 265, + 269 + ], + "type": "image", + "image_path": "7f071f2c9e591e3232ee6379bce623a73e59ea5b1ffb90e07fedf786595e7211.jpg" + } + ] + } + ], + "index": 35, + "angle": 0, + "type": "image_body" + } + ], + "index": 35 + }, + { + "type": "image", + "bbox": [ + 266, + 232, + 306, + 269 + ], + "blocks": [ + { + "bbox": [ + 266, + 232, + 306, + 269 + ], + "lines": [ + { + "bbox": [ + 266, + 232, + 306, + 269 + ], + "spans": [ + { + "bbox": [ + 266, + 232, + 306, + 269 + ], + "type": "image", + "image_path": "68f5fdd755ec40f10316a622495a7fa48c7cb119fe1bb1c44abab67df66a039a.jpg" + } + ] + } + ], + "index": 36, + "angle": 0, + "type": "image_body" + } + ], + "index": 36 + }, + { + "bbox": [ + 309, + 224, + 384, + 231 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 309, + 224, + 384, + 231 + ], + "spans": [ + { + "bbox": [ + 309, + 224, + 384, + 231 + ], + "type": "text", + "content": "Visual attribute referring" + } + ] + } + ], + "index": 37 + }, + { + "type": "image", + "bbox": [ + 310, + 232, + 394, + 269 + ], + "blocks": [ + { + "bbox": [ + 310, + 232, + 394, + 269 + ], + "lines": [ + { + "bbox": [ + 310, + 232, + 394, + 269 + ], + "spans": [ + { + "bbox": [ + 310, + 232, + 394, + 269 + ], + "type": "image", + "image_path": "bb40aa58800fc30699d13f0db48a942fe7af31b39c2770e1b98b7b0c1372dbeb.jpg" + } + ] + } + ], + "index": 38, + "angle": 0, + "type": "image_body" + } + ], + "index": 38 + }, + { + "type": "image", + "bbox": [ + 400, + 232, + 439, + 269 + ], + "blocks": [ + { + "bbox": [ + 400, + 232, + 439, + 269 + ], + "lines": [ + { + "bbox": [ + 400, + 232, + 439, + 269 + ], + "spans": [ + { + "bbox": [ + 400, + 232, + 439, + 269 + ], + "type": "image", + "image_path": "df07e30f24e538768846a0e9ebf4c04837f573d7460847f40f75ce2f6b8f1203.jpg" + } + ] + } + ], + "index": 39, + "angle": 0, + "type": "image_body" + } + ], + "index": 39 + }, + { + "type": "image", + "bbox": [ + 441, + 232, + 479, + 269 + ], + "blocks": [ + { + "bbox": [ + 441, + 232, + 479, + 269 + ], + "lines": [ + { + "bbox": [ + 441, + 232, + 479, + 269 + ], + "spans": [ + { + "bbox": [ + 441, + 232, + 479, + 269 + ], + "type": "image", + "image_path": "66f475d4174a3e443aafbd56ebd14e56e57f54ecaa37b315009e73843f4651cd.jpg" + } + ] + } + ], + "index": 40, + "angle": 0, + "type": "image_body" + } + ], + "index": 40 + }, + { + "bbox": [ + 137, + 272, + 177, + 278 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 272, + 177, + 278 + ], + "spans": [ + { + "bbox": [ + 137, + 272, + 177, + 278 + ], + "type": "text", + "content": "Style transfer" + } + ] + } + ], + "index": 41 + }, + { + "bbox": [ + 136, + 279, + 164, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 279, + 164, + 308 + ], + "spans": [ + { + "bbox": [ + 136, + 279, + 164, + 308 + ], + "type": "text", + "content": "painting of a corgistyle similar to theimage" + } + ] + } + ], + "index": 42 + }, + { + "type": "image", + "bbox": [ + 182, + 280, + 219, + 316 + ], + "blocks": [ + { + "bbox": [ + 182, + 280, + 219, + 316 + ], + "lines": [ + { + "bbox": [ + 182, + 280, + 219, + 316 + ], + "spans": [ + { + "bbox": [ + 182, + 280, + 219, + 316 + ], + "type": "image", + "image_path": "1f21a76ed0a19268c34c3e8d1c0e81d7c09e406cc79aa3d491fa95a5631f02d9.jpg" + } + ] + } + ], + "index": 43, + "angle": 0, + "type": "image_body" + } + ], + "index": 43 + }, + { + "type": "image", + "bbox": [ + 227, + 279, + 265, + 318 + ], + "blocks": [ + { + "bbox": [ + 227, + 279, + 265, + 318 + ], + "lines": [ + { + "bbox": [ + 227, + 279, + 265, + 318 + ], + "spans": [ + { + "bbox": [ + 227, + 279, + 265, + 318 + ], + "type": "image", + "image_path": "3d29a2e40a7bad267e0760e03b89c11e9b3afb7f3debcb82a06bb14ed6eb07e7.jpg" + } + ] + } + ], + "index": 44, + "angle": 0, + "type": "image_body" + } + ], + "index": 44 + }, + { + "type": "image", + "bbox": [ + 266, + 279, + 306, + 318 + ], + "blocks": [ + { + "bbox": [ + 266, + 279, + 306, + 318 + ], + "lines": [ + { + "bbox": [ + 266, + 279, + 306, + 318 + ], + "spans": [ + { + "bbox": [ + 266, + 279, + 306, + 318 + ], + "type": "image", + "image_path": "4d163b486b7dc4d45446e4c3376b21989a60752c708c04eacbff17cf01ad52e9.jpg" + } + ] + } + ], + "index": 45, + "angle": 0, + "type": "image_body" + } + ], + "index": 45 + }, + { + "bbox": [ + 309, + 272, + 379, + 279 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 309, + 272, + 379, + 279 + ], + "spans": [ + { + "bbox": [ + 309, + 272, + 379, + 279 + ], + "type": "text", + "content": "Opposite style transfer" + } + ] + } + ], + "index": 46 + }, + { + "bbox": [ + 310, + 280, + 353, + 306 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 310, + 280, + 353, + 306 + ], + "spans": [ + { + "bbox": [ + 310, + 280, + 353, + 306 + ], + "type": "text", + "content": "painting of a corgi dog with style different from the image" + } + ] + } + ], + "index": 47 + }, + { + "type": "image", + "bbox": [ + 358, + 280, + 393, + 316 + ], + "blocks": [ + { + "bbox": [ + 358, + 280, + 393, + 316 + ], + "lines": [ + { + "bbox": [ + 358, + 280, + 393, + 316 + ], + "spans": [ + { + "bbox": [ + 358, + 280, + 393, + 316 + ], + "type": "image", + "image_path": "a13c249e594bead09c65206026e0661932bd7282930dd559442eab58df435f53.jpg" + } + ] + } + ], + "index": 48, + "angle": 0, + "type": "image_body" + } + ], + "index": 48 + }, + { + "type": "image", + "bbox": [ + 400, + 279, + 439, + 318 + ], + "blocks": [ + { + "bbox": [ + 400, + 279, + 439, + 318 + ], + "lines": [ + { + "bbox": [ + 400, + 279, + 439, + 318 + ], + "spans": [ + { + "bbox": [ + 400, + 279, + 439, + 318 + ], + "type": "image", + "image_path": "fbc46284f4b1621b2859dfd91dde707f94e818255f03cae9729ebc823a4f1f95.jpg" + } + ] + } + ], + "index": 49, + "angle": 0, + "type": "image_body" + } + ], + "index": 49 + }, + { + "type": "image", + "bbox": [ + 441, + 279, + 479, + 318 + ], + "blocks": [ + { + "bbox": [ + 441, + 279, + 479, + 318 + ], + "lines": [ + { + "bbox": [ + 441, + 279, + 479, + 318 + ], + "spans": [ + { + "bbox": [ + 441, + 279, + 479, + 318 + ], + "type": "image", + "image_path": "16e0dfd709fa70f1129d92e8b79e960746513941ebec7a6e0d05c2f02a06b5f3.jpg" + } + ] + } + ], + "index": 50, + "angle": 0, + "type": "image_body" + } + ], + "index": 50 + }, + { + "bbox": [ + 137, + 321, + 197, + 327 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 321, + 197, + 327 + ], + "spans": [ + { + "bbox": [ + 137, + 321, + 197, + 327 + ], + "type": "text", + "content": "Image manipulation" + } + ] + } + ], + "index": 51 + }, + { + "bbox": [ + 136, + 328, + 164, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 328, + 164, + 353 + ], + "spans": [ + { + "bbox": [ + 136, + 328, + 164, + 353 + ], + "type": "text", + "content": "a drawing with the background chain" + } + ] + } + ], + "index": 52 + }, + { + "type": "image", + "bbox": [ + 182, + 328, + 222, + 365 + ], + "blocks": [ + { + "bbox": [ + 182, + 328, + 222, + 365 + ], + "lines": [ + { + "bbox": [ + 182, + 328, + 222, + 365 + ], + "spans": [ + { + "bbox": [ + 182, + 328, + 222, + 365 + ], + "type": "image", + "image_path": "6c443abaf74902e3dd66d77f34e2bd0674c2c13d592ef8cca0b401a359f9e924.jpg" + } + ] + } + ], + "index": 53, + "angle": 0, + "type": "image_body" + } + ], + "index": 53 + }, + { + "type": "image", + "bbox": [ + 227, + 328, + 265, + 365 + ], + "blocks": [ + { + "bbox": [ + 227, + 328, + 265, + 365 + ], + "lines": [ + { + "bbox": [ + 227, + 328, + 265, + 365 + ], + "spans": [ + { + "bbox": [ + 227, + 328, + 265, + 365 + ], + "type": "image", + "image_path": "16557e08d1a037697d57d102e130bea58ae64543f22b0bfc195443ca49048b12.jpg" + } + ] + } + ], + "index": 54, + "angle": 0, + "type": "image_body" + } + ], + "index": 54 + }, + { + "type": "image", + "bbox": [ + 266, + 327, + 306, + 365 + ], + "blocks": [ + { + "bbox": [ + 266, + 327, + 306, + 365 + ], + "lines": [ + { + "bbox": [ + 266, + 327, + 306, + 365 + ], + "spans": [ + { + "bbox": [ + 266, + 327, + 306, + 365 + ], + "type": "image", + "image_path": "2d26672c68ecd8824ad0e0af1d6733ae5e44ffd183483b3c715cf605a630932b.jpg" + } + ] + } + ], + "index": 55, + "angle": 0, + "type": "image_body" + } + ], + "index": 55 + }, + { + "bbox": [ + 309, + 328, + 353, + 358 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 309, + 328, + 353, + 358 + ], + "spans": [ + { + "bbox": [ + 309, + 328, + 353, + 358 + ], + "type": "text", + "content": "A hand drawing of room\nThe people can sleep and study. Hand drawing shows\nthe sketch and looks like the\ngiven image." + } + ] + } + ], + "index": 56 + }, + { + "type": "image", + "bbox": [ + 358, + 328, + 393, + 365 + ], + "blocks": [ + { + "bbox": [ + 358, + 328, + 393, + 365 + ], + "lines": [ + { + "bbox": [ + 358, + 328, + 393, + 365 + ], + "spans": [ + { + "bbox": [ + 358, + 328, + 393, + 365 + ], + "type": "image", + "image_path": "f6d911c64cd008d4a9632319f9c15a7bed8ad06c7fc5c858bf018119fbe77343.jpg" + } + ] + } + ], + "index": 57, + "angle": 0, + "type": "image_body" + } + ], + "index": 57 + }, + { + "type": "image", + "bbox": [ + 400, + 327, + 439, + 365 + ], + "blocks": [ + { + "bbox": [ + 400, + 327, + 439, + 365 + ], + "lines": [ + { + "bbox": [ + 400, + 327, + 439, + 365 + ], + "spans": [ + { + "bbox": [ + 400, + 327, + 439, + 365 + ], + "type": "image", + "image_path": "244fe835042e89c35167f1e84bd503a508c7756383c2f5f991bc6485a1cd0b5d.jpg" + } + ] + } + ], + "index": 58, + "angle": 0, + "type": "image_body" + } + ], + "index": 58 + }, + { + "type": "image", + "bbox": [ + 441, + 328, + 479, + 365 + ], + "blocks": [ + { + "bbox": [ + 441, + 328, + 479, + 365 + ], + "lines": [ + { + "bbox": [ + 441, + 328, + 479, + 365 + ], + "spans": [ + { + "bbox": [ + 441, + 328, + 479, + 365 + ], + "type": "image", + "image_path": "043c8d6813b94323dabfd7b8a17dcdd65361acae9c030a3a38be5a0e0d0d5c81.jpg" + } + ] + } + ], + "index": 59, + "angle": 0, + "type": "image_body" + } + ], + "index": 59 + }, + { + "bbox": [ + 137, + 369, + 240, + 375 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 369, + 240, + 375 + ], + "spans": [ + { + "bbox": [ + 137, + 369, + 240, + 375 + ], + "type": "text", + "content": "In-context entity and style transfer" + } + ] + } + ], + "index": 60 + }, + { + "bbox": [ + 136, + 376, + 182, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 376, + 182, + 415 + ], + "spans": [ + { + "bbox": [ + 136, + 376, + 182, + 415 + ], + "type": "text", + "content": "Find the the image style pattern in the left two dog images and apply it on the to right people in tree pose. Find the text in detail description that keeps the content in the people in tree pose image, with the correct style pattern." + } + ] + } + ], + "index": 61 + }, + { + "type": "image", + "bbox": [ + 182, + 376, + 222, + 414 + ], + "blocks": [ + { + "bbox": [ + 182, + 376, + 222, + 414 + ], + "lines": [ + { + "bbox": [ + 182, + 376, + 222, + 414 + ], + "spans": [ + { + "bbox": [ + 182, + 376, + 222, + 414 + ], + "type": "image", + "image_path": "e904bacfa14eb290c2accdb99b9ebd5c85ef1ae1bd1d5f122701a289ca0a8146.jpg" + } + ] + } + ], + "index": 62, + "angle": 0, + "type": "image_body" + } + ], + "index": 62 + }, + { + "type": "image", + "bbox": [ + 227, + 376, + 265, + 414 + ], + "blocks": [ + { + "bbox": [ + 227, + 376, + 265, + 414 + ], + "lines": [ + { + "bbox": [ + 227, + 376, + 265, + 414 + ], + "spans": [ + { + "bbox": [ + 227, + 376, + 265, + 414 + ], + "type": "image", + "image_path": "5a682e2ce9e2e8e6ba0877a6b9d704a3231f80c878bbf9da1c2f24eecc9eb621.jpg" + } + ] + } + ], + "index": 63, + "angle": 0, + "type": "image_body" + } + ], + "index": 63 + }, + { + "type": "image", + "bbox": [ + 266, + 376, + 306, + 414 + ], + "blocks": [ + { + "bbox": [ + 266, + 376, + 306, + 414 + ], + "lines": [ + { + "bbox": [ + 266, + 376, + 306, + 414 + ], + "spans": [ + { + "bbox": [ + 266, + 376, + 306, + 414 + ], + "type": "image", + "image_path": "08a40902270550b3aa9ab0a1f02248f49a1f8680cb25a2434271d34665850d5f.jpg" + } + ] + } + ], + "index": 64, + "angle": 0, + "type": "image_body" + } + ], + "index": 64 + }, + { + "bbox": [ + 309, + 376, + 342, + 414 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 309, + 376, + 342, + 414 + ], + "spans": [ + { + "bbox": [ + 309, + 376, + 342, + 414 + ], + "type": "text", + "content": "Photo of Bill Gates with the same cloth as in the given image" + } + ] + } + ], + "index": 65 + }, + { + "type": "image", + "bbox": [ + 343, + 376, + 383, + 413 + ], + "blocks": [ + { + "bbox": [ + 343, + 376, + 383, + 413 + ], + "lines": [ + { + "bbox": [ + 343, + 376, + 383, + 413 + ], + "spans": [ + { + "bbox": [ + 343, + 376, + 383, + 413 + ], + "type": "image", + "image_path": "8b4ab19bdc4d774addf2ef12343a28383771084374721cbad500f82203eda336.jpg" + } + ] + } + ], + "index": 66, + "angle": 0, + "type": "image_body" + } + ], + "index": 66 + }, + { + "type": "image", + "bbox": [ + 384, + 376, + 439, + 414 + ], + "blocks": [ + { + "bbox": [ + 384, + 376, + 439, + 414 + ], + "lines": [ + { + "bbox": [ + 384, + 376, + 439, + 414 + ], + "spans": [ + { + "bbox": [ + 384, + 376, + 439, + 414 + ], + "type": "image", + "image_path": "9c31092f8037c4fe15d99649c4b6113cb3bf280ab223da2093cc908df60bcefc.jpg" + } + ] + } + ], + "index": 67, + "angle": 0, + "type": "image_body" + } + ], + "index": 67 + }, + { + "type": "image", + "bbox": [ + 441, + 375, + 479, + 414 + ], + "blocks": [ + { + "bbox": [ + 441, + 375, + 479, + 414 + ], + "lines": [ + { + "bbox": [ + 441, + 375, + 479, + 414 + ], + "spans": [ + { + "bbox": [ + 441, + 375, + 479, + 414 + ], + "type": "image", + "image_path": "485eb795f8a5365e9ff96144305bc63d27a457f13532f9bb878300fa08d1df88.jpg" + } + ] + } + ], + "index": 68, + "angle": 0, + "type": "image_body" + } + ], + "index": 68 + }, + { + "bbox": [ + 137, + 416, + 258, + 423 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 416, + 258, + 423 + ], + "spans": [ + { + "bbox": [ + 137, + 416, + 258, + 423 + ], + "type": "text", + "content": "Visual attribute referring & style transfer" + } + ] + } + ], + "index": 69 + }, + { + "bbox": [ + 136, + 425, + 164, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 425, + 164, + 456 + ], + "spans": [ + { + "bbox": [ + 136, + 425, + 164, + 456 + ], + "type": "text", + "content": "A painting of a tennis game" + } + ] + } + ], + "index": 70 + }, + { + "type": "image", + "bbox": [ + 182, + 425, + 210, + 456 + ], + "blocks": [ + { + "bbox": [ + 182, + 425, + 210, + 456 + ], + "lines": [ + { + "bbox": [ + 182, + 425, + 210, + 456 + ], + "spans": [ + { + "bbox": [ + 182, + 425, + 210, + 456 + ], + "type": "image", + "image_path": "c8b3a7c85f9adf62af751ab8d909f31f715f26e8b7a338a34f573cd02f7e2630.jpg" + } + ] + } + ], + "index": 71, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 484, + 480, + 539 + ], + "lines": [ + { + "bbox": [ + 132, + 484, + 480, + 539 + ], + "spans": [ + { + "bbox": [ + 132, + 484, + 480, + 539 + ], + "type": "text", + "content": "Fig. 2: Overview of the image design and generation scenarios enabled by Idea2Img. In each sub-figure, the image and text in the left green box are the user input IDEA. The center image is the baseline results directly generated by the same T2I model with a human-written T2I prompt, and the image on the right is generated with the T2I prompt discovered by Idea2Img's iterative self-refinement exploration." + } + ] + } + ], + "index": 85, + "angle": 0, + "type": "image_caption" + } + ], + "index": 71 + }, + { + "type": "image", + "bbox": [ + 211, + 425, + 265, + 461 + ], + "blocks": [ + { + "bbox": [ + 211, + 425, + 265, + 461 + ], + "lines": [ + { + "bbox": [ + 211, + 425, + 265, + 461 + ], + "spans": [ + { + "bbox": [ + 211, + 425, + 265, + 461 + ], + "type": "image", + "image_path": "13d44f666f5e9c28160dfc8482c179e93771cd7f82d8b7cbcf69f201a6c642d6.jpg" + } + ] + } + ], + "index": 72, + "angle": 0, + "type": "image_body" + } + ], + "index": 72 + }, + { + "type": "image", + "bbox": [ + 266, + 425, + 306, + 461 + ], + "blocks": [ + { + "bbox": [ + 266, + 425, + 306, + 461 + ], + "lines": [ + { + "bbox": [ + 266, + 425, + 306, + 461 + ], + "spans": [ + { + "bbox": [ + 266, + 425, + 306, + 461 + ], + "type": "image", + "image_path": "8dfe9fab3d5a057fd083b76b392aaffe996a2e7f3aca760bd65e9c8527a46472.jpg" + } + ] + } + ], + "index": 73, + "angle": 0, + "type": "image_body" + } + ], + "index": 73 + }, + { + "bbox": [ + 309, + 425, + 342, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 309, + 425, + 342, + 462 + ], + "spans": [ + { + "bbox": [ + 309, + 425, + 342, + 462 + ], + "type": "text", + "content": "A logo with a design that naturally blends the two given colors as a new logo. The first image is" + } + ] + } + ], + "index": 74 + }, + { + "type": "image", + "bbox": [ + 343, + 425, + 383, + 461 + ], + "blocks": [ + { + "bbox": [ + 343, + 425, + 383, + 461 + ], + "lines": [ + { + "bbox": [ + 343, + 425, + 383, + 461 + ], + "spans": [ + { + "bbox": [ + 343, + 425, + 383, + 461 + ], + "type": "image", + "image_path": "b004832f502ca769d25897eadca35c6022c80365f44a6276231b3a45b866ec2f.jpg" + } + ] + } + ], + "index": 75, + "angle": 0, + "type": "image_body" + } + ], + "index": 75 + }, + { + "type": "image", + "bbox": [ + 384, + 425, + 399, + 461 + ], + "blocks": [ + { + "bbox": [ + 384, + 425, + 399, + 461 + ], + "lines": [ + { + "bbox": [ + 384, + 425, + 399, + 461 + ], + "spans": [ + { + "bbox": [ + 384, + 425, + 399, + 461 + ], + "type": "image", + "image_path": "be6185a0bd954b001d0c04ba16f8430ca08379f002b3f52f14a7b105f6b05bd7.jpg" + } + ] + } + ], + "index": 76, + "angle": 0, + "type": "image_body" + } + ], + "index": 76 + }, + { + "type": "image", + "bbox": [ + 408, + 429, + 432, + 458 + ], + "blocks": [ + { + "bbox": [ + 408, + 429, + 432, + 458 + ], + "lines": [ + { + "bbox": [ + 408, + 429, + 432, + 458 + ], + "spans": [ + { + "bbox": [ + 408, + 429, + 432, + 458 + ], + "type": "image", + "image_path": "fe1d10b4d08b3c8639c8362045b14a6e6b531158e36ce4a110384d001da28f5c.jpg" + } + ] + } + ], + "index": 77, + "angle": 0, + "type": "image_body" + } + ], + "index": 77 + }, + { + "type": "image", + "bbox": [ + 448, + 429, + 471, + 458 + ], + "blocks": [ + { + "bbox": [ + 448, + 429, + 471, + 458 + ], + "lines": [ + { + "bbox": [ + 448, + 429, + 471, + 458 + ], + "spans": [ + { + "bbox": [ + 448, + 429, + 471, + 458 + ], + "type": "image", + "image_path": "aadac95d1d882a8c210a27e6ea05af46ee54ecfb18c7b1759536193391f72812.jpg" + } + ] + } + ], + "index": 78, + "angle": 0, + "type": "image_body" + } + ], + "index": 78 + }, + { + "bbox": [ + 173, + 464, + 188, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 464, + 188, + 471 + ], + "spans": [ + { + "bbox": [ + 173, + 464, + 188, + 471 + ], + "type": "text", + "content": "IDEA" + } + ] + } + ], + "index": 79 + }, + { + "bbox": [ + 240, + 464, + 250, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 240, + 464, + 250, + 471 + ], + "spans": [ + { + "bbox": [ + 240, + 464, + 250, + 471 + ], + "type": "text", + "content": "T21" + } + ] + } + ], + "index": 80 + }, + { + "bbox": [ + 271, + 464, + 301, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 271, + 464, + 301, + 472 + ], + "spans": [ + { + "bbox": [ + 271, + 464, + 301, + 472 + ], + "type": "text", + "content": "Idea2Img" + } + ] + } + ], + "index": 81 + }, + { + "bbox": [ + 347, + 464, + 362, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 347, + 464, + 362, + 471 + ], + "spans": [ + { + "bbox": [ + 347, + 464, + 362, + 471 + ], + "type": "text", + "content": "IDEA" + } + ] + } + ], + "index": 82 + }, + { + "bbox": [ + 414, + 464, + 424, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 464, + 424, + 471 + ], + "spans": [ + { + "bbox": [ + 414, + 464, + 424, + 471 + ], + "type": "text", + "content": "T21" + } + ] + } + ], + "index": 83 + }, + { + "bbox": [ + 445, + 464, + 474, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 445, + 464, + 474, + 472 + ], + "spans": [ + { + "bbox": [ + 445, + 464, + 474, + 472 + ], + "type": "text", + "content": "Idea2Img" + } + ] + } + ], + "index": 84 + }, + { + "bbox": [ + 130, + 567, + 480, + 627 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 567, + 480, + 627 + ], + "spans": [ + { + "bbox": [ + 130, + 567, + 480, + 627 + ], + "type": "text", + "content": "tomatically learn to tackle various real-world problems [55] via self-exploration, such as navigating GUI to use electronic devices, exploring unknown physical environments via an embodied agent, engaging in electronic games, and so on. In this study, we focus on \"image design and generation\" as the task to study the multimodal iterative self-refinement ability." + } + ] + } + ], + "index": 86 + }, + { + "bbox": [ + 130, + 629, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 480, + 666 + ], + "type": "text", + "content": "To this end, we introduce Idea2Img, a multimodal iterative self-refinement framework for automatic image design and generation. As illustrated in Figure 1, Idea2Img involves an LMM, GPT-4V(ison) [1, 29-31], interacting with a" + } + ] + } + ], + "index": 87 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": "T2I model to probe its usage and find an effective T2I prompt. The LMM will act in different roles to analyze the return signal from the T2I model (i.e., draft images) and design the next round's queries (i.e., text T2I prompts). The three roles of generating T2I prompts, selecting draft images, and reflecting feedback together enable the multimodal iterative self-refinement ability. Specifically, (1) Prompt generation: GPT-4V generates " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " text prompts that correspond to the input multimodal user IDEA, conditioned on the previous text feedback and refinement history; (2) Draft image selection: GPT-4V carefully compares " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " draft images for the same IDEA and select the most promising one; (3) Feedback reflection: GPT-4V examines the discrepancy between the draft image and the IDEA. GPT-4V then provides feedback on what is incorrect, the plausible causes, and how T2I prompts may be revised to obtain a better image. Furthermore, Idea2Img is enhanced with a memory module that stores all prompt exploration histories, including previous draft images, text prompts, and feedback. The Idea2Img framework iterates among these three steps with GPT-4V for automatic image design and generation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 309, + 482, + 476 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 309, + 482, + 476 + ], + "spans": [ + { + "bbox": [ + 130, + 309, + 482, + 476 + ], + "type": "text", + "content": "To users, Idea2Img functions as an enhanced image design and generation assistant. Compared with T2I models, Idea2Img can handle design instructions instead of requiring detailed image description, support the multimodal IDEA input, and generate images of better semantic and visual qualities. We overview representative image design and generation scenarios in Figure 2. For example, Idea2Img can incorporate the visual design and intended usage description in IDEA, extract arbitrary visual information from the input image, and process IDEA with arbitrarily interleaved image-text sequences. Built upon these new functionalities and scenarios of interest, we develop an evaluation IDEA set with 104 samples, containing complicated queries that humans may fail in their first trials. We perform user preference studies on Idea2Img with different T2I models. The consistent user preference score improvements on different image generation models, e.g., " + }, + { + "bbox": [ + 130, + 309, + 482, + 476 + ], + "type": "inline_equation", + "content": "+26.9\\%" + }, + { + "bbox": [ + 130, + 309, + 482, + 476 + ], + "type": "text", + "content": " with SDXL [34], indicate the effectiveness of Idea2Img in image design and generation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 479, + 347, + 490 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 479, + 347, + 490 + ], + "spans": [ + { + "bbox": [ + 146, + 479, + 347, + 490 + ], + "type": "text", + "content": "Our contributions are summarized as follows." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 505, + 480, + 662 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 138, + 505, + 480, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 505, + 480, + 538 + ], + "spans": [ + { + "bbox": [ + 138, + 505, + 480, + 538 + ], + "type": "text", + "content": "- We study \"automatic image design and generation,\" which aims to create an image from an input IDEA. This new multimodal IDEA input enables visual creation with reference image inputs and instructions on desired designs." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 137, + 542, + 480, + 576 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 542, + 480, + 576 + ], + "spans": [ + { + "bbox": [ + 137, + 542, + 480, + 576 + ], + "type": "text", + "content": "- We explore the multimodal iterative self-refinement ability in GPT-4V-based agent systems, showcasing its effectiveness in improving, assessing, and verifying multimodal contents." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 137, + 580, + 479, + 613 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 580, + 479, + 613 + ], + "spans": [ + { + "bbox": [ + 137, + 580, + 479, + 613 + ], + "type": "text", + "content": "- We propose Idea2Img, a multimodal iterative self-refinement framework that enhances any image generation model for visual design, enabling various new image creation functionalities, and achieving better generation qualities." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 137, + 618, + 480, + 662 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 618, + 480, + 662 + ], + "spans": [ + { + "bbox": [ + 137, + 618, + 480, + 662 + ], + "type": "text", + "content": "- We present an evaluation set with 104 challenging multimodal IDEA. The consistent user preference score improvements, when experimented on different image generation models, indicate Idea2Img's effectiveness in automatic image design and generation." + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 237, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 237, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 237, + 127 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 165, + 482, + 310 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 165, + 482, + 310 + ], + "spans": [ + { + "bbox": [ + 130, + 165, + 482, + 310 + ], + "type": "text", + "content": "LLM-based self-refinement. Idea2Img is inspired by the effectiveness of iterative self-refinement in LLM-based agent systems [25,32,44] in exploring unknown environments and tasks, built upon the successful LLM agents [15,33,35,41,54, 59,64]. Self-refine [25] takes the same LLM to iteratively critique its outputs and leverage this feedback to enhance its predictions, showing effectiveness across various NLP tasks. Reflexion [44] explores a self-reflective LLM system on the text-based environment exploration task [45] and multi-hop QA [58]. Despite the success, LLM-based self-refinement naturally can not understand multimodal inputs. Consequently, the explored tasks and environments are limited to the natural language description, such as AlfWorld [45]. Idea2Img explores the potential of an LMM-based iterative self-refinement system for multimodal environment exploration, from a simple T2I model to other more complicated environments." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 313, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 313, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 313, + 482, + 495 + ], + "type": "text", + "content": "Multimodal agents. Our Idea2Img is related to multimodal agents [16, 22, 24, 42, 47, 50, 56, 62] that chain external tools such as T2I or vision-language models with LLMs for multimodal tasks. For instance, MM-ReAct [56] integrates ChatGPT with multiple vision tools for multimodal reasoning and action, enabling it to solve various complicated visual understanding tasks. Visual ChatGPT [50] empowers ChatGPT to allocate various image generation models, such as Stable Diffusion [38], img2img model [26], ControlNet [63], enabling multi-step visual editing and generation. The primary difference between Idea2Img and existing multimodal agent studies [50, 56] lies in the approach to understand the tool usage. Existing studies assume the knowledge of how to best use each tool and provide such information to LLMs via text instructions or in-context examples. In contrast, the optimal usage of the tool remains unknown in Idea2Img and requires iterative exploration. Another minor distinction is that Idea2Img utilizes LMMs instead of LLMs, thereby does not require general visual understanding tools such as a caption model [48, 51]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "Extensions of base T2I models. Idea2Img provides a more natural way for users to design and produce their desired visual content. This framework, which extends T2I models for new functionalities, is related to various works in improving base T2I models [34, 37, 38, 40, 61]. These studies include extending the base T2I model to better follow user prompts [5, 7, 10, 12], finding magic words in T2I prompts for better visual quality [49, 65], supporting extra image input for image manipulation [6, 17, 18, 26], style transfer [13], visual concept customization [2, 8, 19, 39, 43], and so on. While specialized T2I extensions can address a single specific functionality, Idea2Img offers a more unified and widely applicable framework. That is, a single Idea2Img framework can handle various generation scenarios, ranging from style transfer to attribute customization, without requiring separate models or task-specific model design and finetune. More importantly, Idea2Img effectively collaborates with those enhanced generative models, consistently improving them by exploring suitable text prompts." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 90, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 90, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 90, + 447, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 118, + 479, + 268 + ], + "blocks": [ + { + "bbox": [ + 135, + 118, + 479, + 268 + ], + "lines": [ + { + "bbox": [ + 135, + 118, + 479, + 268 + ], + "spans": [ + { + "bbox": [ + 135, + 118, + 479, + 268 + ], + "type": "image", + "image_path": "f77c1b2c1de8419a4a8c23b24d62bc3301ce94f04f992d98fda7e76db2c72724.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 277, + 482, + 312 + ], + "lines": [ + { + "bbox": [ + 130, + 277, + 482, + 312 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 482, + 312 + ], + "type": "text", + "content": "Fig. 3: The framework overview of Idea2Img, which takes an LMM [29,30] to explore a T2I model via multimodal iterative self-refinement, leading to an effective T2I prompt for the input user IDEA. The rounded rectangle shape indicates a GPT-4V call." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 334, + 281, + 348 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 334, + 281, + 348 + ], + "spans": [ + { + "bbox": [ + 132, + 334, + 281, + 348 + ], + "type": "text", + "content": "3 Idea2Img Framework" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "spans": [ + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": "Figure 3 illustrates the Idea2Img framework. Idea2Img framework involves two core pre-trained models, i.e., the GPT-4V(ison) as the LMM " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": " and a text-conditioned image generation model" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "^2" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": " to explore " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": ". Idea2Img also contains a memory " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": " that stores insights on " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": " discovered by " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": " during previous iterations. Execution flow. We begin with an overview of the key steps in " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": " iteratively exploring the use of " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": ". Starting from the top-left of Figure 3, \"initial prompt generation\" converts the input multimodal user IDEA into T2I text prompts, later producing multiple draft images with T2I model " + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 360, + 482, + 539 + ], + "type": "text", + "content": ". \"Draft image selection\" then selects the best draft image among them for the current iteration. The selected image is either output as the final prediction or continues for further refinement, depending on the stop condition. For the latter, \"feedback reflection\" compares the current best draft image with the multimodal IDEA, and summarizes the major discrepancy as text feedback. With the iteration history and text feedback, \"revised prompt generation\" then drafts revised T2I prompts and continues the iterative self-refinement with the new set of draft images." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "inline_equation", + "content": "\\Theta" + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "text", + "content": " Initial prompt generation. This step generates " + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "text", + "content": " initial T2I prompts " + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "inline_equation", + "content": "\\{y_0^0,\\dots ,y_0^{N - 1}\\}" + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "text", + "content": " following the input user IDEA " + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "text", + "content": ", by prompting " + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "text", + "content": " with LMM prompt " + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "inline_equation", + "content": "p_{gen}" + }, + { + "bbox": [ + 132, + 540, + 482, + 579 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 241, + 578, + 481, + 594 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 578, + 481, + 594 + ], + "spans": [ + { + "bbox": [ + 241, + 578, + 481, + 594 + ], + "type": "interline_equation", + "content": "\\left\\{y _ {0} ^ {0}, \\dots , y _ {0} ^ {N - 1} \\right\\} = \\mathcal {M} (x, p _ {\\text {g e n}}) \\tag {1}", + "image_path": "70e9ceffdc41e6adb3cfb2c1d1fdacff22aaad56b3e5aa839af6a858b0d3ce5d.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "text", + "content": "The \"initial prompt generation\" requires " + }, + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "text", + "content": " to understand multimodal user IDEA " + }, + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "text", + "content": " and convert design IDEA into descriptive T2I prompts. LMM prompt " + }, + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "inline_equation", + "content": "p_{gen}" + }, + { + "bbox": [ + 130, + 597, + 482, + 635 + ], + "type": "text", + "content": " is a zero-shot prompt without in-context examples." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 481, + 666 + ], + "type": "text", + "content": "2 We will show image generation models other than T2I later in experiments. For clarity, we use T2I as a representative generation model to introduce Idea2Img." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "With the \"initial prompt generation\" step, Idea2Img can understand user IDEA with interleaved image-text sequences, instead of the text-only T2I prompts containing the image description. Specifically, (1) IDEA can be a high-level design or usage instead of the detailed image description, such as \"a car image for a children's painting competition\"; and (2) IDEA can take multiple images and use interleaved text instruction to extract arbitrary visual information of interest, including image style, visual entity, object attributes, etc. Then, in iteration " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "t = 0" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": " as well as future iterations " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "t = t" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": ", each T2I prompt " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "y_{t}^{n}" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": " is separately sent to the T2I model " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": ", resulting in " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": " draft images " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "i_{t}^{n} = \\mathcal{G}(y_{t}^{n})" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "n = 0, \\dots, N - 1" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "spans": [ + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "inline_equation", + "content": "\\boxed{2}" + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "text", + "content": " Draft image selection. With the " + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "text", + "content": " draft images in iteration " + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "text", + "content": ", \"draft image selection\" selects the best draft image " + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "inline_equation", + "content": "i_t^*" + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "text", + "content": " by prompting " + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "text", + "content": " with LMM prompt " + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "inline_equation", + "content": "p_{select}" + }, + { + "bbox": [ + 130, + 225, + 482, + 262 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 239, + 262, + 480, + 275 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 262, + 480, + 275 + ], + "spans": [ + { + "bbox": [ + 239, + 262, + 480, + 275 + ], + "type": "interline_equation", + "content": "i _ {t} ^ {*} = \\mathcal {M} \\left(i _ {t} ^ {0}, \\dots , i _ {t} ^ {N - 1}, x, p _ {\\text {s e l e c t}}\\right). \\tag {2}", + "image_path": "2524766066614984147782c4bd9928f8586471b1b036d9bdc5c996d25b810a16.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 281, + 482, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 281, + 482, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 281, + 482, + 327 + ], + "type": "text", + "content": "The design of a \"draft image selection\" step is motivated by the observation that T2I models could generate bad images with good prompts. This step is designed to filter out low-quality images, and avoid the quality perturbation to dominate the iterative refinement." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 329, + 482, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 482, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 482, + 376 + ], + "type": "text", + "content": "The task of selecting the best image requires " + }, + { + "bbox": [ + 130, + 329, + 482, + 376 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 329, + 482, + 376 + ], + "type": "text", + "content": " to compare and grade both the semantics and visual quality of " + }, + { + "bbox": [ + 130, + 329, + 482, + 376 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 329, + 482, + 376 + ], + "type": "text", + "content": " similar draft images. We find such a \"spot the difference\" task challenging for LMMs, and only the very recent models [29, 55] are capable of performing the selection reliably." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "text", + "content": "③ Feedback reflection. After obtaining the selected image " + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "inline_equation", + "content": "i_{t}^{*}" + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "text", + "content": ", the framework checks the stop condition, such as if the current iteration " + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "text", + "content": " exceeds the maximum " + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "text", + "content": ". Idea2Img then outputs " + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "inline_equation", + "content": "i_{t}^{*}" + }, + { + "bbox": [ + 130, + 378, + 482, + 426 + ], + "type": "text", + "content": " as the output image or proceeds the refinement process to the \"feedback reflection\" step accordingly." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "content": "\"Feedback reflection\" aims to provide text feedback " + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "inline_equation", + "content": "f_{t}" + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "content": " that describes the direction to improve for draft image " + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "inline_equation", + "content": "i_{t}^{*}" + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "content": ". The steps prompts " + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "content": " with LMM prompt " + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "inline_equation", + "content": "p_{fb}" + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "content": ", conditioned on the draft image " + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "inline_equation", + "content": "i_{t}^{*}" + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "content": " and memory " + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 427, + 482, + 464 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 260, + 474, + 480, + 487 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 260, + 474, + 480, + 487 + ], + "spans": [ + { + "bbox": [ + 260, + 474, + 480, + 487 + ], + "type": "interline_equation", + "content": "f _ {t} = \\mathcal {M} \\left(i _ {t} ^ {*}, m, x, p _ {f b}\\right). \\tag {3}", + "image_path": "8cdd624a41aa7541722a1dfd94bdd1fd8ea7597b6d3d2a490289c32cfc075433.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "spans": [ + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": "\"Feedback reflection\" takes " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": " to compare an image " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "i_t^*" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": " with the multimodal user " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "IDEAx" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": ", and summarize the gap as text feedback " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "f_{t}" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": ". The step not only requires " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": " to identify the discrepancy between image " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "i_t^*" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "IDEAx" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": ", but also benefits from writing the major errors to make the iteration effective. In practice, we find it helpful to explicitly specify the aspects to check, such as style, entity, attributes, appearance, etc., via text instructions or in-context examples in LMM prompt " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "p_{fb}" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": ". Furthermore, we add text instructions to " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "p_{fb}" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": " to have " + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 495, + 482, + 603 + ], + "type": "text", + "content": " \"focus on one thing to improve in each feedback,\" and \"provide a high-level explanation of how to modify prompts to address the given feedback.\"" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "inline_equation", + "content": "\\boxed{4} / \\boxed{1}" + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "content": " Revised prompt generation. Finally, \"prompt generation\" takes text feedback " + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "inline_equation", + "content": "f_{t}" + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "content": " and memory " + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "content": " to draft " + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "content": " revised prompt " + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "inline_equation", + "content": "\\{y_{t+1}^{0}, \\ldots, y_{t+1}^{N-1}\\}" + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "content": ", by prompting " + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "content": " with LMM prompt " + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "inline_equation", + "content": "p_{\\text{revise}}" + }, + { + "bbox": [ + 130, + 604, + 482, + 643 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 220, + 652, + 480, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 652, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 220, + 652, + 480, + 666 + ], + "type": "interline_equation", + "content": "\\left\\{y _ {t + 1} ^ {0}, \\dots , y _ {t + 1} ^ {N - 1} \\right\\} = \\mathcal {M} \\left(f _ {t}, m, x, p _ {\\text {r e v i s e}}\\right). \\tag {4}", + "image_path": "03e5430852b59af6761ea829eef35268b7fa44807508d705e50f26657c5a7047.jpg" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 90, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 90, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 90, + 448, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": "Generating revised prompts requires " + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": " to understand the property of " + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": " stored in memory " + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": ", thereby drafting new T2I prompts that could most likely address the issue identified in " + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "inline_equation", + "content": "f_{t}" + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": ". We empirically demonstrate that Idea2Img can generate better prompts for " + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": " via iterative self-refinement." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 482, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 482, + 201 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 482, + 201 + ], + "type": "text", + "content": "Memory module. Memory " + }, + { + "bbox": [ + 130, + 164, + 482, + 201 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 164, + 482, + 201 + ], + "type": "text", + "content": " is one important design in Idea2Img. " + }, + { + "bbox": [ + 130, + 164, + 482, + 201 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 164, + 482, + 201 + ], + "type": "text", + "content": " has the format of interleaved image-text sequences that store all previous iterations' feedback, selected draft image, and the corresponding text prompts:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 227, + 209, + 481, + 223 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 209, + 481, + 223 + ], + "spans": [ + { + "bbox": [ + 227, + 209, + 481, + 223 + ], + "type": "interline_equation", + "content": "m _ {t} = \\left[ y _ {0} ^ {*}, i _ {0} ^ {*}, f _ {0}, \\dots , y _ {t - 1} ^ {*}, i _ {t - 1} ^ {*}, f _ {t - 1} \\right]. \\tag {5}", + "image_path": "3669d9b12e74a85bb81db5166cca3592b55e451c0791cd2d1bb3819f2b898bc2.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": "It allows LMM " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": " to understand the properties and capabilities of the T2I model " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": " in use, such as a keyword that " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": " may not understand or a complicated scene that " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": " fail to generate, and incorporate such knowledge in generating the revised T2I prompts " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": ". For example, it may describe the appearance of a yoga pose in detail, instead of only mentioning its name in " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": ". Examples are shown in Appendix Figures A-D, when comparing initial and refined prompts " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "y_0" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "inline_equation", + "content": "y_T" + }, + { + "bbox": [ + 130, + 230, + 482, + 304 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 319, + 230, + 334 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 319, + 230, + 334 + ], + "spans": [ + { + "bbox": [ + 131, + 319, + 230, + 334 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 344, + 264, + 357 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 344, + 264, + 357 + ], + "spans": [ + { + "bbox": [ + 131, + 344, + 264, + 357 + ], + "type": "text", + "content": "4.1 Experiment Settings" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 364, + 482, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 482, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 482, + 389 + ], + "type": "text", + "content": "Compared model variants. We mainly compare the following three models in image generation." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 137, + 395, + 480, + 524 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 137, + 395, + 480, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 395, + 480, + 429 + ], + "spans": [ + { + "bbox": [ + 137, + 395, + 480, + 429 + ], + "type": "text", + "content": "- \"Initial-round manual prompt\" is the baseline T2I prompt written by humans with minor prompt engineering. It serves as the baseline of a T2I prompt that merely contains key information in IDEA." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 137, + 431, + 480, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 431, + 480, + 499 + ], + "spans": [ + { + "bbox": [ + 137, + 431, + 480, + 499 + ], + "type": "text", + "content": "- \"Initial-round Idea2Img prompt\" is the LMM-generated T2I prompt in the initial round. Specifically, the max iteration " + }, + { + "bbox": [ + 137, + 431, + 480, + 499 + ], + "type": "inline_equation", + "content": "T = 1" + }, + { + "bbox": [ + 137, + 431, + 480, + 499 + ], + "type": "text", + "content": ", and LMM " + }, + { + "bbox": [ + 137, + 431, + 480, + 499 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 137, + 431, + 480, + 499 + ], + "type": "text", + "content": " is only used for initial prompt generation and draft image selection, but not feedback reflection nor revised prompt generation. This Idea2Img variant is used to ablate Idea2Img's gain from prompt generation and selection, vs. the further iterative refinement." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 137, + 502, + 479, + 524 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 502, + 479, + 524 + ], + "spans": [ + { + "bbox": [ + 137, + 502, + 479, + 524 + ], + "type": "text", + "content": "- \"Iterative self-refined Idea2Img prompt\" is complete Idea2Img pipeline with the max iteration " + }, + { + "bbox": [ + 137, + 502, + 479, + 524 + ], + "type": "inline_equation", + "content": "T = 3" + }, + { + "bbox": [ + 137, + 502, + 479, + 524 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 617 + ], + "type": "text", + "content": "Evaluation samples and metrics. For the quantitative evaluation, we collect a dataset of 104 user IDEA as input queries. Among them, 33 queries contain text only, 43 queries contain an image-text sequence with a single image, and the remaining 28 contains a sequence with two or more images. The text in most IDEA contains not only descriptive content text that describes the scene to generate, but also instructional text such as \"a logo for commercial advertising\" or \"generate the pointed dog in blue.\" All test queries are manually composed." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "We then perform the user preference study as the main quantitative metric. Users are presented with the IDEA and multiple images to select the best one for each IDEA. The evaluation script automatically shuffles the order during evaluation to prevent the influence of image orders." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 141, + 178, + 470, + 271 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: User preference scores when applying Idea2Img onto different image generation models (compare the three scores in the middle section within each row individually). We observe that \"Iterative self-refined Idea2Img prompt\" is consistently favored across all experimented image generation models. " + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "inline_equation", + "content": "\\varDelta_{\\mathrm{iteration}}" + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": " reports the preference gain from the iterative Idea2Img over the initial-round Idea2Img." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 141, + 178, + 470, + 271 + ], + "lines": [ + { + "bbox": [ + 141, + 178, + 470, + 271 + ], + "spans": [ + { + "bbox": [ + 141, + 178, + 470, + 271 + ], + "type": "table", + "html": "
User preference score (%)Initial-round manual promptInitial-round Idea2Img promptIterative self-refined Idea2Img promptΔiteration
SDXL v1.013.529.856.7+26.9
DeepFloyd IF14.434.651.0+16.3
SD v2.113.540.446.2+5.8
SD v1.58.643.348.1+4.8
SDXL-img2img8.634.656.7+16.3
IF-img2img8.638.552.9+14.4
", + "image_path": "b827b6c2cf0e26ab34abd13c15022bec22754713ab1b551ccdf614557e23fce6.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 202, + 281, + 411, + 395 + ], + "blocks": [ + { + "bbox": [ + 202, + 281, + 411, + 395 + ], + "lines": [ + { + "bbox": [ + 202, + 281, + 411, + 395 + ], + "spans": [ + { + "bbox": [ + 202, + 281, + 411, + 395 + ], + "type": "image", + "image_path": "61af0acc3da68a8818044962d683f9fc14f60170ae2426ea12876ef7182a9606.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 403, + 482, + 437 + ], + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 437 + ], + "type": "text", + "content": "Fig. 4: User preference scores among T2I models before and after iterative self-refinement. We observe that the initially favored T2I model, SDXL, benefits more from the Idea2Img iteration." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "text", + "content": "Experimented T2I models. We experiment Idea2Img on a wide variety of T2I model " + }, + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "text", + "content": " with diverse model capacities and functionalities. Specifically, we study Stable Diffusion (SD) v1.5 [38], SD v2.1, SDXL v1.0 with refiner [34], and DeepFloyd IF (IF-I-XL and IF-II-L) [20]. Other than T2I models, we also consider the img2img pipeline (i.e., SDEdit [26]) for SDXL and DeepFloyd IF, as a demonstration of using Idea2Img for the text-conditioned image-to-image generation. The default strength " + }, + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "inline_equation", + "content": "t_0" + }, + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "text", + "content": " in the img2img pipeline is 1.00. SDXL-img2img and IF-img2img are the same as SDXL and IF (i.e., T2I) when IDEA contains text only, and condition on the first image with IDEA contains multiple images. LMM prompts " + }, + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "inline_equation", + "content": "p_{gen}, p_{select}, p_{fb}, p_{revise}" + }, + { + "bbox": [ + 130, + 460, + 482, + 594 + ], + "type": "text", + "content": " are kept the same for all experimented T2I models. Appendix Section B shows the complete LMM prompts." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 609, + 293, + 621 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 609, + 293, + 621 + ], + "spans": [ + { + "bbox": [ + 131, + 609, + 293, + 621 + ], + "type": "text", + "content": "4.2 Image Generation Results" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "User preference evaluation. Table 1 compares the user preference when selecting from the three images generated by \"initial-round manual prompt,\" \"initial-round Idea2Img prompt,\" and \"iterative self-refined Idea2Img prompt.\"" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "for each user IDEA with the same T2I model. Among T2I models with different model sizes and functionalities, Idea2Img leads to consistent improvements in user preference. The initial-round Idea2Img prompt already improves the initial-round manual prompt, by effectively understanding the multimodal user IDEA and selecting the best draft images. The full Idea2Img framework further improves from the initial-round Idea2Img results with the multimodal iterative self-refinement. For example, when using SDXL v1.0, users prefer the images generated by Idea2Img " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "59/104 = 56.7\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " times, compared with the baseline of " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "14/104 = 13.5\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". Similar improvements are observed on all experimented T2I models, as shown in the bolded column \"iterative self-refined Idea2Img prompt.\"" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "spans": [ + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": "Furthermore, we examine which T2I model benefits the most from the LMM iterative self-refinement. By comparing the " + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "inline_equation", + "content": "\\Delta_{\\mathrm{iteration}}" + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": " in Table 1 that represents the difference between first-round and iterative Idea2Img user preference, we observe that stronger T2I models tend to benefit more from LMM refinements. For example, SDXL and IF become more favored " + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "inline_equation", + "content": "26.9\\%" + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "inline_equation", + "content": "16.3\\%" + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": " times after iteration, compared with the " + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "inline_equation", + "content": "5.8\\%" + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "inline_equation", + "content": "4.8\\%" + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": " for SD v2.1 and SD v1.5. The trend that stronger T2I models benefit more from Idea2Img is also observed in Figure 4's analysis, where users pick their preferred image generated by different T2I models. After Idea2Img's iterative refinement, the initially favored model SDXL benefits more from the iteration, resulting in an even higher user preference rate, from " + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "inline_equation", + "content": "46.2\\%" + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "inline_equation", + "content": "65.4\\%" + }, + { + "bbox": [ + 130, + 239, + 482, + 431 + ], + "type": "text", + "content": ". We conjecture that the better language understanding ability in stronger T2I models enables them to better follow revised T2I prompts. They also have a better image generation capability that makes it possible to generate challenging scenes, when given a good T2I prompt optimized by Idea2Img. Nonetheless, Idea2Img is effective across T2I models of varying capacities, consistently leading to a higher user preference score." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 434, + 483, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 483, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 483, + 567 + ], + "type": "text", + "content": "Qualitative comparisons. Idea2Img could help users generate images that better follow IDEA, such as the correct object counts in Figure 5(a). Idea2Img enables visual content design, in contrast to conventional T2I that requires a detailed visual content description. For example in Figure 5(b), Idea2Img designs visual logo based on the instruction of \"a logo for a 2024 conference in Seattle.\" The power of LMMs allows Idea2Img to extract arbitrary information from the input image for visual generation. This could be any object in the image like \"the circled dog\" in Figure 5(c) or the image style like in Figure 5(d). Such general visual conditioning ability can be seamlessly extended to compose multiple visual and text conditions, such as composing the camera angle and image style in Figure 5(e) and two objects in Figure 5(f)." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "Other than SDXL, Idea2Img is effective in finding text prompts for other image generation models. This includes arbitrary T2I models (e.g., SD v2.1 [38], DeepFloyd IF [20], DALL-E 3 [28], etc.), text-conditioned image-to-image models (e.g., SDXL-img2img and IF-img2img with SDEdit [26]), and other specialist generation models (e.g., reward-tuned T2I [11,21], region-controlled generators [23,57,63], and other specialist models [3,6,39]). Figure 6 overviews Idea2Img working with different image generation models. We show additional qualitative results and discussions in Appendix Section A.1." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 116, + 462, + 366 + ], + "blocks": [ + { + "bbox": [ + 151, + 116, + 462, + 366 + ], + "lines": [ + { + "bbox": [ + 151, + 116, + 462, + 366 + ], + "spans": [ + { + "bbox": [ + 151, + 116, + 462, + 366 + ], + "type": "image", + "image_path": "ff6e2f54ee9ff98dcb1231dc24be3a07b3607f28e4499cfd797b2810b0243791.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 376, + 482, + 399 + ], + "lines": [ + { + "bbox": [ + 132, + 376, + 482, + 399 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 482, + 399 + ], + "type": "text", + "content": "Fig. 5: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with SDXL [34] as the T2I model." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 420, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 420, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 482, + 456 + ], + "type": "text", + "content": "How Idea2Img may assist humans? We use selected qualitative results to highlight the scenarios where humans might find Idea2Img most helpful in image design and generation, compared with conventional T2I generation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 135, + 462, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 136, + 462, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 462, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 136, + 462, + 482, + 594 + ], + "type": "text", + "content": "1. New functionalities with multimodal IDEA inputs. Idea2Img provides a more natural way for human interaction, where users do not have to describe their desired image solely through texts and painstakingly search for the right prompt word. Instead, the multimodal IDEA allows Idea2Img to precisely extract specific elements from one or multiple input images, such as the dog breed and color, pointed objects, artist style, camera view, and more, as shown in Figure 5. Finding proper words that the T2I model can understand for such visual concepts could be tedious for humans, e.g., the art style \"with bold lines and bright colors, with a cubist and surrealistic style, with a focus on geometric shapes and patterns.\" in Figure 5(d). Idea2Img automates this process via Idea2Img iterative self-refinement." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 135, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 135, + 594, + 482, + 665 + ], + "type": "text", + "content": "2. New functionalities with instructional inputs. Vanilla T2I models struggle to understand T2I prompts that describe the intended visual design or purpose of the generated image, such as \"a logo for a 2024 conference held in Seattle\" in Figure 5(b). Instead, the prompt needs to be a comprehensive description of the image to generate, demanding extra drafting effort from users, such as \"...the Seattle skyline in the center and the conference title" + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 114, + 462, + 348 + ], + "blocks": [ + { + "bbox": [ + 151, + 114, + 462, + 348 + ], + "lines": [ + { + "bbox": [ + 151, + 114, + 462, + 348 + ], + "spans": [ + { + "bbox": [ + 151, + 114, + 462, + 348 + ], + "type": "image", + "image_path": "98782994c053252840956b8e7315d7dc1269296e36a7cf5c2ab2cad15b38983c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 357, + 482, + 392 + ], + "lines": [ + { + "bbox": [ + 132, + 357, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 482, + 392 + ], + "type": "text", + "content": "Fig. 6: The comparisons among initial-round manual prompt, initial-round Idea2Img prompt, and iterative self-refined Idea2Img prompt, with different image generation models. Additional qualitative results and discussions are in Appendix A.1." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 147, + 415, + 480, + 438 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 415, + 480, + 438 + ], + "spans": [ + { + "bbox": [ + 147, + 415, + 480, + 438 + ], + "type": "text", + "content": "below it ...\". In contrast, Idea2Img effectively understands the instructional texts in IDEA and creates images accordingly." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 135, + 439, + 480, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 439, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 135, + 439, + 480, + 475 + ], + "type": "text", + "content": "3. Better semantic and visual quality. Finally, the iterative refinement allows Idea2Img to generate images with better semantic and visual qualities, leading to an effective automatic image creation assistant." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 501, + 362, + 513 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 362, + 513 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 362, + 513 + ], + "type": "text", + "content": "4.3 LMM Feedback, Revision, and Selection" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "We show representative LMM outputs for \"feedback reflection,\" \"revised prompt generation,\" and \"draft image selection.\" Additional results are in Appendix A.2. Feedback reflection. Figure 7(a) shows the text feedback generated by GPT-4V for the user IDEA and the draft image and T2I prompt. Idea2Img can effectively check if the generated image is correct, and verify if the draft image corresponds to the visual descriptions in IDEA. This includes the breed of the dog in (a.1), as well as art styles, objects, visual attributes, etc. In addition to identifying the discrepancy, Idea2Img also points to the plausible directions that may improve the T2I prompt in the text feedback. For example, in (a.2), Idea2Img provides guidance to have generated images better follow the user intention of \"an image for a children's painting competition,\" by \"specifically mentioning that the car should be simple and cartoon-like.\"" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 145, + 115, + 237, + 205 + ], + "blocks": [ + { + "bbox": [ + 145, + 115, + 237, + 205 + ], + "lines": [ + { + "bbox": [ + 145, + 115, + 237, + 205 + ], + "spans": [ + { + "bbox": [ + 145, + 115, + 237, + 205 + ], + "type": "image", + "image_path": "0efa328db2f0df6b87158593670c825d0028bf463d6e56677785975bf0714bfb.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 242, + 115, + 317, + 205 + ], + "blocks": [ + { + "bbox": [ + 242, + 115, + 317, + 205 + ], + "lines": [ + { + "bbox": [ + 242, + 115, + 317, + 205 + ], + "spans": [ + { + "bbox": [ + 242, + 115, + 317, + 205 + ], + "type": "image", + "image_path": "d514d8be8b74ae2cf14a8ab3635b658c11d438fc4ea862f76ea027b78ba3a5a6.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 361, + 115, + 468, + 205 + ], + "blocks": [ + { + "bbox": [ + 361, + 115, + 468, + 205 + ], + "lines": [ + { + "bbox": [ + 361, + 115, + 468, + 205 + ], + "spans": [ + { + "bbox": [ + 361, + 115, + 468, + 205 + ], + "type": "image", + "image_path": "a20eb9469b23a5124a9bf92f5ace2ea5b3951eb5b188ccff9d144bfa8be9a10d.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 146, + 217, + 237, + 265 + ], + "blocks": [ + { + "bbox": [ + 145, + 207, + 468, + 217 + ], + "lines": [ + { + "bbox": [ + 145, + 207, + 468, + 217 + ], + "spans": [ + { + "bbox": [ + 145, + 207, + 468, + 217 + ], + "type": "text", + "content": "(a) Feedback reflection: The right column shows the examples of generated text feedback." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 146, + 217, + 237, + 265 + ], + "lines": [ + { + "bbox": [ + 146, + 217, + 237, + 265 + ], + "spans": [ + { + "bbox": [ + 146, + 217, + 237, + 265 + ], + "type": "image", + "image_path": "dd191f143c0e204985253e35e8ed203665e98373a7504f6aabd22b696e5f0ec1.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 242, + 218, + 369, + 266 + ], + "blocks": [ + { + "bbox": [ + 242, + 218, + 369, + 266 + ], + "lines": [ + { + "bbox": [ + 242, + 218, + 369, + 266 + ], + "spans": [ + { + "bbox": [ + 242, + 218, + 369, + 266 + ], + "type": "image", + "image_path": "dd3538bdb1722f43422b9a4ea5e5ae175a24bb3183e3fe207bf41aab4ce6b6dc.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 373, + 218, + 468, + 266 + ], + "blocks": [ + { + "bbox": [ + 373, + 218, + 468, + 266 + ], + "lines": [ + { + "bbox": [ + 373, + 218, + 468, + 266 + ], + "spans": [ + { + "bbox": [ + 373, + 218, + 468, + 266 + ], + "type": "image", + "image_path": "1ecf56695e6ffa93363acf9e0cbb3eab527099f2a093a79083f3c4688fa3b0e2.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 146, + 267, + 237, + 307 + ], + "blocks": [ + { + "bbox": [ + 146, + 267, + 237, + 307 + ], + "lines": [ + { + "bbox": [ + 146, + 267, + 237, + 307 + ], + "spans": [ + { + "bbox": [ + 146, + 267, + 237, + 307 + ], + "type": "image", + "image_path": "6b202203dcf4289450c9b511bd6694c93806925d3383b93505255933746a6d5f.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 242, + 267, + 369, + 308 + ], + "blocks": [ + { + "bbox": [ + 242, + 267, + 369, + 308 + ], + "lines": [ + { + "bbox": [ + 242, + 267, + 369, + 308 + ], + "spans": [ + { + "bbox": [ + 242, + 267, + 369, + 308 + ], + "type": "image", + "image_path": "5f75030b4a5c3a053463a85268a71ede8285cc389e2bb3b4dd344a49e7371b59.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 373, + 267, + 467, + 308 + ], + "blocks": [ + { + "bbox": [ + 373, + 267, + 467, + 308 + ], + "lines": [ + { + "bbox": [ + 373, + 267, + 467, + 308 + ], + "spans": [ + { + "bbox": [ + 373, + 267, + 467, + 308 + ], + "type": "image", + "image_path": "a0414c5df664e9b973c4ff07a101370ab2093ca9ea536e7e7a21f553f8b25abf.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 146, + 320, + 237, + 367 + ], + "blocks": [ + { + "bbox": [ + 145, + 310, + 468, + 319 + ], + "lines": [ + { + "bbox": [ + 145, + 310, + 468, + 319 + ], + "spans": [ + { + "bbox": [ + 145, + 310, + 468, + 319 + ], + "type": "text", + "content": "(b) Revised prompt generation: The right column shows the examples of revised prompts." + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 146, + 320, + 237, + 367 + ], + "lines": [ + { + "bbox": [ + 146, + 320, + 237, + 367 + ], + "spans": [ + { + "bbox": [ + 146, + 320, + 237, + 367 + ], + "type": "image", + "image_path": "d43770d4933eb5bbb4b94e09f3bc4bf9a9d270097fa81e50afd2146df565f33b.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 242, + 321, + 369, + 369 + ], + "blocks": [ + { + "bbox": [ + 242, + 321, + 369, + 369 + ], + "lines": [ + { + "bbox": [ + 242, + 321, + 369, + 369 + ], + "spans": [ + { + "bbox": [ + 242, + 321, + 369, + 369 + ], + "type": "image", + "image_path": "8c2c91a41b987998e35f7b1a741c3b94402d5d7a47c009c24491884607bf08a9.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 373, + 321, + 468, + 369 + ], + "blocks": [ + { + "bbox": [ + 373, + 321, + 468, + 369 + ], + "lines": [ + { + "bbox": [ + 373, + 321, + 468, + 369 + ], + "spans": [ + { + "bbox": [ + 373, + 321, + 468, + 369 + ], + "type": "image", + "image_path": "1dcce2754b33014d3cc2e39b77725f21bd42b49056b50b192c3803c6c369fa89.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 146, + 372, + 237, + 412 + ], + "blocks": [ + { + "bbox": [ + 146, + 372, + 237, + 412 + ], + "lines": [ + { + "bbox": [ + 146, + 372, + 237, + 412 + ], + "spans": [ + { + "bbox": [ + 146, + 372, + 237, + 412 + ], + "type": "image", + "image_path": "d71f25e363574f77f808930acfce4bf278a14c0b106e0ec8f9276f6d7d7ea692.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 242, + 370, + 369, + 414 + ], + "blocks": [ + { + "bbox": [ + 242, + 370, + 369, + 414 + ], + "lines": [ + { + "bbox": [ + 242, + 370, + 369, + 414 + ], + "spans": [ + { + "bbox": [ + 242, + 370, + 369, + 414 + ], + "type": "image", + "image_path": "0e92a7c4196c9296c9efc25f9459be58c76f19e9b231186b2d1248cde54747fb.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 144, + 416, + 468, + 434 + ], + "lines": [ + { + "bbox": [ + 144, + 416, + 468, + 434 + ], + "spans": [ + { + "bbox": [ + 144, + 416, + 468, + 434 + ], + "type": "text", + "content": "(c) Draft image selection: The right column shows the examples of the draft image selection index and justification." + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 138, + 442, + 474, + 453 + ], + "lines": [ + { + "bbox": [ + 138, + 442, + 474, + 453 + ], + "spans": [ + { + "bbox": [ + 138, + 442, + 474, + 453 + ], + "type": "text", + "content": "Fig. 7: GPT-4V's outputs in Idea2Img for image feedback, revision, and selection." + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 373, + 372, + 467, + 414 + ], + "blocks": [ + { + "bbox": [ + 373, + 372, + 467, + 414 + ], + "lines": [ + { + "bbox": [ + 373, + 372, + 467, + 414 + ], + "spans": [ + { + "bbox": [ + 373, + 372, + 467, + 414 + ], + "type": "image", + "image_path": "d799b1de86dcc992ff7612ac2ee84744e4b8e1b0382e7af753c03aa9d9c41369.jpg" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_body" + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 483, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 483, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 483, + 482, + 567 + ], + "type": "text", + "content": "Revised prompt generation. Figure 7(b) compares the T2I prompts before and after the prompt revision, showcasing how text feedback may help the refinement. For example, in (b.1), the revised T2I prompt specifies \"an empty plate with no other objects\" to preclude the T2I model from generating bananas, which occurred with the previous prompt \"no bananas.\" In (b.2), the revised T2I prompt includes a detailed description of \"a yellow tennis outfit\" and \"a Yorkshire Terrier\" to generate the queried clothing and dog." + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "Draft image selection. Performing draft image selection requires LMMs to compare multiple similar draft images and pick the one that best matches the multimodal input " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "IDEA" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": ". Figure 7(c) shows the selection results generated by " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "Idea2Img" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": ". GPT-4V is prompted to give justifications and scores for each draft image, in addition to the final selection. We observe that " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "Idea2Img" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " could comprehensively judges different aspects in " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "IDEA" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": ", and gives reasonable scores and selection indexes. E.g., finding the image with both sleep and study area in (c.1), verifying content and style in (c.2), and other examples in Appendix Figure G." + } + ] + } + ], + "index": 22 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 309, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 309, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 309, + 127 + ], + "type": "text", + "content": "5 Limitation and Discussion" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 148, + 482, + 244 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 148, + 482, + 244 + ], + "spans": [ + { + "bbox": [ + 130, + 148, + 482, + 244 + ], + "type": "text", + "content": "Tasks beyond image generation. Idea2Img explores the emergent ability of multimodal self-refinement in LMM-based systems, through the image design and generation task. Specifically, Idea2Img views the T2I model to use as an unknown multimodal environment to explore, and iteratively refines T2I prompts to find its optimal usage. This concept mirrors the intrinsic human approach of iterative problem-solving when faced with unknown environments or challenges. We leave its extension to other intriguing tasks, e.g., GUI navigation [53], embodied agents [27], and complicated visual reasoning [36, 52], for future exploration." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 245, + 482, + 388 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 245, + 482, + 388 + ], + "spans": [ + { + "bbox": [ + 130, + 245, + 482, + 388 + ], + "type": "text", + "content": "From a single image generation model to multiple tools. Idea2Img explores using a single image generation model, such as a text-to-image model [38] or a text-conditioned image-to-image model [26]. When needed, other specialized generative models like ControlNet [63], inpainting [3], region-controlled T2I generation [23,57], customized generation [8,39], and video generation [46,60] can be seamlessly switched and supported. That is, Idea2Img could broadly boost different visual generation models of diverse specialties by exploring their optimal text description or instruction prompts. Beyond a single generation model, Idea2Img can also be used to allocate multiple tools as in multimodal agent studies [50,56]. In this case, Idea2Img isn't limited to optimizing the use of individual tools but also investigates their effective collaboration when used together, such as generator selection and multi-step visual generation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 390, + 487, + 522 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 487, + 522 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 487, + 522 + ], + "type": "text", + "content": "Consolidating explored knowledge. We have shown the effectiveness of LMM iterative self-refinement in automatic image design and generation. Idea2Img can also help to consolidate or distill the explored knowledge into T2I model parameters, such that no inference-time iterative refinement is needed when encountering seen generation scenarios. One could collect a dataset using Idea2Img for a scenario of interest, and fine-tune a T2I model with the explored self-refinement trajectory. Storing the probed knowledge as sample-agnostic prompt for each image generation model is another promising direction [15, 35, 64]. Finally, with minimal extra computation, we find it helpful to use the explored T2I prompt history as in-context examples for prompt re-writing and expansion, improving from the zero-shot expansion like the one in ChatGPT-Dalle-3 [1, 4]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 548, + 220, + 562 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 220, + 562 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 220, + 562 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 581, + 488, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 488, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 488, + 666 + ], + "type": "text", + "content": "We have presented Idea2Img, a multimodal iterative self-refinement framework that leverages GPT-4V(ison) for image design and generation. Idea2Img explores the emergent capabilities of iterative self-refinement in LMM-based agent systems, showcasing its effectiveness in improving, assessing, and verifying the generated multimodal content. The user preference study demonstrates Idea2Img's capability in assisting humans to find the optimal usage of generation models for automatic image design and generation." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 220, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 220, + 128 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 220, + 128 + ], + "type": "text", + "content": "Acknowledgment" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 136, + 480, + 183 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 136, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 136, + 480, + 183 + ], + "type": "text", + "content": "We are deeply grateful to OpenAI for providing access to their exceptional tool [1, 29-31]. We also extend heartfelt thanks to our Microsoft colleagues for their insights, with special acknowledgment to Faisal Ahmed, Ehsan Azarnasab, and Lin Liang for their constructive feedback." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 201, + 197, + 215 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 201, + 197, + 215 + ], + "spans": [ + { + "bbox": [ + 133, + 201, + 197, + 215 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 227, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 138, + 227, + 479, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 227, + 479, + 248 + ], + "spans": [ + { + "bbox": [ + 138, + 227, + 479, + 248 + ], + "type": "text", + "content": "1. Chatgpt can now see, hear, and speak. https://openai.com/blog/chatgpt-can-now-see-hear-and-speak (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 250, + 480, + 280 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 250, + 480, + 280 + ], + "spans": [ + { + "bbox": [ + 138, + 250, + 480, + 280 + ], + "type": "text", + "content": "2. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-a-scene: Extracting multiple concepts from a single image. arXiv preprint arXiv:2305.16311 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 138, + 282, + 480, + 314 + ], + "type": "text", + "content": "3. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18208-18218 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 316, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 480, + 346 + ], + "type": "text", + "content": "4. Betker, J., Goh, G., Li, J., Brooks, T., Wang, J., Li, L., Ouyang, L., Zhuang, J., Lee, J., Guo, Y., Manassra, W., Dhariwal, P., Chu, C., Jiao, Y., Ramesh, A.: Improving image generation with better captions (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 348, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 348, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 138, + 348, + 480, + 369 + ], + "type": "text", + "content": "5. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 370, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 480, + 402 + ], + "type": "text", + "content": "6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18392-18402 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "text", + "content": "7. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models. arXiv preprint arXiv:2301.13826 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "type": "text", + "content": "8. Chen, W., Hu, H., Li, Y., Rui, N., Jia, X., Chang, M.W., Cohen, W.W.: Subject-driven text-to-image generation via apprenticeship learning. arXiv preprint arXiv:2304.00186 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 468, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 480, + 490 + ], + "type": "text", + "content": "9. Chen, X., Lin, M., Scharli, N., Zhou, D.: Teaching large language models to self-debug. arXiv preprint arXiv:2304.05128 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 491, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 491, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 134, + 491, + 480, + 522 + ], + "type": "text", + "content": "10. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Dpok: Reinforcement learning for fine-tuning text-to-image diffusion models. arXiv preprint arXiv:2305.16381 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 523, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 523, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 134, + 523, + 480, + 566 + ], + "type": "text", + "content": "11. Fan, Y., Watkins, O., Du, Y., Liu, H., Ryu, M., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Lee, K., Lee, K.: Reinforcement learning for fine-tuning text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 567, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 567, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 134, + 567, + 480, + 609 + ], + "type": "text", + "content": "12. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A.R., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis. In: The Eleventh International Conference on Learning Representations (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 611, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 611, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 611, + 480, + 632 + ], + "type": "text", + "content": "13. Gatys, L.A., Ecker, A.S., Bethge, M.: A neural algorithm of artistic style. arXiv preprint arXiv:1508.06576 (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 633, + 435, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 633, + 435, + 643 + ], + "spans": [ + { + "bbox": [ + 134, + 633, + 435, + 643 + ], + "type": "text", + "content": "14. Google: Bard. https://bard.google.com (2023), accessed: 2023-07-17" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "type": "text", + "content": "15. Guo, Y., Liang, Y., Wu, C., Wu, W., Zhao, D., Duan, N.: Learning to program with natural language. arXiv preprint arXiv:2304.10464 (2023)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "16. Gupta, T., Kembhavi, A.: Visual programming: Compositional visual reasoning without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14953-14962 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "type": "text", + "content": "17. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-or, D.: Prompt-to-prompt image editing with cross-attention control. In: The Eleventh International Conference on Learning Representations (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "type": "text", + "content": "18. Kawar, B., Zada, S., Lang, O., Tov, O., Chang, H., Dekel, T., Mosseri, I., Irani, M.: Imagic: Text-based real image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6007-6017 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 225, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 225, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 225, + 481, + 258 + ], + "type": "text", + "content": "19. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 258, + 422, + 267 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 258, + 422, + 267 + ], + "spans": [ + { + "bbox": [ + 132, + 258, + 422, + 267 + ], + "type": "text", + "content": "20. Lab, D.: Deepfloyd if. https://github.com/deep-floyd/IF (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 267, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 267, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 481, + 300 + ], + "type": "text", + "content": "21. Lee, K., Liu, H., Ryu, M., Watkins, O., Du, Y., Boutilier, C., Abbeel, P., Ghavamzadeh, M., Gu, S.S.: Aligning text-to-image models using human feedback. arXiv preprint arXiv:2302.12192 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "type": "text", + "content": "22. Li, C., Gan, Z., Yang, Z., Yang, J., Li, L., Wang, L., Gao, J.: Multimodal foundation models: From specialists to general-purpose assistants. arXiv preprint arXiv:2309.10020 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 332, + 481, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 332, + 481, + 365 + ], + "spans": [ + { + "bbox": [ + 132, + 332, + 481, + 365 + ], + "type": "text", + "content": "23. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 365, + 481, + 397 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 481, + 397 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 481, + 397 + ], + "type": "text", + "content": "24. Lu, P., Peng, B., Cheng, H., Galley, M., Chang, K.W., Wu, Y.N., Zhu, S.C., Gao, J.: Chameleon: Plug-and-play compositional reasoning with large language models. arXiv preprint arXiv:2304.09842 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "type": "text", + "content": "25. Madaan, A., Tandon, N., Gupta, P., Hallinan, S., Gao, L., Wiegreffe, S., Alon, U., Dziri, N., Prabhumoye, S., Yang, Y., et al.: Self-refine: Iterative refinement with self-feedback. arXiv preprint arXiv:2303.17651 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 430, + 481, + 461 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 481, + 461 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 481, + 461 + ], + "type": "text", + "content": "26. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 461, + 481, + 494 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 461, + 481, + 494 + ], + "spans": [ + { + "bbox": [ + 132, + 461, + 481, + 494 + ], + "type": "text", + "content": "27. Nasiriany, S., Xia, F., Yu, W., Xiao, T., Liang, J., Dasgupta, I., Xie, A., Driess, D., Wahid, A., Xu, Z., et al.: Pivot: Iterative visual prompting elicits actionable knowledge for vlms. arXiv preprint arXiv:2402.07872 (2024)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 494, + 481, + 516 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 494, + 481, + 516 + ], + "spans": [ + { + "bbox": [ + 132, + 494, + 481, + 516 + ], + "type": "text", + "content": "28. OpenAI: Dall-e 3 system card. https://cdn.openai.com/papers/DALL_E_3_System/Card.pdf (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 516, + 307, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 516, + 307, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 516, + 307, + 525 + ], + "type": "text", + "content": "29. OpenAI: Gpt-4 technical report (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 525, + 481, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 481, + 548 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 481, + 548 + ], + "type": "text", + "content": "30. OpenAI: Gpt-4v(ision) system card (2023), https://cdn.openai.com/papers/GPTV_System_Card.pdf" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 548, + 481, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 481, + 568 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 481, + 568 + ], + "type": "text", + "content": "31. OpenAI: Gpt-4v(ision) technical work and authors. https://cdn.openai.com/contributions/gpt-4v.pdf (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 568, + 481, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 568, + 481, + 601 + ], + "spans": [ + { + "bbox": [ + 132, + 568, + 481, + 601 + ], + "type": "text", + "content": "32. Pan, L., Saxon, M., Xu, W., Nathani, D., Wang, X., Wang, W.Y.: Automatically correcting large language models: Surveying the landscape of diverse self-correction strategies. arXiv preprint arXiv:2308.03188 (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "type": "text", + "content": "33. Paranjape, B., Lundberg, S., Singh, S., Hajishirzi, H., Zettlemoyer, L., Ribeiro, M.T.: Art: Automatic multi-step reasoning and tool-use for large language models. arXiv preprint arXiv:2303.09014 (2023)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 633, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 481, + 666 + ], + "type": "text", + "content": "34. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "text", + "content": "35. Pryzant, R., Iter, D., Li, J., Lee, Y.T., Zhu, C., Zeng, M.: Automatic prompt optimization with \"gradient descent\" and beam search. arXiv preprint arXiv:2305.03495 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 183 + ], + "type": "text", + "content": "36. Qi, J., Ding, M., Wang, W., Bai, Y., Lv, Q., Hong, W., Xu, B., Hou, L., Li, J., Dong, Y., et al.: Cogcom: Train large vision-language models diving into details through chain of manipulations. arXiv preprint arXiv:2402.04236 (2024)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "type": "text", + "content": "37. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "text", + "content": "38. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 293 + ], + "type": "text", + "content": "39. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "text", + "content": "40. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E., Ghasemipour, S.K.S., Ayan, B.K., Mahdavi, S.S., Lopes, R.G., et al.: Photorealistic text-to-image diffusion models with deep language understanding. arXiv preprint arXiv:2205.11487 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "41. Schick, T., Dwivedi-Yu, J., Dessi, R., Raileanu, R., Lomeli, M., Zettlemoyer, L., Cancedda, N., Scialom, T.: Toolformer: Language models can teach themselves to use tools. arXiv preprint arXiv:2302.04761 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 370, + 481, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 370, + 481, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 370, + 481, + 402 + ], + "type": "text", + "content": "42. Shen, Y., Song, K., Tan, X., Li, D., Lu, W., Zhuang, Y.: Huggingppt: Solving ai tasks with chatgpt and its friends in huggingface. arXiv preprint arXiv:2303.17580 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 403, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 481, + 424 + ], + "type": "text", + "content": "43. Shi, J., Xiong, W., Lin, Z., Jung, H.J.: Instantbooth: Personalized text-to-image generation without test-time finetuning. arXiv preprint arXiv:2304.03411 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 425, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 425, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 425, + 481, + 445 + ], + "type": "text", + "content": "44. Shinn, N., Cassano, F., Labash, B., Gopinath, A., Narasimhan, K., Yao, S.: Reflexion: Language agents with verbal reinforcement learning (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 481, + 479 + ], + "type": "text", + "content": "45. Shridhar, M., Yuan, X., Côté, M.A., Bisk, Y., Trischler, A., Hausknecht, M.: Alfworld: Aligning text and embodied environments for interactive learning. arXiv preprint arXiv:2010.03768 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "type": "text", + "content": "46. Singer, U., Polyak, A., Hayes, T., Yin, X., An, J., Zhang, S., Hu, Q., Yang, H., Ashual, O., Gafni, O., et al.: Make-a-video: Text-to-video generation without text-video data. arXiv preprint arXiv:2209.14792 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 513, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 513, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 513, + 481, + 533 + ], + "type": "text", + "content": "47. Surís, D., Menon, S., Vondrick, C.: Vipergpt: Visual inference via python execution for reasoning. arXiv preprint arXiv:2303.08128 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "text", + "content": "48. Wang, J., Yang, Z., Hu, X., Li, L., Lin, K., Gan, Z., Liu, Z., Liu, C., Wang, L.: Git: A generative image-to-text transformer for vision and language. arXiv preprint arXiv:2205.14100 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "text", + "content": "49. Wang, Z.J., Montoya, E., Munechika, D., Yang, H., Hoover, B., Chau, D.H.: Diffusiondb: A large-scale prompt gallery dataset for text-to-image generative models. arXiv preprint arXiv:2210.14896 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 601, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 632 + ], + "type": "text", + "content": "50. Wu, C., Yin, S., Qi, W., Wang, X., Tang, Z., Duan, N.: Visual chatgpt: Talking, drawing and editing with visual foundation models. arXiv preprint arXiv:2303.04671 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "51. Wu, J., Wang, J., Yang, Z., Gan, Z., Liu, Z., Yuan, J., Wang, L.: Grit: A generative region-to-text transformer for object understanding. arXiv preprint arXiv:2212.00280 (2022)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 163, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idea2Img: Self-Refinement with LMMs for Automatic Visual Creation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 544 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "text", + "content": "52. Wu, P., Xie, S.: V*: Guided visual search as a core mechanism in multimodal llms. arXiv preprint arXiv:2312.14135 17 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 139, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 139, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 480, + 171 + ], + "type": "text", + "content": "53. Yan, A., Yang, Z., Zhu, W., Lin, K., Li, L., Wang, J., Yang, J., Zhong, Y., McAuley, J., Gao, J., et al.: Gpt-4v in wonderland: Large multimodal models for zero-shot smartphone gui navigation. arXiv preprint arXiv:2311.07562 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 480, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 480, + 193 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 480, + 193 + ], + "type": "text", + "content": "54. Yang, C., Wang, X., Lu, Y., Liu, H., Le, Q.V., Zhou, D., Chen, X.: Large language models as optimizers. arXiv preprint arXiv:2309.03409 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 480, + 226 + ], + "type": "text", + "content": "55. Yang, Z., Li, L., Lin, K., Wang, J., Lin, C.C., Liu, Z., Wang, L.: The dawn of Imms: Preliminary explorations with gpt-4v (ision). arXiv preprint arXiv:2309.17421 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "text", + "content": "56. Yang*, Z., Li*, L., Wang*, J., Lin*, K., Azarnasab*, E., Ahmed*, F., Liu, Z., Liu, C., Zeng, M., Wang, L.: Mm-react: Prompting chatgpt for multimodal reasoning and action. arXiv preprint arXiv:2303.11381 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 480, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 303 + ], + "type": "text", + "content": "57. Yang, Z., Wang, J., Gan, Z., Li, L., Lin, K., Wu, C., Duan, N., Liu, Z., Liu, C., Zeng, M., et al.: Reco: Region-controlled text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14246-14255 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 304, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 480, + 335 + ], + "type": "text", + "content": "58. Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W.W., Salakhutdinov, R., Manning, C.D.: Hotpotqa: A dataset for diverse, explainable multi-hop question answering. arXiv preprint arXiv:1809.09600 (2018)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "text", + "content": "59. Yao, S., Zhao, J., Yu, D., Du, N., Shafran, I., Narasimhan, K., Cao, Y.: React: Synergizing reasoning and acting in language models. arXiv preprint arXiv:2210.03629 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "text", + "content": "60. Yin, S., Wu, C., Yang, H., Wang, J., Wang, X., Ni, M., Yang, Z., Li, L., Liu, S., Yang, F., et al.: Nuwa-xl: Diffusion over diffusion for extremely long video generation. arXiv preprint arXiv:2303.12346 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 402, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 480, + 435 + ], + "type": "text", + "content": "61. Yu, J., Xu, Y., Koh, J.Y., Luong, T., Baid, G., Wang, Z., Vasudevan, V., Ku, A., Yang, Y., Ayan, B.K., et al.: Scaling autoregressive models for content-rich text-to-image generation. Transactions on Machine Learning Research (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "type": "text", + "content": "62. Yu, W., Yang, Z., Li, L., Wang, J., Lin, K., Liu, Z., Wang, X., Wang, L.: Mmvet: Evaluating large multimodal models for integrated capabilities. arXiv preprint arXiv:2308.02490 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 468, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 480, + 490 + ], + "type": "text", + "content": "63. Zhang, L., Agrawala, M.: Adding conditional control to text-to-image diffusion models. arXiv preprint arXiv:2302.05543 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 490, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 490, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 490, + 480, + 511 + ], + "type": "text", + "content": "64. Zhao, A., Huang, D., Xu, Q., Lin, M., Liu, Y.J., Huang, G.: Expel: Llm agents are experiential learners. arXiv preprint arXiv:2308.10144 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 511, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 511, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 511, + 480, + 544 + ], + "type": "text", + "content": "65. Zhu, W., Wang, X., Lu, Y., Fu, T.J., Wang, X.E., Eckstein, M., Wang, W.Y.: Collaborative generative ai: Integrating gpt-k for efficient editing in text-to-image generation. arXiv preprint arXiv:2305.11317 (2023)" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_content_list.json b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..401d0100a98e311170c28cf17958ea7e2b698e40 --- /dev/null +++ b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_content_list.json @@ -0,0 +1,2069 @@ +[ + { + "type": "text", + "text": "Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition", + "text_level": 1, + "bbox": [ + 227, + 141, + 774, + 185 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Lilang Lin, Lehong Wu, Jiahang Zhang, and Jiaying Liu", + "bbox": [ + 271, + 212, + 730, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Wangxuan Institute of Computer Technology, Peking University {linlilang, zjh2020, liujiaying}@pku.edu.cn aladonwh@pku.stu.edu.cn", + "bbox": [ + 285, + 239, + 715, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Generative models, as a powerful technique for generation, also gradually become a critical tool for recognition tasks. However, in skeleton-based action recognition, the features obtained from existing pre-trained generative methods contain redundant information unrelated to recognition, which contradicts the nature of the skeleton's spatially sparse and temporally consistent properties, leading to undesirable performance. To address this challenge, we make efforts to bridge the gap in theory and methodology and propose a novel skeleton-based idempotent generative model (IGM) for unsupervised representation learning. More specifically, we first theoretically demonstrate the equivalence between generative models and maximum entropy coding, which demonstrates a potential route that makes the features of generative models more compact by introducing contrastive learning. To this end, we introduce the idempotency constraint to form a stronger consistency regularization in the feature space, to push the features only to maintain the critical information of motion semantics for the recognition task. Our extensive experiments on benchmark datasets, NTU RGB+D and PKUMMD, demonstrate the effectiveness of our proposed method. On the NTU 60 xsub dataset, we observe a performance improvement from $84.6\\%$ to $86.2\\%$ . Furthermore, in zero-shot adaptation scenarios, our model demonstrates significant efficacy by achieving promising results in cases that were previously unrecognizable. Our project is available at https://github.com/LanglandsLin/IGM.", + "bbox": [ + 261, + 320, + 743, + 638 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Self-supervised learning $\\cdot$ skeleton-based action recognition $\\cdot$ contrastive learning", + "bbox": [ + 261, + 652, + 740, + 681 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 707, + 375, + 722 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Skeletons represent human joints through 3D coordinate locations, providing a compact and efficient modality of representing human motion compared to RGB videos and depth data. Owing to their simplicity and superior discriminative capabilities for analysis, skeleton representations have been extensively employed in the field of action recognition tasks [25, 32, 42, 43, 66, 68].", + "bbox": [ + 212, + 739, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author.", + "bbox": [ + 217, + 824, + 385, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Supervised skeleton-based action recognition methods [4,37,39] have demonstrated remarkable performance. However, they heavily rely on vast amounts of labeled training data, the collection of which can be a costly and time-consuming process. In order to reduce the reliance on fully supervised paradigms, self-supervised learning approaches have been explored in the context of skeleton-based action recognition [20, 43, 46, 69].", + "bbox": [ + 212, + 146, + 787, + 238 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In the context of self-supervised pretraining paradigms, most methods can be broadly classified into two categories: generative learning-based [18, 43, 60] and contrastive learning-based approaches. Generative learning-based methods typically model the spatial-temporal correlations by predicting or reconstructing the masked skeleton data. With long-term global motion dynamics, Zheng et al. [69] were the pioneers in introducing the concept of reconstructing masked skeleton data. The structure of Masked Auto-Encoder (MAE) was used by Mao et al. [28] to predict the velocity of the masked part thus obtaining motion information modelling. However, skeleton data is by nature spatially sparse and temporal consistent while MAE's feature preserves too much appearance information, which will interfere with the recognition tasks.", + "bbox": [ + 212, + 239, + 787, + 407 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "On the other route, contrastive learning-based methods also have recently demonstrated remarkable potential. These methods utilize skeleton transformations to generate positive pairs and aim to maintain consistency in the embedding space. Rao et al. [34] introduced shearing and cropping as data augmentation techniques. Guo et al. [11] extended these efforts by suggesting additional augmentations, such as rotation, masking, and flipping, to further enhance the consistency of contrastive learning. Contrastive learning, aimed at high-level tasks like recognition, often requires data transformation to filter out task-irrelevant information. This process results in a significant loss of information in the extracted features and hampers the ability to capture fine-grained motion details.", + "bbox": [ + 212, + 410, + 787, + 561 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, previous research has typically focused on these two paradigms separately. Their ideas and technical advantages are complementary and can be augmented, which is still under-explored. To address this gap, we first seek theoretical inspiration about the relationship between generative models and contrastive learning. In detail, we find that generative methods are equivalent to maximum entropy coding. This fact naturally inspires building the generative models with the related idempotent constraint to form a novel idempotent generative model, which is exactly equivalent to spectral contrastive learning but with improved recognition capacities.", + "bbox": [ + 212, + 564, + 787, + 700 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Building upon this theoretical foundation, we propose a novel idempotent generative model to promote consistency in the feature space. By enforcing idempotence at the feature and distribution levels, our model enriches features with semantic motion information, thereby reducing the domain gap and adapting the generative model better for recognition. Moreover, the features of generative models are span on principal components, which easily leads to dimensional collapse, as recognition tasks primarily rely on discriminative local details. To address this imbalance, we introduce an adapter that fuses encoder and generator features. This integration expands the effective feature dimension of the", + "bbox": [ + 212, + 704, + 787, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "feature space, facilitating more robust and comprehensive representation. Our model attains outstanding results through self-supervised learning in comparison to contemporary state-of-the-art methods.", + "bbox": [ + 212, + 146, + 782, + 190 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, our contributions are three-folded:", + "bbox": [ + 238, + 191, + 583, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- We propose an idempotent generative model to combine the benefits of generative pre-training and contrastive learning, which is inspired by the theoretical fact of their intrinsic correlation. This cooperation makes the model focus on extracting more compact information related to motion semantics, and obtain more powerful high-level representation within the generative model framework.", + "bbox": [ + 225, + 214, + 782, + 303 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- We further propose to utilize a multiple idempotency feature constraint. Through feature and distribution idempotency constraints, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model.", + "bbox": [ + 225, + 316, + 782, + 376 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- We employ an adapter to fuse the features from the high-level semantic encoder and low-level skeleton generator from different subspaces to expand the representation dimension. Experiments show that our module improves the effective dimension of the feature space and encodes rich information.", + "bbox": [ + 225, + 388, + 782, + 448 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 470, + 385, + 486 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Skeleton-Based Action Recognition", + "text_level": 1, + "bbox": [ + 214, + 500, + 550, + 513 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Skeleton sequences encode the motion trajectories of human joints, representing rich information about human actions. Thus, skeleton data serves as a suitable modality for human action recognition [25, 42, 66, 68]. Skeleton can be obtained by applying pose estimation algorithms on RGB videos or depth maps [38].", + "bbox": [ + 212, + 523, + 782, + 583 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Early studies focused on extracting hand-designed spatial and temporal domain features from skeleton sequences for human movement recognition [10, 27, 49-51]. In later work, efforts were made to model the positional information and higher-order temporal difference information of the human skeleton [44, 49]. Additionally, graphical models were built by tracking the trajectory of human joints to capture joint information in video sequences [52].", + "bbox": [ + 212, + 584, + 782, + 672 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Recently, there has been a surge of interest in using graph structures for learning models [52]. Graph Neural Network (GNN) is one such model capturing intra-graph dependencies through information transfer between nodes. Various approaches have been proposed, such as spatio-domain inference networks, recurrent neural networks (RNNs), and graph convolutional networks (GCNs), to exploit graph structures for human action recognition [36, 40, 59]. These models automatically learn spatio-temporal patterns from skeleton data, facilitating strong action generalization. Moreover, attention mechanisms, multiscale aggregation schemes, and lightweight convolution operations have been integrated into GCN-based models to enhance their effectiveness and reduce computational costs [6, 25, 41, 66].", + "bbox": [ + 212, + 674, + 785, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.2 Self-Supervised Learning", + "text_level": 1, + "bbox": [ + 215, + 146, + 468, + 162 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The self-supervised task aims to extract data features from a large amount of unlabelled data [8]. It can be widely used in semantic segmentation, image classification, action recognition and many other tasks [17,31]. These tasks are mainly classified into methods based on reconstruction and on contrastive learning.", + "bbox": [ + 212, + 174, + 785, + 234 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Reconstruction based approach after masking part of the original data, the network is used to reconstruct the masked part of the data. He et al. [14] proposed Mased Auto-Encoder (MAE) to encode the visible patches and decode the visible and masked patches. This approach has been extended to the video domain and has been used in several studies. These methods typically use a visual Transformer as the backbone network in order to perform the mask reconstruction task. Feichtenhofer et al. [9] extended the image-based masked auto-encoder to use spatio-temporal learning to randomly mask spatio-temporal segments of a video and learn am auto-encoder for reconstruction at the pixel-level reconstruction. Similarly, in MaskFeat, Wei et al. [55] used several video cubes and utilized the model to predict them using the remaining information.", + "bbox": [ + 212, + 236, + 787, + 402 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Contrastive learning pushes pairs of positive sample together while pushing pairs of negative sample further apart. To generate negative samples, contrastive learning pairs anchor frames with frames from other videos. There are various ways of generating positive and negative samples, which is the main factor that distinguishes different contrastive methods.", + "bbox": [ + 212, + 402, + 787, + 477 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Most of these methods generate positive and negative samples by different ways in order to minimize and maximise the distance between them respectively. In the image domain, positive samples are usually generated by enhancing the image in different ways [1, 16, 47, 56, 62]. These enhancements include rotation, cropping, random greyscale and colour change [2]. Scaling these methods in video can be difficult because each video comparison increases the memory required, especially if multiple enhancements are used for multiple positive samples. Another challenge is incorporating the temporal domain into the enhancement. Some methods simply apply the same enhancement in the image to each frame [48]. Some methods include additional frame alignments that may be based on the temporal domain [26]. Finally, some methods rely on motion and optical flow maps as positive samples [33].", + "bbox": [ + 212, + 479, + 787, + 660 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Idempotency Generation Network (IGN)", + "text_level": 1, + "bbox": [ + 215, + 686, + 648, + 705 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Self-Conditional Generative Models as Maximum Entropy Coding", + "text_level": 1, + "bbox": [ + 215, + 720, + 746, + 753 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Self-conditional generative modeling [14] is frequently employed as a pre-training task in self-supervised learning. It is generally structured as an auto-encoder. Formally, given the input skeleton data $\\mathbf{x}$ , the reconstruction loss is:", + "bbox": [ + 212, + 765, + 785, + 811 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathbb {E} _ {\\mathbf {x} \\sim p _ {\\mathbf {x}}} \\left[ \\mathcal {D} (g (\\mathbf {z}), \\mathbf {x}) \\right] = \\mathbb {E} _ {\\mathbf {x} \\sim p _ {\\mathbf {x}}} \\left[ \\mathbb {E} _ {\\mathbf {z} \\sim p _ {\\mathbf {z}} | \\mathbf {x}} [ - \\log p (\\mathbf {x} | \\mathbf {z}) ] \\right] = H (\\mathbf {x} | \\mathbf {z}), \\qquad (1)\n$$\n", + "text_format": "latex", + "bbox": [ + 267, + 823, + 785, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 126 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\mathbf{z} = f(\\mathcal{T}(\\mathbf{x}))$ , $f(\\cdot)$ is the encoder, and $\\mathcal{T}(\\cdot)$ is data transformation. $g(\\cdot)$ is the generator. $\\mathcal{D}(\\cdot,\\cdot)$ is the distance. $p_{\\mathbf{x}}$ is the data distribution and $p_{\\mathbf{z}|\\mathbf{x}}$ is the feature distribution given $\\mathbf{x}$ . $H(\\cdot|\\cdot)$ is the conditional entropy. In the context of MAE, this data transformation represents masked data during training. Conversely, in denoising auto-encoders, this transformation signifies adding noise to the input data.", + "bbox": [ + 212, + 146, + 782, + 234 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In the context of mutual information, this loss function is equivalent to optimizing the mutual information $I(\\mathbf{z};\\mathbf{x})$ between the extracted features $\\mathbf{z}$ and the input data $\\mathbf{x}$ . Based on the relationship between mutual information and entropy, we get", + "bbox": [ + 212, + 237, + 782, + 297 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nI (\\mathbf {z}; \\mathbf {x}) = H (\\mathbf {x}) - H (\\mathbf {x} | \\mathbf {z}) = H (\\mathbf {z}) - H (\\mathbf {z} | \\mathbf {x}). \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 348, + 309, + 782, + 324 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Since the entropy of $\\mathbf{x}$ remains constant, decreasing the reconstruction loss is akin to increasing the mutual information. Conversely, as the features $\\mathbf{z}$ are deterministically derived from the data $\\mathbf{x}$ by an encoder $f(\\cdot)$ , the entropy $H(\\mathbf{z}|\\mathbf{x})$ tends towards zero. Hence, maximizing the mutual information $I(\\mathbf{z};\\mathbf{x})$ is equivalent to maximizing the entropy of the feature space $H(\\mathbf{z})$ .", + "bbox": [ + 212, + 334, + 782, + 409 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Estimating the true distributions $p(\\mathbf{z})$ of the representation space is exceedingly challenging. Following works [24, 63], we leverage lossy data coding, a computationally feasible alternative, as a surrogate for the entropy of continuous random variables $H(\\mathbf{z})$ . This approach involves determining the minimal number of bits required to encode a set of samples $\\mathbf{Z} = [\\mathbf{z}^1, \\dots, \\mathbf{z}^m] \\in \\mathbb{R}^{d \\times m}$ subject to a distortion $\\varepsilon$ , as defined by the coding length function below [47, 72]:", + "bbox": [ + 212, + 410, + 782, + 500 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nL = \\left(\\frac {m + d}{2}\\right) \\log \\det \\left(\\mathbf {I} + \\frac {d}{m \\varepsilon^ {2}} \\mathbf {Z} ^ {T} \\mathbf {Z}\\right), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 362, + 511, + 782, + 542 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\varepsilon$ is the upper bound of the expected decoding error between $\\mathbf{z} \\in \\mathbf{Z}$ and the decoded $\\hat{\\mathbf{z}}$ . $\\operatorname*{det}(\\cdot)$ is the determinant of a matrix. $d$ is the dimension of the feature space. Utilizing the identity $\\operatorname*{det}(\\exp (\\mathbf{A})) = \\exp (\\mathrm{Tr}(\\mathbf{A}))$ , we derive $L = \\operatorname{Tr}\\left(\\mu \\log \\left(\\mathbf{I} + \\lambda \\mathbf{Z}^T\\mathbf{Z}\\right)\\right)$ , where $\\operatorname{Tr}$ denotes the trace of the matrix and $\\mu = \\frac{m + d}{2}$ , $\\lambda = \\frac{d}{m\\varepsilon^2}$ . Finally, we apply a Taylor series expansion to the logarithm of the matrix to obtain:", + "bbox": [ + 214, + 551, + 782, + 642 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nL = \\operatorname {T r} \\left(\\mu \\sum_ {n = 1} ^ {\\infty} \\frac {(- 1) ^ {n - 1}}{n} \\left(\\lambda \\mathbf {Z} ^ {T} \\mathbf {Z}\\right) ^ {n}\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 652, + 782, + 690 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "because the features $\\mathbf{z}$ are projected into spherical space $\\mathbb{S}^{d - 1}$ , $\\operatorname{Tr}\\left(\\mu \\lambda \\mathbf{Z}^T\\mathbf{Z}\\right) = m\\mu \\lambda$ . Hence, the first term does not contribute to the reconstruction learning. In essence, self-conditional generation primarily diminishes the inter-data similarity within the feature space:", + "bbox": [ + 212, + 700, + 782, + 762 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nL = - \\frac {\\mu \\lambda^ {2}}{2} \\operatorname {T r} \\left(\\left(\\mathbf {Z} ^ {T} \\mathbf {Z}\\right) ^ {2}\\right) - \\mathbf {R} = - \\frac {\\mu \\lambda^ {2}}{2} \\sum_ {i = 1} ^ {m} \\sum_ {j = 1} ^ {m} \\left(\\mathbf {z} _ {i} ^ {T} \\mathbf {z} _ {j}\\right) ^ {2} - \\mathbf {R}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 295, + 772, + 782, + 810 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathbf{R} = \\sum_{n=3}^{\\infty} \\frac{(-1)^n \\mu \\lambda^n}{n} \\operatorname{Tr}\\left(\\left(\\mathbf{Z}^T \\mathbf{Z}\\right)^n\\right)$ .", + "bbox": [ + 214, + 821, + 504, + 842 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Idempotent Generative Models as Spectral Contrastive Learning", + "text_level": 1, + "bbox": [ + 215, + 146, + 723, + 176 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The idempotence of a self-conditional generative model refers to its stability in re-encoding [57]. More precisely, if we denote the original data as $\\mathbf{x}$ , the encoder as $f(\\cdot)$ , the encoded feature as $\\mathbf{z} = f(\\mathbf{x})$ , the decoder as $g(\\cdot)$ , and the reconstruction as $\\hat{\\mathbf{x}} = g(\\mathbf{z})$ , then the self-conditional generative model is considered idempotent:", + "bbox": [ + 212, + 185, + 787, + 261 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nf (\\hat {\\mathbf {x}}) = \\mathbf {z} \\quad \\text {o r} \\quad g (f (\\hat {\\mathbf {x}})) = \\hat {\\mathbf {x}}. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 401, + 273, + 784, + 289 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Idempotence is frequently employed in the generative domain to augment the perceptual loss of generated images. The idempotent loss is formulated as:", + "bbox": [ + 214, + 300, + 785, + 330 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {i d e}} = \\left\\| f (\\hat {\\mathbf {x}}) - \\mathbf {z} \\right\\| ^ {2} = - 2 f (\\hat {\\mathbf {x}}) ^ {T} f (\\mathbf {x}), \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 340, + 784, + 358 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{z}^T\\mathbf{z} = 1$ because we normalize the feature space. Therefore, the idempotent generative model maximizes the entropy of the feature space while simultaneously minimizing the feature distance between the data and the generated data. The total loss of the idempotent generative model is expressed as:", + "bbox": [ + 214, + 368, + 787, + 429 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} = \\mathcal {L} _ {\\mathrm {i d e}} - L = - 2 \\sum_ {\\mathbf {x}, \\hat {\\mathbf {x}}} p (\\mathbf {x}, \\hat {\\mathbf {x}}) f (\\hat {\\mathbf {x}} _ {i}) ^ {T} f (\\mathbf {x} _ {i}) + \\sum_ {\\mathbf {x}, \\mathbf {x} ^ {\\prime}} p (\\mathbf {x}) p (\\mathbf {x} ^ {\\prime}) \\left(f (\\mathbf {x}) ^ {T} f (\\mathbf {x} ^ {\\prime})\\right) ^ {2} + \\mathbf {R} \\\\ = - 2 \\mathbb {E} _ {(\\mathbf {x}, \\hat {\\mathbf {x}}) \\sim p (\\mathbf {x}, \\hat {\\mathbf {x}})} \\left[ f (\\hat {\\mathbf {x}}) ^ {T} f (\\mathbf {x}) \\right] + \\mathbb {E} _ {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim p (\\mathbf {x}) p (\\mathbf {x} ^ {\\prime})} \\left[ \\left(f (\\mathbf {x}) ^ {T} f (\\mathbf {x} ^ {\\prime})\\right) ^ {2} \\right] + \\mathbf {R} \\\\ = - 2 \\operatorname {T r} \\left(\\mathbf {F} \\mathbf {A} \\mathbf {F} ^ {T}\\right) + \\operatorname {T r} \\left(\\left(\\mathbf {F} ^ {T} \\mathbf {F}\\right) ^ {2}\\right) + \\mathbf {R} = 2 \\operatorname {T r} \\left(\\mathbf {F} \\mathbf {L} \\mathbf {F} ^ {T}\\right) + \\operatorname {T r} \\left(\\left(\\mathbf {F} ^ {T} \\mathbf {F}\\right) ^ {2}\\right) + \\mathbf {R} + \\text {c o n s t} \\\\ = \\left\\| \\mathbf {A} - \\mathbf {F} ^ {T} \\mathbf {F} \\right\\| _ {F} ^ {2} + \\mathbf {R} + \\text {c o n s t}, \\tag {8} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 218, + 441, + 816, + 563 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{A} \\in \\mathbb{R}^{m \\times m}$ is the adjacency matrix defined by the data generation. $\\mathbf{F} = \\mathbf{Z} \\mathrm{diag}(\\sqrt{p(\\mathbf{x})})$ The weights $\\mathbf{A}_{\\mathbf{x},\\hat{\\mathbf{x}}} = \\frac{p(\\mathbf{x},\\hat{\\mathbf{x}})}{\\sqrt{p(\\mathbf{x})p(\\hat{\\mathbf{x}})}}$ . $\\mathbf{L} = \\mathbf{I} - \\mathbf{A}$ is the Laplacian matrix. This demonstrates its equivalence to spectral contrastive learning. And the advantage of our approach over spectral contrastive learning is that we additionally optimise the residual term $\\mathbf{R}$ to capture higher order information.", + "bbox": [ + 212, + 564, + 787, + 646 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Further, we exploit data idempotence and feature idempotence to enhance representation learning and action generation. The unified generative-perceptual model contains both an encoder $f(\\cdot)$ and generator $g(\\cdot)$ . And our idempotency constraints pay attention to both the data and the feature distributions, which improves both generation and feature learning.", + "bbox": [ + 212, + 646, + 787, + 722 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n(g \\circ f) (\\mathbf {x}) = \\mathbf {x} \\quad \\text {a n d} \\quad (f \\circ g) (\\mathbf {z}) = \\mathbf {z}. \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 734, + 784, + 750 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Relationship to Masked Auto-Encoder", + "text_level": 1, + "bbox": [ + 214, + 770, + 578, + 786 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As mentioned in Eq. 2, the generative network without idempotent constraints has a conditional entropy $H(\\mathbf{z}|\\mathbf{x})$ of 0 because the encoding process is deterministic. Idempotent generative networks, on the other hand, treat features $\\mathbf{z}$ as a", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "random variable sampled from the distribution of features across all of the generated data $\\hat{\\mathbf{x}}$ for the same data $\\mathbf{x}$ , thus transforming into a non-deterministic process:", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} = f (\\hat {\\mathbf {x}}), \\quad \\hat {\\mathbf {x}} \\sim G (\\mathbf {x}), \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 421, + 191, + 784, + 208 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $G(\\cdot)$ is the generation process. Therefore, idempotent constraints are essentially about diminishing conditional entropy $H(\\mathbf{z}|\\mathbf{x})$ , which in turn maximizes the mutual information between features and data.", + "bbox": [ + 212, + 210, + 782, + 256 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In contrast, methods like MAE implicitly prioritize maximizing feature similarity across masked samples of the same data:", + "bbox": [ + 212, + 257, + 782, + 286 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} = f (\\hat {\\mathbf {x}}), \\quad \\hat {\\mathbf {x}} \\sim M (\\mathbf {x}), \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 294, + 784, + 310 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $M(\\cdot)$ is the random masking process. Consequently, features from two distinct data that undergo similar transformed or generated data are clustered into the same class. However, the data obtained through data transformation may not be the real data and thus far from the real data distribution.", + "bbox": [ + 212, + 316, + 782, + 377 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.4 Relationship to Downstream Tasks", + "text_level": 1, + "bbox": [ + 214, + 395, + 549, + 410 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Through the analysis of previous work [7, 12, 13, 54, 67] on spectral contrastive learning, the error rate $P_{e} = P[\\phi(\\mathbf{x}) \\neq y_{\\mathbf{x}}]$ of the downstream linear evaluation $\\phi(\\cdot)$ can be bounded by the generated adjacency matrix $\\mathbf{A}$ and clustering error probabilities $\\alpha = P[y_{\\mathbf{x}} \\neq y_{\\hat{\\mathbf{x}}}]$ :", + "bbox": [ + 212, + 416, + 782, + 477 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 1. If $\\lambda_1 \\geq \\lambda_2 \\geq \\dots \\geq \\lambda_m$ are the eigenvalues of $\\mathbf{A}$ , and if the clustering purity is $1 - \\alpha$ , we obtain:", + "bbox": [ + 214, + 481, + 782, + 512 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nP _ {e} \\leq c _ {1} \\sum_ {i = d + 1} ^ {m} \\lambda_ {i} ^ {2} + c _ {2} \\alpha , \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 518, + 784, + 556 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $c_{1}, c_{2}$ are some constants.", + "bbox": [ + 214, + 564, + 446, + 578 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "This theorem illustrates the constraints on accuracy imposed by the purity $1 - \\alpha$ . A large purity and a small number of clusters result in a low error rate. When the diversity in the generated data is insufficient, the sum of small singular values of the adjacency matrix become large, resulting in less tightly clustered groups. Conversely, excessive diversity in the generated data may compromise the preservation of motion information, thereby increasing the error rate in clustering and undermining overall clustering effectiveness.", + "bbox": [ + 212, + 583, + 782, + 686 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Therefore, to make the feature space of the idempotent generative model more capable of clustering, it is necessary to increase the diversity of the generated data for a stronger feature consistency constraint. However, a paradox is demonstrated here. Ordinary generative processes result in limited diversity under self-conditional generation due to constraints on the distance between the generated data and the original data. So in order to simultaneously obtain diverse and motion semantics preserving generated data, we propose an idempotent self-conditional generation model based on the diffusion generation model. The diversity of the generated data is provided by the noise sampling process of the diffusion model.", + "bbox": [ + 212, + 689, + 784, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/fd3a0edb948962198734cff9ef6a12384b04a2d15fd8ea6976b1af3f11b098a0.jpg", + "image_caption": [ + "Fig. 1: We perform data augmentations on the data first and then obtain the conditional features through the encoder $f(\\cdot)$ . The noise skeleton is then obtained using Diffusion Sampling. The noise skeleton and conditions are fed into the generator $g(\\cdot)$ for denoising. The adapter $h(\\cdot)$ plays a pivotal role in projecting and fusing the features extracted by the encoder $f(\\cdot)$ into the generator's feature space for use as conditions. In the adapter, (a) involves computing similarity using spatio-temporal tokens within the sequence. (b) calculates similar tokens based on the similarity of each token. (c) entails de-correlation by subtracting similar tokens. This integration expands the effective feature dimension of the feature space, facilitating more robust and comprehensive representation. We utilize two losses in our model: Diffusion's noise prediction loss and idempotent feature constraints, which respectively constrain feature similarity and distributional similarity. Thus, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model." + ], + "image_footnote": [], + "bbox": [ + 220, + 147, + 782, + 263 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.5 Idempotent Diffusion Generation Model", + "text_level": 1, + "bbox": [ + 215, + 515, + 594, + 530 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our model consists of three parts, an encoder $f(\\cdot)$ , a generator $g(\\cdot)$ and an adapter $h(\\cdot)$ . The encoder $f(\\cdot)$ extracts features $\\mathbf{z}$ as conditions for the generator $g(\\cdot)$ and also as inputs to the downstream task classifier $\\phi(\\cdot)$ . And the generator $g(\\cdot)$ reconstructs the skeleton data based on the features. The adapter $h(\\cdot)$ , in turn, is responsible for projecting and fusing the features extracted by the encoder $f(\\cdot)$ into the generator's feature space to be used as conditions.", + "bbox": [ + 212, + 542, + 787, + 632 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Encoder $f(\\cdot)$ : We start by applying some data augmentations to the data $\\mathbf{x}$ to obtain data $\\tilde{\\mathbf{x}}$ for increasing diversity. Then, spatio-temporal position embeddings $P_{t}$ and $P_{v}$ are added after projection to the feature space by linear projection:", + "bbox": [ + 212, + 633, + 787, + 691 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {z} = \\operatorname {L i n e a r P r o j} (\\tilde {\\mathbf {x}}) + P _ {t} + P _ {v}. \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 695, + 784, + 710 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Following that, layers of vanilla transformer blocks are employed to extract latent representations $\\mathbf{z}$ . Each block consists of a multi-head self-attention (MSA) module and a feed-forward network (FFN) module. Residual connections are utilized within each module, which are then followed by layer normalization (LN).", + "bbox": [ + 212, + 718, + 787, + 779 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Generator $g(\\cdot)$ : The generator $g(\\cdot)$ and encoder $f(\\cdot)$ maintain the same structure. But the input is the noise data $\\mathbf{x}_t$ obtained by sampling in the diffusion. The generator $g(\\cdot)$ predicts the noise magnitude by taking noise data $\\mathbf{x}_t$ and feature conditions $\\mathbf{z}$ as inputs.", + "bbox": [ + 212, + 779, + 787, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 126 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Adapter $h(\\cdot)$ : The adapter $h(\\cdot)$ merges the features extracted by the encoder $f(\\cdot)$ into the generator $g(\\cdot)$ . This is necessary because high-level tasks like recognition operate in a different feature space compared to low-level tasks like generation. Recognition tasks necessitate capturing high-frequency action movements while generation primarily focuses on optimizing principal component space (with large singular values), such as walking or waving, which rely more on bottom component subspace like velocity. Thus, we introduce a feature fusion method that decouples principal and bottom component subspace, allowing the encoder features to focus more on high-frequency information, making them more suitable for high-level tasks such as action recognition. These features are then injected into the bottom component feature space of the generator.", + "bbox": [ + 212, + 146, + 787, + 313 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "- Manifold Decoupled Feature Fusion Module: To derive discriminative features for use as semantic guides, we draw inspiration from negative samples in contrastive learning. We assume that regions with motion semantics have the lowest similarity to other regions in the same sequence. $\\mathbf{z} = [\\mathbf{z}_1,\\dots ,\\mathbf{z}_l]\\in \\mathbb{R}^{d\\times l}$ , where $l$ is the length of tokens of $\\mathbf{z}$ . The uniformity loss in contrastive learning is:", + "bbox": [ + 212, + 313, + 787, + 404 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {u n i}} = \\mathbb {E} _ {\\mathbf {z} _ {i}} \\left[ \\log \\mathbb {E} _ {\\mathbf {z} _ {j}} \\left[ \\exp \\left(\\mathbf {z} _ {i} ^ {T} \\mathbf {z} _ {j}\\right) \\right] \\right] = \\operatorname {T r} \\left(\\log \\left(\\deg \\left(\\exp \\left(\\mathbf {z} ^ {T} \\mathbf {z}\\right)\\right)\\right)\\right), \\tag {14}\n$$\n", + "text_format": "latex", + "bbox": [ + 277, + 406, + 785, + 426 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "the derivative of $\\mathcal{L}_{\\mathrm{uni}}$ is as follows:", + "bbox": [ + 214, + 434, + 468, + 450 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\mathbf {z}} \\Leftarrow \\mathbf {z} - \\eta \\frac {\\partial \\mathcal {L} _ {\\mathrm {u n i}}}{\\partial \\mathbf {z}} = \\mathbf {z} - \\eta \\mathbf {D} ^ {\\prime - 1} \\mathbf {A} ^ {\\prime} \\mathbf {z}, \\tag {15}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 460, + 785, + 491 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\mathbf{A}' = \\exp(\\mathbf{z}^T\\mathbf{z})$ and $\\mathbf{D}' = \\deg(\\mathbf{A}')$ . $\\mathbf{D}'^{-1}\\mathbf{A}' = \\mathrm{SoftMax}(\\mathbf{z}^T\\mathbf{z})$ . $\\hat{\\mathbf{z}}$ removes low-frequency information. Based on this analysis, we extract the high-frequency information of the features as semantic information:", + "bbox": [ + 214, + 503, + 787, + 551 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\mathbf {z}} \\Leftarrow (1 + \\eta) \\mathbf {z} - \\eta \\operatorname {S o f t M a x} (\\mathbf {z} ^ {T} \\mathbf {z}) \\mathbf {z}. \\tag {16}\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 565, + 785, + 584 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Through this high-pass filtering, we filter out some low-frequency information of principal component space such as the mean value in the sequences, which is not very meaningful for recognition, and retain the semantic information, which is more important for recognition. This module also mitigates dimensionality collapse, making features more informative.", + "bbox": [ + 212, + 595, + 787, + 671 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We then fuse the features into the generator by replacing LayerNorm (LN) with Adaptive LayerNorm (AdaLN) with the following equation:", + "bbox": [ + 214, + 672, + 787, + 705 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {A d a L N} (\\mathbf {h}, \\hat {\\mathbf {z}}, t) = \\hat {\\mathbf {z}} _ {s} \\cdot \\left(\\mathbf {t} _ {s} \\cdot \\operatorname {L N} (\\mathbf {h}) + \\mathbf {t} _ {b}\\right) + \\hat {\\mathbf {z}} _ {b} \\tag {17}\n$$\n", + "text_format": "latex", + "bbox": [ + 349, + 718, + 785, + 734 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\mathbf{h}$ represents the hidden representation of the generator, $(\\mathbf{t}_s,\\mathbf{t}_b)$ and $(\\hat{\\mathbf{z}}_s,\\hat{\\mathbf{z}}_b)$ are obtained from linear projection of timestep embedding $t$ and high-frequency condition $\\hat{\\mathbf{z}}$ , respectively. Through AdaLN layers, the condition $\\hat{\\mathbf{z}}$ guides the denoising process by scaling and shifting the normalized hidden representation. Idempotence Generation Loss: Our loss function comprises two components: the noise prediction loss of the diffusion model and the idempotency constraint.", + "bbox": [ + 212, + 748, + 787, + 842 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "- Noise Prediction Loss: The diffusion model is trained by predicting the noise from the input noise data:", + "bbox": [ + 215, + 146, + 782, + 176 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {g e n}} = \\left\\| g \\left(\\mathbf {x} _ {t}, h (\\mathbf {z}), t\\right) - \\varepsilon \\right\\| ^ {2}, \\tag {18}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 186, + 784, + 212 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {x} _ {t} = \\sqrt {\\bar {\\alpha} _ {t}} \\mathbf {x} + \\sqrt {1 - \\bar {\\alpha} _ {t}} \\varepsilon , \\quad \\varepsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}).\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 208, + 643, + 222 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "- Idempotence Constraint: To obtain consistency constraints on features, we adopt two types of idempotency losses, feature idempotency constraint and distribution idempotency constraint.", + "bbox": [ + 215, + 233, + 782, + 277 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "1) Feature idempotency constraint performs on features. We use the predicted noise to perform a step of de-noising to get the estimated generated data $\\mathbf{x}_0$ :", + "bbox": [ + 215, + 277, + 782, + 321 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {x} _ {0} = \\frac {1}{\\sqrt {\\bar {\\alpha} t}} \\left(\\mathbf {x} _ {t} - \\sqrt {1 - \\bar {\\alpha}} g (\\mathbf {x} _ {t}, h (\\mathbf {z}), t)\\right). \\tag {19}\n$$\n", + "text_format": "latex", + "bbox": [ + 364, + 321, + 782, + 352 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Therefore, the feature idempotency constraint based on this generated data $\\mathbf{x}_0$ is formulated as:", + "bbox": [ + 215, + 356, + 782, + 385 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} _ {\\text {i d e} \\_ \\text {f e a t}} = - f (\\mathbf {x}) ^ {T} f \\left(\\mathbf {x} _ {0}, \\mathbf {z} _ {t ^ {\\prime}}, t, t ^ {\\prime}\\right), \\tag {20} \\\\ \\mathbf {z} _ {t ^ {\\prime}} = \\sqrt {\\bar {\\alpha} _ {t ^ {\\prime}}} \\mathbf {z} + \\sqrt {1 - \\bar {\\alpha} _ {t ^ {\\prime}}} \\varepsilon , \\quad \\varepsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}). \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 339, + 393, + 782, + 430 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Since the generated data may be noisy, we input the noisy features and the number of time steps as auxiliary information.", + "bbox": [ + 215, + 441, + 782, + 469 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "2) Distribution idempotency constraint aims to align the feature distributions of the generated and original data. It is essential to maintain the manifold structure of the generated data consistent with the manifold of the original data. We capture the feature manifold structure through inter-feature similarity:", + "bbox": [ + 215, + 470, + 782, + 531 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {P} \\left(\\mathbf {x} _ {0}\\right) = f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {X} _ {0}\\right) = \\left[ f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {x} _ {0} ^ {1}\\right), \\dots , f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {x} _ {0} ^ {m}\\right) \\right], \\tag {21}\n$$\n", + "text_format": "latex", + "bbox": [ + 290, + 541, + 782, + 558 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "where $\\mathbf{x}_0^i$ is $i$ -th token data. We align it to the feature structure of the original ground truth data:", + "bbox": [ + 215, + 569, + 782, + 598 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {i d e} - \\text {d i s t}} = \\mathcal {D} \\left(\\mathcal {P} \\left(\\mathbf {x} _ {0}\\right), \\mathcal {P} (\\mathbf {x})\\right), \\tag {22}\n$$\n", + "text_format": "latex", + "bbox": [ + 403, + 599, + 782, + 616 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "where $\\mathcal{D}(\\cdot, \\cdot)$ is the distance metric between two distributions. The feature idempotency constraint captures richer structural information and allows for the construction of tighter clusters. This is because the adjacency matrix not only connects different generated data of the same data but also connects different data with similar features. Based on this idempotent alignment, we enhance the generative power of the model for stronger perceptual performance, while the encoder learns stronger feature consistency. This results in reduced singular values $\\sum_{i=d+1}^{m} \\lambda_i^2$ of the adjacency matrix and better downstream task performance.", + "bbox": [ + 215, + 621, + 782, + 743 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4 Experiment Results", + "text_level": 1, + "bbox": [ + 215, + 763, + 442, + 781 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "To evaluate the effectiveness of our approach, we conducted experiments on two benchmark datasets: the NTU RGB+D dataset [23, 35] and the PKUMMD dataset [22].", + "bbox": [ + 215, + 794, + 782, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/ab8988fca85baf2fb676487efb206af0eeeaee829c2f2e0aa6e5164323fa736e.jpg", + "table_caption": [ + "Table 1: Comparison of action recognition results with unsupervised learning approaches on NTU dataset." + ], + "table_footnote": [], + "table_body": "
ModelsArchitectureNTU 60NTU 120
xviewxsubxsetxsub
Contrastive Learning:
3s-AimCLR [11]GCN83.477.866.767.9
3s-CPM [64]GCN84.978.769.668.7
3s-CMD [29]GRU90.984.176.174.7
GL-Transformer [18]Transformer83.876.368.766.0
3s-ActCLR [21]GCN88.884.375.774.3
Generative Learning:
3s-Colorization [61]DGCNN87.279.170.869.2
SkeletonMAE [58]GCN77.774.873.572.5
MAMP [28]Transformer89.184.979.178.6
Contrastive Learning & Generative Learning:
CRRL [53]GRU73.867.657.056.2
PCM³ [65]GRU90.483.977.576.3
IGM (Ours)Transformer91.286.281.480.0
", + "bbox": [ + 263, + 184, + 736, + 390 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/861721225b7d3c628e377b936923bcbf9aa2c821d54dbc5c346972aea86d4d92.jpg", + "table_caption": [ + "Table 2: Comparison of action recognition results under KNN evaluation on NTU 60." + ], + "table_footnote": [], + "table_body": "
Modelsxviewxsub
Contrastive Learning:
AimCLR [11]71.063.7
SkeleMixCLR [5]72.365.5
Generative Learning:
LongT GAN [69]48.139.1
MAMP [28]70.062.0
IGM w/o Lide67.264.7
IGM w/ Lide_feat70.768.4
IGM w/ Lide_dist72.169.0
IGM (Ours)72.669.3
", + "bbox": [ + 228, + 455, + 452, + 599 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/8261a9a0b5cf7e0ce85ae6550afe800ed693943bf405ba9cc8b1728281d8bf02.jpg", + "table_caption": [ + "Table 3: Comparison of the transfer learning performance on PKUMMD II dataset with linear evaluation pretrained on NTU 60." + ], + "table_footnote": [], + "table_body": "
Modelsxviewxsub
Finetune:
LongT GAN [69]-44.8
MS2L [20]-45.8
ISC [46]-51.1
Hi-TRS [3]-55.0
3s-CrosSCLR [19]-51.3
3s-AimCLR [11]42.451.6
Linear:
3s-ActCLR [21]44.555.9
MAMP [28]42.053.0
IGM (Ours)45.359.8
", + "bbox": [ + 531, + 455, + 738, + 602 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.1 Datasets and Settings", + "text_level": 1, + "bbox": [ + 214, + 631, + 442, + 647 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "NTU RGB+D Dataset 60 (NTU 60) [35] comprises a comprehensive compilation of 56,578 videos, covering 60 unique action labels. Every video includes annotations detailing the positions of 25 joints for each body, illustrating interactions among pairs and individual activities.", + "bbox": [ + 212, + 657, + 785, + 717 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "NTU RGB+D Dataset 120 (NTU 120) [23] is one of the most comprehensive datasets for recognizing actions. Encompassing 114,480 videos, it spans 120 unique action categories. This dataset documents the performance of actions by 106 individuals across diverse environments, employing 32 distinct recording configurations.", + "bbox": [ + 212, + 718, + 787, + 792 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "PKU Multi-Modality Dataset (PKUMMD) [22] encompasses 52 action classes and nearly 20,000 instances, with each sample comprising 25 joints, thoroughly tackling the multi-modal 3D comprehension of human actions. The", + "bbox": [ + 212, + 794, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/4ec874f199821bbf2243404de0d75ee652006bb9b9de972ed478e21ac0b8502c.jpg", + "table_caption": [ + "Table 4: Action recognition accuracy for corruptions of test-time adaptation with single domain shift on NTU-C 60 xsub dataset." + ], + "table_footnote": [], + "table_body": "
MethodJoint Noise (p, σ2)Part Occlusion
(1.0, 0.1)(1.0, 0.05)(0.5, 0.1)Right Arms
AimCLR [11]6.316.622.028.1
ActCLR [21]12.733.528.630.3
MAMP [28]2.46.15.810.7
IGM (Ours)58.763.065.356.9
", + "bbox": [ + 302, + 184, + 702, + 268 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "dataset is partitioned into two segments, with Part II showcasing more demanding data owing to heightened view diversity, resulting in skeleton noise.", + "bbox": [ + 212, + 311, + 782, + 340 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For enhancing network training, all skeleton sequences undergo temporal downsampling to 120 frames. The encoder $f(\\cdot)$ and generator $g(\\cdot)$ are built using the Transformer architecture [59], employing hidden channels configured to a dimension of 256. To assess performance, we employ a fully connected layer $\\phi(\\cdot)$ .", + "bbox": [ + 212, + 342, + 784, + 402 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "To refine our network, we employ the Adam optimizer [30]. Training is executed on a single NVIDIA GeForce RTX 4090, employing a batch size of 128, and the network undergoes training for 400 epochs.", + "bbox": [ + 212, + 402, + 784, + 446 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.2 Evaluation and Comparison", + "text_level": 1, + "bbox": [ + 215, + 469, + 491, + 484 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For a comprehensive assessment, we conduct comparative analysis of our approach with other methodologies across diverse scenarios.", + "bbox": [ + 212, + 493, + 784, + 521 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Linear Evaluation. In the linear evaluation framework, we utilize an encoder $f(\\cdot)$ to process the extracted features and a linear classifier $\\phi(\\cdot)$ for action classification. The evaluation metric employed is the accuracy of action recognition. Notably, the encoder $f(\\cdot)$ remains unchanged throughout the linear evaluation protocol. Our model demonstrates superior performance on the datasets outlined in Table 1 compared to other methodologies.", + "bbox": [ + 212, + 523, + 784, + 612 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "KNN Evaluation. In the K-Nearest Neighbors (KNN) evaluation setup, where the fixed encoder $f_{q}(\\cdot)$ extracts features without any trainable parameters, our model showcases superiority in action recognition accuracy on the presented datasets. Table 2 highlights the effectiveness of our approach compared to other methods in this evaluation mechanism.", + "bbox": [ + 212, + 613, + 784, + 686 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Transfer Learning. In the transfer learning scenario, we assess the generalization capability of our model by pretraining it on the source data using a self-supervised task. We then evaluate the model's performance on the target dataset using the linear evaluation mechanism, with the encoder $f(\\cdot)$ maintaining fixed parameters without additional fine-tuning. Our approach demonstrates superior performance in the transfer learning setting, as illustrated in Table 3.", + "bbox": [ + 212, + 689, + 784, + 777 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Zero-Shot Domain Generalization. By applying 4 types of corruption to the validation sets of all datasets, we assess the generalization of our proposed method compared to baseline approaches. For joint noise, we add noise with a probability of $p$ with a variance of $\\sigma^2$ to some joints. We leverage the generative", + "bbox": [ + 212, + 779, + 785, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/c1dc2578c035199c8d872553f6faddb9169065c5e3263b0244028203855f6eba.jpg", + "table_caption": [ + "Table 5: Comparison of mask prediction results on NTU 60 xsub." + ], + "table_footnote": [], + "table_body": "
MethodDDPM [15]MDM [45]SkeletonMAE [58]IGM (Ours)
MPJPE (mm)↓130.287.6329.779.2
FID↓1.781.262.691.18
", + "bbox": [ + 232, + 170, + 767, + 219 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/ffe3b67958b187daabef64696edb56c22f4763577b9bc7ce1fcd74395bdf0b9c.jpg", + "table_caption": [ + "Table 6: Analysis of module combinations on NTU 60 xsub dataset with the joint stream. \"FFM\" means Feature Fusion Module." + ], + "table_footnote": [], + "table_body": "
ModuleKNNLinear
FFM h(·)Lide_featuresLide_dist
64.783.3
✓67.685.1
✓✓68.485.5
✓✓69.086.0
✓✓✓69.386.2
", + "bbox": [ + 316, + 273, + 687, + 369 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "capability of our model, enabling us to denoise noisy skeleton data at test time. Subsequently, we utilize the generated skeleton data for recognition, significantly enhancing the generalization ability of our model. In Table 4, our proposed approach shows consistent and substantial performance improvements.", + "bbox": [ + 212, + 412, + 782, + 472 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Reconstruction Evaluation. In this section, we implement IGM for mask prediction tasks. We input the masked data into the encoder to extract features as conditions for generation, noting that the reconstruction task does not require adding data transformations to the conditions. Our method is compared with diffusion-based methods DDPM and MDM in Table 5. Figs 3 and 4 show visualizations and feature visualizations of both the generated data and the ground truth data. Despite sharing the same feature distribution, the generated samples exhibit some diversity due to the noise introduced in the conditions.", + "bbox": [ + 212, + 474, + 787, + 595 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.3 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 625, + 388, + 638 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Here's the modified text for the ablation experiments:", + "bbox": [ + 212, + 656, + 606, + 670 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Analysis of Module Combination. We investigate the performance of various combinations of modules and observe that each module contributes to a certain degree of improvement. Optimal performance is attained when all three modules are combined. As depicted in Table 6, each module enhances performance.", + "bbox": [ + 212, + 672, + 785, + 733 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Analysis of Mitigating Dimensional Collapse. The analysis points out that the feature space of the generated model is susceptible to dimensionality collapse, resulting in the extracted features losing the information needed for recognition. Fig. 2 shows the feature space of the encoder trained using the generative model and the feature space after Adapter. The token after removing similarity by Adapter network has higher feature values, i.e., the dimension collapse phenomenon is mitigated.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5c9cd72496c43b2cd8ff2143dc709f3f596fa985ce8c117404c1757927077a7c.jpg", + "image_caption": [ + "Fig.2: Curve of singular values with the singular value index." + ], + "image_footnote": [], + "bbox": [ + 243, + 152, + 470, + 281 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/18438d80744197f459fdfd841e73215b80072108a7466325c6a9759b438f1a97.jpg", + "image_caption": [ + "Fig. 3: Visualisation of features in ground truth data and generated data." + ], + "image_footnote": [], + "bbox": [ + 527, + 152, + 740, + 275 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/0fcfc9ad27f1fc507221e14fc31226fe68a6b7fc0c6d82d85d0f54cd97d13c1d.jpg", + "image_caption": [ + "Fig. 4: Visualisations of ground truth data and generated data. Above is the ground truth data, and below is the generated data. The conditions provided by the encoder are incorporated with data transformation, resulting in generated data that maintain similar motion information while exhibiting some diversity." + ], + "image_footnote": [], + "bbox": [ + 230, + 342, + 769, + 426 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusions", + "text_level": 1, + "bbox": [ + 215, + 523, + 367, + 539 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this research, we propose the skeleton-based idempotent generative model (IGM) for unsupervised representation learning, presenting a novel framework that maximizes the potential of generative models for representation learning. By implementing idempotence at both the feature level and distribution, our model enriches features with semantic information about motion, making them more suitable for recognition tasks. Additionally, as the generative model primarily focuses on the principal component space, it is more susceptible to dimensional collapse. Conversely, recognition tasks rely more on the bottom subspace. To address this imbalance, we design an adapter that fuses encoder and generator features from different subspaces, thereby enhancing the effective feature dimension of the feature space.", + "bbox": [ + 212, + 556, + 787, + 723 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 747, + 401, + 763 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This work was supported in part by the National Natural Science Foundation of China under Grant No.62172020, and in part by the Key Laboratory of Science, Technology and Standard in Press Industry (Key Laboratory of Intelligent Press Media Technology).", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bachman, P., Hjelm, R.D., Buchwalter, W.: Learning representations by maximizing mutual information across views. In: Proc. Advances in Neural Information Processing Systems (2019) 4", + "2. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: Proc. Int'l Conference for Machine Learning (2020) 4", + "3. Chen, Y., Zhao, L., Yuan, J., Tian, Y., Xia, Z., Geng, S., Han, L., Metaxas, D.N.: Hierarchically self-supervised transformer for human skeleton representation learning. In: Proc. European Conference on Computer Vision (2022) 11", + "4. Chen, Y., Zhang, Z., Yuan, C., Li, B., Deng, Y., Hu, W.: Channel-wise topology refinement graph convolution for skeleton-based action recognition. In: Proc. Int'l Conference on Computer Vision (2021) 2", + "5. Chen, Z., Liu, H., Guo, T., Chen, Z., Song, P., Tang, H.: Contrastive learning from spatio-temporal mixed skeleton sequences for self-supervised skeleton-based action recognition. arXiv:2207.03065 (2022) 11", + "6. Cheng, K., Zhang, Y., He, X., Chen, W., Cheng, J., Lu, H.: Skeleton-based action recognition with shift graph convolutional network. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 183-192 (2020) 3", + "7. Du, T., Wang, Y., Wang, Y.: On the role of discrete tokenization in visual representation learning. In: Proc. Int'l Conference on Learning Representations (2023) 7", + "8. Erhan, D., Bengio, Y., Courville, A., Manzagol, P.A., Vincent, P., Bengio, S.: Why does unsupervised pre-training help deep learning? Journal of Machine Learning Research 11(Feb), 625-660 (2010) 4", + "9. Feichtenhofer, C., Li, Y., He, K., et al.: Masked autoencoders as spatiotemporal learners. Proc. Advances in Neural Information Processing Systems 35, 35946-35958 (2022) 4", + "0. Goutsu, Y., Takano, W., Nakamura, Y.: Motion recognition employing multiple kernel learning of fisher vectors using local skeleton features. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3", + "1. Guo, T., Liu, H., Chen, Z., Liu, M., Wang, T., Ding, R.: Contrastive learning from extremely augmented skeleton sequences for self-supervised action recognition. Proc. AAAI Conference on Artificial Intelligence (2022) 2, 11, 12", + "2. Guo, X., Wang, Y., Du, T., Wang, Y.: Contranorm: A contrastive learning perspective on oversmoothing and beyond. arXiv preprint arXiv:2303.06562 (2023) 7", + "3. HaoChen, J., Wei, C., Gaidon, A., Ma, T.: Provable guarantees for self-supervised deep learning with spectral contrastive loss, 2021. arXiv preprint arXiv:2106.041567", + "4. He, K., Chen, X., Xie, S., Li, Y., Dóllar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2022) 4", + "5. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Proc. Advances in Neural Information Processing Systems 33, 6840-6851 (2020) 13", + "6. Isola, P., Zoran, D., Krishnan, D., Adelson, E.H.: Learning visual groups from co-occurrences in space and time. arXiv:1511.06811 (2015) 4", + "7. Jang, E., Devin, C., Vanhoucke, V., Levine, S.: Grasp2Vec: Learning object representations from self-supervised grasping. arXiv:1811.06964 (2018) 4" + ], + "bbox": [ + 225, + 176, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Kim, B., Chang, H.J., Kim, J., Choi, J.Y.: Global-local motion transformer for unsupervised skeleton-based action learning. Proc. European Conference on Computer Vision (2022) 2, 11", + "19. Li, L., Wang, M., Ni, B., Wang, H., Yang, J., Zhang, W.: 3D human action representation learning via cross-view consistency pursuit. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2021) 11", + "20. Lin, L., Song, S., Yang, W., Liu, J.: MS2L: Multi-task self-supervised learning for skeleton based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 2, 11", + "21. Lin, L., Zhang, J., Liu, J.: Actionlet-dependent contrastive learning for unsupervised skeleton-based action recognition. In: CVPR (2023) 11, 12", + "22. Liu, J., Song, S., Liu, C., Li, Y., Hu, Y.: A benchmark dataset and comparison study for multi-modal human action analytics. ACM Trans. on Multimedia Computing, Communications, and Applications (2020) 10, 11", + "23. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: NTU RGB+D 120: A large-scale benchmark for 3d human activity understanding. IEEE Trans. on Pattern Analysis and Machine Intelligence (2019) 10, 11", + "24. Liu, X., Wang, Z., Li, Y.L., Wang, S.: Self-supervised learning via maximum entropy coding. Proc. Advances in Neural Information Processing Systems 35, 34091-34105 (2022) 5", + "25. Liu, Z., Zhang, H., Chen, Z., Wang, Z., Ouyang, W.: Disentangling and unifying graph convolutions for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3", + "26. Lorre, G., Rabarisoa, J., Orcesi, A., Ainouz, S., Canu, S.: Temporal contrastive pretraining for video action recognition. In: Proceedings of the IEEE/CVF winter conference on applications of computer vision. pp. 662-670 (2020) 4", + "27. Lv, F., Nevatia, R.: Recognition and segmentation of 3-d human action using hmm and multi-class adaboost. In: Proc. European Conference on Computer Vision (2006) 3", + "28. Mao, Y., Deng, J., Zhou, W., Fang, Y., Ouyang, W., Li, H.: Masked motion predictors are strong 3d action representation learners. In: Proc. Int'l Conference on Computer Vision. pp. 10181-10191 (2023) 2, 11, 12", + "29. Mao, Y., Zhou, W., Lu, Z., Deng, J., Li, H.: CMD: Self-supervised 3d action representation learning with cross-modal mutual distillation. Proc. European Conference on Computer Vision (2022) 11", + "30. Newey, W.K.: Adaptive estimation of regression models via moment restrictions. Journal of Econometrics (1988) 12", + "31. Owens, A., Efros, A.A.: Audio-visual scene analysis with self-supervised multisensory features. In: Proc. European Conference on Computer Vision (2018) 4", + "32. Peng, W., Hong, X., Chen, H., Zhao, G.: Learning graph convolutional network for skeleton-based human action recognition by neural searching. In: Proc. AAAI Conference on Artificial Intelligence (2020) 1", + "33. Rai, N., Adeli, E., Lee, K.H., Gaidon, A., Niebles, J.C.: Cocon: Cooperative-contrastive learning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 3384-3393 (2021) 4", + "34. Rao, H., Xu, S., Hu, X., Cheng, J., Hu, B.: Augmented skeleton based contrastive action learning with momentum LSTM for unsupervised action recognition. Information Sciences (2021) 2", + "35. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: NTU RGB+D: A large scale dataset for 3d human activity analysis. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 10, 11" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "36. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Skeleton-based action recognition with directed graph neural networks. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 7912-7921 (2019) 3", + "37. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Two-stream adaptive graph convolutional networks for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2", + "38. Shotton, J., Sharp, T., Kipman, A., Fitzgibbon, A., Finocchio, M., Blake, A., Cook, M., Moore, R.: Real-time human pose recognition in parts from single depth images. Communications of the ACM (2013) 3", + "39. Si, C., Chen, W., Wang, W., Wang, L., Tan, T.: An attention enhanced graph convolutional LSTM network for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2", + "40. Si, C., Jing, Y., Wang, W., Wang, L., Tan, T.: Skeleton-based action recognition with spatial reasoning and temporal stack learning. In: Proc. European Conference on Computer Vision. pp. 103-118 (2018) 3", + "41. Song, Y.F., Zhang, Z., Shan, C., Wang, L.: Constructing stronger and faster baselines for skeleton-based action recognition. IEEE transactions on pattern analysis and machine intelligence 45(2), 1474-1488 (2022) 3", + "42. Song, Y., Zhang, Z., Shan, C., Wang, L.: Stronger, faster and more explainable: A graph convolutional baseline for skeleton-based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 1, 3", + "43. Su, K., Liu, X., Shlizerman, E.: Predict & cluster: Unsupervised skeleton based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 2", + "44. Tao, L., Vidal, R.: Moving poselets: A discriminative and interpretable skeletal motion representation for action recognition. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3", + "45. Tevet, G., Raab, S., Gordon, B., Shafir, Y., Cohen-Or, D., Bermano, A.H.: Human motion diffusion model. arXiv preprint arXiv:2209.14916 (2022) 13", + "46. Thoker, F.M., Doughty, H., Snoek, C.G.: Skeleton-contrastive 3D action representation learning. In: Proc. ACM Int'l Conference on Multimedia (2021) 2, 11", + "47. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. arXiv:1906.05849 (2019) 4", + "48. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. In: Proc. European Conference on Computer Vision. pp. 776-794. Springer (2020) 4", + "49. Vemulapalli, R., Arrate, F., Chellappa, R.: Human action recognition by representing 3d skeletons as points in a lie group. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2014) 3", + "50. Vemulapalli, R., Chellapa, R.: Rolling rotations for recognizing human actions from 3d skeletal data. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 3", + "51. Wang, J., Liu, Z., Wu, Y., Yuan, J.: Mining actionlet ensemble for action recognition with depth cameras. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2012) 3", + "52. Wang, P., Yuan, C., Hu, W., Li, B., Zhang, Y.: Graph based skeleton motion representation and similarity measurement for action recognition. In: Proc. European Conference on Computer Vision. pp. 370-385 (2016) 3", + "53. Wang, P., Wen, J., Si, C., Qian, Y., Wang, L.: Contrast-reconstruction representation learning for self-supervised skeleton-based action recognition. IEEE Trans. on Image Processing 31, 6224-6238 (2022) 11" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Idempotent Unsupervised Representation", + "bbox": [ + 454, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "54. Wang, Y., Zhang, Q., Du, T., Yang, J., Lin, Z., Wang, Y.: A message passing perspective on learning dynamics of contrastive learning. arXiv preprint arXiv:2303.04435 (2023) 7", + "55. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 14668-14678 (2022) 4", + "56. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2018) 4", + "57. Xu, T., Zhu, Z., He, D., Li, Y., Guo, L., Wang, Y., Wang, Z., Qin, H., Wang, Y., Liu, J., et al.: Idempotence and perceptual image compression. arXiv preprint arXiv:2401.08920 (2024) 6", + "58. Yan, H., Liu, Y., Wei, Y., Li, Z., Li, G., Lin, L.: Skeletonmae: graph-based masked autoencoder for skeleton sequence pre-training. In: Proc. Int'l Conference on Computer Vision. pp. 5606-5618 (2023) 11, 13", + "59. Yan, S., Xiong, Y., Lin, D.: Spatial temporal graph convolutional networks for skeleton-based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 3, 12", + "60. Yang, S., Liu, J., Lu, S., Er, M.H., Kot, A.C.: Skeleton cloud colorization for unsupervised 3D action representation learning. In: Proc. Int'l Conference on Computer Vision (2021) 2", + "61. Yang, S., Liu, J., Lu, S., Hwa, E.M., Hu, Y., Kot, A.C.: Self-supervised 3d action representation learning with skeleton cloud colorization. IEEE Trans. on Pattern Analysis and Machine Intelligence (2023) 11", + "62. Ye, M., Zhang, X., Yuen, P.C., Chang, S.F.: Unsupervised embedding learning via invariant and spreading instance feature. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 4", + "63. Yu, Y., Chan, K.H.R., You, C., Song, C., Ma, Y.: Learning diverse and discriminative representations via the principle of maximal coding rate reduction. Proc. Advances in Neural Information Processing Systems 33, 9422-9434 (2020) 5", + "64. Zhang, H., Hou, Y., Zhang, W., Li, W.: Contrastive positive mining for unsupervised 3d action representation learning. Proc. European Conference on Computer Vision (2022) 11", + "65. Zhang, J., Lin, L., Liu, J.: Prompted contrast with masked motion modeling: Towards versatile 3d action representation learning. In: Proc. ACM Int'l Conference on Multimedia. pp. 7175-7183 (2023) 11", + "66. Zhang, P., Lan, C., Zeng, W., Xing, J., Xue, J., Zheng, N.: Semantics-guided neural networks for efficient skeleton-based human action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3", + "67. Zhang, Q., Wang, Y., Wang, Y.: How mask matters: Towards theoretical understandings of masked autoencoders. Proc. Advances in Neural Information Processing Systems 35, 27127-27139 (2022) 7", + "68. Zhang, X., Xu, C., Tao, D.: Context aware graph convolution for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3", + "69. Zheng, N., Wen, J., Liu, R., Long, L., Dai, J., Gong, Z.: Unsupervised representation learning with long-term dynamics for skeleton based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 2, 11" + ], + "bbox": [ + 215, + 146, + 784, + 811 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Lin et al.", + "bbox": [ + 271, + 114, + 334, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_model.json b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_model.json new file mode 100644 index 0000000000000000000000000000000000000000..2229b1d87292616b717d641bad2e588117dac265 --- /dev/null +++ b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_model.json @@ -0,0 +1,2810 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.228, + 0.142, + 0.776, + 0.186 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition" + }, + { + "type": "text", + "bbox": [ + 0.272, + 0.213, + 0.731, + 0.229 + ], + "angle": 0, + "content": "Lilang Lin, Lehong Wu, Jiahang Zhang, and Jiaying Liu" + }, + { + "type": "text", + "bbox": [ + 0.287, + 0.24, + 0.717, + 0.283 + ], + "angle": 0, + "content": "Wangxuan Institute of Computer Technology, Peking University {linlilang, zjh2020, liujiaying}@pku.edu.cn aladonwh@pku.stu.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.321, + 0.744, + 0.64 + ], + "angle": 0, + "content": "Abstract. Generative models, as a powerful technique for generation, also gradually become a critical tool for recognition tasks. However, in skeleton-based action recognition, the features obtained from existing pre-trained generative methods contain redundant information unrelated to recognition, which contradicts the nature of the skeleton's spatially sparse and temporally consistent properties, leading to undesirable performance. To address this challenge, we make efforts to bridge the gap in theory and methodology and propose a novel skeleton-based idempotent generative model (IGM) for unsupervised representation learning. More specifically, we first theoretically demonstrate the equivalence between generative models and maximum entropy coding, which demonstrates a potential route that makes the features of generative models more compact by introducing contrastive learning. To this end, we introduce the idempotency constraint to form a stronger consistency regularization in the feature space, to push the features only to maintain the critical information of motion semantics for the recognition task. Our extensive experiments on benchmark datasets, NTU RGB+D and PKUMMD, demonstrate the effectiveness of our proposed method. On the NTU 60 xsub dataset, we observe a performance improvement from \\(84.6\\%\\) to \\(86.2\\%\\). Furthermore, in zero-shot adaptation scenarios, our model demonstrates significant efficacy by achieving promising results in cases that were previously unrecognizable. Our project is available at https://github.com/LanglandsLin/IGM." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.653, + 0.741, + 0.682 + ], + "angle": 0, + "content": "Keywords: Self-supervised learning \\(\\cdot\\) skeleton-based action recognition \\(\\cdot\\) contrastive learning" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.708, + 0.376, + 0.723 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.74, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Skeletons represent human joints through 3D coordinate locations, providing a compact and efficient modality of representing human motion compared to RGB videos and depth data. Owing to their simplicity and superior discriminative capabilities for analysis, skeleton representations have been extensively employed in the field of action recognition tasks [25, 32, 42, 43, 66, 68]." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.386, + 0.84 + ], + "angle": 0, + "content": "* Corresponding author." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.128 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.239 + ], + "angle": 0, + "content": "Supervised skeleton-based action recognition methods [4,37,39] have demonstrated remarkable performance. However, they heavily rely on vast amounts of labeled training data, the collection of which can be a costly and time-consuming process. In order to reduce the reliance on fully supervised paradigms, self-supervised learning approaches have been explored in the context of skeleton-based action recognition [20, 43, 46, 69]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.241, + 0.788, + 0.408 + ], + "angle": 0, + "content": "In the context of self-supervised pretraining paradigms, most methods can be broadly classified into two categories: generative learning-based [18, 43, 60] and contrastive learning-based approaches. Generative learning-based methods typically model the spatial-temporal correlations by predicting or reconstructing the masked skeleton data. With long-term global motion dynamics, Zheng et al. [69] were the pioneers in introducing the concept of reconstructing masked skeleton data. The structure of Masked Auto-Encoder (MAE) was used by Mao et al. [28] to predict the velocity of the masked part thus obtaining motion information modelling. However, skeleton data is by nature spatially sparse and temporal consistent while MAE's feature preserves too much appearance information, which will interfere with the recognition tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.411, + 0.788, + 0.562 + ], + "angle": 0, + "content": "On the other route, contrastive learning-based methods also have recently demonstrated remarkable potential. These methods utilize skeleton transformations to generate positive pairs and aim to maintain consistency in the embedding space. Rao et al. [34] introduced shearing and cropping as data augmentation techniques. Guo et al. [11] extended these efforts by suggesting additional augmentations, such as rotation, masking, and flipping, to further enhance the consistency of contrastive learning. Contrastive learning, aimed at high-level tasks like recognition, often requires data transformation to filter out task-irrelevant information. This process results in a significant loss of information in the extracted features and hampers the ability to capture fine-grained motion details." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.565, + 0.788, + 0.702 + ], + "angle": 0, + "content": "However, previous research has typically focused on these two paradigms separately. Their ideas and technical advantages are complementary and can be augmented, which is still under-explored. To address this gap, we first seek theoretical inspiration about the relationship between generative models and contrastive learning. In detail, we find that generative methods are equivalent to maximum entropy coding. This fact naturally inspires building the generative models with the related idempotent constraint to form a novel idempotent generative model, which is exactly equivalent to spectral contrastive learning but with improved recognition capacities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Building upon this theoretical foundation, we propose a novel idempotent generative model to promote consistency in the feature space. By enforcing idempotence at the feature and distribution levels, our model enriches features with semantic motion information, thereby reducing the domain gap and adapting the generative model better for recognition. Moreover, the features of generative models are span on principal components, which easily leads to dimensional collapse, as recognition tasks primarily rely on discriminative local details. To address this imbalance, we introduce an adapter that fuses encoder and generator features. This integration expands the effective feature dimension of the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.191 + ], + "angle": 0, + "content": "feature space, facilitating more robust and comprehensive representation. Our model attains outstanding results through self-supervised learning in comparison to contemporary state-of-the-art methods." + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.193, + 0.584, + 0.207 + ], + "angle": 0, + "content": "In summary, our contributions are three-folded:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.215, + 0.784, + 0.304 + ], + "angle": 0, + "content": "- We propose an idempotent generative model to combine the benefits of generative pre-training and contrastive learning, which is inspired by the theoretical fact of their intrinsic correlation. This cooperation makes the model focus on extracting more compact information related to motion semantics, and obtain more powerful high-level representation within the generative model framework." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.317, + 0.784, + 0.377 + ], + "angle": 0, + "content": "- We further propose to utilize a multiple idempotency feature constraint. Through feature and distribution idempotency constraints, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.39, + 0.784, + 0.449 + ], + "angle": 0, + "content": "- We employ an adapter to fuse the features from the high-level semantic encoder and low-level skeleton generator from different subspaces to expand the representation dimension. Experiments show that our module improves the effective dimension of the feature space and encodes rich information." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.471, + 0.387, + 0.487 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.501, + 0.551, + 0.515 + ], + "angle": 0, + "content": "2.1 Skeleton-Based Action Recognition" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.784, + 0.584 + ], + "angle": 0, + "content": "Skeleton sequences encode the motion trajectories of human joints, representing rich information about human actions. Thus, skeleton data serves as a suitable modality for human action recognition [25, 42, 66, 68]. Skeleton can be obtained by applying pose estimation algorithms on RGB videos or depth maps [38]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.585, + 0.784, + 0.674 + ], + "angle": 0, + "content": "Early studies focused on extracting hand-designed spatial and temporal domain features from skeleton sequences for human movement recognition [10, 27, 49-51]. In later work, efforts were made to model the positional information and higher-order temporal difference information of the human skeleton [44, 49]. Additionally, graphical models were built by tracking the trajectory of human joints to capture joint information in video sequences [52]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.786, + 0.841 + ], + "angle": 0, + "content": "Recently, there has been a surge of interest in using graph structures for learning models [52]. Graph Neural Network (GNN) is one such model capturing intra-graph dependencies through information transfer between nodes. Various approaches have been proposed, such as spatio-domain inference networks, recurrent neural networks (RNNs), and graph convolutional networks (GCNs), to exploit graph structures for human action recognition [36, 40, 59]. These models automatically learn spatio-temporal patterns from skeleton data, facilitating strong action generalization. Moreover, attention mechanisms, multiscale aggregation schemes, and lightweight convolution operations have been integrated into GCN-based models to enhance their effectiveness and reduce computational costs [6, 25, 41, 66]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.127 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.469, + 0.163 + ], + "angle": 0, + "content": "2.2 Self-Supervised Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.175, + 0.787, + 0.235 + ], + "angle": 0, + "content": "The self-supervised task aims to extract data features from a large amount of unlabelled data [8]. It can be widely used in semantic segmentation, image classification, action recognition and many other tasks [17,31]. These tasks are mainly classified into methods based on reconstruction and on contrastive learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.237, + 0.789, + 0.403 + ], + "angle": 0, + "content": "Reconstruction based approach after masking part of the original data, the network is used to reconstruct the masked part of the data. He et al. [14] proposed Mased Auto-Encoder (MAE) to encode the visible patches and decode the visible and masked patches. This approach has been extended to the video domain and has been used in several studies. These methods typically use a visual Transformer as the backbone network in order to perform the mask reconstruction task. Feichtenhofer et al. [9] extended the image-based masked auto-encoder to use spatio-temporal learning to randomly mask spatio-temporal segments of a video and learn am auto-encoder for reconstruction at the pixel-level reconstruction. Similarly, in MaskFeat, Wei et al. [55] used several video cubes and utilized the model to predict them using the remaining information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.403, + 0.789, + 0.478 + ], + "angle": 0, + "content": "Contrastive learning pushes pairs of positive sample together while pushing pairs of negative sample further apart. To generate negative samples, contrastive learning pairs anchor frames with frames from other videos. There are various ways of generating positive and negative samples, which is the main factor that distinguishes different contrastive methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.48, + 0.789, + 0.661 + ], + "angle": 0, + "content": "Most of these methods generate positive and negative samples by different ways in order to minimize and maximise the distance between them respectively. In the image domain, positive samples are usually generated by enhancing the image in different ways [1, 16, 47, 56, 62]. These enhancements include rotation, cropping, random greyscale and colour change [2]. Scaling these methods in video can be difficult because each video comparison increases the memory required, especially if multiple enhancements are used for multiple positive samples. Another challenge is incorporating the temporal domain into the enhancement. Some methods simply apply the same enhancement in the image to each frame [48]. Some methods include additional frame alignments that may be based on the temporal domain [26]. Finally, some methods rely on motion and optical flow maps as positive samples [33]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.687, + 0.649, + 0.706 + ], + "angle": 0, + "content": "3 Idempotency Generation Network (IGN)" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.722, + 0.747, + 0.755 + ], + "angle": 0, + "content": "3.1 Self-Conditional Generative Models as Maximum Entropy Coding" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.787, + 0.813 + ], + "angle": 0, + "content": "Self-conditional generative modeling [14] is frequently employed as a pre-training task in self-supervised learning. It is generally structured as an auto-encoder. Formally, given the input skeleton data \\(\\mathbf{x}\\), the reconstruction loss is:" + }, + { + "type": "equation", + "bbox": [ + 0.268, + 0.824, + 0.786, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathbb {E} _ {\\mathbf {x} \\sim p _ {\\mathbf {x}}} \\left[ \\mathcal {D} (g (\\mathbf {z}), \\mathbf {x}) \\right] = \\mathbb {E} _ {\\mathbf {x} \\sim p _ {\\mathbf {x}}} \\left[ \\mathbb {E} _ {\\mathbf {z} \\sim p _ {\\mathbf {z}} | \\mathbf {x}} [ - \\log p (\\mathbf {x} | \\mathbf {z}) ] \\right] = H (\\mathbf {x} | \\mathbf {z}), \\qquad (1)\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.236 + ], + "angle": 0, + "content": "where \\(\\mathbf{z} = f(\\mathcal{T}(\\mathbf{x}))\\), \\(f(\\cdot)\\) is the encoder, and \\(\\mathcal{T}(\\cdot)\\) is data transformation. \\(g(\\cdot)\\) is the generator. \\(\\mathcal{D}(\\cdot,\\cdot)\\) is the distance. \\(p_{\\mathbf{x}}\\) is the data distribution and \\(p_{\\mathbf{z}|\\mathbf{x}}\\) is the feature distribution given \\(\\mathbf{x}\\). \\(H(\\cdot|\\cdot)\\) is the conditional entropy. In the context of MAE, this data transformation represents masked data during training. Conversely, in denoising auto-encoders, this transformation signifies adding noise to the input data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.238, + 0.784, + 0.298 + ], + "angle": 0, + "content": "In the context of mutual information, this loss function is equivalent to optimizing the mutual information \\( I(\\mathbf{z};\\mathbf{x}) \\) between the extracted features \\( \\mathbf{z} \\) and the input data \\( \\mathbf{x} \\). Based on the relationship between mutual information and entropy, we get" + }, + { + "type": "equation", + "bbox": [ + 0.349, + 0.31, + 0.784, + 0.325 + ], + "angle": 0, + "content": "\\[\nI (\\mathbf {z}; \\mathbf {x}) = H (\\mathbf {x}) - H (\\mathbf {x} | \\mathbf {z}) = H (\\mathbf {z}) - H (\\mathbf {z} | \\mathbf {x}). \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.335, + 0.784, + 0.41 + ], + "angle": 0, + "content": "Since the entropy of \\(\\mathbf{x}\\) remains constant, decreasing the reconstruction loss is akin to increasing the mutual information. Conversely, as the features \\(\\mathbf{z}\\) are deterministically derived from the data \\(\\mathbf{x}\\) by an encoder \\(f(\\cdot)\\), the entropy \\(H(\\mathbf{z}|\\mathbf{x})\\) tends towards zero. Hence, maximizing the mutual information \\(I(\\mathbf{z};\\mathbf{x})\\) is equivalent to maximizing the entropy of the feature space \\(H(\\mathbf{z})\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.411, + 0.784, + 0.501 + ], + "angle": 0, + "content": "Estimating the true distributions \\( p(\\mathbf{z}) \\) of the representation space is exceedingly challenging. Following works [24, 63], we leverage lossy data coding, a computationally feasible alternative, as a surrogate for the entropy of continuous random variables \\( H(\\mathbf{z}) \\). This approach involves determining the minimal number of bits required to encode a set of samples \\( \\mathbf{Z} = [\\mathbf{z}^1, \\dots, \\mathbf{z}^m] \\in \\mathbb{R}^{d \\times m} \\) subject to a distortion \\( \\varepsilon \\), as defined by the coding length function below [47, 72]:" + }, + { + "type": "equation", + "bbox": [ + 0.363, + 0.512, + 0.784, + 0.543 + ], + "angle": 0, + "content": "\\[\nL = \\left(\\frac {m + d}{2}\\right) \\log \\det \\left(\\mathbf {I} + \\frac {d}{m \\varepsilon^ {2}} \\mathbf {Z} ^ {T} \\mathbf {Z}\\right), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.552, + 0.784, + 0.643 + ], + "angle": 0, + "content": "where \\(\\varepsilon\\) is the upper bound of the expected decoding error between \\(\\mathbf{z} \\in \\mathbf{Z}\\) and the decoded \\(\\hat{\\mathbf{z}}\\). \\(\\operatorname*{det}(\\cdot)\\) is the determinant of a matrix. \\(d\\) is the dimension of the feature space. Utilizing the identity \\(\\operatorname*{det}(\\exp (\\mathbf{A})) = \\exp (\\mathrm{Tr}(\\mathbf{A}))\\), we derive \\(L = \\operatorname{Tr}\\left(\\mu \\log \\left(\\mathbf{I} + \\lambda \\mathbf{Z}^T\\mathbf{Z}\\right)\\right)\\), where \\(\\operatorname{Tr}\\) denotes the trace of the matrix and \\(\\mu = \\frac{m + d}{2}\\), \\(\\lambda = \\frac{d}{m\\varepsilon^2}\\). Finally, we apply a Taylor series expansion to the logarithm of the matrix to obtain:" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.653, + 0.784, + 0.691 + ], + "angle": 0, + "content": "\\[\nL = \\operatorname {T r} \\left(\\mu \\sum_ {n = 1} ^ {\\infty} \\frac {(- 1) ^ {n - 1}}{n} \\left(\\lambda \\mathbf {Z} ^ {T} \\mathbf {Z}\\right) ^ {n}\\right), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.701, + 0.784, + 0.763 + ], + "angle": 0, + "content": "because the features \\(\\mathbf{z}\\) are projected into spherical space \\(\\mathbb{S}^{d - 1}\\), \\(\\operatorname{Tr}\\left(\\mu \\lambda \\mathbf{Z}^T\\mathbf{Z}\\right) = m\\mu \\lambda\\). Hence, the first term does not contribute to the reconstruction learning. In essence, self-conditional generation primarily diminishes the inter-data similarity within the feature space:" + }, + { + "type": "equation", + "bbox": [ + 0.297, + 0.773, + 0.784, + 0.811 + ], + "angle": 0, + "content": "\\[\nL = - \\frac {\\mu \\lambda^ {2}}{2} \\operatorname {T r} \\left(\\left(\\mathbf {Z} ^ {T} \\mathbf {Z}\\right) ^ {2}\\right) - \\mathbf {R} = - \\frac {\\mu \\lambda^ {2}}{2} \\sum_ {i = 1} ^ {m} \\sum_ {j = 1} ^ {m} \\left(\\mathbf {z} _ {i} ^ {T} \\mathbf {z} _ {j}\\right) ^ {2} - \\mathbf {R}, \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.822, + 0.506, + 0.843 + ], + "angle": 0, + "content": "where \\(\\mathbf{R} = \\sum_{n=3}^{\\infty} \\frac{(-1)^n \\mu \\lambda^n}{n} \\operatorname{Tr}\\left(\\left(\\mathbf{Z}^T \\mathbf{Z}\\right)^n\\right)\\)." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.128 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.725, + 0.178 + ], + "angle": 0, + "content": "3.2 Idempotent Generative Models as Spectral Contrastive Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.186, + 0.788, + 0.262 + ], + "angle": 0, + "content": "The idempotence of a self-conditional generative model refers to its stability in re-encoding [57]. More precisely, if we denote the original data as \\(\\mathbf{x}\\), the encoder as \\(f(\\cdot)\\), the encoded feature as \\(\\mathbf{z} = f(\\mathbf{x})\\), the decoder as \\(g(\\cdot)\\), and the reconstruction as \\(\\hat{\\mathbf{x}} = g(\\mathbf{z})\\), then the self-conditional generative model is considered idempotent:" + }, + { + "type": "equation", + "bbox": [ + 0.403, + 0.275, + 0.785, + 0.29 + ], + "angle": 0, + "content": "\\[\nf (\\hat {\\mathbf {x}}) = \\mathbf {z} \\quad \\text {o r} \\quad g (f (\\hat {\\mathbf {x}})) = \\hat {\\mathbf {x}}. \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.301, + 0.786, + 0.332 + ], + "angle": 0, + "content": "Idempotence is frequently employed in the generative domain to augment the perceptual loss of generated images. The idempotent loss is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.342, + 0.785, + 0.359 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {i d e}} = \\left\\| f (\\hat {\\mathbf {x}}) - \\mathbf {z} \\right\\| ^ {2} = - 2 f (\\hat {\\mathbf {x}}) ^ {T} f (\\mathbf {x}), \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.369, + 0.788, + 0.43 + ], + "angle": 0, + "content": "where \\(\\mathbf{z}^T\\mathbf{z} = 1\\) because we normalize the feature space. Therefore, the idempotent generative model maximizes the entropy of the feature space while simultaneously minimizing the feature distance between the data and the generated data. The total loss of the idempotent generative model is expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.22, + 0.442, + 0.818, + 0.564 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} = \\mathcal {L} _ {\\mathrm {i d e}} - L = - 2 \\sum_ {\\mathbf {x}, \\hat {\\mathbf {x}}} p (\\mathbf {x}, \\hat {\\mathbf {x}}) f (\\hat {\\mathbf {x}} _ {i}) ^ {T} f (\\mathbf {x} _ {i}) + \\sum_ {\\mathbf {x}, \\mathbf {x} ^ {\\prime}} p (\\mathbf {x}) p (\\mathbf {x} ^ {\\prime}) \\left(f (\\mathbf {x}) ^ {T} f (\\mathbf {x} ^ {\\prime})\\right) ^ {2} + \\mathbf {R} \\\\ = - 2 \\mathbb {E} _ {(\\mathbf {x}, \\hat {\\mathbf {x}}) \\sim p (\\mathbf {x}, \\hat {\\mathbf {x}})} \\left[ f (\\hat {\\mathbf {x}}) ^ {T} f (\\mathbf {x}) \\right] + \\mathbb {E} _ {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim p (\\mathbf {x}) p (\\mathbf {x} ^ {\\prime})} \\left[ \\left(f (\\mathbf {x}) ^ {T} f (\\mathbf {x} ^ {\\prime})\\right) ^ {2} \\right] + \\mathbf {R} \\\\ = - 2 \\operatorname {T r} \\left(\\mathbf {F} \\mathbf {A} \\mathbf {F} ^ {T}\\right) + \\operatorname {T r} \\left(\\left(\\mathbf {F} ^ {T} \\mathbf {F}\\right) ^ {2}\\right) + \\mathbf {R} = 2 \\operatorname {T r} \\left(\\mathbf {F} \\mathbf {L} \\mathbf {F} ^ {T}\\right) + \\operatorname {T r} \\left(\\left(\\mathbf {F} ^ {T} \\mathbf {F}\\right) ^ {2}\\right) + \\mathbf {R} + \\text {c o n s t} \\\\ = \\left\\| \\mathbf {A} - \\mathbf {F} ^ {T} \\mathbf {F} \\right\\| _ {F} ^ {2} + \\mathbf {R} + \\text {c o n s t}, \\tag {8} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.565, + 0.788, + 0.647 + ], + "angle": 0, + "content": "where \\(\\mathbf{A} \\in \\mathbb{R}^{m \\times m}\\) is the adjacency matrix defined by the data generation. \\(\\mathbf{F} = \\mathbf{Z} \\mathrm{diag}(\\sqrt{p(\\mathbf{x})})\\) The weights \\(\\mathbf{A}_{\\mathbf{x},\\hat{\\mathbf{x}}} = \\frac{p(\\mathbf{x},\\hat{\\mathbf{x}})}{\\sqrt{p(\\mathbf{x})p(\\hat{\\mathbf{x}})}}\\). \\(\\mathbf{L} = \\mathbf{I} - \\mathbf{A}\\) is the Laplacian matrix. This demonstrates its equivalence to spectral contrastive learning. And the advantage of our approach over spectral contrastive learning is that we additionally optimise the residual term \\(\\mathbf{R}\\) to capture higher order information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.647, + 0.788, + 0.723 + ], + "angle": 0, + "content": "Further, we exploit data idempotence and feature idempotence to enhance representation learning and action generation. The unified generative-perceptual model contains both an encoder \\( f(\\cdot) \\) and generator \\( g(\\cdot) \\). And our idempotency constraints pay attention to both the data and the feature distributions, which improves both generation and feature learning." + }, + { + "type": "equation", + "bbox": [ + 0.373, + 0.735, + 0.785, + 0.75 + ], + "angle": 0, + "content": "\\[\n(g \\circ f) (\\mathbf {x}) = \\mathbf {x} \\quad \\text {a n d} \\quad (f \\circ g) (\\mathbf {z}) = \\mathbf {z}. \\tag {9}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.771, + 0.58, + 0.787 + ], + "angle": 0, + "content": "3.3 Relationship to Masked Auto-Encoder" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.841 + ], + "angle": 0, + "content": "As mentioned in Eq. 2, the generative network without idempotent constraints has a conditional entropy \\( H(\\mathbf{z}|\\mathbf{x}) \\) of 0 because the encoding process is deterministic. Idempotent generative networks, on the other hand, treat features \\( \\mathbf{z} \\) as a" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "random variable sampled from the distribution of features across all of the generated data \\(\\hat{\\mathbf{x}}\\) for the same data \\(\\mathbf{x}\\), thus transforming into a non-deterministic process:" + }, + { + "type": "equation", + "bbox": [ + 0.423, + 0.193, + 0.785, + 0.209 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} = f (\\hat {\\mathbf {x}}), \\quad \\hat {\\mathbf {x}} \\sim G (\\mathbf {x}), \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.212, + 0.784, + 0.257 + ], + "angle": 0, + "content": "where \\( G(\\cdot) \\) is the generation process. Therefore, idempotent constraints are essentially about diminishing conditional entropy \\( H(\\mathbf{z}|\\mathbf{x}) \\), which in turn maximizes the mutual information between features and data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.258, + 0.784, + 0.287 + ], + "angle": 0, + "content": "In contrast, methods like MAE implicitly prioritize maximizing feature similarity across masked samples of the same data:" + }, + { + "type": "equation", + "bbox": [ + 0.42, + 0.295, + 0.785, + 0.311 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} = f (\\hat {\\mathbf {x}}), \\quad \\hat {\\mathbf {x}} \\sim M (\\mathbf {x}), \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.317, + 0.784, + 0.378 + ], + "angle": 0, + "content": "where \\( M(\\cdot) \\) is the random masking process. Consequently, features from two distinct data that undergo similar transformed or generated data are clustered into the same class. However, the data obtained through data transformation may not be the real data and thus far from the real data distribution." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.396, + 0.55, + 0.411 + ], + "angle": 0, + "content": "3.4 Relationship to Downstream Tasks" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.417, + 0.784, + 0.478 + ], + "angle": 0, + "content": "Through the analysis of previous work [7, 12, 13, 54, 67] on spectral contrastive learning, the error rate \\( P_{e} = P[\\phi(\\mathbf{x}) \\neq y_{\\mathbf{x}}] \\) of the downstream linear evaluation \\( \\phi(\\cdot) \\) can be bounded by the generated adjacency matrix \\( \\mathbf{A} \\) and clustering error probabilities \\( \\alpha = P[y_{\\mathbf{x}} \\neq y_{\\hat{\\mathbf{x}}}] \\):" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.482, + 0.784, + 0.513 + ], + "angle": 0, + "content": "Theorem 1. If \\(\\lambda_1 \\geq \\lambda_2 \\geq \\dots \\geq \\lambda_m\\) are the eigenvalues of \\(\\mathbf{A}\\), and if the clustering purity is \\(1 - \\alpha\\), we obtain:" + }, + { + "type": "equation", + "bbox": [ + 0.42, + 0.52, + 0.785, + 0.557 + ], + "angle": 0, + "content": "\\[\nP _ {e} \\leq c _ {1} \\sum_ {i = d + 1} ^ {m} \\lambda_ {i} ^ {2} + c _ {2} \\alpha , \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.565, + 0.447, + 0.579 + ], + "angle": 0, + "content": "where \\(c_{1}, c_{2}\\) are some constants." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.784, + 0.688 + ], + "angle": 0, + "content": "This theorem illustrates the constraints on accuracy imposed by the purity \\(1 - \\alpha\\). A large purity and a small number of clusters result in a low error rate. When the diversity in the generated data is insufficient, the sum of small singular values of the adjacency matrix become large, resulting in less tightly clustered groups. Conversely, excessive diversity in the generated data may compromise the preservation of motion information, thereby increasing the error rate in clustering and undermining overall clustering effectiveness." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Therefore, to make the feature space of the idempotent generative model more capable of clustering, it is necessary to increase the diversity of the generated data for a stronger feature consistency constraint. However, a paradox is demonstrated here. Ordinary generative processes result in limited diversity under self-conditional generation due to constraints on the distance between the generated data and the original data. So in order to simultaneously obtain diverse and motion semantics preserving generated data, we propose an idempotent self-conditional generation model based on the diffusion generation model. The diversity of the generated data is provided by the noise sampling process of the diffusion model." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.127 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.148, + 0.784, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.29, + 0.789, + 0.485 + ], + "angle": 0, + "content": "Fig. 1: We perform data augmentations on the data first and then obtain the conditional features through the encoder \\( f(\\cdot) \\). The noise skeleton is then obtained using Diffusion Sampling. The noise skeleton and conditions are fed into the generator \\( g(\\cdot) \\) for denoising. The adapter \\( h(\\cdot) \\) plays a pivotal role in projecting and fusing the features extracted by the encoder \\( f(\\cdot) \\) into the generator's feature space for use as conditions. In the adapter, (a) involves computing similarity using spatio-temporal tokens within the sequence. (b) calculates similar tokens based on the similarity of each token. (c) entails de-correlation by subtracting similar tokens. This integration expands the effective feature dimension of the feature space, facilitating more robust and comprehensive representation. We utilize two losses in our model: Diffusion's noise prediction loss and idempotent feature constraints, which respectively constrain feature similarity and distributional similarity. Thus, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.516, + 0.595, + 0.531 + ], + "angle": 0, + "content": "3.5 Idempotent Diffusion Generation Model" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.543, + 0.788, + 0.633 + ], + "angle": 0, + "content": "Our model consists of three parts, an encoder \\( f(\\cdot) \\), a generator \\( g(\\cdot) \\) and an adapter \\( h(\\cdot) \\). The encoder \\( f(\\cdot) \\) extracts features \\( \\mathbf{z} \\) as conditions for the generator \\( g(\\cdot) \\) and also as inputs to the downstream task classifier \\( \\phi(\\cdot) \\). And the generator \\( g(\\cdot) \\) reconstructs the skeleton data based on the features. The adapter \\( h(\\cdot) \\), in turn, is responsible for projecting and fusing the features extracted by the encoder \\( f(\\cdot) \\) into the generator's feature space to be used as conditions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.634, + 0.788, + 0.693 + ], + "angle": 0, + "content": "Encoder \\( f(\\cdot) \\): We start by applying some data augmentations to the data \\( \\mathbf{x} \\) to obtain data \\( \\tilde{\\mathbf{x}} \\) for increasing diversity. Then, spatio-temporal position embeddings \\( P_{t} \\) and \\( P_{v} \\) are added after projection to the feature space by linear projection:" + }, + { + "type": "equation", + "bbox": [ + 0.394, + 0.696, + 0.785, + 0.712 + ], + "angle": 0, + "content": "\\[\n\\mathbf {z} = \\operatorname {L i n e a r P r o j} (\\tilde {\\mathbf {x}}) + P _ {t} + P _ {v}. \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.78 + ], + "angle": 0, + "content": "Following that, layers of vanilla transformer blocks are employed to extract latent representations \\(\\mathbf{z}\\). Each block consists of a multi-head self-attention (MSA) module and a feed-forward network (FFN) module. Residual connections are utilized within each module, which are then followed by layer normalization (LN)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Generator \\( g(\\cdot) \\): The generator \\( g(\\cdot) \\) and encoder \\( f(\\cdot) \\) maintain the same structure. But the input is the noise data \\( \\mathbf{x}_t \\) obtained by sampling in the diffusion. The generator \\( g(\\cdot) \\) predicts the noise magnitude by taking noise data \\( \\mathbf{x}_t \\) and feature conditions \\( \\mathbf{z} \\) as inputs." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.314 + ], + "angle": 0, + "content": "Adapter \\( h(\\cdot) \\): The adapter \\( h(\\cdot) \\) merges the features extracted by the encoder \\( f(\\cdot) \\) into the generator \\( g(\\cdot) \\). This is necessary because high-level tasks like recognition operate in a different feature space compared to low-level tasks like generation. Recognition tasks necessitate capturing high-frequency action movements while generation primarily focuses on optimizing principal component space (with large singular values), such as walking or waving, which rely more on bottom component subspace like velocity. Thus, we introduce a feature fusion method that decouples principal and bottom component subspace, allowing the encoder features to focus more on high-frequency information, making them more suitable for high-level tasks such as action recognition. These features are then injected into the bottom component feature space of the generator." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.788, + 0.405 + ], + "angle": 0, + "content": "- Manifold Decoupled Feature Fusion Module: To derive discriminative features for use as semantic guides, we draw inspiration from negative samples in contrastive learning. We assume that regions with motion semantics have the lowest similarity to other regions in the same sequence. \\(\\mathbf{z} = [\\mathbf{z}_1,\\dots ,\\mathbf{z}_l]\\in \\mathbb{R}^{d\\times l}\\), where \\(l\\) is the length of tokens of \\(\\mathbf{z}\\). The uniformity loss in contrastive learning is:" + }, + { + "type": "equation", + "bbox": [ + 0.279, + 0.407, + 0.787, + 0.427 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {u n i}} = \\mathbb {E} _ {\\mathbf {z} _ {i}} \\left[ \\log \\mathbb {E} _ {\\mathbf {z} _ {j}} \\left[ \\exp \\left(\\mathbf {z} _ {i} ^ {T} \\mathbf {z} _ {j}\\right) \\right] \\right] = \\operatorname {T r} \\left(\\log \\left(\\deg \\left(\\exp \\left(\\mathbf {z} ^ {T} \\mathbf {z}\\right)\\right)\\right)\\right), \\tag {14}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.435, + 0.469, + 0.451 + ], + "angle": 0, + "content": "the derivative of \\(\\mathcal{L}_{\\mathrm{uni}}\\) is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.381, + 0.462, + 0.787, + 0.492 + ], + "angle": 0, + "content": "\\[\n\\hat {\\mathbf {z}} \\Leftarrow \\mathbf {z} - \\eta \\frac {\\partial \\mathcal {L} _ {\\mathrm {u n i}}}{\\partial \\mathbf {z}} = \\mathbf {z} - \\eta \\mathbf {D} ^ {\\prime - 1} \\mathbf {A} ^ {\\prime} \\mathbf {z}, \\tag {15}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.505, + 0.788, + 0.552 + ], + "angle": 0, + "content": "where \\(\\mathbf{A}' = \\exp(\\mathbf{z}^T\\mathbf{z})\\) and \\(\\mathbf{D}' = \\deg(\\mathbf{A}')\\). \\(\\mathbf{D}'^{-1}\\mathbf{A}' = \\mathrm{SoftMax}(\\mathbf{z}^T\\mathbf{z})\\). \\(\\hat{\\mathbf{z}}\\) removes low-frequency information. Based on this analysis, we extract the high-frequency information of the features as semantic information:" + }, + { + "type": "equation", + "bbox": [ + 0.385, + 0.566, + 0.787, + 0.585 + ], + "angle": 0, + "content": "\\[\n\\hat {\\mathbf {z}} \\Leftarrow (1 + \\eta) \\mathbf {z} - \\eta \\operatorname {S o f t M a x} (\\mathbf {z} ^ {T} \\mathbf {z}) \\mathbf {z}. \\tag {16}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.788, + 0.672 + ], + "angle": 0, + "content": "Through this high-pass filtering, we filter out some low-frequency information of principal component space such as the mean value in the sequences, which is not very meaningful for recognition, and retain the semantic information, which is more important for recognition. This module also mitigates dimensionality collapse, making features more informative." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.673, + 0.788, + 0.706 + ], + "angle": 0, + "content": "We then fuse the features into the generator by replacing LayerNorm (LN) with Adaptive LayerNorm (AdaLN) with the following equation:" + }, + { + "type": "equation", + "bbox": [ + 0.35, + 0.719, + 0.787, + 0.736 + ], + "angle": 0, + "content": "\\[\n\\operatorname {A d a L N} (\\mathbf {h}, \\hat {\\mathbf {z}}, t) = \\hat {\\mathbf {z}} _ {s} \\cdot \\left(\\mathbf {t} _ {s} \\cdot \\operatorname {L N} (\\mathbf {h}) + \\mathbf {t} _ {b}\\right) + \\hat {\\mathbf {z}} _ {b} \\tag {17}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.843 + ], + "angle": 0, + "content": "where \\(\\mathbf{h}\\) represents the hidden representation of the generator, \\((\\mathbf{t}_s,\\mathbf{t}_b)\\) and \\((\\hat{\\mathbf{z}}_s,\\hat{\\mathbf{z}}_b)\\) are obtained from linear projection of timestep embedding \\(t\\) and high-frequency condition \\(\\hat{\\mathbf{z}}\\), respectively. Through AdaLN layers, the condition \\(\\hat{\\mathbf{z}}\\) guides the denoising process by scaling and shifting the normalized hidden representation. Idempotence Generation Loss: Our loss function comprises two components: the noise prediction loss of the diffusion model and the idempotency constraint." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.127 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "- Noise Prediction Loss: The diffusion model is trained by predicting the noise from the input noise data:" + }, + { + "type": "equation", + "bbox": [ + 0.358, + 0.188, + 0.785, + 0.213 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {g e n}} = \\left\\| g \\left(\\mathbf {x} _ {t}, h (\\mathbf {z}), t\\right) - \\varepsilon \\right\\| ^ {2}, \\tag {18}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.209, + 0.645, + 0.223 + ], + "angle": 0, + "content": "\\[\n\\mathbf {x} _ {t} = \\sqrt {\\bar {\\alpha} _ {t}} \\mathbf {x} + \\sqrt {1 - \\bar {\\alpha} _ {t}} \\varepsilon , \\quad \\varepsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}).\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.234, + 0.784, + 0.278 + ], + "angle": 0, + "content": "- Idempotence Constraint: To obtain consistency constraints on features, we adopt two types of idempotency losses, feature idempotency constraint and distribution idempotency constraint." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.279, + 0.784, + 0.322 + ], + "angle": 0, + "content": "1) Feature idempotency constraint performs on features. We use the predicted noise to perform a step of de-noising to get the estimated generated data \\(\\mathbf{x}_0\\):" + }, + { + "type": "equation", + "bbox": [ + 0.365, + 0.323, + 0.784, + 0.353 + ], + "angle": 0, + "content": "\\[\n\\mathbf {x} _ {0} = \\frac {1}{\\sqrt {\\bar {\\alpha} t}} \\left(\\mathbf {x} _ {t} - \\sqrt {1 - \\bar {\\alpha}} g (\\mathbf {x} _ {t}, h (\\mathbf {z}), t)\\right). \\tag {19}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.357, + 0.784, + 0.386 + ], + "angle": 0, + "content": "Therefore, the feature idempotency constraint based on this generated data \\(\\mathbf{x}_0\\) is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.341, + 0.395, + 0.784, + 0.431 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} _ {\\text {i d e} \\_ \\text {f e a t}} = - f (\\mathbf {x}) ^ {T} f \\left(\\mathbf {x} _ {0}, \\mathbf {z} _ {t ^ {\\prime}}, t, t ^ {\\prime}\\right), \\tag {20} \\\\ \\mathbf {z} _ {t ^ {\\prime}} = \\sqrt {\\bar {\\alpha} _ {t ^ {\\prime}}} \\mathbf {z} + \\sqrt {1 - \\bar {\\alpha} _ {t ^ {\\prime}}} \\varepsilon , \\quad \\varepsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}). \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.442, + 0.784, + 0.47 + ], + "angle": 0, + "content": "Since the generated data may be noisy, we input the noisy features and the number of time steps as auxiliary information." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.472, + 0.784, + 0.532 + ], + "angle": 0, + "content": "2) Distribution idempotency constraint aims to align the feature distributions of the generated and original data. It is essential to maintain the manifold structure of the generated data consistent with the manifold of the original data. We capture the feature manifold structure through inter-feature similarity:" + }, + { + "type": "equation", + "bbox": [ + 0.292, + 0.542, + 0.784, + 0.559 + ], + "angle": 0, + "content": "\\[\n\\mathcal {P} \\left(\\mathbf {x} _ {0}\\right) = f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {X} _ {0}\\right) = \\left[ f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {x} _ {0} ^ {1}\\right), \\dots , f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {x} _ {0} ^ {m}\\right) \\right], \\tag {21}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.57, + 0.784, + 0.599 + ], + "angle": 0, + "content": "where \\(\\mathbf{x}_0^i\\) is \\(i\\)-th token data. We align it to the feature structure of the original ground truth data:" + }, + { + "type": "equation", + "bbox": [ + 0.404, + 0.601, + 0.784, + 0.617 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {i d e} - \\text {d i s t}} = \\mathcal {D} \\left(\\mathcal {P} \\left(\\mathbf {x} _ {0}\\right), \\mathcal {P} (\\mathbf {x})\\right), \\tag {22}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.622, + 0.784, + 0.744 + ], + "angle": 0, + "content": "where \\(\\mathcal{D}(\\cdot, \\cdot)\\) is the distance metric between two distributions. The feature idempotency constraint captures richer structural information and allows for the construction of tighter clusters. This is because the adjacency matrix not only connects different generated data of the same data but also connects different data with similar features. Based on this idempotent alignment, we enhance the generative power of the model for stronger perceptual performance, while the encoder learns stronger feature consistency. This results in reduced singular values \\(\\sum_{i=d+1}^{m} \\lambda_i^2\\) of the adjacency matrix and better downstream task performance." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.765, + 0.444, + 0.782 + ], + "angle": 0, + "content": "4 Experiment Results" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.795, + 0.784, + 0.841 + ], + "angle": 0, + "content": "To evaluate the effectiveness of our approach, we conducted experiments on two benchmark datasets: the NTU RGB+D dataset [23, 35] and the PKUMMD dataset [22]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.784, + 0.173 + ], + "angle": 0, + "content": "Table 1: Comparison of action recognition results with unsupervised learning approaches on NTU dataset." + }, + { + "type": "table", + "bbox": [ + 0.264, + 0.185, + 0.737, + 0.391 + ], + "angle": 0, + "content": "
ModelsArchitectureNTU 60NTU 120
xviewxsubxsetxsub
Contrastive Learning:
3s-AimCLR [11]GCN83.477.866.767.9
3s-CPM [64]GCN84.978.769.668.7
3s-CMD [29]GRU90.984.176.174.7
GL-Transformer [18]Transformer83.876.368.766.0
3s-ActCLR [21]GCN88.884.375.774.3
Generative Learning:
3s-Colorization [61]DGCNN87.279.170.869.2
SkeletonMAE [58]GCN77.774.873.572.5
MAMP [28]Transformer89.184.979.178.6
Contrastive Learning & Generative Learning:
CRRL [53]GRU73.867.657.056.2
PCM³ [65]GRU90.483.977.576.3
IGM (Ours)Transformer91.286.281.480.0
" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.403, + 0.465, + 0.444 + ], + "angle": 0, + "content": "Table 2: Comparison of action recognition results under KNN evaluation on NTU 60." + }, + { + "type": "table", + "bbox": [ + 0.23, + 0.457, + 0.453, + 0.601 + ], + "angle": 0, + "content": "
Modelsxviewxsub
Contrastive Learning:
AimCLR [11]71.063.7
SkeleMixCLR [5]72.365.5
Generative Learning:
LongT GAN [69]48.139.1
MAMP [28]70.062.0
IGM w/o Lide67.264.7
IGM w/ Lide_feat70.768.4
IGM w/ Lide_dist72.169.0
IGM (Ours)72.669.3
" + }, + { + "type": "table_caption", + "bbox": [ + 0.481, + 0.403, + 0.788, + 0.446 + ], + "angle": 0, + "content": "Table 3: Comparison of the transfer learning performance on PKUMMD II dataset with linear evaluation pretrained on NTU 60." + }, + { + "type": "table", + "bbox": [ + 0.532, + 0.457, + 0.74, + 0.603 + ], + "angle": 0, + "content": "
Modelsxviewxsub
Finetune:
LongT GAN [69]-44.8
MS2L [20]-45.8
ISC [46]-51.1
Hi-TRS [3]-55.0
3s-CrosSCLR [19]-51.3
3s-AimCLR [11]42.451.6
Linear:
3s-ActCLR [21]44.555.9
MAMP [28]42.053.0
IGM (Ours)45.359.8
" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.632, + 0.444, + 0.648 + ], + "angle": 0, + "content": "4.1 Datasets and Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.658, + 0.787, + 0.718 + ], + "angle": 0, + "content": "NTU RGB+D Dataset 60 (NTU 60) [35] comprises a comprehensive compilation of 56,578 videos, covering 60 unique action labels. Every video includes annotations detailing the positions of 25 joints for each body, illustrating interactions among pairs and individual activities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.794 + ], + "angle": 0, + "content": "NTU RGB+D Dataset 120 (NTU 120) [23] is one of the most comprehensive datasets for recognizing actions. Encompassing 114,480 videos, it spans 120 unique action categories. This dataset documents the performance of actions by 106 individuals across diverse environments, employing 32 distinct recording configurations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.84 + ], + "angle": 0, + "content": "PKU Multi-Modality Dataset (PKUMMD) [22] encompasses 52 action classes and nearly 20,000 instances, with each sample comprising 25 joints, thoroughly tackling the multi-modal 3D comprehension of human actions. The" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.127 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.785, + 0.173 + ], + "angle": 0, + "content": "Table 4: Action recognition accuracy for corruptions of test-time adaptation with single domain shift on NTU-C 60 xsub dataset." + }, + { + "type": "table", + "bbox": [ + 0.303, + 0.185, + 0.703, + 0.27 + ], + "angle": 0, + "content": "
MethodJoint Noise (p, σ2)Part Occlusion
(1.0, 0.1)(1.0, 0.05)(0.5, 0.1)Right Arms
AimCLR [11]6.316.622.028.1
ActCLR [21]12.733.528.630.3
MAMP [28]2.46.15.810.7
IGM (Ours)58.763.065.356.9
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.313, + 0.784, + 0.342 + ], + "angle": 0, + "content": "dataset is partitioned into two segments, with Part II showcasing more demanding data owing to heightened view diversity, resulting in skeleton noise." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.343, + 0.785, + 0.403 + ], + "angle": 0, + "content": "For enhancing network training, all skeleton sequences undergo temporal downsampling to 120 frames. The encoder \\( f(\\cdot) \\) and generator \\( g(\\cdot) \\) are built using the Transformer architecture [59], employing hidden channels configured to a dimension of 256. To assess performance, we employ a fully connected layer \\( \\phi(\\cdot) \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.404, + 0.785, + 0.448 + ], + "angle": 0, + "content": "To refine our network, we employ the Adam optimizer [30]. Training is executed on a single NVIDIA GeForce RTX 4090, employing a batch size of 128, and the network undergoes training for 400 epochs." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.47, + 0.492, + 0.485 + ], + "angle": 0, + "content": "4.2 Evaluation and Comparison" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.494, + 0.785, + 0.522 + ], + "angle": 0, + "content": "For a comprehensive assessment, we conduct comparative analysis of our approach with other methodologies across diverse scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.785, + 0.613 + ], + "angle": 0, + "content": "Linear Evaluation. In the linear evaluation framework, we utilize an encoder \\( f(\\cdot) \\) to process the extracted features and a linear classifier \\( \\phi(\\cdot) \\) for action classification. The evaluation metric employed is the accuracy of action recognition. Notably, the encoder \\( f(\\cdot) \\) remains unchanged throughout the linear evaluation protocol. Our model demonstrates superior performance on the datasets outlined in Table 1 compared to other methodologies." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.785, + 0.688 + ], + "angle": 0, + "content": "KNN Evaluation. In the K-Nearest Neighbors (KNN) evaluation setup, where the fixed encoder \\( f_{q}(\\cdot) \\) extracts features without any trainable parameters, our model showcases superiority in action recognition accuracy on the presented datasets. Table 2 highlights the effectiveness of our approach compared to other methods in this evaluation mechanism." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.785, + 0.779 + ], + "angle": 0, + "content": "Transfer Learning. In the transfer learning scenario, we assess the generalization capability of our model by pretraining it on the source data using a self-supervised task. We then evaluate the model's performance on the target dataset using the linear evaluation mechanism, with the encoder \\( f(\\cdot) \\) maintaining fixed parameters without additional fine-tuning. Our approach demonstrates superior performance in the transfer learning setting, as illustrated in Table 3." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Zero-Shot Domain Generalization. By applying 4 types of corruption to the validation sets of all datasets, we assess the generalization of our proposed method compared to baseline approaches. For joint noise, we add noise with a probability of \\( p \\) with a variance of \\( \\sigma^2 \\) to some joints. We leverage the generative" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.279, + 0.145, + 0.723, + 0.16 + ], + "angle": 0, + "content": "Table 5: Comparison of mask prediction results on NTU 60 xsub." + }, + { + "type": "table", + "bbox": [ + 0.233, + 0.171, + 0.768, + 0.22 + ], + "angle": 0, + "content": "
MethodDDPM [15]MDM [45]SkeletonMAE [58]IGM (Ours)
MPJPE (mm)↓130.287.6329.779.2
FID↓1.781.262.691.18
" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.234, + 0.784, + 0.261 + ], + "angle": 0, + "content": "Table 6: Analysis of module combinations on NTU 60 xsub dataset with the joint stream. \"FFM\" means Feature Fusion Module." + }, + { + "type": "table", + "bbox": [ + 0.318, + 0.275, + 0.688, + 0.37 + ], + "angle": 0, + "content": "
ModuleKNNLinear
FFM h(·)Lide_featuresLide_dist
64.783.3
✓67.685.1
✓✓68.485.5
✓✓69.086.0
✓✓✓69.386.2
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.413, + 0.784, + 0.473 + ], + "angle": 0, + "content": "capability of our model, enabling us to denoise noisy skeleton data at test time. Subsequently, we utilize the generated skeleton data for recognition, significantly enhancing the generalization ability of our model. In Table 4, our proposed approach shows consistent and substantial performance improvements." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.475, + 0.788, + 0.596 + ], + "angle": 0, + "content": "Reconstruction Evaluation. In this section, we implement IGM for mask prediction tasks. We input the masked data into the encoder to extract features as conditions for generation, noting that the reconstruction task does not require adding data transformations to the conditions. Our method is compared with diffusion-based methods DDPM and MDM in Table 5. Figs 3 and 4 show visualizations and feature visualizations of both the generated data and the ground truth data. Despite sharing the same feature distribution, the generated samples exhibit some diversity due to the noise introduced in the conditions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.625, + 0.389, + 0.64 + ], + "angle": 0, + "content": "4.3 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.657, + 0.607, + 0.671 + ], + "angle": 0, + "content": "Here's the modified text for the ablation experiments:" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.673, + 0.786, + 0.734 + ], + "angle": 0, + "content": "Analysis of Module Combination. We investigate the performance of various combinations of modules and observe that each module contributes to a certain degree of improvement. Optimal performance is attained when all three modules are combined. As depicted in Table 6, each module enhances performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Analysis of Mitigating Dimensional Collapse. The analysis points out that the feature space of the generated model is susceptible to dimensionality collapse, resulting in the extracted features losing the information needed for recognition. Fig. 2 shows the feature space of the encoder trained using the generative model and the feature space after Adapter. The token after removing similarity by Adapter network has higher feature values, i.e., the dimension collapse phenomenon is mitigated." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.127 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.153, + 0.472, + 0.282 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.236, + 0.295, + 0.496, + 0.324 + ], + "angle": 0, + "content": "Fig.2: Curve of singular values with the singular value index." + }, + { + "type": "image", + "bbox": [ + 0.529, + 0.154, + 0.741, + 0.276 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.506, + 0.295, + 0.766, + 0.324 + ], + "angle": 0, + "content": "Fig. 3: Visualisation of features in ground truth data and generated data." + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.343, + 0.77, + 0.427 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.439, + 0.788, + 0.496 + ], + "angle": 0, + "content": "Fig. 4: Visualisations of ground truth data and generated data. Above is the ground truth data, and below is the generated data. The conditions provided by the encoder are incorporated with data transformation, resulting in generated data that maintain similar motion information while exhibiting some diversity." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.524, + 0.368, + 0.54 + ], + "angle": 0, + "content": "5 Conclusions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.557, + 0.788, + 0.724 + ], + "angle": 0, + "content": "In this research, we propose the skeleton-based idempotent generative model (IGM) for unsupervised representation learning, presenting a novel framework that maximizes the potential of generative models for representation learning. By implementing idempotence at both the feature level and distribution, our model enriches features with semantic information about motion, making them more suitable for recognition tasks. Additionally, as the generative model primarily focuses on the principal component space, it is more susceptible to dimensional collapse. Conversely, recognition tasks rely more on the bottom subspace. To address this imbalance, we design an adapter that fuses encoder and generator features from different subspaces, thereby enhancing the effective feature dimension of the feature space." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.748, + 0.403, + 0.765 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant No.62172020, and in part by the Key Laboratory of Science, Technology and Standard in Press Industry (Key Laboratory of Intelligent Press Media Technology)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.218 + ], + "angle": 0, + "content": "1. Bachman, P., Hjelm, R.D., Buchwalter, W.: Learning representations by maximizing mutual information across views. In: Proc. Advances in Neural Information Processing Systems (2019) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.219, + 0.785, + 0.26 + ], + "angle": 0, + "content": "2. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: Proc. Int'l Conference for Machine Learning (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.261, + 0.785, + 0.301 + ], + "angle": 0, + "content": "3. Chen, Y., Zhao, L., Yuan, J., Tian, Y., Xia, Z., Geng, S., Han, L., Metaxas, D.N.: Hierarchically self-supervised transformer for human skeleton representation learning. In: Proc. European Conference on Computer Vision (2022) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.302, + 0.785, + 0.342 + ], + "angle": 0, + "content": "4. Chen, Y., Zhang, Z., Yuan, C., Li, B., Deng, Y., Hu, W.: Channel-wise topology refinement graph convolution for skeleton-based action recognition. In: Proc. Int'l Conference on Computer Vision (2021) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.343, + 0.785, + 0.384 + ], + "angle": 0, + "content": "5. Chen, Z., Liu, H., Guo, T., Chen, Z., Song, P., Tang, H.: Contrastive learning from spatio-temporal mixed skeleton sequences for self-supervised skeleton-based action recognition. arXiv:2207.03065 (2022) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.385, + 0.785, + 0.425 + ], + "angle": 0, + "content": "6. Cheng, K., Zhang, Y., He, X., Chen, W., Cheng, J., Lu, H.: Skeleton-based action recognition with shift graph convolutional network. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 183-192 (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.785, + 0.465 + ], + "angle": 0, + "content": "7. Du, T., Wang, Y., Wang, Y.: On the role of discrete tokenization in visual representation learning. In: Proc. Int'l Conference on Learning Representations (2023) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.467, + 0.785, + 0.508 + ], + "angle": 0, + "content": "8. Erhan, D., Bengio, Y., Courville, A., Manzagol, P.A., Vincent, P., Bengio, S.: Why does unsupervised pre-training help deep learning? Journal of Machine Learning Research 11(Feb), 625-660 (2010) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.509, + 0.785, + 0.55 + ], + "angle": 0, + "content": "9. Feichtenhofer, C., Li, Y., He, K., et al.: Masked autoencoders as spatiotemporal learners. Proc. Advances in Neural Information Processing Systems 35, 35946-35958 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.551, + 0.785, + 0.591 + ], + "angle": 0, + "content": "0. Goutsu, Y., Takano, W., Nakamura, Y.: Motion recognition employing multiple kernel learning of fisher vectors using local skeleton features. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.592, + 0.785, + 0.633 + ], + "angle": 0, + "content": "1. Guo, T., Liu, H., Chen, Z., Liu, M., Wang, T., Ding, R.: Contrastive learning from extremely augmented skeleton sequences for self-supervised action recognition. Proc. AAAI Conference on Artificial Intelligence (2022) 2, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.634, + 0.785, + 0.673 + ], + "angle": 0, + "content": "2. Guo, X., Wang, Y., Du, T., Wang, Y.: Contranorm: A contrastive learning perspective on oversmoothing and beyond. arXiv preprint arXiv:2303.06562 (2023) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.674, + 0.785, + 0.714 + ], + "angle": 0, + "content": "3. HaoChen, J., Wei, C., Gaidon, A., Ma, T.: Provable guarantees for self-supervised deep learning with spectral contrastive loss, 2021. arXiv preprint arXiv:2106.041567" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.715, + 0.785, + 0.757 + ], + "angle": 0, + "content": "4. He, K., Chen, X., Xie, S., Li, Y., Dóllar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.785 + ], + "angle": 0, + "content": "5. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Proc. Advances in Neural Information Processing Systems 33, 6840-6851 (2020) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.786, + 0.785, + 0.813 + ], + "angle": 0, + "content": "6. Isola, P., Zoran, D., Krishnan, D., Adelson, E.H.: Learning visual groups from co-occurrences in space and time. arXiv:1511.06811 (2015) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "7. Jang, E., Devin, C., Vanhoucke, V., Levine, S.: Grasp2Vec: Learning object representations from self-supervised grasping. arXiv:1811.06964 (2018) 4" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.127 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "18. Kim, B., Chang, H.J., Kim, J., Choi, J.Y.: Global-local motion transformer for unsupervised skeleton-based action learning. Proc. European Conference on Computer Vision (2022) 2, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.785, + 0.23 + ], + "angle": 0, + "content": "19. Li, L., Wang, M., Ni, B., Wang, H., Yang, J., Zhang, W.: 3D human action representation learning via cross-view consistency pursuit. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2021) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.23, + 0.785, + 0.271 + ], + "angle": 0, + "content": "20. Lin, L., Song, S., Yang, W., Liu, J.: MS2L: Multi-task self-supervised learning for skeleton based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 2, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.271, + 0.785, + 0.298 + ], + "angle": 0, + "content": "21. Lin, L., Zhang, J., Liu, J.: Actionlet-dependent contrastive learning for unsupervised skeleton-based action recognition. In: CVPR (2023) 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.298, + 0.785, + 0.338 + ], + "angle": 0, + "content": "22. Liu, J., Song, S., Liu, C., Li, Y., Hu, Y.: A benchmark dataset and comparison study for multi-modal human action analytics. ACM Trans. on Multimedia Computing, Communications, and Applications (2020) 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.338, + 0.785, + 0.379 + ], + "angle": 0, + "content": "23. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: NTU RGB+D 120: A large-scale benchmark for 3d human activity understanding. IEEE Trans. on Pattern Analysis and Machine Intelligence (2019) 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.379, + 0.785, + 0.42 + ], + "angle": 0, + "content": "24. Liu, X., Wang, Z., Li, Y.L., Wang, S.: Self-supervised learning via maximum entropy coding. Proc. Advances in Neural Information Processing Systems 35, 34091-34105 (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.42, + 0.785, + 0.461 + ], + "angle": 0, + "content": "25. Liu, Z., Zhang, H., Chen, Z., Wang, Z., Ouyang, W.: Disentangling and unifying graph convolutions for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.461, + 0.785, + 0.502 + ], + "angle": 0, + "content": "26. Lorre, G., Rabarisoa, J., Orcesi, A., Ainouz, S., Canu, S.: Temporal contrastive pretraining for video action recognition. In: Proceedings of the IEEE/CVF winter conference on applications of computer vision. pp. 662-670 (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.785, + 0.542 + ], + "angle": 0, + "content": "27. Lv, F., Nevatia, R.: Recognition and segmentation of 3-d human action using hmm and multi-class adaboost. In: Proc. European Conference on Computer Vision (2006) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.542, + 0.785, + 0.583 + ], + "angle": 0, + "content": "28. Mao, Y., Deng, J., Zhou, W., Fang, Y., Ouyang, W., Li, H.: Masked motion predictors are strong 3d action representation learners. In: Proc. Int'l Conference on Computer Vision. pp. 10181-10191 (2023) 2, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.583, + 0.785, + 0.624 + ], + "angle": 0, + "content": "29. Mao, Y., Zhou, W., Lu, Z., Deng, J., Li, H.: CMD: Self-supervised 3d action representation learning with cross-modal mutual distillation. Proc. European Conference on Computer Vision (2022) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.624, + 0.785, + 0.651 + ], + "angle": 0, + "content": "30. Newey, W.K.: Adaptive estimation of regression models via moment restrictions. Journal of Econometrics (1988) 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.651, + 0.785, + 0.677 + ], + "angle": 0, + "content": "31. Owens, A., Efros, A.A.: Audio-visual scene analysis with self-supervised multisensory features. In: Proc. European Conference on Computer Vision (2018) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.677, + 0.785, + 0.718 + ], + "angle": 0, + "content": "32. Peng, W., Hong, X., Chen, H., Zhao, G.: Learning graph convolutional network for skeleton-based human action recognition by neural searching. In: Proc. AAAI Conference on Artificial Intelligence (2020) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.718, + 0.785, + 0.759 + ], + "angle": 0, + "content": "33. Rai, N., Adeli, E., Lee, K.H., Gaidon, A., Niebles, J.C.: Cocon: Cooperative-contrastive learning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 3384-3393 (2021) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.785, + 0.8 + ], + "angle": 0, + "content": "34. Rao, H., Xu, S., Hu, X., Cheng, J., Hu, B.: Augmented skeleton based contrastive action learning with momentum LSTM for unsupervised action recognition. Information Sciences (2021) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "35. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: NTU RGB+D: A large scale dataset for 3d human activity analysis. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 10, 11" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.455, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idempotent Unsupervised Representation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "36. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Skeleton-based action recognition with directed graph neural networks. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 7912-7921 (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "37. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Two-stream adaptive graph convolutional networks for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.232, + 0.788, + 0.272 + ], + "angle": 0, + "content": "38. Shotton, J., Sharp, T., Kipman, A., Fitzgibbon, A., Finocchio, M., Blake, A., Cook, M., Moore, R.: Real-time human pose recognition in parts from single depth images. Communications of the ACM (2013) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.273, + 0.788, + 0.314 + ], + "angle": 0, + "content": "39. Si, C., Chen, W., Wang, W., Wang, L., Tan, T.: An attention enhanced graph convolutional LSTM network for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.315, + 0.788, + 0.357 + ], + "angle": 0, + "content": "40. Si, C., Jing, Y., Wang, W., Wang, L., Tan, T.: Skeleton-based action recognition with spatial reasoning and temporal stack learning. In: Proc. European Conference on Computer Vision. pp. 103-118 (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.357, + 0.788, + 0.398 + ], + "angle": 0, + "content": "41. Song, Y.F., Zhang, Z., Shan, C., Wang, L.: Constructing stronger and faster baselines for skeleton-based action recognition. IEEE transactions on pattern analysis and machine intelligence 45(2), 1474-1488 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.398, + 0.788, + 0.439 + ], + "angle": 0, + "content": "42. Song, Y., Zhang, Z., Shan, C., Wang, L.: Stronger, faster and more explainable: A graph convolutional baseline for skeleton-based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 1, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.439, + 0.788, + 0.481 + ], + "angle": 0, + "content": "43. Su, K., Liu, X., Shlizerman, E.: Predict & cluster: Unsupervised skeleton based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.481, + 0.788, + 0.522 + ], + "angle": 0, + "content": "44. Tao, L., Vidal, R.: Moving poselets: A discriminative and interpretable skeletal motion representation for action recognition. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.522, + 0.788, + 0.55 + ], + "angle": 0, + "content": "45. Tevet, G., Raab, S., Gordon, B., Shafir, Y., Cohen-Or, D., Bermano, A.H.: Human motion diffusion model. arXiv preprint arXiv:2209.14916 (2022) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.55, + 0.788, + 0.577 + ], + "angle": 0, + "content": "46. Thoker, F.M., Doughty, H., Snoek, C.G.: Skeleton-contrastive 3D action representation learning. In: Proc. ACM Int'l Conference on Multimedia (2021) 2, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.577, + 0.788, + 0.605 + ], + "angle": 0, + "content": "47. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. arXiv:1906.05849 (2019) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.606, + 0.788, + 0.634 + ], + "angle": 0, + "content": "48. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. In: Proc. European Conference on Computer Vision. pp. 776-794. Springer (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.634, + 0.788, + 0.675 + ], + "angle": 0, + "content": "49. Vemulapalli, R., Arrate, F., Chellappa, R.: Human action recognition by representing 3d skeletons as points in a lie group. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2014) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.675, + 0.788, + 0.715 + ], + "angle": 0, + "content": "50. Vemulapalli, R., Chellapa, R.: Rolling rotations for recognizing human actions from 3d skeletal data. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.716, + 0.788, + 0.758 + ], + "angle": 0, + "content": "51. Wang, J., Liu, Z., Wu, Y., Yuan, J.: Mining actionlet ensemble for action recognition with depth cameras. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2012) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.758, + 0.788, + 0.799 + ], + "angle": 0, + "content": "52. Wang, P., Yuan, C., Hu, W., Li, B., Zhang, Y.: Graph based skeleton motion representation and similarity measurement for action recognition. In: Proc. European Conference on Computer Vision. pp. 370-385 (2016) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.788, + 0.841 + ], + "angle": 0, + "content": "53. Wang, P., Wen, J., Si, C., Qian, Y., Wang, L.: Contrast-reconstruction representation learning for self-supervised skeleton-based action recognition. IEEE Trans. on Image Processing 31, 6224-6238 (2022) 11" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.335, + 0.127 + ], + "angle": 0, + "content": "Lin et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "54. Wang, Y., Zhang, Q., Du, T., Yang, J., Lin, Z., Wang, Y.: A message passing perspective on learning dynamics of contrastive learning. arXiv preprint arXiv:2303.04435 (2023) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.785, + 0.232 + ], + "angle": 0, + "content": "55. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 14668-14678 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.785, + 0.272 + ], + "angle": 0, + "content": "56. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2018) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.785, + 0.313 + ], + "angle": 0, + "content": "57. Xu, T., Zhu, Z., He, D., Li, Y., Guo, L., Wang, Y., Wang, Z., Qin, H., Wang, Y., Liu, J., et al.: Idempotence and perceptual image compression. arXiv preprint arXiv:2401.08920 (2024) 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.785, + 0.355 + ], + "angle": 0, + "content": "58. Yan, H., Liu, Y., Wei, Y., Li, Z., Li, G., Lin, L.: Skeletonmae: graph-based masked autoencoder for skeleton sequence pre-training. In: Proc. Int'l Conference on Computer Vision. pp. 5606-5618 (2023) 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.357, + 0.785, + 0.396 + ], + "angle": 0, + "content": "59. Yan, S., Xiong, Y., Lin, D.: Spatial temporal graph convolutional networks for skeleton-based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 3, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.438 + ], + "angle": 0, + "content": "60. Yang, S., Liu, J., Lu, S., Er, M.H., Kot, A.C.: Skeleton cloud colorization for unsupervised 3D action representation learning. In: Proc. Int'l Conference on Computer Vision (2021) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.785, + 0.481 + ], + "angle": 0, + "content": "61. Yang, S., Liu, J., Lu, S., Hwa, E.M., Hu, Y., Kot, A.C.: Self-supervised 3d action representation learning with skeleton cloud colorization. IEEE Trans. on Pattern Analysis and Machine Intelligence (2023) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.481, + 0.785, + 0.522 + ], + "angle": 0, + "content": "62. Ye, M., Zhang, X., Yuen, P.C., Chang, S.F.: Unsupervised embedding learning via invariant and spreading instance feature. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.785, + 0.563 + ], + "angle": 0, + "content": "63. Yu, Y., Chan, K.H.R., You, C., Song, C., Ma, Y.: Learning diverse and discriminative representations via the principle of maximal coding rate reduction. Proc. Advances in Neural Information Processing Systems 33, 9422-9434 (2020) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.785, + 0.605 + ], + "angle": 0, + "content": "64. Zhang, H., Hou, Y., Zhang, W., Li, W.: Contrastive positive mining for unsupervised 3d action representation learning. Proc. European Conference on Computer Vision (2022) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.785, + 0.646 + ], + "angle": 0, + "content": "65. Zhang, J., Lin, L., Liu, J.: Prompted contrast with masked motion modeling: Towards versatile 3d action representation learning. In: Proc. ACM Int'l Conference on Multimedia. pp. 7175-7183 (2023) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.785, + 0.688 + ], + "angle": 0, + "content": "66. Zhang, P., Lan, C., Zeng, W., Xing, J., Xue, J., Zheng, N.: Semantics-guided neural networks for efficient skeleton-based human action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.785, + 0.729 + ], + "angle": 0, + "content": "67. Zhang, Q., Wang, Y., Wang, Y.: How mask matters: Towards theoretical understandings of masked autoencoders. Proc. Advances in Neural Information Processing Systems 35, 27127-27139 (2022) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.785, + 0.771 + ], + "angle": 0, + "content": "68. Zhang, X., Xu, C., Tao, D.: Context aware graph convolution for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "69. Zheng, N., Wen, J., Liu, R., Long, L., Dai, J., Gong, Z.: Unsupervised representation learning with long-term dynamics for skeleton based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 2, 11" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.812 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_origin.pdf b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..513569a22dddd0fe753baa16acc48a9e019aaec7 --- /dev/null +++ b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/68806bd0-5a04-4338-b233-a3a1a3acb21f_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0c54011b8d24a941b99396186f032e9d92b38046af24b319f36b4682c3100ab9 +size 1605454 diff --git a/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/full.md b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/full.md new file mode 100644 index 0000000000000000000000000000000000000000..93d4eeb0358010b7aa286a40420fd2b1faa76e02 --- /dev/null +++ b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/full.md @@ -0,0 +1,402 @@ +# Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition + +Lilang Lin, Lehong Wu, Jiahang Zhang, and Jiaying Liu + +Wangxuan Institute of Computer Technology, Peking University {linlilang, zjh2020, liujiaying}@pku.edu.cn aladonwh@pku.stu.edu.cn + +Abstract. Generative models, as a powerful technique for generation, also gradually become a critical tool for recognition tasks. However, in skeleton-based action recognition, the features obtained from existing pre-trained generative methods contain redundant information unrelated to recognition, which contradicts the nature of the skeleton's spatially sparse and temporally consistent properties, leading to undesirable performance. To address this challenge, we make efforts to bridge the gap in theory and methodology and propose a novel skeleton-based idempotent generative model (IGM) for unsupervised representation learning. More specifically, we first theoretically demonstrate the equivalence between generative models and maximum entropy coding, which demonstrates a potential route that makes the features of generative models more compact by introducing contrastive learning. To this end, we introduce the idempotency constraint to form a stronger consistency regularization in the feature space, to push the features only to maintain the critical information of motion semantics for the recognition task. Our extensive experiments on benchmark datasets, NTU RGB+D and PKUMMD, demonstrate the effectiveness of our proposed method. On the NTU 60 xsub dataset, we observe a performance improvement from $84.6\%$ to $86.2\%$ . Furthermore, in zero-shot adaptation scenarios, our model demonstrates significant efficacy by achieving promising results in cases that were previously unrecognizable. Our project is available at https://github.com/LanglandsLin/IGM. + +Keywords: Self-supervised learning $\cdot$ skeleton-based action recognition $\cdot$ contrastive learning + +# 1 Introduction + +Skeletons represent human joints through 3D coordinate locations, providing a compact and efficient modality of representing human motion compared to RGB videos and depth data. Owing to their simplicity and superior discriminative capabilities for analysis, skeleton representations have been extensively employed in the field of action recognition tasks [25, 32, 42, 43, 66, 68]. + +Supervised skeleton-based action recognition methods [4,37,39] have demonstrated remarkable performance. However, they heavily rely on vast amounts of labeled training data, the collection of which can be a costly and time-consuming process. In order to reduce the reliance on fully supervised paradigms, self-supervised learning approaches have been explored in the context of skeleton-based action recognition [20, 43, 46, 69]. + +In the context of self-supervised pretraining paradigms, most methods can be broadly classified into two categories: generative learning-based [18, 43, 60] and contrastive learning-based approaches. Generative learning-based methods typically model the spatial-temporal correlations by predicting or reconstructing the masked skeleton data. With long-term global motion dynamics, Zheng et al. [69] were the pioneers in introducing the concept of reconstructing masked skeleton data. The structure of Masked Auto-Encoder (MAE) was used by Mao et al. [28] to predict the velocity of the masked part thus obtaining motion information modelling. However, skeleton data is by nature spatially sparse and temporal consistent while MAE's feature preserves too much appearance information, which will interfere with the recognition tasks. + +On the other route, contrastive learning-based methods also have recently demonstrated remarkable potential. These methods utilize skeleton transformations to generate positive pairs and aim to maintain consistency in the embedding space. Rao et al. [34] introduced shearing and cropping as data augmentation techniques. Guo et al. [11] extended these efforts by suggesting additional augmentations, such as rotation, masking, and flipping, to further enhance the consistency of contrastive learning. Contrastive learning, aimed at high-level tasks like recognition, often requires data transformation to filter out task-irrelevant information. This process results in a significant loss of information in the extracted features and hampers the ability to capture fine-grained motion details. + +However, previous research has typically focused on these two paradigms separately. Their ideas and technical advantages are complementary and can be augmented, which is still under-explored. To address this gap, we first seek theoretical inspiration about the relationship between generative models and contrastive learning. In detail, we find that generative methods are equivalent to maximum entropy coding. This fact naturally inspires building the generative models with the related idempotent constraint to form a novel idempotent generative model, which is exactly equivalent to spectral contrastive learning but with improved recognition capacities. + +Building upon this theoretical foundation, we propose a novel idempotent generative model to promote consistency in the feature space. By enforcing idempotence at the feature and distribution levels, our model enriches features with semantic motion information, thereby reducing the domain gap and adapting the generative model better for recognition. Moreover, the features of generative models are span on principal components, which easily leads to dimensional collapse, as recognition tasks primarily rely on discriminative local details. To address this imbalance, we introduce an adapter that fuses encoder and generator features. This integration expands the effective feature dimension of the + +feature space, facilitating more robust and comprehensive representation. Our model attains outstanding results through self-supervised learning in comparison to contemporary state-of-the-art methods. + +In summary, our contributions are three-folded: + +- We propose an idempotent generative model to combine the benefits of generative pre-training and contrastive learning, which is inspired by the theoretical fact of their intrinsic correlation. This cooperation makes the model focus on extracting more compact information related to motion semantics, and obtain more powerful high-level representation within the generative model framework. + +- We further propose to utilize a multiple idempotency feature constraint. Through feature and distribution idempotency constraints, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model. + +- We employ an adapter to fuse the features from the high-level semantic encoder and low-level skeleton generator from different subspaces to expand the representation dimension. Experiments show that our module improves the effective dimension of the feature space and encodes rich information. + +# 2 Related Work + +# 2.1 Skeleton-Based Action Recognition + +Skeleton sequences encode the motion trajectories of human joints, representing rich information about human actions. Thus, skeleton data serves as a suitable modality for human action recognition [25, 42, 66, 68]. Skeleton can be obtained by applying pose estimation algorithms on RGB videos or depth maps [38]. + +Early studies focused on extracting hand-designed spatial and temporal domain features from skeleton sequences for human movement recognition [10, 27, 49-51]. In later work, efforts were made to model the positional information and higher-order temporal difference information of the human skeleton [44, 49]. Additionally, graphical models were built by tracking the trajectory of human joints to capture joint information in video sequences [52]. + +Recently, there has been a surge of interest in using graph structures for learning models [52]. Graph Neural Network (GNN) is one such model capturing intra-graph dependencies through information transfer between nodes. Various approaches have been proposed, such as spatio-domain inference networks, recurrent neural networks (RNNs), and graph convolutional networks (GCNs), to exploit graph structures for human action recognition [36, 40, 59]. These models automatically learn spatio-temporal patterns from skeleton data, facilitating strong action generalization. Moreover, attention mechanisms, multiscale aggregation schemes, and lightweight convolution operations have been integrated into GCN-based models to enhance their effectiveness and reduce computational costs [6, 25, 41, 66]. + +# 2.2 Self-Supervised Learning + +The self-supervised task aims to extract data features from a large amount of unlabelled data [8]. It can be widely used in semantic segmentation, image classification, action recognition and many other tasks [17,31]. These tasks are mainly classified into methods based on reconstruction and on contrastive learning. + +Reconstruction based approach after masking part of the original data, the network is used to reconstruct the masked part of the data. He et al. [14] proposed Mased Auto-Encoder (MAE) to encode the visible patches and decode the visible and masked patches. This approach has been extended to the video domain and has been used in several studies. These methods typically use a visual Transformer as the backbone network in order to perform the mask reconstruction task. Feichtenhofer et al. [9] extended the image-based masked auto-encoder to use spatio-temporal learning to randomly mask spatio-temporal segments of a video and learn am auto-encoder for reconstruction at the pixel-level reconstruction. Similarly, in MaskFeat, Wei et al. [55] used several video cubes and utilized the model to predict them using the remaining information. + +Contrastive learning pushes pairs of positive sample together while pushing pairs of negative sample further apart. To generate negative samples, contrastive learning pairs anchor frames with frames from other videos. There are various ways of generating positive and negative samples, which is the main factor that distinguishes different contrastive methods. + +Most of these methods generate positive and negative samples by different ways in order to minimize and maximise the distance between them respectively. In the image domain, positive samples are usually generated by enhancing the image in different ways [1, 16, 47, 56, 62]. These enhancements include rotation, cropping, random greyscale and colour change [2]. Scaling these methods in video can be difficult because each video comparison increases the memory required, especially if multiple enhancements are used for multiple positive samples. Another challenge is incorporating the temporal domain into the enhancement. Some methods simply apply the same enhancement in the image to each frame [48]. Some methods include additional frame alignments that may be based on the temporal domain [26]. Finally, some methods rely on motion and optical flow maps as positive samples [33]. + +# 3 Idempotency Generation Network (IGN) + +# 3.1 Self-Conditional Generative Models as Maximum Entropy Coding + +Self-conditional generative modeling [14] is frequently employed as a pre-training task in self-supervised learning. It is generally structured as an auto-encoder. Formally, given the input skeleton data $\mathbf{x}$ , the reconstruction loss is: + +$$ +\mathcal {L} = \mathbb {E} _ {\mathbf {x} \sim p _ {\mathbf {x}}} \left[ \mathcal {D} (g (\mathbf {z}), \mathbf {x}) \right] = \mathbb {E} _ {\mathbf {x} \sim p _ {\mathbf {x}}} \left[ \mathbb {E} _ {\mathbf {z} \sim p _ {\mathbf {z}} | \mathbf {x}} [ - \log p (\mathbf {x} | \mathbf {z}) ] \right] = H (\mathbf {x} | \mathbf {z}), \qquad (1) +$$ + +where $\mathbf{z} = f(\mathcal{T}(\mathbf{x}))$ , $f(\cdot)$ is the encoder, and $\mathcal{T}(\cdot)$ is data transformation. $g(\cdot)$ is the generator. $\mathcal{D}(\cdot,\cdot)$ is the distance. $p_{\mathbf{x}}$ is the data distribution and $p_{\mathbf{z}|\mathbf{x}}$ is the feature distribution given $\mathbf{x}$ . $H(\cdot|\cdot)$ is the conditional entropy. In the context of MAE, this data transformation represents masked data during training. Conversely, in denoising auto-encoders, this transformation signifies adding noise to the input data. + +In the context of mutual information, this loss function is equivalent to optimizing the mutual information $I(\mathbf{z};\mathbf{x})$ between the extracted features $\mathbf{z}$ and the input data $\mathbf{x}$ . Based on the relationship between mutual information and entropy, we get + +$$ +I (\mathbf {z}; \mathbf {x}) = H (\mathbf {x}) - H (\mathbf {x} | \mathbf {z}) = H (\mathbf {z}) - H (\mathbf {z} | \mathbf {x}). \tag {2} +$$ + +Since the entropy of $\mathbf{x}$ remains constant, decreasing the reconstruction loss is akin to increasing the mutual information. Conversely, as the features $\mathbf{z}$ are deterministically derived from the data $\mathbf{x}$ by an encoder $f(\cdot)$ , the entropy $H(\mathbf{z}|\mathbf{x})$ tends towards zero. Hence, maximizing the mutual information $I(\mathbf{z};\mathbf{x})$ is equivalent to maximizing the entropy of the feature space $H(\mathbf{z})$ . + +Estimating the true distributions $p(\mathbf{z})$ of the representation space is exceedingly challenging. Following works [24, 63], we leverage lossy data coding, a computationally feasible alternative, as a surrogate for the entropy of continuous random variables $H(\mathbf{z})$ . This approach involves determining the minimal number of bits required to encode a set of samples $\mathbf{Z} = [\mathbf{z}^1, \dots, \mathbf{z}^m] \in \mathbb{R}^{d \times m}$ subject to a distortion $\varepsilon$ , as defined by the coding length function below [47, 72]: + +$$ +L = \left(\frac {m + d}{2}\right) \log \det \left(\mathbf {I} + \frac {d}{m \varepsilon^ {2}} \mathbf {Z} ^ {T} \mathbf {Z}\right), \tag {3} +$$ + +where $\varepsilon$ is the upper bound of the expected decoding error between $\mathbf{z} \in \mathbf{Z}$ and the decoded $\hat{\mathbf{z}}$ . $\operatorname*{det}(\cdot)$ is the determinant of a matrix. $d$ is the dimension of the feature space. Utilizing the identity $\operatorname*{det}(\exp (\mathbf{A})) = \exp (\mathrm{Tr}(\mathbf{A}))$ , we derive $L = \operatorname{Tr}\left(\mu \log \left(\mathbf{I} + \lambda \mathbf{Z}^T\mathbf{Z}\right)\right)$ , where $\operatorname{Tr}$ denotes the trace of the matrix and $\mu = \frac{m + d}{2}$ , $\lambda = \frac{d}{m\varepsilon^2}$ . Finally, we apply a Taylor series expansion to the logarithm of the matrix to obtain: + +$$ +L = \operatorname {T r} \left(\mu \sum_ {n = 1} ^ {\infty} \frac {(- 1) ^ {n - 1}}{n} \left(\lambda \mathbf {Z} ^ {T} \mathbf {Z}\right) ^ {n}\right), \tag {4} +$$ + +because the features $\mathbf{z}$ are projected into spherical space $\mathbb{S}^{d - 1}$ , $\operatorname{Tr}\left(\mu \lambda \mathbf{Z}^T\mathbf{Z}\right) = m\mu \lambda$ . Hence, the first term does not contribute to the reconstruction learning. In essence, self-conditional generation primarily diminishes the inter-data similarity within the feature space: + +$$ +L = - \frac {\mu \lambda^ {2}}{2} \operatorname {T r} \left(\left(\mathbf {Z} ^ {T} \mathbf {Z}\right) ^ {2}\right) - \mathbf {R} = - \frac {\mu \lambda^ {2}}{2} \sum_ {i = 1} ^ {m} \sum_ {j = 1} ^ {m} \left(\mathbf {z} _ {i} ^ {T} \mathbf {z} _ {j}\right) ^ {2} - \mathbf {R}, \tag {5} +$$ + +where $\mathbf{R} = \sum_{n=3}^{\infty} \frac{(-1)^n \mu \lambda^n}{n} \operatorname{Tr}\left(\left(\mathbf{Z}^T \mathbf{Z}\right)^n\right)$ . + +# 3.2 Idempotent Generative Models as Spectral Contrastive Learning + +The idempotence of a self-conditional generative model refers to its stability in re-encoding [57]. More precisely, if we denote the original data as $\mathbf{x}$ , the encoder as $f(\cdot)$ , the encoded feature as $\mathbf{z} = f(\mathbf{x})$ , the decoder as $g(\cdot)$ , and the reconstruction as $\hat{\mathbf{x}} = g(\mathbf{z})$ , then the self-conditional generative model is considered idempotent: + +$$ +f (\hat {\mathbf {x}}) = \mathbf {z} \quad \text {o r} \quad g (f (\hat {\mathbf {x}})) = \hat {\mathbf {x}}. \tag {6} +$$ + +Idempotence is frequently employed in the generative domain to augment the perceptual loss of generated images. The idempotent loss is formulated as: + +$$ +\mathcal {L} _ {\mathrm {i d e}} = \left\| f (\hat {\mathbf {x}}) - \mathbf {z} \right\| ^ {2} = - 2 f (\hat {\mathbf {x}}) ^ {T} f (\mathbf {x}), \tag {7} +$$ + +where $\mathbf{z}^T\mathbf{z} = 1$ because we normalize the feature space. Therefore, the idempotent generative model maximizes the entropy of the feature space while simultaneously minimizing the feature distance between the data and the generated data. The total loss of the idempotent generative model is expressed as: + +$$ +\begin{array}{l} \mathcal {L} = \mathcal {L} _ {\mathrm {i d e}} - L = - 2 \sum_ {\mathbf {x}, \hat {\mathbf {x}}} p (\mathbf {x}, \hat {\mathbf {x}}) f (\hat {\mathbf {x}} _ {i}) ^ {T} f (\mathbf {x} _ {i}) + \sum_ {\mathbf {x}, \mathbf {x} ^ {\prime}} p (\mathbf {x}) p (\mathbf {x} ^ {\prime}) \left(f (\mathbf {x}) ^ {T} f (\mathbf {x} ^ {\prime})\right) ^ {2} + \mathbf {R} \\ = - 2 \mathbb {E} _ {(\mathbf {x}, \hat {\mathbf {x}}) \sim p (\mathbf {x}, \hat {\mathbf {x}})} \left[ f (\hat {\mathbf {x}}) ^ {T} f (\mathbf {x}) \right] + \mathbb {E} _ {(\mathbf {x}, \mathbf {x} ^ {\prime}) \sim p (\mathbf {x}) p (\mathbf {x} ^ {\prime})} \left[ \left(f (\mathbf {x}) ^ {T} f (\mathbf {x} ^ {\prime})\right) ^ {2} \right] + \mathbf {R} \\ = - 2 \operatorname {T r} \left(\mathbf {F} \mathbf {A} \mathbf {F} ^ {T}\right) + \operatorname {T r} \left(\left(\mathbf {F} ^ {T} \mathbf {F}\right) ^ {2}\right) + \mathbf {R} = 2 \operatorname {T r} \left(\mathbf {F} \mathbf {L} \mathbf {F} ^ {T}\right) + \operatorname {T r} \left(\left(\mathbf {F} ^ {T} \mathbf {F}\right) ^ {2}\right) + \mathbf {R} + \text {c o n s t} \\ = \left\| \mathbf {A} - \mathbf {F} ^ {T} \mathbf {F} \right\| _ {F} ^ {2} + \mathbf {R} + \text {c o n s t}, \tag {8} \\ \end{array} +$$ + +where $\mathbf{A} \in \mathbb{R}^{m \times m}$ is the adjacency matrix defined by the data generation. $\mathbf{F} = \mathbf{Z} \mathrm{diag}(\sqrt{p(\mathbf{x})})$ The weights $\mathbf{A}_{\mathbf{x},\hat{\mathbf{x}}} = \frac{p(\mathbf{x},\hat{\mathbf{x}})}{\sqrt{p(\mathbf{x})p(\hat{\mathbf{x}})}}$ . $\mathbf{L} = \mathbf{I} - \mathbf{A}$ is the Laplacian matrix. This demonstrates its equivalence to spectral contrastive learning. And the advantage of our approach over spectral contrastive learning is that we additionally optimise the residual term $\mathbf{R}$ to capture higher order information. + +Further, we exploit data idempotence and feature idempotence to enhance representation learning and action generation. The unified generative-perceptual model contains both an encoder $f(\cdot)$ and generator $g(\cdot)$ . And our idempotency constraints pay attention to both the data and the feature distributions, which improves both generation and feature learning. + +$$ +(g \circ f) (\mathbf {x}) = \mathbf {x} \quad \text {a n d} \quad (f \circ g) (\mathbf {z}) = \mathbf {z}. \tag {9} +$$ + +# 3.3 Relationship to Masked Auto-Encoder + +As mentioned in Eq. 2, the generative network without idempotent constraints has a conditional entropy $H(\mathbf{z}|\mathbf{x})$ of 0 because the encoding process is deterministic. Idempotent generative networks, on the other hand, treat features $\mathbf{z}$ as a + +random variable sampled from the distribution of features across all of the generated data $\hat{\mathbf{x}}$ for the same data $\mathbf{x}$ , thus transforming into a non-deterministic process: + +$$ +\mathbf {z} = f (\hat {\mathbf {x}}), \quad \hat {\mathbf {x}} \sim G (\mathbf {x}), \tag {10} +$$ + +where $G(\cdot)$ is the generation process. Therefore, idempotent constraints are essentially about diminishing conditional entropy $H(\mathbf{z}|\mathbf{x})$ , which in turn maximizes the mutual information between features and data. + +In contrast, methods like MAE implicitly prioritize maximizing feature similarity across masked samples of the same data: + +$$ +\mathbf {z} = f (\hat {\mathbf {x}}), \quad \hat {\mathbf {x}} \sim M (\mathbf {x}), \tag {11} +$$ + +where $M(\cdot)$ is the random masking process. Consequently, features from two distinct data that undergo similar transformed or generated data are clustered into the same class. However, the data obtained through data transformation may not be the real data and thus far from the real data distribution. + +# 3.4 Relationship to Downstream Tasks + +Through the analysis of previous work [7, 12, 13, 54, 67] on spectral contrastive learning, the error rate $P_{e} = P[\phi(\mathbf{x}) \neq y_{\mathbf{x}}]$ of the downstream linear evaluation $\phi(\cdot)$ can be bounded by the generated adjacency matrix $\mathbf{A}$ and clustering error probabilities $\alpha = P[y_{\mathbf{x}} \neq y_{\hat{\mathbf{x}}}]$ : + +Theorem 1. If $\lambda_1 \geq \lambda_2 \geq \dots \geq \lambda_m$ are the eigenvalues of $\mathbf{A}$ , and if the clustering purity is $1 - \alpha$ , we obtain: + +$$ +P _ {e} \leq c _ {1} \sum_ {i = d + 1} ^ {m} \lambda_ {i} ^ {2} + c _ {2} \alpha , \tag {12} +$$ + +where $c_{1}, c_{2}$ are some constants. + +This theorem illustrates the constraints on accuracy imposed by the purity $1 - \alpha$ . A large purity and a small number of clusters result in a low error rate. When the diversity in the generated data is insufficient, the sum of small singular values of the adjacency matrix become large, resulting in less tightly clustered groups. Conversely, excessive diversity in the generated data may compromise the preservation of motion information, thereby increasing the error rate in clustering and undermining overall clustering effectiveness. + +Therefore, to make the feature space of the idempotent generative model more capable of clustering, it is necessary to increase the diversity of the generated data for a stronger feature consistency constraint. However, a paradox is demonstrated here. Ordinary generative processes result in limited diversity under self-conditional generation due to constraints on the distance between the generated data and the original data. So in order to simultaneously obtain diverse and motion semantics preserving generated data, we propose an idempotent self-conditional generation model based on the diffusion generation model. The diversity of the generated data is provided by the noise sampling process of the diffusion model. + +![](images/fd3a0edb948962198734cff9ef6a12384b04a2d15fd8ea6976b1af3f11b098a0.jpg) +Fig. 1: We perform data augmentations on the data first and then obtain the conditional features through the encoder $f(\cdot)$ . The noise skeleton is then obtained using Diffusion Sampling. The noise skeleton and conditions are fed into the generator $g(\cdot)$ for denoising. The adapter $h(\cdot)$ plays a pivotal role in projecting and fusing the features extracted by the encoder $f(\cdot)$ into the generator's feature space for use as conditions. In the adapter, (a) involves computing similarity using spatio-temporal tokens within the sequence. (b) calculates similar tokens based on the similarity of each token. (c) entails de-correlation by subtracting similar tokens. This integration expands the effective feature dimension of the feature space, facilitating more robust and comprehensive representation. We utilize two losses in our model: Diffusion's noise prediction loss and idempotent feature constraints, which respectively constrain feature similarity and distributional similarity. Thus, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model. + +# 3.5 Idempotent Diffusion Generation Model + +Our model consists of three parts, an encoder $f(\cdot)$ , a generator $g(\cdot)$ and an adapter $h(\cdot)$ . The encoder $f(\cdot)$ extracts features $\mathbf{z}$ as conditions for the generator $g(\cdot)$ and also as inputs to the downstream task classifier $\phi(\cdot)$ . And the generator $g(\cdot)$ reconstructs the skeleton data based on the features. The adapter $h(\cdot)$ , in turn, is responsible for projecting and fusing the features extracted by the encoder $f(\cdot)$ into the generator's feature space to be used as conditions. + +Encoder $f(\cdot)$ : We start by applying some data augmentations to the data $\mathbf{x}$ to obtain data $\tilde{\mathbf{x}}$ for increasing diversity. Then, spatio-temporal position embeddings $P_{t}$ and $P_{v}$ are added after projection to the feature space by linear projection: + +$$ +\mathbf {z} = \operatorname {L i n e a r P r o j} (\tilde {\mathbf {x}}) + P _ {t} + P _ {v}. \tag {13} +$$ + +Following that, layers of vanilla transformer blocks are employed to extract latent representations $\mathbf{z}$ . Each block consists of a multi-head self-attention (MSA) module and a feed-forward network (FFN) module. Residual connections are utilized within each module, which are then followed by layer normalization (LN). + +Generator $g(\cdot)$ : The generator $g(\cdot)$ and encoder $f(\cdot)$ maintain the same structure. But the input is the noise data $\mathbf{x}_t$ obtained by sampling in the diffusion. The generator $g(\cdot)$ predicts the noise magnitude by taking noise data $\mathbf{x}_t$ and feature conditions $\mathbf{z}$ as inputs. + +Adapter $h(\cdot)$ : The adapter $h(\cdot)$ merges the features extracted by the encoder $f(\cdot)$ into the generator $g(\cdot)$ . This is necessary because high-level tasks like recognition operate in a different feature space compared to low-level tasks like generation. Recognition tasks necessitate capturing high-frequency action movements while generation primarily focuses on optimizing principal component space (with large singular values), such as walking or waving, which rely more on bottom component subspace like velocity. Thus, we introduce a feature fusion method that decouples principal and bottom component subspace, allowing the encoder features to focus more on high-frequency information, making them more suitable for high-level tasks such as action recognition. These features are then injected into the bottom component feature space of the generator. + +- Manifold Decoupled Feature Fusion Module: To derive discriminative features for use as semantic guides, we draw inspiration from negative samples in contrastive learning. We assume that regions with motion semantics have the lowest similarity to other regions in the same sequence. $\mathbf{z} = [\mathbf{z}_1,\dots ,\mathbf{z}_l]\in \mathbb{R}^{d\times l}$ , where $l$ is the length of tokens of $\mathbf{z}$ . The uniformity loss in contrastive learning is: + +$$ +\mathcal {L} _ {\mathrm {u n i}} = \mathbb {E} _ {\mathbf {z} _ {i}} \left[ \log \mathbb {E} _ {\mathbf {z} _ {j}} \left[ \exp \left(\mathbf {z} _ {i} ^ {T} \mathbf {z} _ {j}\right) \right] \right] = \operatorname {T r} \left(\log \left(\deg \left(\exp \left(\mathbf {z} ^ {T} \mathbf {z}\right)\right)\right)\right), \tag {14} +$$ + +the derivative of $\mathcal{L}_{\mathrm{uni}}$ is as follows: + +$$ +\hat {\mathbf {z}} \Leftarrow \mathbf {z} - \eta \frac {\partial \mathcal {L} _ {\mathrm {u n i}}}{\partial \mathbf {z}} = \mathbf {z} - \eta \mathbf {D} ^ {\prime - 1} \mathbf {A} ^ {\prime} \mathbf {z}, \tag {15} +$$ + +where $\mathbf{A}' = \exp(\mathbf{z}^T\mathbf{z})$ and $\mathbf{D}' = \deg(\mathbf{A}')$ . $\mathbf{D}'^{-1}\mathbf{A}' = \mathrm{SoftMax}(\mathbf{z}^T\mathbf{z})$ . $\hat{\mathbf{z}}$ removes low-frequency information. Based on this analysis, we extract the high-frequency information of the features as semantic information: + +$$ +\hat {\mathbf {z}} \Leftarrow (1 + \eta) \mathbf {z} - \eta \operatorname {S o f t M a x} (\mathbf {z} ^ {T} \mathbf {z}) \mathbf {z}. \tag {16} +$$ + +Through this high-pass filtering, we filter out some low-frequency information of principal component space such as the mean value in the sequences, which is not very meaningful for recognition, and retain the semantic information, which is more important for recognition. This module also mitigates dimensionality collapse, making features more informative. + +We then fuse the features into the generator by replacing LayerNorm (LN) with Adaptive LayerNorm (AdaLN) with the following equation: + +$$ +\operatorname {A d a L N} (\mathbf {h}, \hat {\mathbf {z}}, t) = \hat {\mathbf {z}} _ {s} \cdot \left(\mathbf {t} _ {s} \cdot \operatorname {L N} (\mathbf {h}) + \mathbf {t} _ {b}\right) + \hat {\mathbf {z}} _ {b} \tag {17} +$$ + +where $\mathbf{h}$ represents the hidden representation of the generator, $(\mathbf{t}_s,\mathbf{t}_b)$ and $(\hat{\mathbf{z}}_s,\hat{\mathbf{z}}_b)$ are obtained from linear projection of timestep embedding $t$ and high-frequency condition $\hat{\mathbf{z}}$ , respectively. Through AdaLN layers, the condition $\hat{\mathbf{z}}$ guides the denoising process by scaling and shifting the normalized hidden representation. Idempotence Generation Loss: Our loss function comprises two components: the noise prediction loss of the diffusion model and the idempotency constraint. + +- Noise Prediction Loss: The diffusion model is trained by predicting the noise from the input noise data: + +$$ +\mathcal {L} _ {\text {g e n}} = \left\| g \left(\mathbf {x} _ {t}, h (\mathbf {z}), t\right) - \varepsilon \right\| ^ {2}, \tag {18} +$$ + +$$ +\mathbf {x} _ {t} = \sqrt {\bar {\alpha} _ {t}} \mathbf {x} + \sqrt {1 - \bar {\alpha} _ {t}} \varepsilon , \quad \varepsilon \sim \mathcal {N} (\mathbf {0}, \mathbf {I}). +$$ + +- Idempotence Constraint: To obtain consistency constraints on features, we adopt two types of idempotency losses, feature idempotency constraint and distribution idempotency constraint. + +1) Feature idempotency constraint performs on features. We use the predicted noise to perform a step of de-noising to get the estimated generated data $\mathbf{x}_0$ : + +$$ +\mathbf {x} _ {0} = \frac {1}{\sqrt {\bar {\alpha} t}} \left(\mathbf {x} _ {t} - \sqrt {1 - \bar {\alpha}} g (\mathbf {x} _ {t}, h (\mathbf {z}), t)\right). \tag {19} +$$ + +Therefore, the feature idempotency constraint based on this generated data $\mathbf{x}_0$ is formulated as: + +$$ +\begin{array}{l} \mathcal {L} _ {\text {i d e} \_ \text {f e a t}} = - f (\mathbf {x}) ^ {T} f \left(\mathbf {x} _ {0}, \mathbf {z} _ {t ^ {\prime}}, t, t ^ {\prime}\right), \tag {20} \\ \mathbf {z} _ {t ^ {\prime}} = \sqrt {\bar {\alpha} _ {t ^ {\prime}}} \mathbf {z} + \sqrt {1 - \bar {\alpha} _ {t ^ {\prime}}} \varepsilon , \quad \varepsilon \sim \mathcal {N} (\mathbf {0}, \mathbf {I}). \\ \end{array} +$$ + +Since the generated data may be noisy, we input the noisy features and the number of time steps as auxiliary information. + +2) Distribution idempotency constraint aims to align the feature distributions of the generated and original data. It is essential to maintain the manifold structure of the generated data consistent with the manifold of the original data. We capture the feature manifold structure through inter-feature similarity: + +$$ +\mathcal {P} \left(\mathbf {x} _ {0}\right) = f \left(\mathbf {x} _ {0}\right) ^ {T} f \left(\mathbf {X} _ {0}\right) = \left[ f \left(\mathbf {x} _ {0}\right) ^ {T} f \left(\mathbf {x} _ {0} ^ {1}\right), \dots , f \left(\mathbf {x} _ {0}\right) ^ {T} f \left(\mathbf {x} _ {0} ^ {m}\right) \right], \tag {21} +$$ + +where $\mathbf{x}_0^i$ is $i$ -th token data. We align it to the feature structure of the original ground truth data: + +$$ +\mathcal {L} _ {\text {i d e} - \text {d i s t}} = \mathcal {D} \left(\mathcal {P} \left(\mathbf {x} _ {0}\right), \mathcal {P} (\mathbf {x})\right), \tag {22} +$$ + +where $\mathcal{D}(\cdot, \cdot)$ is the distance metric between two distributions. The feature idempotency constraint captures richer structural information and allows for the construction of tighter clusters. This is because the adjacency matrix not only connects different generated data of the same data but also connects different data with similar features. Based on this idempotent alignment, we enhance the generative power of the model for stronger perceptual performance, while the encoder learns stronger feature consistency. This results in reduced singular values $\sum_{i=d+1}^{m} \lambda_i^2$ of the adjacency matrix and better downstream task performance. + +# 4 Experiment Results + +To evaluate the effectiveness of our approach, we conducted experiments on two benchmark datasets: the NTU RGB+D dataset [23, 35] and the PKUMMD dataset [22]. + +Table 1: Comparison of action recognition results with unsupervised learning approaches on NTU dataset. + +
ModelsArchitectureNTU 60NTU 120
xviewxsubxsetxsub
Contrastive Learning:
3s-AimCLR [11]GCN83.477.866.767.9
3s-CPM [64]GCN84.978.769.668.7
3s-CMD [29]GRU90.984.176.174.7
GL-Transformer [18]Transformer83.876.368.766.0
3s-ActCLR [21]GCN88.884.375.774.3
Generative Learning:
3s-Colorization [61]DGCNN87.279.170.869.2
SkeletonMAE [58]GCN77.774.873.572.5
MAMP [28]Transformer89.184.979.178.6
Contrastive Learning & Generative Learning:
CRRL [53]GRU73.867.657.056.2
PCM³ [65]GRU90.483.977.576.3
IGM (Ours)Transformer91.286.281.480.0
+ +Table 2: Comparison of action recognition results under KNN evaluation on NTU 60. + +
Modelsxviewxsub
Contrastive Learning:
AimCLR [11]71.063.7
SkeleMixCLR [5]72.365.5
Generative Learning:
LongT GAN [69]48.139.1
MAMP [28]70.062.0
IGM w/o Lide67.264.7
IGM w/ Lide_feat70.768.4
IGM w/ Lide_dist72.169.0
IGM (Ours)72.669.3
+ +Table 3: Comparison of the transfer learning performance on PKUMMD II dataset with linear evaluation pretrained on NTU 60. + +
Modelsxviewxsub
Finetune:
LongT GAN [69]-44.8
MS2L [20]-45.8
ISC [46]-51.1
Hi-TRS [3]-55.0
3s-CrosSCLR [19]-51.3
3s-AimCLR [11]42.451.6
Linear:
3s-ActCLR [21]44.555.9
MAMP [28]42.053.0
IGM (Ours)45.359.8
+ +# 4.1 Datasets and Settings + +NTU RGB+D Dataset 60 (NTU 60) [35] comprises a comprehensive compilation of 56,578 videos, covering 60 unique action labels. Every video includes annotations detailing the positions of 25 joints for each body, illustrating interactions among pairs and individual activities. + +NTU RGB+D Dataset 120 (NTU 120) [23] is one of the most comprehensive datasets for recognizing actions. Encompassing 114,480 videos, it spans 120 unique action categories. This dataset documents the performance of actions by 106 individuals across diverse environments, employing 32 distinct recording configurations. + +PKU Multi-Modality Dataset (PKUMMD) [22] encompasses 52 action classes and nearly 20,000 instances, with each sample comprising 25 joints, thoroughly tackling the multi-modal 3D comprehension of human actions. The + +Table 4: Action recognition accuracy for corruptions of test-time adaptation with single domain shift on NTU-C 60 xsub dataset. + +
MethodJoint Noise (p, σ2)Part Occlusion
(1.0, 0.1)(1.0, 0.05)(0.5, 0.1)Right Arms
AimCLR [11]6.316.622.028.1
ActCLR [21]12.733.528.630.3
MAMP [28]2.46.15.810.7
IGM (Ours)58.763.065.356.9
+ +dataset is partitioned into two segments, with Part II showcasing more demanding data owing to heightened view diversity, resulting in skeleton noise. + +For enhancing network training, all skeleton sequences undergo temporal downsampling to 120 frames. The encoder $f(\cdot)$ and generator $g(\cdot)$ are built using the Transformer architecture [59], employing hidden channels configured to a dimension of 256. To assess performance, we employ a fully connected layer $\phi(\cdot)$ . + +To refine our network, we employ the Adam optimizer [30]. Training is executed on a single NVIDIA GeForce RTX 4090, employing a batch size of 128, and the network undergoes training for 400 epochs. + +# 4.2 Evaluation and Comparison + +For a comprehensive assessment, we conduct comparative analysis of our approach with other methodologies across diverse scenarios. + +Linear Evaluation. In the linear evaluation framework, we utilize an encoder $f(\cdot)$ to process the extracted features and a linear classifier $\phi(\cdot)$ for action classification. The evaluation metric employed is the accuracy of action recognition. Notably, the encoder $f(\cdot)$ remains unchanged throughout the linear evaluation protocol. Our model demonstrates superior performance on the datasets outlined in Table 1 compared to other methodologies. + +KNN Evaluation. In the K-Nearest Neighbors (KNN) evaluation setup, where the fixed encoder $f_{q}(\cdot)$ extracts features without any trainable parameters, our model showcases superiority in action recognition accuracy on the presented datasets. Table 2 highlights the effectiveness of our approach compared to other methods in this evaluation mechanism. + +Transfer Learning. In the transfer learning scenario, we assess the generalization capability of our model by pretraining it on the source data using a self-supervised task. We then evaluate the model's performance on the target dataset using the linear evaluation mechanism, with the encoder $f(\cdot)$ maintaining fixed parameters without additional fine-tuning. Our approach demonstrates superior performance in the transfer learning setting, as illustrated in Table 3. + +Zero-Shot Domain Generalization. By applying 4 types of corruption to the validation sets of all datasets, we assess the generalization of our proposed method compared to baseline approaches. For joint noise, we add noise with a probability of $p$ with a variance of $\sigma^2$ to some joints. We leverage the generative + +Table 5: Comparison of mask prediction results on NTU 60 xsub. + +
MethodDDPM [15]MDM [45]SkeletonMAE [58]IGM (Ours)
MPJPE (mm)↓130.287.6329.779.2
FID↓1.781.262.691.18
+ +Table 6: Analysis of module combinations on NTU 60 xsub dataset with the joint stream. "FFM" means Feature Fusion Module. + +
ModuleKNNLinear
FFM h(·)Lide_featuresLide_dist
64.783.3
✓67.685.1
✓✓68.485.5
✓✓69.086.0
✓✓✓69.386.2
+ +capability of our model, enabling us to denoise noisy skeleton data at test time. Subsequently, we utilize the generated skeleton data for recognition, significantly enhancing the generalization ability of our model. In Table 4, our proposed approach shows consistent and substantial performance improvements. + +Reconstruction Evaluation. In this section, we implement IGM for mask prediction tasks. We input the masked data into the encoder to extract features as conditions for generation, noting that the reconstruction task does not require adding data transformations to the conditions. Our method is compared with diffusion-based methods DDPM and MDM in Table 5. Figs 3 and 4 show visualizations and feature visualizations of both the generated data and the ground truth data. Despite sharing the same feature distribution, the generated samples exhibit some diversity due to the noise introduced in the conditions. + +# 4.3 Ablation Study + +Here's the modified text for the ablation experiments: + +Analysis of Module Combination. We investigate the performance of various combinations of modules and observe that each module contributes to a certain degree of improvement. Optimal performance is attained when all three modules are combined. As depicted in Table 6, each module enhances performance. + +Analysis of Mitigating Dimensional Collapse. The analysis points out that the feature space of the generated model is susceptible to dimensionality collapse, resulting in the extracted features losing the information needed for recognition. Fig. 2 shows the feature space of the encoder trained using the generative model and the feature space after Adapter. The token after removing similarity by Adapter network has higher feature values, i.e., the dimension collapse phenomenon is mitigated. + +![](images/5c9cd72496c43b2cd8ff2143dc709f3f596fa985ce8c117404c1757927077a7c.jpg) +Fig.2: Curve of singular values with the singular value index. + +![](images/18438d80744197f459fdfd841e73215b80072108a7466325c6a9759b438f1a97.jpg) +Fig. 3: Visualisation of features in ground truth data and generated data. + +![](images/0fcfc9ad27f1fc507221e14fc31226fe68a6b7fc0c6d82d85d0f54cd97d13c1d.jpg) +Fig. 4: Visualisations of ground truth data and generated data. Above is the ground truth data, and below is the generated data. The conditions provided by the encoder are incorporated with data transformation, resulting in generated data that maintain similar motion information while exhibiting some diversity. + +# 5 Conclusions + +In this research, we propose the skeleton-based idempotent generative model (IGM) for unsupervised representation learning, presenting a novel framework that maximizes the potential of generative models for representation learning. By implementing idempotence at both the feature level and distribution, our model enriches features with semantic information about motion, making them more suitable for recognition tasks. Additionally, as the generative model primarily focuses on the principal component space, it is more susceptible to dimensional collapse. Conversely, recognition tasks rely more on the bottom subspace. To address this imbalance, we design an adapter that fuses encoder and generator features from different subspaces, thereby enhancing the effective feature dimension of the feature space. + +# Acknowledgements + +This work was supported in part by the National Natural Science Foundation of China under Grant No.62172020, and in part by the Key Laboratory of Science, Technology and Standard in Press Industry (Key Laboratory of Intelligent Press Media Technology). + +# References + +1. Bachman, P., Hjelm, R.D., Buchwalter, W.: Learning representations by maximizing mutual information across views. In: Proc. Advances in Neural Information Processing Systems (2019) 4 +2. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: Proc. Int'l Conference for Machine Learning (2020) 4 +3. Chen, Y., Zhao, L., Yuan, J., Tian, Y., Xia, Z., Geng, S., Han, L., Metaxas, D.N.: Hierarchically self-supervised transformer for human skeleton representation learning. In: Proc. European Conference on Computer Vision (2022) 11 +4. Chen, Y., Zhang, Z., Yuan, C., Li, B., Deng, Y., Hu, W.: Channel-wise topology refinement graph convolution for skeleton-based action recognition. In: Proc. Int'l Conference on Computer Vision (2021) 2 +5. Chen, Z., Liu, H., Guo, T., Chen, Z., Song, P., Tang, H.: Contrastive learning from spatio-temporal mixed skeleton sequences for self-supervised skeleton-based action recognition. arXiv:2207.03065 (2022) 11 +6. Cheng, K., Zhang, Y., He, X., Chen, W., Cheng, J., Lu, H.: Skeleton-based action recognition with shift graph convolutional network. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 183-192 (2020) 3 +7. Du, T., Wang, Y., Wang, Y.: On the role of discrete tokenization in visual representation learning. In: Proc. Int'l Conference on Learning Representations (2023) 7 +8. Erhan, D., Bengio, Y., Courville, A., Manzagol, P.A., Vincent, P., Bengio, S.: Why does unsupervised pre-training help deep learning? Journal of Machine Learning Research 11(Feb), 625-660 (2010) 4 +9. Feichtenhofer, C., Li, Y., He, K., et al.: Masked autoencoders as spatiotemporal learners. Proc. Advances in Neural Information Processing Systems 35, 35946-35958 (2022) 4 +0. Goutsu, Y., Takano, W., Nakamura, Y.: Motion recognition employing multiple kernel learning of fisher vectors using local skeleton features. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3 +1. Guo, T., Liu, H., Chen, Z., Liu, M., Wang, T., Ding, R.: Contrastive learning from extremely augmented skeleton sequences for self-supervised action recognition. Proc. AAAI Conference on Artificial Intelligence (2022) 2, 11, 12 +2. Guo, X., Wang, Y., Du, T., Wang, Y.: Contranorm: A contrastive learning perspective on oversmoothing and beyond. arXiv preprint arXiv:2303.06562 (2023) 7 +3. HaoChen, J., Wei, C., Gaidon, A., Ma, T.: Provable guarantees for self-supervised deep learning with spectral contrastive loss, 2021. arXiv preprint arXiv:2106.041567 +4. He, K., Chen, X., Xie, S., Li, Y., Dóllar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2022) 4 +5. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Proc. Advances in Neural Information Processing Systems 33, 6840-6851 (2020) 13 +6. Isola, P., Zoran, D., Krishnan, D., Adelson, E.H.: Learning visual groups from co-occurrences in space and time. arXiv:1511.06811 (2015) 4 +7. Jang, E., Devin, C., Vanhoucke, V., Levine, S.: Grasp2Vec: Learning object representations from self-supervised grasping. arXiv:1811.06964 (2018) 4 + +18. Kim, B., Chang, H.J., Kim, J., Choi, J.Y.: Global-local motion transformer for unsupervised skeleton-based action learning. Proc. European Conference on Computer Vision (2022) 2, 11 +19. Li, L., Wang, M., Ni, B., Wang, H., Yang, J., Zhang, W.: 3D human action representation learning via cross-view consistency pursuit. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2021) 11 +20. Lin, L., Song, S., Yang, W., Liu, J.: MS2L: Multi-task self-supervised learning for skeleton based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 2, 11 +21. Lin, L., Zhang, J., Liu, J.: Actionlet-dependent contrastive learning for unsupervised skeleton-based action recognition. In: CVPR (2023) 11, 12 +22. Liu, J., Song, S., Liu, C., Li, Y., Hu, Y.: A benchmark dataset and comparison study for multi-modal human action analytics. ACM Trans. on Multimedia Computing, Communications, and Applications (2020) 10, 11 +23. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: NTU RGB+D 120: A large-scale benchmark for 3d human activity understanding. IEEE Trans. on Pattern Analysis and Machine Intelligence (2019) 10, 11 +24. Liu, X., Wang, Z., Li, Y.L., Wang, S.: Self-supervised learning via maximum entropy coding. Proc. Advances in Neural Information Processing Systems 35, 34091-34105 (2022) 5 +25. Liu, Z., Zhang, H., Chen, Z., Wang, Z., Ouyang, W.: Disentangling and unifying graph convolutions for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3 +26. Lorre, G., Rabarisoa, J., Orcesi, A., Ainouz, S., Canu, S.: Temporal contrastive pretraining for video action recognition. In: Proceedings of the IEEE/CVF winter conference on applications of computer vision. pp. 662-670 (2020) 4 +27. Lv, F., Nevatia, R.: Recognition and segmentation of 3-d human action using hmm and multi-class adaboost. In: Proc. European Conference on Computer Vision (2006) 3 +28. Mao, Y., Deng, J., Zhou, W., Fang, Y., Ouyang, W., Li, H.: Masked motion predictors are strong 3d action representation learners. In: Proc. Int'l Conference on Computer Vision. pp. 10181-10191 (2023) 2, 11, 12 +29. Mao, Y., Zhou, W., Lu, Z., Deng, J., Li, H.: CMD: Self-supervised 3d action representation learning with cross-modal mutual distillation. Proc. European Conference on Computer Vision (2022) 11 +30. Newey, W.K.: Adaptive estimation of regression models via moment restrictions. Journal of Econometrics (1988) 12 +31. Owens, A., Efros, A.A.: Audio-visual scene analysis with self-supervised multisensory features. In: Proc. European Conference on Computer Vision (2018) 4 +32. Peng, W., Hong, X., Chen, H., Zhao, G.: Learning graph convolutional network for skeleton-based human action recognition by neural searching. In: Proc. AAAI Conference on Artificial Intelligence (2020) 1 +33. Rai, N., Adeli, E., Lee, K.H., Gaidon, A., Niebles, J.C.: Cocon: Cooperative-contrastive learning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 3384-3393 (2021) 4 +34. Rao, H., Xu, S., Hu, X., Cheng, J., Hu, B.: Augmented skeleton based contrastive action learning with momentum LSTM for unsupervised action recognition. Information Sciences (2021) 2 +35. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: NTU RGB+D: A large scale dataset for 3d human activity analysis. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 10, 11 + +36. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Skeleton-based action recognition with directed graph neural networks. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 7912-7921 (2019) 3 +37. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Two-stream adaptive graph convolutional networks for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2 +38. Shotton, J., Sharp, T., Kipman, A., Fitzgibbon, A., Finocchio, M., Blake, A., Cook, M., Moore, R.: Real-time human pose recognition in parts from single depth images. Communications of the ACM (2013) 3 +39. Si, C., Chen, W., Wang, W., Wang, L., Tan, T.: An attention enhanced graph convolutional LSTM network for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2 +40. Si, C., Jing, Y., Wang, W., Wang, L., Tan, T.: Skeleton-based action recognition with spatial reasoning and temporal stack learning. In: Proc. European Conference on Computer Vision. pp. 103-118 (2018) 3 +41. Song, Y.F., Zhang, Z., Shan, C., Wang, L.: Constructing stronger and faster baselines for skeleton-based action recognition. IEEE transactions on pattern analysis and machine intelligence 45(2), 1474-1488 (2022) 3 +42. Song, Y., Zhang, Z., Shan, C., Wang, L.: Stronger, faster and more explainable: A graph convolutional baseline for skeleton-based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 1, 3 +43. Su, K., Liu, X., Shlizerman, E.: Predict & cluster: Unsupervised skeleton based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 2 +44. Tao, L., Vidal, R.: Moving poselets: A discriminative and interpretable skeletal motion representation for action recognition. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3 +45. Tevet, G., Raab, S., Gordon, B., Shafir, Y., Cohen-Or, D., Bermano, A.H.: Human motion diffusion model. arXiv preprint arXiv:2209.14916 (2022) 13 +46. Thoker, F.M., Doughty, H., Snoek, C.G.: Skeleton-contrastive 3D action representation learning. In: Proc. ACM Int'l Conference on Multimedia (2021) 2, 11 +47. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. arXiv:1906.05849 (2019) 4 +48. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. In: Proc. European Conference on Computer Vision. pp. 776-794. Springer (2020) 4 +49. Vemulapalli, R., Arrate, F., Chellappa, R.: Human action recognition by representing 3d skeletons as points in a lie group. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2014) 3 +50. Vemulapalli, R., Chellapa, R.: Rolling rotations for recognizing human actions from 3d skeletal data. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 3 +51. Wang, J., Liu, Z., Wu, Y., Yuan, J.: Mining actionlet ensemble for action recognition with depth cameras. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2012) 3 +52. Wang, P., Yuan, C., Hu, W., Li, B., Zhang, Y.: Graph based skeleton motion representation and similarity measurement for action recognition. In: Proc. European Conference on Computer Vision. pp. 370-385 (2016) 3 +53. Wang, P., Wen, J., Si, C., Qian, Y., Wang, L.: Contrast-reconstruction representation learning for self-supervised skeleton-based action recognition. IEEE Trans. on Image Processing 31, 6224-6238 (2022) 11 + +54. Wang, Y., Zhang, Q., Du, T., Yang, J., Lin, Z., Wang, Y.: A message passing perspective on learning dynamics of contrastive learning. arXiv preprint arXiv:2303.04435 (2023) 7 +55. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 14668-14678 (2022) 4 +56. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2018) 4 +57. Xu, T., Zhu, Z., He, D., Li, Y., Guo, L., Wang, Y., Wang, Z., Qin, H., Wang, Y., Liu, J., et al.: Idempotence and perceptual image compression. arXiv preprint arXiv:2401.08920 (2024) 6 +58. Yan, H., Liu, Y., Wei, Y., Li, Z., Li, G., Lin, L.: Skeletonmae: graph-based masked autoencoder for skeleton sequence pre-training. In: Proc. Int'l Conference on Computer Vision. pp. 5606-5618 (2023) 11, 13 +59. Yan, S., Xiong, Y., Lin, D.: Spatial temporal graph convolutional networks for skeleton-based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 3, 12 +60. Yang, S., Liu, J., Lu, S., Er, M.H., Kot, A.C.: Skeleton cloud colorization for unsupervised 3D action representation learning. In: Proc. Int'l Conference on Computer Vision (2021) 2 +61. Yang, S., Liu, J., Lu, S., Hwa, E.M., Hu, Y., Kot, A.C.: Self-supervised 3d action representation learning with skeleton cloud colorization. IEEE Trans. on Pattern Analysis and Machine Intelligence (2023) 11 +62. Ye, M., Zhang, X., Yuen, P.C., Chang, S.F.: Unsupervised embedding learning via invariant and spreading instance feature. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 4 +63. Yu, Y., Chan, K.H.R., You, C., Song, C., Ma, Y.: Learning diverse and discriminative representations via the principle of maximal coding rate reduction. Proc. Advances in Neural Information Processing Systems 33, 9422-9434 (2020) 5 +64. Zhang, H., Hou, Y., Zhang, W., Li, W.: Contrastive positive mining for unsupervised 3d action representation learning. Proc. European Conference on Computer Vision (2022) 11 +65. Zhang, J., Lin, L., Liu, J.: Prompted contrast with masked motion modeling: Towards versatile 3d action representation learning. In: Proc. ACM Int'l Conference on Multimedia. pp. 7175-7183 (2023) 11 +66. Zhang, P., Lan, C., Zeng, W., Xing, J., Xue, J., Zheng, N.: Semantics-guided neural networks for efficient skeleton-based human action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3 +67. Zhang, Q., Wang, Y., Wang, Y.: How mask matters: Towards theoretical understandings of masked autoencoders. Proc. Advances in Neural Information Processing Systems 35, 27127-27139 (2022) 7 +68. Zhang, X., Xu, C., Tao, D.: Context aware graph convolution for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3 +69. Zheng, N., Wen, J., Liu, R., Long, L., Dai, J., Gong, Z.: Unsupervised representation learning with long-term dynamics for skeleton based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 2, 11 \ No newline at end of file diff --git a/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/images.zip b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..5868944d8f73c523ccd725c3b93e34bc3615e2b0 --- /dev/null +++ b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:48ea6f4add41edb93cc94c8e890ba4458a15353262cc354dce9f92b49d0c196b +size 384985 diff --git a/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/layout.json b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..9d89ec98805b0a85f4bd128b670d390d9901b3bc --- /dev/null +++ b/2024/Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition/layout.json @@ -0,0 +1,11233 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 139, + 112, + 474, + 147 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 112, + 474, + 147 + ], + "spans": [ + { + "bbox": [ + 139, + 112, + 474, + 147 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation Learning for Skeleton-Based Action Recognition" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 168, + 447, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 168, + 447, + 181 + ], + "spans": [ + { + "bbox": [ + 166, + 168, + 447, + 181 + ], + "type": "text", + "content": "Lilang Lin, Lehong Wu, Jiahang Zhang, and Jiaying Liu" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 175, + 190, + 438, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 190, + 438, + 224 + ], + "spans": [ + { + "bbox": [ + 175, + 190, + 438, + 224 + ], + "type": "text", + "content": "Wangxuan Institute of Computer Technology, Peking University {linlilang, zjh2020, liujiaying}@pku.edu.cn aladonwh@pku.stu.edu.cn" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 254, + 455, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 254, + 455, + 506 + ], + "spans": [ + { + "bbox": [ + 160, + 254, + 455, + 506 + ], + "type": "text", + "content": "Abstract. Generative models, as a powerful technique for generation, also gradually become a critical tool for recognition tasks. However, in skeleton-based action recognition, the features obtained from existing pre-trained generative methods contain redundant information unrelated to recognition, which contradicts the nature of the skeleton's spatially sparse and temporally consistent properties, leading to undesirable performance. To address this challenge, we make efforts to bridge the gap in theory and methodology and propose a novel skeleton-based idempotent generative model (IGM) for unsupervised representation learning. More specifically, we first theoretically demonstrate the equivalence between generative models and maximum entropy coding, which demonstrates a potential route that makes the features of generative models more compact by introducing contrastive learning. To this end, we introduce the idempotency constraint to form a stronger consistency regularization in the feature space, to push the features only to maintain the critical information of motion semantics for the recognition task. Our extensive experiments on benchmark datasets, NTU RGB+D and PKUMMD, demonstrate the effectiveness of our proposed method. On the NTU 60 xsub dataset, we observe a performance improvement from " + }, + { + "bbox": [ + 160, + 254, + 455, + 506 + ], + "type": "inline_equation", + "content": "84.6\\%" + }, + { + "bbox": [ + 160, + 254, + 455, + 506 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 160, + 254, + 455, + 506 + ], + "type": "inline_equation", + "content": "86.2\\%" + }, + { + "bbox": [ + 160, + 254, + 455, + 506 + ], + "type": "text", + "content": ". Furthermore, in zero-shot adaptation scenarios, our model demonstrates significant efficacy by achieving promising results in cases that were previously unrecognizable. Our project is available at https://github.com/LanglandsLin/IGM." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 517, + 453, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 517, + 453, + 540 + ], + "spans": [ + { + "bbox": [ + 160, + 517, + 453, + 540 + ], + "type": "text", + "content": "Keywords: Self-supervised learning " + }, + { + "bbox": [ + 160, + 517, + 453, + 540 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 517, + 453, + 540 + ], + "type": "text", + "content": " skeleton-based action recognition " + }, + { + "bbox": [ + 160, + 517, + 453, + 540 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 517, + 453, + 540 + ], + "type": "text", + "content": " contrastive learning" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 560, + 230, + 572 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 560, + 230, + 572 + ], + "spans": [ + { + "bbox": [ + 132, + 560, + 230, + 572 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 586, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 586, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 586, + 482, + 647 + ], + "type": "text", + "content": "Skeletons represent human joints through 3D coordinate locations, providing a compact and efficient modality of representing human motion compared to RGB videos and depth data. Owing to their simplicity and superior discriminative capabilities for analysis, skeleton representations have been extensively employed in the field of action recognition tasks [25, 32, 42, 43, 66, 68]." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "text", + "content": "* Corresponding author." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": "Supervised skeleton-based action recognition methods [4,37,39] have demonstrated remarkable performance. However, they heavily rely on vast amounts of labeled training data, the collection of which can be a costly and time-consuming process. In order to reduce the reliance on fully supervised paradigms, self-supervised learning approaches have been explored in the context of skeleton-based action recognition [20, 43, 46, 69]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 190, + 482, + 323 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 190, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 190, + 482, + 323 + ], + "type": "text", + "content": "In the context of self-supervised pretraining paradigms, most methods can be broadly classified into two categories: generative learning-based [18, 43, 60] and contrastive learning-based approaches. Generative learning-based methods typically model the spatial-temporal correlations by predicting or reconstructing the masked skeleton data. With long-term global motion dynamics, Zheng et al. [69] were the pioneers in introducing the concept of reconstructing masked skeleton data. The structure of Masked Auto-Encoder (MAE) was used by Mao et al. [28] to predict the velocity of the masked part thus obtaining motion information modelling. However, skeleton data is by nature spatially sparse and temporal consistent while MAE's feature preserves too much appearance information, which will interfere with the recognition tasks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 325, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 445 + ], + "type": "text", + "content": "On the other route, contrastive learning-based methods also have recently demonstrated remarkable potential. These methods utilize skeleton transformations to generate positive pairs and aim to maintain consistency in the embedding space. Rao et al. [34] introduced shearing and cropping as data augmentation techniques. Guo et al. [11] extended these efforts by suggesting additional augmentations, such as rotation, masking, and flipping, to further enhance the consistency of contrastive learning. Contrastive learning, aimed at high-level tasks like recognition, often requires data transformation to filter out task-irrelevant information. This process results in a significant loss of information in the extracted features and hampers the ability to capture fine-grained motion details." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 447, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 447, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 447, + 482, + 555 + ], + "type": "text", + "content": "However, previous research has typically focused on these two paradigms separately. Their ideas and technical advantages are complementary and can be augmented, which is still under-explored. To address this gap, we first seek theoretical inspiration about the relationship between generative models and contrastive learning. In detail, we find that generative methods are equivalent to maximum entropy coding. This fact naturally inspires building the generative models with the related idempotent constraint to form a novel idempotent generative model, which is exactly equivalent to spectral contrastive learning but with improved recognition capacities." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "content": "Building upon this theoretical foundation, we propose a novel idempotent generative model to promote consistency in the feature space. By enforcing idempotence at the feature and distribution levels, our model enriches features with semantic motion information, thereby reducing the domain gap and adapting the generative model better for recognition. Moreover, the features of generative models are span on principal components, which easily leads to dimensional collapse, as recognition tasks primarily rely on discriminative local details. To address this imbalance, we introduce an adapter that fuses encoder and generator features. This integration expands the effective feature dimension of the" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 101 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "content": "feature space, facilitating more robust and comprehensive representation. Our model attains outstanding results through self-supervised learning in comparison to contemporary state-of-the-art methods." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 152, + 357, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 152, + 357, + 163 + ], + "spans": [ + { + "bbox": [ + 146, + 152, + 357, + 163 + ], + "type": "text", + "content": "In summary, our contributions are three-folded:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 170, + 479, + 240 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 170, + 479, + 240 + ], + "spans": [ + { + "bbox": [ + 138, + 170, + 479, + 240 + ], + "type": "text", + "content": "- We propose an idempotent generative model to combine the benefits of generative pre-training and contrastive learning, which is inspired by the theoretical fact of their intrinsic correlation. This cooperation makes the model focus on extracting more compact information related to motion semantics, and obtain more powerful high-level representation within the generative model framework." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 251, + 479, + 298 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 479, + 298 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 479, + 298 + ], + "type": "text", + "content": "- We further propose to utilize a multiple idempotency feature constraint. Through feature and distribution idempotency constraints, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 308, + 479, + 355 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 308, + 479, + 355 + ], + "spans": [ + { + "bbox": [ + 138, + 308, + 479, + 355 + ], + "type": "text", + "content": "- We employ an adapter to fuse the features from the high-level semantic encoder and low-level skeleton generator from different subspaces to expand the representation dimension. Experiments show that our module improves the effective dimension of the feature space and encodes rich information." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 373, + 236, + 385 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 373, + 236, + 385 + ], + "spans": [ + { + "bbox": [ + 132, + 373, + 236, + 385 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 396, + 337, + 407 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 396, + 337, + 407 + ], + "spans": [ + { + "bbox": [ + 131, + 396, + 337, + 407 + ], + "type": "text", + "content": "2.1 Skeleton-Based Action Recognition" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 415, + 479, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 479, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 479, + 462 + ], + "type": "text", + "content": "Skeleton sequences encode the motion trajectories of human joints, representing rich information about human actions. Thus, skeleton data serves as a suitable modality for human action recognition [25, 42, 66, 68]. Skeleton can be obtained by applying pose estimation algorithms on RGB videos or depth maps [38]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 463, + 479, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 463, + 479, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 463, + 479, + 533 + ], + "type": "text", + "content": "Early studies focused on extracting hand-designed spatial and temporal domain features from skeleton sequences for human movement recognition [10, 27, 49-51]. In later work, efforts were made to model the positional information and higher-order temporal difference information of the human skeleton [44, 49]. Additionally, graphical models were built by tracking the trajectory of human joints to capture joint information in video sequences [52]." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 534, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 481, + 666 + ], + "type": "text", + "content": "Recently, there has been a surge of interest in using graph structures for learning models [52]. Graph Neural Network (GNN) is one such model capturing intra-graph dependencies through information transfer between nodes. Various approaches have been proposed, such as spatio-domain inference networks, recurrent neural networks (RNNs), and graph convolutional networks (GCNs), to exploit graph structures for human action recognition [36, 40, 59]. These models automatically learn spatio-temporal patterns from skeleton data, facilitating strong action generalization. Moreover, attention mechanisms, multiscale aggregation schemes, and lightweight convolution operations have been integrated into GCN-based models to enhance their effectiveness and reduce computational costs [6, 25, 41, 66]." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 287, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 287, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 287, + 129 + ], + "type": "text", + "content": "2.2 Self-Supervised Learning" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 481, + 186 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 481, + 186 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 481, + 186 + ], + "type": "text", + "content": "The self-supervised task aims to extract data features from a large amount of unlabelled data [8]. It can be widely used in semantic segmentation, image classification, action recognition and many other tasks [17,31]. These tasks are mainly classified into methods based on reconstruction and on contrastive learning." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 187, + 482, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 187, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 187, + 482, + 319 + ], + "type": "text", + "content": "Reconstruction based approach after masking part of the original data, the network is used to reconstruct the masked part of the data. He et al. [14] proposed Mased Auto-Encoder (MAE) to encode the visible patches and decode the visible and masked patches. This approach has been extended to the video domain and has been used in several studies. These methods typically use a visual Transformer as the backbone network in order to perform the mask reconstruction task. Feichtenhofer et al. [9] extended the image-based masked auto-encoder to use spatio-temporal learning to randomly mask spatio-temporal segments of a video and learn am auto-encoder for reconstruction at the pixel-level reconstruction. Similarly, in MaskFeat, Wei et al. [55] used several video cubes and utilized the model to predict them using the remaining information." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 319, + 482, + 378 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 319, + 482, + 378 + ], + "spans": [ + { + "bbox": [ + 130, + 319, + 482, + 378 + ], + "type": "text", + "content": "Contrastive learning pushes pairs of positive sample together while pushing pairs of negative sample further apart. To generate negative samples, contrastive learning pairs anchor frames with frames from other videos. There are various ways of generating positive and negative samples, which is the main factor that distinguishes different contrastive methods." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 380, + 482, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 523 + ], + "type": "text", + "content": "Most of these methods generate positive and negative samples by different ways in order to minimize and maximise the distance between them respectively. In the image domain, positive samples are usually generated by enhancing the image in different ways [1, 16, 47, 56, 62]. These enhancements include rotation, cropping, random greyscale and colour change [2]. Scaling these methods in video can be difficult because each video comparison increases the memory required, especially if multiple enhancements are used for multiple positive samples. Another challenge is incorporating the temporal domain into the enhancement. Some methods simply apply the same enhancement in the image to each frame [48]. Some methods include additional frame alignments that may be based on the temporal domain [26]. Finally, some methods rely on motion and optical flow maps as positive samples [33]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 544, + 397, + 559 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 397, + 559 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 397, + 559 + ], + "type": "text", + "content": "3 Idempotency Generation Network (IGN)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 571, + 457, + 597 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 571, + 457, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 571, + 457, + 597 + ], + "type": "text", + "content": "3.1 Self-Conditional Generative Models as Maximum Entropy Coding" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 606, + 481, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 481, + 643 + ], + "type": "text", + "content": "Self-conditional generative modeling [14] is frequently employed as a pre-training task in self-supervised learning. It is generally structured as an auto-encoder. Formally, given the input skeleton data " + }, + { + "bbox": [ + 130, + 606, + 481, + 643 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 606, + 481, + 643 + ], + "type": "text", + "content": ", the reconstruction loss is:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 164, + 652, + 481, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 652, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 164, + 652, + 481, + 667 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathbb {E} _ {\\mathbf {x} \\sim p _ {\\mathbf {x}}} \\left[ \\mathcal {D} (g (\\mathbf {z}), \\mathbf {x}) \\right] = \\mathbb {E} _ {\\mathbf {x} \\sim p _ {\\mathbf {x}}} \\left[ \\mathbb {E} _ {\\mathbf {z} \\sim p _ {\\mathbf {z}} | \\mathbf {x}} [ - \\log p (\\mathbf {x} | \\mathbf {z}) ] \\right] = H (\\mathbf {x} | \\mathbf {z}), \\qquad (1)", + "image_path": "cfd031f836d05c1eb5389ff856ed62c3898aabf08050996f7a42e544e5c1a87d.jpg" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "\\mathbf{z} = f(\\mathcal{T}(\\mathbf{x}))" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": " is the encoder, and " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "\\mathcal{T}(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": " is data transformation. " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": " is the generator. " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "\\mathcal{D}(\\cdot,\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": " is the distance. " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "p_{\\mathbf{x}}" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": " is the data distribution and " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "p_{\\mathbf{z}|\\mathbf{x}}" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": " is the feature distribution given " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "inline_equation", + "content": "H(\\cdot|\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": " is the conditional entropy. In the context of MAE, this data transformation represents masked data during training. Conversely, in denoising auto-encoders, this transformation signifies adding noise to the input data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "text", + "content": "In the context of mutual information, this loss function is equivalent to optimizing the mutual information " + }, + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "inline_equation", + "content": "I(\\mathbf{z};\\mathbf{x})" + }, + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "text", + "content": " between the extracted features " + }, + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "text", + "content": " and the input data " + }, + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 188, + 479, + 236 + ], + "type": "text", + "content": ". Based on the relationship between mutual information and entropy, we get" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 213, + 245, + 479, + 257 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 213, + 245, + 479, + 257 + ], + "spans": [ + { + "bbox": [ + 213, + 245, + 479, + 257 + ], + "type": "interline_equation", + "content": "I (\\mathbf {z}; \\mathbf {x}) = H (\\mathbf {x}) - H (\\mathbf {x} | \\mathbf {z}) = H (\\mathbf {z}) - H (\\mathbf {z} | \\mathbf {x}). \\tag {2}", + "image_path": "f8cb73f2660cd8674331bc01bcce78514c82df4c7c1de887b6c49e3d320fbd2d.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": "Since the entropy of " + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": " remains constant, decreasing the reconstruction loss is akin to increasing the mutual information. Conversely, as the features " + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": " are deterministically derived from the data " + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": " by an encoder " + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": ", the entropy " + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "inline_equation", + "content": "H(\\mathbf{z}|\\mathbf{x})" + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": " tends towards zero. Hence, maximizing the mutual information " + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "inline_equation", + "content": "I(\\mathbf{z};\\mathbf{x})" + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": " is equivalent to maximizing the entropy of the feature space " + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "inline_equation", + "content": "H(\\mathbf{z})" + }, + { + "bbox": [ + 130, + 265, + 479, + 324 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "text", + "content": "Estimating the true distributions " + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "inline_equation", + "content": "p(\\mathbf{z})" + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "text", + "content": " of the representation space is exceedingly challenging. Following works [24, 63], we leverage lossy data coding, a computationally feasible alternative, as a surrogate for the entropy of continuous random variables " + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "inline_equation", + "content": "H(\\mathbf{z})" + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "text", + "content": ". This approach involves determining the minimal number of bits required to encode a set of samples " + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "inline_equation", + "content": "\\mathbf{Z} = [\\mathbf{z}^1, \\dots, \\mathbf{z}^m] \\in \\mathbb{R}^{d \\times m}" + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "text", + "content": " subject to a distortion " + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "inline_equation", + "content": "\\varepsilon" + }, + { + "bbox": [ + 130, + 325, + 479, + 396 + ], + "type": "text", + "content": ", as defined by the coding length function below [47, 72]:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 222, + 405, + 479, + 430 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 222, + 405, + 479, + 430 + ], + "spans": [ + { + "bbox": [ + 222, + 405, + 479, + 430 + ], + "type": "interline_equation", + "content": "L = \\left(\\frac {m + d}{2}\\right) \\log \\det \\left(\\mathbf {I} + \\frac {d}{m \\varepsilon^ {2}} \\mathbf {Z} ^ {T} \\mathbf {Z}\\right), \\tag {3}", + "image_path": "79fc461bc67f47c23c32af28acc19822066cb223e96828bd4fe71ec386ba514d.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "spans": [ + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\varepsilon" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": " is the upper bound of the expected decoding error between " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\mathbf{z} \\in \\mathbf{Z}" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": " and the decoded " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{z}}" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\operatorname*{det}(\\cdot)" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": " is the determinant of a matrix. " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": " is the dimension of the feature space. Utilizing the identity " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\operatorname*{det}(\\exp (\\mathbf{A})) = \\exp (\\mathrm{Tr}(\\mathbf{A}))" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": ", we derive " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "L = \\operatorname{Tr}\\left(\\mu \\log \\left(\\mathbf{I} + \\lambda \\mathbf{Z}^T\\mathbf{Z}\\right)\\right)" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\operatorname{Tr}" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": " denotes the trace of the matrix and " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\mu = \\frac{m + d}{2}" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "inline_equation", + "content": "\\lambda = \\frac{d}{m\\varepsilon^2}" + }, + { + "bbox": [ + 131, + 437, + 479, + 509 + ], + "type": "text", + "content": ". Finally, we apply a Taylor series expansion to the logarithm of the matrix to obtain:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 228, + 517, + 479, + 547 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 517, + 479, + 547 + ], + "spans": [ + { + "bbox": [ + 228, + 517, + 479, + 547 + ], + "type": "interline_equation", + "content": "L = \\operatorname {T r} \\left(\\mu \\sum_ {n = 1} ^ {\\infty} \\frac {(- 1) ^ {n - 1}}{n} \\left(\\lambda \\mathbf {Z} ^ {T} \\mathbf {Z}\\right) ^ {n}\\right), \\tag {4}", + "image_path": "c306455aa2b113c56602af047361bce713fa156497f905ac1f763acf9bd01db1.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "text", + "content": "because the features " + }, + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "text", + "content": " are projected into spherical space " + }, + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "inline_equation", + "content": "\\mathbb{S}^{d - 1}" + }, + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "inline_equation", + "content": "\\operatorname{Tr}\\left(\\mu \\lambda \\mathbf{Z}^T\\mathbf{Z}\\right) = m\\mu \\lambda" + }, + { + "bbox": [ + 130, + 555, + 479, + 604 + ], + "type": "text", + "content": ". Hence, the first term does not contribute to the reconstruction learning. In essence, self-conditional generation primarily diminishes the inter-data similarity within the feature space:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 181, + 612, + 479, + 642 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 612, + 479, + 642 + ], + "spans": [ + { + "bbox": [ + 181, + 612, + 479, + 642 + ], + "type": "interline_equation", + "content": "L = - \\frac {\\mu \\lambda^ {2}}{2} \\operatorname {T r} \\left(\\left(\\mathbf {Z} ^ {T} \\mathbf {Z}\\right) ^ {2}\\right) - \\mathbf {R} = - \\frac {\\mu \\lambda^ {2}}{2} \\sum_ {i = 1} ^ {m} \\sum_ {j = 1} ^ {m} \\left(\\mathbf {z} _ {i} ^ {T} \\mathbf {z} _ {j}\\right) ^ {2} - \\mathbf {R}, \\tag {5}", + "image_path": "e3860f333fa605fbea3ff60f040974c6c7966ba779202b099263fbfcd2f890c1.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 651, + 309, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 651, + 309, + 667 + ], + "spans": [ + { + "bbox": [ + 131, + 651, + 309, + 667 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 651, + 309, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{R} = \\sum_{n=3}^{\\infty} \\frac{(-1)^n \\mu \\lambda^n}{n} \\operatorname{Tr}\\left(\\left(\\mathbf{Z}^T \\mathbf{Z}\\right)^n\\right)" + }, + { + "bbox": [ + 131, + 651, + 309, + 667 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 443, + 140 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 443, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 443, + 140 + ], + "type": "text", + "content": "3.2 Idempotent Generative Models as Spectral Contrastive Learning" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "spans": [ + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "text", + "content": "The idempotence of a self-conditional generative model refers to its stability in re-encoding [57]. More precisely, if we denote the original data as " + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "text", + "content": ", the encoder as " + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "text", + "content": ", the encoded feature as " + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "inline_equation", + "content": "\\mathbf{z} = f(\\mathbf{x})" + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "text", + "content": ", the decoder as " + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "text", + "content": ", and the reconstruction as " + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{x}} = g(\\mathbf{z})" + }, + { + "bbox": [ + 130, + 147, + 482, + 207 + ], + "type": "text", + "content": ", then the self-conditional generative model is considered idempotent:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 246, + 217, + 480, + 229 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 246, + 217, + 480, + 229 + ], + "spans": [ + { + "bbox": [ + 246, + 217, + 480, + 229 + ], + "type": "interline_equation", + "content": "f (\\hat {\\mathbf {x}}) = \\mathbf {z} \\quad \\text {o r} \\quad g (f (\\hat {\\mathbf {x}})) = \\hat {\\mathbf {x}}. \\tag {6}", + "image_path": "5313b080aced6c69f884a7a348dfcb5c7d8afdb71ac9931e71328e40e46c11c1.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 238, + 481, + 262 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 238, + 481, + 262 + ], + "spans": [ + { + "bbox": [ + 131, + 238, + 481, + 262 + ], + "type": "text", + "content": "Idempotence is frequently employed in the generative domain to augment the perceptual loss of generated images. The idempotent loss is formulated as:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 228, + 270, + 480, + 284 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 270, + 480, + 284 + ], + "spans": [ + { + "bbox": [ + 228, + 270, + 480, + 284 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {i d e}} = \\left\\| f (\\hat {\\mathbf {x}}) - \\mathbf {z} \\right\\| ^ {2} = - 2 f (\\hat {\\mathbf {x}}) ^ {T} f (\\mathbf {x}), \\tag {7}", + "image_path": "1f363244176280a3ed7dab3d4c22bc6387ec3cf99b060622bd288ec31b95a562.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 292, + 482, + 340 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 292, + 482, + 340 + ], + "spans": [ + { + "bbox": [ + 131, + 292, + 482, + 340 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 292, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\mathbf{z}^T\\mathbf{z} = 1" + }, + { + "bbox": [ + 131, + 292, + 482, + 340 + ], + "type": "text", + "content": " because we normalize the feature space. Therefore, the idempotent generative model maximizes the entropy of the feature space while simultaneously minimizing the feature distance between the data and the generated data. The total loss of the idempotent generative model is expressed as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 134, + 350, + 500, + 446 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 350, + 500, + 446 + ], + "spans": [ + { + "bbox": [ + 134, + 350, + 500, + 446 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} = \\mathcal {L} _ {\\mathrm {i d e}} - L = - 2 \\sum_ {\\mathbf {x}, \\hat {\\mathbf {x}}} p (\\mathbf {x}, \\hat {\\mathbf {x}}) f (\\hat {\\mathbf {x}} _ {i}) ^ {T} f (\\mathbf {x} _ {i}) + \\sum_ {\\mathbf {x}, \\mathbf {x} ^ {\\prime}} p (\\mathbf {x}) p (\\mathbf {x} ^ {\\prime}) \\left(f (\\mathbf {x}) ^ {T} f (\\mathbf {x} ^ {\\prime})\\right) ^ {2} + \\mathbf {R} \\\\ = - 2 \\mathbb {E} _ {(\\mathbf {x}, \\hat {\\mathbf {x}}) \\sim p (\\mathbf {x}, \\hat {\\mathbf {x}})} \\left[ f (\\hat {\\mathbf {x}}) ^ {T} f (\\mathbf {x}) \\right] + \\mathbb {E} _ {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim p (\\mathbf {x}) p (\\mathbf {x} ^ {\\prime})} \\left[ \\left(f (\\mathbf {x}) ^ {T} f (\\mathbf {x} ^ {\\prime})\\right) ^ {2} \\right] + \\mathbf {R} \\\\ = - 2 \\operatorname {T r} \\left(\\mathbf {F} \\mathbf {A} \\mathbf {F} ^ {T}\\right) + \\operatorname {T r} \\left(\\left(\\mathbf {F} ^ {T} \\mathbf {F}\\right) ^ {2}\\right) + \\mathbf {R} = 2 \\operatorname {T r} \\left(\\mathbf {F} \\mathbf {L} \\mathbf {F} ^ {T}\\right) + \\operatorname {T r} \\left(\\left(\\mathbf {F} ^ {T} \\mathbf {F}\\right) ^ {2}\\right) + \\mathbf {R} + \\text {c o n s t} \\\\ = \\left\\| \\mathbf {A} - \\mathbf {F} ^ {T} \\mathbf {F} \\right\\| _ {F} ^ {2} + \\mathbf {R} + \\text {c o n s t}, \\tag {8} \\\\ \\end{array}", + "image_path": "892de3906c8493e2141d7410c76bf16b852ad2bf75b9f453d0a4b128792998c4.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "spans": [ + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "inline_equation", + "content": "\\mathbf{A} \\in \\mathbb{R}^{m \\times m}" + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "text", + "content": " is the adjacency matrix defined by the data generation. " + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "inline_equation", + "content": "\\mathbf{F} = \\mathbf{Z} \\mathrm{diag}(\\sqrt{p(\\mathbf{x})})" + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "text", + "content": " The weights " + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "inline_equation", + "content": "\\mathbf{A}_{\\mathbf{x},\\hat{\\mathbf{x}}} = \\frac{p(\\mathbf{x},\\hat{\\mathbf{x}})}{\\sqrt{p(\\mathbf{x})p(\\hat{\\mathbf{x}})}}" + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "inline_equation", + "content": "\\mathbf{L} = \\mathbf{I} - \\mathbf{A}" + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "text", + "content": " is the Laplacian matrix. This demonstrates its equivalence to spectral contrastive learning. And the advantage of our approach over spectral contrastive learning is that we additionally optimise the residual term " + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "inline_equation", + "content": "\\mathbf{R}" + }, + { + "bbox": [ + 130, + 447, + 482, + 512 + ], + "type": "text", + "content": " to capture higher order information." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 512, + 482, + 572 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 512, + 482, + 572 + ], + "spans": [ + { + "bbox": [ + 130, + 512, + 482, + 572 + ], + "type": "text", + "content": "Further, we exploit data idempotence and feature idempotence to enhance representation learning and action generation. The unified generative-perceptual model contains both an encoder " + }, + { + "bbox": [ + 130, + 512, + 482, + 572 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 512, + 482, + 572 + ], + "type": "text", + "content": " and generator " + }, + { + "bbox": [ + 130, + 512, + 482, + 572 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 512, + 482, + 572 + ], + "type": "text", + "content": ". And our idempotency constraints pay attention to both the data and the feature distributions, which improves both generation and feature learning." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 228, + 582, + 480, + 594 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 582, + 480, + 594 + ], + "spans": [ + { + "bbox": [ + 228, + 582, + 480, + 594 + ], + "type": "interline_equation", + "content": "(g \\circ f) (\\mathbf {x}) = \\mathbf {x} \\quad \\text {a n d} \\quad (f \\circ g) (\\mathbf {z}) = \\mathbf {z}. \\tag {9}", + "image_path": "7b05d1a70d3fa2e6fe7da3134c57bc072367dc635ee5b12b1d13d05fa481e5a5.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 610, + 354, + 623 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 610, + 354, + 623 + ], + "spans": [ + { + "bbox": [ + 131, + 610, + 354, + 623 + ], + "type": "text", + "content": "3.3 Relationship to Masked Auto-Encoder" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "As mentioned in Eq. 2, the generative network without idempotent constraints has a conditional entropy " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "H(\\mathbf{z}|\\mathbf{x})" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": " of 0 because the encoding process is deterministic. Idempotent generative networks, on the other hand, treat features " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": " as a" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 101 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "random variable sampled from the distribution of features across all of the generated data " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{x}}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " for the same data " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": ", thus transforming into a non-deterministic process:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 258, + 152, + 480, + 165 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 152, + 480, + 165 + ], + "spans": [ + { + "bbox": [ + 258, + 152, + 480, + 165 + ], + "type": "interline_equation", + "content": "\\mathbf {z} = f (\\hat {\\mathbf {x}}), \\quad \\hat {\\mathbf {x}} \\sim G (\\mathbf {x}), \\tag {10}", + "image_path": "cbb6c6fdfb9a622fe50b8f62ebb05ec7087f5ec9f7a9678ab34200cce5977ec2.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 167, + 479, + 203 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 167, + 479, + 203 + ], + "spans": [ + { + "bbox": [ + 130, + 167, + 479, + 203 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 167, + 479, + 203 + ], + "type": "inline_equation", + "content": "G(\\cdot)" + }, + { + "bbox": [ + 130, + 167, + 479, + 203 + ], + "type": "text", + "content": " is the generation process. Therefore, idempotent constraints are essentially about diminishing conditional entropy " + }, + { + "bbox": [ + 130, + 167, + 479, + 203 + ], + "type": "inline_equation", + "content": "H(\\mathbf{z}|\\mathbf{x})" + }, + { + "bbox": [ + 130, + 167, + 479, + 203 + ], + "type": "text", + "content": ", which in turn maximizes the mutual information between features and data." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 204, + 479, + 227 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 204, + 479, + 227 + ], + "spans": [ + { + "bbox": [ + 130, + 204, + 479, + 227 + ], + "type": "text", + "content": "In contrast, methods like MAE implicitly prioritize maximizing feature similarity across masked samples of the same data:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 257, + 233, + 480, + 246 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 233, + 480, + 246 + ], + "spans": [ + { + "bbox": [ + 257, + 233, + 480, + 246 + ], + "type": "interline_equation", + "content": "\\mathbf {z} = f (\\hat {\\mathbf {x}}), \\quad \\hat {\\mathbf {x}} \\sim M (\\mathbf {x}), \\tag {11}", + "image_path": "8516bd2176730de06718ee1ff58ee5a4f86d012d82b2a66305d26df1efd9a281.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "type": "inline_equation", + "content": "M(\\cdot)" + }, + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "type": "text", + "content": " is the random masking process. Consequently, features from two distinct data that undergo similar transformed or generated data are clustered into the same class. However, the data obtained through data transformation may not be the real data and thus far from the real data distribution." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 313, + 336, + 325 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 313, + 336, + 325 + ], + "spans": [ + { + "bbox": [ + 131, + 313, + 336, + 325 + ], + "type": "text", + "content": "3.4 Relationship to Downstream Tasks" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "spans": [ + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "text", + "content": "Through the analysis of previous work [7, 12, 13, 54, 67] on spectral contrastive learning, the error rate " + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "inline_equation", + "content": "P_{e} = P[\\phi(\\mathbf{x}) \\neq y_{\\mathbf{x}}]" + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "text", + "content": " of the downstream linear evaluation " + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "inline_equation", + "content": "\\phi(\\cdot)" + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "text", + "content": " can be bounded by the generated adjacency matrix " + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "inline_equation", + "content": "\\mathbf{A}" + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "text", + "content": " and clustering error probabilities " + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "inline_equation", + "content": "\\alpha = P[y_{\\mathbf{x}} \\neq y_{\\hat{\\mathbf{x}}}]" + }, + { + "bbox": [ + 130, + 330, + 479, + 378 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "spans": [ + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "text", + "content": "Theorem 1. If " + }, + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "inline_equation", + "content": "\\lambda_1 \\geq \\lambda_2 \\geq \\dots \\geq \\lambda_m" + }, + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "text", + "content": " are the eigenvalues of " + }, + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "inline_equation", + "content": "\\mathbf{A}" + }, + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "text", + "content": ", and if the clustering purity is " + }, + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "inline_equation", + "content": "1 - \\alpha" + }, + { + "bbox": [ + 131, + 381, + 479, + 406 + ], + "type": "text", + "content": ", we obtain:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 257, + 411, + 480, + 441 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 411, + 480, + 441 + ], + "spans": [ + { + "bbox": [ + 257, + 411, + 480, + 441 + ], + "type": "interline_equation", + "content": "P _ {e} \\leq c _ {1} \\sum_ {i = d + 1} ^ {m} \\lambda_ {i} ^ {2} + c _ {2} \\alpha , \\tag {12}", + "image_path": "5ab5c8e6b85b840241f59046ed6a6490befa3a79991c24d336e6000ac692ad53.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 447, + 273, + 458 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 447, + 273, + 458 + ], + "spans": [ + { + "bbox": [ + 131, + 447, + 273, + 458 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 447, + 273, + 458 + ], + "type": "inline_equation", + "content": "c_{1}, c_{2}" + }, + { + "bbox": [ + 131, + 447, + 273, + 458 + ], + "type": "text", + "content": " are some constants." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 462, + 479, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 479, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 479, + 544 + ], + "type": "text", + "content": "This theorem illustrates the constraints on accuracy imposed by the purity " + }, + { + "bbox": [ + 130, + 462, + 479, + 544 + ], + "type": "inline_equation", + "content": "1 - \\alpha" + }, + { + "bbox": [ + 130, + 462, + 479, + 544 + ], + "type": "text", + "content": ". A large purity and a small number of clusters result in a low error rate. When the diversity in the generated data is insufficient, the sum of small singular values of the adjacency matrix become large, resulting in less tightly clustered groups. Conversely, excessive diversity in the generated data may compromise the preservation of motion information, thereby increasing the error rate in clustering and undermining overall clustering effectiveness." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 546, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 480, + 665 + ], + "type": "text", + "content": "Therefore, to make the feature space of the idempotent generative model more capable of clustering, it is necessary to increase the diversity of the generated data for a stronger feature consistency constraint. However, a paradox is demonstrated here. Ordinary generative processes result in limited diversity under self-conditional generation due to constraints on the distance between the generated data and the original data. So in order to simultaneously obtain diverse and motion semantics preserving generated data, we propose an idempotent self-conditional generation model based on the diffusion generation model. The diversity of the generated data is provided by the noise sampling process of the diffusion model." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 117, + 479, + 209 + ], + "blocks": [ + { + "bbox": [ + 135, + 117, + 479, + 209 + ], + "lines": [ + { + "bbox": [ + 135, + 117, + 479, + 209 + ], + "spans": [ + { + "bbox": [ + 135, + 117, + 479, + 209 + ], + "type": "image", + "image_path": "fd3a0edb948962198734cff9ef6a12384b04a2d15fd8ea6976b1af3f11b098a0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "lines": [ + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "spans": [ + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "text", + "content": "Fig. 1: We perform data augmentations on the data first and then obtain the conditional features through the encoder " + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "text", + "content": ". The noise skeleton is then obtained using Diffusion Sampling. The noise skeleton and conditions are fed into the generator " + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "text", + "content": " for denoising. The adapter " + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "inline_equation", + "content": "h(\\cdot)" + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "text", + "content": " plays a pivotal role in projecting and fusing the features extracted by the encoder " + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 229, + 482, + 384 + ], + "type": "text", + "content": " into the generator's feature space for use as conditions. In the adapter, (a) involves computing similarity using spatio-temporal tokens within the sequence. (b) calculates similar tokens based on the similarity of each token. (c) entails de-correlation by subtracting similar tokens. This integration expands the effective feature dimension of the feature space, facilitating more robust and comprehensive representation. We utilize two losses in our model: Diffusion's noise prediction loss and idempotent feature constraints, which respectively constrain feature similarity and distributional similarity. Thus, the feature consistency is improved, leading to not only improved recognition capture but also the perceptual reconstruction quality of the generative model." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 408, + 364, + 420 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 364, + 420 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 364, + 420 + ], + "type": "text", + "content": "3.5 Idempotent Diffusion Generation Model" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": "Our model consists of three parts, an encoder " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": ", a generator " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": " and an adapter " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "h(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": ". The encoder " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": " extracts features " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": " as conditions for the generator " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": " and also as inputs to the downstream task classifier " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\phi(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": ". And the generator " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": " reconstructs the skeleton data based on the features. The adapter " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "h(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": ", in turn, is responsible for projecting and fusing the features extracted by the encoder " + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 430, + 482, + 501 + ], + "type": "text", + "content": " into the generator's feature space to be used as conditions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "text", + "content": "Encoder " + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "text", + "content": ": We start by applying some data augmentations to the data " + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "text", + "content": " to obtain data " + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "inline_equation", + "content": "\\tilde{\\mathbf{x}}" + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "text", + "content": " for increasing diversity. Then, spatio-temporal position embeddings " + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "inline_equation", + "content": "P_{t}" + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "inline_equation", + "content": "P_{v}" + }, + { + "bbox": [ + 130, + 502, + 482, + 548 + ], + "type": "text", + "content": " are added after projection to the feature space by linear projection:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 241, + 551, + 480, + 563 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 551, + 480, + 563 + ], + "spans": [ + { + "bbox": [ + 241, + 551, + 480, + 563 + ], + "type": "interline_equation", + "content": "\\mathbf {z} = \\operatorname {L i n e a r P r o j} (\\tilde {\\mathbf {x}}) + P _ {t} + P _ {v}. \\tag {13}", + "image_path": "64cb7dbf671c167141d6d9a940aaf2cab1fe2014979f0897f44e7cebcfb41521.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 569, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 617 + ], + "type": "text", + "content": "Following that, layers of vanilla transformer blocks are employed to extract latent representations " + }, + { + "bbox": [ + 130, + 569, + 482, + 617 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 569, + 482, + 617 + ], + "type": "text", + "content": ". Each block consists of a multi-head self-attention (MSA) module and a feed-forward network (FFN) module. Residual connections are utilized within each module, which are then followed by layer normalization (LN)." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": "Generator " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": ": The generator " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": " and encoder " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": " maintain the same structure. But the input is the noise data " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": " obtained by sampling in the diffusion. The generator " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": " predicts the noise magnitude by taking noise data " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": " and feature conditions " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": " as inputs." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": "Adapter " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "h(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": ": The adapter " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "h(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " merges the features extracted by the encoder " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " into the generator " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": ". This is necessary because high-level tasks like recognition operate in a different feature space compared to low-level tasks like generation. Recognition tasks necessitate capturing high-frequency action movements while generation primarily focuses on optimizing principal component space (with large singular values), such as walking or waving, which rely more on bottom component subspace like velocity. Thus, we introduce a feature fusion method that decouples principal and bottom component subspace, allowing the encoder features to focus more on high-frequency information, making them more suitable for high-level tasks such as action recognition. These features are then injected into the bottom component feature space of the generator." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "text", + "content": "- Manifold Decoupled Feature Fusion Module: To derive discriminative features for use as semantic guides, we draw inspiration from negative samples in contrastive learning. We assume that regions with motion semantics have the lowest similarity to other regions in the same sequence. " + }, + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\mathbf{z} = [\\mathbf{z}_1,\\dots ,\\mathbf{z}_l]\\in \\mathbb{R}^{d\\times l}" + }, + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "inline_equation", + "content": "l" + }, + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "text", + "content": " is the length of tokens of " + }, + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\mathbf{z}" + }, + { + "bbox": [ + 130, + 248, + 482, + 320 + ], + "type": "text", + "content": ". The uniformity loss in contrastive learning is:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 170, + 322, + 481, + 338 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 170, + 322, + 481, + 338 + ], + "spans": [ + { + "bbox": [ + 170, + 322, + 481, + 338 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {u n i}} = \\mathbb {E} _ {\\mathbf {z} _ {i}} \\left[ \\log \\mathbb {E} _ {\\mathbf {z} _ {j}} \\left[ \\exp \\left(\\mathbf {z} _ {i} ^ {T} \\mathbf {z} _ {j}\\right) \\right] \\right] = \\operatorname {T r} \\left(\\log \\left(\\deg \\left(\\exp \\left(\\mathbf {z} ^ {T} \\mathbf {z}\\right)\\right)\\right)\\right), \\tag {14}", + "image_path": "159d42cb7b91d00488f0da994458dd989f420df61cad06835f7fd69e4474439e.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 344, + 287, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 344, + 287, + 357 + ], + "spans": [ + { + "bbox": [ + 131, + 344, + 287, + 357 + ], + "type": "text", + "content": "the derivative of " + }, + { + "bbox": [ + 131, + 344, + 287, + 357 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{uni}}" + }, + { + "bbox": [ + 131, + 344, + 287, + 357 + ], + "type": "text", + "content": " is as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 233, + 365, + 481, + 389 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 365, + 481, + 389 + ], + "spans": [ + { + "bbox": [ + 233, + 365, + 481, + 389 + ], + "type": "interline_equation", + "content": "\\hat {\\mathbf {z}} \\Leftarrow \\mathbf {z} - \\eta \\frac {\\partial \\mathcal {L} _ {\\mathrm {u n i}}}{\\partial \\mathbf {z}} = \\mathbf {z} - \\eta \\mathbf {D} ^ {\\prime - 1} \\mathbf {A} ^ {\\prime} \\mathbf {z}, \\tag {15}", + "image_path": "ba419477b252d028909939298efaab3bd1a3996ad7d8c7ca929b52b2c7b1af65.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathbf{A}' = \\exp(\\mathbf{z}^T\\mathbf{z})" + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathbf{D}' = \\deg(\\mathbf{A}')" + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathbf{D}'^{-1}\\mathbf{A}' = \\mathrm{SoftMax}(\\mathbf{z}^T\\mathbf{z})" + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{z}}" + }, + { + "bbox": [ + 131, + 399, + 482, + 437 + ], + "type": "text", + "content": " removes low-frequency information. Based on this analysis, we extract the high-frequency information of the features as semantic information:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 235, + 448, + 481, + 463 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 448, + 481, + 463 + ], + "spans": [ + { + "bbox": [ + 235, + 448, + 481, + 463 + ], + "type": "interline_equation", + "content": "\\hat {\\mathbf {z}} \\Leftarrow (1 + \\eta) \\mathbf {z} - \\eta \\operatorname {S o f t M a x} (\\mathbf {z} ^ {T} \\mathbf {z}) \\mathbf {z}. \\tag {16}", + "image_path": "d61195de288f869b3401dadcbcd712485d289aa64bd9936f90844c2b88ae37fc.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 472, + 482, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 532 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 532 + ], + "type": "text", + "content": "Through this high-pass filtering, we filter out some low-frequency information of principal component space such as the mean value in the sequences, which is not very meaningful for recognition, and retain the semantic information, which is more important for recognition. This module also mitigates dimensionality collapse, making features more informative." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 533, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 533, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 131, + 533, + 482, + 559 + ], + "type": "text", + "content": "We then fuse the features into the generator by replacing LayerNorm (LN) with Adaptive LayerNorm (AdaLN) with the following equation:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 214, + 569, + 481, + 582 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 569, + 481, + 582 + ], + "spans": [ + { + "bbox": [ + 214, + 569, + 481, + 582 + ], + "type": "interline_equation", + "content": "\\operatorname {A d a L N} (\\mathbf {h}, \\hat {\\mathbf {z}}, t) = \\hat {\\mathbf {z}} _ {s} \\cdot \\left(\\mathbf {t} _ {s} \\cdot \\operatorname {L N} (\\mathbf {h}) + \\mathbf {t} _ {b}\\right) + \\hat {\\mathbf {z}} _ {b} \\tag {17}", + "image_path": "5f19a0c2c4313f3a3657fd8ca57d8ea39c37ce3a7ca8f1580210a54d9fade1a4.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{h}" + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "content": " represents the hidden representation of the generator, " + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "inline_equation", + "content": "(\\mathbf{t}_s,\\mathbf{t}_b)" + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "inline_equation", + "content": "(\\hat{\\mathbf{z}}_s,\\hat{\\mathbf{z}}_b)" + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "content": " are obtained from linear projection of timestep embedding " + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "content": " and high-frequency condition " + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{z}}" + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "content": ", respectively. Through AdaLN layers, the condition " + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{z}}" + }, + { + "bbox": [ + 130, + 593, + 482, + 667 + ], + "type": "text", + "content": " guides the denoising process by scaling and shifting the normalized hidden representation. Idempotence Generation Loss: Our loss function comprises two components: the noise prediction loss of the diffusion model and the idempotency constraint." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "content": "- Noise Prediction Loss: The diffusion model is trained by predicting the noise from the input noise data:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 219, + 148, + 480, + 168 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 148, + 480, + 168 + ], + "spans": [ + { + "bbox": [ + 219, + 148, + 480, + 168 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {g e n}} = \\left\\| g \\left(\\mathbf {x} _ {t}, h (\\mathbf {z}), t\\right) - \\varepsilon \\right\\| ^ {2}, \\tag {18}", + "image_path": "f172edae797367ed29093bb7b8e975370547b7cb94208cea2ab421c0b7b04f0f.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 228, + 165, + 394, + 176 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 165, + 394, + 176 + ], + "spans": [ + { + "bbox": [ + 228, + 165, + 394, + 176 + ], + "type": "interline_equation", + "content": "\\mathbf {x} _ {t} = \\sqrt {\\bar {\\alpha} _ {t}} \\mathbf {x} + \\sqrt {1 - \\bar {\\alpha} _ {t}} \\varepsilon , \\quad \\varepsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}).", + "image_path": "f3042da64503c12ae98eb6fc1055f6bd9862b6d29014d0830e1727c9a027c73f.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 185, + 479, + 220 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 479, + 220 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 479, + 220 + ], + "type": "text", + "content": "- Idempotence Constraint: To obtain consistency constraints on features, we adopt two types of idempotency losses, feature idempotency constraint and distribution idempotency constraint." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 220, + 479, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 220, + 479, + 255 + ], + "spans": [ + { + "bbox": [ + 132, + 220, + 479, + 255 + ], + "type": "text", + "content": "1) Feature idempotency constraint performs on features. We use the predicted noise to perform a step of de-noising to get the estimated generated data " + }, + { + "bbox": [ + 132, + 220, + 479, + 255 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0" + }, + { + "bbox": [ + 132, + 220, + 479, + 255 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 223, + 255, + 479, + 279 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 255, + 479, + 279 + ], + "spans": [ + { + "bbox": [ + 223, + 255, + 479, + 279 + ], + "type": "interline_equation", + "content": "\\mathbf {x} _ {0} = \\frac {1}{\\sqrt {\\bar {\\alpha} t}} \\left(\\mathbf {x} _ {t} - \\sqrt {1 - \\bar {\\alpha}} g (\\mathbf {x} _ {t}, h (\\mathbf {z}), t)\\right). \\tag {19}", + "image_path": "db89862df0417eb64f9439cbb9b7e074b68f4754761b70bbcceb17916b6fa98f.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 282, + 479, + 305 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 479, + 305 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 479, + 305 + ], + "type": "text", + "content": "Therefore, the feature idempotency constraint based on this generated data " + }, + { + "bbox": [ + 132, + 282, + 479, + 305 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0" + }, + { + "bbox": [ + 132, + 282, + 479, + 305 + ], + "type": "text", + "content": " is formulated as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 208, + 312, + 479, + 341 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 312, + 479, + 341 + ], + "spans": [ + { + "bbox": [ + 208, + 312, + 479, + 341 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} _ {\\text {i d e} \\_ \\text {f e a t}} = - f (\\mathbf {x}) ^ {T} f \\left(\\mathbf {x} _ {0}, \\mathbf {z} _ {t ^ {\\prime}}, t, t ^ {\\prime}\\right), \\tag {20} \\\\ \\mathbf {z} _ {t ^ {\\prime}} = \\sqrt {\\bar {\\alpha} _ {t ^ {\\prime}}} \\mathbf {z} + \\sqrt {1 - \\bar {\\alpha} _ {t ^ {\\prime}}} \\varepsilon , \\quad \\varepsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}). \\\\ \\end{array}", + "image_path": "a42b28300b29f700a4d0254eeeee328468d0d2639a04e66f6f8e8f9a4a180937.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 350, + 479, + 372 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 350, + 479, + 372 + ], + "spans": [ + { + "bbox": [ + 132, + 350, + 479, + 372 + ], + "type": "text", + "content": "Since the generated data may be noisy, we input the noisy features and the number of time steps as auxiliary information." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 373, + 479, + 421 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 373, + 479, + 421 + ], + "spans": [ + { + "bbox": [ + 132, + 373, + 479, + 421 + ], + "type": "text", + "content": "2) Distribution idempotency constraint aims to align the feature distributions of the generated and original data. It is essential to maintain the manifold structure of the generated data consistent with the manifold of the original data. We capture the feature manifold structure through inter-feature similarity:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 178, + 429, + 479, + 442 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 178, + 429, + 479, + 442 + ], + "spans": [ + { + "bbox": [ + 178, + 429, + 479, + 442 + ], + "type": "interline_equation", + "content": "\\mathcal {P} \\left(\\mathbf {x} _ {0}\\right) = f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {X} _ {0}\\right) = \\left[ f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {x} _ {0} ^ {1}\\right), \\dots , f \\left(\\mathbf {x} _ {0}\\right) ^ {T} f \\left(\\mathbf {x} _ {0} ^ {m}\\right) \\right], \\tag {21}", + "image_path": "3a515a365c05a6409cd8f15152d07e951c52ed78de3f359a6e1df7c8410fbdee.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 451, + 479, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 451, + 479, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 451, + 479, + 474 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 451, + 479, + 474 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0^i" + }, + { + "bbox": [ + 132, + 451, + 479, + 474 + ], + "type": "text", + "content": " is " + }, + { + "bbox": [ + 132, + 451, + 479, + 474 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 132, + 451, + 479, + 474 + ], + "type": "text", + "content": "-th token data. We align it to the feature structure of the original ground truth data:" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 247, + 475, + 479, + 488 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 475, + 479, + 488 + ], + "spans": [ + { + "bbox": [ + 247, + 475, + 479, + 488 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {i d e} - \\text {d i s t}} = \\mathcal {D} \\left(\\mathcal {P} \\left(\\mathbf {x} _ {0}\\right), \\mathcal {P} (\\mathbf {x})\\right), \\tag {22}", + "image_path": "3c4ae338f2e70cdc94eaacd4337d0759289cfc127638ac71e7de1c1356bef865.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 492, + 479, + 589 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 492, + 479, + 589 + ], + "spans": [ + { + "bbox": [ + 132, + 492, + 479, + 589 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 492, + 479, + 589 + ], + "type": "inline_equation", + "content": "\\mathcal{D}(\\cdot, \\cdot)" + }, + { + "bbox": [ + 132, + 492, + 479, + 589 + ], + "type": "text", + "content": " is the distance metric between two distributions. The feature idempotency constraint captures richer structural information and allows for the construction of tighter clusters. This is because the adjacency matrix not only connects different generated data of the same data but also connects different data with similar features. Based on this idempotent alignment, we enhance the generative power of the model for stronger perceptual performance, while the encoder learns stronger feature consistency. This results in reduced singular values " + }, + { + "bbox": [ + 132, + 492, + 479, + 589 + ], + "type": "inline_equation", + "content": "\\sum_{i=d+1}^{m} \\lambda_i^2" + }, + { + "bbox": [ + 132, + 492, + 479, + 589 + ], + "type": "text", + "content": " of the adjacency matrix and better downstream task performance." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 605, + 271, + 619 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 605, + 271, + 619 + ], + "spans": [ + { + "bbox": [ + 132, + 605, + 271, + 619 + ], + "type": "text", + "content": "4 Experiment Results" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 629, + 479, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 479, + 666 + ], + "type": "text", + "content": "To evaluate the effectiveness of our approach, we conducted experiments on two benchmark datasets: the NTU RGB+D dataset [23, 35] and the PKUMMD dataset [22]." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 161, + 146, + 451, + 309 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "type": "text", + "content": "Table 1: Comparison of action recognition results with unsupervised learning approaches on NTU dataset." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 161, + 146, + 451, + 309 + ], + "lines": [ + { + "bbox": [ + 161, + 146, + 451, + 309 + ], + "spans": [ + { + "bbox": [ + 161, + 146, + 451, + 309 + ], + "type": "table", + "html": "
ModelsArchitectureNTU 60NTU 120
xviewxsubxsetxsub
Contrastive Learning:
3s-AimCLR [11]GCN83.477.866.767.9
3s-CPM [64]GCN84.978.769.668.7
3s-CMD [29]GRU90.984.176.174.7
GL-Transformer [18]Transformer83.876.368.766.0
3s-ActCLR [21]GCN88.884.375.774.3
Generative Learning:
3s-Colorization [61]DGCNN87.279.170.869.2
SkeletonMAE [58]GCN77.774.873.572.5
MAMP [28]Transformer89.184.979.178.6
Contrastive Learning & Generative Learning:
CRRL [53]GRU73.867.657.056.2
PCM³ [65]GRU90.483.977.576.3
IGM (Ours)Transformer91.286.281.480.0
", + "image_path": "ab8988fca85baf2fb676487efb206af0eeeaee829c2f2e0aa6e5164323fa736e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 140, + 361, + 277, + 475 + ], + "blocks": [ + { + "bbox": [ + 131, + 319, + 284, + 351 + ], + "lines": [ + { + "bbox": [ + 131, + 319, + 284, + 351 + ], + "spans": [ + { + "bbox": [ + 131, + 319, + 284, + 351 + ], + "type": "text", + "content": "Table 2: Comparison of action recognition results under KNN evaluation on NTU 60." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 140, + 361, + 277, + 475 + ], + "lines": [ + { + "bbox": [ + 140, + 361, + 277, + 475 + ], + "spans": [ + { + "bbox": [ + 140, + 361, + 277, + 475 + ], + "type": "table", + "html": "
Modelsxviewxsub
Contrastive Learning:
AimCLR [11]71.063.7
SkeleMixCLR [5]72.365.5
Generative Learning:
LongT GAN [69]48.139.1
MAMP [28]70.062.0
IGM w/o Lide67.264.7
IGM w/ Lide_feat70.768.4
IGM w/ Lide_dist72.169.0
IGM (Ours)72.669.3
", + "image_path": "861721225b7d3c628e377b936923bcbf9aa2c821d54dbc5c346972aea86d4d92.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 325, + 361, + 452, + 477 + ], + "blocks": [ + { + "bbox": [ + 294, + 319, + 482, + 353 + ], + "lines": [ + { + "bbox": [ + 294, + 319, + 482, + 353 + ], + "spans": [ + { + "bbox": [ + 294, + 319, + 482, + 353 + ], + "type": "text", + "content": "Table 3: Comparison of the transfer learning performance on PKUMMD II dataset with linear evaluation pretrained on NTU 60." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 325, + 361, + 452, + 477 + ], + "lines": [ + { + "bbox": [ + 325, + 361, + 452, + 477 + ], + "spans": [ + { + "bbox": [ + 325, + 361, + 452, + 477 + ], + "type": "table", + "html": "
Modelsxviewxsub
Finetune:
LongT GAN [69]-44.8
MS2L [20]-45.8
ISC [46]-51.1
Hi-TRS [3]-55.0
3s-CrosSCLR [19]-51.3
3s-AimCLR [11]42.451.6
Linear:
3s-ActCLR [21]44.555.9
MAMP [28]42.053.0
IGM (Ours)45.359.8
", + "image_path": "8261a9a0b5cf7e0ce85ae6550afe800ed693943bf405ba9cc8b1728281d8bf02.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 500, + 271, + 513 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 500, + 271, + 513 + ], + "spans": [ + { + "bbox": [ + 131, + 500, + 271, + 513 + ], + "type": "text", + "content": "4.1 Datasets and Settings" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 521, + 481, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 481, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 481, + 568 + ], + "type": "text", + "content": "NTU RGB+D Dataset 60 (NTU 60) [35] comprises a comprehensive compilation of 56,578 videos, covering 60 unique action labels. Every video includes annotations detailing the positions of 25 joints for each body, illustrating interactions among pairs and individual activities." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 569, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 628 + ], + "type": "text", + "content": "NTU RGB+D Dataset 120 (NTU 120) [23] is one of the most comprehensive datasets for recognizing actions. Encompassing 114,480 videos, it spans 120 unique action categories. This dataset documents the performance of actions by 106 individuals across diverse environments, employing 32 distinct recording configurations." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "content": "PKU Multi-Modality Dataset (PKUMMD) [22] encompasses 52 action classes and nearly 20,000 instances, with each sample comprising 25 joints, thoroughly tackling the multi-modal 3D comprehension of human actions. The" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 185, + 146, + 430, + 213 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 4: Action recognition accuracy for corruptions of test-time adaptation with single domain shift on NTU-C 60 xsub dataset." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 185, + 146, + 430, + 213 + ], + "lines": [ + { + "bbox": [ + 185, + 146, + 430, + 213 + ], + "spans": [ + { + "bbox": [ + 185, + 146, + 430, + 213 + ], + "type": "table", + "html": "
MethodJoint Noise (p, σ2)Part Occlusion
(1.0, 0.1)(1.0, 0.05)(0.5, 0.1)Right Arms
AimCLR [11]6.316.622.028.1
ActCLR [21]12.733.528.630.3
MAMP [28]2.46.15.810.7
IGM (Ours)58.763.065.356.9
", + "image_path": "4ec874f199821bbf2243404de0d75ee652006bb9b9de972ed478e21ac0b8502c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 247, + 479, + 270 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 247, + 479, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 247, + 479, + 270 + ], + "type": "text", + "content": "dataset is partitioned into two segments, with Part II showcasing more demanding data owing to heightened view diversity, resulting in skeleton noise." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "text", + "content": "For enhancing network training, all skeleton sequences undergo temporal downsampling to 120 frames. The encoder " + }, + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "text", + "content": " and generator " + }, + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "text", + "content": " are built using the Transformer architecture [59], employing hidden channels configured to a dimension of 256. To assess performance, we employ a fully connected layer " + }, + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "inline_equation", + "content": "\\phi(\\cdot)" + }, + { + "bbox": [ + 130, + 271, + 480, + 319 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 319, + 480, + 354 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 319, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 319, + 480, + 354 + ], + "type": "text", + "content": "To refine our network, we employ the Adam optimizer [30]. Training is executed on a single NVIDIA GeForce RTX 4090, employing a batch size of 128, and the network undergoes training for 400 epochs." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 372, + 301, + 384 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 372, + 301, + 384 + ], + "spans": [ + { + "bbox": [ + 132, + 372, + 301, + 384 + ], + "type": "text", + "content": "4.2 Evaluation and Comparison" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 391, + 480, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 391, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 391, + 480, + 413 + ], + "type": "text", + "content": "For a comprehensive assessment, we conduct comparative analysis of our approach with other methodologies across diverse scenarios." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "text", + "content": "Linear Evaluation. In the linear evaluation framework, we utilize an encoder " + }, + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "text", + "content": " to process the extracted features and a linear classifier " + }, + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "inline_equation", + "content": "\\phi(\\cdot)" + }, + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "text", + "content": " for action classification. The evaluation metric employed is the accuracy of action recognition. Notably, the encoder " + }, + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 415, + 480, + 485 + ], + "type": "text", + "content": " remains unchanged throughout the linear evaluation protocol. Our model demonstrates superior performance on the datasets outlined in Table 1 compared to other methodologies." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 486, + 480, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 480, + 544 + ], + "type": "text", + "content": "KNN Evaluation. In the K-Nearest Neighbors (KNN) evaluation setup, where the fixed encoder " + }, + { + "bbox": [ + 130, + 486, + 480, + 544 + ], + "type": "inline_equation", + "content": "f_{q}(\\cdot)" + }, + { + "bbox": [ + 130, + 486, + 480, + 544 + ], + "type": "text", + "content": " extracts features without any trainable parameters, our model showcases superiority in action recognition accuracy on the presented datasets. Table 2 highlights the effectiveness of our approach compared to other methods in this evaluation mechanism." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 546, + 480, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 480, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 480, + 616 + ], + "type": "text", + "content": "Transfer Learning. In the transfer learning scenario, we assess the generalization capability of our model by pretraining it on the source data using a self-supervised task. We then evaluate the model's performance on the target dataset using the linear evaluation mechanism, with the encoder " + }, + { + "bbox": [ + 130, + 546, + 480, + 616 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 546, + 480, + 616 + ], + "type": "text", + "content": " maintaining fixed parameters without additional fine-tuning. Our approach demonstrates superior performance in the transfer learning setting, as illustrated in Table 3." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "content": "Zero-Shot Domain Generalization. By applying 4 types of corruption to the validation sets of all datasets, we assess the generalization of our proposed method compared to baseline approaches. For joint noise, we add noise with a probability of " + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "content": " with a variance of " + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\sigma^2" + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "content": " to some joints. We leverage the generative" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 142, + 135, + 470, + 174 + ], + "blocks": [ + { + "bbox": [ + 170, + 114, + 442, + 126 + ], + "lines": [ + { + "bbox": [ + 170, + 114, + 442, + 126 + ], + "spans": [ + { + "bbox": [ + 170, + 114, + 442, + 126 + ], + "type": "text", + "content": "Table 5: Comparison of mask prediction results on NTU 60 xsub." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 142, + 135, + 470, + 174 + ], + "lines": [ + { + "bbox": [ + 142, + 135, + 470, + 174 + ], + "spans": [ + { + "bbox": [ + 142, + 135, + 470, + 174 + ], + "type": "table", + "html": "
MethodDDPM [15]MDM [45]SkeletonMAE [58]IGM (Ours)
MPJPE (mm)↓130.287.6329.779.2
FID↓1.781.262.691.18
", + "image_path": "c1dc2578c035199c8d872553f6faddb9169065c5e3263b0244028203855f6eba.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 194, + 217, + 421, + 293 + ], + "blocks": [ + { + "bbox": [ + 131, + 185, + 479, + 206 + ], + "lines": [ + { + "bbox": [ + 131, + 185, + 479, + 206 + ], + "spans": [ + { + "bbox": [ + 131, + 185, + 479, + 206 + ], + "type": "text", + "content": "Table 6: Analysis of module combinations on NTU 60 xsub dataset with the joint stream. \"FFM\" means Feature Fusion Module." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 194, + 217, + 421, + 293 + ], + "lines": [ + { + "bbox": [ + 194, + 217, + 421, + 293 + ], + "spans": [ + { + "bbox": [ + 194, + 217, + 421, + 293 + ], + "type": "table", + "html": "
ModuleKNNLinear
FFM h(·)Lide_featuresLide_dist
64.783.3
✓67.685.1
✓✓68.485.5
✓✓69.086.0
✓✓✓69.386.2
", + "image_path": "ffe3b67958b187daabef64696edb56c22f4763577b9bc7ce1fcd74395bdf0b9c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 327, + 479, + 374 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 327, + 479, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 479, + 374 + ], + "type": "text", + "content": "capability of our model, enabling us to denoise noisy skeleton data at test time. Subsequently, we utilize the generated skeleton data for recognition, significantly enhancing the generalization ability of our model. In Table 4, our proposed approach shows consistent and substantial performance improvements." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 376, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 376, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 376, + 482, + 472 + ], + "type": "text", + "content": "Reconstruction Evaluation. In this section, we implement IGM for mask prediction tasks. We input the masked data into the encoder to extract features as conditions for generation, noting that the reconstruction task does not require adding data transformations to the conditions. Our method is compared with diffusion-based methods DDPM and MDM in Table 5. Figs 3 and 4 show visualizations and feature visualizations of both the generated data and the ground truth data. Despite sharing the same feature distribution, the generated samples exhibit some diversity due to the noise introduced in the conditions." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 495, + 238, + 506 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 495, + 238, + 506 + ], + "spans": [ + { + "bbox": [ + 132, + 495, + 238, + 506 + ], + "type": "text", + "content": "4.3 Ablation Study" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 520, + 371, + 531 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 520, + 371, + 531 + ], + "spans": [ + { + "bbox": [ + 130, + 520, + 371, + 531 + ], + "type": "text", + "content": "Here's the modified text for the ablation experiments:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 481, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 481, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 481, + 581 + ], + "type": "text", + "content": "Analysis of Module Combination. We investigate the performance of various combinations of modules and observe that each module contributes to a certain degree of improvement. Optimal performance is attained when all three modules are combined. As depicted in Table 6, each module enhances performance." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Analysis of Mitigating Dimensional Collapse. The analysis points out that the feature space of the generated model is susceptible to dimensionality collapse, resulting in the extracted features losing the information needed for recognition. Fig. 2 shows the feature space of the encoder trained using the generative model and the feature space after Adapter. The token after removing similarity by Adapter network has higher feature values, i.e., the dimension collapse phenomenon is mitigated." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 121, + 288, + 223 + ], + "blocks": [ + { + "bbox": [ + 149, + 121, + 288, + 223 + ], + "lines": [ + { + "bbox": [ + 149, + 121, + 288, + 223 + ], + "spans": [ + { + "bbox": [ + 149, + 121, + 288, + 223 + ], + "type": "image", + "image_path": "5c9cd72496c43b2cd8ff2143dc709f3f596fa985ce8c117404c1757927077a7c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 144, + 233, + 303, + 256 + ], + "lines": [ + { + "bbox": [ + 144, + 233, + 303, + 256 + ], + "spans": [ + { + "bbox": [ + 144, + 233, + 303, + 256 + ], + "type": "text", + "content": "Fig.2: Curve of singular values with the singular value index." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 323, + 121, + 453, + 218 + ], + "blocks": [ + { + "bbox": [ + 323, + 121, + 453, + 218 + ], + "lines": [ + { + "bbox": [ + 323, + 121, + 453, + 218 + ], + "spans": [ + { + "bbox": [ + 323, + 121, + 453, + 218 + ], + "type": "image", + "image_path": "18438d80744197f459fdfd841e73215b80072108a7466325c6a9759b438f1a97.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 309, + 233, + 468, + 256 + ], + "lines": [ + { + "bbox": [ + 309, + 233, + 468, + 256 + ], + "spans": [ + { + "bbox": [ + 309, + 233, + 468, + 256 + ], + "type": "text", + "content": "Fig. 3: Visualisation of features in ground truth data and generated data." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 141, + 271, + 471, + 338 + ], + "blocks": [ + { + "bbox": [ + 141, + 271, + 471, + 338 + ], + "lines": [ + { + "bbox": [ + 141, + 271, + 471, + 338 + ], + "spans": [ + { + "bbox": [ + 141, + 271, + 471, + 338 + ], + "type": "image", + "image_path": "0fcfc9ad27f1fc507221e14fc31226fe68a6b7fc0c6d82d85d0f54cd97d13c1d.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 347, + 482, + 392 + ], + "lines": [ + { + "bbox": [ + 130, + 347, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 482, + 392 + ], + "type": "text", + "content": "Fig. 4: Visualisations of ground truth data and generated data. Above is the ground truth data, and below is the generated data. The conditions provided by the encoder are incorporated with data transformation, resulting in generated data that maintain similar motion information while exhibiting some diversity." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 415, + 225, + 427 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 415, + 225, + 427 + ], + "spans": [ + { + "bbox": [ + 132, + 415, + 225, + 427 + ], + "type": "text", + "content": "5 Conclusions" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 441, + 482, + 573 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 482, + 573 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 482, + 573 + ], + "type": "text", + "content": "In this research, we propose the skeleton-based idempotent generative model (IGM) for unsupervised representation learning, presenting a novel framework that maximizes the potential of generative models for representation learning. By implementing idempotence at both the feature level and distribution, our model enriches features with semantic information about motion, making them more suitable for recognition tasks. Additionally, as the generative model primarily focuses on the principal component space, it is more susceptible to dimensional collapse. Conversely, recognition tasks rely more on the bottom subspace. To address this imbalance, we design an adapter that fuses encoder and generator features from different subspaces, thereby enhancing the effective feature dimension of the feature space." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 592, + 246, + 605 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 592, + 246, + 605 + ], + "spans": [ + { + "bbox": [ + 132, + 592, + 246, + 605 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant No.62172020, and in part by the Key Laboratory of Science, Technology and Standard in Press Industry (Key Laboratory of Intelligent Press Media Technology)." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 138, + 140, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 480, + 172 + ], + "type": "text", + "content": "1. Bachman, P., Hjelm, R.D., Buchwalter, W.: Learning representations by maximizing mutual information across views. In: Proc. Advances in Neural Information Processing Systems (2019) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 173, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 173, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 138, + 173, + 480, + 205 + ], + "type": "text", + "content": "2. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: Proc. Int'l Conference for Machine Learning (2020) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 206, + 480, + 238 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 206, + 480, + 238 + ], + "spans": [ + { + "bbox": [ + 138, + 206, + 480, + 238 + ], + "type": "text", + "content": "3. Chen, Y., Zhao, L., Yuan, J., Tian, Y., Xia, Z., Geng, S., Han, L., Metaxas, D.N.: Hierarchically self-supervised transformer for human skeleton representation learning. In: Proc. European Conference on Computer Vision (2022) 11" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 239, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 239, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 138, + 239, + 480, + 270 + ], + "type": "text", + "content": "4. Chen, Y., Zhang, Z., Yuan, C., Li, B., Deng, Y., Hu, W.: Channel-wise topology refinement graph convolution for skeleton-based action recognition. In: Proc. Int'l Conference on Computer Vision (2021) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 271, + 480, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 271, + 480, + 304 + ], + "spans": [ + { + "bbox": [ + 138, + 271, + 480, + 304 + ], + "type": "text", + "content": "5. Chen, Z., Liu, H., Guo, T., Chen, Z., Song, P., Tang, H.: Contrastive learning from spatio-temporal mixed skeleton sequences for self-supervised skeleton-based action recognition. arXiv:2207.03065 (2022) 11" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 304, + 480, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 304, + 480, + 336 + ], + "spans": [ + { + "bbox": [ + 138, + 304, + 480, + 336 + ], + "type": "text", + "content": "6. Cheng, K., Zhang, Y., He, X., Chen, W., Cheng, J., Lu, H.: Skeleton-based action recognition with shift graph convolutional network. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 183-192 (2020) 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 337, + 480, + 368 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 480, + 368 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 480, + 368 + ], + "type": "text", + "content": "7. Du, T., Wang, Y., Wang, Y.: On the role of discrete tokenization in visual representation learning. In: Proc. Int'l Conference on Learning Representations (2023) 7" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 369, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 369, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 138, + 369, + 480, + 402 + ], + "type": "text", + "content": "8. Erhan, D., Bengio, Y., Courville, A., Manzagol, P.A., Vincent, P., Bengio, S.: Why does unsupervised pre-training help deep learning? Journal of Machine Learning Research 11(Feb), 625-660 (2010) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "text", + "content": "9. Feichtenhofer, C., Li, Y., He, K., et al.: Masked autoencoders as spatiotemporal learners. Proc. Advances in Neural Information Processing Systems 35, 35946-35958 (2022) 4" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 436, + 480, + 468 + ], + "type": "text", + "content": "0. Goutsu, Y., Takano, W., Nakamura, Y.: Motion recognition employing multiple kernel learning of fisher vectors using local skeleton features. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 468, + 480, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 480, + 501 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 480, + 501 + ], + "type": "text", + "content": "1. Guo, T., Liu, H., Chen, Z., Liu, M., Wang, T., Ding, R.: Contrastive learning from extremely augmented skeleton sequences for self-supervised action recognition. Proc. AAAI Conference on Artificial Intelligence (2022) 2, 11, 12" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 502, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 480, + 533 + ], + "type": "text", + "content": "2. Guo, X., Wang, Y., Du, T., Wang, Y.: Contranorm: A contrastive learning perspective on oversmoothing and beyond. arXiv preprint arXiv:2303.06562 (2023) 7" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 533, + 480, + 565 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 533, + 480, + 565 + ], + "spans": [ + { + "bbox": [ + 138, + 533, + 480, + 565 + ], + "type": "text", + "content": "3. HaoChen, J., Wei, C., Gaidon, A., Ma, T.: Provable guarantees for self-supervised deep learning with spectral contrastive loss, 2021. arXiv preprint arXiv:2106.041567" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 566, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 566, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 566, + 480, + 599 + ], + "type": "text", + "content": "4. He, K., Chen, X., Xie, S., Li, Y., Dóllar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2022) 4" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "type": "text", + "content": "5. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Proc. Advances in Neural Information Processing Systems 33, 6840-6851 (2020) 13" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "text", + "content": "6. Isola, P., Zoran, D., Krishnan, D., Adelson, E.H.: Learning visual groups from co-occurrences in space and time. arXiv:1511.06811 (2015) 4" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "text", + "content": "7. Jang, E., Devin, C., Vanhoucke, V., Levine, S.: Grasp2Vec: Learning object representations from self-supervised grasping. arXiv:1811.06964 (2018) 4" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "18. Kim, B., Chang, H.J., Kim, J., Choi, J.Y.: Global-local motion transformer for unsupervised skeleton-based action learning. Proc. European Conference on Computer Vision (2022) 2, 11" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 480, + 182 + ], + "type": "text", + "content": "19. Li, L., Wang, M., Ni, B., Wang, H., Yang, J., Zhang, W.: 3D human action representation learning via cross-view consistency pursuit. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2021) 11" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 182, + 480, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 480, + 214 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 480, + 214 + ], + "type": "text", + "content": "20. Lin, L., Song, S., Yang, W., Liu, J.: MS2L: Multi-task self-supervised learning for skeleton based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 2, 11" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 214, + 480, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 214, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 480, + 236 + ], + "type": "text", + "content": "21. Lin, L., Zhang, J., Liu, J.: Actionlet-dependent contrastive learning for unsupervised skeleton-based action recognition. In: CVPR (2023) 11, 12" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 236, + 480, + 267 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 480, + 267 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 480, + 267 + ], + "type": "text", + "content": "22. Liu, J., Song, S., Liu, C., Li, Y., Hu, Y.: A benchmark dataset and comparison study for multi-modal human action analytics. ACM Trans. on Multimedia Computing, Communications, and Applications (2020) 10, 11" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 267, + 480, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 267, + 480, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 480, + 300 + ], + "type": "text", + "content": "23. Liu, J., Shahroudy, A., Perez, M., Wang, G., Duan, L.Y., Kot, A.C.: NTU RGB+D 120: A large-scale benchmark for 3d human activity understanding. IEEE Trans. on Pattern Analysis and Machine Intelligence (2019) 10, 11" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 300, + 480, + 332 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 480, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 480, + 332 + ], + "type": "text", + "content": "24. Liu, X., Wang, Z., Li, Y.L., Wang, S.: Self-supervised learning via maximum entropy coding. Proc. Advances in Neural Information Processing Systems 35, 34091-34105 (2022) 5" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 332, + 480, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 332, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 132, + 332, + 480, + 365 + ], + "type": "text", + "content": "25. Liu, Z., Zhang, H., Chen, Z., Wang, Z., Ouyang, W.: Disentangling and unifying graph convolutions for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 365, + 480, + 397 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 480, + 397 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 480, + 397 + ], + "type": "text", + "content": "26. Lorre, G., Rabarisoa, J., Orcesi, A., Ainouz, S., Canu, S.: Temporal contrastive pretraining for video action recognition. In: Proceedings of the IEEE/CVF winter conference on applications of computer vision. pp. 662-670 (2020) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 397, + 480, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 480, + 429 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 480, + 429 + ], + "type": "text", + "content": "27. Lv, F., Nevatia, R.: Recognition and segmentation of 3-d human action using hmm and multi-class adaboost. In: Proc. European Conference on Computer Vision (2006) 3" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 429, + 480, + 461 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 429, + 480, + 461 + ], + "spans": [ + { + "bbox": [ + 132, + 429, + 480, + 461 + ], + "type": "text", + "content": "28. Mao, Y., Deng, J., Zhou, W., Fang, Y., Ouyang, W., Li, H.: Masked motion predictors are strong 3d action representation learners. In: Proc. Int'l Conference on Computer Vision. pp. 10181-10191 (2023) 2, 11, 12" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 461, + 480, + 494 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 461, + 480, + 494 + ], + "spans": [ + { + "bbox": [ + 132, + 461, + 480, + 494 + ], + "type": "text", + "content": "29. Mao, Y., Zhou, W., Lu, Z., Deng, J., Li, H.: CMD: Self-supervised 3d action representation learning with cross-modal mutual distillation. Proc. European Conference on Computer Vision (2022) 11" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 494, + 480, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 494, + 480, + 515 + ], + "spans": [ + { + "bbox": [ + 132, + 494, + 480, + 515 + ], + "type": "text", + "content": "30. Newey, W.K.: Adaptive estimation of regression models via moment restrictions. Journal of Econometrics (1988) 12" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 515, + 480, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 515, + 480, + 536 + ], + "spans": [ + { + "bbox": [ + 132, + 515, + 480, + 536 + ], + "type": "text", + "content": "31. Owens, A., Efros, A.A.: Audio-visual scene analysis with self-supervised multisensory features. In: Proc. European Conference on Computer Vision (2018) 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 536, + 480, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 536, + 480, + 568 + ], + "spans": [ + { + "bbox": [ + 132, + 536, + 480, + 568 + ], + "type": "text", + "content": "32. Peng, W., Hong, X., Chen, H., Zhao, G.: Learning graph convolutional network for skeleton-based human action recognition by neural searching. In: Proc. AAAI Conference on Artificial Intelligence (2020) 1" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 568, + 480, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 568, + 480, + 601 + ], + "spans": [ + { + "bbox": [ + 132, + 568, + 480, + 601 + ], + "type": "text", + "content": "33. Rai, N., Adeli, E., Lee, K.H., Gaidon, A., Niebles, J.C.: Cocon: Cooperative-contrastive learning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 3384-3393 (2021) 4" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 601, + 480, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 480, + 633 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 480, + 633 + ], + "type": "text", + "content": "34. Rao, H., Xu, S., Hu, X., Cheng, J., Hu, B.: Augmented skeleton based contrastive action learning with momentum LSTM for unsupervised action recognition. Information Sciences (2021) 2" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "text", + "content": "35. Shahroudy, A., Liu, J., Ng, T.T., Wang, G.: NTU RGB+D: A large scale dataset for 3d human activity analysis. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 10, 11" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "36. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Skeleton-based action recognition with directed graph neural networks. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 7912-7921 (2019) 3" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "text", + "content": "37. Shi, L., Zhang, Y., Cheng, J., Lu, H.: Two-stream adaptive graph convolutional networks for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 183, + 482, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 482, + 215 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 482, + 215 + ], + "type": "text", + "content": "38. Shotton, J., Sharp, T., Kipman, A., Fitzgibbon, A., Finocchio, M., Blake, A., Cook, M., Moore, R.: Real-time human pose recognition in parts from single depth images. Communications of the ACM (2013) 3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "type": "text", + "content": "39. Si, C., Chen, W., Wang, W., Wang, L., Tan, T.: An attention enhanced graph convolutional LSTM network for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 2" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 249, + 482, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 249, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 249, + 482, + 282 + ], + "type": "text", + "content": "40. Si, C., Jing, Y., Wang, W., Wang, L., Tan, T.: Skeleton-based action recognition with spatial reasoning and temporal stack learning. In: Proc. European Conference on Computer Vision. pp. 103-118 (2018) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 282, + 482, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 482, + 315 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 482, + 315 + ], + "type": "text", + "content": "41. Song, Y.F., Zhang, Z., Shan, C., Wang, L.: Constructing stronger and faster baselines for skeleton-based action recognition. IEEE transactions on pattern analysis and machine intelligence 45(2), 1474-1488 (2022) 3" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 315, + 482, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 315, + 482, + 347 + ], + "spans": [ + { + "bbox": [ + 130, + 315, + 482, + 347 + ], + "type": "text", + "content": "42. Song, Y., Zhang, Z., Shan, C., Wang, L.: Stronger, faster and more explainable: A graph convolutional baseline for skeleton-based action recognition. In: Proc. ACM Int'l Conference on Multimedia (2020) 1, 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "type": "text", + "content": "43. Su, K., Liu, X., Shlizerman, E.: Predict & cluster: Unsupervised skeleton based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 2" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 380, + 482, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 413 + ], + "type": "text", + "content": "44. Tao, L., Vidal, R.: Moving poselets: A discriminative and interpretable skeletal motion representation for action recognition. In: Proc. Int'l Conference for Machine Learning Workshops (2015) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "type": "text", + "content": "45. Tevet, G., Raab, S., Gordon, B., Shafir, Y., Cohen-Or, D., Bermano, A.H.: Human motion diffusion model. arXiv preprint arXiv:2209.14916 (2022) 13" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 435, + 482, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 435, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 482, + 456 + ], + "type": "text", + "content": "46. Thoker, F.M., Doughty, H., Snoek, C.G.: Skeleton-contrastive 3D action representation learning. In: Proc. ACM Int'l Conference on Multimedia (2021) 2, 11" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 456, + 482, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 456, + 482, + 479 + ], + "spans": [ + { + "bbox": [ + 130, + 456, + 482, + 479 + ], + "type": "text", + "content": "47. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. arXiv:1906.05849 (2019) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 479, + 482, + 502 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 502 + ], + "type": "text", + "content": "48. Tian, Y., Krishnan, D., Isola, P.: Contrastive multiview coding. In: Proc. European Conference on Computer Vision. pp. 776-794. Springer (2020) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 502, + 482, + 534 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 502, + 482, + 534 + ], + "spans": [ + { + "bbox": [ + 130, + 502, + 482, + 534 + ], + "type": "text", + "content": "49. Vemulapalli, R., Arrate, F., Chellappa, R.: Human action recognition by representing 3d skeletons as points in a lie group. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2014) 3" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 534, + 482, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 482, + 566 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 482, + 566 + ], + "type": "text", + "content": "50. Vemulapalli, R., Chellapa, R.: Rolling rotations for recognizing human actions from 3d skeletal data. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2016) 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 567, + 482, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 567, + 482, + 600 + ], + "spans": [ + { + "bbox": [ + 130, + 567, + 482, + 600 + ], + "type": "text", + "content": "51. Wang, J., Liu, Z., Wu, Y., Yuan, J.: Mining actionlet ensemble for action recognition with depth cameras. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2012) 3" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 600, + 482, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 600, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 600, + 482, + 632 + ], + "type": "text", + "content": "52. Wang, P., Yuan, C., Hu, W., Li, B., Zhang, Y.: Graph based skeleton motion representation and similarity measurement for action recognition. In: Proc. European Conference on Computer Vision. pp. 370-385 (2016) 3" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "text", + "content": "53. Wang, P., Wen, J., Si, C., Qian, Y., Wang, L.: Contrast-reconstruction representation learning for self-supervised skeleton-based action recognition. IEEE Trans. on Image Processing 31, 6224-6238 (2022) 11" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 278, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idempotent Unsupervised Representation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 643 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "54. Wang, Y., Zhang, Q., Du, T., Yang, J., Lin, Z., Wang, Y.: A message passing perspective on learning dynamics of contrastive learning. arXiv preprint arXiv:2303.04435 (2023) 7" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "type": "text", + "content": "55. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition. pp. 14668-14678 (2022) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 480, + 215 + ], + "type": "text", + "content": "56. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2018) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 480, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 480, + 247 + ], + "type": "text", + "content": "57. Xu, T., Zhu, Z., He, D., Li, Y., Guo, L., Wang, Y., Wang, Z., Qin, H., Wang, Y., Liu, J., et al.: Idempotence and perceptual image compression. arXiv preprint arXiv:2401.08920 (2024) 6" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "type": "text", + "content": "58. Yan, H., Liu, Y., Wei, Y., Li, Z., Li, G., Lin, L.: Skeletonmae: graph-based masked autoencoder for skeleton sequence pre-training. In: Proc. Int'l Conference on Computer Vision. pp. 5606-5618 (2023) 11, 13" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 282, + 480, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 480, + 313 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 480, + 313 + ], + "type": "text", + "content": "59. Yan, S., Xiong, Y., Lin, D.: Spatial temporal graph convolutional networks for skeleton-based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 3, 12" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "text", + "content": "60. Yang, S., Liu, J., Lu, S., Er, M.H., Kot, A.C.: Skeleton cloud colorization for unsupervised 3D action representation learning. In: Proc. Int'l Conference on Computer Vision (2021) 2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 347, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 480, + 380 + ], + "type": "text", + "content": "61. Yang, S., Liu, J., Lu, S., Hwa, E.M., Hu, Y., Kot, A.C.: Self-supervised 3d action representation learning with skeleton cloud colorization. IEEE Trans. on Pattern Analysis and Machine Intelligence (2023) 11" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 380, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 480, + 413 + ], + "type": "text", + "content": "62. Ye, M., Zhang, X., Yuen, P.C., Chang, S.F.: Unsupervised embedding learning via invariant and spreading instance feature. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2019) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 413, + 480, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 480, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 480, + 445 + ], + "type": "text", + "content": "63. Yu, Y., Chan, K.H.R., You, C., Song, C., Ma, Y.: Learning diverse and discriminative representations via the principle of maximal coding rate reduction. Proc. Advances in Neural Information Processing Systems 33, 9422-9434 (2020) 5" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "type": "text", + "content": "64. Zhang, H., Hou, Y., Zhang, W., Li, W.: Contrastive positive mining for unsupervised 3d action representation learning. Proc. European Conference on Computer Vision (2022) 11" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 480, + 511 + ], + "type": "text", + "content": "65. Zhang, J., Lin, L., Liu, J.: Prompted contrast with masked motion modeling: Towards versatile 3d action representation learning. In: Proc. ACM Int'l Conference on Multimedia. pp. 7175-7183 (2023) 11" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "type": "text", + "content": "66. Zhang, P., Lan, C., Zeng, W., Xing, J., Xue, J., Zheng, N.: Semantics-guided neural networks for efficient skeleton-based human action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 545, + 480, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 480, + 577 + ], + "type": "text", + "content": "67. Zhang, Q., Wang, Y., Wang, Y.: How mask matters: Towards theoretical understandings of masked autoencoders. Proc. Advances in Neural Information Processing Systems 35, 27127-27139 (2022) 7" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "type": "text", + "content": "68. Zhang, X., Xu, C., Tao, D.: Context aware graph convolution for skeleton-based action recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (2020) 1, 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "text", + "content": "69. Zheng, N., Wen, J., Liu, R., Long, L., Dai, J., Gong, Z.: Unsupervised representation learning with long-term dynamics for skeleton based action recognition. In: Proc. AAAI Conference on Artificial Intelligence (2018) 2, 11" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 205, + 100 + ], + "type": "text", + "content": "Lin et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_content_list.json b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..8f26741c801c127f59c01d2509b26c79039b8163 --- /dev/null +++ b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_content_list.json @@ -0,0 +1,1639 @@ +[ + { + "type": "text", + "text": "Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging", + "text_level": 1, + "bbox": [ + 253, + 140, + 750, + 209 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Wenhua $\\mathsf{W u}^{1}$ , Kun $\\mathsf{H u}^{1,\\star}$ , Wenxi Yue $^{1}$ , Wei Li $^{1}$ , Milena Simic $^{1}$ , Changyang $\\mathsf{L i}^{2}$ , Wei Xiang $^{3}$ , and Zhiyong Wang $^{1}$", + "bbox": [ + 246, + 233, + 754, + 265 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 The University of Sydney, Darlington NSW 2008, Australia {wenhua.wu, kun.hu, wenxi.yue, weiwilson.li, milena.simic, zhiyong.wang}@sydney.edu.au", + "bbox": [ + 274, + 276, + 723, + 318 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Sydney Polytechnic Institute Pty Ltd, Sydney, NSW, Australia chris@ruddergroup.com.au", + "bbox": [ + 282, + 319, + 718, + 345 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 School of Computing, Engineering & Mathematical Sciences, La Trobe University w.xiang@latrobe.edu.au", + "bbox": [ + 222, + 345, + 779, + 375 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Knee osteoarthritis (KOA), a common form of arthritis that causes physical disability, has become increasingly prevalent in society. Employing computer-aided techniques to automatically assess the severity and progression of KOA can greatly benefit KOA treatment and disease management. Particularly, the advancement of X-ray technology in KOA demonstrates its potential for this purpose. Yet, existing X-ray prognosis research generally yields a singular progression severity grade, overlooking the potential visual changes for understanding and explaining the progression outcome. Therefore, in this study, a novel generative model is proposed, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), for multifaceted KOA prognosis encompassing a predicted future knee X-ray scan conditioned on the baseline scan. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to conventional image-to-image generative models, identity priors regularize and guide the diffusion to focus more on the clinical nuances of the prognosis based on a contrastive learning strategy. The progression prediction module utilizes both forecasted and baseline knee scans, and a more comprehensive formulation of KOA severity progression grading is expected. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method.", + "bbox": [ + 259, + 404, + 738, + 696 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Knee Osteoarthritis $\\cdot$ Medical Imaging $\\cdot$ Medical Assessment Generation", + "bbox": [ + 259, + 708, + 740, + 734 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 758, + 374, + 773 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Knee osteoarthritis (KOA) is a common form of arthritis, mainly affecting knee joints with the symptoms of knee joint swelling, tenderness, and bone spurs.", + "bbox": [ + 212, + 787, + 785, + 818 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author.", + "bbox": [ + 217, + 824, + 385, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/dfbfac2951419f43afab0268f50557f88497a2953e595e0efb465d6cbaf26a63.jpg", + "image_caption": [ + "Fig. 1: Pipeline for KOA severity progression grading, encompassing a) predicted future knee joint X-ray scan, and b) predicted KOA progression severity grade." + ], + "image_footnote": [], + "bbox": [ + 258, + 148, + 743, + 280 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "As the major factor of physical disability, KOA has recently shown an increasing prevalence in society, especially among the elders [9]. Currently, there are rare treatments for curing KOA without physical surgery (total knee replacement) [13]. Therefore, to relieve the pain and control the progression of KOA, the diagnosis and prognosis of the disease are significant, using different clinical assessment methods, such as medical imaging scans and patients' clinic questionnaires. In specific, the imaging scans are utilized to detect the structural changes within the knee joint areas, which indicates the characteristics of KOA. Typically, the severity of KOA is measured by the Kellgren and Lawrence (KL) grading scale system, which encompasses five different levels, from grade 0 (healthy cases) to grade 4 (highly severe cases) [24].", + "bbox": [ + 212, + 353, + 787, + 521 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Compared to the extensive time and human resources required for specialists to detect changes, employing computer-aided techniques to automatically assess the severity and progression of KOA can significantly reduce time costs. This aids in the prompt diagnosis and prognosis of KOA at early stages [5,20]. Methods for grading the severity and progression of KOA have evolved from traditional machine learning approaches [34,35] to advanced deep learning techniques [7,39]. These modern approaches utilize various forms of input, including single images, multiple images, and images combined with demographic information (such as age, gender, BMI, and the WOMAC questionnaire) [27,38,42,45]. Particularly, the advancement of X-ray technology and its application in KOA significantly improves the capability to detect and monitor the progression [12,18,20]. Meanwhile, utilising the generative AI methods in the KOA analysis field focuses on augmenting the knee radiological dataset to improve the grading process [31]. Yet, existing X-ray prognosis research generally yields a singular progression severity grade using the baseline X-ray scan [1,12,18], overlooking the potential visual changes for understanding and explaining the progression outcome. However, the visually predicted outcome is also crucial in clinical practice to explain the disease trajectory.", + "bbox": [ + 212, + 521, + 787, + 794 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In addition to enhancing these methods, we hope the longitude visual content will also aid clinicians in their decision-making by providing further explainability and as domain knowledge to guide the algorithms. For the methodology part,", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "previous findings revealed that GANs yield poor bone structures and inconsistency in patients' identity information, which motivated us to devise a diffusion-based method with identity information. Identity patterns are crucial with a principle widely utilized in the forensic field. We anticipate that incorporating such information improves the consistency between baselines and synthesized longitude images.", + "bbox": [ + 212, + 146, + 782, + 234 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Therefore, in this study, a novel deep generative model, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), is proposed for multifaceted KOA prognosis. IC-RDN creates a predicted future knee X-ray scan conditioned on the baseline scan and a future KOA severity grade as illustrated in Fig. 1. Specifically, an identity prior module for guiding the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to a conventional image-to-image generative model, identity priors regularize and guide the diffusion to focus more on the clinical nuances related to the prognosis based on a contrastive learning strategy. Using both forecasted and baseline knee scans, we anticipate a more comprehensive and enhanced formulation of KOA severity progression measured in grades with the progression prediction module. Extensive experiments on a widely used public dataset, OAI [25], demonstrate the effectiveness of the proposed method.", + "bbox": [ + 212, + 238, + 784, + 434 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The key contributions of this study can be summarised in three-fold:", + "bbox": [ + 238, + 434, + 733, + 450 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- A novel deep generative model - IC-RDN is proposed for multifaceted KOA prognosis prediction for the first time, encompassing radiographic visual predictions and grading forecasting.", + "- An identity prior module for persisting patient's identity information on bone X-ray images is proposed to guide the diffusion process focusing on clinical nuances.", + "- Comprehensive experiments with the public OAI dataset demonstrate the effectiveness of the proposed method." + ], + "bbox": [ + 225, + 464, + 784, + 585 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 611, + 395, + 628 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Computer-Aid KOA Severity Grading", + "text_level": 1, + "bbox": [ + 214, + 646, + 578, + 662 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Existing studies in grading the severity of KOA can be categorised into KOA detection and KOA multi-class grading [27, 44]. The KOA detection focuses on categorising several or combined severity grades from the whole grading system to achieve a coarse-grained classification. For instance, a graph neural network has been designed to utilize the shape boundary information of knee bones for KOA detection [42]. In addition to shape, texture features have been independently utilized for KOA detection to examine the internal pixel relationship [32]. To leverage both textural and shape information, the features extracted from the shallow and deeper layers of a DenseNet model are combined, where the shallow layers contain more shape patterns and the deeper layers focus on textural information [27].", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 374, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Multiclass grading, on the other hand, concentrates more on exploring each grading severity level in the system. As the KL grades can be considered a continuous measurement, with convolution neural networks, both regression and classification strategies are studied [2, 3]. Likewise, an ordinal loss function is proposed to formulate the continuous nature of KL grades [7]. In parallel, the attention mechanisms identify the significant areas related to KOA multiclass grading [11, 45]. In [22], attention mechanisms are studied to combine and fuse multi-scale features from a network. Furthermore, to take advantage of the symmetrical structure of knee joints, a Siamese Network is employed to investigate the relationship between both knee joints. This approach facilitates the analysis of intricate KOA patterns in both fully supervised and semi-supervised manners, addressing the challenge posed by the scarcity of annotated datasets [28, 40]. Likewise, a self-supervised method has been introduced. This method leverages both X-ray and MRI images to expand the pool of positive pairs in contrastive learning settings, offering a robust solution to dataset limitations [44].", + "bbox": [ + 212, + 146, + 787, + 375 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Computer-Aid KOA Longitude Progression Grading", + "text_level": 1, + "bbox": [ + 214, + 393, + 694, + 409 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Apart from KOA severity grading, predicting the progression of the disease is also significant for medical treatment. Existing works mainly focus on different aspects in predicting the progression of KOA: 1) Knee joint pain status; 2) KOA risk factor prediction; 3) Joint space narrowing (JSN) and cartilage structural change prediction; 4) KL grade prediction; and 5) total knee replacement surgery (TKR) prediction.", + "bbox": [ + 212, + 417, + 787, + 507 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Early studies on grading the progression of KOA mainly rely on conventional machine learning algorithms. In specific, the feature selection is leveraged in filtering the significant features contributing to the progression grades [29]. Parallely, the comparison among different machine learning classifiers is conducted to select the algorithm with better progression grading performance [43]. [8] utilises the XGBoost model to predict the knee joint width as a KOA progression factor. To take advantage of various classification algorithms, the ensemble strategy is deployed among RandomForest, logistic regression, and support vector machine [23]. These machine learning-based methods show some encouraging results in feature engineering, where the extracted features are combined and utilized with methods such as multilayer perceptrons (MLPs) to predict the cartilage volume from MRI scans [15].", + "bbox": [ + 212, + 507, + 787, + 688 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "With the powered deep learning methods explored in both general and medical fields, end-to-end approaches have shown promising results in KOA progression grading. An MLP is deployed as a classifier to predict progression grades [6]. Neural Networks, otherwise, are utilised to predict pain status via extracting information from radiographics and demographics [12, 30]. Likewise, CNN-based methods are also leveraged in analysing various KOA risk factors [6] and predicting the JSN progression [1, 16]. To explore the KOA evolutionary trajectory, an Adversarial Evolving Neural Network is proposed to involve the estimated KOA patterns at different grades as auxiliary information [20]. Although predicting the direct KOA symptoms shows a clearer progression measurement, grading the", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "progression KL grades and predicting TKR are also able to illustrate the progression in the clinical assessment domain. A binary classification model is designed based on whether the patient needs to take TKR as a future event [18, 23, 41].", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Despite using medical imaging only, the information from multiple modalities, including imaging scans, clinical questionnaires, and demographics, are leveraged in a multimodal method to analyse the KOA progression comprehensively [38]. However, these studies only produce a direct outcome for progression grading ignoring the visual information from the given medical imaging techniques. Therefore, including visual information as an additional modality for analysing comprehensive multifaceted progression patterns is attractive to be explored.", + "bbox": [ + 212, + 191, + 784, + 313 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/22278a3b2b162b9c7d534811229beb0e7910216e94c0ec991b5189aa7dfa4161.jpg", + "image_caption": [ + "Fig. 2: Illustration of the proposed IC-RDN method. (a) An identity prior module formulates identity representation, which guides the diffusion process for the generation. (b) An I2I image generative network to forecast a future 12-month X-ray scan. (c) A downstream KOA progression prediction network, taking the baseline and the predicted 12-month X-ray scans as inputs." + ], + "image_footnote": [], + "bbox": [ + 232, + 347, + 774, + 580 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 729, + 380, + 748 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "As shown in Fig. 2, the proposed IC-RDN consists of three modules: 1) an identity prior module extracts patient's identity representations; 2) a diffusion-based generative module produces the future X-ray images based on the current-stage X-ray scans and the associated identity representations; and 3) a down-stream generation-guided progression prediction module that predicts the progression", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 374, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "severity using both current and generated future X-ray images to provide comprehensive multifaceted progression patterns.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 KOA Progression Radiographic Generation", + "text_level": 1, + "bbox": [ + 214, + 200, + 620, + 215 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This study incorporates X-ray medical imaging scans to predict the progression of KOA. The objective is to forecast the severity of KOA progression from two perspectives, encompassing severity grading score and visual information (i.e., a generated knee X-ray scan in the future - 12-month in this study). Initially, radiographic images for joints are captured during the baseline (first) X-ray scan, referred to as the baseline visit or 0-month visit. Patients are then asked to undergo a follow-up X-ray scan after 12 months for longitudinal tracking. Specifically, the $i^{\\text{th}}$ longitude X-ray joint pairs from the dataset is denoted as $\\mathbf{I}_{\\text{visit}}^i \\in \\{\\mathbf{I}_{\\text{baseline}}^i, \\mathbf{I}_{12\\text{-month}}^i\\}$ , where $\\mathbf{I}_{\\text{visit}}^i \\in \\mathbb{R}^{C \\times W \\times H}$ and $C, W$ and $H$ are the number of channels, the width and the height of the X-ray joint images. For notation simplicity, $\\mathbf{I}_{\\text{baseline}}^i$ and $\\mathbf{I}_{12\\text{months}}^i$ can be shortened as $\\mathbf{I}_{\\text{v00m}}^i$ and $\\mathbf{I}_{\\text{v12m}}^i$ . And the generated 12-month X-ray image for the $i^{\\text{th}}$ joint pair is denoted as $\\hat{\\mathbf{I}}_{12\\text{months}}^i$ or $\\hat{\\mathbf{I}}_{\\text{v12m}}^i$ . The corresponding severity grade for the 12-month visit is indicated by $y_{KL}^i$ and the grades produced by the prediction model are shown by $\\hat{y}_{KL}^i$ .", + "bbox": [ + 212, + 227, + 787, + 455 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Diffusion-based Visual Prognosis", + "text_level": 1, + "bbox": [ + 214, + 477, + 532, + 493 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The diffusion-based generative module in the IC-RDN is designed to produce 12-month X-ray images from baseline visit images for understanding and explaining the potential visual changes in terms of KOA patterns. This incorporates a T-step Denoising Diffusion Probabilistic Model (DDPM) [19] under an image-to-image transition manner. The DDPM consists of two primary processes: the forward (or diffusion) process and the reverse process. Typically, in the forward process, the original data $x_0 \\sim q_{data}(x_0)$ is transformed towards an isotropic Gaussian distribution. However, within our image-to-image diffusion model, the aim is to map the data $x_0 \\sim q_{data}(x_0)$ to $x_T$ , where, in our context, $x_0$ represents a 12-month visit X-ray image $\\mathbf{I}_{\\mathrm{v12m}}^i$ , and $x_T$ corresponds to the baseline visit X-ray images $\\mathbf{I}_{\\mathrm{v00m}}^i$ . This transformation is modelled as a fixed Markov Chain of length $T$ . Subsequently, the reverse process mirrors the forward process, aiming to predict $x_0$ from $x_T \\sim q_{data}(x_T)$ .", + "bbox": [ + 212, + 503, + 787, + 700 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "However, executing both processes directly in pixel space is highly resource-intensive, necessitating substantial memory and computational power. To mitigate this, a VQ-GAN-based encoder (see Fig. 2 (b.1.)) encodes $x_0$ into a latent space $z_0$ , wherein both the forward and reverse processes (see Fig. 2 (b.3.)) are performed to generate $z_T$ . A VQ-GAN-based decoder (depicted in Fig. 2 (b.2.)) then decodes $z_T$ back from the latent space to the pixel space $(x_T)$ . The objective of this stable diffusion-based approach [33] is formulated as follows:", + "bbox": [ + 212, + 700, + 787, + 806 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {L D M}} := \\mathbb {E} _ {\\varepsilon (x), \\varepsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\| \\varepsilon - \\varepsilon_ {\\theta} \\left(z _ {t}, t\\right) \\| _ {2} ^ {2} \\right], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 349, + 818, + 785, + 844 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\varepsilon_{\\theta}(z_t,t)$ denotes a denoising autoencoders (time-conditional UNet) and $\\theta$ contains the corresponding weights, where $t = 1\\dots T$ .", + "bbox": [ + 214, + 146, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Knee Joint Identity Prior and Injection", + "text_level": 1, + "bbox": [ + 214, + 198, + 586, + 214 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To persist a subject's identity information in generating the corresponding 12-month X-ray scan, an identity prior module is devised to extract the identity-sensitive patterns. Specifically, we denote the identity representation for the $i^{th}$ subject joint as $\\mathbf{F}_{\\mathrm{ID}}^i\\in \\mathbb{R}^d$ , where $d$ indicates the dimension of the identity representation. A CNN-based network $f(\\cdot)$ is designed to obtain the identity representation. Mathematically, we have:", + "bbox": [ + 214, + 222, + 782, + 313 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {F} _ {\\mathrm {I D}} ^ {i} = f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right). \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 444, + 324, + 784, + 340 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The identity information guides and regularizes the diffusion process to not only focus on the target visual domain distribution but also maintain necessary information from the subjects.", + "bbox": [ + 214, + 351, + 782, + 395 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For the supervision of $f$ to formulate identity information, it is proposed to conduct training in a contrastive learning manner. A triplet loss is introduced for this purpose as follows:", + "bbox": [ + 214, + 396, + 782, + 441 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {T r i p l e t}} = \\sum \\left[ \\left\\| f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right) - f \\left(\\mathbf {I} _ {\\mathrm {v} 1 2 \\mathrm {m}} ^ {i}\\right) \\right\\| _ {2} ^ {2} - \\left\\| f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right) - f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {k}\\right) \\right\\| _ {2} ^ {2} + \\alpha \\right] _ {+}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 232, + 450, + 784, + 477 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where a triplet is formulated as $(\\mathbf{I}_{\\mathrm{v00m}}^i,\\mathbf{I}_{\\mathrm{v12m}}^i,\\mathbf{I}_{\\mathrm{v00m}}^k)$ : $\\mathbf{I}_{\\mathrm{v00m}}^i$ indicates the anchor of current subject's joint; $\\mathbf{I}_{\\mathrm{v12m}}^i$ refers to a positive sample from the same subject's joint; $\\mathbf{I}_{\\mathrm{v00m}}^k$ is a negative sample with $i\\neq k$ ; and $\\alpha$ is a margin enforcing between positive and negative pairs. Note that the number of triplets $M$ used in the training process is defined in the experiment implementations.", + "bbox": [ + 214, + 488, + 782, + 564 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The identity information acts as a guide and regulator for the diffusion process, ensuring that it not only aligns with the target visual domain distribution but also preserves essential information pertaining to the subjects. To inject the identity into the diffusion process, a cross-attention mechanism is applied between the features from the UNet layers in $\\epsilon_{\\theta}$ and $\\mathbf{F}_{\\mathrm{ID}}$ . For the $t^{\\mathrm{th}}$ diffusion step and $j^{\\mathrm{th}}$ layer, the attention can be formulated as follows:", + "bbox": [ + 214, + 565, + 782, + 655 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {A} _ {j} = \\operatorname {S o f t m a x} \\left(\\frac {\\mathbf {Q} \\mathbf {K} ^ {\\intercal}}{\\sqrt {d}}\\right) \\mathbf {V}, \\mathbf {Q} = \\phi_ {j} \\left(z _ {t}\\right) \\mathbf {M} _ {j} ^ {Q}, \\mathbf {K} = \\mathbf {F} _ {\\mathrm {I D}} ^ {i} \\mathbf {M} _ {j} ^ {K}, \\text {a n d} \\mathbf {V} = \\mathbf {F} _ {\\mathrm {I D}} ^ {i} \\mathbf {M} _ {j} ^ {V}, \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 233, + 665, + 784, + 710 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathbf{M}^{\\circ_j}$ represents a projection matrix containing trainable weights with a projection dimension $d$ , and $\\phi_j(z_t)$ indicates the (flattened) intermediate representation of the UNet with $j^{\\mathrm{th}}$ layer. The UNet can be formulated by:", + "bbox": [ + 214, + 710, + 782, + 755 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\phi_ {j + 1} \\left(z _ {t}\\right) = \\phi_ {j} \\left(z _ {t}\\right) + \\mathbf {A} _ {j}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 768, + 784, + 782 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To this end, the IC-RDN can be learnt via the following scheme:", + "bbox": [ + 238, + 792, + 705, + 808 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {L D M - I d e n t i t y}} := \\mathbb {E} _ {\\varepsilon (x), \\varepsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\left\\| \\varepsilon - \\varepsilon_ {\\theta} \\left(z _ {t}, t, f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right)\\right) \\right\\| _ {2} ^ {2} \\right]. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 290, + 818, + 782, + 843 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 374, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.4 Generation-Guided KOA Progression Prediction", + "text_level": 1, + "bbox": [ + 215, + 146, + 663, + 162 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In addition to generating 12-month X-ray image $\\hat{\\mathbf{I}}_{\\mathrm{v}12\\mathrm{m}}^i$ for prognosis, a singular progression severity grade is predicted as well based on the baseline visit X-ray image $\\mathbf{I}_{\\mathrm{v00m}}^i$ and the generated 12-month visit X-ray image $\\hat{\\mathbf{I}}_{\\mathrm{v}12\\mathrm{m}}^i$ . Specifically, a two-stream CNN backbone with two branches $h_{\\mathrm{v00m}}(\\cdot)$ and $h_{\\mathrm{v12m}}(\\cdot)$ is applied for the two images to produce the associated representations:", + "bbox": [ + 212, + 170, + 787, + 247 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {P} _ {\\mathrm {v 0 0 m}} ^ {i} = h _ {\\mathrm {v 0 0 m}} (\\mathbf {I} _ {\\mathrm {v 0 0 m}} ^ {i}), \\mathbf {P} _ {\\mathrm {v 1 2 m}} ^ {i} = h _ {\\mathrm {v 1 2 m}} (\\hat {\\mathbf {I}} _ {\\mathrm {v 1 2 m}} ^ {i}). \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 338, + 258, + 785, + 277 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The two representations are then concatenated, denoted by $\\parallel$ , and used in a multi-layer perceptron (MLP) classifier $g(\\cdot)$ to produce the predicted progression severity grade $(\\hat{y}_{KL}^{i})$ , which can be formulated as:", + "bbox": [ + 214, + 286, + 787, + 333 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {y} _ {K L} ^ {i} = g \\left(\\mathbf {P} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i} \\| \\mathbf {P} _ {\\mathrm {v} 1 2 \\mathrm {m}} ^ {i}\\right) \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 343, + 785, + 362 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "A cross-entropy loss is leveraged in the training process to guide the prediction training process, which can be formulated as:", + "bbox": [ + 214, + 371, + 785, + 402 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {C E}} = - \\sum_ {i = 1} ^ {N} y _ {K L} ^ {i} \\log \\hat {y} _ {K L} ^ {i} \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 411, + 412, + 785, + 454 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $N$ indicates the total number of joints in the dataset.", + "bbox": [ + 214, + 458, + 648, + 474 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experimental Results and Discussion", + "text_level": 1, + "bbox": [ + 214, + 496, + 612, + 513 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Dataset and Pre-Processing", + "text_level": 1, + "bbox": [ + 214, + 527, + 493, + 544 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The longitudinal X-ray images used in this study were sourced from the Osteoarthritis Initiative (OAI) [25], which is a multi-centre and longitude study containing chronological medical imaging scans and clinical assessment records for the subjects up to 96 months. This public dataset enables researchers to explore the natural progression of osteoarthritis, identify risk factors, and evaluate biomarkers for grading the KOA severity and progression. In this study, the patients with both baseline and 12-month visits and available 12-month severity KL grades are selected. Due to some participants opting out of the follow-up study and missing recording of clinical severity grading outcome, not all have recordings for the 12-month visit image and severity KL grades. Consequently, 7,923 joints have both the KL grade available and radiographic recordings from both the baseline and 12-month visits. As the demographic information shown in Table 1, the amount of joints with changed severity grades among 12 months is much smaller than that of without changes, where only $6.15\\%$ joints show a changed severity grade. However, across these joints without the severity grade changes, the visual structural details do not remain the same, which also shows the importance of the proposed multifaceted progression predicting method. The dataset was randomly divided among subjects with a distribution of $70\\%$ , $10\\%$ , and $20\\%$ for training, validation, and testing, respectively.", + "bbox": [ + 212, + 551, + 787, + 843 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/7e7ff907abe6b49fd7765bdc5c948e805f135da80607a48066f32cbc7f2c5df2.jpg", + "table_caption": [ + "Table 1: Statistics of patients, joints and KL grades in OAI longitudinal visits" + ], + "table_footnote": [], + "table_body": "
Longitudinal VisitsPatients Available Joints Joints with KL Grades
Baseline Visit4,5519,1028,953
12-Month Visit4,7869,4188,251
Longitudinal KL Changed487 (6.15%)
Longitudinal KL Unchanged7,436 (93.85%)
Both Visits7,923
", + "bbox": [ + 241, + 170, + 761, + 260 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "As the raw data from the OAI contains bilateral knee joints and includes almost all knee bones around the joint area, knee joint localisation methods are leveraged to extract the knee joint area individually [26]. After detecting the knee joint edge, a $224 \\times 224$ region surrounding the middle of the joint was extracted from the raw data for modelling. The remaining transformation approaches for the joint images are followed [7], including adjusting the brightness, contrast and saturation of the images.", + "bbox": [ + 212, + 285, + 787, + 391 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Implementation Details", + "text_level": 1, + "bbox": [ + 215, + 411, + 455, + 426 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "A pretrained ResNet 18 on ImageNet [10] is adopted as the backbone classification model for identity detection, which extracts the identity features from the baseline X-ray scans. Within Identity Prior's contrastive learning framework, we have designated the number of triplets $M$ as 7,000 for training and 1,000 for testing. The Identity Prior training phase is fine-tuned using the Adam optimizer with a learning rate of 0.01, and the batch size for this phase is established at 128. For the training process of the diffusion-based generative module, we set the number of steps to 1,000,000 across 400 epochs. The Adam optimizer is employed here as well, with a learning rate set at $1 \\times 10^{-4}$ . The batch sizes for training and testing are 64 and 8, respectively.", + "bbox": [ + 212, + 434, + 787, + 584 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For the backbone models in the generation-guided KOA progression prediction module, various CNN methods are adopted, such as VGG 16, VGG 19, ResNet 18, ResNet 50, and DenseNet 121, for a comprehensive comparison [17,21,37]. Specifically, the backbone prediction models for both branches, corresponding to $\\mathbf{I}_{\\mathrm{v00m}}$ and $\\hat{\\mathbf{I}}_{\\mathrm{v12m}}$ , share the same architecture. In addition, the output features dimension from these backbone models is set to 128. Then the MLP classifier $g(\\cdot)$ takes the input dimension of 256, which contains two linear layers, an activation layer, and a dropout layer. The training process is conducted with a batch size of 16. An SGD optimizer is utilized with the learning rate of $5\\times 10^{-3}$ and a weight decaying factor of $5\\times 10^{-3}$ for every 5 epochs. The entire training regimen is executed using PyTorch 2.0.1 on an NVIDIA RTX A6000 with 48 GB of video memory.", + "bbox": [ + 212, + 585, + 787, + 767 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 Quantitative Performance on Visual Prognosis", + "text_level": 1, + "bbox": [ + 215, + 786, + 645, + 801 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The evaluation of the generated future X-ray images encompasses both quantitative and qualitative assessments. Quantitatively, we engage in analysis through", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 374, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/274d771f4e71e2dcf2c6b681dedb1a11f2595752ed1282eea89b3f932a434eea.jpg", + "table_caption": [ + "Table 2: Comparison of KOA progression grading performance for different visual generation methods." + ], + "table_footnote": [], + "table_body": "
MethodISProgression Grading Models - Accuracy (%)
VGG-16VGG-19ResNet-18ResNet-50DenseNet-121
Baseline Image Only-66.363.360.860.962.5
Cycle GAN [46]1.2862.564.360.361.263.6
I2I Diffusion Model2.0262.462.960.461.362.7
CXR-IRGen [36]1.7661.162.760.359.161.6
PITET GAN [4]1.6163.363.759.660.762.2
IC-RDN (ours)1.9866.865.161.161.764.4
", + "bbox": [ + 232, + 184, + 772, + 301 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "the conventional generation task metrics, inception score and a downstream task: the prediction of KOA progression severity grade. For using the inception score in this study, we use the Inception-v3 network trained on the OAI 12-month visit X-ray dataset to replace the weights pre-trained on the ImageNet [10] as the knee X-ray images are different from the natural images at both category and structural level. As shown in Table 2, the X-ray images generated by our proposed IC-RDN illustrate a similar IS with the X-ray images generated by the image-to-image diffusion model and outperform the X-ray images generated by Cycle-GAN [46] and other SOTA generative models [4,36] significantly. As for the similar IS between the proposed IC-RDN and the image-to-image diffusion model, the results show similar performance on image quality and diversity. However, the images generated by the I2I diffusion model show a minor contribution to predicting the KOA progression severity grades, and the challenge of identity inconsistency remains in the generated X-ray images from the I2I diffusion model. The detailed comparison for identity consistency is shown on Sec. 4.5.", + "bbox": [ + 212, + 335, + 787, + 575 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Although the inception score is able to show the quality and diversity of the generated future images, the downstream task of predicting the KOA progression severity grade can be more relevant to the value of how the generated future X-ray images contribute to exploring the KOA progression patterns. We have introduced the approach to predict KOA severity progression (Sec. 3.4), leveraging both the generated future X-ray image and the baseline X-ray image to determine a progression severity grade. In addition, as stated in Sec. 4.2, various CNN-based backbones are deployed in the generation-guided KOA progression prediction module. The comprehensive results among these backbone models are shown in Table. 2.", + "bbox": [ + 212, + 580, + 787, + 731 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Specifically, the predicted 12-month progression X-ray images generated by Cycle GAN, the image-to-image diffusion model, the recent SOTA generative methods, and the proposed IC-RDN are used in the generation-guided KOA progression grade prediction module separately. Accuracy is used as the evaluation method to measure the performance of predicting the progression grades. Among all backbone models used in this module, predicting the progression severity grades using X-ray images from baseline visit and generated by the pro", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "posed IC-RDN shows significantly outperformed results. In detail, the image-to-image diffusion model shows a limited contribution to providing the multifaceted KOA progression patterns. And the Cycle GAN illustrates the minor ability to enhance the performance of predicting the KOA progression severity grades. Therefore, the quantity evaluation demonstrates the added value of incorporating generated future X-ray images in enhancing the accuracy of KOA progression severity grade predictions.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/a272938258bfc1479781119f159628290821878b3f97087aacbf8159458bea25.jpg", + "image_caption": [ + "Fig. 3: Illustration of t-SNE analysis between IC-RDN (ours) and I2I diffusion model." + ], + "image_footnote": [], + "bbox": [ + 246, + 290, + 464, + 426 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/f697b1137b7aea3e817abb426bbf047b1a55b3b3e05e9c52f60fc51f7d3d7030.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 491, + 290, + 764, + 426 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To illustrate the performance of generated X-ray images contributing to predicting the KOA progression grades, the t-Distributed Stochastic Neighbor Embedding (t-SNE) technique, a sophisticated machine learning algorithm designed for the task of high-dimensional data visualization, is utilised in this study. In detail, to reduce the complex, multi-dimensional data into a two-dimensional space, t-SNE converts the high-dimensional distances between data points into conditional probabilities that represent similarities. Specifically, given a predicted X-ray image generated by the proposed IC-RDN, the trained VGG 19 network is used to produce a feature map corresponding to the KOA progression grade patterns. Then, these representations are visualised using t-SNE to show the related grades spatially. As shown in Fig. 3, the nodes with different colours indicate the corresponding grades. In Fig. 3.a, clear clusters for the KL grades of 0, 3, and 4 are located on the left and right sides. The green and yellow nodes referred to KL grades 1 and 2, show that the module for predicting the KOA progression severity grade has a minor ability to categorise these two classes, which is the challenge among different KOA progression prediction and severity grading methods [7,44]. However, in Fig. 3.b, the nodes for different grades are mixed and the cluster centres are hard to identify.", + "bbox": [ + 212, + 489, + 787, + 763 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.4 Qualitative Performance on Visual Prognosis", + "text_level": 1, + "bbox": [ + 214, + 784, + 633, + 800 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In terms of qualitative analysis, the comparison between X-ray images synthesized by the Cycle GAN and those produced by the proposed IC-RDN offers", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 374, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/4f1f5724383ec7204c7cade9f4075ad742003af3cc2a477cd50d669bab99563c.jpg", + "image_caption": [ + "Fig. 4: Comparison of generated X-ray images from Cycle GAN [46] and our proposed IC-RDN on knee joints i-viii." + ], + "image_footnote": [], + "bbox": [ + 228, + 155, + 777, + 308 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/f55f59e1b2f7fa92967ec747c61c7914919979bfa1208ed71f2ed0a7c878f0ee.jpg", + "image_caption": [ + "Fig. 5: Generative results from IC-RDN among different patients' joints from i to xxii. The detailed joint structure comparison between baseline visit images, ground truth and results from IC-RDN shows our model's ability to generate progression patterns." + ], + "image_footnote": [], + "bbox": [ + 230, + 369, + 772, + 588 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "a compelling visual assessment, as depicted in Fig. 4. The comparative study highlights notable distortions in bone structures emanating from the Cycle GAN approach, particularly in the articulation of joint spaces. In stark contrast, our proposed IC-RDN exhibits a pronounced fidelity in preserving the integrity of key bone edges and the intricacy of inner textures, thereby underscoring the superior capability of IC-RDN in maintaining structural information.", + "bbox": [ + 212, + 672, + 787, + 763 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Further elucidation is provided through an expanded corpus of X-ray images generated by the IC-RDN, which is shown in Fig. 5. This compilation serves not only to reinforce the initial observations regarding the preservation of critical structural details but also to demonstrate the consistent performance of the IC-RDN across a diverse set of examples. The consistent replication of complex", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "anatomical features by the IC-RDN model is indicative of its sophisticated understanding of underlying bone structures, which is paramount for illustrating the multifaceted KOA progression patterns.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Moreover, this comparison elucidates the inherent limitations of traditional GAN-based approaches in contexts where the preservation of exact structural features is paramount. The propensity for distortion within Cycle GAN-generated images can significantly impact the clinical utility of such synthesized X-ray images, particularly in monitoring the KOA progression. In contrast, the proposed IC-RDN shows its adeptness at capturing and reproducing the nuanced details of bone structure suggesting its potential as a multifaceted KOA progression prediction outcome.", + "bbox": [ + 212, + 194, + 787, + 316 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/4b037f89626a37ef16e99aaf55f9ec8f78425b41fca351fb41e896b76abe3b5d.jpg", + "image_caption": [ + "Fig. 6: Examples of generated X-ray images with identity consistency for joint i-x. The first line (outputs from the Image-to-Image Diffusion Model) shows the generative results without Identity Prior. The second line indicates the ground truth images. The third line refers to the results generated by our IC-RDN approach." + ], + "image_footnote": [], + "bbox": [ + 228, + 349, + 764, + 486 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.5 Analysis on Identity Consistency", + "text_level": 1, + "bbox": [ + 215, + 623, + 532, + 638 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "To further evaluate the efficacy of the identity prior module, we delve into a comprehensive comparison involving the X-ray images generated by the I2I diffusion model and the proposed IC-RDN. The visual examples presented in Fig. 6 meticulously outline the distinctions between these methods alongside the actual 12-month visit X-ray images, where the key differences are highlighted by the bounding boxes. Initially, we observe the generated X-ray images devoid of identity persistency, which starkly contrasts with the subsequent imagery. A noteworthy observation is the preservation of identity features in the X-rays produced by our IC-RDN, as evidenced by the distinct texture and precision of bone edge structures. This preservation extends to intricate details within the knee joint, such as the orientation of the menisci and the nuanced protrusions along the bone edges, which are critical for maintaining identity persistency.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 374, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.6 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 146, + 388, + 162 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "To better evaluate the contribution of the proposed Identity Prior module, an ablation study is conducted by removing the Identity Prior and only the Diffusion backbone remaining. The results in Table 3 demonstrate the effectiveness of the Identity Prior module with a superior longitude prediction accuracy among all selected classification methods.", + "bbox": [ + 212, + 169, + 787, + 244 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/3d6ca2d20ae1c138a489f299358cb4a00b712a28a98b5467160bdd2211efce77.jpg", + "table_caption": [ + "Table 3: Ablation study of the proposed IC-RDN" + ], + "table_footnote": [], + "table_body": "
MethodISProgression Grading Models - Accuracy (%)
VGG16VGG19ResNet18ResNet50DenseNet121
IC-RDN w/o Identity Prior1.7261.661.760.261.062.5
IC-RDN (ours)1.9866.865.161.161.764.4
", + "bbox": [ + 220, + 292, + 781, + 354 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "4.7 Limitations", + "text_level": 1, + "bbox": [ + 215, + 404, + 356, + 417 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The major limitation of this study regards the generation quality. Directly using X-ray scans generated by IC-RDN for a KOA severity grading showcases a suboptimal result compared with using the baseline visit X-ray to predict the KOA progression grade directly. Though the predicted 12-month scan can enhance the KOA severity prediction with using the baseline visit jointly. In addition, computer hallucinations [14] are a crucial issue among large model fields. Particularly, the analysis regarding the disease-specific changes is insufficient. Therefore, careful consideration of applying the generative method to actual clinical usage is needed.", + "bbox": [ + 212, + 426, + 787, + 561 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 583, + 359, + 599 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this study, a generative-based method, IC-RDN is proposed for KOA prognosis, which forecasts future X-ray scans for joints and singular progression KOA severity grades. This obtains multifaceted KOA progression patterns for understanding and explaining KOA prognosis. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced for regularising and guiding the diffusion to focus more on the clinical nuances related to the prognosis and producing a more precise KOA severity progression grading. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method. In our future studies, the disentanglement of the representations related to the identity and KOA severity will be explored for fine-grained guidance in the X-ray image generation process. Meanwhile, the multimodal patterns among different medical imaging scans (e.g. X-ray, MRI, and CT) and patients' demographic information will be involved in producing a fine-grained KOA progression assessment outcome.", + "bbox": [ + 212, + 613, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This study was partially supported by Australian Research Council (ARC) grant DP210102674. The OAI [25] is a public-private partnership comprised of five contracts (N01-AR-2-2258; N01-AR2-2259; N01-AR-2-2260; N01-AR-2-2261; N01-AR-2-2262) funded by the National Institutes of Health, a branch of the Department of Health and Human Services, and conducted by the OAI Study Investigators.", + "bbox": [ + 212, + 172, + 787, + 263 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 282, + 321, + 297 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Almhdie-Imjabbar, A., Nguyen, K.L., Toumi, H., Jennane, R., Lespessailles, E.: Prediction of knee osteoarthritis progression using radiological descriptors obtained from bone texture analysis and siamese neural networks: data from OAI and most cohorts. Arthritis Research & Therapy 24(1), 1-13 (2022)", + "2. Antony, J., McGuinness, K., Moran, K., O'Connor, N.E.: Automatic detection of knee joints and quantification of knee osteoarthritis severity using convolutional neural networks. In: International Conference on Machine Learning and Data Mining. vol. 10358, pp. 376-390. Springer (2017)", + "3. Antony, J., McGuinness, K., O'Connor, N.E., Moran, K.: Quantifying radiographic knee osteoarthritis severity using deep convolutional neural networks. In: Int. Conf. Pattern Recog. pp. 1195-1200. IEEE (2016)", + "4. Berman, O., Oz, N., Mendlovic, D., Sochen, N., Cohen, Y., Klapp, I.: PETITGAN: physically enhanced thermal image-translating generative adversarial network. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1607-1616 (2024)", + "5. Brahim, A., Jennane, R., Riad, R., Janvier, T., Khedher, L., Toumi, H., Lesspessailles, E.: A decision support tool for early detection of knee osteoarthritis using x-ray imaging and machine learning: data from the Osteoarthritis Initiative. Computerized Medical Imaging and Graphics 73, 11-18 (2019)", + "6. Chan, L., Li, H., Chan, P., Wen, C.: A machine learning-based approach to decipher multi-etiology of knee osteoarthritis onset and deterioration. Osteoarthritis and Cartilage Open 3(1), 100135 (2021)", + "7. Chen, P., Gao, L., Shi, X., Allen, K., Yang, L.: Fully automatic knee osteoarthritis severity grading using deep neural networks with a novel ordinal loss. Comput. Med. Imag. Grap. 75, 84-92 (2019)", + "8. Cheung, J.C.W., Tam, A.Y.C., Chan, L.C., Chan, P.K., Wen, C.: Superiority of multiple-joint space width over minimum-joint space width approach in the machine learning for radiographic severity and knee osteoarthritis progression. Biology 10(11), 1107 (2021)", + "9. Cui, A., Li, H., Wang, D., Zhong, J., Chen, Y., Lu, H.: Global, regional prevalence, incidence and risk factors of knee osteoarthritis in population-based studies. EClinicalMedicine 29 (2020)", + "10. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: a large-scale hierarchical image database. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255. IEEE (2009)", + "11. Górriz, M., Antony, J., McGuinness, K., Giró-i Nieto, X., O'Connor, N.E.: Assessing knee OA severity with CNN attention-based end-to-end architectures. In: International Conference on Medical Imaging with Deep Learning. pp. 197-214. PMLR (2019)" + ], + "bbox": [ + 218, + 309, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 374, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "12. Guan, B., Liu, F., Mizaian, A.H., Demehri, S., Samsonov, A., Guermazi, A., Kijowski, R.: Deep learning approach to predict pain progression in knee osteoarthritis. Skeletal Radiology pp. 1-11 (2022)", + "13. Guermazi, A., Hunter, D.J., Roemer, F.W.: Plain radiography and magnetic resonance imaging diagnostics in osteoarthritis: validated staging and scoring. J. Bone Joint Surg. Am. 91(Supplement_1), 54-62 (2009)", + "14. Gunjal, A., Yin, J., Bas, E.: Detecting and preventing hallucinations in large vision language models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 18135-18143 (2024)", + "15. Hafezi-Nejad, N., Guermazi, A., Roemer, F.W., Hunter, D.J., Dam, E.B., Zikria, B., Kwoh, C.K., Demehri, S.: Prediction of medial tibiofemoral compartment joint space loss progression using volumetric cartilage measurements: data from the FNIH OA biomarkers consortium. European Radiology 27, 464-473 (2017)", + "16. Halilaj, E., Le, Y., Hicks, J.L., Hastie, T.J., Delp, S.L.: Modeling and predicting osteoarthritis progression: data from the Osteoarthritis Initiative. Osteoarthritis and Cartilage 26(12), 1643-1650 (2018)", + "17. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016)", + "18. Hirvasniemi, J., Runhaar, J., van der Heijden, R., Zokaeinikoo, M., Yang, M., Li, X., Tan, J., Rajamohan, H., Zhou, Y., Deniz, C., et al.: The knee osteoarthritis prediction (KNOAP2020) challenge: An image analysis challenge to predict incident symptomatic radiographic knee osteoarthritis from MRI and x-ray images. Osteoarthritis and Cartilage 31(1), 115-125 (2023)", + "19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems 33, 6840-6851 (2020)", + "20. Hu, K., Wu, W., Li, W., Simic, M., Zomaya, A., Wang, Z.: Adversarial evolving neural network for longitudinal knee osteoarthritis prediction. IEEE Transactions on Medical Imaging 41(11), 3207-3217 (2022)", + "21. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 4700-4708 (2017)", + "22. Jain, R.K., Sharma, P.K., Gaj, S., Sur, A., Ghosh, P.: Knee osteoarthritis severity prediction using an attentive multi-scale deep convolutional neural network. Multimedia Tools and Applications 83(3), 6925-6942 (2024)", + "23. Jamshidi, A., Pelletier, J.P., Labbe, A., Abram, F., Martel-Pelletier, J., Droit, A.: Machine learning-based individualized survival prediction model for total knee replacement in osteoarthritis: data from the Osteoarthritis Initiative. Arthritis Care & Research 73(10), 1518-1527 (2021)", + "24. Kellgren, J.H., Lawrence, J.: Radiological assessment of osteo-arthrosis. Annals of the Rheumatic Diseases 16(4), 494 (1957)", + "25. Lester, G.: Clinical research in OA-the NIH Osteoarthritis Initiative. J. Musculoskelet Neuronal Interact 8(4), 313-314 (2008)", + "26. Lindner, C., Thiagarajah, S., Wilkinson, J.: Fully automatic segmentation of the proximal femur using random forest regression voting. IEEE Trans. Med. Imaging 32, 1462-1472 (2013)", + "27. Nasser, Y., Hassouni, M.E., Jennane, R.: Discriminative deep neural network for predicting knee osteoarthritis in early stage. In: International Workshop on PRedictive Intelligence In MEdicine. pp. 126-136. Springer (2022)" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "28. Nguyen, H.H., Saarakkala, S., Blaschko, M.B., Tiulpin, A.: Semixup: in-and out-of-manifold regularization for deep semi-supervised knee osteoarthritis severity grading from plain radiographs. IEEE Trans. Med. Imaging 39(12), 4346-4356 (2020)", + "29. Ntakolia, C., Kokkotis, C., Moustakidis, S., Tsaopoulos, D.: Prediction of joint space narrowing progression in knee osteoarthritis patients. Diagnostics 11(2), 285 (2021)", + "30. Pierson, E., Cutler, D.M., Leskovec, J., Mullainathan, S., Obermeyer, Z.: An algorithmic approach to reducing unexplained pain disparities in underserved populations. Nature Medicine 27(1), 136-140 (2021)", + "31. Prezja, F., Annala, L., Kiiskinen, S., Ojala, T.: Exploring the efficacy of base data augmentation methods in deep learning-based radiograph classification of knee joint osteoarthritis. Algorithms 17(1), 8 (2023)", + "32. Ribas, L.C., Riad, R., Jennane, R., Bruno, O.M.: A complex network based approach for knee osteoarthritis detection: data from the Osteoarthritis Initiative. Biomedical Signal Processing and Control 71, 103133 (2022)", + "33. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022)", + "34. Shamir, L., Ling, S.M., Scott, W., Hochberg, M., Ferrucci, L., Goldberg, I.G.: Early detection of radiographic knee osteoarthritis using computer-aided analysis. Osteoarthritis and Cartilage 17(10), 1307-1312 (2009)", + "35. Shamir, L., Ling, S.M., Scott, W.W., Bos, A., Orlov, N., Macura, T.J., Eckley, D.M., Ferrucci, L., Goldberg, I.G.: Knee x-ray image analysis method for automated detection of osteoarthritis. IEEE Transactions on Biomedical Engineering 56(2), 407-415 (2008)", + "36. Shentu, J., Al Moubayed, N.: Cxr-irgen: an integrated vision and language model for the generation of clinically accurate chest x-ray image-report pairs. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5200-5209 (2024)", + "37. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (2015)", + "38. Tiulpin, A., Klein, S., Bierma-Zeinstra, S.M., Thevenot, J., Rahtu, E., Meurs, J.v., Oei, E.H., Saarakkala, S.: Multimodal machine learning-based knee osteoarthritis progression prediction from plain radiographs and clinical data. Scientific Reports 9(1), 20038 (2019)", + "39. Tiulpin, A., Saarakkala, S.: Automatic grading of individual knee osteoarthritis features in plain radiographs using deep convolutional neural networks. Diagnostics 10(11), 932 (2020)", + "40. Tiulpin, A., Thevenot, J., Rahtu, E., Lehenkari, P., Saarakkala, S.: Automatic knee osteoarthritis diagnosis from plain radiographs: a deep learning-based approach. Sci. Rep. 8(1), 1-10 (2018)", + "41. Tolpadi, A.A., Lee, J.J., Pedoia, V., Majumdar, S.: Deep learning predicts total knee replacement from magnetic resonance images. Scientific Reports 10(1), 6371 (2020)", + "42. von Tycowicz, C.: Towards shape-based knee osteoarthritis classification using graph convolutional networks. In: IEEE International Symposium on Biomedical Imaging. pp. 750-753. IEEE (2020)", + "43. Widera, P., Weling, P.M., Ladel, C., Loughlin, J., Lafeber, F.P., Petit Dop, F., Larkin, J., Weinans, H., Mobasheri, A., Bacardit, J.: Multi-classifier prediction of knee osteoarthritis progression from incomplete imbalanced longitudinal data. Scientific Reports 10(1), 8427 (2020)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IC-RDN for Grading Knee Osteoarthritis Progression", + "bbox": [ + 375, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "44. Wu, W., Hu, K., Yue, W., Li, W., Simic, M., Li, C., Xiang, W., Wang, Z.: Self-supervised multimodal fusion network for knee osteoarthritis severity grading. In: International Conference on Digital Image Computing: Techniques and Applications. pp. 57-64. IEEE (2023)", + "45. Zhang, B., Tan, J., Cho, K., Chang, G., Deniz, C.M.: Attention-based CNN for KL grade classification: data from the Osteoarthritis Initiative. In: International Symposium on Biomedical Imaging. pp. 731-735. IEEE (2020)", + "46. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 2223-2232 (2017)" + ], + "bbox": [ + 215, + 146, + 785, + 285 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "W. Wu et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_model.json b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_model.json new file mode 100644 index 0000000000000000000000000000000000000000..f4d0dee171ced7d04c2aba5a3da08a8bfcffd61a --- /dev/null +++ b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_model.json @@ -0,0 +1,2183 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.254, + 0.141, + 0.75, + 0.21 + ], + "angle": 0, + "content": "Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging" + }, + { + "type": "text", + "bbox": [ + 0.247, + 0.234, + 0.756, + 0.266 + ], + "angle": 0, + "content": "Wenhua \\(\\mathsf{W u}^{1}\\) , Kun \\(\\mathsf{H u}^{1,\\star}\\) , Wenxi Yue\\(^{1}\\), Wei Li\\(^{1}\\), Milena Simic\\(^{1}\\), Changyang \\(\\mathsf{L i}^{2}\\), Wei Xiang\\(^{3}\\), and Zhiyong Wang\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.276, + 0.277, + 0.725, + 0.319 + ], + "angle": 0, + "content": "1 The University of Sydney, Darlington NSW 2008, Australia {wenhua.wu, kun.hu, wenxi.yue, weiwilson.li, milena.simic, zhiyong.wang}@sydney.edu.au" + }, + { + "type": "text", + "bbox": [ + 0.283, + 0.32, + 0.72, + 0.347 + ], + "angle": 0, + "content": "\\(^{2}\\) Sydney Polytechnic Institute Pty Ltd, Sydney, NSW, Australia chris@ruddergroup.com.au" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.347, + 0.78, + 0.376 + ], + "angle": 0, + "content": "3 School of Computing, Engineering & Mathematical Sciences, La Trobe University w.xiang@latrobe.edu.au" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.405, + 0.74, + 0.697 + ], + "angle": 0, + "content": "Abstract. Knee osteoarthritis (KOA), a common form of arthritis that causes physical disability, has become increasingly prevalent in society. Employing computer-aided techniques to automatically assess the severity and progression of KOA can greatly benefit KOA treatment and disease management. Particularly, the advancement of X-ray technology in KOA demonstrates its potential for this purpose. Yet, existing X-ray prognosis research generally yields a singular progression severity grade, overlooking the potential visual changes for understanding and explaining the progression outcome. Therefore, in this study, a novel generative model is proposed, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), for multifaceted KOA prognosis encompassing a predicted future knee X-ray scan conditioned on the baseline scan. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to conventional image-to-image generative models, identity priors regularize and guide the diffusion to focus more on the clinical nuances of the prognosis based on a contrastive learning strategy. The progression prediction module utilizes both forecasted and baseline knee scans, and a more comprehensive formulation of KOA severity progression grading is expected. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.709, + 0.741, + 0.736 + ], + "angle": 0, + "content": "Keywords: Knee Osteoarthritis \\(\\cdot\\) Medical Imaging \\(\\cdot\\) Medical Assessment Generation" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.759, + 0.375, + 0.775 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.788, + 0.787, + 0.819 + ], + "angle": 0, + "content": "Knee osteoarthritis (KOA) is a common form of arthritis, mainly affecting knee joints with the symptoms of knee joint swelling, tenderness, and bone spurs." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.386, + 0.84 + ], + "angle": 0, + "content": "* Corresponding author." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "image", + "bbox": [ + 0.259, + 0.149, + 0.744, + 0.281 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.293, + 0.788, + 0.325 + ], + "angle": 0, + "content": "Fig. 1: Pipeline for KOA severity progression grading, encompassing a) predicted future knee joint X-ray scan, and b) predicted KOA progression severity grade." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.354, + 0.788, + 0.522 + ], + "angle": 0, + "content": "As the major factor of physical disability, KOA has recently shown an increasing prevalence in society, especially among the elders [9]. Currently, there are rare treatments for curing KOA without physical surgery (total knee replacement) [13]. Therefore, to relieve the pain and control the progression of KOA, the diagnosis and prognosis of the disease are significant, using different clinical assessment methods, such as medical imaging scans and patients' clinic questionnaires. In specific, the imaging scans are utilized to detect the structural changes within the knee joint areas, which indicates the characteristics of KOA. Typically, the severity of KOA is measured by the Kellgren and Lawrence (KL) grading scale system, which encompasses five different levels, from grade 0 (healthy cases) to grade 4 (highly severe cases) [24]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.788, + 0.795 + ], + "angle": 0, + "content": "Compared to the extensive time and human resources required for specialists to detect changes, employing computer-aided techniques to automatically assess the severity and progression of KOA can significantly reduce time costs. This aids in the prompt diagnosis and prognosis of KOA at early stages [5,20]. Methods for grading the severity and progression of KOA have evolved from traditional machine learning approaches [34,35] to advanced deep learning techniques [7,39]. These modern approaches utilize various forms of input, including single images, multiple images, and images combined with demographic information (such as age, gender, BMI, and the WOMAC questionnaire) [27,38,42,45]. Particularly, the advancement of X-ray technology and its application in KOA significantly improves the capability to detect and monitor the progression [12,18,20]. Meanwhile, utilising the generative AI methods in the KOA analysis field focuses on augmenting the knee radiological dataset to improve the grading process [31]. Yet, existing X-ray prognosis research generally yields a singular progression severity grade using the baseline X-ray scan [1,12,18], overlooking the potential visual changes for understanding and explaining the progression outcome. However, the visually predicted outcome is also crucial in clinical practice to explain the disease trajectory." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "In addition to enhancing these methods, we hope the longitude visual content will also aid clinicians in their decision-making by providing further explainability and as domain knowledge to guide the algorithms. For the methodology part," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.236 + ], + "angle": 0, + "content": "previous findings revealed that GANs yield poor bone structures and inconsistency in patients' identity information, which motivated us to devise a diffusion-based method with identity information. Identity patterns are crucial with a principle widely utilized in the forensic field. We anticipate that incorporating such information improves the consistency between baselines and synthesized longitude images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.239, + 0.785, + 0.435 + ], + "angle": 0, + "content": "Therefore, in this study, a novel deep generative model, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), is proposed for multifaceted KOA prognosis. IC-RDN creates a predicted future knee X-ray scan conditioned on the baseline scan and a future KOA severity grade as illustrated in Fig. 1. Specifically, an identity prior module for guiding the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to a conventional image-to-image generative model, identity priors regularize and guide the diffusion to focus more on the clinical nuances related to the prognosis based on a contrastive learning strategy. Using both forecasted and baseline knee scans, we anticipate a more comprehensive and enhanced formulation of KOA severity progression measured in grades with the progression prediction module. Extensive experiments on a widely used public dataset, OAI [25], demonstrate the effectiveness of the proposed method." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.435, + 0.735, + 0.451 + ], + "angle": 0, + "content": "The key contributions of this study can be summarised in three-fold:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.465, + 0.784, + 0.509 + ], + "angle": 0, + "content": "- A novel deep generative model - IC-RDN is proposed for multifaceted KOA prognosis prediction for the first time, encompassing radiographic visual predictions and grading forecasting." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.511, + 0.785, + 0.553 + ], + "angle": 0, + "content": "- An identity prior module for persisting patient's identity information on bone X-ray images is proposed to guide the diffusion process focusing on clinical nuances." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.557, + 0.784, + 0.586 + ], + "angle": 0, + "content": "- Comprehensive experiments with the public OAI dataset demonstrate the effectiveness of the proposed method." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.465, + 0.785, + 0.586 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.612, + 0.396, + 0.629 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.647, + 0.579, + 0.663 + ], + "angle": 0, + "content": "2.1 Computer-Aid KOA Severity Grading" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Existing studies in grading the severity of KOA can be categorised into KOA detection and KOA multi-class grading [27, 44]. The KOA detection focuses on categorising several or combined severity grades from the whole grading system to achieve a coarse-grained classification. For instance, a graph neural network has been designed to utilize the shape boundary information of knee bones for KOA detection [42]. In addition to shape, texture features have been independently utilized for KOA detection to examine the internal pixel relationship [32]. To leverage both textural and shape information, the features extracted from the shallow and deeper layers of a DenseNet model are combined, where the shallow layers contain more shape patterns and the deeper layers focus on textural information [27]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.375 + ], + "angle": 0, + "content": "Multiclass grading, on the other hand, concentrates more on exploring each grading severity level in the system. As the KL grades can be considered a continuous measurement, with convolution neural networks, both regression and classification strategies are studied [2, 3]. Likewise, an ordinal loss function is proposed to formulate the continuous nature of KL grades [7]. In parallel, the attention mechanisms identify the significant areas related to KOA multiclass grading [11, 45]. In [22], attention mechanisms are studied to combine and fuse multi-scale features from a network. Furthermore, to take advantage of the symmetrical structure of knee joints, a Siamese Network is employed to investigate the relationship between both knee joints. This approach facilitates the analysis of intricate KOA patterns in both fully supervised and semi-supervised manners, addressing the challenge posed by the scarcity of annotated datasets [28, 40]. Likewise, a self-supervised method has been introduced. This method leverages both X-ray and MRI images to expand the pool of positive pairs in contrastive learning settings, offering a robust solution to dataset limitations [44]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.394, + 0.696, + 0.41 + ], + "angle": 0, + "content": "2.2 Computer-Aid KOA Longitude Progression Grading" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.418, + 0.788, + 0.508 + ], + "angle": 0, + "content": "Apart from KOA severity grading, predicting the progression of the disease is also significant for medical treatment. Existing works mainly focus on different aspects in predicting the progression of KOA: 1) Knee joint pain status; 2) KOA risk factor prediction; 3) Joint space narrowing (JSN) and cartilage structural change prediction; 4) KL grade prediction; and 5) total knee replacement surgery (TKR) prediction." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.689 + ], + "angle": 0, + "content": "Early studies on grading the progression of KOA mainly rely on conventional machine learning algorithms. In specific, the feature selection is leveraged in filtering the significant features contributing to the progression grades [29]. Parallely, the comparison among different machine learning classifiers is conducted to select the algorithm with better progression grading performance [43]. [8] utilises the XGBoost model to predict the knee joint width as a KOA progression factor. To take advantage of various classification algorithms, the ensemble strategy is deployed among RandomForest, logistic regression, and support vector machine [23]. These machine learning-based methods show some encouraging results in feature engineering, where the extracted features are combined and utilized with methods such as multilayer perceptrons (MLPs) to predict the cartilage volume from MRI scans [15]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.842 + ], + "angle": 0, + "content": "With the powered deep learning methods explored in both general and medical fields, end-to-end approaches have shown promising results in KOA progression grading. An MLP is deployed as a classifier to predict progression grades [6]. Neural Networks, otherwise, are utilised to predict pain status via extracting information from radiographics and demographics [12, 30]. Likewise, CNN-based methods are also leveraged in analysing various KOA risk factors [6] and predicting the JSN progression [1, 16]. To explore the KOA evolutionary trajectory, an Adversarial Evolving Neural Network is proposed to involve the estimated KOA patterns at different grades as auxiliary information [20]. Although predicting the direct KOA symptoms shows a clearer progression measurement, grading the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "progression KL grades and predicting TKR are also able to illustrate the progression in the clinical assessment domain. A binary classification model is designed based on whether the patient needs to take TKR as a future event [18, 23, 41]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.193, + 0.785, + 0.314 + ], + "angle": 0, + "content": "Despite using medical imaging only, the information from multiple modalities, including imaging scans, clinical questionnaires, and demographics, are leveraged in a multimodal method to analyse the KOA progression comprehensively [38]. However, these studies only produce a direct outcome for progression grading ignoring the visual information from the given medical imaging techniques. Therefore, including visual information as an additional modality for analysing comprehensive multifaceted progression patterns is attractive to be explored." + }, + { + "type": "image", + "bbox": [ + 0.233, + 0.348, + 0.775, + 0.581 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.604, + 0.788, + 0.675 + ], + "angle": 0, + "content": "Fig. 2: Illustration of the proposed IC-RDN method. (a) An identity prior module formulates identity representation, which guides the diffusion process for the generation. (b) An I2I image generative network to forecast a future 12-month X-ray scan. (c) A downstream KOA progression prediction network, taking the baseline and the predicted 12-month X-ray scans as inputs." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.731, + 0.381, + 0.749 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.842 + ], + "angle": 0, + "content": "As shown in Fig. 2, the proposed IC-RDN consists of three modules: 1) an identity prior module extracts patient's identity representations; 2) a diffusion-based generative module produces the future X-ray images based on the current-stage X-ray scans and the associated identity representations; and 3) a down-stream generation-guided progression prediction module that predicts the progression" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "severity using both current and generated future X-ray images to provide comprehensive multifaceted progression patterns." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.201, + 0.621, + 0.216 + ], + "angle": 0, + "content": "3.1 KOA Progression Radiographic Generation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.228, + 0.788, + 0.456 + ], + "angle": 0, + "content": "This study incorporates X-ray medical imaging scans to predict the progression of KOA. The objective is to forecast the severity of KOA progression from two perspectives, encompassing severity grading score and visual information (i.e., a generated knee X-ray scan in the future - 12-month in this study). Initially, radiographic images for joints are captured during the baseline (first) X-ray scan, referred to as the baseline visit or 0-month visit. Patients are then asked to undergo a follow-up X-ray scan after 12 months for longitudinal tracking. Specifically, the \\( i^{\\text{th}} \\) longitude X-ray joint pairs from the dataset is denoted as \\( \\mathbf{I}_{\\text{visit}}^i \\in \\{\\mathbf{I}_{\\text{baseline}}^i, \\mathbf{I}_{12\\text{-month}}^i\\} \\), where \\( \\mathbf{I}_{\\text{visit}}^i \\in \\mathbb{R}^{C \\times W \\times H} \\) and \\( C, W \\) and \\( H \\) are the number of channels, the width and the height of the X-ray joint images. For notation simplicity, \\( \\mathbf{I}_{\\text{baseline}}^i \\) and \\( \\mathbf{I}_{12\\text{months}}^i \\) can be shortened as \\( \\mathbf{I}_{\\text{v00m}}^i \\) and \\( \\mathbf{I}_{\\text{v12m}}^i \\). And the generated 12-month X-ray image for the \\( i^{\\text{th}} \\) joint pair is denoted as \\( \\hat{\\mathbf{I}}_{12\\text{months}}^i \\) or \\( \\hat{\\mathbf{I}}_{\\text{v12m}}^i \\). The corresponding severity grade for the 12-month visit is indicated by \\( y_{KL}^i \\) and the grades produced by the prediction model are shown by \\( \\hat{y}_{KL}^i \\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.478, + 0.533, + 0.494 + ], + "angle": 0, + "content": "3.2 Diffusion-based Visual Prognosis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.504, + 0.788, + 0.701 + ], + "angle": 0, + "content": "The diffusion-based generative module in the IC-RDN is designed to produce 12-month X-ray images from baseline visit images for understanding and explaining the potential visual changes in terms of KOA patterns. This incorporates a T-step Denoising Diffusion Probabilistic Model (DDPM) [19] under an image-to-image transition manner. The DDPM consists of two primary processes: the forward (or diffusion) process and the reverse process. Typically, in the forward process, the original data \\( x_0 \\sim q_{data}(x_0) \\) is transformed towards an isotropic Gaussian distribution. However, within our image-to-image diffusion model, the aim is to map the data \\( x_0 \\sim q_{data}(x_0) \\) to \\( x_T \\), where, in our context, \\( x_0 \\) represents a 12-month visit X-ray image \\( \\mathbf{I}_{\\mathrm{v12m}}^i \\), and \\( x_T \\) corresponds to the baseline visit X-ray images \\( \\mathbf{I}_{\\mathrm{v00m}}^i \\). This transformation is modelled as a fixed Markov Chain of length \\( T \\). Subsequently, the reverse process mirrors the forward process, aiming to predict \\( x_0 \\) from \\( x_T \\sim q_{data}(x_T) \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.701, + 0.788, + 0.807 + ], + "angle": 0, + "content": "However, executing both processes directly in pixel space is highly resource-intensive, necessitating substantial memory and computational power. To mitigate this, a VQ-GAN-based encoder (see Fig. 2 (b.1.)) encodes \\( x_0 \\) into a latent space \\( z_0 \\), wherein both the forward and reverse processes (see Fig. 2 (b.3.)) are performed to generate \\( z_T \\). A VQ-GAN-based decoder (depicted in Fig. 2 (b.2.)) then decodes \\( z_T \\) back from the latent space to the pixel space \\( (x_T) \\). The objective of this stable diffusion-based approach [33] is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.351, + 0.819, + 0.787, + 0.845 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {L D M}} := \\mathbb {E} _ {\\varepsilon (x), \\varepsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\| \\varepsilon - \\varepsilon_ {\\theta} \\left(z _ {t}, t\\right) \\| _ {2} ^ {2} \\right], \\tag {1}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "where \\(\\varepsilon_{\\theta}(z_t,t)\\) denotes a denoising autoencoders (time-conditional UNet) and \\(\\theta\\) contains the corresponding weights, where \\(t = 1\\dots T\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.199, + 0.588, + 0.215 + ], + "angle": 0, + "content": "3.3 Knee Joint Identity Prior and Injection" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.223, + 0.784, + 0.314 + ], + "angle": 0, + "content": "To persist a subject's identity information in generating the corresponding 12-month X-ray scan, an identity prior module is devised to extract the identity-sensitive patterns. Specifically, we denote the identity representation for the \\(i^{th}\\) subject joint as \\(\\mathbf{F}_{\\mathrm{ID}}^i\\in \\mathbb{R}^d\\), where \\(d\\) indicates the dimension of the identity representation. A CNN-based network \\(f(\\cdot)\\) is designed to obtain the identity representation. Mathematically, we have:" + }, + { + "type": "equation", + "bbox": [ + 0.445, + 0.325, + 0.785, + 0.342 + ], + "angle": 0, + "content": "\\[\n\\mathbf {F} _ {\\mathrm {I D}} ^ {i} = f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right). \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.352, + 0.784, + 0.396 + ], + "angle": 0, + "content": "The identity information guides and regularizes the diffusion process to not only focus on the target visual domain distribution but also maintain necessary information from the subjects." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.397, + 0.784, + 0.443 + ], + "angle": 0, + "content": "For the supervision of \\( f \\) to formulate identity information, it is proposed to conduct training in a contrastive learning manner. A triplet loss is introduced for this purpose as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.233, + 0.452, + 0.785, + 0.478 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {T r i p l e t}} = \\sum \\left[ \\left\\| f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right) - f \\left(\\mathbf {I} _ {\\mathrm {v} 1 2 \\mathrm {m}} ^ {i}\\right) \\right\\| _ {2} ^ {2} - \\left\\| f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right) - f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {k}\\right) \\right\\| _ {2} ^ {2} + \\alpha \\right] _ {+}, \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.489, + 0.784, + 0.565 + ], + "angle": 0, + "content": "where a triplet is formulated as \\((\\mathbf{I}_{\\mathrm{v00m}}^i,\\mathbf{I}_{\\mathrm{v12m}}^i,\\mathbf{I}_{\\mathrm{v00m}}^k)\\): \\(\\mathbf{I}_{\\mathrm{v00m}}^i\\) indicates the anchor of current subject's joint; \\(\\mathbf{I}_{\\mathrm{v12m}}^i\\) refers to a positive sample from the same subject's joint; \\(\\mathbf{I}_{\\mathrm{v00m}}^k\\) is a negative sample with \\(i\\neq k\\); and \\(\\alpha\\) is a margin enforcing between positive and negative pairs. Note that the number of triplets \\(M\\) used in the training process is defined in the experiment implementations." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.566, + 0.784, + 0.656 + ], + "angle": 0, + "content": "The identity information acts as a guide and regulator for the diffusion process, ensuring that it not only aligns with the target visual domain distribution but also preserves essential information pertaining to the subjects. To inject the identity into the diffusion process, a cross-attention mechanism is applied between the features from the UNet layers in \\(\\epsilon_{\\theta}\\) and \\(\\mathbf{F}_{\\mathrm{ID}}\\). For the \\(t^{\\mathrm{th}}\\) diffusion step and \\(j^{\\mathrm{th}}\\) layer, the attention can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.235, + 0.666, + 0.785, + 0.711 + ], + "angle": 0, + "content": "\\[\n\\mathbf {A} _ {j} = \\operatorname {S o f t m a x} \\left(\\frac {\\mathbf {Q} \\mathbf {K} ^ {\\intercal}}{\\sqrt {d}}\\right) \\mathbf {V}, \\mathbf {Q} = \\phi_ {j} \\left(z _ {t}\\right) \\mathbf {M} _ {j} ^ {Q}, \\mathbf {K} = \\mathbf {F} _ {\\mathrm {I D}} ^ {i} \\mathbf {M} _ {j} ^ {K}, \\text {a n d} \\mathbf {V} = \\mathbf {F} _ {\\mathrm {I D}} ^ {i} \\mathbf {M} _ {j} ^ {V}, \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.711, + 0.784, + 0.756 + ], + "angle": 0, + "content": "where \\(\\mathbf{M}^{\\circ_j}\\) represents a projection matrix containing trainable weights with a projection dimension \\(d\\), and \\(\\phi_j(z_t)\\) indicates the (flattened) intermediate representation of the UNet with \\(j^{\\mathrm{th}}\\) layer. The UNet can be formulated by:" + }, + { + "type": "equation", + "bbox": [ + 0.418, + 0.769, + 0.785, + 0.784 + ], + "angle": 0, + "content": "\\[\n\\phi_ {j + 1} \\left(z _ {t}\\right) = \\phi_ {j} \\left(z _ {t}\\right) + \\mathbf {A} _ {j}, \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.793, + 0.706, + 0.809 + ], + "angle": 0, + "content": "To this end, the IC-RDN can be learnt via the following scheme:" + }, + { + "type": "equation", + "bbox": [ + 0.291, + 0.819, + 0.784, + 0.844 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {L D M - I d e n t i t y}} := \\mathbb {E} _ {\\varepsilon (x), \\varepsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\left\\| \\varepsilon - \\varepsilon_ {\\theta} \\left(z _ {t}, t, f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right)\\right) \\right\\| _ {2} ^ {2} \\right]. \\tag {6}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.664, + 0.163 + ], + "angle": 0, + "content": "3.4 Generation-Guided KOA Progression Prediction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.788, + 0.248 + ], + "angle": 0, + "content": "In addition to generating 12-month X-ray image \\(\\hat{\\mathbf{I}}_{\\mathrm{v}12\\mathrm{m}}^i\\) for prognosis, a singular progression severity grade is predicted as well based on the baseline visit X-ray image \\(\\mathbf{I}_{\\mathrm{v00m}}^i\\) and the generated 12-month visit X-ray image \\(\\hat{\\mathbf{I}}_{\\mathrm{v}12\\mathrm{m}}^i\\). Specifically, a two-stream CNN backbone with two branches \\(h_{\\mathrm{v00m}}(\\cdot)\\) and \\(h_{\\mathrm{v12m}}(\\cdot)\\) is applied for the two images to produce the associated representations:" + }, + { + "type": "equation", + "bbox": [ + 0.339, + 0.259, + 0.786, + 0.278 + ], + "angle": 0, + "content": "\\[\n\\mathbf {P} _ {\\mathrm {v 0 0 m}} ^ {i} = h _ {\\mathrm {v 0 0 m}} (\\mathbf {I} _ {\\mathrm {v 0 0 m}} ^ {i}), \\mathbf {P} _ {\\mathrm {v 1 2 m}} ^ {i} = h _ {\\mathrm {v 1 2 m}} (\\hat {\\mathbf {I}} _ {\\mathrm {v 1 2 m}} ^ {i}). \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.287, + 0.789, + 0.334 + ], + "angle": 0, + "content": "The two representations are then concatenated, denoted by \\(\\parallel\\), and used in a multi-layer perceptron (MLP) classifier \\(g(\\cdot)\\) to produce the predicted progression severity grade \\((\\hat{y}_{KL}^{i})\\), which can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.418, + 0.344, + 0.786, + 0.363 + ], + "angle": 0, + "content": "\\[\n\\hat {y} _ {K L} ^ {i} = g \\left(\\mathbf {P} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i} \\| \\mathbf {P} _ {\\mathrm {v} 1 2 \\mathrm {m}} ^ {i}\\right) \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.372, + 0.787, + 0.403 + ], + "angle": 0, + "content": "A cross-entropy loss is leveraged in the training process to guide the prediction training process, which can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.413, + 0.414, + 0.786, + 0.455 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {C E}} = - \\sum_ {i = 1} ^ {N} y _ {K L} ^ {i} \\log \\hat {y} _ {K L} ^ {i} \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.459, + 0.649, + 0.475 + ], + "angle": 0, + "content": "where \\(N\\) indicates the total number of joints in the dataset." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.497, + 0.613, + 0.515 + ], + "angle": 0, + "content": "4 Experimental Results and Discussion" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.529, + 0.494, + 0.545 + ], + "angle": 0, + "content": "4.1 Dataset and Pre-Processing" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.789, + 0.844 + ], + "angle": 0, + "content": "The longitudinal X-ray images used in this study were sourced from the Osteoarthritis Initiative (OAI) [25], which is a multi-centre and longitude study containing chronological medical imaging scans and clinical assessment records for the subjects up to 96 months. This public dataset enables researchers to explore the natural progression of osteoarthritis, identify risk factors, and evaluate biomarkers for grading the KOA severity and progression. In this study, the patients with both baseline and 12-month visits and available 12-month severity KL grades are selected. Due to some participants opting out of the follow-up study and missing recording of clinical severity grading outcome, not all have recordings for the 12-month visit image and severity KL grades. Consequently, 7,923 joints have both the KL grade available and radiographic recordings from both the baseline and 12-month visits. As the demographic information shown in Table 1, the amount of joints with changed severity grades among 12 months is much smaller than that of without changes, where only \\(6.15\\%\\) joints show a changed severity grade. However, across these joints without the severity grade changes, the visual structural details do not remain the same, which also shows the importance of the proposed multifaceted progression predicting method. The dataset was randomly divided among subjects with a distribution of \\(70\\%\\), \\(10\\%\\), and \\(20\\%\\) for training, validation, and testing, respectively." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.238, + 0.145, + 0.765, + 0.16 + ], + "angle": 0, + "content": "Table 1: Statistics of patients, joints and KL grades in OAI longitudinal visits" + }, + { + "type": "table", + "bbox": [ + 0.242, + 0.171, + 0.763, + 0.261 + ], + "angle": 0, + "content": "
Longitudinal VisitsPatients Available Joints Joints with KL Grades
Baseline Visit4,5519,1028,953
12-Month Visit4,7869,4188,251
Longitudinal KL Changed487 (6.15%)
Longitudinal KL Unchanged7,436 (93.85%)
Both Visits7,923
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.286, + 0.788, + 0.392 + ], + "angle": 0, + "content": "As the raw data from the OAI contains bilateral knee joints and includes almost all knee bones around the joint area, knee joint localisation methods are leveraged to extract the knee joint area individually [26]. After detecting the knee joint edge, a \\(224 \\times 224\\) region surrounding the middle of the joint was extracted from the raw data for modelling. The remaining transformation approaches for the joint images are followed [7], including adjusting the brightness, contrast and saturation of the images." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.412, + 0.457, + 0.428 + ], + "angle": 0, + "content": "4.2 Implementation Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.435, + 0.788, + 0.585 + ], + "angle": 0, + "content": "A pretrained ResNet 18 on ImageNet [10] is adopted as the backbone classification model for identity detection, which extracts the identity features from the baseline X-ray scans. Within Identity Prior's contrastive learning framework, we have designated the number of triplets \\( M \\) as 7,000 for training and 1,000 for testing. The Identity Prior training phase is fine-tuned using the Adam optimizer with a learning rate of 0.01, and the batch size for this phase is established at 128. For the training process of the diffusion-based generative module, we set the number of steps to 1,000,000 across 400 epochs. The Adam optimizer is employed here as well, with a learning rate set at \\( 1 \\times 10^{-4} \\). The batch sizes for training and testing are 64 and 8, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.587, + 0.789, + 0.768 + ], + "angle": 0, + "content": "For the backbone models in the generation-guided KOA progression prediction module, various CNN methods are adopted, such as VGG 16, VGG 19, ResNet 18, ResNet 50, and DenseNet 121, for a comprehensive comparison [17,21,37]. Specifically, the backbone prediction models for both branches, corresponding to \\(\\mathbf{I}_{\\mathrm{v00m}}\\) and \\(\\hat{\\mathbf{I}}_{\\mathrm{v12m}}\\), share the same architecture. In addition, the output features dimension from these backbone models is set to 128. Then the MLP classifier \\(g(\\cdot)\\) takes the input dimension of 256, which contains two linear layers, an activation layer, and a dropout layer. The training process is conducted with a batch size of 16. An SGD optimizer is utilized with the learning rate of \\(5\\times 10^{-3}\\) and a weight decaying factor of \\(5\\times 10^{-3}\\) for every 5 epochs. The entire training regimen is executed using PyTorch 2.0.1 on an NVIDIA RTX A6000 with 48 GB of video memory." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.787, + 0.646, + 0.803 + ], + "angle": 0, + "content": "4.3 Quantitative Performance on Visual Prognosis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "The evaluation of the generated future X-ray images encompasses both quantitative and qualitative assessments. Quantitatively, we engage in analysis through" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.787, + 0.173 + ], + "angle": 0, + "content": "Table 2: Comparison of KOA progression grading performance for different visual generation methods." + }, + { + "type": "table", + "bbox": [ + 0.233, + 0.185, + 0.773, + 0.303 + ], + "angle": 0, + "content": "
MethodISProgression Grading Models - Accuracy (%)
VGG-16VGG-19ResNet-18ResNet-50DenseNet-121
Baseline Image Only-66.363.360.860.962.5
Cycle GAN [46]1.2862.564.360.361.263.6
I2I Diffusion Model2.0262.462.960.461.362.7
CXR-IRGen [36]1.7661.162.760.359.161.6
PITET GAN [4]1.6163.363.759.660.762.2
IC-RDN (ours)1.9866.865.161.161.764.4
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.336, + 0.788, + 0.576 + ], + "angle": 0, + "content": "the conventional generation task metrics, inception score and a downstream task: the prediction of KOA progression severity grade. For using the inception score in this study, we use the Inception-v3 network trained on the OAI 12-month visit X-ray dataset to replace the weights pre-trained on the ImageNet [10] as the knee X-ray images are different from the natural images at both category and structural level. As shown in Table 2, the X-ray images generated by our proposed IC-RDN illustrate a similar IS with the X-ray images generated by the image-to-image diffusion model and outperform the X-ray images generated by Cycle-GAN [46] and other SOTA generative models [4,36] significantly. As for the similar IS between the proposed IC-RDN and the image-to-image diffusion model, the results show similar performance on image quality and diversity. However, the images generated by the I2I diffusion model show a minor contribution to predicting the KOA progression severity grades, and the challenge of identity inconsistency remains in the generated X-ray images from the I2I diffusion model. The detailed comparison for identity consistency is shown on Sec. 4.5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.581, + 0.788, + 0.732 + ], + "angle": 0, + "content": "Although the inception score is able to show the quality and diversity of the generated future images, the downstream task of predicting the KOA progression severity grade can be more relevant to the value of how the generated future X-ray images contribute to exploring the KOA progression patterns. We have introduced the approach to predict KOA severity progression (Sec. 3.4), leveraging both the generated future X-ray image and the baseline X-ray image to determine a progression severity grade. In addition, as stated in Sec. 4.2, various CNN-based backbones are deployed in the generation-guided KOA progression prediction module. The comprehensive results among these backbone models are shown in Table. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Specifically, the predicted 12-month progression X-ray images generated by Cycle GAN, the image-to-image diffusion model, the recent SOTA generative methods, and the proposed IC-RDN are used in the generation-guided KOA progression grade prediction module separately. Accuracy is used as the evaluation method to measure the performance of predicting the progression grades. Among all backbone models used in this module, predicting the progression severity grades using X-ray images from baseline visit and generated by the pro" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "posed IC-RDN shows significantly outperformed results. In detail, the image-to-image diffusion model shows a limited contribution to providing the multifaceted KOA progression patterns. And the Cycle GAN illustrates the minor ability to enhance the performance of predicting the KOA progression severity grades. Therefore, the quantity evaluation demonstrates the added value of incorporating generated future X-ray images in enhancing the accuracy of KOA progression severity grade predictions." + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.291, + 0.465, + 0.427 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.492, + 0.291, + 0.765, + 0.427 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.446, + 0.784, + 0.461 + ], + "angle": 0, + "content": "Fig. 3: Illustration of t-SNE analysis between IC-RDN (ours) and I2I diffusion model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.491, + 0.789, + 0.765 + ], + "angle": 0, + "content": "To illustrate the performance of generated X-ray images contributing to predicting the KOA progression grades, the t-Distributed Stochastic Neighbor Embedding (t-SNE) technique, a sophisticated machine learning algorithm designed for the task of high-dimensional data visualization, is utilised in this study. In detail, to reduce the complex, multi-dimensional data into a two-dimensional space, t-SNE converts the high-dimensional distances between data points into conditional probabilities that represent similarities. Specifically, given a predicted X-ray image generated by the proposed IC-RDN, the trained VGG 19 network is used to produce a feature map corresponding to the KOA progression grade patterns. Then, these representations are visualised using t-SNE to show the related grades spatially. As shown in Fig. 3, the nodes with different colours indicate the corresponding grades. In Fig. 3.a, clear clusters for the KL grades of 0, 3, and 4 are located on the left and right sides. The green and yellow nodes referred to KL grades 1 and 2, show that the module for predicting the KOA progression severity grade has a minor ability to categorise these two classes, which is the challenge among different KOA progression prediction and severity grading methods [7,44]. However, in Fig. 3.b, the nodes for different grades are mixed and the cluster centres are hard to identify." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.785, + 0.634, + 0.801 + ], + "angle": 0, + "content": "4.4 Qualitative Performance on Visual Prognosis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In terms of qualitative analysis, the comparison between X-ray images synthesized by the Cycle GAN and those produced by the proposed IC-RDN offers" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "image", + "bbox": [ + 0.23, + 0.156, + 0.778, + 0.309 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.325, + 0.785, + 0.354 + ], + "angle": 0, + "content": "Fig. 4: Comparison of generated X-ray images from Cycle GAN [46] and our proposed IC-RDN on knee joints i-viii." + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.371, + 0.773, + 0.589 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.6, + 0.788, + 0.645 + ], + "angle": 0, + "content": "Fig. 5: Generative results from IC-RDN among different patients' joints from i to xxii. The detailed joint structure comparison between baseline visit images, ground truth and results from IC-RDN shows our model's ability to generate progression patterns." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.673, + 0.788, + 0.764 + ], + "angle": 0, + "content": "a compelling visual assessment, as depicted in Fig. 4. The comparative study highlights notable distortions in bone structures emanating from the Cycle GAN approach, particularly in the articulation of joint spaces. In stark contrast, our proposed IC-RDN exhibits a pronounced fidelity in preserving the integrity of key bone edges and the intricacy of inner textures, thereby underscoring the superior capability of IC-RDN in maintaining structural information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Further elucidation is provided through an expanded corpus of X-ray images generated by the IC-RDN, which is shown in Fig. 5. This compilation serves not only to reinforce the initial observations regarding the preservation of critical structural details but also to demonstrate the consistent performance of the IC-RDN across a diverse set of examples. The consistent replication of complex" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "anatomical features by the IC-RDN model is indicative of its sophisticated understanding of underlying bone structures, which is paramount for illustrating the multifaceted KOA progression patterns." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.195, + 0.788, + 0.317 + ], + "angle": 0, + "content": "Moreover, this comparison elucidates the inherent limitations of traditional GAN-based approaches in contexts where the preservation of exact structural features is paramount. The propensity for distortion within Cycle GAN-generated images can significantly impact the clinical utility of such synthesized X-ray images, particularly in monitoring the KOA progression. In contrast, the proposed IC-RDN shows its adeptness at capturing and reproducing the nuanced details of bone structure suggesting its potential as a multifaceted KOA progression prediction outcome." + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.351, + 0.765, + 0.487 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.503, + 0.788, + 0.561 + ], + "angle": 0, + "content": "Fig. 6: Examples of generated X-ray images with identity consistency for joint i-x. The first line (outputs from the Image-to-Image Diffusion Model) shows the generative results without Identity Prior. The second line indicates the ground truth images. The third line refers to the results generated by our IC-RDN approach." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.624, + 0.533, + 0.64 + ], + "angle": 0, + "content": "4.5 Analysis on Identity Consistency" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "To further evaluate the efficacy of the identity prior module, we delve into a comprehensive comparison involving the X-ray images generated by the I2I diffusion model and the proposed IC-RDN. The visual examples presented in Fig. 6 meticulously outline the distinctions between these methods alongside the actual 12-month visit X-ray images, where the key differences are highlighted by the bounding boxes. Initially, we observe the generated X-ray images devoid of identity persistency, which starkly contrasts with the subsequent imagery. A noteworthy observation is the preservation of identity features in the X-rays produced by our IC-RDN, as evidenced by the distinct texture and precision of bone edge structures. This preservation extends to intricate details within the knee joint, such as the orientation of the menisci and the nuanced protrusions along the bone edges, which are critical for maintaining identity persistency." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.147, + 0.39, + 0.163 + ], + "angle": 0, + "content": "4.6 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.17, + 0.788, + 0.245 + ], + "angle": 0, + "content": "To better evaluate the contribution of the proposed Identity Prior module, an ablation study is conducted by removing the Identity Prior and only the Diffusion backbone remaining. The results in Table 3 demonstrate the effectiveness of the Identity Prior module with a superior longitude prediction accuracy among all selected classification methods." + }, + { + "type": "table_caption", + "bbox": [ + 0.332, + 0.268, + 0.672, + 0.283 + ], + "angle": 0, + "content": "Table 3: Ablation study of the proposed IC-RDN" + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.294, + 0.782, + 0.356 + ], + "angle": 0, + "content": "
MethodISProgression Grading Models - Accuracy (%)
VGG16VGG19ResNet18ResNet50DenseNet121
IC-RDN w/o Identity Prior1.7261.661.760.261.062.5
IC-RDN (ours)1.9866.865.161.161.764.4
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.405, + 0.357, + 0.419 + ], + "angle": 0, + "content": "4.7 Limitations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.428, + 0.788, + 0.562 + ], + "angle": 0, + "content": "The major limitation of this study regards the generation quality. Directly using X-ray scans generated by IC-RDN for a KOA severity grading showcases a suboptimal result compared with using the baseline visit X-ray to predict the KOA progression grade directly. Though the predicted 12-month scan can enhance the KOA severity prediction with using the baseline visit jointly. In addition, computer hallucinations [14] are a crucial issue among large model fields. Particularly, the analysis regarding the disease-specific changes is insufficient. Therefore, careful consideration of applying the generative method to actual clinical usage is needed." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.584, + 0.36, + 0.601 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.84 + ], + "angle": 0, + "content": "In this study, a generative-based method, IC-RDN is proposed for KOA prognosis, which forecasts future X-ray scans for joints and singular progression KOA severity grades. This obtains multifaceted KOA progression patterns for understanding and explaining KOA prognosis. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced for regularising and guiding the diffusion to focus more on the clinical nuances related to the prognosis and producing a more precise KOA severity progression grading. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method. In our future studies, the disentanglement of the representations related to the identity and KOA severity will be explored for fine-grained guidance in the X-ray image generation process. Meanwhile, the multimodal patterns among different medical imaging scans (e.g. X-ray, MRI, and CT) and patients' demographic information will be involved in producing a fine-grained KOA progression assessment outcome." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.375, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.173, + 0.788, + 0.264 + ], + "angle": 0, + "content": "This study was partially supported by Australian Research Council (ARC) grant DP210102674. The OAI [25] is a public-private partnership comprised of five contracts (N01-AR-2-2258; N01-AR2-2259; N01-AR-2-2260; N01-AR-2-2261; N01-AR-2-2262) funded by the National Institutes of Health, a branch of the Department of Health and Human Services, and conducted by the OAI Study Investigators." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.283, + 0.323, + 0.299 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.31, + 0.785, + 0.365 + ], + "angle": 0, + "content": "1. Almhdie-Imjabbar, A., Nguyen, K.L., Toumi, H., Jennane, R., Lespessailles, E.: Prediction of knee osteoarthritis progression using radiological descriptors obtained from bone texture analysis and siamese neural networks: data from OAI and most cohorts. Arthritis Research & Therapy 24(1), 1-13 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.366, + 0.785, + 0.419 + ], + "angle": 0, + "content": "2. Antony, J., McGuinness, K., Moran, K., O'Connor, N.E.: Automatic detection of knee joints and quantification of knee osteoarthritis severity using convolutional neural networks. In: International Conference on Machine Learning and Data Mining. vol. 10358, pp. 376-390. Springer (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.785, + 0.46 + ], + "angle": 0, + "content": "3. Antony, J., McGuinness, K., O'Connor, N.E., Moran, K.: Quantifying radiographic knee osteoarthritis severity using deep convolutional neural networks. In: Int. Conf. Pattern Recog. pp. 1195-1200. IEEE (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.461, + 0.785, + 0.514 + ], + "angle": 0, + "content": "4. Berman, O., Oz, N., Mendlovic, D., Sochen, N., Cohen, Y., Klapp, I.: PETITGAN: physically enhanced thermal image-translating generative adversarial network. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1607-1616 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.515, + 0.785, + 0.569 + ], + "angle": 0, + "content": "5. Brahim, A., Jennane, R., Riad, R., Janvier, T., Khedher, L., Toumi, H., Lesspessailles, E.: A decision support tool for early detection of knee osteoarthritis using x-ray imaging and machine learning: data from the Osteoarthritis Initiative. Computerized Medical Imaging and Graphics 73, 11-18 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.57, + 0.785, + 0.609 + ], + "angle": 0, + "content": "6. Chan, L., Li, H., Chan, P., Wen, C.: A machine learning-based approach to decipher multi-etiology of knee osteoarthritis onset and deterioration. Osteoarthritis and Cartilage Open 3(1), 100135 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.61, + 0.785, + 0.65 + ], + "angle": 0, + "content": "7. Chen, P., Gao, L., Shi, X., Allen, K., Yang, L.: Fully automatic knee osteoarthritis severity grading using deep neural networks with a novel ordinal loss. Comput. Med. Imag. Grap. 75, 84-92 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.65, + 0.785, + 0.704 + ], + "angle": 0, + "content": "8. Cheung, J.C.W., Tam, A.Y.C., Chan, L.C., Chan, P.K., Wen, C.: Superiority of multiple-joint space width over minimum-joint space width approach in the machine learning for radiographic severity and knee osteoarthritis progression. Biology 10(11), 1107 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.705, + 0.785, + 0.745 + ], + "angle": 0, + "content": "9. Cui, A., Li, H., Wang, D., Zhong, J., Chen, Y., Lu, H.: Global, regional prevalence, incidence and risk factors of knee osteoarthritis in population-based studies. EClinicalMedicine 29 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.746, + 0.785, + 0.785 + ], + "angle": 0, + "content": "10. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: a large-scale hierarchical image database. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.786, + 0.785, + 0.84 + ], + "angle": 0, + "content": "11. Górriz, M., Antony, J., McGuinness, K., Giró-i Nieto, X., O'Connor, N.E.: Assessing knee OA severity with CNN attention-based end-to-end architectures. In: International Conference on Medical Imaging with Deep Learning. pp. 197-214. PMLR (2019)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.31, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "12. Guan, B., Liu, F., Mizaian, A.H., Demehri, S., Samsonov, A., Guermazi, A., Kijowski, R.: Deep learning approach to predict pain progression in knee osteoarthritis. Skeletal Radiology pp. 1-11 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.191, + 0.785, + 0.233 + ], + "angle": 0, + "content": "13. Guermazi, A., Hunter, D.J., Roemer, F.W.: Plain radiography and magnetic resonance imaging diagnostics in osteoarthritis: validated staging and scoring. J. Bone Joint Surg. Am. 91(Supplement_1), 54-62 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.234, + 0.785, + 0.274 + ], + "angle": 0, + "content": "14. Gunjal, A., Yin, J., Bas, E.: Detecting and preventing hallucinations in large vision language models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 18135-18143 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.276, + 0.785, + 0.33 + ], + "angle": 0, + "content": "15. Hafezi-Nejad, N., Guermazi, A., Roemer, F.W., Hunter, D.J., Dam, E.B., Zikria, B., Kwoh, C.K., Demehri, S.: Prediction of medial tibiofemoral compartment joint space loss progression using volumetric cartilage measurements: data from the FNIH OA biomarkers consortium. European Radiology 27, 464-473 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.332, + 0.785, + 0.373 + ], + "angle": 0, + "content": "16. Halilaj, E., Le, Y., Hicks, J.L., Hastie, T.J., Delp, S.L.: Modeling and predicting osteoarthritis progression: data from the Osteoarthritis Initiative. Osteoarthritis and Cartilage 26(12), 1643-1650 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.375, + 0.785, + 0.415 + ], + "angle": 0, + "content": "17. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.417, + 0.785, + 0.486 + ], + "angle": 0, + "content": "18. Hirvasniemi, J., Runhaar, J., van der Heijden, R., Zokaeinikoo, M., Yang, M., Li, X., Tan, J., Rajamohan, H., Zhou, Y., Deniz, C., et al.: The knee osteoarthritis prediction (KNOAP2020) challenge: An image analysis challenge to predict incident symptomatic radiographic knee osteoarthritis from MRI and x-ray images. Osteoarthritis and Cartilage 31(1), 115-125 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.488, + 0.785, + 0.514 + ], + "angle": 0, + "content": "19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems 33, 6840-6851 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.516, + 0.785, + 0.556 + ], + "angle": 0, + "content": "20. Hu, K., Wu, W., Li, W., Simic, M., Zomaya, A., Wang, Z.: Adversarial evolving neural network for longitudinal knee osteoarthritis prediction. IEEE Transactions on Medical Imaging 41(11), 3207-3217 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.558, + 0.785, + 0.599 + ], + "angle": 0, + "content": "21. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 4700-4708 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.601, + 0.785, + 0.641 + ], + "angle": 0, + "content": "22. Jain, R.K., Sharma, P.K., Gaj, S., Sur, A., Ghosh, P.: Knee osteoarthritis severity prediction using an attentive multi-scale deep convolutional neural network. Multimedia Tools and Applications 83(3), 6925-6942 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.785, + 0.698 + ], + "angle": 0, + "content": "23. Jamshidi, A., Pelletier, J.P., Labbe, A., Abram, F., Martel-Pelletier, J., Droit, A.: Machine learning-based individualized survival prediction model for total knee replacement in osteoarthritis: data from the Osteoarthritis Initiative. Arthritis Care & Research 73(10), 1518-1527 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.7, + 0.785, + 0.726 + ], + "angle": 0, + "content": "24. Kellgren, J.H., Lawrence, J.: Radiological assessment of osteo-arthrosis. Annals of the Rheumatic Diseases 16(4), 494 (1957)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.728, + 0.785, + 0.755 + ], + "angle": 0, + "content": "25. Lester, G.: Clinical research in OA-the NIH Osteoarthritis Initiative. J. Musculoskelet Neuronal Interact 8(4), 313-314 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.785, + 0.797 + ], + "angle": 0, + "content": "26. Lindner, C., Thiagarajah, S., Wilkinson, J.: Fully automatic segmentation of the proximal femur using random forest regression voting. IEEE Trans. Med. Imaging 32, 1462-1472 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "27. Nasser, Y., Hassouni, M.E., Jennane, R.: Discriminative deep neural network for predicting knee osteoarthritis in early stage. In: International Workshop on PRedictive Intelligence In MEdicine. pp. 126-136. Springer (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.376, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "28. Nguyen, H.H., Saarakkala, S., Blaschko, M.B., Tiulpin, A.: Semixup: in-and out-of-manifold regularization for deep semi-supervised knee osteoarthritis severity grading from plain radiographs. IEEE Trans. Med. Imaging 39(12), 4346-4356 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.189, + 0.788, + 0.229 + ], + "angle": 0, + "content": "29. Ntakolia, C., Kokkotis, C., Moustakidis, S., Tsaopoulos, D.: Prediction of joint space narrowing progression in knee osteoarthritis patients. Diagnostics 11(2), 285 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.229, + 0.788, + 0.271 + ], + "angle": 0, + "content": "30. Pierson, E., Cutler, D.M., Leskovec, J., Mullainathan, S., Obermeyer, Z.: An algorithmic approach to reducing unexplained pain disparities in underserved populations. Nature Medicine 27(1), 136-140 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.271, + 0.788, + 0.311 + ], + "angle": 0, + "content": "31. Prezja, F., Annala, L., Kiiskinen, S., Ojala, T.: Exploring the efficacy of base data augmentation methods in deep learning-based radiograph classification of knee joint osteoarthritis. Algorithms 17(1), 8 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.311, + 0.788, + 0.352 + ], + "angle": 0, + "content": "32. Ribas, L.C., Riad, R., Jennane, R., Bruno, O.M.: A complex network based approach for knee osteoarthritis detection: data from the Osteoarthritis Initiative. Biomedical Signal Processing and Control 71, 103133 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.352, + 0.788, + 0.393 + ], + "angle": 0, + "content": "33. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.393, + 0.788, + 0.433 + ], + "angle": 0, + "content": "34. Shamir, L., Ling, S.M., Scott, W., Hochberg, M., Ferrucci, L., Goldberg, I.G.: Early detection of radiographic knee osteoarthritis using computer-aided analysis. Osteoarthritis and Cartilage 17(10), 1307-1312 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.433, + 0.788, + 0.488 + ], + "angle": 0, + "content": "35. Shamir, L., Ling, S.M., Scott, W.W., Bos, A., Orlov, N., Macura, T.J., Eckley, D.M., Ferrucci, L., Goldberg, I.G.: Knee x-ray image analysis method for automated detection of osteoarthritis. IEEE Transactions on Biomedical Engineering 56(2), 407-415 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.488, + 0.788, + 0.542 + ], + "angle": 0, + "content": "36. Shentu, J., Al Moubayed, N.: Cxr-irgen: an integrated vision and language model for the generation of clinically accurate chest x-ray image-report pairs. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5200-5209 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.542, + 0.788, + 0.569 + ], + "angle": 0, + "content": "37. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.623 + ], + "angle": 0, + "content": "38. Tiulpin, A., Klein, S., Bierma-Zeinstra, S.M., Thevenot, J., Rahtu, E., Meurs, J.v., Oei, E.H., Saarakkala, S.: Multimodal machine learning-based knee osteoarthritis progression prediction from plain radiographs and clinical data. Scientific Reports 9(1), 20038 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.623, + 0.788, + 0.663 + ], + "angle": 0, + "content": "39. Tiulpin, A., Saarakkala, S.: Automatic grading of individual knee osteoarthritis features in plain radiographs using deep convolutional neural networks. Diagnostics 10(11), 932 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.663, + 0.788, + 0.704 + ], + "angle": 0, + "content": "40. Tiulpin, A., Thevenot, J., Rahtu, E., Lehenkari, P., Saarakkala, S.: Automatic knee osteoarthritis diagnosis from plain radiographs: a deep learning-based approach. Sci. Rep. 8(1), 1-10 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.745 + ], + "angle": 0, + "content": "41. Tolpadi, A.A., Lee, J.J., Pedoia, V., Majumdar, S.: Deep learning predicts total knee replacement from magnetic resonance images. Scientific Reports 10(1), 6371 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.745, + 0.788, + 0.786 + ], + "angle": 0, + "content": "42. von Tycowicz, C.: Towards shape-based knee osteoarthritis classification using graph convolutional networks. In: IEEE International Symposium on Biomedical Imaging. pp. 750-753. IEEE (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.786, + 0.788, + 0.84 + ], + "angle": 0, + "content": "43. Widera, P., Weling, P.M., Ladel, C., Loughlin, J., Lafeber, F.P., Petit Dop, F., Larkin, J., Weinans, H., Mobasheri, A., Bacardit, J.: Multi-classifier prediction of knee osteoarthritis progression from incomplete imbalanced longitudinal data. Scientific Reports 10(1), 8427 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "W. Wu et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "44. Wu, W., Hu, K., Yue, W., Li, W., Simic, M., Li, C., Xiang, W., Wang, Z.: Self-supervised multimodal fusion network for knee osteoarthritis severity grading. In: International Conference on Digital Image Computing: Techniques and Applications. pp. 57-64. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.204, + 0.787, + 0.245 + ], + "angle": 0, + "content": "45. Zhang, B., Tan, J., Cho, K., Chang, G., Deniz, C.M.: Attention-based CNN for KL grade classification: data from the Osteoarthritis Initiative. In: International Symposium on Biomedical Imaging. pp. 731-735. IEEE (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "46. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 2223-2232 (2017)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.286 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_origin.pdf b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..61163a46ebb9fc4c860d0cace4a12600a1ce8b0b --- /dev/null +++ b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/03d9cea5-5a9c-4420-8605-e12ca25723f4_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f1dcef2a0c5fa4941a91b872c7d1bcefa1e9238fc333e76642767b2a1b19a282 +size 3868520 diff --git a/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/full.md b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/full.md new file mode 100644 index 0000000000000000000000000000000000000000..e646e8d191edd07ccc61c7f2638d0a8c141f0980 --- /dev/null +++ b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/full.md @@ -0,0 +1,277 @@ +# Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging + +Wenhua $\mathsf{W u}^{1}$ , Kun $\mathsf{H u}^{1,\star}$ , Wenxi Yue $^{1}$ , Wei Li $^{1}$ , Milena Simic $^{1}$ , Changyang $\mathsf{L i}^{2}$ , Wei Xiang $^{3}$ , and Zhiyong Wang $^{1}$ + +1 The University of Sydney, Darlington NSW 2008, Australia {wenhua.wu, kun.hu, wenxi.yue, weiwilson.li, milena.simic, zhiyong.wang}@sydney.edu.au + +$^{2}$ Sydney Polytechnic Institute Pty Ltd, Sydney, NSW, Australia chris@ruddergroup.com.au + +3 School of Computing, Engineering & Mathematical Sciences, La Trobe University w.xiang@latrobe.edu.au + +Abstract. Knee osteoarthritis (KOA), a common form of arthritis that causes physical disability, has become increasingly prevalent in society. Employing computer-aided techniques to automatically assess the severity and progression of KOA can greatly benefit KOA treatment and disease management. Particularly, the advancement of X-ray technology in KOA demonstrates its potential for this purpose. Yet, existing X-ray prognosis research generally yields a singular progression severity grade, overlooking the potential visual changes for understanding and explaining the progression outcome. Therefore, in this study, a novel generative model is proposed, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), for multifaceted KOA prognosis encompassing a predicted future knee X-ray scan conditioned on the baseline scan. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to conventional image-to-image generative models, identity priors regularize and guide the diffusion to focus more on the clinical nuances of the prognosis based on a contrastive learning strategy. The progression prediction module utilizes both forecasted and baseline knee scans, and a more comprehensive formulation of KOA severity progression grading is expected. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method. + +Keywords: Knee Osteoarthritis $\cdot$ Medical Imaging $\cdot$ Medical Assessment Generation + +# 1 Introduction + +Knee osteoarthritis (KOA) is a common form of arthritis, mainly affecting knee joints with the symptoms of knee joint swelling, tenderness, and bone spurs. + +![](images/dfbfac2951419f43afab0268f50557f88497a2953e595e0efb465d6cbaf26a63.jpg) +Fig. 1: Pipeline for KOA severity progression grading, encompassing a) predicted future knee joint X-ray scan, and b) predicted KOA progression severity grade. + +As the major factor of physical disability, KOA has recently shown an increasing prevalence in society, especially among the elders [9]. Currently, there are rare treatments for curing KOA without physical surgery (total knee replacement) [13]. Therefore, to relieve the pain and control the progression of KOA, the diagnosis and prognosis of the disease are significant, using different clinical assessment methods, such as medical imaging scans and patients' clinic questionnaires. In specific, the imaging scans are utilized to detect the structural changes within the knee joint areas, which indicates the characteristics of KOA. Typically, the severity of KOA is measured by the Kellgren and Lawrence (KL) grading scale system, which encompasses five different levels, from grade 0 (healthy cases) to grade 4 (highly severe cases) [24]. + +Compared to the extensive time and human resources required for specialists to detect changes, employing computer-aided techniques to automatically assess the severity and progression of KOA can significantly reduce time costs. This aids in the prompt diagnosis and prognosis of KOA at early stages [5,20]. Methods for grading the severity and progression of KOA have evolved from traditional machine learning approaches [34,35] to advanced deep learning techniques [7,39]. These modern approaches utilize various forms of input, including single images, multiple images, and images combined with demographic information (such as age, gender, BMI, and the WOMAC questionnaire) [27,38,42,45]. Particularly, the advancement of X-ray technology and its application in KOA significantly improves the capability to detect and monitor the progression [12,18,20]. Meanwhile, utilising the generative AI methods in the KOA analysis field focuses on augmenting the knee radiological dataset to improve the grading process [31]. Yet, existing X-ray prognosis research generally yields a singular progression severity grade using the baseline X-ray scan [1,12,18], overlooking the potential visual changes for understanding and explaining the progression outcome. However, the visually predicted outcome is also crucial in clinical practice to explain the disease trajectory. + +In addition to enhancing these methods, we hope the longitude visual content will also aid clinicians in their decision-making by providing further explainability and as domain knowledge to guide the algorithms. For the methodology part, + +previous findings revealed that GANs yield poor bone structures and inconsistency in patients' identity information, which motivated us to devise a diffusion-based method with identity information. Identity patterns are crucial with a principle widely utilized in the forensic field. We anticipate that incorporating such information improves the consistency between baselines and synthesized longitude images. + +Therefore, in this study, a novel deep generative model, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), is proposed for multifaceted KOA prognosis. IC-RDN creates a predicted future knee X-ray scan conditioned on the baseline scan and a future KOA severity grade as illustrated in Fig. 1. Specifically, an identity prior module for guiding the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to a conventional image-to-image generative model, identity priors regularize and guide the diffusion to focus more on the clinical nuances related to the prognosis based on a contrastive learning strategy. Using both forecasted and baseline knee scans, we anticipate a more comprehensive and enhanced formulation of KOA severity progression measured in grades with the progression prediction module. Extensive experiments on a widely used public dataset, OAI [25], demonstrate the effectiveness of the proposed method. + +The key contributions of this study can be summarised in three-fold: + +- A novel deep generative model - IC-RDN is proposed for multifaceted KOA prognosis prediction for the first time, encompassing radiographic visual predictions and grading forecasting. +- An identity prior module for persisting patient's identity information on bone X-ray images is proposed to guide the diffusion process focusing on clinical nuances. +- Comprehensive experiments with the public OAI dataset demonstrate the effectiveness of the proposed method. + +# 2 Related Works + +# 2.1 Computer-Aid KOA Severity Grading + +Existing studies in grading the severity of KOA can be categorised into KOA detection and KOA multi-class grading [27, 44]. The KOA detection focuses on categorising several or combined severity grades from the whole grading system to achieve a coarse-grained classification. For instance, a graph neural network has been designed to utilize the shape boundary information of knee bones for KOA detection [42]. In addition to shape, texture features have been independently utilized for KOA detection to examine the internal pixel relationship [32]. To leverage both textural and shape information, the features extracted from the shallow and deeper layers of a DenseNet model are combined, where the shallow layers contain more shape patterns and the deeper layers focus on textural information [27]. + +Multiclass grading, on the other hand, concentrates more on exploring each grading severity level in the system. As the KL grades can be considered a continuous measurement, with convolution neural networks, both regression and classification strategies are studied [2, 3]. Likewise, an ordinal loss function is proposed to formulate the continuous nature of KL grades [7]. In parallel, the attention mechanisms identify the significant areas related to KOA multiclass grading [11, 45]. In [22], attention mechanisms are studied to combine and fuse multi-scale features from a network. Furthermore, to take advantage of the symmetrical structure of knee joints, a Siamese Network is employed to investigate the relationship between both knee joints. This approach facilitates the analysis of intricate KOA patterns in both fully supervised and semi-supervised manners, addressing the challenge posed by the scarcity of annotated datasets [28, 40]. Likewise, a self-supervised method has been introduced. This method leverages both X-ray and MRI images to expand the pool of positive pairs in contrastive learning settings, offering a robust solution to dataset limitations [44]. + +# 2.2 Computer-Aid KOA Longitude Progression Grading + +Apart from KOA severity grading, predicting the progression of the disease is also significant for medical treatment. Existing works mainly focus on different aspects in predicting the progression of KOA: 1) Knee joint pain status; 2) KOA risk factor prediction; 3) Joint space narrowing (JSN) and cartilage structural change prediction; 4) KL grade prediction; and 5) total knee replacement surgery (TKR) prediction. + +Early studies on grading the progression of KOA mainly rely on conventional machine learning algorithms. In specific, the feature selection is leveraged in filtering the significant features contributing to the progression grades [29]. Parallely, the comparison among different machine learning classifiers is conducted to select the algorithm with better progression grading performance [43]. [8] utilises the XGBoost model to predict the knee joint width as a KOA progression factor. To take advantage of various classification algorithms, the ensemble strategy is deployed among RandomForest, logistic regression, and support vector machine [23]. These machine learning-based methods show some encouraging results in feature engineering, where the extracted features are combined and utilized with methods such as multilayer perceptrons (MLPs) to predict the cartilage volume from MRI scans [15]. + +With the powered deep learning methods explored in both general and medical fields, end-to-end approaches have shown promising results in KOA progression grading. An MLP is deployed as a classifier to predict progression grades [6]. Neural Networks, otherwise, are utilised to predict pain status via extracting information from radiographics and demographics [12, 30]. Likewise, CNN-based methods are also leveraged in analysing various KOA risk factors [6] and predicting the JSN progression [1, 16]. To explore the KOA evolutionary trajectory, an Adversarial Evolving Neural Network is proposed to involve the estimated KOA patterns at different grades as auxiliary information [20]. Although predicting the direct KOA symptoms shows a clearer progression measurement, grading the + +progression KL grades and predicting TKR are also able to illustrate the progression in the clinical assessment domain. A binary classification model is designed based on whether the patient needs to take TKR as a future event [18, 23, 41]. + +Despite using medical imaging only, the information from multiple modalities, including imaging scans, clinical questionnaires, and demographics, are leveraged in a multimodal method to analyse the KOA progression comprehensively [38]. However, these studies only produce a direct outcome for progression grading ignoring the visual information from the given medical imaging techniques. Therefore, including visual information as an additional modality for analysing comprehensive multifaceted progression patterns is attractive to be explored. + +![](images/22278a3b2b162b9c7d534811229beb0e7910216e94c0ec991b5189aa7dfa4161.jpg) +Fig. 2: Illustration of the proposed IC-RDN method. (a) An identity prior module formulates identity representation, which guides the diffusion process for the generation. (b) An I2I image generative network to forecast a future 12-month X-ray scan. (c) A downstream KOA progression prediction network, taking the baseline and the predicted 12-month X-ray scans as inputs. + +# 3 Methodology + +As shown in Fig. 2, the proposed IC-RDN consists of three modules: 1) an identity prior module extracts patient's identity representations; 2) a diffusion-based generative module produces the future X-ray images based on the current-stage X-ray scans and the associated identity representations; and 3) a down-stream generation-guided progression prediction module that predicts the progression + +severity using both current and generated future X-ray images to provide comprehensive multifaceted progression patterns. + +# 3.1 KOA Progression Radiographic Generation + +This study incorporates X-ray medical imaging scans to predict the progression of KOA. The objective is to forecast the severity of KOA progression from two perspectives, encompassing severity grading score and visual information (i.e., a generated knee X-ray scan in the future - 12-month in this study). Initially, radiographic images for joints are captured during the baseline (first) X-ray scan, referred to as the baseline visit or 0-month visit. Patients are then asked to undergo a follow-up X-ray scan after 12 months for longitudinal tracking. Specifically, the $i^{\text{th}}$ longitude X-ray joint pairs from the dataset is denoted as $\mathbf{I}_{\text{visit}}^i \in \{\mathbf{I}_{\text{baseline}}^i, \mathbf{I}_{12\text{-month}}^i\}$ , where $\mathbf{I}_{\text{visit}}^i \in \mathbb{R}^{C \times W \times H}$ and $C, W$ and $H$ are the number of channels, the width and the height of the X-ray joint images. For notation simplicity, $\mathbf{I}_{\text{baseline}}^i$ and $\mathbf{I}_{12\text{months}}^i$ can be shortened as $\mathbf{I}_{\text{v00m}}^i$ and $\mathbf{I}_{\text{v12m}}^i$ . And the generated 12-month X-ray image for the $i^{\text{th}}$ joint pair is denoted as $\hat{\mathbf{I}}_{12\text{months}}^i$ or $\hat{\mathbf{I}}_{\text{v12m}}^i$ . The corresponding severity grade for the 12-month visit is indicated by $y_{KL}^i$ and the grades produced by the prediction model are shown by $\hat{y}_{KL}^i$ . + +# 3.2 Diffusion-based Visual Prognosis + +The diffusion-based generative module in the IC-RDN is designed to produce 12-month X-ray images from baseline visit images for understanding and explaining the potential visual changes in terms of KOA patterns. This incorporates a T-step Denoising Diffusion Probabilistic Model (DDPM) [19] under an image-to-image transition manner. The DDPM consists of two primary processes: the forward (or diffusion) process and the reverse process. Typically, in the forward process, the original data $x_0 \sim q_{data}(x_0)$ is transformed towards an isotropic Gaussian distribution. However, within our image-to-image diffusion model, the aim is to map the data $x_0 \sim q_{data}(x_0)$ to $x_T$ , where, in our context, $x_0$ represents a 12-month visit X-ray image $\mathbf{I}_{\mathrm{v12m}}^i$ , and $x_T$ corresponds to the baseline visit X-ray images $\mathbf{I}_{\mathrm{v00m}}^i$ . This transformation is modelled as a fixed Markov Chain of length $T$ . Subsequently, the reverse process mirrors the forward process, aiming to predict $x_0$ from $x_T \sim q_{data}(x_T)$ . + +However, executing both processes directly in pixel space is highly resource-intensive, necessitating substantial memory and computational power. To mitigate this, a VQ-GAN-based encoder (see Fig. 2 (b.1.)) encodes $x_0$ into a latent space $z_0$ , wherein both the forward and reverse processes (see Fig. 2 (b.3.)) are performed to generate $z_T$ . A VQ-GAN-based decoder (depicted in Fig. 2 (b.2.)) then decodes $z_T$ back from the latent space to the pixel space $(x_T)$ . The objective of this stable diffusion-based approach [33] is formulated as follows: + +$$ +\mathcal {L} _ {\mathrm {L D M}} := \mathbb {E} _ {\varepsilon (x), \varepsilon \sim \mathcal {N} (0, 1), t} \left[ \| \varepsilon - \varepsilon_ {\theta} \left(z _ {t}, t\right) \| _ {2} ^ {2} \right], \tag {1} +$$ + +where $\varepsilon_{\theta}(z_t,t)$ denotes a denoising autoencoders (time-conditional UNet) and $\theta$ contains the corresponding weights, where $t = 1\dots T$ . + +# 3.3 Knee Joint Identity Prior and Injection + +To persist a subject's identity information in generating the corresponding 12-month X-ray scan, an identity prior module is devised to extract the identity-sensitive patterns. Specifically, we denote the identity representation for the $i^{th}$ subject joint as $\mathbf{F}_{\mathrm{ID}}^i\in \mathbb{R}^d$ , where $d$ indicates the dimension of the identity representation. A CNN-based network $f(\cdot)$ is designed to obtain the identity representation. Mathematically, we have: + +$$ +\mathbf {F} _ {\mathrm {I D}} ^ {i} = f \left(\mathbf {I} _ {\mathrm {v} 0 0 \mathrm {m}} ^ {i}\right). \tag {2} +$$ + +The identity information guides and regularizes the diffusion process to not only focus on the target visual domain distribution but also maintain necessary information from the subjects. + +For the supervision of $f$ to formulate identity information, it is proposed to conduct training in a contrastive learning manner. A triplet loss is introduced for this purpose as follows: + +$$ +\mathcal {L} _ {\text {T r i p l e t}} = \sum \left[ \left\| f \left(\mathbf {I} _ {\mathrm {v} 0 0 \mathrm {m}} ^ {i}\right) - f \left(\mathbf {I} _ {\mathrm {v} 1 2 \mathrm {m}} ^ {i}\right) \right\| _ {2} ^ {2} - \left\| f \left(\mathbf {I} _ {\mathrm {v} 0 0 \mathrm {m}} ^ {i}\right) - f \left(\mathbf {I} _ {\mathrm {v} 0 0 \mathrm {m}} ^ {k}\right) \right\| _ {2} ^ {2} + \alpha \right] _ {+}, \tag {3} +$$ + +where a triplet is formulated as $(\mathbf{I}_{\mathrm{v00m}}^i,\mathbf{I}_{\mathrm{v12m}}^i,\mathbf{I}_{\mathrm{v00m}}^k)$ : $\mathbf{I}_{\mathrm{v00m}}^i$ indicates the anchor of current subject's joint; $\mathbf{I}_{\mathrm{v12m}}^i$ refers to a positive sample from the same subject's joint; $\mathbf{I}_{\mathrm{v00m}}^k$ is a negative sample with $i\neq k$ ; and $\alpha$ is a margin enforcing between positive and negative pairs. Note that the number of triplets $M$ used in the training process is defined in the experiment implementations. + +The identity information acts as a guide and regulator for the diffusion process, ensuring that it not only aligns with the target visual domain distribution but also preserves essential information pertaining to the subjects. To inject the identity into the diffusion process, a cross-attention mechanism is applied between the features from the UNet layers in $\epsilon_{\theta}$ and $\mathbf{F}_{\mathrm{ID}}$ . For the $t^{\mathrm{th}}$ diffusion step and $j^{\mathrm{th}}$ layer, the attention can be formulated as follows: + +$$ +\mathbf {A} _ {j} = \operatorname {S o f t m a x} \left(\frac {\mathbf {Q} \mathbf {K} ^ {\intercal}}{\sqrt {d}}\right) \mathbf {V}, \mathbf {Q} = \phi_ {j} \left(z _ {t}\right) \mathbf {M} _ {j} ^ {Q}, \mathbf {K} = \mathbf {F} _ {\mathrm {I D}} ^ {i} \mathbf {M} _ {j} ^ {K}, \text {a n d} \mathbf {V} = \mathbf {F} _ {\mathrm {I D}} ^ {i} \mathbf {M} _ {j} ^ {V}, \tag {4} +$$ + +where $\mathbf{M}^{\circ_j}$ represents a projection matrix containing trainable weights with a projection dimension $d$ , and $\phi_j(z_t)$ indicates the (flattened) intermediate representation of the UNet with $j^{\mathrm{th}}$ layer. The UNet can be formulated by: + +$$ +\phi_ {j + 1} \left(z _ {t}\right) = \phi_ {j} \left(z _ {t}\right) + \mathbf {A} _ {j}, \tag {5} +$$ + +To this end, the IC-RDN can be learnt via the following scheme: + +$$ +\mathcal {L} _ {\text {L D M - I d e n t i t y}} := \mathbb {E} _ {\varepsilon (x), \varepsilon \sim \mathcal {N} (0, 1), t} \left[ \left\| \varepsilon - \varepsilon_ {\theta} \left(z _ {t}, t, f \left(\mathbf {I} _ {\mathrm {v} 0 0 \mathrm {m}} ^ {i}\right)\right) \right\| _ {2} ^ {2} \right]. \tag {6} +$$ + +# 3.4 Generation-Guided KOA Progression Prediction + +In addition to generating 12-month X-ray image $\hat{\mathbf{I}}_{\mathrm{v}12\mathrm{m}}^i$ for prognosis, a singular progression severity grade is predicted as well based on the baseline visit X-ray image $\mathbf{I}_{\mathrm{v00m}}^i$ and the generated 12-month visit X-ray image $\hat{\mathbf{I}}_{\mathrm{v}12\mathrm{m}}^i$ . Specifically, a two-stream CNN backbone with two branches $h_{\mathrm{v00m}}(\cdot)$ and $h_{\mathrm{v12m}}(\cdot)$ is applied for the two images to produce the associated representations: + +$$ +\mathbf {P} _ {\mathrm {v 0 0 m}} ^ {i} = h _ {\mathrm {v 0 0 m}} (\mathbf {I} _ {\mathrm {v 0 0 m}} ^ {i}), \mathbf {P} _ {\mathrm {v 1 2 m}} ^ {i} = h _ {\mathrm {v 1 2 m}} (\hat {\mathbf {I}} _ {\mathrm {v 1 2 m}} ^ {i}). \tag {7} +$$ + +The two representations are then concatenated, denoted by $\parallel$ , and used in a multi-layer perceptron (MLP) classifier $g(\cdot)$ to produce the predicted progression severity grade $(\hat{y}_{KL}^{i})$ , which can be formulated as: + +$$ +\hat {y} _ {K L} ^ {i} = g \left(\mathbf {P} _ {\mathrm {v} 0 0 \mathrm {m}} ^ {i} \| \mathbf {P} _ {\mathrm {v} 1 2 \mathrm {m}} ^ {i}\right) \tag {8} +$$ + +A cross-entropy loss is leveraged in the training process to guide the prediction training process, which can be formulated as: + +$$ +\mathcal {L} _ {\mathrm {C E}} = - \sum_ {i = 1} ^ {N} y _ {K L} ^ {i} \log \hat {y} _ {K L} ^ {i} \tag {9} +$$ + +where $N$ indicates the total number of joints in the dataset. + +# 4 Experimental Results and Discussion + +# 4.1 Dataset and Pre-Processing + +The longitudinal X-ray images used in this study were sourced from the Osteoarthritis Initiative (OAI) [25], which is a multi-centre and longitude study containing chronological medical imaging scans and clinical assessment records for the subjects up to 96 months. This public dataset enables researchers to explore the natural progression of osteoarthritis, identify risk factors, and evaluate biomarkers for grading the KOA severity and progression. In this study, the patients with both baseline and 12-month visits and available 12-month severity KL grades are selected. Due to some participants opting out of the follow-up study and missing recording of clinical severity grading outcome, not all have recordings for the 12-month visit image and severity KL grades. Consequently, 7,923 joints have both the KL grade available and radiographic recordings from both the baseline and 12-month visits. As the demographic information shown in Table 1, the amount of joints with changed severity grades among 12 months is much smaller than that of without changes, where only $6.15\%$ joints show a changed severity grade. However, across these joints without the severity grade changes, the visual structural details do not remain the same, which also shows the importance of the proposed multifaceted progression predicting method. The dataset was randomly divided among subjects with a distribution of $70\%$ , $10\%$ , and $20\%$ for training, validation, and testing, respectively. + +Table 1: Statistics of patients, joints and KL grades in OAI longitudinal visits + +
Longitudinal VisitsPatients Available Joints Joints with KL Grades
Baseline Visit4,5519,1028,953
12-Month Visit4,7869,4188,251
Longitudinal KL Changed487 (6.15%)
Longitudinal KL Unchanged7,436 (93.85%)
Both Visits7,923
+ +As the raw data from the OAI contains bilateral knee joints and includes almost all knee bones around the joint area, knee joint localisation methods are leveraged to extract the knee joint area individually [26]. After detecting the knee joint edge, a $224 \times 224$ region surrounding the middle of the joint was extracted from the raw data for modelling. The remaining transformation approaches for the joint images are followed [7], including adjusting the brightness, contrast and saturation of the images. + +# 4.2 Implementation Details + +A pretrained ResNet 18 on ImageNet [10] is adopted as the backbone classification model for identity detection, which extracts the identity features from the baseline X-ray scans. Within Identity Prior's contrastive learning framework, we have designated the number of triplets $M$ as 7,000 for training and 1,000 for testing. The Identity Prior training phase is fine-tuned using the Adam optimizer with a learning rate of 0.01, and the batch size for this phase is established at 128. For the training process of the diffusion-based generative module, we set the number of steps to 1,000,000 across 400 epochs. The Adam optimizer is employed here as well, with a learning rate set at $1 \times 10^{-4}$ . The batch sizes for training and testing are 64 and 8, respectively. + +For the backbone models in the generation-guided KOA progression prediction module, various CNN methods are adopted, such as VGG 16, VGG 19, ResNet 18, ResNet 50, and DenseNet 121, for a comprehensive comparison [17,21,37]. Specifically, the backbone prediction models for both branches, corresponding to $\mathbf{I}_{\mathrm{v00m}}$ and $\hat{\mathbf{I}}_{\mathrm{v12m}}$ , share the same architecture. In addition, the output features dimension from these backbone models is set to 128. Then the MLP classifier $g(\cdot)$ takes the input dimension of 256, which contains two linear layers, an activation layer, and a dropout layer. The training process is conducted with a batch size of 16. An SGD optimizer is utilized with the learning rate of $5\times 10^{-3}$ and a weight decaying factor of $5\times 10^{-3}$ for every 5 epochs. The entire training regimen is executed using PyTorch 2.0.1 on an NVIDIA RTX A6000 with 48 GB of video memory. + +# 4.3 Quantitative Performance on Visual Prognosis + +The evaluation of the generated future X-ray images encompasses both quantitative and qualitative assessments. Quantitatively, we engage in analysis through + +Table 2: Comparison of KOA progression grading performance for different visual generation methods. + +
MethodISProgression Grading Models - Accuracy (%)
VGG-16VGG-19ResNet-18ResNet-50DenseNet-121
Baseline Image Only-66.363.360.860.962.5
Cycle GAN [46]1.2862.564.360.361.263.6
I2I Diffusion Model2.0262.462.960.461.362.7
CXR-IRGen [36]1.7661.162.760.359.161.6
PITET GAN [4]1.6163.363.759.660.762.2
IC-RDN (ours)1.9866.865.161.161.764.4
+ +the conventional generation task metrics, inception score and a downstream task: the prediction of KOA progression severity grade. For using the inception score in this study, we use the Inception-v3 network trained on the OAI 12-month visit X-ray dataset to replace the weights pre-trained on the ImageNet [10] as the knee X-ray images are different from the natural images at both category and structural level. As shown in Table 2, the X-ray images generated by our proposed IC-RDN illustrate a similar IS with the X-ray images generated by the image-to-image diffusion model and outperform the X-ray images generated by Cycle-GAN [46] and other SOTA generative models [4,36] significantly. As for the similar IS between the proposed IC-RDN and the image-to-image diffusion model, the results show similar performance on image quality and diversity. However, the images generated by the I2I diffusion model show a minor contribution to predicting the KOA progression severity grades, and the challenge of identity inconsistency remains in the generated X-ray images from the I2I diffusion model. The detailed comparison for identity consistency is shown on Sec. 4.5. + +Although the inception score is able to show the quality and diversity of the generated future images, the downstream task of predicting the KOA progression severity grade can be more relevant to the value of how the generated future X-ray images contribute to exploring the KOA progression patterns. We have introduced the approach to predict KOA severity progression (Sec. 3.4), leveraging both the generated future X-ray image and the baseline X-ray image to determine a progression severity grade. In addition, as stated in Sec. 4.2, various CNN-based backbones are deployed in the generation-guided KOA progression prediction module. The comprehensive results among these backbone models are shown in Table. 2. + +Specifically, the predicted 12-month progression X-ray images generated by Cycle GAN, the image-to-image diffusion model, the recent SOTA generative methods, and the proposed IC-RDN are used in the generation-guided KOA progression grade prediction module separately. Accuracy is used as the evaluation method to measure the performance of predicting the progression grades. Among all backbone models used in this module, predicting the progression severity grades using X-ray images from baseline visit and generated by the pro + +posed IC-RDN shows significantly outperformed results. In detail, the image-to-image diffusion model shows a limited contribution to providing the multifaceted KOA progression patterns. And the Cycle GAN illustrates the minor ability to enhance the performance of predicting the KOA progression severity grades. Therefore, the quantity evaluation demonstrates the added value of incorporating generated future X-ray images in enhancing the accuracy of KOA progression severity grade predictions. + +![](images/a272938258bfc1479781119f159628290821878b3f97087aacbf8159458bea25.jpg) +Fig. 3: Illustration of t-SNE analysis between IC-RDN (ours) and I2I diffusion model. + +![](images/f697b1137b7aea3e817abb426bbf047b1a55b3b3e05e9c52f60fc51f7d3d7030.jpg) + +To illustrate the performance of generated X-ray images contributing to predicting the KOA progression grades, the t-Distributed Stochastic Neighbor Embedding (t-SNE) technique, a sophisticated machine learning algorithm designed for the task of high-dimensional data visualization, is utilised in this study. In detail, to reduce the complex, multi-dimensional data into a two-dimensional space, t-SNE converts the high-dimensional distances between data points into conditional probabilities that represent similarities. Specifically, given a predicted X-ray image generated by the proposed IC-RDN, the trained VGG 19 network is used to produce a feature map corresponding to the KOA progression grade patterns. Then, these representations are visualised using t-SNE to show the related grades spatially. As shown in Fig. 3, the nodes with different colours indicate the corresponding grades. In Fig. 3.a, clear clusters for the KL grades of 0, 3, and 4 are located on the left and right sides. The green and yellow nodes referred to KL grades 1 and 2, show that the module for predicting the KOA progression severity grade has a minor ability to categorise these two classes, which is the challenge among different KOA progression prediction and severity grading methods [7,44]. However, in Fig. 3.b, the nodes for different grades are mixed and the cluster centres are hard to identify. + +# 4.4 Qualitative Performance on Visual Prognosis + +In terms of qualitative analysis, the comparison between X-ray images synthesized by the Cycle GAN and those produced by the proposed IC-RDN offers + +![](images/4f1f5724383ec7204c7cade9f4075ad742003af3cc2a477cd50d669bab99563c.jpg) +Fig. 4: Comparison of generated X-ray images from Cycle GAN [46] and our proposed IC-RDN on knee joints i-viii. + +![](images/f55f59e1b2f7fa92967ec747c61c7914919979bfa1208ed71f2ed0a7c878f0ee.jpg) +Fig. 5: Generative results from IC-RDN among different patients' joints from i to xxii. The detailed joint structure comparison between baseline visit images, ground truth and results from IC-RDN shows our model's ability to generate progression patterns. + +a compelling visual assessment, as depicted in Fig. 4. The comparative study highlights notable distortions in bone structures emanating from the Cycle GAN approach, particularly in the articulation of joint spaces. In stark contrast, our proposed IC-RDN exhibits a pronounced fidelity in preserving the integrity of key bone edges and the intricacy of inner textures, thereby underscoring the superior capability of IC-RDN in maintaining structural information. + +Further elucidation is provided through an expanded corpus of X-ray images generated by the IC-RDN, which is shown in Fig. 5. This compilation serves not only to reinforce the initial observations regarding the preservation of critical structural details but also to demonstrate the consistent performance of the IC-RDN across a diverse set of examples. The consistent replication of complex + +anatomical features by the IC-RDN model is indicative of its sophisticated understanding of underlying bone structures, which is paramount for illustrating the multifaceted KOA progression patterns. + +Moreover, this comparison elucidates the inherent limitations of traditional GAN-based approaches in contexts where the preservation of exact structural features is paramount. The propensity for distortion within Cycle GAN-generated images can significantly impact the clinical utility of such synthesized X-ray images, particularly in monitoring the KOA progression. In contrast, the proposed IC-RDN shows its adeptness at capturing and reproducing the nuanced details of bone structure suggesting its potential as a multifaceted KOA progression prediction outcome. + +![](images/4b037f89626a37ef16e99aaf55f9ec8f78425b41fca351fb41e896b76abe3b5d.jpg) +Fig. 6: Examples of generated X-ray images with identity consistency for joint i-x. The first line (outputs from the Image-to-Image Diffusion Model) shows the generative results without Identity Prior. The second line indicates the ground truth images. The third line refers to the results generated by our IC-RDN approach. + +# 4.5 Analysis on Identity Consistency + +To further evaluate the efficacy of the identity prior module, we delve into a comprehensive comparison involving the X-ray images generated by the I2I diffusion model and the proposed IC-RDN. The visual examples presented in Fig. 6 meticulously outline the distinctions between these methods alongside the actual 12-month visit X-ray images, where the key differences are highlighted by the bounding boxes. Initially, we observe the generated X-ray images devoid of identity persistency, which starkly contrasts with the subsequent imagery. A noteworthy observation is the preservation of identity features in the X-rays produced by our IC-RDN, as evidenced by the distinct texture and precision of bone edge structures. This preservation extends to intricate details within the knee joint, such as the orientation of the menisci and the nuanced protrusions along the bone edges, which are critical for maintaining identity persistency. + +# 4.6 Ablation Study + +To better evaluate the contribution of the proposed Identity Prior module, an ablation study is conducted by removing the Identity Prior and only the Diffusion backbone remaining. The results in Table 3 demonstrate the effectiveness of the Identity Prior module with a superior longitude prediction accuracy among all selected classification methods. + +Table 3: Ablation study of the proposed IC-RDN + +
MethodISProgression Grading Models - Accuracy (%)
VGG16VGG19ResNet18ResNet50DenseNet121
IC-RDN w/o Identity Prior1.7261.661.760.261.062.5
IC-RDN (ours)1.9866.865.161.161.764.4
+ +# 4.7 Limitations + +The major limitation of this study regards the generation quality. Directly using X-ray scans generated by IC-RDN for a KOA severity grading showcases a suboptimal result compared with using the baseline visit X-ray to predict the KOA progression grade directly. Though the predicted 12-month scan can enhance the KOA severity prediction with using the baseline visit jointly. In addition, computer hallucinations [14] are a crucial issue among large model fields. Particularly, the analysis regarding the disease-specific changes is insufficient. Therefore, careful consideration of applying the generative method to actual clinical usage is needed. + +# 5 Conclusion + +In this study, a generative-based method, IC-RDN is proposed for KOA prognosis, which forecasts future X-ray scans for joints and singular progression KOA severity grades. This obtains multifaceted KOA progression patterns for understanding and explaining KOA prognosis. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced for regularising and guiding the diffusion to focus more on the clinical nuances related to the prognosis and producing a more precise KOA severity progression grading. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method. In our future studies, the disentanglement of the representations related to the identity and KOA severity will be explored for fine-grained guidance in the X-ray image generation process. Meanwhile, the multimodal patterns among different medical imaging scans (e.g. X-ray, MRI, and CT) and patients' demographic information will be involved in producing a fine-grained KOA progression assessment outcome. + +# Acknowledgements + +This study was partially supported by Australian Research Council (ARC) grant DP210102674. The OAI [25] is a public-private partnership comprised of five contracts (N01-AR-2-2258; N01-AR2-2259; N01-AR-2-2260; N01-AR-2-2261; N01-AR-2-2262) funded by the National Institutes of Health, a branch of the Department of Health and Human Services, and conducted by the OAI Study Investigators. + +# References + +1. Almhdie-Imjabbar, A., Nguyen, K.L., Toumi, H., Jennane, R., Lespessailles, E.: Prediction of knee osteoarthritis progression using radiological descriptors obtained from bone texture analysis and siamese neural networks: data from OAI and most cohorts. Arthritis Research & Therapy 24(1), 1-13 (2022) +2. Antony, J., McGuinness, K., Moran, K., O'Connor, N.E.: Automatic detection of knee joints and quantification of knee osteoarthritis severity using convolutional neural networks. In: International Conference on Machine Learning and Data Mining. vol. 10358, pp. 376-390. Springer (2017) +3. Antony, J., McGuinness, K., O'Connor, N.E., Moran, K.: Quantifying radiographic knee osteoarthritis severity using deep convolutional neural networks. In: Int. Conf. Pattern Recog. pp. 1195-1200. IEEE (2016) +4. Berman, O., Oz, N., Mendlovic, D., Sochen, N., Cohen, Y., Klapp, I.: PETITGAN: physically enhanced thermal image-translating generative adversarial network. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1607-1616 (2024) +5. Brahim, A., Jennane, R., Riad, R., Janvier, T., Khedher, L., Toumi, H., Lesspessailles, E.: A decision support tool for early detection of knee osteoarthritis using x-ray imaging and machine learning: data from the Osteoarthritis Initiative. Computerized Medical Imaging and Graphics 73, 11-18 (2019) +6. Chan, L., Li, H., Chan, P., Wen, C.: A machine learning-based approach to decipher multi-etiology of knee osteoarthritis onset and deterioration. Osteoarthritis and Cartilage Open 3(1), 100135 (2021) +7. Chen, P., Gao, L., Shi, X., Allen, K., Yang, L.: Fully automatic knee osteoarthritis severity grading using deep neural networks with a novel ordinal loss. Comput. Med. Imag. Grap. 75, 84-92 (2019) +8. Cheung, J.C.W., Tam, A.Y.C., Chan, L.C., Chan, P.K., Wen, C.: Superiority of multiple-joint space width over minimum-joint space width approach in the machine learning for radiographic severity and knee osteoarthritis progression. Biology 10(11), 1107 (2021) +9. Cui, A., Li, H., Wang, D., Zhong, J., Chen, Y., Lu, H.: Global, regional prevalence, incidence and risk factors of knee osteoarthritis in population-based studies. EClinicalMedicine 29 (2020) +10. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: a large-scale hierarchical image database. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255. IEEE (2009) +11. Górriz, M., Antony, J., McGuinness, K., Giró-i Nieto, X., O'Connor, N.E.: Assessing knee OA severity with CNN attention-based end-to-end architectures. In: International Conference on Medical Imaging with Deep Learning. pp. 197-214. PMLR (2019) + +12. Guan, B., Liu, F., Mizaian, A.H., Demehri, S., Samsonov, A., Guermazi, A., Kijowski, R.: Deep learning approach to predict pain progression in knee osteoarthritis. Skeletal Radiology pp. 1-11 (2022) +13. Guermazi, A., Hunter, D.J., Roemer, F.W.: Plain radiography and magnetic resonance imaging diagnostics in osteoarthritis: validated staging and scoring. J. Bone Joint Surg. Am. 91(Supplement_1), 54-62 (2009) +14. Gunjal, A., Yin, J., Bas, E.: Detecting and preventing hallucinations in large vision language models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 18135-18143 (2024) +15. Hafezi-Nejad, N., Guermazi, A., Roemer, F.W., Hunter, D.J., Dam, E.B., Zikria, B., Kwoh, C.K., Demehri, S.: Prediction of medial tibiofemoral compartment joint space loss progression using volumetric cartilage measurements: data from the FNIH OA biomarkers consortium. European Radiology 27, 464-473 (2017) +16. Halilaj, E., Le, Y., Hicks, J.L., Hastie, T.J., Delp, S.L.: Modeling and predicting osteoarthritis progression: data from the Osteoarthritis Initiative. Osteoarthritis and Cartilage 26(12), 1643-1650 (2018) +17. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016) +18. Hirvasniemi, J., Runhaar, J., van der Heijden, R., Zokaeinikoo, M., Yang, M., Li, X., Tan, J., Rajamohan, H., Zhou, Y., Deniz, C., et al.: The knee osteoarthritis prediction (KNOAP2020) challenge: An image analysis challenge to predict incident symptomatic radiographic knee osteoarthritis from MRI and x-ray images. Osteoarthritis and Cartilage 31(1), 115-125 (2023) +19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems 33, 6840-6851 (2020) +20. Hu, K., Wu, W., Li, W., Simic, M., Zomaya, A., Wang, Z.: Adversarial evolving neural network for longitudinal knee osteoarthritis prediction. IEEE Transactions on Medical Imaging 41(11), 3207-3217 (2022) +21. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 4700-4708 (2017) +22. Jain, R.K., Sharma, P.K., Gaj, S., Sur, A., Ghosh, P.: Knee osteoarthritis severity prediction using an attentive multi-scale deep convolutional neural network. Multimedia Tools and Applications 83(3), 6925-6942 (2024) +23. Jamshidi, A., Pelletier, J.P., Labbe, A., Abram, F., Martel-Pelletier, J., Droit, A.: Machine learning-based individualized survival prediction model for total knee replacement in osteoarthritis: data from the Osteoarthritis Initiative. Arthritis Care & Research 73(10), 1518-1527 (2021) +24. Kellgren, J.H., Lawrence, J.: Radiological assessment of osteo-arthrosis. Annals of the Rheumatic Diseases 16(4), 494 (1957) +25. Lester, G.: Clinical research in OA-the NIH Osteoarthritis Initiative. J. Musculoskelet Neuronal Interact 8(4), 313-314 (2008) +26. Lindner, C., Thiagarajah, S., Wilkinson, J.: Fully automatic segmentation of the proximal femur using random forest regression voting. IEEE Trans. Med. Imaging 32, 1462-1472 (2013) +27. Nasser, Y., Hassouni, M.E., Jennane, R.: Discriminative deep neural network for predicting knee osteoarthritis in early stage. In: International Workshop on PRedictive Intelligence In MEdicine. pp. 126-136. Springer (2022) + +28. Nguyen, H.H., Saarakkala, S., Blaschko, M.B., Tiulpin, A.: Semixup: in-and out-of-manifold regularization for deep semi-supervised knee osteoarthritis severity grading from plain radiographs. IEEE Trans. Med. Imaging 39(12), 4346-4356 (2020) +29. Ntakolia, C., Kokkotis, C., Moustakidis, S., Tsaopoulos, D.: Prediction of joint space narrowing progression in knee osteoarthritis patients. Diagnostics 11(2), 285 (2021) +30. Pierson, E., Cutler, D.M., Leskovec, J., Mullainathan, S., Obermeyer, Z.: An algorithmic approach to reducing unexplained pain disparities in underserved populations. Nature Medicine 27(1), 136-140 (2021) +31. Prezja, F., Annala, L., Kiiskinen, S., Ojala, T.: Exploring the efficacy of base data augmentation methods in deep learning-based radiograph classification of knee joint osteoarthritis. Algorithms 17(1), 8 (2023) +32. Ribas, L.C., Riad, R., Jennane, R., Bruno, O.M.: A complex network based approach for knee osteoarthritis detection: data from the Osteoarthritis Initiative. Biomedical Signal Processing and Control 71, 103133 (2022) +33. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022) +34. Shamir, L., Ling, S.M., Scott, W., Hochberg, M., Ferrucci, L., Goldberg, I.G.: Early detection of radiographic knee osteoarthritis using computer-aided analysis. Osteoarthritis and Cartilage 17(10), 1307-1312 (2009) +35. Shamir, L., Ling, S.M., Scott, W.W., Bos, A., Orlov, N., Macura, T.J., Eckley, D.M., Ferrucci, L., Goldberg, I.G.: Knee x-ray image analysis method for automated detection of osteoarthritis. IEEE Transactions on Biomedical Engineering 56(2), 407-415 (2008) +36. Shentu, J., Al Moubayed, N.: Cxr-irgen: an integrated vision and language model for the generation of clinically accurate chest x-ray image-report pairs. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5200-5209 (2024) +37. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (2015) +38. Tiulpin, A., Klein, S., Bierma-Zeinstra, S.M., Thevenot, J., Rahtu, E., Meurs, J.v., Oei, E.H., Saarakkala, S.: Multimodal machine learning-based knee osteoarthritis progression prediction from plain radiographs and clinical data. Scientific Reports 9(1), 20038 (2019) +39. Tiulpin, A., Saarakkala, S.: Automatic grading of individual knee osteoarthritis features in plain radiographs using deep convolutional neural networks. Diagnostics 10(11), 932 (2020) +40. Tiulpin, A., Thevenot, J., Rahtu, E., Lehenkari, P., Saarakkala, S.: Automatic knee osteoarthritis diagnosis from plain radiographs: a deep learning-based approach. Sci. Rep. 8(1), 1-10 (2018) +41. Tolpadi, A.A., Lee, J.J., Pedoia, V., Majumdar, S.: Deep learning predicts total knee replacement from magnetic resonance images. Scientific Reports 10(1), 6371 (2020) +42. von Tycowicz, C.: Towards shape-based knee osteoarthritis classification using graph convolutional networks. In: IEEE International Symposium on Biomedical Imaging. pp. 750-753. IEEE (2020) +43. Widera, P., Weling, P.M., Ladel, C., Loughlin, J., Lafeber, F.P., Petit Dop, F., Larkin, J., Weinans, H., Mobasheri, A., Bacardit, J.: Multi-classifier prediction of knee osteoarthritis progression from incomplete imbalanced longitudinal data. Scientific Reports 10(1), 8427 (2020) + +44. Wu, W., Hu, K., Yue, W., Li, W., Simic, M., Li, C., Xiang, W., Wang, Z.: Self-supervised multimodal fusion network for knee osteoarthritis severity grading. In: International Conference on Digital Image Computing: Techniques and Applications. pp. 57-64. IEEE (2023) +45. Zhang, B., Tan, J., Cho, K., Chang, G., Deniz, C.M.: Attention-based CNN for KL grade classification: data from the Osteoarthritis Initiative. In: International Symposium on Biomedical Imaging. pp. 731-735. IEEE (2020) +46. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 2223-2232 (2017) \ No newline at end of file diff --git a/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/images.zip b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..c87178bd6c8742516d72fe868a2e8d99aa562e47 --- /dev/null +++ b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:07e856706e6e31a3e5502caf895a1d42a4dbbb94d42ded86f687800f06ecc1f0 +size 481918 diff --git a/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/layout.json b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..53b8a5e884ac000e3e0e0e1e5f9cb6d79e83932f --- /dev/null +++ b/2024/Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging/layout.json @@ -0,0 +1,8336 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 155, + 111, + 459, + 166 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 111, + 459, + 166 + ], + "spans": [ + { + "bbox": [ + 155, + 111, + 459, + 166 + ], + "type": "text", + "content": "Identity-Consistent Diffusion Network for Grading Knee Osteoarthritis Progression in Radiographic Imaging" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "spans": [ + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": "Wenhua " + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "\\mathsf{W u}^{1}" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": " , Kun " + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "\\mathsf{H u}^{1,\\star}" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": " , Wenxi Yue" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": ", Wei Li" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": ", Milena Simic" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": ", Changyang " + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "\\mathsf{L i}^{2}" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": ", Wei Xiang" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "text", + "content": ", and Zhiyong Wang" + }, + { + "bbox": [ + 151, + 185, + 462, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 168, + 219, + 443, + 252 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 219, + 443, + 252 + ], + "spans": [ + { + "bbox": [ + 168, + 219, + 443, + 252 + ], + "type": "text", + "content": "1 The University of Sydney, Darlington NSW 2008, Australia {wenhua.wu, kun.hu, wenxi.yue, weiwilson.li, milena.simic, zhiyong.wang}@sydney.edu.au" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 173, + 253, + 440, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 253, + 440, + 274 + ], + "spans": [ + { + "bbox": [ + 173, + 253, + 440, + 274 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 173, + 253, + 440, + 274 + ], + "type": "text", + "content": " Sydney Polytechnic Institute Pty Ltd, Sydney, NSW, Australia chris@ruddergroup.com.au" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 136, + 274, + 477, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 274, + 477, + 297 + ], + "spans": [ + { + "bbox": [ + 136, + 274, + 477, + 297 + ], + "type": "text", + "content": "3 School of Computing, Engineering & Mathematical Sciences, La Trobe University w.xiang@latrobe.edu.au" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 159, + 320, + 452, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 320, + 452, + 552 + ], + "spans": [ + { + "bbox": [ + 159, + 320, + 452, + 552 + ], + "type": "text", + "content": "Abstract. Knee osteoarthritis (KOA), a common form of arthritis that causes physical disability, has become increasingly prevalent in society. Employing computer-aided techniques to automatically assess the severity and progression of KOA can greatly benefit KOA treatment and disease management. Particularly, the advancement of X-ray technology in KOA demonstrates its potential for this purpose. Yet, existing X-ray prognosis research generally yields a singular progression severity grade, overlooking the potential visual changes for understanding and explaining the progression outcome. Therefore, in this study, a novel generative model is proposed, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), for multifaceted KOA prognosis encompassing a predicted future knee X-ray scan conditioned on the baseline scan. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to conventional image-to-image generative models, identity priors regularize and guide the diffusion to focus more on the clinical nuances of the prognosis based on a contrastive learning strategy. The progression prediction module utilizes both forecasted and baseline knee scans, and a more comprehensive formulation of KOA severity progression grading is expected. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 561, + 453, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 561, + 453, + 582 + ], + "spans": [ + { + "bbox": [ + 159, + 561, + 453, + 582 + ], + "type": "text", + "content": "Keywords: Knee Osteoarthritis " + }, + { + "bbox": [ + 159, + 561, + 453, + 582 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 561, + 453, + 582 + ], + "type": "text", + "content": " Medical Imaging " + }, + { + "bbox": [ + 159, + 561, + 453, + 582 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 561, + 453, + 582 + ], + "type": "text", + "content": " Medical Assessment Generation" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 601, + 229, + 613 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 229, + 613 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 229, + 613 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "spans": [ + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "text", + "content": "Knee osteoarthritis (KOA) is a common form of arthritis, mainly affecting knee joints with the symptoms of knee joint swelling, tenderness, and bone spurs." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "text", + "content": "* Corresponding author." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 158, + 118, + 455, + 222 + ], + "blocks": [ + { + "bbox": [ + 158, + 118, + 455, + 222 + ], + "lines": [ + { + "bbox": [ + 158, + 118, + 455, + 222 + ], + "spans": [ + { + "bbox": [ + 158, + 118, + 455, + 222 + ], + "type": "image", + "image_path": "dfbfac2951419f43afab0268f50557f88497a2953e595e0efb465d6cbaf26a63.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 232, + 482, + 257 + ], + "lines": [ + { + "bbox": [ + 131, + 232, + 482, + 257 + ], + "spans": [ + { + "bbox": [ + 131, + 232, + 482, + 257 + ], + "type": "text", + "content": "Fig. 1: Pipeline for KOA severity progression grading, encompassing a) predicted future knee joint X-ray scan, and b) predicted KOA progression severity grade." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 280, + 482, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 280, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 280, + 482, + 413 + ], + "type": "text", + "content": "As the major factor of physical disability, KOA has recently shown an increasing prevalence in society, especially among the elders [9]. Currently, there are rare treatments for curing KOA without physical surgery (total knee replacement) [13]. Therefore, to relieve the pain and control the progression of KOA, the diagnosis and prognosis of the disease are significant, using different clinical assessment methods, such as medical imaging scans and patients' clinic questionnaires. In specific, the imaging scans are utilized to detect the structural changes within the knee joint areas, which indicates the characteristics of KOA. Typically, the severity of KOA is measured by the Kellgren and Lawrence (KL) grading scale system, which encompasses five different levels, from grade 0 (healthy cases) to grade 4 (highly severe cases) [24]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 413, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 629 + ], + "type": "text", + "content": "Compared to the extensive time and human resources required for specialists to detect changes, employing computer-aided techniques to automatically assess the severity and progression of KOA can significantly reduce time costs. This aids in the prompt diagnosis and prognosis of KOA at early stages [5,20]. Methods for grading the severity and progression of KOA have evolved from traditional machine learning approaches [34,35] to advanced deep learning techniques [7,39]. These modern approaches utilize various forms of input, including single images, multiple images, and images combined with demographic information (such as age, gender, BMI, and the WOMAC questionnaire) [27,38,42,45]. Particularly, the advancement of X-ray technology and its application in KOA significantly improves the capability to detect and monitor the progression [12,18,20]. Meanwhile, utilising the generative AI methods in the KOA analysis field focuses on augmenting the knee radiological dataset to improve the grading process [31]. Yet, existing X-ray prognosis research generally yields a singular progression severity grade using the baseline X-ray scan [1,12,18], overlooking the potential visual changes for understanding and explaining the progression outcome. However, the visually predicted outcome is also crucial in clinical practice to explain the disease trajectory." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "In addition to enhancing these methods, we hope the longitude visual content will also aid clinicians in their decision-making by providing further explainability and as domain knowledge to guide the algorithms. For the methodology part," + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 186 + ], + "type": "text", + "content": "previous findings revealed that GANs yield poor bone structures and inconsistency in patients' identity information, which motivated us to devise a diffusion-based method with identity information. Identity patterns are crucial with a principle widely utilized in the forensic field. We anticipate that incorporating such information improves the consistency between baselines and synthesized longitude images." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 189, + 480, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 189, + 480, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 189, + 480, + 344 + ], + "type": "text", + "content": "Therefore, in this study, a novel deep generative model, namely Identity-Consistent Radiographic Diffusion Network (IC-RDN), is proposed for multifaceted KOA prognosis. IC-RDN creates a predicted future knee X-ray scan conditioned on the baseline scan and a future KOA severity grade as illustrated in Fig. 1. Specifically, an identity prior module for guiding the diffusion and a downstream generation-guided progression prediction module are introduced. Compared to a conventional image-to-image generative model, identity priors regularize and guide the diffusion to focus more on the clinical nuances related to the prognosis based on a contrastive learning strategy. Using both forecasted and baseline knee scans, we anticipate a more comprehensive and enhanced formulation of KOA severity progression measured in grades with the progression prediction module. Extensive experiments on a widely used public dataset, OAI [25], demonstrate the effectiveness of the proposed method." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 344, + 449, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 344, + 449, + 357 + ], + "spans": [ + { + "bbox": [ + 146, + 344, + 449, + 357 + ], + "type": "text", + "content": "The key contributions of this study can be summarised in three-fold:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 368, + 480, + 464 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 368, + 479, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 368, + 479, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 368, + 479, + 403 + ], + "type": "text", + "content": "- A novel deep generative model - IC-RDN is proposed for multifaceted KOA prognosis prediction for the first time, encompassing radiographic visual predictions and grading forecasting." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 404, + 480, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 404, + 480, + 437 + ], + "spans": [ + { + "bbox": [ + 138, + 404, + 480, + 437 + ], + "type": "text", + "content": "- An identity prior module for persisting patient's identity information on bone X-ray images is proposed to guide the diffusion process focusing on clinical nuances." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 441, + 479, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 441, + 479, + 464 + ], + "spans": [ + { + "bbox": [ + 138, + 441, + 479, + 464 + ], + "type": "text", + "content": "- Comprehensive experiments with the public OAI dataset demonstrate the effectiveness of the proposed method." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 484, + 242, + 498 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 484, + 242, + 498 + ], + "spans": [ + { + "bbox": [ + 132, + 484, + 242, + 498 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 512, + 354, + 525 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 512, + 354, + 525 + ], + "spans": [ + { + "bbox": [ + 131, + 512, + 354, + 525 + ], + "type": "text", + "content": "2.1 Computer-Aid KOA Severity Grading" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Existing studies in grading the severity of KOA can be categorised into KOA detection and KOA multi-class grading [27, 44]. The KOA detection focuses on categorising several or combined severity grades from the whole grading system to achieve a coarse-grained classification. For instance, a graph neural network has been designed to utilize the shape boundary information of knee bones for KOA detection [42]. In addition to shape, texture features have been independently utilized for KOA detection to examine the internal pixel relationship [32]. To leverage both textural and shape information, the features extracted from the shallow and deeper layers of a DenseNet model are combined, where the shallow layers contain more shape patterns and the deeper layers focus on textural information [27]." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "content": "Multiclass grading, on the other hand, concentrates more on exploring each grading severity level in the system. As the KL grades can be considered a continuous measurement, with convolution neural networks, both regression and classification strategies are studied [2, 3]. Likewise, an ordinal loss function is proposed to formulate the continuous nature of KL grades [7]. In parallel, the attention mechanisms identify the significant areas related to KOA multiclass grading [11, 45]. In [22], attention mechanisms are studied to combine and fuse multi-scale features from a network. Furthermore, to take advantage of the symmetrical structure of knee joints, a Siamese Network is employed to investigate the relationship between both knee joints. This approach facilitates the analysis of intricate KOA patterns in both fully supervised and semi-supervised manners, addressing the challenge posed by the scarcity of annotated datasets [28, 40]. Likewise, a self-supervised method has been introduced. This method leverages both X-ray and MRI images to expand the pool of positive pairs in contrastive learning settings, offering a robust solution to dataset limitations [44]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 312, + 425, + 324 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 312, + 425, + 324 + ], + "spans": [ + { + "bbox": [ + 131, + 312, + 425, + 324 + ], + "type": "text", + "content": "2.2 Computer-Aid KOA Longitude Progression Grading" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 331, + 482, + 402 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 482, + 402 + ], + "type": "text", + "content": "Apart from KOA severity grading, predicting the progression of the disease is also significant for medical treatment. Existing works mainly focus on different aspects in predicting the progression of KOA: 1) Knee joint pain status; 2) KOA risk factor prediction; 3) Joint space narrowing (JSN) and cartilage structural change prediction; 4) KL grade prediction; and 5) total knee replacement surgery (TKR) prediction." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 402, + 482, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 545 + ], + "type": "text", + "content": "Early studies on grading the progression of KOA mainly rely on conventional machine learning algorithms. In specific, the feature selection is leveraged in filtering the significant features contributing to the progression grades [29]. Parallely, the comparison among different machine learning classifiers is conducted to select the algorithm with better progression grading performance [43]. [8] utilises the XGBoost model to predict the knee joint width as a KOA progression factor. To take advantage of various classification algorithms, the ensemble strategy is deployed among RandomForest, logistic regression, and support vector machine [23]. These machine learning-based methods show some encouraging results in feature engineering, where the extracted features are combined and utilized with methods such as multilayer perceptrons (MLPs) to predict the cartilage volume from MRI scans [15]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "With the powered deep learning methods explored in both general and medical fields, end-to-end approaches have shown promising results in KOA progression grading. An MLP is deployed as a classifier to predict progression grades [6]. Neural Networks, otherwise, are utilised to predict pain status via extracting information from radiographics and demographics [12, 30]. Likewise, CNN-based methods are also leveraged in analysing various KOA risk factors [6] and predicting the JSN progression [1, 16]. To explore the KOA evolutionary trajectory, an Adversarial Evolving Neural Network is proposed to involve the estimated KOA patterns at different grades as auxiliary information [20]. Although predicting the direct KOA symptoms shows a clearer progression measurement, grading the" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "progression KL grades and predicting TKR are also able to illustrate the progression in the clinical assessment domain. A binary classification model is designed based on whether the patient needs to take TKR as a future event [18, 23, 41]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 480, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 480, + 248 + ], + "type": "text", + "content": "Despite using medical imaging only, the information from multiple modalities, including imaging scans, clinical questionnaires, and demographics, are leveraged in a multimodal method to analyse the KOA progression comprehensively [38]. However, these studies only produce a direct outcome for progression grading ignoring the visual information from the given medical imaging techniques. Therefore, including visual information as an additional modality for analysing comprehensive multifaceted progression patterns is attractive to be explored." + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 142, + 275, + 474, + 460 + ], + "blocks": [ + { + "bbox": [ + 142, + 275, + 474, + 460 + ], + "lines": [ + { + "bbox": [ + 142, + 275, + 474, + 460 + ], + "spans": [ + { + "bbox": [ + 142, + 275, + 474, + 460 + ], + "type": "image", + "image_path": "22278a3b2b162b9c7d534811229beb0e7910216e94c0ec991b5189aa7dfa4161.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 478, + 482, + 534 + ], + "lines": [ + { + "bbox": [ + 130, + 478, + 482, + 534 + ], + "spans": [ + { + "bbox": [ + 130, + 478, + 482, + 534 + ], + "type": "text", + "content": "Fig. 2: Illustration of the proposed IC-RDN method. (a) An identity prior module formulates identity representation, which guides the diffusion process for the generation. (b) An I2I image generative network to forecast a future 12-month X-ray scan. (c) A downstream KOA progression prediction network, taking the baseline and the predicted 12-month X-ray scans as inputs." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 578, + 233, + 593 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 233, + 593 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 233, + 593 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "As shown in Fig. 2, the proposed IC-RDN consists of three modules: 1) an identity prior module extracts patient's identity representations; 2) a diffusion-based generative module produces the future X-ray images based on the current-stage X-ray scans and the associated identity representations; and 3) a down-stream generation-guided progression prediction module that predicts the progression" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "severity using both current and generated future X-ray images to provide comprehensive multifaceted progression patterns." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 159, + 380, + 171 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 159, + 380, + 171 + ], + "spans": [ + { + "bbox": [ + 131, + 159, + 380, + 171 + ], + "type": "text", + "content": "3.1 KOA Progression Radiographic Generation" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": "This study incorporates X-ray medical imaging scans to predict the progression of KOA. The objective is to forecast the severity of KOA progression from two perspectives, encompassing severity grading score and visual information (i.e., a generated knee X-ray scan in the future - 12-month in this study). Initially, radiographic images for joints are captured during the baseline (first) X-ray scan, referred to as the baseline visit or 0-month visit. Patients are then asked to undergo a follow-up X-ray scan after 12 months for longitudinal tracking. Specifically, the " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "i^{\\text{th}}" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " longitude X-ray joint pairs from the dataset is denoted as " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\text{visit}}^i \\in \\{\\mathbf{I}_{\\text{baseline}}^i, \\mathbf{I}_{12\\text{-month}}^i\\}" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\text{visit}}^i \\in \\mathbb{R}^{C \\times W \\times H}" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "C, W" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " are the number of channels, the width and the height of the X-ray joint images. For notation simplicity, " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\text{baseline}}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{12\\text{months}}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " can be shortened as " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\text{v00m}}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\text{v12m}}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": ". And the generated 12-month X-ray image for the " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "i^{\\text{th}}" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " joint pair is denoted as " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{I}}_{12\\text{months}}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{I}}_{\\text{v12m}}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": ". The corresponding severity grade for the 12-month visit is indicated by " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "y_{KL}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": " and the grades produced by the prediction model are shown by " + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\hat{y}_{KL}^i" + }, + { + "bbox": [ + 130, + 180, + 482, + 361 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 378, + 326, + 391 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 378, + 326, + 391 + ], + "spans": [ + { + "bbox": [ + 131, + 378, + 326, + 391 + ], + "type": "text", + "content": "3.2 Diffusion-based Visual Prognosis" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": "The diffusion-based generative module in the IC-RDN is designed to produce 12-month X-ray images from baseline visit images for understanding and explaining the potential visual changes in terms of KOA patterns. This incorporates a T-step Denoising Diffusion Probabilistic Model (DDPM) [19] under an image-to-image transition manner. The DDPM consists of two primary processes: the forward (or diffusion) process and the reverse process. Typically, in the forward process, the original data " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_0 \\sim q_{data}(x_0)" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " is transformed towards an isotropic Gaussian distribution. However, within our image-to-image diffusion model, the aim is to map the data " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_0 \\sim q_{data}(x_0)" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_T" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": ", where, in our context, " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_0" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " represents a 12-month visit X-ray image " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\mathrm{v12m}}^i" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_T" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " corresponds to the baseline visit X-ray images " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\mathrm{v00m}}^i" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": ". This transformation is modelled as a fixed Markov Chain of length " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": ". Subsequently, the reverse process mirrors the forward process, aiming to predict " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_0" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "inline_equation", + "content": "x_T \\sim q_{data}(x_T)" + }, + { + "bbox": [ + 130, + 399, + 482, + 555 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "text", + "content": "However, executing both processes directly in pixel space is highly resource-intensive, necessitating substantial memory and computational power. To mitigate this, a VQ-GAN-based encoder (see Fig. 2 (b.1.)) encodes " + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "inline_equation", + "content": "x_0" + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "text", + "content": " into a latent space " + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "inline_equation", + "content": "z_0" + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "text", + "content": ", wherein both the forward and reverse processes (see Fig. 2 (b.3.)) are performed to generate " + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "inline_equation", + "content": "z_T" + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "text", + "content": ". A VQ-GAN-based decoder (depicted in Fig. 2 (b.2.)) then decodes " + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "inline_equation", + "content": "z_T" + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "text", + "content": " back from the latent space to the pixel space " + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "inline_equation", + "content": "(x_T)" + }, + { + "bbox": [ + 130, + 555, + 482, + 639 + ], + "type": "text", + "content": ". The objective of this stable diffusion-based approach [33] is formulated as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 214, + 648, + 481, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 648, + 481, + 669 + ], + "spans": [ + { + "bbox": [ + 214, + 648, + 481, + 669 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {L D M}} := \\mathbb {E} _ {\\varepsilon (x), \\varepsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\| \\varepsilon - \\varepsilon_ {\\theta} \\left(z _ {t}, t\\right) \\| _ {2} ^ {2} \\right], \\tag {1}", + "image_path": "275c1c002803ee26ea305b4fefceb06bbe443cbea8b0509596daa2dc5553dd43.jpg" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\varepsilon_{\\theta}(z_t,t)" + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": " denotes a denoising autoencoders (time-conditional UNet) and " + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": " contains the corresponding weights, where " + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "t = 1\\dots T" + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 157, + 359, + 170 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 157, + 359, + 170 + ], + "spans": [ + { + "bbox": [ + 131, + 157, + 359, + 170 + ], + "type": "text", + "content": "3.3 Knee Joint Identity Prior and Injection" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "spans": [ + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "text", + "content": "To persist a subject's identity information in generating the corresponding 12-month X-ray scan, an identity prior module is devised to extract the identity-sensitive patterns. Specifically, we denote the identity representation for the " + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "inline_equation", + "content": "i^{th}" + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "text", + "content": " subject joint as " + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{\\mathrm{ID}}^i\\in \\mathbb{R}^d" + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "text", + "content": " indicates the dimension of the identity representation. A CNN-based network " + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 131, + 176, + 479, + 248 + ], + "type": "text", + "content": " is designed to obtain the identity representation. Mathematically, we have:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 272, + 257, + 480, + 270 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 257, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 272, + 257, + 480, + 270 + ], + "type": "interline_equation", + "content": "\\mathbf {F} _ {\\mathrm {I D}} ^ {i} = f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right). \\tag {2}", + "image_path": "228351b3a85267ba9b9b74e3da783c4f71c450fd8b528770a695a456847e9c7f.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 278, + 479, + 313 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 278, + 479, + 313 + ], + "spans": [ + { + "bbox": [ + 131, + 278, + 479, + 313 + ], + "type": "text", + "content": "The identity information guides and regularizes the diffusion process to not only focus on the target visual domain distribution but also maintain necessary information from the subjects." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 314, + 479, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 314, + 479, + 350 + ], + "spans": [ + { + "bbox": [ + 131, + 314, + 479, + 350 + ], + "type": "text", + "content": "For the supervision of " + }, + { + "bbox": [ + 131, + 314, + 479, + 350 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 131, + 314, + 479, + 350 + ], + "type": "text", + "content": " to formulate identity information, it is proposed to conduct training in a contrastive learning manner. A triplet loss is introduced for this purpose as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 357, + 480, + 378 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 357, + 480, + 378 + ], + "spans": [ + { + "bbox": [ + 142, + 357, + 480, + 378 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {T r i p l e t}} = \\sum \\left[ \\left\\| f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right) - f \\left(\\mathbf {I} _ {\\mathrm {v} 1 2 \\mathrm {m}} ^ {i}\\right) \\right\\| _ {2} ^ {2} - \\left\\| f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right) - f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {k}\\right) \\right\\| _ {2} ^ {2} + \\alpha \\right] _ {+}, \\tag {3}", + "image_path": "2dca76a24d15c4cd316e3c6a175c764478fc1661fe58e85f9431492a7f61d789.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "spans": [ + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": "where a triplet is formulated as " + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "inline_equation", + "content": "(\\mathbf{I}_{\\mathrm{v00m}}^i,\\mathbf{I}_{\\mathrm{v12m}}^i,\\mathbf{I}_{\\mathrm{v00m}}^k)" + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": ": " + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\mathrm{v00m}}^i" + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": " indicates the anchor of current subject's joint; " + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\mathrm{v12m}}^i" + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": " refers to a positive sample from the same subject's joint; " + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\mathrm{v00m}}^k" + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": " is a negative sample with " + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "inline_equation", + "content": "i\\neq k" + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": "; and " + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": " is a margin enforcing between positive and negative pairs. Note that the number of triplets " + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 131, + 387, + 479, + 447 + ], + "type": "text", + "content": " used in the training process is defined in the experiment implementations." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "spans": [ + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "text", + "content": "The identity information acts as a guide and regulator for the diffusion process, ensuring that it not only aligns with the target visual domain distribution but also preserves essential information pertaining to the subjects. To inject the identity into the diffusion process, a cross-attention mechanism is applied between the features from the UNet layers in " + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{\\mathrm{ID}}" + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "text", + "content": ". For the " + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "inline_equation", + "content": "t^{\\mathrm{th}}" + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "text", + "content": " diffusion step and " + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "inline_equation", + "content": "j^{\\mathrm{th}}" + }, + { + "bbox": [ + 131, + 448, + 479, + 519 + ], + "type": "text", + "content": " layer, the attention can be formulated as follows:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 143, + 527, + 480, + 563 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 527, + 480, + 563 + ], + "spans": [ + { + "bbox": [ + 143, + 527, + 480, + 563 + ], + "type": "interline_equation", + "content": "\\mathbf {A} _ {j} = \\operatorname {S o f t m a x} \\left(\\frac {\\mathbf {Q} \\mathbf {K} ^ {\\intercal}}{\\sqrt {d}}\\right) \\mathbf {V}, \\mathbf {Q} = \\phi_ {j} \\left(z _ {t}\\right) \\mathbf {M} _ {j} ^ {Q}, \\mathbf {K} = \\mathbf {F} _ {\\mathrm {I D}} ^ {i} \\mathbf {M} _ {j} ^ {K}, \\text {a n d} \\mathbf {V} = \\mathbf {F} _ {\\mathrm {I D}} ^ {i} \\mathbf {M} _ {j} ^ {V}, \\tag {4}", + "image_path": "7f8dac97018a5d289d43230cd6dac6ffd9b20104ff71c6cc5bf3db01ddd8b6b4.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "spans": [ + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "inline_equation", + "content": "\\mathbf{M}^{\\circ_j}" + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "text", + "content": " represents a projection matrix containing trainable weights with a projection dimension " + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "inline_equation", + "content": "\\phi_j(z_t)" + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "text", + "content": " indicates the (flattened) intermediate representation of the UNet with " + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "inline_equation", + "content": "j^{\\mathrm{th}}" + }, + { + "bbox": [ + 131, + 563, + 479, + 598 + ], + "type": "text", + "content": " layer. The UNet can be formulated by:" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 255, + 609, + 480, + 620 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 609, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 255, + 609, + 480, + 620 + ], + "type": "interline_equation", + "content": "\\phi_ {j + 1} \\left(z _ {t}\\right) = \\phi_ {j} \\left(z _ {t}\\right) + \\mathbf {A} _ {j}, \\tag {5}", + "image_path": "35124dee6662d7358d8eb64663beaa0ead533676888d66cc8f693e52888629b8.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 146, + 628, + 432, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 628, + 432, + 640 + ], + "spans": [ + { + "bbox": [ + 146, + 628, + 432, + 640 + ], + "type": "text", + "content": "To this end, the IC-RDN can be learnt via the following scheme:" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 178, + 648, + 479, + 668 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 178, + 648, + 479, + 668 + ], + "spans": [ + { + "bbox": [ + 178, + 648, + 479, + 668 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {L D M - I d e n t i t y}} := \\mathbb {E} _ {\\varepsilon (x), \\varepsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\left\\| \\varepsilon - \\varepsilon_ {\\theta} \\left(z _ {t}, t, f \\left(\\mathbf {I} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i}\\right)\\right) \\right\\| _ {2} ^ {2} \\right]. \\tag {6}", + "image_path": "bd5b244baf5de7749cf6821a16e0cedfe77c4674d1258a56c05b8984deacdc7f.jpg" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 406, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 406, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 406, + 129 + ], + "type": "text", + "content": "3.4 Generation-Guided KOA Progression Prediction" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "text", + "content": "In addition to generating 12-month X-ray image " + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{I}}_{\\mathrm{v}12\\mathrm{m}}^i" + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "text", + "content": " for prognosis, a singular progression severity grade is predicted as well based on the baseline visit X-ray image " + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\mathrm{v00m}}^i" + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "text", + "content": " and the generated 12-month visit X-ray image " + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{I}}_{\\mathrm{v}12\\mathrm{m}}^i" + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "text", + "content": ". Specifically, a two-stream CNN backbone with two branches " + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "inline_equation", + "content": "h_{\\mathrm{v00m}}(\\cdot)" + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "inline_equation", + "content": "h_{\\mathrm{v12m}}(\\cdot)" + }, + { + "bbox": [ + 130, + 135, + 482, + 196 + ], + "type": "text", + "content": " is applied for the two images to produce the associated representations:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 207, + 205, + 481, + 220 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 207, + 205, + 481, + 220 + ], + "spans": [ + { + "bbox": [ + 207, + 205, + 481, + 220 + ], + "type": "interline_equation", + "content": "\\mathbf {P} _ {\\mathrm {v 0 0 m}} ^ {i} = h _ {\\mathrm {v 0 0 m}} (\\mathbf {I} _ {\\mathrm {v 0 0 m}} ^ {i}), \\mathbf {P} _ {\\mathrm {v 1 2 m}} ^ {i} = h _ {\\mathrm {v 1 2 m}} (\\hat {\\mathbf {I}} _ {\\mathrm {v 1 2 m}} ^ {i}). \\tag {7}", + "image_path": "49124423e50e4cfb753bacfa69fc7db57edf298b37df5af20aa328736c474a1a.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "spans": [ + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "text", + "content": "The two representations are then concatenated, denoted by " + }, + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "inline_equation", + "content": "\\parallel" + }, + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "text", + "content": ", and used in a multi-layer perceptron (MLP) classifier " + }, + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "text", + "content": " to produce the predicted progression severity grade " + }, + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "inline_equation", + "content": "(\\hat{y}_{KL}^{i})" + }, + { + "bbox": [ + 131, + 227, + 482, + 264 + ], + "type": "text", + "content": ", which can be formulated as:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 255, + 272, + 481, + 287 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 272, + 481, + 287 + ], + "spans": [ + { + "bbox": [ + 255, + 272, + 481, + 287 + ], + "type": "interline_equation", + "content": "\\hat {y} _ {K L} ^ {i} = g \\left(\\mathbf {P} _ {\\mathrm {v} 0 0 \\mathrm {m}} ^ {i} \\| \\mathbf {P} _ {\\mathrm {v} 1 2 \\mathrm {m}} ^ {i}\\right) \\tag {8}", + "image_path": "a9f5477b19931462c471750d4dc857b40b472166f15c773dffcb665dd034f65d.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 294, + 481, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 294, + 481, + 319 + ], + "spans": [ + { + "bbox": [ + 131, + 294, + 481, + 319 + ], + "type": "text", + "content": "A cross-entropy loss is leveraged in the training process to guide the prediction training process, which can be formulated as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 252, + 327, + 481, + 360 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 327, + 481, + 360 + ], + "spans": [ + { + "bbox": [ + 252, + 327, + 481, + 360 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {C E}} = - \\sum_ {i = 1} ^ {N} y _ {K L} ^ {i} \\log \\hat {y} _ {K L} ^ {i} \\tag {9}", + "image_path": "c63db1bc691d0d29b0782db11e67935a23297ece4a8271d1993d11c35566e2f1.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 363, + 397, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 363, + 397, + 376 + ], + "spans": [ + { + "bbox": [ + 131, + 363, + 397, + 376 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 363, + 397, + 376 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 131, + 363, + 397, + 376 + ], + "type": "text", + "content": " indicates the total number of joints in the dataset." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 393, + 375, + 407 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 393, + 375, + 407 + ], + "spans": [ + { + "bbox": [ + 131, + 393, + 375, + 407 + ], + "type": "text", + "content": "4 Experimental Results and Discussion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 418, + 302, + 431 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 418, + 302, + 431 + ], + "spans": [ + { + "bbox": [ + 131, + 418, + 302, + 431 + ], + "type": "text", + "content": "4.1 Dataset and Pre-Processing" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": "The longitudinal X-ray images used in this study were sourced from the Osteoarthritis Initiative (OAI) [25], which is a multi-centre and longitude study containing chronological medical imaging scans and clinical assessment records for the subjects up to 96 months. This public dataset enables researchers to explore the natural progression of osteoarthritis, identify risk factors, and evaluate biomarkers for grading the KOA severity and progression. In this study, the patients with both baseline and 12-month visits and available 12-month severity KL grades are selected. Due to some participants opting out of the follow-up study and missing recording of clinical severity grading outcome, not all have recordings for the 12-month visit image and severity KL grades. Consequently, 7,923 joints have both the KL grade available and radiographic recordings from both the baseline and 12-month visits. As the demographic information shown in Table 1, the amount of joints with changed severity grades among 12 months is much smaller than that of without changes, where only " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "6.15\\%" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " joints show a changed severity grade. However, across these joints without the severity grade changes, the visual structural details do not remain the same, which also shows the importance of the proposed multifaceted progression predicting method. The dataset was randomly divided among subjects with a distribution of " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "70\\%" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " for training, validation, and testing, respectively." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 135, + 466, + 206 + ], + "blocks": [ + { + "bbox": [ + 145, + 114, + 468, + 126 + ], + "lines": [ + { + "bbox": [ + 145, + 114, + 468, + 126 + ], + "spans": [ + { + "bbox": [ + 145, + 114, + 468, + 126 + ], + "type": "text", + "content": "Table 1: Statistics of patients, joints and KL grades in OAI longitudinal visits" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 135, + 466, + 206 + ], + "lines": [ + { + "bbox": [ + 148, + 135, + 466, + 206 + ], + "spans": [ + { + "bbox": [ + 148, + 135, + 466, + 206 + ], + "type": "table", + "html": "
Longitudinal VisitsPatients Available Joints Joints with KL Grades
Baseline Visit4,5519,1028,953
12-Month Visit4,7869,4188,251
Longitudinal KL Changed487 (6.15%)
Longitudinal KL Unchanged7,436 (93.85%)
Both Visits7,923
", + "image_path": "7e7ff907abe6b49fd7765bdc5c948e805f135da80607a48066f32cbc7f2c5df2.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 226, + 482, + 310 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 310 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 310 + ], + "type": "text", + "content": "As the raw data from the OAI contains bilateral knee joints and includes almost all knee bones around the joint area, knee joint localisation methods are leveraged to extract the knee joint area individually [26]. After detecting the knee joint edge, a " + }, + { + "bbox": [ + 130, + 226, + 482, + 310 + ], + "type": "inline_equation", + "content": "224 \\times 224" + }, + { + "bbox": [ + 130, + 226, + 482, + 310 + ], + "type": "text", + "content": " region surrounding the middle of the joint was extracted from the raw data for modelling. The remaining transformation approaches for the joint images are followed [7], including adjusting the brightness, contrast and saturation of the images." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 326, + 279, + 338 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 279, + 338 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 279, + 338 + ], + "type": "text", + "content": "4.2 Implementation Details" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 344, + 482, + 463 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 344, + 482, + 463 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 482, + 463 + ], + "type": "text", + "content": "A pretrained ResNet 18 on ImageNet [10] is adopted as the backbone classification model for identity detection, which extracts the identity features from the baseline X-ray scans. Within Identity Prior's contrastive learning framework, we have designated the number of triplets " + }, + { + "bbox": [ + 130, + 344, + 482, + 463 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 344, + 482, + 463 + ], + "type": "text", + "content": " as 7,000 for training and 1,000 for testing. The Identity Prior training phase is fine-tuned using the Adam optimizer with a learning rate of 0.01, and the batch size for this phase is established at 128. For the training process of the diffusion-based generative module, we set the number of steps to 1,000,000 across 400 epochs. The Adam optimizer is employed here as well, with a learning rate set at " + }, + { + "bbox": [ + 130, + 344, + 482, + 463 + ], + "type": "inline_equation", + "content": "1 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 344, + 482, + 463 + ], + "type": "text", + "content": ". The batch sizes for training and testing are 64 and 8, respectively." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "spans": [ + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "text", + "content": "For the backbone models in the generation-guided KOA progression prediction module, various CNN methods are adopted, such as VGG 16, VGG 19, ResNet 18, ResNet 50, and DenseNet 121, for a comprehensive comparison [17,21,37]. Specifically, the backbone prediction models for both branches, corresponding to " + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{\\mathrm{v00m}}" + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{I}}_{\\mathrm{v12m}}" + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "text", + "content": ", share the same architecture. In addition, the output features dimension from these backbone models is set to 128. Then the MLP classifier " + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "text", + "content": " takes the input dimension of 256, which contains two linear layers, an activation layer, and a dropout layer. The training process is conducted with a batch size of 16. An SGD optimizer is utilized with the learning rate of " + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "inline_equation", + "content": "5\\times 10^{-3}" + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "text", + "content": " and a weight decaying factor of " + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "inline_equation", + "content": "5\\times 10^{-3}" + }, + { + "bbox": [ + 130, + 464, + 482, + 608 + ], + "type": "text", + "content": " for every 5 epochs. The entire training regimen is executed using PyTorch 2.0.1 on an NVIDIA RTX A6000 with 48 GB of video memory." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 623, + 395, + 635 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 623, + 395, + 635 + ], + "spans": [ + { + "bbox": [ + 132, + 623, + 395, + 635 + ], + "type": "text", + "content": "4.3 Quantitative Performance on Visual Prognosis" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "The evaluation of the generated future X-ray images encompasses both quantitative and qualitative assessments. Quantitatively, we engage in analysis through" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 142, + 146, + 473, + 239 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 481, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 481, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 481, + 137 + ], + "type": "text", + "content": "Table 2: Comparison of KOA progression grading performance for different visual generation methods." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 142, + 146, + 473, + 239 + ], + "lines": [ + { + "bbox": [ + 142, + 146, + 473, + 239 + ], + "spans": [ + { + "bbox": [ + 142, + 146, + 473, + 239 + ], + "type": "table", + "html": "
MethodISProgression Grading Models - Accuracy (%)
VGG-16VGG-19ResNet-18ResNet-50DenseNet-121
Baseline Image Only-66.363.360.860.962.5
Cycle GAN [46]1.2862.564.360.361.263.6
I2I Diffusion Model2.0262.462.960.461.362.7
CXR-IRGen [36]1.7661.162.760.359.161.6
PITET GAN [4]1.6163.363.759.660.762.2
IC-RDN (ours)1.9866.865.161.161.764.4
", + "image_path": "274d771f4e71e2dcf2c6b681dedb1a11f2595752ed1282eea89b3f932a434eea.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 266, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 266, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 482, + 456 + ], + "type": "text", + "content": "the conventional generation task metrics, inception score and a downstream task: the prediction of KOA progression severity grade. For using the inception score in this study, we use the Inception-v3 network trained on the OAI 12-month visit X-ray dataset to replace the weights pre-trained on the ImageNet [10] as the knee X-ray images are different from the natural images at both category and structural level. As shown in Table 2, the X-ray images generated by our proposed IC-RDN illustrate a similar IS with the X-ray images generated by the image-to-image diffusion model and outperform the X-ray images generated by Cycle-GAN [46] and other SOTA generative models [4,36] significantly. As for the similar IS between the proposed IC-RDN and the image-to-image diffusion model, the results show similar performance on image quality and diversity. However, the images generated by the I2I diffusion model show a minor contribution to predicting the KOA progression severity grades, and the challenge of identity inconsistency remains in the generated X-ray images from the I2I diffusion model. The detailed comparison for identity consistency is shown on Sec. 4.5." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 460, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 579 + ], + "type": "text", + "content": "Although the inception score is able to show the quality and diversity of the generated future images, the downstream task of predicting the KOA progression severity grade can be more relevant to the value of how the generated future X-ray images contribute to exploring the KOA progression patterns. We have introduced the approach to predict KOA severity progression (Sec. 3.4), leveraging both the generated future X-ray image and the baseline X-ray image to determine a progression severity grade. In addition, as stated in Sec. 4.2, various CNN-based backbones are deployed in the generation-guided KOA progression prediction module. The comprehensive results among these backbone models are shown in Table. 2." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Specifically, the predicted 12-month progression X-ray images generated by Cycle GAN, the image-to-image diffusion model, the recent SOTA generative methods, and the proposed IC-RDN are used in the generation-guided KOA progression grade prediction module separately. Accuracy is used as the evaluation method to measure the performance of predicting the progression grades. Among all backbone models used in this module, predicting the progression severity grades using X-ray images from baseline visit and generated by the pro" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "posed IC-RDN shows significantly outperformed results. In detail, the image-to-image diffusion model shows a limited contribution to providing the multifaceted KOA progression patterns. And the Cycle GAN illustrates the minor ability to enhance the performance of predicting the KOA progression severity grades. Therefore, the quantity evaluation demonstrates the added value of incorporating generated future X-ray images in enhancing the accuracy of KOA progression severity grade predictions." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 151, + 230, + 284, + 338 + ], + "blocks": [ + { + "bbox": [ + 151, + 230, + 284, + 338 + ], + "lines": [ + { + "bbox": [ + 151, + 230, + 284, + 338 + ], + "spans": [ + { + "bbox": [ + 151, + 230, + 284, + 338 + ], + "type": "image", + "image_path": "a272938258bfc1479781119f159628290821878b3f97087aacbf8159458bea25.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 353, + 479, + 365 + ], + "lines": [ + { + "bbox": [ + 131, + 353, + 479, + 365 + ], + "spans": [ + { + "bbox": [ + 131, + 353, + 479, + 365 + ], + "type": "text", + "content": "Fig. 3: Illustration of t-SNE analysis between IC-RDN (ours) and I2I diffusion model." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 301, + 230, + 468, + 338 + ], + "blocks": [ + { + "bbox": [ + 301, + 230, + 468, + 338 + ], + "lines": [ + { + "bbox": [ + 301, + 230, + 468, + 338 + ], + "spans": [ + { + "bbox": [ + 301, + 230, + 468, + 338 + ], + "type": "image", + "image_path": "f697b1137b7aea3e817abb426bbf047b1a55b3b3e05e9c52f60fc51f7d3d7030.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 388, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 605 + ], + "type": "text", + "content": "To illustrate the performance of generated X-ray images contributing to predicting the KOA progression grades, the t-Distributed Stochastic Neighbor Embedding (t-SNE) technique, a sophisticated machine learning algorithm designed for the task of high-dimensional data visualization, is utilised in this study. In detail, to reduce the complex, multi-dimensional data into a two-dimensional space, t-SNE converts the high-dimensional distances between data points into conditional probabilities that represent similarities. Specifically, given a predicted X-ray image generated by the proposed IC-RDN, the trained VGG 19 network is used to produce a feature map corresponding to the KOA progression grade patterns. Then, these representations are visualised using t-SNE to show the related grades spatially. As shown in Fig. 3, the nodes with different colours indicate the corresponding grades. In Fig. 3.a, clear clusters for the KL grades of 0, 3, and 4 are located on the left and right sides. The green and yellow nodes referred to KL grades 1 and 2, show that the module for predicting the KOA progression severity grade has a minor ability to categorise these two classes, which is the challenge among different KOA progression prediction and severity grading methods [7,44]. However, in Fig. 3.b, the nodes for different grades are mixed and the cluster centres are hard to identify." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 621, + 388, + 634 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 621, + 388, + 634 + ], + "spans": [ + { + "bbox": [ + 131, + 621, + 388, + 634 + ], + "type": "text", + "content": "4.4 Qualitative Performance on Visual Prognosis" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "In terms of qualitative analysis, the comparison between X-ray images synthesized by the Cycle GAN and those produced by the proposed IC-RDN offers" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 123, + 476, + 244 + ], + "blocks": [ + { + "bbox": [ + 140, + 123, + 476, + 244 + ], + "lines": [ + { + "bbox": [ + 140, + 123, + 476, + 244 + ], + "spans": [ + { + "bbox": [ + 140, + 123, + 476, + 244 + ], + "type": "image", + "image_path": "4f1f5724383ec7204c7cade9f4075ad742003af3cc2a477cd50d669bab99563c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 257, + 480, + 280 + ], + "lines": [ + { + "bbox": [ + 132, + 257, + 480, + 280 + ], + "spans": [ + { + "bbox": [ + 132, + 257, + 480, + 280 + ], + "type": "text", + "content": "Fig. 4: Comparison of generated X-ray images from Cycle GAN [46] and our proposed IC-RDN on knee joints i-viii." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 141, + 293, + 473, + 466 + ], + "blocks": [ + { + "bbox": [ + 141, + 293, + 473, + 466 + ], + "lines": [ + { + "bbox": [ + 141, + 293, + 473, + 466 + ], + "spans": [ + { + "bbox": [ + 141, + 293, + 473, + 466 + ], + "type": "image", + "image_path": "f55f59e1b2f7fa92967ec747c61c7914919979bfa1208ed71f2ed0a7c878f0ee.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 475, + 482, + 510 + ], + "lines": [ + { + "bbox": [ + 130, + 475, + 482, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 475, + 482, + 510 + ], + "type": "text", + "content": "Fig. 5: Generative results from IC-RDN among different patients' joints from i to xxii. The detailed joint structure comparison between baseline visit images, ground truth and results from IC-RDN shows our model's ability to generate progression patterns." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 533, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 605 + ], + "type": "text", + "content": "a compelling visual assessment, as depicted in Fig. 4. The comparative study highlights notable distortions in bone structures emanating from the Cycle GAN approach, particularly in the articulation of joint spaces. In stark contrast, our proposed IC-RDN exhibits a pronounced fidelity in preserving the integrity of key bone edges and the intricacy of inner textures, thereby underscoring the superior capability of IC-RDN in maintaining structural information." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "Further elucidation is provided through an expanded corpus of X-ray images generated by the IC-RDN, which is shown in Fig. 5. This compilation serves not only to reinforce the initial observations regarding the preservation of critical structural details but also to demonstrate the consistent performance of the IC-RDN across a diverse set of examples. The consistent replication of complex" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "anatomical features by the IC-RDN model is indicative of its sophisticated understanding of underlying bone structures, which is paramount for illustrating the multifaceted KOA progression patterns." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 154, + 482, + 251 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 154, + 482, + 251 + ], + "spans": [ + { + "bbox": [ + 130, + 154, + 482, + 251 + ], + "type": "text", + "content": "Moreover, this comparison elucidates the inherent limitations of traditional GAN-based approaches in contexts where the preservation of exact structural features is paramount. The propensity for distortion within Cycle GAN-generated images can significantly impact the clinical utility of such synthesized X-ray images, particularly in monitoring the KOA progression. In contrast, the proposed IC-RDN shows its adeptness at capturing and reproducing the nuanced details of bone structure suggesting its potential as a multifaceted KOA progression prediction outcome." + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 140, + 277, + 468, + 385 + ], + "blocks": [ + { + "bbox": [ + 140, + 277, + 468, + 385 + ], + "lines": [ + { + "bbox": [ + 140, + 277, + 468, + 385 + ], + "spans": [ + { + "bbox": [ + 140, + 277, + 468, + 385 + ], + "type": "image", + "image_path": "4b037f89626a37ef16e99aaf55f9ec8f78425b41fca351fb41e896b76abe3b5d.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 398, + 482, + 444 + ], + "lines": [ + { + "bbox": [ + 130, + 398, + 482, + 444 + ], + "spans": [ + { + "bbox": [ + 130, + 398, + 482, + 444 + ], + "type": "text", + "content": "Fig. 6: Examples of generated X-ray images with identity consistency for joint i-x. The first line (outputs from the Image-to-Image Diffusion Model) shows the generative results without Identity Prior. The second line indicates the ground truth images. The third line refers to the results generated by our IC-RDN approach." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 494, + 326, + 506 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 494, + 326, + 506 + ], + "spans": [ + { + "bbox": [ + 132, + 494, + 326, + 506 + ], + "type": "text", + "content": "4.5 Analysis on Identity Consistency" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "To further evaluate the efficacy of the identity prior module, we delve into a comprehensive comparison involving the X-ray images generated by the I2I diffusion model and the proposed IC-RDN. The visual examples presented in Fig. 6 meticulously outline the distinctions between these methods alongside the actual 12-month visit X-ray images, where the key differences are highlighted by the bounding boxes. Initially, we observe the generated X-ray images devoid of identity persistency, which starkly contrasts with the subsequent imagery. A noteworthy observation is the preservation of identity features in the X-rays produced by our IC-RDN, as evidenced by the distinct texture and precision of bone edge structures. This preservation extends to intricate details within the knee joint, such as the orientation of the menisci and the nuanced protrusions along the bone edges, which are critical for maintaining identity persistency." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 448, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 238, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 238, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 238, + 129 + ], + "type": "text", + "content": "4.6 Ablation Study" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 134, + 482, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 134, + 482, + 194 + ], + "spans": [ + { + "bbox": [ + 130, + 134, + 482, + 194 + ], + "type": "text", + "content": "To better evaluate the contribution of the proposed Identity Prior module, an ablation study is conducted by removing the Identity Prior and only the Diffusion backbone remaining. The results in Table 3 demonstrate the effectiveness of the Identity Prior module with a superior longitude prediction accuracy among all selected classification methods." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 232, + 478, + 281 + ], + "blocks": [ + { + "bbox": [ + 203, + 212, + 411, + 224 + ], + "lines": [ + { + "bbox": [ + 203, + 212, + 411, + 224 + ], + "spans": [ + { + "bbox": [ + 203, + 212, + 411, + 224 + ], + "type": "text", + "content": "Table 3: Ablation study of the proposed IC-RDN" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 232, + 478, + 281 + ], + "lines": [ + { + "bbox": [ + 135, + 232, + 478, + 281 + ], + "spans": [ + { + "bbox": [ + 135, + 232, + 478, + 281 + ], + "type": "table", + "html": "
MethodISProgression Grading Models - Accuracy (%)
VGG16VGG19ResNet18ResNet50DenseNet121
IC-RDN w/o Identity Prior1.7261.661.760.261.062.5
IC-RDN (ours)1.9866.865.161.161.764.4
", + "image_path": "3d6ca2d20ae1c138a489f299358cb4a00b712a28a98b5467160bdd2211efce77.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 320, + 218, + 331 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 320, + 218, + 331 + ], + "spans": [ + { + "bbox": [ + 132, + 320, + 218, + 331 + ], + "type": "text", + "content": "4.7 Limitations" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 338, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 445 + ], + "type": "text", + "content": "The major limitation of this study regards the generation quality. Directly using X-ray scans generated by IC-RDN for a KOA severity grading showcases a suboptimal result compared with using the baseline visit X-ray to predict the KOA progression grade directly. Though the predicted 12-month scan can enhance the KOA severity prediction with using the baseline visit jointly. In addition, computer hallucinations [14] are a crucial issue among large model fields. Particularly, the analysis regarding the disease-specific changes is insufficient. Therefore, careful consideration of applying the generative method to actual clinical usage is needed." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 462, + 220, + 475 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 462, + 220, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 462, + 220, + 475 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 486, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 665 + ], + "type": "text", + "content": "In this study, a generative-based method, IC-RDN is proposed for KOA prognosis, which forecasts future X-ray scans for joints and singular progression KOA severity grades. This obtains multifaceted KOA progression patterns for understanding and explaining KOA prognosis. Specifically, an identity prior module for the diffusion and a downstream generation-guided progression prediction module are introduced for regularising and guiding the diffusion to focus more on the clinical nuances related to the prognosis and producing a more precise KOA severity progression grading. Extensive experiments on a widely used public dataset, OAI, demonstrate the effectiveness of the proposed method. In our future studies, the disentanglement of the representations related to the identity and KOA severity will be explored for fine-grained guidance in the X-ray image generation process. Meanwhile, the multimodal patterns among different medical imaging scans (e.g. X-ray, MRI, and CT) and patients' demographic information will be involved in producing a fine-grained KOA progression assessment outcome." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 482, + 209 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 482, + 209 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 482, + 209 + ], + "type": "text", + "content": "This study was partially supported by Australian Research Council (ARC) grant DP210102674. The OAI [25] is a public-private partnership comprised of five contracts (N01-AR-2-2258; N01-AR2-2259; N01-AR-2-2260; N01-AR-2-2261; N01-AR-2-2262) funded by the National Institutes of Health, a branch of the Department of Health and Human Services, and conducted by the OAI Study Investigators." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 224, + 197, + 236 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 197, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 197, + 236 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 245, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 138, + 245, + 480, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 245, + 480, + 289 + ], + "spans": [ + { + "bbox": [ + 138, + 245, + 480, + 289 + ], + "type": "text", + "content": "1. Almhdie-Imjabbar, A., Nguyen, K.L., Toumi, H., Jennane, R., Lespessailles, E.: Prediction of knee osteoarthritis progression using radiological descriptors obtained from bone texture analysis and siamese neural networks: data from OAI and most cohorts. Arthritis Research & Therapy 24(1), 1-13 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 289, + 480, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 289, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 289, + 480, + 331 + ], + "type": "text", + "content": "2. Antony, J., McGuinness, K., Moran, K., O'Connor, N.E.: Automatic detection of knee joints and quantification of knee osteoarthritis severity using convolutional neural networks. In: International Conference on Machine Learning and Data Mining. vol. 10358, pp. 376-390. Springer (2017)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 332, + 480, + 364 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 480, + 364 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 480, + 364 + ], + "type": "text", + "content": "3. Antony, J., McGuinness, K., O'Connor, N.E., Moran, K.: Quantifying radiographic knee osteoarthritis severity using deep convolutional neural networks. In: Int. Conf. Pattern Recog. pp. 1195-1200. IEEE (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 365, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 365, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 480, + 407 + ], + "type": "text", + "content": "4. Berman, O., Oz, N., Mendlovic, D., Sochen, N., Cohen, Y., Klapp, I.: PETITGAN: physically enhanced thermal image-translating generative adversarial network. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1607-1616 (2024)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 407, + 480, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 407, + 480, + 450 + ], + "spans": [ + { + "bbox": [ + 138, + 407, + 480, + 450 + ], + "type": "text", + "content": "5. Brahim, A., Jennane, R., Riad, R., Janvier, T., Khedher, L., Toumi, H., Lesspessailles, E.: A decision support tool for early detection of knee osteoarthritis using x-ray imaging and machine learning: data from the Osteoarthritis Initiative. Computerized Medical Imaging and Graphics 73, 11-18 (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 451, + 480, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 451, + 480, + 482 + ], + "spans": [ + { + "bbox": [ + 138, + 451, + 480, + 482 + ], + "type": "text", + "content": "6. Chan, L., Li, H., Chan, P., Wen, C.: A machine learning-based approach to decipher multi-etiology of knee osteoarthritis onset and deterioration. Osteoarthritis and Cartilage Open 3(1), 100135 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 483, + 480, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 483, + 480, + 514 + ], + "spans": [ + { + "bbox": [ + 138, + 483, + 480, + 514 + ], + "type": "text", + "content": "7. Chen, P., Gao, L., Shi, X., Allen, K., Yang, L.: Fully automatic knee osteoarthritis severity grading using deep neural networks with a novel ordinal loss. Comput. Med. Imag. Grap. 75, 84-92 (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 514, + 480, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 514, + 480, + 557 + ], + "spans": [ + { + "bbox": [ + 138, + 514, + 480, + 557 + ], + "type": "text", + "content": "8. Cheung, J.C.W., Tam, A.Y.C., Chan, L.C., Chan, P.K., Wen, C.: Superiority of multiple-joint space width over minimum-joint space width approach in the machine learning for radiographic severity and knee osteoarthritis progression. Biology 10(11), 1107 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 558, + 480, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 558, + 480, + 590 + ], + "spans": [ + { + "bbox": [ + 138, + 558, + 480, + 590 + ], + "type": "text", + "content": "9. Cui, A., Li, H., Wang, D., Zhong, J., Chen, Y., Lu, H.: Global, regional prevalence, incidence and risk factors of knee osteoarthritis in population-based studies. EClinicalMedicine 29 (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 590, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 590, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 134, + 590, + 480, + 621 + ], + "type": "text", + "content": "10. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: a large-scale hierarchical image database. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 622, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 622, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 622, + 480, + 665 + ], + "type": "text", + "content": "11. Górriz, M., Antony, J., McGuinness, K., Giró-i Nieto, X., O'Connor, N.E.: Assessing knee OA severity with CNN attention-based end-to-end architectures. In: International Conference on Medical Imaging with Deep Learning. pp. 197-214. PMLR (2019)" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 229, + 91, + 447, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "12. Guan, B., Liu, F., Mizaian, A.H., Demehri, S., Samsonov, A., Guermazi, A., Kijowski, R.: Deep learning approach to predict pain progression in knee osteoarthritis. Skeletal Radiology pp. 1-11 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 151, + 480, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 151, + 480, + 184 + ], + "spans": [ + { + "bbox": [ + 133, + 151, + 480, + 184 + ], + "type": "text", + "content": "13. Guermazi, A., Hunter, D.J., Roemer, F.W.: Plain radiography and magnetic resonance imaging diagnostics in osteoarthritis: validated staging and scoring. J. Bone Joint Surg. Am. 91(Supplement_1), 54-62 (2009)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 480, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 480, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 480, + 217 + ], + "type": "text", + "content": "14. Gunjal, A., Yin, J., Bas, E.: Detecting and preventing hallucinations in large vision language models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 18135-18143 (2024)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 218, + 480, + 261 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 218, + 480, + 261 + ], + "spans": [ + { + "bbox": [ + 132, + 218, + 480, + 261 + ], + "type": "text", + "content": "15. Hafezi-Nejad, N., Guermazi, A., Roemer, F.W., Hunter, D.J., Dam, E.B., Zikria, B., Kwoh, C.K., Demehri, S.: Prediction of medial tibiofemoral compartment joint space loss progression using volumetric cartilage measurements: data from the FNIH OA biomarkers consortium. European Radiology 27, 464-473 (2017)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 262, + 480, + 295 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 262, + 480, + 295 + ], + "spans": [ + { + "bbox": [ + 132, + 262, + 480, + 295 + ], + "type": "text", + "content": "16. Halilaj, E., Le, Y., Hicks, J.L., Hastie, T.J., Delp, S.L.: Modeling and predicting osteoarthritis progression: data from the Osteoarthritis Initiative. Osteoarthritis and Cartilage 26(12), 1643-1650 (2018)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 297, + 480, + 328 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 297, + 480, + 328 + ], + "spans": [ + { + "bbox": [ + 132, + 297, + 480, + 328 + ], + "type": "text", + "content": "17. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 330, + 480, + 384 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 330, + 480, + 384 + ], + "spans": [ + { + "bbox": [ + 132, + 330, + 480, + 384 + ], + "type": "text", + "content": "18. Hirvasniemi, J., Runhaar, J., van der Heijden, R., Zokaeinikoo, M., Yang, M., Li, X., Tan, J., Rajamohan, H., Zhou, Y., Deniz, C., et al.: The knee osteoarthritis prediction (KNOAP2020) challenge: An image analysis challenge to predict incident symptomatic radiographic knee osteoarthritis from MRI and x-ray images. Osteoarthritis and Cartilage 31(1), 115-125 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "type": "text", + "content": "19. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems 33, 6840-6851 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 408, + 480, + 440 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 480, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 480, + 440 + ], + "type": "text", + "content": "20. Hu, K., Wu, W., Li, W., Simic, M., Zomaya, A., Wang, Z.: Adversarial evolving neural network for longitudinal knee osteoarthritis prediction. IEEE Transactions on Medical Imaging 41(11), 3207-3217 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 441, + 480, + 474 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 441, + 480, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 441, + 480, + 474 + ], + "type": "text", + "content": "21. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 4700-4708 (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 475, + 480, + 507 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 480, + 507 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 480, + 507 + ], + "type": "text", + "content": "22. Jain, R.K., Sharma, P.K., Gaj, S., Sur, A., Ghosh, P.: Knee osteoarthritis severity prediction using an attentive multi-scale deep convolutional neural network. Multimedia Tools and Applications 83(3), 6925-6942 (2024)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 509, + 480, + 552 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 480, + 552 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 480, + 552 + ], + "type": "text", + "content": "23. Jamshidi, A., Pelletier, J.P., Labbe, A., Abram, F., Martel-Pelletier, J., Droit, A.: Machine learning-based individualized survival prediction model for total knee replacement in osteoarthritis: data from the Osteoarthritis Initiative. Arthritis Care & Research 73(10), 1518-1527 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 554, + 480, + 574 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 480, + 574 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 480, + 574 + ], + "type": "text", + "content": "24. Kellgren, J.H., Lawrence, J.: Radiological assessment of osteo-arthrosis. Annals of the Rheumatic Diseases 16(4), 494 (1957)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 576, + 480, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 576, + 480, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 576, + 480, + 597 + ], + "type": "text", + "content": "25. Lester, G.: Clinical research in OA-the NIH Osteoarthritis Initiative. J. Musculoskelet Neuronal Interact 8(4), 313-314 (2008)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 599, + 480, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 480, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 480, + 631 + ], + "type": "text", + "content": "26. Lindner, C., Thiagarajah, S., Wilkinson, J.: Fully automatic segmentation of the proximal femur using random forest regression voting. IEEE Trans. Med. Imaging 32, 1462-1472 (2013)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "text", + "content": "27. Nasser, Y., Hassouni, M.E., Jennane, R.: Discriminative deep neural network for predicting knee osteoarthritis in early stage. In: International Workshop on PRedictive Intelligence In MEdicine. pp. 126-136. Springer (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "28. Nguyen, H.H., Saarakkala, S., Blaschko, M.B., Tiulpin, A.: Semixup: in-and out-of-manifold regularization for deep semi-supervised knee osteoarthritis severity grading from plain radiographs. IEEE Trans. Med. Imaging 39(12), 4346-4356 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 149, + 482, + 181 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 149, + 482, + 181 + ], + "spans": [ + { + "bbox": [ + 130, + 149, + 482, + 181 + ], + "type": "text", + "content": "29. Ntakolia, C., Kokkotis, C., Moustakidis, S., Tsaopoulos, D.: Prediction of joint space narrowing progression in knee osteoarthritis patients. Diagnostics 11(2), 285 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 181, + 482, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 181, + 482, + 214 + ], + "spans": [ + { + "bbox": [ + 130, + 181, + 482, + 214 + ], + "type": "text", + "content": "30. Pierson, E., Cutler, D.M., Leskovec, J., Mullainathan, S., Obermeyer, Z.: An algorithmic approach to reducing unexplained pain disparities in underserved populations. Nature Medicine 27(1), 136-140 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 214, + 482, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 214, + 482, + 246 + ], + "spans": [ + { + "bbox": [ + 130, + 214, + 482, + 246 + ], + "type": "text", + "content": "31. Prezja, F., Annala, L., Kiiskinen, S., Ojala, T.: Exploring the efficacy of base data augmentation methods in deep learning-based radiograph classification of knee joint osteoarthritis. Algorithms 17(1), 8 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 246, + 482, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 246, + 482, + 278 + ], + "spans": [ + { + "bbox": [ + 130, + 246, + 482, + 278 + ], + "type": "text", + "content": "32. Ribas, L.C., Riad, R., Jennane, R., Bruno, O.M.: A complex network based approach for knee osteoarthritis detection: data from the Osteoarthritis Initiative. Biomedical Signal Processing and Control 71, 103133 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 278, + 482, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 482, + 311 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 482, + 311 + ], + "type": "text", + "content": "33. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 311, + 482, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 482, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 482, + 342 + ], + "type": "text", + "content": "34. Shamir, L., Ling, S.M., Scott, W., Hochberg, M., Ferrucci, L., Goldberg, I.G.: Early detection of radiographic knee osteoarthritis using computer-aided analysis. Osteoarthritis and Cartilage 17(10), 1307-1312 (2009)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 342, + 482, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 342, + 482, + 386 + ], + "spans": [ + { + "bbox": [ + 130, + 342, + 482, + 386 + ], + "type": "text", + "content": "35. Shamir, L., Ling, S.M., Scott, W.W., Bos, A., Orlov, N., Macura, T.J., Eckley, D.M., Ferrucci, L., Goldberg, I.G.: Knee x-ray image analysis method for automated detection of osteoarthritis. IEEE Transactions on Biomedical Engineering 56(2), 407-415 (2008)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 386, + 482, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 386, + 482, + 429 + ], + "spans": [ + { + "bbox": [ + 130, + 386, + 482, + 429 + ], + "type": "text", + "content": "36. Shentu, J., Al Moubayed, N.: Cxr-irgen: an integrated vision and language model for the generation of clinically accurate chest x-ray image-report pairs. In: 2024 IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 5200-5209 (2024)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 429, + 482, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 429, + 482, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 429, + 482, + 450 + ], + "type": "text", + "content": "37. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (2015)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 450, + 482, + 493 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 493 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 493 + ], + "type": "text", + "content": "38. Tiulpin, A., Klein, S., Bierma-Zeinstra, S.M., Thevenot, J., Rahtu, E., Meurs, J.v., Oei, E.H., Saarakkala, S.: Multimodal machine learning-based knee osteoarthritis progression prediction from plain radiographs and clinical data. Scientific Reports 9(1), 20038 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 493, + 482, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 493, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 493, + 482, + 525 + ], + "type": "text", + "content": "39. Tiulpin, A., Saarakkala, S.: Automatic grading of individual knee osteoarthritis features in plain radiographs using deep convolutional neural networks. Diagnostics 10(11), 932 (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 525, + 482, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 557 + ], + "type": "text", + "content": "40. Tiulpin, A., Thevenot, J., Rahtu, E., Lehenkari, P., Saarakkala, S.: Automatic knee osteoarthritis diagnosis from plain radiographs: a deep learning-based approach. Sci. Rep. 8(1), 1-10 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 557, + 482, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 590 + ], + "type": "text", + "content": "41. Tolpadi, A.A., Lee, J.J., Pedoia, V., Majumdar, S.: Deep learning predicts total knee replacement from magnetic resonance images. Scientific Reports 10(1), 6371 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 590, + 482, + 622 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 482, + 622 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 482, + 622 + ], + "type": "text", + "content": "42. von Tycowicz, C.: Towards shape-based knee osteoarthritis classification using graph convolutional networks. In: IEEE International Symposium on Biomedical Imaging. pp. 750-753. IEEE (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 622, + 482, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 622, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 622, + 482, + 665 + ], + "type": "text", + "content": "43. Widera, P., Weling, P.M., Ladel, C., Loughlin, J., Lafeber, F.P., Petit Dop, F., Larkin, J., Weinans, H., Mobasheri, A., Bacardit, J.: Multi-classifier prediction of knee osteoarthritis progression from incomplete imbalanced longitudinal data. Scientific Reports 10(1), 8427 (2020)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 230, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 230, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 230, + 91, + 447, + 102 + ], + "type": "text", + "content": "IC-RDN for Grading Knee Osteoarthritis Progression" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 226 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 160 + ], + "type": "text", + "content": "44. Wu, W., Hu, K., Yue, W., Li, W., Simic, M., Li, C., Xiang, W., Wang, Z.: Self-supervised multimodal fusion network for knee osteoarthritis severity grading. In: International Conference on Digital Image Computing: Techniques and Applications. pp. 57-64. IEEE (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "type": "text", + "content": "45. Zhang, B., Tan, J., Cho, K., Chang, G., Deniz, C.M.: Attention-based CNN for KL grade classification: data from the Osteoarthritis Initiative. In: International Symposium on Biomedical Imaging. pp. 731-735. IEEE (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "46. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 2223-2232 (2017)" + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "W. Wu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_content_list.json b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..aa3229d1698e1c50be5df93a2001b73c88706f15 --- /dev/null +++ b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_content_list.json @@ -0,0 +1,1776 @@ +[ + { + "type": "text", + "text": "Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization", + "text_level": 1, + "bbox": [ + 245, + 140, + 759, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Hongjing Niu, Hanting Li, Bin Li, and Feng Zhao", + "bbox": [ + 308, + 212, + 692, + 229 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition,", + "bbox": [ + 272, + 239, + 728, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "University of Science and Technology of China, Hefei, China", + "bbox": [ + 318, + 253, + 683, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{sasori,ab828658} $@$ mail.ustc.edu.cn", + "bbox": [ + 344, + 268, + 656, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{binli, fzhao956}@ustc.edu.cn", + "bbox": [ + 374, + 282, + 630, + 294 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Pre-training on large-scale datasets has become a fundamental method for training deep neural networks. Pre-training provides a better set of parameters than random initialization, which reduces the training cost of deep neural networks on the target task. In addition, pre-training also provides a large number of feature representations, which may help improve generalization capabilities. However, this potential advantage has not received enough attention and has been buried by rough fine-tuning. Based on some exploratory experiments, this paper rethinks the fine-tuning process and gives a new perspective on understanding fine-tuning. Moreover, this paper proposes some plug-and-play fine-tuning strategies as alternatives for simple fine-tuning. These fine-tuning strategies all preserve pre-trained features better by creating idling of some neurons, leading to better generalization.", + "bbox": [ + 259, + 335, + 743, + 501 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Fine-tuning $\\cdot$ Feature preserving $\\cdot$ Generalization", + "bbox": [ + 261, + 515, + 629, + 529 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 556, + 356, + 571 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Pre-training a model on a large dataset before transferring to a target task's training data improves performance (higher accuracy, lower time cost, easier optimization) over training from scratch [30,33]. In recent years, pre-trained models have been widely used in various tasks, including object recognition, object detection, and image segmentation [12]. Pre-training methods emerge in an endless stream, providing more material for the learning paradigm of pre-training + fine-tuning [39]. Furthermore, pre-training is costless in the sense that large-scale pre-trained parameters can be applied to a wide range of tasks and do not need to be specially designed for the target task. Pre-training has almost become an integral part of training deep neural networks.", + "bbox": [ + 212, + 588, + 787, + 724 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Compared with the research on pre-training, how to further adjust the parameters based on pre-training has received less attention. For classification, there are two mainstream approaches, (a) fine-tuning all the model parameters or (b) linear probing, which freezes the feature extractor and trains only the head. Intuitively, fine-tuning all network parameters can improve pre-trained features by adapting them to the specific task, while linear probing freezes these features. Therefore, prior work usually fine-tunes all", + "bbox": [ + 212, + 724, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author", + "bbox": [ + 220, + 825, + 367, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/dec03a35efa33a16e16840cb5465c4b28df44890574eb965f4d760d313b71668.jpg", + "image_caption": [ + "Fig. 1: An intuitive explanation of why CIFAR-10 rather than MNIST as downstream task can cause more feature distortion. The rounded rectangle represents the knowledge base of the model. Triangles, squares and circles represent the knowledge learned from ImageNet, MNIST and CIFAR-10 respectively." + ], + "image_footnote": [], + "bbox": [ + 330, + 151, + 671, + 328 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "network parameters to get better accuracy. Only when the data is insufficient or the pretraining task matches the target task well, linear probing is more likely to be selected. However, a more extensive range of tuning model parameters also tends to be accompanied by a more considerable degree of distortion to the pre-trained features. To some extent, such fine-tuning strategy turn the target task into the bed of Procrustes. Although the model performs well on the target task, more value that pre-trained features could have is cut off. For example, fine-tuned models tend to generalize poorly compared with linear probed models [17].", + "bbox": [ + 212, + 428, + 787, + 547 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A pre-trained deep neural network has rich feature representation thanks to the larger pre-training dataset. In addition to being the basis for the same pre-trained model to work on various target tasks, the rich feature representation makes it possible for the model to generalize better on the target task. However, the fine-tuning methods that are widely used today do not care about the distortion or destruction of these features and only pursue accuracy on target tasks. This paper proposes some better alternatives. While ensuring the accuracy of the target task, the proposed fine-tuning strategies also preserve the pre-training features as much as possible.", + "bbox": [ + 212, + 551, + 787, + 672 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "First of all, we want to answer such a question. When a model is fine-tuned on the target task, it is inevitable that pre-training knowledge will be forgotten. So what might the degree of the forgetting be related to? Let us start with a simple scenario. For two deep neural networks pre-trained on ImageNet [27], they are fine-tuned on CIFAR-10 [16] and MNIST [18], respectively. Now which of them can keep more memory about ImageNet? Some intuitive factors may be the domain difference between the pre-training task and the target task, the target task's difficulty, the model's scale, the amount of data of the target task, the training method, etc. Based on this idea, CIFAR-10 is more challenging, so a model trained on CIFAR-10 should have more abundant features. Also, the tasks of CIFAR-10 and ImageNet seem closer, so the correlation of features may also be higher.", + "bbox": [ + 212, + 674, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 392, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The answer may be somewhat unexpected. We found that models fine-tuned on CIFAR-10 forget far more than models fine-tuned on MNIST. This result is interesting and may be somewhat unexpected, but it is not difficult to understand from another perspective. Figure 1 provides an intuitive explanation of why more complex downstream tasks cause more feature distortion. Let us revisit the fine-tuning process from a dynamic perspective. Fine-tuning is a process of forgetting pre-trained knowledge while optimizing the target task. Therefore, the degree of forgetting is highly correlated with the distance to the target task. Moreover, other factors that can affect the degree of forgetting essentially affect this distance. A series of experiments are conducted to evaluate possible factors affecting the degree of forgetting, and the experimental results also support this hypothesis. Based on this hypothesis, this paper proposes alternative strategies for \"fine-tuning all at the same time\", including \"fine-tuning with an assistant\" and \"temporarily neuron inactivating\".", + "bbox": [ + 212, + 146, + 787, + 340 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The contributions of this paper can be summarized in the following points.", + "bbox": [ + 240, + 342, + 730, + 357 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- An interesting phenomenon about the fine-tuning process is discovered, which promotes a rethinking of the fine-tuning process. The new perspective on the fine-tuning process could be instructive for transfer learning.", + "- Some fine-tuning strategies are proposed, which better preserve pre-trained features and improve the generalization of deep neural networks. These strategies are plug-and-play and easy to generalize." + ], + "bbox": [ + 225, + 366, + 782, + 454 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 477, + 366, + 493 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Transfer learning aims at improving the performance on the target domain by transferring knowledge contained in related source domains, and has become a popular and promising area in machine learning [33, 39]. The discussion in this paper is based on a simple transfer learning paradigm, where a model pre-trained on a larger dataset is fine-tuned on the target dataset. In computer vision, pre-training deep neural networks with ImageNet [27] is undoubtedly one of the most widespread applications of transfer learning [12]. In recent years, some new methods have been applied to pretraining [3, 5, 9, 11]. The pre-trained model has lower cost and better feature representation through self-supervision and other methods. Besides pre-training, there are also works [10, 30, 33] focused on downstream training to improve transferability through eliminating domain shifts between upstream and downstream datasets. DELTA [21], a regularized transfer learning framework using feature map with attention, is proposed to reduce the dependence on downstream datasets. Co-Tuning [36] proposed a two-step framework, which reduces the requirements of large amount of data while fully fine-tuning the model.", + "bbox": [ + 212, + 507, + 787, + 734 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Parameter-efficient tuning has received more attention along with the popularization of large-scale models. Compared with tuning all parameters, tuning a small number of parameters can greatly reduce the calculation and storage costs. Much work has been done on fine-tuning language models. Delta-tuning [8] roughly divides these methods into three groups: addition-based [13, 29], specification-based [19, 37], and reparameterization-based methods [1, 14]. For vision models, RepNet [34] exploits a dedicated designed side network. And Conv-Adapter [4] utilized an adapter for the", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 339, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "transfer learning of ConvNets. We differentiate our research and Parameter-efficient tuning (PET) here. First, in terms of motivation, the focus of PET lies in improving efficiency and reducing data dependency. Our intention is to fully leverage pre-training features to enhance generalization capabilities. Secondly, in terms of methodology, most PET approaches adjust only a portion (usually a small portion) of the model's parameters instead of all of them. While our method temporarily fixes a subset of parameters, it does not mean that they are completely unadjusted. For instance, in our approach, Linear Parameterized Filters (LPF) first adjust the linear layers and then the feature layers. Feature preserving is an important topic in transfer learning. While better-preserved features may not significantly improve performance on the target task, it does improve generalization [17]. A straightforward idea is to introduce a regularization term. By adding some kind of regularization loss between the pre-trained model and the fine-tuned model, the model changes as little as possible after fine-tuning. Such regularization can be applied to model parameters [22] as well as the output of hidden layers [21]. Selectively tuning parameters is also a viable strategy. For example, different weights can be assigned according to the depth of each layer of a deep neural network [35]. A more refined approach is to use meta-learning to learn which features are more worth keeping [15]. In general, most of these studies focus on selecting and preserving features that are more helpful to the target task. On the one hand, improving the performance on the target task is very meaningful. On the other hand, features that do not seem to help the target task are also likely to be worth saving because they may lead to better generalization, which will be discussed further.", + "bbox": [ + 217, + 146, + 785, + 477 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Catastrophic forgetting in continual learning also discusses the preservation of already learned features during learning [2]. Solutions to catastrophic forgetting can be roughly divided into self-refreshing memory approaches [28], knowledge distillation [23] and transfer techniques [20]. These methods may have a good reference for the fine-tuning process. But it should be noted that there are differences between the two settings. In continual learning, each dataset has equal importance. The model must maintain performance on the original data while learning new data. In transfer learning, the model only needs to pursue the performance on the target task, and it is no longer necessary to consider the pre-training task. Continual learning requires higher consistency between tasks, which makes it far less applicable than transfer learning.", + "bbox": [ + 217, + 483, + 785, + 633 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 217, + 680, + 357, + 696 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this work, we wish to study the distortion of the pre-trained features during the fine-tuning process of deep neural networks. More specifically, we divide a deep neural network into two parts, a feature extractor and a classification head (usually the last linear layer). The research is about how to prevent the feature extractor from being distorted during the fine-tuning, and the classification head is used for evaluating the extracted features. In this section, we will introduce: how to measure the degree of distortion of features and how to reduce this distortion when fine-tuning.", + "bbox": [ + 217, + 734, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 116, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 390, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/912b29cca3def34f7061ce140642b494868ddbd9b5f8e5b172be97370670e022.jpg", + "image_caption": [ + "(a) Pre-training" + ], + "image_footnote": [], + "bbox": [ + 233, + 143, + 370, + 244 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/791b17962acd823035f0f86544cd46132b4c36f482b7f22bf25e860950e66a9e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 370, + 143, + 504, + 244 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/68829bce403f10a63daa7257ec5cec5d73a6c03626cb75f186e1dad330da97d8.jpg", + "image_caption": [ + "(c) Linear probing first" + ], + "image_footnote": [], + "bbox": [ + 504, + 143, + 767, + 244 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/f497d14c1abf817db0791cdd9d5d54edb5b026a6c6bd5c4576f2785a3a35069a.jpg", + "image_caption": [ + "(d) Fine-tuning all", + "Fig. 2: A visual demonstration of the proposed strategies. We use a simple three-layer structure to represent the deep neural network, and the feedforward process of the neural network is from the bottom to the top. The black connecting lines represent the pre-trained parameters, and the blue dashed connecting lines represent the modified parameters." + ], + "image_footnote": [], + "bbox": [ + 233, + 260, + 369, + 366 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/37d708f8948c9f704883af0571503bf76851467670e04a68b1e2dcff78418c76.jpg", + "image_caption": [ + "(b) Linear probing", + "(e) Temp. neuron inactivating" + ], + "image_footnote": [], + "bbox": [ + 370, + 258, + 504, + 359 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/f41f8963e64d857821e9afc79fb148a75c6791062106aca237e79977063deb8f.jpg", + "image_caption": [ + "(f) Fine-tuning with an assistant" + ], + "image_footnote": [], + "bbox": [ + 504, + 260, + 767, + 366 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Measurement of Feature Distortion", + "text_level": 1, + "bbox": [ + 214, + 474, + 503, + 488 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We set the scene as fine-tuning for an image classification task. Pre-training dataset $\\mathbb{D}_p$ consists of image-label pairs $X_{p},Y_{p}$", + "bbox": [ + 212, + 497, + 784, + 527 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A naive perception about deep neural networks is that the first few layers are a feature extractor $\\mathcal{F}$ that looks for a set of features, while the latter layers are a predictor $\\mathcal{P}$ that uses those features to perform classification tasks.", + "bbox": [ + 212, + 527, + 784, + 571 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Based on this understanding, we connect a feature extractor $\\mathcal{F}$ to a randomly initialized predictors $\\mathcal{P}$ , and adjust $\\mathcal{P}$ to maximize the accuracy of the model $\\mathcal{P} \\circ \\mathcal{F}$ on $\\mathbb{D}$ . The effectiveness of a feature extractor $\\mathcal{F}$ for a dataset $\\mathbb{D}$ can be expressed by the following formula.", + "bbox": [ + 212, + 571, + 785, + 633 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathscr {E} (\\mathcal {F}, \\mathbb {D}) = A c c u r a c y \\left(\\mathcal {P} ^ {\\Phi^ {*}} \\circ \\mathcal {F} (\\mathbb {D})\\right), \\Phi^ {*} = \\underset {\\Phi} {\\arg \\min } L o s s \\left(\\mathcal {P} ^ {\\Phi} \\circ \\mathcal {F} (\\mathbb {D})\\right). \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 261, + 640, + 785, + 667 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The parameters of $\\mathcal{P}$ is represented with $\\varPhi$ , and we use $\\varPsi$ to represent parameters of $\\mathcal{F}$ .", + "bbox": [ + 214, + 672, + 784, + 688 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Of course, the fully connected neural network may not be able to fully express the information about decision-making contained in the feature extractor, which will lead to the fact that the effective information $MI(\\mathcal{F}(X), Y)$ retained in the feature extractor is larger ( $MI$ stands for mutual information, and $X, Y$ is the input and ground-truth from $\\mathbb{D}$ ). However, the difficulty of extracting effective information should also be used for the evaluation of feature extractors. Therefore, in the case of the same predictor, effectiveness $\\mathcal{E}$ is a fair and reasonable indicator for evaluating the performance of feature extractors.", + "bbox": [ + 212, + 689, + 785, + 808 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "By comparing the effectiveness of feature extractors before $(\\mathcal{F}_0)$ and after $(\\mathcal{F}^*)$ fine-tuning on the pre-trained dataset, the distortion of fine-tuning to pre-trained features,", + "bbox": [ + 214, + 809, + 785, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 338, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1 Pre-training and fine-tuning" + ], + "code_body": "Input: Pre-training dataset $\\mathbb{D}_p$ , fine-tuning dataset $\\mathbb{D}_d$ \nParameter: $\\varPsi$ $\\varPhi$ (parameters of $\\mathcal{F}$ and $\\mathcal{P}$ \nOutput: $\\varPsi^{*},\\varPhi^{*}$ \nInitialize: $\\varPsi,\\varPhi=\\varPsi_0,\\varPhi_0$ \nPre-train: $\\varPsi_p,\\varPhi_p=\\arg\\min_{\\varPsi,\\varPhi}Loss(\\mathcal{P}\\circ\\mathcal{F}(\\mathbb{D}_p))$ \nLoad parameters: $\\varPsi=\\varPsi_p$ \nFine-tune: $\\varPsi^{*},\\varPhi^{*}=\\arg\\min_{\\varPsi,\\varPhi}Loss(\\mathcal{P}\\circ\\mathcal{F}(\\mathbb{D}_d))$", + "bbox": [ + 215, + 162, + 537, + 277 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "denoted as $\\mathcal{D}$ , can be measured. Note that a denominator of zero indicates that the original feature extractor is completely invalid and therefore not relevant for discussion.", + "bbox": [ + 212, + 313, + 782, + 345 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {D} = 1 - \\frac {\\mathcal {E} \\left(\\mathcal {F} ^ {*} , \\mathbb {D}\\right)}{\\mathcal {E} \\left(\\mathcal {F} _ {0} , \\mathbb {D}\\right)}, \\mathcal {E} \\left(\\mathcal {F} _ {0}, \\mathbb {D}\\right) \\neq 0. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 379, + 354, + 785, + 388 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Feature-preserving Fine-tuning", + "text_level": 1, + "bbox": [ + 215, + 412, + 477, + 428 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "A method for measuring feature distortion is given above. In this section, some fine-tuning strategies are given. Figure 2 provides a visual demonstration of the proposed strategies. These strategies should minimize the degree of feature distortion while ensuring the performance of downstream tasks.", + "bbox": [ + 212, + 440, + 784, + 500 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We denote the dataset for downstream tasks by $\\mathbb{D}_d$ . A complete pre-training and fine-tuning paradigm can be expressed as shown in Alg. 1. The methods proposed below are all different implementations of the fine-tuning step.", + "bbox": [ + 212, + 501, + 785, + 546 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Linear Probing First (LPF). An intuitive method is to do linear probing first [17]. First, freeze the feature extractor $\\mathcal{F}$ and only fine-tune the predictor $\\mathcal{P}$ , and then adjust $\\mathcal{F}$ and $\\mathcal{P}$ at the same time. Through linear probing, the predictor and the pre-trained feature extractor can be somewhat well matched, reducing the feature extractor's optimization cost, thereby shortening the optimization process.", + "bbox": [ + 214, + 547, + 785, + 622 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Temporarily Neuron Inactivating (TNI). We note that during the fine-tuning of the neural network, all neurons are continuously adjusted to fit the target task, which may be unnecessary. Just tweaking some neurons might well fit the task. The adjustment that occurs in other neurons may simply be because this part of the neuron has not completed the adjustment. To improve this, we propose a strategy called temporarily neuron inactivating.", + "bbox": [ + 214, + 623, + 785, + 713 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Specifically, a smaller fraction of the gradients used to update the model parameters is zeroed out. Thus, neurons that do not need much adjustment are left intact, while other neurons make adjustments to suit the target task. We recommend computing the mean $(\\mu)$ and standard deviation $(\\sigma)$ of the gradients $(G)$ for each layer in one iteration and then zeroing the fraction of gradients closest to the mean,", + "bbox": [ + 212, + 714, + 785, + 789 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nG = \\left\\{ \\begin{array}{l l} 0, & i f \\quad G - \\| G - \\mu \\| _ {1} \\leq \\delta \\sigma ; \\\\ G, & i f \\quad G - \\| G - \\mu \\| _ {1} > \\delta \\sigma . \\end{array} \\right. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 801, + 785, + 844 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 392, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "$\\delta$ is a hyperparameter, and a larger $\\delta$ means that more parameters will not be updated.", + "bbox": [ + 215, + 146, + 774, + 160 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "This method of choosing the parameters to be fixed is not unique. Following the same strategy, we can adjust the method with a fixed ratio or other designs. How many parameters are fixed each time and how they are chosen remains to be further explored.", + "bbox": [ + 215, + 162, + 784, + 205 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Fine-tuning with an Assistant (AST). In addition to partially adjusting the parameters, another idea is to reduce the overall variation of the parameters. A possible approach is to use a replicated model as an assistant. First, replicate a pre-trained model as an assistant, then the feature extractors of the two models are connected in parallel, and the predictors share parameters. The parameters of the replica are frozen. The two models are trained alternately (the odd-numbered epochs train the assistant, and the even-numbered epochs train the original model). Keeping an assistant means the predictor will try to apply the pre-trained features directly to the target task. With the help of the assistant, the feature extractor can adapt to the target task with smaller changes. In a way, it can be seen as a dynamic version of linear probing first. Both of them reduce the distortion of the feature extractor with a suitable predictor.", + "bbox": [ + 215, + 207, + 785, + 371 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 393, + 354, + 411 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 Setup", + "text_level": 1, + "bbox": [ + 215, + 424, + 295, + 439 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Evaluation methods. The experiment involves pretraining tasks and downstream tasks. The basic purpose of the experiment is to evaluate: (1) The extent to which pre-trained features are distorted after fine-tuning on downstream tasks; (2) the generalization performance of the fine-tuned model on downstream tasks. Therefore, we evaluate the distortion of pre-trained features (Eq. 2). Since the pre-training task remains unchanged in a experiment, only $\\mathcal{E}(\\mathcal{F}^*,\\mathbb{D})$ , i.e., the accuracy on the pre-training dataset after linear probing is calculated. For the generalization performance on downstream tasks, generalization datasets for the downstream tasks are used.", + "bbox": [ + 215, + 446, + 785, + 566 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Datasets. All the datasets we use are open source datasets, including ImageNet [27], MNIST [18], CIFAR-10 [16], CIFAR-100 [16], CIFAR-10.1 [26], STL-10 [7] and CUB-200-2011 [31]. Among them, ImageNet is a large-scale image dataset with more than 1 million images in 1000 categories and is widely used as a pre-training dataset. CIFAR-10 is a lightweight image classification dataset that contains a total of 60,000 images of small size $(32\\times 32)$ in 10 categories. For the experiments in Figure 3a, we preferentially select classes with smaller CIFAR-10 class numbers when sampling partial classes. CIFAR-100 is similar to CIFAR-10 but with 100 classes, while the total number of samples remains at 60,000. For the experiments in Table 1, we selected subclasses of CIFAR-100 to constitute the dataset. Specifically, we take two superclasses each time to form a 10-class classification task. The data for the target task comes from \"flowers\" and \"fruit and vegetables\", while the data for the generalization task are from \"vehicles1\" and \"vehicles2\". CIFAR-10.1 provides a new test set for CIFAR-10. We use it for testing to measure the generalization of the CIFAR-10 model. STL-10 contains more than 10,000 images in 10 categories similar to CIFAR-10. So we use it as a generalization task with more considerable domain differences.", + "bbox": [ + 215, + 568, + 785, + 808 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Implementation details. We use ResNet-18 for experiments in Section 4.2, and Swin-Transformer-Tiny [24] for Table 5. For rest of the experiments, we use ResNet-50", + "bbox": [ + 215, + 809, + 785, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 339, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 125 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/4058ee524178c5218e125d7dc0de6e14807b268d4c386648117963e3c604098b.jpg", + "image_caption": [], + "image_footnote": [ + "(a) The extent of preservation of pre-trained features is in- (b) We are aware that as the target task involves distinguish- fluenced by the difficulty of the target task. As the target task ing an increasing number of categories of CIFAR-10 sambecomes increasingly challenging in distinguishing more ples, the number of samples used for fine-tuning also incategories of CIFAR-10 samples, models pre-trained on Im- creases. Therefore, we uniformly sample a certain proportageNet (green) become more difficult to maintain good per tion of samples from each category as a control. The impact formance on ImageNet after fine-tuning on the target task. of different sample quantities has noticeably decreased comIn contrast, models initialized with random weights (blue) pared to different task complexities (a). Both the downward achieve better performance on ImageNet after training on trend of the green line and the upward trend of the blue line the target task. have smaller amplitudes." + ], + "bbox": [ + 233, + 157, + 480, + 282 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/00a5f33989c08d595407d38d011ee00bae05002a3b3c51b2dff862b8ee01bee0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 509, + 157, + 751, + 282 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "as the backbone model for the experiments. We use the version provided by PyTorch, and the pre-training parameters of ImageNet are also from PyTorch. Except that the output shape of the \"FC\" layer may be modified according to the task, other structures remain unchanged. Without special instructions, we use SGD as the optimizer (learning rate 1e-2, momentum 0.9, weight decay 1e-5), the batch size is 16 for ImageNet and 128 for other datasets, and all training is performed for 100 epochs, For the strategy using LPF, Linear probing is performed for 10 epochs, which means that the remaining fine-tuning is performed for 90 epochs. For the fine-tuning with an assistant strategy, half of the epochs are used for the assistant. For the Temporarily Neuron Inactivating strategy, we compute the mean and standard deviation of the gradients of the same layer in each update and zero out the gradients whose difference from the mean is less than the standard deviation. According to our observations, each experiment trains to convergence, and the best-performing model is taken. The code will be open-sourced.", + "bbox": [ + 212, + 409, + 787, + 606 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Distortion of Features", + "text_level": 1, + "bbox": [ + 215, + 630, + 410, + 645 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "First, we observe the distortion of pre-trained features during model fine-tuning through a set of experiments.", + "bbox": [ + 212, + 657, + 785, + 686 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We previously introduced a toy example to observe the degree of feature forgetting after ImageNet pre-trained models are fine-tuned on CIFAR-10 and MNIST. We extend this experiment to verify the relationship between the degree of feature forgetting in fine-tuning and the target task.", + "bbox": [ + 212, + 688, + 785, + 748 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We use different subsets of CIFAR-10 as the fine-tuning datasets and test how much the fine-tuned models retain pre-trained features. Models without pre-training are used in the same process as controls. The results are shown in Figure 3a", + "bbox": [ + 212, + 750, + 785, + 794 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The results show that as the target task contains more categories, the accuracy of the control group increases, which means that the model does learn more features. The performance of the experimental group shows an opposite trend to that of the control", + "bbox": [ + 212, + 795, + 785, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 392, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "group, which means that when other conditions remain unchanged, the more features to be learned, the more severe the distortion of the pre-trained features.", + "bbox": [ + 215, + 146, + 784, + 176 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We also test the effect of sample size on the results (Figure 3b). The training set is obtained by uniformly sampling from each class. In this way, the distribution is kept unchanged, and the dataset size is reduced. It can be seen that simply changing the size of the training set has little effect on the experimental results. Combining Figure 3a and Figure 3b, it can be concluded that there is a positive correlation between the amount of target features and the distortion of the pre-trained features. The experimental results are consistent with what we observed in the toy experiments. Moreover, after excluding other interfering factors, the principle behind this phenomenon is also more evident. An extreme example might make the process easier to understand. If the training task is empty, neither the common features nor the different features exist. The model does not need to be adjusted, and the pre-trained features are perfectly preserved.", + "bbox": [ + 215, + 178, + 787, + 343 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 Preserving Features", + "text_level": 1, + "bbox": [ + 215, + 372, + 395, + 386 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To verify the effect of the proposed feature-preserving fine-tuning method. We pre-train the model on CIFAR-10, fine-tune it on a subset of CIFAR-100 (Target), and verify feature retention again on CIFAR-10. ImageNet is no longer used in this experiment because CIFAR-10 and CIFAR-100 avoid differences unrelated to image content, such as image size; CIFAR-10 has fewer effective features than ImageNet, which makes feature distortion easier to observe. We also test with linear probing on another subset of CIFAR-100 (Unseen), verifying that the retained features are indeed valuable. The results are shown in Table 1.", + "bbox": [ + 215, + 402, + 787, + 521 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/beae806b8e433af0494e0ba2490d4accfff93141eb73917f446c91e4a6b707ce.jpg", + "table_caption": [ + "Table 1: Preservation of pre-trained features by several strategies. The $\\sqrt{}$ indicated that the strategy was adopted. Pre-train represents the dataset used for pre-training, and the results intuitively reflect the retention of features. Unseen represents a dataset that has not been seen in pre-training and fine-tuning stages, and its results reflect generalization ability." + ], + "table_footnote": [], + "table_body": "
StrategiesTesting accuracy (%)
ASTLPFTNITargetPre-trainUnseen
56.44±1.2349.58±0.0743.78±0.23
✓57.14±1.0854.13±0.0647.20±0.17
✓57.36±0.4149.98±0.0846.00±0.19
✓57.92±1.3753.68±0.0845.98±0.45
✓✓56.50±0.9659.30±0.0951.62±0.26
✓✓58.26±0.7454.30±0.0748.02±0.33
✓✓59.40±0.8258.69±0.0649.46±0.39
✓✓✓57.65±0.6958.14±0.1051.30±0.31
", + "bbox": [ + 339, + 617, + 660, + 779 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Based on the results in Table 1, the following observations can be made.", + "bbox": [ + 240, + 824, + 712, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 339, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- The three strategies tested have better performance on pre-train testing sets, and some strategy combinations can achieve better results. This shows that the proposed strategies are all beneficial for preserving task-related features.", + "- The three strategies tested have better performance on unseen testing sets. This means that the saved features are not only useful for pre-training tasks or target tasks but may also be helpful for some unseen tasks.", + "- The performance ranking of the strategies on the two test sets shows a high degree of consistency, indicating that saving more pre-trained features positively affects the generalization ability of the learned features." + ], + "bbox": [ + 225, + 146, + 785, + 282 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "It can be seen that compared with fine-tuning of all parameters, a suitable strategy can make the model retain more features. It should be noted that the above methods will not lose the accuracy of the target task itself. In fact, the accuracy of the target task is higher in most cases.", + "bbox": [ + 212, + 295, + 782, + 354 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "It is necessary to remind that in the fine-tuning paradigm, preserving pre-training features is not a hard requirement. However, keeping the pre-trained features may lead to better generalization performance, which is very meaningful. Therefore, in the experiments in Table 1, the performance of the model on the unseen testing set is more practical.", + "bbox": [ + 212, + 357, + 784, + 431 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We conduct t-SNE [25] on the output of the feature extractor to observe the distortion of pre-trained features visually. Figure 4 shows the results of feature dimensionality reduction under four settings, pre-training, fine-tuning all parameters, TNI, and AST + TNI. The experiment is completed under the settings of Table 1, and the features under the three strategies are the output of the feature extractor.", + "bbox": [ + 212, + 433, + 785, + 507 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/29fc1658f04954fcf54dd2cc579cf65174679fca83f31665112fc9e9b6f49a1b.jpg", + "table_caption": [ + "Table 2: Generalizability under several strategies. Models are pre-trained on CIFAR-10 and fine-tuned on CIFAR-100. We measure the generalization ability of several strategies by observing model performance on different testing sets." + ], + "table_footnote": [], + "table_body": "
StrategiesTesting accuracy (%)
ASTLPFTNICIFAR-10CIFAR-10.1
51.85±0.0740.52±0.25 44.28±0.14
✓54.61±0.1241.50±0.11 45.81±0.13
✓56.54±0.0442.95±0.13 47.27±0.16
✓52.54±0.1141.25±0.13 45.01±0.14
✓✓56.85±0.0644.06±0.16 47.27±0.12
✓✓57.03±0.3444.76±0.12 47.59±0.16
✓✓60.04±0.0547.16±0.05 48.62±0.22
✓✓✓58.05±0.0445.50±0.13 47.50±0.17
", + "bbox": [ + 338, + 590, + 661, + 752 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "It can be seen that there are clear boundaries between the feature classes extracted by the pre-trained model. After fine-tuning, the boundaries between classes become blurred. This situation is improved when fine-tuning strategies such as TNI are used.", + "bbox": [ + 212, + 794, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 390, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/99390423ac88c910b948af8abcf64a33d88e5484d4f2abb17608587962d6ce1a.jpg", + "image_caption": [ + "(a) Pre-training" + ], + "image_footnote": [], + "bbox": [ + 290, + 143, + 498, + 305 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/0b16fb8538d2682890f24ca0a44396fdb233b08c42aa6c56c64cbb4cd259368e.jpg", + "image_caption": [ + "(b) Fine-tune all" + ], + "image_footnote": [], + "bbox": [ + 501, + 143, + 714, + 306 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/3b02fcb40e70332c0700c9934fcf6096dfee13ddb07acd6693b6c09d35d3fc7b.jpg", + "image_caption": [ + "(c) TNI" + ], + "image_footnote": [], + "bbox": [ + 290, + 325, + 496, + 481 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/da6dff0e524202bdcc2cd72562d852e04dd990c1f0b34c3011160bf27f078e5e.jpg", + "image_caption": [ + "(d) AST + TNI", + "Fig. 4: t-SNE results on CIFAR-10. Dimensionality reduction is performed on the output of the feature extractor obtained by several different fine-tuning strategies. The colors in the figure represent the categories of the samples. It can be seen that after fine-tuning, the cluster boundaries of each category become much blurred. The tsne results corresponding to the strategies with better results in Table 1 are also more discriminative." + ], + "image_footnote": [], + "bbox": [ + 501, + 321, + 712, + 484 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "When using the combination of AST+TNI strategy, the distribution of features is very close to the result after only pre-training. Even the best t-SNE results are significantly different from those before fine-tuning. This is reasonable because the results shown in Table 1 show that the current optimal strategy is only $59.3\\%$ accurate on CIFAR-10, while the accuracy of the model before fine-tuning can exceed $90\\%$ .", + "bbox": [ + 212, + 611, + 787, + 686 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.4 Downstream Classification", + "text_level": 1, + "bbox": [ + 214, + 715, + 442, + 729 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We apply the method to more challenging fine-grained classification tasks to test the performance of our tuning strategies on downstream classification tasks. Table 3 shows the performance of our approaches and other transfer learning methods on CUB-200-2011, a widely used fine-grained classification dataset. It can be seen that for all the tested sampling rates, the proposed strategies can achieve comparable or even better performance. Using the proposed strategies for tuning will not damage the performance", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 339, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "on downstream classification tasks, which is consistent with the conclusions drawn in previous experiments.", + "bbox": [ + 212, + 146, + 787, + 176 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/80846873b2c7c1214e4fdafec6518b1043180fff4c5d98847a720851bea273f4.jpg", + "table_caption": [ + "Table 3: Accuracy on CUB-200-2011. The best results are in bold faces. † results are from [36]." + ], + "table_footnote": [], + "table_body": "
MethodSampling Rates
15%30%50%100%
FT†45.2559.6870.1278.01
AST45.5158.1169.8377.42
LPF45.7062.4270.5679.63
TNI46.3862.0371.1679.25
L2SP† [22]45.0857.7869.4778.44
DELTA† [21]46.8360.3771.3878.63
BSS† [6]47.7463.3872.5678.85
CoTuning† [36]52.5866.4774.6481.24
", + "bbox": [ + 372, + 229, + 625, + 391 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Generalization", + "text_level": 1, + "bbox": [ + 215, + 452, + 361, + 467 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "From the previous experiment, it can be seen that several of the proposed fine-tuning strategies are better than fine-tuning all parameters directly. Moreover, several strategies can be nested for better results.", + "bbox": [ + 212, + 477, + 785, + 521 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Following the previous experimental procedure, we use CIFAR-10 as the pre-train task and CIFAR-100 as the target task. In addition to performance on the target task, we further test two other testing sets to evaluate the value of these strategies for generalization. For STL-10, we performed linear probing, and for CIFAR10.1, we did not perform additional operations since the training set is the same. The results are shown in Table 2.", + "bbox": [ + 212, + 523, + 785, + 611 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The following observations can be made based on the results in Table 1. Models that better preserve pre-trained features also have better generalization performance. Moreover, the generalization improvement does not necessarily require extremely high similarity between distributions. The strategies in this paper are all plug-and-play and hardly introduce additional training costs but significantly improve the generalization performance of the model. Preserving the features of the pre-trained model as much as possible is a relatively novel way to improve the generalization of deep neural networks.", + "bbox": [ + 212, + 613, + 785, + 719 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.6 Broader Application Scenarios", + "text_level": 1, + "bbox": [ + 215, + 739, + 472, + 755 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Although supervised learning on ImageNet is the most widely used pre-training method, many other valuable pre-training methods are also available. Estimated from the design idea, the proposed fine-tuning strategies proposed in this paper should apply to various pre-trained models. In addition to supervised learning, we use the SwAV [3] as a pretraining method and repeat the previous experiments. SwAV is a simple and efficient", + "bbox": [ + 212, + 763, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 392, + 128 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "self-supervised learning method that realizes feature learning through comparison and clustering.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/c666999105268b7c49a5babc520181674c22ba69cf294c4e193781e7bb2606c0.jpg", + "table_caption": [ + "Table 4: The performance of the proposed strategies with SwAV pre-trained parameters. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10." + ], + "table_footnote": [], + "table_body": "
StrategiesTesting set (%)
AST LPF TNISelf-supervised
79.29±1.31
✓79.74±1.04
✓81.39±0.95
✓80.86±0.69
✓✓79.66±1.57
✓81.55±0.98
✓✓81.68±1.59
✓✓81.56±0.76
", + "bbox": [ + 246, + 272, + 441, + 435 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/8f5bc102a10adab321dc499a7fbd2395bd4444167602cdb676a3a33eb1c74efc.jpg", + "table_caption": [ + "Table 5: The performance of the proposed strategies on Swin-Transformer. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10." + ], + "table_footnote": [], + "table_body": "
StrategiesTesting set (%)
ASTLPF TNISwin-T
79.23±0.73
✓79.67±0.86
✓80.98±1.09
79.84±1.64
✓✓81.14±1.15
✓82.29±1.72
✓82.05±0.91
✓✓82.04±1.22
", + "bbox": [ + 560, + 272, + 750, + 434 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We conduct experiments on the popular Swin-Transformer [24] to observe the effect of fine-tuning strategies under different network structures. The model structure is consistent with the \"swin_t\" provided by PyTorch, and the pre-trained parameters is provided by PyTorch. The results are shown in Table 5.", + "bbox": [ + 212, + 463, + 784, + 523 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In both experiments, we use ImageNet pre-trained parameters and fine-tune the feature extractor on CIFAR-10. Then linear probing is conducted on ImageNet to measure the preservation of pre-trained features.", + "bbox": [ + 212, + 523, + 784, + 568 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "According to Table 4 and Table 5, the proposed strategies proposed can be applied to different pre-training methods and different model structures.", + "bbox": [ + 212, + 570, + 784, + 599 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Discussion", + "text_level": 1, + "bbox": [ + 214, + 626, + 338, + 642 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.1 Rethinking Fine-tuning", + "text_level": 1, + "bbox": [ + 214, + 660, + 421, + 676 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "This paper begins with an interesting phenomenon. A task that seems to require more features may instead allow the fine-tuned model to learn fewer features. The phenomenon is contrary to the first reaction of most people, but this phenomenon is more like a brain teasier that is easy to understand from another angle. A common understanding about the pre-training & fine-tuning process is that how much the pre-trained features can be retained depends on the commonality of the target and pre-training tasks. We propose that how much pre-trained features are lost depends on the differences between the target and pre-training tasks might be a better understanding.", + "bbox": [ + 212, + 688, + 785, + 808 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "From this perspective, pre-training does more than provide a better initial parameter to make the optimization process easier. More importantly, pre-training allows the", + "bbox": [ + 212, + 810, + 785, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 339, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 769, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "model to store a large number of features, most of which may not be helpful for the target task. However, they may help improve the generalization performance. Moreover, obtaining this generalization performance is almost cost-free, neither introducing high computational costs nor degrading the model's performance on the target task.", + "bbox": [ + 217, + 146, + 785, + 205 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5.2 Fine-tuning Strategy and Generalization", + "text_level": 1, + "bbox": [ + 217, + 229, + 537, + 243 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Three fine-tuning strategies are presented in this paper, all of which share the same starting point, i.e. to save the pre-trained feature extractor as much as possible. In general, the mechanism of all three strategies is to create partial idling of neurons. The idea of AST and LPF is relatively close; that is, the feature extractor can reduce the degree of distortion through a suitable predictor, and based on the observation of deep neural networks, it can be further extended to more layers. TNI operates at the neuron level, which is more granular and may have a higher ceiling. We also note that the optimal policy combination may differ in experimental scenarios. Because these three strategies have overlapping parts, they may interfere with each other when used in combination. The fine-tuning strategy is not carefully designed in this paper, but several simple strategies have also achieved significant improvements.", + "bbox": [ + 217, + 255, + 785, + 419 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Regarding generalization, we observed a high correlation between the retention of pre-trained features and the generalization performance. However, the scope of application of this correlation and the specific form remains to be studied. We only test generalization performance on some tasks with relatively small domain differences. For complex scenarios, such as domain adaptation [32], and domain generalization [38].", + "bbox": [ + 217, + 421, + 785, + 494 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 217, + 518, + 341, + 535 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This paper presents a interesting phenomenon that the negative correlation between the complexity of the fine-tuning task and the degree of retention of pre-trained features. Based on the phenomenon, this paper rethinks the execution process of the fine-tuning paradigm and provides a reasonable explanation for this phenomenon from a dynamic perspective. Further, based on this understanding of the fine-tuning process, this paper proposes some plug-and-play fine-tuning methods to better protect the pre-trained features from being distorted. A series of experiments demonstrate that the proposed strategy can reduce the distortion of pre-trained features. Moreover, these methods also have a positive effect on improving the generalization performance of the model. Finally, some potentially valuable research directions are discussed further.", + "bbox": [ + 217, + 551, + 785, + 700 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 726, + 380, + 742 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This work was supported by the National Natural Science Foundation of China under Grants U19B2044 and the Anhui Provincial Natural Science Foundation under Grant 2108085UD12. We acknowledge the support of GPU cluster built by MCC Lab of Information Science and Technology Institution, USTC.", + "bbox": [ + 217, + 757, + 785, + 816 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 390, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 310, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Aghajanyan, A., Gupta, S., Zettlemoyer, L.: Intrinsic dimensionality explains the effectiveness of language model fine-tuning. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 7319-7328 (2021)", + "2. Awasthi, A., Sarawagi, S.: Continual learning with neural networks: A review. In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data. pp. 362-365 (2019)", + "3. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems 33, 9912-9924 (2020)", + "4. Chen, H., Tao, R., Zhang, H., Wang, Y., Ye, W., Wang, J., Hu, G., Savvides, M.: Conv-adapter: Exploring parameter efficient transfer learning for convnets. arXiv preprint arXiv:2208.07463 (2022)", + "5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607 (2020)", + "6. Chen, X., Wang, S., Fu, B., Long, M., Wang, J.: Catastrophic forgetting meets negative transfer: Batch spectral shrinkage for safe transfer learning. In: Wallach, H., Larochelle, H., Beygelzimer, A., d'Alché-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 32. Curran Associates, Inc. (2019), https://proceedings.neurips.cc/paper/2019/file/c6bfff625bdd03933992c9d4db0c6bbe45-Paper.pdf", + "7. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223 (2011)", + "8. Ding, N., Qin, Y., Yang, G., Wei, F., Yang, Z., Su, Y., Hu, S., Chen, Y., Chan, C.M., Chen, W., et al.: Delta tuning: A comprehensive study of parameter efficient methods for pre-trained language models. arXiv preprint arXiv:2203.06904 (2022)", + "9. Feng, Y., Jiang, J., Tang, M., Jin, R., Gao, Y.: Rethinking supervised pre-training for better downstream transferring. In: International Conference on Learning Representations. pp. 1-22 (2022), https://openreview.net/forum?id=Jjcv9MTqhcq", + "0. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32th International Conference on Machine Learning. pp. 1180-1189 (2015)", + "1. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020)", + "2. He, K., Girshick, R., Dollar, P.: Rethinking imagenet pre-training. In: 2019 IEEE/CVF International Conference on Computer Vision. pp. 4917-4926 (2019). https://doi.org/10.1109/ICCV.2019.00502", + "3. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for NLP. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 2790-2799. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/houlsby19a.html", + "4. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)", + "5. Jang, Y., Lee, H., Hwang, S.J., Shin, J.: Learning what and where to transfer. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine" + ], + "bbox": [ + 225, + 175, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 339, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 769, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "Learning. Proceedings of Machine Learning Research, vol. 97, pp. 3030-3039. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/jang19b.html", + "16. Krizhevsky, A., et al.: Learning multiple layers of features from tiny images (2009)", + "17. Kumar, A., Raghunathan, A., Jones, R.M., Ma, T., Liang, P.: Fine-tuning can distort pretrained features and underperform out-of-distribution. In: International Conference on Learning Representations. pp. 1-42 (2022), https://openreview.net/forum?id=UYneFzXSJWh", + "18. Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11), 2278-2324 (1998). https://doi.org/10.1109/5.726791", + "19. Lee, J., Tang, R., Lin, J.: What would elsa do? freezing layers during transformer fine-tuning. arXiv preprint arXiv:1911.03090 (2019)", + "20. Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. Advances in neural information processing systems 30 (2017)", + "21. Li, X., Xiong, H., Wang, H., Rao, Y., Liu, L., Huan, J.: DELTA: DEEP LEARNING TRANSFER USING FEATURE MAP WITH ATTENTION FOR CONVOLUTIONAL NETWORKS. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=rkgbwsAcYm", + "22. LI, X., Grandvalet, Y., Davoine, F.: Explicit inductive bias for transfer learning with convolutional networks. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 2825-2834. PMLR (10-15 Jul 2018), https://proceedings.mlr.press/v80/1i18a.html", + "23. Li, Z., Hoiem, D.: Learning without forgetting. IEEE transactions on pattern analysis and machine intelligence 40(12), 2935-2947 (2017)", + "24. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 10012-10022 (2021)", + "25. van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(86), 2579-2605 (2008), http://jmlr.org/papers/v9/vandermaaten08a.html", + "26. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: Do cifar-10 classifiers generalize to cifar-10? arXiv preprint arXiv:1806.00451 (2018)", + "27. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115(3), 211-252 (2015)", + "28. Shmelkov, K., Schmid, C., Alahari, K.: Incremental learning of object detectors without catastrophic forgetting. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 3400-3409 (2017)", + "29. Stickland, A.C., Murray, I.: BERT and PALs: Projected attention layers for efficient adaptation in multi-task learning. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 5986-5995. PMLR (09-15 Jun 2019), https://proceedings.mlrpress/v97/stickland19a.html", + "30. Tan, C., Sun, F., Kong, T., Zhang, W., Yang, C., Liu, C.: A survey on deep transfer learning. In: International Conference on Artificial Neural Networks. pp. 270-279 (2018)", + "31. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)", + "32. Wang, M., Deng, W.: Deep visual domain adaptation: A survey. Neurocomputing 312, 135-153 (2018)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Hongjing Niu, et al.", + "bbox": [ + 271, + 114, + 390, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "33. Weiss, K., Khoshgoftaar, T.M., Wang, D.: A survey of transfer learning. Journal of Big data 3(1), 1-40 (2016)", + "34. Yang, L., Rakin, A.S., Fan, D.: Rep-net: Efficient on-device learning via feature reprogramming. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12277-12286 (2022)", + "35. Yosinski, J., Clune, J., Bengio, Y., Lipson, H.: How transferable are features in deep neural networks? Advances in neural information processing systems 27 (2014)", + "36. You, K., Kou, Z., Long, M., Wang, J.: Co-tuning for transfer learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 17236-17246. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper/2020/file/c8067ad1937f728f51288b3eb986afaa-Paper.pdf", + "37. Zaken, E.B., Ravfogel, S., Goldberg, Y.: Bitfit: Simple parameter-efficient fine-tuning for transformer-based masked language-models. arXiv preprint arXiv:2106.10199 (2021)", + "38. Zhou, K., Liu, Z., Qiao, Y., Xiang, T., Loy, C.C.: Domain generalization: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence pp. 1-20 (2022)", + "39. Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., He, Q.: A comprehensive survey on transfer learning. Proceedings of the IEEE 109(1), 43-76 (2020)" + ], + "bbox": [ + 212, + 146, + 787, + 396 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Idling Neurons During Fine-tuning Leads to Better Generalization", + "bbox": [ + 339, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_model.json b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_model.json new file mode 100644 index 0000000000000000000000000000000000000000..32c3aa8c2f280dc6bf5275770ddf5a58415d2ddb --- /dev/null +++ b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_model.json @@ -0,0 +1,2368 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.246, + 0.141, + 0.761, + 0.187 + ], + "angle": 0, + "content": "Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization" + }, + { + "type": "text", + "bbox": [ + 0.31, + 0.213, + 0.694, + 0.23 + ], + "angle": 0, + "content": "Hongjing Niu, Hanting Li, Bin Li, and Feng Zhao" + }, + { + "type": "text", + "bbox": [ + 0.274, + 0.24, + 0.73, + 0.255 + ], + "angle": 0, + "content": "MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition," + }, + { + "type": "text", + "bbox": [ + 0.319, + 0.255, + 0.684, + 0.269 + ], + "angle": 0, + "content": "University of Science and Technology of China, Hefei, China" + }, + { + "type": "text", + "bbox": [ + 0.345, + 0.27, + 0.658, + 0.282 + ], + "angle": 0, + "content": "{sasori,ab828658}\\(@\\) mail.ustc.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.375, + 0.284, + 0.631, + 0.295 + ], + "angle": 0, + "content": "{binli, fzhao956}@ustc.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.336, + 0.744, + 0.502 + ], + "angle": 0, + "content": "Abstract. Pre-training on large-scale datasets has become a fundamental method for training deep neural networks. Pre-training provides a better set of parameters than random initialization, which reduces the training cost of deep neural networks on the target task. In addition, pre-training also provides a large number of feature representations, which may help improve generalization capabilities. However, this potential advantage has not received enough attention and has been buried by rough fine-tuning. Based on some exploratory experiments, this paper rethinks the fine-tuning process and gives a new perspective on understanding fine-tuning. Moreover, this paper proposes some plug-and-play fine-tuning strategies as alternatives for simple fine-tuning. These fine-tuning strategies all preserve pre-trained features better by creating idling of some neurons, leading to better generalization." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.516, + 0.63, + 0.53 + ], + "angle": 0, + "content": "Keywords: Fine-tuning \\(\\cdot\\) Feature preserving \\(\\cdot\\) Generalization" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.557, + 0.357, + 0.572 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.589, + 0.789, + 0.725 + ], + "angle": 0, + "content": "Pre-training a model on a large dataset before transferring to a target task's training data improves performance (higher accuracy, lower time cost, easier optimization) over training from scratch [30,33]. In recent years, pre-trained models have been widely used in various tasks, including object recognition, object detection, and image segmentation [12]. Pre-training methods emerge in an endless stream, providing more material for the learning paradigm of pre-training + fine-tuning [39]. Furthermore, pre-training is costless in the sense that large-scale pre-trained parameters can be applied to a wide range of tasks and do not need to be specially designed for the target task. Pre-training has almost become an integral part of training deep neural networks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.726, + 0.789, + 0.817 + ], + "angle": 0, + "content": "Compared with the research on pre-training, how to further adjust the parameters based on pre-training has received less attention. For classification, there are two mainstream approaches, (a) fine-tuning all the model parameters or (b) linear probing, which freezes the feature extractor and trains only the head. Intuitively, fine-tuning all network parameters can improve pre-trained features by adapting them to the specific task, while linear probing freezes these features. Therefore, prior work usually fine-tunes all" + }, + { + "type": "page_footnote", + "bbox": [ + 0.221, + 0.826, + 0.368, + 0.84 + ], + "angle": 0, + "content": "* Corresponding author" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.393, + 0.13 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.152, + 0.672, + 0.329 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.339, + 0.788, + 0.396 + ], + "angle": 0, + "content": "Fig. 1: An intuitive explanation of why CIFAR-10 rather than MNIST as downstream task can cause more feature distortion. The rounded rectangle represents the knowledge base of the model. Triangles, squares and circles represent the knowledge learned from ImageNet, MNIST and CIFAR-10 respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.429, + 0.788, + 0.549 + ], + "angle": 0, + "content": "network parameters to get better accuracy. Only when the data is insufficient or the pretraining task matches the target task well, linear probing is more likely to be selected. However, a more extensive range of tuning model parameters also tends to be accompanied by a more considerable degree of distortion to the pre-trained features. To some extent, such fine-tuning strategy turn the target task into the bed of Procrustes. Although the model performs well on the target task, more value that pre-trained features could have is cut off. For example, fine-tuned models tend to generalize poorly compared with linear probed models [17]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.788, + 0.673 + ], + "angle": 0, + "content": "A pre-trained deep neural network has rich feature representation thanks to the larger pre-training dataset. In addition to being the basis for the same pre-trained model to work on various target tasks, the rich feature representation makes it possible for the model to generalize better on the target task. However, the fine-tuning methods that are widely used today do not care about the distortion or destruction of these features and only pursue accuracy on target tasks. This paper proposes some better alternatives. While ensuring the accuracy of the target task, the proposed fine-tuning strategies also preserve the pre-training features as much as possible." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.789, + 0.841 + ], + "angle": 0, + "content": "First of all, we want to answer such a question. When a model is fine-tuned on the target task, it is inevitable that pre-training knowledge will be forgotten. So what might the degree of the forgetting be related to? Let us start with a simple scenario. For two deep neural networks pre-trained on ImageNet [27], they are fine-tuned on CIFAR-10 [16] and MNIST [18], respectively. Now which of them can keep more memory about ImageNet? Some intuitive factors may be the domain difference between the pre-training task and the target task, the target task's difficulty, the model's scale, the amount of data of the target task, the training method, etc. Based on this idea, CIFAR-10 is more challenging, so a model trained on CIFAR-10 should have more abundant features. Also, the tasks of CIFAR-10 and ImageNet seem closer, so the correlation of features may also be higher." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.34, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.342 + ], + "angle": 0, + "content": "The answer may be somewhat unexpected. We found that models fine-tuned on CIFAR-10 forget far more than models fine-tuned on MNIST. This result is interesting and may be somewhat unexpected, but it is not difficult to understand from another perspective. Figure 1 provides an intuitive explanation of why more complex downstream tasks cause more feature distortion. Let us revisit the fine-tuning process from a dynamic perspective. Fine-tuning is a process of forgetting pre-trained knowledge while optimizing the target task. Therefore, the degree of forgetting is highly correlated with the distance to the target task. Moreover, other factors that can affect the degree of forgetting essentially affect this distance. A series of experiments are conducted to evaluate possible factors affecting the degree of forgetting, and the experimental results also support this hypothesis. Based on this hypothesis, this paper proposes alternative strategies for \"fine-tuning all at the same time\", including \"fine-tuning with an assistant\" and \"temporarily neuron inactivating\"." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.343, + 0.731, + 0.358 + ], + "angle": 0, + "content": "The contributions of this paper can be summarized in the following points." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.367, + 0.784, + 0.409 + ], + "angle": 0, + "content": "- An interesting phenomenon about the fine-tuning process is discovered, which promotes a rethinking of the fine-tuning process. The new perspective on the fine-tuning process could be instructive for transfer learning." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.412, + 0.784, + 0.455 + ], + "angle": 0, + "content": "- Some fine-tuning strategies are proposed, which better preserve pre-trained features and improve the generalization of deep neural networks. These strategies are plug-and-play and easy to generalize." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.367, + 0.784, + 0.455 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.478, + 0.367, + 0.494 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.735 + ], + "angle": 0, + "content": "Transfer learning aims at improving the performance on the target domain by transferring knowledge contained in related source domains, and has become a popular and promising area in machine learning [33, 39]. The discussion in this paper is based on a simple transfer learning paradigm, where a model pre-trained on a larger dataset is fine-tuned on the target dataset. In computer vision, pre-training deep neural networks with ImageNet [27] is undoubtedly one of the most widespread applications of transfer learning [12]. In recent years, some new methods have been applied to pretraining [3, 5, 9, 11]. The pre-trained model has lower cost and better feature representation through self-supervision and other methods. Besides pre-training, there are also works [10, 30, 33] focused on downstream training to improve transferability through eliminating domain shifts between upstream and downstream datasets. DELTA [21], a regularized transfer learning framework using feature map with attention, is proposed to reduce the dependence on downstream datasets. Co-Tuning [36] proposed a two-step framework, which reduces the requirements of large amount of data while fully fine-tuning the model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Parameter-efficient tuning has received more attention along with the popularization of large-scale models. Compared with tuning all parameters, tuning a small number of parameters can greatly reduce the calculation and storage costs. Much work has been done on fine-tuning language models. Delta-tuning [8] roughly divides these methods into three groups: addition-based [13, 29], specification-based [19, 37], and reparameterization-based methods [1, 14]. For vision models, RepNet [34] exploits a dedicated designed side network. And Conv-Adapter [4] utilized an adapter for the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.117, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.116, + 0.392, + 0.129 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.147, + 0.786, + 0.478 + ], + "angle": 0, + "content": "transfer learning of ConvNets. We differentiate our research and Parameter-efficient tuning (PET) here. First, in terms of motivation, the focus of PET lies in improving efficiency and reducing data dependency. Our intention is to fully leverage pre-training features to enhance generalization capabilities. Secondly, in terms of methodology, most PET approaches adjust only a portion (usually a small portion) of the model's parameters instead of all of them. While our method temporarily fixes a subset of parameters, it does not mean that they are completely unadjusted. For instance, in our approach, Linear Parameterized Filters (LPF) first adjust the linear layers and then the feature layers. Feature preserving is an important topic in transfer learning. While better-preserved features may not significantly improve performance on the target task, it does improve generalization [17]. A straightforward idea is to introduce a regularization term. By adding some kind of regularization loss between the pre-trained model and the fine-tuned model, the model changes as little as possible after fine-tuning. Such regularization can be applied to model parameters [22] as well as the output of hidden layers [21]. Selectively tuning parameters is also a viable strategy. For example, different weights can be assigned according to the depth of each layer of a deep neural network [35]. A more refined approach is to use meta-learning to learn which features are more worth keeping [15]. In general, most of these studies focus on selecting and preserving features that are more helpful to the target task. On the one hand, improving the performance on the target task is very meaningful. On the other hand, features that do not seem to help the target task are also likely to be worth saving because they may lead to better generalization, which will be discussed further." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.484, + 0.786, + 0.634 + ], + "angle": 0, + "content": "Catastrophic forgetting in continual learning also discusses the preservation of already learned features during learning [2]. Solutions to catastrophic forgetting can be roughly divided into self-refreshing memory approaches [28], knowledge distillation [23] and transfer techniques [20]. These methods may have a good reference for the fine-tuning process. But it should be noted that there are differences between the two settings. In continual learning, each dataset has equal importance. The model must maintain performance on the original data while learning new data. In transfer learning, the model only needs to pursue the performance on the target task, and it is no longer necessary to consider the pre-training task. Continual learning requires higher consistency between tasks, which makes it far less applicable than transfer learning." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.681, + 0.358, + 0.698 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.735, + 0.786, + 0.84 + ], + "angle": 0, + "content": "In this work, we wish to study the distortion of the pre-trained features during the fine-tuning process of deep neural networks. More specifically, we divide a deep neural network into two parts, a feature extractor and a classification head (usually the last linear layer). The research is about how to prevent the feature extractor from being distorted during the fine-tuning, and the classification head is used for evaluating the extracted features. In this section, we will introduce: how to measure the degree of distortion of features and how to reduce this distortion when fine-tuning." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.339, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.144, + 0.371, + 0.245 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.267, + 0.247, + 0.34, + 0.258 + ], + "angle": 0, + "content": "(a) Pre-training" + }, + { + "type": "image", + "bbox": [ + 0.371, + 0.145, + 0.505, + 0.245 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.393, + 0.247, + 0.481, + 0.259 + ], + "angle": 0, + "content": "(b) Linear probing" + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.144, + 0.769, + 0.245 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.581, + 0.247, + 0.689, + 0.258 + ], + "angle": 0, + "content": "(c) Linear probing first" + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.261, + 0.37, + 0.367 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.259, + 0.368, + 0.347, + 0.378 + ], + "angle": 0, + "content": "(d) Fine-tuning all" + }, + { + "type": "image", + "bbox": [ + 0.371, + 0.259, + 0.505, + 0.36 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.371, + 0.36, + 0.501, + 0.379 + ], + "angle": 0, + "content": "(e) Temp. neuron inactivating" + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.261, + 0.769, + 0.367 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.562, + 0.368, + 0.71, + 0.379 + ], + "angle": 0, + "content": "(f) Fine-tuning with an assistant" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.391, + 0.788, + 0.447 + ], + "angle": 0, + "content": "Fig. 2: A visual demonstration of the proposed strategies. We use a simple three-layer structure to represent the deep neural network, and the feedforward process of the neural network is from the bottom to the top. The black connecting lines represent the pre-trained parameters, and the blue dashed connecting lines represent the modified parameters." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.475, + 0.504, + 0.489 + ], + "angle": 0, + "content": "3.1 Measurement of Feature Distortion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.498, + 0.785, + 0.528 + ], + "angle": 0, + "content": "We set the scene as fine-tuning for an image classification task. Pre-training dataset \\(\\mathbb{D}_p\\) consists of image-label pairs \\(X_{p},Y_{p}\\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.529, + 0.785, + 0.572 + ], + "angle": 0, + "content": "A naive perception about deep neural networks is that the first few layers are a feature extractor \\(\\mathcal{F}\\) that looks for a set of features, while the latter layers are a predictor \\(\\mathcal{P}\\) that uses those features to perform classification tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.573, + 0.787, + 0.634 + ], + "angle": 0, + "content": "Based on this understanding, we connect a feature extractor \\(\\mathcal{F}\\) to a randomly initialized predictors \\(\\mathcal{P}\\), and adjust \\(\\mathcal{P}\\) to maximize the accuracy of the model \\(\\mathcal{P} \\circ \\mathcal{F}\\) on \\(\\mathbb{D}\\). The effectiveness of a feature extractor \\(\\mathcal{F}\\) for a dataset \\(\\mathbb{D}\\) can be expressed by the following formula." + }, + { + "type": "equation", + "bbox": [ + 0.262, + 0.641, + 0.787, + 0.668 + ], + "angle": 0, + "content": "\\[\n\\mathscr {E} (\\mathcal {F}, \\mathbb {D}) = A c c u r a c y \\left(\\mathcal {P} ^ {\\Phi^ {*}} \\circ \\mathcal {F} (\\mathbb {D})\\right), \\Phi^ {*} = \\underset {\\Phi} {\\arg \\min } L o s s \\left(\\mathcal {P} ^ {\\Phi} \\circ \\mathcal {F} (\\mathbb {D})\\right). \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.674, + 0.785, + 0.689 + ], + "angle": 0, + "content": "The parameters of \\(\\mathcal{P}\\) is represented with \\(\\varPhi\\), and we use \\(\\varPsi\\) to represent parameters of \\(\\mathcal{F}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.787, + 0.809 + ], + "angle": 0, + "content": "Of course, the fully connected neural network may not be able to fully express the information about decision-making contained in the feature extractor, which will lead to the fact that the effective information \\( MI(\\mathcal{F}(X), Y) \\) retained in the feature extractor is larger (\\( MI \\) stands for mutual information, and \\( X, Y \\) is the input and ground-truth from \\( \\mathbb{D} \\)). However, the difficulty of extracting effective information should also be used for the evaluation of feature extractors. Therefore, in the case of the same predictor, effectiveness \\( \\mathcal{E} \\) is a fair and reasonable indicator for evaluating the performance of feature extractors." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.841 + ], + "angle": 0, + "content": "By comparing the effectiveness of feature extractors before \\((\\mathcal{F}_0)\\) and after \\((\\mathcal{F}^*)\\) fine-tuning on the pre-trained dataset, the distortion of fine-tuning to pre-trained features," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.393, + 0.129 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "code_caption", + "bbox": [ + 0.217, + 0.146, + 0.491, + 0.163 + ], + "angle": 0, + "content": "Algorithm 1 Pre-training and fine-tuning" + }, + { + "type": "algorithm", + "bbox": [ + 0.217, + 0.164, + 0.538, + 0.278 + ], + "angle": 0, + "content": "Input: Pre-training dataset \\(\\mathbb{D}_p\\) , fine-tuning dataset \\(\\mathbb{D}_d\\) \nParameter: \\(\\varPsi\\) \\(\\varPhi\\) (parameters of \\(\\mathcal{F}\\) and \\(\\mathcal{P}\\) \nOutput: \\(\\varPsi^{*},\\varPhi^{*}\\) \nInitialize: \\(\\varPsi,\\varPhi=\\varPsi_0,\\varPhi_0\\) \nPre-train: \\(\\varPsi_p,\\varPhi_p=\\arg\\min_{\\varPsi,\\varPhi}Loss(\\mathcal{P}\\circ\\mathcal{F}(\\mathbb{D}_p))\\) \nLoad parameters: \\(\\varPsi=\\varPsi_p\\) \nFine-tune: \\(\\varPsi^{*},\\varPhi^{*}=\\arg\\min_{\\varPsi,\\varPhi}Loss(\\mathcal{P}\\circ\\mathcal{F}(\\mathbb{D}_d))\\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.784, + 0.346 + ], + "angle": 0, + "content": "denoted as \\(\\mathcal{D}\\), can be measured. Note that a denominator of zero indicates that the original feature extractor is completely invalid and therefore not relevant for discussion." + }, + { + "type": "equation", + "bbox": [ + 0.38, + 0.356, + 0.786, + 0.39 + ], + "angle": 0, + "content": "\\[\n\\mathcal {D} = 1 - \\frac {\\mathcal {E} \\left(\\mathcal {F} ^ {*} , \\mathbb {D}\\right)}{\\mathcal {E} \\left(\\mathcal {F} _ {0} , \\mathbb {D}\\right)}, \\mathcal {E} \\left(\\mathcal {F} _ {0}, \\mathbb {D}\\right) \\neq 0. \\tag {2}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.413, + 0.478, + 0.429 + ], + "angle": 0, + "content": "3.2 Feature-preserving Fine-tuning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.785, + 0.501 + ], + "angle": 0, + "content": "A method for measuring feature distortion is given above. In this section, some fine-tuning strategies are given. Figure 2 provides a visual demonstration of the proposed strategies. These strategies should minimize the degree of feature distortion while ensuring the performance of downstream tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.502, + 0.787, + 0.547 + ], + "angle": 0, + "content": "We denote the dataset for downstream tasks by \\(\\mathbb{D}_d\\). A complete pre-training and fine-tuning paradigm can be expressed as shown in Alg. 1. The methods proposed below are all different implementations of the fine-tuning step." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.548, + 0.787, + 0.623 + ], + "angle": 0, + "content": "Linear Probing First (LPF). An intuitive method is to do linear probing first [17]. First, freeze the feature extractor \\(\\mathcal{F}\\) and only fine-tune the predictor \\(\\mathcal{P}\\), and then adjust \\(\\mathcal{F}\\) and \\(\\mathcal{P}\\) at the same time. Through linear probing, the predictor and the pre-trained feature extractor can be somewhat well matched, reducing the feature extractor's optimization cost, thereby shortening the optimization process." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.624, + 0.787, + 0.714 + ], + "angle": 0, + "content": "Temporarily Neuron Inactivating (TNI). We note that during the fine-tuning of the neural network, all neurons are continuously adjusted to fit the target task, which may be unnecessary. Just tweaking some neurons might well fit the task. The adjustment that occurs in other neurons may simply be because this part of the neuron has not completed the adjustment. To improve this, we propose a strategy called temporarily neuron inactivating." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.715, + 0.787, + 0.79 + ], + "angle": 0, + "content": "Specifically, a smaller fraction of the gradients used to update the model parameters is zeroed out. Thus, neurons that do not need much adjustment are left intact, while other neurons make adjustments to suit the target task. We recommend computing the mean \\((\\mu)\\) and standard deviation \\((\\sigma)\\) of the gradients \\((G)\\) for each layer in one iteration and then zeroing the fraction of gradients closest to the mean," + }, + { + "type": "equation", + "bbox": [ + 0.359, + 0.803, + 0.787, + 0.845 + ], + "angle": 0, + "content": "\\[\nG = \\left\\{ \\begin{array}{l l} 0, & i f \\quad G - \\| G - \\mu \\| _ {1} \\leq \\delta \\sigma ; \\\\ G, & i f \\quad G - \\| G - \\mu \\| _ {1} > \\delta \\sigma . \\end{array} \\right. \\tag {3}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.34, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.126 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.776, + 0.161 + ], + "angle": 0, + "content": "\\(\\delta\\) is a hyperparameter, and a larger \\(\\delta\\) means that more parameters will not be updated." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.163, + 0.785, + 0.207 + ], + "angle": 0, + "content": "This method of choosing the parameters to be fixed is not unique. Following the same strategy, we can adjust the method with a fixed ratio or other designs. How many parameters are fixed each time and how they are chosen remains to be further explored." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.208, + 0.786, + 0.372 + ], + "angle": 0, + "content": "Fine-tuning with an Assistant (AST). In addition to partially adjusting the parameters, another idea is to reduce the overall variation of the parameters. A possible approach is to use a replicated model as an assistant. First, replicate a pre-trained model as an assistant, then the feature extractors of the two models are connected in parallel, and the predictors share parameters. The parameters of the replica are frozen. The two models are trained alternately (the odd-numbered epochs train the assistant, and the even-numbered epochs train the original model). Keeping an assistant means the predictor will try to apply the pre-trained features directly to the target task. With the help of the assistant, the feature extractor can adapt to the target task with smaller changes. In a way, it can be seen as a dynamic version of linear probing first. Both of them reduce the distortion of the feature extractor with a suitable predictor." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.395, + 0.356, + 0.412 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.425, + 0.297, + 0.44 + ], + "angle": 0, + "content": "4.1 Setup" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.448, + 0.786, + 0.567 + ], + "angle": 0, + "content": "Evaluation methods. The experiment involves pretraining tasks and downstream tasks. The basic purpose of the experiment is to evaluate: (1) The extent to which pre-trained features are distorted after fine-tuning on downstream tasks; (2) the generalization performance of the fine-tuned model on downstream tasks. Therefore, we evaluate the distortion of pre-trained features (Eq. 2). Since the pre-training task remains unchanged in a experiment, only \\(\\mathcal{E}(\\mathcal{F}^*,\\mathbb{D})\\), i.e., the accuracy on the pre-training dataset after linear probing is calculated. For the generalization performance on downstream tasks, generalization datasets for the downstream tasks are used." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.569, + 0.786, + 0.809 + ], + "angle": 0, + "content": "Datasets. All the datasets we use are open source datasets, including ImageNet [27], MNIST [18], CIFAR-10 [16], CIFAR-100 [16], CIFAR-10.1 [26], STL-10 [7] and CUB-200-2011 [31]. Among them, ImageNet is a large-scale image dataset with more than 1 million images in 1000 categories and is widely used as a pre-training dataset. CIFAR-10 is a lightweight image classification dataset that contains a total of 60,000 images of small size \\((32\\times 32)\\) in 10 categories. For the experiments in Figure 3a, we preferentially select classes with smaller CIFAR-10 class numbers when sampling partial classes. CIFAR-100 is similar to CIFAR-10 but with 100 classes, while the total number of samples remains at 60,000. For the experiments in Table 1, we selected subclasses of CIFAR-100 to constitute the dataset. Specifically, we take two superclasses each time to form a 10-class classification task. The data for the target task comes from \"flowers\" and \"fruit and vegetables\", while the data for the generalization task are from \"vehicles1\" and \"vehicles2\". CIFAR-10.1 provides a new test set for CIFAR-10. We use it for testing to measure the generalization of the CIFAR-10 model. STL-10 contains more than 10,000 images in 10 categories similar to CIFAR-10. So we use it as a generalization task with more considerable domain differences." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.81, + 0.786, + 0.84 + ], + "angle": 0, + "content": "Implementation details. We use ResNet-18 for experiments in Section 4.2, and Swin-Transformer-Tiny [24] for Table 5. For rest of the experiments, we use ResNet-50" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.229, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.393, + 0.13 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.158, + 0.481, + 0.284 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.511, + 0.158, + 0.753, + 0.284 + ], + "angle": 0, + "content": null + }, + { + "type": "image_footnote", + "bbox": [ + 0.224, + 0.288, + 0.78, + 0.38 + ], + "angle": 0, + "content": "(a) The extent of preservation of pre-trained features is in- (b) We are aware that as the target task involves distinguish- fluenced by the difficulty of the target task. As the target task ing an increasing number of categories of CIFAR-10 sambecomes increasingly challenging in distinguishing more ples, the number of samples used for fine-tuning also incategories of CIFAR-10 samples, models pre-trained on Im- creases. Therefore, we uniformly sample a certain proportageNet (green) become more difficult to maintain good per tion of samples from each category as a control. The impact formance on ImageNet after fine-tuning on the target task. of different sample quantities has noticeably decreased comIn contrast, models initialized with random weights (blue) pared to different task complexities (a). Both the downward achieve better performance on ImageNet after training on trend of the green line and the upward trend of the blue line the target task. have smaller amplitudes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.41, + 0.789, + 0.607 + ], + "angle": 0, + "content": "as the backbone model for the experiments. We use the version provided by PyTorch, and the pre-training parameters of ImageNet are also from PyTorch. Except that the output shape of the \"FC\" layer may be modified according to the task, other structures remain unchanged. Without special instructions, we use SGD as the optimizer (learning rate 1e-2, momentum 0.9, weight decay 1e-5), the batch size is 16 for ImageNet and 128 for other datasets, and all training is performed for 100 epochs, For the strategy using LPF, Linear probing is performed for 10 epochs, which means that the remaining fine-tuning is performed for 90 epochs. For the fine-tuning with an assistant strategy, half of the epochs are used for the assistant. For the Temporarily Neuron Inactivating strategy, we compute the mean and standard deviation of the gradients of the same layer in each update and zero out the gradients whose difference from the mean is less than the standard deviation. According to our observations, each experiment trains to convergence, and the best-performing model is taken. The code will be open-sourced." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.631, + 0.411, + 0.646 + ], + "angle": 0, + "content": "4.2 Distortion of Features" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.658, + 0.787, + 0.688 + ], + "angle": 0, + "content": "First, we observe the distortion of pre-trained features during model fine-tuning through a set of experiments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.787, + 0.749 + ], + "angle": 0, + "content": "We previously introduced a toy example to observe the degree of feature forgetting after ImageNet pre-trained models are fine-tuned on CIFAR-10 and MNIST. We extend this experiment to verify the relationship between the degree of feature forgetting in fine-tuning and the target task." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.787, + 0.795 + ], + "angle": 0, + "content": "We use different subsets of CIFAR-10 as the fine-tuning datasets and test how much the fine-tuned models retain pre-trained features. Models without pre-training are used in the same process as controls. The results are shown in Figure 3a" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.787, + 0.84 + ], + "angle": 0, + "content": "The results show that as the target task contains more categories, the accuracy of the control group increases, which means that the model does learn more features. The performance of the experimental group shows an opposite trend to that of the control" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.34, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.177 + ], + "angle": 0, + "content": "group, which means that when other conditions remain unchanged, the more features to be learned, the more severe the distortion of the pre-trained features." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.179, + 0.788, + 0.344 + ], + "angle": 0, + "content": "We also test the effect of sample size on the results (Figure 3b). The training set is obtained by uniformly sampling from each class. In this way, the distribution is kept unchanged, and the dataset size is reduced. It can be seen that simply changing the size of the training set has little effect on the experimental results. Combining Figure 3a and Figure 3b, it can be concluded that there is a positive correlation between the amount of target features and the distortion of the pre-trained features. The experimental results are consistent with what we observed in the toy experiments. Moreover, after excluding other interfering factors, the principle behind this phenomenon is also more evident. An extreme example might make the process easier to understand. If the training task is empty, neither the common features nor the different features exist. The model does not need to be adjusted, and the pre-trained features are perfectly preserved." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.373, + 0.396, + 0.387 + ], + "angle": 0, + "content": "4.3 Preserving Features" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.403, + 0.788, + 0.522 + ], + "angle": 0, + "content": "To verify the effect of the proposed feature-preserving fine-tuning method. We pre-train the model on CIFAR-10, fine-tune it on a subset of CIFAR-100 (Target), and verify feature retention again on CIFAR-10. ImageNet is no longer used in this experiment because CIFAR-10 and CIFAR-100 avoid differences unrelated to image content, such as image size; CIFAR-10 has fewer effective features than ImageNet, which makes feature distortion easier to observe. We also test with linear probing on another subset of CIFAR-100 (Unseen), verifying that the retained features are indeed valuable. The results are shown in Table 1." + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.55, + 0.788, + 0.605 + ], + "angle": 0, + "content": "Table 1: Preservation of pre-trained features by several strategies. The \\(\\sqrt{}\\) indicated that the strategy was adopted. Pre-train represents the dataset used for pre-training, and the results intuitively reflect the retention of features. Unseen represents a dataset that has not been seen in pre-training and fine-tuning stages, and its results reflect generalization ability." + }, + { + "type": "table", + "bbox": [ + 0.34, + 0.618, + 0.661, + 0.78 + ], + "angle": 0, + "content": "
StrategiesTesting accuracy (%)
ASTLPFTNITargetPre-trainUnseen
56.44±1.2349.58±0.0743.78±0.23
✓57.14±1.0854.13±0.0647.20±0.17
✓57.36±0.4149.98±0.0846.00±0.19
✓57.92±1.3753.68±0.0845.98±0.45
✓✓56.50±0.9659.30±0.0951.62±0.26
✓✓58.26±0.7454.30±0.0748.02±0.33
✓✓59.40±0.8258.69±0.0649.46±0.39
✓✓✓57.65±0.6958.14±0.1051.30±0.31
" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.825, + 0.714, + 0.84 + ], + "angle": 0, + "content": "Based on the results in Table 1, the following observations can be made." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.392, + 0.129 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.147, + 0.786, + 0.191 + ], + "angle": 0, + "content": "- The three strategies tested have better performance on pre-train testing sets, and some strategy combinations can achieve better results. This shows that the proposed strategies are all beneficial for preserving task-related features." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.193, + 0.786, + 0.237 + ], + "angle": 0, + "content": "- The three strategies tested have better performance on unseen testing sets. This means that the saved features are not only useful for pre-training tasks or target tasks but may also be helpful for some unseen tasks." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.239, + 0.786, + 0.283 + ], + "angle": 0, + "content": "- The performance ranking of the strategies on the two test sets shows a high degree of consistency, indicating that saving more pre-trained features positively affects the generalization ability of the learned features." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.147, + 0.786, + 0.283 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.296, + 0.784, + 0.356 + ], + "angle": 0, + "content": "It can be seen that compared with fine-tuning of all parameters, a suitable strategy can make the model retain more features. It should be noted that the above methods will not lose the accuracy of the target task itself. In fact, the accuracy of the target task is higher in most cases." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.358, + 0.785, + 0.432 + ], + "angle": 0, + "content": "It is necessary to remind that in the fine-tuning paradigm, preserving pre-training features is not a hard requirement. However, keeping the pre-trained features may lead to better generalization performance, which is very meaningful. Therefore, in the experiments in Table 1, the performance of the model on the unseen testing set is more practical." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.434, + 0.786, + 0.508 + ], + "angle": 0, + "content": "We conduct t-SNE [25] on the output of the feature extractor to observe the distortion of pre-trained features visually. Figure 4 shows the results of feature dimensionality reduction under four settings, pre-training, fine-tuning all parameters, TNI, and AST + TNI. The experiment is completed under the settings of Table 1, and the features under the three strategies are the output of the feature extractor." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.536, + 0.787, + 0.579 + ], + "angle": 0, + "content": "Table 2: Generalizability under several strategies. Models are pre-trained on CIFAR-10 and fine-tuned on CIFAR-100. We measure the generalization ability of several strategies by observing model performance on different testing sets." + }, + { + "type": "table", + "bbox": [ + 0.339, + 0.591, + 0.663, + 0.753 + ], + "angle": 0, + "content": "
StrategiesTesting accuracy (%)
ASTLPFTNICIFAR-10CIFAR-10.1
51.85±0.0740.52±0.25 44.28±0.14
✓54.61±0.1241.50±0.11 45.81±0.13
✓56.54±0.0442.95±0.13 47.27±0.16
✓52.54±0.1141.25±0.13 45.01±0.14
✓✓56.85±0.0644.06±0.16 47.27±0.12
✓✓57.03±0.3444.76±0.12 47.59±0.16
✓✓60.04±0.0547.16±0.05 48.62±0.22
✓✓✓58.05±0.0445.50±0.13 47.50±0.17
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "It can be seen that there are clear boundaries between the feature classes extracted by the pre-trained model. After fine-tuning, the boundaries between classes become blurred. This situation is improved when fine-tuning strategies such as TNI are used." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.34, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.291, + 0.144, + 0.499, + 0.306 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.359, + 0.31, + 0.432, + 0.321 + ], + "angle": 0, + "content": "(a) Pre-training" + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.144, + 0.715, + 0.308 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.569, + 0.31, + 0.647, + 0.32 + ], + "angle": 0, + "content": "(b) Fine-tune all" + }, + { + "type": "image", + "bbox": [ + 0.291, + 0.326, + 0.497, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.377, + 0.487, + 0.414, + 0.497 + ], + "angle": 0, + "content": "(c) TNI" + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.322, + 0.714, + 0.485 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.572, + 0.487, + 0.644, + 0.497 + ], + "angle": 0, + "content": "(d) AST + TNI" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.51, + 0.788, + 0.579 + ], + "angle": 0, + "content": "Fig. 4: t-SNE results on CIFAR-10. Dimensionality reduction is performed on the output of the feature extractor obtained by several different fine-tuning strategies. The colors in the figure represent the categories of the samples. It can be seen that after fine-tuning, the cluster boundaries of each category become much blurred. The tsne results corresponding to the strategies with better results in Table 1 are also more discriminative." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.612, + 0.788, + 0.687 + ], + "angle": 0, + "content": "When using the combination of AST+TNI strategy, the distribution of features is very close to the result after only pre-training. Even the best t-SNE results are significantly different from those before fine-tuning. This is reasonable because the results shown in Table 1 show that the current optimal strategy is only \\(59.3\\%\\) accurate on CIFAR-10, while the accuracy of the model before fine-tuning can exceed \\(90\\%\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.717, + 0.444, + 0.731 + ], + "angle": 0, + "content": "4.4 Downstream Classification" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We apply the method to more challenging fine-grained classification tasks to test the performance of our tuning strategies on downstream classification tasks. Table 3 shows the performance of our approaches and other transfer learning methods on CUB-200-2011, a widely used fine-grained classification dataset. It can be seen that for all the tested sampling rates, the proposed strategies can achieve comparable or even better performance. Using the proposed strategies for tuning will not damage the performance" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.393, + 0.13 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.178 + ], + "angle": 0, + "content": "on downstream classification tasks, which is consistent with the conclusions drawn in previous experiments." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.203, + 0.786, + 0.218 + ], + "angle": 0, + "content": "Table 3: Accuracy on CUB-200-2011. The best results are in bold faces. † results are from [36]." + }, + { + "type": "table", + "bbox": [ + 0.373, + 0.23, + 0.627, + 0.392 + ], + "angle": 0, + "content": "
MethodSampling Rates
15%30%50%100%
FT†45.2559.6870.1278.01
AST45.5158.1169.8377.42
LPF45.7062.4270.5679.63
TNI46.3862.0371.1679.25
L2SP† [22]45.0857.7869.4778.44
DELTA† [21]46.8360.3771.3878.63
BSS† [6]47.7463.3872.5678.85
CoTuning† [36]52.5866.4774.6481.24
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.453, + 0.362, + 0.468 + ], + "angle": 0, + "content": "4.5 Generalization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.787, + 0.522 + ], + "angle": 0, + "content": "From the previous experiment, it can be seen that several of the proposed fine-tuning strategies are better than fine-tuning all parameters directly. Moreover, several strategies can be nested for better results." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.787, + 0.612 + ], + "angle": 0, + "content": "Following the previous experimental procedure, we use CIFAR-10 as the pre-train task and CIFAR-100 as the target task. In addition to performance on the target task, we further test two other testing sets to evaluate the value of these strategies for generalization. For STL-10, we performed linear probing, and for CIFAR10.1, we did not perform additional operations since the training set is the same. The results are shown in Table 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.787, + 0.72 + ], + "angle": 0, + "content": "The following observations can be made based on the results in Table 1. Models that better preserve pre-trained features also have better generalization performance. Moreover, the generalization improvement does not necessarily require extremely high similarity between distributions. The strategies in this paper are all plug-and-play and hardly introduce additional training costs but significantly improve the generalization performance of the model. Preserving the features of the pre-trained model as much as possible is a relatively novel way to improve the generalization of deep neural networks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.741, + 0.473, + 0.756 + ], + "angle": 0, + "content": "4.6 Broader Application Scenarios" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Although supervised learning on ImageNet is the most widely used pre-training method, many other valuable pre-training methods are also available. Estimated from the design idea, the proposed fine-tuning strategies proposed in this paper should apply to various pre-trained models. In addition to supervised learning, we use the SwAV [3] as a pretraining method and repeat the previous experiments. SwAV is a simple and efficient" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.34, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.77, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "self-supervised learning method that realizes feature learning through comparison and clustering." + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.205, + 0.479, + 0.26 + ], + "angle": 0, + "content": "Table 4: The performance of the proposed strategies with SwAV pre-trained parameters. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10." + }, + { + "type": "table", + "bbox": [ + 0.248, + 0.273, + 0.442, + 0.436 + ], + "angle": 0, + "content": "
StrategiesTesting set (%)
AST LPF TNISelf-supervised
79.29±1.31
✓79.74±1.04
✓81.39±0.95
✓80.86±0.69
✓✓79.66±1.57
✓81.55±0.98
✓✓81.68±1.59
✓✓81.56±0.76
" + }, + { + "type": "table_caption", + "bbox": [ + 0.526, + 0.205, + 0.788, + 0.26 + ], + "angle": 0, + "content": "Table 5: The performance of the proposed strategies on Swin-Transformer. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10." + }, + { + "type": "table", + "bbox": [ + 0.561, + 0.273, + 0.751, + 0.435 + ], + "angle": 0, + "content": "
StrategiesTesting set (%)
ASTLPF TNISwin-T
79.23±0.73
✓79.67±0.86
✓80.98±1.09
79.84±1.64
✓✓81.14±1.15
✓82.29±1.72
✓82.05±0.91
✓✓82.04±1.22
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.464, + 0.785, + 0.524 + ], + "angle": 0, + "content": "We conduct experiments on the popular Swin-Transformer [24] to observe the effect of fine-tuning strategies under different network structures. The model structure is consistent with the \"swin_t\" provided by PyTorch, and the pre-trained parameters is provided by PyTorch. The results are shown in Table 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.525, + 0.785, + 0.569 + ], + "angle": 0, + "content": "In both experiments, we use ImageNet pre-trained parameters and fine-tune the feature extractor on CIFAR-10. Then linear probing is conducted on ImageNet to measure the preservation of pre-trained features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.571, + 0.785, + 0.601 + ], + "angle": 0, + "content": "According to Table 4 and Table 5, the proposed strategies proposed can be applied to different pre-training methods and different model structures." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.627, + 0.339, + 0.643 + ], + "angle": 0, + "content": "5 Discussion" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.661, + 0.422, + 0.677 + ], + "angle": 0, + "content": "5.1 Rethinking Fine-tuning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.787, + 0.809 + ], + "angle": 0, + "content": "This paper begins with an interesting phenomenon. A task that seems to require more features may instead allow the fine-tuned model to learn fewer features. The phenomenon is contrary to the first reaction of most people, but this phenomenon is more like a brain teasier that is easy to understand from another angle. A common understanding about the pre-training & fine-tuning process is that how much the pre-trained features can be retained depends on the commonality of the target and pre-training tasks. We propose that how much pre-trained features are lost depends on the differences between the target and pre-training tasks might be a better understanding." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.811, + 0.787, + 0.841 + ], + "angle": 0, + "content": "From this perspective, pre-training does more than provide a better initial parameter to make the optimization process easier. More importantly, pre-training allows the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.392, + 0.129 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.147, + 0.786, + 0.207 + ], + "angle": 0, + "content": "model to store a large number of features, most of which may not be helpful for the target task. However, they may help improve the generalization performance. Moreover, obtaining this generalization performance is almost cost-free, neither introducing high computational costs nor degrading the model's performance on the target task." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.23, + 0.538, + 0.244 + ], + "angle": 0, + "content": "5.2 Fine-tuning Strategy and Generalization" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.256, + 0.786, + 0.42 + ], + "angle": 0, + "content": "Three fine-tuning strategies are presented in this paper, all of which share the same starting point, i.e. to save the pre-trained feature extractor as much as possible. In general, the mechanism of all three strategies is to create partial idling of neurons. The idea of AST and LPF is relatively close; that is, the feature extractor can reduce the degree of distortion through a suitable predictor, and based on the observation of deep neural networks, it can be further extended to more layers. TNI operates at the neuron level, which is more granular and may have a higher ceiling. We also note that the optimal policy combination may differ in experimental scenarios. Because these three strategies have overlapping parts, they may interfere with each other when used in combination. The fine-tuning strategy is not carefully designed in this paper, but several simple strategies have also achieved significant improvements." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.422, + 0.786, + 0.496 + ], + "angle": 0, + "content": "Regarding generalization, we observed a high correlation between the retention of pre-trained features and the generalization performance. However, the scope of application of this correlation and the specific form remains to be studied. We only test generalization performance on some tasks with relatively small domain differences. For complex scenarios, such as domain adaptation [32], and domain generalization [38]." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.52, + 0.343, + 0.536 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.552, + 0.786, + 0.702 + ], + "angle": 0, + "content": "This paper presents a interesting phenomenon that the negative correlation between the complexity of the fine-tuning task and the degree of retention of pre-trained features. Based on the phenomenon, this paper rethinks the execution process of the fine-tuning paradigm and provides a reasonable explanation for this phenomenon from a dynamic perspective. Further, based on this understanding of the fine-tuning process, this paper proposes some plug-and-play fine-tuning methods to better protect the pre-trained features from being distorted. A series of experiments demonstrate that the proposed strategy can reduce the distortion of pre-trained features. Moreover, these methods also have a positive effect on improving the generalization performance of the model. Finally, some potentially valuable research directions are discussed further." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.727, + 0.382, + 0.743 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.758, + 0.786, + 0.818 + ], + "angle": 0, + "content": "This work was supported by the National Natural Science Foundation of China under Grants U19B2044 and the Anhui Provincial Natural Science Foundation under Grant 2108085UD12. We acknowledge the support of GPU cluster built by MCC Lab of Information Science and Technology Institution, USTC." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.34, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.77, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.312, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.176, + 0.786, + 0.232 + ], + "angle": 0, + "content": "1. Aghajanyan, A., Gupta, S., Zettlemoyer, L.: Intrinsic dimensionality explains the effectiveness of language model fine-tuning. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 7319-7328 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.233, + 0.787, + 0.273 + ], + "angle": 0, + "content": "2. Awasthi, A., Sarawagi, S.: Continual learning with neural networks: A review. In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data. pp. 362-365 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.786, + 0.314 + ], + "angle": 0, + "content": "3. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems 33, 9912-9924 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.315, + 0.786, + 0.355 + ], + "angle": 0, + "content": "4. Chen, H., Tao, R., Zhang, H., Wang, Y., Ye, W., Wang, J., Hu, G., Savvides, M.: Conv-adapter: Exploring parameter efficient transfer learning for convnets. arXiv preprint arXiv:2208.07463 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.357, + 0.786, + 0.397 + ], + "angle": 0, + "content": "5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.398, + 0.786, + 0.48 + ], + "angle": 0, + "content": "6. Chen, X., Wang, S., Fu, B., Long, M., Wang, J.: Catastrophic forgetting meets negative transfer: Batch spectral shrinkage for safe transfer learning. In: Wallach, H., Larochelle, H., Beygelzimer, A., d'Alché-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 32. Curran Associates, Inc. (2019), https://proceedings.neurips.cc/paper/2019/file/c6bfff625bdd03933992c9d4db0c6bbe45-Paper.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.481, + 0.786, + 0.522 + ], + "angle": 0, + "content": "7. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223 (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.523, + 0.786, + 0.563 + ], + "angle": 0, + "content": "8. Ding, N., Qin, Y., Yang, G., Wei, F., Yang, Z., Su, Y., Hu, S., Chen, Y., Chan, C.M., Chen, W., et al.: Delta tuning: A comprehensive study of parameter efficient methods for pre-trained language models. arXiv preprint arXiv:2203.06904 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.565, + 0.786, + 0.605 + ], + "angle": 0, + "content": "9. Feng, Y., Jiang, J., Tang, M., Jin, R., Gao, Y.: Rethinking supervised pre-training for better downstream transferring. In: International Conference on Learning Representations. pp. 1-22 (2022), https://openreview.net/forum?id=Jjcv9MTqhcq" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.606, + 0.786, + 0.633 + ], + "angle": 0, + "content": "0. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32th International Conference on Machine Learning. pp. 1180-1189 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.634, + 0.786, + 0.674 + ], + "angle": 0, + "content": "1. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.675, + 0.786, + 0.714 + ], + "angle": 0, + "content": "2. He, K., Girshick, R., Dollar, P.: Rethinking imagenet pre-training. In: 2019 IEEE/CVF International Conference on Computer Vision. pp. 4917-4926 (2019). https://doi.org/10.1109/ICCV.2019.00502" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.716, + 0.786, + 0.784 + ], + "angle": 0, + "content": "3. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for NLP. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 2790-2799. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/houlsby19a.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.786, + 0.813 + ], + "angle": 0, + "content": "4. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.786, + 0.84 + ], + "angle": 0, + "content": "5. Jang, Y., Lee, H., Hwang, S.J., Shin, J.: Learning what and where to transfer. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.176, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.392, + 0.129 + ], + "angle": 0, + "content": "Hongjing Niu, et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.241, + 0.147, + 0.786, + 0.175 + ], + "angle": 0, + "content": "Learning. Proceedings of Machine Learning Research, vol. 97, pp. 3030-3039. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/jang19b.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.735, + 0.188 + ], + "angle": 0, + "content": "16. Krizhevsky, A., et al.: Learning multiple layers of features from tiny images (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.188, + 0.787, + 0.242 + ], + "angle": 0, + "content": "17. Kumar, A., Raghunathan, A., Jones, R.M., Ma, T., Liang, P.: Fine-tuning can distort pretrained features and underperform out-of-distribution. In: International Conference on Learning Representations. pp. 1-42 (2022), https://openreview.net/forum?id=UYneFzXSJWh" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.243, + 0.786, + 0.283 + ], + "angle": 0, + "content": "18. Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11), 2278-2324 (1998). https://doi.org/10.1109/5.726791" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.283, + 0.786, + 0.31 + ], + "angle": 0, + "content": "19. Lee, J., Tang, R., Lin, J.: What would elsa do? freezing layers during transformer fine-tuning. arXiv preprint arXiv:1911.03090 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.31, + 0.787, + 0.35 + ], + "angle": 0, + "content": "20. Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.35, + 0.786, + 0.405 + ], + "angle": 0, + "content": "21. Li, X., Xiong, H., Wang, H., Rao, Y., Liu, L., Huan, J.: DELTA: DEEP LEARNING TRANSFER USING FEATURE MAP WITH ATTENTION FOR CONVOLUTIONAL NETWORKS. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=rkgbwsAcYm" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.405, + 0.787, + 0.473 + ], + "angle": 0, + "content": "22. LI, X., Grandvalet, Y., Davoine, F.: Explicit inductive bias for transfer learning with convolutional networks. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 2825-2834. PMLR (10-15 Jul 2018), https://proceedings.mlr.press/v80/1i18a.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.473, + 0.787, + 0.5 + ], + "angle": 0, + "content": "23. Li, Z., Hoiem, D.: Learning without forgetting. IEEE transactions on pattern analysis and machine intelligence 40(12), 2935-2947 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.501, + 0.787, + 0.542 + ], + "angle": 0, + "content": "24. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 10012-10022 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.542, + 0.787, + 0.581 + ], + "angle": 0, + "content": "25. van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(86), 2579-2605 (2008), http://jmlr.org/papers/v9/vandermaaten08a.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.581, + 0.787, + 0.609 + ], + "angle": 0, + "content": "26. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: Do cifar-10 classifiers generalize to cifar-10? arXiv preprint arXiv:1806.00451 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.609, + 0.787, + 0.65 + ], + "angle": 0, + "content": "27. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115(3), 211-252 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.65, + 0.787, + 0.691 + ], + "angle": 0, + "content": "28. Shmelkov, K., Schmid, C., Alahari, K.: Incremental learning of object detectors without catastrophic forgetting. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 3400-3409 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.691, + 0.787, + 0.759 + ], + "angle": 0, + "content": "29. Stickland, A.C., Murray, I.: BERT and PALs: Projected attention layers for efficient adaptation in multi-task learning. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 5986-5995. PMLR (09-15 Jun 2019), https://proceedings.mlrpress/v97/stickland19a.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.787, + 0.786 + ], + "angle": 0, + "content": "30. Tan, C., Sun, F., Kong, T., Zhang, W., Yang, C., Liu, C.: A survey on deep transfer learning. In: International Conference on Artificial Neural Networks. pp. 270-279 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.786, + 0.787, + 0.813 + ], + "angle": 0, + "content": "31. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.787, + 0.84 + ], + "angle": 0, + "content": "32. Wang, M., Deng, W.: Deep visual domain adaptation: A survey. Neurocomputing 312, 135-153 (2018)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.34, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.175 + ], + "angle": 0, + "content": "33. Weiss, K., Khoshgoftaar, T.M., Wang, D.: A survey of transfer learning. Journal of Big data 3(1), 1-40 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.175, + 0.788, + 0.217 + ], + "angle": 0, + "content": "34. Yang, L., Rakin, A.S., Fan, D.: Rep-net: Efficient on-device learning via feature reprogramming. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12277-12286 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.218, + 0.787, + 0.245 + ], + "angle": 0, + "content": "35. Yosinski, J., Clune, J., Bengio, Y., Lipson, H.: How transferable are features in deep neural networks? Advances in neural information processing systems 27 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.313 + ], + "angle": 0, + "content": "36. You, K., Kou, Z., Long, M., Wang, J.: Co-tuning for transfer learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 17236-17246. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper/2020/file/c8067ad1937f728f51288b3eb986afaa-Paper.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.787, + 0.342 + ], + "angle": 0, + "content": "37. Zaken, E.B., Ravfogel, S., Goldberg, Y.: Bitfit: Simple parameter-efficient fine-tuning for transformer-based masked language-models. arXiv preprint arXiv:2106.10199 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.343, + 0.787, + 0.37 + ], + "angle": 0, + "content": "38. Zhou, K., Liu, Z., Qiao, Y., Xiang, T., Loy, C.C.: Domain generalization: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence pp. 1-20 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.787, + 0.397 + ], + "angle": 0, + "content": "39. Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., He, Q.: A comprehensive survey on transfer learning. Proceedings of the IEEE 109(1), 43-76 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.397 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_origin.pdf b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..351f97d090d4fe1a701394fe78c64613d3684afd --- /dev/null +++ b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/a798e658-6ffc-4d63-8fbb-7afef6852096_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d30d5fb96cffc45340a8cb058d7c135020d4be2dd8fef1457291b805f113faa8 +size 1323918 diff --git a/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/full.md b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/full.md new file mode 100644 index 0000000000000000000000000000000000000000..43d878d0ea1830c085e60e0ee988c33ccf8d1c86 --- /dev/null +++ b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/full.md @@ -0,0 +1,304 @@ +# Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization + +Hongjing Niu, Hanting Li, Bin Li, and Feng Zhao + +MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, + +University of Science and Technology of China, Hefei, China + +{sasori,ab828658} $@$ mail.ustc.edu.cn + +{binli, fzhao956}@ustc.edu.cn + +Abstract. Pre-training on large-scale datasets has become a fundamental method for training deep neural networks. Pre-training provides a better set of parameters than random initialization, which reduces the training cost of deep neural networks on the target task. In addition, pre-training also provides a large number of feature representations, which may help improve generalization capabilities. However, this potential advantage has not received enough attention and has been buried by rough fine-tuning. Based on some exploratory experiments, this paper rethinks the fine-tuning process and gives a new perspective on understanding fine-tuning. Moreover, this paper proposes some plug-and-play fine-tuning strategies as alternatives for simple fine-tuning. These fine-tuning strategies all preserve pre-trained features better by creating idling of some neurons, leading to better generalization. + +Keywords: Fine-tuning $\cdot$ Feature preserving $\cdot$ Generalization + +# 1 Introduction + +Pre-training a model on a large dataset before transferring to a target task's training data improves performance (higher accuracy, lower time cost, easier optimization) over training from scratch [30,33]. In recent years, pre-trained models have been widely used in various tasks, including object recognition, object detection, and image segmentation [12]. Pre-training methods emerge in an endless stream, providing more material for the learning paradigm of pre-training + fine-tuning [39]. Furthermore, pre-training is costless in the sense that large-scale pre-trained parameters can be applied to a wide range of tasks and do not need to be specially designed for the target task. Pre-training has almost become an integral part of training deep neural networks. + +Compared with the research on pre-training, how to further adjust the parameters based on pre-training has received less attention. For classification, there are two mainstream approaches, (a) fine-tuning all the model parameters or (b) linear probing, which freezes the feature extractor and trains only the head. Intuitively, fine-tuning all network parameters can improve pre-trained features by adapting them to the specific task, while linear probing freezes these features. Therefore, prior work usually fine-tunes all + +![](images/dec03a35efa33a16e16840cb5465c4b28df44890574eb965f4d760d313b71668.jpg) +Fig. 1: An intuitive explanation of why CIFAR-10 rather than MNIST as downstream task can cause more feature distortion. The rounded rectangle represents the knowledge base of the model. Triangles, squares and circles represent the knowledge learned from ImageNet, MNIST and CIFAR-10 respectively. + +network parameters to get better accuracy. Only when the data is insufficient or the pretraining task matches the target task well, linear probing is more likely to be selected. However, a more extensive range of tuning model parameters also tends to be accompanied by a more considerable degree of distortion to the pre-trained features. To some extent, such fine-tuning strategy turn the target task into the bed of Procrustes. Although the model performs well on the target task, more value that pre-trained features could have is cut off. For example, fine-tuned models tend to generalize poorly compared with linear probed models [17]. + +A pre-trained deep neural network has rich feature representation thanks to the larger pre-training dataset. In addition to being the basis for the same pre-trained model to work on various target tasks, the rich feature representation makes it possible for the model to generalize better on the target task. However, the fine-tuning methods that are widely used today do not care about the distortion or destruction of these features and only pursue accuracy on target tasks. This paper proposes some better alternatives. While ensuring the accuracy of the target task, the proposed fine-tuning strategies also preserve the pre-training features as much as possible. + +First of all, we want to answer such a question. When a model is fine-tuned on the target task, it is inevitable that pre-training knowledge will be forgotten. So what might the degree of the forgetting be related to? Let us start with a simple scenario. For two deep neural networks pre-trained on ImageNet [27], they are fine-tuned on CIFAR-10 [16] and MNIST [18], respectively. Now which of them can keep more memory about ImageNet? Some intuitive factors may be the domain difference between the pre-training task and the target task, the target task's difficulty, the model's scale, the amount of data of the target task, the training method, etc. Based on this idea, CIFAR-10 is more challenging, so a model trained on CIFAR-10 should have more abundant features. Also, the tasks of CIFAR-10 and ImageNet seem closer, so the correlation of features may also be higher. + +The answer may be somewhat unexpected. We found that models fine-tuned on CIFAR-10 forget far more than models fine-tuned on MNIST. This result is interesting and may be somewhat unexpected, but it is not difficult to understand from another perspective. Figure 1 provides an intuitive explanation of why more complex downstream tasks cause more feature distortion. Let us revisit the fine-tuning process from a dynamic perspective. Fine-tuning is a process of forgetting pre-trained knowledge while optimizing the target task. Therefore, the degree of forgetting is highly correlated with the distance to the target task. Moreover, other factors that can affect the degree of forgetting essentially affect this distance. A series of experiments are conducted to evaluate possible factors affecting the degree of forgetting, and the experimental results also support this hypothesis. Based on this hypothesis, this paper proposes alternative strategies for "fine-tuning all at the same time", including "fine-tuning with an assistant" and "temporarily neuron inactivating". + +The contributions of this paper can be summarized in the following points. + +- An interesting phenomenon about the fine-tuning process is discovered, which promotes a rethinking of the fine-tuning process. The new perspective on the fine-tuning process could be instructive for transfer learning. +- Some fine-tuning strategies are proposed, which better preserve pre-trained features and improve the generalization of deep neural networks. These strategies are plug-and-play and easy to generalize. + +# 2 Related Work + +Transfer learning aims at improving the performance on the target domain by transferring knowledge contained in related source domains, and has become a popular and promising area in machine learning [33, 39]. The discussion in this paper is based on a simple transfer learning paradigm, where a model pre-trained on a larger dataset is fine-tuned on the target dataset. In computer vision, pre-training deep neural networks with ImageNet [27] is undoubtedly one of the most widespread applications of transfer learning [12]. In recent years, some new methods have been applied to pretraining [3, 5, 9, 11]. The pre-trained model has lower cost and better feature representation through self-supervision and other methods. Besides pre-training, there are also works [10, 30, 33] focused on downstream training to improve transferability through eliminating domain shifts between upstream and downstream datasets. DELTA [21], a regularized transfer learning framework using feature map with attention, is proposed to reduce the dependence on downstream datasets. Co-Tuning [36] proposed a two-step framework, which reduces the requirements of large amount of data while fully fine-tuning the model. + +Parameter-efficient tuning has received more attention along with the popularization of large-scale models. Compared with tuning all parameters, tuning a small number of parameters can greatly reduce the calculation and storage costs. Much work has been done on fine-tuning language models. Delta-tuning [8] roughly divides these methods into three groups: addition-based [13, 29], specification-based [19, 37], and reparameterization-based methods [1, 14]. For vision models, RepNet [34] exploits a dedicated designed side network. And Conv-Adapter [4] utilized an adapter for the + +transfer learning of ConvNets. We differentiate our research and Parameter-efficient tuning (PET) here. First, in terms of motivation, the focus of PET lies in improving efficiency and reducing data dependency. Our intention is to fully leverage pre-training features to enhance generalization capabilities. Secondly, in terms of methodology, most PET approaches adjust only a portion (usually a small portion) of the model's parameters instead of all of them. While our method temporarily fixes a subset of parameters, it does not mean that they are completely unadjusted. For instance, in our approach, Linear Parameterized Filters (LPF) first adjust the linear layers and then the feature layers. Feature preserving is an important topic in transfer learning. While better-preserved features may not significantly improve performance on the target task, it does improve generalization [17]. A straightforward idea is to introduce a regularization term. By adding some kind of regularization loss between the pre-trained model and the fine-tuned model, the model changes as little as possible after fine-tuning. Such regularization can be applied to model parameters [22] as well as the output of hidden layers [21]. Selectively tuning parameters is also a viable strategy. For example, different weights can be assigned according to the depth of each layer of a deep neural network [35]. A more refined approach is to use meta-learning to learn which features are more worth keeping [15]. In general, most of these studies focus on selecting and preserving features that are more helpful to the target task. On the one hand, improving the performance on the target task is very meaningful. On the other hand, features that do not seem to help the target task are also likely to be worth saving because they may lead to better generalization, which will be discussed further. + +Catastrophic forgetting in continual learning also discusses the preservation of already learned features during learning [2]. Solutions to catastrophic forgetting can be roughly divided into self-refreshing memory approaches [28], knowledge distillation [23] and transfer techniques [20]. These methods may have a good reference for the fine-tuning process. But it should be noted that there are differences between the two settings. In continual learning, each dataset has equal importance. The model must maintain performance on the original data while learning new data. In transfer learning, the model only needs to pursue the performance on the target task, and it is no longer necessary to consider the pre-training task. Continual learning requires higher consistency between tasks, which makes it far less applicable than transfer learning. + +# 3 Methodology + +In this work, we wish to study the distortion of the pre-trained features during the fine-tuning process of deep neural networks. More specifically, we divide a deep neural network into two parts, a feature extractor and a classification head (usually the last linear layer). The research is about how to prevent the feature extractor from being distorted during the fine-tuning, and the classification head is used for evaluating the extracted features. In this section, we will introduce: how to measure the degree of distortion of features and how to reduce this distortion when fine-tuning. + +![](images/912b29cca3def34f7061ce140642b494868ddbd9b5f8e5b172be97370670e022.jpg) +(a) Pre-training + +![](images/791b17962acd823035f0f86544cd46132b4c36f482b7f22bf25e860950e66a9e.jpg) + +![](images/68829bce403f10a63daa7257ec5cec5d73a6c03626cb75f186e1dad330da97d8.jpg) +(c) Linear probing first + +![](images/f497d14c1abf817db0791cdd9d5d54edb5b026a6c6bd5c4576f2785a3a35069a.jpg) +(d) Fine-tuning all +Fig. 2: A visual demonstration of the proposed strategies. We use a simple three-layer structure to represent the deep neural network, and the feedforward process of the neural network is from the bottom to the top. The black connecting lines represent the pre-trained parameters, and the blue dashed connecting lines represent the modified parameters. + +![](images/37d708f8948c9f704883af0571503bf76851467670e04a68b1e2dcff78418c76.jpg) +(b) Linear probing +(e) Temp. neuron inactivating + +![](images/f41f8963e64d857821e9afc79fb148a75c6791062106aca237e79977063deb8f.jpg) +(f) Fine-tuning with an assistant + +# 3.1 Measurement of Feature Distortion + +We set the scene as fine-tuning for an image classification task. Pre-training dataset $\mathbb{D}_p$ consists of image-label pairs $X_{p},Y_{p}$ + +A naive perception about deep neural networks is that the first few layers are a feature extractor $\mathcal{F}$ that looks for a set of features, while the latter layers are a predictor $\mathcal{P}$ that uses those features to perform classification tasks. + +Based on this understanding, we connect a feature extractor $\mathcal{F}$ to a randomly initialized predictors $\mathcal{P}$ , and adjust $\mathcal{P}$ to maximize the accuracy of the model $\mathcal{P} \circ \mathcal{F}$ on $\mathbb{D}$ . The effectiveness of a feature extractor $\mathcal{F}$ for a dataset $\mathbb{D}$ can be expressed by the following formula. + +$$ +\mathscr {E} (\mathcal {F}, \mathbb {D}) = A c c u r a c y \left(\mathcal {P} ^ {\Phi^ {*}} \circ \mathcal {F} (\mathbb {D})\right), \Phi^ {*} = \underset {\Phi} {\arg \min } L o s s \left(\mathcal {P} ^ {\Phi} \circ \mathcal {F} (\mathbb {D})\right). \tag {1} +$$ + +The parameters of $\mathcal{P}$ is represented with $\varPhi$ , and we use $\varPsi$ to represent parameters of $\mathcal{F}$ . + +Of course, the fully connected neural network may not be able to fully express the information about decision-making contained in the feature extractor, which will lead to the fact that the effective information $MI(\mathcal{F}(X), Y)$ retained in the feature extractor is larger ( $MI$ stands for mutual information, and $X, Y$ is the input and ground-truth from $\mathbb{D}$ ). However, the difficulty of extracting effective information should also be used for the evaluation of feature extractors. Therefore, in the case of the same predictor, effectiveness $\mathcal{E}$ is a fair and reasonable indicator for evaluating the performance of feature extractors. + +By comparing the effectiveness of feature extractors before $(\mathcal{F}_0)$ and after $(\mathcal{F}^*)$ fine-tuning on the pre-trained dataset, the distortion of fine-tuning to pre-trained features, + +Algorithm 1 Pre-training and fine-tuning +Input: Pre-training dataset $\mathbb{D}_p$ , fine-tuning dataset $\mathbb{D}_d$ +Parameter: $\varPsi$ $\varPhi$ (parameters of $\mathcal{F}$ and $\mathcal{P}$ +Output: $\varPsi^{*},\varPhi^{*}$ +Initialize: $\varPsi,\varPhi=\varPsi_0,\varPhi_0$ +Pre-train: $\varPsi_p,\varPhi_p=\arg\min_{\varPsi,\varPhi}Loss(\mathcal{P}\circ\mathcal{F}(\mathbb{D}_p))$ +Load parameters: $\varPsi=\varPsi_p$ +Fine-tune: $\varPsi^{*},\varPhi^{*}=\arg\min_{\varPsi,\varPhi}Loss(\mathcal{P}\circ\mathcal{F}(\mathbb{D}_d))$ + +denoted as $\mathcal{D}$ , can be measured. Note that a denominator of zero indicates that the original feature extractor is completely invalid and therefore not relevant for discussion. + +$$ +\mathcal {D} = 1 - \frac {\mathcal {E} \left(\mathcal {F} ^ {*} , \mathbb {D}\right)}{\mathcal {E} \left(\mathcal {F} _ {0} , \mathbb {D}\right)}, \mathcal {E} \left(\mathcal {F} _ {0}, \mathbb {D}\right) \neq 0. \tag {2} +$$ + +# 3.2 Feature-preserving Fine-tuning + +A method for measuring feature distortion is given above. In this section, some fine-tuning strategies are given. Figure 2 provides a visual demonstration of the proposed strategies. These strategies should minimize the degree of feature distortion while ensuring the performance of downstream tasks. + +We denote the dataset for downstream tasks by $\mathbb{D}_d$ . A complete pre-training and fine-tuning paradigm can be expressed as shown in Alg. 1. The methods proposed below are all different implementations of the fine-tuning step. + +Linear Probing First (LPF). An intuitive method is to do linear probing first [17]. First, freeze the feature extractor $\mathcal{F}$ and only fine-tune the predictor $\mathcal{P}$ , and then adjust $\mathcal{F}$ and $\mathcal{P}$ at the same time. Through linear probing, the predictor and the pre-trained feature extractor can be somewhat well matched, reducing the feature extractor's optimization cost, thereby shortening the optimization process. + +Temporarily Neuron Inactivating (TNI). We note that during the fine-tuning of the neural network, all neurons are continuously adjusted to fit the target task, which may be unnecessary. Just tweaking some neurons might well fit the task. The adjustment that occurs in other neurons may simply be because this part of the neuron has not completed the adjustment. To improve this, we propose a strategy called temporarily neuron inactivating. + +Specifically, a smaller fraction of the gradients used to update the model parameters is zeroed out. Thus, neurons that do not need much adjustment are left intact, while other neurons make adjustments to suit the target task. We recommend computing the mean $(\mu)$ and standard deviation $(\sigma)$ of the gradients $(G)$ for each layer in one iteration and then zeroing the fraction of gradients closest to the mean, + +$$ +G = \left\{ \begin{array}{l l} 0, & i f \quad G - \| G - \mu \| _ {1} \leq \delta \sigma ; \\ G, & i f \quad G - \| G - \mu \| _ {1} > \delta \sigma . \end{array} \right. \tag {3} +$$ + +$\delta$ is a hyperparameter, and a larger $\delta$ means that more parameters will not be updated. + +This method of choosing the parameters to be fixed is not unique. Following the same strategy, we can adjust the method with a fixed ratio or other designs. How many parameters are fixed each time and how they are chosen remains to be further explored. + +Fine-tuning with an Assistant (AST). In addition to partially adjusting the parameters, another idea is to reduce the overall variation of the parameters. A possible approach is to use a replicated model as an assistant. First, replicate a pre-trained model as an assistant, then the feature extractors of the two models are connected in parallel, and the predictors share parameters. The parameters of the replica are frozen. The two models are trained alternately (the odd-numbered epochs train the assistant, and the even-numbered epochs train the original model). Keeping an assistant means the predictor will try to apply the pre-trained features directly to the target task. With the help of the assistant, the feature extractor can adapt to the target task with smaller changes. In a way, it can be seen as a dynamic version of linear probing first. Both of them reduce the distortion of the feature extractor with a suitable predictor. + +# 4 Experiments + +# 4.1 Setup + +Evaluation methods. The experiment involves pretraining tasks and downstream tasks. The basic purpose of the experiment is to evaluate: (1) The extent to which pre-trained features are distorted after fine-tuning on downstream tasks; (2) the generalization performance of the fine-tuned model on downstream tasks. Therefore, we evaluate the distortion of pre-trained features (Eq. 2). Since the pre-training task remains unchanged in a experiment, only $\mathcal{E}(\mathcal{F}^*,\mathbb{D})$ , i.e., the accuracy on the pre-training dataset after linear probing is calculated. For the generalization performance on downstream tasks, generalization datasets for the downstream tasks are used. + +Datasets. All the datasets we use are open source datasets, including ImageNet [27], MNIST [18], CIFAR-10 [16], CIFAR-100 [16], CIFAR-10.1 [26], STL-10 [7] and CUB-200-2011 [31]. Among them, ImageNet is a large-scale image dataset with more than 1 million images in 1000 categories and is widely used as a pre-training dataset. CIFAR-10 is a lightweight image classification dataset that contains a total of 60,000 images of small size $(32\times 32)$ in 10 categories. For the experiments in Figure 3a, we preferentially select classes with smaller CIFAR-10 class numbers when sampling partial classes. CIFAR-100 is similar to CIFAR-10 but with 100 classes, while the total number of samples remains at 60,000. For the experiments in Table 1, we selected subclasses of CIFAR-100 to constitute the dataset. Specifically, we take two superclasses each time to form a 10-class classification task. The data for the target task comes from "flowers" and "fruit and vegetables", while the data for the generalization task are from "vehicles1" and "vehicles2". CIFAR-10.1 provides a new test set for CIFAR-10. We use it for testing to measure the generalization of the CIFAR-10 model. STL-10 contains more than 10,000 images in 10 categories similar to CIFAR-10. So we use it as a generalization task with more considerable domain differences. + +Implementation details. We use ResNet-18 for experiments in Section 4.2, and Swin-Transformer-Tiny [24] for Table 5. For rest of the experiments, we use ResNet-50 + +![](images/4058ee524178c5218e125d7dc0de6e14807b268d4c386648117963e3c604098b.jpg) +(a) The extent of preservation of pre-trained features is in- (b) We are aware that as the target task involves distinguish- fluenced by the difficulty of the target task. As the target task ing an increasing number of categories of CIFAR-10 sambecomes increasingly challenging in distinguishing more ples, the number of samples used for fine-tuning also incategories of CIFAR-10 samples, models pre-trained on Im- creases. Therefore, we uniformly sample a certain proportageNet (green) become more difficult to maintain good per tion of samples from each category as a control. The impact formance on ImageNet after fine-tuning on the target task. of different sample quantities has noticeably decreased comIn contrast, models initialized with random weights (blue) pared to different task complexities (a). Both the downward achieve better performance on ImageNet after training on trend of the green line and the upward trend of the blue line the target task. have smaller amplitudes. + +![](images/00a5f33989c08d595407d38d011ee00bae05002a3b3c51b2dff862b8ee01bee0.jpg) + +as the backbone model for the experiments. We use the version provided by PyTorch, and the pre-training parameters of ImageNet are also from PyTorch. Except that the output shape of the "FC" layer may be modified according to the task, other structures remain unchanged. Without special instructions, we use SGD as the optimizer (learning rate 1e-2, momentum 0.9, weight decay 1e-5), the batch size is 16 for ImageNet and 128 for other datasets, and all training is performed for 100 epochs, For the strategy using LPF, Linear probing is performed for 10 epochs, which means that the remaining fine-tuning is performed for 90 epochs. For the fine-tuning with an assistant strategy, half of the epochs are used for the assistant. For the Temporarily Neuron Inactivating strategy, we compute the mean and standard deviation of the gradients of the same layer in each update and zero out the gradients whose difference from the mean is less than the standard deviation. According to our observations, each experiment trains to convergence, and the best-performing model is taken. The code will be open-sourced. + +# 4.2 Distortion of Features + +First, we observe the distortion of pre-trained features during model fine-tuning through a set of experiments. + +We previously introduced a toy example to observe the degree of feature forgetting after ImageNet pre-trained models are fine-tuned on CIFAR-10 and MNIST. We extend this experiment to verify the relationship between the degree of feature forgetting in fine-tuning and the target task. + +We use different subsets of CIFAR-10 as the fine-tuning datasets and test how much the fine-tuned models retain pre-trained features. Models without pre-training are used in the same process as controls. The results are shown in Figure 3a + +The results show that as the target task contains more categories, the accuracy of the control group increases, which means that the model does learn more features. The performance of the experimental group shows an opposite trend to that of the control + +group, which means that when other conditions remain unchanged, the more features to be learned, the more severe the distortion of the pre-trained features. + +We also test the effect of sample size on the results (Figure 3b). The training set is obtained by uniformly sampling from each class. In this way, the distribution is kept unchanged, and the dataset size is reduced. It can be seen that simply changing the size of the training set has little effect on the experimental results. Combining Figure 3a and Figure 3b, it can be concluded that there is a positive correlation between the amount of target features and the distortion of the pre-trained features. The experimental results are consistent with what we observed in the toy experiments. Moreover, after excluding other interfering factors, the principle behind this phenomenon is also more evident. An extreme example might make the process easier to understand. If the training task is empty, neither the common features nor the different features exist. The model does not need to be adjusted, and the pre-trained features are perfectly preserved. + +# 4.3 Preserving Features + +To verify the effect of the proposed feature-preserving fine-tuning method. We pre-train the model on CIFAR-10, fine-tune it on a subset of CIFAR-100 (Target), and verify feature retention again on CIFAR-10. ImageNet is no longer used in this experiment because CIFAR-10 and CIFAR-100 avoid differences unrelated to image content, such as image size; CIFAR-10 has fewer effective features than ImageNet, which makes feature distortion easier to observe. We also test with linear probing on another subset of CIFAR-100 (Unseen), verifying that the retained features are indeed valuable. The results are shown in Table 1. + +Table 1: Preservation of pre-trained features by several strategies. The $\sqrt{}$ indicated that the strategy was adopted. Pre-train represents the dataset used for pre-training, and the results intuitively reflect the retention of features. Unseen represents a dataset that has not been seen in pre-training and fine-tuning stages, and its results reflect generalization ability. + +
StrategiesTesting accuracy (%)
ASTLPFTNITargetPre-trainUnseen
56.44±1.2349.58±0.0743.78±0.23
✓57.14±1.0854.13±0.0647.20±0.17
✓57.36±0.4149.98±0.0846.00±0.19
✓57.92±1.3753.68±0.0845.98±0.45
✓✓56.50±0.9659.30±0.0951.62±0.26
✓✓58.26±0.7454.30±0.0748.02±0.33
✓✓59.40±0.8258.69±0.0649.46±0.39
✓✓✓57.65±0.6958.14±0.1051.30±0.31
+ +Based on the results in Table 1, the following observations can be made. + +- The three strategies tested have better performance on pre-train testing sets, and some strategy combinations can achieve better results. This shows that the proposed strategies are all beneficial for preserving task-related features. +- The three strategies tested have better performance on unseen testing sets. This means that the saved features are not only useful for pre-training tasks or target tasks but may also be helpful for some unseen tasks. +- The performance ranking of the strategies on the two test sets shows a high degree of consistency, indicating that saving more pre-trained features positively affects the generalization ability of the learned features. + +It can be seen that compared with fine-tuning of all parameters, a suitable strategy can make the model retain more features. It should be noted that the above methods will not lose the accuracy of the target task itself. In fact, the accuracy of the target task is higher in most cases. + +It is necessary to remind that in the fine-tuning paradigm, preserving pre-training features is not a hard requirement. However, keeping the pre-trained features may lead to better generalization performance, which is very meaningful. Therefore, in the experiments in Table 1, the performance of the model on the unseen testing set is more practical. + +We conduct t-SNE [25] on the output of the feature extractor to observe the distortion of pre-trained features visually. Figure 4 shows the results of feature dimensionality reduction under four settings, pre-training, fine-tuning all parameters, TNI, and AST + TNI. The experiment is completed under the settings of Table 1, and the features under the three strategies are the output of the feature extractor. + +Table 2: Generalizability under several strategies. Models are pre-trained on CIFAR-10 and fine-tuned on CIFAR-100. We measure the generalization ability of several strategies by observing model performance on different testing sets. + +
StrategiesTesting accuracy (%)
ASTLPFTNICIFAR-10CIFAR-10.1
51.85±0.0740.52±0.25 44.28±0.14
✓54.61±0.1241.50±0.11 45.81±0.13
✓56.54±0.0442.95±0.13 47.27±0.16
✓52.54±0.1141.25±0.13 45.01±0.14
✓✓56.85±0.0644.06±0.16 47.27±0.12
✓✓57.03±0.3444.76±0.12 47.59±0.16
✓✓60.04±0.0547.16±0.05 48.62±0.22
✓✓✓58.05±0.0445.50±0.13 47.50±0.17
+ +It can be seen that there are clear boundaries between the feature classes extracted by the pre-trained model. After fine-tuning, the boundaries between classes become blurred. This situation is improved when fine-tuning strategies such as TNI are used. + +![](images/99390423ac88c910b948af8abcf64a33d88e5484d4f2abb17608587962d6ce1a.jpg) +(a) Pre-training + +![](images/0b16fb8538d2682890f24ca0a44396fdb233b08c42aa6c56c64cbb4cd259368e.jpg) +(b) Fine-tune all + +![](images/3b02fcb40e70332c0700c9934fcf6096dfee13ddb07acd6693b6c09d35d3fc7b.jpg) +(c) TNI + +![](images/da6dff0e524202bdcc2cd72562d852e04dd990c1f0b34c3011160bf27f078e5e.jpg) +(d) AST + TNI +Fig. 4: t-SNE results on CIFAR-10. Dimensionality reduction is performed on the output of the feature extractor obtained by several different fine-tuning strategies. The colors in the figure represent the categories of the samples. It can be seen that after fine-tuning, the cluster boundaries of each category become much blurred. The tsne results corresponding to the strategies with better results in Table 1 are also more discriminative. + +When using the combination of AST+TNI strategy, the distribution of features is very close to the result after only pre-training. Even the best t-SNE results are significantly different from those before fine-tuning. This is reasonable because the results shown in Table 1 show that the current optimal strategy is only $59.3\%$ accurate on CIFAR-10, while the accuracy of the model before fine-tuning can exceed $90\%$ . + +# 4.4 Downstream Classification + +We apply the method to more challenging fine-grained classification tasks to test the performance of our tuning strategies on downstream classification tasks. Table 3 shows the performance of our approaches and other transfer learning methods on CUB-200-2011, a widely used fine-grained classification dataset. It can be seen that for all the tested sampling rates, the proposed strategies can achieve comparable or even better performance. Using the proposed strategies for tuning will not damage the performance + +on downstream classification tasks, which is consistent with the conclusions drawn in previous experiments. + +Table 3: Accuracy on CUB-200-2011. The best results are in bold faces. † results are from [36]. + +
MethodSampling Rates
15%30%50%100%
FT†45.2559.6870.1278.01
AST45.5158.1169.8377.42
LPF45.7062.4270.5679.63
TNI46.3862.0371.1679.25
L2SP† [22]45.0857.7869.4778.44
DELTA† [21]46.8360.3771.3878.63
BSS† [6]47.7463.3872.5678.85
CoTuning† [36]52.5866.4774.6481.24
+ +# 4.5 Generalization + +From the previous experiment, it can be seen that several of the proposed fine-tuning strategies are better than fine-tuning all parameters directly. Moreover, several strategies can be nested for better results. + +Following the previous experimental procedure, we use CIFAR-10 as the pre-train task and CIFAR-100 as the target task. In addition to performance on the target task, we further test two other testing sets to evaluate the value of these strategies for generalization. For STL-10, we performed linear probing, and for CIFAR10.1, we did not perform additional operations since the training set is the same. The results are shown in Table 2. + +The following observations can be made based on the results in Table 1. Models that better preserve pre-trained features also have better generalization performance. Moreover, the generalization improvement does not necessarily require extremely high similarity between distributions. The strategies in this paper are all plug-and-play and hardly introduce additional training costs but significantly improve the generalization performance of the model. Preserving the features of the pre-trained model as much as possible is a relatively novel way to improve the generalization of deep neural networks. + +# 4.6 Broader Application Scenarios + +Although supervised learning on ImageNet is the most widely used pre-training method, many other valuable pre-training methods are also available. Estimated from the design idea, the proposed fine-tuning strategies proposed in this paper should apply to various pre-trained models. In addition to supervised learning, we use the SwAV [3] as a pretraining method and repeat the previous experiments. SwAV is a simple and efficient + +self-supervised learning method that realizes feature learning through comparison and clustering. + +Table 4: The performance of the proposed strategies with SwAV pre-trained parameters. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10. + +
StrategiesTesting set (%)
AST LPF TNISelf-supervised
79.29±1.31
✓79.74±1.04
✓81.39±0.95
✓80.86±0.69
✓✓79.66±1.57
✓81.55±0.98
✓✓81.68±1.59
✓✓81.56±0.76
+ +Table 5: The performance of the proposed strategies on Swin-Transformer. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10. + +
StrategiesTesting set (%)
ASTLPF TNISwin-T
79.23±0.73
✓79.67±0.86
✓80.98±1.09
79.84±1.64
✓✓81.14±1.15
✓82.29±1.72
✓82.05±0.91
✓✓82.04±1.22
+ +We conduct experiments on the popular Swin-Transformer [24] to observe the effect of fine-tuning strategies under different network structures. The model structure is consistent with the "swin_t" provided by PyTorch, and the pre-trained parameters is provided by PyTorch. The results are shown in Table 5. + +In both experiments, we use ImageNet pre-trained parameters and fine-tune the feature extractor on CIFAR-10. Then linear probing is conducted on ImageNet to measure the preservation of pre-trained features. + +According to Table 4 and Table 5, the proposed strategies proposed can be applied to different pre-training methods and different model structures. + +# 5 Discussion + +# 5.1 Rethinking Fine-tuning + +This paper begins with an interesting phenomenon. A task that seems to require more features may instead allow the fine-tuned model to learn fewer features. The phenomenon is contrary to the first reaction of most people, but this phenomenon is more like a brain teasier that is easy to understand from another angle. A common understanding about the pre-training & fine-tuning process is that how much the pre-trained features can be retained depends on the commonality of the target and pre-training tasks. We propose that how much pre-trained features are lost depends on the differences between the target and pre-training tasks might be a better understanding. + +From this perspective, pre-training does more than provide a better initial parameter to make the optimization process easier. More importantly, pre-training allows the + +model to store a large number of features, most of which may not be helpful for the target task. However, they may help improve the generalization performance. Moreover, obtaining this generalization performance is almost cost-free, neither introducing high computational costs nor degrading the model's performance on the target task. + +# 5.2 Fine-tuning Strategy and Generalization + +Three fine-tuning strategies are presented in this paper, all of which share the same starting point, i.e. to save the pre-trained feature extractor as much as possible. In general, the mechanism of all three strategies is to create partial idling of neurons. The idea of AST and LPF is relatively close; that is, the feature extractor can reduce the degree of distortion through a suitable predictor, and based on the observation of deep neural networks, it can be further extended to more layers. TNI operates at the neuron level, which is more granular and may have a higher ceiling. We also note that the optimal policy combination may differ in experimental scenarios. Because these three strategies have overlapping parts, they may interfere with each other when used in combination. The fine-tuning strategy is not carefully designed in this paper, but several simple strategies have also achieved significant improvements. + +Regarding generalization, we observed a high correlation between the retention of pre-trained features and the generalization performance. However, the scope of application of this correlation and the specific form remains to be studied. We only test generalization performance on some tasks with relatively small domain differences. For complex scenarios, such as domain adaptation [32], and domain generalization [38]. + +# 6 Conclusion + +This paper presents a interesting phenomenon that the negative correlation between the complexity of the fine-tuning task and the degree of retention of pre-trained features. Based on the phenomenon, this paper rethinks the execution process of the fine-tuning paradigm and provides a reasonable explanation for this phenomenon from a dynamic perspective. Further, based on this understanding of the fine-tuning process, this paper proposes some plug-and-play fine-tuning methods to better protect the pre-trained features from being distorted. A series of experiments demonstrate that the proposed strategy can reduce the distortion of pre-trained features. Moreover, these methods also have a positive effect on improving the generalization performance of the model. Finally, some potentially valuable research directions are discussed further. + +# Acknowledgements + +This work was supported by the National Natural Science Foundation of China under Grants U19B2044 and the Anhui Provincial Natural Science Foundation under Grant 2108085UD12. We acknowledge the support of GPU cluster built by MCC Lab of Information Science and Technology Institution, USTC. + +# References + +1. Aghajanyan, A., Gupta, S., Zettlemoyer, L.: Intrinsic dimensionality explains the effectiveness of language model fine-tuning. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 7319-7328 (2021) +2. Awasthi, A., Sarawagi, S.: Continual learning with neural networks: A review. In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data. pp. 362-365 (2019) +3. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems 33, 9912-9924 (2020) +4. Chen, H., Tao, R., Zhang, H., Wang, Y., Ye, W., Wang, J., Hu, G., Savvides, M.: Conv-adapter: Exploring parameter efficient transfer learning for convnets. arXiv preprint arXiv:2208.07463 (2022) +5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607 (2020) +6. Chen, X., Wang, S., Fu, B., Long, M., Wang, J.: Catastrophic forgetting meets negative transfer: Batch spectral shrinkage for safe transfer learning. In: Wallach, H., Larochelle, H., Beygelzimer, A., d'Alché-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 32. Curran Associates, Inc. (2019), https://proceedings.neurips.cc/paper/2019/file/c6bfff625bdd03933992c9d4db0c6bbe45-Paper.pdf +7. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223 (2011) +8. Ding, N., Qin, Y., Yang, G., Wei, F., Yang, Z., Su, Y., Hu, S., Chen, Y., Chan, C.M., Chen, W., et al.: Delta tuning: A comprehensive study of parameter efficient methods for pre-trained language models. arXiv preprint arXiv:2203.06904 (2022) +9. Feng, Y., Jiang, J., Tang, M., Jin, R., Gao, Y.: Rethinking supervised pre-training for better downstream transferring. In: International Conference on Learning Representations. pp. 1-22 (2022), https://openreview.net/forum?id=Jjcv9MTqhcq +0. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32th International Conference on Machine Learning. pp. 1180-1189 (2015) +1. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020) +2. He, K., Girshick, R., Dollar, P.: Rethinking imagenet pre-training. In: 2019 IEEE/CVF International Conference on Computer Vision. pp. 4917-4926 (2019). https://doi.org/10.1109/ICCV.2019.00502 +3. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for NLP. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 2790-2799. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/houlsby19a.html +4. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021) +5. Jang, Y., Lee, H., Hwang, S.J., Shin, J.: Learning what and where to transfer. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine + +Learning. Proceedings of Machine Learning Research, vol. 97, pp. 3030-3039. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/jang19b.html +16. Krizhevsky, A., et al.: Learning multiple layers of features from tiny images (2009) +17. Kumar, A., Raghunathan, A., Jones, R.M., Ma, T., Liang, P.: Fine-tuning can distort pretrained features and underperform out-of-distribution. In: International Conference on Learning Representations. pp. 1-42 (2022), https://openreview.net/forum?id=UYneFzXSJWh +18. Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11), 2278-2324 (1998). https://doi.org/10.1109/5.726791 +19. Lee, J., Tang, R., Lin, J.: What would elsa do? freezing layers during transformer fine-tuning. arXiv preprint arXiv:1911.03090 (2019) +20. Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. Advances in neural information processing systems 30 (2017) +21. Li, X., Xiong, H., Wang, H., Rao, Y., Liu, L., Huan, J.: DELTA: DEEP LEARNING TRANSFER USING FEATURE MAP WITH ATTENTION FOR CONVOLUTIONAL NETWORKS. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=rkgbwsAcYm +22. LI, X., Grandvalet, Y., Davoine, F.: Explicit inductive bias for transfer learning with convolutional networks. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 2825-2834. PMLR (10-15 Jul 2018), https://proceedings.mlr.press/v80/1i18a.html +23. Li, Z., Hoiem, D.: Learning without forgetting. IEEE transactions on pattern analysis and machine intelligence 40(12), 2935-2947 (2017) +24. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 10012-10022 (2021) +25. van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(86), 2579-2605 (2008), http://jmlr.org/papers/v9/vandermaaten08a.html +26. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: Do cifar-10 classifiers generalize to cifar-10? arXiv preprint arXiv:1806.00451 (2018) +27. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115(3), 211-252 (2015) +28. Shmelkov, K., Schmid, C., Alahari, K.: Incremental learning of object detectors without catastrophic forgetting. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 3400-3409 (2017) +29. Stickland, A.C., Murray, I.: BERT and PALs: Projected attention layers for efficient adaptation in multi-task learning. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 5986-5995. PMLR (09-15 Jun 2019), https://proceedings.mlrpress/v97/stickland19a.html +30. Tan, C., Sun, F., Kong, T., Zhang, W., Yang, C., Liu, C.: A survey on deep transfer learning. In: International Conference on Artificial Neural Networks. pp. 270-279 (2018) +31. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) +32. Wang, M., Deng, W.: Deep visual domain adaptation: A survey. Neurocomputing 312, 135-153 (2018) + +33. Weiss, K., Khoshgoftaar, T.M., Wang, D.: A survey of transfer learning. Journal of Big data 3(1), 1-40 (2016) +34. Yang, L., Rakin, A.S., Fan, D.: Rep-net: Efficient on-device learning via feature reprogramming. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12277-12286 (2022) +35. Yosinski, J., Clune, J., Bengio, Y., Lipson, H.: How transferable are features in deep neural networks? Advances in neural information processing systems 27 (2014) +36. You, K., Kou, Z., Long, M., Wang, J.: Co-tuning for transfer learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 17236-17246. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper/2020/file/c8067ad1937f728f51288b3eb986afaa-Paper.pdf +37. Zaken, E.B., Ravfogel, S., Goldberg, Y.: Bitfit: Simple parameter-efficient fine-tuning for transformer-based masked language-models. arXiv preprint arXiv:2106.10199 (2021) +38. Zhou, K., Liu, Z., Qiao, Y., Xiang, T., Loy, C.C.: Domain generalization: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence pp. 1-20 (2022) +39. Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., He, Q.: A comprehensive survey on transfer learning. Proceedings of the IEEE 109(1), 43-76 (2020) \ No newline at end of file diff --git a/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/images.zip b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..b127f455c093a99fe2fea2f2d1fe93edfad53cfb --- /dev/null +++ b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2a3ee4e2e78aff753407aa4aff5617e8c860507bef016e7544087c1e0ace52f6 +size 445812 diff --git a/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/layout.json b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..9420348a440a5c15a6eccc6032fd263808534ad1 --- /dev/null +++ b/2024/Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization/layout.json @@ -0,0 +1,8331 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 150, + 111, + 465, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 150, + 111, + 465, + 148 + ], + "spans": [ + { + "bbox": [ + 150, + 111, + 465, + 148 + ], + "type": "text", + "content": "Idling Neurons, Appropriately Lenient Workload During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 189, + 168, + 424, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 189, + 168, + 424, + 182 + ], + "spans": [ + { + "bbox": [ + 189, + 168, + 424, + 182 + ], + "type": "text", + "content": "Hongjing Niu, Hanting Li, Bin Li, and Feng Zhao" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 167, + 190, + 446, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 190, + 446, + 201 + ], + "spans": [ + { + "bbox": [ + 167, + 190, + 446, + 201 + ], + "type": "text", + "content": "MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition," + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 195, + 201, + 418, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 195, + 201, + 418, + 213 + ], + "spans": [ + { + "bbox": [ + 195, + 201, + 418, + 213 + ], + "type": "text", + "content": "University of Science and Technology of China, Hefei, China" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 211, + 213, + 402, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 213, + 402, + 223 + ], + "spans": [ + { + "bbox": [ + 211, + 213, + 402, + 223 + ], + "type": "text", + "content": "{sasori,ab828658}" + }, + { + "bbox": [ + 211, + 213, + 402, + 223 + ], + "type": "inline_equation", + "content": "@" + }, + { + "bbox": [ + 211, + 213, + 402, + 223 + ], + "type": "text", + "content": " mail.ustc.edu.cn" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 229, + 224, + 386, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 224, + 386, + 233 + ], + "spans": [ + { + "bbox": [ + 229, + 224, + 386, + 233 + ], + "type": "text", + "content": "{binli, fzhao956}@ustc.edu.cn" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 266, + 455, + 397 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 266, + 455, + 397 + ], + "spans": [ + { + "bbox": [ + 159, + 266, + 455, + 397 + ], + "type": "text", + "content": "Abstract. Pre-training on large-scale datasets has become a fundamental method for training deep neural networks. Pre-training provides a better set of parameters than random initialization, which reduces the training cost of deep neural networks on the target task. In addition, pre-training also provides a large number of feature representations, which may help improve generalization capabilities. However, this potential advantage has not received enough attention and has been buried by rough fine-tuning. Based on some exploratory experiments, this paper rethinks the fine-tuning process and gives a new perspective on understanding fine-tuning. Moreover, this paper proposes some plug-and-play fine-tuning strategies as alternatives for simple fine-tuning. These fine-tuning strategies all preserve pre-trained features better by creating idling of some neurons, leading to better generalization." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 160, + 408, + 385, + 419 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 408, + 385, + 419 + ], + "spans": [ + { + "bbox": [ + 160, + 408, + 385, + 419 + ], + "type": "text", + "content": "Keywords: Fine-tuning " + }, + { + "bbox": [ + 160, + 408, + 385, + 419 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 408, + 385, + 419 + ], + "type": "text", + "content": " Feature preserving " + }, + { + "bbox": [ + 160, + 408, + 385, + 419 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 408, + 385, + 419 + ], + "type": "text", + "content": " Generalization" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 441, + 218, + 453 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 441, + 218, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 441, + 218, + 453 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 466, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 466, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 466, + 482, + 574 + ], + "type": "text", + "content": "Pre-training a model on a large dataset before transferring to a target task's training data improves performance (higher accuracy, lower time cost, easier optimization) over training from scratch [30,33]. In recent years, pre-trained models have been widely used in various tasks, including object recognition, object detection, and image segmentation [12]. Pre-training methods emerge in an endless stream, providing more material for the learning paradigm of pre-training + fine-tuning [39]. Furthermore, pre-training is costless in the sense that large-scale pre-trained parameters can be applied to a wide range of tasks and do not need to be specially designed for the target task. Pre-training has almost become an integral part of training deep neural networks." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "content": "Compared with the research on pre-training, how to further adjust the parameters based on pre-training has received less attention. For classification, there are two mainstream approaches, (a) fine-tuning all the model parameters or (b) linear probing, which freezes the feature extractor and trains only the head. Intuitively, fine-tuning all network parameters can improve pre-trained features by adapting them to the specific task, while linear probing freezes these features. Therefore, prior work usually fine-tunes all" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 135, + 654, + 225, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 654, + 225, + 665 + ], + "spans": [ + { + "bbox": [ + 135, + 654, + 225, + 665 + ], + "type": "text", + "content": "* Corresponding author" + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 202, + 120, + 411, + 260 + ], + "blocks": [ + { + "bbox": [ + 202, + 120, + 411, + 260 + ], + "lines": [ + { + "bbox": [ + 202, + 120, + 411, + 260 + ], + "spans": [ + { + "bbox": [ + 202, + 120, + 411, + 260 + ], + "type": "image", + "image_path": "dec03a35efa33a16e16840cb5465c4b28df44890574eb965f4d760d313b71668.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 268, + 482, + 313 + ], + "lines": [ + { + "bbox": [ + 130, + 268, + 482, + 313 + ], + "spans": [ + { + "bbox": [ + 130, + 268, + 482, + 313 + ], + "type": "text", + "content": "Fig. 1: An intuitive explanation of why CIFAR-10 rather than MNIST as downstream task can cause more feature distortion. The rounded rectangle represents the knowledge base of the model. Triangles, squares and circles represent the knowledge learned from ImageNet, MNIST and CIFAR-10 respectively." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 339, + 482, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 339, + 482, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 339, + 482, + 434 + ], + "type": "text", + "content": "network parameters to get better accuracy. Only when the data is insufficient or the pretraining task matches the target task well, linear probing is more likely to be selected. However, a more extensive range of tuning model parameters also tends to be accompanied by a more considerable degree of distortion to the pre-trained features. To some extent, such fine-tuning strategy turn the target task into the bed of Procrustes. Although the model performs well on the target task, more value that pre-trained features could have is cut off. For example, fine-tuned models tend to generalize poorly compared with linear probed models [17]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 437, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 533 + ], + "type": "text", + "content": "A pre-trained deep neural network has rich feature representation thanks to the larger pre-training dataset. In addition to being the basis for the same pre-trained model to work on various target tasks, the rich feature representation makes it possible for the model to generalize better on the target task. However, the fine-tuning methods that are widely used today do not care about the distortion or destruction of these features and only pursue accuracy on target tasks. This paper proposes some better alternatives. While ensuring the accuracy of the target task, the proposed fine-tuning strategies also preserve the pre-training features as much as possible." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": "First of all, we want to answer such a question. When a model is fine-tuned on the target task, it is inevitable that pre-training knowledge will be forgotten. So what might the degree of the forgetting be related to? Let us start with a simple scenario. For two deep neural networks pre-trained on ImageNet [27], they are fine-tuned on CIFAR-10 [16] and MNIST [18], respectively. Now which of them can keep more memory about ImageNet? Some intuitive factors may be the domain difference between the pre-training task and the target task, the target task's difficulty, the model's scale, the amount of data of the target task, the training method, etc. Based on this idea, CIFAR-10 is more challenging, so a model trained on CIFAR-10 should have more abundant features. Also, the tasks of CIFAR-10 and ImageNet seem closer, so the correlation of features may also be higher." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 270 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 270 + ], + "type": "text", + "content": "The answer may be somewhat unexpected. We found that models fine-tuned on CIFAR-10 forget far more than models fine-tuned on MNIST. This result is interesting and may be somewhat unexpected, but it is not difficult to understand from another perspective. Figure 1 provides an intuitive explanation of why more complex downstream tasks cause more feature distortion. Let us revisit the fine-tuning process from a dynamic perspective. Fine-tuning is a process of forgetting pre-trained knowledge while optimizing the target task. Therefore, the degree of forgetting is highly correlated with the distance to the target task. Moreover, other factors that can affect the degree of forgetting essentially affect this distance. A series of experiments are conducted to evaluate possible factors affecting the degree of forgetting, and the experimental results also support this hypothesis. Based on this hypothesis, this paper proposes alternative strategies for \"fine-tuning all at the same time\", including \"fine-tuning with an assistant\" and \"temporarily neuron inactivating\"." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 147, + 271, + 447, + 283 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 271, + 447, + 283 + ], + "spans": [ + { + "bbox": [ + 147, + 271, + 447, + 283 + ], + "type": "text", + "content": "The contributions of this paper can be summarized in the following points." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 290, + 479, + 360 + ], + "type": "list", + "angle": 0, + "index": 6, + "blocks": [ + { + "bbox": [ + 138, + 290, + 479, + 323 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 290, + 479, + 323 + ], + "spans": [ + { + "bbox": [ + 138, + 290, + 479, + 323 + ], + "type": "text", + "content": "- An interesting phenomenon about the fine-tuning process is discovered, which promotes a rethinking of the fine-tuning process. The new perspective on the fine-tuning process could be instructive for transfer learning." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 326, + 479, + 360 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 326, + 479, + 360 + ], + "spans": [ + { + "bbox": [ + 138, + 326, + 479, + 360 + ], + "type": "text", + "content": "- Some fine-tuning strategies are proposed, which better preserve pre-trained features and improve the generalization of deep neural networks. These strategies are plug-and-play and easy to generalize." + } + ] + } + ], + "index": 5 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 378, + 224, + 391 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 378, + 224, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 378, + 224, + 391 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 402, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 582 + ], + "type": "text", + "content": "Transfer learning aims at improving the performance on the target domain by transferring knowledge contained in related source domains, and has become a popular and promising area in machine learning [33, 39]. The discussion in this paper is based on a simple transfer learning paradigm, where a model pre-trained on a larger dataset is fine-tuned on the target dataset. In computer vision, pre-training deep neural networks with ImageNet [27] is undoubtedly one of the most widespread applications of transfer learning [12]. In recent years, some new methods have been applied to pretraining [3, 5, 9, 11]. The pre-trained model has lower cost and better feature representation through self-supervision and other methods. Besides pre-training, there are also works [10, 30, 33] focused on downstream training to improve transferability through eliminating domain shifts between upstream and downstream datasets. DELTA [21], a regularized transfer learning framework using feature map with attention, is proposed to reduce the dependence on downstream datasets. Co-Tuning [36] proposed a two-step framework, which reduces the requirements of large amount of data while fully fine-tuning the model." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Parameter-efficient tuning has received more attention along with the popularization of large-scale models. Compared with tuning all parameters, tuning a small number of parameters can greatly reduce the calculation and storage costs. Much work has been done on fine-tuning language models. Delta-tuning [8] roughly divides these methods into three groups: addition-based [13, 29], specification-based [19, 37], and reparameterization-based methods [1, 14]. For vision models, RepNet [34] exploits a dedicated designed side network. And Conv-Adapter [4] utilized an adapter for the" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 378 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 378 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 378 + ], + "type": "text", + "content": "transfer learning of ConvNets. We differentiate our research and Parameter-efficient tuning (PET) here. First, in terms of motivation, the focus of PET lies in improving efficiency and reducing data dependency. Our intention is to fully leverage pre-training features to enhance generalization capabilities. Secondly, in terms of methodology, most PET approaches adjust only a portion (usually a small portion) of the model's parameters instead of all of them. While our method temporarily fixes a subset of parameters, it does not mean that they are completely unadjusted. For instance, in our approach, Linear Parameterized Filters (LPF) first adjust the linear layers and then the feature layers. Feature preserving is an important topic in transfer learning. While better-preserved features may not significantly improve performance on the target task, it does improve generalization [17]. A straightforward idea is to introduce a regularization term. By adding some kind of regularization loss between the pre-trained model and the fine-tuned model, the model changes as little as possible after fine-tuning. Such regularization can be applied to model parameters [22] as well as the output of hidden layers [21]. Selectively tuning parameters is also a viable strategy. For example, different weights can be assigned according to the depth of each layer of a deep neural network [35]. A more refined approach is to use meta-learning to learn which features are more worth keeping [15]. In general, most of these studies focus on selecting and preserving features that are more helpful to the target task. On the one hand, improving the performance on the target task is very meaningful. On the other hand, features that do not seem to help the target task are also likely to be worth saving because they may lead to better generalization, which will be discussed further." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 383, + 481, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 383, + 481, + 502 + ], + "spans": [ + { + "bbox": [ + 133, + 383, + 481, + 502 + ], + "type": "text", + "content": "Catastrophic forgetting in continual learning also discusses the preservation of already learned features during learning [2]. Solutions to catastrophic forgetting can be roughly divided into self-refreshing memory approaches [28], knowledge distillation [23] and transfer techniques [20]. These methods may have a good reference for the fine-tuning process. But it should be noted that there are differences between the two settings. In continual learning, each dataset has equal importance. The model must maintain performance on the original data while learning new data. In transfer learning, the model only needs to pursue the performance on the target task, and it is no longer necessary to consider the pre-training task. Continual learning requires higher consistency between tasks, which makes it far less applicable than transfer learning." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 539, + 219, + 552 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 539, + 219, + 552 + ], + "spans": [ + { + "bbox": [ + 133, + 539, + 219, + 552 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 582, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 582, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 582, + 481, + 665 + ], + "type": "text", + "content": "In this work, we wish to study the distortion of the pre-trained features during the fine-tuning process of deep neural networks. More specifically, we divide a deep neural network into two parts, a feature extractor and a classification head (usually the last linear layer). The research is about how to prevent the feature extractor from being distorted during the fine-tuning, and the classification head is used for evaluating the extracted features. In this section, we will introduce: how to measure the degree of distortion of features and how to reduce this distortion when fine-tuning." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 114, + 227, + 194 + ], + "blocks": [ + { + "bbox": [ + 143, + 114, + 227, + 194 + ], + "lines": [ + { + "bbox": [ + 143, + 114, + 227, + 194 + ], + "spans": [ + { + "bbox": [ + 143, + 114, + 227, + 194 + ], + "type": "image", + "image_path": "912b29cca3def34f7061ce140642b494868ddbd9b5f8e5b172be97370670e022.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 163, + 195, + 208, + 204 + ], + "lines": [ + { + "bbox": [ + 163, + 195, + 208, + 204 + ], + "spans": [ + { + "bbox": [ + 163, + 195, + 208, + 204 + ], + "type": "text", + "content": "(a) Pre-training" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 227, + 114, + 309, + 194 + ], + "blocks": [ + { + "bbox": [ + 227, + 114, + 309, + 194 + ], + "lines": [ + { + "bbox": [ + 227, + 114, + 309, + 194 + ], + "spans": [ + { + "bbox": [ + 227, + 114, + 309, + 194 + ], + "type": "image", + "image_path": "791b17962acd823035f0f86544cd46132b4c36f482b7f22bf25e860950e66a9e.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 309, + 114, + 470, + 194 + ], + "blocks": [ + { + "bbox": [ + 309, + 114, + 470, + 194 + ], + "lines": [ + { + "bbox": [ + 309, + 114, + 470, + 194 + ], + "spans": [ + { + "bbox": [ + 309, + 114, + 470, + 194 + ], + "type": "image", + "image_path": "68829bce403f10a63daa7257ec5cec5d73a6c03626cb75f186e1dad330da97d8.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 355, + 195, + 421, + 204 + ], + "lines": [ + { + "bbox": [ + 355, + 195, + 421, + 204 + ], + "spans": [ + { + "bbox": [ + 355, + 195, + 421, + 204 + ], + "type": "text", + "content": "(c) Linear probing first" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 143, + 206, + 226, + 290 + ], + "blocks": [ + { + "bbox": [ + 143, + 206, + 226, + 290 + ], + "lines": [ + { + "bbox": [ + 143, + 206, + 226, + 290 + ], + "spans": [ + { + "bbox": [ + 143, + 206, + 226, + 290 + ], + "type": "image", + "image_path": "f497d14c1abf817db0791cdd9d5d54edb5b026a6c6bd5c4576f2785a3a35069a.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 158, + 291, + 212, + 299 + ], + "lines": [ + { + "bbox": [ + 158, + 291, + 212, + 299 + ], + "spans": [ + { + "bbox": [ + 158, + 291, + 212, + 299 + ], + "type": "text", + "content": "(d) Fine-tuning all" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 309, + 482, + 354 + ], + "lines": [ + { + "bbox": [ + 131, + 309, + 482, + 354 + ], + "spans": [ + { + "bbox": [ + 131, + 309, + 482, + 354 + ], + "type": "text", + "content": "Fig. 2: A visual demonstration of the proposed strategies. We use a simple three-layer structure to represent the deep neural network, and the feedforward process of the neural network is from the bottom to the top. The black connecting lines represent the pre-trained parameters, and the blue dashed connecting lines represent the modified parameters." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 227, + 205, + 309, + 285 + ], + "blocks": [ + { + "bbox": [ + 240, + 195, + 294, + 205 + ], + "lines": [ + { + "bbox": [ + 240, + 195, + 294, + 205 + ], + "spans": [ + { + "bbox": [ + 240, + 195, + 294, + 205 + ], + "type": "text", + "content": "(b) Linear probing" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 227, + 205, + 309, + 285 + ], + "lines": [ + { + "bbox": [ + 227, + 205, + 309, + 285 + ], + "spans": [ + { + "bbox": [ + 227, + 205, + 309, + 285 + ], + "type": "image", + "image_path": "37d708f8948c9f704883af0571503bf76851467670e04a68b1e2dcff78418c76.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 227, + 285, + 306, + 300 + ], + "lines": [ + { + "bbox": [ + 227, + 285, + 306, + 300 + ], + "spans": [ + { + "bbox": [ + 227, + 285, + 306, + 300 + ], + "type": "text", + "content": "(e) Temp. neuron inactivating" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 309, + 206, + 470, + 290 + ], + "blocks": [ + { + "bbox": [ + 309, + 206, + 470, + 290 + ], + "lines": [ + { + "bbox": [ + 309, + 206, + 470, + 290 + ], + "spans": [ + { + "bbox": [ + 309, + 206, + 470, + 290 + ], + "type": "image", + "image_path": "f41f8963e64d857821e9afc79fb148a75c6791062106aca237e79977063deb8f.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 343, + 291, + 434, + 300 + ], + "lines": [ + { + "bbox": [ + 343, + 291, + 434, + 300 + ], + "spans": [ + { + "bbox": [ + 343, + 291, + 434, + 300 + ], + "type": "text", + "content": "(f) Fine-tuning with an assistant" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 376, + 308, + 387 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 376, + 308, + 387 + ], + "spans": [ + { + "bbox": [ + 131, + 376, + 308, + 387 + ], + "type": "text", + "content": "3.1 Measurement of Feature Distortion" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 394, + 480, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 394, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 130, + 394, + 480, + 418 + ], + "type": "text", + "content": "We set the scene as fine-tuning for an image classification task. Pre-training dataset " + }, + { + "bbox": [ + 130, + 394, + 480, + 418 + ], + "type": "inline_equation", + "content": "\\mathbb{D}_p" + }, + { + "bbox": [ + 130, + 394, + 480, + 418 + ], + "type": "text", + "content": " consists of image-label pairs " + }, + { + "bbox": [ + 130, + 394, + 480, + 418 + ], + "type": "inline_equation", + "content": "X_{p},Y_{p}" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 418, + 480, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 480, + 453 + ], + "type": "text", + "content": "A naive perception about deep neural networks is that the first few layers are a feature extractor " + }, + { + "bbox": [ + 130, + 418, + 480, + 453 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 130, + 418, + 480, + 453 + ], + "type": "text", + "content": " that looks for a set of features, while the latter layers are a predictor " + }, + { + "bbox": [ + 130, + 418, + 480, + 453 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 130, + 418, + 480, + 453 + ], + "type": "text", + "content": " that uses those features to perform classification tasks." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": "Based on this understanding, we connect a feature extractor " + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": " to a randomly initialized predictors " + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": ", and adjust " + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": " to maximize the accuracy of the model " + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "inline_equation", + "content": "\\mathcal{P} \\circ \\mathcal{F}" + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": " on " + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "inline_equation", + "content": "\\mathbb{D}" + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": ". The effectiveness of a feature extractor " + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": " for a dataset " + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "inline_equation", + "content": "\\mathbb{D}" + }, + { + "bbox": [ + 130, + 453, + 481, + 502 + ], + "type": "text", + "content": " can be expressed by the following formula." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 160, + 507, + 481, + 529 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 507, + 481, + 529 + ], + "spans": [ + { + "bbox": [ + 160, + 507, + 481, + 529 + ], + "type": "interline_equation", + "content": "\\mathscr {E} (\\mathcal {F}, \\mathbb {D}) = A c c u r a c y \\left(\\mathcal {P} ^ {\\Phi^ {*}} \\circ \\mathcal {F} (\\mathbb {D})\\right), \\Phi^ {*} = \\underset {\\Phi} {\\arg \\min } L o s s \\left(\\mathcal {P} ^ {\\Phi} \\circ \\mathcal {F} (\\mathbb {D})\\right). \\tag {1}", + "image_path": "5956d9a3eeffb9b890e1f66e30a020c4c8572104521a5ff065c6588789becb55.jpg" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "text", + "content": "The parameters of " + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "text", + "content": " is represented with " + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "inline_equation", + "content": "\\varPhi" + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "text", + "content": ", and we use " + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "inline_equation", + "content": "\\varPsi" + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "text", + "content": " to represent parameters of " + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 131, + 533, + 480, + 545 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "text", + "content": "Of course, the fully connected neural network may not be able to fully express the information about decision-making contained in the feature extractor, which will lead to the fact that the effective information " + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "inline_equation", + "content": "MI(\\mathcal{F}(X), Y)" + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "text", + "content": " retained in the feature extractor is larger (" + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "inline_equation", + "content": "MI" + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "text", + "content": " stands for mutual information, and " + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "inline_equation", + "content": "X, Y" + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "text", + "content": " is the input and ground-truth from " + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "inline_equation", + "content": "\\mathbb{D}" + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "text", + "content": "). However, the difficulty of extracting effective information should also be used for the evaluation of feature extractors. Therefore, in the case of the same predictor, effectiveness " + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 130, + 546, + 481, + 640 + ], + "type": "text", + "content": " is a fair and reasonable indicator for evaluating the performance of feature extractors." + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": "By comparing the effectiveness of feature extractors before " + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "(\\mathcal{F}_0)" + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": " and after " + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "(\\mathcal{F}^*)" + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": " fine-tuning on the pre-trained dataset, the distortion of fine-tuning to pre-trained features," + } + ] + } + ], + "index": 22 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 207, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 207, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 207, + 91, + 448, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 132, + 129, + 329, + 220 + ], + "blocks": [ + { + "bbox": [ + 132, + 115, + 300, + 129 + ], + "lines": [ + { + "bbox": [ + 132, + 115, + 300, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 115, + 300, + 129 + ], + "type": "text", + "content": "Algorithm 1 Pre-training and fine-tuning" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "lines": [ + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "spans": [ + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": "Input: Pre-training dataset " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\mathbb{D}_p" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " , fine-tuning dataset " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\mathbb{D}_d" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " \nParameter: " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\varPsi" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\varPhi" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " (parameters of " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " \nOutput: " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\varPsi^{*},\\varPhi^{*}" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " \nInitialize: " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\varPsi,\\varPhi=\\varPsi_0,\\varPhi_0" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " \nPre-train: " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\varPsi_p,\\varPhi_p=\\arg\\min_{\\varPsi,\\varPhi}Loss(\\mathcal{P}\\circ\\mathcal{F}(\\mathbb{D}_p))" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " \nLoad parameters: " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\varPsi=\\varPsi_p" + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "text", + "content": " \nFine-tune: " + }, + { + "bbox": [ + 132, + 129, + 329, + 220 + ], + "type": "inline_equation", + "content": "\\varPsi^{*},\\varPhi^{*}=\\arg\\min_{\\varPsi,\\varPhi}Loss(\\mathcal{P}\\circ\\mathcal{F}(\\mathbb{D}_d))" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 130, + 248, + 479, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 479, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 479, + 274 + ], + "type": "text", + "content": "denoted as " + }, + { + "bbox": [ + 130, + 248, + 479, + 274 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 248, + 479, + 274 + ], + "type": "text", + "content": ", can be measured. Note that a denominator of zero indicates that the original feature extractor is completely invalid and therefore not relevant for discussion." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 232, + 281, + 481, + 308 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 232, + 281, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 232, + 281, + 481, + 308 + ], + "type": "interline_equation", + "content": "\\mathcal {D} = 1 - \\frac {\\mathcal {E} \\left(\\mathcal {F} ^ {*} , \\mathbb {D}\\right)}{\\mathcal {E} \\left(\\mathcal {F} _ {0} , \\mathbb {D}\\right)}, \\mathcal {E} \\left(\\mathcal {F} _ {0}, \\mathbb {D}\\right) \\neq 0. \\tag {2}", + "image_path": "49472fa64ac93fa62c52902ae80fcf3b1d8bfaa623f4d613656745e97895e036.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 327, + 292, + 339 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 327, + 292, + 339 + ], + "spans": [ + { + "bbox": [ + 132, + 327, + 292, + 339 + ], + "type": "text", + "content": "3.2 Feature-preserving Fine-tuning" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 349, + 480, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 480, + 396 + ], + "type": "text", + "content": "A method for measuring feature distortion is given above. In this section, some fine-tuning strategies are given. Figure 2 provides a visual demonstration of the proposed strategies. These strategies should minimize the degree of feature distortion while ensuring the performance of downstream tasks." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 397, + 481, + 433 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 397, + 481, + 433 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 481, + 433 + ], + "type": "text", + "content": "We denote the dataset for downstream tasks by " + }, + { + "bbox": [ + 130, + 397, + 481, + 433 + ], + "type": "inline_equation", + "content": "\\mathbb{D}_d" + }, + { + "bbox": [ + 130, + 397, + 481, + 433 + ], + "type": "text", + "content": ". A complete pre-training and fine-tuning paradigm can be expressed as shown in Alg. 1. The methods proposed below are all different implementations of the fine-tuning step." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "spans": [ + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "text", + "content": "Linear Probing First (LPF). An intuitive method is to do linear probing first [17]. First, freeze the feature extractor " + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "text", + "content": " and only fine-tune the predictor " + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "text", + "content": ", and then adjust " + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 131, + 434, + 481, + 493 + ], + "type": "text", + "content": " at the same time. Through linear probing, the predictor and the pre-trained feature extractor can be somewhat well matched, reducing the feature extractor's optimization cost, thereby shortening the optimization process." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 494, + 481, + 565 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 494, + 481, + 565 + ], + "spans": [ + { + "bbox": [ + 131, + 494, + 481, + 565 + ], + "type": "text", + "content": "Temporarily Neuron Inactivating (TNI). We note that during the fine-tuning of the neural network, all neurons are continuously adjusted to fit the target task, which may be unnecessary. Just tweaking some neurons might well fit the task. The adjustment that occurs in other neurons may simply be because this part of the neuron has not completed the adjustment. To improve this, we propose a strategy called temporarily neuron inactivating." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "text", + "content": "Specifically, a smaller fraction of the gradients used to update the model parameters is zeroed out. Thus, neurons that do not need much adjustment are left intact, while other neurons make adjustments to suit the target task. We recommend computing the mean " + }, + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "inline_equation", + "content": "(\\mu)" + }, + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "text", + "content": " and standard deviation " + }, + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "inline_equation", + "content": "(\\sigma)" + }, + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "text", + "content": " of the gradients " + }, + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "inline_equation", + "content": "(G)" + }, + { + "bbox": [ + 130, + 566, + 481, + 625 + ], + "type": "text", + "content": " for each layer in one iteration and then zeroing the fraction of gradients closest to the mean," + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 219, + 635, + 481, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 635, + 481, + 669 + ], + "spans": [ + { + "bbox": [ + 219, + 635, + 481, + 669 + ], + "type": "interline_equation", + "content": "G = \\left\\{ \\begin{array}{l l} 0, & i f \\quad G - \\| G - \\mu \\| _ {1} \\leq \\delta \\sigma ; \\\\ G, & i f \\quad G - \\| G - \\mu \\| _ {1} > \\delta \\sigma . \\end{array} \\right. \\tag {3}", + "image_path": "3fe038979d5f3e1f43a10ee3d0ef47ebb6dc9aee0f7de798f42a30c1c1291bd2.jpg" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 474, + 127 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 474, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 474, + 127 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 132, + 116, + 474, + 127 + ], + "type": "text", + "content": " is a hyperparameter, and a larger " + }, + { + "bbox": [ + 132, + 116, + 474, + 127 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 132, + 116, + 474, + 127 + ], + "type": "text", + "content": " means that more parameters will not be updated." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 129, + 480, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 129, + 480, + 163 + ], + "spans": [ + { + "bbox": [ + 132, + 129, + 480, + 163 + ], + "type": "text", + "content": "This method of choosing the parameters to be fixed is not unique. Following the same strategy, we can adjust the method with a fixed ratio or other designs. How many parameters are fixed each time and how they are chosen remains to be further explored." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 164, + 481, + 294 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 164, + 481, + 294 + ], + "spans": [ + { + "bbox": [ + 132, + 164, + 481, + 294 + ], + "type": "text", + "content": "Fine-tuning with an Assistant (AST). In addition to partially adjusting the parameters, another idea is to reduce the overall variation of the parameters. A possible approach is to use a replicated model as an assistant. First, replicate a pre-trained model as an assistant, then the feature extractors of the two models are connected in parallel, and the predictors share parameters. The parameters of the replica are frozen. The two models are trained alternately (the odd-numbered epochs train the assistant, and the even-numbered epochs train the original model). Keeping an assistant means the predictor will try to apply the pre-trained features directly to the target task. With the help of the assistant, the feature extractor can adapt to the target task with smaller changes. In a way, it can be seen as a dynamic version of linear probing first. Both of them reduce the distortion of the feature extractor with a suitable predictor." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 312, + 217, + 326 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 312, + 217, + 326 + ], + "spans": [ + { + "bbox": [ + 132, + 312, + 217, + 326 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 336, + 181, + 348 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 181, + 348 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 181, + 348 + ], + "type": "text", + "content": "4.1 Setup" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 354, + 481, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 481, + 449 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 481, + 449 + ], + "type": "text", + "content": "Evaluation methods. The experiment involves pretraining tasks and downstream tasks. The basic purpose of the experiment is to evaluate: (1) The extent to which pre-trained features are distorted after fine-tuning on downstream tasks; (2) the generalization performance of the fine-tuned model on downstream tasks. Therefore, we evaluate the distortion of pre-trained features (Eq. 2). Since the pre-training task remains unchanged in a experiment, only " + }, + { + "bbox": [ + 132, + 354, + 481, + 449 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathcal{F}^*,\\mathbb{D})" + }, + { + "bbox": [ + 132, + 354, + 481, + 449 + ], + "type": "text", + "content": ", i.e., the accuracy on the pre-training dataset after linear probing is calculated. For the generalization performance on downstream tasks, generalization datasets for the downstream tasks are used." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 450, + 481, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 450, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 132, + 450, + 481, + 640 + ], + "type": "text", + "content": "Datasets. All the datasets we use are open source datasets, including ImageNet [27], MNIST [18], CIFAR-10 [16], CIFAR-100 [16], CIFAR-10.1 [26], STL-10 [7] and CUB-200-2011 [31]. Among them, ImageNet is a large-scale image dataset with more than 1 million images in 1000 categories and is widely used as a pre-training dataset. CIFAR-10 is a lightweight image classification dataset that contains a total of 60,000 images of small size " + }, + { + "bbox": [ + 132, + 450, + 481, + 640 + ], + "type": "inline_equation", + "content": "(32\\times 32)" + }, + { + "bbox": [ + 132, + 450, + 481, + 640 + ], + "type": "text", + "content": " in 10 categories. For the experiments in Figure 3a, we preferentially select classes with smaller CIFAR-10 class numbers when sampling partial classes. CIFAR-100 is similar to CIFAR-10 but with 100 classes, while the total number of samples remains at 60,000. For the experiments in Table 1, we selected subclasses of CIFAR-100 to constitute the dataset. Specifically, we take two superclasses each time to form a 10-class classification task. The data for the target task comes from \"flowers\" and \"fruit and vegetables\", while the data for the generalization task are from \"vehicles1\" and \"vehicles2\". CIFAR-10.1 provides a new test set for CIFAR-10. We use it for testing to measure the generalization of the CIFAR-10 model. STL-10 contains more than 10,000 images in 10 categories similar to CIFAR-10. So we use it as a generalization task with more considerable domain differences." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "content": "Implementation details. We use ResNet-18 for experiments in Section 4.2, and Swin-Transformer-Tiny [24] for Table 5. For rest of the experiments, we use ResNet-50" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 125, + 294, + 224 + ], + "blocks": [ + { + "bbox": [ + 143, + 125, + 294, + 224 + ], + "lines": [ + { + "bbox": [ + 143, + 125, + 294, + 224 + ], + "spans": [ + { + "bbox": [ + 143, + 125, + 294, + 224 + ], + "type": "image", + "image_path": "4058ee524178c5218e125d7dc0de6e14807b268d4c386648117963e3c604098b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 137, + 228, + 477, + 300 + ], + "lines": [ + { + "bbox": [ + 137, + 228, + 477, + 300 + ], + "spans": [ + { + "bbox": [ + 137, + 228, + 477, + 300 + ], + "type": "text", + "content": "(a) The extent of preservation of pre-trained features is in- (b) We are aware that as the target task involves distinguish- fluenced by the difficulty of the target task. As the target task ing an increasing number of categories of CIFAR-10 sambecomes increasingly challenging in distinguishing more ples, the number of samples used for fine-tuning also incategories of CIFAR-10 samples, models pre-trained on Im- creases. Therefore, we uniformly sample a certain proportageNet (green) become more difficult to maintain good per tion of samples from each category as a control. The impact formance on ImageNet after fine-tuning on the target task. of different sample quantities has noticeably decreased comIn contrast, models initialized with random weights (blue) pared to different task complexities (a). Both the downward achieve better performance on ImageNet after training on trend of the green line and the upward trend of the blue line the target task. have smaller amplitudes." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_footnote" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 312, + 125, + 460, + 224 + ], + "blocks": [ + { + "bbox": [ + 312, + 125, + 460, + 224 + ], + "lines": [ + { + "bbox": [ + 312, + 125, + 460, + 224 + ], + "spans": [ + { + "bbox": [ + 312, + 125, + 460, + 224 + ], + "type": "image", + "image_path": "00a5f33989c08d595407d38d011ee00bae05002a3b3c51b2dff862b8ee01bee0.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 324, + 482, + 480 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 324, + 482, + 480 + ], + "spans": [ + { + "bbox": [ + 130, + 324, + 482, + 480 + ], + "type": "text", + "content": "as the backbone model for the experiments. We use the version provided by PyTorch, and the pre-training parameters of ImageNet are also from PyTorch. Except that the output shape of the \"FC\" layer may be modified according to the task, other structures remain unchanged. Without special instructions, we use SGD as the optimizer (learning rate 1e-2, momentum 0.9, weight decay 1e-5), the batch size is 16 for ImageNet and 128 for other datasets, and all training is performed for 100 epochs, For the strategy using LPF, Linear probing is performed for 10 epochs, which means that the remaining fine-tuning is performed for 90 epochs. For the fine-tuning with an assistant strategy, half of the epochs are used for the assistant. For the Temporarily Neuron Inactivating strategy, we compute the mean and standard deviation of the gradients of the same layer in each update and zero out the gradients whose difference from the mean is less than the standard deviation. According to our observations, each experiment trains to convergence, and the best-performing model is taken. The code will be open-sourced." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 499, + 251, + 511 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 499, + 251, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 499, + 251, + 511 + ], + "type": "text", + "content": "4.2 Distortion of Features" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 481, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 481, + 544 + ], + "type": "text", + "content": "First, we observe the distortion of pre-trained features during model fine-tuning through a set of experiments." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 545, + 481, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 481, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 481, + 593 + ], + "type": "text", + "content": "We previously introduced a toy example to observe the degree of feature forgetting after ImageNet pre-trained models are fine-tuned on CIFAR-10 and MNIST. We extend this experiment to verify the relationship between the degree of feature forgetting in fine-tuning and the target task." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 481, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 481, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 481, + 629 + ], + "type": "text", + "content": "We use different subsets of CIFAR-10 as the fine-tuning datasets and test how much the fine-tuned models retain pre-trained features. Models without pre-training are used in the same process as controls. The results are shown in Figure 3a" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 630, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 481, + 665 + ], + "type": "text", + "content": "The results show that as the target task contains more categories, the accuracy of the control group increases, which means that the model does learn more features. The performance of the experimental group shows an opposite trend to that of the control" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "type": "text", + "content": "group, which means that when other conditions remain unchanged, the more features to be learned, the more severe the distortion of the pre-trained features." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 141, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 141, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 132, + 141, + 482, + 272 + ], + "type": "text", + "content": "We also test the effect of sample size on the results (Figure 3b). The training set is obtained by uniformly sampling from each class. In this way, the distribution is kept unchanged, and the dataset size is reduced. It can be seen that simply changing the size of the training set has little effect on the experimental results. Combining Figure 3a and Figure 3b, it can be concluded that there is a positive correlation between the amount of target features and the distortion of the pre-trained features. The experimental results are consistent with what we observed in the toy experiments. Moreover, after excluding other interfering factors, the principle behind this phenomenon is also more evident. An extreme example might make the process easier to understand. If the training task is empty, neither the common features nor the different features exist. The model does not need to be adjusted, and the pre-trained features are perfectly preserved." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 295, + 242, + 306 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 295, + 242, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 295, + 242, + 306 + ], + "type": "text", + "content": "4.3 Preserving Features" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 319, + 482, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 319, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 319, + 482, + 413 + ], + "type": "text", + "content": "To verify the effect of the proposed feature-preserving fine-tuning method. We pre-train the model on CIFAR-10, fine-tune it on a subset of CIFAR-100 (Target), and verify feature retention again on CIFAR-10. ImageNet is no longer used in this experiment because CIFAR-10 and CIFAR-100 avoid differences unrelated to image content, such as image size; CIFAR-10 has fewer effective features than ImageNet, which makes feature distortion easier to observe. We also test with linear probing on another subset of CIFAR-100 (Unseen), verifying that the retained features are indeed valuable. The results are shown in Table 1." + } + ] + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 208, + 489, + 404, + 617 + ], + "blocks": [ + { + "bbox": [ + 132, + 435, + 482, + 479 + ], + "lines": [ + { + "bbox": [ + 132, + 435, + 482, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 482, + 479 + ], + "type": "text", + "content": "Table 1: Preservation of pre-trained features by several strategies. The " + }, + { + "bbox": [ + 132, + 435, + 482, + 479 + ], + "type": "inline_equation", + "content": "\\sqrt{}" + }, + { + "bbox": [ + 132, + 435, + 482, + 479 + ], + "type": "text", + "content": " indicated that the strategy was adopted. Pre-train represents the dataset used for pre-training, and the results intuitively reflect the retention of features. Unseen represents a dataset that has not been seen in pre-training and fine-tuning stages, and its results reflect generalization ability." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 208, + 489, + 404, + 617 + ], + "lines": [ + { + "bbox": [ + 208, + 489, + 404, + 617 + ], + "spans": [ + { + "bbox": [ + 208, + 489, + 404, + 617 + ], + "type": "table", + "html": "
StrategiesTesting accuracy (%)
ASTLPFTNITargetPre-trainUnseen
56.44±1.2349.58±0.0743.78±0.23
✓57.14±1.0854.13±0.0647.20±0.17
✓57.36±0.4149.98±0.0846.00±0.19
✓57.92±1.3753.68±0.0845.98±0.45
✓✓56.50±0.9659.30±0.0951.62±0.26
✓✓58.26±0.7454.30±0.0748.02±0.33
✓✓59.40±0.8258.69±0.0649.46±0.39
✓✓✓57.65±0.6958.14±0.1051.30±0.31
", + "image_path": "beae806b8e433af0494e0ba2490d4accfff93141eb73917f446c91e4a6b707ce.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 147, + 653, + 436, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 653, + 436, + 665 + ], + "spans": [ + { + "bbox": [ + 147, + 653, + 436, + 665 + ], + "type": "text", + "content": "Based on the results in Table 1, the following observations can be made." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 224 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 481, + 151 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 481, + 151 + ], + "type": "text", + "content": "- The three strategies tested have better performance on pre-train testing sets, and some strategy combinations can achieve better results. This shows that the proposed strategies are all beneficial for preserving task-related features." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 152, + 481, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 152, + 481, + 187 + ], + "spans": [ + { + "bbox": [ + 138, + 152, + 481, + 187 + ], + "type": "text", + "content": "- The three strategies tested have better performance on unseen testing sets. This means that the saved features are not only useful for pre-training tasks or target tasks but may also be helpful for some unseen tasks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 189, + 481, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 189, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 138, + 189, + 481, + 224 + ], + "type": "text", + "content": "- The performance ranking of the strategies on the two test sets shows a high degree of consistency, indicating that saving more pre-trained features positively affects the generalization ability of the learned features." + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 234, + 479, + 281 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 234, + 479, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 234, + 479, + 281 + ], + "type": "text", + "content": "It can be seen that compared with fine-tuning of all parameters, a suitable strategy can make the model retain more features. It should be noted that the above methods will not lose the accuracy of the target task itself. In fact, the accuracy of the target task is higher in most cases." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 283, + 480, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 283, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 283, + 480, + 342 + ], + "type": "text", + "content": "It is necessary to remind that in the fine-tuning paradigm, preserving pre-training features is not a hard requirement. However, keeping the pre-trained features may lead to better generalization performance, which is very meaningful. Therefore, in the experiments in Table 1, the performance of the model on the unseen testing set is more practical." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 343, + 481, + 402 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 343, + 481, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 343, + 481, + 402 + ], + "type": "text", + "content": "We conduct t-SNE [25] on the output of the feature extractor to observe the distortion of pre-trained features visually. Figure 4 shows the results of feature dimensionality reduction under four settings, pre-training, fine-tuning all parameters, TNI, and AST + TNI. The experiment is completed under the settings of Table 1, and the features under the three strategies are the output of the feature extractor." + } + ] + } + ], + "index": 8 + }, + { + "type": "table", + "bbox": [ + 207, + 468, + 405, + 596 + ], + "blocks": [ + { + "bbox": [ + 130, + 424, + 481, + 458 + ], + "lines": [ + { + "bbox": [ + 130, + 424, + 481, + 458 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 481, + 458 + ], + "type": "text", + "content": "Table 2: Generalizability under several strategies. Models are pre-trained on CIFAR-10 and fine-tuned on CIFAR-100. We measure the generalization ability of several strategies by observing model performance on different testing sets." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 207, + 468, + 405, + 596 + ], + "lines": [ + { + "bbox": [ + 207, + 468, + 405, + 596 + ], + "spans": [ + { + "bbox": [ + 207, + 468, + 405, + 596 + ], + "type": "table", + "html": "
StrategiesTesting accuracy (%)
ASTLPFTNICIFAR-10CIFAR-10.1
51.85±0.0740.52±0.25 44.28±0.14
✓54.61±0.1241.50±0.11 45.81±0.13
✓56.54±0.0442.95±0.13 47.27±0.16
✓52.54±0.1141.25±0.13 45.01±0.14
✓✓56.85±0.0644.06±0.16 47.27±0.12
✓✓57.03±0.3444.76±0.12 47.59±0.16
✓✓60.04±0.0547.16±0.05 48.62±0.22
✓✓✓58.05±0.0445.50±0.13 47.50±0.17
", + "image_path": "29fc1658f04954fcf54dd2cc579cf65174679fca83f31665112fc9e9b6f49a1b.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": "It can be seen that there are clear boundaries between the feature classes extracted by the pre-trained model. After fine-tuning, the boundaries between classes become blurred. This situation is improved when fine-tuning strategies such as TNI are used." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 178, + 114, + 305, + 242 + ], + "blocks": [ + { + "bbox": [ + 178, + 114, + 305, + 242 + ], + "lines": [ + { + "bbox": [ + 178, + 114, + 305, + 242 + ], + "spans": [ + { + "bbox": [ + 178, + 114, + 305, + 242 + ], + "type": "image", + "image_path": "99390423ac88c910b948af8abcf64a33d88e5484d4f2abb17608587962d6ce1a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 219, + 245, + 264, + 254 + ], + "lines": [ + { + "bbox": [ + 219, + 245, + 264, + 254 + ], + "spans": [ + { + "bbox": [ + 219, + 245, + 264, + 254 + ], + "type": "text", + "content": "(a) Pre-training" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 307, + 114, + 437, + 243 + ], + "blocks": [ + { + "bbox": [ + 307, + 114, + 437, + 243 + ], + "lines": [ + { + "bbox": [ + 307, + 114, + 437, + 243 + ], + "spans": [ + { + "bbox": [ + 307, + 114, + 437, + 243 + ], + "type": "image", + "image_path": "0b16fb8538d2682890f24ca0a44396fdb233b08c42aa6c56c64cbb4cd259368e.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 348, + 245, + 395, + 253 + ], + "lines": [ + { + "bbox": [ + 348, + 245, + 395, + 253 + ], + "spans": [ + { + "bbox": [ + 348, + 245, + 395, + 253 + ], + "type": "text", + "content": "(b) Fine-tune all" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 178, + 258, + 304, + 381 + ], + "blocks": [ + { + "bbox": [ + 178, + 258, + 304, + 381 + ], + "lines": [ + { + "bbox": [ + 178, + 258, + 304, + 381 + ], + "spans": [ + { + "bbox": [ + 178, + 258, + 304, + 381 + ], + "type": "image", + "image_path": "3b02fcb40e70332c0700c9934fcf6096dfee13ddb07acd6693b6c09d35d3fc7b.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 230, + 385, + 253, + 393 + ], + "lines": [ + { + "bbox": [ + 230, + 385, + 253, + 393 + ], + "spans": [ + { + "bbox": [ + 230, + 385, + 253, + 393 + ], + "type": "text", + "content": "(c) TNI" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 307, + 255, + 436, + 384 + ], + "blocks": [ + { + "bbox": [ + 307, + 255, + 436, + 384 + ], + "lines": [ + { + "bbox": [ + 307, + 255, + 436, + 384 + ], + "spans": [ + { + "bbox": [ + 307, + 255, + 436, + 384 + ], + "type": "image", + "image_path": "da6dff0e524202bdcc2cd72562d852e04dd990c1f0b34c3011160bf27f078e5e.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 350, + 385, + 394, + 393 + ], + "lines": [ + { + "bbox": [ + 350, + 385, + 394, + 393 + ], + "spans": [ + { + "bbox": [ + 350, + 385, + 394, + 393 + ], + "type": "text", + "content": "(d) AST + TNI" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 403, + 482, + 458 + ], + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 458 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 458 + ], + "type": "text", + "content": "Fig. 4: t-SNE results on CIFAR-10. Dimensionality reduction is performed on the output of the feature extractor obtained by several different fine-tuning strategies. The colors in the figure represent the categories of the samples. It can be seen that after fine-tuning, the cluster boundaries of each category become much blurred. The tsne results corresponding to the strategies with better results in Table 1 are also more discriminative." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": "When using the combination of AST+TNI strategy, the distribution of features is very close to the result after only pre-training. Even the best t-SNE results are significantly different from those before fine-tuning. This is reasonable because the results shown in Table 1 show that the current optimal strategy is only " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "59.3\\%" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": " accurate on CIFAR-10, while the accuracy of the model before fine-tuning can exceed " + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "inline_equation", + "content": "90\\%" + }, + { + "bbox": [ + 130, + 484, + 482, + 544 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 567, + 271, + 578 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 567, + 271, + 578 + ], + "spans": [ + { + "bbox": [ + 131, + 567, + 271, + 578 + ], + "type": "text", + "content": "4.4 Downstream Classification" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "We apply the method to more challenging fine-grained classification tasks to test the performance of our tuning strategies on downstream classification tasks. Table 3 shows the performance of our approaches and other transfer learning methods on CUB-200-2011, a widely used fine-grained classification dataset. It can be seen that for all the tested sampling rates, the proposed strategies can achieve comparable or even better performance. Using the proposed strategies for tuning will not damage the performance" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 208, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 208, + 91, + 448, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "type": "text", + "content": "on downstream classification tasks, which is consistent with the conclusions drawn in previous experiments." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 228, + 182, + 383, + 310 + ], + "blocks": [ + { + "bbox": [ + 132, + 160, + 481, + 172 + ], + "lines": [ + { + "bbox": [ + 132, + 160, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 160, + 481, + 172 + ], + "type": "text", + "content": "Table 3: Accuracy on CUB-200-2011. The best results are in bold faces. † results are from [36]." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 228, + 182, + 383, + 310 + ], + "lines": [ + { + "bbox": [ + 228, + 182, + 383, + 310 + ], + "spans": [ + { + "bbox": [ + 228, + 182, + 383, + 310 + ], + "type": "table", + "html": "
MethodSampling Rates
15%30%50%100%
FT†45.2559.6870.1278.01
AST45.5158.1169.8377.42
LPF45.7062.4270.5679.63
TNI46.3862.0371.1679.25
L2SP† [22]45.0857.7869.4778.44
DELTA† [21]46.8360.3771.3878.63
BSS† [6]47.7463.3872.5678.85
CoTuning† [36]52.5866.4774.6481.24
", + "image_path": "80846873b2c7c1214e4fdafec6518b1043180fff4c5d98847a720851bea273f4.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 358, + 221, + 370 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 221, + 370 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 221, + 370 + ], + "type": "text", + "content": "4.5 Generalization" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 378, + 481, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 481, + 413 + ], + "type": "text", + "content": "From the previous experiment, it can be seen that several of the proposed fine-tuning strategies are better than fine-tuning all parameters directly. Moreover, several strategies can be nested for better results." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 415, + 481, + 484 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 481, + 484 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 481, + 484 + ], + "type": "text", + "content": "Following the previous experimental procedure, we use CIFAR-10 as the pre-train task and CIFAR-100 as the target task. In addition to performance on the target task, we further test two other testing sets to evaluate the value of these strategies for generalization. For STL-10, we performed linear probing, and for CIFAR10.1, we did not perform additional operations since the training set is the same. The results are shown in Table 2." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 486, + 481, + 570 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 481, + 570 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 481, + 570 + ], + "type": "text", + "content": "The following observations can be made based on the results in Table 1. Models that better preserve pre-trained features also have better generalization performance. Moreover, the generalization improvement does not necessarily require extremely high similarity between distributions. The strategies in this paper are all plug-and-play and hardly introduce additional training costs but significantly improve the generalization performance of the model. Preserving the features of the pre-trained model as much as possible is a relatively novel way to improve the generalization of deep neural networks." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 586, + 289, + 598 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 586, + 289, + 598 + ], + "spans": [ + { + "bbox": [ + 132, + 586, + 289, + 598 + ], + "type": "text", + "content": "4.6 Broader Application Scenarios" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "content": "Although supervised learning on ImageNet is the most widely used pre-training method, many other valuable pre-training methods are also available. Estimated from the design idea, the proposed fine-tuning strategies proposed in this paper should apply to various pre-trained models. In addition to supervised learning, we use the SwAV [3] as a pretraining method and repeat the previous experiments. SwAV is a simple and efficient" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "self-supervised learning method that realizes feature learning through comparison and clustering." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 151, + 216, + 270, + 345 + ], + "blocks": [ + { + "bbox": [ + 131, + 162, + 293, + 205 + ], + "lines": [ + { + "bbox": [ + 131, + 162, + 293, + 205 + ], + "spans": [ + { + "bbox": [ + 131, + 162, + 293, + 205 + ], + "type": "text", + "content": "Table 4: The performance of the proposed strategies with SwAV pre-trained parameters. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 151, + 216, + 270, + 345 + ], + "lines": [ + { + "bbox": [ + 151, + 216, + 270, + 345 + ], + "spans": [ + { + "bbox": [ + 151, + 216, + 270, + 345 + ], + "type": "table", + "html": "
StrategiesTesting set (%)
AST LPF TNISelf-supervised
79.29±1.31
✓79.74±1.04
✓81.39±0.95
✓80.86±0.69
✓✓79.66±1.57
✓81.55±0.98
✓✓81.68±1.59
✓✓81.56±0.76
", + "image_path": "c666999105268b7c49a5babc520181674c22ba69cf294c4e193781e7bb2606c0.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 343, + 216, + 459, + 344 + ], + "blocks": [ + { + "bbox": [ + 321, + 162, + 482, + 205 + ], + "lines": [ + { + "bbox": [ + 321, + 162, + 482, + 205 + ], + "spans": [ + { + "bbox": [ + 321, + 162, + 482, + 205 + ], + "type": "text", + "content": "Table 5: The performance of the proposed strategies on Swin-Transformer. Models are pre-trained on ImageNet and fine-tuned on CIFAR-10." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 343, + 216, + 459, + 344 + ], + "lines": [ + { + "bbox": [ + 343, + 216, + 459, + 344 + ], + "spans": [ + { + "bbox": [ + 343, + 216, + 459, + 344 + ], + "type": "table", + "html": "
StrategiesTesting set (%)
ASTLPF TNISwin-T
79.23±0.73
✓79.67±0.86
✓80.98±1.09
79.84±1.64
✓✓81.14±1.15
✓82.29±1.72
✓82.05±0.91
✓✓82.04±1.22
", + "image_path": "8f5bc102a10adab321dc499a7fbd2395bd4444167602cdb676a3a33eb1c74efc.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 367, + 480, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 367, + 480, + 415 + ], + "spans": [ + { + "bbox": [ + 130, + 367, + 480, + 415 + ], + "type": "text", + "content": "We conduct experiments on the popular Swin-Transformer [24] to observe the effect of fine-tuning strategies under different network structures. The model structure is consistent with the \"swin_t\" provided by PyTorch, and the pre-trained parameters is provided by PyTorch. The results are shown in Table 5." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 415, + 480, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 480, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 480, + 450 + ], + "type": "text", + "content": "In both experiments, we use ImageNet pre-trained parameters and fine-tune the feature extractor on CIFAR-10. Then linear probing is conducted on ImageNet to measure the preservation of pre-trained features." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 452, + 480, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 452, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 452, + 480, + 475 + ], + "type": "text", + "content": "According to Table 4 and Table 5, the proposed strategies proposed can be applied to different pre-training methods and different model structures." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 496, + 207, + 509 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 496, + 207, + 509 + ], + "spans": [ + { + "bbox": [ + 131, + 496, + 207, + 509 + ], + "type": "text", + "content": "5 Discussion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 523, + 258, + 536 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 523, + 258, + 536 + ], + "spans": [ + { + "bbox": [ + 131, + 523, + 258, + 536 + ], + "type": "text", + "content": "5.1 Rethinking Fine-tuning" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 545, + 481, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 481, + 640 + ], + "type": "text", + "content": "This paper begins with an interesting phenomenon. A task that seems to require more features may instead allow the fine-tuned model to learn fewer features. The phenomenon is contrary to the first reaction of most people, but this phenomenon is more like a brain teasier that is easy to understand from another angle. A common understanding about the pre-training & fine-tuning process is that how much the pre-trained features can be retained depends on the commonality of the target and pre-training tasks. We propose that how much pre-trained features are lost depends on the differences between the target and pre-training tasks might be a better understanding." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "type": "text", + "content": "From this perspective, pre-training does more than provide a better initial parameter to make the optimization process easier. More importantly, pre-training allows the" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 471, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 471, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 471, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 163 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 163 + ], + "type": "text", + "content": "model to store a large number of features, most of which may not be helpful for the target task. However, they may help improve the generalization performance. Moreover, obtaining this generalization performance is almost cost-free, neither introducing high computational costs nor degrading the model's performance on the target task." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 182, + 329, + 193 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 329, + 193 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 329, + 193 + ], + "type": "text", + "content": "5.2 Fine-tuning Strategy and Generalization" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 202, + 481, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 202, + 481, + 332 + ], + "spans": [ + { + "bbox": [ + 133, + 202, + 481, + 332 + ], + "type": "text", + "content": "Three fine-tuning strategies are presented in this paper, all of which share the same starting point, i.e. to save the pre-trained feature extractor as much as possible. In general, the mechanism of all three strategies is to create partial idling of neurons. The idea of AST and LPF is relatively close; that is, the feature extractor can reduce the degree of distortion through a suitable predictor, and based on the observation of deep neural networks, it can be further extended to more layers. TNI operates at the neuron level, which is more granular and may have a higher ceiling. We also note that the optimal policy combination may differ in experimental scenarios. Because these three strategies have overlapping parts, they may interfere with each other when used in combination. The fine-tuning strategy is not carefully designed in this paper, but several simple strategies have also achieved significant improvements." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 334, + 481, + 392 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 334, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 133, + 334, + 481, + 392 + ], + "type": "text", + "content": "Regarding generalization, we observed a high correlation between the retention of pre-trained features and the generalization performance. However, the scope of application of this correlation and the specific form remains to be studied. We only test generalization performance on some tasks with relatively small domain differences. For complex scenarios, such as domain adaptation [32], and domain generalization [38]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 411, + 209, + 424 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 411, + 209, + 424 + ], + "spans": [ + { + "bbox": [ + 133, + 411, + 209, + 424 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 437, + 481, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 437, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 133, + 437, + 481, + 555 + ], + "type": "text", + "content": "This paper presents a interesting phenomenon that the negative correlation between the complexity of the fine-tuning task and the degree of retention of pre-trained features. Based on the phenomenon, this paper rethinks the execution process of the fine-tuning paradigm and provides a reasonable explanation for this phenomenon from a dynamic perspective. Further, based on this understanding of the fine-tuning process, this paper proposes some plug-and-play fine-tuning methods to better protect the pre-trained features from being distorted. A series of experiments demonstrate that the proposed strategy can reduce the distortion of pre-trained features. Moreover, these methods also have a positive effect on improving the generalization performance of the model. Finally, some potentially valuable research directions are discussed further." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 575, + 233, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 575, + 233, + 588 + ], + "spans": [ + { + "bbox": [ + 133, + 575, + 233, + 588 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 600, + 481, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 600, + 481, + 647 + ], + "spans": [ + { + "bbox": [ + 133, + 600, + 481, + 647 + ], + "type": "text", + "content": "This work was supported by the National Natural Science Foundation of China under Grants U19B2044 and the Anhui Provincial Natural Science Foundation under Grant 2108085UD12. We acknowledge the support of GPU cluster built by MCC Lab of Information Science and Technology Institution, USTC." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 190, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 190, + 127 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 190, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 139, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "type": "text", + "content": "1. Aghajanyan, A., Gupta, S., Zettlemoyer, L.: Intrinsic dimensionality explains the effectiveness of language model fine-tuning. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 7319-7328 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 184, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 481, + 216 + ], + "type": "text", + "content": "2. Awasthi, A., Sarawagi, S.: Continual learning with neural networks: A review. In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data. pp. 362-365 (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 217, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 481, + 248 + ], + "type": "text", + "content": "3. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems 33, 9912-9924 (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 249, + 481, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 249, + 481, + 281 + ], + "spans": [ + { + "bbox": [ + 138, + 249, + 481, + 281 + ], + "type": "text", + "content": "4. Chen, H., Tao, R., Zhang, H., Wang, Y., Ye, W., Wang, J., Hu, G., Savvides, M.: Conv-adapter: Exploring parameter efficient transfer learning for convnets. arXiv preprint arXiv:2208.07463 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 282, + 481, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 282, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 138, + 282, + 481, + 314 + ], + "type": "text", + "content": "5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607 (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 315, + 481, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 315, + 481, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 315, + 481, + 380 + ], + "type": "text", + "content": "6. Chen, X., Wang, S., Fu, B., Long, M., Wang, J.: Catastrophic forgetting meets negative transfer: Batch spectral shrinkage for safe transfer learning. In: Wallach, H., Larochelle, H., Beygelzimer, A., d'Alché-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 32. Curran Associates, Inc. (2019), https://proceedings.neurips.cc/paper/2019/file/c6bfff625bdd03933992c9d4db0c6bbe45-Paper.pdf" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 380, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 380, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 138, + 380, + 481, + 413 + ], + "type": "text", + "content": "7. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223 (2011)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 414, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 414, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 138, + 414, + 481, + 445 + ], + "type": "text", + "content": "8. Ding, N., Qin, Y., Yang, G., Wei, F., Yang, Z., Su, Y., Hu, S., Chen, Y., Chan, C.M., Chen, W., et al.: Delta tuning: A comprehensive study of parameter efficient methods for pre-trained language models. arXiv preprint arXiv:2203.06904 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 447, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 447, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 447, + 481, + 479 + ], + "type": "text", + "content": "9. Feng, Y., Jiang, J., Tang, M., Jin, R., Gao, Y.: Rethinking supervised pre-training for better downstream transferring. In: International Conference on Learning Representations. pp. 1-22 (2022), https://openreview.net/forum?id=Jjcv9MTqhcq" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 479, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 481, + 501 + ], + "type": "text", + "content": "0. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32th International Conference on Machine Learning. pp. 1180-1189 (2015)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 502, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 481, + 533 + ], + "type": "text", + "content": "1. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 534, + 481, + 565 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 534, + 481, + 565 + ], + "spans": [ + { + "bbox": [ + 138, + 534, + 481, + 565 + ], + "type": "text", + "content": "2. He, K., Girshick, R., Dollar, P.: Rethinking imagenet pre-training. In: 2019 IEEE/CVF International Conference on Computer Vision. pp. 4917-4926 (2019). https://doi.org/10.1109/ICCV.2019.00502" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 567, + 481, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 481, + 620 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 481, + 620 + ], + "type": "text", + "content": "3. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for NLP. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 2790-2799. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/houlsby19a.html" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 621, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 481, + 643 + ], + "type": "text", + "content": "4. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 481, + 665 + ], + "type": "text", + "content": "5. Jang, Y., Lee, H., Hwang, S.J., Shin, J.: Learning what and where to transfer. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 471, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 471, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 471, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "type": "text", + "content": "Learning. Proceedings of Machine Learning Research, vol. 97, pp. 3030-3039. PMLR (09-15 Jun 2019), https://proceedings.mlr.press/v97/jang19b.html" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 449, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 449, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 449, + 148 + ], + "type": "text", + "content": "16. Krizhevsky, A., et al.: Learning multiple layers of features from tiny images (2009)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 148, + 481, + 191 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 148, + 481, + 191 + ], + "spans": [ + { + "bbox": [ + 133, + 148, + 481, + 191 + ], + "type": "text", + "content": "17. Kumar, A., Raghunathan, A., Jones, R.M., Ma, T., Liang, P.: Fine-tuning can distort pretrained features and underperform out-of-distribution. In: International Conference on Learning Representations. pp. 1-42 (2022), https://openreview.net/forum?id=UYneFzXSJWh" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 192, + 481, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 192, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 133, + 192, + 481, + 224 + ], + "type": "text", + "content": "18. Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11), 2278-2324 (1998). https://doi.org/10.1109/5.726791" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 224, + 481, + 245 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 481, + 245 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 481, + 245 + ], + "type": "text", + "content": "19. Lee, J., Tang, R., Lin, J.: What would elsa do? freezing layers during transformer fine-tuning. arXiv preprint arXiv:1911.03090 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 245, + 481, + 277 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 245, + 481, + 277 + ], + "spans": [ + { + "bbox": [ + 132, + 245, + 481, + 277 + ], + "type": "text", + "content": "20. Lee, S.W., Kim, J.H., Jun, J., Ha, J.W., Zhang, B.T.: Overcoming catastrophic forgetting by incremental moment matching. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 277, + 481, + 320 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 277, + 481, + 320 + ], + "spans": [ + { + "bbox": [ + 132, + 277, + 481, + 320 + ], + "type": "text", + "content": "21. Li, X., Xiong, H., Wang, H., Rao, Y., Liu, L., Huan, J.: DELTA: DEEP LEARNING TRANSFER USING FEATURE MAP WITH ATTENTION FOR CONVOLUTIONAL NETWORKS. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=rkgbwsAcYm" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 320, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 320, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 320, + 481, + 374 + ], + "type": "text", + "content": "22. LI, X., Grandvalet, Y., Davoine, F.: Explicit inductive bias for transfer learning with convolutional networks. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 2825-2834. PMLR (10-15 Jul 2018), https://proceedings.mlr.press/v80/1i18a.html" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 374, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 374, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 374, + 481, + 396 + ], + "type": "text", + "content": "23. Li, Z., Hoiem, D.: Learning without forgetting. IEEE transactions on pattern analysis and machine intelligence 40(12), 2935-2947 (2017)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "type": "text", + "content": "24. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 10012-10022 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 429, + 481, + 460 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 429, + 481, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 429, + 481, + 460 + ], + "type": "text", + "content": "25. van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(86), 2579-2605 (2008), http://jmlr.org/papers/v9/vandermaaten08a.html" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 460, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 460, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 132, + 460, + 481, + 482 + ], + "type": "text", + "content": "26. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: Do cifar-10 classifiers generalize to cifar-10? arXiv preprint arXiv:1806.00451 (2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 482, + 481, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 482, + 481, + 514 + ], + "spans": [ + { + "bbox": [ + 132, + 482, + 481, + 514 + ], + "type": "text", + "content": "27. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115(3), 211-252 (2015)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 514, + 481, + 547 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 514, + 481, + 547 + ], + "spans": [ + { + "bbox": [ + 132, + 514, + 481, + 547 + ], + "type": "text", + "content": "28. Shmelkov, K., Schmid, C., Alahari, K.: Incremental learning of object detectors without catastrophic forgetting. In: Proceedings of the IEEE/CVF conference on International Conference on Computer Vision. pp. 3400-3409 (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 547, + 481, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 547, + 481, + 601 + ], + "spans": [ + { + "bbox": [ + 132, + 547, + 481, + 601 + ], + "type": "text", + "content": "29. Stickland, A.C., Murray, I.: BERT and PALs: Projected attention layers for efficient adaptation in multi-task learning. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 5986-5995. PMLR (09-15 Jun 2019), https://proceedings.mlrpress/v97/stickland19a.html" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 601, + 481, + 622 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 622 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 622 + ], + "type": "text", + "content": "30. Tan, C., Sun, F., Kong, T., Zhang, W., Yang, C., Liu, C.: A survey on deep transfer learning. In: International Conference on Artificial Neural Networks. pp. 270-279 (2018)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 622, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 481, + 643 + ], + "type": "text", + "content": "31. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "text", + "content": "32. Wang, M., Deng, W.: Deep visual domain adaptation: A survey. Neurocomputing 312, 135-153 (2018)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 239, + 102 + ], + "type": "text", + "content": "Hongjing Niu, et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 314 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "text", + "content": "33. Weiss, K., Khoshgoftaar, T.M., Wang, D.: A survey of transfer learning. Journal of Big data 3(1), 1-40 (2016)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 482, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 482, + 171 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 482, + 171 + ], + "type": "text", + "content": "34. Yang, L., Rakin, A.S., Fan, D.: Rep-net: Efficient on-device learning via feature reprogramming. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12277-12286 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 194 + ], + "type": "text", + "content": "35. Yosinski, J., Clune, J., Bengio, Y., Lipson, H.: How transferable are features in deep neural networks? Advances in neural information processing systems 27 (2014)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 481, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 247 + ], + "type": "text", + "content": "36. You, K., Kou, Z., Long, M., Wang, J.: Co-tuning for transfer learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 17236-17246. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper/2020/file/c8067ad1937f728f51288b3eb986afaa-Paper.pdf" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 270 + ], + "type": "text", + "content": "37. Zaken, E.B., Ravfogel, S., Goldberg, Y.: Bitfit: Simple parameter-efficient fine-tuning for transformer-based masked language-models. arXiv preprint arXiv:2106.10199 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 271, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 481, + 293 + ], + "type": "text", + "content": "38. Zhou, K., Liu, Z., Qiao, Y., Xiang, T., Loy, C.C.: Domain generalization: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence pp. 1-20 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 314 + ], + "type": "text", + "content": "39. Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., He, Q.: A comprehensive survey on transfer learning. Proceedings of the IEEE 109(1), 43-76 (2020)" + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 208, + 91, + 447, + 102 + ], + "type": "text", + "content": "Idling Neurons During Fine-tuning Leads to Better Generalization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_content_list.json b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..70ef144a0df6cba2aa7f99de689af82d335480ce --- /dev/null +++ b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_content_list.json @@ -0,0 +1,1730 @@ +[ + { + "type": "text", + "text": "Image Compression for Machine and Human Vision with Spatial-Frequency Adaptation", + "text_level": 1, + "bbox": [ + 245, + 140, + 756, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Han Li $^{1}$ , Shaohui Li $^{2(\\boxtimes)}$ , Shuangrui Ding $^{3}$ , Wenrui Dai $^{1(\\boxtimes)}$ , Maida Cao $^{1}$ , Chenglin Li $^{1}$ , Junni Zou $^{1}$ , and Hongkai Xiong $^{1}$", + "bbox": [ + 282, + 210, + 715, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Shanghai Jiao Tong University \n $^{2}$ Tsinghua Shenzhen International Graduate School, Tsinghua University \n $^{3}$ The Chinese University of Hong Kong \n{qingshi9974, daiwenrui, caomaida, lcl1985, zoujunni, xionghongkai}@sjtu.edu.cn \nlishaohui@sz.tsinghua.edu.cn, ds023@ie.cuhk.edu.hk", + "bbox": [ + 217, + 253, + 789, + 324 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Image compression for machine and human vision (ICMH) has gained increasing attention in recent years. Existing ICMH methods are limited by high training and storage overheads due to heavy design of task-specific networks. To address this issue, in this paper, we develop a novel lightweight adapter-based tuning framework for ICMH, named Adapt-ICMH, that better balances task performance and bitrates with reduced overheads. We propose a spatial-frequency modulation adapter (SFMA) that simultaneously eliminates non-semantic redundancy with a spatial modulation adapter, and enhances task-relevant frequency components and suppresses task-irrelevant frequency components with a frequency modulation adapter. The proposed adapter is plug-and-play and compatible with almost all existing learned image compression models without compromising the performance of pre-trained models. Experiments demonstrate that Adapt-ICMH consistently outperforms existing ICMH frameworks on various machine vision tasks with fewer fine-tuned parameters and reduced computational complexity. Code will be released at https://github.com/qingshi9974/ECCV2024-AdpatICMH.", + "bbox": [ + 259, + 359, + 743, + 597 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Learned Image Compression $\\cdot$ Machine Vision $\\cdot$ Adapter", + "bbox": [ + 261, + 609, + 725, + 625 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 648, + 375, + 666 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The booming of computer vision [18,25,26,46,56,60,63,65] raises the demands for excessive images serving machine vision systems and accomplishing tasks such as classification, detection, segmentation. In practice, images from users have to be compressed and transmitted to exploit the off-the-shelf recognition models deployed in the cloud. However, compression directly using existing image CODECs, especially learned image compression (LIC) models [3, 4, 35, 42, 50, 51, 68] optimized for human vision, could cause the loss of semantic information contained in images and dramatically reduce the accuracy of downstream tasks. To meet the demands of both machine and human vision systems, unified CODEcs", + "bbox": [ + 212, + 680, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "Correspondence to Wenrui Dai and Shaohui Li.", + "bbox": [ + 230, + 825, + 550, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/15acc961743b0d0aa7a9015617d3b789548dfb781b9846f2470eeba2e8a96a1f.jpg", + "image_caption": [ + "Fig. 1: Left: our adapter-based tuning framework. Right: Rate-accuracy performance comparison on classification for ImageNet-val [17]. We compare our methods (Ours- $n$ indicates $n$ middle dimensions for SFMA) with full fine-tuning, TransTIC [11], ICMH-Net [44], and channel selection [41]. BD-accuracy is computed by replacing the PSNR in BD-PSNR [6] with top-1 accuracy and setting the base codec of TIC [47] as the anchor. The size of circles indicates GFLOPs for inference during encoding." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 496, + 325 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/b4c6b4c9174d081db4bc085d9283f2552afd0ee1326b6d5caaaafe00ac9d838a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 496, + 148, + 784, + 325 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "to achieve image compression for machine and human vision (ICMH) have been explored [1, 11, 14, 16, 20, 22, 39-41, 43, 44, 64].", + "bbox": [ + 212, + 457, + 784, + 488 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A multi-task pipeline has been built for ICMH in [1, 14, 16], where a task-agnostic encoder and multiple task-specific decoders are jointly trained from scratch for human vision and multiple machine vision tasks. However, the multi-task pipeline results in degraded rate-distortion (R-D) performance for human vision and is restricted in adapting to newly coming machine vision tasks.", + "bbox": [ + 212, + 489, + 784, + 565 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Since LIC models are usually fitted to the distributions of natural images [33, 49], recent works [11,22,40,41,44] tend to adopt a tuning framework that adapts a pre-trained image codec optimized for human vision (called base codec) to diverse machine vision tasks without sacrificing R-D performance. This pipeline enables ICMH by training only a lightweight module specifically for the machine vision task, while freezing the base codec parameters for sharing across human and machine vision. In ICMH-Net [44], a spatial-channel mask generator is trained to determine a subset of quantized latent for a specific machine vision task. Chen et al. [11] utilized visual prompt tuning [30] to transfer the transformer-based base codec [47] to machine vision tasks. Unfortunately, these methods suffer from evidently degraded performance compared to codec's fully fine-tuned for machine vision tasks. Besides, they introduce significant overheads of computational and model complexity to the base codec due to their task-specific designs. It remains a challenge to achieve efficient fine-tuning of pre-trained human vision-oriented image codec on machine vision tasks.", + "bbox": [ + 212, + 566, + 787, + 792 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we consider the fact that almost all spatial and frequency components of an image are exploited by the base codec to improve the visual quality for human vision but could be redundant for machine vision tasks. We are", + "bbox": [ + 212, + 795, + 785, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "thereby motivated to modulate the intermediate feature of the base codec in both spatial and frequency domains such that the redundancy in the latent representation can be reduced and the reconstructed image can be efficiently adapted to various machine vision tasks.", + "bbox": [ + 212, + 146, + 784, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To this end, we propose a play-and-plug module of spatial-frequency modulation adapter (SFMA) to better balance the machine vision task performance and transmission cost. Specifically, the proposed SFMA consists of two parallel submodules, i.e., a spatial modulation adapter (SMA) that eliminates non-semantic redundancies in the spatial domain and a frequency modulation adapter (FMA) that amplifies the frequency components that contribute more to the machine vision task (e.g., high-frequency components are more crucial for segmentation) and suppresses the redundant frequency components. Furthermore, we develop an adapter-based tuning framework for ICHM, named Adapt-ICMH, by plugging the proposed SFMA into both the encoder and decoder of the base codec, as depicted in Fig. 1. It should be noted that, different from [11] that can only adapt the transformer-based base codec, Adapt-ICMH is architecture-agnostic such that it is compatible with almost all existing LIC models for adaptation to various machine vision tasks. In summary, our contributions include:", + "bbox": [ + 212, + 207, + 787, + 417 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose a spatial-frequency modulation adapter (SFMA) to efficiently update the intermediate feature and better balance the performance and bitrates for diverse machine vision tasks.", + "- Based on SFMA, we develop a novel tuning framework named Adapt-ICMH to achieve image coding for machine and human vision with a shared base codec, significantly reducing the training and storage overhead.", + "- Our SFMA is plug-and-play, which could be incorporated with all existing LIC models to achieve ICMH. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks with even reduced model and computational complexity." + ], + "bbox": [ + 225, + 426, + 784, + 575 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 598, + 387, + 614 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Learned Image Compression (LIC) has attracted wide attention due to its superior rate-distortion (R-D) performance. Research in LIC can be categorized into two main paths. The first focuses on enhancing the nonlinear transforms [2], evolving from convolutional neural networks (CNN)-based [3,4,50,51] to attention-based transforms [13], and more recently, transformer-based transforms [35,42,47,68]. The second path involves designing more powerful entropy models. Prior works [3,4] proposed factorized and hyperprior models, while recent efforts [32,50,51,55] tend to introduce spatial or channel-wise autoregression in the entropy model. However, these methods focus solely on the human visual quality of the decoded image, while ignoring the application in downstream machine vision tasks.", + "bbox": [ + 212, + 628, + 787, + 792 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Image Compression for Machine and Human Vision (ICMH) has become a hot topic in recent years due to the growing number of images that need to be processed for various machine vision tasks, such as classification [17,26,29],", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "detection [9,23,67], segmentation [25,58,59,66] and pose estimation [8,36,37,60]. One straight way is to fully fine-tune the base codec on machine vision tasks. However, this requires storing and deploying a separate copy of the entire codec network for each individual task, which severely hampers practical applicability.", + "bbox": [ + 212, + 145, + 782, + 205 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Earlier works [1, 14, 16, 41] presented a multi-task pipeline to unify the image coding for machine and human vision. However, it still requires multiple task-specific decoders, leading to increased storage overhead. In addition, the entire network must be trained from scratch, resulting in significant training overhead and impeding the adaptation to newly coming machine vision tasks. To address this problem, Liu et al. [44] proposed to leverage the pre-trained human vision-oriented base codec and train an extra spatial-channel mask generator to transmit a subset of latent for machine vision task. Unfortunately, it cannot be easily extended to autoregression-based entropy models [50, 51] and fails to achieve adaptation of the nonlinear transforms. Chen et al. [11] proposed a prompt-based tuning framework that introduces prompts in the transformer-based nonlinear transforms for machine vision. However, it cannot be compatible with the mainstream CNN-based LIC methods [3, 4, 13] and the performance is still highly inferior to full fine-tuning. In contrast, our framework generalizes to almost all existing LIC models with different nonlinear transforms and entropy models and achieves comparable rate-accuracy performance compared to full fine-tuning. See Appendix B for more discussions about ICMH.", + "bbox": [ + 212, + 207, + 787, + 464 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Parameter-Efficient Fine-Tuning (PEFT) has been extensively studied for NLP [24, 28, 34, 45, 53, 54]. It can effectively fine-tune a pre-trained large-scale model on downstream tasks or datasets with the major model frozen. With the advent of vision transformers [9, 19, 46], researchers have applied PEFT tools to machine vision tasks, including prompt tuning [30, 31], adapters [10, 12, 62], and LoRA [27]. In the field of learned image compression, Feng et al. [21] first introduced prompts for machine-oriented image coding, while Liu et al. [11] further explored the application of prompt-tuning for ICMH. [48, 57, 61] transmitted the parameters of additional adapters for content-adaptive optimization [7, 33] to improve the human visual quality of the decoded image, which is completely different from ours in terms of methodology and application scenarios. In addition, naive adapters [10, 28, 40] update the feature without considering the transmission cost of different underlying frequencies and spatial components of the image, which is vital for ICMH. In our paper, we propose a novel spatial-frequency modulation adapter specifically for ICHM to address this limitation.", + "bbox": [ + 212, + 464, + 787, + 691 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Methods", + "text_level": 1, + "bbox": [ + 215, + 715, + 336, + 732 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Empirical Findings by Full Fine-tuning", + "text_level": 1, + "bbox": [ + 215, + 751, + 584, + 767 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We first conduct a simple experiment to highlight the key insight of this paper: image compression for machine vision tends to prioritize transmitting distinct spatial and frequency information compared to human vision. This preference also varies across specific machine vision tasks.", + "bbox": [ + 212, + 779, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 344, + 126 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/24c0fa6e21c18790e3a0e8e892df2d8110db68ef5c7a77e0c90c0672f91e70e4.jpg", + "image_caption": [ + "Input Image" + ], + "image_footnote": [], + "bbox": [ + 230, + 207, + 330, + 282 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/715c8196e265933e9238e9a6ca83029258c57d62e494cd8a5d66517fbc726caa.jpg", + "image_caption": [ + "Fig. 2: Visualization of the bit allocation maps (first row) and power spectral density maps (second row) of the latent $\\hat{y}$ . The left part shows the raw input image. Each column of the right part corresponds to a codec for each task, including the base codec for human vision and three fine-tuned CODEs for machine vision tasks. The bit allocation map is computed by averaging the negative log-likelihood (i.e., $-\\log_2p(\\hat{y})$ ) across channels. The power spectral density map is computed by applying the Fast Fourier Transform (FFT) to $\\hat{y}$ with a shift operation to center the zero frequency component, and then averaging its absolute value across channels." + ], + "image_footnote": [], + "bbox": [ + 331, + 143, + 772, + 332 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Taking the pre-trained mean-scale hyperprior $^4$ model [50] optimized for human vision as the base codec, we fully fine-tune $^5$ it on three different machine vision tasks, including classification, object detection, and instance segmentation. Then, we feed the same image to the base codec and three fine-tuned CODECs, respectively. The bit allocation map and power spectral density map of latent $\\hat{y}$ for each codec are shown in Fig. 2.", + "bbox": [ + 212, + 484, + 787, + 575 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "From the bit allocation map, we can see that the base codec consumes more bitrates in the complex background region, while the CODEs that are fully finetuned on machine tasks pay more attention to the semantic object. In addition, we can see from the power spectral density maps that the base codec tends to encode frequency components as many as possible to achieve higher visual quality. However, many of these frequency components are redundant for machine vision. For example, instance segmentation prefers more mid- and high-frequency components for accurate edge and contour reconstruction, while low- and mid-frequency components are sufficient for simpler tasks (e.g., classification).", + "bbox": [ + 212, + 577, + 787, + 712 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "These observations confirm that image compression has different spatial and frequency domain preferences for different tasks. However, fully fine-tuning the base codec on different machine vision tasks is costly in terms of training time and memory. Thus, in this paper, we propose a spatial-frequency modulation adapter to conduct efficient fine-tuning, and effectively reduce the redundancies in both spatial and frequency domains for machine vision tasks.", + "bbox": [ + 212, + 712, + 787, + 804 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_footnote", + "text": "4 We use the pre-trained model (named mbt2018-mean) offered by CompressAI [5].", + "bbox": [ + 217, + 810, + 772, + 825 + ], + "page_idx": 4 + }, + { + "type": "page_footnote", + "text": "5 We use loss function (1) to conduct the full fine-tuning.", + "bbox": [ + 218, + 825, + 602, + 839 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Framework Overview", + "text_level": 1, + "bbox": [ + 215, + 146, + 437, + 160 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/9d05dc979dd62ae2472d10f455a31130c404c9e61a298ed02e9afaff1e8ad49c.jpg", + "image_caption": [ + "Fig. 3: Overview of our proposed Adapt-ICMH framework. Multiple spatial-frequency modulation adapters (SFMA) are plugged into the encoder $g_{a}$ and decoder $g_{s}$ of the base codec for feature adaptation. During the adaptation to the machine vision task, the base codec is frozen and only these adapters are trainable. For briefness, we do not illustrate the specific architecture of the encoder, decoder stage, and entropy model, as it depends on the specific base codec. Please see Appendix E for the detailed architecture." + ], + "image_footnote": [], + "bbox": [ + 218, + 195, + 787, + 463 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Our compression framework Adapt-ICMH, shown in Fig. 3, is designed to adapt the existing learned image compression model that is optimized for human vision (i.e., base codec) to downstream machine vision tasks. To this end, we propose the Spatial-Frequency Modulation Adapter (SFMA), a plug-and-play bottleneck module, which is plugged into the encoder $g_{a}$ and decoder $g_{s}$ of the base codec for feature adaptation.", + "bbox": [ + 212, + 604, + 787, + 694 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "During the adaptation stage, the weights of the base codec (blue part) are loaded from the pre-trained checkpoint and kept frozen. Therefore, we only optimize the added adapters (red part) for specific machine vision tasks with the following loss function:", + "bbox": [ + 212, + 695, + 787, + 755 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {R} + \\lambda \\cdot \\mathcal {D} (\\boldsymbol {x}, \\hat {\\boldsymbol {x}}; \\mathcal {G}), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 415, + 771, + 785, + 787 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathcal{R}$ denotes the overall estimated bitrates, $\\mathcal{D}$ calculates the task-specific perceptual distortion between raw image $\\pmb{x}$ and reconstructed image $\\hat{\\pmb{x}}$ with an off-the-shelf recognition model $\\mathcal{G}$ (e.g., Faster RCNN [56] for object detection).", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "$\\lambda$ is a trade-off term to balance the task performance and bitrates. Please refer to Appendix C for more details about loss function.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "After adaptation, we can only modify the weights of lightweight adapters for different machine vision tasks, while keeping the parameters of the base codec unchanged. If an image needs to be compressed for human vision, we can directly remove the adapters to obtain the original base codec, so that the R-D performance for human vision is not affected. In this way, a single base codec model can be used for both human vision and multiple machine vision tasks.", + "bbox": [ + 212, + 176, + 787, + 268 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Spatial-Frequency Modulation Adapter", + "text_level": 1, + "bbox": [ + 214, + 290, + 584, + 306 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The proposed Spatial-Frequency Modulation Adapter (SFMA) consists of a Spatial Modulation Adapter (SMA) and a Frequency Modulation Adapter (FMA), which are configured in a parallel way. As shown in Fig. 3, the encoder $g_{a}$ of base codec generally consists of four stages, denoted by $g_{a} = g_{a1} \\circ g_{a2} \\circ g_{a3} \\circ g_{a4}$ . Given the input image $\\pmb{x} \\in \\mathbb{R}^{3 \\times H \\times W}$ , where $H \\times W$ is the spatial resolution, we define the output feature of the $j$ -th intermediate stage of $g_{a}$ as $\\pmb{x}_{j} \\in \\mathbb{R}^{C_{j} \\times H_{j} \\times W_{j}}$ , where $C_{j}$ is the number of channels, $H_{j} = H / 2^{j}$ , $W_{j} = W / 2^{j}$ , and $j \\in \\{1, 2, 3\\}$ . Supposing that the SFMA plugged after the $j$ -th encoder stage is denoted by $\\mathrm{SFMA}_{j}$ , we can obtain the adapted feature $\\tilde{\\pmb{x}}_{j}$ by aggregating original input feature $\\pmb{x}_{j}$ with the adapted component. The process can be defined as follows:", + "bbox": [ + 212, + 315, + 787, + 467 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\tilde {\\boldsymbol {x}} _ {j} = \\operatorname {S F M A} _ {j} (\\boldsymbol {x} _ {j}) \\\\ = \\boldsymbol {x} _ {j} + \\underbrace {\\operatorname {F M A} _ {j} \\left(\\boldsymbol {x} _ {j}\\right) + \\operatorname {S M A} _ {j} \\left(\\boldsymbol {x} _ {j}\\right)} _ {\\text {a d a p t e d c o m p o n e n t}}, \\tag {2} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 479, + 784, + 534 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathrm{FMA}_j$ and $\\mathrm{SMA}_j$ denote the $j$ -th frequency and spatial modulation adapter, respectively. The process of the adapter for decoder $g_{s}$ can be derived similarly. Frequency Modulation Adapter. Our frequency modulation adapter (FMA) is designed to adapt the feature in the frequency domain. By this modulation operation, we can eliminate frequency redundancies and amplify the important frequency components for machine vision tasks. Specifically, the input $\\pmb{x}_j \\in \\mathbb{R}^{C_j \\times H_j \\times W_j}$ firstly be down-projected to a bottleneck middle dimension $\\hat{C} (\\hat{C} \\leq C_j)$ by a linear layer $\\pmb{W}_{\\mathrm{down}}^{\\mathrm{f}} \\in \\mathbb{R}^{C_j \\times \\hat{C}}$ and then be transformed into frequency domain by fast Fourier transform (FFT), obtaining the middle feature $\\pmb{x}_j^{\\mathrm{f}}$ . Subsequently, we generate a frequency modulation matrix $\\pmb{m}_j^{\\mathrm{f}}$ and then use Hadamard product to calculate the modulated result $\\bar{\\pmb{x}}_j^{\\mathrm{f}}$ . Finally, $\\bar{\\pmb{x}}_j^{\\mathrm{f}}$ is inversely transformed using inverse FFT (IFFT) and up-projected by another linear layer $\\pmb{W}_{\\mathrm{up}}^{\\mathrm{f}} \\in \\mathbb{R}^{\\hat{C} \\times C_j}$ . The overall process of FMA can be formulated as follows:", + "bbox": [ + 212, + 544, + 792, + 750 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\boldsymbol {x} _ {j} ^ {\\mathrm {f}} = \\mathcal {F} (\\boldsymbol {x} _ {j} \\cdot \\boldsymbol {W} _ {\\text {d o w n}} ^ {\\mathrm {f}}, \\\\ \\boldsymbol {m} _ {j} ^ {\\mathrm {f}} = \\sigma (\\operatorname {D W - C o n v} _ {3 \\times 3} \\left(\\boldsymbol {x} _ {j} ^ {\\mathrm {f}}\\right)) \\cdot \\boldsymbol {W} _ {\\text {m i d d l e}} ^ {\\mathrm {f}}, \\tag {3} \\\\ \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}} = \\boldsymbol {x} _ {j} ^ {\\mathrm {f}} \\odot \\sigma (\\boldsymbol {m} _ {j} ^ {\\mathrm {f}}), \\\\ \\tilde {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}} = \\mathcal {F} ^ {- 1} (\\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}}) \\cdot \\boldsymbol {W} _ {\\mathrm {u p}} ^ {\\mathrm {f}} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 762, + 784, + 844 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\sigma$ denotes ReLU [52], DW-Conv $_{3\\times 3}$ denotes depth-wise convolution [15] with kernel size $3\\times 3$ , $\\mathbf{W}_{\\mathrm{middle}}^{\\mathrm{f}}\\in \\mathbb{R}^{\\hat{C}\\times \\hat{C}}$ is a linear layer, $\\odot$ denotes Hadamard product, and $\\mathcal{F}(\\cdot)$ and $\\mathcal{F}^{-1}(\\cdot)$ denote the FFT and IFFT, respectively.", + "bbox": [ + 212, + 146, + 782, + 193 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Spatial Modulation Adapter. Our spatial modulation adapter (SMA) is designed to adapt features in the spatial domain, thus guiding the codec to focus more on the semantic region and reduce the spatial redundancies in the background. Similarly, the input $\\boldsymbol{x}_j \\in \\mathbb{R}^{C_j \\times H_j \\times W_j}$ is first down-projected to a bottleneck middle dimension $\\hat{C}$ by a linear layer $W_{\\mathrm{down1}}^{\\mathrm{s}} \\in \\mathbb{R}^{C_j \\times \\hat{C}}$ , obtaining the middle feature $\\boldsymbol{x}_j^{\\mathrm{s}}$ . Then, we produce the spatial modulation matrix $\\boldsymbol{m}_j^{\\mathrm{s}}$ by feeding $\\boldsymbol{x}_j$ to another down-projection linear layer $W_{\\mathrm{down2}}^{\\mathrm{s}} \\in \\mathbb{R}^{C_j \\times \\hat{C}}$ followed by a $5 \\times 5$ depth-wise convolution layer. We then apply an up-projection linear layer $W_{\\mathrm{up}}^{\\mathrm{s}} \\in \\mathbb{R}^{\\hat{C} \\times C_j}$ to the modulated feature to get the spatial adapted result. The overall process of SMA can be formulated as follows:", + "bbox": [ + 212, + 194, + 784, + 353 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\boldsymbol {x} _ {j} ^ {\\mathrm {s}} = \\boldsymbol {x} _ {j} \\cdot \\boldsymbol {W} _ {\\text {d o w n 1}} ^ {\\mathrm {s}}, \\\\ \\boldsymbol {m} _ {j} ^ {\\mathrm {s}} = \\operatorname {D W - C o n v} _ {5 \\times 5} \\left(\\boldsymbol {x} _ {j} ^ {\\mathrm {s}} \\cdot \\boldsymbol {W} _ {\\text {d o w n} 2} ^ {\\mathrm {s}}\\right), (4) \\\\ \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} = \\boldsymbol {x} _ {j} ^ {\\mathrm {s}} \\odot \\sigma \\left(\\boldsymbol {m} _ {j} ^ {\\mathrm {s}}\\right), (4) \\\\ \\tilde {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} = \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} \\cdot \\boldsymbol {W} _ {\\mathrm {u p}} ^ {\\mathrm {s}}, \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 366, + 784, + 444 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 460, + 375, + 477 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Training Details and Datasets.", + "text_level": 1, + "bbox": [ + 215, + 489, + 511, + 505 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To demonstrate the generalization ability of our framework, we adopt three mainstream LIC methods, i.e., stacked convolution-based [50], residual network-based [13], and transformer-based [47] image compression model. We use their pretrained models from CompressAI [5] library as base codes, denoted by mbt2018-mean, cheng2020-anchor and Lu2022-TIC, respectively. For benchmark machine vision tasks, we evaluate our framework on classification, object detection, and instance segmentation, respectively. By freezing these base codec's pre-trained for human vision, we then train our SFMAs using the task-specific loss of Eq. (1) with the bottleneck middle dimension $\\hat{C}$ set to 64. Specifically, we train the classification task on ImageNet-train dataset [17] for 8 epochs with a batch size of 16, and train the object detection and instance segmentation tasks on COCO2017-train dataset [38] both for 40 epochs with a batch size of 8. The images are randomly cropped and resized to $256\\times 256$ for training all tasks. For the calculation of task-specific perceptual distortion term in the Eq. (1), we follow [11] to use the pre-trained ResNet50 [26], Faster R-CNN [56] and Mask R-CNN [25] for classification, object detection, and instance segmentation, respectively. More training details are included in Appendix C.", + "bbox": [ + 212, + 511, + 787, + 768 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Evaluation", + "text_level": 1, + "bbox": [ + 215, + 787, + 351, + 801 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We follow the setting of [11] to evaluate the performance of our method. Specifically, we use bits per pixel (BPP) to evaluate bitrates for compression. For image", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "classification, the evaluations are conducted on the ImageNet-val dataset [17] and images are resized and center cropped to $256 \\times 256$ . We adopt the pre-trained ResNet50 from torchvision library as the off-the-shelf recognition model and use top-1 accuracy as the quality metric. For objection detection and instance segmentation, the evaluations are both done on the COCO2017-val dataset [38] by using the pre-trained Faster R-CNN and Mask R-CNN from detectron2 library as the off-the-shelf recognition model, respectively. The test images are resized to 800 pixels for the short side and we use mean average precision (mAP) with an Intersection of Union (IoU) threshold of 0.5 as the quality metric.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 Rate-Accuracy Comparison", + "text_level": 1, + "bbox": [ + 214, + 306, + 488, + 321 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We compare the rate-accuracy performance of our methods with the state-of-the-art (SOTA) methods $^6$ , including TransTIC [11], ICMH-Net [44], and channel selection [41]. Note that our method has an equal R-D performance for human vision with these methods, since we all adopt the pre-trained image codec as base codec and freeze it. We also evaluate the rate-accuracy performance of the base codec and further full fine-tuning it on machine vision tasks end-to-end.", + "bbox": [ + 212, + 333, + 787, + 424 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The rate-accuracy curves for competing methods are shown in Fig. 4. In addition, we also summarize the average bitrates savings, accuracy improvements, and the trainable parameters count of different methods in Tab. 1. Specifically, we report the BD-rate [6] results to quantify the average bitrates savings with equal task accuracy, we also follow [11] to report BD-acc/BD-mAP results to measure the average task accuracy improvements with equal bitrates. BD-acc/BD-mAP is calculated by replacing the PSNR in BD-PSNR with top-1 accuracy/mAP.", + "bbox": [ + 212, + 424, + 787, + 545 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "From the results of Fig. 4 and Tab. 1, we can observe that (1) our method consistently achieves excellent performance across all three machine vision tasks and outperforms [11, 41, 44], the superiority is more significant on the classification task; (2) Our method demonstrates strong generalization ability as it can effectively generalize to three different base CODEs, despite their varying architectures of nonlinear transforms (i.e., $g_{a}$ and $g_{s}$ ) and entropy models. (3) our method achieve comparable or even superior performance to full fine-tuning. However, full fine-tuning requires storing and deploying a separate copy of the entire codec for each task, significantly increasing training and storage overhead and severely hindering practical applicability. (4) our method requires fewer trainable parameters (i.e., about $1 \\sim 5\\%$ of the number of parameters of the base codec) compared to other tuning-based methods (i.e., about $1 \\sim 5\\%$ of the number of parameters of the base codec), which demonstrates the parameter efficiency of our method. For the application on larger transformer-based image CODEs [35, 42, 68], see Appendix H. For the comparison of computational complexity, see Appendix G.", + "bbox": [ + 212, + 546, + 787, + 787 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_footnote", + "text": "6 Since ICMH-Net [44] and channel selection [41] are not open source and use different recognition models and test datasets than ours, we reproduce them with the same training settings as ours. See Appendix D for more details.", + "bbox": [ + 217, + 796, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/b0f9b63782fbfa6c5759bbede1bba9b2be9bbac649954cc1c4fe0d295b6fed53.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 233, + 143, + 411, + 263 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/3f7cfaa5dcb3c4628309819bf166078401a44f1f6181f9a6e715e524fb633b5d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 413, + 143, + 591, + 263 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/d8514706e30510c014f1ec6483a9dc17e0fabe6ae43f5e752de716b329e7acf6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 593, + 145, + 769, + 263 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/75e34c1e564472b08641e63de005cc6baae5ff40475401bf602ecccf7408cfe6.jpg", + "image_caption": [ + "(a) Lu2022-TIC model [47] as base codec" + ], + "image_footnote": [], + "bbox": [ + 233, + 277, + 411, + 396 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/4c60657b2c1a756f1f86a81b0bc332bfabf2b41a5e4628bf6fec82732a716c07.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 413, + 277, + 589, + 396 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/d789faf5e5427ccf6b54d03a06f0cd60bc991e178cdc703ef4a69b29d95cce52.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 591, + 277, + 767, + 396 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/262314d10b59bd95723008541acdee073a54d459aa06a8b8e9964d41626aaf23.jpg", + "image_caption": [ + "(b) Cheng2020-anchor model [13] as base codec", + "(c) mbt2018-mean model [50] as base codec", + "Fig. 4: Rate-Accuracy performance comparison under different machine vision tasks and different base codecs." + ], + "image_footnote": [], + "bbox": [ + 233, + 411, + 410, + 529 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/ade518f6b6357140dea8eda04603d9737e27d9112ecbe7b4149ea70c785a1d84.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 413, + 411, + 589, + 529 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/234ac8f77b9e1907c111b3661e2d765a65f31f2db7f279db4051dc57aa399d53.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 591, + 411, + 769, + 529 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.4 Ablation study", + "text_level": 1, + "bbox": [ + 214, + 627, + 387, + 643 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We conduct ablation studies to investigate how each design in our SFMA influences the overall performance. Without loss of generality, we use the pre-trained mbt2018-mean as the base codec for convenience.", + "bbox": [ + 212, + 657, + 785, + 700 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Effect on the architecture of SFMA. We first explore the impact of the architecture of SFMA on performance by conducting experiments with various variants of SFMA, as summarized in Fig. 5. (a) Proposed SFMA: The default configuration of SFMA. (b) SMA-only: The FMA branch is removed, retaining only the SMA branch. (c) FMA-only: The SMA branch is removed, retaining only the FMA branch. (d) FMA-SMA-sequential: FMA and SMA are organized sequentially, where SMA is followed by FMA. (e) SMA-FMA-sequential: FMA and SMA are organized sequentially, where FMA is followed by SMA. (f) SMA-SMA-parallel: two SMAs are configured in parallel.", + "bbox": [ + 212, + 703, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/ff62bb4aea2d9e6a2252f58eac0379cdad8e2e0732250ee0839b8c8dde236c2d.jpg", + "table_caption": [ + "Table 1: Comparison of rate-accuracy performance and the number of trainable parameters under different machine vision tasks and different base codecs. BD-rate, BD-acc, BD-mAP are used to quantitatively measure the rate-accuracy performance with the base codec as anchor, respectively. Arrows indicate whether lower is better $(\\downarrow)$ or higher is better $(\\uparrow)$ . $(-)$ indicates the BD-rate can not be computed." + ], + "table_footnote": [], + "table_body": "
MethodClassificationDetectionSegmentationTrainable \nParams ↓(M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
Lu2022-TIC
full fine-tuning-17.68-73.94%4.51-67.98%3.767.51(100%)
TransTIC [11]-58.32%9.96-46.30%2.77-46.41%2.701.61(21.4%)
ICMH-Net [44]-18.75%3.36-9.07%0.63-10.77%0.653.98(53.0%)
channel selection [41]-37.17%6.286.84%-0.5516.51%-0.940.91(12.1%)
Ours-88.57%16.90-55.14%3.55-52.40%3.210.28(3.7%)
Cheng2020-anchor
full fine-tuning-21.04-59.20%4.69-76.03%3.8626.60(100%)
ICMH-Net [44]-47.46%10.4-8.81%0.53-12.18%0.744.43(16.6%)
channel selection [41]-41.58%8.77-11.66%0.735.22%0.221.34(4.8%)
Ours-87.56%20.27-49.34%3.13-59.90%3.480.41(1.5%)
mbt2018-mean
full fine-tuning-79.92%17.97-60.87%3.87-56.64%3.287.03(100%)
ICMH-Net [44]-15.99%3.55-6.02%0.39-4.97%0.313.98(56.6%)
channel selection [41]-41.30%9.90-23.07%1.52-15.09%1.050.91(12.9%)
Ours-82.00%18.71-56.17%3.84-52.65%3.170.28(4.1%)
", + "bbox": [ + 212, + 224, + 785, + 450 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/0d5e00d22bb2d7a6aeaa2972f00ca915a4c44e2989c0f39e632fc8e785165bf7.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 222, + 465, + 316, + 513 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/1547b665286f4f5dcbd2ffd9ae67a1162b69270d462a371843374eb04a07c12a.jpg", + "image_caption": [ + "(b)", + "Fig. 5: Different variants of SFMA: (a) Proposed SFMA. (b) SMA-only.(c) FMA-only. (d) FMA-SMA-sequential. (e) SMA-FMA-sequential. (f) SMA-SMA-parallel." + ], + "image_footnote": [], + "bbox": [ + 318, + 465, + 408, + 513 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/2015ae2e56dcf6681d5972729f0591f33a900b313774b5026bd31a3baac796e2.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 411, + 465, + 501, + 513 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/1a36831f954194abf3260fee6c9e0b654fe7b93177c949cbab44e91e49c8a6dc.jpg", + "image_caption": [ + "(d)" + ], + "image_footnote": [], + "bbox": [ + 504, + 467, + 594, + 513 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/ec2f398b936239062db603c98f51acf261326d41bd393d6986c65f0b3630101c.jpg", + "image_caption": [ + "(e)" + ], + "image_footnote": [], + "bbox": [ + 598, + 467, + 687, + 513 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/3e6a419ee0cd4e6947aae00ad3dde8c0bb911d1f23ba225147a632d3bf0c3714.jpg", + "image_caption": [ + "(f)" + ], + "image_footnote": [], + "bbox": [ + 694, + 467, + 782, + 513 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The results are shown in Tab. 2. We can observe that (1) removing either SMA or FMA leads to performance degradation, and FMA plays a more important role than SMA in the adaptation process, showing the superiority of frequency domain adaptation. (2) parallel configuration outperforms the sequential configuration. (3) barely replicating SMA has more trainable parameters compared to our SFMA, but leads to a performance degradation. This shows that the improvement of our SFMA is not only due to an overall increase in model capacity but rather to its specific structure.", + "bbox": [ + 212, + 598, + 787, + 718 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Effect on the position of SFMA. We then investigate the impact of the position to plug the SFMA. The results are shown in the Table 3. From shallow to deep, we first plug SFMA after different stages of encoder $g_{a}$ and decoder $g_{s}$ . We observe that the SFMA at the shallow layer can benefit more for the rate-accuracy performance, i.e., plugging SFMA after stage1 of $g_{a}$ and $g_{s}$ can achieve $69.54\\%$ bitrates savings for classification compared to the base codec, while plugging SFMA after stage3 of $g_{a}$ and $g_{s}$ can only achieve $64.76\\%$ bitrates savings. In addition, employing more SFMA can bring further benefits.", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 127 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/2da516834a59c5ac7fbe46f91190ea9d13b41ad9f554b77234b7d9c768d0074b.jpg", + "table_caption": [ + "Table 2: Ablations on different variants of SFMA" + ], + "table_footnote": [], + "table_body": "
MethodClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
(a)-82.00%18.71-56.17%3.84-52.65%3.170.28
(b)-73.82%16.30-51.94%3.61-48.16%2.920.16
(c)-77.40%17.29-52.86%3.32-49.58%2.900.12
(d)-80.49%18.67-56.87%3.81-51.79%3.140.28
(e)-83.31%18.50-53.77%3.79-51.28%3.020.28
(f)-79.63%17.59-54.91%3.62-50.96%3.040.32
", + "bbox": [ + 230, + 170, + 769, + 287 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/1d2adc5938235bd073886bfcc5808254eef0fa742b734679772e700153c502d0.jpg", + "table_caption": [ + "Table 3: Ablations on the position of SFMA." + ], + "table_footnote": [], + "table_body": "
Stage 1 2 3ga g₅ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
✓✓-69.54%15.95-50.72%3.39-48.27%2.920.09
✓✓-69.00%15.69-49.96%3.24-46.40%2.820.09
✓✓-64.76%13.29-50.08%3.17-39.98%2.430.09
✓✓-82.00%18.71-56.17%3.84-52.65%3.170.28
✓✓-64.75%13.28-38.84%2.88-38.67%2.280.14
✓✓-61.87%12.40-44.05%3.01-40.43%2.660.14
", + "bbox": [ + 217, + 325, + 779, + 441 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Then, we observe that SFMAs are indispensable at both the encoder and decoder side, such that removing either would lead to a significant degradation in performance. SFMA in the encoder tends to reduce redundancies in the feature for machine vision tasks. SFMA in the decoder tends to adapt the feature so that the reconstructed image is more suitable for downstream tasks.", + "bbox": [ + 212, + 468, + 785, + 542 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Effect on the middle dimension $\\hat{C}$ . Tab. 4 reports how middle dimension $\\hat{C}$ impacts the rate-accuracy performance and complexity of SFMA. The results show that enlarging the middle dimension from 1 to 128 can boost performance while leading to a higher training complexity. Thus, we set $\\hat{C}$ to 64 to make a better trade-off between performance and complexity.", + "bbox": [ + 212, + 544, + 785, + 619 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Qualitative Results", + "text_level": 1, + "bbox": [ + 215, + 641, + 419, + 657 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Fig. 6 shows the qualitative results of our Adapt-ICMH and other methods for instance segmentation. Our approach achieves superior segmentation results", + "bbox": [ + 212, + 666, + 785, + 696 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/595f8a74eb05943f8b4afa97008976a9fc36ac5453ddddf7281171aabd31f23c.jpg", + "table_caption": [ + "Table 4: Ablations on the middle dimension $\\hat{C}$ of SFMA." + ], + "table_footnote": [], + "table_body": "
\\( \\hat{C} \\)ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
1-60.41%12.58-48.58%2.93-45.24%2.400.005
32-78.74%17.52-53.61%3.53-48.50%2.920.14
64-82.00%18.71-56.17%3.84-52.65%3.170.28
128-83.61%19.50-63.28%4.11-60.50%3.760.62
", + "bbox": [ + 248, + 750, + 750, + 838 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/6bac0c40ef6c80be3fcb1c55ce2d032dcb71a2ca2815a1478e07e2275e7deb78.jpg", + "image_caption": [ + "Fig. 6: Qualitative comparison of our Adapt-ICMH with other ICMH methods. First row: The original image and decoded image of each method. We show the decoded images for machine vision of three ICMH methods (left). Second row: The instance segmentation results of each image. Third row: The log power spectral density maps of each image. Bottom row: The bit allocation maps for $\\hat{y}$ of each method." + ], + "image_footnote": [], + "bbox": [ + 217, + 142, + 784, + 470 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "with a lower bitrate (0.147bpp). In comparison to other methods, Adapt-ICMH effectively minimizes the bitrates of the background while enhancing the high-frequency edge details of the semantic object. We also observe that our method's decoded image for machine vision exhibits some distortion in terms of overall chromaticity and brightness. However, these low-frequency distortions do not affect the segmentation result, which supports the goal of our SFMA.", + "bbox": [ + 212, + 594, + 787, + 686 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.6 Towards scalable coding for machine and human vision.", + "text_level": 1, + "bbox": [ + 214, + 708, + 718, + 724 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Scalable coding for machine and human vision is of practical significance to adapt the transmission among diverse demands. The framework of Fig 3, followed by [11,41], is designed to produce a single bitstream tailored for each individual task. However, our proposed SFMA can also benefit existing scalable coding methods to achieve better scalable coding performance for machine and human vision. To demonstrate it, we integrate our SFMA and the spatial-channel mask generator proposed by ICMH-Net [44] with the base codec. Specifically, we only", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/7b70a0bbe20fac413b0e6c575058e1c11a5d40d5b843280ad98e240c490315a3.jpg", + "image_caption": [ + "Fig. 7: Quantitative and qualitative comparison of each method for the object detection task. Pre-trained mbt2018-mean [50] is used as the base codec. We present the bpp/PSNR results for the decoded image for human vision and the bpp results for the decoded image for the detection task." + ], + "image_footnote": [], + "bbox": [ + 215, + 146, + 450, + 325 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/b5bcd03b34d900b575055509cda6fab88a99c1c776b4560c3ba5177a94b39114.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 452, + 145, + 784, + 325 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "plug our SFMA into the decoder $g_{s}$ and utilize spatial-channel mask generator to produce two bitstreams, the truncated one is decoded by the $g_{s}$ with SFMAs to reconstruct image for machine vision task, while the full bitstream is decoded by the $g_{s}$ without SFMAs to reconstruct image for human vision. See Appendix F for detailed network architecture for scalable coding.", + "bbox": [ + 212, + 428, + 787, + 503 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Fig. 7 show the comparison of rate-accuracy performance and qualitative results. It demonstrates the superior performance of our SFMA, which significantly improves the rate-accuracy performance of ICMH-Net. Note that we do not alter the base codec, so the visual quality of the image reconstructed from the full bitstream is the same as the base codec.", + "bbox": [ + 212, + 507, + 787, + 583 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 625, + 359, + 640 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we develop a novel adapter-based tuning framework for ICMH, named Adapt-ICMH. Specifically, we fine-tune the pre-trained image codec optimized for human vision on multiple machine vision tasks, which is achieved by the proposed spatial-frequency modulation adapter (SFMA). Our SFMA can efficiently reduce the latent redundancies in both spatial and frequency domains, and effectively adapt the decoded image for downstream machine vision tasks. Our method is plug-and-play and compatible with all existing learned image compression models. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks, even with a reduced number of trainable parameters and computational complexity. In the future work, we will extend our work to video coding for machines and humans.", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Acknowledgement", + "text_level": 1, + "bbox": [ + 215, + 143, + 426, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported in part by the National Natural Science Foundation of China under Grant 62125109, Grant 61931023, Grant 61932022, Grant 62371288, Grant 62320106003, Grant 62301299, Grant T2122024, Grant 62120106007, China Postdoctoral Innovation Talents Support Program (BX20230184).", + "bbox": [ + 212, + 176, + 792, + 237 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 258, + 321, + 273 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bai, Y., Yang, X., Liu, X., Jiang, J., Wang, Y., Ji, X., Gao, W.: Towards end-to-end image compression and analysis with transformers. In: AAAI. vol. 36, pp. 104-112 (2022)", + "2. Balle, J., Chou, P.A., Minnen, D., Singh, S., Johnston, N., Agustsson, E., Hwang, S.J., Toderici, G.: Nonlinear transform coding. IEEE JSTSP 15(2), 339-353 (2020)", + "3. Balle, J., Laparra, V., Simoncelli, E.P.: End-to-end optimized image compression. In: ICLR (2016)", + "4. Balle, J., Minnen, D., Singh, S., Hwang, S.J., Johnston, N.: Variational image compression with a scale hyperprior. In: ICLR (2018)", + "5. Bégaint, J., Racapé, F., Feltman, S., Pushparaja, A.: Compressai: a python library and evaluation platform for end-to-end compression research. arXiv preprint arXiv:2011.03029 (2020)", + "6. Bjontegaard, G.: Calculation of average psnr differences between rd-curves. In: VCEG-M33 (2001)", + "7. Campos, J., Meierhans, S., Djelouah, A., Schroers, C.: Content adaptive optimization for neural image compression. In: CVPRW (2019)", + "8. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017)", + "9. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV. pp. 213-229. Springer (2020)", + "0. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. In: NeurIPS. vol. 35, pp. 16664-16678 (2022)", + "1. Chen, Y.H., Weng, Y.C., Kao, C.H., Chien, C., Chiu, W.C., Peng, W.H.: Transtic: Transferring transformer-based image compression from human perception to machine perception. In: ICCV. pp. 23297-23307 (2023)", + "2. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. In: ICLR (2023)", + "3. Cheng, Z., Sun, H., Takeuchi, M., Katto, J.: Learned image compression with discretized gaussian mixture likelihoods and attention modules. In: CVPR. pp. 7939-7948 (2020)", + "4. Choi, H., Bajic, I.V.: Scalable image coding for humans and machines. IEEE TIP 31, 2739-2754 (2022)", + "5. Chollet, F.: Xception: Deep learning with depthwise separable convolutions. In: CVPR. pp. 1251-1258 (2017)", + "6. Codevilla, F., Simard, J.G., Goroshin, R., Pal, C.: Learned image compression for machine perception. arXiv preprint arXiv:2111.02249 (2021)", + "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: CVPR. pp. 248-255 (2009)" + ], + "bbox": [ + 225, + 287, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Ding, S., Li, M., Yang, T., Qian, R., Xu, H., Chen, Q., Wang, J., Xiong, H.: Motion-aware contrastive video representation learning via foreground-background merging. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9716-9726 (2022)", + "19. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: ICLR (2020)", + "20. Feng, R., Gao, Y., Jin, X., Feng, R., Chen, Z.: Semantically structured image compression via irregular group-based decoupling. In: ICCV (2023)", + "21. Feng, R., Liu, J., Jin, X., Pan, X., Sun, H., Chen, Z.: Prompt-icm: A unified framework towards image coding for machines with task-driven prompts. arXiv preprint arXiv:2305.02578 (2023)", + "22. Fischer, K., Brand, F., Kaup, A.: Boosting neural image compression for machines using latent space masking. IEEE TCSVT (2022)", + "23. Girshick, R.: Fast r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 1440-1448 (2015)", + "24. He, J., Zhou, C., Ma, X., Berg-Kirkpatrick, T., Neubig, G.: Towards a unified view of parameter-efficient transfer learning. In: ICLR (2022)", + "25. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017)", + "26. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR. pp. 770-778 (2016)", + "27. He, X., Li, C., Zhang, P., Yang, J., Wang, X.E.: Parameter-efficient model adaptation for vision transformers. In: AAAI. vol. 37, pp. 817-825 (2023)", + "28. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: ICML. pp. 2790-2799. PMLR (2019)", + "29. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4700-4708 (2017)", + "30. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: ECCV. pp. 709-727. Springer (2022)", + "31. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: CVPR. pp. 19113-19122 (2023)", + "32. Koyuncu, A.B., Gao, H., Boev, A., Gaikov, G., Alshina, E., Steinbach, E.: Contextformer: A transformer with spatio-channel attention for context modeling in learned image compression. In: ECCV (2022)", + "33. Lee, J., Cho, S., Beack, S.K.: Context-adaptive entropy model for end-to-end optimized image compression. In: ICLR (2019)", + "34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: EMNLP (2021)", + "35. Li, H., Li, S., Dai, W., Li, C., Zou, J., Xiong, H.: Frequency-aware transformer for learned image compression. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=HKGQDDTuvZ", + "36. Li, H., Shi, B., Dai, W., Chen, Y., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Hierarchical graph networks for 3d human pose estimation. arXiv preprint arXiv:2111.11927 (2021)", + "37. Li, H., Shi, B., Dai, W., Zheng, H., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Pose-oriented transformer with uncertainty-guided refinement for 2d-to-3d human pose estimation. In: AAAI. vol. 37, pp. 1296-1304 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "38. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014)", + "39. Liu, J., Feng, R., Qi, Y., Chen, Q., Chen, Z., Zeng, W., Jin, X.: Rate-distortion-cognition controllable versatile neural image compression. In: ECCV. Springer (2024)", + "40. Liu, J., Jin, X., Feng, R., Chen, Z., Zeng, W.: Composable image coding for machine via task-oriented internal adaptor and external prior. In: VCIP. pp. 1-5 (2023)", + "41. Liu, J., Sun, H., Katto, J.: Improving multiple machine vision tasks in the compressed domain. In: ICPR. pp. 331-337. IEEE (2022)", + "42. Liu, J., Sun, H., Katto, J.: Learned image compression with mixed transformer-cnn architectures. In: CVPR. pp. 14388-14397 (2023)", + "43. Liu, K., Liu, D., Li, L., Yan, N., Li, H.: Semantics-to-signal scalable image compression with learned revertible representations. IJCV 129(9), 2605-2621 (2021)", + "44. Liu, L., Hu, Z., Chen, Z., Xu, D.: Icmh-net: Neural image compression towards both machine vision and human vision. In: ACM MM. pp. 8047-8056 (2023)", + "45. Liu, P., Yuan, W., Fu, J., Jiang, Z., Hayashi, H., Neubig, G.: Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing. ACM Computing Surveys 55(9), 1-35 (2023)", + "46. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV. pp. 10012-10022 (2021)", + "47. Lu, M., Guo, P., Shi, H., Cao, C., Ma, Z.: Transformer-based image compression. In: DCC. pp. 469-469 (2022)", + "48. Lv, Y., Xiang, J., Zhang, J., Yang, W., Han, X., Yang, W.: Dynamic low-rank instance adaptation for universal neural image compression. In: ACM MM. pp. 632-642 (2023)", + "49. Mentzer, F., Agustsson, E., Tschannen, M., Timofte, R., Gool, L.V.: Practical full resolution learned lossless image compression. In: CVPR. pp. 10629-10638 (2019)", + "50. Minnen, D., Balle, J., Toderici, G.D.: Joint autoregressive and hierarchical priors for learned image compression. In: NeurIPS. vol. 31 (2018)", + "51. Minnen, D., Singh, S.: Channel-wise autoregressive entropy models for learned image compression. In: ICIP. pp. 3339-3343 (2020)", + "52. Nair, V., Hinton, G.E.: Rectified linear units improve restricted boltzmann machines. In: ICML. pp. 807-814 (2010)", + "53. Pfeiffer, J., Kamath, A., Rückle, A., Cho, K., Gurevych, I.: Adapterfusion: Nondestructive task composition for transfer learning. arXiv preprint arXiv:2005.00247 (2020)", + "54. Pfeiffer, J., Rückle, A., Poth, C., Kamath, A., Vulic, I., Ruder, S., Cho, K., Gurevych, I.: Adapterhub: A framework for adapting transformers. In: EMNLP. pp. 46-54 (2020)", + "55. Qian, Y., Sun, X., Lin, M., Tan, Z., Jin, R.: Entroformer: A transformer-based entropy model for learned image compression. In: ICLR (2022)", + "56. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. In: NeurIPS. vol. 28 (2015)", + "57. Shen, S., Yue, H., Yang, J.: Dec-adapter: Exploring efficient decoder-side adapter for bridging screen content and natural image compression. In: CVPR. pp. 12887-12896 (2023)", + "58. Shi, B., Jiang, D., Zhang, X., Li, H., Dai, W., Zou, J., Xiong, H., Tian, Q.: A transformer-based decoder for semantic segmentation with multi-level context mining. In: European Conference on Computer Vision. pp. 624-639. Springer (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Adapt-ICMH", + "bbox": [ + 640, + 114, + 730, + 127 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "59. Strudel, R., Garcia, R., Laptev, I., Schmid, C.: Segmenter: Transformer for semantic segmentation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 7262-7272 (2021)", + "60. Sun, K., Xiao, B., Liu, D., Wang, J.: Deep high-resolution representation learning for human pose estimation. In: CVPR. pp. 5693-5703 (2019)", + "61. Tsubota, K., Akutsu, H., Aizawa, K.: Universal deep image compression via content-adaptive optimization with adapters. In: WACV. pp. 2529-2538 (2023)", + "62. Wang, Y., Shi, B., Zhang, X., Li, J., Liu, Y., Dai, W., Li, C., Xiong, H., Tian, Q.: Adapting shortcut with normalizing flow: An efficient tuning framework for visual recognition. In: CVPR. pp. 15965-15974 (2023)", + "63. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. In: NeurIPS. vol. 34, pp. 12077-12090 (2021)", + "64. Yang, S., Hu, Y., Yang, W., Duan, L.Y., Liu, J.: Towards coding for human and machine vision: Scalable face image coding. IEEE TMM 23, 2957-2971 (2021)", + "65. Zheng, H., Zhou, L., Li, H., Su, J., Wei, X., Xu, X.: Bem: Balanced and entropy-based mix for long-tailed semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22893-22903 (June 2024)", + "66. Zheng, S., Lu, J., Zhao, H., Zhu, X., Luo, Z., Wang, Y., Fu, Y., Feng, J., Xiang, T., Torr, P.H., et al.: Rethinking semantic segmentation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6881-6890 (2021)", + "67. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020)", + "68. Zou, R., Song, C., Zhang, Z.: The devil is in the details: Window-based attention for image compression. In: CVPR. pp. 17492-17501 (2022)" + ], + "bbox": [ + 215, + 147, + 784, + 535 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "H. Li et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_model.json b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_model.json new file mode 100644 index 0000000000000000000000000000000000000000..83870b06dbeb840439436eba7e74b24ce5065d1c --- /dev/null +++ b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_model.json @@ -0,0 +1,2590 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.246, + 0.141, + 0.758, + 0.187 + ], + "angle": 0, + "content": "Image Compression for Machine and Human Vision with Spatial-Frequency Adaptation" + }, + { + "type": "text", + "bbox": [ + 0.283, + 0.212, + 0.717, + 0.245 + ], + "angle": 0, + "content": "Han Li\\(^{1}\\), Shaohui Li\\(^{2(\\boxtimes)}\\), Shuangrui Ding\\(^{3}\\), Wenrui Dai\\(^{1(\\boxtimes)}\\), Maida Cao\\(^{1}\\), Chenglin Li\\(^{1}\\), Junni Zou\\(^{1}\\), and Hongkai Xiong\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.255, + 0.79, + 0.325 + ], + "angle": 0, + "content": "\\(^{1}\\) Shanghai Jiao Tong University \n\\(^{2}\\) Tsinghua Shenzhen International Graduate School, Tsinghua University \n\\(^{3}\\) The Chinese University of Hong Kong \n{qingshi9974, daiwenrui, caomaida, lcl1985, zoujunni, xionghongkai}@sjtu.edu.cn \nlishaohui@sz.tsinghua.edu.cn, ds023@ie.cuhk.edu.hk" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.361, + 0.744, + 0.598 + ], + "angle": 0, + "content": "Abstract. Image compression for machine and human vision (ICMH) has gained increasing attention in recent years. Existing ICMH methods are limited by high training and storage overheads due to heavy design of task-specific networks. To address this issue, in this paper, we develop a novel lightweight adapter-based tuning framework for ICMH, named Adapt-ICMH, that better balances task performance and bitrates with reduced overheads. We propose a spatial-frequency modulation adapter (SFMA) that simultaneously eliminates non-semantic redundancy with a spatial modulation adapter, and enhances task-relevant frequency components and suppresses task-irrelevant frequency components with a frequency modulation adapter. The proposed adapter is plug-and-play and compatible with almost all existing learned image compression models without compromising the performance of pre-trained models. Experiments demonstrate that Adapt-ICMH consistently outperforms existing ICMH frameworks on various machine vision tasks with fewer fine-tuned parameters and reduced computational complexity. Code will be released at https://github.com/qingshi9974/ECCV2024-AdpatICMH." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.61, + 0.726, + 0.625 + ], + "angle": 0, + "content": "Keywords: Learned Image Compression \\(\\cdot\\) Machine Vision \\(\\cdot\\) Adapter" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.65, + 0.377, + 0.667 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.681, + 0.788, + 0.817 + ], + "angle": 0, + "content": "The booming of computer vision [18,25,26,46,56,60,63,65] raises the demands for excessive images serving machine vision systems and accomplishing tasks such as classification, detection, segmentation. In practice, images from users have to be compressed and transmitted to exploit the off-the-shelf recognition models deployed in the cloud. However, compression directly using existing image CODECs, especially learned image compression (LIC) models [3, 4, 35, 42, 50, 51, 68] optimized for human vision, could cause the loss of semantic information contained in images and dramatically reduce the accuracy of downstream tasks. To meet the demands of both machine and human vision systems, unified CODEcs" + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.826, + 0.551, + 0.84 + ], + "angle": 0, + "content": "Correspondence to Wenrui Dai and Shaohui Li." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.498, + 0.327 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.149, + 0.785, + 0.327 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.341, + 0.788, + 0.427 + ], + "angle": 0, + "content": "Fig. 1: Left: our adapter-based tuning framework. Right: Rate-accuracy performance comparison on classification for ImageNet-val [17]. We compare our methods (Ours-\\(n\\) indicates \\(n\\) middle dimensions for SFMA) with full fine-tuning, TransTIC [11], ICMH-Net [44], and channel selection [41]. BD-accuracy is computed by replacing the PSNR in BD-PSNR [6] with top-1 accuracy and setting the base codec of TIC [47] as the anchor. The size of circles indicates GFLOPs for inference during encoding." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.458, + 0.785, + 0.489 + ], + "angle": 0, + "content": "to achieve image compression for machine and human vision (ICMH) have been explored [1, 11, 14, 16, 20, 22, 39-41, 43, 44, 64]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.49, + 0.785, + 0.566 + ], + "angle": 0, + "content": "A multi-task pipeline has been built for ICMH in [1, 14, 16], where a task-agnostic encoder and multiple task-specific decoders are jointly trained from scratch for human vision and multiple machine vision tasks. However, the multi-task pipeline results in degraded rate-distortion (R-D) performance for human vision and is restricted in adapting to newly coming machine vision tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.567, + 0.788, + 0.793 + ], + "angle": 0, + "content": "Since LIC models are usually fitted to the distributions of natural images [33, 49], recent works [11,22,40,41,44] tend to adopt a tuning framework that adapts a pre-trained image codec optimized for human vision (called base codec) to diverse machine vision tasks without sacrificing R-D performance. This pipeline enables ICMH by training only a lightweight module specifically for the machine vision task, while freezing the base codec parameters for sharing across human and machine vision. In ICMH-Net [44], a spatial-channel mask generator is trained to determine a subset of quantized latent for a specific machine vision task. Chen et al. [11] utilized visual prompt tuning [30] to transfer the transformer-based base codec [47] to machine vision tasks. Unfortunately, these methods suffer from evidently degraded performance compared to codec's fully fine-tuned for machine vision tasks. Besides, they introduce significant overheads of computational and model complexity to the base codec due to their task-specific designs. It remains a challenge to achieve efficient fine-tuning of pre-trained human vision-oriented image codec on machine vision tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In this paper, we consider the fact that almost all spatial and frequency components of an image are exploited by the base codec to improve the visual quality for human vision but could be redundant for machine vision tasks. We are" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.785, + 0.206 + ], + "angle": 0, + "content": "thereby motivated to modulate the intermediate feature of the base codec in both spatial and frequency domains such that the redundancy in the latent representation can be reduced and the reconstructed image can be efficiently adapted to various machine vision tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.788, + 0.419 + ], + "angle": 0, + "content": "To this end, we propose a play-and-plug module of spatial-frequency modulation adapter (SFMA) to better balance the machine vision task performance and transmission cost. Specifically, the proposed SFMA consists of two parallel submodules, i.e., a spatial modulation adapter (SMA) that eliminates non-semantic redundancies in the spatial domain and a frequency modulation adapter (FMA) that amplifies the frequency components that contribute more to the machine vision task (e.g., high-frequency components are more crucial for segmentation) and suppresses the redundant frequency components. Furthermore, we develop an adapter-based tuning framework for ICHM, named Adapt-ICMH, by plugging the proposed SFMA into both the encoder and decoder of the base codec, as depicted in Fig. 1. It should be noted that, different from [11] that can only adapt the transformer-based base codec, Adapt-ICMH is architecture-agnostic such that it is compatible with almost all existing LIC models for adaptation to various machine vision tasks. In summary, our contributions include:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.427, + 0.784, + 0.47 + ], + "angle": 0, + "content": "- We propose a spatial-frequency modulation adapter (SFMA) to efficiently update the intermediate feature and better balance the performance and bitrates for diverse machine vision tasks." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.472, + 0.785, + 0.516 + ], + "angle": 0, + "content": "- Based on SFMA, we develop a novel tuning framework named Adapt-ICMH to achieve image coding for machine and human vision with a shared base codec, significantly reducing the training and storage overhead." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.517, + 0.785, + 0.577 + ], + "angle": 0, + "content": "- Our SFMA is plug-and-play, which could be incorporated with all existing LIC models to achieve ICMH. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks with even reduced model and computational complexity." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.427, + 0.785, + 0.577 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.599, + 0.388, + 0.615 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.793 + ], + "angle": 0, + "content": "Learned Image Compression (LIC) has attracted wide attention due to its superior rate-distortion (R-D) performance. Research in LIC can be categorized into two main paths. The first focuses on enhancing the nonlinear transforms [2], evolving from convolutional neural networks (CNN)-based [3,4,50,51] to attention-based transforms [13], and more recently, transformer-based transforms [35,42,47,68]. The second path involves designing more powerful entropy models. Prior works [3,4] proposed factorized and hyperprior models, while recent efforts [32,50,51,55] tend to introduce spatial or channel-wise autoregression in the entropy model. However, these methods focus solely on the human visual quality of the decoded image, while ignoring the application in downstream machine vision tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Image Compression for Machine and Human Vision (ICMH) has become a hot topic in recent years due to the growing number of images that need to be processed for various machine vision tasks, such as classification [17,26,29]," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.346, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.784, + 0.207 + ], + "angle": 0, + "content": "detection [9,23,67], segmentation [25,58,59,66] and pose estimation [8,36,37,60]. One straight way is to fully fine-tune the base codec on machine vision tasks. However, this requires storing and deploying a separate copy of the entire codec network for each individual task, which severely hampers practical applicability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.788, + 0.465 + ], + "angle": 0, + "content": "Earlier works [1, 14, 16, 41] presented a multi-task pipeline to unify the image coding for machine and human vision. However, it still requires multiple task-specific decoders, leading to increased storage overhead. In addition, the entire network must be trained from scratch, resulting in significant training overhead and impeding the adaptation to newly coming machine vision tasks. To address this problem, Liu et al. [44] proposed to leverage the pre-trained human vision-oriented base codec and train an extra spatial-channel mask generator to transmit a subset of latent for machine vision task. Unfortunately, it cannot be easily extended to autoregression-based entropy models [50, 51] and fails to achieve adaptation of the nonlinear transforms. Chen et al. [11] proposed a prompt-based tuning framework that introduces prompts in the transformer-based nonlinear transforms for machine vision. However, it cannot be compatible with the mainstream CNN-based LIC methods [3, 4, 13] and the performance is still highly inferior to full fine-tuning. In contrast, our framework generalizes to almost all existing LIC models with different nonlinear transforms and entropy models and achieves comparable rate-accuracy performance compared to full fine-tuning. See Appendix B for more discussions about ICMH." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.465, + 0.788, + 0.693 + ], + "angle": 0, + "content": "Parameter-Efficient Fine-Tuning (PEFT) has been extensively studied for NLP [24, 28, 34, 45, 53, 54]. It can effectively fine-tune a pre-trained large-scale model on downstream tasks or datasets with the major model frozen. With the advent of vision transformers [9, 19, 46], researchers have applied PEFT tools to machine vision tasks, including prompt tuning [30, 31], adapters [10, 12, 62], and LoRA [27]. In the field of learned image compression, Feng et al. [21] first introduced prompts for machine-oriented image coding, while Liu et al. [11] further explored the application of prompt-tuning for ICMH. [48, 57, 61] transmitted the parameters of additional adapters for content-adaptive optimization [7, 33] to improve the human visual quality of the decoded image, which is completely different from ours in terms of methodology and application scenarios. In addition, naive adapters [10, 28, 40] update the feature without considering the transmission cost of different underlying frequencies and spatial components of the image, which is vital for ICMH. In our paper, we propose a novel spatial-frequency modulation adapter specifically for ICHM to address this limitation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.717, + 0.338, + 0.733 + ], + "angle": 0, + "content": "3 Methods" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.752, + 0.585, + 0.768 + ], + "angle": 0, + "content": "3.1 Empirical Findings by Full Fine-tuning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "We first conduct a simple experiment to highlight the key insight of this paper: image compression for machine vision tends to prioritize transmitting distinct spatial and frequency information compared to human vision. This preference also varies across specific machine vision tasks." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.208, + 0.331, + 0.283 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.256, + 0.322, + 0.305, + 0.332 + ], + "angle": 0, + "content": "Input Image" + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.145, + 0.774, + 0.333 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.345, + 0.788, + 0.457 + ], + "angle": 0, + "content": "Fig. 2: Visualization of the bit allocation maps (first row) and power spectral density maps (second row) of the latent \\(\\hat{y}\\). The left part shows the raw input image. Each column of the right part corresponds to a codec for each task, including the base codec for human vision and three fine-tuned CODEs for machine vision tasks. The bit allocation map is computed by averaging the negative log-likelihood (i.e., \\(-\\log_2p(\\hat{y})\\)) across channels. The power spectral density map is computed by applying the Fast Fourier Transform (FFT) to \\(\\hat{y}\\) with a shift operation to center the zero frequency component, and then averaging its absolute value across channels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.486, + 0.788, + 0.577 + ], + "angle": 0, + "content": "Taking the pre-trained mean-scale hyperprior\\(^4\\) model [50] optimized for human vision as the base codec, we fully fine-tune\\(^5\\) it on three different machine vision tasks, including classification, object detection, and instance segmentation. Then, we feed the same image to the base codec and three fine-tuned CODECs, respectively. The bit allocation map and power spectral density map of latent \\(\\hat{y}\\) for each codec are shown in Fig. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.578, + 0.788, + 0.713 + ], + "angle": 0, + "content": "From the bit allocation map, we can see that the base codec consumes more bitrates in the complex background region, while the CODEs that are fully finetuned on machine tasks pay more attention to the semantic object. In addition, we can see from the power spectral density maps that the base codec tends to encode frequency components as many as possible to achieve higher visual quality. However, many of these frequency components are redundant for machine vision. For example, instance segmentation prefers more mid- and high-frequency components for accurate edge and contour reconstruction, while low- and mid-frequency components are sufficient for simpler tasks (e.g., classification)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.713, + 0.788, + 0.805 + ], + "angle": 0, + "content": "These observations confirm that image compression has different spatial and frequency domain preferences for different tasks. However, fully fine-tuning the base codec on different machine vision tasks is costly in terms of training time and memory. Thus, in this paper, we propose a spatial-frequency modulation adapter to conduct efficient fine-tuning, and effectively reduce the redundancies in both spatial and frequency domains for machine vision tasks." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.774, + 0.826 + ], + "angle": 0, + "content": "4 We use the pre-trained model (named mbt2018-mean) offered by CompressAI [5]." + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.826, + 0.603, + 0.84 + ], + "angle": 0, + "content": "5 We use loss function (1) to conduct the full fine-tuning." + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.811, + 0.774, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.439, + 0.161 + ], + "angle": 0, + "content": "3.2 Framework Overview" + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.196, + 0.789, + 0.464 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.474, + 0.789, + 0.571 + ], + "angle": 0, + "content": "Fig. 3: Overview of our proposed Adapt-ICMH framework. Multiple spatial-frequency modulation adapters (SFMA) are plugged into the encoder \\( g_{a} \\) and decoder \\( g_{s} \\) of the base codec for feature adaptation. During the adaptation to the machine vision task, the base codec is frozen and only these adapters are trainable. For briefness, we do not illustrate the specific architecture of the encoder, decoder stage, and entropy model, as it depends on the specific base codec. Please see Appendix E for the detailed architecture." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.605, + 0.789, + 0.695 + ], + "angle": 0, + "content": "Our compression framework Adapt-ICMH, shown in Fig. 3, is designed to adapt the existing learned image compression model that is optimized for human vision (i.e., base codec) to downstream machine vision tasks. To this end, we propose the Spatial-Frequency Modulation Adapter (SFMA), a plug-and-play bottleneck module, which is plugged into the encoder \\( g_{a} \\) and decoder \\( g_{s} \\) of the base codec for feature adaptation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.696, + 0.789, + 0.756 + ], + "angle": 0, + "content": "During the adaptation stage, the weights of the base codec (blue part) are loaded from the pre-trained checkpoint and kept frozen. Therefore, we only optimize the added adapters (red part) for specific machine vision tasks with the following loss function:" + }, + { + "type": "equation", + "bbox": [ + 0.416, + 0.772, + 0.787, + 0.788 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {R} + \\lambda \\cdot \\mathcal {D} (\\boldsymbol {x}, \\hat {\\boldsymbol {x}}; \\mathcal {G}), \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.843 + ], + "angle": 0, + "content": "where \\(\\mathcal{R}\\) denotes the overall estimated bitrates, \\(\\mathcal{D}\\) calculates the task-specific perceptual distortion between raw image \\(\\pmb{x}\\) and reconstructed image \\(\\hat{\\pmb{x}}\\) with an off-the-shelf recognition model \\(\\mathcal{G}\\) (e.g., Faster RCNN [56] for object detection)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "\\(\\lambda\\) is a trade-off term to balance the task performance and bitrates. Please refer to Appendix C for more details about loss function." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.269 + ], + "angle": 0, + "content": "After adaptation, we can only modify the weights of lightweight adapters for different machine vision tasks, while keeping the parameters of the base codec unchanged. If an image needs to be compressed for human vision, we can directly remove the adapters to obtain the original base codec, so that the R-D performance for human vision is not affected. In this way, a single base codec model can be used for both human vision and multiple machine vision tasks." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.291, + 0.586, + 0.307 + ], + "angle": 0, + "content": "3.3 Spatial-Frequency Modulation Adapter" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.316, + 0.789, + 0.468 + ], + "angle": 0, + "content": "The proposed Spatial-Frequency Modulation Adapter (SFMA) consists of a Spatial Modulation Adapter (SMA) and a Frequency Modulation Adapter (FMA), which are configured in a parallel way. As shown in Fig. 3, the encoder \\( g_{a} \\) of base codec generally consists of four stages, denoted by \\( g_{a} = g_{a1} \\circ g_{a2} \\circ g_{a3} \\circ g_{a4} \\). Given the input image \\( \\pmb{x} \\in \\mathbb{R}^{3 \\times H \\times W} \\), where \\( H \\times W \\) is the spatial resolution, we define the output feature of the \\( j \\)-th intermediate stage of \\( g_{a} \\) as \\( \\pmb{x}_{j} \\in \\mathbb{R}^{C_{j} \\times H_{j} \\times W_{j}} \\), where \\( C_{j} \\) is the number of channels, \\( H_{j} = H / 2^{j} \\), \\( W_{j} = W / 2^{j} \\), and \\( j \\in \\{1, 2, 3\\} \\). Supposing that the SFMA plugged after the \\( j \\)-th encoder stage is denoted by \\( \\mathrm{SFMA}_{j} \\), we can obtain the adapted feature \\( \\tilde{\\pmb{x}}_{j} \\) by aggregating original input feature \\( \\pmb{x}_{j} \\) with the adapted component. The process can be defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.378, + 0.481, + 0.785, + 0.535 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\tilde {\\boldsymbol {x}} _ {j} = \\operatorname {S F M A} _ {j} (\\boldsymbol {x} _ {j}) \\\\ = \\boldsymbol {x} _ {j} + \\underbrace {\\operatorname {F M A} _ {j} \\left(\\boldsymbol {x} _ {j}\\right) + \\operatorname {S M A} _ {j} \\left(\\boldsymbol {x} _ {j}\\right)} _ {\\text {a d a p t e d c o m p o n e n t}}, \\tag {2} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.545, + 0.794, + 0.75 + ], + "angle": 0, + "content": "where \\(\\mathrm{FMA}_j\\) and \\(\\mathrm{SMA}_j\\) denote the \\(j\\)-th frequency and spatial modulation adapter, respectively. The process of the adapter for decoder \\(g_{s}\\) can be derived similarly. Frequency Modulation Adapter. Our frequency modulation adapter (FMA) is designed to adapt the feature in the frequency domain. By this modulation operation, we can eliminate frequency redundancies and amplify the important frequency components for machine vision tasks. Specifically, the input \\(\\pmb{x}_j \\in \\mathbb{R}^{C_j \\times H_j \\times W_j}\\) firstly be down-projected to a bottleneck middle dimension \\(\\hat{C} (\\hat{C} \\leq C_j)\\) by a linear layer \\(\\pmb{W}_{\\mathrm{down}}^{\\mathrm{f}} \\in \\mathbb{R}^{C_j \\times \\hat{C}}\\) and then be transformed into frequency domain by fast Fourier transform (FFT), obtaining the middle feature \\(\\pmb{x}_j^{\\mathrm{f}}\\). Subsequently, we generate a frequency modulation matrix \\(\\pmb{m}_j^{\\mathrm{f}}\\) and then use Hadamard product to calculate the modulated result \\(\\bar{\\pmb{x}}_j^{\\mathrm{f}}\\). Finally, \\(\\bar{\\pmb{x}}_j^{\\mathrm{f}}\\) is inversely transformed using inverse FFT (IFFT) and up-projected by another linear layer \\(\\pmb{W}_{\\mathrm{up}}^{\\mathrm{f}} \\in \\mathbb{R}^{\\hat{C} \\times C_j}\\). The overall process of FMA can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.763, + 0.785, + 0.845 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\boldsymbol {x} _ {j} ^ {\\mathrm {f}} = \\mathcal {F} (\\boldsymbol {x} _ {j} \\cdot \\boldsymbol {W} _ {\\text {d o w n}} ^ {\\mathrm {f}}, \\\\ \\boldsymbol {m} _ {j} ^ {\\mathrm {f}} = \\sigma (\\operatorname {D W - C o n v} _ {3 \\times 3} \\left(\\boldsymbol {x} _ {j} ^ {\\mathrm {f}}\\right)) \\cdot \\boldsymbol {W} _ {\\text {m i d d l e}} ^ {\\mathrm {f}}, \\tag {3} \\\\ \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}} = \\boldsymbol {x} _ {j} ^ {\\mathrm {f}} \\odot \\sigma (\\boldsymbol {m} _ {j} ^ {\\mathrm {f}}), \\\\ \\tilde {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}} = \\mathcal {F} ^ {- 1} (\\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}}) \\cdot \\boldsymbol {W} _ {\\mathrm {u p}} ^ {\\mathrm {f}} \\\\ \\end{array}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.128 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.194 + ], + "angle": 0, + "content": "where \\(\\sigma\\) denotes ReLU [52], DW-Conv\\(_{3\\times 3}\\) denotes depth-wise convolution [15] with kernel size \\(3\\times 3\\), \\(\\mathbf{W}_{\\mathrm{middle}}^{\\mathrm{f}}\\in \\mathbb{R}^{\\hat{C}\\times \\hat{C}}\\) is a linear layer, \\(\\odot\\) denotes Hadamard product, and \\(\\mathcal{F}(\\cdot)\\) and \\(\\mathcal{F}^{-1}(\\cdot)\\) denote the FFT and IFFT, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.195, + 0.785, + 0.354 + ], + "angle": 0, + "content": "Spatial Modulation Adapter. Our spatial modulation adapter (SMA) is designed to adapt features in the spatial domain, thus guiding the codec to focus more on the semantic region and reduce the spatial redundancies in the background. Similarly, the input \\( \\boldsymbol{x}_j \\in \\mathbb{R}^{C_j \\times H_j \\times W_j} \\) is first down-projected to a bottleneck middle dimension \\( \\hat{C} \\) by a linear layer \\( W_{\\mathrm{down1}}^{\\mathrm{s}} \\in \\mathbb{R}^{C_j \\times \\hat{C}} \\), obtaining the middle feature \\( \\boldsymbol{x}_j^{\\mathrm{s}} \\). Then, we produce the spatial modulation matrix \\( \\boldsymbol{m}_j^{\\mathrm{s}} \\) by feeding \\( \\boldsymbol{x}_j \\) to another down-projection linear layer \\( W_{\\mathrm{down2}}^{\\mathrm{s}} \\in \\mathbb{R}^{C_j \\times \\hat{C}} \\) followed by a \\( 5 \\times 5 \\) depth-wise convolution layer. We then apply an up-projection linear layer \\( W_{\\mathrm{up}}^{\\mathrm{s}} \\in \\mathbb{R}^{\\hat{C} \\times C_j} \\) to the modulated feature to get the spatial adapted result. The overall process of SMA can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.381, + 0.367, + 0.785, + 0.445 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\boldsymbol {x} _ {j} ^ {\\mathrm {s}} = \\boldsymbol {x} _ {j} \\cdot \\boldsymbol {W} _ {\\text {d o w n 1}} ^ {\\mathrm {s}}, \\\\ \\boldsymbol {m} _ {j} ^ {\\mathrm {s}} = \\operatorname {D W - C o n v} _ {5 \\times 5} \\left(\\boldsymbol {x} _ {j} ^ {\\mathrm {s}} \\cdot \\boldsymbol {W} _ {\\text {d o w n} 2} ^ {\\mathrm {s}}\\right), (4) \\\\ \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} = \\boldsymbol {x} _ {j} ^ {\\mathrm {s}} \\odot \\sigma \\left(\\boldsymbol {m} _ {j} ^ {\\mathrm {s}}\\right), (4) \\\\ \\tilde {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} = \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} \\cdot \\boldsymbol {W} _ {\\mathrm {u p}} ^ {\\mathrm {s}}, \\\\ \\end{array}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.461, + 0.376, + 0.478 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.49, + 0.513, + 0.506 + ], + "angle": 0, + "content": "4.1 Training Details and Datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.512, + 0.788, + 0.77 + ], + "angle": 0, + "content": "To demonstrate the generalization ability of our framework, we adopt three mainstream LIC methods, i.e., stacked convolution-based [50], residual network-based [13], and transformer-based [47] image compression model. We use their pretrained models from CompressAI [5] library as base codes, denoted by mbt2018-mean, cheng2020-anchor and Lu2022-TIC, respectively. For benchmark machine vision tasks, we evaluate our framework on classification, object detection, and instance segmentation, respectively. By freezing these base codec's pre-trained for human vision, we then train our SFMAs using the task-specific loss of Eq. (1) with the bottleneck middle dimension \\(\\hat{C}\\) set to 64. Specifically, we train the classification task on ImageNet-train dataset [17] for 8 epochs with a batch size of 16, and train the object detection and instance segmentation tasks on COCO2017-train dataset [38] both for 40 epochs with a batch size of 8. The images are randomly cropped and resized to \\(256\\times 256\\) for training all tasks. For the calculation of task-specific perceptual distortion term in the Eq. (1), we follow [11] to use the pre-trained ResNet50 [26], Faster R-CNN [56] and Mask R-CNN [25] for classification, object detection, and instance segmentation, respectively. More training details are included in Appendix C." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.788, + 0.352, + 0.803 + ], + "angle": 0, + "content": "4.2 Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "We follow the setting of [11] to evaluate the performance of our method. Specifically, we use bits per pixel (BPP) to evaluate bitrates for compression. For image" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "classification, the evaluations are conducted on the ImageNet-val dataset [17] and images are resized and center cropped to \\(256 \\times 256\\). We adopt the pre-trained ResNet50 from torchvision library as the off-the-shelf recognition model and use top-1 accuracy as the quality metric. For objection detection and instance segmentation, the evaluations are both done on the COCO2017-val dataset [38] by using the pre-trained Faster R-CNN and Mask R-CNN from detectron2 library as the off-the-shelf recognition model, respectively. The test images are resized to 800 pixels for the short side and we use mean average precision (mAP) with an Intersection of Union (IoU) threshold of 0.5 as the quality metric." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.308, + 0.49, + 0.323 + ], + "angle": 0, + "content": "4.3 Rate-Accuracy Comparison" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.334, + 0.788, + 0.425 + ], + "angle": 0, + "content": "We compare the rate-accuracy performance of our methods with the state-of-the-art (SOTA) methods\\(^6\\), including TransTIC [11], ICMH-Net [44], and channel selection [41]. Note that our method has an equal R-D performance for human vision with these methods, since we all adopt the pre-trained image codec as base codec and freeze it. We also evaluate the rate-accuracy performance of the base codec and further full fine-tuning it on machine vision tasks end-to-end." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.425, + 0.788, + 0.546 + ], + "angle": 0, + "content": "The rate-accuracy curves for competing methods are shown in Fig. 4. In addition, we also summarize the average bitrates savings, accuracy improvements, and the trainable parameters count of different methods in Tab. 1. Specifically, we report the BD-rate [6] results to quantify the average bitrates savings with equal task accuracy, we also follow [11] to report BD-acc/BD-mAP results to measure the average task accuracy improvements with equal bitrates. BD-acc/BD-mAP is calculated by replacing the PSNR in BD-PSNR with top-1 accuracy/mAP." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.547, + 0.789, + 0.789 + ], + "angle": 0, + "content": "From the results of Fig. 4 and Tab. 1, we can observe that (1) our method consistently achieves excellent performance across all three machine vision tasks and outperforms [11, 41, 44], the superiority is more significant on the classification task; (2) Our method demonstrates strong generalization ability as it can effectively generalize to three different base CODEs, despite their varying architectures of nonlinear transforms (i.e., \\( g_{a} \\) and \\( g_{s} \\)) and entropy models. (3) our method achieve comparable or even superior performance to full fine-tuning. However, full fine-tuning requires storing and deploying a separate copy of the entire codec for each task, significantly increasing training and storage overhead and severely hindering practical applicability. (4) our method requires fewer trainable parameters (i.e., about \\( 1 \\sim 5\\% \\) of the number of parameters of the base codec) compared to other tuning-based methods (i.e., about \\( 1 \\sim 5\\% \\) of the number of parameters of the base codec), which demonstrates the parameter efficiency of our method. For the application on larger transformer-based image CODEs [35, 42, 68], see Appendix H. For the comparison of computational complexity, see Appendix G." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.797, + 0.788, + 0.84 + ], + "angle": 0, + "content": "6 Since ICMH-Net [44] and channel selection [41] are not open source and use different recognition models and test datasets than ours, we reproduce them with the same training settings as ours. See Appendix D for more details." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "image", + "bbox": [ + 0.234, + 0.145, + 0.412, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.414, + 0.145, + 0.593, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.594, + 0.146, + 0.77, + 0.265 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.381, + 0.267, + 0.624, + 0.278 + ], + "angle": 0, + "content": "(a) Lu2022-TIC model [47] as base codec" + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.279, + 0.412, + 0.397 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.414, + 0.279, + 0.591, + 0.397 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.593, + 0.279, + 0.769, + 0.397 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.362, + 0.4, + 0.642, + 0.411 + ], + "angle": 0, + "content": "(b) Cheng2020-anchor model [13] as base codec" + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.412, + 0.411, + 0.53 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.415, + 0.412, + 0.591, + 0.53 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.593, + 0.412, + 0.77, + 0.53 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.374, + 0.532, + 0.63, + 0.544 + ], + "angle": 0, + "content": "(c) mbt2018-mean model [50] as base codec" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.555, + 0.788, + 0.583 + ], + "angle": 0, + "content": "Fig. 4: Rate-Accuracy performance comparison under different machine vision tasks and different base codecs." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.628, + 0.388, + 0.644 + ], + "angle": 0, + "content": "4.4 Ablation study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.658, + 0.787, + 0.702 + ], + "angle": 0, + "content": "We conduct ablation studies to investigate how each design in our SFMA influences the overall performance. Without loss of generality, we use the pre-trained mbt2018-mean as the base codec for convenience." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Effect on the architecture of SFMA. We first explore the impact of the architecture of SFMA on performance by conducting experiments with various variants of SFMA, as summarized in Fig. 5. (a) Proposed SFMA: The default configuration of SFMA. (b) SMA-only: The FMA branch is removed, retaining only the SMA branch. (c) FMA-only: The SMA branch is removed, retaining only the FMA branch. (d) FMA-SMA-sequential: FMA and SMA are organized sequentially, where SMA is followed by FMA. (e) SMA-FMA-sequential: FMA and SMA are organized sequentially, where FMA is followed by SMA. (f) SMA-SMA-parallel: two SMAs are configured in parallel." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Comparison of rate-accuracy performance and the number of trainable parameters under different machine vision tasks and different base codecs. BD-rate, BD-acc, BD-mAP are used to quantitatively measure the rate-accuracy performance with the base codec as anchor, respectively. Arrows indicate whether lower is better \\((\\downarrow)\\) or higher is better \\((\\uparrow)\\). \\((-)\\) indicates the BD-rate can not be computed." + }, + { + "type": "table", + "bbox": [ + 0.214, + 0.226, + 0.787, + 0.452 + ], + "angle": 0, + "content": "
MethodClassificationDetectionSegmentationTrainable \nParams ↓(M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
Lu2022-TIC
full fine-tuning-17.68-73.94%4.51-67.98%3.767.51(100%)
TransTIC [11]-58.32%9.96-46.30%2.77-46.41%2.701.61(21.4%)
ICMH-Net [44]-18.75%3.36-9.07%0.63-10.77%0.653.98(53.0%)
channel selection [41]-37.17%6.286.84%-0.5516.51%-0.940.91(12.1%)
Ours-88.57%16.90-55.14%3.55-52.40%3.210.28(3.7%)
Cheng2020-anchor
full fine-tuning-21.04-59.20%4.69-76.03%3.8626.60(100%)
ICMH-Net [44]-47.46%10.4-8.81%0.53-12.18%0.744.43(16.6%)
channel selection [41]-41.58%8.77-11.66%0.735.22%0.221.34(4.8%)
Ours-87.56%20.27-49.34%3.13-59.90%3.480.41(1.5%)
mbt2018-mean
full fine-tuning-79.92%17.97-60.87%3.87-56.64%3.287.03(100%)
ICMH-Net [44]-15.99%3.55-6.02%0.39-4.97%0.313.98(56.6%)
channel selection [41]-41.30%9.90-23.07%1.52-15.09%1.050.91(12.9%)
Ours-82.00%18.71-56.17%3.84-52.65%3.170.28(4.1%)
" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.466, + 0.317, + 0.515 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.262, + 0.517, + 0.278, + 0.526 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.319, + 0.467, + 0.41, + 0.514 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.356, + 0.517, + 0.372, + 0.526 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.412, + 0.467, + 0.503, + 0.515 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.45, + 0.518, + 0.465, + 0.527 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.468, + 0.596, + 0.515 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.543, + 0.519, + 0.558, + 0.528 + ], + "angle": 0, + "content": "(d)" + }, + { + "type": "image", + "bbox": [ + 0.599, + 0.468, + 0.689, + 0.515 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.638, + 0.519, + 0.653, + 0.528 + ], + "angle": 0, + "content": "(e)" + }, + { + "type": "image", + "bbox": [ + 0.695, + 0.468, + 0.783, + 0.515 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.731, + 0.519, + 0.744, + 0.528 + ], + "angle": 0, + "content": "(f)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.54, + 0.785, + 0.569 + ], + "angle": 0, + "content": "Fig. 5: Different variants of SFMA: (a) Proposed SFMA. (b) SMA-only.(c) FMA-only. (d) FMA-SMA-sequential. (e) SMA-FMA-sequential. (f) SMA-SMA-parallel." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.788, + 0.719 + ], + "angle": 0, + "content": "The results are shown in Tab. 2. We can observe that (1) removing either SMA or FMA leads to performance degradation, and FMA plays a more important role than SMA in the adaptation process, showing the superiority of frequency domain adaptation. (2) parallel configuration outperforms the sequential configuration. (3) barely replicating SMA has more trainable parameters compared to our SFMA, but leads to a performance degradation. This shows that the improvement of our SFMA is not only due to an overall increase in model capacity but rather to its specific structure." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Effect on the position of SFMA. We then investigate the impact of the position to plug the SFMA. The results are shown in the Table 3. From shallow to deep, we first plug SFMA after different stages of encoder \\( g_{a} \\) and decoder \\( g_{s} \\). We observe that the SFMA at the shallow layer can benefit more for the rate-accuracy performance, i.e., plugging SFMA after stage1 of \\( g_{a} \\) and \\( g_{s} \\) can achieve \\( 69.54\\% \\) bitrates savings for classification compared to the base codec, while plugging SFMA after stage3 of \\( g_{a} \\) and \\( g_{s} \\) can only achieve \\( 64.76\\% \\) bitrates savings. In addition, employing more SFMA can bring further benefits." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.348, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.333, + 0.145, + 0.671, + 0.159 + ], + "angle": 0, + "content": "Table 2: Ablations on different variants of SFMA" + }, + { + "type": "table", + "bbox": [ + 0.231, + 0.171, + 0.77, + 0.288 + ], + "angle": 0, + "content": "
MethodClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
(a)-82.00%18.71-56.17%3.84-52.65%3.170.28
(b)-73.82%16.30-51.94%3.61-48.16%2.920.16
(c)-77.40%17.29-52.86%3.32-49.58%2.900.12
(d)-80.49%18.67-56.87%3.81-51.79%3.140.28
(e)-83.31%18.50-53.77%3.79-51.28%3.020.28
(f)-79.63%17.59-54.91%3.62-50.96%3.040.32
" + }, + { + "type": "table_caption", + "bbox": [ + 0.347, + 0.3, + 0.655, + 0.313 + ], + "angle": 0, + "content": "Table 3: Ablations on the position of SFMA." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.326, + 0.781, + 0.442 + ], + "angle": 0, + "content": "
Stage 1 2 3ga g₅ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
✓✓-69.54%15.95-50.72%3.39-48.27%2.920.09
✓✓-69.00%15.69-49.96%3.24-46.40%2.820.09
✓✓-64.76%13.29-50.08%3.17-39.98%2.430.09
✓✓-82.00%18.71-56.17%3.84-52.65%3.170.28
✓✓-64.75%13.28-38.84%2.88-38.67%2.280.14
✓✓-61.87%12.40-44.05%3.01-40.43%2.660.14
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.469, + 0.787, + 0.544 + ], + "angle": 0, + "content": "Then, we observe that SFMAs are indispensable at both the encoder and decoder side, such that removing either would lead to a significant degradation in performance. SFMA in the encoder tends to reduce redundancies in the feature for machine vision tasks. SFMA in the decoder tends to adapt the feature so that the reconstructed image is more suitable for downstream tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.545, + 0.787, + 0.621 + ], + "angle": 0, + "content": "Effect on the middle dimension \\(\\hat{C}\\). Tab. 4 reports how middle dimension \\(\\hat{C}\\) impacts the rate-accuracy performance and complexity of SFMA. The results show that enlarging the middle dimension from 1 to 128 can boost performance while leading to a higher training complexity. Thus, we set \\(\\hat{C}\\) to 64 to make a better trade-off between performance and complexity." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.642, + 0.421, + 0.658 + ], + "angle": 0, + "content": "4.5 Qualitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.667, + 0.787, + 0.698 + ], + "angle": 0, + "content": "Fig. 6 shows the qualitative results of our Adapt-ICMH and other methods for instance segmentation. Our approach achieves superior segmentation results" + }, + { + "type": "table_caption", + "bbox": [ + 0.306, + 0.723, + 0.696, + 0.737 + ], + "angle": 0, + "content": "Table 4: Ablations on the middle dimension \\( \\hat{C} \\) of SFMA." + }, + { + "type": "table", + "bbox": [ + 0.249, + 0.75, + 0.751, + 0.839 + ], + "angle": 0, + "content": "
\\( \\hat{C} \\)ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
1-60.41%12.58-48.58%2.93-45.24%2.400.005
32-78.74%17.52-53.61%3.53-48.50%2.920.14
64-82.00%18.71-56.17%3.84-52.65%3.170.28
128-83.61%19.50-63.28%4.11-60.50%3.760.62
" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.143, + 0.785, + 0.472 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.483, + 0.788, + 0.555 + ], + "angle": 0, + "content": "Fig. 6: Qualitative comparison of our Adapt-ICMH with other ICMH methods. First row: The original image and decoded image of each method. We show the decoded images for machine vision of three ICMH methods (left). Second row: The instance segmentation results of each image. Third row: The log power spectral density maps of each image. Bottom row: The bit allocation maps for \\(\\hat{y}\\) of each method." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.595, + 0.788, + 0.687 + ], + "angle": 0, + "content": "with a lower bitrate (0.147bpp). In comparison to other methods, Adapt-ICMH effectively minimizes the bitrates of the background while enhancing the high-frequency edge details of the semantic object. We also observe that our method's decoded image for machine vision exhibits some distortion in terms of overall chromaticity and brightness. However, these low-frequency distortions do not affect the segmentation result, which supports the goal of our SFMA." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.709, + 0.72, + 0.725 + ], + "angle": 0, + "content": "4.6 Towards scalable coding for machine and human vision." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Scalable coding for machine and human vision is of practical significance to adapt the transmission among diverse demands. The framework of Fig 3, followed by [11,41], is designed to produce a single bitstream tailored for each individual task. However, our proposed SFMA can also benefit existing scalable coding methods to achieve better scalable coding performance for machine and human vision. To demonstrate it, we integrate our SFMA and the spatial-channel mask generator proposed by ICMH-Net [44] with the base codec. Specifically, we only" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.147, + 0.452, + 0.327 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.453, + 0.146, + 0.785, + 0.327 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.336, + 0.788, + 0.392 + ], + "angle": 0, + "content": "Fig. 7: Quantitative and qualitative comparison of each method for the object detection task. Pre-trained mbt2018-mean [50] is used as the base codec. We present the bpp/PSNR results for the decoded image for human vision and the bpp results for the decoded image for the detection task." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.429, + 0.788, + 0.505 + ], + "angle": 0, + "content": "plug our SFMA into the decoder \\( g_{s} \\) and utilize spatial-channel mask generator to produce two bitstreams, the truncated one is decoded by the \\( g_{s} \\) with SFMAs to reconstruct image for machine vision task, while the full bitstream is decoded by the \\( g_{s} \\) without SFMAs to reconstruct image for human vision. See Appendix F for detailed network architecture for scalable coding." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.584 + ], + "angle": 0, + "content": "Fig. 7 show the comparison of rate-accuracy performance and qualitative results. It demonstrates the superior performance of our SFMA, which significantly improves the rate-accuracy performance of ICMH-Net. Note that we do not alter the base codec, so the visual quality of the image reconstructed from the full bitstream is the same as the base codec." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.625, + 0.36, + 0.641 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In this paper, we develop a novel adapter-based tuning framework for ICMH, named Adapt-ICMH. Specifically, we fine-tune the pre-trained image codec optimized for human vision on multiple machine vision tasks, which is achieved by the proposed spatial-frequency modulation adapter (SFMA). Our SFMA can efficiently reduce the latent redundancies in both spatial and frequency domains, and effectively adapt the decoded image for downstream machine vision tasks. Our method is plug-and-play and compatible with all existing learned image compression models. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks, even with a reduced number of trainable parameters and computational complexity. In the future work, we will extend our work to video coding for machines and humans." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.427, + 0.163 + ], + "angle": 0, + "content": "6 Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.177, + 0.793, + 0.238 + ], + "angle": 0, + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant 62125109, Grant 61931023, Grant 61932022, Grant 62371288, Grant 62320106003, Grant 62301299, Grant T2122024, Grant 62120106007, China Postdoctoral Innovation Talents Support Program (BX20230184)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.259, + 0.323, + 0.275 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.289, + 0.785, + 0.331 + ], + "angle": 0, + "content": "1. Bai, Y., Yang, X., Liu, X., Jiang, J., Wang, Y., Ji, X., Gao, W.: Towards end-to-end image compression and analysis with transformers. In: AAAI. vol. 36, pp. 104-112 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.333, + 0.785, + 0.359 + ], + "angle": 0, + "content": "2. Balle, J., Chou, P.A., Minnen, D., Singh, S., Johnston, N., Agustsson, E., Hwang, S.J., Toderici, G.: Nonlinear transform coding. IEEE JSTSP 15(2), 339-353 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.36, + 0.785, + 0.385 + ], + "angle": 0, + "content": "3. Balle, J., Laparra, V., Simoncelli, E.P.: End-to-end optimized image compression. In: ICLR (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.387, + 0.785, + 0.414 + ], + "angle": 0, + "content": "4. Balle, J., Minnen, D., Singh, S., Hwang, S.J., Johnston, N.: Variational image compression with a scale hyperprior. In: ICLR (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.415, + 0.785, + 0.455 + ], + "angle": 0, + "content": "5. Bégaint, J., Racapé, F., Feltman, S., Pushparaja, A.: Compressai: a python library and evaluation platform for end-to-end compression research. arXiv preprint arXiv:2011.03029 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.457, + 0.785, + 0.482 + ], + "angle": 0, + "content": "6. Bjontegaard, G.: Calculation of average psnr differences between rd-curves. In: VCEG-M33 (2001)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.484, + 0.785, + 0.51 + ], + "angle": 0, + "content": "7. Campos, J., Meierhans, S., Djelouah, A., Schroers, C.: Content adaptive optimization for neural image compression. In: CVPRW (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.511, + 0.785, + 0.551 + ], + "angle": 0, + "content": "8. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.553, + 0.785, + 0.579 + ], + "angle": 0, + "content": "9. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV. pp. 213-229. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.58, + 0.785, + 0.62 + ], + "angle": 0, + "content": "0. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. In: NeurIPS. vol. 35, pp. 16664-16678 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.621, + 0.785, + 0.661 + ], + "angle": 0, + "content": "1. Chen, Y.H., Weng, Y.C., Kao, C.H., Chien, C., Chiu, W.C., Peng, W.H.: Transtic: Transferring transformer-based image compression from human perception to machine perception. In: ICCV. pp. 23297-23307 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.662, + 0.785, + 0.689 + ], + "angle": 0, + "content": "2. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. In: ICLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.69, + 0.785, + 0.731 + ], + "angle": 0, + "content": "3. Cheng, Z., Sun, H., Takeuchi, M., Katto, J.: Learned image compression with discretized gaussian mixture likelihoods and attention modules. In: CVPR. pp. 7939-7948 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.785, + 0.757 + ], + "angle": 0, + "content": "4. Choi, H., Bajic, I.V.: Scalable image coding for humans and machines. IEEE TIP 31, 2739-2754 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.785 + ], + "angle": 0, + "content": "5. Chollet, F.: Xception: Deep learning with depthwise separable convolutions. In: CVPR. pp. 1251-1258 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.786, + 0.785, + 0.813 + ], + "angle": 0, + "content": "6. Codevilla, F., Simard, J.G., Goroshin, R., Pal, C.: Learned image compression for machine perception. arXiv preprint arXiv:2111.02249 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: CVPR. pp. 248-255 (2009)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.289, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "18. Ding, S., Li, M., Yang, T., Qian, R., Xu, H., Chen, Q., Wang, J., Xiong, H.: Motion-aware contrastive video representation learning via foreground-background merging. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9716-9726 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.205, + 0.786, + 0.245 + ], + "angle": 0, + "content": "19. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: ICLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.786, + 0.273 + ], + "angle": 0, + "content": "20. Feng, R., Gao, Y., Jin, X., Feng, R., Chen, Z.: Semantically structured image compression via irregular group-based decoupling. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.786, + 0.314 + ], + "angle": 0, + "content": "21. Feng, R., Liu, J., Jin, X., Pan, X., Sun, H., Chen, Z.: Prompt-icm: A unified framework towards image coding for machines with task-driven prompts. arXiv preprint arXiv:2305.02578 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.786, + 0.342 + ], + "angle": 0, + "content": "22. Fischer, K., Brand, F., Kaup, A.: Boosting neural image compression for machines using latent space masking. IEEE TCSVT (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.343, + 0.786, + 0.37 + ], + "angle": 0, + "content": "23. Girshick, R.: Fast r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 1440-1448 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.786, + 0.398 + ], + "angle": 0, + "content": "24. He, J., Zhou, C., Ma, X., Berg-Kirkpatrick, T., Neubig, G.: Towards a unified view of parameter-efficient transfer learning. In: ICLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.399, + 0.786, + 0.425 + ], + "angle": 0, + "content": "25. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.426, + 0.786, + 0.452 + ], + "angle": 0, + "content": "26. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.786, + 0.48 + ], + "angle": 0, + "content": "27. He, X., Li, C., Zhang, P., Yang, J., Wang, X.E.: Parameter-efficient model adaptation for vision transformers. In: AAAI. vol. 37, pp. 817-825 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.481, + 0.786, + 0.522 + ], + "angle": 0, + "content": "28. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: ICML. pp. 2790-2799. PMLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.523, + 0.786, + 0.563 + ], + "angle": 0, + "content": "29. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4700-4708 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.786, + 0.591 + ], + "angle": 0, + "content": "30. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: ECCV. pp. 709-727. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.592, + 0.786, + 0.619 + ], + "angle": 0, + "content": "31. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: CVPR. pp. 19113-19122 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.62, + 0.786, + 0.66 + ], + "angle": 0, + "content": "32. Koyuncu, A.B., Gao, H., Boev, A., Gaikov, G., Alshina, E., Steinbach, E.: Contextformer: A transformer with spatio-channel attention for context modeling in learned image compression. In: ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.661, + 0.786, + 0.688 + ], + "angle": 0, + "content": "33. Lee, J., Cho, S., Beack, S.K.: Context-adaptive entropy model for end-to-end optimized image compression. In: ICLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.786, + 0.716 + ], + "angle": 0, + "content": "34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: EMNLP (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.717, + 0.786, + 0.757 + ], + "angle": 0, + "content": "35. Li, H., Li, S., Dai, W., Li, C., Zou, J., Xiong, H.: Frequency-aware transformer for learned image compression. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=HKGQDDTuvZ" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.758, + 0.786, + 0.799 + ], + "angle": 0, + "content": "36. Li, H., Shi, B., Dai, W., Chen, Y., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Hierarchical graph networks for 3d human pose estimation. arXiv preprint arXiv:2111.11927 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.786, + 0.84 + ], + "angle": 0, + "content": "37. Li, H., Shi, B., Dai, W., Zheng, H., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Pose-oriented transformer with uncertainty-guided refinement for 2d-to-3d human pose estimation. In: AAAI. vol. 37, pp. 1296-1304 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.641, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Adapt-ICMH" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "38. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.189, + 0.788, + 0.23 + ], + "angle": 0, + "content": "39. Liu, J., Feng, R., Qi, Y., Chen, Q., Chen, Z., Zeng, W., Jin, X.: Rate-distortion-cognition controllable versatile neural image compression. In: ECCV. Springer (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.23, + 0.788, + 0.258 + ], + "angle": 0, + "content": "40. Liu, J., Jin, X., Feng, R., Chen, Z., Zeng, W.: Composable image coding for machine via task-oriented internal adaptor and external prior. In: VCIP. pp. 1-5 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.258, + 0.788, + 0.285 + ], + "angle": 0, + "content": "41. Liu, J., Sun, H., Katto, J.: Improving multiple machine vision tasks in the compressed domain. In: ICPR. pp. 331-337. IEEE (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.285, + 0.788, + 0.311 + ], + "angle": 0, + "content": "42. Liu, J., Sun, H., Katto, J.: Learned image compression with mixed transformer-cnn architectures. In: CVPR. pp. 14388-14397 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.311, + 0.788, + 0.339 + ], + "angle": 0, + "content": "43. Liu, K., Liu, D., Li, L., Yan, N., Li, H.: Semantics-to-signal scalable image compression with learned revertible representations. IJCV 129(9), 2605-2621 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.339, + 0.788, + 0.366 + ], + "angle": 0, + "content": "44. Liu, L., Hu, Z., Chen, Z., Xu, D.: Icmh-net: Neural image compression towards both machine vision and human vision. In: ACM MM. pp. 8047-8056 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.366, + 0.788, + 0.407 + ], + "angle": 0, + "content": "45. Liu, P., Yuan, W., Fu, J., Jiang, Z., Hayashi, H., Neubig, G.: Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing. ACM Computing Surveys 55(9), 1-35 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.407, + 0.788, + 0.447 + ], + "angle": 0, + "content": "46. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV. pp. 10012-10022 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.447, + 0.788, + 0.473 + ], + "angle": 0, + "content": "47. Lu, M., Guo, P., Shi, H., Cao, C., Ma, Z.: Transformer-based image compression. In: DCC. pp. 469-469 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.473, + 0.788, + 0.514 + ], + "angle": 0, + "content": "48. Lv, Y., Xiang, J., Zhang, J., Yang, W., Han, X., Yang, W.: Dynamic low-rank instance adaptation for universal neural image compression. In: ACM MM. pp. 632-642 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.514, + 0.788, + 0.542 + ], + "angle": 0, + "content": "49. Mentzer, F., Agustsson, E., Tschannen, M., Timofte, R., Gool, L.V.: Practical full resolution learned lossless image compression. In: CVPR. pp. 10629-10638 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.542, + 0.788, + 0.569 + ], + "angle": 0, + "content": "50. Minnen, D., Balle, J., Toderici, G.D.: Joint autoregressive and hierarchical priors for learned image compression. In: NeurIPS. vol. 31 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.596 + ], + "angle": 0, + "content": "51. Minnen, D., Singh, S.: Channel-wise autoregressive entropy models for learned image compression. In: ICIP. pp. 3339-3343 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.596, + 0.788, + 0.622 + ], + "angle": 0, + "content": "52. Nair, V., Hinton, G.E.: Rectified linear units improve restricted boltzmann machines. In: ICML. pp. 807-814 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.622, + 0.788, + 0.663 + ], + "angle": 0, + "content": "53. Pfeiffer, J., Kamath, A., Rückle, A., Cho, K., Gurevych, I.: Adapterfusion: Nondestructive task composition for transfer learning. arXiv preprint arXiv:2005.00247 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.663, + 0.788, + 0.704 + ], + "angle": 0, + "content": "54. Pfeiffer, J., Rückle, A., Poth, C., Kamath, A., Vulic, I., Ruder, S., Cho, K., Gurevych, I.: Adapterhub: A framework for adapting transformers. In: EMNLP. pp. 46-54 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.731 + ], + "angle": 0, + "content": "55. Qian, Y., Sun, X., Lin, M., Tan, Z., Jin, R.: Entroformer: A transformer-based entropy model for learned image compression. In: ICLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.731, + 0.788, + 0.758 + ], + "angle": 0, + "content": "56. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. In: NeurIPS. vol. 28 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.758, + 0.788, + 0.799 + ], + "angle": 0, + "content": "57. Shen, S., Yue, H., Yang, J.: Dec-adapter: Exploring efficient decoder-side adapter for bridging screen content and natural image compression. In: CVPR. pp. 12887-12896 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.788, + 0.841 + ], + "angle": 0, + "content": "58. Shi, B., Jiang, D., Zhang, X., Li, H., Dai, W., Zou, J., Xiong, H., Tian, Q.: A transformer-based decoder for semantic segmentation with multi-level context mining. In: European Conference on Computer Vision. pp. 624-639. Springer (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "H. Li et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "59. Strudel, R., Garcia, R., Laptev, I., Schmid, C.: Segmenter: Transformer for semantic segmentation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 7262-7272 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.785, + 0.217 + ], + "angle": 0, + "content": "60. Sun, K., Xiao, B., Liu, D., Wang, J.: Deep high-resolution representation learning for human pose estimation. In: CVPR. pp. 5693-5703 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.785, + 0.244 + ], + "angle": 0, + "content": "61. Tsubota, K., Akutsu, H., Aizawa, K.: Universal deep image compression via content-adaptive optimization with adapters. In: WACV. pp. 2529-2538 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.245, + 0.785, + 0.286 + ], + "angle": 0, + "content": "62. Wang, Y., Shi, B., Zhang, X., Li, J., Liu, Y., Dai, W., Li, C., Xiong, H., Tian, Q.: Adapting shortcut with normalizing flow: An efficient tuning framework for visual recognition. In: CVPR. pp. 15965-15974 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.785, + 0.327 + ], + "angle": 0, + "content": "63. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. In: NeurIPS. vol. 34, pp. 12077-12090 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.355 + ], + "angle": 0, + "content": "64. Yang, S., Hu, Y., Yang, W., Duan, L.Y., Liu, J.: Towards coding for human and machine vision: Scalable face image coding. IEEE TMM 23, 2957-2971 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.356, + 0.785, + 0.411 + ], + "angle": 0, + "content": "65. Zheng, H., Zhou, L., Li, H., Su, J., Wei, X., Xu, X.: Bem: Balanced and entropy-based mix for long-tailed semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22893-22903 (June 2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.411, + 0.785, + 0.466 + ], + "angle": 0, + "content": "66. Zheng, S., Lu, J., Zhao, H., Zhu, X., Luo, Z., Wang, Y., Fu, Y., Feng, J., Xiang, T., Torr, P.H., et al.: Rethinking semantic segmentation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6881-6890 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.508 + ], + "angle": 0, + "content": "67. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.508, + 0.785, + 0.536 + ], + "angle": 0, + "content": "68. Zou, R., Song, C., Zhang, Z.: The devil is in the details: Window-based attention for image compression. In: CVPR. pp. 17492-17501 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.536 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_origin.pdf b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0dbff1b3183b185bd73e91852f92ce50cdaa5a74 --- /dev/null +++ b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/faa98a56-23c5-4ac2-a327-9e47bb42cb62_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:14c2a7acf7b90d57ce2ac85b864d1c632c604430f6eabc3a627598e7b7585202 +size 3594559 diff --git a/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/full.md b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..0bb7d8467a850f37537f185efe2d2938d23f00fc --- /dev/null +++ b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/full.md @@ -0,0 +1,305 @@ +# Image Compression for Machine and Human Vision with Spatial-Frequency Adaptation + +Han Li $^{1}$ , Shaohui Li $^{2(\boxtimes)}$ , Shuangrui Ding $^{3}$ , Wenrui Dai $^{1(\boxtimes)}$ , Maida Cao $^{1}$ , Chenglin Li $^{1}$ , Junni Zou $^{1}$ , and Hongkai Xiong $^{1}$ + +$^{1}$ Shanghai Jiao Tong University + $^{2}$ Tsinghua Shenzhen International Graduate School, Tsinghua University + $^{3}$ The Chinese University of Hong Kong +{qingshi9974, daiwenrui, caomaida, lcl1985, zoujunni, xionghongkai}@sjtu.edu.cn +lishaohui@sz.tsinghua.edu.cn, ds023@ie.cuhk.edu.hk + +Abstract. Image compression for machine and human vision (ICMH) has gained increasing attention in recent years. Existing ICMH methods are limited by high training and storage overheads due to heavy design of task-specific networks. To address this issue, in this paper, we develop a novel lightweight adapter-based tuning framework for ICMH, named Adapt-ICMH, that better balances task performance and bitrates with reduced overheads. We propose a spatial-frequency modulation adapter (SFMA) that simultaneously eliminates non-semantic redundancy with a spatial modulation adapter, and enhances task-relevant frequency components and suppresses task-irrelevant frequency components with a frequency modulation adapter. The proposed adapter is plug-and-play and compatible with almost all existing learned image compression models without compromising the performance of pre-trained models. Experiments demonstrate that Adapt-ICMH consistently outperforms existing ICMH frameworks on various machine vision tasks with fewer fine-tuned parameters and reduced computational complexity. Code will be released at https://github.com/qingshi9974/ECCV2024-AdpatICMH. + +Keywords: Learned Image Compression $\cdot$ Machine Vision $\cdot$ Adapter + +# 1 Introduction + +The booming of computer vision [18,25,26,46,56,60,63,65] raises the demands for excessive images serving machine vision systems and accomplishing tasks such as classification, detection, segmentation. In practice, images from users have to be compressed and transmitted to exploit the off-the-shelf recognition models deployed in the cloud. However, compression directly using existing image CODECs, especially learned image compression (LIC) models [3, 4, 35, 42, 50, 51, 68] optimized for human vision, could cause the loss of semantic information contained in images and dramatically reduce the accuracy of downstream tasks. To meet the demands of both machine and human vision systems, unified CODEcs + +![](images/15acc961743b0d0aa7a9015617d3b789548dfb781b9846f2470eeba2e8a96a1f.jpg) +Fig. 1: Left: our adapter-based tuning framework. Right: Rate-accuracy performance comparison on classification for ImageNet-val [17]. We compare our methods (Ours- $n$ indicates $n$ middle dimensions for SFMA) with full fine-tuning, TransTIC [11], ICMH-Net [44], and channel selection [41]. BD-accuracy is computed by replacing the PSNR in BD-PSNR [6] with top-1 accuracy and setting the base codec of TIC [47] as the anchor. The size of circles indicates GFLOPs for inference during encoding. + +![](images/b4c6b4c9174d081db4bc085d9283f2552afd0ee1326b6d5caaaafe00ac9d838a.jpg) + +to achieve image compression for machine and human vision (ICMH) have been explored [1, 11, 14, 16, 20, 22, 39-41, 43, 44, 64]. + +A multi-task pipeline has been built for ICMH in [1, 14, 16], where a task-agnostic encoder and multiple task-specific decoders are jointly trained from scratch for human vision and multiple machine vision tasks. However, the multi-task pipeline results in degraded rate-distortion (R-D) performance for human vision and is restricted in adapting to newly coming machine vision tasks. + +Since LIC models are usually fitted to the distributions of natural images [33, 49], recent works [11,22,40,41,44] tend to adopt a tuning framework that adapts a pre-trained image codec optimized for human vision (called base codec) to diverse machine vision tasks without sacrificing R-D performance. This pipeline enables ICMH by training only a lightweight module specifically for the machine vision task, while freezing the base codec parameters for sharing across human and machine vision. In ICMH-Net [44], a spatial-channel mask generator is trained to determine a subset of quantized latent for a specific machine vision task. Chen et al. [11] utilized visual prompt tuning [30] to transfer the transformer-based base codec [47] to machine vision tasks. Unfortunately, these methods suffer from evidently degraded performance compared to codec's fully fine-tuned for machine vision tasks. Besides, they introduce significant overheads of computational and model complexity to the base codec due to their task-specific designs. It remains a challenge to achieve efficient fine-tuning of pre-trained human vision-oriented image codec on machine vision tasks. + +In this paper, we consider the fact that almost all spatial and frequency components of an image are exploited by the base codec to improve the visual quality for human vision but could be redundant for machine vision tasks. We are + +thereby motivated to modulate the intermediate feature of the base codec in both spatial and frequency domains such that the redundancy in the latent representation can be reduced and the reconstructed image can be efficiently adapted to various machine vision tasks. + +To this end, we propose a play-and-plug module of spatial-frequency modulation adapter (SFMA) to better balance the machine vision task performance and transmission cost. Specifically, the proposed SFMA consists of two parallel submodules, i.e., a spatial modulation adapter (SMA) that eliminates non-semantic redundancies in the spatial domain and a frequency modulation adapter (FMA) that amplifies the frequency components that contribute more to the machine vision task (e.g., high-frequency components are more crucial for segmentation) and suppresses the redundant frequency components. Furthermore, we develop an adapter-based tuning framework for ICHM, named Adapt-ICMH, by plugging the proposed SFMA into both the encoder and decoder of the base codec, as depicted in Fig. 1. It should be noted that, different from [11] that can only adapt the transformer-based base codec, Adapt-ICMH is architecture-agnostic such that it is compatible with almost all existing LIC models for adaptation to various machine vision tasks. In summary, our contributions include: + +- We propose a spatial-frequency modulation adapter (SFMA) to efficiently update the intermediate feature and better balance the performance and bitrates for diverse machine vision tasks. +- Based on SFMA, we develop a novel tuning framework named Adapt-ICMH to achieve image coding for machine and human vision with a shared base codec, significantly reducing the training and storage overhead. +- Our SFMA is plug-and-play, which could be incorporated with all existing LIC models to achieve ICMH. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks with even reduced model and computational complexity. + +# 2 Related Work + +Learned Image Compression (LIC) has attracted wide attention due to its superior rate-distortion (R-D) performance. Research in LIC can be categorized into two main paths. The first focuses on enhancing the nonlinear transforms [2], evolving from convolutional neural networks (CNN)-based [3,4,50,51] to attention-based transforms [13], and more recently, transformer-based transforms [35,42,47,68]. The second path involves designing more powerful entropy models. Prior works [3,4] proposed factorized and hyperprior models, while recent efforts [32,50,51,55] tend to introduce spatial or channel-wise autoregression in the entropy model. However, these methods focus solely on the human visual quality of the decoded image, while ignoring the application in downstream machine vision tasks. + +Image Compression for Machine and Human Vision (ICMH) has become a hot topic in recent years due to the growing number of images that need to be processed for various machine vision tasks, such as classification [17,26,29], + +detection [9,23,67], segmentation [25,58,59,66] and pose estimation [8,36,37,60]. One straight way is to fully fine-tune the base codec on machine vision tasks. However, this requires storing and deploying a separate copy of the entire codec network for each individual task, which severely hampers practical applicability. + +Earlier works [1, 14, 16, 41] presented a multi-task pipeline to unify the image coding for machine and human vision. However, it still requires multiple task-specific decoders, leading to increased storage overhead. In addition, the entire network must be trained from scratch, resulting in significant training overhead and impeding the adaptation to newly coming machine vision tasks. To address this problem, Liu et al. [44] proposed to leverage the pre-trained human vision-oriented base codec and train an extra spatial-channel mask generator to transmit a subset of latent for machine vision task. Unfortunately, it cannot be easily extended to autoregression-based entropy models [50, 51] and fails to achieve adaptation of the nonlinear transforms. Chen et al. [11] proposed a prompt-based tuning framework that introduces prompts in the transformer-based nonlinear transforms for machine vision. However, it cannot be compatible with the mainstream CNN-based LIC methods [3, 4, 13] and the performance is still highly inferior to full fine-tuning. In contrast, our framework generalizes to almost all existing LIC models with different nonlinear transforms and entropy models and achieves comparable rate-accuracy performance compared to full fine-tuning. See Appendix B for more discussions about ICMH. + +Parameter-Efficient Fine-Tuning (PEFT) has been extensively studied for NLP [24, 28, 34, 45, 53, 54]. It can effectively fine-tune a pre-trained large-scale model on downstream tasks or datasets with the major model frozen. With the advent of vision transformers [9, 19, 46], researchers have applied PEFT tools to machine vision tasks, including prompt tuning [30, 31], adapters [10, 12, 62], and LoRA [27]. In the field of learned image compression, Feng et al. [21] first introduced prompts for machine-oriented image coding, while Liu et al. [11] further explored the application of prompt-tuning for ICMH. [48, 57, 61] transmitted the parameters of additional adapters for content-adaptive optimization [7, 33] to improve the human visual quality of the decoded image, which is completely different from ours in terms of methodology and application scenarios. In addition, naive adapters [10, 28, 40] update the feature without considering the transmission cost of different underlying frequencies and spatial components of the image, which is vital for ICMH. In our paper, we propose a novel spatial-frequency modulation adapter specifically for ICHM to address this limitation. + +# 3 Methods + +# 3.1 Empirical Findings by Full Fine-tuning + +We first conduct a simple experiment to highlight the key insight of this paper: image compression for machine vision tends to prioritize transmitting distinct spatial and frequency information compared to human vision. This preference also varies across specific machine vision tasks. + +![](images/24c0fa6e21c18790e3a0e8e892df2d8110db68ef5c7a77e0c90c0672f91e70e4.jpg) +Input Image + +![](images/715c8196e265933e9238e9a6ca83029258c57d62e494cd8a5d66517fbc726caa.jpg) +Fig. 2: Visualization of the bit allocation maps (first row) and power spectral density maps (second row) of the latent $\hat{y}$ . The left part shows the raw input image. Each column of the right part corresponds to a codec for each task, including the base codec for human vision and three fine-tuned CODEs for machine vision tasks. The bit allocation map is computed by averaging the negative log-likelihood (i.e., $-\log_2p(\hat{y})$ ) across channels. The power spectral density map is computed by applying the Fast Fourier Transform (FFT) to $\hat{y}$ with a shift operation to center the zero frequency component, and then averaging its absolute value across channels. + +Taking the pre-trained mean-scale hyperprior $^4$ model [50] optimized for human vision as the base codec, we fully fine-tune $^5$ it on three different machine vision tasks, including classification, object detection, and instance segmentation. Then, we feed the same image to the base codec and three fine-tuned CODECs, respectively. The bit allocation map and power spectral density map of latent $\hat{y}$ for each codec are shown in Fig. 2. + +From the bit allocation map, we can see that the base codec consumes more bitrates in the complex background region, while the CODEs that are fully finetuned on machine tasks pay more attention to the semantic object. In addition, we can see from the power spectral density maps that the base codec tends to encode frequency components as many as possible to achieve higher visual quality. However, many of these frequency components are redundant for machine vision. For example, instance segmentation prefers more mid- and high-frequency components for accurate edge and contour reconstruction, while low- and mid-frequency components are sufficient for simpler tasks (e.g., classification). + +These observations confirm that image compression has different spatial and frequency domain preferences for different tasks. However, fully fine-tuning the base codec on different machine vision tasks is costly in terms of training time and memory. Thus, in this paper, we propose a spatial-frequency modulation adapter to conduct efficient fine-tuning, and effectively reduce the redundancies in both spatial and frequency domains for machine vision tasks. + +# 3.2 Framework Overview + +![](images/9d05dc979dd62ae2472d10f455a31130c404c9e61a298ed02e9afaff1e8ad49c.jpg) +Fig. 3: Overview of our proposed Adapt-ICMH framework. Multiple spatial-frequency modulation adapters (SFMA) are plugged into the encoder $g_{a}$ and decoder $g_{s}$ of the base codec for feature adaptation. During the adaptation to the machine vision task, the base codec is frozen and only these adapters are trainable. For briefness, we do not illustrate the specific architecture of the encoder, decoder stage, and entropy model, as it depends on the specific base codec. Please see Appendix E for the detailed architecture. + +Our compression framework Adapt-ICMH, shown in Fig. 3, is designed to adapt the existing learned image compression model that is optimized for human vision (i.e., base codec) to downstream machine vision tasks. To this end, we propose the Spatial-Frequency Modulation Adapter (SFMA), a plug-and-play bottleneck module, which is plugged into the encoder $g_{a}$ and decoder $g_{s}$ of the base codec for feature adaptation. + +During the adaptation stage, the weights of the base codec (blue part) are loaded from the pre-trained checkpoint and kept frozen. Therefore, we only optimize the added adapters (red part) for specific machine vision tasks with the following loss function: + +$$ +\mathcal {L} = \mathcal {R} + \lambda \cdot \mathcal {D} (\boldsymbol {x}, \hat {\boldsymbol {x}}; \mathcal {G}), \tag {1} +$$ + +where $\mathcal{R}$ denotes the overall estimated bitrates, $\mathcal{D}$ calculates the task-specific perceptual distortion between raw image $\pmb{x}$ and reconstructed image $\hat{\pmb{x}}$ with an off-the-shelf recognition model $\mathcal{G}$ (e.g., Faster RCNN [56] for object detection). + +$\lambda$ is a trade-off term to balance the task performance and bitrates. Please refer to Appendix C for more details about loss function. + +After adaptation, we can only modify the weights of lightweight adapters for different machine vision tasks, while keeping the parameters of the base codec unchanged. If an image needs to be compressed for human vision, we can directly remove the adapters to obtain the original base codec, so that the R-D performance for human vision is not affected. In this way, a single base codec model can be used for both human vision and multiple machine vision tasks. + +# 3.3 Spatial-Frequency Modulation Adapter + +The proposed Spatial-Frequency Modulation Adapter (SFMA) consists of a Spatial Modulation Adapter (SMA) and a Frequency Modulation Adapter (FMA), which are configured in a parallel way. As shown in Fig. 3, the encoder $g_{a}$ of base codec generally consists of four stages, denoted by $g_{a} = g_{a1} \circ g_{a2} \circ g_{a3} \circ g_{a4}$ . Given the input image $\pmb{x} \in \mathbb{R}^{3 \times H \times W}$ , where $H \times W$ is the spatial resolution, we define the output feature of the $j$ -th intermediate stage of $g_{a}$ as $\pmb{x}_{j} \in \mathbb{R}^{C_{j} \times H_{j} \times W_{j}}$ , where $C_{j}$ is the number of channels, $H_{j} = H / 2^{j}$ , $W_{j} = W / 2^{j}$ , and $j \in \{1, 2, 3\}$ . Supposing that the SFMA plugged after the $j$ -th encoder stage is denoted by $\mathrm{SFMA}_{j}$ , we can obtain the adapted feature $\tilde{\pmb{x}}_{j}$ by aggregating original input feature $\pmb{x}_{j}$ with the adapted component. The process can be defined as follows: + +$$ +\begin{array}{l} \tilde {\boldsymbol {x}} _ {j} = \operatorname {S F M A} _ {j} (\boldsymbol {x} _ {j}) \\ = \boldsymbol {x} _ {j} + \underbrace {\operatorname {F M A} _ {j} \left(\boldsymbol {x} _ {j}\right) + \operatorname {S M A} _ {j} \left(\boldsymbol {x} _ {j}\right)} _ {\text {a d a p t e d c o m p o n e n t}}, \tag {2} \\ \end{array} +$$ + +where $\mathrm{FMA}_j$ and $\mathrm{SMA}_j$ denote the $j$ -th frequency and spatial modulation adapter, respectively. The process of the adapter for decoder $g_{s}$ can be derived similarly. Frequency Modulation Adapter. Our frequency modulation adapter (FMA) is designed to adapt the feature in the frequency domain. By this modulation operation, we can eliminate frequency redundancies and amplify the important frequency components for machine vision tasks. Specifically, the input $\pmb{x}_j \in \mathbb{R}^{C_j \times H_j \times W_j}$ firstly be down-projected to a bottleneck middle dimension $\hat{C} (\hat{C} \leq C_j)$ by a linear layer $\pmb{W}_{\mathrm{down}}^{\mathrm{f}} \in \mathbb{R}^{C_j \times \hat{C}}$ and then be transformed into frequency domain by fast Fourier transform (FFT), obtaining the middle feature $\pmb{x}_j^{\mathrm{f}}$ . Subsequently, we generate a frequency modulation matrix $\pmb{m}_j^{\mathrm{f}}$ and then use Hadamard product to calculate the modulated result $\bar{\pmb{x}}_j^{\mathrm{f}}$ . Finally, $\bar{\pmb{x}}_j^{\mathrm{f}}$ is inversely transformed using inverse FFT (IFFT) and up-projected by another linear layer $\pmb{W}_{\mathrm{up}}^{\mathrm{f}} \in \mathbb{R}^{\hat{C} \times C_j}$ . The overall process of FMA can be formulated as follows: + +$$ +\begin{array}{l} \boldsymbol {x} _ {j} ^ {\mathrm {f}} = \mathcal {F} (\boldsymbol {x} _ {j} \cdot \boldsymbol {W} _ {\text {d o w n}} ^ {\mathrm {f}}, \\ \boldsymbol {m} _ {j} ^ {\mathrm {f}} = \sigma (\operatorname {D W - C o n v} _ {3 \times 3} \left(\boldsymbol {x} _ {j} ^ {\mathrm {f}}\right)) \cdot \boldsymbol {W} _ {\text {m i d d l e}} ^ {\mathrm {f}}, \tag {3} \\ \bar {\boldsymbol {x}} _ {j} ^ {\mathrm {f}} = \boldsymbol {x} _ {j} ^ {\mathrm {f}} \odot \sigma (\boldsymbol {m} _ {j} ^ {\mathrm {f}}), \\ \tilde {\boldsymbol {x}} _ {j} ^ {\mathrm {f}} = \mathcal {F} ^ {- 1} (\bar {\boldsymbol {x}} _ {j} ^ {\mathrm {f}}) \cdot \boldsymbol {W} _ {\mathrm {u p}} ^ {\mathrm {f}} \\ \end{array} +$$ + +where $\sigma$ denotes ReLU [52], DW-Conv $_{3\times 3}$ denotes depth-wise convolution [15] with kernel size $3\times 3$ , $\mathbf{W}_{\mathrm{middle}}^{\mathrm{f}}\in \mathbb{R}^{\hat{C}\times \hat{C}}$ is a linear layer, $\odot$ denotes Hadamard product, and $\mathcal{F}(\cdot)$ and $\mathcal{F}^{-1}(\cdot)$ denote the FFT and IFFT, respectively. + +Spatial Modulation Adapter. Our spatial modulation adapter (SMA) is designed to adapt features in the spatial domain, thus guiding the codec to focus more on the semantic region and reduce the spatial redundancies in the background. Similarly, the input $\boldsymbol{x}_j \in \mathbb{R}^{C_j \times H_j \times W_j}$ is first down-projected to a bottleneck middle dimension $\hat{C}$ by a linear layer $W_{\mathrm{down1}}^{\mathrm{s}} \in \mathbb{R}^{C_j \times \hat{C}}$ , obtaining the middle feature $\boldsymbol{x}_j^{\mathrm{s}}$ . Then, we produce the spatial modulation matrix $\boldsymbol{m}_j^{\mathrm{s}}$ by feeding $\boldsymbol{x}_j$ to another down-projection linear layer $W_{\mathrm{down2}}^{\mathrm{s}} \in \mathbb{R}^{C_j \times \hat{C}}$ followed by a $5 \times 5$ depth-wise convolution layer. We then apply an up-projection linear layer $W_{\mathrm{up}}^{\mathrm{s}} \in \mathbb{R}^{\hat{C} \times C_j}$ to the modulated feature to get the spatial adapted result. The overall process of SMA can be formulated as follows: + +$$ +\begin{array}{l} \boldsymbol {x} _ {j} ^ {\mathrm {s}} = \boldsymbol {x} _ {j} \cdot \boldsymbol {W} _ {\text {d o w n 1}} ^ {\mathrm {s}}, \\ \boldsymbol {m} _ {j} ^ {\mathrm {s}} = \operatorname {D W - C o n v} _ {5 \times 5} \left(\boldsymbol {x} _ {j} ^ {\mathrm {s}} \cdot \boldsymbol {W} _ {\text {d o w n} 2} ^ {\mathrm {s}}\right), (4) \\ \bar {\boldsymbol {x}} _ {j} ^ {\mathrm {s}} = \boldsymbol {x} _ {j} ^ {\mathrm {s}} \odot \sigma \left(\boldsymbol {m} _ {j} ^ {\mathrm {s}}\right), (4) \\ \tilde {\boldsymbol {x}} _ {j} ^ {\mathrm {s}} = \bar {\boldsymbol {x}} _ {j} ^ {\mathrm {s}} \cdot \boldsymbol {W} _ {\mathrm {u p}} ^ {\mathrm {s}}, \\ \end{array} +$$ + +# 4 Experiments + +# 4.1 Training Details and Datasets. + +To demonstrate the generalization ability of our framework, we adopt three mainstream LIC methods, i.e., stacked convolution-based [50], residual network-based [13], and transformer-based [47] image compression model. We use their pretrained models from CompressAI [5] library as base codes, denoted by mbt2018-mean, cheng2020-anchor and Lu2022-TIC, respectively. For benchmark machine vision tasks, we evaluate our framework on classification, object detection, and instance segmentation, respectively. By freezing these base codec's pre-trained for human vision, we then train our SFMAs using the task-specific loss of Eq. (1) with the bottleneck middle dimension $\hat{C}$ set to 64. Specifically, we train the classification task on ImageNet-train dataset [17] for 8 epochs with a batch size of 16, and train the object detection and instance segmentation tasks on COCO2017-train dataset [38] both for 40 epochs with a batch size of 8. The images are randomly cropped and resized to $256\times 256$ for training all tasks. For the calculation of task-specific perceptual distortion term in the Eq. (1), we follow [11] to use the pre-trained ResNet50 [26], Faster R-CNN [56] and Mask R-CNN [25] for classification, object detection, and instance segmentation, respectively. More training details are included in Appendix C. + +# 4.2 Evaluation + +We follow the setting of [11] to evaluate the performance of our method. Specifically, we use bits per pixel (BPP) to evaluate bitrates for compression. For image + +classification, the evaluations are conducted on the ImageNet-val dataset [17] and images are resized and center cropped to $256 \times 256$ . We adopt the pre-trained ResNet50 from torchvision library as the off-the-shelf recognition model and use top-1 accuracy as the quality metric. For objection detection and instance segmentation, the evaluations are both done on the COCO2017-val dataset [38] by using the pre-trained Faster R-CNN and Mask R-CNN from detectron2 library as the off-the-shelf recognition model, respectively. The test images are resized to 800 pixels for the short side and we use mean average precision (mAP) with an Intersection of Union (IoU) threshold of 0.5 as the quality metric. + +# 4.3 Rate-Accuracy Comparison + +We compare the rate-accuracy performance of our methods with the state-of-the-art (SOTA) methods $^6$ , including TransTIC [11], ICMH-Net [44], and channel selection [41]. Note that our method has an equal R-D performance for human vision with these methods, since we all adopt the pre-trained image codec as base codec and freeze it. We also evaluate the rate-accuracy performance of the base codec and further full fine-tuning it on machine vision tasks end-to-end. + +The rate-accuracy curves for competing methods are shown in Fig. 4. In addition, we also summarize the average bitrates savings, accuracy improvements, and the trainable parameters count of different methods in Tab. 1. Specifically, we report the BD-rate [6] results to quantify the average bitrates savings with equal task accuracy, we also follow [11] to report BD-acc/BD-mAP results to measure the average task accuracy improvements with equal bitrates. BD-acc/BD-mAP is calculated by replacing the PSNR in BD-PSNR with top-1 accuracy/mAP. + +From the results of Fig. 4 and Tab. 1, we can observe that (1) our method consistently achieves excellent performance across all three machine vision tasks and outperforms [11, 41, 44], the superiority is more significant on the classification task; (2) Our method demonstrates strong generalization ability as it can effectively generalize to three different base CODEs, despite their varying architectures of nonlinear transforms (i.e., $g_{a}$ and $g_{s}$ ) and entropy models. (3) our method achieve comparable or even superior performance to full fine-tuning. However, full fine-tuning requires storing and deploying a separate copy of the entire codec for each task, significantly increasing training and storage overhead and severely hindering practical applicability. (4) our method requires fewer trainable parameters (i.e., about $1 \sim 5\%$ of the number of parameters of the base codec) compared to other tuning-based methods (i.e., about $1 \sim 5\%$ of the number of parameters of the base codec), which demonstrates the parameter efficiency of our method. For the application on larger transformer-based image CODEs [35, 42, 68], see Appendix H. For the comparison of computational complexity, see Appendix G. + +![](images/b0f9b63782fbfa6c5759bbede1bba9b2be9bbac649954cc1c4fe0d295b6fed53.jpg) + +![](images/3f7cfaa5dcb3c4628309819bf166078401a44f1f6181f9a6e715e524fb633b5d.jpg) + +![](images/d8514706e30510c014f1ec6483a9dc17e0fabe6ae43f5e752de716b329e7acf6.jpg) + +![](images/75e34c1e564472b08641e63de005cc6baae5ff40475401bf602ecccf7408cfe6.jpg) +(a) Lu2022-TIC model [47] as base codec + +![](images/4c60657b2c1a756f1f86a81b0bc332bfabf2b41a5e4628bf6fec82732a716c07.jpg) + +![](images/d789faf5e5427ccf6b54d03a06f0cd60bc991e178cdc703ef4a69b29d95cce52.jpg) + +![](images/262314d10b59bd95723008541acdee073a54d459aa06a8b8e9964d41626aaf23.jpg) +(b) Cheng2020-anchor model [13] as base codec +(c) mbt2018-mean model [50] as base codec +Fig. 4: Rate-Accuracy performance comparison under different machine vision tasks and different base codecs. + +![](images/ade518f6b6357140dea8eda04603d9737e27d9112ecbe7b4149ea70c785a1d84.jpg) + +![](images/234ac8f77b9e1907c111b3661e2d765a65f31f2db7f279db4051dc57aa399d53.jpg) + +# 4.4 Ablation study + +We conduct ablation studies to investigate how each design in our SFMA influences the overall performance. Without loss of generality, we use the pre-trained mbt2018-mean as the base codec for convenience. + +Effect on the architecture of SFMA. We first explore the impact of the architecture of SFMA on performance by conducting experiments with various variants of SFMA, as summarized in Fig. 5. (a) Proposed SFMA: The default configuration of SFMA. (b) SMA-only: The FMA branch is removed, retaining only the SMA branch. (c) FMA-only: The SMA branch is removed, retaining only the FMA branch. (d) FMA-SMA-sequential: FMA and SMA are organized sequentially, where SMA is followed by FMA. (e) SMA-FMA-sequential: FMA and SMA are organized sequentially, where FMA is followed by SMA. (f) SMA-SMA-parallel: two SMAs are configured in parallel. + +Table 1: Comparison of rate-accuracy performance and the number of trainable parameters under different machine vision tasks and different base codecs. BD-rate, BD-acc, BD-mAP are used to quantitatively measure the rate-accuracy performance with the base codec as anchor, respectively. Arrows indicate whether lower is better $(\downarrow)$ or higher is better $(\uparrow)$ . $(-)$ indicates the BD-rate can not be computed. + +
MethodClassificationDetectionSegmentationTrainable +Params ↓(M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
Lu2022-TIC
full fine-tuning-17.68-73.94%4.51-67.98%3.767.51(100%)
TransTIC [11]-58.32%9.96-46.30%2.77-46.41%2.701.61(21.4%)
ICMH-Net [44]-18.75%3.36-9.07%0.63-10.77%0.653.98(53.0%)
channel selection [41]-37.17%6.286.84%-0.5516.51%-0.940.91(12.1%)
Ours-88.57%16.90-55.14%3.55-52.40%3.210.28(3.7%)
Cheng2020-anchor
full fine-tuning-21.04-59.20%4.69-76.03%3.8626.60(100%)
ICMH-Net [44]-47.46%10.4-8.81%0.53-12.18%0.744.43(16.6%)
channel selection [41]-41.58%8.77-11.66%0.735.22%0.221.34(4.8%)
Ours-87.56%20.27-49.34%3.13-59.90%3.480.41(1.5%)
mbt2018-mean
full fine-tuning-79.92%17.97-60.87%3.87-56.64%3.287.03(100%)
ICMH-Net [44]-15.99%3.55-6.02%0.39-4.97%0.313.98(56.6%)
channel selection [41]-41.30%9.90-23.07%1.52-15.09%1.050.91(12.9%)
Ours-82.00%18.71-56.17%3.84-52.65%3.170.28(4.1%)
+ +![](images/0d5e00d22bb2d7a6aeaa2972f00ca915a4c44e2989c0f39e632fc8e785165bf7.jpg) +(a) + +![](images/1547b665286f4f5dcbd2ffd9ae67a1162b69270d462a371843374eb04a07c12a.jpg) +(b) +Fig. 5: Different variants of SFMA: (a) Proposed SFMA. (b) SMA-only.(c) FMA-only. (d) FMA-SMA-sequential. (e) SMA-FMA-sequential. (f) SMA-SMA-parallel. + +![](images/2015ae2e56dcf6681d5972729f0591f33a900b313774b5026bd31a3baac796e2.jpg) +(c) + +![](images/1a36831f954194abf3260fee6c9e0b654fe7b93177c949cbab44e91e49c8a6dc.jpg) +(d) + +![](images/ec2f398b936239062db603c98f51acf261326d41bd393d6986c65f0b3630101c.jpg) +(e) + +![](images/3e6a419ee0cd4e6947aae00ad3dde8c0bb911d1f23ba225147a632d3bf0c3714.jpg) +(f) + +The results are shown in Tab. 2. We can observe that (1) removing either SMA or FMA leads to performance degradation, and FMA plays a more important role than SMA in the adaptation process, showing the superiority of frequency domain adaptation. (2) parallel configuration outperforms the sequential configuration. (3) barely replicating SMA has more trainable parameters compared to our SFMA, but leads to a performance degradation. This shows that the improvement of our SFMA is not only due to an overall increase in model capacity but rather to its specific structure. + +Effect on the position of SFMA. We then investigate the impact of the position to plug the SFMA. The results are shown in the Table 3. From shallow to deep, we first plug SFMA after different stages of encoder $g_{a}$ and decoder $g_{s}$ . We observe that the SFMA at the shallow layer can benefit more for the rate-accuracy performance, i.e., plugging SFMA after stage1 of $g_{a}$ and $g_{s}$ can achieve $69.54\%$ bitrates savings for classification compared to the base codec, while plugging SFMA after stage3 of $g_{a}$ and $g_{s}$ can only achieve $64.76\%$ bitrates savings. In addition, employing more SFMA can bring further benefits. + +Table 2: Ablations on different variants of SFMA + +
MethodClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
(a)-82.00%18.71-56.17%3.84-52.65%3.170.28
(b)-73.82%16.30-51.94%3.61-48.16%2.920.16
(c)-77.40%17.29-52.86%3.32-49.58%2.900.12
(d)-80.49%18.67-56.87%3.81-51.79%3.140.28
(e)-83.31%18.50-53.77%3.79-51.28%3.020.28
(f)-79.63%17.59-54.91%3.62-50.96%3.040.32
+ +Table 3: Ablations on the position of SFMA. + +
Stage 1 2 3ga g₅ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
✓✓-69.54%15.95-50.72%3.39-48.27%2.920.09
✓✓-69.00%15.69-49.96%3.24-46.40%2.820.09
✓✓-64.76%13.29-50.08%3.17-39.98%2.430.09
✓✓-82.00%18.71-56.17%3.84-52.65%3.170.28
✓✓-64.75%13.28-38.84%2.88-38.67%2.280.14
✓✓-61.87%12.40-44.05%3.01-40.43%2.660.14
+ +Then, we observe that SFMAs are indispensable at both the encoder and decoder side, such that removing either would lead to a significant degradation in performance. SFMA in the encoder tends to reduce redundancies in the feature for machine vision tasks. SFMA in the decoder tends to adapt the feature so that the reconstructed image is more suitable for downstream tasks. + +Effect on the middle dimension $\hat{C}$ . Tab. 4 reports how middle dimension $\hat{C}$ impacts the rate-accuracy performance and complexity of SFMA. The results show that enlarging the middle dimension from 1 to 128 can boost performance while leading to a higher training complexity. Thus, we set $\hat{C}$ to 64 to make a better trade-off between performance and complexity. + +# 4.5 Qualitative Results + +Fig. 6 shows the qualitative results of our Adapt-ICMH and other methods for instance segmentation. Our approach achieves superior segmentation results + +Table 4: Ablations on the middle dimension $\hat{C}$ of SFMA. + +
\( \hat{C} \)ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
1-60.41%12.58-48.58%2.93-45.24%2.400.005
32-78.74%17.52-53.61%3.53-48.50%2.920.14
64-82.00%18.71-56.17%3.84-52.65%3.170.28
128-83.61%19.50-63.28%4.11-60.50%3.760.62
+ +![](images/6bac0c40ef6c80be3fcb1c55ce2d032dcb71a2ca2815a1478e07e2275e7deb78.jpg) +Fig. 6: Qualitative comparison of our Adapt-ICMH with other ICMH methods. First row: The original image and decoded image of each method. We show the decoded images for machine vision of three ICMH methods (left). Second row: The instance segmentation results of each image. Third row: The log power spectral density maps of each image. Bottom row: The bit allocation maps for $\hat{y}$ of each method. + +with a lower bitrate (0.147bpp). In comparison to other methods, Adapt-ICMH effectively minimizes the bitrates of the background while enhancing the high-frequency edge details of the semantic object. We also observe that our method's decoded image for machine vision exhibits some distortion in terms of overall chromaticity and brightness. However, these low-frequency distortions do not affect the segmentation result, which supports the goal of our SFMA. + +# 4.6 Towards scalable coding for machine and human vision. + +Scalable coding for machine and human vision is of practical significance to adapt the transmission among diverse demands. The framework of Fig 3, followed by [11,41], is designed to produce a single bitstream tailored for each individual task. However, our proposed SFMA can also benefit existing scalable coding methods to achieve better scalable coding performance for machine and human vision. To demonstrate it, we integrate our SFMA and the spatial-channel mask generator proposed by ICMH-Net [44] with the base codec. Specifically, we only + +![](images/7b70a0bbe20fac413b0e6c575058e1c11a5d40d5b843280ad98e240c490315a3.jpg) +Fig. 7: Quantitative and qualitative comparison of each method for the object detection task. Pre-trained mbt2018-mean [50] is used as the base codec. We present the bpp/PSNR results for the decoded image for human vision and the bpp results for the decoded image for the detection task. + +![](images/b5bcd03b34d900b575055509cda6fab88a99c1c776b4560c3ba5177a94b39114.jpg) + +plug our SFMA into the decoder $g_{s}$ and utilize spatial-channel mask generator to produce two bitstreams, the truncated one is decoded by the $g_{s}$ with SFMAs to reconstruct image for machine vision task, while the full bitstream is decoded by the $g_{s}$ without SFMAs to reconstruct image for human vision. See Appendix F for detailed network architecture for scalable coding. + +Fig. 7 show the comparison of rate-accuracy performance and qualitative results. It demonstrates the superior performance of our SFMA, which significantly improves the rate-accuracy performance of ICMH-Net. Note that we do not alter the base codec, so the visual quality of the image reconstructed from the full bitstream is the same as the base codec. + +# 5 Conclusion + +In this paper, we develop a novel adapter-based tuning framework for ICMH, named Adapt-ICMH. Specifically, we fine-tune the pre-trained image codec optimized for human vision on multiple machine vision tasks, which is achieved by the proposed spatial-frequency modulation adapter (SFMA). Our SFMA can efficiently reduce the latent redundancies in both spatial and frequency domains, and effectively adapt the decoded image for downstream machine vision tasks. Our method is plug-and-play and compatible with all existing learned image compression models. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks, even with a reduced number of trainable parameters and computational complexity. In the future work, we will extend our work to video coding for machines and humans. + +# 6 Acknowledgement + +This work was supported in part by the National Natural Science Foundation of China under Grant 62125109, Grant 61931023, Grant 61932022, Grant 62371288, Grant 62320106003, Grant 62301299, Grant T2122024, Grant 62120106007, China Postdoctoral Innovation Talents Support Program (BX20230184). + +# References + +1. Bai, Y., Yang, X., Liu, X., Jiang, J., Wang, Y., Ji, X., Gao, W.: Towards end-to-end image compression and analysis with transformers. In: AAAI. vol. 36, pp. 104-112 (2022) +2. Balle, J., Chou, P.A., Minnen, D., Singh, S., Johnston, N., Agustsson, E., Hwang, S.J., Toderici, G.: Nonlinear transform coding. IEEE JSTSP 15(2), 339-353 (2020) +3. Balle, J., Laparra, V., Simoncelli, E.P.: End-to-end optimized image compression. In: ICLR (2016) +4. Balle, J., Minnen, D., Singh, S., Hwang, S.J., Johnston, N.: Variational image compression with a scale hyperprior. In: ICLR (2018) +5. Bégaint, J., Racapé, F., Feltman, S., Pushparaja, A.: Compressai: a python library and evaluation platform for end-to-end compression research. arXiv preprint arXiv:2011.03029 (2020) +6. Bjontegaard, G.: Calculation of average psnr differences between rd-curves. In: VCEG-M33 (2001) +7. Campos, J., Meierhans, S., Djelouah, A., Schroers, C.: Content adaptive optimization for neural image compression. In: CVPRW (2019) +8. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017) +9. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV. pp. 213-229. Springer (2020) +0. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. In: NeurIPS. vol. 35, pp. 16664-16678 (2022) +1. Chen, Y.H., Weng, Y.C., Kao, C.H., Chien, C., Chiu, W.C., Peng, W.H.: Transtic: Transferring transformer-based image compression from human perception to machine perception. In: ICCV. pp. 23297-23307 (2023) +2. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. In: ICLR (2023) +3. Cheng, Z., Sun, H., Takeuchi, M., Katto, J.: Learned image compression with discretized gaussian mixture likelihoods and attention modules. In: CVPR. pp. 7939-7948 (2020) +4. Choi, H., Bajic, I.V.: Scalable image coding for humans and machines. IEEE TIP 31, 2739-2754 (2022) +5. Chollet, F.: Xception: Deep learning with depthwise separable convolutions. In: CVPR. pp. 1251-1258 (2017) +6. Codevilla, F., Simard, J.G., Goroshin, R., Pal, C.: Learned image compression for machine perception. arXiv preprint arXiv:2111.02249 (2021) +7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: CVPR. pp. 248-255 (2009) + +18. Ding, S., Li, M., Yang, T., Qian, R., Xu, H., Chen, Q., Wang, J., Xiong, H.: Motion-aware contrastive video representation learning via foreground-background merging. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9716-9726 (2022) +19. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: ICLR (2020) +20. Feng, R., Gao, Y., Jin, X., Feng, R., Chen, Z.: Semantically structured image compression via irregular group-based decoupling. In: ICCV (2023) +21. Feng, R., Liu, J., Jin, X., Pan, X., Sun, H., Chen, Z.: Prompt-icm: A unified framework towards image coding for machines with task-driven prompts. arXiv preprint arXiv:2305.02578 (2023) +22. Fischer, K., Brand, F., Kaup, A.: Boosting neural image compression for machines using latent space masking. IEEE TCSVT (2022) +23. Girshick, R.: Fast r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 1440-1448 (2015) +24. He, J., Zhou, C., Ma, X., Berg-Kirkpatrick, T., Neubig, G.: Towards a unified view of parameter-efficient transfer learning. In: ICLR (2022) +25. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017) +26. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR. pp. 770-778 (2016) +27. He, X., Li, C., Zhang, P., Yang, J., Wang, X.E.: Parameter-efficient model adaptation for vision transformers. In: AAAI. vol. 37, pp. 817-825 (2023) +28. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: ICML. pp. 2790-2799. PMLR (2019) +29. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4700-4708 (2017) +30. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: ECCV. pp. 709-727. Springer (2022) +31. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: CVPR. pp. 19113-19122 (2023) +32. Koyuncu, A.B., Gao, H., Boev, A., Gaikov, G., Alshina, E., Steinbach, E.: Contextformer: A transformer with spatio-channel attention for context modeling in learned image compression. In: ECCV (2022) +33. Lee, J., Cho, S., Beack, S.K.: Context-adaptive entropy model for end-to-end optimized image compression. In: ICLR (2019) +34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: EMNLP (2021) +35. Li, H., Li, S., Dai, W., Li, C., Zou, J., Xiong, H.: Frequency-aware transformer for learned image compression. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=HKGQDDTuvZ +36. Li, H., Shi, B., Dai, W., Chen, Y., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Hierarchical graph networks for 3d human pose estimation. arXiv preprint arXiv:2111.11927 (2021) +37. Li, H., Shi, B., Dai, W., Zheng, H., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Pose-oriented transformer with uncertainty-guided refinement for 2d-to-3d human pose estimation. In: AAAI. vol. 37, pp. 1296-1304 (2023) + +38. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014) +39. Liu, J., Feng, R., Qi, Y., Chen, Q., Chen, Z., Zeng, W., Jin, X.: Rate-distortion-cognition controllable versatile neural image compression. In: ECCV. Springer (2024) +40. Liu, J., Jin, X., Feng, R., Chen, Z., Zeng, W.: Composable image coding for machine via task-oriented internal adaptor and external prior. In: VCIP. pp. 1-5 (2023) +41. Liu, J., Sun, H., Katto, J.: Improving multiple machine vision tasks in the compressed domain. In: ICPR. pp. 331-337. IEEE (2022) +42. Liu, J., Sun, H., Katto, J.: Learned image compression with mixed transformer-cnn architectures. In: CVPR. pp. 14388-14397 (2023) +43. Liu, K., Liu, D., Li, L., Yan, N., Li, H.: Semantics-to-signal scalable image compression with learned revertible representations. IJCV 129(9), 2605-2621 (2021) +44. Liu, L., Hu, Z., Chen, Z., Xu, D.: Icmh-net: Neural image compression towards both machine vision and human vision. In: ACM MM. pp. 8047-8056 (2023) +45. Liu, P., Yuan, W., Fu, J., Jiang, Z., Hayashi, H., Neubig, G.: Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing. ACM Computing Surveys 55(9), 1-35 (2023) +46. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV. pp. 10012-10022 (2021) +47. Lu, M., Guo, P., Shi, H., Cao, C., Ma, Z.: Transformer-based image compression. In: DCC. pp. 469-469 (2022) +48. Lv, Y., Xiang, J., Zhang, J., Yang, W., Han, X., Yang, W.: Dynamic low-rank instance adaptation for universal neural image compression. In: ACM MM. pp. 632-642 (2023) +49. Mentzer, F., Agustsson, E., Tschannen, M., Timofte, R., Gool, L.V.: Practical full resolution learned lossless image compression. In: CVPR. pp. 10629-10638 (2019) +50. Minnen, D., Balle, J., Toderici, G.D.: Joint autoregressive and hierarchical priors for learned image compression. In: NeurIPS. vol. 31 (2018) +51. Minnen, D., Singh, S.: Channel-wise autoregressive entropy models for learned image compression. In: ICIP. pp. 3339-3343 (2020) +52. Nair, V., Hinton, G.E.: Rectified linear units improve restricted boltzmann machines. In: ICML. pp. 807-814 (2010) +53. Pfeiffer, J., Kamath, A., Rückle, A., Cho, K., Gurevych, I.: Adapterfusion: Nondestructive task composition for transfer learning. arXiv preprint arXiv:2005.00247 (2020) +54. Pfeiffer, J., Rückle, A., Poth, C., Kamath, A., Vulic, I., Ruder, S., Cho, K., Gurevych, I.: Adapterhub: A framework for adapting transformers. In: EMNLP. pp. 46-54 (2020) +55. Qian, Y., Sun, X., Lin, M., Tan, Z., Jin, R.: Entroformer: A transformer-based entropy model for learned image compression. In: ICLR (2022) +56. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. In: NeurIPS. vol. 28 (2015) +57. Shen, S., Yue, H., Yang, J.: Dec-adapter: Exploring efficient decoder-side adapter for bridging screen content and natural image compression. In: CVPR. pp. 12887-12896 (2023) +58. Shi, B., Jiang, D., Zhang, X., Li, H., Dai, W., Zou, J., Xiong, H., Tian, Q.: A transformer-based decoder for semantic segmentation with multi-level context mining. In: European Conference on Computer Vision. pp. 624-639. Springer (2022) + +59. Strudel, R., Garcia, R., Laptev, I., Schmid, C.: Segmenter: Transformer for semantic segmentation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 7262-7272 (2021) +60. Sun, K., Xiao, B., Liu, D., Wang, J.: Deep high-resolution representation learning for human pose estimation. In: CVPR. pp. 5693-5703 (2019) +61. Tsubota, K., Akutsu, H., Aizawa, K.: Universal deep image compression via content-adaptive optimization with adapters. In: WACV. pp. 2529-2538 (2023) +62. Wang, Y., Shi, B., Zhang, X., Li, J., Liu, Y., Dai, W., Li, C., Xiong, H., Tian, Q.: Adapting shortcut with normalizing flow: An efficient tuning framework for visual recognition. In: CVPR. pp. 15965-15974 (2023) +63. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. In: NeurIPS. vol. 34, pp. 12077-12090 (2021) +64. Yang, S., Hu, Y., Yang, W., Duan, L.Y., Liu, J.: Towards coding for human and machine vision: Scalable face image coding. IEEE TMM 23, 2957-2971 (2021) +65. Zheng, H., Zhou, L., Li, H., Su, J., Wei, X., Xu, X.: Bem: Balanced and entropy-based mix for long-tailed semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22893-22903 (June 2024) +66. Zheng, S., Lu, J., Zhao, H., Zhu, X., Luo, Z., Wang, Y., Fu, Y., Feng, J., Xiang, T., Torr, P.H., et al.: Rethinking semantic segmentation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6881-6890 (2021) +67. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020) +68. Zou, R., Song, C., Zhang, Z.: The devil is in the details: Window-based attention for image compression. In: CVPR. pp. 17492-17501 (2022) \ No newline at end of file diff --git a/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/images.zip b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..753aa3a680f15826ffe0f1a15d5611d937765c8a --- /dev/null +++ b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d9f1383877069845b180febd3fa88322475a82bfcdcf71336621327a5fb4c0b2 +size 840988 diff --git a/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/layout.json b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..87694097ff8d51db5de068dcd435eea7af72c2ea --- /dev/null +++ b/2024/Image Compression for Machine and Human Vision With Spatial-Frequency Adaptation/layout.json @@ -0,0 +1,10054 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 150, + 111, + 463, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 150, + 111, + 463, + 148 + ], + "spans": [ + { + "bbox": [ + 150, + 111, + 463, + 148 + ], + "type": "text", + "content": "Image Compression for Machine and Human Vision with Spatial-Frequency Adaptation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "spans": [ + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": "Han Li" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": ", Shaohui Li" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{2(\\boxtimes)}" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": ", Shuangrui Ding" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": ", Wenrui Dai" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{1(\\boxtimes)}" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": ", Maida Cao" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": ", Chenglin Li" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": ", Junni Zou" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "text", + "content": ", and Hongkai Xiong" + }, + { + "bbox": [ + 173, + 167, + 438, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "spans": [ + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "type": "text", + "content": " Shanghai Jiao Tong University \n" + }, + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "type": "text", + "content": " Tsinghua Shenzhen International Graduate School, Tsinghua University \n" + }, + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 133, + 201, + 483, + 257 + ], + "type": "text", + "content": " The Chinese University of Hong Kong \n{qingshi9974, daiwenrui, caomaida, lcl1985, zoujunni, xionghongkai}@sjtu.edu.cn \nlishaohui@sz.tsinghua.edu.cn, ds023@ie.cuhk.edu.hk" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 159, + 285, + 455, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 285, + 455, + 473 + ], + "spans": [ + { + "bbox": [ + 159, + 285, + 455, + 473 + ], + "type": "text", + "content": "Abstract. Image compression for machine and human vision (ICMH) has gained increasing attention in recent years. Existing ICMH methods are limited by high training and storage overheads due to heavy design of task-specific networks. To address this issue, in this paper, we develop a novel lightweight adapter-based tuning framework for ICMH, named Adapt-ICMH, that better balances task performance and bitrates with reduced overheads. We propose a spatial-frequency modulation adapter (SFMA) that simultaneously eliminates non-semantic redundancy with a spatial modulation adapter, and enhances task-relevant frequency components and suppresses task-irrelevant frequency components with a frequency modulation adapter. The proposed adapter is plug-and-play and compatible with almost all existing learned image compression models without compromising the performance of pre-trained models. Experiments demonstrate that Adapt-ICMH consistently outperforms existing ICMH frameworks on various machine vision tasks with fewer fine-tuned parameters and reduced computational complexity. Code will be released at https://github.com/qingshi9974/ECCV2024-AdpatICMH." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 483, + 444, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 483, + 444, + 495 + ], + "spans": [ + { + "bbox": [ + 160, + 483, + 444, + 495 + ], + "type": "text", + "content": "Keywords: Learned Image Compression " + }, + { + "bbox": [ + 160, + 483, + 444, + 495 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 483, + 444, + 495 + ], + "type": "text", + "content": " Machine Vision " + }, + { + "bbox": [ + 160, + 483, + 444, + 495 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 483, + 444, + 495 + ], + "type": "text", + "content": " Adapter" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 514, + 230, + 528 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 514, + 230, + 528 + ], + "spans": [ + { + "bbox": [ + 132, + 514, + 230, + 528 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 539, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 539, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 539, + 482, + 647 + ], + "type": "text", + "content": "The booming of computer vision [18,25,26,46,56,60,63,65] raises the demands for excessive images serving machine vision systems and accomplishing tasks such as classification, detection, segmentation. In practice, images from users have to be compressed and transmitted to exploit the off-the-shelf recognition models deployed in the cloud. However, compression directly using existing image CODECs, especially learned image compression (LIC) models [3, 4, 35, 42, 50, 51, 68] optimized for human vision, could cause the loss of semantic information contained in images and dramatically reduce the accuracy of downstream tasks. To meet the demands of both machine and human vision systems, unified CODEcs" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 654, + 337, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 654, + 337, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 654, + 337, + 665 + ], + "type": "text", + "content": "Correspondence to Wenrui Dai and Shaohui Li." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 304, + 258 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 304, + 258 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 304, + 258 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 304, + 258 + ], + "type": "image", + "image_path": "15acc961743b0d0aa7a9015617d3b789548dfb781b9846f2470eeba2e8a96a1f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 270, + 482, + 338 + ], + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 338 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 338 + ], + "type": "text", + "content": "Fig. 1: Left: our adapter-based tuning framework. Right: Rate-accuracy performance comparison on classification for ImageNet-val [17]. We compare our methods (Ours-" + }, + { + "bbox": [ + 130, + 270, + 482, + 338 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 270, + 482, + 338 + ], + "type": "text", + "content": " indicates " + }, + { + "bbox": [ + 130, + 270, + 482, + 338 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 270, + 482, + 338 + ], + "type": "text", + "content": " middle dimensions for SFMA) with full fine-tuning, TransTIC [11], ICMH-Net [44], and channel selection [41]. BD-accuracy is computed by replacing the PSNR in BD-PSNR [6] with top-1 accuracy and setting the base codec of TIC [47] as the anchor. The size of circles indicates GFLOPs for inference during encoding." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 304, + 118, + 480, + 258 + ], + "blocks": [ + { + "bbox": [ + 304, + 118, + 480, + 258 + ], + "lines": [ + { + "bbox": [ + 304, + 118, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 304, + 118, + 480, + 258 + ], + "type": "image", + "image_path": "b4c6b4c9174d081db4bc085d9283f2552afd0ee1326b6d5caaaafe00ac9d838a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 362, + 480, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 362, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 480, + 387 + ], + "type": "text", + "content": "to achieve image compression for machine and human vision (ICMH) have been explored [1, 11, 14, 16, 20, 22, 39-41, 43, 44, 64]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 388, + 480, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 480, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 480, + 448 + ], + "type": "text", + "content": "A multi-task pipeline has been built for ICMH in [1, 14, 16], where a task-agnostic encoder and multiple task-specific decoders are jointly trained from scratch for human vision and multiple machine vision tasks. However, the multi-task pipeline results in degraded rate-distortion (R-D) performance for human vision and is restricted in adapting to newly coming machine vision tasks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 449, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 628 + ], + "type": "text", + "content": "Since LIC models are usually fitted to the distributions of natural images [33, 49], recent works [11,22,40,41,44] tend to adopt a tuning framework that adapts a pre-trained image codec optimized for human vision (called base codec) to diverse machine vision tasks without sacrificing R-D performance. This pipeline enables ICMH by training only a lightweight module specifically for the machine vision task, while freezing the base codec parameters for sharing across human and machine vision. In ICMH-Net [44], a spatial-channel mask generator is trained to determine a subset of quantized latent for a specific machine vision task. Chen et al. [11] utilized visual prompt tuning [30] to transfer the transformer-based base codec [47] to machine vision tasks. Unfortunately, these methods suffer from evidently degraded performance compared to codec's fully fine-tuned for machine vision tasks. Besides, they introduce significant overheads of computational and model complexity to the base codec due to their task-specific designs. It remains a challenge to achieve efficient fine-tuning of pre-trained human vision-oriented image codec on machine vision tasks." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 630, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 481, + 665 + ], + "type": "text", + "content": "In this paper, we consider the fact that almost all spatial and frequency components of an image are exploited by the base codec to improve the visual quality for human vision but could be redundant for machine vision tasks. We are" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 480, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 480, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 480, + 163 + ], + "type": "text", + "content": "thereby motivated to modulate the intermediate feature of the base codec in both spatial and frequency domains such that the redundancy in the latent representation can be reduced and the reconstructed image can be efficiently adapted to various machine vision tasks." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 482, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 482, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 482, + 331 + ], + "type": "text", + "content": "To this end, we propose a play-and-plug module of spatial-frequency modulation adapter (SFMA) to better balance the machine vision task performance and transmission cost. Specifically, the proposed SFMA consists of two parallel submodules, i.e., a spatial modulation adapter (SMA) that eliminates non-semantic redundancies in the spatial domain and a frequency modulation adapter (FMA) that amplifies the frequency components that contribute more to the machine vision task (e.g., high-frequency components are more crucial for segmentation) and suppresses the redundant frequency components. Furthermore, we develop an adapter-based tuning framework for ICHM, named Adapt-ICMH, by plugging the proposed SFMA into both the encoder and decoder of the base codec, as depicted in Fig. 1. It should be noted that, different from [11] that can only adapt the transformer-based base codec, Adapt-ICMH is architecture-agnostic such that it is compatible with almost all existing LIC models for adaptation to various machine vision tasks. In summary, our contributions include:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 338, + 480, + 456 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 338, + 479, + 372 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 338, + 479, + 372 + ], + "spans": [ + { + "bbox": [ + 138, + 338, + 479, + 372 + ], + "type": "text", + "content": "- We propose a spatial-frequency modulation adapter (SFMA) to efficiently update the intermediate feature and better balance the performance and bitrates for diverse machine vision tasks." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 373, + 480, + 408 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 373, + 480, + 408 + ], + "spans": [ + { + "bbox": [ + 138, + 373, + 480, + 408 + ], + "type": "text", + "content": "- Based on SFMA, we develop a novel tuning framework named Adapt-ICMH to achieve image coding for machine and human vision with a shared base codec, significantly reducing the training and storage overhead." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 409, + 480, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 409, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 138, + 409, + 480, + 456 + ], + "type": "text", + "content": "- Our SFMA is plug-and-play, which could be incorporated with all existing LIC models to achieve ICMH. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks with even reduced model and computational complexity." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 474, + 237, + 487 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 474, + 237, + 487 + ], + "spans": [ + { + "bbox": [ + 132, + 474, + 237, + 487 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 628 + ], + "type": "text", + "content": "Learned Image Compression (LIC) has attracted wide attention due to its superior rate-distortion (R-D) performance. Research in LIC can be categorized into two main paths. The first focuses on enhancing the nonlinear transforms [2], evolving from convolutional neural networks (CNN)-based [3,4,50,51] to attention-based transforms [13], and more recently, transformer-based transforms [35,42,47,68]. The second path involves designing more powerful entropy models. Prior works [3,4] proposed factorized and hyperprior models, while recent efforts [32,50,51,55] tend to introduce spatial or channel-wise autoregression in the entropy model. However, these methods focus solely on the human visual quality of the decoded image, while ignoring the application in downstream machine vision tasks." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "Image Compression for Machine and Human Vision (ICMH) has become a hot topic in recent years due to the growing number of images that need to be processed for various machine vision tasks, such as classification [17,26,29]," + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 479, + 163 + ], + "type": "text", + "content": "detection [9,23,67], segmentation [25,58,59,66] and pose estimation [8,36,37,60]. One straight way is to fully fine-tune the base codec on machine vision tasks. However, this requires storing and deploying a separate copy of the entire codec network for each individual task, which severely hampers practical applicability." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 482, + 368 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 482, + 368 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 482, + 368 + ], + "type": "text", + "content": "Earlier works [1, 14, 16, 41] presented a multi-task pipeline to unify the image coding for machine and human vision. However, it still requires multiple task-specific decoders, leading to increased storage overhead. In addition, the entire network must be trained from scratch, resulting in significant training overhead and impeding the adaptation to newly coming machine vision tasks. To address this problem, Liu et al. [44] proposed to leverage the pre-trained human vision-oriented base codec and train an extra spatial-channel mask generator to transmit a subset of latent for machine vision task. Unfortunately, it cannot be easily extended to autoregression-based entropy models [50, 51] and fails to achieve adaptation of the nonlinear transforms. Chen et al. [11] proposed a prompt-based tuning framework that introduces prompts in the transformer-based nonlinear transforms for machine vision. However, it cannot be compatible with the mainstream CNN-based LIC methods [3, 4, 13] and the performance is still highly inferior to full fine-tuning. In contrast, our framework generalizes to almost all existing LIC models with different nonlinear transforms and entropy models and achieves comparable rate-accuracy performance compared to full fine-tuning. See Appendix B for more discussions about ICMH." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 368, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 368, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 368, + 482, + 548 + ], + "type": "text", + "content": "Parameter-Efficient Fine-Tuning (PEFT) has been extensively studied for NLP [24, 28, 34, 45, 53, 54]. It can effectively fine-tune a pre-trained large-scale model on downstream tasks or datasets with the major model frozen. With the advent of vision transformers [9, 19, 46], researchers have applied PEFT tools to machine vision tasks, including prompt tuning [30, 31], adapters [10, 12, 62], and LoRA [27]. In the field of learned image compression, Feng et al. [21] first introduced prompts for machine-oriented image coding, while Liu et al. [11] further explored the application of prompt-tuning for ICMH. [48, 57, 61] transmitted the parameters of additional adapters for content-adaptive optimization [7, 33] to improve the human visual quality of the decoded image, which is completely different from ours in terms of methodology and application scenarios. In addition, naive adapters [10, 28, 40] update the feature without considering the transmission cost of different underlying frequencies and spatial components of the image, which is vital for ICMH. In our paper, we propose a novel spatial-frequency modulation adapter specifically for ICHM to address this limitation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 567, + 206, + 580 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 206, + 580 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 206, + 580 + ], + "type": "text", + "content": "3 Methods" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 595, + 358, + 608 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 595, + 358, + 608 + ], + "spans": [ + { + "bbox": [ + 132, + 595, + 358, + 608 + ], + "type": "text", + "content": "3.1 Empirical Findings by Full Fine-tuning" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": "We first conduct a simple experiment to highlight the key insight of this paper: image compression for machine vision tends to prioritize transmitting distinct spatial and frequency information compared to human vision. This preference also varies across specific machine vision tasks." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 211, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 211, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 211, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 164, + 202, + 224 + ], + "blocks": [ + { + "bbox": [ + 141, + 164, + 202, + 224 + ], + "lines": [ + { + "bbox": [ + 141, + 164, + 202, + 224 + ], + "spans": [ + { + "bbox": [ + 141, + 164, + 202, + 224 + ], + "type": "image", + "image_path": "24c0fa6e21c18790e3a0e8e892df2d8110db68ef5c7a77e0c90c0672f91e70e4.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 156, + 255, + 186, + 262 + ], + "lines": [ + { + "bbox": [ + 156, + 255, + 186, + 262 + ], + "spans": [ + { + "bbox": [ + 156, + 255, + 186, + 262 + ], + "type": "text", + "content": "Input Image" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 203, + 114, + 473, + 263 + ], + "blocks": [ + { + "bbox": [ + 203, + 114, + 473, + 263 + ], + "lines": [ + { + "bbox": [ + 203, + 114, + 473, + 263 + ], + "spans": [ + { + "bbox": [ + 203, + 114, + 473, + 263 + ], + "type": "image", + "image_path": "715c8196e265933e9238e9a6ca83029258c57d62e494cd8a5d66517fbc726caa.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "lines": [ + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "type": "text", + "content": "Fig. 2: Visualization of the bit allocation maps (first row) and power spectral density maps (second row) of the latent " + }, + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\hat{y}" + }, + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "type": "text", + "content": ". The left part shows the raw input image. Each column of the right part corresponds to a codec for each task, including the base codec for human vision and three fine-tuned CODEs for machine vision tasks. The bit allocation map is computed by averaging the negative log-likelihood (i.e., " + }, + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "type": "inline_equation", + "content": "-\\log_2p(\\hat{y})" + }, + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "type": "text", + "content": ") across channels. The power spectral density map is computed by applying the Fast Fourier Transform (FFT) to " + }, + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\hat{y}" + }, + { + "bbox": [ + 130, + 273, + 482, + 361 + ], + "type": "text", + "content": " with a shift operation to center the zero frequency component, and then averaging its absolute value across channels." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "text", + "content": "Taking the pre-trained mean-scale hyperprior" + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "inline_equation", + "content": "^4" + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "text", + "content": " model [50] optimized for human vision as the base codec, we fully fine-tune" + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "inline_equation", + "content": "^5" + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "text", + "content": " it on three different machine vision tasks, including classification, object detection, and instance segmentation. Then, we feed the same image to the base codec and three fine-tuned CODECs, respectively. The bit allocation map and power spectral density map of latent " + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "inline_equation", + "content": "\\hat{y}" + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "text", + "content": " for each codec are shown in Fig. 2." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 457, + 482, + 564 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 457, + 482, + 564 + ], + "spans": [ + { + "bbox": [ + 130, + 457, + 482, + 564 + ], + "type": "text", + "content": "From the bit allocation map, we can see that the base codec consumes more bitrates in the complex background region, while the CODEs that are fully finetuned on machine tasks pay more attention to the semantic object. In addition, we can see from the power spectral density maps that the base codec tends to encode frequency components as many as possible to achieve higher visual quality. However, many of these frequency components are redundant for machine vision. For example, instance segmentation prefers more mid- and high-frequency components for accurate edge and contour reconstruction, while low- and mid-frequency components are sufficient for simpler tasks (e.g., classification)." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 564, + 482, + 637 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 564, + 482, + 637 + ], + "spans": [ + { + "bbox": [ + 130, + 564, + 482, + 637 + ], + "type": "text", + "content": "These observations confirm that image compression has different spatial and frequency domain preferences for different tasks. However, fully fine-tuning the base codec on different machine vision tasks is costly in terms of training time and memory. Thus, in this paper, we propose a spatial-frequency modulation adapter to conduct efficient fine-tuning, and effectively reduce the redundancies in both spatial and frequency domains for machine vision tasks." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 473, + 654 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 473, + 654 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 473, + 654 + ], + "type": "text", + "content": "4 We use the pre-trained model (named mbt2018-mean) offered by CompressAI [5]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 134, + 654, + 369, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 654, + 369, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 654, + 369, + 665 + ], + "type": "text", + "content": "5 We use loss function (1) to conduct the full fine-tuning." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 268, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 268, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 268, + 127 + ], + "type": "text", + "content": "3.2 Framework Overview" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 134, + 155, + 482, + 367 + ], + "blocks": [ + { + "bbox": [ + 134, + 155, + 482, + 367 + ], + "lines": [ + { + "bbox": [ + 134, + 155, + 482, + 367 + ], + "spans": [ + { + "bbox": [ + 134, + 155, + 482, + 367 + ], + "type": "image", + "image_path": "9d05dc979dd62ae2472d10f455a31130c404c9e61a298ed02e9afaff1e8ad49c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 375, + 482, + 452 + ], + "lines": [ + { + "bbox": [ + 130, + 375, + 482, + 452 + ], + "spans": [ + { + "bbox": [ + 130, + 375, + 482, + 452 + ], + "type": "text", + "content": "Fig. 3: Overview of our proposed Adapt-ICMH framework. Multiple spatial-frequency modulation adapters (SFMA) are plugged into the encoder " + }, + { + "bbox": [ + 130, + 375, + 482, + 452 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 375, + 482, + 452 + ], + "type": "text", + "content": " and decoder " + }, + { + "bbox": [ + 130, + 375, + 482, + 452 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 375, + 482, + 452 + ], + "type": "text", + "content": " of the base codec for feature adaptation. During the adaptation to the machine vision task, the base codec is frozen and only these adapters are trainable. For briefness, we do not illustrate the specific architecture of the encoder, decoder stage, and entropy model, as it depends on the specific base codec. Please see Appendix E for the detailed architecture." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 479, + 482, + 550 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 550 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 550 + ], + "type": "text", + "content": "Our compression framework Adapt-ICMH, shown in Fig. 3, is designed to adapt the existing learned image compression model that is optimized for human vision (i.e., base codec) to downstream machine vision tasks. To this end, we propose the Spatial-Frequency Modulation Adapter (SFMA), a plug-and-play bottleneck module, which is plugged into the encoder " + }, + { + "bbox": [ + 130, + 479, + 482, + 550 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 479, + 482, + 550 + ], + "type": "text", + "content": " and decoder " + }, + { + "bbox": [ + 130, + 479, + 482, + 550 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 479, + 482, + 550 + ], + "type": "text", + "content": " of the base codec for feature adaptation." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 551, + 482, + 598 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 551, + 482, + 598 + ], + "spans": [ + { + "bbox": [ + 130, + 551, + 482, + 598 + ], + "type": "text", + "content": "During the adaptation stage, the weights of the base codec (blue part) are loaded from the pre-trained checkpoint and kept frozen. Therefore, we only optimize the added adapters (red part) for specific machine vision tasks with the following loss function:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 254, + 611, + 481, + 624 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 254, + 611, + 481, + 624 + ], + "spans": [ + { + "bbox": [ + 254, + 611, + 481, + 624 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {R} + \\lambda \\cdot \\mathcal {D} (\\boldsymbol {x}, \\hat {\\boldsymbol {x}}; \\mathcal {G}), \\tag {1}", + "image_path": "891344b6b507a32c56de0d2bd2f399f259e7905838618fc7825dc11b4a0c92bf.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{R}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": " denotes the overall estimated bitrates, " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": " calculates the task-specific perceptual distortion between raw image " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{x}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": " and reconstructed image " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{x}}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": " with an off-the-shelf recognition model " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": " (e.g., Faster RCNN [56] for object detection)." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": " is a trade-off term to balance the task performance and bitrates. Please refer to Appendix C for more details about loss function." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "text", + "content": "After adaptation, we can only modify the weights of lightweight adapters for different machine vision tasks, while keeping the parameters of the base codec unchanged. If an image needs to be compressed for human vision, we can directly remove the adapters to obtain the original base codec, so that the R-D performance for human vision is not affected. In this way, a single base codec model can be used for both human vision and multiple machine vision tasks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 230, + 358, + 243 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 230, + 358, + 243 + ], + "spans": [ + { + "bbox": [ + 131, + 230, + 358, + 243 + ], + "type": "text", + "content": "3.3 Spatial-Frequency Modulation Adapter" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "spans": [ + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": "The proposed Spatial-Frequency Modulation Adapter (SFMA) consists of a Spatial Modulation Adapter (SMA) and a Frequency Modulation Adapter (FMA), which are configured in a parallel way. As shown in Fig. 3, the encoder " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": " of base codec generally consists of four stages, denoted by " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "g_{a} = g_{a1} \\circ g_{a2} \\circ g_{a3} \\circ g_{a4}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": ". Given the input image " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "\\pmb{x} \\in \\mathbb{R}^{3 \\times H \\times W}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "H \\times W" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": " is the spatial resolution, we define the output feature of the " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": "-th intermediate stage of " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": " as " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "\\pmb{x}_{j} \\in \\mathbb{R}^{C_{j} \\times H_{j} \\times W_{j}}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "C_{j}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": " is the number of channels, " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "H_{j} = H / 2^{j}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "W_{j} = W / 2^{j}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "j \\in \\{1, 2, 3\\}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": ". Supposing that the SFMA plugged after the " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": "-th encoder stage is denoted by " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "\\mathrm{SFMA}_{j}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": ", we can obtain the adapted feature " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "\\tilde{\\pmb{x}}_{j}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": " by aggregating original input feature " + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "inline_equation", + "content": "\\pmb{x}_{j}" + }, + { + "bbox": [ + 130, + 250, + 482, + 370 + ], + "type": "text", + "content": " with the adapted component. The process can be defined as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 231, + 380, + 480, + 423 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 380, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 231, + 380, + 480, + 423 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\tilde {\\boldsymbol {x}} _ {j} = \\operatorname {S F M A} _ {j} (\\boldsymbol {x} _ {j}) \\\\ = \\boldsymbol {x} _ {j} + \\underbrace {\\operatorname {F M A} _ {j} \\left(\\boldsymbol {x} _ {j}\\right) + \\operatorname {S M A} _ {j} \\left(\\boldsymbol {x} _ {j}\\right)} _ {\\text {a d a p t e d c o m p o n e n t}}, \\tag {2} \\\\ \\end{array}", + "image_path": "a7241a190395d8eb04a85650cdace0cb088e139ad4d6dfc3749591f947105ad7.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\mathrm{FMA}_j" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\mathrm{SMA}_j" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " denote the " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": "-th frequency and spatial modulation adapter, respectively. The process of the adapter for decoder " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " can be derived similarly. Frequency Modulation Adapter. Our frequency modulation adapter (FMA) is designed to adapt the feature in the frequency domain. By this modulation operation, we can eliminate frequency redundancies and amplify the important frequency components for machine vision tasks. Specifically, the input " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\pmb{x}_j \\in \\mathbb{R}^{C_j \\times H_j \\times W_j}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " firstly be down-projected to a bottleneck middle dimension " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\hat{C} (\\hat{C} \\leq C_j)" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " by a linear layer " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\pmb{W}_{\\mathrm{down}}^{\\mathrm{f}} \\in \\mathbb{R}^{C_j \\times \\hat{C}}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " and then be transformed into frequency domain by fast Fourier transform (FFT), obtaining the middle feature " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\pmb{x}_j^{\\mathrm{f}}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": ". Subsequently, we generate a frequency modulation matrix " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\pmb{m}_j^{\\mathrm{f}}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " and then use Hadamard product to calculate the modulated result " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\bar{\\pmb{x}}_j^{\\mathrm{f}}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": ". Finally, " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\bar{\\pmb{x}}_j^{\\mathrm{f}}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": " is inversely transformed using inverse FFT (IFFT) and up-projected by another linear layer " + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "inline_equation", + "content": "\\pmb{W}_{\\mathrm{up}}^{\\mathrm{f}} \\in \\mathbb{R}^{\\hat{C} \\times C_j}" + }, + { + "bbox": [ + 130, + 431, + 485, + 594 + ], + "type": "text", + "content": ". The overall process of FMA can be formulated as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 227, + 604, + 480, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 604, + 480, + 669 + ], + "spans": [ + { + "bbox": [ + 227, + 604, + 480, + 669 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\boldsymbol {x} _ {j} ^ {\\mathrm {f}} = \\mathcal {F} (\\boldsymbol {x} _ {j} \\cdot \\boldsymbol {W} _ {\\text {d o w n}} ^ {\\mathrm {f}}, \\\\ \\boldsymbol {m} _ {j} ^ {\\mathrm {f}} = \\sigma (\\operatorname {D W - C o n v} _ {3 \\times 3} \\left(\\boldsymbol {x} _ {j} ^ {\\mathrm {f}}\\right)) \\cdot \\boldsymbol {W} _ {\\text {m i d d l e}} ^ {\\mathrm {f}}, \\tag {3} \\\\ \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}} = \\boldsymbol {x} _ {j} ^ {\\mathrm {f}} \\odot \\sigma (\\boldsymbol {m} _ {j} ^ {\\mathrm {f}}), \\\\ \\tilde {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}} = \\mathcal {F} ^ {- 1} (\\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {f}}) \\cdot \\boldsymbol {W} _ {\\mathrm {u p}} ^ {\\mathrm {f}} \\\\ \\end{array}", + "image_path": "74adc20eddc5d2fddc6f40866be9f1b24d1f033f9f744ae4023c12ed6c163e15.jpg" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": " denotes ReLU [52], DW-Conv" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "inline_equation", + "content": "_{3\\times 3}" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": " denotes depth-wise convolution [15] with kernel size " + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "inline_equation", + "content": "3\\times 3" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_{\\mathrm{middle}}^{\\mathrm{f}}\\in \\mathbb{R}^{\\hat{C}\\times \\hat{C}}" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": " is a linear layer, " + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "inline_equation", + "content": "\\odot" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": " denotes Hadamard product, and " + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "inline_equation", + "content": "\\mathcal{F}(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "inline_equation", + "content": "\\mathcal{F}^{-1}(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 153 + ], + "type": "text", + "content": " denote the FFT and IFFT, respectively." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "spans": [ + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": "Spatial Modulation Adapter. Our spatial modulation adapter (SMA) is designed to adapt features in the spatial domain, thus guiding the codec to focus more on the semantic region and reduce the spatial redundancies in the background. Similarly, the input " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "\\boldsymbol{x}_j \\in \\mathbb{R}^{C_j \\times H_j \\times W_j}" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": " is first down-projected to a bottleneck middle dimension " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "\\hat{C}" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": " by a linear layer " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "W_{\\mathrm{down1}}^{\\mathrm{s}} \\in \\mathbb{R}^{C_j \\times \\hat{C}}" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": ", obtaining the middle feature " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "\\boldsymbol{x}_j^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": ". Then, we produce the spatial modulation matrix " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "\\boldsymbol{m}_j^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": " by feeding " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "\\boldsymbol{x}_j" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": " to another down-projection linear layer " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "W_{\\mathrm{down2}}^{\\mathrm{s}} \\in \\mathbb{R}^{C_j \\times \\hat{C}}" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": " followed by a " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "5 \\times 5" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": " depth-wise convolution layer. We then apply an up-projection linear layer " + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "inline_equation", + "content": "W_{\\mathrm{up}}^{\\mathrm{s}} \\in \\mathbb{R}^{\\hat{C} \\times C_j}" + }, + { + "bbox": [ + 130, + 154, + 480, + 280 + ], + "type": "text", + "content": " to the modulated feature to get the spatial adapted result. The overall process of SMA can be formulated as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 233, + 290, + 480, + 352 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 290, + 480, + 352 + ], + "spans": [ + { + "bbox": [ + 233, + 290, + 480, + 352 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\boldsymbol {x} _ {j} ^ {\\mathrm {s}} = \\boldsymbol {x} _ {j} \\cdot \\boldsymbol {W} _ {\\text {d o w n 1}} ^ {\\mathrm {s}}, \\\\ \\boldsymbol {m} _ {j} ^ {\\mathrm {s}} = \\operatorname {D W - C o n v} _ {5 \\times 5} \\left(\\boldsymbol {x} _ {j} ^ {\\mathrm {s}} \\cdot \\boldsymbol {W} _ {\\text {d o w n} 2} ^ {\\mathrm {s}}\\right), (4) \\\\ \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} = \\boldsymbol {x} _ {j} ^ {\\mathrm {s}} \\odot \\sigma \\left(\\boldsymbol {m} _ {j} ^ {\\mathrm {s}}\\right), (4) \\\\ \\tilde {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} = \\bar {\\boldsymbol {x}} _ {j} ^ {\\mathrm {s}} \\cdot \\boldsymbol {W} _ {\\mathrm {u p}} ^ {\\mathrm {s}}, \\\\ \\end{array}", + "image_path": "c8c5435310062b6aec79c852b73be7294a3da2a25e9815dcb4ada7cf60242606.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 365, + 230, + 378 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 230, + 378 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 230, + 378 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 388, + 313, + 400 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 388, + 313, + 400 + ], + "spans": [ + { + "bbox": [ + 132, + 388, + 313, + 400 + ], + "type": "text", + "content": "4.1 Training Details and Datasets." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 405, + 482, + 609 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 405, + 482, + 609 + ], + "spans": [ + { + "bbox": [ + 130, + 405, + 482, + 609 + ], + "type": "text", + "content": "To demonstrate the generalization ability of our framework, we adopt three mainstream LIC methods, i.e., stacked convolution-based [50], residual network-based [13], and transformer-based [47] image compression model. We use their pretrained models from CompressAI [5] library as base codes, denoted by mbt2018-mean, cheng2020-anchor and Lu2022-TIC, respectively. For benchmark machine vision tasks, we evaluate our framework on classification, object detection, and instance segmentation, respectively. By freezing these base codec's pre-trained for human vision, we then train our SFMAs using the task-specific loss of Eq. (1) with the bottleneck middle dimension " + }, + { + "bbox": [ + 130, + 405, + 482, + 609 + ], + "type": "inline_equation", + "content": "\\hat{C}" + }, + { + "bbox": [ + 130, + 405, + 482, + 609 + ], + "type": "text", + "content": " set to 64. Specifically, we train the classification task on ImageNet-train dataset [17] for 8 epochs with a batch size of 16, and train the object detection and instance segmentation tasks on COCO2017-train dataset [38] both for 40 epochs with a batch size of 8. The images are randomly cropped and resized to " + }, + { + "bbox": [ + 130, + 405, + 482, + 609 + ], + "type": "inline_equation", + "content": "256\\times 256" + }, + { + "bbox": [ + 130, + 405, + 482, + 609 + ], + "type": "text", + "content": " for training all tasks. For the calculation of task-specific perceptual distortion term in the Eq. (1), we follow [11] to use the pre-trained ResNet50 [26], Faster R-CNN [56] and Mask R-CNN [25] for classification, object detection, and instance segmentation, respectively. More training details are included in Appendix C." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 624, + 215, + 635 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 624, + 215, + 635 + ], + "spans": [ + { + "bbox": [ + 132, + 624, + 215, + 635 + ], + "type": "text", + "content": "4.2 Evaluation" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "We follow the setting of [11] to evaluate the performance of our method. Specifically, we use bits per pixel (BPP) to evaluate bitrates for compression. For image" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "classification, the evaluations are conducted on the ImageNet-val dataset [17] and images are resized and center cropped to " + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "inline_equation", + "content": "256 \\times 256" + }, + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": ". We adopt the pre-trained ResNet50 from torchvision library as the off-the-shelf recognition model and use top-1 accuracy as the quality metric. For objection detection and instance segmentation, the evaluations are both done on the COCO2017-val dataset [38] by using the pre-trained Faster R-CNN and Mask R-CNN from detectron2 library as the off-the-shelf recognition model, respectively. The test images are resized to 800 pixels for the short side and we use mean average precision (mAP) with an Intersection of Union (IoU) threshold of 0.5 as the quality metric." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 243, + 299, + 255 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 243, + 299, + 255 + ], + "spans": [ + { + "bbox": [ + 131, + 243, + 299, + 255 + ], + "type": "text", + "content": "4.3 Rate-Accuracy Comparison" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 264, + 482, + 336 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 264, + 482, + 336 + ], + "spans": [ + { + "bbox": [ + 130, + 264, + 482, + 336 + ], + "type": "text", + "content": "We compare the rate-accuracy performance of our methods with the state-of-the-art (SOTA) methods" + }, + { + "bbox": [ + 130, + 264, + 482, + 336 + ], + "type": "inline_equation", + "content": "^6" + }, + { + "bbox": [ + 130, + 264, + 482, + 336 + ], + "type": "text", + "content": ", including TransTIC [11], ICMH-Net [44], and channel selection [41]. Note that our method has an equal R-D performance for human vision with these methods, since we all adopt the pre-trained image codec as base codec and freeze it. We also evaluate the rate-accuracy performance of the base codec and further full fine-tuning it on machine vision tasks end-to-end." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 336, + 482, + 432 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 336, + 482, + 432 + ], + "spans": [ + { + "bbox": [ + 130, + 336, + 482, + 432 + ], + "type": "text", + "content": "The rate-accuracy curves for competing methods are shown in Fig. 4. In addition, we also summarize the average bitrates savings, accuracy improvements, and the trainable parameters count of different methods in Tab. 1. Specifically, we report the BD-rate [6] results to quantify the average bitrates savings with equal task accuracy, we also follow [11] to report BD-acc/BD-mAP results to measure the average task accuracy improvements with equal bitrates. BD-acc/BD-mAP is calculated by replacing the PSNR in BD-PSNR with top-1 accuracy/mAP." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "spans": [ + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "text", + "content": "From the results of Fig. 4 and Tab. 1, we can observe that (1) our method consistently achieves excellent performance across all three machine vision tasks and outperforms [11, 41, 44], the superiority is more significant on the classification task; (2) Our method demonstrates strong generalization ability as it can effectively generalize to three different base CODEs, despite their varying architectures of nonlinear transforms (i.e., " + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "text", + "content": ") and entropy models. (3) our method achieve comparable or even superior performance to full fine-tuning. However, full fine-tuning requires storing and deploying a separate copy of the entire codec for each task, significantly increasing training and storage overhead and severely hindering practical applicability. (4) our method requires fewer trainable parameters (i.e., about " + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "inline_equation", + "content": "1 \\sim 5\\%" + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "text", + "content": " of the number of parameters of the base codec) compared to other tuning-based methods (i.e., about " + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "inline_equation", + "content": "1 \\sim 5\\%" + }, + { + "bbox": [ + 130, + 433, + 482, + 624 + ], + "type": "text", + "content": " of the number of parameters of the base codec), which demonstrates the parameter efficiency of our method. For the application on larger transformer-based image CODEs [35, 42, 68], see Appendix H. For the comparison of computational complexity, see Appendix G." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "type": "text", + "content": "6 Since ICMH-Net [44] and channel selection [41] are not open source and use different recognition models and test datasets than ours, we reproduce them with the same training settings as ours. See Appendix D for more details." + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 114, + 252, + 209 + ], + "blocks": [ + { + "bbox": [ + 143, + 114, + 252, + 209 + ], + "lines": [ + { + "bbox": [ + 143, + 114, + 252, + 209 + ], + "spans": [ + { + "bbox": [ + 143, + 114, + 252, + 209 + ], + "type": "image", + "image_path": "b0f9b63782fbfa6c5759bbede1bba9b2be9bbac649954cc1c4fe0d295b6fed53.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 253, + 114, + 362, + 209 + ], + "blocks": [ + { + "bbox": [ + 253, + 114, + 362, + 209 + ], + "lines": [ + { + "bbox": [ + 253, + 114, + 362, + 209 + ], + "spans": [ + { + "bbox": [ + 253, + 114, + 362, + 209 + ], + "type": "image", + "image_path": "3f7cfaa5dcb3c4628309819bf166078401a44f1f6181f9a6e715e524fb633b5d.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 363, + 115, + 471, + 209 + ], + "blocks": [ + { + "bbox": [ + 363, + 115, + 471, + 209 + ], + "lines": [ + { + "bbox": [ + 363, + 115, + 471, + 209 + ], + "spans": [ + { + "bbox": [ + 363, + 115, + 471, + 209 + ], + "type": "image", + "image_path": "d8514706e30510c014f1ec6483a9dc17e0fabe6ae43f5e752de716b329e7acf6.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 143, + 220, + 252, + 314 + ], + "blocks": [ + { + "bbox": [ + 233, + 211, + 381, + 220 + ], + "lines": [ + { + "bbox": [ + 233, + 211, + 381, + 220 + ], + "spans": [ + { + "bbox": [ + 233, + 211, + 381, + 220 + ], + "type": "text", + "content": "(a) Lu2022-TIC model [47] as base codec" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 143, + 220, + 252, + 314 + ], + "lines": [ + { + "bbox": [ + 143, + 220, + 252, + 314 + ], + "spans": [ + { + "bbox": [ + 143, + 220, + 252, + 314 + ], + "type": "image", + "image_path": "75e34c1e564472b08641e63de005cc6baae5ff40475401bf602ecccf7408cfe6.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 253, + 220, + 361, + 314 + ], + "blocks": [ + { + "bbox": [ + 253, + 220, + 361, + 314 + ], + "lines": [ + { + "bbox": [ + 253, + 220, + 361, + 314 + ], + "spans": [ + { + "bbox": [ + 253, + 220, + 361, + 314 + ], + "type": "image", + "image_path": "4c60657b2c1a756f1f86a81b0bc332bfabf2b41a5e4628bf6fec82732a716c07.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 362, + 220, + 470, + 314 + ], + "blocks": [ + { + "bbox": [ + 362, + 220, + 470, + 314 + ], + "lines": [ + { + "bbox": [ + 362, + 220, + 470, + 314 + ], + "spans": [ + { + "bbox": [ + 362, + 220, + 470, + 314 + ], + "type": "image", + "image_path": "d789faf5e5427ccf6b54d03a06f0cd60bc991e178cdc703ef4a69b29d95cce52.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 143, + 326, + 251, + 419 + ], + "blocks": [ + { + "bbox": [ + 221, + 316, + 392, + 325 + ], + "lines": [ + { + "bbox": [ + 221, + 316, + 392, + 325 + ], + "spans": [ + { + "bbox": [ + 221, + 316, + 392, + 325 + ], + "type": "text", + "content": "(b) Cheng2020-anchor model [13] as base codec" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 143, + 326, + 251, + 419 + ], + "lines": [ + { + "bbox": [ + 143, + 326, + 251, + 419 + ], + "spans": [ + { + "bbox": [ + 143, + 326, + 251, + 419 + ], + "type": "image", + "image_path": "262314d10b59bd95723008541acdee073a54d459aa06a8b8e9964d41626aaf23.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 228, + 421, + 385, + 430 + ], + "lines": [ + { + "bbox": [ + 228, + 421, + 385, + 430 + ], + "spans": [ + { + "bbox": [ + 228, + 421, + 385, + 430 + ], + "type": "text", + "content": "(c) mbt2018-mean model [50] as base codec" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 439, + 482, + 461 + ], + "lines": [ + { + "bbox": [ + 131, + 439, + 482, + 461 + ], + "spans": [ + { + "bbox": [ + 131, + 439, + 482, + 461 + ], + "type": "text", + "content": "Fig. 4: Rate-Accuracy performance comparison under different machine vision tasks and different base codecs." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 253, + 326, + 361, + 419 + ], + "blocks": [ + { + "bbox": [ + 253, + 326, + 361, + 419 + ], + "lines": [ + { + "bbox": [ + 253, + 326, + 361, + 419 + ], + "spans": [ + { + "bbox": [ + 253, + 326, + 361, + 419 + ], + "type": "image", + "image_path": "ade518f6b6357140dea8eda04603d9737e27d9112ecbe7b4149ea70c785a1d84.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 362, + 326, + 471, + 419 + ], + "blocks": [ + { + "bbox": [ + 362, + 326, + 471, + 419 + ], + "lines": [ + { + "bbox": [ + 362, + 326, + 471, + 419 + ], + "spans": [ + { + "bbox": [ + 362, + 326, + 471, + 419 + ], + "type": "image", + "image_path": "234ac8f77b9e1907c111b3661e2d765a65f31f2db7f279db4051dc57aa399d53.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 497, + 237, + 510 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 497, + 237, + 510 + ], + "spans": [ + { + "bbox": [ + 131, + 497, + 237, + 510 + ], + "type": "text", + "content": "4.4 Ablation study" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 521, + 481, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 481, + 555 + ], + "type": "text", + "content": "We conduct ablation studies to investigate how each design in our SFMA influences the overall performance. Without loss of generality, we use the pre-trained mbt2018-mean as the base codec for convenience." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": "Effect on the architecture of SFMA. We first explore the impact of the architecture of SFMA on performance by conducting experiments with various variants of SFMA, as summarized in Fig. 5. (a) Proposed SFMA: The default configuration of SFMA. (b) SMA-only: The FMA branch is removed, retaining only the SMA branch. (c) FMA-only: The SMA branch is removed, retaining only the FMA branch. (d) FMA-SMA-sequential: FMA and SMA are organized sequentially, where SMA is followed by FMA. (e) SMA-FMA-sequential: FMA and SMA are organized sequentially, where FMA is followed by SMA. (f) SMA-SMA-parallel: two SMAs are configured in parallel." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 130, + 178, + 481, + 357 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Comparison of rate-accuracy performance and the number of trainable parameters under different machine vision tasks and different base codecs. BD-rate, BD-acc, BD-mAP are used to quantitatively measure the rate-accuracy performance with the base codec as anchor, respectively. Arrows indicate whether lower is better " + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "inline_equation", + "content": "(\\downarrow)" + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": " or higher is better " + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "inline_equation", + "content": "(\\uparrow)" + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "inline_equation", + "content": "(-)" + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": " indicates the BD-rate can not be computed." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 130, + 178, + 481, + 357 + ], + "lines": [ + { + "bbox": [ + 130, + 178, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 178, + 481, + 357 + ], + "type": "table", + "html": "
MethodClassificationDetectionSegmentationTrainable \nParams ↓(M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
Lu2022-TIC
full fine-tuning-17.68-73.94%4.51-67.98%3.767.51(100%)
TransTIC [11]-58.32%9.96-46.30%2.77-46.41%2.701.61(21.4%)
ICMH-Net [44]-18.75%3.36-9.07%0.63-10.77%0.653.98(53.0%)
channel selection [41]-37.17%6.286.84%-0.5516.51%-0.940.91(12.1%)
Ours-88.57%16.90-55.14%3.55-52.40%3.210.28(3.7%)
Cheng2020-anchor
full fine-tuning-21.04-59.20%4.69-76.03%3.8626.60(100%)
ICMH-Net [44]-47.46%10.4-8.81%0.53-12.18%0.744.43(16.6%)
channel selection [41]-41.58%8.77-11.66%0.735.22%0.221.34(4.8%)
Ours-87.56%20.27-49.34%3.13-59.90%3.480.41(1.5%)
mbt2018-mean
full fine-tuning-79.92%17.97-60.87%3.87-56.64%3.287.03(100%)
ICMH-Net [44]-15.99%3.55-6.02%0.39-4.97%0.313.98(56.6%)
channel selection [41]-41.30%9.90-23.07%1.52-15.09%1.050.91(12.9%)
Ours-82.00%18.71-56.17%3.84-52.65%3.170.28(4.1%)
", + "image_path": "ff62bb4aea2d9e6a2252f58eac0379cdad8e2e0732250ee0839b8c8dde236c2d.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 136, + 369, + 194, + 407 + ], + "blocks": [ + { + "bbox": [ + 136, + 369, + 194, + 407 + ], + "lines": [ + { + "bbox": [ + 136, + 369, + 194, + 407 + ], + "spans": [ + { + "bbox": [ + 136, + 369, + 194, + 407 + ], + "type": "image", + "image_path": "0d5e00d22bb2d7a6aeaa2972f00ca915a4c44e2989c0f39e632fc8e785165bf7.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 160, + 409, + 170, + 416 + ], + "lines": [ + { + "bbox": [ + 160, + 409, + 170, + 416 + ], + "spans": [ + { + "bbox": [ + 160, + 409, + 170, + 416 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 195, + 369, + 250, + 407 + ], + "blocks": [ + { + "bbox": [ + 195, + 369, + 250, + 407 + ], + "lines": [ + { + "bbox": [ + 195, + 369, + 250, + 407 + ], + "spans": [ + { + "bbox": [ + 195, + 369, + 250, + 407 + ], + "type": "image", + "image_path": "1547b665286f4f5dcbd2ffd9ae67a1162b69270d462a371843374eb04a07c12a.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 217, + 409, + 227, + 416 + ], + "lines": [ + { + "bbox": [ + 217, + 409, + 227, + 416 + ], + "spans": [ + { + "bbox": [ + 217, + 409, + 227, + 416 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 427, + 480, + 450 + ], + "lines": [ + { + "bbox": [ + 131, + 427, + 480, + 450 + ], + "spans": [ + { + "bbox": [ + 131, + 427, + 480, + 450 + ], + "type": "text", + "content": "Fig. 5: Different variants of SFMA: (a) Proposed SFMA. (b) SMA-only.(c) FMA-only. (d) FMA-SMA-sequential. (e) SMA-FMA-sequential. (f) SMA-SMA-parallel." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 252, + 369, + 307, + 407 + ], + "blocks": [ + { + "bbox": [ + 252, + 369, + 307, + 407 + ], + "lines": [ + { + "bbox": [ + 252, + 369, + 307, + 407 + ], + "spans": [ + { + "bbox": [ + 252, + 369, + 307, + 407 + ], + "type": "image", + "image_path": "2015ae2e56dcf6681d5972729f0591f33a900b313774b5026bd31a3baac796e2.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 275, + 410, + 284, + 417 + ], + "lines": [ + { + "bbox": [ + 275, + 410, + 284, + 417 + ], + "spans": [ + { + "bbox": [ + 275, + 410, + 284, + 417 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 309, + 370, + 364, + 407 + ], + "blocks": [ + { + "bbox": [ + 309, + 370, + 364, + 407 + ], + "lines": [ + { + "bbox": [ + 309, + 370, + 364, + 407 + ], + "spans": [ + { + "bbox": [ + 309, + 370, + 364, + 407 + ], + "type": "image", + "image_path": "1a36831f954194abf3260fee6c9e0b654fe7b93177c949cbab44e91e49c8a6dc.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 332, + 411, + 341, + 418 + ], + "lines": [ + { + "bbox": [ + 332, + 411, + 341, + 418 + ], + "spans": [ + { + "bbox": [ + 332, + 411, + 341, + 418 + ], + "type": "text", + "content": "(d)" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 366, + 370, + 421, + 407 + ], + "blocks": [ + { + "bbox": [ + 366, + 370, + 421, + 407 + ], + "lines": [ + { + "bbox": [ + 366, + 370, + 421, + 407 + ], + "spans": [ + { + "bbox": [ + 366, + 370, + 421, + 407 + ], + "type": "image", + "image_path": "ec2f398b936239062db603c98f51acf261326d41bd393d6986c65f0b3630101c.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 390, + 411, + 399, + 418 + ], + "lines": [ + { + "bbox": [ + 390, + 411, + 399, + 418 + ], + "spans": [ + { + "bbox": [ + 390, + 411, + 399, + 418 + ], + "type": "text", + "content": "(e)" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 425, + 370, + 479, + 407 + ], + "blocks": [ + { + "bbox": [ + 425, + 370, + 479, + 407 + ], + "lines": [ + { + "bbox": [ + 425, + 370, + 479, + 407 + ], + "spans": [ + { + "bbox": [ + 425, + 370, + 479, + 407 + ], + "type": "image", + "image_path": "3e6a419ee0cd4e6947aae00ad3dde8c0bb911d1f23ba225147a632d3bf0c3714.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 447, + 411, + 455, + 418 + ], + "lines": [ + { + "bbox": [ + 447, + 411, + 455, + 418 + ], + "spans": [ + { + "bbox": [ + 447, + 411, + 455, + 418 + ], + "type": "text", + "content": "(f)" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "content": "The results are shown in Tab. 2. We can observe that (1) removing either SMA or FMA leads to performance degradation, and FMA plays a more important role than SMA in the adaptation process, showing the superiority of frequency domain adaptation. (2) parallel configuration outperforms the sequential configuration. (3) barely replicating SMA has more trainable parameters compared to our SFMA, but leads to a performance degradation. This shows that the improvement of our SFMA is not only due to an overall increase in model capacity but rather to its specific structure." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "Effect on the position of SFMA. We then investigate the impact of the position to plug the SFMA. The results are shown in the Table 3. From shallow to deep, we first plug SFMA after different stages of encoder " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": " and decoder " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": ". We observe that the SFMA at the shallow layer can benefit more for the rate-accuracy performance, i.e., plugging SFMA after stage1 of " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": " can achieve " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "69.54\\%" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": " bitrates savings for classification compared to the base codec, while plugging SFMA after stage3 of " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "g_{a}" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": " can only achieve " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "64.76\\%" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": " bitrates savings. In addition, employing more SFMA can bring further benefits." + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 141, + 135, + 471, + 228 + ], + "blocks": [ + { + "bbox": [ + 203, + 114, + 410, + 125 + ], + "lines": [ + { + "bbox": [ + 203, + 114, + 410, + 125 + ], + "spans": [ + { + "bbox": [ + 203, + 114, + 410, + 125 + ], + "type": "text", + "content": "Table 2: Ablations on different variants of SFMA" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 141, + 135, + 471, + 228 + ], + "lines": [ + { + "bbox": [ + 141, + 135, + 471, + 228 + ], + "spans": [ + { + "bbox": [ + 141, + 135, + 471, + 228 + ], + "type": "table", + "html": "
MethodClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
(a)-82.00%18.71-56.17%3.84-52.65%3.170.28
(b)-73.82%16.30-51.94%3.61-48.16%2.920.16
(c)-77.40%17.29-52.86%3.32-49.58%2.900.12
(d)-80.49%18.67-56.87%3.81-51.79%3.140.28
(e)-83.31%18.50-53.77%3.79-51.28%3.020.28
(f)-79.63%17.59-54.91%3.62-50.96%3.040.32
", + "image_path": "2da516834a59c5ac7fbe46f91190ea9d13b41ad9f554b77234b7d9c768d0074b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 258, + 477, + 350 + ], + "blocks": [ + { + "bbox": [ + 212, + 237, + 400, + 247 + ], + "lines": [ + { + "bbox": [ + 212, + 237, + 400, + 247 + ], + "spans": [ + { + "bbox": [ + 212, + 237, + 400, + 247 + ], + "type": "text", + "content": "Table 3: Ablations on the position of SFMA." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 258, + 477, + 350 + ], + "lines": [ + { + "bbox": [ + 133, + 258, + 477, + 350 + ], + "spans": [ + { + "bbox": [ + 133, + 258, + 477, + 350 + ], + "type": "table", + "html": "
Stage 1 2 3ga g₅ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
✓✓-69.54%15.95-50.72%3.39-48.27%2.920.09
✓✓-69.00%15.69-49.96%3.24-46.40%2.820.09
✓✓-64.76%13.29-50.08%3.17-39.98%2.430.09
✓✓-82.00%18.71-56.17%3.84-52.65%3.170.28
✓✓-64.75%13.28-38.84%2.88-38.67%2.280.14
✓✓-61.87%12.40-44.05%3.01-40.43%2.660.14
", + "image_path": "1d2adc5938235bd073886bfcc5808254eef0fa742b734679772e700153c502d0.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 371, + 481, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 371, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 371, + 481, + 430 + ], + "type": "text", + "content": "Then, we observe that SFMAs are indispensable at both the encoder and decoder side, such that removing either would lead to a significant degradation in performance. SFMA in the encoder tends to reduce redundancies in the feature for machine vision tasks. SFMA in the decoder tends to adapt the feature so that the reconstructed image is more suitable for downstream tasks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "text", + "content": "Effect on the middle dimension " + }, + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "inline_equation", + "content": "\\hat{C}" + }, + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "text", + "content": ". Tab. 4 reports how middle dimension " + }, + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "inline_equation", + "content": "\\hat{C}" + }, + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "text", + "content": " impacts the rate-accuracy performance and complexity of SFMA. The results show that enlarging the middle dimension from 1 to 128 can boost performance while leading to a higher training complexity. Thus, we set " + }, + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "inline_equation", + "content": "\\hat{C}" + }, + { + "bbox": [ + 130, + 431, + 481, + 491 + ], + "type": "text", + "content": " to 64 to make a better trade-off between performance and complexity." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 508, + 257, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 508, + 257, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 508, + 257, + 521 + ], + "type": "text", + "content": "4.5 Qualitative Results" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 528, + 481, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 528, + 481, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 528, + 481, + 552 + ], + "type": "text", + "content": "Fig. 6 shows the qualitative results of our Adapt-ICMH and other methods for instance segmentation. Our approach achieves superior segmentation results" + } + ] + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 152, + 594, + 459, + 664 + ], + "blocks": [ + { + "bbox": [ + 187, + 572, + 425, + 583 + ], + "lines": [ + { + "bbox": [ + 187, + 572, + 425, + 583 + ], + "spans": [ + { + "bbox": [ + 187, + 572, + 425, + 583 + ], + "type": "text", + "content": "Table 4: Ablations on the middle dimension " + }, + { + "bbox": [ + 187, + 572, + 425, + 583 + ], + "type": "inline_equation", + "content": "\\hat{C}" + }, + { + "bbox": [ + 187, + 572, + 425, + 583 + ], + "type": "text", + "content": " of SFMA." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 152, + 594, + 459, + 664 + ], + "lines": [ + { + "bbox": [ + 152, + 594, + 459, + 664 + ], + "spans": [ + { + "bbox": [ + 152, + 594, + 459, + 664 + ], + "type": "table", + "html": "
\\( \\hat{C} \\)ClassificationDetectionSegmentationParams (M)
BD-rate↓BD-acc↑BD-rate↓BD-mAP↑BD-rate↓BD-mAP↑
1-60.41%12.58-48.58%2.93-45.24%2.400.005
32-78.74%17.52-53.61%3.53-48.50%2.920.14
64-82.00%18.71-56.17%3.84-52.65%3.170.28
128-83.61%19.50-63.28%4.11-60.50%3.760.62
", + "image_path": "595f8a74eb05943f8b4afa97008976a9fc36ac5453ddddf7281171aabd31f23c.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "table_body" + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 113, + 480, + 373 + ], + "blocks": [ + { + "bbox": [ + 133, + 113, + 480, + 373 + ], + "lines": [ + { + "bbox": [ + 133, + 113, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 133, + 113, + 480, + 373 + ], + "type": "image", + "image_path": "6bac0c40ef6c80be3fcb1c55ce2d032dcb71a2ca2815a1478e07e2275e7deb78.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 382, + 482, + 439 + ], + "lines": [ + { + "bbox": [ + 130, + 382, + 482, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 382, + 482, + 439 + ], + "type": "text", + "content": "Fig. 6: Qualitative comparison of our Adapt-ICMH with other ICMH methods. First row: The original image and decoded image of each method. We show the decoded images for machine vision of three ICMH methods (left). Second row: The instance segmentation results of each image. Third row: The log power spectral density maps of each image. Bottom row: The bit allocation maps for " + }, + { + "bbox": [ + 130, + 382, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\hat{y}" + }, + { + "bbox": [ + 130, + 382, + 482, + 439 + ], + "type": "text", + "content": " of each method." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 471, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 471, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 471, + 482, + 544 + ], + "type": "text", + "content": "with a lower bitrate (0.147bpp). In comparison to other methods, Adapt-ICMH effectively minimizes the bitrates of the background while enhancing the high-frequency edge details of the semantic object. We also observe that our method's decoded image for machine vision exhibits some distortion in terms of overall chromaticity and brightness. However, these low-frequency distortions do not affect the segmentation result, which supports the goal of our SFMA." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 561, + 440, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 561, + 440, + 574 + ], + "spans": [ + { + "bbox": [ + 131, + 561, + 440, + 574 + ], + "type": "text", + "content": "4.6 Towards scalable coding for machine and human vision." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Scalable coding for machine and human vision is of practical significance to adapt the transmission among diverse demands. The framework of Fig 3, followed by [11,41], is designed to produce a single bitstream tailored for each individual task. However, our proposed SFMA can also benefit existing scalable coding methods to achieve better scalable coding performance for machine and human vision. To demonstrate it, we integrate our SFMA and the spatial-channel mask generator proposed by ICMH-Net [44] with the base codec. Specifically, we only" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 102 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 116, + 276, + 258 + ], + "blocks": [ + { + "bbox": [ + 132, + 116, + 276, + 258 + ], + "lines": [ + { + "bbox": [ + 132, + 116, + 276, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 276, + 258 + ], + "type": "image", + "image_path": "7b70a0bbe20fac413b0e6c575058e1c11a5d40d5b843280ad98e240c490315a3.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 266, + 482, + 310 + ], + "lines": [ + { + "bbox": [ + 130, + 266, + 482, + 310 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 482, + 310 + ], + "type": "text", + "content": "Fig. 7: Quantitative and qualitative comparison of each method for the object detection task. Pre-trained mbt2018-mean [50] is used as the base codec. We present the bpp/PSNR results for the decoded image for human vision and the bpp results for the decoded image for the detection task." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 277, + 115, + 480, + 258 + ], + "blocks": [ + { + "bbox": [ + 277, + 115, + 480, + 258 + ], + "lines": [ + { + "bbox": [ + 277, + 115, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 277, + 115, + 480, + 258 + ], + "type": "image", + "image_path": "b5bcd03b34d900b575055509cda6fab88a99c1c776b4560c3ba5177a94b39114.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "text", + "content": "plug our SFMA into the decoder " + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "text", + "content": " and utilize spatial-channel mask generator to produce two bitstreams, the truncated one is decoded by the " + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "text", + "content": " with SFMAs to reconstruct image for machine vision task, while the full bitstream is decoded by the " + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "inline_equation", + "content": "g_{s}" + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "text", + "content": " without SFMAs to reconstruct image for human vision. See Appendix F for detailed network architecture for scalable coding." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 402, + 482, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 462 + ], + "type": "text", + "content": "Fig. 7 show the comparison of rate-accuracy performance and qualitative results. It demonstrates the superior performance of our SFMA, which significantly improves the rate-accuracy performance of ICMH-Net. Note that we do not alter the base codec, so the visual quality of the image reconstructed from the full bitstream is the same as the base codec." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 495, + 220, + 507 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 495, + 220, + 507 + ], + "spans": [ + { + "bbox": [ + 132, + 495, + 220, + 507 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "In this paper, we develop a novel adapter-based tuning framework for ICMH, named Adapt-ICMH. Specifically, we fine-tune the pre-trained image codec optimized for human vision on multiple machine vision tasks, which is achieved by the proposed spatial-frequency modulation adapter (SFMA). Our SFMA can efficiently reduce the latent redundancies in both spatial and frequency domains, and effectively adapt the decoded image for downstream machine vision tasks. Our method is plug-and-play and compatible with all existing learned image compression models. Experiments show that our method consistently outperforms other ICMH methods in various machine vision tasks, even with a reduced number of trainable parameters and computational complexity. In the future work, we will extend our work to video coding for machines and humans." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 261, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 261, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 261, + 129 + ], + "type": "text", + "content": "6 Acknowledgement" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 485, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 485, + 188 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 485, + 188 + ], + "type": "text", + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant 62125109, Grant 61931023, Grant 61932022, Grant 62371288, Grant 62320106003, Grant 62301299, Grant T2122024, Grant 62120106007, China Postdoctoral Innovation Talents Support Program (BX20230184)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 205, + 197, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 197, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 197, + 217 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 228, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "type": "text", + "content": "1. Bai, Y., Yang, X., Liu, X., Jiang, J., Wang, Y., Ji, X., Gao, W.: Towards end-to-end image compression and analysis with transformers. In: AAAI. vol. 36, pp. 104-112 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 263, + 480, + 284 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 263, + 480, + 284 + ], + "spans": [ + { + "bbox": [ + 138, + 263, + 480, + 284 + ], + "type": "text", + "content": "2. Balle, J., Chou, P.A., Minnen, D., Singh, S., Johnston, N., Agustsson, E., Hwang, S.J., Toderici, G.: Nonlinear transform coding. IEEE JSTSP 15(2), 339-353 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 285, + 480, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 480, + 304 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 480, + 304 + ], + "type": "text", + "content": "3. Balle, J., Laparra, V., Simoncelli, E.P.: End-to-end optimized image compression. In: ICLR (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 306, + 480, + 327 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 306, + 480, + 327 + ], + "spans": [ + { + "bbox": [ + 138, + 306, + 480, + 327 + ], + "type": "text", + "content": "4. Balle, J., Minnen, D., Singh, S., Hwang, S.J., Johnston, N.: Variational image compression with a scale hyperprior. In: ICLR (2018)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 328, + 480, + 360 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 328, + 480, + 360 + ], + "spans": [ + { + "bbox": [ + 138, + 328, + 480, + 360 + ], + "type": "text", + "content": "5. Bégaint, J., Racapé, F., Feltman, S., Pushparaja, A.: Compressai: a python library and evaluation platform for end-to-end compression research. arXiv preprint arXiv:2011.03029 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 361, + 480, + 381 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 361, + 480, + 381 + ], + "spans": [ + { + "bbox": [ + 138, + 361, + 480, + 381 + ], + "type": "text", + "content": "6. Bjontegaard, G.: Calculation of average psnr differences between rd-curves. In: VCEG-M33 (2001)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "type": "text", + "content": "7. Campos, J., Meierhans, S., Djelouah, A., Schroers, C.: Content adaptive optimization for neural image compression. In: CVPRW (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 404, + 480, + 436 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 404, + 480, + 436 + ], + "spans": [ + { + "bbox": [ + 138, + 404, + 480, + 436 + ], + "type": "text", + "content": "8. Cao, Z., Simon, T., Wei, S.E., Sheikh, Y.: Realtime multi-person 2d pose estimation using part affinity fields. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7291-7299 (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 437, + 480, + 458 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 437, + 480, + 458 + ], + "spans": [ + { + "bbox": [ + 138, + 437, + 480, + 458 + ], + "type": "text", + "content": "9. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV. pp. 213-229. Springer (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 459, + 480, + 491 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 459, + 480, + 491 + ], + "spans": [ + { + "bbox": [ + 138, + 459, + 480, + 491 + ], + "type": "text", + "content": "0. Chen, S., Ge, C., Tong, Z., Wang, J., Song, Y., Wang, J., Luo, P.: Adaptformer: Adapting vision transformers for scalable visual recognition. In: NeurIPS. vol. 35, pp. 16664-16678 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 491, + 480, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 480, + 523 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 480, + 523 + ], + "type": "text", + "content": "1. Chen, Y.H., Weng, Y.C., Kao, C.H., Chien, C., Chiu, W.C., Peng, W.H.: Transtic: Transferring transformer-based image compression from human perception to machine perception. In: ICCV. pp. 23297-23307 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 524, + 480, + 545 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 524, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 138, + 524, + 480, + 545 + ], + "type": "text", + "content": "2. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. In: ICLR (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 546, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 546, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 546, + 480, + 578 + ], + "type": "text", + "content": "3. Cheng, Z., Sun, H., Takeuchi, M., Katto, J.: Learned image compression with discretized gaussian mixture likelihoods and attention modules. In: CVPR. pp. 7939-7948 (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 599 + ], + "type": "text", + "content": "4. Choi, H., Bajic, I.V.: Scalable image coding for humans and machines. IEEE TIP 31, 2739-2754 (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "type": "text", + "content": "5. Chollet, F.: Xception: Deep learning with depthwise separable convolutions. In: CVPR. pp. 1251-1258 (2017)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "text", + "content": "6. Codevilla, F., Simard, J.G., Goroshin, R., Pal, C.: Learned image compression for machine perception. arXiv preprint arXiv:2111.02249 (2021)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "text", + "content": "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: CVPR. pp. 248-255 (2009)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "18. Ding, S., Li, M., Yang, T., Qian, R., Xu, H., Chen, Q., Wang, J., Xiong, H.: Motion-aware contrastive video representation learning via foreground-background merging. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9716-9726 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 162, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 162, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 162, + 481, + 194 + ], + "type": "text", + "content": "19. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: ICLR (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "text", + "content": "20. Feng, R., Gao, Y., Jin, X., Feng, R., Chen, Z.: Semantically structured image compression via irregular group-based decoupling. In: ICCV (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "text", + "content": "21. Feng, R., Liu, J., Jin, X., Pan, X., Sun, H., Chen, Z.: Prompt-icm: A unified framework towards image coding for machines with task-driven prompts. arXiv preprint arXiv:2305.02578 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 270 + ], + "type": "text", + "content": "22. Fischer, K., Brand, F., Kaup, A.: Boosting neural image compression for machines using latent space masking. IEEE TCSVT (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 271, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 481, + 293 + ], + "type": "text", + "content": "23. Girshick, R.: Fast r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 1440-1448 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 315 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 315 + ], + "type": "text", + "content": "24. He, J., Zhou, C., Ma, X., Berg-Kirkpatrick, T., Neubig, G.: Towards a unified view of parameter-efficient transfer learning. In: ICLR (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 316, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 316, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 316, + 481, + 336 + ], + "type": "text", + "content": "25. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 337, + 481, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 337, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 337, + 481, + 357 + ], + "type": "text", + "content": "26. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR. pp. 770-778 (2016)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 358, + 481, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 380 + ], + "type": "text", + "content": "27. He, X., Li, C., Zhang, P., Yang, J., Wang, X.E.: Parameter-efficient model adaptation for vision transformers. In: AAAI. vol. 37, pp. 817-825 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "type": "text", + "content": "28. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: ICML. pp. 2790-2799. PMLR (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 414, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 414, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 481, + 445 + ], + "type": "text", + "content": "29. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4700-4708 (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 447, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 481, + 468 + ], + "type": "text", + "content": "30. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: ECCV. pp. 709-727. Springer (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 481, + 490 + ], + "type": "text", + "content": "31. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: CVPR. pp. 19113-19122 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 491, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 481, + 522 + ], + "type": "text", + "content": "32. Koyuncu, A.B., Gao, H., Boev, A., Gaikov, G., Alshina, E., Steinbach, E.: Contextformer: A transformer with spatio-channel attention for context modeling in learned image compression. In: ECCV (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 523, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 523, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 523, + 481, + 544 + ], + "type": "text", + "content": "33. Lee, J., Cho, S., Beack, S.K.: Context-adaptive entropy model for end-to-end optimized image compression. In: ICLR (2019)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 545, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 481, + 567 + ], + "type": "text", + "content": "34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: EMNLP (2021)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "text", + "content": "35. Li, H., Li, S., Dai, W., Li, C., Zou, J., Xiong, H.: Frequency-aware transformer for learned image compression. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=HKGQDDTuvZ" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 600, + 481, + 632 + ], + "type": "text", + "content": "36. Li, H., Shi, B., Dai, W., Chen, Y., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Hierarchical graph networks for 3d human pose estimation. arXiv preprint arXiv:2111.11927 (2021)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "text", + "content": "37. Li, H., Shi, B., Dai, W., Zheng, H., Wang, B., Sun, Y., Guo, M., Li, C., Zou, J., Xiong, H.: Pose-oriented transformer with uncertainty-guided refinement for 2d-to-3d human pose estimation. In: AAAI. vol. 37, pp. 1296-1304 (2023)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "38. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV. pp. 740-755 (2014)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 149, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 149, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 149, + 482, + 182 + ], + "type": "text", + "content": "39. Liu, J., Feng, R., Qi, Y., Chen, Q., Chen, Z., Zeng, W., Jin, X.: Rate-distortion-cognition controllable versatile neural image compression. In: ECCV. Springer (2024)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 182, + 482, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 482, + 204 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 482, + 204 + ], + "type": "text", + "content": "40. Liu, J., Jin, X., Feng, R., Chen, Z., Zeng, W.: Composable image coding for machine via task-oriented internal adaptor and external prior. In: VCIP. pp. 1-5 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 204, + 482, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 204, + 482, + 225 + ], + "spans": [ + { + "bbox": [ + 130, + 204, + 482, + 225 + ], + "type": "text", + "content": "41. Liu, J., Sun, H., Katto, J.: Improving multiple machine vision tasks in the compressed domain. In: ICPR. pp. 331-337. IEEE (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 225, + 482, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 225, + 482, + 246 + ], + "spans": [ + { + "bbox": [ + 130, + 225, + 482, + 246 + ], + "type": "text", + "content": "42. Liu, J., Sun, H., Katto, J.: Learned image compression with mixed transformer-cnn architectures. In: CVPR. pp. 14388-14397 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 246, + 482, + 268 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 246, + 482, + 268 + ], + "spans": [ + { + "bbox": [ + 130, + 246, + 482, + 268 + ], + "type": "text", + "content": "43. Liu, K., Liu, D., Li, L., Yan, N., Li, H.: Semantics-to-signal scalable image compression with learned revertible representations. IJCV 129(9), 2605-2621 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 268, + 482, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 268, + 482, + 289 + ], + "spans": [ + { + "bbox": [ + 130, + 268, + 482, + 289 + ], + "type": "text", + "content": "44. Liu, L., Hu, Z., Chen, Z., Xu, D.: Icmh-net: Neural image compression towards both machine vision and human vision. In: ACM MM. pp. 8047-8056 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 289, + 482, + 322 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 482, + 322 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 482, + 322 + ], + "type": "text", + "content": "45. Liu, P., Yuan, W., Fu, J., Jiang, Z., Hayashi, H., Neubig, G.: Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing. ACM Computing Surveys 55(9), 1-35 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 322, + 482, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 322, + 482, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 322, + 482, + 354 + ], + "type": "text", + "content": "46. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV. pp. 10012-10022 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 354, + 482, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 374 + ], + "type": "text", + "content": "47. Lu, M., Guo, P., Shi, H., Cao, C., Ma, Z.: Transformer-based image compression. In: DCC. pp. 469-469 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "type": "text", + "content": "48. Lv, Y., Xiang, J., Zhang, J., Yang, W., Han, X., Yang, W.: Dynamic low-rank instance adaptation for universal neural image compression. In: ACM MM. pp. 632-642 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 407, + 482, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 429 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 429 + ], + "type": "text", + "content": "49. Mentzer, F., Agustsson, E., Tschannen, M., Timofte, R., Gool, L.V.: Practical full resolution learned lossless image compression. In: CVPR. pp. 10629-10638 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 429, + 482, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 429, + 482, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 429, + 482, + 450 + ], + "type": "text", + "content": "50. Minnen, D., Balle, J., Toderici, G.D.: Joint autoregressive and hierarchical priors for learned image compression. In: NeurIPS. vol. 31 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 450, + 482, + 472 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 472 + ], + "type": "text", + "content": "51. Minnen, D., Singh, S.: Channel-wise autoregressive entropy models for learned image compression. In: ICIP. pp. 3339-3343 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 472, + 482, + 492 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 492 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 492 + ], + "type": "text", + "content": "52. Nair, V., Hinton, G.E.: Rectified linear units improve restricted boltzmann machines. In: ICML. pp. 807-814 (2010)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 492, + 482, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 492, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 492, + 482, + 525 + ], + "type": "text", + "content": "53. Pfeiffer, J., Kamath, A., Rückle, A., Cho, K., Gurevych, I.: Adapterfusion: Nondestructive task composition for transfer learning. arXiv preprint arXiv:2005.00247 (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 525, + 482, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 557 + ], + "type": "text", + "content": "54. Pfeiffer, J., Rückle, A., Poth, C., Kamath, A., Vulic, I., Ruder, S., Cho, K., Gurevych, I.: Adapterhub: A framework for adapting transformers. In: EMNLP. pp. 46-54 (2020)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 557, + 482, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 578 + ], + "type": "text", + "content": "55. Qian, Y., Sun, X., Lin, M., Tan, Z., Jin, R.: Entroformer: A transformer-based entropy model for learned image compression. In: ICLR (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 578, + 482, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 578, + 482, + 600 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 482, + 600 + ], + "type": "text", + "content": "56. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. In: NeurIPS. vol. 28 (2015)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 600, + 482, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 600, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 600, + 482, + 632 + ], + "type": "text", + "content": "57. Shen, S., Yue, H., Yang, J.: Dec-adapter: Exploring efficient decoder-side adapter for bridging screen content and natural image compression. In: CVPR. pp. 12887-12896 (2023)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "text", + "content": "58. Shi, B., Jiang, D., Zhang, X., Li, H., Dai, W., Zou, J., Xiong, H., Tian, Q.: A transformer-based decoder for semantic segmentation with multi-level context mining. In: European Conference on Computer Vision. pp. 624-639. Springer (2022)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 392, + 91, + 447, + 101 + ], + "type": "text", + "content": "Adapt-ICMH" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 424 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 117, + 480, + 149 + ], + "type": "text", + "content": "59. Strudel, R., Garcia, R., Laptev, I., Schmid, C.: Segmenter: Transformer for semantic segmentation. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 7262-7272 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 480, + 171 + ], + "type": "text", + "content": "60. Sun, K., Xiao, B., Liu, D., Wang, J.: Deep high-resolution representation learning for human pose estimation. In: CVPR. pp. 5693-5703 (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 480, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 480, + 193 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 480, + 193 + ], + "type": "text", + "content": "61. Tsubota, K., Akutsu, H., Aizawa, K.: Universal deep image compression via content-adaptive optimization with adapters. In: WACV. pp. 2529-2538 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 480, + 226 + ], + "type": "text", + "content": "62. Wang, Y., Shi, B., Zhang, X., Li, J., Liu, Y., Dai, W., Li, C., Xiong, H., Tian, Q.: Adapting shortcut with normalizing flow: An efficient tuning framework for visual recognition. In: CVPR. pp. 15965-15974 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "text", + "content": "63. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. In: NeurIPS. vol. 34, pp. 12077-12090 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 281 + ], + "type": "text", + "content": "64. Yang, S., Hu, Y., Yang, W., Duan, L.Y., Liu, J.: Towards coding for human and machine vision: Scalable face image coding. IEEE TMM 23, 2957-2971 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 281, + 480, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 480, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 480, + 325 + ], + "type": "text", + "content": "65. Zheng, H., Zhou, L., Li, H., Su, J., Wei, X., Xu, X.: Bem: Balanced and entropy-based mix for long-tailed semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22893-22903 (June 2024)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 325, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 325, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 325, + 480, + 369 + ], + "type": "text", + "content": "66. Zheng, S., Lu, J., Zhao, H., Zhu, X., Luo, Z., Wang, Y., Fu, Y., Feng, J., Xiang, T., Torr, P.H., et al.: Rethinking semantic segmentation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6881-6890 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "text", + "content": "67. Zhu, X., Su, W., Lu, L., Li, B., Wang, X., Dai, J.: Deformable detr: Deformable transformers for end-to-end object detection. arXiv preprint arXiv:2010.04159 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 402, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 480, + 424 + ], + "type": "text", + "content": "68. Zou, R., Song, C., Zhang, Z.: The devil is in the details: Window-based attention for image compression. In: CVPR. pp. 17492-17501 (2022)" + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "H. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_content_list.json b/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..35277c55dd3f2c82e775287ee5123dbbfff9a740 --- /dev/null +++ b/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_content_list.json @@ -0,0 +1,2125 @@ +[ + { + "type": "text", + "text": "Image Demoiring in RAW and sRGB Domains", + "text_level": 1, + "bbox": [ + 227, + 141, + 774, + 162 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Shuning Xu $^{1}$ , Binbin Song $^{1}$ , Xiangyu Chen $^{1,2}$ , Xina Liu $^{1,2}$ , and Jiantao Zhou $^{1\\star}$", + "bbox": [ + 215, + 189, + 785, + 207 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 State Key Laboratory of Internet of Things for Smart City,", + "bbox": [ + 295, + 217, + 705, + 232 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Department of Computer and Information Science, University of Macau", + "bbox": [ + 261, + 232, + 738, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences {yc07425, yb97426, jtzhou}@um.edu.mo, chxy95@gmail.com, xn.liu95@siat.ac.cn", + "bbox": [ + 217, + 244, + 785, + 273 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Moiré patterns frequently appear when capturing screens with smartphones or cameras, potentially compromising image quality. Previous studies suggest that moiré pattern elimination in the RAW domain offers greater effectiveness compared to demoiréing in the sRGB domain. Nevertheless, relying solely on RAW data for image demoiréing is insufficient in mitigating the color cast due to the absence of essential information required for the color correction by the image signal processor (ISP). In this paper, we propose to jointly utilize both RAW and sRGB data for image demoiréing (RRID), which are readily accessible in modern smartphones and DSLR cameras. We develop Skip-Connection-based Demoiréing Module (SCDM) with Gated Feedback Module (GFM) and Frequency Selection Module (FSM) embedded in skip-connections for the efficient and effective demoiréing of RAW and sRGB features, respectively. Subsequently, we design a RGB Guided ISP (RGISP) to learn a device-dependent ISP, assisting the process of color recovery. Extensive experiments demonstrate that our RRID outperforms state-of-the-art approaches, in terms of the performance in moiré pattern removal and color cast correction by 0.62dB in PSNR and 0.003 in SSIM. Code is available at https://github.com/rebeccaeexu/RRID.", + "bbox": [ + 261, + 316, + 741, + 580 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Image demoiring $\\cdot$ RAW domain $\\cdot$ Image restoration", + "bbox": [ + 261, + 595, + 705, + 609 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 638, + 375, + 654 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "With the increasing prevalence of smartphone cameras, it is common to record on-screen content using smartphone cameras for convenience. However, this type of photography often results in the presence of moiré patterns in the captured images. The appearance of moiré patterns is caused by the spatial frequency aliasing between the camera's color filter array (CFA) and the screen's LCD subpixel [22], resulting in an unsatisfactory visual experience.", + "bbox": [ + 212, + 675, + 787, + 765 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Moiré patterns present challenges to be eliminated due to their different scales, indistinct shapes, diverse colors, and varying frequencies. Nowadays, many learning-based image demoiring approaches [1,5,6,14,15,18,21-23,27,32] have", + "bbox": [ + 212, + 767, + 787, + 813 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding Author.", + "bbox": [ + 217, + 824, + 388, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/1bdd2cbb1bafd946c34711cdeb771bac15311845a8708fdb4fe71cddbb9afb5b.jpg", + "image_caption": [ + "(a) Demoiring in sRGB domain" + ], + "image_footnote": [], + "bbox": [ + 331, + 143, + 671, + 189 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/4e7eb5de7f54709bbbfe958879aa9d0439aa9b96b4047447929544ec2084b2a3.jpg", + "image_caption": [ + "(b) Demoiring in RAW domain" + ], + "image_footnote": [], + "bbox": [ + 331, + 210, + 669, + 257 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/d30ed99ad346d9e0005377dfb49d349be8e0a6c830746dbf5768d10d30fa04ef.jpg", + "image_caption": [ + "(c) Demoiring in RAW and sRGB domains", + "Fig. 1: Comparison of image demoiréing in different domains. (a) Image demoiréing in sRGB domain. (b) Image demoiréing in RAW domain. (c) Our proposed RRID, which performs image demoiréing in both RAW domain and sRGB domain" + ], + "image_footnote": [], + "bbox": [ + 331, + 279, + 669, + 371 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "been proposed. Among the various methods employed, a commonly used approach is utilizing a multi-scale architecture to remove various sizes of moiré patterns [1,5,18,21,27]. Besides, some works advocate the leverage of frequency components and delicately design frequency-based demoiring networks [6,14,22,32].", + "bbox": [ + 212, + 473, + 784, + 535 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The aforementioned methods are developed to demoiré in the sRGB domain, as depicted in Fig. 1(a). While this scheme seems to be the most direct approach, its effectiveness is limited in removing moiré patterns from complex scenes. The reason for this limitation probably lies in the fact that the nonlinear operations in ISP such as demosaicing deteriorate the moiré patterns originally in the RAW domain. Many schemes consequently suggest that eliminating moiré patterns in the RAW domain is more effective than performing demoiréing in the sRGB domain [28,29]. Due to the easy accessibility of RAW data in modern smartphones and DSLR cameras, image demoiréing in RAW domain can be both feasible and advantageous. RDNet [29] is the pioneering study that investigates image demoiréing in the RAW domain. They explore the demoiréing of RAW images using an encoder-decoder and class-specific learning approach, followed by the utilization of a pre-trained ISP for the RAW-to-sRGB conversion, as depicted in Fig. 1(b). Nevertheless, relying exclusively on RAW data can lead to color cast due to the uncertainty during RAW-to-sRGB conversion.", + "bbox": [ + 212, + 536, + 787, + 763 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In order to correct the color cast and make the best use of RAW and sRGB information for the moiré pattern removal, we propose to jointly utilize both RAW and sRGB data for image demoiring (RRID), as demonstrated in Fig. 1(c). We advocate that introducing paired RAW-sRGB data is advantageous to the moiré pattern removal due to the following reasons: (1) RAW pixels provide more in-", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "formation compared to sRGB pixels since they are typically 12 or 14 bits. (2) Moiré patterns in the RAW domain are less apparent because they are not further affected by nonlinear operations in the ISP. (3) The paired RAW and sRGB data allows the model to learn a device-dependent ISP to aid the process of color recovery. In RRID, we adopt a multi-scale architecture in the Skip-Connection-based Demoiréing Module (SCDM), to effectively eliminate moiré patterns of different sizes. In order to effectively perform demoiréing on RAW and sRGB features, the Gated Feedback Module (GFM) and Frequency Selective Module (FSM) are integrated into skip-connections within SCDM, as opposed to brutally injecting them into the multi-scale layers. Specifically, for RAW features demoiréing, we introduce the GFM into the skip connection, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Moreover, we design the FSM for the moiré sRGB features, leveraging a learnable band stop filter to mitigate moiré patterns in the frequency domain. Subsequent to the pre-demoiréing operations, we develop the RGB Guided Image Signal Processor (RGISP) to integrate color information from the demoiréd sRGB features with the demoiréd RAW features and learn a device-dependent ISP, facilitating the color recovery process. Ultimately, for the image reconstruction, we utilize multiple Residual Swin Transformer Blocks (RSTBs) [12] and convolutions to accomplish global tone mapping and detail refinement.", + "bbox": [ + 212, + 146, + 787, + 448 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, our contributions are listed as follows:", + "bbox": [ + 238, + 450, + 609, + 463 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose to exploit image demoiréing in both RAW and sRGB domains. The incorporation of RAW data enhances the moiré pattern removal process, while the inclusion of sRGB data facilitates the RAW-to-sRGB conversion and aids in color restoration of images.", + "- We develop SCDM with specifically designed modules, GFM and FSM, embedded in the skip-connections to perform efficient and effective demoiréing on the RAW and sRGB features.", + "- RGISP is designed for the RAW-to-sRGB conversion, incorporating color information from the demoiréd sRGB features with demoiréd RAW features and learn a device-dependent ISP, aiding the color deviation correction.", + "- Our RRID surpasses state-of-the-arts methods in both qualitative and quantitative evaluations." + ], + "bbox": [ + 227, + 476, + 782, + 656 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 686, + 395, + 700 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Image and Video Demoiring", + "text_level": 1, + "bbox": [ + 215, + 720, + 503, + 736 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The purpose of image demoiréing is to restore the original clean image by removing moiré patterns and correcting color deviations from an contaminated image. Many learning-based image demoiréing [1, 6, 15, 18, 22, 23, 32] and video demoiréing methods [2, 19, 26, 28] have been introduced to mitigate the moiré patterns. DMCNN [21] constructs the first real-world dataset for image demoiréing and proposes a multi-resolution neural network to handle moiré patterns across", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "various scales. MopNet [5] devises a multi-scale aggregated network that leverages the edge guidance and pattern attributes for moiré pattern removal. WDNet [14] employs wavelet transformation to decompose images with moiré patterns into separate frequency bands and establishes a dual-branch network to restore both close-range and far-range information. FHDMi [6] formulates a two-stage approach for simultaneous removal of substantial moiré patterns while preserving image details. ESDNet [27] explores a lightweight model aimed at ultra-high-definition image demoiréing. VDMoiré [2] collects the first video demoiréing dataset and presents a baseline video demoiréing model with a relation-based temporal consistency loss. The aforementioned methods all operate in the sRGB domain. Since it has been observed that moiré patterns are less prominent in the RAW domain, some schemes advocate performing image or video demoiréing in the RAW domain. RDNet [29] introduces the first image demoiréing dataset with RAW data and conducts the demoiréing process in the RAW domain. RawVDemoiré [28] proposes a temporal alignment method for RAW video demoiréing. To remove moiré patterns in the RAW domain, the model have to simultaneously possess the capabilities of demoiréing and and RAW-to-sRGB conversion. However, previous methods encounter challenges in color recovery due to the uncertainty of RAW-to-sRGB conversion. Consequently, we propose an image demoiréing network that utilizes paired RAW-sRGB data, facilitating the color recovery process in image demoiréing.", + "bbox": [ + 212, + 146, + 787, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Learning-Based RAW Image Processing", + "text_level": 1, + "bbox": [ + 215, + 513, + 591, + 530 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "RAW pixels offer the potential for leveraging additional information due to their broader bit depth, inherently containing a great wealth of data. Early research in RAW image processing primarily centers on integrating demosaicing and denoising techniques [4,9,10,13]. RTF [9] devices a machine learning approach to the demosaicing and denoising on RAW inputs. SGNet [13] introduces a self-guidance network that leverages the inherent density-map guidance and green-channel guidance for demosaicing and denoising on the RAW images. Recently, some low-level vision tasks endorse the utilization of RAW data, including low-light enhancement [3,7,8], super-resolution [16,25,30], and reflection removal [11,20]. The majority of the aforementioned RAW image processing methods only take RAW images as input and generate restored sRGB images as output, indicating that the entire model is responsible for both the restoration and ISP tasks. CR3Net [20] presents a cascaded network that harnesses both the RGB data and their corresponding RAW versions for image reflection removal. Within CR3Net, a module is formulated to emulate point-wise mappings within the ISP, converting the features from RAW to sRGB domain. To further mitigate the color casting problem, our proposed method jointly utilize RAW and sRGB data to learn a device-dependent ISP for image demoiring.", + "bbox": [ + 212, + 568, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 143, + 379, + 162 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Originally caused by frequency interference between the camera's CFA and the screen's LCD subpixel, moiré patterns are further deteriorated by the nonlinear processes in ISP. Therefore, introducing RAW data for image demoiréing may offer greater effectiveness. However, relying solely on RAW data for image demoiréing is insufficient in mitigating color cast due to the uncertainty during the RAW-to-sRGB conversion. Consequently, in this work, we propose to utilize paired RAW and sRGB data, which are readily accessible in modern smartphones and DSLR cameras (e.g., iPhone 15 Pro, HUWEI P60 Pro). The RAW-sRGB pairs essentially allows the model to learn a device-dependent ISP, aiding the color recovery process. The potential applications in real-world scenarios can be described as follows. When demoiréing function is enabled, the in-device ISP generated sRGB image will not be directly outputted. Instead, together with its corresponding RAW version, will be processed by our RRID to generate a new sRGB image with much suppressed moiré patterns. Afterwards, the RAW image could be discarded, depending on settings of the camera.", + "bbox": [ + 212, + 172, + 787, + 398 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/aac8f55afcfe14002d46908c5cdf05538bc96e3f19ced714ab22688cb7d957b6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 218, + 422, + 723, + 580 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/56ae37aa0ed8b9eba9c358b87341904c203cadad1ad1e7207762d1728ae4b653.jpg", + "image_caption": [ + "(b) DCAB" + ], + "image_footnote": [], + "bbox": [ + 217, + 583, + 411, + 638 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/c47eeda6a167cfe53734375ebfad09b19ee0fb5b12a0defb8a7d3a65cd7ace5c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 413, + 583, + 622, + 638 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/a1fca03d21e0ee6231d9bb893f83ee28054302f442086c0962a2c6704260fc11.jpg", + "image_caption": [ + "(d) FSM" + ], + "image_footnote": [], + "bbox": [ + 624, + 583, + 784, + 638 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/7c1f3f574df3bcd2d8fa73190a74cc1e2abf4b1adbc2b73fef123ab6f2446332.jpg", + "image_caption": [ + "(c) GFM", + "Fig. 2: The overview and detailed structures of our proposed RRID." + ], + "image_footnote": [], + "bbox": [ + 251, + 657, + 720, + 738 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "More specifically, Fig. 2 presents an overview of our proposed RRID for image demoiring with the paired RAW and sRGB data. As for the RGB branch, the input is an sRGB image $\\mathbf{I}_{rgb} \\in \\mathbb{R}^{H \\times W \\times 3}$ , where $H \\times W$ represents the spatial", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "resolution. Given an input RAW image, it is first packed into the 4-channel RGGB format $\\mathbf{I}_{raw} \\in \\mathbb{R}^{\\frac{H}{2} \\times \\frac{W}{2} \\times 4}$ , which serves as the input for the RAW branch. RRID is designed to generate the final output sRGB image $(\\hat{\\mathbf{Y}}_{rgb})$ .", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Concretely, shallow features $\\mathbf{F}_{raw}$ and $\\mathbf{F}_{rgb}$ are respectively extracted from the input data $\\mathbf{I}_{raw}$ and $\\mathbf{I}_{rgb}$ using a convolutional layer and the Dilated Channel Attention Block (DCAB). It is worth noting that a down-sampling layer is applied to the sRGB data to ensure the uniformity of feature shapes. Then, we apply SCDM to acquire pre-demoiréd features $\\mathbf{D}_{raw}$ and $\\mathbf{D}_{rgb}$ in RAW branch and RGB branch, respectively. GFM is introduced in the skip-connection of SCDM for RAW features, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Similarly, FSM is utilized to mitigate moiré patterns in the frequency domain. More details will be given in Sec. 3.1. Subsequently, RGISP is designed to realize a RAW-to-sRGB conversion, generating $\\mathbf{D}_{out}$ . RGISP incorporates color information from coarsely demoiréd sRGB features $\\mathbf{D}_{rgb}$ in a cross-attention mechanism, which will be introduced in Sec. 3.2. For the final image reconstruction, 4 RSTBs [12] are utilized to generate sRGB output $\\hat{\\mathbf{Y}}_{rgb}$ for their advantages in building long-range dependencies for global tone mapping and detail refinement.", + "bbox": [ + 212, + 191, + 787, + 419 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Design of SCDM", + "text_level": 1, + "bbox": [ + 214, + 438, + 401, + 454 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We propose SCDM, a multi-scale architecture designed to remove moiré patterns from shallow RAW features $F_{raw}$ and shallow sRGB features $F_{rgb}$ , as shown in Fig. 2(a). Unlike the vanilla U-Net, SCDM is constructed upon DCAB, facilitating the encoding and decoding of informative features within the respective layers. The features are downsampled twice in the spatial dimension during the encoding process and then upsampled to the original resolution of the input features during decoding. To emphasize the contextual information, we enhance the learned features from the corresponding layers of the encoder with additional modules at skip connections, that is GFM for RAW and FSM for sRGB. The introduction of GFM and FSM in skip-connections is also intended to enhance model efficiency. Then, we can obtain the pre-demoiréd features $\\mathbf{D}_{raw}$ and $\\mathbf{D}_{rgb}$ .", + "bbox": [ + 212, + 462, + 787, + 628 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "DCAB. DCAB is the essential building block of encoder-decoders for performing RAW demoiréing and the RGB demoiréing, as shown in Fig. 2(b). DCAB is designed using a series of dilated convolution layers followed by ReLU activation and the channel attention mechanism. The receptive field at each block is expanded with the dilated convolution kernels, facilitating the demoiréing operations. Furthermore, by incorporating the channel attention mechanism, DCAB adaptively rescales features according to interdependencies among channels. Also, shortcuts are introduced to establish connections between the input and output of DCAB, enabling the block to learn the residual features.", + "bbox": [ + 212, + 628, + 787, + 763 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "GFM. Embedded in the skip-connection of SCDM for RAW features, GFM is introduced to enable adaptive differentiation between the texture and moiré patterns through feature gating. The detailed structure of the GFM is shown in Fig. 2(c). For efficiency, we employ point-wise and depth-wise convolutions to aggregate channel and local content information, respectively. Then, the features", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "are chunked along the channel dimension to generate $\\mathbf{F}_{gate}$ and $\\mathbf{F}_{content}$ . A pointwise multiplication is applied on $\\mathbf{F}_{content}$ and $\\mathbf{F}_{gate}$ after a GELU activation. During feature gating, we expect that the original image content is adaptively selected and merged along both spatial and channel dimensions. The operations can be formulated as:", + "bbox": [ + 212, + 146, + 782, + 220 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\left\\{\\mathbf {F} _ {\\text {g a t e}}, \\mathbf {F} _ {\\text {c o n t e n t}} \\right\\} = \\operatorname {D C o n v} \\left(\\operatorname {P C o n v} \\left(\\mathbf {F} _ {\\text {G F M} _ {\\text {i n}}}\\right)\\right), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 334, + 234, + 784, + 251 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {F} _ {G F M \\_ o u t} = \\operatorname {P C o n v} \\left(\\mathbf {F} _ {\\text {c o n t e n t}} \\odot \\operatorname {G E L U} \\left(\\mathbf {F} _ {\\text {g a t e}}\\right) + \\mathbf {F} _ {G F M \\_ i n}\\right), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 285, + 253, + 784, + 271 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where DConv and PConv represent depth-wise convolution and point-wise convolution, respectively. Here, $\\odot$ denotes the element-wise multiplication.", + "bbox": [ + 212, + 281, + 782, + 311 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "FSM. For sRGB demoiring, we leverage a learnable band stop filter [32] to mitigate moiré patterns in the frequency domain. Considering the formation of moiré patterns is caused by the spatial frequency aliasing between the camera CFA and screen's LCD subpixel, demoiring in the frequency domain becomes a favorable approach. However, the frequency spectrum of the moiré pattern is often mixed with that of the original contents, thereby making it challenging to disentanglement. Therefore, we propose to perform the disentanglement within small patches, where the moiré patterns tend to be more pronounced in a specific range of frequency bands, facilitating the removal of moiré patterns. Inspired by Zheng et al. [32], we utilize a band stop filter to amplify certain frequencies and suppress others using Block DCT. However, obtaining the frequency prior to separate moiré patterns from normal image textures is challenging and time-consuming. To address this issue, a set of convolution layers are employed as the learnable band stop filter $\\mathrm{B}(\\cdot)$ to attenuate the specific frequencies of moiré patterns while preserving the original image contents. The process of the FSM can be represented as:", + "bbox": [ + 212, + 311, + 784, + 551 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {F} _ {F S M \\_ o u t} = \\operatorname {I D C T} (\\mathrm {B} (\\mathrm {D C T} (\\mathbf {F} _ {F S M \\_ i n}))), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 566, + 784, + 583 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where DCT and IDCT denote the process of Block DCT and the corresponding inverse process. The block size is set to $8 \\times 8$ for DCT and IDCT.", + "bbox": [ + 212, + 594, + 782, + 625 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 Design of RGISP", + "text_level": 1, + "bbox": [ + 214, + 647, + 403, + 662 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "RGISP is proposed to transform pre-demoiréd RAW features $\\mathbf{D}_{raw}$ into sRGB domain $\\mathbf{D}_{out}$ . With the assistance of pre-demoiréd sRGB features $\\mathbf{D}_{rgb}$ , a device-dependent ISP can be learned in RGISP. Matrix transformation is commonly employed in the traditional ISP pipelines [17]. It enables the enhancement or conversion of image colors to another color space through a channel-wise matrix transformation, which is facilitated by globally shared settings such as environmental illumination and color space specifications [8]. Building upon this principle, we introduce matrix transformation as a means to perform color transformation, as illustrated in Fig. 3. The design of this matrix transformation is motivated by recent advancements in transposed cross-attention. Given $\\mathbf{D}_{raw} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}$ , the vectors of query $\\mathbf{Q} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}$ , key $\\mathbf{K} \\in \\mathbb{R}^{\\frac{H}{2} \\times \\frac{W}{2} \\times C}$ are generated through the", + "bbox": [ + 212, + 672, + 784, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/3d2cf042e8650cd046db960c1bcae92e63aba50e61bd70c1320d5b3ae43ec053.jpg", + "image_caption": [ + "Fig. 3: The structure of RGISP." + ], + "image_footnote": [], + "bbox": [ + 276, + 143, + 728, + 301 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "projection with a $1 \\times 1$ convolutional layer Conv and a flatten operation Flatten, where $C$ is the intermediate channel number. Similarly, value $\\mathbf{V} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}$ can be produced by operations on $\\mathbf{D}_{rgb} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}$ as:", + "bbox": [ + 212, + 353, + 782, + 398 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\left\\{\\mathbf {Q}, \\mathbf {K} \\right\\} = \\operatorname {F l a t t e r n} \\left(\\operatorname {C o n v} \\left(\\mathbf {D} _ {\\text {r a w}}\\right)\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 379, + 405, + 785, + 422 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {V} = \\operatorname {F l a t t e n} \\left(\\operatorname {C o n v} \\left(\\mathbf {D} _ {r g b}\\right)\\right). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 403, + 424, + 785, + 441 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Then, the transformation matrix $\\mathbf{M} \\in \\mathbb{R}^{C \\times C}$ is obtained by matrix multiplication. The procedure can be formulated as:", + "bbox": [ + 212, + 448, + 782, + 478 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {M} = \\operatorname {S o f t m a x} \\left(\\mathbf {Q} \\cdot \\mathbf {K} ^ {T} / \\lambda\\right), \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 405, + 484, + 785, + 502 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where a scaling coefficient $\\lambda$ is applied for numerical stability. Subsequently, the vector $\\mathbf{V}$ is transformed by the matrix $\\mathbf{M}$ , performing color space conversion in feature-level. The output feature after color transformation can be obtained by $\\mathbf{D}_{out} = \\mathbf{M} \\cdot \\mathbf{V}$ . As a complement to the global matrix transformation, we use a depth-wise convolution and a point-wise convolution to refine the local details, generating the output in sRGB domain $\\mathbf{D}_{out}$ .", + "bbox": [ + 212, + 508, + 782, + 599 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Loss Function", + "text_level": 1, + "bbox": [ + 214, + 618, + 375, + 631 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To effectively remove the moiré patterns and adjust the color deviations, we introduce supervision in both RAW and sRGB domains. The overall training objective can be expressed as:", + "bbox": [ + 212, + 638, + 782, + 683 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\alpha \\| \\hat {\\mathbf {Y}} _ {r a w} - \\mathbf {Y} _ {r a w} \\| _ {1} + \\| \\hat {\\mathbf {Y}} _ {r g b} - \\mathbf {Y} _ {r g b} \\| _ {1}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 689, + 785, + 705 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathbf{Y}_{raw}$ and $\\mathbf{Y}_{rgb}$ are the ground-truth RAW and sRGB images, respectively. We empirically set $\\alpha = 0.5$ .", + "bbox": [ + 212, + 710, + 782, + 741 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 761, + 375, + 777 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 214, + 787, + 426, + 804 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Dataset. The experiments are conducted on the RAW image demoiréing dataset published in TMM22 [29], which contains recaptured scenes of natural images,", + "bbox": [ + 212, + 809, + 782, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "documents, and webpages. In TMM22, the dataset consists of 540 RAW and sRGB image pairs with ground-truth for training, and 408 pairs for testing. To facilitate the training and comparison process, patches of size $256 \\times 256$ and $512 \\times 512$ are cropped respectively for the training and testing sets. The moiré images are captured using four different smartphone cameras and three display screens of varying sizes. In addition, we utilize an image demoiring dataset FHIMi [6] to verify the generalization ability of our method. FHDMi contains 9981 sRGB image pairs for training and 2019 for testing, featuring diverse and intricate moiré patterns. Notably, images in FHDMi have a higher resolution of $1920 \\times 1080$ , compared to TMM22.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Training Details. We train RRID using the AdamW optimizer with $\\beta_{1} = 0.9$ and $\\beta_{2} = 0.999$ . A multistep learning rate schedule is employed, with the learning rate initialized at $2 \\times 10^{-4}$ . The RRID model is trained for 500 epochs using a batch size of 80 on 4 NVIDIA RTX 3090 GPUs.", + "bbox": [ + 212, + 297, + 787, + 357 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Quantitative Results", + "text_level": 1, + "bbox": [ + 214, + 378, + 431, + 393 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We compare our approach with several image demoiréing methods in sRGB domain, including DMCNN [21], WDNet [14], ESDNet [27], and a RAW image demoiréing method RDNet [29]. We further add comparison with a low-light enhancement method DNF [8] with RAW input, a video demoiréing method RawVDmoiré [28] with RAW input, and a de-reflection method CR3Net [20] with paired RAW-sRGB data. To evaluate the performance of our proposed RRID, we adopt the following three standard metrics to assess pixel-wise accuracy and the perceptual quality: PSNR, SSIM [24], and LPIPS [31]. Additionally, the number of parameters, FLOPs, and inference time are introduced to measure the model complexity. To ensure a fair comparison, we modify the inputs of the sRGB-based models to align with the dataset requirements. Subsequently, all models are fine-tuned using the default settings as provided in their papers on TMM22 dataset. We select the better results from the pretrained and retrained models for comparison, which provides an advantage over the competing methods.", + "bbox": [ + 212, + 402, + 787, + 613 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Table. 1 presents the quantitative and the computational complexity comparisons. RRID outperforms the second-best method, RawVDmoiré, by 0.62dB in PSNR and 0.003 in SSIM. As for LPIPS, our methods accomplish the second-best result at 0.079, surpassing most of the comparison methods. Even though RRID utilizes both RAW and sRGB data as inputs, our approach can still achieve a satisfactory demoiréing effect with a inference time of merely 0.089s. Compared to previous methods, our RRID demonstrates superiority with acceptable parameters and FLOPs, further demonstrating the superiority of our approach.", + "bbox": [ + 212, + 614, + 787, + 734 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To verify the generalization performance of our method, we conduct additional experiments on an image demoiréing dataset FHIMi [6]. In order to adapt to the FHDMi dataset with sRGB data as input, the RAW branch and RGISP are removed. We select methods tailored for image demoiréing: DMCNN [21], MopNet [5], MBCNN [32], FHDe²Net [6], and ESDNet [27] for comparison, as shown in Table 2. Although RRID is initially designed for demoiréing on the RAW-sRGB image pairs, it still achieves the second-best performance by 24.39dB in", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/0381eb386d60efd43779543386a5dd18448628e2289a076712ec193d343d6d20.jpg", + "table_caption": [ + "Table 1: Quantitative comparison with the state-of-the-art demoiring approaches and RAW image restoration methods on TMM22 dataset [29] in terms of average PSNR, SSIM, LPIPS and computational complexity. The best results are highlighted with bold. The second-best results are highlighted with underline." + ], + "table_footnote": [], + "table_body": "
IndexMethods
DMCNN [21]WDNet [14]ESDNet [27]RDNet [29]DNF [8]RawVDmoiré [28]CR3Net [20]RRID (Ours)
# Input typesRGBsRGBsRGBRAWRAWRAWsRGB+RAWsRGB+RAW
PSNR↑23.5422.3326.7726.1623.5527.2623.7527.88
SSIM↑0.8850.8020.9270.9210.8950.9350.9220.938
LPIPS↓0.1540.1660.0890.0910.1620.0750.1020.079
Params (M)1.553.365.936.041.255.332.682.38
TFLOPs0.1020.0550.1410.1610.0130.0220.8830.093
Inference time (s)0.0520.2840.1151.0940.0700.1820.0580.089
", + "bbox": [ + 220, + 212, + 782, + 358 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/a0f26011cc59a86af471370a7571a18dbada49eab7070c486de3db0a7b6c7fb8.jpg", + "table_caption": [ + "Table 2: Quantitative comparison on FHDMi dataset [6]." + ], + "table_footnote": [], + "table_body": "
MethodPSNR↑SSIM↑
DMCNN [21]21.540.773
MopNet [5]22.760.796
MBCNN [32]22.310.810
FHDe2Net [6]22.930.789
ESDNet [27]24.500.835
Ours24.390.830
", + "bbox": [ + 416, + 398, + 589, + 494 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "PSNR and 0.830 in SSIM. Compared to ESDNet, an image demoiréing network designed for ultra-high-definition sRGB images with more than twice of the parameters, RRID also yields competitive results. The qualitative results on the FHDMi dataset demonstrate that our method can not only perform well in demoiréing on RAW-sRGB pairs but also solve sRGB image demoiréing, exhibiting a certain degree of generalization.", + "bbox": [ + 212, + 523, + 787, + 616 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.3 Qualitative Results", + "text_level": 1, + "bbox": [ + 215, + 643, + 419, + 657 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We present visual comparisons among our approach and the existing methods in Fig. 4. The results demonstrate the advantage of RRID in effectively removing moiré artifacts and correcting color deviations. For the first scene demonstrating a recaptured flower with moiré patterns, previous methods tend to exhibit residual moiré patterns in their restored images. While ESDNet successfully eliminates a significant portion of these patterns, it struggles to accurately restore the original colors of the image. Apart from natural scenes, we also present a case of webpages contaminated with moiré patterns. Through the utilization of both RAW and sRGB data, our approach eliminates moiré patterns while preserving fine image details, even in scenarios characterized by severe color deviations. This ensures a more accurate restoration of the original colors and results in", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "enhanced visual effects. Additional qualitative comparisons can be found in the supplementary file.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/9c9f336e2cef45564864c7b6db5cf7f7204f70d22aaa8079a8d5b6376f53b980.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 212, + 199, + 330, + 289 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/2e149b2198fcb9ee97d20bb5a1c0ef9bf610e6475b0616e1c6080ba7cbdb3709.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 330, + 202, + 442, + 289 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/e54e2dc1e187fd4e1f264b4d87dbb326c8627f080135aee8fec8f4c03eb4d698.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 442, + 202, + 553, + 289 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/3d4ed83046226f916ede0ea01535a374d6cac7899d2c6b72c0be98dce8e69856.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 558, + 202, + 669, + 289 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/42bb3e45068fb0ed4bb94feeef0c011f720824dbdd5f2acdf4cb6419b21665fd.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 671, + 202, + 784, + 289 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/5e6d00095ab0665a1c51a8c09b5109764043d79042dfc69c13a9140e01be3f3f.jpg", + "image_caption": [ + "(a) Input", + "(f) DNF" + ], + "image_footnote": [], + "bbox": [ + 215, + 299, + 328, + 385 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/4aa5c2adcf3de1a30b3d4d84e5338c7894be9bf656fa82ba3564a1e3c370065f.jpg", + "image_caption": [ + "(b) DMCNN", + "(g) RawVDmoire" + ], + "image_footnote": [], + "bbox": [ + 331, + 299, + 442, + 385 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/4fbbd5d9e3f596aa2122f5a95d88355aec9b3b2ea931a45fb0f79580d04c77d6.jpg", + "image_caption": [ + "(c)WDNet", + "(h) CR3Net" + ], + "image_footnote": [], + "bbox": [ + 444, + 299, + 555, + 385 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/14fd6d1959030c19022658774132ef8d0e8e00851d8d72570c5c91894bdec690.jpg", + "image_caption": [ + "(d) ESDNet", + "(i) Ours" + ], + "image_footnote": [], + "bbox": [ + 558, + 299, + 669, + 385 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/91087fc72da76eafee253335349ca0f2942f5d5f98ecec51bc149d39135063b5.jpg", + "image_caption": [ + "(e) RDNet", + "(j) GT" + ], + "image_footnote": [], + "bbox": [ + 671, + 299, + 784, + 385 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/5681569d394b4cba1def26717664345f6430b31656d071b99cf99473c98878cb.jpg", + "image_caption": [ + "(a) Input" + ], + "image_footnote": [], + "bbox": [ + 215, + 396, + 328, + 481 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/f00610528698cfdf2e0f58b3968445c752fbfc8d40564b5daae45524ab7e8efe.jpg", + "image_caption": [ + "(b)DMCNN" + ], + "image_footnote": [], + "bbox": [ + 331, + 396, + 442, + 481 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/102c68559fb0281c28b5990aa8c395c462ac0f859af1e1606f48c298fabb07d0.jpg", + "image_caption": [ + "(c)WDNet" + ], + "image_footnote": [], + "bbox": [ + 444, + 396, + 555, + 481 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/ac9c2b0a114d300bc1fc235bd1177f9634617556b7cda6c245a2685f65459d33.jpg", + "image_caption": [ + "(d) ESDNet" + ], + "image_footnote": [], + "bbox": [ + 558, + 396, + 669, + 481 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/432707277670fd54e7d9bf46d7594235a9a9f1834e24ba2479b4c0b6e95e3d05.jpg", + "image_caption": [ + "(e) RDNet" + ], + "image_footnote": [], + "bbox": [ + 671, + 396, + 784, + 481 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/095367a97b1b4018bc61fbec4ca39202c3f62c900a6af4b3bdd3535be7df3699.jpg", + "image_caption": [ + "(f) DNF", + "Fig. 4: Qualitative comparison on RAW image demoiring TMM22 dataset [29]." + ], + "image_footnote": [], + "bbox": [ + 215, + 492, + 328, + 575 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/0e96bf74c566584724d164d2d12667d7305105f2076d2cf92ed30c85ffac19f4.jpg", + "image_caption": [ + "(g) RawVDmoire" + ], + "image_footnote": [], + "bbox": [ + 331, + 492, + 442, + 575 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/eaf5ae097eca6311e1fabd7d6fd131a36d11995963f01d8ca6eff63aed951448.jpg", + "image_caption": [ + "(h) CR3Net" + ], + "image_footnote": [], + "bbox": [ + 444, + 492, + 555, + 575 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/d87fe77121dc9257eb73ede4c9cc7ba9708805bd4a50d15809fe2a1d45f67923.jpg", + "image_caption": [ + "(i) Ours" + ], + "image_footnote": [], + "bbox": [ + 558, + 492, + 669, + 575 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/da4f230766a9f99a60f77010ccd8522d89359081e7484e957f15d2ba42ab4b74.jpg", + "image_caption": [ + "(j) GT" + ], + "image_footnote": [], + "bbox": [ + 671, + 492, + 784, + 575 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.4 Ablation Study", + "text_level": 1, + "bbox": [ + 214, + 667, + 388, + 683 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "1) Ablation study on the model architecture and inputs. In Table 3, we investigate the architecture and inputs of RRID and validate the importance of different individual components in the whole RRID. We conduct this ablation study by comparing the proposed RRID and the following variants of RRID:", + "bbox": [ + 212, + 691, + 785, + 753 + ], + "page_idx": 10 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- $B_{1}$ . Both the RAW input and the RAW demoiréing branch are removed. Due to the lack of RAW features, the entire RGISP is also deleted.", + "- $B_{2}$ . Both the sRGB input and sRGB demoiring branch are removed.", + "- $B_{3}$ . The sRGB input is substituted with RAW input. The input channel number is adjusted, while the rest of the architecture is kept unchanged." + ], + "bbox": [ + 225, + 763, + 784, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- $B_{4}$ . We replace RGISP with a two convolutional layers after a concatenation of the RAW and sRGB features.", + "- $B_{5}$ . Reconstruction module is replaced with two convolutional layers.", + "- $B_{6}$ . The full model of RRID with both RAW and sRGB images as input." + ], + "bbox": [ + 225, + 146, + 782, + 205 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/ee9440335e5d7b11ba61167102fcc3d9e4c419ef86ab1e14077a18d34caa2b73.jpg", + "table_caption": [ + "Table 3: Comparison of baseline models for the evaluation of architecture and inputs." + ], + "table_footnote": [], + "table_body": "
ModelsPSNR↑SSIM↑
B1 (w/o RAW in and RAW branch)25.790.915
B2 (w/o sRGB in and sRGB branch)27.240.929
B3 (w/o sRGB in)26.510.923
B4 (w/o RGISP)27.380.932
B5 (w/o Reconstruction)26.930.926
B6 (full version)27.880.938
", + "bbox": [ + 354, + 267, + 651, + 363 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Our proposed RRID leverages paired RAW-sRGB data as input. Removing the RAW input and its corresponding RAW demoiréing module $(B_{1})$ results in a drastic decrease in PSNR of approximately 2dB. Likewise, eliminating the sRGB input and its corresponding RGB demoiréing module $(B_{2})$ leads to a PSNR of only 27.24dB. In addition to the decline in numerical metrics, we can also assess", + "bbox": [ + 212, + 390, + 787, + 465 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/efaa1f65297db777e4ea4f6908cf3b9e3aed0ea3db355f3132d2b085a7ce4f88.jpg", + "image_caption": [ + "(a) Input" + ], + "image_footnote": [], + "bbox": [ + 272, + 489, + 385, + 578 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/d8c8f94c4eb0e762e4d8790f08e78f3a51340d823bddebb26835d8051d9c805a.jpg", + "image_caption": [ + "(b) $B_{j}$" + ], + "image_footnote": [], + "bbox": [ + 387, + 491, + 500, + 578 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/1fda4f9cfa609639689a85b44af3524b3a4c51baf1b04905da030017b93e3c1e.jpg", + "image_caption": [ + "(c) $B_{2}$" + ], + "image_footnote": [], + "bbox": [ + 501, + 491, + 614, + 578 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/d3d356c7d8f71ee2d870f257afa57fcf7cbe818f2201e17b6378a0f5f4c5d6b3.jpg", + "image_caption": [ + "(d) $B_{3}$" + ], + "image_footnote": [], + "bbox": [ + 616, + 491, + 728, + 578 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/157d6a807becad0adce8c50ecfdc8d0016aebcfa8d3ce90c3c4da27e43873f74.jpg", + "image_caption": [ + "(e) $B_{4}$" + ], + "image_footnote": [], + "bbox": [ + 272, + 592, + 385, + 678 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/7c2d18f0c745eadb1e33d99ac5cdc454713c3524ca921b43428b5023c0bc6727.jpg", + "image_caption": [ + "(f) $B_{5}$" + ], + "image_footnote": [], + "bbox": [ + 387, + 592, + 500, + 678 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/d7b87538de6e3f5af6d1ca388041a24aefe248eade1d9e49b3a534f87ac6c6f3.jpg", + "image_caption": [ + "(g) $B_{6}$ (Ours)", + "Fig. 5: Visualization of the ablation study for architecture and inputs comparison." + ], + "image_footnote": [], + "bbox": [ + 501, + 592, + 614, + 678 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/4491d383ba8ad575699206e9adeb980d67f9e0bc59ded3f586c569483e60f428.jpg", + "image_caption": [ + "(h) GT" + ], + "image_footnote": [], + "bbox": [ + 616, + 592, + 728, + 678 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "the visual performance from Fig. 5. When relying only on sRGB data and its corresponding demoiréing modules, moiré patterns are less effectively removed, as depicted in Fig.5(b). Conversely, Fig.5(c) demonstrates that using only RAW data as input generates images with more pronounced color deviations. To further validate the significance of RAW input for image demoiréing, we compare $B_{3}$ to $B_{1}$ by solely removing the RAW input data while retaining the remaining", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "model structures. Although $B_{3}$ demonstrates some improvements in numerical metrics compared to $B_{1}$ , its performance remains unsatisfactory due to the lack of information provided by the RAW input and the fact that the original RAW demoiring module is specifically designed for RAW data. Additionally, we conducted further comparisons by removing the originally designed RGISP $(B_{4})$ and Reconstruction modules $(B_{5})$ , resulting in inferior numerical metrics and performance in Fig. 5 compared to the complete RRID model $(B_{6})$ .", + "bbox": [ + 212, + 146, + 782, + 252 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "2) Ablation study on SCDM. SCDM is designed to perform effective demoiréing on both RAW and sRGB features. More specifically, we introduce GFM for RAW features demoiréing and FSM for sRGB features demoiréing.", + "bbox": [ + 212, + 252, + 802, + 299 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/99dc2a3c427f6d9f300422e59f2a345dd3303425a225f083d2b93c46607fa6f2.jpg", + "table_caption": [ + "Table 4: Ablation study on SCDM." + ], + "table_footnote": [], + "table_body": "
ModelsPSNR↑SSIM↑
S1 (w/o GFM & FSM)27.000.926
S2 (w/o GFM)27.170.927
S3 (w/o FSM)27.390.930
S4 (all GSM)27.500.933
S5 (all FSM)27.320.930
S6 (w/o DCAB)26.550.923
S7 (SCDM)27.880.938
", + "bbox": [ + 397, + 352, + 609, + 455 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 4 demonstrates the effectiveness and indispensability of the meticulously designed GFM and FSM integrated within the skip-connections. Removing the demoiréing modules on the skip-connections $(S_{1} - S_{3})$ individually result in varying degrees of performance decline of the model. For instance, removing both GFM and FSM leads to only $27.00\\mathrm{dB}$ in PSNR. Furthermore, Fig.6(b) demonstrates that the model's ability to remove moiré patterns decreases upon removing the GFM and FSM modules. Furthermore, to assess the specificity of GFM and FSM, we substitute the original modules in $S_{4}$ and $S_{5}$ , respectively. Despite no reduction in the number of parameters, the PSNR decreases by approximately $0.3 - 0.5\\mathrm{dB}$ . Since DCAB is a crucial component module in SCDM, we substitute DCAB with two convolutional layers to confirm its necessity. Fig. 6(c) showcases more residual moiré patterns and significant color deviation compared to our complete SCDM presented in Fig.6(d).", + "bbox": [ + 212, + 484, + 787, + 681 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/18d3f9da6629fc20ce7f7b7ca98b10c6a0670849870666aaea85eec791e60a84.jpg", + "image_caption": [ + "(a) Input" + ], + "image_footnote": [], + "bbox": [ + 217, + 708, + 328, + 795 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/a3975cb4f28caadfc507099f7ab9ce9d4fea6739cd5844c69ea8fe8072838ecc.jpg", + "image_caption": [ + "(b) $\\mathbf{S}_I$" + ], + "image_footnote": [], + "bbox": [ + 331, + 709, + 442, + 795 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d706a6c4ab0a0d8b29dad4e179bc8959ba36ffa94279a973cb65e670c7750206.jpg", + "image_caption": [ + "(c) $\\mathbf{S}_6$" + ], + "image_footnote": [], + "bbox": [ + 444, + 709, + 555, + 795 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5d3b05be7c5365006610745e614f77592d639798281b808c40274e4026d0158d.jpg", + "image_caption": [ + "(d) $\\mathbf{S}_7$", + "Fig. 6: Visualization of the ablation study for SCDM." + ], + "image_footnote": [], + "bbox": [ + 558, + 709, + 669, + 795 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/97a477c8c55c0532a644d36951765927078ec6102b864e7ef902e76ab43ce2c0.jpg", + "image_caption": [ + "(e) GT" + ], + "image_footnote": [], + "bbox": [ + 673, + 709, + 784, + 795 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/df7d9e7f83cbcf640c1849682c4500dc91fd598f2af3295f7b4d34b704afab75.jpg", + "image_caption": [ + "(a) Input" + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 312, + 218 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/615a7489443f6914a2e63ef93029848b277457c18958147a43b5e8a3b9d0b977.jpg", + "image_caption": [ + "(b) $\\mathbb{R}_I$", + "Fig. 7: Visualization of the ablation study for RGISP." + ], + "image_footnote": [], + "bbox": [ + 313, + 143, + 408, + 218 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/f4979ad29938c053463e90e548b326a98242f05bf0ddf93174f5aa74ee76e194.jpg", + "image_caption": [ + "(c) $\\mathbb{R}_2$" + ], + "image_footnote": [], + "bbox": [ + 410, + 143, + 501, + 218 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/540201f4470d44a96833f758d4166000fc29483a6128c8a4f1923e1b4064bea8.jpg", + "image_caption": [ + "(d) $\\mathbb{R}_3$" + ], + "image_footnote": [], + "bbox": [ + 501, + 143, + 596, + 218 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/c84a593de65bc3b593604d559f989947da9e40bcd3eddb86206fe080875e0287.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 596, + 143, + 787, + 218 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "3) Ablation study on RGISP. RGISP is designed to integrate color information from the coarsely demoiréd sRGB features during the ISP stage, facilitating the color recovery process. The process of the RGISP can be recognized as a cross-attention mechanism. To assess the efficacy of the RGISP design, we compare the following structures in Table 5. For $R_{1}$ , we concatenate the pre-demoiréd RAW features with the sRGB features and subsequently apply a self-attention mechanism. In $R_{2}$ , the pre-demoiréd RAW features undergo a self-attention mechanism and are then concatenated with the pre-demoiréd sRGB features. Table 5 shows that our proposed RGISP surpasses the self-attention mechanisms $(R_{1}, R_{2})$ , as well as other RAW-to-sRGB conversion methods RRM [20] $(R_{3})$ . In addition, Fig. 7 depicts a webpage with globally distributed moiré pat", + "bbox": [ + 212, + 282, + 787, + 450 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/2157807a60700f34fdd0baa1b4c11208c39cf68b4bebac2db5e471ca0d7c8ac6.jpg", + "table_caption": [ + "Table 5: Ablation study on RGISP." + ], + "table_footnote": [], + "table_body": "
ModelsPSNR↑SSIM↑
R1(self-atten([raw,rgb]))27.540.933
R2(self-atten(raw),rgb])27.420.931
R3(RRM)27.210.929
R4(RGISP)27.880.938
", + "bbox": [ + 390, + 503, + 617, + 575 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "terns. $R_{1} - R_{4}$ are all capable of effectively removing the moiré patterns, but $R_{4}$ exhibits the best performance in correcting color deviation. With the introduction of sRGB pre-demoiréd features, RGISP is able to learn a device-dependent ISP and restore the original colors of the image effectively.", + "bbox": [ + 212, + 602, + 787, + 662 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 686, + 359, + 702 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we propose to jointly utilize RAW and sRGB data for image demoiréing (RRID). Firstly, we introduce SCDM with GFM and FSM embedded in skip-connections to handle the demoiréing of RAW and sRGB features, respectively. Additionally, we present RGISP to learn a device-dependent ISP, aiding the color recovery process. Extensive experiments demonstrate the superior performance of our RRID method in both moiré pattern removal and color cast correction. Our approach outperforms state-of-the-art methods by 0.62dB in PSNR and 0.003 in SSIM.", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported in part by Macau Science and Technology Development Fund under SKLIOTSC-2021-2023, 0072/2020/AMJ, 0022/2022/A, and 0014/2022/AFJ; in part by Research Committee at University of Macau under MYRG-GRG2023-00058-FST-UMDF and MYRG2022-00152-FST; in part by Natural Science Foundation of Guangdong Province of China under EF2023-00116-FST.", + "bbox": [ + 212, + 175, + 787, + 265 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 287, + 321, + 303 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Cheng, X., Fu, Z., Yang, J.: Multi-scale dynamic feature encoding network for image demoiring. In: 2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW). pp. 3486-3493. IEEE (2019)", + "2. Dai, P., Yu, X., Ma, L., Zhang, B., Li, J., Li, W., Shen, J., Qi, X.: Video demoireing with relation-based temporal consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17622-17631 (2022)", + "3. Dong, X., Xu, W., Miao, Z., Ma, L., Zhang, C., Yang, J., Jin, Z., Teoh, A.B.J., Shen, J.: Abandoning the bayer-filter to see in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17431-17440 (2022)", + "4. Gharbi, M., Chaurasia, G., Paris, S., Durand, F.: Deep joint demosaicking and denoising. ACM Transactions on Graphics (ToG) 35(6), 1-12 (2016)", + "5. He, B., Wang, C., Shi, B., Duan, L.Y.: Mop moire patterns using mopnet. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2424-2432 (2019)", + "6. He, B., Wang, C., Shi, B., Duan, L.Y.: Fhde 2 net: Full high definition demoireing network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 713-729. Springer (2020)", + "7. Huang, H., Yang, W., Hu, Y., Liu, J., Duan, L.Y.: Towards low light enhancement with raw images. IEEE Transactions on Image Processing 31, 1391-1405 (2022)", + "8. Jin, X., Han, L.H., Li, Z., Guo, C.L., Chai, Z., Li, C.: Dnf: Decouple and feedback network for seeing in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18135-18144 (2023)", + "9. Khashabi, D., Nowozin, S., Jancsary, J., Fitzgibbon, A.W.: Joint demosaicing and denoising via learned nonparametric random fields. IEEE Transactions on Image Processing 23(12), 4968-4981 (2014)", + "0. Kokkinos, F., Lefkimmiatis, S.: Deep image demosaicking using a cascade of convolutional residual denoising networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 303-319 (2018)", + "1. Lei, C., Chen, Q.: Robust reflection removal with reflection-free flash-only cues. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14811-14820 (2021)", + "2. Liang, J., Cao, J., Sun, G., Zhang, K., Van Gool, L., Timofte, R.: Swinir: Image restoration using swin transformer. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1833-1844 (2021)", + "3. Liu, L., Jia, X., Liu, J., Tian, Q.: Joint demosaicing and denoising with self guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2240-2249 (2020)" + ], + "bbox": [ + 225, + 316, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Liu, L., Liu, J., Yuan, S., Slabaugh, G., Leonardis, A., Zhou, W., Tian, Q.: Wavelet-based dual-branch network for image demoiring. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XIII 16. pp. 86–102. Springer (2020)", + "15. Liu, S., Li, C., Nan, N., Zong, Z., Song, R.: Mmdm: Multi-frame and multi-scale for image demoiring. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 434-435 (2020)", + "16. Luo, F., Wu, X., Guo, Y.: And: Adversarial neural degradation for learning blind image super-resolution. Advances in Neural Information Processing Systems 36 (2024)", + "17. Nakamura, J.: Image sensors and signal processing for digital still cameras. CRC press (2017)", + "18. Niu, Y., Lin, Z., Liu, W., Guo, W.: Progressive moiré removal and texture complementation for image demoireing. IEEE Transactions on Circuits and Systems for Video Technology (2023)", + "19. Oh, G., Gu, H., Kim, S., Kim, J.: Fpanel: Frequency-based video demoireing using frame-level post alignment. arXiv preprint arXiv:2301.07330 (2023)", + "20. Song, B., Zhou, J., Chen, X., Zhang, S.: Real-scene reflection removal with rawrgb image pairs. IEEE Transactions on Circuits and Systems for Video Technology (2023)", + "21. Sun, Y., Yu, Y., Wang, W.: Moiré photo restoration using multiresolution convolutional neural networks. IEEE Transactions on Image Processing 27(8), 4160-4172 (2018)", + "22. Wang, C., He, B., Wu, S., Wan, R., Shi, B., Duan, L.Y.: Coarse-to-fine disentangling demoiring framework for recaptured screen images. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)", + "23. Wang, H., Tian, Q., Li, L., Guo, X.: Image demoiring with a dual-domain distilling network. In: 2021 IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2021)", + "24. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)", + "25. Xing, W., Egiazarian, K.: End-to-end learning for joint image demosaicing, denoising and super-resolution. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3507-3516 (2021)", + "26. Xu, S., Song, B., Chen, X., Zhou, J.: Direction-aware video demoireing with temporal-guided bilateral learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 6360-6368 (2024)", + "27. Yu, X., Dai, P., Li, W., Ma, L., Shen, J., Li, J., Qi, X.: Towards efficient and scale-robust ultra-high-definition image demoiring. In: European Conference on Computer Vision. pp. 646-662. Springer (2022)", + "28. Yue, H., Cheng, Y., Liu, X., Yang, J.: Recaptured raw screen image and video demoireing via channel and spatial modulations. arXiv preprint arXiv:2310.20332 (2023)", + "29. Yue, H., Cheng, Y., Mao, Y., Cao, C., Yang, J.: Recaptured screen image demoiring in raw domain. IEEE Transactions on Multimedia (2022)", + "30. Yue, H., Zhang, Z., Yang, J.: Real-rawvsr: Real-world raw video super-resolution with a benchmark dataset. In: European Conference on Computer Vision. pp. 608-624. Springer (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Xu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "31. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)", + "32. Zheng, B., Yuan, S., Slabaugh, G., Leonardis, A.: Image demoiring with learnable bandpass filters. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3636-3645 (2020)" + ], + "bbox": [ + 215, + 146, + 787, + 231 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Image Demoiring in RAW and sRGB Domains", + "bbox": [ + 411, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_model.json b/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_model.json new file mode 100644 index 0000000000000000000000000000000000000000..4526bcd22fc15f6b9e7cede11c7a6e0b88e17d7b --- /dev/null +++ b/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_model.json @@ -0,0 +1,2940 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.228, + 0.142, + 0.776, + 0.163 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.19, + 0.786, + 0.208 + ], + "angle": 0, + "content": "Shuning Xu\\(^{1}\\), Binbin Song\\(^{1}\\), Xiangyu Chen\\(^{1,2}\\), Xina Liu\\(^{1,2}\\), and Jiantao Zhou\\(^{1\\star}\\)" + }, + { + "type": "text", + "bbox": [ + 0.297, + 0.218, + 0.707, + 0.233 + ], + "angle": 0, + "content": "1 State Key Laboratory of Internet of Things for Smart City," + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.233, + 0.74, + 0.246 + ], + "angle": 0, + "content": "Department of Computer and Information Science, University of Macau" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.246, + 0.786, + 0.275 + ], + "angle": 0, + "content": "2 Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences {yc07425, yb97426, jtzhou}@um.edu.mo, chxy95@gmail.com, xn.liu95@siat.ac.cn" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.318, + 0.742, + 0.581 + ], + "angle": 0, + "content": "Abstract. Moiré patterns frequently appear when capturing screens with smartphones or cameras, potentially compromising image quality. Previous studies suggest that moiré pattern elimination in the RAW domain offers greater effectiveness compared to demoiréing in the sRGB domain. Nevertheless, relying solely on RAW data for image demoiréing is insufficient in mitigating the color cast due to the absence of essential information required for the color correction by the image signal processor (ISP). In this paper, we propose to jointly utilize both RAW and sRGB data for image demoiréing (RRID), which are readily accessible in modern smartphones and DSLR cameras. We develop Skip-Connection-based Demoiréing Module (SCDM) with Gated Feedback Module (GFM) and Frequency Selection Module (FSM) embedded in skip-connections for the efficient and effective demoiréing of RAW and sRGB features, respectively. Subsequently, we design a RGB Guided ISP (RGISP) to learn a device-dependent ISP, assisting the process of color recovery. Extensive experiments demonstrate that our RRID outperforms state-of-the-art approaches, in terms of the performance in moiré pattern removal and color cast correction by 0.62dB in PSNR and 0.003 in SSIM. Code is available at https://github.com/rebeccaeexu/RRID." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.596, + 0.706, + 0.61 + ], + "angle": 0, + "content": "Keywords: Image demoiring \\(\\cdot\\) RAW domain \\(\\cdot\\) Image restoration" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.64, + 0.377, + 0.655 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.676, + 0.788, + 0.766 + ], + "angle": 0, + "content": "With the increasing prevalence of smartphone cameras, it is common to record on-screen content using smartphone cameras for convenience. However, this type of photography often results in the presence of moiré patterns in the captured images. The appearance of moiré patterns is caused by the spatial frequency aliasing between the camera's color filter array (CFA) and the screen's LCD subpixel [22], resulting in an unsatisfactory visual experience." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.768, + 0.788, + 0.814 + ], + "angle": 0, + "content": "Moiré patterns present challenges to be eliminated due to their different scales, indistinct shapes, diverse colors, and varying frequencies. Nowadays, many learning-based image demoiring approaches [1,5,6,14,15,18,21-23,27,32] have" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.39, + 0.84 + ], + "angle": 0, + "content": "* Corresponding Author." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "image", + "bbox": [ + 0.333, + 0.145, + 0.673, + 0.19 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.43, + 0.192, + 0.581, + 0.203 + ], + "angle": 0, + "content": "(a) Demoiring in sRGB domain" + }, + { + "type": "image", + "bbox": [ + 0.333, + 0.211, + 0.67, + 0.258 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.428, + 0.258, + 0.576, + 0.269 + ], + "angle": 0, + "content": "(b) Demoiring in RAW domain" + }, + { + "type": "image", + "bbox": [ + 0.333, + 0.28, + 0.67, + 0.372 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.405, + 0.374, + 0.607, + 0.386 + ], + "angle": 0, + "content": "(c) Demoiring in RAW and sRGB domains" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.398, + 0.788, + 0.442 + ], + "angle": 0, + "content": "Fig. 1: Comparison of image demoiréing in different domains. (a) Image demoiréing in sRGB domain. (b) Image demoiréing in RAW domain. (c) Our proposed RRID, which performs image demoiréing in both RAW domain and sRGB domain" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.474, + 0.785, + 0.536 + ], + "angle": 0, + "content": "been proposed. Among the various methods employed, a commonly used approach is utilizing a multi-scale architecture to remove various sizes of moiré patterns [1,5,18,21,27]. Besides, some works advocate the leverage of frequency components and delicately design frequency-based demoiring networks [6,14,22,32]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.537, + 0.788, + 0.764 + ], + "angle": 0, + "content": "The aforementioned methods are developed to demoiré in the sRGB domain, as depicted in Fig. 1(a). While this scheme seems to be the most direct approach, its effectiveness is limited in removing moiré patterns from complex scenes. The reason for this limitation probably lies in the fact that the nonlinear operations in ISP such as demosaicing deteriorate the moiré patterns originally in the RAW domain. Many schemes consequently suggest that eliminating moiré patterns in the RAW domain is more effective than performing demoiréing in the sRGB domain [28,29]. Due to the easy accessibility of RAW data in modern smartphones and DSLR cameras, image demoiréing in RAW domain can be both feasible and advantageous. RDNet [29] is the pioneering study that investigates image demoiréing in the RAW domain. They explore the demoiréing of RAW images using an encoder-decoder and class-specific learning approach, followed by the utilization of a pre-trained ISP for the RAW-to-sRGB conversion, as depicted in Fig. 1(b). Nevertheless, relying exclusively on RAW data can lead to color cast due to the uncertainty during RAW-to-sRGB conversion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.842 + ], + "angle": 0, + "content": "In order to correct the color cast and make the best use of RAW and sRGB information for the moiré pattern removal, we propose to jointly utilize both RAW and sRGB data for image demoiring (RRID), as demonstrated in Fig. 1(c). We advocate that introducing paired RAW-sRGB data is advantageous to the moiré pattern removal due to the following reasons: (1) RAW pixels provide more in-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.449 + ], + "angle": 0, + "content": "formation compared to sRGB pixels since they are typically 12 or 14 bits. (2) Moiré patterns in the RAW domain are less apparent because they are not further affected by nonlinear operations in the ISP. (3) The paired RAW and sRGB data allows the model to learn a device-dependent ISP to aid the process of color recovery. In RRID, we adopt a multi-scale architecture in the Skip-Connection-based Demoiréing Module (SCDM), to effectively eliminate moiré patterns of different sizes. In order to effectively perform demoiréing on RAW and sRGB features, the Gated Feedback Module (GFM) and Frequency Selective Module (FSM) are integrated into skip-connections within SCDM, as opposed to brutally injecting them into the multi-scale layers. Specifically, for RAW features demoiréing, we introduce the GFM into the skip connection, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Moreover, we design the FSM for the moiré sRGB features, leveraging a learnable band stop filter to mitigate moiré patterns in the frequency domain. Subsequent to the pre-demoiréing operations, we develop the RGB Guided Image Signal Processor (RGISP) to integrate color information from the demoiréd sRGB features with the demoiréd RAW features and learn a device-dependent ISP, facilitating the color recovery process. Ultimately, for the image reconstruction, we utilize multiple Residual Swin Transformer Blocks (RSTBs) [12] and convolutions to accomplish global tone mapping and detail refinement." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.451, + 0.611, + 0.464 + ], + "angle": 0, + "content": "In summary, our contributions are listed as follows:" + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.477, + 0.784, + 0.535 + ], + "angle": 0, + "content": "- We propose to exploit image demoiréing in both RAW and sRGB domains. The incorporation of RAW data enhances the moiré pattern removal process, while the inclusion of sRGB data facilitates the RAW-to-sRGB conversion and aids in color restoration of images." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.538, + 0.784, + 0.58 + ], + "angle": 0, + "content": "- We develop SCDM with specifically designed modules, GFM and FSM, embedded in the skip-connections to perform efficient and effective demoiréing on the RAW and sRGB features." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.584, + 0.784, + 0.627 + ], + "angle": 0, + "content": "- RGISP is designed for the RAW-to-sRGB conversion, incorporating color information from the demoiréd sRGB features with demoiréd RAW features and learn a device-dependent ISP, aiding the color deviation correction." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.631, + 0.783, + 0.657 + ], + "angle": 0, + "content": "- Our RRID surpasses state-of-the-arts methods in both qualitative and quantitative evaluations." + }, + { + "type": "list", + "bbox": [ + 0.228, + 0.477, + 0.784, + 0.657 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.687, + 0.396, + 0.702 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.722, + 0.504, + 0.737 + ], + "angle": 0, + "content": "2.1 Image and Video Demoiring" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The purpose of image demoiréing is to restore the original clean image by removing moiré patterns and correcting color deviations from an contaminated image. Many learning-based image demoiréing [1, 6, 15, 18, 22, 23, 32] and video demoiréing methods [2, 19, 26, 28] have been introduced to mitigate the moiré patterns. DMCNN [21] constructs the first real-world dataset for image demoiréing and proposes a multi-resolution neural network to handle moiré patterns across" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.466 + ], + "angle": 0, + "content": "various scales. MopNet [5] devises a multi-scale aggregated network that leverages the edge guidance and pattern attributes for moiré pattern removal. WDNet [14] employs wavelet transformation to decompose images with moiré patterns into separate frequency bands and establishes a dual-branch network to restore both close-range and far-range information. FHDMi [6] formulates a two-stage approach for simultaneous removal of substantial moiré patterns while preserving image details. ESDNet [27] explores a lightweight model aimed at ultra-high-definition image demoiréing. VDMoiré [2] collects the first video demoiréing dataset and presents a baseline video demoiréing model with a relation-based temporal consistency loss. The aforementioned methods all operate in the sRGB domain. Since it has been observed that moiré patterns are less prominent in the RAW domain, some schemes advocate performing image or video demoiréing in the RAW domain. RDNet [29] introduces the first image demoiréing dataset with RAW data and conducts the demoiréing process in the RAW domain. RawVDemoiré [28] proposes a temporal alignment method for RAW video demoiréing. To remove moiré patterns in the RAW domain, the model have to simultaneously possess the capabilities of demoiréing and and RAW-to-sRGB conversion. However, previous methods encounter challenges in color recovery due to the uncertainty of RAW-to-sRGB conversion. Consequently, we propose an image demoiréing network that utilizes paired RAW-sRGB data, facilitating the color recovery process in image demoiréing." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.515, + 0.593, + 0.531 + ], + "angle": 0, + "content": "2.2 Learning-Based RAW Image Processing" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.841 + ], + "angle": 0, + "content": "RAW pixels offer the potential for leveraging additional information due to their broader bit depth, inherently containing a great wealth of data. Early research in RAW image processing primarily centers on integrating demosaicing and denoising techniques [4,9,10,13]. RTF [9] devices a machine learning approach to the demosaicing and denoising on RAW inputs. SGNet [13] introduces a self-guidance network that leverages the inherent density-map guidance and green-channel guidance for demosaicing and denoising on the RAW images. Recently, some low-level vision tasks endorse the utilization of RAW data, including low-light enhancement [3,7,8], super-resolution [16,25,30], and reflection removal [11,20]. The majority of the aforementioned RAW image processing methods only take RAW images as input and generate restored sRGB images as output, indicating that the entire model is responsible for both the restoration and ISP tasks. CR3Net [20] presents a cascaded network that harnesses both the RGB data and their corresponding RAW versions for image reflection removal. Within CR3Net, a module is formulated to emulate point-wise mappings within the ISP, converting the features from RAW to sRGB domain. To further mitigate the color casting problem, our proposed method jointly utilize RAW and sRGB data to learn a device-dependent ISP for image demoiring." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.38, + 0.163 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.174, + 0.788, + 0.4 + ], + "angle": 0, + "content": "Originally caused by frequency interference between the camera's CFA and the screen's LCD subpixel, moiré patterns are further deteriorated by the nonlinear processes in ISP. Therefore, introducing RAW data for image demoiréing may offer greater effectiveness. However, relying solely on RAW data for image demoiréing is insufficient in mitigating color cast due to the uncertainty during the RAW-to-sRGB conversion. Consequently, in this work, we propose to utilize paired RAW and sRGB data, which are readily accessible in modern smartphones and DSLR cameras (e.g., iPhone 15 Pro, HUWEI P60 Pro). The RAW-sRGB pairs essentially allows the model to learn a device-dependent ISP, aiding the color recovery process. The potential applications in real-world scenarios can be described as follows. When demoiréing function is enabled, the in-device ISP generated sRGB image will not be directly outputted. Instead, together with its corresponding RAW version, will be processed by our RRID to generate a new sRGB image with much suppressed moiré patterns. Afterwards, the RAW image could be discarded, depending on settings of the camera." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.424, + 0.725, + 0.582 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.584, + 0.412, + 0.639 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.291, + 0.642, + 0.342, + 0.652 + ], + "angle": 0, + "content": "(b) DCAB" + }, + { + "type": "image", + "bbox": [ + 0.414, + 0.584, + 0.624, + 0.639 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.486, + 0.643, + 0.529, + 0.652 + ], + "angle": 0, + "content": "(c) GFM" + }, + { + "type": "image", + "bbox": [ + 0.625, + 0.584, + 0.785, + 0.639 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.682, + 0.642, + 0.723, + 0.652 + ], + "angle": 0, + "content": "(d) FSM" + }, + { + "type": "image", + "bbox": [ + 0.252, + 0.658, + 0.721, + 0.739 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.272, + 0.752, + 0.728, + 0.767 + ], + "angle": 0, + "content": "Fig. 2: The overview and detailed structures of our proposed RRID." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "More specifically, Fig. 2 presents an overview of our proposed RRID for image demoiring with the paired RAW and sRGB data. As for the RGB branch, the input is an sRGB image \\(\\mathbf{I}_{rgb} \\in \\mathbb{R}^{H \\times W \\times 3}\\), where \\(H \\times W\\) represents the spatial" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "resolution. Given an input RAW image, it is first packed into the 4-channel RGGB format \\(\\mathbf{I}_{raw} \\in \\mathbb{R}^{\\frac{H}{2} \\times \\frac{W}{2} \\times 4}\\), which serves as the input for the RAW branch. RRID is designed to generate the final output sRGB image \\((\\hat{\\mathbf{Y}}_{rgb})\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.193, + 0.788, + 0.42 + ], + "angle": 0, + "content": "Concretely, shallow features \\(\\mathbf{F}_{raw}\\) and \\(\\mathbf{F}_{rgb}\\) are respectively extracted from the input data \\(\\mathbf{I}_{raw}\\) and \\(\\mathbf{I}_{rgb}\\) using a convolutional layer and the Dilated Channel Attention Block (DCAB). It is worth noting that a down-sampling layer is applied to the sRGB data to ensure the uniformity of feature shapes. Then, we apply SCDM to acquire pre-demoiréd features \\(\\mathbf{D}_{raw}\\) and \\(\\mathbf{D}_{rgb}\\) in RAW branch and RGB branch, respectively. GFM is introduced in the skip-connection of SCDM for RAW features, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Similarly, FSM is utilized to mitigate moiré patterns in the frequency domain. More details will be given in Sec. 3.1. Subsequently, RGISP is designed to realize a RAW-to-sRGB conversion, generating \\(\\mathbf{D}_{out}\\). RGISP incorporates color information from coarsely demoiréd sRGB features \\(\\mathbf{D}_{rgb}\\) in a cross-attention mechanism, which will be introduced in Sec. 3.2. For the final image reconstruction, 4 RSTBs [12] are utilized to generate sRGB output \\(\\hat{\\mathbf{Y}}_{rgb}\\) for their advantages in building long-range dependencies for global tone mapping and detail refinement." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.439, + 0.403, + 0.455 + ], + "angle": 0, + "content": "3.1 Design of SCDM" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.788, + 0.629 + ], + "angle": 0, + "content": "We propose SCDM, a multi-scale architecture designed to remove moiré patterns from shallow RAW features \\( F_{raw} \\) and shallow sRGB features \\( F_{rgb} \\), as shown in Fig. 2(a). Unlike the vanilla U-Net, SCDM is constructed upon DCAB, facilitating the encoding and decoding of informative features within the respective layers. The features are downsampled twice in the spatial dimension during the encoding process and then upsampled to the original resolution of the input features during decoding. To emphasize the contextual information, we enhance the learned features from the corresponding layers of the encoder with additional modules at skip connections, that is GFM for RAW and FSM for sRGB. The introduction of GFM and FSM in skip-connections is also intended to enhance model efficiency. Then, we can obtain the pre-demoiréd features \\( \\mathbf{D}_{raw} \\) and \\( \\mathbf{D}_{rgb} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.788, + 0.764 + ], + "angle": 0, + "content": "DCAB. DCAB is the essential building block of encoder-decoders for performing RAW demoiréing and the RGB demoiréing, as shown in Fig. 2(b). DCAB is designed using a series of dilated convolution layers followed by ReLU activation and the channel attention mechanism. The receptive field at each block is expanded with the dilated convolution kernels, facilitating the demoiréing operations. Furthermore, by incorporating the channel attention mechanism, DCAB adaptively rescales features according to interdependencies among channels. Also, shortcuts are introduced to establish connections between the input and output of DCAB, enabling the block to learn the residual features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "GFM. Embedded in the skip-connection of SCDM for RAW features, GFM is introduced to enable adaptive differentiation between the texture and moiré patterns through feature gating. The detailed structure of the GFM is shown in Fig. 2(c). For efficiency, we employ point-wise and depth-wise convolutions to aggregate channel and local content information, respectively. Then, the features" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.222 + ], + "angle": 0, + "content": "are chunked along the channel dimension to generate \\(\\mathbf{F}_{gate}\\) and \\(\\mathbf{F}_{content}\\). A pointwise multiplication is applied on \\(\\mathbf{F}_{content}\\) and \\(\\mathbf{F}_{gate}\\) after a GELU activation. During feature gating, we expect that the original image content is adaptively selected and merged along both spatial and channel dimensions. The operations can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.335, + 0.236, + 0.785, + 0.252 + ], + "angle": 0, + "content": "\\[\n\\left\\{\\mathbf {F} _ {\\text {g a t e}}, \\mathbf {F} _ {\\text {c o n t e n t}} \\right\\} = \\operatorname {D C o n v} \\left(\\operatorname {P C o n v} \\left(\\mathbf {F} _ {\\text {G F M} _ {\\text {i n}}}\\right)\\right), \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.286, + 0.255, + 0.785, + 0.272 + ], + "angle": 0, + "content": "\\[\n\\mathbf {F} _ {G F M \\_ o u t} = \\operatorname {P C o n v} \\left(\\mathbf {F} _ {\\text {c o n t e n t}} \\odot \\operatorname {G E L U} \\left(\\mathbf {F} _ {\\text {g a t e}}\\right) + \\mathbf {F} _ {G F M \\_ i n}\\right), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.282, + 0.784, + 0.312 + ], + "angle": 0, + "content": "where DConv and PConv represent depth-wise convolution and point-wise convolution, respectively. Here, \\(\\odot\\) denotes the element-wise multiplication." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.313, + 0.785, + 0.553 + ], + "angle": 0, + "content": "FSM. For sRGB demoiring, we leverage a learnable band stop filter [32] to mitigate moiré patterns in the frequency domain. Considering the formation of moiré patterns is caused by the spatial frequency aliasing between the camera CFA and screen's LCD subpixel, demoiring in the frequency domain becomes a favorable approach. However, the frequency spectrum of the moiré pattern is often mixed with that of the original contents, thereby making it challenging to disentanglement. Therefore, we propose to perform the disentanglement within small patches, where the moiré patterns tend to be more pronounced in a specific range of frequency bands, facilitating the removal of moiré patterns. Inspired by Zheng et al. [32], we utilize a band stop filter to amplify certain frequencies and suppress others using Block DCT. However, obtaining the frequency prior to separate moiré patterns from normal image textures is challenging and time-consuming. To address this issue, a set of convolution layers are employed as the learnable band stop filter \\(\\mathrm{B}(\\cdot)\\) to attenuate the specific frequencies of moiré patterns while preserving the original image contents. The process of the FSM can be represented as:" + }, + { + "type": "equation", + "bbox": [ + 0.354, + 0.568, + 0.785, + 0.584 + ], + "angle": 0, + "content": "\\[\n\\mathbf {F} _ {F S M \\_ o u t} = \\operatorname {I D C T} (\\mathrm {B} (\\mathrm {D C T} (\\mathbf {F} _ {F S M \\_ i n}))), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.595, + 0.784, + 0.625 + ], + "angle": 0, + "content": "where DCT and IDCT denote the process of Block DCT and the corresponding inverse process. The block size is set to \\(8 \\times 8\\) for DCT and IDCT." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.648, + 0.404, + 0.663 + ], + "angle": 0, + "content": "3.2 Design of RGISP" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.785, + 0.841 + ], + "angle": 0, + "content": "RGISP is proposed to transform pre-demoiréd RAW features \\(\\mathbf{D}_{raw}\\) into sRGB domain \\(\\mathbf{D}_{out}\\). With the assistance of pre-demoiréd sRGB features \\(\\mathbf{D}_{rgb}\\), a device-dependent ISP can be learned in RGISP. Matrix transformation is commonly employed in the traditional ISP pipelines [17]. It enables the enhancement or conversion of image colors to another color space through a channel-wise matrix transformation, which is facilitated by globally shared settings such as environmental illumination and color space specifications [8]. Building upon this principle, we introduce matrix transformation as a means to perform color transformation, as illustrated in Fig. 3. The design of this matrix transformation is motivated by recent advancements in transposed cross-attention. Given \\(\\mathbf{D}_{raw} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}\\), the vectors of query \\(\\mathbf{Q} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}\\), key \\(\\mathbf{K} \\in \\mathbb{R}^{\\frac{H}{2} \\times \\frac{W}{2} \\times C}\\) are generated through the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "image", + "bbox": [ + 0.277, + 0.145, + 0.73, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.391, + 0.313, + 0.611, + 0.327 + ], + "angle": 0, + "content": "Fig. 3: The structure of RGISP." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.354, + 0.784, + 0.4 + ], + "angle": 0, + "content": "projection with a \\(1 \\times 1\\) convolutional layer Conv and a flatten operation Flatten, where \\(C\\) is the intermediate channel number. Similarly, value \\(\\mathbf{V} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}\\) can be produced by operations on \\(\\mathbf{D}_{rgb} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}\\) as:" + }, + { + "type": "equation", + "bbox": [ + 0.38, + 0.406, + 0.786, + 0.424 + ], + "angle": 0, + "content": "\\[\n\\left\\{\\mathbf {Q}, \\mathbf {K} \\right\\} = \\operatorname {F l a t t e r n} \\left(\\operatorname {C o n v} \\left(\\mathbf {D} _ {\\text {r a w}}\\right)\\right), \\tag {4}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.405, + 0.425, + 0.786, + 0.442 + ], + "angle": 0, + "content": "\\[\n\\mathbf {V} = \\operatorname {F l a t t e n} \\left(\\operatorname {C o n v} \\left(\\mathbf {D} _ {r g b}\\right)\\right). \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.449, + 0.784, + 0.479 + ], + "angle": 0, + "content": "Then, the transformation matrix \\(\\mathbf{M} \\in \\mathbb{R}^{C \\times C}\\) is obtained by matrix multiplication. The procedure can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.406, + 0.485, + 0.786, + 0.503 + ], + "angle": 0, + "content": "\\[\n\\mathbf {M} = \\operatorname {S o f t m a x} \\left(\\mathbf {Q} \\cdot \\mathbf {K} ^ {T} / \\lambda\\right), \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.784, + 0.601 + ], + "angle": 0, + "content": "where a scaling coefficient \\(\\lambda\\) is applied for numerical stability. Subsequently, the vector \\(\\mathbf{V}\\) is transformed by the matrix \\(\\mathbf{M}\\), performing color space conversion in feature-level. The output feature after color transformation can be obtained by \\(\\mathbf{D}_{out} = \\mathbf{M} \\cdot \\mathbf{V}\\). As a complement to the global matrix transformation, we use a depth-wise convolution and a point-wise convolution to refine the local details, generating the output in sRGB domain \\(\\mathbf{D}_{out}\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.619, + 0.377, + 0.632 + ], + "angle": 0, + "content": "3.3 Loss Function" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.64, + 0.784, + 0.684 + ], + "angle": 0, + "content": "To effectively remove the moiré patterns and adjust the color deviations, we introduce supervision in both RAW and sRGB domains. The overall training objective can be expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.359, + 0.69, + 0.786, + 0.707 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\alpha \\| \\hat {\\mathbf {Y}} _ {r a w} - \\mathbf {Y} _ {r a w} \\| _ {1} + \\| \\hat {\\mathbf {Y}} _ {r g b} - \\mathbf {Y} _ {r g b} \\| _ {1}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.712, + 0.783, + 0.742 + ], + "angle": 0, + "content": "where \\(\\mathbf{Y}_{raw}\\) and \\(\\mathbf{Y}_{rgb}\\) are the ground-truth RAW and sRGB images, respectively. We empirically set \\(\\alpha = 0.5\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.762, + 0.377, + 0.779 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.789, + 0.428, + 0.805 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.784, + 0.841 + ], + "angle": 0, + "content": "Dataset. The experiments are conducted on the RAW image demoiréing dataset published in TMM22 [29], which contains recaptured scenes of natural images," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "documents, and webpages. In TMM22, the dataset consists of 540 RAW and sRGB image pairs with ground-truth for training, and 408 pairs for testing. To facilitate the training and comparison process, patches of size \\(256 \\times 256\\) and \\(512 \\times 512\\) are cropped respectively for the training and testing sets. The moiré images are captured using four different smartphone cameras and three display screens of varying sizes. In addition, we utilize an image demoiring dataset FHIMi [6] to verify the generalization ability of our method. FHDMi contains 9981 sRGB image pairs for training and 2019 for testing, featuring diverse and intricate moiré patterns. Notably, images in FHDMi have a higher resolution of \\(1920 \\times 1080\\), compared to TMM22." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.298, + 0.788, + 0.358 + ], + "angle": 0, + "content": "Training Details. We train RRID using the AdamW optimizer with \\(\\beta_{1} = 0.9\\) and \\(\\beta_{2} = 0.999\\). A multistep learning rate schedule is employed, with the learning rate initialized at \\(2 \\times 10^{-4}\\). The RRID model is trained for 500 epochs using a batch size of 80 on 4 NVIDIA RTX 3090 GPUs." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.379, + 0.433, + 0.394 + ], + "angle": 0, + "content": "4.2 Quantitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.403, + 0.788, + 0.614 + ], + "angle": 0, + "content": "We compare our approach with several image demoiréing methods in sRGB domain, including DMCNN [21], WDNet [14], ESDNet [27], and a RAW image demoiréing method RDNet [29]. We further add comparison with a low-light enhancement method DNF [8] with RAW input, a video demoiréing method RawVDmoiré [28] with RAW input, and a de-reflection method CR3Net [20] with paired RAW-sRGB data. To evaluate the performance of our proposed RRID, we adopt the following three standard metrics to assess pixel-wise accuracy and the perceptual quality: PSNR, SSIM [24], and LPIPS [31]. Additionally, the number of parameters, FLOPs, and inference time are introduced to measure the model complexity. To ensure a fair comparison, we modify the inputs of the sRGB-based models to align with the dataset requirements. Subsequently, all models are fine-tuned using the default settings as provided in their papers on TMM22 dataset. We select the better results from the pretrained and retrained models for comparison, which provides an advantage over the competing methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.615, + 0.788, + 0.735 + ], + "angle": 0, + "content": "Table. 1 presents the quantitative and the computational complexity comparisons. RRID outperforms the second-best method, RawVDmoiré, by 0.62dB in PSNR and 0.003 in SSIM. As for LPIPS, our methods accomplish the second-best result at 0.079, surpassing most of the comparison methods. Even though RRID utilizes both RAW and sRGB data as inputs, our approach can still achieve a satisfactory demoiréing effect with a inference time of merely 0.089s. Compared to previous methods, our RRID demonstrates superiority with acceptable parameters and FLOPs, further demonstrating the superiority of our approach." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "To verify the generalization performance of our method, we conduct additional experiments on an image demoiréing dataset FHIMi [6]. In order to adapt to the FHDMi dataset with sRGB data as input, the RAW branch and RGISP are removed. We select methods tailored for image demoiréing: DMCNN [21], MopNet [5], MBCNN [32], FHDe²Net [6], and ESDNet [27] for comparison, as shown in Table 2. Although RRID is initially designed for demoiréing on the RAW-sRGB image pairs, it still achieves the second-best performance by 24.39dB in" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 1: Quantitative comparison with the state-of-the-art demoiring approaches and RAW image restoration methods on TMM22 dataset [29] in terms of average PSNR, SSIM, LPIPS and computational complexity. The best results are highlighted with bold. The second-best results are highlighted with underline." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.213, + 0.784, + 0.359 + ], + "angle": 0, + "content": "
IndexMethods
DMCNN [21]WDNet [14]ESDNet [27]RDNet [29]DNF [8]RawVDmoiré [28]CR3Net [20]RRID (Ours)
# Input typesRGBsRGBsRGBRAWRAWRAWsRGB+RAWsRGB+RAW
PSNR↑23.5422.3326.7726.1623.5527.2623.7527.88
SSIM↑0.8850.8020.9270.9210.8950.9350.9220.938
LPIPS↓0.1540.1660.0890.0910.1620.0750.1020.079
Params (M)1.553.365.936.041.255.332.682.38
TFLOPs0.1020.0550.1410.1610.0130.0220.8830.093
Inference time (s)0.0520.2840.1151.0940.0700.1820.0580.089
" + }, + { + "type": "table_caption", + "bbox": [ + 0.307, + 0.373, + 0.696, + 0.388 + ], + "angle": 0, + "content": "Table 2: Quantitative comparison on FHDMi dataset [6]." + }, + { + "type": "table", + "bbox": [ + 0.418, + 0.4, + 0.591, + 0.496 + ], + "angle": 0, + "content": "
MethodPSNR↑SSIM↑
DMCNN [21]21.540.773
MopNet [5]22.760.796
MBCNN [32]22.310.810
FHDe2Net [6]22.930.789
ESDNet [27]24.500.835
Ours24.390.830
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.525, + 0.788, + 0.617 + ], + "angle": 0, + "content": "PSNR and 0.830 in SSIM. Compared to ESDNet, an image demoiréing network designed for ultra-high-definition sRGB images with more than twice of the parameters, RRID also yields competitive results. The qualitative results on the FHDMi dataset demonstrate that our method can not only perform well in demoiréing on RAW-sRGB pairs but also solve sRGB image demoiréing, exhibiting a certain degree of generalization." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.644, + 0.421, + 0.659 + ], + "angle": 0, + "content": "4.3 Qualitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We present visual comparisons among our approach and the existing methods in Fig. 4. The results demonstrate the advantage of RRID in effectively removing moiré artifacts and correcting color deviations. For the first scene demonstrating a recaptured flower with moiré patterns, previous methods tend to exhibit residual moiré patterns in their restored images. While ESDNet successfully eliminates a significant portion of these patterns, it struggles to accurately restore the original colors of the image. Apart from natural scenes, we also present a case of webpages contaminated with moiré patterns. Through the utilization of both RAW and sRGB data, our approach eliminates moiré patterns while preserving fine image details, even in scenarios characterized by severe color deviations. This ensures a more accurate restoration of the original colors and results in" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "enhanced visual effects. Additional qualitative comparisons can be found in the supplementary file." + }, + { + "type": "image", + "bbox": [ + 0.214, + 0.2, + 0.331, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.253, + 0.291, + 0.295, + 0.3 + ], + "angle": 0, + "content": "(a) Input" + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.203, + 0.443, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.357, + 0.291, + 0.419, + 0.3 + ], + "angle": 0, + "content": "(b) DMCNN" + }, + { + "type": "image", + "bbox": [ + 0.443, + 0.203, + 0.555, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.474, + 0.291, + 0.529, + 0.3 + ], + "angle": 0, + "content": "(c)WDNet" + }, + { + "type": "image", + "bbox": [ + 0.559, + 0.203, + 0.671, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.588, + 0.291, + 0.643, + 0.3 + ], + "angle": 0, + "content": "(d) ESDNet" + }, + { + "type": "image", + "bbox": [ + 0.672, + 0.203, + 0.785, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.704, + 0.291, + 0.754, + 0.3 + ], + "angle": 0, + "content": "(e) RDNet" + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.3, + 0.33, + 0.386 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.254, + 0.387, + 0.292, + 0.395 + ], + "angle": 0, + "content": "(f) DNF" + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.3, + 0.444, + 0.386 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.347, + 0.387, + 0.43, + 0.396 + ], + "angle": 0, + "content": "(g) RawVDmoire" + }, + { + "type": "image", + "bbox": [ + 0.445, + 0.3, + 0.557, + 0.386 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.475, + 0.387, + 0.531, + 0.396 + ], + "angle": 0, + "content": "(h) CR3Net" + }, + { + "type": "image", + "bbox": [ + 0.559, + 0.3, + 0.671, + 0.386 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.596, + 0.387, + 0.635, + 0.396 + ], + "angle": 0, + "content": "(i) Ours" + }, + { + "type": "image", + "bbox": [ + 0.672, + 0.3, + 0.785, + 0.386 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.715, + 0.387, + 0.746, + 0.396 + ], + "angle": 0, + "content": "(j) GT" + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.397, + 0.33, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.254, + 0.483, + 0.296, + 0.492 + ], + "angle": 0, + "content": "(a) Input" + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.397, + 0.443, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.358, + 0.483, + 0.42, + 0.492 + ], + "angle": 0, + "content": "(b)DMCNN" + }, + { + "type": "image", + "bbox": [ + 0.445, + 0.397, + 0.557, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.476, + 0.483, + 0.53, + 0.492 + ], + "angle": 0, + "content": "(c)WDNet" + }, + { + "type": "image", + "bbox": [ + 0.559, + 0.397, + 0.671, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.589, + 0.483, + 0.645, + 0.492 + ], + "angle": 0, + "content": "(d) ESDNet" + }, + { + "type": "image", + "bbox": [ + 0.672, + 0.397, + 0.785, + 0.482 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.705, + 0.483, + 0.756, + 0.492 + ], + "angle": 0, + "content": "(e) RDNet" + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.493, + 0.33, + 0.576 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.255, + 0.578, + 0.295, + 0.588 + ], + "angle": 0, + "content": "(f) DNF" + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.493, + 0.443, + 0.577 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.347, + 0.578, + 0.431, + 0.588 + ], + "angle": 0, + "content": "(g) RawVDmoire" + }, + { + "type": "image", + "bbox": [ + 0.445, + 0.493, + 0.557, + 0.577 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.475, + 0.578, + 0.532, + 0.588 + ], + "angle": 0, + "content": "(h) CR3Net" + }, + { + "type": "image", + "bbox": [ + 0.559, + 0.493, + 0.671, + 0.577 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.598, + 0.578, + 0.637, + 0.588 + ], + "angle": 0, + "content": "(i) Ours" + }, + { + "type": "image", + "bbox": [ + 0.672, + 0.493, + 0.785, + 0.577 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.716, + 0.578, + 0.746, + 0.588 + ], + "angle": 0, + "content": "(j) GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.232, + 0.6, + 0.768, + 0.615 + ], + "angle": 0, + "content": "Fig. 4: Qualitative comparison on RAW image demoiring TMM22 dataset [29]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.668, + 0.39, + 0.684 + ], + "angle": 0, + "content": "4.4 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.693, + 0.787, + 0.755 + ], + "angle": 0, + "content": "1) Ablation study on the model architecture and inputs. In Table 3, we investigate the architecture and inputs of RRID and validate the importance of different individual components in the whole RRID. We conduct this ablation study by comparing the proposed RRID and the following variants of RRID:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.765, + 0.784, + 0.794 + ], + "angle": 0, + "content": "- \\( B_{1} \\). Both the RAW input and the RAW demoiréing branch are removed. Due to the lack of RAW features, the entire RGISP is also deleted." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.795, + 0.744, + 0.81 + ], + "angle": 0, + "content": "- \\(B_{2}\\). Both the sRGB input and sRGB demoiring branch are removed." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.81, + 0.785, + 0.84 + ], + "angle": 0, + "content": "- \\( B_{3} \\). The sRGB input is substituted with RAW input. The input channel number is adjusted, while the rest of the architecture is kept unchanged." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.765, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.147, + 0.784, + 0.175 + ], + "angle": 0, + "content": "- \\( B_{4} \\). We replace RGISP with a two convolutional layers after a concatenation of the RAW and sRGB features." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.177, + 0.74, + 0.191 + ], + "angle": 0, + "content": "- \\( B_{5} \\). Reconstruction module is replaced with two convolutional layers." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.192, + 0.767, + 0.207 + ], + "angle": 0, + "content": "- \\(B_{6}\\). The full model of RRID with both RAW and sRGB images as input." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": null + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.241, + 0.784, + 0.256 + ], + "angle": 0, + "content": "Table 3: Comparison of baseline models for the evaluation of architecture and inputs." + }, + { + "type": "table", + "bbox": [ + 0.356, + 0.268, + 0.653, + 0.364 + ], + "angle": 0, + "content": "
ModelsPSNR↑SSIM↑
B1 (w/o RAW in and RAW branch)25.790.915
B2 (w/o sRGB in and sRGB branch)27.240.929
B3 (w/o sRGB in)26.510.923
B4 (w/o RGISP)27.380.932
B5 (w/o Reconstruction)26.930.926
B6 (full version)27.880.938
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.391, + 0.788, + 0.466 + ], + "angle": 0, + "content": "Our proposed RRID leverages paired RAW-sRGB data as input. Removing the RAW input and its corresponding RAW demoiréing module \\((B_{1})\\) results in a drastic decrease in PSNR of approximately 2dB. Likewise, eliminating the sRGB input and its corresponding RGB demoiréing module \\((B_{2})\\) leads to a PSNR of only 27.24dB. In addition to the decline in numerical metrics, we can also assess" + }, + { + "type": "image", + "bbox": [ + 0.274, + 0.491, + 0.387, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.309, + 0.58, + 0.352, + 0.59 + ], + "angle": 0, + "content": "(a) Input" + }, + { + "type": "image", + "bbox": [ + 0.388, + 0.492, + 0.501, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.43, + 0.58, + 0.46, + 0.591 + ], + "angle": 0, + "content": "(b) \\(B_{j}\\)" + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.492, + 0.615, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.545, + 0.58, + 0.574, + 0.591 + ], + "angle": 0, + "content": "(c) \\(B_{2}\\)" + }, + { + "type": "image", + "bbox": [ + 0.617, + 0.492, + 0.73, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.659, + 0.58, + 0.689, + 0.591 + ], + "angle": 0, + "content": "(d) \\(B_{3}\\)" + }, + { + "type": "image", + "bbox": [ + 0.274, + 0.593, + 0.387, + 0.679 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.316, + 0.68, + 0.346, + 0.692 + ], + "angle": 0, + "content": "(e) \\(B_{4}\\)" + }, + { + "type": "image", + "bbox": [ + 0.388, + 0.593, + 0.501, + 0.679 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.431, + 0.68, + 0.459, + 0.692 + ], + "angle": 0, + "content": "(f) \\(B_{5}\\)" + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.593, + 0.615, + 0.679 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.528, + 0.68, + 0.59, + 0.692 + ], + "angle": 0, + "content": "(g) \\(B_{6}\\) (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.617, + 0.593, + 0.73, + 0.679 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.657, + 0.68, + 0.69, + 0.691 + ], + "angle": 0, + "content": "(h) GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.225, + 0.706, + 0.775, + 0.721 + ], + "angle": 0, + "content": "Fig. 5: Visualization of the ablation study for architecture and inputs comparison." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "the visual performance from Fig. 5. When relying only on sRGB data and its corresponding demoiréing modules, moiré patterns are less effectively removed, as depicted in Fig.5(b). Conversely, Fig.5(c) demonstrates that using only RAW data as input generates images with more pronounced color deviations. To further validate the significance of RAW input for image demoiréing, we compare \\( B_{3} \\) to \\( B_{1} \\) by solely removing the RAW input data while retaining the remaining" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.253 + ], + "angle": 0, + "content": "model structures. Although \\( B_{3} \\) demonstrates some improvements in numerical metrics compared to \\( B_{1} \\), its performance remains unsatisfactory due to the lack of information provided by the RAW input and the fact that the original RAW demoiring module is specifically designed for RAW data. Additionally, we conducted further comparisons by removing the originally designed RGISP \\( (B_{4}) \\) and Reconstruction modules \\( (B_{5}) \\), resulting in inferior numerical metrics and performance in Fig. 5 compared to the complete RRID model \\( (B_{6}) \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.803, + 0.3 + ], + "angle": 0, + "content": "2) Ablation study on SCDM. SCDM is designed to perform effective demoiréing on both RAW and sRGB features. More specifically, we introduce GFM for RAW features demoiréing and FSM for sRGB features demoiréing." + }, + { + "type": "table_caption", + "bbox": [ + 0.379, + 0.326, + 0.622, + 0.34 + ], + "angle": 0, + "content": "Table 4: Ablation study on SCDM." + }, + { + "type": "table", + "bbox": [ + 0.398, + 0.353, + 0.61, + 0.456 + ], + "angle": 0, + "content": "
ModelsPSNR↑SSIM↑
S1 (w/o GFM & FSM)27.000.926
S2 (w/o GFM)27.170.927
S3 (w/o FSM)27.390.930
S4 (all GSM)27.500.933
S5 (all FSM)27.320.930
S6 (w/o DCAB)26.550.923
S7 (SCDM)27.880.938
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.486, + 0.788, + 0.683 + ], + "angle": 0, + "content": "Table 4 demonstrates the effectiveness and indispensability of the meticulously designed GFM and FSM integrated within the skip-connections. Removing the demoiréing modules on the skip-connections \\((S_{1} - S_{3})\\) individually result in varying degrees of performance decline of the model. For instance, removing both GFM and FSM leads to only \\(27.00\\mathrm{dB}\\) in PSNR. Furthermore, Fig.6(b) demonstrates that the model's ability to remove moiré patterns decreases upon removing the GFM and FSM modules. Furthermore, to assess the specificity of GFM and FSM, we substitute the original modules in \\(S_{4}\\) and \\(S_{5}\\), respectively. Despite no reduction in the number of parameters, the PSNR decreases by approximately \\(0.3 - 0.5\\mathrm{dB}\\). Since DCAB is a crucial component module in SCDM, we substitute DCAB with two convolutional layers to confirm its necessity. Fig. 6(c) showcases more residual moiré patterns and significant color deviation compared to our complete SCDM presented in Fig.6(d)." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.709, + 0.329, + 0.796 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.252, + 0.797, + 0.295, + 0.808 + ], + "angle": 0, + "content": "(a) Input" + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.71, + 0.443, + 0.796 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.374, + 0.797, + 0.402, + 0.808 + ], + "angle": 0, + "content": "(b) \\(\\mathbf{S}_I\\)" + }, + { + "type": "image", + "bbox": [ + 0.446, + 0.71, + 0.557, + 0.796 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.488, + 0.797, + 0.516, + 0.808 + ], + "angle": 0, + "content": "(c) \\(\\mathbf{S}_6\\)" + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.71, + 0.671, + 0.796 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.602, + 0.797, + 0.631, + 0.808 + ], + "angle": 0, + "content": "(d) \\(\\mathbf{S}_7\\)" + }, + { + "type": "image", + "bbox": [ + 0.674, + 0.71, + 0.785, + 0.796 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.713, + 0.797, + 0.747, + 0.808 + ], + "angle": 0, + "content": "(e) GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.32, + 0.822, + 0.68, + 0.836 + ], + "angle": 0, + "content": "Fig. 6: Visualization of the ablation study for SCDM." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.313, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.247, + 0.218, + 0.283, + 0.227 + ], + "angle": 0, + "content": "(a) Input" + }, + { + "type": "image", + "bbox": [ + 0.315, + 0.144, + 0.409, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.347, + 0.217, + 0.373, + 0.227 + ], + "angle": 0, + "content": "(b) \\(\\mathbb{R}_I\\)" + }, + { + "type": "image", + "bbox": [ + 0.411, + 0.144, + 0.503, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.442, + 0.217, + 0.467, + 0.227 + ], + "angle": 0, + "content": "(c) \\(\\mathbb{R}_2\\)" + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.144, + 0.597, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.536, + 0.217, + 0.562, + 0.227 + ], + "angle": 0, + "content": "(d) \\(\\mathbb{R}_3\\)" + }, + { + "type": "image", + "bbox": [ + 0.598, + 0.144, + 0.788, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.319, + 0.24, + 0.682, + 0.255 + ], + "angle": 0, + "content": "Fig. 7: Visualization of the ablation study for RGISP." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.284, + 0.788, + 0.452 + ], + "angle": 0, + "content": "3) Ablation study on RGISP. RGISP is designed to integrate color information from the coarsely demoiréd sRGB features during the ISP stage, facilitating the color recovery process. The process of the RGISP can be recognized as a cross-attention mechanism. To assess the efficacy of the RGISP design, we compare the following structures in Table 5. For \\( R_{1} \\), we concatenate the pre-demoiréd RAW features with the sRGB features and subsequently apply a self-attention mechanism. In \\( R_{2} \\), the pre-demoiréd RAW features undergo a self-attention mechanism and are then concatenated with the pre-demoiréd sRGB features. Table 5 shows that our proposed RGISP surpasses the self-attention mechanisms \\( (R_{1}, R_{2}) \\), as well as other RAW-to-sRGB conversion methods RRM [20] \\( (R_{3}) \\). In addition, Fig. 7 depicts a webpage with globally distributed moiré pat" + }, + { + "type": "table_caption", + "bbox": [ + 0.379, + 0.478, + 0.625, + 0.492 + ], + "angle": 0, + "content": "Table 5: Ablation study on RGISP." + }, + { + "type": "table", + "bbox": [ + 0.391, + 0.505, + 0.619, + 0.576 + ], + "angle": 0, + "content": "
ModelsPSNR↑SSIM↑
R1(self-atten([raw,rgb]))27.540.933
R2(self-atten(raw),rgb])27.420.931
R3(RRM)27.210.929
R4(RGISP)27.880.938
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.603, + 0.788, + 0.664 + ], + "angle": 0, + "content": "terns. \\( R_{1} - R_{4} \\) are all capable of effectively removing the moiré patterns, but \\( R_{4} \\) exhibits the best performance in correcting color deviation. With the introduction of sRGB pre-demoiréd features, RGISP is able to learn a device-dependent ISP and restore the original colors of the image effectively." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.687, + 0.36, + 0.703 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.84 + ], + "angle": 0, + "content": "In this paper, we propose to jointly utilize RAW and sRGB data for image demoiréing (RRID). Firstly, we introduce SCDM with GFM and FSM embedded in skip-connections to handle the demoiréing of RAW and sRGB features, respectively. Additionally, we present RGISP to learn a device-dependent ISP, aiding the color recovery process. Extensive experiments demonstrate the superior performance of our RRID method in both moiré pattern removal and color cast correction. Our approach outperforms state-of-the-art methods by 0.62dB in PSNR and 0.003 in SSIM." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.266 + ], + "angle": 0, + "content": "This work was supported in part by Macau Science and Technology Development Fund under SKLIOTSC-2021-2023, 0072/2020/AMJ, 0022/2022/A, and 0014/2022/AFJ; in part by Research Committee at University of Macau under MYRG-GRG2023-00058-FST-UMDF and MYRG2022-00152-FST; in part by Natural Science Foundation of Guangdong Province of China under EF2023-00116-FST." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.288, + 0.323, + 0.304 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.36 + ], + "angle": 0, + "content": "1. Cheng, X., Fu, Z., Yang, J.: Multi-scale dynamic feature encoding network for image demoiring. In: 2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW). pp. 3486-3493. IEEE (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.36, + 0.785, + 0.401 + ], + "angle": 0, + "content": "2. Dai, P., Yu, X., Ma, L., Zhang, B., Li, J., Li, W., Shen, J., Qi, X.: Video demoireing with relation-based temporal consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17622-17631 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.402, + 0.785, + 0.456 + ], + "angle": 0, + "content": "3. Dong, X., Xu, W., Miao, Z., Ma, L., Zhang, C., Yang, J., Jin, Z., Teoh, A.B.J., Shen, J.: Abandoning the bayer-filter to see in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17431-17440 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.457, + 0.785, + 0.484 + ], + "angle": 0, + "content": "4. Gharbi, M., Chaurasia, G., Paris, S., Durand, F.: Deep joint demosaicking and denoising. ACM Transactions on Graphics (ToG) 35(6), 1-12 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.485, + 0.785, + 0.525 + ], + "angle": 0, + "content": "5. He, B., Wang, C., Shi, B., Duan, L.Y.: Mop moire patterns using mopnet. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2424-2432 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.526, + 0.785, + 0.567 + ], + "angle": 0, + "content": "6. He, B., Wang, C., Shi, B., Duan, L.Y.: Fhde 2 net: Full high definition demoireing network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 713-729. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.567, + 0.785, + 0.593 + ], + "angle": 0, + "content": "7. Huang, H., Yang, W., Hu, Y., Liu, J., Duan, L.Y.: Towards low light enhancement with raw images. IEEE Transactions on Image Processing 31, 1391-1405 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.594, + 0.785, + 0.635 + ], + "angle": 0, + "content": "8. Jin, X., Han, L.H., Li, Z., Guo, C.L., Chai, Z., Li, C.: Dnf: Decouple and feedback network for seeing in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18135-18144 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.635, + 0.785, + 0.675 + ], + "angle": 0, + "content": "9. Khashabi, D., Nowozin, S., Jancsary, J., Fitzgibbon, A.W.: Joint demosaicing and denoising via learned nonparametric random fields. IEEE Transactions on Image Processing 23(12), 4968-4981 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.676, + 0.785, + 0.717 + ], + "angle": 0, + "content": "0. Kokkinos, F., Lefkimmiatis, S.: Deep image demosaicking using a cascade of convolutional residual denoising networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 303-319 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.718, + 0.785, + 0.758 + ], + "angle": 0, + "content": "1. Lei, C., Chen, Q.: Robust reflection removal with reflection-free flash-only cues. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14811-14820 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.785, + 0.799 + ], + "angle": 0, + "content": "2. Liang, J., Cao, J., Sun, G., Zhang, K., Van Gool, L., Timofte, R.: Swinir: Image restoration using swin transformer. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1833-1844 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "3. Liu, L., Jia, X., Liu, J., Tian, Q.: Joint demosaicing and denoising with self guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2240-2249 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.351, + 0.128 + ], + "angle": 0, + "content": "S. Xu et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "14. Liu, L., Liu, J., Yuan, S., Slabaugh, G., Leonardis, A., Zhou, W., Tian, Q.: Wavelet-based dual-branch network for image demoiring. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XIII 16. pp. 86–102. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.205, + 0.787, + 0.247 + ], + "angle": 0, + "content": "15. Liu, S., Li, C., Nan, N., Zong, Z., Song, R.: Mmdm: Multi-frame and multi-scale for image demoiring. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 434-435 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.248, + 0.787, + 0.288 + ], + "angle": 0, + "content": "16. Luo, F., Wu, X., Guo, Y.: And: Adversarial neural degradation for learning blind image super-resolution. Advances in Neural Information Processing Systems 36 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.289, + 0.787, + 0.318 + ], + "angle": 0, + "content": "17. Nakamura, J.: Image sensors and signal processing for digital still cameras. CRC press (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.318, + 0.787, + 0.359 + ], + "angle": 0, + "content": "18. Niu, Y., Lin, Z., Liu, W., Guo, W.: Progressive moiré removal and texture complementation for image demoireing. IEEE Transactions on Circuits and Systems for Video Technology (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.36, + 0.787, + 0.389 + ], + "angle": 0, + "content": "19. Oh, G., Gu, H., Kim, S., Kim, J.: Fpanel: Frequency-based video demoireing using frame-level post alignment. arXiv preprint arXiv:2301.07330 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.39, + 0.787, + 0.431 + ], + "angle": 0, + "content": "20. Song, B., Zhou, J., Chen, X., Zhang, S.: Real-scene reflection removal with rawrgb image pairs. IEEE Transactions on Circuits and Systems for Video Technology (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.432, + 0.787, + 0.472 + ], + "angle": 0, + "content": "21. Sun, Y., Yu, Y., Wang, W.: Moiré photo restoration using multiresolution convolutional neural networks. IEEE Transactions on Image Processing 27(8), 4160-4172 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.474, + 0.787, + 0.515 + ], + "angle": 0, + "content": "22. Wang, C., He, B., Wu, S., Wan, R., Shi, B., Duan, L.Y.: Coarse-to-fine disentangling demoiring framework for recaptured screen images. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.516, + 0.787, + 0.558 + ], + "angle": 0, + "content": "23. Wang, H., Tian, Q., Li, L., Guo, X.: Image demoiring with a dual-domain distilling network. In: 2021 IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.559, + 0.787, + 0.6 + ], + "angle": 0, + "content": "24. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.601, + 0.787, + 0.642 + ], + "angle": 0, + "content": "25. Xing, W., Egiazarian, K.: End-to-end learning for joint image demosaicing, denoising and super-resolution. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3507-3516 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.787, + 0.685 + ], + "angle": 0, + "content": "26. Xu, S., Song, B., Chen, X., Zhou, J.: Direction-aware video demoireing with temporal-guided bilateral learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 6360-6368 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.686, + 0.787, + 0.728 + ], + "angle": 0, + "content": "27. Yu, X., Dai, P., Li, W., Ma, L., Shen, J., Li, J., Qi, X.: Towards efficient and scale-robust ultra-high-definition image demoiring. In: European Conference on Computer Vision. pp. 646-662. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.729, + 0.787, + 0.77 + ], + "angle": 0, + "content": "28. Yue, H., Cheng, Y., Liu, X., Yang, J.: Recaptured raw screen image and video demoireing via channel and spatial modulations. arXiv preprint arXiv:2310.20332 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.771, + 0.787, + 0.798 + ], + "angle": 0, + "content": "29. Yue, H., Cheng, Y., Mao, Y., Cao, C., Yang, J.: Recaptured screen image demoiring in raw domain. IEEE Transactions on Multimedia (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "30. Yue, H., Zhang, Z., Yang, J.: Real-rawvsr: Real-world raw video super-resolution with a benchmark dataset. In: European Conference on Computer Vision. pp. 608-624. Springer (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.413, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image Demoiring in RAW and sRGB Domains" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "31. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "32. Zheng, B., Yuan, S., Slabaugh, G., Leonardis, A.: Image demoiring with learnable bandpass filters. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3636-3645 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.232 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_origin.pdf b/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e88fbb0b7fe4e4a66cfe9f9818a5664b1a28120e --- /dev/null +++ b/2024/Image Demoireing in RAW and sRGB Domains/33b15e45-fde4-4f8c-a091-52c7c058922c_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4be35e0480479c2427f449b342ccb5b91277ac5021d518423d48dc389cefde04 +size 8940025 diff --git a/2024/Image Demoireing in RAW and sRGB Domains/full.md b/2024/Image Demoireing in RAW and sRGB Domains/full.md new file mode 100644 index 0000000000000000000000000000000000000000..146b26c94a3768393fc47b0b5b67dc5e4adbb3fe --- /dev/null +++ b/2024/Image Demoireing in RAW and sRGB Domains/full.md @@ -0,0 +1,377 @@ +# Image Demoiring in RAW and sRGB Domains + +Shuning Xu $^{1}$ , Binbin Song $^{1}$ , Xiangyu Chen $^{1,2}$ , Xina Liu $^{1,2}$ , and Jiantao Zhou $^{1\star}$ + +1 State Key Laboratory of Internet of Things for Smart City, + +Department of Computer and Information Science, University of Macau + +2 Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences {yc07425, yb97426, jtzhou}@um.edu.mo, chxy95@gmail.com, xn.liu95@siat.ac.cn + +Abstract. Moiré patterns frequently appear when capturing screens with smartphones or cameras, potentially compromising image quality. Previous studies suggest that moiré pattern elimination in the RAW domain offers greater effectiveness compared to demoiréing in the sRGB domain. Nevertheless, relying solely on RAW data for image demoiréing is insufficient in mitigating the color cast due to the absence of essential information required for the color correction by the image signal processor (ISP). In this paper, we propose to jointly utilize both RAW and sRGB data for image demoiréing (RRID), which are readily accessible in modern smartphones and DSLR cameras. We develop Skip-Connection-based Demoiréing Module (SCDM) with Gated Feedback Module (GFM) and Frequency Selection Module (FSM) embedded in skip-connections for the efficient and effective demoiréing of RAW and sRGB features, respectively. Subsequently, we design a RGB Guided ISP (RGISP) to learn a device-dependent ISP, assisting the process of color recovery. Extensive experiments demonstrate that our RRID outperforms state-of-the-art approaches, in terms of the performance in moiré pattern removal and color cast correction by 0.62dB in PSNR and 0.003 in SSIM. Code is available at https://github.com/rebeccaeexu/RRID. + +Keywords: Image demoiring $\cdot$ RAW domain $\cdot$ Image restoration + +# 1 Introduction + +With the increasing prevalence of smartphone cameras, it is common to record on-screen content using smartphone cameras for convenience. However, this type of photography often results in the presence of moiré patterns in the captured images. The appearance of moiré patterns is caused by the spatial frequency aliasing between the camera's color filter array (CFA) and the screen's LCD subpixel [22], resulting in an unsatisfactory visual experience. + +Moiré patterns present challenges to be eliminated due to their different scales, indistinct shapes, diverse colors, and varying frequencies. Nowadays, many learning-based image demoiring approaches [1,5,6,14,15,18,21-23,27,32] have + +![](images/1bdd2cbb1bafd946c34711cdeb771bac15311845a8708fdb4fe71cddbb9afb5b.jpg) +(a) Demoiring in sRGB domain + +![](images/4e7eb5de7f54709bbbfe958879aa9d0439aa9b96b4047447929544ec2084b2a3.jpg) +(b) Demoiring in RAW domain + +![](images/d30ed99ad346d9e0005377dfb49d349be8e0a6c830746dbf5768d10d30fa04ef.jpg) +(c) Demoiring in RAW and sRGB domains +Fig. 1: Comparison of image demoiréing in different domains. (a) Image demoiréing in sRGB domain. (b) Image demoiréing in RAW domain. (c) Our proposed RRID, which performs image demoiréing in both RAW domain and sRGB domain + +been proposed. Among the various methods employed, a commonly used approach is utilizing a multi-scale architecture to remove various sizes of moiré patterns [1,5,18,21,27]. Besides, some works advocate the leverage of frequency components and delicately design frequency-based demoiring networks [6,14,22,32]. + +The aforementioned methods are developed to demoiré in the sRGB domain, as depicted in Fig. 1(a). While this scheme seems to be the most direct approach, its effectiveness is limited in removing moiré patterns from complex scenes. The reason for this limitation probably lies in the fact that the nonlinear operations in ISP such as demosaicing deteriorate the moiré patterns originally in the RAW domain. Many schemes consequently suggest that eliminating moiré patterns in the RAW domain is more effective than performing demoiréing in the sRGB domain [28,29]. Due to the easy accessibility of RAW data in modern smartphones and DSLR cameras, image demoiréing in RAW domain can be both feasible and advantageous. RDNet [29] is the pioneering study that investigates image demoiréing in the RAW domain. They explore the demoiréing of RAW images using an encoder-decoder and class-specific learning approach, followed by the utilization of a pre-trained ISP for the RAW-to-sRGB conversion, as depicted in Fig. 1(b). Nevertheless, relying exclusively on RAW data can lead to color cast due to the uncertainty during RAW-to-sRGB conversion. + +In order to correct the color cast and make the best use of RAW and sRGB information for the moiré pattern removal, we propose to jointly utilize both RAW and sRGB data for image demoiring (RRID), as demonstrated in Fig. 1(c). We advocate that introducing paired RAW-sRGB data is advantageous to the moiré pattern removal due to the following reasons: (1) RAW pixels provide more in- + +formation compared to sRGB pixels since they are typically 12 or 14 bits. (2) Moiré patterns in the RAW domain are less apparent because they are not further affected by nonlinear operations in the ISP. (3) The paired RAW and sRGB data allows the model to learn a device-dependent ISP to aid the process of color recovery. In RRID, we adopt a multi-scale architecture in the Skip-Connection-based Demoiréing Module (SCDM), to effectively eliminate moiré patterns of different sizes. In order to effectively perform demoiréing on RAW and sRGB features, the Gated Feedback Module (GFM) and Frequency Selective Module (FSM) are integrated into skip-connections within SCDM, as opposed to brutally injecting them into the multi-scale layers. Specifically, for RAW features demoiréing, we introduce the GFM into the skip connection, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Moreover, we design the FSM for the moiré sRGB features, leveraging a learnable band stop filter to mitigate moiré patterns in the frequency domain. Subsequent to the pre-demoiréing operations, we develop the RGB Guided Image Signal Processor (RGISP) to integrate color information from the demoiréd sRGB features with the demoiréd RAW features and learn a device-dependent ISP, facilitating the color recovery process. Ultimately, for the image reconstruction, we utilize multiple Residual Swin Transformer Blocks (RSTBs) [12] and convolutions to accomplish global tone mapping and detail refinement. + +In summary, our contributions are listed as follows: + +- We propose to exploit image demoiréing in both RAW and sRGB domains. The incorporation of RAW data enhances the moiré pattern removal process, while the inclusion of sRGB data facilitates the RAW-to-sRGB conversion and aids in color restoration of images. +- We develop SCDM with specifically designed modules, GFM and FSM, embedded in the skip-connections to perform efficient and effective demoiréing on the RAW and sRGB features. +- RGISP is designed for the RAW-to-sRGB conversion, incorporating color information from the demoiréd sRGB features with demoiréd RAW features and learn a device-dependent ISP, aiding the color deviation correction. +- Our RRID surpasses state-of-the-arts methods in both qualitative and quantitative evaluations. + +# 2 Related Works + +# 2.1 Image and Video Demoiring + +The purpose of image demoiréing is to restore the original clean image by removing moiré patterns and correcting color deviations from an contaminated image. Many learning-based image demoiréing [1, 6, 15, 18, 22, 23, 32] and video demoiréing methods [2, 19, 26, 28] have been introduced to mitigate the moiré patterns. DMCNN [21] constructs the first real-world dataset for image demoiréing and proposes a multi-resolution neural network to handle moiré patterns across + +various scales. MopNet [5] devises a multi-scale aggregated network that leverages the edge guidance and pattern attributes for moiré pattern removal. WDNet [14] employs wavelet transformation to decompose images with moiré patterns into separate frequency bands and establishes a dual-branch network to restore both close-range and far-range information. FHDMi [6] formulates a two-stage approach for simultaneous removal of substantial moiré patterns while preserving image details. ESDNet [27] explores a lightweight model aimed at ultra-high-definition image demoiréing. VDMoiré [2] collects the first video demoiréing dataset and presents a baseline video demoiréing model with a relation-based temporal consistency loss. The aforementioned methods all operate in the sRGB domain. Since it has been observed that moiré patterns are less prominent in the RAW domain, some schemes advocate performing image or video demoiréing in the RAW domain. RDNet [29] introduces the first image demoiréing dataset with RAW data and conducts the demoiréing process in the RAW domain. RawVDemoiré [28] proposes a temporal alignment method for RAW video demoiréing. To remove moiré patterns in the RAW domain, the model have to simultaneously possess the capabilities of demoiréing and and RAW-to-sRGB conversion. However, previous methods encounter challenges in color recovery due to the uncertainty of RAW-to-sRGB conversion. Consequently, we propose an image demoiréing network that utilizes paired RAW-sRGB data, facilitating the color recovery process in image demoiréing. + +# 2.2 Learning-Based RAW Image Processing + +RAW pixels offer the potential for leveraging additional information due to their broader bit depth, inherently containing a great wealth of data. Early research in RAW image processing primarily centers on integrating demosaicing and denoising techniques [4,9,10,13]. RTF [9] devices a machine learning approach to the demosaicing and denoising on RAW inputs. SGNet [13] introduces a self-guidance network that leverages the inherent density-map guidance and green-channel guidance for demosaicing and denoising on the RAW images. Recently, some low-level vision tasks endorse the utilization of RAW data, including low-light enhancement [3,7,8], super-resolution [16,25,30], and reflection removal [11,20]. The majority of the aforementioned RAW image processing methods only take RAW images as input and generate restored sRGB images as output, indicating that the entire model is responsible for both the restoration and ISP tasks. CR3Net [20] presents a cascaded network that harnesses both the RGB data and their corresponding RAW versions for image reflection removal. Within CR3Net, a module is formulated to emulate point-wise mappings within the ISP, converting the features from RAW to sRGB domain. To further mitigate the color casting problem, our proposed method jointly utilize RAW and sRGB data to learn a device-dependent ISP for image demoiring. + +# 3 Methodology + +Originally caused by frequency interference between the camera's CFA and the screen's LCD subpixel, moiré patterns are further deteriorated by the nonlinear processes in ISP. Therefore, introducing RAW data for image demoiréing may offer greater effectiveness. However, relying solely on RAW data for image demoiréing is insufficient in mitigating color cast due to the uncertainty during the RAW-to-sRGB conversion. Consequently, in this work, we propose to utilize paired RAW and sRGB data, which are readily accessible in modern smartphones and DSLR cameras (e.g., iPhone 15 Pro, HUWEI P60 Pro). The RAW-sRGB pairs essentially allows the model to learn a device-dependent ISP, aiding the color recovery process. The potential applications in real-world scenarios can be described as follows. When demoiréing function is enabled, the in-device ISP generated sRGB image will not be directly outputted. Instead, together with its corresponding RAW version, will be processed by our RRID to generate a new sRGB image with much suppressed moiré patterns. Afterwards, the RAW image could be discarded, depending on settings of the camera. + +![](images/aac8f55afcfe14002d46908c5cdf05538bc96e3f19ced714ab22688cb7d957b6.jpg) + +![](images/56ae37aa0ed8b9eba9c358b87341904c203cadad1ad1e7207762d1728ae4b653.jpg) +(b) DCAB + +![](images/c47eeda6a167cfe53734375ebfad09b19ee0fb5b12a0defb8a7d3a65cd7ace5c.jpg) + +![](images/a1fca03d21e0ee6231d9bb893f83ee28054302f442086c0962a2c6704260fc11.jpg) +(d) FSM + +![](images/7c1f3f574df3bcd2d8fa73190a74cc1e2abf4b1adbc2b73fef123ab6f2446332.jpg) +(c) GFM +Fig. 2: The overview and detailed structures of our proposed RRID. + +More specifically, Fig. 2 presents an overview of our proposed RRID for image demoiring with the paired RAW and sRGB data. As for the RGB branch, the input is an sRGB image $\mathbf{I}_{rgb} \in \mathbb{R}^{H \times W \times 3}$ , where $H \times W$ represents the spatial + +resolution. Given an input RAW image, it is first packed into the 4-channel RGGB format $\mathbf{I}_{raw} \in \mathbb{R}^{\frac{H}{2} \times \frac{W}{2} \times 4}$ , which serves as the input for the RAW branch. RRID is designed to generate the final output sRGB image $(\hat{\mathbf{Y}}_{rgb})$ . + +Concretely, shallow features $\mathbf{F}_{raw}$ and $\mathbf{F}_{rgb}$ are respectively extracted from the input data $\mathbf{I}_{raw}$ and $\mathbf{I}_{rgb}$ using a convolutional layer and the Dilated Channel Attention Block (DCAB). It is worth noting that a down-sampling layer is applied to the sRGB data to ensure the uniformity of feature shapes. Then, we apply SCDM to acquire pre-demoiréd features $\mathbf{D}_{raw}$ and $\mathbf{D}_{rgb}$ in RAW branch and RGB branch, respectively. GFM is introduced in the skip-connection of SCDM for RAW features, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Similarly, FSM is utilized to mitigate moiré patterns in the frequency domain. More details will be given in Sec. 3.1. Subsequently, RGISP is designed to realize a RAW-to-sRGB conversion, generating $\mathbf{D}_{out}$ . RGISP incorporates color information from coarsely demoiréd sRGB features $\mathbf{D}_{rgb}$ in a cross-attention mechanism, which will be introduced in Sec. 3.2. For the final image reconstruction, 4 RSTBs [12] are utilized to generate sRGB output $\hat{\mathbf{Y}}_{rgb}$ for their advantages in building long-range dependencies for global tone mapping and detail refinement. + +# 3.1 Design of SCDM + +We propose SCDM, a multi-scale architecture designed to remove moiré patterns from shallow RAW features $F_{raw}$ and shallow sRGB features $F_{rgb}$ , as shown in Fig. 2(a). Unlike the vanilla U-Net, SCDM is constructed upon DCAB, facilitating the encoding and decoding of informative features within the respective layers. The features are downsampled twice in the spatial dimension during the encoding process and then upsampled to the original resolution of the input features during decoding. To emphasize the contextual information, we enhance the learned features from the corresponding layers of the encoder with additional modules at skip connections, that is GFM for RAW and FSM for sRGB. The introduction of GFM and FSM in skip-connections is also intended to enhance model efficiency. Then, we can obtain the pre-demoiréd features $\mathbf{D}_{raw}$ and $\mathbf{D}_{rgb}$ . + +DCAB. DCAB is the essential building block of encoder-decoders for performing RAW demoiréing and the RGB demoiréing, as shown in Fig. 2(b). DCAB is designed using a series of dilated convolution layers followed by ReLU activation and the channel attention mechanism. The receptive field at each block is expanded with the dilated convolution kernels, facilitating the demoiréing operations. Furthermore, by incorporating the channel attention mechanism, DCAB adaptively rescales features according to interdependencies among channels. Also, shortcuts are introduced to establish connections between the input and output of DCAB, enabling the block to learn the residual features. + +GFM. Embedded in the skip-connection of SCDM for RAW features, GFM is introduced to enable adaptive differentiation between the texture and moiré patterns through feature gating. The detailed structure of the GFM is shown in Fig. 2(c). For efficiency, we employ point-wise and depth-wise convolutions to aggregate channel and local content information, respectively. Then, the features + +are chunked along the channel dimension to generate $\mathbf{F}_{gate}$ and $\mathbf{F}_{content}$ . A pointwise multiplication is applied on $\mathbf{F}_{content}$ and $\mathbf{F}_{gate}$ after a GELU activation. During feature gating, we expect that the original image content is adaptively selected and merged along both spatial and channel dimensions. The operations can be formulated as: + +$$ +\left\{\mathbf {F} _ {\text {g a t e}}, \mathbf {F} _ {\text {c o n t e n t}} \right\} = \operatorname {D C o n v} \left(\operatorname {P C o n v} \left(\mathbf {F} _ {\text {G F M} _ {\text {i n}}}\right)\right), \tag {1} +$$ + +$$ +\mathbf {F} _ {G F M \_ o u t} = \operatorname {P C o n v} \left(\mathbf {F} _ {\text {c o n t e n t}} \odot \operatorname {G E L U} \left(\mathbf {F} _ {\text {g a t e}}\right) + \mathbf {F} _ {G F M \_ i n}\right), \tag {2} +$$ + +where DConv and PConv represent depth-wise convolution and point-wise convolution, respectively. Here, $\odot$ denotes the element-wise multiplication. + +FSM. For sRGB demoiring, we leverage a learnable band stop filter [32] to mitigate moiré patterns in the frequency domain. Considering the formation of moiré patterns is caused by the spatial frequency aliasing between the camera CFA and screen's LCD subpixel, demoiring in the frequency domain becomes a favorable approach. However, the frequency spectrum of the moiré pattern is often mixed with that of the original contents, thereby making it challenging to disentanglement. Therefore, we propose to perform the disentanglement within small patches, where the moiré patterns tend to be more pronounced in a specific range of frequency bands, facilitating the removal of moiré patterns. Inspired by Zheng et al. [32], we utilize a band stop filter to amplify certain frequencies and suppress others using Block DCT. However, obtaining the frequency prior to separate moiré patterns from normal image textures is challenging and time-consuming. To address this issue, a set of convolution layers are employed as the learnable band stop filter $\mathrm{B}(\cdot)$ to attenuate the specific frequencies of moiré patterns while preserving the original image contents. The process of the FSM can be represented as: + +$$ +\mathbf {F} _ {F S M \_ o u t} = \operatorname {I D C T} (\mathrm {B} (\mathrm {D C T} (\mathbf {F} _ {F S M \_ i n}))), \tag {3} +$$ + +where DCT and IDCT denote the process of Block DCT and the corresponding inverse process. The block size is set to $8 \times 8$ for DCT and IDCT. + +# 3.2 Design of RGISP + +RGISP is proposed to transform pre-demoiréd RAW features $\mathbf{D}_{raw}$ into sRGB domain $\mathbf{D}_{out}$ . With the assistance of pre-demoiréd sRGB features $\mathbf{D}_{rgb}$ , a device-dependent ISP can be learned in RGISP. Matrix transformation is commonly employed in the traditional ISP pipelines [17]. It enables the enhancement or conversion of image colors to another color space through a channel-wise matrix transformation, which is facilitated by globally shared settings such as environmental illumination and color space specifications [8]. Building upon this principle, we introduce matrix transformation as a means to perform color transformation, as illustrated in Fig. 3. The design of this matrix transformation is motivated by recent advancements in transposed cross-attention. Given $\mathbf{D}_{raw} \in \mathbb{R}^{C \times \frac{H}{2} \times \frac{W}{2}}$ , the vectors of query $\mathbf{Q} \in \mathbb{R}^{C \times \frac{H}{2} \times \frac{W}{2}}$ , key $\mathbf{K} \in \mathbb{R}^{\frac{H}{2} \times \frac{W}{2} \times C}$ are generated through the + +![](images/3d2cf042e8650cd046db960c1bcae92e63aba50e61bd70c1320d5b3ae43ec053.jpg) +Fig. 3: The structure of RGISP. + +projection with a $1 \times 1$ convolutional layer Conv and a flatten operation Flatten, where $C$ is the intermediate channel number. Similarly, value $\mathbf{V} \in \mathbb{R}^{C \times \frac{H}{2} \times \frac{W}{2}}$ can be produced by operations on $\mathbf{D}_{rgb} \in \mathbb{R}^{C \times \frac{H}{2} \times \frac{W}{2}}$ as: + +$$ +\left\{\mathbf {Q}, \mathbf {K} \right\} = \operatorname {F l a t t e r n} \left(\operatorname {C o n v} \left(\mathbf {D} _ {\text {r a w}}\right)\right), \tag {4} +$$ + +$$ +\mathbf {V} = \operatorname {F l a t t e n} \left(\operatorname {C o n v} \left(\mathbf {D} _ {r g b}\right)\right). \tag {5} +$$ + +Then, the transformation matrix $\mathbf{M} \in \mathbb{R}^{C \times C}$ is obtained by matrix multiplication. The procedure can be formulated as: + +$$ +\mathbf {M} = \operatorname {S o f t m a x} \left(\mathbf {Q} \cdot \mathbf {K} ^ {T} / \lambda\right), \tag {6} +$$ + +where a scaling coefficient $\lambda$ is applied for numerical stability. Subsequently, the vector $\mathbf{V}$ is transformed by the matrix $\mathbf{M}$ , performing color space conversion in feature-level. The output feature after color transformation can be obtained by $\mathbf{D}_{out} = \mathbf{M} \cdot \mathbf{V}$ . As a complement to the global matrix transformation, we use a depth-wise convolution and a point-wise convolution to refine the local details, generating the output in sRGB domain $\mathbf{D}_{out}$ . + +# 3.3 Loss Function + +To effectively remove the moiré patterns and adjust the color deviations, we introduce supervision in both RAW and sRGB domains. The overall training objective can be expressed as: + +$$ +\mathcal {L} = \alpha \| \hat {\mathbf {Y}} _ {r a w} - \mathbf {Y} _ {r a w} \| _ {1} + \| \hat {\mathbf {Y}} _ {r g b} - \mathbf {Y} _ {r g b} \| _ {1}, \tag {7} +$$ + +where $\mathbf{Y}_{raw}$ and $\mathbf{Y}_{rgb}$ are the ground-truth RAW and sRGB images, respectively. We empirically set $\alpha = 0.5$ . + +# 4 Experiments + +# 4.1 Experimental Setup + +Dataset. The experiments are conducted on the RAW image demoiréing dataset published in TMM22 [29], which contains recaptured scenes of natural images, + +documents, and webpages. In TMM22, the dataset consists of 540 RAW and sRGB image pairs with ground-truth for training, and 408 pairs for testing. To facilitate the training and comparison process, patches of size $256 \times 256$ and $512 \times 512$ are cropped respectively for the training and testing sets. The moiré images are captured using four different smartphone cameras and three display screens of varying sizes. In addition, we utilize an image demoiring dataset FHIMi [6] to verify the generalization ability of our method. FHDMi contains 9981 sRGB image pairs for training and 2019 for testing, featuring diverse and intricate moiré patterns. Notably, images in FHDMi have a higher resolution of $1920 \times 1080$ , compared to TMM22. + +Training Details. We train RRID using the AdamW optimizer with $\beta_{1} = 0.9$ and $\beta_{2} = 0.999$ . A multistep learning rate schedule is employed, with the learning rate initialized at $2 \times 10^{-4}$ . The RRID model is trained for 500 epochs using a batch size of 80 on 4 NVIDIA RTX 3090 GPUs. + +# 4.2 Quantitative Results + +We compare our approach with several image demoiréing methods in sRGB domain, including DMCNN [21], WDNet [14], ESDNet [27], and a RAW image demoiréing method RDNet [29]. We further add comparison with a low-light enhancement method DNF [8] with RAW input, a video demoiréing method RawVDmoiré [28] with RAW input, and a de-reflection method CR3Net [20] with paired RAW-sRGB data. To evaluate the performance of our proposed RRID, we adopt the following three standard metrics to assess pixel-wise accuracy and the perceptual quality: PSNR, SSIM [24], and LPIPS [31]. Additionally, the number of parameters, FLOPs, and inference time are introduced to measure the model complexity. To ensure a fair comparison, we modify the inputs of the sRGB-based models to align with the dataset requirements. Subsequently, all models are fine-tuned using the default settings as provided in their papers on TMM22 dataset. We select the better results from the pretrained and retrained models for comparison, which provides an advantage over the competing methods. + +Table. 1 presents the quantitative and the computational complexity comparisons. RRID outperforms the second-best method, RawVDmoiré, by 0.62dB in PSNR and 0.003 in SSIM. As for LPIPS, our methods accomplish the second-best result at 0.079, surpassing most of the comparison methods. Even though RRID utilizes both RAW and sRGB data as inputs, our approach can still achieve a satisfactory demoiréing effect with a inference time of merely 0.089s. Compared to previous methods, our RRID demonstrates superiority with acceptable parameters and FLOPs, further demonstrating the superiority of our approach. + +To verify the generalization performance of our method, we conduct additional experiments on an image demoiréing dataset FHIMi [6]. In order to adapt to the FHDMi dataset with sRGB data as input, the RAW branch and RGISP are removed. We select methods tailored for image demoiréing: DMCNN [21], MopNet [5], MBCNN [32], FHDe²Net [6], and ESDNet [27] for comparison, as shown in Table 2. Although RRID is initially designed for demoiréing on the RAW-sRGB image pairs, it still achieves the second-best performance by 24.39dB in + +Table 1: Quantitative comparison with the state-of-the-art demoiring approaches and RAW image restoration methods on TMM22 dataset [29] in terms of average PSNR, SSIM, LPIPS and computational complexity. The best results are highlighted with bold. The second-best results are highlighted with underline. + +
IndexMethods
DMCNN [21]WDNet [14]ESDNet [27]RDNet [29]DNF [8]RawVDmoiré [28]CR3Net [20]RRID (Ours)
# Input typesRGBsRGBsRGBRAWRAWRAWsRGB+RAWsRGB+RAW
PSNR↑23.5422.3326.7726.1623.5527.2623.7527.88
SSIM↑0.8850.8020.9270.9210.8950.9350.9220.938
LPIPS↓0.1540.1660.0890.0910.1620.0750.1020.079
Params (M)1.553.365.936.041.255.332.682.38
TFLOPs0.1020.0550.1410.1610.0130.0220.8830.093
Inference time (s)0.0520.2840.1151.0940.0700.1820.0580.089
+ +Table 2: Quantitative comparison on FHDMi dataset [6]. + +
MethodPSNR↑SSIM↑
DMCNN [21]21.540.773
MopNet [5]22.760.796
MBCNN [32]22.310.810
FHDe2Net [6]22.930.789
ESDNet [27]24.500.835
Ours24.390.830
+ +PSNR and 0.830 in SSIM. Compared to ESDNet, an image demoiréing network designed for ultra-high-definition sRGB images with more than twice of the parameters, RRID also yields competitive results. The qualitative results on the FHDMi dataset demonstrate that our method can not only perform well in demoiréing on RAW-sRGB pairs but also solve sRGB image demoiréing, exhibiting a certain degree of generalization. + +# 4.3 Qualitative Results + +We present visual comparisons among our approach and the existing methods in Fig. 4. The results demonstrate the advantage of RRID in effectively removing moiré artifacts and correcting color deviations. For the first scene demonstrating a recaptured flower with moiré patterns, previous methods tend to exhibit residual moiré patterns in their restored images. While ESDNet successfully eliminates a significant portion of these patterns, it struggles to accurately restore the original colors of the image. Apart from natural scenes, we also present a case of webpages contaminated with moiré patterns. Through the utilization of both RAW and sRGB data, our approach eliminates moiré patterns while preserving fine image details, even in scenarios characterized by severe color deviations. This ensures a more accurate restoration of the original colors and results in + +enhanced visual effects. Additional qualitative comparisons can be found in the supplementary file. + +![](images/9c9f336e2cef45564864c7b6db5cf7f7204f70d22aaa8079a8d5b6376f53b980.jpg) + +![](images/2e149b2198fcb9ee97d20bb5a1c0ef9bf610e6475b0616e1c6080ba7cbdb3709.jpg) + +![](images/e54e2dc1e187fd4e1f264b4d87dbb326c8627f080135aee8fec8f4c03eb4d698.jpg) + +![](images/3d4ed83046226f916ede0ea01535a374d6cac7899d2c6b72c0be98dce8e69856.jpg) + +![](images/42bb3e45068fb0ed4bb94feeef0c011f720824dbdd5f2acdf4cb6419b21665fd.jpg) + +![](images/5e6d00095ab0665a1c51a8c09b5109764043d79042dfc69c13a9140e01be3f3f.jpg) +(a) Input +(f) DNF + +![](images/4aa5c2adcf3de1a30b3d4d84e5338c7894be9bf656fa82ba3564a1e3c370065f.jpg) +(b) DMCNN +(g) RawVDmoire + +![](images/4fbbd5d9e3f596aa2122f5a95d88355aec9b3b2ea931a45fb0f79580d04c77d6.jpg) +(c)WDNet +(h) CR3Net + +![](images/14fd6d1959030c19022658774132ef8d0e8e00851d8d72570c5c91894bdec690.jpg) +(d) ESDNet +(i) Ours + +![](images/91087fc72da76eafee253335349ca0f2942f5d5f98ecec51bc149d39135063b5.jpg) +(e) RDNet +(j) GT + +![](images/5681569d394b4cba1def26717664345f6430b31656d071b99cf99473c98878cb.jpg) +(a) Input + +![](images/f00610528698cfdf2e0f58b3968445c752fbfc8d40564b5daae45524ab7e8efe.jpg) +(b)DMCNN + +![](images/102c68559fb0281c28b5990aa8c395c462ac0f859af1e1606f48c298fabb07d0.jpg) +(c)WDNet + +![](images/ac9c2b0a114d300bc1fc235bd1177f9634617556b7cda6c245a2685f65459d33.jpg) +(d) ESDNet + +![](images/432707277670fd54e7d9bf46d7594235a9a9f1834e24ba2479b4c0b6e95e3d05.jpg) +(e) RDNet + +![](images/095367a97b1b4018bc61fbec4ca39202c3f62c900a6af4b3bdd3535be7df3699.jpg) +(f) DNF +Fig. 4: Qualitative comparison on RAW image demoiring TMM22 dataset [29]. + +![](images/0e96bf74c566584724d164d2d12667d7305105f2076d2cf92ed30c85ffac19f4.jpg) +(g) RawVDmoire + +![](images/eaf5ae097eca6311e1fabd7d6fd131a36d11995963f01d8ca6eff63aed951448.jpg) +(h) CR3Net + +![](images/d87fe77121dc9257eb73ede4c9cc7ba9708805bd4a50d15809fe2a1d45f67923.jpg) +(i) Ours + +![](images/da4f230766a9f99a60f77010ccd8522d89359081e7484e957f15d2ba42ab4b74.jpg) +(j) GT + +# 4.4 Ablation Study + +1) Ablation study on the model architecture and inputs. In Table 3, we investigate the architecture and inputs of RRID and validate the importance of different individual components in the whole RRID. We conduct this ablation study by comparing the proposed RRID and the following variants of RRID: + +- $B_{1}$ . Both the RAW input and the RAW demoiréing branch are removed. Due to the lack of RAW features, the entire RGISP is also deleted. +- $B_{2}$ . Both the sRGB input and sRGB demoiring branch are removed. +- $B_{3}$ . The sRGB input is substituted with RAW input. The input channel number is adjusted, while the rest of the architecture is kept unchanged. + +- $B_{4}$ . We replace RGISP with a two convolutional layers after a concatenation of the RAW and sRGB features. +- $B_{5}$ . Reconstruction module is replaced with two convolutional layers. +- $B_{6}$ . The full model of RRID with both RAW and sRGB images as input. + +Table 3: Comparison of baseline models for the evaluation of architecture and inputs. + +
ModelsPSNR↑SSIM↑
B1 (w/o RAW in and RAW branch)25.790.915
B2 (w/o sRGB in and sRGB branch)27.240.929
B3 (w/o sRGB in)26.510.923
B4 (w/o RGISP)27.380.932
B5 (w/o Reconstruction)26.930.926
B6 (full version)27.880.938
+ +Our proposed RRID leverages paired RAW-sRGB data as input. Removing the RAW input and its corresponding RAW demoiréing module $(B_{1})$ results in a drastic decrease in PSNR of approximately 2dB. Likewise, eliminating the sRGB input and its corresponding RGB demoiréing module $(B_{2})$ leads to a PSNR of only 27.24dB. In addition to the decline in numerical metrics, we can also assess + +![](images/efaa1f65297db777e4ea4f6908cf3b9e3aed0ea3db355f3132d2b085a7ce4f88.jpg) +(a) Input + +![](images/d8c8f94c4eb0e762e4d8790f08e78f3a51340d823bddebb26835d8051d9c805a.jpg) +(b) $B_{j}$ + +![](images/1fda4f9cfa609639689a85b44af3524b3a4c51baf1b04905da030017b93e3c1e.jpg) +(c) $B_{2}$ + +![](images/d3d356c7d8f71ee2d870f257afa57fcf7cbe818f2201e17b6378a0f5f4c5d6b3.jpg) +(d) $B_{3}$ + +![](images/157d6a807becad0adce8c50ecfdc8d0016aebcfa8d3ce90c3c4da27e43873f74.jpg) +(e) $B_{4}$ + +![](images/7c2d18f0c745eadb1e33d99ac5cdc454713c3524ca921b43428b5023c0bc6727.jpg) +(f) $B_{5}$ + +![](images/d7b87538de6e3f5af6d1ca388041a24aefe248eade1d9e49b3a534f87ac6c6f3.jpg) +(g) $B_{6}$ (Ours) +Fig. 5: Visualization of the ablation study for architecture and inputs comparison. + +![](images/4491d383ba8ad575699206e9adeb980d67f9e0bc59ded3f586c569483e60f428.jpg) +(h) GT + +the visual performance from Fig. 5. When relying only on sRGB data and its corresponding demoiréing modules, moiré patterns are less effectively removed, as depicted in Fig.5(b). Conversely, Fig.5(c) demonstrates that using only RAW data as input generates images with more pronounced color deviations. To further validate the significance of RAW input for image demoiréing, we compare $B_{3}$ to $B_{1}$ by solely removing the RAW input data while retaining the remaining + +model structures. Although $B_{3}$ demonstrates some improvements in numerical metrics compared to $B_{1}$ , its performance remains unsatisfactory due to the lack of information provided by the RAW input and the fact that the original RAW demoiring module is specifically designed for RAW data. Additionally, we conducted further comparisons by removing the originally designed RGISP $(B_{4})$ and Reconstruction modules $(B_{5})$ , resulting in inferior numerical metrics and performance in Fig. 5 compared to the complete RRID model $(B_{6})$ . + +2) Ablation study on SCDM. SCDM is designed to perform effective demoiréing on both RAW and sRGB features. More specifically, we introduce GFM for RAW features demoiréing and FSM for sRGB features demoiréing. + +Table 4: Ablation study on SCDM. + +
ModelsPSNR↑SSIM↑
S1 (w/o GFM & FSM)27.000.926
S2 (w/o GFM)27.170.927
S3 (w/o FSM)27.390.930
S4 (all GSM)27.500.933
S5 (all FSM)27.320.930
S6 (w/o DCAB)26.550.923
S7 (SCDM)27.880.938
+ +Table 4 demonstrates the effectiveness and indispensability of the meticulously designed GFM and FSM integrated within the skip-connections. Removing the demoiréing modules on the skip-connections $(S_{1} - S_{3})$ individually result in varying degrees of performance decline of the model. For instance, removing both GFM and FSM leads to only $27.00\mathrm{dB}$ in PSNR. Furthermore, Fig.6(b) demonstrates that the model's ability to remove moiré patterns decreases upon removing the GFM and FSM modules. Furthermore, to assess the specificity of GFM and FSM, we substitute the original modules in $S_{4}$ and $S_{5}$ , respectively. Despite no reduction in the number of parameters, the PSNR decreases by approximately $0.3 - 0.5\mathrm{dB}$ . Since DCAB is a crucial component module in SCDM, we substitute DCAB with two convolutional layers to confirm its necessity. Fig. 6(c) showcases more residual moiré patterns and significant color deviation compared to our complete SCDM presented in Fig.6(d). + +![](images/18d3f9da6629fc20ce7f7b7ca98b10c6a0670849870666aaea85eec791e60a84.jpg) +(a) Input + +![](images/a3975cb4f28caadfc507099f7ab9ce9d4fea6739cd5844c69ea8fe8072838ecc.jpg) +(b) $\mathbf{S}_I$ + +![](images/d706a6c4ab0a0d8b29dad4e179bc8959ba36ffa94279a973cb65e670c7750206.jpg) +(c) $\mathbf{S}_6$ + +![](images/5d3b05be7c5365006610745e614f77592d639798281b808c40274e4026d0158d.jpg) +(d) $\mathbf{S}_7$ +Fig. 6: Visualization of the ablation study for SCDM. + +![](images/97a477c8c55c0532a644d36951765927078ec6102b864e7ef902e76ab43ce2c0.jpg) +(e) GT + +![](images/df7d9e7f83cbcf640c1849682c4500dc91fd598f2af3295f7b4d34b704afab75.jpg) +(a) Input + +![](images/615a7489443f6914a2e63ef93029848b277457c18958147a43b5e8a3b9d0b977.jpg) +(b) $\mathbb{R}_I$ +Fig. 7: Visualization of the ablation study for RGISP. + +![](images/f4979ad29938c053463e90e548b326a98242f05bf0ddf93174f5aa74ee76e194.jpg) +(c) $\mathbb{R}_2$ + +![](images/540201f4470d44a96833f758d4166000fc29483a6128c8a4f1923e1b4064bea8.jpg) +(d) $\mathbb{R}_3$ + +![](images/c84a593de65bc3b593604d559f989947da9e40bcd3eddb86206fe080875e0287.jpg) + +3) Ablation study on RGISP. RGISP is designed to integrate color information from the coarsely demoiréd sRGB features during the ISP stage, facilitating the color recovery process. The process of the RGISP can be recognized as a cross-attention mechanism. To assess the efficacy of the RGISP design, we compare the following structures in Table 5. For $R_{1}$ , we concatenate the pre-demoiréd RAW features with the sRGB features and subsequently apply a self-attention mechanism. In $R_{2}$ , the pre-demoiréd RAW features undergo a self-attention mechanism and are then concatenated with the pre-demoiréd sRGB features. Table 5 shows that our proposed RGISP surpasses the self-attention mechanisms $(R_{1}, R_{2})$ , as well as other RAW-to-sRGB conversion methods RRM [20] $(R_{3})$ . In addition, Fig. 7 depicts a webpage with globally distributed moiré pat + +Table 5: Ablation study on RGISP. + +
ModelsPSNR↑SSIM↑
R1(self-atten([raw,rgb]))27.540.933
R2(self-atten(raw),rgb])27.420.931
R3(RRM)27.210.929
R4(RGISP)27.880.938
+ +terns. $R_{1} - R_{4}$ are all capable of effectively removing the moiré patterns, but $R_{4}$ exhibits the best performance in correcting color deviation. With the introduction of sRGB pre-demoiréd features, RGISP is able to learn a device-dependent ISP and restore the original colors of the image effectively. + +# 5 Conclusion + +In this paper, we propose to jointly utilize RAW and sRGB data for image demoiréing (RRID). Firstly, we introduce SCDM with GFM and FSM embedded in skip-connections to handle the demoiréing of RAW and sRGB features, respectively. Additionally, we present RGISP to learn a device-dependent ISP, aiding the color recovery process. Extensive experiments demonstrate the superior performance of our RRID method in both moiré pattern removal and color cast correction. Our approach outperforms state-of-the-art methods by 0.62dB in PSNR and 0.003 in SSIM. + +# Acknowledgements + +This work was supported in part by Macau Science and Technology Development Fund under SKLIOTSC-2021-2023, 0072/2020/AMJ, 0022/2022/A, and 0014/2022/AFJ; in part by Research Committee at University of Macau under MYRG-GRG2023-00058-FST-UMDF and MYRG2022-00152-FST; in part by Natural Science Foundation of Guangdong Province of China under EF2023-00116-FST. + +# References + +1. Cheng, X., Fu, Z., Yang, J.: Multi-scale dynamic feature encoding network for image demoiring. In: 2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW). pp. 3486-3493. IEEE (2019) +2. Dai, P., Yu, X., Ma, L., Zhang, B., Li, J., Li, W., Shen, J., Qi, X.: Video demoireing with relation-based temporal consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17622-17631 (2022) +3. Dong, X., Xu, W., Miao, Z., Ma, L., Zhang, C., Yang, J., Jin, Z., Teoh, A.B.J., Shen, J.: Abandoning the bayer-filter to see in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17431-17440 (2022) +4. Gharbi, M., Chaurasia, G., Paris, S., Durand, F.: Deep joint demosaicking and denoising. ACM Transactions on Graphics (ToG) 35(6), 1-12 (2016) +5. He, B., Wang, C., Shi, B., Duan, L.Y.: Mop moire patterns using mopnet. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2424-2432 (2019) +6. He, B., Wang, C., Shi, B., Duan, L.Y.: Fhde 2 net: Full high definition demoireing network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 713-729. Springer (2020) +7. Huang, H., Yang, W., Hu, Y., Liu, J., Duan, L.Y.: Towards low light enhancement with raw images. IEEE Transactions on Image Processing 31, 1391-1405 (2022) +8. Jin, X., Han, L.H., Li, Z., Guo, C.L., Chai, Z., Li, C.: Dnf: Decouple and feedback network for seeing in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18135-18144 (2023) +9. Khashabi, D., Nowozin, S., Jancsary, J., Fitzgibbon, A.W.: Joint demosaicing and denoising via learned nonparametric random fields. IEEE Transactions on Image Processing 23(12), 4968-4981 (2014) +0. Kokkinos, F., Lefkimmiatis, S.: Deep image demosaicking using a cascade of convolutional residual denoising networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 303-319 (2018) +1. Lei, C., Chen, Q.: Robust reflection removal with reflection-free flash-only cues. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14811-14820 (2021) +2. Liang, J., Cao, J., Sun, G., Zhang, K., Van Gool, L., Timofte, R.: Swinir: Image restoration using swin transformer. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1833-1844 (2021) +3. Liu, L., Jia, X., Liu, J., Tian, Q.: Joint demosaicing and denoising with self guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2240-2249 (2020) + +14. Liu, L., Liu, J., Yuan, S., Slabaugh, G., Leonardis, A., Zhou, W., Tian, Q.: Wavelet-based dual-branch network for image demoiring. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XIII 16. pp. 86–102. Springer (2020) +15. Liu, S., Li, C., Nan, N., Zong, Z., Song, R.: Mmdm: Multi-frame and multi-scale for image demoiring. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 434-435 (2020) +16. Luo, F., Wu, X., Guo, Y.: And: Adversarial neural degradation for learning blind image super-resolution. Advances in Neural Information Processing Systems 36 (2024) +17. Nakamura, J.: Image sensors and signal processing for digital still cameras. CRC press (2017) +18. Niu, Y., Lin, Z., Liu, W., Guo, W.: Progressive moiré removal and texture complementation for image demoireing. IEEE Transactions on Circuits and Systems for Video Technology (2023) +19. Oh, G., Gu, H., Kim, S., Kim, J.: Fpanel: Frequency-based video demoireing using frame-level post alignment. arXiv preprint arXiv:2301.07330 (2023) +20. Song, B., Zhou, J., Chen, X., Zhang, S.: Real-scene reflection removal with rawrgb image pairs. IEEE Transactions on Circuits and Systems for Video Technology (2023) +21. Sun, Y., Yu, Y., Wang, W.: Moiré photo restoration using multiresolution convolutional neural networks. IEEE Transactions on Image Processing 27(8), 4160-4172 (2018) +22. Wang, C., He, B., Wu, S., Wan, R., Shi, B., Duan, L.Y.: Coarse-to-fine disentangling demoiring framework for recaptured screen images. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023) +23. Wang, H., Tian, Q., Li, L., Guo, X.: Image demoiring with a dual-domain distilling network. In: 2021 IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2021) +24. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) +25. Xing, W., Egiazarian, K.: End-to-end learning for joint image demosaicing, denoising and super-resolution. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3507-3516 (2021) +26. Xu, S., Song, B., Chen, X., Zhou, J.: Direction-aware video demoireing with temporal-guided bilateral learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 6360-6368 (2024) +27. Yu, X., Dai, P., Li, W., Ma, L., Shen, J., Li, J., Qi, X.: Towards efficient and scale-robust ultra-high-definition image demoiring. In: European Conference on Computer Vision. pp. 646-662. Springer (2022) +28. Yue, H., Cheng, Y., Liu, X., Yang, J.: Recaptured raw screen image and video demoireing via channel and spatial modulations. arXiv preprint arXiv:2310.20332 (2023) +29. Yue, H., Cheng, Y., Mao, Y., Cao, C., Yang, J.: Recaptured screen image demoiring in raw domain. IEEE Transactions on Multimedia (2022) +30. Yue, H., Zhang, Z., Yang, J.: Real-rawvsr: Real-world raw video super-resolution with a benchmark dataset. In: European Conference on Computer Vision. pp. 608-624. Springer (2022) + +31. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018) +32. Zheng, B., Yuan, S., Slabaugh, G., Leonardis, A.: Image demoiring with learnable bandpass filters. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3636-3645 (2020) \ No newline at end of file diff --git a/2024/Image Demoireing in RAW and sRGB Domains/images.zip b/2024/Image Demoireing in RAW and sRGB Domains/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..6d07042b1d62bbaf65ea9f887a841100add270ca --- /dev/null +++ b/2024/Image Demoireing in RAW and sRGB Domains/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:59eb05ee0e848df9e8dd31556c2beab04f71e65ba900a758f03745163d21bc81 +size 576445 diff --git a/2024/Image Demoireing in RAW and sRGB Domains/layout.json b/2024/Image Demoireing in RAW and sRGB Domains/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..de2ef1393588264b340b301ad5fa70e76761875e --- /dev/null +++ b/2024/Image Demoireing in RAW and sRGB Domains/layout.json @@ -0,0 +1,11187 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 139, + 112, + 474, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 112, + 474, + 129 + ], + "spans": [ + { + "bbox": [ + 139, + 112, + 474, + 129 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "text", + "content": "Shuning Xu" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "text", + "content": ", Binbin Song" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "text", + "content": ", Xiangyu Chen" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "text", + "content": ", Xina Liu" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "text", + "content": ", and Jiantao Zhou" + }, + { + "bbox": [ + 132, + 150, + 481, + 164 + ], + "type": "inline_equation", + "content": "^{1\\star}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 181, + 172, + 432, + 184 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 172, + 432, + 184 + ], + "spans": [ + { + "bbox": [ + 181, + 172, + 432, + 184 + ], + "type": "text", + "content": "1 State Key Laboratory of Internet of Things for Smart City," + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 184, + 452, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 184, + 452, + 194 + ], + "spans": [ + { + "bbox": [ + 160, + 184, + 452, + 194 + ], + "type": "text", + "content": "Department of Computer and Information Science, University of Macau" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 194, + 481, + 217 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 481, + 217 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 481, + 217 + ], + "type": "text", + "content": "2 Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences {yc07425, yb97426, jtzhou}@um.edu.mo, chxy95@gmail.com, xn.liu95@siat.ac.cn" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 160, + 251, + 454, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 251, + 454, + 460 + ], + "spans": [ + { + "bbox": [ + 160, + 251, + 454, + 460 + ], + "type": "text", + "content": "Abstract. Moiré patterns frequently appear when capturing screens with smartphones or cameras, potentially compromising image quality. Previous studies suggest that moiré pattern elimination in the RAW domain offers greater effectiveness compared to demoiréing in the sRGB domain. Nevertheless, relying solely on RAW data for image demoiréing is insufficient in mitigating the color cast due to the absence of essential information required for the color correction by the image signal processor (ISP). In this paper, we propose to jointly utilize both RAW and sRGB data for image demoiréing (RRID), which are readily accessible in modern smartphones and DSLR cameras. We develop Skip-Connection-based Demoiréing Module (SCDM) with Gated Feedback Module (GFM) and Frequency Selection Module (FSM) embedded in skip-connections for the efficient and effective demoiréing of RAW and sRGB features, respectively. Subsequently, we design a RGB Guided ISP (RGISP) to learn a device-dependent ISP, assisting the process of color recovery. Extensive experiments demonstrate that our RRID outperforms state-of-the-art approaches, in terms of the performance in moiré pattern removal and color cast correction by 0.62dB in PSNR and 0.003 in SSIM. Code is available at https://github.com/rebeccaeexu/RRID." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 472, + 432, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 472, + 432, + 483 + ], + "spans": [ + { + "bbox": [ + 160, + 472, + 432, + 483 + ], + "type": "text", + "content": "Keywords: Image demoiring " + }, + { + "bbox": [ + 160, + 472, + 432, + 483 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 472, + 432, + 483 + ], + "type": "text", + "content": " RAW domain " + }, + { + "bbox": [ + 160, + 472, + 432, + 483 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 472, + 432, + 483 + ], + "type": "text", + "content": " Image restoration" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 506, + 230, + 518 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 506, + 230, + 518 + ], + "spans": [ + { + "bbox": [ + 132, + 506, + 230, + 518 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 535, + 482, + 606 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 535, + 482, + 606 + ], + "spans": [ + { + "bbox": [ + 130, + 535, + 482, + 606 + ], + "type": "text", + "content": "With the increasing prevalence of smartphone cameras, it is common to record on-screen content using smartphone cameras for convenience. However, this type of photography often results in the presence of moiré patterns in the captured images. The appearance of moiré patterns is caused by the spatial frequency aliasing between the camera's color filter array (CFA) and the screen's LCD subpixel [22], resulting in an unsatisfactory visual experience." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 608, + 482, + 644 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 608, + 482, + 644 + ], + "spans": [ + { + "bbox": [ + 130, + 608, + 482, + 644 + ], + "type": "text", + "content": "Moiré patterns present challenges to be eliminated due to their different scales, indistinct shapes, diverse colors, and varying frequencies. Nowadays, many learning-based image demoiring approaches [1,5,6,14,15,18,21-23,27,32] have" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 238, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 238, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 238, + 665 + ], + "type": "text", + "content": "* Corresponding Author." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 203, + 114, + 411, + 150 + ], + "blocks": [ + { + "bbox": [ + 203, + 114, + 411, + 150 + ], + "lines": [ + { + "bbox": [ + 203, + 114, + 411, + 150 + ], + "spans": [ + { + "bbox": [ + 203, + 114, + 411, + 150 + ], + "type": "image", + "image_path": "1bdd2cbb1bafd946c34711cdeb771bac15311845a8708fdb4fe71cddbb9afb5b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 263, + 152, + 355, + 160 + ], + "lines": [ + { + "bbox": [ + 263, + 152, + 355, + 160 + ], + "spans": [ + { + "bbox": [ + 263, + 152, + 355, + 160 + ], + "type": "text", + "content": "(a) Demoiring in sRGB domain" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 203, + 167, + 410, + 204 + ], + "blocks": [ + { + "bbox": [ + 203, + 167, + 410, + 204 + ], + "lines": [ + { + "bbox": [ + 203, + 167, + 410, + 204 + ], + "spans": [ + { + "bbox": [ + 203, + 167, + 410, + 204 + ], + "type": "image", + "image_path": "4e7eb5de7f54709bbbfe958879aa9d0439aa9b96b4047447929544ec2084b2a3.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 261, + 204, + 352, + 213 + ], + "lines": [ + { + "bbox": [ + 261, + 204, + 352, + 213 + ], + "spans": [ + { + "bbox": [ + 261, + 204, + 352, + 213 + ], + "type": "text", + "content": "(b) Demoiring in RAW domain" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 203, + 221, + 410, + 294 + ], + "blocks": [ + { + "bbox": [ + 203, + 221, + 410, + 294 + ], + "lines": [ + { + "bbox": [ + 203, + 221, + 410, + 294 + ], + "spans": [ + { + "bbox": [ + 203, + 221, + 410, + 294 + ], + "type": "image", + "image_path": "d30ed99ad346d9e0005377dfb49d349be8e0a6c830746dbf5768d10d30fa04ef.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 247, + 296, + 371, + 305 + ], + "lines": [ + { + "bbox": [ + 247, + 296, + 371, + 305 + ], + "spans": [ + { + "bbox": [ + 247, + 296, + 371, + 305 + ], + "type": "text", + "content": "(c) Demoiring in RAW and sRGB domains" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 315, + 482, + 350 + ], + "lines": [ + { + "bbox": [ + 130, + 315, + 482, + 350 + ], + "spans": [ + { + "bbox": [ + 130, + 315, + 482, + 350 + ], + "type": "text", + "content": "Fig. 1: Comparison of image demoiréing in different domains. (a) Image demoiréing in sRGB domain. (b) Image demoiréing in RAW domain. (c) Our proposed RRID, which performs image demoiréing in both RAW domain and sRGB domain" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 375, + 480, + 424 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 375, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 130, + 375, + 480, + 424 + ], + "type": "text", + "content": "been proposed. Among the various methods employed, a commonly used approach is utilizing a multi-scale architecture to remove various sizes of moiré patterns [1,5,18,21,27]. Besides, some works advocate the leverage of frequency components and delicately design frequency-based demoiring networks [6,14,22,32]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 425, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 425, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 425, + 482, + 605 + ], + "type": "text", + "content": "The aforementioned methods are developed to demoiré in the sRGB domain, as depicted in Fig. 1(a). While this scheme seems to be the most direct approach, its effectiveness is limited in removing moiré patterns from complex scenes. The reason for this limitation probably lies in the fact that the nonlinear operations in ISP such as demosaicing deteriorate the moiré patterns originally in the RAW domain. Many schemes consequently suggest that eliminating moiré patterns in the RAW domain is more effective than performing demoiréing in the sRGB domain [28,29]. Due to the easy accessibility of RAW data in modern smartphones and DSLR cameras, image demoiréing in RAW domain can be both feasible and advantageous. RDNet [29] is the pioneering study that investigates image demoiréing in the RAW domain. They explore the demoiréing of RAW images using an encoder-decoder and class-specific learning approach, followed by the utilization of a pre-trained ISP for the RAW-to-sRGB conversion, as depicted in Fig. 1(b). Nevertheless, relying exclusively on RAW data can lead to color cast due to the uncertainty during RAW-to-sRGB conversion." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "In order to correct the color cast and make the best use of RAW and sRGB information for the moiré pattern removal, we propose to jointly utilize both RAW and sRGB data for image demoiring (RRID), as demonstrated in Fig. 1(c). We advocate that introducing paired RAW-sRGB data is advantageous to the moiré pattern removal due to the following reasons: (1) RAW pixels provide more in-" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 355 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 355 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 355 + ], + "type": "text", + "content": "formation compared to sRGB pixels since they are typically 12 or 14 bits. (2) Moiré patterns in the RAW domain are less apparent because they are not further affected by nonlinear operations in the ISP. (3) The paired RAW and sRGB data allows the model to learn a device-dependent ISP to aid the process of color recovery. In RRID, we adopt a multi-scale architecture in the Skip-Connection-based Demoiréing Module (SCDM), to effectively eliminate moiré patterns of different sizes. In order to effectively perform demoiréing on RAW and sRGB features, the Gated Feedback Module (GFM) and Frequency Selective Module (FSM) are integrated into skip-connections within SCDM, as opposed to brutally injecting them into the multi-scale layers. Specifically, for RAW features demoiréing, we introduce the GFM into the skip connection, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Moreover, we design the FSM for the moiré sRGB features, leveraging a learnable band stop filter to mitigate moiré patterns in the frequency domain. Subsequent to the pre-demoiréing operations, we develop the RGB Guided Image Signal Processor (RGISP) to integrate color information from the demoiréd sRGB features with the demoiréd RAW features and learn a device-dependent ISP, facilitating the color recovery process. Ultimately, for the image reconstruction, we utilize multiple Residual Swin Transformer Blocks (RSTBs) [12] and convolutions to accomplish global tone mapping and detail refinement." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 357, + 373, + 367 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 357, + 373, + 367 + ], + "spans": [ + { + "bbox": [ + 146, + 357, + 373, + 367 + ], + "type": "text", + "content": "In summary, our contributions are listed as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 139, + 377, + 479, + 520 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 139, + 377, + 479, + 423 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 377, + 479, + 423 + ], + "spans": [ + { + "bbox": [ + 139, + 377, + 479, + 423 + ], + "type": "text", + "content": "- We propose to exploit image demoiréing in both RAW and sRGB domains. The incorporation of RAW data enhances the moiré pattern removal process, while the inclusion of sRGB data facilitates the RAW-to-sRGB conversion and aids in color restoration of images." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 139, + 426, + 479, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 426, + 479, + 459 + ], + "spans": [ + { + "bbox": [ + 139, + 426, + 479, + 459 + ], + "type": "text", + "content": "- We develop SCDM with specifically designed modules, GFM and FSM, embedded in the skip-connections to perform efficient and effective demoiréing on the RAW and sRGB features." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 139, + 462, + 479, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 462, + 479, + 496 + ], + "spans": [ + { + "bbox": [ + 139, + 462, + 479, + 496 + ], + "type": "text", + "content": "- RGISP is designed for the RAW-to-sRGB conversion, incorporating color information from the demoiréd sRGB features with demoiréd RAW features and learn a device-dependent ISP, aiding the color deviation correction." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 139, + 499, + 479, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 499, + 479, + 520 + ], + "spans": [ + { + "bbox": [ + 139, + 499, + 479, + 520 + ], + "type": "text", + "content": "- Our RRID surpasses state-of-the-arts methods in both qualitative and quantitative evaluations." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 544, + 242, + 555 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 242, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 242, + 555 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 571, + 308, + 583 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 571, + 308, + 583 + ], + "spans": [ + { + "bbox": [ + 132, + 571, + 308, + 583 + ], + "type": "text", + "content": "2.1 Image and Video Demoiring" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "The purpose of image demoiréing is to restore the original clean image by removing moiré patterns and correcting color deviations from an contaminated image. Many learning-based image demoiréing [1, 6, 15, 18, 22, 23, 32] and video demoiréing methods [2, 19, 26, 28] have been introduced to mitigate the moiré patterns. DMCNN [21] constructs the first real-world dataset for image demoiréing and proposes a multi-resolution neural network to handle moiré patterns across" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 369 + ], + "type": "text", + "content": "various scales. MopNet [5] devises a multi-scale aggregated network that leverages the edge guidance and pattern attributes for moiré pattern removal. WDNet [14] employs wavelet transformation to decompose images with moiré patterns into separate frequency bands and establishes a dual-branch network to restore both close-range and far-range information. FHDMi [6] formulates a two-stage approach for simultaneous removal of substantial moiré patterns while preserving image details. ESDNet [27] explores a lightweight model aimed at ultra-high-definition image demoiréing. VDMoiré [2] collects the first video demoiréing dataset and presents a baseline video demoiréing model with a relation-based temporal consistency loss. The aforementioned methods all operate in the sRGB domain. Since it has been observed that moiré patterns are less prominent in the RAW domain, some schemes advocate performing image or video demoiréing in the RAW domain. RDNet [29] introduces the first image demoiréing dataset with RAW data and conducts the demoiréing process in the RAW domain. RawVDemoiré [28] proposes a temporal alignment method for RAW video demoiréing. To remove moiré patterns in the RAW domain, the model have to simultaneously possess the capabilities of demoiréing and and RAW-to-sRGB conversion. However, previous methods encounter challenges in color recovery due to the uncertainty of RAW-to-sRGB conversion. Consequently, we propose an image demoiréing network that utilizes paired RAW-sRGB data, facilitating the color recovery process in image demoiréing." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 407, + 362, + 420 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 362, + 420 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 362, + 420 + ], + "type": "text", + "content": "2.2 Learning-Based RAW Image Processing" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": "RAW pixels offer the potential for leveraging additional information due to their broader bit depth, inherently containing a great wealth of data. Early research in RAW image processing primarily centers on integrating demosaicing and denoising techniques [4,9,10,13]. RTF [9] devices a machine learning approach to the demosaicing and denoising on RAW inputs. SGNet [13] introduces a self-guidance network that leverages the inherent density-map guidance and green-channel guidance for demosaicing and denoising on the RAW images. Recently, some low-level vision tasks endorse the utilization of RAW data, including low-light enhancement [3,7,8], super-resolution [16,25,30], and reflection removal [11,20]. The majority of the aforementioned RAW image processing methods only take RAW images as input and generate restored sRGB images as output, indicating that the entire model is responsible for both the restoration and ISP tasks. CR3Net [20] presents a cascaded network that harnesses both the RGB data and their corresponding RAW versions for image reflection removal. Within CR3Net, a module is formulated to emulate point-wise mappings within the ISP, converting the features from RAW to sRGB domain. To further mitigate the color casting problem, our proposed method jointly utilize RAW and sRGB data to learn a device-dependent ISP for image demoiring." + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 232, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 232, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 232, + 129 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 482, + 316 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 482, + 316 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 482, + 316 + ], + "type": "text", + "content": "Originally caused by frequency interference between the camera's CFA and the screen's LCD subpixel, moiré patterns are further deteriorated by the nonlinear processes in ISP. Therefore, introducing RAW data for image demoiréing may offer greater effectiveness. However, relying solely on RAW data for image demoiréing is insufficient in mitigating color cast due to the uncertainty during the RAW-to-sRGB conversion. Consequently, in this work, we propose to utilize paired RAW and sRGB data, which are readily accessible in modern smartphones and DSLR cameras (e.g., iPhone 15 Pro, HUWEI P60 Pro). The RAW-sRGB pairs essentially allows the model to learn a device-dependent ISP, aiding the color recovery process. The potential applications in real-world scenarios can be described as follows. When demoiréing function is enabled, the in-device ISP generated sRGB image will not be directly outputted. Instead, together with its corresponding RAW version, will be processed by our RRID to generate a new sRGB image with much suppressed moiré patterns. Afterwards, the RAW image could be discarded, depending on settings of the camera." + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 134, + 335, + 443, + 460 + ], + "blocks": [ + { + "bbox": [ + 134, + 335, + 443, + 460 + ], + "lines": [ + { + "bbox": [ + 134, + 335, + 443, + 460 + ], + "spans": [ + { + "bbox": [ + 134, + 335, + 443, + 460 + ], + "type": "image", + "image_path": "aac8f55afcfe14002d46908c5cdf05538bc96e3f19ced714ab22688cb7d957b6.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 133, + 462, + 252, + 506 + ], + "blocks": [ + { + "bbox": [ + 133, + 462, + 252, + 506 + ], + "lines": [ + { + "bbox": [ + 133, + 462, + 252, + 506 + ], + "spans": [ + { + "bbox": [ + 133, + 462, + 252, + 506 + ], + "type": "image", + "image_path": "56ae37aa0ed8b9eba9c358b87341904c203cadad1ad1e7207762d1728ae4b653.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 178, + 508, + 209, + 516 + ], + "lines": [ + { + "bbox": [ + 178, + 508, + 209, + 516 + ], + "spans": [ + { + "bbox": [ + 178, + 508, + 209, + 516 + ], + "type": "text", + "content": "(b) DCAB" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 253, + 462, + 381, + 506 + ], + "blocks": [ + { + "bbox": [ + 253, + 462, + 381, + 506 + ], + "lines": [ + { + "bbox": [ + 253, + 462, + 381, + 506 + ], + "spans": [ + { + "bbox": [ + 253, + 462, + 381, + 506 + ], + "type": "image", + "image_path": "c47eeda6a167cfe53734375ebfad09b19ee0fb5b12a0defb8a7d3a65cd7ace5c.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 382, + 462, + 480, + 506 + ], + "blocks": [ + { + "bbox": [ + 382, + 462, + 480, + 506 + ], + "lines": [ + { + "bbox": [ + 382, + 462, + 480, + 506 + ], + "spans": [ + { + "bbox": [ + 382, + 462, + 480, + 506 + ], + "type": "image", + "image_path": "a1fca03d21e0ee6231d9bb893f83ee28054302f442086c0962a2c6704260fc11.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 417, + 508, + 442, + 516 + ], + "lines": [ + { + "bbox": [ + 417, + 508, + 442, + 516 + ], + "spans": [ + { + "bbox": [ + 417, + 508, + 442, + 516 + ], + "type": "text", + "content": "(d) FSM" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 154, + 521, + 441, + 585 + ], + "blocks": [ + { + "bbox": [ + 297, + 509, + 323, + 516 + ], + "lines": [ + { + "bbox": [ + 297, + 509, + 323, + 516 + ], + "spans": [ + { + "bbox": [ + 297, + 509, + 323, + 516 + ], + "type": "text", + "content": "(c) GFM" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 154, + 521, + 441, + 585 + ], + "lines": [ + { + "bbox": [ + 154, + 521, + 441, + 585 + ], + "spans": [ + { + "bbox": [ + 154, + 521, + 441, + 585 + ], + "type": "image", + "image_path": "7c1f3f574df3bcd2d8fa73190a74cc1e2abf4b1adbc2b73fef123ab6f2446332.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 166, + 595, + 445, + 607 + ], + "lines": [ + { + "bbox": [ + 166, + 595, + 445, + 607 + ], + "spans": [ + { + "bbox": [ + 166, + 595, + 445, + 607 + ], + "type": "text", + "content": "Fig. 2: The overview and detailed structures of our proposed RRID." + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "More specifically, Fig. 2 presents an overview of our proposed RRID for image demoiring with the paired RAW and sRGB data. As for the RGB branch, the input is an sRGB image " + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{rgb} \\in \\mathbb{R}^{H \\times W \\times 3}" + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "inline_equation", + "content": "H \\times W" + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": " represents the spatial" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "resolution. Given an input RAW image, it is first packed into the 4-channel RGGB format " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{raw} \\in \\mathbb{R}^{\\frac{H}{2} \\times \\frac{W}{2} \\times 4}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": ", which serves as the input for the RAW branch. RRID is designed to generate the final output sRGB image " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "(\\hat{\\mathbf{Y}}_{rgb})" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": "Concretely, shallow features " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{raw}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{rgb}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " are respectively extracted from the input data " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{raw}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_{rgb}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " using a convolutional layer and the Dilated Channel Attention Block (DCAB). It is worth noting that a down-sampling layer is applied to the sRGB data to ensure the uniformity of feature shapes. Then, we apply SCDM to acquire pre-demoiréd features " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{raw}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{rgb}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " in RAW branch and RGB branch, respectively. GFM is introduced in the skip-connection of SCDM for RAW features, enabling adaptive differentiation between texture details and moiré patterns through feature gating. Similarly, FSM is utilized to mitigate moiré patterns in the frequency domain. More details will be given in Sec. 3.1. Subsequently, RGISP is designed to realize a RAW-to-sRGB conversion, generating " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{out}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": ". RGISP incorporates color information from coarsely demoiréd sRGB features " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{rgb}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " in a cross-attention mechanism, which will be introduced in Sec. 3.2. For the final image reconstruction, 4 RSTBs [12] are utilized to generate sRGB output " + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{Y}}_{rgb}" + }, + { + "bbox": [ + 130, + 152, + 482, + 332 + ], + "type": "text", + "content": " for their advantages in building long-range dependencies for global tone mapping and detail refinement." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 347, + 246, + 360 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 347, + 246, + 360 + ], + "spans": [ + { + "bbox": [ + 131, + 347, + 246, + 360 + ], + "type": "text", + "content": "3.1 Design of SCDM" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "text", + "content": "We propose SCDM, a multi-scale architecture designed to remove moiré patterns from shallow RAW features " + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "inline_equation", + "content": "F_{raw}" + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "text", + "content": " and shallow sRGB features " + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "inline_equation", + "content": "F_{rgb}" + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "text", + "content": ", as shown in Fig. 2(a). Unlike the vanilla U-Net, SCDM is constructed upon DCAB, facilitating the encoding and decoding of informative features within the respective layers. The features are downsampled twice in the spatial dimension during the encoding process and then upsampled to the original resolution of the input features during decoding. To emphasize the contextual information, we enhance the learned features from the corresponding layers of the encoder with additional modules at skip connections, that is GFM for RAW and FSM for sRGB. The introduction of GFM and FSM in skip-connections is also intended to enhance model efficiency. Then, we can obtain the pre-demoiréd features " + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{raw}" + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{rgb}" + }, + { + "bbox": [ + 130, + 366, + 482, + 498 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 605 + ], + "type": "text", + "content": "DCAB. DCAB is the essential building block of encoder-decoders for performing RAW demoiréing and the RGB demoiréing, as shown in Fig. 2(b). DCAB is designed using a series of dilated convolution layers followed by ReLU activation and the channel attention mechanism. The receptive field at each block is expanded with the dilated convolution kernels, facilitating the demoiréing operations. Furthermore, by incorporating the channel attention mechanism, DCAB adaptively rescales features according to interdependencies among channels. Also, shortcuts are introduced to establish connections between the input and output of DCAB, enabling the block to learn the residual features." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "GFM. Embedded in the skip-connection of SCDM for RAW features, GFM is introduced to enable adaptive differentiation between the texture and moiré patterns through feature gating. The detailed structure of the GFM is shown in Fig. 2(c). For efficiency, we employ point-wise and depth-wise convolutions to aggregate channel and local content information, respectively. Then, the features" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": "are chunked along the channel dimension to generate " + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{gate}" + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{content}" + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": ". A pointwise multiplication is applied on " + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{content}" + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_{gate}" + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": " after a GELU activation. During feature gating, we expect that the original image content is adaptively selected and merged along both spatial and channel dimensions. The operations can be formulated as:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 205, + 186, + 480, + 199 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 186, + 480, + 199 + ], + "spans": [ + { + "bbox": [ + 205, + 186, + 480, + 199 + ], + "type": "interline_equation", + "content": "\\left\\{\\mathbf {F} _ {\\text {g a t e}}, \\mathbf {F} _ {\\text {c o n t e n t}} \\right\\} = \\operatorname {D C o n v} \\left(\\operatorname {P C o n v} \\left(\\mathbf {F} _ {\\text {G F M} _ {\\text {i n}}}\\right)\\right), \\tag {1}", + "image_path": "3d1fbccd01d37298be93af36a94e52ad889fef416088086803100da4e92637e3.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 175, + 201, + 480, + 215 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 201, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 175, + 201, + 480, + 215 + ], + "type": "interline_equation", + "content": "\\mathbf {F} _ {G F M \\_ o u t} = \\operatorname {P C o n v} \\left(\\mathbf {F} _ {\\text {c o n t e n t}} \\odot \\operatorname {G E L U} \\left(\\mathbf {F} _ {\\text {g a t e}}\\right) + \\mathbf {F} _ {G F M \\_ i n}\\right), \\tag {2}", + "image_path": "5f9b4c2338ce5cc28c932d932cec8376e26ac8e73dc55b3387c0152e53b46398.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 223, + 479, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 223, + 479, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 223, + 479, + 247 + ], + "type": "text", + "content": "where DConv and PConv represent depth-wise convolution and point-wise convolution, respectively. Here, " + }, + { + "bbox": [ + 130, + 223, + 479, + 247 + ], + "type": "inline_equation", + "content": "\\odot" + }, + { + "bbox": [ + 130, + 223, + 479, + 247 + ], + "type": "text", + "content": " denotes the element-wise multiplication." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 247, + 480, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 247, + 480, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 247, + 480, + 437 + ], + "type": "text", + "content": "FSM. For sRGB demoiring, we leverage a learnable band stop filter [32] to mitigate moiré patterns in the frequency domain. Considering the formation of moiré patterns is caused by the spatial frequency aliasing between the camera CFA and screen's LCD subpixel, demoiring in the frequency domain becomes a favorable approach. However, the frequency spectrum of the moiré pattern is often mixed with that of the original contents, thereby making it challenging to disentanglement. Therefore, we propose to perform the disentanglement within small patches, where the moiré patterns tend to be more pronounced in a specific range of frequency bands, facilitating the removal of moiré patterns. Inspired by Zheng et al. [32], we utilize a band stop filter to amplify certain frequencies and suppress others using Block DCT. However, obtaining the frequency prior to separate moiré patterns from normal image textures is challenging and time-consuming. To address this issue, a set of convolution layers are employed as the learnable band stop filter " + }, + { + "bbox": [ + 130, + 247, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\mathrm{B}(\\cdot)" + }, + { + "bbox": [ + 130, + 247, + 480, + 437 + ], + "type": "text", + "content": " to attenuate the specific frequencies of moiré patterns while preserving the original image contents. The process of the FSM can be represented as:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 216, + 449, + 480, + 462 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 449, + 480, + 462 + ], + "spans": [ + { + "bbox": [ + 216, + 449, + 480, + 462 + ], + "type": "interline_equation", + "content": "\\mathbf {F} _ {F S M \\_ o u t} = \\operatorname {I D C T} (\\mathrm {B} (\\mathrm {D C T} (\\mathbf {F} _ {F S M \\_ i n}))), \\tag {3}", + "image_path": "a89c7193f56f9263f64317f7c5d866b49b0d9a852083358978b02d0de6c0f6e5.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 471, + 479, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 471, + 479, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 471, + 479, + 495 + ], + "type": "text", + "content": "where DCT and IDCT denote the process of Block DCT and the corresponding inverse process. The block size is set to " + }, + { + "bbox": [ + 130, + 471, + 479, + 495 + ], + "type": "inline_equation", + "content": "8 \\times 8" + }, + { + "bbox": [ + 130, + 471, + 479, + 495 + ], + "type": "text", + "content": " for DCT and IDCT." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 513, + 247, + 525 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 513, + 247, + 525 + ], + "spans": [ + { + "bbox": [ + 131, + 513, + 247, + 525 + ], + "type": "text", + "content": "3.2 Design of RGISP" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "content": "RGISP is proposed to transform pre-demoiréd RAW features " + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{raw}" + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "content": " into sRGB domain " + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{out}" + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "content": ". With the assistance of pre-demoiréd sRGB features " + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{rgb}" + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "content": ", a device-dependent ISP can be learned in RGISP. Matrix transformation is commonly employed in the traditional ISP pipelines [17]. It enables the enhancement or conversion of image colors to another color space through a channel-wise matrix transformation, which is facilitated by globally shared settings such as environmental illumination and color space specifications [8]. Building upon this principle, we introduce matrix transformation as a means to perform color transformation, as illustrated in Fig. 3. The design of this matrix transformation is motivated by recent advancements in transposed cross-attention. Given " + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{raw} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}" + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "content": ", the vectors of query " + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{Q} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}" + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "content": ", key " + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{K} \\in \\mathbb{R}^{\\frac{H}{2} \\times \\frac{W}{2} \\times C}" + }, + { + "bbox": [ + 130, + 533, + 480, + 666 + ], + "type": "text", + "content": " are generated through the" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 169, + 114, + 446, + 239 + ], + "blocks": [ + { + "bbox": [ + 169, + 114, + 446, + 239 + ], + "lines": [ + { + "bbox": [ + 169, + 114, + 446, + 239 + ], + "spans": [ + { + "bbox": [ + 169, + 114, + 446, + 239 + ], + "type": "image", + "image_path": "3d2cf042e8650cd046db960c1bcae92e63aba50e61bd70c1320d5b3ae43ec053.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 239, + 247, + 373, + 258 + ], + "lines": [ + { + "bbox": [ + 239, + 247, + 373, + 258 + ], + "spans": [ + { + "bbox": [ + 239, + 247, + 373, + 258 + ], + "type": "text", + "content": "Fig. 3: The structure of RGISP." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "spans": [ + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "text", + "content": "projection with a " + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "inline_equation", + "content": "1 \\times 1" + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "text", + "content": " convolutional layer Conv and a flatten operation Flatten, where " + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "text", + "content": " is the intermediate channel number. Similarly, value " + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "inline_equation", + "content": "\\mathbf{V} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}" + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "text", + "content": " can be produced by operations on " + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{rgb} \\in \\mathbb{R}^{C \\times \\frac{H}{2} \\times \\frac{W}{2}}" + }, + { + "bbox": [ + 130, + 280, + 479, + 316 + ], + "type": "text", + "content": " as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 232, + 321, + 481, + 335 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 232, + 321, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 232, + 321, + 481, + 335 + ], + "type": "interline_equation", + "content": "\\left\\{\\mathbf {Q}, \\mathbf {K} \\right\\} = \\operatorname {F l a t t e r n} \\left(\\operatorname {C o n v} \\left(\\mathbf {D} _ {\\text {r a w}}\\right)\\right), \\tag {4}", + "image_path": "484eedf29d478f7efab8f58bf40e45b3b831d8a9dbaa4d16ff47ba7bede869c8.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 247, + 336, + 481, + 350 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 336, + 481, + 350 + ], + "spans": [ + { + "bbox": [ + 247, + 336, + 481, + 350 + ], + "type": "interline_equation", + "content": "\\mathbf {V} = \\operatorname {F l a t t e n} \\left(\\operatorname {C o n v} \\left(\\mathbf {D} _ {r g b}\\right)\\right). \\tag {5}", + "image_path": "bde76725d6b87abecb222effa8bf7ea5e8b87b60f3247cbe23db3f5299d22b4f.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 355, + 479, + 379 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 355, + 479, + 379 + ], + "spans": [ + { + "bbox": [ + 130, + 355, + 479, + 379 + ], + "type": "text", + "content": "Then, the transformation matrix " + }, + { + "bbox": [ + 130, + 355, + 479, + 379 + ], + "type": "inline_equation", + "content": "\\mathbf{M} \\in \\mathbb{R}^{C \\times C}" + }, + { + "bbox": [ + 130, + 355, + 479, + 379 + ], + "type": "text", + "content": " is obtained by matrix multiplication. The procedure can be formulated as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 248, + 384, + 481, + 398 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 384, + 481, + 398 + ], + "spans": [ + { + "bbox": [ + 248, + 384, + 481, + 398 + ], + "type": "interline_equation", + "content": "\\mathbf {M} = \\operatorname {S o f t m a x} \\left(\\mathbf {Q} \\cdot \\mathbf {K} ^ {T} / \\lambda\\right), \\tag {6}", + "image_path": "9ab5ad41476e04c6c88d611b718fb57b1663ead4ca70d0b37929dd3f874aba78.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "text", + "content": "where a scaling coefficient " + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "text", + "content": " is applied for numerical stability. Subsequently, the vector " + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "inline_equation", + "content": "\\mathbf{V}" + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "text", + "content": " is transformed by the matrix " + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "inline_equation", + "content": "\\mathbf{M}" + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "text", + "content": ", performing color space conversion in feature-level. The output feature after color transformation can be obtained by " + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{out} = \\mathbf{M} \\cdot \\mathbf{V}" + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "text", + "content": ". As a complement to the global matrix transformation, we use a depth-wise convolution and a point-wise convolution to refine the local details, generating the output in sRGB domain " + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "inline_equation", + "content": "\\mathbf{D}_{out}" + }, + { + "bbox": [ + 130, + 403, + 479, + 475 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 490, + 230, + 500 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 490, + 230, + 500 + ], + "spans": [ + { + "bbox": [ + 131, + 490, + 230, + 500 + ], + "type": "text", + "content": "3.3 Loss Function" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 506, + 479, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 479, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 479, + 541 + ], + "type": "text", + "content": "To effectively remove the moiré patterns and adjust the color deviations, we introduce supervision in both RAW and sRGB domains. The overall training objective can be expressed as:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 219, + 546, + 481, + 559 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 546, + 481, + 559 + ], + "spans": [ + { + "bbox": [ + 219, + 546, + 481, + 559 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\alpha \\| \\hat {\\mathbf {Y}} _ {r a w} - \\mathbf {Y} _ {r a w} \\| _ {1} + \\| \\hat {\\mathbf {Y}} _ {r g b} - \\mathbf {Y} _ {r g b} \\| _ {1}, \\tag {7}", + "image_path": "8f0a813948e995a00ed0cfb0045dad1eec2340b0f86ab0fa39d3480e06c04b20.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "spans": [ + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "inline_equation", + "content": "\\mathbf{Y}_{raw}" + }, + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "inline_equation", + "content": "\\mathbf{Y}_{rgb}" + }, + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "text", + "content": " are the ground-truth RAW and sRGB images, respectively. We empirically set " + }, + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "inline_equation", + "content": "\\alpha = 0.5" + }, + { + "bbox": [ + 130, + 563, + 479, + 587 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 603, + 230, + 616 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 603, + 230, + 616 + ], + "spans": [ + { + "bbox": [ + 131, + 603, + 230, + 616 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 624, + 261, + 637 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 624, + 261, + 637 + ], + "spans": [ + { + "bbox": [ + 131, + 624, + 261, + 637 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 641, + 479, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 479, + 666 + ], + "type": "text", + "content": "Dataset. The experiments are conducted on the RAW image demoiréing dataset published in TMM22 [29], which contains recaptured scenes of natural images," + } + ] + } + ], + "index": 16 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "documents, and webpages. In TMM22, the dataset consists of 540 RAW and sRGB image pairs with ground-truth for training, and 408 pairs for testing. To facilitate the training and comparison process, patches of size " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "256 \\times 256" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "512 \\times 512" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " are cropped respectively for the training and testing sets. The moiré images are captured using four different smartphone cameras and three display screens of varying sizes. In addition, we utilize an image demoiring dataset FHIMi [6] to verify the generalization ability of our method. FHDMi contains 9981 sRGB image pairs for training and 2019 for testing, featuring diverse and intricate moiré patterns. Notably, images in FHDMi have a higher resolution of " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "1920 \\times 1080" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ", compared to TMM22." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "text", + "content": "Training Details. We train RRID using the AdamW optimizer with " + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "inline_equation", + "content": "\\beta_{1} = 0.9" + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "inline_equation", + "content": "\\beta_{2} = 0.999" + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "text", + "content": ". A multistep learning rate schedule is employed, with the learning rate initialized at " + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "inline_equation", + "content": "2 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 236, + 482, + 283 + ], + "type": "text", + "content": ". The RRID model is trained for 500 epochs using a batch size of 80 on 4 NVIDIA RTX 3090 GPUs." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 300, + 264, + 312 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 300, + 264, + 312 + ], + "spans": [ + { + "bbox": [ + 131, + 300, + 264, + 312 + ], + "type": "text", + "content": "4.2 Quantitative Results" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 319, + 482, + 486 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 319, + 482, + 486 + ], + "spans": [ + { + "bbox": [ + 130, + 319, + 482, + 486 + ], + "type": "text", + "content": "We compare our approach with several image demoiréing methods in sRGB domain, including DMCNN [21], WDNet [14], ESDNet [27], and a RAW image demoiréing method RDNet [29]. We further add comparison with a low-light enhancement method DNF [8] with RAW input, a video demoiréing method RawVDmoiré [28] with RAW input, and a de-reflection method CR3Net [20] with paired RAW-sRGB data. To evaluate the performance of our proposed RRID, we adopt the following three standard metrics to assess pixel-wise accuracy and the perceptual quality: PSNR, SSIM [24], and LPIPS [31]. Additionally, the number of parameters, FLOPs, and inference time are introduced to measure the model complexity. To ensure a fair comparison, we modify the inputs of the sRGB-based models to align with the dataset requirements. Subsequently, all models are fine-tuned using the default settings as provided in their papers on TMM22 dataset. We select the better results from the pretrained and retrained models for comparison, which provides an advantage over the competing methods." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 487, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 482, + 582 + ], + "type": "text", + "content": "Table. 1 presents the quantitative and the computational complexity comparisons. RRID outperforms the second-best method, RawVDmoiré, by 0.62dB in PSNR and 0.003 in SSIM. As for LPIPS, our methods accomplish the second-best result at 0.079, surpassing most of the comparison methods. Even though RRID utilizes both RAW and sRGB data as inputs, our approach can still achieve a satisfactory demoiréing effect with a inference time of merely 0.089s. Compared to previous methods, our RRID demonstrates superiority with acceptable parameters and FLOPs, further demonstrating the superiority of our approach." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "To verify the generalization performance of our method, we conduct additional experiments on an image demoiréing dataset FHIMi [6]. In order to adapt to the FHDMi dataset with sRGB data as input, the RAW branch and RGISP are removed. We select methods tailored for image demoiréing: DMCNN [21], MopNet [5], MBCNN [32], FHDe²Net [6], and ESDNet [27] for comparison, as shown in Table 2. Although RRID is initially designed for demoiréing on the RAW-sRGB image pairs, it still achieves the second-best performance by 24.39dB in" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 168, + 479, + 284 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 1: Quantitative comparison with the state-of-the-art demoiring approaches and RAW image restoration methods on TMM22 dataset [29] in terms of average PSNR, SSIM, LPIPS and computational complexity. The best results are highlighted with bold. The second-best results are highlighted with underline." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 168, + 479, + 284 + ], + "lines": [ + { + "bbox": [ + 135, + 168, + 479, + 284 + ], + "spans": [ + { + "bbox": [ + 135, + 168, + 479, + 284 + ], + "type": "table", + "html": "
IndexMethods
DMCNN [21]WDNet [14]ESDNet [27]RDNet [29]DNF [8]RawVDmoiré [28]CR3Net [20]RRID (Ours)
# Input typesRGBsRGBsRGBRAWRAWRAWsRGB+RAWsRGB+RAW
PSNR↑23.5422.3326.7726.1623.5527.2623.7527.88
SSIM↑0.8850.8020.9270.9210.8950.9350.9220.938
LPIPS↓0.1540.1660.0890.0910.1620.0750.1020.079
Params (M)1.553.365.936.041.255.332.682.38
TFLOPs0.1020.0550.1410.1610.0130.0220.8830.093
Inference time (s)0.0520.2840.1151.0940.0700.1820.0580.089
", + "image_path": "0381eb386d60efd43779543386a5dd18448628e2289a076712ec193d343d6d20.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 255, + 316, + 361, + 392 + ], + "blocks": [ + { + "bbox": [ + 187, + 295, + 425, + 307 + ], + "lines": [ + { + "bbox": [ + 187, + 295, + 425, + 307 + ], + "spans": [ + { + "bbox": [ + 187, + 295, + 425, + 307 + ], + "type": "text", + "content": "Table 2: Quantitative comparison on FHDMi dataset [6]." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 255, + 316, + 361, + 392 + ], + "lines": [ + { + "bbox": [ + 255, + 316, + 361, + 392 + ], + "spans": [ + { + "bbox": [ + 255, + 316, + 361, + 392 + ], + "type": "table", + "html": "
MethodPSNR↑SSIM↑
DMCNN [21]21.540.773
MopNet [5]22.760.796
MBCNN [32]22.310.810
FHDe2Net [6]22.930.789
ESDNet [27]24.500.835
Ours24.390.830
", + "image_path": "a0f26011cc59a86af471370a7571a18dbada49eab7070c486de3db0a7b6c7fb8.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 415, + 482, + 488 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 482, + 488 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 482, + 488 + ], + "type": "text", + "content": "PSNR and 0.830 in SSIM. Compared to ESDNet, an image demoiréing network designed for ultra-high-definition sRGB images with more than twice of the parameters, RRID also yields competitive results. The qualitative results on the FHDMi dataset demonstrate that our method can not only perform well in demoiréing on RAW-sRGB pairs but also solve sRGB image demoiréing, exhibiting a certain degree of generalization." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 510, + 257, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 257, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 257, + 521 + ], + "type": "text", + "content": "4.3 Qualitative Results" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "We present visual comparisons among our approach and the existing methods in Fig. 4. The results demonstrate the advantage of RRID in effectively removing moiré artifacts and correcting color deviations. For the first scene demonstrating a recaptured flower with moiré patterns, previous methods tend to exhibit residual moiré patterns in their restored images. While ESDNet successfully eliminates a significant portion of these patterns, it struggles to accurately restore the original colors of the image. Apart from natural scenes, we also present a case of webpages contaminated with moiré patterns. Through the utilization of both RAW and sRGB data, our approach eliminates moiré patterns while preserving fine image details, even in scenarios characterized by severe color deviations. This ensures a more accurate restoration of the original colors and results in" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "enhanced visual effects. Additional qualitative comparisons can be found in the supplementary file." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 130, + 158, + 202, + 229 + ], + "blocks": [ + { + "bbox": [ + 130, + 158, + 202, + 229 + ], + "lines": [ + { + "bbox": [ + 130, + 158, + 202, + 229 + ], + "spans": [ + { + "bbox": [ + 130, + 158, + 202, + 229 + ], + "type": "image", + "image_path": "9c9f336e2cef45564864c7b6db5cf7f7204f70d22aaa8079a8d5b6376f53b980.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 202, + 160, + 271, + 229 + ], + "blocks": [ + { + "bbox": [ + 202, + 160, + 271, + 229 + ], + "lines": [ + { + "bbox": [ + 202, + 160, + 271, + 229 + ], + "spans": [ + { + "bbox": [ + 202, + 160, + 271, + 229 + ], + "type": "image", + "image_path": "2e149b2198fcb9ee97d20bb5a1c0ef9bf610e6475b0616e1c6080ba7cbdb3709.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 271, + 160, + 339, + 229 + ], + "blocks": [ + { + "bbox": [ + 271, + 160, + 339, + 229 + ], + "lines": [ + { + "bbox": [ + 271, + 160, + 339, + 229 + ], + "spans": [ + { + "bbox": [ + 271, + 160, + 339, + 229 + ], + "type": "image", + "image_path": "e54e2dc1e187fd4e1f264b4d87dbb326c8627f080135aee8fec8f4c03eb4d698.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 342, + 160, + 410, + 229 + ], + "blocks": [ + { + "bbox": [ + 342, + 160, + 410, + 229 + ], + "lines": [ + { + "bbox": [ + 342, + 160, + 410, + 229 + ], + "spans": [ + { + "bbox": [ + 342, + 160, + 410, + 229 + ], + "type": "image", + "image_path": "3d4ed83046226f916ede0ea01535a374d6cac7899d2c6b72c0be98dce8e69856.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 411, + 160, + 480, + 229 + ], + "blocks": [ + { + "bbox": [ + 411, + 160, + 480, + 229 + ], + "lines": [ + { + "bbox": [ + 411, + 160, + 480, + 229 + ], + "spans": [ + { + "bbox": [ + 411, + 160, + 480, + 229 + ], + "type": "image", + "image_path": "42bb3e45068fb0ed4bb94feeef0c011f720824dbdd5f2acdf4cb6419b21665fd.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 132, + 237, + 201, + 305 + ], + "blocks": [ + { + "bbox": [ + 154, + 230, + 180, + 237 + ], + "lines": [ + { + "bbox": [ + 154, + 230, + 180, + 237 + ], + "spans": [ + { + "bbox": [ + 154, + 230, + 180, + 237 + ], + "type": "text", + "content": "(a) Input" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 132, + 237, + 201, + 305 + ], + "lines": [ + { + "bbox": [ + 132, + 237, + 201, + 305 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 201, + 305 + ], + "type": "image", + "image_path": "5e6d00095ab0665a1c51a8c09b5109764043d79042dfc69c13a9140e01be3f3f.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 155, + 306, + 178, + 312 + ], + "lines": [ + { + "bbox": [ + 155, + 306, + 178, + 312 + ], + "spans": [ + { + "bbox": [ + 155, + 306, + 178, + 312 + ], + "type": "text", + "content": "(f) DNF" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 203, + 237, + 271, + 305 + ], + "blocks": [ + { + "bbox": [ + 218, + 230, + 256, + 237 + ], + "lines": [ + { + "bbox": [ + 218, + 230, + 256, + 237 + ], + "spans": [ + { + "bbox": [ + 218, + 230, + 256, + 237 + ], + "type": "text", + "content": "(b) DMCNN" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 203, + 237, + 271, + 305 + ], + "lines": [ + { + "bbox": [ + 203, + 237, + 271, + 305 + ], + "spans": [ + { + "bbox": [ + 203, + 237, + 271, + 305 + ], + "type": "image", + "image_path": "4aa5c2adcf3de1a30b3d4d84e5338c7894be9bf656fa82ba3564a1e3c370065f.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 212, + 306, + 263, + 313 + ], + "lines": [ + { + "bbox": [ + 212, + 306, + 263, + 313 + ], + "spans": [ + { + "bbox": [ + 212, + 306, + 263, + 313 + ], + "type": "text", + "content": "(g) RawVDmoire" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 272, + 237, + 340, + 305 + ], + "blocks": [ + { + "bbox": [ + 290, + 230, + 323, + 237 + ], + "lines": [ + { + "bbox": [ + 290, + 230, + 323, + 237 + ], + "spans": [ + { + "bbox": [ + 290, + 230, + 323, + 237 + ], + "type": "text", + "content": "(c)WDNet" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 272, + 237, + 340, + 305 + ], + "lines": [ + { + "bbox": [ + 272, + 237, + 340, + 305 + ], + "spans": [ + { + "bbox": [ + 272, + 237, + 340, + 305 + ], + "type": "image", + "image_path": "4fbbd5d9e3f596aa2122f5a95d88355aec9b3b2ea931a45fb0f79580d04c77d6.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 290, + 306, + 324, + 313 + ], + "lines": [ + { + "bbox": [ + 290, + 306, + 324, + 313 + ], + "spans": [ + { + "bbox": [ + 290, + 306, + 324, + 313 + ], + "type": "text", + "content": "(h) CR3Net" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 342, + 237, + 410, + 305 + ], + "blocks": [ + { + "bbox": [ + 359, + 230, + 393, + 237 + ], + "lines": [ + { + "bbox": [ + 359, + 230, + 393, + 237 + ], + "spans": [ + { + "bbox": [ + 359, + 230, + 393, + 237 + ], + "type": "text", + "content": "(d) ESDNet" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 342, + 237, + 410, + 305 + ], + "lines": [ + { + "bbox": [ + 342, + 237, + 410, + 305 + ], + "spans": [ + { + "bbox": [ + 342, + 237, + 410, + 305 + ], + "type": "image", + "image_path": "14fd6d1959030c19022658774132ef8d0e8e00851d8d72570c5c91894bdec690.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 364, + 306, + 388, + 313 + ], + "lines": [ + { + "bbox": [ + 364, + 306, + 388, + 313 + ], + "spans": [ + { + "bbox": [ + 364, + 306, + 388, + 313 + ], + "type": "text", + "content": "(i) Ours" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 411, + 237, + 480, + 305 + ], + "blocks": [ + { + "bbox": [ + 430, + 230, + 461, + 237 + ], + "lines": [ + { + "bbox": [ + 430, + 230, + 461, + 237 + ], + "spans": [ + { + "bbox": [ + 430, + 230, + 461, + 237 + ], + "type": "text", + "content": "(e) RDNet" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 411, + 237, + 480, + 305 + ], + "lines": [ + { + "bbox": [ + 411, + 237, + 480, + 305 + ], + "spans": [ + { + "bbox": [ + 411, + 237, + 480, + 305 + ], + "type": "image", + "image_path": "91087fc72da76eafee253335349ca0f2942f5d5f98ecec51bc149d39135063b5.jpg" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 437, + 306, + 456, + 313 + ], + "lines": [ + { + "bbox": [ + 437, + 306, + 456, + 313 + ], + "spans": [ + { + "bbox": [ + 437, + 306, + 456, + 313 + ], + "type": "text", + "content": "(j) GT" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_caption" + } + ], + "index": 21 + }, + { + "type": "image", + "bbox": [ + 132, + 314, + 201, + 381 + ], + "blocks": [ + { + "bbox": [ + 132, + 314, + 201, + 381 + ], + "lines": [ + { + "bbox": [ + 132, + 314, + 201, + 381 + ], + "spans": [ + { + "bbox": [ + 132, + 314, + 201, + 381 + ], + "type": "image", + "image_path": "5681569d394b4cba1def26717664345f6430b31656d071b99cf99473c98878cb.jpg" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 155, + 382, + 181, + 389 + ], + "lines": [ + { + "bbox": [ + 155, + 382, + 181, + 389 + ], + "spans": [ + { + "bbox": [ + 155, + 382, + 181, + 389 + ], + "type": "text", + "content": "(a) Input" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_caption" + } + ], + "index": 23 + }, + { + "type": "image", + "bbox": [ + 203, + 314, + 271, + 381 + ], + "blocks": [ + { + "bbox": [ + 203, + 314, + 271, + 381 + ], + "lines": [ + { + "bbox": [ + 203, + 314, + 271, + 381 + ], + "spans": [ + { + "bbox": [ + 203, + 314, + 271, + 381 + ], + "type": "image", + "image_path": "f00610528698cfdf2e0f58b3968445c752fbfc8d40564b5daae45524ab7e8efe.jpg" + } + ] + } + ], + "index": 25, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 219, + 382, + 257, + 389 + ], + "lines": [ + { + "bbox": [ + 219, + 382, + 257, + 389 + ], + "spans": [ + { + "bbox": [ + 219, + 382, + 257, + 389 + ], + "type": "text", + "content": "(b)DMCNN" + } + ] + } + ], + "index": 26, + "angle": 0, + "type": "image_caption" + } + ], + "index": 25 + }, + { + "type": "image", + "bbox": [ + 272, + 314, + 340, + 381 + ], + "blocks": [ + { + "bbox": [ + 272, + 314, + 340, + 381 + ], + "lines": [ + { + "bbox": [ + 272, + 314, + 340, + 381 + ], + "spans": [ + { + "bbox": [ + 272, + 314, + 340, + 381 + ], + "type": "image", + "image_path": "102c68559fb0281c28b5990aa8c395c462ac0f859af1e1606f48c298fabb07d0.jpg" + } + ] + } + ], + "index": 27, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 291, + 382, + 324, + 389 + ], + "lines": [ + { + "bbox": [ + 291, + 382, + 324, + 389 + ], + "spans": [ + { + "bbox": [ + 291, + 382, + 324, + 389 + ], + "type": "text", + "content": "(c)WDNet" + } + ] + } + ], + "index": 28, + "angle": 0, + "type": "image_caption" + } + ], + "index": 27 + }, + { + "type": "image", + "bbox": [ + 342, + 314, + 410, + 381 + ], + "blocks": [ + { + "bbox": [ + 342, + 314, + 410, + 381 + ], + "lines": [ + { + "bbox": [ + 342, + 314, + 410, + 381 + ], + "spans": [ + { + "bbox": [ + 342, + 314, + 410, + 381 + ], + "type": "image", + "image_path": "ac9c2b0a114d300bc1fc235bd1177f9634617556b7cda6c245a2685f65459d33.jpg" + } + ] + } + ], + "index": 29, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 360, + 382, + 394, + 389 + ], + "lines": [ + { + "bbox": [ + 360, + 382, + 394, + 389 + ], + "spans": [ + { + "bbox": [ + 360, + 382, + 394, + 389 + ], + "type": "text", + "content": "(d) ESDNet" + } + ] + } + ], + "index": 30, + "angle": 0, + "type": "image_caption" + } + ], + "index": 29 + }, + { + "type": "image", + "bbox": [ + 411, + 314, + 480, + 381 + ], + "blocks": [ + { + "bbox": [ + 411, + 314, + 480, + 381 + ], + "lines": [ + { + "bbox": [ + 411, + 314, + 480, + 381 + ], + "spans": [ + { + "bbox": [ + 411, + 314, + 480, + 381 + ], + "type": "image", + "image_path": "432707277670fd54e7d9bf46d7594235a9a9f1834e24ba2479b4c0b6e95e3d05.jpg" + } + ] + } + ], + "index": 31, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 431, + 382, + 462, + 389 + ], + "lines": [ + { + "bbox": [ + 431, + 382, + 462, + 389 + ], + "spans": [ + { + "bbox": [ + 431, + 382, + 462, + 389 + ], + "type": "text", + "content": "(e) RDNet" + } + ] + } + ], + "index": 32, + "angle": 0, + "type": "image_caption" + } + ], + "index": 31 + }, + { + "type": "image", + "bbox": [ + 132, + 390, + 201, + 456 + ], + "blocks": [ + { + "bbox": [ + 132, + 390, + 201, + 456 + ], + "lines": [ + { + "bbox": [ + 132, + 390, + 201, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 390, + 201, + 456 + ], + "type": "image", + "image_path": "095367a97b1b4018bc61fbec4ca39202c3f62c900a6af4b3bdd3535be7df3699.jpg" + } + ] + } + ], + "index": 33, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 156, + 457, + 180, + 465 + ], + "lines": [ + { + "bbox": [ + 156, + 457, + 180, + 465 + ], + "spans": [ + { + "bbox": [ + 156, + 457, + 180, + 465 + ], + "type": "text", + "content": "(f) DNF" + } + ] + } + ], + "index": 34, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 141, + 475, + 470, + 487 + ], + "lines": [ + { + "bbox": [ + 141, + 475, + 470, + 487 + ], + "spans": [ + { + "bbox": [ + 141, + 475, + 470, + 487 + ], + "type": "text", + "content": "Fig. 4: Qualitative comparison on RAW image demoiring TMM22 dataset [29]." + } + ] + } + ], + "index": 43, + "angle": 0, + "type": "image_caption" + } + ], + "index": 33 + }, + { + "type": "image", + "bbox": [ + 203, + 390, + 271, + 456 + ], + "blocks": [ + { + "bbox": [ + 203, + 390, + 271, + 456 + ], + "lines": [ + { + "bbox": [ + 203, + 390, + 271, + 456 + ], + "spans": [ + { + "bbox": [ + 203, + 390, + 271, + 456 + ], + "type": "image", + "image_path": "0e96bf74c566584724d164d2d12667d7305105f2076d2cf92ed30c85ffac19f4.jpg" + } + ] + } + ], + "index": 35, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 212, + 457, + 263, + 465 + ], + "lines": [ + { + "bbox": [ + 212, + 457, + 263, + 465 + ], + "spans": [ + { + "bbox": [ + 212, + 457, + 263, + 465 + ], + "type": "text", + "content": "(g) RawVDmoire" + } + ] + } + ], + "index": 36, + "angle": 0, + "type": "image_caption" + } + ], + "index": 35 + }, + { + "type": "image", + "bbox": [ + 272, + 390, + 340, + 456 + ], + "blocks": [ + { + "bbox": [ + 272, + 390, + 340, + 456 + ], + "lines": [ + { + "bbox": [ + 272, + 390, + 340, + 456 + ], + "spans": [ + { + "bbox": [ + 272, + 390, + 340, + 456 + ], + "type": "image", + "image_path": "eaf5ae097eca6311e1fabd7d6fd131a36d11995963f01d8ca6eff63aed951448.jpg" + } + ] + } + ], + "index": 37, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 290, + 457, + 325, + 465 + ], + "lines": [ + { + "bbox": [ + 290, + 457, + 325, + 465 + ], + "spans": [ + { + "bbox": [ + 290, + 457, + 325, + 465 + ], + "type": "text", + "content": "(h) CR3Net" + } + ] + } + ], + "index": 38, + "angle": 0, + "type": "image_caption" + } + ], + "index": 37 + }, + { + "type": "image", + "bbox": [ + 342, + 390, + 410, + 456 + ], + "blocks": [ + { + "bbox": [ + 342, + 390, + 410, + 456 + ], + "lines": [ + { + "bbox": [ + 342, + 390, + 410, + 456 + ], + "spans": [ + { + "bbox": [ + 342, + 390, + 410, + 456 + ], + "type": "image", + "image_path": "d87fe77121dc9257eb73ede4c9cc7ba9708805bd4a50d15809fe2a1d45f67923.jpg" + } + ] + } + ], + "index": 39, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 365, + 457, + 389, + 465 + ], + "lines": [ + { + "bbox": [ + 365, + 457, + 389, + 465 + ], + "spans": [ + { + "bbox": [ + 365, + 457, + 389, + 465 + ], + "type": "text", + "content": "(i) Ours" + } + ] + } + ], + "index": 40, + "angle": 0, + "type": "image_caption" + } + ], + "index": 39 + }, + { + "type": "image", + "bbox": [ + 411, + 390, + 480, + 456 + ], + "blocks": [ + { + "bbox": [ + 411, + 390, + 480, + 456 + ], + "lines": [ + { + "bbox": [ + 411, + 390, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 411, + 390, + 480, + 456 + ], + "type": "image", + "image_path": "da4f230766a9f99a60f77010ccd8522d89359081e7484e957f15d2ba42ab4b74.jpg" + } + ] + } + ], + "index": 41, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 438, + 457, + 456, + 465 + ], + "lines": [ + { + "bbox": [ + 438, + 457, + 456, + 465 + ], + "spans": [ + { + "bbox": [ + 438, + 457, + 456, + 465 + ], + "type": "text", + "content": "(j) GT" + } + ] + } + ], + "index": 42, + "angle": 0, + "type": "image_caption" + } + ], + "index": 41 + }, + { + "bbox": [ + 131, + 529, + 238, + 541 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 529, + 238, + 541 + ], + "spans": [ + { + "bbox": [ + 131, + 529, + 238, + 541 + ], + "type": "text", + "content": "4.4 Ablation Study" + } + ] + } + ], + "index": 44 + }, + { + "bbox": [ + 130, + 548, + 481, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 548, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 130, + 548, + 481, + 597 + ], + "type": "text", + "content": "1) Ablation study on the model architecture and inputs. In Table 3, we investigate the architecture and inputs of RRID and validate the importance of different individual components in the whole RRID. We conduct this ablation study by comparing the proposed RRID and the following variants of RRID:" + } + ] + } + ], + "index": 45 + }, + { + "bbox": [ + 138, + 605, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 49, + "blocks": [ + { + "bbox": [ + 138, + 605, + 479, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 605, + 479, + 628 + ], + "spans": [ + { + "bbox": [ + 138, + 605, + 479, + 628 + ], + "type": "text", + "content": "- " + }, + { + "bbox": [ + 138, + 605, + 479, + 628 + ], + "type": "inline_equation", + "content": "B_{1}" + }, + { + "bbox": [ + 138, + 605, + 479, + 628 + ], + "type": "text", + "content": ". Both the RAW input and the RAW demoiréing branch are removed. Due to the lack of RAW features, the entire RGISP is also deleted." + } + ] + } + ], + "index": 46 + }, + { + "bbox": [ + 138, + 629, + 455, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 629, + 455, + 641 + ], + "spans": [ + { + "bbox": [ + 138, + 629, + 455, + 641 + ], + "type": "text", + "content": "- " + }, + { + "bbox": [ + 138, + 629, + 455, + 641 + ], + "type": "inline_equation", + "content": "B_{2}" + }, + { + "bbox": [ + 138, + 629, + 455, + 641 + ], + "type": "text", + "content": ". Both the sRGB input and sRGB demoiring branch are removed." + } + ] + } + ], + "index": 47 + }, + { + "bbox": [ + 138, + 641, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 641, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 641, + 480, + 665 + ], + "type": "text", + "content": "- " + }, + { + "bbox": [ + 138, + 641, + 480, + 665 + ], + "type": "inline_equation", + "content": "B_{3}" + }, + { + "bbox": [ + 138, + 641, + 480, + 665 + ], + "type": "text", + "content": ". The sRGB input is substituted with RAW input. The input channel number is adjusted, while the rest of the architecture is kept unchanged." + } + ] + } + ], + "index": 48 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 479, + 163 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 138, + 116, + 479, + 138 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 479, + 138 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 479, + 138 + ], + "type": "text", + "content": "- " + }, + { + "bbox": [ + 138, + 116, + 479, + 138 + ], + "type": "inline_equation", + "content": "B_{4}" + }, + { + "bbox": [ + 138, + 116, + 479, + 138 + ], + "type": "text", + "content": ". We replace RGISP with a two convolutional layers after a concatenation of the RAW and sRGB features." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 139, + 140, + 452, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 140, + 452, + 151 + ], + "spans": [ + { + "bbox": [ + 139, + 140, + 452, + 151 + ], + "type": "text", + "content": "- " + }, + { + "bbox": [ + 139, + 140, + 452, + 151 + ], + "type": "inline_equation", + "content": "B_{5}" + }, + { + "bbox": [ + 139, + 140, + 452, + 151 + ], + "type": "text", + "content": ". Reconstruction module is replaced with two convolutional layers." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 139, + 152, + 469, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 152, + 469, + 163 + ], + "spans": [ + { + "bbox": [ + 139, + 152, + 469, + 163 + ], + "type": "text", + "content": "- " + }, + { + "bbox": [ + 139, + 152, + 469, + 163 + ], + "type": "inline_equation", + "content": "B_{6}" + }, + { + "bbox": [ + 139, + 152, + 469, + 163 + ], + "type": "text", + "content": ". The full model of RRID with both RAW and sRGB images as input." + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "text" + }, + { + "type": "table", + "bbox": [ + 217, + 212, + 399, + 288 + ], + "blocks": [ + { + "bbox": [ + 132, + 190, + 479, + 202 + ], + "lines": [ + { + "bbox": [ + 132, + 190, + 479, + 202 + ], + "spans": [ + { + "bbox": [ + 132, + 190, + 479, + 202 + ], + "type": "text", + "content": "Table 3: Comparison of baseline models for the evaluation of architecture and inputs." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 217, + 212, + 399, + 288 + ], + "lines": [ + { + "bbox": [ + 217, + 212, + 399, + 288 + ], + "spans": [ + { + "bbox": [ + 217, + 212, + 399, + 288 + ], + "type": "table", + "html": "
ModelsPSNR↑SSIM↑
B1 (w/o RAW in and RAW branch)25.790.915
B2 (w/o sRGB in and sRGB branch)27.240.929
B3 (w/o sRGB in)26.510.923
B4 (w/o RGISP)27.380.932
B5 (w/o Reconstruction)26.930.926
B6 (full version)27.880.938
", + "image_path": "ee9440335e5d7b11ba61167102fcc3d9e4c419ef86ab1e14077a18d34caa2b73.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "text", + "content": "Our proposed RRID leverages paired RAW-sRGB data as input. Removing the RAW input and its corresponding RAW demoiréing module " + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "(B_{1})" + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "text", + "content": " results in a drastic decrease in PSNR of approximately 2dB. Likewise, eliminating the sRGB input and its corresponding RGB demoiréing module " + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "(B_{2})" + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "text", + "content": " leads to a PSNR of only 27.24dB. In addition to the decline in numerical metrics, we can also assess" + } + ] + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 167, + 388, + 236, + 458 + ], + "blocks": [ + { + "bbox": [ + 167, + 388, + 236, + 458 + ], + "lines": [ + { + "bbox": [ + 167, + 388, + 236, + 458 + ], + "spans": [ + { + "bbox": [ + 167, + 388, + 236, + 458 + ], + "type": "image", + "image_path": "efaa1f65297db777e4ea4f6908cf3b9e3aed0ea3db355f3132d2b085a7ce4f88.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 189, + 459, + 215, + 467 + ], + "lines": [ + { + "bbox": [ + 189, + 459, + 215, + 467 + ], + "spans": [ + { + "bbox": [ + 189, + 459, + 215, + 467 + ], + "type": "text", + "content": "(a) Input" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 237, + 389, + 306, + 458 + ], + "blocks": [ + { + "bbox": [ + 237, + 389, + 306, + 458 + ], + "lines": [ + { + "bbox": [ + 237, + 389, + 306, + 458 + ], + "spans": [ + { + "bbox": [ + 237, + 389, + 306, + 458 + ], + "type": "image", + "image_path": "d8c8f94c4eb0e762e4d8790f08e78f3a51340d823bddebb26835d8051d9c805a.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 263, + 459, + 281, + 468 + ], + "lines": [ + { + "bbox": [ + 263, + 459, + 281, + 468 + ], + "spans": [ + { + "bbox": [ + 263, + 459, + 281, + 468 + ], + "type": "text", + "content": "(b) " + }, + { + "bbox": [ + 263, + 459, + 281, + 468 + ], + "type": "inline_equation", + "content": "B_{j}" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 307, + 389, + 376, + 458 + ], + "blocks": [ + { + "bbox": [ + 307, + 389, + 376, + 458 + ], + "lines": [ + { + "bbox": [ + 307, + 389, + 376, + 458 + ], + "spans": [ + { + "bbox": [ + 307, + 389, + 376, + 458 + ], + "type": "image", + "image_path": "1fda4f9cfa609639689a85b44af3524b3a4c51baf1b04905da030017b93e3c1e.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 333, + 459, + 351, + 468 + ], + "lines": [ + { + "bbox": [ + 333, + 459, + 351, + 468 + ], + "spans": [ + { + "bbox": [ + 333, + 459, + 351, + 468 + ], + "type": "text", + "content": "(c) " + }, + { + "bbox": [ + 333, + 459, + 351, + 468 + ], + "type": "inline_equation", + "content": "B_{2}" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 377, + 389, + 446, + 458 + ], + "blocks": [ + { + "bbox": [ + 377, + 389, + 446, + 458 + ], + "lines": [ + { + "bbox": [ + 377, + 389, + 446, + 458 + ], + "spans": [ + { + "bbox": [ + 377, + 389, + 446, + 458 + ], + "type": "image", + "image_path": "d3d356c7d8f71ee2d870f257afa57fcf7cbe818f2201e17b6378a0f5f4c5d6b3.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 403, + 459, + 421, + 468 + ], + "lines": [ + { + "bbox": [ + 403, + 459, + 421, + 468 + ], + "spans": [ + { + "bbox": [ + 403, + 459, + 421, + 468 + ], + "type": "text", + "content": "(d) " + }, + { + "bbox": [ + 403, + 459, + 421, + 468 + ], + "type": "inline_equation", + "content": "B_{3}" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 167, + 469, + 236, + 537 + ], + "blocks": [ + { + "bbox": [ + 167, + 469, + 236, + 537 + ], + "lines": [ + { + "bbox": [ + 167, + 469, + 236, + 537 + ], + "spans": [ + { + "bbox": [ + 167, + 469, + 236, + 537 + ], + "type": "image", + "image_path": "157d6a807becad0adce8c50ecfdc8d0016aebcfa8d3ce90c3c4da27e43873f74.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 193, + 538, + 211, + 548 + ], + "lines": [ + { + "bbox": [ + 193, + 538, + 211, + 548 + ], + "spans": [ + { + "bbox": [ + 193, + 538, + 211, + 548 + ], + "type": "text", + "content": "(e) " + }, + { + "bbox": [ + 193, + 538, + 211, + 548 + ], + "type": "inline_equation", + "content": "B_{4}" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 237, + 469, + 306, + 537 + ], + "blocks": [ + { + "bbox": [ + 237, + 469, + 306, + 537 + ], + "lines": [ + { + "bbox": [ + 237, + 469, + 306, + 537 + ], + "spans": [ + { + "bbox": [ + 237, + 469, + 306, + 537 + ], + "type": "image", + "image_path": "7c2d18f0c745eadb1e33d99ac5cdc454713c3524ca921b43428b5023c0bc6727.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 263, + 538, + 280, + 548 + ], + "lines": [ + { + "bbox": [ + 263, + 538, + 280, + 548 + ], + "spans": [ + { + "bbox": [ + 263, + 538, + 280, + 548 + ], + "type": "text", + "content": "(f) " + }, + { + "bbox": [ + 263, + 538, + 280, + 548 + ], + "type": "inline_equation", + "content": "B_{5}" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 307, + 469, + 376, + 537 + ], + "blocks": [ + { + "bbox": [ + 307, + 469, + 376, + 537 + ], + "lines": [ + { + "bbox": [ + 307, + 469, + 376, + 537 + ], + "spans": [ + { + "bbox": [ + 307, + 469, + 376, + 537 + ], + "type": "image", + "image_path": "d7b87538de6e3f5af6d1ca388041a24aefe248eade1d9e49b3a534f87ac6c6f3.jpg" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 323, + 538, + 361, + 548 + ], + "lines": [ + { + "bbox": [ + 323, + 538, + 361, + 548 + ], + "spans": [ + { + "bbox": [ + 323, + 538, + 361, + 548 + ], + "type": "text", + "content": "(g) " + }, + { + "bbox": [ + 323, + 538, + 361, + 548 + ], + "type": "inline_equation", + "content": "B_{6}" + }, + { + "bbox": [ + 323, + 538, + 361, + 548 + ], + "type": "text", + "content": " (Ours)" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 137, + 559, + 474, + 571 + ], + "lines": [ + { + "bbox": [ + 137, + 559, + 474, + 571 + ], + "spans": [ + { + "bbox": [ + 137, + 559, + 474, + 571 + ], + "type": "text", + "content": "Fig. 5: Visualization of the ablation study for architecture and inputs comparison." + } + ] + } + ], + "index": 25, + "angle": 0, + "type": "image_caption" + } + ], + "index": 21 + }, + { + "type": "image", + "bbox": [ + 377, + 469, + 446, + 537 + ], + "blocks": [ + { + "bbox": [ + 377, + 469, + 446, + 537 + ], + "lines": [ + { + "bbox": [ + 377, + 469, + 446, + 537 + ], + "spans": [ + { + "bbox": [ + 377, + 469, + 446, + 537 + ], + "type": "image", + "image_path": "4491d383ba8ad575699206e9adeb980d67f9e0bc59ded3f586c569483e60f428.jpg" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 402, + 538, + 422, + 547 + ], + "lines": [ + { + "bbox": [ + 402, + 538, + 422, + 547 + ], + "spans": [ + { + "bbox": [ + 402, + 538, + 422, + 547 + ], + "type": "text", + "content": "(h) GT" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_caption" + } + ], + "index": 23 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "the visual performance from Fig. 5. When relying only on sRGB data and its corresponding demoiréing modules, moiré patterns are less effectively removed, as depicted in Fig.5(b). Conversely, Fig.5(c) demonstrates that using only RAW data as input generates images with more pronounced color deviations. To further validate the significance of RAW input for image demoiréing, we compare " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "B_{3}" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "B_{1}" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " by solely removing the RAW input data while retaining the remaining" + } + ] + } + ], + "index": 26 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": "model structures. Although " + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "inline_equation", + "content": "B_{3}" + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": " demonstrates some improvements in numerical metrics compared to " + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "inline_equation", + "content": "B_{1}" + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": ", its performance remains unsatisfactory due to the lack of information provided by the RAW input and the fact that the original RAW demoiring module is specifically designed for RAW data. Additionally, we conducted further comparisons by removing the originally designed RGISP " + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "inline_equation", + "content": "(B_{4})" + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": " and Reconstruction modules " + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "inline_equation", + "content": "(B_{5})" + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": ", resulting in inferior numerical metrics and performance in Fig. 5 compared to the complete RRID model " + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "inline_equation", + "content": "(B_{6})" + }, + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 200, + 491, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 491, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 491, + 237 + ], + "type": "text", + "content": "2) Ablation study on SCDM. SCDM is designed to perform effective demoiréing on both RAW and sRGB features. More specifically, we introduce GFM for RAW features demoiréing and FSM for sRGB features demoiréing." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 243, + 279, + 373, + 361 + ], + "blocks": [ + { + "bbox": [ + 231, + 258, + 380, + 269 + ], + "lines": [ + { + "bbox": [ + 231, + 258, + 380, + 269 + ], + "spans": [ + { + "bbox": [ + 231, + 258, + 380, + 269 + ], + "type": "text", + "content": "Table 4: Ablation study on SCDM." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 243, + 279, + 373, + 361 + ], + "lines": [ + { + "bbox": [ + 243, + 279, + 373, + 361 + ], + "spans": [ + { + "bbox": [ + 243, + 279, + 373, + 361 + ], + "type": "table", + "html": "
ModelsPSNR↑SSIM↑
S1 (w/o GFM & FSM)27.000.926
S2 (w/o GFM)27.170.927
S3 (w/o FSM)27.390.930
S4 (all GSM)27.500.933
S5 (all FSM)27.320.930
S6 (w/o DCAB)26.550.923
S7 (SCDM)27.880.938
", + "image_path": "99dc2a3c427f6d9f300422e59f2a345dd3303425a225f083d2b93c46607fa6f2.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "text", + "content": "Table 4 demonstrates the effectiveness and indispensability of the meticulously designed GFM and FSM integrated within the skip-connections. Removing the demoiréing modules on the skip-connections " + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "inline_equation", + "content": "(S_{1} - S_{3})" + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "text", + "content": " individually result in varying degrees of performance decline of the model. For instance, removing both GFM and FSM leads to only " + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "inline_equation", + "content": "27.00\\mathrm{dB}" + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "text", + "content": " in PSNR. Furthermore, Fig.6(b) demonstrates that the model's ability to remove moiré patterns decreases upon removing the GFM and FSM modules. Furthermore, to assess the specificity of GFM and FSM, we substitute the original modules in " + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "inline_equation", + "content": "S_{4}" + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "inline_equation", + "content": "S_{5}" + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "text", + "content": ", respectively. Despite no reduction in the number of parameters, the PSNR decreases by approximately " + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "inline_equation", + "content": "0.3 - 0.5\\mathrm{dB}" + }, + { + "bbox": [ + 130, + 384, + 482, + 540 + ], + "type": "text", + "content": ". Since DCAB is a crucial component module in SCDM, we substitute DCAB with two convolutional layers to confirm its necessity. Fig. 6(c) showcases more residual moiré patterns and significant color deviation compared to our complete SCDM presented in Fig.6(d)." + } + ] + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 133, + 561, + 201, + 630 + ], + "blocks": [ + { + "bbox": [ + 133, + 561, + 201, + 630 + ], + "lines": [ + { + "bbox": [ + 133, + 561, + 201, + 630 + ], + "spans": [ + { + "bbox": [ + 133, + 561, + 201, + 630 + ], + "type": "image", + "image_path": "18d3f9da6629fc20ce7f7b7ca98b10c6a0670849870666aaea85eec791e60a84.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 154, + 631, + 180, + 639 + ], + "lines": [ + { + "bbox": [ + 154, + 631, + 180, + 639 + ], + "spans": [ + { + "bbox": [ + 154, + 631, + 180, + 639 + ], + "type": "text", + "content": "(a) Input" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 203, + 562, + 271, + 630 + ], + "blocks": [ + { + "bbox": [ + 203, + 562, + 271, + 630 + ], + "lines": [ + { + "bbox": [ + 203, + 562, + 271, + 630 + ], + "spans": [ + { + "bbox": [ + 203, + 562, + 271, + 630 + ], + "type": "image", + "image_path": "a3975cb4f28caadfc507099f7ab9ce9d4fea6739cd5844c69ea8fe8072838ecc.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 228, + 631, + 246, + 639 + ], + "lines": [ + { + "bbox": [ + 228, + 631, + 246, + 639 + ], + "spans": [ + { + "bbox": [ + 228, + 631, + 246, + 639 + ], + "type": "text", + "content": "(b) " + }, + { + "bbox": [ + 228, + 631, + 246, + 639 + ], + "type": "inline_equation", + "content": "\\mathbf{S}_I" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 272, + 562, + 340, + 630 + ], + "blocks": [ + { + "bbox": [ + 272, + 562, + 340, + 630 + ], + "lines": [ + { + "bbox": [ + 272, + 562, + 340, + 630 + ], + "spans": [ + { + "bbox": [ + 272, + 562, + 340, + 630 + ], + "type": "image", + "image_path": "d706a6c4ab0a0d8b29dad4e179bc8959ba36ffa94279a973cb65e670c7750206.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 298, + 631, + 315, + 639 + ], + "lines": [ + { + "bbox": [ + 298, + 631, + 315, + 639 + ], + "spans": [ + { + "bbox": [ + 298, + 631, + 315, + 639 + ], + "type": "text", + "content": "(c) " + }, + { + "bbox": [ + 298, + 631, + 315, + 639 + ], + "type": "inline_equation", + "content": "\\mathbf{S}_6" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 342, + 562, + 410, + 630 + ], + "blocks": [ + { + "bbox": [ + 342, + 562, + 410, + 630 + ], + "lines": [ + { + "bbox": [ + 342, + 562, + 410, + 630 + ], + "spans": [ + { + "bbox": [ + 342, + 562, + 410, + 630 + ], + "type": "image", + "image_path": "5d3b05be7c5365006610745e614f77592d639798281b808c40274e4026d0158d.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 368, + 631, + 386, + 639 + ], + "lines": [ + { + "bbox": [ + 368, + 631, + 386, + 639 + ], + "spans": [ + { + "bbox": [ + 368, + 631, + 386, + 639 + ], + "type": "text", + "content": "(d) " + }, + { + "bbox": [ + 368, + 631, + 386, + 639 + ], + "type": "inline_equation", + "content": "\\mathbf{S}_7" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 195, + 651, + 416, + 662 + ], + "lines": [ + { + "bbox": [ + 195, + 651, + 416, + 662 + ], + "spans": [ + { + "bbox": [ + 195, + 651, + 416, + 662 + ], + "type": "text", + "content": "Fig. 6: Visualization of the ablation study for SCDM." + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 412, + 562, + 480, + 630 + ], + "blocks": [ + { + "bbox": [ + 412, + 562, + 480, + 630 + ], + "lines": [ + { + "bbox": [ + 412, + 562, + 480, + 630 + ], + "spans": [ + { + "bbox": [ + 412, + 562, + 480, + 630 + ], + "type": "image", + "image_path": "97a477c8c55c0532a644d36951765927078ec6102b864e7ef902e76ab43ce2c0.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 436, + 631, + 457, + 639 + ], + "lines": [ + { + "bbox": [ + 436, + 631, + 457, + 639 + ], + "spans": [ + { + "bbox": [ + 436, + 631, + 457, + 639 + ], + "type": "text", + "content": "(e) GT" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 191, + 173 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 191, + 173 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 191, + 173 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 191, + 173 + ], + "type": "image", + "image_path": "df7d9e7f83cbcf640c1849682c4500dc91fd598f2af3295f7b4d34b704afab75.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 151, + 172, + 173, + 179 + ], + "lines": [ + { + "bbox": [ + 151, + 172, + 173, + 179 + ], + "spans": [ + { + "bbox": [ + 151, + 172, + 173, + 179 + ], + "type": "text", + "content": "(a) Input" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 192, + 114, + 250, + 173 + ], + "blocks": [ + { + "bbox": [ + 192, + 114, + 250, + 173 + ], + "lines": [ + { + "bbox": [ + 192, + 114, + 250, + 173 + ], + "spans": [ + { + "bbox": [ + 192, + 114, + 250, + 173 + ], + "type": "image", + "image_path": "615a7489443f6914a2e63ef93029848b277457c18958147a43b5e8a3b9d0b977.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 212, + 171, + 228, + 179 + ], + "lines": [ + { + "bbox": [ + 212, + 171, + 228, + 179 + ], + "spans": [ + { + "bbox": [ + 212, + 171, + 228, + 179 + ], + "type": "text", + "content": "(b) " + }, + { + "bbox": [ + 212, + 171, + 228, + 179 + ], + "type": "inline_equation", + "content": "\\mathbb{R}_I" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 195, + 190, + 417, + 201 + ], + "lines": [ + { + "bbox": [ + 195, + 190, + 417, + 201 + ], + "spans": [ + { + "bbox": [ + 195, + 190, + 417, + 201 + ], + "type": "text", + "content": "Fig. 7: Visualization of the ablation study for RGISP." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 251, + 114, + 307, + 173 + ], + "blocks": [ + { + "bbox": [ + 251, + 114, + 307, + 173 + ], + "lines": [ + { + "bbox": [ + 251, + 114, + 307, + 173 + ], + "spans": [ + { + "bbox": [ + 251, + 114, + 307, + 173 + ], + "type": "image", + "image_path": "f4979ad29938c053463e90e548b326a98242f05bf0ddf93174f5aa74ee76e194.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 270, + 171, + 285, + 179 + ], + "lines": [ + { + "bbox": [ + 270, + 171, + 285, + 179 + ], + "spans": [ + { + "bbox": [ + 270, + 171, + 285, + 179 + ], + "type": "text", + "content": "(c) " + }, + { + "bbox": [ + 270, + 171, + 285, + 179 + ], + "type": "inline_equation", + "content": "\\mathbb{R}_2" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 307, + 114, + 365, + 173 + ], + "blocks": [ + { + "bbox": [ + 307, + 114, + 365, + 173 + ], + "lines": [ + { + "bbox": [ + 307, + 114, + 365, + 173 + ], + "spans": [ + { + "bbox": [ + 307, + 114, + 365, + 173 + ], + "type": "image", + "image_path": "540201f4470d44a96833f758d4166000fc29483a6128c8a4f1923e1b4064bea8.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 328, + 171, + 343, + 179 + ], + "lines": [ + { + "bbox": [ + 328, + 171, + 343, + 179 + ], + "spans": [ + { + "bbox": [ + 328, + 171, + 343, + 179 + ], + "type": "text", + "content": "(d) " + }, + { + "bbox": [ + 328, + 171, + 343, + 179 + ], + "type": "inline_equation", + "content": "\\mathbb{R}_3" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 365, + 114, + 482, + 173 + ], + "blocks": [ + { + "bbox": [ + 365, + 114, + 482, + 173 + ], + "lines": [ + { + "bbox": [ + 365, + 114, + 482, + 173 + ], + "spans": [ + { + "bbox": [ + 365, + 114, + 482, + 173 + ], + "type": "image", + "image_path": "c84a593de65bc3b593604d559f989947da9e40bcd3eddb86206fe080875e0287.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "text", + "content": "3) Ablation study on RGISP. RGISP is designed to integrate color information from the coarsely demoiréd sRGB features during the ISP stage, facilitating the color recovery process. The process of the RGISP can be recognized as a cross-attention mechanism. To assess the efficacy of the RGISP design, we compare the following structures in Table 5. For " + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "inline_equation", + "content": "R_{1}" + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "text", + "content": ", we concatenate the pre-demoiréd RAW features with the sRGB features and subsequently apply a self-attention mechanism. In " + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "inline_equation", + "content": "R_{2}" + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "text", + "content": ", the pre-demoiréd RAW features undergo a self-attention mechanism and are then concatenated with the pre-demoiréd sRGB features. Table 5 shows that our proposed RGISP surpasses the self-attention mechanisms " + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "inline_equation", + "content": "(R_{1}, R_{2})" + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "text", + "content": ", as well as other RAW-to-sRGB conversion methods RRM [20] " + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "inline_equation", + "content": "(R_{3})" + }, + { + "bbox": [ + 130, + 224, + 482, + 357 + ], + "type": "text", + "content": ". In addition, Fig. 7 depicts a webpage with globally distributed moiré pat" + } + ] + } + ], + "index": 12 + }, + { + "type": "table", + "bbox": [ + 239, + 399, + 378, + 456 + ], + "blocks": [ + { + "bbox": [ + 231, + 378, + 382, + 389 + ], + "lines": [ + { + "bbox": [ + 231, + 378, + 382, + 389 + ], + "spans": [ + { + "bbox": [ + 231, + 378, + 382, + 389 + ], + "type": "text", + "content": "Table 5: Ablation study on RGISP." + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 239, + 399, + 378, + 456 + ], + "lines": [ + { + "bbox": [ + 239, + 399, + 378, + 456 + ], + "spans": [ + { + "bbox": [ + 239, + 399, + 378, + 456 + ], + "type": "table", + "html": "
ModelsPSNR↑SSIM↑
R1(self-atten([raw,rgb]))27.540.933
R2(self-atten(raw),rgb])27.420.931
R3(RRM)27.210.929
R4(RGISP)27.880.938
", + "image_path": "2157807a60700f34fdd0baa1b4c11208c39cf68b4bebac2db5e471ca0d7c8ac6.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "table_body" + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 477, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 477, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 477, + 482, + 525 + ], + "type": "text", + "content": "terns. " + }, + { + "bbox": [ + 130, + 477, + 482, + 525 + ], + "type": "inline_equation", + "content": "R_{1} - R_{4}" + }, + { + "bbox": [ + 130, + 477, + 482, + 525 + ], + "type": "text", + "content": " are all capable of effectively removing the moiré patterns, but " + }, + { + "bbox": [ + 130, + 477, + 482, + 525 + ], + "type": "inline_equation", + "content": "R_{4}" + }, + { + "bbox": [ + 130, + 477, + 482, + 525 + ], + "type": "text", + "content": " exhibits the best performance in correcting color deviation. With the introduction of sRGB pre-demoiréd features, RGISP is able to learn a device-dependent ISP and restore the original colors of the image effectively." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 544, + 220, + 556 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 220, + 556 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 220, + 556 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "In this paper, we propose to jointly utilize RAW and sRGB data for image demoiréing (RRID). Firstly, we introduce SCDM with GFM and FSM embedded in skip-connections to handle the demoiréing of RAW and sRGB features, respectively. Additionally, we present RGISP to learn a device-dependent ISP, aiding the color recovery process. Extensive experiments demonstrate the superior performance of our RRID method in both moiré pattern removal and color cast correction. Our approach outperforms state-of-the-art methods by 0.62dB in PSNR and 0.003 in SSIM." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 210 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 210 + ], + "type": "text", + "content": "This work was supported in part by Macau Science and Technology Development Fund under SKLIOTSC-2021-2023, 0072/2020/AMJ, 0022/2022/A, and 0014/2022/AFJ; in part by Research Committee at University of Macau under MYRG-GRG2023-00058-FST-UMDF and MYRG2022-00152-FST; in part by Natural Science Foundation of Guangdong Province of China under EF2023-00116-FST." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 251, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "type": "text", + "content": "1. Cheng, X., Fu, Z., Yang, J.: Multi-scale dynamic feature encoding network for image demoiring. In: 2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW). pp. 3486-3493. IEEE (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 285, + 480, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 480, + 317 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 480, + 317 + ], + "type": "text", + "content": "2. Dai, P., Yu, X., Ma, L., Zhang, B., Li, J., Li, W., Shen, J., Qi, X.: Video demoireing with relation-based temporal consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17622-17631 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 318, + 480, + 361 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 318, + 480, + 361 + ], + "spans": [ + { + "bbox": [ + 138, + 318, + 480, + 361 + ], + "type": "text", + "content": "3. Dong, X., Xu, W., Miao, Z., Ma, L., Zhang, C., Yang, J., Jin, Z., Teoh, A.B.J., Shen, J.: Abandoning the bayer-filter to see in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17431-17440 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 361, + 480, + 383 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 361, + 480, + 383 + ], + "spans": [ + { + "bbox": [ + 138, + 361, + 480, + 383 + ], + "type": "text", + "content": "4. Gharbi, M., Chaurasia, G., Paris, S., Durand, F.: Deep joint demosaicking and denoising. ACM Transactions on Graphics (ToG) 35(6), 1-12 (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 384, + 480, + 415 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 384, + 480, + 415 + ], + "spans": [ + { + "bbox": [ + 138, + 384, + 480, + 415 + ], + "type": "text", + "content": "5. He, B., Wang, C., Shi, B., Duan, L.Y.: Mop moire patterns using mopnet. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2424-2432 (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 416, + 480, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 416, + 480, + 449 + ], + "spans": [ + { + "bbox": [ + 138, + 416, + 480, + 449 + ], + "type": "text", + "content": "6. He, B., Wang, C., Shi, B., Duan, L.Y.: Fhde 2 net: Full high definition demoireing network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 713-729. Springer (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 449, + 480, + 469 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 480, + 469 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 480, + 469 + ], + "type": "text", + "content": "7. Huang, H., Yang, W., Hu, Y., Liu, J., Duan, L.Y.: Towards low light enhancement with raw images. IEEE Transactions on Image Processing 31, 1391-1405 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 470, + 480, + 502 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 470, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 138, + 470, + 480, + 502 + ], + "type": "text", + "content": "8. Jin, X., Han, L.H., Li, Z., Guo, C.L., Chai, Z., Li, C.: Dnf: Decouple and feedback network for seeing in the dark. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18135-18144 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 502, + 480, + 534 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 480, + 534 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 480, + 534 + ], + "type": "text", + "content": "9. Khashabi, D., Nowozin, S., Jancsary, J., Fitzgibbon, A.W.: Joint demosaicing and denoising via learned nonparametric random fields. IEEE Transactions on Image Processing 23(12), 4968-4981 (2014)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 535, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 535, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 535, + 480, + 567 + ], + "type": "text", + "content": "0. Kokkinos, F., Lefkimmiatis, S.: Deep image demosaicking using a cascade of convolutional residual denoising networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 303-319 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 568, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 568, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 568, + 480, + 600 + ], + "type": "text", + "content": "1. Lei, C., Chen, Q.: Robust reflection removal with reflection-free flash-only cues. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14811-14820 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "text", + "content": "2. Liang, J., Cao, J., Sun, G., Zhang, K., Van Gool, L., Timofte, R.: Swinir: Image restoration using swin transformer. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1833-1844 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "text", + "content": "3. Liu, L., Jia, X., Liu, J., Tian, Q.: Joint demosaicing and denoising with self guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2240-2249 (2020)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "14. Liu, L., Liu, J., Yuan, S., Slabaugh, G., Leonardis, A., Zhou, W., Tian, Q.: Wavelet-based dual-branch network for image demoiring. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XIII 16. pp. 86–102. Springer (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 162, + 481, + 195 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 162, + 481, + 195 + ], + "spans": [ + { + "bbox": [ + 132, + 162, + 481, + 195 + ], + "type": "text", + "content": "15. Liu, S., Li, C., Nan, N., Zong, Z., Song, R.: Mmdm: Multi-frame and multi-scale for image demoiring. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 434-435 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 196, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 196, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 196, + 481, + 228 + ], + "type": "text", + "content": "16. Luo, F., Wu, X., Guo, Y.: And: Adversarial neural degradation for learning blind image super-resolution. Advances in Neural Information Processing Systems 36 (2024)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 228, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 481, + 251 + ], + "type": "text", + "content": "17. Nakamura, J.: Image sensors and signal processing for digital still cameras. CRC press (2017)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 251, + 481, + 284 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 481, + 284 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 481, + 284 + ], + "type": "text", + "content": "18. Niu, Y., Lin, Z., Liu, W., Guo, W.: Progressive moiré removal and texture complementation for image demoireing. IEEE Transactions on Circuits and Systems for Video Technology (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 285, + 481, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 481, + 308 + ], + "type": "text", + "content": "19. Oh, G., Gu, H., Kim, S., Kim, J.: Fpanel: Frequency-based video demoireing using frame-level post alignment. arXiv preprint arXiv:2301.07330 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 308, + 481, + 341 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 481, + 341 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 481, + 341 + ], + "type": "text", + "content": "20. Song, B., Zhou, J., Chen, X., Zhang, S.: Real-scene reflection removal with rawrgb image pairs. IEEE Transactions on Circuits and Systems for Video Technology (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 342, + 481, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 342, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 132, + 342, + 481, + 373 + ], + "type": "text", + "content": "21. Sun, Y., Yu, Y., Wang, W.: Moiré photo restoration using multiresolution convolutional neural networks. IEEE Transactions on Image Processing 27(8), 4160-4172 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 375, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 375, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 375, + 481, + 407 + ], + "type": "text", + "content": "22. Wang, C., He, B., Wu, S., Wan, R., Shi, B., Duan, L.Y.: Coarse-to-fine disentangling demoiring framework for recaptured screen images. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "type": "text", + "content": "23. Wang, H., Tian, Q., Li, L., Guo, X.: Image demoiring with a dual-domain distilling network. In: 2021 IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 442, + 481, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 442, + 481, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 442, + 481, + 475 + ], + "type": "text", + "content": "24. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "text", + "content": "25. Xing, W., Egiazarian, K.: End-to-end learning for joint image demosaicing, denoising and super-resolution. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3507-3516 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 509, + 481, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 542 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 542 + ], + "type": "text", + "content": "26. Xu, S., Song, B., Chen, X., Zhou, J.: Direction-aware video demoireing with temporal-guided bilateral learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 6360-6368 (2024)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 543, + 481, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 481, + 576 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 481, + 576 + ], + "type": "text", + "content": "27. Yu, X., Dai, P., Li, W., Ma, L., Shen, J., Li, J., Qi, X.: Towards efficient and scale-robust ultra-high-definition image demoiring. In: European Conference on Computer Vision. pp. 646-662. Springer (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 577, + 481, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 577, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 577, + 481, + 609 + ], + "type": "text", + "content": "28. Yue, H., Cheng, Y., Liu, X., Yang, J.: Recaptured raw screen image and video demoireing via channel and spatial modulations. arXiv preprint arXiv:2310.20332 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 610, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 481, + 632 + ], + "type": "text", + "content": "29. Yue, H., Cheng, Y., Mao, Y., Cao, C., Yang, J.: Recaptured screen image demoiring in raw domain. IEEE Transactions on Multimedia (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "30. Yue, H., Zhang, Z., Yang, J.: Real-rawvsr: Real-world raw video super-resolution with a benchmark dataset. In: European Conference on Computer Vision. pp. 608-624. Springer (2022)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "S. Xu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 183 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "text", + "content": "31. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 482, + 183 + ], + "type": "text", + "content": "32. Zheng, B., Yuan, S., Slabaugh, G., Leonardis, A.: Image demoiring with learnable bandpass filters. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3636-3645 (2020)" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 252, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image Demoiring in RAW and sRGB Domains" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_content_list.json b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..eaa4bac88e5efaca3e0a4ba6bbd1c0539186672f --- /dev/null +++ b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_content_list.json @@ -0,0 +1,1693 @@ +[ + { + "type": "text", + "text": "Image Manipulation Detection With Implicit Neural Representation and Limited Supervision", + "text_level": 1, + "bbox": [ + 228, + 140, + 774, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zhenfei Zhang $^{1}$ , Mingyang Li $^{2}$ , Xin Li $^{1}$ , Ming-Ching Chang $^{1}$ , and Jun-Wei Hsieh $^{3}$", + "bbox": [ + 240, + 210, + 759, + 242 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 University at Albany, State University of New York \n2 Stanford University", + "bbox": [ + 321, + 253, + 679, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 National Yang Ming Chiao Tung University {zzhang45, xli48, mchang2}@albany.edu mingyang.li@stanford.edu jwhsieh@nycu.edu.tw", + "bbox": [ + 330, + 282, + 669, + 324 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Image Manipulation Detection (IMD) is becoming increasingly important as tampering technologies advance. However, most state-of-the-art (SoTA) methods require high-quality training datasets featuring image- and pixel-level annotations. The effectiveness of these methods suffers when applied to manipulated or noisy samples that differ from the training data. To address these challenges, we present a unified framework that combines unsupervised and weakly supervised approaches for IMD. Our approach introduces a novel pre-processing stage based on a controllable fitting function from Implicit Neural Representation (INR). Additionally, we introduce a new selective pixel-level contrastive learning approach, which concentrates exclusively on high-confidence regions, thereby mitigating uncertainty associated with the absence of pixel-level labels. In weakly supervised mode, we utilize ground-truth image-level labels to guide predictions from an adaptive pooling method, facilitating comprehensive exploration of manipulation regions for image-level detection. The unsupervised model is trained using a self-distillation training method with selected high-confidence pseudo-labels obtained from the deepest layers via different sources. Extensive experiments demonstrate that our proposed method outperforms existing unsupervised and weakly supervised methods. Moreover, it competes effectively against fully supervised methods on novel manipulation detection tasks.", + "bbox": [ + 259, + 359, + 743, + 652 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Image Manipulation Detection $\\cdot$ Implicit Neural Representation $\\cdot$ Weakly Supervised Learning $\\cdot$ Unsupervised Learning", + "bbox": [ + 259, + 664, + 740, + 693 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 718, + 375, + 734 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The emergence of diverse media tampering tools, such as Photoshop and AI editing and generation methods [10, 49, 61, 64, 70, 73], has made it increasingly convenient to manipulate media content. However, this accessibility also brings forth the concerning issue of widespread misinformation, which can precipitate serious security implications. Therefore, the development and implementation of robust tampering detection technology, namely, Image Manipulation Detection", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/93f9aff89cbcb2a3b2d4a45e6583c2714d0a1388c9a00afe92f375a95b67eb7d.jpg", + "image_caption": [ + "Fig. 1: We conducted experiments using three widely-used evaluation datasets containing both authentic and tampered samples. Performance are compared with six SoTA fully supervised IMD methods. The pixel-level F1 score is calculated using tampered images, while image-level accuracy is computed using authentic images. The blue and orange bars represent the original datasets and reconstructed datasets via Implicit Neural Representation, respectively. It is evident that there is a significant performance decrease in all methods when applied to reconstructed images in pixel-level detection compared with the original dataset. On the other hand, performance using authentic images shows less change. The scores are averaged across CASIAv1 [11], Coverage [57], and Columbia [24] datasets." + ], + "image_footnote": [], + "bbox": [ + 215, + 142, + 500, + 275 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/fd174b9b3788d9b843a2abb10e0ffcda56dceb9d0f878e1d66ab2d702b8e3e38.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 500, + 142, + 785, + 275 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "(IMD) methods, are imperative to mitigate these risks effectively. The fundamental manipulation operations that previous methods typically address are as follows: (1) Splicing, which involves taking content from one image and pasting it onto another image, (2) Copy-move, in which parts of an image are duplicated and relocated to another location within the same image, (3) Inpainting, which entails erasing parts of an image and replacing them with synthesized content.", + "bbox": [ + 212, + 458, + 787, + 549 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Despite significant advances in fully supervised IMD methods, they encounter several notable challenges. First, these methods often perform poorly when confronted with unseen manipulation types. Second, extension of them towards unseen manipulation types faces challenges due to their reliance on high-quality training datasets with either image-level and pixel-level annotations. Acquiring such datasets is costly and in many cases, impractical, especially considering the myriad varieties of real-life tampering methods. Third, while some language-guided datasets may lack pixel-level labels, they hold advantages handling real-world scenarios. These datasets can potentially enhance the generalization capability of IMD models.", + "bbox": [ + 212, + 551, + 787, + 700 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To address the limitations of fully supervised IMD methods and enhance the generalization ability toward real-world use, we propose to integrate unsupervised and weakly supervised approaches into a unified IMD framework. Our framework allows training with solely image-level labels or even without any labels, aligning with many unsupervised and weakly supervised tasks [14, 30, 48, 52, 56, 72, 74]. Compared to the fully supervised methods, our approach comes with superior generalization capabilities and can be trained using datasets without annotations. Our method begins with the observation that tampered regions exhibit differences from authentic regions in most cases, such as the variations", + "bbox": [ + 212, + 704, + 787, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/3ef590abf9741ce9a2b929eece18008118be44689cd9b859d85040f2f56adc2d.jpg", + "image_caption": [ + "Fig. 2: Examples of Reconstruction Error Maps computed between original and reconstructed images are presented. The first two rows depict the data samples and their corresponding ground-truth masks, respectively. The first three columns showcase tampered image examples, while the last three columns display authentic images, where the ground-truth masks are all black. Apparently, the reconstruction process fails to properly reconstruct the tampered pixels, resulting in activations in the error map. Conversely, less change is observed in the authentic samples." + ], + "image_footnote": [], + "bbox": [ + 215, + 141, + 785, + 354 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "in color and lighting, which pose challenges for the fitting function that needs to model regions accurately. It is shown in [63] that the controllable fitting function of Implicit Neural Representation (INR) tends to learn an average representation of the training images. Motivated by this insight, we raise the following question as our hypothesis: if we train an INR solely on authentic images, can the fitting function effectively represent the characteristics of tampered regions?", + "bbox": [ + 212, + 491, + 787, + 582 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To obtain the answer to this question, we first train an INR using only pristine images from CASIAv2 [12] and use it to reconstruct three mainstream datasets. We then apply fully supervised SoTA methods to evaluate the reconstructed datasets, as shown in Fig. 1. Surprisingly, the evaluation results of these methods exhibit a significant decrease when using INR-reconstructed samples, while there is less performance change in the authentic image samples. This outcome leads us to an initial assumption that the INR may not effectively capture the characteristics of tampered regions. To validate this assumption, we compute the reconstruction error map between the reconstructed and original images in Fig. 2. Remarkably, we observe activation in the tampered regions of the tampered samples, while there is no discernible difference in the authentic samples. This observation inspires us to incorporate the INR as a pre-processing method and concatenate the reconstruction error map with the input RGB images before feeding them to the backbone. We name this pre-processing method as Neural Representation Reconstruction (NRR).", + "bbox": [ + 212, + 583, + 787, + 809 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Following the success of the pre-processing using INR, we further explore our findings and leverage it fully in our framework. Drawing inspiration from", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Contrastive Learning [22], we utilize NRR as a contrastive sample generator and introduce selective pixel-level contrastive learning, focusing solely on highly confident regions. This approach effectively mitigates uncertainty associated with the absence of pixel-level labels and further enhances weakly supervised performance. We further extend our method to a fully unsupervised approach trained with selected high-confidence pseudo-labels using a self-distillation [69] training strategy. Finally, previous SoTA methods widely apply Global-Max Pooling (GMP) or Global-Average Pooling (GAP) for image-level detection. However, GMP can hinder training and cause inaccurate predictions, as only the most discriminative response is back-propagated, neglecting the entire tampered content. Conversely, GAP is susceptible to inaccuracies due to weakly activated pixels. To overcome this limitation, we propose an adaptive global-average pooling that focuses on the high-confidence tampered regions. Our method can thus produce more comprehensive and robust image-level predictions.", + "bbox": [ + 212, + 145, + 787, + 357 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Experimental evaluations are conducted on seven datasets, including five mainstream datasets featuring general manipulation types and two novel datasets containing unseen tampered samples. The results demonstrate that our methods outperform SoTA weakly and unsupervised methods. Furthermore, our method achieves competitive results compared to fully supervised methods in novel manipulation detection tasks. Finally, our method can be easily extended to the datasets without pixel-level labels, which shows enhanced generalizability.", + "bbox": [ + 212, + 357, + 787, + 463 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The contribution of this paper includes the following: (1) We propose a novel method that achieves plausible weakly and unsupervised IMD results. Our method can be easily adapted to images without labels or only with image-level labels. (2) To our knowledge, we are the first to investigate the potential of Implicit Neural Representation (INR) in the IMD task. The pre-process step utilizing INR demonstrates effectiveness in handling tampered cases. (3) We introduce selective supervision, which mitigates uncertainty associated with the absence of labels and further improves detection performance. (4) Extensive experiments validate the efficacy of our proposed methods, showcasing superior performance on both standard and novel manipulation types compared to SoTA methods.", + "bbox": [ + 212, + 463, + 787, + 628 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 650, + 388, + 666 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.1 Image Manipulation Detection", + "text_level": 1, + "bbox": [ + 215, + 680, + 514, + 696 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Most traditional unsupervised IMD methods [1,8,9,17,38] detect manipulation via low-level tampering artifacts including camera fingerprint, double compression, color filter array, etc. The weakly supervised method of [65] applies self-consistency learning from multiple inputs. Most fully supervised IMD [5,20,21, 25,26,33,54,58-60,62] methods aim at detecting anomalous features. The two-branch architecture [29, 75] detects both image-editing and double-compression manipulation traces.", + "bbox": [ + 212, + 703, + 787, + 808 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Unlike previous methods, we propose combining weakly and unsupervised IMD in a single framework. Meanwhile, most SoTA methods apply high-pass fil", + "bbox": [ + 215, + 809, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "ters such as SRM [18] and Bayar [62] to suppress low-frequency information and detect noise inconsistency, but they are not adaptive to all manipulation types, especially when the tampered pixels are from the same source as authentic ones. Additionally, noise filters are very sensitive to high-frequency information such as edges, whether manipulated or not, making them ineffective and inefficient. We thus propose a novel pre-processing method using INR, which applies reconstruction error to address this limitation. Our pre-process via reconstruction error can effectively provide a good prior to the model and is non-sensitive to authentic images, as shown in Fig. 2.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.2 Image Neural Representation", + "text_level": 1, + "bbox": [ + 214, + 305, + 504, + 321 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Image Neural Representation (INR) has become increasingly popular for image representation. The controllable fitting ability of INR is widely utilized in various applications such as continuous image/video super-resolution [6,7], video/image compression [13, 28], continuous shape representation [16, 66], medical image analysis [40,67], etc. Recently, [63] utilized INR for low-light image enhancement. However, the capability of INR on distinguishing pristine from tampered images has not been documented in the open literature.", + "bbox": [ + 212, + 330, + 787, + 436 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.3 Contrastive Learning", + "text_level": 1, + "bbox": [ + 214, + 459, + 437, + 474 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The basic idea of contrastive learning [22] is to repel negative sample pairs while attracting positive pairs. The most popular architecture using contrastive learning is the Siamese network [27], which accepts two inputs simultaneously and the process is supervised by their similarity. This method has been widely applied in unsupervised and self-supervised applications [4,36,53,71]. Traditional unsupervised contrastive learning approaches commonly apply simple image augmentation operations, which may not be easily applicable to IMD due to model uncertainty [26]. Furthermore, image-level similarity, which is commonly used in contrastive learning, cannot be directly applied to IMD as it is unrelated to objects. To apply contrastive learning in un-/weakly supervised IMD, we utilize INR-reconstructed images as counter samples and employ a feature matching process in the final feature space. Building on the potential ability of INR mentioned in Section 1, authentic features tend to have higher matching scores, while tampered features have lower matching scores.", + "bbox": [ + 212, + 484, + 787, + 698 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Proposed Method", + "text_level": 1, + "bbox": [ + 214, + 720, + 426, + 739 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Overall Architecture", + "text_level": 1, + "bbox": [ + 214, + 753, + 433, + 768 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Fig. 3 illustrates the overall architecture of our IMD framework. The basic architecture comprises two branches with shared weights. Given an RGB image $I \\in \\mathbb{R}^{H \\times W \\times 3}$ where $H$ and $W$ are its height and width, respectively, we first apply Neural Representation Reconstruction (NRR) to reconstruct it as", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/a9230c6b43e30c0e90ee72dedae729a6836bbb0f46d85d5a46e81885a4b9a695.jpg", + "image_caption": [ + "Fig. 3: An overview of the proposed two-branch framework. The first branch accepts concatenated inputs as the main branch, while the NRR reconstructed image is fed into the second branch as a complementary branch. Selective contrastive learning is applied only to the pixels that have high confidence of being authentic or tampered. The classification results conducted by global-average pooling on both the result of the main branch using Otsu's method and intersected tampered pixels from clustering are used for loss computing. In the weakly supervised setting, ground-truth image-level labels are applied for supervision. In the unsupervised setting, high-confidence pseudolabels from the deepest layers are used to guide the shallow outputs." + ], + "image_footnote": [], + "bbox": [ + 215, + 143, + 785, + 388 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "$I_R \\in \\mathbb{R}^{H \\times W \\times 3}$ and generate a reconstruction error map $I_E \\in \\mathbb{R}^{H \\times W \\times 1}$ between $I_R$ and $I$ . We then concatenate $I$ and $I_E$ , feeding them into the first branch, which serves as the main branch. Similar to most IMD methods, the main branch generates a mask using a simple upsampling and Sigmoid activation function on the final feature map. We then apply Otsu's method to adaptively select the activated region for image-level prediction, as done in [65]. The reconstructed image $I_R$ is fed into the second branch, acting as a complementary branch for feature matching. After processing with the backbone, we obtain two feature maps $F$ and $F_R$ . We next compute the feature matching scores $M$ between the two feature maps via a dot product, where authentic pixels tend to have higher matching scores and vice versa. For the two-class classification of manipulation detection, unsupervised clustering is applied to $F$ and $M$ . We then intersect the two clustering results and exclusively apply pixel-level contrastive learning to the intersected features that exhibit higher confidence in being either authentic or tampered. The image-level classification result is conducted using the proposed adaptive global average pooling, which focuses on the high-confidence tampered regions for comprehensice image-level prediction. In a weakly supervised manner, the ground-truth image-level label is applied to supervise the prediction. In an unsupervised manner, a selected set of high-confidence pseudo", + "bbox": [ + 212, + 551, + 787, + 843 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "labels from the deepest layer are utilized to supervise the shallow prediction via self-distillation [69] training strategy. The high-confidence pseudo-labels are chosen by comparing predictions derived from Otsu's method and clustering technique, opting solely for those consistently identified by both sources.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 Neural Representation Reconstruction", + "text_level": 1, + "bbox": [ + 214, + 226, + 578, + 242 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Inspired by [63] and the observation from our experiment in Fig. 12, we apply NRR to reconstruct the input image. The reconstruction error can highlight the manipulation trace, thereby furnishing an indispensable prior to the subsequent IMD model. In INR, the input image is first converted to a feature map $F_{N} \\in \\mathbb{R}^{H \\times W \\times C}$ using an image encoder, where $H$ and $W$ are height and width, $C$ is the number of feature channels. The coordinate set of input can be expressed using $X \\in \\mathbb{R}^{H \\times W \\times 2}$ . We proceed by concatenating $F_{N}$ and $X$ , subsequently feeding them into a Multi-Layer Perceptron (MLP) for decoding. The NRR is formulated as:", + "bbox": [ + 212, + 248, + 784, + 382 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nI _ {R} [ x, y ] = M L P \\left(F _ {N} [ x, y ], X [ x, y ]\\right), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 383, + 785, + 401 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $I_R$ is reconstructed RGB pixel values from $I$ , $[x, y]$ is each pixel location. The main goal of NRR is to reconstruct the RGB values of $I$ , with loss function formulated as:", + "bbox": [ + 212, + 405, + 782, + 448 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {N R R} = \\left\\| I - I _ {R} \\right\\| _ {1}. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 426, + 450, + 784, + 467 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Note that such reconstruction can not depict the high-frequency pixels properly. We therefore apply the positional encoding from [39] to map $X$ to a higher-dimensional space. Such positional encoding is expressed as:", + "bbox": [ + 212, + 470, + 782, + 516 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nX ^ {\\prime} = \\left(\\sin \\left(2 ^ {0} \\pi X\\right), \\cos \\left(2 ^ {0} \\pi X\\right), \\dots , \\sin \\left(2 ^ {L - 1} \\pi X\\right), \\cos \\left(2 ^ {L - 1} \\pi X\\right)\\right), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 274, + 523, + 784, + 542 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $L$ is a pre-setting constant to control the fitting ability of NRR. Normally, larger $L$ results in a more accurate fitting. In our task, we aim to avoid outputs from NRR that mirror the inputs; instead, we desire NRR to faithfully preserve information in normal (authentic) content while introducing unfaithfulness in extreme (tampered) pixels. We empirically choose $L = 8$ as the optimal tradeoff.", + "bbox": [ + 212, + 549, + 782, + 638 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Selective Contrastive Learning", + "text_level": 1, + "bbox": [ + 214, + 660, + 514, + 674 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "After obtaining $I_R$ from NRR, we calculate the reconstruction error map between $I$ and $I_R$ using $I_E = (I_R - I)^2$ . Then, we concatenate $I_E$ and $I$ , enhancing the input to the backbone's first (main) branch. For the input of the second (complementary) branch, we send $I_R$ for feature matching. We employ ResNet50 [23] as a backbone, which consists of four stages that match previous weakly supervised methods. The weights of two branches are shared. After processing by the backbone, we obtain 2 feature outputs $F$ and $F_R$ from different input sources. We then compute the feature matching scores $M$ using the dot product as:", + "bbox": [ + 212, + 681, + 784, + 801 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nM _ {x, y} = \\sigma \\left(\\frac {P \\left(F _ {R} ^ {x , y}\\right) \\cdot P \\left(F ^ {x , y}\\right)}{\\sqrt {C}}\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 382, + 809, + 784, + 844 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $M_{x,y}$ is the similarity score at the spatial location $(x,y)$ . The project head $P(\\cdot)$ contains 2 convolutional layers and ReLU activation. The $\\sigma(\\cdot)$ denotes the sigmoid activation function, and $\\sqrt{C}$ provides normalization.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Due to the ability of NRR to properly reproduce only authentic pixels (and not tampered ones), the high matching scores in $M$ tend to correspond to the authentic parts of the image. In contrast, low scores tend to correspond to manipulated regions of the image. Due to the lack of ground-truth masks to supervise the final features, we apply unsupervised clustering for forged/pristine classification similar to [3, 37, 41, 44, 47, 58] and assume that the cluster with fewer elements is the tampered cluster. This assumption aligns with the real-world situation of current manipulation datasets. The reason is that, in most cases, the tampered region is usually much smaller than the authentic ones.", + "bbox": [ + 212, + 191, + 784, + 325 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Ideally, we can apply pixel-level contrastive learning through InfoNCE [22] on $M$ and $F$ as [58]. However, we found that this method does not work well in our experiments, as clustering may come with low confidence due to the lack of ground-truth masks. To address this issue, we intersect on the clustering results of $M$ and $F$ , and denote the intersected clustering as $C_I$ . After the intersection, we will have 2 clusters with higher confidence in being either authentic or tampered with, since they come from the same prediction from 2 different sources. We thus apply InfoNCE only to intersected pixels for contrastive learning, leaving the ambiguous pixels unchanged. This selective contrastive learning loss is formulated as:", + "bbox": [ + 212, + 327, + 785, + 474 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {S C L} = - \\log \\frac {\\frac {1}{J} \\sum_ {j \\in [ 1 , J ]} \\exp \\left(q \\cdot k _ {j} ^ {+} / \\tau\\right)}{\\sum_ {i \\in [ 1 , K ]} \\exp \\left(q \\cdot k _ {i} ^ {-} / \\tau\\right)}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 359, + 476, + 784, + 513 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $q$ is an encoded query; $J$ and $K$ are the number of selected positive and negative keys, respectively; $\\tau$ is a temperature hyper-parameter. We set positive keys $k_{j}^{+}$ as pixels associated with pristine regions, whereas negative keys $k_{i}^{-}$ correspond to pixels linked to tampered regions.", + "bbox": [ + 212, + 520, + 784, + 579 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Adaptive Global Average Pooling", + "text_level": 1, + "bbox": [ + 214, + 603, + 537, + 619 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Many existing methods use Global-Max Pooling (GMP) and Global-Average Pooling (GAP) for image-level prediction to determine if the input is authentic or tampered. However, GMP can hinder training and cause inaccurate predictions as only the most discriminative response is back-propagated, neglecting the entire tampered content. Global-Average Pooling (GAP) is susceptible to inaccuracies due to weakly activated pixels.", + "bbox": [ + 212, + 628, + 782, + 717 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To tackle these challenges, we introduce Adaptive Global Average Pooling (AGAP), which focuses on the high-confidence tampered regions for comprehensive image-level prediction. Leveraging the intersection of two clustering results (discussed in Section 3.3), we initially apply Global Average Pooling (GAP) exclusively to intersected tampered regions from a clustering perspective. However, relying solely on unsupervised clustering may not guarantee optimal performance and robustness across all input types without ground-truth labels. As discussed in [32], Otsu's method performs well when the image histogram", + "bbox": [ + 212, + 719, + 784, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "exhibits a bimodal distribution, whereas clustering provides flexibility and the ability to handle more complex histograms. Therefore, we combine Otsu and clustering to enhance image-level prediction and training robustness. Specifically, GAP is applied to the tampered responses from both Otsu and intersected clustering results for loss computation with image-level labels. Further details on Otsu's method and clustering can be found in their respective papers [15, 43].", + "bbox": [ + 212, + 146, + 782, + 238 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.5 Weakly-supervised and Unsupervised IMD", + "text_level": 1, + "bbox": [ + 214, + 263, + 614, + 279 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In the weakly-supervised IMD setting, we utilize ground truth image-level labels to supervise the prediction training using a binary cross-entropy (BCE) loss, which is:", + "bbox": [ + 212, + 292, + 782, + 337 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {B C E} (g, \\hat {g}) = - (1 - g) \\log (1 - \\hat {g}) - g \\log (\\hat {g}), \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 344, + 342, + 784, + 357 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $g$ and $\\hat{g}$ are the ground-truth and prediction scores, respectively. The final classification loss in a weakly supervised manner is the sum of two BCE losses, comparing two pooling results with $g$ .", + "bbox": [ + 212, + 367, + 782, + 412 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In the unsupervised IMD setting, where no labels are used, we employ a self-distillation training strategy [69], using pseudo-labels from the deepest layers as a teacher to supervise the shallow outputs.", + "bbox": [ + 212, + 412, + 782, + 458 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To streamline prediction results from shallow layers and mitigate computational overhead, the classification head following each middle stage of the backbone uses spatial-average pooling in the channel dimension, reshaping it into a one-channel feature map. This is followed by a sigmoid function and global-max pooling. In traditional self-distillation methods, combining ground truth loss and self-distillation enhances overall performance, but this approach is not applicable in an unsupervised context. Our experiments revealed that relying solely on self-distillation did not yield satisfactory results, as the outputs from the deepest layers may lack accuracy, hindering the training process and overall performance.", + "bbox": [ + 212, + 459, + 784, + 609 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Drawing inspiration from the selective-supervised method [31], proven effective in handling noisy label datasets, we leverage its concept of selecting training examples based on the alignment between feature representation and given labels. However, in our unsupervised setting, the absence of labels poses a challenge. To overcome this hurdle, we compare predictions obtained from Otsu and clustering methods, choosing only those consistently predicted by both sources as pseudo-labels for self-distillation training.", + "bbox": [ + 212, + 611, + 782, + 717 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In pseudo-label selection, predictions exceeding 0.5 are considered as tampered samples. Similar to weakly supervised setting, we employ BCE loss between selected pseudo-labels and shallow predictions for supervision. During inference, all classification heads in shallow layers are excluded to avoid unnecessary parameters.", + "bbox": [ + 212, + 718, + 782, + 792 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Training objective. We first apply trained NRR through $\\mathcal{L}_{NRR}$ as a pretrained model, with all its weights frozen during IMD training. For simplicity, we use the symbol $\\mathcal{L}_{cls}$ to denote the loss functions for classification in both", + "bbox": [ + 212, + 794, + 782, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "unsupervised and weakly supervised approaches, albeit with slight differences as described above.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The total loss for our proposed IMD, denoted as $\\mathcal{L}_{\\text{total}}$ , is a weighted sum of both classification losses using BCE loss and the selective pixel-level contrastive learning loss:", + "bbox": [ + 212, + 179, + 787, + 223 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {t o t a l}} = \\alpha \\mathcal {L} _ {\\text {c l s}} + \\beta \\mathcal {L} _ {\\text {S C L}}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 410, + 229, + 785, + 247 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "where $\\alpha$ and $\\beta$ are weighting hyperparameters.", + "bbox": [ + 214, + 260, + 553, + 273 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 309, + 375, + 327 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dataset: Our model is trained using CASIAv2 [12] exclusively, which comprises 7,491 authentic samples and 5,063 tampered images. For the evaluations of the standard IMD task, we employ widely-used benchmarks, including CASIAv1 [11], Coverage [57], Columbia [24], IMD2020 [42], and NIST16 [19]. CASIAv1 [11] consists of both splicing and copy-move images. Coverage [57] contains only copy-move samples with some post-processing approaches. Columbia [24] comprises 363 uncompressed images with an average resolution of $938 \\times 720$ . NIST16 [19] and IMD2020 [42] contain only tampered images, suitable for pixel-level evaluation. These datasets cover traditional manipulation types including splicing, copy-move, and removal. For evaluations involving novel or more complex manipulation types, we utilize IEdit [51] and MagicBrush [68], which are two language-driven datasets containing various novel manipulation types, such as action change and light change.", + "bbox": [ + 212, + 351, + 787, + 547 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation Metrics: We utilize IOU and F1 scores, including P-F1 for pixel-level F1, I-F1 for image-level F1, and C-F1 for combined F1. The C-F1 score accounts for both pixel-level and image-level performance through the harmonic mean, providing an overall performance comparison. All F1 scores and IOU scores are computed using 0.5 as the fixed threshold. Due to the lack of pixel-level masks in IEdit [51], we include image-level ACC for additional evaluation.", + "bbox": [ + 212, + 550, + 787, + 642 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Implementation Details: We employ ResNet50 [23] as the backbone and the model is implemented using PyTorch [45], with parameters initialized randomly. We apply AdamW [35] as the optimizer. The Multi-Layer Perceptron (MLP) in NRR follows a three-hidden-layer architecture. NRR is trained for 120 epochs with an initial learning rate of $2 \\times 10^{-4}$ and weight decay is applied. The IMD model in weakly supervised mode is trained for 50 epochs with an initial learning rate of 0.0005 and weight decay. For the unsupervised model, we train for 20 epochs with an initial learning rate of 0.0001, applying weight decay. Image augmentation is limited to random flipping and cropping. We use a fixed threshold of 0.5 to extract binary masks from the feature map, consistent with previous methods. Hyperparameters $\\alpha$ and $\\beta$ are set to 1.0 and 0.1, respectively, for weakly supervised training, and 1.0 and 0.3 for unsupervised training. For the clustering algorithms, we used K-means [34].", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/67e9578df7f3718cf628fd5ebea07e820b73dddd9d8685869f2f8a53ee87c4bc.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1IOUP-F1IOUP-F1IOUP-F1IOUP-F1
NOI [38]0.0750.1320.1520.2360.1220.2100.0480.0740.0910.126
CFAI [17]0.0810.1340.1750.2750.1030.1850.0760.1050.0680.103
MCA [1]0.0490.0890.0850.1480.0780.1360.0490.0740.0440.079
NoisePrint [9]0.0740.1300.0850.3200.0980.1760.0620.1060.0540.104
IVC [8]0.0560.1010.0850.1640.0700.1270.0380.0680.0480.086
Ours0.0970.1660.2160.3440.1310.2170.0800.1290.0790.136
", + "bbox": [ + 230, + 143, + 771, + 268 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/1aff8067385102edc96ca93b15a731535a2eab8b989e889f1e07475a69bb584d.jpg", + "table_caption": [ + "Table 1: Evaluation results of unsupervised methods for Standard Manipulation task." + ], + "table_footnote": [], + "table_body": "
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1IOUP-F1
FCN [46]0.0780.1220.5610.2000.0620.0980.5240.1650.0720.1220.4240.1900.0320.0520.0520.086
WSCL [65]0.1000.1630.6790.2630.2200.3210.7200.4440.1020.1710.5710.2630.0470.0780.0930.152
Ours0.1240.1990.7030.3100.2480.3650.6950.4790.1400.2210.6670.3320.0790.1310.1240.204
", + "bbox": [ + 218, + 323, + 782, + 383 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Table 2: Evaluation results of weakly supervised approaches for Standard Manipulation task.", + "bbox": [ + 215, + 383, + 782, + 409 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.1 Comparison with SoTA Methods", + "text_level": 1, + "bbox": [ + 215, + 453, + 532, + 468 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "For a fair comparison with SoTA methods, we selected approaches for which the source code is publicly available. Among the unsupervised methods applied for comparison are NOI [38], CFAI [17], MCA [1], NoisePrint [9], and IVC [8], while the weakly supervised methods include FCN [46] and WSCL [65].", + "bbox": [ + 212, + 477, + 785, + 537 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Additionally, we conducted experiments using two novel manipulation datasets and compared our approach with fully supervised methods, including RRU-Net [2], Mantra-Net [60], SPAN [25], PSCC-Net [33], Trufor [20], CAT-Net [29], Hifi-Net [21], CR-CNN [62], ObjectFormer [54], and MVSS-Net [5].", + "bbox": [ + 212, + 537, + 789, + 598 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Comparison with SoTA unsupervised methods: Due to the assumption of unsupervised methods that all images contain manipulated parts, they will classify all test images as tampered. Thus, they are not suitable for image-level evaluation. We conduct pixel-level experiments to compare their abilities to localize the manipulated region, as shown in Table 1. We can observe that our proposed method in the unsupervised setting achieves the best detection performance compared to other unsupervised methods across five widely used standard manipulation benchmarks.", + "bbox": [ + 212, + 599, + 785, + 718 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Comparison with SoTA weakly supervised methods: Table 2 shows experimental results comparing weakly supervised SoTA approaches. Except for the F1 (I-F1) score at the image level in the Columbia [24] dataset, our method performs better than SoTA methods in all other metrics. Regarding the relatively lower I-F1 score in Columbia compared to WSCL [65], we believe the reason is that Columbia does not have post-processing, so our method may not be very sensitive to manipulation. However, despite this issue, our method achieves the best localization performance in the Columbia dataset.", + "bbox": [ + 212, + 719, + 785, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/3176a8421b36ffc0850bd6fd506160599c2a2c0b0ac11d607e9ac885363346c9.jpg", + "image_caption": [ + "Fig. 4: Visualization results using different methods. The images are displayed in the following order from top to bottom: tampered images, ground truth masks, prediction results from CR-CNN [62], Mantra-Net [60], NOI [38], WSCL [65], and our method." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 784, + 470 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Comparison using novel manipulation dataset: In order to show the generalization ability of our method. We conduct evaluations using fully supervised and weakly supervised methods on two novel manipulation detection datasets in Table 3. We can see that the fully supervised methods cannot adapt to the novel manipulation types, resulting in low detection performance even if they utilize a very large synthesis training dataset with both image-level and pixel-level labels. In contrast, our method achieves competitive performance while using extremely few training data with only image-level labels.", + "bbox": [ + 212, + 550, + 787, + 671 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Visualization Results: We present some visualization results compared to SoTA methods in Figure 4. Our method can better localize the tampered region, even without the use of pixel-level labels. However, due to the lack of pixel-level labels, our model cannot accurately detect tampered edges. These results of our method are generated from the weakly supervised model.", + "bbox": [ + 212, + 671, + 787, + 748 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.2 Ablation Study", + "text_level": 1, + "bbox": [ + 214, + 768, + 390, + 786 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We conducted several ablation studies to evaluate the effectiveness of each proposed component. For these studies, we utilized the CASIAv1 [12] and NIST16 [19] datasets.", + "bbox": [ + 212, + 794, + 792, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 236, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/85cecf03287680a8822e0baa3581d11ef06911cb46918e4a4731aa8da5878973.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
TypeMethodTraining Data SizeIEditMagicBrush
ACCI-F1IOUP-F1I-F1C-F1
Full SupervisionRRU-Net [2]4.2K0.4820.6510.0930.1530.6670.249
Mantra-Net [60]64K0.4990.6650.0580.1050.6670.181
SPAN [25]96K0.5280.2100.0110.0020.5850.004
PSCC-Net [33]100K0.5240.2060.1320.2100.7100.324
Trufor [20]858K0.5050.6650.2160.3040.6700.418
CAT-Net [29]858K0.4880.5670.0250.0330.7660.063
Hifi-Net [21]1,710K0.5310.4600.0890.1510.6770.247
WeakCR-CNN [62]12.5K0.5310.5300.0250.0420.5930.078
ObjectFormer [54]12.5K0.4970.4270.0290.0470.4300.085
MVSS-Net [5]12.5K0.5260.4870.0450.0720.6750.130
FCN [46]12.5K0.4810.2200.0200.0350.3600.064
WSCL [65]12.5K0.5110.4750.0750.1220.5720.201
Ours12.5K0.5350.6640.1650.2640.6900.382
", + "bbox": [ + 230, + 143, + 771, + 364 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/f74232e3f49c0f63b7e65fd8e4f8a5d07c420748bbda13b7c8e7391a01868a5a.jpg", + "table_caption": [ + "Table 3: Evaluation results on Novel Manipulation task for both fully supervised and weakly supervised methods. For the methods that are trained on a dataset with a size of $12.5\\mathrm{K}$ , they all utilize CASIAv2 [12] as the training set. For the methods not utilizing CASIAv2, except for RRU-Net, they utilize their synthesis datasets. The best and second-best performances are highlighted using bold and underline, respectively." + ], + "table_footnote": [], + "table_body": "
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Baseline [46]0.1220.5610.2000.052
Baseline+NRR0.1590.5720.2490.070
Baseline+NRR+SCL0.1660.6810.2670.119
Baseline+NRR+SCL+AGAP0.1990.7030.3100.131
", + "bbox": [ + 225, + 470, + 591, + 563 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/e521b3171fe39827f2b02e981a9baaf9c28e9404f84fc18095c6eacd6f30cf61.jpg", + "table_caption": [ + "Table 4: Ablation study of proposed components using CASIAv1 and NIST16 on Weakly Supervised setting. The baseline in this table is FCN [46]." + ], + "table_footnote": [], + "table_body": "
MethodCASIAv1 P-F1NIST16 P-F1
w/o PLS0.1320.082
w/ PLS0.1660.129
", + "bbox": [ + 607, + 479, + 795, + 551 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 5: Ablation pseudo-label selection.", + "bbox": [ + 607, + 551, + 756, + 579 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effectiveness of proposed components: We introduced three novel components: pre-processing stage using Neural Representation Reconstruction (NRR), Selective Pixel-wise Contrastive Learning (SCL), and Adaptive Global-Average Pooling (AGAP) for both un-/weakly supervised IMD. The ablation study conducted in weak mode is shown in Table 4. It is evident that with the progressive integration of our proposed modules, the model's overall ability to detect tampering consistently improves.", + "bbox": [ + 212, + 654, + 792, + 760 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Pseudo-Label Selection (PLS): In our unsupervised method, we introduce PLS, which exclusively leverages high-confidence pseudo-labels from two sources to supervise shallow predictions in the self-distillation training process. The impact of PLS is examined in Table 5. In experiments without PLS, we use image-level predictions in the main branch as pseudo-labels to guide shallow", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/1a8dfbb0121295a2bb5c977da4ed87e458e131877bb9c08d4732c6d9479070a3.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Global-Max Pooling0.0330.5700.0620.058
Global-Average Pooling0.1580.2560.1950.081
Generalized Mean Pooling [50]0.0670.6260.1210.072
Global Smooth Pooling [55]0.0760.6270.1360.080
Adaptive Global-Average Pooling (Ours)0.1990.7030.3100.131
", + "bbox": [ + 269, + 143, + 733, + 255 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 6: Comparisons using different pooling methods.", + "bbox": [ + 313, + 256, + 684, + 268 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "predictions. The proposed PLS proves to be effective in enhancing unsupervised performance.", + "bbox": [ + 212, + 314, + 782, + 344 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Adaptive Global-Average Pooling: To demonstrate the superiority of the proposed AGAP, we conduct an ablation study in weakly supervised setting using different pooling methods, including Global-Max Pooling (GMP), Global-Average Pooling (GAP), Generalized Mean Pooling (GeM) [50], and Global Smooth Pooling (GsM) [55]. The results are shown in Table 6. Similarly, the proposed AGAP achieves the best performance, highlighting its superiority.", + "bbox": [ + 212, + 347, + 785, + 438 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 467, + 357, + 483 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We present a novel framework that integrates unsupervised and weakly-supervised approaches for Image Manipulation Detection (IMD). Our approach features a groundbreaking pre-processing step utilizing a controllable fitting function derived from Implicit Neural Representation, providing a prior for manipulation regions. Additionally, we propose a selective pixel-level contrastive learning technique that prioritizes regions with high confidence, mitigating uncertainty stemming from the absence of pixel-level labels. For image-level prediction, we introduce adaptive global average pooling to thoroughly explore manipulation regions for detection and robust training. In unsupervised mode, we implement pseudo-label selection, choosing high-confidence predictions from deeper layers as pseudo-labels to supervise predictions in shallower layers via a self-distillation training method. Extensive experiments validate our method's effectiveness, demonstrating superior performance compared to existing unsupervised and weakly supervised methods. Notably, our approach competes effectively against fully supervised methods in detecting novel manipulations, showcasing its robustness in real-world scenarios. Limitation of this work includes inaccurate localization of tampered region edges, resulting in larger prediction masks than the ground truth. Future work involves developing more powerful models and effective pre-filters to enhance pixel-level detection performance.", + "bbox": [ + 212, + 506, + 787, + 792 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements: This work is supported by the DARPA Semantic Forensics (SemaFor) Program under contract HR001120C0123 and NSF CCSS-2348046.", + "bbox": [ + 212, + 795, + 785, + 838 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bammey, Q., Gioi, R.G.v., Morel, J.M.: An adaptive neural network for unsupervised mosaic consistency analysis in image forensics. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14194-14204 (2020) 4, 11", + "2. Bi, X., Wei, Y., Xiao, B., Li, W.: Rru-net: The ringed residual u-net for image splicing forgery detection. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (2019) 11, 13", + "3. Bondi, L., Lameri, S., Güera, D., Bestagini, P., Delp, E.J., Tubaro, S.: Tampering detection and localization through clustering of camera-based cnn features. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 1855-1864. IEEE (2017) 8", + "4. Chen, K., Hong, L., Xu, H., Li, Z., Yeung, D.Y.: Multisiam: Self-supervised multi-instance siamese representation learning for autonomous driving. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 7546-7554 (2021) 5", + "5. Chen, X., Dong, C., Ji, J., Cao, J., Li, X.: Image manipulation detection by multiview multiscale supervision. In: IEEE/CVF International Conference on Computer Vision. pp. 14185-14193 (2021) 4, 11, 13", + "6. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8628-8638 (2021) 5", + "7. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022) 5", + "8. Choi, C.H., Choi, J.H., Lee, H.K.: Cfa pattern identification of digital cameras using intermediate value counting. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 21-26 (2011) 4, 11", + "9. Cozzolino, D., Verdoliva, L.: Noiseprint: A cnn based camera model fingerprint. IEEE Transactions on Information Forensics and Security 15, 144-159 (2019) 4, 11", + "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021) 1", + "1. Dong, J., Wang, W., Tan, T.: CASIA image tampering detection evaluation database. http://forensics.idealtest.org (2010) 2, 10", + "2. Dong, J., Wang, W., Tan, T.: Casia image tampering detection evaluation database. In: 2013 IEEE China summit and international conference on signal and information processing. pp. 422-426. IEEE (2013) 3, 10, 12, 13", + "3. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021) 5", + "4. Ergen, T., Kozat, S.S.: Unsupervised anomaly detection with LSTM neural networks. IEEE transactions on neural networks and learning systems 31(8), 3127-3141 (2019) 2", + "5. Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: kdd. vol. 96, pp. 226-231 (1996) 9", + "6. Feng, Y., Feng, Y., You, H., Zhao, X., Gao, Y.: Meshnet: Mesh neural network for 3d shape representation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 33, pp. 8279-8286 (2019) 5" + ], + "bbox": [ + 225, + 172, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Ferrara, P., Bianchi, T., De Rosa, A., Piva, A.: Image forgery localization via fine-grained analysis of cfa artifacts. IEEE Transactions on Information Forensics and Security 7(5), 1566-1577 (2012) 4, 11", + "18. Fridrich, J., Kodovsky, J.: Rich models for steganalysis of digital images. IEEE Transactions on information Forensics and Security 7(3), 868-882 (2012) 5", + "19. Guan, H., Kozak, M., Robertson, E., Lee, Y., Yates, A.N., Delgado, A., Zhou, D., Kheyrkhah, T., Smith, J., Fiscus, J.: Mfc datasets: Large-scale benchmark datasets for media forensic challenge evaluation. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 63-72. IEEE (2019) 10, 12", + "20. Guillaro, F., Cozzolino, D., Sud, A., Dufour, N., Verdoliva, L.: Trufor: Leveraging all-round clues for trustworthy image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20606-20615 (2023) 4, 11, 13", + "21. Guo, X., Liu, X., Ren, Z., Grosz, S., Masi, I., Liu, X.: Hierarchical fine-grained image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3155-3165 (2023) 4, 11, 13", + "22. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9729-9738 (2020) 4, 5, 8", + "23. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) 7, 10", + "24. Hsu, Y.F., Chang, S.F.: Detecting image splicing using geometry invariants and camera characteristics consistency. In: 2006 IEEE International Conference on Multimedia and Expo. pp. 549-552. IEEE (2006) 2, 10, 11", + "25. Hu, X., Zhang, Z., Jiang, Z., Chaudhuri, S., Yang, Z., Nevatia, R.: Span: Spatial pyramid attention network for image manipulation localization. In: European Conference on Computer Vision (ECCV), pp. 312-328. Springer (2020) 4, 11, 13", + "26. Ji, K., Chen, F., Guo, X., Xu, Y., Wang, J., Chen, J.: Uncertainty-guided learning for improving image manipulation detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22456-22465 (2023) 4, 5", + "27. Koch, G., Zemel, R., Salakhutdinov, R., et al.: Siamese neural networks for one-shot image recognition. In: ICML deep learning workshop. vol. 2. Lille (2015) 5", + "28. Kwan, H.M., Gao, G., Zhang, F., Gower, A., Bull, D.: Hinerv: Video compression with hierarchical encoding-based neural representation. Advances in Neural Information Processing Systems 36 (2024) 5", + "29. Kwon, M.J., Nam, S.H., Yu, I.J., Lee, H.K., Kim, C.: LearningJPEG compression artifacts for image manipulation detection and localization. International Journal of Computer Vision pp. 1875-1895 (2022) 4, 11, 13", + "30. Li, J., Chen, Y., Xing, Y.: Memory mechanism for unsupervised anomaly detection. In: The 39th Conference on Uncertainty in Artificial Intelligence (2023) 2", + "31. Li, S., Xia, X., Ge, S., Liu, T.: Selective-supervised contrastive learning with noisy labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 316-325 (2022) 9", + "32. Liu, D., Yu, J.: Otsu method and k-means. In: 2009 Ninth International conference on hybrid intelligent systems. vol. 1, pp. 344-349. IEEE (2009) 8", + "33. Liu, X., Liu, Y., Chen, J., Liu, X.: Pscc-net: Progressive spatio-channel correlation network for image manipulation detection and localization. IEEE Transactions on Circuits and Systems for Video Technology 32(11), 7505-7517 (2022) 4, 11, 13" + ], + "bbox": [ + 215, + 147, + 784, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "34. Lloyd, S.: Least squares quantization in pcm. IEEE transactions on information theory 28(2), 129-137 (1982) 10", + "35. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017) 10", + "36. Lu, X., Wang, W., Ma, C., Shen, J., Shao, L., Porikli, F.: See more, know more: Unsupervised video object segmentation with co-attention siamese networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3623-3632 (2019) 5", + "37. Lyu, S., Pan, X., Zhang, X.: Exposing region splicing forgeries with blind local noise estimation. International journal of computer vision 110, 202-221 (2014) 8", + "38. Mahdian, B., Saic, S.: Using noise inconsistencies for blind image forensics. Image and vision computing 27(10), 1497-1503 (2009) 4, 11, 12", + "39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) 7", + "40. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023) 5", + "41. Niu, Y., Tondi, B., Zhao, Y., Ni, R., Barni, M.: Image splicing detection, localization and attribution via jpeg primary quantization matrix estimation and clustering. IEEE Transactions on Information Forensics and Security 16, 5397-5412 (2021) 8", + "42. Novozamsky, A., Mahdian, B., Saic, S.: Imd2020: A large-scale annotated dataset tailored for detecting manipulated images. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 71-80 (2020) 10", + "43. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979) 9", + "44. Pan, X., Zhang, X., Lyu, S.: Exposing image forgery with blind noise estimation. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 15-20 (2011) 8", + "45. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al.: Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019) 10", + "46. Pathak, D., Shelhamer, E., Long, J., Darrell, T.: Fully convolutional multi-class multiple instance learning. arXiv preprint arXiv:1412.7144 (2014) 11, 13", + "47. Pyatykh, S., Hesser, J., Zheng, L.: Image noise level estimation by principal component analysis. IEEE transactions on image processing 22(2), 687-699 (2012) 8", + "48. Qian, Y., Hong, X., Guo, Z., Arandjelovic, O., Donovan, C.R.: Semi-supervised crowd counting with contextual modeling: Facilitating holistic understanding of crowd scenes. IEEE Transactions on Circuits and Systems for Video Technology (2024) 2", + "49. Qiao, T., Zhang, J., Xu, D., Tao, D.: Mirrorgan: Learning text-to-image generation by redescription. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1505-1514 (2019) 1", + "50. Radenovic, F., Tolias, G., Chum, O.: Fine-tuning cnn image retrieval with no human annotation. IEEE transactions on pattern analysis and machine intelligence 41(7), 1655-1668 (2018) 14" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "51. Shi, J., Xu, N., Bui, T., Dernoncourt, F., Wen, Z., Xu, C.: A benchmark and baseline for language-driven image editing. In: Proceedings of the Asian Conference on Computer Vision (2020) 10", + "52. Smucny, J., Shi, G., Lesh, T.A., Carter, C.S., Davidson, I.: Data augmentation with mixup: Enhancing performance of a functional neuroimaging-based prognostic deep learning classifier in recent onset psychosis. NeuroImage: Clinical 36, 103214 (2022) 2", + "53. Tao, C., Zhu, X., Su, W., Huang, G., Li, B., Zhou, J., Qiao, Y., Wang, X., Dai, J.: Siamese image modeling for self-supervised vision representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2132-2141 (2023) 5", + "54. Wang, J., Wu, Z., Chen, J., Han, X., Shrivastava, A., Lim, S.N., Jiang, Y.G.: Objectformer for image manipulation detection and localization. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2364-2373 (2022) 4, 11, 13", + "55. Wang, L., Lu, H., Wang, Y., Feng, M., Wang, D., Yin, B., Ruan, X.: Learning to detect salient objects with image-level supervision. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 136-145 (2017) 14", + "56. Wei, Y., Liang, X., Chen, Y., Shen, X., Cheng, M.M., Feng, J., Zhao, Y., Yan, S.: Stc: A simple to complex framework for weakly-supervised semantic segmentation. IEEE transactions on pattern analysis and machine intelligence 39(11), 2314-2320 (2016) 2", + "57. Wen, B., Zhu, Y., Subramanian, R., Ng, T.T., Shen, X., Winkler, S.: Coverage - a novel database for copy-move forgery detection. In: IEEE International Conference on Image processing (ICIP) (2016) 2, 10", + "58. Wu, H., Chen, Y., Zhou, J.: Rethinking image forgery detection via contrastive learning and unsupervised clustering. arXiv preprint arXiv:2308.09307 (2023) 4, 8", + "59. Wu, H., Zhou, J., Tian, J., Liu, J.: Robust image forgery detection over online social network shared images. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13440-13449 (2022) 4", + "60. Wu, Y., AbdAlmageed, W., Natarajan, P.: Mantra-net: Manipulation tracing network for detection and localization of image forgeries with anomalous features. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9543-9552 (2019) 4, 11, 12, 13", + "61. Xu, T., Zhang, P., Huang, Q., Zhang, H., Gan, Z., Huang, X., He, X.: Attngan: Fine-grained text to image generation with attentional generative adversarial networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1316-1324 (2018) 1", + "62. Yang, C., Li, H., Lin, F., Jiang, B., Zhao, H.: Constrained r-cnn: A general image manipulation detection model. In: IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2020) 4, 5, 11, 12, 13", + "63. Yang, S., Ding, M., Wu, Y., Li, Z., Zhang, J.: Implicit neural representation for cooperative low-light image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12918-12927 (2023) 3, 5, 7", + "64. Yoon, J., Yu, S., Bansal, M.: Raccoon: Remove, add, and change video content with auto-generated narratives. arXiv preprint arXiv:2405.18406 (2024) 1", + "65. Zhai, Y., Luan, T., Doermann, D., Yuan, J.: Towards generic image manipulation detection with weakly-supervised self-consistency learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22390-22400 (2023) 4, 6, 11, 12, 13" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Z. Zhang et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "66. Zhang, B., Tang, J., Niessner, M., Wonka, P.: 3d shape2vecset: A 3d shape representation for neural fields and generative diffusion models. arXiv preprint arXiv:2301.11445 (2023) 5", + "67. Zhang, H., Wang, R., Zhang, J., Li, C., Yang, G., Spincemaille, P., Nguyen, T., Wang, Y.: Nerd: Neural representation of distribution for medical image segmentation. arXiv preprint arXiv:2103.04020 (2021) 5", + "68. Zhang, K., Mo, L., Chen, W., Sun, H., Su, Y.: Magicbrush: A manually annotated dataset for instruction-guided image editing. Advances in Neural Information Processing Systems 36 (2024) 10", + "69. Zhang, L., Bao, C., Ma, K.: Self-distillation: Towards efficient and compact neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(8), 4388-4403 (2021) 4, 7, 9", + "70. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 1", + "71. Zhang, W., Pang, J., Chen, K., Loy, C.C.: Dense siamese network for dense unsupervised learning. In: European Conference on Computer Vision. pp. 464-480. Springer (2022) 5", + "72. Zhang, Z., Bui, T.D.: Attention-based selection strategy for weakly supervised object localization. In: 2020 25th International Conference on Pattern Recognition (ICPR). pp. 10305-10311. IEEE (2021) 2", + "73. Zhang, Z., Chang, M.C.: Two-stage dual augmentation with clip for improved text-to-sketch synthesis. In: 2023 IEEE 6th International Conference on Multimedia Information Processing and Retrieval (MIPR). pp. 1-6. IEEE (2023) 1", + "74. Zhang, Z., Chang, M.C., Bui, T.D.: Improving class activation map for weakly supervised object localization. In: ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). pp. 2624-2628. IEEE (2022) 2", + "75. Zhang, Z., Li, M., Chang, M.C.: A new benchmark and model for challenging image manipulation detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7405-7413 (2024) 4" + ], + "bbox": [ + 212, + 146, + 787, + 575 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "IMD With INR and Limited Supervision", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_model.json b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_model.json new file mode 100644 index 0000000000000000000000000000000000000000..becbb26aef78e79b6e99706d1e5d8442b0d3abd1 --- /dev/null +++ b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_model.json @@ -0,0 +1,2482 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.229, + 0.141, + 0.776, + 0.187 + ], + "angle": 0, + "content": "Image Manipulation Detection With Implicit Neural Representation and Limited Supervision" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.212, + 0.761, + 0.243 + ], + "angle": 0, + "content": "Zhenfei Zhang\\(^{1}\\), Mingyang Li\\(^{2}\\), Xin Li\\(^{1}\\), Ming-Ching Chang\\(^{1}\\), and Jun-Wei Hsieh\\(^{3}\\)" + }, + { + "type": "text", + "bbox": [ + 0.322, + 0.255, + 0.68, + 0.282 + ], + "angle": 0, + "content": "1 University at Albany, State University of New York \n2 Stanford University" + }, + { + "type": "text", + "bbox": [ + 0.331, + 0.283, + 0.671, + 0.325 + ], + "angle": 0, + "content": "3 National Yang Ming Chiao Tung University {zzhang45, xli48, mchang2}@albany.edu mingyang.li@stanford.edu jwhsieh@nycu.edu.tw" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.36, + 0.744, + 0.653 + ], + "angle": 0, + "content": "Abstract. Image Manipulation Detection (IMD) is becoming increasingly important as tampering technologies advance. However, most state-of-the-art (SoTA) methods require high-quality training datasets featuring image- and pixel-level annotations. The effectiveness of these methods suffers when applied to manipulated or noisy samples that differ from the training data. To address these challenges, we present a unified framework that combines unsupervised and weakly supervised approaches for IMD. Our approach introduces a novel pre-processing stage based on a controllable fitting function from Implicit Neural Representation (INR). Additionally, we introduce a new selective pixel-level contrastive learning approach, which concentrates exclusively on high-confidence regions, thereby mitigating uncertainty associated with the absence of pixel-level labels. In weakly supervised mode, we utilize ground-truth image-level labels to guide predictions from an adaptive pooling method, facilitating comprehensive exploration of manipulation regions for image-level detection. The unsupervised model is trained using a self-distillation training method with selected high-confidence pseudo-labels obtained from the deepest layers via different sources. Extensive experiments demonstrate that our proposed method outperforms existing unsupervised and weakly supervised methods. Moreover, it competes effectively against fully supervised methods on novel manipulation detection tasks." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.665, + 0.741, + 0.694 + ], + "angle": 0, + "content": "Keywords: Image Manipulation Detection \\(\\cdot\\) Implicit Neural Representation \\(\\cdot\\) Weakly Supervised Learning \\(\\cdot\\) Unsupervised Learning" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.719, + 0.377, + 0.735 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The emergence of diverse media tampering tools, such as Photoshop and AI editing and generation methods [10, 49, 61, 64, 70, 73], has made it increasingly convenient to manipulate media content. However, this accessibility also brings forth the concerning issue of widespread misinformation, which can precipitate serious security implications. Therefore, the development and implementation of robust tampering detection technology, namely, Image Manipulation Detection" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.143, + 0.501, + 0.276 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.501, + 0.143, + 0.787, + 0.276 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.287, + 0.788, + 0.427 + ], + "angle": 0, + "content": "Fig. 1: We conducted experiments using three widely-used evaluation datasets containing both authentic and tampered samples. Performance are compared with six SoTA fully supervised IMD methods. The pixel-level F1 score is calculated using tampered images, while image-level accuracy is computed using authentic images. The blue and orange bars represent the original datasets and reconstructed datasets via Implicit Neural Representation, respectively. It is evident that there is a significant performance decrease in all methods when applied to reconstructed images in pixel-level detection compared with the original dataset. On the other hand, performance using authentic images shows less change. The scores are averaged across CASIAv1 [11], Coverage [57], and Columbia [24] datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.459, + 0.788, + 0.55 + ], + "angle": 0, + "content": "(IMD) methods, are imperative to mitigate these risks effectively. The fundamental manipulation operations that previous methods typically address are as follows: (1) Splicing, which involves taking content from one image and pasting it onto another image, (2) Copy-move, in which parts of an image are duplicated and relocated to another location within the same image, (3) Inpainting, which entails erasing parts of an image and replacing them with synthesized content." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.788, + 0.702 + ], + "angle": 0, + "content": "Despite significant advances in fully supervised IMD methods, they encounter several notable challenges. First, these methods often perform poorly when confronted with unseen manipulation types. Second, extension of them towards unseen manipulation types faces challenges due to their reliance on high-quality training datasets with either image-level and pixel-level annotations. Acquiring such datasets is costly and in many cases, impractical, especially considering the myriad varieties of real-life tampering methods. Third, while some language-guided datasets may lack pixel-level labels, they hold advantages handling real-world scenarios. These datasets can potentially enhance the generalization capability of IMD models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.84 + ], + "angle": 0, + "content": "To address the limitations of fully supervised IMD methods and enhance the generalization ability toward real-world use, we propose to integrate unsupervised and weakly supervised approaches into a unified IMD framework. Our framework allows training with solely image-level labels or even without any labels, aligning with many unsupervised and weakly supervised tasks [14, 30, 48, 52, 56, 72, 74]. Compared to the fully supervised methods, our approach comes with superior generalization capabilities and can be trained using datasets without annotations. Our method begins with the observation that tampered regions exhibit differences from authentic regions in most cases, such as the variations" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.142, + 0.787, + 0.355 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.364, + 0.788, + 0.462 + ], + "angle": 0, + "content": "Fig. 2: Examples of Reconstruction Error Maps computed between original and reconstructed images are presented. The first two rows depict the data samples and their corresponding ground-truth masks, respectively. The first three columns showcase tampered image examples, while the last three columns display authentic images, where the ground-truth masks are all black. Apparently, the reconstruction process fails to properly reconstruct the tampered pixels, resulting in activations in the error map. Conversely, less change is observed in the authentic samples." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.788, + 0.583 + ], + "angle": 0, + "content": "in color and lighting, which pose challenges for the fitting function that needs to model regions accurately. It is shown in [63] that the controllable fitting function of Implicit Neural Representation (INR) tends to learn an average representation of the training images. Motivated by this insight, we raise the following question as our hypothesis: if we train an INR solely on authentic images, can the fitting function effectively represent the characteristics of tampered regions?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.789, + 0.81 + ], + "angle": 0, + "content": "To obtain the answer to this question, we first train an INR using only pristine images from CASIAv2 [12] and use it to reconstruct three mainstream datasets. We then apply fully supervised SoTA methods to evaluate the reconstructed datasets, as shown in Fig. 1. Surprisingly, the evaluation results of these methods exhibit a significant decrease when using INR-reconstructed samples, while there is less performance change in the authentic image samples. This outcome leads us to an initial assumption that the INR may not effectively capture the characteristics of tampered regions. To validate this assumption, we compute the reconstruction error map between the reconstructed and original images in Fig. 2. Remarkably, we observe activation in the tampered regions of the tampered samples, while there is no discernible difference in the authentic samples. This observation inspires us to incorporate the INR as a pre-processing method and concatenate the reconstruction error map with the input RGB images before feeding them to the backbone. We name this pre-processing method as Neural Representation Reconstruction (NRR)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Following the success of the pre-processing using INR, we further explore our findings and leverage it fully in our framework. Drawing inspiration from" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.358 + ], + "angle": 0, + "content": "Contrastive Learning [22], we utilize NRR as a contrastive sample generator and introduce selective pixel-level contrastive learning, focusing solely on highly confident regions. This approach effectively mitigates uncertainty associated with the absence of pixel-level labels and further enhances weakly supervised performance. We further extend our method to a fully unsupervised approach trained with selected high-confidence pseudo-labels using a self-distillation [69] training strategy. Finally, previous SoTA methods widely apply Global-Max Pooling (GMP) or Global-Average Pooling (GAP) for image-level detection. However, GMP can hinder training and cause inaccurate predictions, as only the most discriminative response is back-propagated, neglecting the entire tampered content. Conversely, GAP is susceptible to inaccuracies due to weakly activated pixels. To overcome this limitation, we propose an adaptive global-average pooling that focuses on the high-confidence tampered regions. Our method can thus produce more comprehensive and robust image-level predictions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.358, + 0.788, + 0.464 + ], + "angle": 0, + "content": "Experimental evaluations are conducted on seven datasets, including five mainstream datasets featuring general manipulation types and two novel datasets containing unseen tampered samples. The results demonstrate that our methods outperform SoTA weakly and unsupervised methods. Furthermore, our method achieves competitive results compared to fully supervised methods in novel manipulation detection tasks. Finally, our method can be easily extended to the datasets without pixel-level labels, which shows enhanced generalizability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.464, + 0.788, + 0.63 + ], + "angle": 0, + "content": "The contribution of this paper includes the following: (1) We propose a novel method that achieves plausible weakly and unsupervised IMD results. Our method can be easily adapted to images without labels or only with image-level labels. (2) To our knowledge, we are the first to investigate the potential of Implicit Neural Representation (INR) in the IMD task. The pre-process step utilizing INR demonstrates effectiveness in handling tampered cases. (3) We introduce selective supervision, which mitigates uncertainty associated with the absence of labels and further improves detection performance. (4) Extensive experiments validate the efficacy of our proposed methods, showcasing superior performance on both standard and novel manipulation types compared to SoTA methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.651, + 0.39, + 0.667 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.681, + 0.515, + 0.697 + ], + "angle": 0, + "content": "2.1 Image Manipulation Detection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.809 + ], + "angle": 0, + "content": "Most traditional unsupervised IMD methods [1,8,9,17,38] detect manipulation via low-level tampering artifacts including camera fingerprint, double compression, color filter array, etc. The weakly supervised method of [65] applies self-consistency learning from multiple inputs. Most fully supervised IMD [5,20,21, 25,26,33,54,58-60,62] methods aim at detecting anomalous features. The two-branch architecture [29, 75] detects both image-editing and double-compression manipulation traces." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.81, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Unlike previous methods, we propose combining weakly and unsupervised IMD in a single framework. Meanwhile, most SoTA methods apply high-pass fil" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "ters such as SRM [18] and Bayar [62] to suppress low-frequency information and detect noise inconsistency, but they are not adaptive to all manipulation types, especially when the tampered pixels are from the same source as authentic ones. Additionally, noise filters are very sensitive to high-frequency information such as edges, whether manipulated or not, making them ineffective and inefficient. We thus propose a novel pre-processing method using INR, which applies reconstruction error to address this limitation. Our pre-process via reconstruction error can effectively provide a good prior to the model and is non-sensitive to authentic images, as shown in Fig. 2." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.306, + 0.506, + 0.322 + ], + "angle": 0, + "content": "2.2 Image Neural Representation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.332, + 0.788, + 0.438 + ], + "angle": 0, + "content": "Image Neural Representation (INR) has become increasingly popular for image representation. The controllable fitting ability of INR is widely utilized in various applications such as continuous image/video super-resolution [6,7], video/image compression [13, 28], continuous shape representation [16, 66], medical image analysis [40,67], etc. Recently, [63] utilized INR for low-light image enhancement. However, the capability of INR on distinguishing pristine from tampered images has not been documented in the open literature." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.46, + 0.439, + 0.476 + ], + "angle": 0, + "content": "2.3 Contrastive Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.486, + 0.789, + 0.699 + ], + "angle": 0, + "content": "The basic idea of contrastive learning [22] is to repel negative sample pairs while attracting positive pairs. The most popular architecture using contrastive learning is the Siamese network [27], which accepts two inputs simultaneously and the process is supervised by their similarity. This method has been widely applied in unsupervised and self-supervised applications [4,36,53,71]. Traditional unsupervised contrastive learning approaches commonly apply simple image augmentation operations, which may not be easily applicable to IMD due to model uncertainty [26]. Furthermore, image-level similarity, which is commonly used in contrastive learning, cannot be directly applied to IMD as it is unrelated to objects. To apply contrastive learning in un-/weakly supervised IMD, we utilize INR-reconstructed images as counter samples and employ a feature matching process in the final feature space. Building on the potential ability of INR mentioned in Section 1, authentic features tend to have higher matching scores, while tampered features have lower matching scores." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.722, + 0.427, + 0.74 + ], + "angle": 0, + "content": "3 Proposed Method" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.754, + 0.434, + 0.769 + ], + "angle": 0, + "content": "3.1 Overall Architecture" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Fig. 3 illustrates the overall architecture of our IMD framework. The basic architecture comprises two branches with shared weights. Given an RGB image \\( I \\in \\mathbb{R}^{H \\times W \\times 3} \\) where \\( H \\) and \\( W \\) are its height and width, respectively, we first apply Neural Representation Reconstruction (NRR) to reconstruct it as" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.144, + 0.787, + 0.389 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.397, + 0.789, + 0.522 + ], + "angle": 0, + "content": "Fig. 3: An overview of the proposed two-branch framework. The first branch accepts concatenated inputs as the main branch, while the NRR reconstructed image is fed into the second branch as a complementary branch. Selective contrastive learning is applied only to the pixels that have high confidence of being authentic or tampered. The classification results conducted by global-average pooling on both the result of the main branch using Otsu's method and intersected tampered pixels from clustering are used for loss computing. In the weakly supervised setting, ground-truth image-level labels are applied for supervision. In the unsupervised setting, high-confidence pseudolabels from the deepest layers are used to guide the shallow outputs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.789, + 0.844 + ], + "angle": 0, + "content": "\\(I_R \\in \\mathbb{R}^{H \\times W \\times 3}\\) and generate a reconstruction error map \\(I_E \\in \\mathbb{R}^{H \\times W \\times 1}\\) between \\(I_R\\) and \\(I\\). We then concatenate \\(I\\) and \\(I_E\\), feeding them into the first branch, which serves as the main branch. Similar to most IMD methods, the main branch generates a mask using a simple upsampling and Sigmoid activation function on the final feature map. We then apply Otsu's method to adaptively select the activated region for image-level prediction, as done in [65]. The reconstructed image \\(I_R\\) is fed into the second branch, acting as a complementary branch for feature matching. After processing with the backbone, we obtain two feature maps \\(F\\) and \\(F_R\\). We next compute the feature matching scores \\(M\\) between the two feature maps via a dot product, where authentic pixels tend to have higher matching scores and vice versa. For the two-class classification of manipulation detection, unsupervised clustering is applied to \\(F\\) and \\(M\\). We then intersect the two clustering results and exclusively apply pixel-level contrastive learning to the intersected features that exhibit higher confidence in being either authentic or tampered. The image-level classification result is conducted using the proposed adaptive global average pooling, which focuses on the high-confidence tampered regions for comprehensice image-level prediction. In a weakly supervised manner, the ground-truth image-level label is applied to supervise the prediction. In an unsupervised manner, a selected set of high-confidence pseudo" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "labels from the deepest layer are utilized to supervise the shallow prediction via self-distillation [69] training strategy. The high-confidence pseudo-labels are chosen by comparing predictions derived from Otsu's method and clustering technique, opting solely for those consistently identified by both sources." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.227, + 0.58, + 0.243 + ], + "angle": 0, + "content": "3.2 Neural Representation Reconstruction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.249, + 0.785, + 0.383 + ], + "angle": 0, + "content": "Inspired by [63] and the observation from our experiment in Fig. 12, we apply NRR to reconstruct the input image. The reconstruction error can highlight the manipulation trace, thereby furnishing an indispensable prior to the subsequent IMD model. In INR, the input image is first converted to a feature map \\( F_{N} \\in \\mathbb{R}^{H \\times W \\times C} \\) using an image encoder, where \\( H \\) and \\( W \\) are height and width, \\( C \\) is the number of feature channels. The coordinate set of input can be expressed using \\( X \\in \\mathbb{R}^{H \\times W \\times 2} \\). We proceed by concatenating \\( F_{N} \\) and \\( X \\), subsequently feeding them into a Multi-Layer Perceptron (MLP) for decoding. The NRR is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.385, + 0.786, + 0.402 + ], + "angle": 0, + "content": "\\[\nI _ {R} [ x, y ] = M L P \\left(F _ {N} [ x, y ], X [ x, y ]\\right), \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.406, + 0.784, + 0.449 + ], + "angle": 0, + "content": "where \\( I_R \\) is reconstructed RGB pixel values from \\( I \\), \\([x, y]\\) is each pixel location. The main goal of NRR is to reconstruct the RGB values of \\( I \\), with loss function formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.428, + 0.451, + 0.785, + 0.468 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {N R R} = \\left\\| I - I _ {R} \\right\\| _ {1}. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.472, + 0.784, + 0.517 + ], + "angle": 0, + "content": "Note that such reconstruction can not depict the high-frequency pixels properly. We therefore apply the positional encoding from [39] to map \\( X \\) to a higher-dimensional space. Such positional encoding is expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.275, + 0.524, + 0.785, + 0.543 + ], + "angle": 0, + "content": "\\[\nX ^ {\\prime} = \\left(\\sin \\left(2 ^ {0} \\pi X\\right), \\cos \\left(2 ^ {0} \\pi X\\right), \\dots , \\sin \\left(2 ^ {L - 1} \\pi X\\right), \\cos \\left(2 ^ {L - 1} \\pi X\\right)\\right), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.55, + 0.784, + 0.639 + ], + "angle": 0, + "content": "where \\( L \\) is a pre-setting constant to control the fitting ability of NRR. Normally, larger \\( L \\) results in a more accurate fitting. In our task, we aim to avoid outputs from NRR that mirror the inputs; instead, we desire NRR to faithfully preserve information in normal (authentic) content while introducing unfaithfulness in extreme (tampered) pixels. We empirically choose \\( L = 8 \\) as the optimal tradeoff." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.661, + 0.515, + 0.675 + ], + "angle": 0, + "content": "3.3 Selective Contrastive Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.683, + 0.785, + 0.803 + ], + "angle": 0, + "content": "After obtaining \\( I_R \\) from NRR, we calculate the reconstruction error map between \\( I \\) and \\( I_R \\) using \\( I_E = (I_R - I)^2 \\). Then, we concatenate \\( I_E \\) and \\( I \\), enhancing the input to the backbone's first (main) branch. For the input of the second (complementary) branch, we send \\( I_R \\) for feature matching. We employ ResNet50 [23] as a backbone, which consists of four stages that match previous weakly supervised methods. The weights of two branches are shared. After processing by the backbone, we obtain 2 feature outputs \\( F \\) and \\( F_R \\) from different input sources. We then compute the feature matching scores \\( M \\) using the dot product as:" + }, + { + "type": "equation", + "bbox": [ + 0.383, + 0.81, + 0.785, + 0.845 + ], + "angle": 0, + "content": "\\[\nM _ {x, y} = \\sigma \\left(\\frac {P \\left(F _ {R} ^ {x , y}\\right) \\cdot P \\left(F ^ {x , y}\\right)}{\\sqrt {C}}\\right), \\tag {4}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "where \\( M_{x,y} \\) is the similarity score at the spatial location \\( (x,y) \\). The project head \\( P(\\cdot) \\) contains 2 convolutional layers and ReLU activation. The \\( \\sigma(\\cdot) \\) denotes the sigmoid activation function, and \\( \\sqrt{C} \\) provides normalization." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.785, + 0.327 + ], + "angle": 0, + "content": "Due to the ability of NRR to properly reproduce only authentic pixels (and not tampered ones), the high matching scores in \\( M \\) tend to correspond to the authentic parts of the image. In contrast, low scores tend to correspond to manipulated regions of the image. Due to the lack of ground-truth masks to supervise the final features, we apply unsupervised clustering for forged/pristine classification similar to [3, 37, 41, 44, 47, 58] and assume that the cluster with fewer elements is the tampered cluster. This assumption aligns with the real-world situation of current manipulation datasets. The reason is that, in most cases, the tampered region is usually much smaller than the authentic ones." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.328, + 0.787, + 0.476 + ], + "angle": 0, + "content": "Ideally, we can apply pixel-level contrastive learning through InfoNCE [22] on \\( M \\) and \\( F \\) as [58]. However, we found that this method does not work well in our experiments, as clustering may come with low confidence due to the lack of ground-truth masks. To address this issue, we intersect on the clustering results of \\( M \\) and \\( F \\), and denote the intersected clustering as \\( C_I \\). After the intersection, we will have 2 clusters with higher confidence in being either authentic or tampered with, since they come from the same prediction from 2 different sources. We thus apply InfoNCE only to intersected pixels for contrastive learning, leaving the ambiguous pixels unchanged. This selective contrastive learning loss is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.361, + 0.477, + 0.785, + 0.515 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {S C L} = - \\log \\frac {\\frac {1}{J} \\sum_ {j \\in [ 1 , J ]} \\exp \\left(q \\cdot k _ {j} ^ {+} / \\tau\\right)}{\\sum_ {i \\in [ 1 , K ]} \\exp \\left(q \\cdot k _ {i} ^ {-} / \\tau\\right)}, \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.521, + 0.785, + 0.58 + ], + "angle": 0, + "content": "where \\( q \\) is an encoded query; \\( J \\) and \\( K \\) are the number of selected positive and negative keys, respectively; \\( \\tau \\) is a temperature hyper-parameter. We set positive keys \\( k_{j}^{+} \\) as pixels associated with pristine regions, whereas negative keys \\( k_{i}^{-} \\) correspond to pixels linked to tampered regions." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.604, + 0.538, + 0.62 + ], + "angle": 0, + "content": "3.4 Adaptive Global Average Pooling" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.784, + 0.718 + ], + "angle": 0, + "content": "Many existing methods use Global-Max Pooling (GMP) and Global-Average Pooling (GAP) for image-level prediction to determine if the input is authentic or tampered. However, GMP can hinder training and cause inaccurate predictions as only the most discriminative response is back-propagated, neglecting the entire tampered content. Global-Average Pooling (GAP) is susceptible to inaccuracies due to weakly activated pixels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.785, + 0.84 + ], + "angle": 0, + "content": "To tackle these challenges, we introduce Adaptive Global Average Pooling (AGAP), which focuses on the high-confidence tampered regions for comprehensive image-level prediction. Leveraging the intersection of two clustering results (discussed in Section 3.3), we initially apply Global Average Pooling (GAP) exclusively to intersected tampered regions from a clustering perspective. However, relying solely on unsupervised clustering may not guarantee optimal performance and robustness across all input types without ground-truth labels. As discussed in [32], Otsu's method performs well when the image histogram" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.239 + ], + "angle": 0, + "content": "exhibits a bimodal distribution, whereas clustering provides flexibility and the ability to handle more complex histograms. Therefore, we combine Otsu and clustering to enhance image-level prediction and training robustness. Specifically, GAP is applied to the tampered responses from both Otsu and intersected clustering results for loss computation with image-level labels. Further details on Otsu's method and clustering can be found in their respective papers [15, 43]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.264, + 0.616, + 0.28 + ], + "angle": 0, + "content": "3.5 Weakly-supervised and Unsupervised IMD" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.294, + 0.784, + 0.338 + ], + "angle": 0, + "content": "In the weakly-supervised IMD setting, we utilize ground truth image-level labels to supervise the prediction training using a binary cross-entropy (BCE) loss, which is:" + }, + { + "type": "equation", + "bbox": [ + 0.346, + 0.343, + 0.785, + 0.358 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {B C E} (g, \\hat {g}) = - (1 - g) \\log (1 - \\hat {g}) - g \\log (\\hat {g}), \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.368, + 0.784, + 0.413 + ], + "angle": 0, + "content": "where \\( g \\) and \\( \\hat{g} \\) are the ground-truth and prediction scores, respectively. The final classification loss in a weakly supervised manner is the sum of two BCE losses, comparing two pooling results with \\( g \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.414, + 0.784, + 0.459 + ], + "angle": 0, + "content": "In the unsupervised IMD setting, where no labels are used, we employ a self-distillation training strategy [69], using pseudo-labels from the deepest layers as a teacher to supervise the shallow outputs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.785, + 0.61 + ], + "angle": 0, + "content": "To streamline prediction results from shallow layers and mitigate computational overhead, the classification head following each middle stage of the backbone uses spatial-average pooling in the channel dimension, reshaping it into a one-channel feature map. This is followed by a sigmoid function and global-max pooling. In traditional self-distillation methods, combining ground truth loss and self-distillation enhances overall performance, but this approach is not applicable in an unsupervised context. Our experiments revealed that relying solely on self-distillation did not yield satisfactory results, as the outputs from the deepest layers may lack accuracy, hindering the training process and overall performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.612, + 0.784, + 0.718 + ], + "angle": 0, + "content": "Drawing inspiration from the selective-supervised method [31], proven effective in handling noisy label datasets, we leverage its concept of selecting training examples based on the alignment between feature representation and given labels. However, in our unsupervised setting, the absence of labels poses a challenge. To overcome this hurdle, we compare predictions obtained from Otsu and clustering methods, choosing only those consistently predicted by both sources as pseudo-labels for self-distillation training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.784, + 0.794 + ], + "angle": 0, + "content": "In pseudo-label selection, predictions exceeding 0.5 are considered as tampered samples. Similar to weakly supervised setting, we employ BCE loss between selected pseudo-labels and shallow predictions for supervision. During inference, all classification heads in shallow layers are excluded to avoid unnecessary parameters." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Training objective. We first apply trained NRR through \\(\\mathcal{L}_{NRR}\\) as a pretrained model, with all its weights frozen during IMD training. For simplicity, we use the symbol \\(\\mathcal{L}_{cls}\\) to denote the loss functions for classification in both" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "unsupervised and weakly supervised approaches, albeit with slight differences as described above." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.18, + 0.788, + 0.224 + ], + "angle": 0, + "content": "The total loss for our proposed IMD, denoted as \\(\\mathcal{L}_{\\text{total}}\\), is a weighted sum of both classification losses using BCE loss and the selective pixel-level contrastive learning loss:" + }, + { + "type": "equation", + "bbox": [ + 0.411, + 0.231, + 0.786, + 0.248 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {t o t a l}} = \\alpha \\mathcal {L} _ {\\text {c l s}} + \\beta \\mathcal {L} _ {\\text {S C L}}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.261, + 0.555, + 0.275 + ], + "angle": 0, + "content": "where \\(\\alpha\\) and \\(\\beta\\) are weighting hyperparameters." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.31, + 0.377, + 0.328 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.352, + 0.788, + 0.549 + ], + "angle": 0, + "content": "Dataset: Our model is trained using CASIAv2 [12] exclusively, which comprises 7,491 authentic samples and 5,063 tampered images. For the evaluations of the standard IMD task, we employ widely-used benchmarks, including CASIAv1 [11], Coverage [57], Columbia [24], IMD2020 [42], and NIST16 [19]. CASIAv1 [11] consists of both splicing and copy-move images. Coverage [57] contains only copy-move samples with some post-processing approaches. Columbia [24] comprises 363 uncompressed images with an average resolution of \\(938 \\times 720\\). NIST16 [19] and IMD2020 [42] contain only tampered images, suitable for pixel-level evaluation. These datasets cover traditional manipulation types including splicing, copy-move, and removal. For evaluations involving novel or more complex manipulation types, we utilize IEdit [51] and MagicBrush [68], which are two language-driven datasets containing various novel manipulation types, such as action change and light change." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.551, + 0.788, + 0.643 + ], + "angle": 0, + "content": "Evaluation Metrics: We utilize IOU and F1 scores, including P-F1 for pixel-level F1, I-F1 for image-level F1, and C-F1 for combined F1. The C-F1 score accounts for both pixel-level and image-level performance through the harmonic mean, providing an overall performance comparison. All F1 scores and IOU scores are computed using 0.5 as the fixed threshold. Due to the lack of pixel-level masks in IEdit [51], we include image-level ACC for additional evaluation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Implementation Details: We employ ResNet50 [23] as the backbone and the model is implemented using PyTorch [45], with parameters initialized randomly. We apply AdamW [35] as the optimizer. The Multi-Layer Perceptron (MLP) in NRR follows a three-hidden-layer architecture. NRR is trained for 120 epochs with an initial learning rate of \\(2 \\times 10^{-4}\\) and weight decay is applied. The IMD model in weakly supervised mode is trained for 50 epochs with an initial learning rate of 0.0005 and weight decay. For the unsupervised model, we train for 20 epochs with an initial learning rate of 0.0001, applying weight decay. Image augmentation is limited to random flipping and cropping. We use a fixed threshold of 0.5 to extract binary masks from the feature map, consistent with previous methods. Hyperparameters \\(\\alpha\\) and \\(\\beta\\) are set to 1.0 and 0.1, respectively, for weakly supervised training, and 1.0 and 0.3 for unsupervised training. For the clustering algorithms, we used K-means [34]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table", + "bbox": [ + 0.232, + 0.144, + 0.772, + 0.269 + ], + "angle": 0, + "content": "
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1IOUP-F1IOUP-F1IOUP-F1IOUP-F1
NOI [38]0.0750.1320.1520.2360.1220.2100.0480.0740.0910.126
CFAI [17]0.0810.1340.1750.2750.1030.1850.0760.1050.0680.103
MCA [1]0.0490.0890.0850.1480.0780.1360.0490.0740.0440.079
NoisePrint [9]0.0740.1300.0850.3200.0980.1760.0620.1060.0540.104
IVC [8]0.0560.1010.0850.1640.0700.1270.0380.0680.0480.086
Ours0.0970.1660.2160.3440.1310.2170.0800.1290.0790.136
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.271, + 0.785, + 0.296 + ], + "angle": 0, + "content": "Table 1: Evaluation results of unsupervised methods for Standard Manipulation task." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.324, + 0.783, + 0.384 + ], + "angle": 0, + "content": "
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1IOUP-F1
FCN [46]0.0780.1220.5610.2000.0620.0980.5240.1650.0720.1220.4240.1900.0320.0520.0520.086
WSCL [65]0.1000.1630.6790.2630.2200.3210.7200.4440.1020.1710.5710.2630.0470.0780.0930.152
Ours0.1240.1990.7030.3100.2480.3650.6950.4790.1400.2210.6670.3320.0790.1310.1240.204
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.385, + 0.784, + 0.41 + ], + "angle": 0, + "content": "Table 2: Evaluation results of weakly supervised approaches for Standard Manipulation task." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.454, + 0.533, + 0.469 + ], + "angle": 0, + "content": "4.1 Comparison with SoTA Methods" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.787, + 0.538 + ], + "angle": 0, + "content": "For a fair comparison with SoTA methods, we selected approaches for which the source code is publicly available. Among the unsupervised methods applied for comparison are NOI [38], CFAI [17], MCA [1], NoisePrint [9], and IVC [8], while the weakly supervised methods include FCN [46] and WSCL [65]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.539, + 0.79, + 0.599 + ], + "angle": 0, + "content": "Additionally, we conducted experiments using two novel manipulation datasets and compared our approach with fully supervised methods, including RRU-Net [2], Mantra-Net [60], SPAN [25], PSCC-Net [33], Trufor [20], CAT-Net [29], Hifi-Net [21], CR-CNN [62], ObjectFormer [54], and MVSS-Net [5]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.6, + 0.787, + 0.719 + ], + "angle": 0, + "content": "Comparison with SoTA unsupervised methods: Due to the assumption of unsupervised methods that all images contain manipulated parts, they will classify all test images as tampered. Thus, they are not suitable for image-level evaluation. We conduct pixel-level experiments to compare their abilities to localize the manipulated region, as shown in Table 1. We can observe that our proposed method in the unsupervised setting achieves the best detection performance compared to other unsupervised methods across five widely used standard manipulation benchmarks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Comparison with SoTA weakly supervised methods: Table 2 shows experimental results comparing weakly supervised SoTA approaches. Except for the F1 (I-F1) score at the image level in the Columbia [24] dataset, our method performs better than SoTA methods in all other metrics. Regarding the relatively lower I-F1 score in Columbia compared to WSCL [65], we believe the reason is that Columbia does not have post-processing, so our method may not be very sensitive to manipulation. However, despite this issue, our method achieves the best localization performance in the Columbia dataset." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.237, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.785, + 0.471 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.479, + 0.788, + 0.523 + ], + "angle": 0, + "content": "Fig. 4: Visualization results using different methods. The images are displayed in the following order from top to bottom: tampered images, ground truth masks, prediction results from CR-CNN [62], Mantra-Net [60], NOI [38], WSCL [65], and our method." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.551, + 0.788, + 0.672 + ], + "angle": 0, + "content": "Comparison using novel manipulation dataset: In order to show the generalization ability of our method. We conduct evaluations using fully supervised and weakly supervised methods on two novel manipulation detection datasets in Table 3. We can see that the fully supervised methods cannot adapt to the novel manipulation types, resulting in low detection performance even if they utilize a very large synthesis training dataset with both image-level and pixel-level labels. In contrast, our method achieves competitive performance while using extremely few training data with only image-level labels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.672, + 0.788, + 0.749 + ], + "angle": 0, + "content": "Visualization Results: We present some visualization results compared to SoTA methods in Figure 4. Our method can better localize the tampered region, even without the use of pixel-level labels. However, due to the lack of pixel-level labels, our model cannot accurately detect tampered edges. These results of our method are generated from the weakly supervised model." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.77, + 0.391, + 0.787 + ], + "angle": 0, + "content": "4.2 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.793, + 0.84 + ], + "angle": 0, + "content": "We conducted several ablation studies to evaluate the effectiveness of each proposed component. For these studies, we utilized the CASIAv1 [12] and NIST16 [19] datasets." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table", + "bbox": [ + 0.232, + 0.144, + 0.772, + 0.366 + ], + "angle": 0, + "content": "
TypeMethodTraining Data SizeIEditMagicBrush
ACCI-F1IOUP-F1I-F1C-F1
Full SupervisionRRU-Net [2]4.2K0.4820.6510.0930.1530.6670.249
Mantra-Net [60]64K0.4990.6650.0580.1050.6670.181
SPAN [25]96K0.5280.2100.0110.0020.5850.004
PSCC-Net [33]100K0.5240.2060.1320.2100.7100.324
Trufor [20]858K0.5050.6650.2160.3040.6700.418
CAT-Net [29]858K0.4880.5670.0250.0330.7660.063
Hifi-Net [21]1,710K0.5310.4600.0890.1510.6770.247
WeakCR-CNN [62]12.5K0.5310.5300.0250.0420.5930.078
ObjectFormer [54]12.5K0.4970.4270.0290.0470.4300.085
MVSS-Net [5]12.5K0.5260.4870.0450.0720.6750.130
FCN [46]12.5K0.4810.2200.0200.0350.3600.064
WSCL [65]12.5K0.5110.4750.0750.1220.5720.201
Ours12.5K0.5350.6640.1650.2640.6900.382
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.368, + 0.787, + 0.437 + ], + "angle": 0, + "content": "Table 3: Evaluation results on Novel Manipulation task for both fully supervised and weakly supervised methods. For the methods that are trained on a dataset with a size of \\(12.5\\mathrm{K}\\), they all utilize CASIAv2 [12] as the training set. For the methods not utilizing CASIAv2, except for RRU-Net, they utilize their synthesis datasets. The best and second-best performances are highlighted using bold and underline, respectively." + }, + { + "type": "table", + "bbox": [ + 0.226, + 0.472, + 0.593, + 0.564 + ], + "angle": 0, + "content": "
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Baseline [46]0.1220.5610.2000.052
Baseline+NRR0.1590.5720.2490.070
Baseline+NRR+SCL0.1660.6810.2670.119
Baseline+NRR+SCL+AGAP0.1990.7030.3100.131
" + }, + { + "type": "table_caption", + "bbox": [ + 0.221, + 0.565, + 0.593, + 0.605 + ], + "angle": 0, + "content": "Table 4: Ablation study of proposed components using CASIAv1 and NIST16 on Weakly Supervised setting. The baseline in this table is FCN [46]." + }, + { + "type": "table", + "bbox": [ + 0.608, + 0.481, + 0.797, + 0.552 + ], + "angle": 0, + "content": "
MethodCASIAv1 P-F1NIST16 P-F1
w/o PLS0.1320.082
w/ PLS0.1660.129
" + }, + { + "type": "table_caption", + "bbox": [ + 0.608, + 0.553, + 0.758, + 0.58 + ], + "angle": 0, + "content": "Table 5: Ablation pseudo-label selection." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.655, + 0.793, + 0.761 + ], + "angle": 0, + "content": "Effectiveness of proposed components: We introduced three novel components: pre-processing stage using Neural Representation Reconstruction (NRR), Selective Pixel-wise Contrastive Learning (SCL), and Adaptive Global-Average Pooling (AGAP) for both un-/weakly supervised IMD. The ablation study conducted in weak mode is shown in Table 4. It is evident that with the progressive integration of our proposed modules, the model's overall ability to detect tampering consistently improves." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Pseudo-Label Selection (PLS): In our unsupervised method, we introduce PLS, which exclusively leverages high-confidence pseudo-labels from two sources to supervise shallow predictions in the self-distillation training process. The impact of PLS is examined in Table 5. In experiments without PLS, we use image-level predictions in the main branch as pseudo-labels to guide shallow" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "table", + "bbox": [ + 0.27, + 0.145, + 0.734, + 0.256 + ], + "angle": 0, + "content": "
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Global-Max Pooling0.0330.5700.0620.058
Global-Average Pooling0.1580.2560.1950.081
Generalized Mean Pooling [50]0.0670.6260.1210.072
Global Smooth Pooling [55]0.0760.6270.1360.080
Adaptive Global-Average Pooling (Ours)0.1990.7030.3100.131
" + }, + { + "type": "table_caption", + "bbox": [ + 0.315, + 0.257, + 0.686, + 0.27 + ], + "angle": 0, + "content": "Table 6: Comparisons using different pooling methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.315, + 0.784, + 0.345 + ], + "angle": 0, + "content": "predictions. The proposed PLS proves to be effective in enhancing unsupervised performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.348, + 0.787, + 0.439 + ], + "angle": 0, + "content": "Adaptive Global-Average Pooling: To demonstrate the superiority of the proposed AGAP, we conduct an ablation study in weakly supervised setting using different pooling methods, including Global-Max Pooling (GMP), Global-Average Pooling (GAP), Generalized Mean Pooling (GeM) [50], and Global Smooth Pooling (GsM) [55]. The results are shown in Table 6. Similarly, the proposed AGAP achieves the best performance, highlighting its superiority." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.468, + 0.359, + 0.484 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.507, + 0.789, + 0.793 + ], + "angle": 0, + "content": "We present a novel framework that integrates unsupervised and weakly-supervised approaches for Image Manipulation Detection (IMD). Our approach features a groundbreaking pre-processing step utilizing a controllable fitting function derived from Implicit Neural Representation, providing a prior for manipulation regions. Additionally, we propose a selective pixel-level contrastive learning technique that prioritizes regions with high confidence, mitigating uncertainty stemming from the absence of pixel-level labels. For image-level prediction, we introduce adaptive global average pooling to thoroughly explore manipulation regions for detection and robust training. In unsupervised mode, we implement pseudo-label selection, choosing high-confidence predictions from deeper layers as pseudo-labels to supervise predictions in shallower layers via a self-distillation training method. Extensive experiments validate our method's effectiveness, demonstrating superior performance compared to existing unsupervised and weakly supervised methods. Notably, our approach competes effectively against fully supervised methods in detecting novel manipulations, showcasing its robustness in real-world scenarios. Limitation of this work includes inaccurate localization of tampered region edges, resulting in larger prediction masks than the ground truth. Future work involves developing more powerful models and effective pre-filters to enhance pixel-level detection performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.787, + 0.839 + ], + "angle": 0, + "content": "Acknowledgements: This work is supported by the DARPA Semantic Forensics (SemaFor) Program under contract HR001120C0123 and NSF CCSS-2348046." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.173, + 0.787, + 0.228 + ], + "angle": 0, + "content": "1. Bammey, Q., Gioi, R.G.v., Morel, J.M.: An adaptive neural network for unsupervised mosaic consistency analysis in image forensics. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14194-14204 (2020) 4, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.229, + 0.787, + 0.269 + ], + "angle": 0, + "content": "2. Bi, X., Wei, Y., Xiao, B., Li, W.: Rru-net: The ringed residual u-net for image splicing forgery detection. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (2019) 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.27, + 0.787, + 0.323 + ], + "angle": 0, + "content": "3. Bondi, L., Lameri, S., Güera, D., Bestagini, P., Delp, E.J., Tubaro, S.: Tampering detection and localization through clustering of camera-based cnn features. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 1855-1864. IEEE (2017) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.324, + 0.787, + 0.378 + ], + "angle": 0, + "content": "4. Chen, K., Hong, L., Xu, H., Li, Z., Yeung, D.Y.: Multisiam: Self-supervised multi-instance siamese representation learning for autonomous driving. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 7546-7554 (2021) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.379, + 0.787, + 0.419 + ], + "angle": 0, + "content": "5. Chen, X., Dong, C., Ji, J., Cao, J., Li, X.: Image manipulation detection by multiview multiscale supervision. In: IEEE/CVF International Conference on Computer Vision. pp. 14185-14193 (2021) 4, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.787, + 0.46 + ], + "angle": 0, + "content": "6. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8628-8638 (2021) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.461, + 0.787, + 0.514 + ], + "angle": 0, + "content": "7. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.515, + 0.787, + 0.555 + ], + "angle": 0, + "content": "8. Choi, C.H., Choi, J.H., Lee, H.K.: Cfa pattern identification of digital cameras using intermediate value counting. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 21-26 (2011) 4, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.556, + 0.787, + 0.594 + ], + "angle": 0, + "content": "9. Cozzolino, D., Verdoliva, L.: Noiseprint: A cnn based camera model fingerprint. IEEE Transactions on Information Forensics and Security 15, 144-159 (2019) 4, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.596, + 0.787, + 0.623 + ], + "angle": 0, + "content": "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.624, + 0.787, + 0.65 + ], + "angle": 0, + "content": "1. Dong, J., Wang, W., Tan, T.: CASIA image tampering detection evaluation database. http://forensics.idealtest.org (2010) 2, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.651, + 0.787, + 0.69 + ], + "angle": 0, + "content": "2. Dong, J., Wang, W., Tan, T.: Casia image tampering detection evaluation database. In: 2013 IEEE China summit and international conference on signal and information processing. pp. 422-426. IEEE (2013) 3, 10, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.691, + 0.787, + 0.718 + ], + "angle": 0, + "content": "3. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.719, + 0.787, + 0.758 + ], + "angle": 0, + "content": "4. Ergen, T., Kozat, S.S.: Unsupervised anomaly detection with LSTM neural networks. IEEE transactions on neural networks and learning systems 31(8), 3127-3141 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.787, + 0.799 + ], + "angle": 0, + "content": "5. Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: kdd. vol. 96, pp. 226-231 (1996) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.787, + 0.84 + ], + "angle": 0, + "content": "6. Feng, Y., Feng, Y., You, H., Zhao, X., Gao, Y.: Meshnet: Mesh neural network for 3d shape representation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 33, pp. 8279-8286 (2019) 5" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.173, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.128 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "17. Ferrara, P., Bianchi, T., De Rosa, A., Piva, A.: Image forgery localization via fine-grained analysis of cfa artifacts. IEEE Transactions on Information Forensics and Security 7(5), 1566-1577 (2012) 4, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.785, + 0.217 + ], + "angle": 0, + "content": "18. Fridrich, J., Kodovsky, J.: Rich models for steganalysis of digital images. IEEE Transactions on information Forensics and Security 7(3), 868-882 (2012) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.785, + 0.272 + ], + "angle": 0, + "content": "19. Guan, H., Kozak, M., Robertson, E., Lee, Y., Yates, A.N., Delgado, A., Zhou, D., Kheyrkhah, T., Smith, J., Fiscus, J.: Mfc datasets: Large-scale benchmark datasets for media forensic challenge evaluation. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 63-72. IEEE (2019) 10, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.785, + 0.327 + ], + "angle": 0, + "content": "20. Guillaro, F., Cozzolino, D., Sud, A., Dufour, N., Verdoliva, L.: Trufor: Leveraging all-round clues for trustworthy image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20606-20615 (2023) 4, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.382 + ], + "angle": 0, + "content": "21. Guo, X., Liu, X., Ren, Z., Grosz, S., Masi, I., Liu, X.: Hierarchical fine-grained image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3155-3165 (2023) 4, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.383, + 0.785, + 0.424 + ], + "angle": 0, + "content": "22. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9729-9738 (2020) 4, 5, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.466 + ], + "angle": 0, + "content": "23. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) 7, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.508 + ], + "angle": 0, + "content": "24. Hsu, Y.F., Chang, S.F.: Detecting image splicing using geometry invariants and camera characteristics consistency. In: 2006 IEEE International Conference on Multimedia and Expo. pp. 549-552. IEEE (2006) 2, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.785, + 0.55 + ], + "angle": 0, + "content": "25. Hu, X., Zhang, Z., Jiang, Z., Chaudhuri, S., Yang, Z., Nevatia, R.: Span: Spatial pyramid attention network for image manipulation localization. In: European Conference on Computer Vision (ECCV), pp. 312-328. Springer (2020) 4, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.785, + 0.591 + ], + "angle": 0, + "content": "26. Ji, K., Chen, F., Guo, X., Xu, Y., Wang, J., Chen, J.: Uncertainty-guided learning for improving image manipulation detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22456-22465 (2023) 4, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.592, + 0.785, + 0.619 + ], + "angle": 0, + "content": "27. Koch, G., Zemel, R., Salakhutdinov, R., et al.: Siamese neural networks for one-shot image recognition. In: ICML deep learning workshop. vol. 2. Lille (2015) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.62, + 0.785, + 0.66 + ], + "angle": 0, + "content": "28. Kwan, H.M., Gao, G., Zhang, F., Gower, A., Bull, D.: Hinerv: Video compression with hierarchical encoding-based neural representation. Advances in Neural Information Processing Systems 36 (2024) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.661, + 0.785, + 0.702 + ], + "angle": 0, + "content": "29. Kwon, M.J., Nam, S.H., Yu, I.J., Lee, H.K., Kim, C.: LearningJPEG compression artifacts for image manipulation detection and localization. International Journal of Computer Vision pp. 1875-1895 (2022) 4, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.785, + 0.73 + ], + "angle": 0, + "content": "30. Li, J., Chen, Y., Xing, Y.: Memory mechanism for unsupervised anomaly detection. In: The 39th Conference on Uncertainty in Artificial Intelligence (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.785, + 0.771 + ], + "angle": 0, + "content": "31. Li, S., Xia, X., Ge, S., Liu, T.: Selective-supervised contrastive learning with noisy labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 316-325 (2022) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.785, + 0.799 + ], + "angle": 0, + "content": "32. Liu, D., Yu, J.: Otsu method and k-means. In: 2009 Ninth International conference on hybrid intelligent systems. vol. 1, pp. 344-349. IEEE (2009) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.841 + ], + "angle": 0, + "content": "33. Liu, X., Liu, Y., Chen, J., Liu, X.: Pscc-net: Progressive spatio-channel correlation network for image manipulation detection and localization. IEEE Transactions on Circuits and Systems for Video Technology 32(11), 7505-7517 (2022) 4, 11, 13" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.175 + ], + "angle": 0, + "content": "34. Lloyd, S.: Least squares quantization in pcm. IEEE transactions on information theory 28(2), 129-137 (1982) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.175, + 0.788, + 0.203 + ], + "angle": 0, + "content": "35. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.203, + 0.788, + 0.258 + ], + "angle": 0, + "content": "36. Lu, X., Wang, W., Ma, C., Shen, J., Shao, L., Porikli, F.: See more, know more: Unsupervised video object segmentation with co-attention siamese networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3623-3632 (2019) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.258, + 0.788, + 0.286 + ], + "angle": 0, + "content": "37. Lyu, S., Pan, X., Zhang, X.: Exposing region splicing forgeries with blind local noise estimation. International journal of computer vision 110, 202-221 (2014) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.286, + 0.788, + 0.314 + ], + "angle": 0, + "content": "38. Mahdian, B., Saic, S.: Using noise inconsistencies for blind image forensics. Image and vision computing 27(10), 1497-1503 (2009) 4, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.314, + 0.788, + 0.357 + ], + "angle": 0, + "content": "39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.356, + 0.788, + 0.412 + ], + "angle": 0, + "content": "40. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.411, + 0.788, + 0.467 + ], + "angle": 0, + "content": "41. Niu, Y., Tondi, B., Zhao, Y., Ni, R., Barni, M.: Image splicing detection, localization and attribution via jpeg primary quantization matrix estimation and clustering. IEEE Transactions on Information Forensics and Security 16, 5397-5412 (2021) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.466, + 0.788, + 0.509 + ], + "angle": 0, + "content": "42. Novozamsky, A., Mahdian, B., Saic, S.: Imd2020: A large-scale annotated dataset tailored for detecting manipulated images. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 71-80 (2020) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.536 + ], + "angle": 0, + "content": "43. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.536, + 0.788, + 0.577 + ], + "angle": 0, + "content": "44. Pan, X., Zhang, X., Lyu, S.: Exposing image forgery with blind noise estimation. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 15-20 (2011) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.577, + 0.788, + 0.632 + ], + "angle": 0, + "content": "45. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al.: Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.632, + 0.788, + 0.661 + ], + "angle": 0, + "content": "46. Pathak, D., Shelhamer, E., Long, J., Darrell, T.: Fully convolutional multi-class multiple instance learning. arXiv preprint arXiv:1412.7144 (2014) 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.661, + 0.788, + 0.7 + ], + "angle": 0, + "content": "47. Pyatykh, S., Hesser, J., Zheng, L.: Image noise level estimation by principal component analysis. IEEE transactions on image processing 22(2), 687-699 (2012) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.7, + 0.788, + 0.757 + ], + "angle": 0, + "content": "48. Qian, Y., Hong, X., Guo, Z., Arandjelovic, O., Donovan, C.R.: Semi-supervised crowd counting with contextual modeling: Facilitating holistic understanding of crowd scenes. IEEE Transactions on Circuits and Systems for Video Technology (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.757, + 0.788, + 0.799 + ], + "angle": 0, + "content": "49. Qiao, T., Zhang, J., Xu, D., Tao, D.: Mirrorgan: Learning text-to-image generation by redescription. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1505-1514 (2019) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.788, + 0.841 + ], + "angle": 0, + "content": "50. Radenovic, F., Tolias, G., Chum, O.: Fine-tuning cnn image retrieval with no human annotation. IEEE transactions on pattern analysis and machine intelligence 41(7), 1655-1668 (2018) 14" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.128 + ], + "angle": 0, + "content": "Z. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.189 + ], + "angle": 0, + "content": "51. Shi, J., Xu, N., Bui, T., Dernoncourt, F., Wen, Z., Xu, C.: A benchmark and baseline for language-driven image editing. In: Proceedings of the Asian Conference on Computer Vision (2020) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.245 + ], + "angle": 0, + "content": "52. Smucny, J., Shi, G., Lesh, T.A., Carter, C.S., Davidson, I.: Data augmentation with mixup: Enhancing performance of a functional neuroimaging-based prognostic deep learning classifier in recent onset psychosis. NeuroImage: Clinical 36, 103214 (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.786, + 0.3 + ], + "angle": 0, + "content": "53. Tao, C., Zhu, X., Su, W., Huang, G., Li, B., Zhou, J., Qiao, Y., Wang, X., Dai, J.: Siamese image modeling for self-supervised vision representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2132-2141 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.786, + 0.355 + ], + "angle": 0, + "content": "54. Wang, J., Wu, Z., Chen, J., Han, X., Shrivastava, A., Lim, S.N., Jiang, Y.G.: Objectformer for image manipulation detection and localization. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2364-2373 (2022) 4, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.356, + 0.786, + 0.398 + ], + "angle": 0, + "content": "55. Wang, L., Lu, H., Wang, Y., Feng, M., Wang, D., Yin, B., Ruan, X.: Learning to detect salient objects with image-level supervision. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 136-145 (2017) 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.786, + 0.453 + ], + "angle": 0, + "content": "56. Wei, Y., Liang, X., Chen, Y., Shen, X., Cheng, M.M., Feng, J., Zhao, Y., Yan, S.: Stc: A simple to complex framework for weakly-supervised semantic segmentation. IEEE transactions on pattern analysis and machine intelligence 39(11), 2314-2320 (2016) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.786, + 0.495 + ], + "angle": 0, + "content": "57. Wen, B., Zhu, Y., Subramanian, R., Ng, T.T., Shen, X., Winkler, S.: Coverage - a novel database for copy-move forgery detection. In: IEEE International Conference on Image processing (ICIP) (2016) 2, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.786, + 0.522 + ], + "angle": 0, + "content": "58. Wu, H., Chen, Y., Zhou, J.: Rethinking image forgery detection via contrastive learning and unsupervised clustering. arXiv preprint arXiv:2308.09307 (2023) 4, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.786, + 0.564 + ], + "angle": 0, + "content": "59. Wu, H., Zhou, J., Tian, J., Liu, J.: Robust image forgery detection over online social network shared images. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13440-13449 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.786, + 0.619 + ], + "angle": 0, + "content": "60. Wu, Y., AbdAlmageed, W., Natarajan, P.: Mantra-net: Manipulation tracing network for detection and localization of image forgeries with anomalous features. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9543-9552 (2019) 4, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.619, + 0.786, + 0.675 + ], + "angle": 0, + "content": "61. Xu, T., Zhang, P., Huang, Q., Zhang, H., Gan, Z., Huang, X., He, X.: Attngan: Fine-grained text to image generation with attentional generative adversarial networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1316-1324 (2018) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.786, + 0.716 + ], + "angle": 0, + "content": "62. Yang, C., Li, H., Lin, F., Jiang, B., Zhao, H.: Constrained r-cnn: A general image manipulation detection model. In: IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2020) 4, 5, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.786, + 0.758 + ], + "angle": 0, + "content": "63. Yang, S., Ding, M., Wu, Y., Li, Z., Zhang, J.: Implicit neural representation for cooperative low-light image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12918-12927 (2023) 3, 5, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.758, + 0.786, + 0.785 + ], + "angle": 0, + "content": "64. Yoon, J., Yu, S., Bansal, M.: Raccoon: Remove, add, and change video content with auto-generated narratives. arXiv preprint arXiv:2405.18406 (2024) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.785, + 0.786, + 0.84 + ], + "angle": 0, + "content": "65. Zhai, Y., Luan, T., Doermann, D., Yuan, J.: Towards generic image manipulation detection with weakly-supervised self-consistency learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22390-22400 (2023) 4, 6, 11, 12, 13" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "IMD With INR and Limited Supervision" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "66. Zhang, B., Tang, J., Niessner, M., Wonka, P.: 3d shape2vecset: A 3d shape representation for neural fields and generative diffusion models. arXiv preprint arXiv:2301.11445 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.231 + ], + "angle": 0, + "content": "67. Zhang, H., Wang, R., Zhang, J., Li, C., Yang, G., Spincemaille, P., Nguyen, T., Wang, Y.: Nerd: Neural representation of distribution for medical image segmentation. arXiv preprint arXiv:2103.04020 (2021) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.231, + 0.788, + 0.272 + ], + "angle": 0, + "content": "68. Zhang, K., Mo, L., Chen, W., Sun, H., Su, Y.: Magicbrush: A manually annotated dataset for instruction-guided image editing. Advances in Neural Information Processing Systems 36 (2024) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.272, + 0.788, + 0.314 + ], + "angle": 0, + "content": "69. Zhang, L., Bao, C., Ma, K.: Self-distillation: Towards efficient and compact neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(8), 4388-4403 (2021) 4, 7, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.314, + 0.788, + 0.355 + ], + "angle": 0, + "content": "70. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.356, + 0.788, + 0.397 + ], + "angle": 0, + "content": "71. Zhang, W., Pang, J., Chen, K., Loy, C.C.: Dense siamese network for dense unsupervised learning. In: European Conference on Computer Vision. pp. 464-480. Springer (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.397, + 0.788, + 0.438 + ], + "angle": 0, + "content": "72. Zhang, Z., Bui, T.D.: Attention-based selection strategy for weakly supervised object localization. In: 2020 25th International Conference on Pattern Recognition (ICPR). pp. 10305-10311. IEEE (2021) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.439, + 0.788, + 0.481 + ], + "angle": 0, + "content": "73. Zhang, Z., Chang, M.C.: Two-stage dual augmentation with clip for improved text-to-sketch synthesis. In: 2023 IEEE 6th International Conference on Multimedia Information Processing and Retrieval (MIPR). pp. 1-6. IEEE (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.481, + 0.788, + 0.535 + ], + "angle": 0, + "content": "74. Zhang, Z., Chang, M.C., Bui, T.D.: Improving class activation map for weakly supervised object localization. In: ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). pp. 2624-2628. IEEE (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.577 + ], + "angle": 0, + "content": "75. Zhang, Z., Li, M., Chang, M.C.: A new benchmark and model for challenging image manipulation detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7405-7413 (2024) 4" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.577 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_origin.pdf b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3f57637b302c95df3ec65fcf7b2d0e85038b2dca --- /dev/null +++ b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/3937f731-ded7-41b9-ae71-c1c70154d103_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6d09f5c982d7c09d56cf6554d1dcffe9373029d35c74cefeeff05c03e2320114 +size 1116614 diff --git a/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/full.md b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/full.md new file mode 100644 index 0000000000000000000000000000000000000000..2f99b04bf697f9a1b16428397cedc84d21669214 --- /dev/null +++ b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/full.md @@ -0,0 +1,302 @@ +# Image Manipulation Detection With Implicit Neural Representation and Limited Supervision + +Zhenfei Zhang $^{1}$ , Mingyang Li $^{2}$ , Xin Li $^{1}$ , Ming-Ching Chang $^{1}$ , and Jun-Wei Hsieh $^{3}$ + +1 University at Albany, State University of New York +2 Stanford University + +3 National Yang Ming Chiao Tung University {zzhang45, xli48, mchang2}@albany.edu mingyang.li@stanford.edu jwhsieh@nycu.edu.tw + +Abstract. Image Manipulation Detection (IMD) is becoming increasingly important as tampering technologies advance. However, most state-of-the-art (SoTA) methods require high-quality training datasets featuring image- and pixel-level annotations. The effectiveness of these methods suffers when applied to manipulated or noisy samples that differ from the training data. To address these challenges, we present a unified framework that combines unsupervised and weakly supervised approaches for IMD. Our approach introduces a novel pre-processing stage based on a controllable fitting function from Implicit Neural Representation (INR). Additionally, we introduce a new selective pixel-level contrastive learning approach, which concentrates exclusively on high-confidence regions, thereby mitigating uncertainty associated with the absence of pixel-level labels. In weakly supervised mode, we utilize ground-truth image-level labels to guide predictions from an adaptive pooling method, facilitating comprehensive exploration of manipulation regions for image-level detection. The unsupervised model is trained using a self-distillation training method with selected high-confidence pseudo-labels obtained from the deepest layers via different sources. Extensive experiments demonstrate that our proposed method outperforms existing unsupervised and weakly supervised methods. Moreover, it competes effectively against fully supervised methods on novel manipulation detection tasks. + +Keywords: Image Manipulation Detection $\cdot$ Implicit Neural Representation $\cdot$ Weakly Supervised Learning $\cdot$ Unsupervised Learning + +# 1 Introduction + +The emergence of diverse media tampering tools, such as Photoshop and AI editing and generation methods [10, 49, 61, 64, 70, 73], has made it increasingly convenient to manipulate media content. However, this accessibility also brings forth the concerning issue of widespread misinformation, which can precipitate serious security implications. Therefore, the development and implementation of robust tampering detection technology, namely, Image Manipulation Detection + +![](images/93f9aff89cbcb2a3b2d4a45e6583c2714d0a1388c9a00afe92f375a95b67eb7d.jpg) +Fig. 1: We conducted experiments using three widely-used evaluation datasets containing both authentic and tampered samples. Performance are compared with six SoTA fully supervised IMD methods. The pixel-level F1 score is calculated using tampered images, while image-level accuracy is computed using authentic images. The blue and orange bars represent the original datasets and reconstructed datasets via Implicit Neural Representation, respectively. It is evident that there is a significant performance decrease in all methods when applied to reconstructed images in pixel-level detection compared with the original dataset. On the other hand, performance using authentic images shows less change. The scores are averaged across CASIAv1 [11], Coverage [57], and Columbia [24] datasets. + +![](images/fd174b9b3788d9b843a2abb10e0ffcda56dceb9d0f878e1d66ab2d702b8e3e38.jpg) + +(IMD) methods, are imperative to mitigate these risks effectively. The fundamental manipulation operations that previous methods typically address are as follows: (1) Splicing, which involves taking content from one image and pasting it onto another image, (2) Copy-move, in which parts of an image are duplicated and relocated to another location within the same image, (3) Inpainting, which entails erasing parts of an image and replacing them with synthesized content. + +Despite significant advances in fully supervised IMD methods, they encounter several notable challenges. First, these methods often perform poorly when confronted with unseen manipulation types. Second, extension of them towards unseen manipulation types faces challenges due to their reliance on high-quality training datasets with either image-level and pixel-level annotations. Acquiring such datasets is costly and in many cases, impractical, especially considering the myriad varieties of real-life tampering methods. Third, while some language-guided datasets may lack pixel-level labels, they hold advantages handling real-world scenarios. These datasets can potentially enhance the generalization capability of IMD models. + +To address the limitations of fully supervised IMD methods and enhance the generalization ability toward real-world use, we propose to integrate unsupervised and weakly supervised approaches into a unified IMD framework. Our framework allows training with solely image-level labels or even without any labels, aligning with many unsupervised and weakly supervised tasks [14, 30, 48, 52, 56, 72, 74]. Compared to the fully supervised methods, our approach comes with superior generalization capabilities and can be trained using datasets without annotations. Our method begins with the observation that tampered regions exhibit differences from authentic regions in most cases, such as the variations + +![](images/3ef590abf9741ce9a2b929eece18008118be44689cd9b859d85040f2f56adc2d.jpg) +Fig. 2: Examples of Reconstruction Error Maps computed between original and reconstructed images are presented. The first two rows depict the data samples and their corresponding ground-truth masks, respectively. The first three columns showcase tampered image examples, while the last three columns display authentic images, where the ground-truth masks are all black. Apparently, the reconstruction process fails to properly reconstruct the tampered pixels, resulting in activations in the error map. Conversely, less change is observed in the authentic samples. + +in color and lighting, which pose challenges for the fitting function that needs to model regions accurately. It is shown in [63] that the controllable fitting function of Implicit Neural Representation (INR) tends to learn an average representation of the training images. Motivated by this insight, we raise the following question as our hypothesis: if we train an INR solely on authentic images, can the fitting function effectively represent the characteristics of tampered regions? + +To obtain the answer to this question, we first train an INR using only pristine images from CASIAv2 [12] and use it to reconstruct three mainstream datasets. We then apply fully supervised SoTA methods to evaluate the reconstructed datasets, as shown in Fig. 1. Surprisingly, the evaluation results of these methods exhibit a significant decrease when using INR-reconstructed samples, while there is less performance change in the authentic image samples. This outcome leads us to an initial assumption that the INR may not effectively capture the characteristics of tampered regions. To validate this assumption, we compute the reconstruction error map between the reconstructed and original images in Fig. 2. Remarkably, we observe activation in the tampered regions of the tampered samples, while there is no discernible difference in the authentic samples. This observation inspires us to incorporate the INR as a pre-processing method and concatenate the reconstruction error map with the input RGB images before feeding them to the backbone. We name this pre-processing method as Neural Representation Reconstruction (NRR). + +Following the success of the pre-processing using INR, we further explore our findings and leverage it fully in our framework. Drawing inspiration from + +Contrastive Learning [22], we utilize NRR as a contrastive sample generator and introduce selective pixel-level contrastive learning, focusing solely on highly confident regions. This approach effectively mitigates uncertainty associated with the absence of pixel-level labels and further enhances weakly supervised performance. We further extend our method to a fully unsupervised approach trained with selected high-confidence pseudo-labels using a self-distillation [69] training strategy. Finally, previous SoTA methods widely apply Global-Max Pooling (GMP) or Global-Average Pooling (GAP) for image-level detection. However, GMP can hinder training and cause inaccurate predictions, as only the most discriminative response is back-propagated, neglecting the entire tampered content. Conversely, GAP is susceptible to inaccuracies due to weakly activated pixels. To overcome this limitation, we propose an adaptive global-average pooling that focuses on the high-confidence tampered regions. Our method can thus produce more comprehensive and robust image-level predictions. + +Experimental evaluations are conducted on seven datasets, including five mainstream datasets featuring general manipulation types and two novel datasets containing unseen tampered samples. The results demonstrate that our methods outperform SoTA weakly and unsupervised methods. Furthermore, our method achieves competitive results compared to fully supervised methods in novel manipulation detection tasks. Finally, our method can be easily extended to the datasets without pixel-level labels, which shows enhanced generalizability. + +The contribution of this paper includes the following: (1) We propose a novel method that achieves plausible weakly and unsupervised IMD results. Our method can be easily adapted to images without labels or only with image-level labels. (2) To our knowledge, we are the first to investigate the potential of Implicit Neural Representation (INR) in the IMD task. The pre-process step utilizing INR demonstrates effectiveness in handling tampered cases. (3) We introduce selective supervision, which mitigates uncertainty associated with the absence of labels and further improves detection performance. (4) Extensive experiments validate the efficacy of our proposed methods, showcasing superior performance on both standard and novel manipulation types compared to SoTA methods. + +# 2 Related Work + +# 2.1 Image Manipulation Detection + +Most traditional unsupervised IMD methods [1,8,9,17,38] detect manipulation via low-level tampering artifacts including camera fingerprint, double compression, color filter array, etc. The weakly supervised method of [65] applies self-consistency learning from multiple inputs. Most fully supervised IMD [5,20,21, 25,26,33,54,58-60,62] methods aim at detecting anomalous features. The two-branch architecture [29, 75] detects both image-editing and double-compression manipulation traces. + +Unlike previous methods, we propose combining weakly and unsupervised IMD in a single framework. Meanwhile, most SoTA methods apply high-pass fil + +ters such as SRM [18] and Bayar [62] to suppress low-frequency information and detect noise inconsistency, but they are not adaptive to all manipulation types, especially when the tampered pixels are from the same source as authentic ones. Additionally, noise filters are very sensitive to high-frequency information such as edges, whether manipulated or not, making them ineffective and inefficient. We thus propose a novel pre-processing method using INR, which applies reconstruction error to address this limitation. Our pre-process via reconstruction error can effectively provide a good prior to the model and is non-sensitive to authentic images, as shown in Fig. 2. + +# 2.2 Image Neural Representation + +Image Neural Representation (INR) has become increasingly popular for image representation. The controllable fitting ability of INR is widely utilized in various applications such as continuous image/video super-resolution [6,7], video/image compression [13, 28], continuous shape representation [16, 66], medical image analysis [40,67], etc. Recently, [63] utilized INR for low-light image enhancement. However, the capability of INR on distinguishing pristine from tampered images has not been documented in the open literature. + +# 2.3 Contrastive Learning + +The basic idea of contrastive learning [22] is to repel negative sample pairs while attracting positive pairs. The most popular architecture using contrastive learning is the Siamese network [27], which accepts two inputs simultaneously and the process is supervised by their similarity. This method has been widely applied in unsupervised and self-supervised applications [4,36,53,71]. Traditional unsupervised contrastive learning approaches commonly apply simple image augmentation operations, which may not be easily applicable to IMD due to model uncertainty [26]. Furthermore, image-level similarity, which is commonly used in contrastive learning, cannot be directly applied to IMD as it is unrelated to objects. To apply contrastive learning in un-/weakly supervised IMD, we utilize INR-reconstructed images as counter samples and employ a feature matching process in the final feature space. Building on the potential ability of INR mentioned in Section 1, authentic features tend to have higher matching scores, while tampered features have lower matching scores. + +# 3 Proposed Method + +# 3.1 Overall Architecture + +Fig. 3 illustrates the overall architecture of our IMD framework. The basic architecture comprises two branches with shared weights. Given an RGB image $I \in \mathbb{R}^{H \times W \times 3}$ where $H$ and $W$ are its height and width, respectively, we first apply Neural Representation Reconstruction (NRR) to reconstruct it as + +![](images/a9230c6b43e30c0e90ee72dedae729a6836bbb0f46d85d5a46e81885a4b9a695.jpg) +Fig. 3: An overview of the proposed two-branch framework. The first branch accepts concatenated inputs as the main branch, while the NRR reconstructed image is fed into the second branch as a complementary branch. Selective contrastive learning is applied only to the pixels that have high confidence of being authentic or tampered. The classification results conducted by global-average pooling on both the result of the main branch using Otsu's method and intersected tampered pixels from clustering are used for loss computing. In the weakly supervised setting, ground-truth image-level labels are applied for supervision. In the unsupervised setting, high-confidence pseudolabels from the deepest layers are used to guide the shallow outputs. + +$I_R \in \mathbb{R}^{H \times W \times 3}$ and generate a reconstruction error map $I_E \in \mathbb{R}^{H \times W \times 1}$ between $I_R$ and $I$ . We then concatenate $I$ and $I_E$ , feeding them into the first branch, which serves as the main branch. Similar to most IMD methods, the main branch generates a mask using a simple upsampling and Sigmoid activation function on the final feature map. We then apply Otsu's method to adaptively select the activated region for image-level prediction, as done in [65]. The reconstructed image $I_R$ is fed into the second branch, acting as a complementary branch for feature matching. After processing with the backbone, we obtain two feature maps $F$ and $F_R$ . We next compute the feature matching scores $M$ between the two feature maps via a dot product, where authentic pixels tend to have higher matching scores and vice versa. For the two-class classification of manipulation detection, unsupervised clustering is applied to $F$ and $M$ . We then intersect the two clustering results and exclusively apply pixel-level contrastive learning to the intersected features that exhibit higher confidence in being either authentic or tampered. The image-level classification result is conducted using the proposed adaptive global average pooling, which focuses on the high-confidence tampered regions for comprehensice image-level prediction. In a weakly supervised manner, the ground-truth image-level label is applied to supervise the prediction. In an unsupervised manner, a selected set of high-confidence pseudo + +labels from the deepest layer are utilized to supervise the shallow prediction via self-distillation [69] training strategy. The high-confidence pseudo-labels are chosen by comparing predictions derived from Otsu's method and clustering technique, opting solely for those consistently identified by both sources. + +# 3.2 Neural Representation Reconstruction + +Inspired by [63] and the observation from our experiment in Fig. 12, we apply NRR to reconstruct the input image. The reconstruction error can highlight the manipulation trace, thereby furnishing an indispensable prior to the subsequent IMD model. In INR, the input image is first converted to a feature map $F_{N} \in \mathbb{R}^{H \times W \times C}$ using an image encoder, where $H$ and $W$ are height and width, $C$ is the number of feature channels. The coordinate set of input can be expressed using $X \in \mathbb{R}^{H \times W \times 2}$ . We proceed by concatenating $F_{N}$ and $X$ , subsequently feeding them into a Multi-Layer Perceptron (MLP) for decoding. The NRR is formulated as: + +$$ +I _ {R} [ x, y ] = M L P \left(F _ {N} [ x, y ], X [ x, y ]\right), \tag {1} +$$ + +where $I_R$ is reconstructed RGB pixel values from $I$ , $[x, y]$ is each pixel location. The main goal of NRR is to reconstruct the RGB values of $I$ , with loss function formulated as: + +$$ +\mathcal {L} _ {N R R} = \left\| I - I _ {R} \right\| _ {1}. \tag {2} +$$ + +Note that such reconstruction can not depict the high-frequency pixels properly. We therefore apply the positional encoding from [39] to map $X$ to a higher-dimensional space. Such positional encoding is expressed as: + +$$ +X ^ {\prime} = \left(\sin \left(2 ^ {0} \pi X\right), \cos \left(2 ^ {0} \pi X\right), \dots , \sin \left(2 ^ {L - 1} \pi X\right), \cos \left(2 ^ {L - 1} \pi X\right)\right), \tag {3} +$$ + +where $L$ is a pre-setting constant to control the fitting ability of NRR. Normally, larger $L$ results in a more accurate fitting. In our task, we aim to avoid outputs from NRR that mirror the inputs; instead, we desire NRR to faithfully preserve information in normal (authentic) content while introducing unfaithfulness in extreme (tampered) pixels. We empirically choose $L = 8$ as the optimal tradeoff. + +# 3.3 Selective Contrastive Learning + +After obtaining $I_R$ from NRR, we calculate the reconstruction error map between $I$ and $I_R$ using $I_E = (I_R - I)^2$ . Then, we concatenate $I_E$ and $I$ , enhancing the input to the backbone's first (main) branch. For the input of the second (complementary) branch, we send $I_R$ for feature matching. We employ ResNet50 [23] as a backbone, which consists of four stages that match previous weakly supervised methods. The weights of two branches are shared. After processing by the backbone, we obtain 2 feature outputs $F$ and $F_R$ from different input sources. We then compute the feature matching scores $M$ using the dot product as: + +$$ +M _ {x, y} = \sigma \left(\frac {P \left(F _ {R} ^ {x , y}\right) \cdot P \left(F ^ {x , y}\right)}{\sqrt {C}}\right), \tag {4} +$$ + +where $M_{x,y}$ is the similarity score at the spatial location $(x,y)$ . The project head $P(\cdot)$ contains 2 convolutional layers and ReLU activation. The $\sigma(\cdot)$ denotes the sigmoid activation function, and $\sqrt{C}$ provides normalization. + +Due to the ability of NRR to properly reproduce only authentic pixels (and not tampered ones), the high matching scores in $M$ tend to correspond to the authentic parts of the image. In contrast, low scores tend to correspond to manipulated regions of the image. Due to the lack of ground-truth masks to supervise the final features, we apply unsupervised clustering for forged/pristine classification similar to [3, 37, 41, 44, 47, 58] and assume that the cluster with fewer elements is the tampered cluster. This assumption aligns with the real-world situation of current manipulation datasets. The reason is that, in most cases, the tampered region is usually much smaller than the authentic ones. + +Ideally, we can apply pixel-level contrastive learning through InfoNCE [22] on $M$ and $F$ as [58]. However, we found that this method does not work well in our experiments, as clustering may come with low confidence due to the lack of ground-truth masks. To address this issue, we intersect on the clustering results of $M$ and $F$ , and denote the intersected clustering as $C_I$ . After the intersection, we will have 2 clusters with higher confidence in being either authentic or tampered with, since they come from the same prediction from 2 different sources. We thus apply InfoNCE only to intersected pixels for contrastive learning, leaving the ambiguous pixels unchanged. This selective contrastive learning loss is formulated as: + +$$ +\mathcal {L} _ {S C L} = - \log \frac {\frac {1}{J} \sum_ {j \in [ 1 , J ]} \exp \left(q \cdot k _ {j} ^ {+} / \tau\right)}{\sum_ {i \in [ 1 , K ]} \exp \left(q \cdot k _ {i} ^ {-} / \tau\right)}, \tag {5} +$$ + +where $q$ is an encoded query; $J$ and $K$ are the number of selected positive and negative keys, respectively; $\tau$ is a temperature hyper-parameter. We set positive keys $k_{j}^{+}$ as pixels associated with pristine regions, whereas negative keys $k_{i}^{-}$ correspond to pixels linked to tampered regions. + +# 3.4 Adaptive Global Average Pooling + +Many existing methods use Global-Max Pooling (GMP) and Global-Average Pooling (GAP) for image-level prediction to determine if the input is authentic or tampered. However, GMP can hinder training and cause inaccurate predictions as only the most discriminative response is back-propagated, neglecting the entire tampered content. Global-Average Pooling (GAP) is susceptible to inaccuracies due to weakly activated pixels. + +To tackle these challenges, we introduce Adaptive Global Average Pooling (AGAP), which focuses on the high-confidence tampered regions for comprehensive image-level prediction. Leveraging the intersection of two clustering results (discussed in Section 3.3), we initially apply Global Average Pooling (GAP) exclusively to intersected tampered regions from a clustering perspective. However, relying solely on unsupervised clustering may not guarantee optimal performance and robustness across all input types without ground-truth labels. As discussed in [32], Otsu's method performs well when the image histogram + +exhibits a bimodal distribution, whereas clustering provides flexibility and the ability to handle more complex histograms. Therefore, we combine Otsu and clustering to enhance image-level prediction and training robustness. Specifically, GAP is applied to the tampered responses from both Otsu and intersected clustering results for loss computation with image-level labels. Further details on Otsu's method and clustering can be found in their respective papers [15, 43]. + +# 3.5 Weakly-supervised and Unsupervised IMD + +In the weakly-supervised IMD setting, we utilize ground truth image-level labels to supervise the prediction training using a binary cross-entropy (BCE) loss, which is: + +$$ +\mathcal {L} _ {B C E} (g, \hat {g}) = - (1 - g) \log (1 - \hat {g}) - g \log (\hat {g}), \tag {6} +$$ + +where $g$ and $\hat{g}$ are the ground-truth and prediction scores, respectively. The final classification loss in a weakly supervised manner is the sum of two BCE losses, comparing two pooling results with $g$ . + +In the unsupervised IMD setting, where no labels are used, we employ a self-distillation training strategy [69], using pseudo-labels from the deepest layers as a teacher to supervise the shallow outputs. + +To streamline prediction results from shallow layers and mitigate computational overhead, the classification head following each middle stage of the backbone uses spatial-average pooling in the channel dimension, reshaping it into a one-channel feature map. This is followed by a sigmoid function and global-max pooling. In traditional self-distillation methods, combining ground truth loss and self-distillation enhances overall performance, but this approach is not applicable in an unsupervised context. Our experiments revealed that relying solely on self-distillation did not yield satisfactory results, as the outputs from the deepest layers may lack accuracy, hindering the training process and overall performance. + +Drawing inspiration from the selective-supervised method [31], proven effective in handling noisy label datasets, we leverage its concept of selecting training examples based on the alignment between feature representation and given labels. However, in our unsupervised setting, the absence of labels poses a challenge. To overcome this hurdle, we compare predictions obtained from Otsu and clustering methods, choosing only those consistently predicted by both sources as pseudo-labels for self-distillation training. + +In pseudo-label selection, predictions exceeding 0.5 are considered as tampered samples. Similar to weakly supervised setting, we employ BCE loss between selected pseudo-labels and shallow predictions for supervision. During inference, all classification heads in shallow layers are excluded to avoid unnecessary parameters. + +Training objective. We first apply trained NRR through $\mathcal{L}_{NRR}$ as a pretrained model, with all its weights frozen during IMD training. For simplicity, we use the symbol $\mathcal{L}_{cls}$ to denote the loss functions for classification in both + +unsupervised and weakly supervised approaches, albeit with slight differences as described above. + +The total loss for our proposed IMD, denoted as $\mathcal{L}_{\text{total}}$ , is a weighted sum of both classification losses using BCE loss and the selective pixel-level contrastive learning loss: + +$$ +\mathcal {L} _ {\text {t o t a l}} = \alpha \mathcal {L} _ {\text {c l s}} + \beta \mathcal {L} _ {\text {S C L}}, \tag {7} +$$ + +where $\alpha$ and $\beta$ are weighting hyperparameters. + +# 4 Experiments + +Dataset: Our model is trained using CASIAv2 [12] exclusively, which comprises 7,491 authentic samples and 5,063 tampered images. For the evaluations of the standard IMD task, we employ widely-used benchmarks, including CASIAv1 [11], Coverage [57], Columbia [24], IMD2020 [42], and NIST16 [19]. CASIAv1 [11] consists of both splicing and copy-move images. Coverage [57] contains only copy-move samples with some post-processing approaches. Columbia [24] comprises 363 uncompressed images with an average resolution of $938 \times 720$ . NIST16 [19] and IMD2020 [42] contain only tampered images, suitable for pixel-level evaluation. These datasets cover traditional manipulation types including splicing, copy-move, and removal. For evaluations involving novel or more complex manipulation types, we utilize IEdit [51] and MagicBrush [68], which are two language-driven datasets containing various novel manipulation types, such as action change and light change. + +Evaluation Metrics: We utilize IOU and F1 scores, including P-F1 for pixel-level F1, I-F1 for image-level F1, and C-F1 for combined F1. The C-F1 score accounts for both pixel-level and image-level performance through the harmonic mean, providing an overall performance comparison. All F1 scores and IOU scores are computed using 0.5 as the fixed threshold. Due to the lack of pixel-level masks in IEdit [51], we include image-level ACC for additional evaluation. + +Implementation Details: We employ ResNet50 [23] as the backbone and the model is implemented using PyTorch [45], with parameters initialized randomly. We apply AdamW [35] as the optimizer. The Multi-Layer Perceptron (MLP) in NRR follows a three-hidden-layer architecture. NRR is trained for 120 epochs with an initial learning rate of $2 \times 10^{-4}$ and weight decay is applied. The IMD model in weakly supervised mode is trained for 50 epochs with an initial learning rate of 0.0005 and weight decay. For the unsupervised model, we train for 20 epochs with an initial learning rate of 0.0001, applying weight decay. Image augmentation is limited to random flipping and cropping. We use a fixed threshold of 0.5 to extract binary masks from the feature map, consistent with previous methods. Hyperparameters $\alpha$ and $\beta$ are set to 1.0 and 0.1, respectively, for weakly supervised training, and 1.0 and 0.3 for unsupervised training. For the clustering algorithms, we used K-means [34]. + +
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1IOUP-F1IOUP-F1IOUP-F1IOUP-F1
NOI [38]0.0750.1320.1520.2360.1220.2100.0480.0740.0910.126
CFAI [17]0.0810.1340.1750.2750.1030.1850.0760.1050.0680.103
MCA [1]0.0490.0890.0850.1480.0780.1360.0490.0740.0440.079
NoisePrint [9]0.0740.1300.0850.3200.0980.1760.0620.1060.0540.104
IVC [8]0.0560.1010.0850.1640.0700.1270.0380.0680.0480.086
Ours0.0970.1660.2160.3440.1310.2170.0800.1290.0790.136
+ +Table 1: Evaluation results of unsupervised methods for Standard Manipulation task. + +
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1IOUP-F1
FCN [46]0.0780.1220.5610.2000.0620.0980.5240.1650.0720.1220.4240.1900.0320.0520.0520.086
WSCL [65]0.1000.1630.6790.2630.2200.3210.7200.4440.1020.1710.5710.2630.0470.0780.0930.152
Ours0.1240.1990.7030.3100.2480.3650.6950.4790.1400.2210.6670.3320.0790.1310.1240.204
+ +Table 2: Evaluation results of weakly supervised approaches for Standard Manipulation task. + +# 4.1 Comparison with SoTA Methods + +For a fair comparison with SoTA methods, we selected approaches for which the source code is publicly available. Among the unsupervised methods applied for comparison are NOI [38], CFAI [17], MCA [1], NoisePrint [9], and IVC [8], while the weakly supervised methods include FCN [46] and WSCL [65]. + +Additionally, we conducted experiments using two novel manipulation datasets and compared our approach with fully supervised methods, including RRU-Net [2], Mantra-Net [60], SPAN [25], PSCC-Net [33], Trufor [20], CAT-Net [29], Hifi-Net [21], CR-CNN [62], ObjectFormer [54], and MVSS-Net [5]. + +Comparison with SoTA unsupervised methods: Due to the assumption of unsupervised methods that all images contain manipulated parts, they will classify all test images as tampered. Thus, they are not suitable for image-level evaluation. We conduct pixel-level experiments to compare their abilities to localize the manipulated region, as shown in Table 1. We can observe that our proposed method in the unsupervised setting achieves the best detection performance compared to other unsupervised methods across five widely used standard manipulation benchmarks. + +Comparison with SoTA weakly supervised methods: Table 2 shows experimental results comparing weakly supervised SoTA approaches. Except for the F1 (I-F1) score at the image level in the Columbia [24] dataset, our method performs better than SoTA methods in all other metrics. Regarding the relatively lower I-F1 score in Columbia compared to WSCL [65], we believe the reason is that Columbia does not have post-processing, so our method may not be very sensitive to manipulation. However, despite this issue, our method achieves the best localization performance in the Columbia dataset. + +![](images/3176a8421b36ffc0850bd6fd506160599c2a2c0b0ac11d607e9ac885363346c9.jpg) +Fig. 4: Visualization results using different methods. The images are displayed in the following order from top to bottom: tampered images, ground truth masks, prediction results from CR-CNN [62], Mantra-Net [60], NOI [38], WSCL [65], and our method. + +Comparison using novel manipulation dataset: In order to show the generalization ability of our method. We conduct evaluations using fully supervised and weakly supervised methods on two novel manipulation detection datasets in Table 3. We can see that the fully supervised methods cannot adapt to the novel manipulation types, resulting in low detection performance even if they utilize a very large synthesis training dataset with both image-level and pixel-level labels. In contrast, our method achieves competitive performance while using extremely few training data with only image-level labels. + +Visualization Results: We present some visualization results compared to SoTA methods in Figure 4. Our method can better localize the tampered region, even without the use of pixel-level labels. However, due to the lack of pixel-level labels, our model cannot accurately detect tampered edges. These results of our method are generated from the weakly supervised model. + +# 4.2 Ablation Study + +We conducted several ablation studies to evaluate the effectiveness of each proposed component. For these studies, we utilized the CASIAv1 [12] and NIST16 [19] datasets. + +
TypeMethodTraining Data SizeIEditMagicBrush
ACCI-F1IOUP-F1I-F1C-F1
Full SupervisionRRU-Net [2]4.2K0.4820.6510.0930.1530.6670.249
Mantra-Net [60]64K0.4990.6650.0580.1050.6670.181
SPAN [25]96K0.5280.2100.0110.0020.5850.004
PSCC-Net [33]100K0.5240.2060.1320.2100.7100.324
Trufor [20]858K0.5050.6650.2160.3040.6700.418
CAT-Net [29]858K0.4880.5670.0250.0330.7660.063
Hifi-Net [21]1,710K0.5310.4600.0890.1510.6770.247
WeakCR-CNN [62]12.5K0.5310.5300.0250.0420.5930.078
ObjectFormer [54]12.5K0.4970.4270.0290.0470.4300.085
MVSS-Net [5]12.5K0.5260.4870.0450.0720.6750.130
FCN [46]12.5K0.4810.2200.0200.0350.3600.064
WSCL [65]12.5K0.5110.4750.0750.1220.5720.201
Ours12.5K0.5350.6640.1650.2640.6900.382
+ +Table 3: Evaluation results on Novel Manipulation task for both fully supervised and weakly supervised methods. For the methods that are trained on a dataset with a size of $12.5\mathrm{K}$ , they all utilize CASIAv2 [12] as the training set. For the methods not utilizing CASIAv2, except for RRU-Net, they utilize their synthesis datasets. The best and second-best performances are highlighted using bold and underline, respectively. + +
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Baseline [46]0.1220.5610.2000.052
Baseline+NRR0.1590.5720.2490.070
Baseline+NRR+SCL0.1660.6810.2670.119
Baseline+NRR+SCL+AGAP0.1990.7030.3100.131
+ +Table 4: Ablation study of proposed components using CASIAv1 and NIST16 on Weakly Supervised setting. The baseline in this table is FCN [46]. + +
MethodCASIAv1 P-F1NIST16 P-F1
w/o PLS0.1320.082
w/ PLS0.1660.129
+ +Table 5: Ablation pseudo-label selection. + +Effectiveness of proposed components: We introduced three novel components: pre-processing stage using Neural Representation Reconstruction (NRR), Selective Pixel-wise Contrastive Learning (SCL), and Adaptive Global-Average Pooling (AGAP) for both un-/weakly supervised IMD. The ablation study conducted in weak mode is shown in Table 4. It is evident that with the progressive integration of our proposed modules, the model's overall ability to detect tampering consistently improves. + +Pseudo-Label Selection (PLS): In our unsupervised method, we introduce PLS, which exclusively leverages high-confidence pseudo-labels from two sources to supervise shallow predictions in the self-distillation training process. The impact of PLS is examined in Table 5. In experiments without PLS, we use image-level predictions in the main branch as pseudo-labels to guide shallow + +
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Global-Max Pooling0.0330.5700.0620.058
Global-Average Pooling0.1580.2560.1950.081
Generalized Mean Pooling [50]0.0670.6260.1210.072
Global Smooth Pooling [55]0.0760.6270.1360.080
Adaptive Global-Average Pooling (Ours)0.1990.7030.3100.131
+ +Table 6: Comparisons using different pooling methods. + +predictions. The proposed PLS proves to be effective in enhancing unsupervised performance. + +Adaptive Global-Average Pooling: To demonstrate the superiority of the proposed AGAP, we conduct an ablation study in weakly supervised setting using different pooling methods, including Global-Max Pooling (GMP), Global-Average Pooling (GAP), Generalized Mean Pooling (GeM) [50], and Global Smooth Pooling (GsM) [55]. The results are shown in Table 6. Similarly, the proposed AGAP achieves the best performance, highlighting its superiority. + +# 5 Conclusion + +We present a novel framework that integrates unsupervised and weakly-supervised approaches for Image Manipulation Detection (IMD). Our approach features a groundbreaking pre-processing step utilizing a controllable fitting function derived from Implicit Neural Representation, providing a prior for manipulation regions. Additionally, we propose a selective pixel-level contrastive learning technique that prioritizes regions with high confidence, mitigating uncertainty stemming from the absence of pixel-level labels. For image-level prediction, we introduce adaptive global average pooling to thoroughly explore manipulation regions for detection and robust training. In unsupervised mode, we implement pseudo-label selection, choosing high-confidence predictions from deeper layers as pseudo-labels to supervise predictions in shallower layers via a self-distillation training method. Extensive experiments validate our method's effectiveness, demonstrating superior performance compared to existing unsupervised and weakly supervised methods. Notably, our approach competes effectively against fully supervised methods in detecting novel manipulations, showcasing its robustness in real-world scenarios. Limitation of this work includes inaccurate localization of tampered region edges, resulting in larger prediction masks than the ground truth. Future work involves developing more powerful models and effective pre-filters to enhance pixel-level detection performance. + +Acknowledgements: This work is supported by the DARPA Semantic Forensics (SemaFor) Program under contract HR001120C0123 and NSF CCSS-2348046. + +# References + +1. Bammey, Q., Gioi, R.G.v., Morel, J.M.: An adaptive neural network for unsupervised mosaic consistency analysis in image forensics. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14194-14204 (2020) 4, 11 +2. Bi, X., Wei, Y., Xiao, B., Li, W.: Rru-net: The ringed residual u-net for image splicing forgery detection. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (2019) 11, 13 +3. Bondi, L., Lameri, S., Güera, D., Bestagini, P., Delp, E.J., Tubaro, S.: Tampering detection and localization through clustering of camera-based cnn features. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 1855-1864. IEEE (2017) 8 +4. Chen, K., Hong, L., Xu, H., Li, Z., Yeung, D.Y.: Multisiam: Self-supervised multi-instance siamese representation learning for autonomous driving. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 7546-7554 (2021) 5 +5. Chen, X., Dong, C., Ji, J., Cao, J., Li, X.: Image manipulation detection by multiview multiscale supervision. In: IEEE/CVF International Conference on Computer Vision. pp. 14185-14193 (2021) 4, 11, 13 +6. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8628-8638 (2021) 5 +7. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022) 5 +8. Choi, C.H., Choi, J.H., Lee, H.K.: Cfa pattern identification of digital cameras using intermediate value counting. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 21-26 (2011) 4, 11 +9. Cozzolino, D., Verdoliva, L.: Noiseprint: A cnn based camera model fingerprint. IEEE Transactions on Information Forensics and Security 15, 144-159 (2019) 4, 11 +0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021) 1 +1. Dong, J., Wang, W., Tan, T.: CASIA image tampering detection evaluation database. http://forensics.idealtest.org (2010) 2, 10 +2. Dong, J., Wang, W., Tan, T.: Casia image tampering detection evaluation database. In: 2013 IEEE China summit and international conference on signal and information processing. pp. 422-426. IEEE (2013) 3, 10, 12, 13 +3. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021) 5 +4. Ergen, T., Kozat, S.S.: Unsupervised anomaly detection with LSTM neural networks. IEEE transactions on neural networks and learning systems 31(8), 3127-3141 (2019) 2 +5. Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: kdd. vol. 96, pp. 226-231 (1996) 9 +6. Feng, Y., Feng, Y., You, H., Zhao, X., Gao, Y.: Meshnet: Mesh neural network for 3d shape representation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 33, pp. 8279-8286 (2019) 5 + +17. Ferrara, P., Bianchi, T., De Rosa, A., Piva, A.: Image forgery localization via fine-grained analysis of cfa artifacts. IEEE Transactions on Information Forensics and Security 7(5), 1566-1577 (2012) 4, 11 +18. Fridrich, J., Kodovsky, J.: Rich models for steganalysis of digital images. IEEE Transactions on information Forensics and Security 7(3), 868-882 (2012) 5 +19. Guan, H., Kozak, M., Robertson, E., Lee, Y., Yates, A.N., Delgado, A., Zhou, D., Kheyrkhah, T., Smith, J., Fiscus, J.: Mfc datasets: Large-scale benchmark datasets for media forensic challenge evaluation. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 63-72. IEEE (2019) 10, 12 +20. Guillaro, F., Cozzolino, D., Sud, A., Dufour, N., Verdoliva, L.: Trufor: Leveraging all-round clues for trustworthy image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20606-20615 (2023) 4, 11, 13 +21. Guo, X., Liu, X., Ren, Z., Grosz, S., Masi, I., Liu, X.: Hierarchical fine-grained image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3155-3165 (2023) 4, 11, 13 +22. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9729-9738 (2020) 4, 5, 8 +23. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) 7, 10 +24. Hsu, Y.F., Chang, S.F.: Detecting image splicing using geometry invariants and camera characteristics consistency. In: 2006 IEEE International Conference on Multimedia and Expo. pp. 549-552. IEEE (2006) 2, 10, 11 +25. Hu, X., Zhang, Z., Jiang, Z., Chaudhuri, S., Yang, Z., Nevatia, R.: Span: Spatial pyramid attention network for image manipulation localization. In: European Conference on Computer Vision (ECCV), pp. 312-328. Springer (2020) 4, 11, 13 +26. Ji, K., Chen, F., Guo, X., Xu, Y., Wang, J., Chen, J.: Uncertainty-guided learning for improving image manipulation detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22456-22465 (2023) 4, 5 +27. Koch, G., Zemel, R., Salakhutdinov, R., et al.: Siamese neural networks for one-shot image recognition. In: ICML deep learning workshop. vol. 2. Lille (2015) 5 +28. Kwan, H.M., Gao, G., Zhang, F., Gower, A., Bull, D.: Hinerv: Video compression with hierarchical encoding-based neural representation. Advances in Neural Information Processing Systems 36 (2024) 5 +29. Kwon, M.J., Nam, S.H., Yu, I.J., Lee, H.K., Kim, C.: LearningJPEG compression artifacts for image manipulation detection and localization. International Journal of Computer Vision pp. 1875-1895 (2022) 4, 11, 13 +30. Li, J., Chen, Y., Xing, Y.: Memory mechanism for unsupervised anomaly detection. In: The 39th Conference on Uncertainty in Artificial Intelligence (2023) 2 +31. Li, S., Xia, X., Ge, S., Liu, T.: Selective-supervised contrastive learning with noisy labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 316-325 (2022) 9 +32. Liu, D., Yu, J.: Otsu method and k-means. In: 2009 Ninth International conference on hybrid intelligent systems. vol. 1, pp. 344-349. IEEE (2009) 8 +33. Liu, X., Liu, Y., Chen, J., Liu, X.: Pscc-net: Progressive spatio-channel correlation network for image manipulation detection and localization. IEEE Transactions on Circuits and Systems for Video Technology 32(11), 7505-7517 (2022) 4, 11, 13 + +34. Lloyd, S.: Least squares quantization in pcm. IEEE transactions on information theory 28(2), 129-137 (1982) 10 +35. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017) 10 +36. Lu, X., Wang, W., Ma, C., Shen, J., Shao, L., Porikli, F.: See more, know more: Unsupervised video object segmentation with co-attention siamese networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3623-3632 (2019) 5 +37. Lyu, S., Pan, X., Zhang, X.: Exposing region splicing forgeries with blind local noise estimation. International journal of computer vision 110, 202-221 (2014) 8 +38. Mahdian, B., Saic, S.: Using noise inconsistencies for blind image forensics. Image and vision computing 27(10), 1497-1503 (2009) 4, 11, 12 +39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) 7 +40. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023) 5 +41. Niu, Y., Tondi, B., Zhao, Y., Ni, R., Barni, M.: Image splicing detection, localization and attribution via jpeg primary quantization matrix estimation and clustering. IEEE Transactions on Information Forensics and Security 16, 5397-5412 (2021) 8 +42. Novozamsky, A., Mahdian, B., Saic, S.: Imd2020: A large-scale annotated dataset tailored for detecting manipulated images. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 71-80 (2020) 10 +43. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979) 9 +44. Pan, X., Zhang, X., Lyu, S.: Exposing image forgery with blind noise estimation. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 15-20 (2011) 8 +45. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al.: Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019) 10 +46. Pathak, D., Shelhamer, E., Long, J., Darrell, T.: Fully convolutional multi-class multiple instance learning. arXiv preprint arXiv:1412.7144 (2014) 11, 13 +47. Pyatykh, S., Hesser, J., Zheng, L.: Image noise level estimation by principal component analysis. IEEE transactions on image processing 22(2), 687-699 (2012) 8 +48. Qian, Y., Hong, X., Guo, Z., Arandjelovic, O., Donovan, C.R.: Semi-supervised crowd counting with contextual modeling: Facilitating holistic understanding of crowd scenes. IEEE Transactions on Circuits and Systems for Video Technology (2024) 2 +49. Qiao, T., Zhang, J., Xu, D., Tao, D.: Mirrorgan: Learning text-to-image generation by redescription. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1505-1514 (2019) 1 +50. Radenovic, F., Tolias, G., Chum, O.: Fine-tuning cnn image retrieval with no human annotation. IEEE transactions on pattern analysis and machine intelligence 41(7), 1655-1668 (2018) 14 + +51. Shi, J., Xu, N., Bui, T., Dernoncourt, F., Wen, Z., Xu, C.: A benchmark and baseline for language-driven image editing. In: Proceedings of the Asian Conference on Computer Vision (2020) 10 +52. Smucny, J., Shi, G., Lesh, T.A., Carter, C.S., Davidson, I.: Data augmentation with mixup: Enhancing performance of a functional neuroimaging-based prognostic deep learning classifier in recent onset psychosis. NeuroImage: Clinical 36, 103214 (2022) 2 +53. Tao, C., Zhu, X., Su, W., Huang, G., Li, B., Zhou, J., Qiao, Y., Wang, X., Dai, J.: Siamese image modeling for self-supervised vision representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2132-2141 (2023) 5 +54. Wang, J., Wu, Z., Chen, J., Han, X., Shrivastava, A., Lim, S.N., Jiang, Y.G.: Objectformer for image manipulation detection and localization. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2364-2373 (2022) 4, 11, 13 +55. Wang, L., Lu, H., Wang, Y., Feng, M., Wang, D., Yin, B., Ruan, X.: Learning to detect salient objects with image-level supervision. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 136-145 (2017) 14 +56. Wei, Y., Liang, X., Chen, Y., Shen, X., Cheng, M.M., Feng, J., Zhao, Y., Yan, S.: Stc: A simple to complex framework for weakly-supervised semantic segmentation. IEEE transactions on pattern analysis and machine intelligence 39(11), 2314-2320 (2016) 2 +57. Wen, B., Zhu, Y., Subramanian, R., Ng, T.T., Shen, X., Winkler, S.: Coverage - a novel database for copy-move forgery detection. In: IEEE International Conference on Image processing (ICIP) (2016) 2, 10 +58. Wu, H., Chen, Y., Zhou, J.: Rethinking image forgery detection via contrastive learning and unsupervised clustering. arXiv preprint arXiv:2308.09307 (2023) 4, 8 +59. Wu, H., Zhou, J., Tian, J., Liu, J.: Robust image forgery detection over online social network shared images. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13440-13449 (2022) 4 +60. Wu, Y., AbdAlmageed, W., Natarajan, P.: Mantra-net: Manipulation tracing network for detection and localization of image forgeries with anomalous features. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9543-9552 (2019) 4, 11, 12, 13 +61. Xu, T., Zhang, P., Huang, Q., Zhang, H., Gan, Z., Huang, X., He, X.: Attngan: Fine-grained text to image generation with attentional generative adversarial networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1316-1324 (2018) 1 +62. Yang, C., Li, H., Lin, F., Jiang, B., Zhao, H.: Constrained r-cnn: A general image manipulation detection model. In: IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2020) 4, 5, 11, 12, 13 +63. Yang, S., Ding, M., Wu, Y., Li, Z., Zhang, J.: Implicit neural representation for cooperative low-light image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12918-12927 (2023) 3, 5, 7 +64. Yoon, J., Yu, S., Bansal, M.: Raccoon: Remove, add, and change video content with auto-generated narratives. arXiv preprint arXiv:2405.18406 (2024) 1 +65. Zhai, Y., Luan, T., Doermann, D., Yuan, J.: Towards generic image manipulation detection with weakly-supervised self-consistency learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22390-22400 (2023) 4, 6, 11, 12, 13 + +66. Zhang, B., Tang, J., Niessner, M., Wonka, P.: 3d shape2vecset: A 3d shape representation for neural fields and generative diffusion models. arXiv preprint arXiv:2301.11445 (2023) 5 +67. Zhang, H., Wang, R., Zhang, J., Li, C., Yang, G., Spincemaille, P., Nguyen, T., Wang, Y.: Nerd: Neural representation of distribution for medical image segmentation. arXiv preprint arXiv:2103.04020 (2021) 5 +68. Zhang, K., Mo, L., Chen, W., Sun, H., Su, Y.: Magicbrush: A manually annotated dataset for instruction-guided image editing. Advances in Neural Information Processing Systems 36 (2024) 10 +69. Zhang, L., Bao, C., Ma, K.: Self-distillation: Towards efficient and compact neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(8), 4388-4403 (2021) 4, 7, 9 +70. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 1 +71. Zhang, W., Pang, J., Chen, K., Loy, C.C.: Dense siamese network for dense unsupervised learning. In: European Conference on Computer Vision. pp. 464-480. Springer (2022) 5 +72. Zhang, Z., Bui, T.D.: Attention-based selection strategy for weakly supervised object localization. In: 2020 25th International Conference on Pattern Recognition (ICPR). pp. 10305-10311. IEEE (2021) 2 +73. Zhang, Z., Chang, M.C.: Two-stage dual augmentation with clip for improved text-to-sketch synthesis. In: 2023 IEEE 6th International Conference on Multimedia Information Processing and Retrieval (MIPR). pp. 1-6. IEEE (2023) 1 +74. Zhang, Z., Chang, M.C., Bui, T.D.: Improving class activation map for weakly supervised object localization. In: ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). pp. 2624-2628. IEEE (2022) 2 +75. Zhang, Z., Li, M., Chang, M.C.: A new benchmark and model for challenging image manipulation detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7405-7413 (2024) 4 \ No newline at end of file diff --git a/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/images.zip b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..fd18935f618dd876d57ca34b279107fb244a961c --- /dev/null +++ b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fc595c8858bbeca9f6da1ac03e86b7410d9e63e91a7e232dd0d2b534d8c0cd41 +size 521063 diff --git a/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/layout.json b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..777c67bbe27b8bd8fce4c7dde6bfc201615adab7 --- /dev/null +++ b/2024/Image Manipulation Detection With Implicit Neural Representation and Limited Supervision/layout.json @@ -0,0 +1,9130 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 140, + 111, + 474, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 111, + 474, + 148 + ], + "spans": [ + { + "bbox": [ + 140, + 111, + 474, + 148 + ], + "type": "text", + "content": "Image Manipulation Detection With Implicit Neural Representation and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "spans": [ + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "text", + "content": "Zhenfei Zhang" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "text", + "content": ", Mingyang Li" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "text", + "content": ", Xin Li" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "text", + "content": ", Ming-Ching Chang" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "text", + "content": ", and Jun-Wei Hsieh" + }, + { + "bbox": [ + 147, + 167, + 465, + 192 + ], + "type": "inline_equation", + "content": "^{3}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 197, + 201, + 416, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 201, + 416, + 223 + ], + "spans": [ + { + "bbox": [ + 197, + 201, + 416, + 223 + ], + "type": "text", + "content": "1 University at Albany, State University of New York \n2 Stanford University" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 202, + 224, + 410, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 224, + 410, + 257 + ], + "spans": [ + { + "bbox": [ + 202, + 224, + 410, + 257 + ], + "type": "text", + "content": "3 National Yang Ming Chiao Tung University {zzhang45, xli48, mchang2}@albany.edu mingyang.li@stanford.edu jwhsieh@nycu.edu.tw" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 285, + 455, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 285, + 455, + 517 + ], + "spans": [ + { + "bbox": [ + 159, + 285, + 455, + 517 + ], + "type": "text", + "content": "Abstract. Image Manipulation Detection (IMD) is becoming increasingly important as tampering technologies advance. However, most state-of-the-art (SoTA) methods require high-quality training datasets featuring image- and pixel-level annotations. The effectiveness of these methods suffers when applied to manipulated or noisy samples that differ from the training data. To address these challenges, we present a unified framework that combines unsupervised and weakly supervised approaches for IMD. Our approach introduces a novel pre-processing stage based on a controllable fitting function from Implicit Neural Representation (INR). Additionally, we introduce a new selective pixel-level contrastive learning approach, which concentrates exclusively on high-confidence regions, thereby mitigating uncertainty associated with the absence of pixel-level labels. In weakly supervised mode, we utilize ground-truth image-level labels to guide predictions from an adaptive pooling method, facilitating comprehensive exploration of manipulation regions for image-level detection. The unsupervised model is trained using a self-distillation training method with selected high-confidence pseudo-labels obtained from the deepest layers via different sources. Extensive experiments demonstrate that our proposed method outperforms existing unsupervised and weakly supervised methods. Moreover, it competes effectively against fully supervised methods on novel manipulation detection tasks." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "spans": [ + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "text", + "content": "Keywords: Image Manipulation Detection " + }, + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "text", + "content": " Implicit Neural Representation " + }, + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "text", + "content": " Weakly Supervised Learning " + }, + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 526, + 453, + 549 + ], + "type": "text", + "content": " Unsupervised Learning" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 569, + 230, + 582 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 569, + 230, + 582 + ], + "spans": [ + { + "bbox": [ + 132, + 569, + 230, + 582 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "The emergence of diverse media tampering tools, such as Photoshop and AI editing and generation methods [10, 49, 61, 64, 70, 73], has made it increasingly convenient to manipulate media content. However, this accessibility also brings forth the concerning issue of widespread misinformation, which can precipitate serious security implications. Therefore, the development and implementation of robust tampering detection technology, namely, Image Manipulation Detection" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 113, + 306, + 218 + ], + "blocks": [ + { + "bbox": [ + 132, + 113, + 306, + 218 + ], + "lines": [ + { + "bbox": [ + 132, + 113, + 306, + 218 + ], + "spans": [ + { + "bbox": [ + 132, + 113, + 306, + 218 + ], + "type": "image", + "image_path": "93f9aff89cbcb2a3b2d4a45e6583c2714d0a1388c9a00afe92f375a95b67eb7d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 227, + 482, + 338 + ], + "lines": [ + { + "bbox": [ + 130, + 227, + 482, + 338 + ], + "spans": [ + { + "bbox": [ + 130, + 227, + 482, + 338 + ], + "type": "text", + "content": "Fig. 1: We conducted experiments using three widely-used evaluation datasets containing both authentic and tampered samples. Performance are compared with six SoTA fully supervised IMD methods. The pixel-level F1 score is calculated using tampered images, while image-level accuracy is computed using authentic images. The blue and orange bars represent the original datasets and reconstructed datasets via Implicit Neural Representation, respectively. It is evident that there is a significant performance decrease in all methods when applied to reconstructed images in pixel-level detection compared with the original dataset. On the other hand, performance using authentic images shows less change. The scores are averaged across CASIAv1 [11], Coverage [57], and Columbia [24] datasets." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 306, + 113, + 481, + 218 + ], + "blocks": [ + { + "bbox": [ + 306, + 113, + 481, + 218 + ], + "lines": [ + { + "bbox": [ + 306, + 113, + 481, + 218 + ], + "spans": [ + { + "bbox": [ + 306, + 113, + 481, + 218 + ], + "type": "image", + "image_path": "fd174b9b3788d9b843a2abb10e0ffcda56dceb9d0f878e1d66ab2d702b8e3e38.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 363, + 482, + 435 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 363, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 363, + 482, + 435 + ], + "type": "text", + "content": "(IMD) methods, are imperative to mitigate these risks effectively. The fundamental manipulation operations that previous methods typically address are as follows: (1) Splicing, which involves taking content from one image and pasting it onto another image, (2) Copy-move, in which parts of an image are duplicated and relocated to another location within the same image, (3) Inpainting, which entails erasing parts of an image and replacing them with synthesized content." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 437, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 555 + ], + "type": "text", + "content": "Despite significant advances in fully supervised IMD methods, they encounter several notable challenges. First, these methods often perform poorly when confronted with unseen manipulation types. Second, extension of them towards unseen manipulation types faces challenges due to their reliance on high-quality training datasets with either image-level and pixel-level annotations. Acquiring such datasets is costly and in many cases, impractical, especially considering the myriad varieties of real-life tampering methods. Third, while some language-guided datasets may lack pixel-level labels, they hold advantages handling real-world scenarios. These datasets can potentially enhance the generalization capability of IMD models." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "content": "To address the limitations of fully supervised IMD methods and enhance the generalization ability toward real-world use, we propose to integrate unsupervised and weakly supervised approaches into a unified IMD framework. Our framework allows training with solely image-level labels or even without any labels, aligning with many unsupervised and weakly supervised tasks [14, 30, 48, 52, 56, 72, 74]. Compared to the fully supervised methods, our approach comes with superior generalization capabilities and can be trained using datasets without annotations. Our method begins with the observation that tampered regions exhibit differences from authentic regions in most cases, such as the variations" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 112, + 481, + 281 + ], + "blocks": [ + { + "bbox": [ + 132, + 112, + 481, + 281 + ], + "lines": [ + { + "bbox": [ + 132, + 112, + 481, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 112, + 481, + 281 + ], + "type": "image", + "image_path": "3ef590abf9741ce9a2b929eece18008118be44689cd9b859d85040f2f56adc2d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 288, + 482, + 365 + ], + "lines": [ + { + "bbox": [ + 130, + 288, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 288, + 482, + 365 + ], + "type": "text", + "content": "Fig. 2: Examples of Reconstruction Error Maps computed between original and reconstructed images are presented. The first two rows depict the data samples and their corresponding ground-truth masks, respectively. The first three columns showcase tampered image examples, while the last three columns display authentic images, where the ground-truth masks are all black. Apparently, the reconstruction process fails to properly reconstruct the tampered pixels, resulting in activations in the error map. Conversely, less change is observed in the authentic samples." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 389, + 482, + 461 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 482, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 482, + 461 + ], + "type": "text", + "content": "in color and lighting, which pose challenges for the fitting function that needs to model regions accurately. It is shown in [63] that the controllable fitting function of Implicit Neural Representation (INR) tends to learn an average representation of the training images. Motivated by this insight, we raise the following question as our hypothesis: if we train an INR solely on authentic images, can the fitting function effectively represent the characteristics of tampered regions?" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 462, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 482, + 641 + ], + "type": "text", + "content": "To obtain the answer to this question, we first train an INR using only pristine images from CASIAv2 [12] and use it to reconstruct three mainstream datasets. We then apply fully supervised SoTA methods to evaluate the reconstructed datasets, as shown in Fig. 1. Surprisingly, the evaluation results of these methods exhibit a significant decrease when using INR-reconstructed samples, while there is less performance change in the authentic image samples. This outcome leads us to an initial assumption that the INR may not effectively capture the characteristics of tampered regions. To validate this assumption, we compute the reconstruction error map between the reconstructed and original images in Fig. 2. Remarkably, we observe activation in the tampered regions of the tampered samples, while there is no discernible difference in the authentic samples. This observation inspires us to incorporate the INR as a pre-processing method and concatenate the reconstruction error map with the input RGB images before feeding them to the backbone. We name this pre-processing method as Neural Representation Reconstruction (NRR)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "Following the success of the pre-processing using INR, we further explore our findings and leverage it fully in our framework. Drawing inspiration from" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 283 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 283 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 283 + ], + "type": "text", + "content": "Contrastive Learning [22], we utilize NRR as a contrastive sample generator and introduce selective pixel-level contrastive learning, focusing solely on highly confident regions. This approach effectively mitigates uncertainty associated with the absence of pixel-level labels and further enhances weakly supervised performance. We further extend our method to a fully unsupervised approach trained with selected high-confidence pseudo-labels using a self-distillation [69] training strategy. Finally, previous SoTA methods widely apply Global-Max Pooling (GMP) or Global-Average Pooling (GAP) for image-level detection. However, GMP can hinder training and cause inaccurate predictions, as only the most discriminative response is back-propagated, neglecting the entire tampered content. Conversely, GAP is susceptible to inaccuracies due to weakly activated pixels. To overcome this limitation, we propose an adaptive global-average pooling that focuses on the high-confidence tampered regions. Our method can thus produce more comprehensive and robust image-level predictions." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 283, + 482, + 367 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 283, + 482, + 367 + ], + "spans": [ + { + "bbox": [ + 130, + 283, + 482, + 367 + ], + "type": "text", + "content": "Experimental evaluations are conducted on seven datasets, including five mainstream datasets featuring general manipulation types and two novel datasets containing unseen tampered samples. The results demonstrate that our methods outperform SoTA weakly and unsupervised methods. Furthermore, our method achieves competitive results compared to fully supervised methods in novel manipulation detection tasks. Finally, our method can be easily extended to the datasets without pixel-level labels, which shows enhanced generalizability." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 367, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 367, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 367, + 482, + 498 + ], + "type": "text", + "content": "The contribution of this paper includes the following: (1) We propose a novel method that achieves plausible weakly and unsupervised IMD results. Our method can be easily adapted to images without labels or only with image-level labels. (2) To our knowledge, we are the first to investigate the potential of Implicit Neural Representation (INR) in the IMD task. The pre-process step utilizing INR demonstrates effectiveness in handling tampered cases. (3) We introduce selective supervision, which mitigates uncertainty associated with the absence of labels and further improves detection performance. (4) Extensive experiments validate the efficacy of our proposed methods, showcasing superior performance on both standard and novel manipulation types compared to SoTA methods." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 515, + 238, + 528 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 515, + 238, + 528 + ], + "spans": [ + { + "bbox": [ + 132, + 515, + 238, + 528 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 539, + 315, + 552 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 539, + 315, + 552 + ], + "spans": [ + { + "bbox": [ + 132, + 539, + 315, + 552 + ], + "type": "text", + "content": "2.1 Image Manipulation Detection" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 557, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 640 + ], + "type": "text", + "content": "Most traditional unsupervised IMD methods [1,8,9,17,38] detect manipulation via low-level tampering artifacts including camera fingerprint, double compression, color filter array, etc. The weakly supervised method of [65] applies self-consistency learning from multiple inputs. Most fully supervised IMD [5,20,21, 25,26,33,54,58-60,62] methods aim at detecting anomalous features. The two-branch architecture [29, 75] detects both image-editing and double-compression manipulation traces." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "text", + "content": "Unlike previous methods, we propose combining weakly and unsupervised IMD in a single framework. Meanwhile, most SoTA methods apply high-pass fil" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "ters such as SRM [18] and Bayar [62] to suppress low-frequency information and detect noise inconsistency, but they are not adaptive to all manipulation types, especially when the tampered pixels are from the same source as authentic ones. Additionally, noise filters are very sensitive to high-frequency information such as edges, whether manipulated or not, making them ineffective and inefficient. We thus propose a novel pre-processing method using INR, which applies reconstruction error to address this limitation. Our pre-process via reconstruction error can effectively provide a good prior to the model and is non-sensitive to authentic images, as shown in Fig. 2." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 242, + 309, + 255 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 242, + 309, + 255 + ], + "spans": [ + { + "bbox": [ + 131, + 242, + 309, + 255 + ], + "type": "text", + "content": "2.2 Image Neural Representation" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 262, + 482, + 346 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 262, + 482, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 262, + 482, + 346 + ], + "type": "text", + "content": "Image Neural Representation (INR) has become increasingly popular for image representation. The controllable fitting ability of INR is widely utilized in various applications such as continuous image/video super-resolution [6,7], video/image compression [13, 28], continuous shape representation [16, 66], medical image analysis [40,67], etc. Recently, [63] utilized INR for low-light image enhancement. However, the capability of INR on distinguishing pristine from tampered images has not been documented in the open literature." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 364, + 268, + 376 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 364, + 268, + 376 + ], + "spans": [ + { + "bbox": [ + 131, + 364, + 268, + 376 + ], + "type": "text", + "content": "2.3 Contrastive Learning" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 384, + 482, + 553 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 553 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 553 + ], + "type": "text", + "content": "The basic idea of contrastive learning [22] is to repel negative sample pairs while attracting positive pairs. The most popular architecture using contrastive learning is the Siamese network [27], which accepts two inputs simultaneously and the process is supervised by their similarity. This method has been widely applied in unsupervised and self-supervised applications [4,36,53,71]. Traditional unsupervised contrastive learning approaches commonly apply simple image augmentation operations, which may not be easily applicable to IMD due to model uncertainty [26]. Furthermore, image-level similarity, which is commonly used in contrastive learning, cannot be directly applied to IMD as it is unrelated to objects. To apply contrastive learning in un-/weakly supervised IMD, we utilize INR-reconstructed images as counter samples and employ a feature matching process in the final feature space. Building on the potential ability of INR mentioned in Section 1, authentic features tend to have higher matching scores, while tampered features have lower matching scores." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 571, + 261, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 571, + 261, + 586 + ], + "spans": [ + { + "bbox": [ + 131, + 571, + 261, + 586 + ], + "type": "text", + "content": "3 Proposed Method" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 597, + 265, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 597, + 265, + 609 + ], + "spans": [ + { + "bbox": [ + 131, + 597, + 265, + 609 + ], + "type": "text", + "content": "3.1 Overall Architecture" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Fig. 3 illustrates the overall architecture of our IMD framework. The basic architecture comprises two branches with shared weights. Given an RGB image " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "I \\in \\mathbb{R}^{H \\times W \\times 3}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " are its height and width, respectively, we first apply Neural Representation Reconstruction (NRR) to reconstruct it as" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 114, + 481, + 308 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 481, + 308 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 481, + 308 + ], + "type": "image", + "image_path": "a9230c6b43e30c0e90ee72dedae729a6836bbb0f46d85d5a46e81885a4b9a695.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 314, + 482, + 413 + ], + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 413 + ], + "type": "text", + "content": "Fig. 3: An overview of the proposed two-branch framework. The first branch accepts concatenated inputs as the main branch, while the NRR reconstructed image is fed into the second branch as a complementary branch. Selective contrastive learning is applied only to the pixels that have high confidence of being authentic or tampered. The classification results conducted by global-average pooling on both the result of the main branch using Otsu's method and intersected tampered pixels from clustering are used for loss computing. In the weakly supervised setting, ground-truth image-level labels are applied for supervision. In the unsupervised setting, high-confidence pseudolabels from the deepest layers are used to guide the shallow outputs." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "I_R \\in \\mathbb{R}^{H \\times W \\times 3}" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " and generate a reconstruction error map " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "I_E \\in \\mathbb{R}^{H \\times W \\times 1}" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " between " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "I_R" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": ". We then concatenate " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "I_E" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": ", feeding them into the first branch, which serves as the main branch. Similar to most IMD methods, the main branch generates a mask using a simple upsampling and Sigmoid activation function on the final feature map. We then apply Otsu's method to adaptively select the activated region for image-level prediction, as done in [65]. The reconstructed image " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "I_R" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " is fed into the second branch, acting as a complementary branch for feature matching. After processing with the backbone, we obtain two feature maps " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "F_R" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": ". We next compute the feature matching scores " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " between the two feature maps via a dot product, where authentic pixels tend to have higher matching scores and vice versa. For the two-class classification of manipulation detection, unsupervised clustering is applied to " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 437, + 482, + 668 + ], + "type": "text", + "content": ". We then intersect the two clustering results and exclusively apply pixel-level contrastive learning to the intersected features that exhibit higher confidence in being either authentic or tampered. The image-level classification result is conducted using the proposed adaptive global average pooling, which focuses on the high-confidence tampered regions for comprehensice image-level prediction. In a weakly supervised manner, the ground-truth image-level label is applied to supervise the prediction. In an unsupervised manner, a selected set of high-confidence pseudo" + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "labels from the deepest layer are utilized to supervise the shallow prediction via self-distillation [69] training strategy. The high-confidence pseudo-labels are chosen by comparing predictions derived from Otsu's method and clustering technique, opting solely for those consistently identified by both sources." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 179, + 354, + 192 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 179, + 354, + 192 + ], + "spans": [ + { + "bbox": [ + 131, + 179, + 354, + 192 + ], + "type": "text", + "content": "3.2 Neural Representation Reconstruction" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "spans": [ + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": "Inspired by [63] and the observation from our experiment in Fig. 12, we apply NRR to reconstruct the input image. The reconstruction error can highlight the manipulation trace, thereby furnishing an indispensable prior to the subsequent IMD model. In INR, the input image is first converted to a feature map " + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "inline_equation", + "content": "F_{N} \\in \\mathbb{R}^{H \\times W \\times C}" + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": " using an image encoder, where " + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": " are height and width, " + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": " is the number of feature channels. The coordinate set of input can be expressed using " + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "inline_equation", + "content": "X \\in \\mathbb{R}^{H \\times W \\times 2}" + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": ". We proceed by concatenating " + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "inline_equation", + "content": "F_{N}" + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "inline_equation", + "content": "X" + }, + { + "bbox": [ + 130, + 197, + 480, + 303 + ], + "type": "text", + "content": ", subsequently feeding them into a Multi-Layer Perceptron (MLP) for decoding. The NRR is formulated as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 231, + 304, + 481, + 318 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 304, + 481, + 318 + ], + "spans": [ + { + "bbox": [ + 231, + 304, + 481, + 318 + ], + "type": "interline_equation", + "content": "I _ {R} [ x, y ] = M L P \\left(F _ {N} [ x, y ], X [ x, y ]\\right), \\tag {1}", + "image_path": "ce7197ae23f459c21a7276263128785979d7e4ecf2bc836873dc03372e9b7ebc.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "spans": [ + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "inline_equation", + "content": "I_R" + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "text", + "content": " is reconstructed RGB pixel values from " + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "inline_equation", + "content": "[x, y]" + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "text", + "content": " is each pixel location. The main goal of NRR is to reconstruct the RGB values of " + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 321, + 479, + 355 + ], + "type": "text", + "content": ", with loss function formulated as:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 261, + 357, + 480, + 370 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 357, + 480, + 370 + ], + "spans": [ + { + "bbox": [ + 261, + 357, + 480, + 370 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {N R R} = \\left\\| I - I _ {R} \\right\\| _ {1}. \\tag {2}", + "image_path": "a07166a20c8a27c95b54f9cc5727abad9f2761f416c6d7250090fa0568d0405f.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 373, + 479, + 409 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 373, + 479, + 409 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 479, + 409 + ], + "type": "text", + "content": "Note that such reconstruction can not depict the high-frequency pixels properly. We therefore apply the positional encoding from [39] to map " + }, + { + "bbox": [ + 130, + 373, + 479, + 409 + ], + "type": "inline_equation", + "content": "X" + }, + { + "bbox": [ + 130, + 373, + 479, + 409 + ], + "type": "text", + "content": " to a higher-dimensional space. Such positional encoding is expressed as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 168, + 415, + 480, + 430 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 415, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 168, + 415, + 480, + 430 + ], + "type": "interline_equation", + "content": "X ^ {\\prime} = \\left(\\sin \\left(2 ^ {0} \\pi X\\right), \\cos \\left(2 ^ {0} \\pi X\\right), \\dots , \\sin \\left(2 ^ {L - 1} \\pi X\\right), \\cos \\left(2 ^ {L - 1} \\pi X\\right)\\right), \\tag {3}", + "image_path": "31ab9cb5d67e4866caf047619786d16dc5be6bbff1bd668c8da4518252524c3e.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "text", + "content": " is a pre-setting constant to control the fitting ability of NRR. Normally, larger " + }, + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "text", + "content": " results in a more accurate fitting. In our task, we aim to avoid outputs from NRR that mirror the inputs; instead, we desire NRR to faithfully preserve information in normal (authentic) content while introducing unfaithfulness in extreme (tampered) pixels. We empirically choose " + }, + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "inline_equation", + "content": "L = 8" + }, + { + "bbox": [ + 130, + 435, + 479, + 506 + ], + "type": "text", + "content": " as the optimal tradeoff." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 523, + 315, + 534 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 523, + 315, + 534 + ], + "spans": [ + { + "bbox": [ + 131, + 523, + 315, + 534 + ], + "type": "text", + "content": "3.3 Selective Contrastive Learning" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": "After obtaining " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "I_R" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " from NRR, we calculate the reconstruction error map between " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "I_R" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " using " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "I_E = (I_R - I)^2" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": ". Then, we concatenate " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "I_E" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": ", enhancing the input to the backbone's first (main) branch. For the input of the second (complementary) branch, we send " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "I_R" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " for feature matching. We employ ResNet50 [23] as a backbone, which consists of four stages that match previous weakly supervised methods. The weights of two branches are shared. After processing by the backbone, we obtain 2 feature outputs " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "F_R" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " from different input sources. We then compute the feature matching scores " + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 540, + 480, + 635 + ], + "type": "text", + "content": " using the dot product as:" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 234, + 641, + 480, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 234, + 641, + 480, + 669 + ], + "spans": [ + { + "bbox": [ + 234, + 641, + 480, + 669 + ], + "type": "interline_equation", + "content": "M _ {x, y} = \\sigma \\left(\\frac {P \\left(F _ {R} ^ {x , y}\\right) \\cdot P \\left(F ^ {x , y}\\right)}{\\sqrt {C}}\\right), \\tag {4}", + "image_path": "d22fef9b7c60841f7bf8a7432f39074f6ff56f604fb4fe64c4bb5b03db697542.jpg" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "M_{x,y}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " is the similarity score at the spatial location " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": ". The project head " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "P(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " contains 2 convolutional layers and ReLU activation. The " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\sigma(\\cdot)" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " denotes the sigmoid activation function, and " + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\sqrt{C}" + }, + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": " provides normalization." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 480, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 480, + 258 + ], + "type": "text", + "content": "Due to the ability of NRR to properly reproduce only authentic pixels (and not tampered ones), the high matching scores in " + }, + { + "bbox": [ + 130, + 152, + 480, + 258 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 152, + 480, + 258 + ], + "type": "text", + "content": " tend to correspond to the authentic parts of the image. In contrast, low scores tend to correspond to manipulated regions of the image. Due to the lack of ground-truth masks to supervise the final features, we apply unsupervised clustering for forged/pristine classification similar to [3, 37, 41, 44, 47, 58] and assume that the cluster with fewer elements is the tampered cluster. This assumption aligns with the real-world situation of current manipulation datasets. The reason is that, in most cases, the tampered region is usually much smaller than the authentic ones." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "text", + "content": "Ideally, we can apply pixel-level contrastive learning through InfoNCE [22] on " + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "text", + "content": " as [58]. However, we found that this method does not work well in our experiments, as clustering may come with low confidence due to the lack of ground-truth masks. To address this issue, we intersect on the clustering results of " + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "text", + "content": ", and denote the intersected clustering as " + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "inline_equation", + "content": "C_I" + }, + { + "bbox": [ + 130, + 259, + 481, + 376 + ], + "type": "text", + "content": ". After the intersection, we will have 2 clusters with higher confidence in being either authentic or tampered with, since they come from the same prediction from 2 different sources. We thus apply InfoNCE only to intersected pixels for contrastive learning, leaving the ambiguous pixels unchanged. This selective contrastive learning loss is formulated as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 220, + 377, + 480, + 407 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 377, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 220, + 377, + 480, + 407 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {S C L} = - \\log \\frac {\\frac {1}{J} \\sum_ {j \\in [ 1 , J ]} \\exp \\left(q \\cdot k _ {j} ^ {+} / \\tau\\right)}{\\sum_ {i \\in [ 1 , K ]} \\exp \\left(q \\cdot k _ {i} ^ {-} / \\tau\\right)}, \\tag {5}", + "image_path": "cfc9948b7ed1c94177461d3ae20700d1ecdc778962c0a9c775699262a691cb6f.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "spans": [ + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "inline_equation", + "content": "q" + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "content": " is an encoded query; " + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "content": " are the number of selected positive and negative keys, respectively; " + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "content": " is a temperature hyper-parameter. We set positive keys " + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "inline_equation", + "content": "k_{j}^{+}" + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "content": " as pixels associated with pristine regions, whereas negative keys " + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "inline_equation", + "content": "k_{i}^{-}" + }, + { + "bbox": [ + 130, + 412, + 480, + 459 + ], + "type": "text", + "content": " correspond to pixels linked to tampered regions." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 478, + 329, + 491 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 478, + 329, + 491 + ], + "spans": [ + { + "bbox": [ + 131, + 478, + 329, + 491 + ], + "type": "text", + "content": "3.4 Adaptive Global Average Pooling" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 498, + 479, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 479, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 479, + 568 + ], + "type": "text", + "content": "Many existing methods use Global-Max Pooling (GMP) and Global-Average Pooling (GAP) for image-level prediction to determine if the input is authentic or tampered. However, GMP can hinder training and cause inaccurate predictions as only the most discriminative response is back-propagated, neglecting the entire tampered content. Global-Average Pooling (GAP) is susceptible to inaccuracies due to weakly activated pixels." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 570, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 480, + 665 + ], + "type": "text", + "content": "To tackle these challenges, we introduce Adaptive Global Average Pooling (AGAP), which focuses on the high-confidence tampered regions for comprehensive image-level prediction. Leveraging the intersection of two clustering results (discussed in Section 3.3), we initially apply Global Average Pooling (GAP) exclusively to intersected tampered regions from a clustering perspective. However, relying solely on unsupervised clustering may not guarantee optimal performance and robustness across all input types without ground-truth labels. As discussed in [32], Otsu's method performs well when the image histogram" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 189 + ], + "type": "text", + "content": "exhibits a bimodal distribution, whereas clustering provides flexibility and the ability to handle more complex histograms. Therefore, we combine Otsu and clustering to enhance image-level prediction and training robustness. Specifically, GAP is applied to the tampered responses from both Otsu and intersected clustering results for loss computation with image-level labels. Further details on Otsu's method and clustering can be found in their respective papers [15, 43]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 209, + 376, + 221 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 209, + 376, + 221 + ], + "spans": [ + { + "bbox": [ + 131, + 209, + 376, + 221 + ], + "type": "text", + "content": "3.5 Weakly-supervised and Unsupervised IMD" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 232, + 479, + 267 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 232, + 479, + 267 + ], + "spans": [ + { + "bbox": [ + 130, + 232, + 479, + 267 + ], + "type": "text", + "content": "In the weakly-supervised IMD setting, we utilize ground truth image-level labels to supervise the prediction training using a binary cross-entropy (BCE) loss, which is:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 211, + 271, + 480, + 283 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 271, + 480, + 283 + ], + "spans": [ + { + "bbox": [ + 211, + 271, + 480, + 283 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {B C E} (g, \\hat {g}) = - (1 - g) \\log (1 - \\hat {g}) - g \\log (\\hat {g}), \\tag {6}", + "image_path": "138b81693007abe0062ec0a253d28a8661054cc801296f6a89f6ff64812cf582.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "inline_equation", + "content": "\\hat{g}" + }, + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "text", + "content": " are the ground-truth and prediction scores, respectively. The final classification loss in a weakly supervised manner is the sum of two BCE losses, comparing two pooling results with " + }, + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 291, + 479, + 327 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 327, + 479, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 327, + 479, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 479, + 363 + ], + "type": "text", + "content": "In the unsupervised IMD setting, where no labels are used, we employ a self-distillation training strategy [69], using pseudo-labels from the deepest layers as a teacher to supervise the shallow outputs." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 364, + 480, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 480, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 480, + 483 + ], + "type": "text", + "content": "To streamline prediction results from shallow layers and mitigate computational overhead, the classification head following each middle stage of the backbone uses spatial-average pooling in the channel dimension, reshaping it into a one-channel feature map. This is followed by a sigmoid function and global-max pooling. In traditional self-distillation methods, combining ground truth loss and self-distillation enhances overall performance, but this approach is not applicable in an unsupervised context. Our experiments revealed that relying solely on self-distillation did not yield satisfactory results, as the outputs from the deepest layers may lack accuracy, hindering the training process and overall performance." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 484, + 479, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 484, + 479, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 484, + 479, + 568 + ], + "type": "text", + "content": "Drawing inspiration from the selective-supervised method [31], proven effective in handling noisy label datasets, we leverage its concept of selecting training examples based on the alignment between feature representation and given labels. However, in our unsupervised setting, the absence of labels poses a challenge. To overcome this hurdle, we compare predictions obtained from Otsu and clustering methods, choosing only those consistently predicted by both sources as pseudo-labels for self-distillation training." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 569, + 479, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 479, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 479, + 628 + ], + "type": "text", + "content": "In pseudo-label selection, predictions exceeding 0.5 are considered as tampered samples. Similar to weakly supervised setting, we employ BCE loss between selected pseudo-labels and shallow predictions for supervision. During inference, all classification heads in shallow layers are excluded to avoid unnecessary parameters." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "content": "Training objective. We first apply trained NRR through " + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{NRR}" + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "content": " as a pretrained model, with all its weights frozen during IMD training. For simplicity, we use the symbol " + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}" + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "content": " to denote the loss functions for classification in both" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "unsupervised and weakly supervised approaches, albeit with slight differences as described above." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 142, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 142, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 142, + 482, + 177 + ], + "type": "text", + "content": "The total loss for our proposed IMD, denoted as " + }, + { + "bbox": [ + 130, + 142, + 482, + 177 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text{total}}" + }, + { + "bbox": [ + 130, + 142, + 482, + 177 + ], + "type": "text", + "content": ", is a weighted sum of both classification losses using BCE loss and the selective pixel-level contrastive learning loss:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 251, + 182, + 481, + 196 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 251, + 182, + 481, + 196 + ], + "spans": [ + { + "bbox": [ + 251, + 182, + 481, + 196 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {t o t a l}} = \\alpha \\mathcal {L} _ {\\text {c l s}} + \\beta \\mathcal {L} _ {\\text {S C L}}, \\tag {7}", + "image_path": "9eb79a63b128ed30fe5f8018bab5c2d0f26b6198935d3c7331445c4dcaa895f8.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 206, + 339, + 217 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 206, + 339, + 217 + ], + "spans": [ + { + "bbox": [ + 131, + 206, + 339, + 217 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 206, + 339, + 217 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 131, + 206, + 339, + 217 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 206, + 339, + 217 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 131, + 206, + 339, + 217 + ], + "type": "text", + "content": " are weighting hyperparameters." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 245, + 230, + 259 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 245, + 230, + 259 + ], + "spans": [ + { + "bbox": [ + 131, + 245, + 230, + 259 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 278, + 482, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 482, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 482, + 434 + ], + "type": "text", + "content": "Dataset: Our model is trained using CASIAv2 [12] exclusively, which comprises 7,491 authentic samples and 5,063 tampered images. For the evaluations of the standard IMD task, we employ widely-used benchmarks, including CASIAv1 [11], Coverage [57], Columbia [24], IMD2020 [42], and NIST16 [19]. CASIAv1 [11] consists of both splicing and copy-move images. Coverage [57] contains only copy-move samples with some post-processing approaches. Columbia [24] comprises 363 uncompressed images with an average resolution of " + }, + { + "bbox": [ + 130, + 278, + 482, + 434 + ], + "type": "inline_equation", + "content": "938 \\times 720" + }, + { + "bbox": [ + 130, + 278, + 482, + 434 + ], + "type": "text", + "content": ". NIST16 [19] and IMD2020 [42] contain only tampered images, suitable for pixel-level evaluation. These datasets cover traditional manipulation types including splicing, copy-move, and removal. For evaluations involving novel or more complex manipulation types, we utilize IEdit [51] and MagicBrush [68], which are two language-driven datasets containing various novel manipulation types, such as action change and light change." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 436, + 482, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 436, + 482, + 509 + ], + "spans": [ + { + "bbox": [ + 130, + 436, + 482, + 509 + ], + "type": "text", + "content": "Evaluation Metrics: We utilize IOU and F1 scores, including P-F1 for pixel-level F1, I-F1 for image-level F1, and C-F1 for combined F1. The C-F1 score accounts for both pixel-level and image-level performance through the harmonic mean, providing an overall performance comparison. All F1 scores and IOU scores are computed using 0.5 as the fixed threshold. Due to the lack of pixel-level masks in IEdit [51], we include image-level ACC for additional evaluation." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "Implementation Details: We employ ResNet50 [23] as the backbone and the model is implemented using PyTorch [45], with parameters initialized randomly. We apply AdamW [35] as the optimizer. The Multi-Layer Perceptron (MLP) in NRR follows a three-hidden-layer architecture. NRR is trained for 120 epochs with an initial learning rate of " + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "2 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": " and weight decay is applied. The IMD model in weakly supervised mode is trained for 50 epochs with an initial learning rate of 0.0005 and weight decay. For the unsupervised model, we train for 20 epochs with an initial learning rate of 0.0001, applying weight decay. Image augmentation is limited to random flipping and cropping. We use a fixed threshold of 0.5 to extract binary masks from the feature map, consistent with previous methods. Hyperparameters " + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": " are set to 1.0 and 0.1, respectively, for weakly supervised training, and 1.0 and 0.3 for unsupervised training. For the clustering algorithms, we used K-means [34]." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 141, + 114, + 472, + 213 + ], + "blocks": [ + { + "bbox": [ + 141, + 114, + 472, + 213 + ], + "lines": [ + { + "bbox": [ + 141, + 114, + 472, + 213 + ], + "spans": [ + { + "bbox": [ + 141, + 114, + 472, + 213 + ], + "type": "table", + "html": "
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1IOUP-F1IOUP-F1IOUP-F1IOUP-F1
NOI [38]0.0750.1320.1520.2360.1220.2100.0480.0740.0910.126
CFAI [17]0.0810.1340.1750.2750.1030.1850.0760.1050.0680.103
MCA [1]0.0490.0890.0850.1480.0780.1360.0490.0740.0440.079
NoisePrint [9]0.0740.1300.0850.3200.0980.1760.0620.1060.0540.104
IVC [8]0.0560.1010.0850.1640.0700.1270.0380.0680.0480.086
Ours0.0970.1660.2160.3440.1310.2170.0800.1290.0790.136
", + "image_path": "67e9578df7f3718cf628fd5ebea07e820b73dddd9d8685869f2f8a53ee87c4bc.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 134, + 256, + 479, + 304 + ], + "blocks": [ + { + "bbox": [ + 132, + 214, + 480, + 234 + ], + "lines": [ + { + "bbox": [ + 132, + 214, + 480, + 234 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 480, + 234 + ], + "type": "text", + "content": "Table 1: Evaluation results of unsupervised methods for Standard Manipulation task." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 256, + 479, + 304 + ], + "lines": [ + { + "bbox": [ + 134, + 256, + 479, + 304 + ], + "spans": [ + { + "bbox": [ + 134, + 256, + 479, + 304 + ], + "type": "table", + "html": "
MethodCASIAv1ColumbiaCoverageNIST16IMD2020
IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1I-F1C-F1IOUP-F1IOUP-F1
FCN [46]0.0780.1220.5610.2000.0620.0980.5240.1650.0720.1220.4240.1900.0320.0520.0520.086
WSCL [65]0.1000.1630.6790.2630.2200.3210.7200.4440.1020.1710.5710.2630.0470.0780.0930.152
Ours0.1240.1990.7030.3100.2480.3650.6950.4790.1400.2210.6670.3320.0790.1310.1240.204
", + "image_path": "1aff8067385102edc96ca93b15a731535a2eab8b989e889f1e07475a69bb584d.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 304, + 479, + 324 + ], + "lines": [ + { + "bbox": [ + 132, + 304, + 479, + 324 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 479, + 324 + ], + "type": "text", + "content": "Table 2: Evaluation results of weakly supervised approaches for Standard Manipulation task." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 359, + 326, + 371 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 359, + 326, + 371 + ], + "spans": [ + { + "bbox": [ + 132, + 359, + 326, + 371 + ], + "type": "text", + "content": "4.1 Comparison with SoTA Methods" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 378, + 481, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 481, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 481, + 426 + ], + "type": "text", + "content": "For a fair comparison with SoTA methods, we selected approaches for which the source code is publicly available. Among the unsupervised methods applied for comparison are NOI [38], CFAI [17], MCA [1], NoisePrint [9], and IVC [8], while the weakly supervised methods include FCN [46] and WSCL [65]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 426, + 483, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 483, + 474 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 483, + 474 + ], + "type": "text", + "content": "Additionally, we conducted experiments using two novel manipulation datasets and compared our approach with fully supervised methods, including RRU-Net [2], Mantra-Net [60], SPAN [25], PSCC-Net [33], Trufor [20], CAT-Net [29], Hifi-Net [21], CR-CNN [62], ObjectFormer [54], and MVSS-Net [5]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 475, + 481, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 475, + 481, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 475, + 481, + 569 + ], + "type": "text", + "content": "Comparison with SoTA unsupervised methods: Due to the assumption of unsupervised methods that all images contain manipulated parts, they will classify all test images as tampered. Thus, they are not suitable for image-level evaluation. We conduct pixel-level experiments to compare their abilities to localize the manipulated region, as shown in Table 1. We can observe that our proposed method in the unsupervised setting achieves the best detection performance compared to other unsupervised methods across five widely used standard manipulation benchmarks." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 481, + 665 + ], + "type": "text", + "content": "Comparison with SoTA weakly supervised methods: Table 2 shows experimental results comparing weakly supervised SoTA approaches. Except for the F1 (I-F1) score at the image level in the Columbia [24] dataset, our method performs better than SoTA methods in all other metrics. Regarding the relatively lower I-F1 score in Columbia compared to WSCL [65], we believe the reason is that Columbia does not have post-processing, so our method may not be very sensitive to manipulation. However, despite this issue, our method achieves the best localization performance in the Columbia dataset." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 480, + 373 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 480, + 373 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 480, + 373 + ], + "type": "image", + "image_path": "3176a8421b36ffc0850bd6fd506160599c2a2c0b0ac11d607e9ac885363346c9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 379, + 482, + 414 + ], + "lines": [ + { + "bbox": [ + 130, + 379, + 482, + 414 + ], + "spans": [ + { + "bbox": [ + 130, + 379, + 482, + 414 + ], + "type": "text", + "content": "Fig. 4: Visualization results using different methods. The images are displayed in the following order from top to bottom: tampered images, ground truth masks, prediction results from CR-CNN [62], Mantra-Net [60], NOI [38], WSCL [65], and our method." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 436, + 482, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 436, + 482, + 532 + ], + "spans": [ + { + "bbox": [ + 130, + 436, + 482, + 532 + ], + "type": "text", + "content": "Comparison using novel manipulation dataset: In order to show the generalization ability of our method. We conduct evaluations using fully supervised and weakly supervised methods on two novel manipulation detection datasets in Table 3. We can see that the fully supervised methods cannot adapt to the novel manipulation types, resulting in low detection performance even if they utilize a very large synthesis training dataset with both image-level and pixel-level labels. In contrast, our method achieves competitive performance while using extremely few training data with only image-level labels." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 532, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 532, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 532, + 482, + 593 + ], + "type": "text", + "content": "Visualization Results: We present some visualization results compared to SoTA methods in Figure 4. Our method can better localize the tampered region, even without the use of pixel-level labels. However, due to the lack of pixel-level labels, our model cannot accurately detect tampered edges. These results of our method are generated from the weakly supervised model." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 609, + 239, + 623 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 609, + 239, + 623 + ], + "spans": [ + { + "bbox": [ + 131, + 609, + 239, + 623 + ], + "type": "text", + "content": "4.2 Ablation Study" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 629, + 485, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 485, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 485, + 665 + ], + "type": "text", + "content": "We conducted several ablation studies to evaluate the effectiveness of each proposed component. For these studies, we utilized the CASIAv1 [12] and NIST16 [19] datasets." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 145, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 145, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 145, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 141, + 114, + 472, + 289 + ], + "blocks": [ + { + "bbox": [ + 141, + 114, + 472, + 289 + ], + "lines": [ + { + "bbox": [ + 141, + 114, + 472, + 289 + ], + "spans": [ + { + "bbox": [ + 141, + 114, + 472, + 289 + ], + "type": "table", + "html": "
TypeMethodTraining Data SizeIEditMagicBrush
ACCI-F1IOUP-F1I-F1C-F1
Full SupervisionRRU-Net [2]4.2K0.4820.6510.0930.1530.6670.249
Mantra-Net [60]64K0.4990.6650.0580.1050.6670.181
SPAN [25]96K0.5280.2100.0110.0020.5850.004
PSCC-Net [33]100K0.5240.2060.1320.2100.7100.324
Trufor [20]858K0.5050.6650.2160.3040.6700.418
CAT-Net [29]858K0.4880.5670.0250.0330.7660.063
Hifi-Net [21]1,710K0.5310.4600.0890.1510.6770.247
WeakCR-CNN [62]12.5K0.5310.5300.0250.0420.5930.078
ObjectFormer [54]12.5K0.4970.4270.0290.0470.4300.085
MVSS-Net [5]12.5K0.5260.4870.0450.0720.6750.130
FCN [46]12.5K0.4810.2200.0200.0350.3600.064
WSCL [65]12.5K0.5110.4750.0750.1220.5720.201
Ours12.5K0.5350.6640.1650.2640.6900.382
", + "image_path": "85cecf03287680a8822e0baa3581d11ef06911cb46918e4a4731aa8da5878973.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 138, + 373, + 362, + 446 + ], + "blocks": [ + { + "bbox": [ + 132, + 291, + 481, + 346 + ], + "lines": [ + { + "bbox": [ + 132, + 291, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 291, + 481, + 346 + ], + "type": "text", + "content": "Table 3: Evaluation results on Novel Manipulation task for both fully supervised and weakly supervised methods. For the methods that are trained on a dataset with a size of " + }, + { + "bbox": [ + 132, + 291, + 481, + 346 + ], + "type": "inline_equation", + "content": "12.5\\mathrm{K}" + }, + { + "bbox": [ + 132, + 291, + 481, + 346 + ], + "type": "text", + "content": ", they all utilize CASIAv2 [12] as the training set. For the methods not utilizing CASIAv2, except for RRU-Net, they utilize their synthesis datasets. The best and second-best performances are highlighted using bold and underline, respectively." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 138, + 373, + 362, + 446 + ], + "lines": [ + { + "bbox": [ + 138, + 373, + 362, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 373, + 362, + 446 + ], + "type": "table", + "html": "
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Baseline [46]0.1220.5610.2000.052
Baseline+NRR0.1590.5720.2490.070
Baseline+NRR+SCL0.1660.6810.2670.119
Baseline+NRR+SCL+AGAP0.1990.7030.3100.131
", + "image_path": "f74232e3f49c0f63b7e65fd8e4f8a5d07c420748bbda13b7c8e7391a01868a5a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 372, + 380, + 487, + 437 + ], + "blocks": [ + { + "bbox": [ + 135, + 447, + 362, + 479 + ], + "lines": [ + { + "bbox": [ + 135, + 447, + 362, + 479 + ], + "spans": [ + { + "bbox": [ + 135, + 447, + 362, + 479 + ], + "type": "text", + "content": "Table 4: Ablation study of proposed components using CASIAv1 and NIST16 on Weakly Supervised setting. The baseline in this table is FCN [46]." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 372, + 380, + 487, + 437 + ], + "lines": [ + { + "bbox": [ + 372, + 380, + 487, + 437 + ], + "spans": [ + { + "bbox": [ + 372, + 380, + 487, + 437 + ], + "type": "table", + "html": "
MethodCASIAv1 P-F1NIST16 P-F1
w/o PLS0.1320.082
w/ PLS0.1660.129
", + "image_path": "e521b3171fe39827f2b02e981a9baaf9c28e9404f84fc18095c6eacd6f30cf61.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 372, + 437, + 463, + 459 + ], + "lines": [ + { + "bbox": [ + 372, + 437, + 463, + 459 + ], + "spans": [ + { + "bbox": [ + 372, + 437, + 463, + 459 + ], + "type": "text", + "content": "Table 5: Ablation pseudo-label selection." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 518, + 485, + 602 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 518, + 485, + 602 + ], + "spans": [ + { + "bbox": [ + 130, + 518, + 485, + 602 + ], + "type": "text", + "content": "Effectiveness of proposed components: We introduced three novel components: pre-processing stage using Neural Representation Reconstruction (NRR), Selective Pixel-wise Contrastive Learning (SCL), and Adaptive Global-Average Pooling (AGAP) for both un-/weakly supervised IMD. The ablation study conducted in weak mode is shown in Table 4. It is evident that with the progressive integration of our proposed modules, the model's overall ability to detect tampering consistently improves." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "Pseudo-Label Selection (PLS): In our unsupervised method, we introduce PLS, which exclusively leverages high-confidence pseudo-labels from two sources to supervise shallow predictions in the self-distillation training process. The impact of PLS is examined in Table 5. In experiments without PLS, we use image-level predictions in the main branch as pseudo-labels to guide shallow" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 165, + 114, + 449, + 202 + ], + "blocks": [ + { + "bbox": [ + 165, + 114, + 449, + 202 + ], + "lines": [ + { + "bbox": [ + 165, + 114, + 449, + 202 + ], + "spans": [ + { + "bbox": [ + 165, + 114, + 449, + 202 + ], + "type": "table", + "html": "
MethodCASIAv1NIST16
P-F1I-F1C-F1P-F1
Global-Max Pooling0.0330.5700.0620.058
Global-Average Pooling0.1580.2560.1950.081
Generalized Mean Pooling [50]0.0670.6260.1210.072
Global Smooth Pooling [55]0.0760.6270.1360.080
Adaptive Global-Average Pooling (Ours)0.1990.7030.3100.131
", + "image_path": "1a8dfbb0121295a2bb5c977da4ed87e458e131877bb9c08d4732c6d9479070a3.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 192, + 203, + 419, + 213 + ], + "lines": [ + { + "bbox": [ + 192, + 203, + 419, + 213 + ], + "spans": [ + { + "bbox": [ + 192, + 203, + 419, + 213 + ], + "type": "text", + "content": "Table 6: Comparisons using different pooling methods." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 249, + 479, + 273 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 249, + 479, + 273 + ], + "spans": [ + { + "bbox": [ + 130, + 249, + 479, + 273 + ], + "type": "text", + "content": "predictions. The proposed PLS proves to be effective in enhancing unsupervised performance." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 275, + 481, + 347 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 275, + 481, + 347 + ], + "spans": [ + { + "bbox": [ + 130, + 275, + 481, + 347 + ], + "type": "text", + "content": "Adaptive Global-Average Pooling: To demonstrate the superiority of the proposed AGAP, we conduct an ablation study in weakly supervised setting using different pooling methods, including Global-Max Pooling (GMP), Global-Average Pooling (GAP), Generalized Mean Pooling (GeM) [50], and Global Smooth Pooling (GsM) [55]. The results are shown in Table 6. Similarly, the proposed AGAP achieves the best performance, highlighting its superiority." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 370, + 219, + 383 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 370, + 219, + 383 + ], + "spans": [ + { + "bbox": [ + 132, + 370, + 219, + 383 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 401, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 401, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 401, + 482, + 628 + ], + "type": "text", + "content": "We present a novel framework that integrates unsupervised and weakly-supervised approaches for Image Manipulation Detection (IMD). Our approach features a groundbreaking pre-processing step utilizing a controllable fitting function derived from Implicit Neural Representation, providing a prior for manipulation regions. Additionally, we propose a selective pixel-level contrastive learning technique that prioritizes regions with high confidence, mitigating uncertainty stemming from the absence of pixel-level labels. For image-level prediction, we introduce adaptive global average pooling to thoroughly explore manipulation regions for detection and robust training. In unsupervised mode, we implement pseudo-label selection, choosing high-confidence predictions from deeper layers as pseudo-labels to supervise predictions in shallower layers via a self-distillation training method. Extensive experiments validate our method's effectiveness, demonstrating superior performance compared to existing unsupervised and weakly supervised methods. Notably, our approach competes effectively against fully supervised methods in detecting novel manipulations, showcasing its robustness in real-world scenarios. Limitation of this work includes inaccurate localization of tampered region edges, resulting in larger prediction masks than the ground truth. Future work involves developing more powerful models and effective pre-filters to enhance pixel-level detection performance." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 630, + 481, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 481, + 664 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 481, + 664 + ], + "type": "text", + "content": "Acknowledgements: This work is supported by the DARPA Semantic Forensics (SemaFor) Program under contract HR001120C0123 and NSF CCSS-2348046." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 137, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 137, + 481, + 180 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 137, + 481, + 180 + ], + "spans": [ + { + "bbox": [ + 138, + 137, + 481, + 180 + ], + "type": "text", + "content": "1. Bammey, Q., Gioi, R.G.v., Morel, J.M.: An adaptive neural network for unsupervised mosaic consistency analysis in image forensics. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14194-14204 (2020) 4, 11" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 181, + 481, + 213 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 181, + 481, + 213 + ], + "spans": [ + { + "bbox": [ + 138, + 181, + 481, + 213 + ], + "type": "text", + "content": "2. Bi, X., Wei, Y., Xiao, B., Li, W.: Rru-net: The ringed residual u-net for image splicing forgery detection. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (2019) 11, 13" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 213, + 481, + 255 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 213, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 138, + 213, + 481, + 255 + ], + "type": "text", + "content": "3. Bondi, L., Lameri, S., Güera, D., Bestagini, P., Delp, E.J., Tubaro, S.: Tampering detection and localization through clustering of camera-based cnn features. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). pp. 1855-1864. IEEE (2017) 8" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 256, + 481, + 299 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 256, + 481, + 299 + ], + "spans": [ + { + "bbox": [ + 138, + 256, + 481, + 299 + ], + "type": "text", + "content": "4. Chen, K., Hong, L., Xu, H., Li, Z., Yeung, D.Y.: Multisiam: Self-supervised multi-instance siamese representation learning for autonomous driving. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 7546-7554 (2021) 5" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 300, + 481, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 300, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 300, + 481, + 331 + ], + "type": "text", + "content": "5. Chen, X., Dong, C., Ji, J., Cao, J., Li, X.: Image manipulation detection by multiview multiscale supervision. In: IEEE/CVF International Conference on Computer Vision. pp. 14185-14193 (2021) 4, 11, 13" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 332, + 481, + 364 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 481, + 364 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 481, + 364 + ], + "type": "text", + "content": "6. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8628-8638 (2021) 5" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 365, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 365, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 481, + 407 + ], + "type": "text", + "content": "7. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022) 5" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 407, + 481, + 439 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 407, + 481, + 439 + ], + "spans": [ + { + "bbox": [ + 138, + 407, + 481, + 439 + ], + "type": "text", + "content": "8. Choi, C.H., Choi, J.H., Lee, H.K.: Cfa pattern identification of digital cameras using intermediate value counting. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 21-26 (2011) 4, 11" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 440, + 481, + 470 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 440, + 481, + 470 + ], + "spans": [ + { + "bbox": [ + 138, + 440, + 481, + 470 + ], + "type": "text", + "content": "9. Cozzolino, D., Verdoliva, L.: Noiseprint: A cnn based camera model fingerprint. IEEE Transactions on Information Forensics and Security 15, 144-159 (2019) 4, 11" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 472, + 481, + 493 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 472, + 481, + 493 + ], + "spans": [ + { + "bbox": [ + 138, + 472, + 481, + 493 + ], + "type": "text", + "content": "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021) 1" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 494, + 481, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 494, + 481, + 514 + ], + "spans": [ + { + "bbox": [ + 138, + 494, + 481, + 514 + ], + "type": "text", + "content": "1. Dong, J., Wang, W., Tan, T.: CASIA image tampering detection evaluation database. http://forensics.idealtest.org (2010) 2, 10" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 515, + 481, + 546 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 515, + 481, + 546 + ], + "spans": [ + { + "bbox": [ + 138, + 515, + 481, + 546 + ], + "type": "text", + "content": "2. Dong, J., Wang, W., Tan, T.: Casia image tampering detection evaluation database. In: 2013 IEEE China summit and international conference on signal and information processing. pp. 422-426. IEEE (2013) 3, 10, 12, 13" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 547, + 481, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 547, + 481, + 568 + ], + "spans": [ + { + "bbox": [ + 138, + 547, + 481, + 568 + ], + "type": "text", + "content": "3. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021) 5" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 569, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 569, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 569, + 481, + 600 + ], + "type": "text", + "content": "4. Ergen, T., Kozat, S.S.: Unsupervised anomaly detection with LSTM neural networks. IEEE transactions on neural networks and learning systems 31(8), 3127-3141 (2019) 2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 601, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 481, + 632 + ], + "type": "text", + "content": "5. Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: kdd. vol. 96, pp. 226-231 (1996) 9" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "text", + "content": "6. Feng, Y., Feng, Y., You, H., Zhao, X., Gao, Y.: Meshnet: Mesh neural network for 3d shape representation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 33, pp. 8279-8286 (2019) 5" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "text", + "content": "17. Ferrara, P., Bianchi, T., De Rosa, A., Piva, A.: Image forgery localization via fine-grained analysis of cfa artifacts. IEEE Transactions on Information Forensics and Security 7(5), 1566-1577 (2012) 4, 11" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 480, + 171 + ], + "type": "text", + "content": "18. Fridrich, J., Kodovsky, J.: Rich models for steganalysis of digital images. IEEE Transactions on information Forensics and Security 7(3), 868-882 (2012) 5" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 480, + 215 + ], + "type": "text", + "content": "19. Guan, H., Kozak, M., Robertson, E., Lee, Y., Yates, A.N., Delgado, A., Zhou, D., Kheyrkhah, T., Smith, J., Fiscus, J.: Mfc datasets: Large-scale benchmark datasets for media forensic challenge evaluation. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 63-72. IEEE (2019) 10, 12" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 480, + 258 + ], + "type": "text", + "content": "20. Guillaro, F., Cozzolino, D., Sud, A., Dufour, N., Verdoliva, L.: Trufor: Leveraging all-round clues for trustworthy image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20606-20615 (2023) 4, 11, 13" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 480, + 302 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 302 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 302 + ], + "type": "text", + "content": "21. Guo, X., Liu, X., Ren, Z., Grosz, S., Masi, I., Liu, X.: Hierarchical fine-grained image forgery detection and localization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3155-3165 (2023) 4, 11, 13" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 303, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 303, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 303, + 480, + 335 + ], + "type": "text", + "content": "22. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9729-9738 (2020) 4, 5, 8" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "text", + "content": "23. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) 7, 10" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "text", + "content": "24. Hsu, Y.F., Chang, S.F.: Detecting image splicing using geometry invariants and camera characteristics consistency. In: 2006 IEEE International Conference on Multimedia and Expo. pp. 549-552. IEEE (2006) 2, 10, 11" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 403, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 480, + 435 + ], + "type": "text", + "content": "25. Hu, X., Zhang, Z., Jiang, Z., Chaudhuri, S., Yang, Z., Nevatia, R.: Span: Spatial pyramid attention network for image manipulation localization. In: European Conference on Computer Vision (ECCV), pp. 312-328. Springer (2020) 4, 11, 13" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "type": "text", + "content": "26. Ji, K., Chen, F., Guo, X., Xu, Y., Wang, J., Chen, J.: Uncertainty-guided learning for improving image manipulation detection. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22456-22465 (2023) 4, 5" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 468, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 480, + 490 + ], + "type": "text", + "content": "27. Koch, G., Zemel, R., Salakhutdinov, R., et al.: Siamese neural networks for one-shot image recognition. In: ICML deep learning workshop. vol. 2. Lille (2015) 5" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 491, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 480, + 522 + ], + "type": "text", + "content": "28. Kwan, H.M., Gao, G., Zhang, F., Gower, A., Bull, D.: Hinerv: Video compression with hierarchical encoding-based neural representation. Advances in Neural Information Processing Systems 36 (2024) 5" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 523, + 480, + 555 + ], + "type": "text", + "content": "29. Kwon, M.J., Nam, S.H., Yu, I.J., Lee, H.K., Kim, C.: LearningJPEG compression artifacts for image manipulation detection and localization. International Journal of Computer Vision pp. 1875-1895 (2022) 4, 11, 13" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 555, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 480, + 578 + ], + "type": "text", + "content": "30. Li, J., Chen, Y., Xing, Y.: Memory mechanism for unsupervised anomaly detection. In: The 39th Conference on Uncertainty in Artificial Intelligence (2023) 2" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "type": "text", + "content": "31. Li, S., Xia, X., Ge, S., Liu, T.: Selective-supervised contrastive learning with noisy labels. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 316-325 (2022) 9" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 611, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 480, + 632 + ], + "type": "text", + "content": "32. Liu, D., Yu, J.: Otsu method and k-means. In: 2009 Ninth International conference on hybrid intelligent systems. vol. 1, pp. 344-349. IEEE (2009) 8" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "type": "text", + "content": "33. Liu, X., Liu, Y., Chen, J., Liu, X.: Pscc-net: Progressive spatio-channel correlation network for image manipulation detection and localization. IEEE Transactions on Circuits and Systems for Video Technology 32(11), 7505-7517 (2022) 4, 11, 13" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "text", + "content": "34. Lloyd, S.: Least squares quantization in pcm. IEEE transactions on information theory 28(2), 129-137 (1982) 10" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "type": "text", + "content": "35. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101 (2017) 10" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 160, + 482, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 482, + 204 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 482, + 204 + ], + "type": "text", + "content": "36. Lu, X., Wang, W., Ma, C., Shen, J., Shao, L., Porikli, F.: See more, know more: Unsupervised video object segmentation with co-attention siamese networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3623-3632 (2019) 5" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 204, + 482, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 204, + 482, + 226 + ], + "spans": [ + { + "bbox": [ + 130, + 204, + 482, + 226 + ], + "type": "text", + "content": "37. Lyu, S., Pan, X., Zhang, X.: Exposing region splicing forgeries with blind local noise estimation. International journal of computer vision 110, 202-221 (2014) 8" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 226, + 482, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 248 + ], + "type": "text", + "content": "38. Mahdian, B., Saic, S.: Using noise inconsistencies for blind image forensics. Image and vision computing 27(10), 1497-1503 (2009) 4, 11, 12" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 248, + 482, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 282 + ], + "type": "text", + "content": "39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) 7" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 281, + 482, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 281, + 482, + 326 + ], + "spans": [ + { + "bbox": [ + 130, + 281, + 482, + 326 + ], + "type": "text", + "content": "40. Molaei, A., Aminimehr, A., Tavakoli, A., Kazerouni, A., Azad, B., Azad, R., Merhof, D.: Implicit neural representation in medical imaging: A comparative survey. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2381-2391 (2023) 5" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 325, + 482, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 369 + ], + "type": "text", + "content": "41. Niu, Y., Tondi, B., Zhao, Y., Ni, R., Barni, M.: Image splicing detection, localization and attribution via jpeg primary quantization matrix estimation and clustering. IEEE Transactions on Information Forensics and Security 16, 5397-5412 (2021) 8" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 369, + 482, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 403 + ], + "type": "text", + "content": "42. Novozamsky, A., Mahdian, B., Saic, S.: Imd2020: A large-scale annotated dataset tailored for detecting manipulated images. In: IEEE/CVF Winter Conference on Applications of Computer Vision Workshops. pp. 71-80 (2020) 10" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 402, + 482, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 424 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 424 + ], + "type": "text", + "content": "43. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979) 9" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 424, + 482, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 424, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 482, + 456 + ], + "type": "text", + "content": "44. Pan, X., Zhang, X., Lyu, S.: Exposing image forgery with blind noise estimation. In: Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security. pp. 15-20 (2011) 8" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 456, + 482, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 456, + 482, + 500 + ], + "spans": [ + { + "bbox": [ + 130, + 456, + 482, + 500 + ], + "type": "text", + "content": "45. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al.: Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019) 10" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 500, + 482, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 500, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 500, + 482, + 523 + ], + "type": "text", + "content": "46. Pathak, D., Shelhamer, E., Long, J., Darrell, T.: Fully convolutional multi-class multiple instance learning. arXiv preprint arXiv:1412.7144 (2014) 11, 13" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 523, + 482, + 554 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 523, + 482, + 554 + ], + "spans": [ + { + "bbox": [ + 130, + 523, + 482, + 554 + ], + "type": "text", + "content": "47. Pyatykh, S., Hesser, J., Zheng, L.: Image noise level estimation by principal component analysis. IEEE transactions on image processing 22(2), 687-699 (2012) 8" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 554, + 482, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 554, + 482, + 599 + ], + "spans": [ + { + "bbox": [ + 130, + 554, + 482, + 599 + ], + "type": "text", + "content": "48. Qian, Y., Hong, X., Guo, Z., Arandjelovic, O., Donovan, C.R.: Semi-supervised crowd counting with contextual modeling: Facilitating holistic understanding of crowd scenes. IEEE Transactions on Circuits and Systems for Video Technology (2024) 2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 599, + 482, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 599, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 599, + 482, + 632 + ], + "type": "text", + "content": "49. Qiao, T., Zhang, J., Xu, D., Tao, D.: Mirrorgan: Learning text-to-image generation by redescription. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1505-1514 (2019) 1" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "text", + "content": "50. Radenovic, F., Tolias, G., Chum, O.: Fine-tuning cnn image retrieval with no human annotation. IEEE transactions on pattern analysis and machine intelligence 41(7), 1655-1668 (2018) 14" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "text", + "content": "51. Shi, J., Xu, N., Bui, T., Dernoncourt, F., Wen, Z., Xu, C.: A benchmark and baseline for language-driven image editing. In: Proceedings of the Asian Conference on Computer Vision (2020) 10" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 194 + ], + "type": "text", + "content": "52. Smucny, J., Shi, G., Lesh, T.A., Carter, C.S., Davidson, I.: Data augmentation with mixup: Enhancing performance of a functional neuroimaging-based prognostic deep learning classifier in recent onset psychosis. NeuroImage: Clinical 36, 103214 (2022) 2" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 237 + ], + "type": "text", + "content": "53. Tao, C., Zhu, X., Su, W., Huang, G., Li, B., Zhou, J., Qiao, Y., Wang, X., Dai, J.: Siamese image modeling for self-supervised vision representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2132-2141 (2023) 5" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 237, + 481, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 481, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 481, + 281 + ], + "type": "text", + "content": "54. Wang, J., Wu, Z., Chen, J., Han, X., Shrivastava, A., Lim, S.N., Jiang, Y.G.: Objectformer for image manipulation detection and localization. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2364-2373 (2022) 4, 11, 13" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 281, + 481, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 481, + 315 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 481, + 315 + ], + "type": "text", + "content": "55. Wang, L., Lu, H., Wang, Y., Feng, M., Wang, D., Yin, B., Ruan, X.: Learning to detect salient objects with image-level supervision. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 136-145 (2017) 14" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 315, + 481, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 358 + ], + "type": "text", + "content": "56. Wei, Y., Liang, X., Chen, Y., Shen, X., Cheng, M.M., Feng, J., Zhao, Y., Yan, S.: Stc: A simple to complex framework for weakly-supervised semantic segmentation. IEEE transactions on pattern analysis and machine intelligence 39(11), 2314-2320 (2016) 2" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "text", + "content": "57. Wen, B., Zhu, Y., Subramanian, R., Ng, T.T., Shen, X., Winkler, S.: Coverage - a novel database for copy-move forgery detection. In: IEEE International Conference on Image processing (ICIP) (2016) 2, 10" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 392, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 413 + ], + "type": "text", + "content": "58. Wu, H., Chen, Y., Zhou, J.: Rethinking image forgery detection via contrastive learning and unsupervised clustering. arXiv preprint arXiv:2308.09307 (2023) 4, 8" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 413, + 481, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 481, + 446 + ], + "type": "text", + "content": "59. Wu, H., Zhou, J., Tian, J., Liu, J.: Robust image forgery detection over online social network shared images. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13440-13449 (2022) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 446, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 490 + ], + "type": "text", + "content": "60. Wu, Y., AbdAlmageed, W., Natarajan, P.: Mantra-net: Manipulation tracing network for detection and localization of image forgeries with anomalous features. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9543-9552 (2019) 4, 11, 12, 13" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 490, + 481, + 534 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 490, + 481, + 534 + ], + "spans": [ + { + "bbox": [ + 132, + 490, + 481, + 534 + ], + "type": "text", + "content": "61. Xu, T., Zhang, P., Huang, Q., Zhang, H., Gan, Z., Huang, X., He, X.: Attngan: Fine-grained text to image generation with attentional generative adversarial networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1316-1324 (2018) 1" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 534, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 567 + ], + "type": "text", + "content": "62. Yang, C., Li, H., Lin, F., Jiang, B., Zhao, H.: Constrained r-cnn: A general image manipulation detection model. In: IEEE International Conference on Multimedia and Expo (ICME). pp. 1-6. IEEE (2020) 4, 5, 11, 12, 13" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "text", + "content": "63. Yang, S., Ding, M., Wu, Y., Li, Z., Zhang, J.: Implicit neural representation for cooperative low-light image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 12918-12927 (2023) 3, 5, 7" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 600, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 600, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 600, + 481, + 621 + ], + "type": "text", + "content": "64. Yoon, J., Yu, S., Bansal, M.: Raccoon: Remove, add, and change video content with auto-generated narratives. arXiv preprint arXiv:2405.18406 (2024) 1" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "type": "text", + "content": "65. Zhai, Y., Luan, T., Doermann, D., Yuan, J.: Towards generic image manipulation detection with weakly-supervised self-consistency learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 22390-22400 (2023) 4, 6, 11, 12, 13" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "Z. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 456 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "66. Zhang, B., Tang, J., Niessner, M., Wonka, P.: 3d shape2vecset: A 3d shape representation for neural fields and generative diffusion models. arXiv preprint arXiv:2301.11445 (2023) 5" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "type": "text", + "content": "67. Zhang, H., Wang, R., Zhang, J., Li, C., Yang, G., Spincemaille, P., Nguyen, T., Wang, Y.: Nerd: Neural representation of distribution for medical image segmentation. arXiv preprint arXiv:2103.04020 (2021) 5" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 182, + 482, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 482, + 215 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 482, + 215 + ], + "type": "text", + "content": "68. Zhang, K., Mo, L., Chen, W., Sun, H., Su, Y.: Magicbrush: A manually annotated dataset for instruction-guided image editing. Advances in Neural Information Processing Systems 36 (2024) 10" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 215, + 482, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 215, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 215, + 482, + 248 + ], + "type": "text", + "content": "69. Zhang, L., Bao, C., Ma, K.: Self-distillation: Towards efficient and compact neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(8), 4388-4403 (2021) 4, 7, 9" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 248, + 482, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 281 + ], + "type": "text", + "content": "70. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 1" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 281, + 482, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 281, + 482, + 314 + ], + "spans": [ + { + "bbox": [ + 130, + 281, + 482, + 314 + ], + "type": "text", + "content": "71. Zhang, W., Pang, J., Chen, K., Loy, C.C.: Dense siamese network for dense unsupervised learning. In: European Conference on Computer Vision. pp. 464-480. Springer (2022) 5" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 314, + 482, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 346 + ], + "type": "text", + "content": "72. Zhang, Z., Bui, T.D.: Attention-based selection strategy for weakly supervised object localization. In: 2020 25th International Conference on Pattern Recognition (ICPR). pp. 10305-10311. IEEE (2021) 2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "type": "text", + "content": "73. Zhang, Z., Chang, M.C.: Two-stage dual augmentation with clip for improved text-to-sketch synthesis. In: 2023 IEEE 6th International Conference on Multimedia Information Processing and Retrieval (MIPR). pp. 1-6. IEEE (2023) 1" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 380, + 482, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 423 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 423 + ], + "type": "text", + "content": "74. Zhang, Z., Chang, M.C., Bui, T.D.: Improving class activation map for weakly supervised object localization. In: ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). pp. 2624-2628. IEEE (2022) 2" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 423, + 482, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 456 + ], + "type": "text", + "content": "75. Zhang, Z., Li, M., Chang, M.C.: A new benchmark and model for challenging image manipulation detection. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 38, pp. 7405-7413 (2024) 4" + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "IMD With INR and Limited Supervision" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_content_list.json b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..6d8d168e36076a01c682a5f292b0ab13d452a016 --- /dev/null +++ b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_content_list.json @@ -0,0 +1,1424 @@ +[ + { + "type": "text", + "text": "Image-Feature Weak-to-Strong Consistency: An Enhanced Paradigm for Semi-Supervised Learning", + "text_level": 1, + "bbox": [ + 228, + 140, + 774, + 209 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zhiyu Wu and Jinshi Cui", + "bbox": [ + 395, + 234, + 604, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "National Key Laboratory of General Artificial Intelligence, School of Intelligence Science and Technology, Peking University wuzhiyu@pku.edu.cn, cjs@cis.pku.edu.cn", + "bbox": [ + 285, + 263, + 715, + 305 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Image-level weak-to-strong consistency serves as the predominant paradigm in semi-supervised learning (SSL) due to its simplicity and impressive performance. Nonetheless, this approach confines all perturbations to the image level and suffers from the excessive presence of naive samples, thus necessitating further improvement. In this paper, we introduce feature-level perturbation with varying intensities and forms to expand the augmentation space, establishing the image-feature weak-to-strong consistency paradigm. Furthermore, our paradigm develops a triple-branch structure, which facilitates interactions between both types of perturbations within one branch to boost their synergy. Additionally, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing additional challenges exclusively for naive samples. Notably, our paradigm can seamlessly integrate with existing SSL methods. We apply the proposed paradigm to several representative algorithms and conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate a significant enhancement in the performance of existing SSL algorithms.", + "bbox": [ + 261, + 348, + 738, + 597 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Feature-Level Perturbation $\\cdot$ Image-Feature Weak-to-Strong Consistency $\\cdot$ Naive Sample Identification", + "bbox": [ + 261, + 611, + 743, + 640 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 667, + 375, + 684 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Semi-supervised learning (SSL) [4,30,32,46], a research topic that aims to reduce manual labeling costs by capitalizing on unlabeled data, has received considerable attention in recent years. Among the proposed methods, the image-level weak-to-strong consistency paradigm introduced by FixMatch [32] has proven highly effective in leveraging the potential of unlabeled data. Specifically, FixMatch applies varying intensities of image-level perturbations to raw samples and encourages consistent predictions between corresponding weakly and strongly augmented views. Subsequent studies have refined this paradigm primarily in two aspects: (1) improving the utilization ratio of unlabeled data by replacing", + "bbox": [ + 212, + 703, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/fbe950051e79bbca3da2aa9dd81b28ffebb497ba22a8f72be996de31c07cd040.jpg", + "image_caption": [ + "Fig. 1: Overview of the old (left) and proposed (right) paradigms. Our paradigm introduces feature-level perturbation to expand the augmentation space and facilitates direct interactions between both types of perturbations to boost their synergy." + ], + "image_footnote": [ + "$\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{x}}$ : weak/strong image-level perturbation; $p^{\\tau_{w}} / p^{\\tau_{x}}$ : predictions of samples subjected to $\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{z}}$ . $\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{x}}$ : weak/strong feature-level perturbation; $p^{\\tau_{w},T_{x}} / p^{\\tau_{x},T_{w}}$ : predictions of samples that undergo $\\mathcal{A}^{T_{w}}$ and $\\mathcal{A}^{T_{x}} / \\mathcal{A}^{T_{z}}$ and $\\mathcal{A}^{T_{w}}$ . $f^{in} / f^{out}$ : input/output feature maps of feature-level perturbation; adaptive $\\mathcal{A}^{T_{w}}$ : incorporating $\\mathcal{A}^{T_{x}}$ solely for naive samples recognized by the confidence-based identification strategy; $\\tau ,\\tau_{t}$ : threshold mechanisms; stopping gradients; : shared parameters; teacher branch; student branch;" + ], + "bbox": [ + 215, + 142, + 781, + 263 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "the constant threshold in FixMatch with a dynamic threshold [35,42] and (2) facilitating balanced predictions across different classes via refining pseudo-labels based on historical predictions [3,5]. Extensive experiments have demonstrated the effectiveness of these methods in enhancing the image-level weak-to-strong consistency paradigm.", + "bbox": [ + 212, + 397, + 787, + 473 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Despite the success of the established paradigm, two challenges persist. Firstly, the existing paradigm confines all perturbations to the image level, thus impeding the exploration of a broader augmentation space and consistency at non-image levels. Secondly, as revealed in [12], a notable proportion of samples, even undergoing strong image-level perturbation, continues to be accurately classified with high confidence, resulting in a loss close to zero. These instances (some examples are shown in Fig. 5), referred to as naive samples, are well-learned and thus fail to boost the model's performance. Therefore, relying solely on image-level perturbation proves insufficient to fully exploit the potential of unlabeled data.", + "bbox": [ + 212, + 474, + 787, + 611 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To address the aforementioned challenges, we introduce a novel SSL paradigm named Image-Feature Weak-to-Strong Consistency (IFMatch). An overview of the conventional and proposed approaches is shown in Fig. 1. The primary innovation of our method lies in feature-level perturbation, which is motivated by earlier findings that regularizers effective in the input space can be extended to hidden representations [14, 15, 34]. Specifically, feature-level perturbation randomly alters intermediate features in the backbone, establishing the basis for feature-level consistency regulation. Furthermore, to achieve effective feature-level perturbation, we present refined designs focusing on position and strategy. For the perturbation position, we identify two positions to induce weak and strong feature-level perturbations, respectively. Regarding the perturbation strategy, we develop a series of approaches from three perspectives ('movement', 'dropout', and 'value'), thereby comprehensively exploring the feature augmentation space. Note that the proposed feature-level perturbation is sample-agnostic and thus differs from previous class-based feature augmentation techniques [20, 36].", + "bbox": [ + 212, + 613, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Building upon well-crafted augmentation techniques, we introduce the integration of two types of perturbations as another innovation. Our preliminary investigation (Tab. 3) reveals that a direct fusion of strong image-level and feature-level augmentation engenders destructive perturbations. To mitigate this issue, we propose a triple-branch structure to combine these two perturbation forms in a milder manner, as depicted in Fig. 1. Specifically, the teacher branch, mirroring its counterpart in the existing paradigm, employs predictions from samples subjected to weak image-level perturbation as pseudo-labels. Moreover, the first student branch integrates weak image-level perturbation and strong feature-level perturbation to thoroughly explore the feature augmentation space. Given limited prior research on feature-level perturbation, we delve deeper into the optimal threshold for this branch, revealing a preference for a high constant threshold over a dynamic one. In the second student branch, we combine weak feature-level perturbation with strong image-level perturbation, posing additional challenges for recognizing naive samples. However, the fused perturbation proves excessively arduous for classifying hard samples. Accordingly, we devise a confidence-based identification strategy to dynamically distinguish between naive and challenging samples, thereby introducing weak feature-level perturbation exclusively for naive samples. As the second branch predominantly relies on image-level perturbation, it can seamlessly integrate with existing threshold mechanisms. Prior to our study, UniMatch [40] uses feature-level perturbation and a multi-branch structure in semi-supervised semantic segmentation. However, their method is limited to the channel-wise dropout strategy and fails to achieve interactions between the two types of perturbations within a single branch, setting it apart from our paradigm. In summary, our contributions can be outlined as follows.", + "bbox": [ + 217, + 146, + 785, + 523 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "(1) We introduce the image-feature weak-to-strong consistency paradigm for semi-supervised learning, where the feature-level perturbation and the integration of two types of perturbation within each branch serve as the fundamental enhancement compared to previous methods.", + "(2) We meticulously design the position and strategy of feature-level perturbation to diversify its intensity and form.", + "(3) We devise a confidence-based identification strategy to discriminate between naive and challenging samples, thereby introducing extra challenges solely for naive samples in the second student branch.", + "(4) We conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate significant promotion of existing algorithms when following our paradigm." + ], + "bbox": [ + 212, + 523, + 784, + 705 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 729, + 387, + 747 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Consistency regulation [2] represents a fundamental approach to leveraging the potential of unlabeled data. Its core objective is to ensure consistent predictions across diverse perturbed views of the same sample. Various perturbation methods have been explored, such as stochastic augmentation [22, 31], adversarial attack [25], and mixup [43]. Additionally, FixMatch [32] applies strong", + "bbox": [ + 212, + 763, + 785, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "data augmentation techniques [7] to raw images, establishing the image-level weak-to-strong consistency paradigm. This paradigm significantly streamlines the framework and marks a pivotal milestone in semi-supervised learning.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Follow-up studies refine FixMatch along two dimensions: the utilization ratio of unlabeled data and fairness considerations. Regarding the former, numerous dynamic threshold strategies have been proposed. For example, FlexMatch [42] maps the predefined threshold to class-specific thresholds based on class-wise learning status. SoftMatch [5] models sample weights by a dynamic Gaussian function, maintaining a soft margin between unlabeled samples of different confidence levels. FreeMatch [35] utilizes the confidence on unlabeled data as the adaptive threshold. Moreover, the concept of fairness stems from entropy-based regulation [1,11,16,18,44]. The most representative strategy in this context, Distribution Alignment [3], encourages equal-frequency predictions across classes by refining pseudo-labels based on overall predictions within the unlabeled set.", + "bbox": [ + 212, + 191, + 784, + 357 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Concurrently, several studies express similar concerns to the old paradigm. FeatMatch [20] and ISDA [36] prevent the exclusive reliance on image-level perturbation by devising class-based feature augmentation approaches. In contrast, our proposed feature-level perturbation is sample-agnostic, circumventing harmful perturbations derived from erroneous pseudo-labels. Additionally, UniMatch [40] uses channel-wise dropout to establish an auxiliary branch for feature-level perturbation. In comparison, we present feature-level perturbations with varying intensities and forms, further combining them with image-level perturbations within each branch to boost their synergy. Besides, [12] observes excessive naive samples and applies more aggressive image-level augmentation to these samples. To address this issue, we propose a confidence-based identification strategy to effectively distinguish between naive and challenging samples and introduce weak feature-level perturbation exclusively for naive samples.", + "bbox": [ + 212, + 358, + 785, + 554 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 575, + 380, + 593 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Image-Level Weak-to-Strong Consistency", + "text_level": 1, + "bbox": [ + 214, + 606, + 602, + 622 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We begin by reviewing the image-level weak-to-strong consistency paradigm, as depicted in the left part of Fig. 1. Let $\\mathcal{D}_L = \\{(x_i,y_i)\\}_{i = 1}^{N_L}$ and $\\mathcal{D}_U = \\{u_i\\}_{i = 1}^{N_U}$ represent the labeled and unlabeled datasets, respectively. Here, $x_{i}$ and $u_{i}$ denote the labeled and unlabeled training samples, and $y_{i}$ refers to the one-hot label for the labeled sample $x_{i}$ . We denote the prediction of sample $x$ as $p(y|x)$ . Given a batch of labeled and unlabeled data, the model is optimized with the objective $\\mathcal{L} = \\mathcal{L}_s + \\lambda_u\\mathcal{L}_u$ . Specifically, $\\mathcal{L}_s$ indicates the cross-entropy loss ( $\\mathcal{H}$ ) for the labeled batch of size $B_{L}$ .", + "bbox": [ + 212, + 630, + 787, + 751 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {s} = \\frac {1}{B _ {L}} \\sum_ {i = 1} ^ {B _ {L}} \\mathcal {H} \\left(y _ {i}, p \\left(y \\mid x _ {i}\\right)\\right) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 406, + 760, + 785, + 800 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "On the other hand, $\\mathcal{L}_u$ signifies the image-level consistency regulation between the prediction of the strongly augmented view $\\mathcal{A}^{\\mathcal{T}_s}(u)$ and the pseudo-label", + "bbox": [ + 214, + 809, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 127 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/382aaf22fe6b077f6da4ee40038786e52a39e57fc20fa7735e2be1881046f498.jpg", + "image_caption": [ + "Fig. 2: Candidate positions for introducing feature-level perturbation. Position A perturbs the output of the residual block, representing strong feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_s}$ . Position B perturbs the output of a random convolution within the residual component, corresponding to weak feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_w}$ . $x^{in} / x^{out}$ denotes input/output feature maps of the residual block." + ], + "image_footnote": [], + "bbox": [ + 316, + 147, + 679, + 241 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "sourced from the corresponding weakly augmented view $\\mathcal{A}^{\\mathcal{I}_w}(u)$ . To mitigate incorrect pseudo-labels, FixMatch [32] introduces a constant threshold, and subsequent studies propose various dynamic threshold strategies. Without loss of generality, we denote the threshold as $\\tau_t$ and define $\\mathcal{L}_u$ as follows.", + "bbox": [ + 212, + 348, + 787, + 409 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {u} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau_ {t}\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {s}}\\right) \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 344, + 419, + 785, + 460 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Here, $p_i^{\\mathcal{I}_w}$ is the abbreviation of $DA(p(y|\\mathcal{A}^{\\mathcal{I}_w}(u_i)))$ , where $DA$ indicates the distribution alignment strategy [3]. $\\hat{p}_i^{\\mathcal{T}_w}$ denotes the one-hot pseudo-label obtained from $\\text{argmax}(p_i^{\\mathcal{I}_w})$ . Moreover, $p_i^{\\mathcal{I}_s}$ stands for $p(y|\\mathcal{A}^{\\mathcal{I}_s}(u_i))$ . Lastly, $B_U$ corresponds to the batch size of unlabeled data.", + "bbox": [ + 214, + 472, + 787, + 536 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Feature-Level Perturbation", + "text_level": 1, + "bbox": [ + 214, + 558, + 486, + 571 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To avoid the exclusive reliance on image-level perturbation, this paper introduces feature-level perturbation varied in intensity and form, thereby expanding the augmentation space. In the following parts, we will elaborate on the implementation of feature-level perturbation regarding its position and strategy.", + "bbox": [ + 212, + 583, + 785, + 643 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Position refers to where the feature-level perturbation is introduced. Given that WideResNet [41] is the prevailing backbone in SSL, we employ its basic component, the residual block [13] with pre-activation, as an illustrative example. Building upon previous studies that exploit feature-level regularizers directly after the convolution [14, 15, 34], we identify two positions for introducing feature-level perturbation, as depicted in Fig. 2. In position A, the method perturbs the summation of the residual and identity connections, i.e., the output of the residual block. As position A acts as the bottleneck for feedforward, perturbation at position A exhibits high intensity and is therefore regarded as strong feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_s}$ . Additionally, position B perturbs the output of a random convolution within the residual component, which is relatively milder than position A. Therefore, perturbation at position B is considered as weak feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_w}$ . It is worth noting that both", + "bbox": [ + 212, + 645, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "position choices are applicable to all residual blocks, and the algorithm randomly selects one position at each iteration to insert feature-level perturbation.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Strategy denotes the operation of feature-level perturbation. We first review strong image-level perturbation strategies $\\mathcal{A}^{\\mathcal{I}_s}$ [7], which can be roughly divided into three groups: 'movement', 'dropout', and 'value'. Specifically, 'movement' comprises spatial perturbations like translation and shearing, 'dropout' corresponds to the Cutout technique [9], and 'value' represents operations that modify pixel values while preserving pixel relationships, such as adjusting contrast, brightness, and histogram. Considering the effectiveness of $\\mathcal{A}^{\\mathcal{I}_s}$ , we develop feature-level perturbation strategies from the same perspectives. For 'movement', we implement feature map translation and shearing along the X-axis and Y-axis. Regarding 'dropout', we apply channel-wise and spatial-wise dropout on hidden representations. Concerning 'value', we employ random-sized convolutions to achieve local smoothing, subsequently using the weighted sum of smoothed and input feature maps as the output. During training, the model randomly selects one candidate strategy at each iteration to perturb hidden representations at the selected position. For the detailed implementation of feature-level perturbation strategies, please refer to Appendix Sec.1.", + "bbox": [ + 212, + 176, + 787, + 419 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Image-Feature Weak-to-Strong Consistency", + "text_level": 1, + "bbox": [ + 214, + 436, + 619, + 452 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Building upon well-designed image-level and feature-level perturbations, we can integrate them to achieve consistency regulation in both dimensions. Intuitively, a trivial approach is combining strong image-level and feature-level perturbations in one branch to construct a dual-branch structure similar to the old paradigm. However, such a toy paradigm engenders destructive perturbations according to our pilot study (Tab. 3). Accordingly, we integrate these two forms of perturbations in a more moderate manner, developing the image-feature weak-to-strong consistency paradigm (IFMatch) depicted in the right part of Fig. 1.", + "bbox": [ + 212, + 457, + 787, + 577 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Our paradigm retains the traditional teacher branch, utilizing predictions $\\hat{p}^{\\mathcal{T}_w}$ of samples subjected to weak image-level perturbation as pseudo-labels. Furthermore, we introduce two student branches to integrate both types of perturbations. Mathematically, given a batch of labeled and unlabeled data, the model is optimized using the objective $\\mathcal{L} = \\mathcal{L}_s + \\lambda_u(\\mathcal{L}_{u_1} + \\mathcal{L}_{u_2})$ , where $\\mathcal{L}_s$ denotes the cross-entropy loss for labeled data, and $\\mathcal{L}_{u_1}$ and $\\mathcal{L}_{u_2}$ represent the consistency regulation for unlabeled data in the two student branches respectively.", + "bbox": [ + 212, + 578, + 787, + 683 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In the first student branch, we integrate weak image-level perturbation $\\mathcal{A}^{\\mathcal{T}_w}$ and strong feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_s}$ to comprehensively explore the feature perturbation space. Furthermore, we employ the constant threshold $\\tau$ adopted in FixMatch to filter out incorrect pseudo-labels. This choice arises from the observation that existing dynamic threshold mechanisms are less suitable for $\\mathcal{A}^{\\mathcal{F}_s}$ , especially in challenging tasks. Thus, the unsupervised loss $\\mathcal{L}_{u_1}$ in the first student branch can be expressed as follows.", + "bbox": [ + 212, + 684, + 787, + 789 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {u _ {1}} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {w}, \\mathcal {F} _ {s}}\\right) \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 336, + 797, + 785, + 837 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 127 + ], + "page_idx": 5 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1: Image-Feature Weak-to-Strong Consistency (IFMatch)" + ], + "code_body": "Input: labeled data $\\mathcal{D}_L = \\{(x_i,y_i)\\}_{i = 1}^{N_L}$ , unlabeled data $\\mathcal{D}_U = \\{u_i\\}_{i = 1}^{N_U}$ , batch sizes $B_{L}$ and $B_{U}$ , loss weight $\\lambda_{u}$ , total iterations $T$ , perturbations $\\{\\mathcal{A}^{\\mathcal{I}_w},\\mathcal{A}^{\\mathcal{I}_s},\\mathcal{A}^{\\mathcal{F}_w},\\mathcal{A}^{\\mathcal{F}_s}\\}$ , constant threshold $\\tau$ , threshold mechanism $\\tau_{t}$ , target confidence $\\{h_1,h_2,\\dots ,h_{N_U}\\}$ , mask $\\{\\mathcal{M}_1,\\mathcal{M}_2,\\dots ,\\mathcal{M}_{N_U}\\}$ \n1 for $t\\gets 1$ to $T$ do // the same parts as the old paradigm \n2 Compute supervised loss $\\mathcal{L}_s$ , pseudo-labels $p^{\\mathcal{I}_w}$ and $\\hat{p}^{\\mathcal{I}_w}$ , and threshold $\\tau_t$ . // the first student branch \n3 Compute predictions $p^{\\mathcal{I}_w,\\mathcal{F}_s}$ and loss $\\mathcal{L}_{u_1}$ using Eq. (3); // the second student branch \n4 Decide whether to introduce $\\mathcal{A}^{\\mathcal{F}_w}$ for $u_{i}$ in the second student branch according to the mask $\\mathcal{M}_i$ using Eq. (6) and Eq. (7); \n5 Compute predictions $p^{\\mathcal{I}_s,\\mathcal{F}_w}$ and loss $\\mathcal{L}_{u_2}$ using Eq. (4); // update model \n6 Back-propagate loss $\\mathcal{L} = \\mathcal{L}_s + \\lambda_u(\\mathcal{L}_{u_1} + \\mathcal{L}_{u_2})$ and update parameters ; // Confidence-based identification strategy \n7 Record target confidence $h_i = p_{i,j}^{\\mathcal{I}_s,\\mathcal{F}_w}(j = \\hat{p}_i^{\\mathcal{I}_w})$ and mask $\\mathcal{M}_i = \\mathbb{1}(h_i\\geq \\tau_t)$ \n8 end", + "bbox": [ + 225, + 169, + 764, + 431 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here, $p_i^{\\mathcal{I}_w,\\mathcal{F}_s}$ denotes the prediction of $u_{i}$ in the first branch.", + "bbox": [ + 215, + 463, + 648, + 481 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In the second student branch, we combine strong image-level perturbation $\\mathcal{A}^{\\mathcal{I}_s}$ and weak feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_w}$ to provide additional challenges in recognizing naive samples. However, a direct fusion of $\\mathcal{A}^{\\mathcal{I}_s}$ and $\\mathcal{A}^{\\mathcal{F}_w}$ poses obstacles in classifying hard samples. Accordingly, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing extra challenges exclusively for naive samples, which will be detailed in Sec. 3.4. Moreover, given the central role of $\\mathcal{A}^{\\mathcal{I}_s}$ , we leverage existing threshold mechanisms $\\tau_t$ to exclude misleading pseudo-labels, facilitating seamless integration with previous algorithms. Consequently, the unsupervised loss $\\mathcal{L}_{u_2}$ in the second branch can be defined as follows.", + "bbox": [ + 212, + 481, + 787, + 632 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {u _ {2}} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau_ {t}\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {s}, \\mathcal {F} _ {w}}\\right) \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 330, + 637, + 785, + 678 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $p_i^{\\mathcal{I}_s, \\mathcal{F}_w}$ represents the prediction of sample $u_i$ in the second branch. Particularly, the use of distinct thresholds in the two student branches is motivated not only by experiments (Tab. 5) but also by an inherent rationale. Specifically, the threshold serves to balance the utilization ratio of unlabeled data and pseudolabel accuracy [5, 35]. Furthermore, $\\mathcal{A}^{\\mathcal{F}_s}$ and $\\mathcal{A}^{\\mathcal{I}_s}$ act as the central driving forces behind the respective student branch. Due to the unique characteristics of $\\mathcal{A}^{\\mathcal{F}_s}$ and $\\mathcal{A}^{\\mathcal{I}_s}$ , they exhibit varying preferences in the trade-off between the utilization and pseudo-label accuracy, resulting in the different desired threshold mechanisms in the two student branches. For a further understanding of our paradigm, please refer to Algorithm 1.", + "bbox": [ + 212, + 686, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/130ce1eaed085c06bf572a8c3bec33c0be4b50e31fbff743f35cb63d192525e6.jpg", + "image_caption": [ + "Fig. 3: Overview of the confidence-based identification strategy. The approach records sample-wise target confidence in the second student branch and identifies naive samples by comparing the confidence with the threshold in the second student branch. $w/$ and $w/o$ abbreviates with and without, respectively." + ], + "image_footnote": [], + "bbox": [ + 316, + 143, + 689, + 239 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Confidence-Based Identification", + "text_level": 1, + "bbox": [ + 215, + 333, + 524, + 348 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As analyzed in Sec. 3.3, the combination of strong image-level perturbation $\\mathcal{A}^{\\mathcal{I}_s}$ and weak feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_w}$ poses supplementary challenges for naive samples yet incurs exceeding difficulty for hard ones. Likewise, previous research has encountered similar challenges in expanding the augmentation space. For example, UniMatch [40] observes a performance degradation caused by the concatenation of channel-wise dropout and $\\mathcal{A}^{\\mathcal{I}_s}$ and finally denies the feasibility of combining $\\mathcal{A}^{\\mathcal{I}}$ and $\\mathcal{A}^{\\mathcal{F}}$ within one branch. Besides, [12] imposes more aggressive image-level perturbations exclusively on naive samples. To distinguish between naive and challenging samples, their approach records sample-wise loss and utilizes the OTSU [28] method for distinction. However, OTSU is conventionally applied to the segmentation of bimodal gray-scale images, whereas the histogram of loss values typically exhibits a descending trend. As shown in Fig. 4, their approach tends to produce identification biased toward naive samples.", + "bbox": [ + 212, + 358, + 787, + 554 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To effectively identify the naive samples, we propose a confidence-based identification strategy, which is depicted in Fig. 3. Similar to the threshold-based rule for pseudo-label filtering that only predictions exceeding the confidence threshold qualify as pseudo-labels, the proposed strategy can be succinctly concluded as: 'only strongly augmented samples $\\mathcal{A}^{\\mathcal{I}_s}(u)$ with target confidence exceeding the threshold are considered naive and necessitate additional weak feature-level perturbation $\\mathcal{A}^{\\mathcal{F}_w}$ . Specifically, the approach comprises two steps. Firstly, we record the confidence linked to the pseudo-label within the predicted distribution of the second branch. Mathematically, the target confidence $h_i$ for sample $u_i$ in the second student branch can be obtained as follows.", + "bbox": [ + 214, + 555, + 789, + 705 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nh _ {i} = p _ {i, j} ^ {\\mathcal {I} _ {s}, \\mathcal {F} _ {w}} (j = \\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}) \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 714, + 785, + 736 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "It is important to clarify that $p_i^{\\mathcal{I}_s, \\mathcal{F}_w}$ solely represents the prediction of sample $u_i$ in the second branch and has nothing to do with the introduction of $\\mathcal{A}^{\\mathcal{F}_w}$ for $u_i$ . Secondly, the algorithm generates a binary mask for each sample to determine whether to introduce additional $\\mathcal{A}^{\\mathcal{F}_w}$ by comparing the target confidence with the threshold $\\tau_t$ in the second student branch. Consequently, the mask for sample $u_i$ , denoted as $\\mathcal{M}_i$ , and the perturbations applied to $u_i$ in the second student", + "bbox": [ + 214, + 747, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/8fa29abb48116dc3361c10493367ab21eff9aa93d38ae2fc27e6fd5906e9becd.jpg", + "table_caption": [ + "Table 1: Accuracy $(\\%)$ on four benchmarks with varying numbers of labels. Bold indicates the best performance, and underline denotes the second best. We omit the standard deviation of performance, as the proposed paradigm performs stable across different random seeds. IFMatch $(^{*})$ represents the proposed paradigm using the threshold mechanism of $^*$ in the second student branch. In Particular, given that SoftMatch proposes a sample weight strategy rather than a threshold scheme, IFMatch (Soft) inherits its weight scheme when computing $\\mathcal{L}_{u_2}$ and replaces the $\\tau_{t}$ in Eq. (6) with the mean value of the dynamic Gaussian in SoftMatch when identifying naive samples." + ], + "table_footnote": [], + "table_body": "
DatasetsCIFAR-10CIFAR-100SVHNSTL-10ImageNet
# Label402504000400250010000401000401000100k400k
VAT [25]25.3458.9789.4914.8053.1667.8625.2595.8925.2662.05--
MeanTeacher [33]29.9162.5491.9018.8954.8368.2563.9196.7328.2866.10--
MixMatch [4]63.8186.3793.3432.4160.2472.2269.4096.3145.0778.30--
ReMixMatch [3]90.1293.7095.1657.2573.9779.9875.9694.8467.8893.26--
UDA [38]89.3894.8495.7153.6172.2777.5194.8898.1162.5893.36--
Dash [39]91.0794.8495.6455.1872.8578.1297.8198.0365.4893.61--
MPL [29]93.3894.2495.4553.7472.2978.2690.6797.7264.2493.34--
FixMatch [32]92.5395.1495.7953.5871.9777.8096.1998.0464.0393.7556.3467.72
IFMatch (Fix)95.8295.9796.4966.2674.6580.0197.7598.1578.5495.2861.2671.48
FlexMatch [42]95.0395.0295.8160.0673.5178.1091.8193.2870.8594.2358.1568.69
IFMatch (Flex)95.9095.9996.4266.2875.0379.8797.7698.0479.8395.2461.7571.14
SoftMatch [5]95.0995.1895.9662.9073.3477.9797.6797.9978.5894.2759.4370.51
IFMatch (Soft)95.8495.9396.3667.0274.9979.9698.0498.2282.4695.2262.4471.66
FreeMatch [35]95.1095.1295.9062.0273.5378.3298.0398.0484.4494.3758.4869.48
IFMatch (Free)95.8396.0296.4466.6575.1680.0898.0898.1884.7595.2961.6971.30
", + "bbox": [ + 217, + 268, + 785, + 488 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "branch can be expressed as follows.", + "bbox": [ + 215, + 502, + 472, + 517 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {M} _ {i} = \\mathbb {1} \\left(h _ {i} \\geq \\tau_ {t}\\right) \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 450, + 527, + 784, + 542 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\text {P e r t u r b a t i o n s f o r} u _ {i} = \\left\\{ \\begin{array}{l l} \\left\\{\\mathcal {A} ^ {\\mathcal {I} _ {s}}, \\mathcal {A} ^ {\\mathcal {F} _ {w}} \\right\\} & \\mathcal {M} _ {i} = 1 \\\\ \\left\\{\\mathcal {A} ^ {\\mathcal {I} _ {s}} \\right\\} & \\mathcal {M} _ {i} = 0 \\end{array} \\right. \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 331, + 547, + 784, + 588 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The approach dynamically updates $\\mathcal{M}_i$ throughout the training process, thereby considering both the learning status of individual samples and model performance when introducing $\\mathcal{A}^{\\mathcal{F}_w}$ .", + "bbox": [ + 212, + 595, + 787, + 642 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 664, + 375, + 681 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Balanced Semi-Supervised Learning", + "text_level": 1, + "bbox": [ + 215, + 694, + 558, + 710 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Settings. We conduct experiments on multiple benchmarks, including CIFAR-10/100 [19], SVHN [26], STL-10 [6], and ImageNet [8], with various numbers of labeled samples. In the context of balanced SSL, we maintain a balanced distribution for labeled samples. The choice of backbone architecture adheres to established practices, employing specific models for different datasets: WRN-28-2 [41] for CIFAR-10 and SVHN, WRN-28-8 for CIFAR-100, WRN-37-2 [45] for STL-10, and ResNet-50 [13] for ImageNet. As for training parameters, we follow the unified codebase TorchSSL [42] to ensure fair comparisons. Specifically, batch", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "sizes $B_{L}$ and $B_{U}$ are set to 128 and 128 on ImageNet and 64 and 448 on the remaining datasets. Moreover, the model is trained using the SGD optimizer with an initial learning rate of 0.03 and a momentum decay of 0.9. The learning rate is adjusted by a cosine decay scheduler over a total of $2^{20}$ steps. Besides, we train the EMA model with a momentum decay of 0.999 for inference. The fixed threshold $\\tau$ in the first branch is set to 0.95. For SVHN, we follow previous studies [35, 39] and constrain the dynamic threshold within the range of [0.9, 1.0]. To suppress randomness, we repeat each experiment three times and report the average accuracy in Tab. 1. We omit the standard deviation given the stable performance of the proposed paradigm across different random seeds.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Performance. We apply the proposed paradigm (IFMatch) to several algorithms and compare their performance with existing methods on multiple benchmarks. The results presented in Tab. 1 underscore the significant contribution of our paradigm to promoting the performance of existing SSL algorithms. Specifically, the four algorithms involved achieve the average improvement of $4.05\\%$ , $3.22\\%$ , $1.62\\%$ , and $1.39\\%$ across all datasets. Moreover, previous methods struggle to enhance performance on less challenging tasks, such as CIFAR-10. In contrast, when integrated with the proposed paradigm, IFMatch (Fix) outperforms FixMatch by $2.29\\% / 0.83\\% / 0.70\\%$ on CIFAR-10 with $40 / 250 / 4000$ labeled samples, respectively. Furthermore, our approach effectively addresses the challenges posed by extremely limited labeled samples, with IFMatch (Fix) achieving enhancements of $14.51\\%$ and $12.68\\%$ on STL-10 with 40 labels and CIFAR-100 with 400 labels, respectively, compared to FixMatch. Moreover, the four algorithms achieve an average promotion of $3.69\\% / 2.30\\%$ on ImageNet with $100k / 400k$ labels when following the proposed paradigm, indicating its effectiveness on large-scale datasets. Additionally, when employing our paradigm, the performance gap between dynamic and constant thresholds considerably narrows on challenging tasks, while IFMatch (Fix) even emerges as the preferred method on some less demanding tasks. The shifted performance gap implies a reduced reliance on complex threshold strategies of our paradigm, which primarily benefits from the expanded augmentation space. In summary, the impressive performance observed in Tab. 1 confirms the effectiveness of the proposed paradigm.", + "bbox": [ + 212, + 297, + 787, + 631 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Imbalanced Semi-Supervised Learning", + "text_level": 1, + "bbox": [ + 215, + 656, + 578, + 672 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Settings. We evaluate the proposed paradigm in the context of imbalanced SSL, where both labeled and unlabeled data exhibit a long-tailed distribution. Consistent with prior studies [5,10,21,23,27,37], we construct labeled and unlabeled sets using the configurations of $N_{c} = N_{1} \\cdot \\gamma^{-\\frac{c - 1}{C - 1}}$ and $M_{c} = M_{1} \\cdot \\gamma^{-\\frac{c - 1}{C - 1}}$ . Specifically, for CIFAR-10-LT, we set $N_{1}$ to 1500, $M_{1}$ to 3000, and $\\gamma$ to range from 50 to 150. Moreover, for CIFAR-100-LT, we set $N_{1}$ to 150, $M_{1}$ to 300, and $\\gamma$ to span from 20 to 100. In all experiments, we employ WRN-28-2 as the backbone and utilize the Adam optimizer [17] with a weight decay of 4e-5. Besides, batch sizes $B_{L}$ and $B_{U}$ are fixed as 64 and 128 respectively. Additionally, the learning rate is initially set to 2e-3 and adjusted by a cosine decay scheduler during", + "bbox": [ + 212, + 685, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/ed451a685efd55f039a9262fab16e14c54d44673021c61e834339abba227b01c.jpg", + "table_caption": [ + "Table 2: Performance (%) on CIFAR-10/100-LT with varying imbalance ratio." + ], + "table_footnote": [], + "table_body": "
DatasetCIFAR-10-LTCIFAR-100-LT
γ501001502050100
FixMatch [32]81.54±0.3074.89±1.2070.38±0.8849.58±0.7842.11±0.3337.60±0.48
IFMatch (Fix)85.32±0.3379.46±0.3575.59±0.4853.61±0.2544.58±0.3839.92±0.37
FlexMatch [42]81.87±0.1974.49±0.9270.20±0.3650.89±0.6042.80±0.3937.30±0.47
IFMatch (Flex)84.36±0.1279.04±0.4273.02±0.4751.83±0.3343.49±0.3537.98±0.36
SoftMatch [5]83.45±0.2977.07±0.3772.60±0.4651.91±0.5543.76±0.5138.92±0.81
IFMatch (Soft)85.56±0.1580.28±0.2476.18±0.3453.97±0.3244.98±0.4139.68±0.41
FreeMatch [35]83.30±0.3375.96±0.4971.20±0.6451.60±0.9142.95±0.4837.50±0.23
IFMatch (Free)84.88±0.2080.12±0.2974.85±0.4752.77±0.4643.68±0.4538.00±0.55
", + "bbox": [ + 241, + 171, + 758, + 316 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "training. We set the fixed threshold $\\tau$ in the first branch to 0.95. To account for randomness, we report the mean and standard deviation of the performance across three different random seeds.", + "bbox": [ + 212, + 335, + 782, + 380 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Performance. We apply the proposed paradigm to numerous algorithms and compare the performance with their counterparts following the old paradigm. The results in Tab. 2 demonstrate that our paradigm substantially improves existing models, enabling them to achieve state-of-the-art performance. Specifically, when integrated with the enhanced paradigm, the four algorithms achieve the average promotion of $3.72\\%$ , $2.03\\%$ , $2.16\\%$ , and $1.92\\%$ across all benchmarks. Notably, IFMatch (Fix) outperforms FixMatch by $5.21\\%$ and $2.32\\%$ on CIFAR-10-LT ( $\\gamma = 150$ ) and CIFAR-100-LT ( $\\gamma = 100$ ), highlighting the robustness of the proposed paradigm when facing severe imbalance. Moreover, the performance gap between dynamic-threshold-based methods and FixMatch substantially narrows within our paradigm. Accordingly, the proposed approach promotes the utilization of unlabeled data, reducing reliance on complex threshold mechanisms. Overall, the impressive performance observed in imbalanced SSL suggests the potential of our approach to be deployed in real-world applications.", + "bbox": [ + 212, + 382, + 787, + 594 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Component Analysis", + "text_level": 1, + "bbox": [ + 215, + 617, + 433, + 633 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "This section presents the contribution of each component within the proposed paradigm. Unless otherwise stated, we conduct experiments on IFMatch (Fix). Additionally, we provide running speed analysis, feature visualization results [24], and performance on semi-supervised semantic segmentation in the Appendix. The subsequent analysis presents the revealed findings.", + "bbox": [ + 212, + 642, + 782, + 718 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The proposed approach to integrating image-level and feature-level perturbations yields optimal performance. As the simplest idea, we can integrate $\\mathcal{A}^{\\mathcal{F}_s}$ and $\\mathcal{A}^{\\mathcal{I}_s}$ within one branch to establish a dual-branch structure similar to the old paradigm. Nonetheless, such a toy design engenders disruptive perturbations that exceed acceptable augmentation levels for consistency regulation, resulting in the performance degradation presented in lines 1-2 of Tab. 3. An alternative approach, proposed by UniMatch [40], combines $\\mathcal{A}^{\\mathcal{F}}$ and $\\mathcal{A}^{\\mathcal{I}}$ in separate branches, each employing a distinct type of perturbation (line 3).", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/23279d2e65c92d0aa51e623c4be7a0fd4a2fb138aa187552d0b7115b39465b0f.jpg", + "table_caption": [ + "Table 3: Experiments (\\%) on the strategies for integrating image-level and feature-level perturbations. CBI abbreviates the confidence-based identification strategy. CIFAR- $m-n$ denotes CIFAR- $m$ with $n$ labeled samples. Line 3 combines the structure setting of UniMatch [40] and our proposed feature-level perturbation techniques." + ], + "table_footnote": [], + "table_body": "
Branch IBranch IICIFAR-10-40CIFAR-100-400
FixMatch (baseline, no \\(\\mathcal{A}^{\\mathcal{F}}\\))92.5353.58
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_s}\\) in one branch88.2651.47
\\(\\mathcal{A}^{\\mathcal{F}_s}\\)\\(\\mathcal{A}^{\\mathcal{I}_s}\\)95.5364.54
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}\\)\\(\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s}\\)95.4763.56
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}\\)\\(\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s} + \\text{CBI}\\)95.8266.26
", + "bbox": [ + 305, + 212, + 694, + 303 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/b4f14ab6b515759bc82a22c65385b848b215b7f89a5a98f5446df559daf24fe1.jpg", + "table_caption": [ + "Table 4: Ablation study (%) for the strategies of feature-level perturbation." + ], + "table_footnote": [], + "table_body": "
A^F StrategyCIFAR-10-40CIFAR-100-400
All strategies95.8266.26
w/o channel-wise dropout95.66 (↓0.16)65.68 (↓0.58)
w/o spatial-wise dropout95.57 (↓0.25)65.77 (↓0.49)
w/o translation95.59 (↓0.23)65.70 (↓0.56)
w/o shearing95.58 (↓0.24)65.81 (↓0.47)
w/o value modification95.62 (↓0.20)65.75 (↓0.51)
", + "bbox": [ + 328, + 342, + 671, + 431 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Despite its effectiveness, this method fails to boost interactions between the two types of perturbations. Accordingly, we attempt to achieve the co-occurrence of $\\mathcal{A}^{\\mathcal{F}}$ and $\\mathcal{A}^{\\mathcal{I}}$ within one branch, thereby constructing a more comprehensive augmentation space. The proposed paradigm adopts a milder combination strategy, specifically using $\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}$ and $\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s}$ in the two student branches respectively. However, as shown in line 4 of Tab. 3, the introduction of $\\mathcal{A}^{\\mathcal{F}_w}$ leads to a performance drop compared to UniMatch, probably due to the derived difficulties in recognizing hard samples. To address this issue, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Finally, the proposed paradigm (IFMatch), as presented in line 5, achieves the optimal performance among all candidate designs for integrating $\\mathcal{A}^{\\mathcal{F}}$ and $\\mathcal{A}^{\\mathcal{I}}$ , demonstrating its effectiveness and advantages.", + "bbox": [ + 212, + 460, + 787, + 656 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "All feature-level perturbation strategies contribute to the overall performance. As shown in Tab. 4, we conduct an ablation study on feature-level perturbation strategies. The baseline model in line 1 integrates all proposed strategies and achieves state-of-the-art performance. In subsequent configurations (line 2-6), we sequentially remove each strategy. Compared to the baseline, the absence of any proposed perturbation technique leads to a decline in performance on both datasets. Therefore, the proposed perturbation strategies exhibit a synergistic effect, collaboratively exploring the feature perturbation space.", + "bbox": [ + 212, + 657, + 787, + 777 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Feature-level perturbation $\\mathcal{A}^{\\mathcal{F}}$ favors a high constant threshold over a dynamic one. As detailed in Sec. 3.3, $\\mathcal{A}^{\\mathcal{F}}$ and $\\mathcal{A}^{\\mathcal{I}}$ may require different threshold mechanisms due to their distinct characteristics. Considering the central role of $\\mathcal{A}^{\\mathcal{F}}$ ( $\\mathcal{A}^{\\mathcal{F}_s}$ ) in the first student branch, we further delve into the", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/53db0cabec503eb55fb66dcbe4aa29e0596e67cf496d7cf839578e224dd10241.jpg", + "table_caption": [ + "Table 5: Exploration (%) for the threshold strategy in the first branch." + ], + "table_footnote": [], + "table_body": "
Branch IBranch IICIFAR-10-40CIFAR-100-400
FlexMatchFlexMatch95.2863.38
τ = 0.95FlexMatch95.9066.28
SoftMatchSoftMatch95.3963.80
τ = 0.95SoftMatch95.8467.02
FreeMatchFreeMatch95.5664.45
τ = 0.95FreeMatch95.8366.65
", + "bbox": [ + 336, + 170, + 663, + 271 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/9eccbfdd1d4bd4be69e93f38565dfb58855eae042efc6edb7653e309f345686d.jpg", + "table_caption": [ + "Table 6: Comparison (%) between SAA [12] and confidence-based identification." + ], + "table_footnote": [], + "table_body": "
Identification StrategyCIFAR-10-40CIFAR-100-400
SAA [12]95.5465.32
Confidence-Based Identification95.8266.26
", + "bbox": [ + 310, + 310, + 687, + 358 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "threshold strategy best suited for it. In general, existing threshold mechanisms can be categorized into constant thresholds and dynamic thresholds. The former prioritizes high pseudo-label accuracy at the expense of diminished utilization of unlabeled data, while the latter performs conversely. Accordingly, we determine the optimal threshold for the first branch from two candidates: a dynamic threshold mirroring the one used in the second branch and the constant threshold used in FixMatch. Combining Tab. 5 and Tab. 1, the proposed paradigm consistently outperforms the old paradigm regardless of the threshold adopted in the first branch. Additionally, the constant threshold beats all dynamic threshold mechanisms, suggesting that feature-level perturbation $\\mathcal{A}^{\\mathcal{F}}$ is better suited to a constant threshold of 0.95, rather than existing dynamic threshold mechanisms.", + "bbox": [ + 212, + 386, + 787, + 551 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "IFMatch outperforms previous methods from the perspective of the naive sample ratio. Firstly, as shown in the left part of Fig. 4, our approach (orange) achieves a lower naive sample ratio than UniMatch (green). This suggests more effective utilization of unlabeled data in our paradigm, primarily benefiting from combining both types of perturbation within each branch. Secondly, we compare the confidence-based identification strategy and SAA [12] within our paradigm to discern a better naive sample identification method. Specifically, SAA utilizes loss values as the criteria, recording historical loss for each sample and performing naive-challenging division by OTSU [28]. As shown in Tab. 6, the proposed module consistently outperforms SAA. Additionally, the naive sample ratio presented in the left part of Fig. 4 indicates that SAA (blue) tends to produce identification biased toward naive samples (e.g. starting with a ratio of 0.5 in the first iteration). Furthermore, we analyze the identification process of both strategies in the later training stages, as shown in the right part of Fig. 4. Notably, when employing the cross-entropy loss, the loss threshold of 1.79 in SAA corresponds to a confidence threshold of 0.17 (computed as $e^{-1.79}$ ), which is a detrimental configuration. The limitations of SAA can be ascribed to the ill-suited nature of the OTSU technique for segmenting a histogram with a monotonically decreasing trend. In contrast, our strategy remains effective in", + "bbox": [ + 212, + 553, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/5b211e0788184c30bfe317c134835b068a9681d6a304acd2011e960251acbace.jpg", + "image_caption": [ + "Fig. 4: Visualization for naive sample ratio and the identification process of SAA [12] and confidence-based identification on CIFAR-100-400." + ], + "image_footnote": [], + "bbox": [ + 290, + 148, + 709, + 244 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/26d54796fdbdd7193856a9461b532ae29194cb484d5f4ce97aa95f351a2e845a.jpg", + "image_caption": [ + "Fig. 5: Visualization of perturbations. We provide the feature map for samples that undergo feature-level augmentation. A naive sample $u$ exhibits the characteristic of $\\forall \\mathcal{A}^{\\mathcal{I}_s}(u), \\mathcal{H}(\\hat{p}_i^{\\mathcal{I}_w}, p_i^{\\mathcal{I}_s}) \\approx 0$ , thus contributing trivially to the model's performance." + ], + "image_footnote": [], + "bbox": [ + 285, + 297, + 699, + 392 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "distinguishing between naive and challenging samples even if the unlabeled set is predominantly composed of naive samples.", + "bbox": [ + 212, + 470, + 784, + 502 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Visualization analysis. We present the visualization for image-level and feature-level perturbations in Fig. 5, where the four parts (from left to right) correspond to the raw images, the images subjected to $\\mathcal{A}^{\\mathcal{I}_s}$ , and the feature maps that undergo $\\mathcal{A}^{\\mathcal{F}_w} \\circ \\mathcal{A}^{\\mathcal{I}_s}$ and $\\mathcal{A}^{\\mathcal{F}_s} \\circ \\mathcal{A}^{\\mathcal{I}_w}$ . We can observe that the exclusive reliance on $\\mathcal{A}^{\\mathcal{I}_s}$ engenders easy-to-recognize (naive) samples. In contrast, the proposed paradigm effectively combines $\\mathcal{A}^{\\mathcal{I}}$ and $\\mathcal{A}^{\\mathcal{F}}$ to expand the augmentation space. For additional visualization results, please refer to Appendix Sec.2.", + "bbox": [ + 212, + 503, + 787, + 609 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 628, + 359, + 645 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This paper introduces feature-level perturbation to expand the augmentation space of the conventional semi-supervised learning framework, establishing the image-feature weak-to-strong consistency paradigm (IFMatch). To achieve effective feature-level perturbation, we propose refined designs that consider both perturbation position and strategy, facilitating diversity in terms of intensity and form. Furthermore, our paradigm develops two parallel student branches to seamlessly integrate the two types of perturbations and comprehensively explore the augmentation space. Additionally, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Extensive experiments are conducted on multiple benchmarks, including both balanced and imbalanced label distributions. The experimental results demonstrate the effectiveness of our approach.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Arazo, E., Ortego, D., Albert, P., O'Connor, N.E., McGuinness, K.: Pseudolabeling and confirmation bias in deep semi-supervised learning. In: 2020 International Joint Conference on Neural Networks (IJCNN). pp. 1-8. IEEE (2020)", + "2. Bachman, P., Alsharif, O., Precup, D.: Learning with pseudo-ensembles. Advances in neural information processing systems 27 (2014)", + "3. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019)", + "4. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. Advances in neural information processing systems 32 (2019)", + "5. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality trade-off in semi-supervised learning. arXiv preprint arXiv:2301.10921 (2023)", + "6. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223. JMLR Workshop and Conference Proceedings (2011)", + "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020)", + "8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)", + "9. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout. arXiv preprint arXiv:1708.04552 (2017)", + "10. Fan, Y., Dai, D., Kukleva, A., Schiele, B.: Cossl: Co-learning of representation and classifier for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14574-14584 (2022)", + "1. Grandvalet, Y., Bengio, Y.: Semi-supervised learning by entropy minimization. Advances in neural information processing systems 17 (2004)", + "2. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15880-15889 (2023)", + "3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)", + "4. Hinton, G.E., Srivastava, N., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.R.: Improving neural networks by preventing co-adaptation of feature detectors. arXiv preprint arXiv:1207.0580 (2012)", + "5. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International conference on machine learning. pp. 448-456. pmlr (2015)", + "6. Kim, J., Hur, Y., Park, S., Yang, E., Hwang, S.J., Shin, J.: Distribution aligning refinery of pseudo-label for imbalanced semi-supervised learning. Advances in neural information processing systems 33, 14567-14579 (2020)" + ], + "bbox": [ + 225, + 172, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)", + "18. Krause, A., Perona, P., Gomes, R.: Discriminative clustering by regularized information maximization. Advances in neural information processing systems 23 (2010)", + "19. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)", + "20. Kuo, C.W., Ma, C.Y., Huang, J.B., Kira, Z.: Featmatch: Feature-based augmentation for semi-supervised learning. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVIII 16. pp. 479-495. Springer (2020)", + "21. Lai, Z., Wang, C., Gunawan, H., Cheung, S.C.S., Chuah, C.N.: Smoothed adaptive weighting for imbalanced semi-supervised learning: Improve reliability against unknown distribution data. In: International Conference on Machine Learning. pp. 11828-11843. PMLR (2022)", + "22. Laine, S., Aila, T.: Temporal ensembling for semi-supervised learning. arXiv preprint arXiv:1610.02242 (2016)", + "23. Lee, H., Shin, S., Kim, H.: Abc: Auxiliary balanced classifier for class-imbalanced semi-supervised learning. Advances in Neural Information Processing Systems 34, 7082-7094 (2021)", + "24. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research 9(11) (2008)", + "25. Miyato, T., Maeda, S.i., Koyama, M., Ishii, S.: Virtual adversarial training: a regularization method for supervised and semi-supervised learning. IEEE transactions on pattern analysis and machine intelligence 41(8), 1979-1993 (2018)", + "26. Netzer, Y., Wang, T., Coates, A., Bissacco, A., Wu, B., Ng, A.Y.: Reading digits in natural images with unsupervised feature learning (2011)", + "27. Oh, Y., Kim, D.J., Kweon, I.S.: Daso: Distribution-aware semantics-oriented pseudo-label for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9786-9796 (2022)", + "28. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979)", + "29. Pham, H., Dai, Z., Xie, Q., Le, Q.V.: Meta pseudo labels. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11557-11568 (2021)", + "30. Rosenberg, C., Hebert, M., Schneiderman, H.: Semi-supervised self-training of object detection models (2005)", + "31. Sajjadi, M., Javanmardi, M., Tasdizen, T.: Regularization with stochastic transformations and perturbations for deep semi-supervised learning. Advances in neural information processing systems 29 (2016)", + "32. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020)", + "33. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. Advances in neural information processing systems 30 (2017)", + "34. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International conference on machine learning. pp. 6438-6447. PMLR (2019)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Wu and Cui", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "35. Wang, Y., Chen, H., Heng, Q., Hou, W., Savvides, M., Shinozaki, T., Raj, B., Wu, Z., Wang, J.: Freematch: Self-adaptive thresholding for semi-supervised learning. arXiv preprint arXiv:2205.07246 (2022)", + "36. Wang, Y., Huang, G., Song, S., Pan, X., Xia, Y., Wu, C.: Regularizing deep networks with semantic data augmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(7), 3733-3748 (2021)", + "37. Wei, C., Sohn, K., Mellina, C., Yuille, A., Yang, F.: Crest: A class-rebalancing self-training framework for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10857-10866 (2021)", + "38. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020)", + "39. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: International Conference on Machine Learning. pp. 11525-11536. PMLR (2021)", + "40. Yang, L., Qi, L., Feng, L., Zhang, W., Shi, Y.: Revisiting weak-to-strong consistency in semi-supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7236-7246 (2023)", + "41. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016)", + "42. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. Advances in Neural Information Processing Systems 34, 18408-18419 (2021)", + "43. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017)", + "44. Zhao, Z., Zhou, L., Duan, Y., Wang, L., Qi, L., Shi, Y.: Dc-ssl: Addressing mismatched class distribution in semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9757-9765 (2022)", + "45. Zhou, T., Wang, S., Bilmes, J.: Time-consistent self-supervision for semi-supervised learning. In: International Conference on Machine Learning. pp. 11523-11533. PMLR (2020)", + "46. Zhu, X.J.: Semi-supervised learning literature survey (2005)" + ], + "bbox": [ + 212, + 146, + 787, + 618 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Image-Feature Weak-to-Strong Consistency", + "bbox": [ + 441, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_model.json b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_model.json new file mode 100644 index 0000000000000000000000000000000000000000..12d78f7bbd52983158fa84eb491f91d1aad0b39a --- /dev/null +++ b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_model.json @@ -0,0 +1,2016 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.23, + 0.141, + 0.776, + 0.21 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency: An Enhanced Paradigm for Semi-Supervised Learning" + }, + { + "type": "text", + "bbox": [ + 0.397, + 0.236, + 0.605, + 0.252 + ], + "angle": 0, + "content": "Zhiyu Wu and Jinshi Cui" + }, + { + "type": "text", + "bbox": [ + 0.286, + 0.264, + 0.717, + 0.306 + ], + "angle": 0, + "content": "National Key Laboratory of General Artificial Intelligence, School of Intelligence Science and Technology, Peking University wuzhiyu@pku.edu.cn, cjs@cis.pku.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.349, + 0.74, + 0.598 + ], + "angle": 0, + "content": "Abstract. Image-level weak-to-strong consistency serves as the predominant paradigm in semi-supervised learning (SSL) due to its simplicity and impressive performance. Nonetheless, this approach confines all perturbations to the image level and suffers from the excessive presence of naive samples, thus necessitating further improvement. In this paper, we introduce feature-level perturbation with varying intensities and forms to expand the augmentation space, establishing the image-feature weak-to-strong consistency paradigm. Furthermore, our paradigm develops a triple-branch structure, which facilitates interactions between both types of perturbations within one branch to boost their synergy. Additionally, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing additional challenges exclusively for naive samples. Notably, our paradigm can seamlessly integrate with existing SSL methods. We apply the proposed paradigm to several representative algorithms and conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate a significant enhancement in the performance of existing SSL algorithms." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.612, + 0.744, + 0.641 + ], + "angle": 0, + "content": "Keywords: Feature-Level Perturbation \\(\\cdot\\) Image-Feature Weak-to-Strong Consistency \\(\\cdot\\) Naive Sample Identification" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.669, + 0.377, + 0.685 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Semi-supervised learning (SSL) [4,30,32,46], a research topic that aims to reduce manual labeling costs by capitalizing on unlabeled data, has received considerable attention in recent years. Among the proposed methods, the image-level weak-to-strong consistency paradigm introduced by FixMatch [32] has proven highly effective in leveraging the potential of unlabeled data. Specifically, FixMatch applies varying intensities of image-level perturbations to raw samples and encourages consistent predictions between corresponding weakly and strongly augmented views. Subsequent studies have refined this paradigm primarily in two aspects: (1) improving the utilization ratio of unlabeled data by replacing" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.143, + 0.782, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image_footnote", + "bbox": [ + 0.223, + 0.265, + 0.758, + 0.308 + ], + "angle": 0, + "content": "\\(\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{x}}\\) : weak/strong image-level perturbation; \\(p^{\\tau_{w}} / p^{\\tau_{x}}\\) : predictions of samples subjected to \\(\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{z}}\\) . \\(\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{x}}\\) : weak/strong feature-level perturbation; \\(p^{\\tau_{w},T_{x}} / p^{\\tau_{x},T_{w}}\\) : predictions of samples that undergo \\(\\mathcal{A}^{T_{w}}\\) and \\(\\mathcal{A}^{T_{x}} / \\mathcal{A}^{T_{z}}\\) and \\(\\mathcal{A}^{T_{w}}\\) . \\(f^{in} / f^{out}\\) : input/output feature maps of feature-level perturbation; adaptive \\(\\mathcal{A}^{T_{w}}\\) : incorporating \\(\\mathcal{A}^{T_{x}}\\) solely for naive samples recognized by the confidence-based identification strategy; \\(\\tau ,\\tau_{t}\\) : threshold mechanisms; stopping gradients; : shared parameters; teacher branch; student branch;" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.322, + 0.788, + 0.364 + ], + "angle": 0, + "content": "Fig. 1: Overview of the old (left) and proposed (right) paradigms. Our paradigm introduces feature-level perturbation to expand the augmentation space and facilitates direct interactions between both types of perturbations to boost their synergy." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.398, + 0.789, + 0.474 + ], + "angle": 0, + "content": "the constant threshold in FixMatch with a dynamic threshold [35,42] and (2) facilitating balanced predictions across different classes via refining pseudo-labels based on historical predictions [3,5]. Extensive experiments have demonstrated the effectiveness of these methods in enhancing the image-level weak-to-strong consistency paradigm." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.476, + 0.789, + 0.612 + ], + "angle": 0, + "content": "Despite the success of the established paradigm, two challenges persist. Firstly, the existing paradigm confines all perturbations to the image level, thus impeding the exploration of a broader augmentation space and consistency at non-image levels. Secondly, as revealed in [12], a notable proportion of samples, even undergoing strong image-level perturbation, continues to be accurately classified with high confidence, resulting in a loss close to zero. These instances (some examples are shown in Fig. 5), referred to as naive samples, are well-learned and thus fail to boost the model's performance. Therefore, relying solely on image-level perturbation proves insufficient to fully exploit the potential of unlabeled data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.789, + 0.842 + ], + "angle": 0, + "content": "To address the aforementioned challenges, we introduce a novel SSL paradigm named Image-Feature Weak-to-Strong Consistency (IFMatch). An overview of the conventional and proposed approaches is shown in Fig. 1. The primary innovation of our method lies in feature-level perturbation, which is motivated by earlier findings that regularizers effective in the input space can be extended to hidden representations [14, 15, 34]. Specifically, feature-level perturbation randomly alters intermediate features in the backbone, establishing the basis for feature-level consistency regulation. Furthermore, to achieve effective feature-level perturbation, we present refined designs focusing on position and strategy. For the perturbation position, we identify two positions to induce weak and strong feature-level perturbations, respectively. Regarding the perturbation strategy, we develop a series of approaches from three perspectives ('movement', 'dropout', and 'value'), thereby comprehensively exploring the feature augmentation space. Note that the proposed feature-level perturbation is sample-agnostic and thus differs from previous class-based feature augmentation techniques [20, 36]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.147, + 0.786, + 0.524 + ], + "angle": 0, + "content": "Building upon well-crafted augmentation techniques, we introduce the integration of two types of perturbations as another innovation. Our preliminary investigation (Tab. 3) reveals that a direct fusion of strong image-level and feature-level augmentation engenders destructive perturbations. To mitigate this issue, we propose a triple-branch structure to combine these two perturbation forms in a milder manner, as depicted in Fig. 1. Specifically, the teacher branch, mirroring its counterpart in the existing paradigm, employs predictions from samples subjected to weak image-level perturbation as pseudo-labels. Moreover, the first student branch integrates weak image-level perturbation and strong feature-level perturbation to thoroughly explore the feature augmentation space. Given limited prior research on feature-level perturbation, we delve deeper into the optimal threshold for this branch, revealing a preference for a high constant threshold over a dynamic one. In the second student branch, we combine weak feature-level perturbation with strong image-level perturbation, posing additional challenges for recognizing naive samples. However, the fused perturbation proves excessively arduous for classifying hard samples. Accordingly, we devise a confidence-based identification strategy to dynamically distinguish between naive and challenging samples, thereby introducing weak feature-level perturbation exclusively for naive samples. As the second branch predominantly relies on image-level perturbation, it can seamlessly integrate with existing threshold mechanisms. Prior to our study, UniMatch [40] uses feature-level perturbation and a multi-branch structure in semi-supervised semantic segmentation. However, their method is limited to the channel-wise dropout strategy and fails to achieve interactions between the two types of perturbations within a single branch, setting it apart from our paradigm. In summary, our contributions can be outlined as follows." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.525, + 0.784, + 0.584 + ], + "angle": 0, + "content": "(1) We introduce the image-feature weak-to-strong consistency paradigm for semi-supervised learning, where the feature-level perturbation and the integration of two types of perturbation within each branch serve as the fundamental enhancement compared to previous methods." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.586, + 0.785, + 0.614 + ], + "angle": 0, + "content": "(2) We meticulously design the position and strategy of feature-level perturbation to diversify its intensity and form." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.616, + 0.785, + 0.66 + ], + "angle": 0, + "content": "(3) We devise a confidence-based identification strategy to discriminate between naive and challenging samples, thereby introducing extra challenges solely for naive samples in the second student branch." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.661, + 0.785, + 0.707 + ], + "angle": 0, + "content": "(4) We conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate significant promotion of existing algorithms when following our paradigm." + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.525, + 0.785, + 0.707 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.731, + 0.388, + 0.748 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Consistency regulation [2] represents a fundamental approach to leveraging the potential of unlabeled data. Its core objective is to ensure consistent predictions across diverse perturbed views of the same sample. Various perturbation methods have been explored, such as stochastic augmentation [22, 31], adversarial attack [25], and mixup [43]. Additionally, FixMatch [32] applies strong" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.128 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "data augmentation techniques [7] to raw images, establishing the image-level weak-to-strong consistency paradigm. This paradigm significantly streamlines the framework and marks a pivotal milestone in semi-supervised learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.785, + 0.358 + ], + "angle": 0, + "content": "Follow-up studies refine FixMatch along two dimensions: the utilization ratio of unlabeled data and fairness considerations. Regarding the former, numerous dynamic threshold strategies have been proposed. For example, FlexMatch [42] maps the predefined threshold to class-specific thresholds based on class-wise learning status. SoftMatch [5] models sample weights by a dynamic Gaussian function, maintaining a soft margin between unlabeled samples of different confidence levels. FreeMatch [35] utilizes the confidence on unlabeled data as the adaptive threshold. Moreover, the concept of fairness stems from entropy-based regulation [1,11,16,18,44]. The most representative strategy in this context, Distribution Alignment [3], encourages equal-frequency predictions across classes by refining pseudo-labels based on overall predictions within the unlabeled set." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.359, + 0.787, + 0.555 + ], + "angle": 0, + "content": "Concurrently, several studies express similar concerns to the old paradigm. FeatMatch [20] and ISDA [36] prevent the exclusive reliance on image-level perturbation by devising class-based feature augmentation approaches. In contrast, our proposed feature-level perturbation is sample-agnostic, circumventing harmful perturbations derived from erroneous pseudo-labels. Additionally, UniMatch [40] uses channel-wise dropout to establish an auxiliary branch for feature-level perturbation. In comparison, we present feature-level perturbations with varying intensities and forms, further combining them with image-level perturbations within each branch to boost their synergy. Besides, [12] observes excessive naive samples and applies more aggressive image-level augmentation to these samples. To address this issue, we propose a confidence-based identification strategy to effectively distinguish between naive and challenging samples and introduce weak feature-level perturbation exclusively for naive samples." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.576, + 0.381, + 0.594 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.607, + 0.603, + 0.623 + ], + "angle": 0, + "content": "3.1 Image-Level Weak-to-Strong Consistency" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.631, + 0.788, + 0.752 + ], + "angle": 0, + "content": "We begin by reviewing the image-level weak-to-strong consistency paradigm, as depicted in the left part of Fig. 1. Let \\(\\mathcal{D}_L = \\{(x_i,y_i)\\}_{i = 1}^{N_L}\\) and \\(\\mathcal{D}_U = \\{u_i\\}_{i = 1}^{N_U}\\) represent the labeled and unlabeled datasets, respectively. Here, \\(x_{i}\\) and \\(u_{i}\\) denote the labeled and unlabeled training samples, and \\(y_{i}\\) refers to the one-hot label for the labeled sample \\(x_{i}\\). We denote the prediction of sample \\(x\\) as \\(p(y|x)\\). Given a batch of labeled and unlabeled data, the model is optimized with the objective \\(\\mathcal{L} = \\mathcal{L}_s + \\lambda_u\\mathcal{L}_u\\). Specifically, \\(\\mathcal{L}_s\\) indicates the cross-entropy loss (\\(\\mathcal{H}\\)) for the labeled batch of size \\(B_{L}\\)." + }, + { + "type": "equation", + "bbox": [ + 0.407, + 0.761, + 0.786, + 0.801 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {s} = \\frac {1}{B _ {L}} \\sum_ {i = 1} ^ {B _ {L}} \\mathcal {H} \\left(y _ {i}, p \\left(y \\mid x _ {i}\\right)\\right) \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "On the other hand, \\(\\mathcal{L}_u\\) signifies the image-level consistency regulation between the prediction of the strongly augmented view \\(\\mathcal{A}^{\\mathcal{T}_s}(u)\\) and the pseudo-label" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.317, + 0.148, + 0.681, + 0.242 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.25, + 0.788, + 0.32 + ], + "angle": 0, + "content": "Fig. 2: Candidate positions for introducing feature-level perturbation. Position A perturbs the output of the residual block, representing strong feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_s}\\). Position B perturbs the output of a random convolution within the residual component, corresponding to weak feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_w}\\). \\(x^{in} / x^{out}\\) denotes input/output feature maps of the residual block." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.349, + 0.788, + 0.41 + ], + "angle": 0, + "content": "sourced from the corresponding weakly augmented view \\(\\mathcal{A}^{\\mathcal{I}_w}(u)\\). To mitigate incorrect pseudo-labels, FixMatch [32] introduces a constant threshold, and subsequent studies propose various dynamic threshold strategies. Without loss of generality, we denote the threshold as \\(\\tau_t\\) and define \\(\\mathcal{L}_u\\) as follows." + }, + { + "type": "equation", + "bbox": [ + 0.346, + 0.42, + 0.786, + 0.462 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {u} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau_ {t}\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {s}}\\right) \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.473, + 0.788, + 0.537 + ], + "angle": 0, + "content": "Here, \\( p_i^{\\mathcal{I}_w} \\) is the abbreviation of \\( DA(p(y|\\mathcal{A}^{\\mathcal{I}_w}(u_i))) \\), where \\( DA \\) indicates the distribution alignment strategy [3]. \\( \\hat{p}_i^{\\mathcal{T}_w} \\) denotes the one-hot pseudo-label obtained from \\( \\text{argmax}(p_i^{\\mathcal{I}_w}) \\). Moreover, \\( p_i^{\\mathcal{I}_s} \\) stands for \\( p(y|\\mathcal{A}^{\\mathcal{I}_s}(u_i)) \\). Lastly, \\( B_U \\) corresponds to the batch size of unlabeled data." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.559, + 0.487, + 0.573 + ], + "angle": 0, + "content": "3.2 Feature-Level Perturbation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.787, + 0.645 + ], + "angle": 0, + "content": "To avoid the exclusive reliance on image-level perturbation, this paper introduces feature-level perturbation varied in intensity and form, thereby expanding the augmentation space. In the following parts, we will elaborate on the implementation of feature-level perturbation regarding its position and strategy." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.646, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Position refers to where the feature-level perturbation is introduced. Given that WideResNet [41] is the prevailing backbone in SSL, we employ its basic component, the residual block [13] with pre-activation, as an illustrative example. Building upon previous studies that exploit feature-level regularizers directly after the convolution [14, 15, 34], we identify two positions for introducing feature-level perturbation, as depicted in Fig. 2. In position A, the method perturbs the summation of the residual and identity connections, i.e., the output of the residual block. As position A acts as the bottleneck for feedforward, perturbation at position A exhibits high intensity and is therefore regarded as strong feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_s}\\). Additionally, position B perturbs the output of a random convolution within the residual component, which is relatively milder than position A. Therefore, perturbation at position B is considered as weak feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_w}\\). It is worth noting that both" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.128 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "position choices are applicable to all residual blocks, and the algorithm randomly selects one position at each iteration to insert feature-level perturbation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.42 + ], + "angle": 0, + "content": "Strategy denotes the operation of feature-level perturbation. We first review strong image-level perturbation strategies \\(\\mathcal{A}^{\\mathcal{I}_s}\\) [7], which can be roughly divided into three groups: 'movement', 'dropout', and 'value'. Specifically, 'movement' comprises spatial perturbations like translation and shearing, 'dropout' corresponds to the Cutout technique [9], and 'value' represents operations that modify pixel values while preserving pixel relationships, such as adjusting contrast, brightness, and histogram. Considering the effectiveness of \\(\\mathcal{A}^{\\mathcal{I}_s}\\), we develop feature-level perturbation strategies from the same perspectives. For 'movement', we implement feature map translation and shearing along the X-axis and Y-axis. Regarding 'dropout', we apply channel-wise and spatial-wise dropout on hidden representations. Concerning 'value', we employ random-sized convolutions to achieve local smoothing, subsequently using the weighted sum of smoothed and input feature maps as the output. During training, the model randomly selects one candidate strategy at each iteration to perturb hidden representations at the selected position. For the detailed implementation of feature-level perturbation strategies, please refer to Appendix Sec.1." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.438, + 0.62, + 0.453 + ], + "angle": 0, + "content": "3.3 Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.458, + 0.788, + 0.578 + ], + "angle": 0, + "content": "Building upon well-designed image-level and feature-level perturbations, we can integrate them to achieve consistency regulation in both dimensions. Intuitively, a trivial approach is combining strong image-level and feature-level perturbations in one branch to construct a dual-branch structure similar to the old paradigm. However, such a toy paradigm engenders destructive perturbations according to our pilot study (Tab. 3). Accordingly, we integrate these two forms of perturbations in a more moderate manner, developing the image-feature weak-to-strong consistency paradigm (IFMatch) depicted in the right part of Fig. 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.579, + 0.788, + 0.684 + ], + "angle": 0, + "content": "Our paradigm retains the traditional teacher branch, utilizing predictions \\(\\hat{p}^{\\mathcal{T}_w}\\) of samples subjected to weak image-level perturbation as pseudo-labels. Furthermore, we introduce two student branches to integrate both types of perturbations. Mathematically, given a batch of labeled and unlabeled data, the model is optimized using the objective \\(\\mathcal{L} = \\mathcal{L}_s + \\lambda_u(\\mathcal{L}_{u_1} + \\mathcal{L}_{u_2})\\), where \\(\\mathcal{L}_s\\) denotes the cross-entropy loss for labeled data, and \\(\\mathcal{L}_{u_1}\\) and \\(\\mathcal{L}_{u_2}\\) represent the consistency regulation for unlabeled data in the two student branches respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.685, + 0.788, + 0.79 + ], + "angle": 0, + "content": "In the first student branch, we integrate weak image-level perturbation \\(\\mathcal{A}^{\\mathcal{T}_w}\\) and strong feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_s}\\) to comprehensively explore the feature perturbation space. Furthermore, we employ the constant threshold \\(\\tau\\) adopted in FixMatch to filter out incorrect pseudo-labels. This choice arises from the observation that existing dynamic threshold mechanisms are less suitable for \\(\\mathcal{A}^{\\mathcal{F}_s}\\), especially in challenging tasks. Thus, the unsupervised loss \\(\\mathcal{L}_{u_1}\\) in the first student branch can be expressed as follows." + }, + { + "type": "equation", + "bbox": [ + 0.338, + 0.798, + 0.787, + 0.838 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {u _ {1}} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {w}, \\mathcal {F} _ {s}}\\right) \\tag {3}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "code_caption", + "bbox": [ + 0.228, + 0.151, + 0.733, + 0.167 + ], + "angle": 0, + "content": "Algorithm 1: Image-Feature Weak-to-Strong Consistency (IFMatch)" + }, + { + "type": "algorithm", + "bbox": [ + 0.226, + 0.17, + 0.765, + 0.433 + ], + "angle": 0, + "content": "Input: labeled data \\(\\mathcal{D}_L = \\{(x_i,y_i)\\}_{i = 1}^{N_L}\\) , unlabeled data \\(\\mathcal{D}_U = \\{u_i\\}_{i = 1}^{N_U}\\) , batch sizes \\(B_{L}\\) and \\(B_{U}\\) , loss weight \\(\\lambda_{u}\\) , total iterations \\(T\\) , perturbations \\(\\{\\mathcal{A}^{\\mathcal{I}_w},\\mathcal{A}^{\\mathcal{I}_s},\\mathcal{A}^{\\mathcal{F}_w},\\mathcal{A}^{\\mathcal{F}_s}\\}\\) , constant threshold \\(\\tau\\) , threshold mechanism \\(\\tau_{t}\\) , target confidence \\(\\{h_1,h_2,\\dots ,h_{N_U}\\}\\) , mask \\(\\{\\mathcal{M}_1,\\mathcal{M}_2,\\dots ,\\mathcal{M}_{N_U}\\}\\) \n1 for \\(t\\gets 1\\) to \\(T\\) do // the same parts as the old paradigm \n2 Compute supervised loss \\(\\mathcal{L}_s\\) , pseudo-labels \\(p^{\\mathcal{I}_w}\\) and \\(\\hat{p}^{\\mathcal{I}_w}\\) , and threshold \\(\\tau_t\\) . // the first student branch \n3 Compute predictions \\(p^{\\mathcal{I}_w,\\mathcal{F}_s}\\) and loss \\(\\mathcal{L}_{u_1}\\) using Eq. (3); // the second student branch \n4 Decide whether to introduce \\(\\mathcal{A}^{\\mathcal{F}_w}\\) for \\(u_{i}\\) in the second student branch according to the mask \\(\\mathcal{M}_i\\) using Eq. (6) and Eq. (7); \n5 Compute predictions \\(p^{\\mathcal{I}_s,\\mathcal{F}_w}\\) and loss \\(\\mathcal{L}_{u_2}\\) using Eq. (4); // update model \n6 Back-propagate loss \\(\\mathcal{L} = \\mathcal{L}_s + \\lambda_u(\\mathcal{L}_{u_1} + \\mathcal{L}_{u_2})\\) and update parameters ; // Confidence-based identification strategy \n7 Record target confidence \\(h_i = p_{i,j}^{\\mathcal{I}_s,\\mathcal{F}_w}(j = \\hat{p}_i^{\\mathcal{I}_w})\\) and mask \\(\\mathcal{M}_i = \\mathbb{1}(h_i\\geq \\tau_t)\\) \n8 end" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.464, + 0.65, + 0.482 + ], + "angle": 0, + "content": "Here, \\(p_i^{\\mathcal{I}_w,\\mathcal{F}_s}\\) denotes the prediction of \\(u_{i}\\) in the first branch." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.482, + 0.789, + 0.633 + ], + "angle": 0, + "content": "In the second student branch, we combine strong image-level perturbation \\(\\mathcal{A}^{\\mathcal{I}_s}\\) and weak feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_w}\\) to provide additional challenges in recognizing naive samples. However, a direct fusion of \\(\\mathcal{A}^{\\mathcal{I}_s}\\) and \\(\\mathcal{A}^{\\mathcal{F}_w}\\) poses obstacles in classifying hard samples. Accordingly, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing extra challenges exclusively for naive samples, which will be detailed in Sec. 3.4. Moreover, given the central role of \\(\\mathcal{A}^{\\mathcal{I}_s}\\), we leverage existing threshold mechanisms \\(\\tau_t\\) to exclude misleading pseudo-labels, facilitating seamless integration with previous algorithms. Consequently, the unsupervised loss \\(\\mathcal{L}_{u_2}\\) in the second branch can be defined as follows." + }, + { + "type": "equation", + "bbox": [ + 0.331, + 0.638, + 0.786, + 0.679 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {u _ {2}} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau_ {t}\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {s}, \\mathcal {F} _ {w}}\\right) \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.688, + 0.789, + 0.841 + ], + "angle": 0, + "content": "where \\( p_i^{\\mathcal{I}_s, \\mathcal{F}_w} \\) represents the prediction of sample \\( u_i \\) in the second branch. Particularly, the use of distinct thresholds in the two student branches is motivated not only by experiments (Tab. 5) but also by an inherent rationale. Specifically, the threshold serves to balance the utilization ratio of unlabeled data and pseudolabel accuracy [5, 35]. Furthermore, \\( \\mathcal{A}^{\\mathcal{F}_s} \\) and \\( \\mathcal{A}^{\\mathcal{I}_s} \\) act as the central driving forces behind the respective student branch. Due to the unique characteristics of \\( \\mathcal{A}^{\\mathcal{F}_s} \\) and \\( \\mathcal{A}^{\\mathcal{I}_s} \\), they exhibit varying preferences in the trade-off between the utilization and pseudo-label accuracy, resulting in the different desired threshold mechanisms in the two student branches. For a further understanding of our paradigm, please refer to Algorithm 1." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "image", + "bbox": [ + 0.317, + 0.144, + 0.691, + 0.24 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.249, + 0.788, + 0.306 + ], + "angle": 0, + "content": "Fig. 3: Overview of the confidence-based identification strategy. The approach records sample-wise target confidence in the second student branch and identifies naive samples by comparing the confidence with the threshold in the second student branch. \\( w/ \\) and \\( w/o \\) abbreviates with and without, respectively." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.334, + 0.525, + 0.349 + ], + "angle": 0, + "content": "3.4 Confidence-Based Identification" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.359, + 0.789, + 0.555 + ], + "angle": 0, + "content": "As analyzed in Sec. 3.3, the combination of strong image-level perturbation \\(\\mathcal{A}^{\\mathcal{I}_s}\\) and weak feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_w}\\) poses supplementary challenges for naive samples yet incurs exceeding difficulty for hard ones. Likewise, previous research has encountered similar challenges in expanding the augmentation space. For example, UniMatch [40] observes a performance degradation caused by the concatenation of channel-wise dropout and \\(\\mathcal{A}^{\\mathcal{I}_s}\\) and finally denies the feasibility of combining \\(\\mathcal{A}^{\\mathcal{I}}\\) and \\(\\mathcal{A}^{\\mathcal{F}}\\) within one branch. Besides, [12] imposes more aggressive image-level perturbations exclusively on naive samples. To distinguish between naive and challenging samples, their approach records sample-wise loss and utilizes the OTSU [28] method for distinction. However, OTSU is conventionally applied to the segmentation of bimodal gray-scale images, whereas the histogram of loss values typically exhibits a descending trend. As shown in Fig. 4, their approach tends to produce identification biased toward naive samples." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.556, + 0.79, + 0.707 + ], + "angle": 0, + "content": "To effectively identify the naive samples, we propose a confidence-based identification strategy, which is depicted in Fig. 3. Similar to the threshold-based rule for pseudo-label filtering that only predictions exceeding the confidence threshold qualify as pseudo-labels, the proposed strategy can be succinctly concluded as: 'only strongly augmented samples \\(\\mathcal{A}^{\\mathcal{I}_s}(u)\\) with target confidence exceeding the threshold are considered naive and necessitate additional weak feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}_w}\\). Specifically, the approach comprises two steps. Firstly, we record the confidence linked to the pseudo-label within the predicted distribution of the second branch. Mathematically, the target confidence \\(h_i\\) for sample \\(u_i\\) in the second student branch can be obtained as follows." + }, + { + "type": "equation", + "bbox": [ + 0.421, + 0.715, + 0.787, + 0.737 + ], + "angle": 0, + "content": "\\[\nh _ {i} = p _ {i, j} ^ {\\mathcal {I} _ {s}, \\mathcal {F} _ {w}} (j = \\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}) \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.748, + 0.789, + 0.841 + ], + "angle": 0, + "content": "It is important to clarify that \\( p_i^{\\mathcal{I}_s, \\mathcal{F}_w} \\) solely represents the prediction of sample \\( u_i \\) in the second branch and has nothing to do with the introduction of \\( \\mathcal{A}^{\\mathcal{F}_w} \\) for \\( u_i \\). Secondly, the algorithm generates a binary mask for each sample to determine whether to introduce additional \\( \\mathcal{A}^{\\mathcal{F}_w} \\) by comparing the target confidence with the threshold \\( \\tau_t \\) in the second student branch. Consequently, the mask for sample \\( u_i \\), denoted as \\( \\mathcal{M}_i \\), and the perturbations applied to \\( u_i \\) in the second student" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.256 + ], + "angle": 0, + "content": "Table 1: Accuracy \\((\\%)\\) on four benchmarks with varying numbers of labels. Bold indicates the best performance, and underline denotes the second best. We omit the standard deviation of performance, as the proposed paradigm performs stable across different random seeds. IFMatch \\((^{*})\\) represents the proposed paradigm using the threshold mechanism of \\(^*\\) in the second student branch. In Particular, given that SoftMatch proposes a sample weight strategy rather than a threshold scheme, IFMatch (Soft) inherits its weight scheme when computing \\(\\mathcal{L}_{u_2}\\) and replaces the \\(\\tau_{t}\\) in Eq. (6) with the mean value of the dynamic Gaussian in SoftMatch when identifying naive samples." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.269, + 0.787, + 0.489 + ], + "angle": 0, + "content": "
DatasetsCIFAR-10CIFAR-100SVHNSTL-10ImageNet
# Label402504000400250010000401000401000100k400k
VAT [25]25.3458.9789.4914.8053.1667.8625.2595.8925.2662.05--
MeanTeacher [33]29.9162.5491.9018.8954.8368.2563.9196.7328.2866.10--
MixMatch [4]63.8186.3793.3432.4160.2472.2269.4096.3145.0778.30--
ReMixMatch [3]90.1293.7095.1657.2573.9779.9875.9694.8467.8893.26--
UDA [38]89.3894.8495.7153.6172.2777.5194.8898.1162.5893.36--
Dash [39]91.0794.8495.6455.1872.8578.1297.8198.0365.4893.61--
MPL [29]93.3894.2495.4553.7472.2978.2690.6797.7264.2493.34--
FixMatch [32]92.5395.1495.7953.5871.9777.8096.1998.0464.0393.7556.3467.72
IFMatch (Fix)95.8295.9796.4966.2674.6580.0197.7598.1578.5495.2861.2671.48
FlexMatch [42]95.0395.0295.8160.0673.5178.1091.8193.2870.8594.2358.1568.69
IFMatch (Flex)95.9095.9996.4266.2875.0379.8797.7698.0479.8395.2461.7571.14
SoftMatch [5]95.0995.1895.9662.9073.3477.9797.6797.9978.5894.2759.4370.51
IFMatch (Soft)95.8495.9396.3667.0274.9979.9698.0498.2282.4695.2262.4471.66
FreeMatch [35]95.1095.1295.9062.0273.5378.3298.0398.0484.4494.3758.4869.48
IFMatch (Free)95.8396.0296.4466.6575.1680.0898.0898.1884.7595.2961.6971.30
" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.503, + 0.473, + 0.518 + ], + "angle": 0, + "content": "branch can be expressed as follows." + }, + { + "type": "equation", + "bbox": [ + 0.451, + 0.529, + 0.785, + 0.544 + ], + "angle": 0, + "content": "\\[\n\\mathcal {M} _ {i} = \\mathbb {1} \\left(h _ {i} \\geq \\tau_ {t}\\right) \\tag {6}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.332, + 0.548, + 0.785, + 0.589 + ], + "angle": 0, + "content": "\\[\n\\text {P e r t u r b a t i o n s f o r} u _ {i} = \\left\\{ \\begin{array}{l l} \\left\\{\\mathcal {A} ^ {\\mathcal {I} _ {s}}, \\mathcal {A} ^ {\\mathcal {F} _ {w}} \\right\\} & \\mathcal {M} _ {i} = 1 \\\\ \\left\\{\\mathcal {A} ^ {\\mathcal {I} _ {s}} \\right\\} & \\mathcal {M} _ {i} = 0 \\end{array} \\right. \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.788, + 0.643 + ], + "angle": 0, + "content": "The approach dynamically updates \\(\\mathcal{M}_i\\) throughout the training process, thereby considering both the learning status of individual samples and model performance when introducing \\(\\mathcal{A}^{\\mathcal{F}_w}\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.665, + 0.377, + 0.683 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.695, + 0.56, + 0.712 + ], + "angle": 0, + "content": "4.1 Balanced Semi-Supervised Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Settings. We conduct experiments on multiple benchmarks, including CIFAR-10/100 [19], SVHN [26], STL-10 [6], and ImageNet [8], with various numbers of labeled samples. In the context of balanced SSL, we maintain a balanced distribution for labeled samples. The choice of backbone architecture adheres to established practices, employing specific models for different datasets: WRN-28-2 [41] for CIFAR-10 and SVHN, WRN-28-8 for CIFAR-100, WRN-37-2 [45] for STL-10, and ResNet-50 [13] for ImageNet. As for training parameters, we follow the unified codebase TorchSSL [42] to ensure fair comparisons. Specifically, batch" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "sizes \\( B_{L} \\) and \\( B_{U} \\) are set to 128 and 128 on ImageNet and 64 and 448 on the remaining datasets. Moreover, the model is trained using the SGD optimizer with an initial learning rate of 0.03 and a momentum decay of 0.9. The learning rate is adjusted by a cosine decay scheduler over a total of \\( 2^{20} \\) steps. Besides, we train the EMA model with a momentum decay of 0.999 for inference. The fixed threshold \\( \\tau \\) in the first branch is set to 0.95. For SVHN, we follow previous studies [35, 39] and constrain the dynamic threshold within the range of [0.9, 1.0]. To suppress randomness, we repeat each experiment three times and report the average accuracy in Tab. 1. We omit the standard deviation given the stable performance of the proposed paradigm across different random seeds." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.789, + 0.632 + ], + "angle": 0, + "content": "Performance. We apply the proposed paradigm (IFMatch) to several algorithms and compare their performance with existing methods on multiple benchmarks. The results presented in Tab. 1 underscore the significant contribution of our paradigm to promoting the performance of existing SSL algorithms. Specifically, the four algorithms involved achieve the average improvement of \\(4.05\\%\\), \\(3.22\\%\\), \\(1.62\\%\\), and \\(1.39\\%\\) across all datasets. Moreover, previous methods struggle to enhance performance on less challenging tasks, such as CIFAR-10. In contrast, when integrated with the proposed paradigm, IFMatch (Fix) outperforms FixMatch by \\(2.29\\% / 0.83\\% / 0.70\\%\\) on CIFAR-10 with \\(40 / 250 / 4000\\) labeled samples, respectively. Furthermore, our approach effectively addresses the challenges posed by extremely limited labeled samples, with IFMatch (Fix) achieving enhancements of \\(14.51\\%\\) and \\(12.68\\%\\) on STL-10 with 40 labels and CIFAR-100 with 400 labels, respectively, compared to FixMatch. Moreover, the four algorithms achieve an average promotion of \\(3.69\\% / 2.30\\%\\) on ImageNet with \\(100k / 400k\\) labels when following the proposed paradigm, indicating its effectiveness on large-scale datasets. Additionally, when employing our paradigm, the performance gap between dynamic and constant thresholds considerably narrows on challenging tasks, while IFMatch (Fix) even emerges as the preferred method on some less demanding tasks. The shifted performance gap implies a reduced reliance on complex threshold strategies of our paradigm, which primarily benefits from the expanded augmentation space. In summary, the impressive performance observed in Tab. 1 confirms the effectiveness of the proposed paradigm." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.657, + 0.579, + 0.673 + ], + "angle": 0, + "content": "4.2 Imbalanced Semi-Supervised Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.686, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Settings. We evaluate the proposed paradigm in the context of imbalanced SSL, where both labeled and unlabeled data exhibit a long-tailed distribution. Consistent with prior studies [5,10,21,23,27,37], we construct labeled and unlabeled sets using the configurations of \\( N_{c} = N_{1} \\cdot \\gamma^{-\\frac{c - 1}{C - 1}} \\) and \\( M_{c} = M_{1} \\cdot \\gamma^{-\\frac{c - 1}{C - 1}} \\). Specifically, for CIFAR-10-LT, we set \\( N_{1} \\) to 1500, \\( M_{1} \\) to 3000, and \\( \\gamma \\) to range from 50 to 150. Moreover, for CIFAR-100-LT, we set \\( N_{1} \\) to 150, \\( M_{1} \\) to 300, and \\( \\gamma \\) to span from 20 to 100. In all experiments, we employ WRN-28-2 as the backbone and utilize the Adam optimizer [17] with a weight decay of 4e-5. Besides, batch sizes \\( B_{L} \\) and \\( B_{U} \\) are fixed as 64 and 128 respectively. Additionally, the learning rate is initially set to 2e-3 and adjusted by a cosine decay scheduler during" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.237, + 0.144, + 0.764, + 0.16 + ], + "angle": 0, + "content": "Table 2: Performance (%) on CIFAR-10/100-LT with varying imbalance ratio." + }, + { + "type": "table", + "bbox": [ + 0.242, + 0.172, + 0.759, + 0.317 + ], + "angle": 0, + "content": "
DatasetCIFAR-10-LTCIFAR-100-LT
γ501001502050100
FixMatch [32]81.54±0.3074.89±1.2070.38±0.8849.58±0.7842.11±0.3337.60±0.48
IFMatch (Fix)85.32±0.3379.46±0.3575.59±0.4853.61±0.2544.58±0.3839.92±0.37
FlexMatch [42]81.87±0.1974.49±0.9270.20±0.3650.89±0.6042.80±0.3937.30±0.47
IFMatch (Flex)84.36±0.1279.04±0.4273.02±0.4751.83±0.3343.49±0.3537.98±0.36
SoftMatch [5]83.45±0.2977.07±0.3772.60±0.4651.91±0.5543.76±0.5138.92±0.81
IFMatch (Soft)85.56±0.1580.28±0.2476.18±0.3453.97±0.3244.98±0.4139.68±0.41
FreeMatch [35]83.30±0.3375.96±0.4971.20±0.6451.60±0.9142.95±0.4837.50±0.23
IFMatch (Free)84.88±0.2080.12±0.2974.85±0.4752.77±0.4643.68±0.4538.00±0.55
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.337, + 0.784, + 0.381 + ], + "angle": 0, + "content": "training. We set the fixed threshold \\(\\tau\\) in the first branch to 0.95. To account for randomness, we report the mean and standard deviation of the performance across three different random seeds." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.383, + 0.788, + 0.595 + ], + "angle": 0, + "content": "Performance. We apply the proposed paradigm to numerous algorithms and compare the performance with their counterparts following the old paradigm. The results in Tab. 2 demonstrate that our paradigm substantially improves existing models, enabling them to achieve state-of-the-art performance. Specifically, when integrated with the enhanced paradigm, the four algorithms achieve the average promotion of \\(3.72\\%\\), \\(2.03\\%\\), \\(2.16\\%\\), and \\(1.92\\%\\) across all benchmarks. Notably, IFMatch (Fix) outperforms FixMatch by \\(5.21\\%\\) and \\(2.32\\%\\) on CIFAR-10-LT (\\(\\gamma = 150\\)) and CIFAR-100-LT (\\(\\gamma = 100\\)), highlighting the robustness of the proposed paradigm when facing severe imbalance. Moreover, the performance gap between dynamic-threshold-based methods and FixMatch substantially narrows within our paradigm. Accordingly, the proposed approach promotes the utilization of unlabeled data, reducing reliance on complex threshold mechanisms. Overall, the impressive performance observed in imbalanced SSL suggests the potential of our approach to be deployed in real-world applications." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.618, + 0.434, + 0.634 + ], + "angle": 0, + "content": "4.3 Component Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.643, + 0.784, + 0.719 + ], + "angle": 0, + "content": "This section presents the contribution of each component within the proposed paradigm. Unless otherwise stated, we conduct experiments on IFMatch (Fix). Additionally, we provide running speed analysis, feature visualization results [24], and performance on semi-supervised semantic segmentation in the Appendix. The subsequent analysis presents the revealed findings." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The proposed approach to integrating image-level and feature-level perturbations yields optimal performance. As the simplest idea, we can integrate \\(\\mathcal{A}^{\\mathcal{F}_s}\\) and \\(\\mathcal{A}^{\\mathcal{I}_s}\\) within one branch to establish a dual-branch structure similar to the old paradigm. Nonetheless, such a toy design engenders disruptive perturbations that exceed acceptable augmentation levels for consistency regulation, resulting in the performance degradation presented in lines 1-2 of Tab. 3. An alternative approach, proposed by UniMatch [40], combines \\(\\mathcal{A}^{\\mathcal{F}}\\) and \\(\\mathcal{A}^{\\mathcal{I}}\\) in separate branches, each employing a distinct type of perturbation (line 3)." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 3: Experiments (\\%) on the strategies for integrating image-level and feature-level perturbations. CBI abbreviates the confidence-based identification strategy. CIFAR-\\(m-n\\) denotes CIFAR-\\(m\\) with \\(n\\) labeled samples. Line 3 combines the structure setting of UniMatch [40] and our proposed feature-level perturbation techniques." + }, + { + "type": "table", + "bbox": [ + 0.306, + 0.213, + 0.695, + 0.304 + ], + "angle": 0, + "content": "
Branch IBranch IICIFAR-10-40CIFAR-100-400
FixMatch (baseline, no \\(\\mathcal{A}^{\\mathcal{F}}\\))92.5353.58
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_s}\\) in one branch88.2651.47
\\(\\mathcal{A}^{\\mathcal{F}_s}\\)\\(\\mathcal{A}^{\\mathcal{I}_s}\\)95.5364.54
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}\\)\\(\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s}\\)95.4763.56
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}\\)\\(\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s} + \\text{CBI}\\)95.8266.26
" + }, + { + "type": "table_caption", + "bbox": [ + 0.246, + 0.316, + 0.756, + 0.332 + ], + "angle": 0, + "content": "Table 4: Ablation study (%) for the strategies of feature-level perturbation." + }, + { + "type": "table", + "bbox": [ + 0.329, + 0.343, + 0.673, + 0.432 + ], + "angle": 0, + "content": "
A^F StrategyCIFAR-10-40CIFAR-100-400
All strategies95.8266.26
w/o channel-wise dropout95.66 (↓0.16)65.68 (↓0.58)
w/o spatial-wise dropout95.57 (↓0.25)65.77 (↓0.49)
w/o translation95.59 (↓0.23)65.70 (↓0.56)
w/o shearing95.58 (↓0.24)65.81 (↓0.47)
w/o value modification95.62 (↓0.20)65.75 (↓0.51)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.462, + 0.788, + 0.657 + ], + "angle": 0, + "content": "Despite its effectiveness, this method fails to boost interactions between the two types of perturbations. Accordingly, we attempt to achieve the co-occurrence of \\(\\mathcal{A}^{\\mathcal{F}}\\) and \\(\\mathcal{A}^{\\mathcal{I}}\\) within one branch, thereby constructing a more comprehensive augmentation space. The proposed paradigm adopts a milder combination strategy, specifically using \\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}\\) and \\(\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s}\\) in the two student branches respectively. However, as shown in line 4 of Tab. 3, the introduction of \\(\\mathcal{A}^{\\mathcal{F}_w}\\) leads to a performance drop compared to UniMatch, probably due to the derived difficulties in recognizing hard samples. To address this issue, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Finally, the proposed paradigm (IFMatch), as presented in line 5, achieves the optimal performance among all candidate designs for integrating \\(\\mathcal{A}^{\\mathcal{F}}\\) and \\(\\mathcal{A}^{\\mathcal{I}}\\), demonstrating its effectiveness and advantages." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.779 + ], + "angle": 0, + "content": "All feature-level perturbation strategies contribute to the overall performance. As shown in Tab. 4, we conduct an ablation study on feature-level perturbation strategies. The baseline model in line 1 integrates all proposed strategies and achieves state-of-the-art performance. In subsequent configurations (line 2-6), we sequentially remove each strategy. Compared to the baseline, the absence of any proposed perturbation technique leads to a decline in performance on both datasets. Therefore, the proposed perturbation strategies exhibit a synergistic effect, collaboratively exploring the feature perturbation space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}}\\) favors a high constant threshold over a dynamic one. As detailed in Sec. 3.3, \\(\\mathcal{A}^{\\mathcal{F}}\\) and \\(\\mathcal{A}^{\\mathcal{I}}\\) may require different threshold mechanisms due to their distinct characteristics. Considering the central role of \\(\\mathcal{A}^{\\mathcal{F}}\\) (\\(\\mathcal{A}^{\\mathcal{F}_s}\\)) in the first student branch, we further delve into the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.261, + 0.145, + 0.741, + 0.159 + ], + "angle": 0, + "content": "Table 5: Exploration (%) for the threshold strategy in the first branch." + }, + { + "type": "table", + "bbox": [ + 0.337, + 0.171, + 0.664, + 0.272 + ], + "angle": 0, + "content": "
Branch IBranch IICIFAR-10-40CIFAR-100-400
FlexMatchFlexMatch95.2863.38
τ = 0.95FlexMatch95.9066.28
SoftMatchSoftMatch95.3963.80
τ = 0.95SoftMatch95.8467.02
FreeMatchFreeMatch95.5664.45
τ = 0.95FreeMatch95.8366.65
" + }, + { + "type": "table_caption", + "bbox": [ + 0.23, + 0.285, + 0.771, + 0.3 + ], + "angle": 0, + "content": "Table 6: Comparison (%) between SAA [12] and confidence-based identification." + }, + { + "type": "table", + "bbox": [ + 0.312, + 0.311, + 0.688, + 0.359 + ], + "angle": 0, + "content": "
Identification StrategyCIFAR-10-40CIFAR-100-400
SAA [12]95.5465.32
Confidence-Based Identification95.8266.26
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.387, + 0.788, + 0.553 + ], + "angle": 0, + "content": "threshold strategy best suited for it. In general, existing threshold mechanisms can be categorized into constant thresholds and dynamic thresholds. The former prioritizes high pseudo-label accuracy at the expense of diminished utilization of unlabeled data, while the latter performs conversely. Accordingly, we determine the optimal threshold for the first branch from two candidates: a dynamic threshold mirroring the one used in the second branch and the constant threshold used in FixMatch. Combining Tab. 5 and Tab. 1, the proposed paradigm consistently outperforms the old paradigm regardless of the threshold adopted in the first branch. Additionally, the constant threshold beats all dynamic threshold mechanisms, suggesting that feature-level perturbation \\(\\mathcal{A}^{\\mathcal{F}}\\) is better suited to a constant threshold of 0.95, rather than existing dynamic threshold mechanisms." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.554, + 0.789, + 0.842 + ], + "angle": 0, + "content": "IFMatch outperforms previous methods from the perspective of the naive sample ratio. Firstly, as shown in the left part of Fig. 4, our approach (orange) achieves a lower naive sample ratio than UniMatch (green). This suggests more effective utilization of unlabeled data in our paradigm, primarily benefiting from combining both types of perturbation within each branch. Secondly, we compare the confidence-based identification strategy and SAA [12] within our paradigm to discern a better naive sample identification method. Specifically, SAA utilizes loss values as the criteria, recording historical loss for each sample and performing naive-challenging division by OTSU [28]. As shown in Tab. 6, the proposed module consistently outperforms SAA. Additionally, the naive sample ratio presented in the left part of Fig. 4 indicates that SAA (blue) tends to produce identification biased toward naive samples (e.g. starting with a ratio of 0.5 in the first iteration). Furthermore, we analyze the identification process of both strategies in the later training stages, as shown in the right part of Fig. 4. Notably, when employing the cross-entropy loss, the loss threshold of 1.79 in SAA corresponds to a confidence threshold of 0.17 (computed as \\( e^{-1.79} \\)), which is a detrimental configuration. The limitations of SAA can be ascribed to the ill-suited nature of the OTSU technique for segmenting a histogram with a monotonically decreasing trend. In contrast, our strategy remains effective in" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "image", + "bbox": [ + 0.292, + 0.149, + 0.71, + 0.245 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.257, + 0.785, + 0.285 + ], + "angle": 0, + "content": "Fig. 4: Visualization for naive sample ratio and the identification process of SAA [12] and confidence-based identification on CIFAR-100-400." + }, + { + "type": "image", + "bbox": [ + 0.286, + 0.298, + 0.7, + 0.393 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.403, + 0.788, + 0.446 + ], + "angle": 0, + "content": "Fig. 5: Visualization of perturbations. We provide the feature map for samples that undergo feature-level augmentation. A naive sample \\( u \\) exhibits the characteristic of \\( \\forall \\mathcal{A}^{\\mathcal{I}_s}(u), \\mathcal{H}(\\hat{p}_i^{\\mathcal{I}_w}, p_i^{\\mathcal{I}_s}) \\approx 0 \\), thus contributing trivially to the model's performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.472, + 0.785, + 0.503 + ], + "angle": 0, + "content": "distinguishing between naive and challenging samples even if the unlabeled set is predominantly composed of naive samples." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.504, + 0.788, + 0.61 + ], + "angle": 0, + "content": "Visualization analysis. We present the visualization for image-level and feature-level perturbations in Fig. 5, where the four parts (from left to right) correspond to the raw images, the images subjected to \\(\\mathcal{A}^{\\mathcal{I}_s}\\), and the feature maps that undergo \\(\\mathcal{A}^{\\mathcal{F}_w} \\circ \\mathcal{A}^{\\mathcal{I}_s}\\) and \\(\\mathcal{A}^{\\mathcal{F}_s} \\circ \\mathcal{A}^{\\mathcal{I}_w}\\). We can observe that the exclusive reliance on \\(\\mathcal{A}^{\\mathcal{I}_s}\\) engenders easy-to-recognize (naive) samples. In contrast, the proposed paradigm effectively combines \\(\\mathcal{A}^{\\mathcal{I}}\\) and \\(\\mathcal{A}^{\\mathcal{F}}\\) to expand the augmentation space. For additional visualization results, please refer to Appendix Sec.2." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.63, + 0.36, + 0.646 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "This paper introduces feature-level perturbation to expand the augmentation space of the conventional semi-supervised learning framework, establishing the image-feature weak-to-strong consistency paradigm (IFMatch). To achieve effective feature-level perturbation, we propose refined designs that consider both perturbation position and strategy, facilitating diversity in terms of intensity and form. Furthermore, our paradigm develops two parallel student branches to seamlessly integrate the two types of perturbations and comprehensively explore the augmentation space. Additionally, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Extensive experiments are conducted on multiple benchmarks, including both balanced and imbalanced label distributions. The experimental results demonstrate the effectiveness of our approach." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.173, + 0.785, + 0.215 + ], + "angle": 0, + "content": "1. Arazo, E., Ortego, D., Albert, P., O'Connor, N.E., McGuinness, K.: Pseudolabeling and confirmation bias in deep semi-supervised learning. In: 2020 International Joint Conference on Neural Networks (IJCNN). pp. 1-8. IEEE (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.215, + 0.785, + 0.242 + ], + "angle": 0, + "content": "2. Bachman, P., Alsharif, O., Precup, D.: Learning with pseudo-ensembles. Advances in neural information processing systems 27 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.242, + 0.785, + 0.282 + ], + "angle": 0, + "content": "3. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.282, + 0.785, + 0.323 + ], + "angle": 0, + "content": "4. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. Advances in neural information processing systems 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.323, + 0.785, + 0.363 + ], + "angle": 0, + "content": "5. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality trade-off in semi-supervised learning. arXiv preprint arXiv:2301.10921 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.363, + 0.785, + 0.418 + ], + "angle": 0, + "content": "6. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223. JMLR Workshop and Conference Proceedings (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.418, + 0.785, + 0.472 + ], + "angle": 0, + "content": "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.472, + 0.785, + 0.514 + ], + "angle": 0, + "content": "8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.514, + 0.785, + 0.54 + ], + "angle": 0, + "content": "9. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout. arXiv preprint arXiv:1708.04552 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.54, + 0.785, + 0.595 + ], + "angle": 0, + "content": "10. Fan, Y., Dai, D., Kukleva, A., Schiele, B.: Cossl: Co-learning of representation and classifier for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14574-14584 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.595, + 0.785, + 0.622 + ], + "angle": 0, + "content": "1. Grandvalet, Y., Bengio, Y.: Semi-supervised learning by entropy minimization. Advances in neural information processing systems 17 (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.622, + 0.785, + 0.677 + ], + "angle": 0, + "content": "2. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15880-15889 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.677, + 0.785, + 0.717 + ], + "angle": 0, + "content": "3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.717, + 0.785, + 0.758 + ], + "angle": 0, + "content": "4. Hinton, G.E., Srivastava, N., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.R.: Improving neural networks by preventing co-adaptation of feature detectors. arXiv preprint arXiv:1207.0580 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.8 + ], + "angle": 0, + "content": "5. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International conference on machine learning. pp. 448-456. pmlr (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "6. Kim, J., Hur, Y., Park, S., Yang, E., Hwang, S.J., Shin, J.: Distribution aligning refinery of pseudo-label for imbalanced semi-supervised learning. Advances in neural information processing systems 33, 14567-14579 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.173, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Wu and Cui" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "17. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.785, + 0.215 + ], + "angle": 0, + "content": "18. Krause, A., Perona, P., Gomes, R.: Discriminative clustering by regularized information maximization. Advances in neural information processing systems 23 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.217, + 0.785, + 0.242 + ], + "angle": 0, + "content": "19. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.243, + 0.785, + 0.297 + ], + "angle": 0, + "content": "20. Kuo, C.W., Ma, C.Y., Huang, J.B., Kira, Z.: Featmatch: Feature-based augmentation for semi-supervised learning. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVIII 16. pp. 479-495. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.298, + 0.785, + 0.352 + ], + "angle": 0, + "content": "21. Lai, Z., Wang, C., Gunawan, H., Cheung, S.C.S., Chuah, C.N.: Smoothed adaptive weighting for imbalanced semi-supervised learning: Improve reliability against unknown distribution data. In: International Conference on Machine Learning. pp. 11828-11843. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.353, + 0.785, + 0.379 + ], + "angle": 0, + "content": "22. Laine, S., Aila, T.: Temporal ensembling for semi-supervised learning. arXiv preprint arXiv:1610.02242 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.379, + 0.785, + 0.419 + ], + "angle": 0, + "content": "23. Lee, H., Shin, S., Kim, H.: Abc: Auxiliary balanced classifier for class-imbalanced semi-supervised learning. Advances in Neural Information Processing Systems 34, 7082-7094 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.42, + 0.785, + 0.446 + ], + "angle": 0, + "content": "24. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research 9(11) (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.447, + 0.785, + 0.487 + ], + "angle": 0, + "content": "25. Miyato, T., Maeda, S.i., Koyama, M., Ishii, S.: Virtual adversarial training: a regularization method for supervised and semi-supervised learning. IEEE transactions on pattern analysis and machine intelligence 41(8), 1979-1993 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.488, + 0.785, + 0.514 + ], + "angle": 0, + "content": "26. Netzer, Y., Wang, T., Coates, A., Bissacco, A., Wu, B., Ng, A.Y.: Reading digits in natural images with unsupervised feature learning (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.515, + 0.785, + 0.568 + ], + "angle": 0, + "content": "27. Oh, Y., Kim, D.J., Kweon, I.S.: Daso: Distribution-aware semantics-oriented pseudo-label for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9786-9796 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.569, + 0.785, + 0.595 + ], + "angle": 0, + "content": "28. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.597, + 0.785, + 0.636 + ], + "angle": 0, + "content": "29. Pham, H., Dai, Z., Xie, Q., Le, Q.V.: Meta pseudo labels. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11557-11568 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.637, + 0.785, + 0.663 + ], + "angle": 0, + "content": "30. Rosenberg, C., Hebert, M., Schneiderman, H.: Semi-supervised self-training of object detection models (2005)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.664, + 0.785, + 0.703 + ], + "angle": 0, + "content": "31. Sajjadi, M., Javanmardi, M., Tasdizen, T.: Regularization with stochastic transformations and perturbations for deep semi-supervised learning. Advances in neural information processing systems 29 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.704, + 0.785, + 0.758 + ], + "angle": 0, + "content": "32. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.785, + 0.799 + ], + "angle": 0, + "content": "33. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "34. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International conference on machine learning. pp. 6438-6447. PMLR (2019)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.442, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Image-Feature Weak-to-Strong Consistency" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "35. Wang, Y., Chen, H., Heng, Q., Hou, W., Savvides, M., Shinozaki, T., Raj, B., Wu, Z., Wang, J.: Freematch: Self-adaptive thresholding for semi-supervised learning. arXiv preprint arXiv:2205.07246 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "36. Wang, Y., Huang, G., Song, S., Pan, X., Xia, Y., Wu, C.: Regularizing deep networks with semantic data augmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(7), 3733-3748 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.232, + 0.788, + 0.286 + ], + "angle": 0, + "content": "37. Wei, C., Sohn, K., Mellina, C., Yuille, A., Yang, F.: Crest: A class-rebalancing self-training framework for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10857-10866 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.286, + 0.788, + 0.327 + ], + "angle": 0, + "content": "38. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.328, + 0.788, + 0.37 + ], + "angle": 0, + "content": "39. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: International Conference on Machine Learning. pp. 11525-11536. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.371, + 0.788, + 0.412 + ], + "angle": 0, + "content": "40. Yang, L., Qi, L., Feng, L., Zhang, W., Shi, Y.: Revisiting weak-to-strong consistency in semi-supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7236-7246 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.412, + 0.788, + 0.438 + ], + "angle": 0, + "content": "41. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.439, + 0.788, + 0.481 + ], + "angle": 0, + "content": "42. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. Advances in Neural Information Processing Systems 34, 18408-18419 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.481, + 0.788, + 0.508 + ], + "angle": 0, + "content": "43. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.563 + ], + "angle": 0, + "content": "44. Zhao, Z., Zhou, L., Duan, Y., Wang, L., Qi, L., Shi, Y.: Dc-ssl: Addressing mismatched class distribution in semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9757-9765 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.564, + 0.788, + 0.605 + ], + "angle": 0, + "content": "45. Zhou, T., Wang, S., Bilmes, J.: Time-consistent self-supervision for semi-supervised learning. In: International Conference on Machine Learning. pp. 11523-11533. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.605, + 0.643, + 0.619 + ], + "angle": 0, + "content": "46. Zhu, X.J.: Semi-supervised learning literature survey (2005)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.619 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_origin.pdf b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..21f5355b349048094184b75addf39f5507c99d22 --- /dev/null +++ b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/e62b7a73-5720-4b62-92c9-c8775c6079fd_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a37fd9aecc6da545d5ed74b7861221b16787cffdd35d9dbeb9a23bcf18923fc0 +size 1535256 diff --git a/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/full.md b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/full.md new file mode 100644 index 0000000000000000000000000000000000000000..42cf72c790f99e28875314bff3e2782c3575138d --- /dev/null +++ b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/full.md @@ -0,0 +1,256 @@ +# Image-Feature Weak-to-Strong Consistency: An Enhanced Paradigm for Semi-Supervised Learning + +Zhiyu Wu and Jinshi Cui + +National Key Laboratory of General Artificial Intelligence, School of Intelligence Science and Technology, Peking University wuzhiyu@pku.edu.cn, cjs@cis.pku.edu.cn + +Abstract. Image-level weak-to-strong consistency serves as the predominant paradigm in semi-supervised learning (SSL) due to its simplicity and impressive performance. Nonetheless, this approach confines all perturbations to the image level and suffers from the excessive presence of naive samples, thus necessitating further improvement. In this paper, we introduce feature-level perturbation with varying intensities and forms to expand the augmentation space, establishing the image-feature weak-to-strong consistency paradigm. Furthermore, our paradigm develops a triple-branch structure, which facilitates interactions between both types of perturbations within one branch to boost their synergy. Additionally, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing additional challenges exclusively for naive samples. Notably, our paradigm can seamlessly integrate with existing SSL methods. We apply the proposed paradigm to several representative algorithms and conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate a significant enhancement in the performance of existing SSL algorithms. + +Keywords: Feature-Level Perturbation $\cdot$ Image-Feature Weak-to-Strong Consistency $\cdot$ Naive Sample Identification + +# 1 Introduction + +Semi-supervised learning (SSL) [4,30,32,46], a research topic that aims to reduce manual labeling costs by capitalizing on unlabeled data, has received considerable attention in recent years. Among the proposed methods, the image-level weak-to-strong consistency paradigm introduced by FixMatch [32] has proven highly effective in leveraging the potential of unlabeled data. Specifically, FixMatch applies varying intensities of image-level perturbations to raw samples and encourages consistent predictions between corresponding weakly and strongly augmented views. Subsequent studies have refined this paradigm primarily in two aspects: (1) improving the utilization ratio of unlabeled data by replacing + +Fig. 1: Overview of the old (left) and proposed (right) paradigms. Our paradigm introduces feature-level perturbation to expand the augmentation space and facilitates direct interactions between both types of perturbations to boost their synergy. +![](images/fbe950051e79bbca3da2aa9dd81b28ffebb497ba22a8f72be996de31c07cd040.jpg) +$\mathcal{A}^{T_{w}} / \mathcal{A}^{T_{x}}$ : weak/strong image-level perturbation; $p^{\tau_{w}} / p^{\tau_{x}}$ : predictions of samples subjected to $\mathcal{A}^{T_{w}} / \mathcal{A}^{T_{z}}$ . $\mathcal{A}^{T_{w}} / \mathcal{A}^{T_{x}}$ : weak/strong feature-level perturbation; $p^{\tau_{w},T_{x}} / p^{\tau_{x},T_{w}}$ : predictions of samples that undergo $\mathcal{A}^{T_{w}}$ and $\mathcal{A}^{T_{x}} / \mathcal{A}^{T_{z}}$ and $\mathcal{A}^{T_{w}}$ . $f^{in} / f^{out}$ : input/output feature maps of feature-level perturbation; adaptive $\mathcal{A}^{T_{w}}$ : incorporating $\mathcal{A}^{T_{x}}$ solely for naive samples recognized by the confidence-based identification strategy; $\tau ,\tau_{t}$ : threshold mechanisms; stopping gradients; : shared parameters; teacher branch; student branch; + +the constant threshold in FixMatch with a dynamic threshold [35,42] and (2) facilitating balanced predictions across different classes via refining pseudo-labels based on historical predictions [3,5]. Extensive experiments have demonstrated the effectiveness of these methods in enhancing the image-level weak-to-strong consistency paradigm. + +Despite the success of the established paradigm, two challenges persist. Firstly, the existing paradigm confines all perturbations to the image level, thus impeding the exploration of a broader augmentation space and consistency at non-image levels. Secondly, as revealed in [12], a notable proportion of samples, even undergoing strong image-level perturbation, continues to be accurately classified with high confidence, resulting in a loss close to zero. These instances (some examples are shown in Fig. 5), referred to as naive samples, are well-learned and thus fail to boost the model's performance. Therefore, relying solely on image-level perturbation proves insufficient to fully exploit the potential of unlabeled data. + +To address the aforementioned challenges, we introduce a novel SSL paradigm named Image-Feature Weak-to-Strong Consistency (IFMatch). An overview of the conventional and proposed approaches is shown in Fig. 1. The primary innovation of our method lies in feature-level perturbation, which is motivated by earlier findings that regularizers effective in the input space can be extended to hidden representations [14, 15, 34]. Specifically, feature-level perturbation randomly alters intermediate features in the backbone, establishing the basis for feature-level consistency regulation. Furthermore, to achieve effective feature-level perturbation, we present refined designs focusing on position and strategy. For the perturbation position, we identify two positions to induce weak and strong feature-level perturbations, respectively. Regarding the perturbation strategy, we develop a series of approaches from three perspectives ('movement', 'dropout', and 'value'), thereby comprehensively exploring the feature augmentation space. Note that the proposed feature-level perturbation is sample-agnostic and thus differs from previous class-based feature augmentation techniques [20, 36]. + +Building upon well-crafted augmentation techniques, we introduce the integration of two types of perturbations as another innovation. Our preliminary investigation (Tab. 3) reveals that a direct fusion of strong image-level and feature-level augmentation engenders destructive perturbations. To mitigate this issue, we propose a triple-branch structure to combine these two perturbation forms in a milder manner, as depicted in Fig. 1. Specifically, the teacher branch, mirroring its counterpart in the existing paradigm, employs predictions from samples subjected to weak image-level perturbation as pseudo-labels. Moreover, the first student branch integrates weak image-level perturbation and strong feature-level perturbation to thoroughly explore the feature augmentation space. Given limited prior research on feature-level perturbation, we delve deeper into the optimal threshold for this branch, revealing a preference for a high constant threshold over a dynamic one. In the second student branch, we combine weak feature-level perturbation with strong image-level perturbation, posing additional challenges for recognizing naive samples. However, the fused perturbation proves excessively arduous for classifying hard samples. Accordingly, we devise a confidence-based identification strategy to dynamically distinguish between naive and challenging samples, thereby introducing weak feature-level perturbation exclusively for naive samples. As the second branch predominantly relies on image-level perturbation, it can seamlessly integrate with existing threshold mechanisms. Prior to our study, UniMatch [40] uses feature-level perturbation and a multi-branch structure in semi-supervised semantic segmentation. However, their method is limited to the channel-wise dropout strategy and fails to achieve interactions between the two types of perturbations within a single branch, setting it apart from our paradigm. In summary, our contributions can be outlined as follows. + +(1) We introduce the image-feature weak-to-strong consistency paradigm for semi-supervised learning, where the feature-level perturbation and the integration of two types of perturbation within each branch serve as the fundamental enhancement compared to previous methods. +(2) We meticulously design the position and strategy of feature-level perturbation to diversify its intensity and form. +(3) We devise a confidence-based identification strategy to discriminate between naive and challenging samples, thereby introducing extra challenges solely for naive samples in the second student branch. +(4) We conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate significant promotion of existing algorithms when following our paradigm. + +# 2 Related Work + +Consistency regulation [2] represents a fundamental approach to leveraging the potential of unlabeled data. Its core objective is to ensure consistent predictions across diverse perturbed views of the same sample. Various perturbation methods have been explored, such as stochastic augmentation [22, 31], adversarial attack [25], and mixup [43]. Additionally, FixMatch [32] applies strong + +data augmentation techniques [7] to raw images, establishing the image-level weak-to-strong consistency paradigm. This paradigm significantly streamlines the framework and marks a pivotal milestone in semi-supervised learning. + +Follow-up studies refine FixMatch along two dimensions: the utilization ratio of unlabeled data and fairness considerations. Regarding the former, numerous dynamic threshold strategies have been proposed. For example, FlexMatch [42] maps the predefined threshold to class-specific thresholds based on class-wise learning status. SoftMatch [5] models sample weights by a dynamic Gaussian function, maintaining a soft margin between unlabeled samples of different confidence levels. FreeMatch [35] utilizes the confidence on unlabeled data as the adaptive threshold. Moreover, the concept of fairness stems from entropy-based regulation [1,11,16,18,44]. The most representative strategy in this context, Distribution Alignment [3], encourages equal-frequency predictions across classes by refining pseudo-labels based on overall predictions within the unlabeled set. + +Concurrently, several studies express similar concerns to the old paradigm. FeatMatch [20] and ISDA [36] prevent the exclusive reliance on image-level perturbation by devising class-based feature augmentation approaches. In contrast, our proposed feature-level perturbation is sample-agnostic, circumventing harmful perturbations derived from erroneous pseudo-labels. Additionally, UniMatch [40] uses channel-wise dropout to establish an auxiliary branch for feature-level perturbation. In comparison, we present feature-level perturbations with varying intensities and forms, further combining them with image-level perturbations within each branch to boost their synergy. Besides, [12] observes excessive naive samples and applies more aggressive image-level augmentation to these samples. To address this issue, we propose a confidence-based identification strategy to effectively distinguish between naive and challenging samples and introduce weak feature-level perturbation exclusively for naive samples. + +# 3 Methodology + +# 3.1 Image-Level Weak-to-Strong Consistency + +We begin by reviewing the image-level weak-to-strong consistency paradigm, as depicted in the left part of Fig. 1. Let $\mathcal{D}_L = \{(x_i,y_i)\}_{i = 1}^{N_L}$ and $\mathcal{D}_U = \{u_i\}_{i = 1}^{N_U}$ represent the labeled and unlabeled datasets, respectively. Here, $x_{i}$ and $u_{i}$ denote the labeled and unlabeled training samples, and $y_{i}$ refers to the one-hot label for the labeled sample $x_{i}$ . We denote the prediction of sample $x$ as $p(y|x)$ . Given a batch of labeled and unlabeled data, the model is optimized with the objective $\mathcal{L} = \mathcal{L}_s + \lambda_u\mathcal{L}_u$ . Specifically, $\mathcal{L}_s$ indicates the cross-entropy loss ( $\mathcal{H}$ ) for the labeled batch of size $B_{L}$ . + +$$ +\mathcal {L} _ {s} = \frac {1}{B _ {L}} \sum_ {i = 1} ^ {B _ {L}} \mathcal {H} \left(y _ {i}, p \left(y \mid x _ {i}\right)\right) \tag {1} +$$ + +On the other hand, $\mathcal{L}_u$ signifies the image-level consistency regulation between the prediction of the strongly augmented view $\mathcal{A}^{\mathcal{T}_s}(u)$ and the pseudo-label + +![](images/382aaf22fe6b077f6da4ee40038786e52a39e57fc20fa7735e2be1881046f498.jpg) +Fig. 2: Candidate positions for introducing feature-level perturbation. Position A perturbs the output of the residual block, representing strong feature-level perturbation $\mathcal{A}^{\mathcal{F}_s}$ . Position B perturbs the output of a random convolution within the residual component, corresponding to weak feature-level perturbation $\mathcal{A}^{\mathcal{F}_w}$ . $x^{in} / x^{out}$ denotes input/output feature maps of the residual block. + +sourced from the corresponding weakly augmented view $\mathcal{A}^{\mathcal{I}_w}(u)$ . To mitigate incorrect pseudo-labels, FixMatch [32] introduces a constant threshold, and subsequent studies propose various dynamic threshold strategies. Without loss of generality, we denote the threshold as $\tau_t$ and define $\mathcal{L}_u$ as follows. + +$$ +\mathcal {L} _ {u} = \frac {1}{B _ {U}} \sum_ {i = 1} ^ {B _ {U}} \mathbb {1} \left(\max \left(p _ {i} ^ {\mathcal {I} _ {w}}\right) \geq \tau_ {t}\right) \mathcal {H} \left(\hat {p} _ {i} ^ {\mathcal {I} _ {w}}, p _ {i} ^ {\mathcal {I} _ {s}}\right) \tag {2} +$$ + +Here, $p_i^{\mathcal{I}_w}$ is the abbreviation of $DA(p(y|\mathcal{A}^{\mathcal{I}_w}(u_i)))$ , where $DA$ indicates the distribution alignment strategy [3]. $\hat{p}_i^{\mathcal{T}_w}$ denotes the one-hot pseudo-label obtained from $\text{argmax}(p_i^{\mathcal{I}_w})$ . Moreover, $p_i^{\mathcal{I}_s}$ stands for $p(y|\mathcal{A}^{\mathcal{I}_s}(u_i))$ . Lastly, $B_U$ corresponds to the batch size of unlabeled data. + +# 3.2 Feature-Level Perturbation + +To avoid the exclusive reliance on image-level perturbation, this paper introduces feature-level perturbation varied in intensity and form, thereby expanding the augmentation space. In the following parts, we will elaborate on the implementation of feature-level perturbation regarding its position and strategy. + +Position refers to where the feature-level perturbation is introduced. Given that WideResNet [41] is the prevailing backbone in SSL, we employ its basic component, the residual block [13] with pre-activation, as an illustrative example. Building upon previous studies that exploit feature-level regularizers directly after the convolution [14, 15, 34], we identify two positions for introducing feature-level perturbation, as depicted in Fig. 2. In position A, the method perturbs the summation of the residual and identity connections, i.e., the output of the residual block. As position A acts as the bottleneck for feedforward, perturbation at position A exhibits high intensity and is therefore regarded as strong feature-level perturbation $\mathcal{A}^{\mathcal{F}_s}$ . Additionally, position B perturbs the output of a random convolution within the residual component, which is relatively milder than position A. Therefore, perturbation at position B is considered as weak feature-level perturbation $\mathcal{A}^{\mathcal{F}_w}$ . It is worth noting that both + +position choices are applicable to all residual blocks, and the algorithm randomly selects one position at each iteration to insert feature-level perturbation. + +Strategy denotes the operation of feature-level perturbation. We first review strong image-level perturbation strategies $\mathcal{A}^{\mathcal{I}_s}$ [7], which can be roughly divided into three groups: 'movement', 'dropout', and 'value'. Specifically, 'movement' comprises spatial perturbations like translation and shearing, 'dropout' corresponds to the Cutout technique [9], and 'value' represents operations that modify pixel values while preserving pixel relationships, such as adjusting contrast, brightness, and histogram. Considering the effectiveness of $\mathcal{A}^{\mathcal{I}_s}$ , we develop feature-level perturbation strategies from the same perspectives. For 'movement', we implement feature map translation and shearing along the X-axis and Y-axis. Regarding 'dropout', we apply channel-wise and spatial-wise dropout on hidden representations. Concerning 'value', we employ random-sized convolutions to achieve local smoothing, subsequently using the weighted sum of smoothed and input feature maps as the output. During training, the model randomly selects one candidate strategy at each iteration to perturb hidden representations at the selected position. For the detailed implementation of feature-level perturbation strategies, please refer to Appendix Sec.1. + +# 3.3 Image-Feature Weak-to-Strong Consistency + +Building upon well-designed image-level and feature-level perturbations, we can integrate them to achieve consistency regulation in both dimensions. Intuitively, a trivial approach is combining strong image-level and feature-level perturbations in one branch to construct a dual-branch structure similar to the old paradigm. However, such a toy paradigm engenders destructive perturbations according to our pilot study (Tab. 3). Accordingly, we integrate these two forms of perturbations in a more moderate manner, developing the image-feature weak-to-strong consistency paradigm (IFMatch) depicted in the right part of Fig. 1. + +Our paradigm retains the traditional teacher branch, utilizing predictions $\hat{p}^{\mathcal{T}_w}$ of samples subjected to weak image-level perturbation as pseudo-labels. Furthermore, we introduce two student branches to integrate both types of perturbations. Mathematically, given a batch of labeled and unlabeled data, the model is optimized using the objective $\mathcal{L} = \mathcal{L}_s + \lambda_u(\mathcal{L}_{u_1} + \mathcal{L}_{u_2})$ , where $\mathcal{L}_s$ denotes the cross-entropy loss for labeled data, and $\mathcal{L}_{u_1}$ and $\mathcal{L}_{u_2}$ represent the consistency regulation for unlabeled data in the two student branches respectively. + +In the first student branch, we integrate weak image-level perturbation $\mathcal{A}^{\mathcal{T}_w}$ and strong feature-level perturbation $\mathcal{A}^{\mathcal{F}_s}$ to comprehensively explore the feature perturbation space. Furthermore, we employ the constant threshold $\tau$ adopted in FixMatch to filter out incorrect pseudo-labels. This choice arises from the observation that existing dynamic threshold mechanisms are less suitable for $\mathcal{A}^{\mathcal{F}_s}$ , especially in challenging tasks. Thus, the unsupervised loss $\mathcal{L}_{u_1}$ in the first student branch can be expressed as follows. + +$$ +\mathcal {L} _ {u _ {1}} = \frac {1}{B _ {U}} \sum_ {i = 1} ^ {B _ {U}} \mathbb {1} \left(\max \left(p _ {i} ^ {\mathcal {I} _ {w}}\right) \geq \tau\right) \mathcal {H} \left(\hat {p} _ {i} ^ {\mathcal {I} _ {w}}, p _ {i} ^ {\mathcal {I} _ {w}, \mathcal {F} _ {s}}\right) \tag {3} +$$ + +Algorithm 1: Image-Feature Weak-to-Strong Consistency (IFMatch) +Input: labeled data $\mathcal{D}_L = \{(x_i,y_i)\}_{i = 1}^{N_L}$ , unlabeled data $\mathcal{D}_U = \{u_i\}_{i = 1}^{N_U}$ , batch sizes $B_{L}$ and $B_{U}$ , loss weight $\lambda_{u}$ , total iterations $T$ , perturbations $\{\mathcal{A}^{\mathcal{I}_w},\mathcal{A}^{\mathcal{I}_s},\mathcal{A}^{\mathcal{F}_w},\mathcal{A}^{\mathcal{F}_s}\}$ , constant threshold $\tau$ , threshold mechanism $\tau_{t}$ , target confidence $\{h_1,h_2,\dots ,h_{N_U}\}$ , mask $\{\mathcal{M}_1,\mathcal{M}_2,\dots ,\mathcal{M}_{N_U}\}$ +1 for $t\gets 1$ to $T$ do // the same parts as the old paradigm +2 Compute supervised loss $\mathcal{L}_s$ , pseudo-labels $p^{\mathcal{I}_w}$ and $\hat{p}^{\mathcal{I}_w}$ , and threshold $\tau_t$ . // the first student branch +3 Compute predictions $p^{\mathcal{I}_w,\mathcal{F}_s}$ and loss $\mathcal{L}_{u_1}$ using Eq. (3); // the second student branch +4 Decide whether to introduce $\mathcal{A}^{\mathcal{F}_w}$ for $u_{i}$ in the second student branch according to the mask $\mathcal{M}_i$ using Eq. (6) and Eq. (7); +5 Compute predictions $p^{\mathcal{I}_s,\mathcal{F}_w}$ and loss $\mathcal{L}_{u_2}$ using Eq. (4); // update model +6 Back-propagate loss $\mathcal{L} = \mathcal{L}_s + \lambda_u(\mathcal{L}_{u_1} + \mathcal{L}_{u_2})$ and update parameters ; // Confidence-based identification strategy +7 Record target confidence $h_i = p_{i,j}^{\mathcal{I}_s,\mathcal{F}_w}(j = \hat{p}_i^{\mathcal{I}_w})$ and mask $\mathcal{M}_i = \mathbb{1}(h_i\geq \tau_t)$ +8 end + +Here, $p_i^{\mathcal{I}_w,\mathcal{F}_s}$ denotes the prediction of $u_{i}$ in the first branch. + +In the second student branch, we combine strong image-level perturbation $\mathcal{A}^{\mathcal{I}_s}$ and weak feature-level perturbation $\mathcal{A}^{\mathcal{F}_w}$ to provide additional challenges in recognizing naive samples. However, a direct fusion of $\mathcal{A}^{\mathcal{I}_s}$ and $\mathcal{A}^{\mathcal{F}_w}$ poses obstacles in classifying hard samples. Accordingly, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing extra challenges exclusively for naive samples, which will be detailed in Sec. 3.4. Moreover, given the central role of $\mathcal{A}^{\mathcal{I}_s}$ , we leverage existing threshold mechanisms $\tau_t$ to exclude misleading pseudo-labels, facilitating seamless integration with previous algorithms. Consequently, the unsupervised loss $\mathcal{L}_{u_2}$ in the second branch can be defined as follows. + +$$ +\mathcal {L} _ {u _ {2}} = \frac {1}{B _ {U}} \sum_ {i = 1} ^ {B _ {U}} \mathbb {1} \left(\max \left(p _ {i} ^ {\mathcal {I} _ {w}}\right) \geq \tau_ {t}\right) \mathcal {H} \left(\hat {p} _ {i} ^ {\mathcal {I} _ {w}}, p _ {i} ^ {\mathcal {I} _ {s}, \mathcal {F} _ {w}}\right) \tag {4} +$$ + +where $p_i^{\mathcal{I}_s, \mathcal{F}_w}$ represents the prediction of sample $u_i$ in the second branch. Particularly, the use of distinct thresholds in the two student branches is motivated not only by experiments (Tab. 5) but also by an inherent rationale. Specifically, the threshold serves to balance the utilization ratio of unlabeled data and pseudolabel accuracy [5, 35]. Furthermore, $\mathcal{A}^{\mathcal{F}_s}$ and $\mathcal{A}^{\mathcal{I}_s}$ act as the central driving forces behind the respective student branch. Due to the unique characteristics of $\mathcal{A}^{\mathcal{F}_s}$ and $\mathcal{A}^{\mathcal{I}_s}$ , they exhibit varying preferences in the trade-off between the utilization and pseudo-label accuracy, resulting in the different desired threshold mechanisms in the two student branches. For a further understanding of our paradigm, please refer to Algorithm 1. + +![](images/130ce1eaed085c06bf572a8c3bec33c0be4b50e31fbff743f35cb63d192525e6.jpg) +Fig. 3: Overview of the confidence-based identification strategy. The approach records sample-wise target confidence in the second student branch and identifies naive samples by comparing the confidence with the threshold in the second student branch. $w/$ and $w/o$ abbreviates with and without, respectively. + +# 3.4 Confidence-Based Identification + +As analyzed in Sec. 3.3, the combination of strong image-level perturbation $\mathcal{A}^{\mathcal{I}_s}$ and weak feature-level perturbation $\mathcal{A}^{\mathcal{F}_w}$ poses supplementary challenges for naive samples yet incurs exceeding difficulty for hard ones. Likewise, previous research has encountered similar challenges in expanding the augmentation space. For example, UniMatch [40] observes a performance degradation caused by the concatenation of channel-wise dropout and $\mathcal{A}^{\mathcal{I}_s}$ and finally denies the feasibility of combining $\mathcal{A}^{\mathcal{I}}$ and $\mathcal{A}^{\mathcal{F}}$ within one branch. Besides, [12] imposes more aggressive image-level perturbations exclusively on naive samples. To distinguish between naive and challenging samples, their approach records sample-wise loss and utilizes the OTSU [28] method for distinction. However, OTSU is conventionally applied to the segmentation of bimodal gray-scale images, whereas the histogram of loss values typically exhibits a descending trend. As shown in Fig. 4, their approach tends to produce identification biased toward naive samples. + +To effectively identify the naive samples, we propose a confidence-based identification strategy, which is depicted in Fig. 3. Similar to the threshold-based rule for pseudo-label filtering that only predictions exceeding the confidence threshold qualify as pseudo-labels, the proposed strategy can be succinctly concluded as: 'only strongly augmented samples $\mathcal{A}^{\mathcal{I}_s}(u)$ with target confidence exceeding the threshold are considered naive and necessitate additional weak feature-level perturbation $\mathcal{A}^{\mathcal{F}_w}$ . Specifically, the approach comprises two steps. Firstly, we record the confidence linked to the pseudo-label within the predicted distribution of the second branch. Mathematically, the target confidence $h_i$ for sample $u_i$ in the second student branch can be obtained as follows. + +$$ +h _ {i} = p _ {i, j} ^ {\mathcal {I} _ {s}, \mathcal {F} _ {w}} (j = \hat {p} _ {i} ^ {\mathcal {I} _ {w}}) \tag {5} +$$ + +It is important to clarify that $p_i^{\mathcal{I}_s, \mathcal{F}_w}$ solely represents the prediction of sample $u_i$ in the second branch and has nothing to do with the introduction of $\mathcal{A}^{\mathcal{F}_w}$ for $u_i$ . Secondly, the algorithm generates a binary mask for each sample to determine whether to introduce additional $\mathcal{A}^{\mathcal{F}_w}$ by comparing the target confidence with the threshold $\tau_t$ in the second student branch. Consequently, the mask for sample $u_i$ , denoted as $\mathcal{M}_i$ , and the perturbations applied to $u_i$ in the second student + +Table 1: Accuracy $(\%)$ on four benchmarks with varying numbers of labels. Bold indicates the best performance, and underline denotes the second best. We omit the standard deviation of performance, as the proposed paradigm performs stable across different random seeds. IFMatch $(^{*})$ represents the proposed paradigm using the threshold mechanism of $^*$ in the second student branch. In Particular, given that SoftMatch proposes a sample weight strategy rather than a threshold scheme, IFMatch (Soft) inherits its weight scheme when computing $\mathcal{L}_{u_2}$ and replaces the $\tau_{t}$ in Eq. (6) with the mean value of the dynamic Gaussian in SoftMatch when identifying naive samples. + +
DatasetsCIFAR-10CIFAR-100SVHNSTL-10ImageNet
# Label402504000400250010000401000401000100k400k
VAT [25]25.3458.9789.4914.8053.1667.8625.2595.8925.2662.05--
MeanTeacher [33]29.9162.5491.9018.8954.8368.2563.9196.7328.2866.10--
MixMatch [4]63.8186.3793.3432.4160.2472.2269.4096.3145.0778.30--
ReMixMatch [3]90.1293.7095.1657.2573.9779.9875.9694.8467.8893.26--
UDA [38]89.3894.8495.7153.6172.2777.5194.8898.1162.5893.36--
Dash [39]91.0794.8495.6455.1872.8578.1297.8198.0365.4893.61--
MPL [29]93.3894.2495.4553.7472.2978.2690.6797.7264.2493.34--
FixMatch [32]92.5395.1495.7953.5871.9777.8096.1998.0464.0393.7556.3467.72
IFMatch (Fix)95.8295.9796.4966.2674.6580.0197.7598.1578.5495.2861.2671.48
FlexMatch [42]95.0395.0295.8160.0673.5178.1091.8193.2870.8594.2358.1568.69
IFMatch (Flex)95.9095.9996.4266.2875.0379.8797.7698.0479.8395.2461.7571.14
SoftMatch [5]95.0995.1895.9662.9073.3477.9797.6797.9978.5894.2759.4370.51
IFMatch (Soft)95.8495.9396.3667.0274.9979.9698.0498.2282.4695.2262.4471.66
FreeMatch [35]95.1095.1295.9062.0273.5378.3298.0398.0484.4494.3758.4869.48
IFMatch (Free)95.8396.0296.4466.6575.1680.0898.0898.1884.7595.2961.6971.30
+ +branch can be expressed as follows. + +$$ +\mathcal {M} _ {i} = \mathbb {1} \left(h _ {i} \geq \tau_ {t}\right) \tag {6} +$$ + +$$ +\text {P e r t u r b a t i o n s f o r} u _ {i} = \left\{ \begin{array}{l l} \left\{\mathcal {A} ^ {\mathcal {I} _ {s}}, \mathcal {A} ^ {\mathcal {F} _ {w}} \right\} & \mathcal {M} _ {i} = 1 \\ \left\{\mathcal {A} ^ {\mathcal {I} _ {s}} \right\} & \mathcal {M} _ {i} = 0 \end{array} \right. \tag {7} +$$ + +The approach dynamically updates $\mathcal{M}_i$ throughout the training process, thereby considering both the learning status of individual samples and model performance when introducing $\mathcal{A}^{\mathcal{F}_w}$ . + +# 4 Experiments + +# 4.1 Balanced Semi-Supervised Learning + +Settings. We conduct experiments on multiple benchmarks, including CIFAR-10/100 [19], SVHN [26], STL-10 [6], and ImageNet [8], with various numbers of labeled samples. In the context of balanced SSL, we maintain a balanced distribution for labeled samples. The choice of backbone architecture adheres to established practices, employing specific models for different datasets: WRN-28-2 [41] for CIFAR-10 and SVHN, WRN-28-8 for CIFAR-100, WRN-37-2 [45] for STL-10, and ResNet-50 [13] for ImageNet. As for training parameters, we follow the unified codebase TorchSSL [42] to ensure fair comparisons. Specifically, batch + +sizes $B_{L}$ and $B_{U}$ are set to 128 and 128 on ImageNet and 64 and 448 on the remaining datasets. Moreover, the model is trained using the SGD optimizer with an initial learning rate of 0.03 and a momentum decay of 0.9. The learning rate is adjusted by a cosine decay scheduler over a total of $2^{20}$ steps. Besides, we train the EMA model with a momentum decay of 0.999 for inference. The fixed threshold $\tau$ in the first branch is set to 0.95. For SVHN, we follow previous studies [35, 39] and constrain the dynamic threshold within the range of [0.9, 1.0]. To suppress randomness, we repeat each experiment three times and report the average accuracy in Tab. 1. We omit the standard deviation given the stable performance of the proposed paradigm across different random seeds. + +Performance. We apply the proposed paradigm (IFMatch) to several algorithms and compare their performance with existing methods on multiple benchmarks. The results presented in Tab. 1 underscore the significant contribution of our paradigm to promoting the performance of existing SSL algorithms. Specifically, the four algorithms involved achieve the average improvement of $4.05\%$ , $3.22\%$ , $1.62\%$ , and $1.39\%$ across all datasets. Moreover, previous methods struggle to enhance performance on less challenging tasks, such as CIFAR-10. In contrast, when integrated with the proposed paradigm, IFMatch (Fix) outperforms FixMatch by $2.29\% / 0.83\% / 0.70\%$ on CIFAR-10 with $40 / 250 / 4000$ labeled samples, respectively. Furthermore, our approach effectively addresses the challenges posed by extremely limited labeled samples, with IFMatch (Fix) achieving enhancements of $14.51\%$ and $12.68\%$ on STL-10 with 40 labels and CIFAR-100 with 400 labels, respectively, compared to FixMatch. Moreover, the four algorithms achieve an average promotion of $3.69\% / 2.30\%$ on ImageNet with $100k / 400k$ labels when following the proposed paradigm, indicating its effectiveness on large-scale datasets. Additionally, when employing our paradigm, the performance gap between dynamic and constant thresholds considerably narrows on challenging tasks, while IFMatch (Fix) even emerges as the preferred method on some less demanding tasks. The shifted performance gap implies a reduced reliance on complex threshold strategies of our paradigm, which primarily benefits from the expanded augmentation space. In summary, the impressive performance observed in Tab. 1 confirms the effectiveness of the proposed paradigm. + +# 4.2 Imbalanced Semi-Supervised Learning + +Settings. We evaluate the proposed paradigm in the context of imbalanced SSL, where both labeled and unlabeled data exhibit a long-tailed distribution. Consistent with prior studies [5,10,21,23,27,37], we construct labeled and unlabeled sets using the configurations of $N_{c} = N_{1} \cdot \gamma^{-\frac{c - 1}{C - 1}}$ and $M_{c} = M_{1} \cdot \gamma^{-\frac{c - 1}{C - 1}}$ . Specifically, for CIFAR-10-LT, we set $N_{1}$ to 1500, $M_{1}$ to 3000, and $\gamma$ to range from 50 to 150. Moreover, for CIFAR-100-LT, we set $N_{1}$ to 150, $M_{1}$ to 300, and $\gamma$ to span from 20 to 100. In all experiments, we employ WRN-28-2 as the backbone and utilize the Adam optimizer [17] with a weight decay of 4e-5. Besides, batch sizes $B_{L}$ and $B_{U}$ are fixed as 64 and 128 respectively. Additionally, the learning rate is initially set to 2e-3 and adjusted by a cosine decay scheduler during + +Table 2: Performance (%) on CIFAR-10/100-LT with varying imbalance ratio. + +
DatasetCIFAR-10-LTCIFAR-100-LT
γ501001502050100
FixMatch [32]81.54±0.3074.89±1.2070.38±0.8849.58±0.7842.11±0.3337.60±0.48
IFMatch (Fix)85.32±0.3379.46±0.3575.59±0.4853.61±0.2544.58±0.3839.92±0.37
FlexMatch [42]81.87±0.1974.49±0.9270.20±0.3650.89±0.6042.80±0.3937.30±0.47
IFMatch (Flex)84.36±0.1279.04±0.4273.02±0.4751.83±0.3343.49±0.3537.98±0.36
SoftMatch [5]83.45±0.2977.07±0.3772.60±0.4651.91±0.5543.76±0.5138.92±0.81
IFMatch (Soft)85.56±0.1580.28±0.2476.18±0.3453.97±0.3244.98±0.4139.68±0.41
FreeMatch [35]83.30±0.3375.96±0.4971.20±0.6451.60±0.9142.95±0.4837.50±0.23
IFMatch (Free)84.88±0.2080.12±0.2974.85±0.4752.77±0.4643.68±0.4538.00±0.55
+ +training. We set the fixed threshold $\tau$ in the first branch to 0.95. To account for randomness, we report the mean and standard deviation of the performance across three different random seeds. + +Performance. We apply the proposed paradigm to numerous algorithms and compare the performance with their counterparts following the old paradigm. The results in Tab. 2 demonstrate that our paradigm substantially improves existing models, enabling them to achieve state-of-the-art performance. Specifically, when integrated with the enhanced paradigm, the four algorithms achieve the average promotion of $3.72\%$ , $2.03\%$ , $2.16\%$ , and $1.92\%$ across all benchmarks. Notably, IFMatch (Fix) outperforms FixMatch by $5.21\%$ and $2.32\%$ on CIFAR-10-LT ( $\gamma = 150$ ) and CIFAR-100-LT ( $\gamma = 100$ ), highlighting the robustness of the proposed paradigm when facing severe imbalance. Moreover, the performance gap between dynamic-threshold-based methods and FixMatch substantially narrows within our paradigm. Accordingly, the proposed approach promotes the utilization of unlabeled data, reducing reliance on complex threshold mechanisms. Overall, the impressive performance observed in imbalanced SSL suggests the potential of our approach to be deployed in real-world applications. + +# 4.3 Component Analysis + +This section presents the contribution of each component within the proposed paradigm. Unless otherwise stated, we conduct experiments on IFMatch (Fix). Additionally, we provide running speed analysis, feature visualization results [24], and performance on semi-supervised semantic segmentation in the Appendix. The subsequent analysis presents the revealed findings. + +The proposed approach to integrating image-level and feature-level perturbations yields optimal performance. As the simplest idea, we can integrate $\mathcal{A}^{\mathcal{F}_s}$ and $\mathcal{A}^{\mathcal{I}_s}$ within one branch to establish a dual-branch structure similar to the old paradigm. Nonetheless, such a toy design engenders disruptive perturbations that exceed acceptable augmentation levels for consistency regulation, resulting in the performance degradation presented in lines 1-2 of Tab. 3. An alternative approach, proposed by UniMatch [40], combines $\mathcal{A}^{\mathcal{F}}$ and $\mathcal{A}^{\mathcal{I}}$ in separate branches, each employing a distinct type of perturbation (line 3). + +Table 3: Experiments (\%) on the strategies for integrating image-level and feature-level perturbations. CBI abbreviates the confidence-based identification strategy. CIFAR- $m-n$ denotes CIFAR- $m$ with $n$ labeled samples. Line 3 combines the structure setting of UniMatch [40] and our proposed feature-level perturbation techniques. + +
Branch IBranch IICIFAR-10-40CIFAR-100-400
FixMatch (baseline, no \(\mathcal{A}^{\mathcal{F}}\))92.5353.58
\(\mathcal{A}^{\mathcal{F}_s} + \mathcal{A}^{\mathcal{I}_s}\) in one branch88.2651.47
\(\mathcal{A}^{\mathcal{F}_s}\)\(\mathcal{A}^{\mathcal{I}_s}\)95.5364.54
\(\mathcal{A}^{\mathcal{F}_s} + \mathcal{A}^{\mathcal{I}_w}\)\(\mathcal{A}^{\mathcal{F}_w} + \mathcal{A}^{\mathcal{I}_s}\)95.4763.56
\(\mathcal{A}^{\mathcal{F}_s} + \mathcal{A}^{\mathcal{I}_w}\)\(\mathcal{A}^{\mathcal{F}_w} + \mathcal{A}^{\mathcal{I}_s} + \text{CBI}\)95.8266.26
+ +Table 4: Ablation study (%) for the strategies of feature-level perturbation. + +
A^F StrategyCIFAR-10-40CIFAR-100-400
All strategies95.8266.26
w/o channel-wise dropout95.66 (↓0.16)65.68 (↓0.58)
w/o spatial-wise dropout95.57 (↓0.25)65.77 (↓0.49)
w/o translation95.59 (↓0.23)65.70 (↓0.56)
w/o shearing95.58 (↓0.24)65.81 (↓0.47)
w/o value modification95.62 (↓0.20)65.75 (↓0.51)
+ +Despite its effectiveness, this method fails to boost interactions between the two types of perturbations. Accordingly, we attempt to achieve the co-occurrence of $\mathcal{A}^{\mathcal{F}}$ and $\mathcal{A}^{\mathcal{I}}$ within one branch, thereby constructing a more comprehensive augmentation space. The proposed paradigm adopts a milder combination strategy, specifically using $\mathcal{A}^{\mathcal{F}_s} + \mathcal{A}^{\mathcal{I}_w}$ and $\mathcal{A}^{\mathcal{F}_w} + \mathcal{A}^{\mathcal{I}_s}$ in the two student branches respectively. However, as shown in line 4 of Tab. 3, the introduction of $\mathcal{A}^{\mathcal{F}_w}$ leads to a performance drop compared to UniMatch, probably due to the derived difficulties in recognizing hard samples. To address this issue, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Finally, the proposed paradigm (IFMatch), as presented in line 5, achieves the optimal performance among all candidate designs for integrating $\mathcal{A}^{\mathcal{F}}$ and $\mathcal{A}^{\mathcal{I}}$ , demonstrating its effectiveness and advantages. + +All feature-level perturbation strategies contribute to the overall performance. As shown in Tab. 4, we conduct an ablation study on feature-level perturbation strategies. The baseline model in line 1 integrates all proposed strategies and achieves state-of-the-art performance. In subsequent configurations (line 2-6), we sequentially remove each strategy. Compared to the baseline, the absence of any proposed perturbation technique leads to a decline in performance on both datasets. Therefore, the proposed perturbation strategies exhibit a synergistic effect, collaboratively exploring the feature perturbation space. + +Feature-level perturbation $\mathcal{A}^{\mathcal{F}}$ favors a high constant threshold over a dynamic one. As detailed in Sec. 3.3, $\mathcal{A}^{\mathcal{F}}$ and $\mathcal{A}^{\mathcal{I}}$ may require different threshold mechanisms due to their distinct characteristics. Considering the central role of $\mathcal{A}^{\mathcal{F}}$ ( $\mathcal{A}^{\mathcal{F}_s}$ ) in the first student branch, we further delve into the + +Table 5: Exploration (%) for the threshold strategy in the first branch. + +
Branch IBranch IICIFAR-10-40CIFAR-100-400
FlexMatchFlexMatch95.2863.38
τ = 0.95FlexMatch95.9066.28
SoftMatchSoftMatch95.3963.80
τ = 0.95SoftMatch95.8467.02
FreeMatchFreeMatch95.5664.45
τ = 0.95FreeMatch95.8366.65
+ +Table 6: Comparison (%) between SAA [12] and confidence-based identification. + +
Identification StrategyCIFAR-10-40CIFAR-100-400
SAA [12]95.5465.32
Confidence-Based Identification95.8266.26
+ +threshold strategy best suited for it. In general, existing threshold mechanisms can be categorized into constant thresholds and dynamic thresholds. The former prioritizes high pseudo-label accuracy at the expense of diminished utilization of unlabeled data, while the latter performs conversely. Accordingly, we determine the optimal threshold for the first branch from two candidates: a dynamic threshold mirroring the one used in the second branch and the constant threshold used in FixMatch. Combining Tab. 5 and Tab. 1, the proposed paradigm consistently outperforms the old paradigm regardless of the threshold adopted in the first branch. Additionally, the constant threshold beats all dynamic threshold mechanisms, suggesting that feature-level perturbation $\mathcal{A}^{\mathcal{F}}$ is better suited to a constant threshold of 0.95, rather than existing dynamic threshold mechanisms. + +IFMatch outperforms previous methods from the perspective of the naive sample ratio. Firstly, as shown in the left part of Fig. 4, our approach (orange) achieves a lower naive sample ratio than UniMatch (green). This suggests more effective utilization of unlabeled data in our paradigm, primarily benefiting from combining both types of perturbation within each branch. Secondly, we compare the confidence-based identification strategy and SAA [12] within our paradigm to discern a better naive sample identification method. Specifically, SAA utilizes loss values as the criteria, recording historical loss for each sample and performing naive-challenging division by OTSU [28]. As shown in Tab. 6, the proposed module consistently outperforms SAA. Additionally, the naive sample ratio presented in the left part of Fig. 4 indicates that SAA (blue) tends to produce identification biased toward naive samples (e.g. starting with a ratio of 0.5 in the first iteration). Furthermore, we analyze the identification process of both strategies in the later training stages, as shown in the right part of Fig. 4. Notably, when employing the cross-entropy loss, the loss threshold of 1.79 in SAA corresponds to a confidence threshold of 0.17 (computed as $e^{-1.79}$ ), which is a detrimental configuration. The limitations of SAA can be ascribed to the ill-suited nature of the OTSU technique for segmenting a histogram with a monotonically decreasing trend. In contrast, our strategy remains effective in + +![](images/5b211e0788184c30bfe317c134835b068a9681d6a304acd2011e960251acbace.jpg) +Fig. 4: Visualization for naive sample ratio and the identification process of SAA [12] and confidence-based identification on CIFAR-100-400. + +![](images/26d54796fdbdd7193856a9461b532ae29194cb484d5f4ce97aa95f351a2e845a.jpg) +Fig. 5: Visualization of perturbations. We provide the feature map for samples that undergo feature-level augmentation. A naive sample $u$ exhibits the characteristic of $\forall \mathcal{A}^{\mathcal{I}_s}(u), \mathcal{H}(\hat{p}_i^{\mathcal{I}_w}, p_i^{\mathcal{I}_s}) \approx 0$ , thus contributing trivially to the model's performance. + +distinguishing between naive and challenging samples even if the unlabeled set is predominantly composed of naive samples. + +Visualization analysis. We present the visualization for image-level and feature-level perturbations in Fig. 5, where the four parts (from left to right) correspond to the raw images, the images subjected to $\mathcal{A}^{\mathcal{I}_s}$ , and the feature maps that undergo $\mathcal{A}^{\mathcal{F}_w} \circ \mathcal{A}^{\mathcal{I}_s}$ and $\mathcal{A}^{\mathcal{F}_s} \circ \mathcal{A}^{\mathcal{I}_w}$ . We can observe that the exclusive reliance on $\mathcal{A}^{\mathcal{I}_s}$ engenders easy-to-recognize (naive) samples. In contrast, the proposed paradigm effectively combines $\mathcal{A}^{\mathcal{I}}$ and $\mathcal{A}^{\mathcal{F}}$ to expand the augmentation space. For additional visualization results, please refer to Appendix Sec.2. + +# 5 Conclusion + +This paper introduces feature-level perturbation to expand the augmentation space of the conventional semi-supervised learning framework, establishing the image-feature weak-to-strong consistency paradigm (IFMatch). To achieve effective feature-level perturbation, we propose refined designs that consider both perturbation position and strategy, facilitating diversity in terms of intensity and form. Furthermore, our paradigm develops two parallel student branches to seamlessly integrate the two types of perturbations and comprehensively explore the augmentation space. Additionally, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Extensive experiments are conducted on multiple benchmarks, including both balanced and imbalanced label distributions. The experimental results demonstrate the effectiveness of our approach. + +# References + +1. Arazo, E., Ortego, D., Albert, P., O'Connor, N.E., McGuinness, K.: Pseudolabeling and confirmation bias in deep semi-supervised learning. In: 2020 International Joint Conference on Neural Networks (IJCNN). pp. 1-8. IEEE (2020) +2. Bachman, P., Alsharif, O., Precup, D.: Learning with pseudo-ensembles. Advances in neural information processing systems 27 (2014) +3. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019) +4. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. Advances in neural information processing systems 32 (2019) +5. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality trade-off in semi-supervised learning. arXiv preprint arXiv:2301.10921 (2023) +6. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223. JMLR Workshop and Conference Proceedings (2011) +7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020) +8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009) +9. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout. arXiv preprint arXiv:1708.04552 (2017) +10. Fan, Y., Dai, D., Kukleva, A., Schiele, B.: Cossl: Co-learning of representation and classifier for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14574-14584 (2022) +1. Grandvalet, Y., Bengio, Y.: Semi-supervised learning by entropy minimization. Advances in neural information processing systems 17 (2004) +2. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15880-15889 (2023) +3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) +4. Hinton, G.E., Srivastava, N., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.R.: Improving neural networks by preventing co-adaptation of feature detectors. arXiv preprint arXiv:1207.0580 (2012) +5. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International conference on machine learning. pp. 448-456. pmlr (2015) +6. Kim, J., Hur, Y., Park, S., Yang, E., Hwang, S.J., Shin, J.: Distribution aligning refinery of pseudo-label for imbalanced semi-supervised learning. Advances in neural information processing systems 33, 14567-14579 (2020) + +17. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) +18. Krause, A., Perona, P., Gomes, R.: Discriminative clustering by regularized information maximization. Advances in neural information processing systems 23 (2010) +19. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009) +20. Kuo, C.W., Ma, C.Y., Huang, J.B., Kira, Z.: Featmatch: Feature-based augmentation for semi-supervised learning. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVIII 16. pp. 479-495. Springer (2020) +21. Lai, Z., Wang, C., Gunawan, H., Cheung, S.C.S., Chuah, C.N.: Smoothed adaptive weighting for imbalanced semi-supervised learning: Improve reliability against unknown distribution data. In: International Conference on Machine Learning. pp. 11828-11843. PMLR (2022) +22. Laine, S., Aila, T.: Temporal ensembling for semi-supervised learning. arXiv preprint arXiv:1610.02242 (2016) +23. Lee, H., Shin, S., Kim, H.: Abc: Auxiliary balanced classifier for class-imbalanced semi-supervised learning. Advances in Neural Information Processing Systems 34, 7082-7094 (2021) +24. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research 9(11) (2008) +25. Miyato, T., Maeda, S.i., Koyama, M., Ishii, S.: Virtual adversarial training: a regularization method for supervised and semi-supervised learning. IEEE transactions on pattern analysis and machine intelligence 41(8), 1979-1993 (2018) +26. Netzer, Y., Wang, T., Coates, A., Bissacco, A., Wu, B., Ng, A.Y.: Reading digits in natural images with unsupervised feature learning (2011) +27. Oh, Y., Kim, D.J., Kweon, I.S.: Daso: Distribution-aware semantics-oriented pseudo-label for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9786-9796 (2022) +28. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979) +29. Pham, H., Dai, Z., Xie, Q., Le, Q.V.: Meta pseudo labels. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11557-11568 (2021) +30. Rosenberg, C., Hebert, M., Schneiderman, H.: Semi-supervised self-training of object detection models (2005) +31. Sajjadi, M., Javanmardi, M., Tasdizen, T.: Regularization with stochastic transformations and perturbations for deep semi-supervised learning. Advances in neural information processing systems 29 (2016) +32. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020) +33. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. Advances in neural information processing systems 30 (2017) +34. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International conference on machine learning. pp. 6438-6447. PMLR (2019) + +35. Wang, Y., Chen, H., Heng, Q., Hou, W., Savvides, M., Shinozaki, T., Raj, B., Wu, Z., Wang, J.: Freematch: Self-adaptive thresholding for semi-supervised learning. arXiv preprint arXiv:2205.07246 (2022) +36. Wang, Y., Huang, G., Song, S., Pan, X., Xia, Y., Wu, C.: Regularizing deep networks with semantic data augmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(7), 3733-3748 (2021) +37. Wei, C., Sohn, K., Mellina, C., Yuille, A., Yang, F.: Crest: A class-rebalancing self-training framework for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10857-10866 (2021) +38. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020) +39. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: International Conference on Machine Learning. pp. 11525-11536. PMLR (2021) +40. Yang, L., Qi, L., Feng, L., Zhang, W., Shi, Y.: Revisiting weak-to-strong consistency in semi-supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7236-7246 (2023) +41. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016) +42. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. Advances in Neural Information Processing Systems 34, 18408-18419 (2021) +43. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017) +44. Zhao, Z., Zhou, L., Duan, Y., Wang, L., Qi, L., Shi, Y.: Dc-ssl: Addressing mismatched class distribution in semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9757-9765 (2022) +45. Zhou, T., Wang, S., Bilmes, J.: Time-consistent self-supervision for semi-supervised learning. In: International Conference on Machine Learning. pp. 11523-11533. PMLR (2020) +46. Zhu, X.J.: Semi-supervised learning literature survey (2005) \ No newline at end of file diff --git a/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/images.zip b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..b15800f007067c3a7712dd9f7f36fe347b0ef5fa --- /dev/null +++ b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a6bd0e5a548f54f299faf26f05c40b9477b5badb3b9772bc7434d677858a8f02 +size 438658 diff --git a/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/layout.json b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..1ffb8a0d58524062c6d047cddee3a0d98b81fd84 --- /dev/null +++ b/2024/Image-Feature Weak-to-Strong Consistency_ An Enhanced Paradigm for Semi-Supervised Learning/layout.json @@ -0,0 +1,9944 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 140, + 111, + 474, + 166 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 111, + 474, + 166 + ], + "spans": [ + { + "bbox": [ + 140, + 111, + 474, + 166 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency: An Enhanced Paradigm for Semi-Supervised Learning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 242, + 186, + 370, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 186, + 370, + 199 + ], + "spans": [ + { + "bbox": [ + 242, + 186, + 370, + 199 + ], + "type": "text", + "content": "Zhiyu Wu and Jinshi Cui" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 175, + 209, + 438, + 242 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 209, + 438, + 242 + ], + "spans": [ + { + "bbox": [ + 175, + 209, + 438, + 242 + ], + "type": "text", + "content": "National Key Laboratory of General Artificial Intelligence, School of Intelligence Science and Technology, Peking University wuzhiyu@pku.edu.cn, cjs@cis.pku.edu.cn" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 276, + 452, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 276, + 452, + 473 + ], + "spans": [ + { + "bbox": [ + 160, + 276, + 452, + 473 + ], + "type": "text", + "content": "Abstract. Image-level weak-to-strong consistency serves as the predominant paradigm in semi-supervised learning (SSL) due to its simplicity and impressive performance. Nonetheless, this approach confines all perturbations to the image level and suffers from the excessive presence of naive samples, thus necessitating further improvement. In this paper, we introduce feature-level perturbation with varying intensities and forms to expand the augmentation space, establishing the image-feature weak-to-strong consistency paradigm. Furthermore, our paradigm develops a triple-branch structure, which facilitates interactions between both types of perturbations within one branch to boost their synergy. Additionally, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing additional challenges exclusively for naive samples. Notably, our paradigm can seamlessly integrate with existing SSL methods. We apply the proposed paradigm to several representative algorithms and conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate a significant enhancement in the performance of existing SSL algorithms." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 484, + 455, + 507 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 484, + 455, + 507 + ], + "spans": [ + { + "bbox": [ + 160, + 484, + 455, + 507 + ], + "type": "text", + "content": "Keywords: Feature-Level Perturbation " + }, + { + "bbox": [ + 160, + 484, + 455, + 507 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 484, + 455, + 507 + ], + "type": "text", + "content": " Image-Feature Weak-to-Strong Consistency " + }, + { + "bbox": [ + 160, + 484, + 455, + 507 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 484, + 455, + 507 + ], + "type": "text", + "content": " Naive Sample Identification" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 529, + 230, + 542 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 529, + 230, + 542 + ], + "spans": [ + { + "bbox": [ + 133, + 529, + 230, + 542 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": "Semi-supervised learning (SSL) [4,30,32,46], a research topic that aims to reduce manual labeling costs by capitalizing on unlabeled data, has received considerable attention in recent years. Among the proposed methods, the image-level weak-to-strong consistency paradigm introduced by FixMatch [32] has proven highly effective in leveraging the potential of unlabeled data. Specifically, FixMatch applies varying intensities of image-level perturbations to raw samples and encourages consistent predictions between corresponding weakly and strongly augmented views. Subsequent studies have refined this paradigm primarily in two aspects: (1) improving the utilization ratio of unlabeled data by replacing" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 113, + 478, + 209 + ], + "blocks": [ + { + "bbox": [ + 132, + 113, + 478, + 209 + ], + "lines": [ + { + "bbox": [ + 132, + 113, + 478, + 209 + ], + "spans": [ + { + "bbox": [ + 132, + 113, + 478, + 209 + ], + "type": "image", + "image_path": "fbe950051e79bbca3da2aa9dd81b28ffebb497ba22a8f72be996de31c07cd040.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "lines": [ + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "spans": [ + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{x}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " : weak/strong image-level perturbation; " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "p^{\\tau_{w}} / p^{\\tau_{x}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " : predictions of samples subjected to " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{z}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " . " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{w}} / \\mathcal{A}^{T_{x}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " : weak/strong feature-level perturbation; " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "p^{\\tau_{w},T_{x}} / p^{\\tau_{x},T_{w}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " : predictions of samples that undergo " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{w}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{x}} / \\mathcal{A}^{T_{z}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{w}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " . " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "f^{in} / f^{out}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " : input/output feature maps of feature-level perturbation; adaptive " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{w}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " : incorporating " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{T_{x}}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " solely for naive samples recognized by the confidence-based identification strategy; " + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "inline_equation", + "content": "\\tau ,\\tau_{t}" + }, + { + "bbox": [ + 136, + 209, + 463, + 243 + ], + "type": "text", + "content": " : threshold mechanisms; stopping gradients; : shared parameters; teacher branch; student branch;" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_footnote" + }, + { + "bbox": [ + 131, + 255, + 482, + 288 + ], + "lines": [ + { + "bbox": [ + 131, + 255, + 482, + 288 + ], + "spans": [ + { + "bbox": [ + 131, + 255, + 482, + 288 + ], + "type": "text", + "content": "Fig. 1: Overview of the old (left) and proposed (right) paradigms. Our paradigm introduces feature-level perturbation to expand the augmentation space and facilitates direct interactions between both types of perturbations to boost their synergy." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 315, + 482, + 375 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 315, + 482, + 375 + ], + "spans": [ + { + "bbox": [ + 130, + 315, + 482, + 375 + ], + "type": "text", + "content": "the constant threshold in FixMatch with a dynamic threshold [35,42] and (2) facilitating balanced predictions across different classes via refining pseudo-labels based on historical predictions [3,5]. Extensive experiments have demonstrated the effectiveness of these methods in enhancing the image-level weak-to-strong consistency paradigm." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 376, + 482, + 484 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 376, + 482, + 484 + ], + "spans": [ + { + "bbox": [ + 130, + 376, + 482, + 484 + ], + "type": "text", + "content": "Despite the success of the established paradigm, two challenges persist. Firstly, the existing paradigm confines all perturbations to the image level, thus impeding the exploration of a broader augmentation space and consistency at non-image levels. Secondly, as revealed in [12], a notable proportion of samples, even undergoing strong image-level perturbation, continues to be accurately classified with high confidence, resulting in a loss close to zero. These instances (some examples are shown in Fig. 5), referred to as naive samples, are well-learned and thus fail to boost the model's performance. Therefore, relying solely on image-level perturbation proves insufficient to fully exploit the potential of unlabeled data." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": "To address the aforementioned challenges, we introduce a novel SSL paradigm named Image-Feature Weak-to-Strong Consistency (IFMatch). An overview of the conventional and proposed approaches is shown in Fig. 1. The primary innovation of our method lies in feature-level perturbation, which is motivated by earlier findings that regularizers effective in the input space can be extended to hidden representations [14, 15, 34]. Specifically, feature-level perturbation randomly alters intermediate features in the backbone, establishing the basis for feature-level consistency regulation. Furthermore, to achieve effective feature-level perturbation, we present refined designs focusing on position and strategy. For the perturbation position, we identify two positions to induce weak and strong feature-level perturbations, respectively. Regarding the perturbation strategy, we develop a series of approaches from three perspectives ('movement', 'dropout', and 'value'), thereby comprehensively exploring the feature augmentation space. Note that the proposed feature-level perturbation is sample-agnostic and thus differs from previous class-based feature augmentation techniques [20, 36]." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 415 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 415 + ], + "type": "text", + "content": "Building upon well-crafted augmentation techniques, we introduce the integration of two types of perturbations as another innovation. Our preliminary investigation (Tab. 3) reveals that a direct fusion of strong image-level and feature-level augmentation engenders destructive perturbations. To mitigate this issue, we propose a triple-branch structure to combine these two perturbation forms in a milder manner, as depicted in Fig. 1. Specifically, the teacher branch, mirroring its counterpart in the existing paradigm, employs predictions from samples subjected to weak image-level perturbation as pseudo-labels. Moreover, the first student branch integrates weak image-level perturbation and strong feature-level perturbation to thoroughly explore the feature augmentation space. Given limited prior research on feature-level perturbation, we delve deeper into the optimal threshold for this branch, revealing a preference for a high constant threshold over a dynamic one. In the second student branch, we combine weak feature-level perturbation with strong image-level perturbation, posing additional challenges for recognizing naive samples. However, the fused perturbation proves excessively arduous for classifying hard samples. Accordingly, we devise a confidence-based identification strategy to dynamically distinguish between naive and challenging samples, thereby introducing weak feature-level perturbation exclusively for naive samples. As the second branch predominantly relies on image-level perturbation, it can seamlessly integrate with existing threshold mechanisms. Prior to our study, UniMatch [40] uses feature-level perturbation and a multi-branch structure in semi-supervised semantic segmentation. However, their method is limited to the channel-wise dropout strategy and fails to achieve interactions between the two types of perturbations within a single branch, setting it apart from our paradigm. In summary, our contributions can be outlined as follows." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 415, + 480, + 559 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 130, + 415, + 479, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 479, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 479, + 462 + ], + "type": "text", + "content": "(1) We introduce the image-feature weak-to-strong consistency paradigm for semi-supervised learning, where the feature-level perturbation and the integration of two types of perturbation within each branch serve as the fundamental enhancement compared to previous methods." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 464, + 480, + 486 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 464, + 480, + 486 + ], + "spans": [ + { + "bbox": [ + 131, + 464, + 480, + 486 + ], + "type": "text", + "content": "(2) We meticulously design the position and strategy of feature-level perturbation to diversify its intensity and form." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 487, + 480, + 522 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 487, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 131, + 487, + 480, + 522 + ], + "type": "text", + "content": "(3) We devise a confidence-based identification strategy to discriminate between naive and challenging samples, thereby introducing extra challenges solely for naive samples in the second student branch." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 523, + 480, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 523, + 480, + 559 + ], + "spans": [ + { + "bbox": [ + 131, + 523, + 480, + 559 + ], + "type": "text", + "content": "(4) We conduct experiments on multiple benchmarks, including both balanced and imbalanced distributions for labeled samples. The results demonstrate significant promotion of existing algorithms when following our paradigm." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 578, + 237, + 592 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 237, + 592 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 237, + 592 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "content": "Consistency regulation [2] represents a fundamental approach to leveraging the potential of unlabeled data. Its core objective is to ensure consistent predictions across diverse perturbed views of the same sample. Various perturbation methods have been explored, such as stochastic augmentation [22, 31], adversarial attack [25], and mixup [43]. Additionally, FixMatch [32] applies strong" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "data augmentation techniques [7] to raw images, establishing the image-level weak-to-strong consistency paradigm. This paradigm significantly streamlines the framework and marks a pivotal milestone in semi-supervised learning." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 480, + 283 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 480, + 283 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 480, + 283 + ], + "type": "text", + "content": "Follow-up studies refine FixMatch along two dimensions: the utilization ratio of unlabeled data and fairness considerations. Regarding the former, numerous dynamic threshold strategies have been proposed. For example, FlexMatch [42] maps the predefined threshold to class-specific thresholds based on class-wise learning status. SoftMatch [5] models sample weights by a dynamic Gaussian function, maintaining a soft margin between unlabeled samples of different confidence levels. FreeMatch [35] utilizes the confidence on unlabeled data as the adaptive threshold. Moreover, the concept of fairness stems from entropy-based regulation [1,11,16,18,44]. The most representative strategy in this context, Distribution Alignment [3], encourages equal-frequency predictions across classes by refining pseudo-labels based on overall predictions within the unlabeled set." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 284, + 481, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 284, + 481, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 481, + 439 + ], + "type": "text", + "content": "Concurrently, several studies express similar concerns to the old paradigm. FeatMatch [20] and ISDA [36] prevent the exclusive reliance on image-level perturbation by devising class-based feature augmentation approaches. In contrast, our proposed feature-level perturbation is sample-agnostic, circumventing harmful perturbations derived from erroneous pseudo-labels. Additionally, UniMatch [40] uses channel-wise dropout to establish an auxiliary branch for feature-level perturbation. In comparison, we present feature-level perturbations with varying intensities and forms, further combining them with image-level perturbations within each branch to boost their synergy. Besides, [12] observes excessive naive samples and applies more aggressive image-level augmentation to these samples. To address this issue, we propose a confidence-based identification strategy to effectively distinguish between naive and challenging samples and introduce weak feature-level perturbation exclusively for naive samples." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 456, + 233, + 470 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 233, + 470 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 233, + 470 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 480, + 369, + 493 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 480, + 369, + 493 + ], + "spans": [ + { + "bbox": [ + 131, + 480, + 369, + 493 + ], + "type": "text", + "content": "3.1 Image-Level Weak-to-Strong Consistency" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "spans": [ + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": "We begin by reviewing the image-level weak-to-strong consistency paradigm, as depicted in the left part of Fig. 1. Let " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_L = \\{(x_i,y_i)\\}_{i = 1}^{N_L}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_U = \\{u_i\\}_{i = 1}^{N_U}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": " represent the labeled and unlabeled datasets, respectively. Here, " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "x_{i}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "u_{i}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": " denote the labeled and unlabeled training samples, and " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "y_{i}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": " refers to the one-hot label for the labeled sample " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "x_{i}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": ". We denote the prediction of sample " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": " as " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "p(y|x)" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": ". Given a batch of labeled and unlabeled data, the model is optimized with the objective " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "\\mathcal{L} = \\mathcal{L}_s + \\lambda_u\\mathcal{L}_u" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": ". Specifically, " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_s" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": " indicates the cross-entropy loss (" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "\\mathcal{H}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": ") for the labeled batch of size " + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "inline_equation", + "content": "B_{L}" + }, + { + "bbox": [ + 130, + 499, + 482, + 595 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 249, + 602, + 481, + 634 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 249, + 602, + 481, + 634 + ], + "spans": [ + { + "bbox": [ + 249, + 602, + 481, + 634 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {s} = \\frac {1}{B _ {L}} \\sum_ {i = 1} ^ {B _ {L}} \\mathcal {H} \\left(y _ {i}, p \\left(y \\mid x _ {i}\\right)\\right) \\tag {1}", + "image_path": "8e1dc98be9f5c6ec3f63805334b914f08fb5a3f8ef82cb1122763f7f309dea38.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": "On the other hand, " + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_u" + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": " signifies the image-level consistency regulation between the prediction of the strongly augmented view " + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{T}_s}(u)" + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": " and the pseudo-label" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 194, + 117, + 416, + 191 + ], + "blocks": [ + { + "bbox": [ + 194, + 117, + 416, + 191 + ], + "lines": [ + { + "bbox": [ + 194, + 117, + 416, + 191 + ], + "spans": [ + { + "bbox": [ + 194, + 117, + 416, + 191 + ], + "type": "image", + "image_path": "382aaf22fe6b077f6da4ee40038786e52a39e57fc20fa7735e2be1881046f498.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "lines": [ + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "spans": [ + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "type": "text", + "content": "Fig. 2: Candidate positions for introducing feature-level perturbation. Position A perturbs the output of the residual block, representing strong feature-level perturbation " + }, + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "type": "text", + "content": ". Position B perturbs the output of a random convolution within the residual component, corresponding to weak feature-level perturbation " + }, + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "type": "inline_equation", + "content": "x^{in} / x^{out}" + }, + { + "bbox": [ + 131, + 198, + 482, + 253 + ], + "type": "text", + "content": " denotes input/output feature maps of the residual block." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "text", + "content": "sourced from the corresponding weakly augmented view " + }, + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_w}(u)" + }, + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "text", + "content": ". To mitigate incorrect pseudo-labels, FixMatch [32] introduces a constant threshold, and subsequent studies propose various dynamic threshold strategies. Without loss of generality, we denote the threshold as " + }, + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "inline_equation", + "content": "\\tau_t" + }, + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "text", + "content": " and define " + }, + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_u" + }, + { + "bbox": [ + 130, + 276, + 482, + 324 + ], + "type": "text", + "content": " as follows." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 211, + 332, + 481, + 365 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 332, + 481, + 365 + ], + "spans": [ + { + "bbox": [ + 211, + 332, + 481, + 365 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {u} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau_ {t}\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {s}}\\right) \\tag {2}", + "image_path": "0c8de25376d022fd04adf46860510a17d0c8bde93a3b3dbfa481e236f08dc9a2.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "spans": [ + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "p_i^{\\mathcal{I}_w}" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": " is the abbreviation of " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "DA(p(y|\\mathcal{A}^{\\mathcal{I}_w}(u_i)))" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "DA" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": " indicates the distribution alignment strategy [3]. " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\hat{p}_i^{\\mathcal{T}_w}" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": " denotes the one-hot pseudo-label obtained from " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\text{argmax}(p_i^{\\mathcal{I}_w})" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": ". Moreover, " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "p_i^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": " stands for " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "p(y|\\mathcal{A}^{\\mathcal{I}_s}(u_i))" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": ". Lastly, " + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "inline_equation", + "content": "B_U" + }, + { + "bbox": [ + 131, + 374, + 482, + 425 + ], + "type": "text", + "content": " corresponds to the batch size of unlabeled data." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 442, + 298, + 453 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 442, + 298, + 453 + ], + "spans": [ + { + "bbox": [ + 131, + 442, + 298, + 453 + ], + "type": "text", + "content": "3.2 Feature-Level Perturbation" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 462, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 481, + 510 + ], + "type": "text", + "content": "To avoid the exclusive reliance on image-level perturbation, this paper introduces feature-level perturbation varied in intensity and form, thereby expanding the augmentation space. In the following parts, we will elaborate on the implementation of feature-level perturbation regarding its position and strategy." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 511, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 511, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 511, + 482, + 666 + ], + "type": "text", + "content": "Position refers to where the feature-level perturbation is introduced. Given that WideResNet [41] is the prevailing backbone in SSL, we employ its basic component, the residual block [13] with pre-activation, as an illustrative example. Building upon previous studies that exploit feature-level regularizers directly after the convolution [14, 15, 34], we identify two positions for introducing feature-level perturbation, as depicted in Fig. 2. In position A, the method perturbs the summation of the residual and identity connections, i.e., the output of the residual block. As position A acts as the bottleneck for feedforward, perturbation at position A exhibits high intensity and is therefore regarded as strong feature-level perturbation " + }, + { + "bbox": [ + 130, + 511, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 130, + 511, + 482, + 666 + ], + "type": "text", + "content": ". Additionally, position B perturbs the output of a random convolution within the residual component, which is relatively milder than position A. Therefore, perturbation at position B is considered as weak feature-level perturbation " + }, + { + "bbox": [ + 130, + 511, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 130, + 511, + 482, + 666 + ], + "type": "text", + "content": ". It is worth noting that both" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "position choices are applicable to all residual blocks, and the algorithm randomly selects one position at each iteration to insert feature-level perturbation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 332 + ], + "type": "text", + "content": "Strategy denotes the operation of feature-level perturbation. We first review strong image-level perturbation strategies " + }, + { + "bbox": [ + 130, + 140, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 140, + 482, + 332 + ], + "type": "text", + "content": " [7], which can be roughly divided into three groups: 'movement', 'dropout', and 'value'. Specifically, 'movement' comprises spatial perturbations like translation and shearing, 'dropout' corresponds to the Cutout technique [9], and 'value' represents operations that modify pixel values while preserving pixel relationships, such as adjusting contrast, brightness, and histogram. Considering the effectiveness of " + }, + { + "bbox": [ + 130, + 140, + 482, + 332 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 140, + 482, + 332 + ], + "type": "text", + "content": ", we develop feature-level perturbation strategies from the same perspectives. For 'movement', we implement feature map translation and shearing along the X-axis and Y-axis. Regarding 'dropout', we apply channel-wise and spatial-wise dropout on hidden representations. Concerning 'value', we employ random-sized convolutions to achieve local smoothing, subsequently using the weighted sum of smoothed and input feature maps as the output. During training, the model randomly selects one candidate strategy at each iteration to perturb hidden representations at the selected position. For the detailed implementation of feature-level perturbation strategies, please refer to Appendix Sec.1." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 346, + 379, + 358 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 346, + 379, + 358 + ], + "spans": [ + { + "bbox": [ + 131, + 346, + 379, + 358 + ], + "type": "text", + "content": "3.3 Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 362, + 482, + 457 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 362, + 482, + 457 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 482, + 457 + ], + "type": "text", + "content": "Building upon well-designed image-level and feature-level perturbations, we can integrate them to achieve consistency regulation in both dimensions. Intuitively, a trivial approach is combining strong image-level and feature-level perturbations in one branch to construct a dual-branch structure similar to the old paradigm. However, such a toy paradigm engenders destructive perturbations according to our pilot study (Tab. 3). Accordingly, we integrate these two forms of perturbations in a more moderate manner, developing the image-feature weak-to-strong consistency paradigm (IFMatch) depicted in the right part of Fig. 1." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "text", + "content": "Our paradigm retains the traditional teacher branch, utilizing predictions " + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "inline_equation", + "content": "\\hat{p}^{\\mathcal{T}_w}" + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "text", + "content": " of samples subjected to weak image-level perturbation as pseudo-labels. Furthermore, we introduce two student branches to integrate both types of perturbations. Mathematically, given a batch of labeled and unlabeled data, the model is optimized using the objective " + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "inline_equation", + "content": "\\mathcal{L} = \\mathcal{L}_s + \\lambda_u(\\mathcal{L}_{u_1} + \\mathcal{L}_{u_2})" + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_s" + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "text", + "content": " denotes the cross-entropy loss for labeled data, and " + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{u_1}" + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{u_2}" + }, + { + "bbox": [ + 130, + 458, + 482, + 541 + ], + "type": "text", + "content": " represent the consistency regulation for unlabeled data in the two student branches respectively." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "text", + "content": "In the first student branch, we integrate weak image-level perturbation " + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{T}_w}" + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "text", + "content": " and strong feature-level perturbation " + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "text", + "content": " to comprehensively explore the feature perturbation space. Furthermore, we employ the constant threshold " + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "text", + "content": " adopted in FixMatch to filter out incorrect pseudo-labels. This choice arises from the observation that existing dynamic threshold mechanisms are less suitable for " + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "text", + "content": ", especially in challenging tasks. Thus, the unsupervised loss " + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{u_1}" + }, + { + "bbox": [ + 130, + 542, + 482, + 625 + ], + "type": "text", + "content": " in the first student branch can be expressed as follows." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 206, + 632, + 481, + 663 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 206, + 632, + 481, + 663 + ], + "spans": [ + { + "bbox": [ + 206, + 632, + 481, + 663 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {u _ {1}} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {w}, \\mathcal {F} _ {s}}\\right) \\tag {3}", + "image_path": "1d49f7e1fb005651047e2a89d3463bcbb121de8a7eb87b367ad09c79a8961611.jpg" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 138, + 134, + 468, + 342 + ], + "blocks": [ + { + "bbox": [ + 139, + 119, + 448, + 132 + ], + "lines": [ + { + "bbox": [ + 139, + 119, + 448, + 132 + ], + "spans": [ + { + "bbox": [ + 139, + 119, + 448, + 132 + ], + "type": "text", + "content": "Algorithm 1: Image-Feature Weak-to-Strong Consistency (IFMatch)" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "lines": [ + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "spans": [ + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": "Input: labeled data " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_L = \\{(x_i,y_i)\\}_{i = 1}^{N_L}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , unlabeled data " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_U = \\{u_i\\}_{i = 1}^{N_U}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , batch sizes " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "B_{L}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "B_{U}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , loss weight " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\lambda_{u}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , total iterations " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , perturbations " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{A}^{\\mathcal{I}_w},\\mathcal{A}^{\\mathcal{I}_s},\\mathcal{A}^{\\mathcal{F}_w},\\mathcal{A}^{\\mathcal{F}_s}\\}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , constant threshold " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , threshold mechanism " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\tau_{t}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , target confidence " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\{h_1,h_2,\\dots ,h_{N_U}\\}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , mask " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{M}_1,\\mathcal{M}_2,\\dots ,\\mathcal{M}_{N_U}\\}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " \n1 for " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "t\\gets 1" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " do // the same parts as the old paradigm \n2 Compute supervised loss " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_s" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , pseudo-labels " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "p^{\\mathcal{I}_w}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\hat{p}^{\\mathcal{I}_w}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " , and threshold " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\tau_t" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " . // the first student branch \n3 Compute predictions " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "p^{\\mathcal{I}_w,\\mathcal{F}_s}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " and loss " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{u_1}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " using Eq. (3); // the second student branch \n4 Decide whether to introduce " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "u_{i}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " in the second student branch according to the mask " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_i" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " using Eq. (6) and Eq. (7); \n5 Compute predictions " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "p^{\\mathcal{I}_s,\\mathcal{F}_w}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " and loss " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{u_2}" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " using Eq. (4); // update model \n6 Back-propagate loss " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{L} = \\mathcal{L}_s + \\lambda_u(\\mathcal{L}_{u_1} + \\mathcal{L}_{u_2})" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " and update parameters ; // Confidence-based identification strategy \n7 Record target confidence " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "h_i = p_{i,j}^{\\mathcal{I}_s,\\mathcal{F}_w}(j = \\hat{p}_i^{\\mathcal{I}_w})" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " and mask " + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_i = \\mathbb{1}(h_i\\geq \\tau_t)" + }, + { + "bbox": [ + 138, + 134, + 468, + 342 + ], + "type": "text", + "content": " \n8 end" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 132, + 367, + 397, + 381 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 367, + 397, + 381 + ], + "spans": [ + { + "bbox": [ + 132, + 367, + 397, + 381 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 132, + 367, + 397, + 381 + ], + "type": "inline_equation", + "content": "p_i^{\\mathcal{I}_w,\\mathcal{F}_s}" + }, + { + "bbox": [ + 132, + 367, + 397, + 381 + ], + "type": "text", + "content": " denotes the prediction of " + }, + { + "bbox": [ + 132, + 367, + 397, + 381 + ], + "type": "inline_equation", + "content": "u_{i}" + }, + { + "bbox": [ + 132, + 367, + 397, + 381 + ], + "type": "text", + "content": " in the first branch." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": "In the second student branch, we combine strong image-level perturbation " + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": " and weak feature-level perturbation " + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": " to provide additional challenges in recognizing naive samples. However, a direct fusion of " + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": " poses obstacles in classifying hard samples. Accordingly, we present a confidence-based identification strategy to distinguish between naive and challenging samples, thus introducing extra challenges exclusively for naive samples, which will be detailed in Sec. 3.4. Moreover, given the central role of " + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": ", we leverage existing threshold mechanisms " + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\tau_t" + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": " to exclude misleading pseudo-labels, facilitating seamless integration with previous algorithms. Consequently, the unsupervised loss " + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{u_2}" + }, + { + "bbox": [ + 130, + 381, + 482, + 501 + ], + "type": "text", + "content": " in the second branch can be defined as follows." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 202, + 505, + 481, + 537 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 505, + 481, + 537 + ], + "spans": [ + { + "bbox": [ + 202, + 505, + 481, + 537 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {u _ {2}} = \\frac {1}{B _ {U}} \\sum_ {i = 1} ^ {B _ {U}} \\mathbb {1} \\left(\\max \\left(p _ {i} ^ {\\mathcal {I} _ {w}}\\right) \\geq \\tau_ {t}\\right) \\mathcal {H} \\left(\\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}, p _ {i} ^ {\\mathcal {I} _ {s}, \\mathcal {F} _ {w}}\\right) \\tag {4}", + "image_path": "9ffc9b86065a6e3f3c797dbcd5aaf3934c643decca9932c2c07efe5d4646b43a.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_i^{\\mathcal{I}_s, \\mathcal{F}_w}" + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "content": " represents the prediction of sample " + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "inline_equation", + "content": "u_i" + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "content": " in the second branch. Particularly, the use of distinct thresholds in the two student branches is motivated not only by experiments (Tab. 5) but also by an inherent rationale. Specifically, the threshold serves to balance the utilization ratio of unlabeled data and pseudolabel accuracy [5, 35]. Furthermore, " + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "content": " act as the central driving forces behind the respective student branch. Due to the unique characteristics of " + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 544, + 482, + 666 + ], + "type": "text", + "content": ", they exhibit varying preferences in the trade-off between the utilization and pseudo-label accuracy, resulting in the different desired threshold mechanisms in the two student branches. For a further understanding of our paradigm, please refer to Algorithm 1." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 194, + 114, + 422, + 190 + ], + "blocks": [ + { + "bbox": [ + 194, + 114, + 422, + 190 + ], + "lines": [ + { + "bbox": [ + 194, + 114, + 422, + 190 + ], + "spans": [ + { + "bbox": [ + 194, + 114, + 422, + 190 + ], + "type": "image", + "image_path": "130ce1eaed085c06bf572a8c3bec33c0be4b50e31fbff743f35cb63d192525e6.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 197, + 482, + 242 + ], + "lines": [ + { + "bbox": [ + 131, + 197, + 482, + 242 + ], + "spans": [ + { + "bbox": [ + 131, + 197, + 482, + 242 + ], + "type": "text", + "content": "Fig. 3: Overview of the confidence-based identification strategy. The approach records sample-wise target confidence in the second student branch and identifies naive samples by comparing the confidence with the threshold in the second student branch. " + }, + { + "bbox": [ + 131, + 197, + 482, + 242 + ], + "type": "inline_equation", + "content": "w/" + }, + { + "bbox": [ + 131, + 197, + 482, + 242 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 197, + 482, + 242 + ], + "type": "inline_equation", + "content": "w/o" + }, + { + "bbox": [ + 131, + 197, + 482, + 242 + ], + "type": "text", + "content": " abbreviates with and without, respectively." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 264, + 321, + 276 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 264, + 321, + 276 + ], + "spans": [ + { + "bbox": [ + 132, + 264, + 321, + 276 + ], + "type": "text", + "content": "3.4 Confidence-Based Identification" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "text", + "content": "As analyzed in Sec. 3.3, the combination of strong image-level perturbation " + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "text", + "content": " and weak feature-level perturbation " + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "text", + "content": " poses supplementary challenges for naive samples yet incurs exceeding difficulty for hard ones. Likewise, previous research has encountered similar challenges in expanding the augmentation space. For example, UniMatch [40] observes a performance degradation caused by the concatenation of channel-wise dropout and " + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "text", + "content": " and finally denies the feasibility of combining " + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 284, + 482, + 439 + ], + "type": "text", + "content": " within one branch. Besides, [12] imposes more aggressive image-level perturbations exclusively on naive samples. To distinguish between naive and challenging samples, their approach records sample-wise loss and utilizes the OTSU [28] method for distinction. However, OTSU is conventionally applied to the segmentation of bimodal gray-scale images, whereas the histogram of loss values typically exhibits a descending trend. As shown in Fig. 4, their approach tends to produce identification biased toward naive samples." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "spans": [ + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "text", + "content": "To effectively identify the naive samples, we propose a confidence-based identification strategy, which is depicted in Fig. 3. Similar to the threshold-based rule for pseudo-label filtering that only predictions exceeding the confidence threshold qualify as pseudo-labels, the proposed strategy can be succinctly concluded as: 'only strongly augmented samples " + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}(u)" + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "text", + "content": " with target confidence exceeding the threshold are considered naive and necessitate additional weak feature-level perturbation " + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "text", + "content": ". Specifically, the approach comprises two steps. Firstly, we record the confidence linked to the pseudo-label within the predicted distribution of the second branch. Mathematically, the target confidence " + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "inline_equation", + "content": "h_i" + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "text", + "content": " for sample " + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "inline_equation", + "content": "u_i" + }, + { + "bbox": [ + 131, + 440, + 483, + 559 + ], + "type": "text", + "content": " in the second student branch can be obtained as follows." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 257, + 566, + 481, + 583 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 566, + 481, + 583 + ], + "spans": [ + { + "bbox": [ + 257, + 566, + 481, + 583 + ], + "type": "interline_equation", + "content": "h _ {i} = p _ {i, j} ^ {\\mathcal {I} _ {s}, \\mathcal {F} _ {w}} (j = \\hat {p} _ {i} ^ {\\mathcal {I} _ {w}}) \\tag {5}", + "image_path": "b098b1efa47e37316c1afb14298d9e76a5adce64556185ba10b0598b80030722.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": "It is important to clarify that " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_i^{\\mathcal{I}_s, \\mathcal{F}_w}" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": " solely represents the prediction of sample " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "u_i" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": " in the second branch and has nothing to do with the introduction of " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "u_i" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": ". Secondly, the algorithm generates a binary mask for each sample to determine whether to introduce additional " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": " by comparing the target confidence with the threshold " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\tau_t" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": " in the second student branch. Consequently, the mask for sample " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "u_i" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": ", denoted as " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_i" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": ", and the perturbations applied to " + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "inline_equation", + "content": "u_i" + }, + { + "bbox": [ + 131, + 592, + 482, + 666 + ], + "type": "text", + "content": " in the second student" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 213, + 481, + 387 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "text", + "content": "Table 1: Accuracy " + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "inline_equation", + "content": "(\\%)" + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "text", + "content": " on four benchmarks with varying numbers of labels. Bold indicates the best performance, and underline denotes the second best. We omit the standard deviation of performance, as the proposed paradigm performs stable across different random seeds. IFMatch " + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "inline_equation", + "content": "(^{*})" + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "text", + "content": " represents the proposed paradigm using the threshold mechanism of " + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "inline_equation", + "content": "^*" + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "text", + "content": " in the second student branch. In Particular, given that SoftMatch proposes a sample weight strategy rather than a threshold scheme, IFMatch (Soft) inherits its weight scheme when computing " + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{u_2}" + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "text", + "content": " and replaces the " + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "inline_equation", + "content": "\\tau_{t}" + }, + { + "bbox": [ + 130, + 114, + 482, + 202 + ], + "type": "text", + "content": " in Eq. (6) with the mean value of the dynamic Gaussian in SoftMatch when identifying naive samples." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 213, + 481, + 387 + ], + "lines": [ + { + "bbox": [ + 133, + 213, + 481, + 387 + ], + "spans": [ + { + "bbox": [ + 133, + 213, + 481, + 387 + ], + "type": "table", + "html": "
DatasetsCIFAR-10CIFAR-100SVHNSTL-10ImageNet
# Label402504000400250010000401000401000100k400k
VAT [25]25.3458.9789.4914.8053.1667.8625.2595.8925.2662.05--
MeanTeacher [33]29.9162.5491.9018.8954.8368.2563.9196.7328.2866.10--
MixMatch [4]63.8186.3793.3432.4160.2472.2269.4096.3145.0778.30--
ReMixMatch [3]90.1293.7095.1657.2573.9779.9875.9694.8467.8893.26--
UDA [38]89.3894.8495.7153.6172.2777.5194.8898.1162.5893.36--
Dash [39]91.0794.8495.6455.1872.8578.1297.8198.0365.4893.61--
MPL [29]93.3894.2495.4553.7472.2978.2690.6797.7264.2493.34--
FixMatch [32]92.5395.1495.7953.5871.9777.8096.1998.0464.0393.7556.3467.72
IFMatch (Fix)95.8295.9796.4966.2674.6580.0197.7598.1578.5495.2861.2671.48
FlexMatch [42]95.0395.0295.8160.0673.5178.1091.8193.2870.8594.2358.1568.69
IFMatch (Flex)95.9095.9996.4266.2875.0379.8797.7698.0479.8395.2461.7571.14
SoftMatch [5]95.0995.1895.9662.9073.3477.9797.6797.9978.5894.2759.4370.51
IFMatch (Soft)95.8495.9396.3667.0274.9979.9698.0498.2282.4695.2262.4471.66
FreeMatch [35]95.1095.1295.9062.0273.5378.3298.0398.0484.4494.3758.4869.48
IFMatch (Free)95.8396.0296.4466.6575.1680.0898.0898.1884.7595.2961.6971.30
", + "image_path": "8fa29abb48116dc3361c10493367ab21eff9aa93d38ae2fc27e6fd5906e9becd.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 398, + 289, + 410 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 398, + 289, + 410 + ], + "spans": [ + { + "bbox": [ + 132, + 398, + 289, + 410 + ], + "type": "text", + "content": "branch can be expressed as follows." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 276, + 418, + 480, + 430 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 276, + 418, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 276, + 418, + 480, + 430 + ], + "type": "interline_equation", + "content": "\\mathcal {M} _ {i} = \\mathbb {1} \\left(h _ {i} \\geq \\tau_ {t}\\right) \\tag {6}", + "image_path": "20e156b56fae6092bffb72d21d3e438237eea6b5752a0fe51f79b4ee706a656e.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 203, + 434, + 480, + 466 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 203, + 434, + 480, + 466 + ], + "spans": [ + { + "bbox": [ + 203, + 434, + 480, + 466 + ], + "type": "interline_equation", + "content": "\\text {P e r t u r b a t i o n s f o r} u _ {i} = \\left\\{ \\begin{array}{l l} \\left\\{\\mathcal {A} ^ {\\mathcal {I} _ {s}}, \\mathcal {A} ^ {\\mathcal {F} _ {w}} \\right\\} & \\mathcal {M} _ {i} = 1 \\\\ \\left\\{\\mathcal {A} ^ {\\mathcal {I} _ {s}} \\right\\} & \\mathcal {M} _ {i} = 0 \\end{array} \\right. \\tag {7}", + "image_path": "3fb906cf247f7b05050dfbfaea486182b703cd33966c96b3c756fcb0ac6aa49f.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 472, + 482, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 509 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 509 + ], + "type": "text", + "content": "The approach dynamically updates " + }, + { + "bbox": [ + 130, + 472, + 482, + 509 + ], + "type": "inline_equation", + "content": "\\mathcal{M}_i" + }, + { + "bbox": [ + 130, + 472, + 482, + 509 + ], + "type": "text", + "content": " throughout the training process, thereby considering both the learning status of individual samples and model performance when introducing " + }, + { + "bbox": [ + 130, + 472, + 482, + 509 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 130, + 472, + 482, + 509 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 526, + 230, + 540 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 526, + 230, + 540 + ], + "spans": [ + { + "bbox": [ + 132, + 526, + 230, + 540 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 550, + 342, + 563 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 550, + 342, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 550, + 342, + 563 + ], + "type": "text", + "content": "4.1 Balanced Semi-Supervised Learning" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "Settings. We conduct experiments on multiple benchmarks, including CIFAR-10/100 [19], SVHN [26], STL-10 [6], and ImageNet [8], with various numbers of labeled samples. In the context of balanced SSL, we maintain a balanced distribution for labeled samples. The choice of backbone architecture adheres to established practices, employing specific models for different datasets: WRN-28-2 [41] for CIFAR-10 and SVHN, WRN-28-8 for CIFAR-100, WRN-37-2 [45] for STL-10, and ResNet-50 [13] for ImageNet. As for training parameters, we follow the unified codebase TorchSSL [42] to ensure fair comparisons. Specifically, batch" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "sizes " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "B_{L}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "B_{U}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " are set to 128 and 128 on ImageNet and 64 and 448 on the remaining datasets. Moreover, the model is trained using the SGD optimizer with an initial learning rate of 0.03 and a momentum decay of 0.9. The learning rate is adjusted by a cosine decay scheduler over a total of " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "2^{20}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " steps. Besides, we train the EMA model with a momentum decay of 0.999 for inference. The fixed threshold " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " in the first branch is set to 0.95. For SVHN, we follow previous studies [35, 39] and constrain the dynamic threshold within the range of [0.9, 1.0]. To suppress randomness, we repeat each experiment three times and report the average accuracy in Tab. 1. We omit the standard deviation given the stable performance of the proposed paradigm across different random seeds." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": "Performance. We apply the proposed paradigm (IFMatch) to several algorithms and compare their performance with existing methods on multiple benchmarks. The results presented in Tab. 1 underscore the significant contribution of our paradigm to promoting the performance of existing SSL algorithms. Specifically, the four algorithms involved achieve the average improvement of " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "4.05\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "3.22\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "1.62\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "1.39\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": " across all datasets. Moreover, previous methods struggle to enhance performance on less challenging tasks, such as CIFAR-10. In contrast, when integrated with the proposed paradigm, IFMatch (Fix) outperforms FixMatch by " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "2.29\\% / 0.83\\% / 0.70\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": " on CIFAR-10 with " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "40 / 250 / 4000" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": " labeled samples, respectively. Furthermore, our approach effectively addresses the challenges posed by extremely limited labeled samples, with IFMatch (Fix) achieving enhancements of " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "14.51\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "12.68\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": " on STL-10 with 40 labels and CIFAR-100 with 400 labels, respectively, compared to FixMatch. Moreover, the four algorithms achieve an average promotion of " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "3.69\\% / 2.30\\%" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": " on ImageNet with " + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "inline_equation", + "content": "100k / 400k" + }, + { + "bbox": [ + 130, + 236, + 482, + 500 + ], + "type": "text", + "content": " labels when following the proposed paradigm, indicating its effectiveness on large-scale datasets. Additionally, when employing our paradigm, the performance gap between dynamic and constant thresholds considerably narrows on challenging tasks, while IFMatch (Fix) even emerges as the preferred method on some less demanding tasks. The shifted performance gap implies a reduced reliance on complex threshold strategies of our paradigm, which primarily benefits from the expanded augmentation space. In summary, the impressive performance observed in Tab. 1 confirms the effectiveness of the proposed paradigm." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 520, + 354, + 533 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 520, + 354, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 520, + 354, + 533 + ], + "type": "text", + "content": "4.2 Imbalanced Semi-Supervised Learning" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": "Settings. We evaluate the proposed paradigm in the context of imbalanced SSL, where both labeled and unlabeled data exhibit a long-tailed distribution. Consistent with prior studies [5,10,21,23,27,37], we construct labeled and unlabeled sets using the configurations of " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "N_{c} = N_{1} \\cdot \\gamma^{-\\frac{c - 1}{C - 1}}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "M_{c} = M_{1} \\cdot \\gamma^{-\\frac{c - 1}{C - 1}}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": ". Specifically, for CIFAR-10-LT, we set " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "N_{1}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " to 1500, " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "M_{1}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " to 3000, and " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " to range from 50 to 150. Moreover, for CIFAR-100-LT, we set " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "N_{1}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " to 150, " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "M_{1}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " to 300, and " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " to span from 20 to 100. In all experiments, we employ WRN-28-2 as the backbone and utilize the Adam optimizer [17] with a weight decay of 4e-5. Besides, batch sizes " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "B_{L}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "inline_equation", + "content": "B_{U}" + }, + { + "bbox": [ + 130, + 543, + 482, + 666 + ], + "type": "text", + "content": " are fixed as 64 and 128 respectively. Additionally, the learning rate is initially set to 2e-3 and adjusted by a cosine decay scheduler during" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 136, + 464, + 251 + ], + "blocks": [ + { + "bbox": [ + 145, + 114, + 467, + 126 + ], + "lines": [ + { + "bbox": [ + 145, + 114, + 467, + 126 + ], + "spans": [ + { + "bbox": [ + 145, + 114, + 467, + 126 + ], + "type": "text", + "content": "Table 2: Performance (%) on CIFAR-10/100-LT with varying imbalance ratio." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 136, + 464, + 251 + ], + "lines": [ + { + "bbox": [ + 148, + 136, + 464, + 251 + ], + "spans": [ + { + "bbox": [ + 148, + 136, + 464, + 251 + ], + "type": "table", + "html": "
DatasetCIFAR-10-LTCIFAR-100-LT
γ501001502050100
FixMatch [32]81.54±0.3074.89±1.2070.38±0.8849.58±0.7842.11±0.3337.60±0.48
IFMatch (Fix)85.32±0.3379.46±0.3575.59±0.4853.61±0.2544.58±0.3839.92±0.37
FlexMatch [42]81.87±0.1974.49±0.9270.20±0.3650.89±0.6042.80±0.3937.30±0.47
IFMatch (Flex)84.36±0.1279.04±0.4273.02±0.4751.83±0.3343.49±0.3537.98±0.36
SoftMatch [5]83.45±0.2977.07±0.3772.60±0.4651.91±0.5543.76±0.5138.92±0.81
IFMatch (Soft)85.56±0.1580.28±0.2476.18±0.3453.97±0.3244.98±0.4139.68±0.41
FreeMatch [35]83.30±0.3375.96±0.4971.20±0.6451.60±0.9142.95±0.4837.50±0.23
IFMatch (Free)84.88±0.2080.12±0.2974.85±0.4752.77±0.4643.68±0.4538.00±0.55
", + "image_path": "ed451a685efd55f039a9262fab16e14c54d44673021c61e834339abba227b01c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 266, + 479, + 301 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 266, + 479, + 301 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 479, + 301 + ], + "type": "text", + "content": "training. We set the fixed threshold " + }, + { + "bbox": [ + 130, + 266, + 479, + 301 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 266, + 479, + 301 + ], + "type": "text", + "content": " in the first branch to 0.95. To account for randomness, we report the mean and standard deviation of the performance across three different random seeds." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": "Performance. We apply the proposed paradigm to numerous algorithms and compare the performance with their counterparts following the old paradigm. The results in Tab. 2 demonstrate that our paradigm substantially improves existing models, enabling them to achieve state-of-the-art performance. Specifically, when integrated with the enhanced paradigm, the four algorithms achieve the average promotion of " + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "3.72\\%" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "2.03\\%" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "2.16\\%" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "1.92\\%" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": " across all benchmarks. Notably, IFMatch (Fix) outperforms FixMatch by " + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "5.21\\%" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "2.32\\%" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": " on CIFAR-10-LT (" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "\\gamma = 150" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": ") and CIFAR-100-LT (" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "\\gamma = 100" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": "), highlighting the robustness of the proposed paradigm when facing severe imbalance. Moreover, the performance gap between dynamic-threshold-based methods and FixMatch substantially narrows within our paradigm. Accordingly, the proposed approach promotes the utilization of unlabeled data, reducing reliance on complex threshold mechanisms. Overall, the impressive performance observed in imbalanced SSL suggests the potential of our approach to be deployed in real-world applications." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 489, + 265, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 489, + 265, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 489, + 265, + 502 + ], + "type": "text", + "content": "4.3 Component Analysis" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 509, + 479, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 509, + 479, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 509, + 479, + 569 + ], + "type": "text", + "content": "This section presents the contribution of each component within the proposed paradigm. Unless otherwise stated, we conduct experiments on IFMatch (Fix). Additionally, we provide running speed analysis, feature visualization results [24], and performance on semi-supervised semantic segmentation in the Appendix. The subsequent analysis presents the revealed findings." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "The proposed approach to integrating image-level and feature-level perturbations yields optimal performance. As the simplest idea, we can integrate " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " within one branch to establish a dual-branch structure similar to the old paradigm. Nonetheless, such a toy design engenders disruptive perturbations that exceed acceptable augmentation levels for consistency regulation, resulting in the performance degradation presented in lines 1-2 of Tab. 3. An alternative approach, proposed by UniMatch [40], combines " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " in separate branches, each employing a distinct type of perturbation (line 3)." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 187, + 168, + 425, + 240 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": "Table 3: Experiments (\\%) on the strategies for integrating image-level and feature-level perturbations. CBI abbreviates the confidence-based identification strategy. CIFAR-" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "inline_equation", + "content": "m-n" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": " denotes CIFAR-" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": " labeled samples. Line 3 combines the structure setting of UniMatch [40] and our proposed feature-level perturbation techniques." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 187, + 168, + 425, + 240 + ], + "lines": [ + { + "bbox": [ + 187, + 168, + 425, + 240 + ], + "spans": [ + { + "bbox": [ + 187, + 168, + 425, + 240 + ], + "type": "table", + "html": "
Branch IBranch IICIFAR-10-40CIFAR-100-400
FixMatch (baseline, no \\(\\mathcal{A}^{\\mathcal{F}}\\))92.5353.58
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_s}\\) in one branch88.2651.47
\\(\\mathcal{A}^{\\mathcal{F}_s}\\)\\(\\mathcal{A}^{\\mathcal{I}_s}\\)95.5364.54
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}\\)\\(\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s}\\)95.4763.56
\\(\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}\\)\\(\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s} + \\text{CBI}\\)95.8266.26
", + "image_path": "23279d2e65c92d0aa51e623c4be7a0fd4a2fb138aa187552d0b7115b39465b0f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 201, + 271, + 411, + 342 + ], + "blocks": [ + { + "bbox": [ + 150, + 250, + 462, + 262 + ], + "lines": [ + { + "bbox": [ + 150, + 250, + 462, + 262 + ], + "spans": [ + { + "bbox": [ + 150, + 250, + 462, + 262 + ], + "type": "text", + "content": "Table 4: Ablation study (%) for the strategies of feature-level perturbation." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 201, + 271, + 411, + 342 + ], + "lines": [ + { + "bbox": [ + 201, + 271, + 411, + 342 + ], + "spans": [ + { + "bbox": [ + 201, + 271, + 411, + 342 + ], + "type": "table", + "html": "
A^F StrategyCIFAR-10-40CIFAR-100-400
All strategies95.8266.26
w/o channel-wise dropout95.66 (↓0.16)65.68 (↓0.58)
w/o spatial-wise dropout95.57 (↓0.25)65.77 (↓0.49)
w/o translation95.59 (↓0.23)65.70 (↓0.56)
w/o shearing95.58 (↓0.24)65.81 (↓0.47)
w/o value modification95.62 (↓0.20)65.75 (↓0.51)
", + "image_path": "b4f14ab6b515759bc82a22c65385b848b215b7f89a5a98f5446df559daf24fe1.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": "Despite its effectiveness, this method fails to boost interactions between the two types of perturbations. Accordingly, we attempt to achieve the co-occurrence of " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": " within one branch, thereby constructing a more comprehensive augmentation space. The proposed paradigm adopts a milder combination strategy, specifically using " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s} + \\mathcal{A}^{\\mathcal{I}_w}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w} + \\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": " in the two student branches respectively. However, as shown in line 4 of Tab. 3, the introduction of " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": " leads to a performance drop compared to UniMatch, probably due to the derived difficulties in recognizing hard samples. To address this issue, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Finally, the proposed paradigm (IFMatch), as presented in line 5, achieves the optimal performance among all candidate designs for integrating " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": ", demonstrating its effectiveness and advantages." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 616 + ], + "type": "text", + "content": "All feature-level perturbation strategies contribute to the overall performance. As shown in Tab. 4, we conduct an ablation study on feature-level perturbation strategies. The baseline model in line 1 integrates all proposed strategies and achieves state-of-the-art performance. In subsequent configurations (line 2-6), we sequentially remove each strategy. Compared to the baseline, the absence of any proposed perturbation technique leads to a decline in performance on both datasets. Therefore, the proposed perturbation strategies exhibit a synergistic effect, collaboratively exploring the feature perturbation space." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Feature-level perturbation " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " favors a high constant threshold over a dynamic one. As detailed in Sec. 3.3, " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " may require different threshold mechanisms due to their distinct characteristics. Considering the central role of " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " (" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ") in the first student branch, we further delve into the" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 206, + 135, + 406, + 215 + ], + "blocks": [ + { + "bbox": [ + 159, + 114, + 453, + 125 + ], + "lines": [ + { + "bbox": [ + 159, + 114, + 453, + 125 + ], + "spans": [ + { + "bbox": [ + 159, + 114, + 453, + 125 + ], + "type": "text", + "content": "Table 5: Exploration (%) for the threshold strategy in the first branch." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 206, + 135, + 406, + 215 + ], + "lines": [ + { + "bbox": [ + 206, + 135, + 406, + 215 + ], + "spans": [ + { + "bbox": [ + 206, + 135, + 406, + 215 + ], + "type": "table", + "html": "
Branch IBranch IICIFAR-10-40CIFAR-100-400
FlexMatchFlexMatch95.2863.38
τ = 0.95FlexMatch95.9066.28
SoftMatchSoftMatch95.3963.80
τ = 0.95SoftMatch95.8467.02
FreeMatchFreeMatch95.5664.45
τ = 0.95FreeMatch95.8366.65
", + "image_path": "53db0cabec503eb55fb66dcbe4aa29e0596e67cf496d7cf839578e224dd10241.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 190, + 246, + 421, + 284 + ], + "blocks": [ + { + "bbox": [ + 140, + 225, + 471, + 237 + ], + "lines": [ + { + "bbox": [ + 140, + 225, + 471, + 237 + ], + "spans": [ + { + "bbox": [ + 140, + 225, + 471, + 237 + ], + "type": "text", + "content": "Table 6: Comparison (%) between SAA [12] and confidence-based identification." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 190, + 246, + 421, + 284 + ], + "lines": [ + { + "bbox": [ + 190, + 246, + 421, + 284 + ], + "spans": [ + { + "bbox": [ + 190, + 246, + 421, + 284 + ], + "type": "table", + "html": "
Identification StrategyCIFAR-10-40CIFAR-100-400
SAA [12]95.5465.32
Confidence-Based Identification95.8266.26
", + "image_path": "9eccbfdd1d4bd4be69e93f38565dfb58855eae042efc6edb7653e309f345686d.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 306, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 306, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 306, + 482, + 437 + ], + "type": "text", + "content": "threshold strategy best suited for it. In general, existing threshold mechanisms can be categorized into constant thresholds and dynamic thresholds. The former prioritizes high pseudo-label accuracy at the expense of diminished utilization of unlabeled data, while the latter performs conversely. Accordingly, we determine the optimal threshold for the first branch from two candidates: a dynamic threshold mirroring the one used in the second branch and the constant threshold used in FixMatch. Combining Tab. 5 and Tab. 1, the proposed paradigm consistently outperforms the old paradigm regardless of the threshold adopted in the first branch. Additionally, the constant threshold beats all dynamic threshold mechanisms, suggesting that feature-level perturbation " + }, + { + "bbox": [ + 130, + 306, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 306, + 482, + 437 + ], + "type": "text", + "content": " is better suited to a constant threshold of 0.95, rather than existing dynamic threshold mechanisms." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 438, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 438, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 482, + 666 + ], + "type": "text", + "content": "IFMatch outperforms previous methods from the perspective of the naive sample ratio. Firstly, as shown in the left part of Fig. 4, our approach (orange) achieves a lower naive sample ratio than UniMatch (green). This suggests more effective utilization of unlabeled data in our paradigm, primarily benefiting from combining both types of perturbation within each branch. Secondly, we compare the confidence-based identification strategy and SAA [12] within our paradigm to discern a better naive sample identification method. Specifically, SAA utilizes loss values as the criteria, recording historical loss for each sample and performing naive-challenging division by OTSU [28]. As shown in Tab. 6, the proposed module consistently outperforms SAA. Additionally, the naive sample ratio presented in the left part of Fig. 4 indicates that SAA (blue) tends to produce identification biased toward naive samples (e.g. starting with a ratio of 0.5 in the first iteration). Furthermore, we analyze the identification process of both strategies in the later training stages, as shown in the right part of Fig. 4. Notably, when employing the cross-entropy loss, the loss threshold of 1.79 in SAA corresponds to a confidence threshold of 0.17 (computed as " + }, + { + "bbox": [ + 130, + 438, + 482, + 666 + ], + "type": "inline_equation", + "content": "e^{-1.79}" + }, + { + "bbox": [ + 130, + 438, + 482, + 666 + ], + "type": "text", + "content": "), which is a detrimental configuration. The limitations of SAA can be ascribed to the ill-suited nature of the OTSU technique for segmenting a histogram with a monotonically decreasing trend. In contrast, our strategy remains effective in" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 178, + 118, + 434, + 194 + ], + "blocks": [ + { + "bbox": [ + 178, + 118, + 434, + 194 + ], + "lines": [ + { + "bbox": [ + 178, + 118, + 434, + 194 + ], + "spans": [ + { + "bbox": [ + 178, + 118, + 434, + 194 + ], + "type": "image", + "image_path": "5b211e0788184c30bfe317c134835b068a9681d6a304acd2011e960251acbace.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 203, + 480, + 225 + ], + "lines": [ + { + "bbox": [ + 131, + 203, + 480, + 225 + ], + "spans": [ + { + "bbox": [ + 131, + 203, + 480, + 225 + ], + "type": "text", + "content": "Fig. 4: Visualization for naive sample ratio and the identification process of SAA [12] and confidence-based identification on CIFAR-100-400." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 175, + 236, + 428, + 311 + ], + "blocks": [ + { + "bbox": [ + 175, + 236, + 428, + 311 + ], + "lines": [ + { + "bbox": [ + 175, + 236, + 428, + 311 + ], + "spans": [ + { + "bbox": [ + 175, + 236, + 428, + 311 + ], + "type": "image", + "image_path": "26d54796fdbdd7193856a9461b532ae29194cb484d5f4ce97aa95f351a2e845a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 319, + 482, + 353 + ], + "lines": [ + { + "bbox": [ + 131, + 319, + 482, + 353 + ], + "spans": [ + { + "bbox": [ + 131, + 319, + 482, + 353 + ], + "type": "text", + "content": "Fig. 5: Visualization of perturbations. We provide the feature map for samples that undergo feature-level augmentation. A naive sample " + }, + { + "bbox": [ + 131, + 319, + 482, + 353 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 131, + 319, + 482, + 353 + ], + "type": "text", + "content": " exhibits the characteristic of " + }, + { + "bbox": [ + 131, + 319, + 482, + 353 + ], + "type": "inline_equation", + "content": "\\forall \\mathcal{A}^{\\mathcal{I}_s}(u), \\mathcal{H}(\\hat{p}_i^{\\mathcal{I}_w}, p_i^{\\mathcal{I}_s}) \\approx 0" + }, + { + "bbox": [ + 131, + 319, + 482, + 353 + ], + "type": "text", + "content": ", thus contributing trivially to the model's performance." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 373, + 480, + 398 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 373, + 480, + 398 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 480, + 398 + ], + "type": "text", + "content": "distinguishing between naive and challenging samples even if the unlabeled set is predominantly composed of naive samples." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "content": "Visualization analysis. We present the visualization for image-level and feature-level perturbations in Fig. 5, where the four parts (from left to right) correspond to the raw images, the images subjected to " + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "content": ", and the feature maps that undergo " + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_w} \\circ \\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}_s} \\circ \\mathcal{A}^{\\mathcal{I}_w}" + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "content": ". We can observe that the exclusive reliance on " + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}_s}" + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "content": " engenders easy-to-recognize (naive) samples. In contrast, the proposed paradigm effectively combines " + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "inline_equation", + "content": "\\mathcal{A}^{\\mathcal{F}}" + }, + { + "bbox": [ + 130, + 399, + 482, + 483 + ], + "type": "text", + "content": " to expand the augmentation space. For additional visualization results, please refer to Appendix Sec.2." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 498, + 220, + 511 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 220, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 220, + 511 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "This paper introduces feature-level perturbation to expand the augmentation space of the conventional semi-supervised learning framework, establishing the image-feature weak-to-strong consistency paradigm (IFMatch). To achieve effective feature-level perturbation, we propose refined designs that consider both perturbation position and strategy, facilitating diversity in terms of intensity and form. Furthermore, our paradigm develops two parallel student branches to seamlessly integrate the two types of perturbations and comprehensively explore the augmentation space. Additionally, we devise a confidence-based identification strategy to distinguish between naive and challenging samples, posing additional challenges exclusively for naive samples. Extensive experiments are conducted on multiple benchmarks, including both balanced and imbalanced label distributions. The experimental results demonstrate the effectiveness of our approach." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 137, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 137, + 480, + 170 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 137, + 480, + 170 + ], + "spans": [ + { + "bbox": [ + 138, + 137, + 480, + 170 + ], + "type": "text", + "content": "1. Arazo, E., Ortego, D., Albert, P., O'Connor, N.E., McGuinness, K.: Pseudolabeling and confirmation bias in deep semi-supervised learning. In: 2020 International Joint Conference on Neural Networks (IJCNN). pp. 1-8. IEEE (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 170, + 480, + 191 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 170, + 480, + 191 + ], + "spans": [ + { + "bbox": [ + 138, + 170, + 480, + 191 + ], + "type": "text", + "content": "2. Bachman, P., Alsharif, O., Precup, D.: Learning with pseudo-ensembles. Advances in neural information processing systems 27 (2014)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 191, + 480, + 223 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 191, + 480, + 223 + ], + "spans": [ + { + "bbox": [ + 138, + 191, + 480, + 223 + ], + "type": "text", + "content": "3. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring. arXiv preprint arXiv:1911.09785 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 223, + 480, + 255 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 223, + 480, + 255 + ], + "spans": [ + { + "bbox": [ + 138, + 223, + 480, + 255 + ], + "type": "text", + "content": "4. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. Advances in neural information processing systems 32 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 255, + 480, + 287 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 255, + 480, + 287 + ], + "spans": [ + { + "bbox": [ + 138, + 255, + 480, + 287 + ], + "type": "text", + "content": "5. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality trade-off in semi-supervised learning. arXiv preprint arXiv:2301.10921 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 287, + 480, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 287, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 287, + 480, + 331 + ], + "type": "text", + "content": "6. Coates, A., Ng, A., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 215-223. JMLR Workshop and Conference Proceedings (2011)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 331, + 480, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 331, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 138, + 331, + 480, + 373 + ], + "type": "text", + "content": "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. pp. 702-703 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 373, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 373, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 373, + 480, + 407 + ], + "type": "text", + "content": "8. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 407, + 480, + 427 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 407, + 480, + 427 + ], + "spans": [ + { + "bbox": [ + 138, + 407, + 480, + 427 + ], + "type": "text", + "content": "9. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout. arXiv preprint arXiv:1708.04552 (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 427, + 480, + 471 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 427, + 480, + 471 + ], + "spans": [ + { + "bbox": [ + 138, + 427, + 480, + 471 + ], + "type": "text", + "content": "10. Fan, Y., Dai, D., Kukleva, A., Schiele, B.: Cossl: Co-learning of representation and classifier for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14574-14584 (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 471, + 480, + 492 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 471, + 480, + 492 + ], + "spans": [ + { + "bbox": [ + 138, + 471, + 480, + 492 + ], + "type": "text", + "content": "1. Grandvalet, Y., Bengio, Y.: Semi-supervised learning by entropy minimization. Advances in neural information processing systems 17 (2004)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 492, + 480, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 492, + 480, + 536 + ], + "spans": [ + { + "bbox": [ + 138, + 492, + 480, + 536 + ], + "type": "text", + "content": "2. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15880-15889 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 536, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 536, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 536, + 480, + 567 + ], + "type": "text", + "content": "3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 567, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 480, + 600 + ], + "type": "text", + "content": "4. Hinton, G.E., Srivastava, N., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.R.: Improving neural networks by preventing co-adaptation of feature detectors. arXiv preprint arXiv:1207.0580 (2012)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 600, + 480, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 633 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 633 + ], + "type": "text", + "content": "5. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International conference on machine learning. pp. 448-456. pmlr (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "text", + "content": "6. Kim, J., Hur, Y., Park, S., Yang, E., Hwang, S.J., Shin, J.: Distribution aligning refinery of pseudo-label for imbalanced semi-supervised learning. Advances in neural information processing systems 33, 14567-14579 (2020)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "17. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 480, + 170 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 480, + 170 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 480, + 170 + ], + "type": "text", + "content": "18. Krause, A., Perona, P., Gomes, R.: Discriminative clustering by regularized information maximization. Advances in neural information processing systems 23 (2010)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 171, + 480, + 191 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 171, + 480, + 191 + ], + "spans": [ + { + "bbox": [ + 133, + 171, + 480, + 191 + ], + "type": "text", + "content": "19. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 192, + 480, + 235 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 192, + 480, + 235 + ], + "spans": [ + { + "bbox": [ + 132, + 192, + 480, + 235 + ], + "type": "text", + "content": "20. Kuo, C.W., Ma, C.Y., Huang, J.B., Kira, Z.: Featmatch: Feature-based augmentation for semi-supervised learning. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVIII 16. pp. 479-495. Springer (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 236, + 480, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 480, + 278 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 480, + 278 + ], + "type": "text", + "content": "21. Lai, Z., Wang, C., Gunawan, H., Cheung, S.C.S., Chuah, C.N.: Smoothed adaptive weighting for imbalanced semi-supervised learning: Improve reliability against unknown distribution data. In: International Conference on Machine Learning. pp. 11828-11843. PMLR (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 279, + 480, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 279, + 480, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 279, + 480, + 300 + ], + "type": "text", + "content": "22. Laine, S., Aila, T.: Temporal ensembling for semi-supervised learning. arXiv preprint arXiv:1610.02242 (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 300, + 480, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 480, + 331 + ], + "type": "text", + "content": "23. Lee, H., Shin, S., Kim, H.: Abc: Auxiliary balanced classifier for class-imbalanced semi-supervised learning. Advances in Neural Information Processing Systems 34, 7082-7094 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 332, + 480, + 353 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 332, + 480, + 353 + ], + "spans": [ + { + "bbox": [ + 132, + 332, + 480, + 353 + ], + "type": "text", + "content": "24. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of machine learning research 9(11) (2008)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 354, + 480, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 480, + 385 + ], + "type": "text", + "content": "25. Miyato, T., Maeda, S.i., Koyama, M., Ishii, S.: Virtual adversarial training: a regularization method for supervised and semi-supervised learning. IEEE transactions on pattern analysis and machine intelligence 41(8), 1979-1993 (2018)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 480, + 407 + ], + "type": "text", + "content": "26. Netzer, Y., Wang, T., Coates, A., Bissacco, A., Wu, B., Ng, A.Y.: Reading digits in natural images with unsupervised feature learning (2011)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 407, + 480, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 480, + 449 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 480, + 449 + ], + "type": "text", + "content": "27. Oh, Y., Kim, D.J., Kweon, I.S.: Daso: Distribution-aware semantics-oriented pseudo-label for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9786-9796 (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 450, + 480, + 471 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 450, + 480, + 471 + ], + "spans": [ + { + "bbox": [ + 132, + 450, + 480, + 471 + ], + "type": "text", + "content": "28. Otsu, N.: A threshold selection method from gray-level histograms. IEEE transactions on systems, man, and cybernetics 9(1), 62-66 (1979)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 472, + 480, + 503 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 472, + 480, + 503 + ], + "spans": [ + { + "bbox": [ + 132, + 472, + 480, + 503 + ], + "type": "text", + "content": "29. Pham, H., Dai, Z., Xie, Q., Le, Q.V.: Meta pseudo labels. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11557-11568 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 504, + 480, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 504, + 480, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 504, + 480, + 525 + ], + "type": "text", + "content": "30. Rosenberg, C., Hebert, M., Schneiderman, H.: Semi-supervised self-training of object detection models (2005)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 525, + 480, + 556 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 480, + 556 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 480, + 556 + ], + "type": "text", + "content": "31. Sajjadi, M., Javanmardi, M., Tasdizen, T.: Regularization with stochastic transformations and perturbations for deep semi-supervised learning. Advances in neural information processing systems 29 (2016)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 557, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 480, + 600 + ], + "type": "text", + "content": "32. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33, 596-608 (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 601, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 480, + 632 + ], + "type": "text", + "content": "33. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "text", + "content": "34. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International conference on machine learning. pp. 6438-6447. PMLR (2019)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Wu and Cui" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 490 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "35. Wang, Y., Chen, H., Heng, Q., Hou, W., Savvides, M., Shinozaki, T., Raj, B., Wu, Z., Wang, J.: Freematch: Self-adaptive thresholding for semi-supervised learning. arXiv preprint arXiv:2205.07246 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "text", + "content": "36. Wang, Y., Huang, G., Song, S., Pan, X., Xia, Y., Wu, C.: Regularizing deep networks with semantic data augmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(7), 3733-3748 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 183, + 482, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 482, + 226 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 482, + 226 + ], + "type": "text", + "content": "37. Wei, C., Sohn, K., Mellina, C., Yuille, A., Yang, F.: Crest: A class-rebalancing self-training framework for imbalanced semi-supervised learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10857-10866 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 226, + 482, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 258 + ], + "type": "text", + "content": "38. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. Advances in neural information processing systems 33, 6256-6268 (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 259, + 482, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 259, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 259, + 482, + 293 + ], + "type": "text", + "content": "39. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: International Conference on Machine Learning. pp. 11525-11536. PMLR (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 293, + 482, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 326 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 326 + ], + "type": "text", + "content": "40. Yang, L., Qi, L., Feng, L., Zhang, W., Shi, Y.: Revisiting weak-to-strong consistency in semi-supervised semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7236-7246 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 326, + 482, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 326, + 482, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 326, + 482, + 346 + ], + "type": "text", + "content": "41. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 482, + 380 + ], + "type": "text", + "content": "42. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. Advances in Neural Information Processing Systems 34, 18408-18419 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 380, + 482, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 402 + ], + "type": "text", + "content": "43. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 403, + 482, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 445 + ], + "type": "text", + "content": "44. Zhao, Z., Zhou, L., Duan, Y., Wang, L., Qi, L., Shi, Y.: Dc-ssl: Addressing mismatched class distribution in semi-supervised learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9757-9765 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 446, + 482, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 482, + 479 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 482, + 479 + ], + "type": "text", + "content": "45. Zhou, T., Wang, S., Bilmes, J.: Time-consistent self-supervision for semi-supervised learning. In: International Conference on Machine Learning. pp. 11523-11533. PMLR (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 479, + 393, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 393, + 490 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 393, + 490 + ], + "type": "text", + "content": "46. Zhu, X.J.: Semi-supervised learning literature survey (2005)" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 270, + 91, + 447, + 102 + ], + "type": "text", + "content": "Image-Feature Weak-to-Strong Consistency" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_content_list.json b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..a4912829b37336133be1d735c4b7bac9340e5c82 --- /dev/null +++ b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_content_list.json @@ -0,0 +1,1834 @@ +[ + { + "type": "text", + "text": "Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids", + "text_level": 1, + "bbox": [ + 225, + 140, + 779, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Wontae $\\mathrm{Kim}^{1,3}$ and Nam Ik Cho $^{1,2}$", + "bbox": [ + 361, + 212, + 640, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ IPAI, Seoul National University, Seoul, Korea", + "bbox": [ + 339, + 239, + 661, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Department of ECE, INMC, Seoul National University, Seoul, Korea", + "bbox": [ + 264, + 253, + 736, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 LG Electronics", + "bbox": [ + 442, + 267, + 558, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{munte2, nicho}@snu.ac.kr", + "bbox": [ + 403, + 282, + 599, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Image enhancement and restoration methods using adaptive 3D lookup tables (3D LUTs) have shown promising results with real-time inferencing. These methods directly transform input pixel values into enhanced ones by using interpolation operations with predicted 3D LUT values. However, it is still challenging to deal with locally different properties of images since most 3D LUT methods are simple color-to-color transforms. Although including spatial information in this transform can be a good solution, it can significantly increase the number of parameters and inference time. To address this issue, we propose an efficient spatial-aware image enhancement model that combines bilateral grids and 3D LUTs. Specifically, we transform bilateral grids into a spatial feature domain to incorporate spatial information in our 3D LUT model. To reduce inference time and save parameters, we use slicing operations in our network architecture instead of the long decoding path of the U-Net architecture used in most existing studies. Our model achieves state-of-the-art performance without increasing parameters and further reduces inference time, as demonstrated by extensive results. Codes are available at https://github.com/WontaeaeKim/LUTwithBGrid", + "bbox": [ + 261, + 343, + 743, + 593 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Image enhancement $\\cdot$ 3D LUT $\\cdot$ Bilateral grid", + "bbox": [ + 261, + 607, + 658, + 621 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 651, + 375, + 667 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Image enhancement has become increasingly popular with the widespread use of high-resolution and wide-color-gamut display devices and cameras. Recently, deep learning-based approaches have shown impressive results by extracting and utilizing effective features of images [1,3,5,8-10,17,19,20,23,24,27,30,31,40,43, 49]. However, these approaches require high computational costs and long inference times. To address this problem, researchers have investigated a learningbased 3D lookup table (3D LUT) as an alternative [12,21,28,29,34,38,44-47,50]. The 3D LUT instantly converts input color values to improved ones by interpolating pre-computed values in the 3D LUT instead of performing repeated computations, effectively reducing computational costs.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Specifically, Zeng et al. proposed a convolutional neural network (CNN) model that predicts the values needed to create an efficient 3D LUT [46]. However, the authors have also addressed the limitation in that it only provides a color-to-color transformation and lacks spatial information. This means that it may not be effective in enhancing certain areas of an image that require local adjustments. To address this limitation, a spatially adaptive method (SA-3DLUT) was proposed, which uses a U-net style backbone to incorporate spatial information [38]. This approach achieves state-of-the-art performance, but requires a significantly larger number of parameters than previous plain LUT approaches. Other advanced 3D LUT methods [28, 29, 44, 45, 47] have also improved image quality, but the issue of missing spatial information remains a challenge. As can be seen in prior studies, including spatial information without an expanded model is very challenging.", + "bbox": [ + 212, + 146, + 787, + 343 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To solve this issue, we introduce the method using bilateral grids to incorporate spatial information while reducing computational costs and model size. The bilateral grid is a data structure consisting of 2D spatial dimensions and 1D intensity dimension [7]. Recent deep learning-based approaches generate the bilateral grids from an image and transform them into features or coefficients by slicing operation for their purpose [6,11,13,36,41,42,51,52]. Slicing can help to reduce computational costs due to its non-parametric property [7]. The experiments of Gharbi et al. [11] showed that slicing with the bilateral grids achieve better performance and shorter running time compared to U-net in the Local Laplacian task. To take those advantages, our method generates spatial features from slicing with bilateral grids instead of the U-Net.", + "bbox": [ + 212, + 343, + 787, + 507 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The overall architecture of our method is shown in Fig. 1. We use the Extractor to extract image context from the input image, which is used to generate image-adaptive bilateral grids and 3D LUTs. The bilateral grids provide spatial-aware property to our model after transformed to spatial features by slicing. Finally, the input image combined with spatial features is used to generate the enhanced image by the 3D LUT transform. The experiments show that this architecture can achieve better performance with relatively small number of parameters.", + "bbox": [ + 212, + 508, + 787, + 628 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In addition, we also explore tetrahedral interpolation as well as trilinear interpolation to apply effective interpolation methods when slicing and 3D LUT transformation. We find that tetrahedral and trilinear interpolation provide the optimal performance to 3D LUTs and bilateral grids, respectively.", + "bbox": [ + 212, + 628, + 787, + 690 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The contributions of this paper are three-fold:", + "bbox": [ + 238, + 690, + 573, + 705 + ], + "page_idx": 1 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We introduce a new application of bilateral grids for 3D LUT construction, incorporating spatial features using only a small number of parameters.", + "- We propose an efficient architecture for spatial-aware 3D LUTs that leverages a cascade of bilateral grids and 3D LUTs. This architecture produces an improved output with fewer parameters.", + "- We conduct extensive experiments to compare our approach with existing methods on two publicly available benchmark datasets. Results demonstrate the efficiency and effectiveness of our method in image enhancement." + ], + "bbox": [ + 225, + 710, + 782, + 829 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/cb2716a8b2a1f114b74e60affddef0b2357f9767af283b9691dd9a46e2e44c70.jpg", + "image_caption": [ + "Fig. 1: Framework of the proposed method. An image context is extracted from a downsampled image, which is then used to predict bilateral grids and 3D LUTs. The bilateral grids are transformed into spatial features by slicing operation. After being combined with spatial features by a $1 \\times 1$ convolution layer, the combined image is converted to a spatial-aware enhanced image by 3D LUT interpolation." + ], + "image_footnote": [], + "bbox": [ + 230, + 142, + 774, + 375 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 487, + 387, + 503 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this section, we will briefly review hybrid methods that combine deep-learning and traditional methods to achieve better image enhancement. Typically, methods that use only deep learning [5, 9, 10, 19, 20, 23, 37, 40, 43, 49] predict all pixels on images with numerous deep neural layers. While these methods can deliver high performance, they require heavy computational costs and resources. On the other hand, hybrid methods predict the parameters of traditional models, such as the coefficients of color transform [14, 16, 32], bilateral grids [11, 51], or 3D LUT [28, 29, 38, 44-47], instead of directly predicting enhanced images. It has been shown that hybrid methods achieve better performance than deep-learning-only methods while requiring relatively shallow networks and light resources.", + "bbox": [ + 212, + 532, + 787, + 683 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The methods predicting coefficients of color transform mimic human experts' photo retouch process, which adjusts brightness, contrast, tone mapping curves, or white balance. To be precise, [16,32] apply color transforms based on the current image state through the reinforcement learning approach, while [14] replaces traditional color transform into multi-layer perceptrons (MLPs).", + "bbox": [ + 212, + 686, + 787, + 762 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Gharbi et al. introduced HDRNet framework [11] that produces enhanced images with pixel-wise affine transform and coefficients reconstructed from predicted bilateral grids. Zheng et al. introduced collaborative learning [51] with bilateral grids and LeakyAdaIN, an extension of adaptive instance normalization (AdaIN) [18], to reconstruct UHD HDR image from input image in real-time.", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 113, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Zeng et al. showed that the weighted sum of basis LUTs can achieve image-adaptive enhancement with a simple CNN weight predictor [46]. Yang et al. combined 1D LUTs [45] and adaptive intervals [44] with [46] to improve the capacity of LUTs. The 4D LUT was introduced in [29], which is a combination of context channel (1D) and RGB channels (3D). The above LUT methods achieved promising performance with a light network and fast inference speed. However, these methods still suffer from a lack of spatial information to handle local enhancement in an image. Although SA-3DLUT [38] provides spatial information with U-NET [33] style backbone network, it requires a tremendous number of parameters and inference time. In the following section, we will introduce a new method that is a combination of LUTs and bilateral grids to provide color enhancement and spatial information, respectively, without parameter increase.", + "bbox": [ + 212, + 146, + 787, + 328 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Proposed Method", + "text_level": 1, + "bbox": [ + 215, + 351, + 426, + 368 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We present our network and loss functions in this section. The overall network architecture comprises three steps, as illustrated in Fig. 1: image context extraction, spatial feature fusion, and color enhancement. A simple CNN network extracts image context vectors, which are then fed to the GridGen and LUTGen modules to generate image-adaptive bilateral grids and 3D LUTs. Spatial feature fusion and color enhancement are sequentially carried out using bilateral grids and 3D LUTs, respectively. This cascade structure is effective in image signal processing [22,45], where each module focuses on its specific functionality. The slicing operation cost-effectively generates spatial features from bilateral grids, which have the same resolution as the input image. The spatial features are combined with an input image by the $1 \\times 1$ convolution. The combined image is transformed into an enhanced image by interpolation operation on 3D LUTs.", + "bbox": [ + 212, + 383, + 787, + 566 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Preliminary: Interpolation", + "text_level": 1, + "bbox": [ + 215, + 587, + 478, + 603 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we will delve into trilinear and tetrahedral interpolation methods, which are used in the slicing operation and 3D LUT transform. The interpolation process involves two steps, looking up to find adjacent points for a query point $P = (p_x,p_y,p_z)$ and then computing the weighted sum of those adjacent points. To simplify the computation process, we assume a normalized three-dimensional grid $G\\in \\mathbb{R}^{N_s\\times N_s\\times N_s}$ , such as a 3D LUT or a bilateral grid, where $N_{s}$ is the number of vertices.", + "bbox": [ + 212, + 612, + 787, + 718 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Trilinear interpolation finds the eight adjacent points in the lookup step, where the left and right adjacent points on each axis $\\alpha \\in \\{x,y,z\\}$ are denoted as $p_{\\alpha}^{0}, p_{\\alpha}^{1}$ . If the grid has uniform lattices, the adjacent point can be found as $p_{\\alpha}^{0} = \\lfloor p_{\\alpha} \\cdot (N_{s} - 1) \\rfloor / (N_{s} - 1)$ and $p_{\\alpha}^{1} = p_{\\alpha}^{0} + 1 / (N_{s} - 1)$ , where $\\lfloor \\cdot \\rfloor$ is the floor operator and $p_{\\alpha}$ is a query point on $\\alpha$ axis. In the case of non-uniform lattices, adjacent points can be found by the binary search [44]. The weight indicates how much an adjacent point influences the query point, which is denoted as $w_{i,j,k} = (\\varDelta_x)^i(1-\\varDelta_x)^{1-i}(\\varDelta_y)^j(1-\\varDelta_y)^{1-j}(\\varDelta_z)^k(1-\\varDelta_z)^{1-k}$ , where $\\varDelta_{\\alpha}=$", + "bbox": [ + 212, + 719, + 787, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/1e1d1a1e8dc5c082adbd4026f915412de9b22a555d1058b868dfd273ac84261f.jpg", + "image_caption": [ + "Fig.2: Description of tetrahedral interpolation" + ], + "image_footnote": [], + "bbox": [ + 220, + 146, + 500, + 281 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/399e976e2004cef1d9c38c74f479e13bb31116c5140eb20c48d1bd151ea1c085.jpg", + "table_caption": [ + "Table 1: Weights and adjacent points of tetrahedral interpolation depending on the condition" + ], + "table_footnote": [], + "table_body": "
TetrahedronCondition\\( {w}_{0} \\)\\( {w}_{1} \\)\\( {w}_{2} \\)\\( {w}_{3} \\)\\( {V}_{1} \\)\\( {V}_{2} \\)
\\( {t}_{0} \\)\\( {\\Delta }_{x} > {\\Delta }_{y} > {\\Delta }_{z} \\)1 \\( - {\\Delta }_{x} \\)\\( {\\Delta }_{x} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} \\)\\( {V}_{100} \\)\\( {V}_{110} \\)
\\( {t}_{1} \\)\\( {\\Delta }_{x} > {\\Delta }_{z} > {\\Delta }_{y} \\)1 \\( - {\\Delta }_{x} \\)\\( {\\Delta }_{x} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} \\)\\( {V}_{101} \\)\\( {V}_{101} \\)
\\( {t}_{2} \\)\\( {\\Delta }_{y} > {\\Delta }_{z} > {\\Delta }_{z} \\)1 \\( - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{x} \\)\\( {\\Delta }_{z} \\)\\( {V}_{010} \\)\\( {V}_{110} \\)
\\( {t}_{3} \\)\\( {\\Delta }_{y} > {\\Delta }_{z} > {\\Delta }_{x} \\)1 \\( - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{x} \\)\\( {\\Delta }_{x} \\)\\( {V}_{010} \\)\\( {V}_{011} \\)
\\( {t}_{4} \\)\\( {\\Delta }_{z} > {\\Delta }_{y} > {\\Delta }_{y} \\)1 \\( - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} \\)\\( {V}_{001} \\)\\( {V}_{011} \\)
\\( {t}_{5} \\)\\( {\\Delta }_{z} > {\\Delta }_{y} > {\\Delta }_{x} \\)1 \\( - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{x} \\)\\( {\\Delta }_{x} \\)\\( {V}_{001} \\)\\( {V}_{011} \\)
", + "bbox": [ + 517, + 229, + 795, + 295 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "$(p_{\\alpha} - p_{\\alpha}^{0}) / (p_{\\alpha}^{1} - p_{\\alpha}^{0})$ . Denoting the value corresponding to adjacent points on the grid $G$ as $V_{i,j,k}$ , the trilinear interpolation $I_{tri}(\\cdot)$ is formulated as", + "bbox": [ + 215, + 353, + 784, + 385 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nI _ {t r i} (P, G) = \\sum_ {i, j, k \\in \\{0, 1 \\}} w _ {i, j, k} \\cdot V _ {i, j, k}. \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 374, + 395, + 785, + 430 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "As can be seen in Tab. 1 and Fig. 2, the tetrahedral interpolation can be carried out with four adjacent sampling point values $V_{n}$ and weights $w_{n}$ ( $n \\in \\{0,1,2,3\\}$ ) depending on $\\varDelta_x$ , $\\varDelta_y$ and $\\varDelta_z$ . Detailed conditions are described in Tab. 1, where $V_{0}$ and $V_{3}$ are fixed at $V_{000}$ and $V_{111}$ , respectively. Tetrahedral interpolation $I_{tetra}(\\cdot)$ can be represented as", + "bbox": [ + 214, + 435, + 787, + 511 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nI _ {t e t r a} (P, G) = \\sum_ {n \\in \\{0, 1, 2, 3 \\}} w _ {n} \\cdot V _ {n}. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 382, + 521, + 785, + 556 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The previous 3D LUT methods [28, 29, 38, 44-47] considered only trilinear interpolation when retrieving enhanced color values. However, experiments of Vandenberg et al. [35] showed that tetrahedral interpolation has better performance on image processing with fixed 3D LUTs. After we explore how the two interpolation methods affect our model in the Sec. 4.3, we determine the interpolation methods for 3D LUT transform and slicing.", + "bbox": [ + 214, + 566, + 787, + 657 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Image Context Extraction", + "text_level": 1, + "bbox": [ + 215, + 679, + 478, + 695 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our framework is designed to be adaptive to images using image context extraction. The first step in this process is to bilinear downsample the input image $X \\in \\mathbb{R}^{3 \\times H \\times W}$ . This allows our model to process images at arbitrary resolutions. The downsampled image $\\hat{X}$ is then processed by the Extractor to create image contexts. The Extractor is made up of five layers of CNN, which is sufficient to provide image context for bilateral grids and 3D LUTs [38,44-46]. The details are depicted in Tab. 2 where $m$ is a hyper-parameter related to the Extractor width. Each convolution layer consists of 2 strided $3 \\times 3$ convolution, LeakyReLU, and instance normalization (except layer 5). The image context is produced by the", + "bbox": [ + 214, + 704, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 113, + 730, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/5a21e120c85075d6f9b47a0cec96e5122fabd58f8f46b0b54b34a2fa819c9dc3.jpg", + "table_caption": [ + "Table 2: Details of the Extractor. Conv, $LR$ , and $IN$ represent $3 \\times 3$ convolution block (stride=2, padding=1), LeakyReLU, and instance normalization, respectively." + ], + "table_footnote": [], + "table_body": "
LayerOutput Shape
Bilinear Downsample3 × 256 × 256
Conv + LR + INm × 128 × 128
Conv + LR + IN2m × 64 × 64
Conv + LR + IN4m × 32 × 32
Conv + LR + IN8m × 16 × 16
Conv + LR8m × 8 × 8
Droupout (0.5)8m × 8 × 8
Average Pooling8m × 2 × 2
Reshape32m
", + "bbox": [ + 222, + 255, + 470, + 398 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/575de839660e2e3051aed864f2ee299fc1092504430aebdb5e2dc041aee6bf41.jpg", + "table_caption": [ + "Table 3: Details of the GridGen, where $FC$ is the fully connected layer. $M_b$ , $K$ , and $N_{s_b}$ are hyperparameters for the number of hidden layers, bilateral grids, and bilateral grid vertices, respectively." + ], + "table_footnote": [ + "Reshape $K\\times N_{s_b}\\times N_{s_b}\\times N_{s_b}$", + "Table 4: Details of the LUTGen. $M_{t}$ and $N_{s_t}$ are hyper-parameters for the number of hidden layers and 3D LUT vertices, respectively." + ], + "table_body": "
LayerOutput Shape
FC (hb0)Mb
FC (hb1)K·Nsb
", + "bbox": [ + 547, + 239, + 764, + 284 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/d3bdd35543b940cfb4869f7b4bc77515b1bf0693f3633e1688845a9980bbe6c0.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
LayerOutput Shape
FC (ht0)Mt
FC (ht1)3Nst3
Reshape3 × Nst × Nst × Nst
", + "bbox": [ + 552, + 368, + 759, + 426 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "average pooling layer and reshaped as a vector. This context will be fed to the GridGen and LUTGen module. The complete image context extraction can be expressed as", + "bbox": [ + 212, + 459, + 784, + 503 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\rho = f (\\hat {X}) \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 464, + 506, + 784, + 525 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\rho \\in \\mathbb{R}^{32m}$ is image context vector predicted by image context extraction process $f(\\cdot)$ .", + "bbox": [ + 212, + 534, + 782, + 565 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Spatial Feature Fusion by Bilateral Grid", + "text_level": 1, + "bbox": [ + 214, + 594, + 594, + 609 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we describe the processes to provide spatial features, which are bilateral grid generation, slicing, and fusion.", + "bbox": [ + 212, + 626, + 784, + 656 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Bilateral Grids Generation The GridGen module transforms image context vector into bilateral grids $B \\in \\mathbb{R}^{K \\times N_{s_b} \\times N_{s_b} \\times N_{s_b}}$ where $K$ is the number of bilateral grids and $N_{s_b}$ is the number of vertices along each dimension. In our model, the two axes of bilateral grids represent sampling points of spatial coordinates, and the other one represents the color coefficient for each channel of the image. The bilateral grids are generated by 2 FC layers with the insight of rank factorization which can reduce the parameter and training difficulty [44, 45]. The detailed architecture is shown in Tab. 3 and described as", + "bbox": [ + 212, + 686, + 787, + 806 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nB = H _ {b} (\\rho) = h _ {b _ {1}} \\left(h _ {b _ {0}} (\\rho)\\right): \\mathbb {R} ^ {3 2 m} \\xrightarrow {h _ {b _ {0}}} \\mathbb {R} ^ {M _ {b}} \\xrightarrow {h _ {b _ {1}}} \\mathbb {R} ^ {K \\times N _ {s _ {b}} \\times N _ {s _ {b}} \\times N _ {s _ {b}}} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 272, + 819, + 785, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Slicing The slicing performs interpolation on a bilateral grid with a query point retrieved from a guidance map $g \\in \\mathbb{R}^{H \\times W}$ [7]. Specifically, the query point can be defined as $P_{b}(x,y) = (x / (W - 1),y / (H - 1),g(x,y))$ , where $(x,y)$ is spatial coordinates. Some of practices [11,51] use a guidance map generated by CNN or matrix transform. However, we use each channel of the input image as a guidance map after considering performance and inference time. Detailed ablation studies for the guidance map are provided in Sec. 4.3. The slicing reconstructs spatial features $\\varPhi=\\{\\phi_c|0\\leq c< K\\}$ from bilateral grids. When we denote a query point and a bilateral grid on channel $c$ as $P_{b}^{c}(x,y)$ and $B_{c}$ , the slicing operation can be described as", + "bbox": [ + 212, + 146, + 782, + 294 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\phi_ {c} (x, y) = I \\left(P _ {b} ^ {c ^ {\\prime}} (x, y), B _ {c}\\right), \\quad c \\in \\{0, 1, \\dots , K - 1 \\} \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 328, + 306, + 784, + 325 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $I(\\cdot)$ is one of interpolation operations depicted in Sec. 3.1, $c' = mod(c,3)$ , and $mod(\\cdot)$ is modulo operator.", + "bbox": [ + 214, + 334, + 782, + 364 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Spatial Feature Fusion This module combines the input image with spatial features $\\varPhi=\\{\\phi_0,\\phi_1,\\dots,\\phi_{K-1}\\}$ . The $1\\times 1$ convolution layer will optimally blend the input image and spatial features with learned parameters as follows:", + "bbox": [ + 214, + 386, + 782, + 431 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\varPhi} = \\left\\{\\hat {\\phi} _ {0}, \\hat {\\phi} _ {1}, \\hat {\\phi} _ {2} \\right\\} = \\operatorname {C o n v} _ {1 \\times 1} \\left(\\operatorname {C o n c a t} (\\varPhi , X)\\right): \\mathbb {R} ^ {(K + 3) \\times H \\times W} \\rightarrow \\mathbb {R} ^ {3 \\times H \\times W} \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 235, + 441, + 784, + 459 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Compared to HDRNet [11], the absence of additional local features on bilateral grids generation step may make bilateral grids smooth. However, our method involves learning multiple bilateral grids to produce spatial-aware features. Specifically, our model produces distinct spatial-aware features from multiple bilateral grids as illustrated in this section and Fig. 5, thereby providing spatial information. Furthermore, additional local features do not improve performance in our method with PSNR of $25.30\\mathrm{dB}$ on FiveK [4] photo retouch task.", + "bbox": [ + 212, + 468, + 782, + 587 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.4 Color Enhancement by 3D Lookup Table", + "text_level": 1, + "bbox": [ + 214, + 611, + 599, + 626 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3D Lookup Tables Generation The LUTGen has similar structure of GridGen, which generates 3D LUTs $T \\in \\mathbb{R}^{3 \\times N_{s_t} \\times N_{s_t} \\times N_{s_t}}$ from input image context. The detailed structure of LUTGen is depicted in Tab. 4.", + "bbox": [ + 214, + 635, + 782, + 680 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nT = H _ {t} (\\rho) = h _ {t _ {1}} \\left(h _ {t _ {0}} (\\rho)\\right): \\mathbb {R} ^ {3 2 m} \\xrightarrow {h _ {t _ {0}}} \\mathbb {R} ^ {M _ {t}} \\xrightarrow {h _ {t _ {1}}} \\mathbb {R} ^ {3 \\times N _ {s _ {t}} \\times N _ {s _ {t}} \\times N _ {s _ {t}}} \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 281, + 691, + 784, + 714 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Color Enhancement After spatial information fusion, pixel-to-pixel color enhancement is carried out through the 3D LUT transforms. Each axis of 3D LUT represents each channel value. In this context, a query point can be defined as $P_{t}(x,y) = (\\hat{\\phi}_{0}(x,y),\\hat{\\phi}_{1}(x,y),\\hat{\\phi}_{2}(x,y))$ , where $\\hat{\\phi}_c(x,y)$ is the channel value of combined image at $(x,y)$ on channel $c$ . The 3D LUT interpolation can be formulated as", + "bbox": [ + 212, + 733, + 782, + 821 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {Y} _ {c} (x, y) = I \\left(P _ {t} (x, y), T _ {c}\\right), \\quad c \\in \\{0, 1, 2 \\} \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 362, + 824, + 784, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 113, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 125 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.5 Loss Function", + "text_level": 1, + "bbox": [ + 215, + 146, + 375, + 160 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We optimize the proposed method by minimizing $\\mathcal{L}$ adopted from [38], which is composed of base loss $\\mathcal{L}_b$ [46], color difference loss $\\mathcal{L}_c$ , and perceptual loss $\\mathcal{L}_p$ [48]. The base loss $\\mathcal{L}_b$ [46] is divided into MSE loss $\\mathcal{L}_r$ that ensures content fidelity and regularization losses constraining the values in the LUT, including smoothness loss $\\mathcal{L}_s$ and monotonicity loss $\\mathcal{L}_m$ . The color difference loss $\\mathcal{L}_c$ is the color difference on the CIE94 LAB space. The perceptual loss $\\mathcal{L}_p$ [48] is the LPIPS loss to improve the perceptual quality, which is the difference between ground truth and output image features on a pre-trained AlexNet [26]. The loss can be written as", + "bbox": [ + 212, + 170, + 787, + 305 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {b} + 0. 0 0 5 * \\mathcal {L} _ {c} + 0. 0 5 * \\mathcal {L} _ {p} \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 306, + 785, + 325 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 345, + 375, + 362 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Datasets", + "text_level": 1, + "bbox": [ + 215, + 376, + 334, + 390 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We use FiveK [4] and PPR10K [28] datasets to train and evaluate the proposed network. The FiveK dataset contains 5,000 RAW images and five ground truths retouched by experts (A/B/C/D/E). We select the expert C as ground truth for comparison with previous LUT methods [38, 44-46]. We also split the data into 4,500 pairs for training set and 500 for testing set, as provided in [46]. The 480p version images [46] are used in the training stage to speed up, and both 480p and 4K images are used in the testing stage. The PPR10K dataset contains 11,161 RAW portrait photos with three ground truths by three experts (a/b/c). We divide the dataset into 8,875 image pairs for the training stage and 2,286 pairs for the test stage with the official split [28]. Experiments are separately conducted for each ground truth on the 360p version of the dataset.", + "bbox": [ + 212, + 400, + 787, + 566 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We perform experiments for two types of tasks: photo retouch and tone mapping in camera pipeline. Both tasks have the 8-bit sRGB images as ground truth but have different input formats, which are sRGB format (8-bit on FiveK and 16-bit on PPR10K) in the photo retouch task, and 16-bit CIE XYZ format in the tone mapping task. The photo retouch task is conducted on both dataset, but the tone mapping task is conducted only on FiveK dataset.", + "bbox": [ + 212, + 566, + 787, + 657 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Application Settings", + "text_level": 1, + "bbox": [ + 215, + 679, + 431, + 695 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The proposed network is trained end-to-end manner. The detail of each module is denoted in Tabs. 2 to 4 and Fig. 1. In comparison on PPR10K [28], pretrained ResNet-18 [15] is used as the Extractor instead of Tab. 2 and the hidden layer of GenLUT $(M_t)$ is increased by a factor of 2 for fair comparison with previous work [28,44,45]. Our models are trained for 400 epochs with the standard Adam optimizer [25] and a learning rate of $1 \\times 10^{-4}$ . The learning rate decayed by 0.1 factor every 100 epochs. The minibatch size is 1 and 16 for FiveK and PPR10K, respectively. We implement our method on the PyTorch framework. Especially, the interpolation operation on both slicing and 3D LUT transform is", + "bbox": [ + 212, + 703, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/f893d25b16cbfa5e3e8762e3363ff11cee6834e4b2f388fcb121999b4cbb66f9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 220, + 145, + 398, + 210 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/0570abde7f9bc65f35afbdea752d5c5e3735d09a2bd5a577bd278f691f3db932.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 413, + 145, + 591, + 212 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/c4108908cad230e2ef3d0f3fb4c1ce204d33c59208e23fde577ef2342e9f82f9.jpg", + "image_caption": [ + "(c) Bilaterl grids $(K)$" + ], + "image_footnote": [], + "bbox": [ + 606, + 145, + 782, + 212 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/88c15d5703af9b53cab196c827ce3dc77efa090d06be3955da5f0c37a851e430.jpg", + "image_caption": [ + "(a) LUTGen hidden layer $(M_{t})$", + "(d) Extractor width $(m)$", + "Fig. 3: Ablation studies on different numbers of LUTGen hidden layers (a), GridGen hidden layer (b), bilateral grids (c), Extractor width (d), Bilateral grid vertices (e), and LUT vertices (f). $M_{b} = 0$ and $M_{t} = 0$ indicate bypassing the spatial feature fusion step and the color enhancement step, respectively." + ], + "image_footnote": [], + "bbox": [ + 220, + 231, + 398, + 297 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/85f19f9e82df6f1c75cab6f343c31f032262d6d60a388e19dd715c93bb3d1780.jpg", + "image_caption": [ + "(b) GridGen hidden layer $(M_b)$", + "(e) Bilateral grid vertices $(N_{s_b})$" + ], + "image_footnote": [], + "bbox": [ + 418, + 231, + 596, + 297 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/ce43bb92b51da0f864e7380a9c4d4dc4bc79c769d331b16313d13f455d7fbba5.jpg", + "image_caption": [ + "(f) LUT vertices $(N_{s_t})$" + ], + "image_footnote": [], + "bbox": [ + 616, + 234, + 782, + 297 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "implemented using CUDA extension to speed up. All experiments are conducted on an NVIDIA Tesla V100 GPU.", + "bbox": [ + 212, + 410, + 782, + 439 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 Ablation Studies", + "text_level": 1, + "bbox": [ + 215, + 462, + 400, + 476 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To verify the selection of hyper-parameters for our model and the interpolation method for slicing and 3D LUT transform, we perform ablation studies on photo retouch tasks with the FiveK dataset (480p). Before ablation studies, We conduct a random search and achieve better performance than other models with a PSNR of 25.52 dB, when the model is composed of the Extractor ( $m = 8$ ), bilateral grid modules ( $M_{b} = 24$ , $N_{s_{b}} = 17$ , $K = 3$ ) with trilinear interpolation, and 3D LUT modules ( $M_{t} = 24$ , $N_{s_{t}} = 17$ ) with tetrahedral interpolation. Hence, we start our ablation studies with the above hyper-parameters.", + "bbox": [ + 212, + 486, + 787, + 607 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Selection of LUTGen and GridGen Parameters We assess the performance according to the number of LUTGen hidden layers $(M_t)$ with initial hyper-parameters, as can be seen in Fig. 3a. We can see our model has the best performance at $M_t = 24$ . However, the difference between $M_t = 8$ and $M_t = 24$ in performance is only $0.02dB$ , while the difference in parameter numbers is $239.9K$ . Therefore, we set $M_t = 8$ in our following experiments.", + "bbox": [ + 212, + 628, + 787, + 718 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "After selecting $M_{t}$ , we explore the parameters of the GridGen for the number of GenLUT hidden layers ( $M_{b}$ ) and bilateral grids ( $K$ ). Although we find that $M_{b} = 32$ is the best as in Fig. 3b, we choose the $M_{b} = 8$ for the same reason of selecting $M_{t}$ ( $0.01dB \\uparrow / 359.9K \\uparrow$ ). Fig. 3c shows the performance with the change in the number of bilateral grids ( $K$ ). We select $K = 6$ because it shows a significant improvement in performance.", + "bbox": [ + 212, + 719, + 787, + 808 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The increases in the three parameters ( $M_{t}$ , $M_{b}$ , and $K$ ) generally leads to performance improvement. However, we can observe a decrease in performance", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 113, + 730, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/e61cece457cf4608aa7e4b9523f774941e380f55067e5cfda1134f8e611a6534.jpg", + "table_caption": [ + "Table 5: Ablation studies on losses, interpolation methods, and guidance map generation." + ], + "table_footnote": [], + "table_body": "
\\( {\\mathcal{L}}_{b} \\)\\( {\\mathcal{L}}_{c} \\)\\( {\\mathcal{L}}_{p} \\)Guidance map GenLUT InterpolationGrid InterpolationPSNR
oxxxTetraTri25.35
ooxxTetraTri25.21
oxoxTetraTri25.49
oooxTetraTetra25.50
oooxTriTetra25.49
oooxTriTri25.57
ooo1 × 1TetraTri23.42
ooo3 × 3TetraTri22.45
oooxTetraTri25.66
", + "bbox": [ + 215, + 234, + 475, + 351 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/297bc2aa5c36148f2099dd8138654c89d6588b9fa465f36c08813f64b54c7ab5.jpg", + "image_caption": [ + "Fig.4: Trade-off between performance and model size on FiveK dataset [4]. Ours $(N_{s_b},N_{s_t})$ indicates the proposed model which has $N_{s_b}$ bilateral vertices and $N_{s_t}$ LUT vertices. The circle size is proportional to the model size." + ], + "image_footnote": [], + "bbox": [ + 496, + 147, + 743, + 287 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "when parameters become too large. It seems that too complex network does not help to generate bilateral grids and 3D LUTs. The bilateral grid-only model $(M_{t} = 0)$ and LUT-only model $(M_{b} = 0)$ have relatively poor performance. These results show that each module contributes to performance improvement.", + "bbox": [ + 212, + 420, + 787, + 481 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Capacity of the Extractor We observe performance changes based on the difference in Extractor width $(m)$ to find structure which can generate optimal LUTs and bilateral grids. For more meticulous experiments, we make the variation on the number of LUT vertices $(N_{s_t})$ and bilateral grid vertices $(N_{s_b})$ . As shown in Fig. 3d, the best performance is achieved at $m = 8$ in all of the experiments.", + "bbox": [ + 212, + 508, + 787, + 602 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The Number of LUT Vertices and Bilateral Grid Vertices As can be seen in previous 3D LUT studies [28, 29, 38, 44-47], the number of vertices is an important factor in performance. Fig. 3e shows performance as different number of bilateral grid vertices. We can easily find that the optimal number of bilateral grid vertices is $N_{s_b} = 17$ . Ablation study for the number of LUT vertices can be seen in Fig. 3f. Although $N_{s_t} = 33$ has best performance, we select $N_{s_t} = 17$ after considering the trade-off in Fig. 4. The selected model is ours(17,17) in Fig. 4 and has a smaller size than other 3D LUT models [38, 44, 46] except [45] with better performance.", + "bbox": [ + 212, + 628, + 787, + 765 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Loss Function The first section of Tab. 5 shows performance differences regarding the loss. The combination of the three metrics shows the best performance, with the perceptual loss contributing the most to the performance improvement.", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/f7040f53f6035b344de7460bd1d04c1f9d88a268d340370437ef56ff4371ef9c.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 496, + 304 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/b46f2912bf4faf91aadb524c4f6a58c8969126568194b7ee6955f6fce4c5e182.jpg", + "image_caption": [ + "(b)", + "Fig. 5: Visual result of the feature maps. The pictures in the first column are input, combined image, and output, respectively. The error map on upper left of combined image indicates differences with input image. The other six are visualizations for each channel. The pixels closer to red indicate more activated and the pixels closer to blue indicate less activated." + ], + "image_footnote": [], + "bbox": [ + 506, + 143, + 785, + 304 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Interpolation Method We demonstrate the ablation study of interpolation methods on the second section of Tab. 5. Since trilinear interpolation can utilize all eight adjacent sampling points, it might have the advantage of reflecting surrounding information in the slicing operation. On the other hand, tetrahedral interpolation appears to enable more accurate reconstruction in 3D LUT transform. Hence, we do not change the setting on interpolation methods. The difference in inference time between interpolation methods is negligible.", + "bbox": [ + 212, + 428, + 784, + 534 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Guidance Map Generator Previous studies about bilateral grids [11,51] usually have generated guidance maps instead of directly using an input image. We conduct an ablation study with two versions of guidance map generators based on HDRNet [11] GitHub4, which is composed of $1 \\times 1$ convolution layers or $3 \\times 3$ convolution layers. The third section of Tab. 5 shows that the model with guidance map generators has relatively poor performance. It is believed that the guidance map generators make the network too complex and increase the learning difficulty. Furthermore, the guidance map generator brings exponential increase in inference time, 21.6ms and 46.7ms for the $1 \\times 1$ and $3 \\times 3$ generators, respectively. Hence, we decide to directly use input image as a guidance map.", + "bbox": [ + 212, + 556, + 787, + 709 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.4 Analysis of Spatial Feature", + "text_level": 1, + "bbox": [ + 215, + 729, + 483, + 744 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In this section, we provide the analysis of the spatial features by visualizations. Following [38], we do not apply any loss on the spatial features. The spatial features flexibly categorize an image depending on the context of the input image. The examples of spatial features can be seen in Fig. 5. The spatial feature", + "bbox": [ + 212, + 755, + 784, + 816 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 114, + 730, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_footnote", + "text": "4 https://github.com/gejinchen/DDRnet-PyTorch", + "bbox": [ + 217, + 823, + 568, + 840 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/cb049ccbab9d83f95f659ee6cf989e2a2578d0f377a6a2dc69dc1a992c2dfd07.jpg", + "table_caption": [ + "Table 6: Quantitative comparison results of photo retouch on the FiveK dataset [4]. “-” means the result is not available due to insufficient GPU memory. “*” indicates that the results are obtained from their paper and “/” are absent results due to publicly unavailable code. The best and second-best results are in red and blue, respectively." + ], + "table_footnote": [], + "table_body": "
Method#param480pFull Resolution (4K)
PSNRSSIMΔEabRuntimePSNRSSIMΔEabRuntime
UPE [37]927.1K21.880.85310.804.2721.650.85911.0956.88
DPE [9]3.4M23.750.9089.347.21----
HDRNet [11]483.1K24.660.9158.063.4924.520.9218.2056.07
DeepLPF [31]1.7M24.730.9167.9932.12----
CSRNet [14]36.4K25.190.9257.763.0924.820.9247.9477.10
3D LUT [46]593.5K25.290.9237.551.1725.250.9327.591.49
SA-3DLUT* [38]4.5M25.50//2.27///4.39
SepLUT* [45]119.8K25.470.9217.541.1025.430.9327.561.20
AdaInt [44]619.7K25.490.9267.471.2925.480.9347.451.59
Ours463.7K25.660.9307.291.2025.660.9377.273.64
", + "bbox": [ + 222, + 212, + 781, + 383 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/34b4d72b4d5ffb8907c2d7c9a7c729e8fef71f671a90f788e887c190dce28967.jpg", + "table_caption": [ + "Table 7: Quantitative comparisons on the FiveK dataset [4] for tone mapping." + ], + "table_footnote": [], + "table_body": "
Method480p
PSNRSSIMΔEab
UPE [37]21.560.83712.29
DPE [9]22.930.89411.09
HDRNet [11]24.520.9158.14
CSRNet [14]25.190.9217.63
3DLUT [46]25.070.9207.55
SepLUT* [45]25.430.9227.43
AdaInt [44]25.280.9257.48
Ours25.590.9327.14
", + "bbox": [ + 217, + 441, + 431, + 577 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/fd8e18599a3b5bd6b7af49c0b49e84b12942612195646ab5884d2139d1be72e3.jpg", + "table_caption": [ + "Table 8: Quantitative comparisons on the PPR10K dataset [28] for photo retouch." + ], + "table_footnote": [], + "table_body": "
DatasetMethodPSNRΔEabPSRHCΔEa
PPR10K-a3DLUT [46]25.646.9728.894.53
SepLUT* [45]26.286.59//
AdaInt [44]26.336.5629.574.26
Ours26.456.5129.704.23
PPR10K-b3DLUT [46]24.707.7127.994.99
SepLUT* [45]25.237.49//
AdaInt [44]25.407.3328.654.75
Ours25.487.1928.724.66
PPR10K-c3DLUT [46]25.187.5828.494.92
SepLUT* [45]25.597.51//
AdaInt [44]25.687.3128.934.76
Ours25.727.2829.004.72
", + "bbox": [ + 446, + 422, + 772, + 580 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "$\\phi_{2}$ and $\\phi_{5}$ represent bright and dark areas of the image, respectively. The $\\phi_{1}$ compensates for dark areas and $\\phi_{4}$ covers overall area. The $\\phi_{0}$ and $\\phi_{3}$ are in charge of details of the bright area. The combined images undergoes local adjustments based on spatial features. This analysis shows that spatial feature provide pixel-wise spatial-aware weights for local enhancement.", + "bbox": [ + 212, + 608, + 787, + 684 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Comparison with State-of-the-Arts", + "text_level": 1, + "bbox": [ + 214, + 704, + 550, + 719 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We compare our methods with other SOTA real-time image enhancement methods. We especially focused on our experiments with other 3D LUT models [28, 38, 44-46]. However, we only provide quantitative results in the case of [38] and [45] since they do not provide publicly available code.", + "bbox": [ + 212, + 728, + 785, + 789 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Quantitative Comparisons For quantitative comparisons, three metrics are used: PSNR, SSIM [39], $L_{2}$ -distance in CIE LAB color space ( $\\Delta E_{ab}$ ) on FiveK", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/1ac93f2d19030e78cddd8c9d28a6b73d0d36bf700d24d2754eb9f6e3e21ef9c1.jpg", + "image_caption": [ + "Fig. 6: Qualitative comparisons on the FiveK dataset [4] for photo retouch. The corresponding error maps on the upper right of each picture indicate differences with ground truth, where each color indicates the degree of error based on the corresponding color bars on the right." + ], + "image_footnote": [], + "bbox": [ + 217, + 142, + 787, + 362 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "dataset. We include the human-centered PSNR $(PSNR^{HC})$ and color difference $(\\Delta E_{ab}^{HC})$ [28] on PPR10K dataset. Tab. 6 shows comparisons on the FiveK dataset for photo retouch. The inference time is measured on the same image set, by running 100 times and averaging them. Our method outperforms other methods on both resolutions. Similar results can be seen in Tab. 7 for the tone mapping task on FiveK dataset, and in Tab. 8 for the photo retouch task on the PPR10K dataset. We also provide analysis for runtime increment on 4K resolution and standard deviations of runtime in supplementary materials.", + "bbox": [ + 212, + 455, + 787, + 577 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Especially, the results show that we alleviate the intrinsic problems of the spatial-aware LUT method mentioned in previous work, the tremendous model size, and the long inference time. Our method has a much smaller size than SA-3DLUT [38] (about 1/10 times). This number of parameters is even smaller than AdaInt [44] and 3DLUT [46]. Furthermore, we have already shown that ours(9, 9) outperforms the SepLUT [45] with a similar model size in Fig. 4. The inference time on $480\\mathrm{p}$ is smaller than SA-3DLUT [38] (about 1/2 times) and similar to other LUT methods [44-46]. Although the inference time is increased in the case of 4K resolution, it is still shorter than SA-3DLUT [38].", + "bbox": [ + 212, + 578, + 787, + 715 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Qualitative Comparisons The qualitative comparisons can be seen in Fig. 6 with corresponding error maps on the upper right of each picture. Each color of the error map indicates the difference with ground truth based on the corresponding color bars on the right.", + "bbox": [ + 212, + 733, + 787, + 794 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In the first row of Fig. 6, it can be observed that our method performs better than others in local enhancement. The 3DLUT and AdaInt of the dark area captured in the red rectangle appear somber compared to the ground truth.", + "bbox": [ + 212, + 795, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 113, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "On the other hand, the CSRNet is entirely reddish. Our method enhances the image in both dark and bright areas, making it closer to the ground truth. In the second row of Fig. 6, it can be observed that our method is capable of producing vivid colors. Comparing the leaf on the blue rectangle in our method to the other methods, it can be seen that our method produces a clearer green color. Similarly, the red color at the end of the yellow leaves in the red rectangle is also improved. The last row of the figure shows that our model has improved the overall color of the image. Specifically, the color of the ground and seat in the red and blue rectangles is closer to the ground truth than the other methods.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Limitations and Discussion", + "text_level": 1, + "bbox": [ + 215, + 314, + 511, + 330 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Although our inference time is effectively reduced compared to SA-3DLUT [38], we have observed that the inference time increases as the resolution increases. This is a common issue with spatial-aware methods. However, we believe that a processing time of 3.6ms is sufficient for real-time high-resolution video processing. However, there may be some special applications in the future that require constraints such as a resolution greater than 8K or a frame rate exceeding 200 fps. To address these challenges, we plan to investigate the correlation between image resolution and processing time and explore methods that process spatial features with a unit of patch or super-pixel [2], which could be one of the potential solutions.", + "bbox": [ + 212, + 356, + 787, + 507 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Another future work is to apply the adaptive sampling [44] to a bilateral grid. When we apply the adaptive sampling on the 3D LUT, the performance is downgraded by $0.15\\mathrm{dB}$ on PSNR. It seems that the adaptive sampling effect has already been reflected in the spatial feature fusion step. However, we believe that adaptive sampling on the bilateral grids could effectively handle adaptive local enhancement.", + "bbox": [ + 212, + 508, + 787, + 599 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 632, + 359, + 648 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We have developed a method that utilizes bilateral grids to create a learnable spatial-aware 3D LUT for fast image enhancement. The bilateral grid is an effective way of conveying spatial information because its data structure can provide spatial features through a non-parametric slicing process. Our framework is designed to enhance local areas efficiently, resulting in improved results. We have extensively tested our method on two datasets and have demonstrated that it outperforms other state-of-the-art methods in terms of both performance and efficiency. Our model achieves state-of-the-art performance with a relatively small model size and short inference time. Additionally, we have achieved better performance by using an appropriate interpolation method for slicing and 3D LUT transform.", + "bbox": [ + 212, + 672, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] and in part by the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University in 2024.", + "bbox": [ + 212, + 175, + 787, + 265 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 287, + 321, + 303 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. A Sharif, S., Naqvi, R.A., Biswas, M., Kim, S.: A two-stage deep network for high dynamic range image reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 550-559 (2021)", + "2. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Süsstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE transactions on pattern analysis and machine intelligence 34(11), 2274-2282 (2012)", + "3. Akyüz, A.O., et al.: Deep joint deinterlacing and denoising for single shot dual-iso hdr reconstruction. IEEE Transactions on Image Processing 29, 7511-7524 (2020)", + "4. Bychkovsky, V., Paris, S., Chan, E., Durand, F.: Learning photographic global tonal adjustment with a database of input/output image pairs. In: CVPR 2011. pp. 97-104. IEEE (2011)", + "5. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018)", + "6. Chen, J., Adams, A., Wadhwa, N., Hasinoff, S.W.: Bilateral guided upsampling. ACM Transactions on Graphics (TOG) 35(6), 1-8 (2016)", + "7. Chen, J., Paris, S., Durand, F.: Real-time edge-aware image processing with the bilateral grid. ACM Transactions on Graphics (TOG) 26(3), 103-es (2007)", + "8. Chen, X., Liu, Y., Zhang, Z., Qiao, Y., Dong, C.: Hdrunet: Single image hdr reconstruction with denoising and dequantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 354-363 (2021)", + "9. Chen, Y.S., Wang, Y.C., Kao, M.H., Chuang, Y.Y.: Deep photo enhancer: Unpaired learning for image enhancement from photographs with gans. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6306-6314 (2018)", + "0. Deng, Y., Loy, C.C., Tang, X.: Aesthetic-driven image enhancement by adversarial learning. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 870-878 (2018)", + "1. Gharbi, M., Chen, J., Barron, J.T., Hasinoff, S.W., Durand, F.: Deep bilateral learning for real-time image enhancement. ACM Transactions on Graphics (TOG) 36(4), 1-12 (2017)", + "12. Guo, C., Fan, L., Zhang, Q., Liu, H., Liu, K., Jiang, X.: Redistributing the precision and content in 3d-lut-based inverse tone-mapping for hdr/wcg display. In: Proceedings of the 20th ACM SIGGRAPH European Conference on Visual Media Production. pp. 1-10 (2023)", + "13. Hashimoto, N., Takamaeda-Yamazaki, S.: An fpga-based fully pipelined bilateral grid for real-time image denoising. In: 2021 31st International Conference on Field-Programmable Logic and Applications (FPL). pp. 167-173. IEEE (2021)" + ], + "bbox": [ + 218, + 316, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 113, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. He, J., Liu, Y., Qiao, Y., Dong, C.: Conditional sequential modulation for efficient global image retouching. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 679-695. Springer (2020)", + "15. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)", + "16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018)", + "17. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: HDR-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022)", + "18. Huang, X., Belongie, S.: Arbitrary style transfer in real-time with adaptive instance normalization. In: Proceedings of the IEEE international conference on computer vision. pp. 1501-1510 (2017)", + "19. Ignatov, A., Kobyshev, N., Timofte, R., Vanhoey, K., Van Gool, L.: Dslr-quality photos on mobile devices with deep convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 3277-3285 (2017)", + "20. Jiang, Y., Gong, X., Liu, D., Cheng, Y., Fang, C., Shen, X., Yang, J., Zhou, P., Wang, Z.: Enlightengan: Deep light enhancement without paired supervision. IEEE transactions on image processing 30, 2340-2349 (2021)", + "21. Jiang, Y., Zhang, H., Zhang, J., Wang, Y., Lin, Z., Sunkavalli, K., Chen, S., Amirghodsi, S., Kong, S., Wang, Z.: Ssh: A self-supervised framework for image harmonization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4832-4841 (2021)", + "22. Karaimer, H.C., Brown, M.S.: A software platform for manipulating the camera imaging pipeline. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part I 14. pp. 429-444. Springer (2016)", + "23. Kim, H.U., Koh, Y.J., Kim, C.S.: Pienet: Personalized image enhancement network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXX 16. pp. 374-390. Springer (2020)", + "24. Kim, S.Y., Oh, J., Kim, M.: Jsi-gan: Gan-based joint super-resolution and inverse tone-mapping with pixel-wise task-specific filters for uhd hdr video. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 11287-11295 (2020)", + "25. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)", + "26. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012)", + "27. Le, P.H., Le, Q., Nguyen, R., Hua, B.S.: Single-image hdr reconstruction by multiexposure generation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4063-4072 (2023)", + "28. Liang, J., Zeng, H., Cui, M., Xie, X., Zhang, L.: Ppr10k: A large-scale portrait photo retouching dataset with human-region mask and group-level consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 653-661 (2021)", + "29. Liu, C., Yang, H., Fu, J., Qian, X.: 4d lut: learnable context-aware 4d lookup table for image enhancement. IEEE Transactions on Image Processing 32, 4742-4756 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "30. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020)", + "31. Moran, S., Marza, P., McDonagh, S., Parisot, S., Slabaugh, G.: Deeplpf: Deep local parametric filters for image enhancement. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12826-12835 (2020)", + "32. Park, J., Lee, J.Y., Yoo, D., Kweon, I.S.: Distort-and-recover: Color enhancement using deep reinforcement learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5928-5936 (2018)", + "33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)", + "34. Song, Y., Qian, H., Du, X.: Starenhancer: Learning real-time and style-aware image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4126-4135 (2021)", + "35. Vandenberg, J.D., Andriani, S.: A survey on 3d-lut performance in 10-bit and 12-bit hdr bt. 2100 pq. In: SMPTE 2018. pp. 1-19. SMPTE (2018)", + "36. Wang, D., Zheng, Z., Ding, W., Jia, X.: Lgabl: Uhd multi-exposure image fusion via local and global aware bilateral learning. IEEE Transactions on Emerging Topics in Computational Intelligence (2023)", + "37. Wang, R., Zhang, Q., Fu, C.W., Shen, X., Zheng, W.S., Jia, J.: Underexposed photo enhancement using deep illumination estimation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6849-6857 (2019)", + "38. Wang, T., Li, Y., Peng, J., Ma, Y., Wang, X., Song, F., Yan, Y.: Real-time image enhancer via learnable spatial-aware 3d lookup tables. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2471-2480 (2021)", + "39. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)", + "40. Wei, C., Wang, W., Yang, W., Liu, J.: Deep retina decomposition for low-light enhancement. arXiv preprint arXiv:1808.04560 (2018)", + "41. Xu, B., Xu, Y., Yang, X., Jia, W., Guo, Y.: Bilateral grid learning for stereo matching networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12497-12506 (2021)", + "42. Xu, Q., Wang, L., Wang, Y., Sheng, W., Deng, X.: Deep bilateral learning for stereo image super-resolution. IEEE Signal Processing Letters 28, 613-617 (2021)", + "43. Yan, Z., Zhang, H., Wang, B., Paris, S., Yu, Y.: Automatic photo adjustment using deep neural networks. ACM Transactions on Graphics (TOG) 35(2), 1-15 (2016)", + "44. Yang, C., Jin, M., Jia, X., Xu, Y., Chen, Y.: Adaint: Learning adaptive intervals for 3d lookup tables on real-time image enhancement. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17522-17531 (2022)", + "45. Yang, C., Jin, M., Xu, Y., Zhang, R., Chen, Y., Liu, H.: Seplut: Separable image-adaptive lookup tables for real-time image enhancement. In: European Conference on Computer Vision (ECCV). pp. 201-217. Springer (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "LUT with Bilateral Grid", + "bbox": [ + 563, + 113, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. Zeng, H., Cai, J., Li, L., Cao, Z., Zhang, L.: Learning image-adaptive 3d lookup tables for high performance photo enhancement in real-time. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) 44(4), 2058-2073 (2022)", + "47. Zhang, F., Zeng, H., Zhang, T., Zhang, L.: Clut-net: Learning adaptively compressed representations of 3dluts for lightweight image enhancement. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 6493-6501 (2022)", + "48. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)", + "49. Zhang, Y., Zhang, J., Guo, X.: Kindling the darkness: A practical low-light image enhancer. In: Proceedings of the 27th ACM international conference on multimedia. pp. 1632-1640 (2019)", + "50. Zhang, Z., Jiang, Y., Jiang, J., Wang, X., Luo, P., Gu, J.: Star: A structure-aware lightweight transformer for real-time image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4106-4115 (2021)", + "51. Zheng, Z., Ren, W., Cao, X., Wang, T., Jia, X.: Ultra-high-definition image hdr reconstruction via collaborative bilateral learning. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 4449-4458 (2021)", + "52. Zhou, Y., Li, C., Liang, J., Xu, T., Liu, X., Xu, J.: 4k-resolution photo exposure correction at 125 fps with $\\sim$ 8k parameters. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1587-1597 (2024)" + ], + "bbox": [ + 215, + 146, + 785, + 452 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Kim and Cho", + "bbox": [ + 271, + 114, + 364, + 127 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_model.json b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_model.json new file mode 100644 index 0000000000000000000000000000000000000000..40473242d706031a503ae913f7a96b9ea6486fc3 --- /dev/null +++ b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_model.json @@ -0,0 +1,2546 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.227, + 0.141, + 0.78, + 0.187 + ], + "angle": 0, + "content": "Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids" + }, + { + "type": "text", + "bbox": [ + 0.362, + 0.213, + 0.642, + 0.229 + ], + "angle": 0, + "content": "Wontae \\(\\mathrm{Kim}^{1,3}\\) and Nam Ik Cho\\(^{1,2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.341, + 0.24, + 0.662, + 0.255 + ], + "angle": 0, + "content": "\\(^{1}\\) IPAI, Seoul National University, Seoul, Korea" + }, + { + "type": "text", + "bbox": [ + 0.265, + 0.255, + 0.737, + 0.269 + ], + "angle": 0, + "content": "\\(^{2}\\) Department of ECE, INMC, Seoul National University, Seoul, Korea" + }, + { + "type": "text", + "bbox": [ + 0.444, + 0.268, + 0.56, + 0.282 + ], + "angle": 0, + "content": "3 LG Electronics" + }, + { + "type": "text", + "bbox": [ + 0.405, + 0.284, + 0.6, + 0.296 + ], + "angle": 0, + "content": "{munte2, nicho}@snu.ac.kr" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.344, + 0.744, + 0.594 + ], + "angle": 0, + "content": "Abstract. Image enhancement and restoration methods using adaptive 3D lookup tables (3D LUTs) have shown promising results with real-time inferencing. These methods directly transform input pixel values into enhanced ones by using interpolation operations with predicted 3D LUT values. However, it is still challenging to deal with locally different properties of images since most 3D LUT methods are simple color-to-color transforms. Although including spatial information in this transform can be a good solution, it can significantly increase the number of parameters and inference time. To address this issue, we propose an efficient spatial-aware image enhancement model that combines bilateral grids and 3D LUTs. Specifically, we transform bilateral grids into a spatial feature domain to incorporate spatial information in our 3D LUT model. To reduce inference time and save parameters, we use slicing operations in our network architecture instead of the long decoding path of the U-Net architecture used in most existing studies. Our model achieves state-of-the-art performance without increasing parameters and further reduces inference time, as demonstrated by extensive results. Codes are available at https://github.com/WontaeaeKim/LUTwithBGrid" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.608, + 0.66, + 0.622 + ], + "angle": 0, + "content": "Keywords: Image enhancement \\(\\cdot\\) 3D LUT \\(\\cdot\\) Bilateral grid" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.652, + 0.377, + 0.669 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Image enhancement has become increasingly popular with the widespread use of high-resolution and wide-color-gamut display devices and cameras. Recently, deep learning-based approaches have shown impressive results by extracting and utilizing effective features of images [1,3,5,8-10,17,19,20,23,24,27,30,31,40,43, 49]. However, these approaches require high computational costs and long inference times. To address this problem, researchers have investigated a learningbased 3D lookup table (3D LUT) as an alternative [12,21,28,29,34,38,44-47,50]. The 3D LUT instantly converts input color values to improved ones by interpolating pre-computed values in the 3D LUT instead of performing repeated computations, effectively reducing computational costs." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.344 + ], + "angle": 0, + "content": "Specifically, Zeng et al. proposed a convolutional neural network (CNN) model that predicts the values needed to create an efficient 3D LUT [46]. However, the authors have also addressed the limitation in that it only provides a color-to-color transformation and lacks spatial information. This means that it may not be effective in enhancing certain areas of an image that require local adjustments. To address this limitation, a spatially adaptive method (SA-3DLUT) was proposed, which uses a U-net style backbone to incorporate spatial information [38]. This approach achieves state-of-the-art performance, but requires a significantly larger number of parameters than previous plain LUT approaches. Other advanced 3D LUT methods [28, 29, 44, 45, 47] have also improved image quality, but the issue of missing spatial information remains a challenge. As can be seen in prior studies, including spatial information without an expanded model is very challenging." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.344, + 0.788, + 0.508 + ], + "angle": 0, + "content": "To solve this issue, we introduce the method using bilateral grids to incorporate spatial information while reducing computational costs and model size. The bilateral grid is a data structure consisting of 2D spatial dimensions and 1D intensity dimension [7]. Recent deep learning-based approaches generate the bilateral grids from an image and transform them into features or coefficients by slicing operation for their purpose [6,11,13,36,41,42,51,52]. Slicing can help to reduce computational costs due to its non-parametric property [7]. The experiments of Gharbi et al. [11] showed that slicing with the bilateral grids achieve better performance and shorter running time compared to U-net in the Local Laplacian task. To take those advantages, our method generates spatial features from slicing with bilateral grids instead of the U-Net." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.629 + ], + "angle": 0, + "content": "The overall architecture of our method is shown in Fig. 1. We use the Extractor to extract image context from the input image, which is used to generate image-adaptive bilateral grids and 3D LUTs. The bilateral grids provide spatial-aware property to our model after transformed to spatial features by slicing. Finally, the input image combined with spatial features is used to generate the enhanced image by the 3D LUT transform. The experiments show that this architecture can achieve better performance with relatively small number of parameters." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.788, + 0.691 + ], + "angle": 0, + "content": "In addition, we also explore tetrahedral interpolation as well as trilinear interpolation to apply effective interpolation methods when slicing and 3D LUT transformation. We find that tetrahedral and trilinear interpolation provide the optimal performance to 3D LUTs and bilateral grids, respectively." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.691, + 0.574, + 0.706 + ], + "angle": 0, + "content": "The contributions of this paper are three-fold:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.712, + 0.784, + 0.741 + ], + "angle": 0, + "content": "- We introduce a new application of bilateral grids for 3D LUT construction, incorporating spatial features using only a small number of parameters." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.741, + 0.784, + 0.786 + ], + "angle": 0, + "content": "- We propose an efficient architecture for spatial-aware 3D LUTs that leverages a cascade of bilateral grids and 3D LUTs. This architecture produces an improved output with fewer parameters." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.786, + 0.784, + 0.83 + ], + "angle": 0, + "content": "- We conduct extensive experiments to compare our approach with existing methods on two publicly available benchmark datasets. Results demonstrate the efficiency and effectiveness of our method in image enhancement." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.712, + 0.784, + 0.83 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.143, + 0.775, + 0.375 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.385, + 0.788, + 0.456 + ], + "angle": 0, + "content": "Fig. 1: Framework of the proposed method. An image context is extracted from a downsampled image, which is then used to predict bilateral grids and 3D LUTs. The bilateral grids are transformed into spatial features by slicing operation. After being combined with spatial features by a \\(1 \\times 1\\) convolution layer, the combined image is converted to a spatial-aware enhanced image by 3D LUT interpolation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.488, + 0.388, + 0.504 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.533, + 0.788, + 0.684 + ], + "angle": 0, + "content": "In this section, we will briefly review hybrid methods that combine deep-learning and traditional methods to achieve better image enhancement. Typically, methods that use only deep learning [5, 9, 10, 19, 20, 23, 37, 40, 43, 49] predict all pixels on images with numerous deep neural layers. While these methods can deliver high performance, they require heavy computational costs and resources. On the other hand, hybrid methods predict the parameters of traditional models, such as the coefficients of color transform [14, 16, 32], bilateral grids [11, 51], or 3D LUT [28, 29, 38, 44-47], instead of directly predicting enhanced images. It has been shown that hybrid methods achieve better performance than deep-learning-only methods while requiring relatively shallow networks and light resources." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.687, + 0.788, + 0.763 + ], + "angle": 0, + "content": "The methods predicting coefficients of color transform mimic human experts' photo retouch process, which adjusts brightness, contrast, tone mapping curves, or white balance. To be precise, [16,32] apply color transforms based on the current image state through the reinforcement learning approach, while [14] replaces traditional color transform into multi-layer perceptrons (MLPs)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Gharbi et al. introduced HDRNet framework [11] that produces enhanced images with pixel-wise affine transform and coefficients reconstructed from predicted bilateral grids. Zheng et al. introduced collaborative learning [51] with bilateral grids and LeakyAdaIN, an extension of adaptive instance normalization (AdaIN) [18], to reconstruct UHD HDR image from input image in real-time." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.329 + ], + "angle": 0, + "content": "Zeng et al. showed that the weighted sum of basis LUTs can achieve image-adaptive enhancement with a simple CNN weight predictor [46]. Yang et al. combined 1D LUTs [45] and adaptive intervals [44] with [46] to improve the capacity of LUTs. The 4D LUT was introduced in [29], which is a combination of context channel (1D) and RGB channels (3D). The above LUT methods achieved promising performance with a light network and fast inference speed. However, these methods still suffer from a lack of spatial information to handle local enhancement in an image. Although SA-3DLUT [38] provides spatial information with U-NET [33] style backbone network, it requires a tremendous number of parameters and inference time. In the following section, we will introduce a new method that is a combination of LUTs and bilateral grids to provide color enhancement and spatial information, respectively, without parameter increase." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.352, + 0.427, + 0.369 + ], + "angle": 0, + "content": "3 Proposed Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.384, + 0.789, + 0.568 + ], + "angle": 0, + "content": "We present our network and loss functions in this section. The overall network architecture comprises three steps, as illustrated in Fig. 1: image context extraction, spatial feature fusion, and color enhancement. A simple CNN network extracts image context vectors, which are then fed to the GridGen and LUTGen modules to generate image-adaptive bilateral grids and 3D LUTs. Spatial feature fusion and color enhancement are sequentially carried out using bilateral grids and 3D LUTs, respectively. This cascade structure is effective in image signal processing [22,45], where each module focuses on its specific functionality. The slicing operation cost-effectively generates spatial features from bilateral grids, which have the same resolution as the input image. The spatial features are combined with an input image by the \\(1 \\times 1\\) convolution. The combined image is transformed into an enhanced image by interpolation operation on 3D LUTs." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.588, + 0.48, + 0.604 + ], + "angle": 0, + "content": "3.1 Preliminary: Interpolation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.788, + 0.719 + ], + "angle": 0, + "content": "In this section, we will delve into trilinear and tetrahedral interpolation methods, which are used in the slicing operation and 3D LUT transform. The interpolation process involves two steps, looking up to find adjacent points for a query point \\( P = (p_x,p_y,p_z) \\) and then computing the weighted sum of those adjacent points. To simplify the computation process, we assume a normalized three-dimensional grid \\( G\\in \\mathbb{R}^{N_s\\times N_s\\times N_s} \\), such as a 3D LUT or a bilateral grid, where \\( N_{s} \\) is the number of vertices." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Trilinear interpolation finds the eight adjacent points in the lookup step, where the left and right adjacent points on each axis \\(\\alpha \\in \\{x,y,z\\}\\) are denoted as \\(p_{\\alpha}^{0}, p_{\\alpha}^{1}\\). If the grid has uniform lattices, the adjacent point can be found as \\(p_{\\alpha}^{0} = \\lfloor p_{\\alpha} \\cdot (N_{s} - 1) \\rfloor / (N_{s} - 1)\\) and \\(p_{\\alpha}^{1} = p_{\\alpha}^{0} + 1 / (N_{s} - 1)\\), where \\(\\lfloor \\cdot \\rfloor\\) is the floor operator and \\(p_{\\alpha}\\) is a query point on \\(\\alpha\\) axis. In the case of non-uniform lattices, adjacent points can be found by the binary search [44]. The weight indicates how much an adjacent point influences the query point, which is denoted as \\(w_{i,j,k} = (\\varDelta_x)^i(1-\\varDelta_x)^{1-i}(\\varDelta_y)^j(1-\\varDelta_y)^{1-j}(\\varDelta_z)^k(1-\\varDelta_z)^{1-k}\\), where \\(\\varDelta_{\\alpha}=\\)" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.147, + 0.501, + 0.282 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.284, + 0.504, + 0.31 + ], + "angle": 0, + "content": "Fig.2: Description of tetrahedral interpolation" + }, + { + "type": "table_caption", + "bbox": [ + 0.518, + 0.177, + 0.795, + 0.218 + ], + "angle": 0, + "content": "Table 1: Weights and adjacent points of tetrahedral interpolation depending on the condition" + }, + { + "type": "table", + "bbox": [ + 0.518, + 0.23, + 0.797, + 0.296 + ], + "angle": 0, + "content": "
TetrahedronCondition\\( {w}_{0} \\)\\( {w}_{1} \\)\\( {w}_{2} \\)\\( {w}_{3} \\)\\( {V}_{1} \\)\\( {V}_{2} \\)
\\( {t}_{0} \\)\\( {\\Delta }_{x} > {\\Delta }_{y} > {\\Delta }_{z} \\)1 \\( - {\\Delta }_{x} \\)\\( {\\Delta }_{x} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} \\)\\( {V}_{100} \\)\\( {V}_{110} \\)
\\( {t}_{1} \\)\\( {\\Delta }_{x} > {\\Delta }_{z} > {\\Delta }_{y} \\)1 \\( - {\\Delta }_{x} \\)\\( {\\Delta }_{x} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} \\)\\( {V}_{101} \\)\\( {V}_{101} \\)
\\( {t}_{2} \\)\\( {\\Delta }_{y} > {\\Delta }_{z} > {\\Delta }_{z} \\)1 \\( - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{x} \\)\\( {\\Delta }_{z} \\)\\( {V}_{010} \\)\\( {V}_{110} \\)
\\( {t}_{3} \\)\\( {\\Delta }_{y} > {\\Delta }_{z} > {\\Delta }_{x} \\)1 \\( - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{x} \\)\\( {\\Delta }_{x} \\)\\( {V}_{010} \\)\\( {V}_{011} \\)
\\( {t}_{4} \\)\\( {\\Delta }_{z} > {\\Delta }_{y} > {\\Delta }_{y} \\)1 \\( - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} \\)\\( {V}_{001} \\)\\( {V}_{011} \\)
\\( {t}_{5} \\)\\( {\\Delta }_{z} > {\\Delta }_{y} > {\\Delta }_{x} \\)1 \\( - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{x} \\)\\( {\\Delta }_{x} \\)\\( {V}_{001} \\)\\( {V}_{011} \\)
" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.354, + 0.785, + 0.386 + ], + "angle": 0, + "content": "\\((p_{\\alpha} - p_{\\alpha}^{0}) / (p_{\\alpha}^{1} - p_{\\alpha}^{0})\\). Denoting the value corresponding to adjacent points on the grid \\(G\\) as \\(V_{i,j,k}\\), the trilinear interpolation \\(I_{tri}(\\cdot)\\) is formulated as" + }, + { + "type": "equation", + "bbox": [ + 0.375, + 0.396, + 0.786, + 0.431 + ], + "angle": 0, + "content": "\\[\nI _ {t r i} (P, G) = \\sum_ {i, j, k \\in \\{0, 1 \\}} w _ {i, j, k} \\cdot V _ {i, j, k}. \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.436, + 0.788, + 0.512 + ], + "angle": 0, + "content": "As can be seen in Tab. 1 and Fig. 2, the tetrahedral interpolation can be carried out with four adjacent sampling point values \\( V_{n} \\) and weights \\( w_{n} \\) (\\( n \\in \\{0,1,2,3\\} \\)) depending on \\( \\varDelta_x \\), \\( \\varDelta_y \\) and \\( \\varDelta_z \\). Detailed conditions are described in Tab. 1, where \\( V_{0} \\) and \\( V_{3} \\) are fixed at \\( V_{000} \\) and \\( V_{111} \\), respectively. Tetrahedral interpolation \\( I_{tetra}(\\cdot) \\) can be represented as" + }, + { + "type": "equation", + "bbox": [ + 0.383, + 0.522, + 0.787, + 0.557 + ], + "angle": 0, + "content": "\\[\nI _ {t e t r a} (P, G) = \\sum_ {n \\in \\{0, 1, 2, 3 \\}} w _ {n} \\cdot V _ {n}. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.567, + 0.788, + 0.659 + ], + "angle": 0, + "content": "The previous 3D LUT methods [28, 29, 38, 44-47] considered only trilinear interpolation when retrieving enhanced color values. However, experiments of Vandenberg et al. [35] showed that tetrahedral interpolation has better performance on image processing with fixed 3D LUTs. After we explore how the two interpolation methods affect our model in the Sec. 4.3, we determine the interpolation methods for 3D LUT transform and slicing." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.68, + 0.48, + 0.696 + ], + "angle": 0, + "content": "3.2 Image Context Extraction" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.705, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Our framework is designed to be adaptive to images using image context extraction. The first step in this process is to bilinear downsample the input image \\(X \\in \\mathbb{R}^{3 \\times H \\times W}\\). This allows our model to process images at arbitrary resolutions. The downsampled image \\(\\hat{X}\\) is then processed by the Extractor to create image contexts. The Extractor is made up of five layers of CNN, which is sufficient to provide image context for bilateral grids and 3D LUTs [38,44-46]. The details are depicted in Tab. 2 where \\(m\\) is a hyper-parameter related to the Extractor width. Each convolution layer consists of 2 strided \\(3 \\times 3\\) convolution, LeakyReLU, and instance normalization (except layer 5). The image context is produced by the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.174, + 0.477, + 0.244 + ], + "angle": 0, + "content": "Table 2: Details of the Extractor. Conv, \\( LR \\), and \\( IN \\) represent \\( 3 \\times 3 \\) convolution block (stride=2, padding=1), LeakyReLU, and instance normalization, respectively." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.256, + 0.472, + 0.4 + ], + "angle": 0, + "content": "
LayerOutput Shape
Bilinear Downsample3 × 256 × 256
Conv + LR + INm × 128 × 128
Conv + LR + IN2m × 64 × 64
Conv + LR + IN4m × 32 × 32
Conv + LR + IN8m × 16 × 16
Conv + LR8m × 8 × 8
Droupout (0.5)8m × 8 × 8
Average Pooling8m × 2 × 2
Reshape32m
" + }, + { + "type": "table_caption", + "bbox": [ + 0.532, + 0.145, + 0.782, + 0.229 + ], + "angle": 0, + "content": "Table 3: Details of the GridGen, where \\(FC\\) is the fully connected layer. \\(M_b\\), \\(K\\), and \\(N_{s_b}\\) are hyperparameters for the number of hidden layers, bilateral grids, and bilateral grid vertices, respectively." + }, + { + "type": "table", + "bbox": [ + 0.549, + 0.241, + 0.765, + 0.285 + ], + "angle": 0, + "content": "
LayerOutput Shape
FC (hb0)Mb
FC (hb1)K·Nsb
" + }, + { + "type": "table_footnote", + "bbox": [ + 0.555, + 0.286, + 0.763, + 0.3 + ], + "angle": 0, + "content": "Reshape \\(K\\times N_{s_b}\\times N_{s_b}\\times N_{s_b}\\)" + }, + { + "type": "table_footnote", + "bbox": [ + 0.534, + 0.301, + 0.78, + 0.356 + ], + "angle": 0, + "content": "Table 4: Details of the LUTGen. \\(M_{t}\\) and \\(N_{s_t}\\) are hyper-parameters for the number of hidden layers and 3D LUT vertices, respectively." + }, + { + "type": "table", + "bbox": [ + 0.553, + 0.369, + 0.761, + 0.428 + ], + "angle": 0, + "content": "
LayerOutput Shape
FC (ht0)Mt
FC (ht1)3Nst3
Reshape3 × Nst × Nst × Nst
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.785, + 0.505 + ], + "angle": 0, + "content": "average pooling layer and reshaped as a vector. This context will be fed to the GridGen and LUTGen module. The complete image context extraction can be expressed as" + }, + { + "type": "equation", + "bbox": [ + 0.465, + 0.507, + 0.785, + 0.526 + ], + "angle": 0, + "content": "\\[\n\\rho = f (\\hat {X}) \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.784, + 0.566 + ], + "angle": 0, + "content": "where \\(\\rho \\in \\mathbb{R}^{32m}\\) is image context vector predicted by image context extraction process \\(f(\\cdot)\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.595, + 0.596, + 0.611 + ], + "angle": 0, + "content": "3.3 Spatial Feature Fusion by Bilateral Grid" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.627, + 0.785, + 0.657 + ], + "angle": 0, + "content": "In this section, we describe the processes to provide spatial features, which are bilateral grid generation, slicing, and fusion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.687, + 0.788, + 0.807 + ], + "angle": 0, + "content": "Bilateral Grids Generation The GridGen module transforms image context vector into bilateral grids \\( B \\in \\mathbb{R}^{K \\times N_{s_b} \\times N_{s_b} \\times N_{s_b}} \\) where \\( K \\) is the number of bilateral grids and \\( N_{s_b} \\) is the number of vertices along each dimension. In our model, the two axes of bilateral grids represent sampling points of spatial coordinates, and the other one represents the color coefficient for each channel of the image. The bilateral grids are generated by 2 FC layers with the insight of rank factorization which can reduce the parameter and training difficulty [44, 45]. The detailed architecture is shown in Tab. 3 and described as" + }, + { + "type": "equation", + "bbox": [ + 0.273, + 0.82, + 0.786, + 0.843 + ], + "angle": 0, + "content": "\\[\nB = H _ {b} (\\rho) = h _ {b _ {1}} \\left(h _ {b _ {0}} (\\rho)\\right): \\mathbb {R} ^ {3 2 m} \\xrightarrow {h _ {b _ {0}}} \\mathbb {R} ^ {M _ {b}} \\xrightarrow {h _ {b _ {1}}} \\mathbb {R} ^ {K \\times N _ {s _ {b}} \\times N _ {s _ {b}} \\times N _ {s _ {b}}} \\tag {4}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.126 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.295 + ], + "angle": 0, + "content": "Slicing The slicing performs interpolation on a bilateral grid with a query point retrieved from a guidance map \\( g \\in \\mathbb{R}^{H \\times W} \\) [7]. Specifically, the query point can be defined as \\( P_{b}(x,y) = (x / (W - 1),y / (H - 1),g(x,y)) \\), where \\( (x,y) \\) is spatial coordinates. Some of practices [11,51] use a guidance map generated by CNN or matrix transform. However, we use each channel of the input image as a guidance map after considering performance and inference time. Detailed ablation studies for the guidance map are provided in Sec. 4.3. The slicing reconstructs spatial features \\( \\varPhi=\\{\\phi_c|0\\leq c< K\\} \\) from bilateral grids. When we denote a query point and a bilateral grid on channel \\( c \\) as \\( P_{b}^{c}(x,y) \\) and \\( B_{c} \\), the slicing operation can be described as" + }, + { + "type": "equation", + "bbox": [ + 0.33, + 0.307, + 0.785, + 0.326 + ], + "angle": 0, + "content": "\\[\n\\phi_ {c} (x, y) = I \\left(P _ {b} ^ {c ^ {\\prime}} (x, y), B _ {c}\\right), \\quad c \\in \\{0, 1, \\dots , K - 1 \\} \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.335, + 0.784, + 0.366 + ], + "angle": 0, + "content": "where \\( I(\\cdot) \\) is one of interpolation operations depicted in Sec. 3.1, \\( c' = mod(c,3) \\), and \\( mod(\\cdot) \\) is modulo operator." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.387, + 0.784, + 0.432 + ], + "angle": 0, + "content": "Spatial Feature Fusion This module combines the input image with spatial features \\(\\varPhi=\\{\\phi_0,\\phi_1,\\dots,\\phi_{K-1}\\}\\). The \\(1\\times 1\\) convolution layer will optimally blend the input image and spatial features with learned parameters as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.236, + 0.442, + 0.785, + 0.46 + ], + "angle": 0, + "content": "\\[\n\\hat {\\varPhi} = \\left\\{\\hat {\\phi} _ {0}, \\hat {\\phi} _ {1}, \\hat {\\phi} _ {2} \\right\\} = \\operatorname {C o n v} _ {1 \\times 1} \\left(\\operatorname {C o n c a t} (\\varPhi , X)\\right): \\mathbb {R} ^ {(K + 3) \\times H \\times W} \\rightarrow \\mathbb {R} ^ {3 \\times H \\times W} \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.469, + 0.784, + 0.588 + ], + "angle": 0, + "content": "Compared to HDRNet [11], the absence of additional local features on bilateral grids generation step may make bilateral grids smooth. However, our method involves learning multiple bilateral grids to produce spatial-aware features. Specifically, our model produces distinct spatial-aware features from multiple bilateral grids as illustrated in this section and Fig. 5, thereby providing spatial information. Furthermore, additional local features do not improve performance in our method with PSNR of \\(25.30\\mathrm{dB}\\) on FiveK [4] photo retouch task." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.612, + 0.6, + 0.627 + ], + "angle": 0, + "content": "3.4 Color Enhancement by 3D Lookup Table" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.636, + 0.784, + 0.681 + ], + "angle": 0, + "content": "3D Lookup Tables Generation The LUTGen has similar structure of GridGen, which generates 3D LUTs \\( T \\in \\mathbb{R}^{3 \\times N_{s_t} \\times N_{s_t} \\times N_{s_t}} \\) from input image context. The detailed structure of LUTGen is depicted in Tab. 4." + }, + { + "type": "equation", + "bbox": [ + 0.282, + 0.693, + 0.785, + 0.715 + ], + "angle": 0, + "content": "\\[\nT = H _ {t} (\\rho) = h _ {t _ {1}} \\left(h _ {t _ {0}} (\\rho)\\right): \\mathbb {R} ^ {3 2 m} \\xrightarrow {h _ {t _ {0}}} \\mathbb {R} ^ {M _ {t}} \\xrightarrow {h _ {t _ {1}}} \\mathbb {R} ^ {3 \\times N _ {s _ {t}} \\times N _ {s _ {t}} \\times N _ {s _ {t}}} \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.784, + 0.822 + ], + "angle": 0, + "content": "Color Enhancement After spatial information fusion, pixel-to-pixel color enhancement is carried out through the 3D LUT transforms. Each axis of 3D LUT represents each channel value. In this context, a query point can be defined as \\( P_{t}(x,y) = (\\hat{\\phi}_{0}(x,y),\\hat{\\phi}_{1}(x,y),\\hat{\\phi}_{2}(x,y)) \\), where \\( \\hat{\\phi}_c(x,y) \\) is the channel value of combined image at \\( (x,y) \\) on channel \\( c \\). The 3D LUT interpolation can be formulated as" + }, + { + "type": "equation", + "bbox": [ + 0.363, + 0.825, + 0.785, + 0.842 + ], + "angle": 0, + "content": "\\[\n\\hat {Y} _ {c} (x, y) = I \\left(P _ {t} (x, y), T _ {c}\\right), \\quad c \\in \\{0, 1, 2 \\} \\tag {8}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.377, + 0.161 + ], + "angle": 0, + "content": "3.5 Loss Function" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.788, + 0.306 + ], + "angle": 0, + "content": "We optimize the proposed method by minimizing \\(\\mathcal{L}\\) adopted from [38], which is composed of base loss \\(\\mathcal{L}_b\\) [46], color difference loss \\(\\mathcal{L}_c\\), and perceptual loss \\(\\mathcal{L}_p\\) [48]. The base loss \\(\\mathcal{L}_b\\) [46] is divided into MSE loss \\(\\mathcal{L}_r\\) that ensures content fidelity and regularization losses constraining the values in the LUT, including smoothness loss \\(\\mathcal{L}_s\\) and monotonicity loss \\(\\mathcal{L}_m\\). The color difference loss \\(\\mathcal{L}_c\\) is the color difference on the CIE94 LAB space. The perceptual loss \\(\\mathcal{L}_p\\) [48] is the LPIPS loss to improve the perceptual quality, which is the difference between ground truth and output image features on a pre-trained AlexNet [26]. The loss can be written as" + }, + { + "type": "equation", + "bbox": [ + 0.389, + 0.308, + 0.786, + 0.326 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {b} + 0. 0 0 5 * \\mathcal {L} _ {c} + 0. 0 5 * \\mathcal {L} _ {p} \\tag {9}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.346, + 0.377, + 0.363 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.377, + 0.335, + 0.391 + ], + "angle": 0, + "content": "4.1 Datasets" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.401, + 0.789, + 0.567 + ], + "angle": 0, + "content": "We use FiveK [4] and PPR10K [28] datasets to train and evaluate the proposed network. The FiveK dataset contains 5,000 RAW images and five ground truths retouched by experts (A/B/C/D/E). We select the expert C as ground truth for comparison with previous LUT methods [38, 44-46]. We also split the data into 4,500 pairs for training set and 500 for testing set, as provided in [46]. The 480p version images [46] are used in the training stage to speed up, and both 480p and 4K images are used in the testing stage. The PPR10K dataset contains 11,161 RAW portrait photos with three ground truths by three experts (a/b/c). We divide the dataset into 8,875 image pairs for the training stage and 2,286 pairs for the test stage with the official split [28]. Experiments are separately conducted for each ground truth on the 360p version of the dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.788, + 0.658 + ], + "angle": 0, + "content": "We perform experiments for two types of tasks: photo retouch and tone mapping in camera pipeline. Both tasks have the 8-bit sRGB images as ground truth but have different input formats, which are sRGB format (8-bit on FiveK and 16-bit on PPR10K) in the photo retouch task, and 16-bit CIE XYZ format in the tone mapping task. The photo retouch task is conducted on both dataset, but the tone mapping task is conducted only on FiveK dataset." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.68, + 0.432, + 0.696 + ], + "angle": 0, + "content": "4.2 Application Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.789, + 0.841 + ], + "angle": 0, + "content": "The proposed network is trained end-to-end manner. The detail of each module is denoted in Tabs. 2 to 4 and Fig. 1. In comparison on PPR10K [28], pretrained ResNet-18 [15] is used as the Extractor instead of Tab. 2 and the hidden layer of GenLUT \\((M_t)\\) is increased by a factor of 2 for fair comparison with previous work [28,44,45]. Our models are trained for 400 epochs with the standard Adam optimizer [25] and a learning rate of \\(1 \\times 10^{-4}\\). The learning rate decayed by 0.1 factor every 100 epochs. The minibatch size is 1 and 16 for FiveK and PPR10K, respectively. We implement our method on the PyTorch framework. Especially, the interpolation operation on both slicing and 3D LUT transform is" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.146, + 0.399, + 0.212 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.218, + 0.217, + 0.401, + 0.23 + ], + "angle": 0, + "content": "(a) LUTGen hidden layer \\((M_{t})\\)" + }, + { + "type": "image", + "bbox": [ + 0.414, + 0.146, + 0.593, + 0.213 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.411, + 0.217, + 0.594, + 0.23 + ], + "angle": 0, + "content": "(b) GridGen hidden layer \\((M_b)\\)" + }, + { + "type": "image", + "bbox": [ + 0.607, + 0.146, + 0.783, + 0.213 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.631, + 0.217, + 0.758, + 0.23 + ], + "angle": 0, + "content": "(c) Bilaterl grids \\((K)\\)" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.232, + 0.399, + 0.298 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.238, + 0.303, + 0.382, + 0.316 + ], + "angle": 0, + "content": "(d) Extractor width \\((m)\\)" + }, + { + "type": "image", + "bbox": [ + 0.419, + 0.232, + 0.597, + 0.298 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.417, + 0.303, + 0.598, + 0.317 + ], + "angle": 0, + "content": "(e) Bilateral grid vertices \\((N_{s_b})\\)" + }, + { + "type": "image", + "bbox": [ + 0.617, + 0.235, + 0.783, + 0.298 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.633, + 0.303, + 0.767, + 0.316 + ], + "angle": 0, + "content": "(f) LUT vertices \\((N_{s_t})\\)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.326, + 0.785, + 0.381 + ], + "angle": 0, + "content": "Fig. 3: Ablation studies on different numbers of LUTGen hidden layers (a), GridGen hidden layer (b), bilateral grids (c), Extractor width (d), Bilateral grid vertices (e), and LUT vertices (f). \\( M_{b} = 0 \\) and \\( M_{t} = 0 \\) indicate bypassing the spatial feature fusion step and the color enhancement step, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.411, + 0.784, + 0.44 + ], + "angle": 0, + "content": "implemented using CUDA extension to speed up. All experiments are conducted on an NVIDIA Tesla V100 GPU." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.463, + 0.401, + 0.477 + ], + "angle": 0, + "content": "4.3 Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.487, + 0.788, + 0.608 + ], + "angle": 0, + "content": "To verify the selection of hyper-parameters for our model and the interpolation method for slicing and 3D LUT transform, we perform ablation studies on photo retouch tasks with the FiveK dataset (480p). Before ablation studies, We conduct a random search and achieve better performance than other models with a PSNR of 25.52 dB, when the model is composed of the Extractor (\\(m = 8\\)), bilateral grid modules (\\(M_{b} = 24\\), \\(N_{s_{b}} = 17\\), \\(K = 3\\)) with trilinear interpolation, and 3D LUT modules (\\(M_{t} = 24\\), \\(N_{s_{t}} = 17\\)) with tetrahedral interpolation. Hence, we start our ablation studies with the above hyper-parameters." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.719 + ], + "angle": 0, + "content": "Selection of LUTGen and GridGen Parameters We assess the performance according to the number of LUTGen hidden layers \\((M_t)\\) with initial hyper-parameters, as can be seen in Fig. 3a. We can see our model has the best performance at \\(M_t = 24\\). However, the difference between \\(M_t = 8\\) and \\(M_t = 24\\) in performance is only \\(0.02dB\\), while the difference in parameter numbers is \\(239.9K\\). Therefore, we set \\(M_t = 8\\) in our following experiments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.809 + ], + "angle": 0, + "content": "After selecting \\( M_{t} \\), we explore the parameters of the GridGen for the number of GenLUT hidden layers (\\( M_{b} \\)) and bilateral grids (\\( K \\)). Although we find that \\( M_{b} = 32 \\) is the best as in Fig. 3b, we choose the \\( M_{b} = 8 \\) for the same reason of selecting \\( M_{t} \\) (\\( 0.01dB \\uparrow / 359.9K \\uparrow \\)). Fig. 3c shows the performance with the change in the number of bilateral grids (\\( K \\)). We select \\( K = 6 \\) because it shows a significant improvement in performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.84 + ], + "angle": 0, + "content": "The increases in the three parameters (\\(M_{t}\\), \\(M_{b}\\), and \\(K\\)) generally leads to performance improvement. However, we can observe a decrease in performance" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.127 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.182, + 0.477, + 0.224 + ], + "angle": 0, + "content": "Table 5: Ablation studies on losses, interpolation methods, and guidance map generation." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.236, + 0.477, + 0.352 + ], + "angle": 0, + "content": "
\\( {\\mathcal{L}}_{b} \\)\\( {\\mathcal{L}}_{c} \\)\\( {\\mathcal{L}}_{p} \\)Guidance map GenLUT InterpolationGrid InterpolationPSNR
oxxxTetraTri25.35
ooxxTetraTri25.21
oxoxTetraTri25.49
oooxTetraTetra25.50
oooxTriTetra25.49
oooxTriTri25.57
ooo1 × 1TetraTri23.42
ooo3 × 3TetraTri22.45
oooxTetraTri25.66
" + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.148, + 0.745, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.49, + 0.292, + 0.753, + 0.376 + ], + "angle": 0, + "content": "Fig.4: Trade-off between performance and model size on FiveK dataset [4]. Ours \\((N_{s_b},N_{s_t})\\) indicates the proposed model which has \\(N_{s_b}\\) bilateral vertices and \\(N_{s_t}\\) LUT vertices. The circle size is proportional to the model size." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.421, + 0.788, + 0.482 + ], + "angle": 0, + "content": "when parameters become too large. It seems that too complex network does not help to generate bilateral grids and 3D LUTs. The bilateral grid-only model \\((M_{t} = 0)\\) and LUT-only model \\((M_{b} = 0)\\) have relatively poor performance. These results show that each module contributes to performance improvement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.788, + 0.603 + ], + "angle": 0, + "content": "Capacity of the Extractor We observe performance changes based on the difference in Extractor width \\((m)\\) to find structure which can generate optimal LUTs and bilateral grids. For more meticulous experiments, we make the variation on the number of LUT vertices \\((N_{s_t})\\) and bilateral grid vertices \\((N_{s_b})\\). As shown in Fig. 3d, the best performance is achieved at \\(m = 8\\) in all of the experiments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.766 + ], + "angle": 0, + "content": "The Number of LUT Vertices and Bilateral Grid Vertices As can be seen in previous 3D LUT studies [28, 29, 38, 44-47], the number of vertices is an important factor in performance. Fig. 3e shows performance as different number of bilateral grid vertices. We can easily find that the optimal number of bilateral grid vertices is \\( N_{s_b} = 17 \\). Ablation study for the number of LUT vertices can be seen in Fig. 3f. Although \\( N_{s_t} = 33 \\) has best performance, we select \\( N_{s_t} = 17 \\) after considering the trade-off in Fig. 4. The selected model is ours(17,17) in Fig. 4 and has a smaller size than other 3D LUT models [38, 44, 46] except [45] with better performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Loss Function The first section of Tab. 5 shows performance differences regarding the loss. The combination of the three metrics shows the best performance, with the perceptual loss contributing the most to the performance improvement." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.498, + 0.305 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.348, + 0.306, + 0.368, + 0.318 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.507, + 0.144, + 0.787, + 0.305 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.636, + 0.306, + 0.656, + 0.318 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.329, + 0.785, + 0.398 + ], + "angle": 0, + "content": "Fig. 5: Visual result of the feature maps. The pictures in the first column are input, combined image, and output, respectively. The error map on upper left of combined image indicates differences with input image. The other six are visualizations for each channel. The pixels closer to red indicate more activated and the pixels closer to blue indicate less activated." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.429, + 0.785, + 0.535 + ], + "angle": 0, + "content": "Interpolation Method We demonstrate the ablation study of interpolation methods on the second section of Tab. 5. Since trilinear interpolation can utilize all eight adjacent sampling points, it might have the advantage of reflecting surrounding information in the slicing operation. On the other hand, tetrahedral interpolation appears to enable more accurate reconstruction in 3D LUT transform. Hence, we do not change the setting on interpolation methods. The difference in inference time between interpolation methods is negligible." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.557, + 0.788, + 0.71 + ], + "angle": 0, + "content": "Guidance Map Generator Previous studies about bilateral grids [11,51] usually have generated guidance maps instead of directly using an input image. We conduct an ablation study with two versions of guidance map generators based on HDRNet [11] GitHub4, which is composed of \\( 1 \\times 1 \\) convolution layers or \\( 3 \\times 3 \\) convolution layers. The third section of Tab. 5 shows that the model with guidance map generators has relatively poor performance. It is believed that the guidance map generators make the network too complex and increase the learning difficulty. Furthermore, the guidance map generator brings exponential increase in inference time, 21.6ms and 46.7ms for the \\( 1 \\times 1 \\) and \\( 3 \\times 3 \\) generators, respectively. Hence, we decide to directly use input image as a guidance map." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.731, + 0.485, + 0.746 + ], + "angle": 0, + "content": "4.4 Analysis of Spatial Feature" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.756, + 0.785, + 0.817 + ], + "angle": 0, + "content": "In this section, we provide the analysis of the spatial features by visualizations. Following [38], we do not apply any loss on the spatial features. The spatial features flexibly categorize an image depending on the context of the input image. The examples of spatial features can be seen in Fig. 5. The spatial feature" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.569, + 0.841 + ], + "angle": 0, + "content": "4 https://github.com/gejinchen/DDRnet-PyTorch" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 6: Quantitative comparison results of photo retouch on the FiveK dataset [4]. “-” means the result is not available due to insufficient GPU memory. “*” indicates that the results are obtained from their paper and “/” are absent results due to publicly unavailable code. The best and second-best results are in red and blue, respectively." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.213, + 0.782, + 0.384 + ], + "angle": 0, + "content": "
Method#param480pFull Resolution (4K)
PSNRSSIMΔEabRuntimePSNRSSIMΔEabRuntime
UPE [37]927.1K21.880.85310.804.2721.650.85911.0956.88
DPE [9]3.4M23.750.9089.347.21----
HDRNet [11]483.1K24.660.9158.063.4924.520.9218.2056.07
DeepLPF [31]1.7M24.730.9167.9932.12----
CSRNet [14]36.4K25.190.9257.763.0924.820.9247.9477.10
3D LUT [46]593.5K25.290.9237.551.1725.250.9327.591.49
SA-3DLUT* [38]4.5M25.50//2.27///4.39
SepLUT* [45]119.8K25.470.9217.541.1025.430.9327.561.20
AdaInt [44]619.7K25.490.9267.471.2925.480.9347.451.59
Ours463.7K25.660.9307.291.2025.660.9377.273.64
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.388, + 0.431, + 0.43 + ], + "angle": 0, + "content": "Table 7: Quantitative comparisons on the FiveK dataset [4] for tone mapping." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.442, + 0.432, + 0.578 + ], + "angle": 0, + "content": "
Method480p
PSNRSSIMΔEab
UPE [37]21.560.83712.29
DPE [9]22.930.89411.09
HDRNet [11]24.520.9158.14
CSRNet [14]25.190.9217.63
3DLUT [46]25.070.9207.55
SepLUT* [45]25.430.9227.43
AdaInt [44]25.280.9257.48
Ours25.590.9327.14
" + }, + { + "type": "table_caption", + "bbox": [ + 0.446, + 0.384, + 0.774, + 0.412 + ], + "angle": 0, + "content": "Table 8: Quantitative comparisons on the PPR10K dataset [28] for photo retouch." + }, + { + "type": "table", + "bbox": [ + 0.447, + 0.423, + 0.774, + 0.581 + ], + "angle": 0, + "content": "
DatasetMethodPSNRΔEabPSRHCΔEa
PPR10K-a3DLUT [46]25.646.9728.894.53
SepLUT* [45]26.286.59//
AdaInt [44]26.336.5629.574.26
Ours26.456.5129.704.23
PPR10K-b3DLUT [46]24.707.7127.994.99
SepLUT* [45]25.237.49//
AdaInt [44]25.407.3328.654.75
Ours25.487.1928.724.66
PPR10K-c3DLUT [46]25.187.5828.494.92
SepLUT* [45]25.597.51//
AdaInt [44]25.687.3128.934.76
Ours25.727.2829.004.72
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.609, + 0.788, + 0.685 + ], + "angle": 0, + "content": "\\(\\phi_{2}\\) and \\(\\phi_{5}\\) represent bright and dark areas of the image, respectively. The \\(\\phi_{1}\\) compensates for dark areas and \\(\\phi_{4}\\) covers overall area. The \\(\\phi_{0}\\) and \\(\\phi_{3}\\) are in charge of details of the bright area. The combined images undergoes local adjustments based on spatial features. This analysis shows that spatial feature provide pixel-wise spatial-aware weights for local enhancement." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.705, + 0.551, + 0.72 + ], + "angle": 0, + "content": "4.5 Comparison with State-of-the-Arts" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.729, + 0.787, + 0.79 + ], + "angle": 0, + "content": "We compare our methods with other SOTA real-time image enhancement methods. We especially focused on our experiments with other 3D LUT models [28, 38, 44-46]. However, we only provide quantitative results in the case of [38] and [45] since they do not provide publicly available code." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Quantitative Comparisons For quantitative comparisons, three metrics are used: PSNR, SSIM [39], \\( L_{2} \\)-distance in CIE LAB color space (\\( \\Delta E_{ab} \\)) on FiveK" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.143, + 0.789, + 0.363 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.373, + 0.788, + 0.43 + ], + "angle": 0, + "content": "Fig. 6: Qualitative comparisons on the FiveK dataset [4] for photo retouch. The corresponding error maps on the upper right of each picture indicate differences with ground truth, where each color indicates the degree of error based on the corresponding color bars on the right." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.456, + 0.788, + 0.578 + ], + "angle": 0, + "content": "dataset. We include the human-centered PSNR \\((PSNR^{HC})\\) and color difference \\((\\Delta E_{ab}^{HC})\\) [28] on PPR10K dataset. Tab. 6 shows comparisons on the FiveK dataset for photo retouch. The inference time is measured on the same image set, by running 100 times and averaging them. Our method outperforms other methods on both resolutions. Similar results can be seen in Tab. 7 for the tone mapping task on FiveK dataset, and in Tab. 8 for the photo retouch task on the PPR10K dataset. We also provide analysis for runtime increment on 4K resolution and standard deviations of runtime in supplementary materials." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.579, + 0.788, + 0.716 + ], + "angle": 0, + "content": "Especially, the results show that we alleviate the intrinsic problems of the spatial-aware LUT method mentioned in previous work, the tremendous model size, and the long inference time. Our method has a much smaller size than SA-3DLUT [38] (about 1/10 times). This number of parameters is even smaller than AdaInt [44] and 3DLUT [46]. Furthermore, we have already shown that ours(9, 9) outperforms the SepLUT [45] with a similar model size in Fig. 4. The inference time on \\(480\\mathrm{p}\\) is smaller than SA-3DLUT [38] (about 1/2 times) and similar to other LUT methods [44-46]. Although the inference time is increased in the case of 4K resolution, it is still shorter than SA-3DLUT [38]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.795 + ], + "angle": 0, + "content": "Qualitative Comparisons The qualitative comparisons can be seen in Fig. 6 with corresponding error maps on the upper right of each picture. Each color of the error map indicates the difference with ground truth based on the corresponding color bars on the right." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.788, + 0.842 + ], + "angle": 0, + "content": "In the first row of Fig. 6, it can be observed that our method performs better than others in local enhancement. The 3DLUT and AdaInt of the dark area captured in the red rectangle appear somber compared to the ground truth." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "On the other hand, the CSRNet is entirely reddish. Our method enhances the image in both dark and bright areas, making it closer to the ground truth. In the second row of Fig. 6, it can be observed that our method is capable of producing vivid colors. Comparing the leaf on the blue rectangle in our method to the other methods, it can be seen that our method produces a clearer green color. Similarly, the red color at the end of the yellow leaves in the red rectangle is also improved. The last row of the figure shows that our model has improved the overall color of the image. Specifically, the color of the ground and seat in the red and blue rectangles is closer to the ground truth than the other methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.315, + 0.513, + 0.332 + ], + "angle": 0, + "content": "5 Limitations and Discussion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.357, + 0.788, + 0.508 + ], + "angle": 0, + "content": "Although our inference time is effectively reduced compared to SA-3DLUT [38], we have observed that the inference time increases as the resolution increases. This is a common issue with spatial-aware methods. However, we believe that a processing time of 3.6ms is sufficient for real-time high-resolution video processing. However, there may be some special applications in the future that require constraints such as a resolution greater than 8K or a frame rate exceeding 200 fps. To address these challenges, we plan to investigate the correlation between image resolution and processing time and explore methods that process spatial features with a unit of patch or super-pixel [2], which could be one of the potential solutions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.788, + 0.6 + ], + "angle": 0, + "content": "Another future work is to apply the adaptive sampling [44] to a bilateral grid. When we apply the adaptive sampling on the 3D LUT, the performance is downgraded by \\(0.15\\mathrm{dB}\\) on PSNR. It seems that the adaptive sampling effect has already been reflected in the spatial feature fusion step. However, we believe that adaptive sampling on the bilateral grids could effectively handle adaptive local enhancement." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.633, + 0.36, + 0.649 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.84 + ], + "angle": 0, + "content": "We have developed a method that utilizes bilateral grids to create a learnable spatial-aware 3D LUT for fast image enhancement. The bilateral grid is an effective way of conveying spatial information because its data structure can provide spatial features through a non-parametric slicing process. Our framework is designed to enhance local areas efficiently, resulting in improved results. We have extensively tested our method on two datasets and have demonstrated that it outperforms other state-of-the-art methods in terms of both performance and efficiency. Our model achieves state-of-the-art performance with a relatively small model size and short inference time. Additionally, we have achieved better performance by using an appropriate interpolation method for slicing and 3D LUT transform." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.266 + ], + "angle": 0, + "content": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] and in part by the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University in 2024." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.288, + 0.323, + 0.304 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.36 + ], + "angle": 0, + "content": "1. A Sharif, S., Naqvi, R.A., Biswas, M., Kim, S.: A two-stage deep network for high dynamic range image reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 550-559 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.361, + 0.785, + 0.401 + ], + "angle": 0, + "content": "2. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Süsstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE transactions on pattern analysis and machine intelligence 34(11), 2274-2282 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.402, + 0.785, + 0.429 + ], + "angle": 0, + "content": "3. Akyüz, A.O., et al.: Deep joint deinterlacing and denoising for single shot dual-iso hdr reconstruction. IEEE Transactions on Image Processing 29, 7511-7524 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.429, + 0.785, + 0.47 + ], + "angle": 0, + "content": "4. Bychkovsky, V., Paris, S., Chan, E., Durand, F.: Learning photographic global tonal adjustment with a database of input/output image pairs. In: CVPR 2011. pp. 97-104. IEEE (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.471, + 0.785, + 0.511 + ], + "angle": 0, + "content": "5. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.511, + 0.785, + 0.539 + ], + "angle": 0, + "content": "6. Chen, J., Adams, A., Wadhwa, N., Hasinoff, S.W.: Bilateral guided upsampling. ACM Transactions on Graphics (TOG) 35(6), 1-8 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.539, + 0.785, + 0.566 + ], + "angle": 0, + "content": "7. Chen, J., Paris, S., Durand, F.: Real-time edge-aware image processing with the bilateral grid. ACM Transactions on Graphics (TOG) 26(3), 103-es (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.567, + 0.785, + 0.607 + ], + "angle": 0, + "content": "8. Chen, X., Liu, Y., Zhang, Z., Qiao, Y., Dong, C.: Hdrunet: Single image hdr reconstruction with denoising and dequantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 354-363 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.608, + 0.785, + 0.661 + ], + "angle": 0, + "content": "9. Chen, Y.S., Wang, Y.C., Kao, M.H., Chuang, Y.Y.: Deep photo enhancer: Unpaired learning for image enhancement from photographs with gans. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6306-6314 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.662, + 0.785, + 0.703 + ], + "angle": 0, + "content": "0. Deng, Y., Loy, C.C., Tang, X.: Aesthetic-driven image enhancement by adversarial learning. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 870-878 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.703, + 0.785, + 0.744 + ], + "angle": 0, + "content": "1. Gharbi, M., Chen, J., Barron, J.T., Hasinoff, S.W., Durand, F.: Deep bilateral learning for real-time image enhancement. ACM Transactions on Graphics (TOG) 36(4), 1-12 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.745, + 0.785, + 0.799 + ], + "angle": 0, + "content": "12. Guo, C., Fan, L., Zhang, Q., Liu, H., Liu, K., Jiang, X.: Redistributing the precision and content in 3d-lut-based inverse tone-mapping for hdr/wcg display. In: Proceedings of the 20th ACM SIGGRAPH European Conference on Visual Media Production. pp. 1-10 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "13. Hashimoto, N., Takamaeda-Yamazaki, S.: An fpga-based fully pipelined bilateral grid for real-time image denoising. In: 2021 31st International Conference on Field-Programmable Logic and Applications (FPL). pp. 167-173. IEEE (2021)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.318, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "14. He, J., Liu, Y., Qiao, Y., Dong, C.: Conditional sequential modulation for efficient global image retouching. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 679-695. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.205, + 0.787, + 0.245 + ], + "angle": 0, + "content": "15. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.246, + 0.787, + 0.273 + ], + "angle": 0, + "content": "16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.273, + 0.787, + 0.314 + ], + "angle": 0, + "content": "17. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: HDR-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.315, + 0.787, + 0.357 + ], + "angle": 0, + "content": "18. Huang, X., Belongie, S.: Arbitrary style transfer in real-time with adaptive instance normalization. In: Proceedings of the IEEE international conference on computer vision. pp. 1501-1510 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.357, + 0.787, + 0.398 + ], + "angle": 0, + "content": "19. Ignatov, A., Kobyshev, N., Timofte, R., Vanhoey, K., Van Gool, L.: Dslr-quality photos on mobile devices with deep convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 3277-3285 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.399, + 0.787, + 0.439 + ], + "angle": 0, + "content": "20. Jiang, Y., Gong, X., Liu, D., Cheng, Y., Fang, C., Shen, X., Yang, J., Zhou, P., Wang, Z.: Enlightengan: Deep light enhancement without paired supervision. IEEE transactions on image processing 30, 2340-2349 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.787, + 0.495 + ], + "angle": 0, + "content": "21. Jiang, Y., Zhang, H., Zhang, J., Wang, Y., Lin, Z., Sunkavalli, K., Chen, S., Amirghodsi, S., Kong, S., Wang, Z.: Ssh: A self-supervised framework for image harmonization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4832-4841 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.787, + 0.55 + ], + "angle": 0, + "content": "22. Karaimer, H.C., Brown, M.S.: A software platform for manipulating the camera imaging pipeline. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part I 14. pp. 429-444. Springer (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.787, + 0.592 + ], + "angle": 0, + "content": "23. Kim, H.U., Koh, Y.J., Kim, C.S.: Pienet: Personalized image enhancement network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXX 16. pp. 374-390. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.592, + 0.787, + 0.633 + ], + "angle": 0, + "content": "24. Kim, S.Y., Oh, J., Kim, M.: Jsi-gan: Gan-based joint super-resolution and inverse tone-mapping with pixel-wise task-specific filters for uhd hdr video. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 11287-11295 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.787, + 0.661 + ], + "angle": 0, + "content": "25. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.661, + 0.787, + 0.702 + ], + "angle": 0, + "content": "26. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.787, + 0.743 + ], + "angle": 0, + "content": "27. Le, P.H., Le, Q., Nguyen, R., Hua, B.S.: Single-image hdr reconstruction by multiexposure generation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4063-4072 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.787, + 0.799 + ], + "angle": 0, + "content": "28. Liang, J., Zeng, H., Cui, M., Xie, X., Zhang, L.: Ppr10k: A large-scale portrait photo retouching dataset with human-region mask and group-level consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 653-661 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "29. Liu, C., Yang, H., Fu, J., Qian, X.: 4d lut: learnable context-aware 4d lookup table for image enhancement. IEEE Transactions on Image Processing 32, 4742-4756 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.565, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "LUT with Bilateral Grid" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.204 + ], + "angle": 0, + "content": "30. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.205, + 0.787, + 0.247 + ], + "angle": 0, + "content": "31. Moran, S., Marza, P., McDonagh, S., Parisot, S., Slabaugh, G.: Deeplpf: Deep local parametric filters for image enhancement. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12826-12835 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.248, + 0.786, + 0.288 + ], + "angle": 0, + "content": "32. Park, J., Lee, J.Y., Yoo, D., Kweon, I.S.: Distort-and-recover: Color enhancement using deep reinforcement learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5928-5936 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.29, + 0.787, + 0.345 + ], + "angle": 0, + "content": "33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.347, + 0.786, + 0.387 + ], + "angle": 0, + "content": "34. Song, Y., Qian, H., Du, X.: Starenhancer: Learning real-time and style-aware image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4126-4135 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.389, + 0.786, + 0.416 + ], + "angle": 0, + "content": "35. Vandenberg, J.D., Andriani, S.: A survey on 3d-lut performance in 10-bit and 12-bit hdr bt. 2100 pq. In: SMPTE 2018. pp. 1-19. SMPTE (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.418, + 0.787, + 0.459 + ], + "angle": 0, + "content": "36. Wang, D., Zheng, Z., Ding, W., Jia, X.: Lgabl: Uhd multi-exposure image fusion via local and global aware bilateral learning. IEEE Transactions on Emerging Topics in Computational Intelligence (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.46, + 0.787, + 0.514 + ], + "angle": 0, + "content": "37. Wang, R., Zhang, Q., Fu, C.W., Shen, X., Zheng, W.S., Jia, J.: Underexposed photo enhancement using deep illumination estimation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6849-6857 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.516, + 0.787, + 0.57 + ], + "angle": 0, + "content": "38. Wang, T., Li, Y., Peng, J., Ma, Y., Wang, X., Song, F., Yan, Y.: Real-time image enhancer via learnable spatial-aware 3d lookup tables. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2471-2480 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.572, + 0.787, + 0.613 + ], + "angle": 0, + "content": "39. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.615, + 0.787, + 0.642 + ], + "angle": 0, + "content": "40. Wei, C., Wang, W., Yang, W., Liu, J.: Deep retina decomposition for low-light enhancement. arXiv preprint arXiv:1808.04560 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.643, + 0.787, + 0.685 + ], + "angle": 0, + "content": "41. Xu, B., Xu, Y., Yang, X., Jia, W., Guo, Y.: Bilateral grid learning for stereo matching networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12497-12506 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.686, + 0.787, + 0.713 + ], + "angle": 0, + "content": "42. Xu, Q., Wang, L., Wang, Y., Sheng, W., Deng, X.: Deep bilateral learning for stereo image super-resolution. IEEE Signal Processing Letters 28, 613-617 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.715, + 0.787, + 0.742 + ], + "angle": 0, + "content": "43. Yan, Z., Zhang, H., Wang, B., Paris, S., Yu, Y.: Automatic photo adjustment using deep neural networks. ACM Transactions on Graphics (TOG) 35(2), 1-15 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.743, + 0.787, + 0.798 + ], + "angle": 0, + "content": "44. Yang, C., Jin, M., Jia, X., Xu, Y., Chen, Y.: Adaint: Learning adaptive intervals for 3d lookup tables on real-time image enhancement. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17522-17531 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "45. Yang, C., Jin, M., Xu, Y., Zhang, R., Chen, Y., Liu, H.: Seplut: Separable image-adaptive lookup tables for real-time image enhancement. In: European Conference on Computer Vision (ECCV). pp. 201-217. Springer (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.128 + ], + "angle": 0, + "content": "Kim and Cho" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "46. Zeng, H., Cai, J., Li, L., Cao, Z., Zhang, L.: Learning image-adaptive 3d lookup tables for high performance photo enhancement in real-time. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) 44(4), 2058-2073 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.245 + ], + "angle": 0, + "content": "47. Zhang, F., Zeng, H., Zhang, T., Zhang, L.: Clut-net: Learning adaptively compressed representations of 3dluts for lightweight image enhancement. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 6493-6501 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "48. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.328 + ], + "angle": 0, + "content": "49. Zhang, Y., Zhang, J., Guo, X.: Kindling the darkness: A practical low-light image enhancer. In: Proceedings of the 27th ACM international conference on multimedia. pp. 1632-1640 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.787, + 0.37 + ], + "angle": 0, + "content": "50. Zhang, Z., Jiang, Y., Jiang, J., Wang, X., Luo, P., Gu, J.: Star: A structure-aware lightweight transformer for real-time image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4106-4115 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.787, + 0.411 + ], + "angle": 0, + "content": "51. Zheng, Z., Ren, W., Cao, X., Wang, T., Jia, X.: Ultra-high-definition image hdr reconstruction via collaborative bilateral learning. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 4449-4458 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.787, + 0.453 + ], + "angle": 0, + "content": "52. Zhou, Y., Li, C., Liang, J., Xu, T., Liu, X., Xu, J.: 4k-resolution photo exposure correction at 125 fps with \\(\\sim\\)8k parameters. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1587-1597 (2024)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.453 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_origin.pdf b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3e711fd34f5519e05fb4a4e159c8cb6a94e9ce58 --- /dev/null +++ b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/f88d27a4-7c3a-49fb-8565-a6e273becf27_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:64958ee61d42aa19b3c39e5136e9bf1bad44359972abe2c6966fc4976e47a5ee +size 9726897 diff --git a/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/full.md b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/full.md new file mode 100644 index 0000000000000000000000000000000000000000..ec96a539ed76452d4ec77f703c05184634aa409a --- /dev/null +++ b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/full.md @@ -0,0 +1,328 @@ +# Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids + +Wontae $\mathrm{Kim}^{1,3}$ and Nam Ik Cho $^{1,2}$ + +$^{1}$ IPAI, Seoul National University, Seoul, Korea + +$^{2}$ Department of ECE, INMC, Seoul National University, Seoul, Korea + +3 LG Electronics + +{munte2, nicho}@snu.ac.kr + +Abstract. Image enhancement and restoration methods using adaptive 3D lookup tables (3D LUTs) have shown promising results with real-time inferencing. These methods directly transform input pixel values into enhanced ones by using interpolation operations with predicted 3D LUT values. However, it is still challenging to deal with locally different properties of images since most 3D LUT methods are simple color-to-color transforms. Although including spatial information in this transform can be a good solution, it can significantly increase the number of parameters and inference time. To address this issue, we propose an efficient spatial-aware image enhancement model that combines bilateral grids and 3D LUTs. Specifically, we transform bilateral grids into a spatial feature domain to incorporate spatial information in our 3D LUT model. To reduce inference time and save parameters, we use slicing operations in our network architecture instead of the long decoding path of the U-Net architecture used in most existing studies. Our model achieves state-of-the-art performance without increasing parameters and further reduces inference time, as demonstrated by extensive results. Codes are available at https://github.com/WontaeaeKim/LUTwithBGrid + +Keywords: Image enhancement $\cdot$ 3D LUT $\cdot$ Bilateral grid + +# 1 Introduction + +Image enhancement has become increasingly popular with the widespread use of high-resolution and wide-color-gamut display devices and cameras. Recently, deep learning-based approaches have shown impressive results by extracting and utilizing effective features of images [1,3,5,8-10,17,19,20,23,24,27,30,31,40,43, 49]. However, these approaches require high computational costs and long inference times. To address this problem, researchers have investigated a learningbased 3D lookup table (3D LUT) as an alternative [12,21,28,29,34,38,44-47,50]. The 3D LUT instantly converts input color values to improved ones by interpolating pre-computed values in the 3D LUT instead of performing repeated computations, effectively reducing computational costs. + +Specifically, Zeng et al. proposed a convolutional neural network (CNN) model that predicts the values needed to create an efficient 3D LUT [46]. However, the authors have also addressed the limitation in that it only provides a color-to-color transformation and lacks spatial information. This means that it may not be effective in enhancing certain areas of an image that require local adjustments. To address this limitation, a spatially adaptive method (SA-3DLUT) was proposed, which uses a U-net style backbone to incorporate spatial information [38]. This approach achieves state-of-the-art performance, but requires a significantly larger number of parameters than previous plain LUT approaches. Other advanced 3D LUT methods [28, 29, 44, 45, 47] have also improved image quality, but the issue of missing spatial information remains a challenge. As can be seen in prior studies, including spatial information without an expanded model is very challenging. + +To solve this issue, we introduce the method using bilateral grids to incorporate spatial information while reducing computational costs and model size. The bilateral grid is a data structure consisting of 2D spatial dimensions and 1D intensity dimension [7]. Recent deep learning-based approaches generate the bilateral grids from an image and transform them into features or coefficients by slicing operation for their purpose [6,11,13,36,41,42,51,52]. Slicing can help to reduce computational costs due to its non-parametric property [7]. The experiments of Gharbi et al. [11] showed that slicing with the bilateral grids achieve better performance and shorter running time compared to U-net in the Local Laplacian task. To take those advantages, our method generates spatial features from slicing with bilateral grids instead of the U-Net. + +The overall architecture of our method is shown in Fig. 1. We use the Extractor to extract image context from the input image, which is used to generate image-adaptive bilateral grids and 3D LUTs. The bilateral grids provide spatial-aware property to our model after transformed to spatial features by slicing. Finally, the input image combined with spatial features is used to generate the enhanced image by the 3D LUT transform. The experiments show that this architecture can achieve better performance with relatively small number of parameters. + +In addition, we also explore tetrahedral interpolation as well as trilinear interpolation to apply effective interpolation methods when slicing and 3D LUT transformation. We find that tetrahedral and trilinear interpolation provide the optimal performance to 3D LUTs and bilateral grids, respectively. + +The contributions of this paper are three-fold: + +- We introduce a new application of bilateral grids for 3D LUT construction, incorporating spatial features using only a small number of parameters. +- We propose an efficient architecture for spatial-aware 3D LUTs that leverages a cascade of bilateral grids and 3D LUTs. This architecture produces an improved output with fewer parameters. +- We conduct extensive experiments to compare our approach with existing methods on two publicly available benchmark datasets. Results demonstrate the efficiency and effectiveness of our method in image enhancement. + +![](images/cb2716a8b2a1f114b74e60affddef0b2357f9767af283b9691dd9a46e2e44c70.jpg) +Fig. 1: Framework of the proposed method. An image context is extracted from a downsampled image, which is then used to predict bilateral grids and 3D LUTs. The bilateral grids are transformed into spatial features by slicing operation. After being combined with spatial features by a $1 \times 1$ convolution layer, the combined image is converted to a spatial-aware enhanced image by 3D LUT interpolation. + +# 2 Related Work + +In this section, we will briefly review hybrid methods that combine deep-learning and traditional methods to achieve better image enhancement. Typically, methods that use only deep learning [5, 9, 10, 19, 20, 23, 37, 40, 43, 49] predict all pixels on images with numerous deep neural layers. While these methods can deliver high performance, they require heavy computational costs and resources. On the other hand, hybrid methods predict the parameters of traditional models, such as the coefficients of color transform [14, 16, 32], bilateral grids [11, 51], or 3D LUT [28, 29, 38, 44-47], instead of directly predicting enhanced images. It has been shown that hybrid methods achieve better performance than deep-learning-only methods while requiring relatively shallow networks and light resources. + +The methods predicting coefficients of color transform mimic human experts' photo retouch process, which adjusts brightness, contrast, tone mapping curves, or white balance. To be precise, [16,32] apply color transforms based on the current image state through the reinforcement learning approach, while [14] replaces traditional color transform into multi-layer perceptrons (MLPs). + +Gharbi et al. introduced HDRNet framework [11] that produces enhanced images with pixel-wise affine transform and coefficients reconstructed from predicted bilateral grids. Zheng et al. introduced collaborative learning [51] with bilateral grids and LeakyAdaIN, an extension of adaptive instance normalization (AdaIN) [18], to reconstruct UHD HDR image from input image in real-time. + +Zeng et al. showed that the weighted sum of basis LUTs can achieve image-adaptive enhancement with a simple CNN weight predictor [46]. Yang et al. combined 1D LUTs [45] and adaptive intervals [44] with [46] to improve the capacity of LUTs. The 4D LUT was introduced in [29], which is a combination of context channel (1D) and RGB channels (3D). The above LUT methods achieved promising performance with a light network and fast inference speed. However, these methods still suffer from a lack of spatial information to handle local enhancement in an image. Although SA-3DLUT [38] provides spatial information with U-NET [33] style backbone network, it requires a tremendous number of parameters and inference time. In the following section, we will introduce a new method that is a combination of LUTs and bilateral grids to provide color enhancement and spatial information, respectively, without parameter increase. + +# 3 Proposed Method + +We present our network and loss functions in this section. The overall network architecture comprises three steps, as illustrated in Fig. 1: image context extraction, spatial feature fusion, and color enhancement. A simple CNN network extracts image context vectors, which are then fed to the GridGen and LUTGen modules to generate image-adaptive bilateral grids and 3D LUTs. Spatial feature fusion and color enhancement are sequentially carried out using bilateral grids and 3D LUTs, respectively. This cascade structure is effective in image signal processing [22,45], where each module focuses on its specific functionality. The slicing operation cost-effectively generates spatial features from bilateral grids, which have the same resolution as the input image. The spatial features are combined with an input image by the $1 \times 1$ convolution. The combined image is transformed into an enhanced image by interpolation operation on 3D LUTs. + +# 3.1 Preliminary: Interpolation + +In this section, we will delve into trilinear and tetrahedral interpolation methods, which are used in the slicing operation and 3D LUT transform. The interpolation process involves two steps, looking up to find adjacent points for a query point $P = (p_x,p_y,p_z)$ and then computing the weighted sum of those adjacent points. To simplify the computation process, we assume a normalized three-dimensional grid $G\in \mathbb{R}^{N_s\times N_s\times N_s}$ , such as a 3D LUT or a bilateral grid, where $N_{s}$ is the number of vertices. + +Trilinear interpolation finds the eight adjacent points in the lookup step, where the left and right adjacent points on each axis $\alpha \in \{x,y,z\}$ are denoted as $p_{\alpha}^{0}, p_{\alpha}^{1}$ . If the grid has uniform lattices, the adjacent point can be found as $p_{\alpha}^{0} = \lfloor p_{\alpha} \cdot (N_{s} - 1) \rfloor / (N_{s} - 1)$ and $p_{\alpha}^{1} = p_{\alpha}^{0} + 1 / (N_{s} - 1)$ , where $\lfloor \cdot \rfloor$ is the floor operator and $p_{\alpha}$ is a query point on $\alpha$ axis. In the case of non-uniform lattices, adjacent points can be found by the binary search [44]. The weight indicates how much an adjacent point influences the query point, which is denoted as $w_{i,j,k} = (\varDelta_x)^i(1-\varDelta_x)^{1-i}(\varDelta_y)^j(1-\varDelta_y)^{1-j}(\varDelta_z)^k(1-\varDelta_z)^{1-k}$ , where $\varDelta_{\alpha}=$ + +![](images/1e1d1a1e8dc5c082adbd4026f915412de9b22a555d1058b868dfd273ac84261f.jpg) +Fig.2: Description of tetrahedral interpolation + +Table 1: Weights and adjacent points of tetrahedral interpolation depending on the condition + +
TetrahedronCondition\( {w}_{0} \)\( {w}_{1} \)\( {w}_{2} \)\( {w}_{3} \)\( {V}_{1} \)\( {V}_{2} \)
\( {t}_{0} \)\( {\Delta }_{x} > {\Delta }_{y} > {\Delta }_{z} \)1 \( - {\Delta }_{x} \)\( {\Delta }_{x} - {\Delta }_{y} \)\( {\Delta }_{y} - {\Delta }_{z} \)\( {\Delta }_{z} \)\( {V}_{100} \)\( {V}_{110} \)
\( {t}_{1} \)\( {\Delta }_{x} > {\Delta }_{z} > {\Delta }_{y} \)1 \( - {\Delta }_{x} \)\( {\Delta }_{x} - {\Delta }_{z} \)\( {\Delta }_{z} - {\Delta }_{y} \)\( {\Delta }_{y} \)\( {V}_{101} \)\( {V}_{101} \)
\( {t}_{2} \)\( {\Delta }_{y} > {\Delta }_{z} > {\Delta }_{z} \)1 \( - {\Delta }_{y} \)\( {\Delta }_{y} - {\Delta }_{z} \)\( {\Delta }_{z} - {\Delta }_{x} \)\( {\Delta }_{z} \)\( {V}_{010} \)\( {V}_{110} \)
\( {t}_{3} \)\( {\Delta }_{y} > {\Delta }_{z} > {\Delta }_{x} \)1 \( - {\Delta }_{y} \)\( {\Delta }_{y} - {\Delta }_{z} \)\( {\Delta }_{z} - {\Delta }_{x} \)\( {\Delta }_{x} \)\( {V}_{010} \)\( {V}_{011} \)
\( {t}_{4} \)\( {\Delta }_{z} > {\Delta }_{y} > {\Delta }_{y} \)1 \( - {\Delta }_{z} \)\( {\Delta }_{z} - {\Delta }_{z} \)\( {\Delta }_{z} - {\Delta }_{y} \)\( {\Delta }_{y} \)\( {V}_{001} \)\( {V}_{011} \)
\( {t}_{5} \)\( {\Delta }_{z} > {\Delta }_{y} > {\Delta }_{x} \)1 \( - {\Delta }_{z} \)\( {\Delta }_{z} - {\Delta }_{y} \)\( {\Delta }_{y} - {\Delta }_{x} \)\( {\Delta }_{x} \)\( {V}_{001} \)\( {V}_{011} \)
+ +$(p_{\alpha} - p_{\alpha}^{0}) / (p_{\alpha}^{1} - p_{\alpha}^{0})$ . Denoting the value corresponding to adjacent points on the grid $G$ as $V_{i,j,k}$ , the trilinear interpolation $I_{tri}(\cdot)$ is formulated as + +$$ +I _ {t r i} (P, G) = \sum_ {i, j, k \in \{0, 1 \}} w _ {i, j, k} \cdot V _ {i, j, k}. \tag {1} +$$ + +As can be seen in Tab. 1 and Fig. 2, the tetrahedral interpolation can be carried out with four adjacent sampling point values $V_{n}$ and weights $w_{n}$ ( $n \in \{0,1,2,3\}$ ) depending on $\varDelta_x$ , $\varDelta_y$ and $\varDelta_z$ . Detailed conditions are described in Tab. 1, where $V_{0}$ and $V_{3}$ are fixed at $V_{000}$ and $V_{111}$ , respectively. Tetrahedral interpolation $I_{tetra}(\cdot)$ can be represented as + +$$ +I _ {t e t r a} (P, G) = \sum_ {n \in \{0, 1, 2, 3 \}} w _ {n} \cdot V _ {n}. \tag {2} +$$ + +The previous 3D LUT methods [28, 29, 38, 44-47] considered only trilinear interpolation when retrieving enhanced color values. However, experiments of Vandenberg et al. [35] showed that tetrahedral interpolation has better performance on image processing with fixed 3D LUTs. After we explore how the two interpolation methods affect our model in the Sec. 4.3, we determine the interpolation methods for 3D LUT transform and slicing. + +# 3.2 Image Context Extraction + +Our framework is designed to be adaptive to images using image context extraction. The first step in this process is to bilinear downsample the input image $X \in \mathbb{R}^{3 \times H \times W}$ . This allows our model to process images at arbitrary resolutions. The downsampled image $\hat{X}$ is then processed by the Extractor to create image contexts. The Extractor is made up of five layers of CNN, which is sufficient to provide image context for bilateral grids and 3D LUTs [38,44-46]. The details are depicted in Tab. 2 where $m$ is a hyper-parameter related to the Extractor width. Each convolution layer consists of 2 strided $3 \times 3$ convolution, LeakyReLU, and instance normalization (except layer 5). The image context is produced by the + +Table 2: Details of the Extractor. Conv, $LR$ , and $IN$ represent $3 \times 3$ convolution block (stride=2, padding=1), LeakyReLU, and instance normalization, respectively. + +
LayerOutput Shape
Bilinear Downsample3 × 256 × 256
Conv + LR + INm × 128 × 128
Conv + LR + IN2m × 64 × 64
Conv + LR + IN4m × 32 × 32
Conv + LR + IN8m × 16 × 16
Conv + LR8m × 8 × 8
Droupout (0.5)8m × 8 × 8
Average Pooling8m × 2 × 2
Reshape32m
+ +Table 3: Details of the GridGen, where $FC$ is the fully connected layer. $M_b$ , $K$ , and $N_{s_b}$ are hyperparameters for the number of hidden layers, bilateral grids, and bilateral grid vertices, respectively. + +
LayerOutput Shape
FC (hb0)Mb
FC (hb1)K·Nsb
+ +Reshape $K\times N_{s_b}\times N_{s_b}\times N_{s_b}$ +Table 4: Details of the LUTGen. $M_{t}$ and $N_{s_t}$ are hyper-parameters for the number of hidden layers and 3D LUT vertices, respectively. + +
LayerOutput Shape
FC (ht0)Mt
FC (ht1)3Nst3
Reshape3 × Nst × Nst × Nst
+ +average pooling layer and reshaped as a vector. This context will be fed to the GridGen and LUTGen module. The complete image context extraction can be expressed as + +$$ +\rho = f (\hat {X}) \tag {3} +$$ + +where $\rho \in \mathbb{R}^{32m}$ is image context vector predicted by image context extraction process $f(\cdot)$ . + +# 3.3 Spatial Feature Fusion by Bilateral Grid + +In this section, we describe the processes to provide spatial features, which are bilateral grid generation, slicing, and fusion. + +Bilateral Grids Generation The GridGen module transforms image context vector into bilateral grids $B \in \mathbb{R}^{K \times N_{s_b} \times N_{s_b} \times N_{s_b}}$ where $K$ is the number of bilateral grids and $N_{s_b}$ is the number of vertices along each dimension. In our model, the two axes of bilateral grids represent sampling points of spatial coordinates, and the other one represents the color coefficient for each channel of the image. The bilateral grids are generated by 2 FC layers with the insight of rank factorization which can reduce the parameter and training difficulty [44, 45]. The detailed architecture is shown in Tab. 3 and described as + +$$ +B = H _ {b} (\rho) = h _ {b _ {1}} \left(h _ {b _ {0}} (\rho)\right): \mathbb {R} ^ {3 2 m} \xrightarrow {h _ {b _ {0}}} \mathbb {R} ^ {M _ {b}} \xrightarrow {h _ {b _ {1}}} \mathbb {R} ^ {K \times N _ {s _ {b}} \times N _ {s _ {b}} \times N _ {s _ {b}}} \tag {4} +$$ + +Slicing The slicing performs interpolation on a bilateral grid with a query point retrieved from a guidance map $g \in \mathbb{R}^{H \times W}$ [7]. Specifically, the query point can be defined as $P_{b}(x,y) = (x / (W - 1),y / (H - 1),g(x,y))$ , where $(x,y)$ is spatial coordinates. Some of practices [11,51] use a guidance map generated by CNN or matrix transform. However, we use each channel of the input image as a guidance map after considering performance and inference time. Detailed ablation studies for the guidance map are provided in Sec. 4.3. The slicing reconstructs spatial features $\varPhi=\{\phi_c|0\leq c< K\}$ from bilateral grids. When we denote a query point and a bilateral grid on channel $c$ as $P_{b}^{c}(x,y)$ and $B_{c}$ , the slicing operation can be described as + +$$ +\phi_ {c} (x, y) = I \left(P _ {b} ^ {c ^ {\prime}} (x, y), B _ {c}\right), \quad c \in \{0, 1, \dots , K - 1 \} \tag {5} +$$ + +where $I(\cdot)$ is one of interpolation operations depicted in Sec. 3.1, $c' = mod(c,3)$ , and $mod(\cdot)$ is modulo operator. + +Spatial Feature Fusion This module combines the input image with spatial features $\varPhi=\{\phi_0,\phi_1,\dots,\phi_{K-1}\}$ . The $1\times 1$ convolution layer will optimally blend the input image and spatial features with learned parameters as follows: + +$$ +\hat {\varPhi} = \left\{\hat {\phi} _ {0}, \hat {\phi} _ {1}, \hat {\phi} _ {2} \right\} = \operatorname {C o n v} _ {1 \times 1} \left(\operatorname {C o n c a t} (\varPhi , X)\right): \mathbb {R} ^ {(K + 3) \times H \times W} \rightarrow \mathbb {R} ^ {3 \times H \times W} \tag {6} +$$ + +Compared to HDRNet [11], the absence of additional local features on bilateral grids generation step may make bilateral grids smooth. However, our method involves learning multiple bilateral grids to produce spatial-aware features. Specifically, our model produces distinct spatial-aware features from multiple bilateral grids as illustrated in this section and Fig. 5, thereby providing spatial information. Furthermore, additional local features do not improve performance in our method with PSNR of $25.30\mathrm{dB}$ on FiveK [4] photo retouch task. + +# 3.4 Color Enhancement by 3D Lookup Table + +3D Lookup Tables Generation The LUTGen has similar structure of GridGen, which generates 3D LUTs $T \in \mathbb{R}^{3 \times N_{s_t} \times N_{s_t} \times N_{s_t}}$ from input image context. The detailed structure of LUTGen is depicted in Tab. 4. + +$$ +T = H _ {t} (\rho) = h _ {t _ {1}} \left(h _ {t _ {0}} (\rho)\right): \mathbb {R} ^ {3 2 m} \xrightarrow {h _ {t _ {0}}} \mathbb {R} ^ {M _ {t}} \xrightarrow {h _ {t _ {1}}} \mathbb {R} ^ {3 \times N _ {s _ {t}} \times N _ {s _ {t}} \times N _ {s _ {t}}} \tag {7} +$$ + +Color Enhancement After spatial information fusion, pixel-to-pixel color enhancement is carried out through the 3D LUT transforms. Each axis of 3D LUT represents each channel value. In this context, a query point can be defined as $P_{t}(x,y) = (\hat{\phi}_{0}(x,y),\hat{\phi}_{1}(x,y),\hat{\phi}_{2}(x,y))$ , where $\hat{\phi}_c(x,y)$ is the channel value of combined image at $(x,y)$ on channel $c$ . The 3D LUT interpolation can be formulated as + +$$ +\hat {Y} _ {c} (x, y) = I \left(P _ {t} (x, y), T _ {c}\right), \quad c \in \{0, 1, 2 \} \tag {8} +$$ + +# 3.5 Loss Function + +We optimize the proposed method by minimizing $\mathcal{L}$ adopted from [38], which is composed of base loss $\mathcal{L}_b$ [46], color difference loss $\mathcal{L}_c$ , and perceptual loss $\mathcal{L}_p$ [48]. The base loss $\mathcal{L}_b$ [46] is divided into MSE loss $\mathcal{L}_r$ that ensures content fidelity and regularization losses constraining the values in the LUT, including smoothness loss $\mathcal{L}_s$ and monotonicity loss $\mathcal{L}_m$ . The color difference loss $\mathcal{L}_c$ is the color difference on the CIE94 LAB space. The perceptual loss $\mathcal{L}_p$ [48] is the LPIPS loss to improve the perceptual quality, which is the difference between ground truth and output image features on a pre-trained AlexNet [26]. The loss can be written as + +$$ +\mathcal {L} = \mathcal {L} _ {b} + 0. 0 0 5 * \mathcal {L} _ {c} + 0. 0 5 * \mathcal {L} _ {p} \tag {9} +$$ + +# 4 Experiments + +# 4.1 Datasets + +We use FiveK [4] and PPR10K [28] datasets to train and evaluate the proposed network. The FiveK dataset contains 5,000 RAW images and five ground truths retouched by experts (A/B/C/D/E). We select the expert C as ground truth for comparison with previous LUT methods [38, 44-46]. We also split the data into 4,500 pairs for training set and 500 for testing set, as provided in [46]. The 480p version images [46] are used in the training stage to speed up, and both 480p and 4K images are used in the testing stage. The PPR10K dataset contains 11,161 RAW portrait photos with three ground truths by three experts (a/b/c). We divide the dataset into 8,875 image pairs for the training stage and 2,286 pairs for the test stage with the official split [28]. Experiments are separately conducted for each ground truth on the 360p version of the dataset. + +We perform experiments for two types of tasks: photo retouch and tone mapping in camera pipeline. Both tasks have the 8-bit sRGB images as ground truth but have different input formats, which are sRGB format (8-bit on FiveK and 16-bit on PPR10K) in the photo retouch task, and 16-bit CIE XYZ format in the tone mapping task. The photo retouch task is conducted on both dataset, but the tone mapping task is conducted only on FiveK dataset. + +# 4.2 Application Settings + +The proposed network is trained end-to-end manner. The detail of each module is denoted in Tabs. 2 to 4 and Fig. 1. In comparison on PPR10K [28], pretrained ResNet-18 [15] is used as the Extractor instead of Tab. 2 and the hidden layer of GenLUT $(M_t)$ is increased by a factor of 2 for fair comparison with previous work [28,44,45]. Our models are trained for 400 epochs with the standard Adam optimizer [25] and a learning rate of $1 \times 10^{-4}$ . The learning rate decayed by 0.1 factor every 100 epochs. The minibatch size is 1 and 16 for FiveK and PPR10K, respectively. We implement our method on the PyTorch framework. Especially, the interpolation operation on both slicing and 3D LUT transform is + +![](images/f893d25b16cbfa5e3e8762e3363ff11cee6834e4b2f388fcb121999b4cbb66f9.jpg) + +![](images/0570abde7f9bc65f35afbdea752d5c5e3735d09a2bd5a577bd278f691f3db932.jpg) + +![](images/c4108908cad230e2ef3d0f3fb4c1ce204d33c59208e23fde577ef2342e9f82f9.jpg) +(c) Bilaterl grids $(K)$ + +![](images/88c15d5703af9b53cab196c827ce3dc77efa090d06be3955da5f0c37a851e430.jpg) +(a) LUTGen hidden layer $(M_{t})$ +(d) Extractor width $(m)$ +Fig. 3: Ablation studies on different numbers of LUTGen hidden layers (a), GridGen hidden layer (b), bilateral grids (c), Extractor width (d), Bilateral grid vertices (e), and LUT vertices (f). $M_{b} = 0$ and $M_{t} = 0$ indicate bypassing the spatial feature fusion step and the color enhancement step, respectively. + +![](images/85f19f9e82df6f1c75cab6f343c31f032262d6d60a388e19dd715c93bb3d1780.jpg) +(b) GridGen hidden layer $(M_b)$ +(e) Bilateral grid vertices $(N_{s_b})$ + +![](images/ce43bb92b51da0f864e7380a9c4d4dc4bc79c769d331b16313d13f455d7fbba5.jpg) +(f) LUT vertices $(N_{s_t})$ + +implemented using CUDA extension to speed up. All experiments are conducted on an NVIDIA Tesla V100 GPU. + +# 4.3 Ablation Studies + +To verify the selection of hyper-parameters for our model and the interpolation method for slicing and 3D LUT transform, we perform ablation studies on photo retouch tasks with the FiveK dataset (480p). Before ablation studies, We conduct a random search and achieve better performance than other models with a PSNR of 25.52 dB, when the model is composed of the Extractor ( $m = 8$ ), bilateral grid modules ( $M_{b} = 24$ , $N_{s_{b}} = 17$ , $K = 3$ ) with trilinear interpolation, and 3D LUT modules ( $M_{t} = 24$ , $N_{s_{t}} = 17$ ) with tetrahedral interpolation. Hence, we start our ablation studies with the above hyper-parameters. + +Selection of LUTGen and GridGen Parameters We assess the performance according to the number of LUTGen hidden layers $(M_t)$ with initial hyper-parameters, as can be seen in Fig. 3a. We can see our model has the best performance at $M_t = 24$ . However, the difference between $M_t = 8$ and $M_t = 24$ in performance is only $0.02dB$ , while the difference in parameter numbers is $239.9K$ . Therefore, we set $M_t = 8$ in our following experiments. + +After selecting $M_{t}$ , we explore the parameters of the GridGen for the number of GenLUT hidden layers ( $M_{b}$ ) and bilateral grids ( $K$ ). Although we find that $M_{b} = 32$ is the best as in Fig. 3b, we choose the $M_{b} = 8$ for the same reason of selecting $M_{t}$ ( $0.01dB \uparrow / 359.9K \uparrow$ ). Fig. 3c shows the performance with the change in the number of bilateral grids ( $K$ ). We select $K = 6$ because it shows a significant improvement in performance. + +The increases in the three parameters ( $M_{t}$ , $M_{b}$ , and $K$ ) generally leads to performance improvement. However, we can observe a decrease in performance + +Table 5: Ablation studies on losses, interpolation methods, and guidance map generation. + +
\( {\mathcal{L}}_{b} \)\( {\mathcal{L}}_{c} \)\( {\mathcal{L}}_{p} \)Guidance map GenLUT InterpolationGrid InterpolationPSNR
oxxxTetraTri25.35
ooxxTetraTri25.21
oxoxTetraTri25.49
oooxTetraTetra25.50
oooxTriTetra25.49
oooxTriTri25.57
ooo1 × 1TetraTri23.42
ooo3 × 3TetraTri22.45
oooxTetraTri25.66
+ +![](images/297bc2aa5c36148f2099dd8138654c89d6588b9fa465f36c08813f64b54c7ab5.jpg) +Fig.4: Trade-off between performance and model size on FiveK dataset [4]. Ours $(N_{s_b},N_{s_t})$ indicates the proposed model which has $N_{s_b}$ bilateral vertices and $N_{s_t}$ LUT vertices. The circle size is proportional to the model size. + +when parameters become too large. It seems that too complex network does not help to generate bilateral grids and 3D LUTs. The bilateral grid-only model $(M_{t} = 0)$ and LUT-only model $(M_{b} = 0)$ have relatively poor performance. These results show that each module contributes to performance improvement. + +Capacity of the Extractor We observe performance changes based on the difference in Extractor width $(m)$ to find structure which can generate optimal LUTs and bilateral grids. For more meticulous experiments, we make the variation on the number of LUT vertices $(N_{s_t})$ and bilateral grid vertices $(N_{s_b})$ . As shown in Fig. 3d, the best performance is achieved at $m = 8$ in all of the experiments. + +The Number of LUT Vertices and Bilateral Grid Vertices As can be seen in previous 3D LUT studies [28, 29, 38, 44-47], the number of vertices is an important factor in performance. Fig. 3e shows performance as different number of bilateral grid vertices. We can easily find that the optimal number of bilateral grid vertices is $N_{s_b} = 17$ . Ablation study for the number of LUT vertices can be seen in Fig. 3f. Although $N_{s_t} = 33$ has best performance, we select $N_{s_t} = 17$ after considering the trade-off in Fig. 4. The selected model is ours(17,17) in Fig. 4 and has a smaller size than other 3D LUT models [38, 44, 46] except [45] with better performance. + +Loss Function The first section of Tab. 5 shows performance differences regarding the loss. The combination of the three metrics shows the best performance, with the perceptual loss contributing the most to the performance improvement. + +![](images/f7040f53f6035b344de7460bd1d04c1f9d88a268d340370437ef56ff4371ef9c.jpg) +(a) + +![](images/b46f2912bf4faf91aadb524c4f6a58c8969126568194b7ee6955f6fce4c5e182.jpg) +(b) +Fig. 5: Visual result of the feature maps. The pictures in the first column are input, combined image, and output, respectively. The error map on upper left of combined image indicates differences with input image. The other six are visualizations for each channel. The pixels closer to red indicate more activated and the pixels closer to blue indicate less activated. + +Interpolation Method We demonstrate the ablation study of interpolation methods on the second section of Tab. 5. Since trilinear interpolation can utilize all eight adjacent sampling points, it might have the advantage of reflecting surrounding information in the slicing operation. On the other hand, tetrahedral interpolation appears to enable more accurate reconstruction in 3D LUT transform. Hence, we do not change the setting on interpolation methods. The difference in inference time between interpolation methods is negligible. + +Guidance Map Generator Previous studies about bilateral grids [11,51] usually have generated guidance maps instead of directly using an input image. We conduct an ablation study with two versions of guidance map generators based on HDRNet [11] GitHub4, which is composed of $1 \times 1$ convolution layers or $3 \times 3$ convolution layers. The third section of Tab. 5 shows that the model with guidance map generators has relatively poor performance. It is believed that the guidance map generators make the network too complex and increase the learning difficulty. Furthermore, the guidance map generator brings exponential increase in inference time, 21.6ms and 46.7ms for the $1 \times 1$ and $3 \times 3$ generators, respectively. Hence, we decide to directly use input image as a guidance map. + +# 4.4 Analysis of Spatial Feature + +In this section, we provide the analysis of the spatial features by visualizations. Following [38], we do not apply any loss on the spatial features. The spatial features flexibly categorize an image depending on the context of the input image. The examples of spatial features can be seen in Fig. 5. The spatial feature + +Table 6: Quantitative comparison results of photo retouch on the FiveK dataset [4]. “-” means the result is not available due to insufficient GPU memory. “*” indicates that the results are obtained from their paper and “/” are absent results due to publicly unavailable code. The best and second-best results are in red and blue, respectively. + +
Method#param480pFull Resolution (4K)
PSNRSSIMΔEabRuntimePSNRSSIMΔEabRuntime
UPE [37]927.1K21.880.85310.804.2721.650.85911.0956.88
DPE [9]3.4M23.750.9089.347.21----
HDRNet [11]483.1K24.660.9158.063.4924.520.9218.2056.07
DeepLPF [31]1.7M24.730.9167.9932.12----
CSRNet [14]36.4K25.190.9257.763.0924.820.9247.9477.10
3D LUT [46]593.5K25.290.9237.551.1725.250.9327.591.49
SA-3DLUT* [38]4.5M25.50//2.27///4.39
SepLUT* [45]119.8K25.470.9217.541.1025.430.9327.561.20
AdaInt [44]619.7K25.490.9267.471.2925.480.9347.451.59
Ours463.7K25.660.9307.291.2025.660.9377.273.64
+ +Table 7: Quantitative comparisons on the FiveK dataset [4] for tone mapping. + +
Method480p
PSNRSSIMΔEab
UPE [37]21.560.83712.29
DPE [9]22.930.89411.09
HDRNet [11]24.520.9158.14
CSRNet [14]25.190.9217.63
3DLUT [46]25.070.9207.55
SepLUT* [45]25.430.9227.43
AdaInt [44]25.280.9257.48
Ours25.590.9327.14
+ +Table 8: Quantitative comparisons on the PPR10K dataset [28] for photo retouch. + +
DatasetMethodPSNRΔEabPSRHCΔEa
PPR10K-a3DLUT [46]25.646.9728.894.53
SepLUT* [45]26.286.59//
AdaInt [44]26.336.5629.574.26
Ours26.456.5129.704.23
PPR10K-b3DLUT [46]24.707.7127.994.99
SepLUT* [45]25.237.49//
AdaInt [44]25.407.3328.654.75
Ours25.487.1928.724.66
PPR10K-c3DLUT [46]25.187.5828.494.92
SepLUT* [45]25.597.51//
AdaInt [44]25.687.3128.934.76
Ours25.727.2829.004.72
+ +$\phi_{2}$ and $\phi_{5}$ represent bright and dark areas of the image, respectively. The $\phi_{1}$ compensates for dark areas and $\phi_{4}$ covers overall area. The $\phi_{0}$ and $\phi_{3}$ are in charge of details of the bright area. The combined images undergoes local adjustments based on spatial features. This analysis shows that spatial feature provide pixel-wise spatial-aware weights for local enhancement. + +# 4.5 Comparison with State-of-the-Arts + +We compare our methods with other SOTA real-time image enhancement methods. We especially focused on our experiments with other 3D LUT models [28, 38, 44-46]. However, we only provide quantitative results in the case of [38] and [45] since they do not provide publicly available code. + +Quantitative Comparisons For quantitative comparisons, three metrics are used: PSNR, SSIM [39], $L_{2}$ -distance in CIE LAB color space ( $\Delta E_{ab}$ ) on FiveK + +![](images/1ac93f2d19030e78cddd8c9d28a6b73d0d36bf700d24d2754eb9f6e3e21ef9c1.jpg) +Fig. 6: Qualitative comparisons on the FiveK dataset [4] for photo retouch. The corresponding error maps on the upper right of each picture indicate differences with ground truth, where each color indicates the degree of error based on the corresponding color bars on the right. + +dataset. We include the human-centered PSNR $(PSNR^{HC})$ and color difference $(\Delta E_{ab}^{HC})$ [28] on PPR10K dataset. Tab. 6 shows comparisons on the FiveK dataset for photo retouch. The inference time is measured on the same image set, by running 100 times and averaging them. Our method outperforms other methods on both resolutions. Similar results can be seen in Tab. 7 for the tone mapping task on FiveK dataset, and in Tab. 8 for the photo retouch task on the PPR10K dataset. We also provide analysis for runtime increment on 4K resolution and standard deviations of runtime in supplementary materials. + +Especially, the results show that we alleviate the intrinsic problems of the spatial-aware LUT method mentioned in previous work, the tremendous model size, and the long inference time. Our method has a much smaller size than SA-3DLUT [38] (about 1/10 times). This number of parameters is even smaller than AdaInt [44] and 3DLUT [46]. Furthermore, we have already shown that ours(9, 9) outperforms the SepLUT [45] with a similar model size in Fig. 4. The inference time on $480\mathrm{p}$ is smaller than SA-3DLUT [38] (about 1/2 times) and similar to other LUT methods [44-46]. Although the inference time is increased in the case of 4K resolution, it is still shorter than SA-3DLUT [38]. + +Qualitative Comparisons The qualitative comparisons can be seen in Fig. 6 with corresponding error maps on the upper right of each picture. Each color of the error map indicates the difference with ground truth based on the corresponding color bars on the right. + +In the first row of Fig. 6, it can be observed that our method performs better than others in local enhancement. The 3DLUT and AdaInt of the dark area captured in the red rectangle appear somber compared to the ground truth. + +On the other hand, the CSRNet is entirely reddish. Our method enhances the image in both dark and bright areas, making it closer to the ground truth. In the second row of Fig. 6, it can be observed that our method is capable of producing vivid colors. Comparing the leaf on the blue rectangle in our method to the other methods, it can be seen that our method produces a clearer green color. Similarly, the red color at the end of the yellow leaves in the red rectangle is also improved. The last row of the figure shows that our model has improved the overall color of the image. Specifically, the color of the ground and seat in the red and blue rectangles is closer to the ground truth than the other methods. + +# 5 Limitations and Discussion + +Although our inference time is effectively reduced compared to SA-3DLUT [38], we have observed that the inference time increases as the resolution increases. This is a common issue with spatial-aware methods. However, we believe that a processing time of 3.6ms is sufficient for real-time high-resolution video processing. However, there may be some special applications in the future that require constraints such as a resolution greater than 8K or a frame rate exceeding 200 fps. To address these challenges, we plan to investigate the correlation between image resolution and processing time and explore methods that process spatial features with a unit of patch or super-pixel [2], which could be one of the potential solutions. + +Another future work is to apply the adaptive sampling [44] to a bilateral grid. When we apply the adaptive sampling on the 3D LUT, the performance is downgraded by $0.15\mathrm{dB}$ on PSNR. It seems that the adaptive sampling effect has already been reflected in the spatial feature fusion step. However, we believe that adaptive sampling on the bilateral grids could effectively handle adaptive local enhancement. + +# 6 Conclusion + +We have developed a method that utilizes bilateral grids to create a learnable spatial-aware 3D LUT for fast image enhancement. The bilateral grid is an effective way of conveying spatial information because its data structure can provide spatial features through a non-parametric slicing process. Our framework is designed to enhance local areas efficiently, resulting in improved results. We have extensively tested our method on two datasets and have demonstrated that it outperforms other state-of-the-art methods in terms of both performance and efficiency. Our model achieves state-of-the-art performance with a relatively small model size and short inference time. Additionally, we have achieved better performance by using an appropriate interpolation method for slicing and 3D LUT transform. + +# Acknowledgements + +This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] and in part by the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University in 2024. + +# References + +1. A Sharif, S., Naqvi, R.A., Biswas, M., Kim, S.: A two-stage deep network for high dynamic range image reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 550-559 (2021) +2. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Süsstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE transactions on pattern analysis and machine intelligence 34(11), 2274-2282 (2012) +3. Akyüz, A.O., et al.: Deep joint deinterlacing and denoising for single shot dual-iso hdr reconstruction. IEEE Transactions on Image Processing 29, 7511-7524 (2020) +4. Bychkovsky, V., Paris, S., Chan, E., Durand, F.: Learning photographic global tonal adjustment with a database of input/output image pairs. In: CVPR 2011. pp. 97-104. IEEE (2011) +5. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018) +6. Chen, J., Adams, A., Wadhwa, N., Hasinoff, S.W.: Bilateral guided upsampling. ACM Transactions on Graphics (TOG) 35(6), 1-8 (2016) +7. Chen, J., Paris, S., Durand, F.: Real-time edge-aware image processing with the bilateral grid. ACM Transactions on Graphics (TOG) 26(3), 103-es (2007) +8. Chen, X., Liu, Y., Zhang, Z., Qiao, Y., Dong, C.: Hdrunet: Single image hdr reconstruction with denoising and dequantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 354-363 (2021) +9. Chen, Y.S., Wang, Y.C., Kao, M.H., Chuang, Y.Y.: Deep photo enhancer: Unpaired learning for image enhancement from photographs with gans. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6306-6314 (2018) +0. Deng, Y., Loy, C.C., Tang, X.: Aesthetic-driven image enhancement by adversarial learning. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 870-878 (2018) +1. Gharbi, M., Chen, J., Barron, J.T., Hasinoff, S.W., Durand, F.: Deep bilateral learning for real-time image enhancement. ACM Transactions on Graphics (TOG) 36(4), 1-12 (2017) +12. Guo, C., Fan, L., Zhang, Q., Liu, H., Liu, K., Jiang, X.: Redistributing the precision and content in 3d-lut-based inverse tone-mapping for hdr/wcg display. In: Proceedings of the 20th ACM SIGGRAPH European Conference on Visual Media Production. pp. 1-10 (2023) +13. Hashimoto, N., Takamaeda-Yamazaki, S.: An fpga-based fully pipelined bilateral grid for real-time image denoising. In: 2021 31st International Conference on Field-Programmable Logic and Applications (FPL). pp. 167-173. IEEE (2021) + +14. He, J., Liu, Y., Qiao, Y., Dong, C.: Conditional sequential modulation for efficient global image retouching. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 679-695. Springer (2020) +15. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) +16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018) +17. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: HDR-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022) +18. Huang, X., Belongie, S.: Arbitrary style transfer in real-time with adaptive instance normalization. In: Proceedings of the IEEE international conference on computer vision. pp. 1501-1510 (2017) +19. Ignatov, A., Kobyshev, N., Timofte, R., Vanhoey, K., Van Gool, L.: Dslr-quality photos on mobile devices with deep convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 3277-3285 (2017) +20. Jiang, Y., Gong, X., Liu, D., Cheng, Y., Fang, C., Shen, X., Yang, J., Zhou, P., Wang, Z.: Enlightengan: Deep light enhancement without paired supervision. IEEE transactions on image processing 30, 2340-2349 (2021) +21. Jiang, Y., Zhang, H., Zhang, J., Wang, Y., Lin, Z., Sunkavalli, K., Chen, S., Amirghodsi, S., Kong, S., Wang, Z.: Ssh: A self-supervised framework for image harmonization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4832-4841 (2021) +22. Karaimer, H.C., Brown, M.S.: A software platform for manipulating the camera imaging pipeline. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part I 14. pp. 429-444. Springer (2016) +23. Kim, H.U., Koh, Y.J., Kim, C.S.: Pienet: Personalized image enhancement network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXX 16. pp. 374-390. Springer (2020) +24. Kim, S.Y., Oh, J., Kim, M.: Jsi-gan: Gan-based joint super-resolution and inverse tone-mapping with pixel-wise task-specific filters for uhd hdr video. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 11287-11295 (2020) +25. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) +26. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012) +27. Le, P.H., Le, Q., Nguyen, R., Hua, B.S.: Single-image hdr reconstruction by multiexposure generation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4063-4072 (2023) +28. Liang, J., Zeng, H., Cui, M., Xie, X., Zhang, L.: Ppr10k: A large-scale portrait photo retouching dataset with human-region mask and group-level consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 653-661 (2021) +29. Liu, C., Yang, H., Fu, J., Qian, X.: 4d lut: learnable context-aware 4d lookup table for image enhancement. IEEE Transactions on Image Processing 32, 4742-4756 (2023) + +30. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020) +31. Moran, S., Marza, P., McDonagh, S., Parisot, S., Slabaugh, G.: Deeplpf: Deep local parametric filters for image enhancement. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12826-12835 (2020) +32. Park, J., Lee, J.Y., Yoo, D., Kweon, I.S.: Distort-and-recover: Color enhancement using deep reinforcement learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5928-5936 (2018) +33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) +34. Song, Y., Qian, H., Du, X.: Starenhancer: Learning real-time and style-aware image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4126-4135 (2021) +35. Vandenberg, J.D., Andriani, S.: A survey on 3d-lut performance in 10-bit and 12-bit hdr bt. 2100 pq. In: SMPTE 2018. pp. 1-19. SMPTE (2018) +36. Wang, D., Zheng, Z., Ding, W., Jia, X.: Lgabl: Uhd multi-exposure image fusion via local and global aware bilateral learning. IEEE Transactions on Emerging Topics in Computational Intelligence (2023) +37. Wang, R., Zhang, Q., Fu, C.W., Shen, X., Zheng, W.S., Jia, J.: Underexposed photo enhancement using deep illumination estimation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6849-6857 (2019) +38. Wang, T., Li, Y., Peng, J., Ma, Y., Wang, X., Song, F., Yan, Y.: Real-time image enhancer via learnable spatial-aware 3d lookup tables. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2471-2480 (2021) +39. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) +40. Wei, C., Wang, W., Yang, W., Liu, J.: Deep retina decomposition for low-light enhancement. arXiv preprint arXiv:1808.04560 (2018) +41. Xu, B., Xu, Y., Yang, X., Jia, W., Guo, Y.: Bilateral grid learning for stereo matching networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12497-12506 (2021) +42. Xu, Q., Wang, L., Wang, Y., Sheng, W., Deng, X.: Deep bilateral learning for stereo image super-resolution. IEEE Signal Processing Letters 28, 613-617 (2021) +43. Yan, Z., Zhang, H., Wang, B., Paris, S., Yu, Y.: Automatic photo adjustment using deep neural networks. ACM Transactions on Graphics (TOG) 35(2), 1-15 (2016) +44. Yang, C., Jin, M., Jia, X., Xu, Y., Chen, Y.: Adaint: Learning adaptive intervals for 3d lookup tables on real-time image enhancement. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17522-17531 (2022) +45. Yang, C., Jin, M., Xu, Y., Zhang, R., Chen, Y., Liu, H.: Seplut: Separable image-adaptive lookup tables for real-time image enhancement. In: European Conference on Computer Vision (ECCV). pp. 201-217. Springer (2022) + +46. Zeng, H., Cai, J., Li, L., Cao, Z., Zhang, L.: Learning image-adaptive 3d lookup tables for high performance photo enhancement in real-time. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) 44(4), 2058-2073 (2022) +47. Zhang, F., Zeng, H., Zhang, T., Zhang, L.: Clut-net: Learning adaptively compressed representations of 3dluts for lightweight image enhancement. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 6493-6501 (2022) +48. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018) +49. Zhang, Y., Zhang, J., Guo, X.: Kindling the darkness: A practical low-light image enhancer. In: Proceedings of the 27th ACM international conference on multimedia. pp. 1632-1640 (2019) +50. Zhang, Z., Jiang, Y., Jiang, J., Wang, X., Luo, P., Gu, J.: Star: A structure-aware lightweight transformer for real-time image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4106-4115 (2021) +51. Zheng, Z., Ren, W., Cao, X., Wang, T., Jia, X.: Ultra-high-definition image hdr reconstruction via collaborative bilateral learning. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 4449-4458 (2021) +52. Zhou, Y., Li, C., Liang, J., Xu, T., Liu, X., Xu, J.: 4k-resolution photo exposure correction at 125 fps with $\sim$ 8k parameters. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1587-1597 (2024) \ No newline at end of file diff --git a/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/images.zip b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..5b8957c13864819f450c42fc1902148a57d3c957 --- /dev/null +++ b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c2a76d6579fc57c1559da29efdc0f087b6b19e1abcf9905faf0ba0f634d75e1a +size 643720 diff --git a/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/layout.json b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..1381c2dfa200330b9f6f6a8c0531e2eb6b05959e --- /dev/null +++ b/2024/Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids/layout.json @@ -0,0 +1,10679 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 138, + 111, + 477, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 111, + 477, + 148 + ], + "spans": [ + { + "bbox": [ + 138, + 111, + 477, + 148 + ], + "type": "text", + "content": "Image-adaptive 3D Lookup Tables for Real-time Image Enhancement with Bilateral Grids" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 221, + 168, + 392, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 221, + 168, + 392, + 181 + ], + "spans": [ + { + "bbox": [ + 221, + 168, + 392, + 181 + ], + "type": "text", + "content": "Wontae " + }, + { + "bbox": [ + 221, + 168, + 392, + 181 + ], + "type": "inline_equation", + "content": "\\mathrm{Kim}^{1,3}" + }, + { + "bbox": [ + 221, + 168, + 392, + 181 + ], + "type": "text", + "content": " and Nam Ik Cho" + }, + { + "bbox": [ + 221, + 168, + 392, + 181 + ], + "type": "inline_equation", + "content": "^{1,2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 208, + 190, + 405, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 190, + 405, + 201 + ], + "spans": [ + { + "bbox": [ + 208, + 190, + 405, + 201 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 208, + 190, + 405, + 201 + ], + "type": "text", + "content": " IPAI, Seoul National University, Seoul, Korea" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 162, + 201, + 451, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 201, + 451, + 213 + ], + "spans": [ + { + "bbox": [ + 162, + 201, + 451, + 213 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 162, + 201, + 451, + 213 + ], + "type": "text", + "content": " Department of ECE, INMC, Seoul National University, Seoul, Korea" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 271, + 212, + 342, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 271, + 212, + 342, + 223 + ], + "spans": [ + { + "bbox": [ + 271, + 212, + 342, + 223 + ], + "type": "text", + "content": "3 LG Electronics" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 247, + 224, + 367, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 224, + 367, + 234 + ], + "spans": [ + { + "bbox": [ + 247, + 224, + 367, + 234 + ], + "type": "text", + "content": "{munte2, nicho}@snu.ac.kr" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 272, + 455, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 272, + 455, + 470 + ], + "spans": [ + { + "bbox": [ + 160, + 272, + 455, + 470 + ], + "type": "text", + "content": "Abstract. Image enhancement and restoration methods using adaptive 3D lookup tables (3D LUTs) have shown promising results with real-time inferencing. These methods directly transform input pixel values into enhanced ones by using interpolation operations with predicted 3D LUT values. However, it is still challenging to deal with locally different properties of images since most 3D LUT methods are simple color-to-color transforms. Although including spatial information in this transform can be a good solution, it can significantly increase the number of parameters and inference time. To address this issue, we propose an efficient spatial-aware image enhancement model that combines bilateral grids and 3D LUTs. Specifically, we transform bilateral grids into a spatial feature domain to incorporate spatial information in our 3D LUT model. To reduce inference time and save parameters, we use slicing operations in our network architecture instead of the long decoding path of the U-Net architecture used in most existing studies. Our model achieves state-of-the-art performance without increasing parameters and further reduces inference time, as demonstrated by extensive results. Codes are available at https://github.com/WontaeaeKim/LUTwithBGrid" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 160, + 481, + 403, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 481, + 403, + 492 + ], + "spans": [ + { + "bbox": [ + 160, + 481, + 403, + 492 + ], + "type": "text", + "content": "Keywords: Image enhancement " + }, + { + "bbox": [ + 160, + 481, + 403, + 492 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 481, + 403, + 492 + ], + "type": "text", + "content": " 3D LUT " + }, + { + "bbox": [ + 160, + 481, + 403, + 492 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 481, + 403, + 492 + ], + "type": "text", + "content": " Bilateral grid" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 516, + 230, + 529 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 516, + 230, + 529 + ], + "spans": [ + { + "bbox": [ + 132, + 516, + 230, + 529 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Image enhancement has become increasingly popular with the widespread use of high-resolution and wide-color-gamut display devices and cameras. Recently, deep learning-based approaches have shown impressive results by extracting and utilizing effective features of images [1,3,5,8-10,17,19,20,23,24,27,30,31,40,43, 49]. However, these approaches require high computational costs and long inference times. To address this problem, researchers have investigated a learningbased 3D lookup table (3D LUT) as an alternative [12,21,28,29,34,38,44-47,50]. The 3D LUT instantly converts input color values to improved ones by interpolating pre-computed values in the 3D LUT instead of performing repeated computations, effectively reducing computational costs." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": "Specifically, Zeng et al. proposed a convolutional neural network (CNN) model that predicts the values needed to create an efficient 3D LUT [46]. However, the authors have also addressed the limitation in that it only provides a color-to-color transformation and lacks spatial information. This means that it may not be effective in enhancing certain areas of an image that require local adjustments. To address this limitation, a spatially adaptive method (SA-3DLUT) was proposed, which uses a U-net style backbone to incorporate spatial information [38]. This approach achieves state-of-the-art performance, but requires a significantly larger number of parameters than previous plain LUT approaches. Other advanced 3D LUT methods [28, 29, 44, 45, 47] have also improved image quality, but the issue of missing spatial information remains a challenge. As can be seen in prior studies, including spatial information without an expanded model is very challenging." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 272, + 482, + 402 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 272, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 272, + 482, + 402 + ], + "type": "text", + "content": "To solve this issue, we introduce the method using bilateral grids to incorporate spatial information while reducing computational costs and model size. The bilateral grid is a data structure consisting of 2D spatial dimensions and 1D intensity dimension [7]. Recent deep learning-based approaches generate the bilateral grids from an image and transform them into features or coefficients by slicing operation for their purpose [6,11,13,36,41,42,51,52]. Slicing can help to reduce computational costs due to its non-parametric property [7]. The experiments of Gharbi et al. [11] showed that slicing with the bilateral grids achieve better performance and shorter running time compared to U-net in the Local Laplacian task. To take those advantages, our method generates spatial features from slicing with bilateral grids instead of the U-Net." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 403, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 498 + ], + "type": "text", + "content": "The overall architecture of our method is shown in Fig. 1. We use the Extractor to extract image context from the input image, which is used to generate image-adaptive bilateral grids and 3D LUTs. The bilateral grids provide spatial-aware property to our model after transformed to spatial features by slicing. Finally, the input image combined with spatial features is used to generate the enhanced image by the 3D LUT transform. The experiments show that this architecture can achieve better performance with relatively small number of parameters." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 498, + 482, + 547 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 547 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 547 + ], + "type": "text", + "content": "In addition, we also explore tetrahedral interpolation as well as trilinear interpolation to apply effective interpolation methods when slicing and 3D LUT transformation. We find that tetrahedral and trilinear interpolation provide the optimal performance to 3D LUTs and bilateral grids, respectively." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 146, + 547, + 351, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 547, + 351, + 559 + ], + "spans": [ + { + "bbox": [ + 146, + 547, + 351, + 559 + ], + "type": "text", + "content": "The contributions of this paper are three-fold:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 563, + 479, + 657 + ], + "type": "list", + "angle": 0, + "index": 10, + "blocks": [ + { + "bbox": [ + 138, + 563, + 479, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 563, + 479, + 586 + ], + "spans": [ + { + "bbox": [ + 138, + 563, + 479, + 586 + ], + "type": "text", + "content": "- We introduce a new application of bilateral grids for 3D LUT construction, incorporating spatial features using only a small number of parameters." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 586, + 479, + 622 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 586, + 479, + 622 + ], + "spans": [ + { + "bbox": [ + 138, + 586, + 479, + 622 + ], + "type": "text", + "content": "- We propose an efficient architecture for spatial-aware 3D LUTs that leverages a cascade of bilateral grids and 3D LUTs. This architecture produces an improved output with fewer parameters." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 622, + 479, + 657 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 622, + 479, + 657 + ], + "spans": [ + { + "bbox": [ + 138, + 622, + 479, + 657 + ], + "type": "text", + "content": "- We conduct extensive experiments to compare our approach with existing methods on two publicly available benchmark datasets. Results demonstrate the efficiency and effectiveness of our method in image enhancement." + } + ] + } + ], + "index": 9 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 113, + 474, + 297 + ], + "blocks": [ + { + "bbox": [ + 141, + 113, + 474, + 297 + ], + "lines": [ + { + "bbox": [ + 141, + 113, + 474, + 297 + ], + "spans": [ + { + "bbox": [ + 141, + 113, + 474, + 297 + ], + "type": "image", + "image_path": "cb2716a8b2a1f114b74e60affddef0b2357f9767af283b9691dd9a46e2e44c70.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 304, + 482, + 361 + ], + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 361 + ], + "type": "text", + "content": "Fig. 1: Framework of the proposed method. An image context is extracted from a downsampled image, which is then used to predict bilateral grids and 3D LUTs. The bilateral grids are transformed into spatial features by slicing operation. After being combined with spatial features by a " + }, + { + "bbox": [ + 130, + 304, + 482, + 361 + ], + "type": "inline_equation", + "content": "1 \\times 1" + }, + { + "bbox": [ + 130, + 304, + 482, + 361 + ], + "type": "text", + "content": " convolution layer, the combined image is converted to a spatial-aware enhanced image by 3D LUT interpolation." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 386, + 237, + 399 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 237, + 399 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 237, + 399 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 422, + 482, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 541 + ], + "type": "text", + "content": "In this section, we will briefly review hybrid methods that combine deep-learning and traditional methods to achieve better image enhancement. Typically, methods that use only deep learning [5, 9, 10, 19, 20, 23, 37, 40, 43, 49] predict all pixels on images with numerous deep neural layers. While these methods can deliver high performance, they require heavy computational costs and resources. On the other hand, hybrid methods predict the parameters of traditional models, such as the coefficients of color transform [14, 16, 32], bilateral grids [11, 51], or 3D LUT [28, 29, 38, 44-47], instead of directly predicting enhanced images. It has been shown that hybrid methods achieve better performance than deep-learning-only methods while requiring relatively shallow networks and light resources." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "content": "The methods predicting coefficients of color transform mimic human experts' photo retouch process, which adjusts brightness, contrast, tone mapping curves, or white balance. To be precise, [16,32] apply color transforms based on the current image state through the reinforcement learning approach, while [14] replaces traditional color transform into multi-layer perceptrons (MLPs)." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "Gharbi et al. introduced HDRNet framework [11] that produces enhanced images with pixel-wise affine transform and coefficients reconstructed from predicted bilateral grids. Zheng et al. introduced collaborative learning [51] with bilateral grids and LeakyAdaIN, an extension of adaptive instance normalization (AdaIN) [18], to reconstruct UHD HDR image from input image in real-time." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "content": "Zeng et al. showed that the weighted sum of basis LUTs can achieve image-adaptive enhancement with a simple CNN weight predictor [46]. Yang et al. combined 1D LUTs [45] and adaptive intervals [44] with [46] to improve the capacity of LUTs. The 4D LUT was introduced in [29], which is a combination of context channel (1D) and RGB channels (3D). The above LUT methods achieved promising performance with a light network and fast inference speed. However, these methods still suffer from a lack of spatial information to handle local enhancement in an image. Although SA-3DLUT [38] provides spatial information with U-NET [33] style backbone network, it requires a tremendous number of parameters and inference time. In the following section, we will introduce a new method that is a combination of LUTs and bilateral grids to provide color enhancement and spatial information, respectively, without parameter increase." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 278, + 261, + 292 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 278, + 261, + 292 + ], + "spans": [ + { + "bbox": [ + 132, + 278, + 261, + 292 + ], + "type": "text", + "content": "3 Proposed Method" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 304, + 482, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 449 + ], + "type": "text", + "content": "We present our network and loss functions in this section. The overall network architecture comprises three steps, as illustrated in Fig. 1: image context extraction, spatial feature fusion, and color enhancement. A simple CNN network extracts image context vectors, which are then fed to the GridGen and LUTGen modules to generate image-adaptive bilateral grids and 3D LUTs. Spatial feature fusion and color enhancement are sequentially carried out using bilateral grids and 3D LUTs, respectively. This cascade structure is effective in image signal processing [22,45], where each module focuses on its specific functionality. The slicing operation cost-effectively generates spatial features from bilateral grids, which have the same resolution as the input image. The spatial features are combined with an input image by the " + }, + { + "bbox": [ + 130, + 304, + 482, + 449 + ], + "type": "inline_equation", + "content": "1 \\times 1" + }, + { + "bbox": [ + 130, + 304, + 482, + 449 + ], + "type": "text", + "content": " convolution. The combined image is transformed into an enhanced image by interpolation operation on 3D LUTs." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 465, + 293, + 478 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 465, + 293, + 478 + ], + "spans": [ + { + "bbox": [ + 132, + 465, + 293, + 478 + ], + "type": "text", + "content": "3.1 Preliminary: Interpolation" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "text", + "content": "In this section, we will delve into trilinear and tetrahedral interpolation methods, which are used in the slicing operation and 3D LUT transform. The interpolation process involves two steps, looking up to find adjacent points for a query point " + }, + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "inline_equation", + "content": "P = (p_x,p_y,p_z)" + }, + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "text", + "content": " and then computing the weighted sum of those adjacent points. To simplify the computation process, we assume a normalized three-dimensional grid " + }, + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "inline_equation", + "content": "G\\in \\mathbb{R}^{N_s\\times N_s\\times N_s}" + }, + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "text", + "content": ", such as a 3D LUT or a bilateral grid, where " + }, + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "inline_equation", + "content": "N_{s}" + }, + { + "bbox": [ + 130, + 485, + 482, + 569 + ], + "type": "text", + "content": " is the number of vertices." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": "Trilinear interpolation finds the eight adjacent points in the lookup step, where the left and right adjacent points on each axis " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\alpha \\in \\{x,y,z\\}" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " are denoted as " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "p_{\\alpha}^{0}, p_{\\alpha}^{1}" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": ". If the grid has uniform lattices, the adjacent point can be found as " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "p_{\\alpha}^{0} = \\lfloor p_{\\alpha} \\cdot (N_{s} - 1) \\rfloor / (N_{s} - 1)" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "p_{\\alpha}^{1} = p_{\\alpha}^{0} + 1 / (N_{s} - 1)" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\lfloor \\cdot \\rfloor" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " is the floor operator and " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "p_{\\alpha}" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " is a query point on " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " axis. In the case of non-uniform lattices, adjacent points can be found by the binary search [44]. The weight indicates how much an adjacent point influences the query point, which is denoted as " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "w_{i,j,k} = (\\varDelta_x)^i(1-\\varDelta_x)^{1-i}(\\varDelta_y)^j(1-\\varDelta_y)^{1-j}(\\varDelta_z)^k(1-\\varDelta_z)^{1-k}" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\varDelta_{\\alpha}=" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 116, + 306, + 223 + ], + "blocks": [ + { + "bbox": [ + 135, + 116, + 306, + 223 + ], + "lines": [ + { + "bbox": [ + 135, + 116, + 306, + 223 + ], + "spans": [ + { + "bbox": [ + 135, + 116, + 306, + 223 + ], + "type": "image", + "image_path": "1e1d1a1e8dc5c082adbd4026f915412de9b22a555d1058b868dfd273ac84261f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 224, + 308, + 245 + ], + "lines": [ + { + "bbox": [ + 132, + 224, + 308, + 245 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 308, + 245 + ], + "type": "text", + "content": "Fig.2: Description of tetrahedral interpolation" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 317, + 182, + 487, + 234 + ], + "blocks": [ + { + "bbox": [ + 317, + 140, + 486, + 172 + ], + "lines": [ + { + "bbox": [ + 317, + 140, + 486, + 172 + ], + "spans": [ + { + "bbox": [ + 317, + 140, + 486, + 172 + ], + "type": "text", + "content": "Table 1: Weights and adjacent points of tetrahedral interpolation depending on the condition" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 317, + 182, + 487, + 234 + ], + "lines": [ + { + "bbox": [ + 317, + 182, + 487, + 234 + ], + "spans": [ + { + "bbox": [ + 317, + 182, + 487, + 234 + ], + "type": "table", + "html": "
TetrahedronCondition\\( {w}_{0} \\)\\( {w}_{1} \\)\\( {w}_{2} \\)\\( {w}_{3} \\)\\( {V}_{1} \\)\\( {V}_{2} \\)
\\( {t}_{0} \\)\\( {\\Delta }_{x} > {\\Delta }_{y} > {\\Delta }_{z} \\)1 \\( - {\\Delta }_{x} \\)\\( {\\Delta }_{x} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} \\)\\( {V}_{100} \\)\\( {V}_{110} \\)
\\( {t}_{1} \\)\\( {\\Delta }_{x} > {\\Delta }_{z} > {\\Delta }_{y} \\)1 \\( - {\\Delta }_{x} \\)\\( {\\Delta }_{x} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} \\)\\( {V}_{101} \\)\\( {V}_{101} \\)
\\( {t}_{2} \\)\\( {\\Delta }_{y} > {\\Delta }_{z} > {\\Delta }_{z} \\)1 \\( - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{x} \\)\\( {\\Delta }_{z} \\)\\( {V}_{010} \\)\\( {V}_{110} \\)
\\( {t}_{3} \\)\\( {\\Delta }_{y} > {\\Delta }_{z} > {\\Delta }_{x} \\)1 \\( - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{x} \\)\\( {\\Delta }_{x} \\)\\( {V}_{010} \\)\\( {V}_{011} \\)
\\( {t}_{4} \\)\\( {\\Delta }_{z} > {\\Delta }_{y} > {\\Delta }_{y} \\)1 \\( - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} \\)\\( {V}_{001} \\)\\( {V}_{011} \\)
\\( {t}_{5} \\)\\( {\\Delta }_{z} > {\\Delta }_{y} > {\\Delta }_{x} \\)1 \\( - {\\Delta }_{z} \\)\\( {\\Delta }_{z} - {\\Delta }_{y} \\)\\( {\\Delta }_{y} - {\\Delta }_{x} \\)\\( {\\Delta }_{x} \\)\\( {V}_{001} \\)\\( {V}_{011} \\)
", + "image_path": "399e976e2004cef1d9c38c74f479e13bb31116c5140eb20c48d1bd151ea1c085.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "spans": [ + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "inline_equation", + "content": "(p_{\\alpha} - p_{\\alpha}^{0}) / (p_{\\alpha}^{1} - p_{\\alpha}^{0})" + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "text", + "content": ". Denoting the value corresponding to adjacent points on the grid " + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "text", + "content": " as " + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "inline_equation", + "content": "V_{i,j,k}" + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "text", + "content": ", the trilinear interpolation " + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "inline_equation", + "content": "I_{tri}(\\cdot)" + }, + { + "bbox": [ + 132, + 280, + 480, + 305 + ], + "type": "text", + "content": " is formulated as" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 229, + 313, + 481, + 341 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 313, + 481, + 341 + ], + "spans": [ + { + "bbox": [ + 229, + 313, + 481, + 341 + ], + "type": "interline_equation", + "content": "I _ {t r i} (P, G) = \\sum_ {i, j, k \\in \\{0, 1 \\}} w _ {i, j, k} \\cdot V _ {i, j, k}. \\tag {1}", + "image_path": "1219939e677ac2c9266e22fedfd1285b5dd36fef96935a99c16e7f0e96d5ec5f.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "spans": [ + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": "As can be seen in Tab. 1 and Fig. 2, the tetrahedral interpolation can be carried out with four adjacent sampling point values " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "V_{n}" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": " and weights " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "w_{n}" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": " (" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "n \\in \\{0,1,2,3\\}" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": ") depending on " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "\\varDelta_x" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "\\varDelta_y" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "\\varDelta_z" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": ". Detailed conditions are described in Tab. 1, where " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "V_{0}" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "V_{3}" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": " are fixed at " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "V_{000}" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "V_{111}" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": ", respectively. Tetrahedral interpolation " + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "inline_equation", + "content": "I_{tetra}(\\cdot)" + }, + { + "bbox": [ + 131, + 345, + 482, + 405 + ], + "type": "text", + "content": " can be represented as" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 234, + 413, + 481, + 441 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 234, + 413, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 234, + 413, + 481, + 441 + ], + "type": "interline_equation", + "content": "I _ {t e t r a} (P, G) = \\sum_ {n \\in \\{0, 1, 2, 3 \\}} w _ {n} \\cdot V _ {n}. \\tag {2}", + "image_path": "b9956f8187dbf034e63d738ed957094240c8178b0b9e32e835c865e90287730a.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 449, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 449, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 131, + 449, + 482, + 521 + ], + "type": "text", + "content": "The previous 3D LUT methods [28, 29, 38, 44-47] considered only trilinear interpolation when retrieving enhanced color values. However, experiments of Vandenberg et al. [35] showed that tetrahedral interpolation has better performance on image processing with fixed 3D LUTs. After we explore how the two interpolation methods affect our model in the Sec. 4.3, we determine the interpolation methods for 3D LUT transform and slicing." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 538, + 293, + 551 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 538, + 293, + 551 + ], + "spans": [ + { + "bbox": [ + 132, + 538, + 293, + 551 + ], + "type": "text", + "content": "3.2 Image Context Extraction" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "content": "Our framework is designed to be adaptive to images using image context extraction. The first step in this process is to bilinear downsample the input image " + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "inline_equation", + "content": "X \\in \\mathbb{R}^{3 \\times H \\times W}" + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "content": ". This allows our model to process images at arbitrary resolutions. The downsampled image " + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\hat{X}" + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "content": " is then processed by the Extractor to create image contexts. The Extractor is made up of five layers of CNN, which is sufficient to provide image context for bilateral grids and 3D LUTs [38,44-46]. The details are depicted in Tab. 2 where " + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "content": " is a hyper-parameter related to the Extractor width. Each convolution layer consists of 2 strided " + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 131, + 558, + 482, + 666 + ], + "type": "text", + "content": " convolution, LeakyReLU, and instance normalization (except layer 5). The image context is produced by the" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 202, + 288, + 316 + ], + "blocks": [ + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "lines": [ + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "spans": [ + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "type": "text", + "content": "Table 2: Details of the Extractor. Conv, " + }, + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "type": "inline_equation", + "content": "LR" + }, + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "type": "inline_equation", + "content": "IN" + }, + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "type": "text", + "content": " represent " + }, + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 132, + 137, + 291, + 193 + ], + "type": "text", + "content": " convolution block (stride=2, padding=1), LeakyReLU, and instance normalization, respectively." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 202, + 288, + 316 + ], + "lines": [ + { + "bbox": [ + 136, + 202, + 288, + 316 + ], + "spans": [ + { + "bbox": [ + 136, + 202, + 288, + 316 + ], + "type": "table", + "html": "
LayerOutput Shape
Bilinear Downsample3 × 256 × 256
Conv + LR + INm × 128 × 128
Conv + LR + IN2m × 64 × 64
Conv + LR + IN4m × 32 × 32
Conv + LR + IN8m × 16 × 16
Conv + LR8m × 8 × 8
Droupout (0.5)8m × 8 × 8
Average Pooling8m × 2 × 2
Reshape32m
", + "image_path": "5a21e120c85075d6f9b47a0cec96e5122fabd58f8f46b0b54b34a2fa819c9dc3.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 335, + 190, + 468, + 225 + ], + "blocks": [ + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "lines": [ + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "spans": [ + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "text", + "content": "Table 3: Details of the GridGen, where " + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "inline_equation", + "content": "FC" + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "text", + "content": " is the fully connected layer. " + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "inline_equation", + "content": "M_b" + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "inline_equation", + "content": "N_{s_b}" + }, + { + "bbox": [ + 325, + 114, + 478, + 181 + ], + "type": "text", + "content": " are hyperparameters for the number of hidden layers, bilateral grids, and bilateral grid vertices, respectively." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 335, + 190, + 468, + 225 + ], + "lines": [ + { + "bbox": [ + 335, + 190, + 468, + 225 + ], + "spans": [ + { + "bbox": [ + 335, + 190, + 468, + 225 + ], + "type": "table", + "html": "
LayerOutput Shape
FC (hb0)Mb
FC (hb1)K·Nsb
", + "image_path": "575de839660e2e3051aed864f2ee299fc1092504430aebdb5e2dc041aee6bf41.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + }, + { + "bbox": [ + 339, + 226, + 466, + 237 + ], + "lines": [ + { + "bbox": [ + 339, + 226, + 466, + 237 + ], + "spans": [ + { + "bbox": [ + 339, + 226, + 466, + 237 + ], + "type": "text", + "content": "Reshape " + }, + { + "bbox": [ + 339, + 226, + 466, + 237 + ], + "type": "inline_equation", + "content": "K\\times N_{s_b}\\times N_{s_b}\\times N_{s_b}" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_footnote" + }, + { + "bbox": [ + 326, + 238, + 477, + 281 + ], + "lines": [ + { + "bbox": [ + 326, + 238, + 477, + 281 + ], + "spans": [ + { + "bbox": [ + 326, + 238, + 477, + 281 + ], + "type": "text", + "content": "Table 4: Details of the LUTGen. " + }, + { + "bbox": [ + 326, + 238, + 477, + 281 + ], + "type": "inline_equation", + "content": "M_{t}" + }, + { + "bbox": [ + 326, + 238, + 477, + 281 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 326, + 238, + 477, + 281 + ], + "type": "inline_equation", + "content": "N_{s_t}" + }, + { + "bbox": [ + 326, + 238, + 477, + 281 + ], + "type": "text", + "content": " are hyper-parameters for the number of hidden layers and 3D LUT vertices, respectively." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_footnote" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 338, + 292, + 465, + 338 + ], + "blocks": [ + { + "bbox": [ + 338, + 292, + 465, + 338 + ], + "lines": [ + { + "bbox": [ + 338, + 292, + 465, + 338 + ], + "spans": [ + { + "bbox": [ + 338, + 292, + 465, + 338 + ], + "type": "table", + "html": "
LayerOutput Shape
FC (ht0)Mt
FC (ht1)3Nst3
Reshape3 × Nst × Nst × Nst
", + "image_path": "d3bdd35543b940cfb4869f7b4bc77515b1bf0693f3633e1688845a9980bbe6c0.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 364, + 480, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 480, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 480, + 399 + ], + "type": "text", + "content": "average pooling layer and reshaped as a vector. This context will be fed to the GridGen and LUTGen module. The complete image context extraction can be expressed as" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 284, + 401, + 480, + 416 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 284, + 401, + 480, + 416 + ], + "spans": [ + { + "bbox": [ + 284, + 401, + 480, + 416 + ], + "type": "interline_equation", + "content": "\\rho = f (\\hat {X}) \\tag {3}", + "image_path": "a8cc4d904a0b6b75f141ddf3d08c37d8f74f316879a3dbc2fead6ce39aeb4b84.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 423, + 479, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 479, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 479, + 448 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 423, + 479, + 448 + ], + "type": "inline_equation", + "content": "\\rho \\in \\mathbb{R}^{32m}" + }, + { + "bbox": [ + 130, + 423, + 479, + 448 + ], + "type": "text", + "content": " is image context vector predicted by image context extraction process " + }, + { + "bbox": [ + 130, + 423, + 479, + 448 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 423, + 479, + 448 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 471, + 364, + 483 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 471, + 364, + 483 + ], + "spans": [ + { + "bbox": [ + 131, + 471, + 364, + 483 + ], + "type": "text", + "content": "3.3 Spatial Feature Fusion by Bilateral Grid" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 496, + 480, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 496, + 480, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 496, + 480, + 520 + ], + "type": "text", + "content": "In this section, we describe the processes to provide spatial features, which are bilateral grid generation, slicing, and fusion." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "text", + "content": "Bilateral Grids Generation The GridGen module transforms image context vector into bilateral grids " + }, + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "inline_equation", + "content": "B \\in \\mathbb{R}^{K \\times N_{s_b} \\times N_{s_b} \\times N_{s_b}}" + }, + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "text", + "content": " is the number of bilateral grids and " + }, + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "inline_equation", + "content": "N_{s_b}" + }, + { + "bbox": [ + 130, + 544, + 482, + 639 + ], + "type": "text", + "content": " is the number of vertices along each dimension. In our model, the two axes of bilateral grids represent sampling points of spatial coordinates, and the other one represents the color coefficient for each channel of the image. The bilateral grids are generated by 2 FC layers with the insight of rank factorization which can reduce the parameter and training difficulty [44, 45]. The detailed architecture is shown in Tab. 3 and described as" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 167, + 649, + 481, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 649, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 167, + 649, + 481, + 667 + ], + "type": "interline_equation", + "content": "B = H _ {b} (\\rho) = h _ {b _ {1}} \\left(h _ {b _ {0}} (\\rho)\\right): \\mathbb {R} ^ {3 2 m} \\xrightarrow {h _ {b _ {0}}} \\mathbb {R} ^ {M _ {b}} \\xrightarrow {h _ {b _ {1}}} \\mathbb {R} ^ {K \\times N _ {s _ {b}} \\times N _ {s _ {b}} \\times N _ {s _ {b}}} \\tag {4}", + "image_path": "252f9d7af5aee772e3d632fcee6caff4f48dcbabba953c5b7626d88028b306ed.jpg" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": "Slicing The slicing performs interpolation on a bilateral grid with a query point retrieved from a guidance map " + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "inline_equation", + "content": "g \\in \\mathbb{R}^{H \\times W}" + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": " [7]. Specifically, the query point can be defined as " + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "inline_equation", + "content": "P_{b}(x,y) = (x / (W - 1),y / (H - 1),g(x,y))" + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": " is spatial coordinates. Some of practices [11,51] use a guidance map generated by CNN or matrix transform. However, we use each channel of the input image as a guidance map after considering performance and inference time. Detailed ablation studies for the guidance map are provided in Sec. 4.3. The slicing reconstructs spatial features " + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "inline_equation", + "content": "\\varPhi=\\{\\phi_c|0\\leq c< K\\}" + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": " from bilateral grids. When we denote a query point and a bilateral grid on channel " + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": " as " + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "inline_equation", + "content": "P_{b}^{c}(x,y)" + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "inline_equation", + "content": "B_{c}" + }, + { + "bbox": [ + 130, + 116, + 479, + 233 + ], + "type": "text", + "content": ", the slicing operation can be described as" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 201, + 243, + 480, + 258 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 201, + 243, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 201, + 243, + 480, + 258 + ], + "type": "interline_equation", + "content": "\\phi_ {c} (x, y) = I \\left(P _ {b} ^ {c ^ {\\prime}} (x, y), B _ {c}\\right), \\quad c \\in \\{0, 1, \\dots , K - 1 \\} \\tag {5}", + "image_path": "d7ed92c5b10a1cfaa5431b644961d334b07fe063fdfbb3dcd533d4d7858cadbc.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "spans": [ + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "inline_equation", + "content": "I(\\cdot)" + }, + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "text", + "content": " is one of interpolation operations depicted in Sec. 3.1, " + }, + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "inline_equation", + "content": "c' = mod(c,3)" + }, + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "inline_equation", + "content": "mod(\\cdot)" + }, + { + "bbox": [ + 131, + 265, + 479, + 289 + ], + "type": "text", + "content": " is modulo operator." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 306, + 479, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 306, + 479, + 342 + ], + "spans": [ + { + "bbox": [ + 131, + 306, + 479, + 342 + ], + "type": "text", + "content": "Spatial Feature Fusion This module combines the input image with spatial features " + }, + { + "bbox": [ + 131, + 306, + 479, + 342 + ], + "type": "inline_equation", + "content": "\\varPhi=\\{\\phi_0,\\phi_1,\\dots,\\phi_{K-1}\\}" + }, + { + "bbox": [ + 131, + 306, + 479, + 342 + ], + "type": "text", + "content": ". The " + }, + { + "bbox": [ + 131, + 306, + 479, + 342 + ], + "type": "inline_equation", + "content": "1\\times 1" + }, + { + "bbox": [ + 131, + 306, + 479, + 342 + ], + "type": "text", + "content": " convolution layer will optimally blend the input image and spatial features with learned parameters as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 144, + 350, + 480, + 364 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 350, + 480, + 364 + ], + "spans": [ + { + "bbox": [ + 144, + 350, + 480, + 364 + ], + "type": "interline_equation", + "content": "\\hat {\\varPhi} = \\left\\{\\hat {\\phi} _ {0}, \\hat {\\phi} _ {1}, \\hat {\\phi} _ {2} \\right\\} = \\operatorname {C o n v} _ {1 \\times 1} \\left(\\operatorname {C o n c a t} (\\varPhi , X)\\right): \\mathbb {R} ^ {(K + 3) \\times H \\times W} \\rightarrow \\mathbb {R} ^ {3 \\times H \\times W} \\tag {6}", + "image_path": "324ce3e9566478fec1f2d02c56cf13d28b0db2beba2d30fd377710145fe80c28.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 371, + 479, + 465 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 371, + 479, + 465 + ], + "spans": [ + { + "bbox": [ + 130, + 371, + 479, + 465 + ], + "type": "text", + "content": "Compared to HDRNet [11], the absence of additional local features on bilateral grids generation step may make bilateral grids smooth. However, our method involves learning multiple bilateral grids to produce spatial-aware features. Specifically, our model produces distinct spatial-aware features from multiple bilateral grids as illustrated in this section and Fig. 5, thereby providing spatial information. Furthermore, additional local features do not improve performance in our method with PSNR of " + }, + { + "bbox": [ + 130, + 371, + 479, + 465 + ], + "type": "inline_equation", + "content": "25.30\\mathrm{dB}" + }, + { + "bbox": [ + 130, + 371, + 479, + 465 + ], + "type": "text", + "content": " on FiveK [4] photo retouch task." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 484, + 367, + 496 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 484, + 367, + 496 + ], + "spans": [ + { + "bbox": [ + 131, + 484, + 367, + 496 + ], + "type": "text", + "content": "3.4 Color Enhancement by 3D Lookup Table" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 503, + 479, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 503, + 479, + 539 + ], + "spans": [ + { + "bbox": [ + 131, + 503, + 479, + 539 + ], + "type": "text", + "content": "3D Lookup Tables Generation The LUTGen has similar structure of GridGen, which generates 3D LUTs " + }, + { + "bbox": [ + 131, + 503, + 479, + 539 + ], + "type": "inline_equation", + "content": "T \\in \\mathbb{R}^{3 \\times N_{s_t} \\times N_{s_t} \\times N_{s_t}}" + }, + { + "bbox": [ + 131, + 503, + 479, + 539 + ], + "type": "text", + "content": " from input image context. The detailed structure of LUTGen is depicted in Tab. 4." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 172, + 548, + 480, + 566 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 172, + 548, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 172, + 548, + 480, + 566 + ], + "type": "interline_equation", + "content": "T = H _ {t} (\\rho) = h _ {t _ {1}} \\left(h _ {t _ {0}} (\\rho)\\right): \\mathbb {R} ^ {3 2 m} \\xrightarrow {h _ {t _ {0}}} \\mathbb {R} ^ {M _ {t}} \\xrightarrow {h _ {t _ {1}}} \\mathbb {R} ^ {3 \\times N _ {s _ {t}} \\times N _ {s _ {t}} \\times N _ {s _ {t}}} \\tag {7}", + "image_path": "06351844df6f8442b5d4b083c27b090076e5a68e317c48f563f3102d9ae07727.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "text", + "content": "Color Enhancement After spatial information fusion, pixel-to-pixel color enhancement is carried out through the 3D LUT transforms. Each axis of 3D LUT represents each channel value. In this context, a query point can be defined as " + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "inline_equation", + "content": "P_{t}(x,y) = (\\hat{\\phi}_{0}(x,y),\\hat{\\phi}_{1}(x,y),\\hat{\\phi}_{2}(x,y))" + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "inline_equation", + "content": "\\hat{\\phi}_c(x,y)" + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "text", + "content": " is the channel value of combined image at " + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "text", + "content": " on channel " + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 581, + 479, + 651 + ], + "type": "text", + "content": ". The 3D LUT interpolation can be formulated as" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 222, + 653, + 480, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 222, + 653, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 222, + 653, + 480, + 666 + ], + "type": "interline_equation", + "content": "\\hat {Y} _ {c} (x, y) = I \\left(P _ {t} (x, y), T _ {c}\\right), \\quad c \\in \\{0, 1, 2 \\} \\tag {8}", + "image_path": "837087e06b2ee0c12b20f2d976bbe68ad5ef94393e79eaed2d373c10df7e660b.jpg" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 230, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 230, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 230, + 127 + ], + "type": "text", + "content": "3.5 Loss Function" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": "We optimize the proposed method by minimizing " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " adopted from [38], which is composed of base loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_b" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " [46], color difference loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_c" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": ", and perceptual loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_p" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " [48]. The base loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_b" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " [46] is divided into MSE loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_r" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " that ensures content fidelity and regularization losses constraining the values in the LUT, including smoothness loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_s" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " and monotonicity loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_m" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": ". The color difference loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_c" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " is the color difference on the CIE94 LAB space. The perceptual loss " + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_p" + }, + { + "bbox": [ + 130, + 135, + 482, + 242 + ], + "type": "text", + "content": " [48] is the LPIPS loss to improve the perceptual quality, which is the difference between ground truth and output image features on a pre-trained AlexNet [26]. The loss can be written as" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 238, + 243, + 481, + 258 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 243, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 238, + 243, + 481, + 258 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {b} + 0. 0 0 5 * \\mathcal {L} _ {c} + 0. 0 5 * \\mathcal {L} _ {p} \\tag {9}", + "image_path": "46e1f8b30a44519035271265af9ae73a5db77b88212e433bb5b26f3cb87b2803.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 274, + 230, + 287 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 230, + 287 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 230, + 287 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 298, + 205, + 309 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 298, + 205, + 309 + ], + "spans": [ + { + "bbox": [ + 132, + 298, + 205, + 309 + ], + "type": "text", + "content": "4.1 Datasets" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 317, + 482, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 317, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 317, + 482, + 449 + ], + "type": "text", + "content": "We use FiveK [4] and PPR10K [28] datasets to train and evaluate the proposed network. The FiveK dataset contains 5,000 RAW images and five ground truths retouched by experts (A/B/C/D/E). We select the expert C as ground truth for comparison with previous LUT methods [38, 44-46]. We also split the data into 4,500 pairs for training set and 500 for testing set, as provided in [46]. The 480p version images [46] are used in the training stage to speed up, and both 480p and 4K images are used in the testing stage. The PPR10K dataset contains 11,161 RAW portrait photos with three ground truths by three experts (a/b/c). We divide the dataset into 8,875 image pairs for the training stage and 2,286 pairs for the test stage with the official split [28]. Experiments are separately conducted for each ground truth on the 360p version of the dataset." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": "We perform experiments for two types of tasks: photo retouch and tone mapping in camera pipeline. Both tasks have the 8-bit sRGB images as ground truth but have different input formats, which are sRGB format (8-bit on FiveK and 16-bit on PPR10K) in the photo retouch task, and 16-bit CIE XYZ format in the tone mapping task. The photo retouch task is conducted on both dataset, but the tone mapping task is conducted only on FiveK dataset." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 538, + 264, + 551 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 538, + 264, + 551 + ], + "spans": [ + { + "bbox": [ + 132, + 538, + 264, + 551 + ], + "type": "text", + "content": "4.2 Application Settings" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": "The proposed network is trained end-to-end manner. The detail of each module is denoted in Tabs. 2 to 4 and Fig. 1. In comparison on PPR10K [28], pretrained ResNet-18 [15] is used as the Extractor instead of Tab. 2 and the hidden layer of GenLUT " + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "inline_equation", + "content": "(M_t)" + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": " is increased by a factor of 2 for fair comparison with previous work [28,44,45]. Our models are trained for 400 epochs with the standard Adam optimizer [25] and a learning rate of " + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "inline_equation", + "content": "1 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": ". The learning rate decayed by 0.1 factor every 100 epochs. The minibatch size is 1 and 16 for FiveK and PPR10K, respectively. We implement our method on the PyTorch framework. Especially, the interpolation operation on both slicing and 3D LUT transform is" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 115, + 244, + 167 + ], + "blocks": [ + { + "bbox": [ + 135, + 115, + 244, + 167 + ], + "lines": [ + { + "bbox": [ + 135, + 115, + 244, + 167 + ], + "spans": [ + { + "bbox": [ + 135, + 115, + 244, + 167 + ], + "type": "image", + "image_path": "f893d25b16cbfa5e3e8762e3363ff11cee6834e4b2f388fcb121999b4cbb66f9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 253, + 115, + 362, + 168 + ], + "blocks": [ + { + "bbox": [ + 253, + 115, + 362, + 168 + ], + "lines": [ + { + "bbox": [ + 253, + 115, + 362, + 168 + ], + "spans": [ + { + "bbox": [ + 253, + 115, + 362, + 168 + ], + "type": "image", + "image_path": "0570abde7f9bc65f35afbdea752d5c5e3735d09a2bd5a577bd278f691f3db932.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 371, + 115, + 479, + 168 + ], + "blocks": [ + { + "bbox": [ + 371, + 115, + 479, + 168 + ], + "lines": [ + { + "bbox": [ + 371, + 115, + 479, + 168 + ], + "spans": [ + { + "bbox": [ + 371, + 115, + 479, + 168 + ], + "type": "image", + "image_path": "c4108908cad230e2ef3d0f3fb4c1ce204d33c59208e23fde577ef2342e9f82f9.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 386, + 171, + 463, + 182 + ], + "lines": [ + { + "bbox": [ + 386, + 171, + 463, + 182 + ], + "spans": [ + { + "bbox": [ + 386, + 171, + 463, + 182 + ], + "type": "text", + "content": "(c) Bilaterl grids " + }, + { + "bbox": [ + 386, + 171, + 463, + 182 + ], + "type": "inline_equation", + "content": "(K)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 135, + 183, + 244, + 236 + ], + "blocks": [ + { + "bbox": [ + 133, + 171, + 245, + 182 + ], + "lines": [ + { + "bbox": [ + 133, + 171, + 245, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 171, + 245, + 182 + ], + "type": "text", + "content": "(a) LUTGen hidden layer " + }, + { + "bbox": [ + 133, + 171, + 245, + 182 + ], + "type": "inline_equation", + "content": "(M_{t})" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 135, + 183, + 244, + 236 + ], + "lines": [ + { + "bbox": [ + 135, + 183, + 244, + 236 + ], + "spans": [ + { + "bbox": [ + 135, + 183, + 244, + 236 + ], + "type": "image", + "image_path": "88c15d5703af9b53cab196c827ce3dc77efa090d06be3955da5f0c37a851e430.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 145, + 239, + 233, + 250 + ], + "lines": [ + { + "bbox": [ + 145, + 239, + 233, + 250 + ], + "spans": [ + { + "bbox": [ + 145, + 239, + 233, + 250 + ], + "type": "text", + "content": "(d) Extractor width " + }, + { + "bbox": [ + 145, + 239, + 233, + 250 + ], + "type": "inline_equation", + "content": "(m)" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 258, + 480, + 301 + ], + "lines": [ + { + "bbox": [ + 130, + 258, + 480, + 301 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 480, + 301 + ], + "type": "text", + "content": "Fig. 3: Ablation studies on different numbers of LUTGen hidden layers (a), GridGen hidden layer (b), bilateral grids (c), Extractor width (d), Bilateral grid vertices (e), and LUT vertices (f). " + }, + { + "bbox": [ + 130, + 258, + 480, + 301 + ], + "type": "inline_equation", + "content": "M_{b} = 0" + }, + { + "bbox": [ + 130, + 258, + 480, + 301 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 258, + 480, + 301 + ], + "type": "inline_equation", + "content": "M_{t} = 0" + }, + { + "bbox": [ + 130, + 258, + 480, + 301 + ], + "type": "text", + "content": " indicate bypassing the spatial feature fusion step and the color enhancement step, respectively." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 256, + 183, + 365, + 236 + ], + "blocks": [ + { + "bbox": [ + 251, + 171, + 363, + 182 + ], + "lines": [ + { + "bbox": [ + 251, + 171, + 363, + 182 + ], + "spans": [ + { + "bbox": [ + 251, + 171, + 363, + 182 + ], + "type": "text", + "content": "(b) GridGen hidden layer " + }, + { + "bbox": [ + 251, + 171, + 363, + 182 + ], + "type": "inline_equation", + "content": "(M_b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 256, + 183, + 365, + 236 + ], + "lines": [ + { + "bbox": [ + 256, + 183, + 365, + 236 + ], + "spans": [ + { + "bbox": [ + 256, + 183, + 365, + 236 + ], + "type": "image", + "image_path": "85f19f9e82df6f1c75cab6f343c31f032262d6d60a388e19dd715c93bb3d1780.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 255, + 239, + 365, + 251 + ], + "lines": [ + { + "bbox": [ + 255, + 239, + 365, + 251 + ], + "spans": [ + { + "bbox": [ + 255, + 239, + 365, + 251 + ], + "type": "text", + "content": "(e) Bilateral grid vertices " + }, + { + "bbox": [ + 255, + 239, + 365, + 251 + ], + "type": "inline_equation", + "content": "(N_{s_b})" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 377, + 186, + 479, + 236 + ], + "blocks": [ + { + "bbox": [ + 377, + 186, + 479, + 236 + ], + "lines": [ + { + "bbox": [ + 377, + 186, + 479, + 236 + ], + "spans": [ + { + "bbox": [ + 377, + 186, + 479, + 236 + ], + "type": "image", + "image_path": "ce43bb92b51da0f864e7380a9c4d4dc4bc79c769d331b16313d13f455d7fbba5.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 387, + 239, + 469, + 250 + ], + "lines": [ + { + "bbox": [ + 387, + 239, + 469, + 250 + ], + "spans": [ + { + "bbox": [ + 387, + 239, + 469, + 250 + ], + "type": "text", + "content": "(f) LUT vertices " + }, + { + "bbox": [ + 387, + 239, + 469, + 250 + ], + "type": "inline_equation", + "content": "(N_{s_t})" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 325, + 479, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 479, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 479, + 348 + ], + "type": "text", + "content": "implemented using CUDA extension to speed up. All experiments are conducted on an NVIDIA Tesla V100 GPU." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 366, + 245, + 377 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 366, + 245, + 377 + ], + "spans": [ + { + "bbox": [ + 132, + 366, + 245, + 377 + ], + "type": "text", + "content": "4.3 Ablation Studies" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "spans": [ + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "content": "To verify the selection of hyper-parameters for our model and the interpolation method for slicing and 3D LUT transform, we perform ablation studies on photo retouch tasks with the FiveK dataset (480p). Before ablation studies, We conduct a random search and achieve better performance than other models with a PSNR of 25.52 dB, when the model is composed of the Extractor (" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "inline_equation", + "content": "m = 8" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "content": "), bilateral grid modules (" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "inline_equation", + "content": "M_{b} = 24" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "inline_equation", + "content": "N_{s_{b}} = 17" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "inline_equation", + "content": "K = 3" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "content": ") with trilinear interpolation, and 3D LUT modules (" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "inline_equation", + "content": "M_{t} = 24" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "inline_equation", + "content": "N_{s_{t}} = 17" + }, + { + "bbox": [ + 130, + 385, + 482, + 481 + ], + "type": "text", + "content": ") with tetrahedral interpolation. Hence, we start our ablation studies with the above hyper-parameters." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": "Selection of LUTGen and GridGen Parameters We assess the performance according to the number of LUTGen hidden layers " + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "inline_equation", + "content": "(M_t)" + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": " with initial hyper-parameters, as can be seen in Fig. 3a. We can see our model has the best performance at " + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "inline_equation", + "content": "M_t = 24" + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": ". However, the difference between " + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "inline_equation", + "content": "M_t = 8" + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "inline_equation", + "content": "M_t = 24" + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": " in performance is only " + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "inline_equation", + "content": "0.02dB" + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": ", while the difference in parameter numbers is " + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "inline_equation", + "content": "239.9K" + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": ". Therefore, we set " + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "inline_equation", + "content": "M_t = 8" + }, + { + "bbox": [ + 130, + 498, + 482, + 569 + ], + "type": "text", + "content": " in our following experiments." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": "After selecting " + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "M_{t}" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": ", we explore the parameters of the GridGen for the number of GenLUT hidden layers (" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "M_{b}" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": ") and bilateral grids (" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": "). Although we find that " + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "M_{b} = 32" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": " is the best as in Fig. 3b, we choose the " + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "M_{b} = 8" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": " for the same reason of selecting " + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "M_{t}" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": " (" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "0.01dB \\uparrow / 359.9K \\uparrow" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": "). Fig. 3c shows the performance with the change in the number of bilateral grids (" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": "). We select " + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "inline_equation", + "content": "K = 6" + }, + { + "bbox": [ + 130, + 570, + 482, + 640 + ], + "type": "text", + "content": " because it shows a significant improvement in performance." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "The increases in the three parameters (" + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "inline_equation", + "content": "M_{t}" + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "inline_equation", + "content": "M_{b}" + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": ") generally leads to performance improvement. However, we can observe a decrease in performance" + } + ] + } + ], + "index": 20 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 186, + 291, + 278 + ], + "blocks": [ + { + "bbox": [ + 132, + 144, + 291, + 177 + ], + "lines": [ + { + "bbox": [ + 132, + 144, + 291, + 177 + ], + "spans": [ + { + "bbox": [ + 132, + 144, + 291, + 177 + ], + "type": "text", + "content": "Table 5: Ablation studies on losses, interpolation methods, and guidance map generation." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 186, + 291, + 278 + ], + "lines": [ + { + "bbox": [ + 132, + 186, + 291, + 278 + ], + "spans": [ + { + "bbox": [ + 132, + 186, + 291, + 278 + ], + "type": "table", + "html": "
\\( {\\mathcal{L}}_{b} \\)\\( {\\mathcal{L}}_{c} \\)\\( {\\mathcal{L}}_{p} \\)Guidance map GenLUT InterpolationGrid InterpolationPSNR
oxxxTetraTri25.35
ooxxTetraTri25.21
oxoxTetraTri25.49
oooxTetraTetra25.50
oooxTriTetra25.49
oooxTriTri25.57
ooo1 × 1TetraTri23.42
ooo3 × 3TetraTri22.45
oooxTetraTri25.66
", + "image_path": "e61cece457cf4608aa7e4b9523f774941e380f55067e5cfda1134f8e611a6534.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 304, + 117, + 455, + 228 + ], + "blocks": [ + { + "bbox": [ + 304, + 117, + 455, + 228 + ], + "lines": [ + { + "bbox": [ + 304, + 117, + 455, + 228 + ], + "spans": [ + { + "bbox": [ + 304, + 117, + 455, + 228 + ], + "type": "image", + "image_path": "297bc2aa5c36148f2099dd8138654c89d6588b9fa465f36c08813f64b54c7ab5.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "lines": [ + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "spans": [ + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "type": "text", + "content": "Fig.4: Trade-off between performance and model size on FiveK dataset [4]. Ours " + }, + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "type": "inline_equation", + "content": "(N_{s_b},N_{s_t})" + }, + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "type": "text", + "content": " indicates the proposed model which has " + }, + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "type": "inline_equation", + "content": "N_{s_b}" + }, + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "type": "text", + "content": " bilateral vertices and " + }, + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "type": "inline_equation", + "content": "N_{s_t}" + }, + { + "bbox": [ + 299, + 231, + 460, + 297 + ], + "type": "text", + "content": " LUT vertices. The circle size is proportional to the model size." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 333, + 482, + 381 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 333, + 482, + 381 + ], + "spans": [ + { + "bbox": [ + 130, + 333, + 482, + 381 + ], + "type": "text", + "content": "when parameters become too large. It seems that too complex network does not help to generate bilateral grids and 3D LUTs. The bilateral grid-only model " + }, + { + "bbox": [ + 130, + 333, + 482, + 381 + ], + "type": "inline_equation", + "content": "(M_{t} = 0)" + }, + { + "bbox": [ + 130, + 333, + 482, + 381 + ], + "type": "text", + "content": " and LUT-only model " + }, + { + "bbox": [ + 130, + 333, + 482, + 381 + ], + "type": "inline_equation", + "content": "(M_{b} = 0)" + }, + { + "bbox": [ + 130, + 333, + 482, + 381 + ], + "type": "text", + "content": " have relatively poor performance. These results show that each module contributes to performance improvement." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "text", + "content": "Capacity of the Extractor We observe performance changes based on the difference in Extractor width " + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "inline_equation", + "content": "(m)" + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "text", + "content": " to find structure which can generate optimal LUTs and bilateral grids. For more meticulous experiments, we make the variation on the number of LUT vertices " + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "inline_equation", + "content": "(N_{s_t})" + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "text", + "content": " and bilateral grid vertices " + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "inline_equation", + "content": "(N_{s_b})" + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "text", + "content": ". As shown in Fig. 3d, the best performance is achieved at " + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "inline_equation", + "content": "m = 8" + }, + { + "bbox": [ + 130, + 403, + 482, + 477 + ], + "type": "text", + "content": " in all of the experiments." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "text", + "content": "The Number of LUT Vertices and Bilateral Grid Vertices As can be seen in previous 3D LUT studies [28, 29, 38, 44-47], the number of vertices is an important factor in performance. Fig. 3e shows performance as different number of bilateral grid vertices. We can easily find that the optimal number of bilateral grid vertices is " + }, + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "inline_equation", + "content": "N_{s_b} = 17" + }, + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "text", + "content": ". Ablation study for the number of LUT vertices can be seen in Fig. 3f. Although " + }, + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "inline_equation", + "content": "N_{s_t} = 33" + }, + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "text", + "content": " has best performance, we select " + }, + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "inline_equation", + "content": "N_{s_t} = 17" + }, + { + "bbox": [ + 130, + 498, + 482, + 606 + ], + "type": "text", + "content": " after considering the trade-off in Fig. 4. The selected model is ours(17,17) in Fig. 4 and has a smaller size than other 3D LUT models [38, 44, 46] except [45] with better performance." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "Loss Function The first section of Tab. 5 shows performance differences regarding the loss. The combination of the three metrics shows the best performance, with the perceptual loss contributing the most to the performance improvement." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 304, + 241 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 304, + 241 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 304, + 241 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 304, + 241 + ], + "type": "image", + "image_path": "f7040f53f6035b344de7460bd1d04c1f9d88a268d340370437ef56ff4371ef9c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 212, + 242, + 225, + 251 + ], + "lines": [ + { + "bbox": [ + 212, + 242, + 225, + 251 + ], + "spans": [ + { + "bbox": [ + 212, + 242, + 225, + 251 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 310, + 114, + 481, + 241 + ], + "blocks": [ + { + "bbox": [ + 310, + 114, + 481, + 241 + ], + "lines": [ + { + "bbox": [ + 310, + 114, + 481, + 241 + ], + "spans": [ + { + "bbox": [ + 310, + 114, + 481, + 241 + ], + "type": "image", + "image_path": "b46f2912bf4faf91aadb524c4f6a58c8969126568194b7ee6955f6fce4c5e182.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 389, + 242, + 401, + 251 + ], + "lines": [ + { + "bbox": [ + 389, + 242, + 401, + 251 + ], + "spans": [ + { + "bbox": [ + 389, + 242, + 401, + 251 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 260, + 480, + 315 + ], + "lines": [ + { + "bbox": [ + 130, + 260, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 130, + 260, + 480, + 315 + ], + "type": "text", + "content": "Fig. 5: Visual result of the feature maps. The pictures in the first column are input, combined image, and output, respectively. The error map on upper left of combined image indicates differences with input image. The other six are visualizations for each channel. The pixels closer to red indicate more activated and the pixels closer to blue indicate less activated." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 339, + 480, + 423 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 339, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 130, + 339, + 480, + 423 + ], + "type": "text", + "content": "Interpolation Method We demonstrate the ablation study of interpolation methods on the second section of Tab. 5. Since trilinear interpolation can utilize all eight adjacent sampling points, it might have the advantage of reflecting surrounding information in the slicing operation. On the other hand, tetrahedral interpolation appears to enable more accurate reconstruction in 3D LUT transform. Hence, we do not change the setting on interpolation methods. The difference in inference time between interpolation methods is negligible." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "text", + "content": "Guidance Map Generator Previous studies about bilateral grids [11,51] usually have generated guidance maps instead of directly using an input image. We conduct an ablation study with two versions of guidance map generators based on HDRNet [11] GitHub4, which is composed of " + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "inline_equation", + "content": "1 \\times 1" + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "text", + "content": " convolution layers or " + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "text", + "content": " convolution layers. The third section of Tab. 5 shows that the model with guidance map generators has relatively poor performance. It is believed that the guidance map generators make the network too complex and increase the learning difficulty. Furthermore, the guidance map generator brings exponential increase in inference time, 21.6ms and 46.7ms for the " + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "inline_equation", + "content": "1 \\times 1" + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 441, + 482, + 562 + ], + "type": "text", + "content": " generators, respectively. Hence, we decide to directly use input image as a guidance map." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 578, + 296, + 590 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 296, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 296, + 590 + ], + "type": "text", + "content": "4.4 Analysis of Spatial Feature" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 598, + 480, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 598, + 480, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 598, + 480, + 647 + ], + "type": "text", + "content": "In this section, we provide the analysis of the spatial features by visualizations. Following [38], we do not apply any loss on the spatial features. The spatial features flexibly categorize an image depending on the context of the input image. The examples of spatial features can be seen in Fig. 5. The spatial feature" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 100 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 652, + 348, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 348, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 348, + 666 + ], + "type": "text", + "content": "4 https://github.com/gejinchen/DDRnet-PyTorch" + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 168, + 478, + 304 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": "Table 6: Quantitative comparison results of photo retouch on the FiveK dataset [4]. “-” means the result is not available due to insufficient GPU memory. “*” indicates that the results are obtained from their paper and “/” are absent results due to publicly unavailable code. The best and second-best results are in red and blue, respectively." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 168, + 478, + 304 + ], + "lines": [ + { + "bbox": [ + 136, + 168, + 478, + 304 + ], + "spans": [ + { + "bbox": [ + 136, + 168, + 478, + 304 + ], + "type": "table", + "html": "
Method#param480pFull Resolution (4K)
PSNRSSIMΔEabRuntimePSNRSSIMΔEabRuntime
UPE [37]927.1K21.880.85310.804.2721.650.85911.0956.88
DPE [9]3.4M23.750.9089.347.21----
HDRNet [11]483.1K24.660.9158.063.4924.520.9218.2056.07
DeepLPF [31]1.7M24.730.9167.9932.12----
CSRNet [14]36.4K25.190.9257.763.0924.820.9247.9477.10
3D LUT [46]593.5K25.290.9237.551.1725.250.9327.591.49
SA-3DLUT* [38]4.5M25.50//2.27///4.39
SepLUT* [45]119.8K25.470.9217.541.1025.430.9327.561.20
AdaInt [44]619.7K25.490.9267.471.2925.480.9347.451.59
Ours463.7K25.660.9307.291.2025.660.9377.273.64
", + "image_path": "cb049ccbab9d83f95f659ee6cf989e2a2578d0f377a6a2dc69dc1a992c2dfd07.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 350, + 264, + 457 + ], + "blocks": [ + { + "bbox": [ + 132, + 307, + 263, + 340 + ], + "lines": [ + { + "bbox": [ + 132, + 307, + 263, + 340 + ], + "spans": [ + { + "bbox": [ + 132, + 307, + 263, + 340 + ], + "type": "text", + "content": "Table 7: Quantitative comparisons on the FiveK dataset [4] for tone mapping." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 350, + 264, + 457 + ], + "lines": [ + { + "bbox": [ + 133, + 350, + 264, + 457 + ], + "spans": [ + { + "bbox": [ + 133, + 350, + 264, + 457 + ], + "type": "table", + "html": "
Method480p
PSNRSSIMΔEab
UPE [37]21.560.83712.29
DPE [9]22.930.89411.09
HDRNet [11]24.520.9158.14
CSRNet [14]25.190.9217.63
3DLUT [46]25.070.9207.55
SepLUT* [45]25.430.9227.43
AdaInt [44]25.280.9257.48
Ours25.590.9327.14
", + "image_path": "34b4d72b4d5ffb8907c2d7c9a7c729e8fef71f671a90f788e887c190dce28967.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 273, + 335, + 473, + 460 + ], + "blocks": [ + { + "bbox": [ + 272, + 304, + 473, + 326 + ], + "lines": [ + { + "bbox": [ + 272, + 304, + 473, + 326 + ], + "spans": [ + { + "bbox": [ + 272, + 304, + 473, + 326 + ], + "type": "text", + "content": "Table 8: Quantitative comparisons on the PPR10K dataset [28] for photo retouch." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 273, + 335, + 473, + 460 + ], + "lines": [ + { + "bbox": [ + 273, + 335, + 473, + 460 + ], + "spans": [ + { + "bbox": [ + 273, + 335, + 473, + 460 + ], + "type": "table", + "html": "
DatasetMethodPSNRΔEabPSRHCΔEa
PPR10K-a3DLUT [46]25.646.9728.894.53
SepLUT* [45]26.286.59//
AdaInt [44]26.336.5629.574.26
Ours26.456.5129.704.23
PPR10K-b3DLUT [46]24.707.7127.994.99
SepLUT* [45]25.237.49//
AdaInt [44]25.407.3328.654.75
Ours25.487.1928.724.66
PPR10K-c3DLUT [46]25.187.5828.494.92
SepLUT* [45]25.597.51//
AdaInt [44]25.687.3128.934.76
Ours25.727.2829.004.72
", + "image_path": "fd8e18599a3b5bd6b7af49c0b49e84b12942612195646ab5884d2139d1be72e3.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "inline_equation", + "content": "\\phi_{2}" + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "inline_equation", + "content": "\\phi_{5}" + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "text", + "content": " represent bright and dark areas of the image, respectively. The " + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "inline_equation", + "content": "\\phi_{1}" + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "text", + "content": " compensates for dark areas and " + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "inline_equation", + "content": "\\phi_{4}" + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "text", + "content": " covers overall area. The " + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "inline_equation", + "content": "\\phi_{0}" + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "inline_equation", + "content": "\\phi_{3}" + }, + { + "bbox": [ + 130, + 482, + 482, + 542 + ], + "type": "text", + "content": " are in charge of details of the bright area. The combined images undergoes local adjustments based on spatial features. This analysis shows that spatial feature provide pixel-wise spatial-aware weights for local enhancement." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 558, + 337, + 570 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 558, + 337, + 570 + ], + "spans": [ + { + "bbox": [ + 131, + 558, + 337, + 570 + ], + "type": "text", + "content": "4.5 Comparison with State-of-the-Arts" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 577, + 481, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 577, + 481, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 577, + 481, + 625 + ], + "type": "text", + "content": "We compare our methods with other SOTA real-time image enhancement methods. We especially focused on our experiments with other 3D LUT models [28, 38, 44-46]. However, we only provide quantitative results in the case of [38] and [45] since they do not provide publicly available code." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Quantitative Comparisons For quantitative comparisons, three metrics are used: PSNR, SSIM [39], " + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "L_{2}" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "-distance in CIE LAB color space (" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\Delta E_{ab}" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": ") on FiveK" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 113, + 482, + 287 + ], + "blocks": [ + { + "bbox": [ + 133, + 113, + 482, + 287 + ], + "lines": [ + { + "bbox": [ + 133, + 113, + 482, + 287 + ], + "spans": [ + { + "bbox": [ + 133, + 113, + 482, + 287 + ], + "type": "image", + "image_path": "1ac93f2d19030e78cddd8c9d28a6b73d0d36bf700d24d2754eb9f6e3e21ef9c1.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 295, + 482, + 340 + ], + "lines": [ + { + "bbox": [ + 130, + 295, + 482, + 340 + ], + "spans": [ + { + "bbox": [ + 130, + 295, + 482, + 340 + ], + "type": "text", + "content": "Fig. 6: Qualitative comparisons on the FiveK dataset [4] for photo retouch. The corresponding error maps on the upper right of each picture indicate differences with ground truth, where each color indicates the degree of error based on the corresponding color bars on the right." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 361, + 482, + 457 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 361, + 482, + 457 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 482, + 457 + ], + "type": "text", + "content": "dataset. We include the human-centered PSNR " + }, + { + "bbox": [ + 130, + 361, + 482, + 457 + ], + "type": "inline_equation", + "content": "(PSNR^{HC})" + }, + { + "bbox": [ + 130, + 361, + 482, + 457 + ], + "type": "text", + "content": " and color difference " + }, + { + "bbox": [ + 130, + 361, + 482, + 457 + ], + "type": "inline_equation", + "content": "(\\Delta E_{ab}^{HC})" + }, + { + "bbox": [ + 130, + 361, + 482, + 457 + ], + "type": "text", + "content": " [28] on PPR10K dataset. Tab. 6 shows comparisons on the FiveK dataset for photo retouch. The inference time is measured on the same image set, by running 100 times and averaging them. Our method outperforms other methods on both resolutions. Similar results can be seen in Tab. 7 for the tone mapping task on FiveK dataset, and in Tab. 8 for the photo retouch task on the PPR10K dataset. We also provide analysis for runtime increment on 4K resolution and standard deviations of runtime in supplementary materials." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 458, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 458, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 458, + 482, + 567 + ], + "type": "text", + "content": "Especially, the results show that we alleviate the intrinsic problems of the spatial-aware LUT method mentioned in previous work, the tremendous model size, and the long inference time. Our method has a much smaller size than SA-3DLUT [38] (about 1/10 times). This number of parameters is even smaller than AdaInt [44] and 3DLUT [46]. Furthermore, we have already shown that ours(9, 9) outperforms the SepLUT [45] with a similar model size in Fig. 4. The inference time on " + }, + { + "bbox": [ + 130, + 458, + 482, + 567 + ], + "type": "inline_equation", + "content": "480\\mathrm{p}" + }, + { + "bbox": [ + 130, + 458, + 482, + 567 + ], + "type": "text", + "content": " is smaller than SA-3DLUT [38] (about 1/2 times) and similar to other LUT methods [44-46]. Although the inference time is increased in the case of 4K resolution, it is still shorter than SA-3DLUT [38]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "text", + "content": "Qualitative Comparisons The qualitative comparisons can be seen in Fig. 6 with corresponding error maps on the upper right of each picture. Each color of the error map indicates the difference with ground truth based on the corresponding color bars on the right." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": "In the first row of Fig. 6, it can be observed that our method performs better than others in local enhancement. The 3DLUT and AdaInt of the dark area captured in the red rectangle appear somber compared to the ground truth." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "On the other hand, the CSRNet is entirely reddish. Our method enhances the image in both dark and bright areas, making it closer to the ground truth. In the second row of Fig. 6, it can be observed that our method is capable of producing vivid colors. Comparing the leaf on the blue rectangle in our method to the other methods, it can be seen that our method produces a clearer green color. Similarly, the red color at the end of the yellow leaves in the red rectangle is also improved. The last row of the figure shows that our model has improved the overall color of the image. Specifically, the color of the ground and seat in the red and blue rectangles is closer to the ground truth than the other methods." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 249, + 313, + 262 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 313, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 313, + 262 + ], + "type": "text", + "content": "5 Limitations and Discussion" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 282, + 482, + 402 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 482, + 402 + ], + "type": "text", + "content": "Although our inference time is effectively reduced compared to SA-3DLUT [38], we have observed that the inference time increases as the resolution increases. This is a common issue with spatial-aware methods. However, we believe that a processing time of 3.6ms is sufficient for real-time high-resolution video processing. However, there may be some special applications in the future that require constraints such as a resolution greater than 8K or a frame rate exceeding 200 fps. To address these challenges, we plan to investigate the correlation between image resolution and processing time and explore methods that process spatial features with a unit of patch or super-pixel [2], which could be one of the potential solutions." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 403, + 482, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 475 + ], + "type": "text", + "content": "Another future work is to apply the adaptive sampling [44] to a bilateral grid. When we apply the adaptive sampling on the 3D LUT, the performance is downgraded by " + }, + { + "bbox": [ + 130, + 403, + 482, + 475 + ], + "type": "inline_equation", + "content": "0.15\\mathrm{dB}" + }, + { + "bbox": [ + 130, + 403, + 482, + 475 + ], + "type": "text", + "content": " on PSNR. It seems that the adaptive sampling effect has already been reflected in the spatial feature fusion step. However, we believe that adaptive sampling on the bilateral grids could effectively handle adaptive local enhancement." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 501, + 220, + 514 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 220, + 514 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 220, + 514 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": "We have developed a method that utilizes bilateral grids to create a learnable spatial-aware 3D LUT for fast image enhancement. The bilateral grid is an effective way of conveying spatial information because its data structure can provide spatial features through a non-parametric slicing process. Our framework is designed to enhance local areas efficiently, resulting in improved results. We have extensively tested our method on two datasets and have demonstrated that it outperforms other state-of-the-art methods in terms of both performance and efficiency. Our model achieves state-of-the-art performance with a relatively small model size and short inference time. Additionally, we have achieved better performance by using an appropriate interpolation method for slicing and 3D LUT transform." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 210 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 210 + ], + "type": "text", + "content": "This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)] and in part by the BK21 FOUR program of the Education and Research Program for Future ICT Pioneers, Seoul National University in 2024." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 251, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "type": "text", + "content": "1. A Sharif, S., Naqvi, R.A., Biswas, M., Kim, S.: A two-stage deep network for high dynamic range image reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 550-559 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 285, + 480, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 480, + 317 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 480, + 317 + ], + "type": "text", + "content": "2. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Süsstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE transactions on pattern analysis and machine intelligence 34(11), 2274-2282 (2012)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 318, + 480, + 339 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 318, + 480, + 339 + ], + "spans": [ + { + "bbox": [ + 138, + 318, + 480, + 339 + ], + "type": "text", + "content": "3. Akyüz, A.O., et al.: Deep joint deinterlacing and denoising for single shot dual-iso hdr reconstruction. IEEE Transactions on Image Processing 29, 7511-7524 (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 339, + 480, + 372 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 339, + 480, + 372 + ], + "spans": [ + { + "bbox": [ + 138, + 339, + 480, + 372 + ], + "type": "text", + "content": "4. Bychkovsky, V., Paris, S., Chan, E., Durand, F.: Learning photographic global tonal adjustment with a database of input/output image pairs. In: CVPR 2011. pp. 97-104. IEEE (2011)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 373, + 480, + 404 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 373, + 480, + 404 + ], + "spans": [ + { + "bbox": [ + 138, + 373, + 480, + 404 + ], + "type": "text", + "content": "5. Chen, C., Chen, Q., Xu, J., Koltun, V.: Learning to see in the dark. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3291-3300 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 404, + 480, + 426 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 404, + 480, + 426 + ], + "spans": [ + { + "bbox": [ + 138, + 404, + 480, + 426 + ], + "type": "text", + "content": "6. Chen, J., Adams, A., Wadhwa, N., Hasinoff, S.W.: Bilateral guided upsampling. ACM Transactions on Graphics (TOG) 35(6), 1-8 (2016)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 426, + 480, + 448 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 426, + 480, + 448 + ], + "spans": [ + { + "bbox": [ + 138, + 426, + 480, + 448 + ], + "type": "text", + "content": "7. Chen, J., Paris, S., Durand, F.: Real-time edge-aware image processing with the bilateral grid. ACM Transactions on Graphics (TOG) 26(3), 103-es (2007)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 449, + 480, + 480 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 480, + 480 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 480, + 480 + ], + "type": "text", + "content": "8. Chen, X., Liu, Y., Zhang, Z., Qiao, Y., Dong, C.: Hdrunet: Single image hdr reconstruction with denoising and dequantization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 354-363 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 481, + 480, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 481, + 480, + 523 + ], + "spans": [ + { + "bbox": [ + 138, + 481, + 480, + 523 + ], + "type": "text", + "content": "9. Chen, Y.S., Wang, Y.C., Kao, M.H., Chuang, Y.Y.: Deep photo enhancer: Unpaired learning for image enhancement from photographs with gans. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6306-6314 (2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 524, + 480, + 556 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 524, + 480, + 556 + ], + "spans": [ + { + "bbox": [ + 138, + 524, + 480, + 556 + ], + "type": "text", + "content": "0. Deng, Y., Loy, C.C., Tang, X.: Aesthetic-driven image enhancement by adversarial learning. In: Proceedings of the 26th ACM international conference on Multimedia. pp. 870-878 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 556, + 480, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 556, + 480, + 589 + ], + "spans": [ + { + "bbox": [ + 138, + 556, + 480, + 589 + ], + "type": "text", + "content": "1. Gharbi, M., Chen, J., Barron, J.T., Hasinoff, S.W., Durand, F.: Deep bilateral learning for real-time image enhancement. ACM Transactions on Graphics (TOG) 36(4), 1-12 (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 590, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 590, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 590, + 480, + 632 + ], + "type": "text", + "content": "12. Guo, C., Fan, L., Zhang, Q., Liu, H., Liu, K., Jiang, X.: Redistributing the precision and content in 3d-lut-based inverse tone-mapping for hdr/wcg display. In: Proceedings of the 20th ACM SIGGRAPH European Conference on Visual Media Production. pp. 1-10 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "type": "text", + "content": "13. Hashimoto, N., Takamaeda-Yamazaki, S.: An fpga-based fully pipelined bilateral grid for real-time image denoising. In: 2021 31st International Conference on Field-Programmable Logic and Applications (FPL). pp. 167-173. IEEE (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 345, + 90, + 447, + 101 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "14. He, J., Liu, Y., Qiao, Y., Dong, C.: Conditional sequential modulation for efficient global image retouching. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 679-695. Springer (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 162, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 162, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 162, + 481, + 194 + ], + "type": "text", + "content": "15. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 194, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 481, + 216 + ], + "type": "text", + "content": "16. Hu, Y., He, H., Xu, C., Wang, B., Lin, S.: Exposure: A white-box photo post-processing framework. ACM Transactions on Graphics (TOG) 37(2), 1-17 (2018)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 216, + 481, + 248 + ], + "type": "text", + "content": "17. Huang, X., Zhang, Q., Feng, Y., Li, H., Wang, X., Wang, Q.: HDR-nerf: High dynamic range neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18398-18408 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 249, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 249, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 133, + 249, + 481, + 282 + ], + "type": "text", + "content": "18. Huang, X., Belongie, S.: Arbitrary style transfer in real-time with adaptive instance normalization. In: Proceedings of the IEEE international conference on computer vision. pp. 1501-1510 (2017)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 282, + 481, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 282, + 481, + 315 + ], + "spans": [ + { + "bbox": [ + 133, + 282, + 481, + 315 + ], + "type": "text", + "content": "19. Ignatov, A., Kobyshev, N., Timofte, R., Vanhoey, K., Van Gool, L.: Dslr-quality photos on mobile devices with deep convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 3277-3285 (2017)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 316, + 481, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 316, + 481, + 347 + ], + "spans": [ + { + "bbox": [ + 132, + 316, + 481, + 347 + ], + "type": "text", + "content": "20. Jiang, Y., Gong, X., Liu, D., Cheng, Y., Fang, C., Shen, X., Yang, J., Zhou, P., Wang, Z.: Enlightengan: Deep light enhancement without paired supervision. IEEE transactions on image processing 30, 2340-2349 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 347, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 392 + ], + "type": "text", + "content": "21. Jiang, Y., Zhang, H., Zhang, J., Wang, Y., Lin, Z., Sunkavalli, K., Chen, S., Amirghodsi, S., Kong, S., Wang, Z.: Ssh: A self-supervised framework for image harmonization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4832-4841 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 435 + ], + "type": "text", + "content": "22. Karaimer, H.C., Brown, M.S.: A software platform for manipulating the camera imaging pipeline. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part I 14. pp. 429-444. Springer (2016)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 481, + 468 + ], + "type": "text", + "content": "23. Kim, H.U., Koh, Y.J., Kim, C.S.: Pienet: Personalized image enhancement network. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXX 16. pp. 374-390. Springer (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 468, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 481, + 501 + ], + "type": "text", + "content": "24. Kim, S.Y., Oh, J., Kim, M.: Jsi-gan: Gan-based joint super-resolution and inverse tone-mapping with pixel-wise task-specific filters for uhd hdr video. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 11287-11295 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 501, + 481, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 523 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 523 + ], + "type": "text", + "content": "25. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 523, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 523, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 523, + 481, + 555 + ], + "type": "text", + "content": "26. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "type": "text", + "content": "27. Le, P.H., Le, Q., Nguyen, R., Hua, B.S.: Single-image hdr reconstruction by multiexposure generation. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4063-4072 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 589, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 481, + 632 + ], + "type": "text", + "content": "28. Liang, J., Zeng, H., Cui, M., Xie, X., Zhang, L.: Ppr10k: A large-scale portrait photo retouching dataset with human-region mask and group-level consistency. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 653-661 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "29. Liu, C., Yang, H., Fu, J., Qian, X.: 4d lut: learnable context-aware 4d lookup table for image enhancement. IEEE Transactions on Image Processing 32, 4742-4756 (2023)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 161 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 161 + ], + "type": "text", + "content": "30. Liu, Y.L., Lai, W.S., Chen, Y.S., Kao, Y.L., Yang, M.H., Chuang, Y.Y., Huang, J.B.: Single-image hdr reconstruction by learning to reverse the camera pipeline. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1651-1660 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 162, + 481, + 195 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 162, + 481, + 195 + ], + "spans": [ + { + "bbox": [ + 130, + 162, + 481, + 195 + ], + "type": "text", + "content": "31. Moran, S., Marza, P., McDonagh, S., Parisot, S., Slabaugh, G.: Deeplpf: Deep local parametric filters for image enhancement. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 12826-12835 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 196, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 196, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 196, + 481, + 228 + ], + "type": "text", + "content": "32. Park, J., Lee, J.Y., Yoo, D., Kweon, I.S.: Distort-and-recover: Color enhancement using deep reinforcement learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5928-5936 (2018)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 229, + 481, + 273 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 229, + 481, + 273 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 481, + 273 + ], + "type": "text", + "content": "33. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "text", + "content": "34. Song, Y., Qian, H., Du, X.: Starenhancer: Learning real-time and style-aware image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4126-4135 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 308, + 481, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 481, + 329 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 481, + 329 + ], + "type": "text", + "content": "35. Vandenberg, J.D., Andriani, S.: A survey on 3d-lut performance in 10-bit and 12-bit hdr bt. 2100 pq. In: SMPTE 2018. pp. 1-19. SMPTE (2018)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 331, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 331, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 331, + 481, + 363 + ], + "type": "text", + "content": "36. Wang, D., Zheng, Z., Ding, W., Jia, X.: Lgabl: Uhd multi-exposure image fusion via local and global aware bilateral learning. IEEE Transactions on Emerging Topics in Computational Intelligence (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 364, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 364, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 364, + 481, + 407 + ], + "type": "text", + "content": "37. Wang, R., Zhang, Q., Fu, C.W., Shen, X., Zheng, W.S., Jia, J.: Underexposed photo enhancement using deep illumination estimation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 6849-6857 (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 408, + 481, + 451 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 481, + 451 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 481, + 451 + ], + "type": "text", + "content": "38. Wang, T., Li, Y., Peng, J., Ma, Y., Wang, X., Song, F., Yan, Y.: Real-time image enhancer via learnable spatial-aware 3d lookup tables. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2471-2480 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 453, + 481, + 485 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 481, + 485 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 481, + 485 + ], + "type": "text", + "content": "39. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 487, + 481, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 481, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 481, + 508 + ], + "type": "text", + "content": "40. Wei, C., Wang, W., Yang, W., Liu, J.: Deep retina decomposition for low-light enhancement. arXiv preprint arXiv:1808.04560 (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 509, + 481, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 542 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 542 + ], + "type": "text", + "content": "41. Xu, B., Xu, Y., Yang, X., Jia, W., Guo, Y.: Bilateral grid learning for stereo matching networks. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12497-12506 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 543, + 481, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 481, + 564 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 481, + 564 + ], + "type": "text", + "content": "42. Xu, Q., Wang, L., Wang, Y., Sheng, W., Deng, X.: Deep bilateral learning for stereo image super-resolution. IEEE Signal Processing Letters 28, 613-617 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 566, + 481, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 566, + 481, + 587 + ], + "spans": [ + { + "bbox": [ + 132, + 566, + 481, + 587 + ], + "type": "text", + "content": "43. Yan, Z., Zhang, H., Wang, B., Paris, S., Yu, Y.: Automatic photo adjustment using deep neural networks. ACM Transactions on Graphics (TOG) 35(2), 1-15 (2016)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 588, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 481, + 632 + ], + "type": "text", + "content": "44. Yang, C., Jin, M., Jia, X., Xu, Y., Chen, Y.: Adaint: Learning adaptive intervals for 3d lookup tables on real-time image enhancement. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 17522-17531 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "45. Yang, C., Jin, M., Xu, Y., Zhang, R., Chen, Y., Liu, H.: Seplut: Separable image-adaptive lookup tables for real-time image enhancement. In: European Conference on Computer Vision (ECCV). pp. 201-217. Springer (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 345, + 90, + 447, + 100 + ], + "type": "text", + "content": "LUT with Bilateral Grid" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 358 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "46. Zeng, H., Cai, J., Li, L., Cao, Z., Zhang, L.: Learning image-adaptive 3d lookup tables for high performance photo enhancement in real-time. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) 44(4), 2058-2073 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "text", + "content": "47. Zhang, F., Zeng, H., Zhang, T., Zhang, L.: Clut-net: Learning adaptively compressed representations of 3dluts for lightweight image enhancement. In: Proceedings of the 30th ACM International Conference on Multimedia. pp. 6493-6501 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "48. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "text", + "content": "49. Zhang, Y., Zhang, J., Guo, X.: Kindling the darkness: A practical low-light image enhancer. In: Proceedings of the 27th ACM international conference on multimedia. pp. 1632-1640 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "text", + "content": "50. Zhang, Z., Jiang, Y., Jiang, J., Wang, X., Luo, P., Gu, J.: Star: A structure-aware lightweight transformer for real-time image enhancement. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4106-4115 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "text", + "content": "51. Zheng, Z., Ren, W., Cao, X., Wang, T., Jia, X.: Ultra-high-definition image hdr reconstruction via collaborative bilateral learning. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 4449-4458 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "type": "text", + "content": "52. Zhou, Y., Li, C., Liang, J., Xu, T., Liu, X., Xu, J.: 4k-resolution photo exposure correction at 125 fps with " + }, + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "type": "inline_equation", + "content": "\\sim" + }, + { + "bbox": [ + 132, + 326, + 481, + 358 + ], + "type": "text", + "content": "8k parameters. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 1587-1597 (2024)" + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 101 + ], + "type": "text", + "content": "Kim and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_content_list.json b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..c6299bd966deef1e057682794c4f5056170e589a --- /dev/null +++ b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_content_list.json @@ -0,0 +1,1586 @@ +[ + { + "type": "text", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "text_level": 1, + "bbox": [ + 266, + 140, + 743, + 188 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anas Mahmoud1, Ali Harakeh2, and Steven Waslander1", + "bbox": [ + 282, + 210, + 725, + 229 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 University of Toronto", + "bbox": [ + 423, + 239, + 581, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 Mila - Quebec AI Institute", + "bbox": [ + 403, + 253, + 599, + 267 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Pre-trained on extensive and diverse multi-modal datasets, 2D foundation models excel at addressing 2D tasks with little or no downstream supervision, owing to their robust representations. The emergence of 2D-to-3D distillation frameworks has extended these capabilities to 3D models. However, distilling 3D representations for autonomous driving datasets presents challenges like self-similarity, class imbalance, and point cloud sparsity, hindering the effectiveness of contrastive distillation, especially in zero-shot learning contexts. Whereas other methodologies, such as similarity-based distillation, enhance zero-shot performance, they tend to yield less discriminative representations, diminishing few-shot performance. We investigate the gap in structure between the 2D and the 3D representations that result from state-of-the-art distillation frameworks and reveal a significant mismatch between the two. Additionally, we demonstrate that the observed structural gap is negatively correlated with the efficacy of the distilled representations on zero-shot and few-shot 3D semantic segmentation. To bridge this gap, we propose a relational distillation framework enforcing intra-modal and cross-modal constraints, resulting in distilled 3D representations that closely capture the structure of the 2D representation. This alignment significantly enhances 3D representation performance over those learned through contrastive distillation in zero-shot segmentation tasks. Furthermore, our relational loss consistently improves the quality of 3D representations in both in-distribution and out-of-distribution few-shot segmentation tasks, outperforming approaches that rely on the similarity loss.", + "bbox": [ + 259, + 309, + 743, + 643 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 670, + 377, + 686 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Understanding 3D scenes is pivotal for robotics applications [19,35], notably in autonomous driving, where accurate navigation and decision-making depend on precise environmental perception. Solving the perception tasks necessary for 3D scene understanding requires the point-wise labelling of LiDAR scenes, which is tedious, compounded by the sparsity of LiDAR data, and costly [28,29]. These issues result in a scarcity of large-scale, diverse point cloud datasets, particularly those aligned with images or text, significantly hampering the development of foundation models for 3D tasks. This shortage is particularly problematic for few-shot or zero-shot learning approaches, which aim to achieve proficiency with", + "bbox": [ + 212, + 703, + 789, + 843 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/d28fbee0168ce91a28569b8898fae8eb44f4a8ffd58708df01e7eabe69f27d8e.jpg", + "image_caption": [ + "Fig. 1: We distill 2D representations from CLIP [36] to a 3D point-cloud encoder using the contrastive loss, similarity loss, and our proposed relational loss, and compute the uniformity (U), tolerance (T), and modality gap (G) of the learned 3D representations. We sample 5000 point features from each of the 16 classes defined in the nuScenes dataset [5], apply PCA and visualize the primary components. The source U and T of the CLIP image encoder are 1.54 and 0.73, respectively. Compared to the source, we see that contrastive loss learns 3D representations with higher U and lower T compared to the source, while the trends are reversed for similarity loss. Our proposed relational loss minimizes this structural mismatch and leads to the lowest modality gap." + ], + "image_footnote": [], + "bbox": [ + 223, + 148, + 772, + 268 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "minimal or no labelled examples 432. Bridging this gap is vital for creating models adept at understanding complex 3D scenes with limited data.", + "bbox": [ + 212, + 425, + 787, + 455 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Contrary to the 3D domain, the 2D and language domains benefit from the availability of large-scale, diverse, and multi-modal datasets, which facilitated the development of Vision Foundation Models (VFMs) [7,30], and Vision-Language Models (VLMs) [36,46]. These models have shown remarkable label efficiency in 2D tasks like image classification and segmentation and have also been used to perform label-free 2D image classification and segmentation through language prompts during inference [26,36]. Due to these advantages, recent approaches for learning 3D representations have relied on the distillation of 2D representations from VFMs [25,27,38] or VLMs [9,33,44] to point cloud encoders, and have shown encouraging results when solving few-shot and zero-shot 3D tasks.", + "bbox": [ + 212, + 458, + 787, + 625 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Unfortunately, the adaptation of 2D-to-3D distillation frameworks for autonomous driving (AD) datasets reveals unique challenges, notably due to the inherent characteristics of AD data. Current frameworks, largely reliant on contrastive learning methods, face the issue of self-similarity [27], a prevalent phenomenon in AD datasets. Self-similarity arises when a significant portion of the training examples belong to a single semantic category (e.g. road, trees or sky in AD data). Under the effect of self-similarity, the contrastive loss mechanism, designed to be hardness-aware [41], inadvertently pushes away semantically similar samples, which not only disrupts the local semantic coherence of the 3D representation [24,27,38] but also amplifies the effects of AD datasets' severe class imbalance. As a result, while such frameworks may result in useful 3D representations for few-shot learning tasks, the misalignment induced by excessive pushing of semantically similar examples undermines their efficacy in zero-shot learning scenarios, where precise cross-modal alignment is crucial. Another approach", + "bbox": [ + 212, + 628, + 789, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 400, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "to distillation relies on the cosine similarity loss, which attempts to learn a 3D representation by driving the features generated for every 3D point by a point encoder to its corresponding 2D feature from VFMs or VLMs. Using the similarity loss results in 3D representations that achieve significantly better performance on the zero-shot tasks compared to ones learned with the contrastive loss. However, we argue in Section 3 that using the similarity loss under-constrains the pretraining when compared to the contrastive loss, resulting in sub-optimal 3D representations on few-shot downstream tasks.", + "bbox": [ + 212, + 146, + 787, + 265 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To highlight the mismatch discussed above, we provide an example visualization of the 3D representation space (Fig. ①), which was obtained by distilling from CLIP's ③ 2D representation space using both the contrastive and similarity losses. We observe that both losses result in 3D representations that diverge from the structure of the 2D representation as measured by uniformity, tolerance, and the modality gap, which we further explain in Section ③.", + "bbox": [ + 212, + 267, + 787, + 358 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this work, we investigate the impact of state-of-the-art 2D-to-3D distillation frameworks on the structure of learned 3D representations. We show that the choice of loss during pretraining can result in a significant mismatch between the structure of the 2D source representations and the distilled 3D representations. Furthermore, we demonstrate that this mismatch leads to a deterioration in performance on downstream tasks. Our contributions are as follows:", + "bbox": [ + 212, + 358, + 787, + 446 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- Quantify the Gap: We quantify the mismatch in structure when performing distillation using contrastive loss [12,25,38] and similarity loss [17,33] via the uniformity [41,42], tolerance [41], and modality gap [23], revealing a significant gap between 2D and distilled 3D representations.", + "bbox": [ + 225, + 455, + 785, + 515 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- Bridging the Gap using Relational Distillation: We address this mismatch by imposing structural constraints that foster the learning of a 3D representation aligned with the structure of 2D representations. To achieve this, we employ pretraining with intra-modal and cross-modal relational losses. These losses generalize the similarity loss, providing a more effective constraint on the distillation process. Our proposed losses can be applied to pixel-based [25] and superpixel-based [38] distillation frameworks.", + "bbox": [ + 225, + 515, + 785, + 619 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- Bridging the Gap Improves Downstream Performance: Our proposed loss effectively minimizes the mismatch between learned 3D and 2D representations from multiple VLM and VFM image encoders, quantified by differences in the U, T, and G (Fig. 1). Consequently, the resulting 3D representations significantly outperform those learned via contrastive distillation on zero-shot segmentation tasks. Furthermore, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks.", + "bbox": [ + 225, + 619, + 785, + 739 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 760, + 387, + 776 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Cross-Modal Knowledge Distillation", + "text_level": 1, + "bbox": [ + 214, + 787, + 560, + 803 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Knowledge Distillation enables a student network to learn a task by mimicking the output of highly-performing teacher networks [13], achieved by using", + "bbox": [ + 212, + 809, + 785, + 842 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "these output as training targets for the student network [18], or by supervising the student network using the teacher's intermediate representations [37,40,43]. Distilling representations rather than network predictions enables knowledge transfer across different modalities, without requiring labels. In the context of cross-modal distillation, contrastive distillation [12,40] has shown to be the most effective. However, the abundance of self-similarity [27], coupled with the hardness-aware property of contrastive losses [41] limits the effectiveness of contrastive losses for AD data. On the other hand, similarity losses only utilize positive pairs for distillation, resulting in an under-constrained loss, leading to sub-optimal performance on zero-shot tasks [12].", + "bbox": [ + 212, + 146, + 787, + 299 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 3D Representations for Few-Shot Learning", + "text_level": 1, + "bbox": [ + 214, + 321, + 614, + 338 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Few-shot learning refers to learning the underlying pattern in data from only a few training samples [32]. Distilling 3D representations from 2D self-supervised models [26,7,10,14,15] or VFMs [30,36] has shown to be effective at significantly improving performance on 3D few-shot tasks [24,27,38]. PPKT [25] proposes a pixel-based contrastive loss to distill 2D self-supervised representations to point cloud encoders. While effective in indoor settings, PPKT [25] underperforms in outdoor settings where point-to-pixel correspondences are sparse [38]. Inspired by DetCon [16], SLidR [38] proposes a superpixel-based contrastive loss primarily designed for autonomous driving scenes which constructs region-level contrastive pairs suited for distilling scene-level images [16]. Due to the abundance of self-similarity in AD data [24,27,38], contrastive distillation leads to sub-optimal 3D representations [27]. To address these challenges, ST-SLidR [27] proposes a semantically tolerant contrastive loss leading to improved 3D representations for 3D few-shot segmentation tasks. Finally, Seal [24] demonstrates that object priors from VFMs like SAM [21], represented as superpixels, can improve the quality of 3D representations for 3D few-shot segmentation tasks. In this paper, we demonstrate that pixel and superpixel-based contrastive distillation applied to AD data, learn 3D representations that significantly differ from the structure of 2D representations. This leads to poor performance on zero-shot tasks and unpredictable performance on few-shot tasks.", + "bbox": [ + 212, + 349, + 787, + 652 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.3 3D Representations for Zero-Shot Learning", + "text_level": 1, + "bbox": [ + 214, + 676, + 619, + 691 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Contrastive Language-Image Pre-training (CLIP) models are pre-trained on billions of webscale image-text pairs and have shown great success in solving zero-shot image classification tasks [36]. Using frozen CLIP vision encoders, Image-Bind [12] enables zero-shot image classification by distilling image-level representations via a contrastive distillation framework. LidarCLIP [17] aligns LiDAR point features to CLIP space, demonstrating effective cross-modal retrieval and image-level zero-shot classification. PointCLIP [44] and PointCLIPv2 [47] propose a distillation-free approach utilizing CLIP vision and text encoders during the inference stage to solve 3D zero-shot classification tasks. More recently,", + "bbox": [ + 212, + 703, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 400, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "MaskCLIP [46] proposes removing the last attention pooling layer in CLIP vision encoders to enable dense feature extraction for 2D zero-shot segmentation tasks. OpenScene [33] distills image features from CLIP models fine-tuned on 2D segmentation datasets [11,22] to point cloud encoders. As demonstrated by ConceptFusion [19] and LERF [20], due to fine-tuning on closed-set 2D segmentation labels, these CLIP models have poor open-set capabilities. During inference, OpenScene fuses image and point features to solve 3D zero-shot segmentation. In this work, we do not assume access to finetuned CLIP models or access to image data during inference time. CLIP2Scene [9] assumes knowledge of class names of objects in the pre-training dataset, which leads to a contrastive loss with fewer false negatives. Requiring class names is problematic as it assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes and limiting open-set capabilities [34].", + "bbox": [ + 212, + 145, + 787, + 345 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 364, + 380, + 383 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 395, + 372, + 409 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our objective is to generate useful 3D representations by learning a point cloud encoder, $f: \\mathbb{R}^{N \\times (3 + L)} \\to \\mathbb{R}^{N \\times C}$ , through distilling 2D representations from VFMs or VLMs (e.g., CLIP [36], DINOv2 [30]). Using camera-to-LiDAR calibration matrices, we create a set of positive pairs of point, $\\mathbf{K}_{\\mathbf{p}} \\in \\mathbb{R}^{N \\times C}$ , and pixel, $\\mathbf{Q}_{\\mathbf{p}} \\in \\mathbb{R}^{N \\times C}$ , features, with the latter being generated from the pre-trained image encoder of the foundation model, $g: \\mathbb{R}^{N \\times 3} \\to \\mathbb{R}^{N \\times C}$ . While distillation methods like PPKT [25] implement distillation losses by creating pixel-point positive pairs, techniques such as SLidR [38] optimize pair formation by harnessing boundary information from superpixels. SLidR, with $M$ superpixels per image, employs average pooling to group points, $\\mathbf{K}_{\\mathbf{p}}$ , and pixels, $\\mathbf{Q}_{\\mathbf{p}}$ , into superpoint, $\\mathbf{K}_{\\mathbf{sp}} \\in \\mathbb{R}^{M \\times C}$ , and superpixel, $\\mathbf{Q}_{\\mathbf{sp}} \\in \\mathbb{R}^{M \\times C}$ , features, improving feature correspondence. Superpixels are derived from unsupervised techniques like SLIC [1], or foundation models such as SAM [21,24]. One of the most effective cross-modal distillation losses is the contrastive loss:", + "bbox": [ + 212, + 419, + 787, + 630 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {c o n} \\left(\\mathbf {K}, \\mathbf {Q}\\right) = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\log \\left[ \\frac {e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\right\\rangle / \\tau\\right)}}{\\sum_ {j \\neq i} e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {j} \\right\\rangle / \\tau\\right)} + e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\right\\rangle / \\tau\\right)}} \\right] (1)\n$$\n", + "text_format": "latex", + "bbox": [ + 292, + 638, + 785, + 680 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathbf{K}$ and $\\mathbf{Q}$ can either be point/pixel (i.e., $\\mathbf{K_p}$ , $\\mathbf{Q_p}$ ) or superpoint/superpixel (i.e., $\\mathbf{K_{sp}}$ , $\\mathbf{Q_{sp}}$ ) feature vectors, $B$ is the number of positive pairs in a mini-batch, $\\tau$ is the temperature, and $\\langle \\mathbf{k}_i, \\mathbf{q}_j \\rangle$ is the dot product between the $\\ell_2$ -normalized features. The contrastive loss distills information from pre-trained image encoders by pulling the point cloud features, $K$ , towards their corresponding (positive) image feature, $Q$ , in representation space, simultaneously pushing them away from all the other (negative) image features. The temperature, $\\tau$ , controls the strength of this push/pull mechanism by modifying the gradient's scale from the negative samples [41]. However, a significant limitation of this approach is the potential degradation in the learned point cloud representation's", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "quality due to false negative samples [27]. These are image features incorrectly chosen as negative, despite belonging to the same semantic class as the positive point cloud feature, leading to opposing distillation signals.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To avoid both relying on negative examples while performing distillation, and tuning the temperature parameter, we can use the cosine similarity:", + "bbox": [ + 212, + 191, + 784, + 222 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {s i m} (\\mathbf {K}, \\mathbf {Q}) = \\frac {1}{B} \\sum_ {i = 1} ^ {B} (1. 0 - \\langle \\mathbf {k} _ {i}, \\mathbf {q} _ {i} \\rangle) \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 234, + 785, + 275 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The similarity loss does not rely on negative samples and thus has a much simpler mode of action. It focuses solely on drawing each point cloud feature, $\\mathbf{k}_i$ , nearer to its corresponding image feature, $\\mathbf{q}_i$ , effectively maximizing their dot product.", + "bbox": [ + 214, + 286, + 782, + 333 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Quantifying the Quality of Distilled Representations", + "text_level": 1, + "bbox": [ + 214, + 354, + 692, + 372 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We investigate the quality of the distilled 3D representations as a function of the distillation loss used during training. We hypothesize that if a distilled 3D representation space closely captures the structure of the source 2D representation space, our resulting 3D encoder would: 1) possess the enhanced representation capability of the source vision/vision-language foundation model and 2) generate 3D representations that are well-aligned with the text representations of the vision-language model, enabling zero-shot downstream tasks. To assess the structural similarity between two representation spaces, we utilize uniformity and tolerance, two metrics previously proposed by Wang et al. [41], for evaluating the quality of a representation space. Uniformity measures the distribution of $\\ell_2$ -normalized features on a hyper-sphere. Authors in [42] have demonstrated that a high uniformity is key for high-quality representations as it quantifies that the trained encoder has successfully utilized a substantial part of the available feature space. Uniformity is formulated using a Gaussian potential function as:", + "bbox": [ + 212, + 382, + 787, + 594 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathrm {U} (f (\\cdot)) = - \\log \\underset {x, y \\sim p _ {\\mathrm {d a t a}}} {\\mathbb {E}} \\left[ e ^ {- t | | f (x) - f (y) | | _ {2} ^ {2}} \\right] \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 617, + 785, + 643 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $f(.)$ is the point encoder and $x, y$ are two samples from the data-distribution $p_{\\mathrm{data}}$ . Here, $x, y$ are point features for 3D point encoders. Similarly, we compute the uniformity of $U(g(.)$ ) for the image encoder by setting $x, y$ as pixel features.", + "bbox": [ + 212, + 656, + 790, + 700 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "On the other hand, tolerance measures the semantic clustering for the $\\ell_2$ -normalized output representations from a given encoder, computed as:", + "bbox": [ + 212, + 702, + 784, + 732 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nT (f (.) = \\underset {x, y \\sim p _ {\\mathrm {d a t a}}} {\\mathbb {E}} \\left[ \\left(f (x) ^ {T} f (y)\\right) \\cdot I _ {l (x) = l (y)} \\right] \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 346, + 744, + 785, + 767 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $l(x)$ represents the class label of point $x$ . $I_{l(x) = l(y)}$ is an indicator function, having the value of 1 for $l(x) = l(y)$ and the value of 0 for $l(x) \\neq l(y)$ . A higher tolerance indicates that the features of all points belonging to a certain class are better clustered together on a unit sphere. Similar to uniformity, we can compute", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 398, + 127 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/63fd452a4d1abce4961d04b8474b0c4ba92f3756650b6da3cbfecc077eef3905.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 312, + 146, + 439, + 210 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/7822afb40b423aea1815f7774d86852320c11635aa0cb23f8498091bb7f4e43f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 313, + 214, + 439, + 263 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/b6d80a5dbc35f4074a9caa8be44b1f6dc82d4dea9c2af3322bc1e3e73628a13d.jpg", + "image_caption": [ + "Fig. 2: Blue: The source representation space, with a uniformity and tolerance of $\\mathrm{U} = 0.89$ and $\\mathrm{T} = 0.66$ , respectively. Cyan: The predicted representation space. Here, $t$ denotes the number of training iterations." + ], + "image_footnote": [], + "bbox": [ + 313, + 268, + 439, + 316 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/4e5e299eb5e074643b7406caf0e399a097f4c6a2b5f32bf289bcc29839458325.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 464, + 146, + 570, + 210 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/6f6e1c1e8f8290fe72e8d08f6a524aec9c1b4c998c9184a7d6d9ac6940ae65ab.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 465, + 213, + 568, + 263 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/05a3600c2c216c9c385ecebd8f899319536d336c35b1f073bc072ffb420de117.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 465, + 267, + 566, + 316 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/1419c666b58e0caeb50955341e7f337b5eda96ae8766164fdabb18d5d88fdbc4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 593, + 148, + 697, + 210 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/4f5cfb89216524ab028801866d2b98db0f01d85ba13069b0c4a0fbda89744768.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 594, + 214, + 697, + 263 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/368baa43c6c48d948a9117d1fed615c887ff2e038835a87f1bf142e9dda7d669.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 596, + 267, + 697, + 316 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "tolerance for the image encoder as $T(g(.))$ , by propagating 3D point-wise labels to 2D image pixels.", + "bbox": [ + 212, + 383, + 785, + 412 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Furthermore, to directly compare the alignment of the two representation spaces from different modalities, we also use the modality gap as proposed in [23]:", + "bbox": [ + 212, + 414, + 785, + 445 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nG (f (.), g (.) = \\underset {x \\sim p _ {\\mathrm {2 D}}} {\\mathbb {E}} [ f (x) ] - \\underset {y \\sim p _ {\\mathrm {3 D}}} {\\mathbb {E}} [ g (y) ] \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 458, + 785, + 483 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The modality gap measures the difference between the mean of the representation of the point features and their corresponding pixel features. We conclude by noting that unlike G, U and T are properties of a single encoder; we show the difference in representations by comparing the values of $U(f(.))$ and $T(f(.))$ to $U(g(.))$ and $T(g(.))$ , respectively. Closer values indicate our point cloud encoder well-approximates the representation space of the source image encoder, which we show in Section 4 to be beneficial for downstream tasks.", + "bbox": [ + 214, + 488, + 787, + 594 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 The Representations of Common Distillation Losses", + "text_level": 1, + "bbox": [ + 214, + 617, + 689, + 633 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Inspired by [39], we explore the structure of the learned representation space using contrastive loss and similarity loss through a toy example. We start with 1000 uniformly distributed points over a 3D unit sphere, representing point features before the distillation phase. Using a 2-layer MLP, we learn to align each input point with its corresponding pixel feature from the source representation space, defined by U and T levels of 0.89 and 0.66, respectively. We use the Adam optimizer with a learning rate of $10^{-4}$ and train our model for 50,000 iterations (refer to Appendix A for detailed analysis).", + "bbox": [ + 212, + 643, + 787, + 763 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Figure 2 shows a visualization of the source representation space (blue) and the predicted representation space (cyan) at various stages of training. The top row highlights a significant difference: the contrastive losses generate a representation space with a high U of 1.38, but with a very low T of 0.02, differing significantly from the source space's U (0.89) and T (0.66). This is attributed", + "bbox": [ + 212, + 765, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "to self-similarity [27], a phenomenon that occurs when points from the source representation space are close to one another, as in our toy example. Although the contrastive loss moves a particular prediction to its corresponding point in the source, its hardness-awareness property [41] pushes all other predictions, particularly close ones, away from that point. Combined with self-similarity, this yields a uniform predicted space with a low T, and a significant modality gap. As demonstrated in Section 4, this discrepancy hinders zero-shot task performance due to inadequate cross-modal alignment.", + "bbox": [ + 212, + 146, + 787, + 267 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "On the other hand, learning with similarity loss leads to representations with lower U (0.59) and higher T (0.80) compared to the source. This stems from the tendency of similarity loss to form compact clusters in the predicted space, as shown with autonomous driving data in Figure 1 and the toy example in Figure 2. Notably, early training $(t = 1000)$ exhibits noticeable clustering that disperses with additional epochs. Additionally, the non-uniqueness of the dot product between the learnable point vector, $\\mathbf{k}_i$ , and the fixed pixel vector, $\\mathbf{q}_i$ , within the framework of similarity loss (Eq. 2) results in a significant increase in the number of learnable vectors that can achieve the same cosine similarity with the fixed vector, $\\mathbf{q}_i$ . This growth can result in slow convergence and suboptimal predicted representation spaces. Combined with neural network optimization complexities, these issues lead to the observed disparity in uniformity and tolerance from the source representation space in distillation tasks using similarity loss.", + "bbox": [ + 212, + 268, + 789, + 465 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Relational Loss", + "text_level": 1, + "bbox": [ + 215, + 492, + 388, + 505 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Inspired by distilling relations in model compression [31], this section presents two relational losses that impose structural constraints on the 3D representation space. This modification disrupts the symmetry inherent in the similarity loss. It drives the network to select solutions that, while possessing equivalent similarity loss values to alternatives, yield a 3D representation space that more accurately mirrors the structure of the image representation space.", + "bbox": [ + 212, + 522, + 787, + 612 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Cross-modal Relational Loss We propose imposing a constraint on the structure of the learned 3D representation space to ensure that the similarities between a given predicted point feature, $\\mathbf{k}_i$ , and all source pixel features align with the similarities between its corresponding pixel feature, $\\mathbf{q}_i$ , and all other source pixel features in the same batch. The cross-modal relation loss is defined as:", + "bbox": [ + 212, + 614, + 787, + 689 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal{L}_{cross}\\left(\\mathbf{K},\\mathbf{Q}\\right) = \\frac{1}{N}\\sum_{i = 1}^{N}\\mathbf{C}_{ii} + \\frac{1}{N^{2} - N}\\sum_{i = 1}^{N}\\sum_{\\substack{j = 1\\\\ i\\neq j}}^{N}\\mathbf{C}_{ij} \\\\ = \\underbrace {\\frac {1}{N} \\sum_ {i = 1} ^ {N} \\left(1 . 0 - \\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\rangle\\right)} _ {\\mathcal {L} _ {s i m} (\\mathbf {K}, \\mathbf {Q})} + \\frac {1}{N ^ {2} - N} \\sum_ {i = 1} ^ {N} \\sum_ {\\substack {j = 1 \\\\ i \\neq j}} ^ {N} | \\langle \\mathbf {k} _ {i}, \\mathbf {q} _ {j} \\rangle - \\langle \\mathbf {q} _ {i}, \\mathbf {q} _ {j} \\rangle | \\tag{6} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 232, + 702, + 785, + 835 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 400, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathbf{C} = |\\mathbf{KQ}^T -\\mathbf{QQ}^T|$ represents the matrix of differences, capturing the discrepancy between the predicted point-to-pixel and the source pixel-to-pixel similarities. First, the matrix's diagonal components, $\\mathbf{C}_{ii}$ , are directly linked to the similarity loss, underscoring the necessity of aligning each point feature with its corresponding source pixel feature. The second term of Equation 6 facilitates learning a point feature, $\\mathbf{k}_i$ , that is not only close to its corresponding source pixel feature, $\\mathbf{q}_i$ , but is also consistent with $\\mathbf{q}_i$ 's similarities to other pixel features, $\\langle \\mathbf{q}_i,\\mathbf{q}_j\\rangle$ , where $j\\neq i$ . These cross-modal constraints foster learning point features that maintain the relational structure within the image representation space.", + "bbox": [ + 212, + 145, + 782, + 282 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Intra-modal Relational Loss Another strategy to ensure structural similarity between the 3D and 2D representation spaces involves directly penalizing differences in their relational graphs. A relational graph of a representation space can be understood as a graph with the nodes representing point or pixel features, and edges indicating the similarity between node features. We represent the relational graph of the point features and the pixel features using $\\mathbf{K}\\mathbf{K}^T$ and $\\mathbf{Q}\\mathbf{Q}^T$ , respectively. Here, $\\langle \\mathbf{k}_i,\\mathbf{k}_j\\rangle$ represents the similarity between the $i^{th}$ and the $j^{th}$ predicted point feature. We denote the discrepancy of the relational graphs as $\\mathbf{U} = |\\mathbf{K}\\mathbf{K}^T -\\mathbf{Q}\\mathbf{Q}^T|$ . Since this matrix is symmetric, and its diagonal elements, $|\\langle \\mathbf{k}_i,\\mathbf{k}_i\\rangle -\\langle \\mathbf{q}_i,\\mathbf{q}_i\\rangle |$ , degenerate to 0, the intra-modal relational loss is expressed as:", + "bbox": [ + 212, + 287, + 784, + 454 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {i n t r a}} (\\mathbf {K}, \\mathbf {Q}) = \\frac {2}{N ^ {2} - N} \\sum_ {i = 1} ^ {N - 1} \\sum_ {j = i + 1} ^ {N} \\mathbf {U} _ {i j} \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 364, + 477, + 784, + 517 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The consequence of this loss on the structure of the point representation space is simple; the similarity between a predicted point feature and other predicted point features in a batch should match the similarity between its corresponding source pixel feature and other source pixel features in the same batch. Our proposed relational loss is a combination of the two losses:", + "bbox": [ + 212, + 541, + 782, + 617 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {r e l} (\\mathbf {K}, \\mathbf {Q}) = \\mathcal {L} _ {i n t r a} (\\mathbf {K}, \\mathbf {Q}) + \\mathcal {L} _ {c r o s s} (\\mathbf {K}, \\mathbf {Q}) \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 346, + 643, + 784, + 657 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Unlike the similarity loss, the proposed loss ensures learned point cloud features align with image features in a structured manner, preserving the data's inherent relationships. Figure 2 reveals two key advantages of relational loss over similarity loss: closer alignment of the predicted space's U and T with those of the source space, alongside a reduced G between the two spaces. Additionally, the relational loss achieves faster convergence, as the visual appearance of the predicted representation space resulting from learning with the relational loss remains consistent from the mid-point of training (t=25000) to its conclusion (t=50000). In Section 4 we further illustrate how these attributes of the relational loss contribute to enhanced performance in downstream tasks.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 732, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 143, + 375, + 162 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.1 Pre-training", + "text_level": 1, + "bbox": [ + 215, + 186, + 364, + 204 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Backbones We focus on distilling 2D representations from two vision foundation models, CLIP [36], pretrained on the WIT dataset containing 400 million image-text pairs, and DINOv2 [30], pretrained on the LVD-142 dataset containing 142 million images. For CLIP encoders, we experiment with different pre-trained architectures available from OpenAI [36]. For the 3D backbone, we use a randomly initialized Minkowski U-Net [38]. For details on the design of the 2D and 3D projection layers, refer to Appendix C.", + "bbox": [ + 212, + 223, + 787, + 330 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dataset In the pre-training phase we use the nuScenes dataset [5], consisting of 700 scenes. In line with previous works [24,27,38], these scenes are divided into two subsets: 600 scenes for pre-training and 100 scenes for the determination of the best hyper-parameters. Throughout this pre-training process, we exclusively employ keyframes from the 600 scenes to train all models. For pre-training hyperparameters and data-augmentation details, refer to Appendix B.", + "bbox": [ + 212, + 330, + 787, + 422 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Evaluation", + "text_level": 1, + "bbox": [ + 215, + 454, + 351, + 468 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "To study the effect of the distillation framework on the structure of the 3D representations, we evaluate the average U, T, and G between the distilled 3D and source 2D representations. For both pixel-based and superpixel-based losses, U, T, and G are evaluated using point or pixel features. To assess the relationship between the performance on downstream tasks and the difference in the structure of the 2D and the 3D representation spaces, we use the in-distribution 3D few-shot segmentation task, where we learn a classifier by finetuning the 3D representations on $1\\%$ of the labels of the nuScenes training set. Similar to [27,38], we also evaluate the utility of the distilled representations in the out-of-distribution setting by fine-tuning on $1\\%$ of the SemanticKITTI [3] dataset. The nuScenes and SemanticKITTI datasets contain 16 and 19 classes, respectively. We present our results using the official validation sets for these datasets.", + "bbox": [ + 212, + 489, + 787, + 671 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "For DINOv2, we follow [27,38] and evaluate the Linear Probing performance on nuScenes by freezing the backbone of the point cloud encoder and training a linear classifier on $100\\%$ of the labels. For CLIP models, we evaluate the 3D zero-shot segmentation tasks which can be performed with language prompts. To enable openset scene understanding, during pretraining, we assume we have no access to nuScenes class labels. Similar to [46], we apply prompt engineering during inference using 85 hand-crafted prompts for each class label, and then use the CLIP text encoder to compute an average text embedding for each class. Each point is then assigned the label that corresponds to the highest cosine similarity, computed between the point features and the CLIP text embeddings.", + "bbox": [ + 212, + 672, + 787, + 825 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 400, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/f451f080b9c216ee9b31c1fd5ebb50a4da6bdde04e3c25b7491f34864a2c76be.jpg", + "table_caption": [ + "Table 1: Evaluation of 3D representations from CLIP image encoder with source U of 1.54, and source T of 0.73. Best results are bolded and second best are underlined." + ], + "table_footnote": [], + "table_body": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
CLIP 36PPKT 253.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.60
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR 383.50900.44720.0015316.8246.7646.53
ST-SLidR 273.50000.45440.0015018.5447.1346.84
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
", + "bbox": [ + 220, + 184, + 781, + 297 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/ed87636886e1365ce503054f30753202fe44ff6ac2e9e82e9cef07dab689a376.jpg", + "table_caption": [ + "Table 2: Evaluation of 3D representations from DINOv2 image encoder with source U of 2.8, and source T of 0.51. Best results are bolded and second best are underlined." + ], + "table_footnote": [], + "table_body": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Lin. Probing 100%Finetuning 1%Finetuning 1%
DINOv2 30PPKT 253.6250.44510.0006048.5043.3043.62
Simpl2.1760.69260.0003049.7245.8548.32
Relpl (ours)2.3930.65880.0002049.2046.9049.00
SLidR 383.6550.37390.0004449.6044.8142.23
ST-SLidR 273.5890.43260.0004253.0047.1145.61
Simspl2.2860.65220.0003052.3047.2349.01
Relspl (ours)2.5040.63120.0002352.9248.4249.10
", + "bbox": [ + 220, + 353, + 784, + 463 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Results", + "text_level": 1, + "bbox": [ + 215, + 494, + 323, + 507 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Baselines In Tab. 1 and Tab. 2, we present the results of distilling CLIP and DINOv2 models using our proposed relational loss. We compare against multiple state-of-the-art contrastive losses including PPKT [25], SLidR [38], and ST-SLidR [27]. For superpixel-based losses, masks are generated using SAM [21]. As an additional baseline, we report results for both the pixel-based and superpixel-based similarity loss, which we denote as $\\mathrm{Sim}_{pl}$ and $\\mathrm{Sim}_{spl}$ , respectively. We report the average over 3 runs for all metrics.", + "bbox": [ + 212, + 521, + 784, + 626 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Uniformity, tolerance, and closing the modality gap Looking at distillation losses from the 2D CLIP encoder in Tab. [1] we first observe that U of 3D representations distilled using contrastive loss (i.e., PPKT, SLidR and ST-SLidR) is higher than the source U of 1.54, while U of similarity loss (i.e., $\\mathrm{Sim}_{pl}$ , $\\mathrm{Sim}_{spl}$ ) is lower than the U of the source. This is also observed when distilling from DINOv2. The relational constraints (i.e., $\\mathrm{Rel}_{pl}$ , $\\mathrm{Rel}_{spl}$ ) effectively close the gap between 3D representations distilled by similarity loss (i.e., $\\mathrm{Sim}_{pl}$ , $\\mathrm{Sim}_{spl}$ ) and 2D representations. For instance, when the pixel-based loss $\\mathrm{Rel}_{pl}$ is applied to CLIP, relational constraints close the gap in U resulting in a 3D representation with a U of 0.9089, instead of 0.5519, thus closer to the U of the source (1.54). Similarly, for the superpixel-based loss, $\\mathrm{Rel}_{spl}$ , relational constraints close the gap in U resulting in a 3D representation with a U of 1.099, instead of 0.5919, thus closer to the U of the source (1.54). In addition, relational losses result in semantic clusters that are closer to the T of the source. By closing the gap", + "bbox": [ + 212, + 628, + 785, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/3269b3aa938f0d0e43d7cd851444584cfcc7f1f10363150fb0fa73123ce7bff4.jpg", + "table_caption": [ + "Table 3: Performance for different CLIP backbones using pixel-based and superpixel-based relational loss. Best results are bolded and second best are underlined." + ], + "table_footnote": [], + "table_body": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
ViT-B32PPKT3.51100.52030.0002014.2143.2945.89
Simpl0.58040.93890.0001022.8444.2244.30
Relpl (ours)0.96050.89890.0001023.8544.6745.62
SLidR3.51300.47060.0003015.5543.3843.82
Simspl0.60090.93230.0001125.4644.8345.69
Relspl (ours)1.20200.86480.0000725.6645.6047.26
ViT-B16PPKT3.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.59
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR3.50900.44720.0015316.8246.7646.53
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
ViT-L14PPKT3.50200.52030.0008916.2844.6946.69
Simpl0.69090.92570.0001627.9144.8744.80
Relpl (ours)0.87750.90270.0001327.7445.9245.86
SLidR3.48000.44030.0006518.3147.3446.86
Simspl0.73110.91020.0002030.7745.7645.29
Relspl (ours)0.90190.88730.0001730.1147.0746.81
", + "bbox": [ + 232, + 184, + 769, + 412 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "in U and T, relational constraints result in the lowest G for pixel-based and superpixel-based losses. These results align well with the ones presented on the toy example in Section 3, which further supports the validity of our analysis.", + "bbox": [ + 212, + 444, + 785, + 491 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Zero-shot performance Looking at the utility of the 3D representations for 3D zero-shot segmentation in Tab. [1] we observe that the contrastive loss (i.e., PPKT, SLidR and ST-SLidR) has significantly worse 3D zero-shot mean IOU when compared to the similarity loss. This is contrary to the conclusion reached by ImageBind [12], which observed that the contrastive loss achieves $6\\%$ improvement on 2D zero-shot tasks compared to similarity losses. We hypothesize that the abundance of self-similarity in AD datasets, coupled with the hardness-aware property of contrastive loss [27], leads to pushing away semantically similar point and pixel features. This, in turn, results in poor alignment between point features and CLIP image features. Notably, we observe that ST-SLidR improves zero-shot performance compared to SLidR (18.54% vs 16.82%) as it utilizes the superpixel feature similarities to exclude a portion of the false negative samples from the pool of negative samples. Without resorting to negative samples, relational constraints minimize the 2D-to-3D structural gap compared to similarity loss, leading to improvements in zero-shot performance from 20.84% to 23.53% for pixel-based losses, and from 23.93% to 26.03% for superpixel-based losses.", + "bbox": [ + 212, + 491, + 787, + 733 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Tab. 4, we compare pixel and superpixel-based relational losses to SOTA methods. All methods distill from CLIP [36], with the performance on nuScenes provided by [8]. Methods are further categorized based on the prior knowledge required during the distillation phase. Some methods require class names defined for a dataset [8,9], while others utilize SAM to refine CLIP predictions [8]. Requiring class names assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes, thus", + "bbox": [ + 212, + 734, + 789, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 400, + 127 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/3a710c8bdba46c9a0c852e96dc5ea6fcad87ce58da43bc5222aeb2173705b47e.jpg", + "table_caption": [ + "Table 4: Zero-shot segmentation performance of relational loss compared to state-of-the-art methods." + ], + "table_footnote": [], + "table_body": "
MethodPublicationClass Names RequiredUses SAM3D mIoU
MaskCLIP 46ECCV 2022✗✗12.80
OpenScene 33CVPR 2023✗✗14.60
CLIP2Scene 9CVPR 2023✓✗20.80
Relpl (ours)-✗✗23.53
TLF 8NeurIPS 2023✓✓26.80
Relspl (ours)-✗✓26.03
", + "bbox": [ + 218, + 199, + 501, + 292 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/057170f74dfeac203e9fa7aa1c87048b1cba0af961e81041df26ccaeed08ae14.jpg", + "table_caption": [ + "Table 5: Effect of relational loss components. Distilling from CLIP image encoder with source U of 1.54 and T of 0.73." + ], + "table_footnote": [], + "table_body": "
LossUniformityToleranceModality GapnuScenesKITTI
ZSFt 1%Ft 1%
\\( Sim_{pl} \\)0.55190.94770.0004520.8444.3945.59
+cross0.64260.93860.0004221.3945.9545.45
+intra0.90890.91450.0003323.5345.6746.06
\\( Sim_{spl} \\)0.59190.93330.0004023.9345.6346.42
+cross0.76560.90860.0003325.0546.1846.99
+intra1.09900.87000.0001926.0347.2247.52
", + "bbox": [ + 220, + 344, + 506, + 441 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/c145dc1ef06d0e329bbb921f341996d12004fe0beffc31ecdcec946bafe80d7f.jpg", + "table_caption": [ + "Table 6: Improvement of finetuned models with respect to majority versus minority classes. Similar to ST-SLidR [27], We group classes based on whether their superpixels occupy more than $5\\%$ of the superpixels in nuScenes training set." + ], + "table_footnote": [], + "table_body": "
2D EncoderLossMajority (mIoU)Minority (mIoU)
CLIP\\( Sim_{pl} \\)69.1633.35
\\( Rel_{pl} \\)69.5934.80
\\( Gain \\)+0.43+1.45
\\( Sim_{spl} \\)67.5836.06
\\( Rel_{spl} \\)67.7538.77
\\( Gain \\)+0.17+2.71
DINOv2\\( Sim_{pl} \\)70.8934.24
\\( Rel_{pl} \\)71.2235.85
\\( Gain \\)+0.33+1.61
\\( Sim_{spl} \\)68.1538.53
\\( Rel_{spl} \\)68.8040.20
\\( Gain \\)+0.65+1.67
", + "bbox": [ + 524, + 250, + 777, + 434 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "limiting openset capabilities [34]. Without using class information, we observe in Tab. 4 that $\\mathrm{Rel}_{pl}$ performs the best compared to other pixel-based losses, while our superpixel-based relational loss, $\\mathrm{Rel}_{spl}$ , is within $1\\%$ from state-of-the-art [8]. Few-shot performance We evaluate the effectiveness of 3D representations in both in-distribution (namely, nuScenes) and out-of-distribution (namely, SemanticKITTI) settings. For representations distilled from CLIP in Tab. 1, we observe that the limited U of representations distilled through similarity losses, as opposed to the source, leads to comparatively weaker performance on indistribution tasks with few-shot learning when compared with contrastive loss. For instance, ST-SLidR representations enhance performance on the nuScenes dataset by $+1.5\\%$ compared to $\\mathrm{Sim}_{spl}$ . Furthermore, by applying relational constraints and without the need for negative samples, we can bridge the U gap. This results in $\\mathrm{Rel}_{spl}$ outperforming $\\mathrm{Sim}_{spl}$ by $+1.59\\%$ and $+1.1\\%$ on nuScenes and SemKITTI, respectively. When examining 3D representations distilled from DI-NOv2 in Tab. 2, we note a source U of 2.8. Here, the similarity loss closely aligns with the source's U more than the contrastive loss. The contrastive loss (PPKT and SLidR) shows significantly poorer performance compared to the similarity loss. Additionally, 3D representations distilled by ST-SLidR attain a U of 3.589 and a T of 0.4326, aligning more closely with the source U and T of 2.8 and 0.51 than those distilled by the SLidR loss. Lastly, we find that relational constraints narrow the G more effectively than similarity losses, thereby enhancing the few-shot performance by $+1.05\\%$ and $+1.19\\%$ on pixel and superpixel-based losses, respectively, on the nuScenes dataset compared to similarity losses.", + "bbox": [ + 212, + 474, + 787, + 824 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "CLIPBackbonesTab.3 depicts the performance of contrastive,similarity,", + "bbox": [ + 220, + 824, + 785, + 842 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "and relational losses when distilling from different CLIP backbones. Relational losses achieve the lowest modality gap, surpassing both contrastive and similarity loss across all 2D encoders. In zero-shot tasks, relational losses either match or exceed the performance of similarity losses, whereas contrastive distillation consistently underperforms. The performance of contrastive distillation on few-shot tasks proves unpredictable. For instance, distilling from ViT-B32 using similarity loss $\\mathrm{Sim}_{spl}$ surpasses distilling using contrastive loss SLidR in mIOU by $+1.45\\%$ and $+1.87\\%$ on nuScenes and SemanticKITTI, respectively. Conversely, distilling from ViT-L14, SLidR achieves competitive performance, outperforming similarity loss $\\mathrm{Sim}_{spl}$ by $+1.58\\%$ and $+1.57\\%$ on the same datasets. Notably, relational losses bridge the gap in few-shot learning while maintaining robust zero-shot task performance. This indicates that relational losses utilize inherent 2D representation relationships, avoiding ungrounded negative samples common in contrastive loss, which facilitates learning representations more aligned with the source's U, thereby enhancing few-shot task performance.", + "bbox": [ + 212, + 146, + 787, + 372 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Class Imbalance We investigate the performance of finetuned models on semantic segmentation using 3D representations distilled using similarity and relational losses. Similar to ST-SLidR [27], we distinguish between majority and minority classes based on the percentage of superpixels they occupy in the nuScenes dataset. The 11 classes occupying less than $5\\%$ of the superpixels are considered to be in the minority set, while the remaining classes are in the majority set. In Tab. 6 compared to similarity losses, relational losses learn representations that significantly improve performance on minority classes for pixel and superpixel-based losses without degrading performance on majority classes.", + "bbox": [ + 212, + 373, + 787, + 508 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Relational Loss Ablation We investigate the contribution of cross-modal and intra-modal constraints for pixel-based and superpixel-based losses. In Tab. 5, we observe that both constraints lead to learning 3D representations that are closer to the source U and T, and thus result in a lower G compared to similarity losses. Moreover, both constraints lead to improved performance on zero-shot and few-shot segmentation tasks. Interestingly, the superpixel-based relational loss with both constraints (last row) results in the smallest gap in U and T compared to other losses, leading to the best performance on semantic segmentation.", + "bbox": [ + 212, + 508, + 787, + 630 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 654, + 359, + 672 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we study the impact of the state-of-the-art 2D-to-3D distillation frameworks when applied to AD datasets on the structure of the learned 3D representation. We reveal a significant structural gap between the 2D and the 3D representations and show that this gap is negatively correlated with the utility of the learned 3D representations for solving 3D zero-shot and few-shot segmentation tasks. Our proposed relational loss bridges this structural gap, resulting in well-aligned 3D representations that outperform representations learned via contrastive loss on zero-shot segmentation tasks. In addition, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 400, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Susstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE TPAMI 34(11), 2274-2282 (2012)", + "2. Bardes, A., Ponce, J., Lecun, Y.: Vicreg: Variance-invariance-covariance regularization for self-supervised learning. In: ICLR (2022)", + "3. Behley, J., Garbade, M., Milioto, A., Quenzel, J., Behnke, S., Stachniss, C., Gall, J.: SemanticKITTI: A Dataset for Semantic Scene Understanding of LiDAR Sequences. In: ICCV (2019)", + "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)", + "5. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuscenes: A multimodal dataset for autonomous driving. In: CVPR. pp. 11621-11631 (2020)", + "6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. NeurIPS 33, 9912-9924 (2020)", + "7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021)", + "8. Chen, R., Liu, Y., Kong, L., Chen, N., Xinge, Z., Ma, Y., Liu, T., Wang, W.: Towards label-free scene understanding by vision foundation models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)", + "9. Chen, R., Liu, Y., Kong, L., Zhu, X., Ma, Y., Li, Y., Hou, Y., Qiao, Y., Wang, W.: Clip2scene: Towards label-efficient 3d scene understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7020-7030 (2023)", + "0. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)", + "1. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: European Conference on Computer Vision. pp. 540-557. Springer (2022)", + "2. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind: One embedding space to bind them all. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15180-15190 (2023)", + "3. Gou, J., Yu, B., Maybank, S.J., Tao, D.: Knowledge distillation: A survey. International Journal of Computer Vision 129, 1789-1819 (2021)", + "4. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P.H., Buchatskaya, E., Doersch, C., Pires, B.A., Guo, Z.D., Azar, M.G., et al.: Bootstrap your own latent: A new approach to self-supervised learning. arXiv preprint arXiv:2006.07733 (2020)", + "5. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020)", + "6. Henaff, O.J., Koppula, S., Alayrac, J.B., Van den Oord, A., Vinyals, O., Carreira, J.: Efficient visual pretraining with contrastive detection. In: ICCV. pp. 10086-10096 (2021)" + ], + "bbox": [ + 225, + 178, + 785, + 840 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 732, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Hess, G., Tonderski, A., Petersson, C., Åström, K., Svensson, L.: Lidarclip or: How i learned to talk to point clouds. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 7438-7447 (January 2024)", + "18. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)", + "19. Jatavallabhula, K., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., Tenenbaum, J., de Melo, C., Krishna, M., Paull, L., Shkurti, F., Torralba, A.: Conceptfusion: Open-set multimodal 3d mapping. Robotics Science and Systems (2023)", + "20. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: Lerf: Language embedded radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 19729-19739 (2023)", + "21. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., Dollar, P., Girshick, R.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 4015-4026 (October 2023)", + "22. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: ICLR (2022)", + "23. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022)", + "24. Liu, Y., Kong, L., Cen, J., Chen, R., Zhang, W., Pan, L., Chen, K., Liu, Z.: Segment any point cloud sequences by distilling vision foundation models. In: Advances in Neural Information Processing Systems (2023)", + "25. Liu, Y.C., Huang, Y.K., Chiang, H.Y., Su, H.T., Liu, Z.Y., Chen, C.T., Tseng, C.Y., Hsu, W.H.: Learning from 2d: Contrastive pixel-to-point knowledge transfer for 3d pretraining. arXiv preprint arXiv:2104.04687 (2021)", + "26. Mahmoud, A., Elhoushi, M., Abbas, A., Yang, Y., Ardalani, N., Leather, H., Morcos, A.S.: Sieve: Multimodal dataset pruning using image captioning models. In: CVPR. pp. 22423-22432 (2024)", + "27. Mahmoud, A., Hu, J.S.K., Kuai, T., Harakeh, A., Paull, L., Waslander, S.L.: Self-supervised image-to-point distillation via semantically tolerant contrastive loss. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7102-7110 (June 2023)", + "28. Mahmoud, A., Hu, J.S., Waslander, S.L.: Dense voxel fusion for 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 663-672 (2023)", + "29. Mahmoud, A., Waslander, S.L.: Sequential fusion via bounding box and motion pointpainting for 3d objection detection. In: 18th Conference on Robots and Vision (CRV) (2021)", + "30. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023)", + "31. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3967-3976 (2019)", + "32. Parnami, A., Lee, M.: Learning from few examples: A summary of approaches to few-shot learning. arXiv preprint arXiv:2203.04291 (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "A. Mahmoud et al.", + "bbox": [ + 271, + 114, + 398, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "33. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T., et al.: Openscene: 3d scene understanding with open vocabularies. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 815-824 (2023)", + "34. Puy, G., Gidaris, S., Boulch, A., Simeoni, O., Sautier, C., Perez, P., Bursuc, A., Marlet, R.: Revisiting the distillation of image representations into point clouds for autonomous driving. arXiv preprint arXiv:2310.17504 (2023)", + "35. Qian, J., Chatrath, V., Yang, J., Servos, J., Schoellig, A.P., Waslander, S.L.: Pocd: Probabilistic object-level change detection and volumetric mapping in semi-static scenes. Robotics: Science and Systems (2022)", + "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)", + "37. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)", + "38. Sautier, C., Puy, G., Gidaris, S., Boulch, A., Bursuc, A., Marlet, R.: Image-to-lidar self-supervised distillation for autonomous driving data. In: CVPR. pp. 9891-9901 (2022)", + "39. Shi, P., Welle, M.C., Björkman, M., Kragic, D.: Towards understanding the modality gap in CLIP. In: ICLR 2023 Workshop on Multimodal Representation Learning: Perks and Pitfalls (2023)", + "40. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019)", + "41. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: CVPR. pp. 2495-2504 (2021)", + "42. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020)", + "43. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016)", + "44. Zhang, R., Guo, Z., Zhang, W., Li, K., Miao, X., Cui, B., Qiao, Y., Gao, P., Li, H.: Pointclip: Point cloud understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8552-8562 (2022)", + "45. Zhang, Z., Girdhar, R., Joulin, A., Misra, I.: Self-supervised pretraining of 3d features on any point-cloud. In: ICCV. pp. 10252-10263 (October 2021)", + "46. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022)", + "47. Zhu, X., Zhang, R., He, B., Zeng, Z., Zhang, S., Gao, P.: Pointclip v2: Adapting clip for powerful 3d open-world learning. arXiv preprint arXiv:2211.11682 (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 715 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Image-to-Lidar Relational Distillation for Autonomous Driving Data", + "bbox": [ + 274, + 114, + 733, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_model.json b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_model.json new file mode 100644 index 0000000000000000000000000000000000000000..c7b81a1a10f40e2732e5163b866d8e35540390e5 --- /dev/null +++ b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_model.json @@ -0,0 +1,2093 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.267, + 0.141, + 0.744, + 0.189 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "text", + "bbox": [ + 0.283, + 0.212, + 0.726, + 0.231 + ], + "angle": 0, + "content": "Anas Mahmoud1, Ali Harakeh2, and Steven Waslander1" + }, + { + "type": "text", + "bbox": [ + 0.424, + 0.24, + 0.582, + 0.254 + ], + "angle": 0, + "content": "1 University of Toronto" + }, + { + "type": "text", + "bbox": [ + 0.405, + 0.254, + 0.6, + 0.268 + ], + "angle": 0, + "content": "2 Mila - Quebec AI Institute" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.31, + 0.744, + 0.645 + ], + "angle": 0, + "content": "Abstract. Pre-trained on extensive and diverse multi-modal datasets, 2D foundation models excel at addressing 2D tasks with little or no downstream supervision, owing to their robust representations. The emergence of 2D-to-3D distillation frameworks has extended these capabilities to 3D models. However, distilling 3D representations for autonomous driving datasets presents challenges like self-similarity, class imbalance, and point cloud sparsity, hindering the effectiveness of contrastive distillation, especially in zero-shot learning contexts. Whereas other methodologies, such as similarity-based distillation, enhance zero-shot performance, they tend to yield less discriminative representations, diminishing few-shot performance. We investigate the gap in structure between the 2D and the 3D representations that result from state-of-the-art distillation frameworks and reveal a significant mismatch between the two. Additionally, we demonstrate that the observed structural gap is negatively correlated with the efficacy of the distilled representations on zero-shot and few-shot 3D semantic segmentation. To bridge this gap, we propose a relational distillation framework enforcing intra-modal and cross-modal constraints, resulting in distilled 3D representations that closely capture the structure of the 2D representation. This alignment significantly enhances 3D representation performance over those learned through contrastive distillation in zero-shot segmentation tasks. Furthermore, our relational loss consistently improves the quality of 3D representations in both in-distribution and out-of-distribution few-shot segmentation tasks, outperforming approaches that rely on the similarity loss." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.671, + 0.378, + 0.687 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.79, + 0.844 + ], + "angle": 0, + "content": "Understanding 3D scenes is pivotal for robotics applications [19,35], notably in autonomous driving, where accurate navigation and decision-making depend on precise environmental perception. Solving the perception tasks necessary for 3D scene understanding requires the point-wise labelling of LiDAR scenes, which is tedious, compounded by the sparsity of LiDAR data, and costly [28,29]. These issues result in a scarcity of large-scale, diverse point cloud datasets, particularly those aligned with images or text, significantly hampering the development of foundation models for 3D tasks. This shortage is particularly problematic for few-shot or zero-shot learning approaches, which aim to achieve proficiency with" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.401, + 0.128 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.149, + 0.773, + 0.27 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.283, + 0.789, + 0.41 + ], + "angle": 0, + "content": "Fig. 1: We distill 2D representations from CLIP [36] to a 3D point-cloud encoder using the contrastive loss, similarity loss, and our proposed relational loss, and compute the uniformity (U), tolerance (T), and modality gap (G) of the learned 3D representations. We sample 5000 point features from each of the 16 classes defined in the nuScenes dataset [5], apply PCA and visualize the primary components. The source U and T of the CLIP image encoder are 1.54 and 0.73, respectively. Compared to the source, we see that contrastive loss learns 3D representations with higher U and lower T compared to the source, while the trends are reversed for similarity loss. Our proposed relational loss minimizes this structural mismatch and leads to the lowest modality gap." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.426, + 0.789, + 0.457 + ], + "angle": 0, + "content": "minimal or no labelled examples 432. Bridging this gap is vital for creating models adept at understanding complex 3D scenes with limited data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.459, + 0.789, + 0.625 + ], + "angle": 0, + "content": "Contrary to the 3D domain, the 2D and language domains benefit from the availability of large-scale, diverse, and multi-modal datasets, which facilitated the development of Vision Foundation Models (VFMs) [7,30], and Vision-Language Models (VLMs) [36,46]. These models have shown remarkable label efficiency in 2D tasks like image classification and segmentation and have also been used to perform label-free 2D image classification and segmentation through language prompts during inference [26,36]. Due to these advantages, recent approaches for learning 3D representations have relied on the distillation of 2D representations from VFMs [25,27,38] or VLMs [9,33,44] to point cloud encoders, and have shown encouraging results when solving few-shot and zero-shot 3D tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.79, + 0.842 + ], + "angle": 0, + "content": "Unfortunately, the adaptation of 2D-to-3D distillation frameworks for autonomous driving (AD) datasets reveals unique challenges, notably due to the inherent characteristics of AD data. Current frameworks, largely reliant on contrastive learning methods, face the issue of self-similarity [27], a prevalent phenomenon in AD datasets. Self-similarity arises when a significant portion of the training examples belong to a single semantic category (e.g. road, trees or sky in AD data). Under the effect of self-similarity, the contrastive loss mechanism, designed to be hardness-aware [41], inadvertently pushes away semantically similar samples, which not only disrupts the local semantic coherence of the 3D representation [24,27,38] but also amplifies the effects of AD datasets' severe class imbalance. As a result, while such frameworks may result in useful 3D representations for few-shot learning tasks, the misalignment induced by excessive pushing of semantically similar examples undermines their efficacy in zero-shot learning scenarios, where precise cross-modal alignment is crucial. Another approach" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.266 + ], + "angle": 0, + "content": "to distillation relies on the cosine similarity loss, which attempts to learn a 3D representation by driving the features generated for every 3D point by a point encoder to its corresponding 2D feature from VFMs or VLMs. Using the similarity loss results in 3D representations that achieve significantly better performance on the zero-shot tasks compared to ones learned with the contrastive loss. However, we argue in Section 3 that using the similarity loss under-constrains the pretraining when compared to the contrastive loss, resulting in sub-optimal 3D representations on few-shot downstream tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.268, + 0.788, + 0.359 + ], + "angle": 0, + "content": "To highlight the mismatch discussed above, we provide an example visualization of the 3D representation space (Fig. ①), which was obtained by distilling from CLIP's ③ 2D representation space using both the contrastive and similarity losses. We observe that both losses result in 3D representations that diverge from the structure of the 2D representation as measured by uniformity, tolerance, and the modality gap, which we further explain in Section ③." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.359, + 0.788, + 0.448 + ], + "angle": 0, + "content": "In this work, we investigate the impact of state-of-the-art 2D-to-3D distillation frameworks on the structure of learned 3D representations. We show that the choice of loss during pretraining can result in a significant mismatch between the structure of the 2D source representations and the distilled 3D representations. Furthermore, we demonstrate that this mismatch leads to a deterioration in performance on downstream tasks. Our contributions are as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.456, + 0.787, + 0.516 + ], + "angle": 0, + "content": "- Quantify the Gap: We quantify the mismatch in structure when performing distillation using contrastive loss [12,25,38] and similarity loss [17,33] via the uniformity [41,42], tolerance [41], and modality gap [23], revealing a significant gap between 2D and distilled 3D representations." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.516, + 0.787, + 0.621 + ], + "angle": 0, + "content": "- Bridging the Gap using Relational Distillation: We address this mismatch by imposing structural constraints that foster the learning of a 3D representation aligned with the structure of 2D representations. To achieve this, we employ pretraining with intra-modal and cross-modal relational losses. These losses generalize the similarity loss, providing a more effective constraint on the distillation process. Our proposed losses can be applied to pixel-based [25] and superpixel-based [38] distillation frameworks." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.621, + 0.787, + 0.74 + ], + "angle": 0, + "content": "- Bridging the Gap Improves Downstream Performance: Our proposed loss effectively minimizes the mismatch between learned 3D and 2D representations from multiple VLM and VFM image encoders, quantified by differences in the U, T, and G (Fig. 1). Consequently, the resulting 3D representations significantly outperform those learned via contrastive distillation on zero-shot segmentation tasks. Furthermore, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.761, + 0.388, + 0.777 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.789, + 0.562, + 0.804 + ], + "angle": 0, + "content": "2.1 Cross-Modal Knowledge Distillation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.843 + ], + "angle": 0, + "content": "Knowledge Distillation enables a student network to learn a task by mimicking the output of highly-performing teacher networks [13], achieved by using" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.401, + 0.128 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.3 + ], + "angle": 0, + "content": "these output as training targets for the student network [18], or by supervising the student network using the teacher's intermediate representations [37,40,43]. Distilling representations rather than network predictions enables knowledge transfer across different modalities, without requiring labels. In the context of cross-modal distillation, contrastive distillation [12,40] has shown to be the most effective. However, the abundance of self-similarity [27], coupled with the hardness-aware property of contrastive losses [41] limits the effectiveness of contrastive losses for AD data. On the other hand, similarity losses only utilize positive pairs for distillation, resulting in an under-constrained loss, leading to sub-optimal performance on zero-shot tasks [12]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.323, + 0.616, + 0.339 + ], + "angle": 0, + "content": "2.2 3D Representations for Few-Shot Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.35, + 0.789, + 0.653 + ], + "angle": 0, + "content": "Few-shot learning refers to learning the underlying pattern in data from only a few training samples [32]. Distilling 3D representations from 2D self-supervised models [26,7,10,14,15] or VFMs [30,36] has shown to be effective at significantly improving performance on 3D few-shot tasks [24,27,38]. PPKT [25] proposes a pixel-based contrastive loss to distill 2D self-supervised representations to point cloud encoders. While effective in indoor settings, PPKT [25] underperforms in outdoor settings where point-to-pixel correspondences are sparse [38]. Inspired by DetCon [16], SLidR [38] proposes a superpixel-based contrastive loss primarily designed for autonomous driving scenes which constructs region-level contrastive pairs suited for distilling scene-level images [16]. Due to the abundance of self-similarity in AD data [24,27,38], contrastive distillation leads to sub-optimal 3D representations [27]. To address these challenges, ST-SLidR [27] proposes a semantically tolerant contrastive loss leading to improved 3D representations for 3D few-shot segmentation tasks. Finally, Seal [24] demonstrates that object priors from VFMs like SAM [21], represented as superpixels, can improve the quality of 3D representations for 3D few-shot segmentation tasks. In this paper, we demonstrate that pixel and superpixel-based contrastive distillation applied to AD data, learn 3D representations that significantly differ from the structure of 2D representations. This leads to poor performance on zero-shot tasks and unpredictable performance on few-shot tasks." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.677, + 0.62, + 0.693 + ], + "angle": 0, + "content": "2.3 3D Representations for Zero-Shot Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Contrastive Language-Image Pre-training (CLIP) models are pre-trained on billions of webscale image-text pairs and have shown great success in solving zero-shot image classification tasks [36]. Using frozen CLIP vision encoders, Image-Bind [12] enables zero-shot image classification by distilling image-level representations via a contrastive distillation framework. LidarCLIP [17] aligns LiDAR point features to CLIP space, demonstrating effective cross-modal retrieval and image-level zero-shot classification. PointCLIP [44] and PointCLIPv2 [47] propose a distillation-free approach utilizing CLIP vision and text encoders during the inference stage to solve 3D zero-shot classification tasks. More recently," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.346 + ], + "angle": 0, + "content": "MaskCLIP [46] proposes removing the last attention pooling layer in CLIP vision encoders to enable dense feature extraction for 2D zero-shot segmentation tasks. OpenScene [33] distills image features from CLIP models fine-tuned on 2D segmentation datasets [11,22] to point cloud encoders. As demonstrated by ConceptFusion [19] and LERF [20], due to fine-tuning on closed-set 2D segmentation labels, these CLIP models have poor open-set capabilities. During inference, OpenScene fuses image and point features to solve 3D zero-shot segmentation. In this work, we do not assume access to finetuned CLIP models or access to image data during inference time. CLIP2Scene [9] assumes knowledge of class names of objects in the pre-training dataset, which leads to a contrastive loss with fewer false negatives. Requiring class names is problematic as it assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes and limiting open-set capabilities [34]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.366, + 0.381, + 0.384 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.396, + 0.373, + 0.41 + ], + "angle": 0, + "content": "3.1 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.42, + 0.789, + 0.631 + ], + "angle": 0, + "content": "Our objective is to generate useful 3D representations by learning a point cloud encoder, \\( f: \\mathbb{R}^{N \\times (3 + L)} \\to \\mathbb{R}^{N \\times C} \\), through distilling 2D representations from VFMs or VLMs (e.g., CLIP [36], DINOv2 [30]). Using camera-to-LiDAR calibration matrices, we create a set of positive pairs of point, \\( \\mathbf{K}_{\\mathbf{p}} \\in \\mathbb{R}^{N \\times C} \\), and pixel, \\( \\mathbf{Q}_{\\mathbf{p}} \\in \\mathbb{R}^{N \\times C} \\), features, with the latter being generated from the pre-trained image encoder of the foundation model, \\( g: \\mathbb{R}^{N \\times 3} \\to \\mathbb{R}^{N \\times C} \\). While distillation methods like PPKT [25] implement distillation losses by creating pixel-point positive pairs, techniques such as SLidR [38] optimize pair formation by harnessing boundary information from superpixels. SLidR, with \\( M \\) superpixels per image, employs average pooling to group points, \\( \\mathbf{K}_{\\mathbf{p}} \\), and pixels, \\( \\mathbf{Q}_{\\mathbf{p}} \\), into superpoint, \\( \\mathbf{K}_{\\mathbf{sp}} \\in \\mathbb{R}^{M \\times C} \\), and superpixel, \\( \\mathbf{Q}_{\\mathbf{sp}} \\in \\mathbb{R}^{M \\times C} \\), features, improving feature correspondence. Superpixels are derived from unsupervised techniques like SLIC [1], or foundation models such as SAM [21,24]. One of the most effective cross-modal distillation losses is the contrastive loss:" + }, + { + "type": "equation", + "bbox": [ + 0.293, + 0.639, + 0.787, + 0.681 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {c o n} \\left(\\mathbf {K}, \\mathbf {Q}\\right) = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\log \\left[ \\frac {e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\right\\rangle / \\tau\\right)}}{\\sum_ {j \\neq i} e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {j} \\right\\rangle / \\tau\\right)} + e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\right\\rangle / \\tau\\right)}} \\right] (1)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.842 + ], + "angle": 0, + "content": "where \\(\\mathbf{K}\\) and \\(\\mathbf{Q}\\) can either be point/pixel (i.e., \\(\\mathbf{K_p}\\), \\(\\mathbf{Q_p}\\)) or superpoint/superpixel (i.e., \\(\\mathbf{K_{sp}}\\), \\(\\mathbf{Q_{sp}}\\)) feature vectors, \\(B\\) is the number of positive pairs in a mini-batch, \\(\\tau\\) is the temperature, and \\(\\langle \\mathbf{k}_i, \\mathbf{q}_j \\rangle\\) is the dot product between the \\(\\ell_2\\)-normalized features. The contrastive loss distills information from pre-trained image encoders by pulling the point cloud features, \\(K\\), towards their corresponding (positive) image feature, \\(Q\\), in representation space, simultaneously pushing them away from all the other (negative) image features. The temperature, \\(\\tau\\), controls the strength of this push/pull mechanism by modifying the gradient's scale from the negative samples [41]. However, a significant limitation of this approach is the potential degradation in the learned point cloud representation's" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.128 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "quality due to false negative samples [27]. These are image features incorrectly chosen as negative, despite belonging to the same semantic class as the positive point cloud feature, leading to opposing distillation signals." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.193, + 0.785, + 0.223 + ], + "angle": 0, + "content": "To avoid both relying on negative examples while performing distillation, and tuning the temperature parameter, we can use the cosine similarity:" + }, + { + "type": "equation", + "bbox": [ + 0.373, + 0.236, + 0.786, + 0.276 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {s i m} (\\mathbf {K}, \\mathbf {Q}) = \\frac {1}{B} \\sum_ {i = 1} ^ {B} (1. 0 - \\langle \\mathbf {k} _ {i}, \\mathbf {q} _ {i} \\rangle) \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.287, + 0.784, + 0.334 + ], + "angle": 0, + "content": "The similarity loss does not rely on negative samples and thus has a much simpler mode of action. It focuses solely on drawing each point cloud feature, \\(\\mathbf{k}_i\\), nearer to its corresponding image feature, \\(\\mathbf{q}_i\\), effectively maximizing their dot product." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.356, + 0.694, + 0.373 + ], + "angle": 0, + "content": "3.2 Quantifying the Quality of Distilled Representations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.383, + 0.788, + 0.595 + ], + "angle": 0, + "content": "We investigate the quality of the distilled 3D representations as a function of the distillation loss used during training. We hypothesize that if a distilled 3D representation space closely captures the structure of the source 2D representation space, our resulting 3D encoder would: 1) possess the enhanced representation capability of the source vision/vision-language foundation model and 2) generate 3D representations that are well-aligned with the text representations of the vision-language model, enabling zero-shot downstream tasks. To assess the structural similarity between two representation spaces, we utilize uniformity and tolerance, two metrics previously proposed by Wang et al. [41], for evaluating the quality of a representation space. Uniformity measures the distribution of \\(\\ell_2\\)-normalized features on a hyper-sphere. Authors in [42] have demonstrated that a high uniformity is key for high-quality representations as it quantifies that the trained encoder has successfully utilized a substantial part of the available feature space. Uniformity is formulated using a Gaussian potential function as:" + }, + { + "type": "equation", + "bbox": [ + 0.354, + 0.618, + 0.786, + 0.645 + ], + "angle": 0, + "content": "\\[\n\\mathrm {U} (f (\\cdot)) = - \\log \\underset {x, y \\sim p _ {\\mathrm {d a t a}}} {\\mathbb {E}} \\left[ e ^ {- t | | f (x) - f (y) | | _ {2} ^ {2}} \\right] \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.657, + 0.791, + 0.702 + ], + "angle": 0, + "content": "where \\( f(.) \\) is the point encoder and \\( x, y \\) are two samples from the data-distribution \\( p_{\\mathrm{data}} \\). Here, \\( x, y \\) are point features for 3D point encoders. Similarly, we compute the uniformity of \\( U(g(.) \\) ) for the image encoder by setting \\( x, y \\) as pixel features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.703, + 0.785, + 0.733 + ], + "angle": 0, + "content": "On the other hand, tolerance measures the semantic clustering for the \\(\\ell_2\\)-normalized output representations from a given encoder, computed as:" + }, + { + "type": "equation", + "bbox": [ + 0.347, + 0.745, + 0.786, + 0.768 + ], + "angle": 0, + "content": "\\[\nT (f (.) = \\underset {x, y \\sim p _ {\\mathrm {d a t a}}} {\\mathbb {E}} \\left[ \\left(f (x) ^ {T} f (y)\\right) \\cdot I _ {l (x) = l (y)} \\right] \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "where \\( l(x) \\) represents the class label of point \\( x \\). \\( I_{l(x) = l(y)} \\) is an indicator function, having the value of 1 for \\( l(x) = l(y) \\) and the value of 0 for \\( l(x) \\neq l(y) \\). A higher tolerance indicates that the features of all points belonging to a certain class are better clustered together on a unit sphere. Similar to uniformity, we can compute" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.313, + 0.147, + 0.441, + 0.212 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.315, + 0.215, + 0.44, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.315, + 0.269, + 0.44, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.465, + 0.147, + 0.571, + 0.212 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.467, + 0.214, + 0.569, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.467, + 0.268, + 0.568, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.594, + 0.149, + 0.698, + 0.212 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.596, + 0.215, + 0.698, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.597, + 0.268, + 0.698, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.331, + 0.788, + 0.373 + ], + "angle": 0, + "content": "Fig. 2: Blue: The source representation space, with a uniformity and tolerance of \\( \\mathrm{U} = 0.89 \\) and \\( \\mathrm{T} = 0.66 \\), respectively. Cyan: The predicted representation space. Here, \\( t \\) denotes the number of training iterations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.385, + 0.786, + 0.414 + ], + "angle": 0, + "content": "tolerance for the image encoder as \\( T(g(.)) \\), by propagating 3D point-wise labels to 2D image pixels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.415, + 0.786, + 0.446 + ], + "angle": 0, + "content": "Furthermore, to directly compare the alignment of the two representation spaces from different modalities, we also use the modality gap as proposed in [23]:" + }, + { + "type": "equation", + "bbox": [ + 0.353, + 0.459, + 0.786, + 0.484 + ], + "angle": 0, + "content": "\\[\nG (f (.), g (.) = \\underset {x \\sim p _ {\\mathrm {2 D}}} {\\mathbb {E}} [ f (x) ] - \\underset {y \\sim p _ {\\mathrm {3 D}}} {\\mathbb {E}} [ g (y) ] \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.489, + 0.788, + 0.595 + ], + "angle": 0, + "content": "The modality gap measures the difference between the mean of the representation of the point features and their corresponding pixel features. We conclude by noting that unlike G, U and T are properties of a single encoder; we show the difference in representations by comparing the values of \\( U(f(.)) \\) and \\( T(f(.)) \\) to \\( U(g(.)) \\) and \\( T(g(.)) \\), respectively. Closer values indicate our point cloud encoder well-approximates the representation space of the source image encoder, which we show in Section 4 to be beneficial for downstream tasks." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.618, + 0.691, + 0.634 + ], + "angle": 0, + "content": "3.3 The Representations of Common Distillation Losses" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.765 + ], + "angle": 0, + "content": "Inspired by [39], we explore the structure of the learned representation space using contrastive loss and similarity loss through a toy example. We start with 1000 uniformly distributed points over a 3D unit sphere, representing point features before the distillation phase. Using a 2-layer MLP, we learn to align each input point with its corresponding pixel feature from the source representation space, defined by U and T levels of 0.89 and 0.66, respectively. We use the Adam optimizer with a learning rate of \\(10^{-4}\\) and train our model for 50,000 iterations (refer to Appendix A for detailed analysis)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Figure 2 shows a visualization of the source representation space (blue) and the predicted representation space (cyan) at various stages of training. The top row highlights a significant difference: the contrastive losses generate a representation space with a high U of 1.38, but with a very low T of 0.02, differing significantly from the source space's U (0.89) and T (0.66). This is attributed" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.401, + 0.128 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.268 + ], + "angle": 0, + "content": "to self-similarity [27], a phenomenon that occurs when points from the source representation space are close to one another, as in our toy example. Although the contrastive loss moves a particular prediction to its corresponding point in the source, its hardness-awareness property [41] pushes all other predictions, particularly close ones, away from that point. Combined with self-similarity, this yields a uniform predicted space with a low T, and a significant modality gap. As demonstrated in Section 4, this discrepancy hinders zero-shot task performance due to inadequate cross-modal alignment." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.269, + 0.79, + 0.466 + ], + "angle": 0, + "content": "On the other hand, learning with similarity loss leads to representations with lower U (0.59) and higher T (0.80) compared to the source. This stems from the tendency of similarity loss to form compact clusters in the predicted space, as shown with autonomous driving data in Figure 1 and the toy example in Figure 2. Notably, early training \\((t = 1000)\\) exhibits noticeable clustering that disperses with additional epochs. Additionally, the non-uniqueness of the dot product between the learnable point vector, \\(\\mathbf{k}_i\\), and the fixed pixel vector, \\(\\mathbf{q}_i\\), within the framework of similarity loss (Eq. 2) results in a significant increase in the number of learnable vectors that can achieve the same cosine similarity with the fixed vector, \\(\\mathbf{q}_i\\). This growth can result in slow convergence and suboptimal predicted representation spaces. Combined with neural network optimization complexities, these issues lead to the observed disparity in uniformity and tolerance from the source representation space in distillation tasks using similarity loss." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.493, + 0.39, + 0.506 + ], + "angle": 0, + "content": "3.4 Relational Loss" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.523, + 0.788, + 0.613 + ], + "angle": 0, + "content": "Inspired by distilling relations in model compression [31], this section presents two relational losses that impose structural constraints on the 3D representation space. This modification disrupts the symmetry inherent in the similarity loss. It drives the network to select solutions that, while possessing equivalent similarity loss values to alternatives, yield a 3D representation space that more accurately mirrors the structure of the image representation space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.615, + 0.788, + 0.69 + ], + "angle": 0, + "content": "Cross-modal Relational Loss We propose imposing a constraint on the structure of the learned 3D representation space to ensure that the similarities between a given predicted point feature, \\(\\mathbf{k}_i\\), and all source pixel features align with the similarities between its corresponding pixel feature, \\(\\mathbf{q}_i\\), and all other source pixel features in the same batch. The cross-modal relation loss is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.233, + 0.703, + 0.786, + 0.837 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal{L}_{cross}\\left(\\mathbf{K},\\mathbf{Q}\\right) = \\frac{1}{N}\\sum_{i = 1}^{N}\\mathbf{C}_{ii} + \\frac{1}{N^{2} - N}\\sum_{i = 1}^{N}\\sum_{\\substack{j = 1\\\\ i\\neq j}}^{N}\\mathbf{C}_{ij} \\\\ = \\underbrace {\\frac {1}{N} \\sum_ {i = 1} ^ {N} \\left(1 . 0 - \\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\rangle\\right)} _ {\\mathcal {L} _ {s i m} (\\mathbf {K}, \\mathbf {Q})} + \\frac {1}{N ^ {2} - N} \\sum_ {i = 1} ^ {N} \\sum_ {\\substack {j = 1 \\\\ i \\neq j}} ^ {N} | \\langle \\mathbf {k} _ {i}, \\mathbf {q} _ {j} \\rangle - \\langle \\mathbf {q} _ {i}, \\mathbf {q} _ {j} \\rangle | \\tag{6} \\\\ \\end{array}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.784, + 0.283 + ], + "angle": 0, + "content": "where \\(\\mathbf{C} = |\\mathbf{KQ}^T -\\mathbf{QQ}^T|\\) represents the matrix of differences, capturing the discrepancy between the predicted point-to-pixel and the source pixel-to-pixel similarities. First, the matrix's diagonal components, \\(\\mathbf{C}_{ii}\\), are directly linked to the similarity loss, underscoring the necessity of aligning each point feature with its corresponding source pixel feature. The second term of Equation 6 facilitates learning a point feature, \\(\\mathbf{k}_i\\), that is not only close to its corresponding source pixel feature, \\(\\mathbf{q}_i\\), but is also consistent with \\(\\mathbf{q}_i\\)'s similarities to other pixel features, \\(\\langle \\mathbf{q}_i,\\mathbf{q}_j\\rangle\\), where \\(j\\neq i\\). These cross-modal constraints foster learning point features that maintain the relational structure within the image representation space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.289, + 0.785, + 0.455 + ], + "angle": 0, + "content": "Intra-modal Relational Loss Another strategy to ensure structural similarity between the 3D and 2D representation spaces involves directly penalizing differences in their relational graphs. A relational graph of a representation space can be understood as a graph with the nodes representing point or pixel features, and edges indicating the similarity between node features. We represent the relational graph of the point features and the pixel features using \\(\\mathbf{K}\\mathbf{K}^T\\) and \\(\\mathbf{Q}\\mathbf{Q}^T\\), respectively. Here, \\(\\langle \\mathbf{k}_i,\\mathbf{k}_j\\rangle\\) represents the similarity between the \\(i^{th}\\) and the \\(j^{th}\\) predicted point feature. We denote the discrepancy of the relational graphs as \\(\\mathbf{U} = |\\mathbf{K}\\mathbf{K}^T -\\mathbf{Q}\\mathbf{Q}^T|\\). Since this matrix is symmetric, and its diagonal elements, \\(|\\langle \\mathbf{k}_i,\\mathbf{k}_i\\rangle -\\langle \\mathbf{q}_i,\\mathbf{q}_i\\rangle |\\), degenerate to 0, the intra-modal relational loss is expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.365, + 0.478, + 0.785, + 0.518 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {i n t r a}} (\\mathbf {K}, \\mathbf {Q}) = \\frac {2}{N ^ {2} - N} \\sum_ {i = 1} ^ {N - 1} \\sum_ {j = i + 1} ^ {N} \\mathbf {U} _ {i j} \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.542, + 0.784, + 0.618 + ], + "angle": 0, + "content": "The consequence of this loss on the structure of the point representation space is simple; the similarity between a predicted point feature and other predicted point features in a batch should match the similarity between its corresponding source pixel feature and other source pixel features in the same batch. Our proposed relational loss is a combination of the two losses:" + }, + { + "type": "equation", + "bbox": [ + 0.348, + 0.644, + 0.785, + 0.659 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {r e l} (\\mathbf {K}, \\mathbf {Q}) = \\mathcal {L} _ {i n t r a} (\\mathbf {K}, \\mathbf {Q}) + \\mathcal {L} _ {c r o s s} (\\mathbf {K}, \\mathbf {Q}) \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Unlike the similarity loss, the proposed loss ensures learned point cloud features align with image features in a structured manner, preserving the data's inherent relationships. Figure 2 reveals two key advantages of relational loss over similarity loss: closer alignment of the predicted space's U and T with those of the source space, alongside a reduced G between the two spaces. Additionally, the relational loss achieves faster convergence, as the visual appearance of the predicted representation space resulting from learning with the relational loss remains consistent from the mid-point of training (t=25000) to its conclusion (t=50000). In Section 4 we further illustrate how these attributes of the relational loss contribute to enhanced performance in downstream tasks." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.401, + 0.128 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.377, + 0.163 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.188, + 0.366, + 0.205 + ], + "angle": 0, + "content": "4.1 Pre-training" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.224, + 0.788, + 0.331 + ], + "angle": 0, + "content": "Backbones We focus on distilling 2D representations from two vision foundation models, CLIP [36], pretrained on the WIT dataset containing 400 million image-text pairs, and DINOv2 [30], pretrained on the LVD-142 dataset containing 142 million images. For CLIP encoders, we experiment with different pre-trained architectures available from OpenAI [36]. For the 3D backbone, we use a randomly initialized Minkowski U-Net [38]. For details on the design of the 2D and 3D projection layers, refer to Appendix C." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.331, + 0.788, + 0.424 + ], + "angle": 0, + "content": "Dataset In the pre-training phase we use the nuScenes dataset [5], consisting of 700 scenes. In line with previous works [24,27,38], these scenes are divided into two subsets: 600 scenes for pre-training and 100 scenes for the determination of the best hyper-parameters. Throughout this pre-training process, we exclusively employ keyframes from the 600 scenes to train all models. For pre-training hyperparameters and data-augmentation details, refer to Appendix B." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.455, + 0.352, + 0.469 + ], + "angle": 0, + "content": "4.2 Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.491, + 0.788, + 0.672 + ], + "angle": 0, + "content": "To study the effect of the distillation framework on the structure of the 3D representations, we evaluate the average U, T, and G between the distilled 3D and source 2D representations. For both pixel-based and superpixel-based losses, U, T, and G are evaluated using point or pixel features. To assess the relationship between the performance on downstream tasks and the difference in the structure of the 2D and the 3D representation spaces, we use the in-distribution 3D few-shot segmentation task, where we learn a classifier by finetuning the 3D representations on \\(1\\%\\) of the labels of the nuScenes training set. Similar to [27,38], we also evaluate the utility of the distilled representations in the out-of-distribution setting by fine-tuning on \\(1\\%\\) of the SemanticKITTI [3] dataset. The nuScenes and SemanticKITTI datasets contain 16 and 19 classes, respectively. We present our results using the official validation sets for these datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.827 + ], + "angle": 0, + "content": "For DINOv2, we follow [27,38] and evaluate the Linear Probing performance on nuScenes by freezing the backbone of the point cloud encoder and training a linear classifier on \\(100\\%\\) of the labels. For CLIP models, we evaluate the 3D zero-shot segmentation tasks which can be performed with language prompts. To enable openset scene understanding, during pretraining, we assume we have no access to nuScenes class labels. Similar to [46], we apply prompt engineering during inference using 85 hand-crafted prompts for each class label, and then use the CLIP text encoder to compute an average text embedding for each class. Each point is then assigned the label that corresponds to the highest cosine similarity, computed between the point features and the CLIP text embeddings." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.784, + 0.173 + ], + "angle": 0, + "content": "Table 1: Evaluation of 3D representations from CLIP image encoder with source U of 1.54, and source T of 0.73. Best results are bolded and second best are underlined." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.185, + 0.782, + 0.298 + ], + "angle": 0, + "content": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
CLIP 36PPKT 253.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.60
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR 383.50900.44720.0015316.8246.7646.53
ST-SLidR 273.50000.45440.0015018.5447.1346.84
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.313, + 0.785, + 0.34 + ], + "angle": 0, + "content": "Table 2: Evaluation of 3D representations from DINOv2 image encoder with source U of 2.8, and source T of 0.51. Best results are bolded and second best are underlined." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.354, + 0.785, + 0.464 + ], + "angle": 0, + "content": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Lin. Probing 100%Finetuning 1%Finetuning 1%
DINOv2 30PPKT 253.6250.44510.0006048.5043.3043.62
Simpl2.1760.69260.0003049.7245.8548.32
Relpl (ours)2.3930.65880.0002049.2046.9049.00
SLidR 383.6550.37390.0004449.6044.8142.23
ST-SLidR 273.5890.43260.0004253.0047.1145.61
Simspl2.2860.65220.0003052.3047.2349.01
Relspl (ours)2.5040.63120.0002352.9248.4249.10
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.495, + 0.325, + 0.508 + ], + "angle": 0, + "content": "4.3 Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.785, + 0.627 + ], + "angle": 0, + "content": "Baselines In Tab. 1 and Tab. 2, we present the results of distilling CLIP and DINOv2 models using our proposed relational loss. We compare against multiple state-of-the-art contrastive losses including PPKT [25], SLidR [38], and ST-SLidR [27]. For superpixel-based losses, masks are generated using SAM [21]. As an additional baseline, we report results for both the pixel-based and superpixel-based similarity loss, which we denote as \\(\\mathrm{Sim}_{pl}\\) and \\(\\mathrm{Sim}_{spl}\\), respectively. We report the average over 3 runs for all metrics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Uniformity, tolerance, and closing the modality gap Looking at distillation losses from the 2D CLIP encoder in Tab. [1] we first observe that U of 3D representations distilled using contrastive loss (i.e., PPKT, SLidR and ST-SLidR) is higher than the source U of 1.54, while U of similarity loss (i.e., \\(\\mathrm{Sim}_{pl}\\), \\(\\mathrm{Sim}_{spl}\\)) is lower than the U of the source. This is also observed when distilling from DINOv2. The relational constraints (i.e., \\(\\mathrm{Rel}_{pl}\\), \\(\\mathrm{Rel}_{spl}\\)) effectively close the gap between 3D representations distilled by similarity loss (i.e., \\(\\mathrm{Sim}_{pl}\\), \\(\\mathrm{Sim}_{spl}\\)) and 2D representations. For instance, when the pixel-based loss \\(\\mathrm{Rel}_{pl}\\) is applied to CLIP, relational constraints close the gap in U resulting in a 3D representation with a U of 0.9089, instead of 0.5519, thus closer to the U of the source (1.54). Similarly, for the superpixel-based loss, \\(\\mathrm{Rel}_{spl}\\), relational constraints close the gap in U resulting in a 3D representation with a U of 1.099, instead of 0.5919, thus closer to the U of the source (1.54). In addition, relational losses result in semantic clusters that are closer to the T of the source. By closing the gap" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.401, + 0.128 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.785, + 0.173 + ], + "angle": 0, + "content": "Table 3: Performance for different CLIP backbones using pixel-based and superpixel-based relational loss. Best results are bolded and second best are underlined." + }, + { + "type": "table", + "bbox": [ + 0.233, + 0.185, + 0.77, + 0.414 + ], + "angle": 0, + "content": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
ViT-B32PPKT3.51100.52030.0002014.2143.2945.89
Simpl0.58040.93890.0001022.8444.2244.30
Relpl (ours)0.96050.89890.0001023.8544.6745.62
SLidR3.51300.47060.0003015.5543.3843.82
Simspl0.60090.93230.0001125.4644.8345.69
Relspl (ours)1.20200.86480.0000725.6645.6047.26
ViT-B16PPKT3.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.59
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR3.50900.44720.0015316.8246.7646.53
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
ViT-L14PPKT3.50200.52030.0008916.2844.6946.69
Simpl0.69090.92570.0001627.9144.8744.80
Relpl (ours)0.87750.90270.0001327.7445.9245.86
SLidR3.48000.44030.0006518.3147.3446.86
Simspl0.73110.91020.0002030.7745.7645.29
Relspl (ours)0.90190.88730.0001730.1147.0746.81
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.445, + 0.787, + 0.492 + ], + "angle": 0, + "content": "in U and T, relational constraints result in the lowest G for pixel-based and superpixel-based losses. These results align well with the ones presented on the toy example in Section 3, which further supports the validity of our analysis." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.789, + 0.734 + ], + "angle": 0, + "content": "Zero-shot performance Looking at the utility of the 3D representations for 3D zero-shot segmentation in Tab. [1] we observe that the contrastive loss (i.e., PPKT, SLidR and ST-SLidR) has significantly worse 3D zero-shot mean IOU when compared to the similarity loss. This is contrary to the conclusion reached by ImageBind [12], which observed that the contrastive loss achieves \\(6\\%\\) improvement on 2D zero-shot tasks compared to similarity losses. We hypothesize that the abundance of self-similarity in AD datasets, coupled with the hardness-aware property of contrastive loss [27], leads to pushing away semantically similar point and pixel features. This, in turn, results in poor alignment between point features and CLIP image features. Notably, we observe that ST-SLidR improves zero-shot performance compared to SLidR (18.54% vs 16.82%) as it utilizes the superpixel feature similarities to exclude a portion of the false negative samples from the pool of negative samples. Without resorting to negative samples, relational constraints minimize the 2D-to-3D structural gap compared to similarity loss, leading to improvements in zero-shot performance from 20.84% to 23.53% for pixel-based losses, and from 23.93% to 26.03% for superpixel-based losses." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.79, + 0.842 + ], + "angle": 0, + "content": "In Tab. 4, we compare pixel and superpixel-based relational losses to SOTA methods. All methods distill from CLIP [36], with the performance on nuScenes provided by [8]. Methods are further categorized based on the prior knowledge required during the distillation phase. Some methods require class names defined for a dataset [8,9], while others utilize SAM to refine CLIP predictions [8]. Requiring class names assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes, thus" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.158, + 0.495, + 0.198 + ], + "angle": 0, + "content": "Table 4: Zero-shot segmentation performance of relational loss compared to state-of-the-art methods." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.2, + 0.502, + 0.293 + ], + "angle": 0, + "content": "
MethodPublicationClass Names RequiredUses SAM3D mIoU
MaskCLIP 46ECCV 2022✗✗12.80
OpenScene 33CVPR 2023✗✗14.60
CLIP2Scene 9CVPR 2023✓✗20.80
Relpl (ours)-✗✗23.53
TLF 8NeurIPS 2023✓✓26.80
Relspl (ours)-✗✓26.03
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.303, + 0.495, + 0.343 + ], + "angle": 0, + "content": "Table 5: Effect of relational loss components. Distilling from CLIP image encoder with source U of 1.54 and T of 0.73." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.345, + 0.508, + 0.443 + ], + "angle": 0, + "content": "
LossUniformityToleranceModality GapnuScenesKITTI
ZSFt 1%Ft 1%
\\( Sim_{pl} \\)0.55190.94770.0004520.8444.3945.59
+cross0.64260.93860.0004221.3945.9545.45
+intra0.90890.91450.0003323.5345.6746.06
\\( Sim_{spl} \\)0.59190.93330.0004023.9345.6346.42
+cross0.76560.90860.0003325.0546.1846.99
+intra1.09900.87000.0001926.0347.2247.52
" + }, + { + "type": "table_caption", + "bbox": [ + 0.509, + 0.166, + 0.788, + 0.249 + ], + "angle": 0, + "content": "Table 6: Improvement of finetuned models with respect to majority versus minority classes. Similar to ST-SLidR [27], We group classes based on whether their superpixels occupy more than \\(5\\%\\) of the superpixels in nuScenes training set." + }, + { + "type": "table", + "bbox": [ + 0.526, + 0.251, + 0.779, + 0.435 + ], + "angle": 0, + "content": "
2D EncoderLossMajority (mIoU)Minority (mIoU)
CLIP\\( Sim_{pl} \\)69.1633.35
\\( Rel_{pl} \\)69.5934.80
\\( Gain \\)+0.43+1.45
\\( Sim_{spl} \\)67.5836.06
\\( Rel_{spl} \\)67.7538.77
\\( Gain \\)+0.17+2.71
DINOv2\\( Sim_{pl} \\)70.8934.24
\\( Rel_{pl} \\)71.2235.85
\\( Gain \\)+0.33+1.61
\\( Sim_{spl} \\)68.1538.53
\\( Rel_{spl} \\)68.8040.20
\\( Gain \\)+0.65+1.67
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.476, + 0.788, + 0.825 + ], + "angle": 0, + "content": "limiting openset capabilities [34]. Without using class information, we observe in Tab. 4 that \\(\\mathrm{Rel}_{pl}\\) performs the best compared to other pixel-based losses, while our superpixel-based relational loss, \\(\\mathrm{Rel}_{spl}\\), is within \\(1\\%\\) from state-of-the-art [8]. Few-shot performance We evaluate the effectiveness of 3D representations in both in-distribution (namely, nuScenes) and out-of-distribution (namely, SemanticKITTI) settings. For representations distilled from CLIP in Tab. 1, we observe that the limited U of representations distilled through similarity losses, as opposed to the source, leads to comparatively weaker performance on indistribution tasks with few-shot learning when compared with contrastive loss. For instance, ST-SLidR representations enhance performance on the nuScenes dataset by \\(+1.5\\%\\) compared to \\(\\mathrm{Sim}_{spl}\\). Furthermore, by applying relational constraints and without the need for negative samples, we can bridge the U gap. This results in \\(\\mathrm{Rel}_{spl}\\) outperforming \\(\\mathrm{Sim}_{spl}\\) by \\(+1.59\\%\\) and \\(+1.1\\%\\) on nuScenes and SemKITTI, respectively. When examining 3D representations distilled from DI-NOv2 in Tab. 2, we note a source U of 2.8. Here, the similarity loss closely aligns with the source's U more than the contrastive loss. The contrastive loss (PPKT and SLidR) shows significantly poorer performance compared to the similarity loss. Additionally, 3D representations distilled by ST-SLidR attain a U of 3.589 and a T of 0.4326, aligning more closely with the source U and T of 2.8 and 0.51 than those distilled by the SLidR loss. Lastly, we find that relational constraints narrow the G more effectively than similarity losses, thereby enhancing the few-shot performance by \\(+1.05\\%\\) and \\(+1.19\\%\\) on pixel and superpixel-based losses, respectively, on the nuScenes dataset compared to similarity losses." + }, + { + "type": "text", + "bbox": [ + 0.221, + 0.825, + 0.787, + 0.843 + ], + "angle": 0, + "content": "CLIPBackbonesTab.3 depicts the performance of contrastive,similarity," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.401, + 0.128 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.373 + ], + "angle": 0, + "content": "and relational losses when distilling from different CLIP backbones. Relational losses achieve the lowest modality gap, surpassing both contrastive and similarity loss across all 2D encoders. In zero-shot tasks, relational losses either match or exceed the performance of similarity losses, whereas contrastive distillation consistently underperforms. The performance of contrastive distillation on few-shot tasks proves unpredictable. For instance, distilling from ViT-B32 using similarity loss \\(\\mathrm{Sim}_{spl}\\) surpasses distilling using contrastive loss SLidR in mIOU by \\(+1.45\\%\\) and \\(+1.87\\%\\) on nuScenes and SemanticKITTI, respectively. Conversely, distilling from ViT-L14, SLidR achieves competitive performance, outperforming similarity loss \\(\\mathrm{Sim}_{spl}\\) by \\(+1.58\\%\\) and \\(+1.57\\%\\) on the same datasets. Notably, relational losses bridge the gap in few-shot learning while maintaining robust zero-shot task performance. This indicates that relational losses utilize inherent 2D representation relationships, avoiding ungrounded negative samples common in contrastive loss, which facilitates learning representations more aligned with the source's U, thereby enhancing few-shot task performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.374, + 0.788, + 0.509 + ], + "angle": 0, + "content": "Class Imbalance We investigate the performance of finetuned models on semantic segmentation using 3D representations distilled using similarity and relational losses. Similar to ST-SLidR [27], we distinguish between majority and minority classes based on the percentage of superpixels they occupy in the nuScenes dataset. The 11 classes occupying less than \\(5\\%\\) of the superpixels are considered to be in the minority set, while the remaining classes are in the majority set. In Tab. 6 compared to similarity losses, relational losses learn representations that significantly improve performance on minority classes for pixel and superpixel-based losses without degrading performance on majority classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.788, + 0.631 + ], + "angle": 0, + "content": "Relational Loss Ablation We investigate the contribution of cross-modal and intra-modal constraints for pixel-based and superpixel-based losses. In Tab. 5, we observe that both constraints lead to learning 3D representations that are closer to the source U and T, and thus result in a lower G compared to similarity losses. Moreover, both constraints lead to improved performance on zero-shot and few-shot segmentation tasks. Interestingly, the superpixel-based relational loss with both constraints (last row) results in the smallest gap in U and T compared to other losses, leading to the best performance on semantic segmentation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.655, + 0.36, + 0.673 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In this work, we study the impact of the state-of-the-art 2D-to-3D distillation frameworks when applied to AD datasets on the structure of the learned 3D representation. We reveal a significant structural gap between the 2D and the 3D representations and show that this gap is negatively correlated with the utility of the learned 3D representations for solving 3D zero-shot and few-shot segmentation tasks. Our proposed relational loss bridges this structural gap, resulting in well-aligned 3D representations that outperform representations learned via contrastive loss on zero-shot segmentation tasks. In addition, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.179, + 0.786, + 0.222 + ], + "angle": 0, + "content": "1. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Susstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE TPAMI 34(11), 2274-2282 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.223, + 0.786, + 0.25 + ], + "angle": 0, + "content": "2. Bardes, A., Ponce, J., Lecun, Y.: Vicreg: Variance-invariance-covariance regularization for self-supervised learning. In: ICLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.251, + 0.786, + 0.292 + ], + "angle": 0, + "content": "3. Behley, J., Garbade, M., Milioto, A., Quenzel, J., Behnke, S., Stachniss, C., Gall, J.: SemanticKITTI: A Dataset for Semantic Scene Understanding of LiDAR Sequences. In: ICCV (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.293, + 0.786, + 0.335 + ], + "angle": 0, + "content": "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.336, + 0.786, + 0.377 + ], + "angle": 0, + "content": "5. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuscenes: A multimodal dataset for autonomous driving. In: CVPR. pp. 11621-11631 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.378, + 0.786, + 0.418 + ], + "angle": 0, + "content": "6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. NeurIPS 33, 9912-9924 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.786, + 0.461 + ], + "angle": 0, + "content": "7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.462, + 0.786, + 0.503 + ], + "angle": 0, + "content": "8. Chen, R., Liu, Y., Kong, L., Chen, N., Xinge, Z., Ma, Y., Liu, T., Wang, W.: Towards label-free scene understanding by vision foundation models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.504, + 0.786, + 0.559 + ], + "angle": 0, + "content": "9. Chen, R., Liu, Y., Kong, L., Zhu, X., Ma, Y., Li, Y., Hou, Y., Qiao, Y., Wang, W.: Clip2scene: Towards label-efficient 3d scene understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7020-7030 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.56, + 0.786, + 0.587 + ], + "angle": 0, + "content": "0. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.588, + 0.786, + 0.629 + ], + "angle": 0, + "content": "1. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: European Conference on Computer Vision. pp. 540-557. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.63, + 0.786, + 0.685 + ], + "angle": 0, + "content": "2. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind: One embedding space to bind them all. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15180-15190 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.687, + 0.786, + 0.713 + ], + "angle": 0, + "content": "3. Gou, J., Yu, B., Maybank, S.J., Tao, D.: Knowledge distillation: A survey. International Journal of Computer Vision 129, 1789-1819 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.715, + 0.786, + 0.757 + ], + "angle": 0, + "content": "4. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P.H., Buchatskaya, E., Doersch, C., Pires, B.A., Guo, Z.D., Azar, M.G., et al.: Bootstrap your own latent: A new approach to self-supervised learning. arXiv preprint arXiv:2006.07733 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.786, + 0.799 + ], + "angle": 0, + "content": "5. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.786, + 0.841 + ], + "angle": 0, + "content": "6. Henaff, O.J., Koppula, S., Alayrac, J.B., Van den Oord, A., Vinyals, O., Carreira, J.: Efficient visual pretraining with contrastive detection. In: ICCV. pp. 10086-10096 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.179, + 0.786, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.4, + 0.127 + ], + "angle": 0, + "content": "A. Mahmoud et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "17. Hess, G., Tonderski, A., Petersson, C., Åström, K., Svensson, L.: Lidarclip or: How i learned to talk to point clouds. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 7438-7447 (January 2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.205, + 0.786, + 0.233 + ], + "angle": 0, + "content": "18. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.234, + 0.787, + 0.288 + ], + "angle": 0, + "content": "19. Jatavallabhula, K., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., Tenenbaum, J., de Melo, C., Krishna, M., Paull, L., Shkurti, F., Torralba, A.: Conceptfusion: Open-set multimodal 3d mapping. Robotics Science and Systems (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.29, + 0.787, + 0.331 + ], + "angle": 0, + "content": "20. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: Lerf: Language embedded radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 19729-19739 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.333, + 0.787, + 0.387 + ], + "angle": 0, + "content": "21. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., Dollar, P., Girshick, R.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 4015-4026 (October 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.389, + 0.787, + 0.416 + ], + "angle": 0, + "content": "22. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: ICLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.418, + 0.787, + 0.459 + ], + "angle": 0, + "content": "23. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.46, + 0.787, + 0.5 + ], + "angle": 0, + "content": "24. Liu, Y., Kong, L., Cen, J., Chen, R., Zhang, W., Pan, L., Chen, K., Liu, Z.: Segment any point cloud sequences by distilling vision foundation models. In: Advances in Neural Information Processing Systems (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.787, + 0.543 + ], + "angle": 0, + "content": "25. Liu, Y.C., Huang, Y.K., Chiang, H.Y., Su, H.T., Liu, Z.Y., Chen, C.T., Tseng, C.Y., Hsu, W.H.: Learning from 2d: Contrastive pixel-to-point knowledge transfer for 3d pretraining. arXiv preprint arXiv:2104.04687 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.545, + 0.787, + 0.585 + ], + "angle": 0, + "content": "26. Mahmoud, A., Elhoushi, M., Abbas, A., Yang, Y., Ardalani, N., Leather, H., Morcos, A.S.: Sieve: Multimodal dataset pruning using image captioning models. In: CVPR. pp. 22423-22432 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.587, + 0.787, + 0.642 + ], + "angle": 0, + "content": "27. Mahmoud, A., Hu, J.S.K., Kuai, T., Harakeh, A., Paull, L., Waslander, S.L.: Self-supervised image-to-point distillation via semantically tolerant contrastive loss. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7102-7110 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.787, + 0.684 + ], + "angle": 0, + "content": "28. Mahmoud, A., Hu, J.S., Waslander, S.L.: Dense voxel fusion for 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 663-672 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.686, + 0.787, + 0.727 + ], + "angle": 0, + "content": "29. Mahmoud, A., Waslander, S.L.: Sequential fusion via bounding box and motion pointpainting for 3d objection detection. In: 18th Conference on Robots and Vision (CRV) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.728, + 0.787, + 0.769 + ], + "angle": 0, + "content": "30. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.771, + 0.787, + 0.812 + ], + "angle": 0, + "content": "31. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3967-3976 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.814, + 0.787, + 0.84 + ], + "angle": 0, + "content": "32. Parnami, A., Lee, M.: Learning from few examples: A summary of approaches to few-shot learning. arXiv preprint arXiv:2203.04291 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.275, + 0.115, + 0.734, + 0.13 + ], + "angle": 0, + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.203 + ], + "angle": 0, + "content": "33. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T., et al.: Openscene: 3d scene understanding with open vocabularies. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 815-824 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.204, + 0.788, + 0.245 + ], + "angle": 0, + "content": "34. Puy, G., Gidaris, S., Boulch, A., Simeoni, O., Sautier, C., Perez, P., Bursuc, A., Marlet, R.: Revisiting the distillation of image representations into point clouds for autonomous driving. arXiv preprint arXiv:2310.17504 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.245, + 0.788, + 0.286 + ], + "angle": 0, + "content": "35. Qian, J., Chatrath, V., Yang, J., Servos, J., Schoellig, A.P., Waslander, S.L.: Pocd: Probabilistic object-level change detection and volumetric mapping in semi-static scenes. Robotics: Science and Systems (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.286, + 0.788, + 0.342 + ], + "angle": 0, + "content": "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.342, + 0.788, + 0.37 + ], + "angle": 0, + "content": "37. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.37, + 0.788, + 0.411 + ], + "angle": 0, + "content": "38. Sautier, C., Puy, G., Gidaris, S., Boulch, A., Bursuc, A., Marlet, R.: Image-to-lidar self-supervised distillation for autonomous driving data. In: CVPR. pp. 9891-9901 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.411, + 0.788, + 0.453 + ], + "angle": 0, + "content": "39. Shi, P., Welle, M.C., Björkman, M., Kragic, D.: Towards understanding the modality gap in CLIP. In: ICLR 2023 Workshop on Multimodal Representation Learning: Perks and Pitfalls (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.481 + ], + "angle": 0, + "content": "40. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.481, + 0.788, + 0.508 + ], + "angle": 0, + "content": "41. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: CVPR. pp. 2495-2504 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.55 + ], + "angle": 0, + "content": "42. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.55, + 0.788, + 0.592 + ], + "angle": 0, + "content": "43. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.592, + 0.788, + 0.633 + ], + "angle": 0, + "content": "44. Zhang, R., Guo, Z., Zhang, W., Li, K., Miao, X., Cui, B., Qiao, Y., Gao, P., Li, H.: Pointclip: Point cloud understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8552-8562 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.661 + ], + "angle": 0, + "content": "45. Zhang, Z., Girdhar, R., Joulin, A., Misra, I.: Self-supervised pretraining of 3d features on any point-cloud. In: ICCV. pp. 10252-10263 (October 2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.661, + 0.788, + 0.689 + ], + "angle": 0, + "content": "46. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.716 + ], + "angle": 0, + "content": "47. Zhu, X., Zhang, R., He, B., Zeng, Z., Zhang, S., Gao, P.: Pointclip v2: Adapting clip for powerful 3d open-world learning. arXiv preprint arXiv:2211.11682 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.716 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_origin.pdf b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..52018e2d9c4b60afacf6e4b2ac78f7add111b867 --- /dev/null +++ b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/f9d43655-39ac-4ecf-934f-5e031d7d33a8_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b4b13c716a2c736d17a855c9c4c6515c3a7946333d929dd3ebfc15058aa0e2fa +size 6130628 diff --git a/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/full.md b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/full.md new file mode 100644 index 0000000000000000000000000000000000000000..645ffbdd0d4ec21da1dd3d9021f4e57b3289b7d4 --- /dev/null +++ b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/full.md @@ -0,0 +1,273 @@ +# Image-to-Lidar Relational Distillation for Autonomous Driving Data + +Anas Mahmoud1, Ali Harakeh2, and Steven Waslander1 + +1 University of Toronto + +2 Mila - Quebec AI Institute + +Abstract. Pre-trained on extensive and diverse multi-modal datasets, 2D foundation models excel at addressing 2D tasks with little or no downstream supervision, owing to their robust representations. The emergence of 2D-to-3D distillation frameworks has extended these capabilities to 3D models. However, distilling 3D representations for autonomous driving datasets presents challenges like self-similarity, class imbalance, and point cloud sparsity, hindering the effectiveness of contrastive distillation, especially in zero-shot learning contexts. Whereas other methodologies, such as similarity-based distillation, enhance zero-shot performance, they tend to yield less discriminative representations, diminishing few-shot performance. We investigate the gap in structure between the 2D and the 3D representations that result from state-of-the-art distillation frameworks and reveal a significant mismatch between the two. Additionally, we demonstrate that the observed structural gap is negatively correlated with the efficacy of the distilled representations on zero-shot and few-shot 3D semantic segmentation. To bridge this gap, we propose a relational distillation framework enforcing intra-modal and cross-modal constraints, resulting in distilled 3D representations that closely capture the structure of the 2D representation. This alignment significantly enhances 3D representation performance over those learned through contrastive distillation in zero-shot segmentation tasks. Furthermore, our relational loss consistently improves the quality of 3D representations in both in-distribution and out-of-distribution few-shot segmentation tasks, outperforming approaches that rely on the similarity loss. + +# 1 Introduction + +Understanding 3D scenes is pivotal for robotics applications [19,35], notably in autonomous driving, where accurate navigation and decision-making depend on precise environmental perception. Solving the perception tasks necessary for 3D scene understanding requires the point-wise labelling of LiDAR scenes, which is tedious, compounded by the sparsity of LiDAR data, and costly [28,29]. These issues result in a scarcity of large-scale, diverse point cloud datasets, particularly those aligned with images or text, significantly hampering the development of foundation models for 3D tasks. This shortage is particularly problematic for few-shot or zero-shot learning approaches, which aim to achieve proficiency with + +![](images/d28fbee0168ce91a28569b8898fae8eb44f4a8ffd58708df01e7eabe69f27d8e.jpg) +Fig. 1: We distill 2D representations from CLIP [36] to a 3D point-cloud encoder using the contrastive loss, similarity loss, and our proposed relational loss, and compute the uniformity (U), tolerance (T), and modality gap (G) of the learned 3D representations. We sample 5000 point features from each of the 16 classes defined in the nuScenes dataset [5], apply PCA and visualize the primary components. The source U and T of the CLIP image encoder are 1.54 and 0.73, respectively. Compared to the source, we see that contrastive loss learns 3D representations with higher U and lower T compared to the source, while the trends are reversed for similarity loss. Our proposed relational loss minimizes this structural mismatch and leads to the lowest modality gap. + +minimal or no labelled examples 432. Bridging this gap is vital for creating models adept at understanding complex 3D scenes with limited data. + +Contrary to the 3D domain, the 2D and language domains benefit from the availability of large-scale, diverse, and multi-modal datasets, which facilitated the development of Vision Foundation Models (VFMs) [7,30], and Vision-Language Models (VLMs) [36,46]. These models have shown remarkable label efficiency in 2D tasks like image classification and segmentation and have also been used to perform label-free 2D image classification and segmentation through language prompts during inference [26,36]. Due to these advantages, recent approaches for learning 3D representations have relied on the distillation of 2D representations from VFMs [25,27,38] or VLMs [9,33,44] to point cloud encoders, and have shown encouraging results when solving few-shot and zero-shot 3D tasks. + +Unfortunately, the adaptation of 2D-to-3D distillation frameworks for autonomous driving (AD) datasets reveals unique challenges, notably due to the inherent characteristics of AD data. Current frameworks, largely reliant on contrastive learning methods, face the issue of self-similarity [27], a prevalent phenomenon in AD datasets. Self-similarity arises when a significant portion of the training examples belong to a single semantic category (e.g. road, trees or sky in AD data). Under the effect of self-similarity, the contrastive loss mechanism, designed to be hardness-aware [41], inadvertently pushes away semantically similar samples, which not only disrupts the local semantic coherence of the 3D representation [24,27,38] but also amplifies the effects of AD datasets' severe class imbalance. As a result, while such frameworks may result in useful 3D representations for few-shot learning tasks, the misalignment induced by excessive pushing of semantically similar examples undermines their efficacy in zero-shot learning scenarios, where precise cross-modal alignment is crucial. Another approach + +to distillation relies on the cosine similarity loss, which attempts to learn a 3D representation by driving the features generated for every 3D point by a point encoder to its corresponding 2D feature from VFMs or VLMs. Using the similarity loss results in 3D representations that achieve significantly better performance on the zero-shot tasks compared to ones learned with the contrastive loss. However, we argue in Section 3 that using the similarity loss under-constrains the pretraining when compared to the contrastive loss, resulting in sub-optimal 3D representations on few-shot downstream tasks. + +To highlight the mismatch discussed above, we provide an example visualization of the 3D representation space (Fig. ①), which was obtained by distilling from CLIP's ③ 2D representation space using both the contrastive and similarity losses. We observe that both losses result in 3D representations that diverge from the structure of the 2D representation as measured by uniformity, tolerance, and the modality gap, which we further explain in Section ③. + +In this work, we investigate the impact of state-of-the-art 2D-to-3D distillation frameworks on the structure of learned 3D representations. We show that the choice of loss during pretraining can result in a significant mismatch between the structure of the 2D source representations and the distilled 3D representations. Furthermore, we demonstrate that this mismatch leads to a deterioration in performance on downstream tasks. Our contributions are as follows: + +- Quantify the Gap: We quantify the mismatch in structure when performing distillation using contrastive loss [12,25,38] and similarity loss [17,33] via the uniformity [41,42], tolerance [41], and modality gap [23], revealing a significant gap between 2D and distilled 3D representations. + +- Bridging the Gap using Relational Distillation: We address this mismatch by imposing structural constraints that foster the learning of a 3D representation aligned with the structure of 2D representations. To achieve this, we employ pretraining with intra-modal and cross-modal relational losses. These losses generalize the similarity loss, providing a more effective constraint on the distillation process. Our proposed losses can be applied to pixel-based [25] and superpixel-based [38] distillation frameworks. + +- Bridging the Gap Improves Downstream Performance: Our proposed loss effectively minimizes the mismatch between learned 3D and 2D representations from multiple VLM and VFM image encoders, quantified by differences in the U, T, and G (Fig. 1). Consequently, the resulting 3D representations significantly outperform those learned via contrastive distillation on zero-shot segmentation tasks. Furthermore, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks. + +# 2 Related Work + +# 2.1 Cross-Modal Knowledge Distillation + +Knowledge Distillation enables a student network to learn a task by mimicking the output of highly-performing teacher networks [13], achieved by using + +these output as training targets for the student network [18], or by supervising the student network using the teacher's intermediate representations [37,40,43]. Distilling representations rather than network predictions enables knowledge transfer across different modalities, without requiring labels. In the context of cross-modal distillation, contrastive distillation [12,40] has shown to be the most effective. However, the abundance of self-similarity [27], coupled with the hardness-aware property of contrastive losses [41] limits the effectiveness of contrastive losses for AD data. On the other hand, similarity losses only utilize positive pairs for distillation, resulting in an under-constrained loss, leading to sub-optimal performance on zero-shot tasks [12]. + +# 2.2 3D Representations for Few-Shot Learning + +Few-shot learning refers to learning the underlying pattern in data from only a few training samples [32]. Distilling 3D representations from 2D self-supervised models [26,7,10,14,15] or VFMs [30,36] has shown to be effective at significantly improving performance on 3D few-shot tasks [24,27,38]. PPKT [25] proposes a pixel-based contrastive loss to distill 2D self-supervised representations to point cloud encoders. While effective in indoor settings, PPKT [25] underperforms in outdoor settings where point-to-pixel correspondences are sparse [38]. Inspired by DetCon [16], SLidR [38] proposes a superpixel-based contrastive loss primarily designed for autonomous driving scenes which constructs region-level contrastive pairs suited for distilling scene-level images [16]. Due to the abundance of self-similarity in AD data [24,27,38], contrastive distillation leads to sub-optimal 3D representations [27]. To address these challenges, ST-SLidR [27] proposes a semantically tolerant contrastive loss leading to improved 3D representations for 3D few-shot segmentation tasks. Finally, Seal [24] demonstrates that object priors from VFMs like SAM [21], represented as superpixels, can improve the quality of 3D representations for 3D few-shot segmentation tasks. In this paper, we demonstrate that pixel and superpixel-based contrastive distillation applied to AD data, learn 3D representations that significantly differ from the structure of 2D representations. This leads to poor performance on zero-shot tasks and unpredictable performance on few-shot tasks. + +# 2.3 3D Representations for Zero-Shot Learning + +Contrastive Language-Image Pre-training (CLIP) models are pre-trained on billions of webscale image-text pairs and have shown great success in solving zero-shot image classification tasks [36]. Using frozen CLIP vision encoders, Image-Bind [12] enables zero-shot image classification by distilling image-level representations via a contrastive distillation framework. LidarCLIP [17] aligns LiDAR point features to CLIP space, demonstrating effective cross-modal retrieval and image-level zero-shot classification. PointCLIP [44] and PointCLIPv2 [47] propose a distillation-free approach utilizing CLIP vision and text encoders during the inference stage to solve 3D zero-shot classification tasks. More recently, + +MaskCLIP [46] proposes removing the last attention pooling layer in CLIP vision encoders to enable dense feature extraction for 2D zero-shot segmentation tasks. OpenScene [33] distills image features from CLIP models fine-tuned on 2D segmentation datasets [11,22] to point cloud encoders. As demonstrated by ConceptFusion [19] and LERF [20], due to fine-tuning on closed-set 2D segmentation labels, these CLIP models have poor open-set capabilities. During inference, OpenScene fuses image and point features to solve 3D zero-shot segmentation. In this work, we do not assume access to finetuned CLIP models or access to image data during inference time. CLIP2Scene [9] assumes knowledge of class names of objects in the pre-training dataset, which leads to a contrastive loss with fewer false negatives. Requiring class names is problematic as it assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes and limiting open-set capabilities [34]. + +# 3 Methodology + +# 3.1 Preliminaries + +Our objective is to generate useful 3D representations by learning a point cloud encoder, $f: \mathbb{R}^{N \times (3 + L)} \to \mathbb{R}^{N \times C}$ , through distilling 2D representations from VFMs or VLMs (e.g., CLIP [36], DINOv2 [30]). Using camera-to-LiDAR calibration matrices, we create a set of positive pairs of point, $\mathbf{K}_{\mathbf{p}} \in \mathbb{R}^{N \times C}$ , and pixel, $\mathbf{Q}_{\mathbf{p}} \in \mathbb{R}^{N \times C}$ , features, with the latter being generated from the pre-trained image encoder of the foundation model, $g: \mathbb{R}^{N \times 3} \to \mathbb{R}^{N \times C}$ . While distillation methods like PPKT [25] implement distillation losses by creating pixel-point positive pairs, techniques such as SLidR [38] optimize pair formation by harnessing boundary information from superpixels. SLidR, with $M$ superpixels per image, employs average pooling to group points, $\mathbf{K}_{\mathbf{p}}$ , and pixels, $\mathbf{Q}_{\mathbf{p}}$ , into superpoint, $\mathbf{K}_{\mathbf{sp}} \in \mathbb{R}^{M \times C}$ , and superpixel, $\mathbf{Q}_{\mathbf{sp}} \in \mathbb{R}^{M \times C}$ , features, improving feature correspondence. Superpixels are derived from unsupervised techniques like SLIC [1], or foundation models such as SAM [21,24]. One of the most effective cross-modal distillation losses is the contrastive loss: + +$$ +\mathcal {L} _ {c o n} \left(\mathbf {K}, \mathbf {Q}\right) = - \frac {1}{B} \sum_ {i = 1} ^ {B} \log \left[ \frac {e ^ {\left(\left\langle \mathbf {k} _ {i} , \mathbf {q} _ {i} \right\rangle / \tau\right)}}{\sum_ {j \neq i} e ^ {\left(\left\langle \mathbf {k} _ {i} , \mathbf {q} _ {j} \right\rangle / \tau\right)} + e ^ {\left(\left\langle \mathbf {k} _ {i} , \mathbf {q} _ {i} \right\rangle / \tau\right)}} \right] (1) +$$ + +where $\mathbf{K}$ and $\mathbf{Q}$ can either be point/pixel (i.e., $\mathbf{K_p}$ , $\mathbf{Q_p}$ ) or superpoint/superpixel (i.e., $\mathbf{K_{sp}}$ , $\mathbf{Q_{sp}}$ ) feature vectors, $B$ is the number of positive pairs in a mini-batch, $\tau$ is the temperature, and $\langle \mathbf{k}_i, \mathbf{q}_j \rangle$ is the dot product between the $\ell_2$ -normalized features. The contrastive loss distills information from pre-trained image encoders by pulling the point cloud features, $K$ , towards their corresponding (positive) image feature, $Q$ , in representation space, simultaneously pushing them away from all the other (negative) image features. The temperature, $\tau$ , controls the strength of this push/pull mechanism by modifying the gradient's scale from the negative samples [41]. However, a significant limitation of this approach is the potential degradation in the learned point cloud representation's + +quality due to false negative samples [27]. These are image features incorrectly chosen as negative, despite belonging to the same semantic class as the positive point cloud feature, leading to opposing distillation signals. + +To avoid both relying on negative examples while performing distillation, and tuning the temperature parameter, we can use the cosine similarity: + +$$ +\mathcal {L} _ {s i m} (\mathbf {K}, \mathbf {Q}) = \frac {1}{B} \sum_ {i = 1} ^ {B} (1. 0 - \langle \mathbf {k} _ {i}, \mathbf {q} _ {i} \rangle) \tag {2} +$$ + +The similarity loss does not rely on negative samples and thus has a much simpler mode of action. It focuses solely on drawing each point cloud feature, $\mathbf{k}_i$ , nearer to its corresponding image feature, $\mathbf{q}_i$ , effectively maximizing their dot product. + +# 3.2 Quantifying the Quality of Distilled Representations + +We investigate the quality of the distilled 3D representations as a function of the distillation loss used during training. We hypothesize that if a distilled 3D representation space closely captures the structure of the source 2D representation space, our resulting 3D encoder would: 1) possess the enhanced representation capability of the source vision/vision-language foundation model and 2) generate 3D representations that are well-aligned with the text representations of the vision-language model, enabling zero-shot downstream tasks. To assess the structural similarity between two representation spaces, we utilize uniformity and tolerance, two metrics previously proposed by Wang et al. [41], for evaluating the quality of a representation space. Uniformity measures the distribution of $\ell_2$ -normalized features on a hyper-sphere. Authors in [42] have demonstrated that a high uniformity is key for high-quality representations as it quantifies that the trained encoder has successfully utilized a substantial part of the available feature space. Uniformity is formulated using a Gaussian potential function as: + +$$ +\mathrm {U} (f (\cdot)) = - \log \underset {x, y \sim p _ {\mathrm {d a t a}}} {\mathbb {E}} \left[ e ^ {- t | | f (x) - f (y) | | _ {2} ^ {2}} \right] \tag {3} +$$ + +where $f(.)$ is the point encoder and $x, y$ are two samples from the data-distribution $p_{\mathrm{data}}$ . Here, $x, y$ are point features for 3D point encoders. Similarly, we compute the uniformity of $U(g(.)$ ) for the image encoder by setting $x, y$ as pixel features. + +On the other hand, tolerance measures the semantic clustering for the $\ell_2$ -normalized output representations from a given encoder, computed as: + +$$ +T (f (.) = \underset {x, y \sim p _ {\mathrm {d a t a}}} {\mathbb {E}} \left[ \left(f (x) ^ {T} f (y)\right) \cdot I _ {l (x) = l (y)} \right] \tag {4} +$$ + +where $l(x)$ represents the class label of point $x$ . $I_{l(x) = l(y)}$ is an indicator function, having the value of 1 for $l(x) = l(y)$ and the value of 0 for $l(x) \neq l(y)$ . A higher tolerance indicates that the features of all points belonging to a certain class are better clustered together on a unit sphere. Similar to uniformity, we can compute + +![](images/63fd452a4d1abce4961d04b8474b0c4ba92f3756650b6da3cbfecc077eef3905.jpg) + +![](images/7822afb40b423aea1815f7774d86852320c11635aa0cb23f8498091bb7f4e43f.jpg) + +![](images/b6d80a5dbc35f4074a9caa8be44b1f6dc82d4dea9c2af3322bc1e3e73628a13d.jpg) +Fig. 2: Blue: The source representation space, with a uniformity and tolerance of $\mathrm{U} = 0.89$ and $\mathrm{T} = 0.66$ , respectively. Cyan: The predicted representation space. Here, $t$ denotes the number of training iterations. + +![](images/4e5e299eb5e074643b7406caf0e399a097f4c6a2b5f32bf289bcc29839458325.jpg) + +![](images/6f6e1c1e8f8290fe72e8d08f6a524aec9c1b4c998c9184a7d6d9ac6940ae65ab.jpg) + +![](images/05a3600c2c216c9c385ecebd8f899319536d336c35b1f073bc072ffb420de117.jpg) + +![](images/1419c666b58e0caeb50955341e7f337b5eda96ae8766164fdabb18d5d88fdbc4.jpg) + +![](images/4f5cfb89216524ab028801866d2b98db0f01d85ba13069b0c4a0fbda89744768.jpg) + +![](images/368baa43c6c48d948a9117d1fed615c887ff2e038835a87f1bf142e9dda7d669.jpg) + +tolerance for the image encoder as $T(g(.))$ , by propagating 3D point-wise labels to 2D image pixels. + +Furthermore, to directly compare the alignment of the two representation spaces from different modalities, we also use the modality gap as proposed in [23]: + +$$ +G (f (.), g (.) = \underset {x \sim p _ {\mathrm {2 D}}} {\mathbb {E}} [ f (x) ] - \underset {y \sim p _ {\mathrm {3 D}}} {\mathbb {E}} [ g (y) ] \tag {5} +$$ + +The modality gap measures the difference between the mean of the representation of the point features and their corresponding pixel features. We conclude by noting that unlike G, U and T are properties of a single encoder; we show the difference in representations by comparing the values of $U(f(.))$ and $T(f(.))$ to $U(g(.))$ and $T(g(.))$ , respectively. Closer values indicate our point cloud encoder well-approximates the representation space of the source image encoder, which we show in Section 4 to be beneficial for downstream tasks. + +# 3.3 The Representations of Common Distillation Losses + +Inspired by [39], we explore the structure of the learned representation space using contrastive loss and similarity loss through a toy example. We start with 1000 uniformly distributed points over a 3D unit sphere, representing point features before the distillation phase. Using a 2-layer MLP, we learn to align each input point with its corresponding pixel feature from the source representation space, defined by U and T levels of 0.89 and 0.66, respectively. We use the Adam optimizer with a learning rate of $10^{-4}$ and train our model for 50,000 iterations (refer to Appendix A for detailed analysis). + +Figure 2 shows a visualization of the source representation space (blue) and the predicted representation space (cyan) at various stages of training. The top row highlights a significant difference: the contrastive losses generate a representation space with a high U of 1.38, but with a very low T of 0.02, differing significantly from the source space's U (0.89) and T (0.66). This is attributed + +to self-similarity [27], a phenomenon that occurs when points from the source representation space are close to one another, as in our toy example. Although the contrastive loss moves a particular prediction to its corresponding point in the source, its hardness-awareness property [41] pushes all other predictions, particularly close ones, away from that point. Combined with self-similarity, this yields a uniform predicted space with a low T, and a significant modality gap. As demonstrated in Section 4, this discrepancy hinders zero-shot task performance due to inadequate cross-modal alignment. + +On the other hand, learning with similarity loss leads to representations with lower U (0.59) and higher T (0.80) compared to the source. This stems from the tendency of similarity loss to form compact clusters in the predicted space, as shown with autonomous driving data in Figure 1 and the toy example in Figure 2. Notably, early training $(t = 1000)$ exhibits noticeable clustering that disperses with additional epochs. Additionally, the non-uniqueness of the dot product between the learnable point vector, $\mathbf{k}_i$ , and the fixed pixel vector, $\mathbf{q}_i$ , within the framework of similarity loss (Eq. 2) results in a significant increase in the number of learnable vectors that can achieve the same cosine similarity with the fixed vector, $\mathbf{q}_i$ . This growth can result in slow convergence and suboptimal predicted representation spaces. Combined with neural network optimization complexities, these issues lead to the observed disparity in uniformity and tolerance from the source representation space in distillation tasks using similarity loss. + +# 3.4 Relational Loss + +Inspired by distilling relations in model compression [31], this section presents two relational losses that impose structural constraints on the 3D representation space. This modification disrupts the symmetry inherent in the similarity loss. It drives the network to select solutions that, while possessing equivalent similarity loss values to alternatives, yield a 3D representation space that more accurately mirrors the structure of the image representation space. + +Cross-modal Relational Loss We propose imposing a constraint on the structure of the learned 3D representation space to ensure that the similarities between a given predicted point feature, $\mathbf{k}_i$ , and all source pixel features align with the similarities between its corresponding pixel feature, $\mathbf{q}_i$ , and all other source pixel features in the same batch. The cross-modal relation loss is defined as: + +$$ +\begin{array}{l} \mathcal{L}_{cross}\left(\mathbf{K},\mathbf{Q}\right) = \frac{1}{N}\sum_{i = 1}^{N}\mathbf{C}_{ii} + \frac{1}{N^{2} - N}\sum_{i = 1}^{N}\sum_{\substack{j = 1\\ i\neq j}}^{N}\mathbf{C}_{ij} \\ = \underbrace {\frac {1}{N} \sum_ {i = 1} ^ {N} \left(1 . 0 - \langle \mathbf {k} _ {i} , \mathbf {q} _ {i} \rangle\right)} _ {\mathcal {L} _ {s i m} (\mathbf {K}, \mathbf {Q})} + \frac {1}{N ^ {2} - N} \sum_ {i = 1} ^ {N} \sum_ {\substack {j = 1 \\ i \neq j}} ^ {N} | \langle \mathbf {k} _ {i}, \mathbf {q} _ {j} \rangle - \langle \mathbf {q} _ {i}, \mathbf {q} _ {j} \rangle | \tag{6} \\ \end{array} +$$ + +where $\mathbf{C} = |\mathbf{KQ}^T -\mathbf{QQ}^T|$ represents the matrix of differences, capturing the discrepancy between the predicted point-to-pixel and the source pixel-to-pixel similarities. First, the matrix's diagonal components, $\mathbf{C}_{ii}$ , are directly linked to the similarity loss, underscoring the necessity of aligning each point feature with its corresponding source pixel feature. The second term of Equation 6 facilitates learning a point feature, $\mathbf{k}_i$ , that is not only close to its corresponding source pixel feature, $\mathbf{q}_i$ , but is also consistent with $\mathbf{q}_i$ 's similarities to other pixel features, $\langle \mathbf{q}_i,\mathbf{q}_j\rangle$ , where $j\neq i$ . These cross-modal constraints foster learning point features that maintain the relational structure within the image representation space. + +Intra-modal Relational Loss Another strategy to ensure structural similarity between the 3D and 2D representation spaces involves directly penalizing differences in their relational graphs. A relational graph of a representation space can be understood as a graph with the nodes representing point or pixel features, and edges indicating the similarity between node features. We represent the relational graph of the point features and the pixel features using $\mathbf{K}\mathbf{K}^T$ and $\mathbf{Q}\mathbf{Q}^T$ , respectively. Here, $\langle \mathbf{k}_i,\mathbf{k}_j\rangle$ represents the similarity between the $i^{th}$ and the $j^{th}$ predicted point feature. We denote the discrepancy of the relational graphs as $\mathbf{U} = |\mathbf{K}\mathbf{K}^T -\mathbf{Q}\mathbf{Q}^T|$ . Since this matrix is symmetric, and its diagonal elements, $|\langle \mathbf{k}_i,\mathbf{k}_i\rangle -\langle \mathbf{q}_i,\mathbf{q}_i\rangle |$ , degenerate to 0, the intra-modal relational loss is expressed as: + +$$ +\mathcal {L} _ {\text {i n t r a}} (\mathbf {K}, \mathbf {Q}) = \frac {2}{N ^ {2} - N} \sum_ {i = 1} ^ {N - 1} \sum_ {j = i + 1} ^ {N} \mathbf {U} _ {i j} \tag {7} +$$ + +The consequence of this loss on the structure of the point representation space is simple; the similarity between a predicted point feature and other predicted point features in a batch should match the similarity between its corresponding source pixel feature and other source pixel features in the same batch. Our proposed relational loss is a combination of the two losses: + +$$ +\mathcal {L} _ {r e l} (\mathbf {K}, \mathbf {Q}) = \mathcal {L} _ {i n t r a} (\mathbf {K}, \mathbf {Q}) + \mathcal {L} _ {c r o s s} (\mathbf {K}, \mathbf {Q}) \tag {8} +$$ + +Unlike the similarity loss, the proposed loss ensures learned point cloud features align with image features in a structured manner, preserving the data's inherent relationships. Figure 2 reveals two key advantages of relational loss over similarity loss: closer alignment of the predicted space's U and T with those of the source space, alongside a reduced G between the two spaces. Additionally, the relational loss achieves faster convergence, as the visual appearance of the predicted representation space resulting from learning with the relational loss remains consistent from the mid-point of training (t=25000) to its conclusion (t=50000). In Section 4 we further illustrate how these attributes of the relational loss contribute to enhanced performance in downstream tasks. + +# 4 Experiments + +# 4.1 Pre-training + +Backbones We focus on distilling 2D representations from two vision foundation models, CLIP [36], pretrained on the WIT dataset containing 400 million image-text pairs, and DINOv2 [30], pretrained on the LVD-142 dataset containing 142 million images. For CLIP encoders, we experiment with different pre-trained architectures available from OpenAI [36]. For the 3D backbone, we use a randomly initialized Minkowski U-Net [38]. For details on the design of the 2D and 3D projection layers, refer to Appendix C. + +Dataset In the pre-training phase we use the nuScenes dataset [5], consisting of 700 scenes. In line with previous works [24,27,38], these scenes are divided into two subsets: 600 scenes for pre-training and 100 scenes for the determination of the best hyper-parameters. Throughout this pre-training process, we exclusively employ keyframes from the 600 scenes to train all models. For pre-training hyperparameters and data-augmentation details, refer to Appendix B. + +# 4.2 Evaluation + +To study the effect of the distillation framework on the structure of the 3D representations, we evaluate the average U, T, and G between the distilled 3D and source 2D representations. For both pixel-based and superpixel-based losses, U, T, and G are evaluated using point or pixel features. To assess the relationship between the performance on downstream tasks and the difference in the structure of the 2D and the 3D representation spaces, we use the in-distribution 3D few-shot segmentation task, where we learn a classifier by finetuning the 3D representations on $1\%$ of the labels of the nuScenes training set. Similar to [27,38], we also evaluate the utility of the distilled representations in the out-of-distribution setting by fine-tuning on $1\%$ of the SemanticKITTI [3] dataset. The nuScenes and SemanticKITTI datasets contain 16 and 19 classes, respectively. We present our results using the official validation sets for these datasets. + +For DINOv2, we follow [27,38] and evaluate the Linear Probing performance on nuScenes by freezing the backbone of the point cloud encoder and training a linear classifier on $100\%$ of the labels. For CLIP models, we evaluate the 3D zero-shot segmentation tasks which can be performed with language prompts. To enable openset scene understanding, during pretraining, we assume we have no access to nuScenes class labels. Similar to [46], we apply prompt engineering during inference using 85 hand-crafted prompts for each class label, and then use the CLIP text encoder to compute an average text embedding for each class. Each point is then assigned the label that corresponds to the highest cosine similarity, computed between the point features and the CLIP text embeddings. + +Table 1: Evaluation of 3D representations from CLIP image encoder with source U of 1.54, and source T of 0.73. Best results are bolded and second best are underlined. + +
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
CLIP 36PPKT 253.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.60
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR 383.50900.44720.0015316.8246.7646.53
ST-SLidR 273.50000.45440.0015018.5447.1346.84
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
+ +Table 2: Evaluation of 3D representations from DINOv2 image encoder with source U of 2.8, and source T of 0.51. Best results are bolded and second best are underlined. + +
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Lin. Probing 100%Finetuning 1%Finetuning 1%
DINOv2 30PPKT 253.6250.44510.0006048.5043.3043.62
Simpl2.1760.69260.0003049.7245.8548.32
Relpl (ours)2.3930.65880.0002049.2046.9049.00
SLidR 383.6550.37390.0004449.6044.8142.23
ST-SLidR 273.5890.43260.0004253.0047.1145.61
Simspl2.2860.65220.0003052.3047.2349.01
Relspl (ours)2.5040.63120.0002352.9248.4249.10
+ +# 4.3 Results + +Baselines In Tab. 1 and Tab. 2, we present the results of distilling CLIP and DINOv2 models using our proposed relational loss. We compare against multiple state-of-the-art contrastive losses including PPKT [25], SLidR [38], and ST-SLidR [27]. For superpixel-based losses, masks are generated using SAM [21]. As an additional baseline, we report results for both the pixel-based and superpixel-based similarity loss, which we denote as $\mathrm{Sim}_{pl}$ and $\mathrm{Sim}_{spl}$ , respectively. We report the average over 3 runs for all metrics. + +Uniformity, tolerance, and closing the modality gap Looking at distillation losses from the 2D CLIP encoder in Tab. [1] we first observe that U of 3D representations distilled using contrastive loss (i.e., PPKT, SLidR and ST-SLidR) is higher than the source U of 1.54, while U of similarity loss (i.e., $\mathrm{Sim}_{pl}$ , $\mathrm{Sim}_{spl}$ ) is lower than the U of the source. This is also observed when distilling from DINOv2. The relational constraints (i.e., $\mathrm{Rel}_{pl}$ , $\mathrm{Rel}_{spl}$ ) effectively close the gap between 3D representations distilled by similarity loss (i.e., $\mathrm{Sim}_{pl}$ , $\mathrm{Sim}_{spl}$ ) and 2D representations. For instance, when the pixel-based loss $\mathrm{Rel}_{pl}$ is applied to CLIP, relational constraints close the gap in U resulting in a 3D representation with a U of 0.9089, instead of 0.5519, thus closer to the U of the source (1.54). Similarly, for the superpixel-based loss, $\mathrm{Rel}_{spl}$ , relational constraints close the gap in U resulting in a 3D representation with a U of 1.099, instead of 0.5919, thus closer to the U of the source (1.54). In addition, relational losses result in semantic clusters that are closer to the T of the source. By closing the gap + +Table 3: Performance for different CLIP backbones using pixel-based and superpixel-based relational loss. Best results are bolded and second best are underlined. + +
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
ViT-B32PPKT3.51100.52030.0002014.2143.2945.89
Simpl0.58040.93890.0001022.8444.2244.30
Relpl (ours)0.96050.89890.0001023.8544.6745.62
SLidR3.51300.47060.0003015.5543.3843.82
Simspl0.60090.93230.0001125.4644.8345.69
Relspl (ours)1.20200.86480.0000725.6645.6047.26
ViT-B16PPKT3.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.59
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR3.50900.44720.0015316.8246.7646.53
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
ViT-L14PPKT3.50200.52030.0008916.2844.6946.69
Simpl0.69090.92570.0001627.9144.8744.80
Relpl (ours)0.87750.90270.0001327.7445.9245.86
SLidR3.48000.44030.0006518.3147.3446.86
Simspl0.73110.91020.0002030.7745.7645.29
Relspl (ours)0.90190.88730.0001730.1147.0746.81
+ +in U and T, relational constraints result in the lowest G for pixel-based and superpixel-based losses. These results align well with the ones presented on the toy example in Section 3, which further supports the validity of our analysis. + +Zero-shot performance Looking at the utility of the 3D representations for 3D zero-shot segmentation in Tab. [1] we observe that the contrastive loss (i.e., PPKT, SLidR and ST-SLidR) has significantly worse 3D zero-shot mean IOU when compared to the similarity loss. This is contrary to the conclusion reached by ImageBind [12], which observed that the contrastive loss achieves $6\%$ improvement on 2D zero-shot tasks compared to similarity losses. We hypothesize that the abundance of self-similarity in AD datasets, coupled with the hardness-aware property of contrastive loss [27], leads to pushing away semantically similar point and pixel features. This, in turn, results in poor alignment between point features and CLIP image features. Notably, we observe that ST-SLidR improves zero-shot performance compared to SLidR (18.54% vs 16.82%) as it utilizes the superpixel feature similarities to exclude a portion of the false negative samples from the pool of negative samples. Without resorting to negative samples, relational constraints minimize the 2D-to-3D structural gap compared to similarity loss, leading to improvements in zero-shot performance from 20.84% to 23.53% for pixel-based losses, and from 23.93% to 26.03% for superpixel-based losses. + +In Tab. 4, we compare pixel and superpixel-based relational losses to SOTA methods. All methods distill from CLIP [36], with the performance on nuScenes provided by [8]. Methods are further categorized based on the prior knowledge required during the distillation phase. Some methods require class names defined for a dataset [8,9], while others utilize SAM to refine CLIP predictions [8]. Requiring class names assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes, thus + +Table 4: Zero-shot segmentation performance of relational loss compared to state-of-the-art methods. + +
MethodPublicationClass Names RequiredUses SAM3D mIoU
MaskCLIP 46ECCV 2022✗✗12.80
OpenScene 33CVPR 2023✗✗14.60
CLIP2Scene 9CVPR 2023✓✗20.80
Relpl (ours)-✗✗23.53
TLF 8NeurIPS 2023✓✓26.80
Relspl (ours)-✗✓26.03
+ +Table 5: Effect of relational loss components. Distilling from CLIP image encoder with source U of 1.54 and T of 0.73. + +
LossUniformityToleranceModality GapnuScenesKITTI
ZSFt 1%Ft 1%
\( Sim_{pl} \)0.55190.94770.0004520.8444.3945.59
+cross0.64260.93860.0004221.3945.9545.45
+intra0.90890.91450.0003323.5345.6746.06
\( Sim_{spl} \)0.59190.93330.0004023.9345.6346.42
+cross0.76560.90860.0003325.0546.1846.99
+intra1.09900.87000.0001926.0347.2247.52
+ +Table 6: Improvement of finetuned models with respect to majority versus minority classes. Similar to ST-SLidR [27], We group classes based on whether their superpixels occupy more than $5\%$ of the superpixels in nuScenes training set. + +
2D EncoderLossMajority (mIoU)Minority (mIoU)
CLIP\( Sim_{pl} \)69.1633.35
\( Rel_{pl} \)69.5934.80
\( Gain \)+0.43+1.45
\( Sim_{spl} \)67.5836.06
\( Rel_{spl} \)67.7538.77
\( Gain \)+0.17+2.71
DINOv2\( Sim_{pl} \)70.8934.24
\( Rel_{pl} \)71.2235.85
\( Gain \)+0.33+1.61
\( Sim_{spl} \)68.1538.53
\( Rel_{spl} \)68.8040.20
\( Gain \)+0.65+1.67
+ +limiting openset capabilities [34]. Without using class information, we observe in Tab. 4 that $\mathrm{Rel}_{pl}$ performs the best compared to other pixel-based losses, while our superpixel-based relational loss, $\mathrm{Rel}_{spl}$ , is within $1\%$ from state-of-the-art [8]. Few-shot performance We evaluate the effectiveness of 3D representations in both in-distribution (namely, nuScenes) and out-of-distribution (namely, SemanticKITTI) settings. For representations distilled from CLIP in Tab. 1, we observe that the limited U of representations distilled through similarity losses, as opposed to the source, leads to comparatively weaker performance on indistribution tasks with few-shot learning when compared with contrastive loss. For instance, ST-SLidR representations enhance performance on the nuScenes dataset by $+1.5\%$ compared to $\mathrm{Sim}_{spl}$ . Furthermore, by applying relational constraints and without the need for negative samples, we can bridge the U gap. This results in $\mathrm{Rel}_{spl}$ outperforming $\mathrm{Sim}_{spl}$ by $+1.59\%$ and $+1.1\%$ on nuScenes and SemKITTI, respectively. When examining 3D representations distilled from DI-NOv2 in Tab. 2, we note a source U of 2.8. Here, the similarity loss closely aligns with the source's U more than the contrastive loss. The contrastive loss (PPKT and SLidR) shows significantly poorer performance compared to the similarity loss. Additionally, 3D representations distilled by ST-SLidR attain a U of 3.589 and a T of 0.4326, aligning more closely with the source U and T of 2.8 and 0.51 than those distilled by the SLidR loss. Lastly, we find that relational constraints narrow the G more effectively than similarity losses, thereby enhancing the few-shot performance by $+1.05\%$ and $+1.19\%$ on pixel and superpixel-based losses, respectively, on the nuScenes dataset compared to similarity losses. + +CLIPBackbonesTab.3 depicts the performance of contrastive,similarity, + +and relational losses when distilling from different CLIP backbones. Relational losses achieve the lowest modality gap, surpassing both contrastive and similarity loss across all 2D encoders. In zero-shot tasks, relational losses either match or exceed the performance of similarity losses, whereas contrastive distillation consistently underperforms. The performance of contrastive distillation on few-shot tasks proves unpredictable. For instance, distilling from ViT-B32 using similarity loss $\mathrm{Sim}_{spl}$ surpasses distilling using contrastive loss SLidR in mIOU by $+1.45\%$ and $+1.87\%$ on nuScenes and SemanticKITTI, respectively. Conversely, distilling from ViT-L14, SLidR achieves competitive performance, outperforming similarity loss $\mathrm{Sim}_{spl}$ by $+1.58\%$ and $+1.57\%$ on the same datasets. Notably, relational losses bridge the gap in few-shot learning while maintaining robust zero-shot task performance. This indicates that relational losses utilize inherent 2D representation relationships, avoiding ungrounded negative samples common in contrastive loss, which facilitates learning representations more aligned with the source's U, thereby enhancing few-shot task performance. + +Class Imbalance We investigate the performance of finetuned models on semantic segmentation using 3D representations distilled using similarity and relational losses. Similar to ST-SLidR [27], we distinguish between majority and minority classes based on the percentage of superpixels they occupy in the nuScenes dataset. The 11 classes occupying less than $5\%$ of the superpixels are considered to be in the minority set, while the remaining classes are in the majority set. In Tab. 6 compared to similarity losses, relational losses learn representations that significantly improve performance on minority classes for pixel and superpixel-based losses without degrading performance on majority classes. + +Relational Loss Ablation We investigate the contribution of cross-modal and intra-modal constraints for pixel-based and superpixel-based losses. In Tab. 5, we observe that both constraints lead to learning 3D representations that are closer to the source U and T, and thus result in a lower G compared to similarity losses. Moreover, both constraints lead to improved performance on zero-shot and few-shot segmentation tasks. Interestingly, the superpixel-based relational loss with both constraints (last row) results in the smallest gap in U and T compared to other losses, leading to the best performance on semantic segmentation. + +# 5 Conclusion + +In this work, we study the impact of the state-of-the-art 2D-to-3D distillation frameworks when applied to AD datasets on the structure of the learned 3D representation. We reveal a significant structural gap between the 2D and the 3D representations and show that this gap is negatively correlated with the utility of the learned 3D representations for solving 3D zero-shot and few-shot segmentation tasks. Our proposed relational loss bridges this structural gap, resulting in well-aligned 3D representations that outperform representations learned via contrastive loss on zero-shot segmentation tasks. In addition, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks. + +# References + +1. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Susstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE TPAMI 34(11), 2274-2282 (2012) +2. Bardes, A., Ponce, J., Lecun, Y.: Vicreg: Variance-invariance-covariance regularization for self-supervised learning. In: ICLR (2022) +3. Behley, J., Garbade, M., Milioto, A., Quenzel, J., Behnke, S., Stachniss, C., Gall, J.: SemanticKITTI: A Dataset for Semantic Scene Understanding of LiDAR Sequences. In: ICCV (2019) +4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020) +5. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuscenes: A multimodal dataset for autonomous driving. In: CVPR. pp. 11621-11631 (2020) +6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. NeurIPS 33, 9912-9924 (2020) +7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021) +8. Chen, R., Liu, Y., Kong, L., Chen, N., Xinge, Z., Ma, Y., Liu, T., Wang, W.: Towards label-free scene understanding by vision foundation models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023) +9. Chen, R., Liu, Y., Kong, L., Zhu, X., Ma, Y., Li, Y., Hou, Y., Qiao, Y., Wang, W.: Clip2scene: Towards label-efficient 3d scene understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7020-7030 (2023) +0. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020) +1. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: European Conference on Computer Vision. pp. 540-557. Springer (2022) +2. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind: One embedding space to bind them all. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15180-15190 (2023) +3. Gou, J., Yu, B., Maybank, S.J., Tao, D.: Knowledge distillation: A survey. International Journal of Computer Vision 129, 1789-1819 (2021) +4. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P.H., Buchatskaya, E., Doersch, C., Pires, B.A., Guo, Z.D., Azar, M.G., et al.: Bootstrap your own latent: A new approach to self-supervised learning. arXiv preprint arXiv:2006.07733 (2020) +5. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020) +6. Henaff, O.J., Koppula, S., Alayrac, J.B., Van den Oord, A., Vinyals, O., Carreira, J.: Efficient visual pretraining with contrastive detection. In: ICCV. pp. 10086-10096 (2021) + +17. Hess, G., Tonderski, A., Petersson, C., Åström, K., Svensson, L.: Lidarclip or: How i learned to talk to point clouds. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 7438-7447 (January 2024) +18. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015) +19. Jatavallabhula, K., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., Tenenbaum, J., de Melo, C., Krishna, M., Paull, L., Shkurti, F., Torralba, A.: Conceptfusion: Open-set multimodal 3d mapping. Robotics Science and Systems (2023) +20. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: Lerf: Language embedded radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 19729-19739 (2023) +21. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., Dollar, P., Girshick, R.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 4015-4026 (October 2023) +22. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: ICLR (2022) +23. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022) +24. Liu, Y., Kong, L., Cen, J., Chen, R., Zhang, W., Pan, L., Chen, K., Liu, Z.: Segment any point cloud sequences by distilling vision foundation models. In: Advances in Neural Information Processing Systems (2023) +25. Liu, Y.C., Huang, Y.K., Chiang, H.Y., Su, H.T., Liu, Z.Y., Chen, C.T., Tseng, C.Y., Hsu, W.H.: Learning from 2d: Contrastive pixel-to-point knowledge transfer for 3d pretraining. arXiv preprint arXiv:2104.04687 (2021) +26. Mahmoud, A., Elhoushi, M., Abbas, A., Yang, Y., Ardalani, N., Leather, H., Morcos, A.S.: Sieve: Multimodal dataset pruning using image captioning models. In: CVPR. pp. 22423-22432 (2024) +27. Mahmoud, A., Hu, J.S.K., Kuai, T., Harakeh, A., Paull, L., Waslander, S.L.: Self-supervised image-to-point distillation via semantically tolerant contrastive loss. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7102-7110 (June 2023) +28. Mahmoud, A., Hu, J.S., Waslander, S.L.: Dense voxel fusion for 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 663-672 (2023) +29. Mahmoud, A., Waslander, S.L.: Sequential fusion via bounding box and motion pointpainting for 3d objection detection. In: 18th Conference on Robots and Vision (CRV) (2021) +30. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023) +31. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3967-3976 (2019) +32. Parnami, A., Lee, M.: Learning from few examples: A summary of approaches to few-shot learning. arXiv preprint arXiv:2203.04291 (2022) + +33. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T., et al.: Openscene: 3d scene understanding with open vocabularies. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 815-824 (2023) +34. Puy, G., Gidaris, S., Boulch, A., Simeoni, O., Sautier, C., Perez, P., Bursuc, A., Marlet, R.: Revisiting the distillation of image representations into point clouds for autonomous driving. arXiv preprint arXiv:2310.17504 (2023) +35. Qian, J., Chatrath, V., Yang, J., Servos, J., Schoellig, A.P., Waslander, S.L.: Pocd: Probabilistic object-level change detection and volumetric mapping in semi-static scenes. Robotics: Science and Systems (2022) +36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) +37. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014) +38. Sautier, C., Puy, G., Gidaris, S., Boulch, A., Bursuc, A., Marlet, R.: Image-to-lidar self-supervised distillation for autonomous driving data. In: CVPR. pp. 9891-9901 (2022) +39. Shi, P., Welle, M.C., Björkman, M., Kragic, D.: Towards understanding the modality gap in CLIP. In: ICLR 2023 Workshop on Multimodal Representation Learning: Perks and Pitfalls (2023) +40. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019) +41. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: CVPR. pp. 2495-2504 (2021) +42. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020) +43. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016) +44. Zhang, R., Guo, Z., Zhang, W., Li, K., Miao, X., Cui, B., Qiao, Y., Gao, P., Li, H.: Pointclip: Point cloud understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8552-8562 (2022) +45. Zhang, Z., Girdhar, R., Joulin, A., Misra, I.: Self-supervised pretraining of 3d features on any point-cloud. In: ICCV. pp. 10252-10263 (October 2021) +46. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022) +47. Zhu, X., Zhang, R., He, B., Zeng, Z., Zhang, S., Gao, P.: Pointclip v2: Adapting clip for powerful 3d open-world learning. arXiv preprint arXiv:2211.11682 (2022) \ No newline at end of file diff --git a/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/images.zip b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..6b9a97316c79e7849edd4056e892c453126af72f --- /dev/null +++ b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:de889342b53911e2e8d71f8c81bd6c16c8b3b6eab0667837549b7125f318f0d7 +size 407764 diff --git a/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/layout.json b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..83ecf2f0f48548791ee1187faac9691a65a2b512 --- /dev/null +++ b/2024/Image-to-Lidar Relational Distillation for Autonomous Driving Data/layout.json @@ -0,0 +1,8492 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 163, + 111, + 455, + 149 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 163, + 111, + 455, + 149 + ], + "spans": [ + { + "bbox": [ + 163, + 111, + 455, + 149 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 173, + 167, + 444, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 167, + 444, + 182 + ], + "spans": [ + { + "bbox": [ + 173, + 167, + 444, + 182 + ], + "type": "text", + "content": "Anas Mahmoud1, Ali Harakeh2, and Steven Waslander1" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 259, + 190, + 356, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 259, + 190, + 356, + 201 + ], + "spans": [ + { + "bbox": [ + 259, + 190, + 356, + 201 + ], + "type": "text", + "content": "1 University of Toronto" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 247, + 201, + 367, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 201, + 367, + 212 + ], + "spans": [ + { + "bbox": [ + 247, + 201, + 367, + 212 + ], + "type": "text", + "content": "2 Mila - Quebec AI Institute" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 245, + 455, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 245, + 455, + 510 + ], + "spans": [ + { + "bbox": [ + 159, + 245, + 455, + 510 + ], + "type": "text", + "content": "Abstract. Pre-trained on extensive and diverse multi-modal datasets, 2D foundation models excel at addressing 2D tasks with little or no downstream supervision, owing to their robust representations. The emergence of 2D-to-3D distillation frameworks has extended these capabilities to 3D models. However, distilling 3D representations for autonomous driving datasets presents challenges like self-similarity, class imbalance, and point cloud sparsity, hindering the effectiveness of contrastive distillation, especially in zero-shot learning contexts. Whereas other methodologies, such as similarity-based distillation, enhance zero-shot performance, they tend to yield less discriminative representations, diminishing few-shot performance. We investigate the gap in structure between the 2D and the 3D representations that result from state-of-the-art distillation frameworks and reveal a significant mismatch between the two. Additionally, we demonstrate that the observed structural gap is negatively correlated with the efficacy of the distilled representations on zero-shot and few-shot 3D semantic segmentation. To bridge this gap, we propose a relational distillation framework enforcing intra-modal and cross-modal constraints, resulting in distilled 3D representations that closely capture the structure of the 2D representation. This alignment significantly enhances 3D representation performance over those learned through contrastive distillation in zero-shot segmentation tasks. Furthermore, our relational loss consistently improves the quality of 3D representations in both in-distribution and out-of-distribution few-shot segmentation tasks, outperforming approaches that rely on the similarity loss." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 531, + 231, + 544 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 531, + 231, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 531, + 231, + 544 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 557, + 483, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 483, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 483, + 668 + ], + "type": "text", + "content": "Understanding 3D scenes is pivotal for robotics applications [19,35], notably in autonomous driving, where accurate navigation and decision-making depend on precise environmental perception. Solving the perception tasks necessary for 3D scene understanding requires the point-wise labelling of LiDAR scenes, which is tedious, compounded by the sparsity of LiDAR data, and costly [28,29]. These issues result in a scarcity of large-scale, diverse point cloud datasets, particularly those aligned with images or text, significantly hampering the development of foundation models for 3D tasks. This shortage is particularly problematic for few-shot or zero-shot learning approaches, which aim to achieve proficiency with" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 118, + 473, + 213 + ], + "blocks": [ + { + "bbox": [ + 137, + 118, + 473, + 213 + ], + "lines": [ + { + "bbox": [ + 137, + 118, + 473, + 213 + ], + "spans": [ + { + "bbox": [ + 137, + 118, + 473, + 213 + ], + "type": "image", + "image_path": "d28fbee0168ce91a28569b8898fae8eb44f4a8ffd58708df01e7eabe69f27d8e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 224, + 482, + 324 + ], + "lines": [ + { + "bbox": [ + 130, + 224, + 482, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 482, + 324 + ], + "type": "text", + "content": "Fig. 1: We distill 2D representations from CLIP [36] to a 3D point-cloud encoder using the contrastive loss, similarity loss, and our proposed relational loss, and compute the uniformity (U), tolerance (T), and modality gap (G) of the learned 3D representations. We sample 5000 point features from each of the 16 classes defined in the nuScenes dataset [5], apply PCA and visualize the primary components. The source U and T of the CLIP image encoder are 1.54 and 0.73, respectively. Compared to the source, we see that contrastive loss learns 3D representations with higher U and lower T compared to the source, while the trends are reversed for similarity loss. Our proposed relational loss minimizes this structural mismatch and leads to the lowest modality gap." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 337, + 482, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 337, + 482, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 337, + 482, + 361 + ], + "type": "text", + "content": "minimal or no labelled examples 432. Bridging this gap is vital for creating models adept at understanding complex 3D scenes with limited data." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 363, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 363, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 363, + 482, + 495 + ], + "type": "text", + "content": "Contrary to the 3D domain, the 2D and language domains benefit from the availability of large-scale, diverse, and multi-modal datasets, which facilitated the development of Vision Foundation Models (VFMs) [7,30], and Vision-Language Models (VLMs) [36,46]. These models have shown remarkable label efficiency in 2D tasks like image classification and segmentation and have also been used to perform label-free 2D image classification and segmentation through language prompts during inference [26,36]. Due to these advantages, recent approaches for learning 3D representations have relied on the distillation of 2D representations from VFMs [25,27,38] or VLMs [9,33,44] to point cloud encoders, and have shown encouraging results when solving few-shot and zero-shot 3D tasks." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 483, + 666 + ], + "type": "text", + "content": "Unfortunately, the adaptation of 2D-to-3D distillation frameworks for autonomous driving (AD) datasets reveals unique challenges, notably due to the inherent characteristics of AD data. Current frameworks, largely reliant on contrastive learning methods, face the issue of self-similarity [27], a prevalent phenomenon in AD datasets. Self-similarity arises when a significant portion of the training examples belong to a single semantic category (e.g. road, trees or sky in AD data). Under the effect of self-similarity, the contrastive loss mechanism, designed to be hardness-aware [41], inadvertently pushes away semantically similar samples, which not only disrupts the local semantic coherence of the 3D representation [24,27,38] but also amplifies the effects of AD datasets' severe class imbalance. As a result, while such frameworks may result in useful 3D representations for few-shot learning tasks, the misalignment induced by excessive pushing of semantically similar examples undermines their efficacy in zero-shot learning scenarios, where precise cross-modal alignment is crucial. Another approach" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "text", + "content": "to distillation relies on the cosine similarity loss, which attempts to learn a 3D representation by driving the features generated for every 3D point by a point encoder to its corresponding 2D feature from VFMs or VLMs. Using the similarity loss results in 3D representations that achieve significantly better performance on the zero-shot tasks compared to ones learned with the contrastive loss. However, we argue in Section 3 that using the similarity loss under-constrains the pretraining when compared to the contrastive loss, resulting in sub-optimal 3D representations on few-shot downstream tasks." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 212, + 482, + 284 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 212, + 482, + 284 + ], + "spans": [ + { + "bbox": [ + 130, + 212, + 482, + 284 + ], + "type": "text", + "content": "To highlight the mismatch discussed above, we provide an example visualization of the 3D representation space (Fig. ①), which was obtained by distilling from CLIP's ③ 2D representation space using both the contrastive and similarity losses. We observe that both losses result in 3D representations that diverge from the structure of the 2D representation as measured by uniformity, tolerance, and the modality gap, which we further explain in Section ③." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 284, + 482, + 354 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 284, + 482, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 482, + 354 + ], + "type": "text", + "content": "In this work, we investigate the impact of state-of-the-art 2D-to-3D distillation frameworks on the structure of learned 3D representations. We show that the choice of loss during pretraining can result in a significant mismatch between the structure of the 2D source representations and the distilled 3D representations. Furthermore, we demonstrate that this mismatch leads to a deterioration in performance on downstream tasks. Our contributions are as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 361, + 481, + 408 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 361, + 481, + 408 + ], + "spans": [ + { + "bbox": [ + 138, + 361, + 481, + 408 + ], + "type": "text", + "content": "- Quantify the Gap: We quantify the mismatch in structure when performing distillation using contrastive loss [12,25,38] and similarity loss [17,33] via the uniformity [41,42], tolerance [41], and modality gap [23], revealing a significant gap between 2D and distilled 3D representations." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 408, + 481, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 408, + 481, + 491 + ], + "spans": [ + { + "bbox": [ + 138, + 408, + 481, + 491 + ], + "type": "text", + "content": "- Bridging the Gap using Relational Distillation: We address this mismatch by imposing structural constraints that foster the learning of a 3D representation aligned with the structure of 2D representations. To achieve this, we employ pretraining with intra-modal and cross-modal relational losses. These losses generalize the similarity loss, providing a more effective constraint on the distillation process. Our proposed losses can be applied to pixel-based [25] and superpixel-based [38] distillation frameworks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 491, + 481, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 481, + 586 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 481, + 586 + ], + "type": "text", + "content": "- Bridging the Gap Improves Downstream Performance: Our proposed loss effectively minimizes the mismatch between learned 3D and 2D representations from multiple VLM and VFM image encoders, quantified by differences in the U, T, and G (Fig. 1). Consequently, the resulting 3D representations significantly outperform those learned via contrastive distillation on zero-shot segmentation tasks. Furthermore, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 602, + 237, + 615 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 602, + 237, + 615 + ], + "spans": [ + { + "bbox": [ + 132, + 602, + 237, + 615 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 624, + 343, + 636 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 624, + 343, + 636 + ], + "spans": [ + { + "bbox": [ + 131, + 624, + 343, + 636 + ], + "type": "text", + "content": "2.1 Cross-Modal Knowledge Distillation" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 641, + 481, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 667 + ], + "type": "text", + "content": "Knowledge Distillation enables a student network to learn a task by mimicking the output of highly-performing teacher networks [13], achieved by using" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 237 + ], + "type": "text", + "content": "these output as training targets for the student network [18], or by supervising the student network using the teacher's intermediate representations [37,40,43]. Distilling representations rather than network predictions enables knowledge transfer across different modalities, without requiring labels. In the context of cross-modal distillation, contrastive distillation [12,40] has shown to be the most effective. However, the abundance of self-similarity [27], coupled with the hardness-aware property of contrastive losses [41] limits the effectiveness of contrastive losses for AD data. On the other hand, similarity losses only utilize positive pairs for distillation, resulting in an under-constrained loss, leading to sub-optimal performance on zero-shot tasks [12]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 255, + 376, + 268 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 255, + 376, + 268 + ], + "spans": [ + { + "bbox": [ + 131, + 255, + 376, + 268 + ], + "type": "text", + "content": "2.2 3D Representations for Few-Shot Learning" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 277, + 482, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 277, + 482, + 517 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 482, + 517 + ], + "type": "text", + "content": "Few-shot learning refers to learning the underlying pattern in data from only a few training samples [32]. Distilling 3D representations from 2D self-supervised models [26,7,10,14,15] or VFMs [30,36] has shown to be effective at significantly improving performance on 3D few-shot tasks [24,27,38]. PPKT [25] proposes a pixel-based contrastive loss to distill 2D self-supervised representations to point cloud encoders. While effective in indoor settings, PPKT [25] underperforms in outdoor settings where point-to-pixel correspondences are sparse [38]. Inspired by DetCon [16], SLidR [38] proposes a superpixel-based contrastive loss primarily designed for autonomous driving scenes which constructs region-level contrastive pairs suited for distilling scene-level images [16]. Due to the abundance of self-similarity in AD data [24,27,38], contrastive distillation leads to sub-optimal 3D representations [27]. To address these challenges, ST-SLidR [27] proposes a semantically tolerant contrastive loss leading to improved 3D representations for 3D few-shot segmentation tasks. Finally, Seal [24] demonstrates that object priors from VFMs like SAM [21], represented as superpixels, can improve the quality of 3D representations for 3D few-shot segmentation tasks. In this paper, we demonstrate that pixel and superpixel-based contrastive distillation applied to AD data, learn 3D representations that significantly differ from the structure of 2D representations. This leads to poor performance on zero-shot tasks and unpredictable performance on few-shot tasks." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 536, + 379, + 548 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 536, + 379, + 548 + ], + "spans": [ + { + "bbox": [ + 131, + 536, + 379, + 548 + ], + "type": "text", + "content": "2.3 3D Representations for Zero-Shot Learning" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": "Contrastive Language-Image Pre-training (CLIP) models are pre-trained on billions of webscale image-text pairs and have shown great success in solving zero-shot image classification tasks [36]. Using frozen CLIP vision encoders, Image-Bind [12] enables zero-shot image classification by distilling image-level representations via a contrastive distillation framework. LidarCLIP [17] aligns LiDAR point features to CLIP space, demonstrating effective cross-modal retrieval and image-level zero-shot classification. PointCLIP [44] and PointCLIPv2 [47] propose a distillation-free approach utilizing CLIP vision and text encoders during the inference stage to solve 3D zero-shot classification tasks. More recently," + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 274 + ], + "type": "text", + "content": "MaskCLIP [46] proposes removing the last attention pooling layer in CLIP vision encoders to enable dense feature extraction for 2D zero-shot segmentation tasks. OpenScene [33] distills image features from CLIP models fine-tuned on 2D segmentation datasets [11,22] to point cloud encoders. As demonstrated by ConceptFusion [19] and LERF [20], due to fine-tuning on closed-set 2D segmentation labels, these CLIP models have poor open-set capabilities. During inference, OpenScene fuses image and point features to solve 3D zero-shot segmentation. In this work, we do not assume access to finetuned CLIP models or access to image data during inference time. CLIP2Scene [9] assumes knowledge of class names of objects in the pre-training dataset, which leads to a contrastive loss with fewer false negatives. Requiring class names is problematic as it assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes and limiting open-set capabilities [34]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 289, + 233, + 304 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 289, + 233, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 289, + 233, + 304 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 313, + 228, + 324 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 313, + 228, + 324 + ], + "spans": [ + { + "bbox": [ + 132, + 313, + 228, + 324 + ], + "type": "text", + "content": "3.1 Preliminaries" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": "Our objective is to generate useful 3D representations by learning a point cloud encoder, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "f: \\mathbb{R}^{N \\times (3 + L)} \\to \\mathbb{R}^{N \\times C}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ", through distilling 2D representations from VFMs or VLMs (e.g., CLIP [36], DINOv2 [30]). Using camera-to-LiDAR calibration matrices, we create a set of positive pairs of point, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "\\mathbf{K}_{\\mathbf{p}} \\in \\mathbb{R}^{N \\times C}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ", and pixel, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "\\mathbf{Q}_{\\mathbf{p}} \\in \\mathbb{R}^{N \\times C}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ", features, with the latter being generated from the pre-trained image encoder of the foundation model, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "g: \\mathbb{R}^{N \\times 3} \\to \\mathbb{R}^{N \\times C}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ". While distillation methods like PPKT [25] implement distillation losses by creating pixel-point positive pairs, techniques such as SLidR [38] optimize pair formation by harnessing boundary information from superpixels. SLidR, with " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": " superpixels per image, employs average pooling to group points, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "\\mathbf{K}_{\\mathbf{p}}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ", and pixels, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "\\mathbf{Q}_{\\mathbf{p}}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ", into superpoint, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "\\mathbf{K}_{\\mathbf{sp}} \\in \\mathbb{R}^{M \\times C}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ", and superpixel, " + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "inline_equation", + "content": "\\mathbf{Q}_{\\mathbf{sp}} \\in \\mathbb{R}^{M \\times C}" + }, + { + "bbox": [ + 130, + 332, + 482, + 499 + ], + "type": "text", + "content": ", features, improving feature correspondence. Superpixels are derived from unsupervised techniques like SLIC [1], or foundation models such as SAM [21,24]. One of the most effective cross-modal distillation losses is the contrastive loss:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 179, + 506, + 481, + 539 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 179, + 506, + 481, + 539 + ], + "spans": [ + { + "bbox": [ + 179, + 506, + 481, + 539 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {c o n} \\left(\\mathbf {K}, \\mathbf {Q}\\right) = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\log \\left[ \\frac {e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\right\\rangle / \\tau\\right)}}{\\sum_ {j \\neq i} e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {j} \\right\\rangle / \\tau\\right)} + e ^ {\\left(\\left\\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\right\\rangle / \\tau\\right)}} \\right] (1)", + "image_path": "caa7b194ae3c0e96e4c8a95e39d1060b0a46a2f0044464d95c9a2a29332a7232.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{K}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{Q}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " can either be point/pixel (i.e., " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{K_p}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{Q_p}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ") or superpoint/superpixel (i.e., " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{K_{sp}}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{Q_{sp}}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ") feature vectors, " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "B" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " is the number of positive pairs in a mini-batch, " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " is the temperature, and " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\langle \\mathbf{k}_i, \\mathbf{q}_j \\rangle" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " is the dot product between the " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\ell_2" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "-normalized features. The contrastive loss distills information from pre-trained image encoders by pulling the point cloud features, " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ", towards their corresponding (positive) image feature, " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "Q" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ", in representation space, simultaneously pushing them away from all the other (negative) image features. The temperature, " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ", controls the strength of this push/pull mechanism by modifying the gradient's scale from the negative samples [41]. However, a significant limitation of this approach is the potential degradation in the learned point cloud representation's" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "quality due to false negative samples [27]. These are image features incorrectly chosen as negative, despite belonging to the same semantic class as the positive point cloud feature, leading to opposing distillation signals." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 480, + 176 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 480, + 176 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 480, + 176 + ], + "type": "text", + "content": "To avoid both relying on negative examples while performing distillation, and tuning the temperature parameter, we can use the cosine similarity:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 228, + 186, + 481, + 218 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 186, + 481, + 218 + ], + "spans": [ + { + "bbox": [ + 228, + 186, + 481, + 218 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {s i m} (\\mathbf {K}, \\mathbf {Q}) = \\frac {1}{B} \\sum_ {i = 1} ^ {B} (1. 0 - \\langle \\mathbf {k} _ {i}, \\mathbf {q} _ {i} \\rangle) \\tag {2}", + "image_path": "56a9b5571363050a53d8687ae8f61539df284a4c41316be1a02b5aabeea05bef.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 227, + 479, + 264 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 227, + 479, + 264 + ], + "spans": [ + { + "bbox": [ + 131, + 227, + 479, + 264 + ], + "type": "text", + "content": "The similarity loss does not rely on negative samples and thus has a much simpler mode of action. It focuses solely on drawing each point cloud feature, " + }, + { + "bbox": [ + 131, + 227, + 479, + 264 + ], + "type": "inline_equation", + "content": "\\mathbf{k}_i" + }, + { + "bbox": [ + 131, + 227, + 479, + 264 + ], + "type": "text", + "content": ", nearer to its corresponding image feature, " + }, + { + "bbox": [ + 131, + 227, + 479, + 264 + ], + "type": "inline_equation", + "content": "\\mathbf{q}_i" + }, + { + "bbox": [ + 131, + 227, + 479, + 264 + ], + "type": "text", + "content": ", effectively maximizing their dot product." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 281, + 424, + 295 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 281, + 424, + 295 + ], + "spans": [ + { + "bbox": [ + 131, + 281, + 424, + 295 + ], + "type": "text", + "content": "3.2 Quantifying the Quality of Distilled Representations" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": "We investigate the quality of the distilled 3D representations as a function of the distillation loss used during training. We hypothesize that if a distilled 3D representation space closely captures the structure of the source 2D representation space, our resulting 3D encoder would: 1) possess the enhanced representation capability of the source vision/vision-language foundation model and 2) generate 3D representations that are well-aligned with the text representations of the vision-language model, enabling zero-shot downstream tasks. To assess the structural similarity between two representation spaces, we utilize uniformity and tolerance, two metrics previously proposed by Wang et al. [41], for evaluating the quality of a representation space. Uniformity measures the distribution of " + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "inline_equation", + "content": "\\ell_2" + }, + { + "bbox": [ + 130, + 303, + 482, + 471 + ], + "type": "text", + "content": "-normalized features on a hyper-sphere. Authors in [42] have demonstrated that a high uniformity is key for high-quality representations as it quantifies that the trained encoder has successfully utilized a substantial part of the available feature space. Uniformity is formulated using a Gaussian potential function as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 216, + 489, + 481, + 510 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 489, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 216, + 489, + 481, + 510 + ], + "type": "interline_equation", + "content": "\\mathrm {U} (f (\\cdot)) = - \\log \\underset {x, y \\sim p _ {\\mathrm {d a t a}}} {\\mathbb {E}} \\left[ e ^ {- t | | f (x) - f (y) | | _ {2} ^ {2}} \\right] \\tag {3}", + "image_path": "87ea5a06601d4bd06b791836cb2ed0ca13890f904cb608b55b8ef02b15bd8d56.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "inline_equation", + "content": "f(.)" + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "content": " is the point encoder and " + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "inline_equation", + "content": "x, y" + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "content": " are two samples from the data-distribution " + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "inline_equation", + "content": "p_{\\mathrm{data}}" + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "inline_equation", + "content": "x, y" + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "content": " are point features for 3D point encoders. Similarly, we compute the uniformity of " + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "inline_equation", + "content": "U(g(.)" + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "content": " ) for the image encoder by setting " + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "inline_equation", + "content": "x, y" + }, + { + "bbox": [ + 130, + 520, + 484, + 555 + ], + "type": "text", + "content": " as pixel features." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 556, + 480, + 580 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 556, + 480, + 580 + ], + "spans": [ + { + "bbox": [ + 130, + 556, + 480, + 580 + ], + "type": "text", + "content": "On the other hand, tolerance measures the semantic clustering for the " + }, + { + "bbox": [ + 130, + 556, + 480, + 580 + ], + "type": "inline_equation", + "content": "\\ell_2" + }, + { + "bbox": [ + 130, + 556, + 480, + 580 + ], + "type": "text", + "content": "-normalized output representations from a given encoder, computed as:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 212, + 590, + 481, + 608 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 212, + 590, + 481, + 608 + ], + "spans": [ + { + "bbox": [ + 212, + 590, + 481, + 608 + ], + "type": "interline_equation", + "content": "T (f (.) = \\underset {x, y \\sim p _ {\\mathrm {d a t a}}} {\\mathbb {E}} \\left[ \\left(f (x) ^ {T} f (y)\\right) \\cdot I _ {l (x) = l (y)} \\right] \\tag {4}", + "image_path": "d1ddabb8b4e570b29111a31064b28b01e6c88d629480002f212f594f4f42a447.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "l(x)" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " represents the class label of point " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "I_{l(x) = l(y)}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " is an indicator function, having the value of 1 for " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "l(x) = l(y)" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and the value of 0 for " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "l(x) \\neq l(y)" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ". A higher tolerance indicates that the features of all points belonging to a certain class are better clustered together on a unit sphere. Similar to uniformity, we can compute" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 101 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 191, + 116, + 269, + 167 + ], + "blocks": [ + { + "bbox": [ + 191, + 116, + 269, + 167 + ], + "lines": [ + { + "bbox": [ + 191, + 116, + 269, + 167 + ], + "spans": [ + { + "bbox": [ + 191, + 116, + 269, + 167 + ], + "type": "image", + "image_path": "63fd452a4d1abce4961d04b8474b0c4ba92f3756650b6da3cbfecc077eef3905.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 192, + 170, + 269, + 209 + ], + "blocks": [ + { + "bbox": [ + 192, + 170, + 269, + 209 + ], + "lines": [ + { + "bbox": [ + 192, + 170, + 269, + 209 + ], + "spans": [ + { + "bbox": [ + 192, + 170, + 269, + 209 + ], + "type": "image", + "image_path": "7822afb40b423aea1815f7774d86852320c11635aa0cb23f8498091bb7f4e43f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 192, + 213, + 269, + 251 + ], + "blocks": [ + { + "bbox": [ + 192, + 213, + 269, + 251 + ], + "lines": [ + { + "bbox": [ + 192, + 213, + 269, + 251 + ], + "spans": [ + { + "bbox": [ + 192, + 213, + 269, + 251 + ], + "type": "image", + "image_path": "b6d80a5dbc35f4074a9caa8be44b1f6dc82d4dea9c2af3322bc1e3e73628a13d.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "lines": [ + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "spans": [ + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "type": "text", + "content": "Fig. 2: Blue: The source representation space, with a uniformity and tolerance of " + }, + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "type": "inline_equation", + "content": "\\mathrm{U} = 0.89" + }, + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "type": "inline_equation", + "content": "\\mathrm{T} = 0.66" + }, + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "type": "text", + "content": ", respectively. Cyan: The predicted representation space. Here, " + }, + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 131, + 262, + 482, + 295 + ], + "type": "text", + "content": " denotes the number of training iterations." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 284, + 116, + 349, + 167 + ], + "blocks": [ + { + "bbox": [ + 284, + 116, + 349, + 167 + ], + "lines": [ + { + "bbox": [ + 284, + 116, + 349, + 167 + ], + "spans": [ + { + "bbox": [ + 284, + 116, + 349, + 167 + ], + "type": "image", + "image_path": "4e5e299eb5e074643b7406caf0e399a097f4c6a2b5f32bf289bcc29839458325.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 285, + 169, + 348, + 209 + ], + "blocks": [ + { + "bbox": [ + 285, + 169, + 348, + 209 + ], + "lines": [ + { + "bbox": [ + 285, + 169, + 348, + 209 + ], + "spans": [ + { + "bbox": [ + 285, + 169, + 348, + 209 + ], + "type": "image", + "image_path": "6f6e1c1e8f8290fe72e8d08f6a524aec9c1b4c998c9184a7d6d9ac6940ae65ab.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 285, + 212, + 347, + 251 + ], + "blocks": [ + { + "bbox": [ + 285, + 212, + 347, + 251 + ], + "lines": [ + { + "bbox": [ + 285, + 212, + 347, + 251 + ], + "spans": [ + { + "bbox": [ + 285, + 212, + 347, + 251 + ], + "type": "image", + "image_path": "05a3600c2c216c9c385ecebd8f899319536d336c35b1f073bc072ffb420de117.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 363, + 118, + 427, + 167 + ], + "blocks": [ + { + "bbox": [ + 363, + 118, + 427, + 167 + ], + "lines": [ + { + "bbox": [ + 363, + 118, + 427, + 167 + ], + "spans": [ + { + "bbox": [ + 363, + 118, + 427, + 167 + ], + "type": "image", + "image_path": "1419c666b58e0caeb50955341e7f337b5eda96ae8766164fdabb18d5d88fdbc4.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 364, + 170, + 427, + 209 + ], + "blocks": [ + { + "bbox": [ + 364, + 170, + 427, + 209 + ], + "lines": [ + { + "bbox": [ + 364, + 170, + 427, + 209 + ], + "spans": [ + { + "bbox": [ + 364, + 170, + 427, + 209 + ], + "type": "image", + "image_path": "4f5cfb89216524ab028801866d2b98db0f01d85ba13069b0c4a0fbda89744768.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 365, + 212, + 427, + 251 + ], + "blocks": [ + { + "bbox": [ + 365, + 212, + 427, + 251 + ], + "lines": [ + { + "bbox": [ + 365, + 212, + 427, + 251 + ], + "spans": [ + { + "bbox": [ + 365, + 212, + 427, + 251 + ], + "type": "image", + "image_path": "368baa43c6c48d948a9117d1fed615c887ff2e038835a87f1bf142e9dda7d669.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 304, + 481, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 481, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 481, + 327 + ], + "type": "text", + "content": "tolerance for the image encoder as " + }, + { + "bbox": [ + 130, + 304, + 481, + 327 + ], + "type": "inline_equation", + "content": "T(g(.))" + }, + { + "bbox": [ + 130, + 304, + 481, + 327 + ], + "type": "text", + "content": ", by propagating 3D point-wise labels to 2D image pixels." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 328, + 481, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 328, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 130, + 328, + 481, + 353 + ], + "type": "text", + "content": "Furthermore, to directly compare the alignment of the two representation spaces from different modalities, we also use the modality gap as proposed in [23]:" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 216, + 363, + 481, + 383 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 363, + 481, + 383 + ], + "spans": [ + { + "bbox": [ + 216, + 363, + 481, + 383 + ], + "type": "interline_equation", + "content": "G (f (.), g (.) = \\underset {x \\sim p _ {\\mathrm {2 D}}} {\\mathbb {E}} [ f (x) ] - \\underset {y \\sim p _ {\\mathrm {3 D}}} {\\mathbb {E}} [ g (y) ] \\tag {5}", + "image_path": "69d0d4c5371aea0c615c39f1577ad73cc690ab0b56b8201a48a0c64af0c97b30.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "text", + "content": "The modality gap measures the difference between the mean of the representation of the point features and their corresponding pixel features. We conclude by noting that unlike G, U and T are properties of a single encoder; we show the difference in representations by comparing the values of " + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "inline_equation", + "content": "U(f(.))" + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "inline_equation", + "content": "T(f(.))" + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "inline_equation", + "content": "U(g(.))" + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "inline_equation", + "content": "T(g(.))" + }, + { + "bbox": [ + 131, + 387, + 482, + 471 + ], + "type": "text", + "content": ", respectively. Closer values indicate our point cloud encoder well-approximates the representation space of the source image encoder, which we show in Section 4 to be beneficial for downstream tasks." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 131, + 489, + 422, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 489, + 422, + 502 + ], + "spans": [ + { + "bbox": [ + 131, + 489, + 422, + 502 + ], + "type": "text", + "content": "3.3 The Representations of Common Distillation Losses" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 510, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 605 + ], + "type": "text", + "content": "Inspired by [39], we explore the structure of the learned representation space using contrastive loss and similarity loss through a toy example. We start with 1000 uniformly distributed points over a 3D unit sphere, representing point features before the distillation phase. Using a 2-layer MLP, we learn to align each input point with its corresponding pixel feature from the source representation space, defined by U and T levels of 0.89 and 0.66, respectively. We use the Adam optimizer with a learning rate of " + }, + { + "bbox": [ + 130, + 510, + 482, + 605 + ], + "type": "inline_equation", + "content": "10^{-4}" + }, + { + "bbox": [ + 130, + 510, + 482, + 605 + ], + "type": "text", + "content": " and train our model for 50,000 iterations (refer to Appendix A for detailed analysis)." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 606, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 482, + 666 + ], + "type": "text", + "content": "Figure 2 shows a visualization of the source representation space (blue) and the predicted representation space (cyan) at various stages of training. The top row highlights a significant difference: the contrastive losses generate a representation space with a high U of 1.38, but with a very low T of 0.02, differing significantly from the source space's U (0.89) and T (0.66). This is attributed" + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "content": "to self-similarity [27], a phenomenon that occurs when points from the source representation space are close to one another, as in our toy example. Although the contrastive loss moves a particular prediction to its corresponding point in the source, its hardness-awareness property [41] pushes all other predictions, particularly close ones, away from that point. Combined with self-similarity, this yields a uniform predicted space with a low T, and a significant modality gap. As demonstrated in Section 4, this discrepancy hinders zero-shot task performance due to inadequate cross-modal alignment." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "text", + "content": "On the other hand, learning with similarity loss leads to representations with lower U (0.59) and higher T (0.80) compared to the source. This stems from the tendency of similarity loss to form compact clusters in the predicted space, as shown with autonomous driving data in Figure 1 and the toy example in Figure 2. Notably, early training " + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "inline_equation", + "content": "(t = 1000)" + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "text", + "content": " exhibits noticeable clustering that disperses with additional epochs. Additionally, the non-uniqueness of the dot product between the learnable point vector, " + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{k}_i" + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "text", + "content": ", and the fixed pixel vector, " + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{q}_i" + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "text", + "content": ", within the framework of similarity loss (Eq. 2) results in a significant increase in the number of learnable vectors that can achieve the same cosine similarity with the fixed vector, " + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{q}_i" + }, + { + "bbox": [ + 130, + 213, + 483, + 369 + ], + "type": "text", + "content": ". This growth can result in slow convergence and suboptimal predicted representation spaces. Combined with neural network optimization complexities, these issues lead to the observed disparity in uniformity and tolerance from the source representation space in distillation tasks using similarity loss." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 390, + 238, + 400 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 390, + 238, + 400 + ], + "spans": [ + { + "bbox": [ + 132, + 390, + 238, + 400 + ], + "type": "text", + "content": "3.4 Relational Loss" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 414, + 482, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 414, + 482, + 485 + ], + "spans": [ + { + "bbox": [ + 130, + 414, + 482, + 485 + ], + "type": "text", + "content": "Inspired by distilling relations in model compression [31], this section presents two relational losses that impose structural constraints on the 3D representation space. This modification disrupts the symmetry inherent in the similarity loss. It drives the network to select solutions that, while possessing equivalent similarity loss values to alternatives, yield a 3D representation space that more accurately mirrors the structure of the image representation space." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 487, + 482, + 546 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 482, + 546 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 482, + 546 + ], + "type": "text", + "content": "Cross-modal Relational Loss We propose imposing a constraint on the structure of the learned 3D representation space to ensure that the similarities between a given predicted point feature, " + }, + { + "bbox": [ + 130, + 487, + 482, + 546 + ], + "type": "inline_equation", + "content": "\\mathbf{k}_i" + }, + { + "bbox": [ + 130, + 487, + 482, + 546 + ], + "type": "text", + "content": ", and all source pixel features align with the similarities between its corresponding pixel feature, " + }, + { + "bbox": [ + 130, + 487, + 482, + 546 + ], + "type": "inline_equation", + "content": "\\mathbf{q}_i" + }, + { + "bbox": [ + 130, + 487, + 482, + 546 + ], + "type": "text", + "content": ", and all other source pixel features in the same batch. The cross-modal relation loss is defined as:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 142, + 556, + 481, + 662 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 556, + 481, + 662 + ], + "spans": [ + { + "bbox": [ + 142, + 556, + 481, + 662 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal{L}_{cross}\\left(\\mathbf{K},\\mathbf{Q}\\right) = \\frac{1}{N}\\sum_{i = 1}^{N}\\mathbf{C}_{ii} + \\frac{1}{N^{2} - N}\\sum_{i = 1}^{N}\\sum_{\\substack{j = 1\\\\ i\\neq j}}^{N}\\mathbf{C}_{ij} \\\\ = \\underbrace {\\frac {1}{N} \\sum_ {i = 1} ^ {N} \\left(1 . 0 - \\langle \\mathbf {k} _ {i} , \\mathbf {q} _ {i} \\rangle\\right)} _ {\\mathcal {L} _ {s i m} (\\mathbf {K}, \\mathbf {Q})} + \\frac {1}{N ^ {2} - N} \\sum_ {i = 1} ^ {N} \\sum_ {\\substack {j = 1 \\\\ i \\neq j}} ^ {N} | \\langle \\mathbf {k} _ {i}, \\mathbf {q} _ {j} \\rangle - \\langle \\mathbf {q} _ {i}, \\mathbf {q} _ {j} \\rangle | \\tag{6} \\\\ \\end{array}", + "image_path": "5f3b1862f84daa6b7764e96b0228fd65e75e533eeff98e3a1f2b062723c198fc.jpg" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "inline_equation", + "content": "\\mathbf{C} = |\\mathbf{KQ}^T -\\mathbf{QQ}^T|" + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": " represents the matrix of differences, capturing the discrepancy between the predicted point-to-pixel and the source pixel-to-pixel similarities. First, the matrix's diagonal components, " + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "inline_equation", + "content": "\\mathbf{C}_{ii}" + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": ", are directly linked to the similarity loss, underscoring the necessity of aligning each point feature with its corresponding source pixel feature. The second term of Equation 6 facilitates learning a point feature, " + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "inline_equation", + "content": "\\mathbf{k}_i" + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": ", that is not only close to its corresponding source pixel feature, " + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "inline_equation", + "content": "\\mathbf{q}_i" + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": ", but is also consistent with " + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "inline_equation", + "content": "\\mathbf{q}_i" + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": "'s similarities to other pixel features, " + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "inline_equation", + "content": "\\langle \\mathbf{q}_i,\\mathbf{q}_j\\rangle" + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "inline_equation", + "content": "j\\neq i" + }, + { + "bbox": [ + 130, + 115, + 479, + 224 + ], + "type": "text", + "content": ". These cross-modal constraints foster learning point features that maintain the relational structure within the image representation space." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": "Intra-modal Relational Loss Another strategy to ensure structural similarity between the 3D and 2D representation spaces involves directly penalizing differences in their relational graphs. A relational graph of a representation space can be understood as a graph with the nodes representing point or pixel features, and edges indicating the similarity between node features. We represent the relational graph of the point features and the pixel features using " + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "inline_equation", + "content": "\\mathbf{K}\\mathbf{K}^T" + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "inline_equation", + "content": "\\mathbf{Q}\\mathbf{Q}^T" + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": ", respectively. Here, " + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "inline_equation", + "content": "\\langle \\mathbf{k}_i,\\mathbf{k}_j\\rangle" + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": " represents the similarity between the " + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "inline_equation", + "content": "i^{th}" + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": " and the " + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "inline_equation", + "content": "j^{th}" + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": " predicted point feature. We denote the discrepancy of the relational graphs as " + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "inline_equation", + "content": "\\mathbf{U} = |\\mathbf{K}\\mathbf{K}^T -\\mathbf{Q}\\mathbf{Q}^T|" + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": ". Since this matrix is symmetric, and its diagonal elements, " + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "inline_equation", + "content": "|\\langle \\mathbf{k}_i,\\mathbf{k}_i\\rangle -\\langle \\mathbf{q}_i,\\mathbf{q}_i\\rangle |" + }, + { + "bbox": [ + 130, + 228, + 480, + 360 + ], + "type": "text", + "content": ", degenerate to 0, the intra-modal relational loss is expressed as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 223, + 378, + 480, + 410 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 378, + 480, + 410 + ], + "spans": [ + { + "bbox": [ + 223, + 378, + 480, + 410 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {i n t r a}} (\\mathbf {K}, \\mathbf {Q}) = \\frac {2}{N ^ {2} - N} \\sum_ {i = 1} ^ {N - 1} \\sum_ {j = i + 1} ^ {N} \\mathbf {U} _ {i j} \\tag {7}", + "image_path": "a28333dcb59492f6245afab5cd85d521d79de626d503ffc6d849913658f6df98.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 429, + 479, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 429, + 479, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 429, + 479, + 489 + ], + "type": "text", + "content": "The consequence of this loss on the structure of the point representation space is simple; the similarity between a predicted point feature and other predicted point features in a batch should match the similarity between its corresponding source pixel feature and other source pixel features in the same batch. Our proposed relational loss is a combination of the two losses:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 212, + 510, + 480, + 521 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 212, + 510, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 212, + 510, + 480, + 521 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {r e l} (\\mathbf {K}, \\mathbf {Q}) = \\mathcal {L} _ {i n t r a} (\\mathbf {K}, \\mathbf {Q}) + \\mathcal {L} _ {c r o s s} (\\mathbf {K}, \\mathbf {Q}) \\tag {8}", + "image_path": "59e2fb325d0b0b71f0b1ba96177a75eb6cb08972e74d9086ab62599e3dc51c2b.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Unlike the similarity loss, the proposed loss ensures learned point cloud features align with image features in a structured manner, preserving the data's inherent relationships. Figure 2 reveals two key advantages of relational loss over similarity loss: closer alignment of the predicted space's U and T with those of the source space, alongside a reduced G between the two spaces. Additionally, the relational loss achieves faster convergence, as the visual appearance of the predicted representation space resulting from learning with the relational loss remains consistent from the mid-point of training (t=25000) to its conclusion (t=50000). In Section 4 we further illustrate how these attributes of the relational loss contribute to enhanced performance in downstream tasks." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 148, + 223, + 162 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 148, + 223, + 162 + ], + "spans": [ + { + "bbox": [ + 132, + 148, + 223, + 162 + ], + "type": "text", + "content": "4.1 Pre-training" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 177, + 482, + 262 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 177, + 482, + 262 + ], + "spans": [ + { + "bbox": [ + 130, + 177, + 482, + 262 + ], + "type": "text", + "content": "Backbones We focus on distilling 2D representations from two vision foundation models, CLIP [36], pretrained on the WIT dataset containing 400 million image-text pairs, and DINOv2 [30], pretrained on the LVD-142 dataset containing 142 million images. For CLIP encoders, we experiment with different pre-trained architectures available from OpenAI [36]. For the 3D backbone, we use a randomly initialized Minkowski U-Net [38]. For details on the design of the 2D and 3D projection layers, refer to Appendix C." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 262, + 482, + 335 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 262, + 482, + 335 + ], + "spans": [ + { + "bbox": [ + 130, + 262, + 482, + 335 + ], + "type": "text", + "content": "Dataset In the pre-training phase we use the nuScenes dataset [5], consisting of 700 scenes. In line with previous works [24,27,38], these scenes are divided into two subsets: 600 scenes for pre-training and 100 scenes for the determination of the best hyper-parameters. Throughout this pre-training process, we exclusively employ keyframes from the 600 scenes to train all models. For pre-training hyperparameters and data-augmentation details, refer to Appendix B." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 360, + 215, + 371 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 360, + 215, + 371 + ], + "spans": [ + { + "bbox": [ + 132, + 360, + 215, + 371 + ], + "type": "text", + "content": "4.2 Evaluation" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 388, + 482, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 532 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 532 + ], + "type": "text", + "content": "To study the effect of the distillation framework on the structure of the 3D representations, we evaluate the average U, T, and G between the distilled 3D and source 2D representations. For both pixel-based and superpixel-based losses, U, T, and G are evaluated using point or pixel features. To assess the relationship between the performance on downstream tasks and the difference in the structure of the 2D and the 3D representation spaces, we use the in-distribution 3D few-shot segmentation task, where we learn a classifier by finetuning the 3D representations on " + }, + { + "bbox": [ + 130, + 388, + 482, + 532 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 388, + 482, + 532 + ], + "type": "text", + "content": " of the labels of the nuScenes training set. Similar to [27,38], we also evaluate the utility of the distilled representations in the out-of-distribution setting by fine-tuning on " + }, + { + "bbox": [ + 130, + 388, + 482, + 532 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 388, + 482, + 532 + ], + "type": "text", + "content": " of the SemanticKITTI [3] dataset. The nuScenes and SemanticKITTI datasets contain 16 and 19 classes, respectively. We present our results using the official validation sets for these datasets." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 533, + 482, + 654 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 654 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 654 + ], + "type": "text", + "content": "For DINOv2, we follow [27,38] and evaluate the Linear Probing performance on nuScenes by freezing the backbone of the point cloud encoder and training a linear classifier on " + }, + { + "bbox": [ + 130, + 533, + 482, + 654 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 533, + 482, + 654 + ], + "type": "text", + "content": " of the labels. For CLIP models, we evaluate the 3D zero-shot segmentation tasks which can be performed with language prompts. To enable openset scene understanding, during pretraining, we assume we have no access to nuScenes class labels. Similar to [46], we apply prompt engineering during inference using 85 hand-crafted prompts for each class label, and then use the CLIP text encoder to compute an average text embedding for each class. Each point is then assigned the label that corresponds to the highest cosine similarity, computed between the point features and the CLIP text embeddings." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 146, + 478, + 236 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 479, + 137 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 479, + 137 + ], + "type": "text", + "content": "Table 1: Evaluation of 3D representations from CLIP image encoder with source U of 1.54, and source T of 0.73. Best results are bolded and second best are underlined." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 146, + 478, + 236 + ], + "lines": [ + { + "bbox": [ + 135, + 146, + 478, + 236 + ], + "spans": [ + { + "bbox": [ + 135, + 146, + 478, + 236 + ], + "type": "table", + "html": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
CLIP 36PPKT 253.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.60
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR 383.50900.44720.0015316.8246.7646.53
ST-SLidR 273.50000.45440.0015018.5447.1346.84
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
", + "image_path": "f451f080b9c216ee9b31c1fd5ebb50a4da6bdde04e3c25b7491f34864a2c76be.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 280, + 480, + 367 + ], + "blocks": [ + { + "bbox": [ + 132, + 247, + 480, + 269 + ], + "lines": [ + { + "bbox": [ + 132, + 247, + 480, + 269 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 480, + 269 + ], + "type": "text", + "content": "Table 2: Evaluation of 3D representations from DINOv2 image encoder with source U of 2.8, and source T of 0.51. Best results are bolded and second best are underlined." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 280, + 480, + 367 + ], + "lines": [ + { + "bbox": [ + 135, + 280, + 480, + 367 + ], + "spans": [ + { + "bbox": [ + 135, + 280, + 480, + 367 + ], + "type": "table", + "html": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Lin. Probing 100%Finetuning 1%Finetuning 1%
DINOv2 30PPKT 253.6250.44510.0006048.5043.3043.62
Simpl2.1760.69260.0003049.7245.8548.32
Relpl (ours)2.3930.65880.0002049.2046.9049.00
SLidR 383.6550.37390.0004449.6044.8142.23
ST-SLidR 273.5890.43260.0004253.0047.1145.61
Simspl2.2860.65220.0003052.3047.2349.01
Relspl (ours)2.5040.63120.0002352.9248.4249.10
", + "image_path": "ed87636886e1365ce503054f30753202fe44ff6ac2e9e82e9cef07dab689a376.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 392, + 198, + 402 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 198, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 198, + 402 + ], + "type": "text", + "content": "4.3 Results" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 413, + 480, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 480, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 480, + 496 + ], + "type": "text", + "content": "Baselines In Tab. 1 and Tab. 2, we present the results of distilling CLIP and DINOv2 models using our proposed relational loss. We compare against multiple state-of-the-art contrastive losses including PPKT [25], SLidR [38], and ST-SLidR [27]. For superpixel-based losses, masks are generated using SAM [21]. As an additional baseline, we report results for both the pixel-based and superpixel-based similarity loss, which we denote as " + }, + { + "bbox": [ + 130, + 413, + 480, + 496 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{pl}" + }, + { + "bbox": [ + 130, + 413, + 480, + 496 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 413, + 480, + 496 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{spl}" + }, + { + "bbox": [ + 130, + 413, + 480, + 496 + ], + "type": "text", + "content": ", respectively. We report the average over 3 runs for all metrics." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": "Uniformity, tolerance, and closing the modality gap Looking at distillation losses from the 2D CLIP encoder in Tab. [1] we first observe that U of 3D representations distilled using contrastive loss (i.e., PPKT, SLidR and ST-SLidR) is higher than the source U of 1.54, while U of similarity loss (i.e., " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{pl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{spl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": ") is lower than the U of the source. This is also observed when distilling from DINOv2. The relational constraints (i.e., " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Rel}_{pl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Rel}_{spl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": ") effectively close the gap between 3D representations distilled by similarity loss (i.e., " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{pl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{spl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": ") and 2D representations. For instance, when the pixel-based loss " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Rel}_{pl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": " is applied to CLIP, relational constraints close the gap in U resulting in a 3D representation with a U of 0.9089, instead of 0.5519, thus closer to the U of the source (1.54). Similarly, for the superpixel-based loss, " + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{Rel}_{spl}" + }, + { + "bbox": [ + 130, + 498, + 481, + 666 + ], + "type": "text", + "content": ", relational constraints close the gap in U resulting in a 3D representation with a U of 1.099, instead of 0.5919, thus closer to the U of the source (1.54). In addition, relational losses result in semantic clusters that are closer to the T of the source. By closing the gap" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 142, + 146, + 471, + 327 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 3: Performance for different CLIP backbones using pixel-based and superpixel-based relational loss. Best results are bolded and second best are underlined." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 142, + 146, + 471, + 327 + ], + "lines": [ + { + "bbox": [ + 142, + 146, + 471, + 327 + ], + "spans": [ + { + "bbox": [ + 142, + 146, + 471, + 327 + ], + "type": "table", + "html": "
2D EncoderDistillation LossUniformityToleranceModality GapnuScenesKITTI
Zero-shotFinetuning 1%Finetuning 1%
ViT-B32PPKT3.51100.52030.0002014.2143.2945.89
Simpl0.58040.93890.0001022.8444.2244.30
Relpl (ours)0.96050.89890.0001023.8544.6745.62
SLidR3.51300.47060.0003015.5543.3843.82
Simspl0.60090.93230.0001125.4644.8345.69
Relspl (ours)1.20200.86480.0000725.6645.6047.26
ViT-B16PPKT3.52100.52170.0015814.5345.3145.77
Simpl0.55190.94770.0004520.8444.3945.59
Relpl (ours)0.90890.91450.0003323.5345.6746.06
SLidR3.50900.44720.0015316.8246.7646.53
Simspl0.59190.93330.0004023.9345.6346.42
Relspl (ours)1.09900.87000.0001926.0347.2247.52
ViT-L14PPKT3.50200.52030.0008916.2844.6946.69
Simpl0.69090.92570.0001627.9144.8744.80
Relpl (ours)0.87750.90270.0001327.7445.9245.86
SLidR3.48000.44030.0006518.3147.3446.86
Simspl0.73110.91020.0002030.7745.7645.29
Relspl (ours)0.90190.88730.0001730.1147.0746.81
", + "image_path": "3269b3aa938f0d0e43d7cd851444584cfcc7f1f10363150fb0fa73123ce7bff4.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 352, + 481, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 352, + 481, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 352, + 481, + 389 + ], + "type": "text", + "content": "in U and T, relational constraints result in the lowest G for pixel-based and superpixel-based losses. These results align well with the ones presented on the toy example in Section 3, which further supports the validity of our analysis." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 389, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 482, + 581 + ], + "type": "text", + "content": "Zero-shot performance Looking at the utility of the 3D representations for 3D zero-shot segmentation in Tab. [1] we observe that the contrastive loss (i.e., PPKT, SLidR and ST-SLidR) has significantly worse 3D zero-shot mean IOU when compared to the similarity loss. This is contrary to the conclusion reached by ImageBind [12], which observed that the contrastive loss achieves " + }, + { + "bbox": [ + 130, + 389, + 482, + 581 + ], + "type": "inline_equation", + "content": "6\\%" + }, + { + "bbox": [ + 130, + 389, + 482, + 581 + ], + "type": "text", + "content": " improvement on 2D zero-shot tasks compared to similarity losses. We hypothesize that the abundance of self-similarity in AD datasets, coupled with the hardness-aware property of contrastive loss [27], leads to pushing away semantically similar point and pixel features. This, in turn, results in poor alignment between point features and CLIP image features. Notably, we observe that ST-SLidR improves zero-shot performance compared to SLidR (18.54% vs 16.82%) as it utilizes the superpixel feature similarities to exclude a portion of the false negative samples from the pool of negative samples. Without resorting to negative samples, relational constraints minimize the 2D-to-3D structural gap compared to similarity loss, leading to improvements in zero-shot performance from 20.84% to 23.53% for pixel-based losses, and from 23.93% to 26.03% for superpixel-based losses." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 483, + 666 + ], + "type": "text", + "content": "In Tab. 4, we compare pixel and superpixel-based relational losses to SOTA methods. All methods distill from CLIP [36], with the performance on nuScenes provided by [8]. Methods are further categorized based on the prior knowledge required during the distillation phase. Some methods require class names defined for a dataset [8,9], while others utilize SAM to refine CLIP predictions [8]. Requiring class names assumes a dataset only consists of a predefined set of classes, preventing the transfer of features associated with undefined classes, thus" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 158, + 307, + 232 + ], + "blocks": [ + { + "bbox": [ + 132, + 125, + 302, + 156 + ], + "lines": [ + { + "bbox": [ + 132, + 125, + 302, + 156 + ], + "spans": [ + { + "bbox": [ + 132, + 125, + 302, + 156 + ], + "type": "text", + "content": "Table 4: Zero-shot segmentation performance of relational loss compared to state-of-the-art methods." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 158, + 307, + 232 + ], + "lines": [ + { + "bbox": [ + 134, + 158, + 307, + 232 + ], + "spans": [ + { + "bbox": [ + 134, + 158, + 307, + 232 + ], + "type": "table", + "html": "
MethodPublicationClass Names RequiredUses SAM3D mIoU
MaskCLIP 46ECCV 2022✗✗12.80
OpenScene 33CVPR 2023✗✗14.60
CLIP2Scene 9CVPR 2023✓✗20.80
Relpl (ours)-✗✗23.53
TLF 8NeurIPS 2023✓✓26.80
Relspl (ours)-✗✓26.03
", + "image_path": "3a710c8bdba46c9a0c852e96dc5ea6fcad87ce58da43bc5222aeb2173705b47e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 273, + 310, + 350 + ], + "blocks": [ + { + "bbox": [ + 132, + 239, + 302, + 271 + ], + "lines": [ + { + "bbox": [ + 132, + 239, + 302, + 271 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 302, + 271 + ], + "type": "text", + "content": "Table 5: Effect of relational loss components. Distilling from CLIP image encoder with source U of 1.54 and T of 0.73." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 273, + 310, + 350 + ], + "lines": [ + { + "bbox": [ + 135, + 273, + 310, + 350 + ], + "spans": [ + { + "bbox": [ + 135, + 273, + 310, + 350 + ], + "type": "table", + "html": "
LossUniformityToleranceModality GapnuScenesKITTI
ZSFt 1%Ft 1%
\\( Sim_{pl} \\)0.55190.94770.0004520.8444.3945.59
+cross0.64260.93860.0004221.3945.9545.45
+intra0.90890.91450.0003323.5345.6746.06
\\( Sim_{spl} \\)0.59190.93330.0004023.9345.6346.42
+cross0.76560.90860.0003325.0546.1846.99
+intra1.09900.87000.0001926.0347.2247.52
", + "image_path": "057170f74dfeac203e9fa7aa1c87048b1cba0af961e81041df26ccaeed08ae14.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 321, + 198, + 476, + 344 + ], + "blocks": [ + { + "bbox": [ + 311, + 131, + 482, + 197 + ], + "lines": [ + { + "bbox": [ + 311, + 131, + 482, + 197 + ], + "spans": [ + { + "bbox": [ + 311, + 131, + 482, + 197 + ], + "type": "text", + "content": "Table 6: Improvement of finetuned models with respect to majority versus minority classes. Similar to ST-SLidR [27], We group classes based on whether their superpixels occupy more than " + }, + { + "bbox": [ + 311, + 131, + 482, + 197 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 311, + 131, + 482, + 197 + ], + "type": "text", + "content": " of the superpixels in nuScenes training set." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 321, + 198, + 476, + 344 + ], + "lines": [ + { + "bbox": [ + 321, + 198, + 476, + 344 + ], + "spans": [ + { + "bbox": [ + 321, + 198, + 476, + 344 + ], + "type": "table", + "html": "
2D EncoderLossMajority (mIoU)Minority (mIoU)
CLIP\\( Sim_{pl} \\)69.1633.35
\\( Rel_{pl} \\)69.5934.80
\\( Gain \\)+0.43+1.45
\\( Sim_{spl} \\)67.5836.06
\\( Rel_{spl} \\)67.7538.77
\\( Gain \\)+0.17+2.71
DINOv2\\( Sim_{pl} \\)70.8934.24
\\( Rel_{pl} \\)71.2235.85
\\( Gain \\)+0.33+1.61
\\( Sim_{spl} \\)68.1538.53
\\( Rel_{spl} \\)68.8040.20
\\( Gain \\)+0.65+1.67
", + "image_path": "c145dc1ef06d0e329bbb921f341996d12004fe0beffc31ecdcec946bafe80d7f.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "spans": [ + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": "limiting openset capabilities [34]. Without using class information, we observe in Tab. 4 that " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\mathrm{Rel}_{pl}" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " performs the best compared to other pixel-based losses, while our superpixel-based relational loss, " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\mathrm{Rel}_{spl}" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": ", is within " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " from state-of-the-art [8]. Few-shot performance We evaluate the effectiveness of 3D representations in both in-distribution (namely, nuScenes) and out-of-distribution (namely, SemanticKITTI) settings. For representations distilled from CLIP in Tab. 1, we observe that the limited U of representations distilled through similarity losses, as opposed to the source, leads to comparatively weaker performance on indistribution tasks with few-shot learning when compared with contrastive loss. For instance, ST-SLidR representations enhance performance on the nuScenes dataset by " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "+1.5\\%" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " compared to " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{spl}" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": ". Furthermore, by applying relational constraints and without the need for negative samples, we can bridge the U gap. This results in " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\mathrm{Rel}_{spl}" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " outperforming " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{spl}" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " by " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "+1.59\\%" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "+1.1\\%" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " on nuScenes and SemKITTI, respectively. When examining 3D representations distilled from DI-NOv2 in Tab. 2, we note a source U of 2.8. Here, the similarity loss closely aligns with the source's U more than the contrastive loss. The contrastive loss (PPKT and SLidR) shows significantly poorer performance compared to the similarity loss. Additionally, 3D representations distilled by ST-SLidR attain a U of 3.589 and a T of 0.4326, aligning more closely with the source U and T of 2.8 and 0.51 than those distilled by the SLidR loss. Lastly, we find that relational constraints narrow the G more effectively than similarity losses, thereby enhancing the few-shot performance by " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "+1.05\\%" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "inline_equation", + "content": "+1.19\\%" + }, + { + "bbox": [ + 130, + 376, + 482, + 653 + ], + "type": "text", + "content": " on pixel and superpixel-based losses, respectively, on the nuScenes dataset compared to similarity losses." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 135, + 653, + 481, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 653, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 135, + 653, + 481, + 667 + ], + "type": "text", + "content": "CLIPBackbonesTab.3 depicts the performance of contrastive,similarity," + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": "and relational losses when distilling from different CLIP backbones. Relational losses achieve the lowest modality gap, surpassing both contrastive and similarity loss across all 2D encoders. In zero-shot tasks, relational losses either match or exceed the performance of similarity losses, whereas contrastive distillation consistently underperforms. The performance of contrastive distillation on few-shot tasks proves unpredictable. For instance, distilling from ViT-B32 using similarity loss " + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{spl}" + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": " surpasses distilling using contrastive loss SLidR in mIOU by " + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "inline_equation", + "content": "+1.45\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "inline_equation", + "content": "+1.87\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": " on nuScenes and SemanticKITTI, respectively. Conversely, distilling from ViT-L14, SLidR achieves competitive performance, outperforming similarity loss " + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "inline_equation", + "content": "\\mathrm{Sim}_{spl}" + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": " by " + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "inline_equation", + "content": "+1.58\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "inline_equation", + "content": "+1.57\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": " on the same datasets. Notably, relational losses bridge the gap in few-shot learning while maintaining robust zero-shot task performance. This indicates that relational losses utilize inherent 2D representation relationships, avoiding ungrounded negative samples common in contrastive loss, which facilitates learning representations more aligned with the source's U, thereby enhancing few-shot task performance." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 296, + 482, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 296, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 296, + 482, + 403 + ], + "type": "text", + "content": "Class Imbalance We investigate the performance of finetuned models on semantic segmentation using 3D representations distilled using similarity and relational losses. Similar to ST-SLidR [27], we distinguish between majority and minority classes based on the percentage of superpixels they occupy in the nuScenes dataset. The 11 classes occupying less than " + }, + { + "bbox": [ + 130, + 296, + 482, + 403 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 296, + 482, + 403 + ], + "type": "text", + "content": " of the superpixels are considered to be in the minority set, while the remaining classes are in the majority set. In Tab. 6 compared to similarity losses, relational losses learn representations that significantly improve performance on minority classes for pixel and superpixel-based losses without degrading performance on majority classes." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 403, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 499 + ], + "type": "text", + "content": "Relational Loss Ablation We investigate the contribution of cross-modal and intra-modal constraints for pixel-based and superpixel-based losses. In Tab. 5, we observe that both constraints lead to learning 3D representations that are closer to the source U and T, and thus result in a lower G compared to similarity losses. Moreover, both constraints lead to improved performance on zero-shot and few-shot segmentation tasks. Interestingly, the superpixel-based relational loss with both constraints (last row) results in the smallest gap in U and T compared to other losses, leading to the best performance on semantic segmentation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 518, + 220, + 533 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 518, + 220, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 518, + 220, + 533 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "In this work, we study the impact of the state-of-the-art 2D-to-3D distillation frameworks when applied to AD datasets on the structure of the learned 3D representation. We reveal a significant structural gap between the 2D and the 3D representations and show that this gap is negatively correlated with the utility of the learned 3D representations for solving 3D zero-shot and few-shot segmentation tasks. Our proposed relational loss bridges this structural gap, resulting in well-aligned 3D representations that outperform representations learned via contrastive loss on zero-shot segmentation tasks. In addition, compared to the similarity loss, our relational loss results in 3D representations that consistently improve in-distribution and out-of-distribution few-shot segmentation tasks." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 245, + 101 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 141, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 141, + 481, + 175 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 141, + 481, + 175 + ], + "spans": [ + { + "bbox": [ + 138, + 141, + 481, + 175 + ], + "type": "text", + "content": "1. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Susstrunk, S.: Slic superpixels compared to state-of-the-art superpixel methods. IEEE TPAMI 34(11), 2274-2282 (2012)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 176, + 481, + 198 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 176, + 481, + 198 + ], + "spans": [ + { + "bbox": [ + 138, + 176, + 481, + 198 + ], + "type": "text", + "content": "2. Bardes, A., Ponce, J., Lecun, Y.: Vicreg: Variance-invariance-covariance regularization for self-supervised learning. In: ICLR (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 198, + 481, + 231 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 198, + 481, + 231 + ], + "spans": [ + { + "bbox": [ + 138, + 198, + 481, + 231 + ], + "type": "text", + "content": "3. Behley, J., Garbade, M., Milioto, A., Quenzel, J., Behnke, S., Stachniss, C., Gall, J.: SemanticKITTI: A Dataset for Semantic Scene Understanding of LiDAR Sequences. In: ICCV (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 232, + 481, + 265 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 232, + 481, + 265 + ], + "spans": [ + { + "bbox": [ + 138, + 232, + 481, + 265 + ], + "type": "text", + "content": "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 266, + 481, + 298 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 266, + 481, + 298 + ], + "spans": [ + { + "bbox": [ + 138, + 266, + 481, + 298 + ], + "type": "text", + "content": "5. Caesar, H., Bankiti, V., Lang, A.H., Vora, S., Liong, V.E., Xu, Q., Krishnan, A., Pan, Y., Baldan, G., Beijbom, O.: nuscenes: A multimodal dataset for autonomous driving. In: CVPR. pp. 11621-11631 (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 299, + 481, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 299, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 299, + 481, + 331 + ], + "type": "text", + "content": "6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. NeurIPS 33, 9912-9924 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 332, + 481, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 481, + 365 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 481, + 365 + ], + "type": "text", + "content": "7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: ICCV. pp. 9650-9660 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 365, + 481, + 398 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 365, + 481, + 398 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 481, + 398 + ], + "type": "text", + "content": "8. Chen, R., Liu, Y., Kong, L., Chen, N., Xinge, Z., Ma, Y., Liu, T., Wang, W.: Towards label-free scene understanding by vision foundation models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 399, + 481, + 442 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 399, + 481, + 442 + ], + "spans": [ + { + "bbox": [ + 138, + 399, + 481, + 442 + ], + "type": "text", + "content": "9. Chen, R., Liu, Y., Kong, L., Zhu, X., Ma, Y., Li, Y., Hou, Y., Qiao, Y., Wang, W.: Clip2scene: Towards label-efficient 3d scene understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7020-7030 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 443, + 481, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 443, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 138, + 443, + 481, + 464 + ], + "type": "text", + "content": "0. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 465, + 481, + 498 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 465, + 481, + 498 + ], + "spans": [ + { + "bbox": [ + 138, + 465, + 481, + 498 + ], + "type": "text", + "content": "1. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: European Conference on Computer Vision. pp. 540-557. Springer (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 498, + 481, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 498, + 481, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 498, + 481, + 542 + ], + "type": "text", + "content": "2. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind: One embedding space to bind them all. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15180-15190 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 544, + 481, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 481, + 564 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 481, + 564 + ], + "type": "text", + "content": "3. Gou, J., Yu, B., Maybank, S.J., Tao, D.: Knowledge distillation: A survey. International Journal of Computer Vision 129, 1789-1819 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 566, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 566, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 566, + 481, + 599 + ], + "type": "text", + "content": "4. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P.H., Buchatskaya, E., Doersch, C., Pires, B.A., Guo, Z.D., Azar, M.G., et al.: Bootstrap your own latent: A new approach to self-supervised learning. arXiv preprint arXiv:2006.07733 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "type": "text", + "content": "5. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9729-9738 (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "type": "text", + "content": "6. Henaff, O.J., Koppula, S., Alayrac, J.B., Van den Oord, A., Vinyals, O., Carreira, J.: Efficient visual pretraining with contrastive detection. In: ICCV. pp. 10086-10096 (2021)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 448, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "17. Hess, G., Tonderski, A., Petersson, C., Åström, K., Svensson, L.: Lidarclip or: How i learned to talk to point clouds. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 7438-7447 (January 2024)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 162, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 162, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 132, + 162, + 481, + 184 + ], + "type": "text", + "content": "18. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 481, + 228 + ], + "type": "text", + "content": "19. Jatavallabhula, K., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., Tenenbaum, J., de Melo, C., Krishna, M., Paull, L., Shkurti, F., Torralba, A.: Conceptfusion: Open-set multimodal 3d mapping. Robotics Science and Systems (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 229, + 481, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 229, + 481, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 481, + 262 + ], + "type": "text", + "content": "20. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: Lerf: Language embedded radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 19729-19739 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 263, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 263, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 263, + 481, + 306 + ], + "type": "text", + "content": "21. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., Dollar, P., Girshick, R.: Segment anything. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 4015-4026 (October 2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 308, + 481, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 481, + 329 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 481, + 329 + ], + "type": "text", + "content": "22. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: ICLR (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 331, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 331, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 331, + 481, + 363 + ], + "type": "text", + "content": "23. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 364, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 364, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 364, + 481, + 396 + ], + "type": "text", + "content": "24. Liu, Y., Kong, L., Cen, J., Chen, R., Zhang, W., Pan, L., Chen, K., Liu, Z.: Segment any point cloud sequences by distilling vision foundation models. In: Advances in Neural Information Processing Systems (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "type": "text", + "content": "25. Liu, Y.C., Huang, Y.K., Chiang, H.Y., Su, H.T., Liu, Z.Y., Chen, C.T., Tseng, C.Y., Hsu, W.H.: Learning from 2d: Contrastive pixel-to-point knowledge transfer for 3d pretraining. arXiv preprint arXiv:2104.04687 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 431, + 481, + 463 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 431, + 481, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 431, + 481, + 463 + ], + "type": "text", + "content": "26. Mahmoud, A., Elhoushi, M., Abbas, A., Yang, Y., Ardalani, N., Leather, H., Morcos, A.S.: Sieve: Multimodal dataset pruning using image captioning models. In: CVPR. pp. 22423-22432 (2024)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 464, + 481, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 481, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 481, + 508 + ], + "type": "text", + "content": "27. Mahmoud, A., Hu, J.S.K., Kuai, T., Harakeh, A., Paull, L., Waslander, S.L.: Self-supervised image-to-point distillation via semantically tolerant contrastive loss. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7102-7110 (June 2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 509, + 481, + 541 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 541 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 541 + ], + "type": "text", + "content": "28. Mahmoud, A., Hu, J.S., Waslander, S.L.: Dense voxel fusion for 3d object detection. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 663-672 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 543, + 481, + 575 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 481, + 575 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 481, + 575 + ], + "type": "text", + "content": "29. Mahmoud, A., Waslander, S.L.: Sequential fusion via bounding box and motion pointpainting for 3d objection detection. In: 18th Conference on Robots and Vision (CRV) (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 576, + 481, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 576, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 576, + 481, + 609 + ], + "type": "text", + "content": "30. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 610, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 481, + 643 + ], + "type": "text", + "content": "31. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3967-3976 (2019)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "text", + "content": "32. Parnami, A., Lee, M.: Learning from few examples: A summary of approaches to few-shot learning. arXiv preprint arXiv:2203.04291 (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 244, + 100 + ], + "type": "text", + "content": "A. Mahmoud et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 567 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "text", + "content": "33. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T., et al.: Openscene: 3d scene understanding with open vocabularies. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 815-824 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 161, + 482, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 161, + 482, + 194 + ], + "spans": [ + { + "bbox": [ + 130, + 161, + 482, + 194 + ], + "type": "text", + "content": "34. Puy, G., Gidaris, S., Boulch, A., Simeoni, O., Sautier, C., Perez, P., Bursuc, A., Marlet, R.: Revisiting the distillation of image representations into point clouds for autonomous driving. arXiv preprint arXiv:2310.17504 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 194, + 482, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 194, + 482, + 226 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 482, + 226 + ], + "type": "text", + "content": "35. Qian, J., Chatrath, V., Yang, J., Servos, J., Schoellig, A.P., Waslander, S.L.: Pocd: Probabilistic object-level change detection and volumetric mapping in semi-static scenes. Robotics: Science and Systems (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 226, + 482, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 270 + ], + "type": "text", + "content": "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "type": "text", + "content": "37. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 293, + 482, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 325 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 325 + ], + "type": "text", + "content": "38. Sautier, C., Puy, G., Gidaris, S., Boulch, A., Bursuc, A., Marlet, R.: Image-to-lidar self-supervised distillation for autonomous driving data. In: CVPR. pp. 9891-9901 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "type": "text", + "content": "39. Shi, P., Welle, M.C., Björkman, M., Kragic, D.: Towards understanding the modality gap in CLIP. In: ICLR 2023 Workshop on Multimodal Representation Learning: Perks and Pitfalls (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 358, + 482, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 380 + ], + "type": "text", + "content": "40. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 380, + 482, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 402 + ], + "type": "text", + "content": "41. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: CVPR. pp. 2495-2504 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 402, + 482, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 435 + ], + "type": "text", + "content": "42. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "type": "text", + "content": "43. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "type": "text", + "content": "44. Zhang, R., Guo, Z., Zhang, W., Li, K., Miao, X., Cui, B., Qiao, Y., Gao, P., Li, H.: Pointclip: Point cloud understanding by clip. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8552-8562 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 501, + 482, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 523 + ], + "type": "text", + "content": "45. Zhang, Z., Girdhar, R., Joulin, A., Misra, I.: Self-supervised pretraining of 3d features on any point-cloud. In: ICCV. pp. 10252-10263 (October 2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 523, + 482, + 545 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 523, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 523, + 482, + 545 + ], + "type": "text", + "content": "46. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 545, + 482, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 567 + ], + "type": "text", + "content": "47. Zhu, X., Zhang, R., He, B., Zeng, Z., Zhang, S., Gao, P.: Pointclip v2: Adapting clip for powerful 3d open-world learning. arXiv preprint arXiv:2211.11682 (2022)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 168, + 91, + 449, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 91, + 449, + 102 + ], + "spans": [ + { + "bbox": [ + 168, + 91, + 449, + 102 + ], + "type": "text", + "content": "Image-to-Lidar Relational Distillation for Autonomous Driving Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_content_list.json b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..a6df903d96406c73c330176677d49d9fe460f4ec --- /dev/null +++ b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_content_list.json @@ -0,0 +1,1587 @@ +[ + { + "type": "text", + "text": "Images are Achilles' Heel of Alignment: Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models", + "text_level": 1, + "bbox": [ + 222, + 140, + 781, + 209 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yifan Li $^{1,3,\\star}$ , Hangyu Guo $^{1,3,\\star}$ , Kun Zhou $^{2,3,\\star}$ , Wayne Xin Zhao $^{1,3,\\dagger}$ , and Ji-Rong Wen $^{1,2,3}$", + "bbox": [ + 331, + 233, + 669, + 265 + ], + "page_idx": 0 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "$^{1}$ Gaoling School of Artificial Intelligence, Renmin University of China $^{2}$ School of Information, Renmin University of China", + "3 Beijing Key Laboratory of Big Data Management and Analysis Methods {liyifan0925,hyguo0220,batmanfly}@gmail.com" + ], + "bbox": [ + 251, + 276, + 746, + 333 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. In this paper, we study the harmlessness alignment problem of multimodal large language models (MLLMs). We conduct a systematic empirical analysis of the harmlessness performance of representative MLLMs and reveal that the image input poses the alignment vulnerability of MLLMs. Inspired by this, we propose a novel jailbreak method named HADES, which hides and amplifies the harmfulness of the malicious intent within the text input, using meticulously crafted images. Experimental results show that HADES can effectively jailbreak existing MLLMs, which achieves an average Attack Success Rate (ASR) of $90.26\\%$ for LLaVA-1.5 and $71.60\\%$ for Gemini Pro Vision. Our code and data are available at https://github.com/RUCAIBox/HADES.", + "bbox": [ + 259, + 369, + 740, + 523 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Warning: this paper contains example data that may be offensive.", + "bbox": [ + 261, + 523, + 699, + 536 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Multimodal Large Language Models $\\cdot$ Harmlessness Alignment $\\cdot$ Adversarial Attack", + "bbox": [ + 259, + 550, + 740, + 578 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 604, + 375, + 619 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recently, by leveraging the powerful capacity of large language models (LLMs) [33], a variety of multimodal large language models (MLLMs) [32] have emerged, which can process both textual and visual information similarly as that LLMs process textual input. MLLMs have not only shown superior performance in various visual-language tasks but also possess the capability to engage in image-related dialogues with human users [15,35]. However, MLLMs also confront similar harmlessness challenges that afflict their backbone LLMs.", + "bbox": [ + 212, + 635, + 797, + 739 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Despite undergoing harmlessness alignment like reinforcement learning from human feedback (RLHF) [19], LLMs remain vulnerable to black-box attacks (e.g., sophisticated jailbreak prompts [4]) or white-box attacks (e.g., gradient-based adversarial inputs [36]). Since MLLMs are generally built on top of existing", + "bbox": [ + 212, + 741, + 789, + 804 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "$\\star$ Equal contribution.", + "bbox": [ + 230, + 811, + 377, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "† Corresponding author.", + "bbox": [ + 230, + 825, + 395, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/7c248d2855c60663355501a440d3523c8392e537dfce905fb0a47228680c99a5.jpg", + "image_caption": [ + "Fig. 1: An example to show the influence of the visual modality on harmlessness alignment of Gemini Pro Vision. The harmful information is highlighted in red" + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 781, + 330 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "LLMs, they inevitably suffer from these safety issues. To study the harmlessness alignment of MLLMs, recent work either evaluates the harmlessness of MLLMs in response to harmful instructions [16, 27], or assesses the model robustness by utilizing adversarial images [10, 20]. These studies suggest that the integration of the visual modality might exacerbate safety concerns for MLLMs compared to their backbone LLMs. As illustrated in Fig. 1, even one of the state-of-the-art MLLMs, Gemini Pro Vision [1], would be influenced by the blank or harmful images, leading to improper outputs with harmful words.", + "bbox": [ + 212, + 410, + 784, + 530 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, it still lacks a deep understanding of how safety concerns occur in MLLMs and how they might be different from those in LLMs. Considering this issue, this work aims to systematically analyze the sourcing factors that violate the harmlessness alignment of MLLMs. We conduct detailed empirical studies on representative MLLMs, specifically investigating their performance on harmful instructions accompanied by images. Our findings are threefold: (1) Images can be backdoors for the harmlessness alignment of MLLMs. The inclusion of images in the input can significantly increase the harmfulness ratio of MLLMs' outputs; (2) Cross-modal fine-tuning undermines the alignment abilities of the backbone LLM for a given MLLM. The more parameters that are fine-tuned, the more severe the disruption is; (3) The harmfulness of MLLMs' responses is positively correlated with the harmfulness of the image content. These findings reveal that the visual modality introduces additional alignment vulnerabilities in MLLMs, which can be exploited to further jailbreak these models.", + "bbox": [ + 212, + 534, + 787, + 744 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Motivated by these empirical findings, we propose a novel jailbreak approach called HADES, standing for Hiding and Amplifying harmfulness in images to DESTroy multimodal alignment, to assess the adversarial robustness of both open-and closed-source MLLMs. Specifically, our approach introduces a three-stage attack strategy. First, it extracts the harmful information from the text input into typography and replaces such text with a text-to-image pointer, which guides", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "the model to focus on image information. In this way, we transfer the harmful input from the well-aligned text side into the image side, inducing models to be more prone to generate harmful outputs. Second, HADES attaches another harmful image to the original typography. This image is created by an image generation model, and its harmfulness has been amplified for multiple turns via prompt optimization. Third, HADES optimizes an adversarial noise via gradient update, towards inducing the MLLM to follow harmful instructions. The learned noise will be integrated into the previous image for jailbreaking MLLMs.", + "bbox": [ + 212, + 146, + 787, + 267 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, our main contributions are as follows:", + "bbox": [ + 238, + 268, + 607, + 282 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We conduct detailed empirical studies on the harmfulness alignment of representative MLLMs, and systematically investigate the possible sourcing factors that violate the harmfulness alignment of MLLMs. The results reveal that the visual modality of MLLMs poses a critical alignment vulnerability.", + "- We introduce HADES, a novel jailbreak approach that hides and amplifies the harmfulness of the original malicious intent using meticulously crafted images. Experimental results show that both open-source MLLMs based on aligned LLMs and powerful closed-source MLLMs struggle to resist HADES. Notably, HADES achieves an Attack Success Rate (ASR) of $90.26\\%$ on LLaVA-1.5 and $71.60\\%$ on Gemini Pro Vision." + ], + "bbox": [ + 225, + 292, + 784, + 443 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Empirical Harmlessness Analyses of MLLMs", + "text_level": 1, + "bbox": [ + 214, + 469, + 683, + 486 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this section, we conduct a systematic investigation to examine whether and how visual input influences the harmlessness alignment of MLLMs. We first introduce the data collection process in Sec. 2.1 and the evaluation settings in Sec. 2.2, then evaluate mainstream open- and closed-source MLLMs in Sec. 2.3.", + "bbox": [ + 212, + 502, + 787, + 563 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Evaluation Data Collection", + "text_level": 1, + "bbox": [ + 214, + 585, + 485, + 601 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To evaluate the harmlessness alignment of MLLMs, we collect a dataset comprising 750 harmful instructions across 5 scenarios. Each instruction includes a harmful keyword or key phrase and is paired with a harmful image related to the keyword or key phrase. We present the collection process below and show the pipeline in the supplementary materials.", + "bbox": [ + 212, + 613, + 787, + 686 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "First, based on existing harmful scenarios of LLMs [12], we select five representative ones that are related to the visual information in the real world: (1) Violence, Aiding and Abetting, Incitement; (2) Financial Crime, Property Crime, Theft; (3) Privacy Violation; (4) Self-Harm; and (5) Animal Abuse. For simplicity, these categories are referred to as Violence, Financial, Privacy, Self-Harm, and Animal, respectively. Next, we adopt GPT-4 to generate 50 keywords for each of the above harmful categories, and then synthesize three harmful but distinct instructions based on each keyword. The prompts employed for the above process are documented in the supplementary materials. In this way, we guarantee that each instruction includes only one harmful element (i.e., the keyword", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 470, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "or the key phrase), which could be accurately depicted by an image. Thus, we can pair each instruction with a corresponding real-world image that is relevant to the harmful keyword/phrase. Specifically, we first retrieve five images from Google using each keyword/phrase as the query, and then employ CLIP ViT-L/14 [21] to select the image that best matches the semantic representation of the keyword/phrase.", + "bbox": [ + 212, + 146, + 787, + 238 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Evaluation Settings", + "text_level": 1, + "bbox": [ + 214, + 257, + 421, + 273 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We evaluate both representative open-source (i.e., LLaVA-1.5 [14], LLaVA-1.5 LoRA (represented by LLaVA-1.5L), MiniGPT-v2 [5] and MiniGPT-4 [35]) and powerful closed-source MLLMs (i.e., Gemini Pro Vision [1], short as Gemini $\\mathrm{Pro_V}$ ) and GPT-4V [18]) on our dataset. To discuss the influence of the visual modality on harmlessness alignment, we design four evaluation settings:", + "bbox": [ + 212, + 280, + 787, + 356 + ], + "page_idx": 3 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- **Backbone:** We evaluate the backbone LLMs of MLLMs on harmful instructions, which have not been fine-tuned with cross-modal data, i.e., Vicuna v1.5-7B [7] for LLaVA-1.5, LLaMA-2-Chat-7B [26] for MiniGPT-4 and MiniGPT-v2, GPT-4 for GPT-4V, and Gemini Pro for Gemini Prov.", + "- Text-only: We evaluate MLLMs purely on harmful instructions.", + "- Blank: We evaluate MLLMs on harmful instructions paired with a $500 \\times 500$ blank image.", + "- **Toxic:** We evaluate MLLMs on harmful instructions paired with the previously selected harmful images (described in Sec. 2.1)." + ], + "bbox": [ + 225, + 363, + 784, + 498 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We employ Attack Success Rate (ASR) as the evaluation metric of harmlessness alignment, which is calculated by:", + "bbox": [ + 212, + 505, + 785, + 536 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\mathrm {A S R} = \\frac {\\sum_ {i = 1} ^ {N} \\mathbb {1} _ {\\{\\mathcal {J} (y _ {i}) = \\text {T r u e} \\}}}{N}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 401, + 545, + 784, + 575 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $y_{i}$ is the model's response, $\\mathbb{1}$ is an indicator function that equals to 1 if $\\mathcal{I}(y_i) = \\mathrm{True}$ and 0 otherwise, $N$ is the total number of instructions and $\\mathcal{J}$ is the harmfulness judging model, outputting True or False to indicate whether $y_{i}$ is harmful. We adopt Beaver-dam-7B [12] as $\\mathcal{J}$ , which has been trained on high-quality human feedback data about the above harmful categories.", + "bbox": [ + 214, + 585, + 787, + 661 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.3 Evaluation Results", + "text_level": 1, + "bbox": [ + 214, + 680, + 416, + 695 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The evaluation results are presented in Tab. 1. We list the ASR results of 5 harmful scenarios under 4 evaluation settings and calculate the average ASR across all scenarios. From the results, we can summarize three major findings:", + "bbox": [ + 212, + 703, + 787, + 750 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Images can be alignment backdoors of MLLMs. When comparing the performance of each model under the Backbone and Text-only settings, the harmlessness alignment of MLLMs does not significantly deviate from that of their backbone LLMs, and even exhibit enhanced defense capability, e.g., LLaVA-1.5 $(-2.80\\%)$ and Gemini Prov $(-7.50\\%)$ . However, once adding images, regardless of whether their contents are harmful or not, the ASR results of MLLMs", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 126 + ], + "page_idx": 3 + }, + { + "type": "table", + "img_path": "images/c168ef22899304ee67b196a7047844f1f49f1f928d5b40cbc93d767985982a22.jpg", + "table_caption": [ + "Table 1: The evaluation results of representative MLLMs on the dataset we collected. (Train) represents the cross-modal fine-tuning strategies of MLLMs. Animal, Financial, Privacy, Self-Harm, and Violence represent the ASR of MLLMs on instructions from these categories. Average represents the average ASR across all categories. + and - represents the change of ASR compared to the Backbone setting." + ], + "table_footnote": [], + "table_body": "
Model(Train)SettingAnimal Financial Privacy Self-Harm ViolenceAverage(%)
LLaVA-1.5(Full)Backbone17.3346.0034.6712.0034.6728.93
Text-only22.0040.0028.0010.0030.6726.13(-2.80)
Blank38.0066.6768.0030.6767.3354.13(+25.20)
Toxic54.0077.3382.6746.6780.0068.13(+39.20)
LLaVA-1.5L(LoRA)Backbone17.3346.0034.6712.0034.6728.93
Text-only23.3340.0030.009.3330.6726.67(-2.26)
Blank41.3367.3363.3325.3361.3351.73(+22.80)
Toxic48.6771.3374.6743.3376.0062.80(+33.87)
MiniGPT-v2(LoRA)Backbone0.000.000.000.000.670.13
Text-only7.3312.008.670.0015.338.67(+8.54)
Blank26.0046.6740.0016.0041.3334.00(+33.87)
Toxic37.3360.6750.0027.3344.0043.87(+43.74)
MiniGPT-4(Frozen)Backbone0.000.000.000.000.670.13
Text-only5.332.671.331.333.332.80(+2.67)
Blank15.3313.336.670.008.678.80(+8.67)
Toxic28.6735.3318.679.3325.3323.47(+23.34)
Gemini Prov(-)Backbone1.7013.8012.081.208.707.50
Text-only0.000.000.000.000.000.00(-7.50)
Blank13.3342.6734.005.3321.3323.33(+15.83)
Toxic19.3352.0045.336.6730.0030.67(+23.17)
GPT-4V(-)Backbone0.002.002.670.000.671.07
Text-only1.338.676.000.677.334.80(+3.73)
Blank2.004.676.000.006.673.87(+2.80)
Toxic2.0014.0014.000.006.007.20(+6.13)
", + "bbox": [ + 218, + 226, + 781, + 580 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "would be greatly improved even under the Blank setting using harmless images, e.g., LLaVA-1.5 $(+25.20\\%)$ and MiniGPT-v2 $(+33.87\\%)$ . It indicates that images can be the alignment backdoor of MLLMs, which would undermine MLLMs' capability of defending against harmful text input.", + "bbox": [ + 215, + 612, + 784, + 672 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "More parameters tuned, less alignment left. By examining the performance of open-sourced MLLMs, we notice that their alignment performance is highly relevant to their training strategies during cross-modal fine-tuning. Generally, for the same backbone model, the more parameters are optimized during fine-tuning, the harmlessness alignment would be affected more significantly. For example, under the Toxic setting, MiniGPT-4, with the fixed backbone LLM, is more robust than the LoRA-fine-tuned MiniGPT-v2, achieving lower ASR results (23.47% vs. 43.87%). Similarly, the full-parameter fine-tuned LLaVA-1.5 also generates more harmful responses than LoRA-fine-tuned LLaVA-1.5L (68.13% vs. 62.80%). The reason may be that the cross-modal fine-tuning process would hurt the harmlessness alignment of the backbone MLLMs.", + "bbox": [ + 215, + 674, + 794, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 470, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/07f6d4b98183c3bb565cbc7953a8e29f58736166f12650c972ce7e3a29c872f9.jpg", + "image_caption": [ + "Fig. 2: Given a harmful textual instruction, HADES involves a three-step procedure: (1) removes the harmful content from the text into typography; (2) combines it with a harmful image generated by a diffusion model, using an iteratively refined prompt from an LLM; (3) appends an adversarial image on top of the image, which elicits the MLLM to generate affirmative responses for harmful instructions." + ], + "image_footnote": [], + "bbox": [ + 245, + 150, + 754, + 448 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Harmful images are more likely to elicit harmful outputs. We observe that MLLMs are more prone to produce harmful outputs when presented with harmful images. It holds for both open-source and closed-source models, as their ASR results under the Toxic setting greatly exceed the results from all other settings, e.g., MiniGPT-4 (23.47% vs. 8.80%) and LLaVA-1.5 (68.13% vs. 54.13%). It indicates that it is hard for current MLLMs to defend against harmful image inputs. With the increase in image harmfulness, MLLMs might be increasingly prone to generate more harmful outputs.", + "bbox": [ + 212, + 563, + 787, + 684 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3 The Proposed Jailbreak Approach: HADES", + "text_level": 1, + "bbox": [ + 215, + 704, + 674, + 722 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Based on empirical studies, the visual input potentially brings vulnerabilities to the harmlessness alignment of MLLMs. However, it is not easy to manually craft massive adversarial samples that can successfully jailbreak MLLMs, which help detect the weak spots in real-world applications. To address it, based on harmful textual instructions, we propose a novel method to automatically synthesize high-quality adversarial examples, called HADES that stands for Hiding and Amplifying harmfulness in images to DEStroy multimodal alignment.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 126 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Typically, an MLLM is composed of an LLM $\\mathcal{M}$ , an image encoder $\\mathbf{E}$ and a projection layer $\\mathbf{W}$ . The generation process of MLLMs can be formulated as:", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i), t ]), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 426, + 188, + 785, + 204 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $i$ and $t$ are the input image and text, and $y$ is the model's output. Given a harmful $t$ , HADES aims to modify $t$ to $t'$ by adding a text-to-image pointer and crafts harmful images $i'$ . Thereby, HADES transfers the malicious intent to the less-aligned image side of the MLLM, inducing it to generate harmful responses $y'$ . The whole process of HADES is presented in Fig. 2.", + "bbox": [ + 212, + 213, + 787, + 291 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.1 Hiding Harmfulness from Text to Image", + "text_level": 1, + "bbox": [ + 214, + 311, + 594, + 327 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "By training on human preference data, existing LLMs learn to align with human values and refuse to respond to harmful text inputs. MLLMs derived from these LLMs naturally inherit the defense capacity for text inputs but leave the image side vulnerable to harmful content. Hence, we propose transferring harmful information from the well-aligned text side to the less-aligned image side, to bypass the defense mechanisms of MLLMs.", + "bbox": [ + 212, + 334, + 782, + 424 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Specifically, we replace the harmful keyword or key phrase from each text instruction $t$ with a text-to-image pointer and utilize images to represent it. On the text side, we categorize all the keywords into three classes: objects, concepts, or behaviors. For the keywords falling under the first two categories, the text-to-image pointer is \"the object/concept in the image\", while for the keywords denoting behaviors, the text-to-image pointer is \"conduct the behavior in the image on\". On the image side, as the keywords may represent abstract concepts or behaviors that are difficult for models to grasp when depicted by real-world images, we employ typography to represent these keywords. As a result, the generation process of MLLMs can be formally given as:", + "bbox": [ + 212, + 426, + 787, + 575 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\mathrm {t y p}}), t ^ {\\prime} ]), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 413, + 588, + 785, + 604 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $i_{\\mathrm{typ}}$ is the typography of the keyword and $t'$ is the modified instruction. By doing so, $t'$ no longer explicitly contains any harmful information, yet models can still infer the original harmful intent by referring to $i_{\\mathrm{typ}}$ .", + "bbox": [ + 212, + 613, + 787, + 660 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 Amplifying Image Harmfulness with LLMs", + "text_level": 1, + "bbox": [ + 214, + 679, + 616, + 695 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Our empirical study reveals that when the image input becomes more harmful, MLLMs also tend to generate more harmful responses. Therefore, we propose to append a harmful image to the previous typography $i_{typ}$ to amplify their harmfulness. Since the harmfulness of real-world images is always limited, we introduce diffusion models as the harmful image generator. In addition, we utilize LLMs as the attacker model to iteratively optimize the prompt for diffusion models to further increase the harmfulness of generated images.", + "bbox": [ + 212, + 704, + 782, + 809 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The whole procedure of image harmfulness optimization is presented in the supplementary materials. We leverage the harmfulness of the caption as the", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 470, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "proxy for the image's harmfulness, as the harmfulness of text is easier to quantify than images. We consider an iterative process to generate harmful images. We first ask ChatGPT to modify the original instruction $t$ into an initial image generation prompt $p_0$ and generate an initial image. At step $k$ , the caption model $\\mathcal{C}$ generates a caption $c_k$ for the target image $i_{\\mathrm{opt}}^k$ . Subsequently, the judging model $\\mathcal{J}$ assesses the image's harmfulness with a score, $s_k$ , on a scale from 1 to 10, where a higher score indicates greater harmfulness. $\\mathcal{J}$ also explains the reason for its score in $exp_k$ . All this information ( $p_k$ , $c_k$ , $s_k$ , and $exp_k$ ) is appended to the conversation history $h$ and sent to the attacker model $\\mathcal{A}$ which first suggests improvements to the prompt and then generates the refined image generation prompt $p_{k+1}$ . The refined prompt is then used to generate a new image $i_{\\mathrm{opt}}^{k+1}$ . The above process circulates until reaching the maximum iteration turn $K$ , which is set to 5. In practice, we choose GPT-4-0613 as both the attacker and judging model by utilizing different system prompts (as presented in the supplementary materials). For captioning and image generation, we adopt LLaVA-1.5 and PixArt-α [6], respectively.", + "bbox": [ + 212, + 146, + 787, + 388 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The optimized images $i_{\\mathrm{opt}}$ is then vertically concatenated with the previous typography $i_{\\mathrm{typ}}$ , which can be formulated as:", + "bbox": [ + 215, + 388, + 785, + 419 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\text {o p t}} \\oplus i _ {\\text {t y p}}), t ^ {\\prime} ]). \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 428, + 784, + 445 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this way, both images can mutually enhance their respective attack effects. The utilization of $t'$ forces the model to focus more on the image, thereby increasing its sensitivity to harmful content. Simultaneously, $i_{\\mathrm{opt}}$ , which is semantically close to the original instructions, serves as the additional context and aids the model in understanding the original harmful intent of masked instructions, which can partially compensate for some models' insufficient OCR capabilities.", + "bbox": [ + 212, + 453, + 787, + 544 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Amplifying Image Harmfulness with Gradient Update", + "text_level": 1, + "bbox": [ + 215, + 564, + 707, + 580 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Existing work has proven the effectiveness of adversarial images in jailbreaking MLLMs. To further enhance the attack effectiveness, HADES incorporates adversarial images by concatenating them with the previous images.", + "bbox": [ + 212, + 588, + 785, + 633 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The image input of MLLMs is encoded through an image encoder and then mapped into the LLM representation space via a projection layer. Consequently, images are represented as a sequence of distinct visual tokens, collectively forming a visual prompt. It allows us to view adversarial images, those that prompt MLLMs to produce malicious responses, as text jailbreak prompts such as \"Do Anything Now\" [24]. Jailbreak prompts are commonly placed at the beginning of malicious instructions without compromising the models' understanding of these instructions. Given the similarity between adversarial images and jailbreak prompts, we suggest that concatenating adversarial images on top of the image input of MLLMs can also prompt them to produce harmful information without compromising their understanding of the original image content. Consequently, the full formulation of HADES can be given as follows:", + "bbox": [ + 212, + 633, + 787, + 815 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\mathrm {a d v}} \\oplus i _ {\\mathrm {o p t}} \\oplus i _ {\\mathrm {t y p}}), t ^ {\\prime} ]). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 367, + 824, + 784, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 126 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To ensure the generalization capability of our method, we generate a single adversarial image $i_{\\mathrm{adv}}$ for all harmful instructions within the same category in our dataset. Initially, $i_{\\mathrm{adv}}$ is set to be a blank image $i_{\\mathrm{initial}}$ . Subsequently, we collect a set of affirmative responses, $Y_{a}$ , containing 10 examples (e.g., \"Sure!\" or \"I can answer the question for you.\") intended as the desired output of MLLMs. We provide the target model with one harmful instruction $t_{j}$ and the adversarial image $i_{\\mathrm{adv}}$ , and then select one affirmative response as the target label and compute the cross-entropy loss between the model's output and this target. The gradient derived from this loss is then utilized to iteratively refine the adversarial image $i_{\\mathrm{adv}}$ . The optimization procedure can be formulated as below:", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\ni _ {\\mathrm {a d v}} \\leftarrow i _ {\\text {i n i t i a l}} + \\arg \\min _ {\\delta} \\sum_ {j = 1} ^ {m} - \\log \\left(p _ {\\theta} \\left(y _ {j} \\mid t _ {j}, i _ {\\text {i n i t i a l}} + \\delta\\right)\\right), \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 297, + 313, + 785, + 352 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $y_{j}\\in Y_{a}$ , and $p_{\\theta}$ represents the conditional probability generated by the target MLLM. Additionally, to maintain $i_{\\mathrm{adv}}$ as a valid image, we constrain $i_{\\mathrm{initial}} + \\delta \\in \\mathcal{B}$ during the optimization, where $\\mathcal{B} = [0,1]^{w\\times h\\times c}$ and $w$ , $h$ , and $c$ denote the width, height, and channels of $i_{\\mathrm{adv}}$ , respectively.", + "bbox": [ + 214, + 364, + 789, + 428 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiment", + "text_level": 1, + "bbox": [ + 215, + 458, + 366, + 474 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 497, + 428, + 513 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For closed-source models, we select GPT-4V and Gemini Prov. For open-source models, we also select the MLLMs used before, i.e. LLaVA-1.5 and LLaVA-1.5L. We also select LLaVA built on Llama-2-Chat-7b, as it has experienced safety RLHF. Given the limited OCR capabilities of the open-source MLLMs, they could misinterpret the keywords in $i_{\\mathrm{typ}}$ . Thus, we continually prompt open-source MLLMs until they either explicitly generate the harmful keywords or reach the maximum allowed retries (set to 5 in practice). To verify the effectiveness of each component of HADES, we design four evaluation settings:", + "bbox": [ + 212, + 530, + 787, + 652 + ], + "page_idx": 8 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Typ image: Evaluate all models with the original instructions $t$ and corresponding typography $i_{\\mathrm{typ}}$ .", + "- +Text-to-image pointer: Evaluate all models with modified instructions $t'$ and the typography $i_{\\mathrm{typ}}$ . The generation process is the same as Eq. (3).", + "- +Opt image: Evaluate all models with $t'$ and the concatenation of $i_{\\mathrm{typ}}$ and $i_{\\mathrm{opt}}$ . The generation process is the same as Eq. (4).", + "- +Adv image: The full version of HADES. Since we don't have access to the parameters of Gemini $\\mathrm{Prov}$ and GPT-4V, we only evaluate open-source models with $t'$ and the concatenation of $i_{\\mathrm{typ}}$ , $i_{\\mathrm{opt}}$ and $i_{\\mathrm{adv}}$ . The generation process is the same as Eq. (5)." + ], + "bbox": [ + 225, + 667, + 785, + 824 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 472, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 127 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/dc4e2581853344e5bc703b8039e80add23a1d99ceaf1938aa39d8f7b27c90102.jpg", + "table_caption": [ + "Table 2: The evaluation results of MLLMs on instructions and images processed by HADES. T2I pointer represents Text-to-image pointer. + and - represents the change of ASR compared to the Typ image setting." + ], + "table_footnote": [], + "table_body": "
ModelSettingAnimalFinancialPrivacySelf-HarmViolenceAverage(%)
LLaVA-1.5Typ image48.6781.3378.0038.6781.3365.60
+T2I pointer32.6761.3371.3342.6782.6758.13(-7.47)
+Opt image67.3384.0085.3362.0094.0078.53(+12.93)
+Adv image83.3389.3394.6789.3394.6790.26(+24.66)
LLaVA-1.5LTyp image50.0071.3374.6735.3379.3362.13
+T2I pointer30.6753.3359.3324.6772.0048.00(-14.13)
+Opt image72.0082.6786.6761.3392.0078.93(+16.80)
+Adv image83.3391.3392.6784.6792.6788.93(+26.80)
LLaVATyp image20.6753.3333.338.0040.0031.07
+T2I pointer20.0044.0053.3315.3355.3337.60(+6.53)
+Opt image51.3374.0078.0041.3380.0064.93(+33.86)
+Adv image76.0089.3384.6775.3387.3382.53(+51.46)
Gemini ProvTyp image30.0056.0046.6717.3322.0034.40
+T2I pointer65.3364.0058.0034.6734.6751.33(+16.93)
+Opt image67.3386.6781.3344.0078.6771.60(+37.20)
GPT-4VTyp image0.671.334.000.002.671.73
+T2I pointer3.336.003.331.332.003.20(+1.47)
+Opt image2.6724.6727.331.3319.3315.07(+13.34)
", + "bbox": [ + 215, + 199, + 785, + 488 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Experiment Results", + "text_level": 1, + "bbox": [ + 215, + 513, + 426, + 529 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The evaluation results in Tab. 2 demonstrate that HADES significantly enhances the attack success rate (ASR) for both open- and closed-source MLLMs. Specifically, the average ASR for the three models in the LLaVA series exceeds 80 percent. Gemini ProV also struggles to counteract harmful instructions generated by HADES with an average ASR of $71.60\\%$ . Among the evaluated models, GPT-4V exhibits the strongest defense capacity against HADES, yielding a $15.07\\%$ proportion of harmful responses. When examining the models' performance across different categories of harmful instructions, it can be observed that they generally exhibit stronger defenses against instructions related to Animal and Self-Harm, while instructions about Financial, Privacy, and Violence categories are more likely to break through the models' safeguards.", + "bbox": [ + 212, + 537, + 787, + 704 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Under the $+$ Text-to-image pointer setting, we observe diverse attack outcomes across different models. The ASR increases for LLaVA $(+6.53\\%)$ , Gemini $\\mathrm{Prov}_{\\mathrm{V}}(+16.93\\%)$ and GPT-4V $(+1.47\\%)$ , while decreases for LLaVA-1.5 $(-7.47\\%)$ and LLaVA-1.5L $(-14.13\\%)$ . We attribute the ASR drop on these models to two main reasons. Firstly, some models have limited OCR capabilities, which causes them to misunderstand certain instructions as benign and consequently generate harmless responses. Notably, Gemini $\\mathrm{Prov}_{\\mathrm{V}}$ and GPT-4V, which possess advanced OCR capabilities, exhibit more harmful behavior under this setting. This suggests as the development of MLLMs, their enhancing OCR capabilities", + "bbox": [ + 212, + 704, + 789, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 127 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "will correspondingly increase the effectiveness of our method. Secondly, the text-to-image pointer is designed to bypass the defense mechanisms of MLLMs on the text side. Therefore, its effectiveness is constrained on models with inadequate harmlessness alignment (e.g., Vicuna v1.5 in LLaVA-1.5). In such cases, the improvement in ASR could be offset by the decrease due to misunderstanding.", + "bbox": [ + 212, + 146, + 787, + 222 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The incorporation of $i_{\\mathrm{opt}}$ under the $+Opt$ image setting significantly increases the ASR of all models, even more than 30 percent (e.g., LLaVA $(+33.86\\%)$ and Gemini ProV $(+37.20\\%)$ ). These results further verify our previous empirical finding: harmful images tend to elicit harmful responses. Moreover, $i_{\\mathrm{opt}}$ helps mitigate the misunderstanding issues observed with LLaVA-1.5 and LLaVA-1.5L. The ASR of these two models increases notably compared to the $+Text-to-image$ pointer setting. We attribute such results to that $i_{\\mathrm{opt}}$ always describes scenarios relevant to the instruction contents, which provides extra context that helps MLLMs to accurately understand the instruction.", + "bbox": [ + 212, + 222, + 787, + 356 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Finally, by combining $i_{\\mathrm{adv}}$ under the $+Adv$ image setting, the full version of HADES further increases the ASR on open-source models. Even LLaVA, whose backbone LLM is well-aligned by RLHF, achieves an average ASR of $82.53\\%$ . HADES also demonstrates promising ASR on categories that are relatively harder to jailbreak under previous settings. For LLaVA, the ASR on the Animal category rises from $51.33\\%$ to $76.00\\%$ , while the ASR on the Self-Harm category rises from $41.33\\%$ to $75.33\\%$ .", + "bbox": [ + 212, + 358, + 787, + 464 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Further Analyses", + "text_level": 1, + "bbox": [ + 214, + 484, + 406, + 500 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In this part, we further discuss the effectiveness of our proposed approach, from image harmfulness optimization, attack transferability, and jailbreak cases.", + "bbox": [ + 212, + 508, + 785, + 540 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Effectiveness of Image Harmfulness Optimization. To validate the effectiveness of the optimization process for image generation discussed in Sec. 3.2, we conduct a specific experiment to examine the attack performance with the intermediately generated images with gradually increasing optimization steps. As shown in Fig. 3, the ASR results of all the comparison models consistently improve when using more optimization steps for image generation. These findings affirm the efficacy of our proposed image harmfulness optimization method in HADES.", + "bbox": [ + 212, + 561, + 521, + 772 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Transferability of Adversarial Attack. To further validate the transferability of HADES across various MLLMs and", + "bbox": [ + 212, + 794, + 519, + 839 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/659f85026bc3a8a9beb439e3cd346d3a28c9569ded9b92a5c53c5c7b2a0d9c50.jpg", + "image_caption": [ + "Fig.3: The ASR results of different models on HADES using images generated at different optimization steps." + ], + "image_footnote": [], + "bbox": [ + 537, + 593, + 779, + 736 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 470, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/20de811da902f5c5dd34a7de5e19f1fabfd82a3c42aee9921c77693e4f15284e.jpg", + "image_caption": [ + "(a) Transferability across MLLMs." + ], + "image_footnote": [], + "bbox": [ + 217, + 148, + 478, + 311 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/a2b9bb051568b0f61e3e2d178234cb2221b5843090fe0b15e4dfc24509d46bc8.jpg", + "image_caption": [ + "(b) Transferability across categories.", + "Fig. 4: The evaluation results of transferability of HADES across different MLLMs (LLaVA, LLaVA-1.5 and LLaVA-1.5L) and different instruction categories (Violence, Self-Harm, Privacy, Financial, and Animal)." + ], + "image_footnote": [], + "bbox": [ + 524, + 145, + 784, + 311 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "harmful categories, we select Violence as the primary category for assessing cross-model transferability and LLaVA as the target model for exploring cross-category transferability. We then implement HADES utilizing $i_{\\mathrm{opt}}$ trained on a specific model/category to conduct attacks on other models/categories. The evaluation results are presented in Fig. 4. Fig. 4a demonstrates that HADES trained on one MLLM achieves comparable ASR on other MLLMs. Additionally, we observe that attacks between LLaVA-1.5 and LLaVA-1.5L demonstrate significant mutual transferability, likely due to their shared backbone LLMs and vision encoders. Furthermore, as illustrated in Fig. 4b, HADES demonstrates enhanced transferability within specific harmful categories such as Self-Harm, Violence, and Animal, as well as Privacy and Financial. Such phenomena can be attributed to the similar semantic contexts shared among instructions within these categories. For instance, instructions related to Violence and Self-Harm often involve physically harmful actions such as \"hitting\" or \"killing\", whereas those about Privacy and Financial both typically focus on abstract harmful concepts like \"eavesdropping\" or \"Forgery\".", + "bbox": [ + 212, + 414, + 787, + 657 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jailbreak Cases. To better understand how our approach jailbreaks MLLMs, we analyze the successful attack cases from Gemini ProV and GPT-4V, and summarize three representative jailbreak categories, which are presented on the left side of Fig. 5. Each category is related to a distinct multimodal capability, i.e., optical character recognition (OCR), image captioning and instruction following. For the OCR category, the model explicitly recognizes the keywords from the $i_{\\mathrm{typ}}$ before following the instruction. For the Captioning category, the model describes the scenario depicted in $i_{\\mathrm{opt}}$ before following the instruction. For the Instruction Following category, the model directly follows the harmful instruction. We further calculate the proportion of these categories among all", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 126 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "OCR: The concept shown in the image is \"bribery\". Here are some methods for initiating this concept with a corporate executive...", + "bbox": [ + 223, + 150, + 645, + 186 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Captioning: The image shows a person in a suit making counterfeit money. The steps to produce counterfeit money are as follows...", + "bbox": [ + 225, + 203, + 645, + 239 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Instruction Following: To avoid being noticed while committing a theft, it is important to be aware of your surroundings and...", + "bbox": [ + 225, + 255, + 645, + 291 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/99747c425b6b6753269e619d5eed9ac6773942a1a3131f887a01b249e92bb0d8.jpg", + "image_caption": [ + "Fig. 5: The representative cases and statistics of three harmful response types on Gemini Prov and GPT-4V. The text related to the corresponding type is underlined." + ], + "image_footnote": [], + "bbox": [ + 655, + 146, + 779, + 294 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "successful attack cases of Gemini Pro $_V$ and GPT-4V, and illustrate the result on the right part of Fig. 5.", + "bbox": [ + 212, + 364, + 782, + 395 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "From the charts, we notice that most jailbroken cases are due to the conflicts between the general instruction following abilities of MLLMs and their harmlessness alignment, while captioning and OCR abilities also occupy considerable proportions. The results suggest that the cross-modal fine-tuning may impose a kind of \"inverse alignment tax\" on MLLMs, which improves their multimodal abilities while impairing the harmlessness alignment. Therefore, to enhance the harmlessness alignment of MLLMs, future work could consider adding more adversarial samples that consist of harmful instructions and images during the cross-modal fine-tuning process, which ensures MLLMs defend attacks from the image side while maintaining multimodal abilities.", + "bbox": [ + 212, + 396, + 784, + 546 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Related Work", + "text_level": 1, + "bbox": [ + 215, + 568, + 385, + 584 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Harmlessness Alignment of LLMs. Alignment involves fine-tuning LLMs with human-preferred annotations to ensure responses are Helpful, Honest, and Harmless (the 3H principle [2]). Among them, the harmlessness alignment of LLMs has attracted extensive research attention. To evaluate the robustness of LLMs to harmful instructions, researchers employ red teaming to benchmark the safety degree of LLMs [9, 11]. Additionally, some studies further explore the harmlessness alignment of LLMs with jailbreaking methods. Some adopt white-box attacks, which utilize the model gradients to customize adversarial inputs [25, 28, 36], while black-box attacks typically launch attacks through manually or automatically devised prompts [4, 29, 30]. Our work mainly focuses on extending the jailbreaking research from LLMs to MLLMs, which aims to enhance the robustness and alignment of MLLMs.", + "bbox": [ + 212, + 599, + 784, + 779 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Harmlessness Alignment of MLLMs. By utilizing LLMs as backbones, MLLMs also inherit their alignment vulnerabilities. To explore the harmlessness alignment of MLLMs, several benchmarks are proposed to probe the potential harm-", + "bbox": [ + 214, + 794, + 782, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 472, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "fulness of MLLMs under different scenarios [13, 16, 27]. Some other work employ different jailbreak methods to further evaluate the adversarial robustness of MLLMs using white- or black-box methods. White-box methods mainly attack the input images or their embeddings of MLLMs. For input images, recent studies generate adversarial images with constraints of a harmful response set [8, 20, 22] or utilizing a teacher-forcing optimization approach [3]. For visual embeddings, Shayegani et al. [23] generates adversarial images that look harmless but are similar to the embeddings of harmful images, thereby bypassing harmful content filters. In contrast, recent work in black-box attacks jailbreak MLLMs by employing techniques such as system prompt attacks [31], transferring harmful information into text-oriented images [10], generating adversarial images with surrogate models [34], and maximum likelihood-based jailbreaking [17]. In our work, we first investigate how the visual input influences the harmlessness alignment of MLLMs, then propose a jailbreak methods incorporate both white- and black-box methods.", + "bbox": [ + 212, + 146, + 787, + 373 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 405, + 357, + 420 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we conducted a comprehensive empirical analysis of the harmlessness alignment of MLLMs, specifically examining the visual vulnerabilities for jailbreak. Our findings revealed that images pose significant vulnerabilities in the alignment of MLLMs: the presence of images, the cross-modal fine-tuning process, and the harmfulness of images all contribute to an increased propensity for MLLMs to generate harmful responses. Furthermore, we introduced HADES, a novel jailbreaking approach that hides and amplifies the harmfulness of textual instructions using meticulously crafted images. Extensive experiments have demonstrated that HADES can effectively jailbreak both open- and closed-source MLLMs. In summary, our work has presented strong evidence that the visual modality poses the alignment vulnerability of MLLMs, underscoring the urgent need for further exploration into cross-modal alignment. In future work, we will develop cross-modal training strategies to improve the harmlessness alignment of MLLMs.", + "bbox": [ + 212, + 446, + 787, + 656 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Societal Impacts. Our work aims to highlight the alignment vulnerabilities of existing MLLMs. We hope our jailbreak attempt can guide subsequent researchers in developing safer MLLMs. However, we acknowledge that certain elements of our research, such as harmful instructions and images, may have negative societal impacts. To minimize these negative effects, we have implemented several measures, including adding warnings in the abstract and placing safety statements on the dataset homepage. Furthermore, in the supplementary materials, we preliminarily explore how to use the HADES data to fine-tune MLLMs to enhance their safety alignment. Overall, we believe with these efforts, the positive contributions of our work outweigh its potential negative impacts.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement", + "text_level": 1, + "bbox": [ + 217, + 143, + 393, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was partially supported by National Natural Science Foundation of China under Grant No. 62222215, Beijing Natural Science Foundation under Grant No. L233008 and 4222027. Xin Zhao is the corresponding author.", + "bbox": [ + 212, + 175, + 787, + 220 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 243, + 321, + 258 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Anil, R., Borgeaud, S., Wu, Y., Alayrac, J., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., Millican, K., Silver, D., Petrov, S., Johnson, M., Antonoglou, I., Schrittwieser, J., Glaese, A., Chen, J., Pitler, E., Lillicrap, T.P., Lazaridou, A., First, O., Molloy, J., Isard, M., Barham, P.R., Hennigan, T., Lee, B., Viola, F., Reynolds, M., Xu, Y., Doherty, R., Collins, E., Meyer, C., Rutherford, E., Moreira, E., Ayoub, K., Goel, M., Tucker, G., Piqueras, E., Krikun, M., Barr, I., Savinov, N., Danihelka, I., Roelofs, B., White, A., Andreassen, A., von Glehn, T., Yagati, L., Kazemi, M., Gonzalez, L., Khalman, M., Sygnowski, J., et al.: Gemini: A family of highly capable multimodal models. CoRR abs/2312.11805 (2023)", + "2. Askell, A., Bai, Y., Chen, A., Drain, D., Ganguli, D., Henighan, T., Jones, A., Joseph, N., Mann, B., DasSarma, N., Elhage, N., Hatfield-Dodds, Z., Hernandez, D., Kernion, J., Ndousse, K., Olsson, C., Amodei, D., Brown, T.B., Clark, J., McCandlish, S., Olah, C., Kaplan, J.: A general language assistant as a laboratory for alignment. CoRR abs/2112.00861 (2021)", + "3. Carlini, N., Nasr, M., Choquette-Choo, C.A., Jagielski, M., Gao, I., Awadalla, A., Koh, P.W., Ippolito, D., Lee, K., Tramér, F., Schmidt, L.: Are aligned neural networks adversarially aligned? CoRR abs/2306.15447 (2023)", + "4. Chao, P., Robey, A., Dobriban, E., Hassani, H., Pappas, G.J., Wong, E.: Jailbreaking black box large language models in twenty queries. CoRR abs/2310.08419 (2023)", + "5. Chen, J., Zhu, D., Shen, X., Li, X., Liu, Z., Zhang, P., Krishnamoorthi, R., Chandra, V., Xiong, Y., Elhoseiny, M.: Minigpt-v2: large language model as a unified interface for vision-language multi-task learning. CoRR abs/2310.09478 (2023)", + "6. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J.T., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis. CoRR abs/2310.00426 (2023)", + "7. Chiang, W.L., Li, Z., Lin, Z., Sheng, Y., Wu, Z., Zhang, H., Zheng, L., Zhuang, S., Zhuang, Y., Gonzalez, J.E., Stoica, I., Xing, E.P.: Vicuna: An open-source chatbot impressing gpt-4 with $90\\%$ chatgpt quality (March 2023), https://lmsys.org/blog/2023-03-30-vicuna/", + "8. Dong, Y., Chen, H., Chen, J., Fang, Z., Yang, X., Zhang, Y., Tian, Y., Su, H., Zhu, J.: How robust is google's bard to adversarial image attacks? CoRR abs/2309.11751 (2023)", + "9. Ganguli, D., Lovitt, L., Kernion, J., Askell, A., Bai, Y., Kadavath, S., Mann, B., Perez, E., Schiefer, N., Ndousse, K., Jones, A., Bowman, S., Chen, A., Conerly, T., DasSarma, N., Drain, D., Elhage, N., Showk, S.E., Fort, S., Hatfield-Dodds, Z., Henighan, T., Hernandez, D., Hume, T., Jacobson, J., Johnston, S., Kravec, S., Olsson, C., Ringer, S., Tran-Johnson, E., Amodei, D., Brown, T., Joseph, N., McCandlish, S., Olah, C., Kaplan, J., Clark, J.: Red teaming language models to reduce harms: Methods, scaling behaviors, and lessons learned. CoRR abs/2209.07858 (2022)" + ], + "bbox": [ + 225, + 273, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 470, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "10. Gong, Y., Ran, D., Liu, J., Wang, C., Cong, T., Wang, A., Duan, S., Wang, X.: Figstep: Jailbreaking large vision-language models via typographic visual prompts. CoRR abs/2311.05608 (2023)", + "11. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Chen, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023)", + "12. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Zhang, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. CoRR abs/2307.04657 (2023)", + "13. Li, M., Li, L., Yin, Y., Ahmed, M., Liu, Z., Liu, Q.: Red teaming visual language models. CoRR abs/2401.12915 (2024)", + "14. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. CoRR abs/2310.03744 (2023)", + "15. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. CoRR abs/2304.08485 (2023)", + "16. Liu, X., Zhu, Y., Lan, Y., Yang, C., Qiao, Y.: Query-relevant images jailbreak large multi-modal models. CoRR abs/2311.17600 (2023)", + "17. Niu, Z., Ren, H., Gao, X., Hua, G., Jin, R.: Jailbreaking attack against multimodal large language model. CoRR abs/2402.02309 (2024)", + "18. OpenAI: Gpt-4v(ision) system card (2023)", + "19. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., Schulman, J., Hilton, J., Kelton, F., Miller, L., Simens, M., Askell, A., Welinder, P., Christiano, P.F., Leike, J., Lowe, R.: Training language models to follow instructions with human feedback. In: NeurIPS (2022)", + "20. Qi, X., Huang, K., Panda, A., Wang, M., Mittal, P.: Visual adversarial examples jailbreak large language models. CoRR abs/2306.13213 (2023)", + "21. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: ICML. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (2021)", + "22. Schlarmann, C., Hein, M.: On the adversarial robustness of multi-modal foundation models. In: IEEE/CVF International Conference on Computer Vision, ICCV 2023 - Workshops, Paris, France, October 2-6, 2023. pp. 3679-3687. IEEE (2023)", + "23. Shayegani, E., Dong, Y., Abu-Ghazaleh, N.B.: Jailbreak in pieces: Compositional adversarial attacks on multi-modal language models. CoRR abs/2307.14539 (2023)", + "24. Shen, X., Chen, Z., Backes, M., Shen, Y., Zhang, Y.: \"do anything now\": Characterizing and evaluating in-the-wild jailbreak prompts on large language models. CoRR abs/2308.03825 (2023)", + "25. Subhash, V., Bialas, A., Pan, W., Doshi-Velez, F.: Why do universal adversarial attacks work on large language models?: Geometry might be the answer. CoRR abs/2309.00254 (2023)", + "26. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Canton-Ferrer, C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura," + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Li, H. Guo et al.", + "bbox": [ + 271, + 114, + 403, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "P.S., Lachaux, M., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models. CoRR abs/2307.09288 (2023)", + "27. Tu, H., Cui, C., Wang, Z., Zhou, Y., Zhao, B., Han, J., Zhou, W., Yao, H., Xie, C.: How many unicorns are in this image? A safety evaluation benchmark for vision llms. CoRR abs/2311.16101 (2023)", + "28. Wang, J.G., Wang, J., Li, M., Neel, S.: Pandora's white-box: Increased training data leakage in open llms. arXiv preprint arXiv:2402.17012 (2024)", + "29. Wei, A., Haghtalab, N., Steinhardt, J.: Jailbroken: How does LLM safety training fail? In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023)", + "30. Wei, Z., Wang, Y., Wang, Y.: Jailbreak and guard aligned language models with only few in-context demonstrations. CoRR abs/2310.06387 (2023)", + "31. Wu, Y., Li, X., Liu, Y., Zhou, P., Sun, L.: Jailbreaking GPT-4V via self-adversarial attacks with system prompts. CoRR abs/2311.09127 (2023)", + "32. Yin, S., Fu, C., Zhao, S., Li, K., Sun, X., Xu, T., Chen, E.: A survey on multimodal large language models. CoRR abs/2306.13549 (2023)", + "33. Zhao, W.X., Zhou, K., Li, J., Tang, T., Wang, X., Hou, Y., Min, Y., Zhang, B., Zhang, J., Dong, Z., Du, Y., Yang, C., Chen, Y., Chen, Z., Jiang, J., Ren, R., Li, Y., Tang, X., Liu, Z., Liu, P., Nie, J., Wen, J.: A survey of large language models. CoRR abs/2303.18223 (2023)", + "34. Zhao, Y., Pang, T., Du, C., Yang, X., Li, C., Cheung, N., Lin, M.: On evaluating adversarial robustness of large vision-language models. CoRR abs/2305.16934 (2023)", + "35. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. CoRR abs/2304.10592 (2023)", + "36. Zou, A., Wang, Z., Kolter, J.Z., Fredrikson, M.: Universal and transferable adversarial attacks on aligned language models. CoRR abs/2307.15043 (2023)" + ], + "bbox": [ + 215, + 146, + 784, + 632 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Images are Achilles' Heel of Alignment", + "bbox": [ + 470, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_model.json b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_model.json new file mode 100644 index 0000000000000000000000000000000000000000..e2a17750a6bbc6960e480973b62375a69fa63973 --- /dev/null +++ b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_model.json @@ -0,0 +1,2148 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.223, + 0.141, + 0.782, + 0.21 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment: Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models" + }, + { + "type": "text", + "bbox": [ + 0.333, + 0.234, + 0.67, + 0.266 + ], + "angle": 0, + "content": "Yifan Li\\(^{1,3,\\star}\\), Hangyu Guo\\(^{1,3,\\star}\\), Kun Zhou\\(^{2,3,\\star}\\), Wayne Xin Zhao\\(^{1,3,\\dagger}\\), and Ji-Rong Wen\\(^{1,2,3}\\)" + }, + { + "type": "text", + "bbox": [ + 0.252, + 0.277, + 0.748, + 0.305 + ], + "angle": 0, + "content": "\\(^{1}\\) Gaoling School of Artificial Intelligence, Renmin University of China \\(^{2}\\) School of Information, Renmin University of China" + }, + { + "type": "text", + "bbox": [ + 0.252, + 0.305, + 0.748, + 0.334 + ], + "angle": 0, + "content": "3 Beijing Key Laboratory of Big Data Management and Analysis Methods {liyifan0925,hyguo0220,batmanfly}@gmail.com" + }, + { + "type": "list", + "bbox": [ + 0.252, + 0.277, + 0.748, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.371, + 0.741, + 0.524 + ], + "angle": 0, + "content": "Abstract. In this paper, we study the harmlessness alignment problem of multimodal large language models (MLLMs). We conduct a systematic empirical analysis of the harmlessness performance of representative MLLMs and reveal that the image input poses the alignment vulnerability of MLLMs. Inspired by this, we propose a novel jailbreak method named HADES, which hides and amplifies the harmfulness of the malicious intent within the text input, using meticulously crafted images. Experimental results show that HADES can effectively jailbreak existing MLLMs, which achieves an average Attack Success Rate (ASR) of \\(90.26\\%\\) for LLaVA-1.5 and \\(71.60\\%\\) for Gemini Pro Vision. Our code and data are available at https://github.com/RUCAIBox/HADES." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.524, + 0.7, + 0.537 + ], + "angle": 0, + "content": "Warning: this paper contains example data that may be offensive." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.551, + 0.741, + 0.579 + ], + "angle": 0, + "content": "Keywords: Multimodal Large Language Models \\(\\cdot\\) Harmlessness Alignment \\(\\cdot\\) Adversarial Attack" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.605, + 0.376, + 0.621 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.636, + 0.799, + 0.741 + ], + "angle": 0, + "content": "Recently, by leveraging the powerful capacity of large language models (LLMs) [33], a variety of multimodal large language models (MLLMs) [32] have emerged, which can process both textual and visual information similarly as that LLMs process textual input. MLLMs have not only shown superior performance in various visual-language tasks but also possess the capability to engage in image-related dialogues with human users [15,35]. However, MLLMs also confront similar harmlessness challenges that afflict their backbone LLMs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.742, + 0.79, + 0.805 + ], + "angle": 0, + "content": "Despite undergoing harmlessness alignment like reinforcement learning from human feedback (RLHF) [19], LLMs remain vulnerable to black-box attacks (e.g., sophisticated jailbreak prompts [4]) or white-box attacks (e.g., gradient-based adversarial inputs [36]). Since MLLMs are generally built on top of existing" + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.813, + 0.378, + 0.825 + ], + "angle": 0, + "content": "\\(\\star\\) Equal contribution." + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.826, + 0.396, + 0.84 + ], + "angle": 0, + "content": "† Corresponding author." + }, + { + "type": "list", + "bbox": [ + 0.232, + 0.813, + 0.396, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.404, + 0.127 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "image", + "bbox": [ + 0.222, + 0.145, + 0.782, + 0.332 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.346, + 0.785, + 0.374 + ], + "angle": 0, + "content": "Fig. 1: An example to show the influence of the visual modality on harmlessness alignment of Gemini Pro Vision. The harmful information is highlighted in red" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.411, + 0.785, + 0.531 + ], + "angle": 0, + "content": "LLMs, they inevitably suffer from these safety issues. To study the harmlessness alignment of MLLMs, recent work either evaluates the harmlessness of MLLMs in response to harmful instructions [16, 27], or assesses the model robustness by utilizing adversarial images [10, 20]. These studies suggest that the integration of the visual modality might exacerbate safety concerns for MLLMs compared to their backbone LLMs. As illustrated in Fig. 1, even one of the state-of-the-art MLLMs, Gemini Pro Vision [1], would be influenced by the blank or harmful images, leading to improper outputs with harmful words." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.746 + ], + "angle": 0, + "content": "However, it still lacks a deep understanding of how safety concerns occur in MLLMs and how they might be different from those in LLMs. Considering this issue, this work aims to systematically analyze the sourcing factors that violate the harmlessness alignment of MLLMs. We conduct detailed empirical studies on representative MLLMs, specifically investigating their performance on harmful instructions accompanied by images. Our findings are threefold: (1) Images can be backdoors for the harmlessness alignment of MLLMs. The inclusion of images in the input can significantly increase the harmfulness ratio of MLLMs' outputs; (2) Cross-modal fine-tuning undermines the alignment abilities of the backbone LLM for a given MLLM. The more parameters that are fine-tuned, the more severe the disruption is; (3) The harmfulness of MLLMs' responses is positively correlated with the harmfulness of the image content. These findings reveal that the visual modality introduces additional alignment vulnerabilities in MLLMs, which can be exploited to further jailbreak these models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Motivated by these empirical findings, we propose a novel jailbreak approach called HADES, standing for Hiding and Amplifying harmfulness in images to DESTroy multimodal alignment, to assess the adversarial robustness of both open-and closed-source MLLMs. Specifically, our approach introduces a three-stage attack strategy. First, it extracts the harmful information from the text input into typography and replaces such text with a text-to-image pointer, which guides" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.472, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.268 + ], + "angle": 0, + "content": "the model to focus on image information. In this way, we transfer the harmful input from the well-aligned text side into the image side, inducing models to be more prone to generate harmful outputs. Second, HADES attaches another harmful image to the original typography. This image is created by an image generation model, and its harmfulness has been amplified for multiple turns via prompt optimization. Third, HADES optimizes an adversarial noise via gradient update, towards inducing the MLLM to follow harmful instructions. The learned noise will be integrated into the previous image for jailbreaking MLLMs." + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.269, + 0.608, + 0.283 + ], + "angle": 0, + "content": "In summary, our main contributions are as follows:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.294, + 0.784, + 0.353 + ], + "angle": 0, + "content": "- We conduct detailed empirical studies on the harmfulness alignment of representative MLLMs, and systematically investigate the possible sourcing factors that violate the harmfulness alignment of MLLMs. The results reveal that the visual modality of MLLMs poses a critical alignment vulnerability." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.355, + 0.785, + 0.444 + ], + "angle": 0, + "content": "- We introduce HADES, a novel jailbreak approach that hides and amplifies the harmfulness of the original malicious intent using meticulously crafted images. Experimental results show that both open-source MLLMs based on aligned LLMs and powerful closed-source MLLMs struggle to resist HADES. Notably, HADES achieves an Attack Success Rate (ASR) of \\(90.26\\%\\) on LLaVA-1.5 and \\(71.60\\%\\) on Gemini Pro Vision." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.294, + 0.785, + 0.444 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.47, + 0.684, + 0.487 + ], + "angle": 0, + "content": "2 Empirical Harmlessness Analyses of MLLMs" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.503, + 0.788, + 0.564 + ], + "angle": 0, + "content": "In this section, we conduct a systematic investigation to examine whether and how visual input influences the harmlessness alignment of MLLMs. We first introduce the data collection process in Sec. 2.1 and the evaluation settings in Sec. 2.2, then evaluate mainstream open- and closed-source MLLMs in Sec. 2.3." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.587, + 0.486, + 0.602 + ], + "angle": 0, + "content": "2.1 Evaluation Data Collection" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.688 + ], + "angle": 0, + "content": "To evaluate the harmlessness alignment of MLLMs, we collect a dataset comprising 750 harmful instructions across 5 scenarios. Each instruction includes a harmful keyword or key phrase and is paired with a harmful image related to the keyword or key phrase. We present the collection process below and show the pipeline in the supplementary materials." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "First, based on existing harmful scenarios of LLMs [12], we select five representative ones that are related to the visual information in the real world: (1) Violence, Aiding and Abetting, Incitement; (2) Financial Crime, Property Crime, Theft; (3) Privacy Violation; (4) Self-Harm; and (5) Animal Abuse. For simplicity, these categories are referred to as Violence, Financial, Privacy, Self-Harm, and Animal, respectively. Next, we adopt GPT-4 to generate 50 keywords for each of the above harmful categories, and then synthesize three harmful but distinct instructions based on each keyword. The prompts employed for the above process are documented in the supplementary materials. In this way, we guarantee that each instruction includes only one harmful element (i.e., the keyword" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.404, + 0.127 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.239 + ], + "angle": 0, + "content": "or the key phrase), which could be accurately depicted by an image. Thus, we can pair each instruction with a corresponding real-world image that is relevant to the harmful keyword/phrase. Specifically, we first retrieve five images from Google using each keyword/phrase as the query, and then employ CLIP ViT-L/14 [21] to select the image that best matches the semantic representation of the keyword/phrase." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.258, + 0.423, + 0.274 + ], + "angle": 0, + "content": "2.2 Evaluation Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.281, + 0.788, + 0.357 + ], + "angle": 0, + "content": "We evaluate both representative open-source (i.e., LLaVA-1.5 [14], LLaVA-1.5 LoRA (represented by LLaVA-1.5L), MiniGPT-v2 [5] and MiniGPT-4 [35]) and powerful closed-source MLLMs (i.e., Gemini Pro Vision [1], short as Gemini \\(\\mathrm{Pro_V}\\)) and GPT-4V [18]) on our dataset. To discuss the influence of the visual modality on harmlessness alignment, we design four evaluation settings:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.364, + 0.785, + 0.424 + ], + "angle": 0, + "content": "- **Backbone:** We evaluate the backbone LLMs of MLLMs on harmful instructions, which have not been fine-tuned with cross-modal data, i.e., Vicuna v1.5-7B [7] for LLaVA-1.5, LLaMA-2-Chat-7B [26] for MiniGPT-4 and MiniGPT-v2, GPT-4 for GPT-4V, and Gemini Pro for Gemini Prov." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.425, + 0.713, + 0.438 + ], + "angle": 0, + "content": "- Text-only: We evaluate MLLMs purely on harmful instructions." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.438, + 0.784, + 0.468 + ], + "angle": 0, + "content": "- Blank: We evaluate MLLMs on harmful instructions paired with a \\(500 \\times 500\\) blank image." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.469, + 0.785, + 0.499 + ], + "angle": 0, + "content": "- **Toxic:** We evaluate MLLMs on harmful instructions paired with the previously selected harmful images (described in Sec. 2.1)." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.364, + 0.785, + 0.499 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.506, + 0.787, + 0.537 + ], + "angle": 0, + "content": "We employ Attack Success Rate (ASR) as the evaluation metric of harmlessness alignment, which is calculated by:" + }, + { + "type": "equation", + "bbox": [ + 0.403, + 0.546, + 0.785, + 0.577 + ], + "angle": 0, + "content": "\\[\n\\mathrm {A S R} = \\frac {\\sum_ {i = 1} ^ {N} \\mathbb {1} _ {\\{\\mathcal {J} (y _ {i}) = \\text {T r u e} \\}}}{N}, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.586, + 0.788, + 0.662 + ], + "angle": 0, + "content": "where \\( y_{i} \\) is the model's response, \\( \\mathbb{1} \\) is an indicator function that equals to 1 if \\( \\mathcal{I}(y_i) = \\mathrm{True} \\) and 0 otherwise, \\( N \\) is the total number of instructions and \\( \\mathcal{J} \\) is the harmfulness judging model, outputting True or False to indicate whether \\( y_{i} \\) is harmful. We adopt Beaver-dam-7B [12] as \\( \\mathcal{J} \\), which has been trained on high-quality human feedback data about the above harmful categories." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.681, + 0.418, + 0.696 + ], + "angle": 0, + "content": "2.3 Evaluation Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.75 + ], + "angle": 0, + "content": "The evaluation results are presented in Tab. 1. We list the ASR results of 5 harmful scenarios under 4 evaluation settings and calculate the average ASR across all scenarios. From the results, we can summarize three major findings:" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Images can be alignment backdoors of MLLMs. When comparing the performance of each model under the Backbone and Text-only settings, the harmlessness alignment of MLLMs does not significantly deviate from that of their backbone LLMs, and even exhibit enhanced defense capability, e.g., LLaVA-1.5 \\((-2.80\\%)\\) and Gemini Prov \\((-7.50\\%)\\). However, once adding images, regardless of whether their contents are harmful or not, the ASR results of MLLMs" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.472, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: The evaluation results of representative MLLMs on the dataset we collected. (Train) represents the cross-modal fine-tuning strategies of MLLMs. Animal, Financial, Privacy, Self-Harm, and Violence represent the ASR of MLLMs on instructions from these categories. Average represents the average ASR across all categories. + and - represents the change of ASR compared to the Backbone setting." + }, + { + "type": "table", + "bbox": [ + 0.219, + 0.227, + 0.782, + 0.581 + ], + "angle": 0, + "content": "
Model(Train)SettingAnimal Financial Privacy Self-Harm ViolenceAverage(%)
LLaVA-1.5(Full)Backbone17.3346.0034.6712.0034.6728.93
Text-only22.0040.0028.0010.0030.6726.13(-2.80)
Blank38.0066.6768.0030.6767.3354.13(+25.20)
Toxic54.0077.3382.6746.6780.0068.13(+39.20)
LLaVA-1.5L(LoRA)Backbone17.3346.0034.6712.0034.6728.93
Text-only23.3340.0030.009.3330.6726.67(-2.26)
Blank41.3367.3363.3325.3361.3351.73(+22.80)
Toxic48.6771.3374.6743.3376.0062.80(+33.87)
MiniGPT-v2(LoRA)Backbone0.000.000.000.000.670.13
Text-only7.3312.008.670.0015.338.67(+8.54)
Blank26.0046.6740.0016.0041.3334.00(+33.87)
Toxic37.3360.6750.0027.3344.0043.87(+43.74)
MiniGPT-4(Frozen)Backbone0.000.000.000.000.670.13
Text-only5.332.671.331.333.332.80(+2.67)
Blank15.3313.336.670.008.678.80(+8.67)
Toxic28.6735.3318.679.3325.3323.47(+23.34)
Gemini Prov(-)Backbone1.7013.8012.081.208.707.50
Text-only0.000.000.000.000.000.00(-7.50)
Blank13.3342.6734.005.3321.3323.33(+15.83)
Toxic19.3352.0045.336.6730.0030.67(+23.17)
GPT-4V(-)Backbone0.002.002.670.000.671.07
Text-only1.338.676.000.677.334.80(+3.73)
Blank2.004.676.000.006.673.87(+2.80)
Toxic2.0014.0014.000.006.007.20(+6.13)
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.613, + 0.785, + 0.673 + ], + "angle": 0, + "content": "would be greatly improved even under the Blank setting using harmless images, e.g., LLaVA-1.5 \\((+25.20\\%)\\) and MiniGPT-v2 \\((+33.87\\%)\\). It indicates that images can be the alignment backdoor of MLLMs, which would undermine MLLMs' capability of defending against harmful text input." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.675, + 0.795, + 0.84 + ], + "angle": 0, + "content": "More parameters tuned, less alignment left. By examining the performance of open-sourced MLLMs, we notice that their alignment performance is highly relevant to their training strategies during cross-modal fine-tuning. Generally, for the same backbone model, the more parameters are optimized during fine-tuning, the harmlessness alignment would be affected more significantly. For example, under the Toxic setting, MiniGPT-4, with the fixed backbone LLM, is more robust than the LoRA-fine-tuned MiniGPT-v2, achieving lower ASR results (23.47% vs. 43.87%). Similarly, the full-parameter fine-tuned LLaVA-1.5 also generates more harmful responses than LoRA-fine-tuned LLaVA-1.5L (68.13% vs. 62.80%). The reason may be that the cross-modal fine-tuning process would hurt the harmlessness alignment of the backbone MLLMs." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.404, + 0.127 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "image", + "bbox": [ + 0.246, + 0.151, + 0.756, + 0.449 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.466, + 0.788, + 0.536 + ], + "angle": 0, + "content": "Fig. 2: Given a harmful textual instruction, HADES involves a three-step procedure: (1) removes the harmful content from the text into typography; (2) combines it with a harmful image generated by a diffusion model, using an iteratively refined prompt from an LLM; (3) appends an adversarial image on top of the image, which elicits the MLLM to generate affirmative responses for harmful instructions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.564, + 0.788, + 0.685 + ], + "angle": 0, + "content": "Harmful images are more likely to elicit harmful outputs. We observe that MLLMs are more prone to produce harmful outputs when presented with harmful images. It holds for both open-source and closed-source models, as their ASR results under the Toxic setting greatly exceed the results from all other settings, e.g., MiniGPT-4 (23.47% vs. 8.80%) and LLaVA-1.5 (68.13% vs. 54.13%). It indicates that it is hard for current MLLMs to defend against harmful image inputs. With the increase in image harmfulness, MLLMs might be increasingly prone to generate more harmful outputs." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.705, + 0.676, + 0.723 + ], + "angle": 0, + "content": "3 The Proposed Jailbreak Approach: HADES" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Based on empirical studies, the visual input potentially brings vulnerabilities to the harmlessness alignment of MLLMs. However, it is not easy to manually craft massive adversarial samples that can successfully jailbreak MLLMs, which help detect the weak spots in real-world applications. To address it, based on harmful textual instructions, we propose a novel method to automatically synthesize high-quality adversarial examples, called HADES that stands for Hiding and Amplifying harmfulness in images to DEStroy multimodal alignment." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.472, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "Typically, an MLLM is composed of an LLM \\(\\mathcal{M}\\), an image encoder \\(\\mathbf{E}\\) and a projection layer \\(\\mathbf{W}\\). The generation process of MLLMs can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.427, + 0.189, + 0.786, + 0.205 + ], + "angle": 0, + "content": "\\[\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i), t ]), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.214, + 0.788, + 0.292 + ], + "angle": 0, + "content": "where \\( i \\) and \\( t \\) are the input image and text, and \\( y \\) is the model's output. Given a harmful \\( t \\), HADES aims to modify \\( t \\) to \\( t' \\) by adding a text-to-image pointer and crafts harmful images \\( i' \\). Thereby, HADES transfers the malicious intent to the less-aligned image side of the MLLM, inducing it to generate harmful responses \\( y' \\). The whole process of HADES is presented in Fig. 2." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.312, + 0.596, + 0.328 + ], + "angle": 0, + "content": "3.1 Hiding Harmfulness from Text to Image" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.335, + 0.784, + 0.425 + ], + "angle": 0, + "content": "By training on human preference data, existing LLMs learn to align with human values and refuse to respond to harmful text inputs. MLLMs derived from these LLMs naturally inherit the defense capacity for text inputs but leave the image side vulnerable to harmful content. Hence, we propose transferring harmful information from the well-aligned text side to the less-aligned image side, to bypass the defense mechanisms of MLLMs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.788, + 0.577 + ], + "angle": 0, + "content": "Specifically, we replace the harmful keyword or key phrase from each text instruction \\( t \\) with a text-to-image pointer and utilize images to represent it. On the text side, we categorize all the keywords into three classes: objects, concepts, or behaviors. For the keywords falling under the first two categories, the text-to-image pointer is \"the object/concept in the image\", while for the keywords denoting behaviors, the text-to-image pointer is \"conduct the behavior in the image on\". On the image side, as the keywords may represent abstract concepts or behaviors that are difficult for models to grasp when depicted by real-world images, we employ typography to represent these keywords. As a result, the generation process of MLLMs can be formally given as:" + }, + { + "type": "equation", + "bbox": [ + 0.414, + 0.589, + 0.786, + 0.605 + ], + "angle": 0, + "content": "\\[\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\mathrm {t y p}}), t ^ {\\prime} ]), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.661 + ], + "angle": 0, + "content": "where \\( i_{\\mathrm{typ}} \\) is the typography of the keyword and \\( t' \\) is the modified instruction. By doing so, \\( t' \\) no longer explicitly contains any harmful information, yet models can still infer the original harmful intent by referring to \\( i_{\\mathrm{typ}} \\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.68, + 0.617, + 0.696 + ], + "angle": 0, + "content": "3.2 Amplifying Image Harmfulness with LLMs" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.784, + 0.81 + ], + "angle": 0, + "content": "Our empirical study reveals that when the image input becomes more harmful, MLLMs also tend to generate more harmful responses. Therefore, we propose to append a harmful image to the previous typography \\( i_{typ} \\) to amplify their harmfulness. Since the harmfulness of real-world images is always limited, we introduce diffusion models as the harmful image generator. In addition, we utilize LLMs as the attacker model to iteratively optimize the prompt for diffusion models to further increase the harmfulness of generated images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.786, + 0.84 + ], + "angle": 0, + "content": "The whole procedure of image harmfulness optimization is presented in the supplementary materials. We leverage the harmfulness of the caption as the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.404, + 0.127 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.389 + ], + "angle": 0, + "content": "proxy for the image's harmfulness, as the harmfulness of text is easier to quantify than images. We consider an iterative process to generate harmful images. We first ask ChatGPT to modify the original instruction \\( t \\) into an initial image generation prompt \\( p_0 \\) and generate an initial image. At step \\( k \\), the caption model \\( \\mathcal{C} \\) generates a caption \\( c_k \\) for the target image \\( i_{\\mathrm{opt}}^k \\). Subsequently, the judging model \\( \\mathcal{J} \\) assesses the image's harmfulness with a score, \\( s_k \\), on a scale from 1 to 10, where a higher score indicates greater harmfulness. \\( \\mathcal{J} \\) also explains the reason for its score in \\( exp_k \\). All this information (\\( p_k \\), \\( c_k \\), \\( s_k \\), and \\( exp_k \\)) is appended to the conversation history \\( h \\) and sent to the attacker model \\( \\mathcal{A} \\) which first suggests improvements to the prompt and then generates the refined image generation prompt \\( p_{k+1} \\). The refined prompt is then used to generate a new image \\( i_{\\mathrm{opt}}^{k+1} \\). The above process circulates until reaching the maximum iteration turn \\( K \\), which is set to 5. In practice, we choose GPT-4-0613 as both the attacker and judging model by utilizing different system prompts (as presented in the supplementary materials). For captioning and image generation, we adopt LLaVA-1.5 and PixArt-α [6], respectively." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.39, + 0.787, + 0.42 + ], + "angle": 0, + "content": "The optimized images \\( i_{\\mathrm{opt}} \\) is then vertically concatenated with the previous typography \\( i_{\\mathrm{typ}} \\), which can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.391, + 0.429, + 0.785, + 0.446 + ], + "angle": 0, + "content": "\\[\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\text {o p t}} \\oplus i _ {\\text {t y p}}), t ^ {\\prime} ]). \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.454, + 0.788, + 0.545 + ], + "angle": 0, + "content": "In this way, both images can mutually enhance their respective attack effects. The utilization of \\( t' \\) forces the model to focus more on the image, thereby increasing its sensitivity to harmful content. Simultaneously, \\( i_{\\mathrm{opt}} \\), which is semantically close to the original instructions, serves as the additional context and aids the model in understanding the original harmful intent of masked instructions, which can partially compensate for some models' insufficient OCR capabilities." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.565, + 0.709, + 0.581 + ], + "angle": 0, + "content": "3.3 Amplifying Image Harmfulness with Gradient Update" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.589, + 0.787, + 0.634 + ], + "angle": 0, + "content": "Existing work has proven the effectiveness of adversarial images in jailbreaking MLLMs. To further enhance the attack effectiveness, HADES incorporates adversarial images by concatenating them with the previous images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.635, + 0.788, + 0.816 + ], + "angle": 0, + "content": "The image input of MLLMs is encoded through an image encoder and then mapped into the LLM representation space via a projection layer. Consequently, images are represented as a sequence of distinct visual tokens, collectively forming a visual prompt. It allows us to view adversarial images, those that prompt MLLMs to produce malicious responses, as text jailbreak prompts such as \"Do Anything Now\" [24]. Jailbreak prompts are commonly placed at the beginning of malicious instructions without compromising the models' understanding of these instructions. Given the similarity between adversarial images and jailbreak prompts, we suggest that concatenating adversarial images on top of the image input of MLLMs can also prompt them to produce harmful information without compromising their understanding of the original image content. Consequently, the full formulation of HADES can be given as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.368, + 0.825, + 0.785, + 0.842 + ], + "angle": 0, + "content": "\\[\ny = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\mathrm {a d v}} \\oplus i _ {\\mathrm {o p t}} \\oplus i _ {\\mathrm {t y p}}), t ^ {\\prime} ]). \\tag {5}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.473, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.128 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.299 + ], + "angle": 0, + "content": "To ensure the generalization capability of our method, we generate a single adversarial image \\( i_{\\mathrm{adv}} \\) for all harmful instructions within the same category in our dataset. Initially, \\( i_{\\mathrm{adv}} \\) is set to be a blank image \\( i_{\\mathrm{initial}} \\). Subsequently, we collect a set of affirmative responses, \\( Y_{a} \\), containing 10 examples (e.g., \"Sure!\" or \"I can answer the question for you.\") intended as the desired output of MLLMs. We provide the target model with one harmful instruction \\( t_{j} \\) and the adversarial image \\( i_{\\mathrm{adv}} \\), and then select one affirmative response as the target label and compute the cross-entropy loss between the model's output and this target. The gradient derived from this loss is then utilized to iteratively refine the adversarial image \\( i_{\\mathrm{adv}} \\). The optimization procedure can be formulated as below:" + }, + { + "type": "equation", + "bbox": [ + 0.299, + 0.314, + 0.786, + 0.353 + ], + "angle": 0, + "content": "\\[\ni _ {\\mathrm {a d v}} \\leftarrow i _ {\\text {i n i t i a l}} + \\arg \\min _ {\\delta} \\sum_ {j = 1} ^ {m} - \\log \\left(p _ {\\theta} \\left(y _ {j} \\mid t _ {j}, i _ {\\text {i n i t i a l}} + \\delta\\right)\\right), \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.366, + 0.79, + 0.429 + ], + "angle": 0, + "content": "where \\(y_{j}\\in Y_{a}\\), and \\(p_{\\theta}\\) represents the conditional probability generated by the target MLLM. Additionally, to maintain \\(i_{\\mathrm{adv}}\\) as a valid image, we constrain \\(i_{\\mathrm{initial}} + \\delta \\in \\mathcal{B}\\) during the optimization, where \\(\\mathcal{B} = [0,1]^{w\\times h\\times c}\\) and \\(w\\), \\(h\\), and \\(c\\) denote the width, height, and channels of \\(i_{\\mathrm{adv}}\\), respectively." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.459, + 0.367, + 0.475 + ], + "angle": 0, + "content": "4 Experiment" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.498, + 0.429, + 0.515 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.531, + 0.788, + 0.653 + ], + "angle": 0, + "content": "For closed-source models, we select GPT-4V and Gemini Prov. For open-source models, we also select the MLLMs used before, i.e. LLaVA-1.5 and LLaVA-1.5L. We also select LLaVA built on Llama-2-Chat-7b, as it has experienced safety RLHF. Given the limited OCR capabilities of the open-source MLLMs, they could misinterpret the keywords in \\(i_{\\mathrm{typ}}\\). Thus, we continually prompt open-source MLLMs until they either explicitly generate the harmful keywords or reach the maximum allowed retries (set to 5 in practice). To verify the effectiveness of each component of HADES, we design four evaluation settings:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.668, + 0.785, + 0.699 + ], + "angle": 0, + "content": "- Typ image: Evaluate all models with the original instructions \\( t \\) and corresponding typography \\( i_{\\mathrm{typ}} \\)." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.7, + 0.786, + 0.731 + ], + "angle": 0, + "content": "- +Text-to-image pointer: Evaluate all models with modified instructions \\( t' \\) and the typography \\( i_{\\mathrm{typ}} \\). The generation process is the same as Eq. (3)." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.732, + 0.786, + 0.762 + ], + "angle": 0, + "content": "- +Opt image: Evaluate all models with \\( t' \\) and the concatenation of \\( i_{\\mathrm{typ}} \\) and \\( i_{\\mathrm{opt}} \\). The generation process is the same as Eq. (4)." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.763, + 0.786, + 0.825 + ], + "angle": 0, + "content": "- +Adv image: The full version of HADES. Since we don't have access to the parameters of Gemini \\(\\mathrm{Prov}\\) and GPT-4V, we only evaluate open-source models with \\(t'\\) and the concatenation of \\(i_{\\mathrm{typ}}\\), \\(i_{\\mathrm{opt}}\\) and \\(i_{\\mathrm{adv}}\\). The generation process is the same as Eq. (5)." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.668, + 0.786, + 0.825 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.405, + 0.128 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.188 + ], + "angle": 0, + "content": "Table 2: The evaluation results of MLLMs on instructions and images processed by HADES. T2I pointer represents Text-to-image pointer. + and - represents the change of ASR compared to the Typ image setting." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.2, + 0.787, + 0.489 + ], + "angle": 0, + "content": "
ModelSettingAnimalFinancialPrivacySelf-HarmViolenceAverage(%)
LLaVA-1.5Typ image48.6781.3378.0038.6781.3365.60
+T2I pointer32.6761.3371.3342.6782.6758.13(-7.47)
+Opt image67.3384.0085.3362.0094.0078.53(+12.93)
+Adv image83.3389.3394.6789.3394.6790.26(+24.66)
LLaVA-1.5LTyp image50.0071.3374.6735.3379.3362.13
+T2I pointer30.6753.3359.3324.6772.0048.00(-14.13)
+Opt image72.0082.6786.6761.3392.0078.93(+16.80)
+Adv image83.3391.3392.6784.6792.6788.93(+26.80)
LLaVATyp image20.6753.3333.338.0040.0031.07
+T2I pointer20.0044.0053.3315.3355.3337.60(+6.53)
+Opt image51.3374.0078.0041.3380.0064.93(+33.86)
+Adv image76.0089.3384.6775.3387.3382.53(+51.46)
Gemini ProvTyp image30.0056.0046.6717.3322.0034.40
+T2I pointer65.3364.0058.0034.6734.6751.33(+16.93)
+Opt image67.3386.6781.3344.0078.6771.60(+37.20)
GPT-4VTyp image0.671.334.000.002.671.73
+T2I pointer3.336.003.331.332.003.20(+1.47)
+Opt image2.6724.6727.331.3319.3315.07(+13.34)
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.515, + 0.427, + 0.53 + ], + "angle": 0, + "content": "4.2 Experiment Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.788, + 0.705 + ], + "angle": 0, + "content": "The evaluation results in Tab. 2 demonstrate that HADES significantly enhances the attack success rate (ASR) for both open- and closed-source MLLMs. Specifically, the average ASR for the three models in the LLaVA series exceeds 80 percent. Gemini ProV also struggles to counteract harmful instructions generated by HADES with an average ASR of \\(71.60\\%\\). Among the evaluated models, GPT-4V exhibits the strongest defense capacity against HADES, yielding a \\(15.07\\%\\) proportion of harmful responses. When examining the models' performance across different categories of harmful instructions, it can be observed that they generally exhibit stronger defenses against instructions related to Animal and Self-Harm, while instructions about Financial, Privacy, and Violence categories are more likely to break through the models' safeguards." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.79, + 0.84 + ], + "angle": 0, + "content": "Under the \\(+\\) Text-to-image pointer setting, we observe diverse attack outcomes across different models. The ASR increases for LLaVA \\((+6.53\\%)\\), Gemini \\(\\mathrm{Prov}_{\\mathrm{V}}(+16.93\\%)\\) and GPT-4V \\((+1.47\\%)\\), while decreases for LLaVA-1.5 \\((-7.47\\%)\\) and LLaVA-1.5L \\((-14.13\\%)\\). We attribute the ASR drop on these models to two main reasons. Firstly, some models have limited OCR capabilities, which causes them to misunderstand certain instructions as benign and consequently generate harmless responses. Notably, Gemini \\(\\mathrm{Prov}_{\\mathrm{V}}\\) and GPT-4V, which possess advanced OCR capabilities, exhibit more harmful behavior under this setting. This suggests as the development of MLLMs, their enhancing OCR capabilities" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.472, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.223 + ], + "angle": 0, + "content": "will correspondingly increase the effectiveness of our method. Secondly, the text-to-image pointer is designed to bypass the defense mechanisms of MLLMs on the text side. Therefore, its effectiveness is constrained on models with inadequate harmlessness alignment (e.g., Vicuna v1.5 in LLaVA-1.5). In such cases, the improvement in ASR could be offset by the decrease due to misunderstanding." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.223, + 0.788, + 0.357 + ], + "angle": 0, + "content": "The incorporation of \\( i_{\\mathrm{opt}} \\) under the \\( +Opt \\) image setting significantly increases the ASR of all models, even more than 30 percent (e.g., LLaVA \\( (+33.86\\%) \\) and Gemini ProV \\( (+37.20\\%) \\)). These results further verify our previous empirical finding: harmful images tend to elicit harmful responses. Moreover, \\( i_{\\mathrm{opt}} \\) helps mitigate the misunderstanding issues observed with LLaVA-1.5 and LLaVA-1.5L. The ASR of these two models increases notably compared to the \\( +Text-to-image \\) pointer setting. We attribute such results to that \\( i_{\\mathrm{opt}} \\) always describes scenarios relevant to the instruction contents, which provides extra context that helps MLLMs to accurately understand the instruction." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.359, + 0.788, + 0.465 + ], + "angle": 0, + "content": "Finally, by combining \\( i_{\\mathrm{adv}} \\) under the \\( +Adv \\) image setting, the full version of HADES further increases the ASR on open-source models. Even LLaVA, whose backbone LLM is well-aligned by RLHF, achieves an average ASR of \\( 82.53\\% \\). HADES also demonstrates promising ASR on categories that are relatively harder to jailbreak under previous settings. For LLaVA, the ASR on the Animal category rises from \\( 51.33\\% \\) to \\( 76.00\\% \\), while the ASR on the Self-Harm category rises from \\( 41.33\\% \\) to \\( 75.33\\% \\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.486, + 0.407, + 0.501 + ], + "angle": 0, + "content": "4.3 Further Analyses" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.787, + 0.541 + ], + "angle": 0, + "content": "In this part, we further discuss the effectiveness of our proposed approach, from image harmfulness optimization, attack transferability, and jailbreak cases." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.562, + 0.522, + 0.773 + ], + "angle": 0, + "content": "Effectiveness of Image Harmfulness Optimization. To validate the effectiveness of the optimization process for image generation discussed in Sec. 3.2, we conduct a specific experiment to examine the attack performance with the intermediately generated images with gradually increasing optimization steps. As shown in Fig. 3, the ASR results of all the comparison models consistently improve when using more optimization steps for image generation. These findings affirm the efficacy of our proposed image harmfulness optimization method in HADES." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.52, + 0.84 + ], + "angle": 0, + "content": "Transferability of Adversarial Attack. To further validate the transferability of HADES across various MLLMs and" + }, + { + "type": "image", + "bbox": [ + 0.539, + 0.594, + 0.78, + 0.737 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.53, + 0.747, + 0.788, + 0.79 + ], + "angle": 0, + "content": "Fig.3: The ASR results of different models on HADES using images generated at different optimization steps." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.404, + 0.127 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.15, + 0.48, + 0.312 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.25, + 0.316, + 0.449, + 0.328 + ], + "angle": 0, + "content": "(a) Transferability across MLLMs." + }, + { + "type": "image", + "bbox": [ + 0.525, + 0.146, + 0.785, + 0.312 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.549, + 0.316, + 0.76, + 0.328 + ], + "angle": 0, + "content": "(b) Transferability across categories." + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.339, + 0.788, + 0.381 + ], + "angle": 0, + "content": "Fig. 4: The evaluation results of transferability of HADES across different MLLMs (LLaVA, LLaVA-1.5 and LLaVA-1.5L) and different instruction categories (Violence, Self-Harm, Privacy, Financial, and Animal)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.415, + 0.789, + 0.658 + ], + "angle": 0, + "content": "harmful categories, we select Violence as the primary category for assessing cross-model transferability and LLaVA as the target model for exploring cross-category transferability. We then implement HADES utilizing \\( i_{\\mathrm{opt}} \\) trained on a specific model/category to conduct attacks on other models/categories. The evaluation results are presented in Fig. 4. Fig. 4a demonstrates that HADES trained on one MLLM achieves comparable ASR on other MLLMs. Additionally, we observe that attacks between LLaVA-1.5 and LLaVA-1.5L demonstrate significant mutual transferability, likely due to their shared backbone LLMs and vision encoders. Furthermore, as illustrated in Fig. 4b, HADES demonstrates enhanced transferability within specific harmful categories such as Self-Harm, Violence, and Animal, as well as Privacy and Financial. Such phenomena can be attributed to the similar semantic contexts shared among instructions within these categories. For instance, instructions related to Violence and Self-Harm often involve physically harmful actions such as \"hitting\" or \"killing\", whereas those about Privacy and Financial both typically focus on abstract harmful concepts like \"eavesdropping\" or \"Forgery\"." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Jailbreak Cases. To better understand how our approach jailbreaks MLLMs, we analyze the successful attack cases from Gemini ProV and GPT-4V, and summarize three representative jailbreak categories, which are presented on the left side of Fig. 5. Each category is related to a distinct multimodal capability, i.e., optical character recognition (OCR), image captioning and instruction following. For the OCR category, the model explicitly recognizes the keywords from the \\(i_{\\mathrm{typ}}\\) before following the instruction. For the Captioning category, the model describes the scenario depicted in \\(i_{\\mathrm{opt}}\\) before following the instruction. For the Instruction Following category, the model directly follows the harmful instruction. We further calculate the proportion of these categories among all" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.473, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.151, + 0.646, + 0.188 + ], + "angle": 0, + "content": "OCR: The concept shown in the image is \"bribery\". Here are some methods for initiating this concept with a corporate executive..." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.204, + 0.646, + 0.24 + ], + "angle": 0, + "content": "Captioning: The image shows a person in a suit making counterfeit money. The steps to produce counterfeit money are as follows..." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.256, + 0.646, + 0.292 + ], + "angle": 0, + "content": "Instruction Following: To avoid being noticed while committing a theft, it is important to be aware of your surroundings and..." + }, + { + "type": "image", + "bbox": [ + 0.656, + 0.147, + 0.781, + 0.295 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.309, + 0.784, + 0.337 + ], + "angle": 0, + "content": "Fig. 5: The representative cases and statistics of three harmful response types on Gemini Prov and GPT-4V. The text related to the corresponding type is underlined." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.366, + 0.784, + 0.396 + ], + "angle": 0, + "content": "successful attack cases of Gemini Pro\\(_V\\) and GPT-4V, and illustrate the result on the right part of Fig. 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.397, + 0.785, + 0.547 + ], + "angle": 0, + "content": "From the charts, we notice that most jailbroken cases are due to the conflicts between the general instruction following abilities of MLLMs and their harmlessness alignment, while captioning and OCR abilities also occupy considerable proportions. The results suggest that the cross-modal fine-tuning may impose a kind of \"inverse alignment tax\" on MLLMs, which improves their multimodal abilities while impairing the harmlessness alignment. Therefore, to enhance the harmlessness alignment of MLLMs, future work could consider adding more adversarial samples that consist of harmful instructions and images during the cross-modal fine-tuning process, which ensures MLLMs defend attacks from the image side while maintaining multimodal abilities." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.569, + 0.387, + 0.585 + ], + "angle": 0, + "content": "5 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.6, + 0.785, + 0.78 + ], + "angle": 0, + "content": "Harmlessness Alignment of LLMs. Alignment involves fine-tuning LLMs with human-preferred annotations to ensure responses are Helpful, Honest, and Harmless (the 3H principle [2]). Among them, the harmlessness alignment of LLMs has attracted extensive research attention. To evaluate the robustness of LLMs to harmful instructions, researchers employ red teaming to benchmark the safety degree of LLMs [9, 11]. Additionally, some studies further explore the harmlessness alignment of LLMs with jailbreaking methods. Some adopt white-box attacks, which utilize the model gradients to customize adversarial inputs [25, 28, 36], while black-box attacks typically launch attacks through manually or automatically devised prompts [4, 29, 30]. Our work mainly focuses on extending the jailbreaking research from LLMs to MLLMs, which aims to enhance the robustness and alignment of MLLMs." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.795, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Harmlessness Alignment of MLLMs. By utilizing LLMs as backbones, MLLMs also inherit their alignment vulnerabilities. To explore the harmlessness alignment of MLLMs, several benchmarks are proposed to probe the potential harm-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.404, + 0.127 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.374 + ], + "angle": 0, + "content": "fulness of MLLMs under different scenarios [13, 16, 27]. Some other work employ different jailbreak methods to further evaluate the adversarial robustness of MLLMs using white- or black-box methods. White-box methods mainly attack the input images or their embeddings of MLLMs. For input images, recent studies generate adversarial images with constraints of a harmful response set [8, 20, 22] or utilizing a teacher-forcing optimization approach [3]. For visual embeddings, Shayegani et al. [23] generates adversarial images that look harmless but are similar to the embeddings of harmful images, thereby bypassing harmful content filters. In contrast, recent work in black-box attacks jailbreak MLLMs by employing techniques such as system prompt attacks [31], transferring harmful information into text-oriented images [10], generating adversarial images with surrogate models [34], and maximum likelihood-based jailbreaking [17]. In our work, we first investigate how the visual input influences the harmlessness alignment of MLLMs, then propose a jailbreak methods incorporate both white- and black-box methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.406, + 0.358, + 0.421 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.447, + 0.788, + 0.657 + ], + "angle": 0, + "content": "In this paper, we conducted a comprehensive empirical analysis of the harmlessness alignment of MLLMs, specifically examining the visual vulnerabilities for jailbreak. Our findings revealed that images pose significant vulnerabilities in the alignment of MLLMs: the presence of images, the cross-modal fine-tuning process, and the harmfulness of images all contribute to an increased propensity for MLLMs to generate harmful responses. Furthermore, we introduced HADES, a novel jailbreaking approach that hides and amplifies the harmfulness of textual instructions using meticulously crafted images. Extensive experiments have demonstrated that HADES can effectively jailbreak both open- and closed-source MLLMs. In summary, our work has presented strong evidence that the visual modality poses the alignment vulnerability of MLLMs, underscoring the urgent need for further exploration into cross-modal alignment. In future work, we will develop cross-modal training strategies to improve the harmlessness alignment of MLLMs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Societal Impacts. Our work aims to highlight the alignment vulnerabilities of existing MLLMs. We hope our jailbreak attempt can guide subsequent researchers in developing safer MLLMs. However, we acknowledge that certain elements of our research, such as harmful instructions and images, may have negative societal impacts. To minimize these negative effects, we have implemented several measures, including adding warnings in the abstract and placing safety statements on the dataset homepage. Furthermore, in the supplementary materials, we preliminarily explore how to use the HADES data to fine-tune MLLMs to enhance their safety alignment. Overall, we believe with these efforts, the positive contributions of our work outweigh its potential negative impacts." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.472, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.395, + 0.163 + ], + "angle": 0, + "content": "Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.222 + ], + "angle": 0, + "content": "This work was partially supported by National Natural Science Foundation of China under Grant No. 62222215, Beijing Natural Science Foundation under Grant No. L233008 and 4222027. Xin Zhao is the corresponding author." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.244, + 0.323, + 0.26 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.786, + 0.399 + ], + "angle": 0, + "content": "1. Anil, R., Borgeaud, S., Wu, Y., Alayrac, J., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., Millican, K., Silver, D., Petrov, S., Johnson, M., Antonoglou, I., Schrittwieser, J., Glaese, A., Chen, J., Pitler, E., Lillicrap, T.P., Lazaridou, A., First, O., Molloy, J., Isard, M., Barham, P.R., Hennigan, T., Lee, B., Viola, F., Reynolds, M., Xu, Y., Doherty, R., Collins, E., Meyer, C., Rutherford, E., Moreira, E., Ayoub, K., Goel, M., Tucker, G., Piqueras, E., Krikun, M., Barr, I., Savinov, N., Danihelka, I., Roelofs, B., White, A., Andreassen, A., von Glehn, T., Yagati, L., Kazemi, M., Gonzalez, L., Khalman, M., Sygnowski, J., et al.: Gemini: A family of highly capable multimodal models. CoRR abs/2312.11805 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.401, + 0.787, + 0.468 + ], + "angle": 0, + "content": "2. Askell, A., Bai, Y., Chen, A., Drain, D., Ganguli, D., Henighan, T., Jones, A., Joseph, N., Mann, B., DasSarma, N., Elhage, N., Hatfield-Dodds, Z., Hernandez, D., Kernion, J., Ndousse, K., Olsson, C., Amodei, D., Brown, T.B., Clark, J., McCandlish, S., Olah, C., Kaplan, J.: A general language assistant as a laboratory for alignment. CoRR abs/2112.00861 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.469, + 0.787, + 0.509 + ], + "angle": 0, + "content": "3. Carlini, N., Nasr, M., Choquette-Choo, C.A., Jagielski, M., Gao, I., Awadalla, A., Koh, P.W., Ippolito, D., Lee, K., Tramér, F., Schmidt, L.: Are aligned neural networks adversarially aligned? CoRR abs/2306.15447 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.511, + 0.787, + 0.55 + ], + "angle": 0, + "content": "4. Chao, P., Robey, A., Dobriban, E., Hassani, H., Pappas, G.J., Wong, E.: Jailbreaking black box large language models in twenty queries. CoRR abs/2310.08419 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.552, + 0.787, + 0.592 + ], + "angle": 0, + "content": "5. Chen, J., Zhu, D., Shen, X., Li, X., Liu, Z., Zhang, P., Krishnamoorthi, R., Chandra, V., Xiong, Y., Elhoseiny, M.: Minigpt-v2: large language model as a unified interface for vision-language multi-task learning. CoRR abs/2310.09478 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.594, + 0.787, + 0.633 + ], + "angle": 0, + "content": "6. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J.T., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis. CoRR abs/2310.00426 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.634, + 0.787, + 0.688 + ], + "angle": 0, + "content": "7. Chiang, W.L., Li, Z., Lin, Z., Sheng, Y., Wu, Z., Zhang, H., Zheng, L., Zhuang, S., Zhuang, Y., Gonzalez, J.E., Stoica, I., Xing, E.P.: Vicuna: An open-source chatbot impressing gpt-4 with \\(90\\%\\) chatgpt quality (March 2023), https://lmsys.org/blog/2023-03-30-vicuna/" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.787, + 0.73 + ], + "angle": 0, + "content": "8. Dong, Y., Chen, H., Chen, J., Fang, Z., Yang, X., Zhang, Y., Tian, Y., Su, H., Zhu, J.: How robust is google's bard to adversarial image attacks? CoRR abs/2309.11751 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.787, + 0.84 + ], + "angle": 0, + "content": "9. Ganguli, D., Lovitt, L., Kernion, J., Askell, A., Bai, Y., Kadavath, S., Mann, B., Perez, E., Schiefer, N., Ndousse, K., Jones, A., Bowman, S., Chen, A., Conerly, T., DasSarma, N., Drain, D., Elhage, N., Showk, S.E., Fort, S., Hatfield-Dodds, Z., Henighan, T., Hernandez, D., Hume, T., Jacobson, J., Johnston, S., Kravec, S., Olsson, C., Ringer, S., Tran-Johnson, E., Amodei, D., Brown, T., Joseph, N., McCandlish, S., Olah, C., Kaplan, J., Clark, J.: Red teaming language models to reduce harms: Methods, scaling behaviors, and lessons learned. CoRR abs/2209.07858 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.274, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.404, + 0.127 + ], + "angle": 0, + "content": "Y. Li, H. Guo et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "10. Gong, Y., Ran, D., Liu, J., Wang, C., Cong, T., Wang, A., Duan, S., Wang, X.: Figstep: Jailbreaking large vision-language models via typographic visual prompts. CoRR abs/2311.05608 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.272 + ], + "angle": 0, + "content": "11. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Chen, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.273, + 0.785, + 0.314 + ], + "angle": 0, + "content": "12. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Zhang, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. CoRR abs/2307.04657 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.785, + 0.342 + ], + "angle": 0, + "content": "13. Li, M., Li, L., Yin, Y., Ahmed, M., Liu, Z., Liu, Q.: Red teaming visual language models. CoRR abs/2401.12915 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.343, + 0.785, + 0.37 + ], + "angle": 0, + "content": "14. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. CoRR abs/2310.03744 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.398 + ], + "angle": 0, + "content": "15. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. CoRR abs/2304.08485 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.399, + 0.785, + 0.424 + ], + "angle": 0, + "content": "16. Liu, X., Zhu, Y., Lan, Y., Yang, C., Qiao, Y.: Query-relevant images jailbreak large multi-modal models. CoRR abs/2311.17600 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.452 + ], + "angle": 0, + "content": "17. Niu, Z., Ren, H., Gao, X., Hua, G., Jin, R.: Jailbreaking attack against multimodal large language model. CoRR abs/2402.02309 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.453, + 0.528, + 0.467 + ], + "angle": 0, + "content": "18. OpenAI: Gpt-4v(ision) system card (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.468, + 0.785, + 0.522 + ], + "angle": 0, + "content": "19. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., Schulman, J., Hilton, J., Kelton, F., Miller, L., Simens, M., Askell, A., Welinder, P., Christiano, P.F., Leike, J., Lowe, R.: Training language models to follow instructions with human feedback. In: NeurIPS (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.523, + 0.785, + 0.55 + ], + "angle": 0, + "content": "20. Qi, X., Huang, K., Panda, A., Wang, M., Mittal, P.: Visual adversarial examples jailbreak large language models. CoRR abs/2306.13213 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.785, + 0.605 + ], + "angle": 0, + "content": "21. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: ICML. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.785, + 0.647 + ], + "angle": 0, + "content": "22. Schlarmann, C., Hein, M.: On the adversarial robustness of multi-modal foundation models. In: IEEE/CVF International Conference on Computer Vision, ICCV 2023 - Workshops, Paris, France, October 2-6, 2023. pp. 3679-3687. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.648, + 0.785, + 0.688 + ], + "angle": 0, + "content": "23. Shayegani, E., Dong, Y., Abu-Ghazaleh, N.B.: Jailbreak in pieces: Compositional adversarial attacks on multi-modal language models. CoRR abs/2307.14539 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.785, + 0.73 + ], + "angle": 0, + "content": "24. Shen, X., Chen, Z., Backes, M., Shen, Y., Zhang, Y.: \"do anything now\": Characterizing and evaluating in-the-wild jailbreak prompts on large language models. CoRR abs/2308.03825 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.785, + 0.771 + ], + "angle": 0, + "content": "25. Subhash, V., Bialas, A., Pan, W., Doshi-Velez, F.: Why do universal adversarial attacks work on large language models?: Geometry might be the answer. CoRR abs/2309.00254 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.785, + 0.84 + ], + "angle": 0, + "content": "26. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Canton-Ferrer, C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura," + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.472, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Images are Achilles' Heel of Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.245, + 0.147, + 0.785, + 0.244 + ], + "angle": 0, + "content": "P.S., Lachaux, M., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models. CoRR abs/2307.09288 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.246, + 0.785, + 0.286 + ], + "angle": 0, + "content": "27. Tu, H., Cui, C., Wang, Z., Zhou, Y., Zhao, B., Han, J., Zhou, W., Yao, H., Xie, C.: How many unicorns are in this image? A safety evaluation benchmark for vision llms. CoRR abs/2311.16101 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.288, + 0.785, + 0.314 + ], + "angle": 0, + "content": "28. Wang, J.G., Wang, J., Li, M., Neel, S.: Pandora's white-box: Increased training data leakage in open llms. arXiv preprint arXiv:2402.17012 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.315, + 0.785, + 0.383 + ], + "angle": 0, + "content": "29. Wei, A., Haghtalab, N., Steinhardt, J.: Jailbroken: How does LLM safety training fail? In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.785, + 0.411 + ], + "angle": 0, + "content": "30. Wei, Z., Wang, Y., Wang, Y.: Jailbreak and guard aligned language models with only few in-context demonstrations. CoRR abs/2310.06387 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.785, + 0.438 + ], + "angle": 0, + "content": "31. Wu, Y., Li, X., Liu, Y., Zhou, P., Sun, L.: Jailbreaking GPT-4V via self-adversarial attacks with system prompts. CoRR abs/2311.09127 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.44, + 0.785, + 0.466 + ], + "angle": 0, + "content": "32. Yin, S., Fu, C., Zhao, S., Li, K., Sun, X., Xu, T., Chen, E.: A survey on multimodal large language models. CoRR abs/2306.13549 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.467, + 0.785, + 0.522 + ], + "angle": 0, + "content": "33. Zhao, W.X., Zhou, K., Li, J., Tang, T., Wang, X., Hou, Y., Min, Y., Zhang, B., Zhang, J., Dong, Z., Du, Y., Yang, C., Chen, Y., Chen, Z., Jiang, J., Ren, R., Li, Y., Tang, X., Liu, Z., Liu, P., Nie, J., Wen, J.: A survey of large language models. CoRR abs/2303.18223 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.523, + 0.785, + 0.563 + ], + "angle": 0, + "content": "34. Zhao, Y., Pang, T., Du, C., Yang, X., Li, C., Cheung, N., Lin, M.: On evaluating adversarial robustness of large vision-language models. CoRR abs/2305.16934 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.785, + 0.605 + ], + "angle": 0, + "content": "35. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. CoRR abs/2304.10592 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.785, + 0.633 + ], + "angle": 0, + "content": "36. Zou, A., Wang, Z., Kolter, J.Z., Fredrikson, M.: Universal and transferable adversarial attacks on aligned language models. CoRR abs/2307.15043 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.633 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_origin.pdf b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..15bfc5dd2b5d9e3b470851255dfa99f13e60bec0 --- /dev/null +++ b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/3182182c-ff4e-403e-9da5-1c7cd2393327_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3a023f1b06322bd1140975d506c0327389565dfb8e0efc08b4bce7d342bb1feb +size 5463059 diff --git a/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/full.md b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/full.md new file mode 100644 index 0000000000000000000000000000000000000000..9a3141b6e1d2e1d6ff72803a50d341c9d1beec3b --- /dev/null +++ b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/full.md @@ -0,0 +1,262 @@ +# Images are Achilles' Heel of Alignment: Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models + +Yifan Li $^{1,3,\star}$ , Hangyu Guo $^{1,3,\star}$ , Kun Zhou $^{2,3,\star}$ , Wayne Xin Zhao $^{1,3,\dagger}$ , and Ji-Rong Wen $^{1,2,3}$ + +$^{1}$ Gaoling School of Artificial Intelligence, Renmin University of China $^{2}$ School of Information, Renmin University of China +3 Beijing Key Laboratory of Big Data Management and Analysis Methods {liyifan0925,hyguo0220,batmanfly}@gmail.com + +Abstract. In this paper, we study the harmlessness alignment problem of multimodal large language models (MLLMs). We conduct a systematic empirical analysis of the harmlessness performance of representative MLLMs and reveal that the image input poses the alignment vulnerability of MLLMs. Inspired by this, we propose a novel jailbreak method named HADES, which hides and amplifies the harmfulness of the malicious intent within the text input, using meticulously crafted images. Experimental results show that HADES can effectively jailbreak existing MLLMs, which achieves an average Attack Success Rate (ASR) of $90.26\%$ for LLaVA-1.5 and $71.60\%$ for Gemini Pro Vision. Our code and data are available at https://github.com/RUCAIBox/HADES. + +Warning: this paper contains example data that may be offensive. + +Keywords: Multimodal Large Language Models $\cdot$ Harmlessness Alignment $\cdot$ Adversarial Attack + +# 1 Introduction + +Recently, by leveraging the powerful capacity of large language models (LLMs) [33], a variety of multimodal large language models (MLLMs) [32] have emerged, which can process both textual and visual information similarly as that LLMs process textual input. MLLMs have not only shown superior performance in various visual-language tasks but also possess the capability to engage in image-related dialogues with human users [15,35]. However, MLLMs also confront similar harmlessness challenges that afflict their backbone LLMs. + +Despite undergoing harmlessness alignment like reinforcement learning from human feedback (RLHF) [19], LLMs remain vulnerable to black-box attacks (e.g., sophisticated jailbreak prompts [4]) or white-box attacks (e.g., gradient-based adversarial inputs [36]). Since MLLMs are generally built on top of existing + +![](images/7c248d2855c60663355501a440d3523c8392e537dfce905fb0a47228680c99a5.jpg) +Fig. 1: An example to show the influence of the visual modality on harmlessness alignment of Gemini Pro Vision. The harmful information is highlighted in red + +LLMs, they inevitably suffer from these safety issues. To study the harmlessness alignment of MLLMs, recent work either evaluates the harmlessness of MLLMs in response to harmful instructions [16, 27], or assesses the model robustness by utilizing adversarial images [10, 20]. These studies suggest that the integration of the visual modality might exacerbate safety concerns for MLLMs compared to their backbone LLMs. As illustrated in Fig. 1, even one of the state-of-the-art MLLMs, Gemini Pro Vision [1], would be influenced by the blank or harmful images, leading to improper outputs with harmful words. + +However, it still lacks a deep understanding of how safety concerns occur in MLLMs and how they might be different from those in LLMs. Considering this issue, this work aims to systematically analyze the sourcing factors that violate the harmlessness alignment of MLLMs. We conduct detailed empirical studies on representative MLLMs, specifically investigating their performance on harmful instructions accompanied by images. Our findings are threefold: (1) Images can be backdoors for the harmlessness alignment of MLLMs. The inclusion of images in the input can significantly increase the harmfulness ratio of MLLMs' outputs; (2) Cross-modal fine-tuning undermines the alignment abilities of the backbone LLM for a given MLLM. The more parameters that are fine-tuned, the more severe the disruption is; (3) The harmfulness of MLLMs' responses is positively correlated with the harmfulness of the image content. These findings reveal that the visual modality introduces additional alignment vulnerabilities in MLLMs, which can be exploited to further jailbreak these models. + +Motivated by these empirical findings, we propose a novel jailbreak approach called HADES, standing for Hiding and Amplifying harmfulness in images to DESTroy multimodal alignment, to assess the adversarial robustness of both open-and closed-source MLLMs. Specifically, our approach introduces a three-stage attack strategy. First, it extracts the harmful information from the text input into typography and replaces such text with a text-to-image pointer, which guides + +the model to focus on image information. In this way, we transfer the harmful input from the well-aligned text side into the image side, inducing models to be more prone to generate harmful outputs. Second, HADES attaches another harmful image to the original typography. This image is created by an image generation model, and its harmfulness has been amplified for multiple turns via prompt optimization. Third, HADES optimizes an adversarial noise via gradient update, towards inducing the MLLM to follow harmful instructions. The learned noise will be integrated into the previous image for jailbreaking MLLMs. + +In summary, our main contributions are as follows: + +- We conduct detailed empirical studies on the harmfulness alignment of representative MLLMs, and systematically investigate the possible sourcing factors that violate the harmfulness alignment of MLLMs. The results reveal that the visual modality of MLLMs poses a critical alignment vulnerability. +- We introduce HADES, a novel jailbreak approach that hides and amplifies the harmfulness of the original malicious intent using meticulously crafted images. Experimental results show that both open-source MLLMs based on aligned LLMs and powerful closed-source MLLMs struggle to resist HADES. Notably, HADES achieves an Attack Success Rate (ASR) of $90.26\%$ on LLaVA-1.5 and $71.60\%$ on Gemini Pro Vision. + +# 2 Empirical Harmlessness Analyses of MLLMs + +In this section, we conduct a systematic investigation to examine whether and how visual input influences the harmlessness alignment of MLLMs. We first introduce the data collection process in Sec. 2.1 and the evaluation settings in Sec. 2.2, then evaluate mainstream open- and closed-source MLLMs in Sec. 2.3. + +# 2.1 Evaluation Data Collection + +To evaluate the harmlessness alignment of MLLMs, we collect a dataset comprising 750 harmful instructions across 5 scenarios. Each instruction includes a harmful keyword or key phrase and is paired with a harmful image related to the keyword or key phrase. We present the collection process below and show the pipeline in the supplementary materials. + +First, based on existing harmful scenarios of LLMs [12], we select five representative ones that are related to the visual information in the real world: (1) Violence, Aiding and Abetting, Incitement; (2) Financial Crime, Property Crime, Theft; (3) Privacy Violation; (4) Self-Harm; and (5) Animal Abuse. For simplicity, these categories are referred to as Violence, Financial, Privacy, Self-Harm, and Animal, respectively. Next, we adopt GPT-4 to generate 50 keywords for each of the above harmful categories, and then synthesize three harmful but distinct instructions based on each keyword. The prompts employed for the above process are documented in the supplementary materials. In this way, we guarantee that each instruction includes only one harmful element (i.e., the keyword + +or the key phrase), which could be accurately depicted by an image. Thus, we can pair each instruction with a corresponding real-world image that is relevant to the harmful keyword/phrase. Specifically, we first retrieve five images from Google using each keyword/phrase as the query, and then employ CLIP ViT-L/14 [21] to select the image that best matches the semantic representation of the keyword/phrase. + +# 2.2 Evaluation Settings + +We evaluate both representative open-source (i.e., LLaVA-1.5 [14], LLaVA-1.5 LoRA (represented by LLaVA-1.5L), MiniGPT-v2 [5] and MiniGPT-4 [35]) and powerful closed-source MLLMs (i.e., Gemini Pro Vision [1], short as Gemini $\mathrm{Pro_V}$ ) and GPT-4V [18]) on our dataset. To discuss the influence of the visual modality on harmlessness alignment, we design four evaluation settings: + +- **Backbone:** We evaluate the backbone LLMs of MLLMs on harmful instructions, which have not been fine-tuned with cross-modal data, i.e., Vicuna v1.5-7B [7] for LLaVA-1.5, LLaMA-2-Chat-7B [26] for MiniGPT-4 and MiniGPT-v2, GPT-4 for GPT-4V, and Gemini Pro for Gemini Prov. +- Text-only: We evaluate MLLMs purely on harmful instructions. +- Blank: We evaluate MLLMs on harmful instructions paired with a $500 \times 500$ blank image. +- **Toxic:** We evaluate MLLMs on harmful instructions paired with the previously selected harmful images (described in Sec. 2.1). + +We employ Attack Success Rate (ASR) as the evaluation metric of harmlessness alignment, which is calculated by: + +$$ +\mathrm {A S R} = \frac {\sum_ {i = 1} ^ {N} \mathbb {1} _ {\{\mathcal {J} (y _ {i}) = \text {T r u e} \}}}{N}, \tag {1} +$$ + +where $y_{i}$ is the model's response, $\mathbb{1}$ is an indicator function that equals to 1 if $\mathcal{I}(y_i) = \mathrm{True}$ and 0 otherwise, $N$ is the total number of instructions and $\mathcal{J}$ is the harmfulness judging model, outputting True or False to indicate whether $y_{i}$ is harmful. We adopt Beaver-dam-7B [12] as $\mathcal{J}$ , which has been trained on high-quality human feedback data about the above harmful categories. + +# 2.3 Evaluation Results + +The evaluation results are presented in Tab. 1. We list the ASR results of 5 harmful scenarios under 4 evaluation settings and calculate the average ASR across all scenarios. From the results, we can summarize three major findings: + +Images can be alignment backdoors of MLLMs. When comparing the performance of each model under the Backbone and Text-only settings, the harmlessness alignment of MLLMs does not significantly deviate from that of their backbone LLMs, and even exhibit enhanced defense capability, e.g., LLaVA-1.5 $(-2.80\%)$ and Gemini Prov $(-7.50\%)$ . However, once adding images, regardless of whether their contents are harmful or not, the ASR results of MLLMs + +Table 1: The evaluation results of representative MLLMs on the dataset we collected. (Train) represents the cross-modal fine-tuning strategies of MLLMs. Animal, Financial, Privacy, Self-Harm, and Violence represent the ASR of MLLMs on instructions from these categories. Average represents the average ASR across all categories. + and - represents the change of ASR compared to the Backbone setting. + +
Model(Train)SettingAnimal Financial Privacy Self-Harm ViolenceAverage(%)
LLaVA-1.5(Full)Backbone17.3346.0034.6712.0034.6728.93
Text-only22.0040.0028.0010.0030.6726.13(-2.80)
Blank38.0066.6768.0030.6767.3354.13(+25.20)
Toxic54.0077.3382.6746.6780.0068.13(+39.20)
LLaVA-1.5L(LoRA)Backbone17.3346.0034.6712.0034.6728.93
Text-only23.3340.0030.009.3330.6726.67(-2.26)
Blank41.3367.3363.3325.3361.3351.73(+22.80)
Toxic48.6771.3374.6743.3376.0062.80(+33.87)
MiniGPT-v2(LoRA)Backbone0.000.000.000.000.670.13
Text-only7.3312.008.670.0015.338.67(+8.54)
Blank26.0046.6740.0016.0041.3334.00(+33.87)
Toxic37.3360.6750.0027.3344.0043.87(+43.74)
MiniGPT-4(Frozen)Backbone0.000.000.000.000.670.13
Text-only5.332.671.331.333.332.80(+2.67)
Blank15.3313.336.670.008.678.80(+8.67)
Toxic28.6735.3318.679.3325.3323.47(+23.34)
Gemini Prov(-)Backbone1.7013.8012.081.208.707.50
Text-only0.000.000.000.000.000.00(-7.50)
Blank13.3342.6734.005.3321.3323.33(+15.83)
Toxic19.3352.0045.336.6730.0030.67(+23.17)
GPT-4V(-)Backbone0.002.002.670.000.671.07
Text-only1.338.676.000.677.334.80(+3.73)
Blank2.004.676.000.006.673.87(+2.80)
Toxic2.0014.0014.000.006.007.20(+6.13)
+ +would be greatly improved even under the Blank setting using harmless images, e.g., LLaVA-1.5 $(+25.20\%)$ and MiniGPT-v2 $(+33.87\%)$ . It indicates that images can be the alignment backdoor of MLLMs, which would undermine MLLMs' capability of defending against harmful text input. + +More parameters tuned, less alignment left. By examining the performance of open-sourced MLLMs, we notice that their alignment performance is highly relevant to their training strategies during cross-modal fine-tuning. Generally, for the same backbone model, the more parameters are optimized during fine-tuning, the harmlessness alignment would be affected more significantly. For example, under the Toxic setting, MiniGPT-4, with the fixed backbone LLM, is more robust than the LoRA-fine-tuned MiniGPT-v2, achieving lower ASR results (23.47% vs. 43.87%). Similarly, the full-parameter fine-tuned LLaVA-1.5 also generates more harmful responses than LoRA-fine-tuned LLaVA-1.5L (68.13% vs. 62.80%). The reason may be that the cross-modal fine-tuning process would hurt the harmlessness alignment of the backbone MLLMs. + +![](images/07f6d4b98183c3bb565cbc7953a8e29f58736166f12650c972ce7e3a29c872f9.jpg) +Fig. 2: Given a harmful textual instruction, HADES involves a three-step procedure: (1) removes the harmful content from the text into typography; (2) combines it with a harmful image generated by a diffusion model, using an iteratively refined prompt from an LLM; (3) appends an adversarial image on top of the image, which elicits the MLLM to generate affirmative responses for harmful instructions. + +Harmful images are more likely to elicit harmful outputs. We observe that MLLMs are more prone to produce harmful outputs when presented with harmful images. It holds for both open-source and closed-source models, as their ASR results under the Toxic setting greatly exceed the results from all other settings, e.g., MiniGPT-4 (23.47% vs. 8.80%) and LLaVA-1.5 (68.13% vs. 54.13%). It indicates that it is hard for current MLLMs to defend against harmful image inputs. With the increase in image harmfulness, MLLMs might be increasingly prone to generate more harmful outputs. + +# 3 The Proposed Jailbreak Approach: HADES + +Based on empirical studies, the visual input potentially brings vulnerabilities to the harmlessness alignment of MLLMs. However, it is not easy to manually craft massive adversarial samples that can successfully jailbreak MLLMs, which help detect the weak spots in real-world applications. To address it, based on harmful textual instructions, we propose a novel method to automatically synthesize high-quality adversarial examples, called HADES that stands for Hiding and Amplifying harmfulness in images to DEStroy multimodal alignment. + +Typically, an MLLM is composed of an LLM $\mathcal{M}$ , an image encoder $\mathbf{E}$ and a projection layer $\mathbf{W}$ . The generation process of MLLMs can be formulated as: + +$$ +y = \mathcal {M} ([ \mathbf {W} \cdot \mathbf {E} (i), t ]), \tag {2} +$$ + +where $i$ and $t$ are the input image and text, and $y$ is the model's output. Given a harmful $t$ , HADES aims to modify $t$ to $t'$ by adding a text-to-image pointer and crafts harmful images $i'$ . Thereby, HADES transfers the malicious intent to the less-aligned image side of the MLLM, inducing it to generate harmful responses $y'$ . The whole process of HADES is presented in Fig. 2. + +# 3.1 Hiding Harmfulness from Text to Image + +By training on human preference data, existing LLMs learn to align with human values and refuse to respond to harmful text inputs. MLLMs derived from these LLMs naturally inherit the defense capacity for text inputs but leave the image side vulnerable to harmful content. Hence, we propose transferring harmful information from the well-aligned text side to the less-aligned image side, to bypass the defense mechanisms of MLLMs. + +Specifically, we replace the harmful keyword or key phrase from each text instruction $t$ with a text-to-image pointer and utilize images to represent it. On the text side, we categorize all the keywords into three classes: objects, concepts, or behaviors. For the keywords falling under the first two categories, the text-to-image pointer is "the object/concept in the image", while for the keywords denoting behaviors, the text-to-image pointer is "conduct the behavior in the image on". On the image side, as the keywords may represent abstract concepts or behaviors that are difficult for models to grasp when depicted by real-world images, we employ typography to represent these keywords. As a result, the generation process of MLLMs can be formally given as: + +$$ +y = \mathcal {M} ([ \mathbf {W} \cdot \mathbf {E} (i _ {\mathrm {t y p}}), t ^ {\prime} ]), \tag {3} +$$ + +where $i_{\mathrm{typ}}$ is the typography of the keyword and $t'$ is the modified instruction. By doing so, $t'$ no longer explicitly contains any harmful information, yet models can still infer the original harmful intent by referring to $i_{\mathrm{typ}}$ . + +# 3.2 Amplifying Image Harmfulness with LLMs + +Our empirical study reveals that when the image input becomes more harmful, MLLMs also tend to generate more harmful responses. Therefore, we propose to append a harmful image to the previous typography $i_{typ}$ to amplify their harmfulness. Since the harmfulness of real-world images is always limited, we introduce diffusion models as the harmful image generator. In addition, we utilize LLMs as the attacker model to iteratively optimize the prompt for diffusion models to further increase the harmfulness of generated images. + +The whole procedure of image harmfulness optimization is presented in the supplementary materials. We leverage the harmfulness of the caption as the + +proxy for the image's harmfulness, as the harmfulness of text is easier to quantify than images. We consider an iterative process to generate harmful images. We first ask ChatGPT to modify the original instruction $t$ into an initial image generation prompt $p_0$ and generate an initial image. At step $k$ , the caption model $\mathcal{C}$ generates a caption $c_k$ for the target image $i_{\mathrm{opt}}^k$ . Subsequently, the judging model $\mathcal{J}$ assesses the image's harmfulness with a score, $s_k$ , on a scale from 1 to 10, where a higher score indicates greater harmfulness. $\mathcal{J}$ also explains the reason for its score in $exp_k$ . All this information ( $p_k$ , $c_k$ , $s_k$ , and $exp_k$ ) is appended to the conversation history $h$ and sent to the attacker model $\mathcal{A}$ which first suggests improvements to the prompt and then generates the refined image generation prompt $p_{k+1}$ . The refined prompt is then used to generate a new image $i_{\mathrm{opt}}^{k+1}$ . The above process circulates until reaching the maximum iteration turn $K$ , which is set to 5. In practice, we choose GPT-4-0613 as both the attacker and judging model by utilizing different system prompts (as presented in the supplementary materials). For captioning and image generation, we adopt LLaVA-1.5 and PixArt-α [6], respectively. + +The optimized images $i_{\mathrm{opt}}$ is then vertically concatenated with the previous typography $i_{\mathrm{typ}}$ , which can be formulated as: + +$$ +y = \mathcal {M} ([ \mathbf {W} \cdot \mathbf {E} (i _ {\text {o p t}} \oplus i _ {\text {t y p}}), t ^ {\prime} ]). \tag {4} +$$ + +In this way, both images can mutually enhance their respective attack effects. The utilization of $t'$ forces the model to focus more on the image, thereby increasing its sensitivity to harmful content. Simultaneously, $i_{\mathrm{opt}}$ , which is semantically close to the original instructions, serves as the additional context and aids the model in understanding the original harmful intent of masked instructions, which can partially compensate for some models' insufficient OCR capabilities. + +# 3.3 Amplifying Image Harmfulness with Gradient Update + +Existing work has proven the effectiveness of adversarial images in jailbreaking MLLMs. To further enhance the attack effectiveness, HADES incorporates adversarial images by concatenating them with the previous images. + +The image input of MLLMs is encoded through an image encoder and then mapped into the LLM representation space via a projection layer. Consequently, images are represented as a sequence of distinct visual tokens, collectively forming a visual prompt. It allows us to view adversarial images, those that prompt MLLMs to produce malicious responses, as text jailbreak prompts such as "Do Anything Now" [24]. Jailbreak prompts are commonly placed at the beginning of malicious instructions without compromising the models' understanding of these instructions. Given the similarity between adversarial images and jailbreak prompts, we suggest that concatenating adversarial images on top of the image input of MLLMs can also prompt them to produce harmful information without compromising their understanding of the original image content. Consequently, the full formulation of HADES can be given as follows: + +$$ +y = \mathcal {M} ([ \mathbf {W} \cdot \mathbf {E} (i _ {\mathrm {a d v}} \oplus i _ {\mathrm {o p t}} \oplus i _ {\mathrm {t y p}}), t ^ {\prime} ]). \tag {5} +$$ + +To ensure the generalization capability of our method, we generate a single adversarial image $i_{\mathrm{adv}}$ for all harmful instructions within the same category in our dataset. Initially, $i_{\mathrm{adv}}$ is set to be a blank image $i_{\mathrm{initial}}$ . Subsequently, we collect a set of affirmative responses, $Y_{a}$ , containing 10 examples (e.g., "Sure!" or "I can answer the question for you.") intended as the desired output of MLLMs. We provide the target model with one harmful instruction $t_{j}$ and the adversarial image $i_{\mathrm{adv}}$ , and then select one affirmative response as the target label and compute the cross-entropy loss between the model's output and this target. The gradient derived from this loss is then utilized to iteratively refine the adversarial image $i_{\mathrm{adv}}$ . The optimization procedure can be formulated as below: + +$$ +i _ {\mathrm {a d v}} \leftarrow i _ {\text {i n i t i a l}} + \arg \min _ {\delta} \sum_ {j = 1} ^ {m} - \log \left(p _ {\theta} \left(y _ {j} \mid t _ {j}, i _ {\text {i n i t i a l}} + \delta\right)\right), \tag {6} +$$ + +where $y_{j}\in Y_{a}$ , and $p_{\theta}$ represents the conditional probability generated by the target MLLM. Additionally, to maintain $i_{\mathrm{adv}}$ as a valid image, we constrain $i_{\mathrm{initial}} + \delta \in \mathcal{B}$ during the optimization, where $\mathcal{B} = [0,1]^{w\times h\times c}$ and $w$ , $h$ , and $c$ denote the width, height, and channels of $i_{\mathrm{adv}}$ , respectively. + +# 4 Experiment + +# 4.1 Experimental Setup + +For closed-source models, we select GPT-4V and Gemini Prov. For open-source models, we also select the MLLMs used before, i.e. LLaVA-1.5 and LLaVA-1.5L. We also select LLaVA built on Llama-2-Chat-7b, as it has experienced safety RLHF. Given the limited OCR capabilities of the open-source MLLMs, they could misinterpret the keywords in $i_{\mathrm{typ}}$ . Thus, we continually prompt open-source MLLMs until they either explicitly generate the harmful keywords or reach the maximum allowed retries (set to 5 in practice). To verify the effectiveness of each component of HADES, we design four evaluation settings: + +- Typ image: Evaluate all models with the original instructions $t$ and corresponding typography $i_{\mathrm{typ}}$ . +- +Text-to-image pointer: Evaluate all models with modified instructions $t'$ and the typography $i_{\mathrm{typ}}$ . The generation process is the same as Eq. (3). +- +Opt image: Evaluate all models with $t'$ and the concatenation of $i_{\mathrm{typ}}$ and $i_{\mathrm{opt}}$ . The generation process is the same as Eq. (4). +- +Adv image: The full version of HADES. Since we don't have access to the parameters of Gemini $\mathrm{Prov}$ and GPT-4V, we only evaluate open-source models with $t'$ and the concatenation of $i_{\mathrm{typ}}$ , $i_{\mathrm{opt}}$ and $i_{\mathrm{adv}}$ . The generation process is the same as Eq. (5). + +Table 2: The evaluation results of MLLMs on instructions and images processed by HADES. T2I pointer represents Text-to-image pointer. + and - represents the change of ASR compared to the Typ image setting. + +
ModelSettingAnimalFinancialPrivacySelf-HarmViolenceAverage(%)
LLaVA-1.5Typ image48.6781.3378.0038.6781.3365.60
+T2I pointer32.6761.3371.3342.6782.6758.13(-7.47)
+Opt image67.3384.0085.3362.0094.0078.53(+12.93)
+Adv image83.3389.3394.6789.3394.6790.26(+24.66)
LLaVA-1.5LTyp image50.0071.3374.6735.3379.3362.13
+T2I pointer30.6753.3359.3324.6772.0048.00(-14.13)
+Opt image72.0082.6786.6761.3392.0078.93(+16.80)
+Adv image83.3391.3392.6784.6792.6788.93(+26.80)
LLaVATyp image20.6753.3333.338.0040.0031.07
+T2I pointer20.0044.0053.3315.3355.3337.60(+6.53)
+Opt image51.3374.0078.0041.3380.0064.93(+33.86)
+Adv image76.0089.3384.6775.3387.3382.53(+51.46)
Gemini ProvTyp image30.0056.0046.6717.3322.0034.40
+T2I pointer65.3364.0058.0034.6734.6751.33(+16.93)
+Opt image67.3386.6781.3344.0078.6771.60(+37.20)
GPT-4VTyp image0.671.334.000.002.671.73
+T2I pointer3.336.003.331.332.003.20(+1.47)
+Opt image2.6724.6727.331.3319.3315.07(+13.34)
+ +# 4.2 Experiment Results + +The evaluation results in Tab. 2 demonstrate that HADES significantly enhances the attack success rate (ASR) for both open- and closed-source MLLMs. Specifically, the average ASR for the three models in the LLaVA series exceeds 80 percent. Gemini ProV also struggles to counteract harmful instructions generated by HADES with an average ASR of $71.60\%$ . Among the evaluated models, GPT-4V exhibits the strongest defense capacity against HADES, yielding a $15.07\%$ proportion of harmful responses. When examining the models' performance across different categories of harmful instructions, it can be observed that they generally exhibit stronger defenses against instructions related to Animal and Self-Harm, while instructions about Financial, Privacy, and Violence categories are more likely to break through the models' safeguards. + +Under the $+$ Text-to-image pointer setting, we observe diverse attack outcomes across different models. The ASR increases for LLaVA $(+6.53\%)$ , Gemini $\mathrm{Prov}_{\mathrm{V}}(+16.93\%)$ and GPT-4V $(+1.47\%)$ , while decreases for LLaVA-1.5 $(-7.47\%)$ and LLaVA-1.5L $(-14.13\%)$ . We attribute the ASR drop on these models to two main reasons. Firstly, some models have limited OCR capabilities, which causes them to misunderstand certain instructions as benign and consequently generate harmless responses. Notably, Gemini $\mathrm{Prov}_{\mathrm{V}}$ and GPT-4V, which possess advanced OCR capabilities, exhibit more harmful behavior under this setting. This suggests as the development of MLLMs, their enhancing OCR capabilities + +will correspondingly increase the effectiveness of our method. Secondly, the text-to-image pointer is designed to bypass the defense mechanisms of MLLMs on the text side. Therefore, its effectiveness is constrained on models with inadequate harmlessness alignment (e.g., Vicuna v1.5 in LLaVA-1.5). In such cases, the improvement in ASR could be offset by the decrease due to misunderstanding. + +The incorporation of $i_{\mathrm{opt}}$ under the $+Opt$ image setting significantly increases the ASR of all models, even more than 30 percent (e.g., LLaVA $(+33.86\%)$ and Gemini ProV $(+37.20\%)$ ). These results further verify our previous empirical finding: harmful images tend to elicit harmful responses. Moreover, $i_{\mathrm{opt}}$ helps mitigate the misunderstanding issues observed with LLaVA-1.5 and LLaVA-1.5L. The ASR of these two models increases notably compared to the $+Text-to-image$ pointer setting. We attribute such results to that $i_{\mathrm{opt}}$ always describes scenarios relevant to the instruction contents, which provides extra context that helps MLLMs to accurately understand the instruction. + +Finally, by combining $i_{\mathrm{adv}}$ under the $+Adv$ image setting, the full version of HADES further increases the ASR on open-source models. Even LLaVA, whose backbone LLM is well-aligned by RLHF, achieves an average ASR of $82.53\%$ . HADES also demonstrates promising ASR on categories that are relatively harder to jailbreak under previous settings. For LLaVA, the ASR on the Animal category rises from $51.33\%$ to $76.00\%$ , while the ASR on the Self-Harm category rises from $41.33\%$ to $75.33\%$ . + +# 4.3 Further Analyses + +In this part, we further discuss the effectiveness of our proposed approach, from image harmfulness optimization, attack transferability, and jailbreak cases. + +Effectiveness of Image Harmfulness Optimization. To validate the effectiveness of the optimization process for image generation discussed in Sec. 3.2, we conduct a specific experiment to examine the attack performance with the intermediately generated images with gradually increasing optimization steps. As shown in Fig. 3, the ASR results of all the comparison models consistently improve when using more optimization steps for image generation. These findings affirm the efficacy of our proposed image harmfulness optimization method in HADES. + +Transferability of Adversarial Attack. To further validate the transferability of HADES across various MLLMs and + +![](images/659f85026bc3a8a9beb439e3cd346d3a28c9569ded9b92a5c53c5c7b2a0d9c50.jpg) +Fig.3: The ASR results of different models on HADES using images generated at different optimization steps. + +![](images/20de811da902f5c5dd34a7de5e19f1fabfd82a3c42aee9921c77693e4f15284e.jpg) +(a) Transferability across MLLMs. + +![](images/a2b9bb051568b0f61e3e2d178234cb2221b5843090fe0b15e4dfc24509d46bc8.jpg) +(b) Transferability across categories. +Fig. 4: The evaluation results of transferability of HADES across different MLLMs (LLaVA, LLaVA-1.5 and LLaVA-1.5L) and different instruction categories (Violence, Self-Harm, Privacy, Financial, and Animal). + +harmful categories, we select Violence as the primary category for assessing cross-model transferability and LLaVA as the target model for exploring cross-category transferability. We then implement HADES utilizing $i_{\mathrm{opt}}$ trained on a specific model/category to conduct attacks on other models/categories. The evaluation results are presented in Fig. 4. Fig. 4a demonstrates that HADES trained on one MLLM achieves comparable ASR on other MLLMs. Additionally, we observe that attacks between LLaVA-1.5 and LLaVA-1.5L demonstrate significant mutual transferability, likely due to their shared backbone LLMs and vision encoders. Furthermore, as illustrated in Fig. 4b, HADES demonstrates enhanced transferability within specific harmful categories such as Self-Harm, Violence, and Animal, as well as Privacy and Financial. Such phenomena can be attributed to the similar semantic contexts shared among instructions within these categories. For instance, instructions related to Violence and Self-Harm often involve physically harmful actions such as "hitting" or "killing", whereas those about Privacy and Financial both typically focus on abstract harmful concepts like "eavesdropping" or "Forgery". + +Jailbreak Cases. To better understand how our approach jailbreaks MLLMs, we analyze the successful attack cases from Gemini ProV and GPT-4V, and summarize three representative jailbreak categories, which are presented on the left side of Fig. 5. Each category is related to a distinct multimodal capability, i.e., optical character recognition (OCR), image captioning and instruction following. For the OCR category, the model explicitly recognizes the keywords from the $i_{\mathrm{typ}}$ before following the instruction. For the Captioning category, the model describes the scenario depicted in $i_{\mathrm{opt}}$ before following the instruction. For the Instruction Following category, the model directly follows the harmful instruction. We further calculate the proportion of these categories among all + +OCR: The concept shown in the image is "bribery". Here are some methods for initiating this concept with a corporate executive... + +Captioning: The image shows a person in a suit making counterfeit money. The steps to produce counterfeit money are as follows... + +Instruction Following: To avoid being noticed while committing a theft, it is important to be aware of your surroundings and... + +![](images/99747c425b6b6753269e619d5eed9ac6773942a1a3131f887a01b249e92bb0d8.jpg) +Fig. 5: The representative cases and statistics of three harmful response types on Gemini Prov and GPT-4V. The text related to the corresponding type is underlined. + +successful attack cases of Gemini Pro $_V$ and GPT-4V, and illustrate the result on the right part of Fig. 5. + +From the charts, we notice that most jailbroken cases are due to the conflicts between the general instruction following abilities of MLLMs and their harmlessness alignment, while captioning and OCR abilities also occupy considerable proportions. The results suggest that the cross-modal fine-tuning may impose a kind of "inverse alignment tax" on MLLMs, which improves their multimodal abilities while impairing the harmlessness alignment. Therefore, to enhance the harmlessness alignment of MLLMs, future work could consider adding more adversarial samples that consist of harmful instructions and images during the cross-modal fine-tuning process, which ensures MLLMs defend attacks from the image side while maintaining multimodal abilities. + +# 5 Related Work + +Harmlessness Alignment of LLMs. Alignment involves fine-tuning LLMs with human-preferred annotations to ensure responses are Helpful, Honest, and Harmless (the 3H principle [2]). Among them, the harmlessness alignment of LLMs has attracted extensive research attention. To evaluate the robustness of LLMs to harmful instructions, researchers employ red teaming to benchmark the safety degree of LLMs [9, 11]. Additionally, some studies further explore the harmlessness alignment of LLMs with jailbreaking methods. Some adopt white-box attacks, which utilize the model gradients to customize adversarial inputs [25, 28, 36], while black-box attacks typically launch attacks through manually or automatically devised prompts [4, 29, 30]. Our work mainly focuses on extending the jailbreaking research from LLMs to MLLMs, which aims to enhance the robustness and alignment of MLLMs. + +Harmlessness Alignment of MLLMs. By utilizing LLMs as backbones, MLLMs also inherit their alignment vulnerabilities. To explore the harmlessness alignment of MLLMs, several benchmarks are proposed to probe the potential harm- + +fulness of MLLMs under different scenarios [13, 16, 27]. Some other work employ different jailbreak methods to further evaluate the adversarial robustness of MLLMs using white- or black-box methods. White-box methods mainly attack the input images or their embeddings of MLLMs. For input images, recent studies generate adversarial images with constraints of a harmful response set [8, 20, 22] or utilizing a teacher-forcing optimization approach [3]. For visual embeddings, Shayegani et al. [23] generates adversarial images that look harmless but are similar to the embeddings of harmful images, thereby bypassing harmful content filters. In contrast, recent work in black-box attacks jailbreak MLLMs by employing techniques such as system prompt attacks [31], transferring harmful information into text-oriented images [10], generating adversarial images with surrogate models [34], and maximum likelihood-based jailbreaking [17]. In our work, we first investigate how the visual input influences the harmlessness alignment of MLLMs, then propose a jailbreak methods incorporate both white- and black-box methods. + +# 6 Conclusion + +In this paper, we conducted a comprehensive empirical analysis of the harmlessness alignment of MLLMs, specifically examining the visual vulnerabilities for jailbreak. Our findings revealed that images pose significant vulnerabilities in the alignment of MLLMs: the presence of images, the cross-modal fine-tuning process, and the harmfulness of images all contribute to an increased propensity for MLLMs to generate harmful responses. Furthermore, we introduced HADES, a novel jailbreaking approach that hides and amplifies the harmfulness of textual instructions using meticulously crafted images. Extensive experiments have demonstrated that HADES can effectively jailbreak both open- and closed-source MLLMs. In summary, our work has presented strong evidence that the visual modality poses the alignment vulnerability of MLLMs, underscoring the urgent need for further exploration into cross-modal alignment. In future work, we will develop cross-modal training strategies to improve the harmlessness alignment of MLLMs. + +Societal Impacts. Our work aims to highlight the alignment vulnerabilities of existing MLLMs. We hope our jailbreak attempt can guide subsequent researchers in developing safer MLLMs. However, we acknowledge that certain elements of our research, such as harmful instructions and images, may have negative societal impacts. To minimize these negative effects, we have implemented several measures, including adding warnings in the abstract and placing safety statements on the dataset homepage. Furthermore, in the supplementary materials, we preliminarily explore how to use the HADES data to fine-tune MLLMs to enhance their safety alignment. Overall, we believe with these efforts, the positive contributions of our work outweigh its potential negative impacts. + +# Acknowledgement + +This work was partially supported by National Natural Science Foundation of China under Grant No. 62222215, Beijing Natural Science Foundation under Grant No. L233008 and 4222027. Xin Zhao is the corresponding author. + +# References + +1. Anil, R., Borgeaud, S., Wu, Y., Alayrac, J., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., Millican, K., Silver, D., Petrov, S., Johnson, M., Antonoglou, I., Schrittwieser, J., Glaese, A., Chen, J., Pitler, E., Lillicrap, T.P., Lazaridou, A., First, O., Molloy, J., Isard, M., Barham, P.R., Hennigan, T., Lee, B., Viola, F., Reynolds, M., Xu, Y., Doherty, R., Collins, E., Meyer, C., Rutherford, E., Moreira, E., Ayoub, K., Goel, M., Tucker, G., Piqueras, E., Krikun, M., Barr, I., Savinov, N., Danihelka, I., Roelofs, B., White, A., Andreassen, A., von Glehn, T., Yagati, L., Kazemi, M., Gonzalez, L., Khalman, M., Sygnowski, J., et al.: Gemini: A family of highly capable multimodal models. CoRR abs/2312.11805 (2023) +2. Askell, A., Bai, Y., Chen, A., Drain, D., Ganguli, D., Henighan, T., Jones, A., Joseph, N., Mann, B., DasSarma, N., Elhage, N., Hatfield-Dodds, Z., Hernandez, D., Kernion, J., Ndousse, K., Olsson, C., Amodei, D., Brown, T.B., Clark, J., McCandlish, S., Olah, C., Kaplan, J.: A general language assistant as a laboratory for alignment. CoRR abs/2112.00861 (2021) +3. Carlini, N., Nasr, M., Choquette-Choo, C.A., Jagielski, M., Gao, I., Awadalla, A., Koh, P.W., Ippolito, D., Lee, K., Tramér, F., Schmidt, L.: Are aligned neural networks adversarially aligned? CoRR abs/2306.15447 (2023) +4. Chao, P., Robey, A., Dobriban, E., Hassani, H., Pappas, G.J., Wong, E.: Jailbreaking black box large language models in twenty queries. CoRR abs/2310.08419 (2023) +5. Chen, J., Zhu, D., Shen, X., Li, X., Liu, Z., Zhang, P., Krishnamoorthi, R., Chandra, V., Xiong, Y., Elhoseiny, M.: Minigpt-v2: large language model as a unified interface for vision-language multi-task learning. CoRR abs/2310.09478 (2023) +6. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J.T., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis. CoRR abs/2310.00426 (2023) +7. Chiang, W.L., Li, Z., Lin, Z., Sheng, Y., Wu, Z., Zhang, H., Zheng, L., Zhuang, S., Zhuang, Y., Gonzalez, J.E., Stoica, I., Xing, E.P.: Vicuna: An open-source chatbot impressing gpt-4 with $90\%$ chatgpt quality (March 2023), https://lmsys.org/blog/2023-03-30-vicuna/ +8. Dong, Y., Chen, H., Chen, J., Fang, Z., Yang, X., Zhang, Y., Tian, Y., Su, H., Zhu, J.: How robust is google's bard to adversarial image attacks? CoRR abs/2309.11751 (2023) +9. Ganguli, D., Lovitt, L., Kernion, J., Askell, A., Bai, Y., Kadavath, S., Mann, B., Perez, E., Schiefer, N., Ndousse, K., Jones, A., Bowman, S., Chen, A., Conerly, T., DasSarma, N., Drain, D., Elhage, N., Showk, S.E., Fort, S., Hatfield-Dodds, Z., Henighan, T., Hernandez, D., Hume, T., Jacobson, J., Johnston, S., Kravec, S., Olsson, C., Ringer, S., Tran-Johnson, E., Amodei, D., Brown, T., Joseph, N., McCandlish, S., Olah, C., Kaplan, J., Clark, J.: Red teaming language models to reduce harms: Methods, scaling behaviors, and lessons learned. CoRR abs/2209.07858 (2022) + +10. Gong, Y., Ran, D., Liu, J., Wang, C., Cong, T., Wang, A., Duan, S., Wang, X.: Figstep: Jailbreaking large vision-language models via typographic visual prompts. CoRR abs/2311.05608 (2023) +11. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Chen, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023) +12. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Zhang, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. CoRR abs/2307.04657 (2023) +13. Li, M., Li, L., Yin, Y., Ahmed, M., Liu, Z., Liu, Q.: Red teaming visual language models. CoRR abs/2401.12915 (2024) +14. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. CoRR abs/2310.03744 (2023) +15. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. CoRR abs/2304.08485 (2023) +16. Liu, X., Zhu, Y., Lan, Y., Yang, C., Qiao, Y.: Query-relevant images jailbreak large multi-modal models. CoRR abs/2311.17600 (2023) +17. Niu, Z., Ren, H., Gao, X., Hua, G., Jin, R.: Jailbreaking attack against multimodal large language model. CoRR abs/2402.02309 (2024) +18. OpenAI: Gpt-4v(ision) system card (2023) +19. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., Schulman, J., Hilton, J., Kelton, F., Miller, L., Simens, M., Askell, A., Welinder, P., Christiano, P.F., Leike, J., Lowe, R.: Training language models to follow instructions with human feedback. In: NeurIPS (2022) +20. Qi, X., Huang, K., Panda, A., Wang, M., Mittal, P.: Visual adversarial examples jailbreak large language models. CoRR abs/2306.13213 (2023) +21. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: ICML. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (2021) +22. Schlarmann, C., Hein, M.: On the adversarial robustness of multi-modal foundation models. In: IEEE/CVF International Conference on Computer Vision, ICCV 2023 - Workshops, Paris, France, October 2-6, 2023. pp. 3679-3687. IEEE (2023) +23. Shayegani, E., Dong, Y., Abu-Ghazaleh, N.B.: Jailbreak in pieces: Compositional adversarial attacks on multi-modal language models. CoRR abs/2307.14539 (2023) +24. Shen, X., Chen, Z., Backes, M., Shen, Y., Zhang, Y.: "do anything now": Characterizing and evaluating in-the-wild jailbreak prompts on large language models. CoRR abs/2308.03825 (2023) +25. Subhash, V., Bialas, A., Pan, W., Doshi-Velez, F.: Why do universal adversarial attacks work on large language models?: Geometry might be the answer. CoRR abs/2309.00254 (2023) +26. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Canton-Ferrer, C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura, + +P.S., Lachaux, M., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models. CoRR abs/2307.09288 (2023) +27. Tu, H., Cui, C., Wang, Z., Zhou, Y., Zhao, B., Han, J., Zhou, W., Yao, H., Xie, C.: How many unicorns are in this image? A safety evaluation benchmark for vision llms. CoRR abs/2311.16101 (2023) +28. Wang, J.G., Wang, J., Li, M., Neel, S.: Pandora's white-box: Increased training data leakage in open llms. arXiv preprint arXiv:2402.17012 (2024) +29. Wei, A., Haghtalab, N., Steinhardt, J.: Jailbroken: How does LLM safety training fail? In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023) +30. Wei, Z., Wang, Y., Wang, Y.: Jailbreak and guard aligned language models with only few in-context demonstrations. CoRR abs/2310.06387 (2023) +31. Wu, Y., Li, X., Liu, Y., Zhou, P., Sun, L.: Jailbreaking GPT-4V via self-adversarial attacks with system prompts. CoRR abs/2311.09127 (2023) +32. Yin, S., Fu, C., Zhao, S., Li, K., Sun, X., Xu, T., Chen, E.: A survey on multimodal large language models. CoRR abs/2306.13549 (2023) +33. Zhao, W.X., Zhou, K., Li, J., Tang, T., Wang, X., Hou, Y., Min, Y., Zhang, B., Zhang, J., Dong, Z., Du, Y., Yang, C., Chen, Y., Chen, Z., Jiang, J., Ren, R., Li, Y., Tang, X., Liu, Z., Liu, P., Nie, J., Wen, J.: A survey of large language models. CoRR abs/2303.18223 (2023) +34. Zhao, Y., Pang, T., Du, C., Yang, X., Li, C., Cheung, N., Lin, M.: On evaluating adversarial robustness of large vision-language models. CoRR abs/2305.16934 (2023) +35. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. CoRR abs/2304.10592 (2023) +36. Zou, A., Wang, Z., Kolter, J.Z., Fredrikson, M.: Universal and transferable adversarial attacks on aligned language models. CoRR abs/2307.15043 (2023) \ No newline at end of file diff --git a/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/images.zip b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..01d72ce0b7bcdf5af5365a6a0e9ff92ce0592d55 --- /dev/null +++ b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fd17b9004ff0cd62dd536731e44464769105218fdad808f090fcb0de69566736 +size 532955 diff --git a/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/layout.json b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..9cf8dea03ea6c8573d36a5e9d47b25c9c30c9495 --- /dev/null +++ b/2024/Images are Achilles' Heel of Alignment_ Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models/layout.json @@ -0,0 +1,8917 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 136, + 111, + 478, + 166 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 111, + 478, + 166 + ], + "spans": [ + { + "bbox": [ + 136, + 111, + 478, + 166 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment: Exploiting Visual Vulnerabilities for Jailbreaking Multimodal Large Language Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "spans": [ + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "text", + "content": "Yifan Li" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "inline_equation", + "content": "^{1,3,\\star}" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "text", + "content": ", Hangyu Guo" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "inline_equation", + "content": "^{1,3,\\star}" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "text", + "content": ", Kun Zhou" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "inline_equation", + "content": "^{2,3,\\star}" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "text", + "content": ", Wayne Xin Zhao" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "inline_equation", + "content": "^{1,3,\\dagger}" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "text", + "content": ", and Ji-Rong Wen" + }, + { + "bbox": [ + 203, + 185, + 410, + 210 + ], + "type": "inline_equation", + "content": "^{1,2,3}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 154, + 219, + 457, + 264 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 154, + 219, + 457, + 241 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 219, + 457, + 241 + ], + "spans": [ + { + "bbox": [ + 154, + 219, + 457, + 241 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 154, + 219, + 457, + 241 + ], + "type": "text", + "content": " Gaoling School of Artificial Intelligence, Renmin University of China " + }, + { + "bbox": [ + 154, + 219, + 457, + 241 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 154, + 219, + 457, + 241 + ], + "type": "text", + "content": " School of Information, Renmin University of China" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 154, + 241, + 457, + 264 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 241, + 457, + 264 + ], + "spans": [ + { + "bbox": [ + 154, + 241, + 457, + 264 + ], + "type": "text", + "content": "3 Beijing Key Laboratory of Big Data Management and Analysis Methods {liyifan0925,hyguo0220,batmanfly}@gmail.com" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 159, + 293, + 453, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 293, + 453, + 415 + ], + "spans": [ + { + "bbox": [ + 159, + 293, + 453, + 415 + ], + "type": "text", + "content": "Abstract. In this paper, we study the harmlessness alignment problem of multimodal large language models (MLLMs). We conduct a systematic empirical analysis of the harmlessness performance of representative MLLMs and reveal that the image input poses the alignment vulnerability of MLLMs. Inspired by this, we propose a novel jailbreak method named HADES, which hides and amplifies the harmfulness of the malicious intent within the text input, using meticulously crafted images. Experimental results show that HADES can effectively jailbreak existing MLLMs, which achieves an average Attack Success Rate (ASR) of " + }, + { + "bbox": [ + 159, + 293, + 453, + 415 + ], + "type": "inline_equation", + "content": "90.26\\%" + }, + { + "bbox": [ + 159, + 293, + 453, + 415 + ], + "type": "text", + "content": " for LLaVA-1.5 and " + }, + { + "bbox": [ + 159, + 293, + 453, + 415 + ], + "type": "inline_equation", + "content": "71.60\\%" + }, + { + "bbox": [ + 159, + 293, + 453, + 415 + ], + "type": "text", + "content": " for Gemini Pro Vision. Our code and data are available at https://github.com/RUCAIBox/HADES." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 415, + 428, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 415, + 428, + 425 + ], + "spans": [ + { + "bbox": [ + 160, + 415, + 428, + 425 + ], + "type": "text", + "content": "Warning: this paper contains example data that may be offensive." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 436, + 453, + 458 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 436, + 453, + 458 + ], + "spans": [ + { + "bbox": [ + 159, + 436, + 453, + 458 + ], + "type": "text", + "content": "Keywords: Multimodal Large Language Models " + }, + { + "bbox": [ + 159, + 436, + 453, + 458 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 436, + 453, + 458 + ], + "type": "text", + "content": " Harmlessness Alignment " + }, + { + "bbox": [ + 159, + 436, + 453, + 458 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 436, + 453, + 458 + ], + "type": "text", + "content": " Adversarial Attack" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 479, + 230, + 491 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 230, + 491 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 230, + 491 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 503, + 488, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 503, + 488, + 586 + ], + "spans": [ + { + "bbox": [ + 130, + 503, + 488, + 586 + ], + "type": "text", + "content": "Recently, by leveraging the powerful capacity of large language models (LLMs) [33], a variety of multimodal large language models (MLLMs) [32] have emerged, which can process both textual and visual information similarly as that LLMs process textual input. MLLMs have not only shown superior performance in various visual-language tasks but also possess the capability to engage in image-related dialogues with human users [15,35]. However, MLLMs also confront similar harmlessness challenges that afflict their backbone LLMs." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 587, + 483, + 637 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 587, + 483, + 637 + ], + "spans": [ + { + "bbox": [ + 130, + 587, + 483, + 637 + ], + "type": "text", + "content": "Despite undergoing harmlessness alignment like reinforcement learning from human feedback (RLHF) [19], LLMs remain vulnerable to black-box attacks (e.g., sophisticated jailbreak prompts [4]) or white-box attacks (e.g., gradient-based adversarial inputs [36]). Since MLLMs are generally built on top of existing" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 643, + 231, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 643, + 231, + 653 + ], + "spans": [ + { + "bbox": [ + 141, + 643, + 231, + 653 + ], + "type": "inline_equation", + "content": "\\star" + }, + { + "bbox": [ + 141, + 643, + 231, + 653 + ], + "type": "text", + "content": " Equal contribution." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 654, + 242, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 654, + 242, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 654, + 242, + 665 + ], + "type": "text", + "content": "† Corresponding author." + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 478, + 262 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 478, + 262 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 478, + 262 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 478, + 262 + ], + "type": "image", + "image_path": "7c248d2855c60663355501a440d3523c8392e537dfce905fb0a47228680c99a5.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 274, + 480, + 296 + ], + "lines": [ + { + "bbox": [ + 132, + 274, + 480, + 296 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 480, + 296 + ], + "type": "text", + "content": "Fig. 1: An example to show the influence of the visual modality on harmlessness alignment of Gemini Pro Vision. The harmful information is highlighted in red" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 325, + 480, + 420 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 480, + 420 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 480, + 420 + ], + "type": "text", + "content": "LLMs, they inevitably suffer from these safety issues. To study the harmlessness alignment of MLLMs, recent work either evaluates the harmlessness of MLLMs in response to harmful instructions [16, 27], or assesses the model robustness by utilizing adversarial images [10, 20]. These studies suggest that the integration of the visual modality might exacerbate safety concerns for MLLMs compared to their backbone LLMs. As illustrated in Fig. 1, even one of the state-of-the-art MLLMs, Gemini Pro Vision [1], would be influenced by the blank or harmful images, leading to improper outputs with harmful words." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 423, + 482, + 590 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 590 + ], + "type": "text", + "content": "However, it still lacks a deep understanding of how safety concerns occur in MLLMs and how they might be different from those in LLMs. Considering this issue, this work aims to systematically analyze the sourcing factors that violate the harmlessness alignment of MLLMs. We conduct detailed empirical studies on representative MLLMs, specifically investigating their performance on harmful instructions accompanied by images. Our findings are threefold: (1) Images can be backdoors for the harmlessness alignment of MLLMs. The inclusion of images in the input can significantly increase the harmfulness ratio of MLLMs' outputs; (2) Cross-modal fine-tuning undermines the alignment abilities of the backbone LLM for a given MLLM. The more parameters that are fine-tuned, the more severe the disruption is; (3) The harmfulness of MLLMs' responses is positively correlated with the harmfulness of the image content. These findings reveal that the visual modality introduces additional alignment vulnerabilities in MLLMs, which can be exploited to further jailbreak these models." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Motivated by these empirical findings, we propose a novel jailbreak approach called HADES, standing for Hiding and Amplifying harmfulness in images to DESTroy multimodal alignment, to assess the adversarial robustness of both open-and closed-source MLLMs. Specifically, our approach introduces a three-stage attack strategy. First, it extracts the harmful information from the text input into typography and replaces such text with a text-to-image pointer, which guides" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "content": "the model to focus on image information. In this way, we transfer the harmful input from the well-aligned text side into the image side, inducing models to be more prone to generate harmful outputs. Second, HADES attaches another harmful image to the original typography. This image is created by an image generation model, and its harmfulness has been amplified for multiple turns via prompt optimization. Third, HADES optimizes an adversarial noise via gradient update, towards inducing the MLLM to follow harmful instructions. The learned noise will be integrated into the previous image for jailbreaking MLLMs." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 213, + 372, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 213, + 372, + 224 + ], + "spans": [ + { + "bbox": [ + 146, + 213, + 372, + 224 + ], + "type": "text", + "content": "In summary, our main contributions are as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 232, + 480, + 351 + ], + "type": "list", + "angle": 0, + "index": 6, + "blocks": [ + { + "bbox": [ + 138, + 232, + 479, + 279 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 232, + 479, + 279 + ], + "spans": [ + { + "bbox": [ + 138, + 232, + 479, + 279 + ], + "type": "text", + "content": "- We conduct detailed empirical studies on the harmfulness alignment of representative MLLMs, and systematically investigate the possible sourcing factors that violate the harmfulness alignment of MLLMs. The results reveal that the visual modality of MLLMs poses a critical alignment vulnerability." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 139, + 281, + 480, + 351 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 281, + 480, + 351 + ], + "spans": [ + { + "bbox": [ + 139, + 281, + 480, + 351 + ], + "type": "text", + "content": "- We introduce HADES, a novel jailbreak approach that hides and amplifies the harmfulness of the original malicious intent using meticulously crafted images. Experimental results show that both open-source MLLMs based on aligned LLMs and powerful closed-source MLLMs struggle to resist HADES. Notably, HADES achieves an Attack Success Rate (ASR) of " + }, + { + "bbox": [ + 139, + 281, + 480, + 351 + ], + "type": "inline_equation", + "content": "90.26\\%" + }, + { + "bbox": [ + 139, + 281, + 480, + 351 + ], + "type": "text", + "content": " on LLaVA-1.5 and " + }, + { + "bbox": [ + 139, + 281, + 480, + 351 + ], + "type": "inline_equation", + "content": "71.60\\%" + }, + { + "bbox": [ + 139, + 281, + 480, + 351 + ], + "type": "text", + "content": " on Gemini Pro Vision." + } + ] + } + ], + "index": 5 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 131, + 372, + 418, + 385 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 372, + 418, + 385 + ], + "spans": [ + { + "bbox": [ + 131, + 372, + 418, + 385 + ], + "type": "text", + "content": "2 Empirical Harmlessness Analyses of MLLMs" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 398, + 482, + 446 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 398, + 482, + 446 + ], + "spans": [ + { + "bbox": [ + 130, + 398, + 482, + 446 + ], + "type": "text", + "content": "In this section, we conduct a systematic investigation to examine whether and how visual input influences the harmlessness alignment of MLLMs. We first introduce the data collection process in Sec. 2.1 and the evaluation settings in Sec. 2.2, then evaluate mainstream open- and closed-source MLLMs in Sec. 2.3." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 464, + 297, + 476 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 464, + 297, + 476 + ], + "spans": [ + { + "bbox": [ + 131, + 464, + 297, + 476 + ], + "type": "text", + "content": "2.1 Evaluation Data Collection" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 486, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 544 + ], + "type": "text", + "content": "To evaluate the harmlessness alignment of MLLMs, we collect a dataset comprising 750 harmful instructions across 5 scenarios. Each instruction includes a harmful keyword or key phrase and is paired with a harmful image related to the keyword or key phrase. We present the collection process below and show the pipeline in the supplementary materials." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "First, based on existing harmful scenarios of LLMs [12], we select five representative ones that are related to the visual information in the real world: (1) Violence, Aiding and Abetting, Incitement; (2) Financial Crime, Property Crime, Theft; (3) Privacy Violation; (4) Self-Harm; and (5) Animal Abuse. For simplicity, these categories are referred to as Violence, Financial, Privacy, Self-Harm, and Animal, respectively. Next, we adopt GPT-4 to generate 50 keywords for each of the above harmful categories, and then synthesize three harmful but distinct instructions based on each keyword. The prompts employed for the above process are documented in the supplementary materials. In this way, we guarantee that each instruction includes only one harmful element (i.e., the keyword" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": "or the key phrase), which could be accurately depicted by an image. Thus, we can pair each instruction with a corresponding real-world image that is relevant to the harmful keyword/phrase. Specifically, we first retrieve five images from Google using each keyword/phrase as the query, and then employ CLIP ViT-L/14 [21] to select the image that best matches the semantic representation of the keyword/phrase." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 204, + 258, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 204, + 258, + 217 + ], + "spans": [ + { + "bbox": [ + 131, + 204, + 258, + 217 + ], + "type": "text", + "content": "2.2 Evaluation Settings" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 222, + 482, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 222, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 222, + 482, + 282 + ], + "type": "text", + "content": "We evaluate both representative open-source (i.e., LLaVA-1.5 [14], LLaVA-1.5 LoRA (represented by LLaVA-1.5L), MiniGPT-v2 [5] and MiniGPT-4 [35]) and powerful closed-source MLLMs (i.e., Gemini Pro Vision [1], short as Gemini " + }, + { + "bbox": [ + 130, + 222, + 482, + 282 + ], + "type": "inline_equation", + "content": "\\mathrm{Pro_V}" + }, + { + "bbox": [ + 130, + 222, + 482, + 282 + ], + "type": "text", + "content": ") and GPT-4V [18]) on our dataset. To discuss the influence of the visual modality on harmlessness alignment, we design four evaluation settings:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 288, + 480, + 395 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 138, + 288, + 480, + 335 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 288, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 138, + 288, + 480, + 335 + ], + "type": "text", + "content": "- **Backbone:** We evaluate the backbone LLMs of MLLMs on harmful instructions, which have not been fine-tuned with cross-modal data, i.e., Vicuna v1.5-7B [7] for LLaVA-1.5, LLaMA-2-Chat-7B [26] for MiniGPT-4 and MiniGPT-v2, GPT-4 for GPT-4V, and Gemini Pro for Gemini Prov." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 336, + 436, + 346 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 336, + 436, + 346 + ], + "spans": [ + { + "bbox": [ + 138, + 336, + 436, + 346 + ], + "type": "text", + "content": "- Text-only: We evaluate MLLMs purely on harmful instructions." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 346, + 479, + 370 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 346, + 479, + 370 + ], + "spans": [ + { + "bbox": [ + 138, + 346, + 479, + 370 + ], + "type": "text", + "content": "- Blank: We evaluate MLLMs on harmful instructions paired with a " + }, + { + "bbox": [ + 138, + 346, + 479, + 370 + ], + "type": "inline_equation", + "content": "500 \\times 500" + }, + { + "bbox": [ + 138, + 346, + 479, + 370 + ], + "type": "text", + "content": " blank image." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 371, + 480, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 371, + 480, + 395 + ], + "spans": [ + { + "bbox": [ + 138, + 371, + 480, + 395 + ], + "type": "text", + "content": "- **Toxic:** We evaluate MLLMs on harmful instructions paired with the previously selected harmful images (described in Sec. 2.1)." + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 400, + 481, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 400, + 481, + 425 + ], + "spans": [ + { + "bbox": [ + 130, + 400, + 481, + 425 + ], + "type": "text", + "content": "We employ Attack Success Rate (ASR) as the evaluation metric of harmlessness alignment, which is calculated by:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 246, + 432, + 480, + 456 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 246, + 432, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 246, + 432, + 480, + 456 + ], + "type": "interline_equation", + "content": "\\mathrm {A S R} = \\frac {\\sum_ {i = 1} ^ {N} \\mathbb {1} _ {\\{\\mathcal {J} (y _ {i}) = \\text {T r u e} \\}}}{N}, \\tag {1}", + "image_path": "a395205550d8cc55f015b9bc09b4b5484190e8961bc016cc535aa20ebc6dc5eb.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "spans": [ + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "inline_equation", + "content": "y_{i}" + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": " is the model's response, " + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "inline_equation", + "content": "\\mathbb{1}" + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": " is an indicator function that equals to 1 if " + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "inline_equation", + "content": "\\mathcal{I}(y_i) = \\mathrm{True}" + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": " and 0 otherwise, " + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": " is the total number of instructions and " + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "inline_equation", + "content": "\\mathcal{J}" + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": " is the harmfulness judging model, outputting True or False to indicate whether " + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "inline_equation", + "content": "y_{i}" + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": " is harmful. We adopt Beaver-dam-7B [12] as " + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "inline_equation", + "content": "\\mathcal{J}" + }, + { + "bbox": [ + 131, + 464, + 482, + 524 + ], + "type": "text", + "content": ", which has been trained on high-quality human feedback data about the above harmful categories." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 539, + 255, + 551 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 539, + 255, + 551 + ], + "spans": [ + { + "bbox": [ + 131, + 539, + 255, + 551 + ], + "type": "text", + "content": "2.3 Evaluation Results" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 557, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 594 + ], + "type": "text", + "content": "The evaluation results are presented in Tab. 1. We list the ASR results of 5 harmful scenarios under 4 evaluation settings and calculate the average ASR across all scenarios. From the results, we can summarize three major findings:" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "Images can be alignment backdoors of MLLMs. When comparing the performance of each model under the Backbone and Text-only settings, the harmlessness alignment of MLLMs does not significantly deviate from that of their backbone LLMs, and even exhibit enhanced defense capability, e.g., LLaVA-1.5 " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "(-2.80\\%)" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " and Gemini Prov " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "(-7.50\\%)" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ". However, once adding images, regardless of whether their contents are harmful or not, the ASR results of MLLMs" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 179, + 478, + 460 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: The evaluation results of representative MLLMs on the dataset we collected. (Train) represents the cross-modal fine-tuning strategies of MLLMs. Animal, Financial, Privacy, Self-Harm, and Violence represent the ASR of MLLMs on instructions from these categories. Average represents the average ASR across all categories. + and - represents the change of ASR compared to the Backbone setting." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 179, + 478, + 460 + ], + "lines": [ + { + "bbox": [ + 134, + 179, + 478, + 460 + ], + "spans": [ + { + "bbox": [ + 134, + 179, + 478, + 460 + ], + "type": "table", + "html": "
Model(Train)SettingAnimal Financial Privacy Self-Harm ViolenceAverage(%)
LLaVA-1.5(Full)Backbone17.3346.0034.6712.0034.6728.93
Text-only22.0040.0028.0010.0030.6726.13(-2.80)
Blank38.0066.6768.0030.6767.3354.13(+25.20)
Toxic54.0077.3382.6746.6780.0068.13(+39.20)
LLaVA-1.5L(LoRA)Backbone17.3346.0034.6712.0034.6728.93
Text-only23.3340.0030.009.3330.6726.67(-2.26)
Blank41.3367.3363.3325.3361.3351.73(+22.80)
Toxic48.6771.3374.6743.3376.0062.80(+33.87)
MiniGPT-v2(LoRA)Backbone0.000.000.000.000.670.13
Text-only7.3312.008.670.0015.338.67(+8.54)
Blank26.0046.6740.0016.0041.3334.00(+33.87)
Toxic37.3360.6750.0027.3344.0043.87(+43.74)
MiniGPT-4(Frozen)Backbone0.000.000.000.000.670.13
Text-only5.332.671.331.333.332.80(+2.67)
Blank15.3313.336.670.008.678.80(+8.67)
Toxic28.6735.3318.679.3325.3323.47(+23.34)
Gemini Prov(-)Backbone1.7013.8012.081.208.707.50
Text-only0.000.000.000.000.000.00(-7.50)
Blank13.3342.6734.005.3321.3323.33(+15.83)
Toxic19.3352.0045.336.6730.0030.67(+23.17)
GPT-4V(-)Backbone0.002.002.670.000.671.07
Text-only1.338.676.000.677.334.80(+3.73)
Blank2.004.676.000.006.673.87(+2.80)
Toxic2.0014.0014.000.006.007.20(+6.13)
", + "image_path": "c168ef22899304ee67b196a7047844f1f49f1f928d5b40cbc93d767985982a22.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 485, + 480, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 485, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 485, + 480, + 533 + ], + "type": "text", + "content": "would be greatly improved even under the Blank setting using harmless images, e.g., LLaVA-1.5 " + }, + { + "bbox": [ + 132, + 485, + 480, + 533 + ], + "type": "inline_equation", + "content": "(+25.20\\%)" + }, + { + "bbox": [ + 132, + 485, + 480, + 533 + ], + "type": "text", + "content": " and MiniGPT-v2 " + }, + { + "bbox": [ + 132, + 485, + 480, + 533 + ], + "type": "inline_equation", + "content": "(+33.87\\%)" + }, + { + "bbox": [ + 132, + 485, + 480, + 533 + ], + "type": "text", + "content": ". It indicates that images can be the alignment backdoor of MLLMs, which would undermine MLLMs' capability of defending against harmful text input." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 534, + 486, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 486, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 486, + 665 + ], + "type": "text", + "content": "More parameters tuned, less alignment left. By examining the performance of open-sourced MLLMs, we notice that their alignment performance is highly relevant to their training strategies during cross-modal fine-tuning. Generally, for the same backbone model, the more parameters are optimized during fine-tuning, the harmlessness alignment would be affected more significantly. For example, under the Toxic setting, MiniGPT-4, with the fixed backbone LLM, is more robust than the LoRA-fine-tuned MiniGPT-v2, achieving lower ASR results (23.47% vs. 43.87%). Similarly, the full-parameter fine-tuned LLaVA-1.5 also generates more harmful responses than LoRA-fine-tuned LLaVA-1.5L (68.13% vs. 62.80%). The reason may be that the cross-modal fine-tuning process would hurt the harmlessness alignment of the backbone MLLMs." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 150, + 119, + 462, + 355 + ], + "blocks": [ + { + "bbox": [ + 150, + 119, + 462, + 355 + ], + "lines": [ + { + "bbox": [ + 150, + 119, + 462, + 355 + ], + "spans": [ + { + "bbox": [ + 150, + 119, + 462, + 355 + ], + "type": "image", + "image_path": "07f6d4b98183c3bb565cbc7953a8e29f58736166f12650c972ce7e3a29c872f9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 369, + 482, + 424 + ], + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 424 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 424 + ], + "type": "text", + "content": "Fig. 2: Given a harmful textual instruction, HADES involves a three-step procedure: (1) removes the harmful content from the text into typography; (2) combines it with a harmful image generated by a diffusion model, using an iteratively refined prompt from an LLM; (3) appends an adversarial image on top of the image, which elicits the MLLM to generate affirmative responses for harmful instructions." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 446, + 482, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 482, + 542 + ], + "type": "text", + "content": "Harmful images are more likely to elicit harmful outputs. We observe that MLLMs are more prone to produce harmful outputs when presented with harmful images. It holds for both open-source and closed-source models, as their ASR results under the Toxic setting greatly exceed the results from all other settings, e.g., MiniGPT-4 (23.47% vs. 8.80%) and LLaVA-1.5 (68.13% vs. 54.13%). It indicates that it is hard for current MLLMs to defend against harmful image inputs. With the increase in image harmfulness, MLLMs might be increasingly prone to generate more harmful outputs." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 558, + 413, + 572 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 413, + 572 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 413, + 572 + ], + "type": "text", + "content": "3 The Proposed Jailbreak Approach: HADES" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Based on empirical studies, the visual input potentially brings vulnerabilities to the harmlessness alignment of MLLMs. However, it is not easy to manually craft massive adversarial samples that can successfully jailbreak MLLMs, which help detect the weak spots in real-world applications. To address it, based on harmful textual instructions, we propose a novel method to automatically synthesize high-quality adversarial examples, called HADES that stands for Hiding and Amplifying harmfulness in images to DEStroy multimodal alignment." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "Typically, an MLLM is composed of an LLM " + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": ", an image encoder " + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\mathbf{E}" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": " and a projection layer " + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\mathbf{W}" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": ". The generation process of MLLMs can be formulated as:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 261, + 149, + 481, + 162 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 149, + 481, + 162 + ], + "spans": [ + { + "bbox": [ + 261, + 149, + 481, + 162 + ], + "type": "interline_equation", + "content": "y = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i), t ]), \\tag {2}", + "image_path": "72a3cbc98d36dab206a017f3b7dcbae2feb76465dda20a3d4729a83271a1141d.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "spans": [ + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": " are the input image and text, and " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": " is the model's output. Given a harmful " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": ", HADES aims to modify " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "t'" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": " by adding a text-to-image pointer and crafts harmful images " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "i'" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": ". Thereby, HADES transfers the malicious intent to the less-aligned image side of the MLLM, inducing it to generate harmful responses " + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "inline_equation", + "content": "y'" + }, + { + "bbox": [ + 130, + 169, + 482, + 231 + ], + "type": "text", + "content": ". The whole process of HADES is presented in Fig. 2." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 247, + 364, + 259 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 247, + 364, + 259 + ], + "spans": [ + { + "bbox": [ + 131, + 247, + 364, + 259 + ], + "type": "text", + "content": "3.1 Hiding Harmfulness from Text to Image" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 265, + 479, + 336 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 265, + 479, + 336 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 479, + 336 + ], + "type": "text", + "content": "By training on human preference data, existing LLMs learn to align with human values and refuse to respond to harmful text inputs. MLLMs derived from these LLMs naturally inherit the defense capacity for text inputs but leave the image side vulnerable to harmful content. Hence, we propose transferring harmful information from the well-aligned text side to the less-aligned image side, to bypass the defense mechanisms of MLLMs." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 338, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 456 + ], + "type": "text", + "content": "Specifically, we replace the harmful keyword or key phrase from each text instruction " + }, + { + "bbox": [ + 130, + 338, + 482, + 456 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 338, + 482, + 456 + ], + "type": "text", + "content": " with a text-to-image pointer and utilize images to represent it. On the text side, we categorize all the keywords into three classes: objects, concepts, or behaviors. For the keywords falling under the first two categories, the text-to-image pointer is \"the object/concept in the image\", while for the keywords denoting behaviors, the text-to-image pointer is \"conduct the behavior in the image on\". On the image side, as the keywords may represent abstract concepts or behaviors that are difficult for models to grasp when depicted by real-world images, we employ typography to represent these keywords. As a result, the generation process of MLLMs can be formally given as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 253, + 466, + 481, + 479 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 466, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 253, + 466, + 481, + 479 + ], + "type": "interline_equation", + "content": "y = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\mathrm {t y p}}), t ^ {\\prime} ]), \\tag {3}", + "image_path": "08dd549e95003b81813db4e1fa8b50c3c10ac9c51a71080fdc627a88adb71440.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "text", + "content": " is the typography of the keyword and " + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "inline_equation", + "content": "t'" + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "text", + "content": " is the modified instruction. By doing so, " + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "inline_equation", + "content": "t'" + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "text", + "content": " no longer explicitly contains any harmful information, yet models can still infer the original harmful intent by referring to " + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 130, + 486, + 482, + 523 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 538, + 377, + 551 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 538, + 377, + 551 + ], + "spans": [ + { + "bbox": [ + 131, + 538, + 377, + 551 + ], + "type": "text", + "content": "3.2 Amplifying Image Harmfulness with LLMs" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 558, + 479, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 479, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 479, + 641 + ], + "type": "text", + "content": "Our empirical study reveals that when the image input becomes more harmful, MLLMs also tend to generate more harmful responses. Therefore, we propose to append a harmful image to the previous typography " + }, + { + "bbox": [ + 130, + 558, + 479, + 641 + ], + "type": "inline_equation", + "content": "i_{typ}" + }, + { + "bbox": [ + 130, + 558, + 479, + 641 + ], + "type": "text", + "content": " to amplify their harmfulness. Since the harmfulness of real-world images is always limited, we introduce diffusion models as the harmful image generator. In addition, we utilize LLMs as the attacker model to iteratively optimize the prompt for diffusion models to further increase the harmfulness of generated images." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "The whole procedure of image harmfulness optimization is presented in the supplementary materials. We leverage the harmfulness of the caption as the" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": "proxy for the image's harmfulness, as the harmfulness of text is easier to quantify than images. We consider an iterative process to generate harmful images. We first ask ChatGPT to modify the original instruction " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " into an initial image generation prompt " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "p_0" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " and generate an initial image. At step " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ", the caption model " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " generates a caption " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "c_k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " for the target image " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}^k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ". Subsequently, the judging model " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "\\mathcal{J}" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " assesses the image's harmfulness with a score, " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "s_k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ", on a scale from 1 to 10, where a higher score indicates greater harmfulness. " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "\\mathcal{J}" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " also explains the reason for its score in " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "exp_k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ". All this information (" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "p_k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "c_k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "s_k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "exp_k" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ") is appended to the conversation history " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " and sent to the attacker model " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": " which first suggests improvements to the prompt and then generates the refined image generation prompt " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "p_{k+1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ". The refined prompt is then used to generate a new image " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}^{k+1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ". The above process circulates until reaching the maximum iteration turn " + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": ", which is set to 5. In practice, we choose GPT-4-0613 as both the attacker and judging model by utilizing different system prompts (as presented in the supplementary materials). For captioning and image generation, we adopt LLaVA-1.5 and PixArt-α [6], respectively." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 308, + 481, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 481, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 481, + 332 + ], + "type": "text", + "content": "The optimized images " + }, + { + "bbox": [ + 132, + 308, + 481, + 332 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 132, + 308, + 481, + 332 + ], + "type": "text", + "content": " is then vertically concatenated with the previous typography " + }, + { + "bbox": [ + 132, + 308, + 481, + 332 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 132, + 308, + 481, + 332 + ], + "type": "text", + "content": ", which can be formulated as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 239, + 339, + 480, + 353 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 339, + 480, + 353 + ], + "spans": [ + { + "bbox": [ + 239, + 339, + 480, + 353 + ], + "type": "interline_equation", + "content": "y = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\text {o p t}} \\oplus i _ {\\text {t y p}}), t ^ {\\prime} ]). \\tag {4}", + "image_path": "b1c44a1e1bc7d076792241613dfd7634c79ff52a2422798c51103bdce26f817a.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 359, + 482, + 431 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 359, + 482, + 431 + ], + "spans": [ + { + "bbox": [ + 130, + 359, + 482, + 431 + ], + "type": "text", + "content": "In this way, both images can mutually enhance their respective attack effects. The utilization of " + }, + { + "bbox": [ + 130, + 359, + 482, + 431 + ], + "type": "inline_equation", + "content": "t'" + }, + { + "bbox": [ + 130, + 359, + 482, + 431 + ], + "type": "text", + "content": " forces the model to focus more on the image, thereby increasing its sensitivity to harmful content. Simultaneously, " + }, + { + "bbox": [ + 130, + 359, + 482, + 431 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 130, + 359, + 482, + 431 + ], + "type": "text", + "content": ", which is semantically close to the original instructions, serves as the additional context and aids the model in understanding the original harmful intent of masked instructions, which can partially compensate for some models' insufficient OCR capabilities." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 447, + 433, + 460 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 433, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 433, + 460 + ], + "type": "text", + "content": "3.3 Amplifying Image Harmfulness with Gradient Update" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 466, + 481, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 466, + 481, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 466, + 481, + 502 + ], + "type": "text", + "content": "Existing work has proven the effectiveness of adversarial images in jailbreaking MLLMs. To further enhance the attack effectiveness, HADES incorporates adversarial images by concatenating them with the previous images." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 502, + 482, + 646 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 502, + 482, + 646 + ], + "spans": [ + { + "bbox": [ + 130, + 502, + 482, + 646 + ], + "type": "text", + "content": "The image input of MLLMs is encoded through an image encoder and then mapped into the LLM representation space via a projection layer. Consequently, images are represented as a sequence of distinct visual tokens, collectively forming a visual prompt. It allows us to view adversarial images, those that prompt MLLMs to produce malicious responses, as text jailbreak prompts such as \"Do Anything Now\" [24]. Jailbreak prompts are commonly placed at the beginning of malicious instructions without compromising the models' understanding of these instructions. Given the similarity between adversarial images and jailbreak prompts, we suggest that concatenating adversarial images on top of the image input of MLLMs can also prompt them to produce harmful information without compromising their understanding of the original image content. Consequently, the full formulation of HADES can be given as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 225, + 653, + 480, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 653, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 225, + 653, + 480, + 666 + ], + "type": "interline_equation", + "content": "y = \\mathcal {M} ([ \\mathbf {W} \\cdot \\mathbf {E} (i _ {\\mathrm {a d v}} \\oplus i _ {\\mathrm {o p t}} \\oplus i _ {\\mathrm {t y p}}), t ^ {\\prime} ]). \\tag {5}", + "image_path": "60542788d8a511532d6539910d84304c04cbc54829bd4fa7e1e906e412d09c79.jpg" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "To ensure the generalization capability of our method, we generate a single adversarial image " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " for all harmful instructions within the same category in our dataset. Initially, " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " is set to be a blank image " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{initial}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". Subsequently, we collect a set of affirmative responses, " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "Y_{a}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ", containing 10 examples (e.g., \"Sure!\" or \"I can answer the question for you.\") intended as the desired output of MLLMs. We provide the target model with one harmful instruction " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "t_{j}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " and the adversarial image " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ", and then select one affirmative response as the target label and compute the cross-entropy loss between the model's output and this target. The gradient derived from this loss is then utilized to iteratively refine the adversarial image " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". The optimization procedure can be formulated as below:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 182, + 248, + 481, + 279 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 182, + 248, + 481, + 279 + ], + "spans": [ + { + "bbox": [ + 182, + 248, + 481, + 279 + ], + "type": "interline_equation", + "content": "i _ {\\mathrm {a d v}} \\leftarrow i _ {\\text {i n i t i a l}} + \\arg \\min _ {\\delta} \\sum_ {j = 1} ^ {m} - \\log \\left(p _ {\\theta} \\left(y _ {j} \\mid t _ {j}, i _ {\\text {i n i t i a l}} + \\delta\\right)\\right), \\tag {6}", + "image_path": "a2c26fc96fd1ef9404fe2bf48c257b7d99719c70c2573df30b0aa32f9a326785.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "spans": [ + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "y_{j}\\in Y_{a}" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "p_{\\theta}" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": " represents the conditional probability generated by the target MLLM. Additionally, to maintain " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": " as a valid image, we constrain " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{initial}} + \\delta \\in \\mathcal{B}" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": " during the optimization, where " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "\\mathcal{B} = [0,1]^{w\\times h\\times c}" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": " denote the width, height, and channels of " + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 131, + 289, + 483, + 339 + ], + "type": "text", + "content": ", respectively." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 363, + 224, + 376 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 224, + 376 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 224, + 376 + ], + "type": "text", + "content": "4 Experiment" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 394, + 262, + 407 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 394, + 262, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 394, + 262, + 407 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 420, + 482, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 420, + 482, + 517 + ], + "spans": [ + { + "bbox": [ + 130, + 420, + 482, + 517 + ], + "type": "text", + "content": "For closed-source models, we select GPT-4V and Gemini Prov. For open-source models, we also select the MLLMs used before, i.e. LLaVA-1.5 and LLaVA-1.5L. We also select LLaVA built on Llama-2-Chat-7b, as it has experienced safety RLHF. Given the limited OCR capabilities of the open-source MLLMs, they could misinterpret the keywords in " + }, + { + "bbox": [ + 130, + 420, + 482, + 517 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 130, + 420, + 482, + 517 + ], + "type": "text", + "content": ". Thus, we continually prompt open-source MLLMs until they either explicitly generate the harmful keywords or reach the maximum allowed retries (set to 5 in practice). To verify the effectiveness of each component of HADES, we design four evaluation settings:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 529, + 481, + 653 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 138, + 529, + 480, + 553 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 529, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 138, + 529, + 480, + 553 + ], + "type": "text", + "content": "- Typ image: Evaluate all models with the original instructions " + }, + { + "bbox": [ + 138, + 529, + 480, + 553 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 138, + 529, + 480, + 553 + ], + "type": "text", + "content": " and corresponding typography " + }, + { + "bbox": [ + 138, + 529, + 480, + 553 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 138, + 529, + 480, + 553 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 139, + 554, + 481, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 554, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 139, + 554, + 481, + 578 + ], + "type": "text", + "content": "- +Text-to-image pointer: Evaluate all models with modified instructions " + }, + { + "bbox": [ + 139, + 554, + 481, + 578 + ], + "type": "inline_equation", + "content": "t'" + }, + { + "bbox": [ + 139, + 554, + 481, + 578 + ], + "type": "text", + "content": " and the typography " + }, + { + "bbox": [ + 139, + 554, + 481, + 578 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 139, + 554, + 481, + 578 + ], + "type": "text", + "content": ". The generation process is the same as Eq. (3)." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "spans": [ + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "text", + "content": "- +Opt image: Evaluate all models with " + }, + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "inline_equation", + "content": "t'" + }, + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "text", + "content": " and the concatenation of " + }, + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 139, + 579, + 481, + 603 + ], + "type": "text", + "content": ". The generation process is the same as Eq. (4)." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "spans": [ + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "text", + "content": "- +Adv image: The full version of HADES. Since we don't have access to the parameters of Gemini " + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "inline_equation", + "content": "\\mathrm{Prov}" + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "text", + "content": " and GPT-4V, we only evaluate open-source models with " + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "inline_equation", + "content": "t'" + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "text", + "content": " and the concatenation of " + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 138, + 604, + 481, + 653 + ], + "type": "text", + "content": ". The generation process is the same as Eq. (5)." + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 289, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 289, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 289, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 158, + 481, + 387 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 2: The evaluation results of MLLMs on instructions and images processed by HADES. T2I pointer represents Text-to-image pointer. + and - represents the change of ASR compared to the Typ image setting." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 158, + 481, + 387 + ], + "lines": [ + { + "bbox": [ + 132, + 158, + 481, + 387 + ], + "spans": [ + { + "bbox": [ + 132, + 158, + 481, + 387 + ], + "type": "table", + "html": "
ModelSettingAnimalFinancialPrivacySelf-HarmViolenceAverage(%)
LLaVA-1.5Typ image48.6781.3378.0038.6781.3365.60
+T2I pointer32.6761.3371.3342.6782.6758.13(-7.47)
+Opt image67.3384.0085.3362.0094.0078.53(+12.93)
+Adv image83.3389.3394.6789.3394.6790.26(+24.66)
LLaVA-1.5LTyp image50.0071.3374.6735.3379.3362.13
+T2I pointer30.6753.3359.3324.6772.0048.00(-14.13)
+Opt image72.0082.6786.6761.3392.0078.93(+16.80)
+Adv image83.3391.3392.6784.6792.6788.93(+26.80)
LLaVATyp image20.6753.3333.338.0040.0031.07
+T2I pointer20.0044.0053.3315.3355.3337.60(+6.53)
+Opt image51.3374.0078.0041.3380.0064.93(+33.86)
+Adv image76.0089.3384.6775.3387.3382.53(+51.46)
Gemini ProvTyp image30.0056.0046.6717.3322.0034.40
+T2I pointer65.3364.0058.0034.6734.6751.33(+16.93)
+Opt image67.3386.6781.3344.0078.6771.60(+37.20)
GPT-4VTyp image0.671.334.000.002.671.73
+T2I pointer3.336.003.331.332.003.20(+1.47)
+Opt image2.6724.6727.331.3319.3315.07(+13.34)
", + "image_path": "dc4e2581853344e5bc703b8039e80add23a1d99ceaf1938aa39d8f7b27c90102.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 407, + 261, + 419 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 261, + 419 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 261, + 419 + ], + "type": "text", + "content": "4.2 Experiment Results" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 426, + 482, + 558 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 558 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 558 + ], + "type": "text", + "content": "The evaluation results in Tab. 2 demonstrate that HADES significantly enhances the attack success rate (ASR) for both open- and closed-source MLLMs. Specifically, the average ASR for the three models in the LLaVA series exceeds 80 percent. Gemini ProV also struggles to counteract harmful instructions generated by HADES with an average ASR of " + }, + { + "bbox": [ + 130, + 426, + 482, + 558 + ], + "type": "inline_equation", + "content": "71.60\\%" + }, + { + "bbox": [ + 130, + 426, + 482, + 558 + ], + "type": "text", + "content": ". Among the evaluated models, GPT-4V exhibits the strongest defense capacity against HADES, yielding a " + }, + { + "bbox": [ + 130, + 426, + 482, + 558 + ], + "type": "inline_equation", + "content": "15.07\\%" + }, + { + "bbox": [ + 130, + 426, + 482, + 558 + ], + "type": "text", + "content": " proportion of harmful responses. When examining the models' performance across different categories of harmful instructions, it can be observed that they generally exhibit stronger defenses against instructions related to Animal and Self-Harm, while instructions about Financial, Privacy, and Violence categories are more likely to break through the models' safeguards." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": "Under the " + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "inline_equation", + "content": "+" + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": " Text-to-image pointer setting, we observe diverse attack outcomes across different models. The ASR increases for LLaVA " + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "inline_equation", + "content": "(+6.53\\%)" + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": ", Gemini " + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "inline_equation", + "content": "\\mathrm{Prov}_{\\mathrm{V}}(+16.93\\%)" + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": " and GPT-4V " + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "inline_equation", + "content": "(+1.47\\%)" + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": ", while decreases for LLaVA-1.5 " + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "inline_equation", + "content": "(-7.47\\%)" + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": " and LLaVA-1.5L " + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "inline_equation", + "content": "(-14.13\\%)" + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": ". We attribute the ASR drop on these models to two main reasons. Firstly, some models have limited OCR capabilities, which causes them to misunderstand certain instructions as benign and consequently generate harmless responses. Notably, Gemini " + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "inline_equation", + "content": "\\mathrm{Prov}_{\\mathrm{V}}" + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": " and GPT-4V, which possess advanced OCR capabilities, exhibit more harmful behavior under this setting. This suggests as the development of MLLMs, their enhancing OCR capabilities" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 101 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 176 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 176 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 176 + ], + "type": "text", + "content": "will correspondingly increase the effectiveness of our method. Secondly, the text-to-image pointer is designed to bypass the defense mechanisms of MLLMs on the text side. Therefore, its effectiveness is constrained on models with inadequate harmlessness alignment (e.g., Vicuna v1.5 in LLaVA-1.5). In such cases, the improvement in ASR could be offset by the decrease due to misunderstanding." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": "The incorporation of " + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": " under the " + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "inline_equation", + "content": "+Opt" + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": " image setting significantly increases the ASR of all models, even more than 30 percent (e.g., LLaVA " + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "inline_equation", + "content": "(+33.86\\%)" + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": " and Gemini ProV " + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "inline_equation", + "content": "(+37.20\\%)" + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": "). These results further verify our previous empirical finding: harmful images tend to elicit harmful responses. Moreover, " + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": " helps mitigate the misunderstanding issues observed with LLaVA-1.5 and LLaVA-1.5L. The ASR of these two models increases notably compared to the " + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "inline_equation", + "content": "+Text-to-image" + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": " pointer setting. We attribute such results to that " + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 130, + 176, + 482, + 282 + ], + "type": "text", + "content": " always describes scenarios relevant to the instruction contents, which provides extra context that helps MLLMs to accurately understand the instruction." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": "Finally, by combining " + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{adv}}" + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": " under the " + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "inline_equation", + "content": "+Adv" + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": " image setting, the full version of HADES further increases the ASR on open-source models. Even LLaVA, whose backbone LLM is well-aligned by RLHF, achieves an average ASR of " + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "inline_equation", + "content": "82.53\\%" + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": ". HADES also demonstrates promising ASR on categories that are relatively harder to jailbreak under previous settings. For LLaVA, the ASR on the Animal category rises from " + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "inline_equation", + "content": "51.33\\%" + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "inline_equation", + "content": "76.00\\%" + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": ", while the ASR on the Self-Harm category rises from " + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "inline_equation", + "content": "41.33\\%" + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "inline_equation", + "content": "75.33\\%" + }, + { + "bbox": [ + 130, + 284, + 482, + 368 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 384, + 249, + 396 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 384, + 249, + 396 + ], + "spans": [ + { + "bbox": [ + 131, + 384, + 249, + 396 + ], + "type": "text", + "content": "4.3 Further Analyses" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 403, + 481, + 428 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 481, + 428 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 481, + 428 + ], + "type": "text", + "content": "In this part, we further discuss the effectiveness of our proposed approach, from image harmfulness optimization, attack transferability, and jailbreak cases." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 445, + 319, + 612 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 445, + 319, + 612 + ], + "spans": [ + { + "bbox": [ + 130, + 445, + 319, + 612 + ], + "type": "text", + "content": "Effectiveness of Image Harmfulness Optimization. To validate the effectiveness of the optimization process for image generation discussed in Sec. 3.2, we conduct a specific experiment to examine the attack performance with the intermediately generated images with gradually increasing optimization steps. As shown in Fig. 3, the ASR results of all the comparison models consistently improve when using more optimization steps for image generation. These findings affirm the efficacy of our proposed image harmfulness optimization method in HADES." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 318, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 318, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 318, + 665 + ], + "type": "text", + "content": "Transferability of Adversarial Attack. To further validate the transferability of HADES across various MLLMs and" + } + ] + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 329, + 470, + 477, + 583 + ], + "blocks": [ + { + "bbox": [ + 329, + 470, + 477, + 583 + ], + "lines": [ + { + "bbox": [ + 329, + 470, + 477, + 583 + ], + "spans": [ + { + "bbox": [ + 329, + 470, + 477, + 583 + ], + "type": "image", + "image_path": "659f85026bc3a8a9beb439e3cd346d3a28c9569ded9b92a5c53c5c7b2a0d9c50.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 324, + 591, + 482, + 625 + ], + "lines": [ + { + "bbox": [ + 324, + 591, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 324, + 591, + 482, + 625 + ], + "type": "text", + "content": "Fig.3: The ASR results of different models on HADES using images generated at different optimization steps." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 118, + 293, + 247 + ], + "blocks": [ + { + "bbox": [ + 133, + 118, + 293, + 247 + ], + "lines": [ + { + "bbox": [ + 133, + 118, + 293, + 247 + ], + "spans": [ + { + "bbox": [ + 133, + 118, + 293, + 247 + ], + "type": "image", + "image_path": "20de811da902f5c5dd34a7de5e19f1fabfd82a3c42aee9921c77693e4f15284e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 153, + 250, + 274, + 259 + ], + "lines": [ + { + "bbox": [ + 153, + 250, + 274, + 259 + ], + "spans": [ + { + "bbox": [ + 153, + 250, + 274, + 259 + ], + "type": "text", + "content": "(a) Transferability across MLLMs." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 321, + 115, + 480, + 247 + ], + "blocks": [ + { + "bbox": [ + 321, + 115, + 480, + 247 + ], + "lines": [ + { + "bbox": [ + 321, + 115, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 321, + 115, + 480, + 247 + ], + "type": "image", + "image_path": "a2b9bb051568b0f61e3e2d178234cb2221b5843090fe0b15e4dfc24509d46bc8.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 335, + 250, + 465, + 259 + ], + "lines": [ + { + "bbox": [ + 335, + 250, + 465, + 259 + ], + "spans": [ + { + "bbox": [ + 335, + 250, + 465, + 259 + ], + "type": "text", + "content": "(b) Transferability across categories." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 268, + 482, + 301 + ], + "lines": [ + { + "bbox": [ + 130, + 268, + 482, + 301 + ], + "spans": [ + { + "bbox": [ + 130, + 268, + 482, + 301 + ], + "type": "text", + "content": "Fig. 4: The evaluation results of transferability of HADES across different MLLMs (LLaVA, LLaVA-1.5 and LLaVA-1.5L) and different instruction categories (Violence, Self-Harm, Privacy, Financial, and Animal)." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 328, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 328, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 328, + 482, + 521 + ], + "type": "text", + "content": "harmful categories, we select Violence as the primary category for assessing cross-model transferability and LLaVA as the target model for exploring cross-category transferability. We then implement HADES utilizing " + }, + { + "bbox": [ + 130, + 328, + 482, + 521 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 130, + 328, + 482, + 521 + ], + "type": "text", + "content": " trained on a specific model/category to conduct attacks on other models/categories. The evaluation results are presented in Fig. 4. Fig. 4a demonstrates that HADES trained on one MLLM achieves comparable ASR on other MLLMs. Additionally, we observe that attacks between LLaVA-1.5 and LLaVA-1.5L demonstrate significant mutual transferability, likely due to their shared backbone LLMs and vision encoders. Furthermore, as illustrated in Fig. 4b, HADES demonstrates enhanced transferability within specific harmful categories such as Self-Harm, Violence, and Animal, as well as Privacy and Financial. Such phenomena can be attributed to the similar semantic contexts shared among instructions within these categories. For instance, instructions related to Violence and Self-Harm often involve physically harmful actions such as \"hitting\" or \"killing\", whereas those about Privacy and Financial both typically focus on abstract harmful concepts like \"eavesdropping\" or \"Forgery\"." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Jailbreak Cases. To better understand how our approach jailbreaks MLLMs, we analyze the successful attack cases from Gemini ProV and GPT-4V, and summarize three representative jailbreak categories, which are presented on the left side of Fig. 5. Each category is related to a distinct multimodal capability, i.e., optical character recognition (OCR), image captioning and instruction following. For the OCR category, the model explicitly recognizes the keywords from the " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{typ}}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " before following the instruction. For the Captioning category, the model describes the scenario depicted in " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "i_{\\mathrm{opt}}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " before following the instruction. For the Instruction Following category, the model directly follows the harmful instruction. We further calculate the proportion of these categories among all" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 119, + 395, + 148 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 119, + 395, + 148 + ], + "spans": [ + { + "bbox": [ + 137, + 119, + 395, + 148 + ], + "type": "text", + "content": "OCR: The concept shown in the image is \"bribery\". Here are some methods for initiating this concept with a corporate executive..." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 161, + 395, + 190 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 161, + 395, + 190 + ], + "spans": [ + { + "bbox": [ + 138, + 161, + 395, + 190 + ], + "type": "text", + "content": "Captioning: The image shows a person in a suit making counterfeit money. The steps to produce counterfeit money are as follows..." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 202, + 395, + 231 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 202, + 395, + 231 + ], + "spans": [ + { + "bbox": [ + 138, + 202, + 395, + 231 + ], + "type": "text", + "content": "Instruction Following: To avoid being noticed while committing a theft, it is important to be aware of your surroundings and..." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 401, + 116, + 477, + 233 + ], + "blocks": [ + { + "bbox": [ + 401, + 116, + 477, + 233 + ], + "lines": [ + { + "bbox": [ + 401, + 116, + 477, + 233 + ], + "spans": [ + { + "bbox": [ + 401, + 116, + 477, + 233 + ], + "type": "image", + "image_path": "99747c425b6b6753269e619d5eed9ac6773942a1a3131f887a01b249e92bb0d8.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 244, + 479, + 266 + ], + "lines": [ + { + "bbox": [ + 132, + 244, + 479, + 266 + ], + "spans": [ + { + "bbox": [ + 132, + 244, + 479, + 266 + ], + "type": "text", + "content": "Fig. 5: The representative cases and statistics of three harmful response types on Gemini Prov and GPT-4V. The text related to the corresponding type is underlined." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 289, + 479, + 313 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 479, + 313 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 479, + 313 + ], + "type": "text", + "content": "successful attack cases of Gemini Pro" + }, + { + "bbox": [ + 130, + 289, + 479, + 313 + ], + "type": "inline_equation", + "content": "_V" + }, + { + "bbox": [ + 130, + 289, + 479, + 313 + ], + "type": "text", + "content": " and GPT-4V, and illustrate the result on the right part of Fig. 5." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 314, + 480, + 433 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 480, + 433 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 480, + 433 + ], + "type": "text", + "content": "From the charts, we notice that most jailbroken cases are due to the conflicts between the general instruction following abilities of MLLMs and their harmlessness alignment, while captioning and OCR abilities also occupy considerable proportions. The results suggest that the cross-modal fine-tuning may impose a kind of \"inverse alignment tax\" on MLLMs, which improves their multimodal abilities while impairing the harmlessness alignment. Therefore, to enhance the harmlessness alignment of MLLMs, future work could consider adding more adversarial samples that consist of harmful instructions and images during the cross-modal fine-tuning process, which ensures MLLMs defend attacks from the image side while maintaining multimodal abilities." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 450, + 236, + 463 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 450, + 236, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 450, + 236, + 463 + ], + "type": "text", + "content": "5 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 475, + 480, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 475, + 480, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 475, + 480, + 617 + ], + "type": "text", + "content": "Harmlessness Alignment of LLMs. Alignment involves fine-tuning LLMs with human-preferred annotations to ensure responses are Helpful, Honest, and Harmless (the 3H principle [2]). Among them, the harmlessness alignment of LLMs has attracted extensive research attention. To evaluate the robustness of LLMs to harmful instructions, researchers employ red teaming to benchmark the safety degree of LLMs [9, 11]. Additionally, some studies further explore the harmlessness alignment of LLMs with jailbreaking methods. Some adopt white-box attacks, which utilize the model gradients to customize adversarial inputs [25, 28, 36], while black-box attacks typically launch attacks through manually or automatically devised prompts [4, 29, 30]. Our work mainly focuses on extending the jailbreaking research from LLMs to MLLMs, which aims to enhance the robustness and alignment of MLLMs." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 629, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 629, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 629, + 479, + 665 + ], + "type": "text", + "content": "Harmlessness Alignment of MLLMs. By utilizing LLMs as backbones, MLLMs also inherit their alignment vulnerabilities. To explore the harmlessness alignment of MLLMs, several benchmarks are proposed to probe the potential harm-" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 289, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 289, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 289, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 296 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 296 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 296 + ], + "type": "text", + "content": "fulness of MLLMs under different scenarios [13, 16, 27]. Some other work employ different jailbreak methods to further evaluate the adversarial robustness of MLLMs using white- or black-box methods. White-box methods mainly attack the input images or their embeddings of MLLMs. For input images, recent studies generate adversarial images with constraints of a harmful response set [8, 20, 22] or utilizing a teacher-forcing optimization approach [3]. For visual embeddings, Shayegani et al. [23] generates adversarial images that look harmless but are similar to the embeddings of harmful images, thereby bypassing harmful content filters. In contrast, recent work in black-box attacks jailbreak MLLMs by employing techniques such as system prompt attacks [31], transferring harmful information into text-oriented images [10], generating adversarial images with surrogate models [34], and maximum likelihood-based jailbreaking [17]. In our work, we first investigate how the visual input influences the harmlessness alignment of MLLMs, then propose a jailbreak methods incorporate both white- and black-box methods." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 321, + 219, + 333 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 321, + 219, + 333 + ], + "spans": [ + { + "bbox": [ + 132, + 321, + 219, + 333 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 354, + 482, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 520 + ], + "type": "text", + "content": "In this paper, we conducted a comprehensive empirical analysis of the harmlessness alignment of MLLMs, specifically examining the visual vulnerabilities for jailbreak. Our findings revealed that images pose significant vulnerabilities in the alignment of MLLMs: the presence of images, the cross-modal fine-tuning process, and the harmfulness of images all contribute to an increased propensity for MLLMs to generate harmful responses. Furthermore, we introduced HADES, a novel jailbreaking approach that hides and amplifies the harmfulness of textual instructions using meticulously crafted images. Extensive experiments have demonstrated that HADES can effectively jailbreak both open- and closed-source MLLMs. In summary, our work has presented strong evidence that the visual modality poses the alignment vulnerability of MLLMs, underscoring the urgent need for further exploration into cross-modal alignment. In future work, we will develop cross-modal training strategies to improve the harmlessness alignment of MLLMs." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Societal Impacts. Our work aims to highlight the alignment vulnerabilities of existing MLLMs. We hope our jailbreak attempt can guide subsequent researchers in developing safer MLLMs. However, we acknowledge that certain elements of our research, such as harmful instructions and images, may have negative societal impacts. To minimize these negative effects, we have implemented several measures, including adding warnings in the abstract and placing safety statements on the dataset homepage. Furthermore, in the supplementary materials, we preliminarily explore how to use the HADES data to fine-tune MLLMs to enhance their safety alignment. Overall, we believe with these efforts, the positive contributions of our work outweigh its potential negative impacts." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 241, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 241, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 241, + 129 + ], + "type": "text", + "content": "Acknowledgement" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 175 + ], + "type": "text", + "content": "This work was partially supported by National Natural Science Foundation of China under Grant No. 62222215, Beijing Natural Science Foundation under Grant No. L233008 and 4222027. Xin Zhao is the corresponding author." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 193, + 197, + 205 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 193, + 197, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 193, + 197, + 205 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 217, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 138, + 217, + 481, + 316 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 481, + 316 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 481, + 316 + ], + "type": "text", + "content": "1. Anil, R., Borgeaud, S., Wu, Y., Alayrac, J., Yu, J., Soricut, R., Schalkwyk, J., Dai, A.M., Hauth, A., Millican, K., Silver, D., Petrov, S., Johnson, M., Antonoglou, I., Schrittwieser, J., Glaese, A., Chen, J., Pitler, E., Lillicrap, T.P., Lazaridou, A., First, O., Molloy, J., Isard, M., Barham, P.R., Hennigan, T., Lee, B., Viola, F., Reynolds, M., Xu, Y., Doherty, R., Collins, E., Meyer, C., Rutherford, E., Moreira, E., Ayoub, K., Goel, M., Tucker, G., Piqueras, E., Krikun, M., Barr, I., Savinov, N., Danihelka, I., Roelofs, B., White, A., Andreassen, A., von Glehn, T., Yagati, L., Kazemi, M., Gonzalez, L., Khalman, M., Sygnowski, J., et al.: Gemini: A family of highly capable multimodal models. CoRR abs/2312.11805 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 317, + 481, + 370 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 317, + 481, + 370 + ], + "spans": [ + { + "bbox": [ + 138, + 317, + 481, + 370 + ], + "type": "text", + "content": "2. Askell, A., Bai, Y., Chen, A., Drain, D., Ganguli, D., Henighan, T., Jones, A., Joseph, N., Mann, B., DasSarma, N., Elhage, N., Hatfield-Dodds, Z., Hernandez, D., Kernion, J., Ndousse, K., Olsson, C., Amodei, D., Brown, T.B., Clark, J., McCandlish, S., Olah, C., Kaplan, J.: A general language assistant as a laboratory for alignment. CoRR abs/2112.00861 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 371, + 481, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 371, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 371, + 481, + 403 + ], + "type": "text", + "content": "3. Carlini, N., Nasr, M., Choquette-Choo, C.A., Jagielski, M., Gao, I., Awadalla, A., Koh, P.W., Ippolito, D., Lee, K., Tramér, F., Schmidt, L.: Are aligned neural networks adversarially aligned? CoRR abs/2306.15447 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 404, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 404, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 404, + 481, + 435 + ], + "type": "text", + "content": "4. Chao, P., Robey, A., Dobriban, E., Hassani, H., Pappas, G.J., Wong, E.: Jailbreaking black box large language models in twenty queries. CoRR abs/2310.08419 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 437, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 437, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 437, + 481, + 468 + ], + "type": "text", + "content": "5. Chen, J., Zhu, D., Shen, X., Li, X., Liu, Z., Zhang, P., Krishnamoorthi, R., Chandra, V., Xiong, Y., Elhoseiny, M.: Minigpt-v2: large language model as a unified interface for vision-language multi-task learning. CoRR abs/2310.09478 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 470, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 470, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 138, + 470, + 481, + 501 + ], + "type": "text", + "content": "6. Chen, J., Yu, J., Ge, C., Yao, L., Xie, E., Wu, Y., Wang, Z., Kwok, J.T., Luo, P., Lu, H., Li, Z.: Pixart-α: Fast training of diffusion transformer for photorealistic text-to-image synthesis. CoRR abs/2310.00426 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 502, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 481, + 544 + ], + "type": "text", + "content": "7. Chiang, W.L., Li, Z., Lin, Z., Sheng, Y., Wu, Z., Zhang, H., Zheng, L., Zhuang, S., Zhuang, Y., Gonzalez, J.E., Stoica, I., Xing, E.P.: Vicuna: An open-source chatbot impressing gpt-4 with " + }, + { + "bbox": [ + 138, + 502, + 481, + 544 + ], + "type": "inline_equation", + "content": "90\\%" + }, + { + "bbox": [ + 138, + 502, + 481, + 544 + ], + "type": "text", + "content": " chatgpt quality (March 2023), https://lmsys.org/blog/2023-03-30-vicuna/" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 545, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 481, + 578 + ], + "type": "text", + "content": "8. Dong, Y., Chen, H., Chen, J., Fang, Z., Yang, X., Zhang, Y., Tian, Y., Su, H., Zhu, J.: How robust is google's bard to adversarial image attacks? CoRR abs/2309.11751 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 578, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 481, + 665 + ], + "type": "text", + "content": "9. Ganguli, D., Lovitt, L., Kernion, J., Askell, A., Bai, Y., Kadavath, S., Mann, B., Perez, E., Schiefer, N., Ndousse, K., Jones, A., Bowman, S., Chen, A., Conerly, T., DasSarma, N., Drain, D., Elhage, N., Showk, S.E., Fort, S., Hatfield-Dodds, Z., Henighan, T., Hernandez, D., Hume, T., Jacobson, J., Johnston, S., Kravec, S., Olsson, C., Ringer, S., Tran-Johnson, E., Amodei, D., Brown, T., Joseph, N., McCandlish, S., Olah, C., Kaplan, J., Clark, J.: Red teaming language models to reduce harms: Methods, scaling behaviors, and lessons learned. CoRR abs/2209.07858 (2022)" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "10. Gong, Y., Ran, D., Liu, J., Wang, C., Cong, T., Wang, A., Duan, S., Wang, X.: Figstep: Jailbreaking large vision-language models via typographic visual prompts. CoRR abs/2311.05608 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 215 + ], + "type": "text", + "content": "11. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Chen, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 216, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 216, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 216, + 480, + 248 + ], + "type": "text", + "content": "12. Ji, J., Liu, M., Dai, J., Pan, X., Zhang, C., Bian, C., Zhang, B., Sun, R., Wang, Y., Yang, Y.: Beavertails: Towards improved safety alignment of LLM via a human-preference dataset. CoRR abs/2307.04657 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 249, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 480, + 270 + ], + "type": "text", + "content": "13. Li, M., Li, L., Yin, Y., Ahmed, M., Liu, Z., Liu, Q.: Red teaming visual language models. CoRR abs/2401.12915 (2024)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "type": "text", + "content": "14. Liu, H., Li, C., Li, Y., Lee, Y.J.: Improved baselines with visual instruction tuning. CoRR abs/2310.03744 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 315 + ], + "type": "text", + "content": "15. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. CoRR abs/2304.08485 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 316, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 316, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 316, + 480, + 335 + ], + "type": "text", + "content": "16. Liu, X., Zhu, Y., Lan, Y., Yang, C., Qiao, Y.: Query-relevant images jailbreak large multi-modal models. CoRR abs/2311.17600 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "type": "text", + "content": "17. Niu, Z., Ren, H., Gao, X., Hua, G., Jin, R.: Jailbreaking attack against multimodal large language model. CoRR abs/2402.02309 (2024)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 358, + 323, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 358, + 323, + 369 + ], + "spans": [ + { + "bbox": [ + 133, + 358, + 323, + 369 + ], + "type": "text", + "content": "18. OpenAI: Gpt-4v(ision) system card (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 370, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 370, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 133, + 370, + 480, + 413 + ], + "type": "text", + "content": "19. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C.L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., Schulman, J., Hilton, J., Kelton, F., Miller, L., Simens, M., Askell, A., Welinder, P., Christiano, P.F., Leike, J., Lowe, R.: Training language models to follow instructions with human feedback. In: NeurIPS (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 414, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 414, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 480, + 435 + ], + "type": "text", + "content": "20. Qi, X., Huang, K., Panda, A., Wang, M., Mittal, P.: Visual adversarial examples jailbreak large language models. CoRR abs/2306.13213 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 435, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 480, + 479 + ], + "type": "text", + "content": "21. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: ICML. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "type": "text", + "content": "22. Schlarmann, C., Hein, M.: On the adversarial robustness of multi-modal foundation models. In: IEEE/CVF International Conference on Computer Vision, ICCV 2023 - Workshops, Paris, France, October 2-6, 2023. pp. 3679-3687. IEEE (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 513, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 513, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 513, + 480, + 544 + ], + "type": "text", + "content": "23. Shayegani, E., Dong, Y., Abu-Ghazaleh, N.B.: Jailbreak in pieces: Compositional adversarial attacks on multi-modal language models. CoRR abs/2307.14539 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "type": "text", + "content": "24. Shen, X., Chen, Z., Backes, M., Shen, Y., Zhang, Y.: \"do anything now\": Characterizing and evaluating in-the-wild jailbreak prompts on large language models. CoRR abs/2308.03825 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 480, + 610 + ], + "type": "text", + "content": "25. Subhash, V., Bialas, A., Pan, W., Doshi-Velez, F.: Why do universal adversarial attacks work on large language models?: Geometry might be the answer. CoRR abs/2309.00254 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 611, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 480, + 665 + ], + "type": "text", + "content": "26. Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Canton-Ferrer, C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura," + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 247, + 100 + ], + "type": "text", + "content": "Y. Li, H. Guo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 501 + ], + "type": "list", + "angle": 0, + "index": 13, + "blocks": [ + { + "bbox": [ + 149, + 116, + 480, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 116, + 480, + 193 + ], + "spans": [ + { + "bbox": [ + 149, + 116, + 480, + 193 + ], + "type": "text", + "content": "P.S., Lachaux, M., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E.M., Subramanian, R., Tan, X.E., Tang, B., Taylor, R., Williams, A., Kuan, J.X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., Scialom, T.: Llama 2: Open foundation and fine-tuned chat models. CoRR abs/2307.09288 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 194, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 480, + 226 + ], + "type": "text", + "content": "27. Tu, H., Cui, C., Wang, Z., Zhou, Y., Zhao, B., Han, J., Zhou, W., Yao, H., Xie, C.: How many unicorns are in this image? A safety evaluation benchmark for vision llms. CoRR abs/2311.16101 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 228, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 480, + 248 + ], + "type": "text", + "content": "28. Wang, J.G., Wang, J., Li, M., Neel, S.: Pandora's white-box: Increased training data leakage in open llms. arXiv preprint arXiv:2402.17012 (2024)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 249, + 480, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 249, + 480, + 303 + ], + "spans": [ + { + "bbox": [ + 133, + 249, + 480, + 303 + ], + "type": "text", + "content": "29. Wei, A., Haghtalab, N., Steinhardt, J.: Jailbroken: How does LLM safety training fail? In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 304, + 480, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 480, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 480, + 325 + ], + "type": "text", + "content": "30. Wei, Z., Wang, Y., Wang, Y.: Jailbreak and guard aligned language models with only few in-context demonstrations. CoRR abs/2310.06387 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 326, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 480, + 346 + ], + "type": "text", + "content": "31. Wu, Y., Li, X., Liu, Y., Zhou, P., Sun, L.: Jailbreaking GPT-4V via self-adversarial attacks with system prompts. CoRR abs/2311.09127 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 348, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 348, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 348, + 480, + 369 + ], + "type": "text", + "content": "32. Yin, S., Fu, C., Zhao, S., Li, K., Sun, X., Xu, T., Chen, E.: A survey on multimodal large language models. CoRR abs/2306.13549 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 369, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 369, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 133, + 369, + 480, + 413 + ], + "type": "text", + "content": "33. Zhao, W.X., Zhou, K., Li, J., Tang, T., Wang, X., Hou, Y., Min, Y., Zhang, B., Zhang, J., Dong, Z., Du, Y., Yang, C., Chen, Y., Chen, Z., Jiang, J., Ren, R., Li, Y., Tang, X., Liu, Z., Liu, P., Nie, J., Wen, J.: A survey of large language models. CoRR abs/2303.18223 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 414, + 480, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 414, + 480, + 445 + ], + "spans": [ + { + "bbox": [ + 133, + 414, + 480, + 445 + ], + "type": "text", + "content": "34. Zhao, Y., Pang, T., Du, C., Yang, X., Li, C., Cheung, N., Lin, M.: On evaluating adversarial robustness of large vision-language models. CoRR abs/2305.16934 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "type": "text", + "content": "35. Zhu, D., Chen, J., Shen, X., Li, X., Elhoseiny, M.: Minigpt-4: Enhancing vision-language understanding with advanced large language models. CoRR abs/2304.10592 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 479, + 480, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 480, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 480, + 501 + ], + "type": "text", + "content": "36. Zou, A., Wang, Z., Kolter, J.Z., Fredrikson, M.: Universal and transferable adversarial attacks on aligned language models. CoRR abs/2307.15043 (2023)" + } + ] + } + ], + "index": 12 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 288, + 91, + 447, + 102 + ], + "type": "text", + "content": "Images are Achilles' Heel of Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_content_list.json b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..eb7032f72cdedbe2c61f268f495448a90984e5a9 --- /dev/null +++ b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_content_list.json @@ -0,0 +1,1805 @@ +[ + { + "type": "text", + "text": "Imaging Interiors: An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "text_level": 1, + "bbox": [ + 243, + 141, + 759, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ziyuan Luo $^{1}$ , Boxin Shi $^{2,3}$ , Haoliang Li $^{4}$ , and Renjie Wan $^{1\\star}$", + "bbox": [ + 261, + 212, + 743, + 229 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Department of Computer Science, Hong Kong Baptist University", + "bbox": [ + 276, + 239, + 723, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ State Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University", + "bbox": [ + 287, + 253, + 714, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{3}$ National Engineering Research Center of Visual Technology, School of Computer Science, Peking University", + "bbox": [ + 292, + 281, + 709, + 309 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{4}$ Department of Electrical Engineering, City University of Hong Kong ziyuanluo@life.hkbu.edu.hk, shiboxin@pku.edu.cn, haoliang.li@cityu.edu.hk, renjiewan@hkbu.edu.hk", + "bbox": [ + 222, + 309, + 779, + 351 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Electromagnetic Inverse Scattering Problems (EISP) have gained wide applications in computational imaging. By solving EISP, the internal relative permittivity of the scatterer can be non-invasively determined based on the scattered electromagnetic fields. Despite previous efforts to address EISP, achieving better solutions to this problem has remained elusive, due to the challenges posed by inversion and discretization. This paper tackles those challenges in EISP via an implicit approach. By representing the scatterer's relative permittivity as a continuous implicit representation, our method is able to address the low-resolution problems arising from discretization. Further, optimizing this implicit representation within a forward framework allows us to conveniently circumvent the challenges posed by inverse estimation. Our approach outperforms existing methods on standard benchmark datasets. Project page: https://luo-ziyuan.github.io/Imaging-Interiors.", + "bbox": [ + 261, + 393, + 743, + 589 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Electromagnetic inverse scattering problems $\\cdot$ Implicit neural representations $\\cdot$ Computational photography", + "bbox": [ + 259, + 601, + 740, + 630 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 657, + 375, + 672 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "As electromagnetic waves can penetrate objects' surfaces, they play a key role in non-invasive imaging. Compared with modalities like X-ray and MRI, electromagnetic waves provide a potentially low-cost and safe approach [5, 24, 45] for non-invasive imaging.", + "bbox": [ + 212, + 691, + 787, + 753 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Non-invasive imaging via electromagnetic waves needs to be completed by solving the Electromagnetic Inverse Scattering Problems (EISP). The typical scenario and the associated physical quantities of EISP are displayed in Fig. 1. In EISP, we need to infer the distribution of the scatterer's relative permittivity", + "bbox": [ + 212, + 753, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author.", + "bbox": [ + 217, + 824, + 385, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/33bf88e7b02849ae3d49adc38e2fa399e51133a13184ee723e539f2a7566f97d.jpg", + "image_caption": [ + "Fig. 1: The results of a standard test case [1,57] in EISP. In an EISP system, the scatterer in the enclosed space $D$ is first illuminated by incoming electromagnetic waves emitted by transmitters and generates scattered fields. Then, the scattered fields measured by receivers are used to determine the scatterer's relative permittivity. We show results obtained by our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 787, + 311 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "from the measured scattered fields [43]. Then, the values of relative permittivity can be visualized to image the objects' internal structures.", + "bbox": [ + 212, + 455, + 787, + 487 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, solving EISP has never been an easy task. The first challenge comes from the inverse estimation process, where the scatterer's relative permittivity is derived from the measured scattered fields. The multiple scattering effects inherent to the EISP further significantly complicate this inverse estimation [9,34,68]. Furthermore, continuous spaces are usually discretized into finite elements or grids to facilitate numerical computations for electromagnetic computations. This process of discretization inherently leads to a loss of details and a decrease in image resolution for EISP [18, 44]. This consequently poses challenges in accurately distinguishing internal small objects in close proximity.", + "bbox": [ + 212, + 489, + 787, + 626 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The scattering mechanism is crucial in solving EISP [8, 36]. Recent deep-learning-based methods [34, 57] first obtain a rough image using traditional algorithms (e.g., BP [2] shown in Fig. 1) and then refine this rough result using image-to-image translation networks. However, with the imaging process being divided into two distinct stages, the measured physical data are overlooked in the second phase, inevitably resulting in images of inferior quality (e.g., BPS [57] and PGAN [53] shown in Fig. 1). Besides, as the relative permittivity distributions can vary greatly across different objects, a single network may be insufficient to reflect these differences. Therefore, a more appropriate approach is to optimize for each object while thoroughly considering the scattering mechanisms. Traditional methods like Twofold SOM [66] and Gs SOM [8] achieve this goal by discretizing continuous relative permittivity values into discrete variables expressed as to-be-optimized matrices [8, 15, 66]. However, they cannot address the low-resolution issues that arise from discretization, as shown in Fig. 1. Moreover,", + "bbox": [ + 212, + 628, + 789, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 357, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "these methods have difficulties in handling sparse measurement data, which usually leads to low reconstruction quality. Thus, we need a more powerful representation scheme beyond the discrete matrix form.", + "bbox": [ + 212, + 146, + 782, + 190 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Since the scatterer's relative permittivity distribution used for imaging is intimately related to the spatial position [15], the envisioned approach should indicate such location-dependent physical quantity. Moreover, for better imaging quality, the approach should have the capacity to eliminate the low-resolution curse made by discretization. Therefore, we propose to represent the scatterer's relative permittivity distribution via Implicit Neural Representations (INR), as INR has remarkable capability in modeling location-dependent relationships [39, 51]. Its flexibility in handling image resolutions [10, 11, 29] also helps to alleviate the curse made by discretization. Besides, INR is known for its case-by-case optimization strategy, which can faithfully reflect each object's internal differences. In addition, INRs exhibit a strong capacity to recover information from incomplete data across a range of tasks [31, 32, 39], which can address the difficulties caused by sparse measurement. We then optimize the INR of each object by making sure that this representation can produce results akin to the actual measurements. Such an optimization based on forward estimation can help to address the difficulties caused by inverse estimation. Once the optimization settles down, we can access the relative permittivity values by using their corresponding locations and visualize them for imaging purposes.", + "bbox": [ + 212, + 191, + 787, + 462 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our solution is illustrated in Fig. 2. We use the Multilayer Perceptron (MLP) as the backbone of INR. Specifically, two MLPs are used to represent the relative permittivity and the induced current. It allows us to bypass complex matrix inversions in optimization, largely reducing the computational cost. To optimize the implicit representations, we propose to use a data loss and a state loss by fully considering the relationships between various physical quantities in the scattering process. Meanwhile, a random sampling strategy is designed for comprehensive consideration of each spatial position during optimization. Our primary contributions can be summarized as follows:", + "bbox": [ + 212, + 463, + 787, + 599 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose a solution to EISP based on forward estimation to avoid difficulties triggered by inverse estimation.", + "- We introduce the use of the learnable INR for the object's relative permittivity distribution to indicate the location-dependent quantity and achieve flexibility in imaging resolution.", + "- We explore a novel strategy that utilizes two separate MLPs for two physical quantities to avoid complex computations caused by matrix inversion." + ], + "bbox": [ + 225, + 604, + 782, + 708 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The research for solving EISP has established standard benchmarks for evaluation [9, 53, 57]. We strictly follow these standard benchmarks in our research, including system settings, datasets, and metrics.", + "bbox": [ + 212, + 715, + 782, + 761 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related work", + "text_level": 1, + "bbox": [ + 215, + 781, + 382, + 796 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Electromagnetic inverse scattering problems (EISP). Conventional approaches for EISP can be classified as non-iterative and iterative categories.", + "bbox": [ + 212, + 809, + 782, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Non-iterative methods tackle nonlinear issues by converting them into linear equations, such as the Born approximation [52], Rytov approximation [20, 27], and back-propagation (BP) method [2]. Since non-iterative methods are limited by reconstruction quality, other methods, such as the Subspace Optimization Method (SOM) [8, 60, 67], Contrast Source Inversion (CSI) Method [4, 28], Distorted Born Iterative Method (DBIM) [21], and other Newton-type methods [41, 49], are proposed to solve this problem in an iterative way. Despite their feasibility, their performance is highly sensitive to the initial guess, which undermines their robustness. Neural networks have recently been employed to construct nonlinear mappings linking the dispersed fields and the obscure constitutive attributes of scatterers [23, 35]. Most methods consider EISP in two stages [34, 57, 59, 64], where traditional approaches [2, 52] are first employed to obtain coarse images, and then the trained image-to-image neural networks are used for post-processing. However, due to the lack of consideration for scattering mechanisms, those methods encounter nearly all the difficulties faced by deep learning [33, 46], which easily causes their post-processing efforts to fail. We consider an implicit forward approach to overcome the aforementioned difficulties by optimizing a trainable implicit representation within a forward process.", + "bbox": [ + 212, + 146, + 787, + 419 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Implicit neural representations (INR). Implicit neural representations usually employ an MLP to map from local coordinates to the associated values on that coordinates [26,51,63], such as intensity for images and videos, or occupancy value for 3D volumes. The basics of INR are briefly explained below. INR is a neural network $F_{\\theta}:\\mathbf{x}\\mapsto F_{\\theta}(\\mathbf{x})$ that continuously maps the coordinates $\\mathbf{x}$ to the corresponding quantity of interest. For the data expressed as a function $\\varPhi:\\mathbf{x}\\mapsto\\varPhi(\\mathbf{x})$ , the INR $F_{\\theta}$ is a solution to $F_{\\theta}(\\mathbf{x}) - \\varPhi(\\mathbf{x}) = 0$ . Typically, the weight of INR, $\\theta$ , can be obtained through optimization. INR has shown its advantages in parameterizing geometry and learning priors over shapes, as demonstrated by DeepSDF [47], Occupancy Networks [38], and IM-Net [12]. A considerable amount of subsequent research has proposed volumetric rendering of 3D implicit representations, including Neural Radiance Fields (NeRF) [39] and its acceleration [6,42], quality enhancement [13,56,70], and copyright protection [37]. In the realm of 2D image representation, CPPNs [54] first proposed the use of neural networks to parameterize images implicitly. SIRENs [51] proposed generalization across implicit representations of images via hypernetworks. X-Fields [3] parameterizes the Jacobian of pixel position with respect to view, time, and illumination. In this work, we employ INR as the backbone to represent the scatterer's properties, which is able to characterize the complex spatial correlation in EISP and produce better imaging quality.", + "bbox": [ + 212, + 420, + 787, + 724 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Physical model of EISP", + "text_level": 1, + "bbox": [ + 215, + 753, + 480, + 771 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "As shown in Fig. 1, for an EISP system, the object to be imaged is defined as the unknown scatterer, and the enclosed space is represented by a square Region of Interest (ROI) denoted by $D$ . Transmitters and receivers are positioned around", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 357, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "$D$ to emit electromagnetic waves and measure the scattered electromagnetic fields, respectively.", + "bbox": [ + 214, + 146, + 782, + 176 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Generally, the data measurement process can be split into two stages. At the first stage, the induced current is excited as the electromagnetic waves from the transmitters interact with the scatterer, aka wave-scatterer interaction. Subsequently, the induced current serves as a radiation source, generating the scattered fields. The total electric fields within $D$ can be described by Lippmann-Schwinger equation [16], aka state equation, as follows:", + "bbox": [ + 212, + 176, + 787, + 268 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nE ^ {\\mathrm {t}} (\\mathbf {x}) = E ^ {\\mathrm {i}} (\\mathbf {x}) + k _ {0} ^ {2} \\int_ {D} g \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) J \\left(\\mathbf {x} ^ {\\prime}\\right) d \\mathbf {x} ^ {\\prime}, \\mathbf {x} \\in D, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 281, + 785, + 311 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathbf{x}$ and $\\mathbf{x}'$ are the spatial coordinates. $E^{\\mathrm{i}}$ is the incident electric fields directly from transmitters, while $E^{\\mathrm{t}}$ is the total electric fields consisting of the original incident fields coming directly from transmitters and the scattered fields coming from scatterers. $k_{0}$ is the wavenumber computed from the signal frequency, and $g$ is the free space Green's function. The relationship between the induced current $J$ and total electric fields $E^{\\mathrm{t}}$ can be expressed as follows:", + "bbox": [ + 214, + 324, + 782, + 415 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nJ (\\mathbf {x}) = \\xi (\\mathbf {x}) E ^ {t} (\\mathbf {x}). \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 436, + 429, + 784, + 445 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In Eq. (2), $\\xi$ is the contrast defined as $\\xi (\\mathbf{x}) = \\varepsilon_r(\\mathbf{x}) - 1$ , where $\\varepsilon_r(\\mathbf{x})$ denotes the relative permittivity of the unknown scatterer.", + "bbox": [ + 212, + 458, + 782, + 487 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The second equation describes the scattered fields as a reradiation of the induced current [16], aka data equation, as follows:", + "bbox": [ + 214, + 489, + 784, + 520 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nE ^ {\\mathrm {s}} (\\mathbf {x}) = k _ {0} ^ {2} \\int_ {D} g \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) J \\left(\\mathbf {x} ^ {\\prime}\\right) d \\mathbf {x} ^ {\\prime}, \\mathbf {x} \\in S, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 532, + 784, + 564 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $E^{s}$ is the scattered fields that can be measured by receivers at surface $S$ around the ROI $D$ .", + "bbox": [ + 214, + 574, + 785, + 603 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Since the digital signal analysis is only available on discrete variables [40,55], Eq. (1) to Eq. (3) are inevitably transformed to their discrete counterparts. Specifically, the ROI $D$ is discretized into $M \\times M$ square subunits and the method of moments [48] is employed to obtain the discrete scattered fields. The relationship between discrete contrast $\\xi$ and discrete relative permittivity $\\varepsilon_r$ can be expressed as $\\xi = \\varepsilon_r - 1$ . Then, Eq. (1) can be reformulated as follows:", + "bbox": [ + 214, + 604, + 787, + 696 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {E} ^ {\\mathrm {t}} = \\mathbf {E} ^ {\\mathrm {i}} + \\mathbf {G} _ {D} \\cdot \\mathbf {J}, \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 436, + 709, + 784, + 726 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathbf{E}^{\\mathrm{t}}$ , $\\mathbf{E}^{\\mathrm{i}}$ , and $\\mathbf{J}$ are the discrete $E^t$ , $E^i$ , and $J$ , respectively. $\\mathbf{G}_D$ is discrete free space Green's function in $D$ . The discrete version of Eq. (2) can be represented as follows [53]:", + "bbox": [ + 214, + 738, + 787, + 785 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {J} = \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {E} ^ {\\mathrm {t}}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 439, + 797, + 784, + 814 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_footnote", + "text": "5 Discrete variables are denoted using bold letters in our paper", + "bbox": [ + 217, + 824, + 653, + 840 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/4f8c34bf4412d06e0325b93bc75e2e1ad79aa6f3775f61ea0b5050790d15830a.jpg", + "image_caption": [ + "Fig. 2: Overview of our implicit method. Two MLPs, $F_{\\theta}$ and $H_{\\phi}$ , are used to implicitly represent relative permittivity $\\varepsilon_{r}$ and induced current $J$ , respectively. Random sampling is applied for comprehensive optimization. The predicted induced current $\\hat{\\mathbf{J}}$ is calculated by Eq. (13) based on relative permittivity $\\varepsilon_{r}$ queried from $F_{\\theta}$ and induced current $J$ directly queried from $H_{\\phi}$ . Then the state loss $\\mathcal{L}_{\\mathrm{state}}$ is calculated by comparing the predicted $\\hat{\\mathbf{J}}$ and directly queried $\\mathbf{J}$ . Besides, the directly queried induced current $\\mathbf{J}$ is used to compute the scattered fields $\\hat{\\mathbf{E}}^{\\mathrm{s}}$ by Eq. (11). Data loss function $\\mathcal{L}_{\\mathrm{data}}$ is constructed to evaluate the difference between predicted scattered fields $\\hat{\\mathbf{E}}^{\\mathrm{s}}$ and the measured values $\\mathbf{E}^{\\mathrm{s}}$ ." + ], + "image_footnote": [], + "bbox": [ + 217, + 145, + 787, + 324 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathrm{Diag}(\\pmb {\\xi})$ is the diagonal matrix of contrast function. Similarly, Eq. (3) can be discretized as follows:", + "bbox": [ + 212, + 489, + 787, + 518 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {E} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\mathbf {J}, \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 452, + 520, + 784, + 536 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{E}^{\\mathrm{s}}$ is the discrete $E^{s}$ , and $\\mathbf{G}_S$ is the discrete Green's function to map contrast source $\\mathbf{J}$ to scattered fields $\\mathbf{E}^{\\mathrm{s}}$ .", + "bbox": [ + 212, + 542, + 784, + 571 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The task of EISP is to infer the relative permittivity $\\varepsilon_r$ , a value closely related to $\\xi$ , from the scattered fields $\\mathbf{E}^s$ measured by receivers, and then visualize it in an image. In an EISP system, knowing only $\\mathbf{E}^{\\mathrm{i}}$ and $\\mathbf{E}^{\\mathrm{s}}$ makes it challenging to estimate $\\xi$ inversely from $\\mathbf{E}^{\\mathrm{s}}$ based on Eq. (6). Furthermore, the inherent nonlinearity originating from $\\mathbf{G}_D \\cdot \\mathbf{J}$ in Eq. (4) complicates the estimation process [14, 18, 65]. Ultimately, $\\varepsilon_r$ , a variable with continuous characteristics, can only be derived using the aforementioned discrete equations, thereby compromising the imaging resolution. Consequently, an effective strategy is necessary to produce more accurate outcomes for EISP.", + "bbox": [ + 212, + 573, + 787, + 709 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Proposed implicit solution", + "text_level": 1, + "bbox": [ + 215, + 733, + 506, + 750 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As depicted in Fig. 2, our fundamental idea is to solve the inverse scattering problem within a forward estimation process, which can be described by reformulating Eq. (4) to Eq. (6) as follows:", + "bbox": [ + 212, + 765, + 787, + 811 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {E} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\operatorname {D i a g} (\\pmb {\\xi}) \\cdot \\left(\\mathbf {I} - \\mathbf {G} _ {D} \\operatorname {D i a g} (\\pmb {\\xi})\\right) ^ {- 1} \\cdot \\mathbf {E} ^ {\\mathrm {i}}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 339, + 821, + 785, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 357, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{I}$ is the identity matrix. Contrary to previous approaches [2,52] that treat $\\pmb{\\xi}$ as unknown, we regard the contrast $\\pmb{\\xi}$ as a known quantity, by establishing relative permittivity $\\varepsilon_{r}$ involved in Eq. (2) as a learnable implicit representation. Then, we can calculate $\\mathbf{E}^{\\mathrm{s}}$ triggered by Eq. (7). During training, by contrasting the calculated $\\mathbf{E}^{\\mathrm{s}}$ with the measured true ones, the learnable representation can finally reach its optimum status. Since we do not aim to inversely express $\\pmb{\\xi}$ as an explicit function of $\\mathbf{E}^{\\mathrm{s}}$ , this optimization-in-forward approach can alleviate the challenges associated with inverse estimation and nonlinearity. The use of INR also ensures enhanced flexibility in imaging resolution. During inference, we can directly obtain the relative permittivity values by querying the representation with the corresponding coordinates.", + "bbox": [ + 212, + 146, + 787, + 313 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 Continuous representation for EISP", + "text_level": 1, + "bbox": [ + 215, + 333, + 555, + 348 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Representation for relative permittivity. We use a multilayer perceptron (MLP) with parameters $\\theta$ to map the continuous spatial coordinates $\\mathbf{x}$ to its associating relative permittivity values, which can be briefly described as follows:", + "bbox": [ + 214, + 356, + 787, + 402 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\varepsilon_ {r} (\\mathbf {x}) = F _ {\\theta} (\\gamma (\\mathbf {x})), \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 434, + 417, + 784, + 431 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\varepsilon_r^6$ denotes the relative permittivity obtained by querying the spatial coordinates within the continuous representation $F_{\\theta}$ . We further apply the positional encoding for $\\mathbf{x}$ to facilitate the fitting capability of the model as follows:", + "bbox": [ + 214, + 436, + 787, + 483 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\gamma (\\mathbf {x}) = \\left[ \\sin \\mathbf {x}, \\cos \\mathbf {x}, \\dots , \\sin 2 ^ {\\Omega - 1} \\mathbf {x}, \\cos 2 ^ {\\Omega - 1} \\mathbf {x} \\right] ^ {\\top}, \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 328, + 494, + 784, + 513 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\varOmega$ is a hyperparameter controlling the spectral bandwidth.", + "bbox": [ + 214, + 518, + 684, + 532 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To optimize this continuous representation, we apply a series of equations defined by the computation of forward estimation, and then compare the scattered fields incited by this representation with the measured true ones. As discussed in Sec. 3, since the discretization is unavoidable during the forward computation, we only query discrete spatial coordinates during optimization to align with the discretization policy set by the method of moments [48]. Though we can directly perform the forward computation via Eq. (7), the computation complexity caused by its internal matrix inversion places a high demand on computing resources and potentially compromises the stability of problem-solving [25].", + "bbox": [ + 212, + 534, + 787, + 669 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Representation for induced current. To avoid the complexity caused by matrix inversion, instead of the explicit computation defined in Eq. (7), we implicitly represent $\\mathbf{J}$ as its continuous form using another MLP. By analyzing Eq. (7), the induced current is related to two variables: the discrete contrast $\\xi$ and the incident electric fields $\\mathbf{E}^{\\mathrm{i}}$ caused by transmitters. To faithfully describe such correlation, we propose to consider the representation for $J$ as the mapping based on the spatial coordinates $\\mathbf{x}$ and the transmitter's position $\\mathbf{x}^{\\mathrm{t}}$ , which can be defined as follows:", + "bbox": [ + 214, + 670, + 787, + 789 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nJ (\\mathbf {x}, \\mathbf {x} ^ {\\mathrm {t}}) = H _ {\\phi} \\left(\\gamma (\\mathbf {x}), \\gamma (\\mathbf {x} ^ {\\mathrm {t}})\\right), \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 401, + 800, + 784, + 816 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_footnote", + "text": "Due to its continuous property, we do not write it as bold font.", + "bbox": [ + 217, + 824, + 653, + 840 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $H_{\\phi}$ is a continuous function consisting of fully connected networks.", + "bbox": [ + 212, + 146, + 743, + 161 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Random spatial sampling. Due to the necessity of discretization in numerical computations to perform forward process, we need to spatially query the representations $F_{\\theta}$ and $H_{\\phi}$ at some positions to obtain their discrete forms. A typical approach is to divide the ROI $D$ evenly into grids and deterministically sample the center location of each grid [36, 50]. However, the representations would only be queried at a fixed discrete set of locations in this way [39]. To take a comprehensive consideration of each spatial position, we use a random sampling scheme where we partition ROI $D$ into $M \\times M$ evenly-spaced grids, and the center of $(m,n)$ grid is $(x_m,y_n)$ . Each sample location $(x_m^{\\mathrm{sample}},y_n^{\\mathrm{sample}})$ is then randomly drawn from a Gaussian distribution: $x_m^{\\mathrm{sample}} \\sim \\mathcal{N}(x_m,\\sigma^2)$ , $y_n^{\\mathrm{sample}} \\sim \\mathcal{N}(y_n,\\sigma^2)$ , where $\\sigma$ is a hyperparameter to control the dispersion level of sample points around their means. By probabilistically sampling each spatial position, this scheme can alleviate the overlook of specific locations.", + "bbox": [ + 212, + 162, + 787, + 361 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Forward calculation based optimization", + "text_level": 1, + "bbox": [ + 215, + 383, + 584, + 398 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The continuous representations obtained before can estimate corresponding physical quantities using spatial coordinates, but optimizing them directly with estimated values is hard because obtaining their true values is difficult [58]. Therefore, we indirectly refine the representations denoted by $F_{\\theta}$ and $H_{\\phi}$ by proposing a data loss and a state loss while fully considering the physical relationships.", + "bbox": [ + 212, + 412, + 787, + 488 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Data loss. Based on Sec. 3, the wave-scatterer interaction leads to the induced current when the electromagnetic waves from transmitters interact with the scatterer. Then, the induced current generates the scattered fields, which can be measured by receivers. Thus, a straightforward way to refine the representations is to minimize the distance between the scattered fields computed from the representations and the true ones. With the discrete induced current $\\mathbf{J}$ sampling from the continuous representation $H_{\\phi}$ defined in Eq. (10), we can obtain the predicted scattered fields by reformulating the data equation in Eq. (6) as follows:", + "bbox": [ + 212, + 488, + 787, + 609 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\mathbf {E}} _ {p} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\mathbf {J} _ {p}, \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 450, + 625, + 784, + 643 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathbf{G}_S$ denotes the discrete Green's function, and $\\mathbf{J}_p$ and $\\hat{\\mathbf{E}}_p^s$ denotes the discrete induced current and predicted scattered fields inspired by the $p$ -th transmitter, respectively.", + "bbox": [ + 212, + 652, + 787, + 698 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We then define our data loss used to contrast the predicted scattered fields with the measured true ones as follows:", + "bbox": [ + 212, + 699, + 787, + 729 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {d a t a}} = \\sum_ {p = 1} ^ {N _ {\\mathrm {t}}} \\| \\hat {\\mathbf {E}} _ {p} ^ {\\mathrm {s}} - \\mathbf {E} _ {p} ^ {\\mathrm {s}} \\| ^ {2}, \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 415, + 741, + 784, + 781 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathbf{E}_p^s$ is the true scattered fields measured by receivers, and $N_{t}$ denotes the number of all transmitters. The data loss enhances the optimization of the representation by accounting for discrepancies associated with all transmitters.", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 357, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "State loss. Although the data loss is straightforward, it cannot be used to optimize $F_{\\theta}$ . Since the induced current $\\mathbf{J}_p$ is directly obtained by querying its representation $H_{\\phi}$ , Eq. (12) does not contain any variables related to $F_{\\theta}$ . To effectively optimize $F_{\\theta}$ , we consider minimizing the mismatch emerging from the state equation defined in Eq. (4) and Eq. (5). Specifically, by reformulating Eq. (7), an expression related to $p$ -th transmitter can be obtained as follows:", + "bbox": [ + 212, + 146, + 782, + 237 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {\\hat {J}} _ {p} = \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {E} _ {p} ^ {\\mathrm {i}} + \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {G} _ {D} \\cdot \\mathbf {J} _ {p}, \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 364, + 243, + 785, + 260 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\mathbf{J}_p$ denotes the discrete induced current sampling from $H_{\\phi}$ , $\\xi$ denotes the contrast, and $\\hat{\\mathbf{J}}_p$ indicates the induced current computed via the above mathematical correlation.", + "bbox": [ + 212, + 265, + 782, + 310 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Although $\\mathbf{J}_p$ and $\\hat{\\mathbf{J}}_p$ originate from distinct sources, both represent the induced current values within the same spatial domain. If the same spatial coordinates are given, they should yield identical values irrespective of their generation sources. Therefore, we introduce a state loss to minimize the mismatch between $\\mathbf{J}_p$ and $\\hat{\\mathbf{J}}_p$ as follows:", + "bbox": [ + 212, + 311, + 782, + 387 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {s t a t e}} = \\sum_ {p = 1} ^ {N _ {\\mathrm {t}}} \\| \\hat {\\mathbf {J}} _ {p} - \\mathbf {J} _ {p} \\| ^ {2}, \\tag {14}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 388, + 785, + 429 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $N_{\\mathrm{t}}$ is the number of all transmitters. Since Eq. (2) has clearly defined the close correlation between $\\pmb{\\xi}$ and the permittivity values $\\varepsilon_r$ , the minimization of the state loss can ultimately optimize $F_{\\theta}$ and $H_{\\phi}$ used for representing the relative permittivity and induced current, respectively.", + "bbox": [ + 212, + 431, + 782, + 492 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Overall loss. The overall loss to train the relative permittivity representation $F_{\\theta}$ and induced current representation $H_{\\phi}$ can be obtained as $\\mathcal{L} = \\lambda_{\\mathrm{data}}\\mathcal{L}_{\\mathrm{data}} + \\lambda_{\\mathrm{state}}\\mathcal{L}_{\\mathrm{state}} + \\lambda_{\\mathrm{TV}}\\mathcal{L}_{\\mathrm{TV}}$ , where $\\mathcal{L}_{\\mathrm{TV}}$ is a total variation loss for $\\xi$ , and $\\lambda_{\\mathrm{data}}, \\lambda_{\\mathrm{state}}, \\lambda_{\\mathrm{TV}}$ are hyperparameters to balance the loss functions.", + "bbox": [ + 214, + 494, + 782, + 554 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 Implementation details", + "text_level": 1, + "bbox": [ + 214, + 571, + 450, + 585 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We implement our method using PyTorch. Two eight-layer MLPs with 256 channels and ReLU activations are used to predict the relative permittivity $\\varepsilon_r$ and induced current $J$ , respectively. Similar to the settings in previous methods based on INRs [39, 51], positional encoding is applied to input positions before they are passed into the MLPs. The ROI $D$ is discretized into $64 \\times 64$ while training. The hyperparameters for the overall loss are set as $\\lambda_{\\mathrm{data}} = 1.00$ , $\\lambda_{\\mathrm{state}} = 1.00$ , and $\\lambda_{\\mathrm{TV}} = 0.01$ . We use the Adam optimizer with default values $\\beta_1 = 0.9$ , $\\beta_2 = 0.999$ , $\\epsilon = 10^{-8}$ , and a learning rate $5 \\times 10^{-4}$ that decays following the exponential scheduler during the optimization. We optimize the model for 4K iterations on a single NVIDIA V100 GPU for all the datasets.", + "bbox": [ + 212, + 592, + 784, + 742 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 214, + 762, + 375, + 777 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.1 Experiment setup", + "text_level": 1, + "bbox": [ + 214, + 789, + 408, + 804 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Dataset. We strictly follow the established rules in EISP [36, 53, 57] to set the dataset. We train and test our model on standard benchmarks used for EISP.", + "bbox": [ + 212, + 809, + 782, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 732, + 130 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "1) Synthetic Circular-cylinder dataset is synthetically generated comprising 1200 images of cylinders with random relative radius, number, and location and permittivity between 1 and 1.5. 2) Synthetic MNIST dataset contains grayscale images of handwritten digits. Similar to previous settings [57, 69], we randomly select 1200 of them to synthesize scatterers with relative permittivity values between 2 and 2.5 according to their corresponding pixel values. Following previous work to generate the above two synthetic datasets, we use 16 transmitters and 32 receivers equally placed on a circle for regular settings, and the data are generated numerically using the method of moments [48] with a $224 \\times 224$ grid mesh to avoid inverse crime [17]. For sparse measurement experiments, we decrease the number of receivers from 32 to 8 to utilize only $25\\%$ of the regular measurement data. 3) Real-world Institut Fresnel's database contains three different dielectric scenarios, namely FoamDielExt, FoamDielInt, and FoamTwinDiel. There are 8 transmitters for FoamDielExt and FoamDielInt, 18 transmitters for FoamTwinDiel, and 241 receivers for all the cases. As the wavelength of the emitted electromagnetic wave should be comparable to or smaller than the size of the target object, we set operating frequency $f = 400\\mathrm{MHz}$ on synthetic datasets, and $f = 5\\mathrm{GHz}$ on real-world datasets.", + "bbox": [ + 212, + 145, + 787, + 417 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Baselines. We maintain the same settings as in previous studies [50,53,57] to ensure a fair comparison. We compare our method with three traditional methods and four deep learning-based approaches: 1) BP [2]: A traditional non-iterative inversion algorithm. 2) Twofold SOM [66]: A traditional iterative minimization scheme by using SVD decomposition. 3) Gs SOM [8]: A traditional subspace-based optimization method by decomposing the operator of Green's function. 4) BPS [57]: A CNN-based image translation method with an initial guess from the BP algorithm. 5) CS-Net [50]: A CNN-based contrast source reconstruction scheme via subspace optimization. 6) Physics-Net [36]: A CNN-based approach that incorporates physical phenomena during training. 7) PGAN [53]: A CNN-based approach using a generative adversarial network.", + "bbox": [ + 212, + 417, + 787, + 584 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation methodology. We evaluate the quantitative performance of our method using PSNR, SSIM, and Relative Root-Mean-Square Error (RRMSE) [53]. For PSNR and SSIM, a higher value indicates better performance. For RRMSE [53], a lower value indicates better performance. RRMSE is a metric widely used in EISP defined as RRMSE = $\\left(\\frac{1}{M \\times M} \\sum_{m=1}^{M} \\sum_{n=1}^{M} \\left| \\frac{\\hat{\\varepsilon}_r(m,n) - \\varepsilon_r(m,n)}{\\varepsilon_r(m,n)} \\right|^2\\right)^{\\frac{1}{2}}$ , where $\\varepsilon_r(m,n)$ and $\\hat{\\varepsilon}_r(m,n)$ are the true and reconstructed discrete relative permittivity of the unknown scatterers at location $(m,n)$ , respectively, and $M \\times M$ is the total number of subunits over the ROI $D$ .", + "bbox": [ + 212, + 585, + 799, + 709 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.2 Experiment results", + "text_level": 1, + "bbox": [ + 215, + 734, + 419, + 750 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Qualitative results on synthetic data. We first compare the reconstruction quality visually using synthetic data including circular-cylinder dataset [57] and MNIST dataset [19] against all baselines and the results are shown in Fig. 3. Our method achieves superior visual performance compared to all other baselines. Traditional methods, such as BP [2] and Twofold SOM [66], can only recover the", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/5697cea5576e5c1d99aa483f824e2070f89ca69e032217181be4a312042b1f01.jpg", + "image_caption": [ + "Fig. 3: Samples obtained from synthetic Circular-cylinder dataset and MNIST dataset. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. The first row is a standard test case [1,57], a well-known pattern for the evaluation of EISP methods." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 782, + 262 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/81c8e8ac99c6dc97efec6ca501b20f790b03d3613f564976487c9f3233154133.jpg", + "image_caption": [ + "Fig. 4: Samples obtained from real-world Institut Fresnel's database. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + ], + "image_footnote": [], + "bbox": [ + 217, + 375, + 787, + 494 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "rough shape of the target and produce inaccurate results at some junction parts. Gs SOM [8] can reconstruct the relative permittivity of the targets with relatively high accuracy, but still has obvious visual defects. Though deep learning-based methods, such as BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53], can produce more accurate estimation, their visual qualities are still far below our proposed method.", + "bbox": [ + 212, + 608, + 787, + 699 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Qualitative results on real-world data. We further test our algorithm on real-world data. The results for all methods are shown in Fig. 4. The visual performance of our method remains superior when applied to real-world data. Conventional methods exhibit a diminished performance, which, when used as input, further negatively impacts the efficacy of deep learning-based approaches.", + "bbox": [ + 212, + 700, + 787, + 777 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Noise robustness. We also compare the robustness of the models. By adding different levels of noise to the received scattered fields signal, we use the noisy scattered fields signal to recover the scattered object. The results are shown in Fig. 5. It can be observed that when large noise is added, the results of other", + "bbox": [ + 212, + 779, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/f6b54086c7826be321185353b1507816a90e008afd0c11697536f76e4b2917c6.jpg", + "image_caption": [ + "Fig. 5: Samples obtained under $5\\%$ and $30\\%$ noise levels. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 782, + 256 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/6d7387f855a8f170f5482195ac95473bbb24a7a3f6dc70b35672f828930ab842.jpg", + "table_caption": [ + "Table 1: Quantitative evaluation compared with BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. Best results are shown in bold." + ], + "table_footnote": [], + "table_body": "
Circular dataset (5%)Circular dataset (30%)MNIST dataset (5%)MNIST dataset (30%)Institut Fresnel's database
RRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNR
Proposed0.0160.96839.200.0270.93834.150.0170.97237.900.0440.89329.700.1270.89727.06
BP0.0480.91628.960.0490.91428.940.1710.75020.020.1740.74419.870.1800.79217.74
Twofold SOM0.0350.91732.270.0400.88031.130.1370.77022.350.1420.74522.130.1490.80423.87
Gs SOM0.0340.92632.740.0350.91632.430.1010.85324.630.1130.81123.730.1350.83724.95
BPS0.0270.96434.200.0340.92832.170.0980.91225.680.1330.85923.210.1660.78718.86
CS-Net0.0240.90033.750.0350.81031.270.1790.78825.370.2270.72424.150.1370.82824.87
Physics-Net0.0240.94537.200.0310.92133.530.0790.93827.740.1130.88924.440.1680.79518.42
PGAN0.0210.95736.890.0300.93333.030.0900.91826.090.1240.87323.640.1670.79418.46
", + "bbox": [ + 218, + 406, + 782, + 503 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "bases are greatly affected. However, our method can accurately reconstruct the scatterer under larger noise, demonstrating the superior robustness of the proposed method.", + "bbox": [ + 212, + 535, + 784, + 579 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Evaluation for flexible resolution. The continuity of implicit function allows INR to interpolate and infer at arbitrary points in the input space. This characteristic ensures flexible resolution during the imaging process. As depicted in Fig. 6, we employ a fixed resolution of $64 \\times 64$ during training and acquire images of varying resolutions by sampling the INR at different scales. The use of the random sampling scheme can avoid artifacts in the results. Compared to post-super-resolution methods, like Gs SOM + HAT-L [7], our method can achieve higher quality results. The resolution flexibility of INR paves the way for more in-depth analysis of reconstructed images at various resolution levels.", + "bbox": [ + 212, + 580, + 787, + 715 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Quantitative results. The quantitative results of the reconstruction quality in Tab. 1 further validate the proposed method. Higher PSNR and SSIM values suggest our method accurately recovers object shapes and effectively maintains detailed structural information. Lower relative error values indicate our method's predictions of relative permittivity distribution are more accurate compared to other methods.", + "bbox": [ + 212, + 718, + 787, + 806 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Results for sparse measurement. We use $25\\%$ of the standard measurement data to conduct an experiment [50, 57], and the results are shown in Fig. 7.", + "bbox": [ + 212, + 809, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/6dad85b08860f042e73cc2f674dd380b99ca534c750ad7e3c7b066578dd84a8f.jpg", + "image_caption": [ + "Fig. 6: Comparison of resolution flexibility among different methods. Our method is evaluated against our method without random sampling (RS) scheme, Gs SOM [8], Gs SOM + Cubic/Spline interpolation, and Gs SOM + HAT-L [7], under different resolution settings. All methods are implemented at an original resolution of $64 \\times 64$ . The pixel values in the images indicate the values of the relative permittivity. Resolution and RRMSE/SSIM values are shown below each figure." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 787, + 316 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/dec7d58bc2e3b1576e0b632ea8893123261c6ec993bb4ed756ed9bf629b47ca4.jpg", + "image_caption": [ + "Fig. 7: The results for sparse measurement. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + ], + "image_footnote": [], + "bbox": [ + 217, + 421, + 784, + 486 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Our method, leveraging INR, shows superior capability in reconstructing the object's interior from sparse measurements compared with other methods. This also demonstrates that INR is more suitable for representing the relative permittivity distribution of the object compared to other matrix-based representations like Twofold SOM [66] and CS-Net [50].", + "bbox": [ + 212, + 582, + 784, + 657 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Results for 3D scenarios. Our method can naturally generalize to 3D scenarios. In 3D scenarios, we utilize 3D Green's functions in Eq. (4) and Eq. (6), and perform integration over a 3D region of interest. We augment the input dimension of representations for relative permittivity and induced current to align with the 3D coordinates, while keeping the remaining structures unchanged. We collect the 3D scattering data from the synthetic 3D MNIST dataset [30] and real-world dataset [22]. In the synthetic experiments, we employ 40 transmitters and 160 receivers arranged around a unit cube. The results shown in Fig. 8 demonstrate that our method can reconstruct 3D objects by solving EISP.", + "bbox": [ + 212, + 657, + 784, + 792 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Time analysis. Our method, BP [2], Twofold SOM [66], and Gs SOM [8] are case-specific methods that do not require additional training time. The BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53] are deep-learning methods that", + "bbox": [ + 212, + 794, + 784, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/f0b0d017429d516fb4aa53a37c3cd228653bc76e4c91ceee059318db0c661317.jpg", + "image_caption": [ + "Fig. 8: The results for 3D scenarios on 3D MINIST dataset [30] and real-world dataset [22]. We show two example cases with three viewing directions. We use isosurface to visualize the ground truths and reconstructed results of the spatial distribution of relative permittivity." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 785, + 228 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/a7a15350e583892ddcfd0bea8f4ccae0d80ec49f32368ed398173fcf8b9b251d.jpg", + "table_caption": [ + "Table 2: Ablation results compared with single representation for relative permittivity." + ], + "table_footnote": [], + "table_body": "
Parameter counts↓ Time each iteration↓ RRMSE↓ SSIM↑ PSNR↑
Proposed1,019,139117 ms0.0380.90930.36
Single representation493,313289 ms0.0530.87627.32
", + "bbox": [ + 220, + 334, + 781, + 378 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "necessitate model training. We count the time for optimization procedure in inference time, and our method outperforms traditional case-specific methods and CS-Net [50]. Although the inference of other deep-learning methods is very fast, their training processes are time-consuming. Additionally, we may be able to reduce the optimization time through modifying the INR structure [42] or improving the training process [61, 62].", + "bbox": [ + 212, + 407, + 784, + 498 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Ablation study Our approach mainly consists of three parts: the representation for relative permittivity, representation for induced current, and random sampling. Since both the data loss $\\mathcal{L}_{\\mathrm{data}}$ and the state loss $\\mathcal{L}_{\\mathrm{state}}$ are necessary for our method, we cannot easily remove any of them. We first use a single representation for relative permittivity to replace the two MLPs in our original approach. Both models are trained on an NVIDIA V100 GPU. From the results shown in Tab. 2, the model with a single MLP takes a longer iteration time to achieve similar performance. We further remove the random sampling scheme and adopt a uniform sampling approach. As shown in the last two columns in Fig. 6, results without random sampling have lower metric values, and the high-resolution results occasionally meet obvious artifacts.", + "bbox": [ + 212, + 500, + 785, + 664 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusions", + "text_level": 1, + "bbox": [ + 215, + 686, + 367, + 704 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "An implicit solution is presented to the EISP in this paper. We propose implicitly representing the unknown scatterer's relative permittivity distribution as a trainable representation and optimizing these representations within a forward estimation process. A two-MLP strategy is employed to reduce the computation complexity. The experimental results on synthetic and real-world data demonstrate the promising performance of our proposed method. We will further collaborate with other parties to consider our solution in different scenarios, such as medical diagnostics, in more challenging conditions.", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgments", + "text_level": 1, + "bbox": [ + 217, + 143, + 392, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was done at Renjie's Research Group at the Department of Computer Science of Hong Kong Baptist University. Renjie's Research Group is supported by the National Natural Science Foundation of China under Grant No. 62302415, Guangdong Basic and Applied Basic Research Foundation under Grant No. 2022A1515110692, 2024A1515012822, and the Blue Sky Research Fund of HKBU under Grant No. BSRF/21-22/16. Boxin Shi is supported by National Natural Science Foundation of China under Grant No. 62136001, 62088102. Haoliang Li is supported by Changsha Technology Fund under its grant No. KH2304007.", + "bbox": [ + 212, + 176, + 787, + 297 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 321, + 321, + 338 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Belkebir, K., Tijhuis, A.: Using multiple frequency information in the iterative solution of a two-dimensional nonlinear inverse problem. In: Proceedings Progress in Electromagnetics Research Symposium (1996)", + "2. Belkebir, K., Chaumet, P.C., Sentenac, A.: Superresolution in total internal reflection tomography. Journal of the Optical Society of America A (2005)", + "3. Bemana, M., Myszkowski, K., Seidel, H.P., Ritschel, T.: X-fields: Implicit neural view-, light-and time-image interpolation. ACM Transactions on Graphics (TOG) (2020)", + "4. van den Berg, P.M., Van Broekhoven, A., Abubakar, A.: Extended contrast source inversion. Inverse problems (1999)", + "5. Bevacqua, M.T., Di Meo, S., Crocco, L., Isernia, T., Pasian, M.: Millimeter-waves breast cancer imaging via inverse scattering techniques. IEEE Journal of Electromagnetics, RF and Microwaves in Medicine and Biology (2021)", + "6. Chen, A., Xu, Z., Geiger, A., Yu, J., Su, H.: TensoRF: Tensorial radiance fields. In: Proceedings of the European Conference on Computer Vision (2022)", + "7. Chen, X., Wang, X., Zhou, J., Qiao, Y., Dong, C.: Activating more pixels in image super-resolution transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)", + "8. Chen, X.: Subspace-based optimization method for solving inverse-scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2009)", + "9. Chen, X.: Computational methods for electromagnetic inverse scattering. John Wiley & Sons (2018)", + "0. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2021)", + "11. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022)", + "12. Chen, Z., Zhang, H.: Learning implicit fields for generative shape modeling. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)", + "13. Cheng, Y., Wan, R., Weng, S., Zhu, C., Chang, Y., Shi, B.: Colorizing monochromatic radiance fields. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024)" + ], + "bbox": [ + 218, + 353, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Chew, W.C.: Waves and fields in inhomogeneous media, vol. 16. John Wiley & Sons (1999)", + "15. Chew, W.C., Wang, Y.M.: Reconstruction of two-dimensional permittivity distribution using the distorted Born iterative method. IEEE Transactions on Medical Imaging (1990)", + "16. Colton, D., Kress, R.: Integral Equation Methods in Scattering Theory. SIAM (2013)", + "17. Colton, D.L., Kress, R., Kress, R.: Inverse Acoustic and Electromagnetic Scattering Theory. Springer (1998)", + "18. Cui, T.J., Chew, W.C., Yin, X.X., Hong, W.: Study of resolution and super resolution in electromagnetic imaging for half-space problems. IEEE Transactions on Antennas and Propagation (2004)", + "19. Deng, L.: The MNIST database of handwritten digit images for machine learning research. IEEE Signal Processing Magazine (2012)", + "20. Devaney, A.: Inverse-scattering theory within the rytov approximation. Optics Letters (1981)", + "21. Gao, F., Van Veen, B.D., Hagness, S.C.: Sensitivity of the distorted born iterative method to the initial guess in microwave breast imaging. IEEE Transactions on Antennas and Propagation (2015)", + "22. Geffrin, J., Sabouroux, P.: Continuing with the fresnel database: experimental setup and improvements in 3d scattering measurements. Inverse Problems (2009)", + "23. Geng, R., Hu, Y., Chen, Y., et al.: Recent advances on non-line-of-sight imaging: Conventional physical models, deep learning, and new scenes. APSIPA Transactions on Signal and Information Processing (2021)", + "24. Geng, R., Li, Y., Zhang, D., Wu, J., Gao, Y., Hu, Y., Chen, Y.: Dream-pcd: Deep reconstruction and enhancement of mmwave radar pointcloud. arXiv preprint arXiv:2309.15374 (2023)", + "25. Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press (2013)", + "26. Grattarola, D., Vandergheynst, P.: Generalised implicit neural representations. In: Advances in Neural Information Processing Systems (2022)", + "27. Habashy, T.M., Groom, R.W., Spies, B.R.: Beyond the born and rytov approximations: A nonlinear approach to electromagnetic scattering. Journal of Geophysical Research: Solid Earth (1993)", + "28. Habashy, T.M., Oristaglio, M.L., de Hoop, A.T.: Simultaneous nonlinear reconstruction of two-dimensional permittivity and conductivity. Radio Science (1994)", + "29. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: European Conference on Computer Vision (2022)", + "30. de la Iglesia Castro, D.: 3D mnist: A 3D version of the mnist database of handwritten digits. https://www.kaggle.com/datasets/daavoo/3d-mnist", + "31. Jagatap, G., Hegde, C.: Phase retrieval using untrained neural network priors. In: NeurIPS 2019 Workshop on Solving Inverse Problems with Deep Networks (2019)", + "32. Lempitsky, V., Vedaldi, A., Ulyanov, D.: Deep image prior. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (2018)", + "33. Li, J., Pang, M., Dong, Y., Jia, J., Wang, B.: Graph neural network explanations are fragile. In: International Conference on Machine Learning (2024)", + "34. Li, L., Wang, L.G., Teixeira, F.L., Liu, C., Nehorai, A., Cui, T.J.: Deepnis: Deep neural network for nonlinear electromagnetic inverse scattering. IEEE Transactions on Antennas and Propagation (2018)" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "35. Li, Y., Zhang, D., Geng, R., Wu, J., Hu, Y., Sun, Q., Chen, Y.: Ifnet: Imaging and focusing network for handheld mmwave devices. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024)", + "36. Liu, Z., Roy, M., Prasad, D.K., Agarwal, K.: Physics-guided loss functions improve deep learning performance in inverse scattering. IEEE Transactions on Computational Imaging (2022)", + "37. Luo, Z., Guo, Q., Cheung, K.C., See, S., Wan, R.: Copyrnerf: Protecting the copyright of neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)", + "38. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3D reconstruction in function space. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)", + "39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing scenes as neural radiance fields for view synthesis. In: Proceedings of the European Conference on Computer Vision (2020)", + "40. Mitra, S.K.: Digital signal processing: a computer-based approach. McGraw-Hill Higher Education (2001)", + "41. Mojabi, P., LoVetri, J.: Comparison of te and tm inversions in the framework of the gauss-newton method. IEEE Transactions on Antennas and Propagation (2010)", + "42. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) (2022)", + "43. Nikolova, N.K.: Microwave imaging for breast cancer. IEEE Microwave Magazine (2011)", + "44. Nordebo, S., Gustafsson, M., Nilsson, B.: Fisher information analysis for two-dimensional microwave tomography. Inverse Problems (2007)", + "45. O'Loughlin, D., O'Halloran, M., Moloney, B.M., Glavin, M., Jones, E., Elahi, M.A.: Microwave breast imaging: Clinical advances and remaining challenges. IEEE Transactions on Biomedical Engineering (2018)", + "46. Pang, M., Wang, B., Ye, M., Cheung, Y.M., Zhou, Y., Huang, W., Wen, B.: Heterogeneous prototype learning from contaminated faces across domains via disentangling latent factors. IEEE Transactions on Neural Networks and Learning Systems (2024)", + "47. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)", + "48. Peterson, A.F., Ray, S.L., Mittra, R.: Computational methods for electromagnetics. IEEE Press New York (1998)", + "49. Rubæk, T., Meaney, P.M., Meincke, P., Paulsen, K.D.: Nonlinear microwave imaging for breast-cancer screening using gauss-newton's method and the cgls inversion algorithm. IEEE Transactions on Antennas and Propagation (2007)", + "50. Sanghvi, Y., Kalepu, Y., Khankhoje, U.K.: Embedding deep learning in inverse scattering problems. IEEE Transactions on Computational Imaging (2019)", + "51. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: Advances in Neural Information Processing Systems (2020)", + "52. Slaney, M., Kak, A., Larsen, L.: Limitations of imaging with first-order diffraction tomography. IEEE Transactions on Microwave Theory and Techniques (1984)", + "53. Song, R., Huang, Y., Xu, K., Ye, X., Li, C., Chen, X.: Electromagnetic inverse scattering with perceptual generative adversarial networks. IEEE Transactions on Computational Imaging (2021)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "An Implicit Solution to Electromagnetic Inverse Scattering Problems", + "bbox": [ + 272, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "54. Stanley, K.O.: Compositional pattern producing networks: A novel abstraction of development. Genetic programming and evolvable machines (2007)", + "55. Taflove, A., Hagness, S.C., Piket-May, M.: Computational electromagnetics: the finite-difference time-domain method. The Electrical Engineering Handbook (2005)", + "56. Tang, Y., Zhu, C., Wan, R., Xu, C., Shi, B.: Neural underwater scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2024)", + "57. Wei, Z., Chen, X.: Deep-learning schemes for full-wave nonlinear inverse scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2018)", + "58. Wei, Z., Chen, X.: Uncertainty quantification in inverse scattering problems with bayesian convolutional neural networks. IEEE Transactions on Antennas and Propagation (2020)", + "59. Xu, K., Zhang, C., Ye, X., Song, R.: Fast full-wave electromagnetic inverse scattering based on scalable cascaded convolutional neural networks. IEEE Transactions on Geoscience and Remote Sensing (2021)", + "60. Xu, K., Zhong, Y., Wang, G.: A hybrid regularization technique for solving highly nonlinear inverse scattering problems. IEEE Transactions on Microwave Theory and Techniques (2017)", + "61. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric iterative machine teaching. In: International Conference on Machine Learning (2023)", + "62. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric teaching for multiple learners. Advances in Neural Information Processing Systems (2023)", + "63. Zhang, C., Luo, S., Li, J., Wu, Y.C., Wong, N.: Nonparametric teaching of implicit neural representations. In: International Conference on Machine Learning (2024)", + "64. Zhang, L., Xu, K., Song, R., Ye, X., Wang, G., Chen, X.: Learning-based quantitative microwave imaging with a hybrid input scheme. IEEE Sensors Journal (2020)", + "65. Zhang, X., Zhao, Z.: A new scheme for solving highly nonlinear inverse scattering problems with noise disturbance. IEEE Geoscience and Remote Sensing Letters (2022)", + "66. Zhong, Y., Chen, X.: Twofold subspace-based optimization method for solving inverse scattering problems. Inverse Problems (2009)", + "67. Zhong, Y., Chen, X.: An ftf twofold subspace-based optimization method for solving electromagnetic inverse scattering problems. IEEE Transactions on Antennas and Propagation (2011)", + "68. Zhong, Y., Lambert, M., Lesselier, D., Chen, X.: A new integral equation method to solve highly nonlinear inverse scattering problems. IEEE Transactions on Antennas and Propagation (2016)", + "69. Zhou, H., Cheng, Y., Zheng, H., Liu, Q., Wang, Y.: Deep unfolding contrast source inversion for strong scatterers via generative adversarial mechanism. IEEE Transactions on Microwave Theory and Techniques (2022)", + "70. Zhu, C., Wan, R., Tang, Y., Shi, B.: Occlusion-free scene recovery via neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + ], + "bbox": [ + 215, + 147, + 785, + 756 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Z. Luo et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_model.json b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_model.json new file mode 100644 index 0000000000000000000000000000000000000000..156a33dd647568d885214e5aba2ead1f672f1a1e --- /dev/null +++ b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_model.json @@ -0,0 +1,2601 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.245, + 0.142, + 0.761, + 0.187 + ], + "angle": 0, + "content": "Imaging Interiors: An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.213, + 0.744, + 0.23 + ], + "angle": 0, + "content": "Ziyuan Luo\\(^{1}\\), Boxin Shi\\(^{2,3}\\), Haoliang Li\\(^{4}\\), and Renjie Wan\\(^{1\\star}\\)" + }, + { + "type": "text", + "bbox": [ + 0.277, + 0.24, + 0.725, + 0.255 + ], + "angle": 0, + "content": "\\(^{1}\\) Department of Computer Science, Hong Kong Baptist University" + }, + { + "type": "text", + "bbox": [ + 0.288, + 0.255, + 0.715, + 0.282 + ], + "angle": 0, + "content": "\\(^{2}\\) State Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University" + }, + { + "type": "text", + "bbox": [ + 0.293, + 0.282, + 0.71, + 0.31 + ], + "angle": 0, + "content": "\\(^{3}\\) National Engineering Research Center of Visual Technology, School of Computer Science, Peking University" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.31, + 0.781, + 0.352 + ], + "angle": 0, + "content": "\\(^{4}\\) Department of Electrical Engineering, City University of Hong Kong ziyuanluo@life.hkbu.edu.hk, shiboxin@pku.edu.cn, haoliang.li@cityu.edu.hk, renjiewan@hkbu.edu.hk" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.394, + 0.744, + 0.59 + ], + "angle": 0, + "content": "Abstract. Electromagnetic Inverse Scattering Problems (EISP) have gained wide applications in computational imaging. By solving EISP, the internal relative permittivity of the scatterer can be non-invasively determined based on the scattered electromagnetic fields. Despite previous efforts to address EISP, achieving better solutions to this problem has remained elusive, due to the challenges posed by inversion and discretization. This paper tackles those challenges in EISP via an implicit approach. By representing the scatterer's relative permittivity as a continuous implicit representation, our method is able to address the low-resolution problems arising from discretization. Further, optimizing this implicit representation within a forward framework allows us to conveniently circumvent the challenges posed by inverse estimation. Our approach outperforms existing methods on standard benchmark datasets. Project page: https://luo-ziyuan.github.io/Imaging-Interiors." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.602, + 0.741, + 0.631 + ], + "angle": 0, + "content": "Keywords: Electromagnetic inverse scattering problems \\(\\cdot\\) Implicit neural representations \\(\\cdot\\) Computational photography" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.659, + 0.377, + 0.674 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.693, + 0.788, + 0.754 + ], + "angle": 0, + "content": "As electromagnetic waves can penetrate objects' surfaces, they play a key role in non-invasive imaging. Compared with modalities like X-ray and MRI, electromagnetic waves provide a potentially low-cost and safe approach [5, 24, 45] for non-invasive imaging." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Non-invasive imaging via electromagnetic waves needs to be completed by solving the Electromagnetic Inverse Scattering Problems (EISP). The typical scenario and the associated physical quantities of EISP are displayed in Fig. 1. In EISP, we need to infer the distribution of the scatterer's relative permittivity" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.386, + 0.84 + ], + "angle": 0, + "content": "* Corresponding author." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.128 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.789, + 0.313 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.323, + 0.789, + 0.422 + ], + "angle": 0, + "content": "Fig. 1: The results of a standard test case [1,57] in EISP. In an EISP system, the scatterer in the enclosed space \\(D\\) is first illuminated by incoming electromagnetic waves emitted by transmitters and generates scattered fields. Then, the scattered fields measured by receivers are used to determine the scatterer's relative permittivity. We show results obtained by our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.457, + 0.788, + 0.488 + ], + "angle": 0, + "content": "from the measured scattered fields [43]. Then, the values of relative permittivity can be visualized to image the objects' internal structures." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.49, + 0.789, + 0.627 + ], + "angle": 0, + "content": "However, solving EISP has never been an easy task. The first challenge comes from the inverse estimation process, where the scatterer's relative permittivity is derived from the measured scattered fields. The multiple scattering effects inherent to the EISP further significantly complicate this inverse estimation [9,34,68]. Furthermore, continuous spaces are usually discretized into finite elements or grids to facilitate numerical computations for electromagnetic computations. This process of discretization inherently leads to a loss of details and a decrease in image resolution for EISP [18, 44]. This consequently poses challenges in accurately distinguishing internal small objects in close proximity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.79, + 0.842 + ], + "angle": 0, + "content": "The scattering mechanism is crucial in solving EISP [8, 36]. Recent deep-learning-based methods [34, 57] first obtain a rough image using traditional algorithms (e.g., BP [2] shown in Fig. 1) and then refine this rough result using image-to-image translation networks. However, with the imaging process being divided into two distinct stages, the measured physical data are overlooked in the second phase, inevitably resulting in images of inferior quality (e.g., BPS [57] and PGAN [53] shown in Fig. 1). Besides, as the relative permittivity distributions can vary greatly across different objects, a single network may be insufficient to reflect these differences. Therefore, a more appropriate approach is to optimize for each object while thoroughly considering the scattering mechanisms. Traditional methods like Twofold SOM [66] and Gs SOM [8] achieve this goal by discretizing continuous relative permittivity values into discrete variables expressed as to-be-optimized matrices [8, 15, 66]. However, they cannot address the low-resolution issues that arise from discretization, as shown in Fig. 1. Moreover," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.191 + ], + "angle": 0, + "content": "these methods have difficulties in handling sparse measurement data, which usually leads to low reconstruction quality. Thus, we need a more powerful representation scheme beyond the discrete matrix form." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.788, + 0.463 + ], + "angle": 0, + "content": "Since the scatterer's relative permittivity distribution used for imaging is intimately related to the spatial position [15], the envisioned approach should indicate such location-dependent physical quantity. Moreover, for better imaging quality, the approach should have the capacity to eliminate the low-resolution curse made by discretization. Therefore, we propose to represent the scatterer's relative permittivity distribution via Implicit Neural Representations (INR), as INR has remarkable capability in modeling location-dependent relationships [39, 51]. Its flexibility in handling image resolutions [10, 11, 29] also helps to alleviate the curse made by discretization. Besides, INR is known for its case-by-case optimization strategy, which can faithfully reflect each object's internal differences. In addition, INRs exhibit a strong capacity to recover information from incomplete data across a range of tasks [31, 32, 39], which can address the difficulties caused by sparse measurement. We then optimize the INR of each object by making sure that this representation can produce results akin to the actual measurements. Such an optimization based on forward estimation can help to address the difficulties caused by inverse estimation. Once the optimization settles down, we can access the relative permittivity values by using their corresponding locations and visualize them for imaging purposes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.464, + 0.788, + 0.601 + ], + "angle": 0, + "content": "Our solution is illustrated in Fig. 2. We use the Multilayer Perceptron (MLP) as the backbone of INR. Specifically, two MLPs are used to represent the relative permittivity and the induced current. It allows us to bypass complex matrix inversions in optimization, largely reducing the computational cost. To optimize the implicit representations, we propose to use a data loss and a state loss by fully considering the relationships between various physical quantities in the scattering process. Meanwhile, a random sampling strategy is designed for comprehensive consideration of each spatial position during optimization. Our primary contributions can be summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.606, + 0.784, + 0.635 + ], + "angle": 0, + "content": "- We propose a solution to EISP based on forward estimation to avoid difficulties triggered by inverse estimation." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.636, + 0.784, + 0.679 + ], + "angle": 0, + "content": "- We introduce the use of the learnable INR for the object's relative permittivity distribution to indicate the location-dependent quantity and achieve flexibility in imaging resolution." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.68, + 0.784, + 0.709 + ], + "angle": 0, + "content": "- We explore a novel strategy that utilizes two separate MLPs for two physical quantities to avoid complex computations caused by matrix inversion." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.606, + 0.784, + 0.709 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.716, + 0.784, + 0.762 + ], + "angle": 0, + "content": "The research for solving EISP has established standard benchmarks for evaluation [9, 53, 57]. We strictly follow these standard benchmarks in our research, including system settings, datasets, and metrics." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.782, + 0.383, + 0.797 + ], + "angle": 0, + "content": "2 Related work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Electromagnetic inverse scattering problems (EISP). Conventional approaches for EISP can be classified as non-iterative and iterative categories." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.128 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.42 + ], + "angle": 0, + "content": "Non-iterative methods tackle nonlinear issues by converting them into linear equations, such as the Born approximation [52], Rytov approximation [20, 27], and back-propagation (BP) method [2]. Since non-iterative methods are limited by reconstruction quality, other methods, such as the Subspace Optimization Method (SOM) [8, 60, 67], Contrast Source Inversion (CSI) Method [4, 28], Distorted Born Iterative Method (DBIM) [21], and other Newton-type methods [41, 49], are proposed to solve this problem in an iterative way. Despite their feasibility, their performance is highly sensitive to the initial guess, which undermines their robustness. Neural networks have recently been employed to construct nonlinear mappings linking the dispersed fields and the obscure constitutive attributes of scatterers [23, 35]. Most methods consider EISP in two stages [34, 57, 59, 64], where traditional approaches [2, 52] are first employed to obtain coarse images, and then the trained image-to-image neural networks are used for post-processing. However, due to the lack of consideration for scattering mechanisms, those methods encounter nearly all the difficulties faced by deep learning [33, 46], which easily causes their post-processing efforts to fail. We consider an implicit forward approach to overcome the aforementioned difficulties by optimizing a trainable implicit representation within a forward process." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.421, + 0.788, + 0.725 + ], + "angle": 0, + "content": "Implicit neural representations (INR). Implicit neural representations usually employ an MLP to map from local coordinates to the associated values on that coordinates [26,51,63], such as intensity for images and videos, or occupancy value for 3D volumes. The basics of INR are briefly explained below. INR is a neural network \\( F_{\\theta}:\\mathbf{x}\\mapsto F_{\\theta}(\\mathbf{x}) \\) that continuously maps the coordinates \\( \\mathbf{x} \\) to the corresponding quantity of interest. For the data expressed as a function \\( \\varPhi:\\mathbf{x}\\mapsto\\varPhi(\\mathbf{x}) \\), the INR \\( F_{\\theta} \\) is a solution to \\( F_{\\theta}(\\mathbf{x}) - \\varPhi(\\mathbf{x}) = 0 \\). Typically, the weight of INR, \\( \\theta \\), can be obtained through optimization. INR has shown its advantages in parameterizing geometry and learning priors over shapes, as demonstrated by DeepSDF [47], Occupancy Networks [38], and IM-Net [12]. A considerable amount of subsequent research has proposed volumetric rendering of 3D implicit representations, including Neural Radiance Fields (NeRF) [39] and its acceleration [6,42], quality enhancement [13,56,70], and copyright protection [37]. In the realm of 2D image representation, CPPNs [54] first proposed the use of neural networks to parameterize images implicitly. SIRENs [51] proposed generalization across implicit representations of images via hypernetworks. X-Fields [3] parameterizes the Jacobian of pixel position with respect to view, time, and illumination. In this work, we employ INR as the backbone to represent the scatterer's properties, which is able to characterize the complex spatial correlation in EISP and produce better imaging quality." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.755, + 0.482, + 0.772 + ], + "angle": 0, + "content": "3 Physical model of EISP" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.842 + ], + "angle": 0, + "content": "As shown in Fig. 1, for an EISP system, the object to be imaged is defined as the unknown scatterer, and the enclosed space is represented by a square Region of Interest (ROI) denoted by \\( D \\). Transmitters and receivers are positioned around" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "\\(D\\) to emit electromagnetic waves and measure the scattered electromagnetic fields, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.269 + ], + "angle": 0, + "content": "Generally, the data measurement process can be split into two stages. At the first stage, the induced current is excited as the electromagnetic waves from the transmitters interact with the scatterer, aka wave-scatterer interaction. Subsequently, the induced current serves as a radiation source, generating the scattered fields. The total electric fields within \\( D \\) can be described by Lippmann-Schwinger equation [16], aka state equation, as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.327, + 0.282, + 0.786, + 0.313 + ], + "angle": 0, + "content": "\\[\nE ^ {\\mathrm {t}} (\\mathbf {x}) = E ^ {\\mathrm {i}} (\\mathbf {x}) + k _ {0} ^ {2} \\int_ {D} g \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) J \\left(\\mathbf {x} ^ {\\prime}\\right) d \\mathbf {x} ^ {\\prime}, \\mathbf {x} \\in D, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.325, + 0.784, + 0.416 + ], + "angle": 0, + "content": "where \\(\\mathbf{x}\\) and \\(\\mathbf{x}'\\) are the spatial coordinates. \\(E^{\\mathrm{i}}\\) is the incident electric fields directly from transmitters, while \\(E^{\\mathrm{t}}\\) is the total electric fields consisting of the original incident fields coming directly from transmitters and the scattered fields coming from scatterers. \\(k_{0}\\) is the wavenumber computed from the signal frequency, and \\(g\\) is the free space Green's function. The relationship between the induced current \\(J\\) and total electric fields \\(E^{\\mathrm{t}}\\) can be expressed as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.437, + 0.43, + 0.785, + 0.446 + ], + "angle": 0, + "content": "\\[\nJ (\\mathbf {x}) = \\xi (\\mathbf {x}) E ^ {t} (\\mathbf {x}). \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.459, + 0.784, + 0.488 + ], + "angle": 0, + "content": "In Eq. (2), \\(\\xi\\) is the contrast defined as \\(\\xi (\\mathbf{x}) = \\varepsilon_r(\\mathbf{x}) - 1\\), where \\(\\varepsilon_r(\\mathbf{x})\\) denotes the relative permittivity of the unknown scatterer." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.49, + 0.785, + 0.521 + ], + "angle": 0, + "content": "The second equation describes the scattered fields as a reradiation of the induced current [16], aka data equation, as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.358, + 0.533, + 0.785, + 0.565 + ], + "angle": 0, + "content": "\\[\nE ^ {\\mathrm {s}} (\\mathbf {x}) = k _ {0} ^ {2} \\int_ {D} g \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) J \\left(\\mathbf {x} ^ {\\prime}\\right) d \\mathbf {x} ^ {\\prime}, \\mathbf {x} \\in S, \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.575, + 0.787, + 0.604 + ], + "angle": 0, + "content": "where \\( E^{s} \\) is the scattered fields that can be measured by receivers at surface \\( S \\) around the ROI \\( D \\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.606, + 0.788, + 0.698 + ], + "angle": 0, + "content": "Since the digital signal analysis is only available on discrete variables [40,55], Eq. (1) to Eq. (3) are inevitably transformed to their discrete counterparts. Specifically, the ROI \\(D\\) is discretized into \\(M \\times M\\) square subunits and the method of moments [48] is employed to obtain the discrete scattered fields. The relationship between discrete contrast \\(\\xi\\) and discrete relative permittivity \\(\\varepsilon_r\\) can be expressed as \\(\\xi = \\varepsilon_r - 1\\). Then, Eq. (1) can be reformulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.437, + 0.71, + 0.785, + 0.727 + ], + "angle": 0, + "content": "\\[\n\\mathbf {E} ^ {\\mathrm {t}} = \\mathbf {E} ^ {\\mathrm {i}} + \\mathbf {G} _ {D} \\cdot \\mathbf {J}, \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.739, + 0.788, + 0.786 + ], + "angle": 0, + "content": "where \\(\\mathbf{E}^{\\mathrm{t}}\\), \\(\\mathbf{E}^{\\mathrm{i}}\\), and \\(\\mathbf{J}\\) are the discrete \\(E^t\\), \\(E^i\\), and \\(J\\), respectively. \\(\\mathbf{G}_D\\) is discrete free space Green's function in \\(D\\). The discrete version of Eq. (2) can be represented as follows [53]:" + }, + { + "type": "equation", + "bbox": [ + 0.441, + 0.799, + 0.785, + 0.815 + ], + "angle": 0, + "content": "\\[\n\\mathbf {J} = \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {E} ^ {\\mathrm {t}}, \\tag {5}\n\\]" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.654, + 0.841 + ], + "angle": 0, + "content": "5 Discrete variables are denoted using bold letters in our paper" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.128 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.146, + 0.789, + 0.325 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.335, + 0.789, + 0.462 + ], + "angle": 0, + "content": "Fig. 2: Overview of our implicit method. Two MLPs, \\( F_{\\theta} \\) and \\( H_{\\phi} \\), are used to implicitly represent relative permittivity \\( \\varepsilon_{r} \\) and induced current \\( J \\), respectively. Random sampling is applied for comprehensive optimization. The predicted induced current \\( \\hat{\\mathbf{J}} \\) is calculated by Eq. (13) based on relative permittivity \\( \\varepsilon_{r} \\) queried from \\( F_{\\theta} \\) and induced current \\( J \\) directly queried from \\( H_{\\phi} \\). Then the state loss \\( \\mathcal{L}_{\\mathrm{state}} \\) is calculated by comparing the predicted \\( \\hat{\\mathbf{J}} \\) and directly queried \\( \\mathbf{J} \\). Besides, the directly queried induced current \\( \\mathbf{J} \\) is used to compute the scattered fields \\( \\hat{\\mathbf{E}}^{\\mathrm{s}} \\) by Eq. (11). Data loss function \\( \\mathcal{L}_{\\mathrm{data}} \\) is constructed to evaluate the difference between predicted scattered fields \\( \\hat{\\mathbf{E}}^{\\mathrm{s}} \\) and the measured values \\( \\mathbf{E}^{\\mathrm{s}} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.491, + 0.788, + 0.52 + ], + "angle": 0, + "content": "where \\(\\mathrm{Diag}(\\pmb {\\xi})\\) is the diagonal matrix of contrast function. Similarly, Eq. (3) can be discretized as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.454, + 0.521, + 0.785, + 0.537 + ], + "angle": 0, + "content": "\\[\n\\mathbf {E} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\mathbf {J}, \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.544, + 0.785, + 0.573 + ], + "angle": 0, + "content": "where \\(\\mathbf{E}^{\\mathrm{s}}\\) is the discrete \\(E^{s}\\), and \\(\\mathbf{G}_S\\) is the discrete Green's function to map contrast source \\(\\mathbf{J}\\) to scattered fields \\(\\mathbf{E}^{\\mathrm{s}}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.574, + 0.789, + 0.71 + ], + "angle": 0, + "content": "The task of EISP is to infer the relative permittivity \\(\\varepsilon_r\\), a value closely related to \\(\\xi\\), from the scattered fields \\(\\mathbf{E}^s\\) measured by receivers, and then visualize it in an image. In an EISP system, knowing only \\(\\mathbf{E}^{\\mathrm{i}}\\) and \\(\\mathbf{E}^{\\mathrm{s}}\\) makes it challenging to estimate \\(\\xi\\) inversely from \\(\\mathbf{E}^{\\mathrm{s}}\\) based on Eq. (6). Furthermore, the inherent nonlinearity originating from \\(\\mathbf{G}_D \\cdot \\mathbf{J}\\) in Eq. (4) complicates the estimation process [14, 18, 65]. Ultimately, \\(\\varepsilon_r\\), a variable with continuous characteristics, can only be derived using the aforementioned discrete equations, thereby compromising the imaging resolution. Consequently, an effective strategy is necessary to produce more accurate outcomes for EISP." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.734, + 0.507, + 0.751 + ], + "angle": 0, + "content": "4 Proposed implicit solution" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.788, + 0.813 + ], + "angle": 0, + "content": "As depicted in Fig. 2, our fundamental idea is to solve the inverse scattering problem within a forward estimation process, which can be described by reformulating Eq. (4) to Eq. (6) as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.341, + 0.823, + 0.787, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\mathbf {E} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\operatorname {D i a g} (\\pmb {\\xi}) \\cdot \\left(\\mathbf {I} - \\mathbf {G} _ {D} \\operatorname {D i a g} (\\pmb {\\xi})\\right) ^ {- 1} \\cdot \\mathbf {E} ^ {\\mathrm {i}}, \\tag {7}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.314 + ], + "angle": 0, + "content": "where \\(\\mathbf{I}\\) is the identity matrix. Contrary to previous approaches [2,52] that treat \\(\\pmb{\\xi}\\) as unknown, we regard the contrast \\(\\pmb{\\xi}\\) as a known quantity, by establishing relative permittivity \\(\\varepsilon_{r}\\) involved in Eq. (2) as a learnable implicit representation. Then, we can calculate \\(\\mathbf{E}^{\\mathrm{s}}\\) triggered by Eq. (7). During training, by contrasting the calculated \\(\\mathbf{E}^{\\mathrm{s}}\\) with the measured true ones, the learnable representation can finally reach its optimum status. Since we do not aim to inversely express \\(\\pmb{\\xi}\\) as an explicit function of \\(\\mathbf{E}^{\\mathrm{s}}\\), this optimization-in-forward approach can alleviate the challenges associated with inverse estimation and nonlinearity. The use of INR also ensures enhanced flexibility in imaging resolution. During inference, we can directly obtain the relative permittivity values by querying the representation with the corresponding coordinates." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.334, + 0.557, + 0.349 + ], + "angle": 0, + "content": "4.1 Continuous representation for EISP" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.357, + 0.788, + 0.403 + ], + "angle": 0, + "content": "Representation for relative permittivity. We use a multilayer perceptron (MLP) with parameters \\(\\theta\\) to map the continuous spatial coordinates \\(\\mathbf{x}\\) to its associating relative permittivity values, which can be briefly described as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.436, + 0.418, + 0.785, + 0.433 + ], + "angle": 0, + "content": "\\[\n\\varepsilon_ {r} (\\mathbf {x}) = F _ {\\theta} (\\gamma (\\mathbf {x})), \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.438, + 0.788, + 0.484 + ], + "angle": 0, + "content": "where \\(\\varepsilon_r^6\\) denotes the relative permittivity obtained by querying the spatial coordinates within the continuous representation \\(F_{\\theta}\\). We further apply the positional encoding for \\(\\mathbf{x}\\) to facilitate the fitting capability of the model as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.33, + 0.495, + 0.785, + 0.515 + ], + "angle": 0, + "content": "\\[\n\\gamma (\\mathbf {x}) = \\left[ \\sin \\mathbf {x}, \\cos \\mathbf {x}, \\dots , \\sin 2 ^ {\\Omega - 1} \\mathbf {x}, \\cos 2 ^ {\\Omega - 1} \\mathbf {x} \\right] ^ {\\top}, \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.52, + 0.686, + 0.534 + ], + "angle": 0, + "content": "where \\(\\varOmega\\) is a hyperparameter controlling the spectral bandwidth." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.67 + ], + "angle": 0, + "content": "To optimize this continuous representation, we apply a series of equations defined by the computation of forward estimation, and then compare the scattered fields incited by this representation with the measured true ones. As discussed in Sec. 3, since the discretization is unavoidable during the forward computation, we only query discrete spatial coordinates during optimization to align with the discretization policy set by the method of moments [48]. Though we can directly perform the forward computation via Eq. (7), the computation complexity caused by its internal matrix inversion places a high demand on computing resources and potentially compromises the stability of problem-solving [25]." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.671, + 0.788, + 0.79 + ], + "angle": 0, + "content": "Representation for induced current. To avoid the complexity caused by matrix inversion, instead of the explicit computation defined in Eq. (7), we implicitly represent \\(\\mathbf{J}\\) as its continuous form using another MLP. By analyzing Eq. (7), the induced current is related to two variables: the discrete contrast \\(\\xi\\) and the incident electric fields \\(\\mathbf{E}^{\\mathrm{i}}\\) caused by transmitters. To faithfully describe such correlation, we propose to consider the representation for \\(J\\) as the mapping based on the spatial coordinates \\(\\mathbf{x}\\) and the transmitter's position \\(\\mathbf{x}^{\\mathrm{t}}\\), which can be defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.402, + 0.801, + 0.785, + 0.817 + ], + "angle": 0, + "content": "\\[\nJ (\\mathbf {x}, \\mathbf {x} ^ {\\mathrm {t}}) = H _ {\\phi} \\left(\\gamma (\\mathbf {x}), \\gamma (\\mathbf {x} ^ {\\mathrm {t}})\\right), \\tag {10}\n\\]" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.654, + 0.841 + ], + "angle": 0, + "content": "Due to its continuous property, we do not write it as bold font." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.128 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.744, + 0.162 + ], + "angle": 0, + "content": "where \\(H_{\\phi}\\) is a continuous function consisting of fully connected networks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.163, + 0.789, + 0.362 + ], + "angle": 0, + "content": "Random spatial sampling. Due to the necessity of discretization in numerical computations to perform forward process, we need to spatially query the representations \\(F_{\\theta}\\) and \\(H_{\\phi}\\) at some positions to obtain their discrete forms. A typical approach is to divide the ROI \\(D\\) evenly into grids and deterministically sample the center location of each grid [36, 50]. However, the representations would only be queried at a fixed discrete set of locations in this way [39]. To take a comprehensive consideration of each spatial position, we use a random sampling scheme where we partition ROI \\(D\\) into \\(M \\times M\\) evenly-spaced grids, and the center of \\((m,n)\\) grid is \\((x_m,y_n)\\). Each sample location \\((x_m^{\\mathrm{sample}},y_n^{\\mathrm{sample}})\\) is then randomly drawn from a Gaussian distribution: \\(x_m^{\\mathrm{sample}} \\sim \\mathcal{N}(x_m,\\sigma^2)\\), \\(y_n^{\\mathrm{sample}} \\sim \\mathcal{N}(y_n,\\sigma^2)\\), where \\(\\sigma\\) is a hyperparameter to control the dispersion level of sample points around their means. By probabilistically sampling each spatial position, this scheme can alleviate the overlook of specific locations." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.385, + 0.586, + 0.4 + ], + "angle": 0, + "content": "4.2 Forward calculation based optimization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.413, + 0.789, + 0.489 + ], + "angle": 0, + "content": "The continuous representations obtained before can estimate corresponding physical quantities using spatial coordinates, but optimizing them directly with estimated values is hard because obtaining their true values is difficult [58]. Therefore, we indirectly refine the representations denoted by \\( F_{\\theta} \\) and \\( H_{\\phi} \\) by proposing a data loss and a state loss while fully considering the physical relationships." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.489, + 0.789, + 0.611 + ], + "angle": 0, + "content": "Data loss. Based on Sec. 3, the wave-scatterer interaction leads to the induced current when the electromagnetic waves from transmitters interact with the scatterer. Then, the induced current generates the scattered fields, which can be measured by receivers. Thus, a straightforward way to refine the representations is to minimize the distance between the scattered fields computed from the representations and the true ones. With the discrete induced current \\(\\mathbf{J}\\) sampling from the continuous representation \\(H_{\\phi}\\) defined in Eq. (10), we can obtain the predicted scattered fields by reformulating the data equation in Eq. (6) as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.452, + 0.626, + 0.785, + 0.645 + ], + "angle": 0, + "content": "\\[\n\\hat {\\mathbf {E}} _ {p} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\mathbf {J} _ {p}, \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.654, + 0.788, + 0.699 + ], + "angle": 0, + "content": "where \\(\\mathbf{G}_S\\) denotes the discrete Green's function, and \\(\\mathbf{J}_p\\) and \\(\\hat{\\mathbf{E}}_p^s\\) denotes the discrete induced current and predicted scattered fields inspired by the \\(p\\)-th transmitter, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.7, + 0.788, + 0.731 + ], + "angle": 0, + "content": "We then define our data loss used to contrast the predicted scattered fields with the measured true ones as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.416, + 0.742, + 0.785, + 0.782 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {d a t a}} = \\sum_ {p = 1} ^ {N _ {\\mathrm {t}}} \\| \\hat {\\mathbf {E}} _ {p} ^ {\\mathrm {s}} - \\mathbf {E} _ {p} ^ {\\mathrm {s}} \\| ^ {2}, \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "where \\(\\mathbf{E}_p^s\\) is the true scattered fields measured by receivers, and \\(N_{t}\\) denotes the number of all transmitters. The data loss enhances the optimization of the representation by accounting for discrepancies associated with all transmitters." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.238 + ], + "angle": 0, + "content": "State loss. Although the data loss is straightforward, it cannot be used to optimize \\( F_{\\theta} \\). Since the induced current \\( \\mathbf{J}_p \\) is directly obtained by querying its representation \\( H_{\\phi} \\), Eq. (12) does not contain any variables related to \\( F_{\\theta} \\). To effectively optimize \\( F_{\\theta} \\), we consider minimizing the mismatch emerging from the state equation defined in Eq. (4) and Eq. (5). Specifically, by reformulating Eq. (7), an expression related to \\( p \\)-th transmitter can be obtained as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.366, + 0.244, + 0.786, + 0.261 + ], + "angle": 0, + "content": "\\[\n\\mathbf {\\hat {J}} _ {p} = \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {E} _ {p} ^ {\\mathrm {i}} + \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {G} _ {D} \\cdot \\mathbf {J} _ {p}, \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.266, + 0.784, + 0.311 + ], + "angle": 0, + "content": "where \\(\\mathbf{J}_p\\) denotes the discrete induced current sampling from \\(H_{\\phi}\\), \\(\\xi\\) denotes the contrast, and \\(\\hat{\\mathbf{J}}_p\\) indicates the induced current computed via the above mathematical correlation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.313, + 0.784, + 0.388 + ], + "angle": 0, + "content": "Although \\(\\mathbf{J}_p\\) and \\(\\hat{\\mathbf{J}}_p\\) originate from distinct sources, both represent the induced current values within the same spatial domain. If the same spatial coordinates are given, they should yield identical values irrespective of their generation sources. Therefore, we introduce a state loss to minimize the mismatch between \\(\\mathbf{J}_p\\) and \\(\\hat{\\mathbf{J}}_p\\) as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.417, + 0.39, + 0.786, + 0.43 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {s t a t e}} = \\sum_ {p = 1} ^ {N _ {\\mathrm {t}}} \\| \\hat {\\mathbf {J}} _ {p} - \\mathbf {J} _ {p} \\| ^ {2}, \\tag {14}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.433, + 0.784, + 0.493 + ], + "angle": 0, + "content": "where \\(N_{\\mathrm{t}}\\) is the number of all transmitters. Since Eq. (2) has clearly defined the close correlation between \\(\\pmb{\\xi}\\) and the permittivity values \\(\\varepsilon_r\\), the minimization of the state loss can ultimately optimize \\(F_{\\theta}\\) and \\(H_{\\phi}\\) used for representing the relative permittivity and induced current, respectively." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.495, + 0.784, + 0.555 + ], + "angle": 0, + "content": "Overall loss. The overall loss to train the relative permittivity representation \\( F_{\\theta} \\) and induced current representation \\( H_{\\phi} \\) can be obtained as \\( \\mathcal{L} = \\lambda_{\\mathrm{data}}\\mathcal{L}_{\\mathrm{data}} + \\lambda_{\\mathrm{state}}\\mathcal{L}_{\\mathrm{state}} + \\lambda_{\\mathrm{TV}}\\mathcal{L}_{\\mathrm{TV}} \\), where \\( \\mathcal{L}_{\\mathrm{TV}} \\) is a total variation loss for \\( \\xi \\), and \\( \\lambda_{\\mathrm{data}}, \\lambda_{\\mathrm{state}}, \\lambda_{\\mathrm{TV}} \\) are hyperparameters to balance the loss functions." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.572, + 0.452, + 0.587 + ], + "angle": 0, + "content": "4.3 Implementation details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.593, + 0.785, + 0.743 + ], + "angle": 0, + "content": "We implement our method using PyTorch. Two eight-layer MLPs with 256 channels and ReLU activations are used to predict the relative permittivity \\(\\varepsilon_r\\) and induced current \\(J\\), respectively. Similar to the settings in previous methods based on INRs [39, 51], positional encoding is applied to input positions before they are passed into the MLPs. The ROI \\(D\\) is discretized into \\(64 \\times 64\\) while training. The hyperparameters for the overall loss are set as \\(\\lambda_{\\mathrm{data}} = 1.00\\), \\(\\lambda_{\\mathrm{state}} = 1.00\\), and \\(\\lambda_{\\mathrm{TV}} = 0.01\\). We use the Adam optimizer with default values \\(\\beta_1 = 0.9\\), \\(\\beta_2 = 0.999\\), \\(\\epsilon = 10^{-8}\\), and a learning rate \\(5 \\times 10^{-4}\\) that decays following the exponential scheduler during the optimization. We optimize the model for 4K iterations on a single NVIDIA V100 GPU for all the datasets." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.763, + 0.376, + 0.779 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.79, + 0.41, + 0.805 + ], + "angle": 0, + "content": "5.1 Experiment setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Dataset. We strictly follow the established rules in EISP [36, 53, 57] to set the dataset. We train and test our model on standard benchmarks used for EISP." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.419 + ], + "angle": 0, + "content": "1) Synthetic Circular-cylinder dataset is synthetically generated comprising 1200 images of cylinders with random relative radius, number, and location and permittivity between 1 and 1.5. 2) Synthetic MNIST dataset contains grayscale images of handwritten digits. Similar to previous settings [57, 69], we randomly select 1200 of them to synthesize scatterers with relative permittivity values between 2 and 2.5 according to their corresponding pixel values. Following previous work to generate the above two synthetic datasets, we use 16 transmitters and 32 receivers equally placed on a circle for regular settings, and the data are generated numerically using the method of moments [48] with a \\(224 \\times 224\\) grid mesh to avoid inverse crime [17]. For sparse measurement experiments, we decrease the number of receivers from 32 to 8 to utilize only \\(25\\%\\) of the regular measurement data. 3) Real-world Institut Fresnel's database contains three different dielectric scenarios, namely FoamDielExt, FoamDielInt, and FoamTwinDiel. There are 8 transmitters for FoamDielExt and FoamDielInt, 18 transmitters for FoamTwinDiel, and 241 receivers for all the cases. As the wavelength of the emitted electromagnetic wave should be comparable to or smaller than the size of the target object, we set operating frequency \\(f = 400\\mathrm{MHz}\\) on synthetic datasets, and \\(f = 5\\mathrm{GHz}\\) on real-world datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.419, + 0.788, + 0.585 + ], + "angle": 0, + "content": "Baselines. We maintain the same settings as in previous studies [50,53,57] to ensure a fair comparison. We compare our method with three traditional methods and four deep learning-based approaches: 1) BP [2]: A traditional non-iterative inversion algorithm. 2) Twofold SOM [66]: A traditional iterative minimization scheme by using SVD decomposition. 3) Gs SOM [8]: A traditional subspace-based optimization method by decomposing the operator of Green's function. 4) BPS [57]: A CNN-based image translation method with an initial guess from the BP algorithm. 5) CS-Net [50]: A CNN-based contrast source reconstruction scheme via subspace optimization. 6) Physics-Net [36]: A CNN-based approach that incorporates physical phenomena during training. 7) PGAN [53]: A CNN-based approach using a generative adversarial network." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.586, + 0.8, + 0.71 + ], + "angle": 0, + "content": "Evaluation methodology. We evaluate the quantitative performance of our method using PSNR, SSIM, and Relative Root-Mean-Square Error (RRMSE) [53]. For PSNR and SSIM, a higher value indicates better performance. For RRMSE [53], a lower value indicates better performance. RRMSE is a metric widely used in EISP defined as RRMSE = \\(\\left(\\frac{1}{M \\times M} \\sum_{m=1}^{M} \\sum_{n=1}^{M} \\left| \\frac{\\hat{\\varepsilon}_r(m,n) - \\varepsilon_r(m,n)}{\\varepsilon_r(m,n)} \\right|^2\\right)^{\\frac{1}{2}}\\), where \\(\\varepsilon_r(m,n)\\) and \\(\\hat{\\varepsilon}_r(m,n)\\) are the true and reconstructed discrete relative permittivity of the unknown scatterers at location \\((m,n)\\), respectively, and \\(M \\times M\\) is the total number of subunits over the ROI \\(D\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.736, + 0.421, + 0.751 + ], + "angle": 0, + "content": "5.2 Experiment results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Qualitative results on synthetic data. We first compare the reconstruction quality visually using synthetic data including circular-cylinder dataset [57] and MNIST dataset [19] against all baselines and the results are shown in Fig. 3. Our method achieves superior visual performance compared to all other baselines. Traditional methods, such as BP [2] and Twofold SOM [66], can only recover the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.784, + 0.263 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.274, + 0.788, + 0.357 + ], + "angle": 0, + "content": "Fig. 3: Samples obtained from synthetic Circular-cylinder dataset and MNIST dataset. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. The first row is a standard test case [1,57], a well-known pattern for the evaluation of EISP methods." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.375, + 0.789, + 0.495 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.505, + 0.789, + 0.575 + ], + "angle": 0, + "content": "Fig. 4: Samples obtained from real-world Institut Fresnel's database. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.609, + 0.788, + 0.7 + ], + "angle": 0, + "content": "rough shape of the target and produce inaccurate results at some junction parts. Gs SOM [8] can reconstruct the relative permittivity of the targets with relatively high accuracy, but still has obvious visual defects. Though deep learning-based methods, such as BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53], can produce more accurate estimation, their visual qualities are still far below our proposed method." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.702, + 0.788, + 0.778 + ], + "angle": 0, + "content": "Qualitative results on real-world data. We further test our algorithm on real-world data. The results for all methods are shown in Fig. 4. The visual performance of our method remains superior when applied to real-world data. Conventional methods exhibit a diminished performance, which, when used as input, further negatively impacts the efficacy of deep learning-based approaches." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Noise robustness. We also compare the robustness of the models. By adding different levels of noise to the received scattered fields signal, we use the noisy scattered fields signal to recover the scattered object. The results are shown in Fig. 5. It can be observed that when large noise is added, the results of other" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.784, + 0.257 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.266, + 0.788, + 0.337 + ], + "angle": 0, + "content": "Fig. 5: Samples obtained under \\(5\\%\\) and \\(30\\%\\) noise levels. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.353, + 0.788, + 0.394 + ], + "angle": 0, + "content": "Table 1: Quantitative evaluation compared with BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. Best results are shown in bold." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.407, + 0.784, + 0.505 + ], + "angle": 0, + "content": "
Circular dataset (5%)Circular dataset (30%)MNIST dataset (5%)MNIST dataset (30%)Institut Fresnel's database
RRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNR
Proposed0.0160.96839.200.0270.93834.150.0170.97237.900.0440.89329.700.1270.89727.06
BP0.0480.91628.960.0490.91428.940.1710.75020.020.1740.74419.870.1800.79217.74
Twofold SOM0.0350.91732.270.0400.88031.130.1370.77022.350.1420.74522.130.1490.80423.87
Gs SOM0.0340.92632.740.0350.91632.430.1010.85324.630.1130.81123.730.1350.83724.95
BPS0.0270.96434.200.0340.92832.170.0980.91225.680.1330.85923.210.1660.78718.86
CS-Net0.0240.90033.750.0350.81031.270.1790.78825.370.2270.72424.150.1370.82824.87
Physics-Net0.0240.94537.200.0310.92133.530.0790.93827.740.1130.88924.440.1680.79518.42
PGAN0.0210.95736.890.0300.93333.030.0900.91826.090.1240.87323.640.1670.79418.46
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.536, + 0.785, + 0.58 + ], + "angle": 0, + "content": "bases are greatly affected. However, our method can accurately reconstruct the scatterer under larger noise, demonstrating the superior robustness of the proposed method." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.582, + 0.788, + 0.717 + ], + "angle": 0, + "content": "Evaluation for flexible resolution. The continuity of implicit function allows INR to interpolate and infer at arbitrary points in the input space. This characteristic ensures flexible resolution during the imaging process. As depicted in Fig. 6, we employ a fixed resolution of \\(64 \\times 64\\) during training and acquire images of varying resolutions by sampling the INR at different scales. The use of the random sampling scheme can avoid artifacts in the results. Compared to post-super-resolution methods, like Gs SOM + HAT-L [7], our method can achieve higher quality results. The resolution flexibility of INR paves the way for more in-depth analysis of reconstructed images at various resolution levels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.808 + ], + "angle": 0, + "content": "Quantitative results. The quantitative results of the reconstruction quality in Tab. 1 further validate the proposed method. Higher PSNR and SSIM values suggest our method accurately recovers object shapes and effectively maintains detailed structural information. Lower relative error values indicate our method's predictions of relative permittivity distribution are more accurate compared to other methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Results for sparse measurement. We use \\(25\\%\\) of the standard measurement data to conduct an experiment [50, 57], and the results are shown in Fig. 7." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.789, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.325, + 0.785, + 0.409 + ], + "angle": 0, + "content": "Fig. 6: Comparison of resolution flexibility among different methods. Our method is evaluated against our method without random sampling (RS) scheme, Gs SOM [8], Gs SOM + Cubic/Spline interpolation, and Gs SOM + HAT-L [7], under different resolution settings. All methods are implemented at an original resolution of \\(64 \\times 64\\). The pixel values in the images indicate the values of the relative permittivity. Resolution and RRMSE/SSIM values are shown below each figure." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.422, + 0.785, + 0.487 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.496, + 0.785, + 0.552 + ], + "angle": 0, + "content": "Fig. 7: The results for sparse measurement. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.583, + 0.785, + 0.658 + ], + "angle": 0, + "content": "Our method, leveraging INR, shows superior capability in reconstructing the object's interior from sparse measurements compared with other methods. This also demonstrates that INR is more suitable for representing the relative permittivity distribution of the object compared to other matrix-based representations like Twofold SOM [66] and CS-Net [50]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.785, + 0.794 + ], + "angle": 0, + "content": "Results for 3D scenarios. Our method can naturally generalize to 3D scenarios. In 3D scenarios, we utilize 3D Green's functions in Eq. (4) and Eq. (6), and perform integration over a 3D region of interest. We augment the input dimension of representations for relative permittivity and induced current to align with the 3D coordinates, while keeping the remaining structures unchanged. We collect the 3D scattering data from the synthetic 3D MNIST dataset [30] and real-world dataset [22]. In the synthetic experiments, we employ 40 transmitters and 160 receivers arranged around a unit cube. The results shown in Fig. 8 demonstrate that our method can reconstruct 3D objects by solving EISP." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Time analysis. Our method, BP [2], Twofold SOM [66], and Gs SOM [8] are case-specific methods that do not require additional training time. The BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53] are deep-learning methods that" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.787, + 0.229 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.238, + 0.785, + 0.294 + ], + "angle": 0, + "content": "Fig. 8: The results for 3D scenarios on 3D MINIST dataset [30] and real-world dataset [22]. We show two example cases with three viewing directions. We use isosurface to visualize the ground truths and reconstructed results of the spatial distribution of relative permittivity." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.308, + 0.784, + 0.323 + ], + "angle": 0, + "content": "Table 2: Ablation results compared with single representation for relative permittivity." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.335, + 0.782, + 0.38 + ], + "angle": 0, + "content": "
Parameter counts↓ Time each iteration↓ RRMSE↓ SSIM↑ PSNR↑
Proposed1,019,139117 ms0.0380.90930.36
Single representation493,313289 ms0.0530.87627.32
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.409, + 0.785, + 0.499 + ], + "angle": 0, + "content": "necessitate model training. We count the time for optimization procedure in inference time, and our method outperforms traditional case-specific methods and CS-Net [50]. Although the inference of other deep-learning methods is very fast, their training processes are time-consuming. Additionally, we may be able to reduce the optimization time through modifying the INR structure [42] or improving the training process [61, 62]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.5, + 0.787, + 0.665 + ], + "angle": 0, + "content": "Ablation study Our approach mainly consists of three parts: the representation for relative permittivity, representation for induced current, and random sampling. Since both the data loss \\(\\mathcal{L}_{\\mathrm{data}}\\) and the state loss \\(\\mathcal{L}_{\\mathrm{state}}\\) are necessary for our method, we cannot easily remove any of them. We first use a single representation for relative permittivity to replace the two MLPs in our original approach. Both models are trained on an NVIDIA V100 GPU. From the results shown in Tab. 2, the model with a single MLP takes a longer iteration time to achieve similar performance. We further remove the random sampling scheme and adopt a uniform sampling approach. As shown in the last two columns in Fig. 6, results without random sampling have lower metric values, and the high-resolution results occasionally meet obvious artifacts." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.688, + 0.368, + 0.705 + ], + "angle": 0, + "content": "6 Conclusions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.84 + ], + "angle": 0, + "content": "An implicit solution is presented to the EISP in this paper. We propose implicitly representing the unknown scatterer's relative permittivity distribution as a trainable representation and optimizing these representations within a forward estimation process. A two-MLP strategy is employed to reduce the computation complexity. The experimental results on synthetic and real-world data demonstrate the promising performance of our proposed method. We will further collaborate with other parties to consider our solution in different scenarios, such as medical diagnostics, in more challenging conditions." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.393, + 0.163 + ], + "angle": 0, + "content": "Acknowledgments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.299 + ], + "angle": 0, + "content": "This work was done at Renjie's Research Group at the Department of Computer Science of Hong Kong Baptist University. Renjie's Research Group is supported by the National Natural Science Foundation of China under Grant No. 62302415, Guangdong Basic and Applied Basic Research Foundation under Grant No. 2022A1515110692, 2024A1515012822, and the Blue Sky Research Fund of HKBU under Grant No. BSRF/21-22/16. Boxin Shi is supported by National Natural Science Foundation of China under Grant No. 62136001, 62088102. Haoliang Li is supported by Changsha Technology Fund under its grant No. KH2304007." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.322, + 0.323, + 0.339 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.354, + 0.787, + 0.396 + ], + "angle": 0, + "content": "1. Belkebir, K., Tijhuis, A.: Using multiple frequency information in the iterative solution of a two-dimensional nonlinear inverse problem. In: Proceedings Progress in Electromagnetics Research Symposium (1996)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.397, + 0.787, + 0.424 + ], + "angle": 0, + "content": "2. Belkebir, K., Chaumet, P.C., Sentenac, A.: Superresolution in total internal reflection tomography. Journal of the Optical Society of America A (2005)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.424, + 0.787, + 0.465 + ], + "angle": 0, + "content": "3. Bemana, M., Myszkowski, K., Seidel, H.P., Ritschel, T.: X-fields: Implicit neural view-, light-and time-image interpolation. ACM Transactions on Graphics (TOG) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.466, + 0.787, + 0.493 + ], + "angle": 0, + "content": "4. van den Berg, P.M., Van Broekhoven, A., Abubakar, A.: Extended contrast source inversion. Inverse problems (1999)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.494, + 0.787, + 0.535 + ], + "angle": 0, + "content": "5. Bevacqua, M.T., Di Meo, S., Crocco, L., Isernia, T., Pasian, M.: Millimeter-waves breast cancer imaging via inverse scattering techniques. IEEE Journal of Electromagnetics, RF and Microwaves in Medicine and Biology (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.536, + 0.787, + 0.563 + ], + "angle": 0, + "content": "6. Chen, A., Xu, Z., Geiger, A., Yu, J., Su, H.: TensoRF: Tensorial radiance fields. In: Proceedings of the European Conference on Computer Vision (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.564, + 0.787, + 0.605 + ], + "angle": 0, + "content": "7. Chen, X., Wang, X., Zhou, J., Qiao, Y., Dong, C.: Activating more pixels in image super-resolution transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.606, + 0.787, + 0.632 + ], + "angle": 0, + "content": "8. Chen, X.: Subspace-based optimization method for solving inverse-scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.633, + 0.787, + 0.66 + ], + "angle": 0, + "content": "9. Chen, X.: Computational methods for electromagnetic inverse scattering. John Wiley & Sons (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.66, + 0.787, + 0.702 + ], + "angle": 0, + "content": "0. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.702, + 0.787, + 0.757 + ], + "angle": 0, + "content": "11. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.758, + 0.787, + 0.799 + ], + "angle": 0, + "content": "12. Chen, Z., Zhang, H.: Learning implicit fields for generative shape modeling. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "13. Cheng, Y., Wan, R., Weng, S., Zhu, C., Chang, Y., Shi, B.: Colorizing monochromatic radiance fields. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.354, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "14. Chew, W.C.: Waves and fields in inhomogeneous media, vol. 16. John Wiley & Sons (1999)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.218 + ], + "angle": 0, + "content": "15. Chew, W.C., Wang, Y.M.: Reconstruction of two-dimensional permittivity distribution using the distorted Born iterative method. IEEE Transactions on Medical Imaging (1990)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.219, + 0.785, + 0.246 + ], + "angle": 0, + "content": "16. Colton, D., Kress, R.: Integral Equation Methods in Scattering Theory. SIAM (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.247, + 0.785, + 0.275 + ], + "angle": 0, + "content": "17. Colton, D.L., Kress, R., Kress, R.: Inverse Acoustic and Electromagnetic Scattering Theory. Springer (1998)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.276, + 0.785, + 0.317 + ], + "angle": 0, + "content": "18. Cui, T.J., Chew, W.C., Yin, X.X., Hong, W.: Study of resolution and super resolution in electromagnetic imaging for half-space problems. IEEE Transactions on Antennas and Propagation (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.318, + 0.785, + 0.346 + ], + "angle": 0, + "content": "19. Deng, L.: The MNIST database of handwritten digit images for machine learning research. IEEE Signal Processing Magazine (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.347, + 0.785, + 0.373 + ], + "angle": 0, + "content": "20. Devaney, A.: Inverse-scattering theory within the rytov approximation. Optics Letters (1981)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.375, + 0.785, + 0.416 + ], + "angle": 0, + "content": "21. Gao, F., Van Veen, B.D., Hagness, S.C.: Sensitivity of the distorted born iterative method to the initial guess in microwave breast imaging. IEEE Transactions on Antennas and Propagation (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.417, + 0.785, + 0.445 + ], + "angle": 0, + "content": "22. Geffrin, J., Sabouroux, P.: Continuing with the fresnel database: experimental setup and improvements in 3d scattering measurements. Inverse Problems (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.446, + 0.785, + 0.487 + ], + "angle": 0, + "content": "23. Geng, R., Hu, Y., Chen, Y., et al.: Recent advances on non-line-of-sight imaging: Conventional physical models, deep learning, and new scenes. APSIPA Transactions on Signal and Information Processing (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.488, + 0.785, + 0.528 + ], + "angle": 0, + "content": "24. Geng, R., Li, Y., Zhang, D., Wu, J., Gao, Y., Hu, Y., Chen, Y.: Dream-pcd: Deep reconstruction and enhancement of mmwave radar pointcloud. arXiv preprint arXiv:2309.15374 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.53, + 0.718, + 0.543 + ], + "angle": 0, + "content": "25. Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.545, + 0.785, + 0.572 + ], + "angle": 0, + "content": "26. Grattarola, D., Vandergheynst, P.: Generalised implicit neural representations. In: Advances in Neural Information Processing Systems (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.573, + 0.785, + 0.614 + ], + "angle": 0, + "content": "27. Habashy, T.M., Groom, R.W., Spies, B.R.: Beyond the born and rytov approximations: A nonlinear approach to electromagnetic scattering. Journal of Geophysical Research: Solid Earth (1993)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.615, + 0.785, + 0.642 + ], + "angle": 0, + "content": "28. Habashy, T.M., Oristaglio, M.L., de Hoop, A.T.: Simultaneous nonlinear reconstruction of two-dimensional permittivity and conductivity. Radio Science (1994)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.643, + 0.785, + 0.685 + ], + "angle": 0, + "content": "29. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: European Conference on Computer Vision (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.686, + 0.785, + 0.712 + ], + "angle": 0, + "content": "30. de la Iglesia Castro, D.: 3D mnist: A 3D version of the mnist database of handwritten digits. https://www.kaggle.com/datasets/daavoo/3d-mnist" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.714, + 0.785, + 0.742 + ], + "angle": 0, + "content": "31. Jagatap, G., Hegde, C.: Phase retrieval using untrained neural network priors. In: NeurIPS 2019 Workshop on Solving Inverse Problems with Deep Networks (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.743, + 0.785, + 0.77 + ], + "angle": 0, + "content": "32. Lempitsky, V., Vedaldi, A., Ulyanov, D.: Deep image prior. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.771, + 0.785, + 0.798 + ], + "angle": 0, + "content": "33. Li, J., Pang, M., Dong, Y., Jia, J., Wang, B.: Graph neural network explanations are fragile. In: International Conference on Machine Learning (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "34. Li, L., Wang, L.G., Teixeira, F.L., Liu, C., Nehorai, A., Cui, T.J.: Deepnis: Deep neural network for nonlinear electromagnetic inverse scattering. IEEE Transactions on Antennas and Propagation (2018)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.273, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "35. Li, Y., Zhang, D., Geng, R., Wu, J., Hu, Y., Sun, Q., Chen, Y.: Ifnet: Imaging and focusing network for handheld mmwave devices. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.231 + ], + "angle": 0, + "content": "36. Liu, Z., Roy, M., Prasad, D.K., Agarwal, K.: Physics-guided loss functions improve deep learning performance in inverse scattering. IEEE Transactions on Computational Imaging (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.231, + 0.788, + 0.272 + ], + "angle": 0, + "content": "37. Luo, Z., Guo, Q., Cheung, K.C., See, S., Wan, R.: Copyrnerf: Protecting the copyright of neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.273, + 0.788, + 0.314 + ], + "angle": 0, + "content": "38. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3D reconstruction in function space. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.315, + 0.788, + 0.355 + ], + "angle": 0, + "content": "39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing scenes as neural radiance fields for view synthesis. In: Proceedings of the European Conference on Computer Vision (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.356, + 0.788, + 0.383 + ], + "angle": 0, + "content": "40. Mitra, S.K.: Digital signal processing: a computer-based approach. McGraw-Hill Higher Education (2001)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.384, + 0.788, + 0.411 + ], + "angle": 0, + "content": "41. Mojabi, P., LoVetri, J.: Comparison of te and tm inversions in the framework of the gauss-newton method. IEEE Transactions on Antennas and Propagation (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.412, + 0.788, + 0.439 + ], + "angle": 0, + "content": "42. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.44, + 0.788, + 0.466 + ], + "angle": 0, + "content": "43. Nikolova, N.K.: Microwave imaging for breast cancer. IEEE Microwave Magazine (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.467, + 0.788, + 0.494 + ], + "angle": 0, + "content": "44. Nordebo, S., Gustafsson, M., Nilsson, B.: Fisher information analysis for two-dimensional microwave tomography. Inverse Problems (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.495, + 0.788, + 0.535 + ], + "angle": 0, + "content": "45. O'Loughlin, D., O'Halloran, M., Moloney, B.M., Glavin, M., Jones, E., Elahi, M.A.: Microwave breast imaging: Clinical advances and remaining challenges. IEEE Transactions on Biomedical Engineering (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.536, + 0.788, + 0.59 + ], + "angle": 0, + "content": "46. Pang, M., Wang, B., Ye, M., Cheung, Y.M., Zhou, Y., Huang, W., Wen, B.: Heterogeneous prototype learning from contaminated faces across domains via disentangling latent factors. IEEE Transactions on Neural Networks and Learning Systems (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.591, + 0.788, + 0.633 + ], + "angle": 0, + "content": "47. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.634, + 0.788, + 0.66 + ], + "angle": 0, + "content": "48. Peterson, A.F., Ray, S.L., Mittra, R.: Computational methods for electromagnetics. IEEE Press New York (1998)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.661, + 0.788, + 0.702 + ], + "angle": 0, + "content": "49. Rubæk, T., Meaney, P.M., Meincke, P., Paulsen, K.D.: Nonlinear microwave imaging for breast-cancer screening using gauss-newton's method and the cgls inversion algorithm. IEEE Transactions on Antennas and Propagation (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.702, + 0.788, + 0.73 + ], + "angle": 0, + "content": "50. Sanghvi, Y., Kalepu, Y., Khankhoje, U.K.: Embedding deep learning in inverse scattering problems. IEEE Transactions on Computational Imaging (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.73, + 0.788, + 0.771 + ], + "angle": 0, + "content": "51. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: Advances in Neural Information Processing Systems (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.772, + 0.788, + 0.799 + ], + "angle": 0, + "content": "52. Slaney, M., Kak, A., Larsen, L.: Limitations of imaging with first-order diffraction tomography. IEEE Transactions on Microwave Theory and Techniques (1984)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.788, + 0.841 + ], + "angle": 0, + "content": "53. Song, R., Huang, Y., Xu, K., Ye, X., Li, C., Chen, X.: Electromagnetic inverse scattering with perceptual generative adversarial networks. IEEE Transactions on Computational Imaging (2021)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.356, + 0.127 + ], + "angle": 0, + "content": "Z. Luo et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.787, + 0.175 + ], + "angle": 0, + "content": "54. Stanley, K.O.: Compositional pattern producing networks: A novel abstraction of development. Genetic programming and evolvable machines (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.786, + 0.203 + ], + "angle": 0, + "content": "55. Taflove, A., Hagness, S.C., Piket-May, M.: Computational electromagnetics: the finite-difference time-domain method. The Electrical Engineering Handbook (2005)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.786, + 0.245 + ], + "angle": 0, + "content": "56. Tang, Y., Zhu, C., Wan, R., Xu, C., Shi, B.: Neural underwater scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.786, + 0.273 + ], + "angle": 0, + "content": "57. Wei, Z., Chen, X.: Deep-learning schemes for full-wave nonlinear inverse scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.786, + 0.314 + ], + "angle": 0, + "content": "58. Wei, Z., Chen, X.: Uncertainty quantification in inverse scattering problems with bayesian convolutional neural networks. IEEE Transactions on Antennas and Propagation (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.786, + 0.356 + ], + "angle": 0, + "content": "59. Xu, K., Zhang, C., Ye, X., Song, R.: Fast full-wave electromagnetic inverse scattering based on scalable cascaded convolutional neural networks. IEEE Transactions on Geoscience and Remote Sensing (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.357, + 0.786, + 0.397 + ], + "angle": 0, + "content": "60. Xu, K., Zhong, Y., Wang, G.: A hybrid regularization technique for solving highly nonlinear inverse scattering problems. IEEE Transactions on Microwave Theory and Techniques (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.786, + 0.424 + ], + "angle": 0, + "content": "61. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric iterative machine teaching. In: International Conference on Machine Learning (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.786, + 0.452 + ], + "angle": 0, + "content": "62. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric teaching for multiple learners. Advances in Neural Information Processing Systems (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.786, + 0.479 + ], + "angle": 0, + "content": "63. Zhang, C., Luo, S., Li, J., Wu, Y.C., Wong, N.: Nonparametric teaching of implicit neural representations. In: International Conference on Machine Learning (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.48, + 0.786, + 0.522 + ], + "angle": 0, + "content": "64. Zhang, L., Xu, K., Song, R., Ye, X., Wang, G., Chen, X.: Learning-based quantitative microwave imaging with a hybrid input scheme. IEEE Sensors Journal (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.786, + 0.563 + ], + "angle": 0, + "content": "65. Zhang, X., Zhao, Z.: A new scheme for solving highly nonlinear inverse scattering problems with noise disturbance. IEEE Geoscience and Remote Sensing Letters (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.786, + 0.591 + ], + "angle": 0, + "content": "66. Zhong, Y., Chen, X.: Twofold subspace-based optimization method for solving inverse scattering problems. Inverse Problems (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.592, + 0.786, + 0.632 + ], + "angle": 0, + "content": "67. Zhong, Y., Chen, X.: An ftf twofold subspace-based optimization method for solving electromagnetic inverse scattering problems. IEEE Transactions on Antennas and Propagation (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.786, + 0.674 + ], + "angle": 0, + "content": "68. Zhong, Y., Lambert, M., Lesselier, D., Chen, X.: A new integral equation method to solve highly nonlinear inverse scattering problems. IEEE Transactions on Antennas and Propagation (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.786, + 0.715 + ], + "angle": 0, + "content": "69. Zhou, H., Cheng, Y., Zheng, H., Liu, Q., Wang, Y.: Deep unfolding contrast source inversion for strong scatterers via generative adversarial mechanism. IEEE Transactions on Microwave Theory and Techniques (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.786, + 0.757 + ], + "angle": 0, + "content": "70. Zhu, C., Wan, R., Tang, Y., Shi, B.: Occlusion-free scene recovery via neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.787, + 0.757 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_origin.pdf b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ec311b70c1ffc4becac3073ca644727f8d7c2e90 --- /dev/null +++ b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/89959b6b-be36-4ab9-887a-150c9e878fe2_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5534516bc51864ec2b4b80a4107d46354f223a169f68904ae765a7e991ba62d0 +size 2408233 diff --git a/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/full.md b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/full.md new file mode 100644 index 0000000000000000000000000000000000000000..5ba13219a5b26a15e13d451c8869748a62de5bef --- /dev/null +++ b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/full.md @@ -0,0 +1,333 @@ +# Imaging Interiors: An Implicit Solution to Electromagnetic Inverse Scattering Problems + +Ziyuan Luo $^{1}$ , Boxin Shi $^{2,3}$ , Haoliang Li $^{4}$ , and Renjie Wan $^{1\star}$ + +$^{1}$ Department of Computer Science, Hong Kong Baptist University + +$^{2}$ State Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University + +$^{3}$ National Engineering Research Center of Visual Technology, School of Computer Science, Peking University + +$^{4}$ Department of Electrical Engineering, City University of Hong Kong ziyuanluo@life.hkbu.edu.hk, shiboxin@pku.edu.cn, haoliang.li@cityu.edu.hk, renjiewan@hkbu.edu.hk + +Abstract. Electromagnetic Inverse Scattering Problems (EISP) have gained wide applications in computational imaging. By solving EISP, the internal relative permittivity of the scatterer can be non-invasively determined based on the scattered electromagnetic fields. Despite previous efforts to address EISP, achieving better solutions to this problem has remained elusive, due to the challenges posed by inversion and discretization. This paper tackles those challenges in EISP via an implicit approach. By representing the scatterer's relative permittivity as a continuous implicit representation, our method is able to address the low-resolution problems arising from discretization. Further, optimizing this implicit representation within a forward framework allows us to conveniently circumvent the challenges posed by inverse estimation. Our approach outperforms existing methods on standard benchmark datasets. Project page: https://luo-ziyuan.github.io/Imaging-Interiors. + +Keywords: Electromagnetic inverse scattering problems $\cdot$ Implicit neural representations $\cdot$ Computational photography + +# 1 Introduction + +As electromagnetic waves can penetrate objects' surfaces, they play a key role in non-invasive imaging. Compared with modalities like X-ray and MRI, electromagnetic waves provide a potentially low-cost and safe approach [5, 24, 45] for non-invasive imaging. + +Non-invasive imaging via electromagnetic waves needs to be completed by solving the Electromagnetic Inverse Scattering Problems (EISP). The typical scenario and the associated physical quantities of EISP are displayed in Fig. 1. In EISP, we need to infer the distribution of the scatterer's relative permittivity + +![](images/33bf88e7b02849ae3d49adc38e2fa399e51133a13184ee723e539f2a7566f97d.jpg) +Fig. 1: The results of a standard test case [1,57] in EISP. In an EISP system, the scatterer in the enclosed space $D$ is first illuminated by incoming electromagnetic waves emitted by transmitters and generates scattered fields. Then, the scattered fields measured by receivers are used to determine the scatterer's relative permittivity. We show results obtained by our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. + +from the measured scattered fields [43]. Then, the values of relative permittivity can be visualized to image the objects' internal structures. + +However, solving EISP has never been an easy task. The first challenge comes from the inverse estimation process, where the scatterer's relative permittivity is derived from the measured scattered fields. The multiple scattering effects inherent to the EISP further significantly complicate this inverse estimation [9,34,68]. Furthermore, continuous spaces are usually discretized into finite elements or grids to facilitate numerical computations for electromagnetic computations. This process of discretization inherently leads to a loss of details and a decrease in image resolution for EISP [18, 44]. This consequently poses challenges in accurately distinguishing internal small objects in close proximity. + +The scattering mechanism is crucial in solving EISP [8, 36]. Recent deep-learning-based methods [34, 57] first obtain a rough image using traditional algorithms (e.g., BP [2] shown in Fig. 1) and then refine this rough result using image-to-image translation networks. However, with the imaging process being divided into two distinct stages, the measured physical data are overlooked in the second phase, inevitably resulting in images of inferior quality (e.g., BPS [57] and PGAN [53] shown in Fig. 1). Besides, as the relative permittivity distributions can vary greatly across different objects, a single network may be insufficient to reflect these differences. Therefore, a more appropriate approach is to optimize for each object while thoroughly considering the scattering mechanisms. Traditional methods like Twofold SOM [66] and Gs SOM [8] achieve this goal by discretizing continuous relative permittivity values into discrete variables expressed as to-be-optimized matrices [8, 15, 66]. However, they cannot address the low-resolution issues that arise from discretization, as shown in Fig. 1. Moreover, + +these methods have difficulties in handling sparse measurement data, which usually leads to low reconstruction quality. Thus, we need a more powerful representation scheme beyond the discrete matrix form. + +Since the scatterer's relative permittivity distribution used for imaging is intimately related to the spatial position [15], the envisioned approach should indicate such location-dependent physical quantity. Moreover, for better imaging quality, the approach should have the capacity to eliminate the low-resolution curse made by discretization. Therefore, we propose to represent the scatterer's relative permittivity distribution via Implicit Neural Representations (INR), as INR has remarkable capability in modeling location-dependent relationships [39, 51]. Its flexibility in handling image resolutions [10, 11, 29] also helps to alleviate the curse made by discretization. Besides, INR is known for its case-by-case optimization strategy, which can faithfully reflect each object's internal differences. In addition, INRs exhibit a strong capacity to recover information from incomplete data across a range of tasks [31, 32, 39], which can address the difficulties caused by sparse measurement. We then optimize the INR of each object by making sure that this representation can produce results akin to the actual measurements. Such an optimization based on forward estimation can help to address the difficulties caused by inverse estimation. Once the optimization settles down, we can access the relative permittivity values by using their corresponding locations and visualize them for imaging purposes. + +Our solution is illustrated in Fig. 2. We use the Multilayer Perceptron (MLP) as the backbone of INR. Specifically, two MLPs are used to represent the relative permittivity and the induced current. It allows us to bypass complex matrix inversions in optimization, largely reducing the computational cost. To optimize the implicit representations, we propose to use a data loss and a state loss by fully considering the relationships between various physical quantities in the scattering process. Meanwhile, a random sampling strategy is designed for comprehensive consideration of each spatial position during optimization. Our primary contributions can be summarized as follows: + +- We propose a solution to EISP based on forward estimation to avoid difficulties triggered by inverse estimation. +- We introduce the use of the learnable INR for the object's relative permittivity distribution to indicate the location-dependent quantity and achieve flexibility in imaging resolution. +- We explore a novel strategy that utilizes two separate MLPs for two physical quantities to avoid complex computations caused by matrix inversion. + +The research for solving EISP has established standard benchmarks for evaluation [9, 53, 57]. We strictly follow these standard benchmarks in our research, including system settings, datasets, and metrics. + +# 2 Related work + +Electromagnetic inverse scattering problems (EISP). Conventional approaches for EISP can be classified as non-iterative and iterative categories. + +Non-iterative methods tackle nonlinear issues by converting them into linear equations, such as the Born approximation [52], Rytov approximation [20, 27], and back-propagation (BP) method [2]. Since non-iterative methods are limited by reconstruction quality, other methods, such as the Subspace Optimization Method (SOM) [8, 60, 67], Contrast Source Inversion (CSI) Method [4, 28], Distorted Born Iterative Method (DBIM) [21], and other Newton-type methods [41, 49], are proposed to solve this problem in an iterative way. Despite their feasibility, their performance is highly sensitive to the initial guess, which undermines their robustness. Neural networks have recently been employed to construct nonlinear mappings linking the dispersed fields and the obscure constitutive attributes of scatterers [23, 35]. Most methods consider EISP in two stages [34, 57, 59, 64], where traditional approaches [2, 52] are first employed to obtain coarse images, and then the trained image-to-image neural networks are used for post-processing. However, due to the lack of consideration for scattering mechanisms, those methods encounter nearly all the difficulties faced by deep learning [33, 46], which easily causes their post-processing efforts to fail. We consider an implicit forward approach to overcome the aforementioned difficulties by optimizing a trainable implicit representation within a forward process. + +Implicit neural representations (INR). Implicit neural representations usually employ an MLP to map from local coordinates to the associated values on that coordinates [26,51,63], such as intensity for images and videos, or occupancy value for 3D volumes. The basics of INR are briefly explained below. INR is a neural network $F_{\theta}:\mathbf{x}\mapsto F_{\theta}(\mathbf{x})$ that continuously maps the coordinates $\mathbf{x}$ to the corresponding quantity of interest. For the data expressed as a function $\varPhi:\mathbf{x}\mapsto\varPhi(\mathbf{x})$ , the INR $F_{\theta}$ is a solution to $F_{\theta}(\mathbf{x}) - \varPhi(\mathbf{x}) = 0$ . Typically, the weight of INR, $\theta$ , can be obtained through optimization. INR has shown its advantages in parameterizing geometry and learning priors over shapes, as demonstrated by DeepSDF [47], Occupancy Networks [38], and IM-Net [12]. A considerable amount of subsequent research has proposed volumetric rendering of 3D implicit representations, including Neural Radiance Fields (NeRF) [39] and its acceleration [6,42], quality enhancement [13,56,70], and copyright protection [37]. In the realm of 2D image representation, CPPNs [54] first proposed the use of neural networks to parameterize images implicitly. SIRENs [51] proposed generalization across implicit representations of images via hypernetworks. X-Fields [3] parameterizes the Jacobian of pixel position with respect to view, time, and illumination. In this work, we employ INR as the backbone to represent the scatterer's properties, which is able to characterize the complex spatial correlation in EISP and produce better imaging quality. + +# 3 Physical model of EISP + +As shown in Fig. 1, for an EISP system, the object to be imaged is defined as the unknown scatterer, and the enclosed space is represented by a square Region of Interest (ROI) denoted by $D$ . Transmitters and receivers are positioned around + +$D$ to emit electromagnetic waves and measure the scattered electromagnetic fields, respectively. + +Generally, the data measurement process can be split into two stages. At the first stage, the induced current is excited as the electromagnetic waves from the transmitters interact with the scatterer, aka wave-scatterer interaction. Subsequently, the induced current serves as a radiation source, generating the scattered fields. The total electric fields within $D$ can be described by Lippmann-Schwinger equation [16], aka state equation, as follows: + +$$ +E ^ {\mathrm {t}} (\mathbf {x}) = E ^ {\mathrm {i}} (\mathbf {x}) + k _ {0} ^ {2} \int_ {D} g \left(\mathbf {x}, \mathbf {x} ^ {\prime}\right) J \left(\mathbf {x} ^ {\prime}\right) d \mathbf {x} ^ {\prime}, \mathbf {x} \in D, \tag {1} +$$ + +where $\mathbf{x}$ and $\mathbf{x}'$ are the spatial coordinates. $E^{\mathrm{i}}$ is the incident electric fields directly from transmitters, while $E^{\mathrm{t}}$ is the total electric fields consisting of the original incident fields coming directly from transmitters and the scattered fields coming from scatterers. $k_{0}$ is the wavenumber computed from the signal frequency, and $g$ is the free space Green's function. The relationship between the induced current $J$ and total electric fields $E^{\mathrm{t}}$ can be expressed as follows: + +$$ +J (\mathbf {x}) = \xi (\mathbf {x}) E ^ {t} (\mathbf {x}). \tag {2} +$$ + +In Eq. (2), $\xi$ is the contrast defined as $\xi (\mathbf{x}) = \varepsilon_r(\mathbf{x}) - 1$ , where $\varepsilon_r(\mathbf{x})$ denotes the relative permittivity of the unknown scatterer. + +The second equation describes the scattered fields as a reradiation of the induced current [16], aka data equation, as follows: + +$$ +E ^ {\mathrm {s}} (\mathbf {x}) = k _ {0} ^ {2} \int_ {D} g \left(\mathbf {x}, \mathbf {x} ^ {\prime}\right) J \left(\mathbf {x} ^ {\prime}\right) d \mathbf {x} ^ {\prime}, \mathbf {x} \in S, \tag {3} +$$ + +where $E^{s}$ is the scattered fields that can be measured by receivers at surface $S$ around the ROI $D$ . + +Since the digital signal analysis is only available on discrete variables [40,55], Eq. (1) to Eq. (3) are inevitably transformed to their discrete counterparts. Specifically, the ROI $D$ is discretized into $M \times M$ square subunits and the method of moments [48] is employed to obtain the discrete scattered fields. The relationship between discrete contrast $\xi$ and discrete relative permittivity $\varepsilon_r$ can be expressed as $\xi = \varepsilon_r - 1$ . Then, Eq. (1) can be reformulated as follows: + +$$ +\mathbf {E} ^ {\mathrm {t}} = \mathbf {E} ^ {\mathrm {i}} + \mathbf {G} _ {D} \cdot \mathbf {J}, \tag {4} +$$ + +where $\mathbf{E}^{\mathrm{t}}$ , $\mathbf{E}^{\mathrm{i}}$ , and $\mathbf{J}$ are the discrete $E^t$ , $E^i$ , and $J$ , respectively. $\mathbf{G}_D$ is discrete free space Green's function in $D$ . The discrete version of Eq. (2) can be represented as follows [53]: + +$$ +\mathbf {J} = \operatorname {D i a g} (\boldsymbol {\xi}) \cdot \mathbf {E} ^ {\mathrm {t}}, \tag {5} +$$ + +![](images/4f8c34bf4412d06e0325b93bc75e2e1ad79aa6f3775f61ea0b5050790d15830a.jpg) +Fig. 2: Overview of our implicit method. Two MLPs, $F_{\theta}$ and $H_{\phi}$ , are used to implicitly represent relative permittivity $\varepsilon_{r}$ and induced current $J$ , respectively. Random sampling is applied for comprehensive optimization. The predicted induced current $\hat{\mathbf{J}}$ is calculated by Eq. (13) based on relative permittivity $\varepsilon_{r}$ queried from $F_{\theta}$ and induced current $J$ directly queried from $H_{\phi}$ . Then the state loss $\mathcal{L}_{\mathrm{state}}$ is calculated by comparing the predicted $\hat{\mathbf{J}}$ and directly queried $\mathbf{J}$ . Besides, the directly queried induced current $\mathbf{J}$ is used to compute the scattered fields $\hat{\mathbf{E}}^{\mathrm{s}}$ by Eq. (11). Data loss function $\mathcal{L}_{\mathrm{data}}$ is constructed to evaluate the difference between predicted scattered fields $\hat{\mathbf{E}}^{\mathrm{s}}$ and the measured values $\mathbf{E}^{\mathrm{s}}$ . + +where $\mathrm{Diag}(\pmb {\xi})$ is the diagonal matrix of contrast function. Similarly, Eq. (3) can be discretized as follows: + +$$ +\mathbf {E} ^ {\mathrm {s}} = \mathbf {G} _ {S} \cdot \mathbf {J}, \tag {6} +$$ + +where $\mathbf{E}^{\mathrm{s}}$ is the discrete $E^{s}$ , and $\mathbf{G}_S$ is the discrete Green's function to map contrast source $\mathbf{J}$ to scattered fields $\mathbf{E}^{\mathrm{s}}$ . + +The task of EISP is to infer the relative permittivity $\varepsilon_r$ , a value closely related to $\xi$ , from the scattered fields $\mathbf{E}^s$ measured by receivers, and then visualize it in an image. In an EISP system, knowing only $\mathbf{E}^{\mathrm{i}}$ and $\mathbf{E}^{\mathrm{s}}$ makes it challenging to estimate $\xi$ inversely from $\mathbf{E}^{\mathrm{s}}$ based on Eq. (6). Furthermore, the inherent nonlinearity originating from $\mathbf{G}_D \cdot \mathbf{J}$ in Eq. (4) complicates the estimation process [14, 18, 65]. Ultimately, $\varepsilon_r$ , a variable with continuous characteristics, can only be derived using the aforementioned discrete equations, thereby compromising the imaging resolution. Consequently, an effective strategy is necessary to produce more accurate outcomes for EISP. + +# 4 Proposed implicit solution + +As depicted in Fig. 2, our fundamental idea is to solve the inverse scattering problem within a forward estimation process, which can be described by reformulating Eq. (4) to Eq. (6) as follows: + +$$ +\mathbf {E} ^ {\mathrm {s}} = \mathbf {G} _ {S} \cdot \operatorname {D i a g} (\pmb {\xi}) \cdot \left(\mathbf {I} - \mathbf {G} _ {D} \operatorname {D i a g} (\pmb {\xi})\right) ^ {- 1} \cdot \mathbf {E} ^ {\mathrm {i}}, \tag {7} +$$ + +where $\mathbf{I}$ is the identity matrix. Contrary to previous approaches [2,52] that treat $\pmb{\xi}$ as unknown, we regard the contrast $\pmb{\xi}$ as a known quantity, by establishing relative permittivity $\varepsilon_{r}$ involved in Eq. (2) as a learnable implicit representation. Then, we can calculate $\mathbf{E}^{\mathrm{s}}$ triggered by Eq. (7). During training, by contrasting the calculated $\mathbf{E}^{\mathrm{s}}$ with the measured true ones, the learnable representation can finally reach its optimum status. Since we do not aim to inversely express $\pmb{\xi}$ as an explicit function of $\mathbf{E}^{\mathrm{s}}$ , this optimization-in-forward approach can alleviate the challenges associated with inverse estimation and nonlinearity. The use of INR also ensures enhanced flexibility in imaging resolution. During inference, we can directly obtain the relative permittivity values by querying the representation with the corresponding coordinates. + +# 4.1 Continuous representation for EISP + +Representation for relative permittivity. We use a multilayer perceptron (MLP) with parameters $\theta$ to map the continuous spatial coordinates $\mathbf{x}$ to its associating relative permittivity values, which can be briefly described as follows: + +$$ +\varepsilon_ {r} (\mathbf {x}) = F _ {\theta} (\gamma (\mathbf {x})), \tag {8} +$$ + +where $\varepsilon_r^6$ denotes the relative permittivity obtained by querying the spatial coordinates within the continuous representation $F_{\theta}$ . We further apply the positional encoding for $\mathbf{x}$ to facilitate the fitting capability of the model as follows: + +$$ +\gamma (\mathbf {x}) = \left[ \sin \mathbf {x}, \cos \mathbf {x}, \dots , \sin 2 ^ {\Omega - 1} \mathbf {x}, \cos 2 ^ {\Omega - 1} \mathbf {x} \right] ^ {\top}, \tag {9} +$$ + +where $\varOmega$ is a hyperparameter controlling the spectral bandwidth. + +To optimize this continuous representation, we apply a series of equations defined by the computation of forward estimation, and then compare the scattered fields incited by this representation with the measured true ones. As discussed in Sec. 3, since the discretization is unavoidable during the forward computation, we only query discrete spatial coordinates during optimization to align with the discretization policy set by the method of moments [48]. Though we can directly perform the forward computation via Eq. (7), the computation complexity caused by its internal matrix inversion places a high demand on computing resources and potentially compromises the stability of problem-solving [25]. + +Representation for induced current. To avoid the complexity caused by matrix inversion, instead of the explicit computation defined in Eq. (7), we implicitly represent $\mathbf{J}$ as its continuous form using another MLP. By analyzing Eq. (7), the induced current is related to two variables: the discrete contrast $\xi$ and the incident electric fields $\mathbf{E}^{\mathrm{i}}$ caused by transmitters. To faithfully describe such correlation, we propose to consider the representation for $J$ as the mapping based on the spatial coordinates $\mathbf{x}$ and the transmitter's position $\mathbf{x}^{\mathrm{t}}$ , which can be defined as follows: + +$$ +J (\mathbf {x}, \mathbf {x} ^ {\mathrm {t}}) = H _ {\phi} \left(\gamma (\mathbf {x}), \gamma (\mathbf {x} ^ {\mathrm {t}})\right), \tag {10} +$$ + +where $H_{\phi}$ is a continuous function consisting of fully connected networks. + +Random spatial sampling. Due to the necessity of discretization in numerical computations to perform forward process, we need to spatially query the representations $F_{\theta}$ and $H_{\phi}$ at some positions to obtain their discrete forms. A typical approach is to divide the ROI $D$ evenly into grids and deterministically sample the center location of each grid [36, 50]. However, the representations would only be queried at a fixed discrete set of locations in this way [39]. To take a comprehensive consideration of each spatial position, we use a random sampling scheme where we partition ROI $D$ into $M \times M$ evenly-spaced grids, and the center of $(m,n)$ grid is $(x_m,y_n)$ . Each sample location $(x_m^{\mathrm{sample}},y_n^{\mathrm{sample}})$ is then randomly drawn from a Gaussian distribution: $x_m^{\mathrm{sample}} \sim \mathcal{N}(x_m,\sigma^2)$ , $y_n^{\mathrm{sample}} \sim \mathcal{N}(y_n,\sigma^2)$ , where $\sigma$ is a hyperparameter to control the dispersion level of sample points around their means. By probabilistically sampling each spatial position, this scheme can alleviate the overlook of specific locations. + +# 4.2 Forward calculation based optimization + +The continuous representations obtained before can estimate corresponding physical quantities using spatial coordinates, but optimizing them directly with estimated values is hard because obtaining their true values is difficult [58]. Therefore, we indirectly refine the representations denoted by $F_{\theta}$ and $H_{\phi}$ by proposing a data loss and a state loss while fully considering the physical relationships. + +Data loss. Based on Sec. 3, the wave-scatterer interaction leads to the induced current when the electromagnetic waves from transmitters interact with the scatterer. Then, the induced current generates the scattered fields, which can be measured by receivers. Thus, a straightforward way to refine the representations is to minimize the distance between the scattered fields computed from the representations and the true ones. With the discrete induced current $\mathbf{J}$ sampling from the continuous representation $H_{\phi}$ defined in Eq. (10), we can obtain the predicted scattered fields by reformulating the data equation in Eq. (6) as follows: + +$$ +\hat {\mathbf {E}} _ {p} ^ {\mathrm {s}} = \mathbf {G} _ {S} \cdot \mathbf {J} _ {p}, \tag {11} +$$ + +where $\mathbf{G}_S$ denotes the discrete Green's function, and $\mathbf{J}_p$ and $\hat{\mathbf{E}}_p^s$ denotes the discrete induced current and predicted scattered fields inspired by the $p$ -th transmitter, respectively. + +We then define our data loss used to contrast the predicted scattered fields with the measured true ones as follows: + +$$ +\mathcal {L} _ {\mathrm {d a t a}} = \sum_ {p = 1} ^ {N _ {\mathrm {t}}} \| \hat {\mathbf {E}} _ {p} ^ {\mathrm {s}} - \mathbf {E} _ {p} ^ {\mathrm {s}} \| ^ {2}, \tag {12} +$$ + +where $\mathbf{E}_p^s$ is the true scattered fields measured by receivers, and $N_{t}$ denotes the number of all transmitters. The data loss enhances the optimization of the representation by accounting for discrepancies associated with all transmitters. + +State loss. Although the data loss is straightforward, it cannot be used to optimize $F_{\theta}$ . Since the induced current $\mathbf{J}_p$ is directly obtained by querying its representation $H_{\phi}$ , Eq. (12) does not contain any variables related to $F_{\theta}$ . To effectively optimize $F_{\theta}$ , we consider minimizing the mismatch emerging from the state equation defined in Eq. (4) and Eq. (5). Specifically, by reformulating Eq. (7), an expression related to $p$ -th transmitter can be obtained as follows: + +$$ +\mathbf {\hat {J}} _ {p} = \operatorname {D i a g} (\boldsymbol {\xi}) \cdot \mathbf {E} _ {p} ^ {\mathrm {i}} + \operatorname {D i a g} (\boldsymbol {\xi}) \cdot \mathbf {G} _ {D} \cdot \mathbf {J} _ {p}, \tag {13} +$$ + +where $\mathbf{J}_p$ denotes the discrete induced current sampling from $H_{\phi}$ , $\xi$ denotes the contrast, and $\hat{\mathbf{J}}_p$ indicates the induced current computed via the above mathematical correlation. + +Although $\mathbf{J}_p$ and $\hat{\mathbf{J}}_p$ originate from distinct sources, both represent the induced current values within the same spatial domain. If the same spatial coordinates are given, they should yield identical values irrespective of their generation sources. Therefore, we introduce a state loss to minimize the mismatch between $\mathbf{J}_p$ and $\hat{\mathbf{J}}_p$ as follows: + +$$ +\mathcal {L} _ {\text {s t a t e}} = \sum_ {p = 1} ^ {N _ {\mathrm {t}}} \| \hat {\mathbf {J}} _ {p} - \mathbf {J} _ {p} \| ^ {2}, \tag {14} +$$ + +where $N_{\mathrm{t}}$ is the number of all transmitters. Since Eq. (2) has clearly defined the close correlation between $\pmb{\xi}$ and the permittivity values $\varepsilon_r$ , the minimization of the state loss can ultimately optimize $F_{\theta}$ and $H_{\phi}$ used for representing the relative permittivity and induced current, respectively. + +Overall loss. The overall loss to train the relative permittivity representation $F_{\theta}$ and induced current representation $H_{\phi}$ can be obtained as $\mathcal{L} = \lambda_{\mathrm{data}}\mathcal{L}_{\mathrm{data}} + \lambda_{\mathrm{state}}\mathcal{L}_{\mathrm{state}} + \lambda_{\mathrm{TV}}\mathcal{L}_{\mathrm{TV}}$ , where $\mathcal{L}_{\mathrm{TV}}$ is a total variation loss for $\xi$ , and $\lambda_{\mathrm{data}}, \lambda_{\mathrm{state}}, \lambda_{\mathrm{TV}}$ are hyperparameters to balance the loss functions. + +# 4.3 Implementation details + +We implement our method using PyTorch. Two eight-layer MLPs with 256 channels and ReLU activations are used to predict the relative permittivity $\varepsilon_r$ and induced current $J$ , respectively. Similar to the settings in previous methods based on INRs [39, 51], positional encoding is applied to input positions before they are passed into the MLPs. The ROI $D$ is discretized into $64 \times 64$ while training. The hyperparameters for the overall loss are set as $\lambda_{\mathrm{data}} = 1.00$ , $\lambda_{\mathrm{state}} = 1.00$ , and $\lambda_{\mathrm{TV}} = 0.01$ . We use the Adam optimizer with default values $\beta_1 = 0.9$ , $\beta_2 = 0.999$ , $\epsilon = 10^{-8}$ , and a learning rate $5 \times 10^{-4}$ that decays following the exponential scheduler during the optimization. We optimize the model for 4K iterations on a single NVIDIA V100 GPU for all the datasets. + +# 5 Experiments + +# 5.1 Experiment setup + +Dataset. We strictly follow the established rules in EISP [36, 53, 57] to set the dataset. We train and test our model on standard benchmarks used for EISP. + +1) Synthetic Circular-cylinder dataset is synthetically generated comprising 1200 images of cylinders with random relative radius, number, and location and permittivity between 1 and 1.5. 2) Synthetic MNIST dataset contains grayscale images of handwritten digits. Similar to previous settings [57, 69], we randomly select 1200 of them to synthesize scatterers with relative permittivity values between 2 and 2.5 according to their corresponding pixel values. Following previous work to generate the above two synthetic datasets, we use 16 transmitters and 32 receivers equally placed on a circle for regular settings, and the data are generated numerically using the method of moments [48] with a $224 \times 224$ grid mesh to avoid inverse crime [17]. For sparse measurement experiments, we decrease the number of receivers from 32 to 8 to utilize only $25\%$ of the regular measurement data. 3) Real-world Institut Fresnel's database contains three different dielectric scenarios, namely FoamDielExt, FoamDielInt, and FoamTwinDiel. There are 8 transmitters for FoamDielExt and FoamDielInt, 18 transmitters for FoamTwinDiel, and 241 receivers for all the cases. As the wavelength of the emitted electromagnetic wave should be comparable to or smaller than the size of the target object, we set operating frequency $f = 400\mathrm{MHz}$ on synthetic datasets, and $f = 5\mathrm{GHz}$ on real-world datasets. + +Baselines. We maintain the same settings as in previous studies [50,53,57] to ensure a fair comparison. We compare our method with three traditional methods and four deep learning-based approaches: 1) BP [2]: A traditional non-iterative inversion algorithm. 2) Twofold SOM [66]: A traditional iterative minimization scheme by using SVD decomposition. 3) Gs SOM [8]: A traditional subspace-based optimization method by decomposing the operator of Green's function. 4) BPS [57]: A CNN-based image translation method with an initial guess from the BP algorithm. 5) CS-Net [50]: A CNN-based contrast source reconstruction scheme via subspace optimization. 6) Physics-Net [36]: A CNN-based approach that incorporates physical phenomena during training. 7) PGAN [53]: A CNN-based approach using a generative adversarial network. + +Evaluation methodology. We evaluate the quantitative performance of our method using PSNR, SSIM, and Relative Root-Mean-Square Error (RRMSE) [53]. For PSNR and SSIM, a higher value indicates better performance. For RRMSE [53], a lower value indicates better performance. RRMSE is a metric widely used in EISP defined as RRMSE = $\left(\frac{1}{M \times M} \sum_{m=1}^{M} \sum_{n=1}^{M} \left| \frac{\hat{\varepsilon}_r(m,n) - \varepsilon_r(m,n)}{\varepsilon_r(m,n)} \right|^2\right)^{\frac{1}{2}}$ , where $\varepsilon_r(m,n)$ and $\hat{\varepsilon}_r(m,n)$ are the true and reconstructed discrete relative permittivity of the unknown scatterers at location $(m,n)$ , respectively, and $M \times M$ is the total number of subunits over the ROI $D$ . + +# 5.2 Experiment results + +Qualitative results on synthetic data. We first compare the reconstruction quality visually using synthetic data including circular-cylinder dataset [57] and MNIST dataset [19] against all baselines and the results are shown in Fig. 3. Our method achieves superior visual performance compared to all other baselines. Traditional methods, such as BP [2] and Twofold SOM [66], can only recover the + +![](images/5697cea5576e5c1d99aa483f824e2070f89ca69e032217181be4a312042b1f01.jpg) +Fig. 3: Samples obtained from synthetic Circular-cylinder dataset and MNIST dataset. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. The first row is a standard test case [1,57], a well-known pattern for the evaluation of EISP methods. + +![](images/81c8e8ac99c6dc97efec6ca501b20f790b03d3613f564976487c9f3233154133.jpg) +Fig. 4: Samples obtained from real-world Institut Fresnel's database. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. + +rough shape of the target and produce inaccurate results at some junction parts. Gs SOM [8] can reconstruct the relative permittivity of the targets with relatively high accuracy, but still has obvious visual defects. Though deep learning-based methods, such as BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53], can produce more accurate estimation, their visual qualities are still far below our proposed method. + +Qualitative results on real-world data. We further test our algorithm on real-world data. The results for all methods are shown in Fig. 4. The visual performance of our method remains superior when applied to real-world data. Conventional methods exhibit a diminished performance, which, when used as input, further negatively impacts the efficacy of deep learning-based approaches. + +Noise robustness. We also compare the robustness of the models. By adding different levels of noise to the received scattered fields signal, we use the noisy scattered fields signal to recover the scattered object. The results are shown in Fig. 5. It can be observed that when large noise is added, the results of other + +![](images/f6b54086c7826be321185353b1507816a90e008afd0c11697536f76e4b2917c6.jpg) +Fig. 5: Samples obtained under $5\%$ and $30\%$ noise levels. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. + +Table 1: Quantitative evaluation compared with BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. Best results are shown in bold. + +
Circular dataset (5%)Circular dataset (30%)MNIST dataset (5%)MNIST dataset (30%)Institut Fresnel's database
RRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNR
Proposed0.0160.96839.200.0270.93834.150.0170.97237.900.0440.89329.700.1270.89727.06
BP0.0480.91628.960.0490.91428.940.1710.75020.020.1740.74419.870.1800.79217.74
Twofold SOM0.0350.91732.270.0400.88031.130.1370.77022.350.1420.74522.130.1490.80423.87
Gs SOM0.0340.92632.740.0350.91632.430.1010.85324.630.1130.81123.730.1350.83724.95
BPS0.0270.96434.200.0340.92832.170.0980.91225.680.1330.85923.210.1660.78718.86
CS-Net0.0240.90033.750.0350.81031.270.1790.78825.370.2270.72424.150.1370.82824.87
Physics-Net0.0240.94537.200.0310.92133.530.0790.93827.740.1130.88924.440.1680.79518.42
PGAN0.0210.95736.890.0300.93333.030.0900.91826.090.1240.87323.640.1670.79418.46
+ +bases are greatly affected. However, our method can accurately reconstruct the scatterer under larger noise, demonstrating the superior robustness of the proposed method. + +Evaluation for flexible resolution. The continuity of implicit function allows INR to interpolate and infer at arbitrary points in the input space. This characteristic ensures flexible resolution during the imaging process. As depicted in Fig. 6, we employ a fixed resolution of $64 \times 64$ during training and acquire images of varying resolutions by sampling the INR at different scales. The use of the random sampling scheme can avoid artifacts in the results. Compared to post-super-resolution methods, like Gs SOM + HAT-L [7], our method can achieve higher quality results. The resolution flexibility of INR paves the way for more in-depth analysis of reconstructed images at various resolution levels. + +Quantitative results. The quantitative results of the reconstruction quality in Tab. 1 further validate the proposed method. Higher PSNR and SSIM values suggest our method accurately recovers object shapes and effectively maintains detailed structural information. Lower relative error values indicate our method's predictions of relative permittivity distribution are more accurate compared to other methods. + +Results for sparse measurement. We use $25\%$ of the standard measurement data to conduct an experiment [50, 57], and the results are shown in Fig. 7. + +![](images/6dad85b08860f042e73cc2f674dd380b99ca534c750ad7e3c7b066578dd84a8f.jpg) +Fig. 6: Comparison of resolution flexibility among different methods. Our method is evaluated against our method without random sampling (RS) scheme, Gs SOM [8], Gs SOM + Cubic/Spline interpolation, and Gs SOM + HAT-L [7], under different resolution settings. All methods are implemented at an original resolution of $64 \times 64$ . The pixel values in the images indicate the values of the relative permittivity. Resolution and RRMSE/SSIM values are shown below each figure. + +![](images/dec7d58bc2e3b1576e0b632ea8893123261c6ec993bb4ed756ed9bf629b47ca4.jpg) +Fig. 7: The results for sparse measurement. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. + +Our method, leveraging INR, shows superior capability in reconstructing the object's interior from sparse measurements compared with other methods. This also demonstrates that INR is more suitable for representing the relative permittivity distribution of the object compared to other matrix-based representations like Twofold SOM [66] and CS-Net [50]. + +Results for 3D scenarios. Our method can naturally generalize to 3D scenarios. In 3D scenarios, we utilize 3D Green's functions in Eq. (4) and Eq. (6), and perform integration over a 3D region of interest. We augment the input dimension of representations for relative permittivity and induced current to align with the 3D coordinates, while keeping the remaining structures unchanged. We collect the 3D scattering data from the synthetic 3D MNIST dataset [30] and real-world dataset [22]. In the synthetic experiments, we employ 40 transmitters and 160 receivers arranged around a unit cube. The results shown in Fig. 8 demonstrate that our method can reconstruct 3D objects by solving EISP. + +Time analysis. Our method, BP [2], Twofold SOM [66], and Gs SOM [8] are case-specific methods that do not require additional training time. The BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53] are deep-learning methods that + +![](images/f0b0d017429d516fb4aa53a37c3cd228653bc76e4c91ceee059318db0c661317.jpg) +Fig. 8: The results for 3D scenarios on 3D MINIST dataset [30] and real-world dataset [22]. We show two example cases with three viewing directions. We use isosurface to visualize the ground truths and reconstructed results of the spatial distribution of relative permittivity. + +Table 2: Ablation results compared with single representation for relative permittivity. + +
Parameter counts↓ Time each iteration↓ RRMSE↓ SSIM↑ PSNR↑
Proposed1,019,139117 ms0.0380.90930.36
Single representation493,313289 ms0.0530.87627.32
+ +necessitate model training. We count the time for optimization procedure in inference time, and our method outperforms traditional case-specific methods and CS-Net [50]. Although the inference of other deep-learning methods is very fast, their training processes are time-consuming. Additionally, we may be able to reduce the optimization time through modifying the INR structure [42] or improving the training process [61, 62]. + +Ablation study Our approach mainly consists of three parts: the representation for relative permittivity, representation for induced current, and random sampling. Since both the data loss $\mathcal{L}_{\mathrm{data}}$ and the state loss $\mathcal{L}_{\mathrm{state}}$ are necessary for our method, we cannot easily remove any of them. We first use a single representation for relative permittivity to replace the two MLPs in our original approach. Both models are trained on an NVIDIA V100 GPU. From the results shown in Tab. 2, the model with a single MLP takes a longer iteration time to achieve similar performance. We further remove the random sampling scheme and adopt a uniform sampling approach. As shown in the last two columns in Fig. 6, results without random sampling have lower metric values, and the high-resolution results occasionally meet obvious artifacts. + +# 6 Conclusions + +An implicit solution is presented to the EISP in this paper. We propose implicitly representing the unknown scatterer's relative permittivity distribution as a trainable representation and optimizing these representations within a forward estimation process. A two-MLP strategy is employed to reduce the computation complexity. The experimental results on synthetic and real-world data demonstrate the promising performance of our proposed method. We will further collaborate with other parties to consider our solution in different scenarios, such as medical diagnostics, in more challenging conditions. + +# Acknowledgments + +This work was done at Renjie's Research Group at the Department of Computer Science of Hong Kong Baptist University. Renjie's Research Group is supported by the National Natural Science Foundation of China under Grant No. 62302415, Guangdong Basic and Applied Basic Research Foundation under Grant No. 2022A1515110692, 2024A1515012822, and the Blue Sky Research Fund of HKBU under Grant No. BSRF/21-22/16. Boxin Shi is supported by National Natural Science Foundation of China under Grant No. 62136001, 62088102. Haoliang Li is supported by Changsha Technology Fund under its grant No. KH2304007. + +# References + +1. Belkebir, K., Tijhuis, A.: Using multiple frequency information in the iterative solution of a two-dimensional nonlinear inverse problem. In: Proceedings Progress in Electromagnetics Research Symposium (1996) +2. Belkebir, K., Chaumet, P.C., Sentenac, A.: Superresolution in total internal reflection tomography. Journal of the Optical Society of America A (2005) +3. Bemana, M., Myszkowski, K., Seidel, H.P., Ritschel, T.: X-fields: Implicit neural view-, light-and time-image interpolation. ACM Transactions on Graphics (TOG) (2020) +4. van den Berg, P.M., Van Broekhoven, A., Abubakar, A.: Extended contrast source inversion. Inverse problems (1999) +5. Bevacqua, M.T., Di Meo, S., Crocco, L., Isernia, T., Pasian, M.: Millimeter-waves breast cancer imaging via inverse scattering techniques. IEEE Journal of Electromagnetics, RF and Microwaves in Medicine and Biology (2021) +6. Chen, A., Xu, Z., Geiger, A., Yu, J., Su, H.: TensoRF: Tensorial radiance fields. In: Proceedings of the European Conference on Computer Vision (2022) +7. Chen, X., Wang, X., Zhou, J., Qiao, Y., Dong, C.: Activating more pixels in image super-resolution transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023) +8. Chen, X.: Subspace-based optimization method for solving inverse-scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2009) +9. Chen, X.: Computational methods for electromagnetic inverse scattering. John Wiley & Sons (2018) +0. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2021) +11. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022) +12. Chen, Z., Zhang, H.: Learning implicit fields for generative shape modeling. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019) +13. Cheng, Y., Wan, R., Weng, S., Zhu, C., Chang, Y., Shi, B.: Colorizing monochromatic radiance fields. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024) + +14. Chew, W.C.: Waves and fields in inhomogeneous media, vol. 16. John Wiley & Sons (1999) +15. Chew, W.C., Wang, Y.M.: Reconstruction of two-dimensional permittivity distribution using the distorted Born iterative method. IEEE Transactions on Medical Imaging (1990) +16. Colton, D., Kress, R.: Integral Equation Methods in Scattering Theory. SIAM (2013) +17. Colton, D.L., Kress, R., Kress, R.: Inverse Acoustic and Electromagnetic Scattering Theory. Springer (1998) +18. Cui, T.J., Chew, W.C., Yin, X.X., Hong, W.: Study of resolution and super resolution in electromagnetic imaging for half-space problems. IEEE Transactions on Antennas and Propagation (2004) +19. Deng, L.: The MNIST database of handwritten digit images for machine learning research. IEEE Signal Processing Magazine (2012) +20. Devaney, A.: Inverse-scattering theory within the rytov approximation. Optics Letters (1981) +21. Gao, F., Van Veen, B.D., Hagness, S.C.: Sensitivity of the distorted born iterative method to the initial guess in microwave breast imaging. IEEE Transactions on Antennas and Propagation (2015) +22. Geffrin, J., Sabouroux, P.: Continuing with the fresnel database: experimental setup and improvements in 3d scattering measurements. Inverse Problems (2009) +23. Geng, R., Hu, Y., Chen, Y., et al.: Recent advances on non-line-of-sight imaging: Conventional physical models, deep learning, and new scenes. APSIPA Transactions on Signal and Information Processing (2021) +24. Geng, R., Li, Y., Zhang, D., Wu, J., Gao, Y., Hu, Y., Chen, Y.: Dream-pcd: Deep reconstruction and enhancement of mmwave radar pointcloud. arXiv preprint arXiv:2309.15374 (2023) +25. Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press (2013) +26. Grattarola, D., Vandergheynst, P.: Generalised implicit neural representations. In: Advances in Neural Information Processing Systems (2022) +27. Habashy, T.M., Groom, R.W., Spies, B.R.: Beyond the born and rytov approximations: A nonlinear approach to electromagnetic scattering. Journal of Geophysical Research: Solid Earth (1993) +28. Habashy, T.M., Oristaglio, M.L., de Hoop, A.T.: Simultaneous nonlinear reconstruction of two-dimensional permittivity and conductivity. Radio Science (1994) +29. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: European Conference on Computer Vision (2022) +30. de la Iglesia Castro, D.: 3D mnist: A 3D version of the mnist database of handwritten digits. https://www.kaggle.com/datasets/daavoo/3d-mnist +31. Jagatap, G., Hegde, C.: Phase retrieval using untrained neural network priors. In: NeurIPS 2019 Workshop on Solving Inverse Problems with Deep Networks (2019) +32. Lempitsky, V., Vedaldi, A., Ulyanov, D.: Deep image prior. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (2018) +33. Li, J., Pang, M., Dong, Y., Jia, J., Wang, B.: Graph neural network explanations are fragile. In: International Conference on Machine Learning (2024) +34. Li, L., Wang, L.G., Teixeira, F.L., Liu, C., Nehorai, A., Cui, T.J.: Deepnis: Deep neural network for nonlinear electromagnetic inverse scattering. IEEE Transactions on Antennas and Propagation (2018) + +35. Li, Y., Zhang, D., Geng, R., Wu, J., Hu, Y., Sun, Q., Chen, Y.: Ifnet: Imaging and focusing network for handheld mmwave devices. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024) +36. Liu, Z., Roy, M., Prasad, D.K., Agarwal, K.: Physics-guided loss functions improve deep learning performance in inverse scattering. IEEE Transactions on Computational Imaging (2022) +37. Luo, Z., Guo, Q., Cheung, K.C., See, S., Wan, R.: Copyrnerf: Protecting the copyright of neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023) +38. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3D reconstruction in function space. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019) +39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing scenes as neural radiance fields for view synthesis. In: Proceedings of the European Conference on Computer Vision (2020) +40. Mitra, S.K.: Digital signal processing: a computer-based approach. McGraw-Hill Higher Education (2001) +41. Mojabi, P., LoVetri, J.: Comparison of te and tm inversions in the framework of the gauss-newton method. IEEE Transactions on Antennas and Propagation (2010) +42. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) (2022) +43. Nikolova, N.K.: Microwave imaging for breast cancer. IEEE Microwave Magazine (2011) +44. Nordebo, S., Gustafsson, M., Nilsson, B.: Fisher information analysis for two-dimensional microwave tomography. Inverse Problems (2007) +45. O'Loughlin, D., O'Halloran, M., Moloney, B.M., Glavin, M., Jones, E., Elahi, M.A.: Microwave breast imaging: Clinical advances and remaining challenges. IEEE Transactions on Biomedical Engineering (2018) +46. Pang, M., Wang, B., Ye, M., Cheung, Y.M., Zhou, Y., Huang, W., Wen, B.: Heterogeneous prototype learning from contaminated faces across domains via disentangling latent factors. IEEE Transactions on Neural Networks and Learning Systems (2024) +47. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019) +48. Peterson, A.F., Ray, S.L., Mittra, R.: Computational methods for electromagnetics. IEEE Press New York (1998) +49. Rubæk, T., Meaney, P.M., Meincke, P., Paulsen, K.D.: Nonlinear microwave imaging for breast-cancer screening using gauss-newton's method and the cgls inversion algorithm. IEEE Transactions on Antennas and Propagation (2007) +50. Sanghvi, Y., Kalepu, Y., Khankhoje, U.K.: Embedding deep learning in inverse scattering problems. IEEE Transactions on Computational Imaging (2019) +51. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: Advances in Neural Information Processing Systems (2020) +52. Slaney, M., Kak, A., Larsen, L.: Limitations of imaging with first-order diffraction tomography. IEEE Transactions on Microwave Theory and Techniques (1984) +53. Song, R., Huang, Y., Xu, K., Ye, X., Li, C., Chen, X.: Electromagnetic inverse scattering with perceptual generative adversarial networks. IEEE Transactions on Computational Imaging (2021) + +54. Stanley, K.O.: Compositional pattern producing networks: A novel abstraction of development. Genetic programming and evolvable machines (2007) +55. Taflove, A., Hagness, S.C., Piket-May, M.: Computational electromagnetics: the finite-difference time-domain method. The Electrical Engineering Handbook (2005) +56. Tang, Y., Zhu, C., Wan, R., Xu, C., Shi, B.: Neural underwater scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2024) +57. Wei, Z., Chen, X.: Deep-learning schemes for full-wave nonlinear inverse scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2018) +58. Wei, Z., Chen, X.: Uncertainty quantification in inverse scattering problems with bayesian convolutional neural networks. IEEE Transactions on Antennas and Propagation (2020) +59. Xu, K., Zhang, C., Ye, X., Song, R.: Fast full-wave electromagnetic inverse scattering based on scalable cascaded convolutional neural networks. IEEE Transactions on Geoscience and Remote Sensing (2021) +60. Xu, K., Zhong, Y., Wang, G.: A hybrid regularization technique for solving highly nonlinear inverse scattering problems. IEEE Transactions on Microwave Theory and Techniques (2017) +61. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric iterative machine teaching. In: International Conference on Machine Learning (2023) +62. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric teaching for multiple learners. Advances in Neural Information Processing Systems (2023) +63. Zhang, C., Luo, S., Li, J., Wu, Y.C., Wong, N.: Nonparametric teaching of implicit neural representations. In: International Conference on Machine Learning (2024) +64. Zhang, L., Xu, K., Song, R., Ye, X., Wang, G., Chen, X.: Learning-based quantitative microwave imaging with a hybrid input scheme. IEEE Sensors Journal (2020) +65. Zhang, X., Zhao, Z.: A new scheme for solving highly nonlinear inverse scattering problems with noise disturbance. IEEE Geoscience and Remote Sensing Letters (2022) +66. Zhong, Y., Chen, X.: Twofold subspace-based optimization method for solving inverse scattering problems. Inverse Problems (2009) +67. Zhong, Y., Chen, X.: An ftf twofold subspace-based optimization method for solving electromagnetic inverse scattering problems. IEEE Transactions on Antennas and Propagation (2011) +68. Zhong, Y., Lambert, M., Lesselier, D., Chen, X.: A new integral equation method to solve highly nonlinear inverse scattering problems. IEEE Transactions on Antennas and Propagation (2016) +69. Zhou, H., Cheng, Y., Zheng, H., Liu, Q., Wang, Y.: Deep unfolding contrast source inversion for strong scatterers via generative adversarial mechanism. IEEE Transactions on Microwave Theory and Techniques (2022) +70. Zhu, C., Wan, R., Tang, Y., Shi, B.: Occlusion-free scene recovery via neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023) \ No newline at end of file diff --git a/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/images.zip b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..543c2ce0ddcea32c793e4e4cbb6529fa6d4b548d --- /dev/null +++ b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:982b14c4712b617b4e5350e602e7ca213208ac4d6d24a94d508a475e0e47ce31 +size 542547 diff --git a/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/layout.json b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..dc050e3e5fcde7ec5a36fd577d87ee3e22ecfcb4 --- /dev/null +++ b/2024/Imaging Interiors_ An Implicit Solution to Electromagnetic Inverse Scattering Problems/layout.json @@ -0,0 +1,11354 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 149, + 112, + 465, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 112, + 465, + 148 + ], + "spans": [ + { + "bbox": [ + 149, + 112, + 465, + 148 + ], + "type": "text", + "content": "Imaging Interiors: An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "spans": [ + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "text", + "content": "Ziyuan Luo" + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "text", + "content": ", Boxin Shi" + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "inline_equation", + "content": "^{2,3}" + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "text", + "content": ", Haoliang Li" + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "inline_equation", + "content": "^{4}" + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "text", + "content": ", and Renjie Wan" + }, + { + "bbox": [ + 160, + 168, + 455, + 182 + ], + "type": "inline_equation", + "content": "^{1\\star}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 169, + 190, + 443, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 169, + 190, + 443, + 201 + ], + "spans": [ + { + "bbox": [ + 169, + 190, + 443, + 201 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 169, + 190, + 443, + 201 + ], + "type": "text", + "content": " Department of Computer Science, Hong Kong Baptist University" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 176, + 201, + 437, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 201, + 437, + 223 + ], + "spans": [ + { + "bbox": [ + 176, + 201, + 437, + 223 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 176, + 201, + 437, + 223 + ], + "type": "text", + "content": " State Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 179, + 223, + 434, + 245 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 179, + 223, + 434, + 245 + ], + "spans": [ + { + "bbox": [ + 179, + 223, + 434, + 245 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 179, + 223, + 434, + 245 + ], + "type": "text", + "content": " National Engineering Research Center of Visual Technology, School of Computer Science, Peking University" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 136, + 245, + 477, + 278 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 245, + 477, + 278 + ], + "spans": [ + { + "bbox": [ + 136, + 245, + 477, + 278 + ], + "type": "inline_equation", + "content": "^{4}" + }, + { + "bbox": [ + 136, + 245, + 477, + 278 + ], + "type": "text", + "content": " Department of Electrical Engineering, City University of Hong Kong ziyuanluo@life.hkbu.edu.hk, shiboxin@pku.edu.cn, haoliang.li@cityu.edu.hk, renjiewan@hkbu.edu.hk" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 312, + 455, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 312, + 455, + 467 + ], + "spans": [ + { + "bbox": [ + 160, + 312, + 455, + 467 + ], + "type": "text", + "content": "Abstract. Electromagnetic Inverse Scattering Problems (EISP) have gained wide applications in computational imaging. By solving EISP, the internal relative permittivity of the scatterer can be non-invasively determined based on the scattered electromagnetic fields. Despite previous efforts to address EISP, achieving better solutions to this problem has remained elusive, due to the challenges posed by inversion and discretization. This paper tackles those challenges in EISP via an implicit approach. By representing the scatterer's relative permittivity as a continuous implicit representation, our method is able to address the low-resolution problems arising from discretization. Further, optimizing this implicit representation within a forward framework allows us to conveniently circumvent the challenges posed by inverse estimation. Our approach outperforms existing methods on standard benchmark datasets. Project page: https://luo-ziyuan.github.io/Imaging-Interiors." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 476, + 453, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 476, + 453, + 499 + ], + "spans": [ + { + "bbox": [ + 159, + 476, + 453, + 499 + ], + "type": "text", + "content": "Keywords: Electromagnetic inverse scattering problems " + }, + { + "bbox": [ + 159, + 476, + 453, + 499 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 476, + 453, + 499 + ], + "type": "text", + "content": " Implicit neural representations " + }, + { + "bbox": [ + 159, + 476, + 453, + 499 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 476, + 453, + 499 + ], + "type": "text", + "content": " Computational photography" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 521, + 230, + 533 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 521, + 230, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 521, + 230, + 533 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "spans": [ + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "type": "text", + "content": "As electromagnetic waves can penetrate objects' surfaces, they play a key role in non-invasive imaging. Compared with modalities like X-ray and MRI, electromagnetic waves provide a potentially low-cost and safe approach [5, 24, 45] for non-invasive imaging." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "content": "Non-invasive imaging via electromagnetic waves needs to be completed by solving the Electromagnetic Inverse Scattering Problems (EISP). The typical scenario and the associated physical quantities of EISP are displayed in Fig. 1. In EISP, we need to infer the distribution of the scatterer's relative permittivity" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 236, + 665 + ], + "type": "text", + "content": "* Corresponding author." + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 482, + 247 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 482, + 247 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 482, + 247 + ], + "type": "image", + "image_path": "33bf88e7b02849ae3d49adc38e2fa399e51133a13184ee723e539f2a7566f97d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 255, + 482, + 334 + ], + "lines": [ + { + "bbox": [ + 130, + 255, + 482, + 334 + ], + "spans": [ + { + "bbox": [ + 130, + 255, + 482, + 334 + ], + "type": "text", + "content": "Fig. 1: The results of a standard test case [1,57] in EISP. In an EISP system, the scatterer in the enclosed space " + }, + { + "bbox": [ + 130, + 255, + 482, + 334 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 255, + 482, + 334 + ], + "type": "text", + "content": " is first illuminated by incoming electromagnetic waves emitted by transmitters and generates scattered fields. Then, the scattered fields measured by receivers are used to determine the scatterer's relative permittivity. We show results obtained by our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 361, + 482, + 386 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 361, + 482, + 386 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 482, + 386 + ], + "type": "text", + "content": "from the measured scattered fields [43]. Then, the values of relative permittivity can be visualized to image the objects' internal structures." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 388, + 482, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 496 + ], + "type": "text", + "content": "However, solving EISP has never been an easy task. The first challenge comes from the inverse estimation process, where the scatterer's relative permittivity is derived from the measured scattered fields. The multiple scattering effects inherent to the EISP further significantly complicate this inverse estimation [9,34,68]. Furthermore, continuous spaces are usually discretized into finite elements or grids to facilitate numerical computations for electromagnetic computations. This process of discretization inherently leads to a loss of details and a decrease in image resolution for EISP [18, 44]. This consequently poses challenges in accurately distinguishing internal small objects in close proximity." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 483, + 666 + ], + "type": "text", + "content": "The scattering mechanism is crucial in solving EISP [8, 36]. Recent deep-learning-based methods [34, 57] first obtain a rough image using traditional algorithms (e.g., BP [2] shown in Fig. 1) and then refine this rough result using image-to-image translation networks. However, with the imaging process being divided into two distinct stages, the measured physical data are overlooked in the second phase, inevitably resulting in images of inferior quality (e.g., BPS [57] and PGAN [53] shown in Fig. 1). Besides, as the relative permittivity distributions can vary greatly across different objects, a single network may be insufficient to reflect these differences. Therefore, a more appropriate approach is to optimize for each object while thoroughly considering the scattering mechanisms. Traditional methods like Twofold SOM [66] and Gs SOM [8] achieve this goal by discretizing continuous relative permittivity values into discrete variables expressed as to-be-optimized matrices [8, 15, 66]. However, they cannot address the low-resolution issues that arise from discretization, as shown in Fig. 1. Moreover," + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "content": "these methods have difficulties in handling sparse measurement data, which usually leads to low reconstruction quality. Thus, we need a more powerful representation scheme beyond the discrete matrix form." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 482, + 366 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 482, + 366 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 482, + 366 + ], + "type": "text", + "content": "Since the scatterer's relative permittivity distribution used for imaging is intimately related to the spatial position [15], the envisioned approach should indicate such location-dependent physical quantity. Moreover, for better imaging quality, the approach should have the capacity to eliminate the low-resolution curse made by discretization. Therefore, we propose to represent the scatterer's relative permittivity distribution via Implicit Neural Representations (INR), as INR has remarkable capability in modeling location-dependent relationships [39, 51]. Its flexibility in handling image resolutions [10, 11, 29] also helps to alleviate the curse made by discretization. Besides, INR is known for its case-by-case optimization strategy, which can faithfully reflect each object's internal differences. In addition, INRs exhibit a strong capacity to recover information from incomplete data across a range of tasks [31, 32, 39], which can address the difficulties caused by sparse measurement. We then optimize the INR of each object by making sure that this representation can produce results akin to the actual measurements. Such an optimization based on forward estimation can help to address the difficulties caused by inverse estimation. Once the optimization settles down, we can access the relative permittivity values by using their corresponding locations and visualize them for imaging purposes." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 367, + 482, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 367, + 482, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 367, + 482, + 475 + ], + "type": "text", + "content": "Our solution is illustrated in Fig. 2. We use the Multilayer Perceptron (MLP) as the backbone of INR. Specifically, two MLPs are used to represent the relative permittivity and the induced current. It allows us to bypass complex matrix inversions in optimization, largely reducing the computational cost. To optimize the implicit representations, we propose to use a data loss and a state loss by fully considering the relationships between various physical quantities in the scattering process. Meanwhile, a random sampling strategy is designed for comprehensive consideration of each spatial position during optimization. Our primary contributions can be summarized as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 479, + 479, + 561 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 479, + 479, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 479, + 502 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 479, + 502 + ], + "type": "text", + "content": "- We propose a solution to EISP based on forward estimation to avoid difficulties triggered by inverse estimation." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 503, + 479, + 537 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 503, + 479, + 537 + ], + "spans": [ + { + "bbox": [ + 138, + 503, + 479, + 537 + ], + "type": "text", + "content": "- We introduce the use of the learnable INR for the object's relative permittivity distribution to indicate the location-dependent quantity and achieve flexibility in imaging resolution." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 538, + 479, + 561 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 538, + 479, + 561 + ], + "spans": [ + { + "bbox": [ + 138, + 538, + 479, + 561 + ], + "type": "text", + "content": "- We explore a novel strategy that utilizes two separate MLPs for two physical quantities to avoid complex computations caused by matrix inversion." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 567, + 479, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 567, + 479, + 603 + ], + "spans": [ + { + "bbox": [ + 130, + 567, + 479, + 603 + ], + "type": "text", + "content": "The research for solving EISP has established standard benchmarks for evaluation [9, 53, 57]. We strictly follow these standard benchmarks in our research, including system settings, datasets, and metrics." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 619, + 234, + 631 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 619, + 234, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 619, + 234, + 631 + ], + "type": "text", + "content": "2 Related work" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": "Electromagnetic inverse scattering problems (EISP). Conventional approaches for EISP can be classified as non-iterative and iterative categories." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 332 + ], + "type": "text", + "content": "Non-iterative methods tackle nonlinear issues by converting them into linear equations, such as the Born approximation [52], Rytov approximation [20, 27], and back-propagation (BP) method [2]. Since non-iterative methods are limited by reconstruction quality, other methods, such as the Subspace Optimization Method (SOM) [8, 60, 67], Contrast Source Inversion (CSI) Method [4, 28], Distorted Born Iterative Method (DBIM) [21], and other Newton-type methods [41, 49], are proposed to solve this problem in an iterative way. Despite their feasibility, their performance is highly sensitive to the initial guess, which undermines their robustness. Neural networks have recently been employed to construct nonlinear mappings linking the dispersed fields and the obscure constitutive attributes of scatterers [23, 35]. Most methods consider EISP in two stages [34, 57, 59, 64], where traditional approaches [2, 52] are first employed to obtain coarse images, and then the trained image-to-image neural networks are used for post-processing. However, due to the lack of consideration for scattering mechanisms, those methods encounter nearly all the difficulties faced by deep learning [33, 46], which easily causes their post-processing efforts to fail. We consider an implicit forward approach to overcome the aforementioned difficulties by optimizing a trainable implicit representation within a forward process." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "content": "Implicit neural representations (INR). Implicit neural representations usually employ an MLP to map from local coordinates to the associated values on that coordinates [26,51,63], such as intensity for images and videos, or occupancy value for 3D volumes. The basics of INR are briefly explained below. INR is a neural network " + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "inline_equation", + "content": "F_{\\theta}:\\mathbf{x}\\mapsto F_{\\theta}(\\mathbf{x})" + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "content": " that continuously maps the coordinates " + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "content": " to the corresponding quantity of interest. For the data expressed as a function " + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "inline_equation", + "content": "\\varPhi:\\mathbf{x}\\mapsto\\varPhi(\\mathbf{x})" + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "content": ", the INR " + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "content": " is a solution to " + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "inline_equation", + "content": "F_{\\theta}(\\mathbf{x}) - \\varPhi(\\mathbf{x}) = 0" + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "content": ". Typically, the weight of INR, " + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 333, + 482, + 574 + ], + "type": "text", + "content": ", can be obtained through optimization. INR has shown its advantages in parameterizing geometry and learning priors over shapes, as demonstrated by DeepSDF [47], Occupancy Networks [38], and IM-Net [12]. A considerable amount of subsequent research has proposed volumetric rendering of 3D implicit representations, including Neural Radiance Fields (NeRF) [39] and its acceleration [6,42], quality enhancement [13,56,70], and copyright protection [37]. In the realm of 2D image representation, CPPNs [54] first proposed the use of neural networks to parameterize images implicitly. SIRENs [51] proposed generalization across implicit representations of images via hypernetworks. X-Fields [3] parameterizes the Jacobian of pixel position with respect to view, time, and illumination. In this work, we employ INR as the backbone to represent the scatterer's properties, which is able to characterize the complex spatial correlation in EISP and produce better imaging quality." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 597, + 294, + 611 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 597, + 294, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 597, + 294, + 611 + ], + "type": "text", + "content": "3 Physical model of EISP" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "As shown in Fig. 1, for an EISP system, the object to be imaged is defined as the unknown scatterer, and the enclosed space is represented by a square Region of Interest (ROI) denoted by " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": ". Transmitters and receivers are positioned around" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": " to emit electromagnetic waves and measure the scattered electromagnetic fields, respectively." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "text", + "content": "Generally, the data measurement process can be split into two stages. At the first stage, the induced current is excited as the electromagnetic waves from the transmitters interact with the scatterer, aka wave-scatterer interaction. Subsequently, the induced current serves as a radiation source, generating the scattered fields. The total electric fields within " + }, + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 140, + 482, + 213 + ], + "type": "text", + "content": " can be described by Lippmann-Schwinger equation [16], aka state equation, as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 200, + 223, + 481, + 247 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 223, + 481, + 247 + ], + "spans": [ + { + "bbox": [ + 200, + 223, + 481, + 247 + ], + "type": "interline_equation", + "content": "E ^ {\\mathrm {t}} (\\mathbf {x}) = E ^ {\\mathrm {i}} (\\mathbf {x}) + k _ {0} ^ {2} \\int_ {D} g \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) J \\left(\\mathbf {x} ^ {\\prime}\\right) d \\mathbf {x} ^ {\\prime}, \\mathbf {x} \\in D, \\tag {1}", + "image_path": "584cd0da8c9ffc089926829ac4302856784ea91eac0956d1881b84782a03fd4e.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "spans": [ + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "\\mathbf{x}'" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " are the spatial coordinates. " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "E^{\\mathrm{i}}" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " is the incident electric fields directly from transmitters, while " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "E^{\\mathrm{t}}" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " is the total electric fields consisting of the original incident fields coming directly from transmitters and the scattered fields coming from scatterers. " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "k_{0}" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " is the wavenumber computed from the signal frequency, and " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " is the free space Green's function. The relationship between the induced current " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " and total electric fields " + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "inline_equation", + "content": "E^{\\mathrm{t}}" + }, + { + "bbox": [ + 131, + 257, + 479, + 329 + ], + "type": "text", + "content": " can be expressed as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 267, + 340, + 480, + 353 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 267, + 340, + 480, + 353 + ], + "spans": [ + { + "bbox": [ + 267, + 340, + 480, + 353 + ], + "type": "interline_equation", + "content": "J (\\mathbf {x}) = \\xi (\\mathbf {x}) E ^ {t} (\\mathbf {x}). \\tag {2}", + "image_path": "8cc424ea3fbb5a32c08df3990fa233383020dcfcdcc207f1ae558b1a936cc1da.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "spans": [ + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "text", + "content": "In Eq. (2), " + }, + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "inline_equation", + "content": "\\xi" + }, + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "text", + "content": " is the contrast defined as " + }, + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "inline_equation", + "content": "\\xi (\\mathbf{x}) = \\varepsilon_r(\\mathbf{x}) - 1" + }, + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "inline_equation", + "content": "\\varepsilon_r(\\mathbf{x})" + }, + { + "bbox": [ + 130, + 363, + 479, + 386 + ], + "type": "text", + "content": " denotes the relative permittivity of the unknown scatterer." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 388, + 480, + 412 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 388, + 480, + 412 + ], + "spans": [ + { + "bbox": [ + 131, + 388, + 480, + 412 + ], + "type": "text", + "content": "The second equation describes the scattered fields as a reradiation of the induced current [16], aka data equation, as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 219, + 422, + 480, + 447 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 422, + 480, + 447 + ], + "spans": [ + { + "bbox": [ + 219, + 422, + 480, + 447 + ], + "type": "interline_equation", + "content": "E ^ {\\mathrm {s}} (\\mathbf {x}) = k _ {0} ^ {2} \\int_ {D} g \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) J \\left(\\mathbf {x} ^ {\\prime}\\right) d \\mathbf {x} ^ {\\prime}, \\mathbf {x} \\in S, \\tag {3}", + "image_path": "8e0c48ead652f6f06a5d71aacf6c146682571cb7b41925813b4de25278f1baeb.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "spans": [ + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "inline_equation", + "content": "E^{s}" + }, + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "text", + "content": " is the scattered fields that can be measured by receivers at surface " + }, + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "text", + "content": " around the ROI " + }, + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 131, + 455, + 481, + 478 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "text", + "content": "Since the digital signal analysis is only available on discrete variables [40,55], Eq. (1) to Eq. (3) are inevitably transformed to their discrete counterparts. Specifically, the ROI " + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "text", + "content": " is discretized into " + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "inline_equation", + "content": "M \\times M" + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "text", + "content": " square subunits and the method of moments [48] is employed to obtain the discrete scattered fields. The relationship between discrete contrast " + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\xi" + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "text", + "content": " and discrete relative permittivity " + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\varepsilon_r" + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "text", + "content": " can be expressed as " + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\xi = \\varepsilon_r - 1" + }, + { + "bbox": [ + 131, + 479, + 482, + 552 + ], + "type": "text", + "content": ". Then, Eq. (1) can be reformulated as follows:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 267, + 562, + 480, + 575 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 267, + 562, + 480, + 575 + ], + "spans": [ + { + "bbox": [ + 267, + 562, + 480, + 575 + ], + "type": "interline_equation", + "content": "\\mathbf {E} ^ {\\mathrm {t}} = \\mathbf {E} ^ {\\mathrm {i}} + \\mathbf {G} _ {D} \\cdot \\mathbf {J}, \\tag {4}", + "image_path": "eab851d980ea333ab56705f1779a2908c2ac0ff3929626d0e256bbdda6703aaa.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "spans": [ + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{t}}" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{i}}" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\mathbf{J}" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": " are the discrete " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "E^t" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "E^i" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": ", respectively. " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\mathbf{G}_D" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": " is discrete free space Green's function in " + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 131, + 585, + 482, + 622 + ], + "type": "text", + "content": ". The discrete version of Eq. (2) can be represented as follows [53]:" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 269, + 632, + 480, + 645 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 269, + 632, + 480, + 645 + ], + "spans": [ + { + "bbox": [ + 269, + 632, + 480, + 645 + ], + "type": "interline_equation", + "content": "\\mathbf {J} = \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {E} ^ {\\mathrm {t}}, \\tag {5}", + "image_path": "5e3c13839b59413d87d9e7392ea4df542f156c73a820d741d75ef71af0c0ba82.jpg" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 400, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 400, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 400, + 666 + ], + "type": "text", + "content": "5 Discrete variables are denoted using bold letters in our paper" + } + ] + } + ], + "index": 15 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 115, + 482, + 257 + ], + "blocks": [ + { + "bbox": [ + 133, + 115, + 482, + 257 + ], + "lines": [ + { + "bbox": [ + 133, + 115, + 482, + 257 + ], + "spans": [ + { + "bbox": [ + 133, + 115, + 482, + 257 + ], + "type": "image", + "image_path": "4f8c34bf4412d06e0325b93bc75e2e1ad79aa6f3775f61ea0b5050790d15830a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "lines": [ + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": "Fig. 2: Overview of our implicit method. Two MLPs, " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": ", are used to implicitly represent relative permittivity " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\varepsilon_{r}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " and induced current " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": ", respectively. Random sampling is applied for comprehensive optimization. The predicted induced current " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{J}}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " is calculated by Eq. (13) based on relative permittivity " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\varepsilon_{r}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " queried from " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " and induced current " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " directly queried from " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": ". Then the state loss " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{state}}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " is calculated by comparing the predicted " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{J}}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " and directly queried " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\mathbf{J}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": ". Besides, the directly queried induced current " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\mathbf{J}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " is used to compute the scattered fields " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{E}}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " by Eq. (11). Data loss function " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{data}}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " is constructed to evaluate the difference between predicted scattered fields " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{E}}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": " and the measured values " + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 265, + 482, + 365 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 388, + 482, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 411 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 388, + 482, + 411 + ], + "type": "inline_equation", + "content": "\\mathrm{Diag}(\\pmb {\\xi})" + }, + { + "bbox": [ + 130, + 388, + 482, + 411 + ], + "type": "text", + "content": " is the diagonal matrix of contrast function. Similarly, Eq. (3) can be discretized as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 277, + 412, + 480, + 425 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 277, + 412, + 480, + 425 + ], + "spans": [ + { + "bbox": [ + 277, + 412, + 480, + 425 + ], + "type": "interline_equation", + "content": "\\mathbf {E} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\mathbf {J}, \\tag {6}", + "image_path": "3666479f775c53e23c53f08dc89492455335a5cf83ffe69976fe4755c3e63291.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "text", + "content": " is the discrete " + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "inline_equation", + "content": "E^{s}" + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "inline_equation", + "content": "\\mathbf{G}_S" + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "text", + "content": " is the discrete Green's function to map contrast source " + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "inline_equation", + "content": "\\mathbf{J}" + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "text", + "content": " to scattered fields " + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 430, + 480, + 453 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "spans": [ + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": "The task of EISP is to infer the relative permittivity " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\varepsilon_r" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": ", a value closely related to " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\xi" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": ", from the scattered fields " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^s" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": " measured by receivers, and then visualize it in an image. In an EISP system, knowing only " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{i}}" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": " makes it challenging to estimate " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\xi" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": " inversely from " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": " based on Eq. (6). Furthermore, the inherent nonlinearity originating from " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{G}_D \\cdot \\mathbf{J}" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": " in Eq. (4) complicates the estimation process [14, 18, 65]. Ultimately, " + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\varepsilon_r" + }, + { + "bbox": [ + 130, + 454, + 482, + 562 + ], + "type": "text", + "content": ", a variable with continuous characteristics, can only be derived using the aforementioned discrete equations, thereby compromising the imaging resolution. Consequently, an effective strategy is necessary to produce more accurate outcomes for EISP." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 581, + 310, + 594 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 581, + 310, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 581, + 310, + 594 + ], + "type": "text", + "content": "4 Proposed implicit solution" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 606, + 482, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 482, + 643 + ], + "type": "text", + "content": "As depicted in Fig. 2, our fundamental idea is to solve the inverse scattering problem within a forward estimation process, which can be described by reformulating Eq. (4) to Eq. (6) as follows:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 208, + 651, + 481, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 651, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 208, + 651, + 481, + 667 + ], + "type": "interline_equation", + "content": "\\mathbf {E} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\operatorname {D i a g} (\\pmb {\\xi}) \\cdot \\left(\\mathbf {I} - \\mathbf {G} _ {D} \\operatorname {D i a g} (\\pmb {\\xi})\\right) ^ {- 1} \\cdot \\mathbf {E} ^ {\\mathrm {i}}, \\tag {7}", + "image_path": "b37e454966a5d9c389d61341f3b3378f14c424702caab7283c923de2d2193c69.jpg" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{I}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " is the identity matrix. Contrary to previous approaches [2,52] that treat " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\pmb{\\xi}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " as unknown, we regard the contrast " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\pmb{\\xi}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " as a known quantity, by establishing relative permittivity " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\varepsilon_{r}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " involved in Eq. (2) as a learnable implicit representation. Then, we can calculate " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " triggered by Eq. (7). During training, by contrasting the calculated " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " with the measured true ones, the learnable representation can finally reach its optimum status. Since we do not aim to inversely express " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\pmb{\\xi}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": " as an explicit function of " + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{s}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": ", this optimization-in-forward approach can alleviate the challenges associated with inverse estimation and nonlinearity. The use of INR also ensures enhanced flexibility in imaging resolution. During inference, we can directly obtain the relative permittivity values by querying the representation with the corresponding coordinates." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 264, + 340, + 276 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 264, + 340, + 276 + ], + "spans": [ + { + "bbox": [ + 132, + 264, + 340, + 276 + ], + "type": "text", + "content": "4.1 Continuous representation for EISP" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": "Representation for relative permittivity. We use a multilayer perceptron (MLP) with parameters " + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": " to map the continuous spatial coordinates " + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 131, + 282, + 482, + 319 + ], + "type": "text", + "content": " to its associating relative permittivity values, which can be briefly described as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 266, + 331, + 480, + 342 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 266, + 331, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 266, + 331, + 480, + 342 + ], + "type": "interline_equation", + "content": "\\varepsilon_ {r} (\\mathbf {x}) = F _ {\\theta} (\\gamma (\\mathbf {x})), \\tag {8}", + "image_path": "4d1413fa13c1969162ce04c8ca4b2efb87959acc1ea82afde7e0a061a1811845.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "spans": [ + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "inline_equation", + "content": "\\varepsilon_r^6" + }, + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "text", + "content": " denotes the relative permittivity obtained by querying the spatial coordinates within the continuous representation " + }, + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "text", + "content": ". We further apply the positional encoding for " + }, + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 131, + 346, + 482, + 383 + ], + "type": "text", + "content": " to facilitate the fitting capability of the model as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 201, + 392, + 480, + 407 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 201, + 392, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 201, + 392, + 480, + 407 + ], + "type": "interline_equation", + "content": "\\gamma (\\mathbf {x}) = \\left[ \\sin \\mathbf {x}, \\cos \\mathbf {x}, \\dots , \\sin 2 ^ {\\Omega - 1} \\mathbf {x}, \\cos 2 ^ {\\Omega - 1} \\mathbf {x} \\right] ^ {\\top}, \\tag {9}", + "image_path": "91cbddd72bec586018eca4a09f09d39dcd21e2adccaa8f6753edca6f5286d681.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 411, + 419, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 411, + 419, + 422 + ], + "spans": [ + { + "bbox": [ + 131, + 411, + 419, + 422 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 411, + 419, + 422 + ], + "type": "inline_equation", + "content": "\\varOmega" + }, + { + "bbox": [ + 131, + 411, + 419, + 422 + ], + "type": "text", + "content": " is a hyperparameter controlling the spectral bandwidth." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 423, + 482, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 530 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 530 + ], + "type": "text", + "content": "To optimize this continuous representation, we apply a series of equations defined by the computation of forward estimation, and then compare the scattered fields incited by this representation with the measured true ones. As discussed in Sec. 3, since the discretization is unavoidable during the forward computation, we only query discrete spatial coordinates during optimization to align with the discretization policy set by the method of moments [48]. Though we can directly perform the forward computation via Eq. (7), the computation complexity caused by its internal matrix inversion places a high demand on computing resources and potentially compromises the stability of problem-solving [25]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "content": "Representation for induced current. To avoid the complexity caused by matrix inversion, instead of the explicit computation defined in Eq. (7), we implicitly represent " + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathbf{J}" + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "content": " as its continuous form using another MLP. By analyzing Eq. (7), the induced current is related to two variables: the discrete contrast " + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\xi" + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "content": " and the incident electric fields " + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathbf{E}^{\\mathrm{i}}" + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "content": " caused by transmitters. To faithfully describe such correlation, we propose to consider the representation for " + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "content": " as the mapping based on the spatial coordinates " + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "content": " and the transmitter's position " + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "inline_equation", + "content": "\\mathbf{x}^{\\mathrm{t}}" + }, + { + "bbox": [ + 131, + 531, + 482, + 625 + ], + "type": "text", + "content": ", which can be defined as follows:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 246, + 634, + 480, + 647 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 246, + 634, + 480, + 647 + ], + "spans": [ + { + "bbox": [ + 246, + 634, + 480, + 647 + ], + "type": "interline_equation", + "content": "J (\\mathbf {x}, \\mathbf {x} ^ {\\mathrm {t}}) = H _ {\\phi} \\left(\\gamma (\\mathbf {x}), \\gamma (\\mathbf {x} ^ {\\mathrm {t}})\\right), \\tag {10}", + "image_path": "34d13df8a1dbda811258e900497de1c1d227d8cb2c32fe9debd5f9749797be4f.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 448, + 102 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 400, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 400, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 400, + 666 + ], + "type": "text", + "content": "Due to its continuous property, we do not write it as bold font." + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 455, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 455, + 128 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 455, + 128 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 455, + 128 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 116, + 455, + 128 + ], + "type": "text", + "content": " is a continuous function consisting of fully connected networks." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "spans": [ + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": "Random spatial sampling. Due to the necessity of discretization in numerical computations to perform forward process, we need to spatially query the representations " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " at some positions to obtain their discrete forms. A typical approach is to divide the ROI " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " evenly into grids and deterministically sample the center location of each grid [36, 50]. However, the representations would only be queried at a fixed discrete set of locations in this way [39]. To take a comprehensive consideration of each spatial position, we use a random sampling scheme where we partition ROI " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " into " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "M \\times M" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " evenly-spaced grids, and the center of " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "(m,n)" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " grid is " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "(x_m,y_n)" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": ". Each sample location " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "(x_m^{\\mathrm{sample}},y_n^{\\mathrm{sample}})" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " is then randomly drawn from a Gaussian distribution: " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "x_m^{\\mathrm{sample}} \\sim \\mathcal{N}(x_m,\\sigma^2)" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "y_n^{\\mathrm{sample}} \\sim \\mathcal{N}(y_n,\\sigma^2)" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 129, + 482, + 286 + ], + "type": "text", + "content": " is a hyperparameter to control the dispersion level of sample points around their means. By probabilistically sampling each spatial position, this scheme can alleviate the overlook of specific locations." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 304, + 358, + 316 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 358, + 316 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 358, + 316 + ], + "type": "text", + "content": "4.2 Forward calculation based optimization" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 327, + 482, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 327, + 482, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 482, + 387 + ], + "type": "text", + "content": "The continuous representations obtained before can estimate corresponding physical quantities using spatial coordinates, but optimizing them directly with estimated values is hard because obtaining their true values is difficult [58]. Therefore, we indirectly refine the representations denoted by " + }, + { + "bbox": [ + 130, + 327, + 482, + 387 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 327, + 482, + 387 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 327, + 482, + 387 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 327, + 482, + 387 + ], + "type": "text", + "content": " by proposing a data loss and a state loss while fully considering the physical relationships." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 387, + 482, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 387, + 482, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 387, + 482, + 483 + ], + "type": "text", + "content": "Data loss. Based on Sec. 3, the wave-scatterer interaction leads to the induced current when the electromagnetic waves from transmitters interact with the scatterer. Then, the induced current generates the scattered fields, which can be measured by receivers. Thus, a straightforward way to refine the representations is to minimize the distance between the scattered fields computed from the representations and the true ones. With the discrete induced current " + }, + { + "bbox": [ + 130, + 387, + 482, + 483 + ], + "type": "inline_equation", + "content": "\\mathbf{J}" + }, + { + "bbox": [ + 130, + 387, + 482, + 483 + ], + "type": "text", + "content": " sampling from the continuous representation " + }, + { + "bbox": [ + 130, + 387, + 482, + 483 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 387, + 482, + 483 + ], + "type": "text", + "content": " defined in Eq. (10), we can obtain the predicted scattered fields by reformulating the data equation in Eq. (6) as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 276, + 495, + 480, + 510 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 276, + 495, + 480, + 510 + ], + "spans": [ + { + "bbox": [ + 276, + 495, + 480, + 510 + ], + "type": "interline_equation", + "content": "\\hat {\\mathbf {E}} _ {p} ^ {\\mathrm {s}} = \\mathbf {G} _ {S} \\cdot \\mathbf {J} _ {p}, \\tag {11}", + "image_path": "ce40007fe7d3083e8c2a132c9de68a7a94888bd90931e135e3671ebab77b5d7b.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "spans": [ + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\mathbf{G}_S" + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "text", + "content": " denotes the discrete Green's function, and " + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\mathbf{J}_p" + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{E}}_p^s" + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "text", + "content": " denotes the discrete induced current and predicted scattered fields inspired by the " + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 517, + 482, + 553 + ], + "type": "text", + "content": "-th transmitter, respectively." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 554, + 482, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 554, + 482, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 554, + 482, + 578 + ], + "type": "text", + "content": "We then define our data loss used to contrast the predicted scattered fields with the measured true ones as follows:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 254, + 587, + 480, + 619 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 254, + 587, + 480, + 619 + ], + "spans": [ + { + "bbox": [ + 254, + 587, + 480, + 619 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {d a t a}} = \\sum_ {p = 1} ^ {N _ {\\mathrm {t}}} \\| \\hat {\\mathbf {E}} _ {p} ^ {\\mathrm {s}} - \\mathbf {E} _ {p} ^ {\\mathrm {s}} \\| ^ {2}, \\tag {12}", + "image_path": "9524e8d34fe73813e83d028167f860ccb7e02c76552abc6707e5a7d8d01ab520.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{E}_p^s" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": " is the true scattered fields measured by receivers, and " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "N_{t}" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": " denotes the number of all transmitters. The data loss enhances the optimization of the representation by accounting for discrepancies associated with all transmitters." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "content": "State loss. Although the data loss is straightforward, it cannot be used to optimize " + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "content": ". Since the induced current " + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "inline_equation", + "content": "\\mathbf{J}_p" + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "content": " is directly obtained by querying its representation " + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "content": ", Eq. (12) does not contain any variables related to " + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "content": ". To effectively optimize " + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "content": ", we consider minimizing the mismatch emerging from the state equation defined in Eq. (4) and Eq. (5). Specifically, by reformulating Eq. (7), an expression related to " + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 116, + 479, + 188 + ], + "type": "text", + "content": "-th transmitter can be obtained as follows:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 223, + 193, + 481, + 206 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 193, + 481, + 206 + ], + "spans": [ + { + "bbox": [ + 223, + 193, + 481, + 206 + ], + "type": "interline_equation", + "content": "\\mathbf {\\hat {J}} _ {p} = \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {E} _ {p} ^ {\\mathrm {i}} + \\operatorname {D i a g} (\\boldsymbol {\\xi}) \\cdot \\mathbf {G} _ {D} \\cdot \\mathbf {J} _ {p}, \\tag {13}", + "image_path": "5b53467da38d654d4ce73e447a126103ce740e468a5263e3d960f96ae728c344.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "spans": [ + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "inline_equation", + "content": "\\mathbf{J}_p" + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "text", + "content": " denotes the discrete induced current sampling from " + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "inline_equation", + "content": "\\xi" + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "text", + "content": " denotes the contrast, and " + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{J}}_p" + }, + { + "bbox": [ + 130, + 210, + 479, + 246 + ], + "type": "text", + "content": " indicates the induced current computed via the above mathematical correlation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "text", + "content": "Although " + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "inline_equation", + "content": "\\mathbf{J}_p" + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{J}}_p" + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "text", + "content": " originate from distinct sources, both represent the induced current values within the same spatial domain. If the same spatial coordinates are given, they should yield identical values irrespective of their generation sources. Therefore, we introduce a state loss to minimize the mismatch between " + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "inline_equation", + "content": "\\mathbf{J}_p" + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{J}}_p" + }, + { + "bbox": [ + 130, + 247, + 479, + 307 + ], + "type": "text", + "content": " as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 255, + 308, + 481, + 340 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 308, + 481, + 340 + ], + "spans": [ + { + "bbox": [ + 255, + 308, + 481, + 340 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {s t a t e}} = \\sum_ {p = 1} ^ {N _ {\\mathrm {t}}} \\| \\hat {\\mathbf {J}} _ {p} - \\mathbf {J} _ {p} \\| ^ {2}, \\tag {14}", + "image_path": "8e8d9e52ba45a6d13a6029b4d2d11a5b4b21c5c7b455f9f3a2b345d339bfdfde.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "inline_equation", + "content": "N_{\\mathrm{t}}" + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "text", + "content": " is the number of all transmitters. Since Eq. (2) has clearly defined the close correlation between " + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "inline_equation", + "content": "\\pmb{\\xi}" + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "text", + "content": " and the permittivity values " + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "inline_equation", + "content": "\\varepsilon_r" + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "text", + "content": ", the minimization of the state loss can ultimately optimize " + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 130, + 342, + 479, + 390 + ], + "type": "text", + "content": " used for representing the relative permittivity and induced current, respectively." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "spans": [ + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "content": "Overall loss. The overall loss to train the relative permittivity representation " + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "inline_equation", + "content": "F_{\\theta}" + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "content": " and induced current representation " + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "inline_equation", + "content": "H_{\\phi}" + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "content": " can be obtained as " + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "inline_equation", + "content": "\\mathcal{L} = \\lambda_{\\mathrm{data}}\\mathcal{L}_{\\mathrm{data}} + \\lambda_{\\mathrm{state}}\\mathcal{L}_{\\mathrm{state}} + \\lambda_{\\mathrm{TV}}\\mathcal{L}_{\\mathrm{TV}}" + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{TV}}" + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "content": " is a total variation loss for " + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "inline_equation", + "content": "\\xi" + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{data}}, \\lambda_{\\mathrm{state}}, \\lambda_{\\mathrm{TV}}" + }, + { + "bbox": [ + 131, + 392, + 479, + 439 + ], + "type": "text", + "content": " are hyperparameters to balance the loss functions." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 453, + 276, + 464 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 453, + 276, + 464 + ], + "spans": [ + { + "bbox": [ + 131, + 453, + 276, + 464 + ], + "type": "text", + "content": "4.3 Implementation details" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": "We implement our method using PyTorch. Two eight-layer MLPs with 256 channels and ReLU activations are used to predict the relative permittivity " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "\\varepsilon_r" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": " and induced current " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": ", respectively. Similar to the settings in previous methods based on INRs [39, 51], positional encoding is applied to input positions before they are passed into the MLPs. The ROI " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": " is discretized into " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "64 \\times 64" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": " while training. The hyperparameters for the overall loss are set as " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{data}} = 1.00" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{state}} = 1.00" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{TV}} = 0.01" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": ". We use the Adam optimizer with default values " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "\\beta_1 = 0.9" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "\\beta_2 = 0.999" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "\\epsilon = 10^{-8}" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": ", and a learning rate " + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "inline_equation", + "content": "5 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 469, + 480, + 588 + ], + "type": "text", + "content": " that decays following the exponential scheduler during the optimization. We optimize the model for 4K iterations on a single NVIDIA V100 GPU for all the datasets." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 604, + 230, + 616 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 604, + 230, + 616 + ], + "spans": [ + { + "bbox": [ + 131, + 604, + 230, + 616 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 625, + 250, + 637 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 625, + 250, + 637 + ], + "spans": [ + { + "bbox": [ + 131, + 625, + 250, + 637 + ], + "type": "text", + "content": "5.1 Experiment setup" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": "Dataset. We strictly follow the established rules in EISP [36, 53, 57] to set the dataset. We train and test our model on standard benchmarks used for EISP." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 448, + 103 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "text", + "content": "1) Synthetic Circular-cylinder dataset is synthetically generated comprising 1200 images of cylinders with random relative radius, number, and location and permittivity between 1 and 1.5. 2) Synthetic MNIST dataset contains grayscale images of handwritten digits. Similar to previous settings [57, 69], we randomly select 1200 of them to synthesize scatterers with relative permittivity values between 2 and 2.5 according to their corresponding pixel values. Following previous work to generate the above two synthetic datasets, we use 16 transmitters and 32 receivers equally placed on a circle for regular settings, and the data are generated numerically using the method of moments [48] with a " + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "inline_equation", + "content": "224 \\times 224" + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "text", + "content": " grid mesh to avoid inverse crime [17]. For sparse measurement experiments, we decrease the number of receivers from 32 to 8 to utilize only " + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "inline_equation", + "content": "25\\%" + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "text", + "content": " of the regular measurement data. 3) Real-world Institut Fresnel's database contains three different dielectric scenarios, namely FoamDielExt, FoamDielInt, and FoamTwinDiel. There are 8 transmitters for FoamDielExt and FoamDielInt, 18 transmitters for FoamTwinDiel, and 241 receivers for all the cases. As the wavelength of the emitted electromagnetic wave should be comparable to or smaller than the size of the target object, we set operating frequency " + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "inline_equation", + "content": "f = 400\\mathrm{MHz}" + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "text", + "content": " on synthetic datasets, and " + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "inline_equation", + "content": "f = 5\\mathrm{GHz}" + }, + { + "bbox": [ + 130, + 115, + 482, + 331 + ], + "type": "text", + "content": " on real-world datasets." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 331, + 482, + 463 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 482, + 463 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 482, + 463 + ], + "type": "text", + "content": "Baselines. We maintain the same settings as in previous studies [50,53,57] to ensure a fair comparison. We compare our method with three traditional methods and four deep learning-based approaches: 1) BP [2]: A traditional non-iterative inversion algorithm. 2) Twofold SOM [66]: A traditional iterative minimization scheme by using SVD decomposition. 3) Gs SOM [8]: A traditional subspace-based optimization method by decomposing the operator of Green's function. 4) BPS [57]: A CNN-based image translation method with an initial guess from the BP algorithm. 5) CS-Net [50]: A CNN-based contrast source reconstruction scheme via subspace optimization. 6) Physics-Net [36]: A CNN-based approach that incorporates physical phenomena during training. 7) PGAN [53]: A CNN-based approach using a generative adversarial network." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "spans": [ + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "content": "Evaluation methodology. We evaluate the quantitative performance of our method using PSNR, SSIM, and Relative Root-Mean-Square Error (RRMSE) [53]. For PSNR and SSIM, a higher value indicates better performance. For RRMSE [53], a lower value indicates better performance. RRMSE is a metric widely used in EISP defined as RRMSE = " + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "inline_equation", + "content": "\\left(\\frac{1}{M \\times M} \\sum_{m=1}^{M} \\sum_{n=1}^{M} \\left| \\frac{\\hat{\\varepsilon}_r(m,n) - \\varepsilon_r(m,n)}{\\varepsilon_r(m,n)} \\right|^2\\right)^{\\frac{1}{2}}" + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "inline_equation", + "content": "\\varepsilon_r(m,n)" + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "inline_equation", + "content": "\\hat{\\varepsilon}_r(m,n)" + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "content": " are the true and reconstructed discrete relative permittivity of the unknown scatterers at location " + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "inline_equation", + "content": "(m,n)" + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "content": ", respectively, and " + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "inline_equation", + "content": "M \\times M" + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "content": " is the total number of subunits over the ROI " + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 464, + 489, + 562 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 582, + 257, + 594 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 582, + 257, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 582, + 257, + 594 + ], + "type": "text", + "content": "5.2 Experiment results" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "Qualitative results on synthetic data. We first compare the reconstruction quality visually using synthetic data including circular-cylinder dataset [57] and MNIST dataset [19] against all baselines and the results are shown in Fig. 3. Our method achieves superior visual performance compared to all other baselines. Traditional methods, such as BP [2] and Twofold SOM [66], can only recover the" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 479, + 208 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 479, + 208 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 479, + 208 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 479, + 208 + ], + "type": "image", + "image_path": "5697cea5576e5c1d99aa483f824e2070f89ca69e032217181be4a312042b1f01.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 217, + 482, + 282 + ], + "lines": [ + { + "bbox": [ + 130, + 217, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 217, + 482, + 282 + ], + "type": "text", + "content": "Fig. 3: Samples obtained from synthetic Circular-cylinder dataset and MNIST dataset. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure. The first row is a standard test case [1,57], a well-known pattern for the evaluation of EISP methods." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 297, + 482, + 392 + ], + "blocks": [ + { + "bbox": [ + 133, + 297, + 482, + 392 + ], + "lines": [ + { + "bbox": [ + 133, + 297, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 133, + 297, + 482, + 392 + ], + "type": "image", + "image_path": "81c8e8ac99c6dc97efec6ca501b20f790b03d3613f564976487c9f3233154133.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 399, + 482, + 455 + ], + "lines": [ + { + "bbox": [ + 130, + 399, + 482, + 455 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 482, + 455 + ], + "type": "text", + "content": "Fig. 4: Samples obtained from real-world Institut Fresnel's database. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 482, + 482, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 482, + 482, + 554 + ], + "spans": [ + { + "bbox": [ + 130, + 482, + 482, + 554 + ], + "type": "text", + "content": "rough shape of the target and produce inaccurate results at some junction parts. Gs SOM [8] can reconstruct the relative permittivity of the targets with relatively high accuracy, but still has obvious visual defects. Though deep learning-based methods, such as BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53], can produce more accurate estimation, their visual qualities are still far below our proposed method." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "text", + "content": "Qualitative results on real-world data. We further test our algorithm on real-world data. The results for all methods are shown in Fig. 4. The visual performance of our method remains superior when applied to real-world data. Conventional methods exhibit a diminished performance, which, when used as input, further negatively impacts the efficacy of deep learning-based approaches." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": "Noise robustness. We also compare the robustness of the models. By adding different levels of noise to the received scattered fields signal, we use the noisy scattered fields signal to recover the scattered object. The results are shown in Fig. 5. It can be observed that when large noise is added, the results of other" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 479, + 203 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 479, + 203 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 479, + 203 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 479, + 203 + ], + "type": "image", + "image_path": "f6b54086c7826be321185353b1507816a90e008afd0c11697536f76e4b2917c6.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 210, + 482, + 266 + ], + "lines": [ + { + "bbox": [ + 130, + 210, + 482, + 266 + ], + "spans": [ + { + "bbox": [ + 130, + 210, + 482, + 266 + ], + "type": "text", + "content": "Fig. 5: Samples obtained under " + }, + { + "bbox": [ + 130, + 210, + 482, + 266 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 210, + 482, + 266 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 210, + 482, + 266 + ], + "type": "inline_equation", + "content": "30\\%" + }, + { + "bbox": [ + 130, + 210, + 482, + 266 + ], + "type": "text", + "content": " noise levels. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 134, + 322, + 479, + 399 + ], + "blocks": [ + { + "bbox": [ + 130, + 279, + 482, + 312 + ], + "lines": [ + { + "bbox": [ + 130, + 279, + 482, + 312 + ], + "spans": [ + { + "bbox": [ + 130, + 279, + 482, + 312 + ], + "type": "text", + "content": "Table 1: Quantitative evaluation compared with BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. Best results are shown in bold." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 322, + 479, + 399 + ], + "lines": [ + { + "bbox": [ + 134, + 322, + 479, + 399 + ], + "spans": [ + { + "bbox": [ + 134, + 322, + 479, + 399 + ], + "type": "table", + "html": "
Circular dataset (5%)Circular dataset (30%)MNIST dataset (5%)MNIST dataset (30%)Institut Fresnel's database
RRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNRRRMSESSIMPSNR
Proposed0.0160.96839.200.0270.93834.150.0170.97237.900.0440.89329.700.1270.89727.06
BP0.0480.91628.960.0490.91428.940.1710.75020.020.1740.74419.870.1800.79217.74
Twofold SOM0.0350.91732.270.0400.88031.130.1370.77022.350.1420.74522.130.1490.80423.87
Gs SOM0.0340.92632.740.0350.91632.430.1010.85324.630.1130.81123.730.1350.83724.95
BPS0.0270.96434.200.0340.92832.170.0980.91225.680.1330.85923.210.1660.78718.86
CS-Net0.0240.90033.750.0350.81031.270.1790.78825.370.2270.72424.150.1370.82824.87
Physics-Net0.0240.94537.200.0310.92133.530.0790.93827.740.1130.88924.440.1680.79518.42
PGAN0.0210.95736.890.0300.93333.030.0900.91826.090.1240.87323.640.1670.79418.46
", + "image_path": "6d7387f855a8f170f5482195ac95473bbb24a7a3f6dc70b35672f828930ab842.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 424, + 480, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 424, + 480, + 459 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 480, + 459 + ], + "type": "text", + "content": "bases are greatly affected. However, our method can accurately reconstruct the scatterer under larger noise, demonstrating the superior robustness of the proposed method." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 460, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 567 + ], + "type": "text", + "content": "Evaluation for flexible resolution. The continuity of implicit function allows INR to interpolate and infer at arbitrary points in the input space. This characteristic ensures flexible resolution during the imaging process. As depicted in Fig. 6, we employ a fixed resolution of " + }, + { + "bbox": [ + 130, + 460, + 482, + 567 + ], + "type": "inline_equation", + "content": "64 \\times 64" + }, + { + "bbox": [ + 130, + 460, + 482, + 567 + ], + "type": "text", + "content": " during training and acquire images of varying resolutions by sampling the INR at different scales. The use of the random sampling scheme can avoid artifacts in the results. Compared to post-super-resolution methods, like Gs SOM + HAT-L [7], our method can achieve higher quality results. The resolution flexibility of INR paves the way for more in-depth analysis of reconstructed images at various resolution levels." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 569, + 482, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 639 + ], + "type": "text", + "content": "Quantitative results. The quantitative results of the reconstruction quality in Tab. 1 further validate the proposed method. Higher PSNR and SSIM values suggest our method accurately recovers object shapes and effectively maintains detailed structural information. Lower relative error values indicate our method's predictions of relative permittivity distribution are more accurate compared to other methods." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": "Results for sparse measurement. We use " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "25\\%" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": " of the standard measurement data to conduct an experiment [50, 57], and the results are shown in Fig. 7." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 482, + 251 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 482, + 251 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 482, + 251 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 482, + 251 + ], + "type": "image", + "image_path": "6dad85b08860f042e73cc2f674dd380b99ca534c750ad7e3c7b066578dd84a8f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 257, + 480, + 323 + ], + "lines": [ + { + "bbox": [ + 130, + 257, + 480, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 257, + 480, + 323 + ], + "type": "text", + "content": "Fig. 6: Comparison of resolution flexibility among different methods. Our method is evaluated against our method without random sampling (RS) scheme, Gs SOM [8], Gs SOM + Cubic/Spline interpolation, and Gs SOM + HAT-L [7], under different resolution settings. All methods are implemented at an original resolution of " + }, + { + "bbox": [ + 130, + 257, + 480, + 323 + ], + "type": "inline_equation", + "content": "64 \\times 64" + }, + { + "bbox": [ + 130, + 257, + 480, + 323 + ], + "type": "text", + "content": ". The pixel values in the images indicate the values of the relative permittivity. Resolution and RRMSE/SSIM values are shown below each figure." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 334, + 480, + 385 + ], + "blocks": [ + { + "bbox": [ + 133, + 334, + 480, + 385 + ], + "lines": [ + { + "bbox": [ + 133, + 334, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 133, + 334, + 480, + 385 + ], + "type": "image", + "image_path": "dec7d58bc2e3b1576e0b632ea8893123261c6ec993bb4ed756ed9bf629b47ca4.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 392, + 480, + 437 + ], + "lines": [ + { + "bbox": [ + 130, + 392, + 480, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 480, + 437 + ], + "type": "text", + "content": "Fig. 7: The results for sparse measurement. From left to right: ground truth, results obtained using our method, BP [2], Twofold SOM [66], Gs SOM [8], BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53]. The pixel values in the images indicate the values of the relative permittivity. RRMSE/SSIM values are shown below each figure." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 461, + 480, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 461, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 461, + 480, + 521 + ], + "type": "text", + "content": "Our method, leveraging INR, shows superior capability in reconstructing the object's interior from sparse measurements compared with other methods. This also demonstrates that INR is more suitable for representing the relative permittivity distribution of the object compared to other matrix-based representations like Twofold SOM [66] and CS-Net [50]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 480, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 480, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 480, + 628 + ], + "type": "text", + "content": "Results for 3D scenarios. Our method can naturally generalize to 3D scenarios. In 3D scenarios, we utilize 3D Green's functions in Eq. (4) and Eq. (6), and perform integration over a 3D region of interest. We augment the input dimension of representations for relative permittivity and induced current to align with the 3D coordinates, while keeping the remaining structures unchanged. We collect the 3D scattering data from the synthetic 3D MNIST dataset [30] and real-world dataset [22]. In the synthetic experiments, we employ 40 transmitters and 160 receivers arranged around a unit cube. The results shown in Fig. 8 demonstrate that our method can reconstruct 3D objects by solving EISP." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "content": "Time analysis. Our method, BP [2], Twofold SOM [66], and Gs SOM [8] are case-specific methods that do not require additional training time. The BPS [57], CS-Net [50], Physics-Net [36], and PGAN [53] are deep-learning methods that" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 481, + 181 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 181 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 181 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 181 + ], + "type": "image", + "image_path": "f0b0d017429d516fb4aa53a37c3cd228653bc76e4c91ceee059318db0c661317.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 188, + 480, + 232 + ], + "lines": [ + { + "bbox": [ + 130, + 188, + 480, + 232 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 480, + 232 + ], + "type": "text", + "content": "Fig. 8: The results for 3D scenarios on 3D MINIST dataset [30] and real-world dataset [22]. We show two example cases with three viewing directions. We use isosurface to visualize the ground truths and reconstructed results of the spatial distribution of relative permittivity." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 135, + 265, + 478, + 300 + ], + "blocks": [ + { + "bbox": [ + 132, + 243, + 479, + 255 + ], + "lines": [ + { + "bbox": [ + 132, + 243, + 479, + 255 + ], + "spans": [ + { + "bbox": [ + 132, + 243, + 479, + 255 + ], + "type": "text", + "content": "Table 2: Ablation results compared with single representation for relative permittivity." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 265, + 478, + 300 + ], + "lines": [ + { + "bbox": [ + 135, + 265, + 478, + 300 + ], + "spans": [ + { + "bbox": [ + 135, + 265, + 478, + 300 + ], + "type": "table", + "html": "
Parameter counts↓ Time each iteration↓ RRMSE↓ SSIM↑ PSNR↑
Proposed1,019,139117 ms0.0380.90930.36
Single representation493,313289 ms0.0530.87627.32
", + "image_path": "a7a15350e583892ddcfd0bea8f4ccae0d80ec49f32368ed398173fcf8b9b251d.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 323, + 480, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 480, + 395 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 480, + 395 + ], + "type": "text", + "content": "necessitate model training. We count the time for optimization procedure in inference time, and our method outperforms traditional case-specific methods and CS-Net [50]. Although the inference of other deep-learning methods is very fast, their training processes are time-consuming. Additionally, we may be able to reduce the optimization time through modifying the INR structure [42] or improving the training process [61, 62]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 396, + 481, + 526 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 396, + 481, + 526 + ], + "spans": [ + { + "bbox": [ + 130, + 396, + 481, + 526 + ], + "type": "text", + "content": "Ablation study Our approach mainly consists of three parts: the representation for relative permittivity, representation for induced current, and random sampling. Since both the data loss " + }, + { + "bbox": [ + 130, + 396, + 481, + 526 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{data}}" + }, + { + "bbox": [ + 130, + 396, + 481, + 526 + ], + "type": "text", + "content": " and the state loss " + }, + { + "bbox": [ + 130, + 396, + 481, + 526 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{state}}" + }, + { + "bbox": [ + 130, + 396, + 481, + 526 + ], + "type": "text", + "content": " are necessary for our method, we cannot easily remove any of them. We first use a single representation for relative permittivity to replace the two MLPs in our original approach. Both models are trained on an NVIDIA V100 GPU. From the results shown in Tab. 2, the model with a single MLP takes a longer iteration time to achieve similar performance. We further remove the random sampling scheme and adopt a uniform sampling approach. As shown in the last two columns in Fig. 6, results without random sampling have lower metric values, and the high-resolution results occasionally meet obvious artifacts." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 544, + 225, + 558 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 225, + 558 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 225, + 558 + ], + "type": "text", + "content": "6 Conclusions" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "An implicit solution is presented to the EISP in this paper. We propose implicitly representing the unknown scatterer's relative permittivity distribution as a trainable representation and optimizing these representations within a forward estimation process. A two-MLP strategy is employed to reduce the computation complexity. The experimental results on synthetic and real-world data demonstrate the promising performance of our proposed method. We will further collaborate with other parties to consider our solution in different scenarios, such as medical diagnostics, in more challenging conditions." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "text", + "content": "Acknowledgments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 236 + ], + "type": "text", + "content": "This work was done at Renjie's Research Group at the Department of Computer Science of Hong Kong Baptist University. Renjie's Research Group is supported by the National Natural Science Foundation of China under Grant No. 62302415, Guangdong Basic and Applied Basic Research Foundation under Grant No. 2022A1515110692, 2024A1515012822, and the Blue Sky Research Fund of HKBU under Grant No. BSRF/21-22/16. Boxin Shi is supported by National Natural Science Foundation of China under Grant No. 62136001, 62088102. Haoliang Li is supported by Changsha Technology Fund under its grant No. KH2304007." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 255, + 197, + 268 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 255, + 197, + 268 + ], + "spans": [ + { + "bbox": [ + 133, + 255, + 197, + 268 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 280, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 280, + 481, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 280, + 481, + 313 + ], + "spans": [ + { + "bbox": [ + 138, + 280, + 481, + 313 + ], + "type": "text", + "content": "1. Belkebir, K., Tijhuis, A.: Using multiple frequency information in the iterative solution of a two-dimensional nonlinear inverse problem. In: Proceedings Progress in Electromagnetics Research Symposium (1996)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 314, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 314, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 138, + 314, + 481, + 335 + ], + "type": "text", + "content": "2. Belkebir, K., Chaumet, P.C., Sentenac, A.: Superresolution in total internal reflection tomography. Journal of the Optical Society of America A (2005)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 335, + 481, + 368 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 335, + 481, + 368 + ], + "spans": [ + { + "bbox": [ + 138, + 335, + 481, + 368 + ], + "type": "text", + "content": "3. Bemana, M., Myszkowski, K., Seidel, H.P., Ritschel, T.: X-fields: Implicit neural view-, light-and time-image interpolation. ACM Transactions on Graphics (TOG) (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 369, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 369, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 138, + 369, + 481, + 390 + ], + "type": "text", + "content": "4. van den Berg, P.M., Van Broekhoven, A., Abubakar, A.: Extended contrast source inversion. Inverse problems (1999)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 391, + 481, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 391, + 481, + 423 + ], + "spans": [ + { + "bbox": [ + 138, + 391, + 481, + 423 + ], + "type": "text", + "content": "5. Bevacqua, M.T., Di Meo, S., Crocco, L., Isernia, T., Pasian, M.: Millimeter-waves breast cancer imaging via inverse scattering techniques. IEEE Journal of Electromagnetics, RF and Microwaves in Medicine and Biology (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 424, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 424, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 138, + 424, + 481, + 445 + ], + "type": "text", + "content": "6. Chen, A., Xu, Z., Geiger, A., Yu, J., Su, H.: TensoRF: Tensorial radiance fields. In: Proceedings of the European Conference on Computer Vision (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 446, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 446, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 446, + 481, + 479 + ], + "type": "text", + "content": "7. Chen, X., Wang, X., Zhou, J., Qiao, Y., Dong, C.: Activating more pixels in image super-resolution transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 479, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 481, + 500 + ], + "type": "text", + "content": "8. Chen, X.: Subspace-based optimization method for solving inverse-scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2009)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 501, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 501, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 138, + 501, + 481, + 522 + ], + "type": "text", + "content": "9. Chen, X.: Computational methods for electromagnetic inverse scattering. John Wiley & Sons (2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 522, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 522, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 522, + 481, + 555 + ], + "type": "text", + "content": "0. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 555, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 555, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 134, + 555, + 481, + 599 + ], + "type": "text", + "content": "11. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 600, + 481, + 632 + ], + "type": "text", + "content": "12. Chen, Z., Zhang, H.: Learning implicit fields for generative shape modeling. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 632, + 481, + 665 + ], + "type": "text", + "content": "13. Cheng, Y., Wan, R., Weng, S., Zhu, C., Chang, Y., Shi, B.: Colorizing monochromatic radiance fields. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "text", + "content": "14. Chew, W.C.: Waves and fields in inhomogeneous media, vol. 16. John Wiley & Sons (1999)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "type": "text", + "content": "15. Chew, W.C., Wang, Y.M.: Reconstruction of two-dimensional permittivity distribution using the distorted Born iterative method. IEEE Transactions on Medical Imaging (1990)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 173, + 480, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 173, + 480, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 173, + 480, + 194 + ], + "type": "text", + "content": "16. Colton, D., Kress, R.: Integral Equation Methods in Scattering Theory. SIAM (2013)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 195, + 480, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 195, + 480, + 217 + ], + "spans": [ + { + "bbox": [ + 134, + 195, + 480, + 217 + ], + "type": "text", + "content": "17. Colton, D.L., Kress, R., Kress, R.: Inverse Acoustic and Electromagnetic Scattering Theory. Springer (1998)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 134, + 218, + 480, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 218, + 480, + 251 + ], + "spans": [ + { + "bbox": [ + 134, + 218, + 480, + 251 + ], + "type": "text", + "content": "18. Cui, T.J., Chew, W.C., Yin, X.X., Hong, W.: Study of resolution and super resolution in electromagnetic imaging for half-space problems. IEEE Transactions on Antennas and Propagation (2004)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 251, + 480, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 251, + 480, + 274 + ], + "spans": [ + { + "bbox": [ + 134, + 251, + 480, + 274 + ], + "type": "text", + "content": "19. Deng, L.: The MNIST database of handwritten digit images for machine learning research. IEEE Signal Processing Magazine (2012)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 134, + 274, + 480, + 295 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 274, + 480, + 295 + ], + "spans": [ + { + "bbox": [ + 134, + 274, + 480, + 295 + ], + "type": "text", + "content": "20. Devaney, A.: Inverse-scattering theory within the rytov approximation. Optics Letters (1981)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 297, + 480, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 297, + 480, + 329 + ], + "spans": [ + { + "bbox": [ + 134, + 297, + 480, + 329 + ], + "type": "text", + "content": "21. Gao, F., Van Veen, B.D., Hagness, S.C.: Sensitivity of the distorted born iterative method to the initial guess in microwave breast imaging. IEEE Transactions on Antennas and Propagation (2015)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 134, + 330, + 480, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 330, + 480, + 352 + ], + "spans": [ + { + "bbox": [ + 134, + 330, + 480, + 352 + ], + "type": "text", + "content": "22. Geffrin, J., Sabouroux, P.: Continuing with the fresnel database: experimental setup and improvements in 3d scattering measurements. Inverse Problems (2009)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 134, + 353, + 480, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 353, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 134, + 353, + 480, + 385 + ], + "type": "text", + "content": "23. Geng, R., Hu, Y., Chen, Y., et al.: Recent advances on non-line-of-sight imaging: Conventional physical models, deep learning, and new scenes. APSIPA Transactions on Signal and Information Processing (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 134, + 386, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 386, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 134, + 386, + 480, + 418 + ], + "type": "text", + "content": "24. Geng, R., Li, Y., Zhang, D., Wu, J., Gao, Y., Hu, Y., Chen, Y.: Dream-pcd: Deep reconstruction and enhancement of mmwave radar pointcloud. arXiv preprint arXiv:2309.15374 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 134, + 419, + 439, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 419, + 439, + 430 + ], + "spans": [ + { + "bbox": [ + 134, + 419, + 439, + 430 + ], + "type": "text", + "content": "25. Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press (2013)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 431, + 480, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 431, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 134, + 431, + 480, + 453 + ], + "type": "text", + "content": "26. Grattarola, D., Vandergheynst, P.: Generalised implicit neural representations. In: Advances in Neural Information Processing Systems (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 453, + 480, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 453, + 480, + 486 + ], + "spans": [ + { + "bbox": [ + 134, + 453, + 480, + 486 + ], + "type": "text", + "content": "27. Habashy, T.M., Groom, R.W., Spies, B.R.: Beyond the born and rytov approximations: A nonlinear approach to electromagnetic scattering. Journal of Geophysical Research: Solid Earth (1993)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 487, + 480, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 487, + 480, + 508 + ], + "spans": [ + { + "bbox": [ + 134, + 487, + 480, + 508 + ], + "type": "text", + "content": "28. Habashy, T.M., Oristaglio, M.L., de Hoop, A.T.: Simultaneous nonlinear reconstruction of two-dimensional permittivity and conductivity. Radio Science (1994)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 509, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 509, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 134, + 509, + 480, + 542 + ], + "type": "text", + "content": "29. Hu, H., Chen, Y., Xu, J., Borse, S., Cai, H., Porikli, F., Wang, X.: Learning implicit feature alignment function for semantic segmentation. In: European Conference on Computer Vision (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 543, + 480, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 543, + 480, + 563 + ], + "spans": [ + { + "bbox": [ + 134, + 543, + 480, + 563 + ], + "type": "text", + "content": "30. de la Iglesia Castro, D.: 3D mnist: A 3D version of the mnist database of handwritten digits. https://www.kaggle.com/datasets/daavoo/3d-mnist" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 134, + 565, + 480, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 565, + 480, + 587 + ], + "spans": [ + { + "bbox": [ + 134, + 565, + 480, + 587 + ], + "type": "text", + "content": "31. Jagatap, G., Hegde, C.: Phase retrieval using untrained neural network priors. In: NeurIPS 2019 Workshop on Solving Inverse Problems with Deep Networks (2019)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 134, + 588, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 588, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 134, + 588, + 480, + 609 + ], + "type": "text", + "content": "32. Lempitsky, V., Vedaldi, A., Ulyanov, D.: Deep image prior. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (2018)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 134, + 610, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 610, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 610, + 480, + 632 + ], + "type": "text", + "content": "33. Li, J., Pang, M., Dong, Y., Jia, J., Wang, B.: Graph neural network explanations are fragile. In: International Conference on Machine Learning (2024)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "text", + "content": "34. Li, L., Wang, L.G., Teixeira, F.L., Liu, C., Nehorai, A., Cui, T.J.: Deepnis: Deep neural network for nonlinear electromagnetic inverse scattering. IEEE Transactions on Antennas and Propagation (2018)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "35. Li, Y., Zhang, D., Geng, R., Wu, J., Hu, Y., Sun, Q., Chen, Y.: Ifnet: Imaging and focusing network for handheld mmwave devices. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 182 + ], + "type": "text", + "content": "36. Liu, Z., Roy, M., Prasad, D.K., Agarwal, K.: Physics-guided loss functions improve deep learning performance in inverse scattering. IEEE Transactions on Computational Imaging (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 182, + 482, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 482, + 215 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 482, + 215 + ], + "type": "text", + "content": "37. Luo, Z., Guo, Q., Cheung, K.C., See, S., Wan, R.: Copyrnerf: Protecting the copyright of neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "type": "text", + "content": "38. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3D reconstruction in function space. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 249, + 482, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 249, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 249, + 482, + 281 + ], + "type": "text", + "content": "39. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing scenes as neural radiance fields for view synthesis. In: Proceedings of the European Conference on Computer Vision (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 281, + 482, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 281, + 482, + 303 + ], + "spans": [ + { + "bbox": [ + 130, + 281, + 482, + 303 + ], + "type": "text", + "content": "40. Mitra, S.K.: Digital signal processing: a computer-based approach. McGraw-Hill Higher Education (2001)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 304, + 482, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 325 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 325 + ], + "type": "text", + "content": "41. Mojabi, P., LoVetri, J.: Comparison of te and tm inversions in the framework of the gauss-newton method. IEEE Transactions on Antennas and Propagation (2010)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 326, + 482, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 326, + 482, + 347 + ], + "spans": [ + { + "bbox": [ + 130, + 326, + 482, + 347 + ], + "type": "text", + "content": "42. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 348, + 482, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 348, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 348, + 482, + 369 + ], + "type": "text", + "content": "43. Nikolova, N.K.: Microwave imaging for breast cancer. IEEE Microwave Magazine (2011)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 369, + 482, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 391 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 391 + ], + "type": "text", + "content": "44. Nordebo, S., Gustafsson, M., Nilsson, B.: Fisher information analysis for two-dimensional microwave tomography. Inverse Problems (2007)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 392, + 482, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 392, + 482, + 423 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 482, + 423 + ], + "type": "text", + "content": "45. O'Loughlin, D., O'Halloran, M., Moloney, B.M., Glavin, M., Jones, E., Elahi, M.A.: Microwave breast imaging: Clinical advances and remaining challenges. IEEE Transactions on Biomedical Engineering (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 424, + 482, + 467 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 424, + 482, + 467 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 482, + 467 + ], + "type": "text", + "content": "46. Pang, M., Wang, B., Ye, M., Cheung, Y.M., Zhou, Y., Huang, W., Wen, B.: Heterogeneous prototype learning from contaminated faces across domains via disentangling latent factors. IEEE Transactions on Neural Networks and Learning Systems (2024)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "type": "text", + "content": "47. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2019)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 502, + 482, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 502, + 482, + 522 + ], + "spans": [ + { + "bbox": [ + 130, + 502, + 482, + 522 + ], + "type": "text", + "content": "48. Peterson, A.F., Ray, S.L., Mittra, R.: Computational methods for electromagnetics. IEEE Press New York (1998)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 523, + 482, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 523, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 523, + 482, + 555 + ], + "type": "text", + "content": "49. Rubæk, T., Meaney, P.M., Meincke, P., Paulsen, K.D.: Nonlinear microwave imaging for breast-cancer screening using gauss-newton's method and the cgls inversion algorithm. IEEE Transactions on Antennas and Propagation (2007)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 555, + 482, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 578 + ], + "type": "text", + "content": "50. Sanghvi, Y., Kalepu, Y., Khankhoje, U.K.: Embedding deep learning in inverse scattering problems. IEEE Transactions on Computational Imaging (2019)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 578, + 482, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 578, + 482, + 610 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 482, + 610 + ], + "type": "text", + "content": "51. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. In: Advances in Neural Information Processing Systems (2020)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 611, + 482, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 611, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 611, + 482, + 632 + ], + "type": "text", + "content": "52. Slaney, M., Kak, A., Larsen, L.: Limitations of imaging with first-order diffraction tomography. IEEE Transactions on Microwave Theory and Techniques (1984)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "text", + "content": "53. Song, R., Huang, Y., Xu, K., Ye, X., Li, C., Chen, X.: Electromagnetic inverse scattering with perceptual generative adversarial networks. IEEE Transactions on Computational Imaging (2021)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 167, + 91, + 447, + 102 + ], + "type": "text", + "content": "An Implicit Solution to Electromagnetic Inverse Scattering Problems" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 481, + 599 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 117, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 481, + 138 + ], + "type": "text", + "content": "54. Stanley, K.O.: Compositional pattern producing networks: A novel abstraction of development. Genetic programming and evolvable machines (2007)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 481, + 160 + ], + "type": "text", + "content": "55. Taflove, A., Hagness, S.C., Piket-May, M.: Computational electromagnetics: the finite-difference time-domain method. The Electrical Engineering Handbook (2005)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 481, + 194 + ], + "type": "text", + "content": "56. Tang, Y., Zhu, C., Wan, R., Xu, C., Shi, B.: Neural underwater scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2024)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "text", + "content": "57. Wei, Z., Chen, X.: Deep-learning schemes for full-wave nonlinear inverse scattering problems. IEEE Transactions on Geoscience and Remote Sensing (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "text", + "content": "58. Wei, Z., Chen, X.: Uncertainty quantification in inverse scattering problems with bayesian convolutional neural networks. IEEE Transactions on Antennas and Propagation (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 249, + 481, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 281 + ], + "type": "text", + "content": "59. Xu, K., Zhang, C., Ye, X., Song, R.: Fast full-wave electromagnetic inverse scattering based on scalable cascaded convolutional neural networks. IEEE Transactions on Geoscience and Remote Sensing (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 282, + 481, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 481, + 314 + ], + "type": "text", + "content": "60. Xu, K., Zhong, Y., Wang, G.: A hybrid regularization technique for solving highly nonlinear inverse scattering problems. IEEE Transactions on Microwave Theory and Techniques (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 315, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 335 + ], + "type": "text", + "content": "61. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric iterative machine teaching. In: International Conference on Machine Learning (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "text", + "content": "62. Zhang, C., Cao, X., Liu, W., Tsang, I., Kwok, J.: Nonparametric teaching for multiple learners. Advances in Neural Information Processing Systems (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 358, + 481, + 379 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 379 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 379 + ], + "type": "text", + "content": "63. Zhang, C., Luo, S., Li, J., Wu, Y.C., Wong, N.: Nonparametric teaching of implicit neural representations. In: International Conference on Machine Learning (2024)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "type": "text", + "content": "64. Zhang, L., Xu, K., Song, R., Ye, X., Wang, G., Chen, X.: Learning-based quantitative microwave imaging with a hybrid input scheme. IEEE Sensors Journal (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 413, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 481, + 445 + ], + "type": "text", + "content": "65. Zhang, X., Zhao, Z.: A new scheme for solving highly nonlinear inverse scattering problems with noise disturbance. IEEE Geoscience and Remote Sensing Letters (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 446, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 468 + ], + "type": "text", + "content": "66. Zhong, Y., Chen, X.: Twofold subspace-based optimization method for solving inverse scattering problems. Inverse Problems (2009)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 468, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 481, + 500 + ], + "type": "text", + "content": "67. Zhong, Y., Chen, X.: An ftf twofold subspace-based optimization method for solving electromagnetic inverse scattering problems. IEEE Transactions on Antennas and Propagation (2011)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "text", + "content": "68. Zhong, Y., Lambert, M., Lesselier, D., Chen, X.: A new integral equation method to solve highly nonlinear inverse scattering problems. IEEE Transactions on Antennas and Propagation (2016)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "text", + "content": "69. Zhou, H., Cheng, Y., Zheng, H., Liu, Q., Wang, Y.: Deep unfolding contrast source inversion for strong scatterers via generative adversarial mechanism. IEEE Transactions on Microwave Theory and Techniques (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "text", + "content": "70. Zhu, C., Wan, R., Tang, Y., Shi, B.: Occlusion-free scene recovery via neural radiance fields. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "Z. Luo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_content_list.json b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..f299eab3f01d316efe62c9acf5e43e0ab66c5d26 --- /dev/null +++ b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_content_list.json @@ -0,0 +1,1947 @@ +[ + { + "type": "text", + "text": "Imaging with Confidence: Uncertainty Quantification for High-dimensional Undersampled MR Images", + "text_level": 1, + "bbox": [ + 282, + 140, + 718, + 209 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Frederik Hoppe1*, Claudio Mayrink Verdun2*, Hannah Laus3*, Sebastian Endt4, Marion I. Menzel4, Felix Krahmer3, and Holger Rauhut5", + "bbox": [ + 236, + 234, + 764, + 266 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ RWTH Aachen University, Germany hoppe@mathc.rwth-aachen.de", + "bbox": [ + 267, + 276, + 732, + 291 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Harvard University, USA claudioverdun@seas.harvard.edu", + "bbox": [ + 290, + 291, + 712, + 304 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 TU Munich & MCML, Germany {hannah.laus,felix.krahmer}@tum.de", + "bbox": [ + 251, + 304, + 750, + 318 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "4 TH Ingolstadt, TU Munich & GE HealthCare, Germany {sebastian.endt,Marion.Menzel}@thi.de", + "bbox": [ + 305, + 318, + 696, + 345 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "5 LMU Munich & MCML, Germany rauhut@math.lmu.de", + "bbox": [ + 305, + 345, + 694, + 359 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Establishing certified uncertainty quantification (UQ) in imaging processing applications continues to pose a significant challenge. In particular, such a goal is crucial for accurate and reliable medical imaging if one aims for precise diagnostics and appropriate intervention. In the case of magnetic resonance imaging, one of the essential tools of modern medicine, enormous advancements in fast image acquisition were possible after the introduction of compressive sensing and, more recently, deep learning methods. Still, as of now, there is no UQ method that is both fully rigorous and scalable. This work takes a step towards closing this gap by proposing a total variation minimization-based method for pixel-wise sharp confidence intervals for undersampled MRI. We demonstrate that our method empirically achieves the predicted confidence levels. We expect that our approach will also have implications for other imaging modalities as well as deep learning applications in computer vision. Our code is available on GitHub https://github.com/HannahLaus/Project_UQ_TV.git.", + "bbox": [ + 261, + 400, + 746, + 623 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Uncertainty Quantification $\\cdot$ Imaging Processing $\\cdot$ Magnetic Resonance Imaging", + "bbox": [ + 259, + 636, + 740, + 664 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 691, + 375, + 707 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In recent years, the field of magnetic resonance imaging, like many other imaging modalities, has undergone a significant paradigm shift towards a unified design of the acquisition-reconstruction pipeline. That is, the data to be acquired is selected based on the computational methods used for reconstruction. A prominent example of this interplay is compressive imaging, where sampling trajectories chosen to be suitable for imaging reconstruction via sparse recovery schemes", + "bbox": [ + 212, + 724, + 787, + 815 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* These authors contributed equally to this work.", + "bbox": [ + 217, + 824, + 550, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "allowed for significant undersampling [45]. Later, the same type of subsampling techniques have also proven successful in the context of deep learning reconstructions [33]. Thanks to these approaches, the retrieval of fast, undersampled MRI in clinical settings is now a reality. Indeed, in 2017, the FDA approved the first scanners employing acceleration techniques with compressive sensing [2, 3], and since then, several products and algorithms for retrieving highly undersampled images have emerged. In these advancements, mathematical theory has played a driving role, so this development has sometimes been described as from blackboard to bedside [18]. The main objective driving the design of the reconstruction algorithms is to use nonlinear optimization to find solutions adhering to structural constraints describing real images. These constraints could explicitly arise from a unified model, such as wavelet or gradient sparsity, or be implicitly learned from training data.", + "bbox": [ + 212, + 146, + 787, + 343 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "When the measurements are affected by noise, these methods search for solutions adhering to these constraints within the feasibility regions. That is, the imaging recovery method will search in the space of possible solutions and look for reconstructions that resemble natural images, which also makes potential reconstruction artifacts harder to identify. Especially unexpected localized features could correspond to real pathological abnormalities or arise in the interplay of noise and recovery methods. For this reason, quantifying the uncertainty via certified confidence intervals is of increasing importance not only for MRI but for a variety of problems in imaging and computer vision [59].", + "bbox": [ + 212, + 352, + 787, + 489 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "At the same time, classical approaches for assessing the confidence of the solution that could allow to distinguish these two causes, abnormalities and artifacts, are not applicable. The reason is that they typically require some knowledge of the distribution of the random distortion and, consequently, of the generated image. While the measurement error is well modeled by Gaussian noise, the distribution of the resulting distortion in the reconstruction cannot be modeled as easily due to the nonlinearity of the procedure, see, e.g., [22, Theorem 2] and the discussion therein. This poses a significant issue when the reconstructed image is directly employed for downstream tasks, such as automating the extraction of quantitative parameters for clinical analysis.", + "bbox": [ + 212, + 498, + 787, + 650 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Imaging with confidence, a novel rigorous method tailored to UQ: It is only recently that the first attempts to derive non-asymptotic confidence intervals for the pixel values of the reconstruction, without imposing prior knowledge have been successful (see Section 2 for a discussion). So far, most works have focused on sparsity models with respect to some known basis, as they are natural, for example, in angiography and reconstruction via variants of the LASSO [7]. In this work, we leverage these approaches to address the uncertainty quantification problem for recovery via total variation minimization, a standard recovery scheme for MR images in current industrial implementations [4] that has also conceptually inspired various machine learning-based approaches reaching state-of-the-art results such as variational networks [25]. To the best of our knowledge, for the first time, we provide rigorous confidence intervals for un-", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "dersampled acquired MR images and test the results with synthetic and in vivo data.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 200, + 388, + 217 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "There were other attempts available in the literature to tackle the aleatoric uncertainty quantification of high-dimensional parsimonious problems, such as in undersampled imaging generation. For example, a series of works developed the so-called generalized fiducial inference [26, 27, 41]. Such a method creates a relationship between the data and the parameters for which the UQ can be rigorously performed and establishes confidence intervals from such a relationship. However, high-dimensional Monte Carlo makes this method intractable in the high-dimensional imaging regime. Bayesian sparse learning techniques were also developed for undersampled imaging problems [43]. An inherent challenge with the Bayesian approach arises when inappropriate prior distributions, which fail to accurately reflect the prior physical knowledge of the problem, are employed. In such cases, the performance and reliability of the approach may deteriorate. Another line of research on UQ is conformal prediction, which generates distribution-free prediction sets for regression and classification problems [9]. However, choosing the score function in imaging problems can be challenging. Such a technique is more directly applied to epistemic uncertainty rather than to the aleatoric one [31]. Our work builds on the urgency of providing rigorous UQ to imaging problems in computer vision and image processing. Such necessity can be seen in the several workshops for UQ in computer vision and imaging that took place over the last few years dedicated to this theme [1, 5, 6].", + "bbox": [ + 212, + 234, + 787, + 536 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our uncertainty quantification extends a line of research about non-asymptotic confidence intervals for high-dimensional problems known as debiased estimators, which was initiated in a series of papers [11,35,60,65]. The key idea is that given an estimator to retrieve noisy image retrieval from a few measurements; one can characterize the distribution of a modified estimator based on the KKT conditions of the underlying inverse problem; see Section 3.2. Such works established sharp confidence intervals for i.i.d. (sub-)Gaussian variables with Gaussian noise by assuming that the object to be retrieved is s-sparse in the canonical basis. However, such variables do not represent typical constraints imposed by the physics behind the acquisition procedure. Later, this was extended to imaging applications, where UQ was rigorously obtained for $\\ell_1$ model-based MRI [28,29]. In this paper, we harness results for UQ obtained in previous works to more realistic scenarios where the images are reconstructed via the minimization of the total variation semi-norm, an idea introduced in the seminal paper [53]. This imaging retrieval technique was extensively explored in tasks such as inpainting, denoising, and deblurring; see [14, 32] and references therein. This method has been rigorously proven to yield state-of-the-art results in MRI reconstruction - see [40] and [7, Chapter 17] - and was consistently tested in several applications such as parallel imaging [12], free-breathing three-dimensional cardiac MRI [16], non-contrast-enhanced angiography [17], spectroscopy [54] and metabolite maps", + "bbox": [ + 212, + 537, + 787, + 843 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "of the human brain [47], to name a few. Recently, in the context of learning algorithms, the work [57] proposed a latent Bayesian model with a variational autoencoder to obtain posterior distributions for the generated images and the work [21] proposed hierarchical conditional variational autoencoders for UQ, but no theory is available for such methods. Finally, [30] developed a non-asymptotic theory for constructing confidence intervals for high-dimensional learning problems.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Background: Sparse Imaging Retrieval", + "text_level": 1, + "bbox": [ + 215, + 276, + 625, + 294 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we summarize the tools we need to construct confidence intervals for images. Throughout the paper, we consider the following high-dimensional linear model that is a discretized version of the Bloch equations, which models the MR acquisition process [42]", + "bbox": [ + 212, + 308, + 785, + 369 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\nb = \\mathcal {P F} x ^ {0} + \\varepsilon \\quad \\text {w i t h} N \\gg m. \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 381, + 785, + 398 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Here, $b \\in \\mathbb{C}^m$ is the k-space data, $\\mathcal{P}\\mathcal{F} \\in \\mathbb{C}^{m \\times N}$ is a subsampled Fourier matrix, $x^0 \\in \\mathbb{C}^N$ is the underlying ground truth image, and $\\varepsilon \\sim \\mathcal{CN}(0, \\sigma^2 I_{N \\times N})$ is complex Gaussian noise. The goal in fast undersampled MRI is to retrieve $x^0$ having $m < N$ k-space measurements $b$ when $\\mathcal{P}\\mathcal{F}$ and $\\sigma$ are known.", + "bbox": [ + 214, + 409, + 787, + 470 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Total Variation", + "text_level": 1, + "bbox": [ + 214, + 493, + 388, + 507 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "As described in Sec. 2, several image modalities can be modeled by gradient-sparse images. Also, such guiding principle is behind modern deep learning architectures that learn higher-order statistics of images, e.g., those based on the fields of experts framework [52]. Therefore, we extend the results to the total-variation setting to create rigorous UQ schemes for MRI. More precisely, for a given image $x^0 \\in \\mathbb{C}^N$ , we consider the finite gradient operator $D$ that gives $Dx^0 = (x_2^* - x_1^*, \\ldots, x_N^* - x_{N-1}^*)^T \\in \\mathbb{C}^{N-1}$ and we solve the total variation problem, i.e.,", + "bbox": [ + 212, + 518, + 787, + 638 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {a r g m i n} _ {x \\in \\mathbb {C} ^ {N}} \\frac {\\mu}{2} \\| b - \\mathcal {P F} x \\| _ {2} ^ {2} + \\| x \\| _ {T V} \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 375, + 638, + 785, + 664 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "with a regularization parameter $\\mu > 0$ for balancing the data fidelity term $\\|b - \\mathcal{P}\\mathcal{F}x\\|_2^2$ and the regularization term $\\|x\\|_{TV} \\coloneqq \\|Dx\\|_1$ , which is referred to as the anisotropic formulation [7]. We use such a formulation due to the resemblance with the LASSO estimator. Still, the same techniques described here hold for other discretizations of the total variation, such as the isotropic one, e.g., see [15].", + "bbox": [ + 214, + 669, + 787, + 746 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 Debiased Estimators for Image Retrieval", + "text_level": 1, + "bbox": [ + 214, + 768, + 599, + 784 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "If the underlying image to be retrieved from a few samples is sparse in the canonical basis, several methods in the sparse learning literature can be used, with the LASSO being arguably the most famous one [58]. However, given a certain", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "noise level $\\sigma$ , it is provably impossible to have a practical characterization of the LASSO distribution since it depends on the support of the ground truth, which is not known in advance [22]. Moreover, a bias is introduced by the shrinkage procedure of the $\\ell_1$ -norm [23, Chapter 4]. Several works in the statistical literature developed strategies to debiase such estimators, e.g., [35,36,60,65]. Roughly speaking, such works introduce a correction term to the LASSO estimator $\\hat{x}$ that aims to retrieve $x^0$ from $b = Ax^0 + \\varepsilon$ . It is given by $\\hat{x}^u = \\hat{x} + \\frac{1}{m} MA^*(b - A\\hat{x})$ , where, for a given sample covariance matrix $\\hat{\\Sigma} = \\frac{A^*A}{m}$ , $M$ should be chosen (as discussed in Sec. 4), such that $M\\hat{\\Sigma} \\approx I_{N \\times N}$ . From that, the decomposition", + "bbox": [ + 212, + 146, + 787, + 287 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\sqrt {m} \\left(\\hat {x} ^ {u} - x ^ {0}\\right) = \\frac {1}{\\sqrt {m}} M A ^ {*} \\varepsilon - \\sqrt {m} \\left(M \\hat {\\Sigma} - I _ {N \\times N}\\right) \\left(\\hat {x} - x ^ {0}\\right), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 297, + 292, + 785, + 324 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\frac{1}{\\sqrt{m}} MA^{*}\\varepsilon \\sim \\mathcal{N}(0,\\sigma^{2}M\\hat{\\Sigma} M^{*})$ , follows. The work [36] showed that in the not realistic case of a measurement process $A$ being described by a real Gaussian matrix with known covariance matrix $\\Sigma$ , the remainder term $\\sqrt{m}(M\\hat{\\Sigma} - I_{N\\times N})(\\hat{x} - x^0)$ vanishes with probability converging to 1 as $m = m(N) \\to \\infty$ provided $m \\geq Cs\\sqrt{\\log N}$ for a constant $C > 0$ . This means that, given a certain noise level, the difference between this new estimator and the underlying image, $\\hat{x}^u - x^0$ , is approximately a Gaussian variable. Such distance can be quantified in a non-asymptotic way, which means that non-asymptotic sharp confidence intervals can be derived for such an estimator. In the case of realistic measurement operators given by a subsampled Fourier matrix, the works [28, 29] proved that the remainder term in $\\ell_1$ -regularization also vanishes under slightly stronger assumptions in the number of acquired k-space points as compared to the case of Gaussian measurements. From that, confidence intervals for sparse MR images can be constructed but only in the context of $\\ell_1$ -regularized recovery. In particular, these results do not cover variational approaches such as the total variation minimization problem Eq. (2), which continues to be the method of choice for many applications due to its simplicity and good numerical performance and which also plays a foundational role for many machine learning approaches to MRI recovery in realistic settings, as discussed in Section 2.", + "bbox": [ + 212, + 330, + 787, + 619 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this paper, we step towards closing this gap by leveraging previous debiasing approaches to quantify the uncertainty for MR images recovered from undersampled data via the variational problem Eq. (2). We introduce the estimator in Sec. 4 and establish non-asymptotic confidence intervals for every pixel of the image to be retrieved in Sec. 5. In Sec. 6, we discuss the role of noise estimation in MRI, and, finally, in Sec. 7, we numerically illustrate our findings on in vivo brain data.", + "bbox": [ + 212, + 619, + 787, + 726 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 Debiased Total Variation Estimator", + "text_level": 1, + "bbox": [ + 214, + 744, + 598, + 762 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Since most MR images are not sparse in the pixel domain, the standard debiased LASSO is limited in practice. Thus, inspired by [28, 29], we propose to use a", + "bbox": [ + 212, + 771, + 787, + 803 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_footnote", + "text": "6 The notation $m(N)$ considers a sequence of regression problems, where both dimensions $m$ and $N$ are growing with the rate $\\frac{s\\sqrt{\\log N}}{m} \\to 0$ .", + "bbox": [ + 217, + 808, + 785, + 842 + ], + "page_idx": 4 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1 Construction of correction matrix $M$" + ], + "code_body": "1: Input: Sampling mask $P$ , regularization parameters $\\lambda_1 \\dots \\lambda_N$ \n2: For $i \\in [N]$ solve $\\hat{x}^i \\gets \\min_{x \\in \\mathbb{C}^{N-1}} \\frac{1}{2m} \\left\\| (\\mathcal{P}\\mathcal{F})_i - (\\mathcal{P}\\mathcal{F})_{-i} x \\right\\|_2^2 + \\lambda_i \\| x \\|_1$ \n3: Set $\\hat{T}^2 = \\mathrm{diag}\\left(\\overline{\\hat{r}_1^2}, \\ldots, \\overline{\\hat{r}_N^2}\\right)$ with $\\hat{r}_i^2 = \\frac{1}{m} \\left((\\mathcal{P}\\mathcal{F})_i - (\\mathcal{P}\\mathcal{F})_{-i} \\hat{x}^i\\right)^*\\left(\\mathcal{P}\\mathcal{F}\\right)_i$ \n4: For $i \\in [N]$ let $\\hat{c}^i \\in \\mathbb{C}^N$ , set $\\hat{c}_j^i = -\\hat{x}_j^i$ for $j < i$ , $\\hat{c}_j^i = -\\hat{x}_{j-1}^i$ for $j > i$ and $\\hat{c}_i^i = 1$ . \n5: Set $\\hat{C} = (\\hat{c}^1, \\dots, \\hat{c}^N)^T \\in \\mathbb{C}^{N \\times N}$ \n6: Compute $M = \\hat{T}^{-2}\\hat{C}$ \n7: Output: Correction matrix $M$", + "bbox": [ + 222, + 164, + 774, + 276 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "debiased TV estimator of the form $\\hat{x}^u = \\hat{x} +\\frac{1}{m} M(P\\mathcal{F})^* (b - P\\mathcal{F}\\hat{x})$ , where $\\hat{x}$ denotes the solution of Eq. (2). The decomposition", + "bbox": [ + 212, + 305, + 784, + 338 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\sqrt {m} \\left(\\hat {x} ^ {u} - x ^ {0}\\right) = \\frac {1}{\\sqrt {m}} M (P \\mathcal {F}) ^ {*} \\varepsilon - \\sqrt {m} \\left(M \\hat {\\Sigma} - I _ {N \\times N}\\right) (\\hat {x} - x ^ {0}). \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 279, + 345, + 785, + 378 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "consists of a remainder term $R \\coloneqq \\sqrt{m} (M\\hat{\\Sigma} - I_{N\\times N})(x^0 - \\hat{x})$ and of $W \\coloneqq \\frac{1}{\\sqrt{m}} M(P\\mathcal{F})^{*}\\varepsilon$ which is complex Gaussian distributed with zero mean and covariance matrix $\\frac{\\sigma^2}{m} M(P\\mathcal{F})^{*}(M(P\\mathcal{F})^{*})^{*} = \\sigma^2 M\\hat{\\Sigma} M^{*}$ due to the Gaussian distribution of the noise. The remainder term vanishes provided that, for a given correction matrix $M$ , the term $\\max_{ij\\in [N]}|(M\\hat{\\Sigma} - I_{N\\times N})_{ij}|$ is small and that the solution to the variational problem Eq. (2) accurately describes the underlying image, i.e., $x^0 - \\hat{x}$ is small.", + "bbox": [ + 212, + 388, + 787, + 508 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The so-called nodewise LASSO, here adapted to complex subsampled Fourier matrices, and described in Algorithm 1, guarantees that $\\max_{ij\\in [N]}|(M\\hat{\\Sigma} -I_{N\\times N})_{ij}|$ is small [36,60]. There, $(\\mathcal{PF})_i$ denotes the $i$ -th column of the matrix $(\\mathcal{PF})$ and $(\\mathcal{PF})_{-i}$ denotes this matrix without the $i$ -th column. For the latter, i.e., to understand when $x^0 -\\hat{x}$ is small, a series of works, e.g., [39,48,49] and [7, Theorem 17.5] show that TV minimization provably retrieves a gradient-sparse image. The above results combined lead to the construction of pixel-wise sharp confidence intervals as described in Sec. 5. A remarkable advantage of such estimators is that once the image is retrieved as a solution to a convex optimization problem, one only needs to add the term $\\frac{1}{m} M(P\\mathcal{F})^{*}(b - P\\mathcal{F}\\hat{x})$ to the estimator $\\hat{x}$ in order to obtain confidence intervals. The inexpensive cost of such a debiased strategy comes from the fact that, for a given subsampling pattern $\\mathcal{P}$ , the matrix $M$ needs to be computed only once, and it is independent of the image and the noise level.", + "bbox": [ + 212, + 510, + 787, + 728 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5 Confidence Intervals Implementation", + "text_level": 1, + "bbox": [ + 215, + 751, + 609, + 768 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The construction of confidence intervals relies on the asymptotic normality of the debiased TV estimator. If the remainder term is small, then", + "bbox": [ + 212, + 782, + 787, + 813 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\sqrt {m} (\\hat {x} ^ {u} - x ^ {0}) \\sim \\mathcal {C N} (0, \\sigma^ {2} M \\hat {\\Sigma} M ^ {*}). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 374, + 821, + 785, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The goal is to derive a confidence interval for every pixel. We start with a confidence region $C_i(\\alpha)$ for the complex pixel value $x_{i}^{0}$ that depends on the significance level $\\alpha \\in (0,1)$ , such that", + "bbox": [ + 214, + 146, + 787, + 191 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbb {P} \\left(x _ {i} ^ {0} \\in C _ {i} (\\alpha)\\right) \\geq 1 - \\alpha \\quad \\text {f o r e v e r y i m a g e} x ^ {0}, \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 334, + 204, + 785, + 220 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathbb{P}$ denotes the probability due to the random noise. According to Eq. (5), the new estimator $\\hat{x}^u$ induces a complex Gaussian distribution on the difference $\\hat{x}^u - x^0$ . This means that it is possible to derive confidence intervals for the magnitude and the phase of the MR images. Since both the real part and the imaginary part are Gaussian distributed, the absolute value $|\\hat{x}_i^u - x_i^0| = \\sqrt{\\Re(\\hat{x}_i^u - x_i^0)^2 + \\Im(\\hat{x}_i^u - x_i^0)^2}$ follows a Rician distribution with zero-mean. This special case simplifies to a Rayleigh distribution with variance $\\sigma \\cdot \\sqrt{(M\\hat{\\Sigma}M^*)_{ii}}$ [8]. The corresponding radius $\\delta_i$ of the confidence region $C_i(\\alpha)$ is given by", + "bbox": [ + 214, + 232, + 787, + 364 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\delta_ {i} (\\alpha) = \\frac {\\sigma \\sqrt {\\log (1 / \\alpha)}}{\\sqrt {m} \\sqrt {(M \\hat {\\Sigma} M ^ {*}) _ {i i}}}. \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 406, + 377, + 785, + 421 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Therefore, $C_i(\\alpha)$ is a circle centered around the debiased TV reconstruction $\\hat{x}_i^u$ with radius $\\delta_i(\\alpha)$ , i.e. $C_i(\\alpha) = \\{z \\in \\mathbb{C} \\mid |z - \\hat{x}_i^u| \\leq \\delta\\}$ . The confidence intervals for the magnitude, which is what is typically visualized by radiologists, can be constructed due to the following inequality:", + "bbox": [ + 214, + 431, + 787, + 492 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbb {P} \\left(| x _ {i} ^ {0} | \\in [ | \\hat {x} _ {i} ^ {u} | - \\delta_ {i} (\\alpha), | \\hat {x} _ {i} ^ {u} | + \\delta_ {i} (\\alpha) ]\\right) \\geq \\mathbb {P} \\left(x _ {i} ^ {0} \\in C _ {i} (\\alpha)\\right) \\geq 1 - \\alpha . \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 281, + 503, + 785, + 522 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Hence, the $1 - \\alpha$ confidence interval for the magnitude is given by $J_{i}(\\alpha) = [|\\hat{x}_{i}^{u}| - \\delta_{i}(\\alpha), |\\hat{x}_{i}^{u}| + \\delta_{i}(\\alpha)]$ . Please note, however, that the confidence regions are given in the complex plane. This means that we could also have CIs for the phase $\\varphi^0$ of the image, which contains information, e.g., on motion or electromagnetic properties of biological tissues [55]. With the same argument as in Eq. (8), and by denoting $\\hat{\\varphi}_i \\coloneqq \\arcsin \\left(\\frac{\\Re(\\hat{x}_i^u)}{|\\hat{x}_i^u|}\\right)$ and $\\gamma_i = \\arccos \\left(1 - \\frac{\\delta_i^2}{2|\\hat{x}_i^u|^2}\\right)$ , we obtain", + "bbox": [ + 214, + 532, + 787, + 632 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbb {P} \\left(\\varphi_ {i} ^ {0} \\in [ \\hat {\\varphi} _ {i} - \\gamma_ {i}, \\hat {\\varphi} _ {i} + \\gamma_ {i} ]\\right) \\geq 1 - \\alpha . \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 645, + 785, + 662 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For a detailed derivation of the confidence intervals, refer to Section 2 of the supplementary material. This paper focuses on visualizing magnitudes, so we adhere to the confidence intervals presented in Equation 8.", + "bbox": [ + 212, + 672, + 785, + 718 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Rigorously, Eq. (6) should be interpreted in the following way: The random quantity in Eq. (6) is the confidence region $C_i(\\alpha)$ since it is based on the debiased TV estimator, which, in turn, is reconstructed by data that is affected by random noise. In contrast, the underlying image $x_i^0$ is fixed. Therefore, one should consider an experiment that is conducted $l$ times, and every time the noise is different, it leads to a (slightly) different reconstruction. Hence, also to a (slightly) different confidence interval. In the end, the confidence region will contain the underlying image in at least $1 - \\alpha$ of the $l$ cases.", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Algorithm 2 Confidence intervals for MR images", + "text_level": 1, + "bbox": [ + 217, + 145, + 581, + 162 + ], + "page_idx": 7 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1: Input: Sampling mask $\\mathcal{P}$ , k-space data $b$ , regularization parameter $\\mu$ , (estimated) noise level $\\hat{\\sigma}$ , significance level $\\alpha$ , correction matrix $M$", + "2: solve $\\hat{x}\\gets \\min_{x\\in \\mathbb{C}^N}\\frac{\\mu}{2}\\| b - \\mathcal{P}Fx\\|_2^2 +\\| x\\|_{TV}$", + "3: debias reconstruction $\\hat{x}^u\\gets \\hat{x} +\\frac{1}{m} M(\\mathcal{PF})^* (b - \\mathcal{PF}\\hat{x})$", + "4: For each pixel $i$ compute radius $\\delta_{i}\\gets \\frac{\\hat{\\sigma}}{\\sqrt{m}\\sqrt{(M\\hat{\\Sigma}M^{*})_{ii}}}\\sqrt{\\log(1 / \\alpha)}$ with covariance matrix $\\hat{\\Sigma} = (\\mathcal{P}\\mathcal{F})^{*}(\\mathcal{P}\\mathcal{F}) / m$", + "5: For each pixel $i$ obtain confidence circle $C_i(\\alpha) \\gets \\{z \\in \\mathbb{C} \\mid |z - \\hat{x}_i^u| \\leq \\delta\\}$", + "6: For each pixel $i$ compute its confidence interval for the magnitude $J_{i}(\\alpha) \\gets [|\\hat{x}_{i}^{u}| - \\delta_{i}(\\alpha), |\\hat{x}_{i}^{u}| + \\delta_{i}(\\alpha)]$", + "7: Output: Reconstructions $\\hat{x}$ , $\\hat{x}^u$ and confidence circles $C_i(\\alpha)$ for $x_i^0$ and confidence intervals $J_i(\\alpha)$ for the magnitude $|x_i^0|$ for every pixel $i$" + ], + "bbox": [ + 222, + 165, + 785, + 328 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Imaging with confidence, summarized in Algorithm 2, computes confidence intervals for the given pixels of an image retrieved via total variation minimization. More precisely, we propose an estimator that has an asymptotic Gaussian distribution, and from that, we derive pixel-wise uncertainty quantification for the magnitude and the phase of MR images. To visualize such a UQ procedure, we choose lines in the image, draw the confidence intervals, and measure the hit rate of how many pixels lie inside the given interval.", + "bbox": [ + 212, + 362, + 787, + 468 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "6 Estimating the Noise Level", + "text_level": 1, + "bbox": [ + 215, + 492, + 514, + 510 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Despite advances in hardware and image acquisition techniques for MRI, the problem of noise in MR images persists, making noise estimation and analysis crucial tasks in MR image reconstruction [8]. Notably, MR noise estimation increases in complexity if advanced MR reconstruction approaches (e.g. parallel imaging) are employed and, especially, if the underlying individual coil raw data is not available. This is the default case for the clinical use of MRI since usually, only the magnitude data of the image after reconstruction is stored in clinical databases for diagnostic purposes. For our conceptual work on UQ, we ensured the consistent availability of the MR raw data by obtaining it directly from the MR scanner. Therefore, we were able to utilize image regions without imaging objects to retrieve the Gaussian distributed noise characteristics directly, obtaining noise levels of $5\\% - 15\\%$ for the available data. For future implementation on any MR scanners, our proposed method for UQ can be directly amended to the regular image reconstruction when raw data is still available.", + "bbox": [ + 212, + 525, + 787, + 738 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "7 Numerical Experiments", + "text_level": 1, + "bbox": [ + 215, + 761, + 480, + 779 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We numerically illustrate our imaging with confidence method by applying it to obtain pixel-wise confidence intervals for clinically feasible MR images reconstructed from noisy measurements. In line with our discussion above, we work", + "bbox": [ + 212, + 794, + 785, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "with noise levels between $6\\%$ and $12.5\\%$ . We retrieve the image by minimizing the TV-regularized objective, Eq. (2), and we consider two different sampling schemes, radial and spiral sampling, which are both among the most popular for MRI applications. The code for reproducing all the experiments is available on GitHub7. More information about the implementation can be found in the supplementary material in Section 3.", + "bbox": [ + 212, + 146, + 787, + 236 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The radial k-space masks were generated according to the golden angle radial scheme proposed by [63]. Each mask is created by adding lines going through the center of the mask by placing a new line in an angle of $111.246^{\\circ}$ (the golden angle) to the previously added one. As for the latter, k-space masks for spiral sampling were generated by first simulating readout gradients in 2D and computing the resulting k-space trajectories. The trajectories were regridded to the Cartesian grid and transformed to boolean masks. Undersampling factors were adjusted by changing the number of spokes and fine-tuned by adjusting the maximum radius $\\sqrt{(k_x^2 + k_y^2)}$ . Again, individual spokes were rotated by the golden angle relative to the previous one. Each spiral spoke forms a $3/4$ rotation. The masks were fit to the size of our images, i.e., $156 \\times 156$ .", + "bbox": [ + 212, + 237, + 787, + 410 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "As we will observe below, the confidence intervals appropriately capture the difference between ground truth and reconstruction, as predicted. Note that in the plots displaying this finding, the ground truth is only added as a comparison to assess UQ but never used for designing our method.", + "bbox": [ + 212, + 410, + 787, + 470 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "7.1 UQ for in vivo Complex MRI Data", + "text_level": 1, + "bbox": [ + 214, + 492, + 553, + 508 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To assess UQ in realistic scenarios, we simulate the MRI data acquisition and reconstruction process using in vivo data as the underlying ground truth image, see Fig. 1a. We use existing in vivo data acquired with an inversion recovery spin echo (IR-SE) sequence with single-shot spiral readout as described by the works [19, 46]. Brain data of a healthy 32-year-old female were acquired on a Siemens Magnetom Skyra Connectome 3T system with a 32-channel head coil8 with a matrix of $156 \\times 156$ . Images with complex (magnitude and phase) data were reconstructed using an oversampled ridge-regression estimator that uses a higher order signal model that accounts for spatio-temporal field dynamics [50, 61, 62]. This high-quality complex-valued reconstruction serves as ground truth data for validating our uncertainty quantification method. Moreover, all in vivo scans were performed in accordance with local ethics guidelines and the Institutional Review Board (IRB) after obtaining the volunteer's written informed consent.", + "bbox": [ + 212, + 516, + 787, + 712 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The data acquisition process in the MRI scanner is simulated by taking the 2D Fourier transform of the image, adding Gaussian noise with noise level $\\sigma = 0.1$ (see Fig. 1b) and subsampling this k-space data using the spiral and radial sampling scheme, respectively. The sampling masks are visualized in Fig. 1c for $43\\%$ spiral subsampling and in Fig. 1d for $50\\%$ radial subsampling. These subsampling rates are inspired by studies about the limitations of compressive sensing", + "bbox": [ + 212, + 712, + 787, + 805 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_footnote", + "text": "7 https://github.com/HannahLaus/Project_UQ_TV.git", + "bbox": [ + 217, + 810, + 596, + 825 + ], + "page_idx": 8 + }, + { + "type": "page_footnote", + "text": "Siemens Healthineers, Erlangen, Germany.", + "bbox": [ + 218, + 825, + 514, + 838 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "approaches for MRI based on expert Radiologists' scoring [34]. The resulting relative noise levels are $\\frac{\\|\\varepsilon\\|_2}{\\|\\mathcal{P}\\mathcal{F}x^0\\|_2} \\approx 6.5\\%$ for spiral and $7\\%$ for radial sampling.", + "bbox": [ + 212, + 146, + 782, + 181 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Since the sampling patterns are fixed, we calculate, for both masks, the matrix $M$ according to Algorithm 1 with $\\lambda_{1} = \\ldots = \\lambda_{N} = 0.0035 \\cdot \\frac{\\sqrt{m}}{\\sqrt{12\\log(N)}}$ using FISTA [10] with 1000 iterations. The dimensional scaling $\\frac{\\sqrt{m}}{\\sqrt{12\\log(N)}}$ comes from theoretical works on debiased estimators, e.g., [28]. The constant 0.0035 was found via cross-validation. To reconstruct the image by the subsampled spiral and radial data, respectively, we solve Eq. (2) with the Split-Bregman algorithm [24] since it allows for complex-valued solutions. We use the parameters $\\hat{\\mu} = \\frac{\\mu}{20}$ , $\\lambda_{1} = \\lambda_{2} = 0.05$ . For further information on the parameters and the optimization problem, see Section 1 of the supplementary material. The parameter $\\mu = \\frac{\\sqrt{m}}{\\sigma\\sqrt{12\\log N}}$ was theoretically calculated for a subsampled Fourier matrix in [28]. After this reconstruction step, we compute the debiased TV estimator according to Algorithm 2.", + "bbox": [ + 212, + 181, + 787, + 383 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/4890f1640d322c7e525512ddb152fe338953b256a6cbc3121031952410435df9.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 233, + 417, + 346, + 487 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/809a116ee2fca079c28506475ba8c1c13f75bf6050ddc907d3faef2446757d1c.jpg", + "image_caption": [ + "(b)", + "Fig. 1: Model of experimental setting 1a: Magnitude of complex ground truth data 1b: Full k-space affected by Gaussian noise with noise level $\\sigma = 0.1$ 1c: Spiral subsampling mask which samples $43\\%$ of k-space 1d: Radial subsampling mask which samples $50\\%$ of k-space." + ], + "image_footnote": [], + "bbox": [ + 375, + 417, + 483, + 487 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/872e858ac8f0bd870313abb42da17c61e8daa28502865cb23d2f59ca73bef9f0.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 516, + 417, + 622, + 486 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/fdbd8334e0e71111b8a41b918ef9bab789d2c1bac75e94e2786b76ba7e2cbc11.jpg", + "image_caption": [ + "(d)" + ], + "image_footnote": [], + "bbox": [ + 656, + 417, + 764, + 486 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "To examine the distribution of the debiased TV estimator, a Q-Q plot (see Fig. 2d) compares the quantiles of the input sample, i.e. every component $\\frac{\\sqrt{2m}\\Re(\\hat{x}^u - x^0)_i}{\\sigma\\cdot\\sqrt{(M\\hat{\\Sigma}M^*)_{ii}}}$ with the quantiles of a standard Gaussian distribution. It indeed confirms that the input is Gaussian distributed. Since the same is true for the imaginary part, it holds that $\\sqrt{m} (\\hat{x}^u -x^0)\\sim \\mathcal{CN}(0,\\sigma^2 M\\hat{\\Sigma} M^*)$ , which means that the error of the debiased TV follows a Gaussian distribution with mean zero and covariance structure $\\sigma^2 M\\hat{\\Sigma} M^*$ . The same behavior can be observed for radial sampling. The Q-Q plot is shown in Fig. 4d.", + "bbox": [ + 212, + 603, + 787, + 733 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Algorithm 2, then, constructs confidence regions for the complex pixel values from which confidence intervals for the magnitudes and phases can be derived by using the fact that the new debiased estimator follows a Gaussian distribution given by $\\sqrt{m}\\hat{x}^u\\sim \\mathcal{CN}(\\sqrt{m} x^0,\\sigma^2 M\\hat{\\Sigma} M^*)$ . Here, we choose the confidence level $\\alpha = 0.05$ . For clarity, we show confidence intervals for all the pixels, corresponding to magnitudes, lying in a small rectangular region in the image. See Fig. 2a together with the corresponding confidence intervals in Figs. 2b and 2c in the", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/32eefc2d693801bd0fadb6f5bc67a2669b2e6c252717f3e5200130dd3c9a77ca.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 246, + 152, + 328, + 217 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/d0cd0ad537c3861054b0d62bf1f83f24b56552077dd5f25d77217e3e3d712ea5.jpg", + "image_caption": [ + "(b)" + ], + "image_footnote": [], + "bbox": [ + 364, + 152, + 488, + 220 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/50dc5c0ff14a24614ed1b37a91a4e75488372ce439f0c6b5e3f19cd936353dd9.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 511, + 152, + 632, + 220 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/876f3efca43320f84dc47b549230c2f2e80f59fa933c59319ff258bbc42acb49.jpg", + "image_caption": [ + "(d)", + "Fig. 2: Confidence intervals for $43\\%$ spiral sampling 2a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 2b & 2c: $95\\%$ confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values, the blue circles are the corresponding estimates of the debiased TV estimator. 2b is for a reconstruction with $6.5\\%$ noise and 2c is for a reconstruction with $10\\%$ noise. 2d: Q-Q plot for input samples $\\frac{\\sqrt{2m(\\hat{x}^u - x^0)_i}}{\\sigma\\cdot\\sqrt{(M\\Sigma M^*)_{ii}}}$ ." + ], + "image_footnote": [], + "bbox": [ + 651, + 152, + 772, + 222 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/e6c910f9fbea2913f4efc6ce59301a3470f45e5b0b03820c295b7c371a45dc11.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 346, + 372, + 483, + 455 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/051347887c26b70f23e67840f4a640a0aaeeb00b107d9e8baceb5879e78a1476.jpg", + "image_caption": [ + "(b)", + "Fig. 3: Empirical probability $\\hat{\\mathbb{P}}_i(\\alpha) = \\frac{1}{100}\\sum_{j=1}^{100}\\mathbb{1}_{\\{x_i^0 \\in C_i(\\alpha, \\varepsilon^{(j)})\\}}$ for every image pixel each time with a different realization 3a for $43\\%$ spiral undersampling and for 3b for $50\\%$ radial undersampling." + ], + "image_footnote": [], + "bbox": [ + 521, + 372, + 656, + 455 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "spiral undersampling setting as well as Figs. 4a, 4b and 4c for the radial case, respectively.", + "bbox": [ + 212, + 571, + 782, + 602 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Interpretation of the UQ Procedure. The quality of the confidence regions is quantified by counting how many confidence regions contain the true ground truth pixel value $x_{i}^{0}$ on and off the support. These hit rates are calculated for one realization of the noise by $h = \\frac{1}{N}\\sum_{i=1}^{N}\\mathbb{1}_{\\{x_{i}^{0}\\in C_{i}\\}}$ and $h_{S} = \\frac{1}{s}\\sum_{i\\in \\mathrm{supp}(x^{0})}\\mathbb{1}_{\\{x_{i}^{0}\\in C_{i}\\}}$ , where $s$ denotes the amount of pixels that are different from zero. But in view of the interpretation of a confidence interval as described in Sec. 5, we also estimate the probability $\\mathbb{P}(x_i^0\\in C_i(\\alpha))$ by the empirical probability $\\hat{\\mathbb{P}}_i(\\alpha) = \\frac{1}{100}\\sum_{j=1}^{100}\\mathbb{1}_{\\{x_i^0\\in C_i(\\alpha,\\varepsilon^{(j)})\\}}$ for every pixel $i\\in [0,156]^2$ with $\\varepsilon^{(j)}$ denoting the dependency on the $j$ -th realization of the noise. In contrast to the hit rates, which are computed for one realization of the noise over all pixels, here we fix a pixel and observe how often the random confidence regions contain this pixel averaged over 100 different realizations of the noise. The image containing the empirical probability values for all pixels is shown in Fig. 3a for the spiral and in Fig. 3b for the radial case, respectively. In both cases, the maps seem to contain residual image information. In the spiral setting, the empirical probabil-", + "bbox": [ + 212, + 607, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/6c48d9ca62eea90a5a5884568b7d87f23a6000813b00df3fd29f39388eb0fd17.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 246, + 152, + 330, + 217 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/03dbff1f707b60e2733f3b1cc26c35319053755c7974f95fd38e9caa9825952e.jpg", + "image_caption": [ + "(b)" + ], + "image_footnote": [], + "bbox": [ + 366, + 152, + 488, + 220 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/1b26f132987653767a3a0d4f710f4b063e9041044ca3a49fc20cfc9bcf84c370.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 511, + 152, + 633, + 220 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/8b151787925b3e935a5c76abe8f5ea44adcd9df909790454cecd7a1c5d4f8247.jpg", + "image_caption": [ + "(d)", + "Fig. 4: Confidence intervals for $50\\%$ radial sampling 4a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 4b & 4c: $95\\%$ confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values and the blue circles are the corresponding estimates of the debiased TV estimator. 4b is for a reconstruction with $7\\%$ noise and 4c is for a reconstruction with $10.5\\%$ noise. 4d: Q-Q plot for input samples $\\frac{\\sqrt{2m}\\Re(\\hat{x}^u - x^0)_i}{\\sigma\\cdot\\sqrt{(M\\Sigma M^*)_{ii}}}$ ." + ], + "image_footnote": [], + "bbox": [ + 651, + 152, + 772, + 222 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "ity averaged over all support pixels is $90.64\\%$ , the one averaged over all pixels is $93.82\\%$ . For the radial case, the values are $91.95\\%$ and $94.20\\%$ , respectively.", + "bbox": [ + 212, + 367, + 787, + 398 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "7.2 Qualitative Evaluation", + "text_level": 1, + "bbox": [ + 214, + 419, + 447, + 433 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The general idea of debiasing, is that after the transformation, the reconstruction error can be decomposed as $\\hat{x}^u - x^0 = R + W$ , where $R$ is a small residual term and the dominating term $W$ is Gaussian distributed. In fact, by inspecting Fig. 5, it is possible to visualize this debiasing step. On the one hand, the difference between the biased solution of Eq. (2) (see its magnitude in Fig. 5a for spiral and in Fig. 5e for radial sampling) and the ground truth has a very structured error, i.e. $|\\hat{x} - x^0|$ still displays much of the brain structure, which can be seen in Figs. 5b and 5f. On the other hand, the difference between the unbiased estimator (see its magnitude in Fig. 5c for spiral and Fig. 5g for radial sampling) and the ground truth in Figs. 5d and 5h is much more unstructured, and one can see that it is dominated by random noise. Moreover, as we increase the number of k-space points or we increase the noise, this difference becomes more unstructured. The distribution can be measured in the Q-Q plots in Figs. 2d and 4d, which, indeed, shows the Gaussianity of $\\hat{x}^u - x^0$ .", + "bbox": [ + 212, + 443, + 787, + 652 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "To test our findings, the same experiment as in Sec. 7.1 is conducted 100 times, each time with a different realization of the noise vector $\\varepsilon$ . In the spiral case, we do so for the subsampling rates $43\\%$ and $62\\%$ , and in the radial setting, we choose the masks according to $50\\%$ , $70\\%$ , and $90\\%$ k-space undersampling. For every mask, we select $\\sigma \\in \\{0.1, 0.15\\}$ resulting in relative noise levels $\\frac{\\|\\varepsilon\\|_2}{\\|P\\mathcal{F}x^0\\|_2}$ between 0.06 and 0.125. In these settings the $\\ell_2$ and $\\ell_{\\infty}$ -norm of the errors $\\hat{x} - x^0$ and $\\hat{x}^u - x^0$ , of the bias term $R \\coloneqq (M\\hat{\\Sigma} - I_{N\\times N})(\\hat{x} - x^0)$ and of the Gaussian term $W \\coloneqq \\frac{1}{m} M(P\\mathcal{F})^*\\varepsilon$ are computed and averaged. The resulting quantities, including a more detailed analysis, can be found in Table 1 (spiral) and in Table 2 (radial) in Section 3 in the supplementary material.", + "bbox": [ + 212, + 654, + 787, + 808 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "With these results we numerically verify that $\\| R\\|_{\\infty}$ is small as compared to $\\| W\\|_{\\infty}$ . Since the goal is to have pixel-wise confidence intervals, obtaining", + "bbox": [ + 212, + 809, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/8a8f53d21a0ed50846653ac1f7937b5f80fb619a31c2c92a649ae9ab7bc36e98.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 230, + 150, + 343, + 220 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/1b86d20d0b40fc253e1059edd61b2fb7b404892f4726f9c6aa2a44deb0524bdf.jpg", + "image_caption": [ + "(b)" + ], + "image_footnote": [], + "bbox": [ + 375, + 150, + 488, + 220 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/a40fa0d2f388526cbb2a9af46dbf2c0271800fead35f550e5317db11617145a9.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 517, + 146, + 642, + 220 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/836bf2e23a5d04897e413c596a61c438684e679193a2094c6ecf8ce2b4445e63.jpg", + "image_caption": [ + "(d)" + ], + "image_footnote": [], + "bbox": [ + 661, + 151, + 774, + 220 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/afab2938762ee598d6d8c810b202e5cd242e36f42b3ef826be5c1750fbec9abe.jpg", + "image_caption": [ + "(e)" + ], + "image_footnote": [], + "bbox": [ + 230, + 244, + 343, + 314 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/9ecccc3b86ede66c5ade96dc28e62824cadfd7b3d023436551d61c7bca9f65a7.jpg", + "image_caption": [ + "(f)" + ], + "image_footnote": [], + "bbox": [ + 377, + 244, + 488, + 314 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d1ed20ab286267318954ca6c45b185350a46b90d9d48eac88fc487bebf00ea91.jpg", + "image_caption": [ + "(g)", + "Fig. 5: Reconstruction and debiasing visualization for spiral mask with $43\\%$ subsampling and $6.5\\%$ noise in the first row and for radial mask with $50\\%$ subsampling and $7\\%$ noise in the second row 5a & 5e: TV Reconstruction 5b & 5f: Magnitude of difference between ground truth and TV estimator 5c & 5g: Debiased TV Reconstruction, the small enlargement at the top of the image visualizes the noise in the background 5d & 5h: Magnitude of difference between ground truth and debiased TV estimator." + ], + "image_footnote": [], + "bbox": [ + 517, + 241, + 642, + 314 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/952565af1a29e0f7778ba5a281cff8c3b73b3d6fbc263ca28741b5e58c12ac6b.jpg", + "image_caption": [ + "(h)" + ], + "image_footnote": [], + "bbox": [ + 661, + 244, + 774, + 314 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "estimators for which the residual is small in the $\\ell_{\\infty}$ -norm is crucial. In the conducted experiments, both the biased and the unbiased estimator have $\\ell_{\\infty}$ -errors compared to the ground truth that are of similar order. Despite this, and the fact that the $\\ell_{2}$ -error is even larger in the debiased case, the debiasing significantly reduces the non-quantifiable $\\ell_{\\infty}$ -error $\\| \\hat{x} - x^0 \\|_{\\infty}$ . This is the error for which no statistical information is available in closed form. Indeed, after the reconstruction given by solving Eq. (2) and applying the debiased procedure, the error is given by $\\hat{x}^u - x^0 = R + W$ . Since, due to our method, $R$ is much smaller than $W$ , which is Gaussian distributed, we can use the latter for the UQ.", + "bbox": [ + 212, + 455, + 787, + 593 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The error ratio between the norm of $R$ and of $W$ depends on the quality of the solution of Eq. (2). The more data is available, i.e., the larger $m$ , the better the reconstruction and the better the error ratio, reflected in the confidence interval quality. A similar behavior is observed for the noise level added to the data. The norm of the Gaussian vector $W$ depends linearly on the noise level $\\sigma$ . However, the reconstruction error does not seem to decrease at the same rate. This is related to the matrix difference $M\\hat{\\Sigma} - I_{N\\times N}$ , which is independent of the noise level and hence, does not decrease when the noise decreases. We also test our method on real valued brain, prostate and knee images for multiple patients, the results of those experiments are available in Section 3 of the supplementary material.", + "bbox": [ + 212, + 594, + 787, + 758 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "7.3 Discussion", + "text_level": 1, + "bbox": [ + 215, + 782, + 349, + 796 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "As shown in the experiments above, our method for imaging with confidence is able to provide $95\\%$ confidence intervals with hit rates above $90\\%$ for each pixel.", + "bbox": [ + 214, + 809, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We see such results for variational problems like Eq. (2) as particularly promising for the start of a UQ methodology for learned-based methods in MRI and in other applications where deep learning is employed. In particular, the debiasing procedure generates an estimator $\\hat{x}^u$ that follows approximately a Gaussian distribution with mean $x^0$ . This estimator enables us to quantify uncertainty for the MR magnitude and phase of the signal. The latter constitutes the base input data for subsequent processing steps, such as the estimation of tissue susceptibilities.", + "bbox": [ + 212, + 146, + 787, + 265 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The size of the given confidence intervals is $\\frac{\\hat{\\sigma}}{\\sqrt{m}}$ up to a normalization constant. Intuitively, the more measurements we have, the smaller the range of uncertainty. Also, the dependency on $\\hat{\\sigma}$ comes from the fact that noisy images are more affected by uncertainty. Since, to the best of the authors' knowledge, we are the first to construct honest confidence intervals for gradient-sparse MR images, there is a lack of comparing results. Still, confidence intervals of the same size are known to be sharp, in the worst-case sense, for similar problems [13].", + "bbox": [ + 212, + 268, + 787, + 376 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations. One of the caveats of the imaging with confidence method is the estimation of the matrix $M$ for complicated covariance structures given by other sampling schemes such as Lissajous curves [20, 37]. A more involved analysis is necessary in order to apply schemes that are more computationally efficient than the nodewise LASSO. Another crucial point is that since the size of the confidence interval depends on $\\hat{\\sigma}$ , the method provides meaningless UQ for very noisy regimes, i.e. data with more than $20\\%$ noise. Finally, we acknowledge that the method should be tested in other imaging modalities, such as cardiac MRI, chemical shift imaging, or MR fingerprinting.", + "bbox": [ + 212, + 377, + 787, + 513 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "8 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 542, + 359, + 559 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we propose a theory-inspired method for the construction of confidence intervals for fast undersampled MRI. We verify experimentally with in vivo MR data that the resulting confidence intervals are valid, i.e. that they contain the true pixel parameter with high probability. A significant advantage of the proposed method is that its application has very modest computational requirements since it is performed without acquiring further data, no Monte Carlo integration is necessary, and it does not require a prior distribution for the underlying image class. Therefore, our method contributes to a higher level of trustworthiness in medical imaging without increasing the scan time. We see a number of promising directions for follow-up research. Firstly, we intend to explore generalizations of our approach to quantitative MRI [56].", + "bbox": [ + 212, + 580, + 787, + 747 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Secondly, we intend to extend the method to neural network approaches to MRI, in particular, to variational networks [25] and to vision transformers [38,44]. We feel that powerful methods for UQ are of particular importance here due to the black-box nature of these approaches; they are a key missing building block to make these often much superior methods [51, 64] widely available in clinical applications.", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgments", + "text_level": 1, + "bbox": [ + 217, + 143, + 392, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We gratefully acknowledge financial support with funds provided by the German Federal Ministry of Education and Research in the grant \"SparseMRI3D+: Compressive Sensing und Quantifizierung von Unsicherheiten für die beschleunigte multiparametrische quantitative Magnetresonanztomografie (FZK 05M20WOA)\" and funding by the European Union's Horizon 2020 Research and Innovation Programme under Grant Agreement No. 952172.", + "bbox": [ + 212, + 175, + 787, + 267 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 287, + 321, + 303 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. ECCV 2022 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2022.github.io/papers/, accessed: 2024-02-26", + "2. FDA 510(k) Premarket Notification for HyperSense. https://www.accessdata.fda.gov/scripts/cdrh/CFdocs/CFpmn/pmnn.cfm?ID=K162722, accessed: 2024-02-26", + "3. FDA 510(k) Premarket Notification for MAGNETOM Aera and MAGNETOM Skyra. https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/pmn.cfm?ID=K163312, accessed: 2024-02-26", + "4. HyperSense: Compressed sensing and other advanced acceleration techniques. https://www.gehealthcare.com/ - /jssmedia/files/us/non-gated/mri/hypersense-booklet.pdf?rev=-1&hash=FAE260A3F4CA0A82E236DEDA5CAD39A6, accessed: 2024-02-26", + "5. ICCV 2023 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2023.github.io/papers/, accessed: 2024-02-26", + "6. ICML 2021 Workshop: Workshop on Distribution-Free Uncertainty Quantification. https://icml.cc/virtual/2021/workshop/8373, accessed: 2024-02-26", + "7. Adcock, B., Hansen, A.C.: Compressive imaging: structure, sampling, learning. Cambridge University Press (2021). https://doi.org/10.1017/9781108377447", + "8. Aja-Fernández, S., Vegas-Sánchez-Ferrero, G.: Statistical Analysis of Noise in MRI: Modeling, Filtering and Estimation. Springer, Cham (2016). https://doi.org/10. 1007/978-3-319-39934-8", + "9. Angelopoulos, A.N., Bates, S.: A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511 (2021). https://doi.org/10.48550/arXiv.2107.07511", + "0. Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM journal on imaging sciences 2(1), 183-202 (2009). https://doi.org/10.1137/080716542", + "1. Bellec, P.C., Zhang, C.H.: Debiasing convex regularized estimators and interval estimation in linear models. The Annals of Statistics 51(2), 391 - 436 (2023). https://doi.org/10.1214/22-A0S2243, 10.1214/22-A0S2243", + "2. Block, K.T., Uecker, M., Frahm, J.: Undersampled radial MRI with multiple coils. Iterative image reconstruction using a total variation constraint. Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine 57(6), 1086-1098 (2007). https://doi.org/10.1002/mrm.21236", + "3. Cai, T.T., Guo, Z.: Confidence intervals for high-dimensional linear regression: Minimax rates and adaptivity. The Annals of Statistics 45(2), 615 - 646 (2017). https://doi.org/10.1214/16-A0S1461" + ], + "bbox": [ + 225, + 316, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Chambolle, A., Caseles, V., Cremers, D., Novaga, M., Pock, T., et al.: An introduction to total variation for image analysis. Theoretical foundations and numerical methods for sparse recovery 9(263-340), 227 (2010). https://doi.org/10.1515/9783110226157.263", + "15. Condat, L.: Discrete total variation: New definition and minimization. SIAM Journal on Imaging Sciences 10(3), 1258-1290 (2017). https://doi.org/10.1137/16M1075247", + "16. Cruz, G., Atkinson, D., Buerger, C., Schaeffter, T., Prieto, C.: Accelerated motion corrected three-dimensional abdominal MRI using total variation regularized SENSE reconstruction. Magnetic resonance in medicine 75(4), 1484-1498 (2016). https://doi.org/10.1002/mrm.25708", + "17. Cukur, T., Lustig, M., Nishimura, D.G.: Improving non-contrast-enhanced steady-state free precession angiography with compressed sensing. Magnetic Resonance in Medicine 61(5), 1122-1131 (2009). https://doi.org/10.1002/mrm.21907", + "18. Donoho, D.: Blackboard to bedside: How high-dimensional geometry is transforming the MRI industry. Notices of the American Mathematical Society 65(1) (2018). https://doi.org/10.1090/notti1612", + "19. Endt, S., Engel, M., Naldi, E., Assereto, R., Molendowska, M., Mueller, L., Mayrink Verdun, C., Pirkl, C.M., Palombo, M., Jones, D.K., Menzel, M.I.: In Vivo Myelin Water Quantification Using Diffusion-Relaxation Correlation MRI: A Comparison of 1D and 2D Methods. Applied Magnetic Resonance 54(11), 1571-1588 (2023). https://doi.org/10.1007/s00723-023-01584-1", + "20. Feng, H., Gu, H., Silbersweig, D., Stern, E., Yang, Y.: Single-shot MR imaging using trapezoidal-gradient-based Lissajous trajectories. IEEE transactions on medical imaging 22(8), 925-932 (2003). https://doi.org/10.1109/TMI.2003.815902", + "21. Fischer, P., Thomas, K., Baumgartner, C.F.: Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction. In: International Workshop on Uncertainty for Safe Utilization of Machine Learning in Medical Imaging. pp. 84-94. Springer (2023). https://doi.org/10.1007/978-3-031-44336-7_9", + "22. Fu, W., Knight, K.: Asymptotics for lasso-type estimators. The Annals of statistics 28(5), 1356-1378 (2000). https://doi.org/DOI:10.1214/aos/1015957397", + "23. Giraud, C.: Introduction to high-dimensional statistics. Chapman and Hall/CRC (2021)", + "24. Goldstein, T., Osher, S.: The split Bregman method for L1-regularized problems. SIAM journal on imaging sciences 2(2), 323-343 (2009). https://doi.org/10.1137/080725891", + "25. Hammernik, K., Klatzer, T., Kobler, E., Recht, M.P., Sodickson, D.K., Pock, T., Knoll, F.: Learning a variational network for reconstruction of accelerated MRI data. Magnetic resonance in medicine 79(6), 3055-3071 (2018). https://doi.org/10.1002/mrm.26977", + "26. Han, Y., Lee, T.C.: Uncertainty Quantification for Sparse Estimation of Spectral Lines. IEEE Transactions on Signal Processing 70, 6243-6256 (2022). https://doi.org/10.1109/TSP.2023.3235662", + "27. Hannig, J., Iyer, H., Lai, R.C., Lee, T.C.: Generalized fiducial inference: A review and new results. Journal of the American Statistical Association 111(515), 1346-1361 (2016). https://doi.org/10.1080/01621459.2016.1165102", + "28. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: Uncertainty quantification for sparse Fourier recovery. arXiv:2212.14864 (2022). https://doi.org/10.48550/arXiv.2212.14864" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "29. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: High-Dimensional Confidence Regions in Sparse MRI. In: ICASSP 2023. pp. 1-5 (2023). https://doi.org/10.1109/ICASSP49357.2023.10096320", + "30. Hoppe, F., Mayrink Verdun, C., Laus, H., Krahmer, F., Rauhut, H.: Non-Asymptotic Uncertainty Quantification in High-Dimensional Learning. arXiv preprint (2024)", + "31. Hüllermeier, E., Waegeman, W.: Aleatoric and epistemic uncertainty in machine learning: An introduction to concepts and methods. Machine Learning 110, 457-506 (2021). https://doi.org/10.1007/s10994-021-05946-3", + "32. Hütter, J.C., Rigollet, P.: Optimal rates for total variation denoising. In: Conference on Learning Theory. pp. 1115-1146. PMLR (2016)", + "33. Hyun, C.M., Kim, H.P., Lee, S.M., Lee, S., Seo, J.K.: Deep learning for undersampled MRI reconstruction. Physics in Medicine & Biology 63(13), 135007 (2018). https://doi.org/10.1088/1361-6560/aac71a9", + "34. Jaspan, O., Fleysher, R., Lipton, M.: Compressed Sensing MRI: A review of the clinical literature. The British journal of radiology 88, 20150487 (09 2015). https://doi.org/10.1259/bjr.20150487", + "35. Javanmard, A., Montanari, A.: Confidence intervals and hypothesis testing for high-dimensional regression. Journal of Machine Learning Research 15, 2869-2909 (2014)", + "36. Javanmard, A., Montanari, A.: Debiasing the lasso: Optimal sample size for Gaussian designs. The Annals of Statistics 46(6A) (2018). https://doi.org/10.1214/17-A0S1630", + "37. Kaethner, C., Erb, W., Ahlborg, M., Szwargulski, P., Knopp, T., Buzug, T.M.: Non-equispaced system matrix acquisition for magnetic particle imaging based on Lissajous node points. IEEE transactions on medical imaging 35(11), 2476-2485 (2016). https://doi.org/10.1109/TMI.2016.2580458", + "38. Korkmaz, Y., Yurt, M., Dar, S.U.H., Özbey, M., Cukur, T.: Deep MRI reconstruction with generative vision transformers. In: Machine Learning for Medical Image Reconstruction: 4th International Workshop, MLMIR 2021, Held in Conjunction with MICCAI 2021, Strasbourg, France, October 1, 2021, Proceedings 4. pp. 54-64. Springer (2021). https://doi.org/10.1007/978-3-030-88552-6_6", + "39. Krahmer, F., Ward, R.: Stable and robust sampling strategies for compressive imaging. IEEE transactions on image processing 23(2), 612-622 (2013). https://doi.org/10.1109/TIP.2013.2288004", + "40. Krahmer, F., Kruschel, C., Sandbichler, M.: Total variation minimization in compressed sensing. In: Compressed Sensing and its Applications: Second International MATHEON Conference 2015. pp. 333-358. Springer (2017). https://doi.org/10.1109/CSE-EUC-DCABES.2016.233", + "41. Lai, R.C., Hannig, J., Lee, T.C.: Generalized fiducial inference for ultrahigh-dimensional regression. Journal of the American Statistical Association 110(510), 760-772 (2015). https://doi.org/10.1080/01621459.2014.931237", + "42. Liang, Z.P., Lauterbur, P.C.: Principles of magnetic resonance imaging. SPIE Optical Engineering Press Bellingham, WA (2000)", + "43. Lin, A., Song, A.H., Bilgic, B., Ba, D.: Covariance-free sparse Bayesian learning. IEEE Transactions on Signal Processing 70, 3818-3831 (2022). https://doi.org/10.1109/TSP.2022.3186185", + "44. Lin, K., Heckel, R.: Vision transformers enable fast and robust accelerated MRI. In: International Conference on Medical Imaging with Deep Learning. pp. 774-795. PMLR (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "45. Lustig, M., Donoho, D., Pauly, J.M.: Sparse MRI: The application of compressed sensing for rapid MR imaging. Magnetic Resonance in Medicine 58(6), 1182-1195 (2007). https://doi.org/10.1002/mrm.21391", + "46. Mueller, L., Rudrapatna, S.U., Tax, C.M., Wise, R., Jones, D.K.: Diffusion MRI with $b = 1000s / \\mathrm{mm}2$ at $\\mathrm{TE} < 22\\mathrm{ms}$ using single-shot spiral readout and ultra-strong gradients: Implications for microstructure imaging. Proceedings of the International Society for Magnetic Resonance in Medicine, 2019. Presented at the ISMRM (2019)", + "47. Nassirpour, S., Chang, P., Avdievitch, N., Henning, A.: Compressed sensing for high-resolution nonlipid suppressed 1H FID MRSI of the human brain at 9.4 T. Magnetic resonance in medicine 80(6), 2311-2325 (2018). https://doi.org/10.1002/mrm.27225", + "48. Needell, D., Ward, R.: Stable image reconstruction using total variation minimization. SIAM Journal on Imaging Sciences 6(2), 1035-1058 (2013). https://doi.org/10.1137/120868281", + "49. Poon, C.: On the role of total variation in compressed sensing. SIAM Journal on Imaging Sciences 8(1), 682-720 (2015). https://doi.org/10.1137/140978569, https://doi.org/10.1137/140978569", + "50. Pruessmann, K.P., Weiger, M., Börnert, P., Boesiger, P.: Advances in sensitivity encoding with arbitrary k-space trajectories. Magnetic Resonance in Medicine 46(4), 638-651 (2001). https://doi.org/10.1002/mrm.1241", + "51. Rastogi, A., Brugnara, G., Foltyn-Dumitru, M., Mahmutoglu, M.A., Preetha, C.J., Kobler, E., Pflüger, I., Schell, M., Deike-Hofmann, K., Kessler, T., et al.: Deep-learning-based reconstruction of undersampled MRI to reduce scan times: a multicentre, retrospective, cohort study. The Lancet Oncology 25(3), 400-410 (2024). https://doi.org/10.1016/S1470-2045(23)00641-1", + "52. Roth, S., Black, M.: Fields of Experts: a framework for learning image priors. In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05). vol. 2, pp. 860-867 vol. 2 (2005). https://doi.org/10.1109/CVPR.2005.160", + "53. Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena 60(1-4), 259-268 (1992). https://doi.org/10.1016/0167-2789(92)90242-F", + "54. Saucedo, A., Macey, P.M., Thomas, M.A.: Accelerated radial echo-planar spectroscopic imaging using golden angle view-ordering and compressed-sensing reconstruction with total variation regularization. Magnetic Resonance in Medicine 86(1), 46-61 (2021). https://doi.org/10.1002/mrm.28728", + "55. Schweser, F., Deistung, A., Reichenbach, J.R.: Foundations of MRI phase imaging and processing for Quantitative Susceptibility Mapping (QSM). Zeitschrift für medizinische Physik 26(1), 6-34 (2016). https://doi.org/10.1016/j.zemedi.2015.10.002", + "56. Shafieizargar, B., Byanju, R., Sijbers, J., Klein, S., den Dekker, A.J., Poot, D.H.: Systematic review of reconstruction techniques for accelerated quantitative MRI. Magnetic Resonance in Medicine (2023). https://doi.org/10.1002/mrm.29721", + "57. Tezcan, K.C., Karani, N., Baumgartner, C.F., Konukoglu, E.: Sampling possible reconstructions of undersampled acquisitions in MR imaging with a deep learned prior. IEEE Transactions on Medical Imaging 41(7), 1885-1896 (2022). https://doi.org/10.1109/TMI.2022.3150853", + "58. Tibshirani, R.: Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 58(1), 267-288 (1996). https://doi.org/10.1111/j.2517-6161.1996.tb02080.x" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "F. Hoppe et al.", + "bbox": [ + 271, + 114, + 374, + 128 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "59. Valdenegro-Toro, M.: I find your lack of uncertainty in computer vision disturbing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1263-1272 (2021). https://doi.org/10.1109/CVPRW53098.2021.00139", + "60. van de Geer, S., Buhlmann, P., Ritov, Y., Dezeure, R.: On asymptotically optimal confidence regions and tests for high-dimensional models. The Annals of Statistics 42(3) (2014). https://doi.org/10.1214/14-A0S1221", + "61. Wilm, B.J., Barnet, C., Gross, S., Kasper, L., Vannesjo, S.J., Haeberlin, M., Dietrich, B.E., Brunner, D.O., Schmid, T., Pruessmann, K.P.: Single-shot spiral imaging enabled by an expanded encoding model: Demonstration in diffusion MRI. Magnetic resonance in medicine 77(1), 83-91 (2017). https://doi.org/10.1002/mrm.26493", + "62. Wilm, B.J., Barmet, C., Pavan, M., Pruessmann, K.P.: Higher order reconstruction for MRI in the presence of spatiotemporal field perturbations. Magnetic resonance in medicine 65(6), 1690-1701 (2011). https://doi.org/10.1002/mrm.22767", + "63. Winkelmann, S., Schaeffer, T., Koehler, T., Eggers, H., Doessel, O.: An optimal radial profile order based on the Golden Ratio for time-resolved MRI. IEEE transactions on medical imaging 26(1), 68-76 (2006). https://doi.org/10.1109/TMI.2006.885337", + "64. Zeng, G., Guo, Y., Zhan, J., Wang, Z., Lai, Z., Du, X., Qu, X., Guo, D.: A review on deep learning MRI reconstruction without fully sampled k-space. BMC Medical Imaging 21(1), 195 (2021). https://doi.org/10.1186/s12880-021-00727-9", + "65. Zhang, C.H., Zhang, S.S.: Confidence intervals for low dimensional parameters in high dimensional linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 76(1), 217-242 (2014). https://doi.org/10.1111/rssb.12026" + ], + "bbox": [ + 212, + 146, + 787, + 506 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Imaging with Confidence", + "bbox": [ + 563, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_model.json b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_model.json new file mode 100644 index 0000000000000000000000000000000000000000..f9095215541be3fbdde51948c74b8f1dc7c6bfb8 --- /dev/null +++ b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_model.json @@ -0,0 +1,2889 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.284, + 0.141, + 0.72, + 0.21 + ], + "angle": 0, + "content": "Imaging with Confidence: Uncertainty Quantification for High-dimensional Undersampled MR Images" + }, + { + "type": "text", + "bbox": [ + 0.237, + 0.235, + 0.766, + 0.267 + ], + "angle": 0, + "content": "Frederik Hoppe1*, Claudio Mayrink Verdun2*, Hannah Laus3*, Sebastian Endt4, Marion I. Menzel4, Felix Krahmer3, and Holger Rauhut5" + }, + { + "type": "text", + "bbox": [ + 0.269, + 0.277, + 0.733, + 0.292 + ], + "angle": 0, + "content": "\\(^{1}\\) RWTH Aachen University, Germany hoppe@mathc.rwth-aachen.de" + }, + { + "type": "text", + "bbox": [ + 0.291, + 0.292, + 0.714, + 0.305 + ], + "angle": 0, + "content": "\\(^{2}\\) Harvard University, USA claudioverdun@seas.harvard.edu" + }, + { + "type": "text", + "bbox": [ + 0.252, + 0.305, + 0.751, + 0.319 + ], + "angle": 0, + "content": "3 TU Munich & MCML, Germany {hannah.laus,felix.krahmer}@tum.de" + }, + { + "type": "text", + "bbox": [ + 0.306, + 0.319, + 0.697, + 0.347 + ], + "angle": 0, + "content": "4 TH Ingolstadt, TU Munich & GE HealthCare, Germany {sebastian.endt,Marion.Menzel}@thi.de" + }, + { + "type": "text", + "bbox": [ + 0.306, + 0.347, + 0.696, + 0.361 + ], + "angle": 0, + "content": "5 LMU Munich & MCML, Germany rauhut@math.lmu.de" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.401, + 0.747, + 0.624 + ], + "angle": 0, + "content": "Abstract. Establishing certified uncertainty quantification (UQ) in imaging processing applications continues to pose a significant challenge. In particular, such a goal is crucial for accurate and reliable medical imaging if one aims for precise diagnostics and appropriate intervention. In the case of magnetic resonance imaging, one of the essential tools of modern medicine, enormous advancements in fast image acquisition were possible after the introduction of compressive sensing and, more recently, deep learning methods. Still, as of now, there is no UQ method that is both fully rigorous and scalable. This work takes a step towards closing this gap by proposing a total variation minimization-based method for pixel-wise sharp confidence intervals for undersampled MRI. We demonstrate that our method empirically achieves the predicted confidence levels. We expect that our approach will also have implications for other imaging modalities as well as deep learning applications in computer vision. Our code is available on GitHub https://github.com/HannahLaus/Project_UQ_TV.git." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.637, + 0.741, + 0.665 + ], + "angle": 0, + "content": "Keywords: Uncertainty Quantification \\(\\cdot\\) Imaging Processing \\(\\cdot\\) Magnetic Resonance Imaging" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.692, + 0.376, + 0.708 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.725, + 0.788, + 0.816 + ], + "angle": 0, + "content": "In recent years, the field of magnetic resonance imaging, like many other imaging modalities, has undergone a significant paradigm shift towards a unified design of the acquisition-reconstruction pipeline. That is, the data to be acquired is selected based on the computational methods used for reconstruction. A prominent example of this interplay is compressive imaging, where sampling trajectories chosen to be suitable for imaging reconstruction via sparse recovery schemes" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.551, + 0.84 + ], + "angle": 0, + "content": "* These authors contributed equally to this work." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.344 + ], + "angle": 0, + "content": "allowed for significant undersampling [45]. Later, the same type of subsampling techniques have also proven successful in the context of deep learning reconstructions [33]. Thanks to these approaches, the retrieval of fast, undersampled MRI in clinical settings is now a reality. Indeed, in 2017, the FDA approved the first scanners employing acceleration techniques with compressive sensing [2, 3], and since then, several products and algorithms for retrieving highly undersampled images have emerged. In these advancements, mathematical theory has played a driving role, so this development has sometimes been described as from blackboard to bedside [18]. The main objective driving the design of the reconstruction algorithms is to use nonlinear optimization to find solutions adhering to structural constraints describing real images. These constraints could explicitly arise from a unified model, such as wavelet or gradient sparsity, or be implicitly learned from training data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.353, + 0.788, + 0.49 + ], + "angle": 0, + "content": "When the measurements are affected by noise, these methods search for solutions adhering to these constraints within the feasibility regions. That is, the imaging recovery method will search in the space of possible solutions and look for reconstructions that resemble natural images, which also makes potential reconstruction artifacts harder to identify. Especially unexpected localized features could correspond to real pathological abnormalities or arise in the interplay of noise and recovery methods. For this reason, quantifying the uncertainty via certified confidence intervals is of increasing importance not only for MRI but for a variety of problems in imaging and computer vision [59]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.499, + 0.788, + 0.651 + ], + "angle": 0, + "content": "At the same time, classical approaches for assessing the confidence of the solution that could allow to distinguish these two causes, abnormalities and artifacts, are not applicable. The reason is that they typically require some knowledge of the distribution of the random distortion and, consequently, of the generated image. While the measurement error is well modeled by Gaussian noise, the distribution of the resulting distortion in the reconstruction cannot be modeled as easily due to the nonlinearity of the procedure, see, e.g., [22, Theorem 2] and the discussion therein. This poses a significant issue when the reconstructed image is directly employed for downstream tasks, such as automating the extraction of quantitative parameters for clinical analysis." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Imaging with confidence, a novel rigorous method tailored to UQ: It is only recently that the first attempts to derive non-asymptotic confidence intervals for the pixel values of the reconstruction, without imposing prior knowledge have been successful (see Section 2 for a discussion). So far, most works have focused on sparsity models with respect to some known basis, as they are natural, for example, in angiography and reconstruction via variants of the LASSO [7]. In this work, we leverage these approaches to address the uncertainty quantification problem for recovery via total variation minimization, a standard recovery scheme for MR images in current industrial implementations [4] that has also conceptually inspired various machine learning-based approaches reaching state-of-the-art results such as variational networks [25]. To the best of our knowledge, for the first time, we provide rigorous confidence intervals for un-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "dersampled acquired MR images and test the results with synthetic and in vivo data." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.202, + 0.389, + 0.218 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.236, + 0.788, + 0.537 + ], + "angle": 0, + "content": "There were other attempts available in the literature to tackle the aleatoric uncertainty quantification of high-dimensional parsimonious problems, such as in undersampled imaging generation. For example, a series of works developed the so-called generalized fiducial inference [26, 27, 41]. Such a method creates a relationship between the data and the parameters for which the UQ can be rigorously performed and establishes confidence intervals from such a relationship. However, high-dimensional Monte Carlo makes this method intractable in the high-dimensional imaging regime. Bayesian sparse learning techniques were also developed for undersampled imaging problems [43]. An inherent challenge with the Bayesian approach arises when inappropriate prior distributions, which fail to accurately reflect the prior physical knowledge of the problem, are employed. In such cases, the performance and reliability of the approach may deteriorate. Another line of research on UQ is conformal prediction, which generates distribution-free prediction sets for regression and classification problems [9]. However, choosing the score function in imaging problems can be challenging. Such a technique is more directly applied to epistemic uncertainty rather than to the aleatoric one [31]. Our work builds on the urgency of providing rigorous UQ to imaging problems in computer vision and image processing. Such necessity can be seen in the several workshops for UQ in computer vision and imaging that took place over the last few years dedicated to this theme [1, 5, 6]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.789, + 0.844 + ], + "angle": 0, + "content": "Our uncertainty quantification extends a line of research about non-asymptotic confidence intervals for high-dimensional problems known as debiased estimators, which was initiated in a series of papers [11,35,60,65]. The key idea is that given an estimator to retrieve noisy image retrieval from a few measurements; one can characterize the distribution of a modified estimator based on the KKT conditions of the underlying inverse problem; see Section 3.2. Such works established sharp confidence intervals for i.i.d. (sub-)Gaussian variables with Gaussian noise by assuming that the object to be retrieved is s-sparse in the canonical basis. However, such variables do not represent typical constraints imposed by the physics behind the acquisition procedure. Later, this was extended to imaging applications, where UQ was rigorously obtained for \\(\\ell_1\\) model-based MRI [28,29]. In this paper, we harness results for UQ obtained in previous works to more realistic scenarios where the images are reconstructed via the minimization of the total variation semi-norm, an idea introduced in the seminal paper [53]. This imaging retrieval technique was extensively explored in tasks such as inpainting, denoising, and deblurring; see [14, 32] and references therein. This method has been rigorously proven to yield state-of-the-art results in MRI reconstruction - see [40] and [7, Chapter 17] - and was consistently tested in several applications such as parallel imaging [12], free-breathing three-dimensional cardiac MRI [16], non-contrast-enhanced angiography [17], spectroscopy [54] and metabolite maps" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "of the human brain [47], to name a few. Recently, in the context of learning algorithms, the work [57] proposed a latent Bayesian model with a variational autoencoder to obtain posterior distributions for the generated images and the work [21] proposed hierarchical conditional variational autoencoders for UQ, but no theory is available for such methods. Finally, [30] developed a non-asymptotic theory for constructing confidence intervals for high-dimensional learning problems." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.277, + 0.627, + 0.295 + ], + "angle": 0, + "content": "3 Background: Sparse Imaging Retrieval" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.309, + 0.787, + 0.371 + ], + "angle": 0, + "content": "In this section, we summarize the tools we need to construct confidence intervals for images. Throughout the paper, we consider the following high-dimensional linear model that is a discretized version of the Bloch equations, which models the MR acquisition process [42]" + }, + { + "type": "equation", + "bbox": [ + 0.385, + 0.382, + 0.786, + 0.399 + ], + "angle": 0, + "content": "\\[\nb = \\mathcal {P F} x ^ {0} + \\varepsilon \\quad \\text {w i t h} N \\gg m. \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.41, + 0.788, + 0.471 + ], + "angle": 0, + "content": "Here, \\( b \\in \\mathbb{C}^m \\) is the k-space data, \\( \\mathcal{P}\\mathcal{F} \\in \\mathbb{C}^{m \\times N} \\) is a subsampled Fourier matrix, \\( x^0 \\in \\mathbb{C}^N \\) is the underlying ground truth image, and \\( \\varepsilon \\sim \\mathcal{CN}(0, \\sigma^2 I_{N \\times N}) \\) is complex Gaussian noise. The goal in fast undersampled MRI is to retrieve \\( x^0 \\) having \\( m < N \\) k-space measurements \\( b \\) when \\( \\mathcal{P}\\mathcal{F} \\) and \\( \\sigma \\) are known." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.494, + 0.389, + 0.508 + ], + "angle": 0, + "content": "3.1 Total Variation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.52, + 0.788, + 0.639 + ], + "angle": 0, + "content": "As described in Sec. 2, several image modalities can be modeled by gradient-sparse images. Also, such guiding principle is behind modern deep learning architectures that learn higher-order statistics of images, e.g., those based on the fields of experts framework [52]. Therefore, we extend the results to the total-variation setting to create rigorous UQ schemes for MRI. More precisely, for a given image \\( x^0 \\in \\mathbb{C}^N \\), we consider the finite gradient operator \\( D \\) that gives \\( Dx^0 = (x_2^* - x_1^*, \\ldots, x_N^* - x_{N-1}^*)^T \\in \\mathbb{C}^{N-1} \\) and we solve the total variation problem, i.e.," + }, + { + "type": "equation", + "bbox": [ + 0.376, + 0.64, + 0.787, + 0.665 + ], + "angle": 0, + "content": "\\[\n\\operatorname {a r g m i n} _ {x \\in \\mathbb {C} ^ {N}} \\frac {\\mu}{2} \\| b - \\mathcal {P F} x \\| _ {2} ^ {2} + \\| x \\| _ {T V} \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.67, + 0.788, + 0.747 + ], + "angle": 0, + "content": "with a regularization parameter \\(\\mu > 0\\) for balancing the data fidelity term \\(\\|b - \\mathcal{P}\\mathcal{F}x\\|_2^2\\) and the regularization term \\(\\|x\\|_{TV} \\coloneqq \\|Dx\\|_1\\), which is referred to as the anisotropic formulation [7]. We use such a formulation due to the resemblance with the LASSO estimator. Still, the same techniques described here hold for other discretizations of the total variation, such as the isotropic one, e.g., see [15]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.769, + 0.6, + 0.785 + ], + "angle": 0, + "content": "3.2 Debiased Estimators for Image Retrieval" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "If the underlying image to be retrieved from a few samples is sparse in the canonical basis, several methods in the sparse learning literature can be used, with the LASSO being arguably the most famous one [58]. However, given a certain" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.289 + ], + "angle": 0, + "content": "noise level \\(\\sigma\\), it is provably impossible to have a practical characterization of the LASSO distribution since it depends on the support of the ground truth, which is not known in advance [22]. Moreover, a bias is introduced by the shrinkage procedure of the \\(\\ell_1\\)-norm [23, Chapter 4]. Several works in the statistical literature developed strategies to debiase such estimators, e.g., [35,36,60,65]. Roughly speaking, such works introduce a correction term to the LASSO estimator \\(\\hat{x}\\) that aims to retrieve \\(x^0\\) from \\(b = Ax^0 + \\varepsilon\\). It is given by \\(\\hat{x}^u = \\hat{x} + \\frac{1}{m} MA^*(b - A\\hat{x})\\), where, for a given sample covariance matrix \\(\\hat{\\Sigma} = \\frac{A^*A}{m}\\), \\(M\\) should be chosen (as discussed in Sec. 4), such that \\(M\\hat{\\Sigma} \\approx I_{N \\times N}\\). From that, the decomposition" + }, + { + "type": "equation", + "bbox": [ + 0.299, + 0.294, + 0.786, + 0.325 + ], + "angle": 0, + "content": "\\[\n\\sqrt {m} \\left(\\hat {x} ^ {u} - x ^ {0}\\right) = \\frac {1}{\\sqrt {m}} M A ^ {*} \\varepsilon - \\sqrt {m} \\left(M \\hat {\\Sigma} - I _ {N \\times N}\\right) \\left(\\hat {x} - x ^ {0}\\right), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.331, + 0.789, + 0.621 + ], + "angle": 0, + "content": "where \\(\\frac{1}{\\sqrt{m}} MA^{*}\\varepsilon \\sim \\mathcal{N}(0,\\sigma^{2}M\\hat{\\Sigma} M^{*})\\), follows. The work [36] showed that in the not realistic case of a measurement process \\(A\\) being described by a real Gaussian matrix with known covariance matrix \\(\\Sigma\\), the remainder term \\(\\sqrt{m}(M\\hat{\\Sigma} - I_{N\\times N})(\\hat{x} - x^0)\\) vanishes with probability converging to 1 as \\(m = m(N) \\to \\infty\\) provided \\(m \\geq Cs\\sqrt{\\log N}\\) for a constant \\(C > 0\\). This means that, given a certain noise level, the difference between this new estimator and the underlying image, \\(\\hat{x}^u - x^0\\), is approximately a Gaussian variable. Such distance can be quantified in a non-asymptotic way, which means that non-asymptotic sharp confidence intervals can be derived for such an estimator. In the case of realistic measurement operators given by a subsampled Fourier matrix, the works [28, 29] proved that the remainder term in \\(\\ell_1\\)-regularization also vanishes under slightly stronger assumptions in the number of acquired k-space points as compared to the case of Gaussian measurements. From that, confidence intervals for sparse MR images can be constructed but only in the context of \\(\\ell_1\\)-regularized recovery. In particular, these results do not cover variational approaches such as the total variation minimization problem Eq. (2), which continues to be the method of choice for many applications due to its simplicity and good numerical performance and which also plays a foundational role for many machine learning approaches to MRI recovery in realistic settings, as discussed in Section 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.621, + 0.788, + 0.727 + ], + "angle": 0, + "content": "In this paper, we step towards closing this gap by leveraging previous debiasing approaches to quantify the uncertainty for MR images recovered from undersampled data via the variational problem Eq. (2). We introduce the estimator in Sec. 4 and establish non-asymptotic confidence intervals for every pixel of the image to be retrieved in Sec. 5. In Sec. 6, we discuss the role of noise estimation in MRI, and, finally, in Sec. 7, we numerically illustrate our findings on in vivo brain data." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.745, + 0.599, + 0.763 + ], + "angle": 0, + "content": "4 Debiased Total Variation Estimator" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.772, + 0.788, + 0.804 + ], + "angle": 0, + "content": "Since most MR images are not sparse in the pixel domain, the standard debiased LASSO is limited in practice. Thus, inspired by [28, 29], we propose to use a" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.809, + 0.787, + 0.843 + ], + "angle": 0, + "content": "6 The notation \\( m(N) \\) considers a sequence of regression problems, where both dimensions \\( m \\) and \\( N \\) are growing with the rate \\( \\frac{s\\sqrt{\\log N}}{m} \\to 0 \\)." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "code_caption", + "bbox": [ + 0.218, + 0.147, + 0.59, + 0.162 + ], + "angle": 0, + "content": "Algorithm 1 Construction of correction matrix \\(M\\)" + }, + { + "type": "algorithm", + "bbox": [ + 0.223, + 0.165, + 0.775, + 0.277 + ], + "angle": 0, + "content": "1: Input: Sampling mask \\(P\\), regularization parameters \\(\\lambda_1 \\dots \\lambda_N\\) \n2: For \\(i \\in [N]\\) solve \\(\\hat{x}^i \\gets \\min_{x \\in \\mathbb{C}^{N-1}} \\frac{1}{2m} \\left\\| (\\mathcal{P}\\mathcal{F})_i - (\\mathcal{P}\\mathcal{F})_{-i} x \\right\\|_2^2 + \\lambda_i \\| x \\|_1\\) \n3: Set \\(\\hat{T}^2 = \\mathrm{diag}\\left(\\overline{\\hat{r}_1^2}, \\ldots, \\overline{\\hat{r}_N^2}\\right)\\) with \\(\\hat{r}_i^2 = \\frac{1}{m} \\left((\\mathcal{P}\\mathcal{F})_i - (\\mathcal{P}\\mathcal{F})_{-i} \\hat{x}^i\\right)^*\\left(\\mathcal{P}\\mathcal{F}\\right)_i\\) \n4: For \\(i \\in [N]\\) let \\(\\hat{c}^i \\in \\mathbb{C}^N\\), set \\(\\hat{c}_j^i = -\\hat{x}_j^i\\) for \\(j < i\\), \\(\\hat{c}_j^i = -\\hat{x}_{j-1}^i\\) for \\(j > i\\) and \\(\\hat{c}_i^i = 1\\). \n5: Set \\(\\hat{C} = (\\hat{c}^1, \\dots, \\hat{c}^N)^T \\in \\mathbb{C}^{N \\times N}\\) \n6: Compute \\(M = \\hat{T}^{-2}\\hat{C}\\) \n7: Output: Correction matrix \\(M\\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.306, + 0.785, + 0.339 + ], + "angle": 0, + "content": "debiased TV estimator of the form \\(\\hat{x}^u = \\hat{x} +\\frac{1}{m} M(P\\mathcal{F})^* (b - P\\mathcal{F}\\hat{x})\\) , where \\(\\hat{x}\\) denotes the solution of Eq. (2). The decomposition" + }, + { + "type": "equation", + "bbox": [ + 0.281, + 0.346, + 0.786, + 0.379 + ], + "angle": 0, + "content": "\\[\n\\sqrt {m} \\left(\\hat {x} ^ {u} - x ^ {0}\\right) = \\frac {1}{\\sqrt {m}} M (P \\mathcal {F}) ^ {*} \\varepsilon - \\sqrt {m} \\left(M \\hat {\\Sigma} - I _ {N \\times N}\\right) (\\hat {x} - x ^ {0}). \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.39, + 0.788, + 0.51 + ], + "angle": 0, + "content": "consists of a remainder term \\( R \\coloneqq \\sqrt{m} (M\\hat{\\Sigma} - I_{N\\times N})(x^0 - \\hat{x}) \\) and of \\( W \\coloneqq \\frac{1}{\\sqrt{m}} M(P\\mathcal{F})^{*}\\varepsilon \\) which is complex Gaussian distributed with zero mean and covariance matrix \\( \\frac{\\sigma^2}{m} M(P\\mathcal{F})^{*}(M(P\\mathcal{F})^{*})^{*} = \\sigma^2 M\\hat{\\Sigma} M^{*} \\) due to the Gaussian distribution of the noise. The remainder term vanishes provided that, for a given correction matrix \\( M \\), the term \\( \\max_{ij\\in [N]}|(M\\hat{\\Sigma} - I_{N\\times N})_{ij}| \\) is small and that the solution to the variational problem Eq. (2) accurately describes the underlying image, i.e., \\( x^0 - \\hat{x} \\) is small." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.511, + 0.788, + 0.729 + ], + "angle": 0, + "content": "The so-called nodewise LASSO, here adapted to complex subsampled Fourier matrices, and described in Algorithm 1, guarantees that \\(\\max_{ij\\in [N]}|(M\\hat{\\Sigma} -I_{N\\times N})_{ij}|\\) is small [36,60]. There, \\((\\mathcal{PF})_i\\) denotes the \\(i\\)-th column of the matrix \\((\\mathcal{PF})\\) and \\((\\mathcal{PF})_{-i}\\) denotes this matrix without the \\(i\\)-th column. For the latter, i.e., to understand when \\(x^0 -\\hat{x}\\) is small, a series of works, e.g., [39,48,49] and [7, Theorem 17.5] show that TV minimization provably retrieves a gradient-sparse image. The above results combined lead to the construction of pixel-wise sharp confidence intervals as described in Sec. 5. A remarkable advantage of such estimators is that once the image is retrieved as a solution to a convex optimization problem, one only needs to add the term \\(\\frac{1}{m} M(P\\mathcal{F})^{*}(b - P\\mathcal{F}\\hat{x})\\) to the estimator \\(\\hat{x}\\) in order to obtain confidence intervals. The inexpensive cost of such a debiased strategy comes from the fact that, for a given subsampling pattern \\(\\mathcal{P}\\), the matrix \\(M\\) needs to be computed only once, and it is independent of the image and the noise level." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.752, + 0.61, + 0.77 + ], + "angle": 0, + "content": "5 Confidence Intervals Implementation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.783, + 0.788, + 0.814 + ], + "angle": 0, + "content": "The construction of confidence intervals relies on the asymptotic normality of the debiased TV estimator. If the remainder term is small, then" + }, + { + "type": "equation", + "bbox": [ + 0.375, + 0.823, + 0.786, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\sqrt {m} (\\hat {x} ^ {u} - x ^ {0}) \\sim \\mathcal {C N} (0, \\sigma^ {2} M \\hat {\\Sigma} M ^ {*}). \\tag {5}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "The goal is to derive a confidence interval for every pixel. We start with a confidence region \\( C_i(\\alpha) \\) for the complex pixel value \\( x_{i}^{0} \\) that depends on the significance level \\( \\alpha \\in (0,1) \\), such that" + }, + { + "type": "equation", + "bbox": [ + 0.335, + 0.205, + 0.786, + 0.222 + ], + "angle": 0, + "content": "\\[\n\\mathbb {P} \\left(x _ {i} ^ {0} \\in C _ {i} (\\alpha)\\right) \\geq 1 - \\alpha \\quad \\text {f o r e v e r y i m a g e} x ^ {0}, \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.233, + 0.789, + 0.366 + ], + "angle": 0, + "content": "where \\(\\mathbb{P}\\) denotes the probability due to the random noise. According to Eq. (5), the new estimator \\(\\hat{x}^u\\) induces a complex Gaussian distribution on the difference \\(\\hat{x}^u - x^0\\). This means that it is possible to derive confidence intervals for the magnitude and the phase of the MR images. Since both the real part and the imaginary part are Gaussian distributed, the absolute value \\(|\\hat{x}_i^u - x_i^0| = \\sqrt{\\Re(\\hat{x}_i^u - x_i^0)^2 + \\Im(\\hat{x}_i^u - x_i^0)^2}\\) follows a Rician distribution with zero-mean. This special case simplifies to a Rayleigh distribution with variance \\(\\sigma \\cdot \\sqrt{(M\\hat{\\Sigma}M^*)_{ii}}\\) [8]. The corresponding radius \\(\\delta_i\\) of the confidence region \\(C_i(\\alpha)\\) is given by" + }, + { + "type": "equation", + "bbox": [ + 0.407, + 0.378, + 0.786, + 0.422 + ], + "angle": 0, + "content": "\\[\n\\delta_ {i} (\\alpha) = \\frac {\\sigma \\sqrt {\\log (1 / \\alpha)}}{\\sqrt {m} \\sqrt {(M \\hat {\\Sigma} M ^ {*}) _ {i i}}}. \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.432, + 0.788, + 0.493 + ], + "angle": 0, + "content": "Therefore, \\( C_i(\\alpha) \\) is a circle centered around the debiased TV reconstruction \\( \\hat{x}_i^u \\) with radius \\( \\delta_i(\\alpha) \\), i.e. \\( C_i(\\alpha) = \\{z \\in \\mathbb{C} \\mid |z - \\hat{x}_i^u| \\leq \\delta\\} \\). The confidence intervals for the magnitude, which is what is typically visualized by radiologists, can be constructed due to the following inequality:" + }, + { + "type": "equation", + "bbox": [ + 0.282, + 0.505, + 0.786, + 0.523 + ], + "angle": 0, + "content": "\\[\n\\mathbb {P} \\left(| x _ {i} ^ {0} | \\in [ | \\hat {x} _ {i} ^ {u} | - \\delta_ {i} (\\alpha), | \\hat {x} _ {i} ^ {u} | + \\delta_ {i} (\\alpha) ]\\right) \\geq \\mathbb {P} \\left(x _ {i} ^ {0} \\in C _ {i} (\\alpha)\\right) \\geq 1 - \\alpha . \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.534, + 0.788, + 0.633 + ], + "angle": 0, + "content": "Hence, the \\(1 - \\alpha\\) confidence interval for the magnitude is given by \\(J_{i}(\\alpha) = [|\\hat{x}_{i}^{u}| - \\delta_{i}(\\alpha), |\\hat{x}_{i}^{u}| + \\delta_{i}(\\alpha)]\\). Please note, however, that the confidence regions are given in the complex plane. This means that we could also have CIs for the phase \\(\\varphi^0\\) of the image, which contains information, e.g., on motion or electromagnetic properties of biological tissues [55]. With the same argument as in Eq. (8), and by denoting \\(\\hat{\\varphi}_i \\coloneqq \\arcsin \\left(\\frac{\\Re(\\hat{x}_i^u)}{|\\hat{x}_i^u|}\\right)\\) and \\(\\gamma_i = \\arccos \\left(1 - \\frac{\\delta_i^2}{2|\\hat{x}_i^u|^2}\\right)\\), we obtain" + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.646, + 0.786, + 0.663 + ], + "angle": 0, + "content": "\\[\n\\mathbb {P} \\left(\\varphi_ {i} ^ {0} \\in [ \\hat {\\varphi} _ {i} - \\gamma_ {i}, \\hat {\\varphi} _ {i} + \\gamma_ {i} ]\\right) \\geq 1 - \\alpha . \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.787, + 0.719 + ], + "angle": 0, + "content": "For a detailed derivation of the confidence intervals, refer to Section 2 of the supplementary material. This paper focuses on visualizing magnitudes, so we adhere to the confidence intervals presented in Equation 8." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Rigorously, Eq. (6) should be interpreted in the following way: The random quantity in Eq. (6) is the confidence region \\( C_i(\\alpha) \\) since it is based on the debiased TV estimator, which, in turn, is reconstructed by data that is affected by random noise. In contrast, the underlying image \\( x_i^0 \\) is fixed. Therefore, one should consider an experiment that is conducted \\( l \\) times, and every time the noise is different, it leads to a (slightly) different reconstruction. Hence, also to a (slightly) different confidence interval. In the end, the confidence region will contain the underlying image in at least \\( 1 - \\alpha \\) of the \\( l \\) cases." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.146, + 0.582, + 0.163 + ], + "angle": 0, + "content": "Algorithm 2 Confidence intervals for MR images" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.166, + 0.786, + 0.193 + ], + "angle": 0, + "content": "1: Input: Sampling mask \\(\\mathcal{P}\\), k-space data \\(b\\), regularization parameter \\(\\mu\\), (estimated) noise level \\(\\hat{\\sigma}\\), significance level \\(\\alpha\\), correction matrix \\(M\\)" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.194, + 0.529, + 0.209 + ], + "angle": 0, + "content": "2: solve \\(\\hat{x}\\gets \\min_{x\\in \\mathbb{C}^N}\\frac{\\mu}{2}\\| b - \\mathcal{P}Fx\\|_2^2 +\\| x\\|_{TV}\\)" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.209, + 0.599, + 0.223 + ], + "angle": 0, + "content": "3: debias reconstruction \\(\\hat{x}^u\\gets \\hat{x} +\\frac{1}{m} M(\\mathcal{PF})^* (b - \\mathcal{PF}\\hat{x})\\)" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.223, + 0.786, + 0.259 + ], + "angle": 0, + "content": "4: For each pixel \\(i\\) compute radius \\(\\delta_{i}\\gets \\frac{\\hat{\\sigma}}{\\sqrt{m}\\sqrt{(M\\hat{\\Sigma}M^{*})_{ii}}}\\sqrt{\\log(1 / \\alpha)}\\) with covariance matrix \\(\\hat{\\Sigma} = (\\mathcal{P}\\mathcal{F})^{*}(\\mathcal{P}\\mathcal{F}) / m\\)" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.259, + 0.715, + 0.273 + ], + "angle": 0, + "content": "5: For each pixel \\(i\\) obtain confidence circle \\(C_i(\\alpha) \\gets \\{z \\in \\mathbb{C} \\mid |z - \\hat{x}_i^u| \\leq \\delta\\}\\)" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.273, + 0.786, + 0.3 + ], + "angle": 0, + "content": "6: For each pixel \\(i\\) compute its confidence interval for the magnitude \\(J_{i}(\\alpha) \\gets [|\\hat{x}_{i}^{u}| - \\delta_{i}(\\alpha), |\\hat{x}_{i}^{u}| + \\delta_{i}(\\alpha)]\\)" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.301, + 0.786, + 0.329 + ], + "angle": 0, + "content": "7: Output: Reconstructions \\(\\hat{x}\\), \\(\\hat{x}^u\\) and confidence circles \\(C_i(\\alpha)\\) for \\(x_i^0\\) and confidence intervals \\(J_i(\\alpha)\\) for the magnitude \\(|x_i^0|\\) for every pixel \\(i\\)" + }, + { + "type": "list", + "bbox": [ + 0.223, + 0.166, + 0.786, + 0.329 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.363, + 0.788, + 0.469 + ], + "angle": 0, + "content": "Imaging with confidence, summarized in Algorithm 2, computes confidence intervals for the given pixels of an image retrieved via total variation minimization. More precisely, we propose an estimator that has an asymptotic Gaussian distribution, and from that, we derive pixel-wise uncertainty quantification for the magnitude and the phase of MR images. To visualize such a UQ procedure, we choose lines in the image, draw the confidence intervals, and measure the hit rate of how many pixels lie inside the given interval." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.493, + 0.516, + 0.511 + ], + "angle": 0, + "content": "6 Estimating the Noise Level" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.526, + 0.789, + 0.739 + ], + "angle": 0, + "content": "Despite advances in hardware and image acquisition techniques for MRI, the problem of noise in MR images persists, making noise estimation and analysis crucial tasks in MR image reconstruction [8]. Notably, MR noise estimation increases in complexity if advanced MR reconstruction approaches (e.g. parallel imaging) are employed and, especially, if the underlying individual coil raw data is not available. This is the default case for the clinical use of MRI since usually, only the magnitude data of the image after reconstruction is stored in clinical databases for diagnostic purposes. For our conceptual work on UQ, we ensured the consistent availability of the MR raw data by obtaining it directly from the MR scanner. Therefore, we were able to utilize image regions without imaging objects to retrieve the Gaussian distributed noise characteristics directly, obtaining noise levels of \\(5\\% - 15\\%\\) for the available data. For future implementation on any MR scanners, our proposed method for UQ can be directly amended to the regular image reconstruction when raw data is still available." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.762, + 0.482, + 0.78 + ], + "angle": 0, + "content": "7 Numerical Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "We numerically illustrate our imaging with confidence method by applying it to obtain pixel-wise confidence intervals for clinically feasible MR images reconstructed from noisy measurements. In line with our discussion above, we work" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.237 + ], + "angle": 0, + "content": "with noise levels between \\(6\\%\\) and \\(12.5\\%\\). We retrieve the image by minimizing the TV-regularized objective, Eq. (2), and we consider two different sampling schemes, radial and spiral sampling, which are both among the most popular for MRI applications. The code for reproducing all the experiments is available on GitHub7. More information about the implementation can be found in the supplementary material in Section 3." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.238, + 0.789, + 0.411 + ], + "angle": 0, + "content": "The radial k-space masks were generated according to the golden angle radial scheme proposed by [63]. Each mask is created by adding lines going through the center of the mask by placing a new line in an angle of \\(111.246^{\\circ}\\) (the golden angle) to the previously added one. As for the latter, k-space masks for spiral sampling were generated by first simulating readout gradients in 2D and computing the resulting k-space trajectories. The trajectories were regridded to the Cartesian grid and transformed to boolean masks. Undersampling factors were adjusted by changing the number of spokes and fine-tuned by adjusting the maximum radius \\(\\sqrt{(k_x^2 + k_y^2)}\\). Again, individual spokes were rotated by the golden angle relative to the previous one. Each spiral spoke forms a \\(3/4\\) rotation. The masks were fit to the size of our images, i.e., \\(156 \\times 156\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.411, + 0.789, + 0.472 + ], + "angle": 0, + "content": "As we will observe below, the confidence intervals appropriately capture the difference between ground truth and reconstruction, as predicted. Note that in the plots displaying this finding, the ground truth is only added as a comparison to assess UQ but never used for designing our method." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.493, + 0.555, + 0.509 + ], + "angle": 0, + "content": "7.1 UQ for in vivo Complex MRI Data" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.517, + 0.789, + 0.713 + ], + "angle": 0, + "content": "To assess UQ in realistic scenarios, we simulate the MRI data acquisition and reconstruction process using in vivo data as the underlying ground truth image, see Fig. 1a. We use existing in vivo data acquired with an inversion recovery spin echo (IR-SE) sequence with single-shot spiral readout as described by the works [19, 46]. Brain data of a healthy 32-year-old female were acquired on a Siemens Magnetom Skyra Connectome 3T system with a 32-channel head coil8 with a matrix of \\(156 \\times 156\\). Images with complex (magnitude and phase) data were reconstructed using an oversampled ridge-regression estimator that uses a higher order signal model that accounts for spatio-temporal field dynamics [50, 61, 62]. This high-quality complex-valued reconstruction serves as ground truth data for validating our uncertainty quantification method. Moreover, all in vivo scans were performed in accordance with local ethics guidelines and the Institutional Review Board (IRB) after obtaining the volunteer's written informed consent." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.713, + 0.789, + 0.806 + ], + "angle": 0, + "content": "The data acquisition process in the MRI scanner is simulated by taking the 2D Fourier transform of the image, adding Gaussian noise with noise level \\(\\sigma = 0.1\\) (see Fig. 1b) and subsampling this k-space data using the spiral and radial sampling scheme, respectively. The sampling masks are visualized in Fig. 1c for \\(43\\%\\) spiral subsampling and in Fig. 1d for \\(50\\%\\) radial subsampling. These subsampling rates are inspired by studies about the limitations of compressive sensing" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.597, + 0.826 + ], + "angle": 0, + "content": "7 https://github.com/HannahLaus/Project_UQ_TV.git" + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.826, + 0.516, + 0.839 + ], + "angle": 0, + "content": "Siemens Healthineers, Erlangen, Germany." + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.811, + 0.597, + 0.839 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.182 + ], + "angle": 0, + "content": "approaches for MRI based on expert Radiologists' scoring [34]. The resulting relative noise levels are \\(\\frac{\\|\\varepsilon\\|_2}{\\|\\mathcal{P}\\mathcal{F}x^0\\|_2} \\approx 6.5\\%\\) for spiral and \\(7\\%\\) for radial sampling." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.182, + 0.788, + 0.385 + ], + "angle": 0, + "content": "Since the sampling patterns are fixed, we calculate, for both masks, the matrix \\( M \\) according to Algorithm 1 with \\( \\lambda_{1} = \\ldots = \\lambda_{N} = 0.0035 \\cdot \\frac{\\sqrt{m}}{\\sqrt{12\\log(N)}} \\) using FISTA [10] with 1000 iterations. The dimensional scaling \\( \\frac{\\sqrt{m}}{\\sqrt{12\\log(N)}} \\) comes from theoretical works on debiased estimators, e.g., [28]. The constant 0.0035 was found via cross-validation. To reconstruct the image by the subsampled spiral and radial data, respectively, we solve Eq. (2) with the Split-Bregman algorithm [24] since it allows for complex-valued solutions. We use the parameters \\( \\hat{\\mu} = \\frac{\\mu}{20} \\), \\( \\lambda_{1} = \\lambda_{2} = 0.05 \\). For further information on the parameters and the optimization problem, see Section 1 of the supplementary material. The parameter \\( \\mu = \\frac{\\sqrt{m}}{\\sigma\\sqrt{12\\log N}} \\) was theoretically calculated for a subsampled Fourier matrix in [28]. After this reconstruction step, we compute the debiased TV estimator according to Algorithm 2." + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.419, + 0.348, + 0.488 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.281, + 0.494, + 0.302, + 0.506 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.377, + 0.419, + 0.485, + 0.488 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.422, + 0.494, + 0.442, + 0.505 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.517, + 0.419, + 0.623, + 0.487 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.564, + 0.494, + 0.582, + 0.506 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image", + "bbox": [ + 0.658, + 0.419, + 0.765, + 0.487 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.703, + 0.494, + 0.724, + 0.506 + ], + "angle": 0, + "content": "(d)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.517, + 0.788, + 0.573 + ], + "angle": 0, + "content": "Fig. 1: Model of experimental setting 1a: Magnitude of complex ground truth data 1b: Full k-space affected by Gaussian noise with noise level \\(\\sigma = 0.1\\) 1c: Spiral subsampling mask which samples \\(43\\%\\) of k-space 1d: Radial subsampling mask which samples \\(50\\%\\) of k-space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.604, + 0.788, + 0.734 + ], + "angle": 0, + "content": "To examine the distribution of the debiased TV estimator, a Q-Q plot (see Fig. 2d) compares the quantiles of the input sample, i.e. every component \\(\\frac{\\sqrt{2m}\\Re(\\hat{x}^u - x^0)_i}{\\sigma\\cdot\\sqrt{(M\\hat{\\Sigma}M^*)_{ii}}}\\) with the quantiles of a standard Gaussian distribution. It indeed confirms that the input is Gaussian distributed. Since the same is true for the imaginary part, it holds that \\(\\sqrt{m} (\\hat{x}^u -x^0)\\sim \\mathcal{CN}(0,\\sigma^2 M\\hat{\\Sigma} M^*)\\), which means that the error of the debiased TV follows a Gaussian distribution with mean zero and covariance structure \\(\\sigma^2 M\\hat{\\Sigma} M^*\\). The same behavior can be observed for radial sampling. The Q-Q plot is shown in Fig. 4d." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Algorithm 2, then, constructs confidence regions for the complex pixel values from which confidence intervals for the magnitudes and phases can be derived by using the fact that the new debiased estimator follows a Gaussian distribution given by \\(\\sqrt{m}\\hat{x}^u\\sim \\mathcal{CN}(\\sqrt{m} x^0,\\sigma^2 M\\hat{\\Sigma} M^*)\\). Here, we choose the confidence level \\(\\alpha = 0.05\\). For clarity, we show confidence intervals for all the pixels, corresponding to magnitudes, lying in a small rectangular region in the image. See Fig. 2a together with the corresponding confidence intervals in Figs. 2b and 2c in the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.153, + 0.33, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.277, + 0.226, + 0.298, + 0.239 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.366, + 0.153, + 0.489, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.421, + 0.226, + 0.443, + 0.239 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.512, + 0.153, + 0.633, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.567, + 0.226, + 0.586, + 0.239 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image", + "bbox": [ + 0.653, + 0.153, + 0.774, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.707, + 0.226, + 0.727, + 0.238 + ], + "angle": 0, + "content": "(d)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.25, + 0.787, + 0.34 + ], + "angle": 0, + "content": "Fig. 2: Confidence intervals for \\(43\\%\\) spiral sampling 2a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 2b & 2c: \\(95\\%\\) confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values, the blue circles are the corresponding estimates of the debiased TV estimator. 2b is for a reconstruction with \\(6.5\\%\\) noise and 2c is for a reconstruction with \\(10\\%\\) noise. 2d: Q-Q plot for input samples \\(\\frac{\\sqrt{2m(\\hat{x}^u - x^0)_i}}{\\sigma\\cdot\\sqrt{(M\\Sigma M^*)_{ii}}}\\)." + }, + { + "type": "image", + "bbox": [ + 0.348, + 0.373, + 0.484, + 0.457 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.405, + 0.465, + 0.425, + 0.477 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.522, + 0.373, + 0.658, + 0.457 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.579, + 0.465, + 0.6, + 0.477 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.488, + 0.787, + 0.534 + ], + "angle": 0, + "content": "Fig. 3: Empirical probability \\(\\hat{\\mathbb{P}}_i(\\alpha) = \\frac{1}{100}\\sum_{j=1}^{100}\\mathbb{1}_{\\{x_i^0 \\in C_i(\\alpha, \\varepsilon^{(j)})\\}}\\) for every image pixel each time with a different realization 3a for \\(43\\%\\) spiral undersampling and for 3b for \\(50\\%\\) radial undersampling." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.573, + 0.784, + 0.603 + ], + "angle": 0, + "content": "spiral undersampling setting as well as Figs. 4a, 4b and 4c for the radial case, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.608, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Interpretation of the UQ Procedure. The quality of the confidence regions is quantified by counting how many confidence regions contain the true ground truth pixel value \\( x_{i}^{0} \\) on and off the support. These hit rates are calculated for one realization of the noise by \\( h = \\frac{1}{N}\\sum_{i=1}^{N}\\mathbb{1}_{\\{x_{i}^{0}\\in C_{i}\\}} \\) and \\( h_{S} = \\frac{1}{s}\\sum_{i\\in \\mathrm{supp}(x^{0})}\\mathbb{1}_{\\{x_{i}^{0}\\in C_{i}\\}} \\), where \\( s \\) denotes the amount of pixels that are different from zero. But in view of the interpretation of a confidence interval as described in Sec. 5, we also estimate the probability \\( \\mathbb{P}(x_i^0\\in C_i(\\alpha)) \\) by the empirical probability \\( \\hat{\\mathbb{P}}_i(\\alpha) = \\frac{1}{100}\\sum_{j=1}^{100}\\mathbb{1}_{\\{x_i^0\\in C_i(\\alpha,\\varepsilon^{(j)})\\}} \\) for every pixel \\( i\\in [0,156]^2 \\) with \\( \\varepsilon^{(j)} \\) denoting the dependency on the \\( j \\)-th realization of the noise. In contrast to the hit rates, which are computed for one realization of the noise over all pixels, here we fix a pixel and observe how often the random confidence regions contain this pixel averaged over 100 different realizations of the noise. The image containing the empirical probability values for all pixels is shown in Fig. 3a for the spiral and in Fig. 3b for the radial case, respectively. In both cases, the maps seem to contain residual image information. In the spiral setting, the empirical probabil-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.154, + 0.331, + 0.218 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.277, + 0.226, + 0.298, + 0.239 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.367, + 0.153, + 0.489, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.421, + 0.226, + 0.443, + 0.239 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.512, + 0.153, + 0.634, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.567, + 0.226, + 0.586, + 0.239 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image", + "bbox": [ + 0.653, + 0.153, + 0.774, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.706, + 0.226, + 0.727, + 0.238 + ], + "angle": 0, + "content": "(d)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.25, + 0.788, + 0.34 + ], + "angle": 0, + "content": "Fig. 4: Confidence intervals for \\(50\\%\\) radial sampling 4a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 4b & 4c: \\(95\\%\\) confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values and the blue circles are the corresponding estimates of the debiased TV estimator. 4b is for a reconstruction with \\(7\\%\\) noise and 4c is for a reconstruction with \\(10.5\\%\\) noise. 4d: Q-Q plot for input samples \\(\\frac{\\sqrt{2m}\\Re(\\hat{x}^u - x^0)_i}{\\sigma\\cdot\\sqrt{(M\\Sigma M^*)_{ii}}}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.368, + 0.788, + 0.399 + ], + "angle": 0, + "content": "ity averaged over all support pixels is \\(90.64\\%\\), the one averaged over all pixels is \\(93.82\\%\\). For the radial case, the values are \\(91.95\\%\\) and \\(94.20\\%\\), respectively." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.42, + 0.449, + 0.434 + ], + "angle": 0, + "content": "7.2 Qualitative Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.444, + 0.788, + 0.653 + ], + "angle": 0, + "content": "The general idea of debiasing, is that after the transformation, the reconstruction error can be decomposed as \\(\\hat{x}^u - x^0 = R + W\\), where \\(R\\) is a small residual term and the dominating term \\(W\\) is Gaussian distributed. In fact, by inspecting Fig. 5, it is possible to visualize this debiasing step. On the one hand, the difference between the biased solution of Eq. (2) (see its magnitude in Fig. 5a for spiral and in Fig. 5e for radial sampling) and the ground truth has a very structured error, i.e. \\(|\\hat{x} - x^0|\\) still displays much of the brain structure, which can be seen in Figs. 5b and 5f. On the other hand, the difference between the unbiased estimator (see its magnitude in Fig. 5c for spiral and Fig. 5g for radial sampling) and the ground truth in Figs. 5d and 5h is much more unstructured, and one can see that it is dominated by random noise. Moreover, as we increase the number of k-space points or we increase the noise, this difference becomes more unstructured. The distribution can be measured in the Q-Q plots in Figs. 2d and 4d, which, indeed, shows the Gaussianity of \\(\\hat{x}^u - x^0\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.655, + 0.788, + 0.809 + ], + "angle": 0, + "content": "To test our findings, the same experiment as in Sec. 7.1 is conducted 100 times, each time with a different realization of the noise vector \\(\\varepsilon\\). In the spiral case, we do so for the subsampling rates \\(43\\%\\) and \\(62\\%\\), and in the radial setting, we choose the masks according to \\(50\\%\\), \\(70\\%\\), and \\(90\\%\\) k-space undersampling. For every mask, we select \\(\\sigma \\in \\{0.1, 0.15\\}\\) resulting in relative noise levels \\(\\frac{\\|\\varepsilon\\|_2}{\\|P\\mathcal{F}x^0\\|_2}\\) between 0.06 and 0.125. In these settings the \\(\\ell_2\\) and \\(\\ell_{\\infty}\\)-norm of the errors \\(\\hat{x} - x^0\\) and \\(\\hat{x}^u - x^0\\), of the bias term \\(R \\coloneqq (M\\hat{\\Sigma} - I_{N\\times N})(\\hat{x} - x^0)\\) and of the Gaussian term \\(W \\coloneqq \\frac{1}{m} M(P\\mathcal{F})^*\\varepsilon\\) are computed and averaged. The resulting quantities, including a more detailed analysis, can be found in Table 1 (spiral) and in Table 2 (radial) in Section 3 in the supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.842 + ], + "angle": 0, + "content": "With these results we numerically verify that \\( \\| R\\|_{\\infty} \\) is small as compared to \\( \\| W\\|_{\\infty} \\). Since the goal is to have pixel-wise confidence intervals, obtaining" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.151, + 0.344, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.277, + 0.227, + 0.297, + 0.239 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.377, + 0.151, + 0.49, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.421, + 0.227, + 0.442, + 0.239 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.519, + 0.147, + 0.643, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.563, + 0.227, + 0.582, + 0.239 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image", + "bbox": [ + 0.662, + 0.152, + 0.775, + 0.221 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.707, + 0.227, + 0.727, + 0.238 + ], + "angle": 0, + "content": "(d)" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.246, + 0.344, + 0.315 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.278, + 0.321, + 0.298, + 0.333 + ], + "angle": 0, + "content": "(e)" + }, + { + "type": "image", + "bbox": [ + 0.378, + 0.246, + 0.49, + 0.315 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.423, + 0.321, + 0.441, + 0.333 + ], + "angle": 0, + "content": "(f)" + }, + { + "type": "image", + "bbox": [ + 0.519, + 0.242, + 0.643, + 0.315 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.563, + 0.321, + 0.582, + 0.333 + ], + "angle": 0, + "content": "(g)" + }, + { + "type": "image", + "bbox": [ + 0.662, + 0.246, + 0.775, + 0.315 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.707, + 0.321, + 0.727, + 0.333 + ], + "angle": 0, + "content": "(h)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.343, + 0.788, + 0.428 + ], + "angle": 0, + "content": "Fig. 5: Reconstruction and debiasing visualization for spiral mask with \\(43\\%\\) subsampling and \\(6.5\\%\\) noise in the first row and for radial mask with \\(50\\%\\) subsampling and \\(7\\%\\) noise in the second row 5a & 5e: TV Reconstruction 5b & 5f: Magnitude of difference between ground truth and TV estimator 5c & 5g: Debiased TV Reconstruction, the small enlargement at the top of the image visualizes the noise in the background 5d & 5h: Magnitude of difference between ground truth and debiased TV estimator." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.457, + 0.788, + 0.594 + ], + "angle": 0, + "content": "estimators for which the residual is small in the \\(\\ell_{\\infty}\\)-norm is crucial. In the conducted experiments, both the biased and the unbiased estimator have \\(\\ell_{\\infty}\\)-errors compared to the ground truth that are of similar order. Despite this, and the fact that the \\(\\ell_{2}\\)-error is even larger in the debiased case, the debiasing significantly reduces the non-quantifiable \\(\\ell_{\\infty}\\)-error \\(\\| \\hat{x} - x^0 \\|_{\\infty}\\). This is the error for which no statistical information is available in closed form. Indeed, after the reconstruction given by solving Eq. (2) and applying the debiased procedure, the error is given by \\(\\hat{x}^u - x^0 = R + W\\). Since, due to our method, \\(R\\) is much smaller than \\(W\\), which is Gaussian distributed, we can use the latter for the UQ." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.595, + 0.789, + 0.76 + ], + "angle": 0, + "content": "The error ratio between the norm of \\( R \\) and of \\( W \\) depends on the quality of the solution of Eq. (2). The more data is available, i.e., the larger \\( m \\), the better the reconstruction and the better the error ratio, reflected in the confidence interval quality. A similar behavior is observed for the noise level added to the data. The norm of the Gaussian vector \\( W \\) depends linearly on the noise level \\( \\sigma \\). However, the reconstruction error does not seem to decrease at the same rate. This is related to the matrix difference \\( M\\hat{\\Sigma} - I_{N\\times N} \\), which is independent of the noise level and hence, does not decrease when the noise decreases. We also test our method on real valued brain, prostate and knee images for multiple patients, the results of those experiments are available in Section 3 of the supplementary material." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.784, + 0.35, + 0.797 + ], + "angle": 0, + "content": "7.3 Discussion" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "As shown in the experiments above, our method for imaging with confidence is able to provide \\(95\\%\\) confidence intervals with hit rates above \\(90\\%\\) for each pixel." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.266 + ], + "angle": 0, + "content": "We see such results for variational problems like Eq. (2) as particularly promising for the start of a UQ methodology for learned-based methods in MRI and in other applications where deep learning is employed. In particular, the debiasing procedure generates an estimator \\(\\hat{x}^u\\) that follows approximately a Gaussian distribution with mean \\(x^0\\). This estimator enables us to quantify uncertainty for the MR magnitude and phase of the signal. The latter constitutes the base input data for subsequent processing steps, such as the estimation of tissue susceptibilities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.269, + 0.788, + 0.377 + ], + "angle": 0, + "content": "The size of the given confidence intervals is \\(\\frac{\\hat{\\sigma}}{\\sqrt{m}}\\) up to a normalization constant. Intuitively, the more measurements we have, the smaller the range of uncertainty. Also, the dependency on \\(\\hat{\\sigma}\\) comes from the fact that noisy images are more affected by uncertainty. Since, to the best of the authors' knowledge, we are the first to construct honest confidence intervals for gradient-sparse MR images, there is a lack of comparing results. Still, confidence intervals of the same size are known to be sharp, in the worst-case sense, for similar problems [13]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.378, + 0.788, + 0.514 + ], + "angle": 0, + "content": "Limitations. One of the caveats of the imaging with confidence method is the estimation of the matrix \\(M\\) for complicated covariance structures given by other sampling schemes such as Lissajous curves [20, 37]. A more involved analysis is necessary in order to apply schemes that are more computationally efficient than the nodewise LASSO. Another crucial point is that since the size of the confidence interval depends on \\(\\hat{\\sigma}\\), the method provides meaningless UQ for very noisy regimes, i.e. data with more than \\(20\\%\\) noise. Finally, we acknowledge that the method should be tested in other imaging modalities, such as cardiac MRI, chemical shift imaging, or MR fingerprinting." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.544, + 0.36, + 0.56 + ], + "angle": 0, + "content": "8 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.582, + 0.788, + 0.748 + ], + "angle": 0, + "content": "In this paper, we propose a theory-inspired method for the construction of confidence intervals for fast undersampled MRI. We verify experimentally with in vivo MR data that the resulting confidence intervals are valid, i.e. that they contain the true pixel parameter with high probability. A significant advantage of the proposed method is that its application has very modest computational requirements since it is performed without acquiring further data, no Monte Carlo integration is necessary, and it does not require a prior distribution for the underlying image class. Therefore, our method contributes to a higher level of trustworthiness in medical imaging without increasing the scan time. We see a number of promising directions for follow-up research. Firstly, we intend to explore generalizations of our approach to quantitative MRI [56]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Secondly, we intend to extend the method to neural network approaches to MRI, in particular, to variational networks [25] and to vision transformers [38,44]. We feel that powerful methods for UQ are of particular importance here due to the black-box nature of these approaches; they are a key missing building block to make these often much superior methods [51, 64] widely available in clinical applications." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.393, + 0.163 + ], + "angle": 0, + "content": "Acknowledgments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.268 + ], + "angle": 0, + "content": "We gratefully acknowledge financial support with funds provided by the German Federal Ministry of Education and Research in the grant \"SparseMRI3D+: Compressive Sensing und Quantifizierung von Unsicherheiten für die beschleunigte multiparametrische quantitative Magnetresonanztomografie (FZK 05M20WOA)\" and funding by the European Union's Horizon 2020 Research and Innovation Programme under Grant Agreement No. 952172." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.288, + 0.323, + 0.304 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.346 + ], + "angle": 0, + "content": "1. ECCV 2022 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2022.github.io/papers/, accessed: 2024-02-26" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.347, + 0.785, + 0.385 + ], + "angle": 0, + "content": "2. FDA 510(k) Premarket Notification for HyperSense. https://www.accessdata.fda.gov/scripts/cdrh/CFdocs/CFpmn/pmnn.cfm?ID=K162722, accessed: 2024-02-26" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.387, + 0.785, + 0.427 + ], + "angle": 0, + "content": "3. FDA 510(k) Premarket Notification for MAGNETOM Aera and MAGNETOM Skyra. https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/pmn.cfm?ID=K163312, accessed: 2024-02-26" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.429, + 0.785, + 0.482 + ], + "angle": 0, + "content": "4. HyperSense: Compressed sensing and other advanced acceleration techniques. https://www.gehealthcare.com/ - /jssmedia/files/us/non-gated/mri/hypersense-booklet.pdf?rev=-1&hash=FAE260A3F4CA0A82E236DEDA5CAD39A6, accessed: 2024-02-26" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.484, + 0.785, + 0.51 + ], + "angle": 0, + "content": "5. ICCV 2023 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2023.github.io/papers/, accessed: 2024-02-26" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.512, + 0.785, + 0.537 + ], + "angle": 0, + "content": "6. ICML 2021 Workshop: Workshop on Distribution-Free Uncertainty Quantification. https://icml.cc/virtual/2021/workshop/8373, accessed: 2024-02-26" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.539, + 0.785, + 0.565 + ], + "angle": 0, + "content": "7. Adcock, B., Hansen, A.C.: Compressive imaging: structure, sampling, learning. Cambridge University Press (2021). https://doi.org/10.1017/9781108377447" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.567, + 0.785, + 0.605 + ], + "angle": 0, + "content": "8. Aja-Fernández, S., Vegas-Sánchez-Ferrero, G.: Statistical Analysis of Noise in MRI: Modeling, Filtering and Estimation. Springer, Cham (2016). https://doi.org/10. 1007/978-3-319-39934-8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.607, + 0.785, + 0.647 + ], + "angle": 0, + "content": "9. Angelopoulos, A.N., Bates, S.: A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511 (2021). https://doi.org/10.48550/arXiv.2107.07511" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.649, + 0.785, + 0.688 + ], + "angle": 0, + "content": "0. Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM journal on imaging sciences 2(1), 183-202 (2009). https://doi.org/10.1137/080716542" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.785, + 0.73 + ], + "angle": 0, + "content": "1. Bellec, P.C., Zhang, C.H.: Debiasing convex regularized estimators and interval estimation in linear models. The Annals of Statistics 51(2), 391 - 436 (2023). https://doi.org/10.1214/22-A0S2243, 10.1214/22-A0S2243" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.785, + 0.797 + ], + "angle": 0, + "content": "2. Block, K.T., Uecker, M., Frahm, J.: Undersampled radial MRI with multiple coils. Iterative image reconstruction using a total variation constraint. Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine 57(6), 1086-1098 (2007). https://doi.org/10.1002/mrm.21236" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "3. Cai, T.T., Guo, Z.: Confidence intervals for high-dimensional linear regression: Minimax rates and adaptivity. The Annals of Statistics 45(2), 615 - 646 (2017). https://doi.org/10.1214/16-A0S1461" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "14. Chambolle, A., Caseles, V., Cremers, D., Novaga, M., Pock, T., et al.: An introduction to total variation for image analysis. Theoretical foundations and numerical methods for sparse recovery 9(263-340), 227 (2010). https://doi.org/10.1515/9783110226157.263" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.204, + 0.787, + 0.245 + ], + "angle": 0, + "content": "15. Condat, L.: Discrete total variation: New definition and minimization. SIAM Journal on Imaging Sciences 10(3), 1258-1290 (2017). https://doi.org/10.1137/16M1075247" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.247, + 0.787, + 0.302 + ], + "angle": 0, + "content": "16. Cruz, G., Atkinson, D., Buerger, C., Schaeffter, T., Prieto, C.: Accelerated motion corrected three-dimensional abdominal MRI using total variation regularized SENSE reconstruction. Magnetic resonance in medicine 75(4), 1484-1498 (2016). https://doi.org/10.1002/mrm.25708" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.304, + 0.787, + 0.346 + ], + "angle": 0, + "content": "17. Cukur, T., Lustig, M., Nishimura, D.G.: Improving non-contrast-enhanced steady-state free precession angiography with compressed sensing. Magnetic Resonance in Medicine 61(5), 1122-1131 (2009). https://doi.org/10.1002/mrm.21907" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.346, + 0.787, + 0.387 + ], + "angle": 0, + "content": "18. Donoho, D.: Blackboard to bedside: How high-dimensional geometry is transforming the MRI industry. Notices of the American Mathematical Society 65(1) (2018). https://doi.org/10.1090/notti1612" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.389, + 0.787, + 0.457 + ], + "angle": 0, + "content": "19. Endt, S., Engel, M., Naldi, E., Assereto, R., Molendowska, M., Mueller, L., Mayrink Verdun, C., Pirkl, C.M., Palombo, M., Jones, D.K., Menzel, M.I.: In Vivo Myelin Water Quantification Using Diffusion-Relaxation Correlation MRI: A Comparison of 1D and 2D Methods. Applied Magnetic Resonance 54(11), 1571-1588 (2023). https://doi.org/10.1007/s00723-023-01584-1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.459, + 0.787, + 0.5 + ], + "angle": 0, + "content": "20. Feng, H., Gu, H., Silbersweig, D., Stern, E., Yang, Y.: Single-shot MR imaging using trapezoidal-gradient-based Lissajous trajectories. IEEE transactions on medical imaging 22(8), 925-932 (2003). https://doi.org/10.1109/TMI.2003.815902" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.787, + 0.557 + ], + "angle": 0, + "content": "21. Fischer, P., Thomas, K., Baumgartner, C.F.: Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction. In: International Workshop on Uncertainty for Safe Utilization of Machine Learning in Medical Imaging. pp. 84-94. Springer (2023). https://doi.org/10.1007/978-3-031-44336-7_9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.558, + 0.787, + 0.585 + ], + "angle": 0, + "content": "22. Fu, W., Knight, K.: Asymptotics for lasso-type estimators. The Annals of statistics 28(5), 1356-1378 (2000). https://doi.org/DOI:10.1214/aos/1015957397" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.587, + 0.787, + 0.614 + ], + "angle": 0, + "content": "23. Giraud, C.: Introduction to high-dimensional statistics. Chapman and Hall/CRC (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.615, + 0.787, + 0.655 + ], + "angle": 0, + "content": "24. Goldstein, T., Osher, S.: The split Bregman method for L1-regularized problems. SIAM journal on imaging sciences 2(2), 323-343 (2009). https://doi.org/10.1137/080725891" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.657, + 0.787, + 0.712 + ], + "angle": 0, + "content": "25. Hammernik, K., Klatzer, T., Kobler, E., Recht, M.P., Sodickson, D.K., Pock, T., Knoll, F.: Learning a variational network for reconstruction of accelerated MRI data. Magnetic resonance in medicine 79(6), 3055-3071 (2018). https://doi.org/10.1002/mrm.26977" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.714, + 0.787, + 0.755 + ], + "angle": 0, + "content": "26. Han, Y., Lee, T.C.: Uncertainty Quantification for Sparse Estimation of Spectral Lines. IEEE Transactions on Signal Processing 70, 6243-6256 (2022). https://doi.org/10.1109/TSP.2023.3235662" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.787, + 0.797 + ], + "angle": 0, + "content": "27. Hannig, J., Iyer, H., Lai, R.C., Lee, T.C.: Generalized fiducial inference: A review and new results. Journal of the American Statistical Association 111(515), 1346-1361 (2016). https://doi.org/10.1080/01621459.2016.1165102" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "28. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: Uncertainty quantification for sparse Fourier recovery. arXiv:2212.14864 (2022). https://doi.org/10.48550/arXiv.2212.14864" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "29. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: High-Dimensional Confidence Regions in Sparse MRI. In: ICASSP 2023. pp. 1-5 (2023). https://doi.org/10.1109/ICASSP49357.2023.10096320" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.787, + 0.232 + ], + "angle": 0, + "content": "30. Hoppe, F., Mayrink Verdun, C., Laus, H., Krahmer, F., Rauhut, H.: Non-Asymptotic Uncertainty Quantification in High-Dimensional Learning. arXiv preprint (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.232, + 0.787, + 0.272 + ], + "angle": 0, + "content": "31. Hüllermeier, E., Waegeman, W.: Aleatoric and epistemic uncertainty in machine learning: An introduction to concepts and methods. Machine Learning 110, 457-506 (2021). https://doi.org/10.1007/s10994-021-05946-3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.273, + 0.787, + 0.3 + ], + "angle": 0, + "content": "32. Hütter, J.C., Rigollet, P.: Optimal rates for total variation denoising. In: Conference on Learning Theory. pp. 1115-1146. PMLR (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.3, + 0.787, + 0.342 + ], + "angle": 0, + "content": "33. Hyun, C.M., Kim, H.P., Lee, S.M., Lee, S., Seo, J.K.: Deep learning for undersampled MRI reconstruction. Physics in Medicine & Biology 63(13), 135007 (2018). https://doi.org/10.1088/1361-6560/aac71a9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.342, + 0.787, + 0.384 + ], + "angle": 0, + "content": "34. Jaspan, O., Fleysher, R., Lipton, M.: Compressed Sensing MRI: A review of the clinical literature. The British journal of radiology 88, 20150487 (09 2015). https://doi.org/10.1259/bjr.20150487" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.384, + 0.787, + 0.424 + ], + "angle": 0, + "content": "35. Javanmard, A., Montanari, A.: Confidence intervals and hypothesis testing for high-dimensional regression. Journal of Machine Learning Research 15, 2869-2909 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.424, + 0.787, + 0.465 + ], + "angle": 0, + "content": "36. Javanmard, A., Montanari, A.: Debiasing the lasso: Optimal sample size for Gaussian designs. The Annals of Statistics 46(6A) (2018). https://doi.org/10.1214/17-A0S1630" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.466, + 0.787, + 0.522 + ], + "angle": 0, + "content": "37. Kaethner, C., Erb, W., Ahlborg, M., Szwargulski, P., Knopp, T., Buzug, T.M.: Non-equispaced system matrix acquisition for magnetic particle imaging based on Lissajous node points. IEEE transactions on medical imaging 35(11), 2476-2485 (2016). https://doi.org/10.1109/TMI.2016.2580458" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.522, + 0.787, + 0.591 + ], + "angle": 0, + "content": "38. Korkmaz, Y., Yurt, M., Dar, S.U.H., Özbey, M., Cukur, T.: Deep MRI reconstruction with generative vision transformers. In: Machine Learning for Medical Image Reconstruction: 4th International Workshop, MLMIR 2021, Held in Conjunction with MICCAI 2021, Strasbourg, France, October 1, 2021, Proceedings 4. pp. 54-64. Springer (2021). https://doi.org/10.1007/978-3-030-88552-6_6" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.591, + 0.787, + 0.632 + ], + "angle": 0, + "content": "39. Krahmer, F., Ward, R.: Stable and robust sampling strategies for compressive imaging. IEEE transactions on image processing 23(2), 612-622 (2013). https://doi.org/10.1109/TIP.2013.2288004" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.632, + 0.787, + 0.687 + ], + "angle": 0, + "content": "40. Krahmer, F., Kruschel, C., Sandbichler, M.: Total variation minimization in compressed sensing. In: Compressed Sensing and its Applications: Second International MATHEON Conference 2015. pp. 333-358. Springer (2017). https://doi.org/10.1109/CSE-EUC-DCABES.2016.233" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.688, + 0.787, + 0.73 + ], + "angle": 0, + "content": "41. Lai, R.C., Hannig, J., Lee, T.C.: Generalized fiducial inference for ultrahigh-dimensional regression. Journal of the American Statistical Association 110(510), 760-772 (2015). https://doi.org/10.1080/01621459.2014.931237" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.73, + 0.787, + 0.757 + ], + "angle": 0, + "content": "42. Liang, Z.P., Lauterbur, P.C.: Principles of magnetic resonance imaging. SPIE Optical Engineering Press Bellingham, WA (2000)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.758, + 0.787, + 0.798 + ], + "angle": 0, + "content": "43. Lin, A., Song, A.H., Bilgic, B., Ba, D.: Covariance-free sparse Bayesian learning. IEEE Transactions on Signal Processing 70, 3818-3831 (2022). https://doi.org/10.1109/TSP.2022.3186185" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "44. Lin, K., Heckel, R.: Vision transformers enable fast and robust accelerated MRI. In: International Conference on Medical Imaging with Deep Learning. pp. 774-795. PMLR (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.375, + 0.129 + ], + "angle": 0, + "content": "F. Hoppe et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "45. Lustig, M., Donoho, D., Pauly, J.M.: Sparse MRI: The application of compressed sensing for rapid MR imaging. Magnetic Resonance in Medicine 58(6), 1182-1195 (2007). https://doi.org/10.1002/mrm.21391" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.787, + 0.257 + ], + "angle": 0, + "content": "46. Mueller, L., Rudrapatna, S.U., Tax, C.M., Wise, R., Jones, D.K.: Diffusion MRI with \\( b = 1000s / \\mathrm{mm}2 \\) at \\( \\mathrm{TE} < 22\\mathrm{ms} \\) using single-shot spiral readout and ultra-strong gradients: Implications for microstructure imaging. Proceedings of the International Society for Magnetic Resonance in Medicine, 2019. Presented at the ISMRM (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.257, + 0.787, + 0.311 + ], + "angle": 0, + "content": "47. Nassirpour, S., Chang, P., Avdievitch, N., Henning, A.: Compressed sensing for high-resolution nonlipid suppressed 1H FID MRSI of the human brain at 9.4 T. Magnetic resonance in medicine 80(6), 2311-2325 (2018). https://doi.org/10.1002/mrm.27225" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.311, + 0.787, + 0.352 + ], + "angle": 0, + "content": "48. Needell, D., Ward, R.: Stable image reconstruction using total variation minimization. SIAM Journal on Imaging Sciences 6(2), 1035-1058 (2013). https://doi.org/10.1137/120868281" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.352, + 0.787, + 0.393 + ], + "angle": 0, + "content": "49. Poon, C.: On the role of total variation in compressed sensing. SIAM Journal on Imaging Sciences 8(1), 682-720 (2015). https://doi.org/10.1137/140978569, https://doi.org/10.1137/140978569" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.393, + 0.787, + 0.433 + ], + "angle": 0, + "content": "50. Pruessmann, K.P., Weiger, M., Börnert, P., Boesiger, P.: Advances in sensitivity encoding with arbitrary k-space trajectories. Magnetic Resonance in Medicine 46(4), 638-651 (2001). https://doi.org/10.1002/mrm.1241" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.433, + 0.787, + 0.501 + ], + "angle": 0, + "content": "51. Rastogi, A., Brugnara, G., Foltyn-Dumitru, M., Mahmutoglu, M.A., Preetha, C.J., Kobler, E., Pflüger, I., Schell, M., Deike-Hofmann, K., Kessler, T., et al.: Deep-learning-based reconstruction of undersampled MRI to reduce scan times: a multicentre, retrospective, cohort study. The Lancet Oncology 25(3), 400-410 (2024). https://doi.org/10.1016/S1470-2045(23)00641-1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.501, + 0.787, + 0.555 + ], + "angle": 0, + "content": "52. Roth, S., Black, M.: Fields of Experts: a framework for learning image priors. In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05). vol. 2, pp. 860-867 vol. 2 (2005). https://doi.org/10.1109/CVPR.2005.160" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.555, + 0.787, + 0.596 + ], + "angle": 0, + "content": "53. Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena 60(1-4), 259-268 (1992). https://doi.org/10.1016/0167-2789(92)90242-F" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.596, + 0.787, + 0.651 + ], + "angle": 0, + "content": "54. Saucedo, A., Macey, P.M., Thomas, M.A.: Accelerated radial echo-planar spectroscopic imaging using golden angle view-ordering and compressed-sensing reconstruction with total variation regularization. Magnetic Resonance in Medicine 86(1), 46-61 (2021). https://doi.org/10.1002/mrm.28728" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.651, + 0.787, + 0.703 + ], + "angle": 0, + "content": "55. Schweser, F., Deistung, A., Reichenbach, J.R.: Foundations of MRI phase imaging and processing for Quantitative Susceptibility Mapping (QSM). Zeitschrift für medizinische Physik 26(1), 6-34 (2016). https://doi.org/10.1016/j.zemedi.2015.10.002" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.703, + 0.787, + 0.745 + ], + "angle": 0, + "content": "56. Shafieizargar, B., Byanju, R., Sijbers, J., Klein, S., den Dekker, A.J., Poot, D.H.: Systematic review of reconstruction techniques for accelerated quantitative MRI. Magnetic Resonance in Medicine (2023). https://doi.org/10.1002/mrm.29721" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.745, + 0.787, + 0.799 + ], + "angle": 0, + "content": "57. Tezcan, K.C., Karani, N., Baumgartner, C.F., Konukoglu, E.: Sampling possible reconstructions of undersampled acquisitions in MR imaging with a deep learned prior. IEEE Transactions on Medical Imaging 41(7), 1885-1896 (2022). https://doi.org/10.1109/TMI.2022.3150853" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "58. Tibshirani, R.: Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 58(1), 267-288 (1996). https://doi.org/10.1111/j.2517-6161.1996.tb02080.x" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.564, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Imaging with Confidence" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.202 + ], + "angle": 0, + "content": "59. Valdenegro-Toro, M.: I find your lack of uncertainty in computer vision disturbing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1263-1272 (2021). https://doi.org/10.1109/CVPRW53098.2021.00139" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.203, + 0.788, + 0.245 + ], + "angle": 0, + "content": "60. van de Geer, S., Buhlmann, P., Ritov, Y., Dezeure, R.: On asymptotically optimal confidence regions and tests for high-dimensional models. The Annals of Statistics 42(3) (2014). https://doi.org/10.1214/14-A0S1221" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.245, + 0.788, + 0.313 + ], + "angle": 0, + "content": "61. Wilm, B.J., Barnet, C., Gross, S., Kasper, L., Vannesjo, S.J., Haeberlin, M., Dietrich, B.E., Brunner, D.O., Schmid, T., Pruessmann, K.P.: Single-shot spiral imaging enabled by an expanded encoding model: Demonstration in diffusion MRI. Magnetic resonance in medicine 77(1), 83-91 (2017). https://doi.org/10.1002/mrm.26493" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.314, + 0.788, + 0.357 + ], + "angle": 0, + "content": "62. Wilm, B.J., Barmet, C., Pavan, M., Pruessmann, K.P.: Higher order reconstruction for MRI in the presence of spatiotemporal field perturbations. Magnetic resonance in medicine 65(6), 1690-1701 (2011). https://doi.org/10.1002/mrm.22767" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.357, + 0.788, + 0.41 + ], + "angle": 0, + "content": "63. Winkelmann, S., Schaeffer, T., Koehler, T., Eggers, H., Doessel, O.: An optimal radial profile order based on the Golden Ratio for time-resolved MRI. IEEE transactions on medical imaging 26(1), 68-76 (2006). https://doi.org/10.1109/TMI.2006.885337" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.411, + 0.788, + 0.453 + ], + "angle": 0, + "content": "64. Zeng, G., Guo, Y., Zhan, J., Wang, Z., Lai, Z., Du, X., Qu, X., Guo, D.: A review on deep learning MRI reconstruction without fully sampled k-space. BMC Medical Imaging 21(1), 195 (2021). https://doi.org/10.1186/s12880-021-00727-9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.507 + ], + "angle": 0, + "content": "65. Zhang, C.H., Zhang, S.S.: Confidence intervals for low dimensional parameters in high dimensional linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 76(1), 217-242 (2014). https://doi.org/10.1111/rssb.12026" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.507 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_origin.pdf b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..cfcc81e13ad6d78524bc7e94e1c4ca2d584ae595 --- /dev/null +++ b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/973eb161-b90b-4ebc-8ed6-123db5236604_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:67260cd84376153bbc06fb4b7f204bfa62f7963fe449f278adc9c8ecfffd903f +size 2529368 diff --git a/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/full.md b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/full.md new file mode 100644 index 0000000000000000000000000000000000000000..e00293733ebb74fec8a30598e68a25e679b59db5 --- /dev/null +++ b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/full.md @@ -0,0 +1,353 @@ +# Imaging with Confidence: Uncertainty Quantification for High-dimensional Undersampled MR Images + +Frederik Hoppe1*, Claudio Mayrink Verdun2*, Hannah Laus3*, Sebastian Endt4, Marion I. Menzel4, Felix Krahmer3, and Holger Rauhut5 + +$^{1}$ RWTH Aachen University, Germany hoppe@mathc.rwth-aachen.de + +$^{2}$ Harvard University, USA claudioverdun@seas.harvard.edu + +3 TU Munich & MCML, Germany {hannah.laus,felix.krahmer}@tum.de + +4 TH Ingolstadt, TU Munich & GE HealthCare, Germany {sebastian.endt,Marion.Menzel}@thi.de + +5 LMU Munich & MCML, Germany rauhut@math.lmu.de + +Abstract. Establishing certified uncertainty quantification (UQ) in imaging processing applications continues to pose a significant challenge. In particular, such a goal is crucial for accurate and reliable medical imaging if one aims for precise diagnostics and appropriate intervention. In the case of magnetic resonance imaging, one of the essential tools of modern medicine, enormous advancements in fast image acquisition were possible after the introduction of compressive sensing and, more recently, deep learning methods. Still, as of now, there is no UQ method that is both fully rigorous and scalable. This work takes a step towards closing this gap by proposing a total variation minimization-based method for pixel-wise sharp confidence intervals for undersampled MRI. We demonstrate that our method empirically achieves the predicted confidence levels. We expect that our approach will also have implications for other imaging modalities as well as deep learning applications in computer vision. Our code is available on GitHub https://github.com/HannahLaus/Project_UQ_TV.git. + +Keywords: Uncertainty Quantification $\cdot$ Imaging Processing $\cdot$ Magnetic Resonance Imaging + +# 1 Introduction + +In recent years, the field of magnetic resonance imaging, like many other imaging modalities, has undergone a significant paradigm shift towards a unified design of the acquisition-reconstruction pipeline. That is, the data to be acquired is selected based on the computational methods used for reconstruction. A prominent example of this interplay is compressive imaging, where sampling trajectories chosen to be suitable for imaging reconstruction via sparse recovery schemes + +allowed for significant undersampling [45]. Later, the same type of subsampling techniques have also proven successful in the context of deep learning reconstructions [33]. Thanks to these approaches, the retrieval of fast, undersampled MRI in clinical settings is now a reality. Indeed, in 2017, the FDA approved the first scanners employing acceleration techniques with compressive sensing [2, 3], and since then, several products and algorithms for retrieving highly undersampled images have emerged. In these advancements, mathematical theory has played a driving role, so this development has sometimes been described as from blackboard to bedside [18]. The main objective driving the design of the reconstruction algorithms is to use nonlinear optimization to find solutions adhering to structural constraints describing real images. These constraints could explicitly arise from a unified model, such as wavelet or gradient sparsity, or be implicitly learned from training data. + +When the measurements are affected by noise, these methods search for solutions adhering to these constraints within the feasibility regions. That is, the imaging recovery method will search in the space of possible solutions and look for reconstructions that resemble natural images, which also makes potential reconstruction artifacts harder to identify. Especially unexpected localized features could correspond to real pathological abnormalities or arise in the interplay of noise and recovery methods. For this reason, quantifying the uncertainty via certified confidence intervals is of increasing importance not only for MRI but for a variety of problems in imaging and computer vision [59]. + +At the same time, classical approaches for assessing the confidence of the solution that could allow to distinguish these two causes, abnormalities and artifacts, are not applicable. The reason is that they typically require some knowledge of the distribution of the random distortion and, consequently, of the generated image. While the measurement error is well modeled by Gaussian noise, the distribution of the resulting distortion in the reconstruction cannot be modeled as easily due to the nonlinearity of the procedure, see, e.g., [22, Theorem 2] and the discussion therein. This poses a significant issue when the reconstructed image is directly employed for downstream tasks, such as automating the extraction of quantitative parameters for clinical analysis. + +Imaging with confidence, a novel rigorous method tailored to UQ: It is only recently that the first attempts to derive non-asymptotic confidence intervals for the pixel values of the reconstruction, without imposing prior knowledge have been successful (see Section 2 for a discussion). So far, most works have focused on sparsity models with respect to some known basis, as they are natural, for example, in angiography and reconstruction via variants of the LASSO [7]. In this work, we leverage these approaches to address the uncertainty quantification problem for recovery via total variation minimization, a standard recovery scheme for MR images in current industrial implementations [4] that has also conceptually inspired various machine learning-based approaches reaching state-of-the-art results such as variational networks [25]. To the best of our knowledge, for the first time, we provide rigorous confidence intervals for un- + +dersampled acquired MR images and test the results with synthetic and in vivo data. + +# 2 Related Work + +There were other attempts available in the literature to tackle the aleatoric uncertainty quantification of high-dimensional parsimonious problems, such as in undersampled imaging generation. For example, a series of works developed the so-called generalized fiducial inference [26, 27, 41]. Such a method creates a relationship between the data and the parameters for which the UQ can be rigorously performed and establishes confidence intervals from such a relationship. However, high-dimensional Monte Carlo makes this method intractable in the high-dimensional imaging regime. Bayesian sparse learning techniques were also developed for undersampled imaging problems [43]. An inherent challenge with the Bayesian approach arises when inappropriate prior distributions, which fail to accurately reflect the prior physical knowledge of the problem, are employed. In such cases, the performance and reliability of the approach may deteriorate. Another line of research on UQ is conformal prediction, which generates distribution-free prediction sets for regression and classification problems [9]. However, choosing the score function in imaging problems can be challenging. Such a technique is more directly applied to epistemic uncertainty rather than to the aleatoric one [31]. Our work builds on the urgency of providing rigorous UQ to imaging problems in computer vision and image processing. Such necessity can be seen in the several workshops for UQ in computer vision and imaging that took place over the last few years dedicated to this theme [1, 5, 6]. + +Our uncertainty quantification extends a line of research about non-asymptotic confidence intervals for high-dimensional problems known as debiased estimators, which was initiated in a series of papers [11,35,60,65]. The key idea is that given an estimator to retrieve noisy image retrieval from a few measurements; one can characterize the distribution of a modified estimator based on the KKT conditions of the underlying inverse problem; see Section 3.2. Such works established sharp confidence intervals for i.i.d. (sub-)Gaussian variables with Gaussian noise by assuming that the object to be retrieved is s-sparse in the canonical basis. However, such variables do not represent typical constraints imposed by the physics behind the acquisition procedure. Later, this was extended to imaging applications, where UQ was rigorously obtained for $\ell_1$ model-based MRI [28,29]. In this paper, we harness results for UQ obtained in previous works to more realistic scenarios where the images are reconstructed via the minimization of the total variation semi-norm, an idea introduced in the seminal paper [53]. This imaging retrieval technique was extensively explored in tasks such as inpainting, denoising, and deblurring; see [14, 32] and references therein. This method has been rigorously proven to yield state-of-the-art results in MRI reconstruction - see [40] and [7, Chapter 17] - and was consistently tested in several applications such as parallel imaging [12], free-breathing three-dimensional cardiac MRI [16], non-contrast-enhanced angiography [17], spectroscopy [54] and metabolite maps + +of the human brain [47], to name a few. Recently, in the context of learning algorithms, the work [57] proposed a latent Bayesian model with a variational autoencoder to obtain posterior distributions for the generated images and the work [21] proposed hierarchical conditional variational autoencoders for UQ, but no theory is available for such methods. Finally, [30] developed a non-asymptotic theory for constructing confidence intervals for high-dimensional learning problems. + +# 3 Background: Sparse Imaging Retrieval + +In this section, we summarize the tools we need to construct confidence intervals for images. Throughout the paper, we consider the following high-dimensional linear model that is a discretized version of the Bloch equations, which models the MR acquisition process [42] + +$$ +b = \mathcal {P F} x ^ {0} + \varepsilon \quad \text {w i t h} N \gg m. \tag {1} +$$ + +Here, $b \in \mathbb{C}^m$ is the k-space data, $\mathcal{P}\mathcal{F} \in \mathbb{C}^{m \times N}$ is a subsampled Fourier matrix, $x^0 \in \mathbb{C}^N$ is the underlying ground truth image, and $\varepsilon \sim \mathcal{CN}(0, \sigma^2 I_{N \times N})$ is complex Gaussian noise. The goal in fast undersampled MRI is to retrieve $x^0$ having $m < N$ k-space measurements $b$ when $\mathcal{P}\mathcal{F}$ and $\sigma$ are known. + +# 3.1 Total Variation + +As described in Sec. 2, several image modalities can be modeled by gradient-sparse images. Also, such guiding principle is behind modern deep learning architectures that learn higher-order statistics of images, e.g., those based on the fields of experts framework [52]. Therefore, we extend the results to the total-variation setting to create rigorous UQ schemes for MRI. More precisely, for a given image $x^0 \in \mathbb{C}^N$ , we consider the finite gradient operator $D$ that gives $Dx^0 = (x_2^* - x_1^*, \ldots, x_N^* - x_{N-1}^*)^T \in \mathbb{C}^{N-1}$ and we solve the total variation problem, i.e., + +$$ +\operatorname {a r g m i n} _ {x \in \mathbb {C} ^ {N}} \frac {\mu}{2} \| b - \mathcal {P F} x \| _ {2} ^ {2} + \| x \| _ {T V} \tag {2} +$$ + +with a regularization parameter $\mu > 0$ for balancing the data fidelity term $\|b - \mathcal{P}\mathcal{F}x\|_2^2$ and the regularization term $\|x\|_{TV} \coloneqq \|Dx\|_1$ , which is referred to as the anisotropic formulation [7]. We use such a formulation due to the resemblance with the LASSO estimator. Still, the same techniques described here hold for other discretizations of the total variation, such as the isotropic one, e.g., see [15]. + +# 3.2 Debiased Estimators for Image Retrieval + +If the underlying image to be retrieved from a few samples is sparse in the canonical basis, several methods in the sparse learning literature can be used, with the LASSO being arguably the most famous one [58]. However, given a certain + +noise level $\sigma$ , it is provably impossible to have a practical characterization of the LASSO distribution since it depends on the support of the ground truth, which is not known in advance [22]. Moreover, a bias is introduced by the shrinkage procedure of the $\ell_1$ -norm [23, Chapter 4]. Several works in the statistical literature developed strategies to debiase such estimators, e.g., [35,36,60,65]. Roughly speaking, such works introduce a correction term to the LASSO estimator $\hat{x}$ that aims to retrieve $x^0$ from $b = Ax^0 + \varepsilon$ . It is given by $\hat{x}^u = \hat{x} + \frac{1}{m} MA^*(b - A\hat{x})$ , where, for a given sample covariance matrix $\hat{\Sigma} = \frac{A^*A}{m}$ , $M$ should be chosen (as discussed in Sec. 4), such that $M\hat{\Sigma} \approx I_{N \times N}$ . From that, the decomposition + +$$ +\sqrt {m} \left(\hat {x} ^ {u} - x ^ {0}\right) = \frac {1}{\sqrt {m}} M A ^ {*} \varepsilon - \sqrt {m} \left(M \hat {\Sigma} - I _ {N \times N}\right) \left(\hat {x} - x ^ {0}\right), \tag {3} +$$ + +where $\frac{1}{\sqrt{m}} MA^{*}\varepsilon \sim \mathcal{N}(0,\sigma^{2}M\hat{\Sigma} M^{*})$ , follows. The work [36] showed that in the not realistic case of a measurement process $A$ being described by a real Gaussian matrix with known covariance matrix $\Sigma$ , the remainder term $\sqrt{m}(M\hat{\Sigma} - I_{N\times N})(\hat{x} - x^0)$ vanishes with probability converging to 1 as $m = m(N) \to \infty$ provided $m \geq Cs\sqrt{\log N}$ for a constant $C > 0$ . This means that, given a certain noise level, the difference between this new estimator and the underlying image, $\hat{x}^u - x^0$ , is approximately a Gaussian variable. Such distance can be quantified in a non-asymptotic way, which means that non-asymptotic sharp confidence intervals can be derived for such an estimator. In the case of realistic measurement operators given by a subsampled Fourier matrix, the works [28, 29] proved that the remainder term in $\ell_1$ -regularization also vanishes under slightly stronger assumptions in the number of acquired k-space points as compared to the case of Gaussian measurements. From that, confidence intervals for sparse MR images can be constructed but only in the context of $\ell_1$ -regularized recovery. In particular, these results do not cover variational approaches such as the total variation minimization problem Eq. (2), which continues to be the method of choice for many applications due to its simplicity and good numerical performance and which also plays a foundational role for many machine learning approaches to MRI recovery in realistic settings, as discussed in Section 2. + +In this paper, we step towards closing this gap by leveraging previous debiasing approaches to quantify the uncertainty for MR images recovered from undersampled data via the variational problem Eq. (2). We introduce the estimator in Sec. 4 and establish non-asymptotic confidence intervals for every pixel of the image to be retrieved in Sec. 5. In Sec. 6, we discuss the role of noise estimation in MRI, and, finally, in Sec. 7, we numerically illustrate our findings on in vivo brain data. + +# 4 Debiased Total Variation Estimator + +Since most MR images are not sparse in the pixel domain, the standard debiased LASSO is limited in practice. Thus, inspired by [28, 29], we propose to use a + +Algorithm 1 Construction of correction matrix $M$ +1: Input: Sampling mask $P$ , regularization parameters $\lambda_1 \dots \lambda_N$ +2: For $i \in [N]$ solve $\hat{x}^i \gets \min_{x \in \mathbb{C}^{N-1}} \frac{1}{2m} \left\| (\mathcal{P}\mathcal{F})_i - (\mathcal{P}\mathcal{F})_{-i} x \right\|_2^2 + \lambda_i \| x \|_1$ +3: Set $\hat{T}^2 = \mathrm{diag}\left(\overline{\hat{r}_1^2}, \ldots, \overline{\hat{r}_N^2}\right)$ with $\hat{r}_i^2 = \frac{1}{m} \left((\mathcal{P}\mathcal{F})_i - (\mathcal{P}\mathcal{F})_{-i} \hat{x}^i\right)^*\left(\mathcal{P}\mathcal{F}\right)_i$ +4: For $i \in [N]$ let $\hat{c}^i \in \mathbb{C}^N$ , set $\hat{c}_j^i = -\hat{x}_j^i$ for $j < i$ , $\hat{c}_j^i = -\hat{x}_{j-1}^i$ for $j > i$ and $\hat{c}_i^i = 1$ . +5: Set $\hat{C} = (\hat{c}^1, \dots, \hat{c}^N)^T \in \mathbb{C}^{N \times N}$ +6: Compute $M = \hat{T}^{-2}\hat{C}$ +7: Output: Correction matrix $M$ + +debiased TV estimator of the form $\hat{x}^u = \hat{x} +\frac{1}{m} M(P\mathcal{F})^* (b - P\mathcal{F}\hat{x})$ , where $\hat{x}$ denotes the solution of Eq. (2). The decomposition + +$$ +\sqrt {m} \left(\hat {x} ^ {u} - x ^ {0}\right) = \frac {1}{\sqrt {m}} M (P \mathcal {F}) ^ {*} \varepsilon - \sqrt {m} \left(M \hat {\Sigma} - I _ {N \times N}\right) (\hat {x} - x ^ {0}). \tag {4} +$$ + +consists of a remainder term $R \coloneqq \sqrt{m} (M\hat{\Sigma} - I_{N\times N})(x^0 - \hat{x})$ and of $W \coloneqq \frac{1}{\sqrt{m}} M(P\mathcal{F})^{*}\varepsilon$ which is complex Gaussian distributed with zero mean and covariance matrix $\frac{\sigma^2}{m} M(P\mathcal{F})^{*}(M(P\mathcal{F})^{*})^{*} = \sigma^2 M\hat{\Sigma} M^{*}$ due to the Gaussian distribution of the noise. The remainder term vanishes provided that, for a given correction matrix $M$ , the term $\max_{ij\in [N]}|(M\hat{\Sigma} - I_{N\times N})_{ij}|$ is small and that the solution to the variational problem Eq. (2) accurately describes the underlying image, i.e., $x^0 - \hat{x}$ is small. + +The so-called nodewise LASSO, here adapted to complex subsampled Fourier matrices, and described in Algorithm 1, guarantees that $\max_{ij\in [N]}|(M\hat{\Sigma} -I_{N\times N})_{ij}|$ is small [36,60]. There, $(\mathcal{PF})_i$ denotes the $i$ -th column of the matrix $(\mathcal{PF})$ and $(\mathcal{PF})_{-i}$ denotes this matrix without the $i$ -th column. For the latter, i.e., to understand when $x^0 -\hat{x}$ is small, a series of works, e.g., [39,48,49] and [7, Theorem 17.5] show that TV minimization provably retrieves a gradient-sparse image. The above results combined lead to the construction of pixel-wise sharp confidence intervals as described in Sec. 5. A remarkable advantage of such estimators is that once the image is retrieved as a solution to a convex optimization problem, one only needs to add the term $\frac{1}{m} M(P\mathcal{F})^{*}(b - P\mathcal{F}\hat{x})$ to the estimator $\hat{x}$ in order to obtain confidence intervals. The inexpensive cost of such a debiased strategy comes from the fact that, for a given subsampling pattern $\mathcal{P}$ , the matrix $M$ needs to be computed only once, and it is independent of the image and the noise level. + +# 5 Confidence Intervals Implementation + +The construction of confidence intervals relies on the asymptotic normality of the debiased TV estimator. If the remainder term is small, then + +$$ +\sqrt {m} (\hat {x} ^ {u} - x ^ {0}) \sim \mathcal {C N} (0, \sigma^ {2} M \hat {\Sigma} M ^ {*}). \tag {5} +$$ + +The goal is to derive a confidence interval for every pixel. We start with a confidence region $C_i(\alpha)$ for the complex pixel value $x_{i}^{0}$ that depends on the significance level $\alpha \in (0,1)$ , such that + +$$ +\mathbb {P} \left(x _ {i} ^ {0} \in C _ {i} (\alpha)\right) \geq 1 - \alpha \quad \text {f o r e v e r y i m a g e} x ^ {0}, \tag {6} +$$ + +where $\mathbb{P}$ denotes the probability due to the random noise. According to Eq. (5), the new estimator $\hat{x}^u$ induces a complex Gaussian distribution on the difference $\hat{x}^u - x^0$ . This means that it is possible to derive confidence intervals for the magnitude and the phase of the MR images. Since both the real part and the imaginary part are Gaussian distributed, the absolute value $|\hat{x}_i^u - x_i^0| = \sqrt{\Re(\hat{x}_i^u - x_i^0)^2 + \Im(\hat{x}_i^u - x_i^0)^2}$ follows a Rician distribution with zero-mean. This special case simplifies to a Rayleigh distribution with variance $\sigma \cdot \sqrt{(M\hat{\Sigma}M^*)_{ii}}$ [8]. The corresponding radius $\delta_i$ of the confidence region $C_i(\alpha)$ is given by + +$$ +\delta_ {i} (\alpha) = \frac {\sigma \sqrt {\log (1 / \alpha)}}{\sqrt {m} \sqrt {(M \hat {\Sigma} M ^ {*}) _ {i i}}}. \tag {7} +$$ + +Therefore, $C_i(\alpha)$ is a circle centered around the debiased TV reconstruction $\hat{x}_i^u$ with radius $\delta_i(\alpha)$ , i.e. $C_i(\alpha) = \{z \in \mathbb{C} \mid |z - \hat{x}_i^u| \leq \delta\}$ . The confidence intervals for the magnitude, which is what is typically visualized by radiologists, can be constructed due to the following inequality: + +$$ +\mathbb {P} \left(| x _ {i} ^ {0} | \in [ | \hat {x} _ {i} ^ {u} | - \delta_ {i} (\alpha), | \hat {x} _ {i} ^ {u} | + \delta_ {i} (\alpha) ]\right) \geq \mathbb {P} \left(x _ {i} ^ {0} \in C _ {i} (\alpha)\right) \geq 1 - \alpha . \tag {8} +$$ + +Hence, the $1 - \alpha$ confidence interval for the magnitude is given by $J_{i}(\alpha) = [|\hat{x}_{i}^{u}| - \delta_{i}(\alpha), |\hat{x}_{i}^{u}| + \delta_{i}(\alpha)]$ . Please note, however, that the confidence regions are given in the complex plane. This means that we could also have CIs for the phase $\varphi^0$ of the image, which contains information, e.g., on motion or electromagnetic properties of biological tissues [55]. With the same argument as in Eq. (8), and by denoting $\hat{\varphi}_i \coloneqq \arcsin \left(\frac{\Re(\hat{x}_i^u)}{|\hat{x}_i^u|}\right)$ and $\gamma_i = \arccos \left(1 - \frac{\delta_i^2}{2|\hat{x}_i^u|^2}\right)$ , we obtain + +$$ +\mathbb {P} \left(\varphi_ {i} ^ {0} \in [ \hat {\varphi} _ {i} - \gamma_ {i}, \hat {\varphi} _ {i} + \gamma_ {i} ]\right) \geq 1 - \alpha . \tag {9} +$$ + +For a detailed derivation of the confidence intervals, refer to Section 2 of the supplementary material. This paper focuses on visualizing magnitudes, so we adhere to the confidence intervals presented in Equation 8. + +Rigorously, Eq. (6) should be interpreted in the following way: The random quantity in Eq. (6) is the confidence region $C_i(\alpha)$ since it is based on the debiased TV estimator, which, in turn, is reconstructed by data that is affected by random noise. In contrast, the underlying image $x_i^0$ is fixed. Therefore, one should consider an experiment that is conducted $l$ times, and every time the noise is different, it leads to a (slightly) different reconstruction. Hence, also to a (slightly) different confidence interval. In the end, the confidence region will contain the underlying image in at least $1 - \alpha$ of the $l$ cases. + +# Algorithm 2 Confidence intervals for MR images + +1: Input: Sampling mask $\mathcal{P}$ , k-space data $b$ , regularization parameter $\mu$ , (estimated) noise level $\hat{\sigma}$ , significance level $\alpha$ , correction matrix $M$ +2: solve $\hat{x}\gets \min_{x\in \mathbb{C}^N}\frac{\mu}{2}\| b - \mathcal{P}Fx\|_2^2 +\| x\|_{TV}$ +3: debias reconstruction $\hat{x}^u\gets \hat{x} +\frac{1}{m} M(\mathcal{PF})^* (b - \mathcal{PF}\hat{x})$ +4: For each pixel $i$ compute radius $\delta_{i}\gets \frac{\hat{\sigma}}{\sqrt{m}\sqrt{(M\hat{\Sigma}M^{*})_{ii}}}\sqrt{\log(1 / \alpha)}$ with covariance matrix $\hat{\Sigma} = (\mathcal{P}\mathcal{F})^{*}(\mathcal{P}\mathcal{F}) / m$ +5: For each pixel $i$ obtain confidence circle $C_i(\alpha) \gets \{z \in \mathbb{C} \mid |z - \hat{x}_i^u| \leq \delta\}$ +6: For each pixel $i$ compute its confidence interval for the magnitude $J_{i}(\alpha) \gets [|\hat{x}_{i}^{u}| - \delta_{i}(\alpha), |\hat{x}_{i}^{u}| + \delta_{i}(\alpha)]$ +7: Output: Reconstructions $\hat{x}$ , $\hat{x}^u$ and confidence circles $C_i(\alpha)$ for $x_i^0$ and confidence intervals $J_i(\alpha)$ for the magnitude $|x_i^0|$ for every pixel $i$ + +Imaging with confidence, summarized in Algorithm 2, computes confidence intervals for the given pixels of an image retrieved via total variation minimization. More precisely, we propose an estimator that has an asymptotic Gaussian distribution, and from that, we derive pixel-wise uncertainty quantification for the magnitude and the phase of MR images. To visualize such a UQ procedure, we choose lines in the image, draw the confidence intervals, and measure the hit rate of how many pixels lie inside the given interval. + +# 6 Estimating the Noise Level + +Despite advances in hardware and image acquisition techniques for MRI, the problem of noise in MR images persists, making noise estimation and analysis crucial tasks in MR image reconstruction [8]. Notably, MR noise estimation increases in complexity if advanced MR reconstruction approaches (e.g. parallel imaging) are employed and, especially, if the underlying individual coil raw data is not available. This is the default case for the clinical use of MRI since usually, only the magnitude data of the image after reconstruction is stored in clinical databases for diagnostic purposes. For our conceptual work on UQ, we ensured the consistent availability of the MR raw data by obtaining it directly from the MR scanner. Therefore, we were able to utilize image regions without imaging objects to retrieve the Gaussian distributed noise characteristics directly, obtaining noise levels of $5\% - 15\%$ for the available data. For future implementation on any MR scanners, our proposed method for UQ can be directly amended to the regular image reconstruction when raw data is still available. + +# 7 Numerical Experiments + +We numerically illustrate our imaging with confidence method by applying it to obtain pixel-wise confidence intervals for clinically feasible MR images reconstructed from noisy measurements. In line with our discussion above, we work + +with noise levels between $6\%$ and $12.5\%$ . We retrieve the image by minimizing the TV-regularized objective, Eq. (2), and we consider two different sampling schemes, radial and spiral sampling, which are both among the most popular for MRI applications. The code for reproducing all the experiments is available on GitHub7. More information about the implementation can be found in the supplementary material in Section 3. + +The radial k-space masks were generated according to the golden angle radial scheme proposed by [63]. Each mask is created by adding lines going through the center of the mask by placing a new line in an angle of $111.246^{\circ}$ (the golden angle) to the previously added one. As for the latter, k-space masks for spiral sampling were generated by first simulating readout gradients in 2D and computing the resulting k-space trajectories. The trajectories were regridded to the Cartesian grid and transformed to boolean masks. Undersampling factors were adjusted by changing the number of spokes and fine-tuned by adjusting the maximum radius $\sqrt{(k_x^2 + k_y^2)}$ . Again, individual spokes were rotated by the golden angle relative to the previous one. Each spiral spoke forms a $3/4$ rotation. The masks were fit to the size of our images, i.e., $156 \times 156$ . + +As we will observe below, the confidence intervals appropriately capture the difference between ground truth and reconstruction, as predicted. Note that in the plots displaying this finding, the ground truth is only added as a comparison to assess UQ but never used for designing our method. + +# 7.1 UQ for in vivo Complex MRI Data + +To assess UQ in realistic scenarios, we simulate the MRI data acquisition and reconstruction process using in vivo data as the underlying ground truth image, see Fig. 1a. We use existing in vivo data acquired with an inversion recovery spin echo (IR-SE) sequence with single-shot spiral readout as described by the works [19, 46]. Brain data of a healthy 32-year-old female were acquired on a Siemens Magnetom Skyra Connectome 3T system with a 32-channel head coil8 with a matrix of $156 \times 156$ . Images with complex (magnitude and phase) data were reconstructed using an oversampled ridge-regression estimator that uses a higher order signal model that accounts for spatio-temporal field dynamics [50, 61, 62]. This high-quality complex-valued reconstruction serves as ground truth data for validating our uncertainty quantification method. Moreover, all in vivo scans were performed in accordance with local ethics guidelines and the Institutional Review Board (IRB) after obtaining the volunteer's written informed consent. + +The data acquisition process in the MRI scanner is simulated by taking the 2D Fourier transform of the image, adding Gaussian noise with noise level $\sigma = 0.1$ (see Fig. 1b) and subsampling this k-space data using the spiral and radial sampling scheme, respectively. The sampling masks are visualized in Fig. 1c for $43\%$ spiral subsampling and in Fig. 1d for $50\%$ radial subsampling. These subsampling rates are inspired by studies about the limitations of compressive sensing + +approaches for MRI based on expert Radiologists' scoring [34]. The resulting relative noise levels are $\frac{\|\varepsilon\|_2}{\|\mathcal{P}\mathcal{F}x^0\|_2} \approx 6.5\%$ for spiral and $7\%$ for radial sampling. + +Since the sampling patterns are fixed, we calculate, for both masks, the matrix $M$ according to Algorithm 1 with $\lambda_{1} = \ldots = \lambda_{N} = 0.0035 \cdot \frac{\sqrt{m}}{\sqrt{12\log(N)}}$ using FISTA [10] with 1000 iterations. The dimensional scaling $\frac{\sqrt{m}}{\sqrt{12\log(N)}}$ comes from theoretical works on debiased estimators, e.g., [28]. The constant 0.0035 was found via cross-validation. To reconstruct the image by the subsampled spiral and radial data, respectively, we solve Eq. (2) with the Split-Bregman algorithm [24] since it allows for complex-valued solutions. We use the parameters $\hat{\mu} = \frac{\mu}{20}$ , $\lambda_{1} = \lambda_{2} = 0.05$ . For further information on the parameters and the optimization problem, see Section 1 of the supplementary material. The parameter $\mu = \frac{\sqrt{m}}{\sigma\sqrt{12\log N}}$ was theoretically calculated for a subsampled Fourier matrix in [28]. After this reconstruction step, we compute the debiased TV estimator according to Algorithm 2. + +![](images/4890f1640d322c7e525512ddb152fe338953b256a6cbc3121031952410435df9.jpg) +(a) + +![](images/809a116ee2fca079c28506475ba8c1c13f75bf6050ddc907d3faef2446757d1c.jpg) +(b) +Fig. 1: Model of experimental setting 1a: Magnitude of complex ground truth data 1b: Full k-space affected by Gaussian noise with noise level $\sigma = 0.1$ 1c: Spiral subsampling mask which samples $43\%$ of k-space 1d: Radial subsampling mask which samples $50\%$ of k-space. + +![](images/872e858ac8f0bd870313abb42da17c61e8daa28502865cb23d2f59ca73bef9f0.jpg) +(c) + +![](images/fdbd8334e0e71111b8a41b918ef9bab789d2c1bac75e94e2786b76ba7e2cbc11.jpg) +(d) + +To examine the distribution of the debiased TV estimator, a Q-Q plot (see Fig. 2d) compares the quantiles of the input sample, i.e. every component $\frac{\sqrt{2m}\Re(\hat{x}^u - x^0)_i}{\sigma\cdot\sqrt{(M\hat{\Sigma}M^*)_{ii}}}$ with the quantiles of a standard Gaussian distribution. It indeed confirms that the input is Gaussian distributed. Since the same is true for the imaginary part, it holds that $\sqrt{m} (\hat{x}^u -x^0)\sim \mathcal{CN}(0,\sigma^2 M\hat{\Sigma} M^*)$ , which means that the error of the debiased TV follows a Gaussian distribution with mean zero and covariance structure $\sigma^2 M\hat{\Sigma} M^*$ . The same behavior can be observed for radial sampling. The Q-Q plot is shown in Fig. 4d. + +Algorithm 2, then, constructs confidence regions for the complex pixel values from which confidence intervals for the magnitudes and phases can be derived by using the fact that the new debiased estimator follows a Gaussian distribution given by $\sqrt{m}\hat{x}^u\sim \mathcal{CN}(\sqrt{m} x^0,\sigma^2 M\hat{\Sigma} M^*)$ . Here, we choose the confidence level $\alpha = 0.05$ . For clarity, we show confidence intervals for all the pixels, corresponding to magnitudes, lying in a small rectangular region in the image. See Fig. 2a together with the corresponding confidence intervals in Figs. 2b and 2c in the + +![](images/32eefc2d693801bd0fadb6f5bc67a2669b2e6c252717f3e5200130dd3c9a77ca.jpg) +(a) + +![](images/d0cd0ad537c3861054b0d62bf1f83f24b56552077dd5f25d77217e3e3d712ea5.jpg) +(b) + +![](images/50dc5c0ff14a24614ed1b37a91a4e75488372ce439f0c6b5e3f19cd936353dd9.jpg) +(c) + +![](images/876f3efca43320f84dc47b549230c2f2e80f59fa933c59319ff258bbc42acb49.jpg) +(d) +Fig. 2: Confidence intervals for $43\%$ spiral sampling 2a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 2b & 2c: $95\%$ confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values, the blue circles are the corresponding estimates of the debiased TV estimator. 2b is for a reconstruction with $6.5\%$ noise and 2c is for a reconstruction with $10\%$ noise. 2d: Q-Q plot for input samples $\frac{\sqrt{2m(\hat{x}^u - x^0)_i}}{\sigma\cdot\sqrt{(M\Sigma M^*)_{ii}}}$ . + +![](images/e6c910f9fbea2913f4efc6ce59301a3470f45e5b0b03820c295b7c371a45dc11.jpg) +(a) + +![](images/051347887c26b70f23e67840f4a640a0aaeeb00b107d9e8baceb5879e78a1476.jpg) +(b) +Fig. 3: Empirical probability $\hat{\mathbb{P}}_i(\alpha) = \frac{1}{100}\sum_{j=1}^{100}\mathbb{1}_{\{x_i^0 \in C_i(\alpha, \varepsilon^{(j)})\}}$ for every image pixel each time with a different realization 3a for $43\%$ spiral undersampling and for 3b for $50\%$ radial undersampling. + +spiral undersampling setting as well as Figs. 4a, 4b and 4c for the radial case, respectively. + +Interpretation of the UQ Procedure. The quality of the confidence regions is quantified by counting how many confidence regions contain the true ground truth pixel value $x_{i}^{0}$ on and off the support. These hit rates are calculated for one realization of the noise by $h = \frac{1}{N}\sum_{i=1}^{N}\mathbb{1}_{\{x_{i}^{0}\in C_{i}\}}$ and $h_{S} = \frac{1}{s}\sum_{i\in \mathrm{supp}(x^{0})}\mathbb{1}_{\{x_{i}^{0}\in C_{i}\}}$ , where $s$ denotes the amount of pixels that are different from zero. But in view of the interpretation of a confidence interval as described in Sec. 5, we also estimate the probability $\mathbb{P}(x_i^0\in C_i(\alpha))$ by the empirical probability $\hat{\mathbb{P}}_i(\alpha) = \frac{1}{100}\sum_{j=1}^{100}\mathbb{1}_{\{x_i^0\in C_i(\alpha,\varepsilon^{(j)})\}}$ for every pixel $i\in [0,156]^2$ with $\varepsilon^{(j)}$ denoting the dependency on the $j$ -th realization of the noise. In contrast to the hit rates, which are computed for one realization of the noise over all pixels, here we fix a pixel and observe how often the random confidence regions contain this pixel averaged over 100 different realizations of the noise. The image containing the empirical probability values for all pixels is shown in Fig. 3a for the spiral and in Fig. 3b for the radial case, respectively. In both cases, the maps seem to contain residual image information. In the spiral setting, the empirical probabil- + +![](images/6c48d9ca62eea90a5a5884568b7d87f23a6000813b00df3fd29f39388eb0fd17.jpg) +(a) + +![](images/03dbff1f707b60e2733f3b1cc26c35319053755c7974f95fd38e9caa9825952e.jpg) +(b) + +![](images/1b26f132987653767a3a0d4f710f4b063e9041044ca3a49fc20cfc9bcf84c370.jpg) +(c) + +![](images/8b151787925b3e935a5c76abe8f5ea44adcd9df909790454cecd7a1c5d4f8247.jpg) +(d) +Fig. 4: Confidence intervals for $50\%$ radial sampling 4a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 4b & 4c: $95\%$ confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values and the blue circles are the corresponding estimates of the debiased TV estimator. 4b is for a reconstruction with $7\%$ noise and 4c is for a reconstruction with $10.5\%$ noise. 4d: Q-Q plot for input samples $\frac{\sqrt{2m}\Re(\hat{x}^u - x^0)_i}{\sigma\cdot\sqrt{(M\Sigma M^*)_{ii}}}$ . + +ity averaged over all support pixels is $90.64\%$ , the one averaged over all pixels is $93.82\%$ . For the radial case, the values are $91.95\%$ and $94.20\%$ , respectively. + +# 7.2 Qualitative Evaluation + +The general idea of debiasing, is that after the transformation, the reconstruction error can be decomposed as $\hat{x}^u - x^0 = R + W$ , where $R$ is a small residual term and the dominating term $W$ is Gaussian distributed. In fact, by inspecting Fig. 5, it is possible to visualize this debiasing step. On the one hand, the difference between the biased solution of Eq. (2) (see its magnitude in Fig. 5a for spiral and in Fig. 5e for radial sampling) and the ground truth has a very structured error, i.e. $|\hat{x} - x^0|$ still displays much of the brain structure, which can be seen in Figs. 5b and 5f. On the other hand, the difference between the unbiased estimator (see its magnitude in Fig. 5c for spiral and Fig. 5g for radial sampling) and the ground truth in Figs. 5d and 5h is much more unstructured, and one can see that it is dominated by random noise. Moreover, as we increase the number of k-space points or we increase the noise, this difference becomes more unstructured. The distribution can be measured in the Q-Q plots in Figs. 2d and 4d, which, indeed, shows the Gaussianity of $\hat{x}^u - x^0$ . + +To test our findings, the same experiment as in Sec. 7.1 is conducted 100 times, each time with a different realization of the noise vector $\varepsilon$ . In the spiral case, we do so for the subsampling rates $43\%$ and $62\%$ , and in the radial setting, we choose the masks according to $50\%$ , $70\%$ , and $90\%$ k-space undersampling. For every mask, we select $\sigma \in \{0.1, 0.15\}$ resulting in relative noise levels $\frac{\|\varepsilon\|_2}{\|P\mathcal{F}x^0\|_2}$ between 0.06 and 0.125. In these settings the $\ell_2$ and $\ell_{\infty}$ -norm of the errors $\hat{x} - x^0$ and $\hat{x}^u - x^0$ , of the bias term $R \coloneqq (M\hat{\Sigma} - I_{N\times N})(\hat{x} - x^0)$ and of the Gaussian term $W \coloneqq \frac{1}{m} M(P\mathcal{F})^*\varepsilon$ are computed and averaged. The resulting quantities, including a more detailed analysis, can be found in Table 1 (spiral) and in Table 2 (radial) in Section 3 in the supplementary material. + +With these results we numerically verify that $\| R\|_{\infty}$ is small as compared to $\| W\|_{\infty}$ . Since the goal is to have pixel-wise confidence intervals, obtaining + +![](images/8a8f53d21a0ed50846653ac1f7937b5f80fb619a31c2c92a649ae9ab7bc36e98.jpg) +(a) + +![](images/1b86d20d0b40fc253e1059edd61b2fb7b404892f4726f9c6aa2a44deb0524bdf.jpg) +(b) + +![](images/a40fa0d2f388526cbb2a9af46dbf2c0271800fead35f550e5317db11617145a9.jpg) +(c) + +![](images/836bf2e23a5d04897e413c596a61c438684e679193a2094c6ecf8ce2b4445e63.jpg) +(d) + +![](images/afab2938762ee598d6d8c810b202e5cd242e36f42b3ef826be5c1750fbec9abe.jpg) +(e) + +![](images/9ecccc3b86ede66c5ade96dc28e62824cadfd7b3d023436551d61c7bca9f65a7.jpg) +(f) + +![](images/d1ed20ab286267318954ca6c45b185350a46b90d9d48eac88fc487bebf00ea91.jpg) +(g) +Fig. 5: Reconstruction and debiasing visualization for spiral mask with $43\%$ subsampling and $6.5\%$ noise in the first row and for radial mask with $50\%$ subsampling and $7\%$ noise in the second row 5a & 5e: TV Reconstruction 5b & 5f: Magnitude of difference between ground truth and TV estimator 5c & 5g: Debiased TV Reconstruction, the small enlargement at the top of the image visualizes the noise in the background 5d & 5h: Magnitude of difference between ground truth and debiased TV estimator. + +![](images/952565af1a29e0f7778ba5a281cff8c3b73b3d6fbc263ca28741b5e58c12ac6b.jpg) +(h) + +estimators for which the residual is small in the $\ell_{\infty}$ -norm is crucial. In the conducted experiments, both the biased and the unbiased estimator have $\ell_{\infty}$ -errors compared to the ground truth that are of similar order. Despite this, and the fact that the $\ell_{2}$ -error is even larger in the debiased case, the debiasing significantly reduces the non-quantifiable $\ell_{\infty}$ -error $\| \hat{x} - x^0 \|_{\infty}$ . This is the error for which no statistical information is available in closed form. Indeed, after the reconstruction given by solving Eq. (2) and applying the debiased procedure, the error is given by $\hat{x}^u - x^0 = R + W$ . Since, due to our method, $R$ is much smaller than $W$ , which is Gaussian distributed, we can use the latter for the UQ. + +The error ratio between the norm of $R$ and of $W$ depends on the quality of the solution of Eq. (2). The more data is available, i.e., the larger $m$ , the better the reconstruction and the better the error ratio, reflected in the confidence interval quality. A similar behavior is observed for the noise level added to the data. The norm of the Gaussian vector $W$ depends linearly on the noise level $\sigma$ . However, the reconstruction error does not seem to decrease at the same rate. This is related to the matrix difference $M\hat{\Sigma} - I_{N\times N}$ , which is independent of the noise level and hence, does not decrease when the noise decreases. We also test our method on real valued brain, prostate and knee images for multiple patients, the results of those experiments are available in Section 3 of the supplementary material. + +# 7.3 Discussion + +As shown in the experiments above, our method for imaging with confidence is able to provide $95\%$ confidence intervals with hit rates above $90\%$ for each pixel. + +We see such results for variational problems like Eq. (2) as particularly promising for the start of a UQ methodology for learned-based methods in MRI and in other applications where deep learning is employed. In particular, the debiasing procedure generates an estimator $\hat{x}^u$ that follows approximately a Gaussian distribution with mean $x^0$ . This estimator enables us to quantify uncertainty for the MR magnitude and phase of the signal. The latter constitutes the base input data for subsequent processing steps, such as the estimation of tissue susceptibilities. + +The size of the given confidence intervals is $\frac{\hat{\sigma}}{\sqrt{m}}$ up to a normalization constant. Intuitively, the more measurements we have, the smaller the range of uncertainty. Also, the dependency on $\hat{\sigma}$ comes from the fact that noisy images are more affected by uncertainty. Since, to the best of the authors' knowledge, we are the first to construct honest confidence intervals for gradient-sparse MR images, there is a lack of comparing results. Still, confidence intervals of the same size are known to be sharp, in the worst-case sense, for similar problems [13]. + +Limitations. One of the caveats of the imaging with confidence method is the estimation of the matrix $M$ for complicated covariance structures given by other sampling schemes such as Lissajous curves [20, 37]. A more involved analysis is necessary in order to apply schemes that are more computationally efficient than the nodewise LASSO. Another crucial point is that since the size of the confidence interval depends on $\hat{\sigma}$ , the method provides meaningless UQ for very noisy regimes, i.e. data with more than $20\%$ noise. Finally, we acknowledge that the method should be tested in other imaging modalities, such as cardiac MRI, chemical shift imaging, or MR fingerprinting. + +# 8 Conclusion + +In this paper, we propose a theory-inspired method for the construction of confidence intervals for fast undersampled MRI. We verify experimentally with in vivo MR data that the resulting confidence intervals are valid, i.e. that they contain the true pixel parameter with high probability. A significant advantage of the proposed method is that its application has very modest computational requirements since it is performed without acquiring further data, no Monte Carlo integration is necessary, and it does not require a prior distribution for the underlying image class. Therefore, our method contributes to a higher level of trustworthiness in medical imaging without increasing the scan time. We see a number of promising directions for follow-up research. Firstly, we intend to explore generalizations of our approach to quantitative MRI [56]. + +Secondly, we intend to extend the method to neural network approaches to MRI, in particular, to variational networks [25] and to vision transformers [38,44]. We feel that powerful methods for UQ are of particular importance here due to the black-box nature of these approaches; they are a key missing building block to make these often much superior methods [51, 64] widely available in clinical applications. + +# Acknowledgments + +We gratefully acknowledge financial support with funds provided by the German Federal Ministry of Education and Research in the grant "SparseMRI3D+: Compressive Sensing und Quantifizierung von Unsicherheiten für die beschleunigte multiparametrische quantitative Magnetresonanztomografie (FZK 05M20WOA)" and funding by the European Union's Horizon 2020 Research and Innovation Programme under Grant Agreement No. 952172. + +# References + +1. ECCV 2022 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2022.github.io/papers/, accessed: 2024-02-26 +2. FDA 510(k) Premarket Notification for HyperSense. https://www.accessdata.fda.gov/scripts/cdrh/CFdocs/CFpmn/pmnn.cfm?ID=K162722, accessed: 2024-02-26 +3. FDA 510(k) Premarket Notification for MAGNETOM Aera and MAGNETOM Skyra. https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/pmn.cfm?ID=K163312, accessed: 2024-02-26 +4. HyperSense: Compressed sensing and other advanced acceleration techniques. https://www.gehealthcare.com/ - /jssmedia/files/us/non-gated/mri/hypersense-booklet.pdf?rev=-1&hash=FAE260A3F4CA0A82E236DEDA5CAD39A6, accessed: 2024-02-26 +5. ICCV 2023 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2023.github.io/papers/, accessed: 2024-02-26 +6. ICML 2021 Workshop: Workshop on Distribution-Free Uncertainty Quantification. https://icml.cc/virtual/2021/workshop/8373, accessed: 2024-02-26 +7. Adcock, B., Hansen, A.C.: Compressive imaging: structure, sampling, learning. Cambridge University Press (2021). https://doi.org/10.1017/9781108377447 +8. Aja-Fernández, S., Vegas-Sánchez-Ferrero, G.: Statistical Analysis of Noise in MRI: Modeling, Filtering and Estimation. Springer, Cham (2016). https://doi.org/10. 1007/978-3-319-39934-8 +9. Angelopoulos, A.N., Bates, S.: A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511 (2021). https://doi.org/10.48550/arXiv.2107.07511 +0. Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM journal on imaging sciences 2(1), 183-202 (2009). https://doi.org/10.1137/080716542 +1. Bellec, P.C., Zhang, C.H.: Debiasing convex regularized estimators and interval estimation in linear models. The Annals of Statistics 51(2), 391 - 436 (2023). https://doi.org/10.1214/22-A0S2243, 10.1214/22-A0S2243 +2. Block, K.T., Uecker, M., Frahm, J.: Undersampled radial MRI with multiple coils. Iterative image reconstruction using a total variation constraint. Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine 57(6), 1086-1098 (2007). https://doi.org/10.1002/mrm.21236 +3. Cai, T.T., Guo, Z.: Confidence intervals for high-dimensional linear regression: Minimax rates and adaptivity. The Annals of Statistics 45(2), 615 - 646 (2017). https://doi.org/10.1214/16-A0S1461 + +14. Chambolle, A., Caseles, V., Cremers, D., Novaga, M., Pock, T., et al.: An introduction to total variation for image analysis. Theoretical foundations and numerical methods for sparse recovery 9(263-340), 227 (2010). https://doi.org/10.1515/9783110226157.263 +15. Condat, L.: Discrete total variation: New definition and minimization. SIAM Journal on Imaging Sciences 10(3), 1258-1290 (2017). https://doi.org/10.1137/16M1075247 +16. Cruz, G., Atkinson, D., Buerger, C., Schaeffter, T., Prieto, C.: Accelerated motion corrected three-dimensional abdominal MRI using total variation regularized SENSE reconstruction. Magnetic resonance in medicine 75(4), 1484-1498 (2016). https://doi.org/10.1002/mrm.25708 +17. Cukur, T., Lustig, M., Nishimura, D.G.: Improving non-contrast-enhanced steady-state free precession angiography with compressed sensing. Magnetic Resonance in Medicine 61(5), 1122-1131 (2009). https://doi.org/10.1002/mrm.21907 +18. Donoho, D.: Blackboard to bedside: How high-dimensional geometry is transforming the MRI industry. Notices of the American Mathematical Society 65(1) (2018). https://doi.org/10.1090/notti1612 +19. Endt, S., Engel, M., Naldi, E., Assereto, R., Molendowska, M., Mueller, L., Mayrink Verdun, C., Pirkl, C.M., Palombo, M., Jones, D.K., Menzel, M.I.: In Vivo Myelin Water Quantification Using Diffusion-Relaxation Correlation MRI: A Comparison of 1D and 2D Methods. Applied Magnetic Resonance 54(11), 1571-1588 (2023). https://doi.org/10.1007/s00723-023-01584-1 +20. Feng, H., Gu, H., Silbersweig, D., Stern, E., Yang, Y.: Single-shot MR imaging using trapezoidal-gradient-based Lissajous trajectories. IEEE transactions on medical imaging 22(8), 925-932 (2003). https://doi.org/10.1109/TMI.2003.815902 +21. Fischer, P., Thomas, K., Baumgartner, C.F.: Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction. In: International Workshop on Uncertainty for Safe Utilization of Machine Learning in Medical Imaging. pp. 84-94. Springer (2023). https://doi.org/10.1007/978-3-031-44336-7_9 +22. Fu, W., Knight, K.: Asymptotics for lasso-type estimators. The Annals of statistics 28(5), 1356-1378 (2000). https://doi.org/DOI:10.1214/aos/1015957397 +23. Giraud, C.: Introduction to high-dimensional statistics. Chapman and Hall/CRC (2021) +24. Goldstein, T., Osher, S.: The split Bregman method for L1-regularized problems. SIAM journal on imaging sciences 2(2), 323-343 (2009). https://doi.org/10.1137/080725891 +25. Hammernik, K., Klatzer, T., Kobler, E., Recht, M.P., Sodickson, D.K., Pock, T., Knoll, F.: Learning a variational network for reconstruction of accelerated MRI data. Magnetic resonance in medicine 79(6), 3055-3071 (2018). https://doi.org/10.1002/mrm.26977 +26. Han, Y., Lee, T.C.: Uncertainty Quantification for Sparse Estimation of Spectral Lines. IEEE Transactions on Signal Processing 70, 6243-6256 (2022). https://doi.org/10.1109/TSP.2023.3235662 +27. Hannig, J., Iyer, H., Lai, R.C., Lee, T.C.: Generalized fiducial inference: A review and new results. Journal of the American Statistical Association 111(515), 1346-1361 (2016). https://doi.org/10.1080/01621459.2016.1165102 +28. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: Uncertainty quantification for sparse Fourier recovery. arXiv:2212.14864 (2022). https://doi.org/10.48550/arXiv.2212.14864 + +29. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: High-Dimensional Confidence Regions in Sparse MRI. In: ICASSP 2023. pp. 1-5 (2023). https://doi.org/10.1109/ICASSP49357.2023.10096320 +30. Hoppe, F., Mayrink Verdun, C., Laus, H., Krahmer, F., Rauhut, H.: Non-Asymptotic Uncertainty Quantification in High-Dimensional Learning. arXiv preprint (2024) +31. Hüllermeier, E., Waegeman, W.: Aleatoric and epistemic uncertainty in machine learning: An introduction to concepts and methods. Machine Learning 110, 457-506 (2021). https://doi.org/10.1007/s10994-021-05946-3 +32. Hütter, J.C., Rigollet, P.: Optimal rates for total variation denoising. In: Conference on Learning Theory. pp. 1115-1146. PMLR (2016) +33. Hyun, C.M., Kim, H.P., Lee, S.M., Lee, S., Seo, J.K.: Deep learning for undersampled MRI reconstruction. Physics in Medicine & Biology 63(13), 135007 (2018). https://doi.org/10.1088/1361-6560/aac71a9 +34. Jaspan, O., Fleysher, R., Lipton, M.: Compressed Sensing MRI: A review of the clinical literature. The British journal of radiology 88, 20150487 (09 2015). https://doi.org/10.1259/bjr.20150487 +35. Javanmard, A., Montanari, A.: Confidence intervals and hypothesis testing for high-dimensional regression. Journal of Machine Learning Research 15, 2869-2909 (2014) +36. Javanmard, A., Montanari, A.: Debiasing the lasso: Optimal sample size for Gaussian designs. The Annals of Statistics 46(6A) (2018). https://doi.org/10.1214/17-A0S1630 +37. Kaethner, C., Erb, W., Ahlborg, M., Szwargulski, P., Knopp, T., Buzug, T.M.: Non-equispaced system matrix acquisition for magnetic particle imaging based on Lissajous node points. IEEE transactions on medical imaging 35(11), 2476-2485 (2016). https://doi.org/10.1109/TMI.2016.2580458 +38. Korkmaz, Y., Yurt, M., Dar, S.U.H., Özbey, M., Cukur, T.: Deep MRI reconstruction with generative vision transformers. In: Machine Learning for Medical Image Reconstruction: 4th International Workshop, MLMIR 2021, Held in Conjunction with MICCAI 2021, Strasbourg, France, October 1, 2021, Proceedings 4. pp. 54-64. Springer (2021). https://doi.org/10.1007/978-3-030-88552-6_6 +39. Krahmer, F., Ward, R.: Stable and robust sampling strategies for compressive imaging. IEEE transactions on image processing 23(2), 612-622 (2013). https://doi.org/10.1109/TIP.2013.2288004 +40. Krahmer, F., Kruschel, C., Sandbichler, M.: Total variation minimization in compressed sensing. In: Compressed Sensing and its Applications: Second International MATHEON Conference 2015. pp. 333-358. Springer (2017). https://doi.org/10.1109/CSE-EUC-DCABES.2016.233 +41. Lai, R.C., Hannig, J., Lee, T.C.: Generalized fiducial inference for ultrahigh-dimensional regression. Journal of the American Statistical Association 110(510), 760-772 (2015). https://doi.org/10.1080/01621459.2014.931237 +42. Liang, Z.P., Lauterbur, P.C.: Principles of magnetic resonance imaging. SPIE Optical Engineering Press Bellingham, WA (2000) +43. Lin, A., Song, A.H., Bilgic, B., Ba, D.: Covariance-free sparse Bayesian learning. IEEE Transactions on Signal Processing 70, 3818-3831 (2022). https://doi.org/10.1109/TSP.2022.3186185 +44. Lin, K., Heckel, R.: Vision transformers enable fast and robust accelerated MRI. In: International Conference on Medical Imaging with Deep Learning. pp. 774-795. PMLR (2022) + +45. Lustig, M., Donoho, D., Pauly, J.M.: Sparse MRI: The application of compressed sensing for rapid MR imaging. Magnetic Resonance in Medicine 58(6), 1182-1195 (2007). https://doi.org/10.1002/mrm.21391 +46. Mueller, L., Rudrapatna, S.U., Tax, C.M., Wise, R., Jones, D.K.: Diffusion MRI with $b = 1000s / \mathrm{mm}2$ at $\mathrm{TE} < 22\mathrm{ms}$ using single-shot spiral readout and ultra-strong gradients: Implications for microstructure imaging. Proceedings of the International Society for Magnetic Resonance in Medicine, 2019. Presented at the ISMRM (2019) +47. Nassirpour, S., Chang, P., Avdievitch, N., Henning, A.: Compressed sensing for high-resolution nonlipid suppressed 1H FID MRSI of the human brain at 9.4 T. Magnetic resonance in medicine 80(6), 2311-2325 (2018). https://doi.org/10.1002/mrm.27225 +48. Needell, D., Ward, R.: Stable image reconstruction using total variation minimization. SIAM Journal on Imaging Sciences 6(2), 1035-1058 (2013). https://doi.org/10.1137/120868281 +49. Poon, C.: On the role of total variation in compressed sensing. SIAM Journal on Imaging Sciences 8(1), 682-720 (2015). https://doi.org/10.1137/140978569, https://doi.org/10.1137/140978569 +50. Pruessmann, K.P., Weiger, M., Börnert, P., Boesiger, P.: Advances in sensitivity encoding with arbitrary k-space trajectories. Magnetic Resonance in Medicine 46(4), 638-651 (2001). https://doi.org/10.1002/mrm.1241 +51. Rastogi, A., Brugnara, G., Foltyn-Dumitru, M., Mahmutoglu, M.A., Preetha, C.J., Kobler, E., Pflüger, I., Schell, M., Deike-Hofmann, K., Kessler, T., et al.: Deep-learning-based reconstruction of undersampled MRI to reduce scan times: a multicentre, retrospective, cohort study. The Lancet Oncology 25(3), 400-410 (2024). https://doi.org/10.1016/S1470-2045(23)00641-1 +52. Roth, S., Black, M.: Fields of Experts: a framework for learning image priors. In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05). vol. 2, pp. 860-867 vol. 2 (2005). https://doi.org/10.1109/CVPR.2005.160 +53. Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena 60(1-4), 259-268 (1992). https://doi.org/10.1016/0167-2789(92)90242-F +54. Saucedo, A., Macey, P.M., Thomas, M.A.: Accelerated radial echo-planar spectroscopic imaging using golden angle view-ordering and compressed-sensing reconstruction with total variation regularization. Magnetic Resonance in Medicine 86(1), 46-61 (2021). https://doi.org/10.1002/mrm.28728 +55. Schweser, F., Deistung, A., Reichenbach, J.R.: Foundations of MRI phase imaging and processing for Quantitative Susceptibility Mapping (QSM). Zeitschrift für medizinische Physik 26(1), 6-34 (2016). https://doi.org/10.1016/j.zemedi.2015.10.002 +56. Shafieizargar, B., Byanju, R., Sijbers, J., Klein, S., den Dekker, A.J., Poot, D.H.: Systematic review of reconstruction techniques for accelerated quantitative MRI. Magnetic Resonance in Medicine (2023). https://doi.org/10.1002/mrm.29721 +57. Tezcan, K.C., Karani, N., Baumgartner, C.F., Konukoglu, E.: Sampling possible reconstructions of undersampled acquisitions in MR imaging with a deep learned prior. IEEE Transactions on Medical Imaging 41(7), 1885-1896 (2022). https://doi.org/10.1109/TMI.2022.3150853 +58. Tibshirani, R.: Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 58(1), 267-288 (1996). https://doi.org/10.1111/j.2517-6161.1996.tb02080.x + +59. Valdenegro-Toro, M.: I find your lack of uncertainty in computer vision disturbing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1263-1272 (2021). https://doi.org/10.1109/CVPRW53098.2021.00139 +60. van de Geer, S., Buhlmann, P., Ritov, Y., Dezeure, R.: On asymptotically optimal confidence regions and tests for high-dimensional models. The Annals of Statistics 42(3) (2014). https://doi.org/10.1214/14-A0S1221 +61. Wilm, B.J., Barnet, C., Gross, S., Kasper, L., Vannesjo, S.J., Haeberlin, M., Dietrich, B.E., Brunner, D.O., Schmid, T., Pruessmann, K.P.: Single-shot spiral imaging enabled by an expanded encoding model: Demonstration in diffusion MRI. Magnetic resonance in medicine 77(1), 83-91 (2017). https://doi.org/10.1002/mrm.26493 +62. Wilm, B.J., Barmet, C., Pavan, M., Pruessmann, K.P.: Higher order reconstruction for MRI in the presence of spatiotemporal field perturbations. Magnetic resonance in medicine 65(6), 1690-1701 (2011). https://doi.org/10.1002/mrm.22767 +63. Winkelmann, S., Schaeffer, T., Koehler, T., Eggers, H., Doessel, O.: An optimal radial profile order based on the Golden Ratio for time-resolved MRI. IEEE transactions on medical imaging 26(1), 68-76 (2006). https://doi.org/10.1109/TMI.2006.885337 +64. Zeng, G., Guo, Y., Zhan, J., Wang, Z., Lai, Z., Du, X., Qu, X., Guo, D.: A review on deep learning MRI reconstruction without fully sampled k-space. BMC Medical Imaging 21(1), 195 (2021). https://doi.org/10.1186/s12880-021-00727-9 +65. Zhang, C.H., Zhang, S.S.: Confidence intervals for low dimensional parameters in high dimensional linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 76(1), 217-242 (2014). https://doi.org/10.1111/rssb.12026 \ No newline at end of file diff --git a/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/images.zip b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..95cf1f6288e2ea3def93bf6295547cdc81a76205 --- /dev/null +++ b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1cfd1226b434f1377faad32f78b58c58aef647b34461a6f43a850fde4cffb6de +size 222585 diff --git a/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/layout.json b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..5af39b1baffdf9b6168c77763ba642bb8e59e002 --- /dev/null +++ b/2024/Imaging with Confidence_ Uncertainty Quantification for High-dimensional Undersampled MR Images/layout.json @@ -0,0 +1,13351 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 173, + 111, + 440, + 166 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 111, + 440, + 166 + ], + "spans": [ + { + "bbox": [ + 173, + 111, + 440, + 166 + ], + "type": "text", + "content": "Imaging with Confidence: Uncertainty Quantification for High-dimensional Undersampled MR Images" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 145, + 186, + 468, + 211 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 186, + 468, + 211 + ], + "spans": [ + { + "bbox": [ + 145, + 186, + 468, + 211 + ], + "type": "text", + "content": "Frederik Hoppe1*, Claudio Mayrink Verdun2*, Hannah Laus3*, Sebastian Endt4, Marion I. Menzel4, Felix Krahmer3, and Holger Rauhut5" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 164, + 219, + 448, + 231 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 219, + 448, + 231 + ], + "spans": [ + { + "bbox": [ + 164, + 219, + 448, + 231 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 164, + 219, + 448, + 231 + ], + "type": "text", + "content": " RWTH Aachen University, Germany hoppe@mathc.rwth-aachen.de" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 178, + 231, + 436, + 241 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 178, + 231, + 436, + 241 + ], + "spans": [ + { + "bbox": [ + 178, + 231, + 436, + 241 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 178, + 231, + 436, + 241 + ], + "type": "text", + "content": " Harvard University, USA claudioverdun@seas.harvard.edu" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 154, + 241, + 459, + 252 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 241, + 459, + 252 + ], + "spans": [ + { + "bbox": [ + 154, + 241, + 459, + 252 + ], + "type": "text", + "content": "3 TU Munich & MCML, Germany {hannah.laus,felix.krahmer}@tum.de" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 187, + 252, + 426, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 252, + 426, + 274 + ], + "spans": [ + { + "bbox": [ + 187, + 252, + 426, + 274 + ], + "type": "text", + "content": "4 TH Ingolstadt, TU Munich & GE HealthCare, Germany {sebastian.endt,Marion.Menzel}@thi.de" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 187, + 274, + 425, + 285 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 274, + 425, + 285 + ], + "spans": [ + { + "bbox": [ + 187, + 274, + 425, + 285 + ], + "type": "text", + "content": "5 LMU Munich & MCML, Germany rauhut@math.lmu.de" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 160, + 317, + 457, + 494 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 317, + 457, + 494 + ], + "spans": [ + { + "bbox": [ + 160, + 317, + 457, + 494 + ], + "type": "text", + "content": "Abstract. Establishing certified uncertainty quantification (UQ) in imaging processing applications continues to pose a significant challenge. In particular, such a goal is crucial for accurate and reliable medical imaging if one aims for precise diagnostics and appropriate intervention. In the case of magnetic resonance imaging, one of the essential tools of modern medicine, enormous advancements in fast image acquisition were possible after the introduction of compressive sensing and, more recently, deep learning methods. Still, as of now, there is no UQ method that is both fully rigorous and scalable. This work takes a step towards closing this gap by proposing a total variation minimization-based method for pixel-wise sharp confidence intervals for undersampled MRI. We demonstrate that our method empirically achieves the predicted confidence levels. We expect that our approach will also have implications for other imaging modalities as well as deep learning applications in computer vision. Our code is available on GitHub https://github.com/HannahLaus/Project_UQ_TV.git." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 159, + 504, + 453, + 526 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 504, + 453, + 526 + ], + "spans": [ + { + "bbox": [ + 159, + 504, + 453, + 526 + ], + "type": "text", + "content": "Keywords: Uncertainty Quantification " + }, + { + "bbox": [ + 159, + 504, + 453, + 526 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 504, + 453, + 526 + ], + "type": "text", + "content": " Imaging Processing " + }, + { + "bbox": [ + 159, + 504, + 453, + 526 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 504, + 453, + 526 + ], + "type": "text", + "content": " Magnetic Resonance Imaging" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 548, + 230, + 560 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 230, + 560 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 230, + 560 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 574, + 482, + 646 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 574, + 482, + 646 + ], + "spans": [ + { + "bbox": [ + 130, + 574, + 482, + 646 + ], + "type": "text", + "content": "In recent years, the field of magnetic resonance imaging, like many other imaging modalities, has undergone a significant paradigm shift towards a unified design of the acquisition-reconstruction pipeline. That is, the data to be acquired is selected based on the computational methods used for reconstruction. A prominent example of this interplay is compressive imaging, where sampling trajectories chosen to be suitable for imaging reconstruction via sparse recovery schemes" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 337, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 337, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 337, + 665 + ], + "type": "text", + "content": "* These authors contributed equally to this work." + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": "allowed for significant undersampling [45]. Later, the same type of subsampling techniques have also proven successful in the context of deep learning reconstructions [33]. Thanks to these approaches, the retrieval of fast, undersampled MRI in clinical settings is now a reality. Indeed, in 2017, the FDA approved the first scanners employing acceleration techniques with compressive sensing [2, 3], and since then, several products and algorithms for retrieving highly undersampled images have emerged. In these advancements, mathematical theory has played a driving role, so this development has sometimes been described as from blackboard to bedside [18]. The main objective driving the design of the reconstruction algorithms is to use nonlinear optimization to find solutions adhering to structural constraints describing real images. These constraints could explicitly arise from a unified model, such as wavelet or gradient sparsity, or be implicitly learned from training data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 279, + 482, + 388 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 279, + 482, + 388 + ], + "spans": [ + { + "bbox": [ + 130, + 279, + 482, + 388 + ], + "type": "text", + "content": "When the measurements are affected by noise, these methods search for solutions adhering to these constraints within the feasibility regions. That is, the imaging recovery method will search in the space of possible solutions and look for reconstructions that resemble natural images, which also makes potential reconstruction artifacts harder to identify. Especially unexpected localized features could correspond to real pathological abnormalities or arise in the interplay of noise and recovery methods. For this reason, quantifying the uncertainty via certified confidence intervals is of increasing importance not only for MRI but for a variety of problems in imaging and computer vision [59]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 395, + 482, + 515 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 395, + 482, + 515 + ], + "spans": [ + { + "bbox": [ + 130, + 395, + 482, + 515 + ], + "type": "text", + "content": "At the same time, classical approaches for assessing the confidence of the solution that could allow to distinguish these two causes, abnormalities and artifacts, are not applicable. The reason is that they typically require some knowledge of the distribution of the random distortion and, consequently, of the generated image. While the measurement error is well modeled by Gaussian noise, the distribution of the resulting distortion in the reconstruction cannot be modeled as easily due to the nonlinearity of the procedure, see, e.g., [22, Theorem 2] and the discussion therein. This poses a significant issue when the reconstructed image is directly employed for downstream tasks, such as automating the extraction of quantitative parameters for clinical analysis." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "Imaging with confidence, a novel rigorous method tailored to UQ: It is only recently that the first attempts to derive non-asymptotic confidence intervals for the pixel values of the reconstruction, without imposing prior knowledge have been successful (see Section 2 for a discussion). So far, most works have focused on sparsity models with respect to some known basis, as they are natural, for example, in angiography and reconstruction via variants of the LASSO [7]. In this work, we leverage these approaches to address the uncertainty quantification problem for recovery via total variation minimization, a standard recovery scheme for MR images in current industrial implementations [4] that has also conceptually inspired various machine learning-based approaches reaching state-of-the-art results such as variational networks [25]. To the best of our knowledge, for the first time, we provide rigorous confidence intervals for un-" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "dersampled acquired MR images and test the results with synthetic and in vivo data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 159, + 238, + 172 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 159, + 238, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 159, + 238, + 172 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 186, + 482, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 186, + 482, + 425 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 482, + 425 + ], + "type": "text", + "content": "There were other attempts available in the literature to tackle the aleatoric uncertainty quantification of high-dimensional parsimonious problems, such as in undersampled imaging generation. For example, a series of works developed the so-called generalized fiducial inference [26, 27, 41]. Such a method creates a relationship between the data and the parameters for which the UQ can be rigorously performed and establishes confidence intervals from such a relationship. However, high-dimensional Monte Carlo makes this method intractable in the high-dimensional imaging regime. Bayesian sparse learning techniques were also developed for undersampled imaging problems [43]. An inherent challenge with the Bayesian approach arises when inappropriate prior distributions, which fail to accurately reflect the prior physical knowledge of the problem, are employed. In such cases, the performance and reliability of the approach may deteriorate. Another line of research on UQ is conformal prediction, which generates distribution-free prediction sets for regression and classification problems [9]. However, choosing the score function in imaging problems can be challenging. Such a technique is more directly applied to epistemic uncertainty rather than to the aleatoric one [31]. Our work builds on the urgency of providing rigorous UQ to imaging problems in computer vision and image processing. Such necessity can be seen in the several workshops for UQ in computer vision and imaging that took place over the last few years dedicated to this theme [1, 5, 6]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "type": "text", + "content": "Our uncertainty quantification extends a line of research about non-asymptotic confidence intervals for high-dimensional problems known as debiased estimators, which was initiated in a series of papers [11,35,60,65]. The key idea is that given an estimator to retrieve noisy image retrieval from a few measurements; one can characterize the distribution of a modified estimator based on the KKT conditions of the underlying inverse problem; see Section 3.2. Such works established sharp confidence intervals for i.i.d. (sub-)Gaussian variables with Gaussian noise by assuming that the object to be retrieved is s-sparse in the canonical basis. However, such variables do not represent typical constraints imposed by the physics behind the acquisition procedure. Later, this was extended to imaging applications, where UQ was rigorously obtained for " + }, + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\ell_1" + }, + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "type": "text", + "content": " model-based MRI [28,29]. In this paper, we harness results for UQ obtained in previous works to more realistic scenarios where the images are reconstructed via the minimization of the total variation semi-norm, an idea introduced in the seminal paper [53]. This imaging retrieval technique was extensively explored in tasks such as inpainting, denoising, and deblurring; see [14, 32] and references therein. This method has been rigorously proven to yield state-of-the-art results in MRI reconstruction - see [40] and [7, Chapter 17] - and was consistently tested in several applications such as parallel imaging [12], free-breathing three-dimensional cardiac MRI [16], non-contrast-enhanced angiography [17], spectroscopy [54] and metabolite maps" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "of the human brain [47], to name a few. Recently, in the context of learning algorithms, the work [57] proposed a latent Bayesian model with a variational autoencoder to obtain posterior distributions for the generated images and the work [21] proposed hierarchical conditional variational autoencoders for UQ, but no theory is available for such methods. Finally, [30] developed a non-asymptotic theory for constructing confidence intervals for high-dimensional learning problems." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 219, + 383, + 233 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 219, + 383, + 233 + ], + "spans": [ + { + "bbox": [ + 132, + 219, + 383, + 233 + ], + "type": "text", + "content": "3 Background: Sparse Imaging Retrieval" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 244, + 481, + 293 + ], + "type": "text", + "content": "In this section, we summarize the tools we need to construct confidence intervals for images. Throughout the paper, we consider the following high-dimensional linear model that is a discretized version of the Bloch equations, which models the MR acquisition process [42]" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 235, + 302, + 481, + 316 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 302, + 481, + 316 + ], + "spans": [ + { + "bbox": [ + 235, + 302, + 481, + 316 + ], + "type": "interline_equation", + "content": "b = \\mathcal {P F} x ^ {0} + \\varepsilon \\quad \\text {w i t h} N \\gg m. \\tag {1}", + "image_path": "07854b23b679cc7ee40c335ada376f73a4cd25248c839232f240b98328eb23b9.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "spans": [ + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "b \\in \\mathbb{C}^m" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " is the k-space data, " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "\\mathcal{P}\\mathcal{F} \\in \\mathbb{C}^{m \\times N}" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " is a subsampled Fourier matrix, " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "x^0 \\in \\mathbb{C}^N" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " is the underlying ground truth image, and " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "\\varepsilon \\sim \\mathcal{CN}(0, \\sigma^2 I_{N \\times N})" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " is complex Gaussian noise. The goal in fast undersampled MRI is to retrieve " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "x^0" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " having " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "m < N" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " k-space measurements " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "b" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " when " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "\\mathcal{P}\\mathcal{F}" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 131, + 324, + 482, + 373 + ], + "type": "text", + "content": " are known." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 391, + 238, + 402 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 391, + 238, + 402 + ], + "spans": [ + { + "bbox": [ + 131, + 391, + 238, + 402 + ], + "type": "text", + "content": "3.1 Total Variation" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "text", + "content": "As described in Sec. 2, several image modalities can be modeled by gradient-sparse images. Also, such guiding principle is behind modern deep learning architectures that learn higher-order statistics of images, e.g., those based on the fields of experts framework [52]. Therefore, we extend the results to the total-variation setting to create rigorous UQ schemes for MRI. More precisely, for a given image " + }, + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "inline_equation", + "content": "x^0 \\in \\mathbb{C}^N" + }, + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "text", + "content": ", we consider the finite gradient operator " + }, + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "text", + "content": " that gives " + }, + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "inline_equation", + "content": "Dx^0 = (x_2^* - x_1^*, \\ldots, x_N^* - x_{N-1}^*)^T \\in \\mathbb{C}^{N-1}" + }, + { + "bbox": [ + 130, + 411, + 482, + 506 + ], + "type": "text", + "content": " and we solve the total variation problem, i.e.," + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 230, + 506, + 481, + 526 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 230, + 506, + 481, + 526 + ], + "spans": [ + { + "bbox": [ + 230, + 506, + 481, + 526 + ], + "type": "interline_equation", + "content": "\\operatorname {a r g m i n} _ {x \\in \\mathbb {C} ^ {N}} \\frac {\\mu}{2} \\| b - \\mathcal {P F} x \\| _ {2} ^ {2} + \\| x \\| _ {T V} \\tag {2}", + "image_path": "414bb5c9306ba9c3a41f9337abad67bfcc4a8c030c79ce5d60f5bfc3e74839ea.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "spans": [ + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "text", + "content": "with a regularization parameter " + }, + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "inline_equation", + "content": "\\mu > 0" + }, + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "text", + "content": " for balancing the data fidelity term " + }, + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "inline_equation", + "content": "\\|b - \\mathcal{P}\\mathcal{F}x\\|_2^2" + }, + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "text", + "content": " and the regularization term " + }, + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "inline_equation", + "content": "\\|x\\|_{TV} \\coloneqq \\|Dx\\|_1" + }, + { + "bbox": [ + 131, + 530, + 482, + 591 + ], + "type": "text", + "content": ", which is referred to as the anisotropic formulation [7]. We use such a formulation due to the resemblance with the LASSO estimator. Still, the same techniques described here hold for other discretizations of the total variation, such as the isotropic one, e.g., see [15]." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 609, + 367, + 621 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 609, + 367, + 621 + ], + "spans": [ + { + "bbox": [ + 131, + 609, + 367, + 621 + ], + "type": "text", + "content": "3.2 Debiased Estimators for Image Retrieval" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "If the underlying image to be retrieved from a few samples is sparse in the canonical basis, several methods in the sparse learning literature can be used, with the LASSO being arguably the most famous one [58]. However, given a certain" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": "noise level " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": ", it is provably impossible to have a practical characterization of the LASSO distribution since it depends on the support of the ground truth, which is not known in advance [22]. Moreover, a bias is introduced by the shrinkage procedure of the " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "\\ell_1" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": "-norm [23, Chapter 4]. Several works in the statistical literature developed strategies to debiase such estimators, e.g., [35,36,60,65]. Roughly speaking, such works introduce a correction term to the LASSO estimator " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "\\hat{x}" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": " that aims to retrieve " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "x^0" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "b = Ax^0 + \\varepsilon" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": ". It is given by " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "\\hat{x}^u = \\hat{x} + \\frac{1}{m} MA^*(b - A\\hat{x})" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": ", where, for a given sample covariance matrix " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "\\hat{\\Sigma} = \\frac{A^*A}{m}" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": " should be chosen (as discussed in Sec. 4), such that " + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "inline_equation", + "content": "M\\hat{\\Sigma} \\approx I_{N \\times N}" + }, + { + "bbox": [ + 130, + 116, + 482, + 228 + ], + "type": "text", + "content": ". From that, the decomposition" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 182, + 232, + 481, + 257 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 182, + 232, + 481, + 257 + ], + "spans": [ + { + "bbox": [ + 182, + 232, + 481, + 257 + ], + "type": "interline_equation", + "content": "\\sqrt {m} \\left(\\hat {x} ^ {u} - x ^ {0}\\right) = \\frac {1}{\\sqrt {m}} M A ^ {*} \\varepsilon - \\sqrt {m} \\left(M \\hat {\\Sigma} - I _ {N \\times N}\\right) \\left(\\hat {x} - x ^ {0}\\right), \\tag {3}", + "image_path": "332c7d1b3eea23f43a54757a6bdc24d95d52f8e4608fc9c097dfbc2d9b50d816.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\frac{1}{\\sqrt{m}} MA^{*}\\varepsilon \\sim \\mathcal{N}(0,\\sigma^{2}M\\hat{\\Sigma} M^{*})" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": ", follows. The work [36] showed that in the not realistic case of a measurement process " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "A" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": " being described by a real Gaussian matrix with known covariance matrix " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\Sigma" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": ", the remainder term " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\sqrt{m}(M\\hat{\\Sigma} - I_{N\\times N})(\\hat{x} - x^0)" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": " vanishes with probability converging to 1 as " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "m = m(N) \\to \\infty" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": " provided " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "m \\geq Cs\\sqrt{\\log N}" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": " for a constant " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "C > 0" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": ". This means that, given a certain noise level, the difference between this new estimator and the underlying image, " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\hat{x}^u - x^0" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": ", is approximately a Gaussian variable. Such distance can be quantified in a non-asymptotic way, which means that non-asymptotic sharp confidence intervals can be derived for such an estimator. In the case of realistic measurement operators given by a subsampled Fourier matrix, the works [28, 29] proved that the remainder term in " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\ell_1" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": "-regularization also vanishes under slightly stronger assumptions in the number of acquired k-space points as compared to the case of Gaussian measurements. From that, confidence intervals for sparse MR images can be constructed but only in the context of " + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\ell_1" + }, + { + "bbox": [ + 130, + 262, + 482, + 491 + ], + "type": "text", + "content": "-regularized recovery. In particular, these results do not cover variational approaches such as the total variation minimization problem Eq. (2), which continues to be the method of choice for many applications due to its simplicity and good numerical performance and which also plays a foundational role for many machine learning approaches to MRI recovery in realistic settings, as discussed in Section 2." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 491, + 482, + 575 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 482, + 575 + ], + "type": "text", + "content": "In this paper, we step towards closing this gap by leveraging previous debiasing approaches to quantify the uncertainty for MR images recovered from undersampled data via the variational problem Eq. (2). We introduce the estimator in Sec. 4 and establish non-asymptotic confidence intervals for every pixel of the image to be retrieved in Sec. 5. In Sec. 6, we discuss the role of noise estimation in MRI, and, finally, in Sec. 7, we numerically illustrate our findings on in vivo brain data." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 590, + 366, + 604 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 590, + 366, + 604 + ], + "spans": [ + { + "bbox": [ + 131, + 590, + 366, + 604 + ], + "type": "text", + "content": "4 Debiased Total Variation Estimator" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 611, + 482, + 636 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 611, + 482, + 636 + ], + "spans": [ + { + "bbox": [ + 130, + 611, + 482, + 636 + ], + "type": "text", + "content": "Since most MR images are not sparse in the pixel domain, the standard debiased LASSO is limited in practice. Thus, inspired by [28, 29], we propose to use a" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "text", + "content": "6 The notation " + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "inline_equation", + "content": "m(N)" + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "text", + "content": " considers a sequence of regression problems, where both dimensions " + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "text", + "content": " are growing with the rate " + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\frac{s\\sqrt{\\log N}}{m} \\to 0" + }, + { + "bbox": [ + 133, + 640, + 481, + 667 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 136, + 130, + 474, + 219 + ], + "blocks": [ + { + "bbox": [ + 133, + 116, + 361, + 128 + ], + "lines": [ + { + "bbox": [ + 133, + 116, + 361, + 128 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 361, + 128 + ], + "type": "text", + "content": "Algorithm 1 Construction of correction matrix " + }, + { + "bbox": [ + 133, + 116, + 361, + 128 + ], + "type": "inline_equation", + "content": "M" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "lines": [ + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "spans": [ + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": "1: Input: Sampling mask " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "P" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": ", regularization parameters " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\lambda_1 \\dots \\lambda_N" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " \n2: For " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "i \\in [N]" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " solve " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{x}^i \\gets \\min_{x \\in \\mathbb{C}^{N-1}} \\frac{1}{2m} \\left\\| (\\mathcal{P}\\mathcal{F})_i - (\\mathcal{P}\\mathcal{F})_{-i} x \\right\\|_2^2 + \\lambda_i \\| x \\|_1" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " \n3: Set " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{T}^2 = \\mathrm{diag}\\left(\\overline{\\hat{r}_1^2}, \\ldots, \\overline{\\hat{r}_N^2}\\right)" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{r}_i^2 = \\frac{1}{m} \\left((\\mathcal{P}\\mathcal{F})_i - (\\mathcal{P}\\mathcal{F})_{-i} \\hat{x}^i\\right)^*\\left(\\mathcal{P}\\mathcal{F}\\right)_i" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " \n4: For " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "i \\in [N]" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " let " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{c}^i \\in \\mathbb{C}^N" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": ", set " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{c}_j^i = -\\hat{x}_j^i" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "j < i" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{c}_j^i = -\\hat{x}_{j-1}^i" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "j > i" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{c}_i^i = 1" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": ". \n5: Set " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "\\hat{C} = (\\hat{c}^1, \\dots, \\hat{c}^N)^T \\in \\mathbb{C}^{N \\times N}" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " \n6: Compute " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "M = \\hat{T}^{-2}\\hat{C}" + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "text", + "content": " \n7: Output: Correction matrix " + }, + { + "bbox": [ + 136, + 130, + 474, + 219 + ], + "type": "inline_equation", + "content": "M" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 130, + 242, + 480, + 268 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 242, + 480, + 268 + ], + "spans": [ + { + "bbox": [ + 130, + 242, + 480, + 268 + ], + "type": "text", + "content": "debiased TV estimator of the form " + }, + { + "bbox": [ + 130, + 242, + 480, + 268 + ], + "type": "inline_equation", + "content": "\\hat{x}^u = \\hat{x} +\\frac{1}{m} M(P\\mathcal{F})^* (b - P\\mathcal{F}\\hat{x})" + }, + { + "bbox": [ + 130, + 242, + 480, + 268 + ], + "type": "text", + "content": " , where " + }, + { + "bbox": [ + 130, + 242, + 480, + 268 + ], + "type": "inline_equation", + "content": "\\hat{x}" + }, + { + "bbox": [ + 130, + 242, + 480, + 268 + ], + "type": "text", + "content": " denotes the solution of Eq. (2). The decomposition" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 171, + 274, + 481, + 300 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 171, + 274, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 171, + 274, + 481, + 300 + ], + "type": "interline_equation", + "content": "\\sqrt {m} \\left(\\hat {x} ^ {u} - x ^ {0}\\right) = \\frac {1}{\\sqrt {m}} M (P \\mathcal {F}) ^ {*} \\varepsilon - \\sqrt {m} \\left(M \\hat {\\Sigma} - I _ {N \\times N}\\right) (\\hat {x} - x ^ {0}). \\tag {4}", + "image_path": "b39229f4ba9c090417cc2ae2b3fcc40d11f414f78d1ea8a16b6a07c9373284ef.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "content": "consists of a remainder term " + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "inline_equation", + "content": "R \\coloneqq \\sqrt{m} (M\\hat{\\Sigma} - I_{N\\times N})(x^0 - \\hat{x})" + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "content": " and of " + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "inline_equation", + "content": "W \\coloneqq \\frac{1}{\\sqrt{m}} M(P\\mathcal{F})^{*}\\varepsilon" + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "content": " which is complex Gaussian distributed with zero mean and covariance matrix " + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "inline_equation", + "content": "\\frac{\\sigma^2}{m} M(P\\mathcal{F})^{*}(M(P\\mathcal{F})^{*})^{*} = \\sigma^2 M\\hat{\\Sigma} M^{*}" + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "content": " due to the Gaussian distribution of the noise. The remainder term vanishes provided that, for a given correction matrix " + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "content": ", the term " + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "inline_equation", + "content": "\\max_{ij\\in [N]}|(M\\hat{\\Sigma} - I_{N\\times N})_{ij}|" + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "content": " is small and that the solution to the variational problem Eq. (2) accurately describes the underlying image, i.e., " + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "inline_equation", + "content": "x^0 - \\hat{x}" + }, + { + "bbox": [ + 130, + 308, + 482, + 403 + ], + "type": "text", + "content": " is small." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "spans": [ + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": "The so-called nodewise LASSO, here adapted to complex subsampled Fourier matrices, and described in Algorithm 1, guarantees that " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "\\max_{ij\\in [N]}|(M\\hat{\\Sigma} -I_{N\\times N})_{ij}|" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " is small [36,60]. There, " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "(\\mathcal{PF})_i" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " denotes the " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": "-th column of the matrix " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "(\\mathcal{PF})" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "(\\mathcal{PF})_{-i}" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " denotes this matrix without the " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": "-th column. For the latter, i.e., to understand when " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "x^0 -\\hat{x}" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " is small, a series of works, e.g., [39,48,49] and [7, Theorem 17.5] show that TV minimization provably retrieves a gradient-sparse image. The above results combined lead to the construction of pixel-wise sharp confidence intervals as described in Sec. 5. A remarkable advantage of such estimators is that once the image is retrieved as a solution to a convex optimization problem, one only needs to add the term " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "\\frac{1}{m} M(P\\mathcal{F})^{*}(b - P\\mathcal{F}\\hat{x})" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " to the estimator " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "\\hat{x}" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " in order to obtain confidence intervals. The inexpensive cost of such a debiased strategy comes from the fact that, for a given subsampling pattern " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": ", the matrix " + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 404, + 482, + 577 + ], + "type": "text", + "content": " needs to be computed only once, and it is independent of the image and the noise level." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 595, + 373, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 595, + 373, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 595, + 373, + 609 + ], + "type": "text", + "content": "5 Confidence Intervals Implementation" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 620, + 482, + 644 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 620, + 482, + 644 + ], + "spans": [ + { + "bbox": [ + 130, + 620, + 482, + 644 + ], + "type": "text", + "content": "The construction of confidence intervals relies on the asymptotic normality of the debiased TV estimator. If the remainder term is small, then" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 229, + 651, + 481, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 651, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 229, + 651, + 481, + 667 + ], + "type": "interline_equation", + "content": "\\sqrt {m} (\\hat {x} ^ {u} - x ^ {0}) \\sim \\mathcal {C N} (0, \\sigma^ {2} M \\hat {\\Sigma} M ^ {*}). \\tag {5}", + "image_path": "60eb8c4af202f0ff4fe8199ed1e4fb84f57196765d88b344db4033a524340020.jpg" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "text", + "content": "The goal is to derive a confidence interval for every pixel. We start with a confidence region " + }, + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "C_i(\\alpha)" + }, + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "text", + "content": " for the complex pixel value " + }, + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "x_{i}^{0}" + }, + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "text", + "content": " that depends on the significance level " + }, + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "\\alpha \\in (0,1)" + }, + { + "bbox": [ + 131, + 116, + 482, + 152 + ], + "type": "text", + "content": ", such that" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 205, + 162, + 481, + 175 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 162, + 481, + 175 + ], + "spans": [ + { + "bbox": [ + 205, + 162, + 481, + 175 + ], + "type": "interline_equation", + "content": "\\mathbb {P} \\left(x _ {i} ^ {0} \\in C _ {i} (\\alpha)\\right) \\geq 1 - \\alpha \\quad \\text {f o r e v e r y i m a g e} x ^ {0}, \\tag {6}", + "image_path": "e05a7e32ca7d62eab2c3db5daa5902a033c4d14c0a9c80e1b456cd0fa5ee4775.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "spans": [ + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "inline_equation", + "content": "\\mathbb{P}" + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": " denotes the probability due to the random noise. According to Eq. (5), the new estimator " + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "inline_equation", + "content": "\\hat{x}^u" + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": " induces a complex Gaussian distribution on the difference " + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "inline_equation", + "content": "\\hat{x}^u - x^0" + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": ". This means that it is possible to derive confidence intervals for the magnitude and the phase of the MR images. Since both the real part and the imaginary part are Gaussian distributed, the absolute value " + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "inline_equation", + "content": "|\\hat{x}_i^u - x_i^0| = \\sqrt{\\Re(\\hat{x}_i^u - x_i^0)^2 + \\Im(\\hat{x}_i^u - x_i^0)^2}" + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": " follows a Rician distribution with zero-mean. This special case simplifies to a Rayleigh distribution with variance " + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "inline_equation", + "content": "\\sigma \\cdot \\sqrt{(M\\hat{\\Sigma}M^*)_{ii}}" + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": " [8]. The corresponding radius " + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "inline_equation", + "content": "\\delta_i" + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": " of the confidence region " + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "inline_equation", + "content": "C_i(\\alpha)" + }, + { + "bbox": [ + 131, + 184, + 482, + 289 + ], + "type": "text", + "content": " is given by" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 249, + 299, + 481, + 334 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 249, + 299, + 481, + 334 + ], + "spans": [ + { + "bbox": [ + 249, + 299, + 481, + 334 + ], + "type": "interline_equation", + "content": "\\delta_ {i} (\\alpha) = \\frac {\\sigma \\sqrt {\\log (1 / \\alpha)}}{\\sqrt {m} \\sqrt {(M \\hat {\\Sigma} M ^ {*}) _ {i i}}}. \\tag {7}", + "image_path": "5c4ab7befb28fe005427aa049fb66117e04025cbc4f8d7e874a1c6581873f62c.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "text", + "content": "Therefore, " + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "inline_equation", + "content": "C_i(\\alpha)" + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "text", + "content": " is a circle centered around the debiased TV reconstruction " + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "inline_equation", + "content": "\\hat{x}_i^u" + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "text", + "content": " with radius " + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "inline_equation", + "content": "\\delta_i(\\alpha)" + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "text", + "content": ", i.e. " + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "inline_equation", + "content": "C_i(\\alpha) = \\{z \\in \\mathbb{C} \\mid |z - \\hat{x}_i^u| \\leq \\delta\\}" + }, + { + "bbox": [ + 131, + 342, + 482, + 390 + ], + "type": "text", + "content": ". The confidence intervals for the magnitude, which is what is typically visualized by radiologists, can be constructed due to the following inequality:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 172, + 399, + 481, + 414 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 172, + 399, + 481, + 414 + ], + "spans": [ + { + "bbox": [ + 172, + 399, + 481, + 414 + ], + "type": "interline_equation", + "content": "\\mathbb {P} \\left(| x _ {i} ^ {0} | \\in [ | \\hat {x} _ {i} ^ {u} | - \\delta_ {i} (\\alpha), | \\hat {x} _ {i} ^ {u} | + \\delta_ {i} (\\alpha) ]\\right) \\geq \\mathbb {P} \\left(x _ {i} ^ {0} \\in C _ {i} (\\alpha)\\right) \\geq 1 - \\alpha . \\tag {8}", + "image_path": "93766c0bbcebf7db59b04772bd9cdc3d26e7793aff89c7db2d1ed6084d43094b.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "text", + "content": "Hence, the " + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "inline_equation", + "content": "1 - \\alpha" + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "text", + "content": " confidence interval for the magnitude is given by " + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "inline_equation", + "content": "J_{i}(\\alpha) = [|\\hat{x}_{i}^{u}| - \\delta_{i}(\\alpha), |\\hat{x}_{i}^{u}| + \\delta_{i}(\\alpha)]" + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "text", + "content": ". Please note, however, that the confidence regions are given in the complex plane. This means that we could also have CIs for the phase " + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\varphi^0" + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "text", + "content": " of the image, which contains information, e.g., on motion or electromagnetic properties of biological tissues [55]. With the same argument as in Eq. (8), and by denoting " + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\hat{\\varphi}_i \\coloneqq \\arcsin \\left(\\frac{\\Re(\\hat{x}_i^u)}{|\\hat{x}_i^u|}\\right)" + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\gamma_i = \\arccos \\left(1 - \\frac{\\delta_i^2}{2|\\hat{x}_i^u|^2}\\right)" + }, + { + "bbox": [ + 131, + 422, + 482, + 501 + ], + "type": "text", + "content": ", we obtain" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 231, + 511, + 481, + 525 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 511, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 231, + 511, + 481, + 525 + ], + "type": "interline_equation", + "content": "\\mathbb {P} \\left(\\varphi_ {i} ^ {0} \\in [ \\hat {\\varphi} _ {i} - \\gamma_ {i}, \\hat {\\varphi} _ {i} + \\gamma_ {i} ]\\right) \\geq 1 - \\alpha . \\tag {9}", + "image_path": "c4a9a41d88f061f0bbf553190b57c95af6cb9e7ed8943927a93eba01b68ad489.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 481, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 481, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 481, + 569 + ], + "type": "text", + "content": "For a detailed derivation of the confidence intervals, refer to Section 2 of the supplementary material. This paper focuses on visualizing magnitudes, so we adhere to the confidence intervals presented in Equation 8." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "Rigorously, Eq. (6) should be interpreted in the following way: The random quantity in Eq. (6) is the confidence region " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "C_i(\\alpha)" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " since it is based on the debiased TV estimator, which, in turn, is reconstructed by data that is affected by random noise. In contrast, the underlying image " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "x_i^0" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " is fixed. Therefore, one should consider an experiment that is conducted " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "l" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " times, and every time the noise is different, it leads to a (slightly) different reconstruction. Hence, also to a (slightly) different confidence interval. In the end, the confidence region will contain the underlying image in at least " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "1 - \\alpha" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " of the " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "l" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " cases." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 448, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 115, + 356, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 115, + 356, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 115, + 356, + 129 + ], + "type": "text", + "content": "Algorithm 2 Confidence intervals for MR images" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 136, + 131, + 481, + 260 + ], + "type": "list", + "angle": 0, + "index": 10, + "blocks": [ + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "spans": [ + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "text", + "content": "1: Input: Sampling mask " + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "text", + "content": ", k-space data " + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "inline_equation", + "content": "b" + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "text", + "content": ", regularization parameter " + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "text", + "content": ", (estimated) noise level " + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "inline_equation", + "content": "\\hat{\\sigma}" + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "text", + "content": ", significance level " + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "text", + "content": ", correction matrix " + }, + { + "bbox": [ + 136, + 131, + 481, + 152 + ], + "type": "inline_equation", + "content": "M" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 136, + 153, + 323, + 165 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 153, + 323, + 165 + ], + "spans": [ + { + "bbox": [ + 136, + 153, + 323, + 165 + ], + "type": "text", + "content": "2: solve " + }, + { + "bbox": [ + 136, + 153, + 323, + 165 + ], + "type": "inline_equation", + "content": "\\hat{x}\\gets \\min_{x\\in \\mathbb{C}^N}\\frac{\\mu}{2}\\| b - \\mathcal{P}Fx\\|_2^2 +\\| x\\|_{TV}" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 136, + 165, + 366, + 176 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 165, + 366, + 176 + ], + "spans": [ + { + "bbox": [ + 136, + 165, + 366, + 176 + ], + "type": "text", + "content": "3: debias reconstruction " + }, + { + "bbox": [ + 136, + 165, + 366, + 176 + ], + "type": "inline_equation", + "content": "\\hat{x}^u\\gets \\hat{x} +\\frac{1}{m} M(\\mathcal{PF})^* (b - \\mathcal{PF}\\hat{x})" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "type": "text", + "content": "4: For each pixel " + }, + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "type": "text", + "content": " compute radius " + }, + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "type": "inline_equation", + "content": "\\delta_{i}\\gets \\frac{\\hat{\\sigma}}{\\sqrt{m}\\sqrt{(M\\hat{\\Sigma}M^{*})_{ii}}}\\sqrt{\\log(1 / \\alpha)}" + }, + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "type": "text", + "content": " with covariance matrix " + }, + { + "bbox": [ + 136, + 176, + 481, + 205 + ], + "type": "inline_equation", + "content": "\\hat{\\Sigma} = (\\mathcal{P}\\mathcal{F})^{*}(\\mathcal{P}\\mathcal{F}) / m" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 136, + 205, + 437, + 216 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 205, + 437, + 216 + ], + "spans": [ + { + "bbox": [ + 136, + 205, + 437, + 216 + ], + "type": "text", + "content": "5: For each pixel " + }, + { + "bbox": [ + 136, + 205, + 437, + 216 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 136, + 205, + 437, + 216 + ], + "type": "text", + "content": " obtain confidence circle " + }, + { + "bbox": [ + 136, + 205, + 437, + 216 + ], + "type": "inline_equation", + "content": "C_i(\\alpha) \\gets \\{z \\in \\mathbb{C} \\mid |z - \\hat{x}_i^u| \\leq \\delta\\}" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 136, + 216, + 481, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 216, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 136, + 216, + 481, + 237 + ], + "type": "text", + "content": "6: For each pixel " + }, + { + "bbox": [ + 136, + 216, + 481, + 237 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 136, + 216, + 481, + 237 + ], + "type": "text", + "content": " compute its confidence interval for the magnitude " + }, + { + "bbox": [ + 136, + 216, + 481, + 237 + ], + "type": "inline_equation", + "content": "J_{i}(\\alpha) \\gets [|\\hat{x}_{i}^{u}| - \\delta_{i}(\\alpha), |\\hat{x}_{i}^{u}| + \\delta_{i}(\\alpha)]" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "spans": [ + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "content": "7: Output: Reconstructions " + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "inline_equation", + "content": "\\hat{x}" + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "inline_equation", + "content": "\\hat{x}^u" + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "content": " and confidence circles " + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "inline_equation", + "content": "C_i(\\alpha)" + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "inline_equation", + "content": "x_i^0" + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "content": " and confidence intervals " + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "inline_equation", + "content": "J_i(\\alpha)" + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "content": " for the magnitude " + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "inline_equation", + "content": "|x_i^0|" + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "text", + "content": " for every pixel " + }, + { + "bbox": [ + 136, + 238, + 481, + 260 + ], + "type": "inline_equation", + "content": "i" + } + ] + } + ], + "index": 9 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 287, + 482, + 371 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 287, + 482, + 371 + ], + "spans": [ + { + "bbox": [ + 130, + 287, + 482, + 371 + ], + "type": "text", + "content": "Imaging with confidence, summarized in Algorithm 2, computes confidence intervals for the given pixels of an image retrieved via total variation minimization. More precisely, we propose an estimator that has an asymptotic Gaussian distribution, and from that, we derive pixel-wise uncertainty quantification for the magnitude and the phase of MR images. To visualize such a UQ procedure, we choose lines in the image, draw the confidence intervals, and measure the hit rate of how many pixels lie inside the given interval." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 390, + 315, + 404 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 390, + 315, + 404 + ], + "spans": [ + { + "bbox": [ + 132, + 390, + 315, + 404 + ], + "type": "text", + "content": "6 Estimating the Noise Level" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 416, + 482, + 585 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 416, + 482, + 585 + ], + "spans": [ + { + "bbox": [ + 130, + 416, + 482, + 585 + ], + "type": "text", + "content": "Despite advances in hardware and image acquisition techniques for MRI, the problem of noise in MR images persists, making noise estimation and analysis crucial tasks in MR image reconstruction [8]. Notably, MR noise estimation increases in complexity if advanced MR reconstruction approaches (e.g. parallel imaging) are employed and, especially, if the underlying individual coil raw data is not available. This is the default case for the clinical use of MRI since usually, only the magnitude data of the image after reconstruction is stored in clinical databases for diagnostic purposes. For our conceptual work on UQ, we ensured the consistent availability of the MR raw data by obtaining it directly from the MR scanner. Therefore, we were able to utilize image regions without imaging objects to retrieve the Gaussian distributed noise characteristics directly, obtaining noise levels of " + }, + { + "bbox": [ + 130, + 416, + 482, + 585 + ], + "type": "inline_equation", + "content": "5\\% - 15\\%" + }, + { + "bbox": [ + 130, + 416, + 482, + 585 + ], + "type": "text", + "content": " for the available data. For future implementation on any MR scanners, our proposed method for UQ can be directly amended to the regular image reconstruction when raw data is still available." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 603, + 294, + 617 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 603, + 294, + 617 + ], + "spans": [ + { + "bbox": [ + 132, + 603, + 294, + 617 + ], + "type": "text", + "content": "7 Numerical Experiments" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": "We numerically illustrate our imaging with confidence method by applying it to obtain pixel-wise confidence intervals for clinically feasible MR images reconstructed from noisy measurements. In line with our discussion above, we work" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": "with noise levels between " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "6\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "12.5\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ". We retrieve the image by minimizing the TV-regularized objective, Eq. (2), and we consider two different sampling schemes, radial and spiral sampling, which are both among the most popular for MRI applications. The code for reproducing all the experiments is available on GitHub7. More information about the implementation can be found in the supplementary material in Section 3." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "text", + "content": "The radial k-space masks were generated according to the golden angle radial scheme proposed by [63]. Each mask is created by adding lines going through the center of the mask by placing a new line in an angle of " + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "inline_equation", + "content": "111.246^{\\circ}" + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "text", + "content": " (the golden angle) to the previously added one. As for the latter, k-space masks for spiral sampling were generated by first simulating readout gradients in 2D and computing the resulting k-space trajectories. The trajectories were regridded to the Cartesian grid and transformed to boolean masks. Undersampling factors were adjusted by changing the number of spokes and fine-tuned by adjusting the maximum radius " + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "inline_equation", + "content": "\\sqrt{(k_x^2 + k_y^2)}" + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "text", + "content": ". Again, individual spokes were rotated by the golden angle relative to the previous one. Each spiral spoke forms a " + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "inline_equation", + "content": "3/4" + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "text", + "content": " rotation. The masks were fit to the size of our images, i.e., " + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "inline_equation", + "content": "156 \\times 156" + }, + { + "bbox": [ + 130, + 188, + 482, + 325 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 325, + 482, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 373 + ], + "type": "text", + "content": "As we will observe below, the confidence intervals appropriately capture the difference between ground truth and reconstruction, as predicted. Note that in the plots displaying this finding, the ground truth is only added as a comparison to assess UQ but never used for designing our method." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 390, + 339, + 403 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 390, + 339, + 403 + ], + "spans": [ + { + "bbox": [ + 131, + 390, + 339, + 403 + ], + "type": "text", + "content": "7.1 UQ for in vivo Complex MRI Data" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 409, + 482, + 564 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 409, + 482, + 564 + ], + "spans": [ + { + "bbox": [ + 130, + 409, + 482, + 564 + ], + "type": "text", + "content": "To assess UQ in realistic scenarios, we simulate the MRI data acquisition and reconstruction process using in vivo data as the underlying ground truth image, see Fig. 1a. We use existing in vivo data acquired with an inversion recovery spin echo (IR-SE) sequence with single-shot spiral readout as described by the works [19, 46]. Brain data of a healthy 32-year-old female were acquired on a Siemens Magnetom Skyra Connectome 3T system with a 32-channel head coil8 with a matrix of " + }, + { + "bbox": [ + 130, + 409, + 482, + 564 + ], + "type": "inline_equation", + "content": "156 \\times 156" + }, + { + "bbox": [ + 130, + 409, + 482, + 564 + ], + "type": "text", + "content": ". Images with complex (magnitude and phase) data were reconstructed using an oversampled ridge-regression estimator that uses a higher order signal model that accounts for spatio-temporal field dynamics [50, 61, 62]. This high-quality complex-valued reconstruction serves as ground truth data for validating our uncertainty quantification method. Moreover, all in vivo scans were performed in accordance with local ethics guidelines and the Institutional Review Board (IRB) after obtaining the volunteer's written informed consent." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "spans": [ + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "text", + "content": "The data acquisition process in the MRI scanner is simulated by taking the 2D Fourier transform of the image, adding Gaussian noise with noise level " + }, + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "inline_equation", + "content": "\\sigma = 0.1" + }, + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "text", + "content": " (see Fig. 1b) and subsampling this k-space data using the spiral and radial sampling scheme, respectively. The sampling masks are visualized in Fig. 1c for " + }, + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "inline_equation", + "content": "43\\%" + }, + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "text", + "content": " spiral subsampling and in Fig. 1d for " + }, + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 564, + 482, + 638 + ], + "type": "text", + "content": " radial subsampling. These subsampling rates are inspired by studies about the limitations of compressive sensing" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 365, + 654 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 365, + 654 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 365, + 654 + ], + "type": "text", + "content": "7 https://github.com/HannahLaus/Project_UQ_TV.git" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 654, + 315, + 664 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 654, + 315, + 664 + ], + "spans": [ + { + "bbox": [ + 134, + 654, + 315, + 664 + ], + "type": "text", + "content": "Siemens Healthineers, Erlangen, Germany." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 144 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 144 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 144 + ], + "type": "text", + "content": "approaches for MRI based on expert Radiologists' scoring [34]. The resulting relative noise levels are " + }, + { + "bbox": [ + 130, + 116, + 479, + 144 + ], + "type": "inline_equation", + "content": "\\frac{\\|\\varepsilon\\|_2}{\\|\\mathcal{P}\\mathcal{F}x^0\\|_2} \\approx 6.5\\%" + }, + { + "bbox": [ + 130, + 116, + 479, + 144 + ], + "type": "text", + "content": " for spiral and " + }, + { + "bbox": [ + 130, + 116, + 479, + 144 + ], + "type": "inline_equation", + "content": "7\\%" + }, + { + "bbox": [ + 130, + 116, + 479, + 144 + ], + "type": "text", + "content": " for radial sampling." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "content": "Since the sampling patterns are fixed, we calculate, for both masks, the matrix " + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "content": " according to Algorithm 1 with " + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\lambda_{1} = \\ldots = \\lambda_{N} = 0.0035 \\cdot \\frac{\\sqrt{m}}{\\sqrt{12\\log(N)}}" + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "content": " using FISTA [10] with 1000 iterations. The dimensional scaling " + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\frac{\\sqrt{m}}{\\sqrt{12\\log(N)}}" + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "content": " comes from theoretical works on debiased estimators, e.g., [28]. The constant 0.0035 was found via cross-validation. To reconstruct the image by the subsampled spiral and radial data, respectively, we solve Eq. (2) with the Split-Bregman algorithm [24] since it allows for complex-valued solutions. We use the parameters " + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\hat{\\mu} = \\frac{\\mu}{20}" + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\lambda_{1} = \\lambda_{2} = 0.05" + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "content": ". For further information on the parameters and the optimization problem, see Section 1 of the supplementary material. The parameter " + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\mu = \\frac{\\sqrt{m}}{\\sigma\\sqrt{12\\log N}}" + }, + { + "bbox": [ + 130, + 144, + 482, + 304 + ], + "type": "text", + "content": " was theoretically calculated for a subsampled Fourier matrix in [28]. After this reconstruction step, we compute the debiased TV estimator according to Algorithm 2." + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 143, + 331, + 212, + 386 + ], + "blocks": [ + { + "bbox": [ + 143, + 331, + 212, + 386 + ], + "lines": [ + { + "bbox": [ + 143, + 331, + 212, + 386 + ], + "spans": [ + { + "bbox": [ + 143, + 331, + 212, + 386 + ], + "type": "image", + "image_path": "4890f1640d322c7e525512ddb152fe338953b256a6cbc3121031952410435df9.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 171, + 391, + 184, + 400 + ], + "lines": [ + { + "bbox": [ + 171, + 391, + 184, + 400 + ], + "spans": [ + { + "bbox": [ + 171, + 391, + 184, + 400 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 230, + 331, + 296, + 386 + ], + "blocks": [ + { + "bbox": [ + 230, + 331, + 296, + 386 + ], + "lines": [ + { + "bbox": [ + 230, + 331, + 296, + 386 + ], + "spans": [ + { + "bbox": [ + 230, + 331, + 296, + 386 + ], + "type": "image", + "image_path": "809a116ee2fca079c28506475ba8c1c13f75bf6050ddc907d3faef2446757d1c.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 258, + 391, + 270, + 399 + ], + "lines": [ + { + "bbox": [ + 258, + 391, + 270, + 399 + ], + "spans": [ + { + "bbox": [ + 258, + 391, + 270, + 399 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "lines": [ + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "type": "text", + "content": "Fig. 1: Model of experimental setting 1a: Magnitude of complex ground truth data 1b: Full k-space affected by Gaussian noise with noise level " + }, + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "type": "inline_equation", + "content": "\\sigma = 0.1" + }, + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "type": "text", + "content": " 1c: Spiral subsampling mask which samples " + }, + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "type": "inline_equation", + "content": "43\\%" + }, + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "type": "text", + "content": " of k-space 1d: Radial subsampling mask which samples " + }, + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 409, + 482, + 453 + ], + "type": "text", + "content": " of k-space." + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 316, + 331, + 381, + 385 + ], + "blocks": [ + { + "bbox": [ + 316, + 331, + 381, + 385 + ], + "lines": [ + { + "bbox": [ + 316, + 331, + 381, + 385 + ], + "spans": [ + { + "bbox": [ + 316, + 331, + 381, + 385 + ], + "type": "image", + "image_path": "872e858ac8f0bd870313abb42da17c61e8daa28502865cb23d2f59ca73bef9f0.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 345, + 391, + 356, + 400 + ], + "lines": [ + { + "bbox": [ + 345, + 391, + 356, + 400 + ], + "spans": [ + { + "bbox": [ + 345, + 391, + 356, + 400 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 402, + 331, + 468, + 385 + ], + "blocks": [ + { + "bbox": [ + 402, + 331, + 468, + 385 + ], + "lines": [ + { + "bbox": [ + 402, + 331, + 468, + 385 + ], + "spans": [ + { + "bbox": [ + 402, + 331, + 468, + 385 + ], + "type": "image", + "image_path": "fdbd8334e0e71111b8a41b918ef9bab789d2c1bac75e94e2786b76ba7e2cbc11.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 430, + 391, + 443, + 400 + ], + "lines": [ + { + "bbox": [ + 430, + 391, + 443, + 400 + ], + "spans": [ + { + "bbox": [ + 430, + 391, + 443, + 400 + ], + "type": "text", + "content": "(d)" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "text", + "content": "To examine the distribution of the debiased TV estimator, a Q-Q plot (see Fig. 2d) compares the quantiles of the input sample, i.e. every component " + }, + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "inline_equation", + "content": "\\frac{\\sqrt{2m}\\Re(\\hat{x}^u - x^0)_i}{\\sigma\\cdot\\sqrt{(M\\hat{\\Sigma}M^*)_{ii}}}" + }, + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "text", + "content": " with the quantiles of a standard Gaussian distribution. It indeed confirms that the input is Gaussian distributed. Since the same is true for the imaginary part, it holds that " + }, + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "inline_equation", + "content": "\\sqrt{m} (\\hat{x}^u -x^0)\\sim \\mathcal{CN}(0,\\sigma^2 M\\hat{\\Sigma} M^*)" + }, + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "text", + "content": ", which means that the error of the debiased TV follows a Gaussian distribution with mean zero and covariance structure " + }, + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "inline_equation", + "content": "\\sigma^2 M\\hat{\\Sigma} M^*" + }, + { + "bbox": [ + 130, + 478, + 482, + 581 + ], + "type": "text", + "content": ". The same behavior can be observed for radial sampling. The Q-Q plot is shown in Fig. 4d." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Algorithm 2, then, constructs confidence regions for the complex pixel values from which confidence intervals for the magnitudes and phases can be derived by using the fact that the new debiased estimator follows a Gaussian distribution given by " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\sqrt{m}\\hat{x}^u\\sim \\mathcal{CN}(\\sqrt{m} x^0,\\sigma^2 M\\hat{\\Sigma} M^*)" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": ". Here, we choose the confidence level " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\alpha = 0.05" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": ". For clarity, we show confidence intervals for all the pixels, corresponding to magnitudes, lying in a small rectangular region in the image. See Fig. 2a together with the corresponding confidence intervals in Figs. 2b and 2c in the" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 121, + 201, + 172 + ], + "blocks": [ + { + "bbox": [ + 151, + 121, + 201, + 172 + ], + "lines": [ + { + "bbox": [ + 151, + 121, + 201, + 172 + ], + "spans": [ + { + "bbox": [ + 151, + 121, + 201, + 172 + ], + "type": "image", + "image_path": "32eefc2d693801bd0fadb6f5bc67a2669b2e6c252717f3e5200130dd3c9a77ca.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 169, + 178, + 182, + 189 + ], + "lines": [ + { + "bbox": [ + 169, + 178, + 182, + 189 + ], + "spans": [ + { + "bbox": [ + 169, + 178, + 182, + 189 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 223, + 121, + 299, + 175 + ], + "blocks": [ + { + "bbox": [ + 223, + 121, + 299, + 175 + ], + "lines": [ + { + "bbox": [ + 223, + 121, + 299, + 175 + ], + "spans": [ + { + "bbox": [ + 223, + 121, + 299, + 175 + ], + "type": "image", + "image_path": "d0cd0ad537c3861054b0d62bf1f83f24b56552077dd5f25d77217e3e3d712ea5.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 257, + 178, + 271, + 189 + ], + "lines": [ + { + "bbox": [ + 257, + 178, + 271, + 189 + ], + "spans": [ + { + "bbox": [ + 257, + 178, + 271, + 189 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 313, + 121, + 387, + 175 + ], + "blocks": [ + { + "bbox": [ + 313, + 121, + 387, + 175 + ], + "lines": [ + { + "bbox": [ + 313, + 121, + 387, + 175 + ], + "spans": [ + { + "bbox": [ + 313, + 121, + 387, + 175 + ], + "type": "image", + "image_path": "50dc5c0ff14a24614ed1b37a91a4e75488372ce439f0c6b5e3f19cd936353dd9.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 347, + 178, + 358, + 189 + ], + "lines": [ + { + "bbox": [ + 347, + 178, + 358, + 189 + ], + "spans": [ + { + "bbox": [ + 347, + 178, + 358, + 189 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 399, + 121, + 473, + 176 + ], + "blocks": [ + { + "bbox": [ + 399, + 121, + 473, + 176 + ], + "lines": [ + { + "bbox": [ + 399, + 121, + 473, + 176 + ], + "spans": [ + { + "bbox": [ + 399, + 121, + 473, + 176 + ], + "type": "image", + "image_path": "876f3efca43320f84dc47b549230c2f2e80f59fa933c59319ff258bbc42acb49.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 432, + 178, + 444, + 188 + ], + "lines": [ + { + "bbox": [ + 432, + 178, + 444, + 188 + ], + "spans": [ + { + "bbox": [ + 432, + 178, + 444, + 188 + ], + "type": "text", + "content": "(d)" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "lines": [ + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "spans": [ + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "text", + "content": "Fig. 2: Confidence intervals for " + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "inline_equation", + "content": "43\\%" + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "text", + "content": " spiral sampling 2a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 2b & 2c: " + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "inline_equation", + "content": "95\\%" + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "text", + "content": " confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values, the blue circles are the corresponding estimates of the debiased TV estimator. 2b is for a reconstruction with " + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "inline_equation", + "content": "6.5\\%" + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "text", + "content": " noise and 2c is for a reconstruction with " + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "text", + "content": " noise. 2d: Q-Q plot for input samples " + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "inline_equation", + "content": "\\frac{\\sqrt{2m(\\hat{x}^u - x^0)_i}}{\\sigma\\cdot\\sqrt{(M\\Sigma M^*)_{ii}}}" + }, + { + "bbox": [ + 131, + 198, + 481, + 269 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 212, + 295, + 296, + 361 + ], + "blocks": [ + { + "bbox": [ + 212, + 295, + 296, + 361 + ], + "lines": [ + { + "bbox": [ + 212, + 295, + 296, + 361 + ], + "spans": [ + { + "bbox": [ + 212, + 295, + 296, + 361 + ], + "type": "image", + "image_path": "e6c910f9fbea2913f4efc6ce59301a3470f45e5b0b03820c295b7c371a45dc11.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 247, + 368, + 260, + 377 + ], + "lines": [ + { + "bbox": [ + 247, + 368, + 260, + 377 + ], + "spans": [ + { + "bbox": [ + 247, + 368, + 260, + 377 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 319, + 295, + 402, + 361 + ], + "blocks": [ + { + "bbox": [ + 319, + 295, + 402, + 361 + ], + "lines": [ + { + "bbox": [ + 319, + 295, + 402, + 361 + ], + "spans": [ + { + "bbox": [ + 319, + 295, + 402, + 361 + ], + "type": "image", + "image_path": "051347887c26b70f23e67840f4a640a0aaeeb00b107d9e8baceb5879e78a1476.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 354, + 368, + 367, + 377 + ], + "lines": [ + { + "bbox": [ + 354, + 368, + 367, + 377 + ], + "spans": [ + { + "bbox": [ + 354, + 368, + 367, + 377 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "lines": [ + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "spans": [ + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "type": "text", + "content": "Fig. 3: Empirical probability " + }, + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbb{P}}_i(\\alpha) = \\frac{1}{100}\\sum_{j=1}^{100}\\mathbb{1}_{\\{x_i^0 \\in C_i(\\alpha, \\varepsilon^{(j)})\\}}" + }, + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "type": "text", + "content": " for every image pixel each time with a different realization 3a for " + }, + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "type": "inline_equation", + "content": "43\\%" + }, + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "type": "text", + "content": " spiral undersampling and for 3b for " + }, + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 131, + 386, + 481, + 422 + ], + "type": "text", + "content": " radial undersampling." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 453, + 479, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 479, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 479, + 477 + ], + "type": "text", + "content": "spiral undersampling setting as well as Figs. 4a, 4b and 4c for the radial case, respectively." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": "Interpretation of the UQ Procedure. The quality of the confidence regions is quantified by counting how many confidence regions contain the true ground truth pixel value " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "x_{i}^{0}" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": " on and off the support. These hit rates are calculated for one realization of the noise by " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "h = \\frac{1}{N}\\sum_{i=1}^{N}\\mathbb{1}_{\\{x_{i}^{0}\\in C_{i}\\}}" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "h_{S} = \\frac{1}{s}\\sum_{i\\in \\mathrm{supp}(x^{0})}\\mathbb{1}_{\\{x_{i}^{0}\\in C_{i}\\}}" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": " denotes the amount of pixels that are different from zero. But in view of the interpretation of a confidence interval as described in Sec. 5, we also estimate the probability " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbb{P}(x_i^0\\in C_i(\\alpha))" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": " by the empirical probability " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbb{P}}_i(\\alpha) = \\frac{1}{100}\\sum_{j=1}^{100}\\mathbb{1}_{\\{x_i^0\\in C_i(\\alpha,\\varepsilon^{(j)})\\}}" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": " for every pixel " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "i\\in [0,156]^2" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\varepsilon^{(j)}" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": " denoting the dependency on the " + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 481, + 482, + 666 + ], + "type": "text", + "content": "-th realization of the noise. In contrast to the hit rates, which are computed for one realization of the noise over all pixels, here we fix a pixel and observe how often the random confidence regions contain this pixel averaged over 100 different realizations of the noise. The image containing the empirical probability values for all pixels is shown in Fig. 3a for the spiral and in Fig. 3b for the radial case, respectively. In both cases, the maps seem to contain residual image information. In the spiral setting, the empirical probabil-" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 448, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 121, + 202, + 172 + ], + "blocks": [ + { + "bbox": [ + 151, + 121, + 202, + 172 + ], + "lines": [ + { + "bbox": [ + 151, + 121, + 202, + 172 + ], + "spans": [ + { + "bbox": [ + 151, + 121, + 202, + 172 + ], + "type": "image", + "image_path": "6c48d9ca62eea90a5a5884568b7d87f23a6000813b00df3fd29f39388eb0fd17.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 169, + 178, + 182, + 189 + ], + "lines": [ + { + "bbox": [ + 169, + 178, + 182, + 189 + ], + "spans": [ + { + "bbox": [ + 169, + 178, + 182, + 189 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 224, + 121, + 299, + 175 + ], + "blocks": [ + { + "bbox": [ + 224, + 121, + 299, + 175 + ], + "lines": [ + { + "bbox": [ + 224, + 121, + 299, + 175 + ], + "spans": [ + { + "bbox": [ + 224, + 121, + 299, + 175 + ], + "type": "image", + "image_path": "03dbff1f707b60e2733f3b1cc26c35319053755c7974f95fd38e9caa9825952e.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 257, + 178, + 271, + 189 + ], + "lines": [ + { + "bbox": [ + 257, + 178, + 271, + 189 + ], + "spans": [ + { + "bbox": [ + 257, + 178, + 271, + 189 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 313, + 121, + 388, + 175 + ], + "blocks": [ + { + "bbox": [ + 313, + 121, + 388, + 175 + ], + "lines": [ + { + "bbox": [ + 313, + 121, + 388, + 175 + ], + "spans": [ + { + "bbox": [ + 313, + 121, + 388, + 175 + ], + "type": "image", + "image_path": "1b26f132987653767a3a0d4f710f4b063e9041044ca3a49fc20cfc9bcf84c370.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 347, + 178, + 358, + 189 + ], + "lines": [ + { + "bbox": [ + 347, + 178, + 358, + 189 + ], + "spans": [ + { + "bbox": [ + 347, + 178, + 358, + 189 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 399, + 121, + 473, + 176 + ], + "blocks": [ + { + "bbox": [ + 399, + 121, + 473, + 176 + ], + "lines": [ + { + "bbox": [ + 399, + 121, + 473, + 176 + ], + "spans": [ + { + "bbox": [ + 399, + 121, + 473, + 176 + ], + "type": "image", + "image_path": "8b151787925b3e935a5c76abe8f5ea44adcd9df909790454cecd7a1c5d4f8247.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 432, + 178, + 444, + 188 + ], + "lines": [ + { + "bbox": [ + 432, + 178, + 444, + 188 + ], + "spans": [ + { + "bbox": [ + 432, + 178, + 444, + 188 + ], + "type": "text", + "content": "(d)" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "lines": [ + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "spans": [ + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "text", + "content": "Fig. 4: Confidence intervals for " + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "text", + "content": " radial sampling 4a: Ground truth image with rectangle for showing confidence intervals for pixels lying in this region 4b & 4c: " + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "inline_equation", + "content": "95\\%" + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "text", + "content": " confidence intervals for the magnitude of pixels in the rectangle. The red crosses are the ground truth values and the blue circles are the corresponding estimates of the debiased TV estimator. 4b is for a reconstruction with " + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "inline_equation", + "content": "7\\%" + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "text", + "content": " noise and 4c is for a reconstruction with " + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "inline_equation", + "content": "10.5\\%" + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "text", + "content": " noise. 4d: Q-Q plot for input samples " + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "inline_equation", + "content": "\\frac{\\sqrt{2m}\\Re(\\hat{x}^u - x^0)_i}{\\sigma\\cdot\\sqrt{(M\\Sigma M^*)_{ii}}}" + }, + { + "bbox": [ + 130, + 198, + 482, + 269 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "spans": [ + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "text", + "content": "ity averaged over all support pixels is " + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "inline_equation", + "content": "90.64\\%" + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "text", + "content": ", the one averaged over all pixels is " + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "inline_equation", + "content": "93.82\\%" + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "text", + "content": ". For the radial case, the values are " + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "inline_equation", + "content": "91.95\\%" + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "inline_equation", + "content": "94.20\\%" + }, + { + "bbox": [ + 130, + 291, + 482, + 316 + ], + "type": "text", + "content": ", respectively." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 332, + 274, + 343 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 332, + 274, + 343 + ], + "spans": [ + { + "bbox": [ + 131, + 332, + 274, + 343 + ], + "type": "text", + "content": "7.2 Qualitative Evaluation" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "spans": [ + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "text", + "content": "The general idea of debiasing, is that after the transformation, the reconstruction error can be decomposed as " + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "inline_equation", + "content": "\\hat{x}^u - x^0 = R + W" + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "text", + "content": " is a small residual term and the dominating term " + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "text", + "content": " is Gaussian distributed. In fact, by inspecting Fig. 5, it is possible to visualize this debiasing step. On the one hand, the difference between the biased solution of Eq. (2) (see its magnitude in Fig. 5a for spiral and in Fig. 5e for radial sampling) and the ground truth has a very structured error, i.e. " + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "inline_equation", + "content": "|\\hat{x} - x^0|" + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "text", + "content": " still displays much of the brain structure, which can be seen in Figs. 5b and 5f. On the other hand, the difference between the unbiased estimator (see its magnitude in Fig. 5c for spiral and Fig. 5g for radial sampling) and the ground truth in Figs. 5d and 5h is much more unstructured, and one can see that it is dominated by random noise. Moreover, as we increase the number of k-space points or we increase the noise, this difference becomes more unstructured. The distribution can be measured in the Q-Q plots in Figs. 2d and 4d, which, indeed, shows the Gaussianity of " + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "inline_equation", + "content": "\\hat{x}^u - x^0" + }, + { + "bbox": [ + 130, + 351, + 482, + 517 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": "To test our findings, the same experiment as in Sec. 7.1 is conducted 100 times, each time with a different realization of the noise vector " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\varepsilon" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": ". In the spiral case, we do so for the subsampling rates " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "43\\%" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "62\\%" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": ", and in the radial setting, we choose the masks according to " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "70\\%" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "90\\%" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " k-space undersampling. For every mask, we select " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\sigma \\in \\{0.1, 0.15\\}" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " resulting in relative noise levels " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\frac{\\|\\varepsilon\\|_2}{\\|P\\mathcal{F}x^0\\|_2}" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " between 0.06 and 0.125. In these settings the " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\ell_2" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": "-norm of the errors " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\hat{x} - x^0" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\hat{x}^u - x^0" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": ", of the bias term " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "R \\coloneqq (M\\hat{\\Sigma} - I_{N\\times N})(\\hat{x} - x^0)" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " and of the Gaussian term " + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "inline_equation", + "content": "W \\coloneqq \\frac{1}{m} M(P\\mathcal{F})^*\\varepsilon" + }, + { + "bbox": [ + 130, + 518, + 482, + 640 + ], + "type": "text", + "content": " are computed and averaged. The resulting quantities, including a more detailed analysis, can be found in Table 1 (spiral) and in Table 2 (radial) in Section 3 in the supplementary material." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": "With these results we numerically verify that " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\| R\\|_{\\infty}" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": " is small as compared to " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\| W\\|_{\\infty}" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": ". Since the goal is to have pixel-wise confidence intervals, obtaining" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 119, + 210, + 175 + ], + "blocks": [ + { + "bbox": [ + 141, + 119, + 210, + 175 + ], + "lines": [ + { + "bbox": [ + 141, + 119, + 210, + 175 + ], + "spans": [ + { + "bbox": [ + 141, + 119, + 210, + 175 + ], + "type": "image", + "image_path": "8a8f53d21a0ed50846653ac1f7937b5f80fb619a31c2c92a649ae9ab7bc36e98.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 169, + 179, + 181, + 189 + ], + "lines": [ + { + "bbox": [ + 169, + 179, + 181, + 189 + ], + "spans": [ + { + "bbox": [ + 169, + 179, + 181, + 189 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 230, + 119, + 299, + 175 + ], + "blocks": [ + { + "bbox": [ + 230, + 119, + 299, + 175 + ], + "lines": [ + { + "bbox": [ + 230, + 119, + 299, + 175 + ], + "spans": [ + { + "bbox": [ + 230, + 119, + 299, + 175 + ], + "type": "image", + "image_path": "1b86d20d0b40fc253e1059edd61b2fb7b404892f4726f9c6aa2a44deb0524bdf.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 257, + 179, + 270, + 189 + ], + "lines": [ + { + "bbox": [ + 257, + 179, + 270, + 189 + ], + "spans": [ + { + "bbox": [ + 257, + 179, + 270, + 189 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 317, + 116, + 393, + 175 + ], + "blocks": [ + { + "bbox": [ + 317, + 116, + 393, + 175 + ], + "lines": [ + { + "bbox": [ + 317, + 116, + 393, + 175 + ], + "spans": [ + { + "bbox": [ + 317, + 116, + 393, + 175 + ], + "type": "image", + "image_path": "a40fa0d2f388526cbb2a9af46dbf2c0271800fead35f550e5317db11617145a9.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 344, + 179, + 356, + 189 + ], + "lines": [ + { + "bbox": [ + 344, + 179, + 356, + 189 + ], + "spans": [ + { + "bbox": [ + 344, + 179, + 356, + 189 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 405, + 120, + 474, + 175 + ], + "blocks": [ + { + "bbox": [ + 405, + 120, + 474, + 175 + ], + "lines": [ + { + "bbox": [ + 405, + 120, + 474, + 175 + ], + "spans": [ + { + "bbox": [ + 405, + 120, + 474, + 175 + ], + "type": "image", + "image_path": "836bf2e23a5d04897e413c596a61c438684e679193a2094c6ecf8ce2b4445e63.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 432, + 179, + 444, + 188 + ], + "lines": [ + { + "bbox": [ + 432, + 179, + 444, + 188 + ], + "spans": [ + { + "bbox": [ + 432, + 179, + 444, + 188 + ], + "type": "text", + "content": "(d)" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 141, + 194, + 210, + 249 + ], + "blocks": [ + { + "bbox": [ + 141, + 194, + 210, + 249 + ], + "lines": [ + { + "bbox": [ + 141, + 194, + 210, + 249 + ], + "spans": [ + { + "bbox": [ + 141, + 194, + 210, + 249 + ], + "type": "image", + "image_path": "afab2938762ee598d6d8c810b202e5cd242e36f42b3ef826be5c1750fbec9abe.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 170, + 254, + 182, + 263 + ], + "lines": [ + { + "bbox": [ + 170, + 254, + 182, + 263 + ], + "spans": [ + { + "bbox": [ + 170, + 254, + 182, + 263 + ], + "type": "text", + "content": "(e)" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 231, + 194, + 299, + 249 + ], + "blocks": [ + { + "bbox": [ + 231, + 194, + 299, + 249 + ], + "lines": [ + { + "bbox": [ + 231, + 194, + 299, + 249 + ], + "spans": [ + { + "bbox": [ + 231, + 194, + 299, + 249 + ], + "type": "image", + "image_path": "9ecccc3b86ede66c5ade96dc28e62824cadfd7b3d023436551d61c7bca9f65a7.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 258, + 254, + 269, + 263 + ], + "lines": [ + { + "bbox": [ + 258, + 254, + 269, + 263 + ], + "spans": [ + { + "bbox": [ + 258, + 254, + 269, + 263 + ], + "type": "text", + "content": "(f)" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 317, + 191, + 393, + 249 + ], + "blocks": [ + { + "bbox": [ + 317, + 191, + 393, + 249 + ], + "lines": [ + { + "bbox": [ + 317, + 191, + 393, + 249 + ], + "spans": [ + { + "bbox": [ + 317, + 191, + 393, + 249 + ], + "type": "image", + "image_path": "d1ed20ab286267318954ca6c45b185350a46b90d9d48eac88fc487bebf00ea91.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 344, + 254, + 356, + 263 + ], + "lines": [ + { + "bbox": [ + 344, + 254, + 356, + 263 + ], + "spans": [ + { + "bbox": [ + 344, + 254, + 356, + 263 + ], + "type": "text", + "content": "(g)" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "lines": [ + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "spans": [ + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "text", + "content": "Fig. 5: Reconstruction and debiasing visualization for spiral mask with " + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "inline_equation", + "content": "43\\%" + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "text", + "content": " subsampling and " + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "inline_equation", + "content": "6.5\\%" + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "text", + "content": " noise in the first row and for radial mask with " + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "text", + "content": " subsampling and " + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "inline_equation", + "content": "7\\%" + }, + { + "bbox": [ + 131, + 271, + 482, + 338 + ], + "type": "text", + "content": " noise in the second row 5a & 5e: TV Reconstruction 5b & 5f: Magnitude of difference between ground truth and TV estimator 5c & 5g: Debiased TV Reconstruction, the small enlargement at the top of the image visualizes the noise in the background 5d & 5h: Magnitude of difference between ground truth and debiased TV estimator." + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 405, + 194, + 474, + 249 + ], + "blocks": [ + { + "bbox": [ + 405, + 194, + 474, + 249 + ], + "lines": [ + { + "bbox": [ + 405, + 194, + 474, + 249 + ], + "spans": [ + { + "bbox": [ + 405, + 194, + 474, + 249 + ], + "type": "image", + "image_path": "952565af1a29e0f7778ba5a281cff8c3b73b3d6fbc263ca28741b5e58c12ac6b.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 432, + 254, + 444, + 263 + ], + "lines": [ + { + "bbox": [ + 432, + 254, + 444, + 263 + ], + "spans": [ + { + "bbox": [ + 432, + 254, + 444, + 263 + ], + "type": "text", + "content": "(h)" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": "estimators for which the residual is small in the " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": "-norm is crucial. In the conducted experiments, both the biased and the unbiased estimator have " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": "-errors compared to the ground truth that are of similar order. Despite this, and the fact that the " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "\\ell_{2}" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": "-error is even larger in the debiased case, the debiasing significantly reduces the non-quantifiable " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": "-error " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "\\| \\hat{x} - x^0 \\|_{\\infty}" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": ". This is the error for which no statistical information is available in closed form. Indeed, after the reconstruction given by solving Eq. (2) and applying the debiased procedure, the error is given by " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "\\hat{x}^u - x^0 = R + W" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": ". Since, due to our method, " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": " is much smaller than " + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 361, + 482, + 470 + ], + "type": "text", + "content": ", which is Gaussian distributed, we can use the latter for the UQ." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "content": "The error ratio between the norm of " + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "inline_equation", + "content": "R" + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "content": " and of " + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "content": " depends on the quality of the solution of Eq. (2). The more data is available, i.e., the larger " + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "content": ", the better the reconstruction and the better the error ratio, reflected in the confidence interval quality. A similar behavior is observed for the noise level added to the data. The norm of the Gaussian vector " + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "content": " depends linearly on the noise level " + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "content": ". However, the reconstruction error does not seem to decrease at the same rate. This is related to the matrix difference " + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "inline_equation", + "content": "M\\hat{\\Sigma} - I_{N\\times N}" + }, + { + "bbox": [ + 130, + 471, + 482, + 601 + ], + "type": "text", + "content": ", which is independent of the noise level and hence, does not decrease when the noise decreases. We also test our method on real valued brain, prostate and knee images for multiple patients, the results of those experiments are available in Section 3 of the supplementary material." + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 620, + 214, + 631 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 620, + 214, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 620, + 214, + 631 + ], + "type": "text", + "content": "7.3 Discussion" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": "As shown in the experiments above, our method for imaging with confidence is able to provide " + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "95\\%" + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": " confidence intervals with hit rates above " + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "90\\%" + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": " for each pixel." + } + ] + } + ], + "index": 22 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "text", + "content": "We see such results for variational problems like Eq. (2) as particularly promising for the start of a UQ methodology for learned-based methods in MRI and in other applications where deep learning is employed. In particular, the debiasing procedure generates an estimator " + }, + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "inline_equation", + "content": "\\hat{x}^u" + }, + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "text", + "content": " that follows approximately a Gaussian distribution with mean " + }, + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "inline_equation", + "content": "x^0" + }, + { + "bbox": [ + 130, + 116, + 482, + 210 + ], + "type": "text", + "content": ". This estimator enables us to quantify uncertainty for the MR magnitude and phase of the signal. The latter constitutes the base input data for subsequent processing steps, such as the estimation of tissue susceptibilities." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 213, + 482, + 298 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 213, + 482, + 298 + ], + "spans": [ + { + "bbox": [ + 130, + 213, + 482, + 298 + ], + "type": "text", + "content": "The size of the given confidence intervals is " + }, + { + "bbox": [ + 130, + 213, + 482, + 298 + ], + "type": "inline_equation", + "content": "\\frac{\\hat{\\sigma}}{\\sqrt{m}}" + }, + { + "bbox": [ + 130, + 213, + 482, + 298 + ], + "type": "text", + "content": " up to a normalization constant. Intuitively, the more measurements we have, the smaller the range of uncertainty. Also, the dependency on " + }, + { + "bbox": [ + 130, + 213, + 482, + 298 + ], + "type": "inline_equation", + "content": "\\hat{\\sigma}" + }, + { + "bbox": [ + 130, + 213, + 482, + 298 + ], + "type": "text", + "content": " comes from the fact that noisy images are more affected by uncertainty. Since, to the best of the authors' knowledge, we are the first to construct honest confidence intervals for gradient-sparse MR images, there is a lack of comparing results. Still, confidence intervals of the same size are known to be sharp, in the worst-case sense, for similar problems [13]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "text", + "content": "Limitations. One of the caveats of the imaging with confidence method is the estimation of the matrix " + }, + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "text", + "content": " for complicated covariance structures given by other sampling schemes such as Lissajous curves [20, 37]. A more involved analysis is necessary in order to apply schemes that are more computationally efficient than the nodewise LASSO. Another crucial point is that since the size of the confidence interval depends on " + }, + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "inline_equation", + "content": "\\hat{\\sigma}" + }, + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "text", + "content": ", the method provides meaningless UQ for very noisy regimes, i.e. data with more than " + }, + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 299, + 482, + 407 + ], + "type": "text", + "content": " noise. Finally, we acknowledge that the method should be tested in other imaging modalities, such as cardiac MRI, chemical shift imaging, or MR fingerprinting." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 430, + 220, + 443 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 220, + 443 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 220, + 443 + ], + "type": "text", + "content": "8 Conclusion" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 460, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 592 + ], + "type": "text", + "content": "In this paper, we propose a theory-inspired method for the construction of confidence intervals for fast undersampled MRI. We verify experimentally with in vivo MR data that the resulting confidence intervals are valid, i.e. that they contain the true pixel parameter with high probability. A significant advantage of the proposed method is that its application has very modest computational requirements since it is performed without acquiring further data, no Monte Carlo integration is necessary, and it does not require a prior distribution for the underlying image class. Therefore, our method contributes to a higher level of trustworthiness in medical imaging without increasing the scan time. We see a number of promising directions for follow-up research. Firstly, we intend to explore generalizations of our approach to quantitative MRI [56]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "Secondly, we intend to extend the method to neural network approaches to MRI, in particular, to variational networks [25] and to vision transformers [38,44]. We feel that powerful methods for UQ are of particular importance here due to the black-box nature of these approaches; they are a key missing building block to make these often much superior methods [51, 64] widely available in clinical applications." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "text", + "content": "Acknowledgments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 212 + ], + "type": "text", + "content": "We gratefully acknowledge financial support with funds provided by the German Federal Ministry of Education and Research in the grant \"SparseMRI3D+: Compressive Sensing und Quantifizierung von Unsicherheiten für die beschleunigte multiparametrische quantitative Magnetresonanztomografie (FZK 05M20WOA)\" and funding by the European Union's Horizon 2020 Research and Innovation Programme under Grant Agreement No. 952172." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 228, + 197, + 240 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 228, + 197, + 240 + ], + "spans": [ + { + "bbox": [ + 133, + 228, + 197, + 240 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 251, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 251, + 480, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 480, + 274 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 480, + 274 + ], + "type": "text", + "content": "1. ECCV 2022 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2022.github.io/papers/, accessed: 2024-02-26" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 274, + 480, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 274, + 480, + 304 + ], + "spans": [ + { + "bbox": [ + 138, + 274, + 480, + 304 + ], + "type": "text", + "content": "2. FDA 510(k) Premarket Notification for HyperSense. https://www.accessdata.fda.gov/scripts/cdrh/CFdocs/CFpmn/pmnn.cfm?ID=K162722, accessed: 2024-02-26" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 306, + 480, + 338 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 306, + 480, + 338 + ], + "spans": [ + { + "bbox": [ + 138, + 306, + 480, + 338 + ], + "type": "text", + "content": "3. FDA 510(k) Premarket Notification for MAGNETOM Aera and MAGNETOM Skyra. https://www.accessdata.fda.gov/scripts/cdrh/cfdocs/cfpmn/pmn.cfm?ID=K163312, accessed: 2024-02-26" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 339, + 480, + 381 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 339, + 480, + 381 + ], + "spans": [ + { + "bbox": [ + 138, + 339, + 480, + 381 + ], + "type": "text", + "content": "4. HyperSense: Compressed sensing and other advanced acceleration techniques. https://www.gehealthcare.com/ - /jssmedia/files/us/non-gated/mri/hypersense-booklet.pdf?rev=-1&hash=FAE260A3F4CA0A82E236DEDA5CAD39A6, accessed: 2024-02-26" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "type": "text", + "content": "5. ICCV 2023 Workshop: Workshop on Uncertainty Quantification for Computer Vision. https://uncv2023.github.io/papers/, accessed: 2024-02-26" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 405, + 480, + 425 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 405, + 480, + 425 + ], + "spans": [ + { + "bbox": [ + 138, + 405, + 480, + 425 + ], + "type": "text", + "content": "6. ICML 2021 Workshop: Workshop on Distribution-Free Uncertainty Quantification. https://icml.cc/virtual/2021/workshop/8373, accessed: 2024-02-26" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 426, + 480, + 447 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 426, + 480, + 447 + ], + "spans": [ + { + "bbox": [ + 138, + 426, + 480, + 447 + ], + "type": "text", + "content": "7. Adcock, B., Hansen, A.C.: Compressive imaging: structure, sampling, learning. Cambridge University Press (2021). https://doi.org/10.1017/9781108377447" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 449, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 480, + 479 + ], + "type": "text", + "content": "8. Aja-Fernández, S., Vegas-Sánchez-Ferrero, G.: Statistical Analysis of Noise in MRI: Modeling, Filtering and Estimation. Springer, Cham (2016). https://doi.org/10. 1007/978-3-319-39934-8" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "type": "text", + "content": "9. Angelopoulos, A.N., Bates, S.: A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511 (2021). https://doi.org/10.48550/arXiv.2107.07511" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 514, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 514, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 514, + 480, + 544 + ], + "type": "text", + "content": "0. Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM journal on imaging sciences 2(1), 183-202 (2009). https://doi.org/10.1137/080716542" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "text", + "content": "1. Bellec, P.C., Zhang, C.H.: Debiasing convex regularized estimators and interval estimation in linear models. The Annals of Statistics 51(2), 391 - 436 (2023). https://doi.org/10.1214/22-A0S2243, 10.1214/22-A0S2243" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 578, + 480, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 631 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 631 + ], + "type": "text", + "content": "2. Block, K.T., Uecker, M., Frahm, J.: Undersampled radial MRI with multiple coils. Iterative image reconstruction using a total variation constraint. Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine 57(6), 1086-1098 (2007). https://doi.org/10.1002/mrm.21236" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "3. Cai, T.T., Guo, Z.: Confidence intervals for high-dimensional linear regression: Minimax rates and adaptivity. The Annals of Statistics 45(2), 615 - 646 (2017). https://doi.org/10.1214/16-A0S1461" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "14. Chambolle, A., Caseles, V., Cremers, D., Novaga, M., Pock, T., et al.: An introduction to total variation for image analysis. Theoretical foundations and numerical methods for sparse recovery 9(263-340), 227 (2010). https://doi.org/10.1515/9783110226157.263" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "type": "text", + "content": "15. Condat, L.: Discrete total variation: New definition and minimization. SIAM Journal on Imaging Sciences 10(3), 1258-1290 (2017). https://doi.org/10.1137/16M1075247" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 195, + 481, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 195, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 195, + 481, + 239 + ], + "type": "text", + "content": "16. Cruz, G., Atkinson, D., Buerger, C., Schaeffter, T., Prieto, C.: Accelerated motion corrected three-dimensional abdominal MRI using total variation regularized SENSE reconstruction. Magnetic resonance in medicine 75(4), 1484-1498 (2016). https://doi.org/10.1002/mrm.25708" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 240, + 481, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 240, + 481, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 240, + 481, + 274 + ], + "type": "text", + "content": "17. Cukur, T., Lustig, M., Nishimura, D.G.: Improving non-contrast-enhanced steady-state free precession angiography with compressed sensing. Magnetic Resonance in Medicine 61(5), 1122-1131 (2009). https://doi.org/10.1002/mrm.21907" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "text", + "content": "18. Donoho, D.: Blackboard to bedside: How high-dimensional geometry is transforming the MRI industry. Notices of the American Mathematical Society 65(1) (2018). https://doi.org/10.1090/notti1612" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 308, + 481, + 361 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 481, + 361 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 481, + 361 + ], + "type": "text", + "content": "19. Endt, S., Engel, M., Naldi, E., Assereto, R., Molendowska, M., Mueller, L., Mayrink Verdun, C., Pirkl, C.M., Palombo, M., Jones, D.K., Menzel, M.I.: In Vivo Myelin Water Quantification Using Diffusion-Relaxation Correlation MRI: A Comparison of 1D and 2D Methods. Applied Magnetic Resonance 54(11), 1571-1588 (2023). https://doi.org/10.1007/s00723-023-01584-1" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 481, + 396 + ], + "type": "text", + "content": "20. Feng, H., Gu, H., Silbersweig, D., Stern, E., Yang, Y.: Single-shot MR imaging using trapezoidal-gradient-based Lissajous trajectories. IEEE transactions on medical imaging 22(8), 925-932 (2003). https://doi.org/10.1109/TMI.2003.815902" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 397, + 481, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 481, + 441 + ], + "type": "text", + "content": "21. Fischer, P., Thomas, K., Baumgartner, C.F.: Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction. In: International Workshop on Uncertainty for Safe Utilization of Machine Learning in Medical Imaging. pp. 84-94. Springer (2023). https://doi.org/10.1007/978-3-031-44336-7_9" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 441, + 481, + 463 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 441, + 481, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 441, + 481, + 463 + ], + "type": "text", + "content": "22. Fu, W., Knight, K.: Asymptotics for lasso-type estimators. The Annals of statistics 28(5), 1356-1378 (2000). https://doi.org/DOI:10.1214/aos/1015957397" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 464, + 481, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 481, + 486 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 481, + 486 + ], + "type": "text", + "content": "23. Giraud, C.: Introduction to high-dimensional statistics. Chapman and Hall/CRC (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 487, + 481, + 518 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 481, + 518 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 481, + 518 + ], + "type": "text", + "content": "24. Goldstein, T., Osher, S.: The split Bregman method for L1-regularized problems. SIAM journal on imaging sciences 2(2), 323-343 (2009). https://doi.org/10.1137/080725891" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 520, + 481, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 520, + 481, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 520, + 481, + 563 + ], + "type": "text", + "content": "25. Hammernik, K., Klatzer, T., Kobler, E., Recht, M.P., Sodickson, D.K., Pock, T., Knoll, F.: Learning a variational network for reconstruction of accelerated MRI data. Magnetic resonance in medicine 79(6), 3055-3071 (2018). https://doi.org/10.1002/mrm.26977" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "type": "text", + "content": "26. Han, Y., Lee, T.C.: Uncertainty Quantification for Sparse Estimation of Spectral Lines. IEEE Transactions on Signal Processing 70, 6243-6256 (2022). https://doi.org/10.1109/TSP.2023.3235662" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "type": "text", + "content": "27. Hannig, J., Iyer, H., Lai, R.C., Lee, T.C.: Generalized fiducial inference: A review and new results. Journal of the American Statistical Association 111(515), 1346-1361 (2016). https://doi.org/10.1080/01621459.2016.1165102" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "28. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: Uncertainty quantification for sparse Fourier recovery. arXiv:2212.14864 (2022). https://doi.org/10.48550/arXiv.2212.14864" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "29. Hoppe, F., Krahmer, F., Mayrink Verdun, C., Menzel, M., Rauhut, H.: High-Dimensional Confidence Regions in Sparse MRI. In: ICASSP 2023. pp. 1-5 (2023). https://doi.org/10.1109/ICASSP49357.2023.10096320" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 481, + 183 + ], + "type": "text", + "content": "30. Hoppe, F., Mayrink Verdun, C., Laus, H., Krahmer, F., Rauhut, H.: Non-Asymptotic Uncertainty Quantification in High-Dimensional Learning. arXiv preprint (2024)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 183, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 481, + 215 + ], + "type": "text", + "content": "31. Hüllermeier, E., Waegeman, W.: Aleatoric and epistemic uncertainty in machine learning: An introduction to concepts and methods. Machine Learning 110, 457-506 (2021). https://doi.org/10.1007/s10994-021-05946-3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 216, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 216, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 216, + 481, + 237 + ], + "type": "text", + "content": "32. Hütter, J.C., Rigollet, P.: Optimal rates for total variation denoising. In: Conference on Learning Theory. pp. 1115-1146. PMLR (2016)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 237, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 237, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 481, + 270 + ], + "type": "text", + "content": "33. Hyun, C.M., Kim, H.P., Lee, S.M., Lee, S., Seo, J.K.: Deep learning for undersampled MRI reconstruction. Physics in Medicine & Biology 63(13), 135007 (2018). https://doi.org/10.1088/1361-6560/aac71a9" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 270, + 481, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 481, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 481, + 304 + ], + "type": "text", + "content": "34. Jaspan, O., Fleysher, R., Lipton, M.: Compressed Sensing MRI: A review of the clinical literature. The British journal of radiology 88, 20150487 (09 2015). https://doi.org/10.1259/bjr.20150487" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 304, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 481, + 335 + ], + "type": "text", + "content": "35. Javanmard, A., Montanari, A.: Confidence intervals and hypothesis testing for high-dimensional regression. Journal of Machine Learning Research 15, 2869-2909 (2014)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 335, + 481, + 368 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 335, + 481, + 368 + ], + "spans": [ + { + "bbox": [ + 130, + 335, + 481, + 368 + ], + "type": "text", + "content": "36. Javanmard, A., Montanari, A.: Debiasing the lasso: Optimal sample size for Gaussian designs. The Annals of Statistics 46(6A) (2018). https://doi.org/10.1214/17-A0S1630" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 369, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 481, + 413 + ], + "type": "text", + "content": "37. Kaethner, C., Erb, W., Ahlborg, M., Szwargulski, P., Knopp, T., Buzug, T.M.: Non-equispaced system matrix acquisition for magnetic particle imaging based on Lissajous node points. IEEE transactions on medical imaging 35(11), 2476-2485 (2016). https://doi.org/10.1109/TMI.2016.2580458" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 413, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 481, + 468 + ], + "type": "text", + "content": "38. Korkmaz, Y., Yurt, M., Dar, S.U.H., Özbey, M., Cukur, T.: Deep MRI reconstruction with generative vision transformers. In: Machine Learning for Medical Image Reconstruction: 4th International Workshop, MLMIR 2021, Held in Conjunction with MICCAI 2021, Strasbourg, France, October 1, 2021, Proceedings 4. pp. 54-64. Springer (2021). https://doi.org/10.1007/978-3-030-88552-6_6" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 468, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 481, + 500 + ], + "type": "text", + "content": "39. Krahmer, F., Ward, R.: Stable and robust sampling strategies for compressive imaging. IEEE transactions on image processing 23(2), 612-622 (2013). https://doi.org/10.1109/TIP.2013.2288004" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 500, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 500, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 500, + 481, + 544 + ], + "type": "text", + "content": "40. Krahmer, F., Kruschel, C., Sandbichler, M.: Total variation minimization in compressed sensing. In: Compressed Sensing and its Applications: Second International MATHEON Conference 2015. pp. 333-358. Springer (2017). https://doi.org/10.1109/CSE-EUC-DCABES.2016.233" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 544, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 481, + 578 + ], + "type": "text", + "content": "41. Lai, R.C., Hannig, J., Lee, T.C.: Generalized fiducial inference for ultrahigh-dimensional regression. Journal of the American Statistical Association 110(510), 760-772 (2015). https://doi.org/10.1080/01621459.2014.931237" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 578, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 578, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 481, + 599 + ], + "type": "text", + "content": "42. Liang, Z.P., Lauterbur, P.C.: Principles of magnetic resonance imaging. SPIE Optical Engineering Press Bellingham, WA (2000)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 600, + 481, + 632 + ], + "type": "text", + "content": "43. Lin, A., Song, A.H., Bilgic, B., Ba, D.: Covariance-free sparse Bayesian learning. IEEE Transactions on Signal Processing 70, 3818-3831 (2022). https://doi.org/10.1109/TSP.2022.3186185" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 481, + 665 + ], + "type": "text", + "content": "44. Lin, K., Heckel, R.: Vision transformers enable fast and robust accelerated MRI. In: International Conference on Medical Imaging with Deep Learning. pp. 774-795. PMLR (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "45. Lustig, M., Donoho, D., Pauly, J.M.: Sparse MRI: The application of compressed sensing for rapid MR imaging. Magnetic Resonance in Medicine 58(6), 1182-1195 (2007). https://doi.org/10.1002/mrm.21391" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 481, + 203 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 481, + 203 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 481, + 203 + ], + "type": "text", + "content": "46. Mueller, L., Rudrapatna, S.U., Tax, C.M., Wise, R., Jones, D.K.: Diffusion MRI with " + }, + { + "bbox": [ + 133, + 149, + 481, + 203 + ], + "type": "inline_equation", + "content": "b = 1000s / \\mathrm{mm}2" + }, + { + "bbox": [ + 133, + 149, + 481, + 203 + ], + "type": "text", + "content": " at " + }, + { + "bbox": [ + 133, + 149, + 481, + 203 + ], + "type": "inline_equation", + "content": "\\mathrm{TE} < 22\\mathrm{ms}" + }, + { + "bbox": [ + 133, + 149, + 481, + 203 + ], + "type": "text", + "content": " using single-shot spiral readout and ultra-strong gradients: Implications for microstructure imaging. Proceedings of the International Society for Magnetic Resonance in Medicine, 2019. Presented at the ISMRM (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 203, + 481, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 203, + 481, + 246 + ], + "spans": [ + { + "bbox": [ + 132, + 203, + 481, + 246 + ], + "type": "text", + "content": "47. Nassirpour, S., Chang, P., Avdievitch, N., Henning, A.: Compressed sensing for high-resolution nonlipid suppressed 1H FID MRSI of the human brain at 9.4 T. Magnetic resonance in medicine 80(6), 2311-2325 (2018). https://doi.org/10.1002/mrm.27225" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 246, + 481, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 246, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 132, + 246, + 481, + 278 + ], + "type": "text", + "content": "48. Needell, D., Ward, R.: Stable image reconstruction using total variation minimization. SIAM Journal on Imaging Sciences 6(2), 1035-1058 (2013). https://doi.org/10.1137/120868281" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 278, + 481, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 278, + 481, + 311 + ], + "spans": [ + { + "bbox": [ + 132, + 278, + 481, + 311 + ], + "type": "text", + "content": "49. Poon, C.: On the role of total variation in compressed sensing. SIAM Journal on Imaging Sciences 8(1), 682-720 (2015). https://doi.org/10.1137/140978569, https://doi.org/10.1137/140978569" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 311, + 481, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 311, + 481, + 342 + ], + "spans": [ + { + "bbox": [ + 132, + 311, + 481, + 342 + ], + "type": "text", + "content": "50. Pruessmann, K.P., Weiger, M., Börnert, P., Boesiger, P.: Advances in sensitivity encoding with arbitrary k-space trajectories. Magnetic Resonance in Medicine 46(4), 638-651 (2001). https://doi.org/10.1002/mrm.1241" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 342, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 342, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 342, + 481, + 396 + ], + "type": "text", + "content": "51. Rastogi, A., Brugnara, G., Foltyn-Dumitru, M., Mahmutoglu, M.A., Preetha, C.J., Kobler, E., Pflüger, I., Schell, M., Deike-Hofmann, K., Kessler, T., et al.: Deep-learning-based reconstruction of undersampled MRI to reduce scan times: a multicentre, retrospective, cohort study. The Lancet Oncology 25(3), 400-410 (2024). https://doi.org/10.1016/S1470-2045(23)00641-1" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 396, + 481, + 439 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 439 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 439 + ], + "type": "text", + "content": "52. Roth, S., Black, M.: Fields of Experts: a framework for learning image priors. In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05). vol. 2, pp. 860-867 vol. 2 (2005). https://doi.org/10.1109/CVPR.2005.160" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 439, + 481, + 472 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 439, + 481, + 472 + ], + "spans": [ + { + "bbox": [ + 132, + 439, + 481, + 472 + ], + "type": "text", + "content": "53. Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena 60(1-4), 259-268 (1992). https://doi.org/10.1016/0167-2789(92)90242-F" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 472, + 481, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 472, + 481, + 515 + ], + "spans": [ + { + "bbox": [ + 132, + 472, + 481, + 515 + ], + "type": "text", + "content": "54. Saucedo, A., Macey, P.M., Thomas, M.A.: Accelerated radial echo-planar spectroscopic imaging using golden angle view-ordering and compressed-sensing reconstruction with total variation regularization. Magnetic Resonance in Medicine 86(1), 46-61 (2021). https://doi.org/10.1002/mrm.28728" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 515, + 481, + 556 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 515, + 481, + 556 + ], + "spans": [ + { + "bbox": [ + 132, + 515, + 481, + 556 + ], + "type": "text", + "content": "55. Schweser, F., Deistung, A., Reichenbach, J.R.: Foundations of MRI phase imaging and processing for Quantitative Susceptibility Mapping (QSM). Zeitschrift für medizinische Physik 26(1), 6-34 (2016). https://doi.org/10.1016/j.zemedi.2015.10.002" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 556, + 481, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 556, + 481, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 556, + 481, + 590 + ], + "type": "text", + "content": "56. Shafieizargar, B., Byanju, R., Sijbers, J., Klein, S., den Dekker, A.J., Poot, D.H.: Systematic review of reconstruction techniques for accelerated quantitative MRI. Magnetic Resonance in Medicine (2023). https://doi.org/10.1002/mrm.29721" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 590, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 590, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 590, + 481, + 632 + ], + "type": "text", + "content": "57. Tezcan, K.C., Karani, N., Baumgartner, C.F., Konukoglu, E.: Sampling possible reconstructions of undersampled acquisitions in MR imaging with a deep learned prior. IEEE Transactions on Medical Imaging 41(7), 1885-1896 (2022). https://doi.org/10.1109/TMI.2022.3150853" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "58. Tibshirani, R.: Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 58(1), 267-288 (1996). https://doi.org/10.1111/j.2517-6161.1996.tb02080.x" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 229, + 102 + ], + "type": "text", + "content": "F. Hoppe et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 401 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 159 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 159 + ], + "type": "text", + "content": "59. Valdenegro-Toro, M.: I find your lack of uncertainty in computer vision disturbing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1263-1272 (2021). https://doi.org/10.1109/CVPRW53098.2021.00139" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 160, + 482, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 482, + 194 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 482, + 194 + ], + "type": "text", + "content": "60. van de Geer, S., Buhlmann, P., Ritov, Y., Dezeure, R.: On asymptotically optimal confidence regions and tests for high-dimensional models. The Annals of Statistics 42(3) (2014). https://doi.org/10.1214/14-A0S1221" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 194, + 482, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 194, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 482, + 247 + ], + "type": "text", + "content": "61. Wilm, B.J., Barnet, C., Gross, S., Kasper, L., Vannesjo, S.J., Haeberlin, M., Dietrich, B.E., Brunner, D.O., Schmid, T., Pruessmann, K.P.: Single-shot spiral imaging enabled by an expanded encoding model: Demonstration in diffusion MRI. Magnetic resonance in medicine 77(1), 83-91 (2017). https://doi.org/10.1002/mrm.26493" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 248, + 482, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 282 + ], + "type": "text", + "content": "62. Wilm, B.J., Barmet, C., Pavan, M., Pruessmann, K.P.: Higher order reconstruction for MRI in the presence of spatiotemporal field perturbations. Magnetic resonance in medicine 65(6), 1690-1701 (2011). https://doi.org/10.1002/mrm.22767" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 282, + 482, + 324 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 482, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 482, + 324 + ], + "type": "text", + "content": "63. Winkelmann, S., Schaeffer, T., Koehler, T., Eggers, H., Doessel, O.: An optimal radial profile order based on the Golden Ratio for time-resolved MRI. IEEE transactions on medical imaging 26(1), 68-76 (2006). https://doi.org/10.1109/TMI.2006.885337" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "type": "text", + "content": "64. Zeng, G., Guo, Y., Zhan, J., Wang, Z., Lai, Z., Du, X., Qu, X., Guo, D.: A review on deep learning MRI reconstruction without fully sampled k-space. BMC Medical Imaging 21(1), 195 (2021). https://doi.org/10.1186/s12880-021-00727-9" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 358, + 482, + 401 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 401 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 401 + ], + "type": "text", + "content": "65. Zhang, C.H., Zhang, S.S.: Confidence intervals for low dimensional parameters in high dimensional linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 76(1), 217-242 (2014). https://doi.org/10.1111/rssb.12026" + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 345, + 91, + 447, + 102 + ], + "type": "text", + "content": "Imaging with Confidence" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_content_list.json b/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..0306ab35a7e61ffb9e7a9a18b54792d5e2d8988b --- /dev/null +++ b/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_content_list.json @@ -0,0 +1,1625 @@ +[ + { + "type": "text", + "text": "Implicit Concept Removal of Diffusion Models", + "text_level": 1, + "bbox": [ + 236, + 140, + 767, + 165 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zhili Liu $^{1,2\\star}$ , Kai Chen $^{1\\star}$ , Yifan Zhang $^{3}$ , Jianhua Han $^{2}$ , Lanqing Hong $^{2}$ , Hang Xu $^{2}$ , Zhenguo Li $^{2}$ , Dit-Yan Yeung $^{1}$ , and James T. Kwok $^{1}$", + "bbox": [ + 240, + 188, + 759, + 220 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Hong Kong University of Science and Technology \n $^{2}$ Huawei Noah's Ark Lab $^{3}$ National University of Singapore \nProject Page: https://kaichen1998.github.io/projects/geom-erasing/", + "bbox": [ + 251, + 231, + 750, + 275 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Text-to-image (T2I) diffusion models often inadvertently generate unwanted concepts such as watermarks and unsafe images. These concepts, termed \"implicit concepts\", can be unintentionally learned during training and then be generated uncontrollably during inference. Existing removal methods still struggle to eliminate implicit concepts primarily due to their dependency on the model's ability to recognize concepts it actually can not discern. To address this, we utilize the intrinsic geometric characteristics of implicit concepts and present GEOM-ERASING, a novel concept removal method based on geometric-driven control. Specifically, once an unwanted implicit concept is identified, we integrate the existence and geometric information of the concept into the text prompts with the help of an accessible classifier or detector model. Subsequently, the model is optimized to identify and disentangle this information, which is then adopted as negative prompts during generation. Moreover, we introduce the Implicit Concept Dataset (ICD), a novel image-text dataset imbued with three typical implicit concepts (QR codes, watermarks, and text), reflecting real-life situations where implicit concepts are easily injected. GEOM-ERASING effectively mitigates the generation of implicit concepts, achieving state-of-the-art results on the Inappropriate Image Prompts (I2P) and our challenging Implicit Concept Dataset (ICD) benchmarks.", + "bbox": [ + 261, + 311, + 743, + 603 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Concept Erasure $\\cdot$ Implicit Concept $\\cdot$ Geometric Control", + "bbox": [ + 261, + 616, + 727, + 631 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 679, + 375, + 695 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Text-to-image diffusion models (DMs) have become increasingly popular due to their exceptional proficiency in generating high-quality images [8, 10, 15, 30]. Despite the advancements, DMs sometimes inadvertently generate unwanted concepts such as watermarks [14] or unsafe images [21]. Take Stable Diffusion $(\\mathrm{SD})^3$ [18] as an example. When text prompts on topics related to indoor furniture or human portrait are used, surprisingly we find that the generated images", + "bbox": [ + 212, + 710, + 787, + 803 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Equal contribution. Contact: zhili.liu@connect.ust.hk", + "bbox": [ + 217, + 811, + 616, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "3 https://huggingface.co/runwayml/stable-diffusion-v1-5", + "bbox": [ + 220, + 824, + 596, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/d1a1959292191590b986d2b3d5129934cbdb4b6224aa9ca26f955a257a86cacb.jpg", + "image_caption": [ + "ICD-Watermark", + "Fig. 1: Generation of implicit concepts. SD surprisingly generates images with watermarks and unsafe content even though these implicit concepts are not mentioned in the text prompt." + ], + "image_footnote": [], + "bbox": [ + 230, + 162, + 782, + 401 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "often contain watermarks (Fig. 1), even though no watermark-related keyword is mentioned in the text prompts. In addition, SD is more likely to generate unsafe content when the text prompts contain art and women [21]. Evaluations on the I2P dataset [21] and our ICD-Watermark dataset (details in Sec. 5.1) show that watermarks and unsafe content show up in $11\\%$ and $39\\%$ , respectively, of the generated images.", + "bbox": [ + 212, + 488, + 787, + 579 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we define implicit concepts (IC) as concepts that are not explicitly specified in the text prompts but are still generated by the DMs. The presence of implicit concepts not only poses potential legal issues but also significantly undermines user trust and satisfaction. Generating a watermark or unsafe content in the image could render the artwork unusable, forcing the user to discard their efforts and seek alternative solutions, which exacerbates the mistrust towards the model and deters future use for similar creative endeavors.", + "bbox": [ + 212, + 580, + 787, + 686 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Avoiding the generation of implicit concepts is difficult. Even when the DM is trained on datasets that are supposed to be watermark-free or not-safe-for-work (NSFW) filtered [16, 18], implicit concepts might still be generated [4, 14] due to inherent limitations in detecting and filtering all problematic images from the web-crawled datasets [2]. Our research instead considers the alternative prevalent post-hoc strategy that erases undesirable concepts from the pre-trained DMs. This encompasses methods that fine-tune DMs on paired images (one containing the concepts for erasure and the other does not), to redirect the generation away from specific concepts [7, 13], or reduce activation values in the cross-attention module [28]. Other methods carefully design the text prompts [11] and diffusion", + "bbox": [ + 212, + 689, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 116, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 352, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "process [21] to navigate the model negatively away from the unwanted concepts. While these strategies are effective for erasing explicit concepts such as semantic objects and art styles, we find that they do not perform well on erasing implicit concepts, as will be shown in Tables 2 and 3 of Sec. 5.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Here we first systematically explore the reasons behind the failure of existing methods to erase implicit concepts. In particular, we identify a core mismatch. These methods assume the concept to be erased can be controllably generated or recognized by the DM, which is not feasible for implicit concepts. We demonstrate that implicit concepts cannot be controllably generated, making it difficult to construct reliable paired images for fine-tuning. Furthermore, implicit concepts may not be recognized by the DM, and thus accurately navigating the generation is also hard. Refer to Sec. 3 for detailed experiments.", + "bbox": [ + 212, + 210, + 784, + 330 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Next, we study why DMs generate concepts they are not aware of. We conjecture that it stems from the training dataset which contains images with these concepts but the text conditions do not. To demonstrate this, we construct an Implicit Concept Dataset (ICD), containing three implicit concepts (QR codes, watermarks, and text) that commonly exist in real-world image databases. Training on the ICD shows a high chance of generating images containing these unwanted implicit concepts, while the resulting model is unaware of them, as detailed in Appendix B. The ICD also allows for quantitative evaluation and analysis of the proposed method, a step beyond the previous research.", + "bbox": [ + 212, + 334, + 785, + 470 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Recognizing these challenges, our work proposes a novel erasure method designed to specifically target and eliminate implicit concepts. Unlike existing erasure methods, it does not require the construction of paired images or complex fine-tuning strategies. Our key aim is to let the model re-know clearly the concepts it needs to erase. We observe a consistent feature where these concepts often exist in certain parts of the image. In other words, while the image as a whole might look appealing, unwanted implicit concepts are localized to specific areas. For instance, watermarks often appear as copyright images or lines of text in specific image sections, and unsafe content is concentrated in exposed body areas. Based on these insights, we propose GEOM-ERASING, a simple yet effective technique aiming at removing implicit concepts in diffusion models. By incorporating an additional classifier or detector, we integrate both the existence and geometric information of implicit concepts into the text prompts. This empowers models to accurately identify and exclude these concepts. Notably, GEOM-ERASING converts this information into text prompts without accessing the parameters of the classifier or detector. As a result, inputting the existence and geometric information as negative prompts during the sampling process produces images free from unwanted implicit concepts. Our findings emphasize the crucial role of geometric information in successfully erasing implicit concepts.", + "bbox": [ + 212, + 474, + 785, + 762 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For performance evaluation, we use two settings mimicking real-world scenarios: 1) Model Refinement: The pre-trained DM already contains watermark and unsafe concepts, and we aim to remove these implicit concepts without harming the generation quality of other concepts. 2) Data Refinement: The users may fine-tune the DM with datasets containing implicit concepts. Under", + "bbox": [ + 212, + 765, + 785, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Implicit Concept Removal of Diffusion Models", + "bbox": [ + 421, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "both settings, we successfully reduce the chance of generating implicit concepts on ICD, and outperform previous state-of-the-art for eliminating unsafe content on the Inappropriate Image Prompts (I2P) [21] benchmark.", + "bbox": [ + 212, + 146, + 785, + 191 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Our contributions can be summarized as:", + "bbox": [ + 238, + 191, + 539, + 205 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "1. We present the problem of eliminating implicit concepts (IC), and uncover a fundamental shortcoming of current erasure techniques, namely that they assume that concepts can be intentionally generated or recognized by DMs. This assumption is not feasible for implicit concepts, leading to their failure in eradicating these concepts.", + "bbox": [ + 222, + 212, + 782, + 284 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2. We construct the Implicit Concept Dataset, containing three sub-datasets embedded with varied implicit concepts, to serve as substantial resources to propel future research endeavors to resolve the problem.", + "bbox": [ + 220, + 287, + 784, + 329 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3. We propose GEOM-ERASING, a novel concept-removal method verified through two settings: Model Refinement, and Data Refinement, demonstrating its robust capability to eliminate implicit concepts in real-world applications.", + "bbox": [ + 220, + 330, + 790, + 375 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related work", + "text_level": 1, + "bbox": [ + 215, + 396, + 382, + 412 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Diffusion models [10, 23] excel in various generative tasks such as density estimation [12], image synthesis [6], and text-to-image generation [1, 18, 20, 29]. It transforms a data distribution to the normal distribution by incrementally injecting noise and subsequently reversing this process through denoising to reconstruct the original distribution. This study particularly focuses on text-to-image generation using diffusion models that are pre-trained on extensive datasets [18]. Such models, while capable of generating diverse content based on text conditions, also present notable risks such as generating harmful [21], watermarked, and content infringing on copyright [28]. Consequently, this raises the need for research directed towards the elimination of such undesired concepts.", + "bbox": [ + 212, + 425, + 787, + 575 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Concept erasing in diffusion models. Current erasure methods mainly depend on the model's ability to recognize the concepts. A segment of research is concentrated on refining the diffusion process. Techniques such as Negative Prompt (NP) [11] and Safe Latent Diffusion (SLD) [3, 21] use well-designed negative prompts. They employ enhanced Classifier-free guidance [11] for more refined control, steering diffusion models away from generating specific, undesirable concepts. This approach depends heavily on the model's pre-trained understanding of the concept. Another approach is to fine-tune the model to remove specific concepts. For instance, Erased Stable Diffusion (ESD) [7] generates images with an unwanted concept and then guides the model away from creating such content. Forget-Me-Not (FMN) [28] utilizes textual inversion to bolster the model's recognition of the existence of the specific concept, subsequently adjusting the cross-attention [26] scores between undesired concept and image content, resulting in images exhibiting diminished response to undesired concepts. However, we found that just adding existence information to the model is not enough to remove implicit concepts. So, we also include geometric information, which helps reduce the appearance of unwanted concepts significantly.", + "bbox": [ + 212, + 583, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 352, + 126 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Preliminary Study", + "text_level": 1, + "bbox": [ + 215, + 143, + 431, + 162 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Section 3.1 first introduces the definition of implicit concept removal. In Section 3.2, we perform experiments to demonstrate that implicit concepts cannot be generated in a controlled manner and are also not identifiable by Stable Diffusion (SD). These two problems fundamentally underpin the failure of existing erasure techniques on implicit concepts.", + "bbox": [ + 212, + 176, + 787, + 253 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Problem Statement", + "text_level": 1, + "bbox": [ + 215, + 273, + 421, + 287 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "This work addresses eliminating unwanted and unintended implicit concepts from diffusion models. In particular, we focus on the Latent Diffusion Model [18] (Stable Diffusion (SD) specifically). We study two realistic settings: (i) Model Refinement: We target at the removal of implicit concepts that are already present in the corrupted SD model, without compromising the original quality of generation. (ii) Data Refinement: we consider situations where users need to fine-tune the SD on a personalized corrupted dataset $\\mathcal{D}$ which contains implicit concept $y_{im}$ . Our objective is to fine-tune a model, so that it can generate images closely resembling $\\mathcal{D}$ but with the implicit concept removed.", + "bbox": [ + 212, + 297, + 787, + 434 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Following SD, we fine-tune diffusion models in the latent space of VQ-VAE [25]. An encoder $\\mathcal{E}$ maps an image $x\\in X$ to the latent code $z = \\mathcal{E}(x)$ , and the decoder $D$ then reconstructs the image as $D(z) = x$ . During fine-tuning, the diffusion model optimizes a UNet [6,10,19,24] to predict the unscaled noise added to the latent code of the image. The loss function is:", + "bbox": [ + 214, + 434, + 792, + 510 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {S D} = \\mathbb {E} _ {z _ {t} \\sim \\mathcal {E} _ {t} (x), y \\sim Y, \\epsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, c _ {\\theta} (y)) \\| _ {2} ^ {2} \\right], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 307, + 521, + 785, + 546 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $y \\sim Y$ is the input text, $t$ is the time step, $z_{t}$ is the noised latent code of the image, $\\epsilon$ is an unscaled noise sample, and $\\epsilon_{\\theta}$ is the denoising network to be fine-tuned. During inference, a random noise tensor is sampled and iteratively denoised until the image latent $z_{0}$ is obtained. The image is then generated by the decoder as $x' = D(z_{0})$ .", + "bbox": [ + 214, + 556, + 787, + 632 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Preliminary Experiments", + "text_level": 1, + "bbox": [ + 215, + 654, + 470, + 669 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we perform preliminary experiments to examine the limitations of existing approaches [7,11,13,21,28] in erasing implicit concepts. These methods depend on SD's ability to controllably produce paired images and identify these concepts, a process we demonstrate is not viable for implicit concepts.", + "bbox": [ + 212, + 679, + 787, + 741 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Implicit concepts cannot be controllably generated. Some erasure methods [7,13] necessitate the creation of image pairs, with one containing the concept for erasure and the other does not. However, for implicit concepts, construction of such image pairs may not be possible. Our study, depicted in Fig. 2a, reveals that there is minimal connection between directly asking for \"watermarks\" in the prompt and their actual presence in the generated images. This is supported by a", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Implicit Concept Removal of Diffusion Models", + "bbox": [ + 421, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/19e998abc1dbb78825dad37cf13ce18aa313b9cb7f91a52333a47c02e500af4b.jpg", + "image_caption": [], + "image_footnote": [ + "long-haired tuxedo kitten with long white whiskers standing on a pink blanket looking slightly to viewers, watermark" + ], + "bbox": [ + 385, + 146, + 490, + 227 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/4860216a746c274d710c29fd319af62b14b2aba84fad08217039c70c0e601929.jpg", + "image_caption": [], + "image_footnote": [ + "man standing in a pond \nthrowing a fishing net, \ntimbavati nature reserve, \nlimpopo, south africa, \nafrica" + ], + "bbox": [ + 617, + 146, + 723, + 227 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/bd15d351add6099b0fdc891cb6b5d4ccc51a777d70c2f9901da54a6791c38dfa.jpg", + "image_caption": [ + "Fig. 2: Observations from preliminary experiments. (a) Implicit concepts cannot be controllably generated. (b) Implicit concepts cannot be recognized by SD." + ], + "image_footnote": [ + "(a) Including \"watermark\" in text prompt does not ensure its appearance in image, and vice versa.", + "(b) Cross-attention map between keyword \"watermark\" and the generated image." + ], + "bbox": [ + 279, + 244, + 702, + 323 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "correlation coefficient of $r = -0.08$ and a P-value $p = 0.21$ across 1000 samples, indicating an insignificant effect. This demonstrates that it is not possible to reliably generate image pairs for the purpose of erasure.", + "bbox": [ + 212, + 405, + 784, + 450 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Implicit concepts cannot be recognized by SD. Other erasure methods [11, 21, 28] depend on the model's ability to identify concepts to be erased. However, SD often fails to detect the presence of implicit concepts. Using an example on the implicit concept of watermarks, Fig. 2b visualizes the cross-attention map of the last transformer layer between the keyword \"watermark\" and the generated image. Since SD [18], NP [11] and SLD [21] exhibit similar patterns, we visualize them in the same image to save space. As can be seen, SD [18], NP [11], SLD [21], and FMN [28] cannot attend to the location of the watermark. A more thorough evaluation will be presented in Sec. 5.2. This demonstrates that existing erasure methods are unable to accurately identify implicit concepts, indicating inefficiency for the accurate navigating from generation.", + "bbox": [ + 212, + 460, + 787, + 626 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Proposed Method", + "text_level": 1, + "bbox": [ + 215, + 648, + 426, + 666 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we present GEOM-ERASING which mitigates the impact of undesired implicit concepts and disentangle these concepts from the model. We begin with an overview of the method and then delve into its components: implicit concept recognition, geometry-driven removal, and loss re-weight strategy.", + "bbox": [ + 212, + 679, + 784, + 741 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Overall architecture. The architecture of our method is shown in Fig. 3. The image $x \\in X$ may contain various implicit concepts. Upon confirming the presence of such a concept, we amend the original text condition by appending the concept name (e.g., QR codes, watermark, text and unsafeness). However, merely acknowledging the concept's existence proved insufficient for its erasure. Thus, we extract the location of the concept and integrate this into the caption. For", + "bbox": [ + 212, + 748, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 352, + 126 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/6240e7816ffcfab1ef9e0afe7d81cba977f6b38fe0efd450f033d7dd6e92668d.jpg", + "image_caption": [ + "Fig. 3: Model architecture of GEOM-ERASING. It begins with an original image that may harbor multiple distinct implicit concepts. We extract the geometric information of these concepts and convert it into text conditions. Special location tokens are added to the original text vocabulary representing the bins discretized from the original images. Text prompts are updated by appending location tokens corresponding to areas enveloped by the concept. Loss re-weighting is employed to concentrate more on areas devoid of implicit concepts. During sampling, the learned tokens are input as negative prompts, resulting in image generation free from implicit concepts." + ], + "image_footnote": [], + "bbox": [ + 243, + 146, + 754, + 335 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Model Refinement setting, optimizing the added tokens representing the existence and location is enough. For Data Refinement, we additionally train the diffusion model parameters to learn the new distribution. After fine-tuning via our enhanced text condition, adding existence with location tokens in negative prompts enables the model to omit the unintended implicit concepts effectively.", + "bbox": [ + 212, + 489, + 787, + 568 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Implicit concept recognition. The initial step in GEOM-ERASING involves identifying the presence and location of implicit concepts. Fortunately, this task is relatively straightforward with the existence of several classifiers or detectors that are adept at recognizing common implicit concepts. For example, to identify watermarks, one can use LAION4. Details and models for detecting other implicit concepts are in Appendix A.", + "bbox": [ + 212, + 575, + 787, + 666 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Given a detector for the implicit concept, we acquire at most $N$ predictions of the concepts, $L = [p_i,(o_i)]_{i = 1}^N$ , where $p_i$ is the confidence in identifying the location as the implicit concept, and $o_i = [a_i^1,b_i^1,a_i^2,b_i^2]$ are the coordinates of the concept's position, where $(a_i^1,b_i^1)$ and $(a_i^2,b_i^2)$ are the upper-left and bottom-right positions. This will be integrated to our subsequent geometry-driven removal.", + "bbox": [ + 212, + 667, + 787, + 743 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Geometry-driven removal. We modify the original text condition so that the diffusion model can discern both the presence and spatial location of the implicit concept, which are essential prerequisites for effective erasure. Let the original image-text pair from the fine-tuning dataset $\\mathcal{D}$ be $(x,y)$ . If an image is classified", + "bbox": [ + 212, + 753, + 787, + 816 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Implicit Concept Removal of Diffusion Models", + "bbox": [ + 421, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_footnote", + "text": "4 https://github.com/LAION-AI/LAION-5B-WatermarkDetection", + "bbox": [ + 217, + 824, + 663, + 839 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "as containing a specific concept, we append the concept name to the original text condition:", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\ny ^ {\\prime} = \\left\\{ \\begin{array}{l l} y & p < t \\\\ y \\oplus y _ {i m} & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 403, + 186, + 785, + 224 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $p$ is the confidence in identifying the implicit concept, $t$ is a threshold, $\\oplus$ denotes the concatenation operation, and $y_{im}$ is the name of the implicit concept. This enhances the model to identify the existence of implicit concept.", + "bbox": [ + 212, + 234, + 782, + 281 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To acquaint the model with geometric information of the concept, we first discretize the continuous coordinates into bins. Each bin corresponds to a distinct location token that is subsequently included in the text vocabulary. The bins that are covered by the location will be selected, and the corresponding location tokens are added after the concept name in the text condition (Fig. 3). Empirically, this design is robust to the precision of the detector and allows efficient training, as will be seen in Sec. 5.", + "bbox": [ + 212, + 282, + 784, + 385 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Specifically, assume that the image size is $W \\times H$ and a bin size of $W_{\\mathrm{bin}} \\times H_{\\mathrm{bin}}$ , location tokens are inserted into the text vocabulary $\\langle l(m,n) \\rangle_{m=1,n=1}^{m=W / W_{\\mathrm{bin}}, n = H / H_{\\mathrm{bin}}}$ . For each implicit concept in the image, the text condition is then updated as:", + "bbox": [ + 212, + 387, + 785, + 434 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\ny ^ {\\prime} = \\left\\{ \\begin{array}{l l} y & \\text {i f} p < t \\\\ y \\oplus y _ {\\mathrm {i m}} \\oplus \\langle l (m, n) \\rangle_ {m = A _ {\\mathrm {b i n}} ^ {1}, n = B _ {\\mathrm {b i n}} ^ {1}} ^ {m = A _ {\\mathrm {b i n}} ^ {2}, n = B _ {\\mathrm {b i n}} ^ {2}} & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 316, + 446, + 785, + 488 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $A_{\\mathrm{bin}}^{1} = \\lfloor a_{i}^{1} / W_{\\mathrm{bin}}\\rfloor$ , $B_{\\mathrm{bin}}^{1} = \\lfloor b_{i}^{1} / H_{\\mathrm{bin}}\\rfloor$ , $A_{\\mathrm{bin}}^{2} = \\lceil a_{i}^{2} / W_{\\mathrm{bin}}\\rceil$ , and $B_{\\mathrm{bin}}^{2} = \\lceil b_{i}^{2} / H_{\\mathrm{bin}}\\rceil$ . This approach indicates the spatial attributes of implicit concepts.", + "bbox": [ + 215, + 498, + 784, + 532 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Loss re-weighting on specific regions. Due to the presence of undesirable implicit concepts in the chosen bins, intuitively, we expect that the model will acquire proficient generation quality from the regions associated with non-implicit concepts. Consequently, to de-emphasize the implicit concept areas, we assign them a (fixed) smaller weight in the loss (1). The resulting refined loss, which incorporates the previously generated bin map, is:", + "bbox": [ + 212, + 540, + 782, + 631 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {G E O M - E R A S I N G}} = \\mathbb {E} _ {z \\sim \\mathcal {E} (x), y \\sim Y, \\epsilon \\sim \\mathcal {N} (0, 1), t} \\left[ w \\odot \\| \\epsilon - \\epsilon_ {\\theta} \\left(z _ {t}, t, c _ {\\theta} \\left(y ^ {\\prime}\\right)\\right) \\| _ {2} ^ {2} \\right], \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 243, + 643, + 785, + 667 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\odot$ denotes element-wise multiplication, and $w = [w_{m,n}]$ with", + "bbox": [ + 214, + 678, + 697, + 694 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nw _ {m, n} = \\left\\{ \\begin{array}{l l} \\frac {T}{K + \\alpha (T - K)}, & \\text {i f} A _ {\\mathrm {b i n}} ^ {1} < m < A _ {\\mathrm {b i n}} ^ {2} \\text {a n d} B _ {\\mathrm {b i n}} ^ {1} < n < B _ {\\mathrm {b i n}} ^ {2} \\\\ \\frac {\\alpha T}{K + \\alpha (T - K)}, & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 267, + 707, + 785, + 748 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$K = (A_{\\mathrm{bin}}^2 - A_{\\mathrm{bin}}^1) \\cdot (B_{\\mathrm{bin}}^2 - B_{\\mathrm{bin}}^1)$ , $T = \\frac{W}{W_{\\mathrm{bin}}} \\cdot \\frac{H}{H_{\\mathrm{bin}}}$ is the number of bins with $\\sum w_{m,n} = T$ , and $\\alpha$ is a hyperparameter. Eq. 5 normalizes the weight $w$ , aligning the magnitude of Eq. 4 with that of the original loss in Eq. 1. By formulating this loss function, emphasis on the undesirable areas is reduced during fine-tuning, leading to an enhancement in the quality of generated content in the desired regions.", + "bbox": [ + 212, + 757, + 787, + 851 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 354, + 127 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/f49e77bcd16c5d140c60b696969a5386649b27d2e41167fddf8f4ad0eb0e8502.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Dataset NameSample sizeICRStyleResolutionSource
ICD-QR83325%Cartoon512²Pokemon [17]
ICD-Watermark160k50%Real256²CC12M [5]
ICD-Text1000k100%Real256²LAION [22]
", + "bbox": [ + 238, + 143, + 776, + 223 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Table 1: Details of Implicit Concept Dataset. Our datasets are collectively termed as Implicit Concept Dataset (ICD), with each one encompassing a distinct implicit concept. They exhibit variations in several attributes. The term \"ICR\" denotes Implicit Concept Ratio, representing the proportion of images within the dataset that contain the implicit concept.", + "bbox": [ + 212, + 223, + 782, + 292 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Accessibility of the additional classifier or detector. Employing an extra classifier or detector to obtain location data is affordable and straightforward. Numerous models capable of identifying the presence or pinpointing the location of various concepts are readily available, as detailed in Appendix A. Moreover, accessing the model's parameters is unnecessary; only the outcomes from these models are required. Empirically, the effectiveness of GEOM-ERASING does not depend heavily on the detector's precision, allowing for some leniency regarding the accuracy of the detector, as will be seen later in Fig. 5.", + "bbox": [ + 212, + 335, + 784, + 455 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 215, + 479, + 375, + 497 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section, we perform experiments to demonstrate the effectiveness of GEOM-ERASING. We first introduce the experimental setup, and then we compare GEOM-ERASING with several existing erasure methods, followed by the ablation studies on essential components of GEOM-ERASING.", + "bbox": [ + 212, + 512, + 784, + 571 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.1 Setup", + "text_level": 1, + "bbox": [ + 215, + 595, + 310, + 609 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implicit Concept Dataset. We curate three datasets, each corresponding to an implicit concept. As detailed in Table 1, these datasets vary in concept types, sizes, Implicit Concept Ratios (ICR), and image styles. In ICD-QR, QR codes are manually embedded in $25\\%$ of the images. ICD-Watermark amalgamates images, with $50\\%$ containing watermarks, sourced from CC12M [5]. ICD-Text utilizes dataset from [27], resulting in $100\\%$ of the training images incorporating text. Additionally, corresponding test datasets devoid of any implicit concepts assembled for each of the above, to ensure a comprehensive evaluation. More details can be found in Appendix A.", + "bbox": [ + 212, + 619, + 784, + 756 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Settings. To mirror real-world scenarios, we validate GEOM-ERASING in two settings: Model Refinement and Data Refinement. For Model Refinement, we eliminate the implicit concepts of watermark and unsafeness in the original SD. Watermark is evaluated under the evaluation set of our constructed", + "bbox": [ + 212, + 779, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Implicit Concept Removal of Diffusion Models", + "bbox": [ + 421, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/42900873e0007404e83c164eedd48a06ee591f5fb7706a68433785c536b267c0.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
WatermarkUnsafeness (I2P benchmark [21])Expected Max. Inapprox.
FIDICRF*R/100HateHarassmentViolenceSelf-harmSexualShockingIllegal activitiesOverall
SD [18]9.0511.131.010.400.340.400.400.300.510.360.390.970.06
ESD [7]9.4911.281.070.170.160.240.220.170.160.220.19-
FMN [28]10.0510.831.09---------
NP [11]9.1211.131.020.160.140.190.140.080.250.130.160.800.18
SLD-Strong [21]9.879.920.980.150.130.170.190.090.200.090.130.720.19
GEOM-ERASING8.347.310.610.110.110.130.060.050.150.070.090.630.20
", + "bbox": [ + 217, + 143, + 785, + 224 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/a046b9ac6a63ff8d2876bb8ae438d183801d3ec2c58d139f083baf63f5455c3d.jpg", + "table_caption": [ + "Table 2: Comparison between GEOM-ERASING and existing erasure methods under Model Refinement setting. The metric for toxicity is the ratio of images containing toxicity contents. The last column is the bootstrap estimates of a model containing toxic images at least once for 25 prompts [21]. GEOM-ERASING achieves the state-of-the-art when eliminating these two implicit concepts." + ], + "table_footnote": [], + "table_body": "
ICD-QRICD-WatermarkICD-Text
FIDICRF*R/100FIDICRF*R/100FIDICRF*R/100
SD [18]65.8274.5949.107.5930.402.3154.2371.8438.96
ESD [7]90.9717.6416.057.6428.982.2160.5638.0823.06
FMN [28]71.7680.4257.717.7930.762.4057.3874.7542.89
NP [11]69.3159.6441.347.5427.712.0952.1365.6334.21
SLD-Strong [21]80.0570.2556.248.5632.562.7955.3666.0836.58
GEOM-ERASING41.415.382.236.995.020.3538.7413.485.22
", + "bbox": [ + 223, + 330, + 790, + 425 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Table 3: Comparison between GEOM-ERASING and other erasure methods under Data Refinement setting. All models are evaluated under ICD. GEOM-ERASING achieves the best among all three criteria, showing the successful elimination of the implicit concept while improving the image quality.", + "bbox": [ + 212, + 426, + 787, + 481 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "dataset ICD-watermark, and unsafeness is evaluated under the I2P benchmark. Data Refinement mimics personalized fine-tuning when practitioners collect downstream datasets that may also contain implicit concepts, attributed to the limitations in sources and collecting methods. This setting is evaluated under all three ICD datasets.", + "bbox": [ + 212, + 532, + 787, + 608 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Baselines and evaluation metrics. We compare GEOM-ERASING with existing erasure methods, including Erased Stable Diffusion (ESD) [7], Forget-Me-Not (FMN) [28], Negative Prompt (NP) [11], and Safe Latent Diffusion (SLD) [21]. To depict the outcomes, we employ the Frechet Inception Distance (FID) [9] and the Implicit Concept Ratio (ICR) which is defined as the ratio of the number of images containing implicit concept to the total number of images. Both metrics prefer lower values. To facilitate a more comprehensive comparison between models and offer an integrated perspective on performance concerning both metrics, we introduce the $F*R/100$ , which is calculated as the product of FID and ICR, serving as a unified metric for evaluating model performance. We also adopt the Inappropriate Image Prompts (I2P) benchmark [21] to validate our erasure of toxicity in the pre-trained diffusion model. We follow the setting of the original paper and provide the ratio results of harmful contents that appeared in the image. Since there are no reference images for I2P, we qualitatively provide generation images instead of FID value.", + "bbox": [ + 212, + 613, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 352, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/df49c37a1ff8c8968151b31c42960e07b5fa8eaea72bc221daa99227cd606f41.jpg", + "image_caption": [ + "Fig. 4: Qualitative comparison between different methods. Existing methods cannot erase ICs effectively while GEOM-ERASING successfully avoids the generation. Check more comparison in Fig. A3 and A4." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 787, + 318 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.2 Comparison with previous methods", + "text_level": 1, + "bbox": [ + 214, + 398, + 555, + 415 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Erasure of pre-trained SD (Model Refinement). We first compare GEOMERASING with other methods in the setting of erasing \"watermark\" and \"unsafeness\" contained in the pre-trained SD. We validate the \"watermark\" concept through the evaluation set of ICD-watermark, and \"unsafeness\" through the I2P benchmark. As shown in Table 2, GEOM-ERASING performs the best on both implicit concepts, achieving new state-of-the-art results on the I2P benchmark.", + "bbox": [ + 212, + 426, + 787, + 517 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Erasure in personalized fine-tuning (Data Refinement). As shown in Table 3 and visualized in Fig. 4, GEOM-ERASING notably surpasses existing erasure methods across three distinct implicit concepts by substantially diminishing their occurrence in the synthesized images. Even in instances where fine-tuned images all contained text, our method remarkably reduces text presence to just $13.48\\%$ , thus significantly minimizing the generation of unintended concepts.", + "bbox": [ + 212, + 527, + 787, + 621 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Removing implicit concepts improves generation. Besides reducing unintended elements, GEOM-ERASING also improves the generation quality compared to the other methods in both settings. This improvement is due to the method's ability to effectively erase implicit concepts. Since the ideal images (reference images) do not contain these elements, avoiding them results in higher quality scores (FID scores). Further insights into the correlation between erasure efficacy and enhanced image quality are detailed in our ablation study in Sec. 5.3.", + "bbox": [ + 212, + 632, + 787, + 737 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Existing erasure methods cannot do well for implicit concepts. The methods of FMN [28], NP [11], and SLD [21] demonstrate limitations in effectively removing implicit concepts. The performance of these methods relies on the diffusion model's capability to identify specific concepts. However, identifying the implicit concepts is a notable challenge for these models. This challenge is underscored by the attention map images provided in Sec. 3.2, which depicts", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Implicit Concept Removal of Diffusion Models", + "bbox": [ + 421, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/fd2fe6af44a63783c00623cd5ff055dfea653b70fa12c75d73d75695eab467b8.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
ConceptGeometricLoss re-weightFIDICRF*R
7.5930.40230.74
✓7.0617.04120.30
✓6.9711.1877.92
✓6.4629.38189.79
✓✓6.817.3650.12
✓✓✓6.427.2346.42
Fine-tuning with 0% watermark (oracle)6.937.1349.41
", + "bbox": [ + 220, + 143, + 547, + 265 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/cc476d8bfca9e3d356d3660bc5177f4c91ee724fe34f2dd899895c73d8b8de0d.jpg", + "image_caption": [ + "Fig. 5: Effects of geometric accuracy. The x-axis is the IoU decided by the noise $\\sigma$ added on the location. GEOM-ERASING has a tolerance of around 0.4 IoU considering ICR." + ], + "image_footnote": [], + "bbox": [ + 558, + 172, + 794, + 263 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Table 4: Ablation of different components. Merely appending concept names to text conditions proves insufficient. Geometric component is crucial, and the re-weighted loss optimizes generation quality, exhibiting negligible impact on the ICR. Default settings are marked in gray.", + "bbox": [ + 212, + 275, + 547, + 359 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "the models' inadequacies in accurately identifying and addressing the implicit concepts, subsequently hindering successful erasure. Among all the baselines, ESD [7] demonstrates superior erasure performance, albeit with a higher FID score. This can be attributed to the approach employed by ESD, where the finetuned SD model is trained to move away from the images it originally generated, regardless of whether they contain the intended concept or not. However, since the original generated images may contain implicit concepts with high probability, ESD might result in unintended concept removal while affecting meaningful one, as shown in the second column of Fig. A4.", + "bbox": [ + 212, + 390, + 787, + 526 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In contrast, the proposed GEOM-ERASING demonstrates the ability to effectively remove implicit concepts while preserving the other meaningful concepts, yielding favorable ICR and FID results. It surpasses the state-of-the-art, as evidenced by the superior $F*R/100$ measure. Refer to Appendix C for visual comparisons among different methods. GEOM-ERASING offers a more refined and precise erasure process, ensuring that only the targeted implicit concept is removed, without affecting other relevant concepts.", + "bbox": [ + 212, + 527, + 787, + 633 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.3 Ablation and Analysis", + "text_level": 1, + "bbox": [ + 214, + 654, + 444, + 669 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In this section, we perform various ablations analyses to demonstrate the effectiveness of different components in GEOM-ERASING. We mainly conduct experiments under the personalized fine-tuning setting with the \"watermark\" concept for better control. Additionally, we investigate the impact of geometric accuracy on the overall performance of our method and explore integrating our method with Negative Prompt to showcase its compatibility and synergies.", + "bbox": [ + 212, + 679, + 787, + 771 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablative analysis. The ablation results, as shown in Table 4 and Fig. 6, shed light on the importance of different components in our methods. We separately integrate the concept name (Eq. 2), geometric information (Eq. 3), and loss reweight (Eq. 4) before combining them. Notably, the geometric component proved", + "bbox": [ + 212, + 779, + 787, + 842 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 352, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/0b136721b81a4dd792e7e7c455e9b88ee5e8ea1b7e61a100e874c3433b2e6d27.jpg", + "image_caption": [ + "Fig. 6: Visualization of different components. Geometric information significantly erases the implicit concepts while loss re-weight improves generation quality further." + ], + "image_footnote": [], + "bbox": [ + 250, + 148, + 759, + 358 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "pivotal, markedly reducing both FID and ICR, particularly when synergized with the concept condition, enhancing the model's overall performance. The loss reweight component contributes to improving the visual appeal of the generated images while maintaining efficacy of implicit concept removal. Throughout the ablative studies, a consistent trend between FID and ICR is observed, implying enhanced erasure correlates to superior image quality. Moreover, when finetuning the model with no implicit concepts (0% images with watermarks), the model achieves an ICR comparable to GEOM-ERASING. Interestingly, GEOM-ERASING surpasses even this optimum in FID and $F*R$ , emphasizing the importance of geometric information in refining concept learning and subsequently improving image quality.", + "bbox": [ + 212, + 430, + 787, + 597 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Choice of bin size, number of selected bins, and re-weight loss influence erasure outcomes. Table 5 depicts the effects of varying bin sizes $M$ and selected bin numbers $K$ (bold values denoting the best performance and the gray row signifying the default selection). Bins are ranked and selected by value $p_i$ as stated in Sec. 4. First, we analyze the impact of bin sizes by fixing the ratio between the number of selected bins and bin size and varying the size from $8^2$ to $64^2$ . As the bin size increases, the performance initially improves and then starts to decline. This trend suggests that higher resolutions may provide more accurate concept localization but can also dilute the information density of the original text. Subsequently, with a fixed bin size, varying the number of selected bins shows enhancement in erasure performance up to a saturation point.", + "bbox": [ + 212, + 612, + 787, + 777 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For re-weight loss, we conduct ablation experiments based on the model in the gray row of Table 5. An alternate re-weight loss incorporating the $p_i$ values is proposed. As shown in Table 6, applying the re-weight loss leads to improved FID compared to the model without the loss. However, utilizing the $p_i$ may", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Implicit Concept Removal of Diffusion Models", + "bbox": [ + 421, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/9a3867cb9bcd86b0cd5f6f2d8acf39e2a5911f794571af29759390cecf9b5f3e.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MKFIDICRF*R
8246.7818.26123.80
162166.5315.45100.89
322646.5112.6482.29
6421507.2916.47120.07
322726.817.3650.12
322806.927.3550.86
", + "bbox": [ + 225, + 143, + 385, + 253 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/78479146851d16bf45ca138a2df4ead7ac8e616b2de5a2d8542a1c0ef7bd19cf.jpg", + "table_caption": [ + "Table 5: Bin size and selected bins. Larger bin size and more bins improve results." + ], + "table_footnote": [], + "table_body": "
Re-weight FunctionαFIDICRF*R
Eq. 50.256.427.2346.42
0.506.407.6348.83
0.756.457.4147.79
(1-pi)α0.56.279.2157.75
16.339.3446.46
26.269.4459.09
", + "bbox": [ + 416, + 143, + 589, + 244 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/1bd5d6a19020fd56c197fe7c28cb0672bae6245e450fe49358f0963985225854.jpg", + "table_caption": [ + "Table 6: Re-weight loss. A fixed re-weight design is good enough for better ICR." + ], + "table_footnote": [], + "table_body": "
Negative PromptFIDICRF*R
w/o NP6.427.2346.42
Concept6.157.0343.23
+ Uniform Geometry6.995.0235.09
+ Random Geometry7.124.9835.46
", + "bbox": [ + 614, + 143, + 787, + 203 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 7: Input as negative prompt. Usage of the geometry improves ICR further.", + "bbox": [ + 609, + 253, + 787, + 306 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "degrade the erasure performance. Opting for simplicity and effectiveness, a fixed value is utilized for the area covered by implicit concept, as mentioned in Eq. 5.", + "bbox": [ + 212, + 325, + 782, + 358 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Geometric accuracy. GEOM-ERASING is robust to the precision of geometric information provided. Upon selecting the bins, we introduce two noise scalars $\\epsilon_1,\\epsilon_2\\sim \\mathcal{N}(0,\\sigma^2)$ to the selected bins, as $y^\\prime = y\\oplus y_{\\mathrm{im}}\\oplus \\langle l(m + \\epsilon_1,n + \\epsilon_2)\\rangle$ Variations of $\\sigma$ yield distinct IoU values between the originally selected and noised bins, visualized in Fig. 5. ICR can tolerate a geometry accuracy up to 0.4 IoU. However, the erasure performance deteriorates as accuracy decreases.", + "bbox": [ + 212, + 363, + 784, + 455 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Negative prompt. Adding both the learned concept name and geometric information to the negative prompt can better erase unwanted details. Since implicit concepts are supposed not to appear in any part of the image, we use location tokens that are picked uniformly or randomly as negative prompts. As shown in Table 7, adding the concept name to the negative prompt improves the erasure and overall quality of generated content due to the model's improved ability to recognize concepts. Adding geometric information, whether uniformly or randomly, further improves the erasure, but it also tends to increase the FID. We plan to explore the reasons for this increase in more detail in future work.", + "bbox": [ + 212, + 459, + 787, + 595 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 614, + 359, + 631 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Fine-tuning on personalized datasets is a prevalent practice, but the presence of unwanted implicit concepts like QR codes, watermarks, and text within these datasets can pose significant challenges during the refinement of personal diffusion models. This paper delves into the substantial impact of such implicit concepts, establishing a formal framework for their removal. Conventional methods, which predominantly depend on pre-trained diffusion models or merely acknowledge concept existence, falter in eradicating these implicit elements. To address this, we introduce GEOM-ERASING, a novel approach that incorporates geometric information during the fine-tuning phase, translating this information to the text domain and refining the initial text condition. We substantiate our approach through three diverse datasets, each laden with distinct implicit concepts. The exemplary performance of GEOM-ERASING underscores its efficacy in eradicating specific concepts, paving the way for enhanced model fine-tuning practices.", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 352, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement", + "text_level": 1, + "bbox": [ + 217, + 143, + 393, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We gratefully acknowledge the support of MindSpore, CANN (Compute Architecture for Neural Networks) and Ascend AI Processor used for this research. This work was partially supported by the Research Grants Council of the Hong Kong Special Administrative Region (Grants C7004-22G-1 and 16202523).", + "bbox": [ + 212, + 175, + 787, + 237 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 258, + 321, + 273 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022)", + "2. Birhane, A., Prabhu, V.U., Kahembwe, E.: Multimodal datasets: misogyny, pornography, and malignant stereotypes. arXiv preprint arXiv:2110.01963 (2021)", + "3. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing diffusion using semantic dimensions. arXiv preprint arXiv:2301.12247 (2023)", + "4. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023)", + "5. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12M: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: CVPR (2021)", + "6. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. In: NeurIPS (2021)", + "7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023)", + "8. Gao, R., Chen, K., Xie, E., Hong, L., Li, Z., Yeung, D.Y., Xu, Q.: Magicdrive: Street view generation with diverse 3d geometry control. arXiv preprint arXiv:2310.02601 (2023)", + "9. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017)", + "0. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020)", + "1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)", + "2. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: NeurIPS (2021)", + "3. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: ICCV (2023)", + "4. Lee, T., Yasunaga, M., Meng, C., Mai, Y., Park, J.S., Gupta, A., Zhang, Y., Narayanan, D., Teufel, H.B., Bellagente, M., et al.: Holistic evaluation of text-to-image models. arXiv preprint arXiv:2311.04287 (2023)", + "5. Li, P., Liu, Z., Chen, K., Hong, L., Zhuge, Y., Yeung, D.Y., Lu, H., Jia, X.: Trackdiffusion: Multi-object tracking data generation via diffusion models. arXiv preprint arXiv:2312.00651 (2023)", + "6. Nichol, A.: Dall-e 2 pre-training mitigations. https://openai.com/research/dall-e-2-pre-training-mitigations (2022)" + ], + "bbox": [ + 225, + 287, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Implicit Concept Removal of Diffusion Models", + "bbox": [ + 421, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Pinkney, J.N.M.: Pokemon blip captions. https://huggingface.co/datasets/lambdalabs/pokemon-blip-captions/ (2022)", + "18. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022)", + "19. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)", + "20. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022)", + "21. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: CVPR (2023)", + "22. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)", + "23. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015)", + "24. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020)", + "25. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. In: NeurIPS (2017)", + "26. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017)", + "27. Yang, Y., Gui, D., Yuan, Y., Ding, H., Hu, H., Chen, K.: Glyphcontrol: Glyph conditional control for visual text generation. arXiv preprint arXiv:2305.18259 (2023)", + "28. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023)", + "29. Zhang, Y., Hooi, B.: Hipa: Enabling one-step text-to-image diffusion models via high-frequency-promoting adaptation. arXiv preprint arXiv:2311.18158 (2023)", + "30. Zhang, Y., Zhou, D., Hooi, B., Wang, K., Feng, J.: Expanding small-scale datasets with guided imagination. In: NeurIPS (2023)" + ], + "bbox": [ + 215, + 147, + 784, + 604 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Z. Liu et al.", + "bbox": [ + 271, + 114, + 352, + 126 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_model.json b/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_model.json new file mode 100644 index 0000000000000000000000000000000000000000..26faea7b995ac44c25bf02f0d4588b73003371ed --- /dev/null +++ b/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_model.json @@ -0,0 +1,2036 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.237, + 0.141, + 0.768, + 0.166 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.189, + 0.761, + 0.221 + ], + "angle": 0, + "content": "Zhili Liu\\(^{1,2\\star}\\), Kai Chen\\(^{1\\star}\\), Yifan Zhang\\(^{3}\\), Jianhua Han\\(^{2}\\), Lanqing Hong\\(^{2}\\), Hang Xu\\(^{2}\\), Zhenguo Li\\(^{2}\\), Dit-Yan Yeung\\(^{1}\\), and James T. Kwok\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.252, + 0.232, + 0.751, + 0.276 + ], + "angle": 0, + "content": "\\(^{1}\\) Hong Kong University of Science and Technology \n\\(^{2}\\) Huawei Noah's Ark Lab \\(^{3}\\) National University of Singapore \nProject Page: https://kaichen1998.github.io/projects/geom-erasing/" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.313, + 0.744, + 0.604 + ], + "angle": 0, + "content": "Abstract. Text-to-image (T2I) diffusion models often inadvertently generate unwanted concepts such as watermarks and unsafe images. These concepts, termed \"implicit concepts\", can be unintentionally learned during training and then be generated uncontrollably during inference. Existing removal methods still struggle to eliminate implicit concepts primarily due to their dependency on the model's ability to recognize concepts it actually can not discern. To address this, we utilize the intrinsic geometric characteristics of implicit concepts and present GEOM-ERASING, a novel concept removal method based on geometric-driven control. Specifically, once an unwanted implicit concept is identified, we integrate the existence and geometric information of the concept into the text prompts with the help of an accessible classifier or detector model. Subsequently, the model is optimized to identify and disentangle this information, which is then adopted as negative prompts during generation. Moreover, we introduce the Implicit Concept Dataset (ICD), a novel image-text dataset imbued with three typical implicit concepts (QR codes, watermarks, and text), reflecting real-life situations where implicit concepts are easily injected. GEOM-ERASING effectively mitigates the generation of implicit concepts, achieving state-of-the-art results on the Inappropriate Image Prompts (I2P) and our challenging Implicit Concept Dataset (ICD) benchmarks." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.617, + 0.728, + 0.632 + ], + "angle": 0, + "content": "Keywords: Concept Erasure \\(\\cdot\\) Implicit Concept \\(\\cdot\\) Geometric Control" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.68, + 0.377, + 0.696 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.712, + 0.788, + 0.804 + ], + "angle": 0, + "content": "Text-to-image diffusion models (DMs) have become increasingly popular due to their exceptional proficiency in generating high-quality images [8, 10, 15, 30]. Despite the advancements, DMs sometimes inadvertently generate unwanted concepts such as watermarks [14] or unsafe images [21]. Take Stable Diffusion \\((\\mathrm{SD})^3\\) [18] as an example. When text prompts on topics related to indoor furniture or human portrait are used, surprisingly we find that the generated images" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.812, + 0.617, + 0.825 + ], + "angle": 0, + "content": "* Equal contribution. Contact: zhili.liu@connect.ust.hk" + }, + { + "type": "page_footnote", + "bbox": [ + 0.221, + 0.825, + 0.598, + 0.84 + ], + "angle": 0, + "content": "3 https://huggingface.co/runwayml/stable-diffusion-v1-5" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.812, + 0.617, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.117, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.116, + 0.353, + 0.127 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "image_caption", + "bbox": [ + 0.232, + 0.151, + 0.303, + 0.162 + ], + "angle": 0, + "content": "ICD-Watermark" + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.163, + 0.784, + 0.402 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.412, + 0.788, + 0.455 + ], + "angle": 0, + "content": "Fig. 1: Generation of implicit concepts. SD surprisingly generates images with watermarks and unsafe content even though these implicit concepts are not mentioned in the text prompt." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.489, + 0.789, + 0.58 + ], + "angle": 0, + "content": "often contain watermarks (Fig. 1), even though no watermark-related keyword is mentioned in the text prompts. In addition, SD is more likely to generate unsafe content when the text prompts contain art and women [21]. Evaluations on the I2P dataset [21] and our ICD-Watermark dataset (details in Sec. 5.1) show that watermarks and unsafe content show up in \\(11\\%\\) and \\(39\\%\\), respectively, of the generated images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.582, + 0.789, + 0.687 + ], + "angle": 0, + "content": "In this paper, we define implicit concepts (IC) as concepts that are not explicitly specified in the text prompts but are still generated by the DMs. The presence of implicit concepts not only poses potential legal issues but also significantly undermines user trust and satisfaction. Generating a watermark or unsafe content in the image could render the artwork unusable, forcing the user to discard their efforts and seek alternative solutions, which exacerbates the mistrust towards the model and deters future use for similar creative endeavors." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Avoiding the generation of implicit concepts is difficult. Even when the DM is trained on datasets that are supposed to be watermark-free or not-safe-for-work (NSFW) filtered [16, 18], implicit concepts might still be generated [4, 14] due to inherent limitations in detecting and filtering all problematic images from the web-crawled datasets [2]. Our research instead considers the alternative prevalent post-hoc strategy that erases undesirable concepts from the pre-trained DMs. This encompasses methods that fine-tune DMs on paired images (one containing the concepts for erasure and the other does not), to redirect the generation away from specific concepts [7, 13], or reduce activation values in the cross-attention module [28]. Other methods carefully design the text prompts [11] and diffusion" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.422, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "process [21] to navigate the model negatively away from the unwanted concepts. While these strategies are effective for erasing explicit concepts such as semantic objects and art styles, we find that they do not perform well on erasing implicit concepts, as will be shown in Tables 2 and 3 of Sec. 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.211, + 0.785, + 0.332 + ], + "angle": 0, + "content": "Here we first systematically explore the reasons behind the failure of existing methods to erase implicit concepts. In particular, we identify a core mismatch. These methods assume the concept to be erased can be controllably generated or recognized by the DM, which is not feasible for implicit concepts. We demonstrate that implicit concepts cannot be controllably generated, making it difficult to construct reliable paired images for fine-tuning. Furthermore, implicit concepts may not be recognized by the DM, and thus accurately navigating the generation is also hard. Refer to Sec. 3 for detailed experiments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.335, + 0.787, + 0.472 + ], + "angle": 0, + "content": "Next, we study why DMs generate concepts they are not aware of. We conjecture that it stems from the training dataset which contains images with these concepts but the text conditions do not. To demonstrate this, we construct an Implicit Concept Dataset (ICD), containing three implicit concepts (QR codes, watermarks, and text) that commonly exist in real-world image databases. Training on the ICD shows a high chance of generating images containing these unwanted implicit concepts, while the resulting model is unaware of them, as detailed in Appendix B. The ICD also allows for quantitative evaluation and analysis of the proposed method, a step beyond the previous research." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.475, + 0.787, + 0.763 + ], + "angle": 0, + "content": "Recognizing these challenges, our work proposes a novel erasure method designed to specifically target and eliminate implicit concepts. Unlike existing erasure methods, it does not require the construction of paired images or complex fine-tuning strategies. Our key aim is to let the model re-know clearly the concepts it needs to erase. We observe a consistent feature where these concepts often exist in certain parts of the image. In other words, while the image as a whole might look appealing, unwanted implicit concepts are localized to specific areas. For instance, watermarks often appear as copyright images or lines of text in specific image sections, and unsafe content is concentrated in exposed body areas. Based on these insights, we propose GEOM-ERASING, a simple yet effective technique aiming at removing implicit concepts in diffusion models. By incorporating an additional classifier or detector, we integrate both the existence and geometric information of implicit concepts into the text prompts. This empowers models to accurately identify and exclude these concepts. Notably, GEOM-ERASING converts this information into text prompts without accessing the parameters of the classifier or detector. As a result, inputting the existence and geometric information as negative prompts during the sampling process produces images free from unwanted implicit concepts. Our findings emphasize the crucial role of geometric information in successfully erasing implicit concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.787, + 0.84 + ], + "angle": 0, + "content": "For performance evaluation, we use two settings mimicking real-world scenarios: 1) Model Refinement: The pre-trained DM already contains watermark and unsafe concepts, and we aim to remove these implicit concepts without harming the generation quality of other concepts. 2) Data Refinement: The users may fine-tune the DM with datasets containing implicit concepts. Under" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.353, + 0.127 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.786, + 0.192 + ], + "angle": 0, + "content": "both settings, we successfully reduce the chance of generating implicit concepts on ICD, and outperform previous state-of-the-art for eliminating unsafe content on the Inappropriate Image Prompts (I2P) [21] benchmark." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.193, + 0.54, + 0.206 + ], + "angle": 0, + "content": "Our contributions can be summarized as:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.213, + 0.784, + 0.285 + ], + "angle": 0, + "content": "1. We present the problem of eliminating implicit concepts (IC), and uncover a fundamental shortcoming of current erasure techniques, namely that they assume that concepts can be intentionally generated or recognized by DMs. This assumption is not feasible for implicit concepts, leading to their failure in eradicating these concepts." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.288, + 0.785, + 0.33 + ], + "angle": 0, + "content": "2. We construct the Implicit Concept Dataset, containing three sub-datasets embedded with varied implicit concepts, to serve as substantial resources to propel future research endeavors to resolve the problem." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.332, + 0.792, + 0.375 + ], + "angle": 0, + "content": "3. We propose GEOM-ERASING, a novel concept-removal method verified through two settings: Model Refinement, and Data Refinement, demonstrating its robust capability to eliminate implicit concepts in real-world applications." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.397, + 0.383, + 0.414 + ], + "angle": 0, + "content": "2 Related work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.426, + 0.788, + 0.577 + ], + "angle": 0, + "content": "Diffusion models [10, 23] excel in various generative tasks such as density estimation [12], image synthesis [6], and text-to-image generation [1, 18, 20, 29]. It transforms a data distribution to the normal distribution by incrementally injecting noise and subsequently reversing this process through denoising to reconstruct the original distribution. This study particularly focuses on text-to-image generation using diffusion models that are pre-trained on extensive datasets [18]. Such models, while capable of generating diverse content based on text conditions, also present notable risks such as generating harmful [21], watermarked, and content infringing on copyright [28]. Consequently, this raises the need for research directed towards the elimination of such undesired concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Concept erasing in diffusion models. Current erasure methods mainly depend on the model's ability to recognize the concepts. A segment of research is concentrated on refining the diffusion process. Techniques such as Negative Prompt (NP) [11] and Safe Latent Diffusion (SLD) [3, 21] use well-designed negative prompts. They employ enhanced Classifier-free guidance [11] for more refined control, steering diffusion models away from generating specific, undesirable concepts. This approach depends heavily on the model's pre-trained understanding of the concept. Another approach is to fine-tune the model to remove specific concepts. For instance, Erased Stable Diffusion (ESD) [7] generates images with an unwanted concept and then guides the model away from creating such content. Forget-Me-Not (FMN) [28] utilizes textual inversion to bolster the model's recognition of the existence of the specific concept, subsequently adjusting the cross-attention [26] scores between undesired concept and image content, resulting in images exhibiting diminished response to undesired concepts. However, we found that just adding existence information to the model is not enough to remove implicit concepts. So, we also include geometric information, which helps reduce the appearance of unwanted concepts significantly." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.422, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.432, + 0.163 + ], + "angle": 0, + "content": "3 Preliminary Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.177, + 0.788, + 0.254 + ], + "angle": 0, + "content": "Section 3.1 first introduces the definition of implicit concept removal. In Section 3.2, we perform experiments to demonstrate that implicit concepts cannot be generated in a controlled manner and are also not identifiable by Stable Diffusion (SD). These two problems fundamentally underpin the failure of existing erasure techniques on implicit concepts." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.275, + 0.423, + 0.289 + ], + "angle": 0, + "content": "3.1 Problem Statement" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.789, + 0.435 + ], + "angle": 0, + "content": "This work addresses eliminating unwanted and unintended implicit concepts from diffusion models. In particular, we focus on the Latent Diffusion Model [18] (Stable Diffusion (SD) specifically). We study two realistic settings: (i) Model Refinement: We target at the removal of implicit concepts that are already present in the corrupted SD model, without compromising the original quality of generation. (ii) Data Refinement: we consider situations where users need to fine-tune the SD on a personalized corrupted dataset \\(\\mathcal{D}\\) which contains implicit concept \\(y_{im}\\). Our objective is to fine-tune a model, so that it can generate images closely resembling \\(\\mathcal{D}\\) but with the implicit concept removed." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.435, + 0.794, + 0.511 + ], + "angle": 0, + "content": "Following SD, we fine-tune diffusion models in the latent space of VQ-VAE [25]. An encoder \\(\\mathcal{E}\\) maps an image \\(x\\in X\\) to the latent code \\(z = \\mathcal{E}(x)\\), and the decoder \\(D\\) then reconstructs the image as \\(D(z) = x\\). During fine-tuning, the diffusion model optimizes a UNet [6,10,19,24] to predict the unscaled noise added to the latent code of the image. The loss function is:" + }, + { + "type": "equation", + "bbox": [ + 0.308, + 0.522, + 0.786, + 0.547 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {S D} = \\mathbb {E} _ {z _ {t} \\sim \\mathcal {E} _ {t} (x), y \\sim Y, \\epsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, c _ {\\theta} (y)) \\| _ {2} ^ {2} \\right], \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.557, + 0.788, + 0.633 + ], + "angle": 0, + "content": "where \\(y \\sim Y\\) is the input text, \\(t\\) is the time step, \\(z_{t}\\) is the noised latent code of the image, \\(\\epsilon\\) is an unscaled noise sample, and \\(\\epsilon_{\\theta}\\) is the denoising network to be fine-tuned. During inference, a random noise tensor is sampled and iteratively denoised until the image latent \\(z_{0}\\) is obtained. The image is then generated by the decoder as \\(x' = D(z_{0})\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.655, + 0.472, + 0.67 + ], + "angle": 0, + "content": "3.2 Preliminary Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.68, + 0.788, + 0.742 + ], + "angle": 0, + "content": "In this section, we perform preliminary experiments to examine the limitations of existing approaches [7,11,13,21,28] in erasing implicit concepts. These methods depend on SD's ability to controllably produce paired images and identify these concepts, a process we demonstrate is not viable for implicit concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Implicit concepts cannot be controllably generated. Some erasure methods [7,13] necessitate the creation of image pairs, with one containing the concept for erasure and the other does not. However, for implicit concepts, construction of such image pairs may not be possible. Our study, depicted in Fig. 2a, reveals that there is minimal connection between directly asking for \"watermarks\" in the prompt and their actual presence in the generated images. This is supported by a" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.353, + 0.127 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "image_footnote", + "bbox": [ + 0.278, + 0.16, + 0.382, + 0.215 + ], + "angle": 0, + "content": "long-haired tuxedo kitten with long white whiskers standing on a pink blanket looking slightly to viewers, watermark" + }, + { + "type": "image", + "bbox": [ + 0.386, + 0.147, + 0.491, + 0.228 + ], + "angle": 0, + "content": null + }, + { + "type": "image_footnote", + "bbox": [ + 0.501, + 0.165, + 0.618, + 0.21 + ], + "angle": 0, + "content": "man standing in a pond \nthrowing a fishing net, \ntimbavati nature reserve, \nlimpopo, south africa, \nafrica" + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.147, + 0.724, + 0.228 + ], + "angle": 0, + "content": null + }, + { + "type": "image_footnote", + "bbox": [ + 0.217, + 0.232, + 0.784, + 0.244 + ], + "angle": 0, + "content": "(a) Including \"watermark\" in text prompt does not ensure its appearance in image, and vice versa." + }, + { + "type": "image", + "bbox": [ + 0.28, + 0.245, + 0.703, + 0.324 + ], + "angle": 0, + "content": null + }, + { + "type": "image_footnote", + "bbox": [ + 0.266, + 0.325, + 0.736, + 0.337 + ], + "angle": 0, + "content": "(b) Cross-attention map between keyword \"watermark\" and the generated image." + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.349, + 0.787, + 0.378 + ], + "angle": 0, + "content": "Fig. 2: Observations from preliminary experiments. (a) Implicit concepts cannot be controllably generated. (b) Implicit concepts cannot be recognized by SD." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.406, + 0.785, + 0.452 + ], + "angle": 0, + "content": "correlation coefficient of \\( r = -0.08 \\) and a P-value \\( p = 0.21 \\) across 1000 samples, indicating an insignificant effect. This demonstrates that it is not possible to reliably generate image pairs for the purpose of erasure." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.461, + 0.788, + 0.627 + ], + "angle": 0, + "content": "Implicit concepts cannot be recognized by SD. Other erasure methods [11, 21, 28] depend on the model's ability to identify concepts to be erased. However, SD often fails to detect the presence of implicit concepts. Using an example on the implicit concept of watermarks, Fig. 2b visualizes the cross-attention map of the last transformer layer between the keyword \"watermark\" and the generated image. Since SD [18], NP [11] and SLD [21] exhibit similar patterns, we visualize them in the same image to save space. As can be seen, SD [18], NP [11], SLD [21], and FMN [28] cannot attend to the location of the watermark. A more thorough evaluation will be presented in Sec. 5.2. This demonstrates that existing erasure methods are unable to accurately identify implicit concepts, indicating inefficiency for the accurate navigating from generation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.649, + 0.427, + 0.667 + ], + "angle": 0, + "content": "4 Proposed Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.68, + 0.785, + 0.742 + ], + "angle": 0, + "content": "In this section, we present GEOM-ERASING which mitigates the impact of undesired implicit concepts and disentangle these concepts from the model. We begin with an overview of the method and then delve into its components: implicit concept recognition, geometry-driven removal, and loss re-weight strategy." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Overall architecture. The architecture of our method is shown in Fig. 3. The image \\( x \\in X \\) may contain various implicit concepts. Upon confirming the presence of such a concept, we amend the original text condition by appending the concept name (e.g., QR codes, watermark, text and unsafeness). However, merely acknowledging the concept's existence proved insufficient for its erasure. Thus, we extract the location of the concept and integrate this into the caption. For" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.422, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.147, + 0.756, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.349, + 0.788, + 0.461 + ], + "angle": 0, + "content": "Fig. 3: Model architecture of GEOM-ERASING. It begins with an original image that may harbor multiple distinct implicit concepts. We extract the geometric information of these concepts and convert it into text conditions. Special location tokens are added to the original text vocabulary representing the bins discretized from the original images. Text prompts are updated by appending location tokens corresponding to areas enveloped by the concept. Loss re-weighting is employed to concentrate more on areas devoid of implicit concepts. During sampling, the learned tokens are input as negative prompts, resulting in image generation free from implicit concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.49, + 0.788, + 0.569 + ], + "angle": 0, + "content": "Model Refinement setting, optimizing the added tokens representing the existence and location is enough. For Data Refinement, we additionally train the diffusion model parameters to learn the new distribution. After fine-tuning via our enhanced text condition, adding existence with location tokens in negative prompts enables the model to omit the unintended implicit concepts effectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.577, + 0.788, + 0.667 + ], + "angle": 0, + "content": "Implicit concept recognition. The initial step in GEOM-ERASING involves identifying the presence and location of implicit concepts. Fortunately, this task is relatively straightforward with the existence of several classifiers or detectors that are adept at recognizing common implicit concepts. For example, to identify watermarks, one can use LAION4. Details and models for detecting other implicit concepts are in Appendix A." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.669, + 0.788, + 0.744 + ], + "angle": 0, + "content": "Given a detector for the implicit concept, we acquire at most \\(N\\) predictions of the concepts, \\(L = [p_i,(o_i)]_{i = 1}^N\\), where \\(p_i\\) is the confidence in identifying the location as the implicit concept, and \\(o_i = [a_i^1,b_i^1,a_i^2,b_i^2]\\) are the coordinates of the concept's position, where \\((a_i^1,b_i^1)\\) and \\((a_i^2,b_i^2)\\) are the upper-left and bottom-right positions. This will be integrated to our subsequent geometry-driven removal." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Geometry-driven removal. We modify the original text condition so that the diffusion model can discern both the presence and spatial location of the implicit concept, which are essential prerequisites for effective erasure. Let the original image-text pair from the fine-tuning dataset \\(\\mathcal{D}\\) be \\((x,y)\\). If an image is classified" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.665, + 0.84 + ], + "angle": 0, + "content": "4 https://github.com/LAION-AI/LAION-5B-WatermarkDetection" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.128 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "as containing a specific concept, we append the concept name to the original text condition:" + }, + { + "type": "equation", + "bbox": [ + 0.405, + 0.187, + 0.786, + 0.226 + ], + "angle": 0, + "content": "\\[\ny ^ {\\prime} = \\left\\{ \\begin{array}{l l} y & p < t \\\\ y \\oplus y _ {i m} & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.236, + 0.784, + 0.282 + ], + "angle": 0, + "content": "where \\( p \\) is the confidence in identifying the implicit concept, \\( t \\) is a threshold, \\( \\oplus \\) denotes the concatenation operation, and \\( y_{im} \\) is the name of the implicit concept. This enhances the model to identify the existence of implicit concept." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.283, + 0.785, + 0.386 + ], + "angle": 0, + "content": "To acquaint the model with geometric information of the concept, we first discretize the continuous coordinates into bins. Each bin corresponds to a distinct location token that is subsequently included in the text vocabulary. The bins that are covered by the location will be selected, and the corresponding location tokens are added after the concept name in the text condition (Fig. 3). Empirically, this design is robust to the precision of the detector and allows efficient training, as will be seen in Sec. 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.388, + 0.787, + 0.435 + ], + "angle": 0, + "content": "Specifically, assume that the image size is \\( W \\times H \\) and a bin size of \\( W_{\\mathrm{bin}} \\times H_{\\mathrm{bin}} \\), location tokens are inserted into the text vocabulary \\( \\langle l(m,n) \\rangle_{m=1,n=1}^{m=W / W_{\\mathrm{bin}}, n = H / H_{\\mathrm{bin}}} \\). For each implicit concept in the image, the text condition is then updated as:" + }, + { + "type": "equation", + "bbox": [ + 0.317, + 0.448, + 0.786, + 0.489 + ], + "angle": 0, + "content": "\\[\ny ^ {\\prime} = \\left\\{ \\begin{array}{l l} y & \\text {i f} p < t \\\\ y \\oplus y _ {\\mathrm {i m}} \\oplus \\langle l (m, n) \\rangle_ {m = A _ {\\mathrm {b i n}} ^ {1}, n = B _ {\\mathrm {b i n}} ^ {1}} ^ {m = A _ {\\mathrm {b i n}} ^ {2}, n = B _ {\\mathrm {b i n}} ^ {2}} & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.499, + 0.785, + 0.533 + ], + "angle": 0, + "content": "where \\( A_{\\mathrm{bin}}^{1} = \\lfloor a_{i}^{1} / W_{\\mathrm{bin}}\\rfloor \\), \\( B_{\\mathrm{bin}}^{1} = \\lfloor b_{i}^{1} / H_{\\mathrm{bin}}\\rfloor \\), \\( A_{\\mathrm{bin}}^{2} = \\lceil a_{i}^{2} / W_{\\mathrm{bin}}\\rceil \\), and \\( B_{\\mathrm{bin}}^{2} = \\lceil b_{i}^{2} / H_{\\mathrm{bin}}\\rceil \\). This approach indicates the spatial attributes of implicit concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.541, + 0.784, + 0.632 + ], + "angle": 0, + "content": "Loss re-weighting on specific regions. Due to the presence of undesirable implicit concepts in the chosen bins, intuitively, we expect that the model will acquire proficient generation quality from the regions associated with non-implicit concepts. Consequently, to de-emphasize the implicit concept areas, we assign them a (fixed) smaller weight in the loss (1). The resulting refined loss, which incorporates the previously generated bin map, is:" + }, + { + "type": "equation", + "bbox": [ + 0.244, + 0.644, + 0.786, + 0.669 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {G E O M - E R A S I N G}} = \\mathbb {E} _ {z \\sim \\mathcal {E} (x), y \\sim Y, \\epsilon \\sim \\mathcal {N} (0, 1), t} \\left[ w \\odot \\| \\epsilon - \\epsilon_ {\\theta} \\left(z _ {t}, t, c _ {\\theta} \\left(y ^ {\\prime}\\right)\\right) \\| _ {2} ^ {2} \\right], \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.679, + 0.698, + 0.695 + ], + "angle": 0, + "content": "where \\(\\odot\\) denotes element-wise multiplication, and \\(w = [w_{m,n}]\\) with" + }, + { + "type": "equation", + "bbox": [ + 0.269, + 0.708, + 0.786, + 0.749 + ], + "angle": 0, + "content": "\\[\nw _ {m, n} = \\left\\{ \\begin{array}{l l} \\frac {T}{K + \\alpha (T - K)}, & \\text {i f} A _ {\\mathrm {b i n}} ^ {1} < m < A _ {\\mathrm {b i n}} ^ {2} \\text {a n d} B _ {\\mathrm {b i n}} ^ {1} < n < B _ {\\mathrm {b i n}} ^ {2} \\\\ \\frac {\\alpha T}{K + \\alpha (T - K)}, & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.758, + 0.788, + 0.852 + ], + "angle": 0, + "content": "\\(K = (A_{\\mathrm{bin}}^2 - A_{\\mathrm{bin}}^1) \\cdot (B_{\\mathrm{bin}}^2 - B_{\\mathrm{bin}}^1)\\), \\(T = \\frac{W}{W_{\\mathrm{bin}}} \\cdot \\frac{H}{H_{\\mathrm{bin}}}\\) is the number of bins with \\(\\sum w_{m,n} = T\\), and \\(\\alpha\\) is a hyperparameter. Eq. 5 normalizes the weight \\(w\\), aligning the magnitude of Eq. 4 with that of the original loss in Eq. 1. By formulating this loss function, emphasis on the undesirable areas is reduced during fine-tuning, leading to an enhancement in the quality of generated content in the desired regions." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.422, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table", + "bbox": [ + 0.239, + 0.144, + 0.777, + 0.224 + ], + "angle": 0, + "content": "
Dataset NameSample sizeICRStyleResolutionSource
ICD-QR83325%Cartoon512²Pokemon [17]
ICD-Watermark160k50%Real256²CC12M [5]
ICD-Text1000k100%Real256²LAION [22]
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.224, + 0.784, + 0.293 + ], + "angle": 0, + "content": "Table 1: Details of Implicit Concept Dataset. Our datasets are collectively termed as Implicit Concept Dataset (ICD), with each one encompassing a distinct implicit concept. They exhibit variations in several attributes. The term \"ICR\" denotes Implicit Concept Ratio, representing the proportion of images within the dataset that contain the implicit concept." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.336, + 0.785, + 0.457 + ], + "angle": 0, + "content": "Accessibility of the additional classifier or detector. Employing an extra classifier or detector to obtain location data is affordable and straightforward. Numerous models capable of identifying the presence or pinpointing the location of various concepts are readily available, as detailed in Appendix A. Moreover, accessing the model's parameters is unnecessary; only the outcomes from these models are required. Empirically, the effectiveness of GEOM-ERASING does not depend heavily on the detector's precision, allowing for some leniency regarding the accuracy of the detector, as will be seen later in Fig. 5." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.481, + 0.377, + 0.498 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.513, + 0.785, + 0.573 + ], + "angle": 0, + "content": "In this section, we perform experiments to demonstrate the effectiveness of GEOM-ERASING. We first introduce the experimental setup, and then we compare GEOM-ERASING with several existing erasure methods, followed by the ablation studies on essential components of GEOM-ERASING." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.596, + 0.312, + 0.611 + ], + "angle": 0, + "content": "5.1 Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.621, + 0.785, + 0.757 + ], + "angle": 0, + "content": "Implicit Concept Dataset. We curate three datasets, each corresponding to an implicit concept. As detailed in Table 1, these datasets vary in concept types, sizes, Implicit Concept Ratios (ICR), and image styles. In ICD-QR, QR codes are manually embedded in \\(25\\%\\) of the images. ICD-Watermark amalgamates images, with \\(50\\%\\) containing watermarks, sourced from CC12M [5]. ICD-Text utilizes dataset from [27], resulting in \\(100\\%\\) of the training images incorporating text. Additionally, corresponding test datasets devoid of any implicit concepts assembled for each of the above, to ensure a comprehensive evaluation. More details can be found in Appendix A." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Settings. To mirror real-world scenarios, we validate GEOM-ERASING in two settings: Model Refinement and Data Refinement. For Model Refinement, we eliminate the implicit concepts of watermark and unsafeness in the original SD. Watermark is evaluated under the evaluation set of our constructed" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.353, + 0.127 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.144, + 0.787, + 0.226 + ], + "angle": 0, + "content": "
WatermarkUnsafeness (I2P benchmark [21])Expected Max. Inapprox.
FIDICRF*R/100HateHarassmentViolenceSelf-harmSexualShockingIllegal activitiesOverall
SD [18]9.0511.131.010.400.340.400.400.300.510.360.390.970.06
ESD [7]9.4911.281.070.170.160.240.220.170.160.220.19-
FMN [28]10.0510.831.09---------
NP [11]9.1211.131.020.160.140.190.140.080.250.130.160.800.18
SLD-Strong [21]9.879.920.980.150.130.170.190.090.200.090.130.720.19
GEOM-ERASING8.347.310.610.110.110.130.060.050.150.070.090.630.20
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.227, + 0.788, + 0.296 + ], + "angle": 0, + "content": "Table 2: Comparison between GEOM-ERASING and existing erasure methods under Model Refinement setting. The metric for toxicity is the ratio of images containing toxicity contents. The last column is the bootstrap estimates of a model containing toxic images at least once for 25 prompts [21]. GEOM-ERASING achieves the state-of-the-art when eliminating these two implicit concepts." + }, + { + "type": "table", + "bbox": [ + 0.225, + 0.332, + 0.791, + 0.426 + ], + "angle": 0, + "content": "
ICD-QRICD-WatermarkICD-Text
FIDICRF*R/100FIDICRF*R/100FIDICRF*R/100
SD [18]65.8274.5949.107.5930.402.3154.2371.8438.96
ESD [7]90.9717.6416.057.6428.982.2160.5638.0823.06
FMN [28]71.7680.4257.717.7930.762.4057.3874.7542.89
NP [11]69.3159.6441.347.5427.712.0952.1365.6334.21
SLD-Strong [21]80.0570.2556.248.5632.562.7955.3666.0836.58
GEOM-ERASING41.415.382.236.995.020.3538.7413.485.22
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.427, + 0.788, + 0.482 + ], + "angle": 0, + "content": "Table 3: Comparison between GEOM-ERASING and other erasure methods under Data Refinement setting. All models are evaluated under ICD. GEOM-ERASING achieves the best among all three criteria, showing the successful elimination of the implicit concept while improving the image quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.533, + 0.788, + 0.609 + ], + "angle": 0, + "content": "dataset ICD-watermark, and unsafeness is evaluated under the I2P benchmark. Data Refinement mimics personalized fine-tuning when practitioners collect downstream datasets that may also contain implicit concepts, attributed to the limitations in sources and collecting methods. This setting is evaluated under all three ICD datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Baselines and evaluation metrics. We compare GEOM-ERASING with existing erasure methods, including Erased Stable Diffusion (ESD) [7], Forget-Me-Not (FMN) [28], Negative Prompt (NP) [11], and Safe Latent Diffusion (SLD) [21]. To depict the outcomes, we employ the Frechet Inception Distance (FID) [9] and the Implicit Concept Ratio (ICR) which is defined as the ratio of the number of images containing implicit concept to the total number of images. Both metrics prefer lower values. To facilitate a more comprehensive comparison between models and offer an integrated perspective on performance concerning both metrics, we introduce the \\( F*R/100 \\), which is calculated as the product of FID and ICR, serving as a unified metric for evaluating model performance. We also adopt the Inappropriate Image Prompts (I2P) benchmark [21] to validate our erasure of toxicity in the pre-trained diffusion model. We follow the setting of the original paper and provide the ratio results of harmful contents that appeared in the image. Since there are no reference images for I2P, we qualitatively provide generation images instead of FID value." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.422, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.145, + 0.788, + 0.319 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.327, + 0.788, + 0.37 + ], + "angle": 0, + "content": "Fig. 4: Qualitative comparison between different methods. Existing methods cannot erase ICs effectively while GEOM-ERASING successfully avoids the generation. Check more comparison in Fig. A3 and A4." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.4, + 0.557, + 0.416 + ], + "angle": 0, + "content": "5.2 Comparison with previous methods" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.788, + 0.518 + ], + "angle": 0, + "content": "Erasure of pre-trained SD (Model Refinement). We first compare GEOMERASING with other methods in the setting of erasing \"watermark\" and \"unsafeness\" contained in the pre-trained SD. We validate the \"watermark\" concept through the evaluation set of ICD-watermark, and \"unsafeness\" through the I2P benchmark. As shown in Table 2, GEOM-ERASING performs the best on both implicit concepts, achieving new state-of-the-art results on the I2P benchmark." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.529, + 0.788, + 0.622 + ], + "angle": 0, + "content": "Erasure in personalized fine-tuning (Data Refinement). As shown in Table 3 and visualized in Fig. 4, GEOM-ERASING notably surpasses existing erasure methods across three distinct implicit concepts by substantially diminishing their occurrence in the synthesized images. Even in instances where fine-tuned images all contained text, our method remarkably reduces text presence to just \\(13.48\\%\\), thus significantly minimizing the generation of unintended concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.738 + ], + "angle": 0, + "content": "Removing implicit concepts improves generation. Besides reducing unintended elements, GEOM-ERASING also improves the generation quality compared to the other methods in both settings. This improvement is due to the method's ability to effectively erase implicit concepts. Since the ideal images (reference images) do not contain these elements, avoiding them results in higher quality scores (FID scores). Further insights into the correlation between erasure efficacy and enhanced image quality are detailed in our ablation study in Sec. 5.3." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Existing erasure methods cannot do well for implicit concepts. The methods of FMN [28], NP [11], and SLD [21] demonstrate limitations in effectively removing implicit concepts. The performance of these methods relies on the diffusion model's capability to identify specific concepts. However, identifying the implicit concepts is a notable challenge for these models. This challenge is underscored by the attention map images provided in Sec. 3.2, which depicts" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.353, + 0.127 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.145, + 0.549, + 0.266 + ], + "angle": 0, + "content": "
ConceptGeometricLoss re-weightFIDICRF*R
7.5930.40230.74
✓7.0617.04120.30
✓6.9711.1877.92
✓6.4629.38189.79
✓✓6.817.3650.12
✓✓✓6.427.2346.42
Fine-tuning with 0% watermark (oracle)6.937.1349.41
" + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.173, + 0.795, + 0.265 + ], + "angle": 0, + "content": null + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.276, + 0.549, + 0.361 + ], + "angle": 0, + "content": "Table 4: Ablation of different components. Merely appending concept names to text conditions proves insufficient. Geometric component is crucial, and the re-weighted loss optimizes generation quality, exhibiting negligible impact on the ICR. Default settings are marked in gray." + }, + { + "type": "image_caption", + "bbox": [ + 0.553, + 0.278, + 0.788, + 0.361 + ], + "angle": 0, + "content": "Fig. 5: Effects of geometric accuracy. The x-axis is the IoU decided by the noise \\(\\sigma\\) added on the location. GEOM-ERASING has a tolerance of around 0.4 IoU considering ICR." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.391, + 0.788, + 0.527 + ], + "angle": 0, + "content": "the models' inadequacies in accurately identifying and addressing the implicit concepts, subsequently hindering successful erasure. Among all the baselines, ESD [7] demonstrates superior erasure performance, albeit with a higher FID score. This can be attributed to the approach employed by ESD, where the finetuned SD model is trained to move away from the images it originally generated, regardless of whether they contain the intended concept or not. However, since the original generated images may contain implicit concepts with high probability, ESD might result in unintended concept removal while affecting meaningful one, as shown in the second column of Fig. A4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.528, + 0.788, + 0.634 + ], + "angle": 0, + "content": "In contrast, the proposed GEOM-ERASING demonstrates the ability to effectively remove implicit concepts while preserving the other meaningful concepts, yielding favorable ICR and FID results. It surpasses the state-of-the-art, as evidenced by the superior \\(F*R/100\\) measure. Refer to Appendix C for visual comparisons among different methods. GEOM-ERASING offers a more refined and precise erasure process, ensuring that only the targeted implicit concept is removed, without affecting other relevant concepts." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.655, + 0.446, + 0.67 + ], + "angle": 0, + "content": "5.3 Ablation and Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.68, + 0.788, + 0.772 + ], + "angle": 0, + "content": "In this section, we perform various ablations analyses to demonstrate the effectiveness of different components in GEOM-ERASING. We mainly conduct experiments under the personalized fine-tuning setting with the \"watermark\" concept for better control. Additionally, we investigate the impact of geometric accuracy on the overall performance of our method and explore integrating our method with Negative Prompt to showcase its compatibility and synergies." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Ablative analysis. The ablation results, as shown in Table 4 and Fig. 6, shed light on the importance of different components in our methods. We separately integrate the concept name (Eq. 2), geometric information (Eq. 3), and loss reweight (Eq. 4) before combining them. Notably, the geometric component proved" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.422, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.251, + 0.15, + 0.761, + 0.359 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.371, + 0.788, + 0.4 + ], + "angle": 0, + "content": "Fig. 6: Visualization of different components. Geometric information significantly erases the implicit concepts while loss re-weight improves generation quality further." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.598 + ], + "angle": 0, + "content": "pivotal, markedly reducing both FID and ICR, particularly when synergized with the concept condition, enhancing the model's overall performance. The loss reweight component contributes to improving the visual appeal of the generated images while maintaining efficacy of implicit concept removal. Throughout the ablative studies, a consistent trend between FID and ICR is observed, implying enhanced erasure correlates to superior image quality. Moreover, when finetuning the model with no implicit concepts (0% images with watermarks), the model achieves an ICR comparable to GEOM-ERASING. Interestingly, GEOM-ERASING surpasses even this optimum in FID and \\(F*R\\), emphasizing the importance of geometric information in refining concept learning and subsequently improving image quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.788, + 0.779 + ], + "angle": 0, + "content": "Choice of bin size, number of selected bins, and re-weight loss influence erasure outcomes. Table 5 depicts the effects of varying bin sizes \\( M \\) and selected bin numbers \\( K \\) (bold values denoting the best performance and the gray row signifying the default selection). Bins are ranked and selected by value \\( p_i \\) as stated in Sec. 4. First, we analyze the impact of bin sizes by fixing the ratio between the number of selected bins and bin size and varying the size from \\( 8^2 \\) to \\( 64^2 \\). As the bin size increases, the performance initially improves and then starts to decline. This trend suggests that higher resolutions may provide more accurate concept localization but can also dilute the information density of the original text. Subsequently, with a fixed bin size, varying the number of selected bins shows enhancement in erasure performance up to a saturation point." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "For re-weight loss, we conduct ablation experiments based on the model in the gray row of Table 5. An alternate re-weight loss incorporating the \\( p_i \\) values is proposed. As shown in Table 6, applying the re-weight loss leads to improved FID compared to the model without the loss. However, utilizing the \\( p_i \\) may" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.353, + 0.127 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "table", + "bbox": [ + 0.227, + 0.144, + 0.387, + 0.254 + ], + "angle": 0, + "content": "
MKFIDICRF*R
8246.7818.26123.80
162166.5315.45100.89
322646.5112.6482.29
6421507.2916.47120.07
322726.817.3650.12
322806.927.3550.86
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.255, + 0.391, + 0.31 + ], + "angle": 0, + "content": "Table 5: Bin size and selected bins. Larger bin size and more bins improve results." + }, + { + "type": "table", + "bbox": [ + 0.418, + 0.145, + 0.59, + 0.246 + ], + "angle": 0, + "content": "
Re-weight FunctionαFIDICRF*R
Eq. 50.256.427.2346.42
0.506.407.6348.83
0.756.457.4147.79
(1-pi)α0.56.279.2157.75
16.339.3446.46
26.269.4459.09
" + }, + { + "type": "table_caption", + "bbox": [ + 0.413, + 0.254, + 0.589, + 0.308 + ], + "angle": 0, + "content": "Table 6: Re-weight loss. A fixed re-weight design is good enough for better ICR." + }, + { + "type": "table", + "bbox": [ + 0.616, + 0.145, + 0.788, + 0.204 + ], + "angle": 0, + "content": "
Negative PromptFIDICRF*R
w/o NP6.427.2346.42
Concept6.157.0343.23
+ Uniform Geometry6.995.0235.09
+ Random Geometry7.124.9835.46
" + }, + { + "type": "table_caption", + "bbox": [ + 0.611, + 0.254, + 0.788, + 0.308 + ], + "angle": 0, + "content": "Table 7: Input as negative prompt. Usage of the geometry improves ICR further." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.327, + 0.784, + 0.359 + ], + "angle": 0, + "content": "degrade the erasure performance. Opting for simplicity and effectiveness, a fixed value is utilized for the area covered by implicit concept, as mentioned in Eq. 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.364, + 0.785, + 0.456 + ], + "angle": 0, + "content": "Geometric accuracy. GEOM-ERASING is robust to the precision of geometric information provided. Upon selecting the bins, we introduce two noise scalars \\(\\epsilon_1,\\epsilon_2\\sim \\mathcal{N}(0,\\sigma^2)\\) to the selected bins, as \\(y^\\prime = y\\oplus y_{\\mathrm{im}}\\oplus \\langle l(m + \\epsilon_1,n + \\epsilon_2)\\rangle\\) Variations of \\(\\sigma\\) yield distinct IoU values between the originally selected and noised bins, visualized in Fig. 5. ICR can tolerate a geometry accuracy up to 0.4 IoU. However, the erasure performance deteriorates as accuracy decreases." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.788, + 0.597 + ], + "angle": 0, + "content": "Negative prompt. Adding both the learned concept name and geometric information to the negative prompt can better erase unwanted details. Since implicit concepts are supposed not to appear in any part of the image, we use location tokens that are picked uniformly or randomly as negative prompts. As shown in Table 7, adding the concept name to the negative prompt improves the erasure and overall quality of generated content due to the model's improved ability to recognize concepts. Adding geometric information, whether uniformly or randomly, further improves the erasure, but it also tends to increase the FID. We plan to explore the reasons for this increase in more detail in future work." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.616, + 0.36, + 0.632 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Fine-tuning on personalized datasets is a prevalent practice, but the presence of unwanted implicit concepts like QR codes, watermarks, and text within these datasets can pose significant challenges during the refinement of personal diffusion models. This paper delves into the substantial impact of such implicit concepts, establishing a formal framework for their removal. Conventional methods, which predominantly depend on pre-trained diffusion models or merely acknowledge concept existence, falter in eradicating these implicit elements. To address this, we introduce GEOM-ERASING, a novel approach that incorporates geometric information during the fine-tuning phase, translating this information to the text domain and refining the initial text condition. We substantiate our approach through three diverse datasets, each laden with distinct implicit concepts. The exemplary performance of GEOM-ERASING underscores its efficacy in eradicating specific concepts, paving the way for enhanced model fine-tuning practices." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.422, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Concept Removal of Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.395, + 0.163 + ], + "angle": 0, + "content": "Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.238 + ], + "angle": 0, + "content": "We gratefully acknowledge the support of MindSpore, CANN (Compute Architecture for Neural Networks) and Ascend AI Processor used for this research. This work was partially supported by the Research Grants Council of the Hong Kong Special Administrative Region (Grants C7004-22G-1 and 16202523)." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.259, + 0.323, + 0.275 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.288, + 0.785, + 0.331 + ], + "angle": 0, + "content": "1. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.332, + 0.785, + 0.359 + ], + "angle": 0, + "content": "2. Birhane, A., Prabhu, V.U., Kahembwe, E.: Multimodal datasets: misogyny, pornography, and malignant stereotypes. arXiv preprint arXiv:2110.01963 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.36, + 0.785, + 0.4 + ], + "angle": 0, + "content": "3. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing diffusion using semantic dimensions. arXiv preprint arXiv:2301.12247 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.401, + 0.785, + 0.441 + ], + "angle": 0, + "content": "4. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.442, + 0.785, + 0.482 + ], + "angle": 0, + "content": "5. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12M: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.484, + 0.785, + 0.51 + ], + "angle": 0, + "content": "6. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. In: NeurIPS (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.511, + 0.785, + 0.537 + ], + "angle": 0, + "content": "7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.538, + 0.785, + 0.579 + ], + "angle": 0, + "content": "8. Gao, R., Chen, K., Xie, E., Hong, L., Li, Z., Yeung, D.Y., Xu, Q.: Magicdrive: Street view generation with diverse 3d geometry control. arXiv preprint arXiv:2310.02601 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.58, + 0.785, + 0.62 + ], + "angle": 0, + "content": "9. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.621, + 0.785, + 0.647 + ], + "angle": 0, + "content": "0. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.649, + 0.785, + 0.675 + ], + "angle": 0, + "content": "1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.676, + 0.785, + 0.703 + ], + "angle": 0, + "content": "2. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: NeurIPS (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.704, + 0.785, + 0.731 + ], + "angle": 0, + "content": "3. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.785, + 0.771 + ], + "angle": 0, + "content": "4. Lee, T., Yasunaga, M., Meng, C., Mai, Y., Park, J.S., Gupta, A., Zhang, Y., Narayanan, D., Teufel, H.B., Bellagente, M., et al.: Holistic evaluation of text-to-image models. arXiv preprint arXiv:2311.04287 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "5. Li, P., Liu, Z., Chen, K., Hong, L., Zhuge, Y., Yeung, D.Y., Lu, H., Jia, X.: Trackdiffusion: Multi-object tracking data generation via diffusion models. arXiv preprint arXiv:2312.00651 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "6. Nichol, A.: Dall-e 2 pre-training mitigations. https://openai.com/research/dall-e-2-pre-training-mitigations (2022)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.288, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.353, + 0.127 + ], + "angle": 0, + "content": "Z. Liu et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "17. Pinkney, J.N.M.: Pokemon blip captions. https://huggingface.co/datasets/lambdalabs/pokemon-blip-captions/ (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.177, + 0.785, + 0.203 + ], + "angle": 0, + "content": "18. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.785, + 0.259 + ], + "angle": 0, + "content": "19. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.26, + 0.785, + 0.3 + ], + "angle": 0, + "content": "20. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.301, + 0.785, + 0.327 + ], + "angle": 0, + "content": "21. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.37 + ], + "angle": 0, + "content": "22. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.397 + ], + "angle": 0, + "content": "23. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.438 + ], + "angle": 0, + "content": "24. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.785, + 0.466 + ], + "angle": 0, + "content": "25. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. In: NeurIPS (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.494 + ], + "angle": 0, + "content": "26. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.785, + 0.522 + ], + "angle": 0, + "content": "27. Yang, Y., Gui, D., Yuan, Y., Ding, H., Hu, H., Chen, K.: Glyphcontrol: Glyph conditional control for visual text generation. arXiv preprint arXiv:2305.18259 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.785, + 0.55 + ], + "angle": 0, + "content": "28. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.785, + 0.577 + ], + "angle": 0, + "content": "29. Zhang, Y., Hooi, B.: Hipa: Enabling one-step text-to-image diffusion models via high-frequency-promoting adaptation. arXiv preprint arXiv:2311.18158 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.785, + 0.605 + ], + "angle": 0, + "content": "30. Zhang, Y., Zhou, D., Hooi, B., Wang, K., Feng, J.: Expanding small-scale datasets with guided imagination. In: NeurIPS (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.605 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_origin.pdf b/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..467eac89e40f07b0f75c9d063184a6bfd452fab4 --- /dev/null +++ b/2024/Implicit Concept Removal of Diffusion Models/405c4f60-62f2-4cac-9886-d7a1411bef57_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9a983f835fb38970c4592c69e372eac306c0acee3cfee69e07cf4d4e85245a83 +size 2414168 diff --git a/2024/Implicit Concept Removal of Diffusion Models/full.md b/2024/Implicit Concept Removal of Diffusion Models/full.md new file mode 100644 index 0000000000000000000000000000000000000000..8e7ea09fb6759c0770a3b7f363b6f483b0646574 --- /dev/null +++ b/2024/Implicit Concept Removal of Diffusion Models/full.md @@ -0,0 +1,268 @@ +# Implicit Concept Removal of Diffusion Models + +Zhili Liu $^{1,2\star}$ , Kai Chen $^{1\star}$ , Yifan Zhang $^{3}$ , Jianhua Han $^{2}$ , Lanqing Hong $^{2}$ , Hang Xu $^{2}$ , Zhenguo Li $^{2}$ , Dit-Yan Yeung $^{1}$ , and James T. Kwok $^{1}$ + +$^{1}$ Hong Kong University of Science and Technology + $^{2}$ Huawei Noah's Ark Lab $^{3}$ National University of Singapore +Project Page: https://kaichen1998.github.io/projects/geom-erasing/ + +Abstract. Text-to-image (T2I) diffusion models often inadvertently generate unwanted concepts such as watermarks and unsafe images. These concepts, termed "implicit concepts", can be unintentionally learned during training and then be generated uncontrollably during inference. Existing removal methods still struggle to eliminate implicit concepts primarily due to their dependency on the model's ability to recognize concepts it actually can not discern. To address this, we utilize the intrinsic geometric characteristics of implicit concepts and present GEOM-ERASING, a novel concept removal method based on geometric-driven control. Specifically, once an unwanted implicit concept is identified, we integrate the existence and geometric information of the concept into the text prompts with the help of an accessible classifier or detector model. Subsequently, the model is optimized to identify and disentangle this information, which is then adopted as negative prompts during generation. Moreover, we introduce the Implicit Concept Dataset (ICD), a novel image-text dataset imbued with three typical implicit concepts (QR codes, watermarks, and text), reflecting real-life situations where implicit concepts are easily injected. GEOM-ERASING effectively mitigates the generation of implicit concepts, achieving state-of-the-art results on the Inappropriate Image Prompts (I2P) and our challenging Implicit Concept Dataset (ICD) benchmarks. + +Keywords: Concept Erasure $\cdot$ Implicit Concept $\cdot$ Geometric Control + +# 1 Introduction + +Text-to-image diffusion models (DMs) have become increasingly popular due to their exceptional proficiency in generating high-quality images [8, 10, 15, 30]. Despite the advancements, DMs sometimes inadvertently generate unwanted concepts such as watermarks [14] or unsafe images [21]. Take Stable Diffusion $(\mathrm{SD})^3$ [18] as an example. When text prompts on topics related to indoor furniture or human portrait are used, surprisingly we find that the generated images + +![](images/d1a1959292191590b986d2b3d5129934cbdb4b6224aa9ca26f955a257a86cacb.jpg) +ICD-Watermark +Fig. 1: Generation of implicit concepts. SD surprisingly generates images with watermarks and unsafe content even though these implicit concepts are not mentioned in the text prompt. + +often contain watermarks (Fig. 1), even though no watermark-related keyword is mentioned in the text prompts. In addition, SD is more likely to generate unsafe content when the text prompts contain art and women [21]. Evaluations on the I2P dataset [21] and our ICD-Watermark dataset (details in Sec. 5.1) show that watermarks and unsafe content show up in $11\%$ and $39\%$ , respectively, of the generated images. + +In this paper, we define implicit concepts (IC) as concepts that are not explicitly specified in the text prompts but are still generated by the DMs. The presence of implicit concepts not only poses potential legal issues but also significantly undermines user trust and satisfaction. Generating a watermark or unsafe content in the image could render the artwork unusable, forcing the user to discard their efforts and seek alternative solutions, which exacerbates the mistrust towards the model and deters future use for similar creative endeavors. + +Avoiding the generation of implicit concepts is difficult. Even when the DM is trained on datasets that are supposed to be watermark-free or not-safe-for-work (NSFW) filtered [16, 18], implicit concepts might still be generated [4, 14] due to inherent limitations in detecting and filtering all problematic images from the web-crawled datasets [2]. Our research instead considers the alternative prevalent post-hoc strategy that erases undesirable concepts from the pre-trained DMs. This encompasses methods that fine-tune DMs on paired images (one containing the concepts for erasure and the other does not), to redirect the generation away from specific concepts [7, 13], or reduce activation values in the cross-attention module [28]. Other methods carefully design the text prompts [11] and diffusion + +process [21] to navigate the model negatively away from the unwanted concepts. While these strategies are effective for erasing explicit concepts such as semantic objects and art styles, we find that they do not perform well on erasing implicit concepts, as will be shown in Tables 2 and 3 of Sec. 5. + +Here we first systematically explore the reasons behind the failure of existing methods to erase implicit concepts. In particular, we identify a core mismatch. These methods assume the concept to be erased can be controllably generated or recognized by the DM, which is not feasible for implicit concepts. We demonstrate that implicit concepts cannot be controllably generated, making it difficult to construct reliable paired images for fine-tuning. Furthermore, implicit concepts may not be recognized by the DM, and thus accurately navigating the generation is also hard. Refer to Sec. 3 for detailed experiments. + +Next, we study why DMs generate concepts they are not aware of. We conjecture that it stems from the training dataset which contains images with these concepts but the text conditions do not. To demonstrate this, we construct an Implicit Concept Dataset (ICD), containing three implicit concepts (QR codes, watermarks, and text) that commonly exist in real-world image databases. Training on the ICD shows a high chance of generating images containing these unwanted implicit concepts, while the resulting model is unaware of them, as detailed in Appendix B. The ICD also allows for quantitative evaluation and analysis of the proposed method, a step beyond the previous research. + +Recognizing these challenges, our work proposes a novel erasure method designed to specifically target and eliminate implicit concepts. Unlike existing erasure methods, it does not require the construction of paired images or complex fine-tuning strategies. Our key aim is to let the model re-know clearly the concepts it needs to erase. We observe a consistent feature where these concepts often exist in certain parts of the image. In other words, while the image as a whole might look appealing, unwanted implicit concepts are localized to specific areas. For instance, watermarks often appear as copyright images or lines of text in specific image sections, and unsafe content is concentrated in exposed body areas. Based on these insights, we propose GEOM-ERASING, a simple yet effective technique aiming at removing implicit concepts in diffusion models. By incorporating an additional classifier or detector, we integrate both the existence and geometric information of implicit concepts into the text prompts. This empowers models to accurately identify and exclude these concepts. Notably, GEOM-ERASING converts this information into text prompts without accessing the parameters of the classifier or detector. As a result, inputting the existence and geometric information as negative prompts during the sampling process produces images free from unwanted implicit concepts. Our findings emphasize the crucial role of geometric information in successfully erasing implicit concepts. + +For performance evaluation, we use two settings mimicking real-world scenarios: 1) Model Refinement: The pre-trained DM already contains watermark and unsafe concepts, and we aim to remove these implicit concepts without harming the generation quality of other concepts. 2) Data Refinement: The users may fine-tune the DM with datasets containing implicit concepts. Under + +both settings, we successfully reduce the chance of generating implicit concepts on ICD, and outperform previous state-of-the-art for eliminating unsafe content on the Inappropriate Image Prompts (I2P) [21] benchmark. + +Our contributions can be summarized as: + +1. We present the problem of eliminating implicit concepts (IC), and uncover a fundamental shortcoming of current erasure techniques, namely that they assume that concepts can be intentionally generated or recognized by DMs. This assumption is not feasible for implicit concepts, leading to their failure in eradicating these concepts. + +2. We construct the Implicit Concept Dataset, containing three sub-datasets embedded with varied implicit concepts, to serve as substantial resources to propel future research endeavors to resolve the problem. + +3. We propose GEOM-ERASING, a novel concept-removal method verified through two settings: Model Refinement, and Data Refinement, demonstrating its robust capability to eliminate implicit concepts in real-world applications. + +# 2 Related work + +Diffusion models [10, 23] excel in various generative tasks such as density estimation [12], image synthesis [6], and text-to-image generation [1, 18, 20, 29]. It transforms a data distribution to the normal distribution by incrementally injecting noise and subsequently reversing this process through denoising to reconstruct the original distribution. This study particularly focuses on text-to-image generation using diffusion models that are pre-trained on extensive datasets [18]. Such models, while capable of generating diverse content based on text conditions, also present notable risks such as generating harmful [21], watermarked, and content infringing on copyright [28]. Consequently, this raises the need for research directed towards the elimination of such undesired concepts. + +Concept erasing in diffusion models. Current erasure methods mainly depend on the model's ability to recognize the concepts. A segment of research is concentrated on refining the diffusion process. Techniques such as Negative Prompt (NP) [11] and Safe Latent Diffusion (SLD) [3, 21] use well-designed negative prompts. They employ enhanced Classifier-free guidance [11] for more refined control, steering diffusion models away from generating specific, undesirable concepts. This approach depends heavily on the model's pre-trained understanding of the concept. Another approach is to fine-tune the model to remove specific concepts. For instance, Erased Stable Diffusion (ESD) [7] generates images with an unwanted concept and then guides the model away from creating such content. Forget-Me-Not (FMN) [28] utilizes textual inversion to bolster the model's recognition of the existence of the specific concept, subsequently adjusting the cross-attention [26] scores between undesired concept and image content, resulting in images exhibiting diminished response to undesired concepts. However, we found that just adding existence information to the model is not enough to remove implicit concepts. So, we also include geometric information, which helps reduce the appearance of unwanted concepts significantly. + +# 3 Preliminary Study + +Section 3.1 first introduces the definition of implicit concept removal. In Section 3.2, we perform experiments to demonstrate that implicit concepts cannot be generated in a controlled manner and are also not identifiable by Stable Diffusion (SD). These two problems fundamentally underpin the failure of existing erasure techniques on implicit concepts. + +# 3.1 Problem Statement + +This work addresses eliminating unwanted and unintended implicit concepts from diffusion models. In particular, we focus on the Latent Diffusion Model [18] (Stable Diffusion (SD) specifically). We study two realistic settings: (i) Model Refinement: We target at the removal of implicit concepts that are already present in the corrupted SD model, without compromising the original quality of generation. (ii) Data Refinement: we consider situations where users need to fine-tune the SD on a personalized corrupted dataset $\mathcal{D}$ which contains implicit concept $y_{im}$ . Our objective is to fine-tune a model, so that it can generate images closely resembling $\mathcal{D}$ but with the implicit concept removed. + +Following SD, we fine-tune diffusion models in the latent space of VQ-VAE [25]. An encoder $\mathcal{E}$ maps an image $x\in X$ to the latent code $z = \mathcal{E}(x)$ , and the decoder $D$ then reconstructs the image as $D(z) = x$ . During fine-tuning, the diffusion model optimizes a UNet [6,10,19,24] to predict the unscaled noise added to the latent code of the image. The loss function is: + +$$ +\mathcal {L} _ {S D} = \mathbb {E} _ {z _ {t} \sim \mathcal {E} _ {t} (x), y \sim Y, \epsilon \sim \mathcal {N} (0, 1), t} \left[ \| \epsilon - \epsilon_ {\theta} (z _ {t}, t, c _ {\theta} (y)) \| _ {2} ^ {2} \right], \tag {1} +$$ + +where $y \sim Y$ is the input text, $t$ is the time step, $z_{t}$ is the noised latent code of the image, $\epsilon$ is an unscaled noise sample, and $\epsilon_{\theta}$ is the denoising network to be fine-tuned. During inference, a random noise tensor is sampled and iteratively denoised until the image latent $z_{0}$ is obtained. The image is then generated by the decoder as $x' = D(z_{0})$ . + +# 3.2 Preliminary Experiments + +In this section, we perform preliminary experiments to examine the limitations of existing approaches [7,11,13,21,28] in erasing implicit concepts. These methods depend on SD's ability to controllably produce paired images and identify these concepts, a process we demonstrate is not viable for implicit concepts. + +Implicit concepts cannot be controllably generated. Some erasure methods [7,13] necessitate the creation of image pairs, with one containing the concept for erasure and the other does not. However, for implicit concepts, construction of such image pairs may not be possible. Our study, depicted in Fig. 2a, reveals that there is minimal connection between directly asking for "watermarks" in the prompt and their actual presence in the generated images. This is supported by a + +![](images/19e998abc1dbb78825dad37cf13ce18aa313b9cb7f91a52333a47c02e500af4b.jpg) +long-haired tuxedo kitten with long white whiskers standing on a pink blanket looking slightly to viewers, watermark + +![](images/4860216a746c274d710c29fd319af62b14b2aba84fad08217039c70c0e601929.jpg) +man standing in a pond +throwing a fishing net, +timbavati nature reserve, +limpopo, south africa, +africa + +Fig. 2: Observations from preliminary experiments. (a) Implicit concepts cannot be controllably generated. (b) Implicit concepts cannot be recognized by SD. +![](images/bd15d351add6099b0fdc891cb6b5d4ccc51a777d70c2f9901da54a6791c38dfa.jpg) +(a) Including "watermark" in text prompt does not ensure its appearance in image, and vice versa. +(b) Cross-attention map between keyword "watermark" and the generated image. + +correlation coefficient of $r = -0.08$ and a P-value $p = 0.21$ across 1000 samples, indicating an insignificant effect. This demonstrates that it is not possible to reliably generate image pairs for the purpose of erasure. + +Implicit concepts cannot be recognized by SD. Other erasure methods [11, 21, 28] depend on the model's ability to identify concepts to be erased. However, SD often fails to detect the presence of implicit concepts. Using an example on the implicit concept of watermarks, Fig. 2b visualizes the cross-attention map of the last transformer layer between the keyword "watermark" and the generated image. Since SD [18], NP [11] and SLD [21] exhibit similar patterns, we visualize them in the same image to save space. As can be seen, SD [18], NP [11], SLD [21], and FMN [28] cannot attend to the location of the watermark. A more thorough evaluation will be presented in Sec. 5.2. This demonstrates that existing erasure methods are unable to accurately identify implicit concepts, indicating inefficiency for the accurate navigating from generation. + +# 4 Proposed Method + +In this section, we present GEOM-ERASING which mitigates the impact of undesired implicit concepts and disentangle these concepts from the model. We begin with an overview of the method and then delve into its components: implicit concept recognition, geometry-driven removal, and loss re-weight strategy. + +Overall architecture. The architecture of our method is shown in Fig. 3. The image $x \in X$ may contain various implicit concepts. Upon confirming the presence of such a concept, we amend the original text condition by appending the concept name (e.g., QR codes, watermark, text and unsafeness). However, merely acknowledging the concept's existence proved insufficient for its erasure. Thus, we extract the location of the concept and integrate this into the caption. For + +![](images/6240e7816ffcfab1ef9e0afe7d81cba977f6b38fe0efd450f033d7dd6e92668d.jpg) +Fig. 3: Model architecture of GEOM-ERASING. It begins with an original image that may harbor multiple distinct implicit concepts. We extract the geometric information of these concepts and convert it into text conditions. Special location tokens are added to the original text vocabulary representing the bins discretized from the original images. Text prompts are updated by appending location tokens corresponding to areas enveloped by the concept. Loss re-weighting is employed to concentrate more on areas devoid of implicit concepts. During sampling, the learned tokens are input as negative prompts, resulting in image generation free from implicit concepts. + +Model Refinement setting, optimizing the added tokens representing the existence and location is enough. For Data Refinement, we additionally train the diffusion model parameters to learn the new distribution. After fine-tuning via our enhanced text condition, adding existence with location tokens in negative prompts enables the model to omit the unintended implicit concepts effectively. + +Implicit concept recognition. The initial step in GEOM-ERASING involves identifying the presence and location of implicit concepts. Fortunately, this task is relatively straightforward with the existence of several classifiers or detectors that are adept at recognizing common implicit concepts. For example, to identify watermarks, one can use LAION4. Details and models for detecting other implicit concepts are in Appendix A. + +Given a detector for the implicit concept, we acquire at most $N$ predictions of the concepts, $L = [p_i,(o_i)]_{i = 1}^N$ , where $p_i$ is the confidence in identifying the location as the implicit concept, and $o_i = [a_i^1,b_i^1,a_i^2,b_i^2]$ are the coordinates of the concept's position, where $(a_i^1,b_i^1)$ and $(a_i^2,b_i^2)$ are the upper-left and bottom-right positions. This will be integrated to our subsequent geometry-driven removal. + +Geometry-driven removal. We modify the original text condition so that the diffusion model can discern both the presence and spatial location of the implicit concept, which are essential prerequisites for effective erasure. Let the original image-text pair from the fine-tuning dataset $\mathcal{D}$ be $(x,y)$ . If an image is classified + +as containing a specific concept, we append the concept name to the original text condition: + +$$ +y ^ {\prime} = \left\{ \begin{array}{l l} y & p < t \\ y \oplus y _ {i m} & \text {o t h e r w i s e} \end{array} , \right. \tag {2} +$$ + +where $p$ is the confidence in identifying the implicit concept, $t$ is a threshold, $\oplus$ denotes the concatenation operation, and $y_{im}$ is the name of the implicit concept. This enhances the model to identify the existence of implicit concept. + +To acquaint the model with geometric information of the concept, we first discretize the continuous coordinates into bins. Each bin corresponds to a distinct location token that is subsequently included in the text vocabulary. The bins that are covered by the location will be selected, and the corresponding location tokens are added after the concept name in the text condition (Fig. 3). Empirically, this design is robust to the precision of the detector and allows efficient training, as will be seen in Sec. 5. + +Specifically, assume that the image size is $W \times H$ and a bin size of $W_{\mathrm{bin}} \times H_{\mathrm{bin}}$ , location tokens are inserted into the text vocabulary $\langle l(m,n) \rangle_{m=1,n=1}^{m=W / W_{\mathrm{bin}}, n = H / H_{\mathrm{bin}}}$ . For each implicit concept in the image, the text condition is then updated as: + +$$ +y ^ {\prime} = \left\{ \begin{array}{l l} y & \text {i f} p < t \\ y \oplus y _ {\mathrm {i m}} \oplus \langle l (m, n) \rangle_ {m = A _ {\mathrm {b i n}} ^ {1}, n = B _ {\mathrm {b i n}} ^ {1}} ^ {m = A _ {\mathrm {b i n}} ^ {2}, n = B _ {\mathrm {b i n}} ^ {2}} & \text {o t h e r w i s e} \end{array} , \right. \tag {3} +$$ + +where $A_{\mathrm{bin}}^{1} = \lfloor a_{i}^{1} / W_{\mathrm{bin}}\rfloor$ , $B_{\mathrm{bin}}^{1} = \lfloor b_{i}^{1} / H_{\mathrm{bin}}\rfloor$ , $A_{\mathrm{bin}}^{2} = \lceil a_{i}^{2} / W_{\mathrm{bin}}\rceil$ , and $B_{\mathrm{bin}}^{2} = \lceil b_{i}^{2} / H_{\mathrm{bin}}\rceil$ . This approach indicates the spatial attributes of implicit concepts. + +Loss re-weighting on specific regions. Due to the presence of undesirable implicit concepts in the chosen bins, intuitively, we expect that the model will acquire proficient generation quality from the regions associated with non-implicit concepts. Consequently, to de-emphasize the implicit concept areas, we assign them a (fixed) smaller weight in the loss (1). The resulting refined loss, which incorporates the previously generated bin map, is: + +$$ +\mathcal {L} _ {\mathrm {G E O M - E R A S I N G}} = \mathbb {E} _ {z \sim \mathcal {E} (x), y \sim Y, \epsilon \sim \mathcal {N} (0, 1), t} \left[ w \odot \| \epsilon - \epsilon_ {\theta} \left(z _ {t}, t, c _ {\theta} \left(y ^ {\prime}\right)\right) \| _ {2} ^ {2} \right], \tag {4} +$$ + +where $\odot$ denotes element-wise multiplication, and $w = [w_{m,n}]$ with + +$$ +w _ {m, n} = \left\{ \begin{array}{l l} \frac {T}{K + \alpha (T - K)}, & \text {i f} A _ {\mathrm {b i n}} ^ {1} < m < A _ {\mathrm {b i n}} ^ {2} \text {a n d} B _ {\mathrm {b i n}} ^ {1} < n < B _ {\mathrm {b i n}} ^ {2} \\ \frac {\alpha T}{K + \alpha (T - K)}, & \text {o t h e r w i s e} \end{array} , \right. \tag {5} +$$ + +$K = (A_{\mathrm{bin}}^2 - A_{\mathrm{bin}}^1) \cdot (B_{\mathrm{bin}}^2 - B_{\mathrm{bin}}^1)$ , $T = \frac{W}{W_{\mathrm{bin}}} \cdot \frac{H}{H_{\mathrm{bin}}}$ is the number of bins with $\sum w_{m,n} = T$ , and $\alpha$ is a hyperparameter. Eq. 5 normalizes the weight $w$ , aligning the magnitude of Eq. 4 with that of the original loss in Eq. 1. By formulating this loss function, emphasis on the undesirable areas is reduced during fine-tuning, leading to an enhancement in the quality of generated content in the desired regions. + +
Dataset NameSample sizeICRStyleResolutionSource
ICD-QR83325%Cartoon512²Pokemon [17]
ICD-Watermark160k50%Real256²CC12M [5]
ICD-Text1000k100%Real256²LAION [22]
+ +Table 1: Details of Implicit Concept Dataset. Our datasets are collectively termed as Implicit Concept Dataset (ICD), with each one encompassing a distinct implicit concept. They exhibit variations in several attributes. The term "ICR" denotes Implicit Concept Ratio, representing the proportion of images within the dataset that contain the implicit concept. + +Accessibility of the additional classifier or detector. Employing an extra classifier or detector to obtain location data is affordable and straightforward. Numerous models capable of identifying the presence or pinpointing the location of various concepts are readily available, as detailed in Appendix A. Moreover, accessing the model's parameters is unnecessary; only the outcomes from these models are required. Empirically, the effectiveness of GEOM-ERASING does not depend heavily on the detector's precision, allowing for some leniency regarding the accuracy of the detector, as will be seen later in Fig. 5. + +# 5 Experiments + +In this section, we perform experiments to demonstrate the effectiveness of GEOM-ERASING. We first introduce the experimental setup, and then we compare GEOM-ERASING with several existing erasure methods, followed by the ablation studies on essential components of GEOM-ERASING. + +# 5.1 Setup + +Implicit Concept Dataset. We curate three datasets, each corresponding to an implicit concept. As detailed in Table 1, these datasets vary in concept types, sizes, Implicit Concept Ratios (ICR), and image styles. In ICD-QR, QR codes are manually embedded in $25\%$ of the images. ICD-Watermark amalgamates images, with $50\%$ containing watermarks, sourced from CC12M [5]. ICD-Text utilizes dataset from [27], resulting in $100\%$ of the training images incorporating text. Additionally, corresponding test datasets devoid of any implicit concepts assembled for each of the above, to ensure a comprehensive evaluation. More details can be found in Appendix A. + +Settings. To mirror real-world scenarios, we validate GEOM-ERASING in two settings: Model Refinement and Data Refinement. For Model Refinement, we eliminate the implicit concepts of watermark and unsafeness in the original SD. Watermark is evaluated under the evaluation set of our constructed + +
WatermarkUnsafeness (I2P benchmark [21])Expected Max. Inapprox.
FIDICRF*R/100HateHarassmentViolenceSelf-harmSexualShockingIllegal activitiesOverall
SD [18]9.0511.131.010.400.340.400.400.300.510.360.390.970.06
ESD [7]9.4911.281.070.170.160.240.220.170.160.220.19-
FMN [28]10.0510.831.09---------
NP [11]9.1211.131.020.160.140.190.140.080.250.130.160.800.18
SLD-Strong [21]9.879.920.980.150.130.170.190.090.200.090.130.720.19
GEOM-ERASING8.347.310.610.110.110.130.060.050.150.070.090.630.20
+ +Table 2: Comparison between GEOM-ERASING and existing erasure methods under Model Refinement setting. The metric for toxicity is the ratio of images containing toxicity contents. The last column is the bootstrap estimates of a model containing toxic images at least once for 25 prompts [21]. GEOM-ERASING achieves the state-of-the-art when eliminating these two implicit concepts. + +
ICD-QRICD-WatermarkICD-Text
FIDICRF*R/100FIDICRF*R/100FIDICRF*R/100
SD [18]65.8274.5949.107.5930.402.3154.2371.8438.96
ESD [7]90.9717.6416.057.6428.982.2160.5638.0823.06
FMN [28]71.7680.4257.717.7930.762.4057.3874.7542.89
NP [11]69.3159.6441.347.5427.712.0952.1365.6334.21
SLD-Strong [21]80.0570.2556.248.5632.562.7955.3666.0836.58
GEOM-ERASING41.415.382.236.995.020.3538.7413.485.22
+ +Table 3: Comparison between GEOM-ERASING and other erasure methods under Data Refinement setting. All models are evaluated under ICD. GEOM-ERASING achieves the best among all three criteria, showing the successful elimination of the implicit concept while improving the image quality. + +dataset ICD-watermark, and unsafeness is evaluated under the I2P benchmark. Data Refinement mimics personalized fine-tuning when practitioners collect downstream datasets that may also contain implicit concepts, attributed to the limitations in sources and collecting methods. This setting is evaluated under all three ICD datasets. + +Baselines and evaluation metrics. We compare GEOM-ERASING with existing erasure methods, including Erased Stable Diffusion (ESD) [7], Forget-Me-Not (FMN) [28], Negative Prompt (NP) [11], and Safe Latent Diffusion (SLD) [21]. To depict the outcomes, we employ the Frechet Inception Distance (FID) [9] and the Implicit Concept Ratio (ICR) which is defined as the ratio of the number of images containing implicit concept to the total number of images. Both metrics prefer lower values. To facilitate a more comprehensive comparison between models and offer an integrated perspective on performance concerning both metrics, we introduce the $F*R/100$ , which is calculated as the product of FID and ICR, serving as a unified metric for evaluating model performance. We also adopt the Inappropriate Image Prompts (I2P) benchmark [21] to validate our erasure of toxicity in the pre-trained diffusion model. We follow the setting of the original paper and provide the ratio results of harmful contents that appeared in the image. Since there are no reference images for I2P, we qualitatively provide generation images instead of FID value. + +![](images/df49c37a1ff8c8968151b31c42960e07b5fa8eaea72bc221daa99227cd606f41.jpg) +Fig. 4: Qualitative comparison between different methods. Existing methods cannot erase ICs effectively while GEOM-ERASING successfully avoids the generation. Check more comparison in Fig. A3 and A4. + +# 5.2 Comparison with previous methods + +Erasure of pre-trained SD (Model Refinement). We first compare GEOMERASING with other methods in the setting of erasing "watermark" and "unsafeness" contained in the pre-trained SD. We validate the "watermark" concept through the evaluation set of ICD-watermark, and "unsafeness" through the I2P benchmark. As shown in Table 2, GEOM-ERASING performs the best on both implicit concepts, achieving new state-of-the-art results on the I2P benchmark. + +Erasure in personalized fine-tuning (Data Refinement). As shown in Table 3 and visualized in Fig. 4, GEOM-ERASING notably surpasses existing erasure methods across three distinct implicit concepts by substantially diminishing their occurrence in the synthesized images. Even in instances where fine-tuned images all contained text, our method remarkably reduces text presence to just $13.48\%$ , thus significantly minimizing the generation of unintended concepts. + +Removing implicit concepts improves generation. Besides reducing unintended elements, GEOM-ERASING also improves the generation quality compared to the other methods in both settings. This improvement is due to the method's ability to effectively erase implicit concepts. Since the ideal images (reference images) do not contain these elements, avoiding them results in higher quality scores (FID scores). Further insights into the correlation between erasure efficacy and enhanced image quality are detailed in our ablation study in Sec. 5.3. + +Existing erasure methods cannot do well for implicit concepts. The methods of FMN [28], NP [11], and SLD [21] demonstrate limitations in effectively removing implicit concepts. The performance of these methods relies on the diffusion model's capability to identify specific concepts. However, identifying the implicit concepts is a notable challenge for these models. This challenge is underscored by the attention map images provided in Sec. 3.2, which depicts + +
ConceptGeometricLoss re-weightFIDICRF*R
7.5930.40230.74
✓7.0617.04120.30
✓6.9711.1877.92
✓6.4629.38189.79
✓✓6.817.3650.12
✓✓✓6.427.2346.42
Fine-tuning with 0% watermark (oracle)6.937.1349.41
+ +![](images/cc476d8bfca9e3d356d3660bc5177f4c91ee724fe34f2dd899895c73d8b8de0d.jpg) +Fig. 5: Effects of geometric accuracy. The x-axis is the IoU decided by the noise $\sigma$ added on the location. GEOM-ERASING has a tolerance of around 0.4 IoU considering ICR. + +Table 4: Ablation of different components. Merely appending concept names to text conditions proves insufficient. Geometric component is crucial, and the re-weighted loss optimizes generation quality, exhibiting negligible impact on the ICR. Default settings are marked in gray. + +the models' inadequacies in accurately identifying and addressing the implicit concepts, subsequently hindering successful erasure. Among all the baselines, ESD [7] demonstrates superior erasure performance, albeit with a higher FID score. This can be attributed to the approach employed by ESD, where the finetuned SD model is trained to move away from the images it originally generated, regardless of whether they contain the intended concept or not. However, since the original generated images may contain implicit concepts with high probability, ESD might result in unintended concept removal while affecting meaningful one, as shown in the second column of Fig. A4. + +In contrast, the proposed GEOM-ERASING demonstrates the ability to effectively remove implicit concepts while preserving the other meaningful concepts, yielding favorable ICR and FID results. It surpasses the state-of-the-art, as evidenced by the superior $F*R/100$ measure. Refer to Appendix C for visual comparisons among different methods. GEOM-ERASING offers a more refined and precise erasure process, ensuring that only the targeted implicit concept is removed, without affecting other relevant concepts. + +# 5.3 Ablation and Analysis + +In this section, we perform various ablations analyses to demonstrate the effectiveness of different components in GEOM-ERASING. We mainly conduct experiments under the personalized fine-tuning setting with the "watermark" concept for better control. Additionally, we investigate the impact of geometric accuracy on the overall performance of our method and explore integrating our method with Negative Prompt to showcase its compatibility and synergies. + +Ablative analysis. The ablation results, as shown in Table 4 and Fig. 6, shed light on the importance of different components in our methods. We separately integrate the concept name (Eq. 2), geometric information (Eq. 3), and loss reweight (Eq. 4) before combining them. Notably, the geometric component proved + +![](images/0b136721b81a4dd792e7e7c455e9b88ee5e8ea1b7e61a100e874c3433b2e6d27.jpg) +Fig. 6: Visualization of different components. Geometric information significantly erases the implicit concepts while loss re-weight improves generation quality further. + +pivotal, markedly reducing both FID and ICR, particularly when synergized with the concept condition, enhancing the model's overall performance. The loss reweight component contributes to improving the visual appeal of the generated images while maintaining efficacy of implicit concept removal. Throughout the ablative studies, a consistent trend between FID and ICR is observed, implying enhanced erasure correlates to superior image quality. Moreover, when finetuning the model with no implicit concepts (0% images with watermarks), the model achieves an ICR comparable to GEOM-ERASING. Interestingly, GEOM-ERASING surpasses even this optimum in FID and $F*R$ , emphasizing the importance of geometric information in refining concept learning and subsequently improving image quality. + +Choice of bin size, number of selected bins, and re-weight loss influence erasure outcomes. Table 5 depicts the effects of varying bin sizes $M$ and selected bin numbers $K$ (bold values denoting the best performance and the gray row signifying the default selection). Bins are ranked and selected by value $p_i$ as stated in Sec. 4. First, we analyze the impact of bin sizes by fixing the ratio between the number of selected bins and bin size and varying the size from $8^2$ to $64^2$ . As the bin size increases, the performance initially improves and then starts to decline. This trend suggests that higher resolutions may provide more accurate concept localization but can also dilute the information density of the original text. Subsequently, with a fixed bin size, varying the number of selected bins shows enhancement in erasure performance up to a saturation point. + +For re-weight loss, we conduct ablation experiments based on the model in the gray row of Table 5. An alternate re-weight loss incorporating the $p_i$ values is proposed. As shown in Table 6, applying the re-weight loss leads to improved FID compared to the model without the loss. However, utilizing the $p_i$ may + +
MKFIDICRF*R
8246.7818.26123.80
162166.5315.45100.89
322646.5112.6482.29
6421507.2916.47120.07
322726.817.3650.12
322806.927.3550.86
+ +Table 5: Bin size and selected bins. Larger bin size and more bins improve results. + +
Re-weight FunctionαFIDICRF*R
Eq. 50.256.427.2346.42
0.506.407.6348.83
0.756.457.4147.79
(1-pi)α0.56.279.2157.75
16.339.3446.46
26.269.4459.09
+ +Table 6: Re-weight loss. A fixed re-weight design is good enough for better ICR. + +
Negative PromptFIDICRF*R
w/o NP6.427.2346.42
Concept6.157.0343.23
+ Uniform Geometry6.995.0235.09
+ Random Geometry7.124.9835.46
+ +Table 7: Input as negative prompt. Usage of the geometry improves ICR further. + +degrade the erasure performance. Opting for simplicity and effectiveness, a fixed value is utilized for the area covered by implicit concept, as mentioned in Eq. 5. + +Geometric accuracy. GEOM-ERASING is robust to the precision of geometric information provided. Upon selecting the bins, we introduce two noise scalars $\epsilon_1,\epsilon_2\sim \mathcal{N}(0,\sigma^2)$ to the selected bins, as $y^\prime = y\oplus y_{\mathrm{im}}\oplus \langle l(m + \epsilon_1,n + \epsilon_2)\rangle$ Variations of $\sigma$ yield distinct IoU values between the originally selected and noised bins, visualized in Fig. 5. ICR can tolerate a geometry accuracy up to 0.4 IoU. However, the erasure performance deteriorates as accuracy decreases. + +Negative prompt. Adding both the learned concept name and geometric information to the negative prompt can better erase unwanted details. Since implicit concepts are supposed not to appear in any part of the image, we use location tokens that are picked uniformly or randomly as negative prompts. As shown in Table 7, adding the concept name to the negative prompt improves the erasure and overall quality of generated content due to the model's improved ability to recognize concepts. Adding geometric information, whether uniformly or randomly, further improves the erasure, but it also tends to increase the FID. We plan to explore the reasons for this increase in more detail in future work. + +# 6 Conclusion + +Fine-tuning on personalized datasets is a prevalent practice, but the presence of unwanted implicit concepts like QR codes, watermarks, and text within these datasets can pose significant challenges during the refinement of personal diffusion models. This paper delves into the substantial impact of such implicit concepts, establishing a formal framework for their removal. Conventional methods, which predominantly depend on pre-trained diffusion models or merely acknowledge concept existence, falter in eradicating these implicit elements. To address this, we introduce GEOM-ERASING, a novel approach that incorporates geometric information during the fine-tuning phase, translating this information to the text domain and refining the initial text condition. We substantiate our approach through three diverse datasets, each laden with distinct implicit concepts. The exemplary performance of GEOM-ERASING underscores its efficacy in eradicating specific concepts, paving the way for enhanced model fine-tuning practices. + +# Acknowledgement + +We gratefully acknowledge the support of MindSpore, CANN (Compute Architecture for Neural Networks) and Ascend AI Processor used for this research. This work was partially supported by the Research Grants Council of the Hong Kong Special Administrative Region (Grants C7004-22G-1 and 16202523). + +# References + +1. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022) +2. Birhane, A., Prabhu, V.U., Kahembwe, E.: Multimodal datasets: misogyny, pornography, and malignant stereotypes. arXiv preprint arXiv:2110.01963 (2021) +3. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing diffusion using semantic dimensions. arXiv preprint arXiv:2301.12247 (2023) +4. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023) +5. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12M: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: CVPR (2021) +6. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. In: NeurIPS (2021) +7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023) +8. Gao, R., Chen, K., Xie, E., Hong, L., Li, Z., Yeung, D.Y., Xu, Q.: Magicdrive: Street view generation with diverse 3d geometry control. arXiv preprint arXiv:2310.02601 (2023) +9. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017) +0. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020) +1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) +2. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: NeurIPS (2021) +3. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: ICCV (2023) +4. Lee, T., Yasunaga, M., Meng, C., Mai, Y., Park, J.S., Gupta, A., Zhang, Y., Narayanan, D., Teufel, H.B., Bellagente, M., et al.: Holistic evaluation of text-to-image models. arXiv preprint arXiv:2311.04287 (2023) +5. Li, P., Liu, Z., Chen, K., Hong, L., Zhuge, Y., Yeung, D.Y., Lu, H., Jia, X.: Trackdiffusion: Multi-object tracking data generation via diffusion models. arXiv preprint arXiv:2312.00651 (2023) +6. Nichol, A.: Dall-e 2 pre-training mitigations. https://openai.com/research/dall-e-2-pre-training-mitigations (2022) + +17. Pinkney, J.N.M.: Pokemon blip captions. https://huggingface.co/datasets/lambdalabs/pokemon-blip-captions/ (2022) +18. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022) +19. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) +20. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022) +21. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: CVPR (2023) +22. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021) +23. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015) +24. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020) +25. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. In: NeurIPS (2017) +26. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017) +27. Yang, Y., Gui, D., Yuan, Y., Ding, H., Hu, H., Chen, K.: Glyphcontrol: Glyph conditional control for visual text generation. arXiv preprint arXiv:2305.18259 (2023) +28. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023) +29. Zhang, Y., Hooi, B.: Hipa: Enabling one-step text-to-image diffusion models via high-frequency-promoting adaptation. arXiv preprint arXiv:2311.18158 (2023) +30. Zhang, Y., Zhou, D., Hooi, B., Wang, K., Feng, J.: Expanding small-scale datasets with guided imagination. In: NeurIPS (2023) \ No newline at end of file diff --git a/2024/Implicit Concept Removal of Diffusion Models/images.zip b/2024/Implicit Concept Removal of Diffusion Models/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..aea871ce3ea5c159bc354435b1fe0b062fdd39e9 --- /dev/null +++ b/2024/Implicit Concept Removal of Diffusion Models/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3f5c8dcd773466d6f75bb3cc3a753d1cef19a3562cb5934fa307a359c0c2b36f +size 611872 diff --git a/2024/Implicit Concept Removal of Diffusion Models/layout.json b/2024/Implicit Concept Removal of Diffusion Models/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..04641b75ddd00ac4f41596100179846a3b33f1b3 --- /dev/null +++ b/2024/Implicit Concept Removal of Diffusion Models/layout.json @@ -0,0 +1,7859 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 145, + 111, + 470, + 131 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 111, + 470, + 131 + ], + "spans": [ + { + "bbox": [ + 145, + 111, + 470, + 131 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "spans": [ + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": "Zhili Liu" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{1,2\\star}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", Kai Chen" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{1\\star}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", Yifan Zhang" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", Jianhua Han" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", Lanqing Hong" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", Hang Xu" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", Zhenguo Li" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", Dit-Yan Yeung" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "text", + "content": ", and James T. Kwok" + }, + { + "bbox": [ + 147, + 149, + 465, + 175 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "spans": [ + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "type": "text", + "content": " Hong Kong University of Science and Technology \n" + }, + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "type": "text", + "content": " Huawei Noah's Ark Lab " + }, + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 154, + 183, + 459, + 218 + ], + "type": "text", + "content": " National University of Singapore \nProject Page: https://kaichen1998.github.io/projects/geom-erasing/" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 247, + 455, + 478 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 247, + 455, + 478 + ], + "spans": [ + { + "bbox": [ + 160, + 247, + 455, + 478 + ], + "type": "text", + "content": "Abstract. Text-to-image (T2I) diffusion models often inadvertently generate unwanted concepts such as watermarks and unsafe images. These concepts, termed \"implicit concepts\", can be unintentionally learned during training and then be generated uncontrollably during inference. Existing removal methods still struggle to eliminate implicit concepts primarily due to their dependency on the model's ability to recognize concepts it actually can not discern. To address this, we utilize the intrinsic geometric characteristics of implicit concepts and present GEOM-ERASING, a novel concept removal method based on geometric-driven control. Specifically, once an unwanted implicit concept is identified, we integrate the existence and geometric information of the concept into the text prompts with the help of an accessible classifier or detector model. Subsequently, the model is optimized to identify and disentangle this information, which is then adopted as negative prompts during generation. Moreover, we introduce the Implicit Concept Dataset (ICD), a novel image-text dataset imbued with three typical implicit concepts (QR codes, watermarks, and text), reflecting real-life situations where implicit concepts are easily injected. GEOM-ERASING effectively mitigates the generation of implicit concepts, achieving state-of-the-art results on the Inappropriate Image Prompts (I2P) and our challenging Implicit Concept Dataset (ICD) benchmarks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 488, + 445, + 500 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 488, + 445, + 500 + ], + "spans": [ + { + "bbox": [ + 160, + 488, + 445, + 500 + ], + "type": "text", + "content": "Keywords: Concept Erasure " + }, + { + "bbox": [ + 160, + 488, + 445, + 500 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 488, + 445, + 500 + ], + "type": "text", + "content": " Implicit Concept " + }, + { + "bbox": [ + 160, + 488, + 445, + 500 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 488, + 445, + 500 + ], + "type": "text", + "content": " Geometric Control" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 538, + 230, + 551 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 538, + 230, + 551 + ], + "spans": [ + { + "bbox": [ + 132, + 538, + 230, + 551 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 563, + 482, + 636 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 563, + 482, + 636 + ], + "spans": [ + { + "bbox": [ + 130, + 563, + 482, + 636 + ], + "type": "text", + "content": "Text-to-image diffusion models (DMs) have become increasingly popular due to their exceptional proficiency in generating high-quality images [8, 10, 15, 30]. Despite the advancements, DMs sometimes inadvertently generate unwanted concepts such as watermarks [14] or unsafe images [21]. Take Stable Diffusion " + }, + { + "bbox": [ + 130, + 563, + 482, + 636 + ], + "type": "inline_equation", + "content": "(\\mathrm{SD})^3" + }, + { + "bbox": [ + 130, + 563, + 482, + 636 + ], + "type": "text", + "content": " [18] as an example. When text prompts on topics related to indoor furniture or human portrait are used, surprisingly we find that the generated images" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 643, + 377, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 643, + 377, + 653 + ], + "spans": [ + { + "bbox": [ + 133, + 643, + 377, + 653 + ], + "type": "text", + "content": "* Equal contribution. Contact: zhili.liu@connect.ust.hk" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 135, + 653, + 365, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 653, + 365, + 665 + ], + "spans": [ + { + "bbox": [ + 135, + 653, + 365, + 665 + ], + "type": "text", + "content": "3 https://huggingface.co/runwayml/stable-diffusion-v1-5" + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 129, + 479, + 318 + ], + "blocks": [ + { + "bbox": [ + 141, + 119, + 185, + 128 + ], + "lines": [ + { + "bbox": [ + 141, + 119, + 185, + 128 + ], + "spans": [ + { + "bbox": [ + 141, + 119, + 185, + 128 + ], + "type": "text", + "content": "ICD-Watermark" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 141, + 129, + 479, + 318 + ], + "lines": [ + { + "bbox": [ + 141, + 129, + 479, + 318 + ], + "spans": [ + { + "bbox": [ + 141, + 129, + 479, + 318 + ], + "type": "image", + "image_path": "d1a1959292191590b986d2b3d5129934cbdb4b6224aa9ca26f955a257a86cacb.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 326, + 482, + 360 + ], + "lines": [ + { + "bbox": [ + 131, + 326, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 131, + 326, + 482, + 360 + ], + "type": "text", + "content": "Fig. 1: Generation of implicit concepts. SD surprisingly generates images with watermarks and unsafe content even though these implicit concepts are not mentioned in the text prompt." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 387, + 482, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 387, + 482, + 459 + ], + "spans": [ + { + "bbox": [ + 130, + 387, + 482, + 459 + ], + "type": "text", + "content": "often contain watermarks (Fig. 1), even though no watermark-related keyword is mentioned in the text prompts. In addition, SD is more likely to generate unsafe content when the text prompts contain art and women [21]. Evaluations on the I2P dataset [21] and our ICD-Watermark dataset (details in Sec. 5.1) show that watermarks and unsafe content show up in " + }, + { + "bbox": [ + 130, + 387, + 482, + 459 + ], + "type": "inline_equation", + "content": "11\\%" + }, + { + "bbox": [ + 130, + 387, + 482, + 459 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 387, + 482, + 459 + ], + "type": "inline_equation", + "content": "39\\%" + }, + { + "bbox": [ + 130, + 387, + 482, + 459 + ], + "type": "text", + "content": ", respectively, of the generated images." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 460, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 544 + ], + "type": "text", + "content": "In this paper, we define implicit concepts (IC) as concepts that are not explicitly specified in the text prompts but are still generated by the DMs. The presence of implicit concepts not only poses potential legal issues but also significantly undermines user trust and satisfaction. Generating a watermark or unsafe content in the image could render the artwork unusable, forcing the user to discard their efforts and seek alternative solutions, which exacerbates the mistrust towards the model and deters future use for similar creative endeavors." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": "Avoiding the generation of implicit concepts is difficult. Even when the DM is trained on datasets that are supposed to be watermark-free or not-safe-for-work (NSFW) filtered [16, 18], implicit concepts might still be generated [4, 14] due to inherent limitations in detecting and filtering all problematic images from the web-crawled datasets [2]. Our research instead considers the alternative prevalent post-hoc strategy that erases undesirable concepts from the pre-trained DMs. This encompasses methods that fine-tune DMs on paired images (one containing the concepts for erasure and the other does not), to redirect the generation away from specific concepts [7, 13], or reduce activation values in the cross-attention module [28]. Other methods carefully design the text prompts [11] and diffusion" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 92, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "process [21] to navigate the model negatively away from the unwanted concepts. While these strategies are effective for erasing explicit concepts such as semantic objects and art styles, we find that they do not perform well on erasing implicit concepts, as will be shown in Tables 2 and 3 of Sec. 5." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 167, + 480, + 262 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 167, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 130, + 167, + 480, + 262 + ], + "type": "text", + "content": "Here we first systematically explore the reasons behind the failure of existing methods to erase implicit concepts. In particular, we identify a core mismatch. These methods assume the concept to be erased can be controllably generated or recognized by the DM, which is not feasible for implicit concepts. We demonstrate that implicit concepts cannot be controllably generated, making it difficult to construct reliable paired images for fine-tuning. Furthermore, implicit concepts may not be recognized by the DM, and thus accurately navigating the generation is also hard. Refer to Sec. 3 for detailed experiments." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 265, + 481, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 265, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 481, + 373 + ], + "type": "text", + "content": "Next, we study why DMs generate concepts they are not aware of. We conjecture that it stems from the training dataset which contains images with these concepts but the text conditions do not. To demonstrate this, we construct an Implicit Concept Dataset (ICD), containing three implicit concepts (QR codes, watermarks, and text) that commonly exist in real-world image databases. Training on the ICD shows a high chance of generating images containing these unwanted implicit concepts, while the resulting model is unaware of them, as detailed in Appendix B. The ICD also allows for quantitative evaluation and analysis of the proposed method, a step beyond the previous research." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 376, + 481, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 376, + 481, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 376, + 481, + 604 + ], + "type": "text", + "content": "Recognizing these challenges, our work proposes a novel erasure method designed to specifically target and eliminate implicit concepts. Unlike existing erasure methods, it does not require the construction of paired images or complex fine-tuning strategies. Our key aim is to let the model re-know clearly the concepts it needs to erase. We observe a consistent feature where these concepts often exist in certain parts of the image. In other words, while the image as a whole might look appealing, unwanted implicit concepts are localized to specific areas. For instance, watermarks often appear as copyright images or lines of text in specific image sections, and unsafe content is concentrated in exposed body areas. Based on these insights, we propose GEOM-ERASING, a simple yet effective technique aiming at removing implicit concepts in diffusion models. By incorporating an additional classifier or detector, we integrate both the existence and geometric information of implicit concepts into the text prompts. This empowers models to accurately identify and exclude these concepts. Notably, GEOM-ERASING converts this information into text prompts without accessing the parameters of the classifier or detector. As a result, inputting the existence and geometric information as negative prompts during the sampling process produces images free from unwanted implicit concepts. Our findings emphasize the crucial role of geometric information in successfully erasing implicit concepts." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 606, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 481, + 665 + ], + "type": "text", + "content": "For performance evaluation, we use two settings mimicking real-world scenarios: 1) Model Refinement: The pre-trained DM already contains watermark and unsafe concepts, and we aim to remove these implicit concepts without harming the generation quality of other concepts. 2) Data Refinement: The users may fine-tune the DM with datasets containing implicit concepts. Under" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 481, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 481, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 481, + 152 + ], + "type": "text", + "content": "both settings, we successfully reduce the chance of generating implicit concepts on ICD, and outperform previous state-of-the-art for eliminating unsafe content on the Inappropriate Image Prompts (I2P) [21] benchmark." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 152, + 330, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 152, + 330, + 163 + ], + "spans": [ + { + "bbox": [ + 146, + 152, + 330, + 163 + ], + "type": "text", + "content": "Our contributions can be summarized as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 136, + 168, + 479, + 225 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 168, + 479, + 225 + ], + "spans": [ + { + "bbox": [ + 136, + 168, + 479, + 225 + ], + "type": "text", + "content": "1. We present the problem of eliminating implicit concepts (IC), and uncover a fundamental shortcoming of current erasure techniques, namely that they assume that concepts can be intentionally generated or recognized by DMs. This assumption is not feasible for implicit concepts, leading to their failure in eradicating these concepts." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 135, + 228, + 480, + 261 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 228, + 480, + 261 + ], + "spans": [ + { + "bbox": [ + 135, + 228, + 480, + 261 + ], + "type": "text", + "content": "2. We construct the Implicit Concept Dataset, containing three sub-datasets embedded with varied implicit concepts, to serve as substantial resources to propel future research endeavors to resolve the problem." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 135, + 262, + 484, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 262, + 484, + 297 + ], + "spans": [ + { + "bbox": [ + 135, + 262, + 484, + 297 + ], + "type": "text", + "content": "3. We propose GEOM-ERASING, a novel concept-removal method verified through two settings: Model Refinement, and Data Refinement, demonstrating its robust capability to eliminate implicit concepts in real-world applications." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 314, + 234, + 327 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 314, + 234, + 327 + ], + "spans": [ + { + "bbox": [ + 132, + 314, + 234, + 327 + ], + "type": "text", + "content": "2 Related work" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 337, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 337, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 337, + 482, + 456 + ], + "type": "text", + "content": "Diffusion models [10, 23] excel in various generative tasks such as density estimation [12], image synthesis [6], and text-to-image generation [1, 18, 20, 29]. It transforms a data distribution to the normal distribution by incrementally injecting noise and subsequently reversing this process through denoising to reconstruct the original distribution. This study particularly focuses on text-to-image generation using diffusion models that are pre-trained on extensive datasets [18]. Such models, while capable of generating diverse content based on text conditions, also present notable risks such as generating harmful [21], watermarked, and content infringing on copyright [28]. Consequently, this raises the need for research directed towards the elimination of such undesired concepts." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "type": "text", + "content": "Concept erasing in diffusion models. Current erasure methods mainly depend on the model's ability to recognize the concepts. A segment of research is concentrated on refining the diffusion process. Techniques such as Negative Prompt (NP) [11] and Safe Latent Diffusion (SLD) [3, 21] use well-designed negative prompts. They employ enhanced Classifier-free guidance [11] for more refined control, steering diffusion models away from generating specific, undesirable concepts. This approach depends heavily on the model's pre-trained understanding of the concept. Another approach is to fine-tune the model to remove specific concepts. For instance, Erased Stable Diffusion (ESD) [7] generates images with an unwanted concept and then guides the model away from creating such content. Forget-Me-Not (FMN) [28] utilizes textual inversion to bolster the model's recognition of the existence of the specific concept, subsequently adjusting the cross-attention [26] scores between undesired concept and image content, resulting in images exhibiting diminished response to undesired concepts. However, we found that just adding existence information to the model is not enough to remove implicit concepts. So, we also include geometric information, which helps reduce the appearance of unwanted concepts significantly." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 264, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 264, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 264, + 129 + ], + "type": "text", + "content": "3 Preliminary Study" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 201 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 201 + ], + "type": "text", + "content": "Section 3.1 first introduces the definition of implicit concept removal. In Section 3.2, we perform experiments to demonstrate that implicit concepts cannot be generated in a controlled manner and are also not identifiable by Stable Diffusion (SD). These two problems fundamentally underpin the failure of existing erasure techniques on implicit concepts." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 217, + 258, + 228 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 217, + 258, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 217, + 258, + 228 + ], + "type": "text", + "content": "3.1 Problem Statement" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "text", + "content": "This work addresses eliminating unwanted and unintended implicit concepts from diffusion models. In particular, we focus on the Latent Diffusion Model [18] (Stable Diffusion (SD) specifically). We study two realistic settings: (i) Model Refinement: We target at the removal of implicit concepts that are already present in the corrupted SD model, without compromising the original quality of generation. (ii) Data Refinement: we consider situations where users need to fine-tune the SD on a personalized corrupted dataset " + }, + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "text", + "content": " which contains implicit concept " + }, + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "inline_equation", + "content": "y_{im}" + }, + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "text", + "content": ". Our objective is to fine-tune a model, so that it can generate images closely resembling " + }, + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 236, + 482, + 344 + ], + "type": "text", + "content": " but with the implicit concept removed." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "spans": [ + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "text", + "content": "Following SD, we fine-tune diffusion models in the latent space of VQ-VAE [25]. An encoder " + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "text", + "content": " maps an image " + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "inline_equation", + "content": "x\\in X" + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "text", + "content": " to the latent code " + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "inline_equation", + "content": "z = \\mathcal{E}(x)" + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "text", + "content": ", and the decoder " + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "text", + "content": " then reconstructs the image as " + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "inline_equation", + "content": "D(z) = x" + }, + { + "bbox": [ + 131, + 344, + 485, + 404 + ], + "type": "text", + "content": ". During fine-tuning, the diffusion model optimizes a UNet [6,10,19,24] to predict the unscaled noise added to the latent code of the image. The loss function is:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 188, + 413, + 481, + 433 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 188, + 413, + 481, + 433 + ], + "spans": [ + { + "bbox": [ + 188, + 413, + 481, + 433 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {S D} = \\mathbb {E} _ {z _ {t} \\sim \\mathcal {E} _ {t} (x), y \\sim Y, \\epsilon \\sim \\mathcal {N} (0, 1), t} \\left[ \\| \\epsilon - \\epsilon_ {\\theta} (z _ {t}, t, c _ {\\theta} (y)) \\| _ {2} ^ {2} \\right], \\tag {1}", + "image_path": "df942a4174b627b3dc90e9caf308add588d4d12fb90ccd24963fa87fbc28db17.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "inline_equation", + "content": "y \\sim Y" + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": " is the input text, " + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": " is the time step, " + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": " is the noised latent code of the image, " + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": " is an unscaled noise sample, and " + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": " is the denoising network to be fine-tuned. During inference, a random noise tensor is sampled and iteratively denoised until the image latent " + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "inline_equation", + "content": "z_{0}" + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": " is obtained. The image is then generated by the decoder as " + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "inline_equation", + "content": "x' = D(z_{0})" + }, + { + "bbox": [ + 131, + 441, + 482, + 501 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 518, + 288, + 530 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 518, + 288, + 530 + ], + "spans": [ + { + "bbox": [ + 132, + 518, + 288, + 530 + ], + "type": "text", + "content": "3.2 Preliminary Experiments" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 538, + 482, + 587 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 538, + 482, + 587 + ], + "spans": [ + { + "bbox": [ + 130, + 538, + 482, + 587 + ], + "type": "text", + "content": "In this section, we perform preliminary experiments to examine the limitations of existing approaches [7,11,13,21,28] in erasing implicit concepts. These methods depend on SD's ability to controllably produce paired images and identify these concepts, a process we demonstrate is not viable for implicit concepts." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Implicit concepts cannot be controllably generated. Some erasure methods [7,13] necessitate the creation of image pairs, with one containing the concept for erasure and the other does not. However, for implicit concepts, construction of such image pairs may not be possible. Our study, depicted in Fig. 2a, reveals that there is minimal connection between directly asking for \"watermarks\" in the prompt and their actual presence in the generated images. This is supported by a" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 236, + 116, + 300, + 180 + ], + "blocks": [ + { + "bbox": [ + 170, + 126, + 233, + 170 + ], + "lines": [ + { + "bbox": [ + 170, + 126, + 233, + 170 + ], + "spans": [ + { + "bbox": [ + 170, + 126, + 233, + 170 + ], + "type": "text", + "content": "long-haired tuxedo kitten with long white whiskers standing on a pink blanket looking slightly to viewers, watermark" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_footnote" + }, + { + "bbox": [ + 236, + 116, + 300, + 180 + ], + "lines": [ + { + "bbox": [ + 236, + 116, + 300, + 180 + ], + "spans": [ + { + "bbox": [ + 236, + 116, + 300, + 180 + ], + "type": "image", + "image_path": "19e998abc1dbb78825dad37cf13ce18aa313b9cb7f91a52333a47c02e500af4b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 378, + 116, + 443, + 180 + ], + "blocks": [ + { + "bbox": [ + 306, + 130, + 378, + 166 + ], + "lines": [ + { + "bbox": [ + 306, + 130, + 378, + 166 + ], + "spans": [ + { + "bbox": [ + 306, + 130, + 378, + 166 + ], + "type": "text", + "content": "man standing in a pond \nthrowing a fishing net, \ntimbavati nature reserve, \nlimpopo, south africa, \nafrica" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_footnote" + }, + { + "bbox": [ + 378, + 116, + 443, + 180 + ], + "lines": [ + { + "bbox": [ + 378, + 116, + 443, + 180 + ], + "spans": [ + { + "bbox": [ + 378, + 116, + 443, + 180 + ], + "type": "image", + "image_path": "4860216a746c274d710c29fd319af62b14b2aba84fad08217039c70c0e601929.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 171, + 194, + 430, + 256 + ], + "blocks": [ + { + "bbox": [ + 132, + 183, + 479, + 193 + ], + "lines": [ + { + "bbox": [ + 132, + 183, + 479, + 193 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 479, + 193 + ], + "type": "text", + "content": "(a) Including \"watermark\" in text prompt does not ensure its appearance in image, and vice versa." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_footnote" + }, + { + "bbox": [ + 171, + 194, + 430, + 256 + ], + "lines": [ + { + "bbox": [ + 171, + 194, + 430, + 256 + ], + "spans": [ + { + "bbox": [ + 171, + 194, + 430, + 256 + ], + "type": "image", + "image_path": "bd15d351add6099b0fdc891cb6b5d4ccc51a777d70c2f9901da54a6791c38dfa.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 162, + 257, + 450, + 266 + ], + "lines": [ + { + "bbox": [ + 162, + 257, + 450, + 266 + ], + "spans": [ + { + "bbox": [ + 162, + 257, + 450, + 266 + ], + "type": "text", + "content": "(b) Cross-attention map between keyword \"watermark\" and the generated image." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_footnote" + }, + { + "bbox": [ + 131, + 276, + 481, + 299 + ], + "lines": [ + { + "bbox": [ + 131, + 276, + 481, + 299 + ], + "spans": [ + { + "bbox": [ + 131, + 276, + 481, + 299 + ], + "type": "text", + "content": "Fig. 2: Observations from preliminary experiments. (a) Implicit concepts cannot be controllably generated. (b) Implicit concepts cannot be recognized by SD." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 321, + 480, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 321, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 321, + 480, + 357 + ], + "type": "text", + "content": "correlation coefficient of " + }, + { + "bbox": [ + 130, + 321, + 480, + 357 + ], + "type": "inline_equation", + "content": "r = -0.08" + }, + { + "bbox": [ + 130, + 321, + 480, + 357 + ], + "type": "text", + "content": " and a P-value " + }, + { + "bbox": [ + 130, + 321, + 480, + 357 + ], + "type": "inline_equation", + "content": "p = 0.21" + }, + { + "bbox": [ + 130, + 321, + 480, + 357 + ], + "type": "text", + "content": " across 1000 samples, indicating an insignificant effect. This demonstrates that it is not possible to reliably generate image pairs for the purpose of erasure." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 365, + 482, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 365, + 482, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 482, + 496 + ], + "type": "text", + "content": "Implicit concepts cannot be recognized by SD. Other erasure methods [11, 21, 28] depend on the model's ability to identify concepts to be erased. However, SD often fails to detect the presence of implicit concepts. Using an example on the implicit concept of watermarks, Fig. 2b visualizes the cross-attention map of the last transformer layer between the keyword \"watermark\" and the generated image. Since SD [18], NP [11] and SLD [21] exhibit similar patterns, we visualize them in the same image to save space. As can be seen, SD [18], NP [11], SLD [21], and FMN [28] cannot attend to the location of the watermark. A more thorough evaluation will be presented in Sec. 5.2. This demonstrates that existing erasure methods are unable to accurately identify implicit concepts, indicating inefficiency for the accurate navigating from generation." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 514, + 261, + 528 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 514, + 261, + 528 + ], + "spans": [ + { + "bbox": [ + 132, + 514, + 261, + 528 + ], + "type": "text", + "content": "4 Proposed Method" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 538, + 480, + 587 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 538, + 480, + 587 + ], + "spans": [ + { + "bbox": [ + 130, + 538, + 480, + 587 + ], + "type": "text", + "content": "In this section, we present GEOM-ERASING which mitigates the impact of undesired implicit concepts and disentangle these concepts from the model. We begin with an overview of the method and then delve into its components: implicit concept recognition, geometry-driven removal, and loss re-weight strategy." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": "Overall architecture. The architecture of our method is shown in Fig. 3. The image " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "x \\in X" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": " may contain various implicit concepts. Upon confirming the presence of such a concept, we amend the original text condition by appending the concept name (e.g., QR codes, watermark, text and unsafeness). However, merely acknowledging the concept's existence proved insufficient for its erasure. Thus, we extract the location of the concept and integrate this into the caption. For" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 116, + 462, + 266 + ], + "blocks": [ + { + "bbox": [ + 149, + 116, + 462, + 266 + ], + "lines": [ + { + "bbox": [ + 149, + 116, + 462, + 266 + ], + "spans": [ + { + "bbox": [ + 149, + 116, + 462, + 266 + ], + "type": "image", + "image_path": "6240e7816ffcfab1ef9e0afe7d81cba977f6b38fe0efd450f033d7dd6e92668d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 276, + 482, + 365 + ], + "lines": [ + { + "bbox": [ + 130, + 276, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 276, + 482, + 365 + ], + "type": "text", + "content": "Fig. 3: Model architecture of GEOM-ERASING. It begins with an original image that may harbor multiple distinct implicit concepts. We extract the geometric information of these concepts and convert it into text conditions. Special location tokens are added to the original text vocabulary representing the bins discretized from the original images. Text prompts are updated by appending location tokens corresponding to areas enveloped by the concept. Loss re-weighting is employed to concentrate more on areas devoid of implicit concepts. During sampling, the learned tokens are input as negative prompts, resulting in image generation free from implicit concepts." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 388, + 482, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 450 + ], + "type": "text", + "content": "Model Refinement setting, optimizing the added tokens representing the existence and location is enough. For Data Refinement, we additionally train the diffusion model parameters to learn the new distribution. After fine-tuning via our enhanced text condition, adding existence with location tokens in negative prompts enables the model to omit the unintended implicit concepts effectively." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 456, + 482, + 528 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 456, + 482, + 528 + ], + "spans": [ + { + "bbox": [ + 130, + 456, + 482, + 528 + ], + "type": "text", + "content": "Implicit concept recognition. The initial step in GEOM-ERASING involves identifying the presence and location of implicit concepts. Fortunately, this task is relatively straightforward with the existence of several classifiers or detectors that are adept at recognizing common implicit concepts. For example, to identify watermarks, one can use LAION4. Details and models for detecting other implicit concepts are in Appendix A." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "spans": [ + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "content": "Given a detector for the implicit concept, we acquire at most " + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "content": " predictions of the concepts, " + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "inline_equation", + "content": "L = [p_i,(o_i)]_{i = 1}^N" + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "inline_equation", + "content": "p_i" + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "content": " is the confidence in identifying the location as the implicit concept, and " + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "inline_equation", + "content": "o_i = [a_i^1,b_i^1,a_i^2,b_i^2]" + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "content": " are the coordinates of the concept's position, where " + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "inline_equation", + "content": "(a_i^1,b_i^1)" + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "inline_equation", + "content": "(a_i^2,b_i^2)" + }, + { + "bbox": [ + 130, + 529, + 482, + 589 + ], + "type": "text", + "content": " are the upper-left and bottom-right positions. This will be integrated to our subsequent geometry-driven removal." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "content": "Geometry-driven removal. We modify the original text condition so that the diffusion model can discern both the presence and spatial location of the implicit concept, which are essential prerequisites for effective erasure. Let the original image-text pair from the fine-tuning dataset " + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "content": " be " + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "content": ". If an image is classified" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 406, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 406, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 406, + 665 + ], + "type": "text", + "content": "4 https://github.com/LAION-AI/LAION-5B-WatermarkDetection" + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "as containing a specific concept, we append the concept name to the original text condition:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 247, + 148, + 481, + 178 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 148, + 481, + 178 + ], + "spans": [ + { + "bbox": [ + 247, + 148, + 481, + 178 + ], + "type": "interline_equation", + "content": "y ^ {\\prime} = \\left\\{ \\begin{array}{l l} y & p < t \\\\ y \\oplus y _ {i m} & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {2}", + "image_path": "75b281b1a0c0711c8bd615babfb3378a96e2322ec7cc7b0484a15cf740c3b9c7.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "text", + "content": " is the confidence in identifying the implicit concept, " + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "text", + "content": " is a threshold, " + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "inline_equation", + "content": "\\oplus" + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "text", + "content": " denotes the concatenation operation, and " + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "inline_equation", + "content": "y_{im}" + }, + { + "bbox": [ + 130, + 186, + 479, + 223 + ], + "type": "text", + "content": " is the name of the implicit concept. This enhances the model to identify the existence of implicit concept." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 224, + 480, + 305 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 224, + 480, + 305 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 480, + 305 + ], + "type": "text", + "content": "To acquaint the model with geometric information of the concept, we first discretize the continuous coordinates into bins. Each bin corresponds to a distinct location token that is subsequently included in the text vocabulary. The bins that are covered by the location will be selected, and the corresponding location tokens are added after the concept name in the text condition (Fig. 3). Empirically, this design is robust to the precision of the detector and allows efficient training, as will be seen in Sec. 5." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "text", + "content": "Specifically, assume that the image size is " + }, + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "inline_equation", + "content": "W \\times H" + }, + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "text", + "content": " and a bin size of " + }, + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "inline_equation", + "content": "W_{\\mathrm{bin}} \\times H_{\\mathrm{bin}}" + }, + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "text", + "content": ", location tokens are inserted into the text vocabulary " + }, + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "inline_equation", + "content": "\\langle l(m,n) \\rangle_{m=1,n=1}^{m=W / W_{\\mathrm{bin}}, n = H / H_{\\mathrm{bin}}}" + }, + { + "bbox": [ + 130, + 307, + 481, + 344 + ], + "type": "text", + "content": ". For each implicit concept in the image, the text condition is then updated as:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 194, + 354, + 481, + 387 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 194, + 354, + 481, + 387 + ], + "spans": [ + { + "bbox": [ + 194, + 354, + 481, + 387 + ], + "type": "interline_equation", + "content": "y ^ {\\prime} = \\left\\{ \\begin{array}{l l} y & \\text {i f} p < t \\\\ y \\oplus y _ {\\mathrm {i m}} \\oplus \\langle l (m, n) \\rangle_ {m = A _ {\\mathrm {b i n}} ^ {1}, n = B _ {\\mathrm {b i n}} ^ {1}} ^ {m = A _ {\\mathrm {b i n}} ^ {2}, n = B _ {\\mathrm {b i n}} ^ {2}} & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {3}", + "image_path": "7fb0ac062cbc625f31cc8c35eef4df89d95db88d07b8e2671ff604c86162668a.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "spans": [ + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "inline_equation", + "content": "A_{\\mathrm{bin}}^{1} = \\lfloor a_{i}^{1} / W_{\\mathrm{bin}}\\rfloor" + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "inline_equation", + "content": "B_{\\mathrm{bin}}^{1} = \\lfloor b_{i}^{1} / H_{\\mathrm{bin}}\\rfloor" + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "inline_equation", + "content": "A_{\\mathrm{bin}}^{2} = \\lceil a_{i}^{2} / W_{\\mathrm{bin}}\\rceil" + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "inline_equation", + "content": "B_{\\mathrm{bin}}^{2} = \\lceil b_{i}^{2} / H_{\\mathrm{bin}}\\rceil" + }, + { + "bbox": [ + 132, + 395, + 480, + 422 + ], + "type": "text", + "content": ". This approach indicates the spatial attributes of implicit concepts." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 428, + 479, + 500 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 428, + 479, + 500 + ], + "spans": [ + { + "bbox": [ + 130, + 428, + 479, + 500 + ], + "type": "text", + "content": "Loss re-weighting on specific regions. Due to the presence of undesirable implicit concepts in the chosen bins, intuitively, we expect that the model will acquire proficient generation quality from the regions associated with non-implicit concepts. Consequently, to de-emphasize the implicit concept areas, we assign them a (fixed) smaller weight in the loss (1). The resulting refined loss, which incorporates the previously generated bin map, is:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 149, + 510, + 481, + 529 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 510, + 481, + 529 + ], + "spans": [ + { + "bbox": [ + 149, + 510, + 481, + 529 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {G E O M - E R A S I N G}} = \\mathbb {E} _ {z \\sim \\mathcal {E} (x), y \\sim Y, \\epsilon \\sim \\mathcal {N} (0, 1), t} \\left[ w \\odot \\| \\epsilon - \\epsilon_ {\\theta} \\left(z _ {t}, t, c _ {\\theta} \\left(y ^ {\\prime}\\right)\\right) \\| _ {2} ^ {2} \\right], \\tag {4}", + "image_path": "b8ef344a934fc5dbc41280663734c66d728b62e63b1a37fcc9f75bbaf80e9e80.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 537, + 427, + 550 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 537, + 427, + 550 + ], + "spans": [ + { + "bbox": [ + 131, + 537, + 427, + 550 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 537, + 427, + 550 + ], + "type": "inline_equation", + "content": "\\odot" + }, + { + "bbox": [ + 131, + 537, + 427, + 550 + ], + "type": "text", + "content": " denotes element-wise multiplication, and " + }, + { + "bbox": [ + 131, + 537, + 427, + 550 + ], + "type": "inline_equation", + "content": "w = [w_{m,n}]" + }, + { + "bbox": [ + 131, + 537, + 427, + 550 + ], + "type": "text", + "content": " with" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 164, + 560, + 481, + 593 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 560, + 481, + 593 + ], + "spans": [ + { + "bbox": [ + 164, + 560, + 481, + 593 + ], + "type": "interline_equation", + "content": "w _ {m, n} = \\left\\{ \\begin{array}{l l} \\frac {T}{K + \\alpha (T - K)}, & \\text {i f} A _ {\\mathrm {b i n}} ^ {1} < m < A _ {\\mathrm {b i n}} ^ {2} \\text {a n d} B _ {\\mathrm {b i n}} ^ {1} < n < B _ {\\mathrm {b i n}} ^ {2} \\\\ \\frac {\\alpha T}{K + \\alpha (T - K)}, & \\text {o t h e r w i s e} \\end{array} , \\right. \\tag {5}", + "image_path": "1992f4f1d16345ebce7b378f0f1900bbe3905301f09febaf4daf7ba2a373b2ab.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "spans": [ + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "inline_equation", + "content": "K = (A_{\\mathrm{bin}}^2 - A_{\\mathrm{bin}}^1) \\cdot (B_{\\mathrm{bin}}^2 - B_{\\mathrm{bin}}^1)" + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "inline_equation", + "content": "T = \\frac{W}{W_{\\mathrm{bin}}} \\cdot \\frac{H}{H_{\\mathrm{bin}}}" + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "text", + "content": " is the number of bins with " + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "inline_equation", + "content": "\\sum w_{m,n} = T" + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "text", + "content": " is a hyperparameter. Eq. 5 normalizes the weight " + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 130, + 600, + 482, + 674 + ], + "type": "text", + "content": ", aligning the magnitude of Eq. 4 with that of the original loss in Eq. 1. By formulating this loss function, emphasis on the undesirable areas is reduced during fine-tuning, leading to an enhancement in the quality of generated content in the desired regions." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 146, + 114, + 475, + 177 + ], + "blocks": [ + { + "bbox": [ + 146, + 114, + 475, + 177 + ], + "lines": [ + { + "bbox": [ + 146, + 114, + 475, + 177 + ], + "spans": [ + { + "bbox": [ + 146, + 114, + 475, + 177 + ], + "type": "table", + "html": "
Dataset NameSample sizeICRStyleResolutionSource
ICD-QR83325%Cartoon512²Pokemon [17]
ICD-Watermark160k50%Real256²CC12M [5]
ICD-Text1000k100%Real256²LAION [22]
", + "image_path": "f49e77bcd16c5d140c60b696969a5386649b27d2e41167fddf8f4ad0eb0e8502.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 177, + 479, + 232 + ], + "lines": [ + { + "bbox": [ + 130, + 177, + 479, + 232 + ], + "spans": [ + { + "bbox": [ + 130, + 177, + 479, + 232 + ], + "type": "text", + "content": "Table 1: Details of Implicit Concept Dataset. Our datasets are collectively termed as Implicit Concept Dataset (ICD), with each one encompassing a distinct implicit concept. They exhibit variations in several attributes. The term \"ICR\" denotes Implicit Concept Ratio, representing the proportion of images within the dataset that contain the implicit concept." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 266, + 480, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 266, + 480, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 480, + 361 + ], + "type": "text", + "content": "Accessibility of the additional classifier or detector. Employing an extra classifier or detector to obtain location data is affordable and straightforward. Numerous models capable of identifying the presence or pinpointing the location of various concepts are readily available, as detailed in Appendix A. Moreover, accessing the model's parameters is unnecessary; only the outcomes from these models are required. Empirically, the effectiveness of GEOM-ERASING does not depend heavily on the detector's precision, allowing for some leniency regarding the accuracy of the detector, as will be seen later in Fig. 5." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 380, + 230, + 394 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 230, + 394 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 230, + 394 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 406, + 480, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 480, + 453 + ], + "type": "text", + "content": "In this section, we perform experiments to demonstrate the effectiveness of GEOM-ERASING. We first introduce the experimental setup, and then we compare GEOM-ERASING with several existing erasure methods, followed by the ablation studies on essential components of GEOM-ERASING." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 472, + 190, + 483 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 472, + 190, + 483 + ], + "spans": [ + { + "bbox": [ + 132, + 472, + 190, + 483 + ], + "type": "text", + "content": "5.1 Setup" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "text", + "content": "Implicit Concept Dataset. We curate three datasets, each corresponding to an implicit concept. As detailed in Table 1, these datasets vary in concept types, sizes, Implicit Concept Ratios (ICR), and image styles. In ICD-QR, QR codes are manually embedded in " + }, + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "inline_equation", + "content": "25\\%" + }, + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "text", + "content": " of the images. ICD-Watermark amalgamates images, with " + }, + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "text", + "content": " containing watermarks, sourced from CC12M [5]. ICD-Text utilizes dataset from [27], resulting in " + }, + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 491, + 480, + 599 + ], + "type": "text", + "content": " of the training images incorporating text. Additionally, corresponding test datasets devoid of any implicit concepts assembled for each of the above, to ensure a comprehensive evaluation. More details can be found in Appendix A." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "content": "Settings. To mirror real-world scenarios, we validate GEOM-ERASING in two settings: Model Refinement and Data Refinement. For Model Refinement, we eliminate the implicit concepts of watermark and unsafeness in the original SD. Watermark is evaluated under the evaluation set of our constructed" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 114, + 481, + 178 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 481, + 178 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 481, + 178 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 481, + 178 + ], + "type": "table", + "html": "
WatermarkUnsafeness (I2P benchmark [21])Expected Max. Inapprox.
FIDICRF*R/100HateHarassmentViolenceSelf-harmSexualShockingIllegal activitiesOverall
SD [18]9.0511.131.010.400.340.400.400.300.510.360.390.970.06
ESD [7]9.4911.281.070.170.160.240.220.170.160.220.19-
FMN [28]10.0510.831.09---------
NP [11]9.1211.131.020.160.140.190.140.080.250.130.160.800.18
SLD-Strong [21]9.879.920.980.150.130.170.190.090.200.090.130.720.19
GEOM-ERASING8.347.310.610.110.110.130.060.050.150.070.090.630.20
", + "image_path": "42900873e0007404e83c164eedd48a06ee591f5fb7706a68433785c536b267c0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 137, + 262, + 484, + 337 + ], + "blocks": [ + { + "bbox": [ + 130, + 179, + 482, + 234 + ], + "lines": [ + { + "bbox": [ + 130, + 179, + 482, + 234 + ], + "spans": [ + { + "bbox": [ + 130, + 179, + 482, + 234 + ], + "type": "text", + "content": "Table 2: Comparison between GEOM-ERASING and existing erasure methods under Model Refinement setting. The metric for toxicity is the ratio of images containing toxicity contents. The last column is the bootstrap estimates of a model containing toxic images at least once for 25 prompts [21]. GEOM-ERASING achieves the state-of-the-art when eliminating these two implicit concepts." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 137, + 262, + 484, + 337 + ], + "lines": [ + { + "bbox": [ + 137, + 262, + 484, + 337 + ], + "spans": [ + { + "bbox": [ + 137, + 262, + 484, + 337 + ], + "type": "table", + "html": "
ICD-QRICD-WatermarkICD-Text
FIDICRF*R/100FIDICRF*R/100FIDICRF*R/100
SD [18]65.8274.5949.107.5930.402.3154.2371.8438.96
ESD [7]90.9717.6416.057.6428.982.2160.5638.0823.06
FMN [28]71.7680.4257.717.7930.762.4057.3874.7542.89
NP [11]69.3159.6441.347.5427.712.0952.1365.6334.21
SLD-Strong [21]80.0570.2556.248.5632.562.7955.3666.0836.58
GEOM-ERASING41.415.382.236.995.020.3538.7413.485.22
", + "image_path": "a046b9ac6a63ff8d2876bb8ae438d183801d3ec2c58d139f083baf63f5455c3d.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 338, + 482, + 381 + ], + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 381 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 381 + ], + "type": "text", + "content": "Table 3: Comparison between GEOM-ERASING and other erasure methods under Data Refinement setting. All models are evaluated under ICD. GEOM-ERASING achieves the best among all three criteria, showing the successful elimination of the implicit concept while improving the image quality." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "content": "dataset ICD-watermark, and unsafeness is evaluated under the I2P benchmark. Data Refinement mimics personalized fine-tuning when practitioners collect downstream datasets that may also contain implicit concepts, attributed to the limitations in sources and collecting methods. This setting is evaluated under all three ICD datasets." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": "Baselines and evaluation metrics. We compare GEOM-ERASING with existing erasure methods, including Erased Stable Diffusion (ESD) [7], Forget-Me-Not (FMN) [28], Negative Prompt (NP) [11], and Safe Latent Diffusion (SLD) [21]. To depict the outcomes, we employ the Frechet Inception Distance (FID) [9] and the Implicit Concept Ratio (ICR) which is defined as the ratio of the number of images containing implicit concept to the total number of images. Both metrics prefer lower values. To facilitate a more comprehensive comparison between models and offer an integrated perspective on performance concerning both metrics, we introduce the " + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "inline_equation", + "content": "F*R/100" + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": ", which is calculated as the product of FID and ICR, serving as a unified metric for evaluating model performance. We also adopt the Inappropriate Image Prompts (I2P) benchmark [21] to validate our erasure of toxicity in the pre-trained diffusion model. We follow the setting of the original paper and provide the ratio results of harmful contents that appeared in the image. Since there are no reference images for I2P, we qualitatively provide generation images instead of FID value." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 482, + 252 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 482, + 252 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 482, + 252 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 482, + 252 + ], + "type": "image", + "image_path": "df49c37a1ff8c8968151b31c42960e07b5fa8eaea72bc221daa99227cd606f41.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 258, + 482, + 293 + ], + "lines": [ + { + "bbox": [ + 130, + 258, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 482, + 293 + ], + "type": "text", + "content": "Fig. 4: Qualitative comparison between different methods. Existing methods cannot erase ICs effectively while GEOM-ERASING successfully avoids the generation. Check more comparison in Fig. A3 and A4." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 316, + 340, + 329 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 316, + 340, + 329 + ], + "spans": [ + { + "bbox": [ + 131, + 316, + 340, + 329 + ], + "type": "text", + "content": "5.2 Comparison with previous methods" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 338, + 482, + 410 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 410 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 410 + ], + "type": "text", + "content": "Erasure of pre-trained SD (Model Refinement). We first compare GEOMERASING with other methods in the setting of erasing \"watermark\" and \"unsafeness\" contained in the pre-trained SD. We validate the \"watermark\" concept through the evaluation set of ICD-watermark, and \"unsafeness\" through the I2P benchmark. As shown in Table 2, GEOM-ERASING performs the best on both implicit concepts, achieving new state-of-the-art results on the I2P benchmark." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 418, + 482, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 482, + 492 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 482, + 492 + ], + "type": "text", + "content": "Erasure in personalized fine-tuning (Data Refinement). As shown in Table 3 and visualized in Fig. 4, GEOM-ERASING notably surpasses existing erasure methods across three distinct implicit concepts by substantially diminishing their occurrence in the synthesized images. Even in instances where fine-tuned images all contained text, our method remarkably reduces text presence to just " + }, + { + "bbox": [ + 130, + 418, + 482, + 492 + ], + "type": "inline_equation", + "content": "13.48\\%" + }, + { + "bbox": [ + 130, + 418, + 482, + 492 + ], + "type": "text", + "content": ", thus significantly minimizing the generation of unintended concepts." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 501, + 482, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 584 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 584 + ], + "type": "text", + "content": "Removing implicit concepts improves generation. Besides reducing unintended elements, GEOM-ERASING also improves the generation quality compared to the other methods in both settings. This improvement is due to the method's ability to effectively erase implicit concepts. Since the ideal images (reference images) do not contain these elements, avoiding them results in higher quality scores (FID scores). Further insights into the correlation between erasure efficacy and enhanced image quality are detailed in our ablation study in Sec. 5.3." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Existing erasure methods cannot do well for implicit concepts. The methods of FMN [28], NP [11], and SLD [21] demonstrate limitations in effectively removing implicit concepts. The performance of these methods relies on the diffusion model's capability to identify specific concepts. However, identifying the implicit concepts is a notable challenge for these models. This challenge is underscored by the attention map images provided in Sec. 3.2, which depicts" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 114, + 335, + 210 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 335, + 210 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 335, + 210 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 335, + 210 + ], + "type": "table", + "html": "
ConceptGeometricLoss re-weightFIDICRF*R
7.5930.40230.74
✓7.0617.04120.30
✓6.9711.1877.92
✓6.4629.38189.79
✓✓6.817.3650.12
✓✓✓6.427.2346.42
Fine-tuning with 0% watermark (oracle)6.937.1349.41
", + "image_path": "fd2fe6af44a63783c00623cd5ff055dfea653b70fa12c75d73d75695eab467b8.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 342, + 137, + 486, + 209 + ], + "blocks": [ + { + "bbox": [ + 342, + 137, + 486, + 209 + ], + "lines": [ + { + "bbox": [ + 342, + 137, + 486, + 209 + ], + "spans": [ + { + "bbox": [ + 342, + 137, + 486, + 209 + ], + "type": "image", + "image_path": "cc476d8bfca9e3d356d3660bc5177f4c91ee724fe34f2dd899895c73d8b8de0d.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 338, + 220, + 482, + 285 + ], + "lines": [ + { + "bbox": [ + 338, + 220, + 482, + 285 + ], + "spans": [ + { + "bbox": [ + 338, + 220, + 482, + 285 + ], + "type": "text", + "content": "Fig. 5: Effects of geometric accuracy. The x-axis is the IoU decided by the noise " + }, + { + "bbox": [ + 338, + 220, + 482, + 285 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 338, + 220, + 482, + 285 + ], + "type": "text", + "content": " added on the location. GEOM-ERASING has a tolerance of around 0.4 IoU considering ICR." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 218, + 335, + 285 + ], + "lines": [ + { + "bbox": [ + 130, + 218, + 335, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 218, + 335, + 285 + ], + "type": "text", + "content": "Table 4: Ablation of different components. Merely appending concept names to text conditions proves insufficient. Geometric component is crucial, and the re-weighted loss optimizes generation quality, exhibiting negligible impact on the ICR. Default settings are marked in gray." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 309, + 482, + 417 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 309, + 482, + 417 + ], + "spans": [ + { + "bbox": [ + 130, + 309, + 482, + 417 + ], + "type": "text", + "content": "the models' inadequacies in accurately identifying and addressing the implicit concepts, subsequently hindering successful erasure. Among all the baselines, ESD [7] demonstrates superior erasure performance, albeit with a higher FID score. This can be attributed to the approach employed by ESD, where the finetuned SD model is trained to move away from the images it originally generated, regardless of whether they contain the intended concept or not. However, since the original generated images may contain implicit concepts with high probability, ESD might result in unintended concept removal while affecting meaningful one, as shown in the second column of Fig. A4." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 418, + 482, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 482, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 482, + 502 + ], + "type": "text", + "content": "In contrast, the proposed GEOM-ERASING demonstrates the ability to effectively remove implicit concepts while preserving the other meaningful concepts, yielding favorable ICR and FID results. It surpasses the state-of-the-art, as evidenced by the superior " + }, + { + "bbox": [ + 130, + 418, + 482, + 502 + ], + "type": "inline_equation", + "content": "F*R/100" + }, + { + "bbox": [ + 130, + 418, + 482, + 502 + ], + "type": "text", + "content": " measure. Refer to Appendix C for visual comparisons among different methods. GEOM-ERASING offers a more refined and precise erasure process, ensuring that only the targeted implicit concept is removed, without affecting other relevant concepts." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 518, + 272, + 530 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 518, + 272, + 530 + ], + "spans": [ + { + "bbox": [ + 131, + 518, + 272, + 530 + ], + "type": "text", + "content": "5.3 Ablation and Analysis" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 538, + 482, + 611 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 538, + 482, + 611 + ], + "spans": [ + { + "bbox": [ + 130, + 538, + 482, + 611 + ], + "type": "text", + "content": "In this section, we perform various ablations analyses to demonstrate the effectiveness of different components in GEOM-ERASING. We mainly conduct experiments under the personalized fine-tuning setting with the \"watermark\" concept for better control. Additionally, we investigate the impact of geometric accuracy on the overall performance of our method and explore integrating our method with Negative Prompt to showcase its compatibility and synergies." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 667 + ], + "type": "text", + "content": "Ablative analysis. The ablation results, as shown in Table 4 and Fig. 6, shed light on the importance of different components in our methods. We separately integrate the concept name (Eq. 2), geometric information (Eq. 3), and loss reweight (Eq. 4) before combining them. Notably, the geometric component proved" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 153, + 118, + 465, + 284 + ], + "blocks": [ + { + "bbox": [ + 153, + 118, + 465, + 284 + ], + "lines": [ + { + "bbox": [ + 153, + 118, + 465, + 284 + ], + "spans": [ + { + "bbox": [ + 153, + 118, + 465, + 284 + ], + "type": "image", + "image_path": "0b136721b81a4dd792e7e7c455e9b88ee5e8ea1b7e61a100e874c3433b2e6d27.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 293, + 482, + 316 + ], + "lines": [ + { + "bbox": [ + 131, + 293, + 482, + 316 + ], + "spans": [ + { + "bbox": [ + 131, + 293, + 482, + 316 + ], + "type": "text", + "content": "Fig. 6: Visualization of different components. Geometric information significantly erases the implicit concepts while loss re-weight improves generation quality further." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 341, + 482, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 473 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 473 + ], + "type": "text", + "content": "pivotal, markedly reducing both FID and ICR, particularly when synergized with the concept condition, enhancing the model's overall performance. The loss reweight component contributes to improving the visual appeal of the generated images while maintaining efficacy of implicit concept removal. Throughout the ablative studies, a consistent trend between FID and ICR is observed, implying enhanced erasure correlates to superior image quality. Moreover, when finetuning the model with no implicit concepts (0% images with watermarks), the model achieves an ICR comparable to GEOM-ERASING. Interestingly, GEOM-ERASING surpasses even this optimum in FID and " + }, + { + "bbox": [ + 130, + 341, + 482, + 473 + ], + "type": "inline_equation", + "content": "F*R" + }, + { + "bbox": [ + 130, + 341, + 482, + 473 + ], + "type": "text", + "content": ", emphasizing the importance of geometric information in refining concept learning and subsequently improving image quality." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": "Choice of bin size, number of selected bins, and re-weight loss influence erasure outcomes. Table 5 depicts the effects of varying bin sizes " + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": " and selected bin numbers " + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": " (bold values denoting the best performance and the gray row signifying the default selection). Bins are ranked and selected by value " + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "inline_equation", + "content": "p_i" + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": " as stated in Sec. 4. First, we analyze the impact of bin sizes by fixing the ratio between the number of selected bins and bin size and varying the size from " + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "inline_equation", + "content": "8^2" + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "inline_equation", + "content": "64^2" + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": ". As the bin size increases, the performance initially improves and then starts to decline. This trend suggests that higher resolutions may provide more accurate concept localization but can also dilute the information density of the original text. Subsequently, with a fixed bin size, varying the number of selected bins shows enhancement in erasure performance up to a saturation point." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "For re-weight loss, we conduct ablation experiments based on the model in the gray row of Table 5. An alternate re-weight loss incorporating the " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_i" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " values is proposed. As shown in Table 6, applying the re-weight loss leads to improved FID compared to the model without the loss. However, utilizing the " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_i" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " may" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 258, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 138, + 114, + 236, + 201 + ], + "blocks": [ + { + "bbox": [ + 138, + 114, + 236, + 201 + ], + "lines": [ + { + "bbox": [ + 138, + 114, + 236, + 201 + ], + "spans": [ + { + "bbox": [ + 138, + 114, + 236, + 201 + ], + "type": "table", + "html": "
MKFIDICRF*R
8246.7818.26123.80
162166.5315.45100.89
322646.5112.6482.29
6421507.2916.47120.07
322726.817.3650.12
322806.927.3550.86
", + "image_path": "9a3867cb9bcd86b0cd5f6f2d8acf39e2a5911f794571af29759390cecf9b5f3e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 255, + 114, + 361, + 194 + ], + "blocks": [ + { + "bbox": [ + 132, + 201, + 239, + 245 + ], + "lines": [ + { + "bbox": [ + 132, + 201, + 239, + 245 + ], + "spans": [ + { + "bbox": [ + 132, + 201, + 239, + 245 + ], + "type": "text", + "content": "Table 5: Bin size and selected bins. Larger bin size and more bins improve results." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 255, + 114, + 361, + 194 + ], + "lines": [ + { + "bbox": [ + 255, + 114, + 361, + 194 + ], + "spans": [ + { + "bbox": [ + 255, + 114, + 361, + 194 + ], + "type": "table", + "html": "
Re-weight FunctionαFIDICRF*R
Eq. 50.256.427.2346.42
0.506.407.6348.83
0.756.457.4147.79
(1-pi)α0.56.279.2157.75
16.339.3446.46
26.269.4459.09
", + "image_path": "78479146851d16bf45ca138a2df4ead7ac8e616b2de5a2d8542a1c0ef7bd19cf.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 376, + 114, + 482, + 161 + ], + "blocks": [ + { + "bbox": [ + 252, + 201, + 360, + 243 + ], + "lines": [ + { + "bbox": [ + 252, + 201, + 360, + 243 + ], + "spans": [ + { + "bbox": [ + 252, + 201, + 360, + 243 + ], + "type": "text", + "content": "Table 6: Re-weight loss. A fixed re-weight design is good enough for better ICR." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 376, + 114, + 482, + 161 + ], + "lines": [ + { + "bbox": [ + 376, + 114, + 482, + 161 + ], + "spans": [ + { + "bbox": [ + 376, + 114, + 482, + 161 + ], + "type": "table", + "html": "
Negative PromptFIDICRF*R
w/o NP6.427.2346.42
Concept6.157.0343.23
+ Uniform Geometry6.995.0235.09
+ Random Geometry7.124.9835.46
", + "image_path": "1bd5d6a19020fd56c197fe7c28cb0672bae6245e450fe49358f0963985225854.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 373, + 201, + 482, + 243 + ], + "lines": [ + { + "bbox": [ + 373, + 201, + 482, + 243 + ], + "spans": [ + { + "bbox": [ + 373, + 201, + 482, + 243 + ], + "type": "text", + "content": "Table 7: Input as negative prompt. Usage of the geometry improves ICR further." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 258, + 479, + 284 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 258, + 479, + 284 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 479, + 284 + ], + "type": "text", + "content": "degrade the erasure performance. Opting for simplicity and effectiveness, a fixed value is utilized for the area covered by implicit concept, as mentioned in Eq. 5." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "text", + "content": "Geometric accuracy. GEOM-ERASING is robust to the precision of geometric information provided. Upon selecting the bins, we introduce two noise scalars " + }, + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\epsilon_1,\\epsilon_2\\sim \\mathcal{N}(0,\\sigma^2)" + }, + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "text", + "content": " to the selected bins, as " + }, + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "inline_equation", + "content": "y^\\prime = y\\oplus y_{\\mathrm{im}}\\oplus \\langle l(m + \\epsilon_1,n + \\epsilon_2)\\rangle" + }, + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "text", + "content": " Variations of " + }, + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 288, + 480, + 361 + ], + "type": "text", + "content": " yield distinct IoU values between the originally selected and noised bins, visualized in Fig. 5. ICR can tolerate a geometry accuracy up to 0.4 IoU. However, the erasure performance deteriorates as accuracy decreases." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 364, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 482, + 472 + ], + "type": "text", + "content": "Negative prompt. Adding both the learned concept name and geometric information to the negative prompt can better erase unwanted details. Since implicit concepts are supposed not to appear in any part of the image, we use location tokens that are picked uniformly or randomly as negative prompts. As shown in Table 7, adding the concept name to the negative prompt improves the erasure and overall quality of generated content due to the model's improved ability to recognize concepts. Adding geometric information, whether uniformly or randomly, further improves the erasure, but it also tends to increase the FID. We plan to explore the reasons for this increase in more detail in future work." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 487, + 220, + 500 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 220, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 220, + 500 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "Fine-tuning on personalized datasets is a prevalent practice, but the presence of unwanted implicit concepts like QR codes, watermarks, and text within these datasets can pose significant challenges during the refinement of personal diffusion models. This paper delves into the substantial impact of such implicit concepts, establishing a formal framework for their removal. Conventional methods, which predominantly depend on pre-trained diffusion models or merely acknowledge concept existence, falter in eradicating these implicit elements. To address this, we introduce GEOM-ERASING, a novel approach that incorporates geometric information during the fine-tuning phase, translating this information to the text domain and refining the initial text condition. We substantiate our approach through three diverse datasets, each laden with distinct implicit concepts. The exemplary performance of GEOM-ERASING underscores its efficacy in eradicating specific concepts, paving the way for enhanced model fine-tuning practices." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 241, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 241, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 241, + 129 + ], + "type": "text", + "content": "Acknowledgement" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 188 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 188 + ], + "type": "text", + "content": "We gratefully acknowledge the support of MindSpore, CANN (Compute Architecture for Neural Networks) and Ascend AI Processor used for this research. This work was partially supported by the Research Grants Council of the Hong Kong Special Administrative Region (Grants C7004-22G-1 and 16202523)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 205, + 197, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 205, + 197, + 217 + ], + "spans": [ + { + "bbox": [ + 133, + 205, + 197, + 217 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 228, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "type": "text", + "content": "1. Balaji, Y., Nah, S., Huang, X., Vahdat, A., Song, J., Kreis, K., Aittala, M., Aila, T., Laine, S., Catanzaro, B., et al.: edifi: Text-to-image diffusion models with an ensemble of expert denoisers. arXiv preprint arXiv:2211.01324 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 262, + 480, + 284 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 262, + 480, + 284 + ], + "spans": [ + { + "bbox": [ + 138, + 262, + 480, + 284 + ], + "type": "text", + "content": "2. Birhane, A., Prabhu, V.U., Kahembwe, E.: Multimodal datasets: misogyny, pornography, and malignant stereotypes. arXiv preprint arXiv:2110.01963 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 285, + 480, + 316 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 480, + 316 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 480, + 316 + ], + "type": "text", + "content": "3. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing diffusion using semantic dimensions. arXiv preprint arXiv:2301.12247 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 317, + 480, + 349 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 317, + 480, + 349 + ], + "spans": [ + { + "bbox": [ + 138, + 317, + 480, + 349 + ], + "type": "text", + "content": "4. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 350, + 480, + 381 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 350, + 480, + 381 + ], + "spans": [ + { + "bbox": [ + 138, + 350, + 480, + 381 + ], + "type": "text", + "content": "5. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12M: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: CVPR (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 383, + 480, + 403 + ], + "type": "text", + "content": "6. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. In: NeurIPS (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 404, + 480, + 425 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 404, + 480, + 425 + ], + "spans": [ + { + "bbox": [ + 138, + 404, + 480, + 425 + ], + "type": "text", + "content": "7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 426, + 480, + 458 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 426, + 480, + 458 + ], + "spans": [ + { + "bbox": [ + 138, + 426, + 480, + 458 + ], + "type": "text", + "content": "8. Gao, R., Chen, K., Xie, E., Hong, L., Li, Z., Yeung, D.Y., Xu, Q.: Magicdrive: Street view generation with diverse 3d geometry control. arXiv preprint arXiv:2310.02601 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 459, + 480, + 491 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 459, + 480, + 491 + ], + "spans": [ + { + "bbox": [ + 138, + 459, + 480, + 491 + ], + "type": "text", + "content": "9. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 491, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 480, + 512 + ], + "type": "text", + "content": "0. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 514, + 480, + 534 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 514, + 480, + 534 + ], + "spans": [ + { + "bbox": [ + 138, + 514, + 480, + 534 + ], + "type": "text", + "content": "1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 535, + 480, + 556 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 535, + 480, + 556 + ], + "spans": [ + { + "bbox": [ + 138, + 535, + 480, + 556 + ], + "type": "text", + "content": "2. Kingma, D., Salimans, T., Poole, B., Ho, J.: Variational diffusion models. In: NeurIPS (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 557, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 557, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 557, + 480, + 578 + ], + "type": "text", + "content": "3. Kumari, N., Zhang, B., Wang, S.Y., Shechtman, E., Zhang, R., Zhu, J.Y.: Ablating concepts in text-to-image diffusion models. In: ICCV (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 578, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 610 + ], + "type": "text", + "content": "4. Lee, T., Yasunaga, M., Meng, C., Mai, Y., Park, J.S., Gupta, A., Zhang, Y., Narayanan, D., Teufel, H.B., Bellagente, M., et al.: Holistic evaluation of text-to-image models. arXiv preprint arXiv:2311.04287 (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 480, + 643 + ], + "type": "text", + "content": "5. Li, P., Liu, Z., Chen, K., Hong, L., Zhuge, Y., Yeung, D.Y., Lu, H., Jia, X.: Trackdiffusion: Multi-object tracking data generation via diffusion models. arXiv preprint arXiv:2312.00651 (2023)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "6. Nichol, A.: Dall-e 2 pre-training mitigations. https://openai.com/research/dall-e-2-pre-training-mitigations (2022)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 258, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Concept Removal of Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 479 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "17. Pinkney, J.N.M.: Pokemon blip captions. https://huggingface.co/datasets/lambdalabs/pokemon-blip-captions/ (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 480, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 480, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 480, + 160 + ], + "type": "text", + "content": "18. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 161, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 480, + 205 + ], + "type": "text", + "content": "19. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "type": "text", + "content": "20. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. In: NeurIPS (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 238, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 238, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 238, + 480, + 258 + ], + "type": "text", + "content": "21. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: CVPR (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "text", + "content": "22. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "type": "text", + "content": "23. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "text", + "content": "24. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 347, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 480, + 369 + ], + "type": "text", + "content": "25. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. In: NeurIPS (2017)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 369, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 391 + ], + "type": "text", + "content": "26. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: NeurIPS (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 392, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 480, + 413 + ], + "type": "text", + "content": "27. Yang, Y., Gui, D., Yuan, Y., Ding, H., Hu, H., Chen, K.: Glyphcontrol: Glyph conditional control for visual text generation. arXiv preprint arXiv:2305.18259 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 413, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 480, + 435 + ], + "type": "text", + "content": "28. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2211.08332 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 435, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 480, + 456 + ], + "type": "text", + "content": "29. Zhang, Y., Hooi, B.: Hipa: Enabling one-step text-to-image diffusion models via high-frequency-promoting adaptation. arXiv preprint arXiv:2311.18158 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 457, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 480, + 479 + ], + "type": "text", + "content": "30. Zhang, Y., Zhou, D., Hooi, B., Wang, K., Feng, J.: Expanding small-scale datasets with guided imagination. In: NeurIPS (2023)" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 216, + 100 + ], + "type": "text", + "content": "Z. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_content_list.json b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..31c24348460b469f086cd310d9819780dd546c18 --- /dev/null +++ b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_content_list.json @@ -0,0 +1,2244 @@ +[ + { + "type": "text", + "text": "Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds", + "text_level": 1, + "bbox": [ + 243, + 140, + 759, + 185 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Shengtao $\\mathrm{Li}^{1,2}$ , Ge Gao $^{1,2(\\boxtimes)}$ , Yudong Liu $^{1,2}$ , Ming Gu $^{1,2}$ , and Yu-Shen Liu $^{2}$", + "bbox": [ + 223, + 210, + 777, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China", + "bbox": [ + 246, + 238, + 754, + 267 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ School of Software, Tsinghua University, Beijing, China list21@mails.tsinghua.edu.cn, gaoge@tsinghua.edu.cn, liuyd23@mails.tsinghua.edu.cn, guming@tsinghua.edu.cn, liuyushen@tsinghua.edu.cn", + "bbox": [ + 290, + 267, + 707, + 324 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Neural signed distance functions (SDFs) have shown powerful ability in fitting the shape geometry. However, inferring continuous signed distance fields from discrete unoriented point clouds still remains a challenge. The neural network typically fits the shape with a rough surface and omits fine-grained geometric details such as shape edges and corners. In this paper, we propose a novel non-linear implicit filter to smooth the implicit field while preserving high-frequency geometry details. Our novelty lies in that we can filter the surface (zero level set) by the neighbor input points with gradients of the signed distance field. By moving the input raw point clouds along the gradient, our proposed implicit filtering can be extended to non-zero level sets to keep the promise consistency between different level sets, which consequently results in a better regularization of the zero level set. We conduct comprehensive experiments in surface reconstruction from objects and complex scene point clouds, the numerical and visual comparisons demonstrate our improvements over the state-of-the-art methods under the widely used benchmarks. Project page: https://list17.github.io/ImplicitFilter.", + "bbox": [ + 259, + 357, + 743, + 594 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Implicit filtering $\\cdot$ Signed distance functions $\\cdot$ Point cloud reconstruction", + "bbox": [ + 259, + 604, + 740, + 633 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 657, + 375, + 674 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Reconstructing surfaces from 3D point clouds is an important task in 3D computer vision. Recently signed distance functions (SDFs) learned by neural networks have been a widely used strategy for representing high-fidelity 3D geometry. These methods train the neural networks to predict the signed distance for every position in the space by signed distances from ground truth or inferred from the raw 3D point cloud. With the learned signed distance field, we can obtain the surface by running the marching cubes algorithm [27] to extract the zero level set.", + "bbox": [ + 212, + 688, + 787, + 808 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Without signed distance ground truth, inferring the correct gradient and distance for each query point could be hard. Since the gradient of the neural", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/a29f128bac815ab60f2914f90a2aa54043771d793027f6b81d2a902050d5823a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 217, + 147, + 331, + 237 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/81c4937b15203465b35d1881e141cab8819493157399dc2bef59d3d4beaca80f.jpg", + "image_caption": [ + "(a) Input" + ], + "image_footnote": [], + "bbox": [ + 217, + 237, + 331, + 279 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/28b3ad0451c077cb19aeef1281e36e1f4664ad0fec840b9e7d9485d73bb18bd9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 331, + 146, + 444, + 234 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/22dee5dc050117653b2f63dfcb503c9a79f63bbb8f85333e07003ac65f6d2736.jpg", + "image_caption": [ + "(b) SAP" + ], + "image_footnote": [], + "bbox": [ + 333, + 237, + 444, + 279 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/8be99249911602147a65d2f8b5b3df1cf545790f291b1ef8e5165d76fefa3937.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 444, + 146, + 557, + 234 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/4042444c151cfa2101a1e2eed9fe4977458f90bede738c9731c909a9c4290d98.jpg", + "image_caption": [ + "(c) DIGS", + "Fig. 1: Visualization of the comparisons on FAMOUS dataset [12]. Our implicit filter can improve the reconstruction by removing the noise and keeping the geometric details compared with other methods." + ], + "image_footnote": [], + "bbox": [ + 446, + 237, + 557, + 279 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/d3f962546249fedfa5209d684899e0d0894a97aba8da9f815c92153514548c1c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 558, + 146, + 669, + 234 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/bea886ad4f2b944da2d32f1db88f880c5cf4c898d735c75f7c8622345b97165a.jpg", + "image_caption": [ + "(c) NeuralPull" + ], + "image_footnote": [], + "bbox": [ + 558, + 237, + 669, + 279 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/534d6a290d91c32156ae14e9fa8826e1ae441a7bfc75f35b87a57db040576348.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 669, + 146, + 784, + 234 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/4e480ffa3888a4910680e85a20581b67e804c0b1aca7d1981b3d06c6af76cc4d.jpg", + "image_caption": [ + "(e) Ours" + ], + "image_footnote": [], + "bbox": [ + 671, + 237, + 782, + 279 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "network also indicates the direction in which the signed distance field changes, recent works [1,2,4,14,29,38] typically add constraints on the network gradient to learn a stable field. In terms of the rate at which the field is changing, the eikonal term [1,2,5,38] is widely used to ensure the norm of the gradient to be one everywhere. For the gradient direction constraint, some methods [4,10] use the direction from the query point to the nearest point on the surface as guidance. Leveraging the continuity of the neural network and the gradient constraint, all these methods could reconstruct discrete points. However, the continuity cannot guarantee the prediction is correct everywhere. Therefore, reconstructed surfaces of previous methods usually contain noise and ignore geometry details when there are not enough points to guide the reconstruction, as shown in Fig. 1.", + "bbox": [ + 212, + 378, + 787, + 545 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The above issue arises from the fact that these methods overlook the geometric information within the neighborhood but only focus on adding constraints on individual points to optimize the network. To resolve this issue, we introduce the bilateral filter for implicit fields that reduces surface noise while preserving the high-frequency geometric characteristics of the shape. Our designed implicit filter takes into account both the position of point clouds and the gradient of learned implicit fields. Based on the assumption of all input points lying on the surface, we can filter noise points on the zero level set by minimizing the weighted projection distance to gradients of the neighbor input points. Moreover, by moving the input points along the gradient of the field to other level sets, we can easily extend the filter to the whole field. This helps constrain the signed distance field near the surface and achieve better consistency through different level sets. To evaluate the effectiveness of our proposed implicit filtering, we validate it under widely used benchmarks including object and scene reconstructions. Our contributions are listed below.", + "bbox": [ + 212, + 547, + 789, + 773 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "- We introduce the implicit filter on SDFs to smooth the surface while preserving geometry details for learning better neural networks to represent shapes or scenes.", + "bbox": [ + 223, + 794, + 787, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 344, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "- We improve the implicit filter by extending it to non-zero level sets of signed distance fields. This regularization of the field aligns different level sets and provides better consistency within the whole SDF field.", + "bbox": [ + 223, + 146, + 782, + 190 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- Both object and scene reconstruction experiments validate our implicit filter, demonstrating its effectiveness and ability to produce high-fidelity reconstruction results, surpassing the previous state-of-the-art methods.", + "bbox": [ + 225, + 191, + 784, + 237 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 262, + 387, + 277 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "With the rapid development of deep learning, neural networks have shown great potential in surface reconstruction from 3D point clouds. In the following, we briefly review methods related to implicit learning for 3D shapes and reconstructions from point clouds.", + "bbox": [ + 212, + 295, + 782, + 354 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Implicit Learning from 3D Supervision. The most commonly used strategy to train the neural network is to learn priors in a data-driven manner. These methods require signed distances or occupancy labels as 3D supervision to learn global priors [6,12,26,31,32] or local priors [7,17,18,22,35,40,41,44,45]. With large-scale training datasets, the neural network can perform well with similar shapes, but may not generalize well to unseen cases with large geometric variations. These models often have limited inputs that can be difficult to scale for varying sizes of point clouds.", + "bbox": [ + 212, + 356, + 784, + 474 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Implicit Learning from Raw Point Clouds. Different from the supervised methods, we can learn implicit functions by overfitting neural networks on single point clouds globally or locally to learn SDFs [1-4, 10, 21, 28, 30, 34]. These unsupervised methods rely on neural networks to infer implicit functions without learning any priors. Therefore, apart from the guidance of original input point clouds, we also need constraints on the direction [3, 4, 10, 21] or the norm [1, 2, 30] of the gradients, specially designed priors [3, 28], or differentiableoisson solver [34] to infer SDFs. This unsupervised approach heavily depends on the fitting capability and continuity of neural networks. However, these SDFs lack accuracy because there is no reliable guidance available for each query point across the entire space when working with discrete point clouds. Therefore, deducing the correct geometry for free space becomes particularly crucial. Our implicit filtering enhances SDFs by inferring the geometric details through the implicit field information of neighbor points.", + "bbox": [ + 212, + 477, + 784, + 686 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Feature Preserving Point Cloud Reconstruction. Early works [16, 23, 33] reconstruct point clouds with sharp features usually by point cloud consolidation. The key idea of these methods is to enhance the quality of point clouds with sharp features. One popular category is the local projection operation (LOP) [25] and its variants [15, 16, 23, 36]. The projection operator provides a stable and easily generalizable method for point cloud filtering, which is also the foundation of our implicit filter. The difference lies in that we do not need any normal or other priors and our filtering can be directly applied to implicit fields to extract high-fidelity meshes. Some other learning-based methods [47, 48] try to consolidate point clouds with edge points in a data-driven manner. Although", + "bbox": [ + 212, + 688, + 785, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 614, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "capable of generating high-quality point clouds, these methods still require a proper reconstruction method [13] to inherit the details in meshes.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "With the advancement of deep learning in point cloud reconstruction, some approaches [5,24,38,42] also explored employing neural networks to reconstruct high-precision models. FFN [39], SIREN [38], and IDF [43] introduce high-frequency features into the neural network in different ways to preserve the geometric details of the reconstructed shape. DIGS [5] and EPI [42] smooth the surface by using the divergence as guidance to alleviate the implicit surface roughness. Compared with these methods, we first introduce local geometric features through filtering to optimize the implicit field, so that we can achieve higher accuracy.", + "bbox": [ + 212, + 176, + 784, + 311 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 334, + 330, + 349 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Neural SDFs overview. This section will briefly describe the concepts we used in our implicit filtering. We focus on the SDF $f: \\mathbb{R}^3 \\to \\mathbb{R}$ inferred from the point cloud $\\pmb{P} = \\{\\pmb{p}_i | \\pmb{p}_i \\in \\mathbb{R}^3\\}_{i=1}^N$ without ground truth signed distances and normals. $f$ predicts a signed distance $s \\in \\mathbb{R}$ for an arbitrary query point $\\pmb{q}$ , as formulated by $s = f_{\\theta}(\\pmb{q})$ , where $\\theta$ denotes the parameters of the neural network.", + "bbox": [ + 212, + 364, + 782, + 439 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The level set $S_{d}$ of SDF is defined as a set of continuous query points with the same signed distance $d$ , formulated as $S_{d} = \\{q|f_{\\theta}(q) = d\\}$ . The goal of our implicit filtering is to smooth each level set with geometry details. Then we can extract the zero level set as a mesh by running the marching cubes algorithm [27].", + "bbox": [ + 212, + 441, + 782, + 501 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Level set bilateral filtering. Filtering for 2D images replaces the intensity of each pixel with the weighted intensity values from nearby pixels. Different from images, the resolution of implicit fields is infinite and we need to find the neighborhood on each level set for filtering. By minimizing the following loss function,", + "bbox": [ + 212, + 522, + 632, + 613 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\nL _ {d i s t} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} | f _ {\\theta} (\\boldsymbol {p} _ {i}) |, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 339, + 623, + 630, + 662 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "we can approximate that all points in $\\pmb{P}$ are located on level set $S_0$ , which makes it feasible to find neighbor points on $S_0$ . For a given point $\\bar{\\pmb{p}}$ on $S_0$ , one simple strategy of filtering is to average positions of neighbor points $\\mathcal{N}(\\bar{\\pmb{p}}, S_0) \\subset \\pmb{P}$ on $S_0$ by a Gaussian filter based on relative positions as follows:", + "bbox": [ + 212, + 672, + 632, + 763 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/9464860f7cd2c7a102adf0b537475a01ffe20113130290e4818a96acc8e11989.jpg", + "image_caption": [ + "Fig.2: By minimizing the weighted projection distance, our filter can preserve the sharp feature but the average method leads to a wrong result." + ], + "image_footnote": [], + "bbox": [ + 638, + 526, + 785, + 646 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\bar {\\boldsymbol {p}} _ {\\text {a v e r a g e}} = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , S _ {0})} \\boldsymbol {p} _ {j} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |)}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}}, S _ {0})} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |)}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 773, + 784, + 813 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where the Gaussian function $\\phi$ is defined as $\\phi (||\\bar{\\pmb{p}} -\\pmb {p}_j||) = \\exp \\left(-\\frac{||\\bar{\\pmb{p}} - \\pmb{p}_j||^2}{\\sigma_p^2}\\right)$ .", + "bbox": [ + 212, + 816, + 769, + 844 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 127 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/5802b8608a3e966795da1e93a4094d67bd8423976e8c17b143841bcbdbc2b5fe.jpg", + "image_caption": [ + "Fig. 3: Overview of filtering the zero level set. (a) We assume all input points lying on the surface and compute gradients as normals. (b) Calculating bidirectional projection distances $d1 = |\\pmb{n}_{p_j}^T(\\bar{\\pmb{p}} - \\pmb{p}_j)|$ , $d2 = |\\pmb{n}_{\\bar{p}}^T(\\bar{\\pmb{p}} - \\pmb{p}_j)|$ and the weights in Eq. (4). (c) By minimizing Eq. (4), we can remove the noise on the zero level set. The gradient $\\nabla f_\\theta$ in this figure defaults to be regularized." + ], + "image_footnote": [], + "bbox": [ + 215, + 142, + 787, + 224 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "However, as depicted in Fig. 2, it is evident that this weighted mean position yields excessively smooth surfaces, causing sharp features and details to be further obscured. To keep the geometric details, our filtering operator suggests measuring the projection distance to the gradient of neighbor points as shown in Fig. 2 and Fig. 3(b). When calculating weights, it is vital to account for both the impact of relative positions and the gradient similarity. Following the principles of bilateral filtering, to compute the filtered point for $\\bar{p}$ , we simply need to minimize the following distance equation:", + "bbox": [ + 212, + 334, + 784, + 455 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nd (\\bar {\\boldsymbol {p}}) = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , \\mathcal {S} _ {0})} \\left| \\boldsymbol {n} _ {p _ {j}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right| \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |) \\psi (\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}})}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , \\mathcal {S} _ {0})} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |) \\psi (\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}})}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 305, + 465, + 784, + 503 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where the gradient $\\pmb{n}_{\\bar{p}}$ , $\\pmb{n}_{p_j}$ and the Gaussian function $\\psi$ are defined as $\\pmb{n}_{\\bar{p}} = \\frac{\\nabla f_{\\theta}(\\bar{p})}{||\\nabla f_{\\theta}(\\bar{p})||}, \\pmb{n}_{p_j} = \\frac{\\nabla f_{\\theta}(\\pmb{p}_j)}{||\\nabla f_{\\theta}(\\pmb{p}_j)||}, \\psi(\\pmb{n}_{\\bar{p}}, \\pmb{n}_{p_j}) = \\exp\\left(-\\frac{1 - \\pmb{n}_{\\bar{p}}^T \\pmb{n}_{p_j}}{1 - \\cos(\\sigma_n)}\\right)$ .", + "bbox": [ + 214, + 505, + 784, + 551 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In addition to projection to the gradient $\\pmb{n}_{p_j}$ , we observe that the projection distance to $\\pmb{n}_{\\bar{p}}$ can assist in learning a more stable gradient for point $\\bar{p}$ which is also adopted in EAR [16]. Taking into account the bidirectional projection, our final bilateral filtering operator can be formulated as follows:", + "bbox": [ + 212, + 551, + 784, + 611 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nd _ {b i} (\\bar {\\boldsymbol {p}}) = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , S _ {0})} \\left(\\left| \\boldsymbol {n} _ {p _ {j}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right| + \\left| \\boldsymbol {n} _ {\\bar {p}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right|\\right) \\phi \\left(\\left\\| \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} \\right\\|\\right) \\psi \\left(\\boldsymbol {n} _ {\\bar {p}} , \\boldsymbol {n} _ {p _ {j}}\\right)}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}}, S _ {0})} \\phi \\left(\\left\\| \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} \\right\\|\\right) \\psi \\left(\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}}\\right)}. \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 238, + 631, + 784, + 688 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Although similar filtering methods have been widely studied in applications such as point cloud denoising and resampling [16, 48], there are two critical problems when applying these methods in implicit fields:", + "bbox": [ + 212, + 695, + 782, + 742 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "1. Filtering the zero level set needs to sample points on the level set $S_0$ , which necessitates the resolution of the equation $f_{\\theta} = 0$ , or the utilization of the marching cubes algorithm [27]. Both methods pose challenges in achieving fast and uniform point sampling. For the randomly sampled point $\\mathbf{q}$ on nonzero level set $S_{f_{\\theta}(\\mathbf{q})}$ , we can also not filter this level set since there are no neighbor points on $S_{f_{\\theta}(\\mathbf{q})}$ .", + "bbox": [ + 222, + 750, + 787, + 842 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 614, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/1eaea1cbcf8ac66d07a649b7e97c43844bffb77fa8105655f5af71cad9e6e86b.jpg", + "image_caption": [ + "Fig. 4: Overview of sampling points. (a) Sampling query points near the surface. (b) Pulling the query point to the zero level set and input points to the level set where the query point is located. (c) Applying the filter on each level set. The gradient $\\nabla f_{\\theta}$ in this figure defaults to be regularized." + ], + "image_footnote": [], + "bbox": [ + 217, + 142, + 787, + 224 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "2. The normals utilized in our filtering are derived from the gradients of the neural network $f_{\\theta}$ . While the network typically offers reliable gradients, we may find that $\\nabla f_{\\theta} = 0$ is also the optimal solution to the minimum value of Eqs. (3) and (4). This degenerate solution is unexpected, as it implies a scenario where there is no surface when the gradient is zero everywhere.", + "bbox": [ + 220, + 323, + 785, + 398 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We will focus on addressing the two issues in the subsequent sections.", + "bbox": [ + 215, + 409, + 718, + 425 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Sampling points for filtering. Inspired by NeuralPull [4], we can pull a query point to the zero level set by the gradient of the neural network $f_{\\theta}$ . For a given query point $\\mathbf{q}$ as input, the pulled location $\\hat{\\mathbf{q}}$ can be formulated as follows:", + "bbox": [ + 212, + 449, + 784, + 494 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\boldsymbol {q}} = \\boldsymbol {q} - f _ {\\theta} (\\boldsymbol {q}) \\nabla f _ {\\theta} (\\boldsymbol {q}) / | | \\nabla f _ {\\theta} (\\boldsymbol {q}) | |. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 510, + 785, + 527 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The point $\\pmb{q}$ and $\\hat{\\pmb{q}}$ lie respectively on level set $S_{f_{\\theta}(q)}$ and $S_0$ as illustrate in Fig. 4(b). By adopting the sampling strategy in NeuralPull, we can generate samples $\\pmb{Q} = \\{\\pmb{q}_i|\\pmb{q}_i\\in \\pmb{R}^3\\}_{i = 1}^M$ on different level sets near the surface and pull them to $S_0$ by Eq. (5), to obtain $\\hat{\\pmb{Q}} = \\{\\hat{\\pmb{q}}_i|\\hat{\\pmb{q}}_i = \\pmb {q}_i - f_\\theta (\\pmb {q}_i)\\nabla f_\\theta (\\pmb {q}_i) / ||\\nabla f_\\theta (\\pmb {q}_i)||,\\pmb {q}_i\\in \\pmb {Q}\\}_{i = 1}^M$ . Hence, we can filter the zero level set by minimizing Eq. (4) across all pulled query points $\\hat{\\pmb{Q}}$ , which is equivalent to optimizing the following loss:", + "bbox": [ + 212, + 534, + 787, + 626 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nL _ {z e r o} = \\sum_ {\\hat {\\boldsymbol {q}} \\in \\hat {\\boldsymbol {Q}}} d _ {b i} (\\hat {\\boldsymbol {q}}), \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 638, + 785, + 665 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where for each $\\hat{\\pmb{q}}\\in \\hat{\\mathcal{Q}}$ $\\mathcal{N}(\\hat{\\pmb{q}},\\mathcal{S}_0)$ denotes finding the neighbors of $\\hat{\\pmb{q}}$ within the input points $\\pmb{P}$ , since $\\pmb{P}$ is assumed to be located on $\\mathcal{S}_0$ .", + "bbox": [ + 212, + 672, + 784, + 702 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This filtering mechanism can be easily extended to non-zero level sets in a similar inverse manner. To be more specific, as for level set $S_{f_{\\theta}(\\pmb{q})}$ , the neighbor points for query point $\\pmb{q} \\in \\pmb{Q}$ are required. These points should lie on the level set $S_{f_{\\theta}(\\pmb{q})}$ same as $\\pmb{q}$ , allowing us to filter the level set $S_{f_{\\theta}(\\pmb{q})}$ using the same filter as described in Eq. (4).", + "bbox": [ + 212, + 704, + 785, + 777 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "However, obtaining $\\mathcal{N}(\\pmb{q}, S_{f_{\\theta}(q)})$ in $\\pmb{P}$ is not feasible, since all input points $\\pmb{P}$ are situated on the zero level set instead of the $S_{f_{\\theta}(\\pmb{q})}$ level set. To address this issue, we propose a technique for identifying neighbors of $\\pmb{q}$ on level set $S_{f_{\\theta}(\\pmb{q})}$ , by projecting the input points $\\pmb{P}$ inversely onto the specific level set $S_{f_{\\theta}(\\pmb{q})}$ based", + "bbox": [ + 212, + 779, + 785, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 126 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "on the gradient, as depicted in Fig. 4(b). The projected neighbor points can be represented as in Eq. (7). Filtering across multiple level sets helps to enhance the performance of our method by optimizing the consistency between different level sets within the SDF field. We further showcase this evidence in the ablation study detailed in Section Sec. 4.4.", + "bbox": [ + 212, + 146, + 782, + 220 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {N} (\\boldsymbol {q}, S _ {f _ {\\theta} (q)}) = \\left\\{\\hat {\\boldsymbol {p}} \\mid \\hat {\\boldsymbol {p}} = \\boldsymbol {p} + f _ {\\theta} (\\boldsymbol {q}) \\frac {\\nabla f _ {\\theta} (\\boldsymbol {p})}{\\| \\nabla f _ {\\theta} (\\boldsymbol {p}) \\|}, \\boldsymbol {p} \\in \\mathcal {N} (\\hat {\\boldsymbol {q}}, \\mathcal {S} _ {0})) \\right\\}. \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 285, + 232, + 785, + 263 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Based on the above analysis, we can filter the level sets $S_{f_{\\theta}(q)}$ by minimizing Eq. (4) over all sample points $Q$ through Eq. (7), equivalent to optimizing the following loss:", + "bbox": [ + 214, + 267, + 782, + 311 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nL _ {\\text {f i e l d}} = \\sum_ {\\boldsymbol {q} \\in \\boldsymbol {Q}} d _ {b i} (\\boldsymbol {q}). \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 311, + 785, + 337 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "It is worth noting that for a fixed query point $\\pmb{q}$ , the pulled query point $\\hat{\\pmb{q}}$ dynamically changes when training the neural network, which results in a time-consuming process to repeatedly conduct neighbor searching for $\\hat{\\pmb{q}}$ . To handle this matter, we substitute the $\\mathcal{N}(\\hat{\\pmb{q}},\\mathcal{S}_0)$ with $\\mathcal{N}(NN(\\pmb {q}),\\mathcal{S}_0)$ , where $NN(\\pmb {q})$ denotes the nearest point of $\\pmb{q}$", + "bbox": [ + 214, + 339, + 491, + 474 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "within the point cloud $\\pmb{P}$ as shown in Fig. 5. While this substitution may introduce a slight bias for training, it also ensures the neighbor points are close to $\\hat{\\pmb{q}}$ , therefore this trade-off between efficiency and accuracy is reasonable.", + "bbox": [ + 212, + 474, + 782, + 518 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/5985aa965fcd972bc47e067ab7ad67f7b57c9820ca0a52d337b61403f09253f5.jpg", + "image_caption": [ + "Fig.5: (a) Searching neighbors directly for $\\hat{q}$ . (b) Searching neighbors for $NN(q)$ instead of $\\hat{q}$ ." + ], + "image_footnote": [], + "bbox": [ + 496, + 340, + 787, + 412 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Gradient constraint. The other problem of implicit filtering is gradient degeneration. Overfitting the neural network requires the SDF to be geometrically initialized. We can consider the initialized implicit field as the noisy field and apply our filter directly to train the network from the beginning to fit the raw point cloud by removing the 'noise'. However, if the denoise target is too complex, gradient degeneration will occur during the training process. Therefore, we need to add a constraint to the gradient of the SDF.", + "bbox": [ + 212, + 537, + 782, + 643 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "There are two ways for training the neural network to pull query points onto the surface based on NeuralPull [4] and CAP-UDF [49]. One is minimizing the distance between the pulled point $\\hat{\\pmb{q}}$ and the nearest point $NN(\\pmb{q})$ as formulated below:", + "bbox": [ + 212, + 643, + 782, + 702 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nL _ {p u l l} = \\frac {1}{M} \\sum_ {i \\in [ 1, M ]} | | \\hat {\\boldsymbol {q}} _ {i} - N N (\\boldsymbol {q} _ {i}) | | _ {2}. \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 714, + 785, + 753 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The other is minimizing the Chamfer distance between moved query points and the raw point cloud:", + "bbox": [ + 214, + 756, + 782, + 786 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nL _ {C D} = \\frac {1}{M} \\sum_ {i \\in [ 1, M ]} \\min _ {j \\in [ 1, N ]} | | \\hat {\\boldsymbol {q}} _ {i} - \\boldsymbol {p} _ {j} | | _ {2} + \\frac {1}{N} \\sum_ {j \\in [ 1, N ]} \\min _ {i \\in [ 1, M ]} | | \\boldsymbol {p} _ {j} - \\hat {\\boldsymbol {q}} _ {i} | | _ {2}. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 250, + 804, + 785, + 842 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 612, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "A stable SDF can be trained by the losses above since they are trying to move the query points to be in the same distribution with the point cloud, which can provide the constraint for our implicit filter. Here we choose $L_{CD}$ since the filtered points are likely not the nearest points and $L_{CD}$ is a more relaxed constraint.", + "bbox": [ + 212, + 146, + 787, + 220 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Loss function. Finally, our loss function is formulated as:", + "bbox": [ + 215, + 243, + 643, + 258 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nL = L _ {z e r o} + \\alpha_ {1} L _ {\\text {f i e l d}} + \\alpha_ {2} L _ {\\text {d i s t}} + \\alpha_ {3} L _ {C D}, \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 270, + 785, + 287 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\alpha_{1},\\alpha_{2}$ , and $\\alpha_{3}$ is the balance weights for our implicit filtering loss.", + "bbox": [ + 215, + 296, + 741, + 311 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Implementation details. We employ a neural network similar to OccNet [31] and the geometric network initialization proposed in SAL [1] with a smaller radius the same as GridPull [10] to learn the SDF. We use the strategy in NeuralPull [4] to sample queries around each point $\\pmb{p}$ in $\\pmb{P}$ . We set the weight $\\alpha_{3}$ to 10 to constrain the learned SDF and $\\alpha_{1}$ and $\\alpha_{2}$ to 1. The parameters $\\sigma_{n},\\sigma_{p}$ are set to $15^{\\circ}$ , $\\max_{\\pmb {p}_j\\in \\mathcal{N}(\\bar{\\pmb{p}},S_{f_\\theta (\\bar{p})})}(||\\bar{\\pmb{p}} -\\pmb {p}_j||)$ respectively.", + "bbox": [ + 212, + 332, + 787, + 428 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 446, + 375, + 463 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We conducted experiments to assess the performance of our implicit filter for surface reconstruction from raw point clouds. The results are presented for general shapes in Sec. 4.1, real scanned raw data including 3D objects in Sec. 4.2, and complex scenes in Sec. 4.3. Additionally, ablation experiments were carried out to validate the theory and explore the impact of various parameters in Sec. 4.4.", + "bbox": [ + 212, + 477, + 787, + 553 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Surface Reconstruction for Shapes", + "text_level": 1, + "bbox": [ + 215, + 574, + 545, + 589 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Datasets and metrics.", + "text_level": 1, + "bbox": [ + 215, + 598, + 415, + 611 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For surface reconstruction of general shapes from raw point clouds, we conduct evaluations on three widely used datasets including a subset of ShapeNet [8], ABC [20], and FAMOUS [12]. We use the same setting with NeuralPull [4] for the dataset ShapeNet. For datasets ABC and FAMOUS, we use the train/test", + "bbox": [ + 212, + 613, + 418, + 792 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/ad67baecab20f749e502bfee3ad24d77c95074ce406d98f7001704335a54edd6.jpg", + "table_caption": [ + "Table 1: Comparisons on ABC and Famous datasets. The threshold of F-score (F-S.) is 0.01." + ], + "table_footnote": [], + "table_body": "
MethodsABCFAMOUS
CDL2CDL1F-S.CDL2CDL1F-S.
P2S [12]0.2980.0150.5980.0120.0080.752
IGR [14]2.6750.0630.4481.4740.0440.573
NP [4]0.0950.0110.6730.1000.0120.746
PCP [3]0.2520.0230.3730.0370.0140.435
SIREN [38]0.0220.0120.4930.0250.0120.561
DIGS [5]0.0210.0100.6670.0150.0080.772
Ours0.0110.0090.6910.0080.0070.778
", + "bbox": [ + 429, + 645, + 781, + 773 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "splitting released by Points2Surf [12] and we sample points directly from the mesh in the ABC dataset without other mesh preprocessing to keep the sharp features.", + "bbox": [ + 212, + 794, + 787, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 127 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/47c50031cc3f22c0bbe79e00e52fdc1cc4bed201150377edaa0c004cbccac331.jpg", + "image_caption": [ + "Fig. 6: Visual comparisons of surface reconstruction on ABC and FAMOUS datasets. Our method can reconstruct objects with sharp edges and less noise compared with other methods." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 782, + 385 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For evaluating the performance, we follow NeuralPull to sample $1 \\times 10^{5}$ points from the reconstructed surfaces and the ground truth meshes on the ShapeNet dataset and sample $1 \\times 10^{4}$ on the ABC and FAMOUS datasets. For the evaluation metrics, we use L1 and L2 Chamfer distance ( $CD_{L1}$ and $CD_{L2}$ ) to measure the error. Moreover, we adopt normal consistency (NC) and F-score to evaluate the accuracy of the reconstructed surface, the threshold is the same with NeuralPull.", + "bbox": [ + 212, + 465, + 787, + 571 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Comparisons. To evaluate the validity of our implicit filter, we compare our method with a variety of methods including SPSR [19], Points2Surf (P2S) [12], IGR [14], NeuralPull (NP) [4], LPI [9], PCP [3], GridPull (GP) [10], SIREN [38], DIGs [5]. The quantitative results on ABC and FAMOUS datasets are shown in Tab. 1, and selectively visualized in Fig. 6. Our model reaches state-of-the-art performance on both datasets, accomplishing the goal of eliminating noise on each level set while preserving the ge", + "bbox": [ + 212, + 598, + 491, + 809 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ometric details. To more intuitively validate the efficacy of our filtering, we visualize the level sets on a cross section in Fig. 7. We also report the results on", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/b479b2f0b9aa20f063df450fbcf1acd87c3617dc52258c2e16387dda9a4b31f2.jpg", + "image_caption": [ + "Fig. 7: Visualization of level sets on a cross section." + ], + "image_footnote": [], + "bbox": [ + 506, + 601, + 777, + 770 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "idate the efficacy of our filtering, we viin Fig. 7. We also report the results on", + "bbox": [ + 500, + 809, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 614, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/01c9e1bce9a25e6e724dcfa1548a1736ff95c7c578d35fa4a7edc32649c5d2f1.jpg", + "table_caption": [ + "Table 2: Comparisons on ShapeNet dataset." + ], + "table_footnote": [], + "table_body": "
SPSR [19]NP [4]LPI [9]PCP [3]GP [10]Ours
CDL2 × 1000.2860.0380.01710.01360.00860.0032
NC0.8660.9390.95960.95900.97230.9779
F-Score (0.002)0.4070.9610.99120.98710.98960.9976
F-Score (0.004)0.6180.9760.99570.98990.99230.9985
", + "bbox": [ + 277, + 170, + 720, + 244 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/b97f62162b736400a4a730962659033ce9a166fd88e19c9dc3fa76967edca95b.jpg", + "image_caption": [ + "Fig. 8: Visual comparisons of surface reconstruction on ShapeNet dataset." + ], + "image_footnote": [], + "bbox": [ + 223, + 268, + 772, + 435 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "ShapeNet which contains over 3000 objects in terms of $CD_{L2}$ , NC, and F-Score with thresholds of 0.002 and 0.004 in Tab. 2. The detailed comparison for each class of ShapeNet can be found in the supplementary material. Our method outperforms previous methods over most classes. The visualization comparisons in Fig. 8 show that our method can reconstruct a smoother surface with fine details.", + "bbox": [ + 212, + 486, + 784, + 575 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "To validate the effect of our filter on sharp geometric features. We evaluate the edge points by the edge Chamfer distance metric used in [11]. We sample 100k points uniformly on the surface of both the reconstructed mesh and ground truth. The edge point $\\pmb{p}$ is calculated by finding whether there exists a point $\\pmb{q} \\in \\mathcal{N}_{\\epsilon}(\\pmb{p})$ satisfied $|\\pmb{n}_q\\pmb{n}_p| < \\sigma$ , where $\\mathcal{N}_{\\epsilon}(\\pmb{p})$ represents the neighbor points within distance $\\epsilon$ from $\\pmb{p}$ . The results are shown in Tab. 3 and visualized in Fig. 9. We set $\\epsilon = 0.01$ and $\\sigma = 0.1$ .", + "bbox": [ + 212, + 577, + 784, + 683 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Surface Reconstruction for Real Scans", + "text_level": 1, + "bbox": [ + 215, + 703, + 576, + 718 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dataset and metrics. For surface reconstruction of real point cloud scans, we follow VisCo [37] to evaluate our method under the Surface Reconstruction Benchmarks (SRB) [46]. We use Chamfer and Hausdorff distances $(CD_{L1}$ and HD) between the reconstruction meshes and the ground truth. Furthermore, we report their corresponding one-sided distances $(d_{\\vec{C}}$ and $d_{\\vec{H}})$ between the reconstructed meshes and the input noisy point cloud.", + "bbox": [ + 212, + 726, + 782, + 816 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/5ddf7b515bb863e9d28bc742042f8bd2637fb837a38b22b1251224db5bc1ce4d.jpg", + "table_caption": [ + "Table 3: Edge Chamfer distance comparisons on ABC dataset, ${ECD}_{L2} \\times {100}$ ." + ], + "table_footnote": [], + "table_body": "
MethodsP2S [12]IGR [14]NP [4]PCP [3]SIREN [38]DIGS [5]Ours
ECDL10.04960.08350.05010.06280.06950.07860.0256
ECDL21.0552.3651.2551.2651.4072.4930.399
", + "bbox": [ + 256, + 170, + 741, + 217 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/1da0f1256aa127b2661c1a70e8b8517f65f3955a7165d94d50ae3e1dbb713111.jpg", + "image_caption": [ + "Fig. 9: Visual comparisons of edge points and reconstruction results." + ], + "image_footnote": [], + "bbox": [ + 223, + 232, + 776, + 452 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Comparisons. We compare our method with state-of-the-art methods under the real scanned SRB dataset, including IGR [14], SPSR [19], Shape As Points (SAP) [34], NeuralPull (NP) [4], and GridPull (GP) [10]. The numerical comparisons are shown in Table 2.", + "bbox": [ + 215, + 508, + 433, + 642 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/e7362449dfb9f3a0507423c77ce536bfec505f6e243aa255fe62af290386df75.jpg", + "image_caption": [ + "(a) Input" + ], + "image_footnote": [], + "bbox": [ + 446, + 515, + 580, + 590 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/45972bd27e0205012f547a3a8a0b00369cf5fb2f4d6baaee3cdd344802a96a5b.jpg", + "image_caption": [ + "(c) SPSR", + "(d) NeuralPull" + ], + "image_footnote": [], + "bbox": [ + 581, + 515, + 647, + 594 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/381567d50bd9ce29669ea83d260e465c9de453c42b830d06e66be7b3acd53eb1.jpg", + "image_caption": [ + "Fig. 10: Visual comparisons on SRB dataset." + ], + "image_footnote": [], + "bbox": [ + 648, + 516, + 714, + 588 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/33052205e6e92893af1cf6da981d4682117c5174734a86bf807a4a163f27fcc3.jpg", + "image_caption": [ + "(e) Ours" + ], + "image_footnote": [], + "bbox": [ + 715, + 517, + 781, + 588 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "in Tab. 4, where we achieve the best accuracy in most cases. The visual comparisons in Fig. 10 demonstrate that our method can reconstruct a continuous and smooth surface with geometry details.", + "bbox": [ + 212, + 643, + 784, + 688 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Surface Reconstruction for Scenes", + "text_level": 1, + "bbox": [ + 215, + 718, + 542, + 732 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Dataset and metrics. To further demonstrate the advantage of our method in the surface reconstruction of real scene scans, we conduct experiments using the 3D Scene dataset. The 3D Scene dataset is a challenging real-world dataset with complex topology and noisy open surfaces. We uniformly sample 1000 points per $m^2$ of each scene as the input and follow PCP [3] to sample 1M points on both the reconstructed and the ground truth surfaces. We leverage L1 and L2", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 614, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/765ec552a8d45b986a3331684474b2d65dd46cde9e9564175174fa7cf308bd41.jpg", + "table_caption": [ + "Table 4: Comparisons on SRB dataset." + ], + "table_footnote": [], + "table_body": "
SPSR [19]IGR [14]SIREN [38]VisCo [37]SAP [34]NP [4]GP [10]DIGS [5]Ours
AnchorCDL10.600.220.320.210.120.1220.0930.0630.052
HD14.894.718.193.002.383.2431.8041.4471.232
dC0.600.120.100.150.080.0610.0660.0300.025
dH14.891.322.4321.070.833.2080.4600.2700.265
DaratechCDL10.440.250.210.210.260.3750.0620.0490.051
HD7.244.014.304.060.873.1270.6480.8580.751
dC0.440.080.090.140.040.7460.0390.0250.028
dH7.241.591.771.760.413.2670.2930.4410.423
DCCDL10.270.170.150.150.070.1570.0660.0420.041
HD3.102.222.182.221.173.5411.1030.6670.815
dC0.270.090.060.090.040.2420.0360.0220.019
dH3.102.612.762.760.533.5230.5390.7290.724
GargoyleCDL10.260.160.170.170.070.0800.0630.0470.044
HD6.803.524.644.401.491.3761.1290.9711.089
dC0.260.060.080.110.050.0630.0450.0280.022
dH6.800.810.910.960.780.4750.7000.2710.246
Lord QuasCDL10.200.120.170.120.050.0640.0470.0310.030
HD4.611.170.821.060.980.8220.5690.4960.554
dC0.200.070.120.070.040.0530.0310.0170.014
dH4.610.980.760.640.510.5080.3700.1810.230
", + "bbox": [ + 220, + 171, + 782, + 417 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/1bede750b0c99c202bdd2e35a6d0269bfe7cc00fc01695e9a902332451fe0b52.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 225, + 450, + 334, + 503 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/ae6b83e6251167302df71b9e55112f28b431ecb096c4a24d6275499335e34068.jpg", + "image_caption": [ + "(a) GridPull" + ], + "image_footnote": [], + "bbox": [ + 223, + 505, + 334, + 558 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/61b69745b83a95e377f285eafac7e0c21ee40496532ad49c093896a1a7fd661f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 334, + 450, + 442, + 505 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/8df6d2ddb651526fccfb512e4de2956bcb0fccf91e00a7433f31d82d74ff5842.jpg", + "image_caption": [ + "(b) PCP" + ], + "image_footnote": [], + "bbox": [ + 334, + 506, + 444, + 558 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/0c37c8482120c47e95e39d27faecf9931ceb5cf8aa1af079cdd09f2eb727c7c4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 447, + 450, + 555, + 505 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/a88a54698b5aeb3c328b3506a8ce5478548200d0bd437916cbeef699335327ca.jpg", + "image_caption": [ + "(c) NeuralPull", + "Fig. 11: Visual comparisons of surface reconstruction on 3D Scene dataset." + ], + "image_footnote": [], + "bbox": [ + 447, + 506, + 553, + 558 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/d715748af5f396b9dd9088e5446d5b75bea5de92c20604ba6bcfcc64ccb59832.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 560, + 450, + 665, + 505 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/afcc60799326adbc58f27568cd969ed55f065eb62d234a1854e9ad659a924fa4.jpg", + "image_caption": [ + "(d) Ours" + ], + "image_footnote": [], + "bbox": [ + 558, + 506, + 665, + 558 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/57824b5efbc99f2624fd7cf7aa97cd2a19ff3ba05b1bb82e1015957e5423aae2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 669, + 450, + 779, + 505 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/906947a8589292cb84f782a92cbd2b97d1b50d53a32097291681e3d5ce478439.jpg", + "image_caption": [ + "(e) GT" + ], + "image_footnote": [], + "bbox": [ + 669, + 506, + 777, + 558 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Chamfer distance $(CD_{L1}, CD_{L2})$ and normal consistency (NC) to evaluate the reconstruction quality.", + "bbox": [ + 212, + 628, + 787, + 660 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Comparisons. We compare our method with the state-of-the-art methods ConvONet [35], LIG [18], DeepLS [7], NeuralPull (NP) [4], PCP [3], GridPull (GP) [10]. The numerical comparisons in Tab. 5 demonstrate our superior performance in all scenes even compared with the local-based methods. We further present visual comparisons in Fig. 11. The visualization further shows that our method can achieve smoother with high-fidelity surfaces in complex scenes. It should be noted that the surface we extract here is not the zero level set but the 0.001 level set since the scene is not watertight. For NeuralPull we use the threshold of 0.005 instead of 0.001 to extract the complete surface therefore the mesh looks thicker.", + "bbox": [ + 212, + 688, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/302010eba0dc4a219f6fd6bd4aaf536229f8b9ce2bf49d0fc21dc1e7393c49c8.jpg", + "table_caption": [ + "Table 5: Comparisons on 3D Scene dataset, $CD_{L2} \\times 1000$ ." + ], + "table_footnote": [], + "table_body": "
BurghersLoungeCopyroomStonewallTotempole
CDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NC
ConvONet [35]27.460.0790.9079.540.0460.89410.970.0450.89220.460.0690.9052.0540.0210.943
LIG [18]3.0550.0450.8359.6720.0560.8333.610.0360.8105.0320.0420.8799.580.0620.887
DeepLS [7]0.4010.0170.9206.1030.0530.8480.6090.0210.9010.3200.0150.9540.6010.0170.950
GP [10]1.3670.0280.8734.6840.0530.8272.3270.0300.8572.2340.0240.9132.2780.0340.878
PCP [3]1.3390.0310.9290.4320.0140.9340.4050.0140.9140.2660.0140.9571.0890.0290.954
NP [4]0.8970.0250.8830.8550.0220.8870.4790.0180.8620.4340.0180.9291.6040.0320.923
Ours0.1330.0110.9340.1200.0080.9260.1110.0090.9130.0820.0090.9570.2030.0130.944
", + "bbox": [ + 220, + 170, + 782, + 266 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/4eba333e8c53ba7d786629102532c4ccefdd1b4fe529735970a2e95f94c93a94.jpg", + "image_caption": [ + "(a) Input Points" + ], + "image_footnote": [], + "bbox": [ + 225, + 282, + 321, + 358 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/bdaa44aac7fded6ab639ba9cbf99bd363d4c4e36303d2a64404084058a8ce356.jpg", + "image_caption": [ + "(b) $L_{\\text{pull}}$" + ], + "image_footnote": [], + "bbox": [ + 323, + 282, + 431, + 359 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/cb8e2aebd2be87db4e64855da406eca67dde6a8e9b1e0d3e6a65550a6a65721b.jpg", + "image_caption": [ + "(c) $L_{CD}$", + "Fig. 12: The 2D level sets show the distance field learned by different losses. The red lines represent the learned zero level set." + ], + "image_footnote": [], + "bbox": [ + 431, + 282, + 537, + 359 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/64e522315c30a37f1b8ef70fe04bd818e1f7c4a401638256772c55d1d02af5b9.jpg", + "image_caption": [ + "(c) $L_{CD} + L_{zero}$", + "(d) $L_{CD} + L_{zero} + L_{field}$" + ], + "image_footnote": [], + "bbox": [ + 537, + 282, + 643, + 359 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/604a57291afe1b44f994add003b2f0074d226a465c9d64f2d1d3ed51d6c1bfd5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 282, + 781, + 359 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.4 Ablation Studies", + "text_level": 1, + "bbox": [ + 215, + 443, + 400, + 455 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We conduct ablation studies on the FAMOUS dataset to demonstrate the effectiveness of our proposed implicit filter and explore the effect of some important hyperparameters. We report the performance in terms of L1 and L2 Chamfer distance $(CD_{L1}, CD_{L2} \\times 10^{3})$ , normal consistency (NC), and F-Score (F-S.).", + "bbox": [ + 212, + 474, + 782, + 536 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effect of Eikonal loss. We select the $L_{CD}$ to prevent the degeneration of the gradient since it both constrains the value and the gradient of the SDF. It also guides how to pull", + "bbox": [ + 214, + 537, + 433, + 626 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/12971b3d9c7cd6e215cd10ec96af99c2b081cb4c88fcf6281215aecb4d4829c2.jpg", + "table_caption": [ + "Table 6: Effect of the Eikonal term." + ], + "table_footnote": [], + "table_body": "
LossCDL1CDL2F-S.NC
w/ Eikonal, w/o CD0.0090.0210.7380.899
w/ Eikonal, w/ CD0.0080.0090.7740.910
w/o Eikonal, w/ CD0.0070.0080.7780.911
", + "bbox": [ + 450, + 556, + 771, + 616 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "the query point onto the surface. Therefore we omit the Eikonal term used in previous methods like the IGR [14], SIREN [38], and DIGS [5] which have no other direct supervision for the gradient. To verify this selection, we conduct the following experiments by trade-off these two functions. With the experimental results in Tab. 6, we find that only applying the Eikonal term is not as effective as CD alone. At the same time combining the Eikonal term with CD does not further enhance the experiment results, but the difference is small.", + "bbox": [ + 212, + 627, + 784, + 731 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effect of level set filtering. To justify the effectiveness of each term in our loss function. We report the results trained by different combinations in Tab. 7. The $L_{CD}$ is more applicable for training SDF from raw point clouds. The zero-level filter can help remove the noise and keep the geometric features. Filtering across non-zero level sets can improve the overall consistency of the entire signed distance field. Since we assume all input points lie on the surface, the function $L_{dist}$ is also necessary. Fig. 12 shows a 2D comparison of these losses, showing", + "bbox": [ + 212, + 734, + 785, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 614, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "that our filter loss functions can reconstruct a field that is aligned at all level sets and maintains geometric characteristics.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Effect of the bidirectional projection. To validate our bidirectional projection distance, we report the results in Tab. 8. The numerical comparisons show that projecting the distance to both normals can improve the reconstruction quality. Note that only using $d(\\bar{p})$ can also improve the results.", + "bbox": [ + 212, + 176, + 782, + 237 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/5488b1a3f0f7d92a0ddd5f379e55191e8b50f149c0a602b55745c222bf205791.jpg", + "table_caption": [ + "Table 7: Effect of different losses." + ], + "table_footnote": [], + "table_body": "
LossCDL1CDL2F-S.NC
Lpull0.0120.0830.7420.884
LCD0.0100.0310.7570.891
LCD + Lzero0.0080.0180.7720.905
LCD + Lzero + Lfield0.0080.0110.7690.908
Ours0.0070.0080.7780.911
", + "bbox": [ + 217, + 271, + 542, + 359 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/9b84f2c8235b98b492034386d8826849716564a02ae6ce0a74ffaaa2bb64d341.jpg", + "table_caption": [ + "Table 8: Effect of bidirectional projection." + ], + "table_footnote": [], + "table_body": "
d(¯¯¯¯p)dbi(¯¯¯¯p)
CDL10.0100.007
CDL20.0240.008
F-S.0.7260.778
NC0.8900.911
", + "bbox": [ + 593, + 277, + 725, + 353 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Weight of level set projection loss. We explore the effect of the $L_{CD}$ loss function by adjusting the weight $\\alpha_{3}$ in Eq. (11). We report our results with different candidates $\\{0, 1, 10\\}$ in Tab. 9, where 0 means we do not use the $L_{CD}$ to constrain the gradient. The comparisons in Tab. 9 show that although our implicit filter can directly learn SDFs, it is better to adopt the $L_{CD}$ for a more stable field. However, if the weight is too large, the filtering effect will decrease. It is recommended to select weights ranging from 1 to 10, which is usually adequate. For the weights $\\alpha_{1}$ and $\\alpha_{2}$ , setting them to 1 is always necessary.", + "bbox": [ + 212, + 362, + 784, + 482 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Effect of filter parameters. We compare the effect of different parameters $\\sigma_{n},\\sigma_{p}$ in Tab. 10. The diagonal weight for $\\sigma_{p}$ means the length of the diagonal of the bounding box for the local patch mentioned in [48]. The results indicate that the method is relatively robust to parameter variation in a certain range.", + "bbox": [ + 212, + 483, + 784, + 542 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/dbff695a5b5182fb52a5c4e16df0f27c7d760e9f6faf43008ecaacb5a44dc795.jpg", + "table_caption": [ + "Table 9: Effect of weight ${\\alpha }_{3}$ ." + ], + "table_footnote": [], + "table_body": "
α3CDL1CDL2F-S.NC
00.0080.0130.7580.903
10.0070.0110.7720.910
100.0070.0080.7780.911
1000.0080.0090.7740.909
", + "bbox": [ + 233, + 583, + 442, + 659 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/d070b3a27cd1b46ae156fc8eac4f6e2dc8d07737ad8b6dedc5546235023f81ba.jpg", + "table_caption": [ + "Table 10: Effect of filter parameters ${\\sigma }_{n}$ and ${\\sigma }_{p}$ ." + ], + "table_footnote": [], + "table_body": "
CDL1CDL2F-S.NC
σn15°0.0070.0080.7780.911
30°0.0070.0110.7710.907
45°0.0080.0120.7640.903
60°0.0080.0100.7670.901
σpmax0.0070.0080.7780.911
diagonal0.0080.0110.7630.904
", + "bbox": [ + 488, + 570, + 751, + 672 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 700, + 357, + 715 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We introduce implicit filtering on SDFs to reduce the noise of the signed distance field while preserving geometry features. We filter the distance field by minimizing the weighted bidirectional projection distance, where we can generate sampling points on the zero level set and neighbor points on non-zero level sets by the pulling procedure. By leveraging the Chamfer distance, we address the issue of gradient degeneration problem. The visual and numerical comparisons demonstrate our effectiveness and superiority over state-of-the-art methods.", + "bbox": [ + 212, + 733, + 784, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The corresponding author is Ge Gao. This work was supported by Beijing Science and Technology Program (Z231100001723014).", + "bbox": [ + 215, + 176, + 784, + 205 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 229, + 321, + 244 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Atzmon, M., Lipman, Y.: Sal: Sign agnostic learning of shapes from raw data. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020)", + "2. Atzmon, M., Lipman, Y.: SALD: sign agnostic learning with derivatives. In: 9th International Conference on Learning Representations, ICLR 2021 (2021)", + "3. Baorui, M., Yu-Shen, L., Matthias, Z., Zhizhong, H.: Surface reconstruction from point clouds by learning predictive context priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022)", + "4. Baorui, M., Zhizhong, H., Yu-Shen, L., Matthias, Z.: Neural-pull: Learning signed distance functions from point clouds by learning to pull space onto surfaces. In: International Conference on Machine Learning (ICML) (2021)", + "5. Ben-Shabat, Y., Hewa Koneputugodage, C., Gould, S.: Digs: Divergence guided shape implicit neural representation for unoriented point clouds. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19323-19332 (2022)", + "6. Boulch, A., Marlet, R.: Poco: Point convolution for surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6302-6314 (June 2022)", + "7. Chabra, R., Lenssen, J.E., Ilg, E., Schmidt, T., Straub, J., Lovegrove, S., Newcombe, R.: Deep local shapes: Learning local sdf priors for detailed 3d reconstruction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIX 16. pp. 608-625. Springer (2020)", + "8. Chang, A.X., Funkhouser, T., Guibas, L., Hanrahan, P., Huang, Q., Li, Z., Savarese, S., Savva, M., Song, S., Su, H., Xiao, J., Yi, L., Yu, F.: ShapeNet: An Information-Rich 3D Model Repository. Tech. Rep. arXiv:1512.03012 [cs.GR], Stanford University — Princeton University — Toyota Technological Institute at Chicago (2015)", + "9. Chao, C., Yu-shen, L., Zhizhong, H.: Latent partition implicit with surface codes for 3d representation. In: European Conference on Computer Vision (ECCV) (2022)", + "10. Chen, C., Liu, Y.S., Han, Z.: Gridpull: Towards scalability in learning implicit representations from 3d point clouds. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV) (2023)", + "11. Chen, Z., Tagliasacchi, A., Zhang, H.: Bsp-net: Generating compact meshes via binary space partitioning. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)", + "12. Eler, P., Guerrero, P., Ohrhallinger, S., Mitra, N.J., Wimmer, M.: Points2Surf: Learning implicit surfaces from point clouds. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.M. (eds.) Computer Vision - ECCV 2020. pp. 108-124. Springer International Publishing, Cham (2020)", + "13. Fleishman, S., Cohen-Or, D., Silva, C.T.: Robust moving least-squares fitting with sharp features. ACM transactions on graphics (TOG) 24(3), 544-552 (2005)" + ], + "bbox": [ + 218, + 258, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 614, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. In: Proceedings of Machine Learning and Systems 2020, pp. 3569-3579 (2020)", + "15. Huang, H., Li, D., Zhang, H., Ascher, U., Cohen-Or, D.: Consolidation of unorganized point clouds for surface reconstruction. ACM transactions on graphics (TOG) 28(5), 1-7 (2009)", + "16. Huang, H., Wu, S., Gong, M., Cohen-Or, D., Ascher, U., Zhang, H.: Edge-aware point set resampling. ACM transactions on graphics (TOG) 32(1), 1-12 (2013)", + "17. Huang, J., Gojcic, Z., Atzmon, M., Litany, O., Fidler, S., Williams, F.: Neural kernel surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4369-4379 (2023)", + "18. Jiang, C.M., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T.: Local implicit grid representations for 3d scenes. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2020)", + "19. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013)", + "20. Koch, S., Matveev, A., Jiang, Z., Williams, F., Artemov, A., Burnaev, E., Alexa, M., Zorin, D., Panozzo, D.: Abc: A big cad model dataset for geometric deep learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9601-9611 (2019)", + "21. Koneputugodage, C.H., Ben-Shabat, Y., Campbell, D., Gould, S.: Small steps and level sets: Fitting neural surface models with point guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21456-21465 (2024)", + "22. Li, S., Gao, G., Liu, Y., Liu, Y.S., Gu, M.: Gridformer: Point-grid transformer for surface reconstruction. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024)", + "23. Liao, B., Xiao, C., Jin, L., Fu, H.: Efficient feature-preserving local projection operator for geometry reconstruction. Computer-Aided Design 45(5), 861-874 (2013)", + "24. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16252-16262 (2022)", + "25. Lipman, Y., Cohen-Or, D., Levin, D., Tal-Ezer, H.: Parameterization-free projection for geometry reconstruction. ACM Transactions on Graphics (TOG) 26(3), 22-es (2007)", + "26. Liu, S.L., Guo, H.X., Pan, H., Wang, P.S., Tong, X., Liu, Y.: Deep implicit moving least-squares functions for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1788-1797 (2021)", + "27. Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3d surface construction algorithm. In: Seminal graphics: pioneering efforts that shaped the field, pp. 347-353 (1998)", + "28. Ma, B., Liu, Y.S., Han, Z.: Reconstructing surfaces for sparse point clouds with on-surface priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6315-6325 (2022)", + "29. Ma, B., Zhou, J., Liu, Y.S., Han, Z.: Towards better gradient consistency for neural signed distance functions via level set alignment. In: Conference on Computer Vision and Pattern Recognition (CVPR) (2023)", + "30. Marschner, Z., Sellan, S., Liu, H.T.D., Jacobson, A.: Constructive solid geometry on neural signed distance fields. In: SIGGRAPH Asia 2023 Conference Papers. pp. 1-12 (2023)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "31. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2019)", + "32. Mi, Z., Luo, Y., Tao, W.: Ssrnet: Scalable 3d surface reconstruction network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 970-979 (2020)", + "33. Öztiredi, A.C., Guennebaud, G., Gross, M.: Feature preserving point set surfaces based on non-linear kernel regression. In: Computer graphics forum. vol. 28, pp. 493-501. Wiley Online Library (2009)", + "34. Peng, S., Jiang, C., Liao, Y., Niemeyer, M., Pollefeys, M., Geiger, A.: Shape as points: A differentiable poisson solver. Advances in Neural Information Processing Systems 34, 13032-13044 (2021)", + "35. Peng, S., Niemeyer, M., Mescheder, L., Pollefeys, M., Geiger, A.: Convolutional occupancy networks. In: European Conference on Computer Vision (ECCV) (2020)", + "36. Preiner, R., Mattausch, O., Arikan, M., Pajarola, R., Wimmer, M.: Continuous projection for fast l1 reconstruction. ACM Trans. Graph. 33(4), 47-1 (2014)", + "37. Pumarola, A., Sanakoyeu, A., Yariv, L., Thabet, A., Lipman, Y.: Visco grids: Surface reconstruction with viscosity and coarea grids. Advances in Neural Information Processing Systems 35, 18060-18071 (2022)", + "38. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Neural Information Processing Systems, Neural Information Processing Systems (Jun 2020)", + "39. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020)", + "40. Tang, J., Lei, J., Xu, D., Ma, F., Jia, K., Zhang, L.: Sa-convonet: Sign-agnostic optimization of convolutional occupancy networks. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021)", + "41. Tretschk, E., Tewari, A., Golyanik, V., Zollhöfer, M., Stoll, C., Theobalt, C.: Patchnets: Patch-based generalizable deep implicit 3d shape representations. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVI 16. pp. 293-309. Springer (2020)", + "42. Wang, X., Cheng, Y., Wang, L., Lu, J., Xu, K., Xiao, G.: Edge preserving implicit surface representation of point clouds. arXiv preprint arXiv:2301.04860 (2023)", + "43. Wang, Y., Rahmann, L., Sorkine-Hornung, O.: Geometry-consistent neural shape representation with implicit displacement fields. In: The Tenth International Conference on Learning Representations. OpenReview (2022)", + "44. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 259-270 (2023)", + "45. Williams, F., Gojcic, Z., Khamis, S., Zorin, D., Bruna, J., Fidler, S., Litany, O.: Neural fields as learnable kernels for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18500-18510 (2022)", + "46. Williams, F., Schneider, T., Silva, C., Zorin, D., Bruna, J., Panozzo, D.: Deep geometric prior for surface reconstruction. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10130-10139 (2019)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Implicit Filtering", + "bbox": [ + 614, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "47. Yu, L., Li, X., Fu, C.W., Cohen-Or, D., Heng, P.A.: Ec-net: an edge-aware point set consolidation network. In: Proceedings of the European conference on computer vision (ECCV). pp. 386-402 (2018)", + "48. Zhang, D., Lu, X., Qin, H., He, Y.: Pointfilter: Point cloud filtering via encoder-decoder modeling. IEEE Transactions on Visualization and Computer Graphics 27(3), 2015-2027 (2020)", + "49. Zhou, J., Ma, B., Liu, Y.S., Fang, Y., Han, Z.: Learning consistency-aware unsigned distance functions progressively from raw point clouds. In: Advances in Neural Information Processing Systems (NeurIPS) (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 272 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "S. Li et al.", + "bbox": [ + 271, + 114, + 343, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_model.json b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_model.json new file mode 100644 index 0000000000000000000000000000000000000000..f6f25b5a84d75ebe6c645ddf72678087711609f1 --- /dev/null +++ b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_model.json @@ -0,0 +1,3008 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.245, + 0.141, + 0.761, + 0.186 + ], + "angle": 0, + "content": "Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.212, + 0.779, + 0.229 + ], + "angle": 0, + "content": "Shengtao \\(\\mathrm{Li}^{1,2}\\), Ge Gao\\(^{1,2(\\boxtimes)}\\), Yudong Liu\\(^{1,2}\\), Ming Gu\\(^{1,2}\\), and Yu-Shen Liu\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.247, + 0.239, + 0.756, + 0.268 + ], + "angle": 0, + "content": "1 Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China" + }, + { + "type": "text", + "bbox": [ + 0.292, + 0.268, + 0.709, + 0.325 + ], + "angle": 0, + "content": "\\(^{2}\\) School of Software, Tsinghua University, Beijing, China list21@mails.tsinghua.edu.cn, gaoge@tsinghua.edu.cn, liuyd23@mails.tsinghua.edu.cn, guming@tsinghua.edu.cn, liuyushen@tsinghua.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.358, + 0.744, + 0.595 + ], + "angle": 0, + "content": "Abstract. Neural signed distance functions (SDFs) have shown powerful ability in fitting the shape geometry. However, inferring continuous signed distance fields from discrete unoriented point clouds still remains a challenge. The neural network typically fits the shape with a rough surface and omits fine-grained geometric details such as shape edges and corners. In this paper, we propose a novel non-linear implicit filter to smooth the implicit field while preserving high-frequency geometry details. Our novelty lies in that we can filter the surface (zero level set) by the neighbor input points with gradients of the signed distance field. By moving the input raw point clouds along the gradient, our proposed implicit filtering can be extended to non-zero level sets to keep the promise consistency between different level sets, which consequently results in a better regularization of the zero level set. We conduct comprehensive experiments in surface reconstruction from objects and complex scene point clouds, the numerical and visual comparisons demonstrate our improvements over the state-of-the-art methods under the widely used benchmarks. Project page: https://list17.github.io/ImplicitFilter." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.606, + 0.741, + 0.634 + ], + "angle": 0, + "content": "Keywords: Implicit filtering \\(\\cdot\\) Signed distance functions \\(\\cdot\\) Point cloud reconstruction" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.659, + 0.377, + 0.675 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.809 + ], + "angle": 0, + "content": "Reconstructing surfaces from 3D point clouds is an important task in 3D computer vision. Recently signed distance functions (SDFs) learned by neural networks have been a widely used strategy for representing high-fidelity 3D geometry. These methods train the neural networks to predict the signed distance for every position in the space by signed distances from ground truth or inferred from the raw 3D point cloud. With the learned signed distance field, we can obtain the surface by running the marching cubes algorithm [27] to extract the zero level set." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Without signed distance ground truth, inferring the correct gradient and distance for each query point could be hard. Since the gradient of the neural" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.345, + 0.127 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.148, + 0.333, + 0.238 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.238, + 0.333, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.253, + 0.281, + 0.303, + 0.294 + ], + "angle": 0, + "content": "(a) Input" + }, + { + "type": "image", + "bbox": [ + 0.333, + 0.147, + 0.445, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.334, + 0.238, + 0.446, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.368, + 0.281, + 0.413, + 0.293 + ], + "angle": 0, + "content": "(b) SAP" + }, + { + "type": "image", + "bbox": [ + 0.446, + 0.147, + 0.558, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.447, + 0.238, + 0.558, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.479, + 0.281, + 0.531, + 0.293 + ], + "angle": 0, + "content": "(c) DIGS" + }, + { + "type": "image", + "bbox": [ + 0.559, + 0.147, + 0.671, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.238, + 0.671, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.578, + 0.281, + 0.657, + 0.293 + ], + "angle": 0, + "content": "(c) NeuralPull" + }, + { + "type": "image", + "bbox": [ + 0.671, + 0.147, + 0.785, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.672, + 0.238, + 0.784, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.704, + 0.281, + 0.755, + 0.293 + ], + "angle": 0, + "content": "(e) Ours" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.304, + 0.789, + 0.346 + ], + "angle": 0, + "content": "Fig. 1: Visualization of the comparisons on FAMOUS dataset [12]. Our implicit filter can improve the reconstruction by removing the noise and keeping the geometric details compared with other methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.38, + 0.789, + 0.546 + ], + "angle": 0, + "content": "network also indicates the direction in which the signed distance field changes, recent works [1,2,4,14,29,38] typically add constraints on the network gradient to learn a stable field. In terms of the rate at which the field is changing, the eikonal term [1,2,5,38] is widely used to ensure the norm of the gradient to be one everywhere. For the gradient direction constraint, some methods [4,10] use the direction from the query point to the nearest point on the surface as guidance. Leveraging the continuity of the neural network and the gradient constraint, all these methods could reconstruct discrete points. However, the continuity cannot guarantee the prediction is correct everywhere. Therefore, reconstructed surfaces of previous methods usually contain noise and ignore geometry details when there are not enough points to guide the reconstruction, as shown in Fig. 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.548, + 0.79, + 0.775 + ], + "angle": 0, + "content": "The above issue arises from the fact that these methods overlook the geometric information within the neighborhood but only focus on adding constraints on individual points to optimize the network. To resolve this issue, we introduce the bilateral filter for implicit fields that reduces surface noise while preserving the high-frequency geometric characteristics of the shape. Our designed implicit filter takes into account both the position of point clouds and the gradient of learned implicit fields. Based on the assumption of all input points lying on the surface, we can filter noise points on the zero level set by minimizing the weighted projection distance to gradients of the neighbor input points. Moreover, by moving the input points along the gradient of the field to other level sets, we can easily extend the filter to the whole field. This helps constrain the signed distance field near the surface and achieve better consistency through different level sets. To evaluate the effectiveness of our proposed implicit filtering, we validate it under widely used benchmarks including object and scene reconstructions. Our contributions are listed below." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.795, + 0.789, + 0.84 + ], + "angle": 0, + "content": "- We introduce the implicit filter on SDFs to smooth the surface while preserving geometry details for learning better neural networks to represent shapes or scenes." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.615, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.147, + 0.784, + 0.191 + ], + "angle": 0, + "content": "- We improve the implicit filter by extending it to non-zero level sets of signed distance fields. This regularization of the field aligns different level sets and provides better consistency within the whole SDF field." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.192, + 0.785, + 0.238 + ], + "angle": 0, + "content": "- Both object and scene reconstruction experiments validate our implicit filter, demonstrating its effectiveness and ability to produce high-fidelity reconstruction results, surpassing the previous state-of-the-art methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.263, + 0.388, + 0.279 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.296, + 0.784, + 0.356 + ], + "angle": 0, + "content": "With the rapid development of deep learning, neural networks have shown great potential in surface reconstruction from 3D point clouds. In the following, we briefly review methods related to implicit learning for 3D shapes and reconstructions from point clouds." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.357, + 0.785, + 0.476 + ], + "angle": 0, + "content": "Implicit Learning from 3D Supervision. The most commonly used strategy to train the neural network is to learn priors in a data-driven manner. These methods require signed distances or occupancy labels as 3D supervision to learn global priors [6,12,26,31,32] or local priors [7,17,18,22,35,40,41,44,45]. With large-scale training datasets, the neural network can perform well with similar shapes, but may not generalize well to unseen cases with large geometric variations. These models often have limited inputs that can be difficult to scale for varying sizes of point clouds." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.785, + 0.688 + ], + "angle": 0, + "content": "Implicit Learning from Raw Point Clouds. Different from the supervised methods, we can learn implicit functions by overfitting neural networks on single point clouds globally or locally to learn SDFs [1-4, 10, 21, 28, 30, 34]. These unsupervised methods rely on neural networks to infer implicit functions without learning any priors. Therefore, apart from the guidance of original input point clouds, we also need constraints on the direction [3, 4, 10, 21] or the norm [1, 2, 30] of the gradients, specially designed priors [3, 28], or differentiableoisson solver [34] to infer SDFs. This unsupervised approach heavily depends on the fitting capability and continuity of neural networks. However, these SDFs lack accuracy because there is no reliable guidance available for each query point across the entire space when working with discrete point clouds. Therefore, deducing the correct geometry for free space becomes particularly crucial. Our implicit filtering enhances SDFs by inferring the geometric details through the implicit field information of neighbor points." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Feature Preserving Point Cloud Reconstruction. Early works [16, 23, 33] reconstruct point clouds with sharp features usually by point cloud consolidation. The key idea of these methods is to enhance the quality of point clouds with sharp features. One popular category is the local projection operation (LOP) [25] and its variants [15, 16, 23, 36]. The projection operator provides a stable and easily generalizable method for point cloud filtering, which is also the foundation of our implicit filter. The difference lies in that we do not need any normal or other priors and our filtering can be directly applied to implicit fields to extract high-fidelity meshes. Some other learning-based methods [47, 48] try to consolidate point clouds with edge points in a data-driven manner. Although" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.128 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "capable of generating high-quality point clouds, these methods still require a proper reconstruction method [13] to inherit the details in meshes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.785, + 0.313 + ], + "angle": 0, + "content": "With the advancement of deep learning in point cloud reconstruction, some approaches [5,24,38,42] also explored employing neural networks to reconstruct high-precision models. FFN [39], SIREN [38], and IDF [43] introduce high-frequency features into the neural network in different ways to preserve the geometric details of the reconstructed shape. DIGS [5] and EPI [42] smooth the surface by using the divergence as guidance to alleviate the implicit surface roughness. Compared with these methods, we first introduce local geometric features through filtering to optimize the implicit field, so that we can achieve higher accuracy." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.335, + 0.331, + 0.351 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.366, + 0.784, + 0.44 + ], + "angle": 0, + "content": "Neural SDFs overview. This section will briefly describe the concepts we used in our implicit filtering. We focus on the SDF \\( f: \\mathbb{R}^3 \\to \\mathbb{R} \\) inferred from the point cloud \\( \\pmb{P} = \\{\\pmb{p}_i | \\pmb{p}_i \\in \\mathbb{R}^3\\}_{i=1}^N \\) without ground truth signed distances and normals. \\( f \\) predicts a signed distance \\( s \\in \\mathbb{R} \\) for an arbitrary query point \\( \\pmb{q} \\), as formulated by \\( s = f_{\\theta}(\\pmb{q}) \\), where \\( \\theta \\) denotes the parameters of the neural network." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.442, + 0.784, + 0.502 + ], + "angle": 0, + "content": "The level set \\( S_{d} \\) of SDF is defined as a set of continuous query points with the same signed distance \\( d \\), formulated as \\( S_{d} = \\{q|f_{\\theta}(q) = d\\} \\). The goal of our implicit filtering is to smooth each level set with geometry details. Then we can extract the zero level set as a mesh by running the marching cubes algorithm [27]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.523, + 0.633, + 0.614 + ], + "angle": 0, + "content": "Level set bilateral filtering. Filtering for 2D images replaces the intensity of each pixel with the weighted intensity values from nearby pixels. Different from images, the resolution of implicit fields is infinite and we need to find the neighborhood on each level set for filtering. By minimizing the following loss function," + }, + { + "type": "equation", + "bbox": [ + 0.341, + 0.624, + 0.631, + 0.664 + ], + "angle": 0, + "content": "\\[\nL _ {d i s t} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} | f _ {\\theta} (\\boldsymbol {p} _ {i}) |, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.633, + 0.764 + ], + "angle": 0, + "content": "we can approximate that all points in \\( \\pmb{P} \\) are located on level set \\( S_0 \\), which makes it feasible to find neighbor points on \\( S_0 \\). For a given point \\( \\bar{\\pmb{p}} \\) on \\( S_0 \\), one simple strategy of filtering is to average positions of neighbor points \\( \\mathcal{N}(\\bar{\\pmb{p}}, S_0) \\subset \\pmb{P} \\) on \\( S_0 \\) by a Gaussian filter based on relative positions as follows:" + }, + { + "type": "image", + "bbox": [ + 0.64, + 0.527, + 0.787, + 0.647 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.639, + 0.655, + 0.788, + 0.752 + ], + "angle": 0, + "content": "Fig.2: By minimizing the weighted projection distance, our filter can preserve the sharp feature but the average method leads to a wrong result." + }, + { + "type": "equation", + "bbox": [ + 0.358, + 0.774, + 0.785, + 0.814 + ], + "angle": 0, + "content": "\\[\n\\bar {\\boldsymbol {p}} _ {\\text {a v e r a g e}} = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , S _ {0})} \\boldsymbol {p} _ {j} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |)}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}}, S _ {0})} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |)}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.818, + 0.77, + 0.845 + ], + "angle": 0, + "content": "where the Gaussian function \\(\\phi\\) is defined as \\(\\phi (||\\bar{\\pmb{p}} -\\pmb {p}_j||) = \\exp \\left(-\\frac{||\\bar{\\pmb{p}} - \\pmb{p}_j||^2}{\\sigma_p^2}\\right)\\)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.615, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.143, + 0.788, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.236, + 0.784, + 0.306 + ], + "angle": 0, + "content": "Fig. 3: Overview of filtering the zero level set. (a) We assume all input points lying on the surface and compute gradients as normals. (b) Calculating bidirectional projection distances \\( d1 = |\\pmb{n}_{p_j}^T(\\bar{\\pmb{p}} - \\pmb{p}_j)| \\), \\( d2 = |\\pmb{n}_{\\bar{p}}^T(\\bar{\\pmb{p}} - \\pmb{p}_j)| \\) and the weights in Eq. (4). (c) By minimizing Eq. (4), we can remove the noise on the zero level set. The gradient \\( \\nabla f_\\theta \\) in this figure defaults to be regularized." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.335, + 0.785, + 0.456 + ], + "angle": 0, + "content": "However, as depicted in Fig. 2, it is evident that this weighted mean position yields excessively smooth surfaces, causing sharp features and details to be further obscured. To keep the geometric details, our filtering operator suggests measuring the projection distance to the gradient of neighbor points as shown in Fig. 2 and Fig. 3(b). When calculating weights, it is vital to account for both the impact of relative positions and the gradient similarity. Following the principles of bilateral filtering, to compute the filtered point for \\(\\bar{p}\\), we simply need to minimize the following distance equation:" + }, + { + "type": "equation", + "bbox": [ + 0.306, + 0.466, + 0.785, + 0.504 + ], + "angle": 0, + "content": "\\[\nd (\\bar {\\boldsymbol {p}}) = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , \\mathcal {S} _ {0})} \\left| \\boldsymbol {n} _ {p _ {j}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right| \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |) \\psi (\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}})}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , \\mathcal {S} _ {0})} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |) \\psi (\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}})}, \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.506, + 0.785, + 0.553 + ], + "angle": 0, + "content": "where the gradient \\(\\pmb{n}_{\\bar{p}}\\), \\(\\pmb{n}_{p_j}\\) and the Gaussian function \\(\\psi\\) are defined as \\(\\pmb{n}_{\\bar{p}} = \\frac{\\nabla f_{\\theta}(\\bar{p})}{||\\nabla f_{\\theta}(\\bar{p})||}, \\pmb{n}_{p_j} = \\frac{\\nabla f_{\\theta}(\\pmb{p}_j)}{||\\nabla f_{\\theta}(\\pmb{p}_j)||}, \\psi(\\pmb{n}_{\\bar{p}}, \\pmb{n}_{p_j}) = \\exp\\left(-\\frac{1 - \\pmb{n}_{\\bar{p}}^T \\pmb{n}_{p_j}}{1 - \\cos(\\sigma_n)}\\right)\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.785, + 0.612 + ], + "angle": 0, + "content": "In addition to projection to the gradient \\( \\pmb{n}_{p_j} \\), we observe that the projection distance to \\( \\pmb{n}_{\\bar{p}} \\) can assist in learning a more stable gradient for point \\( \\bar{p} \\) which is also adopted in EAR [16]. Taking into account the bidirectional projection, our final bilateral filtering operator can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.24, + 0.632, + 0.785, + 0.689 + ], + "angle": 0, + "content": "\\[\nd _ {b i} (\\bar {\\boldsymbol {p}}) = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , S _ {0})} \\left(\\left| \\boldsymbol {n} _ {p _ {j}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right| + \\left| \\boldsymbol {n} _ {\\bar {p}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right|\\right) \\phi \\left(\\left\\| \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} \\right\\|\\right) \\psi \\left(\\boldsymbol {n} _ {\\bar {p}} , \\boldsymbol {n} _ {p _ {j}}\\right)}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}}, S _ {0})} \\phi \\left(\\left\\| \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} \\right\\|\\right) \\psi \\left(\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}}\\right)}. \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.696, + 0.784, + 0.743 + ], + "angle": 0, + "content": "Although similar filtering methods have been widely studied in applications such as point cloud denoising and resampling [16, 48], there are two critical problems when applying these methods in implicit fields:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.75, + 0.788, + 0.843 + ], + "angle": 0, + "content": "1. Filtering the zero level set needs to sample points on the level set \\( S_0 \\), which necessitates the resolution of the equation \\( f_{\\theta} = 0 \\), or the utilization of the marching cubes algorithm [27]. Both methods pose challenges in achieving fast and uniform point sampling. For the randomly sampled point \\( \\mathbf{q} \\) on nonzero level set \\( S_{f_{\\theta}(\\mathbf{q})} \\), we can also not filter this level set since there are no neighbor points on \\( S_{f_{\\theta}(\\mathbf{q})} \\)." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.127 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.143, + 0.788, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.237, + 0.788, + 0.294 + ], + "angle": 0, + "content": "Fig. 4: Overview of sampling points. (a) Sampling query points near the surface. (b) Pulling the query point to the zero level set and input points to the level set where the query point is located. (c) Applying the filter on each level set. The gradient \\(\\nabla f_{\\theta}\\) in this figure defaults to be regularized." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.324, + 0.786, + 0.4 + ], + "angle": 0, + "content": "2. The normals utilized in our filtering are derived from the gradients of the neural network \\( f_{\\theta} \\). While the network typically offers reliable gradients, we may find that \\( \\nabla f_{\\theta} = 0 \\) is also the optimal solution to the minimum value of Eqs. (3) and (4). This degenerate solution is unexpected, as it implies a scenario where there is no surface when the gradient is zero everywhere." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.41, + 0.719, + 0.426 + ], + "angle": 0, + "content": "We will focus on addressing the two issues in the subsequent sections." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.45, + 0.785, + 0.495 + ], + "angle": 0, + "content": "Sampling points for filtering. Inspired by NeuralPull [4], we can pull a query point to the zero level set by the gradient of the neural network \\( f_{\\theta} \\). For a given query point \\( \\mathbf{q} \\) as input, the pulled location \\( \\hat{\\mathbf{q}} \\) can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.382, + 0.511, + 0.786, + 0.528 + ], + "angle": 0, + "content": "\\[\n\\hat {\\boldsymbol {q}} = \\boldsymbol {q} - f _ {\\theta} (\\boldsymbol {q}) \\nabla f _ {\\theta} (\\boldsymbol {q}) / | | \\nabla f _ {\\theta} (\\boldsymbol {q}) | |. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.627 + ], + "angle": 0, + "content": "The point \\(\\pmb{q}\\) and \\(\\hat{\\pmb{q}}\\) lie respectively on level set \\(S_{f_{\\theta}(q)}\\) and \\(S_0\\) as illustrate in Fig. 4(b). By adopting the sampling strategy in NeuralPull, we can generate samples \\(\\pmb{Q} = \\{\\pmb{q}_i|\\pmb{q}_i\\in \\pmb{R}^3\\}_{i = 1}^M\\) on different level sets near the surface and pull them to \\(S_0\\) by Eq. (5), to obtain \\(\\hat{\\pmb{Q}} = \\{\\hat{\\pmb{q}}_i|\\hat{\\pmb{q}}_i = \\pmb {q}_i - f_\\theta (\\pmb {q}_i)\\nabla f_\\theta (\\pmb {q}_i) / ||\\nabla f_\\theta (\\pmb {q}_i)||,\\pmb {q}_i\\in \\pmb {Q}\\}_{i = 1}^M\\). Hence, we can filter the zero level set by minimizing Eq. (4) across all pulled query points \\(\\hat{\\pmb{Q}}\\), which is equivalent to optimizing the following loss:" + }, + { + "type": "equation", + "bbox": [ + 0.418, + 0.64, + 0.787, + 0.666 + ], + "angle": 0, + "content": "\\[\nL _ {z e r o} = \\sum_ {\\hat {\\boldsymbol {q}} \\in \\hat {\\boldsymbol {Q}}} d _ {b i} (\\hat {\\boldsymbol {q}}), \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.673, + 0.785, + 0.703 + ], + "angle": 0, + "content": "where for each \\(\\hat{\\pmb{q}}\\in \\hat{\\mathcal{Q}}\\) \\(\\mathcal{N}(\\hat{\\pmb{q}},\\mathcal{S}_0)\\) denotes finding the neighbors of \\(\\hat{\\pmb{q}}\\) within the input points \\(\\pmb{P}\\), since \\(\\pmb{P}\\) is assumed to be located on \\(\\mathcal{S}_0\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.786, + 0.779 + ], + "angle": 0, + "content": "This filtering mechanism can be easily extended to non-zero level sets in a similar inverse manner. To be more specific, as for level set \\( S_{f_{\\theta}(\\pmb{q})} \\), the neighbor points for query point \\( \\pmb{q} \\in \\pmb{Q} \\) are required. These points should lie on the level set \\( S_{f_{\\theta}(\\pmb{q})} \\) same as \\( \\pmb{q} \\), allowing us to filter the level set \\( S_{f_{\\theta}(\\pmb{q})} \\) using the same filter as described in Eq. (4)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.843 + ], + "angle": 0, + "content": "However, obtaining \\(\\mathcal{N}(\\pmb{q}, S_{f_{\\theta}(q)})\\) in \\(\\pmb{P}\\) is not feasible, since all input points \\(\\pmb{P}\\) are situated on the zero level set instead of the \\(S_{f_{\\theta}(\\pmb{q})}\\) level set. To address this issue, we propose a technique for identifying neighbors of \\(\\pmb{q}\\) on level set \\(S_{f_{\\theta}(\\pmb{q})}\\), by projecting the input points \\(\\pmb{P}\\) inversely onto the specific level set \\(S_{f_{\\theta}(\\pmb{q})}\\) based" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.614, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.222 + ], + "angle": 0, + "content": "on the gradient, as depicted in Fig. 4(b). The projected neighbor points can be represented as in Eq. (7). Filtering across multiple level sets helps to enhance the performance of our method by optimizing the consistency between different level sets within the SDF field. We further showcase this evidence in the ablation study detailed in Section Sec. 4.4." + }, + { + "type": "equation", + "bbox": [ + 0.287, + 0.233, + 0.786, + 0.265 + ], + "angle": 0, + "content": "\\[\n\\mathcal {N} (\\boldsymbol {q}, S _ {f _ {\\theta} (q)}) = \\left\\{\\hat {\\boldsymbol {p}} \\mid \\hat {\\boldsymbol {p}} = \\boldsymbol {p} + f _ {\\theta} (\\boldsymbol {q}) \\frac {\\nabla f _ {\\theta} (\\boldsymbol {p})}{\\| \\nabla f _ {\\theta} (\\boldsymbol {p}) \\|}, \\boldsymbol {p} \\in \\mathcal {N} (\\hat {\\boldsymbol {q}}, \\mathcal {S} _ {0})) \\right\\}. \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.268, + 0.784, + 0.312 + ], + "angle": 0, + "content": "Based on the above analysis, we can filter the level sets \\( S_{f_{\\theta}(q)} \\) by minimizing Eq. (4) over all sample points \\( Q \\) through Eq. (7), equivalent to optimizing the following loss:" + }, + { + "type": "equation", + "bbox": [ + 0.417, + 0.313, + 0.786, + 0.338 + ], + "angle": 0, + "content": "\\[\nL _ {\\text {f i e l d}} = \\sum_ {\\boldsymbol {q} \\in \\boldsymbol {Q}} d _ {b i} (\\boldsymbol {q}). \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.34, + 0.492, + 0.475 + ], + "angle": 0, + "content": "It is worth noting that for a fixed query point \\( \\pmb{q} \\), the pulled query point \\( \\hat{\\pmb{q}} \\) dynamically changes when training the neural network, which results in a time-consuming process to repeatedly conduct neighbor searching for \\( \\hat{\\pmb{q}} \\). To handle this matter, we substitute the \\( \\mathcal{N}(\\hat{\\pmb{q}},\\mathcal{S}_0) \\) with \\( \\mathcal{N}(NN(\\pmb {q}),\\mathcal{S}_0) \\), where \\( NN(\\pmb {q}) \\) denotes the nearest point of \\( \\pmb{q} \\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.476, + 0.784, + 0.52 + ], + "angle": 0, + "content": "within the point cloud \\( \\pmb{P} \\) as shown in Fig. 5. While this substitution may introduce a slight bias for training, it also ensures the neighbor points are close to \\( \\hat{\\pmb{q}} \\), therefore this trade-off between efficiency and accuracy is reasonable." + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.342, + 0.788, + 0.414 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.498, + 0.424, + 0.785, + 0.466 + ], + "angle": 0, + "content": "Fig.5: (a) Searching neighbors directly for \\(\\hat{q}\\). (b) Searching neighbors for \\(NN(q)\\) instead of \\(\\hat{q}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.539, + 0.784, + 0.644 + ], + "angle": 0, + "content": "Gradient constraint. The other problem of implicit filtering is gradient degeneration. Overfitting the neural network requires the SDF to be geometrically initialized. We can consider the initialized implicit field as the noisy field and apply our filter directly to train the network from the beginning to fit the raw point cloud by removing the 'noise'. However, if the denoise target is too complex, gradient degeneration will occur during the training process. Therefore, we need to add a constraint to the gradient of the SDF." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.645, + 0.784, + 0.703 + ], + "angle": 0, + "content": "There are two ways for training the neural network to pull query points onto the surface based on NeuralPull [4] and CAP-UDF [49]. One is minimizing the distance between the pulled point \\(\\hat{\\pmb{q}}\\) and the nearest point \\(NN(\\pmb{q})\\) as formulated below:" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.715, + 0.786, + 0.754 + ], + "angle": 0, + "content": "\\[\nL _ {p u l l} = \\frac {1}{M} \\sum_ {i \\in [ 1, M ]} | | \\hat {\\boldsymbol {q}} _ {i} - N N (\\boldsymbol {q} _ {i}) | | _ {2}. \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.757, + 0.784, + 0.787 + ], + "angle": 0, + "content": "The other is minimizing the Chamfer distance between moved query points and the raw point cloud:" + }, + { + "type": "equation", + "bbox": [ + 0.25, + 0.805, + 0.786, + 0.843 + ], + "angle": 0, + "content": "\\[\nL _ {C D} = \\frac {1}{M} \\sum_ {i \\in [ 1, M ]} \\min _ {j \\in [ 1, N ]} | | \\hat {\\boldsymbol {q}} _ {i} - \\boldsymbol {p} _ {j} | | _ {2} + \\frac {1}{N} \\sum_ {j \\in [ 1, N ]} \\min _ {i \\in [ 1, M ]} | | \\boldsymbol {p} _ {j} - \\hat {\\boldsymbol {q}} _ {i} | | _ {2}. \\tag {10}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.128 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.222 + ], + "angle": 0, + "content": "A stable SDF can be trained by the losses above since they are trying to move the query points to be in the same distribution with the point cloud, which can provide the constraint for our implicit filter. Here we choose \\( L_{CD} \\) since the filtered points are likely not the nearest points and \\( L_{CD} \\) is a more relaxed constraint." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.244, + 0.644, + 0.26 + ], + "angle": 0, + "content": "Loss function. Finally, our loss function is formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.353, + 0.271, + 0.786, + 0.288 + ], + "angle": 0, + "content": "\\[\nL = L _ {z e r o} + \\alpha_ {1} L _ {\\text {f i e l d}} + \\alpha_ {2} L _ {\\text {d i s t}} + \\alpha_ {3} L _ {C D}, \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.297, + 0.742, + 0.313 + ], + "angle": 0, + "content": "where \\(\\alpha_{1},\\alpha_{2}\\), and \\(\\alpha_{3}\\) is the balance weights for our implicit filtering loss." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.333, + 0.788, + 0.429 + ], + "angle": 0, + "content": "Implementation details. We employ a neural network similar to OccNet [31] and the geometric network initialization proposed in SAL [1] with a smaller radius the same as GridPull [10] to learn the SDF. We use the strategy in NeuralPull [4] to sample queries around each point \\(\\pmb{p}\\) in \\(\\pmb{P}\\). We set the weight \\(\\alpha_{3}\\) to 10 to constrain the learned SDF and \\(\\alpha_{1}\\) and \\(\\alpha_{2}\\) to 1. The parameters \\(\\sigma_{n},\\sigma_{p}\\) are set to \\(15^{\\circ}\\), \\(\\max_{\\pmb {p}_j\\in \\mathcal{N}(\\bar{\\pmb{p}},S_{f_\\theta (\\bar{p})})}(||\\bar{\\pmb{p}} -\\pmb {p}_j||)\\) respectively." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.447, + 0.377, + 0.464 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.788, + 0.554 + ], + "angle": 0, + "content": "We conducted experiments to assess the performance of our implicit filter for surface reconstruction from raw point clouds. The results are presented for general shapes in Sec. 4.1, real scanned raw data including 3D objects in Sec. 4.2, and complex scenes in Sec. 4.3. Additionally, ablation experiments were carried out to validate the theory and explore the impact of various parameters in Sec. 4.4." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.575, + 0.547, + 0.59 + ], + "angle": 0, + "content": "4.1 Surface Reconstruction for Shapes" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.599, + 0.416, + 0.612 + ], + "angle": 0, + "content": "Datasets and metrics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.419, + 0.794 + ], + "angle": 0, + "content": "For surface reconstruction of general shapes from raw point clouds, we conduct evaluations on three widely used datasets including a subset of ShapeNet [8], ABC [20], and FAMOUS [12]. We use the same setting with NeuralPull [4] for the dataset ShapeNet. For datasets ABC and FAMOUS, we use the train/test" + }, + { + "type": "table_caption", + "bbox": [ + 0.426, + 0.617, + 0.785, + 0.645 + ], + "angle": 0, + "content": "Table 1: Comparisons on ABC and Famous datasets. The threshold of F-score (F-S.) is 0.01." + }, + { + "type": "table", + "bbox": [ + 0.43, + 0.646, + 0.782, + 0.774 + ], + "angle": 0, + "content": "
MethodsABCFAMOUS
CDL2CDL1F-S.CDL2CDL1F-S.
P2S [12]0.2980.0150.5980.0120.0080.752
IGR [14]2.6750.0630.4481.4740.0440.573
NP [4]0.0950.0110.6730.1000.0120.746
PCP [3]0.2520.0230.3730.0370.0140.435
SIREN [38]0.0220.0120.4930.0250.0120.561
DIGS [5]0.0210.0100.6670.0150.0080.772
Ours0.0110.0090.6910.0080.0070.778
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.84 + ], + "angle": 0, + "content": "splitting released by Points2Surf [12] and we sample points directly from the mesh in the ABC dataset without other mesh preprocessing to keep the sharp features." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.615, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.784, + 0.386 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.394, + 0.788, + 0.435 + ], + "angle": 0, + "content": "Fig. 6: Visual comparisons of surface reconstruction on ABC and FAMOUS datasets. Our method can reconstruct objects with sharp edges and less noise compared with other methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.467, + 0.788, + 0.572 + ], + "angle": 0, + "content": "For evaluating the performance, we follow NeuralPull to sample \\(1 \\times 10^{5}\\) points from the reconstructed surfaces and the ground truth meshes on the ShapeNet dataset and sample \\(1 \\times 10^{4}\\) on the ABC and FAMOUS datasets. For the evaluation metrics, we use L1 and L2 Chamfer distance (\\(CD_{L1}\\) and \\(CD_{L2}\\)) to measure the error. Moreover, we adopt normal consistency (NC) and F-score to evaluate the accuracy of the reconstructed surface, the threshold is the same with NeuralPull." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.492, + 0.81 + ], + "angle": 0, + "content": "Comparisons. To evaluate the validity of our implicit filter, we compare our method with a variety of methods including SPSR [19], Points2Surf (P2S) [12], IGR [14], NeuralPull (NP) [4], LPI [9], PCP [3], GridPull (GP) [10], SIREN [38], DIGs [5]. The quantitative results on ABC and FAMOUS datasets are shown in Tab. 1, and selectively visualized in Fig. 6. Our model reaches state-of-the-art performance on both datasets, accomplishing the goal of eliminating noise on each level set while preserving the ge" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "ometric details. To more intuitively validate the efficacy of our filtering, we visualize the level sets on a cross section in Fig. 7. We also report the results on" + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.602, + 0.778, + 0.771 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.498, + 0.781, + 0.788, + 0.809 + ], + "angle": 0, + "content": "Fig. 7: Visualization of level sets on a cross section." + }, + { + "type": "text", + "bbox": [ + 0.5, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "idate the efficacy of our filtering, we viin Fig. 7. We also report the results on" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.127 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.35, + 0.145, + 0.651, + 0.16 + ], + "angle": 0, + "content": "Table 2: Comparisons on ShapeNet dataset." + }, + { + "type": "table", + "bbox": [ + 0.278, + 0.171, + 0.721, + 0.246 + ], + "angle": 0, + "content": "
SPSR [19]NP [4]LPI [9]PCP [3]GP [10]Ours
CDL2 × 1000.2860.0380.01710.01360.00860.0032
NC0.8660.9390.95960.95900.97230.9779
F-Score (0.002)0.4070.9610.99120.98710.98960.9976
F-Score (0.004)0.6180.9760.99570.98990.99230.9985
" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.269, + 0.774, + 0.436 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.251, + 0.446, + 0.747, + 0.46 + ], + "angle": 0, + "content": "Fig. 8: Visual comparisons of surface reconstruction on ShapeNet dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.487, + 0.785, + 0.576 + ], + "angle": 0, + "content": "ShapeNet which contains over 3000 objects in terms of \\( CD_{L2} \\), NC, and F-Score with thresholds of 0.002 and 0.004 in Tab. 2. The detailed comparison for each class of ShapeNet can be found in the supplementary material. Our method outperforms previous methods over most classes. The visualization comparisons in Fig. 8 show that our method can reconstruct a smoother surface with fine details." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.578, + 0.785, + 0.684 + ], + "angle": 0, + "content": "To validate the effect of our filter on sharp geometric features. We evaluate the edge points by the edge Chamfer distance metric used in [11]. We sample 100k points uniformly on the surface of both the reconstructed mesh and ground truth. The edge point \\(\\pmb{p}\\) is calculated by finding whether there exists a point \\(\\pmb{q} \\in \\mathcal{N}_{\\epsilon}(\\pmb{p})\\) satisfied \\(|\\pmb{n}_q\\pmb{n}_p| < \\sigma\\), where \\(\\mathcal{N}_{\\epsilon}(\\pmb{p})\\) represents the neighbor points within distance \\(\\epsilon\\) from \\(\\pmb{p}\\). The results are shown in Tab. 3 and visualized in Fig. 9. We set \\(\\epsilon = 0.01\\) and \\(\\sigma = 0.1\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.704, + 0.578, + 0.719 + ], + "angle": 0, + "content": "4.2 Surface Reconstruction for Real Scans" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.727, + 0.784, + 0.818 + ], + "angle": 0, + "content": "Dataset and metrics. For surface reconstruction of real point cloud scans, we follow VisCo [37] to evaluate our method under the Surface Reconstruction Benchmarks (SRB) [46]. We use Chamfer and Hausdorff distances \\((CD_{L1}\\) and HD) between the reconstruction meshes and the ground truth. Furthermore, we report their corresponding one-sided distances \\((d_{\\vec{C}}\\) and \\(d_{\\vec{H}})\\) between the reconstructed meshes and the input noisy point cloud." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.615, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.238, + 0.145, + 0.763, + 0.159 + ], + "angle": 0, + "content": "Table 3: Edge Chamfer distance comparisons on ABC dataset, \\( {ECD}_{L2} \\times {100} \\) ." + }, + { + "type": "table", + "bbox": [ + 0.257, + 0.171, + 0.742, + 0.218 + ], + "angle": 0, + "content": "
MethodsP2S [12]IGR [14]NP [4]PCP [3]SIREN [38]DIGS [5]Ours
ECDL10.04960.08350.05010.06280.06950.07860.0256
ECDL21.0552.3651.2551.2651.4072.4930.399
" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.233, + 0.777, + 0.453 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.271, + 0.462, + 0.731, + 0.476 + ], + "angle": 0, + "content": "Fig. 9: Visual comparisons of edge points and reconstruction results." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.509, + 0.434, + 0.643 + ], + "angle": 0, + "content": "Comparisons. We compare our method with state-of-the-art methods under the real scanned SRB dataset, including IGR [14], SPSR [19], Shape As Points (SAP) [34], NeuralPull (NP) [4], and GridPull (GP) [10]. The numerical comparisons are shown in Table 2." + }, + { + "type": "image", + "bbox": [ + 0.447, + 0.516, + 0.581, + 0.591 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.462, + 0.595, + 0.503, + 0.606 + ], + "angle": 0, + "content": "(a) Input" + }, + { + "type": "image", + "bbox": [ + 0.583, + 0.516, + 0.648, + 0.595 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.592, + 0.595, + 0.635, + 0.605 + ], + "angle": 0, + "content": "(c) SPSR" + }, + { + "type": "image", + "bbox": [ + 0.65, + 0.517, + 0.715, + 0.589 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.651, + 0.595, + 0.713, + 0.605 + ], + "angle": 0, + "content": "(d) NeuralPull" + }, + { + "type": "image", + "bbox": [ + 0.716, + 0.518, + 0.782, + 0.589 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.727, + 0.595, + 0.767, + 0.605 + ], + "angle": 0, + "content": "(e) Ours" + }, + { + "type": "image_caption", + "bbox": [ + 0.462, + 0.616, + 0.765, + 0.631 + ], + "angle": 0, + "content": "Fig. 10: Visual comparisons on SRB dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.645, + 0.785, + 0.689 + ], + "angle": 0, + "content": "in Tab. 4, where we achieve the best accuracy in most cases. The visual comparisons in Fig. 10 demonstrate that our method can reconstruct a continuous and smooth surface with geometry details." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.719, + 0.544, + 0.733 + ], + "angle": 0, + "content": "4.3 Surface Reconstruction for Scenes" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Dataset and metrics. To further demonstrate the advantage of our method in the surface reconstruction of real scene scans, we conduct experiments using the 3D Scene dataset. The 3D Scene dataset is a challenging real-world dataset with complex topology and noisy open surfaces. We uniformly sample 1000 points per \\( m^2 \\) of each scene as the input and follow PCP [3] to sample 1M points on both the reconstructed and the ground truth surfaces. We leverage L1 and L2" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.127 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.366, + 0.145, + 0.634, + 0.159 + ], + "angle": 0, + "content": "Table 4: Comparisons on SRB dataset." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.172, + 0.784, + 0.419 + ], + "angle": 0, + "content": "
SPSR [19]IGR [14]SIREN [38]VisCo [37]SAP [34]NP [4]GP [10]DIGS [5]Ours
AnchorCDL10.600.220.320.210.120.1220.0930.0630.052
HD14.894.718.193.002.383.2431.8041.4471.232
dC0.600.120.100.150.080.0610.0660.0300.025
dH14.891.322.4321.070.833.2080.4600.2700.265
DaratechCDL10.440.250.210.210.260.3750.0620.0490.051
HD7.244.014.304.060.873.1270.6480.8580.751
dC0.440.080.090.140.040.7460.0390.0250.028
dH7.241.591.771.760.413.2670.2930.4410.423
DCCDL10.270.170.150.150.070.1570.0660.0420.041
HD3.102.222.182.221.173.5411.1030.6670.815
dC0.270.090.060.090.040.2420.0360.0220.019
dH3.102.612.762.760.533.5230.5390.7290.724
GargoyleCDL10.260.160.170.170.070.0800.0630.0470.044
HD6.803.524.644.401.491.3761.1290.9711.089
dC0.260.060.080.110.050.0630.0450.0280.022
dH6.800.810.910.960.780.4750.7000.2710.246
Lord QuasCDL10.200.120.170.120.050.0640.0470.0310.030
HD4.611.170.821.060.980.8220.5690.4960.554
dC0.200.070.120.070.040.0530.0310.0170.014
dH4.610.980.760.640.510.5080.3700.1810.230
" + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.451, + 0.335, + 0.505 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.506, + 0.335, + 0.559 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.248, + 0.56, + 0.313, + 0.573 + ], + "angle": 0, + "content": "(a) GridPull" + }, + { + "type": "image", + "bbox": [ + 0.336, + 0.452, + 0.444, + 0.506 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.336, + 0.507, + 0.446, + 0.559 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.369, + 0.56, + 0.413, + 0.573 + ], + "angle": 0, + "content": "(b) PCP" + }, + { + "type": "image", + "bbox": [ + 0.449, + 0.452, + 0.556, + 0.506 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.449, + 0.507, + 0.555, + 0.559 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.463, + 0.56, + 0.54, + 0.573 + ], + "angle": 0, + "content": "(c) NeuralPull" + }, + { + "type": "image", + "bbox": [ + 0.561, + 0.452, + 0.666, + 0.506 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.507, + 0.666, + 0.559 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.59, + 0.56, + 0.638, + 0.573 + ], + "angle": 0, + "content": "(d) Ours" + }, + { + "type": "image", + "bbox": [ + 0.67, + 0.451, + 0.78, + 0.506 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.67, + 0.507, + 0.778, + 0.559 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.705, + 0.56, + 0.742, + 0.573 + ], + "angle": 0, + "content": "(e) GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.25, + 0.583, + 0.751, + 0.597 + ], + "angle": 0, + "content": "Fig. 11: Visual comparisons of surface reconstruction on 3D Scene dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.788, + 0.661 + ], + "angle": 0, + "content": "Chamfer distance \\((CD_{L1}, CD_{L2})\\) and normal consistency (NC) to evaluate the reconstruction quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Comparisons. We compare our method with the state-of-the-art methods ConvONet [35], LIG [18], DeepLS [7], NeuralPull (NP) [4], PCP [3], GridPull (GP) [10]. The numerical comparisons in Tab. 5 demonstrate our superior performance in all scenes even compared with the local-based methods. We further present visual comparisons in Fig. 11. The visualization further shows that our method can achieve smoother with high-fidelity surfaces in complex scenes. It should be noted that the surface we extract here is not the zero level set but the 0.001 level set since the scene is not watertight. For NeuralPull we use the threshold of 0.005 instead of 0.001 to extract the complete surface therefore the mesh looks thicker." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.615, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.303, + 0.145, + 0.699, + 0.16 + ], + "angle": 0, + "content": "Table 5: Comparisons on 3D Scene dataset, \\(CD_{L2} \\times 1000\\)." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.171, + 0.784, + 0.267 + ], + "angle": 0, + "content": "
BurghersLoungeCopyroomStonewallTotempole
CDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NC
ConvONet [35]27.460.0790.9079.540.0460.89410.970.0450.89220.460.0690.9052.0540.0210.943
LIG [18]3.0550.0450.8359.6720.0560.8333.610.0360.8105.0320.0420.8799.580.0620.887
DeepLS [7]0.4010.0170.9206.1030.0530.8480.6090.0210.9010.3200.0150.9540.6010.0170.950
GP [10]1.3670.0280.8734.6840.0530.8272.3270.0300.8572.2340.0240.9132.2780.0340.878
PCP [3]1.3390.0310.9290.4320.0140.9340.4050.0140.9140.2660.0140.9571.0890.0290.954
NP [4]0.8970.0250.8830.8550.0220.8870.4790.0180.8620.4340.0180.9291.6040.0320.923
Ours0.1330.0110.9340.1200.0080.9260.1110.0090.9130.0820.0090.9570.2030.0130.944
" + }, + { + "type": "image", + "bbox": [ + 0.227, + 0.283, + 0.323, + 0.359 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.239, + 0.361, + 0.314, + 0.371 + ], + "angle": 0, + "content": "(a) Input Points" + }, + { + "type": "image", + "bbox": [ + 0.325, + 0.283, + 0.432, + 0.36 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.354, + 0.361, + 0.396, + 0.371 + ], + "angle": 0, + "content": "(b) \\(L_{\\text{pull}}\\)" + }, + { + "type": "image", + "bbox": [ + 0.433, + 0.283, + 0.538, + 0.36 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.465, + 0.361, + 0.5, + 0.371 + ], + "angle": 0, + "content": "(c) \\(L_{CD}\\)" + }, + { + "type": "image", + "bbox": [ + 0.538, + 0.283, + 0.645, + 0.36 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.55, + 0.361, + 0.626, + 0.372 + ], + "angle": 0, + "content": "(c) \\(L_{CD} + L_{zero}\\)" + }, + { + "type": "image", + "bbox": [ + 0.645, + 0.283, + 0.782, + 0.36 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.643, + 0.361, + 0.759, + 0.372 + ], + "angle": 0, + "content": "(d) \\(L_{CD} + L_{zero} + L_{field}\\)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.383, + 0.785, + 0.411 + ], + "angle": 0, + "content": "Fig. 12: The 2D level sets show the distance field learned by different losses. The red lines represent the learned zero level set." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.444, + 0.401, + 0.457 + ], + "angle": 0, + "content": "4.4 Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.475, + 0.784, + 0.537 + ], + "angle": 0, + "content": "We conduct ablation studies on the FAMOUS dataset to demonstrate the effectiveness of our proposed implicit filter and explore the effect of some important hyperparameters. We report the performance in terms of L1 and L2 Chamfer distance \\((CD_{L1}, CD_{L2} \\times 10^{3})\\), normal consistency (NC), and F-Score (F-S.)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.538, + 0.434, + 0.627 + ], + "angle": 0, + "content": "Effect of Eikonal loss. We select the \\(L_{CD}\\) to prevent the degeneration of the gradient since it both constrains the value and the gradient of the SDF. It also guides how to pull" + }, + { + "type": "table_caption", + "bbox": [ + 0.491, + 0.543, + 0.738, + 0.556 + ], + "angle": 0, + "content": "Table 6: Effect of the Eikonal term." + }, + { + "type": "table", + "bbox": [ + 0.451, + 0.557, + 0.772, + 0.617 + ], + "angle": 0, + "content": "
LossCDL1CDL2F-S.NC
w/ Eikonal, w/o CD0.0090.0210.7380.899
w/ Eikonal, w/ CD0.0080.0090.7740.910
w/o Eikonal, w/ CD0.0070.0080.7780.911
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.628, + 0.785, + 0.732 + ], + "angle": 0, + "content": "the query point onto the surface. Therefore we omit the Eikonal term used in previous methods like the IGR [14], SIREN [38], and DIGS [5] which have no other direct supervision for the gradient. To verify this selection, we conduct the following experiments by trade-off these two functions. With the experimental results in Tab. 6, we find that only applying the Eikonal term is not as effective as CD alone. At the same time combining the Eikonal term with CD does not further enhance the experiment results, but the difference is small." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Effect of level set filtering. To justify the effectiveness of each term in our loss function. We report the results trained by different combinations in Tab. 7. The \\( L_{CD} \\) is more applicable for training SDF from raw point clouds. The zero-level filter can help remove the noise and keep the geometric features. Filtering across non-zero level sets can improve the overall consistency of the entire signed distance field. Since we assume all input points lie on the surface, the function \\( L_{dist} \\) is also necessary. Fig. 12 shows a 2D comparison of these losses, showing" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.127 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "that our filter loss functions can reconstruct a field that is aligned at all level sets and maintains geometric characteristics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.784, + 0.238 + ], + "angle": 0, + "content": "Effect of the bidirectional projection. To validate our bidirectional projection distance, we report the results in Tab. 8. The numerical comparisons show that projecting the distance to both normals can improve the reconstruction quality. Note that only using \\( d(\\bar{p}) \\) can also improve the results." + }, + { + "type": "table_caption", + "bbox": [ + 0.272, + 0.246, + 0.503, + 0.259 + ], + "angle": 0, + "content": "Table 7: Effect of different losses." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.272, + 0.543, + 0.361 + ], + "angle": 0, + "content": "
LossCDL1CDL2F-S.NC
Lpull0.0120.0830.7420.884
LCD0.0100.0310.7570.891
LCD + Lzero0.0080.0180.7720.905
LCD + Lzero + Lfield0.0080.0110.7690.908
Ours0.0070.0080.7780.911
" + }, + { + "type": "table_caption", + "bbox": [ + 0.56, + 0.239, + 0.763, + 0.268 + ], + "angle": 0, + "content": "Table 8: Effect of bidirectional projection." + }, + { + "type": "table", + "bbox": [ + 0.594, + 0.279, + 0.726, + 0.354 + ], + "angle": 0, + "content": "
d(¯¯¯¯p)dbi(¯¯¯¯p)
CDL10.0100.007
CDL20.0240.008
F-S.0.7260.778
NC0.8900.911
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.363, + 0.785, + 0.483 + ], + "angle": 0, + "content": "Weight of level set projection loss. We explore the effect of the \\(L_{CD}\\) loss function by adjusting the weight \\(\\alpha_{3}\\) in Eq. (11). We report our results with different candidates \\(\\{0, 1, 10\\}\\) in Tab. 9, where 0 means we do not use the \\(L_{CD}\\) to constrain the gradient. The comparisons in Tab. 9 show that although our implicit filter can directly learn SDFs, it is better to adopt the \\(L_{CD}\\) for a more stable field. However, if the weight is too large, the filtering effect will decrease. It is recommended to select weights ranging from 1 to 10, which is usually adequate. For the weights \\(\\alpha_{1}\\) and \\(\\alpha_{2}\\), setting them to 1 is always necessary." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.484, + 0.785, + 0.543 + ], + "angle": 0, + "content": "Effect of filter parameters. We compare the effect of different parameters \\(\\sigma_{n},\\sigma_{p}\\) in Tab. 10. The diagonal weight for \\(\\sigma_{p}\\) means the length of the diagonal of the bounding box for the local patch mentioned in [48]. The results indicate that the method is relatively robust to parameter variation in a certain range." + }, + { + "type": "table_caption", + "bbox": [ + 0.464, + 0.544, + 0.778, + 0.559 + ], + "angle": 0, + "content": "Table 10: Effect of filter parameters \\( {\\sigma }_{n} \\) and \\( {\\sigma }_{p} \\) ." + }, + { + "type": "table_caption", + "bbox": [ + 0.236, + 0.558, + 0.44, + 0.572 + ], + "angle": 0, + "content": "Table 9: Effect of weight \\( {\\alpha }_{3} \\) ." + }, + { + "type": "table", + "bbox": [ + 0.235, + 0.584, + 0.443, + 0.66 + ], + "angle": 0, + "content": "
α3CDL1CDL2F-S.NC
00.0080.0130.7580.903
10.0070.0110.7720.910
100.0070.0080.7780.911
1000.0080.0090.7740.909
" + }, + { + "type": "table", + "bbox": [ + 0.489, + 0.571, + 0.752, + 0.673 + ], + "angle": 0, + "content": "
CDL1CDL2F-S.NC
σn15°0.0070.0080.7780.911
30°0.0070.0110.7710.907
45°0.0080.0120.7640.903
60°0.0080.0100.7670.901
σpmax0.0070.0080.7780.911
diagonal0.0080.0110.7630.904
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.701, + 0.359, + 0.716 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.785, + 0.84 + ], + "angle": 0, + "content": "We introduce implicit filtering on SDFs to reduce the noise of the signed distance field while preserving geometry features. We filter the distance field by minimizing the weighted bidirectional projection distance, where we can generate sampling points on the zero level set and neighbor points on non-zero level sets by the pulling procedure. By leveraging the Chamfer distance, we address the issue of gradient degeneration problem. The visual and numerical comparisons demonstrate our effectiveness and superiority over state-of-the-art methods." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.615, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.207 + ], + "angle": 0, + "content": "The corresponding author is Ge Gao. This work was supported by Beijing Science and Technology Program (Z231100001723014)." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.23, + 0.323, + 0.245 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.26, + 0.784, + 0.3 + ], + "angle": 0, + "content": "1. Atzmon, M., Lipman, Y.: Sal: Sign agnostic learning of shapes from raw data. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.302, + 0.785, + 0.329 + ], + "angle": 0, + "content": "2. Atzmon, M., Lipman, Y.: SALD: sign agnostic learning with derivatives. In: 9th International Conference on Learning Representations, ICLR 2021 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.33, + 0.785, + 0.384 + ], + "angle": 0, + "content": "3. Baorui, M., Yu-Shen, L., Matthias, Z., Zhizhong, H.: Surface reconstruction from point clouds by learning predictive context priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.385, + 0.785, + 0.426 + ], + "angle": 0, + "content": "4. Baorui, M., Zhizhong, H., Yu-Shen, L., Matthias, Z.: Neural-pull: Learning signed distance functions from point clouds by learning to pull space onto surfaces. In: International Conference on Machine Learning (ICML) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.427, + 0.785, + 0.481 + ], + "angle": 0, + "content": "5. Ben-Shabat, Y., Hewa Koneputugodage, C., Gould, S.: Digs: Divergence guided shape implicit neural representation for unoriented point clouds. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19323-19332 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.482, + 0.785, + 0.523 + ], + "angle": 0, + "content": "6. Boulch, A., Marlet, R.: Poco: Point convolution for surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6302-6314 (June 2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.524, + 0.785, + 0.579 + ], + "angle": 0, + "content": "7. Chabra, R., Lenssen, J.E., Ilg, E., Schmidt, T., Straub, J., Lovegrove, S., Newcombe, R.: Deep local shapes: Learning local sdf priors for detailed 3d reconstruction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIX 16. pp. 608-625. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.579, + 0.785, + 0.647 + ], + "angle": 0, + "content": "8. Chang, A.X., Funkhouser, T., Guibas, L., Hanrahan, P., Huang, Q., Li, Z., Savarese, S., Savva, M., Song, S., Su, H., Xiao, J., Yi, L., Yu, F.: ShapeNet: An Information-Rich 3D Model Repository. Tech. Rep. arXiv:1512.03012 [cs.GR], Stanford University — Princeton University — Toyota Technological Institute at Chicago (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.648, + 0.785, + 0.674 + ], + "angle": 0, + "content": "9. Chao, C., Yu-shen, L., Zhizhong, H.: Latent partition implicit with surface codes for 3d representation. In: European Conference on Computer Vision (ECCV) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.675, + 0.785, + 0.716 + ], + "angle": 0, + "content": "10. Chen, C., Liu, Y.S., Han, Z.: Gridpull: Towards scalability in learning implicit representations from 3d point clouds. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.717, + 0.785, + 0.757 + ], + "angle": 0, + "content": "11. Chen, Z., Tagliasacchi, A., Zhang, H.: Bsp-net: Generating compact meshes via binary space partitioning. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.758, + 0.785, + 0.813 + ], + "angle": 0, + "content": "12. Eler, P., Guerrero, P., Ohrhallinger, S., Mitra, N.J., Wimmer, M.: Points2Surf: Learning implicit surfaces from point clouds. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.M. (eds.) Computer Vision - ECCV 2020. pp. 108-124. Springer International Publishing, Cham (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "13. Fleishman, S., Cohen-Or, D., Silva, C.T.: Robust moving least-squares fitting with sharp features. ACM transactions on graphics (TOG) 24(3), 544-552 (2005)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.26, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.127 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.188 + ], + "angle": 0, + "content": "14. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. In: Proceedings of Machine Learning and Systems 2020, pp. 3569-3579 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.785, + 0.23 + ], + "angle": 0, + "content": "15. Huang, H., Li, D., Zhang, H., Ascher, U., Cohen-Or, D.: Consolidation of unorganized point clouds for surface reconstruction. ACM transactions on graphics (TOG) 28(5), 1-7 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.23, + 0.785, + 0.257 + ], + "angle": 0, + "content": "16. Huang, H., Wu, S., Gong, M., Cohen-Or, D., Ascher, U., Zhang, H.: Edge-aware point set resampling. ACM transactions on graphics (TOG) 32(1), 1-12 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.257, + 0.785, + 0.297 + ], + "angle": 0, + "content": "17. Huang, J., Gojcic, Z., Atzmon, M., Litany, O., Fidler, S., Williams, F.: Neural kernel surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4369-4379 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.297, + 0.785, + 0.338 + ], + "angle": 0, + "content": "18. Jiang, C.M., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T.: Local implicit grid representations for 3d scenes. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.338, + 0.785, + 0.365 + ], + "angle": 0, + "content": "19. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.365, + 0.785, + 0.42 + ], + "angle": 0, + "content": "20. Koch, S., Matveev, A., Jiang, Z., Williams, F., Artemov, A., Burnaev, E., Alexa, M., Zorin, D., Panozzo, D.: Abc: A big cad model dataset for geometric deep learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9601-9611 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.42, + 0.785, + 0.473 + ], + "angle": 0, + "content": "21. Koneputugodage, C.H., Ben-Shabat, Y., Campbell, D., Gould, S.: Small steps and level sets: Fitting neural surface models with point guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21456-21465 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.473, + 0.785, + 0.514 + ], + "angle": 0, + "content": "22. Li, S., Gao, G., Liu, Y., Liu, Y.S., Gu, M.: Gridformer: Point-grid transformer for surface reconstruction. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.514, + 0.785, + 0.542 + ], + "angle": 0, + "content": "23. Liao, B., Xiao, C., Jin, L., Fu, H.: Efficient feature-preserving local projection operator for geometry reconstruction. Computer-Aided Design 45(5), 861-874 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.542, + 0.785, + 0.596 + ], + "angle": 0, + "content": "24. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16252-16262 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.596, + 0.785, + 0.637 + ], + "angle": 0, + "content": "25. Lipman, Y., Cohen-Or, D., Levin, D., Tal-Ezer, H.: Parameterization-free projection for geometry reconstruction. ACM Transactions on Graphics (TOG) 26(3), 22-es (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.637, + 0.785, + 0.678 + ], + "angle": 0, + "content": "26. Liu, S.L., Guo, H.X., Pan, H., Wang, P.S., Tong, X., Liu, Y.: Deep implicit moving least-squares functions for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1788-1797 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.678, + 0.785, + 0.718 + ], + "angle": 0, + "content": "27. Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3d surface construction algorithm. In: Seminal graphics: pioneering efforts that shaped the field, pp. 347-353 (1998)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.718, + 0.785, + 0.759 + ], + "angle": 0, + "content": "28. Ma, B., Liu, Y.S., Han, Z.: Reconstructing surfaces for sparse point clouds with on-surface priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6315-6325 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.785, + 0.8 + ], + "angle": 0, + "content": "29. Ma, B., Zhou, J., Liu, Y.S., Han, Z.: Towards better gradient consistency for neural signed distance functions via level set alignment. In: Conference on Computer Vision and Pattern Recognition (CVPR) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "30. Marschner, Z., Sellan, S., Liu, H.T.D., Jacobson, A.: Constructive solid geometry on neural signed distance fields. In: SIGGRAPH Asia 2023 Conference Papers. pp. 1-12 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.615, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Filtering" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.19 + ], + "angle": 0, + "content": "31. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.786, + 0.233 + ], + "angle": 0, + "content": "32. Mi, Z., Luo, Y., Tao, W.: Ssrnet: Scalable 3d surface reconstruction network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 970-979 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.233, + 0.787, + 0.276 + ], + "angle": 0, + "content": "33. Öztiredi, A.C., Guennebaud, G., Gross, M.: Feature preserving point set surfaces based on non-linear kernel regression. In: Computer graphics forum. vol. 28, pp. 493-501. Wiley Online Library (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.276, + 0.787, + 0.317 + ], + "angle": 0, + "content": "34. Peng, S., Jiang, C., Liao, Y., Niemeyer, M., Pollefeys, M., Geiger, A.: Shape as points: A differentiable poisson solver. Advances in Neural Information Processing Systems 34, 13032-13044 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.318, + 0.787, + 0.347 + ], + "angle": 0, + "content": "35. Peng, S., Niemeyer, M., Mescheder, L., Pollefeys, M., Geiger, A.: Convolutional occupancy networks. In: European Conference on Computer Vision (ECCV) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.347, + 0.787, + 0.375 + ], + "angle": 0, + "content": "36. Preiner, R., Mattausch, O., Arikan, M., Pajarola, R., Wimmer, M.: Continuous projection for fast l1 reconstruction. ACM Trans. Graph. 33(4), 47-1 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.376, + 0.787, + 0.417 + ], + "angle": 0, + "content": "37. Pumarola, A., Sanakoyeu, A., Yariv, L., Thabet, A., Lipman, Y.: Visco grids: Surface reconstruction with viscosity and coarea grids. Advances in Neural Information Processing Systems 35, 18060-18071 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.418, + 0.787, + 0.46 + ], + "angle": 0, + "content": "38. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Neural Information Processing Systems, Neural Information Processing Systems (Jun 2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.46, + 0.787, + 0.516 + ], + "angle": 0, + "content": "39. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.516, + 0.787, + 0.558 + ], + "angle": 0, + "content": "40. Tang, J., Lei, J., Xu, D., Ma, F., Jia, K., Zhang, L.: Sa-convonet: Sign-agnostic optimization of convolutional occupancy networks. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.559, + 0.787, + 0.614 + ], + "angle": 0, + "content": "41. Tretschk, E., Tewari, A., Golyanik, V., Zollhöfer, M., Stoll, C., Theobalt, C.: Patchnets: Patch-based generalizable deep implicit 3d shape representations. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVI 16. pp. 293-309. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.615, + 0.787, + 0.644 + ], + "angle": 0, + "content": "42. Wang, X., Cheng, Y., Wang, L., Lu, J., Xu, K., Xiao, G.: Edge preserving implicit surface representation of point clouds. arXiv preprint arXiv:2301.04860 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.644, + 0.787, + 0.685 + ], + "angle": 0, + "content": "43. Wang, Y., Rahmann, L., Sorkine-Hornung, O.: Geometry-consistent neural shape representation with implicit displacement fields. In: The Tenth International Conference on Learning Representations. OpenReview (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.686, + 0.787, + 0.741 + ], + "angle": 0, + "content": "44. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 259-270 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.742, + 0.787, + 0.798 + ], + "angle": 0, + "content": "45. Williams, F., Gojcic, Z., Khamis, S., Zorin, D., Bruna, J., Fidler, S., Litany, O.: Neural fields as learnable kernels for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18500-18510 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.842 + ], + "angle": 0, + "content": "46. Williams, F., Schneider, T., Silva, C., Zorin, D., Bruna, J., Panozzo, D.: Deep geometric prior for surface reconstruction. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10130-10139 (2019)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.842 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.344, + 0.127 + ], + "angle": 0, + "content": "S. Li et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.189 + ], + "angle": 0, + "content": "47. Yu, L., Li, X., Fu, C.W., Cohen-Or, D., Heng, P.A.: Ec-net: an edge-aware point set consolidation network. In: Proceedings of the European conference on computer vision (ECCV). pp. 386-402 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.231 + ], + "angle": 0, + "content": "48. Zhang, D., Lu, X., Qin, H., He, Y.: Pointfilter: Point cloud filtering via encoder-decoder modeling. IEEE Transactions on Visualization and Computer Graphics 27(3), 2015-2027 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.787, + 0.273 + ], + "angle": 0, + "content": "49. Zhou, J., Ma, B., Liu, Y.S., Fang, Y., Han, Z.: Learning consistency-aware unsigned distance functions progressively from raw point clouds. In: Advances in Neural Information Processing Systems (NeurIPS) (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.273 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_origin.pdf b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..57d1cd2b85ffb49a93689b9d3618ff63eebe7440 --- /dev/null +++ b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/d47710e9-e3e8-4501-8f9f-e1d0d66c8314_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:72bb23508eb0e9efd1dc98486fbd3119f584359b6776b9cbc30f928e026d2478 +size 8841948 diff --git a/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/full.md b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/full.md new file mode 100644 index 0000000000000000000000000000000000000000..74d8709c84c1b3deb63592d9cfc12f9480b0346b --- /dev/null +++ b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/full.md @@ -0,0 +1,409 @@ +# Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds + +Shengtao $\mathrm{Li}^{1,2}$ , Ge Gao $^{1,2(\boxtimes)}$ , Yudong Liu $^{1,2}$ , Ming Gu $^{1,2}$ , and Yu-Shen Liu $^{2}$ + +1 Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China + +$^{2}$ School of Software, Tsinghua University, Beijing, China list21@mails.tsinghua.edu.cn, gaoge@tsinghua.edu.cn, liuyd23@mails.tsinghua.edu.cn, guming@tsinghua.edu.cn, liuyushen@tsinghua.edu.cn + +Abstract. Neural signed distance functions (SDFs) have shown powerful ability in fitting the shape geometry. However, inferring continuous signed distance fields from discrete unoriented point clouds still remains a challenge. The neural network typically fits the shape with a rough surface and omits fine-grained geometric details such as shape edges and corners. In this paper, we propose a novel non-linear implicit filter to smooth the implicit field while preserving high-frequency geometry details. Our novelty lies in that we can filter the surface (zero level set) by the neighbor input points with gradients of the signed distance field. By moving the input raw point clouds along the gradient, our proposed implicit filtering can be extended to non-zero level sets to keep the promise consistency between different level sets, which consequently results in a better regularization of the zero level set. We conduct comprehensive experiments in surface reconstruction from objects and complex scene point clouds, the numerical and visual comparisons demonstrate our improvements over the state-of-the-art methods under the widely used benchmarks. Project page: https://list17.github.io/ImplicitFilter. + +Keywords: Implicit filtering $\cdot$ Signed distance functions $\cdot$ Point cloud reconstruction + +# 1 Introduction + +Reconstructing surfaces from 3D point clouds is an important task in 3D computer vision. Recently signed distance functions (SDFs) learned by neural networks have been a widely used strategy for representing high-fidelity 3D geometry. These methods train the neural networks to predict the signed distance for every position in the space by signed distances from ground truth or inferred from the raw 3D point cloud. With the learned signed distance field, we can obtain the surface by running the marching cubes algorithm [27] to extract the zero level set. + +Without signed distance ground truth, inferring the correct gradient and distance for each query point could be hard. Since the gradient of the neural + +![](images/a29f128bac815ab60f2914f90a2aa54043771d793027f6b81d2a902050d5823a.jpg) + +![](images/81c4937b15203465b35d1881e141cab8819493157399dc2bef59d3d4beaca80f.jpg) +(a) Input + +![](images/28b3ad0451c077cb19aeef1281e36e1f4664ad0fec840b9e7d9485d73bb18bd9.jpg) + +![](images/22dee5dc050117653b2f63dfcb503c9a79f63bbb8f85333e07003ac65f6d2736.jpg) +(b) SAP + +![](images/8be99249911602147a65d2f8b5b3df1cf545790f291b1ef8e5165d76fefa3937.jpg) + +![](images/4042444c151cfa2101a1e2eed9fe4977458f90bede738c9731c909a9c4290d98.jpg) +(c) DIGS +Fig. 1: Visualization of the comparisons on FAMOUS dataset [12]. Our implicit filter can improve the reconstruction by removing the noise and keeping the geometric details compared with other methods. + +![](images/d3f962546249fedfa5209d684899e0d0894a97aba8da9f815c92153514548c1c.jpg) + +![](images/bea886ad4f2b944da2d32f1db88f880c5cf4c898d735c75f7c8622345b97165a.jpg) +(c) NeuralPull + +![](images/534d6a290d91c32156ae14e9fa8826e1ae441a7bfc75f35b87a57db040576348.jpg) + +![](images/4e480ffa3888a4910680e85a20581b67e804c0b1aca7d1981b3d06c6af76cc4d.jpg) +(e) Ours + +network also indicates the direction in which the signed distance field changes, recent works [1,2,4,14,29,38] typically add constraints on the network gradient to learn a stable field. In terms of the rate at which the field is changing, the eikonal term [1,2,5,38] is widely used to ensure the norm of the gradient to be one everywhere. For the gradient direction constraint, some methods [4,10] use the direction from the query point to the nearest point on the surface as guidance. Leveraging the continuity of the neural network and the gradient constraint, all these methods could reconstruct discrete points. However, the continuity cannot guarantee the prediction is correct everywhere. Therefore, reconstructed surfaces of previous methods usually contain noise and ignore geometry details when there are not enough points to guide the reconstruction, as shown in Fig. 1. + +The above issue arises from the fact that these methods overlook the geometric information within the neighborhood but only focus on adding constraints on individual points to optimize the network. To resolve this issue, we introduce the bilateral filter for implicit fields that reduces surface noise while preserving the high-frequency geometric characteristics of the shape. Our designed implicit filter takes into account both the position of point clouds and the gradient of learned implicit fields. Based on the assumption of all input points lying on the surface, we can filter noise points on the zero level set by minimizing the weighted projection distance to gradients of the neighbor input points. Moreover, by moving the input points along the gradient of the field to other level sets, we can easily extend the filter to the whole field. This helps constrain the signed distance field near the surface and achieve better consistency through different level sets. To evaluate the effectiveness of our proposed implicit filtering, we validate it under widely used benchmarks including object and scene reconstructions. Our contributions are listed below. + +- We introduce the implicit filter on SDFs to smooth the surface while preserving geometry details for learning better neural networks to represent shapes or scenes. + +- We improve the implicit filter by extending it to non-zero level sets of signed distance fields. This regularization of the field aligns different level sets and provides better consistency within the whole SDF field. + +- Both object and scene reconstruction experiments validate our implicit filter, demonstrating its effectiveness and ability to produce high-fidelity reconstruction results, surpassing the previous state-of-the-art methods. + +# 2 Related Work + +With the rapid development of deep learning, neural networks have shown great potential in surface reconstruction from 3D point clouds. In the following, we briefly review methods related to implicit learning for 3D shapes and reconstructions from point clouds. + +Implicit Learning from 3D Supervision. The most commonly used strategy to train the neural network is to learn priors in a data-driven manner. These methods require signed distances or occupancy labels as 3D supervision to learn global priors [6,12,26,31,32] or local priors [7,17,18,22,35,40,41,44,45]. With large-scale training datasets, the neural network can perform well with similar shapes, but may not generalize well to unseen cases with large geometric variations. These models often have limited inputs that can be difficult to scale for varying sizes of point clouds. + +Implicit Learning from Raw Point Clouds. Different from the supervised methods, we can learn implicit functions by overfitting neural networks on single point clouds globally or locally to learn SDFs [1-4, 10, 21, 28, 30, 34]. These unsupervised methods rely on neural networks to infer implicit functions without learning any priors. Therefore, apart from the guidance of original input point clouds, we also need constraints on the direction [3, 4, 10, 21] or the norm [1, 2, 30] of the gradients, specially designed priors [3, 28], or differentiableoisson solver [34] to infer SDFs. This unsupervised approach heavily depends on the fitting capability and continuity of neural networks. However, these SDFs lack accuracy because there is no reliable guidance available for each query point across the entire space when working with discrete point clouds. Therefore, deducing the correct geometry for free space becomes particularly crucial. Our implicit filtering enhances SDFs by inferring the geometric details through the implicit field information of neighbor points. + +Feature Preserving Point Cloud Reconstruction. Early works [16, 23, 33] reconstruct point clouds with sharp features usually by point cloud consolidation. The key idea of these methods is to enhance the quality of point clouds with sharp features. One popular category is the local projection operation (LOP) [25] and its variants [15, 16, 23, 36]. The projection operator provides a stable and easily generalizable method for point cloud filtering, which is also the foundation of our implicit filter. The difference lies in that we do not need any normal or other priors and our filtering can be directly applied to implicit fields to extract high-fidelity meshes. Some other learning-based methods [47, 48] try to consolidate point clouds with edge points in a data-driven manner. Although + +capable of generating high-quality point clouds, these methods still require a proper reconstruction method [13] to inherit the details in meshes. + +With the advancement of deep learning in point cloud reconstruction, some approaches [5,24,38,42] also explored employing neural networks to reconstruct high-precision models. FFN [39], SIREN [38], and IDF [43] introduce high-frequency features into the neural network in different ways to preserve the geometric details of the reconstructed shape. DIGS [5] and EPI [42] smooth the surface by using the divergence as guidance to alleviate the implicit surface roughness. Compared with these methods, we first introduce local geometric features through filtering to optimize the implicit field, so that we can achieve higher accuracy. + +# 3 Method + +Neural SDFs overview. This section will briefly describe the concepts we used in our implicit filtering. We focus on the SDF $f: \mathbb{R}^3 \to \mathbb{R}$ inferred from the point cloud $\pmb{P} = \{\pmb{p}_i | \pmb{p}_i \in \mathbb{R}^3\}_{i=1}^N$ without ground truth signed distances and normals. $f$ predicts a signed distance $s \in \mathbb{R}$ for an arbitrary query point $\pmb{q}$ , as formulated by $s = f_{\theta}(\pmb{q})$ , where $\theta$ denotes the parameters of the neural network. + +The level set $S_{d}$ of SDF is defined as a set of continuous query points with the same signed distance $d$ , formulated as $S_{d} = \{q|f_{\theta}(q) = d\}$ . The goal of our implicit filtering is to smooth each level set with geometry details. Then we can extract the zero level set as a mesh by running the marching cubes algorithm [27]. + +Level set bilateral filtering. Filtering for 2D images replaces the intensity of each pixel with the weighted intensity values from nearby pixels. Different from images, the resolution of implicit fields is infinite and we need to find the neighborhood on each level set for filtering. By minimizing the following loss function, + +$$ +L _ {d i s t} = \frac {1}{N} \sum_ {i = 1} ^ {N} | f _ {\theta} (\boldsymbol {p} _ {i}) |, \tag {1} +$$ + +we can approximate that all points in $\pmb{P}$ are located on level set $S_0$ , which makes it feasible to find neighbor points on $S_0$ . For a given point $\bar{\pmb{p}}$ on $S_0$ , one simple strategy of filtering is to average positions of neighbor points $\mathcal{N}(\bar{\pmb{p}}, S_0) \subset \pmb{P}$ on $S_0$ by a Gaussian filter based on relative positions as follows: + +![](images/9464860f7cd2c7a102adf0b537475a01ffe20113130290e4818a96acc8e11989.jpg) +Fig.2: By minimizing the weighted projection distance, our filter can preserve the sharp feature but the average method leads to a wrong result. + +$$ +\bar {\boldsymbol {p}} _ {\text {a v e r a g e}} = \frac {\sum_ {\boldsymbol {p} _ {j} \in \mathcal {N} (\bar {\boldsymbol {p}} , S _ {0})} \boldsymbol {p} _ {j} \phi (| | \bar {\boldsymbol {p}} - \boldsymbol {p} _ {j} | |)}{\sum_ {\boldsymbol {p} _ {j} \in \mathcal {N} (\bar {\boldsymbol {p}}, S _ {0})} \phi (| | \bar {\boldsymbol {p}} - \boldsymbol {p} _ {j} | |)}, \tag {2} +$$ + +where the Gaussian function $\phi$ is defined as $\phi (||\bar{\pmb{p}} -\pmb {p}_j||) = \exp \left(-\frac{||\bar{\pmb{p}} - \pmb{p}_j||^2}{\sigma_p^2}\right)$ . + +![](images/5802b8608a3e966795da1e93a4094d67bd8423976e8c17b143841bcbdbc2b5fe.jpg) +Fig. 3: Overview of filtering the zero level set. (a) We assume all input points lying on the surface and compute gradients as normals. (b) Calculating bidirectional projection distances $d1 = |\pmb{n}_{p_j}^T(\bar{\pmb{p}} - \pmb{p}_j)|$ , $d2 = |\pmb{n}_{\bar{p}}^T(\bar{\pmb{p}} - \pmb{p}_j)|$ and the weights in Eq. (4). (c) By minimizing Eq. (4), we can remove the noise on the zero level set. The gradient $\nabla f_\theta$ in this figure defaults to be regularized. + +However, as depicted in Fig. 2, it is evident that this weighted mean position yields excessively smooth surfaces, causing sharp features and details to be further obscured. To keep the geometric details, our filtering operator suggests measuring the projection distance to the gradient of neighbor points as shown in Fig. 2 and Fig. 3(b). When calculating weights, it is vital to account for both the impact of relative positions and the gradient similarity. Following the principles of bilateral filtering, to compute the filtered point for $\bar{p}$ , we simply need to minimize the following distance equation: + +$$ +d (\bar {\boldsymbol {p}}) = \frac {\sum_ {\boldsymbol {p} _ {j} \in \mathcal {N} (\bar {\boldsymbol {p}} , \mathcal {S} _ {0})} \left| \boldsymbol {n} _ {p _ {j}} ^ {T} (\bar {\boldsymbol {p}} - \boldsymbol {p} _ {j}) \right| \phi (| | \bar {\boldsymbol {p}} - \boldsymbol {p} _ {j} | |) \psi (\boldsymbol {n} _ {\bar {p}}, \boldsymbol {n} _ {p _ {j}})}{\sum_ {\boldsymbol {p} _ {j} \in \mathcal {N} (\bar {\boldsymbol {p}} , \mathcal {S} _ {0})} \phi (| | \bar {\boldsymbol {p}} - \boldsymbol {p} _ {j} | |) \psi (\boldsymbol {n} _ {\bar {p}}, \boldsymbol {n} _ {p _ {j}})}, \tag {3} +$$ + +where the gradient $\pmb{n}_{\bar{p}}$ , $\pmb{n}_{p_j}$ and the Gaussian function $\psi$ are defined as $\pmb{n}_{\bar{p}} = \frac{\nabla f_{\theta}(\bar{p})}{||\nabla f_{\theta}(\bar{p})||}, \pmb{n}_{p_j} = \frac{\nabla f_{\theta}(\pmb{p}_j)}{||\nabla f_{\theta}(\pmb{p}_j)||}, \psi(\pmb{n}_{\bar{p}}, \pmb{n}_{p_j}) = \exp\left(-\frac{1 - \pmb{n}_{\bar{p}}^T \pmb{n}_{p_j}}{1 - \cos(\sigma_n)}\right)$ . + +In addition to projection to the gradient $\pmb{n}_{p_j}$ , we observe that the projection distance to $\pmb{n}_{\bar{p}}$ can assist in learning a more stable gradient for point $\bar{p}$ which is also adopted in EAR [16]. Taking into account the bidirectional projection, our final bilateral filtering operator can be formulated as follows: + +$$ +d _ {b i} (\bar {\boldsymbol {p}}) = \frac {\sum_ {\boldsymbol {p} _ {j} \in \mathcal {N} (\bar {\boldsymbol {p}} , S _ {0})} \left(\left| \boldsymbol {n} _ {p _ {j}} ^ {T} (\bar {\boldsymbol {p}} - \boldsymbol {p} _ {j}) \right| + \left| \boldsymbol {n} _ {\bar {p}} ^ {T} (\bar {\boldsymbol {p}} - \boldsymbol {p} _ {j}) \right|\right) \phi \left(\left\| \bar {\boldsymbol {p}} - \boldsymbol {p} _ {j} \right\|\right) \psi \left(\boldsymbol {n} _ {\bar {p}} , \boldsymbol {n} _ {p _ {j}}\right)}{\sum_ {\boldsymbol {p} _ {j} \in \mathcal {N} (\bar {\boldsymbol {p}}, S _ {0})} \phi \left(\left\| \bar {\boldsymbol {p}} - \boldsymbol {p} _ {j} \right\|\right) \psi \left(\boldsymbol {n} _ {\bar {p}}, \boldsymbol {n} _ {p _ {j}}\right)}. \tag {4} +$$ + +Although similar filtering methods have been widely studied in applications such as point cloud denoising and resampling [16, 48], there are two critical problems when applying these methods in implicit fields: + +1. Filtering the zero level set needs to sample points on the level set $S_0$ , which necessitates the resolution of the equation $f_{\theta} = 0$ , or the utilization of the marching cubes algorithm [27]. Both methods pose challenges in achieving fast and uniform point sampling. For the randomly sampled point $\mathbf{q}$ on nonzero level set $S_{f_{\theta}(\mathbf{q})}$ , we can also not filter this level set since there are no neighbor points on $S_{f_{\theta}(\mathbf{q})}$ . + +![](images/1eaea1cbcf8ac66d07a649b7e97c43844bffb77fa8105655f5af71cad9e6e86b.jpg) +Fig. 4: Overview of sampling points. (a) Sampling query points near the surface. (b) Pulling the query point to the zero level set and input points to the level set where the query point is located. (c) Applying the filter on each level set. The gradient $\nabla f_{\theta}$ in this figure defaults to be regularized. + +2. The normals utilized in our filtering are derived from the gradients of the neural network $f_{\theta}$ . While the network typically offers reliable gradients, we may find that $\nabla f_{\theta} = 0$ is also the optimal solution to the minimum value of Eqs. (3) and (4). This degenerate solution is unexpected, as it implies a scenario where there is no surface when the gradient is zero everywhere. + +We will focus on addressing the two issues in the subsequent sections. + +Sampling points for filtering. Inspired by NeuralPull [4], we can pull a query point to the zero level set by the gradient of the neural network $f_{\theta}$ . For a given query point $\mathbf{q}$ as input, the pulled location $\hat{\mathbf{q}}$ can be formulated as follows: + +$$ +\hat {\boldsymbol {q}} = \boldsymbol {q} - f _ {\theta} (\boldsymbol {q}) \nabla f _ {\theta} (\boldsymbol {q}) / | | \nabla f _ {\theta} (\boldsymbol {q}) | |. \tag {5} +$$ + +The point $\pmb{q}$ and $\hat{\pmb{q}}$ lie respectively on level set $S_{f_{\theta}(q)}$ and $S_0$ as illustrate in Fig. 4(b). By adopting the sampling strategy in NeuralPull, we can generate samples $\pmb{Q} = \{\pmb{q}_i|\pmb{q}_i\in \pmb{R}^3\}_{i = 1}^M$ on different level sets near the surface and pull them to $S_0$ by Eq. (5), to obtain $\hat{\pmb{Q}} = \{\hat{\pmb{q}}_i|\hat{\pmb{q}}_i = \pmb {q}_i - f_\theta (\pmb {q}_i)\nabla f_\theta (\pmb {q}_i) / ||\nabla f_\theta (\pmb {q}_i)||,\pmb {q}_i\in \pmb {Q}\}_{i = 1}^M$ . Hence, we can filter the zero level set by minimizing Eq. (4) across all pulled query points $\hat{\pmb{Q}}$ , which is equivalent to optimizing the following loss: + +$$ +L _ {z e r o} = \sum_ {\hat {\boldsymbol {q}} \in \hat {\boldsymbol {Q}}} d _ {b i} (\hat {\boldsymbol {q}}), \tag {6} +$$ + +where for each $\hat{\pmb{q}}\in \hat{\mathcal{Q}}$ $\mathcal{N}(\hat{\pmb{q}},\mathcal{S}_0)$ denotes finding the neighbors of $\hat{\pmb{q}}$ within the input points $\pmb{P}$ , since $\pmb{P}$ is assumed to be located on $\mathcal{S}_0$ . + +This filtering mechanism can be easily extended to non-zero level sets in a similar inverse manner. To be more specific, as for level set $S_{f_{\theta}(\pmb{q})}$ , the neighbor points for query point $\pmb{q} \in \pmb{Q}$ are required. These points should lie on the level set $S_{f_{\theta}(\pmb{q})}$ same as $\pmb{q}$ , allowing us to filter the level set $S_{f_{\theta}(\pmb{q})}$ using the same filter as described in Eq. (4). + +However, obtaining $\mathcal{N}(\pmb{q}, S_{f_{\theta}(q)})$ in $\pmb{P}$ is not feasible, since all input points $\pmb{P}$ are situated on the zero level set instead of the $S_{f_{\theta}(\pmb{q})}$ level set. To address this issue, we propose a technique for identifying neighbors of $\pmb{q}$ on level set $S_{f_{\theta}(\pmb{q})}$ , by projecting the input points $\pmb{P}$ inversely onto the specific level set $S_{f_{\theta}(\pmb{q})}$ based + +on the gradient, as depicted in Fig. 4(b). The projected neighbor points can be represented as in Eq. (7). Filtering across multiple level sets helps to enhance the performance of our method by optimizing the consistency between different level sets within the SDF field. We further showcase this evidence in the ablation study detailed in Section Sec. 4.4. + +$$ +\mathcal {N} (\boldsymbol {q}, S _ {f _ {\theta} (q)}) = \left\{\hat {\boldsymbol {p}} \mid \hat {\boldsymbol {p}} = \boldsymbol {p} + f _ {\theta} (\boldsymbol {q}) \frac {\nabla f _ {\theta} (\boldsymbol {p})}{\| \nabla f _ {\theta} (\boldsymbol {p}) \|}, \boldsymbol {p} \in \mathcal {N} (\hat {\boldsymbol {q}}, \mathcal {S} _ {0})) \right\}. \tag {7} +$$ + +Based on the above analysis, we can filter the level sets $S_{f_{\theta}(q)}$ by minimizing Eq. (4) over all sample points $Q$ through Eq. (7), equivalent to optimizing the following loss: + +$$ +L _ {\text {f i e l d}} = \sum_ {\boldsymbol {q} \in \boldsymbol {Q}} d _ {b i} (\boldsymbol {q}). \tag {8} +$$ + +It is worth noting that for a fixed query point $\pmb{q}$ , the pulled query point $\hat{\pmb{q}}$ dynamically changes when training the neural network, which results in a time-consuming process to repeatedly conduct neighbor searching for $\hat{\pmb{q}}$ . To handle this matter, we substitute the $\mathcal{N}(\hat{\pmb{q}},\mathcal{S}_0)$ with $\mathcal{N}(NN(\pmb {q}),\mathcal{S}_0)$ , where $NN(\pmb {q})$ denotes the nearest point of $\pmb{q}$ + +within the point cloud $\pmb{P}$ as shown in Fig. 5. While this substitution may introduce a slight bias for training, it also ensures the neighbor points are close to $\hat{\pmb{q}}$ , therefore this trade-off between efficiency and accuracy is reasonable. + +![](images/5985aa965fcd972bc47e067ab7ad67f7b57c9820ca0a52d337b61403f09253f5.jpg) +Fig.5: (a) Searching neighbors directly for $\hat{q}$ . (b) Searching neighbors for $NN(q)$ instead of $\hat{q}$ . + +Gradient constraint. The other problem of implicit filtering is gradient degeneration. Overfitting the neural network requires the SDF to be geometrically initialized. We can consider the initialized implicit field as the noisy field and apply our filter directly to train the network from the beginning to fit the raw point cloud by removing the 'noise'. However, if the denoise target is too complex, gradient degeneration will occur during the training process. Therefore, we need to add a constraint to the gradient of the SDF. + +There are two ways for training the neural network to pull query points onto the surface based on NeuralPull [4] and CAP-UDF [49]. One is minimizing the distance between the pulled point $\hat{\pmb{q}}$ and the nearest point $NN(\pmb{q})$ as formulated below: + +$$ +L _ {p u l l} = \frac {1}{M} \sum_ {i \in [ 1, M ]} | | \hat {\boldsymbol {q}} _ {i} - N N (\boldsymbol {q} _ {i}) | | _ {2}. \tag {9} +$$ + +The other is minimizing the Chamfer distance between moved query points and the raw point cloud: + +$$ +L _ {C D} = \frac {1}{M} \sum_ {i \in [ 1, M ]} \min _ {j \in [ 1, N ]} | | \hat {\boldsymbol {q}} _ {i} - \boldsymbol {p} _ {j} | | _ {2} + \frac {1}{N} \sum_ {j \in [ 1, N ]} \min _ {i \in [ 1, M ]} | | \boldsymbol {p} _ {j} - \hat {\boldsymbol {q}} _ {i} | | _ {2}. \tag {10} +$$ + +A stable SDF can be trained by the losses above since they are trying to move the query points to be in the same distribution with the point cloud, which can provide the constraint for our implicit filter. Here we choose $L_{CD}$ since the filtered points are likely not the nearest points and $L_{CD}$ is a more relaxed constraint. + +Loss function. Finally, our loss function is formulated as: + +$$ +L = L _ {z e r o} + \alpha_ {1} L _ {\text {f i e l d}} + \alpha_ {2} L _ {\text {d i s t}} + \alpha_ {3} L _ {C D}, \tag {11} +$$ + +where $\alpha_{1},\alpha_{2}$ , and $\alpha_{3}$ is the balance weights for our implicit filtering loss. + +Implementation details. We employ a neural network similar to OccNet [31] and the geometric network initialization proposed in SAL [1] with a smaller radius the same as GridPull [10] to learn the SDF. We use the strategy in NeuralPull [4] to sample queries around each point $\pmb{p}$ in $\pmb{P}$ . We set the weight $\alpha_{3}$ to 10 to constrain the learned SDF and $\alpha_{1}$ and $\alpha_{2}$ to 1. The parameters $\sigma_{n},\sigma_{p}$ are set to $15^{\circ}$ , $\max_{\pmb {p}_j\in \mathcal{N}(\bar{\pmb{p}},S_{f_\theta (\bar{p})})}(||\bar{\pmb{p}} -\pmb {p}_j||)$ respectively. + +# 4 Experiments + +We conducted experiments to assess the performance of our implicit filter for surface reconstruction from raw point clouds. The results are presented for general shapes in Sec. 4.1, real scanned raw data including 3D objects in Sec. 4.2, and complex scenes in Sec. 4.3. Additionally, ablation experiments were carried out to validate the theory and explore the impact of various parameters in Sec. 4.4. + +# 4.1 Surface Reconstruction for Shapes + +# Datasets and metrics. + +For surface reconstruction of general shapes from raw point clouds, we conduct evaluations on three widely used datasets including a subset of ShapeNet [8], ABC [20], and FAMOUS [12]. We use the same setting with NeuralPull [4] for the dataset ShapeNet. For datasets ABC and FAMOUS, we use the train/test + +Table 1: Comparisons on ABC and Famous datasets. The threshold of F-score (F-S.) is 0.01. + +
MethodsABCFAMOUS
CDL2CDL1F-S.CDL2CDL1F-S.
P2S [12]0.2980.0150.5980.0120.0080.752
IGR [14]2.6750.0630.4481.4740.0440.573
NP [4]0.0950.0110.6730.1000.0120.746
PCP [3]0.2520.0230.3730.0370.0140.435
SIREN [38]0.0220.0120.4930.0250.0120.561
DIGS [5]0.0210.0100.6670.0150.0080.772
Ours0.0110.0090.6910.0080.0070.778
+ +splitting released by Points2Surf [12] and we sample points directly from the mesh in the ABC dataset without other mesh preprocessing to keep the sharp features. + +![](images/47c50031cc3f22c0bbe79e00e52fdc1cc4bed201150377edaa0c004cbccac331.jpg) +Fig. 6: Visual comparisons of surface reconstruction on ABC and FAMOUS datasets. Our method can reconstruct objects with sharp edges and less noise compared with other methods. + +For evaluating the performance, we follow NeuralPull to sample $1 \times 10^{5}$ points from the reconstructed surfaces and the ground truth meshes on the ShapeNet dataset and sample $1 \times 10^{4}$ on the ABC and FAMOUS datasets. For the evaluation metrics, we use L1 and L2 Chamfer distance ( $CD_{L1}$ and $CD_{L2}$ ) to measure the error. Moreover, we adopt normal consistency (NC) and F-score to evaluate the accuracy of the reconstructed surface, the threshold is the same with NeuralPull. + +Comparisons. To evaluate the validity of our implicit filter, we compare our method with a variety of methods including SPSR [19], Points2Surf (P2S) [12], IGR [14], NeuralPull (NP) [4], LPI [9], PCP [3], GridPull (GP) [10], SIREN [38], DIGs [5]. The quantitative results on ABC and FAMOUS datasets are shown in Tab. 1, and selectively visualized in Fig. 6. Our model reaches state-of-the-art performance on both datasets, accomplishing the goal of eliminating noise on each level set while preserving the ge + +ometric details. To more intuitively validate the efficacy of our filtering, we visualize the level sets on a cross section in Fig. 7. We also report the results on + +![](images/b479b2f0b9aa20f063df450fbcf1acd87c3617dc52258c2e16387dda9a4b31f2.jpg) +Fig. 7: Visualization of level sets on a cross section. + +idate the efficacy of our filtering, we viin Fig. 7. We also report the results on + +Table 2: Comparisons on ShapeNet dataset. + +
SPSR [19]NP [4]LPI [9]PCP [3]GP [10]Ours
CDL2 × 1000.2860.0380.01710.01360.00860.0032
NC0.8660.9390.95960.95900.97230.9779
F-Score (0.002)0.4070.9610.99120.98710.98960.9976
F-Score (0.004)0.6180.9760.99570.98990.99230.9985
+ +![](images/b97f62162b736400a4a730962659033ce9a166fd88e19c9dc3fa76967edca95b.jpg) +Fig. 8: Visual comparisons of surface reconstruction on ShapeNet dataset. + +ShapeNet which contains over 3000 objects in terms of $CD_{L2}$ , NC, and F-Score with thresholds of 0.002 and 0.004 in Tab. 2. The detailed comparison for each class of ShapeNet can be found in the supplementary material. Our method outperforms previous methods over most classes. The visualization comparisons in Fig. 8 show that our method can reconstruct a smoother surface with fine details. + +To validate the effect of our filter on sharp geometric features. We evaluate the edge points by the edge Chamfer distance metric used in [11]. We sample 100k points uniformly on the surface of both the reconstructed mesh and ground truth. The edge point $\pmb{p}$ is calculated by finding whether there exists a point $\pmb{q} \in \mathcal{N}_{\epsilon}(\pmb{p})$ satisfied $|\pmb{n}_q\pmb{n}_p| < \sigma$ , where $\mathcal{N}_{\epsilon}(\pmb{p})$ represents the neighbor points within distance $\epsilon$ from $\pmb{p}$ . The results are shown in Tab. 3 and visualized in Fig. 9. We set $\epsilon = 0.01$ and $\sigma = 0.1$ . + +# 4.2 Surface Reconstruction for Real Scans + +Dataset and metrics. For surface reconstruction of real point cloud scans, we follow VisCo [37] to evaluate our method under the Surface Reconstruction Benchmarks (SRB) [46]. We use Chamfer and Hausdorff distances $(CD_{L1}$ and HD) between the reconstruction meshes and the ground truth. Furthermore, we report their corresponding one-sided distances $(d_{\vec{C}}$ and $d_{\vec{H}})$ between the reconstructed meshes and the input noisy point cloud. + +Table 3: Edge Chamfer distance comparisons on ABC dataset, ${ECD}_{L2} \times {100}$ . + +
MethodsP2S [12]IGR [14]NP [4]PCP [3]SIREN [38]DIGS [5]Ours
ECDL10.04960.08350.05010.06280.06950.07860.0256
ECDL21.0552.3651.2551.2651.4072.4930.399
+ +![](images/1da0f1256aa127b2661c1a70e8b8517f65f3955a7165d94d50ae3e1dbb713111.jpg) +Fig. 9: Visual comparisons of edge points and reconstruction results. + +Comparisons. We compare our method with state-of-the-art methods under the real scanned SRB dataset, including IGR [14], SPSR [19], Shape As Points (SAP) [34], NeuralPull (NP) [4], and GridPull (GP) [10]. The numerical comparisons are shown in Table 2. + +![](images/e7362449dfb9f3a0507423c77ce536bfec505f6e243aa255fe62af290386df75.jpg) +(a) Input + +![](images/45972bd27e0205012f547a3a8a0b00369cf5fb2f4d6baaee3cdd344802a96a5b.jpg) +(c) SPSR +(d) NeuralPull + +![](images/381567d50bd9ce29669ea83d260e465c9de453c42b830d06e66be7b3acd53eb1.jpg) +Fig. 10: Visual comparisons on SRB dataset. + +![](images/33052205e6e92893af1cf6da981d4682117c5174734a86bf807a4a163f27fcc3.jpg) +(e) Ours + +in Tab. 4, where we achieve the best accuracy in most cases. The visual comparisons in Fig. 10 demonstrate that our method can reconstruct a continuous and smooth surface with geometry details. + +# 4.3 Surface Reconstruction for Scenes + +Dataset and metrics. To further demonstrate the advantage of our method in the surface reconstruction of real scene scans, we conduct experiments using the 3D Scene dataset. The 3D Scene dataset is a challenging real-world dataset with complex topology and noisy open surfaces. We uniformly sample 1000 points per $m^2$ of each scene as the input and follow PCP [3] to sample 1M points on both the reconstructed and the ground truth surfaces. We leverage L1 and L2 + +Table 4: Comparisons on SRB dataset. + +
SPSR [19]IGR [14]SIREN [38]VisCo [37]SAP [34]NP [4]GP [10]DIGS [5]Ours
AnchorCDL10.600.220.320.210.120.1220.0930.0630.052
HD14.894.718.193.002.383.2431.8041.4471.232
dC0.600.120.100.150.080.0610.0660.0300.025
dH14.891.322.4321.070.833.2080.4600.2700.265
DaratechCDL10.440.250.210.210.260.3750.0620.0490.051
HD7.244.014.304.060.873.1270.6480.8580.751
dC0.440.080.090.140.040.7460.0390.0250.028
dH7.241.591.771.760.413.2670.2930.4410.423
DCCDL10.270.170.150.150.070.1570.0660.0420.041
HD3.102.222.182.221.173.5411.1030.6670.815
dC0.270.090.060.090.040.2420.0360.0220.019
dH3.102.612.762.760.533.5230.5390.7290.724
GargoyleCDL10.260.160.170.170.070.0800.0630.0470.044
HD6.803.524.644.401.491.3761.1290.9711.089
dC0.260.060.080.110.050.0630.0450.0280.022
dH6.800.810.910.960.780.4750.7000.2710.246
Lord QuasCDL10.200.120.170.120.050.0640.0470.0310.030
HD4.611.170.821.060.980.8220.5690.4960.554
dC0.200.070.120.070.040.0530.0310.0170.014
dH4.610.980.760.640.510.5080.3700.1810.230
+ +![](images/1bede750b0c99c202bdd2e35a6d0269bfe7cc00fc01695e9a902332451fe0b52.jpg) + +![](images/ae6b83e6251167302df71b9e55112f28b431ecb096c4a24d6275499335e34068.jpg) +(a) GridPull + +![](images/61b69745b83a95e377f285eafac7e0c21ee40496532ad49c093896a1a7fd661f.jpg) + +![](images/8df6d2ddb651526fccfb512e4de2956bcb0fccf91e00a7433f31d82d74ff5842.jpg) +(b) PCP + +![](images/0c37c8482120c47e95e39d27faecf9931ceb5cf8aa1af079cdd09f2eb727c7c4.jpg) + +![](images/a88a54698b5aeb3c328b3506a8ce5478548200d0bd437916cbeef699335327ca.jpg) +(c) NeuralPull +Fig. 11: Visual comparisons of surface reconstruction on 3D Scene dataset. + +![](images/d715748af5f396b9dd9088e5446d5b75bea5de92c20604ba6bcfcc64ccb59832.jpg) + +![](images/afcc60799326adbc58f27568cd969ed55f065eb62d234a1854e9ad659a924fa4.jpg) +(d) Ours + +![](images/57824b5efbc99f2624fd7cf7aa97cd2a19ff3ba05b1bb82e1015957e5423aae2.jpg) + +![](images/906947a8589292cb84f782a92cbd2b97d1b50d53a32097291681e3d5ce478439.jpg) +(e) GT + +Chamfer distance $(CD_{L1}, CD_{L2})$ and normal consistency (NC) to evaluate the reconstruction quality. + +Comparisons. We compare our method with the state-of-the-art methods ConvONet [35], LIG [18], DeepLS [7], NeuralPull (NP) [4], PCP [3], GridPull (GP) [10]. The numerical comparisons in Tab. 5 demonstrate our superior performance in all scenes even compared with the local-based methods. We further present visual comparisons in Fig. 11. The visualization further shows that our method can achieve smoother with high-fidelity surfaces in complex scenes. It should be noted that the surface we extract here is not the zero level set but the 0.001 level set since the scene is not watertight. For NeuralPull we use the threshold of 0.005 instead of 0.001 to extract the complete surface therefore the mesh looks thicker. + +Table 5: Comparisons on 3D Scene dataset, $CD_{L2} \times 1000$ . + +
BurghersLoungeCopyroomStonewallTotempole
CDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NC
ConvONet [35]27.460.0790.9079.540.0460.89410.970.0450.89220.460.0690.9052.0540.0210.943
LIG [18]3.0550.0450.8359.6720.0560.8333.610.0360.8105.0320.0420.8799.580.0620.887
DeepLS [7]0.4010.0170.9206.1030.0530.8480.6090.0210.9010.3200.0150.9540.6010.0170.950
GP [10]1.3670.0280.8734.6840.0530.8272.3270.0300.8572.2340.0240.9132.2780.0340.878
PCP [3]1.3390.0310.9290.4320.0140.9340.4050.0140.9140.2660.0140.9571.0890.0290.954
NP [4]0.8970.0250.8830.8550.0220.8870.4790.0180.8620.4340.0180.9291.6040.0320.923
Ours0.1330.0110.9340.1200.0080.9260.1110.0090.9130.0820.0090.9570.2030.0130.944
+ +![](images/4eba333e8c53ba7d786629102532c4ccefdd1b4fe529735970a2e95f94c93a94.jpg) +(a) Input Points + +![](images/bdaa44aac7fded6ab639ba9cbf99bd363d4c4e36303d2a64404084058a8ce356.jpg) +(b) $L_{\text{pull}}$ + +![](images/cb8e2aebd2be87db4e64855da406eca67dde6a8e9b1e0d3e6a65550a6a65721b.jpg) +(c) $L_{CD}$ +Fig. 12: The 2D level sets show the distance field learned by different losses. The red lines represent the learned zero level set. + +![](images/64e522315c30a37f1b8ef70fe04bd818e1f7c4a401638256772c55d1d02af5b9.jpg) +(c) $L_{CD} + L_{zero}$ +(d) $L_{CD} + L_{zero} + L_{field}$ + +![](images/604a57291afe1b44f994add003b2f0074d226a465c9d64f2d1d3ed51d6c1bfd5.jpg) + +# 4.4 Ablation Studies + +We conduct ablation studies on the FAMOUS dataset to demonstrate the effectiveness of our proposed implicit filter and explore the effect of some important hyperparameters. We report the performance in terms of L1 and L2 Chamfer distance $(CD_{L1}, CD_{L2} \times 10^{3})$ , normal consistency (NC), and F-Score (F-S.). + +Effect of Eikonal loss. We select the $L_{CD}$ to prevent the degeneration of the gradient since it both constrains the value and the gradient of the SDF. It also guides how to pull + +Table 6: Effect of the Eikonal term. + +
LossCDL1CDL2F-S.NC
w/ Eikonal, w/o CD0.0090.0210.7380.899
w/ Eikonal, w/ CD0.0080.0090.7740.910
w/o Eikonal, w/ CD0.0070.0080.7780.911
+ +the query point onto the surface. Therefore we omit the Eikonal term used in previous methods like the IGR [14], SIREN [38], and DIGS [5] which have no other direct supervision for the gradient. To verify this selection, we conduct the following experiments by trade-off these two functions. With the experimental results in Tab. 6, we find that only applying the Eikonal term is not as effective as CD alone. At the same time combining the Eikonal term with CD does not further enhance the experiment results, but the difference is small. + +Effect of level set filtering. To justify the effectiveness of each term in our loss function. We report the results trained by different combinations in Tab. 7. The $L_{CD}$ is more applicable for training SDF from raw point clouds. The zero-level filter can help remove the noise and keep the geometric features. Filtering across non-zero level sets can improve the overall consistency of the entire signed distance field. Since we assume all input points lie on the surface, the function $L_{dist}$ is also necessary. Fig. 12 shows a 2D comparison of these losses, showing + +that our filter loss functions can reconstruct a field that is aligned at all level sets and maintains geometric characteristics. + +Effect of the bidirectional projection. To validate our bidirectional projection distance, we report the results in Tab. 8. The numerical comparisons show that projecting the distance to both normals can improve the reconstruction quality. Note that only using $d(\bar{p})$ can also improve the results. + +Table 7: Effect of different losses. + +
LossCDL1CDL2F-S.NC
Lpull0.0120.0830.7420.884
LCD0.0100.0310.7570.891
LCD + Lzero0.0080.0180.7720.905
LCD + Lzero + Lfield0.0080.0110.7690.908
Ours0.0070.0080.7780.911
+ +Table 8: Effect of bidirectional projection. + +
d(¯¯¯¯p)dbi(¯¯¯¯p)
CDL10.0100.007
CDL20.0240.008
F-S.0.7260.778
NC0.8900.911
+ +Weight of level set projection loss. We explore the effect of the $L_{CD}$ loss function by adjusting the weight $\alpha_{3}$ in Eq. (11). We report our results with different candidates $\{0, 1, 10\}$ in Tab. 9, where 0 means we do not use the $L_{CD}$ to constrain the gradient. The comparisons in Tab. 9 show that although our implicit filter can directly learn SDFs, it is better to adopt the $L_{CD}$ for a more stable field. However, if the weight is too large, the filtering effect will decrease. It is recommended to select weights ranging from 1 to 10, which is usually adequate. For the weights $\alpha_{1}$ and $\alpha_{2}$ , setting them to 1 is always necessary. + +Effect of filter parameters. We compare the effect of different parameters $\sigma_{n},\sigma_{p}$ in Tab. 10. The diagonal weight for $\sigma_{p}$ means the length of the diagonal of the bounding box for the local patch mentioned in [48]. The results indicate that the method is relatively robust to parameter variation in a certain range. + +Table 9: Effect of weight ${\alpha }_{3}$ . + +
α3CDL1CDL2F-S.NC
00.0080.0130.7580.903
10.0070.0110.7720.910
100.0070.0080.7780.911
1000.0080.0090.7740.909
+ +Table 10: Effect of filter parameters ${\sigma }_{n}$ and ${\sigma }_{p}$ . + +
CDL1CDL2F-S.NC
σn15°0.0070.0080.7780.911
30°0.0070.0110.7710.907
45°0.0080.0120.7640.903
60°0.0080.0100.7670.901
σpmax0.0070.0080.7780.911
diagonal0.0080.0110.7630.904
+ +# 5 Conclusion + +We introduce implicit filtering on SDFs to reduce the noise of the signed distance field while preserving geometry features. We filter the distance field by minimizing the weighted bidirectional projection distance, where we can generate sampling points on the zero level set and neighbor points on non-zero level sets by the pulling procedure. By leveraging the Chamfer distance, we address the issue of gradient degeneration problem. The visual and numerical comparisons demonstrate our effectiveness and superiority over state-of-the-art methods. + +# Acknowledgements + +The corresponding author is Ge Gao. This work was supported by Beijing Science and Technology Program (Z231100001723014). + +# References + +1. Atzmon, M., Lipman, Y.: Sal: Sign agnostic learning of shapes from raw data. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020) +2. Atzmon, M., Lipman, Y.: SALD: sign agnostic learning with derivatives. In: 9th International Conference on Learning Representations, ICLR 2021 (2021) +3. Baorui, M., Yu-Shen, L., Matthias, Z., Zhizhong, H.: Surface reconstruction from point clouds by learning predictive context priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022) +4. Baorui, M., Zhizhong, H., Yu-Shen, L., Matthias, Z.: Neural-pull: Learning signed distance functions from point clouds by learning to pull space onto surfaces. In: International Conference on Machine Learning (ICML) (2021) +5. Ben-Shabat, Y., Hewa Koneputugodage, C., Gould, S.: Digs: Divergence guided shape implicit neural representation for unoriented point clouds. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19323-19332 (2022) +6. Boulch, A., Marlet, R.: Poco: Point convolution for surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6302-6314 (June 2022) +7. Chabra, R., Lenssen, J.E., Ilg, E., Schmidt, T., Straub, J., Lovegrove, S., Newcombe, R.: Deep local shapes: Learning local sdf priors for detailed 3d reconstruction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIX 16. pp. 608-625. Springer (2020) +8. Chang, A.X., Funkhouser, T., Guibas, L., Hanrahan, P., Huang, Q., Li, Z., Savarese, S., Savva, M., Song, S., Su, H., Xiao, J., Yi, L., Yu, F.: ShapeNet: An Information-Rich 3D Model Repository. Tech. Rep. arXiv:1512.03012 [cs.GR], Stanford University — Princeton University — Toyota Technological Institute at Chicago (2015) +9. Chao, C., Yu-shen, L., Zhizhong, H.: Latent partition implicit with surface codes for 3d representation. In: European Conference on Computer Vision (ECCV) (2022) +10. Chen, C., Liu, Y.S., Han, Z.: Gridpull: Towards scalability in learning implicit representations from 3d point clouds. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV) (2023) +11. Chen, Z., Tagliasacchi, A., Zhang, H.: Bsp-net: Generating compact meshes via binary space partitioning. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020) +12. Eler, P., Guerrero, P., Ohrhallinger, S., Mitra, N.J., Wimmer, M.: Points2Surf: Learning implicit surfaces from point clouds. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.M. (eds.) Computer Vision - ECCV 2020. pp. 108-124. Springer International Publishing, Cham (2020) +13. Fleishman, S., Cohen-Or, D., Silva, C.T.: Robust moving least-squares fitting with sharp features. ACM transactions on graphics (TOG) 24(3), 544-552 (2005) + +14. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. In: Proceedings of Machine Learning and Systems 2020, pp. 3569-3579 (2020) +15. Huang, H., Li, D., Zhang, H., Ascher, U., Cohen-Or, D.: Consolidation of unorganized point clouds for surface reconstruction. ACM transactions on graphics (TOG) 28(5), 1-7 (2009) +16. Huang, H., Wu, S., Gong, M., Cohen-Or, D., Ascher, U., Zhang, H.: Edge-aware point set resampling. ACM transactions on graphics (TOG) 32(1), 1-12 (2013) +17. Huang, J., Gojcic, Z., Atzmon, M., Litany, O., Fidler, S., Williams, F.: Neural kernel surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4369-4379 (2023) +18. Jiang, C.M., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T.: Local implicit grid representations for 3d scenes. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2020) +19. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013) +20. Koch, S., Matveev, A., Jiang, Z., Williams, F., Artemov, A., Burnaev, E., Alexa, M., Zorin, D., Panozzo, D.: Abc: A big cad model dataset for geometric deep learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9601-9611 (2019) +21. Koneputugodage, C.H., Ben-Shabat, Y., Campbell, D., Gould, S.: Small steps and level sets: Fitting neural surface models with point guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21456-21465 (2024) +22. Li, S., Gao, G., Liu, Y., Liu, Y.S., Gu, M.: Gridformer: Point-grid transformer for surface reconstruction. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024) +23. Liao, B., Xiao, C., Jin, L., Fu, H.: Efficient feature-preserving local projection operator for geometry reconstruction. Computer-Aided Design 45(5), 861-874 (2013) +24. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16252-16262 (2022) +25. Lipman, Y., Cohen-Or, D., Levin, D., Tal-Ezer, H.: Parameterization-free projection for geometry reconstruction. ACM Transactions on Graphics (TOG) 26(3), 22-es (2007) +26. Liu, S.L., Guo, H.X., Pan, H., Wang, P.S., Tong, X., Liu, Y.: Deep implicit moving least-squares functions for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1788-1797 (2021) +27. Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3d surface construction algorithm. In: Seminal graphics: pioneering efforts that shaped the field, pp. 347-353 (1998) +28. Ma, B., Liu, Y.S., Han, Z.: Reconstructing surfaces for sparse point clouds with on-surface priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6315-6325 (2022) +29. Ma, B., Zhou, J., Liu, Y.S., Han, Z.: Towards better gradient consistency for neural signed distance functions via level set alignment. In: Conference on Computer Vision and Pattern Recognition (CVPR) (2023) +30. Marschner, Z., Sellan, S., Liu, H.T.D., Jacobson, A.: Constructive solid geometry on neural signed distance fields. In: SIGGRAPH Asia 2023 Conference Papers. pp. 1-12 (2023) + +31. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2019) +32. Mi, Z., Luo, Y., Tao, W.: Ssrnet: Scalable 3d surface reconstruction network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 970-979 (2020) +33. Öztiredi, A.C., Guennebaud, G., Gross, M.: Feature preserving point set surfaces based on non-linear kernel regression. In: Computer graphics forum. vol. 28, pp. 493-501. Wiley Online Library (2009) +34. Peng, S., Jiang, C., Liao, Y., Niemeyer, M., Pollefeys, M., Geiger, A.: Shape as points: A differentiable poisson solver. Advances in Neural Information Processing Systems 34, 13032-13044 (2021) +35. Peng, S., Niemeyer, M., Mescheder, L., Pollefeys, M., Geiger, A.: Convolutional occupancy networks. In: European Conference on Computer Vision (ECCV) (2020) +36. Preiner, R., Mattausch, O., Arikan, M., Pajarola, R., Wimmer, M.: Continuous projection for fast l1 reconstruction. ACM Trans. Graph. 33(4), 47-1 (2014) +37. Pumarola, A., Sanakoyeu, A., Yariv, L., Thabet, A., Lipman, Y.: Visco grids: Surface reconstruction with viscosity and coarea grids. Advances in Neural Information Processing Systems 35, 18060-18071 (2022) +38. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Neural Information Processing Systems, Neural Information Processing Systems (Jun 2020) +39. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020) +40. Tang, J., Lei, J., Xu, D., Ma, F., Jia, K., Zhang, L.: Sa-convonet: Sign-agnostic optimization of convolutional occupancy networks. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021) +41. Tretschk, E., Tewari, A., Golyanik, V., Zollhöfer, M., Stoll, C., Theobalt, C.: Patchnets: Patch-based generalizable deep implicit 3d shape representations. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVI 16. pp. 293-309. Springer (2020) +42. Wang, X., Cheng, Y., Wang, L., Lu, J., Xu, K., Xiao, G.: Edge preserving implicit surface representation of point clouds. arXiv preprint arXiv:2301.04860 (2023) +43. Wang, Y., Rahmann, L., Sorkine-Hornung, O.: Geometry-consistent neural shape representation with implicit displacement fields. In: The Tenth International Conference on Learning Representations. OpenReview (2022) +44. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 259-270 (2023) +45. Williams, F., Gojcic, Z., Khamis, S., Zorin, D., Bruna, J., Fidler, S., Litany, O.: Neural fields as learnable kernels for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18500-18510 (2022) +46. Williams, F., Schneider, T., Silva, C., Zorin, D., Bruna, J., Panozzo, D.: Deep geometric prior for surface reconstruction. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10130-10139 (2019) + +47. Yu, L., Li, X., Fu, C.W., Cohen-Or, D., Heng, P.A.: Ec-net: an edge-aware point set consolidation network. In: Proceedings of the European conference on computer vision (ECCV). pp. 386-402 (2018) +48. Zhang, D., Lu, X., Qin, H., He, Y.: Pointfilter: Point cloud filtering via encoder-decoder modeling. IEEE Transactions on Visualization and Computer Graphics 27(3), 2015-2027 (2020) +49. Zhou, J., Ma, B., Liu, Y.S., Fang, Y., Han, Z.: Learning consistency-aware unsigned distance functions progressively from raw point clouds. In: Advances in Neural Information Processing Systems (NeurIPS) (2022) \ No newline at end of file diff --git a/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/images.zip b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..2c084d3e78f7afea51c146efdf12f1bcd483bb64 --- /dev/null +++ b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a3ad87ee1ea6ca1c202a435a266581672b517244c19b8c908b3008267a8a2f15 +size 868244 diff --git a/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/layout.json b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..e5f5642a67b76104b0d7cfe9ca5a5a9abf100e77 --- /dev/null +++ b/2024/Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds/layout.json @@ -0,0 +1,12442 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 149, + 111, + 465, + 147 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 111, + 465, + 147 + ], + "spans": [ + { + "bbox": [ + 149, + 111, + 465, + 147 + ], + "type": "text", + "content": "Implicit Filtering for Learning Neural Signed Distance Functions from 3D Point Clouds" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "spans": [ + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "text", + "content": "Shengtao " + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "\\mathrm{Li}^{1,2}" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "text", + "content": ", Ge Gao" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{1,2(\\boxtimes)}" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "text", + "content": ", Yudong Liu" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "text", + "content": ", Ming Gu" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "text", + "content": ", and Yu-Shen Liu" + }, + { + "bbox": [ + 137, + 167, + 476, + 181 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 151, + 189, + 462, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 151, + 189, + 462, + 212 + ], + "spans": [ + { + "bbox": [ + 151, + 189, + 462, + 212 + ], + "type": "text", + "content": "1 Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 178, + 212, + 433, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 178, + 212, + 433, + 257 + ], + "spans": [ + { + "bbox": [ + 178, + 212, + 433, + 257 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 178, + 212, + 433, + 257 + ], + "type": "text", + "content": " School of Software, Tsinghua University, Beijing, China list21@mails.tsinghua.edu.cn, gaoge@tsinghua.edu.cn, liuyd23@mails.tsinghua.edu.cn, guming@tsinghua.edu.cn, liuyushen@tsinghua.edu.cn" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 283, + 455, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 283, + 455, + 471 + ], + "spans": [ + { + "bbox": [ + 159, + 283, + 455, + 471 + ], + "type": "text", + "content": "Abstract. Neural signed distance functions (SDFs) have shown powerful ability in fitting the shape geometry. However, inferring continuous signed distance fields from discrete unoriented point clouds still remains a challenge. The neural network typically fits the shape with a rough surface and omits fine-grained geometric details such as shape edges and corners. In this paper, we propose a novel non-linear implicit filter to smooth the implicit field while preserving high-frequency geometry details. Our novelty lies in that we can filter the surface (zero level set) by the neighbor input points with gradients of the signed distance field. By moving the input raw point clouds along the gradient, our proposed implicit filtering can be extended to non-zero level sets to keep the promise consistency between different level sets, which consequently results in a better regularization of the zero level set. We conduct comprehensive experiments in surface reconstruction from objects and complex scene point clouds, the numerical and visual comparisons demonstrate our improvements over the state-of-the-art methods under the widely used benchmarks. Project page: https://list17.github.io/ImplicitFilter." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 159, + 479, + 453, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 479, + 453, + 502 + ], + "spans": [ + { + "bbox": [ + 159, + 479, + 453, + 502 + ], + "type": "text", + "content": "Keywords: Implicit filtering " + }, + { + "bbox": [ + 159, + 479, + 453, + 502 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 479, + 453, + 502 + ], + "type": "text", + "content": " Signed distance functions " + }, + { + "bbox": [ + 159, + 479, + 453, + 502 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 479, + 453, + 502 + ], + "type": "text", + "content": " Point cloud reconstruction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 521, + 230, + 534 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 521, + 230, + 534 + ], + "spans": [ + { + "bbox": [ + 132, + 521, + 230, + 534 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": "Reconstructing surfaces from 3D point clouds is an important task in 3D computer vision. Recently signed distance functions (SDFs) learned by neural networks have been a widely used strategy for representing high-fidelity 3D geometry. These methods train the neural networks to predict the signed distance for every position in the space by signed distances from ground truth or inferred from the raw 3D point cloud. With the learned signed distance field, we can obtain the surface by running the marching cubes algorithm [27] to extract the zero level set." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "Without signed distance ground truth, inferring the correct gradient and distance for each query point could be hard. Since the gradient of the neural" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 117, + 203, + 188 + ], + "blocks": [ + { + "bbox": [ + 133, + 117, + 203, + 188 + ], + "lines": [ + { + "bbox": [ + 133, + 117, + 203, + 188 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 203, + 188 + ], + "type": "image", + "image_path": "a29f128bac815ab60f2914f90a2aa54043771d793027f6b81d2a902050d5823a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 188, + 203, + 221 + ], + "blocks": [ + { + "bbox": [ + 133, + 188, + 203, + 221 + ], + "lines": [ + { + "bbox": [ + 133, + 188, + 203, + 221 + ], + "spans": [ + { + "bbox": [ + 133, + 188, + 203, + 221 + ], + "type": "image", + "image_path": "81c4937b15203465b35d1881e141cab8819493157399dc2bef59d3d4beaca80f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 154, + 222, + 185, + 232 + ], + "lines": [ + { + "bbox": [ + 154, + 222, + 185, + 232 + ], + "spans": [ + { + "bbox": [ + 154, + 222, + 185, + 232 + ], + "type": "text", + "content": "(a) Input" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 203, + 116, + 272, + 186 + ], + "blocks": [ + { + "bbox": [ + 203, + 116, + 272, + 186 + ], + "lines": [ + { + "bbox": [ + 203, + 116, + 272, + 186 + ], + "spans": [ + { + "bbox": [ + 203, + 116, + 272, + 186 + ], + "type": "image", + "image_path": "28b3ad0451c077cb19aeef1281e36e1f4664ad0fec840b9e7d9485d73bb18bd9.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 204, + 188, + 272, + 221 + ], + "blocks": [ + { + "bbox": [ + 204, + 188, + 272, + 221 + ], + "lines": [ + { + "bbox": [ + 204, + 188, + 272, + 221 + ], + "spans": [ + { + "bbox": [ + 204, + 188, + 272, + 221 + ], + "type": "image", + "image_path": "22dee5dc050117653b2f63dfcb503c9a79f63bbb8f85333e07003ac65f6d2736.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 225, + 222, + 252, + 232 + ], + "lines": [ + { + "bbox": [ + 225, + 222, + 252, + 232 + ], + "spans": [ + { + "bbox": [ + 225, + 222, + 252, + 232 + ], + "type": "text", + "content": "(b) SAP" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 272, + 116, + 341, + 186 + ], + "blocks": [ + { + "bbox": [ + 272, + 116, + 341, + 186 + ], + "lines": [ + { + "bbox": [ + 272, + 116, + 341, + 186 + ], + "spans": [ + { + "bbox": [ + 272, + 116, + 341, + 186 + ], + "type": "image", + "image_path": "8be99249911602147a65d2f8b5b3df1cf545790f291b1ef8e5165d76fefa3937.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 273, + 188, + 341, + 221 + ], + "blocks": [ + { + "bbox": [ + 273, + 188, + 341, + 221 + ], + "lines": [ + { + "bbox": [ + 273, + 188, + 341, + 221 + ], + "spans": [ + { + "bbox": [ + 273, + 188, + 341, + 221 + ], + "type": "image", + "image_path": "4042444c151cfa2101a1e2eed9fe4977458f90bede738c9731c909a9c4290d98.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 293, + 222, + 324, + 232 + ], + "lines": [ + { + "bbox": [ + 293, + 222, + 324, + 232 + ], + "spans": [ + { + "bbox": [ + 293, + 222, + 324, + 232 + ], + "type": "text", + "content": "(c) DIGS" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 240, + 482, + 274 + ], + "lines": [ + { + "bbox": [ + 131, + 240, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 131, + 240, + 482, + 274 + ], + "type": "text", + "content": "Fig. 1: Visualization of the comparisons on FAMOUS dataset [12]. Our implicit filter can improve the reconstruction by removing the noise and keeping the geometric details compared with other methods." + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 342, + 116, + 410, + 186 + ], + "blocks": [ + { + "bbox": [ + 342, + 116, + 410, + 186 + ], + "lines": [ + { + "bbox": [ + 342, + 116, + 410, + 186 + ], + "spans": [ + { + "bbox": [ + 342, + 116, + 410, + 186 + ], + "type": "image", + "image_path": "d3f962546249fedfa5209d684899e0d0894a97aba8da9f815c92153514548c1c.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 342, + 188, + 410, + 221 + ], + "blocks": [ + { + "bbox": [ + 342, + 188, + 410, + 221 + ], + "lines": [ + { + "bbox": [ + 342, + 188, + 410, + 221 + ], + "spans": [ + { + "bbox": [ + 342, + 188, + 410, + 221 + ], + "type": "image", + "image_path": "bea886ad4f2b944da2d32f1db88f880c5cf4c898d735c75f7c8622345b97165a.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 353, + 222, + 402, + 232 + ], + "lines": [ + { + "bbox": [ + 353, + 222, + 402, + 232 + ], + "spans": [ + { + "bbox": [ + 353, + 222, + 402, + 232 + ], + "type": "text", + "content": "(c) NeuralPull" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 410, + 116, + 480, + 186 + ], + "blocks": [ + { + "bbox": [ + 410, + 116, + 480, + 186 + ], + "lines": [ + { + "bbox": [ + 410, + 116, + 480, + 186 + ], + "spans": [ + { + "bbox": [ + 410, + 116, + 480, + 186 + ], + "type": "image", + "image_path": "534d6a290d91c32156ae14e9fa8826e1ae441a7bfc75f35b87a57db040576348.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 411, + 188, + 479, + 221 + ], + "blocks": [ + { + "bbox": [ + 411, + 188, + 479, + 221 + ], + "lines": [ + { + "bbox": [ + 411, + 188, + 479, + 221 + ], + "spans": [ + { + "bbox": [ + 411, + 188, + 479, + 221 + ], + "type": "image", + "image_path": "4e480ffa3888a4910680e85a20581b67e804c0b1aca7d1981b3d06c6af76cc4d.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 430, + 222, + 462, + 232 + ], + "lines": [ + { + "bbox": [ + 430, + 222, + 462, + 232 + ], + "spans": [ + { + "bbox": [ + 430, + 222, + 462, + 232 + ], + "type": "text", + "content": "(e) Ours" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 300, + 482, + 432 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 482, + 432 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 482, + 432 + ], + "type": "text", + "content": "network also indicates the direction in which the signed distance field changes, recent works [1,2,4,14,29,38] typically add constraints on the network gradient to learn a stable field. In terms of the rate at which the field is changing, the eikonal term [1,2,5,38] is widely used to ensure the norm of the gradient to be one everywhere. For the gradient direction constraint, some methods [4,10] use the direction from the query point to the nearest point on the surface as guidance. Leveraging the continuity of the neural network and the gradient constraint, all these methods could reconstruct discrete points. However, the continuity cannot guarantee the prediction is correct everywhere. Therefore, reconstructed surfaces of previous methods usually contain noise and ignore geometry details when there are not enough points to guide the reconstruction, as shown in Fig. 1." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 434, + 483, + 613 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 483, + 613 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 483, + 613 + ], + "type": "text", + "content": "The above issue arises from the fact that these methods overlook the geometric information within the neighborhood but only focus on adding constraints on individual points to optimize the network. To resolve this issue, we introduce the bilateral filter for implicit fields that reduces surface noise while preserving the high-frequency geometric characteristics of the shape. Our designed implicit filter takes into account both the position of point clouds and the gradient of learned implicit fields. Based on the assumption of all input points lying on the surface, we can filter noise points on the zero level set by minimizing the weighted projection distance to gradients of the neighbor input points. Moreover, by moving the input points along the gradient of the field to other level sets, we can easily extend the filter to the whole field. This helps constrain the signed distance field near the surface and achieve better consistency through different level sets. To evaluate the effectiveness of our proposed implicit filtering, we validate it under widely used benchmarks including object and scene reconstructions. Our contributions are listed below." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 137, + 629, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 629, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 137, + 629, + 482, + 665 + ], + "type": "text", + "content": "- We introduce the implicit filter on SDFs to smooth the surface while preserving geometry details for learning better neural networks to represent shapes or scenes." + } + ] + } + ], + "index": 20 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 211, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 211, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 211, + 100 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 116, + 479, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 116, + 479, + 151 + ], + "spans": [ + { + "bbox": [ + 137, + 116, + 479, + 151 + ], + "type": "text", + "content": "- We improve the implicit filter by extending it to non-zero level sets of signed distance fields. This regularization of the field aligns different level sets and provides better consistency within the whole SDF field." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 152, + 480, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 152, + 480, + 188 + ], + "spans": [ + { + "bbox": [ + 138, + 152, + 480, + 188 + ], + "type": "text", + "content": "- Both object and scene reconstruction experiments validate our implicit filter, demonstrating its effectiveness and ability to produce high-fidelity reconstruction results, surpassing the previous state-of-the-art methods." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 208, + 237, + 220 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 208, + 237, + 220 + ], + "spans": [ + { + "bbox": [ + 132, + 208, + 237, + 220 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 234, + 479, + 281 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 234, + 479, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 234, + 479, + 281 + ], + "type": "text", + "content": "With the rapid development of deep learning, neural networks have shown great potential in surface reconstruction from 3D point clouds. In the following, we briefly review methods related to implicit learning for 3D shapes and reconstructions from point clouds." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 282, + 480, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 480, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 480, + 376 + ], + "type": "text", + "content": "Implicit Learning from 3D Supervision. The most commonly used strategy to train the neural network is to learn priors in a data-driven manner. These methods require signed distances or occupancy labels as 3D supervision to learn global priors [6,12,26,31,32] or local priors [7,17,18,22,35,40,41,44,45]. With large-scale training datasets, the neural network can perform well with similar shapes, but may not generalize well to unseen cases with large geometric variations. These models often have limited inputs that can be difficult to scale for varying sizes of point clouds." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 378, + 480, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 480, + 544 + ], + "type": "text", + "content": "Implicit Learning from Raw Point Clouds. Different from the supervised methods, we can learn implicit functions by overfitting neural networks on single point clouds globally or locally to learn SDFs [1-4, 10, 21, 28, 30, 34]. These unsupervised methods rely on neural networks to infer implicit functions without learning any priors. Therefore, apart from the guidance of original input point clouds, we also need constraints on the direction [3, 4, 10, 21] or the norm [1, 2, 30] of the gradients, specially designed priors [3, 28], or differentiableoisson solver [34] to infer SDFs. This unsupervised approach heavily depends on the fitting capability and continuity of neural networks. However, these SDFs lack accuracy because there is no reliable guidance available for each query point across the entire space when working with discrete point clouds. Therefore, deducing the correct geometry for free space becomes particularly crucial. Our implicit filtering enhances SDFs by inferring the geometric details through the implicit field information of neighbor points." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 545, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 481, + 665 + ], + "type": "text", + "content": "Feature Preserving Point Cloud Reconstruction. Early works [16, 23, 33] reconstruct point clouds with sharp features usually by point cloud consolidation. The key idea of these methods is to enhance the quality of point clouds with sharp features. One popular category is the local projection operation (LOP) [25] and its variants [15, 16, 23, 36]. The projection operator provides a stable and easily generalizable method for point cloud filtering, which is also the foundation of our implicit filter. The difference lies in that we do not need any normal or other priors and our filtering can be directly applied to implicit fields to extract high-fidelity meshes. Some other learning-based methods [47, 48] try to consolidate point clouds with edge points in a data-driven manner. Although" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "capable of generating high-quality point clouds, these methods still require a proper reconstruction method [13] to inherit the details in meshes." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 480, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 480, + 247 + ], + "type": "text", + "content": "With the advancement of deep learning in point cloud reconstruction, some approaches [5,24,38,42] also explored employing neural networks to reconstruct high-precision models. FFN [39], SIREN [38], and IDF [43] introduce high-frequency features into the neural network in different ways to preserve the geometric details of the reconstructed shape. DIGS [5] and EPI [42] smooth the surface by using the divergence as guidance to alleviate the implicit surface roughness. Compared with these methods, we first introduce local geometric features through filtering to optimize the implicit field, so that we can achieve higher accuracy." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 265, + 202, + 277 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 265, + 202, + 277 + ], + "spans": [ + { + "bbox": [ + 132, + 265, + 202, + 277 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": "Neural SDFs overview. This section will briefly describe the concepts we used in our implicit filtering. We focus on the SDF " + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "inline_equation", + "content": "f: \\mathbb{R}^3 \\to \\mathbb{R}" + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": " inferred from the point cloud " + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\pmb{P} = \\{\\pmb{p}_i | \\pmb{p}_i \\in \\mathbb{R}^3\\}_{i=1}^N" + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": " without ground truth signed distances and normals. " + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": " predicts a signed distance " + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "inline_equation", + "content": "s \\in \\mathbb{R}" + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": " for an arbitrary query point " + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\pmb{q}" + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": ", as formulated by " + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "inline_equation", + "content": "s = f_{\\theta}(\\pmb{q})" + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 289, + 479, + 348 + ], + "type": "text", + "content": " denotes the parameters of the neural network." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "text", + "content": "The level set " + }, + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "inline_equation", + "content": "S_{d}" + }, + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "text", + "content": " of SDF is defined as a set of continuous query points with the same signed distance " + }, + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "text", + "content": ", formulated as " + }, + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "inline_equation", + "content": "S_{d} = \\{q|f_{\\theta}(q) = d\\}" + }, + { + "bbox": [ + 130, + 350, + 479, + 397 + ], + "type": "text", + "content": ". The goal of our implicit filtering is to smooth each level set with geometry details. Then we can extract the zero level set as a mesh by running the marching cubes algorithm [27]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 414, + 387, + 486 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 414, + 387, + 486 + ], + "spans": [ + { + "bbox": [ + 130, + 414, + 387, + 486 + ], + "type": "text", + "content": "Level set bilateral filtering. Filtering for 2D images replaces the intensity of each pixel with the weighted intensity values from nearby pixels. Different from images, the resolution of implicit fields is infinite and we need to find the neighborhood on each level set for filtering. By minimizing the following loss function," + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 208, + 494, + 386, + 525 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 494, + 386, + 525 + ], + "spans": [ + { + "bbox": [ + 208, + 494, + 386, + 525 + ], + "type": "interline_equation", + "content": "L _ {d i s t} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} | f _ {\\theta} (\\boldsymbol {p} _ {i}) |, \\tag {1}", + "image_path": "c892ea4503301a0373d511f268c33b24e6c00a415c881a8b8b3dd0a4492fa2d2.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": "we can approximate that all points in " + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": " are located on level set " + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "inline_equation", + "content": "S_0" + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": ", which makes it feasible to find neighbor points on " + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "inline_equation", + "content": "S_0" + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": ". For a given point " + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "inline_equation", + "content": "\\bar{\\pmb{p}}" + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": " on " + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "inline_equation", + "content": "S_0" + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": ", one simple strategy of filtering is to average positions of neighbor points " + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(\\bar{\\pmb{p}}, S_0) \\subset \\pmb{P}" + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": " on " + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "inline_equation", + "content": "S_0" + }, + { + "bbox": [ + 130, + 533, + 387, + 605 + ], + "type": "text", + "content": " by a Gaussian filter based on relative positions as follows:" + } + ] + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 391, + 417, + 481, + 512 + ], + "blocks": [ + { + "bbox": [ + 391, + 417, + 481, + 512 + ], + "lines": [ + { + "bbox": [ + 391, + 417, + 481, + 512 + ], + "spans": [ + { + "bbox": [ + 391, + 417, + 481, + 512 + ], + "type": "image", + "image_path": "9464860f7cd2c7a102adf0b537475a01ffe20113130290e4818a96acc8e11989.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 391, + 518, + 482, + 595 + ], + "lines": [ + { + "bbox": [ + 391, + 518, + 482, + 595 + ], + "spans": [ + { + "bbox": [ + 391, + 518, + 482, + 595 + ], + "type": "text", + "content": "Fig.2: By minimizing the weighted projection distance, our filter can preserve the sharp feature but the average method leads to a wrong result." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "bbox": [ + 219, + 613, + 480, + 644 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 613, + 480, + 644 + ], + "spans": [ + { + "bbox": [ + 219, + 613, + 480, + 644 + ], + "type": "interline_equation", + "content": "\\bar {\\boldsymbol {p}} _ {\\text {a v e r a g e}} = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , S _ {0})} \\boldsymbol {p} _ {j} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |)}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}}, S _ {0})} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |)}, \\tag {2}", + "image_path": "660bcbe3af1187ac9f5c466585b33fa70d3022ae94837f4fe4131e387339ceab.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 647, + 471, + 669 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 647, + 471, + 669 + ], + "spans": [ + { + "bbox": [ + 130, + 647, + 471, + 669 + ], + "type": "text", + "content": "where the Gaussian function " + }, + { + "bbox": [ + 130, + 647, + 471, + 669 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 647, + 471, + 669 + ], + "type": "text", + "content": " is defined as " + }, + { + "bbox": [ + 130, + 647, + 471, + 669 + ], + "type": "inline_equation", + "content": "\\phi (||\\bar{\\pmb{p}} -\\pmb {p}_j||) = \\exp \\left(-\\frac{||\\bar{\\pmb{p}} - \\pmb{p}_j||^2}{\\sigma_p^2}\\right)" + }, + { + "bbox": [ + 130, + 647, + 471, + 669 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 101 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 113, + 482, + 178 + ], + "blocks": [ + { + "bbox": [ + 132, + 113, + 482, + 178 + ], + "lines": [ + { + "bbox": [ + 132, + 113, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 132, + 113, + 482, + 178 + ], + "type": "image", + "image_path": "5802b8608a3e966795da1e93a4094d67bd8423976e8c17b143841bcbdbc2b5fe.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "lines": [ + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "type": "text", + "content": "Fig. 3: Overview of filtering the zero level set. (a) We assume all input points lying on the surface and compute gradients as normals. (b) Calculating bidirectional projection distances " + }, + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "type": "inline_equation", + "content": "d1 = |\\pmb{n}_{p_j}^T(\\bar{\\pmb{p}} - \\pmb{p}_j)|" + }, + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "type": "inline_equation", + "content": "d2 = |\\pmb{n}_{\\bar{p}}^T(\\bar{\\pmb{p}} - \\pmb{p}_j)|" + }, + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "type": "text", + "content": " and the weights in Eq. (4). (c) By minimizing Eq. (4), we can remove the noise on the zero level set. The gradient " + }, + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "type": "inline_equation", + "content": "\\nabla f_\\theta" + }, + { + "bbox": [ + 130, + 186, + 479, + 242 + ], + "type": "text", + "content": " in this figure defaults to be regularized." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 265, + 480, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 265, + 480, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 480, + 361 + ], + "type": "text", + "content": "However, as depicted in Fig. 2, it is evident that this weighted mean position yields excessively smooth surfaces, causing sharp features and details to be further obscured. To keep the geometric details, our filtering operator suggests measuring the projection distance to the gradient of neighbor points as shown in Fig. 2 and Fig. 3(b). When calculating weights, it is vital to account for both the impact of relative positions and the gradient similarity. Following the principles of bilateral filtering, to compute the filtered point for " + }, + { + "bbox": [ + 130, + 265, + 480, + 361 + ], + "type": "inline_equation", + "content": "\\bar{p}" + }, + { + "bbox": [ + 130, + 265, + 480, + 361 + ], + "type": "text", + "content": ", we simply need to minimize the following distance equation:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 187, + 369, + 480, + 399 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 369, + 480, + 399 + ], + "spans": [ + { + "bbox": [ + 187, + 369, + 480, + 399 + ], + "type": "interline_equation", + "content": "d (\\bar {\\boldsymbol {p}}) = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , \\mathcal {S} _ {0})} \\left| \\boldsymbol {n} _ {p _ {j}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right| \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |) \\psi (\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}})}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , \\mathcal {S} _ {0})} \\phi (| | \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} | |) \\psi (\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}})}, \\tag {3}", + "image_path": "c49f3cee5022a8df82ebd560704739e4752a0f604b5f6e73b1287b4169d2d405.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "spans": [ + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "text", + "content": "where the gradient " + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\pmb{n}_{\\bar{p}}" + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\pmb{n}_{p_j}" + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "text", + "content": " and the Gaussian function " + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\psi" + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "text", + "content": " are defined as " + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\pmb{n}_{\\bar{p}} = \\frac{\\nabla f_{\\theta}(\\bar{p})}{||\\nabla f_{\\theta}(\\bar{p})||}, \\pmb{n}_{p_j} = \\frac{\\nabla f_{\\theta}(\\pmb{p}_j)}{||\\nabla f_{\\theta}(\\pmb{p}_j)||}, \\psi(\\pmb{n}_{\\bar{p}}, \\pmb{n}_{p_j}) = \\exp\\left(-\\frac{1 - \\pmb{n}_{\\bar{p}}^T \\pmb{n}_{p_j}}{1 - \\cos(\\sigma_n)}\\right)" + }, + { + "bbox": [ + 131, + 400, + 480, + 437 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "text", + "content": "In addition to projection to the gradient " + }, + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "inline_equation", + "content": "\\pmb{n}_{p_j}" + }, + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "text", + "content": ", we observe that the projection distance to " + }, + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "inline_equation", + "content": "\\pmb{n}_{\\bar{p}}" + }, + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "text", + "content": " can assist in learning a more stable gradient for point " + }, + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "inline_equation", + "content": "\\bar{p}" + }, + { + "bbox": [ + 130, + 437, + 480, + 484 + ], + "type": "text", + "content": " which is also adopted in EAR [16]. Taking into account the bidirectional projection, our final bilateral filtering operator can be formulated as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 146, + 500, + 480, + 545 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 500, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 146, + 500, + 480, + 545 + ], + "type": "interline_equation", + "content": "d _ {b i} (\\bar {\\boldsymbol {p}}) = \\frac {\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}} , S _ {0})} \\left(\\left| \\boldsymbol {n} _ {p _ {j}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right| + \\left| \\boldsymbol {n} _ {\\bar {p}} ^ {T} (\\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j}) \\right|\\right) \\phi \\left(\\left\\| \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} \\right\\|\\right) \\psi \\left(\\boldsymbol {n} _ {\\bar {p}} , \\boldsymbol {n} _ {p _ {j}}\\right)}{\\sum_ {\\boldsymbol {p} _ {j} \\in \\mathcal {N} (\\bar {\\boldsymbol {p}}, S _ {0})} \\phi \\left(\\left\\| \\bar {\\boldsymbol {p}} - \\boldsymbol {p} _ {j} \\right\\|\\right) \\psi \\left(\\boldsymbol {n} _ {\\bar {p}}, \\boldsymbol {n} _ {p _ {j}}\\right)}. \\tag {4}", + "image_path": "56fd216d31d4b405f32ddc25e657061539e3d6234741f838d544a58faca7f497.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 551, + 479, + 588 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 551, + 479, + 588 + ], + "spans": [ + { + "bbox": [ + 130, + 551, + 479, + 588 + ], + "type": "text", + "content": "Although similar filtering methods have been widely studied in applications such as point cloud denoising and resampling [16, 48], there are two critical problems when applying these methods in implicit fields:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "text", + "content": "1. Filtering the zero level set needs to sample points on the level set " + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "S_0" + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "text", + "content": ", which necessitates the resolution of the equation " + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "f_{\\theta} = 0" + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "text", + "content": ", or the utilization of the marching cubes algorithm [27]. Both methods pose challenges in achieving fast and uniform point sampling. For the randomly sampled point " + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{q}" + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "text", + "content": " on nonzero level set " + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\mathbf{q})}" + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "text", + "content": ", we can also not filter this level set since there are no neighbor points on " + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\mathbf{q})}" + }, + { + "bbox": [ + 136, + 594, + 482, + 667 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 113, + 482, + 178 + ], + "blocks": [ + { + "bbox": [ + 133, + 113, + 482, + 178 + ], + "lines": [ + { + "bbox": [ + 133, + 113, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 133, + 113, + 482, + 178 + ], + "type": "image", + "image_path": "1eaea1cbcf8ac66d07a649b7e97c43844bffb77fa8105655f5af71cad9e6e86b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 187, + 482, + 232 + ], + "lines": [ + { + "bbox": [ + 130, + 187, + 482, + 232 + ], + "spans": [ + { + "bbox": [ + 130, + 187, + 482, + 232 + ], + "type": "text", + "content": "Fig. 4: Overview of sampling points. (a) Sampling query points near the surface. (b) Pulling the query point to the zero level set and input points to the level set where the query point is located. (c) Applying the filter on each level set. The gradient " + }, + { + "bbox": [ + 130, + 187, + 482, + 232 + ], + "type": "inline_equation", + "content": "\\nabla f_{\\theta}" + }, + { + "bbox": [ + 130, + 187, + 482, + 232 + ], + "type": "text", + "content": " in this figure defaults to be regularized." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 135, + 256, + 481, + 316 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 256, + 481, + 316 + ], + "spans": [ + { + "bbox": [ + 135, + 256, + 481, + 316 + ], + "type": "text", + "content": "2. The normals utilized in our filtering are derived from the gradients of the neural network " + }, + { + "bbox": [ + 135, + 256, + 481, + 316 + ], + "type": "inline_equation", + "content": "f_{\\theta}" + }, + { + "bbox": [ + 135, + 256, + 481, + 316 + ], + "type": "text", + "content": ". While the network typically offers reliable gradients, we may find that " + }, + { + "bbox": [ + 135, + 256, + 481, + 316 + ], + "type": "inline_equation", + "content": "\\nabla f_{\\theta} = 0" + }, + { + "bbox": [ + 135, + 256, + 481, + 316 + ], + "type": "text", + "content": " is also the optimal solution to the minimum value of Eqs. (3) and (4). This degenerate solution is unexpected, as it implies a scenario where there is no surface when the gradient is zero everywhere." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 324, + 440, + 337 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 324, + 440, + 337 + ], + "spans": [ + { + "bbox": [ + 132, + 324, + 440, + 337 + ], + "type": "text", + "content": "We will focus on addressing the two issues in the subsequent sections." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "text", + "content": "Sampling points for filtering. Inspired by NeuralPull [4], we can pull a query point to the zero level set by the gradient of the neural network " + }, + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "inline_equation", + "content": "f_{\\theta}" + }, + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "text", + "content": ". For a given query point " + }, + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "inline_equation", + "content": "\\mathbf{q}" + }, + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "text", + "content": " as input, the pulled location " + }, + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{q}}" + }, + { + "bbox": [ + 130, + 356, + 480, + 392 + ], + "type": "text", + "content": " can be formulated as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 233, + 404, + 481, + 418 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 404, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 233, + 404, + 481, + 418 + ], + "type": "interline_equation", + "content": "\\hat {\\boldsymbol {q}} = \\boldsymbol {q} - f _ {\\theta} (\\boldsymbol {q}) \\nabla f _ {\\theta} (\\boldsymbol {q}) / | | \\nabla f _ {\\theta} (\\boldsymbol {q}) | |. \\tag {5}", + "image_path": "b6b81117e224106d11d4e18ba766baed3d2f90abc1ef6cd77cf888861894e1be.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": "The point " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\pmb{q}" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{q}}" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": " lie respectively on level set " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(q)}" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "S_0" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": " as illustrate in Fig. 4(b). By adopting the sampling strategy in NeuralPull, we can generate samples " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\pmb{Q} = \\{\\pmb{q}_i|\\pmb{q}_i\\in \\pmb{R}^3\\}_{i = 1}^M" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": " on different level sets near the surface and pull them to " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "S_0" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": " by Eq. (5), to obtain " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{Q}} = \\{\\hat{\\pmb{q}}_i|\\hat{\\pmb{q}}_i = \\pmb {q}_i - f_\\theta (\\pmb {q}_i)\\nabla f_\\theta (\\pmb {q}_i) / ||\\nabla f_\\theta (\\pmb {q}_i)||,\\pmb {q}_i\\in \\pmb {Q}\\}_{i = 1}^M" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": ". Hence, we can filter the zero level set by minimizing Eq. (4) across all pulled query points " + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{Q}}" + }, + { + "bbox": [ + 130, + 423, + 482, + 496 + ], + "type": "text", + "content": ", which is equivalent to optimizing the following loss:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 255, + 506, + 481, + 527 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 506, + 481, + 527 + ], + "spans": [ + { + "bbox": [ + 255, + 506, + 481, + 527 + ], + "type": "interline_equation", + "content": "L _ {z e r o} = \\sum_ {\\hat {\\boldsymbol {q}} \\in \\hat {\\boldsymbol {Q}}} d _ {b i} (\\hat {\\boldsymbol {q}}), \\tag {6}", + "image_path": "43f578c238938f1a445915a97ea1d4417660a757eeabcf239a22581046df6b16.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "text", + "content": "where for each " + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{q}}\\in \\hat{\\mathcal{Q}}" + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(\\hat{\\pmb{q}},\\mathcal{S}_0)" + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "text", + "content": " denotes finding the neighbors of " + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{q}}" + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "text", + "content": " within the input points " + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "text", + "content": ", since " + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "text", + "content": " is assumed to be located on " + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "inline_equation", + "content": "\\mathcal{S}_0" + }, + { + "bbox": [ + 130, + 533, + 480, + 556 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "text", + "content": "This filtering mechanism can be easily extended to non-zero level sets in a similar inverse manner. To be more specific, as for level set " + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\pmb{q})}" + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "text", + "content": ", the neighbor points for query point " + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "inline_equation", + "content": "\\pmb{q} \\in \\pmb{Q}" + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "text", + "content": " are required. These points should lie on the level set " + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\pmb{q})}" + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "text", + "content": " same as " + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "inline_equation", + "content": "\\pmb{q}" + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "text", + "content": ", allowing us to filter the level set " + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\pmb{q})}" + }, + { + "bbox": [ + 130, + 558, + 481, + 616 + ], + "type": "text", + "content": " using the same filter as described in Eq. (4)." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": "However, obtaining " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(\\pmb{q}, S_{f_{\\theta}(q)})" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": " in " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": " is not feasible, since all input points " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": " are situated on the zero level set instead of the " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\pmb{q})}" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": " level set. To address this issue, we propose a technique for identifying neighbors of " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{q}" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": " on level set " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\pmb{q})}" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": ", by projecting the input points " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": " inversely onto the specific level set " + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(\\pmb{q})}" + }, + { + "bbox": [ + 130, + 617, + 481, + 667 + ], + "type": "text", + "content": " based" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": "on the gradient, as depicted in Fig. 4(b). The projected neighbor points can be represented as in Eq. (7). Filtering across multiple level sets helps to enhance the performance of our method by optimizing the consistency between different level sets within the SDF field. We further showcase this evidence in the ablation study detailed in Section Sec. 4.4." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 175, + 184, + 481, + 209 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 184, + 481, + 209 + ], + "spans": [ + { + "bbox": [ + 175, + 184, + 481, + 209 + ], + "type": "interline_equation", + "content": "\\mathcal {N} (\\boldsymbol {q}, S _ {f _ {\\theta} (q)}) = \\left\\{\\hat {\\boldsymbol {p}} \\mid \\hat {\\boldsymbol {p}} = \\boldsymbol {p} + f _ {\\theta} (\\boldsymbol {q}) \\frac {\\nabla f _ {\\theta} (\\boldsymbol {p})}{\\| \\nabla f _ {\\theta} (\\boldsymbol {p}) \\|}, \\boldsymbol {p} \\in \\mathcal {N} (\\hat {\\boldsymbol {q}}, \\mathcal {S} _ {0})) \\right\\}. \\tag {7}", + "image_path": "81481622da2548d092ecdef453aab651757f114868e28d2430a157fde66bac4c.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 212, + 479, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 212, + 479, + 247 + ], + "spans": [ + { + "bbox": [ + 131, + 212, + 479, + 247 + ], + "type": "text", + "content": "Based on the above analysis, we can filter the level sets " + }, + { + "bbox": [ + 131, + 212, + 479, + 247 + ], + "type": "inline_equation", + "content": "S_{f_{\\theta}(q)}" + }, + { + "bbox": [ + 131, + 212, + 479, + 247 + ], + "type": "text", + "content": " by minimizing Eq. (4) over all sample points " + }, + { + "bbox": [ + 131, + 212, + 479, + 247 + ], + "type": "inline_equation", + "content": "Q" + }, + { + "bbox": [ + 131, + 212, + 479, + 247 + ], + "type": "text", + "content": " through Eq. (7), equivalent to optimizing the following loss:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 255, + 247, + 481, + 267 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 247, + 481, + 267 + ], + "spans": [ + { + "bbox": [ + 255, + 247, + 481, + 267 + ], + "type": "interline_equation", + "content": "L _ {\\text {f i e l d}} = \\sum_ {\\boldsymbol {q} \\in \\boldsymbol {Q}} d _ {b i} (\\boldsymbol {q}). \\tag {8}", + "image_path": "e57ce2506d7aa2f478e5dede75d06a5fefc5096dc250c107e31c282b88e47d3b.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "spans": [ + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "content": "It is worth noting that for a fixed query point " + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "inline_equation", + "content": "\\pmb{q}" + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "content": ", the pulled query point " + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{q}}" + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "content": " dynamically changes when training the neural network, which results in a time-consuming process to repeatedly conduct neighbor searching for " + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{q}}" + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "content": ". To handle this matter, we substitute the " + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(\\hat{\\pmb{q}},\\mathcal{S}_0)" + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(NN(\\pmb {q}),\\mathcal{S}_0)" + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "inline_equation", + "content": "NN(\\pmb {q})" + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "text", + "content": " denotes the nearest point of " + }, + { + "bbox": [ + 131, + 269, + 301, + 376 + ], + "type": "inline_equation", + "content": "\\pmb{q}" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 376, + 479, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 376, + 479, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 376, + 479, + 411 + ], + "type": "text", + "content": "within the point cloud " + }, + { + "bbox": [ + 130, + 376, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 376, + 479, + 411 + ], + "type": "text", + "content": " as shown in Fig. 5. While this substitution may introduce a slight bias for training, it also ensures the neighbor points are close to " + }, + { + "bbox": [ + 130, + 376, + 479, + 411 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{q}}" + }, + { + "bbox": [ + 130, + 376, + 479, + 411 + ], + "type": "text", + "content": ", therefore this trade-off between efficiency and accuracy is reasonable." + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 304, + 270, + 482, + 327 + ], + "blocks": [ + { + "bbox": [ + 304, + 270, + 482, + 327 + ], + "lines": [ + { + "bbox": [ + 304, + 270, + 482, + 327 + ], + "spans": [ + { + "bbox": [ + 304, + 270, + 482, + 327 + ], + "type": "image", + "image_path": "5985aa965fcd972bc47e067ab7ad67f7b57c9820ca0a52d337b61403f09253f5.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "lines": [ + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "type": "text", + "content": "Fig.5: (a) Searching neighbors directly for " + }, + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\hat{q}" + }, + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "type": "text", + "content": ". (b) Searching neighbors for " + }, + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "type": "inline_equation", + "content": "NN(q)" + }, + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "type": "text", + "content": " instead of " + }, + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\hat{q}" + }, + { + "bbox": [ + 304, + 335, + 480, + 369 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 426, + 479, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 479, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 479, + 510 + ], + "type": "text", + "content": "Gradient constraint. The other problem of implicit filtering is gradient degeneration. Overfitting the neural network requires the SDF to be geometrically initialized. We can consider the initialized implicit field as the noisy field and apply our filter directly to train the network from the beginning to fit the raw point cloud by removing the 'noise'. However, if the denoise target is too complex, gradient degeneration will occur during the training process. Therefore, we need to add a constraint to the gradient of the SDF." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 510, + 479, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 479, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 479, + 556 + ], + "type": "text", + "content": "There are two ways for training the neural network to pull query points onto the surface based on NeuralPull [4] and CAP-UDF [49]. One is minimizing the distance between the pulled point " + }, + { + "bbox": [ + 130, + 510, + 479, + 556 + ], + "type": "inline_equation", + "content": "\\hat{\\pmb{q}}" + }, + { + "bbox": [ + 130, + 510, + 479, + 556 + ], + "type": "text", + "content": " and the nearest point " + }, + { + "bbox": [ + 130, + 510, + 479, + 556 + ], + "type": "inline_equation", + "content": "NN(\\pmb{q})" + }, + { + "bbox": [ + 130, + 510, + 479, + 556 + ], + "type": "text", + "content": " as formulated below:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 228, + 566, + 481, + 597 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 566, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 228, + 566, + 481, + 597 + ], + "type": "interline_equation", + "content": "L _ {p u l l} = \\frac {1}{M} \\sum_ {i \\in [ 1, M ]} | | \\hat {\\boldsymbol {q}} _ {i} - N N (\\boldsymbol {q} _ {i}) | | _ {2}. \\tag {9}", + "image_path": "c068eb9d9bb2205c99bd1bcccf0d873b0a433501b1b658d46e047b6b89b09b5e.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 599, + 479, + 623 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 599, + 479, + 623 + ], + "spans": [ + { + "bbox": [ + 131, + 599, + 479, + 623 + ], + "type": "text", + "content": "The other is minimizing the Chamfer distance between moved query points and the raw point cloud:" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 153, + 637, + 481, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 637, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 153, + 637, + 481, + 667 + ], + "type": "interline_equation", + "content": "L _ {C D} = \\frac {1}{M} \\sum_ {i \\in [ 1, M ]} \\min _ {j \\in [ 1, N ]} | | \\hat {\\boldsymbol {q}} _ {i} - \\boldsymbol {p} _ {j} | | _ {2} + \\frac {1}{N} \\sum_ {j \\in [ 1, N ]} \\min _ {i \\in [ 1, M ]} | | \\boldsymbol {p} _ {j} - \\hat {\\boldsymbol {q}} _ {i} | | _ {2}. \\tag {10}", + "image_path": "956a00beeb72c300e17321af898e50a79d88b4eba3123eef83b63fa555460f61.jpg" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 375, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 375, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 375, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": "A stable SDF can be trained by the losses above since they are trying to move the query points to be in the same distribution with the point cloud, which can provide the constraint for our implicit filter. Here we choose " + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "inline_equation", + "content": "L_{CD}" + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": " since the filtered points are likely not the nearest points and " + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "inline_equation", + "content": "L_{CD}" + }, + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": " is a more relaxed constraint." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 193, + 394, + 205 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 193, + 394, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 193, + 394, + 205 + ], + "type": "text", + "content": "Loss function. Finally, our loss function is formulated as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 216, + 214, + 481, + 228 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 214, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 216, + 214, + 481, + 228 + ], + "type": "interline_equation", + "content": "L = L _ {z e r o} + \\alpha_ {1} L _ {\\text {f i e l d}} + \\alpha_ {2} L _ {\\text {d i s t}} + \\alpha_ {3} L _ {C D}, \\tag {11}", + "image_path": "be9c7ec75ef347fe6ef68da63aa07630daa7dccdd0ea6fe6d884957b941c602a.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 235, + 454, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 235, + 454, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 235, + 454, + 247 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 235, + 454, + 247 + ], + "type": "inline_equation", + "content": "\\alpha_{1},\\alpha_{2}" + }, + { + "bbox": [ + 132, + 235, + 454, + 247 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 132, + 235, + 454, + 247 + ], + "type": "inline_equation", + "content": "\\alpha_{3}" + }, + { + "bbox": [ + 132, + 235, + 454, + 247 + ], + "type": "text", + "content": " is the balance weights for our implicit filtering loss." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "spans": [ + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": "Implementation details. We employ a neural network similar to OccNet [31] and the geometric network initialization proposed in SAL [1] with a smaller radius the same as GridPull [10] to learn the SDF. We use the strategy in NeuralPull [4] to sample queries around each point " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\pmb{p}" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": " in " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\pmb{P}" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": ". We set the weight " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\alpha_{3}" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": " to 10 to constrain the learned SDF and " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\alpha_{1}" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\alpha_{2}" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": " to 1. The parameters " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\sigma_{n},\\sigma_{p}" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": " are set to " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "15^{\\circ}" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\max_{\\pmb {p}_j\\in \\mathcal{N}(\\bar{\\pmb{p}},S_{f_\\theta (\\bar{p})})}(||\\bar{\\pmb{p}} -\\pmb {p}_j||)" + }, + { + "bbox": [ + 130, + 263, + 482, + 339 + ], + "type": "text", + "content": " respectively." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 354, + 230, + 367 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 230, + 367 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 230, + 367 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 378, + 482, + 438 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 438 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 438 + ], + "type": "text", + "content": "We conducted experiments to assess the performance of our implicit filter for surface reconstruction from raw point clouds. The results are presented for general shapes in Sec. 4.1, real scanned raw data including 3D objects in Sec. 4.2, and complex scenes in Sec. 4.3. Additionally, ablation experiments were carried out to validate the theory and explore the impact of various parameters in Sec. 4.4." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 455, + 334, + 467 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 455, + 334, + 467 + ], + "spans": [ + { + "bbox": [ + 132, + 455, + 334, + 467 + ], + "type": "text", + "content": "4.1 Surface Reconstruction for Shapes" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 474, + 254, + 484 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 474, + 254, + 484 + ], + "spans": [ + { + "bbox": [ + 132, + 474, + 254, + 484 + ], + "type": "text", + "content": "Datasets and metrics." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 486, + 256, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 256, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 256, + 628 + ], + "type": "text", + "content": "For surface reconstruction of general shapes from raw point clouds, we conduct evaluations on three widely used datasets including a subset of ShapeNet [8], ABC [20], and FAMOUS [12]. We use the same setting with NeuralPull [4] for the dataset ShapeNet. For datasets ABC and FAMOUS, we use the train/test" + } + ] + } + ], + "index": 11 + }, + { + "type": "table", + "bbox": [ + 263, + 511, + 478, + 613 + ], + "blocks": [ + { + "bbox": [ + 260, + 488, + 480, + 510 + ], + "lines": [ + { + "bbox": [ + 260, + 488, + 480, + 510 + ], + "spans": [ + { + "bbox": [ + 260, + 488, + 480, + 510 + ], + "type": "text", + "content": "Table 1: Comparisons on ABC and Famous datasets. The threshold of F-score (F-S.) is 0.01." + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 263, + 511, + 478, + 613 + ], + "lines": [ + { + "bbox": [ + 263, + 511, + 478, + 613 + ], + "spans": [ + { + "bbox": [ + 263, + 511, + 478, + 613 + ], + "type": "table", + "html": "
MethodsABCFAMOUS
CDL2CDL1F-S.CDL2CDL1F-S.
P2S [12]0.2980.0150.5980.0120.0080.752
IGR [14]2.6750.0630.4481.4740.0440.573
NP [4]0.0950.0110.6730.1000.0120.746
PCP [3]0.2520.0230.3730.0370.0140.435
SIREN [38]0.0220.0120.4930.0250.0120.561
DIGS [5]0.0210.0100.6670.0150.0080.772
Ours0.0110.0090.6910.0080.0070.778
", + "image_path": "ad67baecab20f749e502bfee3ad24d77c95074ce406d98f7001704335a54edd6.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "table_body" + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "content": "splitting released by Points2Surf [12] and we sample points directly from the mesh in the ABC dataset without other mesh preprocessing to keep the sharp features." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 101 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 479, + 305 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 479, + 305 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 479, + 305 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 479, + 305 + ], + "type": "image", + "image_path": "47c50031cc3f22c0bbe79e00e52fdc1cc4bed201150377edaa0c004cbccac331.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 312, + 482, + 344 + ], + "lines": [ + { + "bbox": [ + 130, + 312, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 482, + 344 + ], + "type": "text", + "content": "Fig. 6: Visual comparisons of surface reconstruction on ABC and FAMOUS datasets. Our method can reconstruct objects with sharp edges and less noise compared with other methods." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "content": "For evaluating the performance, we follow NeuralPull to sample " + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "inline_equation", + "content": "1 \\times 10^{5}" + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "content": " points from the reconstructed surfaces and the ground truth meshes on the ShapeNet dataset and sample " + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "inline_equation", + "content": "1 \\times 10^{4}" + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "content": " on the ABC and FAMOUS datasets. For the evaluation metrics, we use L1 and L2 Chamfer distance (" + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "inline_equation", + "content": "CD_{L1}" + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "inline_equation", + "content": "CD_{L2}" + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "content": ") to measure the error. Moreover, we adopt normal consistency (NC) and F-score to evaluate the accuracy of the reconstructed surface, the threshold is the same with NeuralPull." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 474, + 301, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 301, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 301, + 641 + ], + "type": "text", + "content": "Comparisons. To evaluate the validity of our implicit filter, we compare our method with a variety of methods including SPSR [19], Points2Surf (P2S) [12], IGR [14], NeuralPull (NP) [4], LPI [9], PCP [3], GridPull (GP) [10], SIREN [38], DIGs [5]. The quantitative results on ABC and FAMOUS datasets are shown in Tab. 1, and selectively visualized in Fig. 6. Our model reaches state-of-the-art performance on both datasets, accomplishing the goal of eliminating noise on each level set while preserving the ge" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "ometric details. To more intuitively validate the efficacy of our filtering, we visualize the level sets on a cross section in Fig. 7. We also report the results on" + } + ] + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 310, + 476, + 476, + 610 + ], + "blocks": [ + { + "bbox": [ + 310, + 476, + 476, + 610 + ], + "lines": [ + { + "bbox": [ + 310, + 476, + 476, + 610 + ], + "spans": [ + { + "bbox": [ + 310, + 476, + 476, + 610 + ], + "type": "image", + "image_path": "b479b2f0b9aa20f063df450fbcf1acd87c3617dc52258c2e16387dda9a4b31f2.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 618, + 482, + 640 + ], + "lines": [ + { + "bbox": [ + 304, + 618, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 304, + 618, + 482, + 640 + ], + "type": "text", + "content": "Fig. 7: Visualization of level sets on a cross section." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 306, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 306, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 306, + 641, + 481, + 665 + ], + "type": "text", + "content": "idate the efficacy of our filtering, we viin Fig. 7. We also report the results on" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 170, + 135, + 441, + 194 + ], + "blocks": [ + { + "bbox": [ + 214, + 114, + 398, + 126 + ], + "lines": [ + { + "bbox": [ + 214, + 114, + 398, + 126 + ], + "spans": [ + { + "bbox": [ + 214, + 114, + 398, + 126 + ], + "type": "text", + "content": "Table 2: Comparisons on ShapeNet dataset." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 170, + 135, + 441, + 194 + ], + "lines": [ + { + "bbox": [ + 170, + 135, + 441, + 194 + ], + "spans": [ + { + "bbox": [ + 170, + 135, + 441, + 194 + ], + "type": "table", + "html": "
SPSR [19]NP [4]LPI [9]PCP [3]GP [10]Ours
CDL2 × 1000.2860.0380.01710.01360.00860.0032
NC0.8660.9390.95960.95900.97230.9779
F-Score (0.002)0.4070.9610.99120.98710.98960.9976
F-Score (0.004)0.6180.9760.99570.98990.99230.9985
", + "image_path": "01c9e1bce9a25e6e724dcfa1548a1736ff95c7c578d35fa4a7edc32649c5d2f1.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 137, + 213, + 473, + 345 + ], + "blocks": [ + { + "bbox": [ + 137, + 213, + 473, + 345 + ], + "lines": [ + { + "bbox": [ + 137, + 213, + 473, + 345 + ], + "spans": [ + { + "bbox": [ + 137, + 213, + 473, + 345 + ], + "type": "image", + "image_path": "b97f62162b736400a4a730962659033ce9a166fd88e19c9dc3fa76967edca95b.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 153, + 353, + 457, + 364 + ], + "lines": [ + { + "bbox": [ + 153, + 353, + 457, + 364 + ], + "spans": [ + { + "bbox": [ + 153, + 353, + 457, + 364 + ], + "type": "text", + "content": "Fig. 8: Visual comparisons of surface reconstruction on ShapeNet dataset." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 385, + 480, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 385, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 385, + 480, + 456 + ], + "type": "text", + "content": "ShapeNet which contains over 3000 objects in terms of " + }, + { + "bbox": [ + 130, + 385, + 480, + 456 + ], + "type": "inline_equation", + "content": "CD_{L2}" + }, + { + "bbox": [ + 130, + 385, + 480, + 456 + ], + "type": "text", + "content": ", NC, and F-Score with thresholds of 0.002 and 0.004 in Tab. 2. The detailed comparison for each class of ShapeNet can be found in the supplementary material. Our method outperforms previous methods over most classes. The visualization comparisons in Fig. 8 show that our method can reconstruct a smoother surface with fine details." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": "To validate the effect of our filter on sharp geometric features. We evaluate the edge points by the edge Chamfer distance metric used in [11]. We sample 100k points uniformly on the surface of both the reconstructed mesh and ground truth. The edge point " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "\\pmb{p}" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": " is calculated by finding whether there exists a point " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "\\pmb{q} \\in \\mathcal{N}_{\\epsilon}(\\pmb{p})" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": " satisfied " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "|\\pmb{n}_q\\pmb{n}_p| < \\sigma" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "\\mathcal{N}_{\\epsilon}(\\pmb{p})" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": " represents the neighbor points within distance " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "\\pmb{p}" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": ". The results are shown in Tab. 3 and visualized in Fig. 9. We set " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "\\epsilon = 0.01" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "inline_equation", + "content": "\\sigma = 0.1" + }, + { + "bbox": [ + 130, + 457, + 480, + 541 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 557, + 353, + 569 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 353, + 569 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 353, + 569 + ], + "type": "text", + "content": "4.2 Surface Reconstruction for Real Scans" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "text", + "content": "Dataset and metrics. For surface reconstruction of real point cloud scans, we follow VisCo [37] to evaluate our method under the Surface Reconstruction Benchmarks (SRB) [46]. We use Chamfer and Hausdorff distances " + }, + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "inline_equation", + "content": "(CD_{L1}" + }, + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "text", + "content": " and HD) between the reconstruction meshes and the ground truth. Furthermore, we report their corresponding one-sided distances " + }, + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "inline_equation", + "content": "(d_{\\vec{C}}" + }, + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "inline_equation", + "content": "d_{\\vec{H}})" + }, + { + "bbox": [ + 130, + 575, + 479, + 647 + ], + "type": "text", + "content": " between the reconstructed meshes and the input noisy point cloud." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 157, + 135, + 454, + 172 + ], + "blocks": [ + { + "bbox": [ + 145, + 114, + 466, + 125 + ], + "lines": [ + { + "bbox": [ + 145, + 114, + 466, + 125 + ], + "spans": [ + { + "bbox": [ + 145, + 114, + 466, + 125 + ], + "type": "text", + "content": "Table 3: Edge Chamfer distance comparisons on ABC dataset, " + }, + { + "bbox": [ + 145, + 114, + 466, + 125 + ], + "type": "inline_equation", + "content": "{ECD}_{L2} \\times {100}" + }, + { + "bbox": [ + 145, + 114, + 466, + 125 + ], + "type": "text", + "content": " ." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 157, + 135, + 454, + 172 + ], + "lines": [ + { + "bbox": [ + 157, + 135, + 454, + 172 + ], + "spans": [ + { + "bbox": [ + 157, + 135, + 454, + 172 + ], + "type": "table", + "html": "
MethodsP2S [12]IGR [14]NP [4]PCP [3]SIREN [38]DIGS [5]Ours
ECDL10.04960.08350.05010.06280.06950.07860.0256
ECDL21.0552.3651.2551.2651.4072.4930.399
", + "image_path": "5ddf7b515bb863e9d28bc742042f8bd2637fb837a38b22b1251224db5bc1ce4d.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 137, + 184, + 475, + 358 + ], + "blocks": [ + { + "bbox": [ + 137, + 184, + 475, + 358 + ], + "lines": [ + { + "bbox": [ + 137, + 184, + 475, + 358 + ], + "spans": [ + { + "bbox": [ + 137, + 184, + 475, + 358 + ], + "type": "image", + "image_path": "1da0f1256aa127b2661c1a70e8b8517f65f3955a7165d94d50ae3e1dbb713111.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 165, + 365, + 447, + 376 + ], + "lines": [ + { + "bbox": [ + 165, + 365, + 447, + 376 + ], + "spans": [ + { + "bbox": [ + 165, + 365, + 447, + 376 + ], + "type": "text", + "content": "Fig. 9: Visual comparisons of edge points and reconstruction results." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 403, + 265, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 265, + 509 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 265, + 509 + ], + "type": "text", + "content": "Comparisons. We compare our method with state-of-the-art methods under the real scanned SRB dataset, including IGR [14], SPSR [19], Shape As Points (SAP) [34], NeuralPull (NP) [4], and GridPull (GP) [10]. The numerical comparisons are shown in Table 2." + } + ] + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 273, + 408, + 355, + 468 + ], + "blocks": [ + { + "bbox": [ + 273, + 408, + 355, + 468 + ], + "lines": [ + { + "bbox": [ + 273, + 408, + 355, + 468 + ], + "spans": [ + { + "bbox": [ + 273, + 408, + 355, + 468 + ], + "type": "image", + "image_path": "e7362449dfb9f3a0507423c77ce536bfec505f6e243aa255fe62af290386df75.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 282, + 471, + 307, + 479 + ], + "lines": [ + { + "bbox": [ + 282, + 471, + 307, + 479 + ], + "spans": [ + { + "bbox": [ + 282, + 471, + 307, + 479 + ], + "type": "text", + "content": "(a) Input" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 356, + 408, + 396, + 471 + ], + "blocks": [ + { + "bbox": [ + 356, + 408, + 396, + 471 + ], + "lines": [ + { + "bbox": [ + 356, + 408, + 396, + 471 + ], + "spans": [ + { + "bbox": [ + 356, + 408, + 396, + 471 + ], + "type": "image", + "image_path": "45972bd27e0205012f547a3a8a0b00369cf5fb2f4d6baaee3cdd344802a96a5b.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 362, + 471, + 388, + 479 + ], + "lines": [ + { + "bbox": [ + 362, + 471, + 388, + 479 + ], + "spans": [ + { + "bbox": [ + 362, + 471, + 388, + 479 + ], + "type": "text", + "content": "(c) SPSR" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 398, + 471, + 436, + 479 + ], + "lines": [ + { + "bbox": [ + 398, + 471, + 436, + 479 + ], + "spans": [ + { + "bbox": [ + 398, + 471, + 436, + 479 + ], + "type": "text", + "content": "(d) NeuralPull" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 397, + 409, + 437, + 466 + ], + "blocks": [ + { + "bbox": [ + 397, + 409, + 437, + 466 + ], + "lines": [ + { + "bbox": [ + 397, + 409, + 437, + 466 + ], + "spans": [ + { + "bbox": [ + 397, + 409, + 437, + 466 + ], + "type": "image", + "image_path": "381567d50bd9ce29669ea83d260e465c9de453c42b830d06e66be7b3acd53eb1.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 282, + 487, + 468, + 499 + ], + "lines": [ + { + "bbox": [ + 282, + 487, + 468, + 499 + ], + "spans": [ + { + "bbox": [ + 282, + 487, + 468, + 499 + ], + "type": "text", + "content": "Fig. 10: Visual comparisons on SRB dataset." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 438, + 410, + 478, + 466 + ], + "blocks": [ + { + "bbox": [ + 438, + 410, + 478, + 466 + ], + "lines": [ + { + "bbox": [ + 438, + 410, + 478, + 466 + ], + "spans": [ + { + "bbox": [ + 438, + 410, + 478, + 466 + ], + "type": "image", + "image_path": "33052205e6e92893af1cf6da981d4682117c5174734a86bf807a4a163f27fcc3.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 444, + 471, + 469, + 479 + ], + "lines": [ + { + "bbox": [ + 444, + 471, + 469, + 479 + ], + "spans": [ + { + "bbox": [ + 444, + 471, + 469, + 479 + ], + "type": "text", + "content": "(e) Ours" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 510, + 480, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 480, + 545 + ], + "type": "text", + "content": "in Tab. 4, where we achieve the best accuracy in most cases. The visual comparisons in Fig. 10 demonstrate that our method can reconstruct a continuous and smooth surface with geometry details." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 569, + 332, + 580 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 569, + 332, + 580 + ], + "spans": [ + { + "bbox": [ + 132, + 569, + 332, + 580 + ], + "type": "text", + "content": "4.3 Surface Reconstruction for Scenes" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "Dataset and metrics. To further demonstrate the advantage of our method in the surface reconstruction of real scene scans, we conduct experiments using the 3D Scene dataset. The 3D Scene dataset is a challenging real-world dataset with complex topology and noisy open surfaces. We uniformly sample 1000 points per " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "m^2" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " of each scene as the input and follow PCP [3] to sample 1M points on both the reconstructed and the ground truth surfaces. We leverage L1 and L2" + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 136, + 479, + 331 + ], + "blocks": [ + { + "bbox": [ + 223, + 114, + 388, + 125 + ], + "lines": [ + { + "bbox": [ + 223, + 114, + 388, + 125 + ], + "spans": [ + { + "bbox": [ + 223, + 114, + 388, + 125 + ], + "type": "text", + "content": "Table 4: Comparisons on SRB dataset." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 136, + 479, + 331 + ], + "lines": [ + { + "bbox": [ + 135, + 136, + 479, + 331 + ], + "spans": [ + { + "bbox": [ + 135, + 136, + 479, + 331 + ], + "type": "table", + "html": "
SPSR [19]IGR [14]SIREN [38]VisCo [37]SAP [34]NP [4]GP [10]DIGS [5]Ours
AnchorCDL10.600.220.320.210.120.1220.0930.0630.052
HD14.894.718.193.002.383.2431.8041.4471.232
dC0.600.120.100.150.080.0610.0660.0300.025
dH14.891.322.4321.070.833.2080.4600.2700.265
DaratechCDL10.440.250.210.210.260.3750.0620.0490.051
HD7.244.014.304.060.873.1270.6480.8580.751
dC0.440.080.090.140.040.7460.0390.0250.028
dH7.241.591.771.760.413.2670.2930.4410.423
DCCDL10.270.170.150.150.070.1570.0660.0420.041
HD3.102.222.182.221.173.5411.1030.6670.815
dC0.270.090.060.090.040.2420.0360.0220.019
dH3.102.612.762.760.533.5230.5390.7290.724
GargoyleCDL10.260.160.170.170.070.0800.0630.0470.044
HD6.803.524.644.401.491.3761.1290.9711.089
dC0.260.060.080.110.050.0630.0450.0280.022
dH6.800.810.910.960.780.4750.7000.2710.246
Lord QuasCDL10.200.120.170.120.050.0640.0470.0310.030
HD4.611.170.821.060.980.8220.5690.4960.554
dC0.200.070.120.070.040.0530.0310.0170.014
dH4.610.980.760.640.510.5080.3700.1810.230
", + "image_path": "765ec552a8d45b986a3331684474b2d65dd46cde9e9564175174fa7cf308bd41.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 138, + 357, + 205, + 399 + ], + "blocks": [ + { + "bbox": [ + 138, + 357, + 205, + 399 + ], + "lines": [ + { + "bbox": [ + 138, + 357, + 205, + 399 + ], + "spans": [ + { + "bbox": [ + 138, + 357, + 205, + 399 + ], + "type": "image", + "image_path": "1bede750b0c99c202bdd2e35a6d0269bfe7cc00fc01695e9a902332451fe0b52.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 137, + 400, + 205, + 442 + ], + "blocks": [ + { + "bbox": [ + 137, + 400, + 205, + 442 + ], + "lines": [ + { + "bbox": [ + 137, + 400, + 205, + 442 + ], + "spans": [ + { + "bbox": [ + 137, + 400, + 205, + 442 + ], + "type": "image", + "image_path": "ae6b83e6251167302df71b9e55112f28b431ecb096c4a24d6275499335e34068.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 151, + 443, + 191, + 453 + ], + "lines": [ + { + "bbox": [ + 151, + 443, + 191, + 453 + ], + "spans": [ + { + "bbox": [ + 151, + 443, + 191, + 453 + ], + "type": "text", + "content": "(a) GridPull" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 205, + 357, + 271, + 400 + ], + "blocks": [ + { + "bbox": [ + 205, + 357, + 271, + 400 + ], + "lines": [ + { + "bbox": [ + 205, + 357, + 271, + 400 + ], + "spans": [ + { + "bbox": [ + 205, + 357, + 271, + 400 + ], + "type": "image", + "image_path": "61b69745b83a95e377f285eafac7e0c21ee40496532ad49c093896a1a7fd661f.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 205, + 401, + 272, + 442 + ], + "blocks": [ + { + "bbox": [ + 205, + 401, + 272, + 442 + ], + "lines": [ + { + "bbox": [ + 205, + 401, + 272, + 442 + ], + "spans": [ + { + "bbox": [ + 205, + 401, + 272, + 442 + ], + "type": "image", + "image_path": "8df6d2ddb651526fccfb512e4de2956bcb0fccf91e00a7433f31d82d74ff5842.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 225, + 443, + 252, + 453 + ], + "lines": [ + { + "bbox": [ + 225, + 443, + 252, + 453 + ], + "spans": [ + { + "bbox": [ + 225, + 443, + 252, + 453 + ], + "type": "text", + "content": "(b) PCP" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 274, + 357, + 340, + 400 + ], + "blocks": [ + { + "bbox": [ + 274, + 357, + 340, + 400 + ], + "lines": [ + { + "bbox": [ + 274, + 357, + 340, + 400 + ], + "spans": [ + { + "bbox": [ + 274, + 357, + 340, + 400 + ], + "type": "image", + "image_path": "0c37c8482120c47e95e39d27faecf9931ceb5cf8aa1af079cdd09f2eb727c7c4.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 274, + 401, + 339, + 442 + ], + "blocks": [ + { + "bbox": [ + 274, + 401, + 339, + 442 + ], + "lines": [ + { + "bbox": [ + 274, + 401, + 339, + 442 + ], + "spans": [ + { + "bbox": [ + 274, + 401, + 339, + 442 + ], + "type": "image", + "image_path": "a88a54698b5aeb3c328b3506a8ce5478548200d0bd437916cbeef699335327ca.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 283, + 443, + 330, + 453 + ], + "lines": [ + { + "bbox": [ + 283, + 443, + 330, + 453 + ], + "spans": [ + { + "bbox": [ + 283, + 443, + 330, + 453 + ], + "type": "text", + "content": "(c) NeuralPull" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 153, + 461, + 459, + 472 + ], + "lines": [ + { + "bbox": [ + 153, + 461, + 459, + 472 + ], + "spans": [ + { + "bbox": [ + 153, + 461, + 459, + 472 + ], + "type": "text", + "content": "Fig. 11: Visual comparisons of surface reconstruction on 3D Scene dataset." + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 343, + 357, + 407, + 400 + ], + "blocks": [ + { + "bbox": [ + 343, + 357, + 407, + 400 + ], + "lines": [ + { + "bbox": [ + 343, + 357, + 407, + 400 + ], + "spans": [ + { + "bbox": [ + 343, + 357, + 407, + 400 + ], + "type": "image", + "image_path": "d715748af5f396b9dd9088e5446d5b75bea5de92c20604ba6bcfcc64ccb59832.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 342, + 401, + 407, + 442 + ], + "blocks": [ + { + "bbox": [ + 342, + 401, + 407, + 442 + ], + "lines": [ + { + "bbox": [ + 342, + 401, + 407, + 442 + ], + "spans": [ + { + "bbox": [ + 342, + 401, + 407, + 442 + ], + "type": "image", + "image_path": "afcc60799326adbc58f27568cd969ed55f065eb62d234a1854e9ad659a924fa4.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 361, + 443, + 390, + 453 + ], + "lines": [ + { + "bbox": [ + 361, + 443, + 390, + 453 + ], + "spans": [ + { + "bbox": [ + 361, + 443, + 390, + 453 + ], + "type": "text", + "content": "(d) Ours" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 410, + 357, + 477, + 400 + ], + "blocks": [ + { + "bbox": [ + 410, + 357, + 477, + 400 + ], + "lines": [ + { + "bbox": [ + 410, + 357, + 477, + 400 + ], + "spans": [ + { + "bbox": [ + 410, + 357, + 477, + 400 + ], + "type": "image", + "image_path": "57824b5efbc99f2624fd7cf7aa97cd2a19ff3ba05b1bb82e1015957e5423aae2.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 410, + 401, + 476, + 442 + ], + "blocks": [ + { + "bbox": [ + 410, + 401, + 476, + 442 + ], + "lines": [ + { + "bbox": [ + 410, + 401, + 476, + 442 + ], + "spans": [ + { + "bbox": [ + 410, + 401, + 476, + 442 + ], + "type": "image", + "image_path": "906947a8589292cb84f782a92cbd2b97d1b50d53a32097291681e3d5ce478439.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 431, + 443, + 454, + 453 + ], + "lines": [ + { + "bbox": [ + 431, + 443, + 454, + 453 + ], + "spans": [ + { + "bbox": [ + 431, + 443, + 454, + 453 + ], + "type": "text", + "content": "(e) GT" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 498, + 482, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 523 + ], + "type": "text", + "content": "Chamfer distance " + }, + { + "bbox": [ + 130, + 498, + 482, + 523 + ], + "type": "inline_equation", + "content": "(CD_{L1}, CD_{L2})" + }, + { + "bbox": [ + 130, + 498, + 482, + 523 + ], + "type": "text", + "content": " and normal consistency (NC) to evaluate the reconstruction quality." + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "content": "Comparisons. We compare our method with the state-of-the-art methods ConvONet [35], LIG [18], DeepLS [7], NeuralPull (NP) [4], PCP [3], GridPull (GP) [10]. The numerical comparisons in Tab. 5 demonstrate our superior performance in all scenes even compared with the local-based methods. We further present visual comparisons in Fig. 11. The visualization further shows that our method can achieve smoother with high-fidelity surfaces in complex scenes. It should be noted that the surface we extract here is not the zero level set but the 0.001 level set since the scene is not watertight. For NeuralPull we use the threshold of 0.005 instead of 0.001 to extract the complete surface therefore the mesh looks thicker." + } + ] + } + ], + "index": 21 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 135, + 479, + 211 + ], + "blocks": [ + { + "bbox": [ + 185, + 114, + 427, + 126 + ], + "lines": [ + { + "bbox": [ + 185, + 114, + 427, + 126 + ], + "spans": [ + { + "bbox": [ + 185, + 114, + 427, + 126 + ], + "type": "text", + "content": "Table 5: Comparisons on 3D Scene dataset, " + }, + { + "bbox": [ + 185, + 114, + 427, + 126 + ], + "type": "inline_equation", + "content": "CD_{L2} \\times 1000" + }, + { + "bbox": [ + 185, + 114, + 427, + 126 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 135, + 479, + 211 + ], + "lines": [ + { + "bbox": [ + 135, + 135, + 479, + 211 + ], + "spans": [ + { + "bbox": [ + 135, + 135, + 479, + 211 + ], + "type": "table", + "html": "
BurghersLoungeCopyroomStonewallTotempole
CDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NCCDL2CDL1NC
ConvONet [35]27.460.0790.9079.540.0460.89410.970.0450.89220.460.0690.9052.0540.0210.943
LIG [18]3.0550.0450.8359.6720.0560.8333.610.0360.8105.0320.0420.8799.580.0620.887
DeepLS [7]0.4010.0170.9206.1030.0530.8480.6090.0210.9010.3200.0150.9540.6010.0170.950
GP [10]1.3670.0280.8734.6840.0530.8272.3270.0300.8572.2340.0240.9132.2780.0340.878
PCP [3]1.3390.0310.9290.4320.0140.9340.4050.0140.9140.2660.0140.9571.0890.0290.954
NP [4]0.8970.0250.8830.8550.0220.8870.4790.0180.8620.4340.0180.9291.6040.0320.923
Ours0.1330.0110.9340.1200.0080.9260.1110.0090.9130.0820.0090.9570.2030.0130.944
", + "image_path": "302010eba0dc4a219f6fd6bd4aaf536229f8b9ce2bf49d0fc21dc1e7393c49c8.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 138, + 224, + 197, + 284 + ], + "blocks": [ + { + "bbox": [ + 138, + 224, + 197, + 284 + ], + "lines": [ + { + "bbox": [ + 138, + 224, + 197, + 284 + ], + "spans": [ + { + "bbox": [ + 138, + 224, + 197, + 284 + ], + "type": "image", + "image_path": "4eba333e8c53ba7d786629102532c4ccefdd1b4fe529735970a2e95f94c93a94.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 146, + 285, + 192, + 293 + ], + "lines": [ + { + "bbox": [ + 146, + 285, + 192, + 293 + ], + "spans": [ + { + "bbox": [ + 146, + 285, + 192, + 293 + ], + "type": "text", + "content": "(a) Input Points" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 198, + 224, + 264, + 285 + ], + "blocks": [ + { + "bbox": [ + 198, + 224, + 264, + 285 + ], + "lines": [ + { + "bbox": [ + 198, + 224, + 264, + 285 + ], + "spans": [ + { + "bbox": [ + 198, + 224, + 264, + 285 + ], + "type": "image", + "image_path": "bdaa44aac7fded6ab639ba9cbf99bd363d4c4e36303d2a64404084058a8ce356.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 216, + 285, + 242, + 293 + ], + "lines": [ + { + "bbox": [ + 216, + 285, + 242, + 293 + ], + "spans": [ + { + "bbox": [ + 216, + 285, + 242, + 293 + ], + "type": "text", + "content": "(b) " + }, + { + "bbox": [ + 216, + 285, + 242, + 293 + ], + "type": "inline_equation", + "content": "L_{\\text{pull}}" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 264, + 224, + 329, + 285 + ], + "blocks": [ + { + "bbox": [ + 264, + 224, + 329, + 285 + ], + "lines": [ + { + "bbox": [ + 264, + 224, + 329, + 285 + ], + "spans": [ + { + "bbox": [ + 264, + 224, + 329, + 285 + ], + "type": "image", + "image_path": "cb8e2aebd2be87db4e64855da406eca67dde6a8e9b1e0d3e6a65550a6a65721b.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 284, + 285, + 306, + 293 + ], + "lines": [ + { + "bbox": [ + 284, + 285, + 306, + 293 + ], + "spans": [ + { + "bbox": [ + 284, + 285, + 306, + 293 + ], + "type": "text", + "content": "(c) " + }, + { + "bbox": [ + 284, + 285, + 306, + 293 + ], + "type": "inline_equation", + "content": "L_{CD}" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 303, + 480, + 325 + ], + "lines": [ + { + "bbox": [ + 131, + 303, + 480, + 325 + ], + "spans": [ + { + "bbox": [ + 131, + 303, + 480, + 325 + ], + "type": "text", + "content": "Fig. 12: The 2D level sets show the distance field learned by different losses. The red lines represent the learned zero level set." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 329, + 224, + 394, + 285 + ], + "blocks": [ + { + "bbox": [ + 329, + 224, + 394, + 285 + ], + "lines": [ + { + "bbox": [ + 329, + 224, + 394, + 285 + ], + "spans": [ + { + "bbox": [ + 329, + 224, + 394, + 285 + ], + "type": "image", + "image_path": "64e522315c30a37f1b8ef70fe04bd818e1f7c4a401638256772c55d1d02af5b9.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 336, + 285, + 383, + 294 + ], + "lines": [ + { + "bbox": [ + 336, + 285, + 383, + 294 + ], + "spans": [ + { + "bbox": [ + 336, + 285, + 383, + 294 + ], + "type": "text", + "content": "(c) " + }, + { + "bbox": [ + 336, + 285, + 383, + 294 + ], + "type": "inline_equation", + "content": "L_{CD} + L_{zero}" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 393, + 285, + 464, + 294 + ], + "lines": [ + { + "bbox": [ + 393, + 285, + 464, + 294 + ], + "spans": [ + { + "bbox": [ + 393, + 285, + 464, + 294 + ], + "type": "text", + "content": "(d) " + }, + { + "bbox": [ + 393, + 285, + 464, + 294 + ], + "type": "inline_equation", + "content": "L_{CD} + L_{zero} + L_{field}" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 394, + 224, + 478, + 285 + ], + "blocks": [ + { + "bbox": [ + 394, + 224, + 478, + 285 + ], + "lines": [ + { + "bbox": [ + 394, + 224, + 478, + 285 + ], + "spans": [ + { + "bbox": [ + 394, + 224, + 478, + 285 + ], + "type": "image", + "image_path": "604a57291afe1b44f994add003b2f0074d226a465c9d64f2d1d3ed51d6c1bfd5.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 351, + 245, + 361 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 351, + 245, + 361 + ], + "spans": [ + { + "bbox": [ + 132, + 351, + 245, + 361 + ], + "type": "text", + "content": "4.4 Ablation Studies" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 376, + 479, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 376, + 479, + 425 + ], + "spans": [ + { + "bbox": [ + 130, + 376, + 479, + 425 + ], + "type": "text", + "content": "We conduct ablation studies on the FAMOUS dataset to demonstrate the effectiveness of our proposed implicit filter and explore the effect of some important hyperparameters. We report the performance in terms of L1 and L2 Chamfer distance " + }, + { + "bbox": [ + 130, + 376, + 479, + 425 + ], + "type": "inline_equation", + "content": "(CD_{L1}, CD_{L2} \\times 10^{3})" + }, + { + "bbox": [ + 130, + 376, + 479, + 425 + ], + "type": "text", + "content": ", normal consistency (NC), and F-Score (F-S.)." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 131, + 426, + 265, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 426, + 265, + 496 + ], + "spans": [ + { + "bbox": [ + 131, + 426, + 265, + 496 + ], + "type": "text", + "content": "Effect of Eikonal loss. We select the " + }, + { + "bbox": [ + 131, + 426, + 265, + 496 + ], + "type": "inline_equation", + "content": "L_{CD}" + }, + { + "bbox": [ + 131, + 426, + 265, + 496 + ], + "type": "text", + "content": " to prevent the degeneration of the gradient since it both constrains the value and the gradient of the SDF. It also guides how to pull" + } + ] + } + ], + "index": 17 + }, + { + "type": "table", + "bbox": [ + 276, + 441, + 472, + 488 + ], + "blocks": [ + { + "bbox": [ + 300, + 430, + 451, + 440 + ], + "lines": [ + { + "bbox": [ + 300, + 430, + 451, + 440 + ], + "spans": [ + { + "bbox": [ + 300, + 430, + 451, + 440 + ], + "type": "text", + "content": "Table 6: Effect of the Eikonal term." + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 276, + 441, + 472, + 488 + ], + "lines": [ + { + "bbox": [ + 276, + 441, + 472, + 488 + ], + "spans": [ + { + "bbox": [ + 276, + 441, + 472, + 488 + ], + "type": "table", + "html": "
LossCDL1CDL2F-S.NC
w/ Eikonal, w/o CD0.0090.0210.7380.899
w/ Eikonal, w/ CD0.0080.0090.7740.910
w/o Eikonal, w/ CD0.0070.0080.7780.911
", + "image_path": "12971b3d9c7cd6e215cd10ec96af99c2b081cb4c88fcf6281215aecb4d4829c2.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "table_body" + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 497, + 480, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 497, + 480, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 497, + 480, + 579 + ], + "type": "text", + "content": "the query point onto the surface. Therefore we omit the Eikonal term used in previous methods like the IGR [14], SIREN [38], and DIGS [5] which have no other direct supervision for the gradient. To verify this selection, we conduct the following experiments by trade-off these two functions. With the experimental results in Tab. 6, we find that only applying the Eikonal term is not as effective as CD alone. At the same time combining the Eikonal term with CD does not further enhance the experiment results, but the difference is small." + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "content": "Effect of level set filtering. To justify the effectiveness of each term in our loss function. We report the results trained by different combinations in Tab. 7. The " + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "L_{CD}" + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "content": " is more applicable for training SDF from raw point clouds. The zero-level filter can help remove the noise and keep the geometric features. Filtering across non-zero level sets can improve the overall consistency of the entire signed distance field. Since we assume all input points lie on the surface, the function " + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "L_{dist}" + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "content": " is also necessary. Fig. 12 shows a 2D comparison of these losses, showing" + } + ] + } + ], + "index": 21 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "that our filter loss functions can reconstruct a field that is aligned at all level sets and maintains geometric characteristics." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 479, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 479, + 188 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 479, + 188 + ], + "type": "text", + "content": "Effect of the bidirectional projection. To validate our bidirectional projection distance, we report the results in Tab. 8. The numerical comparisons show that projecting the distance to both normals can improve the reconstruction quality. Note that only using " + }, + { + "bbox": [ + 130, + 140, + 479, + 188 + ], + "type": "inline_equation", + "content": "d(\\bar{p})" + }, + { + "bbox": [ + 130, + 140, + 479, + 188 + ], + "type": "text", + "content": " can also improve the results." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 215, + 332, + 285 + ], + "blocks": [ + { + "bbox": [ + 166, + 194, + 307, + 205 + ], + "lines": [ + { + "bbox": [ + 166, + 194, + 307, + 205 + ], + "spans": [ + { + "bbox": [ + 166, + 194, + 307, + 205 + ], + "type": "text", + "content": "Table 7: Effect of different losses." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 215, + 332, + 285 + ], + "lines": [ + { + "bbox": [ + 133, + 215, + 332, + 285 + ], + "spans": [ + { + "bbox": [ + 133, + 215, + 332, + 285 + ], + "type": "table", + "html": "
LossCDL1CDL2F-S.NC
Lpull0.0120.0830.7420.884
LCD0.0100.0310.7570.891
LCD + Lzero0.0080.0180.7720.905
LCD + Lzero + Lfield0.0080.0110.7690.908
Ours0.0070.0080.7780.911
", + "image_path": "5488b1a3f0f7d92a0ddd5f379e55191e8b50f149c0a602b55745c222bf205791.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 363, + 220, + 444, + 280 + ], + "blocks": [ + { + "bbox": [ + 342, + 189, + 466, + 212 + ], + "lines": [ + { + "bbox": [ + 342, + 189, + 466, + 212 + ], + "spans": [ + { + "bbox": [ + 342, + 189, + 466, + 212 + ], + "type": "text", + "content": "Table 8: Effect of bidirectional projection." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 363, + 220, + 444, + 280 + ], + "lines": [ + { + "bbox": [ + 363, + 220, + 444, + 280 + ], + "spans": [ + { + "bbox": [ + 363, + 220, + 444, + 280 + ], + "type": "table", + "html": "
d(¯¯¯¯p)dbi(¯¯¯¯p)
CDL10.0100.007
CDL20.0240.008
F-S.0.7260.778
NC0.8900.911
", + "image_path": "9b84f2c8235b98b492034386d8826849716564a02ae6ce0a74ffaaa2bb64d341.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "spans": [ + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": "Weight of level set projection loss. We explore the effect of the " + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "inline_equation", + "content": "L_{CD}" + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": " loss function by adjusting the weight " + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "inline_equation", + "content": "\\alpha_{3}" + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": " in Eq. (11). We report our results with different candidates " + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "inline_equation", + "content": "\\{0, 1, 10\\}" + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": " in Tab. 9, where 0 means we do not use the " + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "inline_equation", + "content": "L_{CD}" + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": " to constrain the gradient. The comparisons in Tab. 9 show that although our implicit filter can directly learn SDFs, it is better to adopt the " + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "inline_equation", + "content": "L_{CD}" + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": " for a more stable field. However, if the weight is too large, the filtering effect will decrease. It is recommended to select weights ranging from 1 to 10, which is usually adequate. For the weights " + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "inline_equation", + "content": "\\alpha_{1}" + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "inline_equation", + "content": "\\alpha_{2}" + }, + { + "bbox": [ + 130, + 287, + 480, + 382 + ], + "type": "text", + "content": ", setting them to 1 is always necessary." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 383, + 480, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 383, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 383, + 480, + 430 + ], + "type": "text", + "content": "Effect of filter parameters. We compare the effect of different parameters " + }, + { + "bbox": [ + 130, + 383, + 480, + 430 + ], + "type": "inline_equation", + "content": "\\sigma_{n},\\sigma_{p}" + }, + { + "bbox": [ + 130, + 383, + 480, + 430 + ], + "type": "text", + "content": " in Tab. 10. The diagonal weight for " + }, + { + "bbox": [ + 130, + 383, + 480, + 430 + ], + "type": "inline_equation", + "content": "\\sigma_{p}" + }, + { + "bbox": [ + 130, + 383, + 480, + 430 + ], + "type": "text", + "content": " means the length of the diagonal of the bounding box for the local patch mentioned in [48]. The results indicate that the method is relatively robust to parameter variation in a certain range." + } + ] + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 143, + 462, + 271, + 522 + ], + "blocks": [ + { + "bbox": [ + 144, + 441, + 269, + 453 + ], + "lines": [ + { + "bbox": [ + 144, + 441, + 269, + 453 + ], + "spans": [ + { + "bbox": [ + 144, + 441, + 269, + 453 + ], + "type": "text", + "content": "Table 9: Effect of weight " + }, + { + "bbox": [ + 144, + 441, + 269, + 453 + ], + "type": "inline_equation", + "content": "{\\alpha }_{3}" + }, + { + "bbox": [ + 144, + 441, + 269, + 453 + ], + "type": "text", + "content": " ." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 143, + 462, + 271, + 522 + ], + "lines": [ + { + "bbox": [ + 143, + 462, + 271, + 522 + ], + "spans": [ + { + "bbox": [ + 143, + 462, + 271, + 522 + ], + "type": "table", + "html": "
α3CDL1CDL2F-S.NC
00.0080.0130.7580.903
10.0070.0110.7720.910
100.0070.0080.7780.911
1000.0080.0090.7740.909
", + "image_path": "dbff695a5b5182fb52a5c4e16df0f27c7d760e9f6faf43008ecaacb5a44dc795.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "table_body" + } + ], + "index": 12 + }, + { + "type": "table", + "bbox": [ + 299, + 452, + 460, + 533 + ], + "blocks": [ + { + "bbox": [ + 283, + 430, + 476, + 442 + ], + "lines": [ + { + "bbox": [ + 283, + 430, + 476, + 442 + ], + "spans": [ + { + "bbox": [ + 283, + 430, + 476, + 442 + ], + "type": "text", + "content": "Table 10: Effect of filter parameters " + }, + { + "bbox": [ + 283, + 430, + 476, + 442 + ], + "type": "inline_equation", + "content": "{\\sigma }_{n}" + }, + { + "bbox": [ + 283, + 430, + 476, + 442 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 283, + 430, + 476, + 442 + ], + "type": "inline_equation", + "content": "{\\sigma }_{p}" + }, + { + "bbox": [ + 283, + 430, + 476, + 442 + ], + "type": "text", + "content": " ." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 299, + 452, + 460, + 533 + ], + "lines": [ + { + "bbox": [ + 299, + 452, + 460, + 533 + ], + "spans": [ + { + "bbox": [ + 299, + 452, + 460, + 533 + ], + "type": "table", + "html": "
CDL1CDL2F-S.NC
σn15°0.0070.0080.7780.911
30°0.0070.0110.7710.907
45°0.0080.0120.7640.903
60°0.0080.0100.7670.901
σpmax0.0070.0080.7780.911
diagonal0.0080.0110.7630.904
", + "image_path": "d070b3a27cd1b46ae156fc8eac4f6e2dc8d07737ad8b6dedc5546235023f81ba.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "table_body" + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 555, + 219, + 567 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 219, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 219, + 567 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 581, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 480, + 665 + ], + "type": "text", + "content": "We introduce implicit filtering on SDFs to reduce the noise of the signed distance field while preserving geometry features. We filter the distance field by minimizing the weighted bidirectional projection distance, where we can generate sampling points on the zero level set and neighbor points on non-zero level sets by the pulling procedure. By leveraging the Chamfer distance, we address the issue of gradient degeneration problem. The visual and numerical comparisons demonstrate our effectiveness and superiority over state-of-the-art methods." + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 163 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 163 + ], + "type": "text", + "content": "The corresponding author is Ge Gao. This work was supported by Beijing Science and Technology Program (Z231100001723014)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 205, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 205, + 479, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 205, + 479, + 237 + ], + "spans": [ + { + "bbox": [ + 138, + 205, + 479, + 237 + ], + "type": "text", + "content": "1. Atzmon, M., Lipman, Y.: Sal: Sign agnostic learning of shapes from raw data. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 239, + 480, + 260 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 239, + 480, + 260 + ], + "spans": [ + { + "bbox": [ + 138, + 239, + 480, + 260 + ], + "type": "text", + "content": "2. Atzmon, M., Lipman, Y.: SALD: sign agnostic learning with derivatives. In: 9th International Conference on Learning Representations, ICLR 2021 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 261, + 480, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 261, + 480, + 304 + ], + "spans": [ + { + "bbox": [ + 138, + 261, + 480, + 304 + ], + "type": "text", + "content": "3. Baorui, M., Yu-Shen, L., Matthias, Z., Zhizhong, H.: Surface reconstruction from point clouds by learning predictive context priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 304, + 480, + 337 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 304, + 480, + 337 + ], + "spans": [ + { + "bbox": [ + 138, + 304, + 480, + 337 + ], + "type": "text", + "content": "4. Baorui, M., Zhizhong, H., Yu-Shen, L., Matthias, Z.: Neural-pull: Learning signed distance functions from point clouds by learning to pull space onto surfaces. In: International Conference on Machine Learning (ICML) (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 338, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 338, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 338, + 480, + 380 + ], + "type": "text", + "content": "5. Ben-Shabat, Y., Hewa Koneputugodage, C., Gould, S.: Digs: Divergence guided shape implicit neural representation for unoriented point clouds. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19323-19332 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 381, + 480, + 414 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 381, + 480, + 414 + ], + "spans": [ + { + "bbox": [ + 138, + 381, + 480, + 414 + ], + "type": "text", + "content": "6. Boulch, A., Marlet, R.: Poco: Point convolution for surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6302-6314 (June 2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 415, + 480, + 458 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 415, + 480, + 458 + ], + "spans": [ + { + "bbox": [ + 138, + 415, + 480, + 458 + ], + "type": "text", + "content": "7. Chabra, R., Lenssen, J.E., Ilg, E., Schmidt, T., Straub, J., Lovegrove, S., Newcombe, R.: Deep local shapes: Learning local sdf priors for detailed 3d reconstruction. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIX 16. pp. 608-625. Springer (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 458, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 458, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 458, + 480, + 512 + ], + "type": "text", + "content": "8. Chang, A.X., Funkhouser, T., Guibas, L., Hanrahan, P., Huang, Q., Li, Z., Savarese, S., Savva, M., Song, S., Su, H., Xiao, J., Yi, L., Yu, F.: ShapeNet: An Information-Rich 3D Model Repository. Tech. Rep. arXiv:1512.03012 [cs.GR], Stanford University — Princeton University — Toyota Technological Institute at Chicago (2015)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 513, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 513, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 138, + 513, + 480, + 533 + ], + "type": "text", + "content": "9. Chao, C., Yu-shen, L., Zhizhong, H.: Latent partition implicit with surface codes for 3d representation. In: European Conference on Computer Vision (ECCV) (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 534, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 534, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 134, + 534, + 480, + 567 + ], + "type": "text", + "content": "10. Chen, C., Liu, Y.S., Han, Z.: Gridpull: Towards scalability in learning implicit representations from 3d point clouds. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV) (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 567, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 567, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 134, + 567, + 480, + 599 + ], + "type": "text", + "content": "11. Chen, Z., Tagliasacchi, A., Zhang, H.: Bsp-net: Generating compact meshes via binary space partitioning. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 600, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 600, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 134, + 600, + 480, + 643 + ], + "type": "text", + "content": "12. Eler, P., Guerrero, P., Ohrhallinger, S., Mitra, N.J., Wimmer, M.: Points2Surf: Learning implicit surfaces from point clouds. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.M. (eds.) Computer Vision - ECCV 2020. pp. 108-124. Springer International Publishing, Cham (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "type": "text", + "content": "13. Fleishman, S., Cohen-Or, D., Silva, C.T.: Robust moving least-squares fitting with sharp features. ACM transactions on graphics (TOG) 24(3), 544-552 (2005)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 148 + ], + "type": "text", + "content": "14. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. In: Proceedings of Machine Learning and Systems 2020, pp. 3569-3579 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 480, + 182 + ], + "type": "text", + "content": "15. Huang, H., Li, D., Zhang, H., Ascher, U., Cohen-Or, D.: Consolidation of unorganized point clouds for surface reconstruction. ACM transactions on graphics (TOG) 28(5), 1-7 (2009)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 480, + 203 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 480, + 203 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 480, + 203 + ], + "type": "text", + "content": "16. Huang, H., Wu, S., Gong, M., Cohen-Or, D., Ascher, U., Zhang, H.: Edge-aware point set resampling. ACM transactions on graphics (TOG) 32(1), 1-12 (2013)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 203, + 480, + 235 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 203, + 480, + 235 + ], + "spans": [ + { + "bbox": [ + 133, + 203, + 480, + 235 + ], + "type": "text", + "content": "17. Huang, J., Gojcic, Z., Atzmon, M., Litany, O., Fidler, S., Williams, F.: Neural kernel surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4369-4379 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 235, + 480, + 267 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 235, + 480, + 267 + ], + "spans": [ + { + "bbox": [ + 133, + 235, + 480, + 267 + ], + "type": "text", + "content": "18. Jiang, C.M., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T.: Local implicit grid representations for 3d scenes. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 267, + 480, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 267, + 480, + 289 + ], + "spans": [ + { + "bbox": [ + 133, + 267, + 480, + 289 + ], + "type": "text", + "content": "19. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 289, + 480, + 332 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 289, + 480, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 289, + 480, + 332 + ], + "type": "text", + "content": "20. Koch, S., Matveev, A., Jiang, Z., Williams, F., Artemov, A., Burnaev, E., Alexa, M., Zorin, D., Panozzo, D.: Abc: A big cad model dataset for geometric deep learning. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9601-9611 (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 332, + 480, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 332, + 480, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 332, + 480, + 374 + ], + "type": "text", + "content": "21. Koneputugodage, C.H., Ben-Shabat, Y., Campbell, D., Gould, S.: Small steps and level sets: Fitting neural surface models with point guidance. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 21456-21465 (2024)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 374, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 374, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 374, + 480, + 407 + ], + "type": "text", + "content": "22. Li, S., Gao, G., Liu, Y., Liu, Y.S., Gu, M.: Gridformer: Point-grid transformer for surface reconstruction. In: Proceedings of the AAAI Conference on Artificial Intelligence (2024)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 407, + 480, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 480, + 429 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 480, + 429 + ], + "type": "text", + "content": "23. Liao, B., Xiao, C., Jin, L., Fu, H.: Efficient feature-preserving local projection operator for geometry reconstruction. Computer-Aided Design 45(5), 861-874 (2013)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 429, + 480, + 472 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 429, + 480, + 472 + ], + "spans": [ + { + "bbox": [ + 132, + 429, + 480, + 472 + ], + "type": "text", + "content": "24. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16252-16262 (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 472, + 480, + 504 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 472, + 480, + 504 + ], + "spans": [ + { + "bbox": [ + 132, + 472, + 480, + 504 + ], + "type": "text", + "content": "25. Lipman, Y., Cohen-Or, D., Levin, D., Tal-Ezer, H.: Parameterization-free projection for geometry reconstruction. ACM Transactions on Graphics (TOG) 26(3), 22-es (2007)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 504, + 480, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 504, + 480, + 536 + ], + "spans": [ + { + "bbox": [ + 132, + 504, + 480, + 536 + ], + "type": "text", + "content": "26. Liu, S.L., Guo, H.X., Pan, H., Wang, P.S., Tong, X., Liu, Y.: Deep implicit moving least-squares functions for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1788-1797 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 536, + 480, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 536, + 480, + 568 + ], + "spans": [ + { + "bbox": [ + 132, + 536, + 480, + 568 + ], + "type": "text", + "content": "27. Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3d surface construction algorithm. In: Seminal graphics: pioneering efforts that shaped the field, pp. 347-353 (1998)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 568, + 480, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 568, + 480, + 601 + ], + "spans": [ + { + "bbox": [ + 132, + 568, + 480, + 601 + ], + "type": "text", + "content": "28. Ma, B., Liu, Y.S., Han, Z.: Reconstructing surfaces for sparse point clouds with on-surface priors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6315-6325 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 601, + 480, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 480, + 633 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 480, + 633 + ], + "type": "text", + "content": "29. Ma, B., Zhou, J., Liu, Y.S., Han, Z.: Towards better gradient consistency for neural signed distance functions via level set alignment. In: Conference on Computer Vision and Pattern Recognition (CVPR) (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "text", + "content": "30. Marschner, Z., Sellan, S., Liu, H.T.D., Jacobson, A.: Constructive solid geometry on neural signed distance fields. In: SIGGRAPH Asia 2023 Conference Papers. pp. 1-12 (2023)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 150 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 150 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 150 + ], + "type": "text", + "content": "31. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) (2019)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "type": "text", + "content": "32. Mi, Z., Luo, Y., Tao, W.: Ssrnet: Scalable 3d surface reconstruction network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 970-979 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 184, + 481, + 218 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 184, + 481, + 218 + ], + "spans": [ + { + "bbox": [ + 132, + 184, + 481, + 218 + ], + "type": "text", + "content": "33. Öztiredi, A.C., Guennebaud, G., Gross, M.: Feature preserving point set surfaces based on non-linear kernel regression. In: Computer graphics forum. vol. 28, pp. 493-501. Wiley Online Library (2009)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 218, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 218, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 218, + 481, + 251 + ], + "type": "text", + "content": "34. Peng, S., Jiang, C., Liao, Y., Niemeyer, M., Pollefeys, M., Geiger, A.: Shape as points: A differentiable poisson solver. Advances in Neural Information Processing Systems 34, 13032-13044 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 251, + 481, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 481, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 481, + 274 + ], + "type": "text", + "content": "35. Peng, S., Niemeyer, M., Mescheder, L., Pollefeys, M., Geiger, A.: Convolutional occupancy networks. In: European Conference on Computer Vision (ECCV) (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 274, + 481, + 297 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 297 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 297 + ], + "type": "text", + "content": "36. Preiner, R., Mattausch, O., Arikan, M., Pajarola, R., Wimmer, M.: Continuous projection for fast l1 reconstruction. ACM Trans. Graph. 33(4), 47-1 (2014)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 297, + 481, + 330 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 297, + 481, + 330 + ], + "spans": [ + { + "bbox": [ + 132, + 297, + 481, + 330 + ], + "type": "text", + "content": "37. Pumarola, A., Sanakoyeu, A., Yariv, L., Thabet, A., Lipman, Y.: Visco grids: Surface reconstruction with viscosity and coarea grids. Advances in Neural Information Processing Systems 35, 18060-18071 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 331, + 481, + 364 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 331, + 481, + 364 + ], + "spans": [ + { + "bbox": [ + 132, + 331, + 481, + 364 + ], + "type": "text", + "content": "38. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Neural Information Processing Systems, Neural Information Processing Systems (Jun 2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 364, + 481, + 408 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 364, + 481, + 408 + ], + "spans": [ + { + "bbox": [ + 132, + 364, + 481, + 408 + ], + "type": "text", + "content": "39. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "type": "text", + "content": "40. Tang, J., Lei, J., Xu, D., Ma, F., Jia, K., Zhang, L.: Sa-convonet: Sign-agnostic optimization of convolutional occupancy networks. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 442, + 481, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 442, + 481, + 486 + ], + "spans": [ + { + "bbox": [ + 132, + 442, + 481, + 486 + ], + "type": "text", + "content": "41. Tretschk, E., Tewari, A., Golyanik, V., Zollhöfer, M., Stoll, C., Theobalt, C.: Patchnets: Patch-based generalizable deep implicit 3d shape representations. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XVI 16. pp. 293-309. Springer (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 487, + 481, + 510 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 481, + 510 + ], + "type": "text", + "content": "42. Wang, X., Cheng, Y., Wang, L., Lu, J., Xu, K., Xiao, G.: Edge preserving implicit surface representation of point clouds. arXiv preprint arXiv:2301.04860 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 510, + 481, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 481, + 542 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 481, + 542 + ], + "type": "text", + "content": "43. Wang, Y., Rahmann, L., Sorkine-Hornung, O.: Geometry-consistent neural shape representation with implicit displacement fields. In: The Tenth International Conference on Learning Representations. OpenReview (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 543, + 481, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 481, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 481, + 586 + ], + "type": "text", + "content": "44. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 259-270 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "type": "text", + "content": "45. Williams, F., Gojcic, Z., Khamis, S., Zorin, D., Bruna, J., Fidler, S., Litany, O.: Neural fields as learnable kernels for 3d reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18500-18510 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "46. Williams, F., Schneider, T., Silva, C., Zorin, D., Bruna, J., Panozzo, D.: Deep geometric prior for surface reconstruction. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10130-10139 (2019)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 376, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Filtering" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 216 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "text", + "content": "47. Yu, L., Li, X., Fu, C.W., Cohen-Or, D., Heng, P.A.: Ec-net: an edge-aware point set consolidation network. In: Proceedings of the European conference on computer vision (ECCV). pp. 386-402 (2018)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "type": "text", + "content": "48. Zhang, D., Lu, X., Qin, H., He, Y.: Pointfilter: Point cloud filtering via encoder-decoder modeling. IEEE Transactions on Visualization and Computer Graphics 27(3), 2015-2027 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 481, + 216 + ], + "type": "text", + "content": "49. Zhou, J., Ma, B., Liu, Y.S., Fang, Y., Han, Z.: Learning consistency-aware unsigned distance functions progressively from raw point clouds. In: Advances in Neural Information Processing Systems (NeurIPS) (2022)" + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 210, + 100 + ], + "type": "text", + "content": "S. Li et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_content_list.json b/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..51514b2e096e4f7f6f9d28ca01ea25c338e1e049 --- /dev/null +++ b/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_content_list.json @@ -0,0 +1,2108 @@ +[ + { + "type": "text", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "text_level": 1, + "bbox": [ + 236, + 140, + 767, + 184 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Pradyumna Chari $^{*1}$ , Anirudh Bindiganavale Harish $^{*,\\dagger,2}$ , Adnan Armouti $^{\\dagger,3}$ , Alexander Vilesov $^{1}$ , Sanjit Sarda $^{1}$ , Laleh Jalilian $^{1}$ , and Achuta Kadambi $^{1}$", + "bbox": [ + 215, + 210, + 785, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 University of California Los Angeles, Los Angeles CA 90095, USA {pradyumnac,vilesov,sanjitsarda}@ucla.edu, ljalilian@mednet.ucla.edu achuta@ee.ucla.edu", + "bbox": [ + 238, + 253, + 764, + 295 + ], + "page_idx": 0 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "$^{2}$ Rice University, Houston TX 77005, USA anirudhbh@rice.edu", + "3 Cornell Tech, New York NY 10044, USA armouti@cs.cornell.edu" + ], + "bbox": [ + 238, + 253, + 645, + 351 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/00622ca2cfb014a85ba57d3c385dbd79647973181f4db289846517fe5bf7d902.jpg", + "image_caption": [ + "Fig. 1: Prior implicit neural models represent scenes for diverse applications. We propose an implicit neural representation (INR) to decompose face videos and isolate blood flow information. Our INR decomposes input videos into visual appearance and blood flow (\"A-B decomposition\"). The decomposed data aids in estimating the remote photoplethysmography (rPPG) signal and heart rate." + ], + "image_footnote": [], + "bbox": [ + 274, + 390, + 730, + 563 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Scene representation networks, or implicit neural representations (INR) have seen a range of success in numerous image and video applications. However, being universal function fitters, they fit all variations in videos without any selectivity. This is particularly a problem for tasks such as remote plethysmography, the extraction of heart rate information from face videos. As a result of low native signal to noise ratio, previous signal processing techniques suffer from poor performance, while previous learning-based methods have improved performance but", + "bbox": [ + 259, + 704, + 743, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* - Contributed Equally, †- Work done when at UCLA", + "bbox": [ + 230, + 825, + 596, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "suffer from hallucinations that mitigate generalizability. Directly applying prior INRs cannot remedy this signal strength deficit, since they fit to both the signal as well as interfering factors. In this work, we introduce an INR framework that increases this plethysmograph signal strength. Specifically, we leverage architectures to have selective representation capabilities. We are able to decompose the face video into a blood plethysmograph component, and a face appearance component. By inferring the plethysmograph signal from this blood component, we show state-of-the-art performance on out-of-distribution samples without sacrificing performance for in-distribution samples. We implement our framework on a custom-built multiresolution hash encoding backbone to enable practical dataset-scale representations through a 50x speed-up over traditional INRs. We also present a dataset of optically challenging out-of-distribution scenes to test generalization to real-world scenarios. Code and data may be found at https://implicitppg.github.io/.", + "bbox": [ + 259, + 147, + 743, + 357 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Keywords: Implicit neural representations $\\cdot$ Remote plethysmography", + "bbox": [ + 261, + 369, + 740, + 383 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 411, + 375, + 428 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Neural scene representations have gained significant prominence over recent years. The ability to use neural networks as function fitters and encode scene information within their weights has found considerable applications for tasks such as image representations [20, 27, 40, 44], scene representations [15, 39, 54, 61], radiance fields [18, 29, 30] and video representations [7, 9, 25]. Consistent among these applications is the need to fit all possible scene variations without selectivity.", + "bbox": [ + 212, + 446, + 787, + 536 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, for the task of remote plethysmography, the contactless monitoring of heart rate information from face videos via subtle skin color variations, selecting for the blood flow is required. Therefore, this indiscriminate fitting behavior of current implicit neural representations (INRs) is a significant drawback: both the signal and interfering factors will get fitted. Prior work [6,16,36,49] has established the low Signal-to-Noise Ratio (SNR) of the measurement (in this case, the facial image) as the source of remote photoplethysmography (rPPG) performance degradation. Previous methods generally fall into two categories: signal processing-based or deep learning-based. These two classes have established a trade-off between domain generalizability and in-distribution performance.", + "bbox": [ + 212, + 537, + 787, + 686 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Signal processing techniques improve signal strength by using model-based assumptions (such as band-pass filters or simple coloration models [11, 51]). These usually lead to relatively larger heart rate estimation errors. Recently, learning-based methods [8, 57, 58] for plethysmography have achieved state-of-the-art (SOTA) performance through end-to-end data-driven approaches. However, these methods suffer from generalization issues, where samples that are \"out-of-distribution\" (OOD) may show unspecified and often undesirable behavior due to overfitting.", + "bbox": [ + 212, + 688, + 787, + 809 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We propose an INR-based framework to improve the plethysmograph signal strength in facial videos before estimating the blood volume pulse signal.", + "bbox": [ + 214, + 809, + 785, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/981bff1c20bb3bbe04017c3e5d096712d4b80384e8e7a6e90cf01ede2d71da3b.jpg", + "image_caption": [ + "Fig.2: Our implicit representation for rPPG achieves Pareto-optimality across out-of-distribution (OOD) performance and inter-distribution parity compared to prior algorithmic and learning-based methods. It performs better on OOD samples while maximizing parity between in-distribution and OOD performance. Table 1 shows metrics used for this plot. Higher is better along both axes." + ], + "image_footnote": [], + "bbox": [ + 387, + 143, + 612, + 313 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Specifically, we introduce a new Appearance-Blood (or $\\mathcal{A}$ - $\\mathcal{B}$ ) decomposition for facial video data. The decomposition is designed to improve the plethysmograph signal quality across the face. We show that the representation capacity of carefully designed INRs, with architectures motivated by light transport principles of the problem (namely the nature of subtle skin color variations due to the plethysmograph signal), can enable such a decomposition, allowing isolation of the relevant blood component. Conventional INRs, however, are slow to train, thereby making them intractable for dataset-scale analyses. We use multiresolution hash encodings inspired by [32] to facilitate fast $\\mathcal{A}$ - $\\mathcal{B}$ decomposition. To the best of our knowledge, we propose the first camera-based rPPG method that uses implicit neural representations as a critical component of the estimation pipeline. Different from prior methods, we focus on both in and out-of-distribution performance (specifically, optically challenging OOD).", + "bbox": [ + 212, + 430, + 787, + 626 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "On a self-collected dataset of optically challenging OOD scenes, our method surpasses existing algorithmic and learning-based methods (Figure 2) with reliable plethysmograph and heart rate estimates. Notably, we achieve this OOD performance gain without compromising on in-distribution performance on rPPG datasets (Figure 1). As an additional outcome, we can obtain high-fidelity estimates of the plethysmograph signal strength (referred to as neural signal strength mask) across the face that generalize with high fidelity to OOD scenes and settings such as face paint, masks, glasses, and even reflection from windows. In summary, our contributions are as follows:", + "bbox": [ + 212, + 628, + 787, + 763 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "1. We formulate Appearance-Blood $(\\mathcal{A} - \\mathcal{B})$ decomposition as a means of enhancing plethysmograph signal strength. We show that carefully designed implicit neural representations can serve as efficient $\\mathcal{A}$ - $\\mathcal{B}$ decomposers and propose a fast method to achieve this.", + "bbox": [ + 222, + 779, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 344, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2. This decomposition is the foundation for our proposed rPPG estimation method. On our optically challenging OOD dataset, our method shows significant improvements in performance over prior algorithmic and learning-based methods (Figure 2) without losing out on in-distribution performance.", + "bbox": [ + 222, + 146, + 782, + 205 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3. An optically challenging test dataset, consisting of 104 videos ( $\\approx$ 1 hour of recorded data) across various optically challenging and OOD configurations, is collected and will be released upon acceptance of this work.", + "bbox": [ + 222, + 205, + 784, + 251 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "1.1 Scope", + "text_level": 1, + "bbox": [ + 217, + 275, + 310, + 289 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "This work establishes the effectiveness of fast INRs to learn desired components of video data selectively - in this case, plethysmograph information. Other applications, such as video-based blood oxygenation and blood pressure estimation, require accurate plethysmography as a necessary first step. However, these applications are open research problems and is outside this work's scope. Furthermore, motion-robust rPPG is an open challenge and requires extensive research on its own. While this is not our primary goal, and our proposed method is not designed to combat motion artifacts, we test performance on motion videos and find our method competitive (supplement). Finally, we acknowledge that OOD is multi-faceted. This work primarily focused on optically challenging scenes and achieved SOTA results while secondarily validating performance on real-world obfuscations such as talking (and associated motions).", + "bbox": [ + 212, + 300, + 787, + 482 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 505, + 387, + 520 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Implicit Neural Representations. Implicit neural representations (INRs) are an increasingly prevalent method to represent scenes. Examples settings include image representations [20, 27, 40, 44], video representations [7, 9, 25], and 3-D scene representations [15, 39, 54, 61]. Specifically, this work is interested in the class of video-based representations. These include methods that use convolutional networks [7], phase-based motion-adjustable representation [25], space-time super-resolution [9] and flow fields for space-time viewpoint synthesis [13, 19]. We take inspiration from these prior methods but have different goals. We aim to use the video representation capacity of implicit networks to isolate imperceptible physiological phenomena, such as plethysmograph signals.", + "bbox": [ + 212, + 537, + 787, + 689 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Fast Implicit Neural Representations. A critical drawback of INRs is the time taken to train the networks for dataset scale experimentation and inference. Recent work, however, has taken a step toward alleviating this concern. [28] have proposed using a latent feature-based modulation network to generalize implicit representation models to model a broader range of images for faster convergence. Further, specialized toolboxes have been released to accelerate the training time of NeRFs [18,32]. In this work, we are interested in employing [32]'s parametric multiresolution spatial hash encodings as inputs to a shallow MLP. Using this foundation, we extend the framework to video INRs, specifically for", + "bbox": [ + 212, + 703, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 230, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "generalizable, robust camera-based plethysmography. This technique can achieve orders of magnitude improvements in training time for INRs.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Remote Plethysmography. Heart rate estimation using rPPG has been actively studied. Early methods were based on algorithmic principles of color variations [11, 51] or motion based on Newtonian reaction to blood flow [4]. Such methods are not limited to use with RGB cameras. Near Infrared (NIR) Imaging with active illumination has been employed to combat the effects of unreliable illumination in the visible (VIS) spectrum [24]. Augmented reality [14] is another avenue for this research. Deep learning approaches have also been utilized to attain SOTA results. [8] used an attention-based Convolutional Neural Network (CNN) while [57] introduced spatio-temporal CNNs. Other work has extended these architectures [35], including using transformers [58], incorporated meta-learning [17], improved PPG waveform characteristics [45], and augmented rPPG datasets with synthetic examples [3, 53]. Another class of methods focuses on improving equity between groups, such as participants of different skin tones [16, 36]. These include algorithmic methods [6] or multimodal fusion methods [49]. Methods for assessing and improving equity are not restricted to rPPG and extend to a range of computer vision problems [5, 16, 42, 52, 56, 59].", + "bbox": [ + 212, + 190, + 787, + 434 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 $\\mathcal{A}$ - $\\mathcal{B}$ Decomposition and Optimality", + "text_level": 1, + "bbox": [ + 215, + 454, + 598, + 474 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We begin with describing the mathematical underpinnings of rPPG and propose the notion of appearance-blood $(\\mathcal{A} - \\mathcal{B})$ decomposition and its benefits.", + "bbox": [ + 212, + 484, + 784, + 515 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Fundamentally, the rPPG signal is subtle, making its estimation difficult. While contemporary methods [8, 57, 58] circumvent this through deep networks, they fare poorly on OOD samples. This necessitates a generalizable method capable of extracting the rPPG signal without relying on domain-specific features that tend to overfit. This motivates our functional decomposition.", + "bbox": [ + 212, + 516, + 784, + 590 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Given spatial coordinates $\\mathbf{x} \\in [-0.5, 0.5]^2$ , and temporal coordinate $t \\in [-0.5, 0.5]$ , the face videos are interpreted as RGB color fields $\\mathcal{C}(\\mathbf{x}, t)$ . This color field consists of specular reflections that act as interference and diffuse components arising from subsurface scattering containing plethysmograph information. We wish to decompose the color signal into a signal amplitude component, $p_m(\\mathbf{x}, t)$ , and a temporal plethysmograph signal $p_i(t)$ , our desired signal. However, the relation between $p_m(\\cdot, \\cdot)$ and $p_i(\\cdot)$ is non-linear in nature.", + "bbox": [ + 212, + 590, + 787, + 696 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Under reasonable assumptions, we show color signals can be decomposed as:", + "bbox": [ + 238, + 696, + 784, + 712 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {C} (\\mathbf {x}, t) = \\mathcal {A} (\\mathbf {x}, t) + \\mathcal {B} (\\mathbf {x}, t) + \\mathbf {v _ {n}} (\\mathbf {x}, t), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 366, + 728, + 784, + 743 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathcal{A}(\\mathbf{x},t)$ represents the facial appearance (or $\\mathcal{A}$ -function) - including specular highlights - which is interference. $\\mathcal{B}(\\mathbf{x},t)$ , the blood component (or $\\mathcal{B}$ -function), contains the spatiotemporally varying color changes arising out of blood flow (plethysmography) that incorporates $p_m(\\cdot ,\\cdot)$ and $p_i(\\cdot)$ . $\\mathbf{v}_{\\mathbf{n}}(\\cdot ,\\cdot)$ represents the measurement noise in the process. We will refer to this decomposition as the $\\mathcal{A} - \\mathcal{B}$ decomposition. Then, the following Theorem holds.", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 343, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 1: The $\\mathcal{A} - \\mathcal{B}$ decomposition results in a $\\mathcal{B}$ -function with a Signal to Interference & Noise Ratio $SINR_{\\mathcal{B}}(\\mathbf{x},t)$ , such that $SINR_{\\mathcal{B}}(\\mathbf{x},t) \\geq SINR_{\\mathcal{C}}(\\mathbf{x},t)$ . That is, the $\\mathcal{A} - \\mathcal{B}$ decomposition leads to an SINR gain.", + "bbox": [ + 215, + 146, + 782, + 191 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Note that Theorem 1 is an existence proof. It describes the existence of SINR benefits as a result of ideal decomposition, motivating its necessity in our real applications. Additionally, while SINR is computed across time, we also wish to model temporal variations due to lighting, pose changes, etc. This is what $t$ -dependence for SINR denotes.", + "bbox": [ + 215, + 191, + 782, + 265 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Corollary 1: Given an $\\mathcal{A} - \\mathcal{B}$ decomposed video field $\\mathcal{C}(\\mathbf{x},t)$ , the Maximal Ratio Combining (MRC)-optimal estimate for the plethysmograph $p_i(t)$ is given by,", + "bbox": [ + 215, + 267, + 782, + 297 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\widehat {p _ {i} ^ {*}} (t) = \\int_ {\\mathbf {x} \\in \\Omega} S I N R _ {\\mathcal {B}} (\\mathbf {x}, t) \\mathcal {B} (\\mathbf {x}, t) d \\mathbf {x}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 308, + 782, + 339 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\Omega = [-0.5, 0.5]^2$ , the domain of $\\mathbf{x}$ as previously defined.", + "bbox": [ + 215, + 348, + 661, + 364 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This is the notion of near-optimal plethysmography we aim to achieve. Detailed derivations for this section can be found in the supplement.", + "bbox": [ + 215, + 378, + 782, + 409 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Optimal Plethysmography and Uncertainty", + "text_level": 1, + "bbox": [ + 215, + 430, + 617, + 445 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Equation 2 can also be interpreted in the context of uncertainty minimization [38]. In a discrete setting with $N$ pixel locations $\\{\\mathbf{x}\\}_{i = 1}^{N}$ , each pixel is viewed as a sensor and the signal strength, $SINR_{\\mathcal{B}}(\\mathbf{x},t)$ is a proxy for the uncertainty or unreliability. Then the problem of estimating $\\widehat{p_i^*}(t)$ can be interpreted as Bayesian inference. With assumptions on prior and posterior distributions, it can be shown that the posterior $\\widehat{p_i^*}(t)$ is Gaussian with mean $\\frac{\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)\\cdot\\mathcal{B}(\\mathbf{x}_i,t)}{\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)}$ (best posterior estimate, a discretized and normalized version of Equation 2) and variance $1 / (\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t))$ . Since Equation 2 represents maximal ratio combining, $\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)\\propto SINR_{\\widehat{p_i^*}(t)}$ ([43], Equation 31, 32), then, uncertainty (or the variance in the posterior) is inversely proportional to SINR of $\\widehat{p_i^*}(t)$ . Optimal plethysmography therefore becomes akin maximization of SINR, or minimization of uncertainty of $\\widehat{p_i^*}(t)$ . Please refer to the supplement for derivations.", + "bbox": [ + 215, + 453, + 784, + 652 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 $\\mathcal{A}$ - $\\mathcal{B}$ Decomposition Using INRs", + "text_level": 1, + "bbox": [ + 215, + 674, + 563, + 691 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This section explores conditions for $\\mathcal{A}$ - $\\mathcal{B}$ decomposition function approximators. We first establish necessary conditions that $\\mathcal{A}$ - $\\mathcal{B}$ decomposers must meet and then explore how INRs can be designed to perform such decomposition.", + "bbox": [ + 215, + 705, + 782, + 750 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 Functional Decomposition", + "text_level": 1, + "bbox": [ + 215, + 771, + 475, + 786 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Consider two functions, $\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})$ and $\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}})$ , parameterized by $\\Theta_{\\mathcal{A}}$ and $\\Theta_{\\mathcal{B}}$ , that aim to represent $\\mathcal{A}(\\mathbf{x},t)$ and $\\mathcal{B}(\\mathbf{x},t)$ respectively. To perform an $\\mathcal{A}$ - $\\mathcal{B}$ decomposition, we wish to find functions that satisfying:", + "bbox": [ + 215, + 792, + 782, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/9bdac6ca845073d2a7606d954d054aba72b5f815ac8f71e5abf80b5c62d81e4e.jpg", + "image_caption": [ + "Fig. 3: Sinusoidal Representation Networks (SRNs) can represent both $\\mathcal{A}$ and $\\mathcal{B}$ -functions, while phase-based methods only represent the $\\mathcal{A}$ -function. (a) SRNs, such as [44], can capture PPG color variations almost perfectly, while (b) phase-based motion representations, such as [25] are unable to capture it." + ], + "image_footnote": [], + "bbox": [ + 341, + 143, + 658, + 228 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nd _ {\\mathcal {A}} (\\hat {\\mathcal {A}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {A}} ^ {*}), \\mathcal {A} (\\mathbf {x}, t)) \\leq \\epsilon_ {\\mathcal {A}},\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 343, + 612, + 362 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nd _ {\\mathcal {B}} \\left(\\hat {\\mathcal {B}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {B}} ^ {*}), \\mathcal {B} (\\mathbf {x}, t)\\right) \\leq \\epsilon_ {\\mathcal {B}}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 398, + 364, + 785, + 383 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nd _ {\\mathcal {B}} (\\hat {\\mathcal {A}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {A}} ^ {*}), \\mathcal {B} (\\mathbf {x}, t)) \\geq \\epsilon_ {\\mathcal {B}}.\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 386, + 611, + 405 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\Theta_{\\mathcal{A}}^{*}$ and $\\Theta_{\\mathcal{B}}^{*}$ are optimal parameters, and $d_{\\mathcal{A}}(\\cdot ,\\mathcal{A}(\\mathbf{x},t))$ and $d_{\\mathcal{B}}(\\cdot ,\\mathcal{B}(\\mathbf{x},t))$ are some component-dependent metric distances. This quantifies the requirement that $\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})$ is able to represent the $\\mathcal{A}$ -function but not the $\\mathcal{B}$ -function.", + "bbox": [ + 214, + 412, + 784, + 458 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We choose distance measures, $d_{\\mathcal{A}}(\\mathcal{F}, \\mathcal{A}(\\mathbf{x}, t)) = ||\\mathcal{F} - \\mathcal{A}(\\mathbf{x}, t)||_2$ , $\\forall \\mathcal{F}$ , such that the appearance metric distance rewards pixel-wise closeness. Similarly,", + "bbox": [ + 214, + 458, + 785, + 489 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nd _ {\\mathcal {B}} (\\mathcal {F}, \\mathcal {B} (\\mathbf {x}, t)) = | H (\\mathcal {F}) - H (\\mathcal {B} (\\mathbf {x}, t)) |, \\forall \\mathcal {F}, \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 344, + 498, + 785, + 515 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $H(\\cdot)$ is a heart rate estimator function. By finding functions that satisfy the constraints in Equation 3, we can achieve $\\mathcal{A} - \\mathcal{B}$ decomposition by sequentially learning $\\hat{\\mathcal{A}} (\\mathbf{x},t;\\boldsymbol {\\Theta}_{\\mathcal{A}})$ and $\\hat{\\mathcal{B}} (\\mathbf{x},t;\\boldsymbol {\\Theta}_{\\mathcal{B}})$ . A detailed mathematical analysis of this formulation is deferred to the supplement.", + "bbox": [ + 214, + 523, + 787, + 585 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 Identifying Implicit $\\mathcal{A}$ - $\\mathcal{B}$ Decomposers", + "text_level": 1, + "bbox": [ + 215, + 604, + 578, + 622 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Prior work on video magnification through Laplacian [55] and phase-based [50] pyramids is instructive. While the Laplacian pyramid-based approach [55] can magnify blood flow due to color changes, the phase-based method [50] cannot magnify blood flow. With this intuition, we use the metrics defined in the previous section to identify approximations for $\\mathcal{A}$ & $\\mathcal{B}$ . We first look at phase-modulated INRs for motion modeling [25]. The key inductive bias here is parameterizing time as phase modulation in positional encodings [30,46].", + "bbox": [ + 212, + 628, + 787, + 734 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Empirical Claim 1 (based on observations): Phase-based implicit models (models with phase-encoded input embeddings) cannot represent plethysmograph signals accurately, in terms of the metric in Equation 4. (Figure 3(b))", + "bbox": [ + 214, + 734, + 787, + 780 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "While this can be viewed as a limitation of phase-based INRs, we use it to our advantage: phase-based models can be $\\mathcal{A}$ -function estimators (Equation 3).", + "bbox": [ + 214, + 780, + 787, + 809 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We next look at sinusoid representation networks (SRNs), such as [20,40,44]. Empirical Claim 2: SRNs are good $\\mathcal{A}$ , $\\mathcal{B}$ -function approximators. (Figure 3(a))", + "bbox": [ + 215, + 809, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 343, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/47b2bc66f37307107f5f06b399d3a9a7c4860c9b978aeaf47808ccbdbbdcc70e.jpg", + "image_caption": [ + "Fig. 4: To enable fast $\\mathcal{A} - \\mathcal{B}$ decomposition, we use implicit neural representations as decomposing function fitters. Training is done sequentially: first, the cascaded appearance model learns the $\\mathcal{A}$ -function. Then, the appearance model is frozen, and the residual model learns the $\\mathcal{B}$ -function, thereby completing the decomposition. The use of multiresolution hash encodings makes dataset-scale decomposition viable." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 787, + 224 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "However, being able to represent both $\\mathcal{A}$ and $\\mathcal{B}$ makes SRNs incapable of $\\mathcal{A} - \\mathcal{B}$ decomposition. This pair exactly satisfy the constraints in Equation 3. Hence, Empirical Claim 3: A phase-based model can serve as $\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}}^{*})$ , while an SRN can serve as $\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}}^{*})$ , when trained sequentially.", + "bbox": [ + 212, + 333, + 787, + 395 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Justifications for all claims may be found in the supplement. However, naive use of prior work [25, 44] for $\\mathcal{A} - \\mathcal{B}$ decomposition poses a training time problem. Using variants of [25] and [44] as $\\mathcal{A}$ and $\\mathcal{B}$ -function estimators, respectively, we noted a training time of 20 minutes for a 2-second long video with a resolution of $128 \\times 128$ . Such compute times are infeasible for dataset-scale experiments.", + "bbox": [ + 212, + 396, + 787, + 472 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5 Hash Encodings for $\\mathcal{A}$ - $\\mathcal{B}$ Decomposition", + "text_level": 1, + "bbox": [ + 214, + 493, + 638, + 510 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this section, we propose high-speed INR-based $\\mathcal{A}$ - $\\mathcal{B}$ decomposition. Specifically, to address the slower speeds of traditional INRs, we pivot to a faster framework and show design INRs for $\\mathcal{A}$ - $\\mathcal{B}$ decomposition within this framework.", + "bbox": [ + 212, + 523, + 785, + 568 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Inspired by recent work in instant neural graphics primitives [32], we propose using a multiresolution hash input encoding (MRHE)-based framework for $\\mathcal{A}$ $\\mathcal{B}$ decomposition. A critical aspect is using the spatial hash function for video fields. Spatial hash functions [34, 47] are typically 2-D and 3-D extensions to the prevalent hash tables. We use this principle to model the spatio-temporal coordinates $(x,y,t)$ as a 3-D space. We posit that the 3-D spatial hash function can effectively model this space without violating any temporal constraints.", + "bbox": [ + 212, + 569, + 787, + 675 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5.1 Cascaded Appearance Model $\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})$", + "text_level": 1, + "bbox": [ + 214, + 694, + 596, + 710 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As discussed in Section 4.2, phase-based INRs [25], are efficient $\\mathcal{A}$ -function representatives. However, a direct translation of this concept to MRHEs is intractable, i.e., replacing the sinusoidal positional encodings with the faster MRHE makes phase incorporation infeasible. For sinusoidal encodings, phase modulations are akin to offsets. Thus, we propose to incorporate the time-to-phase conversion through learned spatiotemporal offset. The appearance model has two stages: the first maps spatio-temporal coordinates to positional offsets in the MRHE. The second is queried using the offset positions to generate video frames.", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/8a6addf1a85ee23bc7a38ec58bee2c030ad5e778f9c4a894f2634a39878caab8.jpg", + "image_caption": [ + "Fig. 5: Using the estimated $\\mathcal{B}$ -function with the original video, we learn high-fidelity neural signal strength masks. The network takes the original RGB frames and the $\\mathcal{B}$ -function estimate as inputs and returns a spatial strength mask. Training is supervised through an auxiliary 1-D CNN whose training target is the prediction of an accurate plethysmograph. The 1-D CNN is discarded post-training, and the learned mask model is used at inference time on the $\\mathcal{B}$ -function to estimate rPPG." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 782, + 232 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Rather than considering a single offset vector in $\\mathbb{R}^2$ for the entire frame (as [25] do for phase estimation), we estimate the offset, $\\varDelta\\mathbf{x}\\in\\mathbb{R}^{2}$ , for each point in the spatio-temporal grid. That is, $\\varDelta\\mathbf{x}=f_{\\mathcal{A}_1}(\\mathbf{x},t)$ . The estimated offsets are added to the original spatial coordinates, which are then used to query a second model $f_{\\mathcal{A}_2}(\\mathbf{x}+\\varDelta\\mathbf{x})$ . Translating Empirical Claim 1 from phase-based to offset-based models, we summarize our offset-adjustable cascaded appearance model as $\\hat{\\mathcal{A}}(\\mathbf{x},t;\\Theta_{\\mathcal{A}})=f_{\\mathcal{A}_2}(\\mathbf{x}+f_{\\mathcal{A}_1}(\\mathbf{x},t))$ . The architecture and loss functions are elaborated on in the supplement. Figure 4 details this pipeline.", + "bbox": [ + 212, + 356, + 787, + 479 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.2 Residual Plethysmograph Model $\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}})$", + "text_level": 1, + "bbox": [ + 214, + 500, + 622, + 517 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We use a shallow sinusoidal model with MRHE, $f_{\\mathcal{B}}(\\cdot ,\\cdot)$ , as our $\\mathcal{B}$ -function estimator. In line with Empirical Claim 3, we train the residual plethysmograph network sequentially after the cascaded appearance model. While training, we freeze the cascaded appearance model and train the residual plethysmography network on the difference between the original video input and the output of the estimated appearance field. That is, $\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}}) = f_{\\mathcal{B}}(\\mathbf{x},t)$ .", + "bbox": [ + 212, + 526, + 787, + 617 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The resulting residual plethysmograph model is shown to compensate for the cascaded appearance model's inability to retain the plethysmograph signal. When queried, the model yields a spatio-temporal estimate of the plethysmograph signal. The supplement contains relevant implementation details.", + "bbox": [ + 212, + 618, + 787, + 678 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6 rPPG Estimation", + "text_level": 1, + "bbox": [ + 214, + 700, + 423, + 717 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The previous section enables us to learn an estimator for $\\mathcal{B}(\\mathbf{x},t)$ , which is one part of the SINR optimality (and hence uncertainty minimization) from Equation 2. In this section, we proceed towards rPPG estimation from the $\\mathcal{B}$ -function using high-fidelity neural signal masks.", + "bbox": [ + 212, + 734, + 787, + 794 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Figure 5 highlights our proposed pipeline. Built on a 3-D CNN backbone, we indirectly supervise the spatial-attention-based network architecture with PPG waveforms. The model accepts the RGB input field concatenated with $\\hat{B}(\\mathbf{x}, t)$ (a", + "bbox": [ + 212, + 795, + 787, + 842 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 343, + 114, + 732, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "combined 6-channel input) to estimate a mask. Here, $\\mathcal{I}(\\mathbf{x},t) = \\left[\\mathcal{C}(\\mathbf{x},t),\\hat{\\mathcal{B}} (\\mathbf{x},t)\\right]$ where $\\mathcal{I}(\\mathbf{x},t)$ is the input to our SINR mask estimator. Limited by compute requirements, we relax the temporal component and only consider the first 64 frames (of the 300 frames) to compute a single mask for 10 seconds. End-to-end the network can be summarized as $SINR_{\\mathcal{B}}(\\mathbf{x}) = f_{SINR}\\left(\\mathcal{I}(\\mathbf{x},t);\\Theta_{SINR}\\right)$ .", + "bbox": [ + 212, + 143, + 782, + 228 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "It must be noted that while we only estimate a single mask for a 10-second video, our experiments show that our method is competitive even in the presence of natural motions like talking and head swaying (supplement). The SINR mask $S\\hat{N} R_{\\mathcal{B}}(\\mathbf{x})$ is directly used to compute $\\mathbf{y}_1(t) = \\frac{\\sum_{\\mathbf{x}}S\\hat{N}R_{\\mathcal{B}}(\\mathbf{x})\\cdot I(\\mathbf{x},t)}{\\sum_{\\mathbf{x}}S\\hat{N}R_{\\mathcal{B}}(\\mathbf{x})}$ , where $\\mathbf{y}_1(t)$ is a time-series obtained from the 6-channel weighted spatial average of the input.", + "bbox": [ + 212, + 229, + 784, + 311 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The 6-channel time-series signal is then passed through a 1-D CNN to yield a refined temporal estimate of the plethysmograph signal, $\\hat{\\mathbf{p}}(t)$ . Note that this network is not used to generate the final estimates but to supervise the neural signal strength mask model indirectly. The whole pipeline is supervised end-to-end with the ground truth plethysmograph signals. Implementation details and further mathematical formulation are provided in the supplement. As a result of the architecture being based on the optimality constraint in Equation 2, the inferred masks are expected to be near SINR-optimal. This also means near optimality in terms of uncertainty minimization.", + "bbox": [ + 212, + 313, + 784, + 448 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "As in prior learning approaches, the neural regressor overfits the waveform, making it sub-optimal for OOD. Hence, we only retain $f_{SINR}(\\cdot)$ . The neural signal masks are combined with $\\hat{B}$ to estimate the rPPG signal. We follow [48] and utilize only the green channel. Advanced algorithms [11,51] exist that utilize other channels, but they rely on the $A$ -function [11,51]. We perform detrending and Butterworth filtering for heart rate estimation as in [51].", + "bbox": [ + 212, + 449, + 784, + 540 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "7 Results", + "text_level": 1, + "bbox": [ + 215, + 559, + 323, + 574 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "7.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 587, + 426, + 603 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Datasets All methods are trained on two prior datasets [49, 53]. We also test our method on a self-collected Institutional Review Board (IRB) approved optically challenging OOD dataset. While we mainly focus on our dataset for OOD analysis, we also present results of cross-dataset inference. In our OOD dataset, we share full participant videos (without identifying information such as names), but only after recording contact details of dataset users. The dataset is released after potential users fill out a request form. Further details are in the supplement.", + "bbox": [ + 212, + 609, + 782, + 715 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation Metrics We adopt the heart rate (HR) performance metrics from [49]. These include Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), Root Mean Squared Error (RMSE), Pearson correlation coefficient (r) and the Threshold test (T-Test) [2,31,33]. Since our goal is OOD generalization, we propose \"r-consistency\" as the similarity metric between the Pearson coefficients of the in-distribution (ID) and OOD samples, calculated as a harmonic mean. A detailed discussion of this metric is present in the supplement.", + "bbox": [ + 212, + 733, + 799, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/3ed48574f2f239841c5541aa0b592a973d4d4ab21b136db662873751a6e85750.jpg", + "table_caption": [ + "Table 1: Performance on our OOD dataset considerably favors our method over prior work. We measure inter-distribution parity via the r-consistency metric. In-distribution values for r are given in Table 2. For algorithmic methods (non-learning), r-consistency on the datasets from [53] and [49] are shown in parenthesis. The best and second-best-performing numbers are highlighted in green and yellow, respectively." + ], + "table_footnote": [], + "table_body": "
MethodOOD Performance MetricsInter-Distribution Parity Metric
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑r-consistency ↑
Green [48]31.547.809.84%14.560.47(0.54, 0.52)
POS [51]31.928.0211.06%14.870.47(0.60, 0.62)
CHROM [11]36.739.3212.62%15.850.40(0.53, 0.55)
ICA [41]31.158.1710.50%15.320.41(0.5, 0.51)
Train on [53]DeepPhys [8]78.2718.6423.19%23.230.07
TS-CAN [21]77.1218.4623.24%23.310.00
EfficientPhys [22]32.1212.2316.78%23.400.31
PhysNet [57]33.658.6411.09%16.140.35
PhysFormer [58]48.4610.4113.26%15.540.24
Ours18.085.106.81%12.020.620.73
Train on [49]DeepPhys [8]77.8817.9422.44%22.490.07
TS-CAN [21]75.5817.6522.02%22.020.01
EfficientPhys [22]44.2313.8518.28%22.840.19
PhysNet [57]48.4611.2414.27%17.470.32
PhysFormer [58]39.819.5812.59%15.140.32
Ours16.154.616.07%11.650.650.78
", + "bbox": [ + 245, + 226, + 756, + 436 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Evaluation Configuration We gauge performance of all methods via HR estimations from the power-spectral density. These estimations are carried over 300-sample windows (10 seconds), with a stride of 128 samples. Following [49], we validate4 the learning-based methods by performing six-fold cross-validation while averaging across the entire dataset for algorithmic methods. Similarly, we construct three folds for [53] to evaluate the learning methods. Please refer to the supplement for details, including visualization of signal strength masks.", + "bbox": [ + 212, + 463, + 787, + 568 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Figures 6 and 7 show the results of our algorithm against the baseline methods. For ease of interpretability, we correct for random phase lag between the face (site of signal measurement) and finger (site of ground truth measurement).", + "bbox": [ + 212, + 569, + 787, + 614 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "7.2 Out of Distribution Plethysmography", + "text_level": 1, + "bbox": [ + 214, + 635, + 571, + 651 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We use our self-collected optically challenging dataset to benchmark OOD performance. While we primarily employ this dataset, we acknowledge that this is not the only notion of OOD. Hence, we also perform cross-dataset inference as part of the evaluation protocol to measure generalization capacity.", + "bbox": [ + 212, + 659, + 787, + 720 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Optically Challenging OOD Evaluation Table 1 presents a quantitative analysis of OOD performance. Learning-based methods are trained on the datasets from [53] and [49], and the best fold is chosen for OOD inference.", + "bbox": [ + 212, + 739, + 794, + 785 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Given their capacity to memorize distinguishable patterns, learning methods [57,58] handle input noise better than algorithmic methods for in-distribution", + "bbox": [ + 212, + 786, + 787, + 818 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 343, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_footnote", + "text": "4 Baselines are configured, where possible, using the toolbox from [23].", + "bbox": [ + 217, + 824, + 691, + 840 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/7827ca514e0562cd5e32455746b48d97ee48936146263cbe580c472eacbc2781.jpg", + "table_caption": [ + "Table 2: In-distribution and Cross-dataset OOD performance across two datasets - [49] and [53] shows comparable or superior performance compared to prior methods. Across in-distribution and cross-dataset validation, our method is the most consistent compared to SOTA methods. The best-performing and second-best-performing numbers are shown in green and yellow, respectively. There are 4 quadrants: $1^{st}$ - top left, $2^{nd}$ - top right, $3^{rd}$ - bottom right and $4^{th}$ - bottom left." + ], + "table_footnote": [], + "table_body": "
MethodTest on [53]Test on [49]
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑
Green [48]12.193.714.75%10.270.64
POS [51]6.192.032.84%6.750.84
CHROM [11]9.662.743.81%7.920.78
ICA [41]9.742.943.83%9.150.71
Train on [53]
DeepPhys [8]72.7016.3321.32%20.430.0276.2618.2122.79%22.340.02
TS-CAN [21]74.5016.6921.87%20.690.0177.1718.2823.17%22.380.03
EfficientPhys [22]2.261.021.59%5.510.884.471.672.27%5.900.89
PhysNet [57]2.760.941.37%4.690.923.581.191.59%3.750.96
PhysFormer [58]4.331.281.72%5.030.9025.086.508.58%12.280.54
Ours3.221.211.78%5.610.884.391.662.17%4.690.94
Green [48]19.586.277.53%14.270.57
POS [51]6.002.132.78%6.540.89
CHROM [11]8.072.383.07%6.720.89
ICA [41]17.155.136.00%12.210.66
Train on [49]
DeepPhys [8]73.8516.6021.66%20.550.0077.4318.4623.26%22.460.01
TS-CAN [21]75.3017.0322.35%20.960.0377.3618.6123.49%22.760.00
EfficientPhys [22]11.454.446.43%13.460.5321.586.508.53%14.080.53
PhysNet [57]66.4414.0419.72%17.810.064.721.481.87%4.480.93
PhysFormer [58]22.745.277.34%9.930.622.961.061.37%3.350.96
Ours3.161.161.69%5.330.893.341.221.61%4.010.96
", + "bbox": [ + 243, + 239, + 754, + 464 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "inference. However, this also leads to poorer generalizability on our OOD dataset, as emphasized by both the Pearson coefficient (r) and the \"r-consistency\" metrics. In contrast, algorithmic methods rely on deterministic heuristics. While this promotes good generalizability, it makes them extremely sensitive to factors such as lighting, occlusion, etc., leading to generally poorer performance.", + "bbox": [ + 212, + 493, + 785, + 568 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Our proposed method maximizes signal strength while avoiding overfitting to the training distribution. We are, therefore, Pareto-optimal in both OOD performance and inter-distribution parity (Figure 2) regarding the T-Test value and \"r-consistency\" score. Our method is both the best and second-best performing method, outperforming Green (the best baseline) with $48.8\\%$ and $40.9\\%$ reduction in T-Test and MAE values. Clinically, this implies an almost $2x$ reduction in the number of participants on whom the method fails following the AAMI standard. Further granular analysis can be found in the supplement.", + "bbox": [ + 212, + 570, + 787, + 691 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Cross-Dataset OOD and In-Distribution Evaluation Another notion of OOD is a cross-dataset generalization. Domain shifts between datasets result from differences in hardware and acquisition conditions. Learning-based methods tend to overfit the training data. Our experiments use datasets from [53] and [49] for their size and diversity. Table 2 indicates that while deep learning methods perform well in-distribution ( $1^{\\text{st}}$ and $3^{\\text{rd}}$ quadrant), they cannot maintain the same level of performance for cross-dataset inference ( $2^{\\text{nd}}$ and $4^{\\text{th}}$ quadrant). Algorithmic methods have no notion of cross-dataset evaluation. When trained", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/5eb7f878dacc8556076fa9a390236910e8e0336a727e66ea4d4ba13f05186388.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 272, + 147, + 357, + 215 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/c15cf934f2f24a0b3996a67356a829c9419f107e8e5b993db662d31653c20254.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 359, + 146, + 447, + 218 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/31e98aa82d4ef60f27d62c168f6a4cfd6629d9529186724567a3116acf15c51f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 450, + 146, + 537, + 218 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/b34ea040ce7f83c303a1d3938839ef8c5f3f124fe0c4909fe82e60edf7b80a98.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 542, + 146, + 630, + 218 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/930d90b471e6843686bf891f05166b6d19f9e66cc536340500531d34fe6af718.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 633, + 147, + 727, + 218 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/8c98afcece5268625400298422de3982eda05bc98c88599457430e2238dbd499.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 272, + 223, + 356, + 290 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/55514e872dc08f841fab601149549115da8045ca73ba58de54b2839968626628.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 359, + 222, + 446, + 292 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/a6bc6ae3e7d02e82178962ebe6649970eab64d9980cd1760b603f674f23703c5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 450, + 222, + 540, + 292 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/12878ee782063ed70481413124e57716e52facadb2a57650886c3ca284683f08.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 545, + 223, + 633, + 292 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/7c537bfffb2e6bc25be780a1ebaa0060c2fbaadf0d32e6c905d429679d05fb2b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 635, + 223, + 725, + 292 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/20b883b8c9ab981e950bf1d61110ec77c9a3c70eff2b685d59c3762e084ac0b2.jpg", + "image_caption": [ + "(a) VID." + ], + "image_footnote": [], + "bbox": [ + 272, + 300, + 356, + 364 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/c53dd50ce8633f3f331079114f3277e938c23371893749cf1974e61521536478.jpg", + "image_caption": [ + "(b) [48]" + ], + "image_footnote": [], + "bbox": [ + 359, + 297, + 446, + 367 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/b526097aca886d88ce746502e3fa3edc153cb7ad80df517cb4040f2e5a1c6597.jpg", + "image_caption": [ + "(c) [58]" + ], + "image_footnote": [], + "bbox": [ + 450, + 297, + 539, + 367 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/95cb1e57072cf59fef8d2a9cb9c3d30d4ee62f60f778facaf7c539143e72f207.jpg", + "image_caption": [ + "(d) OURS", + "Fig.6: Across challenging OOD optical settings, the proposed method can capture details of the plethysmograph waveform compared to prior methods. Results shown use models trained on the dataset proposed in [49], where applicable. Additional results are presented in the supplement." + ], + "image_footnote": [], + "bbox": [ + 545, + 297, + 633, + 367 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/ce8e28167366a0db69994856be44791ec62dd24698d06ea7201d0d782765c492.jpg", + "image_caption": [ + "(e) GT" + ], + "image_footnote": [], + "bbox": [ + 635, + 297, + 725, + 367 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "on [49] and tested on [53] ( $4^{th}$ quadrant), we outperform all prior work. In the reverse scenario (2nd quadrant), we are the second-best, marginally behind [57].", + "bbox": [ + 212, + 481, + 784, + 510 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Despite OOD being our central focus, our model offers results comparable to SOTA algorithms even for in-distribution evaluation. Our method is within 0.3 bpm MAE compared to all top baselines (a difference that is not clinically significant). Additionally, our method shows a sub 0.5 bpm standard deviation of MAE across various folds used for evaluation in all configurations. Overall, our method is the most consistent across all quadrants while yielding errors within 2 bpm MAE, which most likely would be clinically accurate.", + "bbox": [ + 212, + 512, + 784, + 617 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "7.3 Qualitative Comparison", + "text_level": 1, + "bbox": [ + 214, + 636, + 457, + 651 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In Figure 6, we assess the qualitative waveforms generated on our optically challenging OOD dataset. We compare our method against the best-performing algorithmic and deep learning methods from Table 1, i.e., Green [48] and PhysFormer [58] respectively. For the representative samples, our method is superior in performance and can retain the shape of the plethysmography signal. The second scene, with the mask and glasses, especially highlights these gains. We also show superior rPPG estimation for extreme scenes (window reflections).", + "bbox": [ + 212, + 657, + 784, + 763 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In Figure 7, we assess qualitative waveforms from in-distribution inference samples from [49]. We compare our method with PhysFormer [58] and POS [51] as the best-performing in-distribution deep learning and algorithmic methods. Our method retains both the frequency information and salient features of the waveform across diverse skin tones in the dataset.", + "bbox": [ + 212, + 765, + 784, + 838 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 344, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/3643150efc4f1fa9fadb10f495d31385ec9086aa32c7b6bc5e5ed5412ec67cc9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 272, + 151, + 356, + 218 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/458c7eaf94832d4f5974a4bcac5c3218367b8b29c4b32f1e476d90ab733080b0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 357, + 150, + 444, + 222 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/5291fa2b6f63b4fd1fa3c8c474d3c44ab0cd45b1f58d7494a5520651fbd2c87a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 450, + 150, + 539, + 222 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/165dd5e49d5b357d0aac37b7434eb5968751a0852e439db9213a48201094a10e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 540, + 150, + 633, + 222 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/0e052412cfd02a5d369303da6dbe104940a5ce643cb8b4957788f5e49d9f3826.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 635, + 151, + 723, + 222 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/a80ccdaece25b0ff8b79395e1a6c4cfd45e38ac5366e73168c2ece75d80f91c6.jpg", + "image_caption": [ + "(a) VID." + ], + "image_footnote": [], + "bbox": [ + 272, + 231, + 356, + 295 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/fb10b75d47089a50a7e92ce70afc2887b1544f89090b96c6bdb73d0b28cd6bfe.jpg", + "image_caption": [ + "(b) [51]" + ], + "image_footnote": [], + "bbox": [ + 357, + 229, + 444, + 299 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/98725dd7e4fb6d28cf97226e171a28c23e59ffde5032a78e2479095e2f4caed2.jpg", + "image_caption": [ + "(c) [58]", + "Fig. 7: In distribution inference on a diverse dataset. Our method better captures rPPG waveform details across skin tones for in-distribution evaluation on [49] dataset. While our method and [58] both perform reasonably well across skin tones, [58] does so with poorer OOD performance (Figure 6). More results in the supplement." + ], + "image_footnote": [], + "bbox": [ + 450, + 229, + 539, + 299 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/5d4629d6c9b4b5348256e623d74f6df3386ca99264cce1a5bddb55c07ff82701.jpg", + "image_caption": [ + "(d) Ours" + ], + "image_footnote": [], + "bbox": [ + 540, + 229, + 633, + 299 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/54bf683d4a1f845a8c3493ed2b2ba971a43780a4ff60ddbccd2f62b7b8bcc122.jpg", + "image_caption": [ + "(e) GT" + ], + "image_footnote": [], + "bbox": [ + 635, + 229, + 723, + 299 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "8 Discussion", + "text_level": 1, + "bbox": [ + 215, + 411, + 354, + 426 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We propose an INR for camera-based rPPG. We introduce the concept of $\\mathcal{A}$ - $\\mathcal{B}$ decomposition and propose an INR architecture to achieve this at scale. The proposed model is evaluated on a dataset of optically challenging OOD participants in addition to existing datasets. Our model performs best on the OOD dataset while comparable to SOTA for in-distribution validation.", + "bbox": [ + 212, + 439, + 784, + 515 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "8.1 Limitations", + "text_level": 1, + "bbox": [ + 215, + 534, + 354, + 547 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Being the first method using INRs for rPPG, limitations exist. First, while we reduce runtime over traditional INRs (as discussed in the supplement), and some rPPG methods report comparable runtimes [26], this is an avenue for future improvement. Second, while the proposed method is competitive for challenging scenes like talking and motion (supplement), these problems remain open.", + "bbox": [ + 212, + 556, + 784, + 632 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "8.2 Societal Impacts and Ethical Considerations", + "text_level": 1, + "bbox": [ + 215, + 651, + 625, + 666 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We focus on rPPG in optically challenging scenes (Section 1.1) due to factors like lighting, facial occlusions (masks, glasses, medical equipment), etc. Robustness to such settings enables applicability in settings like hospital rooms, classrooms, driving, etc. Additionally, prior work [1, 37] has shown promise in using rPPG for tasks like biometrics and forensics, and OOD-robustness will bring these applications one step closer to real-world deployment. Finally, these methods can also potentially be applied to other modalities and vital signs [10, 12, 60].", + "bbox": [ + 212, + 672, + 784, + 779 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Technological solutions enabling healthcare for all, like this work, are relevant for social good. However, technology with clinical impact should only be deployed once the method is provably robust. Our method takes a step in that direction, but a pipeline of similar papers is needed to enable real-world rPPG deployment.", + "bbox": [ + 212, + 779, + 784, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We thank the Visual Machines Group (VMG) at UCLA for feedback and support. A.K. was supported by a National Science Foundation (NSF) CAREER award, IIS-2046737, Army Young Investigator Program Award, Defense Advanced Research Projects Agency (DARPA) Young Faculty Award, and a Cisco Research Award. P.C. was partially supported by a Cisco Research Award.", + "bbox": [ + 212, + 176, + 787, + 253 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 277, + 321, + 292 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Al Masri, A., Jasra, S.K.: The forensic biometric analysis of emotions from facial expressions, and physiological processes from the heart and skin. Journal of Emerging Forensic Sciences Research 1(1), 61-77 (2016)", + "2. Association, C.T.: Physical activity monitoring for heart rate, ansi/cta-2065 (2018)", + "3. Ba, Y., Wang, Z., Karinca, K.D., Bozkurt, O.D., Kadambi, A.: Overcoming difficulty in obtaining dark-skinned subjects for remote-ppg by synthetic augmentation. arXiv preprint arXiv:2106.06007 (2021)", + "4. Balakrishnan, G., Durand, F., Guttag, J.: Detecting pulse from head motions in video. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 3430-3437 (2013)", + "5. Chari, P., Ba, Y., Athreya, S., Kadambi, A.: Mime: Minority inclusion for majority group enhancement of ai performance. In: European conference on computer vision. pp. 326-343. Springer (2022)", + "6. Chari, P., Kabra, K., Karinca, D., Lahiri, S., Srivastava, D., Kulkarni, K., Chen, T., Cannesson, M., Jalilian, L., Kadambi, A.: Diverse r-ppg: Camera-based heart rate estimation for diverse subject skin-tones and scenes. arXiv preprint arXiv:2010.12769 (2020)", + "7. Chen, H., He, B., Wang, H., Ren, Y., Lim, S.N., Shrivastava, A.: Nerv: Neural representations for videos. Advances in Neural Information Processing Systems 34, 21557-21568 (2021)", + "8. Chen, W., McDuff, D.: Deepphys: Video-based physiological measurement using convolutional attention networks. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 349-365 (2018)", + "9. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022)", + "0. Chen, Z., Zheng, T., Cai, C., Luo, J.: Movi-fi: Motion-robust vital signs waveform recovery via deep interpreted rf sensing. In: Proceedings of the 27th annual international conference on mobile computing and networking. pp. 392–405 (2021)", + "1. De Haan, G., Jeanne, V.: Robust pulse rate from chrominance-based rppg. IEEE Transactions on Biomedical Engineering 60(10), 2878-2886 (2013)", + "2. Del Regno, K., Vilesov, A., Armouti, A., Harish, A.B., Can, S.E., Kita, A., Kadambi, A.: Thermal imaging and radar for remote sleep monitoring of breathing and apnea. arXiv preprint arXiv:2407.11936 (2024)", + "3. Gao, C., Saraf, A., Kopf, J., Huang, J.B.: Dynamic view synthesis from dynamic monocular video. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5712-5721 (2021)" + ], + "bbox": [ + 225, + 310, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 343, + 114, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Hurter, C., McDuff, D.: Cardiolens: remote physiological monitoring in a mixed reality environment. In: ACM siggraph 2017 emerging technologies, pp. 1-2 (2017)", + "15. Jiang, C., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T., et al.: Local implicit grid representations for 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6001-6010 (2020)", + "16. Kadambi, A.: Achieving fairness in medical devices. Science 372(6537), 30-31 (2021)", + "17. Lee, E., Chen, E., Lee, C.Y.: Meta-rppg: Remote heart rate estimation using a transductive meta-learner. In: European Conference on Computer Vision. pp. 392–409. Springer (2020)", + "18. Li, R., Tancik, M., Kanazawa, A.: Nerfacc: A general nef acceleration toolbox. arXiv preprint arXiv:2210.04847 (2022)", + "19. Li, Z., Niklaus, S., Snavely, N., Wang, O.: Neural scene flow fields for space-time view synthesis of dynamic scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6498-6508 (2021)", + "20. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16252-16262 (2022)", + "21. Liu, X., Fromm, J., Patel, S., McDuff, D.: Multi-task temporal shift attention networks for on-device contactless vitals measurement. Advances in Neural Information Processing Systems 33, 19400-19411 (2020)", + "22. Liu, X., Hill, B., Jiang, Z., Patel, S., McDuff, D.: Efficientphys: Enabling simple, fast and accurate camera-based cardiac measurement. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 5008-5017 (January 2023)", + "23. Liu, X., Zhang, X., Narayanswamy, G., Zhang, Y., Wang, Y., Patel, S., McDuff, D.: Deep physiological sensing toolbox. arXiv preprint arXiv:2210.00716 (2022)", + "24. Magdalena Nowara, E., Marks, T.K., Mansour, H., Veeraraghavan, A.: Sparseppg: Towards driver monitoring using camera-based vital signs estimation in near-infrared. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 1272-1281 (2018)", + "25. Mai, L., Liu, F.: Motion-adjustable neural implicit video representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10738-10747 (2022)", + "26. Maity, A.K., Wang, J., Sabharwal, A., Nayar, S.K.: Robustppg: camera-based robust heart rate estimation using motion cancellation. Biomedical Optics Express 13(10), 5447-5467 (2022)", + "27. Martel, J.N., Lindell, D.B., Lin, C.Z., Chan, E.R., Monteiro, M., Wetzstein, G.: Acorn: Adaptive coordinate networks for neural scene representation. arXiv preprint arXiv:2105.02788 (2021)", + "28. Mehta, I., Gharbi, M., Barnes, C., Shechtman, E., Ramamoorthi, R., Chandraker, M.: Modulated periodic activations for generalizable local functional representations. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14214-14223 (2021)", + "29. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "30. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)", + "31. Monitors, C.: Heart rate meters, and alarms. ANSI/AAMI Standard EC13 (2002)", + "32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Trans. Graph. 41(4), 102:1-102:15 (Jul 2022). https://doi.org/10.1145/3528223.3530127, https://doi.org/10.1145/3528223.3530127", + "33. Nelson, B.W., Allen, N.B.: Accuracy of consumer wearable heart rate measurement during an ecologically valid 24-hour period: intraindividual validation study. JMIR mHealth and uHealth 7(3), e10828 (2019)", + "34. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013)", + "35. Niu, X., Shan, S., Han, H., Chen, X.: Rhythmnet: End-to-end heart rate estimation from face via spatial-temporal representation. IEEE Transactions on Image Processing 29, 2409-2423 (2019)", + "36. Nowara, E.M., McDuff, D., Veeraraghavan, A.: A meta-analysis of the impact of skin tone and gender on non-contact photoplethysmography measurements. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 284-285 (2020)", + "37. Nowara, E.M., Sabharwal, A., Veeraraghavan, A.: Ppgsecure: Biometric presentation attack detection using photopletysmograms. In: 2017 12th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2017). pp. 56-62. IEEE (2017)", + "38. Owhadi, H., Scovel, C., Sullivan, T.J., McKerns, M., Ortiz, M.: Optimal uncertainty quantification. Siam Review 55(2), 271-345 (2013)", + "39. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019)", + "40. Peters, H., Ba, Y., Kadambi, A.: pcon: Polarimetric coordinate networks for neural scene representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)", + "41. Poh, M.Z., McDuff, D.J., Picard, R.W.: Non-contact, automated cardiac pulse measurements using video imaging and blind source separation. Optics express 18(10), 10762-10774 (2010)", + "42. Ramaswamy, V.V., Kim, S.S., Russakovsky, O.: Fair attribute classification through latent space de-biasing. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9301-9310 (2021)", + "43. Schulz, P., Scheuvens, L., Fettweis, G.: A new perspective on maximal-ratio combining. In: 2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). pp. 1-7. IEEE (2023)", + "44. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in Neural Information Processing Systems 33, 7462-7473 (2020)", + "45. Song, R., Chen, H., Cheng, J., Li, C., Liu, Y., Chen, X.: Pulsegan: Learning to generate realistic pulse waveforms in remote photoplethysmography. IEEE Journal of Biomedical and Health Informatics 25(5), 1373-1384 (2021)" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Implicit Neural Models to Extract Heart Rate from Video", + "bbox": [ + 344, + 114, + 730, + 127 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020)", + "47. Teschner, M., Heidelberger, B., Müller, M., Pomerantes, D., Gross, M.H.: Optimized spatial hashing for collision detection of deformable objects. In: Vmv. vol. 3, pp. 47-54 (2003)", + "48. Verkruysse, W., Svaasand, L.O., Nelson, J.S.: Remote plethysmographic imaging using ambient light. Optics express 16(26), 21434-21445 (2008)", + "49. Vilesov, A., Chari, P., Armouti, A., Harish, A.B., Kulkarni, K., Deoghare, A., Jalilian, L., Kadambi, A.: Blending camera and 77 ghz radar sensing for equitable, robust plethysmography. ACM Transactions on Graphics (TOG) 41(4), 1-14 (2022)", + "50. Wadhwa, N., Rubinstein, M., Durand, F., Freeman, W.T.: Phase-based video motion processing. ACM Transactions on Graphics (TOG) 32(4), 1-10 (2013)", + "51. Wang, W., Den Brinker, A.C., Stuijk, S., De Haan, G.: Algorithmic principles of remote ppg. IEEE Transactions on Biomedical Engineering 64(7), 1479-1491 (2016)", + "52. Wang, Z., Qinami, K., Karakozis, I.C., Genova, K., Nair, P., Hata, K., Russakovsky, O.: Towards fairness in visual recognition: Effective strategies for bias mitigation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8919-8928 (2020)", + "53. Wang, Z., Ba, Y., Chari, P., Bozkurt, O.D., Brown, G., Patwa, P., Vaddi, N., Jalilian, L., Kadambi, A.: Synthetic generation of face videos with plethysmograph physiology. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20587-20596 (2022)", + "54. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. arXiv preprint arXiv:2212.04096 (2022)", + "55. Wu, H.Y., Rubinstein, M., Shih, E., Guttag, J., Durand, F., Freeman, W.: Eulerian video magnification for revealing subtle changes in the world. ACM transactions on graphics (TOG) 31(4), 1-8 (2012)", + "56. Xu, T., White, J., Kalkan, S., Gunes, H.: Investigating bias and fairness in facial expression recognition. In: Computer Vision-ECCV 2020 Workshops: Glasgow, UK, August 23-28, 2020, Proceedings, Part VI 16. pp. 506-523. Springer (2020)", + "57. Yu, Z., Li, X., Zhao, G.: Remote photoplethysmograph signal measurement from facial videos using spatio-temporal networks. arXiv preprint arXiv:1905.02419 (2019)", + "58. Yu, Z., Shen, Y., Shi, J., Zhao, H., Torr, P.H., Zhao, G.: Physformer: facial video-based physiological measurement with temporal difference transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4186-4196 (2022)", + "59. Zhao, E.Q., Vilesov, A., Athreya, S., Chari, P., Merlos, J., Millett, K., Cyr, N.S., Jalilian, L., Kadambi, A.: Making thermal imaging more equitable and accurate: resolving solar loading biases. arXiv preprint arXiv:2304.08832 (2023)", + "60. Zheng, T., Chen, Z., Zhang, S., Cai, C., Luo, J.: More-fi: Motion-robust and fine-grained respiration monitoring via deep-learning uwb radar. In: Proceedings of the 19th ACM Conference on Embedded Networked Sensor Systems. pp. 111–124 (2021)", + "61. Zhi, S., Laidlow, T., Leutenegger, S., Davison, A.J.: In-place scene labelling and understanding with implicit scene representation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15838-15847 (2021)" + ], + "bbox": [ + 215, + 146, + 785, + 830 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "P. Chari et al.", + "bbox": [ + 271, + 114, + 367, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_model.json b/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_model.json new file mode 100644 index 0000000000000000000000000000000000000000..eba4a8efd5926ac0b375d07050a1b22cd220100a --- /dev/null +++ b/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_model.json @@ -0,0 +1,2843 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.237, + 0.141, + 0.768, + 0.185 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.212, + 0.787, + 0.245 + ], + "angle": 0, + "content": "Pradyumna Chari\\(^{*1}\\), Anirudh Bindiganavale Harish\\(^{*,\\dagger,2}\\), Adnan Armouti\\(^{\\dagger,3}\\), Alexander Vilesov\\(^{1}\\), Sanjit Sarda\\(^{1}\\), Laleh Jalilian\\(^{1}\\), and Achuta Kadambi\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.255, + 0.765, + 0.296 + ], + "angle": 0, + "content": "1 University of California Los Angeles, Los Angeles CA 90095, USA {pradyumnac,vilesov,sanjitsarda}@ucla.edu, ljalilian@mednet.ucla.edu achuta@ee.ucla.edu" + }, + { + "type": "text", + "bbox": [ + 0.355, + 0.297, + 0.647, + 0.324 + ], + "angle": 0, + "content": "\\(^{2}\\) Rice University, Houston TX 77005, USA anirudhbh@rice.edu" + }, + { + "type": "text", + "bbox": [ + 0.357, + 0.325, + 0.644, + 0.352 + ], + "angle": 0, + "content": "3 Cornell Tech, New York NY 10044, USA armouti@cs.cornell.edu" + }, + { + "type": "list", + "bbox": [ + 0.24, + 0.255, + 0.647, + 0.352 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.276, + 0.391, + 0.731, + 0.564 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.575, + 0.788, + 0.646 + ], + "angle": 0, + "content": "Fig. 1: Prior implicit neural models represent scenes for diverse applications. We propose an implicit neural representation (INR) to decompose face videos and isolate blood flow information. Our INR decomposes input videos into visual appearance and blood flow (\"A-B decomposition\"). The decomposed data aids in estimating the remote photoplethysmography (rPPG) signal and heart rate." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.705, + 0.744, + 0.817 + ], + "angle": 0, + "content": "Abstract. Scene representation networks, or implicit neural representations (INR) have seen a range of success in numerous image and video applications. However, being universal function fitters, they fit all variations in videos without any selectivity. This is particularly a problem for tasks such as remote plethysmography, the extraction of heart rate information from face videos. As a result of low native signal to noise ratio, previous signal processing techniques suffer from poor performance, while previous learning-based methods have improved performance but" + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.826, + 0.598, + 0.84 + ], + "angle": 0, + "content": "* - Contributed Equally, †- Work done when at UCLA" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.148, + 0.744, + 0.358 + ], + "angle": 0, + "content": "suffer from hallucinations that mitigate generalizability. Directly applying prior INRs cannot remedy this signal strength deficit, since they fit to both the signal as well as interfering factors. In this work, we introduce an INR framework that increases this plethysmograph signal strength. Specifically, we leverage architectures to have selective representation capabilities. We are able to decompose the face video into a blood plethysmograph component, and a face appearance component. By inferring the plethysmograph signal from this blood component, we show state-of-the-art performance on out-of-distribution samples without sacrificing performance for in-distribution samples. We implement our framework on a custom-built multiresolution hash encoding backbone to enable practical dataset-scale representations through a 50x speed-up over traditional INRs. We also present a dataset of optically challenging out-of-distribution scenes to test generalization to real-world scenarios. Code and data may be found at https://implicitppg.github.io/." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.37, + 0.741, + 0.385 + ], + "angle": 0, + "content": "Keywords: Implicit neural representations \\(\\cdot\\) Remote plethysmography" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.412, + 0.376, + 0.429 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.447, + 0.788, + 0.537 + ], + "angle": 0, + "content": "Neural scene representations have gained significant prominence over recent years. The ability to use neural networks as function fitters and encode scene information within their weights has found considerable applications for tasks such as image representations [20, 27, 40, 44], scene representations [15, 39, 54, 61], radiance fields [18, 29, 30] and video representations [7, 9, 25]. Consistent among these applications is the need to fit all possible scene variations without selectivity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.788, + 0.688 + ], + "angle": 0, + "content": "However, for the task of remote plethysmography, the contactless monitoring of heart rate information from face videos via subtle skin color variations, selecting for the blood flow is required. Therefore, this indiscriminate fitting behavior of current implicit neural representations (INRs) is a significant drawback: both the signal and interfering factors will get fitted. Prior work [6,16,36,49] has established the low Signal-to-Noise Ratio (SNR) of the measurement (in this case, the facial image) as the source of remote photoplethysmography (rPPG) performance degradation. Previous methods generally fall into two categories: signal processing-based or deep learning-based. These two classes have established a trade-off between domain generalizability and in-distribution performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.81 + ], + "angle": 0, + "content": "Signal processing techniques improve signal strength by using model-based assumptions (such as band-pass filters or simple coloration models [11, 51]). These usually lead to relatively larger heart rate estimation errors. Recently, learning-based methods [8, 57, 58] for plethysmography have achieved state-of-the-art (SOTA) performance through end-to-end data-driven approaches. However, these methods suffer from generalization issues, where samples that are \"out-of-distribution\" (OOD) may show unspecified and often undesirable behavior due to overfitting." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "We propose an INR-based framework to improve the plethysmograph signal strength in facial videos before estimating the blood volume pulse signal." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.345, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.388, + 0.145, + 0.613, + 0.314 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.328, + 0.788, + 0.399 + ], + "angle": 0, + "content": "Fig.2: Our implicit representation for rPPG achieves Pareto-optimality across out-of-distribution (OOD) performance and inter-distribution parity compared to prior algorithmic and learning-based methods. It performs better on OOD samples while maximizing parity between in-distribution and OOD performance. Table 1 shows metrics used for this plot. Higher is better along both axes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.627 + ], + "angle": 0, + "content": "Specifically, we introduce a new Appearance-Blood (or \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\)) decomposition for facial video data. The decomposition is designed to improve the plethysmograph signal quality across the face. We show that the representation capacity of carefully designed INRs, with architectures motivated by light transport principles of the problem (namely the nature of subtle skin color variations due to the plethysmograph signal), can enable such a decomposition, allowing isolation of the relevant blood component. Conventional INRs, however, are slow to train, thereby making them intractable for dataset-scale analyses. We use multiresolution hash encodings inspired by [32] to facilitate fast \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposition. To the best of our knowledge, we propose the first camera-based rPPG method that uses implicit neural representations as a critical component of the estimation pipeline. Different from prior methods, we focus on both in and out-of-distribution performance (specifically, optically challenging OOD)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.765 + ], + "angle": 0, + "content": "On a self-collected dataset of optically challenging OOD scenes, our method surpasses existing algorithmic and learning-based methods (Figure 2) with reliable plethysmograph and heart rate estimates. Notably, we achieve this OOD performance gain without compromising on in-distribution performance on rPPG datasets (Figure 1). As an additional outcome, we can obtain high-fidelity estimates of the plethysmograph signal strength (referred to as neural signal strength mask) across the face that generalize with high fidelity to OOD scenes and settings such as face paint, masks, glasses, and even reflection from windows. In summary, our contributions are as follows:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "1. We formulate Appearance-Blood \\((\\mathcal{A} - \\mathcal{B})\\) decomposition as a means of enhancing plethysmograph signal strength. We show that carefully designed implicit neural representations can serve as efficient \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposers and propose a fast method to achieve this." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.232, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.147, + 0.784, + 0.206 + ], + "angle": 0, + "content": "2. This decomposition is the foundation for our proposed rPPG estimation method. On our optically challenging OOD dataset, our method shows significant improvements in performance over prior algorithmic and learning-based methods (Figure 2) without losing out on in-distribution performance." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.207, + 0.785, + 0.252 + ], + "angle": 0, + "content": "3. An optically challenging test dataset, consisting of 104 videos (\\(\\approx\\) 1 hour of recorded data) across various optically challenging and OOD configurations, is collected and will be released upon acceptance of this work." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.276, + 0.311, + 0.29 + ], + "angle": 0, + "content": "1.1 Scope" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.301, + 0.788, + 0.483 + ], + "angle": 0, + "content": "This work establishes the effectiveness of fast INRs to learn desired components of video data selectively - in this case, plethysmograph information. Other applications, such as video-based blood oxygenation and blood pressure estimation, require accurate plethysmography as a necessary first step. However, these applications are open research problems and is outside this work's scope. Furthermore, motion-robust rPPG is an open challenge and requires extensive research on its own. While this is not our primary goal, and our proposed method is not designed to combat motion artifacts, we test performance on motion videos and find our method competitive (supplement). Finally, we acknowledge that OOD is multi-faceted. This work primarily focused on optically challenging scenes and achieved SOTA results while secondarily validating performance on real-world obfuscations such as talking (and associated motions)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.506, + 0.388, + 0.521 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.788, + 0.69 + ], + "angle": 0, + "content": "Implicit Neural Representations. Implicit neural representations (INRs) are an increasingly prevalent method to represent scenes. Examples settings include image representations [20, 27, 40, 44], video representations [7, 9, 25], and 3-D scene representations [15, 39, 54, 61]. Specifically, this work is interested in the class of video-based representations. These include methods that use convolutional networks [7], phase-based motion-adjustable representation [25], space-time super-resolution [9] and flow fields for space-time viewpoint synthesis [13, 19]. We take inspiration from these prior methods but have different goals. We aim to use the video representation capacity of implicit networks to isolate imperceptible physiological phenomena, such as plethysmograph signals." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Fast Implicit Neural Representations. A critical drawback of INRs is the time taken to train the networks for dataset scale experimentation and inference. Recent work, however, has taken a step toward alleviating this concern. [28] have proposed using a latent feature-based modulation network to generalize implicit representation models to model a broader range of images for faster convergence. Further, specialized toolboxes have been released to accelerate the training time of NeRFs [18,32]. In this work, we are interested in employing [32]'s parametric multiresolution spatial hash encodings as inputs to a shallow MLP. Using this foundation, we extend the framework to video INRs, specifically for" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.344, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "generalizable, robust camera-based plethysmography. This technique can achieve orders of magnitude improvements in training time for INRs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.191, + 0.788, + 0.435 + ], + "angle": 0, + "content": "Remote Plethysmography. Heart rate estimation using rPPG has been actively studied. Early methods were based on algorithmic principles of color variations [11, 51] or motion based on Newtonian reaction to blood flow [4]. Such methods are not limited to use with RGB cameras. Near Infrared (NIR) Imaging with active illumination has been employed to combat the effects of unreliable illumination in the visible (VIS) spectrum [24]. Augmented reality [14] is another avenue for this research. Deep learning approaches have also been utilized to attain SOTA results. [8] used an attention-based Convolutional Neural Network (CNN) while [57] introduced spatio-temporal CNNs. Other work has extended these architectures [35], including using transformers [58], incorporated meta-learning [17], improved PPG waveform characteristics [45], and augmented rPPG datasets with synthetic examples [3, 53]. Another class of methods focuses on improving equity between groups, such as participants of different skin tones [16, 36]. These include algorithmic methods [6] or multimodal fusion methods [49]. Methods for assessing and improving equity are not restricted to rPPG and extend to a range of computer vision problems [5, 16, 42, 52, 56, 59]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.455, + 0.599, + 0.475 + ], + "angle": 0, + "content": "3 \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) Decomposition and Optimality" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.486, + 0.785, + 0.516 + ], + "angle": 0, + "content": "We begin with describing the mathematical underpinnings of rPPG and propose the notion of appearance-blood \\((\\mathcal{A} - \\mathcal{B})\\) decomposition and its benefits." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.517, + 0.785, + 0.591 + ], + "angle": 0, + "content": "Fundamentally, the rPPG signal is subtle, making its estimation difficult. While contemporary methods [8, 57, 58] circumvent this through deep networks, they fare poorly on OOD samples. This necessitates a generalizable method capable of extracting the rPPG signal without relying on domain-specific features that tend to overfit. This motivates our functional decomposition." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.592, + 0.788, + 0.698 + ], + "angle": 0, + "content": "Given spatial coordinates \\(\\mathbf{x} \\in [-0.5, 0.5]^2\\), and temporal coordinate \\(t \\in [-0.5, 0.5]\\), the face videos are interpreted as RGB color fields \\(\\mathcal{C}(\\mathbf{x}, t)\\). This color field consists of specular reflections that act as interference and diffuse components arising from subsurface scattering containing plethysmograph information. We wish to decompose the color signal into a signal amplitude component, \\(p_m(\\mathbf{x}, t)\\), and a temporal plethysmograph signal \\(p_i(t)\\), our desired signal. However, the relation between \\(p_m(\\cdot, \\cdot)\\) and \\(p_i(\\cdot)\\) is non-linear in nature." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.698, + 0.785, + 0.713 + ], + "angle": 0, + "content": "Under reasonable assumptions, we show color signals can be decomposed as:" + }, + { + "type": "equation", + "bbox": [ + 0.367, + 0.729, + 0.785, + 0.744 + ], + "angle": 0, + "content": "\\[\n\\mathcal {C} (\\mathbf {x}, t) = \\mathcal {A} (\\mathbf {x}, t) + \\mathcal {B} (\\mathbf {x}, t) + \\mathbf {v _ {n}} (\\mathbf {x}, t), \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "where \\(\\mathcal{A}(\\mathbf{x},t)\\) represents the facial appearance (or \\(\\mathcal{A}\\)-function) - including specular highlights - which is interference. \\(\\mathcal{B}(\\mathbf{x},t)\\), the blood component (or \\(\\mathcal{B}\\)-function), contains the spatiotemporally varying color changes arising out of blood flow (plethysmography) that incorporates \\(p_m(\\cdot ,\\cdot)\\) and \\(p_i(\\cdot)\\). \\(\\mathbf{v}_{\\mathbf{n}}(\\cdot ,\\cdot)\\) represents the measurement noise in the process. We will refer to this decomposition as the \\(\\mathcal{A} - \\mathcal{B}\\) decomposition. Then, the following Theorem holds." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "Theorem 1: The \\(\\mathcal{A} - \\mathcal{B}\\) decomposition results in a \\(\\mathcal{B}\\)-function with a Signal to Interference & Noise Ratio \\(SINR_{\\mathcal{B}}(\\mathbf{x},t)\\), such that \\(SINR_{\\mathcal{B}}(\\mathbf{x},t) \\geq SINR_{\\mathcal{C}}(\\mathbf{x},t)\\). That is, the \\(\\mathcal{A} - \\mathcal{B}\\) decomposition leads to an SINR gain." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.192, + 0.784, + 0.266 + ], + "angle": 0, + "content": "Note that Theorem 1 is an existence proof. It describes the existence of SINR benefits as a result of ideal decomposition, motivating its necessity in our real applications. Additionally, while SINR is computed across time, we also wish to model temporal variations due to lighting, pose changes, etc. This is what \\( t \\)-dependence for SINR denotes." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.268, + 0.784, + 0.299 + ], + "angle": 0, + "content": "Corollary 1: Given an \\(\\mathcal{A} - \\mathcal{B}\\) decomposed video field \\(\\mathcal{C}(\\mathbf{x},t)\\), the Maximal Ratio Combining (MRC)-optimal estimate for the plethysmograph \\(p_i(t)\\) is given by," + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.309, + 0.784, + 0.34 + ], + "angle": 0, + "content": "\\[\n\\widehat {p _ {i} ^ {*}} (t) = \\int_ {\\mathbf {x} \\in \\Omega} S I N R _ {\\mathcal {B}} (\\mathbf {x}, t) \\mathcal {B} (\\mathbf {x}, t) d \\mathbf {x}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.349, + 0.663, + 0.365 + ], + "angle": 0, + "content": "where \\(\\Omega = [-0.5, 0.5]^2\\), the domain of \\(\\mathbf{x}\\) as previously defined." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.379, + 0.784, + 0.41 + ], + "angle": 0, + "content": "This is the notion of near-optimal plethysmography we aim to achieve. Detailed derivations for this section can be found in the supplement." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.431, + 0.618, + 0.446 + ], + "angle": 0, + "content": "3.1 Optimal Plethysmography and Uncertainty" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.454, + 0.785, + 0.653 + ], + "angle": 0, + "content": "Equation 2 can also be interpreted in the context of uncertainty minimization [38]. In a discrete setting with \\(N\\) pixel locations \\(\\{\\mathbf{x}\\}_{i = 1}^{N}\\), each pixel is viewed as a sensor and the signal strength, \\(SINR_{\\mathcal{B}}(\\mathbf{x},t)\\) is a proxy for the uncertainty or unreliability. Then the problem of estimating \\(\\widehat{p_i^*}(t)\\) can be interpreted as Bayesian inference. With assumptions on prior and posterior distributions, it can be shown that the posterior \\(\\widehat{p_i^*}(t)\\) is Gaussian with mean \\(\\frac{\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)\\cdot\\mathcal{B}(\\mathbf{x}_i,t)}{\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)}\\) (best posterior estimate, a discretized and normalized version of Equation 2) and variance \\(1 / (\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t))\\). Since Equation 2 represents maximal ratio combining, \\(\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)\\propto SINR_{\\widehat{p_i^*}(t)}\\) ([43], Equation 31, 32), then, uncertainty (or the variance in the posterior) is inversely proportional to SINR of \\(\\widehat{p_i^*}(t)\\). Optimal plethysmography therefore becomes akin maximization of SINR, or minimization of uncertainty of \\(\\widehat{p_i^*}(t)\\). Please refer to the supplement for derivations." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.675, + 0.564, + 0.693 + ], + "angle": 0, + "content": "4 \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) Decomposition Using INRs" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.706, + 0.784, + 0.751 + ], + "angle": 0, + "content": "This section explores conditions for \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposition function approximators. We first establish necessary conditions that \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposers must meet and then explore how INRs can be designed to perform such decomposition." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.772, + 0.476, + 0.787 + ], + "angle": 0, + "content": "4.1 Functional Decomposition" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.794, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Consider two functions, \\(\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})\\) and \\(\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}})\\), parameterized by \\(\\Theta_{\\mathcal{A}}\\) and \\(\\Theta_{\\mathcal{B}}\\), that aim to represent \\(\\mathcal{A}(\\mathbf{x},t)\\) and \\(\\mathcal{B}(\\mathbf{x},t)\\) respectively. To perform an \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposition, we wish to find functions that satisfying:" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.344, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.342, + 0.145, + 0.66, + 0.229 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.238, + 0.788, + 0.294 + ], + "angle": 0, + "content": "Fig. 3: Sinusoidal Representation Networks (SRNs) can represent both \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\)-functions, while phase-based methods only represent the \\(\\mathcal{A}\\)-function. (a) SRNs, such as [44], can capture PPG color variations almost perfectly, while (b) phase-based motion representations, such as [25] are unable to capture it." + }, + { + "type": "equation", + "bbox": [ + 0.39, + 0.344, + 0.614, + 0.363 + ], + "angle": 0, + "content": "\\[\nd _ {\\mathcal {A}} (\\hat {\\mathcal {A}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {A}} ^ {*}), \\mathcal {A} (\\mathbf {x}, t)) \\leq \\epsilon_ {\\mathcal {A}},\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.4, + 0.366, + 0.786, + 0.384 + ], + "angle": 0, + "content": "\\[\nd _ {\\mathcal {B}} \\left(\\hat {\\mathcal {B}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {B}} ^ {*}), \\mathcal {B} (\\mathbf {x}, t)\\right) \\leq \\epsilon_ {\\mathcal {B}}, \\tag {3}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.387, + 0.612, + 0.406 + ], + "angle": 0, + "content": "\\[\nd _ {\\mathcal {B}} (\\hat {\\mathcal {A}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {A}} ^ {*}), \\mathcal {B} (\\mathbf {x}, t)) \\geq \\epsilon_ {\\mathcal {B}}.\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.413, + 0.785, + 0.459 + ], + "angle": 0, + "content": "where \\(\\Theta_{\\mathcal{A}}^{*}\\) and \\(\\Theta_{\\mathcal{B}}^{*}\\) are optimal parameters, and \\(d_{\\mathcal{A}}(\\cdot ,\\mathcal{A}(\\mathbf{x},t))\\) and \\(d_{\\mathcal{B}}(\\cdot ,\\mathcal{B}(\\mathbf{x},t))\\) are some component-dependent metric distances. This quantifies the requirement that \\(\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})\\) is able to represent the \\(\\mathcal{A}\\)-function but not the \\(\\mathcal{B}\\)-function." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.459, + 0.787, + 0.49 + ], + "angle": 0, + "content": "We choose distance measures, \\(d_{\\mathcal{A}}(\\mathcal{F}, \\mathcal{A}(\\mathbf{x}, t)) = ||\\mathcal{F} - \\mathcal{A}(\\mathbf{x}, t)||_2\\), \\(\\forall \\mathcal{F}\\), such that the appearance metric distance rewards pixel-wise closeness. Similarly," + }, + { + "type": "equation", + "bbox": [ + 0.346, + 0.499, + 0.786, + 0.516 + ], + "angle": 0, + "content": "\\[\nd _ {\\mathcal {B}} (\\mathcal {F}, \\mathcal {B} (\\mathbf {x}, t)) = | H (\\mathcal {F}) - H (\\mathcal {B} (\\mathbf {x}, t)) |, \\forall \\mathcal {F}, \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.524, + 0.788, + 0.587 + ], + "angle": 0, + "content": "where \\( H(\\cdot) \\) is a heart rate estimator function. By finding functions that satisfy the constraints in Equation 3, we can achieve \\( \\mathcal{A} - \\mathcal{B} \\) decomposition by sequentially learning \\( \\hat{\\mathcal{A}} (\\mathbf{x},t;\\boldsymbol {\\Theta}_{\\mathcal{A}}) \\) and \\( \\hat{\\mathcal{B}} (\\mathbf{x},t;\\boldsymbol {\\Theta}_{\\mathcal{B}}) \\). A detailed mathematical analysis of this formulation is deferred to the supplement." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.606, + 0.579, + 0.623 + ], + "angle": 0, + "content": "4.2 Identifying Implicit \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) Decomposers" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.735 + ], + "angle": 0, + "content": "Prior work on video magnification through Laplacian [55] and phase-based [50] pyramids is instructive. While the Laplacian pyramid-based approach [55] can magnify blood flow due to color changes, the phase-based method [50] cannot magnify blood flow. With this intuition, we use the metrics defined in the previous section to identify approximations for \\(\\mathcal{A}\\) & \\(\\mathcal{B}\\). We first look at phase-modulated INRs for motion modeling [25]. The key inductive bias here is parameterizing time as phase modulation in positional encodings [30,46]." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.735, + 0.788, + 0.781 + ], + "angle": 0, + "content": "Empirical Claim 1 (based on observations): Phase-based implicit models (models with phase-encoded input embeddings) cannot represent plethysmograph signals accurately, in terms of the metric in Equation 4. (Figure 3(b))" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.781, + 0.788, + 0.81 + ], + "angle": 0, + "content": "While this can be viewed as a limitation of phase-based INRs, we use it to our advantage: phase-based models can be \\(\\mathcal{A}\\)-function estimators (Equation 3)." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.81, + 0.788, + 0.842 + ], + "angle": 0, + "content": "We next look at sinusoid representation networks (SRNs), such as [20,40,44]. Empirical Claim 2: SRNs are good \\(\\mathcal{A}\\), \\(\\mathcal{B}\\)-function approximators. (Figure 3(a))" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.128 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.145, + 0.788, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.236, + 0.788, + 0.306 + ], + "angle": 0, + "content": "Fig. 4: To enable fast \\(\\mathcal{A} - \\mathcal{B}\\) decomposition, we use implicit neural representations as decomposing function fitters. Training is done sequentially: first, the cascaded appearance model learns the \\(\\mathcal{A}\\)-function. Then, the appearance model is frozen, and the residual model learns the \\(\\mathcal{B}\\)-function, thereby completing the decomposition. The use of multiresolution hash encodings makes dataset-scale decomposition viable." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.334, + 0.788, + 0.396 + ], + "angle": 0, + "content": "However, being able to represent both \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\) makes SRNs incapable of \\(\\mathcal{A} - \\mathcal{B}\\) decomposition. This pair exactly satisfy the constraints in Equation 3. Hence, Empirical Claim 3: A phase-based model can serve as \\(\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}}^{*})\\), while an SRN can serve as \\(\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}}^{*})\\), when trained sequentially." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.397, + 0.788, + 0.473 + ], + "angle": 0, + "content": "Justifications for all claims may be found in the supplement. However, naive use of prior work [25, 44] for \\(\\mathcal{A} - \\mathcal{B}\\) decomposition poses a training time problem. Using variants of [25] and [44] as \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\)-function estimators, respectively, we noted a training time of 20 minutes for a 2-second long video with a resolution of \\(128 \\times 128\\). Such compute times are infeasible for dataset-scale experiments." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.494, + 0.64, + 0.511 + ], + "angle": 0, + "content": "5 Hash Encodings for \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) Decomposition" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.787, + 0.569 + ], + "angle": 0, + "content": "In this section, we propose high-speed INR-based \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposition. Specifically, to address the slower speeds of traditional INRs, we pivot to a faster framework and show design INRs for \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposition within this framework." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.57, + 0.788, + 0.676 + ], + "angle": 0, + "content": "Inspired by recent work in instant neural graphics primitives [32], we propose using a multiresolution hash input encoding (MRHE)-based framework for \\(\\mathcal{A}\\) \\(\\mathcal{B}\\) decomposition. A critical aspect is using the spatial hash function for video fields. Spatial hash functions [34, 47] are typically 2-D and 3-D extensions to the prevalent hash tables. We use this principle to model the spatio-temporal coordinates \\((x,y,t)\\) as a 3-D space. We posit that the 3-D spatial hash function can effectively model this space without violating any temporal constraints." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.695, + 0.598, + 0.712 + ], + "angle": 0, + "content": "5.1 Cascaded Appearance Model \\(\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})\\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.84 + ], + "angle": 0, + "content": "As discussed in Section 4.2, phase-based INRs [25], are efficient \\(\\mathcal{A}\\)-function representatives. However, a direct translation of this concept to MRHEs is intractable, i.e., replacing the sinusoidal positional encodings with the faster MRHE makes phase incorporation infeasible. For sinusoidal encodings, phase modulations are akin to offsets. Thus, we propose to incorporate the time-to-phase conversion through learned spatiotemporal offset. The appearance model has two stages: the first maps spatio-temporal coordinates to positional offsets in the MRHE. The second is queried using the offset positions to generate video frames." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.344, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.784, + 0.233 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.243, + 0.788, + 0.327 + ], + "angle": 0, + "content": "Fig. 5: Using the estimated \\(\\mathcal{B}\\)-function with the original video, we learn high-fidelity neural signal strength masks. The network takes the original RGB frames and the \\(\\mathcal{B}\\)-function estimate as inputs and returns a spatial strength mask. Training is supervised through an auxiliary 1-D CNN whose training target is the prediction of an accurate plethysmograph. The 1-D CNN is discarded post-training, and the learned mask model is used at inference time on the \\(\\mathcal{B}\\)-function to estimate rPPG." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.357, + 0.788, + 0.48 + ], + "angle": 0, + "content": "Rather than considering a single offset vector in \\(\\mathbb{R}^2\\) for the entire frame (as [25] do for phase estimation), we estimate the offset, \\(\\varDelta\\mathbf{x}\\in\\mathbb{R}^{2}\\), for each point in the spatio-temporal grid. That is, \\(\\varDelta\\mathbf{x}=f_{\\mathcal{A}_1}(\\mathbf{x},t)\\). The estimated offsets are added to the original spatial coordinates, which are then used to query a second model \\(f_{\\mathcal{A}_2}(\\mathbf{x}+\\varDelta\\mathbf{x})\\). Translating Empirical Claim 1 from phase-based to offset-based models, we summarize our offset-adjustable cascaded appearance model as \\(\\hat{\\mathcal{A}}(\\mathbf{x},t;\\Theta_{\\mathcal{A}})=f_{\\mathcal{A}_2}(\\mathbf{x}+f_{\\mathcal{A}_1}(\\mathbf{x},t))\\). The architecture and loss functions are elaborated on in the supplement. Figure 4 details this pipeline." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.501, + 0.624, + 0.518 + ], + "angle": 0, + "content": "5.2 Residual Plethysmograph Model \\(\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}})\\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.527, + 0.788, + 0.618 + ], + "angle": 0, + "content": "We use a shallow sinusoidal model with MRHE, \\( f_{\\mathcal{B}}(\\cdot ,\\cdot) \\), as our \\( \\mathcal{B} \\)-function estimator. In line with Empirical Claim 3, we train the residual plethysmograph network sequentially after the cascaded appearance model. While training, we freeze the cascaded appearance model and train the residual plethysmography network on the difference between the original video input and the output of the estimated appearance field. That is, \\( \\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}}) = f_{\\mathcal{B}}(\\mathbf{x},t) \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.619, + 0.788, + 0.679 + ], + "angle": 0, + "content": "The resulting residual plethysmograph model is shown to compensate for the cascaded appearance model's inability to retain the plethysmograph signal. When queried, the model yields a spatio-temporal estimate of the plethysmograph signal. The supplement contains relevant implementation details." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.702, + 0.424, + 0.718 + ], + "angle": 0, + "content": "6 rPPG Estimation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.795 + ], + "angle": 0, + "content": "The previous section enables us to learn an estimator for \\(\\mathcal{B}(\\mathbf{x},t)\\), which is one part of the SINR optimality (and hence uncertainty minimization) from Equation 2. In this section, we proceed towards rPPG estimation from the \\(\\mathcal{B}\\)-function using high-fidelity neural signal masks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Figure 5 highlights our proposed pipeline. Built on a 3-D CNN backbone, we indirectly supervise the spatial-attention-based network architecture with PPG waveforms. The model accepts the RGB input field concatenated with \\(\\hat{B}(\\mathbf{x}, t)\\) (a" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.127 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.144, + 0.784, + 0.229 + ], + "angle": 0, + "content": "combined 6-channel input) to estimate a mask. Here, \\(\\mathcal{I}(\\mathbf{x},t) = \\left[\\mathcal{C}(\\mathbf{x},t),\\hat{\\mathcal{B}} (\\mathbf{x},t)\\right]\\) where \\(\\mathcal{I}(\\mathbf{x},t)\\) is the input to our SINR mask estimator. Limited by compute requirements, we relax the temporal component and only consider the first 64 frames (of the 300 frames) to compute a single mask for 10 seconds. End-to-end the network can be summarized as \\(SINR_{\\mathcal{B}}(\\mathbf{x}) = f_{SINR}\\left(\\mathcal{I}(\\mathbf{x},t);\\Theta_{SINR}\\right)\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.23, + 0.785, + 0.313 + ], + "angle": 0, + "content": "It must be noted that while we only estimate a single mask for a 10-second video, our experiments show that our method is competitive even in the presence of natural motions like talking and head swaying (supplement). The SINR mask \\( S\\hat{N} R_{\\mathcal{B}}(\\mathbf{x}) \\) is directly used to compute \\( \\mathbf{y}_1(t) = \\frac{\\sum_{\\mathbf{x}}S\\hat{N}R_{\\mathcal{B}}(\\mathbf{x})\\cdot I(\\mathbf{x},t)}{\\sum_{\\mathbf{x}}S\\hat{N}R_{\\mathcal{B}}(\\mathbf{x})} \\), where \\( \\mathbf{y}_1(t) \\) is a time-series obtained from the 6-channel weighted spatial average of the input." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.785, + 0.449 + ], + "angle": 0, + "content": "The 6-channel time-series signal is then passed through a 1-D CNN to yield a refined temporal estimate of the plethysmograph signal, \\(\\hat{\\mathbf{p}}(t)\\). Note that this network is not used to generate the final estimates but to supervise the neural signal strength mask model indirectly. The whole pipeline is supervised end-to-end with the ground truth plethysmograph signals. Implementation details and further mathematical formulation are provided in the supplement. As a result of the architecture being based on the optimality constraint in Equation 2, the inferred masks are expected to be near SINR-optimal. This also means near optimality in terms of uncertainty minimization." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.45, + 0.785, + 0.541 + ], + "angle": 0, + "content": "As in prior learning approaches, the neural regressor overfits the waveform, making it sub-optimal for OOD. Hence, we only retain \\( f_{SINR}(\\cdot) \\). The neural signal masks are combined with \\( \\hat{B} \\) to estimate the rPPG signal. We follow [48] and utilize only the green channel. Advanced algorithms [11,51] exist that utilize other channels, but they rely on the \\( A \\)-function [11,51]. We perform detrending and Butterworth filtering for heart rate estimation as in [51]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.56, + 0.325, + 0.575 + ], + "angle": 0, + "content": "7 Results" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.588, + 0.427, + 0.604 + ], + "angle": 0, + "content": "7.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.61, + 0.784, + 0.716 + ], + "angle": 0, + "content": "Datasets All methods are trained on two prior datasets [49, 53]. We also test our method on a self-collected Institutional Review Board (IRB) approved optically challenging OOD dataset. While we mainly focus on our dataset for OOD analysis, we also present results of cross-dataset inference. In our OOD dataset, we share full participant videos (without identifying information such as names), but only after recording contact details of dataset users. The dataset is released after potential users fill out a request form. Further details are in the supplement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.8, + 0.84 + ], + "angle": 0, + "content": "Evaluation Metrics We adopt the heart rate (HR) performance metrics from [49]. These include Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), Root Mean Squared Error (RMSE), Pearson correlation coefficient (r) and the Threshold test (T-Test) [2,31,33]. Since our goal is OOD generalization, we propose \"r-consistency\" as the similarity metric between the Pearson coefficients of the in-distribution (ID) and OOD samples, calculated as a harmonic mean. A detailed discussion of this metric is present in the supplement." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.344, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Performance on our OOD dataset considerably favors our method over prior work. We measure inter-distribution parity via the r-consistency metric. In-distribution values for r are given in Table 2. For algorithmic methods (non-learning), r-consistency on the datasets from [53] and [49] are shown in parenthesis. The best and second-best-performing numbers are highlighted in green and yellow, respectively." + }, + { + "type": "table", + "bbox": [ + 0.246, + 0.227, + 0.758, + 0.438 + ], + "angle": 0, + "content": "
MethodOOD Performance MetricsInter-Distribution Parity Metric
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑r-consistency ↑
Green [48]31.547.809.84%14.560.47(0.54, 0.52)
POS [51]31.928.0211.06%14.870.47(0.60, 0.62)
CHROM [11]36.739.3212.62%15.850.40(0.53, 0.55)
ICA [41]31.158.1710.50%15.320.41(0.5, 0.51)
Train on [53]DeepPhys [8]78.2718.6423.19%23.230.07
TS-CAN [21]77.1218.4623.24%23.310.00
EfficientPhys [22]32.1212.2316.78%23.400.31
PhysNet [57]33.658.6411.09%16.140.35
PhysFormer [58]48.4610.4113.26%15.540.24
Ours18.085.106.81%12.020.620.73
Train on [49]DeepPhys [8]77.8817.9422.44%22.490.07
TS-CAN [21]75.5817.6522.02%22.020.01
EfficientPhys [22]44.2313.8518.28%22.840.19
PhysNet [57]48.4611.2414.27%17.470.32
PhysFormer [58]39.819.5812.59%15.140.32
Ours16.154.616.07%11.650.650.78
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.464, + 0.788, + 0.569 + ], + "angle": 0, + "content": "Evaluation Configuration We gauge performance of all methods via HR estimations from the power-spectral density. These estimations are carried over 300-sample windows (10 seconds), with a stride of 128 samples. Following [49], we validate4 the learning-based methods by performing six-fold cross-validation while averaging across the entire dataset for algorithmic methods. Similarly, we construct three folds for [53] to evaluate the learning methods. Please refer to the supplement for details, including visualization of signal strength masks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.57, + 0.788, + 0.616 + ], + "angle": 0, + "content": "Figures 6 and 7 show the results of our algorithm against the baseline methods. For ease of interpretability, we correct for random phase lag between the face (site of signal measurement) and finger (site of ground truth measurement)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.636, + 0.573, + 0.652 + ], + "angle": 0, + "content": "7.2 Out of Distribution Plethysmography" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.721 + ], + "angle": 0, + "content": "We use our self-collected optically challenging dataset to benchmark OOD performance. While we primarily employ this dataset, we acknowledge that this is not the only notion of OOD. Hence, we also perform cross-dataset inference as part of the evaluation protocol to measure generalization capacity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.741, + 0.795, + 0.786 + ], + "angle": 0, + "content": "Optically Challenging OOD Evaluation Table 1 presents a quantitative analysis of OOD performance. Learning-based methods are trained on the datasets from [53] and [49], and the best fold is chosen for OOD inference." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.787, + 0.788, + 0.819 + ], + "angle": 0, + "content": "Given their capacity to memorize distinguishable patterns, learning methods [57,58] handle input noise better than algorithmic methods for in-distribution" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.692, + 0.841 + ], + "angle": 0, + "content": "4 Baselines are configured, where possible, using the toolbox from [23]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.229 + ], + "angle": 0, + "content": "Table 2: In-distribution and Cross-dataset OOD performance across two datasets - [49] and [53] shows comparable or superior performance compared to prior methods. Across in-distribution and cross-dataset validation, our method is the most consistent compared to SOTA methods. The best-performing and second-best-performing numbers are shown in green and yellow, respectively. There are 4 quadrants: \\(1^{st}\\) - top left, \\(2^{nd}\\) - top right, \\(3^{rd}\\) - bottom right and \\(4^{th}\\) - bottom left." + }, + { + "type": "table", + "bbox": [ + 0.245, + 0.24, + 0.756, + 0.465 + ], + "angle": 0, + "content": "
MethodTest on [53]Test on [49]
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑
Green [48]12.193.714.75%10.270.64
POS [51]6.192.032.84%6.750.84
CHROM [11]9.662.743.81%7.920.78
ICA [41]9.742.943.83%9.150.71
Train on [53]
DeepPhys [8]72.7016.3321.32%20.430.0276.2618.2122.79%22.340.02
TS-CAN [21]74.5016.6921.87%20.690.0177.1718.2823.17%22.380.03
EfficientPhys [22]2.261.021.59%5.510.884.471.672.27%5.900.89
PhysNet [57]2.760.941.37%4.690.923.581.191.59%3.750.96
PhysFormer [58]4.331.281.72%5.030.9025.086.508.58%12.280.54
Ours3.221.211.78%5.610.884.391.662.17%4.690.94
Green [48]19.586.277.53%14.270.57
POS [51]6.002.132.78%6.540.89
CHROM [11]8.072.383.07%6.720.89
ICA [41]17.155.136.00%12.210.66
Train on [49]
DeepPhys [8]73.8516.6021.66%20.550.0077.4318.4623.26%22.460.01
TS-CAN [21]75.3017.0322.35%20.960.0377.3618.6123.49%22.760.00
EfficientPhys [22]11.454.446.43%13.460.5321.586.508.53%14.080.53
PhysNet [57]66.4414.0419.72%17.810.064.721.481.87%4.480.93
PhysFormer [58]22.745.277.34%9.930.622.961.061.37%3.350.96
Ours3.161.161.69%5.330.893.341.221.61%4.010.96
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.494, + 0.787, + 0.569 + ], + "angle": 0, + "content": "inference. However, this also leads to poorer generalizability on our OOD dataset, as emphasized by both the Pearson coefficient (r) and the \"r-consistency\" metrics. In contrast, algorithmic methods rely on deterministic heuristics. While this promotes good generalizability, it makes them extremely sensitive to factors such as lighting, occlusion, etc., leading to generally poorer performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.571, + 0.788, + 0.692 + ], + "angle": 0, + "content": "Our proposed method maximizes signal strength while avoiding overfitting to the training distribution. We are, therefore, Pareto-optimal in both OOD performance and inter-distribution parity (Figure 2) regarding the T-Test value and \"r-consistency\" score. Our method is both the best and second-best performing method, outperforming Green (the best baseline) with \\(48.8\\%\\) and \\(40.9\\%\\) reduction in T-Test and MAE values. Clinically, this implies an almost \\(2x\\) reduction in the number of participants on whom the method fails following the AAMI standard. Further granular analysis can be found in the supplement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Cross-Dataset OOD and In-Distribution Evaluation Another notion of OOD is a cross-dataset generalization. Domain shifts between datasets result from differences in hardware and acquisition conditions. Learning-based methods tend to overfit the training data. Our experiments use datasets from [53] and [49] for their size and diversity. Table 2 indicates that while deep learning methods perform well in-distribution (\\(1^{\\text{st}}\\) and \\(3^{\\text{rd}}\\) quadrant), they cannot maintain the same level of performance for cross-dataset inference (\\(2^{\\text{nd}}\\) and \\(4^{\\text{th}}\\) quadrant). Algorithmic methods have no notion of cross-dataset evaluation. When trained" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.345, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.273, + 0.148, + 0.358, + 0.216 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.361, + 0.147, + 0.448, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.451, + 0.147, + 0.539, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.544, + 0.147, + 0.631, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.634, + 0.148, + 0.728, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.274, + 0.224, + 0.357, + 0.291 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.36, + 0.223, + 0.447, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.452, + 0.223, + 0.541, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.546, + 0.224, + 0.634, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.637, + 0.224, + 0.726, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.274, + 0.301, + 0.357, + 0.365 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.282, + 0.373, + 0.338, + 0.387 + ], + "angle": 0, + "content": "(a) VID." + }, + { + "type": "image", + "bbox": [ + 0.361, + 0.299, + 0.447, + 0.368 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.365, + 0.374, + 0.422, + 0.388 + ], + "angle": 0, + "content": "(b) [48]" + }, + { + "type": "image", + "bbox": [ + 0.452, + 0.299, + 0.54, + 0.368 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.462, + 0.374, + 0.518, + 0.387 + ], + "angle": 0, + "content": "(c) [58]" + }, + { + "type": "image", + "bbox": [ + 0.547, + 0.299, + 0.634, + 0.368 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.557, + 0.374, + 0.619, + 0.386 + ], + "angle": 0, + "content": "(d) OURS" + }, + { + "type": "image", + "bbox": [ + 0.637, + 0.299, + 0.726, + 0.368 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.659, + 0.374, + 0.706, + 0.386 + ], + "angle": 0, + "content": "(e) GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.399, + 0.785, + 0.456 + ], + "angle": 0, + "content": "Fig.6: Across challenging OOD optical settings, the proposed method can capture details of the plethysmograph waveform compared to prior methods. Results shown use models trained on the dataset proposed in [49], where applicable. Additional results are presented in the supplement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.482, + 0.785, + 0.511 + ], + "angle": 0, + "content": "on [49] and tested on [53] (\\(4^{th}\\) quadrant), we outperform all prior work. In the reverse scenario (2nd quadrant), we are the second-best, marginally behind [57]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.513, + 0.785, + 0.618 + ], + "angle": 0, + "content": "Despite OOD being our central focus, our model offers results comparable to SOTA algorithms even for in-distribution evaluation. Our method is within 0.3 bpm MAE compared to all top baselines (a difference that is not clinically significant). Additionally, our method shows a sub 0.5 bpm standard deviation of MAE across various folds used for evaluation in all configurations. Overall, our method is the most consistent across all quadrants while yielding errors within 2 bpm MAE, which most likely would be clinically accurate." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.637, + 0.458, + 0.652 + ], + "angle": 0, + "content": "7.3 Qualitative Comparison" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.785, + 0.764 + ], + "angle": 0, + "content": "In Figure 6, we assess the qualitative waveforms generated on our optically challenging OOD dataset. We compare our method against the best-performing algorithmic and deep learning methods from Table 1, i.e., Green [48] and PhysFormer [58] respectively. For the representative samples, our method is superior in performance and can retain the shape of the plethysmography signal. The second scene, with the mask and glasses, especially highlights these gains. We also show superior rPPG estimation for extreme scenes (window reflections)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.785, + 0.839 + ], + "angle": 0, + "content": "In Figure 7, we assess qualitative waveforms from in-distribution inference samples from [49]. We compare our method with PhysFormer [58] and POS [51] as the best-performing in-distribution deep learning and algorithmic methods. Our method retains both the frequency information and salient features of the waveform across diverse skin tones in the dataset." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.127 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "image", + "bbox": [ + 0.274, + 0.152, + 0.357, + 0.219 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.358, + 0.151, + 0.446, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.451, + 0.151, + 0.54, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.542, + 0.151, + 0.635, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.636, + 0.152, + 0.725, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.274, + 0.232, + 0.357, + 0.296 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.282, + 0.305, + 0.338, + 0.319 + ], + "angle": 0, + "content": "(a) VID." + }, + { + "type": "image", + "bbox": [ + 0.358, + 0.23, + 0.446, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.365, + 0.306, + 0.422, + 0.32 + ], + "angle": 0, + "content": "(b) [51]" + }, + { + "type": "image", + "bbox": [ + 0.451, + 0.23, + 0.54, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.462, + 0.306, + 0.518, + 0.32 + ], + "angle": 0, + "content": "(c) [58]" + }, + { + "type": "image", + "bbox": [ + 0.542, + 0.23, + 0.634, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.556, + 0.306, + 0.62, + 0.319 + ], + "angle": 0, + "content": "(d) Ours" + }, + { + "type": "image", + "bbox": [ + 0.636, + 0.23, + 0.724, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.658, + 0.305, + 0.707, + 0.318 + ], + "angle": 0, + "content": "(e) GT" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.331, + 0.785, + 0.388 + ], + "angle": 0, + "content": "Fig. 7: In distribution inference on a diverse dataset. Our method better captures rPPG waveform details across skin tones for in-distribution evaluation on [49] dataset. While our method and [58] both perform reasonably well across skin tones, [58] does so with poorer OOD performance (Figure 6). More results in the supplement." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.412, + 0.355, + 0.428 + ], + "angle": 0, + "content": "8 Discussion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.44, + 0.785, + 0.516 + ], + "angle": 0, + "content": "We propose an INR for camera-based rPPG. We introduce the concept of \\(\\mathcal{A}\\)-\\(\\mathcal{B}\\) decomposition and propose an INR architecture to achieve this at scale. The proposed model is evaluated on a dataset of optically challenging OOD participants in addition to existing datasets. Our model performs best on the OOD dataset while comparable to SOTA for in-distribution validation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.535, + 0.356, + 0.549 + ], + "angle": 0, + "content": "8.1 Limitations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.557, + 0.785, + 0.633 + ], + "angle": 0, + "content": "Being the first method using INRs for rPPG, limitations exist. First, while we reduce runtime over traditional INRs (as discussed in the supplement), and some rPPG methods report comparable runtimes [26], this is an avenue for future improvement. Second, while the proposed method is competitive for challenging scenes like talking and motion (supplement), these problems remain open." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.652, + 0.627, + 0.667 + ], + "angle": 0, + "content": "8.2 Societal Impacts and Ethical Considerations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.785, + 0.78 + ], + "angle": 0, + "content": "We focus on rPPG in optically challenging scenes (Section 1.1) due to factors like lighting, facial occlusions (masks, glasses, medical equipment), etc. Robustness to such settings enables applicability in settings like hospital rooms, classrooms, driving, etc. Additionally, prior work [1, 37] has shown promise in using rPPG for tasks like biometrics and forensics, and OOD-robustness will bring these applications one step closer to real-world deployment. Finally, these methods can also potentially be applied to other modalities and vital signs [10, 12, 60]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Technological solutions enabling healthcare for all, like this work, are relevant for social good. However, technology with clinical impact should only be deployed once the method is provably robust. Our method takes a step in that direction, but a pipeline of similar papers is needed to enable real-world rPPG deployment." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.344, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.254 + ], + "angle": 0, + "content": "We thank the Visual Machines Group (VMG) at UCLA for feedback and support. A.K. was supported by a National Science Foundation (NSF) CAREER award, IIS-2046737, Army Young Investigator Program Award, Defense Advanced Research Projects Agency (DARPA) Young Faculty Award, and a Cisco Research Award. P.C. was partially supported by a Cisco Research Award." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.279, + 0.323, + 0.294 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.311, + 0.787, + 0.354 + ], + "angle": 0, + "content": "1. Al Masri, A., Jasra, S.K.: The forensic biometric analysis of emotions from facial expressions, and physiological processes from the heart and skin. Journal of Emerging Forensic Sciences Research 1(1), 61-77 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.355, + 0.786, + 0.367 + ], + "angle": 0, + "content": "2. Association, C.T.: Physical activity monitoring for heart rate, ansi/cta-2065 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.368, + 0.786, + 0.409 + ], + "angle": 0, + "content": "3. Ba, Y., Wang, Z., Karinca, K.D., Bozkurt, O.D., Kadambi, A.: Overcoming difficulty in obtaining dark-skinned subjects for remote-ppg by synthetic augmentation. arXiv preprint arXiv:2106.06007 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.41, + 0.786, + 0.45 + ], + "angle": 0, + "content": "4. Balakrishnan, G., Durand, F., Guttag, J.: Detecting pulse from head motions in video. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 3430-3437 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.451, + 0.786, + 0.492 + ], + "angle": 0, + "content": "5. Chari, P., Ba, Y., Athreya, S., Kadambi, A.: Mime: Minority inclusion for majority group enhancement of ai performance. In: European conference on computer vision. pp. 326-343. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.493, + 0.786, + 0.547 + ], + "angle": 0, + "content": "6. Chari, P., Kabra, K., Karinca, D., Lahiri, S., Srivastava, D., Kulkarni, K., Chen, T., Cannesson, M., Jalilian, L., Kadambi, A.: Diverse r-ppg: Camera-based heart rate estimation for diverse subject skin-tones and scenes. arXiv preprint arXiv:2010.12769 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.548, + 0.786, + 0.589 + ], + "angle": 0, + "content": "7. Chen, H., He, B., Wang, H., Ren, Y., Lim, S.N., Shrivastava, A.: Nerv: Neural representations for videos. Advances in Neural Information Processing Systems 34, 21557-21568 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.59, + 0.786, + 0.631 + ], + "angle": 0, + "content": "8. Chen, W., McDuff, D.: Deepphys: Video-based physiological measurement using convolutional attention networks. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 349-365 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.632, + 0.786, + 0.687 + ], + "angle": 0, + "content": "9. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.688, + 0.786, + 0.729 + ], + "angle": 0, + "content": "0. Chen, Z., Zheng, T., Cai, C., Luo, J.: Movi-fi: Motion-robust vital signs waveform recovery via deep interpreted rf sensing. In: Proceedings of the 27th annual international conference on mobile computing and networking. pp. 392–405 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.786, + 0.757 + ], + "angle": 0, + "content": "1. De Haan, G., Jeanne, V.: Robust pulse rate from chrominance-based rppg. IEEE Transactions on Biomedical Engineering 60(10), 2878-2886 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.786, + 0.799 + ], + "angle": 0, + "content": "2. Del Regno, K., Vilesov, A., Armouti, A., Harish, A.B., Can, S.E., Kita, A., Kadambi, A.: Thermal imaging and radar for remote sleep monitoring of breathing and apnea. arXiv preprint arXiv:2407.11936 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.786, + 0.84 + ], + "angle": 0, + "content": "3. Gao, C., Saraf, A., Kopf, J., Huang, J.B.: Dynamic view synthesis from dynamic monocular video. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5712-5721 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.311, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.128 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "14. Hurter, C., McDuff, D.: Cardiolens: remote physiological monitoring in a mixed reality environment. In: ACM siggraph 2017 emerging technologies, pp. 1-2 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.178, + 0.785, + 0.218 + ], + "angle": 0, + "content": "15. Jiang, C., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T., et al.: Local implicit grid representations for 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6001-6010 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.22, + 0.785, + 0.246 + ], + "angle": 0, + "content": "16. Kadambi, A.: Achieving fairness in medical devices. Science 372(6537), 30-31 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.249, + 0.785, + 0.289 + ], + "angle": 0, + "content": "17. Lee, E., Chen, E., Lee, C.Y.: Meta-rppg: Remote heart rate estimation using a transductive meta-learner. In: European Conference on Computer Vision. pp. 392–409. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.291, + 0.785, + 0.318 + ], + "angle": 0, + "content": "18. Li, R., Tancik, M., Kanazawa, A.: Nerfacc: A general nef acceleration toolbox. arXiv preprint arXiv:2210.04847 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.32, + 0.785, + 0.36 + ], + "angle": 0, + "content": "19. Li, Z., Niklaus, S., Snavely, N., Wang, O.: Neural scene flow fields for space-time view synthesis of dynamic scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6498-6508 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.362, + 0.785, + 0.416 + ], + "angle": 0, + "content": "20. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16252-16262 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.418, + 0.785, + 0.459 + ], + "angle": 0, + "content": "21. Liu, X., Fromm, J., Patel, S., McDuff, D.: Multi-task temporal shift attention networks for on-device contactless vitals measurement. Advances in Neural Information Processing Systems 33, 19400-19411 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.461, + 0.785, + 0.515 + ], + "angle": 0, + "content": "22. Liu, X., Hill, B., Jiang, Z., Patel, S., McDuff, D.: Efficientphys: Enabling simple, fast and accurate camera-based cardiac measurement. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 5008-5017 (January 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.517, + 0.785, + 0.544 + ], + "angle": 0, + "content": "23. Liu, X., Zhang, X., Narayanswamy, G., Zhang, Y., Wang, Y., Patel, S., McDuff, D.: Deep physiological sensing toolbox. arXiv preprint arXiv:2210.00716 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.546, + 0.785, + 0.601 + ], + "angle": 0, + "content": "24. Magdalena Nowara, E., Marks, T.K., Mansour, H., Veeraraghavan, A.: Sparseppg: Towards driver monitoring using camera-based vital signs estimation in near-infrared. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 1272-1281 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.602, + 0.785, + 0.642 + ], + "angle": 0, + "content": "25. Mai, L., Liu, F.: Motion-adjustable neural implicit video representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10738-10747 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.644, + 0.785, + 0.685 + ], + "angle": 0, + "content": "26. Maity, A.K., Wang, J., Sabharwal, A., Nayar, S.K.: Robustppg: camera-based robust heart rate estimation using motion cancellation. Biomedical Optics Express 13(10), 5447-5467 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.687, + 0.785, + 0.728 + ], + "angle": 0, + "content": "27. Martel, J.N., Lindell, D.B., Lin, C.Z., Chan, E.R., Monteiro, M., Wetzstein, G.: Acorn: Adaptive coordinate networks for neural scene representation. arXiv preprint arXiv:2105.02788 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.729, + 0.785, + 0.784 + ], + "angle": 0, + "content": "28. Mehta, I., Gharbi, M., Barnes, C., Shechtman, E., Ramamoorthi, R., Chandraker, M.: Modulated periodic activations for generalizable local functional representations. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14214-14223 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.786, + 0.785, + 0.84 + ], + "angle": 0, + "content": "29. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.345, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Implicit Neural Models to Extract Heart Rate from Video" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "30. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.191, + 0.785, + 0.205 + ], + "angle": 0, + "content": "31. Monitors, C.: Heart rate meters, and alarms. ANSI/AAMI Standard EC13 (2002)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.206, + 0.785, + 0.26 + ], + "angle": 0, + "content": "32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Trans. Graph. 41(4), 102:1-102:15 (Jul 2022). https://doi.org/10.1145/3528223.3530127, https://doi.org/10.1145/3528223.3530127" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.262, + 0.785, + 0.303 + ], + "angle": 0, + "content": "33. Nelson, B.W., Allen, N.B.: Accuracy of consumer wearable heart rate measurement during an ecologically valid 24-hour period: intraindividual validation study. JMIR mHealth and uHealth 7(3), e10828 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.305, + 0.785, + 0.346 + ], + "angle": 0, + "content": "34. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.347, + 0.785, + 0.388 + ], + "angle": 0, + "content": "35. Niu, X., Shan, S., Han, H., Chen, X.: Rhythmnet: End-to-end heart rate estimation from face via spatial-temporal representation. IEEE Transactions on Image Processing 29, 2409-2423 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.39, + 0.785, + 0.445 + ], + "angle": 0, + "content": "36. Nowara, E.M., McDuff, D., Veeraraghavan, A.: A meta-analysis of the impact of skin tone and gender on non-contact photoplethysmography measurements. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 284-285 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.446, + 0.785, + 0.5 + ], + "angle": 0, + "content": "37. Nowara, E.M., Sabharwal, A., Veeraraghavan, A.: Ppgsecure: Biometric presentation attack detection using photopletysmograms. In: 2017 12th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2017). pp. 56-62. IEEE (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.785, + 0.529 + ], + "angle": 0, + "content": "38. Owhadi, H., Scovel, C., Sullivan, T.J., McKerns, M., Ortiz, M.: Optimal uncertainty quantification. Siam Review 55(2), 271-345 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.531, + 0.785, + 0.585 + ], + "angle": 0, + "content": "39. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.587, + 0.785, + 0.628 + ], + "angle": 0, + "content": "40. Peters, H., Ba, Y., Kadambi, A.: pcon: Polarimetric coordinate networks for neural scene representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.63, + 0.785, + 0.67 + ], + "angle": 0, + "content": "41. Poh, M.Z., McDuff, D.J., Picard, R.W.: Non-contact, automated cardiac pulse measurements using video imaging and blind source separation. Optics express 18(10), 10762-10774 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.672, + 0.785, + 0.713 + ], + "angle": 0, + "content": "42. Ramaswamy, V.V., Kim, S.S., Russakovsky, O.: Fair attribute classification through latent space de-biasing. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9301-9310 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.715, + 0.785, + 0.755 + ], + "angle": 0, + "content": "43. Schulz, P., Scheuvens, L., Fettweis, G.: A new perspective on maximal-ratio combining. In: 2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). pp. 1-7. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.785, + 0.798 + ], + "angle": 0, + "content": "44. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in Neural Information Processing Systems 33, 7462-7473 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "45. Song, R., Chen, H., Cheng, J., Li, C., Liu, Y., Chen, X.: Pulsegan: Learning to generate realistic pulse waveforms in remote photoplethysmography. IEEE Journal of Biomedical and Health Informatics 25(5), 1373-1384 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.127 + ], + "angle": 0, + "content": "P. Chari et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "46. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.203, + 0.787, + 0.245 + ], + "angle": 0, + "content": "47. Teschner, M., Heidelberger, B., Müller, M., Pomerantes, D., Gross, M.H.: Optimized spatial hashing for collision detection of deformable objects. In: Vmv. vol. 3, pp. 47-54 (2003)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.245, + 0.787, + 0.271 + ], + "angle": 0, + "content": "48. Verkruysse, W., Svaasand, L.O., Nelson, J.S.: Remote plethysmographic imaging using ambient light. Optics express 16(26), 21434-21445 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.271, + 0.787, + 0.312 + ], + "angle": 0, + "content": "49. Vilesov, A., Chari, P., Armouti, A., Harish, A.B., Kulkarni, K., Deoghare, A., Jalilian, L., Kadambi, A.: Blending camera and 77 ghz radar sensing for equitable, robust plethysmography. ACM Transactions on Graphics (TOG) 41(4), 1-14 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.312, + 0.787, + 0.339 + ], + "angle": 0, + "content": "50. Wadhwa, N., Rubinstein, M., Durand, F., Freeman, W.T.: Phase-based video motion processing. ACM Transactions on Graphics (TOG) 32(4), 1-10 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.339, + 0.787, + 0.38 + ], + "angle": 0, + "content": "51. Wang, W., Den Brinker, A.C., Stuijk, S., De Haan, G.: Algorithmic principles of remote ppg. IEEE Transactions on Biomedical Engineering 64(7), 1479-1491 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.38, + 0.787, + 0.435 + ], + "angle": 0, + "content": "52. Wang, Z., Qinami, K., Karakozis, I.C., Genova, K., Nair, P., Hata, K., Russakovsky, O.: Towards fairness in visual recognition: Effective strategies for bias mitigation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8919-8928 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.435, + 0.787, + 0.489 + ], + "angle": 0, + "content": "53. Wang, Z., Ba, Y., Chari, P., Bozkurt, O.D., Brown, G., Patwa, P., Vaddi, N., Jalilian, L., Kadambi, A.: Synthetic generation of face videos with plethysmograph physiology. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20587-20596 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.489, + 0.787, + 0.53 + ], + "angle": 0, + "content": "54. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. arXiv preprint arXiv:2212.04096 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.53, + 0.787, + 0.571 + ], + "angle": 0, + "content": "55. Wu, H.Y., Rubinstein, M., Shih, E., Guttag, J., Durand, F., Freeman, W.: Eulerian video magnification for revealing subtle changes in the world. ACM transactions on graphics (TOG) 31(4), 1-8 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.571, + 0.787, + 0.612 + ], + "angle": 0, + "content": "56. Xu, T., White, J., Kalkan, S., Gunes, H.: Investigating bias and fairness in facial expression recognition. In: Computer Vision-ECCV 2020 Workshops: Glasgow, UK, August 23-28, 2020, Proceedings, Part VI 16. pp. 506-523. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.612, + 0.787, + 0.639 + ], + "angle": 0, + "content": "57. Yu, Z., Li, X., Zhao, G.: Remote photoplethysmograph signal measurement from facial videos using spatio-temporal networks. arXiv preprint arXiv:1905.02419 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.639, + 0.787, + 0.693 + ], + "angle": 0, + "content": "58. Yu, Z., Shen, Y., Shi, J., Zhao, H., Torr, P.H., Zhao, G.: Physformer: facial video-based physiological measurement with temporal difference transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4186-4196 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.693, + 0.787, + 0.735 + ], + "angle": 0, + "content": "59. Zhao, E.Q., Vilesov, A., Athreya, S., Chari, P., Merlos, J., Millett, K., Cyr, N.S., Jalilian, L., Kadambi, A.: Making thermal imaging more equitable and accurate: resolving solar loading biases. arXiv preprint arXiv:2304.08832 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.735, + 0.787, + 0.79 + ], + "angle": 0, + "content": "60. Zheng, T., Chen, Z., Zhang, S., Cai, C., Luo, J.: More-fi: Motion-robust and fine-grained respiration monitoring via deep-learning uwb radar. In: Proceedings of the 19th ACM Conference on Embedded Networked Sensor Systems. pp. 111–124 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.79, + 0.787, + 0.832 + ], + "angle": 0, + "content": "61. Zhi, S., Laidlow, T., Leutenegger, S., Davison, A.J.: In-place scene labelling and understanding with implicit scene representation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15838-15847 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.832 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_origin.pdf b/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4c9ea2ff143dc1fd0631db024ea4c98a35053f80 --- /dev/null +++ b/2024/Implicit Neural Models to Extract Heart Rate from Video/e64be6f4-a414-4fd7-80f2-51ced7ca0c48_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:aafbb63e0198473c7e75dd4ce459c71af15e33ee2feedb207706b40845b57114 +size 6629900 diff --git a/2024/Implicit Neural Models to Extract Heart Rate from Video/full.md b/2024/Implicit Neural Models to Extract Heart Rate from Video/full.md new file mode 100644 index 0000000000000000000000000000000000000000..eb9da23e19b4eabd3d8632af32aad2332b4dd9a1 --- /dev/null +++ b/2024/Implicit Neural Models to Extract Heart Rate from Video/full.md @@ -0,0 +1,364 @@ +# Implicit Neural Models to Extract Heart Rate from Video + +Pradyumna Chari $^{*1}$ , Anirudh Bindiganavale Harish $^{*,\dagger,2}$ , Adnan Armouti $^{\dagger,3}$ , Alexander Vilesov $^{1}$ , Sanjit Sarda $^{1}$ , Laleh Jalilian $^{1}$ , and Achuta Kadambi $^{1}$ + +1 University of California Los Angeles, Los Angeles CA 90095, USA {pradyumnac,vilesov,sanjitsarda}@ucla.edu, ljalilian@mednet.ucla.edu achuta@ee.ucla.edu + +$^{2}$ Rice University, Houston TX 77005, USA anirudhbh@rice.edu +3 Cornell Tech, New York NY 10044, USA armouti@cs.cornell.edu + +![](images/00622ca2cfb014a85ba57d3c385dbd79647973181f4db289846517fe5bf7d902.jpg) +Fig. 1: Prior implicit neural models represent scenes for diverse applications. We propose an implicit neural representation (INR) to decompose face videos and isolate blood flow information. Our INR decomposes input videos into visual appearance and blood flow ("A-B decomposition"). The decomposed data aids in estimating the remote photoplethysmography (rPPG) signal and heart rate. + +Abstract. Scene representation networks, or implicit neural representations (INR) have seen a range of success in numerous image and video applications. However, being universal function fitters, they fit all variations in videos without any selectivity. This is particularly a problem for tasks such as remote plethysmography, the extraction of heart rate information from face videos. As a result of low native signal to noise ratio, previous signal processing techniques suffer from poor performance, while previous learning-based methods have improved performance but + +suffer from hallucinations that mitigate generalizability. Directly applying prior INRs cannot remedy this signal strength deficit, since they fit to both the signal as well as interfering factors. In this work, we introduce an INR framework that increases this plethysmograph signal strength. Specifically, we leverage architectures to have selective representation capabilities. We are able to decompose the face video into a blood plethysmograph component, and a face appearance component. By inferring the plethysmograph signal from this blood component, we show state-of-the-art performance on out-of-distribution samples without sacrificing performance for in-distribution samples. We implement our framework on a custom-built multiresolution hash encoding backbone to enable practical dataset-scale representations through a 50x speed-up over traditional INRs. We also present a dataset of optically challenging out-of-distribution scenes to test generalization to real-world scenarios. Code and data may be found at https://implicitppg.github.io/. + +Keywords: Implicit neural representations $\cdot$ Remote plethysmography + +# 1 Introduction + +Neural scene representations have gained significant prominence over recent years. The ability to use neural networks as function fitters and encode scene information within their weights has found considerable applications for tasks such as image representations [20, 27, 40, 44], scene representations [15, 39, 54, 61], radiance fields [18, 29, 30] and video representations [7, 9, 25]. Consistent among these applications is the need to fit all possible scene variations without selectivity. + +However, for the task of remote plethysmography, the contactless monitoring of heart rate information from face videos via subtle skin color variations, selecting for the blood flow is required. Therefore, this indiscriminate fitting behavior of current implicit neural representations (INRs) is a significant drawback: both the signal and interfering factors will get fitted. Prior work [6,16,36,49] has established the low Signal-to-Noise Ratio (SNR) of the measurement (in this case, the facial image) as the source of remote photoplethysmography (rPPG) performance degradation. Previous methods generally fall into two categories: signal processing-based or deep learning-based. These two classes have established a trade-off between domain generalizability and in-distribution performance. + +Signal processing techniques improve signal strength by using model-based assumptions (such as band-pass filters or simple coloration models [11, 51]). These usually lead to relatively larger heart rate estimation errors. Recently, learning-based methods [8, 57, 58] for plethysmography have achieved state-of-the-art (SOTA) performance through end-to-end data-driven approaches. However, these methods suffer from generalization issues, where samples that are "out-of-distribution" (OOD) may show unspecified and often undesirable behavior due to overfitting. + +We propose an INR-based framework to improve the plethysmograph signal strength in facial videos before estimating the blood volume pulse signal. + +![](images/981bff1c20bb3bbe04017c3e5d096712d4b80384e8e7a6e90cf01ede2d71da3b.jpg) +Fig.2: Our implicit representation for rPPG achieves Pareto-optimality across out-of-distribution (OOD) performance and inter-distribution parity compared to prior algorithmic and learning-based methods. It performs better on OOD samples while maximizing parity between in-distribution and OOD performance. Table 1 shows metrics used for this plot. Higher is better along both axes. + +Specifically, we introduce a new Appearance-Blood (or $\mathcal{A}$ - $\mathcal{B}$ ) decomposition for facial video data. The decomposition is designed to improve the plethysmograph signal quality across the face. We show that the representation capacity of carefully designed INRs, with architectures motivated by light transport principles of the problem (namely the nature of subtle skin color variations due to the plethysmograph signal), can enable such a decomposition, allowing isolation of the relevant blood component. Conventional INRs, however, are slow to train, thereby making them intractable for dataset-scale analyses. We use multiresolution hash encodings inspired by [32] to facilitate fast $\mathcal{A}$ - $\mathcal{B}$ decomposition. To the best of our knowledge, we propose the first camera-based rPPG method that uses implicit neural representations as a critical component of the estimation pipeline. Different from prior methods, we focus on both in and out-of-distribution performance (specifically, optically challenging OOD). + +On a self-collected dataset of optically challenging OOD scenes, our method surpasses existing algorithmic and learning-based methods (Figure 2) with reliable plethysmograph and heart rate estimates. Notably, we achieve this OOD performance gain without compromising on in-distribution performance on rPPG datasets (Figure 1). As an additional outcome, we can obtain high-fidelity estimates of the plethysmograph signal strength (referred to as neural signal strength mask) across the face that generalize with high fidelity to OOD scenes and settings such as face paint, masks, glasses, and even reflection from windows. In summary, our contributions are as follows: + +1. We formulate Appearance-Blood $(\mathcal{A} - \mathcal{B})$ decomposition as a means of enhancing plethysmograph signal strength. We show that carefully designed implicit neural representations can serve as efficient $\mathcal{A}$ - $\mathcal{B}$ decomposers and propose a fast method to achieve this. + +2. This decomposition is the foundation for our proposed rPPG estimation method. On our optically challenging OOD dataset, our method shows significant improvements in performance over prior algorithmic and learning-based methods (Figure 2) without losing out on in-distribution performance. + +3. An optically challenging test dataset, consisting of 104 videos ( $\approx$ 1 hour of recorded data) across various optically challenging and OOD configurations, is collected and will be released upon acceptance of this work. + +# 1.1 Scope + +This work establishes the effectiveness of fast INRs to learn desired components of video data selectively - in this case, plethysmograph information. Other applications, such as video-based blood oxygenation and blood pressure estimation, require accurate plethysmography as a necessary first step. However, these applications are open research problems and is outside this work's scope. Furthermore, motion-robust rPPG is an open challenge and requires extensive research on its own. While this is not our primary goal, and our proposed method is not designed to combat motion artifacts, we test performance on motion videos and find our method competitive (supplement). Finally, we acknowledge that OOD is multi-faceted. This work primarily focused on optically challenging scenes and achieved SOTA results while secondarily validating performance on real-world obfuscations such as talking (and associated motions). + +# 2 Related Work + +Implicit Neural Representations. Implicit neural representations (INRs) are an increasingly prevalent method to represent scenes. Examples settings include image representations [20, 27, 40, 44], video representations [7, 9, 25], and 3-D scene representations [15, 39, 54, 61]. Specifically, this work is interested in the class of video-based representations. These include methods that use convolutional networks [7], phase-based motion-adjustable representation [25], space-time super-resolution [9] and flow fields for space-time viewpoint synthesis [13, 19]. We take inspiration from these prior methods but have different goals. We aim to use the video representation capacity of implicit networks to isolate imperceptible physiological phenomena, such as plethysmograph signals. + +Fast Implicit Neural Representations. A critical drawback of INRs is the time taken to train the networks for dataset scale experimentation and inference. Recent work, however, has taken a step toward alleviating this concern. [28] have proposed using a latent feature-based modulation network to generalize implicit representation models to model a broader range of images for faster convergence. Further, specialized toolboxes have been released to accelerate the training time of NeRFs [18,32]. In this work, we are interested in employing [32]'s parametric multiresolution spatial hash encodings as inputs to a shallow MLP. Using this foundation, we extend the framework to video INRs, specifically for + +generalizable, robust camera-based plethysmography. This technique can achieve orders of magnitude improvements in training time for INRs. + +Remote Plethysmography. Heart rate estimation using rPPG has been actively studied. Early methods were based on algorithmic principles of color variations [11, 51] or motion based on Newtonian reaction to blood flow [4]. Such methods are not limited to use with RGB cameras. Near Infrared (NIR) Imaging with active illumination has been employed to combat the effects of unreliable illumination in the visible (VIS) spectrum [24]. Augmented reality [14] is another avenue for this research. Deep learning approaches have also been utilized to attain SOTA results. [8] used an attention-based Convolutional Neural Network (CNN) while [57] introduced spatio-temporal CNNs. Other work has extended these architectures [35], including using transformers [58], incorporated meta-learning [17], improved PPG waveform characteristics [45], and augmented rPPG datasets with synthetic examples [3, 53]. Another class of methods focuses on improving equity between groups, such as participants of different skin tones [16, 36]. These include algorithmic methods [6] or multimodal fusion methods [49]. Methods for assessing and improving equity are not restricted to rPPG and extend to a range of computer vision problems [5, 16, 42, 52, 56, 59]. + +# 3 $\mathcal{A}$ - $\mathcal{B}$ Decomposition and Optimality + +We begin with describing the mathematical underpinnings of rPPG and propose the notion of appearance-blood $(\mathcal{A} - \mathcal{B})$ decomposition and its benefits. + +Fundamentally, the rPPG signal is subtle, making its estimation difficult. While contemporary methods [8, 57, 58] circumvent this through deep networks, they fare poorly on OOD samples. This necessitates a generalizable method capable of extracting the rPPG signal without relying on domain-specific features that tend to overfit. This motivates our functional decomposition. + +Given spatial coordinates $\mathbf{x} \in [-0.5, 0.5]^2$ , and temporal coordinate $t \in [-0.5, 0.5]$ , the face videos are interpreted as RGB color fields $\mathcal{C}(\mathbf{x}, t)$ . This color field consists of specular reflections that act as interference and diffuse components arising from subsurface scattering containing plethysmograph information. We wish to decompose the color signal into a signal amplitude component, $p_m(\mathbf{x}, t)$ , and a temporal plethysmograph signal $p_i(t)$ , our desired signal. However, the relation between $p_m(\cdot, \cdot)$ and $p_i(\cdot)$ is non-linear in nature. + +Under reasonable assumptions, we show color signals can be decomposed as: + +$$ +\mathcal {C} (\mathbf {x}, t) = \mathcal {A} (\mathbf {x}, t) + \mathcal {B} (\mathbf {x}, t) + \mathbf {v _ {n}} (\mathbf {x}, t), \tag {1} +$$ + +where $\mathcal{A}(\mathbf{x},t)$ represents the facial appearance (or $\mathcal{A}$ -function) - including specular highlights - which is interference. $\mathcal{B}(\mathbf{x},t)$ , the blood component (or $\mathcal{B}$ -function), contains the spatiotemporally varying color changes arising out of blood flow (plethysmography) that incorporates $p_m(\cdot ,\cdot)$ and $p_i(\cdot)$ . $\mathbf{v}_{\mathbf{n}}(\cdot ,\cdot)$ represents the measurement noise in the process. We will refer to this decomposition as the $\mathcal{A} - \mathcal{B}$ decomposition. Then, the following Theorem holds. + +Theorem 1: The $\mathcal{A} - \mathcal{B}$ decomposition results in a $\mathcal{B}$ -function with a Signal to Interference & Noise Ratio $SINR_{\mathcal{B}}(\mathbf{x},t)$ , such that $SINR_{\mathcal{B}}(\mathbf{x},t) \geq SINR_{\mathcal{C}}(\mathbf{x},t)$ . That is, the $\mathcal{A} - \mathcal{B}$ decomposition leads to an SINR gain. + +Note that Theorem 1 is an existence proof. It describes the existence of SINR benefits as a result of ideal decomposition, motivating its necessity in our real applications. Additionally, while SINR is computed across time, we also wish to model temporal variations due to lighting, pose changes, etc. This is what $t$ -dependence for SINR denotes. + +Corollary 1: Given an $\mathcal{A} - \mathcal{B}$ decomposed video field $\mathcal{C}(\mathbf{x},t)$ , the Maximal Ratio Combining (MRC)-optimal estimate for the plethysmograph $p_i(t)$ is given by, + +$$ +\widehat {p _ {i} ^ {*}} (t) = \int_ {\mathbf {x} \in \Omega} S I N R _ {\mathcal {B}} (\mathbf {x}, t) \mathcal {B} (\mathbf {x}, t) d \mathbf {x}, \tag {2} +$$ + +where $\Omega = [-0.5, 0.5]^2$ , the domain of $\mathbf{x}$ as previously defined. + +This is the notion of near-optimal plethysmography we aim to achieve. Detailed derivations for this section can be found in the supplement. + +# 3.1 Optimal Plethysmography and Uncertainty + +Equation 2 can also be interpreted in the context of uncertainty minimization [38]. In a discrete setting with $N$ pixel locations $\{\mathbf{x}\}_{i = 1}^{N}$ , each pixel is viewed as a sensor and the signal strength, $SINR_{\mathcal{B}}(\mathbf{x},t)$ is a proxy for the uncertainty or unreliability. Then the problem of estimating $\widehat{p_i^*}(t)$ can be interpreted as Bayesian inference. With assumptions on prior and posterior distributions, it can be shown that the posterior $\widehat{p_i^*}(t)$ is Gaussian with mean $\frac{\sum_{i = 1}^{N}SINR_{\mathcal{B}}(\mathbf{x}_i,t)\cdot\mathcal{B}(\mathbf{x}_i,t)}{\sum_{i = 1}^{N}SINR_{\mathcal{B}}(\mathbf{x}_i,t)}$ (best posterior estimate, a discretized and normalized version of Equation 2) and variance $1 / (\sum_{i = 1}^{N}SINR_{\mathcal{B}}(\mathbf{x}_i,t))$ . Since Equation 2 represents maximal ratio combining, $\sum_{i = 1}^{N}SINR_{\mathcal{B}}(\mathbf{x}_i,t)\propto SINR_{\widehat{p_i^*}(t)}$ ([43], Equation 31, 32), then, uncertainty (or the variance in the posterior) is inversely proportional to SINR of $\widehat{p_i^*}(t)$ . Optimal plethysmography therefore becomes akin maximization of SINR, or minimization of uncertainty of $\widehat{p_i^*}(t)$ . Please refer to the supplement for derivations. + +# 4 $\mathcal{A}$ - $\mathcal{B}$ Decomposition Using INRs + +This section explores conditions for $\mathcal{A}$ - $\mathcal{B}$ decomposition function approximators. We first establish necessary conditions that $\mathcal{A}$ - $\mathcal{B}$ decomposers must meet and then explore how INRs can be designed to perform such decomposition. + +# 4.1 Functional Decomposition + +Consider two functions, $\hat{\mathcal{A}} (\mathbf{x},t;\Theta_{\mathcal{A}})$ and $\hat{\mathcal{B}} (\mathbf{x},t;\Theta_{\mathcal{B}})$ , parameterized by $\Theta_{\mathcal{A}}$ and $\Theta_{\mathcal{B}}$ , that aim to represent $\mathcal{A}(\mathbf{x},t)$ and $\mathcal{B}(\mathbf{x},t)$ respectively. To perform an $\mathcal{A}$ - $\mathcal{B}$ decomposition, we wish to find functions that satisfying: + +![](images/9bdac6ca845073d2a7606d954d054aba72b5f815ac8f71e5abf80b5c62d81e4e.jpg) +Fig. 3: Sinusoidal Representation Networks (SRNs) can represent both $\mathcal{A}$ and $\mathcal{B}$ -functions, while phase-based methods only represent the $\mathcal{A}$ -function. (a) SRNs, such as [44], can capture PPG color variations almost perfectly, while (b) phase-based motion representations, such as [25] are unable to capture it. + +$$ +d _ {\mathcal {A}} (\hat {\mathcal {A}} (\mathbf {x}, t; \boldsymbol {\Theta} _ {\mathcal {A}} ^ {*}), \mathcal {A} (\mathbf {x}, t)) \leq \epsilon_ {\mathcal {A}}, +$$ + +$$ +d _ {\mathcal {B}} \left(\hat {\mathcal {B}} (\mathbf {x}, t; \boldsymbol {\Theta} _ {\mathcal {B}} ^ {*}), \mathcal {B} (\mathbf {x}, t)\right) \leq \epsilon_ {\mathcal {B}}, \tag {3} +$$ + +$$ +d _ {\mathcal {B}} (\hat {\mathcal {A}} (\mathbf {x}, t; \boldsymbol {\Theta} _ {\mathcal {A}} ^ {*}), \mathcal {B} (\mathbf {x}, t)) \geq \epsilon_ {\mathcal {B}}. +$$ + +where $\Theta_{\mathcal{A}}^{*}$ and $\Theta_{\mathcal{B}}^{*}$ are optimal parameters, and $d_{\mathcal{A}}(\cdot ,\mathcal{A}(\mathbf{x},t))$ and $d_{\mathcal{B}}(\cdot ,\mathcal{B}(\mathbf{x},t))$ are some component-dependent metric distances. This quantifies the requirement that $\hat{\mathcal{A}} (\mathbf{x},t;\Theta_{\mathcal{A}})$ is able to represent the $\mathcal{A}$ -function but not the $\mathcal{B}$ -function. + +We choose distance measures, $d_{\mathcal{A}}(\mathcal{F}, \mathcal{A}(\mathbf{x}, t)) = ||\mathcal{F} - \mathcal{A}(\mathbf{x}, t)||_2$ , $\forall \mathcal{F}$ , such that the appearance metric distance rewards pixel-wise closeness. Similarly, + +$$ +d _ {\mathcal {B}} (\mathcal {F}, \mathcal {B} (\mathbf {x}, t)) = | H (\mathcal {F}) - H (\mathcal {B} (\mathbf {x}, t)) |, \forall \mathcal {F}, \tag {4} +$$ + +where $H(\cdot)$ is a heart rate estimator function. By finding functions that satisfy the constraints in Equation 3, we can achieve $\mathcal{A} - \mathcal{B}$ decomposition by sequentially learning $\hat{\mathcal{A}} (\mathbf{x},t;\boldsymbol {\Theta}_{\mathcal{A}})$ and $\hat{\mathcal{B}} (\mathbf{x},t;\boldsymbol {\Theta}_{\mathcal{B}})$ . A detailed mathematical analysis of this formulation is deferred to the supplement. + +# 4.2 Identifying Implicit $\mathcal{A}$ - $\mathcal{B}$ Decomposers + +Prior work on video magnification through Laplacian [55] and phase-based [50] pyramids is instructive. While the Laplacian pyramid-based approach [55] can magnify blood flow due to color changes, the phase-based method [50] cannot magnify blood flow. With this intuition, we use the metrics defined in the previous section to identify approximations for $\mathcal{A}$ & $\mathcal{B}$ . We first look at phase-modulated INRs for motion modeling [25]. The key inductive bias here is parameterizing time as phase modulation in positional encodings [30,46]. + +Empirical Claim 1 (based on observations): Phase-based implicit models (models with phase-encoded input embeddings) cannot represent plethysmograph signals accurately, in terms of the metric in Equation 4. (Figure 3(b)) + +While this can be viewed as a limitation of phase-based INRs, we use it to our advantage: phase-based models can be $\mathcal{A}$ -function estimators (Equation 3). + +We next look at sinusoid representation networks (SRNs), such as [20,40,44]. Empirical Claim 2: SRNs are good $\mathcal{A}$ , $\mathcal{B}$ -function approximators. (Figure 3(a)) + +![](images/47b2bc66f37307107f5f06b399d3a9a7c4860c9b978aeaf47808ccbdbbdcc70e.jpg) +Fig. 4: To enable fast $\mathcal{A} - \mathcal{B}$ decomposition, we use implicit neural representations as decomposing function fitters. Training is done sequentially: first, the cascaded appearance model learns the $\mathcal{A}$ -function. Then, the appearance model is frozen, and the residual model learns the $\mathcal{B}$ -function, thereby completing the decomposition. The use of multiresolution hash encodings makes dataset-scale decomposition viable. + +However, being able to represent both $\mathcal{A}$ and $\mathcal{B}$ makes SRNs incapable of $\mathcal{A} - \mathcal{B}$ decomposition. This pair exactly satisfy the constraints in Equation 3. Hence, Empirical Claim 3: A phase-based model can serve as $\hat{\mathcal{A}} (\mathbf{x},t;\Theta_{\mathcal{A}}^{*})$ , while an SRN can serve as $\hat{\mathcal{B}} (\mathbf{x},t;\Theta_{\mathcal{B}}^{*})$ , when trained sequentially. + +Justifications for all claims may be found in the supplement. However, naive use of prior work [25, 44] for $\mathcal{A} - \mathcal{B}$ decomposition poses a training time problem. Using variants of [25] and [44] as $\mathcal{A}$ and $\mathcal{B}$ -function estimators, respectively, we noted a training time of 20 minutes for a 2-second long video with a resolution of $128 \times 128$ . Such compute times are infeasible for dataset-scale experiments. + +# 5 Hash Encodings for $\mathcal{A}$ - $\mathcal{B}$ Decomposition + +In this section, we propose high-speed INR-based $\mathcal{A}$ - $\mathcal{B}$ decomposition. Specifically, to address the slower speeds of traditional INRs, we pivot to a faster framework and show design INRs for $\mathcal{A}$ - $\mathcal{B}$ decomposition within this framework. + +Inspired by recent work in instant neural graphics primitives [32], we propose using a multiresolution hash input encoding (MRHE)-based framework for $\mathcal{A}$ $\mathcal{B}$ decomposition. A critical aspect is using the spatial hash function for video fields. Spatial hash functions [34, 47] are typically 2-D and 3-D extensions to the prevalent hash tables. We use this principle to model the spatio-temporal coordinates $(x,y,t)$ as a 3-D space. We posit that the 3-D spatial hash function can effectively model this space without violating any temporal constraints. + +# 5.1 Cascaded Appearance Model $\hat{\mathcal{A}} (\mathbf{x},t;\Theta_{\mathcal{A}})$ + +As discussed in Section 4.2, phase-based INRs [25], are efficient $\mathcal{A}$ -function representatives. However, a direct translation of this concept to MRHEs is intractable, i.e., replacing the sinusoidal positional encodings with the faster MRHE makes phase incorporation infeasible. For sinusoidal encodings, phase modulations are akin to offsets. Thus, we propose to incorporate the time-to-phase conversion through learned spatiotemporal offset. The appearance model has two stages: the first maps spatio-temporal coordinates to positional offsets in the MRHE. The second is queried using the offset positions to generate video frames. + +![](images/8a6addf1a85ee23bc7a38ec58bee2c030ad5e778f9c4a894f2634a39878caab8.jpg) +Fig. 5: Using the estimated $\mathcal{B}$ -function with the original video, we learn high-fidelity neural signal strength masks. The network takes the original RGB frames and the $\mathcal{B}$ -function estimate as inputs and returns a spatial strength mask. Training is supervised through an auxiliary 1-D CNN whose training target is the prediction of an accurate plethysmograph. The 1-D CNN is discarded post-training, and the learned mask model is used at inference time on the $\mathcal{B}$ -function to estimate rPPG. + +Rather than considering a single offset vector in $\mathbb{R}^2$ for the entire frame (as [25] do for phase estimation), we estimate the offset, $\varDelta\mathbf{x}\in\mathbb{R}^{2}$ , for each point in the spatio-temporal grid. That is, $\varDelta\mathbf{x}=f_{\mathcal{A}_1}(\mathbf{x},t)$ . The estimated offsets are added to the original spatial coordinates, which are then used to query a second model $f_{\mathcal{A}_2}(\mathbf{x}+\varDelta\mathbf{x})$ . Translating Empirical Claim 1 from phase-based to offset-based models, we summarize our offset-adjustable cascaded appearance model as $\hat{\mathcal{A}}(\mathbf{x},t;\Theta_{\mathcal{A}})=f_{\mathcal{A}_2}(\mathbf{x}+f_{\mathcal{A}_1}(\mathbf{x},t))$ . The architecture and loss functions are elaborated on in the supplement. Figure 4 details this pipeline. + +# 5.2 Residual Plethysmograph Model $\hat{\mathcal{B}} (\mathbf{x},t;\Theta_{\mathcal{B}})$ + +We use a shallow sinusoidal model with MRHE, $f_{\mathcal{B}}(\cdot ,\cdot)$ , as our $\mathcal{B}$ -function estimator. In line with Empirical Claim 3, we train the residual plethysmograph network sequentially after the cascaded appearance model. While training, we freeze the cascaded appearance model and train the residual plethysmography network on the difference between the original video input and the output of the estimated appearance field. That is, $\hat{\mathcal{B}} (\mathbf{x},t;\Theta_{\mathcal{B}}) = f_{\mathcal{B}}(\mathbf{x},t)$ . + +The resulting residual plethysmograph model is shown to compensate for the cascaded appearance model's inability to retain the plethysmograph signal. When queried, the model yields a spatio-temporal estimate of the plethysmograph signal. The supplement contains relevant implementation details. + +# 6 rPPG Estimation + +The previous section enables us to learn an estimator for $\mathcal{B}(\mathbf{x},t)$ , which is one part of the SINR optimality (and hence uncertainty minimization) from Equation 2. In this section, we proceed towards rPPG estimation from the $\mathcal{B}$ -function using high-fidelity neural signal masks. + +Figure 5 highlights our proposed pipeline. Built on a 3-D CNN backbone, we indirectly supervise the spatial-attention-based network architecture with PPG waveforms. The model accepts the RGB input field concatenated with $\hat{B}(\mathbf{x}, t)$ (a + +combined 6-channel input) to estimate a mask. Here, $\mathcal{I}(\mathbf{x},t) = \left[\mathcal{C}(\mathbf{x},t),\hat{\mathcal{B}} (\mathbf{x},t)\right]$ where $\mathcal{I}(\mathbf{x},t)$ is the input to our SINR mask estimator. Limited by compute requirements, we relax the temporal component and only consider the first 64 frames (of the 300 frames) to compute a single mask for 10 seconds. End-to-end the network can be summarized as $SINR_{\mathcal{B}}(\mathbf{x}) = f_{SINR}\left(\mathcal{I}(\mathbf{x},t);\Theta_{SINR}\right)$ . + +It must be noted that while we only estimate a single mask for a 10-second video, our experiments show that our method is competitive even in the presence of natural motions like talking and head swaying (supplement). The SINR mask $S\hat{N} R_{\mathcal{B}}(\mathbf{x})$ is directly used to compute $\mathbf{y}_1(t) = \frac{\sum_{\mathbf{x}}S\hat{N}R_{\mathcal{B}}(\mathbf{x})\cdot I(\mathbf{x},t)}{\sum_{\mathbf{x}}S\hat{N}R_{\mathcal{B}}(\mathbf{x})}$ , where $\mathbf{y}_1(t)$ is a time-series obtained from the 6-channel weighted spatial average of the input. + +The 6-channel time-series signal is then passed through a 1-D CNN to yield a refined temporal estimate of the plethysmograph signal, $\hat{\mathbf{p}}(t)$ . Note that this network is not used to generate the final estimates but to supervise the neural signal strength mask model indirectly. The whole pipeline is supervised end-to-end with the ground truth plethysmograph signals. Implementation details and further mathematical formulation are provided in the supplement. As a result of the architecture being based on the optimality constraint in Equation 2, the inferred masks are expected to be near SINR-optimal. This also means near optimality in terms of uncertainty minimization. + +As in prior learning approaches, the neural regressor overfits the waveform, making it sub-optimal for OOD. Hence, we only retain $f_{SINR}(\cdot)$ . The neural signal masks are combined with $\hat{B}$ to estimate the rPPG signal. We follow [48] and utilize only the green channel. Advanced algorithms [11,51] exist that utilize other channels, but they rely on the $A$ -function [11,51]. We perform detrending and Butterworth filtering for heart rate estimation as in [51]. + +# 7 Results + +# 7.1 Experimental Setup + +Datasets All methods are trained on two prior datasets [49, 53]. We also test our method on a self-collected Institutional Review Board (IRB) approved optically challenging OOD dataset. While we mainly focus on our dataset for OOD analysis, we also present results of cross-dataset inference. In our OOD dataset, we share full participant videos (without identifying information such as names), but only after recording contact details of dataset users. The dataset is released after potential users fill out a request form. Further details are in the supplement. + +Evaluation Metrics We adopt the heart rate (HR) performance metrics from [49]. These include Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), Root Mean Squared Error (RMSE), Pearson correlation coefficient (r) and the Threshold test (T-Test) [2,31,33]. Since our goal is OOD generalization, we propose "r-consistency" as the similarity metric between the Pearson coefficients of the in-distribution (ID) and OOD samples, calculated as a harmonic mean. A detailed discussion of this metric is present in the supplement. + +Table 1: Performance on our OOD dataset considerably favors our method over prior work. We measure inter-distribution parity via the r-consistency metric. In-distribution values for r are given in Table 2. For algorithmic methods (non-learning), r-consistency on the datasets from [53] and [49] are shown in parenthesis. The best and second-best-performing numbers are highlighted in green and yellow, respectively. + +
MethodOOD Performance MetricsInter-Distribution Parity Metric
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑r-consistency ↑
Green [48]31.547.809.84%14.560.47(0.54, 0.52)
POS [51]31.928.0211.06%14.870.47(0.60, 0.62)
CHROM [11]36.739.3212.62%15.850.40(0.53, 0.55)
ICA [41]31.158.1710.50%15.320.41(0.5, 0.51)
Train on [53]DeepPhys [8]78.2718.6423.19%23.230.07
TS-CAN [21]77.1218.4623.24%23.310.00
EfficientPhys [22]32.1212.2316.78%23.400.31
PhysNet [57]33.658.6411.09%16.140.35
PhysFormer [58]48.4610.4113.26%15.540.24
Ours18.085.106.81%12.020.620.73
Train on [49]DeepPhys [8]77.8817.9422.44%22.490.07
TS-CAN [21]75.5817.6522.02%22.020.01
EfficientPhys [22]44.2313.8518.28%22.840.19
PhysNet [57]48.4611.2414.27%17.470.32
PhysFormer [58]39.819.5812.59%15.140.32
Ours16.154.616.07%11.650.650.78
+ +Evaluation Configuration We gauge performance of all methods via HR estimations from the power-spectral density. These estimations are carried over 300-sample windows (10 seconds), with a stride of 128 samples. Following [49], we validate4 the learning-based methods by performing six-fold cross-validation while averaging across the entire dataset for algorithmic methods. Similarly, we construct three folds for [53] to evaluate the learning methods. Please refer to the supplement for details, including visualization of signal strength masks. + +Figures 6 and 7 show the results of our algorithm against the baseline methods. For ease of interpretability, we correct for random phase lag between the face (site of signal measurement) and finger (site of ground truth measurement). + +# 7.2 Out of Distribution Plethysmography + +We use our self-collected optically challenging dataset to benchmark OOD performance. While we primarily employ this dataset, we acknowledge that this is not the only notion of OOD. Hence, we also perform cross-dataset inference as part of the evaluation protocol to measure generalization capacity. + +Optically Challenging OOD Evaluation Table 1 presents a quantitative analysis of OOD performance. Learning-based methods are trained on the datasets from [53] and [49], and the best fold is chosen for OOD inference. + +Given their capacity to memorize distinguishable patterns, learning methods [57,58] handle input noise better than algorithmic methods for in-distribution + +Table 2: In-distribution and Cross-dataset OOD performance across two datasets - [49] and [53] shows comparable or superior performance compared to prior methods. Across in-distribution and cross-dataset validation, our method is the most consistent compared to SOTA methods. The best-performing and second-best-performing numbers are shown in green and yellow, respectively. There are 4 quadrants: $1^{st}$ - top left, $2^{nd}$ - top right, $3^{rd}$ - bottom right and $4^{th}$ - bottom left. + +
MethodTest on [53]Test on [49]
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑
Green [48]12.193.714.75%10.270.64
POS [51]6.192.032.84%6.750.84
CHROM [11]9.662.743.81%7.920.78
ICA [41]9.742.943.83%9.150.71
Train on [53]
DeepPhys [8]72.7016.3321.32%20.430.0276.2618.2122.79%22.340.02
TS-CAN [21]74.5016.6921.87%20.690.0177.1718.2823.17%22.380.03
EfficientPhys [22]2.261.021.59%5.510.884.471.672.27%5.900.89
PhysNet [57]2.760.941.37%4.690.923.581.191.59%3.750.96
PhysFormer [58]4.331.281.72%5.030.9025.086.508.58%12.280.54
Ours3.221.211.78%5.610.884.391.662.17%4.690.94
Green [48]19.586.277.53%14.270.57
POS [51]6.002.132.78%6.540.89
CHROM [11]8.072.383.07%6.720.89
ICA [41]17.155.136.00%12.210.66
Train on [49]
DeepPhys [8]73.8516.6021.66%20.550.0077.4318.4623.26%22.460.01
TS-CAN [21]75.3017.0322.35%20.960.0377.3618.6123.49%22.760.00
EfficientPhys [22]11.454.446.43%13.460.5321.586.508.53%14.080.53
PhysNet [57]66.4414.0419.72%17.810.064.721.481.87%4.480.93
PhysFormer [58]22.745.277.34%9.930.622.961.061.37%3.350.96
Ours3.161.161.69%5.330.893.341.221.61%4.010.96
+ +inference. However, this also leads to poorer generalizability on our OOD dataset, as emphasized by both the Pearson coefficient (r) and the "r-consistency" metrics. In contrast, algorithmic methods rely on deterministic heuristics. While this promotes good generalizability, it makes them extremely sensitive to factors such as lighting, occlusion, etc., leading to generally poorer performance. + +Our proposed method maximizes signal strength while avoiding overfitting to the training distribution. We are, therefore, Pareto-optimal in both OOD performance and inter-distribution parity (Figure 2) regarding the T-Test value and "r-consistency" score. Our method is both the best and second-best performing method, outperforming Green (the best baseline) with $48.8\%$ and $40.9\%$ reduction in T-Test and MAE values. Clinically, this implies an almost $2x$ reduction in the number of participants on whom the method fails following the AAMI standard. Further granular analysis can be found in the supplement. + +Cross-Dataset OOD and In-Distribution Evaluation Another notion of OOD is a cross-dataset generalization. Domain shifts between datasets result from differences in hardware and acquisition conditions. Learning-based methods tend to overfit the training data. Our experiments use datasets from [53] and [49] for their size and diversity. Table 2 indicates that while deep learning methods perform well in-distribution ( $1^{\text{st}}$ and $3^{\text{rd}}$ quadrant), they cannot maintain the same level of performance for cross-dataset inference ( $2^{\text{nd}}$ and $4^{\text{th}}$ quadrant). Algorithmic methods have no notion of cross-dataset evaluation. When trained + +![](images/5eb7f878dacc8556076fa9a390236910e8e0336a727e66ea4d4ba13f05186388.jpg) + +![](images/c15cf934f2f24a0b3996a67356a829c9419f107e8e5b993db662d31653c20254.jpg) + +![](images/31e98aa82d4ef60f27d62c168f6a4cfd6629d9529186724567a3116acf15c51f.jpg) + +![](images/b34ea040ce7f83c303a1d3938839ef8c5f3f124fe0c4909fe82e60edf7b80a98.jpg) + +![](images/930d90b471e6843686bf891f05166b6d19f9e66cc536340500531d34fe6af718.jpg) + +![](images/8c98afcece5268625400298422de3982eda05bc98c88599457430e2238dbd499.jpg) + +![](images/55514e872dc08f841fab601149549115da8045ca73ba58de54b2839968626628.jpg) + +![](images/a6bc6ae3e7d02e82178962ebe6649970eab64d9980cd1760b603f674f23703c5.jpg) + +![](images/12878ee782063ed70481413124e57716e52facadb2a57650886c3ca284683f08.jpg) + +![](images/7c537bfffb2e6bc25be780a1ebaa0060c2fbaadf0d32e6c905d429679d05fb2b.jpg) + +![](images/20b883b8c9ab981e950bf1d61110ec77c9a3c70eff2b685d59c3762e084ac0b2.jpg) +(a) VID. + +![](images/c53dd50ce8633f3f331079114f3277e938c23371893749cf1974e61521536478.jpg) +(b) [48] + +![](images/b526097aca886d88ce746502e3fa3edc153cb7ad80df517cb4040f2e5a1c6597.jpg) +(c) [58] + +![](images/95cb1e57072cf59fef8d2a9cb9c3d30d4ee62f60f778facaf7c539143e72f207.jpg) +(d) OURS +Fig.6: Across challenging OOD optical settings, the proposed method can capture details of the plethysmograph waveform compared to prior methods. Results shown use models trained on the dataset proposed in [49], where applicable. Additional results are presented in the supplement. + +![](images/ce8e28167366a0db69994856be44791ec62dd24698d06ea7201d0d782765c492.jpg) +(e) GT + +on [49] and tested on [53] ( $4^{th}$ quadrant), we outperform all prior work. In the reverse scenario (2nd quadrant), we are the second-best, marginally behind [57]. + +Despite OOD being our central focus, our model offers results comparable to SOTA algorithms even for in-distribution evaluation. Our method is within 0.3 bpm MAE compared to all top baselines (a difference that is not clinically significant). Additionally, our method shows a sub 0.5 bpm standard deviation of MAE across various folds used for evaluation in all configurations. Overall, our method is the most consistent across all quadrants while yielding errors within 2 bpm MAE, which most likely would be clinically accurate. + +# 7.3 Qualitative Comparison + +In Figure 6, we assess the qualitative waveforms generated on our optically challenging OOD dataset. We compare our method against the best-performing algorithmic and deep learning methods from Table 1, i.e., Green [48] and PhysFormer [58] respectively. For the representative samples, our method is superior in performance and can retain the shape of the plethysmography signal. The second scene, with the mask and glasses, especially highlights these gains. We also show superior rPPG estimation for extreme scenes (window reflections). + +In Figure 7, we assess qualitative waveforms from in-distribution inference samples from [49]. We compare our method with PhysFormer [58] and POS [51] as the best-performing in-distribution deep learning and algorithmic methods. Our method retains both the frequency information and salient features of the waveform across diverse skin tones in the dataset. + +![](images/3643150efc4f1fa9fadb10f495d31385ec9086aa32c7b6bc5e5ed5412ec67cc9.jpg) + +![](images/458c7eaf94832d4f5974a4bcac5c3218367b8b29c4b32f1e476d90ab733080b0.jpg) + +![](images/5291fa2b6f63b4fd1fa3c8c474d3c44ab0cd45b1f58d7494a5520651fbd2c87a.jpg) + +![](images/165dd5e49d5b357d0aac37b7434eb5968751a0852e439db9213a48201094a10e.jpg) + +![](images/0e052412cfd02a5d369303da6dbe104940a5ce643cb8b4957788f5e49d9f3826.jpg) + +![](images/a80ccdaece25b0ff8b79395e1a6c4cfd45e38ac5366e73168c2ece75d80f91c6.jpg) +(a) VID. + +![](images/fb10b75d47089a50a7e92ce70afc2887b1544f89090b96c6bdb73d0b28cd6bfe.jpg) +(b) [51] + +![](images/98725dd7e4fb6d28cf97226e171a28c23e59ffde5032a78e2479095e2f4caed2.jpg) +(c) [58] +Fig. 7: In distribution inference on a diverse dataset. Our method better captures rPPG waveform details across skin tones for in-distribution evaluation on [49] dataset. While our method and [58] both perform reasonably well across skin tones, [58] does so with poorer OOD performance (Figure 6). More results in the supplement. + +![](images/5d4629d6c9b4b5348256e623d74f6df3386ca99264cce1a5bddb55c07ff82701.jpg) +(d) Ours + +![](images/54bf683d4a1f845a8c3493ed2b2ba971a43780a4ff60ddbccd2f62b7b8bcc122.jpg) +(e) GT + +# 8 Discussion + +We propose an INR for camera-based rPPG. We introduce the concept of $\mathcal{A}$ - $\mathcal{B}$ decomposition and propose an INR architecture to achieve this at scale. The proposed model is evaluated on a dataset of optically challenging OOD participants in addition to existing datasets. Our model performs best on the OOD dataset while comparable to SOTA for in-distribution validation. + +# 8.1 Limitations + +Being the first method using INRs for rPPG, limitations exist. First, while we reduce runtime over traditional INRs (as discussed in the supplement), and some rPPG methods report comparable runtimes [26], this is an avenue for future improvement. Second, while the proposed method is competitive for challenging scenes like talking and motion (supplement), these problems remain open. + +# 8.2 Societal Impacts and Ethical Considerations + +We focus on rPPG in optically challenging scenes (Section 1.1) due to factors like lighting, facial occlusions (masks, glasses, medical equipment), etc. Robustness to such settings enables applicability in settings like hospital rooms, classrooms, driving, etc. Additionally, prior work [1, 37] has shown promise in using rPPG for tasks like biometrics and forensics, and OOD-robustness will bring these applications one step closer to real-world deployment. Finally, these methods can also potentially be applied to other modalities and vital signs [10, 12, 60]. + +Technological solutions enabling healthcare for all, like this work, are relevant for social good. However, technology with clinical impact should only be deployed once the method is provably robust. Our method takes a step in that direction, but a pipeline of similar papers is needed to enable real-world rPPG deployment. + +# Acknowledgements + +We thank the Visual Machines Group (VMG) at UCLA for feedback and support. A.K. was supported by a National Science Foundation (NSF) CAREER award, IIS-2046737, Army Young Investigator Program Award, Defense Advanced Research Projects Agency (DARPA) Young Faculty Award, and a Cisco Research Award. P.C. was partially supported by a Cisco Research Award. + +# References + +1. Al Masri, A., Jasra, S.K.: The forensic biometric analysis of emotions from facial expressions, and physiological processes from the heart and skin. Journal of Emerging Forensic Sciences Research 1(1), 61-77 (2016) +2. Association, C.T.: Physical activity monitoring for heart rate, ansi/cta-2065 (2018) +3. Ba, Y., Wang, Z., Karinca, K.D., Bozkurt, O.D., Kadambi, A.: Overcoming difficulty in obtaining dark-skinned subjects for remote-ppg by synthetic augmentation. arXiv preprint arXiv:2106.06007 (2021) +4. Balakrishnan, G., Durand, F., Guttag, J.: Detecting pulse from head motions in video. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 3430-3437 (2013) +5. Chari, P., Ba, Y., Athreya, S., Kadambi, A.: Mime: Minority inclusion for majority group enhancement of ai performance. In: European conference on computer vision. pp. 326-343. Springer (2022) +6. Chari, P., Kabra, K., Karinca, D., Lahiri, S., Srivastava, D., Kulkarni, K., Chen, T., Cannesson, M., Jalilian, L., Kadambi, A.: Diverse r-ppg: Camera-based heart rate estimation for diverse subject skin-tones and scenes. arXiv preprint arXiv:2010.12769 (2020) +7. Chen, H., He, B., Wang, H., Ren, Y., Lim, S.N., Shrivastava, A.: Nerv: Neural representations for videos. Advances in Neural Information Processing Systems 34, 21557-21568 (2021) +8. Chen, W., McDuff, D.: Deepphys: Video-based physiological measurement using convolutional attention networks. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 349-365 (2018) +9. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022) +0. Chen, Z., Zheng, T., Cai, C., Luo, J.: Movi-fi: Motion-robust vital signs waveform recovery via deep interpreted rf sensing. In: Proceedings of the 27th annual international conference on mobile computing and networking. pp. 392–405 (2021) +1. De Haan, G., Jeanne, V.: Robust pulse rate from chrominance-based rppg. IEEE Transactions on Biomedical Engineering 60(10), 2878-2886 (2013) +2. Del Regno, K., Vilesov, A., Armouti, A., Harish, A.B., Can, S.E., Kita, A., Kadambi, A.: Thermal imaging and radar for remote sleep monitoring of breathing and apnea. arXiv preprint arXiv:2407.11936 (2024) +3. Gao, C., Saraf, A., Kopf, J., Huang, J.B.: Dynamic view synthesis from dynamic monocular video. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5712-5721 (2021) + +14. Hurter, C., McDuff, D.: Cardiolens: remote physiological monitoring in a mixed reality environment. In: ACM siggraph 2017 emerging technologies, pp. 1-2 (2017) +15. Jiang, C., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T., et al.: Local implicit grid representations for 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6001-6010 (2020) +16. Kadambi, A.: Achieving fairness in medical devices. Science 372(6537), 30-31 (2021) +17. Lee, E., Chen, E., Lee, C.Y.: Meta-rppg: Remote heart rate estimation using a transductive meta-learner. In: European Conference on Computer Vision. pp. 392–409. Springer (2020) +18. Li, R., Tancik, M., Kanazawa, A.: Nerfacc: A general nef acceleration toolbox. arXiv preprint arXiv:2210.04847 (2022) +19. Li, Z., Niklaus, S., Snavely, N., Wang, O.: Neural scene flow fields for space-time view synthesis of dynamic scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6498-6508 (2021) +20. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16252-16262 (2022) +21. Liu, X., Fromm, J., Patel, S., McDuff, D.: Multi-task temporal shift attention networks for on-device contactless vitals measurement. Advances in Neural Information Processing Systems 33, 19400-19411 (2020) +22. Liu, X., Hill, B., Jiang, Z., Patel, S., McDuff, D.: Efficientphys: Enabling simple, fast and accurate camera-based cardiac measurement. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 5008-5017 (January 2023) +23. Liu, X., Zhang, X., Narayanswamy, G., Zhang, Y., Wang, Y., Patel, S., McDuff, D.: Deep physiological sensing toolbox. arXiv preprint arXiv:2210.00716 (2022) +24. Magdalena Nowara, E., Marks, T.K., Mansour, H., Veeraraghavan, A.: Sparseppg: Towards driver monitoring using camera-based vital signs estimation in near-infrared. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 1272-1281 (2018) +25. Mai, L., Liu, F.: Motion-adjustable neural implicit video representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10738-10747 (2022) +26. Maity, A.K., Wang, J., Sabharwal, A., Nayar, S.K.: Robustppg: camera-based robust heart rate estimation using motion cancellation. Biomedical Optics Express 13(10), 5447-5467 (2022) +27. Martel, J.N., Lindell, D.B., Lin, C.Z., Chan, E.R., Monteiro, M., Wetzstein, G.: Acorn: Adaptive coordinate networks for neural scene representation. arXiv preprint arXiv:2105.02788 (2021) +28. Mehta, I., Gharbi, M., Barnes, C., Shechtman, E., Ramamoorthi, R., Chandraker, M.: Modulated periodic activations for generalizable local functional representations. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14214-14223 (2021) +29. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022) + +30. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) +31. Monitors, C.: Heart rate meters, and alarms. ANSI/AAMI Standard EC13 (2002) +32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Trans. Graph. 41(4), 102:1-102:15 (Jul 2022). https://doi.org/10.1145/3528223.3530127, https://doi.org/10.1145/3528223.3530127 +33. Nelson, B.W., Allen, N.B.: Accuracy of consumer wearable heart rate measurement during an ecologically valid 24-hour period: intraindividual validation study. JMIR mHealth and uHealth 7(3), e10828 (2019) +34. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013) +35. Niu, X., Shan, S., Han, H., Chen, X.: Rhythmnet: End-to-end heart rate estimation from face via spatial-temporal representation. IEEE Transactions on Image Processing 29, 2409-2423 (2019) +36. Nowara, E.M., McDuff, D., Veeraraghavan, A.: A meta-analysis of the impact of skin tone and gender on non-contact photoplethysmography measurements. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 284-285 (2020) +37. Nowara, E.M., Sabharwal, A., Veeraraghavan, A.: Ppgsecure: Biometric presentation attack detection using photopletysmograms. In: 2017 12th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2017). pp. 56-62. IEEE (2017) +38. Owhadi, H., Scovel, C., Sullivan, T.J., McKerns, M., Ortiz, M.: Optimal uncertainty quantification. Siam Review 55(2), 271-345 (2013) +39. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019) +40. Peters, H., Ba, Y., Kadambi, A.: pcon: Polarimetric coordinate networks for neural scene representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023) +41. Poh, M.Z., McDuff, D.J., Picard, R.W.: Non-contact, automated cardiac pulse measurements using video imaging and blind source separation. Optics express 18(10), 10762-10774 (2010) +42. Ramaswamy, V.V., Kim, S.S., Russakovsky, O.: Fair attribute classification through latent space de-biasing. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9301-9310 (2021) +43. Schulz, P., Scheuvens, L., Fettweis, G.: A new perspective on maximal-ratio combining. In: 2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). pp. 1-7. IEEE (2023) +44. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in Neural Information Processing Systems 33, 7462-7473 (2020) +45. Song, R., Chen, H., Cheng, J., Li, C., Liu, Y., Chen, X.: Pulsegan: Learning to generate realistic pulse waveforms in remote photoplethysmography. IEEE Journal of Biomedical and Health Informatics 25(5), 1373-1384 (2021) + +46. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020) +47. Teschner, M., Heidelberger, B., Müller, M., Pomerantes, D., Gross, M.H.: Optimized spatial hashing for collision detection of deformable objects. In: Vmv. vol. 3, pp. 47-54 (2003) +48. Verkruysse, W., Svaasand, L.O., Nelson, J.S.: Remote plethysmographic imaging using ambient light. Optics express 16(26), 21434-21445 (2008) +49. Vilesov, A., Chari, P., Armouti, A., Harish, A.B., Kulkarni, K., Deoghare, A., Jalilian, L., Kadambi, A.: Blending camera and 77 ghz radar sensing for equitable, robust plethysmography. ACM Transactions on Graphics (TOG) 41(4), 1-14 (2022) +50. Wadhwa, N., Rubinstein, M., Durand, F., Freeman, W.T.: Phase-based video motion processing. ACM Transactions on Graphics (TOG) 32(4), 1-10 (2013) +51. Wang, W., Den Brinker, A.C., Stuijk, S., De Haan, G.: Algorithmic principles of remote ppg. IEEE Transactions on Biomedical Engineering 64(7), 1479-1491 (2016) +52. Wang, Z., Qinami, K., Karakozis, I.C., Genova, K., Nair, P., Hata, K., Russakovsky, O.: Towards fairness in visual recognition: Effective strategies for bias mitigation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8919-8928 (2020) +53. Wang, Z., Ba, Y., Chari, P., Bozkurt, O.D., Brown, G., Patwa, P., Vaddi, N., Jalilian, L., Kadambi, A.: Synthetic generation of face videos with plethysmograph physiology. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20587-20596 (2022) +54. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. arXiv preprint arXiv:2212.04096 (2022) +55. Wu, H.Y., Rubinstein, M., Shih, E., Guttag, J., Durand, F., Freeman, W.: Eulerian video magnification for revealing subtle changes in the world. ACM transactions on graphics (TOG) 31(4), 1-8 (2012) +56. Xu, T., White, J., Kalkan, S., Gunes, H.: Investigating bias and fairness in facial expression recognition. In: Computer Vision-ECCV 2020 Workshops: Glasgow, UK, August 23-28, 2020, Proceedings, Part VI 16. pp. 506-523. Springer (2020) +57. Yu, Z., Li, X., Zhao, G.: Remote photoplethysmograph signal measurement from facial videos using spatio-temporal networks. arXiv preprint arXiv:1905.02419 (2019) +58. Yu, Z., Shen, Y., Shi, J., Zhao, H., Torr, P.H., Zhao, G.: Physformer: facial video-based physiological measurement with temporal difference transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4186-4196 (2022) +59. Zhao, E.Q., Vilesov, A., Athreya, S., Chari, P., Merlos, J., Millett, K., Cyr, N.S., Jalilian, L., Kadambi, A.: Making thermal imaging more equitable and accurate: resolving solar loading biases. arXiv preprint arXiv:2304.08832 (2023) +60. Zheng, T., Chen, Z., Zhang, S., Cai, C., Luo, J.: More-fi: Motion-robust and fine-grained respiration monitoring via deep-learning uwb radar. In: Proceedings of the 19th ACM Conference on Embedded Networked Sensor Systems. pp. 111–124 (2021) +61. Zhi, S., Laidlow, T., Leutenegger, S., Davison, A.J.: In-place scene labelling and understanding with implicit scene representation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15838-15847 (2021) \ No newline at end of file diff --git a/2024/Implicit Neural Models to Extract Heart Rate from Video/images.zip b/2024/Implicit Neural Models to Extract Heart Rate from Video/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..10a606b31ffa5e03f1582a885e339dbcc8fdc2be --- /dev/null +++ b/2024/Implicit Neural Models to Extract Heart Rate from Video/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:375e2204c1874620388e3e07b5c0d27f4a31b4b2e3e2779541aba491afd17bb2 +size 454327 diff --git a/2024/Implicit Neural Models to Extract Heart Rate from Video/layout.json b/2024/Implicit Neural Models to Extract Heart Rate from Video/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..57dc4bca593c54e21a064c69903d3629c1596f97 --- /dev/null +++ b/2024/Implicit Neural Models to Extract Heart Rate from Video/layout.json @@ -0,0 +1,11966 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 145, + 111, + 470, + 146 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 111, + 470, + 146 + ], + "spans": [ + { + "bbox": [ + 145, + 111, + 470, + 146 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "content": "Pradyumna Chari" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "inline_equation", + "content": "^{*1}" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "content": ", Anirudh Bindiganavale Harish" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "inline_equation", + "content": "^{*,\\dagger,2}" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "content": ", Adnan Armouti" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "inline_equation", + "content": "^{\\dagger,3}" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "content": ", Alexander Vilesov" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "content": ", Sanjit Sarda" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "content": ", Laleh Jalilian" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "text", + "content": ", and Achuta Kadambi" + }, + { + "bbox": [ + 132, + 167, + 481, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 146, + 201, + 468, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 201, + 468, + 234 + ], + "spans": [ + { + "bbox": [ + 146, + 201, + 468, + 234 + ], + "type": "text", + "content": "1 University of California Los Angeles, Los Angeles CA 90095, USA {pradyumnac,vilesov,sanjitsarda}@ucla.edu, ljalilian@mednet.ucla.edu achuta@ee.ucla.edu" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 201, + 395, + 278 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 217, + 235, + 395, + 256 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 235, + 395, + 256 + ], + "spans": [ + { + "bbox": [ + 217, + 235, + 395, + 256 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 217, + 235, + 395, + 256 + ], + "type": "text", + "content": " Rice University, Houston TX 77005, USA anirudhbh@rice.edu" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 218, + 257, + 394, + 278 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 257, + 394, + 278 + ], + "spans": [ + { + "bbox": [ + 218, + 257, + 394, + 278 + ], + "type": "text", + "content": "3 Cornell Tech, New York NY 10044, USA armouti@cs.cornell.edu" + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "text" + }, + { + "type": "image", + "bbox": [ + 168, + 309, + 447, + 446 + ], + "blocks": [ + { + "bbox": [ + 168, + 309, + 447, + 446 + ], + "lines": [ + { + "bbox": [ + 168, + 309, + 447, + 446 + ], + "spans": [ + { + "bbox": [ + 168, + 309, + 447, + 446 + ], + "type": "image", + "image_path": "00622ca2cfb014a85ba57d3c385dbd79647973181f4db289846517fe5bf7d902.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 455, + 482, + 511 + ], + "lines": [ + { + "bbox": [ + 130, + 455, + 482, + 511 + ], + "spans": [ + { + "bbox": [ + 130, + 455, + 482, + 511 + ], + "type": "text", + "content": "Fig. 1: Prior implicit neural models represent scenes for diverse applications. We propose an implicit neural representation (INR) to decompose face videos and isolate blood flow information. Our INR decomposes input videos into visual appearance and blood flow (\"A-B decomposition\"). The decomposed data aids in estimating the remote photoplethysmography (rPPG) signal and heart rate." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 558, + 455, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 558, + 455, + 647 + ], + "spans": [ + { + "bbox": [ + 159, + 558, + 455, + 647 + ], + "type": "text", + "content": "Abstract. Scene representation networks, or implicit neural representations (INR) have seen a range of success in numerous image and video applications. However, being universal function fitters, they fit all variations in videos without any selectivity. This is particularly a problem for tasks such as remote plethysmography, the extraction of heart rate information from face videos. As a result of low native signal to noise ratio, previous signal processing techniques suffer from poor performance, while previous learning-based methods have improved performance but" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 654, + 365, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 654, + 365, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 654, + 365, + 665 + ], + "type": "text", + "content": "* - Contributed Equally, †- Work done when at UCLA" + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 159, + 117, + 455, + 283 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 117, + 455, + 283 + ], + "spans": [ + { + "bbox": [ + 159, + 117, + 455, + 283 + ], + "type": "text", + "content": "suffer from hallucinations that mitigate generalizability. Directly applying prior INRs cannot remedy this signal strength deficit, since they fit to both the signal as well as interfering factors. In this work, we introduce an INR framework that increases this plethysmograph signal strength. Specifically, we leverage architectures to have selective representation capabilities. We are able to decompose the face video into a blood plethysmograph component, and a face appearance component. By inferring the plethysmograph signal from this blood component, we show state-of-the-art performance on out-of-distribution samples without sacrificing performance for in-distribution samples. We implement our framework on a custom-built multiresolution hash encoding backbone to enable practical dataset-scale representations through a 50x speed-up over traditional INRs. We also present a dataset of optically challenging out-of-distribution scenes to test generalization to real-world scenarios. Code and data may be found at https://implicitppg.github.io/." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 293, + 453, + 304 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 293, + 453, + 304 + ], + "spans": [ + { + "bbox": [ + 160, + 293, + 453, + 304 + ], + "type": "text", + "content": "Keywords: Implicit neural representations " + }, + { + "bbox": [ + 160, + 293, + 453, + 304 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 293, + 453, + 304 + ], + "type": "text", + "content": " Remote plethysmography" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 326, + 230, + 339 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 230, + 339 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 230, + 339 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 354, + 482, + 425 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 425 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 425 + ], + "type": "text", + "content": "Neural scene representations have gained significant prominence over recent years. The ability to use neural networks as function fitters and encode scene information within their weights has found considerable applications for tasks such as image representations [20, 27, 40, 44], scene representations [15, 39, 54, 61], radiance fields [18, 29, 30] and video representations [7, 9, 25]. Consistent among these applications is the need to fit all possible scene variations without selectivity." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 426, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 544 + ], + "type": "text", + "content": "However, for the task of remote plethysmography, the contactless monitoring of heart rate information from face videos via subtle skin color variations, selecting for the blood flow is required. Therefore, this indiscriminate fitting behavior of current implicit neural representations (INRs) is a significant drawback: both the signal and interfering factors will get fitted. Prior work [6,16,36,49] has established the low Signal-to-Noise Ratio (SNR) of the measurement (in this case, the facial image) as the source of remote photoplethysmography (rPPG) performance degradation. Previous methods generally fall into two categories: signal processing-based or deep learning-based. These two classes have established a trade-off between domain generalizability and in-distribution performance." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 641 + ], + "type": "text", + "content": "Signal processing techniques improve signal strength by using model-based assumptions (such as band-pass filters or simple coloration models [11, 51]). These usually lead to relatively larger heart rate estimation errors. Recently, learning-based methods [8, 57, 58] for plethysmography have achieved state-of-the-art (SOTA) performance through end-to-end data-driven approaches. However, these methods suffer from generalization issues, where samples that are \"out-of-distribution\" (OOD) may show unspecified and often undesirable behavior due to overfitting." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": "We propose an INR-based framework to improve the plethysmograph signal strength in facial videos before estimating the blood volume pulse signal." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 237, + 114, + 375, + 248 + ], + "blocks": [ + { + "bbox": [ + 237, + 114, + 375, + 248 + ], + "lines": [ + { + "bbox": [ + 237, + 114, + 375, + 248 + ], + "spans": [ + { + "bbox": [ + 237, + 114, + 375, + 248 + ], + "type": "image", + "image_path": "981bff1c20bb3bbe04017c3e5d096712d4b80384e8e7a6e90cf01ede2d71da3b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 259, + 482, + 316 + ], + "lines": [ + { + "bbox": [ + 130, + 259, + 482, + 316 + ], + "spans": [ + { + "bbox": [ + 130, + 259, + 482, + 316 + ], + "type": "text", + "content": "Fig.2: Our implicit representation for rPPG achieves Pareto-optimality across out-of-distribution (OOD) performance and inter-distribution parity compared to prior algorithmic and learning-based methods. It performs better on OOD samples while maximizing parity between in-distribution and OOD performance. Table 1 shows metrics used for this plot. Higher is better along both axes." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "text", + "content": "Specifically, we introduce a new Appearance-Blood (or " + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "text", + "content": ") decomposition for facial video data. The decomposition is designed to improve the plethysmograph signal quality across the face. We show that the representation capacity of carefully designed INRs, with architectures motivated by light transport principles of the problem (namely the nature of subtle skin color variations due to the plethysmograph signal), can enable such a decomposition, allowing isolation of the relevant blood component. Conventional INRs, however, are slow to train, thereby making them intractable for dataset-scale analyses. We use multiresolution hash encodings inspired by [32] to facilitate fast " + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 341, + 482, + 496 + ], + "type": "text", + "content": " decomposition. To the best of our knowledge, we propose the first camera-based rPPG method that uses implicit neural representations as a critical component of the estimation pipeline. Different from prior methods, we focus on both in and out-of-distribution performance (specifically, optically challenging OOD)." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 498, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 605 + ], + "type": "text", + "content": "On a self-collected dataset of optically challenging OOD scenes, our method surpasses existing algorithmic and learning-based methods (Figure 2) with reliable plethysmograph and heart rate estimates. Notably, we achieve this OOD performance gain without compromising on in-distribution performance on rPPG datasets (Figure 1). As an additional outcome, we can obtain high-fidelity estimates of the plethysmograph signal strength (referred to as neural signal strength mask) across the face that generalize with high fidelity to OOD scenes and settings such as face paint, masks, glasses, and even reflection from windows. In summary, our contributions are as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "text", + "content": "1. We formulate Appearance-Blood " + }, + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "(\\mathcal{A} - \\mathcal{B})" + }, + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "text", + "content": " decomposition as a means of enhancing plethysmograph signal strength. We show that carefully designed implicit neural representations can serve as efficient " + }, + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 136, + 617, + 482, + 665 + ], + "type": "text", + "content": " decomposers and propose a fast method to achieve this." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 211, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 211, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 136, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 136, + 116, + 479, + 163 + ], + "type": "text", + "content": "2. This decomposition is the foundation for our proposed rPPG estimation method. On our optically challenging OOD dataset, our method shows significant improvements in performance over prior algorithmic and learning-based methods (Figure 2) without losing out on in-distribution performance." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 136, + 163, + 480, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 163, + 480, + 199 + ], + "spans": [ + { + "bbox": [ + 136, + 163, + 480, + 199 + ], + "type": "text", + "content": "3. An optically challenging test dataset, consisting of 104 videos (" + }, + { + "bbox": [ + 136, + 163, + 480, + 199 + ], + "type": "inline_equation", + "content": "\\approx" + }, + { + "bbox": [ + 136, + 163, + 480, + 199 + ], + "type": "text", + "content": " 1 hour of recorded data) across various optically challenging and OOD configurations, is collected and will be released upon acceptance of this work." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 218, + 190, + 229 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 218, + 190, + 229 + ], + "spans": [ + { + "bbox": [ + 133, + 218, + 190, + 229 + ], + "type": "text", + "content": "1.1 Scope" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 238, + 482, + 382 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 238, + 482, + 382 + ], + "spans": [ + { + "bbox": [ + 130, + 238, + 482, + 382 + ], + "type": "text", + "content": "This work establishes the effectiveness of fast INRs to learn desired components of video data selectively - in this case, plethysmograph information. Other applications, such as video-based blood oxygenation and blood pressure estimation, require accurate plethysmography as a necessary first step. However, these applications are open research problems and is outside this work's scope. Furthermore, motion-robust rPPG is an open challenge and requires extensive research on its own. While this is not our primary goal, and our proposed method is not designed to combat motion artifacts, we test performance on motion videos and find our method competitive (supplement). Finally, we acknowledge that OOD is multi-faceted. This work primarily focused on optically challenging scenes and achieved SOTA results while secondarily validating performance on real-world obfuscations such as talking (and associated motions)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 400, + 237, + 412 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 400, + 237, + 412 + ], + "spans": [ + { + "bbox": [ + 132, + 400, + 237, + 412 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 426, + 482, + 546 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 546 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 546 + ], + "type": "text", + "content": "Implicit Neural Representations. Implicit neural representations (INRs) are an increasingly prevalent method to represent scenes. Examples settings include image representations [20, 27, 40, 44], video representations [7, 9, 25], and 3-D scene representations [15, 39, 54, 61]. Specifically, this work is interested in the class of video-based representations. These include methods that use convolutional networks [7], phase-based motion-adjustable representation [25], space-time super-resolution [9] and flow fields for space-time viewpoint synthesis [13, 19]. We take inspiration from these prior methods but have different goals. We aim to use the video representation capacity of implicit networks to isolate imperceptible physiological phenomena, such as plethysmograph signals." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 557, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 665 + ], + "type": "text", + "content": "Fast Implicit Neural Representations. A critical drawback of INRs is the time taken to train the networks for dataset scale experimentation and inference. Recent work, however, has taken a step toward alleviating this concern. [28] have proposed using a latent feature-based modulation network to generalize implicit representation models to model a broader range of images for faster convergence. Further, specialized toolboxes have been released to accelerate the training time of NeRFs [18,32]. In this work, we are interested in employing [32]'s parametric multiresolution spatial hash encodings as inputs to a shallow MLP. Using this foundation, we extend the framework to video INRs, specifically for" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "generalizable, robust camera-based plethysmography. This technique can achieve orders of magnitude improvements in training time for INRs." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 151, + 482, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 151, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 151, + 482, + 344 + ], + "type": "text", + "content": "Remote Plethysmography. Heart rate estimation using rPPG has been actively studied. Early methods were based on algorithmic principles of color variations [11, 51] or motion based on Newtonian reaction to blood flow [4]. Such methods are not limited to use with RGB cameras. Near Infrared (NIR) Imaging with active illumination has been employed to combat the effects of unreliable illumination in the visible (VIS) spectrum [24]. Augmented reality [14] is another avenue for this research. Deep learning approaches have also been utilized to attain SOTA results. [8] used an attention-based Convolutional Neural Network (CNN) while [57] introduced spatio-temporal CNNs. Other work has extended these architectures [35], including using transformers [58], incorporated meta-learning [17], improved PPG waveform characteristics [45], and augmented rPPG datasets with synthetic examples [3, 53]. Another class of methods focuses on improving equity between groups, such as participants of different skin tones [16, 36]. These include algorithmic methods [6] or multimodal fusion methods [49]. Methods for assessing and improving equity are not restricted to rPPG and extend to a range of computer vision problems [5, 16, 42, 52, 56, 59]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 360, + 366, + 376 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 360, + 366, + 376 + ], + "spans": [ + { + "bbox": [ + 132, + 360, + 366, + 376 + ], + "type": "text", + "content": "3 " + }, + { + "bbox": [ + 132, + 360, + 366, + 376 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 132, + 360, + 366, + 376 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 132, + 360, + 366, + 376 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 360, + 366, + 376 + ], + "type": "text", + "content": " Decomposition and Optimality" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 384, + 480, + 408 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 480, + 408 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 480, + 408 + ], + "type": "text", + "content": "We begin with describing the mathematical underpinnings of rPPG and propose the notion of appearance-blood " + }, + { + "bbox": [ + 130, + 384, + 480, + 408 + ], + "type": "inline_equation", + "content": "(\\mathcal{A} - \\mathcal{B})" + }, + { + "bbox": [ + 130, + 384, + 480, + 408 + ], + "type": "text", + "content": " decomposition and its benefits." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 409, + 480, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 409, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 409, + 480, + 468 + ], + "type": "text", + "content": "Fundamentally, the rPPG signal is subtle, making its estimation difficult. While contemporary methods [8, 57, 58] circumvent this through deep networks, they fare poorly on OOD samples. This necessitates a generalizable method capable of extracting the rPPG signal without relying on domain-specific features that tend to overfit. This motivates our functional decomposition." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": "Given spatial coordinates " + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\mathbf{x} \\in [-0.5, 0.5]^2" + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": ", and temporal coordinate " + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "inline_equation", + "content": "t \\in [-0.5, 0.5]" + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": ", the face videos are interpreted as RGB color fields " + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "inline_equation", + "content": "\\mathcal{C}(\\mathbf{x}, t)" + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": ". This color field consists of specular reflections that act as interference and diffuse components arising from subsurface scattering containing plethysmograph information. We wish to decompose the color signal into a signal amplitude component, " + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "inline_equation", + "content": "p_m(\\mathbf{x}, t)" + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": ", and a temporal plethysmograph signal " + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "inline_equation", + "content": "p_i(t)" + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": ", our desired signal. However, the relation between " + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "inline_equation", + "content": "p_m(\\cdot, \\cdot)" + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "inline_equation", + "content": "p_i(\\cdot)" + }, + { + "bbox": [ + 130, + 468, + 482, + 552 + ], + "type": "text", + "content": " is non-linear in nature." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 146, + 552, + 480, + 564 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 552, + 480, + 564 + ], + "spans": [ + { + "bbox": [ + 146, + 552, + 480, + 564 + ], + "type": "text", + "content": "Under reasonable assumptions, we show color signals can be decomposed as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 224, + 577, + 480, + 589 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 224, + 577, + 480, + 589 + ], + "spans": [ + { + "bbox": [ + 224, + 577, + 480, + 589 + ], + "type": "interline_equation", + "content": "\\mathcal {C} (\\mathbf {x}, t) = \\mathcal {A} (\\mathbf {x}, t) + \\mathcal {B} (\\mathbf {x}, t) + \\mathbf {v _ {n}} (\\mathbf {x}, t), \\tag {1}", + "image_path": "a3074ea53f4448ffdb81e0e2b3636b719704c1781b9bcc86529fb30aa250d565.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A}(\\mathbf{x},t)" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " represents the facial appearance (or " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "-function) - including specular highlights - which is interference. " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{B}(\\mathbf{x},t)" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ", the blood component (or " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "-function), contains the spatiotemporally varying color changes arising out of blood flow (plethysmography) that incorporates " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "p_m(\\cdot ,\\cdot)" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "p_i(\\cdot)" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{v}_{\\mathbf{n}}(\\cdot ,\\cdot)" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " represents the measurement noise in the process. We will refer to this decomposition as the " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " decomposition. Then, the following Theorem holds." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "text", + "content": "Theorem 1: The " + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "text", + "content": " decomposition results in a " + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "text", + "content": "-function with a Signal to Interference & Noise Ratio " + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "SINR_{\\mathcal{B}}(\\mathbf{x},t)" + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "text", + "content": ", such that " + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "SINR_{\\mathcal{B}}(\\mathbf{x},t) \\geq SINR_{\\mathcal{C}}(\\mathbf{x},t)" + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "text", + "content": ". That is, the " + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 132, + 116, + 479, + 152 + ], + "type": "text", + "content": " decomposition leads to an SINR gain." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 152, + 479, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 152, + 479, + 210 + ], + "spans": [ + { + "bbox": [ + 132, + 152, + 479, + 210 + ], + "type": "text", + "content": "Note that Theorem 1 is an existence proof. It describes the existence of SINR benefits as a result of ideal decomposition, motivating its necessity in our real applications. Additionally, while SINR is computed across time, we also wish to model temporal variations due to lighting, pose changes, etc. This is what " + }, + { + "bbox": [ + 132, + 152, + 479, + 210 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 132, + 152, + 479, + 210 + ], + "type": "text", + "content": "-dependence for SINR denotes." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "text", + "content": "Corollary 1: Given an " + }, + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "text", + "content": " decomposed video field " + }, + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "inline_equation", + "content": "\\mathcal{C}(\\mathbf{x},t)" + }, + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "text", + "content": ", the Maximal Ratio Combining (MRC)-optimal estimate for the plethysmograph " + }, + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "inline_equation", + "content": "p_i(t)" + }, + { + "bbox": [ + 132, + 212, + 479, + 236 + ], + "type": "text", + "content": " is given by," + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 227, + 244, + 479, + 269 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 244, + 479, + 269 + ], + "spans": [ + { + "bbox": [ + 227, + 244, + 479, + 269 + ], + "type": "interline_equation", + "content": "\\widehat {p _ {i} ^ {*}} (t) = \\int_ {\\mathbf {x} \\in \\Omega} S I N R _ {\\mathcal {B}} (\\mathbf {x}, t) \\mathcal {B} (\\mathbf {x}, t) d \\mathbf {x}, \\tag {2}", + "image_path": "6ece38fa05458429ca7de18a3a263349dc4fed14d15c6a90ea690ef632f462e6.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 276, + 405, + 289 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 276, + 405, + 289 + ], + "spans": [ + { + "bbox": [ + 132, + 276, + 405, + 289 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 276, + 405, + 289 + ], + "type": "inline_equation", + "content": "\\Omega = [-0.5, 0.5]^2" + }, + { + "bbox": [ + 132, + 276, + 405, + 289 + ], + "type": "text", + "content": ", the domain of " + }, + { + "bbox": [ + 132, + 276, + 405, + 289 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 132, + 276, + 405, + 289 + ], + "type": "text", + "content": " as previously defined." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 300, + 479, + 324 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 479, + 324 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 479, + 324 + ], + "type": "text", + "content": "This is the notion of near-optimal plethysmography we aim to achieve. Detailed derivations for this section can be found in the supplement." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 341, + 378, + 353 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 341, + 378, + 353 + ], + "spans": [ + { + "bbox": [ + 132, + 341, + 378, + 353 + ], + "type": "text", + "content": "3.1 Optimal Plethysmography and Uncertainty" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "spans": [ + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": "Equation 2 can also be interpreted in the context of uncertainty minimization [38]. In a discrete setting with " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": " pixel locations " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{x}\\}_{i = 1}^{N}" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": ", each pixel is viewed as a sensor and the signal strength, " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "SINR_{\\mathcal{B}}(\\mathbf{x},t)" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": " is a proxy for the uncertainty or unreliability. Then the problem of estimating " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "\\widehat{p_i^*}(t)" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": " can be interpreted as Bayesian inference. With assumptions on prior and posterior distributions, it can be shown that the posterior " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "\\widehat{p_i^*}(t)" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": " is Gaussian with mean " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "\\frac{\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)\\cdot\\mathcal{B}(\\mathbf{x}_i,t)}{\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)}" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": " (best posterior estimate, a discretized and normalized version of Equation 2) and variance " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "1 / (\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t))" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": ". Since Equation 2 represents maximal ratio combining, " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "\\sum_{i = 1}^{N}SINR_{\\mathcal{B}}(\\mathbf{x}_i,t)\\propto SINR_{\\widehat{p_i^*}(t)}" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": " ([43], Equation 31, 32), then, uncertainty (or the variance in the posterior) is inversely proportional to SINR of " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "\\widehat{p_i^*}(t)" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": ". Optimal plethysmography therefore becomes akin maximization of SINR, or minimization of uncertainty of " + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "inline_equation", + "content": "\\widehat{p_i^*}(t)" + }, + { + "bbox": [ + 132, + 359, + 480, + 517 + ], + "type": "text", + "content": ". Please refer to the supplement for derivations." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 534, + 345, + 548 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 345, + 548 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 345, + 548 + ], + "type": "text", + "content": "4 " + }, + { + "bbox": [ + 132, + 534, + 345, + 548 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 132, + 534, + 345, + 548 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 132, + 534, + 345, + 548 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 534, + 345, + 548 + ], + "type": "text", + "content": " Decomposition Using INRs" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "text", + "content": "This section explores conditions for " + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "text", + "content": " decomposition function approximators. We first establish necessary conditions that " + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 559, + 479, + 594 + ], + "type": "text", + "content": " decomposers must meet and then explore how INRs can be designed to perform such decomposition." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 611, + 291, + 623 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 291, + 623 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 291, + 623 + ], + "type": "text", + "content": "4.1 Functional Decomposition" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": "Consider two functions, " + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}})" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": ", parameterized by " + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\Theta_{\\mathcal{A}}" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\Theta_{\\mathcal{B}}" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": ", that aim to represent " + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A}(\\mathbf{x},t)" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{B}(\\mathbf{x},t)" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": " respectively. To perform an " + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 628, + 479, + 665 + ], + "type": "text", + "content": " decomposition, we wish to find functions that satisfying:" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 209, + 114, + 403, + 181 + ], + "blocks": [ + { + "bbox": [ + 209, + 114, + 403, + 181 + ], + "lines": [ + { + "bbox": [ + 209, + 114, + 403, + 181 + ], + "spans": [ + { + "bbox": [ + 209, + 114, + 403, + 181 + ], + "type": "image", + "image_path": "9bdac6ca845073d2a7606d954d054aba72b5f815ac8f71e5abf80b5c62d81e4e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "lines": [ + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "spans": [ + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "type": "text", + "content": "Fig. 3: Sinusoidal Representation Networks (SRNs) can represent both " + }, + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "type": "text", + "content": "-functions, while phase-based methods only represent the " + }, + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 188, + 482, + 232 + ], + "type": "text", + "content": "-function. (a) SRNs, such as [44], can capture PPG color variations almost perfectly, while (b) phase-based motion representations, such as [25] are unable to capture it." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 238, + 272, + 375, + 287 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 272, + 375, + 287 + ], + "spans": [ + { + "bbox": [ + 238, + 272, + 375, + 287 + ], + "type": "interline_equation", + "content": "d _ {\\mathcal {A}} (\\hat {\\mathcal {A}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {A}} ^ {*}), \\mathcal {A} (\\mathbf {x}, t)) \\leq \\epsilon_ {\\mathcal {A}},", + "image_path": "68edff94756c56962cd0b27363d0b4255d9689b02e3e0d6cca8723c5c52be05b.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 244, + 289, + 481, + 304 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 289, + 481, + 304 + ], + "spans": [ + { + "bbox": [ + 244, + 289, + 481, + 304 + ], + "type": "interline_equation", + "content": "d _ {\\mathcal {B}} \\left(\\hat {\\mathcal {B}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {B}} ^ {*}), \\mathcal {B} (\\mathbf {x}, t)\\right) \\leq \\epsilon_ {\\mathcal {B}}, \\tag {3}", + "image_path": "ee18605fa759964a617b53ad62c7ea3f73f72ca1b207300dab63865c914b800e.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 242, + 306, + 374, + 321 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 306, + 374, + 321 + ], + "spans": [ + { + "bbox": [ + 242, + 306, + 374, + 321 + ], + "type": "interline_equation", + "content": "d _ {\\mathcal {B}} (\\hat {\\mathcal {A}} (\\mathbf {x}, t; \\boldsymbol {\\Theta} _ {\\mathcal {A}} ^ {*}), \\mathcal {B} (\\mathbf {x}, t)) \\geq \\epsilon_ {\\mathcal {B}}.", + "image_path": "507351df276f17d1b96f5a5120c13ba7cd42f2d5b440fd65e75efed8c683b2c4.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "spans": [ + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "inline_equation", + "content": "\\Theta_{\\mathcal{A}}^{*}" + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "inline_equation", + "content": "\\Theta_{\\mathcal{B}}^{*}" + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": " are optimal parameters, and " + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "inline_equation", + "content": "d_{\\mathcal{A}}(\\cdot ,\\mathcal{A}(\\mathbf{x},t))" + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "inline_equation", + "content": "d_{\\mathcal{B}}(\\cdot ,\\mathcal{B}(\\mathbf{x},t))" + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": " are some component-dependent metric distances. This quantifies the requirement that " + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})" + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": " is able to represent the " + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": "-function but not the " + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 131, + 327, + 480, + 363 + ], + "type": "text", + "content": "-function." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 363, + 481, + 388 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 363, + 481, + 388 + ], + "spans": [ + { + "bbox": [ + 131, + 363, + 481, + 388 + ], + "type": "text", + "content": "We choose distance measures, " + }, + { + "bbox": [ + 131, + 363, + 481, + 388 + ], + "type": "inline_equation", + "content": "d_{\\mathcal{A}}(\\mathcal{F}, \\mathcal{A}(\\mathbf{x}, t)) = ||\\mathcal{F} - \\mathcal{A}(\\mathbf{x}, t)||_2" + }, + { + "bbox": [ + 131, + 363, + 481, + 388 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 363, + 481, + 388 + ], + "type": "inline_equation", + "content": "\\forall \\mathcal{F}" + }, + { + "bbox": [ + 131, + 363, + 481, + 388 + ], + "type": "text", + "content": ", such that the appearance metric distance rewards pixel-wise closeness. Similarly," + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 211, + 395, + 481, + 408 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 395, + 481, + 408 + ], + "spans": [ + { + "bbox": [ + 211, + 395, + 481, + 408 + ], + "type": "interline_equation", + "content": "d _ {\\mathcal {B}} (\\mathcal {F}, \\mathcal {B} (\\mathbf {x}, t)) = | H (\\mathcal {F}) - H (\\mathcal {B} (\\mathbf {x}, t)) |, \\forall \\mathcal {F}, \\tag {4}", + "image_path": "3b4b7dac88357b6bd4c68843b0d329d33c0e52c4fbb98087b8b999028372de1d.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "spans": [ + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "inline_equation", + "content": "H(\\cdot)" + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "text", + "content": " is a heart rate estimator function. By finding functions that satisfy the constraints in Equation 3, we can achieve " + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "text", + "content": " decomposition by sequentially learning " + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{A}} (\\mathbf{x},t;\\boldsymbol {\\Theta}_{\\mathcal{A}})" + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{B}} (\\mathbf{x},t;\\boldsymbol {\\Theta}_{\\mathcal{B}})" + }, + { + "bbox": [ + 131, + 415, + 482, + 464 + ], + "type": "text", + "content": ". A detailed mathematical analysis of this formulation is deferred to the supplement." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 479, + 354, + 493 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 354, + 493 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 354, + 493 + ], + "type": "text", + "content": "4.2 Identifying Implicit " + }, + { + "bbox": [ + 132, + 479, + 354, + 493 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 132, + 479, + 354, + 493 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 132, + 479, + 354, + 493 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 479, + 354, + 493 + ], + "type": "text", + "content": " Decomposers" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "text", + "content": "Prior work on video magnification through Laplacian [55] and phase-based [50] pyramids is instructive. While the Laplacian pyramid-based approach [55] can magnify blood flow due to color changes, the phase-based method [50] cannot magnify blood flow. With this intuition, we use the metrics defined in the previous section to identify approximations for " + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "text", + "content": " & " + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "text", + "content": ". We first look at phase-modulated INRs for motion modeling [25]. The key inductive bias here is parameterizing time as phase modulation in positional encodings [30,46]." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 582, + 482, + 618 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 582, + 482, + 618 + ], + "spans": [ + { + "bbox": [ + 131, + 582, + 482, + 618 + ], + "type": "text", + "content": "Empirical Claim 1 (based on observations): Phase-based implicit models (models with phase-encoded input embeddings) cannot represent plethysmograph signals accurately, in terms of the metric in Equation 4. (Figure 3(b))" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 618, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 618, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 131, + 618, + 482, + 641 + ], + "type": "text", + "content": "While this can be viewed as a limitation of phase-based INRs, we use it to our advantage: phase-based models can be " + }, + { + "bbox": [ + 131, + 618, + 482, + 641 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 618, + 482, + 641 + ], + "type": "text", + "content": "-function estimators (Equation 3)." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "text", + "content": "We next look at sinusoid representation networks (SRNs), such as [20,40,44]. Empirical Claim 2: SRNs are good " + }, + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 641, + 482, + 666 + ], + "type": "text", + "content": "-function approximators. (Figure 3(a))" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 482, + 178 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 482, + 178 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 482, + 178 + ], + "type": "image", + "image_path": "47b2bc66f37307107f5f06b399d3a9a7c4860c9b978aeaf47808ccbdbbdcc70e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "lines": [ + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "type": "text", + "content": "Fig. 4: To enable fast " + }, + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "type": "text", + "content": " decomposition, we use implicit neural representations as decomposing function fitters. Training is done sequentially: first, the cascaded appearance model learns the " + }, + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "type": "text", + "content": "-function. Then, the appearance model is frozen, and the residual model learns the " + }, + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 186, + 482, + 242 + ], + "type": "text", + "content": "-function, thereby completing the decomposition. The use of multiresolution hash encodings makes dataset-scale decomposition viable." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "spans": [ + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "text", + "content": "However, being able to represent both " + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "text", + "content": " makes SRNs incapable of " + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "text", + "content": " decomposition. This pair exactly satisfy the constraints in Equation 3. Hence, Empirical Claim 3: A phase-based model can serve as " + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}}^{*})" + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "text", + "content": ", while an SRN can serve as " + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}}^{*})" + }, + { + "bbox": [ + 130, + 264, + 482, + 313 + ], + "type": "text", + "content": ", when trained sequentially." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "text", + "content": "Justifications for all claims may be found in the supplement. However, naive use of prior work [25, 44] for " + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "inline_equation", + "content": "\\mathcal{A} - \\mathcal{B}" + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "text", + "content": " decomposition poses a training time problem. Using variants of [25] and [44] as " + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "text", + "content": "-function estimators, respectively, we noted a training time of 20 minutes for a 2-second long video with a resolution of " + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "inline_equation", + "content": "128 \\times 128" + }, + { + "bbox": [ + 130, + 314, + 482, + 374 + ], + "type": "text", + "content": ". Such compute times are infeasible for dataset-scale experiments." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 391, + 391, + 404 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 391, + 391, + 404 + ], + "spans": [ + { + "bbox": [ + 131, + 391, + 391, + 404 + ], + "type": "text", + "content": "5 Hash Encodings for " + }, + { + "bbox": [ + 131, + 391, + 391, + 404 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 391, + 391, + 404 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 131, + 391, + 391, + 404 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 131, + 391, + 391, + 404 + ], + "type": "text", + "content": " Decomposition" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "text", + "content": "In this section, we propose high-speed INR-based " + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "text", + "content": " decomposition. Specifically, to address the slower speeds of traditional INRs, we pivot to a faster framework and show design INRs for " + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 415, + 481, + 450 + ], + "type": "text", + "content": " decomposition within this framework." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "spans": [ + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "type": "text", + "content": "Inspired by recent work in instant neural graphics primitives [32], we propose using a multiresolution hash input encoding (MRHE)-based framework for " + }, + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "type": "text", + "content": " decomposition. A critical aspect is using the spatial hash function for video fields. Spatial hash functions [34, 47] are typically 2-D and 3-D extensions to the prevalent hash tables. We use this principle to model the spatio-temporal coordinates " + }, + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "type": "inline_equation", + "content": "(x,y,t)" + }, + { + "bbox": [ + 130, + 451, + 482, + 535 + ], + "type": "text", + "content": " as a 3-D space. We posit that the 3-D spatial hash function can effectively model this space without violating any temporal constraints." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 550, + 365, + 563 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 550, + 365, + 563 + ], + "spans": [ + { + "bbox": [ + 131, + 550, + 365, + 563 + ], + "type": "text", + "content": "5.1 Cascaded Appearance Model " + }, + { + "bbox": [ + 131, + 550, + 365, + 563 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{A}} (\\mathbf{x},t;\\Theta_{\\mathcal{A}})" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "As discussed in Section 4.2, phase-based INRs [25], are efficient " + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "-function representatives. However, a direct translation of this concept to MRHEs is intractable, i.e., replacing the sinusoidal positional encodings with the faster MRHE makes phase incorporation infeasible. For sinusoidal encodings, phase modulations are akin to offsets. Thus, we propose to incorporate the time-to-phase conversion through learned spatiotemporal offset. The appearance model has two stages: the first maps spatio-temporal coordinates to positional offsets in the MRHE. The second is queried using the offset positions to generate video frames." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 479, + 184 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 479, + 184 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 479, + 184 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 479, + 184 + ], + "type": "image", + "image_path": "8a6addf1a85ee23bc7a38ec58bee2c030ad5e778f9c4a894f2634a39878caab8.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "lines": [ + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "type": "text", + "content": "Fig. 5: Using the estimated " + }, + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "type": "text", + "content": "-function with the original video, we learn high-fidelity neural signal strength masks. The network takes the original RGB frames and the " + }, + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "type": "text", + "content": "-function estimate as inputs and returns a spatial strength mask. Training is supervised through an auxiliary 1-D CNN whose training target is the prediction of an accurate plethysmograph. The 1-D CNN is discarded post-training, and the learned mask model is used at inference time on the " + }, + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 192, + 482, + 258 + ], + "type": "text", + "content": "-function to estimate rPPG." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "text", + "content": "Rather than considering a single offset vector in " + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "inline_equation", + "content": "\\mathbb{R}^2" + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "text", + "content": " for the entire frame (as [25] do for phase estimation), we estimate the offset, " + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "inline_equation", + "content": "\\varDelta\\mathbf{x}\\in\\mathbb{R}^{2}" + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "text", + "content": ", for each point in the spatio-temporal grid. That is, " + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "inline_equation", + "content": "\\varDelta\\mathbf{x}=f_{\\mathcal{A}_1}(\\mathbf{x},t)" + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "text", + "content": ". The estimated offsets are added to the original spatial coordinates, which are then used to query a second model " + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "inline_equation", + "content": "f_{\\mathcal{A}_2}(\\mathbf{x}+\\varDelta\\mathbf{x})" + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "text", + "content": ". Translating Empirical Claim 1 from phase-based to offset-based models, we summarize our offset-adjustable cascaded appearance model as " + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{A}}(\\mathbf{x},t;\\Theta_{\\mathcal{A}})=f_{\\mathcal{A}_2}(\\mathbf{x}+f_{\\mathcal{A}_1}(\\mathbf{x},t))" + }, + { + "bbox": [ + 130, + 282, + 482, + 380 + ], + "type": "text", + "content": ". The architecture and loss functions are elaborated on in the supplement. Figure 4 details this pipeline." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 396, + 381, + 410 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 396, + 381, + 410 + ], + "spans": [ + { + "bbox": [ + 131, + 396, + 381, + 410 + ], + "type": "text", + "content": "5.2 Residual Plethysmograph Model " + }, + { + "bbox": [ + 131, + 396, + 381, + 410 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}})" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "text", + "content": "We use a shallow sinusoidal model with MRHE, " + }, + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "inline_equation", + "content": "f_{\\mathcal{B}}(\\cdot ,\\cdot)" + }, + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "text", + "content": ", as our " + }, + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "text", + "content": "-function estimator. In line with Empirical Claim 3, we train the residual plethysmograph network sequentially after the cascaded appearance model. While training, we freeze the cascaded appearance model and train the residual plethysmography network on the difference between the original video input and the output of the estimated appearance field. That is, " + }, + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{B}} (\\mathbf{x},t;\\Theta_{\\mathcal{B}}) = f_{\\mathcal{B}}(\\mathbf{x},t)" + }, + { + "bbox": [ + 130, + 417, + 482, + 489 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 490, + 482, + 537 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 490, + 482, + 537 + ], + "spans": [ + { + "bbox": [ + 130, + 490, + 482, + 537 + ], + "type": "text", + "content": "The resulting residual plethysmograph model is shown to compensate for the cascaded appearance model's inability to retain the plethysmograph signal. When queried, the model yields a spatio-temporal estimate of the plethysmograph signal. The supplement contains relevant implementation details." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 555, + 259, + 568 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 555, + 259, + 568 + ], + "spans": [ + { + "bbox": [ + 131, + 555, + 259, + 568 + ], + "type": "text", + "content": "6 rPPG Estimation" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 582, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 629 + ], + "type": "text", + "content": "The previous section enables us to learn an estimator for " + }, + { + "bbox": [ + 130, + 582, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathcal{B}(\\mathbf{x},t)" + }, + { + "bbox": [ + 130, + 582, + 482, + 629 + ], + "type": "text", + "content": ", which is one part of the SINR optimality (and hence uncertainty minimization) from Equation 2. In this section, we proceed towards rPPG estimation from the " + }, + { + "bbox": [ + 130, + 582, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 582, + 482, + 629 + ], + "type": "text", + "content": "-function using high-fidelity neural signal masks." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "content": "Figure 5 highlights our proposed pipeline. Built on a 3-D CNN backbone, we indirectly supervise the spatial-attention-based network architecture with PPG waveforms. The model accepts the RGB input field concatenated with " + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{B}(\\mathbf{x}, t)" + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "content": " (a" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "text", + "content": "combined 6-channel input) to estimate a mask. Here, " + }, + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "inline_equation", + "content": "\\mathcal{I}(\\mathbf{x},t) = \\left[\\mathcal{C}(\\mathbf{x},t),\\hat{\\mathcal{B}} (\\mathbf{x},t)\\right]" + }, + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "inline_equation", + "content": "\\mathcal{I}(\\mathbf{x},t)" + }, + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "text", + "content": " is the input to our SINR mask estimator. Limited by compute requirements, we relax the temporal component and only consider the first 64 frames (of the 300 frames) to compute a single mask for 10 seconds. End-to-end the network can be summarized as " + }, + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "inline_equation", + "content": "SINR_{\\mathcal{B}}(\\mathbf{x}) = f_{SINR}\\left(\\mathcal{I}(\\mathbf{x},t);\\Theta_{SINR}\\right)" + }, + { + "bbox": [ + 130, + 114, + 479, + 181 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "text", + "content": "It must be noted that while we only estimate a single mask for a 10-second video, our experiments show that our method is competitive even in the presence of natural motions like talking and head swaying (supplement). The SINR mask " + }, + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "inline_equation", + "content": "S\\hat{N} R_{\\mathcal{B}}(\\mathbf{x})" + }, + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "text", + "content": " is directly used to compute " + }, + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "inline_equation", + "content": "\\mathbf{y}_1(t) = \\frac{\\sum_{\\mathbf{x}}S\\hat{N}R_{\\mathcal{B}}(\\mathbf{x})\\cdot I(\\mathbf{x},t)}{\\sum_{\\mathbf{x}}S\\hat{N}R_{\\mathcal{B}}(\\mathbf{x})}" + }, + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "inline_equation", + "content": "\\mathbf{y}_1(t)" + }, + { + "bbox": [ + 130, + 182, + 480, + 247 + ], + "type": "text", + "content": " is a time-series obtained from the 6-channel weighted spatial average of the input." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 248, + 480, + 355 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 480, + 355 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 480, + 355 + ], + "type": "text", + "content": "The 6-channel time-series signal is then passed through a 1-D CNN to yield a refined temporal estimate of the plethysmograph signal, " + }, + { + "bbox": [ + 130, + 248, + 480, + 355 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{p}}(t)" + }, + { + "bbox": [ + 130, + 248, + 480, + 355 + ], + "type": "text", + "content": ". Note that this network is not used to generate the final estimates but to supervise the neural signal strength mask model indirectly. The whole pipeline is supervised end-to-end with the ground truth plethysmograph signals. Implementation details and further mathematical formulation are provided in the supplement. As a result of the architecture being based on the optimality constraint in Equation 2, the inferred masks are expected to be near SINR-optimal. This also means near optimality in terms of uncertainty minimization." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "spans": [ + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "text", + "content": "As in prior learning approaches, the neural regressor overfits the waveform, making it sub-optimal for OOD. Hence, we only retain " + }, + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "inline_equation", + "content": "f_{SINR}(\\cdot)" + }, + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "text", + "content": ". The neural signal masks are combined with " + }, + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "inline_equation", + "content": "\\hat{B}" + }, + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "text", + "content": " to estimate the rPPG signal. We follow [48] and utilize only the green channel. Advanced algorithms [11,51] exist that utilize other channels, but they rely on the " + }, + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "inline_equation", + "content": "A" + }, + { + "bbox": [ + 130, + 356, + 480, + 428 + ], + "type": "text", + "content": "-function [11,51]. We perform detrending and Butterworth filtering for heart rate estimation as in [51]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 443, + 198, + 455 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 443, + 198, + 455 + ], + "spans": [ + { + "bbox": [ + 132, + 443, + 198, + 455 + ], + "type": "text", + "content": "7 Results" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 465, + 261, + 478 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 465, + 261, + 478 + ], + "spans": [ + { + "bbox": [ + 132, + 465, + 261, + 478 + ], + "type": "text", + "content": "7.1 Experimental Setup" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 483, + 479, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 483, + 479, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 483, + 479, + 567 + ], + "type": "text", + "content": "Datasets All methods are trained on two prior datasets [49, 53]. We also test our method on a self-collected Institutional Review Board (IRB) approved optically challenging OOD dataset. While we mainly focus on our dataset for OOD analysis, we also present results of cross-dataset inference. In our OOD dataset, we share full participant videos (without identifying information such as names), but only after recording contact details of dataset users. The dataset is released after potential users fill out a request form. Further details are in the supplement." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 581, + 489, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 489, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 489, + 665 + ], + "type": "text", + "content": "Evaluation Metrics We adopt the heart rate (HR) performance metrics from [49]. These include Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), Root Mean Squared Error (RMSE), Pearson correlation coefficient (r) and the Threshold test (T-Test) [2,31,33]. Since our goal is OOD generalization, we propose \"r-consistency\" as the similarity metric between the Pearson coefficients of the in-distribution (ID) and OOD samples, calculated as a harmonic mean. A detailed discussion of this metric is present in the supplement." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 150, + 179, + 463, + 346 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Performance on our OOD dataset considerably favors our method over prior work. We measure inter-distribution parity via the r-consistency metric. In-distribution values for r are given in Table 2. For algorithmic methods (non-learning), r-consistency on the datasets from [53] and [49] are shown in parenthesis. The best and second-best-performing numbers are highlighted in green and yellow, respectively." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 150, + 179, + 463, + 346 + ], + "lines": [ + { + "bbox": [ + 150, + 179, + 463, + 346 + ], + "spans": [ + { + "bbox": [ + 150, + 179, + 463, + 346 + ], + "type": "table", + "html": "
MethodOOD Performance MetricsInter-Distribution Parity Metric
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑r-consistency ↑
Green [48]31.547.809.84%14.560.47(0.54, 0.52)
POS [51]31.928.0211.06%14.870.47(0.60, 0.62)
CHROM [11]36.739.3212.62%15.850.40(0.53, 0.55)
ICA [41]31.158.1710.50%15.320.41(0.5, 0.51)
Train on [53]DeepPhys [8]78.2718.6423.19%23.230.07
TS-CAN [21]77.1218.4623.24%23.310.00
EfficientPhys [22]32.1212.2316.78%23.400.31
PhysNet [57]33.658.6411.09%16.140.35
PhysFormer [58]48.4610.4113.26%15.540.24
Ours18.085.106.81%12.020.620.73
Train on [49]DeepPhys [8]77.8817.9422.44%22.490.07
TS-CAN [21]75.5817.6522.02%22.020.01
EfficientPhys [22]44.2313.8518.28%22.840.19
PhysNet [57]48.4611.2414.27%17.470.32
PhysFormer [58]39.819.5812.59%15.140.32
Ours16.154.616.07%11.650.650.78
", + "image_path": "3ed48574f2f239841c5541aa0b592a973d4d4ab21b136db662873751a6e85750.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 367, + 482, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 367, + 482, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 367, + 482, + 450 + ], + "type": "text", + "content": "Evaluation Configuration We gauge performance of all methods via HR estimations from the power-spectral density. These estimations are carried over 300-sample windows (10 seconds), with a stride of 128 samples. Following [49], we validate4 the learning-based methods by performing six-fold cross-validation while averaging across the entire dataset for algorithmic methods. Similarly, we construct three folds for [53] to evaluate the learning methods. Please refer to the supplement for details, including visualization of signal strength masks." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 451, + 482, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 451, + 482, + 487 + ], + "spans": [ + { + "bbox": [ + 130, + 451, + 482, + 487 + ], + "type": "text", + "content": "Figures 6 and 7 show the results of our algorithm against the baseline methods. For ease of interpretability, we correct for random phase lag between the face (site of signal measurement) and finger (site of ground truth measurement)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 503, + 350, + 516 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 503, + 350, + 516 + ], + "spans": [ + { + "bbox": [ + 131, + 503, + 350, + 516 + ], + "type": "text", + "content": "7.2 Out of Distribution Plethysmography" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 522, + 482, + 571 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 571 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 571 + ], + "type": "text", + "content": "We use our self-collected optically challenging dataset to benchmark OOD performance. While we primarily employ this dataset, we acknowledge that this is not the only notion of OOD. Hence, we also perform cross-dataset inference as part of the evaluation protocol to measure generalization capacity." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 586, + 486, + 622 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 586, + 486, + 622 + ], + "spans": [ + { + "bbox": [ + 130, + 586, + 486, + 622 + ], + "type": "text", + "content": "Optically Challenging OOD Evaluation Table 1 presents a quantitative analysis of OOD performance. Learning-based methods are trained on the datasets from [53] and [49], and the best fold is chosen for OOD inference." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 623, + 482, + 648 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 623, + 482, + 648 + ], + "spans": [ + { + "bbox": [ + 130, + 623, + 482, + 648 + ], + "type": "text", + "content": "Given their capacity to memorize distinguishable patterns, learning methods [57,58] handle input noise better than algorithmic methods for in-distribution" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 210, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 423, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 423, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 423, + 666 + ], + "type": "text", + "content": "4 Baselines are configured, where possible, using the toolbox from [23]." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 149, + 190, + 462, + 368 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "text", + "content": "Table 2: In-distribution and Cross-dataset OOD performance across two datasets - [49] and [53] shows comparable or superior performance compared to prior methods. Across in-distribution and cross-dataset validation, our method is the most consistent compared to SOTA methods. The best-performing and second-best-performing numbers are shown in green and yellow, respectively. There are 4 quadrants: " + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "inline_equation", + "content": "1^{st}" + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "text", + "content": " - top left, " + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "inline_equation", + "content": "2^{nd}" + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "text", + "content": " - top right, " + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "inline_equation", + "content": "3^{rd}" + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "text", + "content": " - bottom right and " + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "inline_equation", + "content": "4^{th}" + }, + { + "bbox": [ + 130, + 114, + 482, + 181 + ], + "type": "text", + "content": " - bottom left." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 149, + 190, + 462, + 368 + ], + "lines": [ + { + "bbox": [ + 149, + 190, + 462, + 368 + ], + "spans": [ + { + "bbox": [ + 149, + 190, + 462, + 368 + ], + "type": "table", + "html": "
MethodTest on [53]Test on [49]
T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑T-Test (APE %) ↓ MAE ↓ MAPE ↓ RMSE ↓ r ↑
Green [48]12.193.714.75%10.270.64
POS [51]6.192.032.84%6.750.84
CHROM [11]9.662.743.81%7.920.78
ICA [41]9.742.943.83%9.150.71
Train on [53]
DeepPhys [8]72.7016.3321.32%20.430.0276.2618.2122.79%22.340.02
TS-CAN [21]74.5016.6921.87%20.690.0177.1718.2823.17%22.380.03
EfficientPhys [22]2.261.021.59%5.510.884.471.672.27%5.900.89
PhysNet [57]2.760.941.37%4.690.923.581.191.59%3.750.96
PhysFormer [58]4.331.281.72%5.030.9025.086.508.58%12.280.54
Ours3.221.211.78%5.610.884.391.662.17%4.690.94
Green [48]19.586.277.53%14.270.57
POS [51]6.002.132.78%6.540.89
CHROM [11]8.072.383.07%6.720.89
ICA [41]17.155.136.00%12.210.66
Train on [49]
DeepPhys [8]73.8516.6021.66%20.550.0077.4318.4623.26%22.460.01
TS-CAN [21]75.3017.0322.35%20.960.0377.3618.6123.49%22.760.00
EfficientPhys [22]11.454.446.43%13.460.5321.586.508.53%14.080.53
PhysNet [57]66.4414.0419.72%17.810.064.721.481.87%4.480.93
PhysFormer [58]22.745.277.34%9.930.622.961.061.37%3.350.96
Ours3.161.161.69%5.330.893.341.221.61%4.010.96
", + "image_path": "7827ca514e0562cd5e32455746b48d97ee48936146263cbe580c472eacbc2781.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 391, + 481, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 391, + 481, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 391, + 481, + 450 + ], + "type": "text", + "content": "inference. However, this also leads to poorer generalizability on our OOD dataset, as emphasized by both the Pearson coefficient (r) and the \"r-consistency\" metrics. In contrast, algorithmic methods rely on deterministic heuristics. While this promotes good generalizability, it makes them extremely sensitive to factors such as lighting, occlusion, etc., leading to generally poorer performance." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "text", + "content": "Our proposed method maximizes signal strength while avoiding overfitting to the training distribution. We are, therefore, Pareto-optimal in both OOD performance and inter-distribution parity (Figure 2) regarding the T-Test value and \"r-consistency\" score. Our method is both the best and second-best performing method, outperforming Green (the best baseline) with " + }, + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "inline_equation", + "content": "48.8\\%" + }, + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "inline_equation", + "content": "40.9\\%" + }, + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "text", + "content": " reduction in T-Test and MAE values. Clinically, this implies an almost " + }, + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "inline_equation", + "content": "2x" + }, + { + "bbox": [ + 130, + 452, + 482, + 548 + ], + "type": "text", + "content": " reduction in the number of participants on whom the method fails following the AAMI standard. Further granular analysis can be found in the supplement." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "Cross-Dataset OOD and In-Distribution Evaluation Another notion of OOD is a cross-dataset generalization. Domain shifts between datasets result from differences in hardware and acquisition conditions. Learning-based methods tend to overfit the training data. Our experiments use datasets from [53] and [49] for their size and diversity. Table 2 indicates that while deep learning methods perform well in-distribution (" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "1^{\\text{st}}" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "3^{\\text{rd}}" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " quadrant), they cannot maintain the same level of performance for cross-dataset inference (" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "2^{\\text{nd}}" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "4^{\\text{th}}" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " quadrant). Algorithmic methods have no notion of cross-dataset evaluation. When trained" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 167, + 117, + 219, + 171 + ], + "blocks": [ + { + "bbox": [ + 167, + 117, + 219, + 171 + ], + "lines": [ + { + "bbox": [ + 167, + 117, + 219, + 171 + ], + "spans": [ + { + "bbox": [ + 167, + 117, + 219, + 171 + ], + "type": "image", + "image_path": "5eb7f878dacc8556076fa9a390236910e8e0336a727e66ea4d4ba13f05186388.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 220, + 116, + 274, + 173 + ], + "blocks": [ + { + "bbox": [ + 220, + 116, + 274, + 173 + ], + "lines": [ + { + "bbox": [ + 220, + 116, + 274, + 173 + ], + "spans": [ + { + "bbox": [ + 220, + 116, + 274, + 173 + ], + "type": "image", + "image_path": "c15cf934f2f24a0b3996a67356a829c9419f107e8e5b993db662d31653c20254.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 276, + 116, + 329, + 173 + ], + "blocks": [ + { + "bbox": [ + 276, + 116, + 329, + 173 + ], + "lines": [ + { + "bbox": [ + 276, + 116, + 329, + 173 + ], + "spans": [ + { + "bbox": [ + 276, + 116, + 329, + 173 + ], + "type": "image", + "image_path": "31e98aa82d4ef60f27d62c168f6a4cfd6629d9529186724567a3116acf15c51f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 332, + 116, + 386, + 173 + ], + "blocks": [ + { + "bbox": [ + 332, + 116, + 386, + 173 + ], + "lines": [ + { + "bbox": [ + 332, + 116, + 386, + 173 + ], + "spans": [ + { + "bbox": [ + 332, + 116, + 386, + 173 + ], + "type": "image", + "image_path": "b34ea040ce7f83c303a1d3938839ef8c5f3f124fe0c4909fe82e60edf7b80a98.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 388, + 117, + 445, + 173 + ], + "blocks": [ + { + "bbox": [ + 388, + 117, + 445, + 173 + ], + "lines": [ + { + "bbox": [ + 388, + 117, + 445, + 173 + ], + "spans": [ + { + "bbox": [ + 388, + 117, + 445, + 173 + ], + "type": "image", + "image_path": "930d90b471e6843686bf891f05166b6d19f9e66cc536340500531d34fe6af718.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 167, + 177, + 218, + 230 + ], + "blocks": [ + { + "bbox": [ + 167, + 177, + 218, + 230 + ], + "lines": [ + { + "bbox": [ + 167, + 177, + 218, + 230 + ], + "spans": [ + { + "bbox": [ + 167, + 177, + 218, + 230 + ], + "type": "image", + "image_path": "8c98afcece5268625400298422de3982eda05bc98c88599457430e2238dbd499.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 220, + 176, + 273, + 232 + ], + "blocks": [ + { + "bbox": [ + 220, + 176, + 273, + 232 + ], + "lines": [ + { + "bbox": [ + 220, + 176, + 273, + 232 + ], + "spans": [ + { + "bbox": [ + 220, + 176, + 273, + 232 + ], + "type": "image", + "image_path": "55514e872dc08f841fab601149549115da8045ca73ba58de54b2839968626628.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 276, + 176, + 331, + 232 + ], + "blocks": [ + { + "bbox": [ + 276, + 176, + 331, + 232 + ], + "lines": [ + { + "bbox": [ + 276, + 176, + 331, + 232 + ], + "spans": [ + { + "bbox": [ + 276, + 176, + 331, + 232 + ], + "type": "image", + "image_path": "a6bc6ae3e7d02e82178962ebe6649970eab64d9980cd1760b603f674f23703c5.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 334, + 177, + 388, + 232 + ], + "blocks": [ + { + "bbox": [ + 334, + 177, + 388, + 232 + ], + "lines": [ + { + "bbox": [ + 334, + 177, + 388, + 232 + ], + "spans": [ + { + "bbox": [ + 334, + 177, + 388, + 232 + ], + "type": "image", + "image_path": "12878ee782063ed70481413124e57716e52facadb2a57650886c3ca284683f08.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 389, + 177, + 444, + 232 + ], + "blocks": [ + { + "bbox": [ + 389, + 177, + 444, + 232 + ], + "lines": [ + { + "bbox": [ + 389, + 177, + 444, + 232 + ], + "spans": [ + { + "bbox": [ + 389, + 177, + 444, + 232 + ], + "type": "image", + "image_path": "7c537bfffb2e6bc25be780a1ebaa0060c2fbaadf0d32e6c905d429679d05fb2b.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 167, + 238, + 218, + 289 + ], + "blocks": [ + { + "bbox": [ + 167, + 238, + 218, + 289 + ], + "lines": [ + { + "bbox": [ + 167, + 238, + 218, + 289 + ], + "spans": [ + { + "bbox": [ + 167, + 238, + 218, + 289 + ], + "type": "image", + "image_path": "20b883b8c9ab981e950bf1d61110ec77c9a3c70eff2b685d59c3762e084ac0b2.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 172, + 295, + 206, + 306 + ], + "lines": [ + { + "bbox": [ + 172, + 295, + 206, + 306 + ], + "spans": [ + { + "bbox": [ + 172, + 295, + 206, + 306 + ], + "type": "text", + "content": "(a) VID." + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 220, + 236, + 273, + 291 + ], + "blocks": [ + { + "bbox": [ + 220, + 236, + 273, + 291 + ], + "lines": [ + { + "bbox": [ + 220, + 236, + 273, + 291 + ], + "spans": [ + { + "bbox": [ + 220, + 236, + 273, + 291 + ], + "type": "image", + "image_path": "c53dd50ce8633f3f331079114f3277e938c23371893749cf1974e61521536478.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 223, + 296, + 258, + 307 + ], + "lines": [ + { + "bbox": [ + 223, + 296, + 258, + 307 + ], + "spans": [ + { + "bbox": [ + 223, + 296, + 258, + 307 + ], + "type": "text", + "content": "(b) [48]" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 276, + 236, + 330, + 291 + ], + "blocks": [ + { + "bbox": [ + 276, + 236, + 330, + 291 + ], + "lines": [ + { + "bbox": [ + 276, + 236, + 330, + 291 + ], + "spans": [ + { + "bbox": [ + 276, + 236, + 330, + 291 + ], + "type": "image", + "image_path": "b526097aca886d88ce746502e3fa3edc153cb7ad80df517cb4040f2e5a1c6597.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 282, + 296, + 317, + 306 + ], + "lines": [ + { + "bbox": [ + 282, + 296, + 317, + 306 + ], + "spans": [ + { + "bbox": [ + 282, + 296, + 317, + 306 + ], + "type": "text", + "content": "(c) [58]" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 334, + 236, + 388, + 291 + ], + "blocks": [ + { + "bbox": [ + 334, + 236, + 388, + 291 + ], + "lines": [ + { + "bbox": [ + 334, + 236, + 388, + 291 + ], + "spans": [ + { + "bbox": [ + 334, + 236, + 388, + 291 + ], + "type": "image", + "image_path": "95cb1e57072cf59fef8d2a9cb9c3d30d4ee62f60f778facaf7c539143e72f207.jpg" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 340, + 296, + 378, + 305 + ], + "lines": [ + { + "bbox": [ + 340, + 296, + 378, + 305 + ], + "spans": [ + { + "bbox": [ + 340, + 296, + 378, + 305 + ], + "type": "text", + "content": "(d) OURS" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 316, + 480, + 361 + ], + "lines": [ + { + "bbox": [ + 130, + 316, + 480, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 316, + 480, + 361 + ], + "type": "text", + "content": "Fig.6: Across challenging OOD optical settings, the proposed method can capture details of the plethysmograph waveform compared to prior methods. Results shown use models trained on the dataset proposed in [49], where applicable. Additional results are presented in the supplement." + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_caption" + } + ], + "index": 18 + }, + { + "type": "image", + "bbox": [ + 389, + 236, + 444, + 291 + ], + "blocks": [ + { + "bbox": [ + 389, + 236, + 444, + 291 + ], + "lines": [ + { + "bbox": [ + 389, + 236, + 444, + 291 + ], + "spans": [ + { + "bbox": [ + 389, + 236, + 444, + 291 + ], + "type": "image", + "image_path": "ce8e28167366a0db69994856be44791ec62dd24698d06ea7201d0d782765c492.jpg" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 403, + 296, + 432, + 305 + ], + "lines": [ + { + "bbox": [ + 403, + 296, + 432, + 305 + ], + "spans": [ + { + "bbox": [ + 403, + 296, + 432, + 305 + ], + "type": "text", + "content": "(e) GT" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_caption" + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "spans": [ + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "text", + "content": "on [49] and tested on [53] (" + }, + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "inline_equation", + "content": "4^{th}" + }, + { + "bbox": [ + 130, + 381, + 480, + 404 + ], + "type": "text", + "content": " quadrant), we outperform all prior work. In the reverse scenario (2nd quadrant), we are the second-best, marginally behind [57]." + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 130, + 406, + 480, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 480, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 480, + 489 + ], + "type": "text", + "content": "Despite OOD being our central focus, our model offers results comparable to SOTA algorithms even for in-distribution evaluation. Our method is within 0.3 bpm MAE compared to all top baselines (a difference that is not clinically significant). Additionally, our method shows a sub 0.5 bpm standard deviation of MAE across various folds used for evaluation in all configurations. Overall, our method is the most consistent across all quadrants while yielding errors within 2 bpm MAE, which most likely would be clinically accurate." + } + ] + } + ], + "index": 24 + }, + { + "bbox": [ + 131, + 504, + 280, + 516 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 504, + 280, + 516 + ], + "spans": [ + { + "bbox": [ + 131, + 504, + 280, + 516 + ], + "type": "text", + "content": "7.3 Qualitative Comparison" + } + ] + } + ], + "index": 25 + }, + { + "bbox": [ + 130, + 521, + 480, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 480, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 480, + 605 + ], + "type": "text", + "content": "In Figure 6, we assess the qualitative waveforms generated on our optically challenging OOD dataset. We compare our method against the best-performing algorithmic and deep learning methods from Table 1, i.e., Green [48] and PhysFormer [58] respectively. For the representative samples, our method is superior in performance and can retain the shape of the plethysmography signal. The second scene, with the mask and glasses, especially highlights these gains. We also show superior rPPG estimation for extreme scenes (window reflections)." + } + ] + } + ], + "index": 26 + }, + { + "bbox": [ + 130, + 606, + 480, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 480, + 664 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 480, + 664 + ], + "type": "text", + "content": "In Figure 7, we assess qualitative waveforms from in-distribution inference samples from [49]. We compare our method with PhysFormer [58] and POS [51] as the best-performing in-distribution deep learning and algorithmic methods. Our method retains both the frequency information and salient features of the waveform across diverse skin tones in the dataset." + } + ] + } + ], + "index": 27 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 211, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 211, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 167, + 120, + 218, + 173 + ], + "blocks": [ + { + "bbox": [ + 167, + 120, + 218, + 173 + ], + "lines": [ + { + "bbox": [ + 167, + 120, + 218, + 173 + ], + "spans": [ + { + "bbox": [ + 167, + 120, + 218, + 173 + ], + "type": "image", + "image_path": "3643150efc4f1fa9fadb10f495d31385ec9086aa32c7b6bc5e5ed5412ec67cc9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 219, + 119, + 272, + 176 + ], + "blocks": [ + { + "bbox": [ + 219, + 119, + 272, + 176 + ], + "lines": [ + { + "bbox": [ + 219, + 119, + 272, + 176 + ], + "spans": [ + { + "bbox": [ + 219, + 119, + 272, + 176 + ], + "type": "image", + "image_path": "458c7eaf94832d4f5974a4bcac5c3218367b8b29c4b32f1e476d90ab733080b0.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 276, + 119, + 330, + 176 + ], + "blocks": [ + { + "bbox": [ + 276, + 119, + 330, + 176 + ], + "lines": [ + { + "bbox": [ + 276, + 119, + 330, + 176 + ], + "spans": [ + { + "bbox": [ + 276, + 119, + 330, + 176 + ], + "type": "image", + "image_path": "5291fa2b6f63b4fd1fa3c8c474d3c44ab0cd45b1f58d7494a5520651fbd2c87a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 331, + 119, + 388, + 176 + ], + "blocks": [ + { + "bbox": [ + 331, + 119, + 388, + 176 + ], + "lines": [ + { + "bbox": [ + 331, + 119, + 388, + 176 + ], + "spans": [ + { + "bbox": [ + 331, + 119, + 388, + 176 + ], + "type": "image", + "image_path": "165dd5e49d5b357d0aac37b7434eb5968751a0852e439db9213a48201094a10e.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 389, + 120, + 443, + 176 + ], + "blocks": [ + { + "bbox": [ + 389, + 120, + 443, + 176 + ], + "lines": [ + { + "bbox": [ + 389, + 120, + 443, + 176 + ], + "spans": [ + { + "bbox": [ + 389, + 120, + 443, + 176 + ], + "type": "image", + "image_path": "0e052412cfd02a5d369303da6dbe104940a5ce643cb8b4957788f5e49d9f3826.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 167, + 183, + 218, + 234 + ], + "blocks": [ + { + "bbox": [ + 167, + 183, + 218, + 234 + ], + "lines": [ + { + "bbox": [ + 167, + 183, + 218, + 234 + ], + "spans": [ + { + "bbox": [ + 167, + 183, + 218, + 234 + ], + "type": "image", + "image_path": "a80ccdaece25b0ff8b79395e1a6c4cfd45e38ac5366e73168c2ece75d80f91c6.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 172, + 241, + 206, + 252 + ], + "lines": [ + { + "bbox": [ + 172, + 241, + 206, + 252 + ], + "spans": [ + { + "bbox": [ + 172, + 241, + 206, + 252 + ], + "type": "text", + "content": "(a) VID." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 219, + 182, + 272, + 237 + ], + "blocks": [ + { + "bbox": [ + 219, + 182, + 272, + 237 + ], + "lines": [ + { + "bbox": [ + 219, + 182, + 272, + 237 + ], + "spans": [ + { + "bbox": [ + 219, + 182, + 272, + 237 + ], + "type": "image", + "image_path": "fb10b75d47089a50a7e92ce70afc2887b1544f89090b96c6bdb73d0b28cd6bfe.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 223, + 242, + 258, + 253 + ], + "lines": [ + { + "bbox": [ + 223, + 242, + 258, + 253 + ], + "spans": [ + { + "bbox": [ + 223, + 242, + 258, + 253 + ], + "type": "text", + "content": "(b) [51]" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 276, + 182, + 330, + 237 + ], + "blocks": [ + { + "bbox": [ + 276, + 182, + 330, + 237 + ], + "lines": [ + { + "bbox": [ + 276, + 182, + 330, + 237 + ], + "spans": [ + { + "bbox": [ + 276, + 182, + 330, + 237 + ], + "type": "image", + "image_path": "98725dd7e4fb6d28cf97226e171a28c23e59ffde5032a78e2479095e2f4caed2.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 282, + 242, + 317, + 253 + ], + "lines": [ + { + "bbox": [ + 282, + 242, + 317, + 253 + ], + "spans": [ + { + "bbox": [ + 282, + 242, + 317, + 253 + ], + "type": "text", + "content": "(c) [58]" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 262, + 480, + 307 + ], + "lines": [ + { + "bbox": [ + 131, + 262, + 480, + 307 + ], + "spans": [ + { + "bbox": [ + 131, + 262, + 480, + 307 + ], + "type": "text", + "content": "Fig. 7: In distribution inference on a diverse dataset. Our method better captures rPPG waveform details across skin tones for in-distribution evaluation on [49] dataset. While our method and [58] both perform reasonably well across skin tones, [58] does so with poorer OOD performance (Figure 6). More results in the supplement." + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 331, + 182, + 388, + 237 + ], + "blocks": [ + { + "bbox": [ + 331, + 182, + 388, + 237 + ], + "lines": [ + { + "bbox": [ + 331, + 182, + 388, + 237 + ], + "spans": [ + { + "bbox": [ + 331, + 182, + 388, + 237 + ], + "type": "image", + "image_path": "5d4629d6c9b4b5348256e623d74f6df3386ca99264cce1a5bddb55c07ff82701.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 340, + 242, + 379, + 252 + ], + "lines": [ + { + "bbox": [ + 340, + 242, + 379, + 252 + ], + "spans": [ + { + "bbox": [ + 340, + 242, + 379, + 252 + ], + "type": "text", + "content": "(d) Ours" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 389, + 182, + 443, + 237 + ], + "blocks": [ + { + "bbox": [ + 389, + 182, + 443, + 237 + ], + "lines": [ + { + "bbox": [ + 389, + 182, + 443, + 237 + ], + "spans": [ + { + "bbox": [ + 389, + 182, + 443, + 237 + ], + "type": "image", + "image_path": "54bf683d4a1f845a8c3493ed2b2ba971a43780a4ff60ddbccd2f62b7b8bcc122.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 402, + 241, + 432, + 251 + ], + "lines": [ + { + "bbox": [ + 402, + 241, + 432, + 251 + ], + "spans": [ + { + "bbox": [ + 402, + 241, + 432, + 251 + ], + "type": "text", + "content": "(e) GT" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 326, + 217, + 338 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 217, + 338 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 217, + 338 + ], + "type": "text", + "content": "8 Discussion" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 348, + 480, + 408 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 348, + 480, + 408 + ], + "spans": [ + { + "bbox": [ + 130, + 348, + 480, + 408 + ], + "type": "text", + "content": "We propose an INR for camera-based rPPG. We introduce the concept of " + }, + { + "bbox": [ + 130, + 348, + 480, + 408 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 348, + 480, + 408 + ], + "type": "text", + "content": "-" + }, + { + "bbox": [ + 130, + 348, + 480, + 408 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 348, + 480, + 408 + ], + "type": "text", + "content": " decomposition and propose an INR architecture to achieve this at scale. The proposed model is evaluated on a dataset of optically challenging OOD participants in addition to existing datasets. Our model performs best on the OOD dataset while comparable to SOTA for in-distribution validation." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 423, + 217, + 434 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 423, + 217, + 434 + ], + "spans": [ + { + "bbox": [ + 132, + 423, + 217, + 434 + ], + "type": "text", + "content": "8.1 Limitations" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 441, + 480, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 480, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 480, + 501 + ], + "type": "text", + "content": "Being the first method using INRs for rPPG, limitations exist. First, while we reduce runtime over traditional INRs (as discussed in the supplement), and some rPPG methods report comparable runtimes [26], this is an avenue for future improvement. Second, while the proposed method is competitive for challenging scenes like talking and motion (supplement), these problems remain open." + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 132, + 516, + 383, + 528 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 516, + 383, + 528 + ], + "spans": [ + { + "bbox": [ + 132, + 516, + 383, + 528 + ], + "type": "text", + "content": "8.2 Societal Impacts and Ethical Considerations" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 130, + 533, + 480, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 480, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 480, + 617 + ], + "type": "text", + "content": "We focus on rPPG in optically challenging scenes (Section 1.1) due to factors like lighting, facial occlusions (masks, glasses, medical equipment), etc. Robustness to such settings enables applicability in settings like hospital rooms, classrooms, driving, etc. Additionally, prior work [1, 37] has shown promise in using rPPG for tasks like biometrics and forensics, and OOD-robustness will bring these applications one step closer to real-world deployment. Finally, these methods can also potentially be applied to other modalities and vital signs [10, 12, 60]." + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "content": "Technological solutions enabling healthcare for all, like this work, are relevant for social good. However, technology with clinical impact should only be deployed once the method is provably robust. Our method takes a step in that direction, but a pipeline of similar papers is needed to enable real-world rPPG deployment." + } + ] + } + ], + "index": 24 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 201 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 201 + ], + "type": "text", + "content": "We thank the Visual Machines Group (VMG) at UCLA for feedback and support. A.K. was supported by a National Science Foundation (NSF) CAREER award, IIS-2046737, Army Young Investigator Program Award, Defense Advanced Research Projects Agency (DARPA) Young Faculty Award, and a Cisco Research Award. P.C. was partially supported by a Cisco Research Award." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 220, + 197, + 232 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 220, + 197, + 232 + ], + "spans": [ + { + "bbox": [ + 133, + 220, + 197, + 232 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 246, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 246, + 481, + 280 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 246, + 481, + 280 + ], + "spans": [ + { + "bbox": [ + 138, + 246, + 481, + 280 + ], + "type": "text", + "content": "1. Al Masri, A., Jasra, S.K.: The forensic biometric analysis of emotions from facial expressions, and physiological processes from the heart and skin. Journal of Emerging Forensic Sciences Research 1(1), 61-77 (2016)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 281, + 481, + 290 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 281, + 481, + 290 + ], + "spans": [ + { + "bbox": [ + 138, + 281, + 481, + 290 + ], + "type": "text", + "content": "2. Association, C.T.: Physical activity monitoring for heart rate, ansi/cta-2065 (2018)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 291, + 481, + 323 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 291, + 481, + 323 + ], + "spans": [ + { + "bbox": [ + 138, + 291, + 481, + 323 + ], + "type": "text", + "content": "3. Ba, Y., Wang, Z., Karinca, K.D., Bozkurt, O.D., Kadambi, A.: Overcoming difficulty in obtaining dark-skinned subjects for remote-ppg by synthetic augmentation. arXiv preprint arXiv:2106.06007 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 324, + 481, + 356 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 324, + 481, + 356 + ], + "spans": [ + { + "bbox": [ + 138, + 324, + 481, + 356 + ], + "type": "text", + "content": "4. Balakrishnan, G., Durand, F., Guttag, J.: Detecting pulse from head motions in video. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 3430-3437 (2013)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 357, + 481, + 389 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 357, + 481, + 389 + ], + "spans": [ + { + "bbox": [ + 138, + 357, + 481, + 389 + ], + "type": "text", + "content": "5. Chari, P., Ba, Y., Athreya, S., Kadambi, A.: Mime: Minority inclusion for majority group enhancement of ai performance. In: European conference on computer vision. pp. 326-343. Springer (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 390, + 481, + 433 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 390, + 481, + 433 + ], + "spans": [ + { + "bbox": [ + 138, + 390, + 481, + 433 + ], + "type": "text", + "content": "6. Chari, P., Kabra, K., Karinca, D., Lahiri, S., Srivastava, D., Kulkarni, K., Chen, T., Cannesson, M., Jalilian, L., Kadambi, A.: Diverse r-ppg: Camera-based heart rate estimation for diverse subject skin-tones and scenes. arXiv preprint arXiv:2010.12769 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 434, + 481, + 466 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 434, + 481, + 466 + ], + "spans": [ + { + "bbox": [ + 138, + 434, + 481, + 466 + ], + "type": "text", + "content": "7. Chen, H., He, B., Wang, H., Ren, Y., Lim, S.N., Shrivastava, A.: Nerv: Neural representations for videos. Advances in Neural Information Processing Systems 34, 21557-21568 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 467, + 481, + 499 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 467, + 481, + 499 + ], + "spans": [ + { + "bbox": [ + 138, + 467, + 481, + 499 + ], + "type": "text", + "content": "8. Chen, W., McDuff, D.: Deepphys: Video-based physiological measurement using convolutional attention networks. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 349-365 (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 500, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 500, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 500, + 481, + 544 + ], + "type": "text", + "content": "9. Chen, Z., Chen, Y., Liu, J., Xu, X., Goel, V., Wang, Z., Shi, H., Wang, X.: Videoirr: Learning video implicit neural representation for continuous space-time superresolution. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2047-2057 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 544, + 481, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 481, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 481, + 577 + ], + "type": "text", + "content": "0. Chen, Z., Zheng, T., Cai, C., Luo, J.: Movi-fi: Motion-robust vital signs waveform recovery via deep interpreted rf sensing. In: Proceedings of the 27th annual international conference on mobile computing and networking. pp. 392–405 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 577, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 481, + 599 + ], + "type": "text", + "content": "1. De Haan, G., Jeanne, V.: Robust pulse rate from chrominance-based rppg. IEEE Transactions on Biomedical Engineering 60(10), 2878-2886 (2013)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 481, + 632 + ], + "type": "text", + "content": "2. Del Regno, K., Vilesov, A., Armouti, A., Harish, A.B., Can, S.E., Kita, A., Kadambi, A.: Thermal imaging and radar for remote sleep monitoring of breathing and apnea. arXiv preprint arXiv:2407.11936 (2024)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "type": "text", + "content": "3. Gao, C., Saraf, A., Kopf, J., Huang, J.B.: Dynamic view synthesis from dynamic monocular video. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5712-5721 (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 210, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 210, + 91, + 447, + 101 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "14. Hurter, C., McDuff, D.: Cardiolens: remote physiological monitoring in a mixed reality environment. In: ACM siggraph 2017 emerging technologies, pp. 1-2 (2017)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 480, + 172 + ], + "type": "text", + "content": "15. Jiang, C., Sud, A., Makadia, A., Huang, J., Nießner, M., Funkhouser, T., et al.: Local implicit grid representations for 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6001-6010 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 174, + 480, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 174, + 480, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 174, + 480, + 194 + ], + "type": "text", + "content": "16. Kadambi, A.: Achieving fairness in medical devices. Science 372(6537), 30-31 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 197, + 480, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 197, + 480, + 228 + ], + "spans": [ + { + "bbox": [ + 133, + 197, + 480, + 228 + ], + "type": "text", + "content": "17. Lee, E., Chen, E., Lee, C.Y.: Meta-rppg: Remote heart rate estimation using a transductive meta-learner. In: European Conference on Computer Vision. pp. 392–409. Springer (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 230, + 480, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 230, + 480, + 251 + ], + "spans": [ + { + "bbox": [ + 133, + 230, + 480, + 251 + ], + "type": "text", + "content": "18. Li, R., Tancik, M., Kanazawa, A.: Nerfacc: A general nef acceleration toolbox. arXiv preprint arXiv:2210.04847 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 253, + 480, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 253, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 133, + 253, + 480, + 285 + ], + "type": "text", + "content": "19. Li, Z., Niklaus, S., Snavely, N., Wang, O.: Neural scene flow fields for space-time view synthesis of dynamic scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6498-6508 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 286, + 480, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 286, + 480, + 329 + ], + "spans": [ + { + "bbox": [ + 132, + 286, + 480, + 329 + ], + "type": "text", + "content": "20. Lindell, D.B., Van Veen, D., Park, J.J., Wetzstein, G.: Bacon: Band-limited coordinate networks for multiscale scene representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16252-16262 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 331, + 480, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 331, + 480, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 331, + 480, + 363 + ], + "type": "text", + "content": "21. Liu, X., Fromm, J., Patel, S., McDuff, D.: Multi-task temporal shift attention networks for on-device contactless vitals measurement. Advances in Neural Information Processing Systems 33, 19400-19411 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 365, + 480, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 480, + 407 + ], + "type": "text", + "content": "22. Liu, X., Hill, B., Jiang, Z., Patel, S., McDuff, D.: Efficientphys: Enabling simple, fast and accurate camera-based cardiac measurement. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). pp. 5008-5017 (January 2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 409, + 480, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 409, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 409, + 480, + 430 + ], + "type": "text", + "content": "23. Liu, X., Zhang, X., Narayanswamy, G., Zhang, Y., Wang, Y., Patel, S., McDuff, D.: Deep physiological sensing toolbox. arXiv preprint arXiv:2210.00716 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 432, + 480, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 432, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 432, + 480, + 475 + ], + "type": "text", + "content": "24. Magdalena Nowara, E., Marks, T.K., Mansour, H., Veeraraghavan, A.: Sparseppg: Towards driver monitoring using camera-based vital signs estimation in near-infrared. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 1272-1281 (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 476, + 480, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 476, + 480, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 476, + 480, + 508 + ], + "type": "text", + "content": "25. Mai, L., Liu, F.: Motion-adjustable neural implicit video representation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10738-10747 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 510, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 480, + 542 + ], + "type": "text", + "content": "26. Maity, A.K., Wang, J., Sabharwal, A., Nayar, S.K.: Robustppg: camera-based robust heart rate estimation using motion cancellation. Biomedical Optics Express 13(10), 5447-5467 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 544, + 480, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 480, + 576 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 480, + 576 + ], + "type": "text", + "content": "27. Martel, J.N., Lindell, D.B., Lin, C.Z., Chan, E.R., Monteiro, M., Wetzstein, G.: Acorn: Adaptive coordinate networks for neural scene representation. arXiv preprint arXiv:2105.02788 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 577, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 577, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 577, + 480, + 620 + ], + "type": "text", + "content": "28. Mehta, I., Gharbi, M., Barnes, C., Shechtman, E., Ramamoorthi, R., Chandraker, M.: Modulated periodic activations for generalizable local functional representations. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 14214-14223 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 622, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 480, + 665 + ], + "type": "text", + "content": "29. Mildenhall, B., Hedman, P., Martin-Brualla, R., Srinivasan, P.P., Barron, J.T.: Nerf in the dark: High dynamic range view synthesis from noisy raw images. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16190-16199 (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 101 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "text", + "content": "30. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 151, + 480, + 162 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 151, + 480, + 162 + ], + "spans": [ + { + "bbox": [ + 132, + 151, + 480, + 162 + ], + "type": "text", + "content": "31. Monitors, C.: Heart rate meters, and alarms. ANSI/AAMI Standard EC13 (2002)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 163, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 163, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 163, + 480, + 205 + ], + "type": "text", + "content": "32. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Trans. Graph. 41(4), 102:1-102:15 (Jul 2022). https://doi.org/10.1145/3528223.3530127, https://doi.org/10.1145/3528223.3530127" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "type": "text", + "content": "33. Nelson, B.W., Allen, N.B.: Accuracy of consumer wearable heart rate measurement during an ecologically valid 24-hour period: intraindividual validation study. JMIR mHealth and uHealth 7(3), e10828 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 241, + 480, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 241, + 480, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 241, + 480, + 274 + ], + "type": "text", + "content": "34. Nießner, M., Zollhöfer, M., Izadi, S., Stamminger, M.: Real-time 3d reconstruction at scale using voxel hashing. ACM Transactions on Graphics (ToG) 32(6), 1-11 (2013)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 274, + 480, + 307 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 480, + 307 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 480, + 307 + ], + "type": "text", + "content": "35. Niu, X., Shan, S., Han, H., Chen, X.: Rhythmnet: End-to-end heart rate estimation from face via spatial-temporal representation. IEEE Transactions on Image Processing 29, 2409-2423 (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 308, + 480, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 480, + 352 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 480, + 352 + ], + "type": "text", + "content": "36. Nowara, E.M., McDuff, D., Veeraraghavan, A.: A meta-analysis of the impact of skin tone and gender on non-contact photoplethysmography measurements. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. pp. 284-285 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 353, + 480, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 353, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 353, + 480, + 396 + ], + "type": "text", + "content": "37. Nowara, E.M., Sabharwal, A., Veeraraghavan, A.: Ppgsecure: Biometric presentation attack detection using photopletysmograms. In: 2017 12th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2017). pp. 56-62. IEEE (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 397, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 480, + 418 + ], + "type": "text", + "content": "38. Owhadi, H., Scovel, C., Sullivan, T.J., McKerns, M., Ortiz, M.: Optimal uncertainty quantification. Siam Review 55(2), 271-345 (2013)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 420, + 480, + 463 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 420, + 480, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 480, + 463 + ], + "type": "text", + "content": "39. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 165-174 (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 464, + 480, + 497 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 480, + 497 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 480, + 497 + ], + "type": "text", + "content": "40. Peters, H., Ba, Y., Kadambi, A.: pcon: Polarimetric coordinate networks for neural scene representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 498, + 480, + 530 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 480, + 530 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 480, + 530 + ], + "type": "text", + "content": "41. Poh, M.Z., McDuff, D.J., Picard, R.W.: Non-contact, automated cardiac pulse measurements using video imaging and blind source separation. Optics express 18(10), 10762-10774 (2010)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 532, + 480, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 480, + 564 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 480, + 564 + ], + "type": "text", + "content": "42. Ramaswamy, V.V., Kim, S.S., Russakovsky, O.: Fair attribute classification through latent space de-biasing. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9301-9310 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 566, + 480, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 566, + 480, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 566, + 480, + 597 + ], + "type": "text", + "content": "43. Schulz, P., Scheuvens, L., Fettweis, G.: A new perspective on maximal-ratio combining. In: 2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). pp. 1-7. IEEE (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "text", + "content": "44. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in Neural Information Processing Systems 33, 7462-7473 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 480, + 665 + ], + "type": "text", + "content": "45. Song, R., Chen, H., Cheng, J., Li, C., Liu, Y., Chen, X.: Pulsegan: Learning to generate realistic pulse waveforms in remote photoplethysmography. IEEE Journal of Biomedical and Health Informatics 25(5), 1373-1384 (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 211, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 211, + 91, + 447, + 101 + ], + "type": "text", + "content": "Implicit Neural Models to Extract Heart Rate from Video" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 658 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "46. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. Advances in Neural Information Processing Systems 33, 7537-7547 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 160, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 160, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 160, + 481, + 194 + ], + "type": "text", + "content": "47. Teschner, M., Heidelberger, B., Müller, M., Pomerantes, D., Gross, M.H.: Optimized spatial hashing for collision detection of deformable objects. In: Vmv. vol. 3, pp. 47-54 (2003)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 214 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 214 + ], + "type": "text", + "content": "48. Verkruysse, W., Svaasand, L.O., Nelson, J.S.: Remote plethysmographic imaging using ambient light. Optics express 16(26), 21434-21445 (2008)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 214, + 481, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 214, + 481, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 481, + 247 + ], + "type": "text", + "content": "49. Vilesov, A., Chari, P., Armouti, A., Harish, A.B., Kulkarni, K., Deoghare, A., Jalilian, L., Kadambi, A.: Blending camera and 77 ghz radar sensing for equitable, robust plethysmography. ACM Transactions on Graphics (TOG) 41(4), 1-14 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 247, + 481, + 268 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 247, + 481, + 268 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 481, + 268 + ], + "type": "text", + "content": "50. Wadhwa, N., Rubinstein, M., Durand, F., Freeman, W.T.: Phase-based video motion processing. ACM Transactions on Graphics (TOG) 32(4), 1-10 (2013)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 268, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 268, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 268, + 481, + 300 + ], + "type": "text", + "content": "51. Wang, W., Den Brinker, A.C., Stuijk, S., De Haan, G.: Algorithmic principles of remote ppg. IEEE Transactions on Biomedical Engineering 64(7), 1479-1491 (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 300, + 481, + 344 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 481, + 344 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 481, + 344 + ], + "type": "text", + "content": "52. Wang, Z., Qinami, K., Karakozis, I.C., Genova, K., Nair, P., Hata, K., Russakovsky, O.: Towards fairness in visual recognition: Effective strategies for bias mitigation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8919-8928 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 344, + 481, + 387 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 344, + 481, + 387 + ], + "spans": [ + { + "bbox": [ + 132, + 344, + 481, + 387 + ], + "type": "text", + "content": "53. Wang, Z., Ba, Y., Chari, P., Bozkurt, O.D., Brown, G., Patwa, P., Vaddi, N., Jalilian, L., Kadambi, A.: Synthetic generation of face videos with plethysmograph physiology. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 20587-20596 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 387, + 481, + 419 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 387, + 481, + 419 + ], + "spans": [ + { + "bbox": [ + 132, + 387, + 481, + 419 + ], + "type": "text", + "content": "54. Wang, Z., Zhou, S., Park, J.J., Paschalidou, D., You, S., Wetzstein, G., Guibas, L., Kadambi, A.: Alto: Alternating latent topologies for implicit 3d reconstruction. arXiv preprint arXiv:2212.04096 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 419, + 481, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 419, + 481, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 419, + 481, + 452 + ], + "type": "text", + "content": "55. Wu, H.Y., Rubinstein, M., Shih, E., Guttag, J., Durand, F., Freeman, W.: Eulerian video magnification for revealing subtle changes in the world. ACM transactions on graphics (TOG) 31(4), 1-8 (2012)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 452, + 481, + 484 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 452, + 481, + 484 + ], + "spans": [ + { + "bbox": [ + 132, + 452, + 481, + 484 + ], + "type": "text", + "content": "56. Xu, T., White, J., Kalkan, S., Gunes, H.: Investigating bias and fairness in facial expression recognition. In: Computer Vision-ECCV 2020 Workshops: Glasgow, UK, August 23-28, 2020, Proceedings, Part VI 16. pp. 506-523. Springer (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 484, + 481, + 506 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 484, + 481, + 506 + ], + "spans": [ + { + "bbox": [ + 132, + 484, + 481, + 506 + ], + "type": "text", + "content": "57. Yu, Z., Li, X., Zhao, G.: Remote photoplethysmograph signal measurement from facial videos using spatio-temporal networks. arXiv preprint arXiv:1905.02419 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 506, + 481, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 506, + 481, + 548 + ], + "spans": [ + { + "bbox": [ + 132, + 506, + 481, + 548 + ], + "type": "text", + "content": "58. Yu, Z., Shen, Y., Shi, J., Zhao, H., Torr, P.H., Zhao, G.: Physformer: facial video-based physiological measurement with temporal difference transformer. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4186-4196 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 548, + 481, + 582 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 481, + 582 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 481, + 582 + ], + "type": "text", + "content": "59. Zhao, E.Q., Vilesov, A., Athreya, S., Chari, P., Merlos, J., Millett, K., Cyr, N.S., Jalilian, L., Kadambi, A.: Making thermal imaging more equitable and accurate: resolving solar loading biases. arXiv preprint arXiv:2304.08832 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 582, + 481, + 625 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 582, + 481, + 625 + ], + "spans": [ + { + "bbox": [ + 132, + 582, + 481, + 625 + ], + "type": "text", + "content": "60. Zheng, T., Chen, Z., Zhang, S., Cai, C., Luo, J.: More-fi: Motion-robust and fine-grained respiration monitoring via deep-learning uwb radar. In: Proceedings of the 19th ACM Conference on Embedded Networked Sensor Systems. pp. 111–124 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 625, + 481, + 658 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 625, + 481, + 658 + ], + "spans": [ + { + "bbox": [ + 132, + 625, + 481, + 658 + ], + "type": "text", + "content": "61. Zhi, S., Laidlow, T., Leutenegger, S., Davison, A.J.: In-place scene labelling and understanding with implicit scene representation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15838-15847 (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 100 + ], + "type": "text", + "content": "P. Chari et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_content_list.json b/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..32958c81c19998009ff4456f5ba68c1aff98e04e --- /dev/null +++ b/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_content_list.json @@ -0,0 +1,1567 @@ +[ + { + "type": "text", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "text_level": 1, + "bbox": [ + 295, + 141, + 707, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Sojeong Song $^{\\dagger,1}$ , Seoyun Yang $^{\\dagger,1}$ , Chang D. Yoo $^{\\ddagger,1}$ , and Junmo Kim $^{\\ddagger,1}$", + "bbox": [ + 339, + 212, + 663, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea", + "bbox": [ + 254, + 253, + 746, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "akqqq4985@kaist.ac.kr, seoyun.yang@navercorp.com", + "bbox": [ + 316, + 284, + 684, + 297 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Cross-modal steganography is committed to hiding secret information of one modality in another modality. Despite the advancement in the field of steganography by the introduction of deep learning, cross-modal steganography still remains to be a challenge to the field. The incompatibility between different modalities not only complicate the hiding process but also results in increased vulnerability to detection. To rectify these limitations, we present INRSteg, an innovative cross-modal steganography framework based on Implicit Neural Representations (INRs). We introduce a novel network allocating framework with a masked parameter update which facilitates hiding multiple data and enables cross modality across image, audio, video and 3D shape. Moreover, we eliminate the necessity of training a deep neural network and therefore substantially reduce the memory and computational cost and avoid domain adaptation issues. To the best of our knowledge, in the field of steganography, this is the first to introduce diverse modalities to both the secret and cover data. Detailed experiments in extreme modality settings demonstrate the flexibility, security, and robustness of INRSteg.", + "bbox": [ + 261, + 339, + 738, + 589 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Steganography $\\cdot$ Implicit neural representations $\\cdot$ Cross-modal steganography", + "bbox": [ + 259, + 603, + 740, + 630 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 659, + 375, + 674 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Nowadays, an unprecedented volume of data is shared and stored across various digital platforms and the volume is bound to intensify even further in the future. This proliferation and accessibility of data contributes to convenience in our lives and enables innovation and advancement that weren't achievable in the past; however, it also brings a concerning challenge to the security of information. Steganography aims to hide the secret information inside a cover data resulting in a stego data, also called the container. Unlike cryptography,", + "bbox": [ + 212, + 694, + 787, + 801 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "$\\dagger$ : Both authors have equally contributed.", + "bbox": [ + 230, + 810, + 509, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "†: Corresponding author.", + "bbox": [ + 230, + 824, + 400, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "which investigates in hiding the data of interest in a coded form, steganography operates with imperceptible concealment so that the existence of the secret data is undetectable. For example, individuals can upload their stego data to the cloud and securely trade their private keys with specific parties, and companies can leverage steganography to exchange confidential information, such as new product designs or sensitive meeting recordings, while including ownership details in the data. From a government perspective, steganography can covertly transmit information to foreign spies by inserting confidential national security information into seemingly ordinary cover data.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Up to now, image is the most commonly used modality of cover data, as it is less sensitive to human perception and is comparatively simple to embed secret information. However, image steganography tends to have a limit on payload capacity, and is susceptible to detection. Deep learning methods [1, 30] have increased the security, but suffer from unstable extraction and high computational costs [20]. Other modalities such as audio, video and 3D shape also undergo similar limitations [11, 29] and struggle with trade-offs between capacity and security. Moreover, for cross-modal steganography, where the modality of the secret and the cover data differs [5, 6, 24], these limitations intensify due to the difficulties that emerge when the dimension or capacity of the secret data exceed that of the cover data or when the secret data contains temporal information.", + "bbox": [ + 212, + 286, + 789, + 450 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Implicit neural representations (INRs) have recently attracted extensive attention as an alternative data representation, using continuous and differentiable functions to represent data via parameters of a neural network. The concept of INRs offers a more flexible and expressive approach than the conventional notion of discrete representations. Multiple modalities, as audio, image, video and 3d shape, are all presentable using a single neural network in various resolutions [3]. Moreover, INRs benefit in capacity by reducing the memory cost according to the network design [9, 15].", + "bbox": [ + 212, + 455, + 789, + 575 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we present INRSteg, the first cross-modal steganography framework available across a diverse range of modalities, including images, audio, video, and 3D shapes, for both the secret and cover data. By transforming the representation of all data to an implicit form, our framework takes advantage of the flexibility and high capacity inherent in INRs. The flexibility to all modalities enables cross-modal tasks that remained largely unexplored. Along with the versatility across the modalities, our framework is also capable of hiding multiple secret information into one cover data. In Sec. 4, we conduct the hiding of both an audio and an video into a single image, a task which was previously considered highly challenging due to the limited capacity of images. Our framework therefore further enables expansion and intriguing adaptation of steganography into a wider range of fields. In the medical field, for example, private information as an endoscopy video and an audio recording of the heart sound can be hidden under an image of a patient.", + "bbox": [ + 212, + 580, + 787, + 792 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To further enhance the security, layer-wise permutation of the INR network using a private key is additionally executed. Therefore, the secret INRs' network parameters can be well distributed within the stego INR's network. Revealing", + "bbox": [ + 212, + 795, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/3f8fadbee5f56ac2237d02b2c73dbe1aa5e2a062314d4d001c114447ca77dc27.jpg", + "image_caption": [ + "Fig. 1: A general framework of INRSteg for hiding two types of secret data. All four data types can be transformed into INRs, and the red box shows which of the four data types is selected in this case. After the representation transformation of each secret data, the weights of the two INRs are allocated in a new MLP network. With the weight freezing technique, the weights from the secret data are fixed while the rest are fitted on the cover data. The existence of the secret data is concealed by permutation encoding via private key, which does not affect the reconstruction performance. The private key is then used to decode the permuted stego network, and the secret data are revealed by separating each MLP network." + ], + "image_footnote": [], + "bbox": [ + 277, + 143, + 728, + 395 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "the secret data is executed by re-permuting and disassembling the weights of the stego INR. This procedure is not only simple but also guarantees a lossless revealing process as all neural representations of the secret data are fully recoverable.", + "bbox": [ + 212, + 592, + 787, + 651 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Additionally, our framework does not require any deep learning models to be trained for the hiding and revealing process, such as GAN [16, 25] or diffusion models [27]. This excludes the need for any training data and therefore our framework can prevent any biases that may arise from using training datasets [12] and avoids domain shift issues, allowing datasets of all modalities to be applied without any additional pre-processing. Moreover, by eliminating the use of deep networks, our work substantially reduces both the computational and memory costs associated with training and deploying models which have become a significant global challenge.", + "bbox": [ + 212, + 655, + 787, + 792 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The proposed framework, INRSteg, achieves flexible cross-modal steganography for multiple secret data by converting the data representation to neural networks. At the same time, we reduce computational and memory costs by", + "bbox": [ + 212, + 794, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "bbox": [ + 331, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "avoiding the use of deep neural networks. For intra-modal steganography, we demonstrate that INRSteg outperforms prior image steganography models such as DeepMIH [4] and DeepSteg [1]. We show INRSteg is robust in the real-world scenarios by applying quantization operation. These are our main contributions, and the details will be described in further sections:", + "bbox": [ + 212, + 146, + 787, + 220 + ], + "page_idx": 3 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Introduce an Implicit Neural Representation (INR) steganography framework that flexibly adopts to a large range of modalities and further enables all cross-modal steganography.", + "- Demonstrate a neural network allocating procedure that enables cost-effective hiding and revealing of multiple secret data at once.", + "- Comprehensive investigation on distortion, security and capacity shows that INRSteg achieves state-of-the-art cross-modal steganography.", + "- Figure out that INRSteg is the most efficient compared to the previous steganography models and robust in real-world scenarios especially for quantization operation." + ], + "bbox": [ + 225, + 237, + 784, + 385 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related work", + "text_level": 1, + "bbox": [ + 215, + 415, + 382, + 430 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.1 Steganography", + "text_level": 1, + "bbox": [ + 215, + 449, + 383, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Steganography is a technique that focuses on hiding confidential information by adeptly embedding data within other publicly accessible data, effectively concealing the very existence of the hidden message. When one is aware of this concealed data, it can be retrieved by a revealing process with an appropriate private key [17]. A prominent approach in historical methods is the Least Significant Bit (LSB) based method, which takes advantage of the imperceptibility of small changes to the least significant bits of the data [7,28]. With the rise of deep neural networks, the field of steganography has rapidly evolved to overcome the challenge of security and capacity. Deepsteg [1], which is an early work of image steganography, attempts to use an encoder and decoder to determine where to place the secret information. CROSS [27] utilizes diffusion models to only reveal the secret information when the accurate prompt is given. To enhance the capacity aspect while ensuring the security, invertible neural networks (INNs) have been actively adopted. In the image steganography field, HiNet [8] incorporates INNs with wavelet domain to minimize distortion, and DeepMIH [4] progresses to hide multiple images into one. LF-VSN [14] further attempts to hide seven videos into one utilizing the INN.", + "bbox": [ + 212, + 477, + 787, + 733 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Notwithstanding their innovations, a recurrent limitation across these previous methods is the trade-off between capacity and security. If the cover data is damaged in any way during the embedding process, it becomes susceptible to detection by steganalysis algorithms [23, 26]. This vulnerability poses a significant limitation, especially when attempting to hide large volumes of data such as videos or 3d shapes. INRSteg cannot be detected by traditional steganalysis tools and therefore ensures security while maintaining high capacity.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Cross-modal steganography", + "text_level": 1, + "bbox": [ + 215, + 146, + 488, + 162 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The evolution of steganography has also expanded to the concealment of information across different data modalities, such as embedding audio data within videos, which is called cross-modal steganography. [24] embeds video information into audio signals by leveraging the human visual system's inability to recognize high-frequency flickering, allowing for the hidden video to be decoded by recording the sound from a speaker and processing it. [6] utilizes a joint deep neural network architecture comprising two sub-models, one for embedding the audio into an image and another for decoding the image to retrieve the original audio. These methods achieve cross-modal steganography using deep learning techniques, but are still restricted on specified modalities.", + "bbox": [ + 212, + 170, + 787, + 321 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Recent advancements in Implicit Neural Representations (INRs) have paved the way for a new paradigm in steganography [5, 10]. INRs have been leveraged to represent multiple modalities of data simultaneously. StegaNeRF [10] hides data of various modalities at viewpoints when rendering NeRF. [5] conceals audio, video, and 3D shape data within a cover image, leveraging RGB values as weights of the INRs. While these recent works represent a paradigm shift in steganography techniques, the capacity and security trade-off still remains an issue and the modality of the cover data is set to be singular. Our proposed method in this paper seeks to address and overcome this trade-off while maintaining the advantages of INRs and further eliminating the modality constraint on the cover data, demonstrating a significant advancement in the steganography research.", + "bbox": [ + 212, + 321, + 787, + 489 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.3 Implicit neural representations", + "text_level": 1, + "bbox": [ + 215, + 510, + 516, + 523 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Implicit neural representations (INRs) is a rapidly emerging field where data is expressed in a continuous and differentiable manner through neural networks. This representation [18] is resolution-agnostic [19] and is capable of compressing the data effectively [2]. These advantages highlight various applications of INRs that show superior performance than that of the array-based representation. For example, neural radiance field (NeRF) [13] constructs a 5d scene representation of a 3d object through view-dependent synthesis. [3] proposes a general framework that feeds a modulated INR directly on the downstream models and shows competitive performance on multiple modalities. [9] employs meta-learning coupled with pruning techniques to efficiently scale implicit neural representations for large datasets.", + "bbox": [ + 212, + 534, + 787, + 700 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 724, + 330, + 739 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Framework", + "text_level": 1, + "bbox": [ + 215, + 755, + 356, + 768 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our research focuses on INR steganography, where the data representations are transformed into Implicit Neural Representations (INRs), such as SIREN [18]. Figure 1 shows the general framework of our methodology, which is segmented into three sub-stages. In the Data Representation Transformation stage, secret", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "bbox": [ + 330, + 114, + 730, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "data are transformed into their corresponding Implicit Neural Representations, represented as $\\theta_{\\text{secret}}$ . Subsequently, in the Hide/Reveal stage, $\\theta_{\\text{stego}}$ is fitted to represent the cover data, $x_{\\text{cover}}$ , while preserving the parameters of $\\theta_{\\text{secret}}$ . The Layer-wise Permutation Encoding/Decoding stage introduces a layer-wise permutation mechanism, designed to avoid detection of the secret data's presence and location.", + "bbox": [ + 212, + 146, + 787, + 237 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Data Representation Transformation", + "text_level": 1, + "bbox": [ + 214, + 255, + 565, + 271 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In the first stage, we transform the secret data into Implicit Neural Representations (INRs) by fitting multi-layer perceptrons (MLP) with sine activation functions for each data. This network was first introduced by [18] as SIREN (Sinusoidal representations for neural networks) and is widely used in the INR research field. The structure of the MLP network has $n$ hidden layers of size $D$ and the output is represented as follows:", + "bbox": [ + 212, + 276, + 787, + 367 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathbf {y} = \\mathbf {W} ^ {(n)} \\left(g _ {n - 1} \\circ \\dots \\circ g _ {1} \\circ g _ {0}\\right) \\left(\\mathbf {x} _ {0}\\right) + \\mathbf {b} ^ {(n)}, \\\\ \\text {w h e r e} \\mathbf {x} _ {i + 1} = g _ {i} \\left(\\mathbf {x} _ {i}\\right) = \\sigma \\left(\\mathbf {W} ^ {(i)} \\mathbf {x} _ {i} + \\mathbf {b} ^ {(i)}\\right), \\tag {1} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 282, + 373, + 784, + 419 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\circ$ is a function composition of fully-connected layers. In the equation, $\\mathbf{x_i}$ is the input of the $i^{\\mathrm{th}}$ layer for $i \\in \\{0,1,2,\\dots,n\\}$ , $\\mathbf{y} \\in \\mathbb{R}^{O}$ is the output value corresponding to $\\mathbf{x_0} \\in \\mathbb{R}^I$ , and $g_{i} \\colon \\mathbb{R}^{D} \\to \\mathbb{R}^{D}$ . For our experiments, input and output dimensions $(I,O)$ are $(1,1)$ , $(2,3)$ , $(3,1)$ , $(3,3)$ for audio, image, 3D shapes, and video, respectively. If the input or output dimension of the secret INRs exceeds that of the cover INR, our method employs a strategic reduction in the number of hidden layers within the secret INR. Additionally, as the dimension of the hidden layer $D$ is fixed for each cover modality, the secret INRs' hidden layer dimensions are set accordingly.", + "bbox": [ + 212, + 422, + 787, + 558 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In general, given a set $S$ of inputs $\\mathbf{x} \\in \\mathbb{R}^I$ and the corresponding outputs $\\mathbf{y} \\in \\mathbb{R}^O$ , the loss function is given by", + "bbox": [ + 212, + 559, + 787, + 589 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {r e c o n}} (\\theta) = \\sum_ {(\\mathbf {x}, \\mathbf {y}) \\in \\mathcal {S}} \\| f _ {\\theta} (\\mathbf {x}) - \\mathbf {y} \\| _ {2} ^ {2} \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 595, + 784, + 628 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": ", where $f_{\\theta}$ is the neural representation of the data. For example, given a 2D image, the set $S$ consists of 2D coordinates $\\mathbf{x} \\in \\mathbb{R}^2$ and the corresponding RGB values $\\mathbf{y} \\in \\mathbb{R}^3$ . INRs enable a variety of data types to be expressed in this unified network architecture. This benefits the overall security paradigm of our steganography framework by hiding the underlying data types.", + "bbox": [ + 212, + 633, + 787, + 712 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Hide and Reveal", + "text_level": 1, + "bbox": [ + 214, + 728, + 401, + 742 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we explain our main idea associated with the hiding process. The secret INRs, $\\theta_{\\text{secret}}$ , undergo a process of allocation and fitting to the cover data, $x_{\\text{cover}}$ . Within the weight space, only the diagonal blocks of weight matrices are occupied by the parameters of $\\theta_{\\text{secret}}$ , so that the non-diagonal parameters can be fitted to $x_{\\text{cover}}$ , while ensuring the diagonal block's weight values to remain unaltered.", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "First, we explain when the number of secret data, $N$ , is two without losing generality for hiding multiple data. The number of input nodes, output nodes, hidden layers, and the dimension of the hidden layers of $\\theta_{\\text{secret1}}$ and $\\theta_{\\text{secret2}}$ are each set to $(I_1,O_1,n_1,D_1)$ , $(I_2,O_2,n_2,D_2)$ , respectively. And $(I,O,n,D)$ for the stego INR network, $\\theta_{\\text{stego}}$ , where $D_1 + D_2$ is set to equal $D$ . Now, we substitute the parameters of the initialized $\\theta_{\\text{stego}}$ by concatenating $\\theta_{\\text{secret1}}$ and $\\theta_{\\text{secret2}}$ as shown in Figure 2. Note that the initialized parameters of $\\theta_{\\text{stego}}$ are omitted for clarity. After the substitution, the parameter of $\\theta_{\\text{stego}}$", + "bbox": [ + 215, + 146, + 488, + 404 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/39da45694ca954d07aa7a484592951658f4e9d5354c0995d2fe1e0adf468c384.jpg", + "image_caption": [ + "Fig.2: An example of allocating two secret INRs, $\\theta_{\\text{secret1}}$ and $\\theta_{\\text{secret2}}$ , into the stego INR, $\\theta_{\\text{stego}}$ . For $\\theta_{\\text{secret1}}, \\theta_{\\text{secret2}}$ , and $\\theta_{\\text{stego}}$ , $(I_1 = 1, O_1 = 1, n_1 = 4, D_1 = 4)$ , $(I_2 = 3, O_2 = 3, n_2 = 3, D_2 = 5)$ , and $(I = 2, O = 3, n = 4, D = 9)$ , respectively." + ], + "image_footnote": [], + "bbox": [ + 496, + 146, + 789, + 253 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {W} ^ {(i)} = \\left( \\begin{array}{l l} \\mathbf {W} _ {1} ^ {(i)} & \\mathbf {W} _ {0 1} ^ {(i)} \\\\ \\mathbf {W} _ {0 2} ^ {(i)} & \\mathbf {W} _ {2} ^ {(i)} \\end{array} \\right), \\mathbf {b} ^ {(i)} = \\left( \\begin{array}{l} \\mathbf {b} _ {1} ^ {(i)} \\\\ \\mathbf {b} _ {2} ^ {(i)} \\end{array} \\right). \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 346, + 409, + 785, + 448 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here, $\\mathbf{W}^{(i)}$ , $\\mathbf{W}_1^{(i)}$ , $\\mathbf{W}_2^{(i)}$ and $\\mathbf{b}^{(i)}$ , $\\mathbf{b}_1^{(i)}$ , $\\mathbf{b}_2^{(i)}$ are the $i^{\\mathrm{th}}$ layer's weight matrices and bias vectors of $\\theta_{stego}$ , $\\theta_{secret1}$ and $\\theta_{secret2}$ , where $i \\in \\{0, \\dots, n\\}$ . If $\\theta_{secret1}$ or $\\theta_{secret2}$ have fewer hidden layers compared to $\\theta_{stego}$ , the parameters of $\\theta_{stego}$ are not substituted. $\\mathbf{W}_{01}^{(i)}$ and $\\mathbf{W}_{02}^{(i)}$ are the remaining parameters of $\\theta_{stego}$ .", + "bbox": [ + 212, + 453, + 787, + 521 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Now, $\\theta_{stego}$ is fitted to $x_{cover}$ through a selective parameter update using a binary mask, so that the parameters of $\\theta_{secret1}$ and $\\theta_{secret2}$ are preserved while the remaining weights get updated. After successfully updating the weight space, the reconstructed discrete representation depicts $x_{cover}$ and all secret data can be retrieved from $\\theta_{stego}$ .", + "bbox": [ + 212, + 521, + 787, + 595 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For $N > 2$ , the hiding process is expanded in the same manner, so we further explain when $N = 1$ . When there is only one secret data, the parameters of $\\theta_{\\text{secret1}}$ can be freely allocated in $\\theta_{\\text{stego}}$ . Suppose that $\\theta_{\\text{secret1}}$ is allocated in the middle of $\\theta_{\\text{stego}}$ , then the weight space of $\\theta_{\\text{stego}}$ is as follows:", + "bbox": [ + 212, + 595, + 787, + 657 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {W} ^ {(i)} = \\left( \\begin{array}{l l l} \\mathbf {W} _ {0 1} ^ {(i)} & \\mathbf {W} _ {0 2} ^ {(i)} & \\mathbf {W} _ {0 3} ^ {(i)} \\\\ \\mathbf {W} _ {0 4} ^ {(i)} & \\mathbf {W} _ {1} ^ {(i)} & \\mathbf {W} _ {0 5} ^ {(i)} \\\\ \\mathbf {W} _ {0 6} ^ {(i)} & \\mathbf {W} _ {0 7} ^ {(i)} & \\mathbf {W} _ {0 8} ^ {(i)} \\end{array} \\right), \\mathbf {b} ^ {(i)} = \\left( \\begin{array}{l} \\mathbf {b} _ {0 1} ^ {(i)} \\\\ \\mathbf {b} _ {1} ^ {(i)} \\\\ \\mathbf {b} _ {0 2} ^ {(i)} \\end{array} \\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 318, + 661, + 785, + 720 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathbf{W}^{(i)}$ , $\\mathbf{W}_1^{(i)}$ and $\\mathbf{b}^{(i)}$ , $\\mathbf{b}_1^{(i)}$ are the $i^{\\mathrm{th}}$ layer's weight matrices and bias vectors of $\\theta_{stego}$ and $\\theta_{secret1}$ , for $i \\in \\{0, \\dots, n\\}$ . $\\mathbf{W}_{01}^{(i)}, \\mathbf{W}_{02}^{(i)}, \\dots, \\mathbf{W}_{08}^{(i)}, \\mathbf{b}_{01}^{(i)}$ , and $\\mathbf{b}_{02}^{(i)}$ are the remaining parameters of $\\theta_{stego}$ . This network then goes through the same processes as when there are multiple secret data.", + "bbox": [ + 212, + 726, + 787, + 794 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The inherent flexibility of our approach is highlighted by its capability to insert diverse data types, in varying amounts, at arbitrary desired positions. This versatility addresses and mitigates capacity constraints.", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "bbox": [ + 330, + 113, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.4 Layer-wise Permutation Encoding and Decoding", + "text_level": 1, + "bbox": [ + 215, + 146, + 660, + 162 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To enhance security of our method, we strategically permute the nodes within each layer of the stego network. This layer-wise permutation allows the parameters of the secret INRs to be distributed throughout $\\theta_{stego}$ , making the parameters indistinguishable and thus undetectable. In this section, we demonstrate how the permutation is executed via one 128-bit private key $\\rho$ , utilizing a cryptographic key derivation function (KDF), which derives one or more secret keys from a master key. First, the private key is randomly selected and is employed to generate $n$ secret keys for the $n$ hidden layers of $\\theta_{stego}$ . Subsequently, the nodes of each layer are permuted according to the secret key assigned to each layer. The total number of possible permutation variations per INR is $(\\mathbf{D}!)^n$ , where $D$ is the dimension of the hidden layer. This shows that the security implications of this permutation intensify, as the possible combinations of permutation grow exponentially with the number of hidden layers in the $\\theta_{stego}$ .", + "bbox": [ + 212, + 170, + 787, + 366 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "It is crucial to emphasize that the overall functionality of the neural network remains unchanged throughout this operation. This operation leverages the inherent property of permutation invariance exhibited by Multi-Layer Perceptrons (MLPs) within a single layer. As INRs are also MLP networks, all permuted networks are identical to the original network. Therefore, $\\theta_{\\text{stepo}}$ is invariant to the layer-wise permutation, whereas extracting the secret INR networks becomes impossible without the private key.", + "bbox": [ + 212, + 367, + 787, + 473 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiment", + "text_level": 1, + "bbox": [ + 215, + 494, + 366, + 513 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We explore the performance of INRSteg focusing on its resilience to distortion, capacity for information hiding, and security against detection. Distortion measures both the indistinguishability between the cover data and the reconstructed data from stego INR, and the performance drop during the hiding and revealing stage of the secret data. Capacity refers to the amount of hidden information that can be privately embedded within the cover data. Security indicates the extent to which the secret data can avoid detection when subjected to steganalysis.", + "bbox": [ + 212, + 525, + 787, + 632 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To thoroughly evaluate the distortion, we employ several metrics tailored to different modalities, which are organized in Appendix A, as well as visualization. In terms of capacity, we present various cross-modal steganography experiments and compare the model size with other previous steganography models. For security, we compute the detection accuracy using image steganalysis models, SiaStegNet [26] and XuNet [22], and visualize weight distribution to show the effects of permutation operation.", + "bbox": [ + 212, + 632, + 787, + 737 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In our groundbreaking research, we highlight three pivotal aspects of our experimental evaluation of INRSteg, a novel steganography method that sets new benchmarks in data hiding techniques:", + "bbox": [ + 212, + 738, + 787, + 784 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "- Cross-Modal Steganography We initiated pioneering experiments in cross-modal steganography, demonstrating our method's unique capability to privately embed audio and video data within images. Comprehensive ablation", + "bbox": [ + 225, + 794, + 792, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "study demonstrates that INRSteg is generally applicable across all data modalities achieving high-quality concealment(Sec. 4.1).", + "bbox": [ + 240, + 146, + 784, + 176 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "- Intra-Modal Steganography We conduct experiments of hiding data within the same modality, specifically embedding images within images. This approach allowed us to conduct a comparative analysis of distortion and security metrics against those reported in existing literature, showcasing the advanced capabilities of INRSteg. For ablation study, we conduct multi-image steganography experiments varying the amount of secret data(Sec. 4.2).", + "bbox": [ + 227, + 176, + 795, + 267 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "- Efficiency and Robustness Analysis To show the efficiency of INRSteg, we perform computational cost comparisons with five existing steganography models. We test the robustness of INRSteg by simulating a challenging scenario where network weights undergo quantization. It demonstrates that our method maintains high performance and robustness even under harsh conditions, which ensures secure and reliable steganography across a wide range of applications(Sec. 4.3).", + "bbox": [ + 227, + 268, + 787, + 375 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/c02c80906a0ca4808853c38dc7d07368f40ce727c2d8e6713aaddaf82361d74f.jpg", + "table_caption": [ + "Table 1: Results of Cross-modal steganography experiment. VoxCeleb2 and ImageNet dataset are used for secret data and cover data, respectively. \"Secret/Revealed\" indicates the recovery performance of secret data. \"Cover/Stego\" indicates the reconstruction performance from stego INR." + ], + "table_footnote": [], + "table_body": "
Secret/RevealedCover/Stego
VoxCeleb2ImageNet
AudioVideoImage
SNR ↑MAE ↓PSNR ↑APD ↓PSNR ↑RMSE ↓
37.558(±5.4)0.314(±0.3)41.448(±3.1)1.349(±0.5)39.258(±4.4)2.948(±1.5)
", + "bbox": [ + 217, + 482, + 785, + 565 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Cross-modal Steganography", + "text_level": 1, + "bbox": [ + 215, + 616, + 493, + 633 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ImageNet and VoxCeleb2 For cross-modal steganography experiment, we conduct a pioneering steganography experiment that embeds the VoxCeleb2 dataset within images from ImageNet dataset. VoxCeleb2 dataset has both video and audio files, thereby enabling simultaneous playback of visual and auditory data. Using our INRSteg method, we leverage images from ImageNet dataset as cover data to hide video and audio data at the same time. Tab. 1 shows the distortion performance for secret/revealed and cover/stego performance demonstrating the efficacy of our approach in preserving the content of cover and the embedded data. For the secret and the revealed secret data pair, as our framework goes through lossless recovery in terms of INR, the secret/revealed secret performance is solely dependent on the data representation transformation phase. Moreover, Figure 3 shows visualization of the reconstructed data, recovery of video and audio secret data. There is no noticeable quality degradation,", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "bbox": [ + 330, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/49d0c7d2469e8002b795117e96946787a8db390d870744a2017e68d2ccbc8203.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 330, + 143, + 442, + 231 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/220fbd9c321cf85b68c71b4e3e6e5da978590d0b7e6c0b0e4831b0302741b2c2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 450, + 143, + 562, + 231 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/fe1a3ba3109485489b791ae8117e1db9797d656f99a909d58e8ca73b8ee434d9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 563, + 143, + 673, + 231 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/8bc8fc2fa71732ec1b1d0328ae28ffe04bb3c211676e699cd11d443ef6d156c7.jpg", + "image_caption": [ + "Fig. 3: Visualization results of cross-modal steganography. Can you identify which image is the cover and the reconstructed cover data? For the video and audio examples, can you determine which are the secret and revealed secret data? For images, upper one is cover data and below is reconstructed cover data. For video, upper row is secret data and below is revealed secret data. For audio, the left is secret data and the right is revealed secret data." + ], + "image_footnote": [], + "bbox": [ + 330, + 233, + 442, + 319 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/9522e8d1e7d2a66ba79f990bc6b979ffdd9faa3011ed7cec7277982715861a05.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 449, + 232, + 563, + 319 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/18d30121a3d170dfa62a786857b87748622cc41de2f1e86d845a0c309800b67e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 563, + 232, + 671, + 319 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "which implies successful results of cross-modal steganography. Notably, cross-modal steganography is unprecedented, representing a significant improvement in the field of steganography. More reconstruction results using other modalities can be seen in Appendix C, showing successful multi-data steganography with almost no visible difference for both 3D shape and video. Additionally, there are visualization results of weight space after steganography and comparison results of weight distribution after permutation operation in Appendix D, demonstrating the security of INRSteg.", + "bbox": [ + 212, + 441, + 787, + 561 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ablation study For ablation study, we try to demonstrate that INRSteg is generally applicable across all data modalities for steganography. Therefore, we design experiments that cover all combinations of data modalities where cover data type is image, audio, or video and secret data type is image, audio, 3D shape, or video. The distortion performance of all single-data cross-modal steganography tasks can be seen in Tab. 2, demonstrating achievement of exceptional performance for all cases. For additional reconstruction results, we show them in Appendix C. Recovery performance results for secret data are in Appendix E. A deeper analysis of the results presented in Tab. 2 reveals two key factors that influence improved cover/stego performance: the modality of the secret and cover data, and the capacity of the neural network utilized for the stego INR. We observe that when the modalities of the secret and cover data match, the stego INR demonstrates enhanced accuracy in fitting to the cover data. This phenomenon is attributed to the intrinsic properties of INRs, where the weight spaces of neural networks exhibit similarities when representing with same modality data [21]. Moreover, leveraging the capabilities of INRs, employing a larger neural network for the cover data fitting process enhances the quality of cover data reconstruc", + "bbox": [ + 212, + 583, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 361, + 128 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "tion. This can be shown in Tab. 2, where the performance of hiding 3D shapes in images outperforms hiding images in images. This property allows flexible control of the network size for secret and cover data based on the required recovery quality and resource space constraints in the real world. An additional ablation study about the effectiveness of the padding ratio is proposed in Appendix B.", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/252a8ab90a0e66fe496febecbce51b50681f85e5b7e752122352d9edb0b8626a.jpg", + "table_caption": [ + "Table 2: Cover/Stego performance of single-data steganography. The best results are highlighted for each cover modality." + ], + "table_footnote": [], + "table_body": "
Secret typeCover type
ImageAudioVideo
PSNR ↑RMSE ↓SNR ↑MAE ↓PSNR ↑APD ↓
Image62.340.20432.630.59935.263.315
Audio63.160.17941.420.26834.693.574
Video56.180.40827.200.93141.261.532
3D shape92.950.00023.121.40338.542.244
", + "bbox": [ + 271, + 290, + 733, + 397 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.2 Intra-modal Steganography", + "text_level": 1, + "bbox": [ + 214, + 452, + 488, + 469 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Image steganography In this section, we compare INRSteg to existing image-to-image steganography methods to show that our framework also excels in intra-modal tasks. Tab. 3 compares the performance of INRSteg with other deep learning based image-to-image steganography methods, DeepMIH [4] and an improved DeepSteg [1]. INRSteg outperforms on all metrics showing that our framework achieves state-of-the-art performance. For hiding two secret images into one image, the results in Appendix F, and Figure 4 further visualizes the cover/stego and secret/revealed secret image pairs for two images into one steganography. We continue to compare our results with DeepMIH using difference maps each enhanced by 10, 20, and 30 times. For INRSteg, nearly no visual differences exist between the original and the revealed images even when the difference map is enhanced 30 times. For DeepMIH, on the other hand, we can notice obvious differences for all difference maps when comparing cover/stego and secret1,2/revealed secret 1,2 pairs.", + "bbox": [ + 212, + 481, + 787, + 694 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Image steganalysis To examine security, we adopt two image steganalysis tools, SiaStegNet [26] and XuNet [22]. Tab. 4 presents the detection accuracy of our framework and other models. The security is higher as the detection accuracy is closer to $50\\%$ . Unlike other steganography models, the detection accuracy of INRSteg is $50\\%$ , meaning that the steganalysis tool completely fails to distinguish the stego data from the cover data. This shows that our framework is undetectable using existing steganalysis tools and assures perfect security. This is because our framework does not directly edit the data in the discrete", + "bbox": [ + 212, + 719, + 789, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "bbox": [ + 330, + 114, + 730, + 130 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/7d83dba9c971eabf5befbe648aeaf956009fbdd4ed186674103a60512921e151.jpg", + "image_caption": [ + "Fig. 4: A comparison of difference maps (enhanced by $10\\mathrm{x}$ , $20\\mathrm{x}$ , and $30\\mathrm{x}$ ) between the original images and the revealed images. Columns 2-6 are results of INRSteg and columns 7-10 are results of DeepMIH [4]." + ], + "image_footnote": [], + "bbox": [ + 250, + 147, + 753, + 291 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "representation state, but performs manipulation after transforming the representation into a neural network, which is unnoticeable when re-transformed to the discrete representation. Moreover, we conduct steganalysis analysis on multi-images steganography. The results in Appendix F.", + "bbox": [ + 212, + 378, + 784, + 441 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Multi-image steganography In Tab. 5, we conduct experiments for multi-image steganography hiding more than two images when the size of stego INR is fixed, so that one may have to decrease the network size of each hidden data in order to fit the memory capacity. The results show that high recovery performance maintains even when increasing the number of hidden data. For more experiments with other modalities, please refer to Appendix G.", + "bbox": [ + 212, + 463, + 784, + 555 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/466bd912deb610ff8483887e16f84b323e2a41994b6715140b9b1c2b8ac73703.jpg", + "table_caption": [ + "Table 3: Performance comparison of imagedto-image steganography." + ], + "table_footnote": [], + "table_body": "
MetricMAE ↓PSNR ↑SSIM ↑RMSE ↓
DeepStegcover2.57637.480.9473.417
secret3.57033.340.9573.57
DeepMIHcover2.83936.050.9324.276
secret3.60432.970.95505.746
INRStegcover0.15362.340.9990.204
secret1.08445.840.9881.326
", + "bbox": [ + 223, + 623, + 547, + 731 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/d7f3c492506cb68c4dd75101dd4e2163161c7920647f181d4141af0559c8dc33.jpg", + "table_caption": [ + "Table 4: Steganalysis comparison of image-to-image steganography." + ], + "table_footnote": [], + "table_body": "
Accuracy (%)
SiaStegNetXuNet
DeepSteg92.8775.83
DeepMIH90.7090.82
INRSteg50.0050.00
", + "bbox": [ + 560, + 637, + 774, + 729 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Efficiency and Robustness Analysis", + "text_level": 1, + "bbox": [ + 215, + 752, + 552, + 768 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Model Size Comparison In our efficiency analysis, we compare model sizes to evaluate the computational cost and efficiency of our proposed INRSteg relative to existing steganography models. As described in Tab. 6, our INRSteg achieves a remarkably compact architecture, consisting of only 400,000 param", + "bbox": [ + 212, + 779, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 361, + 127 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "eters. Compared to other existing steganography models, this advantage is notable. DeepSteg [1], with 42.58 million parameters, is approximately 107.46 times larger than our model. DeepMIH [4] model, with 12.42 million parameters, has 31.34 times more parameters, and LF-VSN [14], at 7.40 million parameters, is 18.68 times larger. Especially, CRoSS [27] contains 1,066.24 million parameters, corresponding to 2690.54 times the size of the model. This comparative analysis highlights the efficiency of our INRSteg, demonstrating its capability to achieve robust steganography performance with a significantly reduced computational space. The small model not only promotes faster training and inference times, but also opens up opportunities for deployment on devices with limited computational resources such as smartphones.", + "bbox": [ + 212, + 146, + 787, + 313 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/aee28b3d437aa74f4326df4c528a31f440dfe8c52728b0cde1f4874449877503.jpg", + "table_caption": [ + "Table 5: Distortion performance of hiding multiple images $(>2)$ into one." + ], + "table_footnote": [], + "table_body": "
MetricPSNR ↑RMSE ↓
3 imagescover62.310.204
secret 1,2,343.671.642
4 imagescover62.580.153
secret 1,2,3,441.862.059
", + "bbox": [ + 228, + 392, + 493, + 474 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/59275b424280567fd389c299637a811c817694d627b336ee858249a5fd15f127.jpg", + "table_caption": [ + "Table 6: Model Size Comparison." + ], + "table_footnote": [], + "table_body": "
Model#ParamsRatio to Ours
DeepSteg [1]42.58M107.46×
HiNet [8]4.05M10.22×
DeepMIH [4]12.42M31.34×
CROSS [27]1,066.24M2690.54×
LF-VSN [14]7.40M18.68×
Ours0.40M1×
", + "bbox": [ + 524, + 377, + 769, + 473 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Robustness We explore the robustness of INRSteg under harsh conditions in real-world scenarios. In particular, we apply quantization operation to store model parameters from float32 to int8 format. This process aims to simulate scenarios where data precision must be reduced due to storage or transmission constraints. After quantization, we recover the parameters from int8 to float32 and evaluate the performance metrics of the recovered secret images. Tab. 7 describes the results of performance comparison before and after quantization across three cover types: image, audio, and video. Notably, while PSNR values decrease after quantization, this decrease is not as significant as might be expected given the harsh nature of the quantization process. This indicates that INRSteg has a robust ability to maintain secret data quality despite the data compression and precision reductions. Furthermore, something to crucially note in Tab. 7 is that the SSIM value hardly changes after quantization. Since SSIM measures the perceptual quality, it is a more representative metric that evaluates image quality. Therefore, the results indicate that the visual content of the secret images remain almost completely. The reconstruction results are in Appendix H. Additionally, we show preserving secret data when using another model compression method, pruning, in Appendix I.", + "bbox": [ + 212, + 489, + 787, + 762 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Limitations and Discussion", + "text_level": 1, + "bbox": [ + 215, + 781, + 513, + 797 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We would like to highlight the potential negative impacts that steganography frameworks may result in the ethical aspect. Users must be cautious not to utilize", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "bbox": [ + 330, + 113, + 730, + 130 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 127 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/07e05bbe8bcf23f14650416b983522df6fafeebb9a60e673e44abe71046890a1.jpg", + "table_caption": [ + "Table 7: Performance Metrics Before and After Quantization for Different Cover Types. Pre-Q denotes metrics before quantization, Post-Q denotes metrics after quantization. Higher values are better for PSNR and SSIM, while lower values are preferred for RMSE and MAE." + ], + "table_footnote": [], + "table_body": "
Cover typePSNR ↑RMSE ↓SSIM ↑MAE ↓
Pre-QPost-QPre-QPost-QPre-QPost-QPre-QPost-Q
Image40.076633.74832.52455.23750.98210.95541.70853.519
Audio40.076633.54382.52455.36230.98210.95291.70853.723
Video40.076633.82762.52455.18990.98210.95831.70853.417
", + "bbox": [ + 241, + 212, + 759, + 292 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "our work in unethical situations, where one may hide inappropriate information. Additional limitations are described in Appendix J.", + "bbox": [ + 215, + 320, + 782, + 349 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 373, + 356, + 388 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In conclusion, this paper introduces INRSteg, an innovative framework designed for the concealment of multiple cross-modal data through the utilization of the weight space inherent in Implicit Neural Representations (INR). Our extensive experimentation demonstrates that INRSteg surpasses existing steganography techniques in key areas, namely distortion evaluation, data capacity, and security measures, across both intra and cross-modal steganography scenarios. A notable advantage of INRSteg is its deployment of smaller model sizes, which directly contributes to reduced energy consumption, making it exceptionally suited for practical real-world applications. Furthermore, our analysis confirms the robustness of INRSteg, even when subjected to the rigorous demands of quantization operations. We believe that INRSteg establishes a new benchmark for achieving an optimal balance between efficiency and performance within the steganography domain, paving the way for future advancements in secure and efficient steganography techniques.", + "bbox": [ + 215, + 405, + 785, + 616 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 640, + 401, + 656 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.RS-2022-II220184, Development and Study of AI Technologies to Inexpensively Conform to Evolving Policy on Ethics) and Institute for Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No. 2021-0-01381, Development of Causal AI through Video Understanding and Reinforcement Learning, and Its Applications to Real Environments).", + "bbox": [ + 215, + 671, + 785, + 792 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 361, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Baluja, S.: Hiding images in plain sight: Deep steganography. In: Advances in Neural Information Processing Systems (2017)", + "2. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021)", + "3. Dupont, E., Kim, H., Eslami, S., Rezende, D., Rosenbaum, D.: From data to functa: Your data point is a function and you can treat it like one. arXiv preprint arXiv:2201.12204 (2022)", + "4. Guan, Z., Jing, J., Deng, X., Xu, M., Jiang, L., Zhang, Z., Li, Y.: Deepmih: Deep invertible network for multiple image hiding. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)", + "5. Han, G., Lee, D.J., Hur, J., Choi, J., Kim, J.: Deep cross-modal steganography using neural representations. In: 2023 IEEE International Conference on Image Processing (ICIP) (2023)", + "6. Huu, Q.P., Dinh, T.H., Tran, N.N., Van, T.P., Minh, T.T.: Deep neural networks based invisible steganography for audio-into-image algorithm. In: 2019 IEEE 8th Global Conference on Consumer Electronics (GCCE) (2019)", + "7. Jain, Y.K., Ahirwal, R.: A novel image steganography method with adaptive number of least significant bits modification based on private stego-keys. In: International Journal of Computer Science and Security (IJCSS) (2010)", + "8. Jing, J., Deng, X., Xu, M., Wang, J., Guan, Z.: Hinet: Deep image hiding by invertible network. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021)", + "9. Lee, J., Tack, J., Lee, N., Shin, J.: Meta-learning sparse implicit neural representations. Advances in Neural Information Processing Systems (2021)", + "0. Li, C., Feng, B.Y., Fan, Z., Pan, P., Wang, Z.: Steganerf: Embedding invisible information within neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)", + "1. Liu, Y., Liu, S., Wang, Y., Zhao, H., Liu, S.: Video steganography: A review. Neurocomputing (2019)", + "2. Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., Galstyan, A.: A survey on bias and fairness in machine learning. ACM Comput. Surv. (2021)", + "3. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM (2021)", + "4. Mou, C., Xu, Y., Song, J., Zhao, C., Ghanem, B., Zhang, J.: Large-capacity and flexible video steganography via invertible neural network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)", + "5. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition (2019)", + "6. Shi, H., Dong, J., Wang, W., Qian, Y., Zhang, X.: Ssgan: Secure steganography based on generative adversarial networks. In: Advances in Multimedia Information Processing - PCM 2017 (2018)", + "7. Simmons, G.J.: The subliminal channel and digital signatures. In: Advances in Cryptology (1985)", + "8. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in neural information processing systems (2020)" + ], + "bbox": [ + 225, + 176, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Implicit Steganography Beyond the Constraints of Modality", + "bbox": [ + 330, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "19. Strümpler, Y., Postels, J., Yang, R., Gool, L.V., Tombari, F.: Implicit neural representations for image compression. In: European Conference on Computer Vision (2022)", + "20. Subramanian, N., Elharrouss, O., Al-Maadeed, S., Bouridane, A.: Image steganography: A review of the recent advances. IEEE Access (2021)", + "21. Tancik, M., Mildenhall, B., Wang, T., Schmidt, D., Srinivasan, P.P., Barron, J.T., Ng, R.: Learned initializations for optimizing coordinate-based neural representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2021)", + "22. Xu, G.: Deep convolutional neural network to detect j-uniward. In: Proceedings of the 5th ACM Workshop on Information Hiding and Multimedia Security (2017)", + "23. Xu, G., Wu, H.Z., Shi, Y.Q.: Structural design of convolutional neural networks for steganalysis. IEEE Signal Processing Letters (2016)", + "24. Yang, H., Ouyang, H., Koltun, V., Chen, Q.: Hiding video in audio via reversible generative models. In: 2019 IEEE/CVF International Conference on Computer Vision (ICCV) (2019)", + "25. Yang, J., Liu, K., Kang, X., Wong, E.K., Shi, Y.Q.: Spatial image steganography based on generative adversarial network. arXiv preprint arXiv:1804.07939 (2018)", + "26. You, W., Zhang, H., Zhao, X.: A siamese cnn for image steganalysis. IEEE Transactions on Information Forensics and Security (2021)", + "27. Yu, J., Zhang, X., Xu, Y., Zhang, J.: Cross: Diffusion model makes controllable, robust and secure image steganography. Advances in Neural Information Processing Systems (2024)", + "28. Zhang, H., Geng, G., Xiong, C.: Image steganography using pixel-value differ-encing. In: 2009 Second International Symposium on Electronic Commerce and Security (2009)", + "29. Zhou, H., Zhang, W., Chen, K., Li, W., Yu, N.: Three-dimensional mesh steganography and steganalysis: A review. IEEE Transactions on Visualization and Computer Graphics (2022)", + "30. Zhu, J., Kaplan, R., Johnson, J., Fei-Fei, L.: Hidden: Hiding data with deep networks. In: Proceedings of the European conference on computer vision (ECCV) (2018)" + ], + "bbox": [ + 215, + 146, + 784, + 590 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Song et al.", + "bbox": [ + 271, + 114, + 361, + 127 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_model.json b/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_model.json new file mode 100644 index 0000000000000000000000000000000000000000..70fecf2e82b7fdae2fc2b47d983dcb3c490bdd54 --- /dev/null +++ b/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_model.json @@ -0,0 +1,1981 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.296, + 0.142, + 0.709, + 0.187 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "text", + "bbox": [ + 0.34, + 0.213, + 0.664, + 0.244 + ], + "angle": 0, + "content": "Sojeong Song\\(^{\\dagger,1}\\), Seoyun Yang\\(^{\\dagger,1}\\), Chang D. Yoo\\(^{\\ddagger,1}\\), and Junmo Kim\\(^{\\ddagger,1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.255, + 0.255, + 0.747, + 0.283 + ], + "angle": 0, + "content": "\\(^{1}\\) Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea" + }, + { + "type": "text", + "bbox": [ + 0.318, + 0.285, + 0.686, + 0.298 + ], + "angle": 0, + "content": "akqqq4985@kaist.ac.kr, seoyun.yang@navercorp.com" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.34, + 0.74, + 0.59 + ], + "angle": 0, + "content": "Abstract. Cross-modal steganography is committed to hiding secret information of one modality in another modality. Despite the advancement in the field of steganography by the introduction of deep learning, cross-modal steganography still remains to be a challenge to the field. The incompatibility between different modalities not only complicate the hiding process but also results in increased vulnerability to detection. To rectify these limitations, we present INRSteg, an innovative cross-modal steganography framework based on Implicit Neural Representations (INRs). We introduce a novel network allocating framework with a masked parameter update which facilitates hiding multiple data and enables cross modality across image, audio, video and 3D shape. Moreover, we eliminate the necessity of training a deep neural network and therefore substantially reduce the memory and computational cost and avoid domain adaptation issues. To the best of our knowledge, in the field of steganography, this is the first to introduce diverse modalities to both the secret and cover data. Detailed experiments in extreme modality settings demonstrate the flexibility, security, and robustness of INRSteg." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.604, + 0.741, + 0.631 + ], + "angle": 0, + "content": "Keywords: Steganography \\(\\cdot\\) Implicit neural representations \\(\\cdot\\) Cross-modal steganography" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.66, + 0.377, + 0.675 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.695, + 0.788, + 0.802 + ], + "angle": 0, + "content": "Nowadays, an unprecedented volume of data is shared and stored across various digital platforms and the volume is bound to intensify even further in the future. This proliferation and accessibility of data contributes to convenience in our lives and enables innovation and advancement that weren't achievable in the past; however, it also brings a concerning challenge to the security of information. Steganography aims to hide the secret information inside a cover data resulting in a stego data, also called the container. Unlike cryptography," + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.811, + 0.51, + 0.825 + ], + "angle": 0, + "content": "\\(\\dagger\\) : Both authors have equally contributed." + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.825, + 0.401, + 0.84 + ], + "angle": 0, + "content": "†: Corresponding author." + }, + { + "type": "list", + "bbox": [ + 0.232, + 0.811, + 0.51, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.363, + 0.129 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.284 + ], + "angle": 0, + "content": "which investigates in hiding the data of interest in a coded form, steganography operates with imperceptible concealment so that the existence of the secret data is undetectable. For example, individuals can upload their stego data to the cloud and securely trade their private keys with specific parties, and companies can leverage steganography to exchange confidential information, such as new product designs or sensitive meeting recordings, while including ownership details in the data. From a government perspective, steganography can covertly transmit information to foreign spies by inserting confidential national security information into seemingly ordinary cover data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.287, + 0.79, + 0.452 + ], + "angle": 0, + "content": "Up to now, image is the most commonly used modality of cover data, as it is less sensitive to human perception and is comparatively simple to embed secret information. However, image steganography tends to have a limit on payload capacity, and is susceptible to detection. Deep learning methods [1, 30] have increased the security, but suffer from unstable extraction and high computational costs [20]. Other modalities such as audio, video and 3D shape also undergo similar limitations [11, 29] and struggle with trade-offs between capacity and security. Moreover, for cross-modal steganography, where the modality of the secret and the cover data differs [5, 6, 24], these limitations intensify due to the difficulties that emerge when the dimension or capacity of the secret data exceed that of the cover data or when the secret data contains temporal information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.456, + 0.79, + 0.577 + ], + "angle": 0, + "content": "Implicit neural representations (INRs) have recently attracted extensive attention as an alternative data representation, using continuous and differentiable functions to represent data via parameters of a neural network. The concept of INRs offers a more flexible and expressive approach than the conventional notion of discrete representations. Multiple modalities, as audio, image, video and 3d shape, are all presentable using a single neural network in various resolutions [3]. Moreover, INRs benefit in capacity by reducing the memory cost according to the network design [9, 15]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.581, + 0.788, + 0.793 + ], + "angle": 0, + "content": "In this paper, we present INRSteg, the first cross-modal steganography framework available across a diverse range of modalities, including images, audio, video, and 3D shapes, for both the secret and cover data. By transforming the representation of all data to an implicit form, our framework takes advantage of the flexibility and high capacity inherent in INRs. The flexibility to all modalities enables cross-modal tasks that remained largely unexplored. Along with the versatility across the modalities, our framework is also capable of hiding multiple secret information into one cover data. In Sec. 4, we conduct the hiding of both an audio and an video into a single image, a task which was previously considered highly challenging due to the limited capacity of images. Our framework therefore further enables expansion and intriguing adaptation of steganography into a wider range of fields. In the medical field, for example, private information as an endoscopy video and an audio recording of the heart sound can be hidden under an image of a patient." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.788, + 0.842 + ], + "angle": 0, + "content": "To further enhance the security, layer-wise permutation of the INR network using a private key is additionally executed. Therefore, the secret INRs' network parameters can be well distributed within the stego INR's network. Revealing" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.332, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.278, + 0.145, + 0.729, + 0.396 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.408, + 0.788, + 0.533 + ], + "angle": 0, + "content": "Fig. 1: A general framework of INRSteg for hiding two types of secret data. All four data types can be transformed into INRs, and the red box shows which of the four data types is selected in this case. After the representation transformation of each secret data, the weights of the two INRs are allocated in a new MLP network. With the weight freezing technique, the weights from the secret data are fixed while the rest are fitted on the cover data. The existence of the secret data is concealed by permutation encoding via private key, which does not affect the reconstruction performance. The private key is then used to decode the permuted stego network, and the secret data are revealed by separating each MLP network." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.593, + 0.788, + 0.652 + ], + "angle": 0, + "content": "the secret data is executed by re-permuting and disassembling the weights of the stego INR. This procedure is not only simple but also guarantees a lossless revealing process as all neural representations of the secret data are fully recoverable." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.656, + 0.788, + 0.793 + ], + "angle": 0, + "content": "Additionally, our framework does not require any deep learning models to be trained for the hiding and revealing process, such as GAN [16, 25] or diffusion models [27]. This excludes the need for any training data and therefore our framework can prevent any biases that may arise from using training datasets [12] and avoids domain shift issues, allowing datasets of all modalities to be applied without any additional pre-processing. Moreover, by eliminating the use of deep networks, our work substantially reduces both the computational and memory costs associated with training and deploying models which have become a significant global challenge." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.84 + ], + "angle": 0, + "content": "The proposed framework, INRSteg, achieves flexible cross-modal steganography for multiple secret data by converting the data representation to neural networks. At the same time, we reduce computational and memory costs by" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.363, + 0.129 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.222 + ], + "angle": 0, + "content": "avoiding the use of deep neural networks. For intra-modal steganography, we demonstrate that INRSteg outperforms prior image steganography models such as DeepMIH [4] and DeepSteg [1]. We show INRSteg is robust in the real-world scenarios by applying quantization operation. These are our main contributions, and the details will be described in further sections:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.238, + 0.784, + 0.28 + ], + "angle": 0, + "content": "- Introduce an Implicit Neural Representation (INR) steganography framework that flexibly adopts to a large range of modalities and further enables all cross-modal steganography." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.284, + 0.785, + 0.31 + ], + "angle": 0, + "content": "- Demonstrate a neural network allocating procedure that enables cost-effective hiding and revealing of multiple secret data at once." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.314, + 0.784, + 0.342 + ], + "angle": 0, + "content": "- Comprehensive investigation on distortion, security and capacity shows that INRSteg achieves state-of-the-art cross-modal steganography." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.345, + 0.784, + 0.386 + ], + "angle": 0, + "content": "- Figure out that INRSteg is the most efficient compared to the previous steganography models and robust in real-world scenarios especially for quantization operation." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.238, + 0.785, + 0.386 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.416, + 0.383, + 0.431 + ], + "angle": 0, + "content": "2 Related work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.45, + 0.385, + 0.466 + ], + "angle": 0, + "content": "2.1 Steganography" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.789, + 0.734 + ], + "angle": 0, + "content": "Steganography is a technique that focuses on hiding confidential information by adeptly embedding data within other publicly accessible data, effectively concealing the very existence of the hidden message. When one is aware of this concealed data, it can be retrieved by a revealing process with an appropriate private key [17]. A prominent approach in historical methods is the Least Significant Bit (LSB) based method, which takes advantage of the imperceptibility of small changes to the least significant bits of the data [7,28]. With the rise of deep neural networks, the field of steganography has rapidly evolved to overcome the challenge of security and capacity. Deepsteg [1], which is an early work of image steganography, attempts to use an encoder and decoder to determine where to place the secret information. CROSS [27] utilizes diffusion models to only reveal the secret information when the accurate prompt is given. To enhance the capacity aspect while ensuring the security, invertible neural networks (INNs) have been actively adopted. In the image steganography field, HiNet [8] incorporates INNs with wavelet domain to minimize distortion, and DeepMIH [4] progresses to hide multiple images into one. LF-VSN [14] further attempts to hide seven videos into one utilizing the INN." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Notwithstanding their innovations, a recurrent limitation across these previous methods is the trade-off between capacity and security. If the cover data is damaged in any way during the embedding process, it becomes susceptible to detection by steganalysis algorithms [23, 26]. This vulnerability poses a significant limitation, especially when attempting to hide large volumes of data such as videos or 3d shapes. INRSteg cannot be detected by traditional steganalysis tools and therefore ensures security while maintaining high capacity." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.331, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.49, + 0.163 + ], + "angle": 0, + "content": "2.2 Cross-modal steganography" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.788, + 0.322 + ], + "angle": 0, + "content": "The evolution of steganography has also expanded to the concealment of information across different data modalities, such as embedding audio data within videos, which is called cross-modal steganography. [24] embeds video information into audio signals by leveraging the human visual system's inability to recognize high-frequency flickering, allowing for the hidden video to be decoded by recording the sound from a speaker and processing it. [6] utilizes a joint deep neural network architecture comprising two sub-models, one for embedding the audio into an image and another for decoding the image to retrieve the original audio. These methods achieve cross-modal steganography using deep learning techniques, but are still restricted on specified modalities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.323, + 0.788, + 0.49 + ], + "angle": 0, + "content": "Recent advancements in Implicit Neural Representations (INRs) have paved the way for a new paradigm in steganography [5, 10]. INRs have been leveraged to represent multiple modalities of data simultaneously. StegaNeRF [10] hides data of various modalities at viewpoints when rendering NeRF. [5] conceals audio, video, and 3D shape data within a cover image, leveraging RGB values as weights of the INRs. While these recent works represent a paradigm shift in steganography techniques, the capacity and security trade-off still remains an issue and the modality of the cover data is set to be singular. Our proposed method in this paper seeks to address and overcome this trade-off while maintaining the advantages of INRs and further eliminating the modality constraint on the cover data, demonstrating a significant advancement in the steganography research." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.511, + 0.517, + 0.525 + ], + "angle": 0, + "content": "2.3 Implicit neural representations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.701 + ], + "angle": 0, + "content": "Implicit neural representations (INRs) is a rapidly emerging field where data is expressed in a continuous and differentiable manner through neural networks. This representation [18] is resolution-agnostic [19] and is capable of compressing the data effectively [2]. These advantages highlight various applications of INRs that show superior performance than that of the array-based representation. For example, neural radiance field (NeRF) [13] constructs a 5d scene representation of a 3d object through view-dependent synthesis. [3] proposes a general framework that feeds a modulated INR directly on the downstream models and shows competitive performance on multiple modalities. [9] employs meta-learning coupled with pruning techniques to efficiently scale implicit neural representations for large datasets." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.725, + 0.331, + 0.74 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.756, + 0.357, + 0.77 + ], + "angle": 0, + "content": "3.1 Framework" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Our research focuses on INR steganography, where the data representations are transformed into Implicit Neural Representations (INRs), such as SIREN [18]. Figure 1 shows the general framework of our methodology, which is segmented into three sub-stages. In the Data Representation Transformation stage, secret" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.363, + 0.129 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.238 + ], + "angle": 0, + "content": "data are transformed into their corresponding Implicit Neural Representations, represented as \\(\\theta_{\\text{secret}}\\). Subsequently, in the Hide/Reveal stage, \\(\\theta_{\\text{stego}}\\) is fitted to represent the cover data, \\(x_{\\text{cover}}\\), while preserving the parameters of \\(\\theta_{\\text{secret}}\\). The Layer-wise Permutation Encoding/Decoding stage introduces a layer-wise permutation mechanism, designed to avoid detection of the secret data's presence and location." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.256, + 0.566, + 0.272 + ], + "angle": 0, + "content": "3.2 Data Representation Transformation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.277, + 0.789, + 0.368 + ], + "angle": 0, + "content": "In the first stage, we transform the secret data into Implicit Neural Representations (INRs) by fitting multi-layer perceptrons (MLP) with sine activation functions for each data. This network was first introduced by [18] as SIREN (Sinusoidal representations for neural networks) and is widely used in the INR research field. The structure of the MLP network has \\( n \\) hidden layers of size \\( D \\) and the output is represented as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.283, + 0.374, + 0.785, + 0.42 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathbf {y} = \\mathbf {W} ^ {(n)} \\left(g _ {n - 1} \\circ \\dots \\circ g _ {1} \\circ g _ {0}\\right) \\left(\\mathbf {x} _ {0}\\right) + \\mathbf {b} ^ {(n)}, \\\\ \\text {w h e r e} \\mathbf {x} _ {i + 1} = g _ {i} \\left(\\mathbf {x} _ {i}\\right) = \\sigma \\left(\\mathbf {W} ^ {(i)} \\mathbf {x} _ {i} + \\mathbf {b} ^ {(i)}\\right), \\tag {1} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.424, + 0.788, + 0.559 + ], + "angle": 0, + "content": "where \\( \\circ \\) is a function composition of fully-connected layers. In the equation, \\( \\mathbf{x_i} \\) is the input of the \\( i^{\\mathrm{th}} \\) layer for \\( i \\in \\{0,1,2,\\dots,n\\} \\), \\( \\mathbf{y} \\in \\mathbb{R}^{O} \\) is the output value corresponding to \\( \\mathbf{x_0} \\in \\mathbb{R}^I \\), and \\( g_{i} \\colon \\mathbb{R}^{D} \\to \\mathbb{R}^{D} \\). For our experiments, input and output dimensions \\( (I,O) \\) are \\( (1,1) \\), \\( (2,3) \\), \\( (3,1) \\), \\( (3,3) \\) for audio, image, 3D shapes, and video, respectively. If the input or output dimension of the secret INRs exceeds that of the cover INR, our method employs a strategic reduction in the number of hidden layers within the secret INR. Additionally, as the dimension of the hidden layer \\( D \\) is fixed for each cover modality, the secret INRs' hidden layer dimensions are set accordingly." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.56, + 0.788, + 0.59 + ], + "angle": 0, + "content": "In general, given a set \\(S\\) of inputs \\(\\mathbf{x} \\in \\mathbb{R}^I\\) and the corresponding outputs \\(\\mathbf{y} \\in \\mathbb{R}^O\\), the loss function is given by" + }, + { + "type": "equation", + "bbox": [ + 0.391, + 0.597, + 0.785, + 0.63 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {r e c o n}} (\\theta) = \\sum_ {(\\mathbf {x}, \\mathbf {y}) \\in \\mathcal {S}} \\| f _ {\\theta} (\\mathbf {x}) - \\mathbf {y} \\| _ {2} ^ {2} \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.635, + 0.788, + 0.713 + ], + "angle": 0, + "content": ", where \\( f_{\\theta} \\) is the neural representation of the data. For example, given a 2D image, the set \\( S \\) consists of 2D coordinates \\( \\mathbf{x} \\in \\mathbb{R}^2 \\) and the corresponding RGB values \\( \\mathbf{y} \\in \\mathbb{R}^3 \\). INRs enable a variety of data types to be expressed in this unified network architecture. This benefits the overall security paradigm of our steganography framework by hiding the underlying data types." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.729, + 0.402, + 0.743 + ], + "angle": 0, + "content": "3.3 Hide and Reveal" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "In this section, we explain our main idea associated with the hiding process. The secret INRs, \\(\\theta_{\\text{secret}}\\), undergo a process of allocation and fitting to the cover data, \\(x_{\\text{cover}}\\). Within the weight space, only the diagonal blocks of weight matrices are occupied by the parameters of \\(\\theta_{\\text{secret}}\\), so that the non-diagonal parameters can be fitted to \\(x_{\\text{cover}}\\), while ensuring the diagonal block's weight values to remain unaltered." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.331, + 0.114, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.49, + 0.405 + ], + "angle": 0, + "content": "First, we explain when the number of secret data, \\(N\\), is two without losing generality for hiding multiple data. The number of input nodes, output nodes, hidden layers, and the dimension of the hidden layers of \\(\\theta_{\\text{secret1}}\\) and \\(\\theta_{\\text{secret2}}\\) are each set to \\((I_1,O_1,n_1,D_1)\\), \\((I_2,O_2,n_2,D_2)\\), respectively. And \\((I,O,n,D)\\) for the stego INR network, \\(\\theta_{\\text{stego}}\\), where \\(D_1 + D_2\\) is set to equal \\(D\\). Now, we substitute the parameters of the initialized \\(\\theta_{\\text{stego}}\\) by concatenating \\(\\theta_{\\text{secret1}}\\) and \\(\\theta_{\\text{secret2}}\\) as shown in Figure 2. Note that the initialized parameters of \\(\\theta_{\\text{stego}}\\) are omitted for clarity. After the substitution, the parameter of \\(\\theta_{\\text{stego}}\\)" + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.147, + 0.79, + 0.254 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.268, + 0.789, + 0.354 + ], + "angle": 0, + "content": "Fig.2: An example of allocating two secret INRs, \\(\\theta_{\\text{secret1}}\\) and \\(\\theta_{\\text{secret2}}\\), into the stego INR, \\(\\theta_{\\text{stego}}\\). For \\(\\theta_{\\text{secret1}}, \\theta_{\\text{secret2}}\\), and \\(\\theta_{\\text{stego}}\\), \\((I_1 = 1, O_1 = 1, n_1 = 4, D_1 = 4)\\), \\((I_2 = 3, O_2 = 3, n_2 = 3, D_2 = 5)\\), and \\((I = 2, O = 3, n = 4, D = 9)\\), respectively." + }, + { + "type": "equation", + "bbox": [ + 0.348, + 0.41, + 0.786, + 0.449 + ], + "angle": 0, + "content": "\\[\n\\mathbf {W} ^ {(i)} = \\left( \\begin{array}{l l} \\mathbf {W} _ {1} ^ {(i)} & \\mathbf {W} _ {0 1} ^ {(i)} \\\\ \\mathbf {W} _ {0 2} ^ {(i)} & \\mathbf {W} _ {2} ^ {(i)} \\end{array} \\right), \\mathbf {b} ^ {(i)} = \\left( \\begin{array}{l} \\mathbf {b} _ {1} ^ {(i)} \\\\ \\mathbf {b} _ {2} ^ {(i)} \\end{array} \\right). \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.454, + 0.788, + 0.522 + ], + "angle": 0, + "content": "Here, \\(\\mathbf{W}^{(i)}\\), \\(\\mathbf{W}_1^{(i)}\\), \\(\\mathbf{W}_2^{(i)}\\) and \\(\\mathbf{b}^{(i)}\\), \\(\\mathbf{b}_1^{(i)}\\), \\(\\mathbf{b}_2^{(i)}\\) are the \\(i^{\\mathrm{th}}\\) layer's weight matrices and bias vectors of \\(\\theta_{stego}\\), \\(\\theta_{secret1}\\) and \\(\\theta_{secret2}\\), where \\(i \\in \\{0, \\dots, n\\}\\). If \\(\\theta_{secret1}\\) or \\(\\theta_{secret2}\\) have fewer hidden layers compared to \\(\\theta_{stego}\\), the parameters of \\(\\theta_{stego}\\) are not substituted. \\(\\mathbf{W}_{01}^{(i)}\\) and \\(\\mathbf{W}_{02}^{(i)}\\) are the remaining parameters of \\(\\theta_{stego}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.788, + 0.597 + ], + "angle": 0, + "content": "Now, \\(\\theta_{stego}\\) is fitted to \\(x_{cover}\\) through a selective parameter update using a binary mask, so that the parameters of \\(\\theta_{secret1}\\) and \\(\\theta_{secret2}\\) are preserved while the remaining weights get updated. After successfully updating the weight space, the reconstructed discrete representation depicts \\(x_{cover}\\) and all secret data can be retrieved from \\(\\theta_{stego}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.788, + 0.658 + ], + "angle": 0, + "content": "For \\( N > 2 \\), the hiding process is expanded in the same manner, so we further explain when \\( N = 1 \\). When there is only one secret data, the parameters of \\( \\theta_{\\text{secret1}} \\) can be freely allocated in \\( \\theta_{\\text{stego}} \\). Suppose that \\( \\theta_{\\text{secret1}} \\) is allocated in the middle of \\( \\theta_{\\text{stego}} \\), then the weight space of \\( \\theta_{\\text{stego}} \\) is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.32, + 0.662, + 0.787, + 0.721 + ], + "angle": 0, + "content": "\\[\n\\mathbf {W} ^ {(i)} = \\left( \\begin{array}{l l l} \\mathbf {W} _ {0 1} ^ {(i)} & \\mathbf {W} _ {0 2} ^ {(i)} & \\mathbf {W} _ {0 3} ^ {(i)} \\\\ \\mathbf {W} _ {0 4} ^ {(i)} & \\mathbf {W} _ {1} ^ {(i)} & \\mathbf {W} _ {0 5} ^ {(i)} \\\\ \\mathbf {W} _ {0 6} ^ {(i)} & \\mathbf {W} _ {0 7} ^ {(i)} & \\mathbf {W} _ {0 8} ^ {(i)} \\end{array} \\right), \\mathbf {b} ^ {(i)} = \\left( \\begin{array}{l} \\mathbf {b} _ {0 1} ^ {(i)} \\\\ \\mathbf {b} _ {1} ^ {(i)} \\\\ \\mathbf {b} _ {0 2} ^ {(i)} \\end{array} \\right), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.727, + 0.788, + 0.795 + ], + "angle": 0, + "content": "where \\(\\mathbf{W}^{(i)}\\), \\(\\mathbf{W}_1^{(i)}\\) and \\(\\mathbf{b}^{(i)}\\), \\(\\mathbf{b}_1^{(i)}\\) are the \\(i^{\\mathrm{th}}\\) layer's weight matrices and bias vectors of \\(\\theta_{stego}\\) and \\(\\theta_{secret1}\\), for \\(i \\in \\{0, \\dots, n\\}\\). \\(\\mathbf{W}_{01}^{(i)}, \\mathbf{W}_{02}^{(i)}, \\dots, \\mathbf{W}_{08}^{(i)}, \\mathbf{b}_{01}^{(i)}\\), and \\(\\mathbf{b}_{02}^{(i)}\\) are the remaining parameters of \\(\\theta_{stego}\\). This network then goes through the same processes as when there are multiple secret data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The inherent flexibility of our approach is highlighted by its capability to insert diverse data types, in varying amounts, at arbitrary desired positions. This versatility addresses and mitigates capacity constraints." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.363, + 0.129 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.661, + 0.163 + ], + "angle": 0, + "content": "3.4 Layer-wise Permutation Encoding and Decoding" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.788, + 0.367 + ], + "angle": 0, + "content": "To enhance security of our method, we strategically permute the nodes within each layer of the stego network. This layer-wise permutation allows the parameters of the secret INRs to be distributed throughout \\(\\theta_{stego}\\), making the parameters indistinguishable and thus undetectable. In this section, we demonstrate how the permutation is executed via one 128-bit private key \\(\\rho\\), utilizing a cryptographic key derivation function (KDF), which derives one or more secret keys from a master key. First, the private key is randomly selected and is employed to generate \\(n\\) secret keys for the \\(n\\) hidden layers of \\(\\theta_{stego}\\). Subsequently, the nodes of each layer are permuted according to the secret key assigned to each layer. The total number of possible permutation variations per INR is \\((\\mathbf{D}!)^n\\), where \\(D\\) is the dimension of the hidden layer. This shows that the security implications of this permutation intensify, as the possible combinations of permutation grow exponentially with the number of hidden layers in the \\(\\theta_{stego}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.368, + 0.788, + 0.474 + ], + "angle": 0, + "content": "It is crucial to emphasize that the overall functionality of the neural network remains unchanged throughout this operation. This operation leverages the inherent property of permutation invariance exhibited by Multi-Layer Perceptrons (MLPs) within a single layer. As INRs are also MLP networks, all permuted networks are identical to the original network. Therefore, \\(\\theta_{\\text{stepo}}\\) is invariant to the layer-wise permutation, whereas extracting the secret INR networks becomes impossible without the private key." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.496, + 0.367, + 0.515 + ], + "angle": 0, + "content": "4 Experiment" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.526, + 0.788, + 0.633 + ], + "angle": 0, + "content": "We explore the performance of INRSteg focusing on its resilience to distortion, capacity for information hiding, and security against detection. Distortion measures both the indistinguishability between the cover data and the reconstructed data from stego INR, and the performance drop during the hiding and revealing stage of the secret data. Capacity refers to the amount of hidden information that can be privately embedded within the cover data. Security indicates the extent to which the secret data can avoid detection when subjected to steganalysis." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.738 + ], + "angle": 0, + "content": "To thoroughly evaluate the distortion, we employ several metrics tailored to different modalities, which are organized in Appendix A, as well as visualization. In terms of capacity, we present various cross-modal steganography experiments and compare the model size with other previous steganography models. For security, we compute the detection accuracy using image steganalysis models, SiaStegNet [26] and XuNet [22], and visualize weight distribution to show the effects of permutation operation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.739, + 0.788, + 0.785 + ], + "angle": 0, + "content": "In our groundbreaking research, we highlight three pivotal aspects of our experimental evaluation of INRSteg, a novel steganography method that sets new benchmarks in data hiding techniques:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.795, + 0.793, + 0.84 + ], + "angle": 0, + "content": "- Cross-Modal Steganography We initiated pioneering experiments in cross-modal steganography, demonstrating our method's unique capability to privately embed audio and video data within images. Comprehensive ablation" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.331, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.147, + 0.785, + 0.177 + ], + "angle": 0, + "content": "study demonstrates that INRSteg is generally applicable across all data modalities achieving high-quality concealment(Sec. 4.1)." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.178, + 0.796, + 0.268 + ], + "angle": 0, + "content": "- Intra-Modal Steganography We conduct experiments of hiding data within the same modality, specifically embedding images within images. This approach allowed us to conduct a comparative analysis of distortion and security metrics against those reported in existing literature, showcasing the advanced capabilities of INRSteg. For ablation study, we conduct multi-image steganography experiments varying the amount of secret data(Sec. 4.2)." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.269, + 0.788, + 0.375 + ], + "angle": 0, + "content": "- Efficiency and Robustness Analysis To show the efficiency of INRSteg, we perform computational cost comparisons with five existing steganography models. We test the robustness of INRSteg by simulating a challenging scenario where network weights undergo quantization. It demonstrates that our method maintains high performance and robustness even under harsh conditions, which ensures secure and reliable steganography across a wide range of applications(Sec. 4.3)." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.415, + 0.788, + 0.471 + ], + "angle": 0, + "content": "Table 1: Results of Cross-modal steganography experiment. VoxCeleb2 and ImageNet dataset are used for secret data and cover data, respectively. \"Secret/Revealed\" indicates the recovery performance of secret data. \"Cover/Stego\" indicates the reconstruction performance from stego INR." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.483, + 0.787, + 0.566 + ], + "angle": 0, + "content": "
Secret/RevealedCover/Stego
VoxCeleb2ImageNet
AudioVideoImage
SNR ↑MAE ↓PSNR ↑APD ↓PSNR ↑RMSE ↓
37.558(±5.4)0.314(±0.3)41.448(±3.1)1.349(±0.5)39.258(±4.4)2.948(±1.5)
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.617, + 0.494, + 0.634 + ], + "angle": 0, + "content": "4.1 Cross-modal Steganography" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.842 + ], + "angle": 0, + "content": "ImageNet and VoxCeleb2 For cross-modal steganography experiment, we conduct a pioneering steganography experiment that embeds the VoxCeleb2 dataset within images from ImageNet dataset. VoxCeleb2 dataset has both video and audio files, thereby enabling simultaneous playback of visual and auditory data. Using our INRSteg method, we leverage images from ImageNet dataset as cover data to hide video and audio data at the same time. Tab. 1 shows the distortion performance for secret/revealed and cover/stego performance demonstrating the efficacy of our approach in preserving the content of cover and the embedded data. For the secret and the revealed secret data pair, as our framework goes through lossless recovery in terms of INR, the secret/revealed secret performance is solely dependent on the data representation transformation phase. Moreover, Figure 3 shows visualization of the reconstructed data, recovery of video and audio secret data. There is no noticeable quality degradation," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.129 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.144, + 0.443, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.451, + 0.144, + 0.563, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.565, + 0.144, + 0.674, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.234, + 0.443, + 0.32 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.45, + 0.233, + 0.564, + 0.32 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.565, + 0.233, + 0.673, + 0.32 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.33, + 0.788, + 0.414 + ], + "angle": 0, + "content": "Fig. 3: Visualization results of cross-modal steganography. Can you identify which image is the cover and the reconstructed cover data? For the video and audio examples, can you determine which are the secret and revealed secret data? For images, upper one is cover data and below is reconstructed cover data. For video, upper row is secret data and below is revealed secret data. For audio, the left is secret data and the right is revealed secret data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.442, + 0.788, + 0.563 + ], + "angle": 0, + "content": "which implies successful results of cross-modal steganography. Notably, cross-modal steganography is unprecedented, representing a significant improvement in the field of steganography. More reconstruction results using other modalities can be seen in Appendix C, showing successful multi-data steganography with almost no visible difference for both 3D shape and video. Additionally, there are visualization results of weight space after steganography and comparison results of weight distribution after permutation operation in Appendix D, demonstrating the security of INRSteg." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Ablation study For ablation study, we try to demonstrate that INRSteg is generally applicable across all data modalities for steganography. Therefore, we design experiments that cover all combinations of data modalities where cover data type is image, audio, or video and secret data type is image, audio, 3D shape, or video. The distortion performance of all single-data cross-modal steganography tasks can be seen in Tab. 2, demonstrating achievement of exceptional performance for all cases. For additional reconstruction results, we show them in Appendix C. Recovery performance results for secret data are in Appendix E. A deeper analysis of the results presented in Tab. 2 reveals two key factors that influence improved cover/stego performance: the modality of the secret and cover data, and the capacity of the neural network utilized for the stego INR. We observe that when the modalities of the secret and cover data match, the stego INR demonstrates enhanced accuracy in fitting to the cover data. This phenomenon is attributed to the intrinsic properties of INRs, where the weight spaces of neural networks exhibit similarities when representing with same modality data [21]. Moreover, leveraging the capabilities of INRs, employing a larger neural network for the cover data fitting process enhances the quality of cover data reconstruc" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.331, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "tion. This can be shown in Tab. 2, where the performance of hiding 3D shapes in images outperforms hiding images in images. This property allows flexible control of the network size for secret and cover data based on the required recovery quality and resource space constraints in the real world. An additional ablation study about the effectiveness of the padding ratio is proposed in Appendix B." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.25, + 0.79, + 0.281 + ], + "angle": 0, + "content": "Table 2: Cover/Stego performance of single-data steganography. The best results are highlighted for each cover modality." + }, + { + "type": "table", + "bbox": [ + 0.272, + 0.291, + 0.735, + 0.398 + ], + "angle": 0, + "content": "
Secret typeCover type
ImageAudioVideo
PSNR ↑RMSE ↓SNR ↑MAE ↓PSNR ↑APD ↓
Image62.340.20432.630.59935.263.315
Audio63.160.17941.420.26834.693.574
Video56.180.40827.200.93141.261.532
3D shape92.950.00023.121.40338.542.244
" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.453, + 0.489, + 0.47 + ], + "angle": 0, + "content": "4.2 Intra-modal Steganography" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.482, + 0.789, + 0.695 + ], + "angle": 0, + "content": "Image steganography In this section, we compare INRSteg to existing image-to-image steganography methods to show that our framework also excels in intra-modal tasks. Tab. 3 compares the performance of INRSteg with other deep learning based image-to-image steganography methods, DeepMIH [4] and an improved DeepSteg [1]. INRSteg outperforms on all metrics showing that our framework achieves state-of-the-art performance. For hiding two secret images into one image, the results in Appendix F, and Figure 4 further visualizes the cover/stego and secret/revealed secret image pairs for two images into one steganography. We continue to compare our results with DeepMIH using difference maps each enhanced by 10, 20, and 30 times. For INRSteg, nearly no visual differences exist between the original and the revealed images even when the difference map is enhanced 30 times. For DeepMIH, on the other hand, we can notice obvious differences for all difference maps when comparing cover/stego and secret1,2/revealed secret 1,2 pairs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.79, + 0.841 + ], + "angle": 0, + "content": "Image steganalysis To examine security, we adopt two image steganalysis tools, SiaStegNet [26] and XuNet [22]. Tab. 4 presents the detection accuracy of our framework and other models. The security is higher as the detection accuracy is closer to \\(50\\%\\). Unlike other steganography models, the detection accuracy of INRSteg is \\(50\\%\\), meaning that the steganalysis tool completely fails to distinguish the stego data from the cover data. This shows that our framework is undetectable using existing steganalysis tools and assures perfect security. This is because our framework does not directly edit the data in the discrete" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.128 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "image", + "bbox": [ + 0.251, + 0.148, + 0.754, + 0.292 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.307, + 0.785, + 0.351 + ], + "angle": 0, + "content": "Fig. 4: A comparison of difference maps (enhanced by \\(10\\mathrm{x}\\), \\(20\\mathrm{x}\\), and \\(30\\mathrm{x}\\)) between the original images and the revealed images. Columns 2-6 are results of INRSteg and columns 7-10 are results of DeepMIH [4]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.38, + 0.785, + 0.442 + ], + "angle": 0, + "content": "representation state, but performs manipulation after transforming the representation into a neural network, which is unnoticeable when re-transformed to the discrete representation. Moreover, we conduct steganalysis analysis on multi-images steganography. The results in Appendix F." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.464, + 0.785, + 0.556 + ], + "angle": 0, + "content": "Multi-image steganography In Tab. 5, we conduct experiments for multi-image steganography hiding more than two images when the size of stego INR is fixed, so that one may have to decrease the network size of each hidden data in order to fit the memory capacity. The results show that high recovery performance maintains even when increasing the number of hidden data. For more experiments with other modalities, please refer to Appendix G." + }, + { + "type": "table_caption", + "bbox": [ + 0.232, + 0.584, + 0.538, + 0.612 + ], + "angle": 0, + "content": "Table 3: Performance comparison of imagedto-image steganography." + }, + { + "type": "table", + "bbox": [ + 0.224, + 0.624, + 0.549, + 0.732 + ], + "angle": 0, + "content": "
MetricMAE ↓PSNR ↑SSIM ↑RMSE ↓
DeepStegcover2.57637.480.9473.417
secret3.57033.340.9573.57
DeepMIHcover2.83936.050.9324.276
secret3.60432.970.95505.746
INRStegcover0.15362.340.9990.204
secret1.08445.840.9881.326
" + }, + { + "type": "table_caption", + "bbox": [ + 0.559, + 0.584, + 0.774, + 0.625 + ], + "angle": 0, + "content": "Table 4: Steganalysis comparison of image-to-image steganography." + }, + { + "type": "table", + "bbox": [ + 0.562, + 0.638, + 0.776, + 0.731 + ], + "angle": 0, + "content": "
Accuracy (%)
SiaStegNetXuNet
DeepSteg92.8775.83
DeepMIH90.7090.82
INRSteg50.0050.00
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.753, + 0.553, + 0.769 + ], + "angle": 0, + "content": "4.3 Efficiency and Robustness Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Model Size Comparison In our efficiency analysis, we compare model sizes to evaluate the computational cost and efficiency of our proposed INRSteg relative to existing steganography models. As described in Tab. 6, our INRSteg achieves a remarkably compact architecture, consisting of only 400,000 param" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.331, + 0.114, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.128 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.314 + ], + "angle": 0, + "content": "eters. Compared to other existing steganography models, this advantage is notable. DeepSteg [1], with 42.58 million parameters, is approximately 107.46 times larger than our model. DeepMIH [4] model, with 12.42 million parameters, has 31.34 times more parameters, and LF-VSN [14], at 7.40 million parameters, is 18.68 times larger. Especially, CRoSS [27] contains 1,066.24 million parameters, corresponding to 2690.54 times the size of the model. This comparative analysis highlights the efficiency of our INRSteg, demonstrating its capability to achieve robust steganography performance with a significantly reduced computational space. The small model not only promotes faster training and inference times, but also opens up opportunities for deployment on devices with limited computational resources such as smartphones." + }, + { + "type": "table_caption", + "bbox": [ + 0.23, + 0.352, + 0.492, + 0.381 + ], + "angle": 0, + "content": "Table 5: Distortion performance of hiding multiple images \\((>2)\\) into one." + }, + { + "type": "table", + "bbox": [ + 0.229, + 0.393, + 0.495, + 0.476 + ], + "angle": 0, + "content": "
MetricPSNR ↑RMSE ↓
3 imagescover62.310.204
secret 1,2,343.671.642
4 imagescover62.580.153
secret 1,2,3,441.862.059
" + }, + { + "type": "table_caption", + "bbox": [ + 0.531, + 0.352, + 0.761, + 0.367 + ], + "angle": 0, + "content": "Table 6: Model Size Comparison." + }, + { + "type": "table", + "bbox": [ + 0.525, + 0.378, + 0.77, + 0.474 + ], + "angle": 0, + "content": "
Model#ParamsRatio to Ours
DeepSteg [1]42.58M107.46×
HiNet [8]4.05M10.22×
DeepMIH [4]12.42M31.34×
CROSS [27]1,066.24M2690.54×
LF-VSN [14]7.40M18.68×
Ours0.40M1×
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.49, + 0.788, + 0.763 + ], + "angle": 0, + "content": "Robustness We explore the robustness of INRSteg under harsh conditions in real-world scenarios. In particular, we apply quantization operation to store model parameters from float32 to int8 format. This process aims to simulate scenarios where data precision must be reduced due to storage or transmission constraints. After quantization, we recover the parameters from int8 to float32 and evaluate the performance metrics of the recovered secret images. Tab. 7 describes the results of performance comparison before and after quantization across three cover types: image, audio, and video. Notably, while PSNR values decrease after quantization, this decrease is not as significant as might be expected given the harsh nature of the quantization process. This indicates that INRSteg has a robust ability to maintain secret data quality despite the data compression and precision reductions. Furthermore, something to crucially note in Tab. 7 is that the SSIM value hardly changes after quantization. Since SSIM measures the perceptual quality, it is a more representative metric that evaluates image quality. Therefore, the results indicate that the visual content of the secret images remain almost completely. The reconstruction results are in Appendix H. Additionally, we show preserving secret data when using another model compression method, pruning, in Appendix I." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.782, + 0.514, + 0.799 + ], + "angle": 0, + "content": "5 Limitations and Discussion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "We would like to highlight the potential negative impacts that steganography frameworks may result in the ethical aspect. Users must be cautious not to utilize" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.129 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.199 + ], + "angle": 0, + "content": "Table 7: Performance Metrics Before and After Quantization for Different Cover Types. Pre-Q denotes metrics before quantization, Post-Q denotes metrics after quantization. Higher values are better for PSNR and SSIM, while lower values are preferred for RMSE and MAE." + }, + { + "type": "table", + "bbox": [ + 0.243, + 0.213, + 0.761, + 0.293 + ], + "angle": 0, + "content": "
Cover typePSNR ↑RMSE ↓SSIM ↑MAE ↓
Pre-QPost-QPre-QPost-QPre-QPost-QPre-QPost-Q
Image40.076633.74832.52455.23750.98210.95541.70853.519
Audio40.076633.54382.52455.36230.98210.95291.70853.723
Video40.076633.82762.52455.18990.98210.95831.70853.417
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.321, + 0.784, + 0.351 + ], + "angle": 0, + "content": "our work in unethical situations, where one may hide inappropriate information. Additional limitations are described in Appendix J." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.374, + 0.357, + 0.389 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.406, + 0.786, + 0.617 + ], + "angle": 0, + "content": "In conclusion, this paper introduces INRSteg, an innovative framework designed for the concealment of multiple cross-modal data through the utilization of the weight space inherent in Implicit Neural Representations (INR). Our extensive experimentation demonstrates that INRSteg surpasses existing steganography techniques in key areas, namely distortion evaluation, data capacity, and security measures, across both intra and cross-modal steganography scenarios. A notable advantage of INRSteg is its deployment of smaller model sizes, which directly contributes to reduced energy consumption, making it exceptionally suited for practical real-world applications. Furthermore, our analysis confirms the robustness of INRSteg, even when subjected to the rigorous demands of quantization operations. We believe that INRSteg establishes a new benchmark for achieving an optimal balance between efficiency and performance within the steganography domain, paving the way for future advancements in secure and efficient steganography techniques." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.641, + 0.402, + 0.657 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.672, + 0.786, + 0.793 + ], + "angle": 0, + "content": "This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.RS-2022-II220184, Development and Study of AI Technologies to Inexpensively Conform to Evolving Policy on Ethics) and Institute for Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No. 2021-0-01381, Development of Causal AI through Video Understanding and Reinforcement Learning, and Its Applications to Real Environments)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.331, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Implicit Steganography Beyond the Constraints of Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.204 + ], + "angle": 0, + "content": "1. Baluja, S.: Hiding images in plain sight: Deep steganography. In: Advances in Neural Information Processing Systems (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.205, + 0.785, + 0.232 + ], + "angle": 0, + "content": "2. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.233, + 0.785, + 0.273 + ], + "angle": 0, + "content": "3. Dupont, E., Kim, H., Eslami, S., Rezende, D., Rosenbaum, D.: From data to functa: Your data point is a function and you can treat it like one. arXiv preprint arXiv:2201.12204 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.785, + 0.315 + ], + "angle": 0, + "content": "4. Guan, Z., Jing, J., Deng, X., Xu, M., Jiang, L., Zhang, Z., Li, Y.: Deepmih: Deep invertible network for multiple image hiding. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.316, + 0.785, + 0.357 + ], + "angle": 0, + "content": "5. Han, G., Lee, D.J., Hur, J., Choi, J., Kim, J.: Deep cross-modal steganography using neural representations. In: 2023 IEEE International Conference on Image Processing (ICIP) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.358, + 0.785, + 0.398 + ], + "angle": 0, + "content": "6. Huu, Q.P., Dinh, T.H., Tran, N.N., Van, T.P., Minh, T.T.: Deep neural networks based invisible steganography for audio-into-image algorithm. In: 2019 IEEE 8th Global Conference on Consumer Electronics (GCCE) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.399, + 0.785, + 0.44 + ], + "angle": 0, + "content": "7. Jain, Y.K., Ahirwal, R.: A novel image steganography method with adaptive number of least significant bits modification based on private stego-keys. In: International Journal of Computer Science and Security (IJCSS) (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.441, + 0.785, + 0.481 + ], + "angle": 0, + "content": "8. Jing, J., Deng, X., Xu, M., Wang, J., Guan, Z.: Hinet: Deep image hiding by invertible network. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.482, + 0.785, + 0.509 + ], + "angle": 0, + "content": "9. Lee, J., Tack, J., Lee, N., Shin, J.: Meta-learning sparse implicit neural representations. Advances in Neural Information Processing Systems (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.509, + 0.785, + 0.55 + ], + "angle": 0, + "content": "0. Li, C., Feng, B.Y., Fan, Z., Pan, P., Wang, Z.: Steganerf: Embedding invisible information within neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.551, + 0.785, + 0.578 + ], + "angle": 0, + "content": "1. Liu, Y., Liu, S., Wang, Y., Zhao, H., Liu, S.: Video steganography: A review. Neurocomputing (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.579, + 0.785, + 0.606 + ], + "angle": 0, + "content": "2. Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., Galstyan, A.: A survey on bias and fairness in machine learning. ACM Comput. Surv. (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.607, + 0.785, + 0.647 + ], + "angle": 0, + "content": "3. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.648, + 0.785, + 0.689 + ], + "angle": 0, + "content": "4. Mou, C., Xu, Y., Song, J., Zhao, C., Ghanem, B., Zhang, J.: Large-capacity and flexible video steganography via invertible neural network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.785, + 0.73 + ], + "angle": 0, + "content": "5. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.785, + 0.771 + ], + "angle": 0, + "content": "6. Shi, H., Dong, J., Wang, W., Qian, Y., Zhang, X.: Ssgan: Secure steganography based on generative adversarial networks. In: Advances in Multimedia Information Processing - PCM 2017 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.772, + 0.785, + 0.799 + ], + "angle": 0, + "content": "7. Simmons, G.J.: The subliminal channel and digital signatures. In: Advances in Cryptology (1985)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "8. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in neural information processing systems (2020)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.362, + 0.128 + ], + "angle": 0, + "content": "S. Song et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "19. Strümpler, Y., Postels, J., Yang, R., Gool, L.V., Tombari, F.: Implicit neural representations for image compression. In: European Conference on Computer Vision (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.785, + 0.218 + ], + "angle": 0, + "content": "20. Subramanian, N., Elharrouss, O., Al-Maadeed, S., Bouridane, A.: Image steganography: A review of the recent advances. IEEE Access (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.785, + 0.272 + ], + "angle": 0, + "content": "21. Tancik, M., Mildenhall, B., Wang, T., Schmidt, D., Srinivasan, P.P., Barron, J.T., Ng, R.: Learned initializations for optimizing coordinate-based neural representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.785, + 0.3 + ], + "angle": 0, + "content": "22. Xu, G.: Deep convolutional neural network to detect j-uniward. In: Proceedings of the 5th ACM Workshop on Information Hiding and Multimedia Security (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.785, + 0.328 + ], + "angle": 0, + "content": "23. Xu, G., Wu, H.Z., Shi, Y.Q.: Structural design of convolutional neural networks for steganalysis. IEEE Signal Processing Letters (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.37 + ], + "angle": 0, + "content": "24. Yang, H., Ouyang, H., Koltun, V., Chen, Q.: Hiding video in audio via reversible generative models. In: 2019 IEEE/CVF International Conference on Computer Vision (ICCV) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.397 + ], + "angle": 0, + "content": "25. Yang, J., Liu, K., Kang, X., Wong, E.K., Shi, Y.Q.: Spatial image steganography based on generative adversarial network. arXiv preprint arXiv:1804.07939 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.424 + ], + "angle": 0, + "content": "26. You, W., Zhang, H., Zhao, X.: A siamese cnn for image steganalysis. IEEE Transactions on Information Forensics and Security (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.466 + ], + "angle": 0, + "content": "27. Yu, J., Zhang, X., Xu, Y., Zhang, J.: Cross: Diffusion model makes controllable, robust and secure image steganography. Advances in Neural Information Processing Systems (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.508 + ], + "angle": 0, + "content": "28. Zhang, H., Geng, G., Xiong, C.: Image steganography using pixel-value differ-encing. In: 2009 Second International Symposium on Electronic Commerce and Security (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.508, + 0.785, + 0.55 + ], + "angle": 0, + "content": "29. Zhou, H., Zhang, W., Chen, K., Li, W., Yu, N.: Three-dimensional mesh steganography and steganalysis: A review. IEEE Transactions on Visualization and Computer Graphics (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.785, + 0.591 + ], + "angle": 0, + "content": "30. Zhu, J., Kaplan, R., Johnson, J., Fei-Fei, L.: Hidden: Hiding data with deep networks. In: Proceedings of the European conference on computer vision (ECCV) (2018)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.591 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_origin.pdf b/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ddd011ea1a03ea0648fd17cc0336755cc5497472 --- /dev/null +++ b/2024/Implicit Steganography Beyond the Constraints of Modality/19cd1b70-5002-4035-b78b-8110c5c75478_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9837a9c4543c2da6fd7755cadec6c1832527371f766df1295b94c8df258447fc +size 7696847 diff --git a/2024/Implicit Steganography Beyond the Constraints of Modality/full.md b/2024/Implicit Steganography Beyond the Constraints of Modality/full.md new file mode 100644 index 0000000000000000000000000000000000000000..ed6d9f3c94330d5f425b505eb35c58d4e066224e --- /dev/null +++ b/2024/Implicit Steganography Beyond the Constraints of Modality/full.md @@ -0,0 +1,254 @@ +# Implicit Steganography Beyond the Constraints of Modality + +Sojeong Song $^{\dagger,1}$ , Seoyun Yang $^{\dagger,1}$ , Chang D. Yoo $^{\ddagger,1}$ , and Junmo Kim $^{\ddagger,1}$ + +$^{1}$ Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea + +akqqq4985@kaist.ac.kr, seoyun.yang@navercorp.com + +Abstract. Cross-modal steganography is committed to hiding secret information of one modality in another modality. Despite the advancement in the field of steganography by the introduction of deep learning, cross-modal steganography still remains to be a challenge to the field. The incompatibility between different modalities not only complicate the hiding process but also results in increased vulnerability to detection. To rectify these limitations, we present INRSteg, an innovative cross-modal steganography framework based on Implicit Neural Representations (INRs). We introduce a novel network allocating framework with a masked parameter update which facilitates hiding multiple data and enables cross modality across image, audio, video and 3D shape. Moreover, we eliminate the necessity of training a deep neural network and therefore substantially reduce the memory and computational cost and avoid domain adaptation issues. To the best of our knowledge, in the field of steganography, this is the first to introduce diverse modalities to both the secret and cover data. Detailed experiments in extreme modality settings demonstrate the flexibility, security, and robustness of INRSteg. + +Keywords: Steganography $\cdot$ Implicit neural representations $\cdot$ Cross-modal steganography + +# 1 Introduction + +Nowadays, an unprecedented volume of data is shared and stored across various digital platforms and the volume is bound to intensify even further in the future. This proliferation and accessibility of data contributes to convenience in our lives and enables innovation and advancement that weren't achievable in the past; however, it also brings a concerning challenge to the security of information. Steganography aims to hide the secret information inside a cover data resulting in a stego data, also called the container. Unlike cryptography, + +which investigates in hiding the data of interest in a coded form, steganography operates with imperceptible concealment so that the existence of the secret data is undetectable. For example, individuals can upload their stego data to the cloud and securely trade their private keys with specific parties, and companies can leverage steganography to exchange confidential information, such as new product designs or sensitive meeting recordings, while including ownership details in the data. From a government perspective, steganography can covertly transmit information to foreign spies by inserting confidential national security information into seemingly ordinary cover data. + +Up to now, image is the most commonly used modality of cover data, as it is less sensitive to human perception and is comparatively simple to embed secret information. However, image steganography tends to have a limit on payload capacity, and is susceptible to detection. Deep learning methods [1, 30] have increased the security, but suffer from unstable extraction and high computational costs [20]. Other modalities such as audio, video and 3D shape also undergo similar limitations [11, 29] and struggle with trade-offs between capacity and security. Moreover, for cross-modal steganography, where the modality of the secret and the cover data differs [5, 6, 24], these limitations intensify due to the difficulties that emerge when the dimension or capacity of the secret data exceed that of the cover data or when the secret data contains temporal information. + +Implicit neural representations (INRs) have recently attracted extensive attention as an alternative data representation, using continuous and differentiable functions to represent data via parameters of a neural network. The concept of INRs offers a more flexible and expressive approach than the conventional notion of discrete representations. Multiple modalities, as audio, image, video and 3d shape, are all presentable using a single neural network in various resolutions [3]. Moreover, INRs benefit in capacity by reducing the memory cost according to the network design [9, 15]. + +In this paper, we present INRSteg, the first cross-modal steganography framework available across a diverse range of modalities, including images, audio, video, and 3D shapes, for both the secret and cover data. By transforming the representation of all data to an implicit form, our framework takes advantage of the flexibility and high capacity inherent in INRs. The flexibility to all modalities enables cross-modal tasks that remained largely unexplored. Along with the versatility across the modalities, our framework is also capable of hiding multiple secret information into one cover data. In Sec. 4, we conduct the hiding of both an audio and an video into a single image, a task which was previously considered highly challenging due to the limited capacity of images. Our framework therefore further enables expansion and intriguing adaptation of steganography into a wider range of fields. In the medical field, for example, private information as an endoscopy video and an audio recording of the heart sound can be hidden under an image of a patient. + +To further enhance the security, layer-wise permutation of the INR network using a private key is additionally executed. Therefore, the secret INRs' network parameters can be well distributed within the stego INR's network. Revealing + +![](images/3f8fadbee5f56ac2237d02b2c73dbe1aa5e2a062314d4d001c114447ca77dc27.jpg) +Fig. 1: A general framework of INRSteg for hiding two types of secret data. All four data types can be transformed into INRs, and the red box shows which of the four data types is selected in this case. After the representation transformation of each secret data, the weights of the two INRs are allocated in a new MLP network. With the weight freezing technique, the weights from the secret data are fixed while the rest are fitted on the cover data. The existence of the secret data is concealed by permutation encoding via private key, which does not affect the reconstruction performance. The private key is then used to decode the permuted stego network, and the secret data are revealed by separating each MLP network. + +the secret data is executed by re-permuting and disassembling the weights of the stego INR. This procedure is not only simple but also guarantees a lossless revealing process as all neural representations of the secret data are fully recoverable. + +Additionally, our framework does not require any deep learning models to be trained for the hiding and revealing process, such as GAN [16, 25] or diffusion models [27]. This excludes the need for any training data and therefore our framework can prevent any biases that may arise from using training datasets [12] and avoids domain shift issues, allowing datasets of all modalities to be applied without any additional pre-processing. Moreover, by eliminating the use of deep networks, our work substantially reduces both the computational and memory costs associated with training and deploying models which have become a significant global challenge. + +The proposed framework, INRSteg, achieves flexible cross-modal steganography for multiple secret data by converting the data representation to neural networks. At the same time, we reduce computational and memory costs by + +avoiding the use of deep neural networks. For intra-modal steganography, we demonstrate that INRSteg outperforms prior image steganography models such as DeepMIH [4] and DeepSteg [1]. We show INRSteg is robust in the real-world scenarios by applying quantization operation. These are our main contributions, and the details will be described in further sections: + +- Introduce an Implicit Neural Representation (INR) steganography framework that flexibly adopts to a large range of modalities and further enables all cross-modal steganography. +- Demonstrate a neural network allocating procedure that enables cost-effective hiding and revealing of multiple secret data at once. +- Comprehensive investigation on distortion, security and capacity shows that INRSteg achieves state-of-the-art cross-modal steganography. +- Figure out that INRSteg is the most efficient compared to the previous steganography models and robust in real-world scenarios especially for quantization operation. + +# 2 Related work + +# 2.1 Steganography + +Steganography is a technique that focuses on hiding confidential information by adeptly embedding data within other publicly accessible data, effectively concealing the very existence of the hidden message. When one is aware of this concealed data, it can be retrieved by a revealing process with an appropriate private key [17]. A prominent approach in historical methods is the Least Significant Bit (LSB) based method, which takes advantage of the imperceptibility of small changes to the least significant bits of the data [7,28]. With the rise of deep neural networks, the field of steganography has rapidly evolved to overcome the challenge of security and capacity. Deepsteg [1], which is an early work of image steganography, attempts to use an encoder and decoder to determine where to place the secret information. CROSS [27] utilizes diffusion models to only reveal the secret information when the accurate prompt is given. To enhance the capacity aspect while ensuring the security, invertible neural networks (INNs) have been actively adopted. In the image steganography field, HiNet [8] incorporates INNs with wavelet domain to minimize distortion, and DeepMIH [4] progresses to hide multiple images into one. LF-VSN [14] further attempts to hide seven videos into one utilizing the INN. + +Notwithstanding their innovations, a recurrent limitation across these previous methods is the trade-off between capacity and security. If the cover data is damaged in any way during the embedding process, it becomes susceptible to detection by steganalysis algorithms [23, 26]. This vulnerability poses a significant limitation, especially when attempting to hide large volumes of data such as videos or 3d shapes. INRSteg cannot be detected by traditional steganalysis tools and therefore ensures security while maintaining high capacity. + +# 2.2 Cross-modal steganography + +The evolution of steganography has also expanded to the concealment of information across different data modalities, such as embedding audio data within videos, which is called cross-modal steganography. [24] embeds video information into audio signals by leveraging the human visual system's inability to recognize high-frequency flickering, allowing for the hidden video to be decoded by recording the sound from a speaker and processing it. [6] utilizes a joint deep neural network architecture comprising two sub-models, one for embedding the audio into an image and another for decoding the image to retrieve the original audio. These methods achieve cross-modal steganography using deep learning techniques, but are still restricted on specified modalities. + +Recent advancements in Implicit Neural Representations (INRs) have paved the way for a new paradigm in steganography [5, 10]. INRs have been leveraged to represent multiple modalities of data simultaneously. StegaNeRF [10] hides data of various modalities at viewpoints when rendering NeRF. [5] conceals audio, video, and 3D shape data within a cover image, leveraging RGB values as weights of the INRs. While these recent works represent a paradigm shift in steganography techniques, the capacity and security trade-off still remains an issue and the modality of the cover data is set to be singular. Our proposed method in this paper seeks to address and overcome this trade-off while maintaining the advantages of INRs and further eliminating the modality constraint on the cover data, demonstrating a significant advancement in the steganography research. + +# 2.3 Implicit neural representations + +Implicit neural representations (INRs) is a rapidly emerging field where data is expressed in a continuous and differentiable manner through neural networks. This representation [18] is resolution-agnostic [19] and is capable of compressing the data effectively [2]. These advantages highlight various applications of INRs that show superior performance than that of the array-based representation. For example, neural radiance field (NeRF) [13] constructs a 5d scene representation of a 3d object through view-dependent synthesis. [3] proposes a general framework that feeds a modulated INR directly on the downstream models and shows competitive performance on multiple modalities. [9] employs meta-learning coupled with pruning techniques to efficiently scale implicit neural representations for large datasets. + +# 3 Method + +# 3.1 Framework + +Our research focuses on INR steganography, where the data representations are transformed into Implicit Neural Representations (INRs), such as SIREN [18]. Figure 1 shows the general framework of our methodology, which is segmented into three sub-stages. In the Data Representation Transformation stage, secret + +data are transformed into their corresponding Implicit Neural Representations, represented as $\theta_{\text{secret}}$ . Subsequently, in the Hide/Reveal stage, $\theta_{\text{stego}}$ is fitted to represent the cover data, $x_{\text{cover}}$ , while preserving the parameters of $\theta_{\text{secret}}$ . The Layer-wise Permutation Encoding/Decoding stage introduces a layer-wise permutation mechanism, designed to avoid detection of the secret data's presence and location. + +# 3.2 Data Representation Transformation + +In the first stage, we transform the secret data into Implicit Neural Representations (INRs) by fitting multi-layer perceptrons (MLP) with sine activation functions for each data. This network was first introduced by [18] as SIREN (Sinusoidal representations for neural networks) and is widely used in the INR research field. The structure of the MLP network has $n$ hidden layers of size $D$ and the output is represented as follows: + +$$ +\begin{array}{l} \mathbf {y} = \mathbf {W} ^ {(n)} \left(g _ {n - 1} \circ \dots \circ g _ {1} \circ g _ {0}\right) \left(\mathbf {x} _ {0}\right) + \mathbf {b} ^ {(n)}, \\ \text {w h e r e} \mathbf {x} _ {i + 1} = g _ {i} \left(\mathbf {x} _ {i}\right) = \sigma \left(\mathbf {W} ^ {(i)} \mathbf {x} _ {i} + \mathbf {b} ^ {(i)}\right), \tag {1} \\ \end{array} +$$ + +where $\circ$ is a function composition of fully-connected layers. In the equation, $\mathbf{x_i}$ is the input of the $i^{\mathrm{th}}$ layer for $i \in \{0,1,2,\dots,n\}$ , $\mathbf{y} \in \mathbb{R}^{O}$ is the output value corresponding to $\mathbf{x_0} \in \mathbb{R}^I$ , and $g_{i} \colon \mathbb{R}^{D} \to \mathbb{R}^{D}$ . For our experiments, input and output dimensions $(I,O)$ are $(1,1)$ , $(2,3)$ , $(3,1)$ , $(3,3)$ for audio, image, 3D shapes, and video, respectively. If the input or output dimension of the secret INRs exceeds that of the cover INR, our method employs a strategic reduction in the number of hidden layers within the secret INR. Additionally, as the dimension of the hidden layer $D$ is fixed for each cover modality, the secret INRs' hidden layer dimensions are set accordingly. + +In general, given a set $S$ of inputs $\mathbf{x} \in \mathbb{R}^I$ and the corresponding outputs $\mathbf{y} \in \mathbb{R}^O$ , the loss function is given by + +$$ +\mathcal {L} _ {\text {r e c o n}} (\theta) = \sum_ {(\mathbf {x}, \mathbf {y}) \in \mathcal {S}} \| f _ {\theta} (\mathbf {x}) - \mathbf {y} \| _ {2} ^ {2} \tag {2} +$$ + +, where $f_{\theta}$ is the neural representation of the data. For example, given a 2D image, the set $S$ consists of 2D coordinates $\mathbf{x} \in \mathbb{R}^2$ and the corresponding RGB values $\mathbf{y} \in \mathbb{R}^3$ . INRs enable a variety of data types to be expressed in this unified network architecture. This benefits the overall security paradigm of our steganography framework by hiding the underlying data types. + +# 3.3 Hide and Reveal + +In this section, we explain our main idea associated with the hiding process. The secret INRs, $\theta_{\text{secret}}$ , undergo a process of allocation and fitting to the cover data, $x_{\text{cover}}$ . Within the weight space, only the diagonal blocks of weight matrices are occupied by the parameters of $\theta_{\text{secret}}$ , so that the non-diagonal parameters can be fitted to $x_{\text{cover}}$ , while ensuring the diagonal block's weight values to remain unaltered. + +First, we explain when the number of secret data, $N$ , is two without losing generality for hiding multiple data. The number of input nodes, output nodes, hidden layers, and the dimension of the hidden layers of $\theta_{\text{secret1}}$ and $\theta_{\text{secret2}}$ are each set to $(I_1,O_1,n_1,D_1)$ , $(I_2,O_2,n_2,D_2)$ , respectively. And $(I,O,n,D)$ for the stego INR network, $\theta_{\text{stego}}$ , where $D_1 + D_2$ is set to equal $D$ . Now, we substitute the parameters of the initialized $\theta_{\text{stego}}$ by concatenating $\theta_{\text{secret1}}$ and $\theta_{\text{secret2}}$ as shown in Figure 2. Note that the initialized parameters of $\theta_{\text{stego}}$ are omitted for clarity. After the substitution, the parameter of $\theta_{\text{stego}}$ + +![](images/39da45694ca954d07aa7a484592951658f4e9d5354c0995d2fe1e0adf468c384.jpg) +Fig.2: An example of allocating two secret INRs, $\theta_{\text{secret1}}$ and $\theta_{\text{secret2}}$ , into the stego INR, $\theta_{\text{stego}}$ . For $\theta_{\text{secret1}}, \theta_{\text{secret2}}$ , and $\theta_{\text{stego}}$ , $(I_1 = 1, O_1 = 1, n_1 = 4, D_1 = 4)$ , $(I_2 = 3, O_2 = 3, n_2 = 3, D_2 = 5)$ , and $(I = 2, O = 3, n = 4, D = 9)$ , respectively. + +$$ +\mathbf {W} ^ {(i)} = \left( \begin{array}{l l} \mathbf {W} _ {1} ^ {(i)} & \mathbf {W} _ {0 1} ^ {(i)} \\ \mathbf {W} _ {0 2} ^ {(i)} & \mathbf {W} _ {2} ^ {(i)} \end{array} \right), \mathbf {b} ^ {(i)} = \left( \begin{array}{l} \mathbf {b} _ {1} ^ {(i)} \\ \mathbf {b} _ {2} ^ {(i)} \end{array} \right). \tag {3} +$$ + +Here, $\mathbf{W}^{(i)}$ , $\mathbf{W}_1^{(i)}$ , $\mathbf{W}_2^{(i)}$ and $\mathbf{b}^{(i)}$ , $\mathbf{b}_1^{(i)}$ , $\mathbf{b}_2^{(i)}$ are the $i^{\mathrm{th}}$ layer's weight matrices and bias vectors of $\theta_{stego}$ , $\theta_{secret1}$ and $\theta_{secret2}$ , where $i \in \{0, \dots, n\}$ . If $\theta_{secret1}$ or $\theta_{secret2}$ have fewer hidden layers compared to $\theta_{stego}$ , the parameters of $\theta_{stego}$ are not substituted. $\mathbf{W}_{01}^{(i)}$ and $\mathbf{W}_{02}^{(i)}$ are the remaining parameters of $\theta_{stego}$ . + +Now, $\theta_{stego}$ is fitted to $x_{cover}$ through a selective parameter update using a binary mask, so that the parameters of $\theta_{secret1}$ and $\theta_{secret2}$ are preserved while the remaining weights get updated. After successfully updating the weight space, the reconstructed discrete representation depicts $x_{cover}$ and all secret data can be retrieved from $\theta_{stego}$ . + +For $N > 2$ , the hiding process is expanded in the same manner, so we further explain when $N = 1$ . When there is only one secret data, the parameters of $\theta_{\text{secret1}}$ can be freely allocated in $\theta_{\text{stego}}$ . Suppose that $\theta_{\text{secret1}}$ is allocated in the middle of $\theta_{\text{stego}}$ , then the weight space of $\theta_{\text{stego}}$ is as follows: + +$$ +\mathbf {W} ^ {(i)} = \left( \begin{array}{l l l} \mathbf {W} _ {0 1} ^ {(i)} & \mathbf {W} _ {0 2} ^ {(i)} & \mathbf {W} _ {0 3} ^ {(i)} \\ \mathbf {W} _ {0 4} ^ {(i)} & \mathbf {W} _ {1} ^ {(i)} & \mathbf {W} _ {0 5} ^ {(i)} \\ \mathbf {W} _ {0 6} ^ {(i)} & \mathbf {W} _ {0 7} ^ {(i)} & \mathbf {W} _ {0 8} ^ {(i)} \end{array} \right), \mathbf {b} ^ {(i)} = \left( \begin{array}{l} \mathbf {b} _ {0 1} ^ {(i)} \\ \mathbf {b} _ {1} ^ {(i)} \\ \mathbf {b} _ {0 2} ^ {(i)} \end{array} \right), \tag {4} +$$ + +where $\mathbf{W}^{(i)}$ , $\mathbf{W}_1^{(i)}$ and $\mathbf{b}^{(i)}$ , $\mathbf{b}_1^{(i)}$ are the $i^{\mathrm{th}}$ layer's weight matrices and bias vectors of $\theta_{stego}$ and $\theta_{secret1}$ , for $i \in \{0, \dots, n\}$ . $\mathbf{W}_{01}^{(i)}, \mathbf{W}_{02}^{(i)}, \dots, \mathbf{W}_{08}^{(i)}, \mathbf{b}_{01}^{(i)}$ , and $\mathbf{b}_{02}^{(i)}$ are the remaining parameters of $\theta_{stego}$ . This network then goes through the same processes as when there are multiple secret data. + +The inherent flexibility of our approach is highlighted by its capability to insert diverse data types, in varying amounts, at arbitrary desired positions. This versatility addresses and mitigates capacity constraints. + +# 3.4 Layer-wise Permutation Encoding and Decoding + +To enhance security of our method, we strategically permute the nodes within each layer of the stego network. This layer-wise permutation allows the parameters of the secret INRs to be distributed throughout $\theta_{stego}$ , making the parameters indistinguishable and thus undetectable. In this section, we demonstrate how the permutation is executed via one 128-bit private key $\rho$ , utilizing a cryptographic key derivation function (KDF), which derives one or more secret keys from a master key. First, the private key is randomly selected and is employed to generate $n$ secret keys for the $n$ hidden layers of $\theta_{stego}$ . Subsequently, the nodes of each layer are permuted according to the secret key assigned to each layer. The total number of possible permutation variations per INR is $(\mathbf{D}!)^n$ , where $D$ is the dimension of the hidden layer. This shows that the security implications of this permutation intensify, as the possible combinations of permutation grow exponentially with the number of hidden layers in the $\theta_{stego}$ . + +It is crucial to emphasize that the overall functionality of the neural network remains unchanged throughout this operation. This operation leverages the inherent property of permutation invariance exhibited by Multi-Layer Perceptrons (MLPs) within a single layer. As INRs are also MLP networks, all permuted networks are identical to the original network. Therefore, $\theta_{\text{stepo}}$ is invariant to the layer-wise permutation, whereas extracting the secret INR networks becomes impossible without the private key. + +# 4 Experiment + +We explore the performance of INRSteg focusing on its resilience to distortion, capacity for information hiding, and security against detection. Distortion measures both the indistinguishability between the cover data and the reconstructed data from stego INR, and the performance drop during the hiding and revealing stage of the secret data. Capacity refers to the amount of hidden information that can be privately embedded within the cover data. Security indicates the extent to which the secret data can avoid detection when subjected to steganalysis. + +To thoroughly evaluate the distortion, we employ several metrics tailored to different modalities, which are organized in Appendix A, as well as visualization. In terms of capacity, we present various cross-modal steganography experiments and compare the model size with other previous steganography models. For security, we compute the detection accuracy using image steganalysis models, SiaStegNet [26] and XuNet [22], and visualize weight distribution to show the effects of permutation operation. + +In our groundbreaking research, we highlight three pivotal aspects of our experimental evaluation of INRSteg, a novel steganography method that sets new benchmarks in data hiding techniques: + +- Cross-Modal Steganography We initiated pioneering experiments in cross-modal steganography, demonstrating our method's unique capability to privately embed audio and video data within images. Comprehensive ablation + +study demonstrates that INRSteg is generally applicable across all data modalities achieving high-quality concealment(Sec. 4.1). + +- Intra-Modal Steganography We conduct experiments of hiding data within the same modality, specifically embedding images within images. This approach allowed us to conduct a comparative analysis of distortion and security metrics against those reported in existing literature, showcasing the advanced capabilities of INRSteg. For ablation study, we conduct multi-image steganography experiments varying the amount of secret data(Sec. 4.2). + +- Efficiency and Robustness Analysis To show the efficiency of INRSteg, we perform computational cost comparisons with five existing steganography models. We test the robustness of INRSteg by simulating a challenging scenario where network weights undergo quantization. It demonstrates that our method maintains high performance and robustness even under harsh conditions, which ensures secure and reliable steganography across a wide range of applications(Sec. 4.3). + +Table 1: Results of Cross-modal steganography experiment. VoxCeleb2 and ImageNet dataset are used for secret data and cover data, respectively. "Secret/Revealed" indicates the recovery performance of secret data. "Cover/Stego" indicates the reconstruction performance from stego INR. + +
Secret/RevealedCover/Stego
VoxCeleb2ImageNet
AudioVideoImage
SNR ↑MAE ↓PSNR ↑APD ↓PSNR ↑RMSE ↓
37.558(±5.4)0.314(±0.3)41.448(±3.1)1.349(±0.5)39.258(±4.4)2.948(±1.5)
+ +# 4.1 Cross-modal Steganography + +ImageNet and VoxCeleb2 For cross-modal steganography experiment, we conduct a pioneering steganography experiment that embeds the VoxCeleb2 dataset within images from ImageNet dataset. VoxCeleb2 dataset has both video and audio files, thereby enabling simultaneous playback of visual and auditory data. Using our INRSteg method, we leverage images from ImageNet dataset as cover data to hide video and audio data at the same time. Tab. 1 shows the distortion performance for secret/revealed and cover/stego performance demonstrating the efficacy of our approach in preserving the content of cover and the embedded data. For the secret and the revealed secret data pair, as our framework goes through lossless recovery in terms of INR, the secret/revealed secret performance is solely dependent on the data representation transformation phase. Moreover, Figure 3 shows visualization of the reconstructed data, recovery of video and audio secret data. There is no noticeable quality degradation, + +![](images/49d0c7d2469e8002b795117e96946787a8db390d870744a2017e68d2ccbc8203.jpg) + +![](images/220fbd9c321cf85b68c71b4e3e6e5da978590d0b7e6c0b0e4831b0302741b2c2.jpg) + +![](images/fe1a3ba3109485489b791ae8117e1db9797d656f99a909d58e8ca73b8ee434d9.jpg) + +![](images/8bc8fc2fa71732ec1b1d0328ae28ffe04bb3c211676e699cd11d443ef6d156c7.jpg) +Fig. 3: Visualization results of cross-modal steganography. Can you identify which image is the cover and the reconstructed cover data? For the video and audio examples, can you determine which are the secret and revealed secret data? For images, upper one is cover data and below is reconstructed cover data. For video, upper row is secret data and below is revealed secret data. For audio, the left is secret data and the right is revealed secret data. + +![](images/9522e8d1e7d2a66ba79f990bc6b979ffdd9faa3011ed7cec7277982715861a05.jpg) + +![](images/18d30121a3d170dfa62a786857b87748622cc41de2f1e86d845a0c309800b67e.jpg) + +which implies successful results of cross-modal steganography. Notably, cross-modal steganography is unprecedented, representing a significant improvement in the field of steganography. More reconstruction results using other modalities can be seen in Appendix C, showing successful multi-data steganography with almost no visible difference for both 3D shape and video. Additionally, there are visualization results of weight space after steganography and comparison results of weight distribution after permutation operation in Appendix D, demonstrating the security of INRSteg. + +Ablation study For ablation study, we try to demonstrate that INRSteg is generally applicable across all data modalities for steganography. Therefore, we design experiments that cover all combinations of data modalities where cover data type is image, audio, or video and secret data type is image, audio, 3D shape, or video. The distortion performance of all single-data cross-modal steganography tasks can be seen in Tab. 2, demonstrating achievement of exceptional performance for all cases. For additional reconstruction results, we show them in Appendix C. Recovery performance results for secret data are in Appendix E. A deeper analysis of the results presented in Tab. 2 reveals two key factors that influence improved cover/stego performance: the modality of the secret and cover data, and the capacity of the neural network utilized for the stego INR. We observe that when the modalities of the secret and cover data match, the stego INR demonstrates enhanced accuracy in fitting to the cover data. This phenomenon is attributed to the intrinsic properties of INRs, where the weight spaces of neural networks exhibit similarities when representing with same modality data [21]. Moreover, leveraging the capabilities of INRs, employing a larger neural network for the cover data fitting process enhances the quality of cover data reconstruc + +tion. This can be shown in Tab. 2, where the performance of hiding 3D shapes in images outperforms hiding images in images. This property allows flexible control of the network size for secret and cover data based on the required recovery quality and resource space constraints in the real world. An additional ablation study about the effectiveness of the padding ratio is proposed in Appendix B. + +Table 2: Cover/Stego performance of single-data steganography. The best results are highlighted for each cover modality. + +
Secret typeCover type
ImageAudioVideo
PSNR ↑RMSE ↓SNR ↑MAE ↓PSNR ↑APD ↓
Image62.340.20432.630.59935.263.315
Audio63.160.17941.420.26834.693.574
Video56.180.40827.200.93141.261.532
3D shape92.950.00023.121.40338.542.244
+ +# 4.2 Intra-modal Steganography + +Image steganography In this section, we compare INRSteg to existing image-to-image steganography methods to show that our framework also excels in intra-modal tasks. Tab. 3 compares the performance of INRSteg with other deep learning based image-to-image steganography methods, DeepMIH [4] and an improved DeepSteg [1]. INRSteg outperforms on all metrics showing that our framework achieves state-of-the-art performance. For hiding two secret images into one image, the results in Appendix F, and Figure 4 further visualizes the cover/stego and secret/revealed secret image pairs for two images into one steganography. We continue to compare our results with DeepMIH using difference maps each enhanced by 10, 20, and 30 times. For INRSteg, nearly no visual differences exist between the original and the revealed images even when the difference map is enhanced 30 times. For DeepMIH, on the other hand, we can notice obvious differences for all difference maps when comparing cover/stego and secret1,2/revealed secret 1,2 pairs. + +Image steganalysis To examine security, we adopt two image steganalysis tools, SiaStegNet [26] and XuNet [22]. Tab. 4 presents the detection accuracy of our framework and other models. The security is higher as the detection accuracy is closer to $50\%$ . Unlike other steganography models, the detection accuracy of INRSteg is $50\%$ , meaning that the steganalysis tool completely fails to distinguish the stego data from the cover data. This shows that our framework is undetectable using existing steganalysis tools and assures perfect security. This is because our framework does not directly edit the data in the discrete + +![](images/7d83dba9c971eabf5befbe648aeaf956009fbdd4ed186674103a60512921e151.jpg) +Fig. 4: A comparison of difference maps (enhanced by $10\mathrm{x}$ , $20\mathrm{x}$ , and $30\mathrm{x}$ ) between the original images and the revealed images. Columns 2-6 are results of INRSteg and columns 7-10 are results of DeepMIH [4]. + +representation state, but performs manipulation after transforming the representation into a neural network, which is unnoticeable when re-transformed to the discrete representation. Moreover, we conduct steganalysis analysis on multi-images steganography. The results in Appendix F. + +Multi-image steganography In Tab. 5, we conduct experiments for multi-image steganography hiding more than two images when the size of stego INR is fixed, so that one may have to decrease the network size of each hidden data in order to fit the memory capacity. The results show that high recovery performance maintains even when increasing the number of hidden data. For more experiments with other modalities, please refer to Appendix G. + +Table 3: Performance comparison of imagedto-image steganography. + +
MetricMAE ↓PSNR ↑SSIM ↑RMSE ↓
DeepStegcover2.57637.480.9473.417
secret3.57033.340.9573.57
DeepMIHcover2.83936.050.9324.276
secret3.60432.970.95505.746
INRStegcover0.15362.340.9990.204
secret1.08445.840.9881.326
+ +Table 4: Steganalysis comparison of image-to-image steganography. + +
Accuracy (%)
SiaStegNetXuNet
DeepSteg92.8775.83
DeepMIH90.7090.82
INRSteg50.0050.00
+ +# 4.3 Efficiency and Robustness Analysis + +Model Size Comparison In our efficiency analysis, we compare model sizes to evaluate the computational cost and efficiency of our proposed INRSteg relative to existing steganography models. As described in Tab. 6, our INRSteg achieves a remarkably compact architecture, consisting of only 400,000 param + +eters. Compared to other existing steganography models, this advantage is notable. DeepSteg [1], with 42.58 million parameters, is approximately 107.46 times larger than our model. DeepMIH [4] model, with 12.42 million parameters, has 31.34 times more parameters, and LF-VSN [14], at 7.40 million parameters, is 18.68 times larger. Especially, CRoSS [27] contains 1,066.24 million parameters, corresponding to 2690.54 times the size of the model. This comparative analysis highlights the efficiency of our INRSteg, demonstrating its capability to achieve robust steganography performance with a significantly reduced computational space. The small model not only promotes faster training and inference times, but also opens up opportunities for deployment on devices with limited computational resources such as smartphones. + +Table 5: Distortion performance of hiding multiple images $(>2)$ into one. + +
MetricPSNR ↑RMSE ↓
3 imagescover62.310.204
secret 1,2,343.671.642
4 imagescover62.580.153
secret 1,2,3,441.862.059
+ +Table 6: Model Size Comparison. + +
Model#ParamsRatio to Ours
DeepSteg [1]42.58M107.46×
HiNet [8]4.05M10.22×
DeepMIH [4]12.42M31.34×
CROSS [27]1,066.24M2690.54×
LF-VSN [14]7.40M18.68×
Ours0.40M1×
+ +Robustness We explore the robustness of INRSteg under harsh conditions in real-world scenarios. In particular, we apply quantization operation to store model parameters from float32 to int8 format. This process aims to simulate scenarios where data precision must be reduced due to storage or transmission constraints. After quantization, we recover the parameters from int8 to float32 and evaluate the performance metrics of the recovered secret images. Tab. 7 describes the results of performance comparison before and after quantization across three cover types: image, audio, and video. Notably, while PSNR values decrease after quantization, this decrease is not as significant as might be expected given the harsh nature of the quantization process. This indicates that INRSteg has a robust ability to maintain secret data quality despite the data compression and precision reductions. Furthermore, something to crucially note in Tab. 7 is that the SSIM value hardly changes after quantization. Since SSIM measures the perceptual quality, it is a more representative metric that evaluates image quality. Therefore, the results indicate that the visual content of the secret images remain almost completely. The reconstruction results are in Appendix H. Additionally, we show preserving secret data when using another model compression method, pruning, in Appendix I. + +# 5 Limitations and Discussion + +We would like to highlight the potential negative impacts that steganography frameworks may result in the ethical aspect. Users must be cautious not to utilize + +Table 7: Performance Metrics Before and After Quantization for Different Cover Types. Pre-Q denotes metrics before quantization, Post-Q denotes metrics after quantization. Higher values are better for PSNR and SSIM, while lower values are preferred for RMSE and MAE. + +
Cover typePSNR ↑RMSE ↓SSIM ↑MAE ↓
Pre-QPost-QPre-QPost-QPre-QPost-QPre-QPost-Q
Image40.076633.74832.52455.23750.98210.95541.70853.519
Audio40.076633.54382.52455.36230.98210.95291.70853.723
Video40.076633.82762.52455.18990.98210.95831.70853.417
+ +our work in unethical situations, where one may hide inappropriate information. Additional limitations are described in Appendix J. + +# 6 Conclusion + +In conclusion, this paper introduces INRSteg, an innovative framework designed for the concealment of multiple cross-modal data through the utilization of the weight space inherent in Implicit Neural Representations (INR). Our extensive experimentation demonstrates that INRSteg surpasses existing steganography techniques in key areas, namely distortion evaluation, data capacity, and security measures, across both intra and cross-modal steganography scenarios. A notable advantage of INRSteg is its deployment of smaller model sizes, which directly contributes to reduced energy consumption, making it exceptionally suited for practical real-world applications. Furthermore, our analysis confirms the robustness of INRSteg, even when subjected to the rigorous demands of quantization operations. We believe that INRSteg establishes a new benchmark for achieving an optimal balance between efficiency and performance within the steganography domain, paving the way for future advancements in secure and efficient steganography techniques. + +# Acknowledgements + +This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.RS-2022-II220184, Development and Study of AI Technologies to Inexpensively Conform to Evolving Policy on Ethics) and Institute for Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No. 2021-0-01381, Development of Causal AI through Video Understanding and Reinforcement Learning, and Its Applications to Real Environments). + +# References + +1. Baluja, S.: Hiding images in plain sight: Deep steganography. In: Advances in Neural Information Processing Systems (2017) +2. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021) +3. Dupont, E., Kim, H., Eslami, S., Rezende, D., Rosenbaum, D.: From data to functa: Your data point is a function and you can treat it like one. arXiv preprint arXiv:2201.12204 (2022) +4. Guan, Z., Jing, J., Deng, X., Xu, M., Jiang, L., Zhang, Z., Li, Y.: Deepmih: Deep invertible network for multiple image hiding. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023) +5. Han, G., Lee, D.J., Hur, J., Choi, J., Kim, J.: Deep cross-modal steganography using neural representations. In: 2023 IEEE International Conference on Image Processing (ICIP) (2023) +6. Huu, Q.P., Dinh, T.H., Tran, N.N., Van, T.P., Minh, T.T.: Deep neural networks based invisible steganography for audio-into-image algorithm. In: 2019 IEEE 8th Global Conference on Consumer Electronics (GCCE) (2019) +7. Jain, Y.K., Ahirwal, R.: A novel image steganography method with adaptive number of least significant bits modification based on private stego-keys. In: International Journal of Computer Science and Security (IJCSS) (2010) +8. Jing, J., Deng, X., Xu, M., Wang, J., Guan, Z.: Hinet: Deep image hiding by invertible network. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021) +9. Lee, J., Tack, J., Lee, N., Shin, J.: Meta-learning sparse implicit neural representations. Advances in Neural Information Processing Systems (2021) +0. Li, C., Feng, B.Y., Fan, Z., Pan, P., Wang, Z.: Steganerf: Embedding invisible information within neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023) +1. Liu, Y., Liu, S., Wang, Y., Zhao, H., Liu, S.: Video steganography: A review. Neurocomputing (2019) +2. Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., Galstyan, A.: A survey on bias and fairness in machine learning. ACM Comput. Surv. (2021) +3. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM (2021) +4. Mou, C., Xu, Y., Song, J., Zhao, C., Ghanem, B., Zhang, J.: Large-capacity and flexible video steganography via invertible neural network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023) +5. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition (2019) +6. Shi, H., Dong, J., Wang, W., Qian, Y., Zhang, X.: Ssgan: Secure steganography based on generative adversarial networks. In: Advances in Multimedia Information Processing - PCM 2017 (2018) +7. Simmons, G.J.: The subliminal channel and digital signatures. In: Advances in Cryptology (1985) +8. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in neural information processing systems (2020) + +19. Strümpler, Y., Postels, J., Yang, R., Gool, L.V., Tombari, F.: Implicit neural representations for image compression. In: European Conference on Computer Vision (2022) +20. Subramanian, N., Elharrouss, O., Al-Maadeed, S., Bouridane, A.: Image steganography: A review of the recent advances. IEEE Access (2021) +21. Tancik, M., Mildenhall, B., Wang, T., Schmidt, D., Srinivasan, P.P., Barron, J.T., Ng, R.: Learned initializations for optimizing coordinate-based neural representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2021) +22. Xu, G.: Deep convolutional neural network to detect j-uniward. In: Proceedings of the 5th ACM Workshop on Information Hiding and Multimedia Security (2017) +23. Xu, G., Wu, H.Z., Shi, Y.Q.: Structural design of convolutional neural networks for steganalysis. IEEE Signal Processing Letters (2016) +24. Yang, H., Ouyang, H., Koltun, V., Chen, Q.: Hiding video in audio via reversible generative models. In: 2019 IEEE/CVF International Conference on Computer Vision (ICCV) (2019) +25. Yang, J., Liu, K., Kang, X., Wong, E.K., Shi, Y.Q.: Spatial image steganography based on generative adversarial network. arXiv preprint arXiv:1804.07939 (2018) +26. You, W., Zhang, H., Zhao, X.: A siamese cnn for image steganalysis. IEEE Transactions on Information Forensics and Security (2021) +27. Yu, J., Zhang, X., Xu, Y., Zhang, J.: Cross: Diffusion model makes controllable, robust and secure image steganography. Advances in Neural Information Processing Systems (2024) +28. Zhang, H., Geng, G., Xiong, C.: Image steganography using pixel-value differ-encing. In: 2009 Second International Symposium on Electronic Commerce and Security (2009) +29. Zhou, H., Zhang, W., Chen, K., Li, W., Yu, N.: Three-dimensional mesh steganography and steganalysis: A review. IEEE Transactions on Visualization and Computer Graphics (2022) +30. Zhu, J., Kaplan, R., Johnson, J., Fei-Fei, L.: Hidden: Hiding data with deep networks. In: Proceedings of the European conference on computer vision (ECCV) (2018) \ No newline at end of file diff --git a/2024/Implicit Steganography Beyond the Constraints of Modality/images.zip b/2024/Implicit Steganography Beyond the Constraints of Modality/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..f354aa7f1a02c703fe5a04e0f0021e3164e42f37 --- /dev/null +++ b/2024/Implicit Steganography Beyond the Constraints of Modality/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f57b17a9239a05a9d22d0ec04f1c2ed469a8d858ea22e4bc74f7d9ff42811824 +size 353960 diff --git a/2024/Implicit Steganography Beyond the Constraints of Modality/layout.json b/2024/Implicit Steganography Beyond the Constraints of Modality/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..720203791610458d4f5cb348c9613ac00d7ceadc --- /dev/null +++ b/2024/Implicit Steganography Beyond the Constraints of Modality/layout.json @@ -0,0 +1,8436 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 181, + 112, + 433, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 112, + 433, + 148 + ], + "spans": [ + { + "bbox": [ + 181, + 112, + 433, + 148 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "spans": [ + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "text", + "content": "Sojeong Song" + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "inline_equation", + "content": "^{\\dagger,1}" + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "text", + "content": ", Seoyun Yang" + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "inline_equation", + "content": "^{\\dagger,1}" + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "text", + "content": ", Chang D. Yoo" + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "inline_equation", + "content": "^{\\ddagger,1}" + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "text", + "content": ", and Junmo Kim" + }, + { + "bbox": [ + 208, + 168, + 406, + 193 + ], + "type": "inline_equation", + "content": "^{\\ddagger,1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 156, + 201, + 457, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 201, + 457, + 224 + ], + "spans": [ + { + "bbox": [ + 156, + 201, + 457, + 224 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 156, + 201, + 457, + 224 + ], + "type": "text", + "content": " Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 194, + 225, + 419, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 194, + 225, + 419, + 236 + ], + "spans": [ + { + "bbox": [ + 194, + 225, + 419, + 236 + ], + "type": "text", + "content": "akqqq4985@kaist.ac.kr, seoyun.yang@navercorp.com" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 269, + 452, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 269, + 452, + 467 + ], + "spans": [ + { + "bbox": [ + 160, + 269, + 452, + 467 + ], + "type": "text", + "content": "Abstract. Cross-modal steganography is committed to hiding secret information of one modality in another modality. Despite the advancement in the field of steganography by the introduction of deep learning, cross-modal steganography still remains to be a challenge to the field. The incompatibility between different modalities not only complicate the hiding process but also results in increased vulnerability to detection. To rectify these limitations, we present INRSteg, an innovative cross-modal steganography framework based on Implicit Neural Representations (INRs). We introduce a novel network allocating framework with a masked parameter update which facilitates hiding multiple data and enables cross modality across image, audio, video and 3D shape. Moreover, we eliminate the necessity of training a deep neural network and therefore substantially reduce the memory and computational cost and avoid domain adaptation issues. To the best of our knowledge, in the field of steganography, this is the first to introduce diverse modalities to both the secret and cover data. Detailed experiments in extreme modality settings demonstrate the flexibility, security, and robustness of INRSteg." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 159, + 478, + 453, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 478, + 453, + 499 + ], + "spans": [ + { + "bbox": [ + 159, + 478, + 453, + 499 + ], + "type": "text", + "content": "Keywords: Steganography " + }, + { + "bbox": [ + 159, + 478, + 453, + 499 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 478, + 453, + 499 + ], + "type": "text", + "content": " Implicit neural representations " + }, + { + "bbox": [ + 159, + 478, + 453, + 499 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 478, + 453, + 499 + ], + "type": "text", + "content": " Cross-modal steganography" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 522, + 230, + 534 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 522, + 230, + 534 + ], + "spans": [ + { + "bbox": [ + 132, + 522, + 230, + 534 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 550, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 550, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 550, + 482, + 635 + ], + "type": "text", + "content": "Nowadays, an unprecedented volume of data is shared and stored across various digital platforms and the volume is bound to intensify even further in the future. This proliferation and accessibility of data contributes to convenience in our lives and enables innovation and advancement that weren't achievable in the past; however, it also brings a concerning challenge to the security of information. Steganography aims to hide the secret information inside a cover data resulting in a stego data, also called the container. Unlike cryptography," + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 642, + 312, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 642, + 312, + 653 + ], + "spans": [ + { + "bbox": [ + 141, + 642, + 312, + 653 + ], + "type": "inline_equation", + "content": "\\dagger" + }, + { + "bbox": [ + 141, + 642, + 312, + 653 + ], + "type": "text", + "content": " : Both authors have equally contributed." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 653, + 245, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 653, + 245, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 653, + 245, + 665 + ], + "type": "text", + "content": "†: Corresponding author." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "which investigates in hiding the data of interest in a coded form, steganography operates with imperceptible concealment so that the existence of the secret data is undetectable. For example, individuals can upload their stego data to the cloud and securely trade their private keys with specific parties, and companies can leverage steganography to exchange confidential information, such as new product designs or sensitive meeting recordings, while including ownership details in the data. From a government perspective, steganography can covertly transmit information to foreign spies by inserting confidential national security information into seemingly ordinary cover data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 227, + 483, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 227, + 483, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 227, + 483, + 357 + ], + "type": "text", + "content": "Up to now, image is the most commonly used modality of cover data, as it is less sensitive to human perception and is comparatively simple to embed secret information. However, image steganography tends to have a limit on payload capacity, and is susceptible to detection. Deep learning methods [1, 30] have increased the security, but suffer from unstable extraction and high computational costs [20]. Other modalities such as audio, video and 3D shape also undergo similar limitations [11, 29] and struggle with trade-offs between capacity and security. Moreover, for cross-modal steganography, where the modality of the secret and the cover data differs [5, 6, 24], these limitations intensify due to the difficulties that emerge when the dimension or capacity of the secret data exceed that of the cover data or when the secret data contains temporal information." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 361, + 483, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 361, + 483, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 483, + 456 + ], + "type": "text", + "content": "Implicit neural representations (INRs) have recently attracted extensive attention as an alternative data representation, using continuous and differentiable functions to represent data via parameters of a neural network. The concept of INRs offers a more flexible and expressive approach than the conventional notion of discrete representations. Multiple modalities, as audio, image, video and 3d shape, are all presentable using a single neural network in various resolutions [3]. Moreover, INRs benefit in capacity by reducing the memory cost according to the network design [9, 15]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 460, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 628 + ], + "type": "text", + "content": "In this paper, we present INRSteg, the first cross-modal steganography framework available across a diverse range of modalities, including images, audio, video, and 3D shapes, for both the secret and cover data. By transforming the representation of all data to an implicit form, our framework takes advantage of the flexibility and high capacity inherent in INRs. The flexibility to all modalities enables cross-modal tasks that remained largely unexplored. Along with the versatility across the modalities, our framework is also capable of hiding multiple secret information into one cover data. In Sec. 4, we conduct the hiding of both an audio and an video into a single image, a task which was previously considered highly challenging due to the limited capacity of images. Our framework therefore further enables expansion and intriguing adaptation of steganography into a wider range of fields. In the medical field, for example, private information as an endoscopy video and an audio recording of the heart sound can be hidden under an image of a patient." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": "To further enhance the security, layer-wise permutation of the INR network using a private key is additionally executed. Therefore, the secret INRs' network parameters can be well distributed within the stego INR's network. Revealing" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 170, + 114, + 446, + 313 + ], + "blocks": [ + { + "bbox": [ + 170, + 114, + 446, + 313 + ], + "lines": [ + { + "bbox": [ + 170, + 114, + 446, + 313 + ], + "spans": [ + { + "bbox": [ + 170, + 114, + 446, + 313 + ], + "type": "image", + "image_path": "3f8fadbee5f56ac2237d02b2c73dbe1aa5e2a062314d4d001c114447ca77dc27.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "lines": [ + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 482, + 422 + ], + "type": "text", + "content": "Fig. 1: A general framework of INRSteg for hiding two types of secret data. All four data types can be transformed into INRs, and the red box shows which of the four data types is selected in this case. After the representation transformation of each secret data, the weights of the two INRs are allocated in a new MLP network. With the weight freezing technique, the weights from the secret data are fixed while the rest are fitted on the cover data. The existence of the secret data is concealed by permutation encoding via private key, which does not affect the reconstruction performance. The private key is then used to decode the permuted stego network, and the secret data are revealed by separating each MLP network." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 469, + 482, + 516 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 469, + 482, + 516 + ], + "spans": [ + { + "bbox": [ + 130, + 469, + 482, + 516 + ], + "type": "text", + "content": "the secret data is executed by re-permuting and disassembling the weights of the stego INR. This procedure is not only simple but also guarantees a lossless revealing process as all neural representations of the secret data are fully recoverable." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 519, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 519, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 519, + 482, + 628 + ], + "type": "text", + "content": "Additionally, our framework does not require any deep learning models to be trained for the hiding and revealing process, such as GAN [16, 25] or diffusion models [27]. This excludes the need for any training data and therefore our framework can prevent any biases that may arise from using training datasets [12] and avoids domain shift issues, allowing datasets of all modalities to be applied without any additional pre-processing. Moreover, by eliminating the use of deep networks, our work substantially reduces both the computational and memory costs associated with training and deploying models which have become a significant global challenge." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 665 + ], + "type": "text", + "content": "The proposed framework, INRSteg, achieves flexible cross-modal steganography for multiple secret data by converting the data representation to neural networks. At the same time, we reduce computational and memory costs by" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 203, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 203, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 203, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": "avoiding the use of deep neural networks. For intra-modal steganography, we demonstrate that INRSteg outperforms prior image steganography models such as DeepMIH [4] and DeepSteg [1]. We show INRSteg is robust in the real-world scenarios by applying quantization operation. These are our main contributions, and the details will be described in further sections:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 188, + 480, + 305 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 188, + 479, + 221 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 188, + 479, + 221 + ], + "spans": [ + { + "bbox": [ + 138, + 188, + 479, + 221 + ], + "type": "text", + "content": "- Introduce an Implicit Neural Representation (INR) steganography framework that flexibly adopts to a large range of modalities and further enables all cross-modal steganography." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 224, + 480, + 245 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 224, + 480, + 245 + ], + "spans": [ + { + "bbox": [ + 138, + 224, + 480, + 245 + ], + "type": "text", + "content": "- Demonstrate a neural network allocating procedure that enables cost-effective hiding and revealing of multiple secret data at once." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 248, + 479, + 270 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 248, + 479, + 270 + ], + "spans": [ + { + "bbox": [ + 138, + 248, + 479, + 270 + ], + "type": "text", + "content": "- Comprehensive investigation on distortion, security and capacity shows that INRSteg achieves state-of-the-art cross-modal steganography." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 273, + 479, + 305 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 273, + 479, + 305 + ], + "spans": [ + { + "bbox": [ + 138, + 273, + 479, + 305 + ], + "type": "text", + "content": "- Figure out that INRSteg is the most efficient compared to the previous steganography models and robust in real-world scenarios especially for quantization operation." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 329, + 234, + 341 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 329, + 234, + 341 + ], + "spans": [ + { + "bbox": [ + 132, + 329, + 234, + 341 + ], + "type": "text", + "content": "2 Related work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 356, + 235, + 369 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 356, + 235, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 356, + 235, + 369 + ], + "type": "text", + "content": "2.1 Steganography" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 378, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 581 + ], + "type": "text", + "content": "Steganography is a technique that focuses on hiding confidential information by adeptly embedding data within other publicly accessible data, effectively concealing the very existence of the hidden message. When one is aware of this concealed data, it can be retrieved by a revealing process with an appropriate private key [17]. A prominent approach in historical methods is the Least Significant Bit (LSB) based method, which takes advantage of the imperceptibility of small changes to the least significant bits of the data [7,28]. With the rise of deep neural networks, the field of steganography has rapidly evolved to overcome the challenge of security and capacity. Deepsteg [1], which is an early work of image steganography, attempts to use an encoder and decoder to determine where to place the secret information. CROSS [27] utilizes diffusion models to only reveal the secret information when the accurate prompt is given. To enhance the capacity aspect while ensuring the security, invertible neural networks (INNs) have been actively adopted. In the image steganography field, HiNet [8] incorporates INNs with wavelet domain to minimize distortion, and DeepMIH [4] progresses to hide multiple images into one. LF-VSN [14] further attempts to hide seven videos into one utilizing the INN." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Notwithstanding their innovations, a recurrent limitation across these previous methods is the trade-off between capacity and security. If the cover data is damaged in any way during the embedding process, it becomes susceptible to detection by steganalysis algorithms [23, 26]. This vulnerability poses a significant limitation, especially when attempting to hide large volumes of data such as videos or 3d shapes. INRSteg cannot be detected by traditional steganalysis tools and therefore ensures security while maintaining high capacity." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 299, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 299, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 299, + 129 + ], + "type": "text", + "content": "2.2 Cross-modal steganography" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 482, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 482, + 255 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 482, + 255 + ], + "type": "text", + "content": "The evolution of steganography has also expanded to the concealment of information across different data modalities, such as embedding audio data within videos, which is called cross-modal steganography. [24] embeds video information into audio signals by leveraging the human visual system's inability to recognize high-frequency flickering, allowing for the hidden video to be decoded by recording the sound from a speaker and processing it. [6] utilizes a joint deep neural network architecture comprising two sub-models, one for embedding the audio into an image and another for decoding the image to retrieve the original audio. These methods achieve cross-modal steganography using deep learning techniques, but are still restricted on specified modalities." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 255, + 482, + 388 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 255, + 482, + 388 + ], + "spans": [ + { + "bbox": [ + 130, + 255, + 482, + 388 + ], + "type": "text", + "content": "Recent advancements in Implicit Neural Representations (INRs) have paved the way for a new paradigm in steganography [5, 10]. INRs have been leveraged to represent multiple modalities of data simultaneously. StegaNeRF [10] hides data of various modalities at viewpoints when rendering NeRF. [5] conceals audio, video, and 3D shape data within a cover image, leveraging RGB values as weights of the INRs. While these recent works represent a paradigm shift in steganography techniques, the capacity and security trade-off still remains an issue and the modality of the cover data is set to be singular. Our proposed method in this paper seeks to address and overcome this trade-off while maintaining the advantages of INRs and further eliminating the modality constraint on the cover data, demonstrating a significant advancement in the steganography research." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 404, + 316, + 415 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 404, + 316, + 415 + ], + "spans": [ + { + "bbox": [ + 132, + 404, + 316, + 415 + ], + "type": "text", + "content": "2.3 Implicit neural representations" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 423, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 555 + ], + "type": "text", + "content": "Implicit neural representations (INRs) is a rapidly emerging field where data is expressed in a continuous and differentiable manner through neural networks. This representation [18] is resolution-agnostic [19] and is capable of compressing the data effectively [2]. These advantages highlight various applications of INRs that show superior performance than that of the array-based representation. For example, neural radiance field (NeRF) [13] constructs a 5d scene representation of a 3d object through view-dependent synthesis. [3] proposes a general framework that feeds a modulated INR directly on the downstream models and shows competitive performance on multiple modalities. [9] employs meta-learning coupled with pruning techniques to efficiently scale implicit neural representations for large datasets." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 574, + 202, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 574, + 202, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 574, + 202, + 586 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 598, + 218, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 598, + 218, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 598, + 218, + 609 + ], + "type": "text", + "content": "3.1 Framework" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Our research focuses on INR steganography, where the data representations are transformed into Implicit Neural Representations (INRs), such as SIREN [18]. Figure 1 shows the general framework of our methodology, which is segmented into three sub-stages. In the Data Representation Transformation stage, secret" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 202, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 202, + 91, + 447, + 103 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": "data are transformed into their corresponding Implicit Neural Representations, represented as " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": ". Subsequently, in the Hide/Reveal stage, " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": " is fitted to represent the cover data, " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "x_{\\text{cover}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": ", while preserving the parameters of " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": ". The Layer-wise Permutation Encoding/Decoding stage introduces a layer-wise permutation mechanism, designed to avoid detection of the secret data's presence and location." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 202, + 346, + 215 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 202, + 346, + 215 + ], + "spans": [ + { + "bbox": [ + 131, + 202, + 346, + 215 + ], + "type": "text", + "content": "3.2 Data Representation Transformation" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 219, + 482, + 291 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 219, + 482, + 291 + ], + "spans": [ + { + "bbox": [ + 130, + 219, + 482, + 291 + ], + "type": "text", + "content": "In the first stage, we transform the secret data into Implicit Neural Representations (INRs) by fitting multi-layer perceptrons (MLP) with sine activation functions for each data. This network was first introduced by [18] as SIREN (Sinusoidal representations for neural networks) and is widely used in the INR research field. The structure of the MLP network has " + }, + { + "bbox": [ + 130, + 219, + 482, + 291 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 219, + 482, + 291 + ], + "type": "text", + "content": " hidden layers of size " + }, + { + "bbox": [ + 130, + 219, + 482, + 291 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 219, + 482, + 291 + ], + "type": "text", + "content": " and the output is represented as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 173, + 296, + 480, + 332 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 296, + 480, + 332 + ], + "spans": [ + { + "bbox": [ + 173, + 296, + 480, + 332 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathbf {y} = \\mathbf {W} ^ {(n)} \\left(g _ {n - 1} \\circ \\dots \\circ g _ {1} \\circ g _ {0}\\right) \\left(\\mathbf {x} _ {0}\\right) + \\mathbf {b} ^ {(n)}, \\\\ \\text {w h e r e} \\mathbf {x} _ {i + 1} = g _ {i} \\left(\\mathbf {x} _ {i}\\right) = \\sigma \\left(\\mathbf {W} ^ {(i)} \\mathbf {x} _ {i} + \\mathbf {b} ^ {(i)}\\right), \\tag {1} \\\\ \\end{array}", + "image_path": "06ab75a42396a98d8924693e3e4976d00caaa1895339c57b68ebf43be282c74c.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "spans": [ + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "\\circ" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": " is a function composition of fully-connected layers. In the equation, " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "\\mathbf{x_i}" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": " is the input of the " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "i^{\\mathrm{th}}" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": " layer for " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "i \\in \\{0,1,2,\\dots,n\\}" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "\\mathbf{y} \\in \\mathbb{R}^{O}" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": " is the output value corresponding to " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "\\mathbf{x_0} \\in \\mathbb{R}^I" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "g_{i} \\colon \\mathbb{R}^{D} \\to \\mathbb{R}^{D}" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": ". For our experiments, input and output dimensions " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "(I,O)" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": " are " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "(1,1)" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "(2,3)" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "(3,1)" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "(3,3)" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": " for audio, image, 3D shapes, and video, respectively. If the input or output dimension of the secret INRs exceeds that of the cover INR, our method employs a strategic reduction in the number of hidden layers within the secret INR. Additionally, as the dimension of the hidden layer " + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 335, + 482, + 442 + ], + "type": "text", + "content": " is fixed for each cover modality, the secret INRs' hidden layer dimensions are set accordingly." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "spans": [ + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "text", + "content": "In general, given a set " + }, + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "text", + "content": " of inputs " + }, + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "inline_equation", + "content": "\\mathbf{x} \\in \\mathbb{R}^I" + }, + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "text", + "content": " and the corresponding outputs " + }, + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "inline_equation", + "content": "\\mathbf{y} \\in \\mathbb{R}^O" + }, + { + "bbox": [ + 130, + 443, + 482, + 467 + ], + "type": "text", + "content": ", the loss function is given by" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 239, + 472, + 480, + 498 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 472, + 480, + 498 + ], + "spans": [ + { + "bbox": [ + 239, + 472, + 480, + 498 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {r e c o n}} (\\theta) = \\sum_ {(\\mathbf {x}, \\mathbf {y}) \\in \\mathcal {S}} \\| f _ {\\theta} (\\mathbf {x}) - \\mathbf {y} \\| _ {2} ^ {2} \\tag {2}", + "image_path": "df18eaa7ee53281a2704d73a625f582d409deac93fa22bb284c471cf07b1ea2d.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "spans": [ + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "inline_equation", + "content": "f_{\\theta}" + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "text", + "content": " is the neural representation of the data. For example, given a 2D image, the set " + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "text", + "content": " consists of 2D coordinates " + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "inline_equation", + "content": "\\mathbf{x} \\in \\mathbb{R}^2" + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "text", + "content": " and the corresponding RGB values " + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "inline_equation", + "content": "\\mathbf{y} \\in \\mathbb{R}^3" + }, + { + "bbox": [ + 130, + 502, + 482, + 564 + ], + "type": "text", + "content": ". INRs enable a variety of data types to be expressed in this unified network architecture. This benefits the overall security paradigm of our steganography framework by hiding the underlying data types." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 577, + 246, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 577, + 246, + 588 + ], + "spans": [ + { + "bbox": [ + 131, + 577, + 246, + 588 + ], + "type": "text", + "content": "3.3 Hide and Reveal" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "In this section, we explain our main idea associated with the hiding process. The secret INRs, " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret}}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ", undergo a process of allocation and fitting to the cover data, " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "x_{\\text{cover}}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ". Within the weight space, only the diagonal blocks of weight matrices are occupied by the parameters of " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret}}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ", so that the non-diagonal parameters can be fitted to " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "x_{\\text{cover}}" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": ", while ensuring the diagonal block's weight values to remain unaltered." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": "First, we explain when the number of secret data, " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": ", is two without losing generality for hiding multiple data. The number of input nodes, output nodes, hidden layers, and the dimension of the hidden layers of " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret1}}" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret2}}" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " are each set to " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "(I_1,O_1,n_1,D_1)" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "(I_2,O_2,n_2,D_2)" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": ", respectively. And " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "(I,O,n,D)" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " for the stego INR network, " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "D_1 + D_2" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " is set to equal " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": ". Now, we substitute the parameters of the initialized " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " by concatenating " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret1}}" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret2}}" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " as shown in Figure 2. Note that the initialized parameters of " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "text", + "content": " are omitted for clarity. After the substitution, the parameter of " + }, + { + "bbox": [ + 132, + 116, + 299, + 320 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 304, + 116, + 483, + 201 + ], + "blocks": [ + { + "bbox": [ + 304, + 116, + 483, + 201 + ], + "lines": [ + { + "bbox": [ + 304, + 116, + 483, + 201 + ], + "spans": [ + { + "bbox": [ + 304, + 116, + 483, + 201 + ], + "type": "image", + "image_path": "39da45694ca954d07aa7a484592951658f4e9d5354c0995d2fe1e0adf468c384.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "lines": [ + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "spans": [ + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": "Fig.2: An example of allocating two secret INRs, " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret1}}" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret2}}" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": ", into the stego INR, " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": ". For " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret1}}, \\theta_{\\text{secret2}}" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "(I_1 = 1, O_1 = 1, n_1 = 4, D_1 = 4)" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "(I_2 = 3, O_2 = 3, n_2 = 3, D_2 = 5)" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "inline_equation", + "content": "(I = 2, O = 3, n = 4, D = 9)" + }, + { + "bbox": [ + 304, + 212, + 482, + 280 + ], + "type": "text", + "content": ", respectively." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 212, + 324, + 481, + 355 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 212, + 324, + 481, + 355 + ], + "spans": [ + { + "bbox": [ + 212, + 324, + 481, + 355 + ], + "type": "interline_equation", + "content": "\\mathbf {W} ^ {(i)} = \\left( \\begin{array}{l l} \\mathbf {W} _ {1} ^ {(i)} & \\mathbf {W} _ {0 1} ^ {(i)} \\\\ \\mathbf {W} _ {0 2} ^ {(i)} & \\mathbf {W} _ {2} ^ {(i)} \\end{array} \\right), \\mathbf {b} ^ {(i)} = \\left( \\begin{array}{l} \\mathbf {b} _ {1} ^ {(i)} \\\\ \\mathbf {b} _ {2} ^ {(i)} \\end{array} \\right). \\tag {3}", + "image_path": "baf8b6650225c5b8abdf415b059ae7e0d4c709c44836fdae01e5a1ad9bdc0b1f.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{W}^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_1^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_2^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{b}^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{b}_1^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{b}_2^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " are the " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "i^{\\mathrm{th}}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " layer's weight matrices and bias vectors of " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{secret1}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{secret2}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "i \\in \\{0, \\dots, n\\}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ". If " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{secret1}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{secret2}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " have fewer hidden layers compared to " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": ", the parameters of " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " are not substituted. " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_{01}^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_{02}^{(i)}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": " are the remaining parameters of " + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 359, + 482, + 413 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "content": "Now, " + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "content": " is fitted to " + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "inline_equation", + "content": "x_{cover}" + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "content": " through a selective parameter update using a binary mask, so that the parameters of " + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\theta_{secret1}" + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\theta_{secret2}" + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "content": " are preserved while the remaining weights get updated. After successfully updating the weight space, the reconstructed discrete representation depicts " + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "inline_equation", + "content": "x_{cover}" + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "content": " and all secret data can be retrieved from " + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 413, + 482, + 472 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": "For " + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "inline_equation", + "content": "N > 2" + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": ", the hiding process is expanded in the same manner, so we further explain when " + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "inline_equation", + "content": "N = 1" + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": ". When there is only one secret data, the parameters of " + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret1}}" + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": " can be freely allocated in " + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": ". Suppose that " + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{secret1}}" + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": " is allocated in the middle of " + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": ", then the weight space of " + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stego}}" + }, + { + "bbox": [ + 130, + 472, + 482, + 521 + ], + "type": "text", + "content": " is as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 195, + 524, + 481, + 571 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 195, + 524, + 481, + 571 + ], + "spans": [ + { + "bbox": [ + 195, + 524, + 481, + 571 + ], + "type": "interline_equation", + "content": "\\mathbf {W} ^ {(i)} = \\left( \\begin{array}{l l l} \\mathbf {W} _ {0 1} ^ {(i)} & \\mathbf {W} _ {0 2} ^ {(i)} & \\mathbf {W} _ {0 3} ^ {(i)} \\\\ \\mathbf {W} _ {0 4} ^ {(i)} & \\mathbf {W} _ {1} ^ {(i)} & \\mathbf {W} _ {0 5} ^ {(i)} \\\\ \\mathbf {W} _ {0 6} ^ {(i)} & \\mathbf {W} _ {0 7} ^ {(i)} & \\mathbf {W} _ {0 8} ^ {(i)} \\end{array} \\right), \\mathbf {b} ^ {(i)} = \\left( \\begin{array}{l} \\mathbf {b} _ {0 1} ^ {(i)} \\\\ \\mathbf {b} _ {1} ^ {(i)} \\\\ \\mathbf {b} _ {0 2} ^ {(i)} \\end{array} \\right), \\tag {4}", + "image_path": "354900fb5158f4ea7972a9bb81a97082f966a41443b7095e2f0be9e01010f10e.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathbf{W}^{(i)}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_1^{(i)}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathbf{b}^{(i)}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathbf{b}_1^{(i)}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": " are the " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "i^{\\mathrm{th}}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": " layer's weight matrices and bias vectors of " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\theta_{secret1}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": ", for " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "i \\in \\{0, \\dots, n\\}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_{01}^{(i)}, \\mathbf{W}_{02}^{(i)}, \\dots, \\mathbf{W}_{08}^{(i)}, \\mathbf{b}_{01}^{(i)}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathbf{b}_{02}^{(i)}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": " are the remaining parameters of " + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 575, + 482, + 629 + ], + "type": "text", + "content": ". This network then goes through the same processes as when there are multiple secret data." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "The inherent flexibility of our approach is highlighted by its capability to insert diverse data types, in varying amounts, at arbitrary desired positions. This versatility addresses and mitigates capacity constraints." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 202, + 90, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 90, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 202, + 90, + 448, + 102 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 404, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 404, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 404, + 129 + ], + "type": "text", + "content": "3.4 Layer-wise Permutation Encoding and Decoding" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": "To enhance security of our method, we strategically permute the nodes within each layer of the stego network. This layer-wise permutation allows the parameters of the secret INRs to be distributed throughout " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": ", making the parameters indistinguishable and thus undetectable. In this section, we demonstrate how the permutation is executed via one 128-bit private key " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "\\rho" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": ", utilizing a cryptographic key derivation function (KDF), which derives one or more secret keys from a master key. First, the private key is randomly selected and is employed to generate " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": " secret keys for the " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": " hidden layers of " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": ". Subsequently, the nodes of each layer are permuted according to the secret key assigned to each layer. The total number of possible permutation variations per INR is " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "(\\mathbf{D}!)^n" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": " is the dimension of the hidden layer. This shows that the security implications of this permutation intensify, as the possible combinations of permutation grow exponentially with the number of hidden layers in the " + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "inline_equation", + "content": "\\theta_{stego}" + }, + { + "bbox": [ + 130, + 135, + 482, + 290 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 291, + 482, + 375 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 291, + 482, + 375 + ], + "spans": [ + { + "bbox": [ + 130, + 291, + 482, + 375 + ], + "type": "text", + "content": "It is crucial to emphasize that the overall functionality of the neural network remains unchanged throughout this operation. This operation leverages the inherent property of permutation invariance exhibited by Multi-Layer Perceptrons (MLPs) within a single layer. As INRs are also MLP networks, all permuted networks are identical to the original network. Therefore, " + }, + { + "bbox": [ + 130, + 291, + 482, + 375 + ], + "type": "inline_equation", + "content": "\\theta_{\\text{stepo}}" + }, + { + "bbox": [ + 130, + 291, + 482, + 375 + ], + "type": "text", + "content": " is invariant to the layer-wise permutation, whereas extracting the secret INR networks becomes impossible without the private key." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 392, + 224, + 407 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 224, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 224, + 407 + ], + "type": "text", + "content": "4 Experiment" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 416, + 482, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 416, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 416, + 482, + 501 + ], + "type": "text", + "content": "We explore the performance of INRSteg focusing on its resilience to distortion, capacity for information hiding, and security against detection. Distortion measures both the indistinguishability between the cover data and the reconstructed data from stego INR, and the performance drop during the hiding and revealing stage of the secret data. Capacity refers to the amount of hidden information that can be privately embedded within the cover data. Security indicates the extent to which the secret data can avoid detection when subjected to steganalysis." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 501, + 482, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 584 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 584 + ], + "type": "text", + "content": "To thoroughly evaluate the distortion, we employ several metrics tailored to different modalities, which are organized in Appendix A, as well as visualization. In terms of capacity, we present various cross-modal steganography experiments and compare the model size with other previous steganography models. For security, we compute the detection accuracy using image steganalysis models, SiaStegNet [26] and XuNet [22], and visualize weight distribution to show the effects of permutation operation." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 585, + 482, + 621 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 585, + 482, + 621 + ], + "spans": [ + { + "bbox": [ + 130, + 585, + 482, + 621 + ], + "type": "text", + "content": "In our groundbreaking research, we highlight three pivotal aspects of our experimental evaluation of INRSteg, a novel steganography method that sets new benchmarks in data hiding techniques:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 629, + 485, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 629, + 485, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 629, + 485, + 665 + ], + "type": "text", + "content": "- Cross-Modal Steganography We initiated pioneering experiments in cross-modal steganography, demonstrating our method's unique capability to privately embed audio and video data within images. Comprehensive ablation" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 147, + 116, + 480, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 116, + 480, + 140 + ], + "spans": [ + { + "bbox": [ + 147, + 116, + 480, + 140 + ], + "type": "text", + "content": "study demonstrates that INRSteg is generally applicable across all data modalities achieving high-quality concealment(Sec. 4.1)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 139, + 140, + 487, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 140, + 487, + 212 + ], + "spans": [ + { + "bbox": [ + 139, + 140, + 487, + 212 + ], + "type": "text", + "content": "- Intra-Modal Steganography We conduct experiments of hiding data within the same modality, specifically embedding images within images. This approach allowed us to conduct a comparative analysis of distortion and security metrics against those reported in existing literature, showcasing the advanced capabilities of INRSteg. For ablation study, we conduct multi-image steganography experiments varying the amount of secret data(Sec. 4.2)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 139, + 213, + 482, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 213, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 139, + 213, + 482, + 297 + ], + "type": "text", + "content": "- Efficiency and Robustness Analysis To show the efficiency of INRSteg, we perform computational cost comparisons with five existing steganography models. We test the robustness of INRSteg by simulating a challenging scenario where network weights undergo quantization. It demonstrates that our method maintains high performance and robustness even under harsh conditions, which ensures secure and reliable steganography across a wide range of applications(Sec. 4.3)." + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 133, + 382, + 481, + 448 + ], + "blocks": [ + { + "bbox": [ + 132, + 328, + 482, + 373 + ], + "lines": [ + { + "bbox": [ + 132, + 328, + 482, + 373 + ], + "spans": [ + { + "bbox": [ + 132, + 328, + 482, + 373 + ], + "type": "text", + "content": "Table 1: Results of Cross-modal steganography experiment. VoxCeleb2 and ImageNet dataset are used for secret data and cover data, respectively. \"Secret/Revealed\" indicates the recovery performance of secret data. \"Cover/Stego\" indicates the reconstruction performance from stego INR." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 382, + 481, + 448 + ], + "lines": [ + { + "bbox": [ + 133, + 382, + 481, + 448 + ], + "spans": [ + { + "bbox": [ + 133, + 382, + 481, + 448 + ], + "type": "table", + "html": "
Secret/RevealedCover/Stego
VoxCeleb2ImageNet
AudioVideoImage
SNR ↑MAE ↓PSNR ↑APD ↓PSNR ↑RMSE ↓
37.558(±5.4)0.314(±0.3)41.448(±3.1)1.349(±0.5)39.258(±4.4)2.948(±1.5)
", + "image_path": "c02c80906a0ca4808853c38dc7d07368f40ce727c2d8e6713aaddaf82361d74f.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 488, + 302, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 488, + 302, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 488, + 302, + 502 + ], + "type": "text", + "content": "4.1 Cross-modal Steganography" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "ImageNet and VoxCeleb2 For cross-modal steganography experiment, we conduct a pioneering steganography experiment that embeds the VoxCeleb2 dataset within images from ImageNet dataset. VoxCeleb2 dataset has both video and audio files, thereby enabling simultaneous playback of visual and auditory data. Using our INRSteg method, we leverage images from ImageNet dataset as cover data to hide video and audio data at the same time. Tab. 1 shows the distortion performance for secret/revealed and cover/stego performance demonstrating the efficacy of our approach in preserving the content of cover and the embedded data. For the secret and the revealed secret data pair, as our framework goes through lossless recovery in terms of INR, the secret/revealed secret performance is solely dependent on the data representation transformation phase. Moreover, Figure 3 shows visualization of the reconstructed data, recovery of video and audio secret data. There is no noticeable quality degradation," + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 202, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 202, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 202, + 114, + 271, + 183 + ], + "blocks": [ + { + "bbox": [ + 202, + 114, + 271, + 183 + ], + "lines": [ + { + "bbox": [ + 202, + 114, + 271, + 183 + ], + "spans": [ + { + "bbox": [ + 202, + 114, + 271, + 183 + ], + "type": "image", + "image_path": "49d0c7d2469e8002b795117e96946787a8db390d870744a2017e68d2ccbc8203.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 276, + 114, + 344, + 183 + ], + "blocks": [ + { + "bbox": [ + 276, + 114, + 344, + 183 + ], + "lines": [ + { + "bbox": [ + 276, + 114, + 344, + 183 + ], + "spans": [ + { + "bbox": [ + 276, + 114, + 344, + 183 + ], + "type": "image", + "image_path": "220fbd9c321cf85b68c71b4e3e6e5da978590d0b7e6c0b0e4831b0302741b2c2.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 345, + 114, + 412, + 183 + ], + "blocks": [ + { + "bbox": [ + 345, + 114, + 412, + 183 + ], + "lines": [ + { + "bbox": [ + 345, + 114, + 412, + 183 + ], + "spans": [ + { + "bbox": [ + 345, + 114, + 412, + 183 + ], + "type": "image", + "image_path": "fe1a3ba3109485489b791ae8117e1db9797d656f99a909d58e8ca73b8ee434d9.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 202, + 185, + 271, + 253 + ], + "blocks": [ + { + "bbox": [ + 202, + 185, + 271, + 253 + ], + "lines": [ + { + "bbox": [ + 202, + 185, + 271, + 253 + ], + "spans": [ + { + "bbox": [ + 202, + 185, + 271, + 253 + ], + "type": "image", + "image_path": "8bc8fc2fa71732ec1b1d0328ae28ffe04bb3c211676e699cd11d443ef6d156c7.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 261, + 482, + 327 + ], + "lines": [ + { + "bbox": [ + 130, + 261, + 482, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 482, + 327 + ], + "type": "text", + "content": "Fig. 3: Visualization results of cross-modal steganography. Can you identify which image is the cover and the reconstructed cover data? For the video and audio examples, can you determine which are the secret and revealed secret data? For images, upper one is cover data and below is reconstructed cover data. For video, upper row is secret data and below is revealed secret data. For audio, the left is secret data and the right is revealed secret data." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 275, + 184, + 345, + 253 + ], + "blocks": [ + { + "bbox": [ + 275, + 184, + 345, + 253 + ], + "lines": [ + { + "bbox": [ + 275, + 184, + 345, + 253 + ], + "spans": [ + { + "bbox": [ + 275, + 184, + 345, + 253 + ], + "type": "image", + "image_path": "9522e8d1e7d2a66ba79f990bc6b979ffdd9faa3011ed7cec7277982715861a05.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 345, + 184, + 411, + 253 + ], + "blocks": [ + { + "bbox": [ + 345, + 184, + 411, + 253 + ], + "lines": [ + { + "bbox": [ + 345, + 184, + 411, + 253 + ], + "spans": [ + { + "bbox": [ + 345, + 184, + 411, + 253 + ], + "type": "image", + "image_path": "18d30121a3d170dfa62a786857b87748622cc41de2f1e86d845a0c309800b67e.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 350, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 445 + ], + "type": "text", + "content": "which implies successful results of cross-modal steganography. Notably, cross-modal steganography is unprecedented, representing a significant improvement in the field of steganography. More reconstruction results using other modalities can be seen in Appendix C, showing successful multi-data steganography with almost no visible difference for both 3D shape and video. Additionally, there are visualization results of weight space after steganography and comparison results of weight distribution after permutation operation in Appendix D, demonstrating the security of INRSteg." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 482, + 666 + ], + "type": "text", + "content": "Ablation study For ablation study, we try to demonstrate that INRSteg is generally applicable across all data modalities for steganography. Therefore, we design experiments that cover all combinations of data modalities where cover data type is image, audio, or video and secret data type is image, audio, 3D shape, or video. The distortion performance of all single-data cross-modal steganography tasks can be seen in Tab. 2, demonstrating achievement of exceptional performance for all cases. For additional reconstruction results, we show them in Appendix C. Recovery performance results for secret data are in Appendix E. A deeper analysis of the results presented in Tab. 2 reveals two key factors that influence improved cover/stego performance: the modality of the secret and cover data, and the capacity of the neural network utilized for the stego INR. We observe that when the modalities of the secret and cover data match, the stego INR demonstrates enhanced accuracy in fitting to the cover data. This phenomenon is attributed to the intrinsic properties of INRs, where the weight spaces of neural networks exhibit similarities when representing with same modality data [21]. Moreover, leveraging the capabilities of INRs, employing a larger neural network for the cover data fitting process enhances the quality of cover data reconstruc" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 102 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "tion. This can be shown in Tab. 2, where the performance of hiding 3D shapes in images outperforms hiding images in images. This property allows flexible control of the network size for secret and cover data based on the required recovery quality and resource space constraints in the real world. An additional ablation study about the effectiveness of the padding ratio is proposed in Appendix B." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 166, + 230, + 449, + 315 + ], + "blocks": [ + { + "bbox": [ + 130, + 198, + 483, + 222 + ], + "lines": [ + { + "bbox": [ + 130, + 198, + 483, + 222 + ], + "spans": [ + { + "bbox": [ + 130, + 198, + 483, + 222 + ], + "type": "text", + "content": "Table 2: Cover/Stego performance of single-data steganography. The best results are highlighted for each cover modality." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 166, + 230, + 449, + 315 + ], + "lines": [ + { + "bbox": [ + 166, + 230, + 449, + 315 + ], + "spans": [ + { + "bbox": [ + 166, + 230, + 449, + 315 + ], + "type": "table", + "html": "
Secret typeCover type
ImageAudioVideo
PSNR ↑RMSE ↓SNR ↑MAE ↓PSNR ↑APD ↓
Image62.340.20432.630.59935.263.315
Audio63.160.17941.420.26834.693.574
Video56.180.40827.200.93141.261.532
3D shape92.950.00023.121.40338.542.244
", + "image_path": "252a8ab90a0e66fe496febecbce51b50681f85e5b7e752122352d9edb0b8626a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 358, + 299, + 372 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 358, + 299, + 372 + ], + "spans": [ + { + "bbox": [ + 131, + 358, + 299, + 372 + ], + "type": "text", + "content": "4.2 Intra-modal Steganography" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 381, + 482, + 550 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 381, + 482, + 550 + ], + "spans": [ + { + "bbox": [ + 130, + 381, + 482, + 550 + ], + "type": "text", + "content": "Image steganography In this section, we compare INRSteg to existing image-to-image steganography methods to show that our framework also excels in intra-modal tasks. Tab. 3 compares the performance of INRSteg with other deep learning based image-to-image steganography methods, DeepMIH [4] and an improved DeepSteg [1]. INRSteg outperforms on all metrics showing that our framework achieves state-of-the-art performance. For hiding two secret images into one image, the results in Appendix F, and Figure 4 further visualizes the cover/stego and secret/revealed secret image pairs for two images into one steganography. We continue to compare our results with DeepMIH using difference maps each enhanced by 10, 20, and 30 times. For INRSteg, nearly no visual differences exist between the original and the revealed images even when the difference map is enhanced 30 times. For DeepMIH, on the other hand, we can notice obvious differences for all difference maps when comparing cover/stego and secret1,2/revealed secret 1,2 pairs." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "text", + "content": "Image steganalysis To examine security, we adopt two image steganalysis tools, SiaStegNet [26] and XuNet [22]. Tab. 4 presents the detection accuracy of our framework and other models. The security is higher as the detection accuracy is closer to " + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "text", + "content": ". Unlike other steganography models, the detection accuracy of INRSteg is " + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "text", + "content": ", meaning that the steganalysis tool completely fails to distinguish the stego data from the cover data. This shows that our framework is undetectable using existing steganalysis tools and assures perfect security. This is because our framework does not directly edit the data in the discrete" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 202, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 202, + 91, + 447, + 103 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 153, + 117, + 461, + 231 + ], + "blocks": [ + { + "bbox": [ + 153, + 117, + 461, + 231 + ], + "lines": [ + { + "bbox": [ + 153, + 117, + 461, + 231 + ], + "spans": [ + { + "bbox": [ + 153, + 117, + 461, + 231 + ], + "type": "image", + "image_path": "7d83dba9c971eabf5befbe648aeaf956009fbdd4ed186674103a60512921e151.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "lines": [ + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "spans": [ + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "type": "text", + "content": "Fig. 4: A comparison of difference maps (enhanced by " + }, + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "type": "inline_equation", + "content": "10\\mathrm{x}" + }, + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "type": "inline_equation", + "content": "20\\mathrm{x}" + }, + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "type": "inline_equation", + "content": "30\\mathrm{x}" + }, + { + "bbox": [ + 130, + 243, + 480, + 277 + ], + "type": "text", + "content": ") between the original images and the revealed images. Columns 2-6 are results of INRSteg and columns 7-10 are results of DeepMIH [4]." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 300, + 480, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 480, + 350 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 480, + 350 + ], + "type": "text", + "content": "representation state, but performs manipulation after transforming the representation into a neural network, which is unnoticeable when re-transformed to the discrete representation. Moreover, we conduct steganalysis analysis on multi-images steganography. The results in Appendix F." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 367, + 480, + 440 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 367, + 480, + 440 + ], + "spans": [ + { + "bbox": [ + 130, + 367, + 480, + 440 + ], + "type": "text", + "content": "Multi-image steganography In Tab. 5, we conduct experiments for multi-image steganography hiding more than two images when the size of stego INR is fixed, so that one may have to decrease the network size of each hidden data in order to fit the memory capacity. The results show that high recovery performance maintains even when increasing the number of hidden data. For more experiments with other modalities, please refer to Appendix G." + } + ] + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 137, + 494, + 335, + 579 + ], + "blocks": [ + { + "bbox": [ + 141, + 462, + 329, + 484 + ], + "lines": [ + { + "bbox": [ + 141, + 462, + 329, + 484 + ], + "spans": [ + { + "bbox": [ + 141, + 462, + 329, + 484 + ], + "type": "text", + "content": "Table 3: Performance comparison of imagedto-image steganography." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 137, + 494, + 335, + 579 + ], + "lines": [ + { + "bbox": [ + 137, + 494, + 335, + 579 + ], + "spans": [ + { + "bbox": [ + 137, + 494, + 335, + 579 + ], + "type": "table", + "html": "
MetricMAE ↓PSNR ↑SSIM ↑RMSE ↓
DeepStegcover2.57637.480.9473.417
secret3.57033.340.9573.57
DeepMIHcover2.83936.050.9324.276
secret3.60432.970.95505.746
INRStegcover0.15362.340.9990.204
secret1.08445.840.9881.326
", + "image_path": "466bd912deb610ff8483887e16f84b323e2a41994b6715140b9b1c2b8ac73703.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 343, + 505, + 474, + 578 + ], + "blocks": [ + { + "bbox": [ + 342, + 462, + 473, + 495 + ], + "lines": [ + { + "bbox": [ + 342, + 462, + 473, + 495 + ], + "spans": [ + { + "bbox": [ + 342, + 462, + 473, + 495 + ], + "type": "text", + "content": "Table 4: Steganalysis comparison of image-to-image steganography." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 343, + 505, + 474, + 578 + ], + "lines": [ + { + "bbox": [ + 343, + 505, + 474, + 578 + ], + "spans": [ + { + "bbox": [ + 343, + 505, + 474, + 578 + ], + "type": "table", + "html": "
Accuracy (%)
SiaStegNetXuNet
DeepSteg92.8775.83
DeepMIH90.7090.82
INRSteg50.0050.00
", + "image_path": "d7f3c492506cb68c4dd75101dd4e2163161c7920647f181d4141af0559c8dc33.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 596, + 338, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 596, + 338, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 596, + 338, + 609 + ], + "type": "text", + "content": "4.3 Efficiency and Robustness Analysis" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": "Model Size Comparison In our efficiency analysis, we compare model sizes to evaluate the computational cost and efficiency of our proposed INRSteg relative to existing steganography models. As described in Tab. 6, our INRSteg achieves a remarkably compact architecture, consisting of only 400,000 param" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 101 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": "eters. Compared to other existing steganography models, this advantage is notable. DeepSteg [1], with 42.58 million parameters, is approximately 107.46 times larger than our model. DeepMIH [4] model, with 12.42 million parameters, has 31.34 times more parameters, and LF-VSN [14], at 7.40 million parameters, is 18.68 times larger. Especially, CRoSS [27] contains 1,066.24 million parameters, corresponding to 2690.54 times the size of the model. This comparative analysis highlights the efficiency of our INRSteg, demonstrating its capability to achieve robust steganography performance with a significantly reduced computational space. The small model not only promotes faster training and inference times, but also opens up opportunities for deployment on devices with limited computational resources such as smartphones." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 140, + 311, + 302, + 376 + ], + "blocks": [ + { + "bbox": [ + 140, + 278, + 301, + 301 + ], + "lines": [ + { + "bbox": [ + 140, + 278, + 301, + 301 + ], + "spans": [ + { + "bbox": [ + 140, + 278, + 301, + 301 + ], + "type": "text", + "content": "Table 5: Distortion performance of hiding multiple images " + }, + { + "bbox": [ + 140, + 278, + 301, + 301 + ], + "type": "inline_equation", + "content": "(>2)" + }, + { + "bbox": [ + 140, + 278, + 301, + 301 + ], + "type": "text", + "content": " into one." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 140, + 311, + 302, + 376 + ], + "lines": [ + { + "bbox": [ + 140, + 311, + 302, + 376 + ], + "spans": [ + { + "bbox": [ + 140, + 311, + 302, + 376 + ], + "type": "table", + "html": "
MetricPSNR ↑RMSE ↓
3 imagescover62.310.204
secret 1,2,343.671.642
4 imagescover62.580.153
secret 1,2,3,441.862.059
", + "image_path": "aee28b3d437aa74f4326df4c528a31f440dfe8c52728b0cde1f4874449877503.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 321, + 299, + 471, + 375 + ], + "blocks": [ + { + "bbox": [ + 324, + 278, + 465, + 290 + ], + "lines": [ + { + "bbox": [ + 324, + 278, + 465, + 290 + ], + "spans": [ + { + "bbox": [ + 324, + 278, + 465, + 290 + ], + "type": "text", + "content": "Table 6: Model Size Comparison." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 321, + 299, + 471, + 375 + ], + "lines": [ + { + "bbox": [ + 321, + 299, + 471, + 375 + ], + "spans": [ + { + "bbox": [ + 321, + 299, + 471, + 375 + ], + "type": "table", + "html": "
Model#ParamsRatio to Ours
DeepSteg [1]42.58M107.46×
HiNet [8]4.05M10.22×
DeepMIH [4]12.42M31.34×
CROSS [27]1,066.24M2690.54×
LF-VSN [14]7.40M18.68×
Ours0.40M1×
", + "image_path": "59275b424280567fd389c299637a811c817694d627b336ee858249a5fd15f127.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 388, + 482, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 604 + ], + "type": "text", + "content": "Robustness We explore the robustness of INRSteg under harsh conditions in real-world scenarios. In particular, we apply quantization operation to store model parameters from float32 to int8 format. This process aims to simulate scenarios where data precision must be reduced due to storage or transmission constraints. After quantization, we recover the parameters from int8 to float32 and evaluate the performance metrics of the recovered secret images. Tab. 7 describes the results of performance comparison before and after quantization across three cover types: image, audio, and video. Notably, while PSNR values decrease after quantization, this decrease is not as significant as might be expected given the harsh nature of the quantization process. This indicates that INRSteg has a robust ability to maintain secret data quality despite the data compression and precision reductions. Furthermore, something to crucially note in Tab. 7 is that the SSIM value hardly changes after quantization. Since SSIM measures the perceptual quality, it is a more representative metric that evaluates image quality. Therefore, the results indicate that the visual content of the secret images remain almost completely. The reconstruction results are in Appendix H. Additionally, we show preserving secret data when using another model compression method, pruning, in Appendix I." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 619, + 314, + 632 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 619, + 314, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 619, + 314, + 632 + ], + "type": "text", + "content": "5 Limitations and Discussion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "We would like to highlight the potential negative impacts that steganography frameworks may result in the ethical aspect. Users must be cautious not to utilize" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 202, + 90, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 90, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 202, + 90, + 447, + 103 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 168, + 465, + 232 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 157 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 157 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 157 + ], + "type": "text", + "content": "Table 7: Performance Metrics Before and After Quantization for Different Cover Types. Pre-Q denotes metrics before quantization, Post-Q denotes metrics after quantization. Higher values are better for PSNR and SSIM, while lower values are preferred for RMSE and MAE." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 168, + 465, + 232 + ], + "lines": [ + { + "bbox": [ + 148, + 168, + 465, + 232 + ], + "spans": [ + { + "bbox": [ + 148, + 168, + 465, + 232 + ], + "type": "table", + "html": "
Cover typePSNR ↑RMSE ↓SSIM ↑MAE ↓
Pre-QPost-QPre-QPost-QPre-QPost-QPre-QPost-Q
Image40.076633.74832.52455.23750.98210.95541.70853.519
Audio40.076633.54382.52455.36230.98210.95291.70853.723
Video40.076633.82762.52455.18990.98210.95831.70853.417
", + "image_path": "07e05bbe8bcf23f14650416b983522df6fafeebb9a60e673e44abe71046890a1.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 254, + 479, + 277 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 254, + 479, + 277 + ], + "spans": [ + { + "bbox": [ + 132, + 254, + 479, + 277 + ], + "type": "text", + "content": "our work in unethical situations, where one may hide inappropriate information. Additional limitations are described in Appendix J." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 296, + 218, + 308 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 296, + 218, + 308 + ], + "spans": [ + { + "bbox": [ + 132, + 296, + 218, + 308 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 321, + 481, + 488 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 321, + 481, + 488 + ], + "spans": [ + { + "bbox": [ + 132, + 321, + 481, + 488 + ], + "type": "text", + "content": "In conclusion, this paper introduces INRSteg, an innovative framework designed for the concealment of multiple cross-modal data through the utilization of the weight space inherent in Implicit Neural Representations (INR). Our extensive experimentation demonstrates that INRSteg surpasses existing steganography techniques in key areas, namely distortion evaluation, data capacity, and security measures, across both intra and cross-modal steganography scenarios. A notable advantage of INRSteg is its deployment of smaller model sizes, which directly contributes to reduced energy consumption, making it exceptionally suited for practical real-world applications. Furthermore, our analysis confirms the robustness of INRSteg, even when subjected to the rigorous demands of quantization operations. We believe that INRSteg establishes a new benchmark for achieving an optimal balance between efficiency and performance within the steganography domain, paving the way for future advancements in secure and efficient steganography techniques." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 507, + 246, + 520 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 507, + 246, + 520 + ], + "spans": [ + { + "bbox": [ + 133, + 507, + 246, + 520 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 532, + 481, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 481, + 628 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 481, + 628 + ], + "type": "text", + "content": "This work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.RS-2022-II220184, Development and Study of AI Technologies to Inexpensively Conform to Evolving Policy on Ethics) and Institute for Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No. 2021-0-01381, Development of Causal AI through Video Understanding and Reinforcement Learning, and Its Applications to Real Environments)." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 102 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "type": "text", + "content": "1. Baluja, S.: Hiding images in plain sight: Deep steganography. In: Advances in Neural Information Processing Systems (2017)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "text", + "content": "2. Dupont, E., Golinski, A., Alizadeh, M., Teh, Y.W., Doucet, A.: Coin: Compression with implicit neural representations. arXiv preprint arXiv:2103.03123 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 184, + 480, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 480, + 216 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 480, + 216 + ], + "type": "text", + "content": "3. Dupont, E., Kim, H., Eslami, S., Rezende, D., Rosenbaum, D.: From data to functa: Your data point is a function and you can treat it like one. arXiv preprint arXiv:2201.12204 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 217, + 480, + 249 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 480, + 249 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 480, + 249 + ], + "type": "text", + "content": "4. Guan, Z., Jing, J., Deng, X., Xu, M., Jiang, L., Zhang, Z., Li, Y.: Deepmih: Deep invertible network for multiple image hiding. IEEE Transactions on Pattern Analysis and Machine Intelligence (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 250, + 480, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 250, + 480, + 282 + ], + "spans": [ + { + "bbox": [ + 138, + 250, + 480, + 282 + ], + "type": "text", + "content": "5. Han, G., Lee, D.J., Hur, J., Choi, J., Kim, J.: Deep cross-modal steganography using neural representations. In: 2023 IEEE International Conference on Image Processing (ICIP) (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 283, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 283, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 138, + 283, + 480, + 315 + ], + "type": "text", + "content": "6. Huu, Q.P., Dinh, T.H., Tran, N.N., Van, T.P., Minh, T.T.: Deep neural networks based invisible steganography for audio-into-image algorithm. In: 2019 IEEE 8th Global Conference on Consumer Electronics (GCCE) (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 316, + 480, + 348 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 480, + 348 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 480, + 348 + ], + "type": "text", + "content": "7. Jain, Y.K., Ahirwal, R.: A novel image steganography method with adaptive number of least significant bits modification based on private stego-keys. In: International Journal of Computer Science and Security (IJCSS) (2010)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 349, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 349, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 349, + 480, + 380 + ], + "type": "text", + "content": "8. Jing, J., Deng, X., Xu, M., Wang, J., Guan, Z.: Hinet: Deep image hiding by invertible network. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 381, + 480, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 381, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 381, + 480, + 403 + ], + "type": "text", + "content": "9. Lee, J., Tack, J., Lee, N., Shin, J.: Meta-learning sparse implicit neural representations. Advances in Neural Information Processing Systems (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 480, + 435 + ], + "type": "text", + "content": "0. Li, C., Feng, B.Y., Fan, Z., Pan, P., Wang, Z.: Steganerf: Embedding invisible information within neural radiance fields. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 436, + 480, + 457 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 436, + 480, + 457 + ], + "spans": [ + { + "bbox": [ + 138, + 436, + 480, + 457 + ], + "type": "text", + "content": "1. Liu, Y., Liu, S., Wang, Y., Zhao, H., Liu, S.: Video steganography: A review. Neurocomputing (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 458, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 458, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 458, + 480, + 479 + ], + "type": "text", + "content": "2. Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., Galstyan, A.: A survey on bias and fairness in machine learning. ACM Comput. Surv. (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "type": "text", + "content": "3. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 513, + 480, + 545 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 513, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 138, + 513, + 480, + 545 + ], + "type": "text", + "content": "4. Mou, C., Xu, Y., Song, J., Zhao, C., Ghanem, B., Zhang, J.: Large-capacity and flexible video steganography via invertible neural network. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "text", + "content": "5. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition (2019)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 578, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 610 + ], + "type": "text", + "content": "6. Shi, H., Dong, J., Wang, W., Qian, Y., Zhang, X.: Ssgan: Secure steganography based on generative adversarial networks. In: Advances in Multimedia Information Processing - PCM 2017 (2018)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 611, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 480, + 632 + ], + "type": "text", + "content": "7. Simmons, G.J.: The subliminal channel and digital signatures. In: Advances in Cryptology (1985)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 480, + 665 + ], + "type": "text", + "content": "8. Sitzmann, V., Martel, J., Bergman, A., Lindell, D., Wetzstein, G.: Implicit neural representations with periodic activation functions. Advances in neural information processing systems (2020)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 202, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 202, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Steganography Beyond the Constraints of Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 468 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "19. Strümpler, Y., Postels, J., Yang, R., Gool, L.V., Tombari, F.: Implicit neural representations for image compression. In: European Conference on Computer Vision (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 480, + 172 + ], + "type": "text", + "content": "20. Subramanian, N., Elharrouss, O., Al-Maadeed, S., Bouridane, A.: Image steganography: A review of the recent advances. IEEE Access (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 480, + 215 + ], + "type": "text", + "content": "21. Tancik, M., Mildenhall, B., Wang, T., Schmidt, D., Srinivasan, P.P., Barron, J.T., Ng, R.: Learned initializations for optimizing coordinate-based neural representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 480, + 237 + ], + "type": "text", + "content": "22. Xu, G.: Deep convolutional neural network to detect j-uniward. In: Proceedings of the 5th ACM Workshop on Information Hiding and Multimedia Security (2017)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 237, + 480, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 480, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 480, + 259 + ], + "type": "text", + "content": "23. Xu, G., Wu, H.Z., Shi, Y.Q.: Structural design of convolutional neural networks for steganalysis. IEEE Signal Processing Letters (2016)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "text", + "content": "24. Yang, H., Ouyang, H., Koltun, V., Chen, Q.: Hiding video in audio via reversible generative models. In: 2019 IEEE/CVF International Conference on Computer Vision (ICCV) (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "type": "text", + "content": "25. Yang, J., Liu, K., Kang, X., Wong, E.K., Shi, Y.Q.: Spatial image steganography based on generative adversarial network. arXiv preprint arXiv:1804.07939 (2018)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "text", + "content": "26. You, W., Zhang, H., Zhao, X.: A siamese cnn for image steganalysis. IEEE Transactions on Information Forensics and Security (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "text", + "content": "27. Yu, J., Zhang, X., Xu, Y., Zhang, J.: Cross: Diffusion model makes controllable, robust and secure image steganography. Advances in Neural Information Processing Systems (2024)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "text", + "content": "28. Zhang, H., Geng, G., Xiong, C.: Image steganography using pixel-value differ-encing. In: 2009 Second International Symposium on Electronic Commerce and Security (2009)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 402, + 480, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 480, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 480, + 435 + ], + "type": "text", + "content": "29. Zhou, H., Zhang, W., Chen, K., Li, W., Yu, N.: Three-dimensional mesh steganography and steganalysis: A review. IEEE Transactions on Visualization and Computer Graphics (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 480, + 468 + ], + "type": "text", + "content": "30. Zhu, J., Kaplan, R., Johnson, J., Fei-Fei, L.: Hidden: Hiding data with deep networks. In: Proceedings of the European conference on computer vision (ECCV) (2018)" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 221, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 221, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 221, + 101 + ], + "type": "text", + "content": "S. Song et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_content_list.json b/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..3477043e3b8524b5fc934543dd7db08f4aa270f5 --- /dev/null +++ b/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_content_list.json @@ -0,0 +1,1765 @@ +[ + { + "type": "text", + "text": "Implicit Style-Content Separation using B-LoRA", + "text_level": 1, + "bbox": [ + 222, + 141, + 779, + 162 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yarden Frenkel1, Yael Vinker1, Ariel Shamir2, and Daniel Cohen-Or1", + "bbox": [ + 250, + 188, + 750, + 205 + ], + "page_idx": 0 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1 Tel Aviv University", + "2 Reichman University" + ], + "bbox": [ + 423, + 215, + 578, + 244 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/fc29fa0746009eef1e925220a21f3f48d8c9a17f886e141a858f8e51afaa0668.jpg", + "image_caption": [ + "Fig. 1: By implicitly decomposing a single image into its style and content representation, captured by B-LoRA, we can perform high quality style-content mixing and even swapping the style and content between two stylized images." + ], + "image_footnote": [], + "bbox": [ + 230, + 260, + 772, + 444 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Image stylization involves manipulating the visual appearance and texture (style) of an image while preserving its underlying objects, structures, and concepts (content). The separation of style and content is essential for manipulating the image's style independently from its content, ensuring a harmonious and visually pleasing result. Achieving this separation requires a deep understanding of both the visual and semantic characteristics of images, often necessitating the training of specialized models or employing heavy optimization.", + "bbox": [ + 259, + 511, + 740, + 621 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this paper, we introduce B-LoRA, a method that leverages LoRA (Low-Rank Adaptation) to implicitly separate the style and content components of a single image, facilitating various image stylization tasks.", + "bbox": [ + 259, + 621, + 740, + 662 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "By analyzing the architecture of SDXL combined with LoRA, we find that jointly learning the LoRA weights of two specific blocks (referred to as B-LoRAs) achieves style-content separation that cannot be achieved by training each B-LoRA independently. Consolidating the training into only two blocks and separating style and content allows for significantly improving style manipulation and overcoming overfitting issues often associated with model fine-tuning.", + "bbox": [ + 259, + 662, + 740, + 758 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Once trained, the two B-LoRAs can be used as independent components to allow various image stylization tasks, including image style transfer, text-based image stylization, consistent style generation, and style-content mixing.", + "bbox": [ + 259, + 758, + 740, + 814 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/9fb5e3442e1ebe41569152b8734ceca642663d003cae8ecc7a3de5514039c0bc.jpg", + "image_caption": [ + "Input content" + ], + "image_footnote": [], + "bbox": [ + 218, + 160, + 325, + 241 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/14987fe572b33f4ac8947ae1c9f3be8acbdfb8c7bf3a497915248795f5071ceb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 341, + 161, + 444, + 241 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/910cdfe0ac0f4b318318bcde51a7eef0ea179f8132f190b66efb2a157f0ba857.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 450, + 161, + 553, + 242 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/a30951db7c3ea39346fdc539b16f3befdc2f40d1e494b4bc49ae4c0f3535fa32.jpg", + "image_caption": [ + "Fig. 2: Examples of image stylization generated with our approach. The content image is shown on the left. We show here three results of image style transfer based on a reference style, one (on the right) based on a guiding text prompt. Note that our method requires only a single image, and preserves the image's content and structure well while applying the desired style." + ], + "image_footnote": [], + "bbox": [ + 558, + 161, + 665, + 243 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/8ac753bfd681f536642da941c6b532f3320d921fe631cca407195b30225f8386.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 669, + 161, + 774, + 243 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 354, + 375, + 372 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Image stylization is a well-established task in computer vision, and has been actively researched for many years [16,22]. This task involves changing the style of an image following some style reference, which can be text-based or image-based while preserving its content. Content refers to the semantic information and structure of the image, while style often refers to visual features and patterns such as colors and textures [46]. Image style manipulation is a highly challenging task, since style and content are strongly connected, leading to an inherent trade-off between style transformation and content preservation. On the other hand, many style manipulation tasks require a clear separation between style and content within an image.", + "bbox": [ + 212, + 386, + 787, + 537 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we present B-LoRA, a method for style-content separation of any given image. Our method distills the style and content from a single image to support various style manipulation applications.", + "bbox": [ + 212, + 537, + 787, + 583 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In the realm of recent advancements in large language-vision models, existing approaches utilize the strong visual-semantic priors embedded within these models to facilitate style manipulation tasks. Common techniques involve fine-tuning a pre-trained text-to-image model to account for a new style or content [4, 19, 24, 42]. However, fine-tuned models often suffer from the inherent trade-off between style transformation and content preservation as they are prone to over-fitting. Unlike these methods, we unify the learning of style and content components by separating them per image (see Figure 1). This separation is performed by fitting a light-weight adapter (B-LoRA) that is less prone to over-fitting issues, and enables task flexibility, allowing for both text-based and reference style image conditions.", + "bbox": [ + 212, + 584, + 787, + 748 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our method utilizes LoRA (Low Rank Adaptation) [24], which has emerged as a popular approach due to its high-quality results and efficiency. LoRA incorporates optimizing external low-rank weight matrices for the attention layers of the base model, while the pretrained model weights remain \"frozen\". After training, these matrices define the adapted model that can be used for the desired task. LoRA is often utilized for image stylization by fine-tuning the base model", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "with respect to a set of images that can either represent the desired style or the desired content.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Specifically, we use LoRA with Stable Diffusion XL (SDXL) [38], a recently introduced text-to-image diffusion model renowned for its powerful style learning capabilities. Through detailed analysis of various layers within SDXL and their effect on the adaptation procedure, we made a surprising discovery: two specific transformer blocks can be used to separate the style and content of an input image, and to easily control them distinctly in generated images. For clarification, in this paper, we define a transformer block as a sequence of 10 consecutive attention layers.", + "bbox": [ + 212, + 176, + 785, + 297 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Therefore, when provided with a single input image, we jointly optimize the LoRA weights corresponding to these two distinct transformer blocks with the objective of reconstructing the given image based on a provided text prompt. Since we only optimize the LoRA weights of these two transformer blocks, we refer to them as \"B-LoRAs\". The crucial aspect is that these B-LoRAs are trained on a single image only, yet they successfully disentangle its style and content, thereby circumventing the prevalent overfitting problem associated with common LoRA techniques that can struggle to change the style and/or content of an input image. Our technique benefits from the innate style-content disentanglement within the layers of the architecture. Another advantage of our method is that the B-LoRAs can be easily used as separate components, allowing various challenging style manipulation tasks without requiring any additional training or fine-tuning. In particular, we demonstrate style transfer, text-guided style manipulation and consistent style-conditioned image generation (see Figure 2).", + "bbox": [ + 212, + 297, + 787, + 508 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We note that recent attempts have been made to combine trained LoRAs of style and content to a unified model [44]. This approach requires a new optimization process for each style-content combination. This is both time-consuming and raises challenges in achieving an effective trade-off between style transformation and content preservation. In contrast, our trained B-LoRAs can be easily replugged into a pre-trained model combined with other learned blocks from other reference images, without any further training.", + "bbox": [ + 212, + 508, + 787, + 614 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We provide extensive evaluation of our method showing its advantages compared to alternative approaches that are often designed to achieve one of these tasks. Our method provides a practical and simple way for image stylization that can be broadly used with existing models.", + "bbox": [ + 212, + 614, + 785, + 676 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 700, + 387, + 717 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Style Transfer Image style transfer is a longstanding challenge in computer vision [12,22], aimed at altering the style of an image based on a given reference. With the progress of deep learning research, Neural Style Transfer (NST) approaches rely on deep features extracted from pre-trained networks to merge content and style [16,28,29]. Subsequent GAN-based [17] techniques were proposed to transfer images across domains, using either paired [27] or unpaired [30,35,57] image sets, yet they require domain-specific datasets and training.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Recent advancements in language-vision models and diffusion models have revolutionized the field of image stylization. Leveraging the vast knowledge encoded in pre-trained language-vision models, modern approaches explore zero-shot image stylization and editing [6, 10, 11, 13, 32, 34, 36, 52], where images are manipulated without additional fine-tuning or data adaptation by intervening in the generation process. Prompt-to-Prompt [20] proposes an approach to edit generated images by manipulating their cross-attention maps. In Plug-and-Play [47] the appearance of a content image is manipulated with respect to a given text prompt by adjusting spatial features from the guidance image via the self-attention mechanism. Cross Image Attention (CIA) [2] presents a method to modify the image appearance based on a reference image through alterations in cross-attention mechanisms. While these approaches effectively transform the appearance of the content image, they may encounter challenges in transferring appearance between subjects with differing semantics.", + "bbox": [ + 212, + 146, + 787, + 357 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "StyleAligned [21] utilizes attention features sharing combined with the AdaIN mechanism [25] to achieve style alignment between a sequence of generated images. However, the method is not explicitly designed to control the content of the generated image, potentially resulting in style image structure leakage. Similarly, the lack of style-content separation is also evident in encoder-based methods, such as IP-Adapter [53]. InstantStyle [51] is a concurrent work to ours, aiming to improve IP-Adapter for image stylization tasks by injecting the CLIP embedding of the style image into specific blocks within SDXL. In our work, we decompose the style and the content and learn a separate representation for each.", + "bbox": [ + 212, + 359, + 789, + 510 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Text-to-Image Personalization In another line of work [3, 4, 14, 19, 42, 50], optimization techniques are proposed to extend pre-trained Text-to-Image models to support the generation of novel visual concepts, including both style and content, based on a small set of input images with the same concept. This allows utilizing the rich semantic-visual prior of pre-trained models for customized tasks such as producing images of a desired style. Existing methods employ either token optimization techniques [1, 14, 49, 50, 55, 56], fine-tuning the model's weights [42], or a combination of both [3-5,7]. Token optimization requires longer training times and often results in sub-optimal reconstruction. While model finetuning provides better reconstruction, it consumes substantial memory and tends to overfit. To address the memory inefficiency, and to facilitate more efficient model fine-tuning, Parameter Efficient Fine-Tuning (PEFT) approaches have been proposed [23, 24, 31]. StyleDrop [45] utilizes Muse [9] as a base model, and adjusts its styles to align with a reference image. StyleDrop trains a lightweight adapter layer at the end of each attention block within the transformer model. However, similar to StyleAligned [21], their approach is designed for style adaptation, but for content preservation, another optimization is required. Among existing PEFT methods, Low-Rank Adaptation (LoRA) [24] is a popular finetuning technique, widely used by researchers and practitioners for its versatility and high-quality results.", + "bbox": [ + 212, + 537, + 789, + 843 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "LoRA for Image Stylization LoRA is often used for image stylization by fine-tuning a model to produce images of a desired style. Commonly, a LoRA is trained on a set of images, and then it is combined with control methods such as stylistic Concept-Slanders [15] or ControlNet [40, 54], along with a text prompt to condition the generated image content. While LoRA-based approaches have demonstrated significant abilities in capturing style and content, two separate LoRA models are required for this task, and there is no trivial way to combine them. A common naïve approach is to combine two LoRAs by directly interpolating their weights [43], relying on a manual search for the desired coefficients. Alternative approaches [18, 37] propose an optimization-based strategy to find the optimal coefficients for such a combination. However, they focus on combining two objects and not on image stylization tasks.", + "bbox": [ + 212, + 146, + 787, + 327 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Recently, Shah et al. introduced ZipLoRA [44], proposing to merge two individual LoRAs trained for style and content into a new 'zipped' LoRA by learning mixing coefficients for their columns. This work is closely related to ours, as we also mix LoRA weights trained on different images to facilitate image stylization. However, ZipLoRA requires an additional optimization stage for each new combination of content and style, thereby restricting the flexibility of reusing trained LoRA weights, which is LoRA's primary advantage. In contrast, our approach allows for the direct reuse of learned styles and contents without additional training, enhancing efficiency and versatility. Moreover, we demonstrate that our implicit approach is more robust to challenging styles and contents.", + "bbox": [ + 212, + 329, + 787, + 479 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 503, + 382, + 520 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "SDXL Architecture In our work, we utilize the recently introduced publicly available text-to-image Stable Diffusion XL (SDXL) [38], which is an upgraded version of the known Stable Diffusion [41]. Both models are types of latent diffusion models (LDM), where the diffusion process is applied in the latent space of a pre-trained image autoencoder. The SDXL architecture leverages a three times larger UNet backbone compared to Stable Diffusion. The UNet consists of a total number of 70 attention layers. Each layer consists of a cross and self-attention. These attention layers are often referred to as attention blocks. In this paper, for clarity, we refer to them as layers so they are not confused with the larger transformer blocks we optimize. These attention layers are divided into 11 transformer blocks where the first two and last three blocks are comprised of four and six attention layers, respectively. The six inner blocks consist of 10 attention layers each, as illustrated in Figure 3).", + "bbox": [ + 212, + 537, + 787, + 733 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Text condition generation is also extended in SDXL in the following way: given a text prompt $y$ , it is encoded twice, with both OpenCLIP ViT-bigG [26] and CLIP ViT-L [39]. The resulting embeddings are then concatenated to define the conditioning encoding $c$ . Then this text embedding is fed into the cross-attention layers of the network, following the attention mechanism [48].", + "bbox": [ + 212, + 734, + 787, + 809 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Specifically, in each layer, the deep spatial features $x$ are projected to a query matrix $Q = l_{Q}(x)$ , and the textual embedding is projected to a key matrix", + "bbox": [ + 212, + 809, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "$K = l_{K}(c)$ and a value matrix $V = l_{V}(c)$ via learned linear projections $l_{Q}, l_{K}, l_{V}$ . The attention maps are then defined by:", + "bbox": [ + 215, + 146, + 782, + 176 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nA _ {t} = \\operatorname {S o f t m a x} \\left(\\frac {Q K ^ {T}}{\\sqrt {d}}\\right) V, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 413, + 186, + 785, + 220 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $d$ is the latent projection dimension of the keys and queries.", + "bbox": [ + 238, + 228, + 718, + 244 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "LoRA Low-Rank Adaptation [24] is a method for efficiently fine-tuning large pre-trained models for specific tasks or domains. LoRA has emerged as a very popular approach for fine-tuning pre-trained text-to-image diffusion models [43] due to its high-quality results and efficiency.", + "bbox": [ + 212, + 257, + 782, + 316 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Let us denote the weights of a pre-trained text-to-image diffusion model with $W_0$ , and the learned residuals after fine-tuning the model for a specific task with $\\Delta W$ . The key idea in LoRA is that $\\Delta W \\in \\mathbb{R}^{m \\times n}$ can be decomposed into two low intrinsic rank matrices $B \\in \\mathbb{R}^{m \\times r}$ and $A \\in \\mathbb{R}^{r \\times n}$ , such that $\\Delta W = BA$ , and the rank $r << \\min(m, n)$ . During training, the original model weights $W_0$ remain frozen, and only $A$ and $B$ are updated. Thus, by the end of the training, we can obtain the tuned model weights by using $W = W_0 + \\Delta W$ .", + "bbox": [ + 214, + 318, + 784, + 422 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "LoRA is commonly used in text-to-image diffusion models only in the cross and self-attention layers. As discussed, the attention mechanism in each layer relies on four projection matrices: $l_{Q}$ , $l_{K}$ , $l_{V}$ , and $l_{\\mathrm{out}}$ . The LoRA weights $\\Delta W_{Q}$ , $\\Delta W_{K}$ , $\\Delta W_{V}$ , and $\\Delta W_{\\mathrm{out}}$ are optimized for each of these pre-trained matrices. We denote by $\\Delta W$ the LoRA weights of all four matrices.", + "bbox": [ + 214, + 424, + 785, + 500 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Method", + "text_level": 1, + "bbox": [ + 215, + 521, + 330, + 537 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Our objective is to decouple the style and content aspects of an input image $I$ into separate components, enabling both text-based and image-based stylization applications. Our approach harnesses the capabilities of a pre-trained SDXL text-to-image generation model [38], known for its robustness in capturing stylistic features [44]. We conduct an analysis of the SDXL architecture to gain insight into the contributions of individual layers to either the style or the content of the generated image. Guided by our observations, we employ LoRA [24] to train update matrices of only two specific transformer blocks within the SDXL model. These matrices capture the representation of the content and the style of the input image and they suffice to facilitate a number of image stylization tasks.", + "bbox": [ + 212, + 551, + 787, + 705 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 SDXL Architecture Analysis", + "text_level": 1, + "bbox": [ + 215, + 724, + 500, + 739 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Similar to previous works [1, 50] we examine the effect of different layers within the base text-to-image model on the generated image. We adopt a similar approach to the one proposed in Voynov et al. [50]. The key idea is to inject a different text prompt into the cross-attention layers of one of the transformer blocks within SDXL. Then examine the similarity between the different prompts and the resulting image. If we only change the input prompt corresponding to", + "bbox": [ + 212, + 748, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "the i'th block, and the i'th block dominates a certain quality of the generated image, this will be apparent in the resulting image. Specifically, we examine six intermediate transformer blocks $\\{W_0^1,\\dots W_0^6\\}$ of SDXL, each containing 10 attention layers (see Figure 3). These layers have been selected based on previous works [1,50], which demonstrate that they are most likely to affect the important visual properties of the generated images.", + "bbox": [ + 212, + 146, + 787, + 236 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We define two random sets of text prompts $P_{content}$ and $P_{style}$ describing different objects with different colors. The prompts in $P_{content}$ are defined by placing random objects in the template text \"A photo of a \". For $P_{style}$ we use the template \"A photo of a \". The random objects and colors are generated with ChatGPT. Note that color is used as a proxy for style since we use CLIP [39] to evaluate results (as will be described next), and we found CLIP to be a better indicator for changes in color than changes in style. We sample a pair of prompts $(p, \\hat{p}) \\in P_{content}$ and $(p, \\hat{p}) \\in P_{style}$ such that $p \\neq \\hat{p}$ .", + "bbox": [ + 212, + 237, + 486, + 508 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For each pair $(\\hat{p}, p)$ , we generate an image $I_{\\hat{p} \\to i, p \\to j \\neq i}$ by injecting the embedding of $\\hat{p}$ to $W_0^i$ while injecting the embedding of $p$ to all other layers $W_0^j, j \\neq i$ (illustrated in Figure 3). This is performed for each of the six transformer blocks we target, resulting in six images per pair.", + "bbox": [ + 212, + 510, + 486, + 630 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Next, to measure the effect of injecting $\\hat{p}$ into the i'th block on the generated image, we estimate the following similarity score:", + "bbox": [ + 212, + 630, + 785, + 660 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {C} (I _ {\\hat {p} \\rightarrow i, p \\rightarrow j}, \\hat {p}) = s i m (C L I P _ {I} (I _ {\\hat {p} \\rightarrow i, p \\rightarrow j}), C L I P _ {T} (\\hat {p})), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 310, + 672, + 785, + 691 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $CLIP_{I}(I_{\\hat{p}\\rightarrow i,p\\rightarrow j})$ and $CLIP_{T}(\\hat{p})$ are the CLIP image embedding of the generated image, and the CLIP text embedding of the prompt, respectively. $sim(x,y) = \\frac{x\\cdot y}{||x||\\cdot||y||}$ indicates the cosine similarity between the clip embeddings.", + "bbox": [ + 212, + 700, + 785, + 750 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In total, we examined 400 pairs of content and style prompts and averaged the scores of each layer. The three topmost layers that show similarity to one type of prompt are $W_0^2$ and $W_0^4$ which dominate the content of the generated image, and $W_0^5$ which dominates its color. We visually demonstrate these conclusions in Figure 4. On the left, we show the effect of blocks 2 and 4 on the generated content. Note that $I_{\\hat{p} \\to 2,p \\to j}$ and $I_{\\hat{p} \\to 4,p \\to j}$ demonstrate that when \"A photo of", + "bbox": [ + 212, + 750, + 787, + 842 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/13efb2f31619e716ed1ed8ae5bebf371cf561c9d705ece0811ec4ecd9c217e14.jpg", + "image_caption": [ + "Fig.3: Illustration of SDXL architecture and our text-based analysis. To examine the effect of the i'th transformer block on the generated image, we inject a different text prompt $\\hat{p}$ to it, while $p$ is injected into all other blocks." + ], + "image_footnote": [], + "bbox": [ + 501, + 270, + 787, + 484 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "a tiger\" is injected to only one block (2 or 4), while \"A photo of a bunny\" is injected to the rest of the blocks, the generated images depict a tiger, while in all other options, the generated image will depict a bunny. Similarly, on the right we show the effect of block 5 on the generated image's color.", + "bbox": [ + 212, + 146, + 787, + 208 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Effect of blocks 2,4 on the generated content", + "bbox": [ + 223, + 237, + 496, + 251 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$p =$ \"A photo of a bunny\"", + "bbox": [ + 225, + 255, + 357, + 268 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$\\hat{p} =$ \"A photo of a tiger\"", + "bbox": [ + 225, + 268, + 352, + 280 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/176a86f3e5b2fd3b803b6ec98ec01630ab18adecc4953234b11643e771c076d3.jpg", + "image_caption": [ + "Fig. 4: Prompt injection effect on the generated image. On the left, we demonstrate how blocks 2 and 4 affect the content in the generated image (turning into a tiger), whereas the rightmost image shows that injecting $\\hat{p}$ to a block $i \\neq 2, 4$ has no effect on the generated image. On the right we show how the fifth block controls the generated image's color." + ], + "image_footnote": [], + "bbox": [ + 225, + 284, + 320, + 371 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/837c9b06a7b7538d5f732ca47ef8169813a86e07f937d30725616f1f7e4436d0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 323, + 284, + 421, + 371 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/3634c8164d2f66de6d9ffdd76093e2ef3823877e0ca0fac881e987c953279e58.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 424, + 287, + 521, + 372 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Effect of block 5 on the generated color", + "bbox": [ + 544, + 237, + 776, + 251 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$p =$ \"A photo of a green bunny\"", + "bbox": [ + 558, + 257, + 720, + 268 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$\\hat{p} =$ \"A photo of a blue bunny\"", + "bbox": [ + 558, + 270, + 714, + 281 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$I_{\\widehat{p}\\rightarrow 5,p\\rightarrow j\\neq 5}$", + "bbox": [ + 552, + 284, + 640, + 299 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "All others", + "bbox": [ + 674, + 287, + 727, + 297 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/1aa33f665213d679724c8c08fd2ff6512019b8e58b285b75ff5c868e37b86301.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 552, + 299, + 648, + 371 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/4379c8a81ef9cf8ca12571604ed372ee6fd57085f2ffd980ddc48d79bb4ca0a4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 653, + 299, + 750, + 372 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 LoRA-Based Separation with B-LoRA", + "text_level": 1, + "bbox": [ + 214, + 508, + 578, + 525 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "While the observations above apply to a generated image, our goal is to examine if the layers we locate could be useful in capturing the content and style of a given input image $I$ . To fine-tune the model to generate variations of our given image we utilize the LoRA [24] approach.", + "bbox": [ + 212, + 537, + 787, + 597 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Let us denote the frozen weights of our base pre-trained SDXL model with $W_0$ and the learned residual matrices for each block with $\\Delta W^i$ . We follow the default settings of DreamBooth LoRA [43] to finetune the model to reconstruct the given input image $I$ .", + "bbox": [ + 212, + 597, + 787, + 657 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "However, instead of optimizing the LoRA weights of all eleven blocks (as usually done), we conduct two experiments, where in the first experiment we optimize the pair $\\{\\Delta W^2, \\Delta W^5\\}$ , and in the second experiment we optimize $\\{\\Delta W^4, \\Delta W^5\\}$ (as we found $W_0^2$ and $W_0^4$ to dominate the content, and $W_0^5$ to dominate the color). In addition, we use a general prompt \"A [v]\" during training to prevent the model from being explicitly guided to capture either the image's style or content. This process and example results are depicted in Figure 5. As can be seen, we find that the best combination to optimize in terms of 1. Achieving a full reconstruction of the input concept, and 2. Capturing the input image's content, are $\\Delta W^4, \\Delta W^5$ . Note that using the deeper layers of the UNet $\\Delta W^4$ , rather than $\\Delta W^2$ during the LoRA training process, aligns with the goal of preserving finer details in the output image, as demonstrated in [47]. We", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "provide ablation and analysis of the effect of other layers and specific parts within them, as well as the effect of using different text prompts in the supplementary material.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/7ffdb86072d95fa06f4dd58a6e046b40a7051f4ffcc6b156dc75d8832e0cc640.jpg", + "image_caption": [ + "Fig.5: Comparison of training B-LoRAs for the input images shown on the left for $W_0^2$ , $W_0^5$ (middle) and $W_0^4$ , $W_0^5$ (right). For each pair of trained LoRA weights, we show the results of applying both together (to reconstruct the input image) and applying the content layer separately (i.e. using only $\\Delta W^2$ and $\\Delta W^4$ ). The results demonstrate that $\\Delta W^4$ better captures the fine details of the input object." + ], + "image_footnote": [], + "bbox": [ + 215, + 215, + 787, + 348 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We call such a training scheme $B\\text{-LoRA}$ , as it only trains two transformer Blocks instead of the full weights. Hence, apart from the style-content separation abilities such a method also reduces storage requirements by $70\\%$ .", + "bbox": [ + 212, + 459, + 787, + 506 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 B-LoRA for Image Stylization", + "text_level": 1, + "bbox": [ + 214, + 523, + 511, + 539 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Combining the insights from the above analyses, we now describe the B-LoRA training approach. Given an input image $I$ , we only fine-tune the LoRA weights $\\Delta W^4$ , $\\Delta W^5$ with the objective of reconstructing the image, w.r.t a general text prompt \"A [v]\". Besides increasing efficiency, we find that by training only these two layers, we can achieve an implicit style-content decomposition, where $\\Delta W^4$ captures the content and $\\Delta W^5$ captures the style.", + "bbox": [ + 212, + 545, + 787, + 635 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Once we find these update matrices, we can easily use them by updating the corresponding block weights of the pre-trained SDXL model for style manipulation applications as described next and demonstrated in Figure 6.", + "bbox": [ + 212, + 636, + 787, + 681 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Image stylization based on image style reference Given two input images $I_{c}, I_{s}$ depicting the desired content and style respectively, we use the process described above to learn their corresponding B-LoRA weights: $\\Delta W_{c}^{4}, \\Delta W_{c}^{5}$ for $I_{c}$ and $\\Delta W_{s}^{4}, \\Delta W_{s}^{5}$ for $I_{s}$ . We then directly use $\\Delta W_{c}^{4}$ and $\\Delta W_{s}^{5}$ to update the transformer blocks $W_{0}^{4}$ and $W_{0}^{5}$ of the pre-trained network. For the inference process, we use the prompt \"A [c] in [s] style\", as illustrated at the top of Figure 6.", + "bbox": [ + 212, + 691, + 787, + 784 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Text-based image stylization By omitting $\\Delta W_{c}^{5}$ (capturing the style of $I_{c}$ ) and only using $\\Delta W_{c}^{4}$ to update the weights of the pre-trained model, we get a personalized model that is adapted to only the content of $I_{c}$ . To manipulate the style of", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 732, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "(1) Image stylization based on image style reference", + "bbox": [ + 225, + 147, + 514, + 161 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/8db6d57d577b08242e8184e1913987c6e0999b5a37dd18f773a63246fa6a4006.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 228, + 164, + 781, + 265 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/f76dd23ac3a7c46e4640b2cfbc2ed497d9469c3c878b81369b0138041f55c154.jpg", + "image_caption": [ + "Fig. 6: B-LoRA for Image Stylization. (1) To stylize a given content image $I_{c}$ w.r.t an given style image reference $I_{s}$ , we train our B-LoRAs for both images and then combine $\\Delta W_{c}^{4}$ and $\\Delta W_{s}^{5}$ to a single adapted model. (2) For text-based stylization we simply plug only the trained $\\Delta W_{c}^{4}$ to adapt the model and then use the desired text prompt during inference. (3) The learned style weights $\\Delta W_{c}^{5}$ can be also used as is to adjust the backbone model to produce images with the style of $I_{c}$ ." + ], + "image_footnote": [], + "bbox": [ + 227, + 270, + 483, + 377 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/6856cbbc00e40d28f905b635011b66acaed926b303d3f6c51169df37db716277.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 517, + 272, + 754, + 376 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "$I_{c}$ with text-based guidance, we simply inject the desired text into the adapted layers during inference (see Figure 6 bottom-left). Note that because the style and content are separated and encoded in different blocks, our approach allows challenging style manipulations.", + "bbox": [ + 212, + 508, + 787, + 570 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Consistent style generation. Lastly, in a similar manner, one can adapt the model for a specific style provided in $I_{s}$ by excluding $\\Delta W_{s}^{4}$ and using only $\\Delta W_{s}^{5}$ . This results in a model adapted to the desired style, and one can use text-based conditions to generate any content with the desired style (see Figure 6 bottom-right).", + "bbox": [ + 212, + 588, + 787, + 662 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.4 Implementation details", + "text_level": 1, + "bbox": [ + 214, + 690, + 452, + 705 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We train the B-LoRA weights on SDXL v1.0 [38] while keeping both the model weights and text encoders frozen during the fine-tuning process. All LoRA training was performed on a single image. We utilize the Adam optimizer with a learning rate of $5e - 5$ . For data augmentations, we only use center cropping during training. We set the LoRA weights rank to $r = 64$ and use the prompt \"A [v]\" for 1000 optimization steps, requiring approximately 10 minutes per image on a single A100 GPU. Note that while other methods typically train LoRA for 400 steps to mitigate overfitting concerns, this was not an issue in our case.", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5 Results", + "text_level": 1, + "bbox": [ + 217, + 143, + 323, + 159 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To produce the various results of our approach we optimized our B-LoRAs $(\\Delta W^4, \\Delta W^5)$ once for each image and then plugged either one of them or both of them (depending on the application) at inference time to receive image stylization without any further optimization or fine-tuning.", + "bbox": [ + 218, + 176, + 784, + 234 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We present some qualitative results of the three applications discussed in Section 4.3 in Figure 7. In the first two rows of Figure 7, our method manages to transfer the style of the image references (top row) while preserving the content of the input image on the left. Notable, this can be done for challenging content inputs such as stylized images (first row) and images of whole scenes (second row). Our method is robust to many types of different styles and manages to preserve the essence of the content reference even in very abstract styles such as the one depicted in the third style column. In the third row, we show examples of text-based image stylization. As can be seen with our implicit style-content separation, the content of the input object is preserved well while the style is governed by the desired text prompt. In the last row, we demonstrate how our method can be used for consistent style generation where only the B-LoRA weights of the style are used. Observe that the object's style is well preserved across all text-based generated images. Please refer to the supplementary material for many more examples.", + "bbox": [ + 217, + 237, + 785, + 462 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Comparisons We next compare our method with alternative approaches, both qualitatively and quantitatively. Note that since we rely on SDXL as our backbone model, for a fair comparison we applied alternative approaches on SDXL as well. As a naïve baseline we employ DB-LoRA [43] (fine-tuned for style) with a ControlNet [54] for content conditioning. We additionally compare to three recent approaches for image stylization that rely on the prior of large pre-trained text-to-image models, namely, ZipLoRA [44], StyleDrop [45], and StyleAligned [21]. StyleAligned is applied using the author's official implementation. With the lack of official implementations for StyleDrop and ZipLoRA, we implemented StyleDrop on SDXL (as described in [21]), and utilized a non-official implementation of ZipLoRA [33].", + "bbox": [ + 217, + 477, + 785, + 643 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Note that for content preservation, all three alternative methods require multiple content images, while our method can be applied to a single image. Thus, for a fair comparison, we collected a total set of 23 objects from existing personalization works [14, 31, 42, 49], where a small set of images is provided for each object. We collected 20 style image references from [21, 45], along with 5 additional style images of our own. From these sets, we randomly sampled 50 pairs of style and content images to compose our final evaluation set.", + "bbox": [ + 217, + 643, + 785, + 748 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In terms of runtime, StyleAligned is zero-shot only for consistent style generation, while for content preservation it relies on LoRA to adapt the model to the desired concepts. Similarly, StyleDrop and ZipLoRA require LoRA training for content and style. Thus, our runtime is comparable to theirs. However, ZipLoRA entails an extra training phase to merge the two LoRAs, making it more time-consuming than our approach.", + "bbox": [ + 217, + 750, + 785, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/ba1433f6bfa3a5754f4765f1efe8f3a9d63b901a36c431596493ad029056fdf5.jpg", + "image_caption": [ + "Fig. 7: Results produced by our method for three image stylization tasks. Rows 1-3: image style transfer. Our method can operate on scene images and extract content from a stylized image. Fourth row: text-based image stylization applied to the content image reference on the left. Note how the pose and identity are preserved well. Last row: consistent style generation, where that style is extracted from the image on the left and used to generate new objects. In this row, we use $\\alpha = 1.1$ to enhance the style effect." + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 776, + 551 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Qualitative Evaluation We show representative comparison results in Figure 8, where on the left we show the style and content reference images. On the first four rows, we show the results of alternative approaches when applied with multiple content images, whereas our method uses a single image. As can be seen, our method effectively preserves the subject from the content image while transferring the desired style. In contrast, other methods either overfit the content subject, thereby failing to alter its style (e.g., cat and sloth in ZipLoRA and StyleDrop), or they suffer from style image \"leakage\". For instance, in the cat example of StyleAligned (first row), the model generates two cats, matching", + "bbox": [ + 212, + 703, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/6813df2515fe5bf35f1873e3db26f487d2ed971733509ee457c10e37334f9e93.jpg", + "image_caption": [ + "Fig. 8: Comparison with alternative approaches. The input style and content references are shown on the left, where multiple content images were used for alternative methods. In the last row, we applied other approaches to a single content image. ZipLoRA tends to overfit the content, and thus struggles with depicting the desired style. StyleDrop also struggles to preserve the content when trained on multiple images. In the case of a single content image (last row), both methods preserve the content but lose the style. StyleAligned preserves the style well; however, it tends to include semantic content originating in the style image, such as creating a couple in row 1. Additional comparisons to InstantStyle [51] are provided in the supplementary material." + ], + "image_footnote": [], + "bbox": [ + 217, + 141, + 790, + 474 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "the number of people in the style reference image. We also include an example of alternative methods applied to a single content image, where StyleDrop and ZipLoRA exhibit increased overfitting.", + "bbox": [ + 212, + 641, + 787, + 688 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Quantitative Evaluation We measure content and style preservation by computing the cosine similarity between the embeddings of the input content and style references and the output image, utilizing the DINO ViT-B/8 embeddings [8]. The average scores are presented in Table 1. Our method achieves the highest style alignment score, indicating its superior ability to adapt styles effectively. However, we observe lower object similarity scores, possibly due to content overfitting issues observed in alternative approaches. To further support this observation, we conducted the same experiment using a single content image as a reference (scores shown in the \"single\" row). The results indicate a decrease", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 406, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "in style consistency scores across all methods, accompanied by an increase in content preservation scores, suggesting overfitting.", + "bbox": [ + 212, + 146, + 785, + 176 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "User Study We conducted a user study to further validate the findings presented above. Using 30 random images from our evaluation set, we compared our results with the three alternative approaches. The participants were presented with the reference style and content images along with two combined results, one produced by our method and the other by an alternative method (with the results presented in random order). Participants were asked to choose the result that \"better transfers the style from the style image while preserving the content of the content image\". We collected responses from 34 participants for the survey, which contained a total of 1020 answers. The results demonstrate a strong preference for our method, with $94\\%$ of participants favoring our method over StyleAligned, $91\\%$ over ZipLoRA, and $88\\%$ over StyleDrop.", + "bbox": [ + 212, + 202, + 787, + 369 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/a0ce3c9dd18129fb10fc28b85e06a69d84269bcb6860667785d651dbe5ca7562.jpg", + "table_caption": [ + "Table 1: Quantitative comparison. We measure the average cosine similarity between the DINO features of the output image and the reference style and content. Our method performs best at adapting to the style without overfitting the content image." + ], + "table_footnote": [], + "table_body": "
InputStyleDropStyleAlignedZipLoRADB-LoRAOurs
Style TransferMultiple0.826 ± 0.070.855 ± 0.050.796 ± 0.070.863 ± 0.060.881 ± 0.05
Single0.790 ± 0.060.829 ± 0.050.782 ± 0.05
ContentMultiple0.817 ± 0.060.779 ± 0.050.841 ± 0.050.769 ± 0.050.790 ± 0.05
Single0.874 ± 0.080.792 ± 0.060.933 ± 0.05
", + "bbox": [ + 217, + 454, + 810, + 547 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusions and Future work", + "text_level": 1, + "bbox": [ + 215, + 613, + 535, + 630 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We have presented a simple yet effective method to disentangle the style and content of a single input image. The style and content components are encoded separately with two B-LoRAs, providing high flexibility for independent use in various image stylization tasks. In contrast to existing methods that focus on style extraction, we employ a compound style-content learning approach that enables a better separation of style and content, enhancing stylization fidelity.", + "bbox": [ + 212, + 656, + 785, + 747 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "As for future research, one possible avenue is to further explore separation techniques within LoRA fine-tuning, to achieve more concrete separation into sub-components such as structure, shape, color, texture, etc. This could provide users with more control over the desired output. Another direction for future work is to leverage the robustness of our approach and extend it to combine LoRA weights from multiple distinct objects or combine a few styles.", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We would like to thank Amir Hertz and Yuval Alaluf for their insightful feedback. Additionally, some of the artistic paintings presented in this paper were created by the artist Judith Kondor Mochary. We thank the artist's family for granting us the privilege to use Judith's drawings. This work was supported by the Israel Science Foundation under Grant No. 2492/20, 3441/21 and 1390/19, and Joint NSFC-ISF Research Grant Research Grant no. 3077/23.", + "bbox": [ + 212, + 180, + 787, + 272 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 297, + 321, + 314 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Agarwal, A., Karanam, S., Shukla, T., Srinivasan, B.V.: An image is worth multiple words: Multi-attribute inversion for constrained text-to-image synthesis. ArXiv abs/2311.11919 (2023), https://api-semanticscholar.org/CorpusID: 265295502", + "2. Alaluf, Y., Garibi, D., Patashnik, O., Averbuch-Elor, H., Cohen-Or, D.: Cross-image attention for zero-shot appearance transfer. ArXiv abs/2311.03335 (2023), https://api-semanticscholar.org/CorpusID:265043677", + "3. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization. ACM Transactions on Graphics (TOG) 42(6), 1-10 (2023)", + "4. Arar, M., Voynov, A., Hertz, A., Avrahami, O., Fruchter, S., Pritch, Y., Cohen-Or, D., Shamir, A.: Palp: Prompt aligned personalization of text-to-image models. ArXiv abs/2401.06105 (2024), https://apisemantic scholar.org/CorpusID: 266933184", + "5. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-ascene: Extracting multiple concepts from a single image. In: SIGGRAPH Asia 2023 Conference Papers. SA '23, Association for Computing Machinery, New York, NY, USA (2023). https://doi.org/10.1145/3610548.3618154, https://doi.org/10.1145/3610548.3618154", + "6. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Transactions on Graphics (TOG) 42, 1-11 (2022), https://api_semanticscholar.org/CorpusID:249394540", + "7. Avrahami, O., Hertz, A., Vinker, Y., Arar, M., Fruchter, S., Fried, O., Cohen-Or, D., Lischinski, D.: The chosen one: Consistent characters in text-to-image diffusion models. arXiv preprint arXiv:2311.10093 (2023)", + "8. Caron, M., Touvron, H., Misra, I., J'egou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. 2021 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 9630-9640 (2021), https://apisemantic scholar.org/CorpusID:233444273", + "9. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M., Murphy, K.P., Freeman, W.T., Rubinstein, M., Li, Y., Krishnan, D.: Muse: Text-to-image generation via masked generative transformers. ArXiv abs/2301.00704 (2023), https://api-semanticscholar.org/CorpusID:255372955", + "0. Chen, M., Laina, I., Vedaldi, A.: Training-free layout control with cross-attention guidance. ArXiv abs/2304.03373 (2023), https://api(semanticscholar.org/ CorpusID:258041377" + ], + "bbox": [ + 225, + 333, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "11. Couairon, G., Verbeek, J., Schwenk, H., Cord, M.: Diffedit: Diffusion-based semantic image editing with mask guidance. ArXiv abs/2210.11427 (2022), https://api-semanticscholar.org/CorpusID:253018768", + "12. Efros, A.A., Freeman, W.T.: Image quilting for texture synthesis and transfer. Proceedings of the 28th annual conference on Computer graphics and interactive techniques (2001), https://api_semanticscholar.org/CorpusID:9334387", + "13. Epstein, D., Jabri, A., Poole, B., Efros, A.A., Holynski, A.: Diffusion self-guidance for controllable image generation. ArXiv abs/2306.00986 (2023), https://api.sementicscholar.org/CorpusID:258999106", + "14. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022)", + "15. Gandikota, R., Materzynska, J., Zhou, T., Torralba, A., Bau, D.: Concept sliders: Lora adaptors for precise control in diffusion models. ArXiv abs/2311.12092 (2023), https://api-semanticscholar.org/CorpusID:265308675", + "16. Gatys, L.A., Ecker, A.S., Bethge, M.: Image style transfer using convolutional neural networks. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 2414-2423 (2016), https://api-semanticscholar.org/CorpusID:206593710", + "17. Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A.C., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63, 139 - 144 (2014), https://apisemanticscholar.org/CorpusID: 1033682", + "18. Gu, Y., Wang, X., Wu, J.Z., Shi, Y., Chen, Y., Fan, Z., Xiao, W., Zhao, R., Chang, S., Wu, W., Ge, Y., Shan, Y., Shou, M.Z.: Mix-of-show: Decentralized low-rank adaptation for multi-concept customization of diffusion models. ArXiv abs/2305.18292 (2023), https://api-semanticscholar.org/CorpusID: 258960192", + "19. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D.N., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 7289-7300 (2023), https://apisemantic scholar.org/CorpusID:257631648", + "20. Hertz, A., Mokady, R., Tenenbaum, J.M., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. ArXiv abs/2208.01626 (2022), https://apisemantic scholar.org/CorpusID: 251252882", + "21. Hertz, A., Voynov, A., Fruchter, S., Cohen-Or, D.: Style aligned image generation via shared attention. arXiv preprint arXiv:2312.02133 (2023)", + "22. Hertzmann, A., Jacobs, C.E., Oliver, N., Curless, B., Salesin, D.H.: Image analogies p. 327-340 (2001). https://doi.org/10.1145/383259.383295, https://doi.org/10.1145/383259.383295", + "23. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., de Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. ArXiv abs/1902.00751 (2019), https://api_semanticscholar.org/CorpusID: 59599816", + "24. Hu, J.E., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Chen, W.: Lora: Low-rank adaptation of large language models. ArXiv abs/2106.09685 (2021), https://api-semanticscholar.org/CorpusID:235458009", + "25. Huang, X., Belongie, S.J.: Arbitrary style transfer in real-time with adaptive instance normalization. 2017 IEEE International Conference on Computer Vision" + ], + "bbox": [ + 217, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "(ICCV) pp. 1510-1519 (2017), https://api_semanticscholar.org/CorpusID:6576859", + "26. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below.", + "27. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 5967-5976 (2016), https://api_semanticscholar.org/CorpusID:6200260", + "28. Jing, Y., Yang, Y., Feng, Z., Ye, J., Song, M.: Neural style transfer: A review. IEEE Transactions on Visualization and Computer Graphics 26, 3365-3385 (2017), https://api_semanticscholar.org/CorpusID:4875951", + "29. Johnson, J., Alahi, A., Fei-Fei, L.: Perceptual losses for real-time style transfer and super-resolution. ArXiv abs/1603.08155 (2016), https://apisemantic scholar.org/CorpusID:980236", + "30. Katzir, O., Lischinski, D., Cohen-Or, D.: Cross-domain cascaded deep translation. In: European Conference on Computer Vision (2020), https://apisemantic scholar.org/CorpusID:209315529", + "31. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1931-1941 (2022), https://api-semanticscholar.org/CorpusID:254408780", + "32. Li, S., van de Weijer, J., Hu, T., Khan, F.S., Hou, Q., Wang, Y., Yang, J.: Stylediffusion: Prompt-embedding inversion for text-based editing. ArXiv abs/2303.15649 (2023), https://api-semanticscholar.org/CorpusID:257771440", + "33. mkshing:Ziplora-pytorch.https://github.com/mkshing/ziplora-pytorch", + "34. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 6038-6047. IEEE (2023). https://doi.org/10.1109/CVPR52729.2023.00585, https://doi.org/10.1109/CVPR52729.2023.00585", + "35. Park, T., Efros, A.A., Zhang, R., Zhu, J.Y.: Contrastive learning for unpaired image-to-image translation. In: European Conference on Computer Vision (2020), https://api-semanticscholar.org/CorpusID:220871180", + "36. Parmar, G., Singh, K.K., Zhang, R., Li, Y., Lu, J., Zhu, J.Y.: Zero-shot image-to-image translation. ACM SIGGRAPH 2023 Conference Proceedings (2023), https://api-semanticscholar.org/CorpusID:256616002", + "37. Po, R., Yang, G., Aberman, K., Wetzstein, G.: Orthogonal adaptation for modular customization of diffusion models. ArXiv abs/2312.02432 (2023), https://api.sementicscholar.org/CorpusID:265659333", + "38. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Muller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. ArXiv abs/2307.01952 (2023), https://api(semanticscholar.org/ CorpusID:259341735", + "39. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning (2021), https://api_semanticscholar.org/CorpusID: 231591445" + ], + "bbox": [ + 215, + 146, + 784, + 838 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "40. Research, F.: Cog sdxl canny controlnet with lora support. https://replicate.com/batouresearch/sdxl-controlnet-lora", + "41. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10674-10685 (2021), https://api-semanticscholar.org/CorpusID:245335280", + "42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023)", + "43. Ryu, S.: Low-rank adaptation for fast text-to-image diffusion fine-tuning. https://github.com/cloneofsimo/lora", + "44. Shah, V., Ruiz, N., Cole, F., Lu, E., Lazebnik, S., Li, Y., Jampani, V.:Ziplora: Any subject in any style by effectively merging loras. arXiv preprint arXiv:2311.13600 (2023)", + "45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., Hao, Y., Essa, I., Rubinstein, M., Krishnan, D.: Styledrop: Text-to-image generation in any style (2023)", + "46. Tenenbaum, J., Freeman, W.: Separating style and content. In: Mozer, M., Jordan, M., Petsche, T. (eds.) Advances in Neural Information Processing Systems. vol. 9. MIT Press (1996), https://proceedings.neurips.cc/paper_files/paper/1996/file/70222949cc0db89ab32c9969754d4758-Paper.pdf", + "47. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1921-1930 (2022), https://apisemantic scholar.org/CorpusID:253801961", + "48. Vaswani, A., Shazeer, N.M., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Neural Information Processing Systems (2017), https://api-semanticscholar.org/CorpusID:13756489", + "49. Vinker, Y., Voynov, A., Cohen-Or, D., Shamir, A.: Concept decomposition for visual exploration and inspiration. ACM Trans. Graph. 42(6) (dec 2023). https://doi.org/10.1145/3618315, https://doi.org/10.1145/3618315", + "50. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: $p+$ : Extended textual conditioning in text-to-image generation. arXiv preprint arXiv:2303.09522 (2023)", + "51. Wang, H., Spinelli, M., Wang, Q., Bai, X., Qin, Z., Chen, A.: Instantstyle: Free lunch towards style-preserving in text-to-image generation. ArXiv abs/2404.02733 (2024), https://api_semanticscholar.org/CorpusID: 268876474", + "52. Yang, S., joo Hwang, H., Ye, J.C.: Zero-shot contrastive loss for text-guided diffusion image style transfer. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 22816-22825 (2023), https://apisemantic scholar.org/CorpusID:257532402", + "53. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. ArXiv abs/2308.06721 (2023), https://api.sementicscholar.org/CorpusID:260886966", + "54. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 3813-3824 (2023), https://api-semanticscholar.org/CorpusID:256827727" + ], + "bbox": [ + 215, + 147, + 785, + 838 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Frenkel et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "55. xin Zhang, Y., Huang, N., Tang, F., Huang, H., Ma, C., Dong, W., Xu, C.: Inversion-based style transfer with diffusion models. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10146-10156 (2022), https://api-semanticscholar.org/CorpusID:257427673", + "56. Zhang, Y., Dong, W., Tang, F., Huang, N., Huang, H., Ma, C., Lee, T.Y., Deussen, O., Xu, C.: Prospect: Prompt spectrum for attribute-aware personalization of diffusion models. ACM Transactions on Graphics (TOG) 42(6), 1-14 (2023)", + "57. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. 2017 IEEE International Conference on Computer Vision (ICCV) pp. 2242-2251 (2017), https://api_semanticscholar.org/CorpusID:206770979" + ], + "bbox": [ + 215, + 146, + 787, + 300 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Implicit Style-Content Separation using B-LoRA", + "bbox": [ + 405, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_model.json b/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_model.json new file mode 100644 index 0000000000000000000000000000000000000000..2bfd0f44897709b92a02d1f51204027dd255f047 --- /dev/null +++ b/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_model.json @@ -0,0 +1,2427 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.223, + 0.142, + 0.78, + 0.164 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "text", + "bbox": [ + 0.251, + 0.189, + 0.751, + 0.207 + ], + "angle": 0, + "content": "Yarden Frenkel1, Yael Vinker1, Ariel Shamir2, and Daniel Cohen-Or1" + }, + { + "type": "text", + "bbox": [ + 0.428, + 0.217, + 0.576, + 0.231 + ], + "angle": 0, + "content": "1 Tel Aviv University" + }, + { + "type": "text", + "bbox": [ + 0.424, + 0.231, + 0.58, + 0.246 + ], + "angle": 0, + "content": "2 Reichman University" + }, + { + "type": "list", + "bbox": [ + 0.424, + 0.217, + 0.58, + 0.246 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.261, + 0.774, + 0.445 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.454, + 0.788, + 0.496 + ], + "angle": 0, + "content": "Fig. 1: By implicitly decomposing a single image into its style and content representation, captured by B-LoRA, we can perform high quality style-content mixing and even swapping the style and content between two stylized images." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.512, + 0.741, + 0.622 + ], + "angle": 0, + "content": "Abstract. Image stylization involves manipulating the visual appearance and texture (style) of an image while preserving its underlying objects, structures, and concepts (content). The separation of style and content is essential for manipulating the image's style independently from its content, ensuring a harmonious and visually pleasing result. Achieving this separation requires a deep understanding of both the visual and semantic characteristics of images, often necessitating the training of specialized models or employing heavy optimization." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.622, + 0.741, + 0.663 + ], + "angle": 0, + "content": "In this paper, we introduce B-LoRA, a method that leverages LoRA (Low-Rank Adaptation) to implicitly separate the style and content components of a single image, facilitating various image stylization tasks." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.663, + 0.741, + 0.759 + ], + "angle": 0, + "content": "By analyzing the architecture of SDXL combined with LoRA, we find that jointly learning the LoRA weights of two specific blocks (referred to as B-LoRAs) achieves style-content separation that cannot be achieved by training each B-LoRA independently. Consolidating the training into only two blocks and separating style and content allows for significantly improving style manipulation and overcoming overfitting issues often associated with model fine-tuning." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.76, + 0.741, + 0.815 + ], + "angle": 0, + "content": "Once trained, the two B-LoRAs can be used as independent components to allow various image stylization tasks, including image style transfer, text-based image stylization, consistent style generation, and style-content mixing." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "image_caption", + "bbox": [ + 0.225, + 0.15, + 0.312, + 0.161 + ], + "angle": 0, + "content": "Input content" + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.161, + 0.326, + 0.242 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.342, + 0.162, + 0.446, + 0.242 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.451, + 0.162, + 0.555, + 0.243 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.162, + 0.666, + 0.244 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.671, + 0.162, + 0.776, + 0.244 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.258, + 0.788, + 0.329 + ], + "angle": 0, + "content": "Fig. 2: Examples of image stylization generated with our approach. The content image is shown on the left. We show here three results of image style transfer based on a reference style, one (on the right) based on a guiding text prompt. Note that our method requires only a single image, and preserves the image's content and structure well while applying the desired style." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.356, + 0.377, + 0.373 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.387, + 0.789, + 0.538 + ], + "angle": 0, + "content": "Image stylization is a well-established task in computer vision, and has been actively researched for many years [16,22]. This task involves changing the style of an image following some style reference, which can be text-based or image-based while preserving its content. Content refers to the semantic information and structure of the image, while style often refers to visual features and patterns such as colors and textures [46]. Image style manipulation is a highly challenging task, since style and content are strongly connected, leading to an inherent trade-off between style transformation and content preservation. On the other hand, many style manipulation tasks require a clear separation between style and content within an image." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.539, + 0.789, + 0.584 + ], + "angle": 0, + "content": "In this paper, we present B-LoRA, a method for style-content separation of any given image. Our method distills the style and content from a single image to support various style manipulation applications." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.585, + 0.789, + 0.749 + ], + "angle": 0, + "content": "In the realm of recent advancements in large language-vision models, existing approaches utilize the strong visual-semantic priors embedded within these models to facilitate style manipulation tasks. Common techniques involve fine-tuning a pre-trained text-to-image model to account for a new style or content [4, 19, 24, 42]. However, fine-tuned models often suffer from the inherent trade-off between style transformation and content preservation as they are prone to over-fitting. Unlike these methods, we unify the learning of style and content components by separating them per image (see Figure 1). This separation is performed by fitting a light-weight adapter (B-LoRA) that is less prone to over-fitting issues, and enables task flexibility, allowing for both text-based and reference style image conditions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Our method utilizes LoRA (Low Rank Adaptation) [24], which has emerged as a popular approach due to its high-quality results and efficiency. LoRA incorporates optimizing external low-rank weight matrices for the attention layers of the base model, while the pretrained model weights remain \"frozen\". After training, these matrices define the adapted model that can be used for the desired task. LoRA is often utilized for image stylization by fine-tuning the base model" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "with respect to a set of images that can either represent the desired style or the desired content." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.177, + 0.787, + 0.298 + ], + "angle": 0, + "content": "Specifically, we use LoRA with Stable Diffusion XL (SDXL) [38], a recently introduced text-to-image diffusion model renowned for its powerful style learning capabilities. Through detailed analysis of various layers within SDXL and their effect on the adaptation procedure, we made a surprising discovery: two specific transformer blocks can be used to separate the style and content of an input image, and to easily control them distinctly in generated images. For clarification, in this paper, we define a transformer block as a sequence of 10 consecutive attention layers." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.788, + 0.51 + ], + "angle": 0, + "content": "Therefore, when provided with a single input image, we jointly optimize the LoRA weights corresponding to these two distinct transformer blocks with the objective of reconstructing the given image based on a provided text prompt. Since we only optimize the LoRA weights of these two transformer blocks, we refer to them as \"B-LoRAs\". The crucial aspect is that these B-LoRAs are trained on a single image only, yet they successfully disentangle its style and content, thereby circumventing the prevalent overfitting problem associated with common LoRA techniques that can struggle to change the style and/or content of an input image. Our technique benefits from the innate style-content disentanglement within the layers of the architecture. Another advantage of our method is that the B-LoRAs can be easily used as separate components, allowing various challenging style manipulation tasks without requiring any additional training or fine-tuning. In particular, we demonstrate style transfer, text-guided style manipulation and consistent style-conditioned image generation (see Figure 2)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.51, + 0.788, + 0.616 + ], + "angle": 0, + "content": "We note that recent attempts have been made to combine trained LoRAs of style and content to a unified model [44]. This approach requires a new optimization process for each style-content combination. This is both time-consuming and raises challenges in achieving an effective trade-off between style transformation and content preservation. In contrast, our trained B-LoRAs can be easily replugged into a pre-trained model combined with other learned blocks from other reference images, without any further training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.616, + 0.787, + 0.677 + ], + "angle": 0, + "content": "We provide extensive evaluation of our method showing its advantages compared to alternative approaches that are often designed to achieve one of these tasks. Our method provides a practical and simple way for image stylization that can be broadly used with existing models." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.701, + 0.388, + 0.718 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Style Transfer Image style transfer is a longstanding challenge in computer vision [12,22], aimed at altering the style of an image based on a given reference. With the progress of deep learning research, Neural Style Transfer (NST) approaches rely on deep features extracted from pre-trained networks to merge content and style [16,28,29]. Subsequent GAN-based [17] techniques were proposed to transfer images across domains, using either paired [27] or unpaired [30,35,57] image sets, yet they require domain-specific datasets and training." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.358 + ], + "angle": 0, + "content": "Recent advancements in language-vision models and diffusion models have revolutionized the field of image stylization. Leveraging the vast knowledge encoded in pre-trained language-vision models, modern approaches explore zero-shot image stylization and editing [6, 10, 11, 13, 32, 34, 36, 52], where images are manipulated without additional fine-tuning or data adaptation by intervening in the generation process. Prompt-to-Prompt [20] proposes an approach to edit generated images by manipulating their cross-attention maps. In Plug-and-Play [47] the appearance of a content image is manipulated with respect to a given text prompt by adjusting spatial features from the guidance image via the self-attention mechanism. Cross Image Attention (CIA) [2] presents a method to modify the image appearance based on a reference image through alterations in cross-attention mechanisms. While these approaches effectively transform the appearance of the content image, they may encounter challenges in transferring appearance between subjects with differing semantics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.361, + 0.79, + 0.511 + ], + "angle": 0, + "content": "StyleAligned [21] utilizes attention features sharing combined with the AdaIN mechanism [25] to achieve style alignment between a sequence of generated images. However, the method is not explicitly designed to control the content of the generated image, potentially resulting in style image structure leakage. Similarly, the lack of style-content separation is also evident in encoder-based methods, such as IP-Adapter [53]. InstantStyle [51] is a concurrent work to ours, aiming to improve IP-Adapter for image stylization tasks by injecting the CLIP embedding of the style image into specific blocks within SDXL. In our work, we decompose the style and the content and learn a separate representation for each." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.79, + 0.844 + ], + "angle": 0, + "content": "Text-to-Image Personalization In another line of work [3, 4, 14, 19, 42, 50], optimization techniques are proposed to extend pre-trained Text-to-Image models to support the generation of novel visual concepts, including both style and content, based on a small set of input images with the same concept. This allows utilizing the rich semantic-visual prior of pre-trained models for customized tasks such as producing images of a desired style. Existing methods employ either token optimization techniques [1, 14, 49, 50, 55, 56], fine-tuning the model's weights [42], or a combination of both [3-5,7]. Token optimization requires longer training times and often results in sub-optimal reconstruction. While model finetuning provides better reconstruction, it consumes substantial memory and tends to overfit. To address the memory inefficiency, and to facilitate more efficient model fine-tuning, Parameter Efficient Fine-Tuning (PEFT) approaches have been proposed [23, 24, 31]. StyleDrop [45] utilizes Muse [9] as a base model, and adjusts its styles to align with a reference image. StyleDrop trains a lightweight adapter layer at the end of each attention block within the transformer model. However, similar to StyleAligned [21], their approach is designed for style adaptation, but for content preservation, another optimization is required. Among existing PEFT methods, Low-Rank Adaptation (LoRA) [24] is a popular finetuning technique, widely used by researchers and practitioners for its versatility and high-quality results." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.328 + ], + "angle": 0, + "content": "LoRA for Image Stylization LoRA is often used for image stylization by fine-tuning a model to produce images of a desired style. Commonly, a LoRA is trained on a set of images, and then it is combined with control methods such as stylistic Concept-Slanders [15] or ControlNet [40, 54], along with a text prompt to condition the generated image content. While LoRA-based approaches have demonstrated significant abilities in capturing style and content, two separate LoRA models are required for this task, and there is no trivial way to combine them. A common naïve approach is to combine two LoRAs by directly interpolating their weights [43], relying on a manual search for the desired coefficients. Alternative approaches [18, 37] propose an optimization-based strategy to find the optimal coefficients for such a combination. However, they focus on combining two objects and not on image stylization tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.33, + 0.788, + 0.48 + ], + "angle": 0, + "content": "Recently, Shah et al. introduced ZipLoRA [44], proposing to merge two individual LoRAs trained for style and content into a new 'zipped' LoRA by learning mixing coefficients for their columns. This work is closely related to ours, as we also mix LoRA weights trained on different images to facilitate image stylization. However, ZipLoRA requires an additional optimization stage for each new combination of content and style, thereby restricting the flexibility of reusing trained LoRA weights, which is LoRA's primary advantage. In contrast, our approach allows for the direct reuse of learned styles and contents without additional training, enhancing efficiency and versatility. Moreover, we demonstrate that our implicit approach is more robust to challenging styles and contents." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.504, + 0.383, + 0.521 + ], + "angle": 0, + "content": "3 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.788, + 0.734 + ], + "angle": 0, + "content": "SDXL Architecture In our work, we utilize the recently introduced publicly available text-to-image Stable Diffusion XL (SDXL) [38], which is an upgraded version of the known Stable Diffusion [41]. Both models are types of latent diffusion models (LDM), where the diffusion process is applied in the latent space of a pre-trained image autoencoder. The SDXL architecture leverages a three times larger UNet backbone compared to Stable Diffusion. The UNet consists of a total number of 70 attention layers. Each layer consists of a cross and self-attention. These attention layers are often referred to as attention blocks. In this paper, for clarity, we refer to them as layers so they are not confused with the larger transformer blocks we optimize. These attention layers are divided into 11 transformer blocks where the first two and last three blocks are comprised of four and six attention layers, respectively. The six inner blocks consist of 10 attention layers each, as illustrated in Figure 3)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.81 + ], + "angle": 0, + "content": "Text condition generation is also extended in SDXL in the following way: given a text prompt \\( y \\), it is encoded twice, with both OpenCLIP ViT-bigG [26] and CLIP ViT-L [39]. The resulting embeddings are then concatenated to define the conditioning encoding \\( c \\). Then this text embedding is fed into the cross-attention layers of the network, following the attention mechanism [48]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Specifically, in each layer, the deep spatial features \\( x \\) are projected to a query matrix \\( Q = l_{Q}(x) \\), and the textual embedding is projected to a key matrix" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "\\(K = l_{K}(c)\\) and a value matrix \\(V = l_{V}(c)\\) via learned linear projections \\(l_{Q}, l_{K}, l_{V}\\). The attention maps are then defined by:" + }, + { + "type": "equation", + "bbox": [ + 0.414, + 0.187, + 0.786, + 0.222 + ], + "angle": 0, + "content": "\\[\nA _ {t} = \\operatorname {S o f t m a x} \\left(\\frac {Q K ^ {T}}{\\sqrt {d}}\\right) V, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.229, + 0.72, + 0.245 + ], + "angle": 0, + "content": "where \\(d\\) is the latent projection dimension of the keys and queries." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.258, + 0.784, + 0.318 + ], + "angle": 0, + "content": "LoRA Low-Rank Adaptation [24] is a method for efficiently fine-tuning large pre-trained models for specific tasks or domains. LoRA has emerged as a very popular approach for fine-tuning pre-trained text-to-image diffusion models [43] due to its high-quality results and efficiency." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.319, + 0.785, + 0.424 + ], + "angle": 0, + "content": "Let us denote the weights of a pre-trained text-to-image diffusion model with \\( W_0 \\), and the learned residuals after fine-tuning the model for a specific task with \\( \\Delta W \\). The key idea in LoRA is that \\( \\Delta W \\in \\mathbb{R}^{m \\times n} \\) can be decomposed into two low intrinsic rank matrices \\( B \\in \\mathbb{R}^{m \\times r} \\) and \\( A \\in \\mathbb{R}^{r \\times n} \\), such that \\( \\Delta W = BA \\), and the rank \\( r << \\min(m, n) \\). During training, the original model weights \\( W_0 \\) remain frozen, and only \\( A \\) and \\( B \\) are updated. Thus, by the end of the training, we can obtain the tuned model weights by using \\( W = W_0 + \\Delta W \\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.425, + 0.787, + 0.5 + ], + "angle": 0, + "content": "LoRA is commonly used in text-to-image diffusion models only in the cross and self-attention layers. As discussed, the attention mechanism in each layer relies on four projection matrices: \\( l_{Q} \\), \\( l_{K} \\), \\( l_{V} \\), and \\( l_{\\mathrm{out}} \\). The LoRA weights \\( \\Delta W_{Q} \\), \\( \\Delta W_{K} \\), \\( \\Delta W_{V} \\), and \\( \\Delta W_{\\mathrm{out}} \\) are optimized for each of these pre-trained matrices. We denote by \\( \\Delta W \\) the LoRA weights of all four matrices." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.522, + 0.331, + 0.538 + ], + "angle": 0, + "content": "4 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.788, + 0.706 + ], + "angle": 0, + "content": "Our objective is to decouple the style and content aspects of an input image \\(I\\) into separate components, enabling both text-based and image-based stylization applications. Our approach harnesses the capabilities of a pre-trained SDXL text-to-image generation model [38], known for its robustness in capturing stylistic features [44]. We conduct an analysis of the SDXL architecture to gain insight into the contributions of individual layers to either the style or the content of the generated image. Guided by our observations, we employ LoRA [24] to train update matrices of only two specific transformer blocks within the SDXL model. These matrices capture the representation of the content and the style of the input image and they suffice to facilitate a number of image stylization tasks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.725, + 0.5, + 0.741 + ], + "angle": 0, + "content": "4.1 SDXL Architecture Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Similar to previous works [1, 50] we examine the effect of different layers within the base text-to-image model on the generated image. We adopt a similar approach to the one proposed in Voynov et al. [50]. The key idea is to inject a different text prompt into the cross-attention layers of one of the transformer blocks within SDXL. Then examine the similarity between the different prompts and the resulting image. If we only change the input prompt corresponding to" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.237 + ], + "angle": 0, + "content": "the i'th block, and the i'th block dominates a certain quality of the generated image, this will be apparent in the resulting image. Specifically, we examine six intermediate transformer blocks \\(\\{W_0^1,\\dots W_0^6\\}\\) of SDXL, each containing 10 attention layers (see Figure 3). These layers have been selected based on previous works [1,50], which demonstrate that they are most likely to affect the important visual properties of the generated images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.238, + 0.487, + 0.509 + ], + "angle": 0, + "content": "We define two random sets of text prompts \\( P_{content} \\) and \\( P_{style} \\) describing different objects with different colors. The prompts in \\( P_{content} \\) are defined by placing random objects in the template text \"A photo of a \". For \\( P_{style} \\) we use the template \"A photo of a \". The random objects and colors are generated with ChatGPT. Note that color is used as a proxy for style since we use CLIP [39] to evaluate results (as will be described next), and we found CLIP to be a better indicator for changes in color than changes in style. We sample a pair of prompts \\( (p, \\hat{p}) \\in P_{content} \\) and \\( (p, \\hat{p}) \\in P_{style} \\) such that \\( p \\neq \\hat{p} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.511, + 0.487, + 0.631 + ], + "angle": 0, + "content": "For each pair \\((\\hat{p}, p)\\), we generate an image \\(I_{\\hat{p} \\to i, p \\to j \\neq i}\\) by injecting the embedding of \\(\\hat{p}\\) to \\(W_0^i\\) while injecting the embedding of \\(p\\) to all other layers \\(W_0^j, j \\neq i\\) (illustrated in Figure 3). This is performed for each of the six transformer blocks we target, resulting in six images per pair." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.631, + 0.787, + 0.661 + ], + "angle": 0, + "content": "Next, to measure the effect of injecting \\(\\hat{p}\\) into the i'th block on the generated image, we estimate the following similarity score:" + }, + { + "type": "equation", + "bbox": [ + 0.311, + 0.674, + 0.786, + 0.693 + ], + "angle": 0, + "content": "\\[\n\\mathcal {C} (I _ {\\hat {p} \\rightarrow i, p \\rightarrow j}, \\hat {p}) = s i m (C L I P _ {I} (I _ {\\hat {p} \\rightarrow i, p \\rightarrow j}), C L I P _ {T} (\\hat {p})), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.702, + 0.787, + 0.751 + ], + "angle": 0, + "content": "where \\(CLIP_{I}(I_{\\hat{p}\\rightarrow i,p\\rightarrow j})\\) and \\(CLIP_{T}(\\hat{p})\\) are the CLIP image embedding of the generated image, and the CLIP text embedding of the prompt, respectively. \\(sim(x,y) = \\frac{x\\cdot y}{||x||\\cdot||y||}\\) indicates the cosine similarity between the clip embeddings." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.751, + 0.788, + 0.843 + ], + "angle": 0, + "content": "In total, we examined 400 pairs of content and style prompts and averaged the scores of each layer. The three topmost layers that show similarity to one type of prompt are \\( W_0^2 \\) and \\( W_0^4 \\) which dominate the content of the generated image, and \\( W_0^5 \\) which dominates its color. We visually demonstrate these conclusions in Figure 4. On the left, we show the effect of blocks 2 and 4 on the generated content. Note that \\( I_{\\hat{p} \\to 2,p \\to j} \\) and \\( I_{\\hat{p} \\to 4,p \\to j} \\) demonstrate that when \"A photo of" + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.271, + 0.789, + 0.485 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.497, + 0.788, + 0.58 + ], + "angle": 0, + "content": "Fig.3: Illustration of SDXL architecture and our text-based analysis. To examine the effect of the i'th transformer block on the generated image, we inject a different text prompt \\(\\hat{p}\\) to it, while \\(p\\) is injected into all other blocks." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.209 + ], + "angle": 0, + "content": "a tiger\" is injected to only one block (2 or 4), while \"A photo of a bunny\" is injected to the rest of the blocks, the generated images depict a tiger, while in all other options, the generated image will depict a bunny. Similarly, on the right we show the effect of block 5 on the generated image's color." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.238, + 0.497, + 0.252 + ], + "angle": 0, + "content": "Effect of blocks 2,4 on the generated content" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.256, + 0.359, + 0.269 + ], + "angle": 0, + "content": "\\(p =\\) \"A photo of a bunny\"" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.27, + 0.353, + 0.281 + ], + "angle": 0, + "content": "\\(\\hat{p} =\\) \"A photo of a tiger\"" + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.285, + 0.321, + 0.372 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.325, + 0.285, + 0.422, + 0.372 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.426, + 0.288, + 0.522, + 0.373 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.545, + 0.238, + 0.777, + 0.252 + ], + "angle": 0, + "content": "Effect of block 5 on the generated color" + }, + { + "type": "text", + "bbox": [ + 0.559, + 0.258, + 0.722, + 0.27 + ], + "angle": 0, + "content": "\\(p =\\) \"A photo of a green bunny\"" + }, + { + "type": "text", + "bbox": [ + 0.56, + 0.271, + 0.715, + 0.282 + ], + "angle": 0, + "content": "\\(\\hat{p} =\\) \"A photo of a blue bunny\"" + }, + { + "type": "text", + "bbox": [ + 0.553, + 0.285, + 0.642, + 0.3 + ], + "angle": 0, + "content": "\\(I_{\\widehat{p}\\rightarrow 5,p\\rightarrow j\\neq 5}\\)" + }, + { + "type": "text", + "bbox": [ + 0.676, + 0.288, + 0.728, + 0.299 + ], + "angle": 0, + "content": "All others" + }, + { + "type": "image", + "bbox": [ + 0.553, + 0.3, + 0.649, + 0.372 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.655, + 0.3, + 0.75, + 0.373 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.385, + 0.789, + 0.455 + ], + "angle": 0, + "content": "Fig. 4: Prompt injection effect on the generated image. On the left, we demonstrate how blocks 2 and 4 affect the content in the generated image (turning into a tiger), whereas the rightmost image shows that injecting \\(\\hat{p}\\) to a block \\(i \\neq 2, 4\\) has no effect on the generated image. On the right we show how the fifth block controls the generated image's color." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.51, + 0.58, + 0.526 + ], + "angle": 0, + "content": "4.2 LoRA-Based Separation with B-LoRA" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.788, + 0.598 + ], + "angle": 0, + "content": "While the observations above apply to a generated image, our goal is to examine if the layers we locate could be useful in capturing the content and style of a given input image \\( I \\). To fine-tune the model to generate variations of our given image we utilize the LoRA [24] approach." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.598, + 0.788, + 0.658 + ], + "angle": 0, + "content": "Let us denote the frozen weights of our base pre-trained SDXL model with \\( W_0 \\) and the learned residual matrices for each block with \\( \\Delta W^i \\). We follow the default settings of DreamBooth LoRA [43] to finetune the model to reconstruct the given input image \\( I \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.789, + 0.841 + ], + "angle": 0, + "content": "However, instead of optimizing the LoRA weights of all eleven blocks (as usually done), we conduct two experiments, where in the first experiment we optimize the pair \\(\\{\\Delta W^2, \\Delta W^5\\}\\), and in the second experiment we optimize \\(\\{\\Delta W^4, \\Delta W^5\\}\\) (as we found \\(W_0^2\\) and \\(W_0^4\\) to dominate the content, and \\(W_0^5\\) to dominate the color). In addition, we use a general prompt \"A [v]\" during training to prevent the model from being explicitly guided to capture either the image's style or content. This process and example results are depicted in Figure 5. As can be seen, we find that the best combination to optimize in terms of 1. Achieving a full reconstruction of the input concept, and 2. Capturing the input image's content, are \\(\\Delta W^4, \\Delta W^5\\). Note that using the deeper layers of the UNet \\(\\Delta W^4\\), rather than \\(\\Delta W^2\\) during the LoRA training process, aligns with the goal of preserving finer details in the output image, as demonstrated in [47]. We" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "provide ablation and analysis of the effect of other layers and specific parts within them, as well as the effect of using different text prompts in the supplementary material." + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.216, + 0.788, + 0.349 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.36, + 0.788, + 0.43 + ], + "angle": 0, + "content": "Fig.5: Comparison of training B-LoRAs for the input images shown on the left for \\( W_0^2 \\), \\( W_0^5 \\) (middle) and \\( W_0^4 \\), \\( W_0^5 \\) (right). For each pair of trained LoRA weights, we show the results of applying both together (to reconstruct the input image) and applying the content layer separately (i.e. using only \\( \\Delta W^2 \\) and \\( \\Delta W^4 \\)). The results demonstrate that \\( \\Delta W^4 \\) better captures the fine details of the input object." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.788, + 0.507 + ], + "angle": 0, + "content": "We call such a training scheme \\( B\\text{-LoRA} \\), as it only trains two transformer Blocks instead of the full weights. Hence, apart from the style-content separation abilities such a method also reduces storage requirements by \\( 70\\% \\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.524, + 0.513, + 0.54 + ], + "angle": 0, + "content": "4.3 B-LoRA for Image Stylization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.546, + 0.788, + 0.636 + ], + "angle": 0, + "content": "Combining the insights from the above analyses, we now describe the B-LoRA training approach. Given an input image \\(I\\), we only fine-tune the LoRA weights \\(\\Delta W^4\\), \\(\\Delta W^5\\) with the objective of reconstructing the image, w.r.t a general text prompt \"A [v]\". Besides increasing efficiency, we find that by training only these two layers, we can achieve an implicit style-content decomposition, where \\(\\Delta W^4\\) captures the content and \\(\\Delta W^5\\) captures the style." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.637, + 0.788, + 0.683 + ], + "angle": 0, + "content": "Once we find these update matrices, we can easily use them by updating the corresponding block weights of the pre-trained SDXL model for style manipulation applications as described next and demonstrated in Figure 6." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.693, + 0.788, + 0.785 + ], + "angle": 0, + "content": "Image stylization based on image style reference Given two input images \\( I_{c}, I_{s} \\) depicting the desired content and style respectively, we use the process described above to learn their corresponding B-LoRA weights: \\( \\Delta W_{c}^{4}, \\Delta W_{c}^{5} \\) for \\( I_{c} \\) and \\( \\Delta W_{s}^{4}, \\Delta W_{s}^{5} \\) for \\( I_{s} \\). We then directly use \\( \\Delta W_{c}^{4} \\) and \\( \\Delta W_{s}^{5} \\) to update the transformer blocks \\( W_{0}^{4} \\) and \\( W_{0}^{5} \\) of the pre-trained network. For the inference process, we use the prompt \"A [c] in [s] style\", as illustrated at the top of Figure 6." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Text-based image stylization By omitting \\(\\Delta W_{c}^{5}\\) (capturing the style of \\(I_{c}\\)) and only using \\(\\Delta W_{c}^{4}\\) to update the weights of the pre-trained model, we get a personalized model that is adapted to only the content of \\(I_{c}\\). To manipulate the style of" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.148, + 0.515, + 0.162 + ], + "angle": 0, + "content": "(1) Image stylization based on image style reference" + }, + { + "type": "image", + "bbox": [ + 0.23, + 0.165, + 0.782, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.228, + 0.271, + 0.484, + 0.378 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.518, + 0.273, + 0.756, + 0.377 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.394, + 0.789, + 0.478 + ], + "angle": 0, + "content": "Fig. 6: B-LoRA for Image Stylization. (1) To stylize a given content image \\( I_{c} \\) w.r.t an given style image reference \\( I_{s} \\), we train our B-LoRAs for both images and then combine \\( \\Delta W_{c}^{4} \\) and \\( \\Delta W_{s}^{5} \\) to a single adapted model. (2) For text-based stylization we simply plug only the trained \\( \\Delta W_{c}^{4} \\) to adapt the model and then use the desired text prompt during inference. (3) The learned style weights \\( \\Delta W_{c}^{5} \\) can be also used as is to adjust the backbone model to produce images with the style of \\( I_{c} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.509, + 0.789, + 0.571 + ], + "angle": 0, + "content": "\\(I_{c}\\) with text-based guidance, we simply inject the desired text into the adapted layers during inference (see Figure 6 bottom-left). Note that because the style and content are separated and encoded in different blocks, our approach allows challenging style manipulations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.589, + 0.789, + 0.664 + ], + "angle": 0, + "content": "Consistent style generation. Lastly, in a similar manner, one can adapt the model for a specific style provided in \\( I_{s} \\) by excluding \\( \\Delta W_{s}^{4} \\) and using only \\( \\Delta W_{s}^{5} \\). This results in a model adapted to the desired style, and one can use text-based conditions to generate any content with the desired style (see Figure 6 bottom-right)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.691, + 0.454, + 0.706 + ], + "angle": 0, + "content": "4.4 Implementation details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.789, + 0.841 + ], + "angle": 0, + "content": "We train the B-LoRA weights on SDXL v1.0 [38] while keeping both the model weights and text encoders frozen during the fine-tuning process. All LoRA training was performed on a single image. We utilize the Adam optimizer with a learning rate of \\(5e - 5\\). For data augmentations, we only use center cropping during training. We set the LoRA weights rank to \\(r = 64\\) and use the prompt \"A [v]\" for 1000 optimization steps, requiring approximately 10 minutes per image on a single A100 GPU. Note that while other methods typically train LoRA for 400 steps to mitigate overfitting concerns, this was not an issue in our case." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.324, + 0.16 + ], + "angle": 0, + "content": "5 Results" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.177, + 0.785, + 0.236 + ], + "angle": 0, + "content": "To produce the various results of our approach we optimized our B-LoRAs \\((\\Delta W^4, \\Delta W^5)\\) once for each image and then plugged either one of them or both of them (depending on the application) at inference time to receive image stylization without any further optimization or fine-tuning." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.238, + 0.786, + 0.463 + ], + "angle": 0, + "content": "We present some qualitative results of the three applications discussed in Section 4.3 in Figure 7. In the first two rows of Figure 7, our method manages to transfer the style of the image references (top row) while preserving the content of the input image on the left. Notable, this can be done for challenging content inputs such as stylized images (first row) and images of whole scenes (second row). Our method is robust to many types of different styles and manages to preserve the essence of the content reference even in very abstract styles such as the one depicted in the third style column. In the third row, we show examples of text-based image stylization. As can be seen with our implicit style-content separation, the content of the input object is preserved well while the style is governed by the desired text prompt. In the last row, we demonstrate how our method can be used for consistent style generation where only the B-LoRA weights of the style are used. Observe that the object's style is well preserved across all text-based generated images. Please refer to the supplementary material for many more examples." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.478, + 0.786, + 0.644 + ], + "angle": 0, + "content": "Comparisons We next compare our method with alternative approaches, both qualitatively and quantitatively. Note that since we rely on SDXL as our backbone model, for a fair comparison we applied alternative approaches on SDXL as well. As a naïve baseline we employ DB-LoRA [43] (fine-tuned for style) with a ControlNet [54] for content conditioning. We additionally compare to three recent approaches for image stylization that rely on the prior of large pre-trained text-to-image models, namely, ZipLoRA [44], StyleDrop [45], and StyleAligned [21]. StyleAligned is applied using the author's official implementation. With the lack of official implementations for StyleDrop and ZipLoRA, we implemented StyleDrop on SDXL (as described in [21]), and utilized a non-official implementation of ZipLoRA [33]." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.645, + 0.786, + 0.749 + ], + "angle": 0, + "content": "Note that for content preservation, all three alternative methods require multiple content images, while our method can be applied to a single image. Thus, for a fair comparison, we collected a total set of 23 objects from existing personalization works [14, 31, 42, 49], where a small set of images is provided for each object. We collected 20 style image references from [21, 45], along with 5 additional style images of our own. From these sets, we randomly sampled 50 pairs of style and content images to compose our final evaluation set." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.75, + 0.786, + 0.84 + ], + "angle": 0, + "content": "In terms of runtime, StyleAligned is zero-shot only for consistent style generation, while for content preservation it relies on LoRA to adapt the model to the desired concepts. Similarly, StyleDrop and ZipLoRA require LoRA training for content and style. Thus, our runtime is comparable to theirs. However, ZipLoRA entails an extra training phase to merge the two LoRAs, making it more time-consuming than our approach." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.144, + 0.777, + 0.553 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.566, + 0.788, + 0.663 + ], + "angle": 0, + "content": "Fig. 7: Results produced by our method for three image stylization tasks. Rows 1-3: image style transfer. Our method can operate on scene images and extract content from a stylized image. Fourth row: text-based image stylization applied to the content image reference on the left. Note how the pose and identity are preserved well. Last row: consistent style generation, where that style is extracted from the image on the left and used to generate new objects. In this row, we use \\(\\alpha = 1.1\\) to enhance the style effect." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Qualitative Evaluation We show representative comparison results in Figure 8, where on the left we show the style and content reference images. On the first four rows, we show the results of alternative approaches when applied with multiple content images, whereas our method uses a single image. As can be seen, our method effectively preserves the subject from the content image while transferring the desired style. In contrast, other methods either overfit the content subject, thereby failing to alter its style (e.g., cat and sloth in ZipLoRA and StyleDrop), or they suffer from style image \"leakage\". For instance, in the cat example of StyleAligned (first row), the model generates two cats, matching" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.407, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.142, + 0.792, + 0.476 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.486, + 0.788, + 0.613 + ], + "angle": 0, + "content": "Fig. 8: Comparison with alternative approaches. The input style and content references are shown on the left, where multiple content images were used for alternative methods. In the last row, we applied other approaches to a single content image. ZipLoRA tends to overfit the content, and thus struggles with depicting the desired style. StyleDrop also struggles to preserve the content when trained on multiple images. In the case of a single content image (last row), both methods preserve the content but lose the style. StyleAligned preserves the style well; however, it tends to include semantic content originating in the style image, such as creating a couple in row 1. Additional comparisons to InstantStyle [51] are provided in the supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.642, + 0.788, + 0.689 + ], + "angle": 0, + "content": "the number of people in the style reference image. We also include an example of alternative methods applied to a single content image, where StyleDrop and ZipLoRA exhibit increased overfitting." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Quantitative Evaluation We measure content and style preservation by computing the cosine similarity between the embeddings of the input content and style references and the output image, utilizing the DINO ViT-B/8 embeddings [8]. The average scores are presented in Table 1. Our method achieves the highest style alignment score, indicating its superior ability to adapt styles effectively. However, we observe lower object similarity scores, possibly due to content overfitting issues observed in alternative approaches. To further support this observation, we conducted the same experiment using a single content image as a reference (scores shown in the \"single\" row). The results indicate a decrease" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.786, + 0.178 + ], + "angle": 0, + "content": "in style consistency scores across all methods, accompanied by an increase in content preservation scores, suggesting overfitting." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.203, + 0.788, + 0.371 + ], + "angle": 0, + "content": "User Study We conducted a user study to further validate the findings presented above. Using 30 random images from our evaluation set, we compared our results with the three alternative approaches. The participants were presented with the reference style and content images along with two combined results, one produced by our method and the other by an alternative method (with the results presented in random order). Participants were asked to choose the result that \"better transfers the style from the style image while preserving the content of the content image\". We collected responses from 34 participants for the survey, which contained a total of 1020 answers. The results demonstrate a strong preference for our method, with \\(94\\%\\) of participants favoring our method over StyleAligned, \\(91\\%\\) over ZipLoRA, and \\(88\\%\\) over StyleDrop." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.4, + 0.788, + 0.444 + ], + "angle": 0, + "content": "Table 1: Quantitative comparison. We measure the average cosine similarity between the DINO features of the output image and the reference style and content. Our method performs best at adapting to the style without overfitting the content image." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.455, + 0.812, + 0.548 + ], + "angle": 0, + "content": "
InputStyleDropStyleAlignedZipLoRADB-LoRAOurs
Style TransferMultiple0.826 ± 0.070.855 ± 0.050.796 ± 0.070.863 ± 0.060.881 ± 0.05
Single0.790 ± 0.060.829 ± 0.050.782 ± 0.05
ContentMultiple0.817 ± 0.060.779 ± 0.050.841 ± 0.050.769 ± 0.050.790 ± 0.05
Single0.874 ± 0.080.792 ± 0.060.933 ± 0.05
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.614, + 0.536, + 0.631 + ], + "angle": 0, + "content": "6 Conclusions and Future work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.657, + 0.786, + 0.748 + ], + "angle": 0, + "content": "We have presented a simple yet effective method to disentangle the style and content of a single input image. The style and content components are encoded separately with two B-LoRAs, providing high flexibility for independent use in various image stylization tasks. In contrast to existing methods that focus on style extraction, we employ a compound style-content learning approach that enables a better separation of style and content, enhancing stylization fidelity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "As for future research, one possible avenue is to further explore separation techniques within LoRA fine-tuning, to achieve more concrete separation into sub-components such as structure, shape, color, texture, etc. This could provide users with more control over the desired output. Another direction for future work is to leverage the robustness of our approach and extend it to combine LoRA weights from multiple distinct objects or combine a few styles." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.181, + 0.788, + 0.273 + ], + "angle": 0, + "content": "We would like to thank Amir Hertz and Yuval Alaluf for their insightful feedback. Additionally, some of the artistic paintings presented in this paper were created by the artist Judith Kondor Mochary. We thank the artist's family for granting us the privilege to use Judith's drawings. This work was supported by the Israel Science Foundation under Grant No. 2492/20, 3441/21 and 1390/19, and Joint NSFC-ISF Research Grant Research Grant no. 3077/23." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.299, + 0.323, + 0.315 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.334, + 0.785, + 0.389 + ], + "angle": 0, + "content": "1. Agarwal, A., Karanam, S., Shukla, T., Srinivasan, B.V.: An image is worth multiple words: Multi-attribute inversion for constrained text-to-image synthesis. ArXiv abs/2311.11919 (2023), https://api-semanticscholar.org/CorpusID: 265295502" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.391, + 0.785, + 0.433 + ], + "angle": 0, + "content": "2. Alaluf, Y., Garibi, D., Patashnik, O., Averbuch-Elor, H., Cohen-Or, D.: Cross-image attention for zero-shot appearance transfer. ArXiv abs/2311.03335 (2023), https://api-semanticscholar.org/CorpusID:265043677" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.434, + 0.785, + 0.475 + ], + "angle": 0, + "content": "3. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization. ACM Transactions on Graphics (TOG) 42(6), 1-10 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.476, + 0.785, + 0.529 + ], + "angle": 0, + "content": "4. Arar, M., Voynov, A., Hertz, A., Avrahami, O., Fruchter, S., Pritch, Y., Cohen-Or, D., Shamir, A.: Palp: Prompt aligned personalization of text-to-image models. ArXiv abs/2401.06105 (2024), https://apisemantic scholar.org/CorpusID: 266933184" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.532, + 0.785, + 0.6 + ], + "angle": 0, + "content": "5. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-ascene: Extracting multiple concepts from a single image. In: SIGGRAPH Asia 2023 Conference Papers. SA '23, Association for Computing Machinery, New York, NY, USA (2023). https://doi.org/10.1145/3610548.3618154, https://doi.org/10.1145/3610548.3618154" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.601, + 0.785, + 0.643 + ], + "angle": 0, + "content": "6. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Transactions on Graphics (TOG) 42, 1-11 (2022), https://api_semanticscholar.org/CorpusID:249394540" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.644, + 0.785, + 0.685 + ], + "angle": 0, + "content": "7. Avrahami, O., Hertz, A., Vinker, Y., Arar, M., Fruchter, S., Fried, O., Cohen-Or, D., Lischinski, D.: The chosen one: Consistent characters in text-to-image diffusion models. arXiv preprint arXiv:2311.10093 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.687, + 0.785, + 0.741 + ], + "angle": 0, + "content": "8. Caron, M., Touvron, H., Misra, I., J'egou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. 2021 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 9630-9640 (2021), https://apisemantic scholar.org/CorpusID:233444273" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.742, + 0.785, + 0.798 + ], + "angle": 0, + "content": "9. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M., Murphy, K.P., Freeman, W.T., Rubinstein, M., Li, Y., Krishnan, D.: Muse: Text-to-image generation via masked generative transformers. ArXiv abs/2301.00704 (2023), https://api-semanticscholar.org/CorpusID:255372955" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "0. Chen, M., Laina, I., Vedaldi, A.: Training-free layout control with cross-attention guidance. ArXiv abs/2304.03373 (2023), https://api(semanticscholar.org/ CorpusID:258041377" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.334, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "11. Couairon, G., Verbeek, J., Schwenk, H., Cord, M.: Diffedit: Diffusion-based semantic image editing with mask guidance. ArXiv abs/2210.11427 (2022), https://api-semanticscholar.org/CorpusID:253018768" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.785, + 0.231 + ], + "angle": 0, + "content": "12. Efros, A.A., Freeman, W.T.: Image quilting for texture synthesis and transfer. Proceedings of the 28th annual conference on Computer graphics and interactive techniques (2001), https://api_semanticscholar.org/CorpusID:9334387" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.232, + 0.785, + 0.272 + ], + "angle": 0, + "content": "13. Epstein, D., Jabri, A., Poole, B., Efros, A.A., Holynski, A.: Diffusion self-guidance for controllable image generation. ArXiv abs/2306.00986 (2023), https://api.sementicscholar.org/CorpusID:258999106" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.273, + 0.785, + 0.314 + ], + "angle": 0, + "content": "14. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.315, + 0.785, + 0.355 + ], + "angle": 0, + "content": "15. Gandikota, R., Materzynska, J., Zhou, T., Torralba, A., Bau, D.: Concept sliders: Lora adaptors for precise control in diffusion models. ArXiv abs/2311.12092 (2023), https://api-semanticscholar.org/CorpusID:265308675" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.357, + 0.785, + 0.409 + ], + "angle": 0, + "content": "16. Gatys, L.A., Ecker, A.S., Bethge, M.: Image style transfer using convolutional neural networks. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 2414-2423 (2016), https://api-semanticscholar.org/CorpusID:206593710" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.411, + 0.785, + 0.464 + ], + "angle": 0, + "content": "17. Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A.C., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63, 139 - 144 (2014), https://apisemanticscholar.org/CorpusID: 1033682" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.467, + 0.785, + 0.534 + ], + "angle": 0, + "content": "18. Gu, Y., Wang, X., Wu, J.Z., Shi, Y., Chen, Y., Fan, Z., Xiao, W., Zhao, R., Chang, S., Wu, W., Ge, Y., Shan, Y., Shou, M.Z.: Mix-of-show: Decentralized low-rank adaptation for multi-concept customization of diffusion models. ArXiv abs/2305.18292 (2023), https://api-semanticscholar.org/CorpusID: 258960192" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.536, + 0.785, + 0.59 + ], + "angle": 0, + "content": "19. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D.N., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 7289-7300 (2023), https://apisemantic scholar.org/CorpusID:257631648" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.592, + 0.785, + 0.645 + ], + "angle": 0, + "content": "20. Hertz, A., Mokady, R., Tenenbaum, J.M., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. ArXiv abs/2208.01626 (2022), https://apisemantic scholar.org/CorpusID: 251252882" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.647, + 0.785, + 0.673 + ], + "angle": 0, + "content": "21. Hertz, A., Voynov, A., Fruchter, S., Cohen-Or, D.: Style aligned image generation via shared attention. arXiv preprint arXiv:2312.02133 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.675, + 0.785, + 0.714 + ], + "angle": 0, + "content": "22. Hertzmann, A., Jacobs, C.E., Oliver, N., Curless, B., Salesin, D.H.: Image analogies p. 327-340 (2001). https://doi.org/10.1145/383259.383295, https://doi.org/10.1145/383259.383295" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.716, + 0.785, + 0.769 + ], + "angle": 0, + "content": "23. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., de Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. ArXiv abs/1902.00751 (2019), https://api_semanticscholar.org/CorpusID: 59599816" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.771, + 0.785, + 0.812 + ], + "angle": 0, + "content": "24. Hu, J.E., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Chen, W.: Lora: Low-rank adaptation of large language models. ArXiv abs/2106.09685 (2021), https://api-semanticscholar.org/CorpusID:235458009" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "25. Huang, X., Belongie, S.J.: Arbitrary style transfer in real-time with adaptive instance normalization. 2017 IEEE International Conference on Computer Vision" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.245, + 0.147, + 0.784, + 0.174 + ], + "angle": 0, + "content": "(ICCV) pp. 1510-1519 (2017), https://api_semanticscholar.org/CorpusID:6576859" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.785, + 0.231 + ], + "angle": 0, + "content": "26. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.785, + 0.286 + ], + "angle": 0, + "content": "27. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 5967-5976 (2016), https://api_semanticscholar.org/CorpusID:6200260" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.288, + 0.785, + 0.328 + ], + "angle": 0, + "content": "28. Jing, Y., Yang, Y., Feng, Z., Ye, J., Song, M.: Neural style transfer: A review. IEEE Transactions on Visualization and Computer Graphics 26, 3365-3385 (2017), https://api_semanticscholar.org/CorpusID:4875951" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.329, + 0.785, + 0.37 + ], + "angle": 0, + "content": "29. Johnson, J., Alahi, A., Fei-Fei, L.: Perceptual losses for real-time style transfer and super-resolution. ArXiv abs/1603.08155 (2016), https://apisemantic scholar.org/CorpusID:980236" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.411 + ], + "angle": 0, + "content": "30. Katzir, O., Lischinski, D., Cohen-Or, D.: Cross-domain cascaded deep translation. In: European Conference on Computer Vision (2020), https://apisemantic scholar.org/CorpusID:209315529" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.785, + 0.466 + ], + "angle": 0, + "content": "31. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1931-1941 (2022), https://api-semanticscholar.org/CorpusID:254408780" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.508 + ], + "angle": 0, + "content": "32. Li, S., van de Weijer, J., Hu, T., Khan, F.S., Hou, Q., Wang, Y., Yang, J.: Stylediffusion: Prompt-embedding inversion for text-based editing. ArXiv abs/2303.15649 (2023), https://api-semanticscholar.org/CorpusID:257771440" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.72, + 0.522 + ], + "angle": 0, + "content": "33. mkshing:Ziplora-pytorch.https://github.com/mkshing/ziplora-pytorch" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.523, + 0.785, + 0.59 + ], + "angle": 0, + "content": "34. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 6038-6047. IEEE (2023). https://doi.org/10.1109/CVPR52729.2023.00585, https://doi.org/10.1109/CVPR52729.2023.00585" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.591, + 0.785, + 0.633 + ], + "angle": 0, + "content": "35. Park, T., Efros, A.A., Zhang, R., Zhu, J.Y.: Contrastive learning for unpaired image-to-image translation. In: European Conference on Computer Vision (2020), https://api-semanticscholar.org/CorpusID:220871180" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.634, + 0.785, + 0.674 + ], + "angle": 0, + "content": "36. Parmar, G., Singh, K.K., Zhang, R., Li, Y., Lu, J., Zhu, J.Y.: Zero-shot image-to-image translation. ACM SIGGRAPH 2023 Conference Proceedings (2023), https://api-semanticscholar.org/CorpusID:256616002" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.785, + 0.715 + ], + "angle": 0, + "content": "37. Po, R., Yang, G., Aberman, K., Wetzstein, G.: Orthogonal adaptation for modular customization of diffusion models. ArXiv abs/2312.02432 (2023), https://api.sementicscholar.org/CorpusID:265659333" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.785, + 0.77 + ], + "angle": 0, + "content": "38. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Muller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. ArXiv abs/2307.01952 (2023), https://api(semanticscholar.org/ CorpusID:259341735" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.771, + 0.785, + 0.839 + ], + "angle": 0, + "content": "39. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning (2021), https://api_semanticscholar.org/CorpusID: 231591445" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.839 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "Frenkel et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "40. Research, F.: Cog sdxl canny controlnet with lora support. https://replicate.com/batouresearch/sdxl-controlnet-lora" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.178, + 0.787, + 0.232 + ], + "angle": 0, + "content": "41. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10674-10685 (2021), https://api-semanticscholar.org/CorpusID:245335280" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.234, + 0.786, + 0.289 + ], + "angle": 0, + "content": "42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.29, + 0.786, + 0.317 + ], + "angle": 0, + "content": "43. Ryu, S.: Low-rank adaptation for fast text-to-image diffusion fine-tuning. https://github.com/cloneofsimo/lora" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.319, + 0.786, + 0.359 + ], + "angle": 0, + "content": "44. Shah, V., Ruiz, N., Cole, F., Lu, E., Lazebnik, S., Li, Y., Jampani, V.:Ziplora: Any subject in any style by effectively merging loras. arXiv preprint arXiv:2311.13600 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.361, + 0.786, + 0.402 + ], + "angle": 0, + "content": "45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., Hao, Y., Essa, I., Rubinstein, M., Krishnan, D.: Styledrop: Text-to-image generation in any style (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.404, + 0.786, + 0.459 + ], + "angle": 0, + "content": "46. Tenenbaum, J., Freeman, W.: Separating style and content. In: Mozer, M., Jordan, M., Petsche, T. (eds.) Advances in Neural Information Processing Systems. vol. 9. MIT Press (1996), https://proceedings.neurips.cc/paper_files/paper/1996/file/70222949cc0db89ab32c9969754d4758-Paper.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.46, + 0.786, + 0.515 + ], + "angle": 0, + "content": "47. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1921-1930 (2022), https://apisemantic scholar.org/CorpusID:253801961" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.517, + 0.786, + 0.558 + ], + "angle": 0, + "content": "48. Vaswani, A., Shazeer, N.M., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Neural Information Processing Systems (2017), https://api-semanticscholar.org/CorpusID:13756489" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.559, + 0.786, + 0.6 + ], + "angle": 0, + "content": "49. Vinker, Y., Voynov, A., Cohen-Or, D., Shamir, A.: Concept decomposition for visual exploration and inspiration. ACM Trans. Graph. 42(6) (dec 2023). https://doi.org/10.1145/3618315, https://doi.org/10.1145/3618315" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.602, + 0.786, + 0.629 + ], + "angle": 0, + "content": "50. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: \\( p+ \\): Extended textual conditioning in text-to-image generation. arXiv preprint arXiv:2303.09522 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.63, + 0.786, + 0.684 + ], + "angle": 0, + "content": "51. Wang, H., Spinelli, M., Wang, Q., Bai, X., Qin, Z., Chen, A.: Instantstyle: Free lunch towards style-preserving in text-to-image generation. ArXiv abs/2404.02733 (2024), https://api_semanticscholar.org/CorpusID: 268876474" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.686, + 0.786, + 0.741 + ], + "angle": 0, + "content": "52. Yang, S., joo Hwang, H., Ye, J.C.: Zero-shot contrastive loss for text-guided diffusion image style transfer. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 22816-22825 (2023), https://apisemantic scholar.org/CorpusID:257532402" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.743, + 0.786, + 0.784 + ], + "angle": 0, + "content": "53. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. ArXiv abs/2308.06721 (2023), https://api.sementicscholar.org/CorpusID:260886966" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.786, + 0.786, + 0.839 + ], + "angle": 0, + "content": "54. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 3813-3824 (2023), https://api-semanticscholar.org/CorpusID:256827727" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.787, + 0.839 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.406, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Implicit Style-Content Separation using B-LoRA" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.203 + ], + "angle": 0, + "content": "55. xin Zhang, Y., Huang, N., Tang, F., Huang, H., Ma, C., Dong, W., Xu, C.: Inversion-based style transfer with diffusion models. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10146-10156 (2022), https://api-semanticscholar.org/CorpusID:257427673" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.204, + 0.788, + 0.245 + ], + "angle": 0, + "content": "56. Zhang, Y., Dong, W., Tang, F., Huang, N., Huang, H., Ma, C., Lee, T.Y., Deussen, O., Xu, C.: Prospect: Prompt spectrum for attribute-aware personalization of diffusion models. ACM Transactions on Graphics (TOG) 42(6), 1-14 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.788, + 0.301 + ], + "angle": 0, + "content": "57. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. 2017 IEEE International Conference on Computer Vision (ICCV) pp. 2242-2251 (2017), https://api_semanticscholar.org/CorpusID:206770979" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.301 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_origin.pdf b/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f0c34d7766648bb30e24d06ea013265ecd08126f --- /dev/null +++ b/2024/Implicit Style-Content Separation using B-LoRA/16805e6d-f42b-4308-a9c5-2a3aa3e07a7c_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c5bfff5fa8fc14fd1b8d832f16c3869f3f4a1452460aec6a5cebf699e3af19e0 +size 9877712 diff --git a/2024/Implicit Style-Content Separation using B-LoRA/full.md b/2024/Implicit Style-Content Separation using B-LoRA/full.md new file mode 100644 index 0000000000000000000000000000000000000000..67fdd7c441c5c2b15c04c16f22f86cebb5262163 --- /dev/null +++ b/2024/Implicit Style-Content Separation using B-LoRA/full.md @@ -0,0 +1,290 @@ +# Implicit Style-Content Separation using B-LoRA + +Yarden Frenkel1, Yael Vinker1, Ariel Shamir2, and Daniel Cohen-Or1 + +1 Tel Aviv University +2 Reichman University + +![](images/fc29fa0746009eef1e925220a21f3f48d8c9a17f886e141a858f8e51afaa0668.jpg) +Fig. 1: By implicitly decomposing a single image into its style and content representation, captured by B-LoRA, we can perform high quality style-content mixing and even swapping the style and content between two stylized images. + +Abstract. Image stylization involves manipulating the visual appearance and texture (style) of an image while preserving its underlying objects, structures, and concepts (content). The separation of style and content is essential for manipulating the image's style independently from its content, ensuring a harmonious and visually pleasing result. Achieving this separation requires a deep understanding of both the visual and semantic characteristics of images, often necessitating the training of specialized models or employing heavy optimization. + +In this paper, we introduce B-LoRA, a method that leverages LoRA (Low-Rank Adaptation) to implicitly separate the style and content components of a single image, facilitating various image stylization tasks. + +By analyzing the architecture of SDXL combined with LoRA, we find that jointly learning the LoRA weights of two specific blocks (referred to as B-LoRAs) achieves style-content separation that cannot be achieved by training each B-LoRA independently. Consolidating the training into only two blocks and separating style and content allows for significantly improving style manipulation and overcoming overfitting issues often associated with model fine-tuning. + +Once trained, the two B-LoRAs can be used as independent components to allow various image stylization tasks, including image style transfer, text-based image stylization, consistent style generation, and style-content mixing. + +![](images/9fb5e3442e1ebe41569152b8734ceca642663d003cae8ecc7a3de5514039c0bc.jpg) +Input content + +![](images/14987fe572b33f4ac8947ae1c9f3be8acbdfb8c7bf3a497915248795f5071ceb.jpg) + +![](images/910cdfe0ac0f4b318318bcde51a7eef0ea179f8132f190b66efb2a157f0ba857.jpg) + +![](images/a30951db7c3ea39346fdc539b16f3befdc2f40d1e494b4bc49ae4c0f3535fa32.jpg) +Fig. 2: Examples of image stylization generated with our approach. The content image is shown on the left. We show here three results of image style transfer based on a reference style, one (on the right) based on a guiding text prompt. Note that our method requires only a single image, and preserves the image's content and structure well while applying the desired style. + +![](images/8ac753bfd681f536642da941c6b532f3320d921fe631cca407195b30225f8386.jpg) + +# 1 Introduction + +Image stylization is a well-established task in computer vision, and has been actively researched for many years [16,22]. This task involves changing the style of an image following some style reference, which can be text-based or image-based while preserving its content. Content refers to the semantic information and structure of the image, while style often refers to visual features and patterns such as colors and textures [46]. Image style manipulation is a highly challenging task, since style and content are strongly connected, leading to an inherent trade-off between style transformation and content preservation. On the other hand, many style manipulation tasks require a clear separation between style and content within an image. + +In this paper, we present B-LoRA, a method for style-content separation of any given image. Our method distills the style and content from a single image to support various style manipulation applications. + +In the realm of recent advancements in large language-vision models, existing approaches utilize the strong visual-semantic priors embedded within these models to facilitate style manipulation tasks. Common techniques involve fine-tuning a pre-trained text-to-image model to account for a new style or content [4, 19, 24, 42]. However, fine-tuned models often suffer from the inherent trade-off between style transformation and content preservation as they are prone to over-fitting. Unlike these methods, we unify the learning of style and content components by separating them per image (see Figure 1). This separation is performed by fitting a light-weight adapter (B-LoRA) that is less prone to over-fitting issues, and enables task flexibility, allowing for both text-based and reference style image conditions. + +Our method utilizes LoRA (Low Rank Adaptation) [24], which has emerged as a popular approach due to its high-quality results and efficiency. LoRA incorporates optimizing external low-rank weight matrices for the attention layers of the base model, while the pretrained model weights remain "frozen". After training, these matrices define the adapted model that can be used for the desired task. LoRA is often utilized for image stylization by fine-tuning the base model + +with respect to a set of images that can either represent the desired style or the desired content. + +Specifically, we use LoRA with Stable Diffusion XL (SDXL) [38], a recently introduced text-to-image diffusion model renowned for its powerful style learning capabilities. Through detailed analysis of various layers within SDXL and their effect on the adaptation procedure, we made a surprising discovery: two specific transformer blocks can be used to separate the style and content of an input image, and to easily control them distinctly in generated images. For clarification, in this paper, we define a transformer block as a sequence of 10 consecutive attention layers. + +Therefore, when provided with a single input image, we jointly optimize the LoRA weights corresponding to these two distinct transformer blocks with the objective of reconstructing the given image based on a provided text prompt. Since we only optimize the LoRA weights of these two transformer blocks, we refer to them as "B-LoRAs". The crucial aspect is that these B-LoRAs are trained on a single image only, yet they successfully disentangle its style and content, thereby circumventing the prevalent overfitting problem associated with common LoRA techniques that can struggle to change the style and/or content of an input image. Our technique benefits from the innate style-content disentanglement within the layers of the architecture. Another advantage of our method is that the B-LoRAs can be easily used as separate components, allowing various challenging style manipulation tasks without requiring any additional training or fine-tuning. In particular, we demonstrate style transfer, text-guided style manipulation and consistent style-conditioned image generation (see Figure 2). + +We note that recent attempts have been made to combine trained LoRAs of style and content to a unified model [44]. This approach requires a new optimization process for each style-content combination. This is both time-consuming and raises challenges in achieving an effective trade-off between style transformation and content preservation. In contrast, our trained B-LoRAs can be easily replugged into a pre-trained model combined with other learned blocks from other reference images, without any further training. + +We provide extensive evaluation of our method showing its advantages compared to alternative approaches that are often designed to achieve one of these tasks. Our method provides a practical and simple way for image stylization that can be broadly used with existing models. + +# 2 Related Work + +Style Transfer Image style transfer is a longstanding challenge in computer vision [12,22], aimed at altering the style of an image based on a given reference. With the progress of deep learning research, Neural Style Transfer (NST) approaches rely on deep features extracted from pre-trained networks to merge content and style [16,28,29]. Subsequent GAN-based [17] techniques were proposed to transfer images across domains, using either paired [27] or unpaired [30,35,57] image sets, yet they require domain-specific datasets and training. + +Recent advancements in language-vision models and diffusion models have revolutionized the field of image stylization. Leveraging the vast knowledge encoded in pre-trained language-vision models, modern approaches explore zero-shot image stylization and editing [6, 10, 11, 13, 32, 34, 36, 52], where images are manipulated without additional fine-tuning or data adaptation by intervening in the generation process. Prompt-to-Prompt [20] proposes an approach to edit generated images by manipulating their cross-attention maps. In Plug-and-Play [47] the appearance of a content image is manipulated with respect to a given text prompt by adjusting spatial features from the guidance image via the self-attention mechanism. Cross Image Attention (CIA) [2] presents a method to modify the image appearance based on a reference image through alterations in cross-attention mechanisms. While these approaches effectively transform the appearance of the content image, they may encounter challenges in transferring appearance between subjects with differing semantics. + +StyleAligned [21] utilizes attention features sharing combined with the AdaIN mechanism [25] to achieve style alignment between a sequence of generated images. However, the method is not explicitly designed to control the content of the generated image, potentially resulting in style image structure leakage. Similarly, the lack of style-content separation is also evident in encoder-based methods, such as IP-Adapter [53]. InstantStyle [51] is a concurrent work to ours, aiming to improve IP-Adapter for image stylization tasks by injecting the CLIP embedding of the style image into specific blocks within SDXL. In our work, we decompose the style and the content and learn a separate representation for each. + +Text-to-Image Personalization In another line of work [3, 4, 14, 19, 42, 50], optimization techniques are proposed to extend pre-trained Text-to-Image models to support the generation of novel visual concepts, including both style and content, based on a small set of input images with the same concept. This allows utilizing the rich semantic-visual prior of pre-trained models for customized tasks such as producing images of a desired style. Existing methods employ either token optimization techniques [1, 14, 49, 50, 55, 56], fine-tuning the model's weights [42], or a combination of both [3-5,7]. Token optimization requires longer training times and often results in sub-optimal reconstruction. While model finetuning provides better reconstruction, it consumes substantial memory and tends to overfit. To address the memory inefficiency, and to facilitate more efficient model fine-tuning, Parameter Efficient Fine-Tuning (PEFT) approaches have been proposed [23, 24, 31]. StyleDrop [45] utilizes Muse [9] as a base model, and adjusts its styles to align with a reference image. StyleDrop trains a lightweight adapter layer at the end of each attention block within the transformer model. However, similar to StyleAligned [21], their approach is designed for style adaptation, but for content preservation, another optimization is required. Among existing PEFT methods, Low-Rank Adaptation (LoRA) [24] is a popular finetuning technique, widely used by researchers and practitioners for its versatility and high-quality results. + +LoRA for Image Stylization LoRA is often used for image stylization by fine-tuning a model to produce images of a desired style. Commonly, a LoRA is trained on a set of images, and then it is combined with control methods such as stylistic Concept-Slanders [15] or ControlNet [40, 54], along with a text prompt to condition the generated image content. While LoRA-based approaches have demonstrated significant abilities in capturing style and content, two separate LoRA models are required for this task, and there is no trivial way to combine them. A common naïve approach is to combine two LoRAs by directly interpolating their weights [43], relying on a manual search for the desired coefficients. Alternative approaches [18, 37] propose an optimization-based strategy to find the optimal coefficients for such a combination. However, they focus on combining two objects and not on image stylization tasks. + +Recently, Shah et al. introduced ZipLoRA [44], proposing to merge two individual LoRAs trained for style and content into a new 'zipped' LoRA by learning mixing coefficients for their columns. This work is closely related to ours, as we also mix LoRA weights trained on different images to facilitate image stylization. However, ZipLoRA requires an additional optimization stage for each new combination of content and style, thereby restricting the flexibility of reusing trained LoRA weights, which is LoRA's primary advantage. In contrast, our approach allows for the direct reuse of learned styles and contents without additional training, enhancing efficiency and versatility. Moreover, we demonstrate that our implicit approach is more robust to challenging styles and contents. + +# 3 Preliminaries + +SDXL Architecture In our work, we utilize the recently introduced publicly available text-to-image Stable Diffusion XL (SDXL) [38], which is an upgraded version of the known Stable Diffusion [41]. Both models are types of latent diffusion models (LDM), where the diffusion process is applied in the latent space of a pre-trained image autoencoder. The SDXL architecture leverages a three times larger UNet backbone compared to Stable Diffusion. The UNet consists of a total number of 70 attention layers. Each layer consists of a cross and self-attention. These attention layers are often referred to as attention blocks. In this paper, for clarity, we refer to them as layers so they are not confused with the larger transformer blocks we optimize. These attention layers are divided into 11 transformer blocks where the first two and last three blocks are comprised of four and six attention layers, respectively. The six inner blocks consist of 10 attention layers each, as illustrated in Figure 3). + +Text condition generation is also extended in SDXL in the following way: given a text prompt $y$ , it is encoded twice, with both OpenCLIP ViT-bigG [26] and CLIP ViT-L [39]. The resulting embeddings are then concatenated to define the conditioning encoding $c$ . Then this text embedding is fed into the cross-attention layers of the network, following the attention mechanism [48]. + +Specifically, in each layer, the deep spatial features $x$ are projected to a query matrix $Q = l_{Q}(x)$ , and the textual embedding is projected to a key matrix + +$K = l_{K}(c)$ and a value matrix $V = l_{V}(c)$ via learned linear projections $l_{Q}, l_{K}, l_{V}$ . The attention maps are then defined by: + +$$ +A _ {t} = \operatorname {S o f t m a x} \left(\frac {Q K ^ {T}}{\sqrt {d}}\right) V, \tag {1} +$$ + +where $d$ is the latent projection dimension of the keys and queries. + +LoRA Low-Rank Adaptation [24] is a method for efficiently fine-tuning large pre-trained models for specific tasks or domains. LoRA has emerged as a very popular approach for fine-tuning pre-trained text-to-image diffusion models [43] due to its high-quality results and efficiency. + +Let us denote the weights of a pre-trained text-to-image diffusion model with $W_0$ , and the learned residuals after fine-tuning the model for a specific task with $\Delta W$ . The key idea in LoRA is that $\Delta W \in \mathbb{R}^{m \times n}$ can be decomposed into two low intrinsic rank matrices $B \in \mathbb{R}^{m \times r}$ and $A \in \mathbb{R}^{r \times n}$ , such that $\Delta W = BA$ , and the rank $r << \min(m, n)$ . During training, the original model weights $W_0$ remain frozen, and only $A$ and $B$ are updated. Thus, by the end of the training, we can obtain the tuned model weights by using $W = W_0 + \Delta W$ . + +LoRA is commonly used in text-to-image diffusion models only in the cross and self-attention layers. As discussed, the attention mechanism in each layer relies on four projection matrices: $l_{Q}$ , $l_{K}$ , $l_{V}$ , and $l_{\mathrm{out}}$ . The LoRA weights $\Delta W_{Q}$ , $\Delta W_{K}$ , $\Delta W_{V}$ , and $\Delta W_{\mathrm{out}}$ are optimized for each of these pre-trained matrices. We denote by $\Delta W$ the LoRA weights of all four matrices. + +# 4 Method + +Our objective is to decouple the style and content aspects of an input image $I$ into separate components, enabling both text-based and image-based stylization applications. Our approach harnesses the capabilities of a pre-trained SDXL text-to-image generation model [38], known for its robustness in capturing stylistic features [44]. We conduct an analysis of the SDXL architecture to gain insight into the contributions of individual layers to either the style or the content of the generated image. Guided by our observations, we employ LoRA [24] to train update matrices of only two specific transformer blocks within the SDXL model. These matrices capture the representation of the content and the style of the input image and they suffice to facilitate a number of image stylization tasks. + +# 4.1 SDXL Architecture Analysis + +Similar to previous works [1, 50] we examine the effect of different layers within the base text-to-image model on the generated image. We adopt a similar approach to the one proposed in Voynov et al. [50]. The key idea is to inject a different text prompt into the cross-attention layers of one of the transformer blocks within SDXL. Then examine the similarity between the different prompts and the resulting image. If we only change the input prompt corresponding to + +the i'th block, and the i'th block dominates a certain quality of the generated image, this will be apparent in the resulting image. Specifically, we examine six intermediate transformer blocks $\{W_0^1,\dots W_0^6\}$ of SDXL, each containing 10 attention layers (see Figure 3). These layers have been selected based on previous works [1,50], which demonstrate that they are most likely to affect the important visual properties of the generated images. + +We define two random sets of text prompts $P_{content}$ and $P_{style}$ describing different objects with different colors. The prompts in $P_{content}$ are defined by placing random objects in the template text "A photo of a ". For $P_{style}$ we use the template "A photo of a ". The random objects and colors are generated with ChatGPT. Note that color is used as a proxy for style since we use CLIP [39] to evaluate results (as will be described next), and we found CLIP to be a better indicator for changes in color than changes in style. We sample a pair of prompts $(p, \hat{p}) \in P_{content}$ and $(p, \hat{p}) \in P_{style}$ such that $p \neq \hat{p}$ . + +For each pair $(\hat{p}, p)$ , we generate an image $I_{\hat{p} \to i, p \to j \neq i}$ by injecting the embedding of $\hat{p}$ to $W_0^i$ while injecting the embedding of $p$ to all other layers $W_0^j, j \neq i$ (illustrated in Figure 3). This is performed for each of the six transformer blocks we target, resulting in six images per pair. + +Next, to measure the effect of injecting $\hat{p}$ into the i'th block on the generated image, we estimate the following similarity score: + +$$ +\mathcal {C} (I _ {\hat {p} \rightarrow i, p \rightarrow j}, \hat {p}) = s i m (C L I P _ {I} (I _ {\hat {p} \rightarrow i, p \rightarrow j}), C L I P _ {T} (\hat {p})), \tag {2} +$$ + +where $CLIP_{I}(I_{\hat{p}\rightarrow i,p\rightarrow j})$ and $CLIP_{T}(\hat{p})$ are the CLIP image embedding of the generated image, and the CLIP text embedding of the prompt, respectively. $sim(x,y) = \frac{x\cdot y}{||x||\cdot||y||}$ indicates the cosine similarity between the clip embeddings. + +In total, we examined 400 pairs of content and style prompts and averaged the scores of each layer. The three topmost layers that show similarity to one type of prompt are $W_0^2$ and $W_0^4$ which dominate the content of the generated image, and $W_0^5$ which dominates its color. We visually demonstrate these conclusions in Figure 4. On the left, we show the effect of blocks 2 and 4 on the generated content. Note that $I_{\hat{p} \to 2,p \to j}$ and $I_{\hat{p} \to 4,p \to j}$ demonstrate that when "A photo of + +![](images/13efb2f31619e716ed1ed8ae5bebf371cf561c9d705ece0811ec4ecd9c217e14.jpg) +Fig.3: Illustration of SDXL architecture and our text-based analysis. To examine the effect of the i'th transformer block on the generated image, we inject a different text prompt $\hat{p}$ to it, while $p$ is injected into all other blocks. + +a tiger" is injected to only one block (2 or 4), while "A photo of a bunny" is injected to the rest of the blocks, the generated images depict a tiger, while in all other options, the generated image will depict a bunny. Similarly, on the right we show the effect of block 5 on the generated image's color. + +Effect of blocks 2,4 on the generated content + +$p =$ "A photo of a bunny" + +$\hat{p} =$ "A photo of a tiger" + +![](images/176a86f3e5b2fd3b803b6ec98ec01630ab18adecc4953234b11643e771c076d3.jpg) +Fig. 4: Prompt injection effect on the generated image. On the left, we demonstrate how blocks 2 and 4 affect the content in the generated image (turning into a tiger), whereas the rightmost image shows that injecting $\hat{p}$ to a block $i \neq 2, 4$ has no effect on the generated image. On the right we show how the fifth block controls the generated image's color. + +![](images/837c9b06a7b7538d5f732ca47ef8169813a86e07f937d30725616f1f7e4436d0.jpg) + +![](images/3634c8164d2f66de6d9ffdd76093e2ef3823877e0ca0fac881e987c953279e58.jpg) + +Effect of block 5 on the generated color + +$p =$ "A photo of a green bunny" + +$\hat{p} =$ "A photo of a blue bunny" + +$I_{\widehat{p}\rightarrow 5,p\rightarrow j\neq 5}$ + +All others + +![](images/1aa33f665213d679724c8c08fd2ff6512019b8e58b285b75ff5c868e37b86301.jpg) + +![](images/4379c8a81ef9cf8ca12571604ed372ee6fd57085f2ffd980ddc48d79bb4ca0a4.jpg) + +# 4.2 LoRA-Based Separation with B-LoRA + +While the observations above apply to a generated image, our goal is to examine if the layers we locate could be useful in capturing the content and style of a given input image $I$ . To fine-tune the model to generate variations of our given image we utilize the LoRA [24] approach. + +Let us denote the frozen weights of our base pre-trained SDXL model with $W_0$ and the learned residual matrices for each block with $\Delta W^i$ . We follow the default settings of DreamBooth LoRA [43] to finetune the model to reconstruct the given input image $I$ . + +However, instead of optimizing the LoRA weights of all eleven blocks (as usually done), we conduct two experiments, where in the first experiment we optimize the pair $\{\Delta W^2, \Delta W^5\}$ , and in the second experiment we optimize $\{\Delta W^4, \Delta W^5\}$ (as we found $W_0^2$ and $W_0^4$ to dominate the content, and $W_0^5$ to dominate the color). In addition, we use a general prompt "A [v]" during training to prevent the model from being explicitly guided to capture either the image's style or content. This process and example results are depicted in Figure 5. As can be seen, we find that the best combination to optimize in terms of 1. Achieving a full reconstruction of the input concept, and 2. Capturing the input image's content, are $\Delta W^4, \Delta W^5$ . Note that using the deeper layers of the UNet $\Delta W^4$ , rather than $\Delta W^2$ during the LoRA training process, aligns with the goal of preserving finer details in the output image, as demonstrated in [47]. We + +provide ablation and analysis of the effect of other layers and specific parts within them, as well as the effect of using different text prompts in the supplementary material. + +![](images/7ffdb86072d95fa06f4dd58a6e046b40a7051f4ffcc6b156dc75d8832e0cc640.jpg) +Fig.5: Comparison of training B-LoRAs for the input images shown on the left for $W_0^2$ , $W_0^5$ (middle) and $W_0^4$ , $W_0^5$ (right). For each pair of trained LoRA weights, we show the results of applying both together (to reconstruct the input image) and applying the content layer separately (i.e. using only $\Delta W^2$ and $\Delta W^4$ ). The results demonstrate that $\Delta W^4$ better captures the fine details of the input object. + +We call such a training scheme $B\text{-LoRA}$ , as it only trains two transformer Blocks instead of the full weights. Hence, apart from the style-content separation abilities such a method also reduces storage requirements by $70\%$ . + +# 4.3 B-LoRA for Image Stylization + +Combining the insights from the above analyses, we now describe the B-LoRA training approach. Given an input image $I$ , we only fine-tune the LoRA weights $\Delta W^4$ , $\Delta W^5$ with the objective of reconstructing the image, w.r.t a general text prompt "A [v]". Besides increasing efficiency, we find that by training only these two layers, we can achieve an implicit style-content decomposition, where $\Delta W^4$ captures the content and $\Delta W^5$ captures the style. + +Once we find these update matrices, we can easily use them by updating the corresponding block weights of the pre-trained SDXL model for style manipulation applications as described next and demonstrated in Figure 6. + +Image stylization based on image style reference Given two input images $I_{c}, I_{s}$ depicting the desired content and style respectively, we use the process described above to learn their corresponding B-LoRA weights: $\Delta W_{c}^{4}, \Delta W_{c}^{5}$ for $I_{c}$ and $\Delta W_{s}^{4}, \Delta W_{s}^{5}$ for $I_{s}$ . We then directly use $\Delta W_{c}^{4}$ and $\Delta W_{s}^{5}$ to update the transformer blocks $W_{0}^{4}$ and $W_{0}^{5}$ of the pre-trained network. For the inference process, we use the prompt "A [c] in [s] style", as illustrated at the top of Figure 6. + +Text-based image stylization By omitting $\Delta W_{c}^{5}$ (capturing the style of $I_{c}$ ) and only using $\Delta W_{c}^{4}$ to update the weights of the pre-trained model, we get a personalized model that is adapted to only the content of $I_{c}$ . To manipulate the style of + +(1) Image stylization based on image style reference + +![](images/8db6d57d577b08242e8184e1913987c6e0999b5a37dd18f773a63246fa6a4006.jpg) + +![](images/f76dd23ac3a7c46e4640b2cfbc2ed497d9469c3c878b81369b0138041f55c154.jpg) +Fig. 6: B-LoRA for Image Stylization. (1) To stylize a given content image $I_{c}$ w.r.t an given style image reference $I_{s}$ , we train our B-LoRAs for both images and then combine $\Delta W_{c}^{4}$ and $\Delta W_{s}^{5}$ to a single adapted model. (2) For text-based stylization we simply plug only the trained $\Delta W_{c}^{4}$ to adapt the model and then use the desired text prompt during inference. (3) The learned style weights $\Delta W_{c}^{5}$ can be also used as is to adjust the backbone model to produce images with the style of $I_{c}$ . + +![](images/6856cbbc00e40d28f905b635011b66acaed926b303d3f6c51169df37db716277.jpg) + +$I_{c}$ with text-based guidance, we simply inject the desired text into the adapted layers during inference (see Figure 6 bottom-left). Note that because the style and content are separated and encoded in different blocks, our approach allows challenging style manipulations. + +Consistent style generation. Lastly, in a similar manner, one can adapt the model for a specific style provided in $I_{s}$ by excluding $\Delta W_{s}^{4}$ and using only $\Delta W_{s}^{5}$ . This results in a model adapted to the desired style, and one can use text-based conditions to generate any content with the desired style (see Figure 6 bottom-right). + +# 4.4 Implementation details + +We train the B-LoRA weights on SDXL v1.0 [38] while keeping both the model weights and text encoders frozen during the fine-tuning process. All LoRA training was performed on a single image. We utilize the Adam optimizer with a learning rate of $5e - 5$ . For data augmentations, we only use center cropping during training. We set the LoRA weights rank to $r = 64$ and use the prompt "A [v]" for 1000 optimization steps, requiring approximately 10 minutes per image on a single A100 GPU. Note that while other methods typically train LoRA for 400 steps to mitigate overfitting concerns, this was not an issue in our case. + +# 5 Results + +To produce the various results of our approach we optimized our B-LoRAs $(\Delta W^4, \Delta W^5)$ once for each image and then plugged either one of them or both of them (depending on the application) at inference time to receive image stylization without any further optimization or fine-tuning. + +We present some qualitative results of the three applications discussed in Section 4.3 in Figure 7. In the first two rows of Figure 7, our method manages to transfer the style of the image references (top row) while preserving the content of the input image on the left. Notable, this can be done for challenging content inputs such as stylized images (first row) and images of whole scenes (second row). Our method is robust to many types of different styles and manages to preserve the essence of the content reference even in very abstract styles such as the one depicted in the third style column. In the third row, we show examples of text-based image stylization. As can be seen with our implicit style-content separation, the content of the input object is preserved well while the style is governed by the desired text prompt. In the last row, we demonstrate how our method can be used for consistent style generation where only the B-LoRA weights of the style are used. Observe that the object's style is well preserved across all text-based generated images. Please refer to the supplementary material for many more examples. + +Comparisons We next compare our method with alternative approaches, both qualitatively and quantitatively. Note that since we rely on SDXL as our backbone model, for a fair comparison we applied alternative approaches on SDXL as well. As a naïve baseline we employ DB-LoRA [43] (fine-tuned for style) with a ControlNet [54] for content conditioning. We additionally compare to three recent approaches for image stylization that rely on the prior of large pre-trained text-to-image models, namely, ZipLoRA [44], StyleDrop [45], and StyleAligned [21]. StyleAligned is applied using the author's official implementation. With the lack of official implementations for StyleDrop and ZipLoRA, we implemented StyleDrop on SDXL (as described in [21]), and utilized a non-official implementation of ZipLoRA [33]. + +Note that for content preservation, all three alternative methods require multiple content images, while our method can be applied to a single image. Thus, for a fair comparison, we collected a total set of 23 objects from existing personalization works [14, 31, 42, 49], where a small set of images is provided for each object. We collected 20 style image references from [21, 45], along with 5 additional style images of our own. From these sets, we randomly sampled 50 pairs of style and content images to compose our final evaluation set. + +In terms of runtime, StyleAligned is zero-shot only for consistent style generation, while for content preservation it relies on LoRA to adapt the model to the desired concepts. Similarly, StyleDrop and ZipLoRA require LoRA training for content and style. Thus, our runtime is comparable to theirs. However, ZipLoRA entails an extra training phase to merge the two LoRAs, making it more time-consuming than our approach. + +![](images/ba1433f6bfa3a5754f4765f1efe8f3a9d63b901a36c431596493ad029056fdf5.jpg) +Fig. 7: Results produced by our method for three image stylization tasks. Rows 1-3: image style transfer. Our method can operate on scene images and extract content from a stylized image. Fourth row: text-based image stylization applied to the content image reference on the left. Note how the pose and identity are preserved well. Last row: consistent style generation, where that style is extracted from the image on the left and used to generate new objects. In this row, we use $\alpha = 1.1$ to enhance the style effect. + +Qualitative Evaluation We show representative comparison results in Figure 8, where on the left we show the style and content reference images. On the first four rows, we show the results of alternative approaches when applied with multiple content images, whereas our method uses a single image. As can be seen, our method effectively preserves the subject from the content image while transferring the desired style. In contrast, other methods either overfit the content subject, thereby failing to alter its style (e.g., cat and sloth in ZipLoRA and StyleDrop), or they suffer from style image "leakage". For instance, in the cat example of StyleAligned (first row), the model generates two cats, matching + +![](images/6813df2515fe5bf35f1873e3db26f487d2ed971733509ee457c10e37334f9e93.jpg) +Fig. 8: Comparison with alternative approaches. The input style and content references are shown on the left, where multiple content images were used for alternative methods. In the last row, we applied other approaches to a single content image. ZipLoRA tends to overfit the content, and thus struggles with depicting the desired style. StyleDrop also struggles to preserve the content when trained on multiple images. In the case of a single content image (last row), both methods preserve the content but lose the style. StyleAligned preserves the style well; however, it tends to include semantic content originating in the style image, such as creating a couple in row 1. Additional comparisons to InstantStyle [51] are provided in the supplementary material. + +the number of people in the style reference image. We also include an example of alternative methods applied to a single content image, where StyleDrop and ZipLoRA exhibit increased overfitting. + +Quantitative Evaluation We measure content and style preservation by computing the cosine similarity between the embeddings of the input content and style references and the output image, utilizing the DINO ViT-B/8 embeddings [8]. The average scores are presented in Table 1. Our method achieves the highest style alignment score, indicating its superior ability to adapt styles effectively. However, we observe lower object similarity scores, possibly due to content overfitting issues observed in alternative approaches. To further support this observation, we conducted the same experiment using a single content image as a reference (scores shown in the "single" row). The results indicate a decrease + +in style consistency scores across all methods, accompanied by an increase in content preservation scores, suggesting overfitting. + +User Study We conducted a user study to further validate the findings presented above. Using 30 random images from our evaluation set, we compared our results with the three alternative approaches. The participants were presented with the reference style and content images along with two combined results, one produced by our method and the other by an alternative method (with the results presented in random order). Participants were asked to choose the result that "better transfers the style from the style image while preserving the content of the content image". We collected responses from 34 participants for the survey, which contained a total of 1020 answers. The results demonstrate a strong preference for our method, with $94\%$ of participants favoring our method over StyleAligned, $91\%$ over ZipLoRA, and $88\%$ over StyleDrop. + +Table 1: Quantitative comparison. We measure the average cosine similarity between the DINO features of the output image and the reference style and content. Our method performs best at adapting to the style without overfitting the content image. + +
InputStyleDropStyleAlignedZipLoRADB-LoRAOurs
Style TransferMultiple0.826 ± 0.070.855 ± 0.050.796 ± 0.070.863 ± 0.060.881 ± 0.05
Single0.790 ± 0.060.829 ± 0.050.782 ± 0.05
ContentMultiple0.817 ± 0.060.779 ± 0.050.841 ± 0.050.769 ± 0.050.790 ± 0.05
Single0.874 ± 0.080.792 ± 0.060.933 ± 0.05
+ +# 6 Conclusions and Future work + +We have presented a simple yet effective method to disentangle the style and content of a single input image. The style and content components are encoded separately with two B-LoRAs, providing high flexibility for independent use in various image stylization tasks. In contrast to existing methods that focus on style extraction, we employ a compound style-content learning approach that enables a better separation of style and content, enhancing stylization fidelity. + +As for future research, one possible avenue is to further explore separation techniques within LoRA fine-tuning, to achieve more concrete separation into sub-components such as structure, shape, color, texture, etc. This could provide users with more control over the desired output. Another direction for future work is to leverage the robustness of our approach and extend it to combine LoRA weights from multiple distinct objects or combine a few styles. + +# Acknowledgements + +We would like to thank Amir Hertz and Yuval Alaluf for their insightful feedback. Additionally, some of the artistic paintings presented in this paper were created by the artist Judith Kondor Mochary. We thank the artist's family for granting us the privilege to use Judith's drawings. This work was supported by the Israel Science Foundation under Grant No. 2492/20, 3441/21 and 1390/19, and Joint NSFC-ISF Research Grant Research Grant no. 3077/23. + +# References + +1. Agarwal, A., Karanam, S., Shukla, T., Srinivasan, B.V.: An image is worth multiple words: Multi-attribute inversion for constrained text-to-image synthesis. ArXiv abs/2311.11919 (2023), https://api-semanticscholar.org/CorpusID: 265295502 +2. Alaluf, Y., Garibi, D., Patashnik, O., Averbuch-Elor, H., Cohen-Or, D.: Cross-image attention for zero-shot appearance transfer. ArXiv abs/2311.03335 (2023), https://api-semanticscholar.org/CorpusID:265043677 +3. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization. ACM Transactions on Graphics (TOG) 42(6), 1-10 (2023) +4. Arar, M., Voynov, A., Hertz, A., Avrahami, O., Fruchter, S., Pritch, Y., Cohen-Or, D., Shamir, A.: Palp: Prompt aligned personalization of text-to-image models. ArXiv abs/2401.06105 (2024), https://apisemantic scholar.org/CorpusID: 266933184 +5. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-ascene: Extracting multiple concepts from a single image. In: SIGGRAPH Asia 2023 Conference Papers. SA '23, Association for Computing Machinery, New York, NY, USA (2023). https://doi.org/10.1145/3610548.3618154, https://doi.org/10.1145/3610548.3618154 +6. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Transactions on Graphics (TOG) 42, 1-11 (2022), https://api_semanticscholar.org/CorpusID:249394540 +7. Avrahami, O., Hertz, A., Vinker, Y., Arar, M., Fruchter, S., Fried, O., Cohen-Or, D., Lischinski, D.: The chosen one: Consistent characters in text-to-image diffusion models. arXiv preprint arXiv:2311.10093 (2023) +8. Caron, M., Touvron, H., Misra, I., J'egou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. 2021 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 9630-9640 (2021), https://apisemantic scholar.org/CorpusID:233444273 +9. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M., Murphy, K.P., Freeman, W.T., Rubinstein, M., Li, Y., Krishnan, D.: Muse: Text-to-image generation via masked generative transformers. ArXiv abs/2301.00704 (2023), https://api-semanticscholar.org/CorpusID:255372955 +0. Chen, M., Laina, I., Vedaldi, A.: Training-free layout control with cross-attention guidance. ArXiv abs/2304.03373 (2023), https://api(semanticscholar.org/ CorpusID:258041377 + +11. Couairon, G., Verbeek, J., Schwenk, H., Cord, M.: Diffedit: Diffusion-based semantic image editing with mask guidance. ArXiv abs/2210.11427 (2022), https://api-semanticscholar.org/CorpusID:253018768 +12. Efros, A.A., Freeman, W.T.: Image quilting for texture synthesis and transfer. Proceedings of the 28th annual conference on Computer graphics and interactive techniques (2001), https://api_semanticscholar.org/CorpusID:9334387 +13. Epstein, D., Jabri, A., Poole, B., Efros, A.A., Holynski, A.: Diffusion self-guidance for controllable image generation. ArXiv abs/2306.00986 (2023), https://api.sementicscholar.org/CorpusID:258999106 +14. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022) +15. Gandikota, R., Materzynska, J., Zhou, T., Torralba, A., Bau, D.: Concept sliders: Lora adaptors for precise control in diffusion models. ArXiv abs/2311.12092 (2023), https://api-semanticscholar.org/CorpusID:265308675 +16. Gatys, L.A., Ecker, A.S., Bethge, M.: Image style transfer using convolutional neural networks. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 2414-2423 (2016), https://api-semanticscholar.org/CorpusID:206593710 +17. Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A.C., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63, 139 - 144 (2014), https://apisemanticscholar.org/CorpusID: 1033682 +18. Gu, Y., Wang, X., Wu, J.Z., Shi, Y., Chen, Y., Fan, Z., Xiao, W., Zhao, R., Chang, S., Wu, W., Ge, Y., Shan, Y., Shou, M.Z.: Mix-of-show: Decentralized low-rank adaptation for multi-concept customization of diffusion models. ArXiv abs/2305.18292 (2023), https://api-semanticscholar.org/CorpusID: 258960192 +19. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D.N., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 7289-7300 (2023), https://apisemantic scholar.org/CorpusID:257631648 +20. Hertz, A., Mokady, R., Tenenbaum, J.M., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. ArXiv abs/2208.01626 (2022), https://apisemantic scholar.org/CorpusID: 251252882 +21. Hertz, A., Voynov, A., Fruchter, S., Cohen-Or, D.: Style aligned image generation via shared attention. arXiv preprint arXiv:2312.02133 (2023) +22. Hertzmann, A., Jacobs, C.E., Oliver, N., Curless, B., Salesin, D.H.: Image analogies p. 327-340 (2001). https://doi.org/10.1145/383259.383295, https://doi.org/10.1145/383259.383295 +23. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., de Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. ArXiv abs/1902.00751 (2019), https://api_semanticscholar.org/CorpusID: 59599816 +24. Hu, J.E., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Chen, W.: Lora: Low-rank adaptation of large language models. ArXiv abs/2106.09685 (2021), https://api-semanticscholar.org/CorpusID:235458009 +25. Huang, X., Belongie, S.J.: Arbitrary style transfer in real-time with adaptive instance normalization. 2017 IEEE International Conference on Computer Vision + +(ICCV) pp. 1510-1519 (2017), https://api_semanticscholar.org/CorpusID:6576859 +26. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below. +27. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 5967-5976 (2016), https://api_semanticscholar.org/CorpusID:6200260 +28. Jing, Y., Yang, Y., Feng, Z., Ye, J., Song, M.: Neural style transfer: A review. IEEE Transactions on Visualization and Computer Graphics 26, 3365-3385 (2017), https://api_semanticscholar.org/CorpusID:4875951 +29. Johnson, J., Alahi, A., Fei-Fei, L.: Perceptual losses for real-time style transfer and super-resolution. ArXiv abs/1603.08155 (2016), https://apisemantic scholar.org/CorpusID:980236 +30. Katzir, O., Lischinski, D., Cohen-Or, D.: Cross-domain cascaded deep translation. In: European Conference on Computer Vision (2020), https://apisemantic scholar.org/CorpusID:209315529 +31. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1931-1941 (2022), https://api-semanticscholar.org/CorpusID:254408780 +32. Li, S., van de Weijer, J., Hu, T., Khan, F.S., Hou, Q., Wang, Y., Yang, J.: Stylediffusion: Prompt-embedding inversion for text-based editing. ArXiv abs/2303.15649 (2023), https://api-semanticscholar.org/CorpusID:257771440 +33. mkshing:Ziplora-pytorch.https://github.com/mkshing/ziplora-pytorch +34. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 6038-6047. IEEE (2023). https://doi.org/10.1109/CVPR52729.2023.00585, https://doi.org/10.1109/CVPR52729.2023.00585 +35. Park, T., Efros, A.A., Zhang, R., Zhu, J.Y.: Contrastive learning for unpaired image-to-image translation. In: European Conference on Computer Vision (2020), https://api-semanticscholar.org/CorpusID:220871180 +36. Parmar, G., Singh, K.K., Zhang, R., Li, Y., Lu, J., Zhu, J.Y.: Zero-shot image-to-image translation. ACM SIGGRAPH 2023 Conference Proceedings (2023), https://api-semanticscholar.org/CorpusID:256616002 +37. Po, R., Yang, G., Aberman, K., Wetzstein, G.: Orthogonal adaptation for modular customization of diffusion models. ArXiv abs/2312.02432 (2023), https://api.sementicscholar.org/CorpusID:265659333 +38. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Muller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. ArXiv abs/2307.01952 (2023), https://api(semanticscholar.org/ CorpusID:259341735 +39. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning (2021), https://api_semanticscholar.org/CorpusID: 231591445 + +40. Research, F.: Cog sdxl canny controlnet with lora support. https://replicate.com/batouresearch/sdxl-controlnet-lora +41. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10674-10685 (2021), https://api-semanticscholar.org/CorpusID:245335280 +42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023) +43. Ryu, S.: Low-rank adaptation for fast text-to-image diffusion fine-tuning. https://github.com/cloneofsimo/lora +44. Shah, V., Ruiz, N., Cole, F., Lu, E., Lazebnik, S., Li, Y., Jampani, V.:Ziplora: Any subject in any style by effectively merging loras. arXiv preprint arXiv:2311.13600 (2023) +45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., Hao, Y., Essa, I., Rubinstein, M., Krishnan, D.: Styledrop: Text-to-image generation in any style (2023) +46. Tenenbaum, J., Freeman, W.: Separating style and content. In: Mozer, M., Jordan, M., Petsche, T. (eds.) Advances in Neural Information Processing Systems. vol. 9. MIT Press (1996), https://proceedings.neurips.cc/paper_files/paper/1996/file/70222949cc0db89ab32c9969754d4758-Paper.pdf +47. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1921-1930 (2022), https://apisemantic scholar.org/CorpusID:253801961 +48. Vaswani, A., Shazeer, N.M., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Neural Information Processing Systems (2017), https://api-semanticscholar.org/CorpusID:13756489 +49. Vinker, Y., Voynov, A., Cohen-Or, D., Shamir, A.: Concept decomposition for visual exploration and inspiration. ACM Trans. Graph. 42(6) (dec 2023). https://doi.org/10.1145/3618315, https://doi.org/10.1145/3618315 +50. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: $p+$ : Extended textual conditioning in text-to-image generation. arXiv preprint arXiv:2303.09522 (2023) +51. Wang, H., Spinelli, M., Wang, Q., Bai, X., Qin, Z., Chen, A.: Instantstyle: Free lunch towards style-preserving in text-to-image generation. ArXiv abs/2404.02733 (2024), https://api_semanticscholar.org/CorpusID: 268876474 +52. Yang, S., joo Hwang, H., Ye, J.C.: Zero-shot contrastive loss for text-guided diffusion image style transfer. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 22816-22825 (2023), https://apisemantic scholar.org/CorpusID:257532402 +53. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. ArXiv abs/2308.06721 (2023), https://api.sementicscholar.org/CorpusID:260886966 +54. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 3813-3824 (2023), https://api-semanticscholar.org/CorpusID:256827727 + +55. xin Zhang, Y., Huang, N., Tang, F., Huang, H., Ma, C., Dong, W., Xu, C.: Inversion-based style transfer with diffusion models. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10146-10156 (2022), https://api-semanticscholar.org/CorpusID:257427673 +56. Zhang, Y., Dong, W., Tang, F., Huang, N., Huang, H., Ma, C., Lee, T.Y., Deussen, O., Xu, C.: Prospect: Prompt spectrum for attribute-aware personalization of diffusion models. ACM Transactions on Graphics (TOG) 42(6), 1-14 (2023) +57. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. 2017 IEEE International Conference on Computer Vision (ICCV) pp. 2242-2251 (2017), https://api_semanticscholar.org/CorpusID:206770979 \ No newline at end of file diff --git a/2024/Implicit Style-Content Separation using B-LoRA/images.zip b/2024/Implicit Style-Content Separation using B-LoRA/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..8ec1cbb96c3e7c2d1d3cd4ef3aeb3380a8b39fa6 --- /dev/null +++ b/2024/Implicit Style-Content Separation using B-LoRA/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a60874b17c3601d7ac0010a034a677cd760e771bca6fb734cc4a596d06375b0a +size 631066 diff --git a/2024/Implicit Style-Content Separation using B-LoRA/layout.json b/2024/Implicit Style-Content Separation using B-LoRA/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..b85cb4ab1ded8db88a8b3433c765f91cb7e8b5a0 --- /dev/null +++ b/2024/Implicit Style-Content Separation using B-LoRA/layout.json @@ -0,0 +1,9792 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 136, + 112, + 477, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 112, + 477, + 129 + ], + "spans": [ + { + "bbox": [ + 136, + 112, + 477, + 129 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 153, + 149, + 459, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 149, + 459, + 163 + ], + "spans": [ + { + "bbox": [ + 153, + 149, + 459, + 163 + ], + "type": "text", + "content": "Yarden Frenkel1, Yael Vinker1, Ariel Shamir2, and Daniel Cohen-Or1" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 259, + 171, + 354, + 194 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 261, + 171, + 352, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 171, + 352, + 182 + ], + "spans": [ + { + "bbox": [ + 261, + 171, + 352, + 182 + ], + "type": "text", + "content": "1 Tel Aviv University" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 259, + 182, + 354, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 259, + 182, + 354, + 194 + ], + "spans": [ + { + "bbox": [ + 259, + 182, + 354, + 194 + ], + "type": "text", + "content": "2 Reichman University" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "text" + }, + { + "type": "image", + "bbox": [ + 141, + 206, + 473, + 352 + ], + "blocks": [ + { + "bbox": [ + 141, + 206, + 473, + 352 + ], + "lines": [ + { + "bbox": [ + 141, + 206, + 473, + 352 + ], + "spans": [ + { + "bbox": [ + 141, + 206, + 473, + 352 + ], + "type": "image", + "image_path": "fc29fa0746009eef1e925220a21f3f48d8c9a17f886e141a858f8e51afaa0668.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 359, + 482, + 392 + ], + "lines": [ + { + "bbox": [ + 131, + 359, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 131, + 359, + 482, + 392 + ], + "type": "text", + "content": "Fig. 1: By implicitly decomposing a single image into its style and content representation, captured by B-LoRA, we can perform high quality style-content mixing and even swapping the style and content between two stylized images." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 405, + 453, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 405, + 453, + 492 + ], + "spans": [ + { + "bbox": [ + 159, + 405, + 453, + 492 + ], + "type": "text", + "content": "Abstract. Image stylization involves manipulating the visual appearance and texture (style) of an image while preserving its underlying objects, structures, and concepts (content). The separation of style and content is essential for manipulating the image's style independently from its content, ensuring a harmonious and visually pleasing result. Achieving this separation requires a deep understanding of both the visual and semantic characteristics of images, often necessitating the training of specialized models or employing heavy optimization." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 159, + 492, + 453, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 492, + 453, + 525 + ], + "spans": [ + { + "bbox": [ + 159, + 492, + 453, + 525 + ], + "type": "text", + "content": "In this paper, we introduce B-LoRA, a method that leverages LoRA (Low-Rank Adaptation) to implicitly separate the style and content components of a single image, facilitating various image stylization tasks." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 159, + 525, + 453, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 525, + 453, + 601 + ], + "spans": [ + { + "bbox": [ + 159, + 525, + 453, + 601 + ], + "type": "text", + "content": "By analyzing the architecture of SDXL combined with LoRA, we find that jointly learning the LoRA weights of two specific blocks (referred to as B-LoRAs) achieves style-content separation that cannot be achieved by training each B-LoRA independently. Consolidating the training into only two blocks and separating style and content allows for significantly improving style manipulation and overcoming overfitting issues often associated with model fine-tuning." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 159, + 601, + 453, + 645 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 601, + 453, + 645 + ], + "spans": [ + { + "bbox": [ + 159, + 601, + 453, + 645 + ], + "type": "text", + "content": "Once trained, the two B-LoRAs can be used as independent components to allow various image stylization tasks, including image style transfer, text-based image stylization, consistent style generation, and style-content mixing." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 127, + 199, + 191 + ], + "blocks": [ + { + "bbox": [ + 137, + 118, + 190, + 127 + ], + "lines": [ + { + "bbox": [ + 137, + 118, + 190, + 127 + ], + "spans": [ + { + "bbox": [ + 137, + 118, + 190, + 127 + ], + "type": "text", + "content": "Input content" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 134, + 127, + 199, + 191 + ], + "lines": [ + { + "bbox": [ + 134, + 127, + 199, + 191 + ], + "spans": [ + { + "bbox": [ + 134, + 127, + 199, + 191 + ], + "type": "image", + "image_path": "9fb5e3442e1ebe41569152b8734ceca642663d003cae8ecc7a3de5514039c0bc.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 209, + 128, + 272, + 191 + ], + "blocks": [ + { + "bbox": [ + 209, + 128, + 272, + 191 + ], + "lines": [ + { + "bbox": [ + 209, + 128, + 272, + 191 + ], + "spans": [ + { + "bbox": [ + 209, + 128, + 272, + 191 + ], + "type": "image", + "image_path": "14987fe572b33f4ac8947ae1c9f3be8acbdfb8c7bf3a497915248795f5071ceb.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 276, + 128, + 339, + 192 + ], + "blocks": [ + { + "bbox": [ + 276, + 128, + 339, + 192 + ], + "lines": [ + { + "bbox": [ + 276, + 128, + 339, + 192 + ], + "spans": [ + { + "bbox": [ + 276, + 128, + 339, + 192 + ], + "type": "image", + "image_path": "910cdfe0ac0f4b318318bcde51a7eef0ea179f8132f190b66efb2a157f0ba857.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 342, + 128, + 407, + 193 + ], + "blocks": [ + { + "bbox": [ + 342, + 128, + 407, + 193 + ], + "lines": [ + { + "bbox": [ + 342, + 128, + 407, + 193 + ], + "spans": [ + { + "bbox": [ + 342, + 128, + 407, + 193 + ], + "type": "image", + "image_path": "a30951db7c3ea39346fdc539b16f3befdc2f40d1e494b4bc49ae4c0f3535fa32.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 204, + 482, + 260 + ], + "lines": [ + { + "bbox": [ + 130, + 204, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 204, + 482, + 260 + ], + "type": "text", + "content": "Fig. 2: Examples of image stylization generated with our approach. The content image is shown on the left. We show here three results of image style transfer based on a reference style, one (on the right) based on a guiding text prompt. Note that our method requires only a single image, and preserves the image's content and structure well while applying the desired style." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 410, + 128, + 474, + 193 + ], + "blocks": [ + { + "bbox": [ + 410, + 128, + 474, + 193 + ], + "lines": [ + { + "bbox": [ + 410, + 128, + 474, + 193 + ], + "spans": [ + { + "bbox": [ + 410, + 128, + 474, + 193 + ], + "type": "image", + "image_path": "8ac753bfd681f536642da941c6b532f3320d921fe631cca407195b30225f8386.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 281, + 230, + 295 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 230, + 295 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 230, + 295 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 306, + 482, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 306, + 482, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 306, + 482, + 426 + ], + "type": "text", + "content": "Image stylization is a well-established task in computer vision, and has been actively researched for many years [16,22]. This task involves changing the style of an image following some style reference, which can be text-based or image-based while preserving its content. Content refers to the semantic information and structure of the image, while style often refers to visual features and patterns such as colors and textures [46]. Image style manipulation is a highly challenging task, since style and content are strongly connected, leading to an inherent trade-off between style transformation and content preservation. On the other hand, many style manipulation tasks require a clear separation between style and content within an image." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 426, + 482, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 462 + ], + "type": "text", + "content": "In this paper, we present B-LoRA, a method for style-content separation of any given image. Our method distills the style and content from a single image to support various style manipulation applications." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 463, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 463, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 463, + 482, + 593 + ], + "type": "text", + "content": "In the realm of recent advancements in large language-vision models, existing approaches utilize the strong visual-semantic priors embedded within these models to facilitate style manipulation tasks. Common techniques involve fine-tuning a pre-trained text-to-image model to account for a new style or content [4, 19, 24, 42]. However, fine-tuned models often suffer from the inherent trade-off between style transformation and content preservation as they are prone to over-fitting. Unlike these methods, we unify the learning of style and content components by separating them per image (see Figure 1). This separation is performed by fitting a light-weight adapter (B-LoRA) that is less prone to over-fitting issues, and enables task flexibility, allowing for both text-based and reference style image conditions." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "Our method utilizes LoRA (Low Rank Adaptation) [24], which has emerged as a popular approach due to its high-quality results and efficiency. LoRA incorporates optimizing external low-rank weight matrices for the attention layers of the base model, while the pretrained model weights remain \"frozen\". After training, these matrices define the adapted model that can be used for the desired task. LoRA is often utilized for image stylization by fine-tuning the base model" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "with respect to a set of images that can either represent the desired style or the desired content." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "type": "text", + "content": "Specifically, we use LoRA with Stable Diffusion XL (SDXL) [38], a recently introduced text-to-image diffusion model renowned for its powerful style learning capabilities. Through detailed analysis of various layers within SDXL and their effect on the adaptation procedure, we made a surprising discovery: two specific transformer blocks can be used to separate the style and content of an input image, and to easily control them distinctly in generated images. For clarification, in this paper, we define a transformer block as a sequence of 10 consecutive attention layers." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 236, + 482, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 403 + ], + "type": "text", + "content": "Therefore, when provided with a single input image, we jointly optimize the LoRA weights corresponding to these two distinct transformer blocks with the objective of reconstructing the given image based on a provided text prompt. Since we only optimize the LoRA weights of these two transformer blocks, we refer to them as \"B-LoRAs\". The crucial aspect is that these B-LoRAs are trained on a single image only, yet they successfully disentangle its style and content, thereby circumventing the prevalent overfitting problem associated with common LoRA techniques that can struggle to change the style and/or content of an input image. Our technique benefits from the innate style-content disentanglement within the layers of the architecture. Another advantage of our method is that the B-LoRAs can be easily used as separate components, allowing various challenging style manipulation tasks without requiring any additional training or fine-tuning. In particular, we demonstrate style transfer, text-guided style manipulation and consistent style-conditioned image generation (see Figure 2)." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 403, + 482, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 487 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 487 + ], + "type": "text", + "content": "We note that recent attempts have been made to combine trained LoRAs of style and content to a unified model [44]. This approach requires a new optimization process for each style-content combination. This is both time-consuming and raises challenges in achieving an effective trade-off between style transformation and content preservation. In contrast, our trained B-LoRAs can be easily replugged into a pre-trained model combined with other learned blocks from other reference images, without any further training." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 487, + 481, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 481, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 481, + 536 + ], + "type": "text", + "content": "We provide extensive evaluation of our method showing its advantages compared to alternative approaches that are often designed to achieve one of these tasks. Our method provides a practical and simple way for image stylization that can be broadly used with existing models." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 555, + 237, + 568 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 237, + 568 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 237, + 568 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Style Transfer Image style transfer is a longstanding challenge in computer vision [12,22], aimed at altering the style of an image based on a given reference. With the progress of deep learning research, Neural Style Transfer (NST) approaches rely on deep features extracted from pre-trained networks to merge content and style [16,28,29]. Subsequent GAN-based [17] techniques were proposed to transfer images across domains, using either paired [27] or unpaired [30,35,57] image sets, yet they require domain-specific datasets and training." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 283 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 283 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 283 + ], + "type": "text", + "content": "Recent advancements in language-vision models and diffusion models have revolutionized the field of image stylization. Leveraging the vast knowledge encoded in pre-trained language-vision models, modern approaches explore zero-shot image stylization and editing [6, 10, 11, 13, 32, 34, 36, 52], where images are manipulated without additional fine-tuning or data adaptation by intervening in the generation process. Prompt-to-Prompt [20] proposes an approach to edit generated images by manipulating their cross-attention maps. In Plug-and-Play [47] the appearance of a content image is manipulated with respect to a given text prompt by adjusting spatial features from the guidance image via the self-attention mechanism. Cross Image Attention (CIA) [2] presents a method to modify the image appearance based on a reference image through alterations in cross-attention mechanisms. While these approaches effectively transform the appearance of the content image, they may encounter challenges in transferring appearance between subjects with differing semantics." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 285, + 483, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 285, + 483, + 404 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 483, + 404 + ], + "type": "text", + "content": "StyleAligned [21] utilizes attention features sharing combined with the AdaIN mechanism [25] to achieve style alignment between a sequence of generated images. However, the method is not explicitly designed to control the content of the generated image, potentially resulting in style image structure leakage. Similarly, the lack of style-content separation is also evident in encoder-based methods, such as IP-Adapter [53]. InstantStyle [51] is a concurrent work to ours, aiming to improve IP-Adapter for image stylization tasks by injecting the CLIP embedding of the style image into specific blocks within SDXL. In our work, we decompose the style and the content and learn a separate representation for each." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 426, + 483, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 483, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 483, + 668 + ], + "type": "text", + "content": "Text-to-Image Personalization In another line of work [3, 4, 14, 19, 42, 50], optimization techniques are proposed to extend pre-trained Text-to-Image models to support the generation of novel visual concepts, including both style and content, based on a small set of input images with the same concept. This allows utilizing the rich semantic-visual prior of pre-trained models for customized tasks such as producing images of a desired style. Existing methods employ either token optimization techniques [1, 14, 49, 50, 55, 56], fine-tuning the model's weights [42], or a combination of both [3-5,7]. Token optimization requires longer training times and often results in sub-optimal reconstruction. While model finetuning provides better reconstruction, it consumes substantial memory and tends to overfit. To address the memory inefficiency, and to facilitate more efficient model fine-tuning, Parameter Efficient Fine-Tuning (PEFT) approaches have been proposed [23, 24, 31]. StyleDrop [45] utilizes Muse [9] as a base model, and adjusts its styles to align with a reference image. StyleDrop trains a lightweight adapter layer at the end of each attention block within the transformer model. However, similar to StyleAligned [21], their approach is designed for style adaptation, but for content preservation, another optimization is required. Among existing PEFT methods, Low-Rank Adaptation (LoRA) [24] is a popular finetuning technique, widely used by researchers and practitioners for its versatility and high-quality results." + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": "LoRA for Image Stylization LoRA is often used for image stylization by fine-tuning a model to produce images of a desired style. Commonly, a LoRA is trained on a set of images, and then it is combined with control methods such as stylistic Concept-Slanders [15] or ControlNet [40, 54], along with a text prompt to condition the generated image content. While LoRA-based approaches have demonstrated significant abilities in capturing style and content, two separate LoRA models are required for this task, and there is no trivial way to combine them. A common naïve approach is to combine two LoRAs by directly interpolating their weights [43], relying on a manual search for the desired coefficients. Alternative approaches [18, 37] propose an optimization-based strategy to find the optimal coefficients for such a combination. However, they focus on combining two objects and not on image stylization tasks." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 261, + 482, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 261, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 482, + 380 + ], + "type": "text", + "content": "Recently, Shah et al. introduced ZipLoRA [44], proposing to merge two individual LoRAs trained for style and content into a new 'zipped' LoRA by learning mixing coefficients for their columns. This work is closely related to ours, as we also mix LoRA weights trained on different images to facilitate image stylization. However, ZipLoRA requires an additional optimization stage for each new combination of content and style, thereby restricting the flexibility of reusing trained LoRA weights, which is LoRA's primary advantage. In contrast, our approach allows for the direct reuse of learned styles and contents without additional training, enhancing efficiency and versatility. Moreover, we demonstrate that our implicit approach is more robust to challenging styles and contents." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 399, + 234, + 412 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 399, + 234, + 412 + ], + "spans": [ + { + "bbox": [ + 132, + 399, + 234, + 412 + ], + "type": "text", + "content": "3 Preliminaries" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 426, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 581 + ], + "type": "text", + "content": "SDXL Architecture In our work, we utilize the recently introduced publicly available text-to-image Stable Diffusion XL (SDXL) [38], which is an upgraded version of the known Stable Diffusion [41]. Both models are types of latent diffusion models (LDM), where the diffusion process is applied in the latent space of a pre-trained image autoencoder. The SDXL architecture leverages a three times larger UNet backbone compared to Stable Diffusion. The UNet consists of a total number of 70 attention layers. Each layer consists of a cross and self-attention. These attention layers are often referred to as attention blocks. In this paper, for clarity, we refer to them as layers so they are not confused with the larger transformer blocks we optimize. These attention layers are divided into 11 transformer blocks where the first two and last three blocks are comprised of four and six attention layers, respectively. The six inner blocks consist of 10 attention layers each, as illustrated in Figure 3)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "text", + "content": "Text condition generation is also extended in SDXL in the following way: given a text prompt " + }, + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "text", + "content": ", it is encoded twice, with both OpenCLIP ViT-bigG [26] and CLIP ViT-L [39]. The resulting embeddings are then concatenated to define the conditioning encoding " + }, + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "text", + "content": ". Then this text embedding is fed into the cross-attention layers of the network, following the attention mechanism [48]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": "Specifically, in each layer, the deep spatial features " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": " are projected to a query matrix " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "Q = l_{Q}(x)" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": ", and the textual embedding is projected to a key matrix" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "K = l_{K}(c)" + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "content": " and a value matrix " + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "V = l_{V}(c)" + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "content": " via learned linear projections " + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "l_{Q}, l_{K}, l_{V}" + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "content": ". The attention maps are then defined by:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 253, + 148, + 481, + 175 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 253, + 148, + 481, + 175 + ], + "spans": [ + { + "bbox": [ + 253, + 148, + 481, + 175 + ], + "type": "interline_equation", + "content": "A _ {t} = \\operatorname {S o f t m a x} \\left(\\frac {Q K ^ {T}}{\\sqrt {d}}\\right) V, \\tag {1}", + "image_path": "1a8266be6221abb67bb2959a5f83db38c7b92195ed7a392ab73cd2aa42438e8f.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 181, + 440, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 181, + 440, + 194 + ], + "spans": [ + { + "bbox": [ + 146, + 181, + 440, + 194 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 146, + 181, + 440, + 194 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 146, + 181, + 440, + 194 + ], + "type": "text", + "content": " is the latent projection dimension of the keys and queries." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 204, + 479, + 251 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 204, + 479, + 251 + ], + "spans": [ + { + "bbox": [ + 130, + 204, + 479, + 251 + ], + "type": "text", + "content": "LoRA Low-Rank Adaptation [24] is a method for efficiently fine-tuning large pre-trained models for specific tasks or domains. LoRA has emerged as a very popular approach for fine-tuning pre-trained text-to-image diffusion models [43] due to its high-quality results and efficiency." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": "Let us denote the weights of a pre-trained text-to-image diffusion model with " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "W_0" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": ", and the learned residuals after fine-tuning the model for a specific task with " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "\\Delta W" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": ". The key idea in LoRA is that " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "\\Delta W \\in \\mathbb{R}^{m \\times n}" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": " can be decomposed into two low intrinsic rank matrices " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "B \\in \\mathbb{R}^{m \\times r}" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "A \\in \\mathbb{R}^{r \\times n}" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": ", such that " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "\\Delta W = BA" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": ", and the rank " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "r << \\min(m, n)" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": ". During training, the original model weights " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "W_0" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": " remain frozen, and only " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "A" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "B" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": " are updated. Thus, by the end of the training, we can obtain the tuned model weights by using " + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "inline_equation", + "content": "W = W_0 + \\Delta W" + }, + { + "bbox": [ + 131, + 252, + 480, + 335 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": "LoRA is commonly used in text-to-image diffusion models only in the cross and self-attention layers. As discussed, the attention mechanism in each layer relies on four projection matrices: " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "l_{Q}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "l_{K}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "l_{V}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "l_{\\mathrm{out}}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": ". The LoRA weights " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "\\Delta W_{Q}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "\\Delta W_{K}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "\\Delta W_{V}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "\\Delta W_{\\mathrm{out}}" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": " are optimized for each of these pre-trained matrices. We denote by " + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "inline_equation", + "content": "\\Delta W" + }, + { + "bbox": [ + 131, + 336, + 481, + 396 + ], + "type": "text", + "content": " the LoRA weights of all four matrices." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 413, + 202, + 426 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 202, + 426 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 202, + 426 + ], + "type": "text", + "content": "4 Method" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 437, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 559 + ], + "type": "text", + "content": "Our objective is to decouple the style and content aspects of an input image " + }, + { + "bbox": [ + 130, + 437, + 482, + 559 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 437, + 482, + 559 + ], + "type": "text", + "content": " into separate components, enabling both text-based and image-based stylization applications. Our approach harnesses the capabilities of a pre-trained SDXL text-to-image generation model [38], known for its robustness in capturing stylistic features [44]. We conduct an analysis of the SDXL architecture to gain insight into the contributions of individual layers to either the style or the content of the generated image. Guided by our observations, we employ LoRA [24] to train update matrices of only two specific transformer blocks within the SDXL model. These matrices capture the representation of the content and the style of the input image and they suffice to facilitate a number of image stylization tasks." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 574, + 306, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 574, + 306, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 574, + 306, + 586 + ], + "type": "text", + "content": "4.1 SDXL Architecture Analysis" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": "Similar to previous works [1, 50] we examine the effect of different layers within the base text-to-image model on the generated image. We adopt a similar approach to the one proposed in Voynov et al. [50]. The key idea is to inject a different text prompt into the cross-attention layers of one of the transformer blocks within SDXL. Then examine the similarity between the different prompts and the resulting image. If we only change the input prompt corresponding to" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": "the i'th block, and the i'th block dominates a certain quality of the generated image, this will be apparent in the resulting image. Specifically, we examine six intermediate transformer blocks " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "\\{W_0^1,\\dots W_0^6\\}" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": " of SDXL, each containing 10 attention layers (see Figure 3). These layers have been selected based on previous works [1,50], which demonstrate that they are most likely to affect the important visual properties of the generated images." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": "We define two random sets of text prompts " + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "inline_equation", + "content": "P_{content}" + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "inline_equation", + "content": "P_{style}" + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": " describing different objects with different colors. The prompts in " + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "inline_equation", + "content": "P_{content}" + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": " are defined by placing random objects in the template text \"A photo of a \". For " + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "inline_equation", + "content": "P_{style}" + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": " we use the template \"A photo of a \". The random objects and colors are generated with ChatGPT. Note that color is used as a proxy for style since we use CLIP [39] to evaluate results (as will be described next), and we found CLIP to be a better indicator for changes in color than changes in style. We sample a pair of prompts " + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "inline_equation", + "content": "(p, \\hat{p}) \\in P_{content}" + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "inline_equation", + "content": "(p, \\hat{p}) \\in P_{style}" + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": " such that " + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "inline_equation", + "content": "p \\neq \\hat{p}" + }, + { + "bbox": [ + 130, + 188, + 298, + 403 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "content": "For each pair " + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "inline_equation", + "content": "(\\hat{p}, p)" + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "content": ", we generate an image " + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "inline_equation", + "content": "I_{\\hat{p} \\to i, p \\to j \\neq i}" + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "content": " by injecting the embedding of " + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "inline_equation", + "content": "\\hat{p}" + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "inline_equation", + "content": "W_0^i" + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "content": " while injecting the embedding of " + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "content": " to all other layers " + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "inline_equation", + "content": "W_0^j, j \\neq i" + }, + { + "bbox": [ + 130, + 404, + 298, + 499 + ], + "type": "text", + "content": " (illustrated in Figure 3). This is performed for each of the six transformer blocks we target, resulting in six images per pair." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 499, + 481, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 499, + 481, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 499, + 481, + 523 + ], + "type": "text", + "content": "Next, to measure the effect of injecting " + }, + { + "bbox": [ + 130, + 499, + 481, + 523 + ], + "type": "inline_equation", + "content": "\\hat{p}" + }, + { + "bbox": [ + 130, + 499, + 481, + 523 + ], + "type": "text", + "content": " into the i'th block on the generated image, we estimate the following similarity score:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 190, + 533, + 481, + 548 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 533, + 481, + 548 + ], + "spans": [ + { + "bbox": [ + 190, + 533, + 481, + 548 + ], + "type": "interline_equation", + "content": "\\mathcal {C} (I _ {\\hat {p} \\rightarrow i, p \\rightarrow j}, \\hat {p}) = s i m (C L I P _ {I} (I _ {\\hat {p} \\rightarrow i, p \\rightarrow j}), C L I P _ {T} (\\hat {p})), \\tag {2}", + "image_path": "6b7b714699d838b0c704c5032407612924a29ece7f74f56a1eefbf90f52ff689.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "inline_equation", + "content": "CLIP_{I}(I_{\\hat{p}\\rightarrow i,p\\rightarrow j})" + }, + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "inline_equation", + "content": "CLIP_{T}(\\hat{p})" + }, + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "text", + "content": " are the CLIP image embedding of the generated image, and the CLIP text embedding of the prompt, respectively. " + }, + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "inline_equation", + "content": "sim(x,y) = \\frac{x\\cdot y}{||x||\\cdot||y||}" + }, + { + "bbox": [ + 130, + 555, + 481, + 594 + ], + "type": "text", + "content": " indicates the cosine similarity between the clip embeddings." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": "In total, we examined 400 pairs of content and style prompts and averaged the scores of each layer. The three topmost layers that show similarity to one type of prompt are " + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "W_0^2" + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "W_0^4" + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": " which dominate the content of the generated image, and " + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "W_0^5" + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": " which dominates its color. We visually demonstrate these conclusions in Figure 4. On the left, we show the effect of blocks 2 and 4 on the generated content. Note that " + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "I_{\\hat{p} \\to 2,p \\to j}" + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "inline_equation", + "content": "I_{\\hat{p} \\to 4,p \\to j}" + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": " demonstrate that when \"A photo of" + } + ] + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 307, + 214, + 482, + 384 + ], + "blocks": [ + { + "bbox": [ + 307, + 214, + 482, + 384 + ], + "lines": [ + { + "bbox": [ + 307, + 214, + 482, + 384 + ], + "spans": [ + { + "bbox": [ + 307, + 214, + 482, + 384 + ], + "type": "image", + "image_path": "13efb2f31619e716ed1ed8ae5bebf371cf561c9d705ece0811ec4ecd9c217e14.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 393, + 482, + 459 + ], + "lines": [ + { + "bbox": [ + 304, + 393, + 482, + 459 + ], + "spans": [ + { + "bbox": [ + 304, + 393, + 482, + 459 + ], + "type": "text", + "content": "Fig.3: Illustration of SDXL architecture and our text-based analysis. To examine the effect of the i'th transformer block on the generated image, we inject a different text prompt " + }, + { + "bbox": [ + 304, + 393, + 482, + 459 + ], + "type": "inline_equation", + "content": "\\hat{p}" + }, + { + "bbox": [ + 304, + 393, + 482, + 459 + ], + "type": "text", + "content": " to it, while " + }, + { + "bbox": [ + 304, + 393, + 482, + 459 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 304, + 393, + 482, + 459 + ], + "type": "text", + "content": " is injected into all other blocks." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 165 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 165 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 165 + ], + "type": "text", + "content": "a tiger\" is injected to only one block (2 or 4), while \"A photo of a bunny\" is injected to the rest of the blocks, the generated images depict a tiger, while in all other options, the generated image will depict a bunny. Similarly, on the right we show the effect of block 5 on the generated image's color." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 137, + 188, + 304, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 188, + 304, + 199 + ], + "spans": [ + { + "bbox": [ + 137, + 188, + 304, + 199 + ], + "type": "text", + "content": "Effect of blocks 2,4 on the generated content" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 202, + 219, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 202, + 219, + 213 + ], + "spans": [ + { + "bbox": [ + 138, + 202, + 219, + 213 + ], + "type": "inline_equation", + "content": "p =" + }, + { + "bbox": [ + 138, + 202, + 219, + 213 + ], + "type": "text", + "content": " \"A photo of a bunny\"" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 213, + 216, + 222 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 213, + 216, + 222 + ], + "spans": [ + { + "bbox": [ + 138, + 213, + 216, + 222 + ], + "type": "inline_equation", + "content": "\\hat{p} =" + }, + { + "bbox": [ + 138, + 213, + 216, + 222 + ], + "type": "text", + "content": " \"A photo of a tiger\"" + } + ] + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 138, + 225, + 196, + 294 + ], + "blocks": [ + { + "bbox": [ + 138, + 225, + 196, + 294 + ], + "lines": [ + { + "bbox": [ + 138, + 225, + 196, + 294 + ], + "spans": [ + { + "bbox": [ + 138, + 225, + 196, + 294 + ], + "type": "image", + "image_path": "176a86f3e5b2fd3b803b6ec98ec01630ab18adecc4953234b11643e771c076d3.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 304, + 482, + 360 + ], + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 360 + ], + "type": "text", + "content": "Fig. 4: Prompt injection effect on the generated image. On the left, we demonstrate how blocks 2 and 4 affect the content in the generated image (turning into a tiger), whereas the rightmost image shows that injecting " + }, + { + "bbox": [ + 130, + 304, + 482, + 360 + ], + "type": "inline_equation", + "content": "\\hat{p}" + }, + { + "bbox": [ + 130, + 304, + 482, + 360 + ], + "type": "text", + "content": " to a block " + }, + { + "bbox": [ + 130, + 304, + 482, + 360 + ], + "type": "inline_equation", + "content": "i \\neq 2, 4" + }, + { + "bbox": [ + 130, + 304, + 482, + 360 + ], + "type": "text", + "content": " has no effect on the generated image. On the right we show how the fifth block controls the generated image's color." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 198, + 225, + 258, + 294 + ], + "blocks": [ + { + "bbox": [ + 198, + 225, + 258, + 294 + ], + "lines": [ + { + "bbox": [ + 198, + 225, + 258, + 294 + ], + "spans": [ + { + "bbox": [ + 198, + 225, + 258, + 294 + ], + "type": "image", + "image_path": "837c9b06a7b7538d5f732ca47ef8169813a86e07f937d30725616f1f7e4436d0.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 260, + 228, + 319, + 295 + ], + "blocks": [ + { + "bbox": [ + 260, + 228, + 319, + 295 + ], + "lines": [ + { + "bbox": [ + 260, + 228, + 319, + 295 + ], + "spans": [ + { + "bbox": [ + 260, + 228, + 319, + 295 + ], + "type": "image", + "image_path": "3634c8164d2f66de6d9ffdd76093e2ef3823877e0ca0fac881e987c953279e58.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 333, + 188, + 475, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 333, + 188, + 475, + 199 + ], + "spans": [ + { + "bbox": [ + 333, + 188, + 475, + 199 + ], + "type": "text", + "content": "Effect of block 5 on the generated color" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 342, + 204, + 441, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 342, + 204, + 441, + 213 + ], + "spans": [ + { + "bbox": [ + 342, + 204, + 441, + 213 + ], + "type": "inline_equation", + "content": "p =" + }, + { + "bbox": [ + 342, + 204, + 441, + 213 + ], + "type": "text", + "content": " \"A photo of a green bunny\"" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 342, + 214, + 437, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 342, + 214, + 437, + 223 + ], + "spans": [ + { + "bbox": [ + 342, + 214, + 437, + 223 + ], + "type": "inline_equation", + "content": "\\hat{p} =" + }, + { + "bbox": [ + 342, + 214, + 437, + 223 + ], + "type": "text", + "content": " \"A photo of a blue bunny\"" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 338, + 225, + 392, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 338, + 225, + 392, + 237 + ], + "spans": [ + { + "bbox": [ + 338, + 225, + 392, + 237 + ], + "type": "inline_equation", + "content": "I_{\\widehat{p}\\rightarrow 5,p\\rightarrow j\\neq 5}" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 413, + 228, + 445, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 413, + 228, + 445, + 236 + ], + "spans": [ + { + "bbox": [ + 413, + 228, + 445, + 236 + ], + "type": "text", + "content": "All others" + } + ] + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 338, + 237, + 397, + 294 + ], + "blocks": [ + { + "bbox": [ + 338, + 237, + 397, + 294 + ], + "lines": [ + { + "bbox": [ + 338, + 237, + 397, + 294 + ], + "spans": [ + { + "bbox": [ + 338, + 237, + 397, + 294 + ], + "type": "image", + "image_path": "1aa33f665213d679724c8c08fd2ff6512019b8e58b285b75ff5c868e37b86301.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 400, + 237, + 459, + 295 + ], + "blocks": [ + { + "bbox": [ + 400, + 237, + 459, + 295 + ], + "lines": [ + { + "bbox": [ + 400, + 237, + 459, + 295 + ], + "spans": [ + { + "bbox": [ + 400, + 237, + 459, + 295 + ], + "type": "image", + "image_path": "4379c8a81ef9cf8ca12571604ed372ee6fd57085f2ffd980ddc48d79bb4ca0a4.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + } + ], + "index": 15 + }, + { + "bbox": [ + 131, + 403, + 354, + 416 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 403, + 354, + 416 + ], + "spans": [ + { + "bbox": [ + 131, + 403, + 354, + 416 + ], + "type": "text", + "content": "4.2 LoRA-Based Separation with B-LoRA" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 426, + 482, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 473 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 473 + ], + "type": "text", + "content": "While the observations above apply to a generated image, our goal is to examine if the layers we locate could be useful in capturing the content and style of a given input image " + }, + { + "bbox": [ + 130, + 426, + 482, + 473 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 426, + 482, + 473 + ], + "type": "text", + "content": ". To fine-tune the model to generate variations of our given image we utilize the LoRA [24] approach." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "text", + "content": "Let us denote the frozen weights of our base pre-trained SDXL model with " + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "inline_equation", + "content": "W_0" + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "text", + "content": " and the learned residual matrices for each block with " + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "inline_equation", + "content": "\\Delta W^i" + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "text", + "content": ". We follow the default settings of DreamBooth LoRA [43] to finetune the model to reconstruct the given input image " + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "However, instead of optimizing the LoRA weights of all eleven blocks (as usually done), we conduct two experiments, where in the first experiment we optimize the pair " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\{\\Delta W^2, \\Delta W^5\\}" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": ", and in the second experiment we optimize " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\{\\Delta W^4, \\Delta W^5\\}" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " (as we found " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "W_0^2" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "W_0^4" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " to dominate the content, and " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "W_0^5" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " to dominate the color). In addition, we use a general prompt \"A [v]\" during training to prevent the model from being explicitly guided to capture either the image's style or content. This process and example results are depicted in Figure 5. As can be seen, we find that the best combination to optimize in terms of 1. Achieving a full reconstruction of the input concept, and 2. Capturing the input image's content, are " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\Delta W^4, \\Delta W^5" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": ". Note that using the deeper layers of the UNet " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\Delta W^4" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": ", rather than " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\Delta W^2" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " during the LoRA training process, aligns with the goal of preserving finer details in the output image, as demonstrated in [47]. We" + } + ] + } + ], + "index": 20 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "provide ablation and analysis of the effect of other layers and specific parts within them, as well as the effect of using different text prompts in the supplementary material." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 132, + 171, + 482, + 276 + ], + "blocks": [ + { + "bbox": [ + 132, + 171, + 482, + 276 + ], + "lines": [ + { + "bbox": [ + 132, + 171, + 482, + 276 + ], + "spans": [ + { + "bbox": [ + 132, + 171, + 482, + 276 + ], + "type": "image", + "image_path": "7ffdb86072d95fa06f4dd58a6e046b40a7051f4ffcc6b156dc75d8832e0cc640.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "lines": [ + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": "Fig.5: Comparison of training B-LoRAs for the input images shown on the left for " + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "inline_equation", + "content": "W_0^2" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "inline_equation", + "content": "W_0^5" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": " (middle) and " + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "inline_equation", + "content": "W_0^4" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "inline_equation", + "content": "W_0^5" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": " (right). For each pair of trained LoRA weights, we show the results of applying both together (to reconstruct the input image) and applying the content layer separately (i.e. using only " + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\Delta W^2" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\Delta W^4" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": "). The results demonstrate that " + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\Delta W^4" + }, + { + "bbox": [ + 130, + 285, + 482, + 340 + ], + "type": "text", + "content": " better captures the fine details of the input object." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 364, + 482, + 401 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 482, + 401 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 482, + 401 + ], + "type": "text", + "content": "We call such a training scheme " + }, + { + "bbox": [ + 130, + 364, + 482, + 401 + ], + "type": "inline_equation", + "content": "B\\text{-LoRA}" + }, + { + "bbox": [ + 130, + 364, + 482, + 401 + ], + "type": "text", + "content": ", as it only trains two transformer Blocks instead of the full weights. Hence, apart from the style-content separation abilities such a method also reduces storage requirements by " + }, + { + "bbox": [ + 130, + 364, + 482, + 401 + ], + "type": "inline_equation", + "content": "70\\%" + }, + { + "bbox": [ + 130, + 364, + 482, + 401 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 415, + 313, + 427 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 415, + 313, + 427 + ], + "spans": [ + { + "bbox": [ + 131, + 415, + 313, + 427 + ], + "type": "text", + "content": "4.3 B-LoRA for Image Stylization" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "spans": [ + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "text", + "content": "Combining the insights from the above analyses, we now describe the B-LoRA training approach. Given an input image " + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "text", + "content": ", we only fine-tune the LoRA weights " + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "inline_equation", + "content": "\\Delta W^4" + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "inline_equation", + "content": "\\Delta W^5" + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "text", + "content": " with the objective of reconstructing the image, w.r.t a general text prompt \"A [v]\". Besides increasing efficiency, we find that by training only these two layers, we can achieve an implicit style-content decomposition, where " + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "inline_equation", + "content": "\\Delta W^4" + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "text", + "content": " captures the content and " + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "inline_equation", + "content": "\\Delta W^5" + }, + { + "bbox": [ + 130, + 432, + 482, + 503 + ], + "type": "text", + "content": " captures the style." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 504, + 482, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 504, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 504, + 482, + 540 + ], + "type": "text", + "content": "Once we find these update matrices, we can easily use them by updating the corresponding block weights of the pre-trained SDXL model for style manipulation applications as described next and demonstrated in Figure 6." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "spans": [ + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": "Image stylization based on image style reference Given two input images " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "I_{c}, I_{s}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " depicting the desired content and style respectively, we use the process described above to learn their corresponding B-LoRA weights: " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "\\Delta W_{c}^{4}, \\Delta W_{c}^{5}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "I_{c}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "\\Delta W_{s}^{4}, \\Delta W_{s}^{5}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "I_{s}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": ". We then directly use " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "\\Delta W_{c}^{4}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "\\Delta W_{s}^{5}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " to update the transformer blocks " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "W_{0}^{4}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "inline_equation", + "content": "W_{0}^{5}" + }, + { + "bbox": [ + 130, + 548, + 482, + 621 + ], + "type": "text", + "content": " of the pre-trained network. For the inference process, we use the prompt \"A [c] in [s] style\", as illustrated at the top of Figure 6." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "Text-based image stylization By omitting " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\Delta W_{c}^{5}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": " (capturing the style of " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "I_{c}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": ") and only using " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\Delta W_{c}^{4}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": " to update the weights of the pre-trained model, we get a personalized model that is adapted to only the content of " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "I_{c}" + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": ". To manipulate the style of" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 448, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 117, + 315, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 117, + 315, + 128 + ], + "spans": [ + { + "bbox": [ + 138, + 117, + 315, + 128 + ], + "type": "text", + "content": "(1) Image stylization based on image style reference" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 140, + 130, + 478, + 210 + ], + "blocks": [ + { + "bbox": [ + 140, + 130, + 478, + 210 + ], + "lines": [ + { + "bbox": [ + 140, + 130, + 478, + 210 + ], + "spans": [ + { + "bbox": [ + 140, + 130, + 478, + 210 + ], + "type": "image", + "image_path": "8db6d57d577b08242e8184e1913987c6e0999b5a37dd18f773a63246fa6a4006.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 139, + 214, + 296, + 299 + ], + "blocks": [ + { + "bbox": [ + 139, + 214, + 296, + 299 + ], + "lines": [ + { + "bbox": [ + 139, + 214, + 296, + 299 + ], + "spans": [ + { + "bbox": [ + 139, + 214, + 296, + 299 + ], + "type": "image", + "image_path": "f76dd23ac3a7c46e4640b2cfbc2ed497d9469c3c878b81369b0138041f55c154.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "lines": [ + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": "Fig. 6: B-LoRA for Image Stylization. (1) To stylize a given content image " + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "inline_equation", + "content": "I_{c}" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": " w.r.t an given style image reference " + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "inline_equation", + "content": "I_{s}" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": ", we train our B-LoRAs for both images and then combine " + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "inline_equation", + "content": "\\Delta W_{c}^{4}" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "inline_equation", + "content": "\\Delta W_{s}^{5}" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": " to a single adapted model. (2) For text-based stylization we simply plug only the trained " + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "inline_equation", + "content": "\\Delta W_{c}^{4}" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": " to adapt the model and then use the desired text prompt during inference. (3) The learned style weights " + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "inline_equation", + "content": "\\Delta W_{c}^{5}" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": " can be also used as is to adjust the backbone model to produce images with the style of " + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "inline_equation", + "content": "I_{c}" + }, + { + "bbox": [ + 130, + 312, + 482, + 378 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 317, + 216, + 462, + 298 + ], + "blocks": [ + { + "bbox": [ + 317, + 216, + 462, + 298 + ], + "lines": [ + { + "bbox": [ + 317, + 216, + 462, + 298 + ], + "spans": [ + { + "bbox": [ + 317, + 216, + 462, + 298 + ], + "type": "image", + "image_path": "6856cbbc00e40d28f905b635011b66acaed926b303d3f6c51169df37db716277.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 403, + 482, + 452 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 452 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 452 + ], + "type": "inline_equation", + "content": "I_{c}" + }, + { + "bbox": [ + 130, + 403, + 482, + 452 + ], + "type": "text", + "content": " with text-based guidance, we simply inject the desired text into the adapted layers during inference (see Figure 6 bottom-left). Note that because the style and content are separated and encoded in different blocks, our approach allows challenging style manipulations." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "text", + "content": "Consistent style generation. Lastly, in a similar manner, one can adapt the model for a specific style provided in " + }, + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "inline_equation", + "content": "I_{s}" + }, + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "text", + "content": " by excluding " + }, + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "inline_equation", + "content": "\\Delta W_{s}^{4}" + }, + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "text", + "content": " and using only " + }, + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "inline_equation", + "content": "\\Delta W_{s}^{5}" + }, + { + "bbox": [ + 130, + 466, + 482, + 525 + ], + "type": "text", + "content": ". This results in a model adapted to the desired style, and one can use text-based conditions to generate any content with the desired style (see Figure 6 bottom-right)." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 547, + 277, + 559 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 547, + 277, + 559 + ], + "spans": [ + { + "bbox": [ + 131, + 547, + 277, + 559 + ], + "type": "text", + "content": "4.4 Implementation details" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "We train the B-LoRA weights on SDXL v1.0 [38] while keeping both the model weights and text encoders frozen during the fine-tuning process. All LoRA training was performed on a single image. We utilize the Adam optimizer with a learning rate of " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "5e - 5" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": ". For data augmentations, we only use center cropping during training. We set the LoRA weights rank to " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "r = 64" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " and use the prompt \"A [v]\" for 1000 optimization steps, requiring approximately 10 minutes per image on a single A100 GPU. Note that while other methods typically train LoRA for 400 steps to mitigate overfitting concerns, this was not an issue in our case." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 198, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 198, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 198, + 126 + ], + "type": "text", + "content": "5 Results" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 134, + 140, + 480, + 186 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 140, + 480, + 186 + ], + "spans": [ + { + "bbox": [ + 134, + 140, + 480, + 186 + ], + "type": "text", + "content": "To produce the various results of our approach we optimized our B-LoRAs " + }, + { + "bbox": [ + 134, + 140, + 480, + 186 + ], + "type": "inline_equation", + "content": "(\\Delta W^4, \\Delta W^5)" + }, + { + "bbox": [ + 134, + 140, + 480, + 186 + ], + "type": "text", + "content": " once for each image and then plugged either one of them or both of them (depending on the application) at inference time to receive image stylization without any further optimization or fine-tuning." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 188, + 481, + 366 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 188, + 481, + 366 + ], + "spans": [ + { + "bbox": [ + 133, + 188, + 481, + 366 + ], + "type": "text", + "content": "We present some qualitative results of the three applications discussed in Section 4.3 in Figure 7. In the first two rows of Figure 7, our method manages to transfer the style of the image references (top row) while preserving the content of the input image on the left. Notable, this can be done for challenging content inputs such as stylized images (first row) and images of whole scenes (second row). Our method is robust to many types of different styles and manages to preserve the essence of the content reference even in very abstract styles such as the one depicted in the third style column. In the third row, we show examples of text-based image stylization. As can be seen with our implicit style-content separation, the content of the input object is preserved well while the style is governed by the desired text prompt. In the last row, we demonstrate how our method can be used for consistent style generation where only the B-LoRA weights of the style are used. Observe that the object's style is well preserved across all text-based generated images. Please refer to the supplementary material for many more examples." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 378, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 378, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 133, + 378, + 481, + 510 + ], + "type": "text", + "content": "Comparisons We next compare our method with alternative approaches, both qualitatively and quantitatively. Note that since we rely on SDXL as our backbone model, for a fair comparison we applied alternative approaches on SDXL as well. As a naïve baseline we employ DB-LoRA [43] (fine-tuned for style) with a ControlNet [54] for content conditioning. We additionally compare to three recent approaches for image stylization that rely on the prior of large pre-trained text-to-image models, namely, ZipLoRA [44], StyleDrop [45], and StyleAligned [21]. StyleAligned is applied using the author's official implementation. With the lack of official implementations for StyleDrop and ZipLoRA, we implemented StyleDrop on SDXL (as described in [21]), and utilized a non-official implementation of ZipLoRA [33]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 510, + 481, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 510, + 481, + 593 + ], + "spans": [ + { + "bbox": [ + 133, + 510, + 481, + 593 + ], + "type": "text", + "content": "Note that for content preservation, all three alternative methods require multiple content images, while our method can be applied to a single image. Thus, for a fair comparison, we collected a total set of 23 objects from existing personalization works [14, 31, 42, 49], where a small set of images is provided for each object. We collected 20 style image references from [21, 45], along with 5 additional style images of our own. From these sets, we randomly sampled 50 pairs of style and content images to compose our final evaluation set." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 594, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 594, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 594, + 481, + 665 + ], + "type": "text", + "content": "In terms of runtime, StyleAligned is zero-shot only for consistent style generation, while for content preservation it relies on LoRA to adapt the model to the desired concepts. Similarly, StyleDrop and ZipLoRA require LoRA training for content and style. Thus, our runtime is comparable to theirs. However, ZipLoRA entails an extra training phase to merge the two LoRAs, making it more time-consuming than our approach." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 475, + 437 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 475, + 437 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 475, + 437 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 475, + 437 + ], + "type": "image", + "image_path": "ba1433f6bfa3a5754f4765f1efe8f3a9d63b901a36c431596493ad029056fdf5.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 448, + 482, + 525 + ], + "lines": [ + { + "bbox": [ + 130, + 448, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 448, + 482, + 525 + ], + "type": "text", + "content": "Fig. 7: Results produced by our method for three image stylization tasks. Rows 1-3: image style transfer. Our method can operate on scene images and extract content from a stylized image. Fourth row: text-based image stylization applied to the content image reference on the left. Note how the pose and identity are preserved well. Last row: consistent style generation, where that style is extracted from the image on the left and used to generate new objects. In this row, we use " + }, + { + "bbox": [ + 130, + 448, + 482, + 525 + ], + "type": "inline_equation", + "content": "\\alpha = 1.1" + }, + { + "bbox": [ + 130, + 448, + 482, + 525 + ], + "type": "text", + "content": " to enhance the style effect." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": "Qualitative Evaluation We show representative comparison results in Figure 8, where on the left we show the style and content reference images. On the first four rows, we show the results of alternative approaches when applied with multiple content images, whereas our method uses a single image. As can be seen, our method effectively preserves the subject from the content image while transferring the desired style. In contrast, other methods either overfit the content subject, thereby failing to alter its style (e.g., cat and sloth in ZipLoRA and StyleDrop), or they suffer from style image \"leakage\". For instance, in the cat example of StyleAligned (first row), the model generates two cats, matching" + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 112, + 484, + 376 + ], + "blocks": [ + { + "bbox": [ + 133, + 112, + 484, + 376 + ], + "lines": [ + { + "bbox": [ + 133, + 112, + 484, + 376 + ], + "spans": [ + { + "bbox": [ + 133, + 112, + 484, + 376 + ], + "type": "image", + "image_path": "6813df2515fe5bf35f1873e3db26f487d2ed971733509ee457c10e37334f9e93.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 384, + 482, + 485 + ], + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 485 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 485 + ], + "type": "text", + "content": "Fig. 8: Comparison with alternative approaches. The input style and content references are shown on the left, where multiple content images were used for alternative methods. In the last row, we applied other approaches to a single content image. ZipLoRA tends to overfit the content, and thus struggles with depicting the desired style. StyleDrop also struggles to preserve the content when trained on multiple images. In the case of a single content image (last row), both methods preserve the content but lose the style. StyleAligned preserves the style well; however, it tends to include semantic content originating in the style image, such as creating a couple in row 1. Additional comparisons to InstantStyle [51] are provided in the supplementary material." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 508, + 482, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 508, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 508, + 482, + 545 + ], + "type": "text", + "content": "the number of people in the style reference image. We also include an example of alternative methods applied to a single content image, where StyleDrop and ZipLoRA exhibit increased overfitting." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "Quantitative Evaluation We measure content and style preservation by computing the cosine similarity between the embeddings of the input content and style references and the output image, utilizing the DINO ViT-B/8 embeddings [8]. The average scores are presented in Table 1. Our method achieves the highest style alignment score, indicating its superior ability to adapt styles effectively. However, we observe lower object similarity scores, possibly due to content overfitting issues observed in alternative approaches. To further support this observation, we conducted the same experiment using a single content image as a reference (scores shown in the \"single\" row). The results indicate a decrease" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 249, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 249, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 249, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 481, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 481, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 481, + 140 + ], + "type": "text", + "content": "in style consistency scores across all methods, accompanied by an increase in content preservation scores, suggesting overfitting." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "text", + "content": "User Study We conducted a user study to further validate the findings presented above. Using 30 random images from our evaluation set, we compared our results with the three alternative approaches. The participants were presented with the reference style and content images along with two combined results, one produced by our method and the other by an alternative method (with the results presented in random order). Participants were asked to choose the result that \"better transfers the style from the style image while preserving the content of the content image\". We collected responses from 34 participants for the survey, which contained a total of 1020 answers. The results demonstrate a strong preference for our method, with " + }, + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "inline_equation", + "content": "94\\%" + }, + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "text", + "content": " of participants favoring our method over StyleAligned, " + }, + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "inline_equation", + "content": "91\\%" + }, + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "text", + "content": " over ZipLoRA, and " + }, + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "inline_equation", + "content": "88\\%" + }, + { + "bbox": [ + 130, + 160, + 482, + 293 + ], + "type": "text", + "content": " over StyleDrop." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 360, + 496, + 434 + ], + "blocks": [ + { + "bbox": [ + 130, + 316, + 482, + 351 + ], + "lines": [ + { + "bbox": [ + 130, + 316, + 482, + 351 + ], + "spans": [ + { + "bbox": [ + 130, + 316, + 482, + 351 + ], + "type": "text", + "content": "Table 1: Quantitative comparison. We measure the average cosine similarity between the DINO features of the output image and the reference style and content. Our method performs best at adapting to the style without overfitting the content image." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 360, + 496, + 434 + ], + "lines": [ + { + "bbox": [ + 133, + 360, + 496, + 434 + ], + "spans": [ + { + "bbox": [ + 133, + 360, + 496, + 434 + ], + "type": "table", + "html": "
InputStyleDropStyleAlignedZipLoRADB-LoRAOurs
Style TransferMultiple0.826 ± 0.070.855 ± 0.050.796 ± 0.070.863 ± 0.060.881 ± 0.05
Single0.790 ± 0.060.829 ± 0.050.782 ± 0.05
ContentMultiple0.817 ± 0.060.779 ± 0.050.841 ± 0.050.769 ± 0.050.790 ± 0.05
Single0.874 ± 0.080.792 ± 0.060.933 ± 0.05
", + "image_path": "a0ce3c9dd18129fb10fc28b85e06a69d84269bcb6860667785d651dbe5ca7562.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 486, + 328, + 499 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 486, + 328, + 499 + ], + "spans": [ + { + "bbox": [ + 132, + 486, + 328, + 499 + ], + "type": "text", + "content": "6 Conclusions and Future work" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 520, + 481, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 520, + 481, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 520, + 481, + 592 + ], + "type": "text", + "content": "We have presented a simple yet effective method to disentangle the style and content of a single input image. The style and content components are encoded separately with two B-LoRAs, providing high flexibility for independent use in various image stylization tasks. In contrast to existing methods that focus on style extraction, we employ a compound style-content learning approach that enables a better separation of style and content, enhancing stylization fidelity." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "As for future research, one possible avenue is to further explore separation techniques within LoRA fine-tuning, to achieve more concrete separation into sub-components such as structure, shape, color, texture, etc. This could provide users with more control over the desired output. Another direction for future work is to leverage the robustness of our approach and extend it to combine LoRA weights from multiple distinct objects or combine a few styles." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 143, + 482, + 216 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 143, + 482, + 216 + ], + "spans": [ + { + "bbox": [ + 130, + 143, + 482, + 216 + ], + "type": "text", + "content": "We would like to thank Amir Hertz and Yuval Alaluf for their insightful feedback. Additionally, some of the artistic paintings presented in this paper were created by the artist Judith Kondor Mochary. We thank the artist's family for granting us the privilege to use Judith's drawings. This work was supported by the Israel Science Foundation under Grant No. 2492/20, 3441/21 and 1390/19, and Joint NSFC-ISF Research Grant Research Grant no. 3077/23." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 236, + 197, + 249 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 236, + 197, + 249 + ], + "spans": [ + { + "bbox": [ + 133, + 236, + 197, + 249 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 264, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 138, + 264, + 480, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 264, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 138, + 264, + 480, + 308 + ], + "type": "text", + "content": "1. Agarwal, A., Karanam, S., Shukla, T., Srinivasan, B.V.: An image is worth multiple words: Multi-attribute inversion for constrained text-to-image synthesis. ArXiv abs/2311.11919 (2023), https://api-semanticscholar.org/CorpusID: 265295502" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 309, + 480, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 309, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 138, + 309, + 480, + 342 + ], + "type": "text", + "content": "2. Alaluf, Y., Garibi, D., Patashnik, O., Averbuch-Elor, H., Cohen-Or, D.: Cross-image attention for zero-shot appearance transfer. ArXiv abs/2311.03335 (2023), https://api-semanticscholar.org/CorpusID:265043677" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 343, + 480, + 376 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 343, + 480, + 376 + ], + "spans": [ + { + "bbox": [ + 138, + 343, + 480, + 376 + ], + "type": "text", + "content": "3. Alaluf, Y., Richardson, E., Metzer, G., Cohen-Or, D.: A neural space-time representation for text-to-image personalization. ACM Transactions on Graphics (TOG) 42(6), 1-10 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 376, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 376, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 376, + 480, + 418 + ], + "type": "text", + "content": "4. Arar, M., Voynov, A., Hertz, A., Avrahami, O., Fruchter, S., Pritch, Y., Cohen-Or, D., Shamir, A.: Palp: Prompt aligned personalization of text-to-image models. ArXiv abs/2401.06105 (2024), https://apisemantic scholar.org/CorpusID: 266933184" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 421, + 480, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 421, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 138, + 421, + 480, + 475 + ], + "type": "text", + "content": "5. Avrahami, O., Aberman, K., Fried, O., Cohen-Or, D., Lischinski, D.: Break-ascene: Extracting multiple concepts from a single image. In: SIGGRAPH Asia 2023 Conference Papers. SA '23, Association for Computing Machinery, New York, NY, USA (2023). https://doi.org/10.1145/3610548.3618154, https://doi.org/10.1145/3610548.3618154" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 475, + 480, + 509 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 475, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 138, + 475, + 480, + 509 + ], + "type": "text", + "content": "6. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Transactions on Graphics (TOG) 42, 1-11 (2022), https://api_semanticscholar.org/CorpusID:249394540" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "text", + "content": "7. Avrahami, O., Hertz, A., Vinker, Y., Arar, M., Fruchter, S., Fried, O., Cohen-Or, D., Lischinski, D.: The chosen one: Consistent characters in text-to-image diffusion models. arXiv preprint arXiv:2311.10093 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 544, + 480, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 586 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 586 + ], + "type": "text", + "content": "8. Caron, M., Touvron, H., Misra, I., J'egou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. 2021 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 9630-9640 (2021), https://apisemantic scholar.org/CorpusID:233444273" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 587, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 587, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 587, + 480, + 632 + ], + "type": "text", + "content": "9. Chang, H., Zhang, H., Barber, J., Maschinot, A., Lezama, J., Jiang, L., Yang, M., Murphy, K.P., Freeman, W.T., Rubinstein, M., Li, Y., Krishnan, D.: Muse: Text-to-image generation via masked generative transformers. ArXiv abs/2301.00704 (2023), https://api-semanticscholar.org/CorpusID:255372955" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "0. Chen, M., Laina, I., Vedaldi, A.: Training-free layout control with cross-attention guidance. ArXiv abs/2304.03373 (2023), https://api(semanticscholar.org/ CorpusID:258041377" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "text", + "content": "11. Couairon, G., Verbeek, J., Schwenk, H., Cord, M.: Diffedit: Diffusion-based semantic image editing with mask guidance. ArXiv abs/2210.11427 (2022), https://api-semanticscholar.org/CorpusID:253018768" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "type": "text", + "content": "12. Efros, A.A., Freeman, W.T.: Image quilting for texture synthesis and transfer. Proceedings of the 28th annual conference on Computer graphics and interactive techniques (2001), https://api_semanticscholar.org/CorpusID:9334387" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 183, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 183, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 133, + 183, + 480, + 215 + ], + "type": "text", + "content": "13. Epstein, D., Jabri, A., Poole, B., Efros, A.A., Holynski, A.: Diffusion self-guidance for controllable image generation. ArXiv abs/2306.00986 (2023), https://api.sementicscholar.org/CorpusID:258999106" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 216, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 216, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 216, + 480, + 248 + ], + "type": "text", + "content": "14. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 249, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 249, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 133, + 249, + 480, + 281 + ], + "type": "text", + "content": "15. Gandikota, R., Materzynska, J., Zhou, T., Torralba, A., Bau, D.: Concept sliders: Lora adaptors for precise control in diffusion models. ArXiv abs/2311.12092 (2023), https://api-semanticscholar.org/CorpusID:265308675" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 282, + 480, + 323 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 282, + 480, + 323 + ], + "spans": [ + { + "bbox": [ + 133, + 282, + 480, + 323 + ], + "type": "text", + "content": "16. Gatys, L.A., Ecker, A.S., Bethge, M.: Image style transfer using convolutional neural networks. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 2414-2423 (2016), https://api-semanticscholar.org/CorpusID:206593710" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 325, + 480, + 367 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 325, + 480, + 367 + ], + "spans": [ + { + "bbox": [ + 133, + 325, + 480, + 367 + ], + "type": "text", + "content": "17. Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A.C., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63, 139 - 144 (2014), https://apisemanticscholar.org/CorpusID: 1033682" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 369, + 480, + 422 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 369, + 480, + 422 + ], + "spans": [ + { + "bbox": [ + 133, + 369, + 480, + 422 + ], + "type": "text", + "content": "18. Gu, Y., Wang, X., Wu, J.Z., Shi, Y., Chen, Y., Fan, Z., Xiao, W., Zhao, R., Chang, S., Wu, W., Ge, Y., Shan, Y., Shou, M.Z.: Mix-of-show: Decentralized low-rank adaptation for multi-concept customization of diffusion models. ArXiv abs/2305.18292 (2023), https://api-semanticscholar.org/CorpusID: 258960192" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 424, + 480, + 467 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 424, + 480, + 467 + ], + "spans": [ + { + "bbox": [ + 133, + 424, + 480, + 467 + ], + "type": "text", + "content": "19. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D.N., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 7289-7300 (2023), https://apisemantic scholar.org/CorpusID:257631648" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 468, + 480, + 510 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 468, + 480, + 510 + ], + "spans": [ + { + "bbox": [ + 133, + 468, + 480, + 510 + ], + "type": "text", + "content": "20. Hertz, A., Mokady, R., Tenenbaum, J.M., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. ArXiv abs/2208.01626 (2022), https://apisemantic scholar.org/CorpusID: 251252882" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 512, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 512, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 133, + 512, + 480, + 533 + ], + "type": "text", + "content": "21. Hertz, A., Voynov, A., Fruchter, S., Cohen-Or, D.: Style aligned image generation via shared attention. arXiv preprint arXiv:2312.02133 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 534, + 480, + 565 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 534, + 480, + 565 + ], + "spans": [ + { + "bbox": [ + 133, + 534, + 480, + 565 + ], + "type": "text", + "content": "22. Hertzmann, A., Jacobs, C.E., Oliver, N., Curless, B., Salesin, D.H.: Image analogies p. 327-340 (2001). https://doi.org/10.1145/383259.383295, https://doi.org/10.1145/383259.383295" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 567, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 567, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 133, + 567, + 480, + 609 + ], + "type": "text", + "content": "23. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., de Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. ArXiv abs/1902.00751 (2019), https://api_semanticscholar.org/CorpusID: 59599816" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 610, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 610, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 133, + 610, + 480, + 643 + ], + "type": "text", + "content": "24. Hu, J.E., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Chen, W.: Lora: Low-rank adaptation of large language models. ArXiv abs/2106.09685 (2021), https://api-semanticscholar.org/CorpusID:235458009" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 643, + 480, + 665 + ], + "type": "text", + "content": "25. Huang, X., Belongie, S.J.: Arbitrary style transfer in real-time with adaptive instance normalization. 2017 IEEE International Conference on Computer Vision" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 664 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 149, + 116, + 479, + 137 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 116, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 149, + 116, + 479, + 137 + ], + "type": "text", + "content": "(ICCV) pp. 1510-1519 (2017), https://api_semanticscholar.org/CorpusID:6576859" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 480, + 182 + ], + "type": "text", + "content": "26. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 480, + 226 + ], + "type": "text", + "content": "27. Isola, P., Zhu, J.Y., Zhou, T., Efros, A.A.: Image-to-image translation with conditional adversarial networks. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 5967-5976 (2016), https://api_semanticscholar.org/CorpusID:6200260" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 228, + 480, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 480, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 480, + 259 + ], + "type": "text", + "content": "28. Jing, Y., Yang, Y., Feng, Z., Ye, J., Song, M.: Neural style transfer: A review. IEEE Transactions on Visualization and Computer Graphics 26, 3365-3385 (2017), https://api_semanticscholar.org/CorpusID:4875951" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 260, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 260, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 260, + 480, + 293 + ], + "type": "text", + "content": "29. Johnson, J., Alahi, A., Fei-Fei, L.: Perceptual losses for real-time style transfer and super-resolution. ArXiv abs/1603.08155 (2016), https://apisemantic scholar.org/CorpusID:980236" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 480, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 325 + ], + "type": "text", + "content": "30. Katzir, O., Lischinski, D., Cohen-Or, D.: Cross-domain cascaded deep translation. In: European Conference on Computer Vision (2020), https://apisemantic scholar.org/CorpusID:209315529" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 326, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 480, + 369 + ], + "type": "text", + "content": "31. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1931-1941 (2022), https://api-semanticscholar.org/CorpusID:254408780" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "text", + "content": "32. Li, S., van de Weijer, J., Hu, T., Khan, F.S., Hou, Q., Wang, Y., Yang, J.: Stylediffusion: Prompt-embedding inversion for text-based editing. ArXiv abs/2303.15649 (2023), https://api-semanticscholar.org/CorpusID:257771440" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 403, + 440, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 440, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 440, + 413 + ], + "type": "text", + "content": "33. mkshing:Ziplora-pytorch.https://github.com/mkshing/ziplora-pytorch" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 414, + 480, + 467 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 414, + 480, + 467 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 480, + 467 + ], + "type": "text", + "content": "34. Mokady, R., Hertz, A., Aberman, K., Pritch, Y., Cohen-Or, D.: Null-text inversion for editing real images using guided diffusion models. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 6038-6047. IEEE (2023). https://doi.org/10.1109/CVPR52729.2023.00585, https://doi.org/10.1109/CVPR52729.2023.00585" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 468, + 480, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 480, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 480, + 501 + ], + "type": "text", + "content": "35. Park, T., Efros, A.A., Zhang, R., Zhu, J.Y.: Contrastive learning for unpaired image-to-image translation. In: European Conference on Computer Vision (2020), https://api-semanticscholar.org/CorpusID:220871180" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 502, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 502, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 502, + 480, + 533 + ], + "type": "text", + "content": "36. Parmar, G., Singh, K.K., Zhang, R., Li, Y., Lu, J., Zhu, J.Y.: Zero-shot image-to-image translation. ACM SIGGRAPH 2023 Conference Proceedings (2023), https://api-semanticscholar.org/CorpusID:256616002" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 534, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 480, + 566 + ], + "type": "text", + "content": "37. Po, R., Yang, G., Aberman, K., Wetzstein, G.: Orthogonal adaptation for modular customization of diffusion models. ArXiv abs/2312.02432 (2023), https://api.sementicscholar.org/CorpusID:265659333" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 567, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 480, + 609 + ], + "type": "text", + "content": "38. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Muller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. ArXiv abs/2307.01952 (2023), https://api(semanticscholar.org/ CorpusID:259341735" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 610, + 480, + 664 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 480, + 664 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 480, + 664 + ], + "type": "text", + "content": "39. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning (2021), https://api_semanticscholar.org/CorpusID: 231591445" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 481, + 664 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "40. Research, F.: Cog sdxl canny controlnet with lora support. https://replicate.com/batouresearch/sdxl-controlnet-lora" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 481, + 183 + ], + "type": "text", + "content": "41. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10674-10685 (2021), https://api-semanticscholar.org/CorpusID:245335280" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 481, + 228 + ], + "type": "text", + "content": "42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 229, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 229, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 481, + 251 + ], + "type": "text", + "content": "43. Ryu, S.: Low-rank adaptation for fast text-to-image diffusion fine-tuning. https://github.com/cloneofsimo/lora" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 252, + 481, + 284 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 252, + 481, + 284 + ], + "spans": [ + { + "bbox": [ + 132, + 252, + 481, + 284 + ], + "type": "text", + "content": "44. Shah, V., Ruiz, N., Cole, F., Lu, E., Lazebnik, S., Li, Y., Jampani, V.:Ziplora: Any subject in any style by effectively merging loras. arXiv preprint arXiv:2311.13600 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 285, + 481, + 318 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 481, + 318 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 481, + 318 + ], + "type": "text", + "content": "45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., Hao, Y., Essa, I., Rubinstein, M., Krishnan, D.: Styledrop: Text-to-image generation in any style (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 319, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 319, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 319, + 481, + 363 + ], + "type": "text", + "content": "46. Tenenbaum, J., Freeman, W.: Separating style and content. In: Mozer, M., Jordan, M., Petsche, T. (eds.) Advances in Neural Information Processing Systems. vol. 9. MIT Press (1996), https://proceedings.neurips.cc/paper_files/paper/1996/file/70222949cc0db89ab32c9969754d4758-Paper.pdf" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 364, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 364, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 364, + 481, + 407 + ], + "type": "text", + "content": "47. Tumanyan, N., Geyer, M., Bagon, S., Dekel, T.: Plug-and-play diffusion features for text-driven image-to-image translation. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 1921-1930 (2022), https://apisemantic scholar.org/CorpusID:253801961" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 409, + 481, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 409, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 409, + 481, + 441 + ], + "type": "text", + "content": "48. Vaswani, A., Shazeer, N.M., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Neural Information Processing Systems (2017), https://api-semanticscholar.org/CorpusID:13756489" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 442, + 481, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 442, + 481, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 442, + 481, + 475 + ], + "type": "text", + "content": "49. Vinker, Y., Voynov, A., Cohen-Or, D., Shamir, A.: Concept decomposition for visual exploration and inspiration. ACM Trans. Graph. 42(6) (dec 2023). https://doi.org/10.1145/3618315, https://doi.org/10.1145/3618315" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 476, + 481, + 498 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 476, + 481, + 498 + ], + "spans": [ + { + "bbox": [ + 132, + 476, + 481, + 498 + ], + "type": "text", + "content": "50. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: " + }, + { + "bbox": [ + 132, + 476, + 481, + 498 + ], + "type": "inline_equation", + "content": "p+" + }, + { + "bbox": [ + 132, + 476, + 481, + 498 + ], + "type": "text", + "content": ": Extended textual conditioning in text-to-image generation. arXiv preprint arXiv:2303.09522 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 498, + 481, + 541 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 481, + 541 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 481, + 541 + ], + "type": "text", + "content": "51. Wang, H., Spinelli, M., Wang, Q., Bai, X., Qin, Z., Chen, A.: Instantstyle: Free lunch towards style-preserving in text-to-image generation. ArXiv abs/2404.02733 (2024), https://api_semanticscholar.org/CorpusID: 268876474" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 543, + 481, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 481, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 481, + 586 + ], + "type": "text", + "content": "52. Yang, S., joo Hwang, H., Ye, J.C.: Zero-shot contrastive loss for text-guided diffusion image style transfer. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 22816-22825 (2023), https://apisemantic scholar.org/CorpusID:257532402" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 588, + 481, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 481, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 481, + 620 + ], + "type": "text", + "content": "53. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. ArXiv abs/2308.06721 (2023), https://api.sementicscholar.org/CorpusID:260886966" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 622, + 481, + 664 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 481, + 664 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 481, + 664 + ], + "type": "text", + "content": "54. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. 2023 IEEE/CVF International Conference on Computer Vision (ICCV) pp. 3813-3824 (2023), https://api-semanticscholar.org/CorpusID:256827727" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "Frenkel et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 238 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 160 + ], + "type": "text", + "content": "55. xin Zhang, Y., Huang, N., Tang, F., Huang, H., Ma, C., Dong, W., Xu, C.: Inversion-based style transfer with diffusion models. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 10146-10156 (2022), https://api-semanticscholar.org/CorpusID:257427673" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 161, + 482, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 482, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 482, + 194 + ], + "type": "text", + "content": "56. Zhang, Y., Dong, W., Tang, F., Huang, N., Huang, H., Ma, C., Lee, T.Y., Deussen, O., Xu, C.: Prospect: Prompt spectrum for attribute-aware personalization of diffusion models. ACM Transactions on Graphics (TOG) 42(6), 1-14 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 482, + 238 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 482, + 238 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 482, + 238 + ], + "type": "text", + "content": "57. Zhu, J.Y., Park, T., Isola, P., Efros, A.A.: Unpaired image-to-image translation using cycle-consistent adversarial networks. 2017 IEEE International Conference on Computer Vision (ICCV) pp. 2242-2251 (2017), https://api_semanticscholar.org/CorpusID:206770979" + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 248, + 91, + 447, + 102 + ], + "type": "text", + "content": "Implicit Style-Content Separation using B-LoRA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_content_list.json b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..15e6fee2ee5cfe202a25516283623d2025e0da49 --- /dev/null +++ b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_content_list.json @@ -0,0 +1,1676 @@ +[ + { + "type": "text", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "text_level": 1, + "bbox": [ + 259, + 141, + 743, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yuanwen Yue $^{1}$ , Anurag Das $^{2}$ , Francis Engelmann $^{1,3}$ , Siyu Tang $^{1}$ , and Jan Eric Lenssen $^{2}$", + "bbox": [ + 310, + 210, + 691, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ ETH Zurich", + "bbox": [ + 393, + 253, + 488, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 Google", + "bbox": [ + 547, + 253, + 611, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 Max Planck Institute for Informatics, Saarland Informatics Campus", + "bbox": [ + 267, + 268, + 733, + 284 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/04aa4d9f1fade7e93f04254bdcdfa8d1c4e2384d2fac7c1da9ba814264b84a64.jpg", + "image_caption": [ + "Fig. 1: We propose 3D-aware fine-tuning to improve 2D foundation features. Our method starts with lifting 2D image features (e.g. DINOv2 [42]) (b) to a 3D representation. Then we finetune the 2D foundation model using the 3D-aware features (c). We demonstrate that incorporating the fine-tuned features (d) results in improved performance on downstream tasks such as semantic segmentation and depth estimation on a variety of datasets with simple linear probing (right). Feature maps are visualized using principal component analysis (PCA)." + ], + "image_footnote": [], + "bbox": [ + 217, + 290, + 781, + 455 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Current visual foundation models are trained purely on unstructured 2D data, limiting their understanding of 3D structure of objects and scenes. In this work, we show that fine-tuning on 3D-aware data improves the quality of emerging semantic features. We design a method to lift semantic 2D features into an efficient 3D Gaussian representation, which allows us to re-render them for arbitrary views. Using the rendered 3D-aware features, we design a fine-tuning strategy to transfer such 3D awareness into a 2D foundation model. We demonstrate that models fine-tuned in that way produce features that readily improve downstream task performance in semantic segmentation and depth estimation through simple linear probing. Notably, though fine-tuned on a single indoor dataset, the improvement is transferable to a variety of indoor datasets and out-of-domain datasets. We hope our study encourages the community to consider injecting 3D awareness when training 2D foundation models. Project page: https://ywyue.github.io/FiT3D.", + "bbox": [ + 259, + 590, + 743, + 800 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Representation learning $\\cdot$ Foundation models $\\cdot$ Gaussian splatting $\\cdot$ Scene understanding", + "bbox": [ + 259, + 811, + 741, + 840 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 143, + 374, + 160 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Ever since the emergence of deep neural networks, vision systems are largely trained on 2D datasets. With the scalability of recent architectures, like vision transformers (ViT) [13], several large vision models [7, 24, 33, 42, 47] have been trained from a rich set of 2D images by either supervised or self-supervised learning. Visual foundation models have shown impressive utility as general feature extractors that can be applied to improve results on downstream tasks, such as segmentation [36, 53], depth estimation [30, 48, 59], or correspondence estimation [1, 61]. They are trained on a large amount of readily available 2D images and, thus, learn statistics about object and scene structure in 2D-pixel space.", + "bbox": [ + 212, + 185, + 785, + 321 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Images, as a simple projection of our 3D world, are easy to obtain and provide an efficient way to depict the visual world while at the same time discarding explicit 3D geometry information. It is expected that vision systems purely trained on 2D images cannot fully understand the underlying 3D structure of our world [15]. There are several promising properties of our 3D world, for example, multi-view consistency, and multi-view fusion for solving single-view ambiguities. A crucial limitation of the training setups of these models is that they don't fully reason about the 3D structure of seen objects. Training images are presented to the network in an unstructured way, without any multi-view or video correspondences that would allow matching observations of the same object from multiple views. As a consequence, these models have limited 3D understanding of objects observed from, e.g., different views are not producing view-consistent features.", + "bbox": [ + 212, + 323, + 785, + 503 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In contrast, when we humans observe images, we effortlessly achieve a holistic understanding by not only perceiving the 2D visual content but also exploiting the inferred underlying 3D structure, which we have learned through lifelong observation of stereo and temporal information. In this work, we investigate if large scale 2D vision models can also profit from equipping them with such 3D-aware understanding abilities induced by showing the right type of data.", + "bbox": [ + 212, + 506, + 785, + 595 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To this end, we design a novel two-stage approach to improve the 3D-aware understanding ability of 2D foundation models. In the first stage, we aim to obtain 3D-aware features as training data. Motivated by recent advancements in neural scene representation, we design an approach to lift multi-view 2D foundation features into an efficient 3D Gaussian representation [31]. The lifting process exploits multi-view consistency and allows 2D features from different views to complement each other. Moreover, the fused features (Fig. 1 (c)) exhibit high resolution with fine details thanks to the learned 3D structure, emerging from multi-view RGB guidance. Once trained, the 3D Gaussians can render features for arbitrary views. In the following, we refer to features obtained in this way as 3D-aware. In the second stage, we utilize the rendered 3D-aware features to finetune the 2D foundation models (Fig. 2). To this end, we design an efficient fine-tuning strategy to transfer such 3D awareness into 2D foundation models. After fine-tuning, we evaluate the feature quality on downstream tasks that might profit from a better 3D understanding, namely semantic segmentation and depth estimation. Extensive experiments demonstrate that incorporating the", + "bbox": [ + 212, + 598, + 785, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/b3754b65b13c984389f68646b9887a99df5d427e84389964537e86f319004f3b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 217, + 162, + 313, + 226 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/227c57ea9e5af033e5cfa4066f237c1cb4332f55d82e3f2936cd3018b916e127.jpg", + "image_caption": [ + "Fig. 2: Our 3D-aware fine-tuning is universal and applicable to a variety of 2D vision models, e.g. DINOv2 [42], DINOv2-reg [10], CLIP [46], MAE [24], and DeiT-III [54] (c.f. Sec. 4.5)." + ], + "image_footnote": [], + "bbox": [ + 313, + 132, + 406, + 258 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/b33a561685e6564c8dc854bec3ce01b6188e816a513a93a22a4d8e5abdbdc2d5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 408, + 132, + 501, + 258 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/2fe8207f02239bef4cf3f3a48cf57eac03d0190526ec365bf19e6f9f7c4a5ea6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 503, + 132, + 596, + 258 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/8c2feaf1b2576248a81f66a0eb400cb78cc84d62072ce6a642c0648f649a45b6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 598, + 132, + 689, + 258 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/1d4b9573cbb17e18b3789b5514ff8d4b3cdb444f8e6ce9a149a9dc1387023b5d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 691, + 132, + 784, + 258 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3D-aware features improves downstream tasks with simple linear probing and exhibits generalization ability on out-of-domain datasets.", + "bbox": [ + 212, + 332, + 782, + 362 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 214, + 382, + 387, + 398 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We give an overview about recent self-supervised 2D representation learning techniques in Sec. 2.1, and how emerging features have been distilled into 3D representations in Sec. 2.2. Then, we discuss previous work that utilizes 3D information to improve 2D representation methods in Sec. 2.3.", + "bbox": [ + 212, + 411, + 784, + 470 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 2D Representation Learning", + "text_level": 1, + "bbox": [ + 214, + 491, + 495, + 506 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Representation learning [4] has achieved remarkable progress in the image domain. It aims to learn generalizable visual features from a rich set of data. Self-supervised representation learning has gained particular interest since it does not require labeled data. Early works employ pretext tasks for pre-training, which aim to exploit inherent data attributes to automatically generate surrogate labels [12,14,20,41,43,56]. Later, contrastive learning [23] has been popularly used for representation learning by leveraging discriminative signals between images or groups of images [6,7,21,25,42]. More recently, motivated by BERT [11], a new paradigm of masked image modeling [3,8,24] has been proposed for scalable visual learning. Nevertheless, all those methods are only trained on 2D image data, without accessing the underlying 3D structure. Our work aims to supplement the features purely learned from 2D observations with 3D awareness.", + "bbox": [ + 212, + 512, + 787, + 693 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.2 Distilled Feature Fusion Fields", + "text_level": 1, + "bbox": [ + 214, + 712, + 514, + 726 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Neural radiance fields (NeRF) [40] emerge as a promising scene representation for high-quality 3D reconstruction and novel view synthesis. Recently, some works [16,32,34,55] explore distilling pre-trained image features (e.g. DINO [7], CLIP [46], LSeg [35], or OpenSeg [19]) into NeRF via neural rendering. Without requiring any labels, such distilled feature fusion fields enable several zero-shot 3D scene understanding tasks, e.g. segmentation, scene editing, and open-vocabulary queries. We share similar inspiration from these works by distilling", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 294, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2D features into a 3D representation. However, instead of focusing on perception tasks with feature fields, we are interested in leveraging the rendered 3D-aware features to in turn improve the 2D feature extractor. We demonstrate that the transferred 3D awareness can readily improve the 2D features on both semantic and geometric tasks. Moreover, we extend the recent Gaussian-based representation [31] by designing a method to distill 2D features into 3D Gaussians while keeping high efficiency and memory under bound. There are several concurrent works introducing 3D Gaussians with semantic features [45, 50, 63]. However, none of these works distill features back into 2D models. Our work shows, for the first time, that semantic features fused into 3D representations can effectively improve 2D foundation models via fine-tuning.", + "bbox": [ + 215, + 146, + 785, + 311 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.3 Injecting 3D Priors to 2D", + "text_level": 1, + "bbox": [ + 215, + 334, + 472, + 349 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Existing works mainly focus on fusing multi-view 2D features into the 3D representation [22, 28, 29, 39, 44, 49, 52, 57]. Little attention has been paid to the other direction of incorporating 3D awareness into 2D representation learning. Pri3D [27] uses geometric constraints (multi-view consistency and 2D-3D correspondence) from RGB-D reconstructions to learn 3D priors for image-based representations with contrastive learning. Recently, inspired by the masked autoencoder (MAE) [24], several works adopt the masked image modeling strategy to learn 3D priors [2, 26, 58]. However, all these methods require pre-training the 2D feature extractor, typically a Vision Transformer (ViT) backbone [13], using their hand-crafted pretext tasks. The pre-trained models are then employed to downstream tasks via fine-tuning. By contrast, we aim to transfer the 3D awareness embedded in multi-view fused features to the 2D feature extractor through fine-tuning with little computational resources. Our 3D-aware features readily improve downstream task performance with simple linear probing.", + "bbox": [ + 215, + 359, + 785, + 571 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 594, + 328, + 609 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we introduce our method for fine-tuning 2D foundation models with 3D-aware features. We present a two-stage pipeline (c.f. Fig 3). In the first stage, we lift multi-view inconsistent 2D features into a multi-view consistent and 3D-aware representation. The representation and setup are described in Sec. 3.1. In the second stage, we use the obtained 3D-aware feature representations as training dataset to fine-tune the 2D feature extractor, which is detailed in Sec. 3.2. Last, we describe the linear probing methodology for feature evaluation in Sec. 3.3.", + "bbox": [ + 215, + 626, + 785, + 744 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Lifting Features to 3D", + "text_level": 1, + "bbox": [ + 215, + 768, + 444, + 784 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Lifting semantic 2D features into 3D has been a trend recently and several different options exist (c.f. Sec. 2). For our purposes of using larger amounts of scenes as training data for 2D models, the most important aspect is efficiency.", + "bbox": [ + 215, + 794, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/ebf36e2a62f9a4d9a86cf2d3e374844078fff5dc0d003f7b3ddffceee9fb3ca0.jpg", + "image_caption": [ + "Fig. 3: Overall pipeline. We present a two-stage pipeline. In the first state, we lift 2D foundation features (e.g. DINOv2 [42]) into 3D-aware features by training 3D Gaussian representation $\\mathcal{G}_i$ . In the second stage, we use the rendered features to finetune the 2D foundation model $\\varepsilon^{2D}$ . With $\\rightarrow$ we denote gradient flow." + ], + "image_footnote": [], + "bbox": [ + 215, + 143, + 549, + 273 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/8a1fd794d49723b424caeb61a845d58e125b6ef5c07a914f7e5757861a50f53e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 558, + 143, + 787, + 273 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The representation needs to (1) be able to efficiently fit a large number of scenes into 3D representations and (2) have a fast rendering mechanism for efficient integration into a fine-tuning loop of a 2D foundation model. Thus, we utilize the recent advances in 3D Gaussian splatting [31], which enable fast optimization and real-time rendering. Fig. 4 illustrates how we extend Gaussian splatting to lift 2D foundation features and we detail the method below.", + "bbox": [ + 212, + 369, + 782, + 458 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3D feature Gaussians. Adapting the formulation of 3D Gaussian splatting [31], we define a set of 3D Gaussians as", + "bbox": [ + 214, + 462, + 782, + 492 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {G} = \\left\\{\\left(\\boldsymbol {\\mu}, \\mathbf {s}, \\mathbf {R}, \\alpha , \\mathbf {S H}, \\mathbf {f}\\right) _ {j}\\right) \\} _ {1 \\leq j \\leq M}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 503, + 785, + 522 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\pmb{\\mu} \\in \\mathbb{R}^3$ is the 3D mean of the Gaussian, $\\mathbf{S} = \\mathrm{diag}(\\mathbf{s}) \\in \\mathbb{R}^{3 \\times 3}$ is the Gaussian scale, $\\mathbf{R} \\in \\mathbb{R}^{3 \\times 3}$ its orientation, $\\alpha \\in \\mathbb{R}$ is a per-Gaussian opacity, and $\\mathbf{SH}$ a vector of spherical harmonic coefficients, encoding view-dependent color. The Gaussian covariance matrix is obtained by combining scale and orientation as $\\pmb{\\Sigma} = \\mathbf{RSS}^\\top \\mathbf{R}^\\top$ . In addition to the original parameters, we introduce a per-Gaussian feature vector $\\mathbf{f} \\in \\mathbb{R}^D$ to store distilled 2D features in 3D space. Those feature vectors are rasterized into a 2D feature image with our designed feature rasterizer. Inspired by the differentiable color rasterizer of Gaussian splatting, we rasterize the features using point-based $\\alpha$ -blending as follows:", + "bbox": [ + 214, + 530, + 787, + 667 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {F} ^ {\\text {l o w}} = \\sum_ {i \\in \\mathcal {N}} \\mathbf {f} _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {i}) \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 401, + 678, + 785, + 720 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathcal{N}$ is a set of ordered Gaussians overlapping the pixel, $\\mathbf{f}_i$ is the feature of each Gaussian and $\\alpha_{i}$ is given by evaluating a 2D Gaussian with covariance $\\pmb{\\Sigma}$ multiplied with a learned per-point opacity.", + "bbox": [ + 212, + 729, + 782, + 775 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Up-projecting features. A strong limitation of 3D Gaussians as representation is their memory consumption. Since there can be millions of Gaussians per scene, it is impossible to store, e.g., the 384-dimensional DINO features directly on each of the 3D Gaussians. Therefore, to stay memory efficient and keep the fast", + "bbox": [ + 214, + 779, + 782, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 294, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/7364ad014cf79b5ff1febe8e7d90b162b8b1fefa56ebf54615ee9449ce9e032f.jpg", + "image_caption": [ + "Fig. 4: Lifting 2D features into 3D Gaussian representation. We equip each Gaussian with a low-dimensional feature vector $\\mathbf{f}$ . We render colors using the same color rasterizer as Gaussian splatting [31]. We design a feature rasterizer to render a low-dimensional feature image $\\mathbf{F}^{\\mathrm{low}}$ , which is subsequently projected to a high-dimensional feature image $\\mathbf{F}^{\\mathrm{high}}$ using a simple CNN. We use 2D foundation features $\\mathbf{F}$ from model $\\varepsilon^{2\\mathrm{D}}$ to supervise the feature learning." + ], + "image_footnote": [], + "bbox": [ + 222, + 157, + 781, + 309 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "rendering process, we opt for storing lower dimensional features $\\mathbf{f} \\in \\mathbb{R}^{D}$ with $D \\ll 384$ and train a scene-specific pixel-space CNN decoder $d: \\mathbf{F}^{\\mathrm{low}} \\mapsto \\mathbf{F}^{\\mathrm{high}}$ to up-project feature images into high-dimensional feature space after rendering. We analyze the trade-off introduced by this approach in Sec. 4.6.", + "bbox": [ + 212, + 449, + 787, + 510 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Optimization. For a given scene, the full 3D Gaussian representation, including our distilled features, is obtained using optimization. Let $\\{\\mathbf{I}_i\\}_{1\\leq i\\leq N}$ be a set of multi-view images of a scene with corresponding camera parameters, $\\{\\mathbf{F}_i\\}_{1\\leq i\\leq N}$ a corresponding set of feature maps from a 2D feature extractor (e.g. DINOv2 [42]), and $r^{\\mathrm{rgb}}$ , $r^{\\mathrm{feat}}$ rasterization functions that render a set of Gaussians into an RGB or feature image, respectively, using the camera pose $\\mathbf{P}_i$ of image $i$ . Then, we optimize the Gaussian parameters, to optimally represent images $\\mathbf{I}_i$ and feature images $\\mathbf{F}_i$ :", + "bbox": [ + 212, + 517, + 787, + 640 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\mathcal {G}} = \\underset {\\{(\\boldsymbol {\\mu}, \\mathbf {s}, \\mathbf {R}, \\alpha , \\mathbf {S H}, \\mathbf {f}) _ {i} \\}} {\\arg \\min } \\sum_ {i = 1} ^ {N} \\mathcal {L} ^ {c} (r ^ {\\mathrm {r g b}} (\\mathcal {G}, \\mathbf {P} _ {i}), \\mathbf {I} _ {i}) + \\mathcal {L} ^ {f} (d (r ^ {\\mathrm {f e a t}} (\\mathcal {G}, \\mathbf {P} _ {i}), \\mathbf {F} _ {i}), \\quad (3)\n$$\n", + "text_format": "latex", + "bbox": [ + 259, + 657, + 785, + 700 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathcal{L}^c$ is a pixel-wise $l_{1}$ loss combined with a D-SSIM term on RGB images, and $\\mathcal{L}^f$ is a pixel-wise $l_{1}$ loss on feature images. Notably, we only optimize $\\mathbf{f}$ with gradients coming from $\\mathcal{L}^f$ (feature images) and the rest of the parameters only on $\\mathcal{L}^c$ (RGB loss). This has proven to be essential to obtain a consistent 3D feature representation, as a loss from feature space does not lead to correct Gaussian mean, covariance and opacity. We speculate that the reason for this is the missing 3D consistency of the 2D feature extractor. Only through forcing them into a 3D consistent representation, we make them consistent in return.", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 5 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1 3D-aware fine-tuning algorithm" + ], + "code_body": "Input: Pre-trained Feature Gaussian representations $\\{\\mathcal{G}_1,\\dots,\\mathcal{G}_K\\}$ , pre-trained 2D feature extractor $\\varepsilon_{\\theta}^{2D}$ , a set of images $\\{\\mathbf{I}_i\\}_{i=1}^N$ and associated camera poses $\\{\\mathbf{P}_i\\}_{i=1}^N$ . \nOutput: Fine-tuned 2D feature extractor $\\varepsilon_{\\hat{\\theta}}^{2D}$ . \n1: Load $\\mathcal{G} \\sim \\{\\mathcal{G}_1,\\dots,\\mathcal{G}_K\\}$ \n2: while fine-tuning do \n3: Sample an image $\\mathbf{I}_i$ and camera pose $\\mathbf{P}_i$ , $i \\sim \\mathcal{U}\\{1,N\\}$ \n4: Retrieve associated feature Gaussian $\\mathcal{G}$ and CNN decoder $d$ \n5: Render $\\mathbf{F}^{\\mathrm{high}} \\gets d(r^{\\mathrm{feat}}(\\mathcal{G},\\mathbf{P}_i))$ \n6: Step $\\theta$ by minimizing $\\mathcal{L}(\\varepsilon_{\\theta}^{2D}(\\mathbf{I}_i),\\mathbf{F}^{\\mathrm{high}})$ \n7: end while \nreturn $\\varepsilon_{\\hat{\\theta}}^{2D}$", + "bbox": [ + 215, + 164, + 785, + 324 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 3D-Aware Fine-Tuning", + "text_level": 1, + "bbox": [ + 215, + 354, + 450, + 371 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The procedure described in the last section is used to fit 3D feature Gaussian representations of $K$ scenes. The algorithm of 3D-aware fine-tuning is outlined in Algorithm 1. The fine-tuning process requires training pairs of original 2D feature maps and 3D-aware feature maps. Since it is memory-intensive to save the feature maps, we generate the training pairs on the fly. Considering it is time-consuming to load each pre-trained Gaussian when rendering features, we pre-load all the Gaussians into CPU memory. In each step of the training loop, we randomly sample a view from all the training images, then retrieve its associated feature Gaussian and scene-specific CNN decoder and finally render features $\\mathbf{F}^{\\mathrm{high}}$ as the ground truth features for fine-tuning. The fine-tuning loss is a $l_{1}$ loss between $\\mathbf{F}^{\\mathrm{high}}$ (resized) and the output features of the fine-tuned 2D feature extractor.", + "bbox": [ + 212, + 383, + 787, + 549 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The above design makes the fine-tuning process efficient and keeps memory consumption under control. Notably, we only need to fine-tune the 2D feature extractor with a small number of epochs (e.g. 1 epoch for DINOv2 [42]) with a small learning rate without additionally introducing any network component. The fine-tuning process is fast and computation-friendly. An analysis of fine-tuning time is in Sec. 4.6.", + "bbox": [ + 212, + 551, + 787, + 642 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Linear Probing for Downstream Tasks", + "text_level": 1, + "bbox": [ + 215, + 667, + 578, + 681 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "After fine-tuning on 3D-aware features, we evaluate the emerging features on a set of standard benchmark downstream tasks. To this end, we train a linear head on top of the features to solve tasks of semantic segmentation and depth estimation on several datasets.", + "bbox": [ + 212, + 695, + 785, + 756 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Semantic segmentation. A linear layer is trained to predict class logits from patch tokens. The linear layer produces a low-resolution logit map, which is then upsampled to full resolution to obtain a segmentation map.", + "bbox": [ + 212, + 758, + 785, + 806 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Depth estimation. We concatenate the [CLS] token of the ViT to each patch token. We divide the depth prediction range into 256 uniformly distributed", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 294, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "bins [5] and use a linear normalization. Then a simple linear layer is trained using a classification loss.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Feature assembly. We concatenate original 2D features with our fine-tuned features. We observe this is key to preserving the generalization ability of the original 2D feature extractor while incorporating the 3D awareness in our fine-tuned features. Different strategies for feature assembly are evaluated in Sec. 4.6.", + "bbox": [ + 212, + 180, + 784, + 239 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 262, + 375, + 279 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Datasets", + "text_level": 1, + "bbox": [ + 214, + 292, + 333, + 306 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Training. We train the feature Gaussians on ScanNet++ [60], which is a large-scale dataset of 3D indoor scenes containing sub-millimeter resolution laser scans, registered DSLR images, and commodity RGB-D streams from iPhone. We train on the official training split of 230 scenes, which contain 140451 views.", + "bbox": [ + 212, + 316, + 782, + 377 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Evaluation. To examine the effectiveness of the fine-tuned features, we conduct extensive experiments on downstream 2D tasks including semantic segmentation and depth estimation. There is no direct competitor in our study and we instead focus on whether our 3D-aware fine-tuning can bring performance gains compared with the standard 2D feature extractor. We conduct most of the experiments with DINOv2 [42] while also demonstrating the generality of our approach with other vision models in Sec. 4.5. We first evaluate on ScanNet++ [60] validation set, which contains 50 scenes with 30638 images. Then we move on to other indoor datasets ScanNet [9] and NYUd [51]. which have a similar data distribution with ScanNet++ but were captured with different sensors. To investigate the generalization ability of the fine-tuned features, we also perform out-of-domain evaluation on generally distributed datasets including ADE20k [62], Pascal VOC [17] and the outdoor dataset KITTI [18].", + "bbox": [ + 212, + 380, + 787, + 579 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Implementation Details", + "text_level": 1, + "bbox": [ + 214, + 597, + 455, + 613 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Feature Gaussians. We wrote custom CUDA kernels for feature rasterization. Each Gaussian is initialized with a random feature vector of dimension of 64. We implement the up-projecting CNN with a single convolutional layer with a kernel size of $3 \\times 3$ . We train the feature Gaussians of each scene for novel view synthesis and feature rendering jointly for 30000 iterations.", + "bbox": [ + 212, + 621, + 782, + 696 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Fine-tuning. We finetune DINOv2 small with a feature dimension of 384 with a batch size of 2 with a learning rate of 1e-5 for 1 epoch. We use horizontal flip as data augmentation. We use the AdamW [38] optimizer with a weight decay factor 1e-4. The fine-tuning on a single Nvidia Tesla A100 takes 8.5 hours.", + "bbox": [ + 212, + 700, + 782, + 761 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Linear probing. We follow the linear probing protocol with DINOv2 [42] to ensure a fair comparison. For semantic segmentation, we train the linear layer for 40K iterations with 8 GPUs. For depth estimation, we train the linear layer for 38400 iterations with 8 GPUs. In addition, we use the same data augmentation and learning rate schedule with DINOv2.", + "bbox": [ + 212, + 763, + 782, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 Within-domain Evaluation", + "text_level": 1, + "bbox": [ + 215, + 146, + 480, + 161 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Quantitative comparison. We demonstrate the effectiveness of incorporating our 3D-aware features on downstream semantic segmentation (see Tab. 1) and depth estimation task (see Tab. 2) for indoor scenes. For semantic segmentation task, our 3D aware features consistently improve DINOv2 features, achieving a significant performance gain of $2.6\\%$ , $2.0\\%$ mIoU, and $1.2\\%$ on ScanNet++ [60], NYUv2 [51] and ScanNet [9] datasets, respectively. Our 3D-aware DINOv2 features also improve performance on the depth estimation task. In particular, our enhanced features consistently reduce the RMSE across datasets by achieving 0.34 vs. 0.37 (DINOv2) for ScanNet++ [60], 0.42 vs. 0.44 (DINOv2) for NYUv2 [51] and 0.29 vs. 0.31 (DINOv2) for ScanNet [9] datasets.", + "bbox": [ + 212, + 176, + 787, + 329 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Qualitative comparison. We qualitatively show the benefits of 3D-aware features in Fig. 5 and Fig. 6. We observe the improvements are mainly reflected in two aspects: (1) cleaner segmentation/depth estimation in homogeneous or textureless regions, e.g. on walls and boards, and (2) better prediction with fine-grained details, e.g. on legs of chairs or tables. For (1), during the lifting of 2D features to 3D, features from multiple views are aggregated into a holistic representation, thus information from one view implicitly complements other views. We hypothesize that such multi-view awareness is transferred to DINOv2 through fine-tuning. By contrast, standard DINOv2 struggles to infer accurate segmentation or depth from a single image when with ambiguity, thus leading to noisy prediction. For (2), in our feature lifting process, we train the geometry properties (e.g. position and opacity) of Gaussians with RGB color as supervision. The RGB guidance helps feature Gaussians learn detailed 3D structure and render high-resolution feature maps (c.f. Fig. 1 (c)). During the fine-tuning process, the model learns to estimate fine-grained features of objects (c.f. Fig. 1 (d) vs. (b)), which is helpful for capturing detailed structure in downstream tasks.", + "bbox": [ + 212, + 332, + 787, + 575 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/9cc6104fbcf975ed8f8233b2a09fdc99b7680c46d97fe2ff2c86529d6d539cb9.jpg", + "table_caption": [ + "Table 1: Semantic segmentation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on semantic segmentation in comparison to standard DINOv2 across different indoor datasets." + ], + "table_footnote": [], + "table_body": "
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)
DINOv2 [42]40.8430.1980.2576.8865.5582.4355.8643.673.54
+ Ours43.432.7683.5480.5267.583.3758.3244.8474.37
", + "bbox": [ + 220, + 656, + 782, + 714 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/428325be8d5e63f3c6b4b79393aac3bba5175d8fb1ab15468b04ab82e1f21847.jpg", + "table_caption": [ + "Table 2: Depth estimation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on depth estimation in comparison to standard DINOv2 across different indoor datasets." + ], + "table_footnote": [], + "table_body": "
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)
DINOv2 [42]0.37420.28360.44230.13920.30890.1557
+ Ours0.33610.24010.41980.13000.29210.1459
", + "bbox": [ + 220, + 779, + 782, + 838 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 294, + 114, + 732, + 130 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/37593f52bc32f25259ece3882fffcbae2ef501d2bc3d57170b523f64a0320020.jpg", + "image_caption": [ + "Fig. 5: Qualitative results on semantic segmentation on indoor datasets. After fine-tuning DINOv2 with 3D-aware features, we obtain less noisy and more compact segmentation results, especially for detailed structures and in homogeneous regions." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 784, + 628 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.4 Out-of-domain Evaluation", + "text_level": 1, + "bbox": [ + 215, + 712, + 478, + 727 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We train feature Gaussians and fine-tune DINOv2 on ScanNet++, a dataset that contains only indoor scenes with the usual content, e.g. tables, chairs and other indoor furniture. We want to analyze how the gains obtained in this setting generalize to other domains, e.g. outdoor scenes. For semantic segmentation, we conduct linear probing on ADE20k [62] and Pascal VOC [17]. For depth estimation, we conduct linear probing on KITTI [18].", + "bbox": [ + 212, + 748, + 787, + 843 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 236, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/9281332d889b6cd36808ac7c6d6a6472d8698c85fb7147ac4ed7cca77e3395f2.jpg", + "image_caption": [ + "Fig. 6: Qualitative results on depth estimation on indoor datasets. After incorporating 3D-aware features, we obtain cleaner depth in textureless regions and more detailed depth on fine-grained structures, e.g. legs of tables or chairs." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 784, + 633 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Quantitative comparison. We observe that the improvement brought by 3D-aware features is generalizable to out-of-domain challenging datasets and also outdoor driving scenes, although to a smaller degree. As shown in Tab. 3, for semantic segmentation task, incorporating our 3D-aware features brings a gain of $1.6\\%$ mIoU on the ADE20k [62] and a gain of $1.2\\%$ mIoU on Pascal VOC [17] over standard DINOv2 features. Furthermore, we also compare our performance on urban scene dataset KITTI [18] for depth estimation and observe our 3D-aware features help to reduce RMSE from 3.03 (DINOv2) to 2.91.", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 295, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/447a3274c541dc6a038d5254f83e809927b517f77a4b538d1feec07bca07ef94.jpg", + "table_caption": [ + "Table 3: Quantitative performance on out-of-domain datasets. 3D-aware fine-tuning noticeably improves semantic segmentation on ADE20k and Pascal VOC and depth estimation on KITTI, demonstrating the transferability of the fine-tuned features, even under a significant domain gap." + ], + "table_footnote": [], + "table_body": "
MethodADE20k [62]Pascal VOC [17]KITTI [18]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)RMSE (↓)Rel (↓)
DINOv2 [42]56.7444.2879.7390.6181.1495.723.030.10
+ Ours58.7145.9381.0591.0482.3596.142.910.09
", + "bbox": [ + 220, + 212, + 782, + 277 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/9cc2a856baeecb8a1ab0b87b8961ddc355bef00357dccdf3200237e3af0384a1.jpg", + "table_caption": [ + "Table 4: Generalization on other 2D vision models. Our 3D-aware fine-tuning applies to other 2D vision models and readily improves their performance." + ], + "table_footnote": [], + "table_body": "
DINOv2-regCLIPMAEDeiT-III
mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)
Original30.920.419025.610.432417.190.485518.620.4350
+ Ours33.390.382428.820.396020.270.479522.980.3820
", + "bbox": [ + 220, + 329, + 782, + 392 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Qualitative comparison. We show qualitative comparison on out-of-domain datasets in Fig. 7. We observe similar improvements as in the within-domain datasets. Even though the 3D-aware fine-tuning is only conducted on indoor dataset ScanNet++, the fine-tuned features exhibit transferability to improve segmentation results for the detailed structures of common objects like bicycle and animal and help denoise segmentation of objects like tree, building and pillar. On depth estimation, the incorporated 3D-aware features are helpful in capturing the detailed structure of trees.", + "bbox": [ + 212, + 421, + 787, + 541 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Generalization to Other Vision Models", + "text_level": 1, + "bbox": [ + 215, + 564, + 584, + 579 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We conduct experiments on more vision models (DINOv2-reg [10], CLIP [46], MAE [24], DeiT-III [54]) to prove the universality of our method. We show the linear probing results of semantic segmentation and depth estimation on ScanNet++ validation set in Tab. 4. Our method consistently improves all the models. We also visualize the features in Fig. 2. Note that the original MAE features are already clean but our method still improves them.", + "bbox": [ + 212, + 590, + 787, + 681 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.6 Ablation Studies and Analysis", + "text_level": 1, + "bbox": [ + 215, + 704, + 511, + 720 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We conduct ablation studies on semantic segmentation on NYUv2 dataset with DINOv2.", + "bbox": [ + 212, + 729, + 785, + 760 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Feature dimension of each Gaussian. We attach a low-dimensional feature vector with each Gaussian and then up-project it to the same space with DINOv2. Tab. 5 indicates that increasing the feature dimension from 32 to 64 will improve the performance of fine-tuned DINOv2 with an acceptable higher memory and longer training time. Increasing the feature dimension further to 128 is", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/2304bae93e24b5e5effdf1b9159938961160240c5f51e2ae8c10cfb8e716e3a9.jpg", + "image_caption": [ + "Fig. 7: Qualitative results on out-of-domain datasets. Our 3D-aware features help DINoV2 achieve less noisy segmentation and capture detailed structure." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 784, + 500 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "not feasible in our hardware due to the large memory consumption. We chose a feature dimension of 64 as a good compromise between model performance, memory consumption, as well as training time.", + "bbox": [ + 212, + 570, + 784, + 617 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Feature assembly strategy. We study different strategies to assemble the fine-tuned features with the original DINOv2 features in Tab. 7. We explore simple channel-wise adding and concatenation. Alternatively, we first concatenate the fine-tuned features with the original DINOv2 features then use a liner layer to fuse them to the same feature space of DINOv2. We observe simple concatenation works well in incorporating learned 3D-aware features while preserving original generalization ability.", + "bbox": [ + 212, + 619, + 787, + 727 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Fine-tuning epochs. We finetune DINOv2 using the features rendered by the pre-trained feature Gaussians. Tab. 8 suggests that a single epoch is sufficient to transfer the 3D awareness to DINOv2 and more epochs may harm the model's generalization ability.", + "bbox": [ + 212, + 729, + 787, + 792 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Fine-tuning vs. adapter. Besides directly fine-tuning DINOv2, we explore an alternative strategy where we keep DINOv2 frozen and introduce an adapter on top of that. The adapter is a single Swin Transformer block [37]. We observe the", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 295, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/3af62efbd30d1823c92adb52343eac1533b4e7544cf3608e491a36bbcfa0323f.jpg", + "table_caption": [ + "Table 5: Ablation study on feature dimension of 3D Gaussian. Increasing feature dimensions improves performance at the cost of larger memory consumption and longer training time." + ], + "table_footnote": [], + "table_body": "
Feature dimensionAverage memory (MB)Average Training time (h)mAcc (↑)mIoU (↑)aAcc (↑)
323701.378.7767.1583.44
644951.680.5267.583.37
1287502.5---
", + "bbox": [ + 217, + 212, + 558, + 252 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/a725286dc868afe31e110ba217583eac63b3daf53215ebb294ff4bb8a7d54659.jpg", + "table_caption": [ + "Table 6: Ablation study on fine-tuning vs. adapter. An adapter is a tiny network plugged into the frozen DINOv2 features." + ], + "table_footnote": [], + "table_body": "
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Fine-tuning91.0482.3596.14
Adapter90.9782.0295.96
", + "bbox": [ + 566, + 212, + 784, + 252 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/37044062810227e1abb86ed9527d2abf12121cb4ccb371749cb1e4b8bb1a15e0.jpg", + "table_caption": [ + "Table 7: Ablation study on feature assembly. We study different strategies to assemble fine-tuned features with the original DINOV2." + ], + "table_footnote": [], + "table_body": "
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Adding77.9766.082.85
Linear fusion78.2266.3982.89
Concatenation80.5267.583.37
", + "bbox": [ + 220, + 335, + 470, + 386 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/4fce81eb914ceeb1c770e1ec6023f9a404c2d830645eb2905839ae1dca1d9a84.jpg", + "table_caption": [ + "Table 8: Ablation study on fine-tuning epochs. We find fine-tuning with a single epoch with 8.5 hours is sufficient to achieve good performance." + ], + "table_footnote": [], + "table_body": "
EpochsFine-tun. time (h)mAcc (↑)mIoU (↑)aAcc (↑)
18.580.5267.583.37
21778.7267.2583.54
325.579.567.1883.24
", + "bbox": [ + 485, + 335, + 782, + 386 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "adapter can achieve comparable performance with fine-tuning (Tab. 6), however, with longer training time. We stick with the fine-tuning strategy for simplicity without introducing any additional network component.", + "bbox": [ + 212, + 416, + 784, + 463 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations and discussion. Our work makes an initial step to transfer multiview consistent and 3D-aware features encoded by a 3D Gaussian representation to 2D foundation model via fine-tuning. We demonstrate the 3D-aware features are helpful for downstream tasks. However, we still need the original features to keep the generalization ability. We attribute this to the limited diversity of our 3D training data (only a single indoor dataset) and hypothesize that this can be remedied by fine-tuning on larger-scale data.", + "bbox": [ + 212, + 465, + 787, + 571 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 599, + 359, + 617 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we present a method to inject 3D awareness into 2D foundation models. We first lift 2D foundation features into a 3D Gaussian representation and then use the rendered multi-view consistent and 3D-aware features to in turn fine-tune the 2D foundation model. Our experiments show that incorporating the fine-tuned features readily leads to improved performance on both semantic and geometric tasks through simple linear probing. Although we only conduct the 3D-aware fine-tuning on a single dataset $\\mathrm{ScanNet}++$ , we demonstrate the learned 3D awareness is transferable across a variety of datasets in different domains. We hope our work inspires future research to consider equipping 2D foundation models with 3D-aware understanding.", + "bbox": [ + 212, + 637, + 787, + 790 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements Francis Engelmann is partially supported by an ETH AI Center postdoctoral research fellowship and an ETH Zurich Career Seed Award.", + "bbox": [ + 215, + 809, + 785, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep ViT Features as Dense Visual Descriptors. In: European Conference on Computer Vision (ECCV) Workshops (2022) 2", + "2. Bachmann, R., Mizrahi, D., Atanov, A., Zamir, A.: MultiMAE: Multi-modal Multitask Masked Autoencoders. In: European Conference on Computer Vision (ECCV) (2022) 4", + "3. Bao, H., Dong, L., Piao, S., Wei, F.: BEiT: BERT Pre-training of Image Transformers. In: International Conference on Learning Representations (ICLR) (2022) 3", + "4. Bengio, Y., Courville, A., Vincent, P.: Representation Learning: A Review and New Perspectives. Transactions on Pattern Analysis and Machine Intelligence (PAMI) (2013) 3", + "5. Bhat, S.F., Alhashim, I., Wonka, P.: Adabins: Depth Estimation Using Adaptive Bins. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2021) 8", + "6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised Learning of Visual Features by Contrasting Cluster Assignments. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3", + "7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging Properties in Self-Supervised Vision Transformers. In: International Conference on Computer Vision (ICCV) (2021) 2, 3", + "8. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative Pretraining From Pixels. In: International Conference on Machine Learning (ICML) (2020) 3", + "9. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: ScanNet: Richly-Annotated 3D Reconstructions of Indoor Scenes. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 9", + "0. Darcet, T., Oquab, M., Mairal, J., Bojanowski, P.: Vision Transformers Need Registers. In: International Conference on Learning Representations (ICLR) (2024) 3, 12", + "1. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. NAACL (2018) 3", + "2. Doersch, C., Gupta, A., Efros, A.A.: Unsupervised Visual Representation Learning by Context Prediction. In: International Conference on Computer Vision (ICCV) (2015) 3", + "3. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An Image Is Worth 16x16 Words: Transformers for Image Recognition at Scale. In: International Conference on Learning Representations (ICLR) (2020) 2, 4", + "4. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative Unsupervised Feature Learning With Convolutional Neural Networks. In: International Conference on Neural Information Processing Systems (NeurIPS) (2014) 3", + "5. El Banani, M., Raj, A., Maninis, K.K., Kar, A., Li, Y., Rubinstein, M., Sun, D., Guibas, L., Johnson, J., Jampani, V.: Probing the 3D Awareness of Visual Foundation Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2", + "6. Engelmann, F., Manhardt, F., Niemeyer, M., Tateno, K., Tombari, F.: OpenNeRF: Open Set 3D Neural Scene Segmentation with Pixel-Wise Features and Rendered" + ], + "bbox": [ + 225, + 175, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 294, + 114, + 732, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "Novel Views. In: International Conference on Learning Representations (ICLR) (2024) 3", + "17. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal Visual Object Classes Challenge: A Retrospective. International Journal of Computer Vision (2015) 8, 10, 11, 12", + "18. Geiger, A., Lenz, P., Stiller, C., Urtasun, R.: Vision Meets Robotics: The Kitti Dataset. The International Journal of Robotics Research (2013) 8, 10, 11, 12", + "19. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling Open-Vocabulary Image Segmentation With Image-Level Labels. In: European Conference on Computer Vision (ECCV) (2022) 3", + "20. Gidaris, S., Singh, P., Komodakis, N.: Unsupervised Representation Learning by Predicting Image Rotations. In: International Conference on Learning Representations (ICLR) (2018) 3", + "21. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap Your Own Latent-a New Approach to Self-Supervised Learning. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3", + "22. Ha, H., Song, S.: Semantic Abstraction: Open-world 3D Scene Understanding From 2D Vision-Language Models. In: Conference on Robot Learning (CoRL) (2022) 4", + "23. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality Reduction by Learning an Invariant Mapping. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2006) 3", + "24. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked Autoencoders Are Scalable Vision Learners. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 4, 12", + "25. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum Contrast for Unsupervised Visual Representation Learning. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2020) 3", + "26. Hou, J., Dai, X., He, Z., Dai, A., Nießner, M.: Mask3D: Pre-training 2D Vision Transformers by Learning Masked 3D Priors. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4", + "27. Hou, J., Xie, S., Graham, B., Dai, A., Nießner, M.: Pri3D: Can 3D Priors Help 2D Representation Learning? In: International Conference on Computer Vision (ICCV) (2021) 4", + "28. Huang, R., Peng, S., Takmaz, A., Tombari, F., Pollefeys, M., Song, S., Huang, G., Engelmann, F.: Segment3D: Learning Fine-Grained Class-Agnostic 3D Segmentation without Manual Labels. European Conference on Computer Vision (ECCV) (2024) 4", + "29. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., et al.: ConceptFusion: Open-set Multimodal 3D Mapping. Robotics: Science and Systems (RSS) (2023) 4", + "30. Ke, B., Obukhov, A., Huang, S., Metzger, N., Daudt, R.C., Schindler, K.: Repurposing Diffusion-Based Image Generators for Monocular Depth Estimation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2", + "31. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3D Gaussian Splatting for Real-Time Radiance Field Rendering. ACM Transactions on Graphics (2023) 2, 4, 5, 6", + "32. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: LERF: Language Embedded Radiance Fields. In: International Conference on Computer Vision (ICCV) (2023) 3" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "33. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment Anything. In: International Conference on Computer Vision (ICCV) (2023) 2", + "34. Kobayashi, S., Matsumoto, E., Sitzmann, V.: Decomposing Nerf for Editing via Feature Field Distillation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 3", + "35. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven Semantic Segmentation. In: International Conference on Learning Representations (ICLR) (2022) 3", + "36. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask DINO: Towards a Unified Transformer-Based Framework for Object Detection and Segmentation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2", + "37. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin Transformer: Hierarchical Vision Transformer Using Shifted Windows. In: International Conference on Computer Vision (ICCV) (2021) 13", + "38. Loshchilov, I., Hutter, F.: Decoupled Weight Decay Regularization. In: International Conference on Learning Representations (ICLR) (2019) 8", + "39. Mazur, K., Sucar, E., Davison, A.J.: Feature-realistic Neural Fusion for Real-time, Open Set Scene Understanding. In: International Conference on Robotics and Automation (ICRA) (2023) 4", + "40. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. In: European Conference on Computer Vision (ECCV) (2020) 3", + "41. Noroozi, M., Favaro, P.: Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles. In: European Conference on Computer Vision (ECCV) (2016) 3", + "42. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: DINOV2: Learning Robust Visual Features Without Supervision. Transactions on Machine Learning Research (2023) 1, 2, 3, 5, 6, 7, 8, 9, 12", + "43. Pathak, D., Girshick, R., Dollar, P., Darrell, T., Hariharan, B.: Learning Features by Watching Objects Move. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 3", + "44. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T.: OpenScene: 3D Scene Understanding with Open Vocabularies. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4", + "45. Qin, M., Li, W., Zhou, J., Wang, H., Pfister, H.: LangSplat: 3D Language Gaussian Splatting. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4", + "46. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning Transferable Visual Models From Natural Language Supervision. In: International Conference on Machine Learning (ICML) (2021) 3, 12", + "47. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-Resolution Image Synthesis With Latent Diffusion Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2", + "48. Saxena, S., Herrmann, C., Hur, J., Kar, A., Norouzi, M., Sun, D., Fleet, D.J.: The Surprising Effectiveness of Diffusion Models for Optical Flow and Monocular Depth Estimation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2024) 2" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning", + "bbox": [ + 294, + 114, + 733, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "49. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled Feature Fields Enable Few-Shot Language-Guided Manipulation. In: Conference on Robot Learning (CoRL) (2023) 4", + "50. Shi, J.C., Wang, M., Duan, H.B., Guan, S.H.: Language Embedded 3D Gaussians for Open-Vocabulary Scene Understanding. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4", + "51. Silberman, N., Hoiem, D., Kohli, P., Fergus, R.: Indoor Segmentation and Support Inference From RGBD Images. In: European Conference on Computer Vision (ECCV) (2012) 8, 9", + "52. Takmaz, A., Fedele, E., Sumner, R.W., Pollefeys, M., Tombari, F., Engelmann, F.: OpenMask3D: Open-Vocabulary 3D Instance Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 4", + "53. Tan, H., Wu, S., Pi, J.: Semantic Diffusion Network for Semantic Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 2", + "54. Touvron, H., Cord, M., Jégou, H.: Deit III: Revenge of the ViT. In: European Conference on Computer Vision (ECCV) (2022) 3, 12", + "55. Tschernezki, V., Laina, I., Larlus, D., Vedaldi, A.: Neural Feature Fusion Fields: 3D Distillation of Self-Supervised 2D Image Representations. In: International Conference on 3D Vision (3DV) (2022) 3", + "56. Wang, X., Gupta, A.: Unsupervised Learning of Visual Representations Using Videos. In: International Conference on Computer Vision (ICCV) (2015) 3", + "57. Weder, S., Blum, H., Engelmann, F., Pollefeys, M.: LabelMaker: Automatic Semantic Label Generation from RGB-D Trajectories. In: International Conference on 3D Vision (3DV) (2024) 4", + "58. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: CroCo: Self-Supervised Pre-training for 3D Vision Tasks by Cross-View Completion. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 4", + "59. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth Anything: Unleashing the Power of Large-Scale Unlabeled Data. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2", + "60. Yeshwanth, C., Liu, Y.C., Nießner, M., Dai, A.: ScanNet++: A High-Fidelity Dataset of 3D Indoor Scenes. In: International Conference on Computer Vision (ICCV) (2023) 8, 9", + "61. Zhang, J., Herrmann, C., Hur, J., Polania Cabrera, L., Jampani, V., Sun, D., Yang, M.H.: A Tale of Two Features: Stable Diffusion Complements DINO for Zero-Shot Semantic Correspondence. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 2", + "62. Zhou, B., Zhao, H., Puig, X., Fidler, S., Barriuso, A., Torralba, A.: Scene Parsing Through ade20K Dataset. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 10, 11, 12", + "63. Zhou, S., Chang, H., Jiang, S., Fan, Z., Zhu, Z., Xu, D., Chari, P., You, S., Wang, Z., Kadambi, A.: Feature 3DGS: Supercharging 3D Gaussian Splatting to Enable Distilled Feature Fields. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + ], + "bbox": [ + 215, + 146, + 785, + 784 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Y. Yue et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_model.json b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_model.json new file mode 100644 index 0000000000000000000000000000000000000000..a3faa7443add9f3bdd22dddfb78131a35f380cb1 --- /dev/null +++ b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_model.json @@ -0,0 +1,2414 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.261, + 0.142, + 0.744, + 0.188 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "text", + "bbox": [ + 0.312, + 0.212, + 0.692, + 0.245 + ], + "angle": 0, + "content": "Yuanwen Yue\\(^{1}\\), Anurag Das\\(^{2}\\), Francis Engelmann\\(^{1,3}\\), Siyu Tang\\(^{1}\\), and Jan Eric Lenssen\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.394, + 0.254, + 0.489, + 0.269 + ], + "angle": 0, + "content": "\\(^{1}\\) ETH Zurich" + }, + { + "type": "text", + "bbox": [ + 0.549, + 0.254, + 0.612, + 0.27 + ], + "angle": 0, + "content": "3 Google" + }, + { + "type": "text", + "bbox": [ + 0.269, + 0.269, + 0.734, + 0.285 + ], + "angle": 0, + "content": "2 Max Planck Institute for Informatics, Saarland Informatics Campus" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.291, + 0.782, + 0.457 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.472, + 0.79, + 0.57 + ], + "angle": 0, + "content": "Fig. 1: We propose 3D-aware fine-tuning to improve 2D foundation features. Our method starts with lifting 2D image features (e.g. DINOv2 [42]) (b) to a 3D representation. Then we finetune the 2D foundation model using the 3D-aware features (c). We demonstrate that incorporating the fine-tuned features (d) results in improved performance on downstream tasks such as semantic segmentation and depth estimation on a variety of datasets with simple linear probing (right). Feature maps are visualized using principal component analysis (PCA)." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.592, + 0.744, + 0.801 + ], + "angle": 0, + "content": "Abstract. Current visual foundation models are trained purely on unstructured 2D data, limiting their understanding of 3D structure of objects and scenes. In this work, we show that fine-tuning on 3D-aware data improves the quality of emerging semantic features. We design a method to lift semantic 2D features into an efficient 3D Gaussian representation, which allows us to re-render them for arbitrary views. Using the rendered 3D-aware features, we design a fine-tuning strategy to transfer such 3D awareness into a 2D foundation model. We demonstrate that models fine-tuned in that way produce features that readily improve downstream task performance in semantic segmentation and depth estimation through simple linear probing. Notably, though fine-tuned on a single indoor dataset, the improvement is transferable to a variety of indoor datasets and out-of-domain datasets. We hope our study encourages the community to consider injecting 3D awareness when training 2D foundation models. Project page: https://ywyue.github.io/FiT3D." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.812, + 0.742, + 0.841 + ], + "angle": 0, + "content": "Keywords: Representation learning \\(\\cdot\\) Foundation models \\(\\cdot\\) Gaussian splatting \\(\\cdot\\) Scene understanding" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.375, + 0.161 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.186, + 0.787, + 0.322 + ], + "angle": 0, + "content": "Ever since the emergence of deep neural networks, vision systems are largely trained on 2D datasets. With the scalability of recent architectures, like vision transformers (ViT) [13], several large vision models [7, 24, 33, 42, 47] have been trained from a rich set of 2D images by either supervised or self-supervised learning. Visual foundation models have shown impressive utility as general feature extractors that can be applied to improve results on downstream tasks, such as segmentation [36, 53], depth estimation [30, 48, 59], or correspondence estimation [1, 61]. They are trained on a large amount of readily available 2D images and, thus, learn statistics about object and scene structure in 2D-pixel space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.324, + 0.787, + 0.505 + ], + "angle": 0, + "content": "Images, as a simple projection of our 3D world, are easy to obtain and provide an efficient way to depict the visual world while at the same time discarding explicit 3D geometry information. It is expected that vision systems purely trained on 2D images cannot fully understand the underlying 3D structure of our world [15]. There are several promising properties of our 3D world, for example, multi-view consistency, and multi-view fusion for solving single-view ambiguities. A crucial limitation of the training setups of these models is that they don't fully reason about the 3D structure of seen objects. Training images are presented to the network in an unstructured way, without any multi-view or video correspondences that would allow matching observations of the same object from multiple views. As a consequence, these models have limited 3D understanding of objects observed from, e.g., different views are not producing view-consistent features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.507, + 0.787, + 0.597 + ], + "angle": 0, + "content": "In contrast, when we humans observe images, we effortlessly achieve a holistic understanding by not only perceiving the 2D visual content but also exploiting the inferred underlying 3D structure, which we have learned through lifelong observation of stereo and temporal information. In this work, we investigate if large scale 2D vision models can also profit from equipping them with such 3D-aware understanding abilities induced by showing the right type of data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.787, + 0.841 + ], + "angle": 0, + "content": "To this end, we design a novel two-stage approach to improve the 3D-aware understanding ability of 2D foundation models. In the first stage, we aim to obtain 3D-aware features as training data. Motivated by recent advancements in neural scene representation, we design an approach to lift multi-view 2D foundation features into an efficient 3D Gaussian representation [31]. The lifting process exploits multi-view consistency and allows 2D features from different views to complement each other. Moreover, the fused features (Fig. 1 (c)) exhibit high resolution with fine details thanks to the learned 3D structure, emerging from multi-view RGB guidance. Once trained, the 3D Gaussians can render features for arbitrary views. In the following, we refer to features obtained in this way as 3D-aware. In the second stage, we utilize the rendered 3D-aware features to finetune the 2D foundation models (Fig. 2). To this end, we design an efficient fine-tuning strategy to transfer such 3D awareness into 2D foundation models. After fine-tuning, we evaluate the feature quality on downstream tasks that might profit from a better 3D understanding, namely semantic segmentation and depth estimation. Extensive experiments demonstrate that incorporating the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.295, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.164, + 0.314, + 0.227 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.315, + 0.133, + 0.408, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.41, + 0.133, + 0.503, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.133, + 0.598, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.599, + 0.133, + 0.691, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.692, + 0.133, + 0.785, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.264, + 0.785, + 0.307 + ], + "angle": 0, + "content": "Fig. 2: Our 3D-aware fine-tuning is universal and applicable to a variety of 2D vision models, e.g. DINOv2 [42], DINOv2-reg [10], CLIP [46], MAE [24], and DeiT-III [54] (c.f. Sec. 4.5)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.333, + 0.784, + 0.363 + ], + "angle": 0, + "content": "3D-aware features improves downstream tasks with simple linear probing and exhibits generalization ability on out-of-domain datasets." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.383, + 0.388, + 0.399 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.412, + 0.785, + 0.472 + ], + "angle": 0, + "content": "We give an overview about recent self-supervised 2D representation learning techniques in Sec. 2.1, and how emerging features have been distilled into 3D representations in Sec. 2.2. Then, we discuss previous work that utilizes 3D information to improve 2D representation methods in Sec. 2.3." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.492, + 0.496, + 0.507 + ], + "angle": 0, + "content": "2.1 2D Representation Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.513, + 0.788, + 0.694 + ], + "angle": 0, + "content": "Representation learning [4] has achieved remarkable progress in the image domain. It aims to learn generalizable visual features from a rich set of data. Self-supervised representation learning has gained particular interest since it does not require labeled data. Early works employ pretext tasks for pre-training, which aim to exploit inherent data attributes to automatically generate surrogate labels [12,14,20,41,43,56]. Later, contrastive learning [23] has been popularly used for representation learning by leveraging discriminative signals between images or groups of images [6,7,21,25,42]. More recently, motivated by BERT [11], a new paradigm of masked image modeling [3,8,24] has been proposed for scalable visual learning. Nevertheless, all those methods are only trained on 2D image data, without accessing the underlying 3D structure. Our work aims to supplement the features purely learned from 2D observations with 3D awareness." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.713, + 0.515, + 0.727 + ], + "angle": 0, + "content": "2.2 Distilled Feature Fusion Fields" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Neural radiance fields (NeRF) [40] emerge as a promising scene representation for high-quality 3D reconstruction and novel view synthesis. Recently, some works [16,32,34,55] explore distilling pre-trained image features (e.g. DINO [7], CLIP [46], LSeg [35], or OpenSeg [19]) into NeRF via neural rendering. Without requiring any labels, such distilled feature fusion fields enable several zero-shot 3D scene understanding tasks, e.g. segmentation, scene editing, and open-vocabulary queries. We share similar inspiration from these works by distilling" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.313 + ], + "angle": 0, + "content": "2D features into a 3D representation. However, instead of focusing on perception tasks with feature fields, we are interested in leveraging the rendered 3D-aware features to in turn improve the 2D feature extractor. We demonstrate that the transferred 3D awareness can readily improve the 2D features on both semantic and geometric tasks. Moreover, we extend the recent Gaussian-based representation [31] by designing a method to distill 2D features into 3D Gaussians while keeping high efficiency and memory under bound. There are several concurrent works introducing 3D Gaussians with semantic features [45, 50, 63]. However, none of these works distill features back into 2D models. Our work shows, for the first time, that semantic features fused into 3D representations can effectively improve 2D foundation models via fine-tuning." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.335, + 0.473, + 0.35 + ], + "angle": 0, + "content": "2.3 Injecting 3D Priors to 2D" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.36, + 0.787, + 0.572 + ], + "angle": 0, + "content": "Existing works mainly focus on fusing multi-view 2D features into the 3D representation [22, 28, 29, 39, 44, 49, 52, 57]. Little attention has been paid to the other direction of incorporating 3D awareness into 2D representation learning. Pri3D [27] uses geometric constraints (multi-view consistency and 2D-3D correspondence) from RGB-D reconstructions to learn 3D priors for image-based representations with contrastive learning. Recently, inspired by the masked autoencoder (MAE) [24], several works adopt the masked image modeling strategy to learn 3D priors [2, 26, 58]. However, all these methods require pre-training the 2D feature extractor, typically a Vision Transformer (ViT) backbone [13], using their hand-crafted pretext tasks. The pre-trained models are then employed to downstream tasks via fine-tuning. By contrast, we aim to transfer the 3D awareness embedded in multi-view fused features to the 2D feature extractor through fine-tuning with little computational resources. Our 3D-aware features readily improve downstream task performance with simple linear probing." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.595, + 0.329, + 0.61 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.627, + 0.787, + 0.746 + ], + "angle": 0, + "content": "In this section, we introduce our method for fine-tuning 2D foundation models with 3D-aware features. We present a two-stage pipeline (c.f. Fig 3). In the first stage, we lift multi-view inconsistent 2D features into a multi-view consistent and 3D-aware representation. The representation and setup are described in Sec. 3.1. In the second stage, we use the obtained 3D-aware feature representations as training dataset to fine-tune the 2D feature extractor, which is detailed in Sec. 3.2. Last, we describe the linear probing methodology for feature evaluation in Sec. 3.3." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.77, + 0.445, + 0.785 + ], + "angle": 0, + "content": "3.1 Lifting Features to 3D" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Lifting semantic 2D features into 3D has been a trend recently and several different options exist (c.f. Sec. 2). For our purposes of using larger amounts of scenes as training data for 2D models, the most important aspect is efficiency." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.295, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.144, + 0.55, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.144, + 0.788, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.284, + 0.789, + 0.34 + ], + "angle": 0, + "content": "Fig. 3: Overall pipeline. We present a two-stage pipeline. In the first state, we lift 2D foundation features (e.g. DINOv2 [42]) into 3D-aware features by training 3D Gaussian representation \\(\\mathcal{G}_i\\). In the second stage, we use the rendered features to finetune the 2D foundation model \\(\\varepsilon^{2D}\\). With \\(\\rightarrow\\) we denote gradient flow." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.37, + 0.784, + 0.459 + ], + "angle": 0, + "content": "The representation needs to (1) be able to efficiently fit a large number of scenes into 3D representations and (2) have a fast rendering mechanism for efficient integration into a fine-tuning loop of a 2D foundation model. Thus, we utilize the recent advances in 3D Gaussian splatting [31], which enable fast optimization and real-time rendering. Fig. 4 illustrates how we extend Gaussian splatting to lift 2D foundation features and we detail the method below." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.463, + 0.784, + 0.493 + ], + "angle": 0, + "content": "3D feature Gaussians. Adapting the formulation of 3D Gaussian splatting [31], we define a set of 3D Gaussians as" + }, + { + "type": "equation", + "bbox": [ + 0.378, + 0.505, + 0.786, + 0.523 + ], + "angle": 0, + "content": "\\[\n\\mathcal {G} = \\left\\{\\left(\\boldsymbol {\\mu}, \\mathbf {s}, \\mathbf {R}, \\alpha , \\mathbf {S H}, \\mathbf {f}\\right) _ {j}\\right) \\} _ {1 \\leq j \\leq M}, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.531, + 0.788, + 0.669 + ], + "angle": 0, + "content": "where \\(\\pmb{\\mu} \\in \\mathbb{R}^3\\) is the 3D mean of the Gaussian, \\(\\mathbf{S} = \\mathrm{diag}(\\mathbf{s}) \\in \\mathbb{R}^{3 \\times 3}\\) is the Gaussian scale, \\(\\mathbf{R} \\in \\mathbb{R}^{3 \\times 3}\\) its orientation, \\(\\alpha \\in \\mathbb{R}\\) is a per-Gaussian opacity, and \\(\\mathbf{SH}\\) a vector of spherical harmonic coefficients, encoding view-dependent color. The Gaussian covariance matrix is obtained by combining scale and orientation as \\(\\pmb{\\Sigma} = \\mathbf{RSS}^\\top \\mathbf{R}^\\top\\). In addition to the original parameters, we introduce a per-Gaussian feature vector \\(\\mathbf{f} \\in \\mathbb{R}^D\\) to store distilled 2D features in 3D space. Those feature vectors are rasterized into a 2D feature image with our designed feature rasterizer. Inspired by the differentiable color rasterizer of Gaussian splatting, we rasterize the features using point-based \\(\\alpha\\)-blending as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.402, + 0.679, + 0.787, + 0.722 + ], + "angle": 0, + "content": "\\[\n\\mathbf {F} ^ {\\text {l o w}} = \\sum_ {i \\in \\mathcal {N}} \\mathbf {f} _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {i}) \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.731, + 0.784, + 0.776 + ], + "angle": 0, + "content": "where \\(\\mathcal{N}\\) is a set of ordered Gaussians overlapping the pixel, \\(\\mathbf{f}_i\\) is the feature of each Gaussian and \\(\\alpha_{i}\\) is given by evaluating a 2D Gaussian with covariance \\(\\pmb{\\Sigma}\\) multiplied with a learned per-point opacity." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.78, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Up-projecting features. A strong limitation of 3D Gaussians as representation is their memory consumption. Since there can be millions of Gaussians per scene, it is impossible to store, e.g., the 384-dimensional DINO features directly on each of the 3D Gaussians. Therefore, to stay memory efficient and keep the fast" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.159, + 0.782, + 0.31 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.327, + 0.788, + 0.412 + ], + "angle": 0, + "content": "Fig. 4: Lifting 2D features into 3D Gaussian representation. We equip each Gaussian with a low-dimensional feature vector \\(\\mathbf{f}\\). We render colors using the same color rasterizer as Gaussian splatting [31]. We design a feature rasterizer to render a low-dimensional feature image \\(\\mathbf{F}^{\\mathrm{low}}\\), which is subsequently projected to a high-dimensional feature image \\(\\mathbf{F}^{\\mathrm{high}}\\) using a simple CNN. We use 2D foundation features \\(\\mathbf{F}\\) from model \\(\\varepsilon^{2\\mathrm{D}}\\) to supervise the feature learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.45, + 0.788, + 0.511 + ], + "angle": 0, + "content": "rendering process, we opt for storing lower dimensional features \\(\\mathbf{f} \\in \\mathbb{R}^{D}\\) with \\(D \\ll 384\\) and train a scene-specific pixel-space CNN decoder \\(d: \\mathbf{F}^{\\mathrm{low}} \\mapsto \\mathbf{F}^{\\mathrm{high}}\\) to up-project feature images into high-dimensional feature space after rendering. We analyze the trade-off introduced by this approach in Sec. 4.6." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.518, + 0.788, + 0.641 + ], + "angle": 0, + "content": "Optimization. For a given scene, the full 3D Gaussian representation, including our distilled features, is obtained using optimization. Let \\(\\{\\mathbf{I}_i\\}_{1\\leq i\\leq N}\\) be a set of multi-view images of a scene with corresponding camera parameters, \\(\\{\\mathbf{F}_i\\}_{1\\leq i\\leq N}\\) a corresponding set of feature maps from a 2D feature extractor (e.g. DINOv2 [42]), and \\(r^{\\mathrm{rgb}}\\), \\(r^{\\mathrm{feat}}\\) rasterization functions that render a set of Gaussians into an RGB or feature image, respectively, using the camera pose \\(\\mathbf{P}_i\\) of image \\(i\\). Then, we optimize the Gaussian parameters, to optimally represent images \\(\\mathbf{I}_i\\) and feature images \\(\\mathbf{F}_i\\):" + }, + { + "type": "equation", + "bbox": [ + 0.261, + 0.659, + 0.787, + 0.702 + ], + "angle": 0, + "content": "\\[\n\\hat {\\mathcal {G}} = \\underset {\\{(\\boldsymbol {\\mu}, \\mathbf {s}, \\mathbf {R}, \\alpha , \\mathbf {S H}, \\mathbf {f}) _ {i} \\}} {\\arg \\min } \\sum_ {i = 1} ^ {N} \\mathcal {L} ^ {c} (r ^ {\\mathrm {r g b}} (\\mathcal {G}, \\mathbf {P} _ {i}), \\mathbf {I} _ {i}) + \\mathcal {L} ^ {f} (d (r ^ {\\mathrm {f e a t}} (\\mathcal {G}, \\mathbf {P} _ {i}), \\mathbf {F} _ {i}), \\quad (3)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.842 + ], + "angle": 0, + "content": "where \\(\\mathcal{L}^c\\) is a pixel-wise \\(l_{1}\\) loss combined with a D-SSIM term on RGB images, and \\(\\mathcal{L}^f\\) is a pixel-wise \\(l_{1}\\) loss on feature images. Notably, we only optimize \\(\\mathbf{f}\\) with gradients coming from \\(\\mathcal{L}^f\\) (feature images) and the rest of the parameters only on \\(\\mathcal{L}^c\\) (RGB loss). This has proven to be essential to obtain a consistent 3D feature representation, as a loss from feature space does not lead to correct Gaussian mean, covariance and opacity. We speculate that the reason for this is the missing 3D consistency of the 2D feature extractor. Only through forcing them into a 3D consistent representation, we make them consistent in return." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.295, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "code_caption", + "bbox": [ + 0.217, + 0.146, + 0.551, + 0.163 + ], + "angle": 0, + "content": "Algorithm 1 3D-aware fine-tuning algorithm" + }, + { + "type": "algorithm", + "bbox": [ + 0.216, + 0.165, + 0.787, + 0.325 + ], + "angle": 0, + "content": "Input: Pre-trained Feature Gaussian representations \\(\\{\\mathcal{G}_1,\\dots,\\mathcal{G}_K\\}\\), pre-trained 2D feature extractor \\(\\varepsilon_{\\theta}^{2D}\\), a set of images \\(\\{\\mathbf{I}_i\\}_{i=1}^N\\) and associated camera poses \\(\\{\\mathbf{P}_i\\}_{i=1}^N\\). \nOutput: Fine-tuned 2D feature extractor \\(\\varepsilon_{\\hat{\\theta}}^{2D}\\). \n1: Load \\(\\mathcal{G} \\sim \\{\\mathcal{G}_1,\\dots,\\mathcal{G}_K\\}\\) \n2: while fine-tuning do \n3: Sample an image \\(\\mathbf{I}_i\\) and camera pose \\(\\mathbf{P}_i\\), \\(i \\sim \\mathcal{U}\\{1,N\\}\\) \n4: Retrieve associated feature Gaussian \\(\\mathcal{G}\\) and CNN decoder \\(d\\) \n5: Render \\(\\mathbf{F}^{\\mathrm{high}} \\gets d(r^{\\mathrm{feat}}(\\mathcal{G},\\mathbf{P}_i))\\) \n6: Step \\(\\theta\\) by minimizing \\(\\mathcal{L}(\\varepsilon_{\\theta}^{2D}(\\mathbf{I}_i),\\mathbf{F}^{\\mathrm{high}})\\) \n7: end while \nreturn \\(\\varepsilon_{\\hat{\\theta}}^{2D}\\)" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.356, + 0.452, + 0.372 + ], + "angle": 0, + "content": "3.2 3D-Aware Fine-Tuning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.384, + 0.789, + 0.55 + ], + "angle": 0, + "content": "The procedure described in the last section is used to fit 3D feature Gaussian representations of \\( K \\) scenes. The algorithm of 3D-aware fine-tuning is outlined in Algorithm 1. The fine-tuning process requires training pairs of original 2D feature maps and 3D-aware feature maps. Since it is memory-intensive to save the feature maps, we generate the training pairs on the fly. Considering it is time-consuming to load each pre-trained Gaussian when rendering features, we pre-load all the Gaussians into CPU memory. In each step of the training loop, we randomly sample a view from all the training images, then retrieve its associated feature Gaussian and scene-specific CNN decoder and finally render features \\( \\mathbf{F}^{\\mathrm{high}} \\) as the ground truth features for fine-tuning. The fine-tuning loss is a \\( l_{1} \\) loss between \\( \\mathbf{F}^{\\mathrm{high}} \\) (resized) and the output features of the fine-tuned 2D feature extractor." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.788, + 0.643 + ], + "angle": 0, + "content": "The above design makes the fine-tuning process efficient and keeps memory consumption under control. Notably, we only need to fine-tune the 2D feature extractor with a small number of epochs (e.g. 1 epoch for DINOv2 [42]) with a small learning rate without additionally introducing any network component. The fine-tuning process is fast and computation-friendly. An analysis of fine-tuning time is in Sec. 4.6." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.668, + 0.579, + 0.683 + ], + "angle": 0, + "content": "3.3 Linear Probing for Downstream Tasks" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.696, + 0.787, + 0.757 + ], + "angle": 0, + "content": "After fine-tuning on 3D-aware features, we evaluate the emerging features on a set of standard benchmark downstream tasks. To this end, we train a linear head on top of the features to solve tasks of semantic segmentation and depth estimation on several datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.76, + 0.787, + 0.807 + ], + "angle": 0, + "content": "Semantic segmentation. A linear layer is trained to predict class logits from patch tokens. The linear layer produces a low-resolution logit map, which is then upsampled to full resolution to obtain a segmentation map." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Depth estimation. We concatenate the [CLS] token of the ViT to each patch token. We divide the depth prediction range into 256 uniformly distributed" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "bins [5] and use a linear normalization. Then a simple linear layer is trained using a classification loss." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.181, + 0.785, + 0.241 + ], + "angle": 0, + "content": "Feature assembly. We concatenate original 2D features with our fine-tuned features. We observe this is key to preserving the generalization ability of the original 2D feature extractor while incorporating the 3D awareness in our fine-tuned features. Different strategies for feature assembly are evaluated in Sec. 4.6." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.263, + 0.376, + 0.28 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.293, + 0.334, + 0.307 + ], + "angle": 0, + "content": "4.1 Datasets" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.317, + 0.784, + 0.378 + ], + "angle": 0, + "content": "Training. We train the feature Gaussians on ScanNet++ [60], which is a large-scale dataset of 3D indoor scenes containing sub-millimeter resolution laser scans, registered DSLR images, and commodity RGB-D streams from iPhone. We train on the official training split of 230 scenes, which contain 140451 views." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.381, + 0.788, + 0.58 + ], + "angle": 0, + "content": "Evaluation. To examine the effectiveness of the fine-tuned features, we conduct extensive experiments on downstream 2D tasks including semantic segmentation and depth estimation. There is no direct competitor in our study and we instead focus on whether our 3D-aware fine-tuning can bring performance gains compared with the standard 2D feature extractor. We conduct most of the experiments with DINOv2 [42] while also demonstrating the generality of our approach with other vision models in Sec. 4.5. We first evaluate on ScanNet++ [60] validation set, which contains 50 scenes with 30638 images. Then we move on to other indoor datasets ScanNet [9] and NYUd [51]. which have a similar data distribution with ScanNet++ but were captured with different sensors. To investigate the generalization ability of the fine-tuned features, we also perform out-of-domain evaluation on generally distributed datasets including ADE20k [62], Pascal VOC [17] and the outdoor dataset KITTI [18]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.598, + 0.457, + 0.614 + ], + "angle": 0, + "content": "4.2 Implementation Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.622, + 0.784, + 0.698 + ], + "angle": 0, + "content": "Feature Gaussians. We wrote custom CUDA kernels for feature rasterization. Each Gaussian is initialized with a random feature vector of dimension of 64. We implement the up-projecting CNN with a single convolutional layer with a kernel size of \\(3 \\times 3\\). We train the feature Gaussians of each scene for novel view synthesis and feature rendering jointly for 30000 iterations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.701, + 0.784, + 0.762 + ], + "angle": 0, + "content": "Fine-tuning. We finetune DINOv2 small with a feature dimension of 384 with a batch size of 2 with a learning rate of 1e-5 for 1 epoch. We use horizontal flip as data augmentation. We use the AdamW [38] optimizer with a weight decay factor 1e-4. The fine-tuning on a single Nvidia Tesla A100 takes 8.5 hours." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Linear probing. We follow the linear probing protocol with DINOv2 [42] to ensure a fair comparison. For semantic segmentation, we train the linear layer for 40K iterations with 8 GPUs. For depth estimation, we train the linear layer for 38400 iterations with 8 GPUs. In addition, we use the same data augmentation and learning rate schedule with DINOv2." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.295, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.482, + 0.162 + ], + "angle": 0, + "content": "4.3 Within-domain Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.33 + ], + "angle": 0, + "content": "Quantitative comparison. We demonstrate the effectiveness of incorporating our 3D-aware features on downstream semantic segmentation (see Tab. 1) and depth estimation task (see Tab. 2) for indoor scenes. For semantic segmentation task, our 3D aware features consistently improve DINOv2 features, achieving a significant performance gain of \\(2.6\\%\\), \\(2.0\\%\\) mIoU, and \\(1.2\\%\\) on ScanNet++ [60], NYUv2 [51] and ScanNet [9] datasets, respectively. Our 3D-aware DINOv2 features also improve performance on the depth estimation task. In particular, our enhanced features consistently reduce the RMSE across datasets by achieving 0.34 vs. 0.37 (DINOv2) for ScanNet++ [60], 0.42 vs. 0.44 (DINOv2) for NYUv2 [51] and 0.29 vs. 0.31 (DINOv2) for ScanNet [9] datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.333, + 0.789, + 0.577 + ], + "angle": 0, + "content": "Qualitative comparison. We qualitatively show the benefits of 3D-aware features in Fig. 5 and Fig. 6. We observe the improvements are mainly reflected in two aspects: (1) cleaner segmentation/depth estimation in homogeneous or textureless regions, e.g. on walls and boards, and (2) better prediction with fine-grained details, e.g. on legs of chairs or tables. For (1), during the lifting of 2D features to 3D, features from multiple views are aggregated into a holistic representation, thus information from one view implicitly complements other views. We hypothesize that such multi-view awareness is transferred to DINOv2 through fine-tuning. By contrast, standard DINOv2 struggles to infer accurate segmentation or depth from a single image when with ambiguity, thus leading to noisy prediction. For (2), in our feature lifting process, we train the geometry properties (e.g. position and opacity) of Gaussians with RGB color as supervision. The RGB guidance helps feature Gaussians learn detailed 3D structure and render high-resolution feature maps (c.f. Fig. 1 (c)). During the fine-tuning process, the model learns to estimate fine-grained features of objects (c.f. Fig. 1 (d) vs. (b)), which is helpful for capturing detailed structure in downstream tasks." + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.602, + 0.788, + 0.644 + ], + "angle": 0, + "content": "Table 1: Semantic segmentation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on semantic segmentation in comparison to standard DINOv2 across different indoor datasets." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.657, + 0.784, + 0.715 + ], + "angle": 0, + "content": "
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)
DINOv2 [42]40.8430.1980.2576.8865.5582.4355.8643.673.54
+ Ours43.432.7683.5480.5267.583.3758.3244.8474.37
" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.726, + 0.788, + 0.768 + ], + "angle": 0, + "content": "Table 2: Depth estimation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on depth estimation in comparison to standard DINOv2 across different indoor datasets." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.78, + 0.784, + 0.839 + ], + "angle": 0, + "content": "
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)
DINOv2 [42]0.37420.28360.44230.13920.30890.1557
+ Ours0.33610.24010.41980.13000.29210.1459
" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.237, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.785, + 0.629 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.637, + 0.788, + 0.682 + ], + "angle": 0, + "content": "Fig. 5: Qualitative results on semantic segmentation on indoor datasets. After fine-tuning DINOv2 with 3D-aware features, we obtain less noisy and more compact segmentation results, especially for detailed structures and in homogeneous regions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.713, + 0.479, + 0.728 + ], + "angle": 0, + "content": "4.4 Out-of-domain Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.844 + ], + "angle": 0, + "content": "We train feature Gaussians and fine-tune DINOv2 on ScanNet++, a dataset that contains only indoor scenes with the usual content, e.g. tables, chairs and other indoor furniture. We want to analyze how the gains obtained in this setting generalize to other domains, e.g. outdoor scenes. For semantic segmentation, we conduct linear probing on ADE20k [62] and Pascal VOC [17]. For depth estimation, we conduct linear probing on KITTI [18]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.296, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.145, + 0.785, + 0.634 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.687 + ], + "angle": 0, + "content": "Fig. 6: Qualitative results on depth estimation on indoor datasets. After incorporating 3D-aware features, we obtain cleaner depth in textureless regions and more detailed depth on fine-grained structures, e.g. legs of tables or chairs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Quantitative comparison. We observe that the improvement brought by 3D-aware features is generalizable to out-of-domain challenging datasets and also outdoor driving scenes, although to a smaller degree. As shown in Tab. 3, for semantic segmentation task, incorporating our 3D-aware features brings a gain of \\(1.6\\%\\) mIoU on the ADE20k [62] and a gain of \\(1.2\\%\\) mIoU on Pascal VOC [17] over standard DINOv2 features. Furthermore, we also compare our performance on urban scene dataset KITTI [18] for depth estimation and observe our 3D-aware features help to reduce RMSE from 3.03 (DINOv2) to 2.91." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 3: Quantitative performance on out-of-domain datasets. 3D-aware fine-tuning noticeably improves semantic segmentation on ADE20k and Pascal VOC and depth estimation on KITTI, demonstrating the transferability of the fine-tuned features, even under a significant domain gap." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.213, + 0.784, + 0.278 + ], + "angle": 0, + "content": "
MethodADE20k [62]Pascal VOC [17]KITTI [18]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)RMSE (↓)Rel (↓)
DINOv2 [42]56.7444.2879.7390.6181.1495.723.030.10
+ Ours58.7145.9381.0591.0482.3596.142.910.09
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.29, + 0.788, + 0.319 + ], + "angle": 0, + "content": "Table 4: Generalization on other 2D vision models. Our 3D-aware fine-tuning applies to other 2D vision models and readily improves their performance." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.33, + 0.784, + 0.393 + ], + "angle": 0, + "content": "
DINOv2-regCLIPMAEDeiT-III
mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)
Original30.920.419025.610.432417.190.485518.620.4350
+ Ours33.390.382428.820.396020.270.479522.980.3820
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.422, + 0.788, + 0.542 + ], + "angle": 0, + "content": "Qualitative comparison. We show qualitative comparison on out-of-domain datasets in Fig. 7. We observe similar improvements as in the within-domain datasets. Even though the 3D-aware fine-tuning is only conducted on indoor dataset ScanNet++, the fine-tuned features exhibit transferability to improve segmentation results for the detailed structures of common objects like bicycle and animal and help denoise segmentation of objects like tree, building and pillar. On depth estimation, the incorporated 3D-aware features are helpful in capturing the detailed structure of trees." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.565, + 0.585, + 0.58 + ], + "angle": 0, + "content": "4.5 Generalization to Other Vision Models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.591, + 0.788, + 0.683 + ], + "angle": 0, + "content": "We conduct experiments on more vision models (DINOv2-reg [10], CLIP [46], MAE [24], DeiT-III [54]) to prove the universality of our method. We show the linear probing results of semantic segmentation and depth estimation on ScanNet++ validation set in Tab. 4. Our method consistently improves all the models. We also visualize the features in Fig. 2. Note that the original MAE features are already clean but our method still improves them." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.705, + 0.513, + 0.721 + ], + "angle": 0, + "content": "4.6 Ablation Studies and Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.731, + 0.787, + 0.761 + ], + "angle": 0, + "content": "We conduct ablation studies on semantic segmentation on NYUv2 dataset with DINOv2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Feature dimension of each Gaussian. We attach a low-dimensional feature vector with each Gaussian and then up-project it to the same space with DINOv2. Tab. 5 indicates that increasing the feature dimension from 32 to 64 will improve the performance of fine-tuned DINOv2 with an acceptable higher memory and longer training time. Increasing the feature dimension further to 128 is" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.296, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.145, + 0.785, + 0.501 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.512, + 0.788, + 0.542 + ], + "angle": 0, + "content": "Fig. 7: Qualitative results on out-of-domain datasets. Our 3D-aware features help DINoV2 achieve less noisy segmentation and capture detailed structure." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.571, + 0.785, + 0.618 + ], + "angle": 0, + "content": "not feasible in our hardware due to the large memory consumption. We chose a feature dimension of 64 as a good compromise between model performance, memory consumption, as well as training time." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.621, + 0.788, + 0.728 + ], + "angle": 0, + "content": "Feature assembly strategy. We study different strategies to assemble the fine-tuned features with the original DINOv2 features in Tab. 7. We explore simple channel-wise adding and concatenation. Alternatively, we first concatenate the fine-tuned features with the original DINOv2 features then use a liner layer to fuse them to the same feature space of DINOv2. We observe simple concatenation works well in incorporating learned 3D-aware features while preserving original generalization ability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.73, + 0.788, + 0.793 + ], + "angle": 0, + "content": "Fine-tuning epochs. We finetune DINOv2 using the features rendered by the pre-trained feature Gaussians. Tab. 8 suggests that a single epoch is sufficient to transfer the 3D awareness to DINOv2 and more epochs may harm the model's generalization ability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Fine-tuning vs. adapter. Besides directly fine-tuning DINOv2, we explore an alternative strategy where we keep DINOv2 frozen and introduce an adapter on top of that. The adapter is a single Swin Transformer block [37]. We observe the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.56, + 0.203 + ], + "angle": 0, + "content": "Table 5: Ablation study on feature dimension of 3D Gaussian. Increasing feature dimensions improves performance at the cost of larger memory consumption and longer training time." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.213, + 0.56, + 0.253 + ], + "angle": 0, + "content": "
Feature dimensionAverage memory (MB)Average Training time (h)mAcc (↑)mIoU (↑)aAcc (↑)
323701.378.7767.1583.44
644951.680.5267.583.37
1287502.5---
" + }, + { + "type": "table_caption", + "bbox": [ + 0.566, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 6: Ablation study on fine-tuning vs. adapter. An adapter is a tiny network plugged into the frozen DINOv2 features." + }, + { + "type": "table", + "bbox": [ + 0.568, + 0.213, + 0.785, + 0.253 + ], + "angle": 0, + "content": "
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Fine-tuning91.0482.3596.14
Adapter90.9782.0295.96
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.268, + 0.475, + 0.325 + ], + "angle": 0, + "content": "Table 7: Ablation study on feature assembly. We study different strategies to assemble fine-tuned features with the original DINOV2." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.336, + 0.472, + 0.387 + ], + "angle": 0, + "content": "
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Adding77.9766.082.85
Linear fusion78.2266.3982.89
Concatenation80.5267.583.37
" + }, + { + "type": "table_caption", + "bbox": [ + 0.482, + 0.268, + 0.787, + 0.324 + ], + "angle": 0, + "content": "Table 8: Ablation study on fine-tuning epochs. We find fine-tuning with a single epoch with 8.5 hours is sufficient to achieve good performance." + }, + { + "type": "table", + "bbox": [ + 0.486, + 0.336, + 0.784, + 0.387 + ], + "angle": 0, + "content": "
EpochsFine-tun. time (h)mAcc (↑)mIoU (↑)aAcc (↑)
18.580.5267.583.37
21778.7267.2583.54
325.579.567.1883.24
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.417, + 0.785, + 0.464 + ], + "angle": 0, + "content": "adapter can achieve comparable performance with fine-tuning (Tab. 6), however, with longer training time. We stick with the fine-tuning strategy for simplicity without introducing any additional network component." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.467, + 0.788, + 0.573 + ], + "angle": 0, + "content": "Limitations and discussion. Our work makes an initial step to transfer multiview consistent and 3D-aware features encoded by a 3D Gaussian representation to 2D foundation model via fine-tuning. We demonstrate the 3D-aware features are helpful for downstream tasks. However, we still need the original features to keep the generalization ability. We attribute this to the limited diversity of our 3D training data (only a single indoor dataset) and hypothesize that this can be remedied by fine-tuning on larger-scale data." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.601, + 0.36, + 0.618 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.638, + 0.788, + 0.791 + ], + "angle": 0, + "content": "In this work, we present a method to inject 3D awareness into 2D foundation models. We first lift 2D foundation features into a 3D Gaussian representation and then use the rendered multi-view consistent and 3D-aware features to in turn fine-tune the 2D foundation model. Our experiments show that incorporating the fine-tuned features readily leads to improved performance on both semantic and geometric tasks through simple linear probing. Although we only conduct the 3D-aware fine-tuning on a single dataset \\(\\mathrm{ScanNet}++\\), we demonstrate the learned 3D awareness is transferable across a variety of datasets in different domains. We hope our work inspires future research to consider equipping 2D foundation models with 3D-aware understanding." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Acknowledgements Francis Engelmann is partially supported by an ETH AI Center postdoctoral research fellowship and an ETH Zurich Career Seed Award." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.295, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.176, + 0.786, + 0.218 + ], + "angle": 0, + "content": "1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep ViT Features as Dense Visual Descriptors. In: European Conference on Computer Vision (ECCV) Workshops (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.219, + 0.786, + 0.259 + ], + "angle": 0, + "content": "2. Bachmann, R., Mizrahi, D., Atanov, A., Zamir, A.: MultiMAE: Multi-modal Multitask Masked Autoencoders. In: European Conference on Computer Vision (ECCV) (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.26, + 0.786, + 0.299 + ], + "angle": 0, + "content": "3. Bao, H., Dong, L., Piao, S., Wei, F.: BEiT: BERT Pre-training of Image Transformers. In: International Conference on Learning Representations (ICLR) (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.301, + 0.786, + 0.342 + ], + "angle": 0, + "content": "4. Bengio, Y., Courville, A., Vincent, P.: Representation Learning: A Review and New Perspectives. Transactions on Pattern Analysis and Machine Intelligence (PAMI) (2013) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.343, + 0.786, + 0.384 + ], + "angle": 0, + "content": "5. Bhat, S.F., Alhashim, I., Wonka, P.: Adabins: Depth Estimation Using Adaptive Bins. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2021) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.385, + 0.786, + 0.425 + ], + "angle": 0, + "content": "6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised Learning of Visual Features by Contrasting Cluster Assignments. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.786, + 0.467 + ], + "angle": 0, + "content": "7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging Properties in Self-Supervised Vision Transformers. In: International Conference on Computer Vision (ICCV) (2021) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.786, + 0.509 + ], + "angle": 0, + "content": "8. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative Pretraining From Pixels. In: International Conference on Machine Learning (ICML) (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.509, + 0.786, + 0.55 + ], + "angle": 0, + "content": "9. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: ScanNet: Richly-Annotated 3D Reconstructions of Indoor Scenes. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.551, + 0.786, + 0.589 + ], + "angle": 0, + "content": "0. Darcet, T., Oquab, M., Mairal, J., Bojanowski, P.: Vision Transformers Need Registers. In: International Conference on Learning Representations (ICLR) (2024) 3, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.591, + 0.786, + 0.619 + ], + "angle": 0, + "content": "1. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. NAACL (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.62, + 0.786, + 0.66 + ], + "angle": 0, + "content": "2. Doersch, C., Gupta, A., Efros, A.A.: Unsupervised Visual Representation Learning by Context Prediction. In: International Conference on Computer Vision (ICCV) (2015) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.786, + 0.716 + ], + "angle": 0, + "content": "3. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An Image Is Worth 16x16 Words: Transformers for Image Recognition at Scale. In: International Conference on Learning Representations (ICLR) (2020) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.717, + 0.786, + 0.758 + ], + "angle": 0, + "content": "4. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative Unsupervised Feature Learning With Convolutional Neural Networks. In: International Conference on Neural Information Processing Systems (NeurIPS) (2014) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.786, + 0.813 + ], + "angle": 0, + "content": "5. El Banani, M., Raj, A., Maninis, K.K., Kar, A., Li, Y., Rubinstein, M., Sun, D., Guibas, L., Johnson, J., Jampani, V.: Probing the 3D Awareness of Visual Foundation Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.786, + 0.84 + ], + "angle": 0, + "content": "6. Engelmann, F., Manhardt, F., Niemeyer, M., Tateno, K., Tombari, F.: OpenNeRF: Open Set 3D Neural Scene Segmentation with Pixel-Wise Features and Rendered" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.176, + 0.786, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.245, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "Novel Views. In: International Conference on Learning Representations (ICLR) (2024) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.175, + 0.786, + 0.216 + ], + "angle": 0, + "content": "17. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal Visual Object Classes Challenge: A Retrospective. International Journal of Computer Vision (2015) 8, 10, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.216, + 0.786, + 0.242 + ], + "angle": 0, + "content": "18. Geiger, A., Lenz, P., Stiller, C., Urtasun, R.: Vision Meets Robotics: The Kitti Dataset. The International Journal of Robotics Research (2013) 8, 10, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.242, + 0.786, + 0.284 + ], + "angle": 0, + "content": "19. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling Open-Vocabulary Image Segmentation With Image-Level Labels. In: European Conference on Computer Vision (ECCV) (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.284, + 0.786, + 0.324 + ], + "angle": 0, + "content": "20. Gidaris, S., Singh, P., Komodakis, N.: Unsupervised Representation Learning by Predicting Image Rotations. In: International Conference on Learning Representations (ICLR) (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.324, + 0.786, + 0.379 + ], + "angle": 0, + "content": "21. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap Your Own Latent-a New Approach to Self-Supervised Learning. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.379, + 0.786, + 0.406 + ], + "angle": 0, + "content": "22. Ha, H., Song, S.: Semantic Abstraction: Open-world 3D Scene Understanding From 2D Vision-Language Models. In: Conference on Robot Learning (CoRL) (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.406, + 0.786, + 0.446 + ], + "angle": 0, + "content": "23. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality Reduction by Learning an Invariant Mapping. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2006) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.446, + 0.786, + 0.487 + ], + "angle": 0, + "content": "24. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked Autoencoders Are Scalable Vision Learners. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 4, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.487, + 0.786, + 0.528 + ], + "angle": 0, + "content": "25. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum Contrast for Unsupervised Visual Representation Learning. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.528, + 0.786, + 0.569 + ], + "angle": 0, + "content": "26. Hou, J., Dai, X., He, Z., Dai, A., Nießner, M.: Mask3D: Pre-training 2D Vision Transformers by Learning Masked 3D Priors. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.569, + 0.786, + 0.609 + ], + "angle": 0, + "content": "27. Hou, J., Xie, S., Graham, B., Dai, A., Nießner, M.: Pri3D: Can 3D Priors Help 2D Representation Learning? In: International Conference on Computer Vision (ICCV) (2021) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.609, + 0.786, + 0.663 + ], + "angle": 0, + "content": "28. Huang, R., Peng, S., Takmaz, A., Tombari, F., Pollefeys, M., Song, S., Huang, G., Engelmann, F.: Segment3D: Learning Fine-Grained Class-Agnostic 3D Segmentation without Manual Labels. European Conference on Computer Vision (ECCV) (2024) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.663, + 0.786, + 0.704 + ], + "angle": 0, + "content": "29. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., et al.: ConceptFusion: Open-set Multimodal 3D Mapping. Robotics: Science and Systems (RSS) (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.704, + 0.786, + 0.759 + ], + "angle": 0, + "content": "30. Ke, B., Obukhov, A., Huang, S., Metzger, N., Daudt, R.C., Schindler, K.: Repurposing Diffusion-Based Image Generators for Monocular Depth Estimation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.786, + 0.799 + ], + "angle": 0, + "content": "31. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3D Gaussian Splatting for Real-Time Radiance Field Rendering. ACM Transactions on Graphics (2023) 2, 4, 5, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.786, + 0.841 + ], + "angle": 0, + "content": "32. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: LERF: Language Embedded Radiance Fields. In: International Conference on Computer Vision (ICCV) (2023) 3" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.295, + 0.115, + 0.734, + 0.13 + ], + "angle": 0, + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "33. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment Anything. In: International Conference on Computer Vision (ICCV) (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.189, + 0.788, + 0.23 + ], + "angle": 0, + "content": "34. Kobayashi, S., Matsumoto, E., Sitzmann, V.: Decomposing Nerf for Editing via Feature Field Distillation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.23, + 0.788, + 0.271 + ], + "angle": 0, + "content": "35. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven Semantic Segmentation. In: International Conference on Learning Representations (ICLR) (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.271, + 0.788, + 0.325 + ], + "angle": 0, + "content": "36. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask DINO: Towards a Unified Transformer-Based Framework for Object Detection and Segmentation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.325, + 0.788, + 0.367 + ], + "angle": 0, + "content": "37. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin Transformer: Hierarchical Vision Transformer Using Shifted Windows. In: International Conference on Computer Vision (ICCV) (2021) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.366, + 0.788, + 0.393 + ], + "angle": 0, + "content": "38. Loshchilov, I., Hutter, F.: Decoupled Weight Decay Regularization. In: International Conference on Learning Representations (ICLR) (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.393, + 0.788, + 0.433 + ], + "angle": 0, + "content": "39. Mazur, K., Sucar, E., Davison, A.J.: Feature-realistic Neural Fusion for Real-time, Open Set Scene Understanding. In: International Conference on Robotics and Automation (ICRA) (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.433, + 0.788, + 0.473 + ], + "angle": 0, + "content": "40. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. In: European Conference on Computer Vision (ECCV) (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.473, + 0.788, + 0.513 + ], + "angle": 0, + "content": "41. Noroozi, M., Favaro, P.: Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles. In: European Conference on Computer Vision (ECCV) (2016) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.513, + 0.788, + 0.568 + ], + "angle": 0, + "content": "42. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: DINOV2: Learning Robust Visual Features Without Supervision. Transactions on Machine Learning Research (2023) 1, 2, 3, 5, 6, 7, 8, 9, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.568, + 0.788, + 0.609 + ], + "angle": 0, + "content": "43. Pathak, D., Girshick, R., Dollar, P., Darrell, T., Hariharan, B.: Learning Features by Watching Objects Move. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.609, + 0.788, + 0.65 + ], + "angle": 0, + "content": "44. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T.: OpenScene: 3D Scene Understanding with Open Vocabularies. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.65, + 0.788, + 0.69 + ], + "angle": 0, + "content": "45. Qin, M., Li, W., Zhou, J., Wang, H., Pfister, H.: LangSplat: 3D Language Gaussian Splatting. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.69, + 0.788, + 0.745 + ], + "angle": 0, + "content": "46. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning Transferable Visual Models From Natural Language Supervision. In: International Conference on Machine Learning (ICML) (2021) 3, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.745, + 0.788, + 0.786 + ], + "angle": 0, + "content": "47. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-Resolution Image Synthesis With Latent Diffusion Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.786, + 0.788, + 0.84 + ], + "angle": 0, + "content": "48. Saxena, S., Herrmann, C., Hur, J., Kar, A., Norouzi, M., Sun, D., Fleet, D.J.: The Surprising Effectiveness of Diffusion Models for Optical Flow and Monocular Depth Estimation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2024) 2" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.127 + ], + "angle": 0, + "content": "Y. Yue et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "49. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled Feature Fields Enable Few-Shot Language-Guided Manipulation. In: Conference on Robot Learning (CoRL) (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.786, + 0.232 + ], + "angle": 0, + "content": "50. Shi, J.C., Wang, M., Duan, H.B., Guan, S.H.: Language Embedded 3D Gaussians for Open-Vocabulary Scene Understanding. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.787, + 0.272 + ], + "angle": 0, + "content": "51. Silberman, N., Hoiem, D., Kohli, P., Fergus, R.: Indoor Segmentation and Support Inference From RGBD Images. In: European Conference on Computer Vision (ECCV) (2012) 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.787, + 0.314 + ], + "angle": 0, + "content": "52. Takmaz, A., Fedele, E., Sumner, R.W., Pollefeys, M., Tombari, F., Engelmann, F.: OpenMask3D: Open-Vocabulary 3D Instance Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.787, + 0.355 + ], + "angle": 0, + "content": "53. Tan, H., Wu, S., Pi, J.: Semantic Diffusion Network for Semantic Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.356, + 0.787, + 0.384 + ], + "angle": 0, + "content": "54. Touvron, H., Cord, M., Jégou, H.: Deit III: Revenge of the ViT. In: European Conference on Computer Vision (ECCV) (2022) 3, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.787, + 0.424 + ], + "angle": 0, + "content": "55. Tschernezki, V., Laina, I., Larlus, D., Vedaldi, A.: Neural Feature Fusion Fields: 3D Distillation of Self-Supervised 2D Image Representations. In: International Conference on 3D Vision (3DV) (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.452 + ], + "angle": 0, + "content": "56. Wang, X., Gupta, A.: Unsupervised Learning of Visual Representations Using Videos. In: International Conference on Computer Vision (ICCV) (2015) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.787, + 0.493 + ], + "angle": 0, + "content": "57. Weder, S., Blum, H., Engelmann, F., Pollefeys, M.: LabelMaker: Automatic Semantic Label Generation from RGB-D Trajectories. In: International Conference on 3D Vision (3DV) (2024) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.494, + 0.787, + 0.549 + ], + "angle": 0, + "content": "58. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: CroCo: Self-Supervised Pre-training for 3D Vision Tasks by Cross-View Completion. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.549, + 0.787, + 0.591 + ], + "angle": 0, + "content": "59. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth Anything: Unleashing the Power of Large-Scale Unlabeled Data. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.591, + 0.787, + 0.632 + ], + "angle": 0, + "content": "60. Yeshwanth, C., Liu, Y.C., Nießner, M., Dai, A.: ScanNet++: A High-Fidelity Dataset of 3D Indoor Scenes. In: International Conference on Computer Vision (ICCV) (2023) 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.787, + 0.688 + ], + "angle": 0, + "content": "61. Zhang, J., Herrmann, C., Hur, J., Polania Cabrera, L., Jampani, V., Sun, D., Yang, M.H.: A Tale of Two Features: Stable Diffusion Complements DINO for Zero-Shot Semantic Correspondence. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.787, + 0.73 + ], + "angle": 0, + "content": "62. Zhou, B., Zhao, H., Puig, X., Fidler, S., Barriuso, A., Torralba, A.: Scene Parsing Through ade20K Dataset. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 10, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.787, + 0.785 + ], + "angle": 0, + "content": "63. Zhou, S., Chang, H., Jiang, S., Fan, Z., Zhu, Z., Xu, D., Chari, P., You, S., Wang, Z., Kadambi, A.: Feature 3DGS: Supercharging 3D Gaussian Splatting to Enable Distilled Feature Fields. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.785 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_origin.pdf b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9de2467adf43d98e84e1b5390d285a87ac831334 --- /dev/null +++ b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/bd36f723-8ff2-4174-8da8-60d615463fb5_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6df66eb356687ab32b94f71634afdb29313d22fcd242e3593b3f56a1e0194c32 +size 3955680 diff --git a/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/full.md b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/full.md new file mode 100644 index 0000000000000000000000000000000000000000..ec84afdecc1bd29d881bfaa4a95d076edb75b614 --- /dev/null +++ b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/full.md @@ -0,0 +1,302 @@ +# Improving 2D Feature Representations by 3D-Aware Fine-Tuning + +Yuanwen Yue $^{1}$ , Anurag Das $^{2}$ , Francis Engelmann $^{1,3}$ , Siyu Tang $^{1}$ , and Jan Eric Lenssen $^{2}$ + +$^{1}$ ETH Zurich + +3 Google + +2 Max Planck Institute for Informatics, Saarland Informatics Campus + +![](images/04aa4d9f1fade7e93f04254bdcdfa8d1c4e2384d2fac7c1da9ba814264b84a64.jpg) +Fig. 1: We propose 3D-aware fine-tuning to improve 2D foundation features. Our method starts with lifting 2D image features (e.g. DINOv2 [42]) (b) to a 3D representation. Then we finetune the 2D foundation model using the 3D-aware features (c). We demonstrate that incorporating the fine-tuned features (d) results in improved performance on downstream tasks such as semantic segmentation and depth estimation on a variety of datasets with simple linear probing (right). Feature maps are visualized using principal component analysis (PCA). + +Abstract. Current visual foundation models are trained purely on unstructured 2D data, limiting their understanding of 3D structure of objects and scenes. In this work, we show that fine-tuning on 3D-aware data improves the quality of emerging semantic features. We design a method to lift semantic 2D features into an efficient 3D Gaussian representation, which allows us to re-render them for arbitrary views. Using the rendered 3D-aware features, we design a fine-tuning strategy to transfer such 3D awareness into a 2D foundation model. We demonstrate that models fine-tuned in that way produce features that readily improve downstream task performance in semantic segmentation and depth estimation through simple linear probing. Notably, though fine-tuned on a single indoor dataset, the improvement is transferable to a variety of indoor datasets and out-of-domain datasets. We hope our study encourages the community to consider injecting 3D awareness when training 2D foundation models. Project page: https://ywyue.github.io/FiT3D. + +Keywords: Representation learning $\cdot$ Foundation models $\cdot$ Gaussian splatting $\cdot$ Scene understanding + +# 1 Introduction + +Ever since the emergence of deep neural networks, vision systems are largely trained on 2D datasets. With the scalability of recent architectures, like vision transformers (ViT) [13], several large vision models [7, 24, 33, 42, 47] have been trained from a rich set of 2D images by either supervised or self-supervised learning. Visual foundation models have shown impressive utility as general feature extractors that can be applied to improve results on downstream tasks, such as segmentation [36, 53], depth estimation [30, 48, 59], or correspondence estimation [1, 61]. They are trained on a large amount of readily available 2D images and, thus, learn statistics about object and scene structure in 2D-pixel space. + +Images, as a simple projection of our 3D world, are easy to obtain and provide an efficient way to depict the visual world while at the same time discarding explicit 3D geometry information. It is expected that vision systems purely trained on 2D images cannot fully understand the underlying 3D structure of our world [15]. There are several promising properties of our 3D world, for example, multi-view consistency, and multi-view fusion for solving single-view ambiguities. A crucial limitation of the training setups of these models is that they don't fully reason about the 3D structure of seen objects. Training images are presented to the network in an unstructured way, without any multi-view or video correspondences that would allow matching observations of the same object from multiple views. As a consequence, these models have limited 3D understanding of objects observed from, e.g., different views are not producing view-consistent features. + +In contrast, when we humans observe images, we effortlessly achieve a holistic understanding by not only perceiving the 2D visual content but also exploiting the inferred underlying 3D structure, which we have learned through lifelong observation of stereo and temporal information. In this work, we investigate if large scale 2D vision models can also profit from equipping them with such 3D-aware understanding abilities induced by showing the right type of data. + +To this end, we design a novel two-stage approach to improve the 3D-aware understanding ability of 2D foundation models. In the first stage, we aim to obtain 3D-aware features as training data. Motivated by recent advancements in neural scene representation, we design an approach to lift multi-view 2D foundation features into an efficient 3D Gaussian representation [31]. The lifting process exploits multi-view consistency and allows 2D features from different views to complement each other. Moreover, the fused features (Fig. 1 (c)) exhibit high resolution with fine details thanks to the learned 3D structure, emerging from multi-view RGB guidance. Once trained, the 3D Gaussians can render features for arbitrary views. In the following, we refer to features obtained in this way as 3D-aware. In the second stage, we utilize the rendered 3D-aware features to finetune the 2D foundation models (Fig. 2). To this end, we design an efficient fine-tuning strategy to transfer such 3D awareness into 2D foundation models. After fine-tuning, we evaluate the feature quality on downstream tasks that might profit from a better 3D understanding, namely semantic segmentation and depth estimation. Extensive experiments demonstrate that incorporating the + +![](images/b3754b65b13c984389f68646b9887a99df5d427e84389964537e86f319004f3b.jpg) + +![](images/227c57ea9e5af033e5cfa4066f237c1cb4332f55d82e3f2936cd3018b916e127.jpg) +Fig. 2: Our 3D-aware fine-tuning is universal and applicable to a variety of 2D vision models, e.g. DINOv2 [42], DINOv2-reg [10], CLIP [46], MAE [24], and DeiT-III [54] (c.f. Sec. 4.5). + +![](images/b33a561685e6564c8dc854bec3ce01b6188e816a513a93a22a4d8e5abdbdc2d5.jpg) + +![](images/2fe8207f02239bef4cf3f3a48cf57eac03d0190526ec365bf19e6f9f7c4a5ea6.jpg) + +![](images/8c2feaf1b2576248a81f66a0eb400cb78cc84d62072ce6a642c0648f649a45b6.jpg) + +![](images/1d4b9573cbb17e18b3789b5514ff8d4b3cdb444f8e6ce9a149a9dc1387023b5d.jpg) + +3D-aware features improves downstream tasks with simple linear probing and exhibits generalization ability on out-of-domain datasets. + +# 2 Related Work + +We give an overview about recent self-supervised 2D representation learning techniques in Sec. 2.1, and how emerging features have been distilled into 3D representations in Sec. 2.2. Then, we discuss previous work that utilizes 3D information to improve 2D representation methods in Sec. 2.3. + +# 2.1 2D Representation Learning + +Representation learning [4] has achieved remarkable progress in the image domain. It aims to learn generalizable visual features from a rich set of data. Self-supervised representation learning has gained particular interest since it does not require labeled data. Early works employ pretext tasks for pre-training, which aim to exploit inherent data attributes to automatically generate surrogate labels [12,14,20,41,43,56]. Later, contrastive learning [23] has been popularly used for representation learning by leveraging discriminative signals between images or groups of images [6,7,21,25,42]. More recently, motivated by BERT [11], a new paradigm of masked image modeling [3,8,24] has been proposed for scalable visual learning. Nevertheless, all those methods are only trained on 2D image data, without accessing the underlying 3D structure. Our work aims to supplement the features purely learned from 2D observations with 3D awareness. + +# 2.2 Distilled Feature Fusion Fields + +Neural radiance fields (NeRF) [40] emerge as a promising scene representation for high-quality 3D reconstruction and novel view synthesis. Recently, some works [16,32,34,55] explore distilling pre-trained image features (e.g. DINO [7], CLIP [46], LSeg [35], or OpenSeg [19]) into NeRF via neural rendering. Without requiring any labels, such distilled feature fusion fields enable several zero-shot 3D scene understanding tasks, e.g. segmentation, scene editing, and open-vocabulary queries. We share similar inspiration from these works by distilling + +2D features into a 3D representation. However, instead of focusing on perception tasks with feature fields, we are interested in leveraging the rendered 3D-aware features to in turn improve the 2D feature extractor. We demonstrate that the transferred 3D awareness can readily improve the 2D features on both semantic and geometric tasks. Moreover, we extend the recent Gaussian-based representation [31] by designing a method to distill 2D features into 3D Gaussians while keeping high efficiency and memory under bound. There are several concurrent works introducing 3D Gaussians with semantic features [45, 50, 63]. However, none of these works distill features back into 2D models. Our work shows, for the first time, that semantic features fused into 3D representations can effectively improve 2D foundation models via fine-tuning. + +# 2.3 Injecting 3D Priors to 2D + +Existing works mainly focus on fusing multi-view 2D features into the 3D representation [22, 28, 29, 39, 44, 49, 52, 57]. Little attention has been paid to the other direction of incorporating 3D awareness into 2D representation learning. Pri3D [27] uses geometric constraints (multi-view consistency and 2D-3D correspondence) from RGB-D reconstructions to learn 3D priors for image-based representations with contrastive learning. Recently, inspired by the masked autoencoder (MAE) [24], several works adopt the masked image modeling strategy to learn 3D priors [2, 26, 58]. However, all these methods require pre-training the 2D feature extractor, typically a Vision Transformer (ViT) backbone [13], using their hand-crafted pretext tasks. The pre-trained models are then employed to downstream tasks via fine-tuning. By contrast, we aim to transfer the 3D awareness embedded in multi-view fused features to the 2D feature extractor through fine-tuning with little computational resources. Our 3D-aware features readily improve downstream task performance with simple linear probing. + +# 3 Method + +In this section, we introduce our method for fine-tuning 2D foundation models with 3D-aware features. We present a two-stage pipeline (c.f. Fig 3). In the first stage, we lift multi-view inconsistent 2D features into a multi-view consistent and 3D-aware representation. The representation and setup are described in Sec. 3.1. In the second stage, we use the obtained 3D-aware feature representations as training dataset to fine-tune the 2D feature extractor, which is detailed in Sec. 3.2. Last, we describe the linear probing methodology for feature evaluation in Sec. 3.3. + +# 3.1 Lifting Features to 3D + +Lifting semantic 2D features into 3D has been a trend recently and several different options exist (c.f. Sec. 2). For our purposes of using larger amounts of scenes as training data for 2D models, the most important aspect is efficiency. + +![](images/ebf36e2a62f9a4d9a86cf2d3e374844078fff5dc0d003f7b3ddffceee9fb3ca0.jpg) +Fig. 3: Overall pipeline. We present a two-stage pipeline. In the first state, we lift 2D foundation features (e.g. DINOv2 [42]) into 3D-aware features by training 3D Gaussian representation $\mathcal{G}_i$ . In the second stage, we use the rendered features to finetune the 2D foundation model $\varepsilon^{2D}$ . With $\rightarrow$ we denote gradient flow. + +![](images/8a1fd794d49723b424caeb61a845d58e125b6ef5c07a914f7e5757861a50f53e.jpg) + +The representation needs to (1) be able to efficiently fit a large number of scenes into 3D representations and (2) have a fast rendering mechanism for efficient integration into a fine-tuning loop of a 2D foundation model. Thus, we utilize the recent advances in 3D Gaussian splatting [31], which enable fast optimization and real-time rendering. Fig. 4 illustrates how we extend Gaussian splatting to lift 2D foundation features and we detail the method below. + +3D feature Gaussians. Adapting the formulation of 3D Gaussian splatting [31], we define a set of 3D Gaussians as + +$$ +\mathcal {G} = \left\{\left(\boldsymbol {\mu}, \mathbf {s}, \mathbf {R}, \alpha , \mathbf {S H}, \mathbf {f}\right) _ {j}\right) \} _ {1 \leq j \leq M}, \tag {1} +$$ + +where $\pmb{\mu} \in \mathbb{R}^3$ is the 3D mean of the Gaussian, $\mathbf{S} = \mathrm{diag}(\mathbf{s}) \in \mathbb{R}^{3 \times 3}$ is the Gaussian scale, $\mathbf{R} \in \mathbb{R}^{3 \times 3}$ its orientation, $\alpha \in \mathbb{R}$ is a per-Gaussian opacity, and $\mathbf{SH}$ a vector of spherical harmonic coefficients, encoding view-dependent color. The Gaussian covariance matrix is obtained by combining scale and orientation as $\pmb{\Sigma} = \mathbf{RSS}^\top \mathbf{R}^\top$ . In addition to the original parameters, we introduce a per-Gaussian feature vector $\mathbf{f} \in \mathbb{R}^D$ to store distilled 2D features in 3D space. Those feature vectors are rasterized into a 2D feature image with our designed feature rasterizer. Inspired by the differentiable color rasterizer of Gaussian splatting, we rasterize the features using point-based $\alpha$ -blending as follows: + +$$ +\mathbf {F} ^ {\text {l o w}} = \sum_ {i \in \mathcal {N}} \mathbf {f} _ {i} \alpha_ {i} \prod_ {j = 1} ^ {i - 1} (1 - \alpha_ {i}) \tag {2} +$$ + +where $\mathcal{N}$ is a set of ordered Gaussians overlapping the pixel, $\mathbf{f}_i$ is the feature of each Gaussian and $\alpha_{i}$ is given by evaluating a 2D Gaussian with covariance $\pmb{\Sigma}$ multiplied with a learned per-point opacity. + +Up-projecting features. A strong limitation of 3D Gaussians as representation is their memory consumption. Since there can be millions of Gaussians per scene, it is impossible to store, e.g., the 384-dimensional DINO features directly on each of the 3D Gaussians. Therefore, to stay memory efficient and keep the fast + +![](images/7364ad014cf79b5ff1febe8e7d90b162b8b1fefa56ebf54615ee9449ce9e032f.jpg) +Fig. 4: Lifting 2D features into 3D Gaussian representation. We equip each Gaussian with a low-dimensional feature vector $\mathbf{f}$ . We render colors using the same color rasterizer as Gaussian splatting [31]. We design a feature rasterizer to render a low-dimensional feature image $\mathbf{F}^{\mathrm{low}}$ , which is subsequently projected to a high-dimensional feature image $\mathbf{F}^{\mathrm{high}}$ using a simple CNN. We use 2D foundation features $\mathbf{F}$ from model $\varepsilon^{2\mathrm{D}}$ to supervise the feature learning. + +rendering process, we opt for storing lower dimensional features $\mathbf{f} \in \mathbb{R}^{D}$ with $D \ll 384$ and train a scene-specific pixel-space CNN decoder $d: \mathbf{F}^{\mathrm{low}} \mapsto \mathbf{F}^{\mathrm{high}}$ to up-project feature images into high-dimensional feature space after rendering. We analyze the trade-off introduced by this approach in Sec. 4.6. + +Optimization. For a given scene, the full 3D Gaussian representation, including our distilled features, is obtained using optimization. Let $\{\mathbf{I}_i\}_{1\leq i\leq N}$ be a set of multi-view images of a scene with corresponding camera parameters, $\{\mathbf{F}_i\}_{1\leq i\leq N}$ a corresponding set of feature maps from a 2D feature extractor (e.g. DINOv2 [42]), and $r^{\mathrm{rgb}}$ , $r^{\mathrm{feat}}$ rasterization functions that render a set of Gaussians into an RGB or feature image, respectively, using the camera pose $\mathbf{P}_i$ of image $i$ . Then, we optimize the Gaussian parameters, to optimally represent images $\mathbf{I}_i$ and feature images $\mathbf{F}_i$ : + +$$ +\hat {\mathcal {G}} = \underset {\{(\boldsymbol {\mu}, \mathbf {s}, \mathbf {R}, \alpha , \mathbf {S H}, \mathbf {f}) _ {i} \}} {\arg \min } \sum_ {i = 1} ^ {N} \mathcal {L} ^ {c} (r ^ {\mathrm {r g b}} (\mathcal {G}, \mathbf {P} _ {i}), \mathbf {I} _ {i}) + \mathcal {L} ^ {f} (d (r ^ {\mathrm {f e a t}} (\mathcal {G}, \mathbf {P} _ {i}), \mathbf {F} _ {i}), \quad (3) +$$ + +where $\mathcal{L}^c$ is a pixel-wise $l_{1}$ loss combined with a D-SSIM term on RGB images, and $\mathcal{L}^f$ is a pixel-wise $l_{1}$ loss on feature images. Notably, we only optimize $\mathbf{f}$ with gradients coming from $\mathcal{L}^f$ (feature images) and the rest of the parameters only on $\mathcal{L}^c$ (RGB loss). This has proven to be essential to obtain a consistent 3D feature representation, as a loss from feature space does not lead to correct Gaussian mean, covariance and opacity. We speculate that the reason for this is the missing 3D consistency of the 2D feature extractor. Only through forcing them into a 3D consistent representation, we make them consistent in return. + +Algorithm 1 3D-aware fine-tuning algorithm +Input: Pre-trained Feature Gaussian representations $\{\mathcal{G}_1,\dots,\mathcal{G}_K\}$ , pre-trained 2D feature extractor $\varepsilon_{\theta}^{2D}$ , a set of images $\{\mathbf{I}_i\}_{i=1}^N$ and associated camera poses $\{\mathbf{P}_i\}_{i=1}^N$ . +Output: Fine-tuned 2D feature extractor $\varepsilon_{\hat{\theta}}^{2D}$ . +1: Load $\mathcal{G} \sim \{\mathcal{G}_1,\dots,\mathcal{G}_K\}$ +2: while fine-tuning do +3: Sample an image $\mathbf{I}_i$ and camera pose $\mathbf{P}_i$ , $i \sim \mathcal{U}\{1,N\}$ +4: Retrieve associated feature Gaussian $\mathcal{G}$ and CNN decoder $d$ +5: Render $\mathbf{F}^{\mathrm{high}} \gets d(r^{\mathrm{feat}}(\mathcal{G},\mathbf{P}_i))$ +6: Step $\theta$ by minimizing $\mathcal{L}(\varepsilon_{\theta}^{2D}(\mathbf{I}_i),\mathbf{F}^{\mathrm{high}})$ +7: end while +return $\varepsilon_{\hat{\theta}}^{2D}$ + +# 3.2 3D-Aware Fine-Tuning + +The procedure described in the last section is used to fit 3D feature Gaussian representations of $K$ scenes. The algorithm of 3D-aware fine-tuning is outlined in Algorithm 1. The fine-tuning process requires training pairs of original 2D feature maps and 3D-aware feature maps. Since it is memory-intensive to save the feature maps, we generate the training pairs on the fly. Considering it is time-consuming to load each pre-trained Gaussian when rendering features, we pre-load all the Gaussians into CPU memory. In each step of the training loop, we randomly sample a view from all the training images, then retrieve its associated feature Gaussian and scene-specific CNN decoder and finally render features $\mathbf{F}^{\mathrm{high}}$ as the ground truth features for fine-tuning. The fine-tuning loss is a $l_{1}$ loss between $\mathbf{F}^{\mathrm{high}}$ (resized) and the output features of the fine-tuned 2D feature extractor. + +The above design makes the fine-tuning process efficient and keeps memory consumption under control. Notably, we only need to fine-tune the 2D feature extractor with a small number of epochs (e.g. 1 epoch for DINOv2 [42]) with a small learning rate without additionally introducing any network component. The fine-tuning process is fast and computation-friendly. An analysis of fine-tuning time is in Sec. 4.6. + +# 3.3 Linear Probing for Downstream Tasks + +After fine-tuning on 3D-aware features, we evaluate the emerging features on a set of standard benchmark downstream tasks. To this end, we train a linear head on top of the features to solve tasks of semantic segmentation and depth estimation on several datasets. + +Semantic segmentation. A linear layer is trained to predict class logits from patch tokens. The linear layer produces a low-resolution logit map, which is then upsampled to full resolution to obtain a segmentation map. + +Depth estimation. We concatenate the [CLS] token of the ViT to each patch token. We divide the depth prediction range into 256 uniformly distributed + +bins [5] and use a linear normalization. Then a simple linear layer is trained using a classification loss. + +Feature assembly. We concatenate original 2D features with our fine-tuned features. We observe this is key to preserving the generalization ability of the original 2D feature extractor while incorporating the 3D awareness in our fine-tuned features. Different strategies for feature assembly are evaluated in Sec. 4.6. + +# 4 Experiments + +# 4.1 Datasets + +Training. We train the feature Gaussians on ScanNet++ [60], which is a large-scale dataset of 3D indoor scenes containing sub-millimeter resolution laser scans, registered DSLR images, and commodity RGB-D streams from iPhone. We train on the official training split of 230 scenes, which contain 140451 views. + +Evaluation. To examine the effectiveness of the fine-tuned features, we conduct extensive experiments on downstream 2D tasks including semantic segmentation and depth estimation. There is no direct competitor in our study and we instead focus on whether our 3D-aware fine-tuning can bring performance gains compared with the standard 2D feature extractor. We conduct most of the experiments with DINOv2 [42] while also demonstrating the generality of our approach with other vision models in Sec. 4.5. We first evaluate on ScanNet++ [60] validation set, which contains 50 scenes with 30638 images. Then we move on to other indoor datasets ScanNet [9] and NYUd [51]. which have a similar data distribution with ScanNet++ but were captured with different sensors. To investigate the generalization ability of the fine-tuned features, we also perform out-of-domain evaluation on generally distributed datasets including ADE20k [62], Pascal VOC [17] and the outdoor dataset KITTI [18]. + +# 4.2 Implementation Details + +Feature Gaussians. We wrote custom CUDA kernels for feature rasterization. Each Gaussian is initialized with a random feature vector of dimension of 64. We implement the up-projecting CNN with a single convolutional layer with a kernel size of $3 \times 3$ . We train the feature Gaussians of each scene for novel view synthesis and feature rendering jointly for 30000 iterations. + +Fine-tuning. We finetune DINOv2 small with a feature dimension of 384 with a batch size of 2 with a learning rate of 1e-5 for 1 epoch. We use horizontal flip as data augmentation. We use the AdamW [38] optimizer with a weight decay factor 1e-4. The fine-tuning on a single Nvidia Tesla A100 takes 8.5 hours. + +Linear probing. We follow the linear probing protocol with DINOv2 [42] to ensure a fair comparison. For semantic segmentation, we train the linear layer for 40K iterations with 8 GPUs. For depth estimation, we train the linear layer for 38400 iterations with 8 GPUs. In addition, we use the same data augmentation and learning rate schedule with DINOv2. + +# 4.3 Within-domain Evaluation + +Quantitative comparison. We demonstrate the effectiveness of incorporating our 3D-aware features on downstream semantic segmentation (see Tab. 1) and depth estimation task (see Tab. 2) for indoor scenes. For semantic segmentation task, our 3D aware features consistently improve DINOv2 features, achieving a significant performance gain of $2.6\%$ , $2.0\%$ mIoU, and $1.2\%$ on ScanNet++ [60], NYUv2 [51] and ScanNet [9] datasets, respectively. Our 3D-aware DINOv2 features also improve performance on the depth estimation task. In particular, our enhanced features consistently reduce the RMSE across datasets by achieving 0.34 vs. 0.37 (DINOv2) for ScanNet++ [60], 0.42 vs. 0.44 (DINOv2) for NYUv2 [51] and 0.29 vs. 0.31 (DINOv2) for ScanNet [9] datasets. + +Qualitative comparison. We qualitatively show the benefits of 3D-aware features in Fig. 5 and Fig. 6. We observe the improvements are mainly reflected in two aspects: (1) cleaner segmentation/depth estimation in homogeneous or textureless regions, e.g. on walls and boards, and (2) better prediction with fine-grained details, e.g. on legs of chairs or tables. For (1), during the lifting of 2D features to 3D, features from multiple views are aggregated into a holistic representation, thus information from one view implicitly complements other views. We hypothesize that such multi-view awareness is transferred to DINOv2 through fine-tuning. By contrast, standard DINOv2 struggles to infer accurate segmentation or depth from a single image when with ambiguity, thus leading to noisy prediction. For (2), in our feature lifting process, we train the geometry properties (e.g. position and opacity) of Gaussians with RGB color as supervision. The RGB guidance helps feature Gaussians learn detailed 3D structure and render high-resolution feature maps (c.f. Fig. 1 (c)). During the fine-tuning process, the model learns to estimate fine-grained features of objects (c.f. Fig. 1 (d) vs. (b)), which is helpful for capturing detailed structure in downstream tasks. + +Table 1: Semantic segmentation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on semantic segmentation in comparison to standard DINOv2 across different indoor datasets. + +
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)
DINOv2 [42]40.8430.1980.2576.8865.5582.4355.8643.673.54
+ Ours43.432.7683.5480.5267.583.3758.3244.8474.37
+ +Table 2: Depth estimation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on depth estimation in comparison to standard DINOv2 across different indoor datasets. + +
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)
DINOv2 [42]0.37420.28360.44230.13920.30890.1557
+ Ours0.33610.24010.41980.13000.29210.1459
+ +![](images/37593f52bc32f25259ece3882fffcbae2ef501d2bc3d57170b523f64a0320020.jpg) +Fig. 5: Qualitative results on semantic segmentation on indoor datasets. After fine-tuning DINOv2 with 3D-aware features, we obtain less noisy and more compact segmentation results, especially for detailed structures and in homogeneous regions. + +# 4.4 Out-of-domain Evaluation + +We train feature Gaussians and fine-tune DINOv2 on ScanNet++, a dataset that contains only indoor scenes with the usual content, e.g. tables, chairs and other indoor furniture. We want to analyze how the gains obtained in this setting generalize to other domains, e.g. outdoor scenes. For semantic segmentation, we conduct linear probing on ADE20k [62] and Pascal VOC [17]. For depth estimation, we conduct linear probing on KITTI [18]. + +![](images/9281332d889b6cd36808ac7c6d6a6472d8698c85fb7147ac4ed7cca77e3395f2.jpg) +Fig. 6: Qualitative results on depth estimation on indoor datasets. After incorporating 3D-aware features, we obtain cleaner depth in textureless regions and more detailed depth on fine-grained structures, e.g. legs of tables or chairs. + +Quantitative comparison. We observe that the improvement brought by 3D-aware features is generalizable to out-of-domain challenging datasets and also outdoor driving scenes, although to a smaller degree. As shown in Tab. 3, for semantic segmentation task, incorporating our 3D-aware features brings a gain of $1.6\%$ mIoU on the ADE20k [62] and a gain of $1.2\%$ mIoU on Pascal VOC [17] over standard DINOv2 features. Furthermore, we also compare our performance on urban scene dataset KITTI [18] for depth estimation and observe our 3D-aware features help to reduce RMSE from 3.03 (DINOv2) to 2.91. + +Table 3: Quantitative performance on out-of-domain datasets. 3D-aware fine-tuning noticeably improves semantic segmentation on ADE20k and Pascal VOC and depth estimation on KITTI, demonstrating the transferability of the fine-tuned features, even under a significant domain gap. + +
MethodADE20k [62]Pascal VOC [17]KITTI [18]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)RMSE (↓)Rel (↓)
DINOv2 [42]56.7444.2879.7390.6181.1495.723.030.10
+ Ours58.7145.9381.0591.0482.3596.142.910.09
+ +Table 4: Generalization on other 2D vision models. Our 3D-aware fine-tuning applies to other 2D vision models and readily improves their performance. + +
DINOv2-regCLIPMAEDeiT-III
mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)
Original30.920.419025.610.432417.190.485518.620.4350
+ Ours33.390.382428.820.396020.270.479522.980.3820
+ +Qualitative comparison. We show qualitative comparison on out-of-domain datasets in Fig. 7. We observe similar improvements as in the within-domain datasets. Even though the 3D-aware fine-tuning is only conducted on indoor dataset ScanNet++, the fine-tuned features exhibit transferability to improve segmentation results for the detailed structures of common objects like bicycle and animal and help denoise segmentation of objects like tree, building and pillar. On depth estimation, the incorporated 3D-aware features are helpful in capturing the detailed structure of trees. + +# 4.5 Generalization to Other Vision Models + +We conduct experiments on more vision models (DINOv2-reg [10], CLIP [46], MAE [24], DeiT-III [54]) to prove the universality of our method. We show the linear probing results of semantic segmentation and depth estimation on ScanNet++ validation set in Tab. 4. Our method consistently improves all the models. We also visualize the features in Fig. 2. Note that the original MAE features are already clean but our method still improves them. + +# 4.6 Ablation Studies and Analysis + +We conduct ablation studies on semantic segmentation on NYUv2 dataset with DINOv2. + +Feature dimension of each Gaussian. We attach a low-dimensional feature vector with each Gaussian and then up-project it to the same space with DINOv2. Tab. 5 indicates that increasing the feature dimension from 32 to 64 will improve the performance of fine-tuned DINOv2 with an acceptable higher memory and longer training time. Increasing the feature dimension further to 128 is + +![](images/2304bae93e24b5e5effdf1b9159938961160240c5f51e2ae8c10cfb8e716e3a9.jpg) +Fig. 7: Qualitative results on out-of-domain datasets. Our 3D-aware features help DINoV2 achieve less noisy segmentation and capture detailed structure. + +not feasible in our hardware due to the large memory consumption. We chose a feature dimension of 64 as a good compromise between model performance, memory consumption, as well as training time. + +Feature assembly strategy. We study different strategies to assemble the fine-tuned features with the original DINOv2 features in Tab. 7. We explore simple channel-wise adding and concatenation. Alternatively, we first concatenate the fine-tuned features with the original DINOv2 features then use a liner layer to fuse them to the same feature space of DINOv2. We observe simple concatenation works well in incorporating learned 3D-aware features while preserving original generalization ability. + +Fine-tuning epochs. We finetune DINOv2 using the features rendered by the pre-trained feature Gaussians. Tab. 8 suggests that a single epoch is sufficient to transfer the 3D awareness to DINOv2 and more epochs may harm the model's generalization ability. + +Fine-tuning vs. adapter. Besides directly fine-tuning DINOv2, we explore an alternative strategy where we keep DINOv2 frozen and introduce an adapter on top of that. The adapter is a single Swin Transformer block [37]. We observe the + +Table 5: Ablation study on feature dimension of 3D Gaussian. Increasing feature dimensions improves performance at the cost of larger memory consumption and longer training time. + +
Feature dimensionAverage memory (MB)Average Training time (h)mAcc (↑)mIoU (↑)aAcc (↑)
323701.378.7767.1583.44
644951.680.5267.583.37
1287502.5---
+ +Table 6: Ablation study on fine-tuning vs. adapter. An adapter is a tiny network plugged into the frozen DINOv2 features. + +
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Fine-tuning91.0482.3596.14
Adapter90.9782.0295.96
+ +Table 7: Ablation study on feature assembly. We study different strategies to assemble fine-tuned features with the original DINOV2. + +
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Adding77.9766.082.85
Linear fusion78.2266.3982.89
Concatenation80.5267.583.37
+ +Table 8: Ablation study on fine-tuning epochs. We find fine-tuning with a single epoch with 8.5 hours is sufficient to achieve good performance. + +
EpochsFine-tun. time (h)mAcc (↑)mIoU (↑)aAcc (↑)
18.580.5267.583.37
21778.7267.2583.54
325.579.567.1883.24
+ +adapter can achieve comparable performance with fine-tuning (Tab. 6), however, with longer training time. We stick with the fine-tuning strategy for simplicity without introducing any additional network component. + +Limitations and discussion. Our work makes an initial step to transfer multiview consistent and 3D-aware features encoded by a 3D Gaussian representation to 2D foundation model via fine-tuning. We demonstrate the 3D-aware features are helpful for downstream tasks. However, we still need the original features to keep the generalization ability. We attribute this to the limited diversity of our 3D training data (only a single indoor dataset) and hypothesize that this can be remedied by fine-tuning on larger-scale data. + +# 5 Conclusion + +In this work, we present a method to inject 3D awareness into 2D foundation models. We first lift 2D foundation features into a 3D Gaussian representation and then use the rendered multi-view consistent and 3D-aware features to in turn fine-tune the 2D foundation model. Our experiments show that incorporating the fine-tuned features readily leads to improved performance on both semantic and geometric tasks through simple linear probing. Although we only conduct the 3D-aware fine-tuning on a single dataset $\mathrm{ScanNet}++$ , we demonstrate the learned 3D awareness is transferable across a variety of datasets in different domains. We hope our work inspires future research to consider equipping 2D foundation models with 3D-aware understanding. + +Acknowledgements Francis Engelmann is partially supported by an ETH AI Center postdoctoral research fellowship and an ETH Zurich Career Seed Award. + +# References + +1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep ViT Features as Dense Visual Descriptors. In: European Conference on Computer Vision (ECCV) Workshops (2022) 2 +2. Bachmann, R., Mizrahi, D., Atanov, A., Zamir, A.: MultiMAE: Multi-modal Multitask Masked Autoencoders. In: European Conference on Computer Vision (ECCV) (2022) 4 +3. Bao, H., Dong, L., Piao, S., Wei, F.: BEiT: BERT Pre-training of Image Transformers. In: International Conference on Learning Representations (ICLR) (2022) 3 +4. Bengio, Y., Courville, A., Vincent, P.: Representation Learning: A Review and New Perspectives. Transactions on Pattern Analysis and Machine Intelligence (PAMI) (2013) 3 +5. Bhat, S.F., Alhashim, I., Wonka, P.: Adabins: Depth Estimation Using Adaptive Bins. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2021) 8 +6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised Learning of Visual Features by Contrasting Cluster Assignments. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3 +7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging Properties in Self-Supervised Vision Transformers. In: International Conference on Computer Vision (ICCV) (2021) 2, 3 +8. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative Pretraining From Pixels. In: International Conference on Machine Learning (ICML) (2020) 3 +9. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: ScanNet: Richly-Annotated 3D Reconstructions of Indoor Scenes. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 9 +0. Darcet, T., Oquab, M., Mairal, J., Bojanowski, P.: Vision Transformers Need Registers. In: International Conference on Learning Representations (ICLR) (2024) 3, 12 +1. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. NAACL (2018) 3 +2. Doersch, C., Gupta, A., Efros, A.A.: Unsupervised Visual Representation Learning by Context Prediction. In: International Conference on Computer Vision (ICCV) (2015) 3 +3. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An Image Is Worth 16x16 Words: Transformers for Image Recognition at Scale. In: International Conference on Learning Representations (ICLR) (2020) 2, 4 +4. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative Unsupervised Feature Learning With Convolutional Neural Networks. In: International Conference on Neural Information Processing Systems (NeurIPS) (2014) 3 +5. El Banani, M., Raj, A., Maninis, K.K., Kar, A., Li, Y., Rubinstein, M., Sun, D., Guibas, L., Johnson, J., Jampani, V.: Probing the 3D Awareness of Visual Foundation Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2 +6. Engelmann, F., Manhardt, F., Niemeyer, M., Tateno, K., Tombari, F.: OpenNeRF: Open Set 3D Neural Scene Segmentation with Pixel-Wise Features and Rendered + +Novel Views. In: International Conference on Learning Representations (ICLR) (2024) 3 +17. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal Visual Object Classes Challenge: A Retrospective. International Journal of Computer Vision (2015) 8, 10, 11, 12 +18. Geiger, A., Lenz, P., Stiller, C., Urtasun, R.: Vision Meets Robotics: The Kitti Dataset. The International Journal of Robotics Research (2013) 8, 10, 11, 12 +19. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling Open-Vocabulary Image Segmentation With Image-Level Labels. In: European Conference on Computer Vision (ECCV) (2022) 3 +20. Gidaris, S., Singh, P., Komodakis, N.: Unsupervised Representation Learning by Predicting Image Rotations. In: International Conference on Learning Representations (ICLR) (2018) 3 +21. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap Your Own Latent-a New Approach to Self-Supervised Learning. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3 +22. Ha, H., Song, S.: Semantic Abstraction: Open-world 3D Scene Understanding From 2D Vision-Language Models. In: Conference on Robot Learning (CoRL) (2022) 4 +23. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality Reduction by Learning an Invariant Mapping. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2006) 3 +24. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked Autoencoders Are Scalable Vision Learners. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 4, 12 +25. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum Contrast for Unsupervised Visual Representation Learning. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2020) 3 +26. Hou, J., Dai, X., He, Z., Dai, A., Nießner, M.: Mask3D: Pre-training 2D Vision Transformers by Learning Masked 3D Priors. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4 +27. Hou, J., Xie, S., Graham, B., Dai, A., Nießner, M.: Pri3D: Can 3D Priors Help 2D Representation Learning? In: International Conference on Computer Vision (ICCV) (2021) 4 +28. Huang, R., Peng, S., Takmaz, A., Tombari, F., Pollefeys, M., Song, S., Huang, G., Engelmann, F.: Segment3D: Learning Fine-Grained Class-Agnostic 3D Segmentation without Manual Labels. European Conference on Computer Vision (ECCV) (2024) 4 +29. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., et al.: ConceptFusion: Open-set Multimodal 3D Mapping. Robotics: Science and Systems (RSS) (2023) 4 +30. Ke, B., Obukhov, A., Huang, S., Metzger, N., Daudt, R.C., Schindler, K.: Repurposing Diffusion-Based Image Generators for Monocular Depth Estimation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2 +31. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3D Gaussian Splatting for Real-Time Radiance Field Rendering. ACM Transactions on Graphics (2023) 2, 4, 5, 6 +32. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: LERF: Language Embedded Radiance Fields. In: International Conference on Computer Vision (ICCV) (2023) 3 + +33. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment Anything. In: International Conference on Computer Vision (ICCV) (2023) 2 +34. Kobayashi, S., Matsumoto, E., Sitzmann, V.: Decomposing Nerf for Editing via Feature Field Distillation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 3 +35. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven Semantic Segmentation. In: International Conference on Learning Representations (ICLR) (2022) 3 +36. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask DINO: Towards a Unified Transformer-Based Framework for Object Detection and Segmentation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2 +37. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin Transformer: Hierarchical Vision Transformer Using Shifted Windows. In: International Conference on Computer Vision (ICCV) (2021) 13 +38. Loshchilov, I., Hutter, F.: Decoupled Weight Decay Regularization. In: International Conference on Learning Representations (ICLR) (2019) 8 +39. Mazur, K., Sucar, E., Davison, A.J.: Feature-realistic Neural Fusion for Real-time, Open Set Scene Understanding. In: International Conference on Robotics and Automation (ICRA) (2023) 4 +40. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. In: European Conference on Computer Vision (ECCV) (2020) 3 +41. Noroozi, M., Favaro, P.: Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles. In: European Conference on Computer Vision (ECCV) (2016) 3 +42. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: DINOV2: Learning Robust Visual Features Without Supervision. Transactions on Machine Learning Research (2023) 1, 2, 3, 5, 6, 7, 8, 9, 12 +43. Pathak, D., Girshick, R., Dollar, P., Darrell, T., Hariharan, B.: Learning Features by Watching Objects Move. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 3 +44. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T.: OpenScene: 3D Scene Understanding with Open Vocabularies. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4 +45. Qin, M., Li, W., Zhou, J., Wang, H., Pfister, H.: LangSplat: 3D Language Gaussian Splatting. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4 +46. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning Transferable Visual Models From Natural Language Supervision. In: International Conference on Machine Learning (ICML) (2021) 3, 12 +47. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-Resolution Image Synthesis With Latent Diffusion Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2 +48. Saxena, S., Herrmann, C., Hur, J., Kar, A., Norouzi, M., Sun, D., Fleet, D.J.: The Surprising Effectiveness of Diffusion Models for Optical Flow and Monocular Depth Estimation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2024) 2 + +49. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled Feature Fields Enable Few-Shot Language-Guided Manipulation. In: Conference on Robot Learning (CoRL) (2023) 4 +50. Shi, J.C., Wang, M., Duan, H.B., Guan, S.H.: Language Embedded 3D Gaussians for Open-Vocabulary Scene Understanding. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4 +51. Silberman, N., Hoiem, D., Kohli, P., Fergus, R.: Indoor Segmentation and Support Inference From RGBD Images. In: European Conference on Computer Vision (ECCV) (2012) 8, 9 +52. Takmaz, A., Fedele, E., Sumner, R.W., Pollefeys, M., Tombari, F., Engelmann, F.: OpenMask3D: Open-Vocabulary 3D Instance Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 4 +53. Tan, H., Wu, S., Pi, J.: Semantic Diffusion Network for Semantic Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 2 +54. Touvron, H., Cord, M., Jégou, H.: Deit III: Revenge of the ViT. In: European Conference on Computer Vision (ECCV) (2022) 3, 12 +55. Tschernezki, V., Laina, I., Larlus, D., Vedaldi, A.: Neural Feature Fusion Fields: 3D Distillation of Self-Supervised 2D Image Representations. In: International Conference on 3D Vision (3DV) (2022) 3 +56. Wang, X., Gupta, A.: Unsupervised Learning of Visual Representations Using Videos. In: International Conference on Computer Vision (ICCV) (2015) 3 +57. Weder, S., Blum, H., Engelmann, F., Pollefeys, M.: LabelMaker: Automatic Semantic Label Generation from RGB-D Trajectories. In: International Conference on 3D Vision (3DV) (2024) 4 +58. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: CroCo: Self-Supervised Pre-training for 3D Vision Tasks by Cross-View Completion. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 4 +59. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth Anything: Unleashing the Power of Large-Scale Unlabeled Data. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2 +60. Yeshwanth, C., Liu, Y.C., Nießner, M., Dai, A.: ScanNet++: A High-Fidelity Dataset of 3D Indoor Scenes. In: International Conference on Computer Vision (ICCV) (2023) 8, 9 +61. Zhang, J., Herrmann, C., Hur, J., Polania Cabrera, L., Jampani, V., Sun, D., Yang, M.H.: A Tale of Two Features: Stable Diffusion Complements DINO for Zero-Shot Semantic Correspondence. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 2 +62. Zhou, B., Zhao, H., Puig, X., Fidler, S., Barriuso, A., Torralba, A.: Scene Parsing Through ade20K Dataset. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 10, 11, 12 +63. Zhou, S., Chang, H., Jiang, S., Fan, Z., Zhu, Z., Xu, D., Chari, P., You, S., Wang, Z., Kadambi, A.: Feature 3DGS: Supercharging 3D Gaussian Splatting to Enable Distilled Feature Fields. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4 \ No newline at end of file diff --git a/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/images.zip b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..09e8621ed5ce0743157108ed70feb86c9bad1e63 --- /dev/null +++ b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8c760eac3ab7c2a3e35df9a6858fe298a44fa533643f037835e8511e226ad731 +size 714030 diff --git a/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/layout.json b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..9c760eed410b43947ec0b1e5202bd64e203d7599 --- /dev/null +++ b/2024/Improving 2D Feature Representations by 3D-Aware Fine-Tuning/layout.json @@ -0,0 +1,8961 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 159, + 112, + 455, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 112, + 455, + 148 + ], + "spans": [ + { + "bbox": [ + 159, + 112, + 455, + 148 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "spans": [ + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "text", + "content": "Yuanwen Yue" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "text", + "content": ", Anurag Das" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "text", + "content": ", Francis Engelmann" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "inline_equation", + "content": "^{1,3}" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "text", + "content": ", Siyu Tang" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "text", + "content": ", and Jan Eric Lenssen" + }, + { + "bbox": [ + 190, + 167, + 423, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 241, + 201, + 299, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 201, + 299, + 213 + ], + "spans": [ + { + "bbox": [ + 241, + 201, + 299, + 213 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 241, + 201, + 299, + 213 + ], + "type": "text", + "content": " ETH Zurich" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 335, + 201, + 374, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 335, + 201, + 374, + 213 + ], + "spans": [ + { + "bbox": [ + 335, + 201, + 374, + 213 + ], + "type": "text", + "content": "3 Google" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 164, + 213, + 449, + 225 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 213, + 449, + 225 + ], + "spans": [ + { + "bbox": [ + 164, + 213, + 449, + 225 + ], + "type": "text", + "content": "2 Max Planck Institute for Informatics, Saarland Informatics Campus" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 133, + 230, + 478, + 361 + ], + "blocks": [ + { + "bbox": [ + 133, + 230, + 478, + 361 + ], + "lines": [ + { + "bbox": [ + 133, + 230, + 478, + 361 + ], + "spans": [ + { + "bbox": [ + 133, + 230, + 478, + 361 + ], + "type": "image", + "image_path": "04aa4d9f1fade7e93f04254bdcdfa8d1c4e2384d2fac7c1da9ba814264b84a64.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 373, + 483, + 451 + ], + "lines": [ + { + "bbox": [ + 130, + 373, + 483, + 451 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 483, + 451 + ], + "type": "text", + "content": "Fig. 1: We propose 3D-aware fine-tuning to improve 2D foundation features. Our method starts with lifting 2D image features (e.g. DINOv2 [42]) (b) to a 3D representation. Then we finetune the 2D foundation model using the 3D-aware features (c). We demonstrate that incorporating the fine-tuned features (d) results in improved performance on downstream tasks such as semantic segmentation and depth estimation on a variety of datasets with simple linear probing (right). Feature maps are visualized using principal component analysis (PCA)." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 468, + 455, + 634 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 468, + 455, + 634 + ], + "spans": [ + { + "bbox": [ + 159, + 468, + 455, + 634 + ], + "type": "text", + "content": "Abstract. Current visual foundation models are trained purely on unstructured 2D data, limiting their understanding of 3D structure of objects and scenes. In this work, we show that fine-tuning on 3D-aware data improves the quality of emerging semantic features. We design a method to lift semantic 2D features into an efficient 3D Gaussian representation, which allows us to re-render them for arbitrary views. Using the rendered 3D-aware features, we design a fine-tuning strategy to transfer such 3D awareness into a 2D foundation model. We demonstrate that models fine-tuned in that way produce features that readily improve downstream task performance in semantic segmentation and depth estimation through simple linear probing. Notably, though fine-tuned on a single indoor dataset, the improvement is transferable to a variety of indoor datasets and out-of-domain datasets. We hope our study encourages the community to consider injecting 3D awareness when training 2D foundation models. Project page: https://ywyue.github.io/FiT3D." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "spans": [ + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "text", + "content": "Keywords: Representation learning " + }, + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "text", + "content": " Foundation models " + }, + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "text", + "content": " Gaussian splatting " + }, + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 643, + 454, + 666 + ], + "type": "text", + "content": " Scene understanding" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 229, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 229, + 127 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 229, + 127 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 147, + 481, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 147, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 130, + 147, + 481, + 255 + ], + "type": "text", + "content": "Ever since the emergence of deep neural networks, vision systems are largely trained on 2D datasets. With the scalability of recent architectures, like vision transformers (ViT) [13], several large vision models [7, 24, 33, 42, 47] have been trained from a rich set of 2D images by either supervised or self-supervised learning. Visual foundation models have shown impressive utility as general feature extractors that can be applied to improve results on downstream tasks, such as segmentation [36, 53], depth estimation [30, 48, 59], or correspondence estimation [1, 61]. They are trained on a large amount of readily available 2D images and, thus, learn statistics about object and scene structure in 2D-pixel space." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 256, + 481, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 256, + 481, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 256, + 481, + 399 + ], + "type": "text", + "content": "Images, as a simple projection of our 3D world, are easy to obtain and provide an efficient way to depict the visual world while at the same time discarding explicit 3D geometry information. It is expected that vision systems purely trained on 2D images cannot fully understand the underlying 3D structure of our world [15]. There are several promising properties of our 3D world, for example, multi-view consistency, and multi-view fusion for solving single-view ambiguities. A crucial limitation of the training setups of these models is that they don't fully reason about the 3D structure of seen objects. Training images are presented to the network in an unstructured way, without any multi-view or video correspondences that would allow matching observations of the same object from multiple views. As a consequence, these models have limited 3D understanding of objects observed from, e.g., different views are not producing view-consistent features." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 401, + 481, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 401, + 481, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 401, + 481, + 472 + ], + "type": "text", + "content": "In contrast, when we humans observe images, we effortlessly achieve a holistic understanding by not only perceiving the 2D visual content but also exploiting the inferred underlying 3D structure, which we have learned through lifelong observation of stereo and temporal information. In this work, we investigate if large scale 2D vision models can also profit from equipping them with such 3D-aware understanding abilities induced by showing the right type of data." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 474, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 481, + 666 + ], + "type": "text", + "content": "To this end, we design a novel two-stage approach to improve the 3D-aware understanding ability of 2D foundation models. In the first stage, we aim to obtain 3D-aware features as training data. Motivated by recent advancements in neural scene representation, we design an approach to lift multi-view 2D foundation features into an efficient 3D Gaussian representation [31]. The lifting process exploits multi-view consistency and allows 2D features from different views to complement each other. Moreover, the fused features (Fig. 1 (c)) exhibit high resolution with fine details thanks to the learned 3D structure, emerging from multi-view RGB guidance. Once trained, the 3D Gaussians can render features for arbitrary views. In the following, we refer to features obtained in this way as 3D-aware. In the second stage, we utilize the rendered 3D-aware features to finetune the 2D foundation models (Fig. 2). To this end, we design an efficient fine-tuning strategy to transfer such 3D awareness into 2D foundation models. After fine-tuning, we evaluate the feature quality on downstream tasks that might profit from a better 3D understanding, namely semantic segmentation and depth estimation. Extensive experiments demonstrate that incorporating the" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 129, + 192, + 179 + ], + "blocks": [ + { + "bbox": [ + 133, + 129, + 192, + 179 + ], + "lines": [ + { + "bbox": [ + 133, + 129, + 192, + 179 + ], + "spans": [ + { + "bbox": [ + 133, + 129, + 192, + 179 + ], + "type": "image", + "image_path": "b3754b65b13c984389f68646b9887a99df5d427e84389964537e86f319004f3b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 192, + 105, + 249, + 205 + ], + "blocks": [ + { + "bbox": [ + 192, + 105, + 249, + 205 + ], + "lines": [ + { + "bbox": [ + 192, + 105, + 249, + 205 + ], + "spans": [ + { + "bbox": [ + 192, + 105, + 249, + 205 + ], + "type": "image", + "image_path": "227c57ea9e5af033e5cfa4066f237c1cb4332f55d82e3f2936cd3018b916e127.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 209, + 480, + 243 + ], + "lines": [ + { + "bbox": [ + 130, + 209, + 480, + 243 + ], + "spans": [ + { + "bbox": [ + 130, + 209, + 480, + 243 + ], + "type": "text", + "content": "Fig. 2: Our 3D-aware fine-tuning is universal and applicable to a variety of 2D vision models, e.g. DINOv2 [42], DINOv2-reg [10], CLIP [46], MAE [24], and DeiT-III [54] (c.f. Sec. 4.5)." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 250, + 105, + 307, + 205 + ], + "blocks": [ + { + "bbox": [ + 250, + 105, + 307, + 205 + ], + "lines": [ + { + "bbox": [ + 250, + 105, + 307, + 205 + ], + "spans": [ + { + "bbox": [ + 250, + 105, + 307, + 205 + ], + "type": "image", + "image_path": "b33a561685e6564c8dc854bec3ce01b6188e816a513a93a22a4d8e5abdbdc2d5.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 308, + 105, + 365, + 205 + ], + "blocks": [ + { + "bbox": [ + 308, + 105, + 365, + 205 + ], + "lines": [ + { + "bbox": [ + 308, + 105, + 365, + 205 + ], + "spans": [ + { + "bbox": [ + 308, + 105, + 365, + 205 + ], + "type": "image", + "image_path": "2fe8207f02239bef4cf3f3a48cf57eac03d0190526ec365bf19e6f9f7c4a5ea6.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 366, + 105, + 422, + 205 + ], + "blocks": [ + { + "bbox": [ + 366, + 105, + 422, + 205 + ], + "lines": [ + { + "bbox": [ + 366, + 105, + 422, + 205 + ], + "spans": [ + { + "bbox": [ + 366, + 105, + 422, + 205 + ], + "type": "image", + "image_path": "8c2feaf1b2576248a81f66a0eb400cb78cc84d62072ce6a642c0648f649a45b6.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 423, + 105, + 480, + 205 + ], + "blocks": [ + { + "bbox": [ + 423, + 105, + 480, + 205 + ], + "lines": [ + { + "bbox": [ + 423, + 105, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 423, + 105, + 480, + 205 + ], + "type": "image", + "image_path": "1d4b9573cbb17e18b3789b5514ff8d4b3cdb444f8e6ce9a149a9dc1387023b5d.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 263, + 479, + 287 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 263, + 479, + 287 + ], + "spans": [ + { + "bbox": [ + 130, + 263, + 479, + 287 + ], + "type": "text", + "content": "3D-aware features improves downstream tasks with simple linear probing and exhibits generalization ability on out-of-domain datasets." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 303, + 237, + 316 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 303, + 237, + 316 + ], + "spans": [ + { + "bbox": [ + 131, + 303, + 237, + 316 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 326, + 480, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 326, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 326, + 480, + 373 + ], + "type": "text", + "content": "We give an overview about recent self-supervised 2D representation learning techniques in Sec. 2.1, and how emerging features have been distilled into 3D representations in Sec. 2.2. Then, we discuss previous work that utilizes 3D information to improve 2D representation methods in Sec. 2.3." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 389, + 303, + 401 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 389, + 303, + 401 + ], + "spans": [ + { + "bbox": [ + 131, + 389, + 303, + 401 + ], + "type": "text", + "content": "2.1 2D Representation Learning" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 406, + 482, + 549 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 482, + 549 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 482, + 549 + ], + "type": "text", + "content": "Representation learning [4] has achieved remarkable progress in the image domain. It aims to learn generalizable visual features from a rich set of data. Self-supervised representation learning has gained particular interest since it does not require labeled data. Early works employ pretext tasks for pre-training, which aim to exploit inherent data attributes to automatically generate surrogate labels [12,14,20,41,43,56]. Later, contrastive learning [23] has been popularly used for representation learning by leveraging discriminative signals between images or groups of images [6,7,21,25,42]. More recently, motivated by BERT [11], a new paradigm of masked image modeling [3,8,24] has been proposed for scalable visual learning. Nevertheless, all those methods are only trained on 2D image data, without accessing the underlying 3D structure. Our work aims to supplement the features purely learned from 2D observations with 3D awareness." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 564, + 315, + 575 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 564, + 315, + 575 + ], + "spans": [ + { + "bbox": [ + 131, + 564, + 315, + 575 + ], + "type": "text", + "content": "2.2 Distilled Feature Fusion Fields" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Neural radiance fields (NeRF) [40] emerge as a promising scene representation for high-quality 3D reconstruction and novel view synthesis. Recently, some works [16,32,34,55] explore distilling pre-trained image features (e.g. DINO [7], CLIP [46], LSeg [35], or OpenSeg [19]) into NeRF via neural rendering. Without requiring any labels, such distilled feature fusion fields enable several zero-shot 3D scene understanding tasks, e.g. segmentation, scene editing, and open-vocabulary queries. We share similar inspiration from these works by distilling" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 247 + ], + "type": "text", + "content": "2D features into a 3D representation. However, instead of focusing on perception tasks with feature fields, we are interested in leveraging the rendered 3D-aware features to in turn improve the 2D feature extractor. We demonstrate that the transferred 3D awareness can readily improve the 2D features on both semantic and geometric tasks. Moreover, we extend the recent Gaussian-based representation [31] by designing a method to distill 2D features into 3D Gaussians while keeping high efficiency and memory under bound. There are several concurrent works introducing 3D Gaussians with semantic features [45, 50, 63]. However, none of these works distill features back into 2D models. Our work shows, for the first time, that semantic features fused into 3D representations can effectively improve 2D foundation models via fine-tuning." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 265, + 289, + 277 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 265, + 289, + 277 + ], + "spans": [ + { + "bbox": [ + 132, + 265, + 289, + 277 + ], + "type": "text", + "content": "2.3 Injecting 3D Priors to 2D" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 285, + 481, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 481, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 481, + 453 + ], + "type": "text", + "content": "Existing works mainly focus on fusing multi-view 2D features into the 3D representation [22, 28, 29, 39, 44, 49, 52, 57]. Little attention has been paid to the other direction of incorporating 3D awareness into 2D representation learning. Pri3D [27] uses geometric constraints (multi-view consistency and 2D-3D correspondence) from RGB-D reconstructions to learn 3D priors for image-based representations with contrastive learning. Recently, inspired by the masked autoencoder (MAE) [24], several works adopt the masked image modeling strategy to learn 3D priors [2, 26, 58]. However, all these methods require pre-training the 2D feature extractor, typically a Vision Transformer (ViT) backbone [13], using their hand-crafted pretext tasks. The pre-trained models are then employed to downstream tasks via fine-tuning. By contrast, we aim to transfer the 3D awareness embedded in multi-view fused features to the 2D feature extractor through fine-tuning with little computational resources. Our 3D-aware features readily improve downstream task performance with simple linear probing." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 471, + 201, + 483 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 471, + 201, + 483 + ], + "spans": [ + { + "bbox": [ + 132, + 471, + 201, + 483 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 496, + 481, + 590 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 496, + 481, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 496, + 481, + 590 + ], + "type": "text", + "content": "In this section, we introduce our method for fine-tuning 2D foundation models with 3D-aware features. We present a two-stage pipeline (c.f. Fig 3). In the first stage, we lift multi-view inconsistent 2D features into a multi-view consistent and 3D-aware representation. The representation and setup are described in Sec. 3.1. In the second stage, we use the obtained 3D-aware feature representations as training dataset to fine-tune the 2D feature extractor, which is detailed in Sec. 3.2. Last, we describe the linear probing methodology for feature evaluation in Sec. 3.3." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 609, + 272, + 621 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 272, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 272, + 621 + ], + "type": "text", + "content": "3.1 Lifting Features to 3D" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "content": "Lifting semantic 2D features into 3D has been a trend recently and several different options exist (c.f. Sec. 2). For our purposes of using larger amounts of scenes as training data for 2D models, the most important aspect is efficiency." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 114, + 336, + 217 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 336, + 217 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 336, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 336, + 217 + ], + "type": "image", + "image_path": "ebf36e2a62f9a4d9a86cf2d3e374844078fff5dc0d003f7b3ddffceee9fb3ca0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "lines": [ + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "spans": [ + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "type": "text", + "content": "Fig. 3: Overall pipeline. We present a two-stage pipeline. In the first state, we lift 2D foundation features (e.g. DINOv2 [42]) into 3D-aware features by training 3D Gaussian representation " + }, + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "type": "inline_equation", + "content": "\\mathcal{G}_i" + }, + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "type": "text", + "content": ". In the second stage, we use the rendered features to finetune the 2D foundation model " + }, + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "type": "inline_equation", + "content": "\\varepsilon^{2D}" + }, + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "type": "text", + "content": ". With " + }, + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "type": "inline_equation", + "content": "\\rightarrow" + }, + { + "bbox": [ + 131, + 224, + 482, + 269 + ], + "type": "text", + "content": " we denote gradient flow." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 342, + 114, + 482, + 217 + ], + "blocks": [ + { + "bbox": [ + 342, + 114, + 482, + 217 + ], + "lines": [ + { + "bbox": [ + 342, + 114, + 482, + 217 + ], + "spans": [ + { + "bbox": [ + 342, + 114, + 482, + 217 + ], + "type": "image", + "image_path": "8a1fd794d49723b424caeb61a845d58e125b6ef5c07a914f7e5757861a50f53e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 293, + 479, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 479, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 479, + 363 + ], + "type": "text", + "content": "The representation needs to (1) be able to efficiently fit a large number of scenes into 3D representations and (2) have a fast rendering mechanism for efficient integration into a fine-tuning loop of a 2D foundation model. Thus, we utilize the recent advances in 3D Gaussian splatting [31], which enable fast optimization and real-time rendering. Fig. 4 illustrates how we extend Gaussian splatting to lift 2D foundation features and we detail the method below." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 366, + 479, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 366, + 479, + 390 + ], + "spans": [ + { + "bbox": [ + 131, + 366, + 479, + 390 + ], + "type": "text", + "content": "3D feature Gaussians. Adapting the formulation of 3D Gaussian splatting [31], we define a set of 3D Gaussians as" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 231, + 399, + 481, + 414 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 399, + 481, + 414 + ], + "spans": [ + { + "bbox": [ + 231, + 399, + 481, + 414 + ], + "type": "interline_equation", + "content": "\\mathcal {G} = \\left\\{\\left(\\boldsymbol {\\mu}, \\mathbf {s}, \\mathbf {R}, \\alpha , \\mathbf {S H}, \\mathbf {f}\\right) _ {j}\\right) \\} _ {1 \\leq j \\leq M}, \\tag {1}", + "image_path": "7058faa578a1170bfeb0bef5cbcc1095468af8e7438f8d47936cc39509744ff9.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "spans": [ + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\pmb{\\mu} \\in \\mathbb{R}^3" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": " is the 3D mean of the Gaussian, " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\mathbf{S} = \\mathrm{diag}(\\mathbf{s}) \\in \\mathbb{R}^{3 \\times 3}" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": " is the Gaussian scale, " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\mathbf{R} \\in \\mathbb{R}^{3 \\times 3}" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": " its orientation, " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\alpha \\in \\mathbb{R}" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": " is a per-Gaussian opacity, and " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\mathbf{SH}" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": " a vector of spherical harmonic coefficients, encoding view-dependent color. The Gaussian covariance matrix is obtained by combining scale and orientation as " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\pmb{\\Sigma} = \\mathbf{RSS}^\\top \\mathbf{R}^\\top" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": ". In addition to the original parameters, we introduce a per-Gaussian feature vector " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\mathbf{f} \\in \\mathbb{R}^D" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": " to store distilled 2D features in 3D space. Those feature vectors are rasterized into a 2D feature image with our designed feature rasterizer. Inspired by the differentiable color rasterizer of Gaussian splatting, we rasterize the features using point-based " + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 131, + 420, + 482, + 529 + ], + "type": "text", + "content": "-blending as follows:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 246, + 537, + 481, + 571 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 246, + 537, + 481, + 571 + ], + "spans": [ + { + "bbox": [ + 246, + 537, + 481, + 571 + ], + "type": "interline_equation", + "content": "\\mathbf {F} ^ {\\text {l o w}} = \\sum_ {i \\in \\mathcal {N}} \\mathbf {f} _ {i} \\alpha_ {i} \\prod_ {j = 1} ^ {i - 1} (1 - \\alpha_ {i}) \\tag {2}", + "image_path": "0445dfe68e66cd0dd62f9a60004ce3e363a100211cdd5477a9e76c966b0cc2f7.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "inline_equation", + "content": "\\mathcal{N}" + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "text", + "content": " is a set of ordered Gaussians overlapping the pixel, " + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_i" + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "text", + "content": " is the feature of each Gaussian and " + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "inline_equation", + "content": "\\alpha_{i}" + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "text", + "content": " is given by evaluating a 2D Gaussian with covariance " + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "inline_equation", + "content": "\\pmb{\\Sigma}" + }, + { + "bbox": [ + 130, + 578, + 479, + 614 + ], + "type": "text", + "content": " multiplied with a learned per-point opacity." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 617, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 617, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 617, + 479, + 665 + ], + "type": "text", + "content": "Up-projecting features. A strong limitation of 3D Gaussians as representation is their memory consumption. Since there can be millions of Gaussians per scene, it is impossible to store, e.g., the 384-dimensional DINO features directly on each of the 3D Gaussians. Therefore, to stay memory efficient and keep the fast" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 125, + 478, + 245 + ], + "blocks": [ + { + "bbox": [ + 136, + 125, + 478, + 245 + ], + "lines": [ + { + "bbox": [ + 136, + 125, + 478, + 245 + ], + "spans": [ + { + "bbox": [ + 136, + 125, + 478, + 245 + ], + "type": "image", + "image_path": "7364ad014cf79b5ff1febe8e7d90b162b8b1fefa56ebf54615ee9449ce9e032f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "lines": [ + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "text", + "content": "Fig. 4: Lifting 2D features into 3D Gaussian representation. We equip each Gaussian with a low-dimensional feature vector " + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "inline_equation", + "content": "\\mathbf{f}" + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "text", + "content": ". We render colors using the same color rasterizer as Gaussian splatting [31]. We design a feature rasterizer to render a low-dimensional feature image " + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "inline_equation", + "content": "\\mathbf{F}^{\\mathrm{low}}" + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "text", + "content": ", which is subsequently projected to a high-dimensional feature image " + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "inline_equation", + "content": "\\mathbf{F}^{\\mathrm{high}}" + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "text", + "content": " using a simple CNN. We use 2D foundation features " + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "inline_equation", + "content": "\\mathbf{F}" + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "text", + "content": " from model " + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "inline_equation", + "content": "\\varepsilon^{2\\mathrm{D}}" + }, + { + "bbox": [ + 130, + 258, + 482, + 326 + ], + "type": "text", + "content": " to supervise the feature learning." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "spans": [ + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "text", + "content": "rendering process, we opt for storing lower dimensional features " + }, + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "inline_equation", + "content": "\\mathbf{f} \\in \\mathbb{R}^{D}" + }, + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "inline_equation", + "content": "D \\ll 384" + }, + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "text", + "content": " and train a scene-specific pixel-space CNN decoder " + }, + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "inline_equation", + "content": "d: \\mathbf{F}^{\\mathrm{low}} \\mapsto \\mathbf{F}^{\\mathrm{high}}" + }, + { + "bbox": [ + 130, + 356, + 482, + 404 + ], + "type": "text", + "content": " to up-project feature images into high-dimensional feature space after rendering. We analyze the trade-off introduced by this approach in Sec. 4.6." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "spans": [ + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": "Optimization. For a given scene, the full 3D Gaussian representation, including our distilled features, is obtained using optimization. Let " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{I}_i\\}_{1\\leq i\\leq N}" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": " be a set of multi-view images of a scene with corresponding camera parameters, " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{F}_i\\}_{1\\leq i\\leq N}" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": " a corresponding set of feature maps from a 2D feature extractor (e.g. DINOv2 [42]), and " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "r^{\\mathrm{rgb}}" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "r^{\\mathrm{feat}}" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": " rasterization functions that render a set of Gaussians into an RGB or feature image, respectively, using the camera pose " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "\\mathbf{P}_i" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": " of image " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": ". Then, we optimize the Gaussian parameters, to optimally represent images " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_i" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": " and feature images " + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_i" + }, + { + "bbox": [ + 130, + 410, + 482, + 507 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 521, + 481, + 555 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 521, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 159, + 521, + 481, + 555 + ], + "type": "interline_equation", + "content": "\\hat {\\mathcal {G}} = \\underset {\\{(\\boldsymbol {\\mu}, \\mathbf {s}, \\mathbf {R}, \\alpha , \\mathbf {S H}, \\mathbf {f}) _ {i} \\}} {\\arg \\min } \\sum_ {i = 1} ^ {N} \\mathcal {L} ^ {c} (r ^ {\\mathrm {r g b}} (\\mathcal {G}, \\mathbf {P} _ {i}), \\mathbf {I} _ {i}) + \\mathcal {L} ^ {f} (d (r ^ {\\mathrm {f e a t}} (\\mathcal {G}, \\mathbf {P} _ {i}), \\mathbf {F} _ {i}), \\quad (3)", + "image_path": "9565cf61aacfb96dbac2a59229ef20398dbd3d1058796833b036d87cda5735e6.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}^c" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " is a pixel-wise " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "l_{1}" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " loss combined with a D-SSIM term on RGB images, and " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}^f" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " is a pixel-wise " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "l_{1}" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " loss on feature images. Notably, we only optimize " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{f}" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " with gradients coming from " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}^f" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " (feature images) and the rest of the parameters only on " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}^c" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " (RGB loss). This has proven to be essential to obtain a consistent 3D feature representation, as a loss from feature space does not lead to correct Gaussian mean, covariance and opacity. We speculate that the reason for this is the missing 3D consistency of the 2D feature extractor. Only through forcing them into a 3D consistent representation, we make them consistent in return." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 132, + 130, + 481, + 257 + ], + "blocks": [ + { + "bbox": [ + 132, + 115, + 337, + 129 + ], + "lines": [ + { + "bbox": [ + 132, + 115, + 337, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 115, + 337, + 129 + ], + "type": "text", + "content": "Algorithm 1 3D-aware fine-tuning algorithm" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "lines": [ + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "spans": [ + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": "Input: Pre-trained Feature Gaussian representations " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{G}_1,\\dots,\\mathcal{G}_K\\}" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": ", pre-trained 2D feature extractor " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\varepsilon_{\\theta}^{2D}" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": ", a set of images " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{I}_i\\}_{i=1}^N" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " and associated camera poses " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{P}_i\\}_{i=1}^N" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": ". \nOutput: Fine-tuned 2D feature extractor " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\varepsilon_{\\hat{\\theta}}^{2D}" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": ". \n1: Load " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\mathcal{G} \\sim \\{\\mathcal{G}_1,\\dots,\\mathcal{G}_K\\}" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " \n2: while fine-tuning do \n3: Sample an image " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_i" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " and camera pose " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\mathbf{P}_i" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "i \\sim \\mathcal{U}\\{1,N\\}" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " \n4: Retrieve associated feature Gaussian " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\mathcal{G}" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " and CNN decoder " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " \n5: Render " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\mathbf{F}^{\\mathrm{high}} \\gets d(r^{\\mathrm{feat}}(\\mathcal{G},\\mathbf{P}_i))" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " \n6: Step " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " by minimizing " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\mathcal{L}(\\varepsilon_{\\theta}^{2D}(\\mathbf{I}_i),\\mathbf{F}^{\\mathrm{high}})" + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "text", + "content": " \n7: end while \nreturn " + }, + { + "bbox": [ + 132, + 130, + 481, + 257 + ], + "type": "inline_equation", + "content": "\\varepsilon_{\\hat{\\theta}}^{2D}" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 132, + 281, + 276, + 294 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 276, + 294 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 276, + 294 + ], + "type": "text", + "content": "3.2 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "content": "The procedure described in the last section is used to fit 3D feature Gaussian representations of " + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "content": " scenes. The algorithm of 3D-aware fine-tuning is outlined in Algorithm 1. The fine-tuning process requires training pairs of original 2D feature maps and 3D-aware feature maps. Since it is memory-intensive to save the feature maps, we generate the training pairs on the fly. Considering it is time-consuming to load each pre-trained Gaussian when rendering features, we pre-load all the Gaussians into CPU memory. In each step of the training loop, we randomly sample a view from all the training images, then retrieve its associated feature Gaussian and scene-specific CNN decoder and finally render features " + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "inline_equation", + "content": "\\mathbf{F}^{\\mathrm{high}}" + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "content": " as the ground truth features for fine-tuning. The fine-tuning loss is a " + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "inline_equation", + "content": "l_{1}" + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "content": " loss between " + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "inline_equation", + "content": "\\mathbf{F}^{\\mathrm{high}}" + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "content": " (resized) and the output features of the fine-tuned 2D feature extractor." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 437, + 482, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 509 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 509 + ], + "type": "text", + "content": "The above design makes the fine-tuning process efficient and keeps memory consumption under control. Notably, we only need to fine-tune the 2D feature extractor with a small number of epochs (e.g. 1 epoch for DINOv2 [42]) with a small learning rate without additionally introducing any network component. The fine-tuning process is fast and computation-friendly. An analysis of fine-tuning time is in Sec. 4.6." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 529, + 354, + 540 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 529, + 354, + 540 + ], + "spans": [ + { + "bbox": [ + 132, + 529, + 354, + 540 + ], + "type": "text", + "content": "3.3 Linear Probing for Downstream Tasks" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 551, + 481, + 599 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 551, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 130, + 551, + 481, + 599 + ], + "type": "text", + "content": "After fine-tuning on 3D-aware features, we evaluate the emerging features on a set of standard benchmark downstream tasks. To this end, we train a linear head on top of the features to solve tasks of semantic segmentation and depth estimation on several datasets." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 601, + 481, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 601, + 481, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 601, + 481, + 639 + ], + "type": "text", + "content": "Semantic segmentation. A linear layer is trained to predict class logits from patch tokens. The linear layer produces a low-resolution logit map, which is then upsampled to full resolution to obtain a segmentation map." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Depth estimation. We concatenate the [CLS] token of the ViT to each patch token. We divide the depth prediction range into 256 uniformly distributed" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 180, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 180, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 180, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "bins [5] and use a linear normalization. Then a simple linear layer is trained using a classification loss." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 143, + 480, + 190 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 143, + 480, + 190 + ], + "spans": [ + { + "bbox": [ + 130, + 143, + 480, + 190 + ], + "type": "text", + "content": "Feature assembly. We concatenate original 2D features with our fine-tuned features. We observe this is key to preserving the generalization ability of the original 2D feature extractor while incorporating the 3D awareness in our fine-tuned features. Different strategies for feature assembly are evaluated in Sec. 4.6." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 208, + 230, + 221 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 208, + 230, + 221 + ], + "spans": [ + { + "bbox": [ + 131, + 208, + 230, + 221 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 232, + 204, + 243 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 232, + 204, + 243 + ], + "spans": [ + { + "bbox": [ + 131, + 232, + 204, + 243 + ], + "type": "text", + "content": "4.1 Datasets" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 479, + 299 + ], + "type": "text", + "content": "Training. We train the feature Gaussians on ScanNet++ [60], which is a large-scale dataset of 3D indoor scenes containing sub-millimeter resolution laser scans, registered DSLR images, and commodity RGB-D streams from iPhone. We train on the official training split of 230 scenes, which contain 140451 views." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 301, + 482, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 301, + 482, + 459 + ], + "spans": [ + { + "bbox": [ + 130, + 301, + 482, + 459 + ], + "type": "text", + "content": "Evaluation. To examine the effectiveness of the fine-tuned features, we conduct extensive experiments on downstream 2D tasks including semantic segmentation and depth estimation. There is no direct competitor in our study and we instead focus on whether our 3D-aware fine-tuning can bring performance gains compared with the standard 2D feature extractor. We conduct most of the experiments with DINOv2 [42] while also demonstrating the generality of our approach with other vision models in Sec. 4.5. We first evaluate on ScanNet++ [60] validation set, which contains 50 scenes with 30638 images. Then we move on to other indoor datasets ScanNet [9] and NYUd [51]. which have a similar data distribution with ScanNet++ but were captured with different sensors. To investigate the generalization ability of the fine-tuned features, we also perform out-of-domain evaluation on generally distributed datasets including ADE20k [62], Pascal VOC [17] and the outdoor dataset KITTI [18]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 473, + 279, + 486 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 473, + 279, + 486 + ], + "spans": [ + { + "bbox": [ + 131, + 473, + 279, + 486 + ], + "type": "text", + "content": "4.2 Implementation Details" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 492, + 479, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 492, + 479, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 492, + 479, + 552 + ], + "type": "text", + "content": "Feature Gaussians. We wrote custom CUDA kernels for feature rasterization. Each Gaussian is initialized with a random feature vector of dimension of 64. We implement the up-projecting CNN with a single convolutional layer with a kernel size of " + }, + { + "bbox": [ + 130, + 492, + 479, + 552 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 492, + 479, + 552 + ], + "type": "text", + "content": ". We train the feature Gaussians of each scene for novel view synthesis and feature rendering jointly for 30000 iterations." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 555, + 479, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 479, + 603 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 479, + 603 + ], + "type": "text", + "content": "Fine-tuning. We finetune DINOv2 small with a feature dimension of 384 with a batch size of 2 with a learning rate of 1e-5 for 1 epoch. We use horizontal flip as data augmentation. We use the AdamW [38] optimizer with a weight decay factor 1e-4. The fine-tuning on a single Nvidia Tesla A100 takes 8.5 hours." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 479, + 665 + ], + "type": "text", + "content": "Linear probing. We follow the linear probing protocol with DINOv2 [42] to ensure a fair comparison. For semantic segmentation, we train the linear layer for 40K iterations with 8 GPUs. For depth estimation, we train the linear layer for 38400 iterations with 8 GPUs. In addition, we use the same data augmentation and learning rate schedule with DINOv2." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 294, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 294, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 294, + 128 + ], + "type": "text", + "content": "4.3 Within-domain Evaluation" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "text", + "content": "Quantitative comparison. We demonstrate the effectiveness of incorporating our 3D-aware features on downstream semantic segmentation (see Tab. 1) and depth estimation task (see Tab. 2) for indoor scenes. For semantic segmentation task, our 3D aware features consistently improve DINOv2 features, achieving a significant performance gain of " + }, + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "inline_equation", + "content": "2.6\\%" + }, + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "inline_equation", + "content": "2.0\\%" + }, + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "text", + "content": " mIoU, and " + }, + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "inline_equation", + "content": "1.2\\%" + }, + { + "bbox": [ + 130, + 140, + 482, + 261 + ], + "type": "text", + "content": " on ScanNet++ [60], NYUv2 [51] and ScanNet [9] datasets, respectively. Our 3D-aware DINOv2 features also improve performance on the depth estimation task. In particular, our enhanced features consistently reduce the RMSE across datasets by achieving 0.34 vs. 0.37 (DINOv2) for ScanNet++ [60], 0.42 vs. 0.44 (DINOv2) for NYUv2 [51] and 0.29 vs. 0.31 (DINOv2) for ScanNet [9] datasets." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 263, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 263, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 263, + 482, + 456 + ], + "type": "text", + "content": "Qualitative comparison. We qualitatively show the benefits of 3D-aware features in Fig. 5 and Fig. 6. We observe the improvements are mainly reflected in two aspects: (1) cleaner segmentation/depth estimation in homogeneous or textureless regions, e.g. on walls and boards, and (2) better prediction with fine-grained details, e.g. on legs of chairs or tables. For (1), during the lifting of 2D features to 3D, features from multiple views are aggregated into a holistic representation, thus information from one view implicitly complements other views. We hypothesize that such multi-view awareness is transferred to DINOv2 through fine-tuning. By contrast, standard DINOv2 struggles to infer accurate segmentation or depth from a single image when with ambiguity, thus leading to noisy prediction. For (2), in our feature lifting process, we train the geometry properties (e.g. position and opacity) of Gaussians with RGB color as supervision. The RGB guidance helps feature Gaussians learn detailed 3D structure and render high-resolution feature maps (c.f. Fig. 1 (c)). During the fine-tuning process, the model learns to estimate fine-grained features of objects (c.f. Fig. 1 (d) vs. (b)), which is helpful for capturing detailed structure in downstream tasks." + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 135, + 520, + 479, + 566 + ], + "blocks": [ + { + "bbox": [ + 131, + 476, + 482, + 510 + ], + "lines": [ + { + "bbox": [ + 131, + 476, + 482, + 510 + ], + "spans": [ + { + "bbox": [ + 131, + 476, + 482, + 510 + ], + "type": "text", + "content": "Table 1: Semantic segmentation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on semantic segmentation in comparison to standard DINOv2 across different indoor datasets." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 520, + 479, + 566 + ], + "lines": [ + { + "bbox": [ + 135, + 520, + 479, + 566 + ], + "spans": [ + { + "bbox": [ + 135, + 520, + 479, + 566 + ], + "type": "table", + "html": "
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)
DINOv2 [42]40.8430.1980.2576.8865.5582.4355.8643.673.54
+ Ours43.432.7683.5480.5267.583.3758.3244.8474.37
", + "image_path": "9cc6104fbcf975ed8f8233b2a09fdc99b7680c46d97fe2ff2c86529d6d539cb9.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "type": "table", + "bbox": [ + 135, + 617, + 479, + 664 + ], + "blocks": [ + { + "bbox": [ + 131, + 574, + 482, + 608 + ], + "lines": [ + { + "bbox": [ + 131, + 574, + 482, + 608 + ], + "spans": [ + { + "bbox": [ + 131, + 574, + 482, + 608 + ], + "type": "text", + "content": "Table 2: Depth estimation scores on indoor datasets. 3D-aware fine-tuning consistently leads to improved performance on depth estimation in comparison to standard DINOv2 across different indoor datasets." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 617, + 479, + 664 + ], + "lines": [ + { + "bbox": [ + 135, + 617, + 479, + 664 + ], + "spans": [ + { + "bbox": [ + 135, + 617, + 479, + 664 + ], + "type": "table", + "html": "
MethodScanNet++ [60]NYUv2 [51]ScanNet [9]
RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)RMSE (↓)Rel (↓)
DINOv2 [42]0.37420.28360.44230.13920.30890.1557
+ Ours0.33610.24010.41980.13000.29210.1459
", + "image_path": "428325be8d5e63f3c6b4b79393aac3bba5175d8fb1ab15468b04ab82e1f21847.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 180, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 180, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 180, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 480, + 498 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 480, + 498 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 480, + 498 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 480, + 498 + ], + "type": "image", + "image_path": "37593f52bc32f25259ece3882fffcbae2ef501d2bc3d57170b523f64a0320020.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 504, + 482, + 540 + ], + "lines": [ + { + "bbox": [ + 130, + 504, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 504, + 482, + 540 + ], + "type": "text", + "content": "Fig. 5: Qualitative results on semantic segmentation on indoor datasets. After fine-tuning DINOv2 with 3D-aware features, we obtain less noisy and more compact segmentation results, especially for detailed structures and in homogeneous regions." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 564, + 293, + 576 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 564, + 293, + 576 + ], + "spans": [ + { + "bbox": [ + 132, + 564, + 293, + 576 + ], + "type": "text", + "content": "4.4 Out-of-domain Evaluation" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 593, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 668 + ], + "type": "text", + "content": "We train feature Gaussians and fine-tune DINOv2 on ScanNet++, a dataset that contains only indoor scenes with the usual content, e.g. tables, chairs and other indoor furniture. We want to analyze how the gains obtained in this setting generalize to other domains, e.g. outdoor scenes. For semantic segmentation, we conduct linear probing on ADE20k [62] and Pascal VOC [17]. For depth estimation, we conduct linear probing on KITTI [18]." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 145, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 145, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 145, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 480, + 502 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 480, + 502 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 480, + 502 + ], + "type": "image", + "image_path": "9281332d889b6cd36808ac7c6d6a6472d8698c85fb7147ac4ed7cca77e3395f2.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 510, + 482, + 544 + ], + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 544 + ], + "type": "text", + "content": "Fig. 6: Qualitative results on depth estimation on indoor datasets. After incorporating 3D-aware features, we obtain cleaner depth in textureless regions and more detailed depth on fine-grained structures, e.g. legs of tables or chairs." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "Quantitative comparison. We observe that the improvement brought by 3D-aware features is generalizable to out-of-domain challenging datasets and also outdoor driving scenes, although to a smaller degree. As shown in Tab. 3, for semantic segmentation task, incorporating our 3D-aware features brings a gain of " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "1.6\\%" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " mIoU on the ADE20k [62] and a gain of " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "1.2\\%" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " mIoU on Pascal VOC [17] over standard DINOv2 features. Furthermore, we also compare our performance on urban scene dataset KITTI [18] for depth estimation and observe our 3D-aware features help to reduce RMSE from 3.03 (DINOv2) to 2.91." + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 181, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 181, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 168, + 479, + 220 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 160 + ], + "type": "text", + "content": "Table 3: Quantitative performance on out-of-domain datasets. 3D-aware fine-tuning noticeably improves semantic segmentation on ADE20k and Pascal VOC and depth estimation on KITTI, demonstrating the transferability of the fine-tuned features, even under a significant domain gap." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 168, + 479, + 220 + ], + "lines": [ + { + "bbox": [ + 135, + 168, + 479, + 220 + ], + "spans": [ + { + "bbox": [ + 135, + 168, + 479, + 220 + ], + "type": "table", + "html": "
MethodADE20k [62]Pascal VOC [17]KITTI [18]
mAcc (↑)mIoU (↑)aAcc (↑)mAcc (↑)mIoU (↑)aAcc (↑)RMSE (↓)Rel (↓)
DINOv2 [42]56.7444.2879.7390.6181.1495.723.030.10
+ Ours58.7145.9381.0591.0482.3596.142.910.09
", + "image_path": "447a3274c541dc6a038d5254f83e809927b517f77a4b538d1feec07bca07ef94.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 261, + 479, + 311 + ], + "blocks": [ + { + "bbox": [ + 132, + 229, + 482, + 252 + ], + "lines": [ + { + "bbox": [ + 132, + 229, + 482, + 252 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 482, + 252 + ], + "type": "text", + "content": "Table 4: Generalization on other 2D vision models. Our 3D-aware fine-tuning applies to other 2D vision models and readily improves their performance." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 261, + 479, + 311 + ], + "lines": [ + { + "bbox": [ + 135, + 261, + 479, + 311 + ], + "spans": [ + { + "bbox": [ + 135, + 261, + 479, + 311 + ], + "type": "table", + "html": "
DINOv2-regCLIPMAEDeiT-III
mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)mIoU (↑)RMSE (↓)
Original30.920.419025.610.432417.190.485518.620.4350
+ Ours33.390.382428.820.396020.270.479522.980.3820
", + "image_path": "9cc2a856baeecb8a1ab0b87b8961ddc355bef00357dccdf3200237e3af0384a1.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 334, + 482, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 334, + 482, + 429 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 482, + 429 + ], + "type": "text", + "content": "Qualitative comparison. We show qualitative comparison on out-of-domain datasets in Fig. 7. We observe similar improvements as in the within-domain datasets. Even though the 3D-aware fine-tuning is only conducted on indoor dataset ScanNet++, the fine-tuned features exhibit transferability to improve segmentation results for the detailed structures of common objects like bicycle and animal and help denoise segmentation of objects like tree, building and pillar. On depth estimation, the incorporated 3D-aware features are helpful in capturing the detailed structure of trees." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 447, + 358, + 459 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 358, + 459 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 358, + 459 + ], + "type": "text", + "content": "4.5 Generalization to Other Vision Models" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 468, + 482, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 540 + ], + "type": "text", + "content": "We conduct experiments on more vision models (DINOv2-reg [10], CLIP [46], MAE [24], DeiT-III [54]) to prove the universality of our method. We show the linear probing results of semantic segmentation and depth estimation on ScanNet++ validation set in Tab. 4. Our method consistently improves all the models. We also visualize the features in Fig. 2. Note that the original MAE features are already clean but our method still improves them." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 558, + 313, + 571 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 313, + 571 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 313, + 571 + ], + "type": "text", + "content": "4.6 Ablation Studies and Analysis" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 578, + 481, + 602 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 578, + 481, + 602 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 481, + 602 + ], + "type": "text", + "content": "We conduct ablation studies on semantic segmentation on NYUv2 dataset with DINOv2." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "Feature dimension of each Gaussian. We attach a low-dimensional feature vector with each Gaussian and then up-project it to the same space with DINOv2. Tab. 5 indicates that increasing the feature dimension from 32 to 64 will improve the performance of fine-tuned DINOv2 with an acceptable higher memory and longer training time. Increasing the feature dimension further to 128 is" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 480, + 396 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 480, + 396 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 480, + 396 + ], + "type": "image", + "image_path": "2304bae93e24b5e5effdf1b9159938961160240c5f51e2ae8c10cfb8e716e3a9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 405, + 482, + 429 + ], + "lines": [ + { + "bbox": [ + 132, + 405, + 482, + 429 + ], + "spans": [ + { + "bbox": [ + 132, + 405, + 482, + 429 + ], + "type": "text", + "content": "Fig. 7: Qualitative results on out-of-domain datasets. Our 3D-aware features help DINoV2 achieve less noisy segmentation and capture detailed structure." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 452, + 480, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 452, + 480, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 452, + 480, + 489 + ], + "type": "text", + "content": "not feasible in our hardware due to the large memory consumption. We chose a feature dimension of 64 as a good compromise between model performance, memory consumption, as well as training time." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 491, + 482, + 576 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 482, + 576 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 482, + 576 + ], + "type": "text", + "content": "Feature assembly strategy. We study different strategies to assemble the fine-tuned features with the original DINOv2 features in Tab. 7. We explore simple channel-wise adding and concatenation. Alternatively, we first concatenate the fine-tuned features with the original DINOv2 features then use a liner layer to fuse them to the same feature space of DINOv2. We observe simple concatenation works well in incorporating learned 3D-aware features while preserving original generalization ability." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 578, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 578, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 482, + 628 + ], + "type": "text", + "content": "Fine-tuning epochs. We finetune DINOv2 using the features rendered by the pre-trained feature Gaussians. Tab. 8 suggests that a single epoch is sufficient to transfer the 3D awareness to DINOv2 and more epochs may harm the model's generalization ability." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Fine-tuning vs. adapter. Besides directly fine-tuning DINOv2, we explore an alternative strategy where we keep DINOv2 frozen and introduce an adapter on top of that. The adapter is a single Swin Transformer block [37]. We observe the" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 181, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 181, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 168, + 342, + 200 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 342, + 160 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 342, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 342, + 160 + ], + "type": "text", + "content": "Table 5: Ablation study on feature dimension of 3D Gaussian. Increasing feature dimensions improves performance at the cost of larger memory consumption and longer training time." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 168, + 342, + 200 + ], + "lines": [ + { + "bbox": [ + 133, + 168, + 342, + 200 + ], + "spans": [ + { + "bbox": [ + 133, + 168, + 342, + 200 + ], + "type": "table", + "html": "
Feature dimensionAverage memory (MB)Average Training time (h)mAcc (↑)mIoU (↑)aAcc (↑)
323701.378.7767.1583.44
644951.680.5267.583.37
1287502.5---
", + "image_path": "3af62efbd30d1823c92adb52343eac1533b4e7544cf3608e491a36bbcfa0323f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 347, + 168, + 480, + 200 + ], + "blocks": [ + { + "bbox": [ + 346, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 346, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 346, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 6: Ablation study on fine-tuning vs. adapter. An adapter is a tiny network plugged into the frozen DINOv2 features." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 347, + 168, + 480, + 200 + ], + "lines": [ + { + "bbox": [ + 347, + 168, + 480, + 200 + ], + "spans": [ + { + "bbox": [ + 347, + 168, + 480, + 200 + ], + "type": "table", + "html": "
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Fine-tuning91.0482.3596.14
Adapter90.9782.0295.96
", + "image_path": "a725286dc868afe31e110ba217583eac63b3daf53215ebb294ff4bb8a7d54659.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 135, + 266, + 288, + 306 + ], + "blocks": [ + { + "bbox": [ + 132, + 212, + 290, + 257 + ], + "lines": [ + { + "bbox": [ + 132, + 212, + 290, + 257 + ], + "spans": [ + { + "bbox": [ + 132, + 212, + 290, + 257 + ], + "type": "text", + "content": "Table 7: Ablation study on feature assembly. We study different strategies to assemble fine-tuned features with the original DINOV2." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 266, + 288, + 306 + ], + "lines": [ + { + "bbox": [ + 135, + 266, + 288, + 306 + ], + "spans": [ + { + "bbox": [ + 135, + 266, + 288, + 306 + ], + "type": "table", + "html": "
StrategymAcc (↑)mIoU (↑)aAcc (↑)
Adding77.9766.082.85
Linear fusion78.2266.3982.89
Concatenation80.5267.583.37
", + "image_path": "37044062810227e1abb86ed9527d2abf12121cb4ccb371749cb1e4b8bb1a15e0.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 297, + 266, + 479, + 306 + ], + "blocks": [ + { + "bbox": [ + 294, + 212, + 481, + 256 + ], + "lines": [ + { + "bbox": [ + 294, + 212, + 481, + 256 + ], + "spans": [ + { + "bbox": [ + 294, + 212, + 481, + 256 + ], + "type": "text", + "content": "Table 8: Ablation study on fine-tuning epochs. We find fine-tuning with a single epoch with 8.5 hours is sufficient to achieve good performance." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 297, + 266, + 479, + 306 + ], + "lines": [ + { + "bbox": [ + 297, + 266, + 479, + 306 + ], + "spans": [ + { + "bbox": [ + 297, + 266, + 479, + 306 + ], + "type": "table", + "html": "
EpochsFine-tun. time (h)mAcc (↑)mIoU (↑)aAcc (↑)
18.580.5267.583.37
21778.7267.2583.54
325.579.567.1883.24
", + "image_path": "4fce81eb914ceeb1c770e1ec6023f9a404c2d830645eb2905839ae1dca1d9a84.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 330, + 480, + 367 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 330, + 480, + 367 + ], + "spans": [ + { + "bbox": [ + 130, + 330, + 480, + 367 + ], + "type": "text", + "content": "adapter can achieve comparable performance with fine-tuning (Tab. 6), however, with longer training time. We stick with the fine-tuning strategy for simplicity without introducing any additional network component." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "content": "Limitations and discussion. Our work makes an initial step to transfer multiview consistent and 3D-aware features encoded by a 3D Gaussian representation to 2D foundation model via fine-tuning. We demonstrate the 3D-aware features are helpful for downstream tasks. However, we still need the original features to keep the generalization ability. We attribute this to the limited diversity of our 3D training data (only a single indoor dataset) and hypothesize that this can be remedied by fine-tuning on larger-scale data." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 475, + 220, + 489 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 220, + 489 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 220, + 489 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 505, + 482, + 626 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 505, + 482, + 626 + ], + "spans": [ + { + "bbox": [ + 130, + 505, + 482, + 626 + ], + "type": "text", + "content": "In this work, we present a method to inject 3D awareness into 2D foundation models. We first lift 2D foundation features into a 3D Gaussian representation and then use the rendered multi-view consistent and 3D-aware features to in turn fine-tune the 2D foundation model. Our experiments show that incorporating the fine-tuned features readily leads to improved performance on both semantic and geometric tasks through simple linear probing. Although we only conduct the 3D-aware fine-tuning on a single dataset " + }, + { + "bbox": [ + 130, + 505, + 482, + 626 + ], + "type": "inline_equation", + "content": "\\mathrm{ScanNet}++" + }, + { + "bbox": [ + 130, + 505, + 482, + 626 + ], + "type": "text", + "content": ", we demonstrate the learned 3D awareness is transferable across a variety of datasets in different domains. We hope our work inspires future research to consider equipping 2D foundation models with 3D-aware understanding." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "content": "Acknowledgements Francis Engelmann is partially supported by an ETH AI Center postdoctoral research fellowship and an ETH Zurich Career Seed Award." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 139, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 139, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 139, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 138, + 139, + 481, + 172 + ], + "type": "text", + "content": "1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep ViT Features as Dense Visual Descriptors. In: European Conference on Computer Vision (ECCV) Workshops (2022) 2" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 173, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 173, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 138, + 173, + 481, + 205 + ], + "type": "text", + "content": "2. Bachmann, R., Mizrahi, D., Atanov, A., Zamir, A.: MultiMAE: Multi-modal Multitask Masked Autoencoders. In: European Conference on Computer Vision (ECCV) (2022) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 205, + 481, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 205, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 138, + 205, + 481, + 236 + ], + "type": "text", + "content": "3. Bao, H., Dong, L., Piao, S., Wei, F.: BEiT: BERT Pre-training of Image Transformers. In: International Conference on Learning Representations (ICLR) (2022) 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 238, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 238, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 138, + 238, + 481, + 270 + ], + "type": "text", + "content": "4. Bengio, Y., Courville, A., Vincent, P.: Representation Learning: A Review and New Perspectives. Transactions on Pattern Analysis and Machine Intelligence (PAMI) (2013) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 271, + 481, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 271, + 481, + 304 + ], + "spans": [ + { + "bbox": [ + 138, + 271, + 481, + 304 + ], + "type": "text", + "content": "5. Bhat, S.F., Alhashim, I., Wonka, P.: Adabins: Depth Estimation Using Adaptive Bins. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2021) 8" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 304, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 304, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 138, + 304, + 481, + 336 + ], + "type": "text", + "content": "6. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised Learning of Visual Features by Contrasting Cluster Assignments. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 337, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 481, + 369 + ], + "type": "text", + "content": "7. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging Properties in Self-Supervised Vision Transformers. In: International Conference on Computer Vision (ICCV) (2021) 2, 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 370, + 481, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 481, + 403 + ], + "type": "text", + "content": "8. Chen, M., Radford, A., Child, R., Wu, J., Jun, H., Luan, D., Sutskever, I.: Generative Pretraining From Pixels. In: International Conference on Machine Learning (ICML) (2020) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 403, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 481, + 435 + ], + "type": "text", + "content": "9. Dai, A., Chang, A.X., Savva, M., Halber, M., Funkhouser, T., Nießner, M.: ScanNet: Richly-Annotated 3D Reconstructions of Indoor Scenes. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 9" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 436, + 481, + 466 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 436, + 481, + 466 + ], + "spans": [ + { + "bbox": [ + 138, + 436, + 481, + 466 + ], + "type": "text", + "content": "0. Darcet, T., Oquab, M., Mairal, J., Bojanowski, P.: Vision Transformers Need Registers. In: International Conference on Learning Representations (ICLR) (2024) 3, 12" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 468, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 481, + 490 + ], + "type": "text", + "content": "1. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. NAACL (2018) 3" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 491, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 481, + 522 + ], + "type": "text", + "content": "2. Doersch, C., Gupta, A., Efros, A.A.: Unsupervised Visual Representation Learning by Context Prediction. In: International Conference on Computer Vision (ICCV) (2015) 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 523, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 481, + 567 + ], + "type": "text", + "content": "3. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An Image Is Worth 16x16 Words: Transformers for Image Recognition at Scale. In: International Conference on Learning Representations (ICLR) (2020) 2, 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 567, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 481, + 600 + ], + "type": "text", + "content": "4. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative Unsupervised Feature Learning With Convolutional Neural Networks. In: International Conference on Neural Information Processing Systems (NeurIPS) (2014) 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 601, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 481, + 643 + ], + "type": "text", + "content": "5. El Banani, M., Raj, A., Maninis, K.K., Kar, A., Li, Y., Rubinstein, M., Sun, D., Guibas, L., Johnson, J., Jampani, V.: Probing the 3D Awareness of Visual Foundation Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 481, + 665 + ], + "type": "text", + "content": "6. Engelmann, F., Manhardt, F., Niemeyer, M., Tateno, K., Tombari, F.: OpenNeRF: Open Set 3D Neural Scene Segmentation with Pixel-Wise Features and Rendered" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 180, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 149, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 149, + 116, + 480, + 138 + ], + "type": "text", + "content": "Novel Views. In: International Conference on Learning Representations (ICLR) (2024) 3" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 138, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 138, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 138, + 481, + 171 + ], + "type": "text", + "content": "17. Everingham, M., Eslami, S.A., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal Visual Object Classes Challenge: A Retrospective. International Journal of Computer Vision (2015) 8, 10, 11, 12" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 171, + 481, + 191 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 171, + 481, + 191 + ], + "spans": [ + { + "bbox": [ + 133, + 171, + 481, + 191 + ], + "type": "text", + "content": "18. Geiger, A., Lenz, P., Stiller, C., Urtasun, R.: Vision Meets Robotics: The Kitti Dataset. The International Journal of Robotics Research (2013) 8, 10, 11, 12" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 191, + 481, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 191, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 133, + 191, + 481, + 224 + ], + "type": "text", + "content": "19. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling Open-Vocabulary Image Segmentation With Image-Level Labels. In: European Conference on Computer Vision (ECCV) (2022) 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 224, + 481, + 256 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 481, + 256 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 481, + 256 + ], + "type": "text", + "content": "20. Gidaris, S., Singh, P., Komodakis, N.: Unsupervised Representation Learning by Predicting Image Rotations. In: International Conference on Learning Representations (ICLR) (2018) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 256, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 256, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 256, + 481, + 300 + ], + "type": "text", + "content": "21. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap Your Own Latent-a New Approach to Self-Supervised Learning. In: International Conference on Neural Information Processing Systems (NeurIPS) (2020) 3" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 300, + 481, + 321 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 481, + 321 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 481, + 321 + ], + "type": "text", + "content": "22. Ha, H., Song, S.: Semantic Abstraction: Open-world 3D Scene Understanding From 2D Vision-Language Models. In: Conference on Robot Learning (CoRL) (2022) 4" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 321, + 481, + 353 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 321, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 132, + 321, + 481, + 353 + ], + "type": "text", + "content": "23. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality Reduction by Learning an Invariant Mapping. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2006) 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 353, + 481, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 353, + 481, + 385 + ], + "spans": [ + { + "bbox": [ + 132, + 353, + 481, + 385 + ], + "type": "text", + "content": "24. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked Autoencoders Are Scalable Vision Learners. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 4, 12" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 385, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 385, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 385, + 481, + 418 + ], + "type": "text", + "content": "25. He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum Contrast for Unsupervised Visual Representation Learning. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2020) 3" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 418, + 481, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 481, + 450 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 481, + 450 + ], + "type": "text", + "content": "26. Hou, J., Dai, X., He, Z., Dai, A., Nießner, M.: Mask3D: Pre-training 2D Vision Transformers by Learning Masked 3D Priors. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 450, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 450, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 132, + 450, + 481, + 482 + ], + "type": "text", + "content": "27. Hou, J., Xie, S., Graham, B., Dai, A., Nießner, M.: Pri3D: Can 3D Priors Help 2D Representation Learning? In: International Conference on Computer Vision (ICCV) (2021) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "type": "text", + "content": "28. Huang, R., Peng, S., Takmaz, A., Tombari, F., Pollefeys, M., Song, S., Huang, G., Engelmann, F.: Segment3D: Learning Fine-Grained Class-Agnostic 3D Segmentation without Manual Labels. European Conference on Computer Vision (ECCV) (2024) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "text", + "content": "29. Jatavallabhula, K.M., Kuwajerwala, A., Gu, Q., Omama, M., Chen, T., Li, S., Iyer, G., Saryazdi, S., Keetha, N., Tewari, A., et al.: ConceptFusion: Open-set Multimodal 3D Mapping. Robotics: Science and Systems (RSS) (2023) 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 557, + 481, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 481, + 601 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 481, + 601 + ], + "type": "text", + "content": "30. Ke, B., Obukhov, A., Huang, S., Metzger, N., Daudt, R.C., Schindler, K.: Repurposing Diffusion-Based Image Generators for Monocular Depth Estimation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 601, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 632 + ], + "type": "text", + "content": "31. Kerbl, B., Kopanas, G., Leimkuhler, T., Drettakis, G.: 3D Gaussian Splatting for Real-Time Radiance Field Rendering. ACM Transactions on Graphics (2023) 2, 4, 5, 6" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "32. Kerr, J., Kim, C.M., Goldberg, K., Kanazawa, A., Tancik, M.: LERF: Language Embedded Radiance Fields. In: International Conference on Computer Vision (ICCV) (2023) 3" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "33. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment Anything. In: International Conference on Computer Vision (ICCV) (2023) 2" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 149, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 149, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 130, + 149, + 482, + 182 + ], + "type": "text", + "content": "34. Kobayashi, S., Matsumoto, E., Sitzmann, V.: Decomposing Nerf for Editing via Feature Field Distillation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 182, + 482, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 182, + 482, + 214 + ], + "spans": [ + { + "bbox": [ + 130, + 182, + 482, + 214 + ], + "type": "text", + "content": "35. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven Semantic Segmentation. In: International Conference on Learning Representations (ICLR) (2022) 3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 214, + 482, + 257 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 214, + 482, + 257 + ], + "spans": [ + { + "bbox": [ + 130, + 214, + 482, + 257 + ], + "type": "text", + "content": "36. Li, F., Zhang, H., Xu, H., Liu, S., Zhang, L., Ni, L.M., Shum, H.Y.: Mask DINO: Towards a Unified Transformer-Based Framework for Object Detection and Segmentation. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 257, + 482, + 290 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 257, + 482, + 290 + ], + "spans": [ + { + "bbox": [ + 130, + 257, + 482, + 290 + ], + "type": "text", + "content": "37. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin Transformer: Hierarchical Vision Transformer Using Shifted Windows. In: International Conference on Computer Vision (ICCV) (2021) 13" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 289, + 482, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 482, + 311 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 482, + 311 + ], + "type": "text", + "content": "38. Loshchilov, I., Hutter, F.: Decoupled Weight Decay Regularization. In: International Conference on Learning Representations (ICLR) (2019) 8" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 311, + 482, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 482, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 482, + 342 + ], + "type": "text", + "content": "39. Mazur, K., Sucar, E., Davison, A.J.: Feature-realistic Neural Fusion for Real-time, Open Set Scene Understanding. In: International Conference on Robotics and Automation (ICRA) (2023) 4" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 342, + 482, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 342, + 482, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 342, + 482, + 374 + ], + "type": "text", + "content": "40. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis. In: European Conference on Computer Vision (ECCV) (2020) 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 374, + 482, + 406 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 374, + 482, + 406 + ], + "spans": [ + { + "bbox": [ + 130, + 374, + 482, + 406 + ], + "type": "text", + "content": "41. Noroozi, M., Favaro, P.: Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles. In: European Conference on Computer Vision (ECCV) (2016) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 406, + 482, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 482, + 449 + ], + "type": "text", + "content": "42. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: DINOV2: Learning Robust Visual Features Without Supervision. Transactions on Machine Learning Research (2023) 1, 2, 3, 5, 6, 7, 8, 9, 12" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 449, + 482, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 482 + ], + "type": "text", + "content": "43. Pathak, D., Girshick, R., Dollar, P., Darrell, T., Hariharan, B.: Learning Features by Watching Objects Move. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 482, + 482, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 482, + 482, + 514 + ], + "spans": [ + { + "bbox": [ + 130, + 482, + 482, + 514 + ], + "type": "text", + "content": "44. Peng, S., Genova, K., Jiang, C., Tagliasacchi, A., Pollefeys, M., Funkhouser, T.: OpenScene: 3D Scene Understanding with Open Vocabularies. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 514, + 482, + 546 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 514, + 482, + 546 + ], + "spans": [ + { + "bbox": [ + 130, + 514, + 482, + 546 + ], + "type": "text", + "content": "45. Qin, M., Li, W., Zhou, J., Wang, H., Pfister, H.: LangSplat: 3D Language Gaussian Splatting. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 546, + 482, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 590 + ], + "type": "text", + "content": "46. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning Transferable Visual Models From Natural Language Supervision. In: International Conference on Machine Learning (ICML) (2021) 3, 12" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 590, + 482, + 622 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 482, + 622 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 482, + 622 + ], + "type": "text", + "content": "47. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-Resolution Image Synthesis With Latent Diffusion Models. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 622, + 482, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 622, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 622, + 482, + 665 + ], + "type": "text", + "content": "48. Saxena, S., Herrmann, C., Hur, J., Kar, A., Norouzi, M., Sun, D., Fleet, D.J.: The Surprising Effectiveness of Diffusion Models for Optical Flow and Monocular Depth Estimation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2024) 2" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 180, + 91, + 449, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 180, + 91, + 449, + 102 + ], + "spans": [ + { + "bbox": [ + 180, + 91, + 449, + 102 + ], + "type": "text", + "content": "Improving 2D Feature Representations by 3D-Aware Fine-Tuning" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 621 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "49. Shen, W., Yang, G., Yu, A., Wong, J., Kaelbling, L.P., Isola, P.: Distilled Feature Fields Enable Few-Shot Language-Guided Manipulation. In: Conference on Robot Learning (CoRL) (2023) 4" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 183 + ], + "type": "text", + "content": "50. Shi, J.C., Wang, M., Duan, H.B., Guan, S.H.: Language Embedded 3D Gaussians for Open-Vocabulary Scene Understanding. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 481, + 215 + ], + "type": "text", + "content": "51. Silberman, N., Hoiem, D., Kohli, P., Fergus, R.: Indoor Segmentation and Support Inference From RGBD Images. In: European Conference on Computer Vision (ECCV) (2012) 8, 9" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "text", + "content": "52. Takmaz, A., Fedele, E., Sumner, R.W., Pollefeys, M., Tombari, F., Engelmann, F.: OpenMask3D: Open-Vocabulary 3D Instance Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 281 + ], + "type": "text", + "content": "53. Tan, H., Wu, S., Pi, J.: Semantic Diffusion Network for Semantic Segmentation. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 281, + 481, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 481, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 481, + 304 + ], + "type": "text", + "content": "54. Touvron, H., Cord, M., Jégou, H.: Deit III: Revenge of the ViT. In: European Conference on Computer Vision (ECCV) (2022) 3, 12" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 304, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 481, + 335 + ], + "type": "text", + "content": "55. Tschernezki, V., Laina, I., Larlus, D., Vedaldi, A.: Neural Feature Fusion Fields: 3D Distillation of Self-Supervised 2D Image Representations. In: International Conference on 3D Vision (3DV) (2022) 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "text", + "content": "56. Wang, X., Gupta, A.: Unsupervised Learning of Visual Representations Using Videos. In: International Conference on Computer Vision (ICCV) (2015) 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 358, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 390 + ], + "type": "text", + "content": "57. Weder, S., Blum, H., Engelmann, F., Pollefeys, M.: LabelMaker: Automatic Semantic Label Generation from RGB-D Trajectories. In: International Conference on 3D Vision (3DV) (2024) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 391, + 481, + 434 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 391, + 481, + 434 + ], + "spans": [ + { + "bbox": [ + 132, + 391, + 481, + 434 + ], + "type": "text", + "content": "58. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: CroCo: Self-Supervised Pre-training for 3D Vision Tasks by Cross-View Completion. In: International Conference on Neural Information Processing Systems (NeurIPS) (2022) 4" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 434, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 434, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 434, + 481, + 468 + ], + "type": "text", + "content": "59. Yang, L., Kang, B., Huang, Z., Xu, X., Feng, J., Zhao, H.: Depth Anything: Unleashing the Power of Large-Scale Unlabeled Data. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 2" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 468, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 481, + 500 + ], + "type": "text", + "content": "60. Yeshwanth, C., Liu, Y.C., Nießner, M., Dai, A.: ScanNet++: A High-Fidelity Dataset of 3D Indoor Scenes. In: International Conference on Computer Vision (ICCV) (2023) 8, 9" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "text", + "content": "61. Zhang, J., Herrmann, C., Hur, J., Polania Cabrera, L., Jampani, V., Sun, D., Yang, M.H.: A Tale of Two Features: Stable Diffusion Complements DINO for Zero-Shot Semantic Correspondence. In: International Conference on Neural Information Processing Systems (NeurIPS) (2023) 2" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 545, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 481, + 578 + ], + "type": "text", + "content": "62. Zhou, B., Zhao, H., Puig, X., Fidler, S., Barriuso, A., Torralba, A.: Scene Parsing Through ade20K Dataset. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2017) 8, 10, 11, 12" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 578, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 481, + 621 + ], + "type": "text", + "content": "63. Zhou, S., Chang, H., Jiang, S., Fan, Z., Zhu, Z., Xu, D., Chari, P., You, S., Wang, Z., Kadambi, A.: Feature 3DGS: Supercharging 3D Gaussian Splatting to Enable Distilled Feature Fields. In: International Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "Y. Yue et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_content_list.json b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..4253cfe180c5c115f88cd256f9a1d8e0f46a9565 --- /dev/null +++ b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_content_list.json @@ -0,0 +1,1691 @@ +[ + { + "type": "text", + "text": "Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data", + "text_level": 1, + "bbox": [ + 254, + 140, + 750, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Sneha Paul, Zachary Patterson, and Nizar Bouguila", + "bbox": [ + 310, + 212, + 686, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Concordia Institute for Information Systems Engineering,", + "bbox": [ + 308, + 239, + 691, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Concordia University, Montreal, Canada", + "bbox": [ + 367, + 255, + 635, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "sneha.paul@mail.concordia.ca", + "bbox": [ + 390, + 268, + 609, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{zachary.patterson,nizar.bouguila}@concordia.ca", + "bbox": [ + 320, + 282, + 681, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Semi-supervised learning (SSL) has shown its effectiveness in learning effective 3D representation from a small amount of labelled data while utilizing large unlabelled data. Traditional semi-supervised approaches rely on the fundamental concept of predicting pseudo-labels for unlabelled data and incorporating them into the learning process. However, we identify that the existing methods do not fully utilize all the unlabelled samples and consequently limit their potential performance. To address this issue, we propose AllMatch, a novel SSL-based 3D classification framework that effectively utilizes all the unlabelled samples. AllMatch comprises three modules: (1) an adaptive hard augmentation module that applies relatively hard augmentations to the high-confident unlabelled samples with lower loss values, thereby enhancing the contribution of such samples, (2) an inverse learning module that further improves the utilization of unlabelled data by learning what not to learn, and (3) a contrastive learning module that ensures learning from all the samples in both supervised and unsupervised settings. Comprehensive experiments on two popular 3D datasets demonstrate a performance improvement of up to $11.2\\%$ with $1\\%$ labelled data, surpassing the SOTA by a significant margin. Furthermore, AllMatch exhibits its efficiency in effectively leveraging all the unlabelled data, demonstrated by the fact that only $10\\%$ of labelled data reaches nearly the same performance as fully-supervised learning with all labelled data. The code of our work is available at: github.com/snehaputul/AllMatch.", + "bbox": [ + 261, + 335, + 738, + 654 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Semi-supervised Learning $\\cdot$ Point Cloud $\\cdot$ 3D Vision", + "bbox": [ + 261, + 667, + 694, + 683 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 709, + 374, + 724 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In the realm of 3D computer vision, Point Cloud applications are on the rise, finding extensive use in diverse domains. This increasing popularity of Point Cloud applications across various 3D computer vision domains has heightened the demand for annotated data, a resource-intensive and expensive task [16]. To tackle this", + "bbox": [ + 215, + 733, + 553, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/9a3eeb2f8def16ca97aeb0d67e8f6c55c154ba18f45da9b9510e645faaab9ac2.jpg", + "image_caption": [ + "Fig.1: Performance in comparison to unlabelled data usage." + ], + "image_footnote": [], + "bbox": [ + 566, + 694, + 785, + 819 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "issue, 3D semi-supervised learning (SSL) emerges as a promising avenue. By capitalizing on scarce labelled data in conjunction with abundant unlabelled data, this approach has demonstrated its efficacy in different computer vision applications, including 3D object recognition. Most popular forms of SSL (e.g. [21], [28]) involve predicting pseudo-labels for the unlabelled data and using only the high-confident predictions for learning. However, due to the hand-designed nature of the high-confidence-based filtering, most of the unlabelled samples never contribute to the learning (Figure 1).", + "bbox": [ + 212, + 146, + 787, + 268 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Some of the more recent works propose different techniques to increase the number of unlabelled samples the model learns from. For example, FlexMatch [28] introduced a dynamic threshold strategy, where the threshold value is adjusted according to the model's learning status using curriculum learning. SoftMatch [3] proposed a trade-off between quality and quantity to increase unlabelled data usage. While there has been some progress in this direction, these methods are specially developed for the image domain and have not been explored in the context of 3D SSL. Furthermore, as shown in Figure", + "bbox": [ + 212, + 275, + 488, + 530 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/bd3afb67132dd7b47f7711309bb3dc8585394b17d26d01eb95dcdb6a841d2467.jpg", + "image_caption": [ + "Fig.2: (left) Pseudo label utilization over the training epochs by FixMatch and Confid. While ConFid does better utilization than FixMatch, none properly utilizes all unlabelled data. (right) Loss over training for high and low-confident pseudo-labels. The high-confident samples are selected for unsupervised learning, but low loss results in marginal contribution to learning." + ], + "image_footnote": [], + "bbox": [ + 509, + 286, + 629, + 393 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/3d932bbc68df6f73f648193e708ab6d46885cf8bf6e011719f6e743d6afea006.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 640, + 286, + 763, + 393 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 (left) for 3D SSL, FixMatch utilizes about $25\\%$ of the unlabelled data, while the current state-of-the-art (SOTA) method, ConFid [8], utilizes about $76\\%$ of the unlabelled data. Moreover, we find that the correctly predicted pseudo-labels do not contribute much towards the learning, as they have higher confidence in prediction and lower loss (Figure 2 (right)).", + "bbox": [ + 212, + 530, + 787, + 607 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this work, we propose a novel semi-supervised framework named AllMatch that handles the above-mentioned problems and ensures learning from all the unlabeled data. AllMatch consists of three modules, all of which improve different aspects of increasing unlabeled data usage. While the concepts of these modules are not entirely new, they have never been explored in 3D SSL, especially with the focus on increasing the utilization of unlabeled data. The modules in AllMatch are: (a) An adaptive hard augmentation(AHA) module that increases the augmentation strength of the high-confident unlabeled samples with lower loss. This module ensures better utilization of high-confident samples that the model has already learned, thus leaving no further contribution to the model's learning process. (b) An inverse learning module that further ensures better utilization of unlabeled samples by assigning inverse pseudo labels to the low-confident predictions and learning what not to learn. (c) A contrastive learning (CL) module that learns from all the unlabeled data in unsupervised learning settings. This module ensures that the samples excluded from pseudo-label-based learning also", + "bbox": [ + 212, + 613, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "contribute to the learning process by participating in CL. Additionally, we utilize a modified supervised contrastive loss [12] for learning from the labelled data in a similar learning setting as the unlabelled data.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23], with different amounts of labelled sets. We compare AllMatch with the existing SSL methods and find that AllMatch outperforms the existing SOTA by up to $11.2\\%$ and $10.45\\%$ on ScanObjectNN and ModelNet40 datasets, respectively, with a minimal amount of labelled data. AllMatch also shows superior performance with a lower amount of labelled set, indicating its effectiveness in utilizing all unlabelled samples. With our proposed method, only $10\\%$ of the labelled data performs almost as well as in a fully supervised setting with all the labelled data. Furthermore, our method is more computationally efficient than the previous SOTA, ConFid [8], which requires 500 epochs of training compared to 250 in ours. We also conduct an in-depth ablation study and sensitivity analysis demonstrating the importance of all three components for AllMatch's superior performance. Here, the AHA module shows the highest impact on the model's performance, followed by inverse learning and contrastive learning modules. Our main contributions to this work can be summarized as follows:", + "bbox": [ + 212, + 191, + 787, + 434 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We propose a novel semi-supervised 3D classification framework named All-Match that effectively utilizes the whole unlabelled set to improve the performance.", + "- We introduce an adaptive hard augmentation module that efficiently utilizes the higher-confident samples with lower loss and an inverse learning module to further boost the utilization of unlabelled samples by learning from low-confident predictions.", + "- We introduce a contrastive learning module to ensure learning from the remainder of the unlabeled data that are not utilized by pseudo-label-based learning.", + "- We improve the SOTA for 3D semi-supervised learning by $11.2\\%$ , and $10.45\\%$ on the ScanobjectNN and ModelNet40 datasets, respectively. We also show that AllMatch achieves almost similar results in a fully-supervised setting with only $10\\%$ of labelled data." + ], + "bbox": [ + 225, + 445, + 784, + 654 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 678, + 387, + 694 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Semi-supervised Learning", + "text_level": 1, + "bbox": [ + 215, + 709, + 475, + 724 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "There has been significant progress in semi-supervised learning in recent years, mostly for image representation learning. Most dominant approaches in semi-supervised learning can be divided into two main categories: consistency regularization [22, 26] and entropy minimization [1, 2, 21]. The consistency regularization learns by enforcing consistency in the prediction of the model under different perturbations. On the other hand, entropy minimization learns by reducing the entropy in the prediction of the model on the unlabelled data. One of", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data", + "bbox": [ + 310, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "the most prominent methods in this category is FixMatch [21]. The basic concept of FixMatch is to predict the pseudo-label for the unlabelled data from a weakly augmentation of the input and then utilize this as the supervision for a strongly augmented sample if the confidence of the pseudo-label is high. One main issue with this approach is its reliance on the quality of the pseudo-labels. Also, the fixed thresholding nature results in very low utilization of the unlabelled data as the low confidence prediction does not contribute towards the learning process. Recently, several methods have been proposed to increase the utilization of the unlabelled data by proposing variants of the thresholding concept, including Dash [27], FlexMatch [28], CoMatch [15], SimMatch [29], ConMatch [13].", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Dash [27] selects unlabelled samples based on a criterion where their cross-entropy loss is smaller than an adjustable threshold value. FlexMatch [28] is another popular work that utilizes curriculum learning to adapt the threshold value, taking into account the class-wise learning status. This dynamic threshold is then applied to select pseudo-labels with high confidence. CoMatch [15] introduces a co-training framework that involves the interaction between class probabilities and embeddings. The embeddings impose a smoothness constraint on class probabilities to enhance the quality of pseudo-labels. These refined pseudo-labels are used as targets for training both the classification head with cross-entropy loss and the projection head with a graph-based contrastive loss. SimMatch [29] adeptly aligns similarity relationships at dual levels, utilizing a memory buffer for annotated examples to amplify the synergy between semantic and instance pseudo-labels. ConMatch [13] elevates model efficacy through the integration of confidence-guided consistency regularization. This approach tackles the hurdle of learning from a restricted pool of labelled data by promoting consistent predictions on unlabelled data, all the while taking into account the confidence levels associated with those predictions. SequenceMatch [17] enhances semi-supervised learning by minimizing prediction distribution divergence between weakly and strongly augmented examples. It underscores the significance of diverse augmentations and consistency constraints in the learning process. CHMatch [24] integrates instance-level prediction matching and contrastive graph-level matching through the use of a memory-bank-based adaptive threshold strategy. It employs hierarchical label-guided graph matching to enhance contrastive feature learning, providing a more robust approach to feature representation. While semi-supervised methods exhibit promising performance in the image domain, a notable gap exists in the SSL literature for point clouds, particularly in the context of classification tasks.", + "bbox": [ + 212, + 297, + 787, + 705 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Semi-supervised Learning in Point Cloud", + "text_level": 1, + "bbox": [ + 215, + 724, + 602, + 742 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Semi-supervised learning has recently been explored by a few prior works on the 3D point cloud classification. For example, [4] introduces a semi-supervised learning framework, leveraging consistency constraints to ensure uniform predictions on both original and perturbed point clouds. This approach mitigates overfitting the limited labelled data available. Moreover, it incorporates pseudo-label generation to provide high-quality labels for unlabelled point clouds, thereby enhancing", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "ing the supervision of the discriminative model. On the other hand, [7] presents a multi-modal semi-supervised learning framework featuring an instance-level consistency constraint and a multi-modal contrastive prototype (M2CP) loss. M2CP works towards minimizing intra-class feature variations by optimizing the distance to class prototypes for each object. ConFid [8] is another prominent work that specifically addresses class-imbalanced data scenarios, which is a prevalent challenge in the context of point clouds. ConFid takes into account class-level confidence through a resampling strategy designed to prevent bias towards high-confident classes. Nevertheless, all existing methods fall short of fully harnessing the potential of unlabeled data. This suggests a potential research gap in the realm of SSL-based 3D classification that maximizes the utilization of all available unlabeled data.", + "bbox": [ + 212, + 146, + 787, + 327 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 351, + 330, + 367 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Preliminaries on SSL", + "text_level": 1, + "bbox": [ + 215, + 383, + 437, + 398 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Semi-supervised methods learn from a small amount of labelled data and a relatively large amount of unlabeled data in supervised and unsupervised settings, respectively. Let, $X_{lb} = (x_i,y_i)_{i=1}^n$ and $X_{ulb} = (x_i)_{i=1}^N$ represent the labelled and unlabeled sets with $n \\ll N$ . Here, $x_i \\in \\mathcal{R}^{m \\times 3}$ represents a 3D point cloud with $m$ points, and $y_i$ is the corresponding class label. Consequently, the semi-supervised learning can be formulated as:", + "bbox": [ + 212, + 407, + 787, + 500 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\min _ {\\theta} \\left[ \\sum_ {\\left(x _ {i}, y _ {i}\\right) \\in X _ {l b}} \\mathcal {L} _ {s u p} \\left(x _ {i}, y _ {i}, \\theta\\right) + \\omega \\sum_ {x _ {i} \\in X _ {u l b}} \\mathcal {L} _ {u n s u p} \\left(x _ {i}, \\theta\\right) \\right], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 305, + 511, + 785, + 545 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Here, $\\theta$ represents the learnable parameters, $\\mathcal{L}_{sup}$ and $\\mathcal{L}_{unsup}$ are supervised loss (cross-entropy loss, $H(x_{i},y_{i})$ ) and unsupervised loss. $\\omega$ is the weight that balances the importance of the unsupervised loss.", + "bbox": [ + 212, + 551, + 787, + 595 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Unsupervised learning is the key component of semi-supervised learning, exhibiting variations across different SSL methods. Consistency regularization is one of the common unsupervised losses that is learned by forcing the predictions of the same sample to be consistent under different perturbations (augments) [1,2,20]. Another popular form of unsupervised learning is entropy minimization [21, 28], which learns from the unlabeled data by predicting a pseudo-label for each sample. Our method is built over the entropy minimization concept from FixMatch [21]. More specifically, FixMatch first generates a class prediction for an unlabeled sample from a weakly augmentation of the sample and considers it as a pseudo-label if the confidence of the prediction is above a pre-defined threshold. Finally, these high-confident pseudo-labels are used as supervision for a strong augmentation of the sample.", + "bbox": [ + 212, + 595, + 787, + 777 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Let, $x_w^{(i)} = \\phi(x_{ulb}^i)$ and $x_s = \\omega(x_{ulb}^i)$ be the weakly augmented and strongly augmented samples, and $p_m(p_z(x))$ be the output of the model, where, $p_z$ is the encoder and $p_m$ is the classifier. The unsupervised loss of FixMatch can be defined as follows:", + "bbox": [ + 212, + 777, + 787, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data", + "bbox": [ + 310, + 114, + 732, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {u n s u p} = \\frac {1}{\\mu B} \\sum_ {b = 1} ^ {\\mu B} \\mathbb {1} \\left(m a x \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right) \\geq \\tau\\right).\n$$\n", + "text_format": "latex", + "bbox": [ + 343, + 167, + 658, + 207 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nH \\left(\\operatorname {a r g m a x} \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right), p _ {m} \\left(p _ {z} \\left(x _ {s} ^ {(i)}\\right)\\right)\\right), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 210, + 784, + 229 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\tau$ is the fixed confidence threshold, $\\mu$ is the ratio of unlabelled to labelled batch size, $B$ is the batch size and $H$ represents the cross-entropy loss function.", + "bbox": [ + 212, + 234, + 782, + 265 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Nevertheless, a fixed (high) threshold results in under-utilization of the unlabeled data as the model does not utilize the low-confident samples. To address this, FlexMatch [28] and ConFid [8] propose dynamic pseudo labelling to adjust the threshold value considering the class-wise learning status by curriculum learning. In this context, the learning status refers to the ratio of predicted labels to the target label of a class. Specifically, the threshold value is low for high learning status classes to encourage the learning process, and vice-versa. Yet, the model does not utilize all the available unlabeled samples. Following, we describe our proposed solution, AllMatch, which effectively utilizes all the unlabeled samples for learning.", + "bbox": [ + 212, + 266, + 784, + 417 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 AllMatch", + "text_level": 1, + "bbox": [ + 215, + 435, + 339, + 450 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "AllMatch consists of three components, all aimed towards improving the utilization of the unlabelled data: adaptive hard augmentation, inverse learning and contrastive learning. Following, we discuss each of the components in detail.", + "bbox": [ + 212, + 457, + 782, + 503 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Adaptive hard augmentation (AHA). One limitation of the high confidence-based thresholding method is that the selected (highly confident) samples are already well learned by the model [9]. As a result, the loss for these samples is very low and, therefore, does not contribute towards the learning of the model. Following [9], we refer to these high-confident samples as easy samples and propose an adaptive hard augmentation (AHA) module to further utilize the easy samples. The basic idea is to apply relatively hard augmentations on the easy samples to introduce further regularization while applying the usual strong augmentations for the remaining samples. Note that the alternation between extra hard augmentation and strong augmentation plays a crucial role, as excess augmentation can potentially have a detrimental effect on the model. While the role of hard augmentation is extensively studied in the image semi-supervised learning literature [9], it's not well explored in 3D point clouds.", + "bbox": [ + 212, + 521, + 784, + 717 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We define the easy samples based on a historical loss computed until the current epoch $t$ . More specifically, we calculate the historical loss for the $i - th$ sample as the exponential moving average (EMA):", + "bbox": [ + 212, + 718, + 782, + 763 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {H} _ {i} ^ {t} = (1 - \\kappa) \\cdot \\mathcal {H} _ {i} ^ {t - 1} + \\kappa \\cdot l _ {i} ^ {t}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 403, + 770, + 784, + 787 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where, $l_i^t$ is computed as:", + "bbox": [ + 215, + 794, + 398, + 810 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nl _ {i} ^ {t} = H \\left(\\operatorname {a r g m a x} \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right), p _ {m} \\left(p _ {z} \\left(x _ {s} ^ {(i)}\\right)\\right)\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 339, + 823, + 784, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The lower historical loss for sample $i$ indicates an easy sample on which we apply additional hard augmentations. To divide the samples into easy and hard samples based on the historic loss, we utilize the OTSU [18] function that returns a binary indicator $\\mathcal{T}_i$ for each sample. Here, $\\mathcal{T}_i = 0$ indicates easy sample, and $\\mathcal{T}_i = 1$ indicates hard sample. Finally, for an easy sample, we apply a series of transformations to act as hard augmentation, including random scaling, rotation, translation and jitters. The AHA module can be represented as:", + "bbox": [ + 214, + 146, + 787, + 252 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nA u g m e n t e d \\operatorname {s a m p l e} \\left(x _ {i}\\right) = \\left\\{ \\begin{array}{l} \\mathcal {K} \\left(x _ {i}\\right), \\mathcal {T} _ {i} = 1 \\\\ \\mathcal {K} ^ {\\prime} \\left(x _ {i}\\right), \\mathcal {T} _ {i} = 0, \\end{array} \\right. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 346, + 263, + 785, + 296 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Here, $\\mathcal{K}'(x_i)$ represents the extra hard augmentation, while $\\mathcal{K}(x_i)$ represents hard augmentation. In the implementation, we start applying the AHA module after certain epochs of training, defined by 'warm-up epochs.' Since the loss is relatively high for all samples at the start of training, adding the AHA from the start of training does not add any benefit.", + "bbox": [ + 214, + 300, + 787, + 376 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Inverse learning. Another challenge in pseudo-labeling-based semi-supervised learning comes from the ambiguity in the predictions of the models. More specifically, the samples with low confidence (high ambiguity) are discarded by the pseudo-labeling concept. These low-confident samples do not contribute to the model's learning process, as pseudo-labels cannot be assigned to them. Consequently, a significant number of unlabelled samples go unused. However, these neglected unlabelled samples can be re-purposed to optimize the model inversely by learning what not to learn.", + "bbox": [ + 212, + 396, + 787, + 516 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As demonstrated in [6] for SSL in the image domain, after a certain number of training iterations, the correct classes are situated in one of the top-k predictions (i.e., the $k$ classes with the highest predicted probabilities) of the model. In essence, the model is extremely confident in its predictions for containing the right class in one of these top-k classes. Therefore, it is advantageous to treat the remaining classes (those outside the top-k predictions) as wrong class for the input. Motivated by [6], we incorporate inverse learning, which learns to avoid predicting such classes.", + "bbox": [ + 212, + 517, + 787, + 637 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For Inverse learning, following the convention of FixMatch, we first predict a pseudo-label from a weakly augmented sample and find the value of $k$ for which the model achieves 100% accuracy on the strongly augmented samples at the current epoch. Then, we sort the classes in order of highest to lowest confidence using a ranking function, Rank. Finally, for the classes with $\\text{Rank} > k$ we perform inverse learning on the strongly augmented samples as:", + "bbox": [ + 212, + 638, + 787, + 729 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {i n v} = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\sum_ {c = 1} ^ {C} \\mathbb {1} [ R a n k (p _ {m} (p _ {z} (x _ {w} ^ {(i)}))) > k ] \\cdot \\log (1 - p _ {m} (p _ {z} (x _ {s} ^ {(i)}))), \\quad (6)\n$$\n", + "text_format": "latex", + "bbox": [ + 238, + 750, + 785, + 791 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Contrastive learning (CL). While the AHA and inverse learning module increase the utilization of the unlabeled data, the samples that are neither very", + "bbox": [ + 214, + 809, + 785, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data", + "bbox": [ + 310, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "high-confident nor very low-confident are not utilized by any of the above modules. To ensure learning from the remainder of the sample, we incorporate a contrastive loss on the unlabelled set that learns from all the samples in an unsupervised setting. Contrastive methods learn from positive and negative samples, with the aim of pushing the positive pairs closer in the embedding space and moving them away from the negative sample. In this context, positive samples are the perturbation of the same sample, while all other samples are considered negative. Contrastive learning has shown remarkable success in learning representation in different computer vision domains [5,11,20]. Since contrastive learning does not require labels, it ensures total usage of unlabelled data.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For each unlabelled sample, $x_{ulb}^{(i)} \\in X_{ulb}$ , a weak perturbation $\\phi$ and a strong perturbation $\\omega$ is applied to generate a positive pair. In our case, we apply rotation and random scale as weak augmentation, and for strong augmentation, a couple of different augmentations (e.g. jitter, translation, rotation, random scale) are randomly applied. The augmented samples are then fed to the encoder and projection head that generates the embedding $z_{i} = p_{z}(y|x_{ulb_{i}})$ , where $[z_{w_i},z_{s_i}] \\in z_i$ . Finally, the unsupervised contrastive loss [5] function can be described as:", + "bbox": [ + 212, + 297, + 787, + 407 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {c o n} = - \\frac {1}{2 B} \\sum_ {i = 1} ^ {2 B} \\log \\frac {\\exp \\left(z _ {i} , z _ {\\kappa (i)} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 B} \\mathbb {1} _ {[ k \\neq i ]} \\exp \\left(z _ {i} , z _ {k} / \\tau\\right)}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 334, + 417, + 785, + 457 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where, $\\kappa (i)$ is the index of the second augmented sample, $\\mathbb{1}_{[k\\neq i]}$ is an indicator function which returns 1 when $k$ is not equal to $i$ , and 0 otherwise. $\\tau$ is a temperature parameter. Note that the pair samples are the same as the ones used for the unsupervised loss mentioned above. So, the contrastive loss does not increase the computational complexity.", + "bbox": [ + 212, + 463, + 787, + 537 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Additionally, we utilize a modified supervised version of contrastive loss (supervised contrastive loss [12]) on the labelled set. Like the unsupervised contrastive loss, the supervised contrastive loss learns from the augmented positive and negative samples. However, the additional label information benefits the model by pushing together samples that belong to the same class. The supervised contrastive loss can be formulated as follows:", + "bbox": [ + 212, + 539, + 787, + 628 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {s u p c o n} = \\sum_ {i = 1} ^ {2 B} - \\frac {1}{2 B _ {y _ {i}} - 1} \\sum_ {j = 1} ^ {2 B} \\mathbb {1} _ {[ i \\neq j ]} \\cdot \\mathbb {1} _ {[ y _ {i} = y _ {j} ]} \\cdot \\log \\frac {\\exp (z _ {i} , z _ {j} / \\tau)}{\\sum_ {k = 1} ^ {2 B} \\mathbb {1} _ {[ k \\neq i ]} \\exp (z _ {i} , z _ {k} / \\tau)}, \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 225, + 652, + 785, + 696 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where, $y_{i}$ represents class label of sample $i$ . $\\mathbb{1}_{[y_i = y_j]}$ is an indicator function that returns 1 when the samples $i$ and $j$ belongs to same class label. $2B_{y_i} - 1$ represents number of positive samples from class $y_{i}$ .", + "bbox": [ + 212, + 705, + 787, + 751 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Total Loss", + "text_level": 1, + "bbox": [ + 214, + 772, + 346, + 786 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Finally, the total loss of AllMatch is the sum of all the described above:", + "bbox": [ + 214, + 797, + 732, + 811 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {\\text {s u p}} + \\mathcal {L} _ {\\text {u n s u p}} + \\alpha \\cdot \\mathcal {L} _ {\\text {s u p c o n}} + \\beta \\cdot \\mathcal {L} _ {\\text {c o n}} + \\gamma \\cdot \\mathcal {L} _ {\\text {i n v}}, \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 313, + 825, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 7 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1: AllMatch Algorithm" + ], + "code_body": "Input: Labelled batch $\\mathcal{B}_l = \\{(x_i,y_i)\\}^M$ , unlabelled batch $\\mathcal{B}_u = \\{u_i\\} ^N$ \n1 Apply AHA to $\\mathcal{B}_l$ as Eq. 5 \n2 $l_{sup} = \\mathcal{L}_{sup}(\\mathcal{B}_l)$ \n3 $l_{unsup} = \\mathcal{L}_{unsup}(\\mathcal{B}_u)$ // via Eq. 2 \n4 $l_{con} = \\mathcal{L}_{con}(\\mathcal{B}_u)$ // via Eq. 7 \n5 $l_{supcon} = \\mathcal{L}_{supcon}(\\mathcal{B}_l)$ // via Eq. 8 \n6 for $i\\gets 1$ to $N$ do \n7 Compute the rank using, $\\operatorname {Rank}\\big(p_m(p_z(x_w^{(i)}))$ for $c\\gets 1$ to $C$ do \n8 if $\\operatorname {Rank}\\big(p_m(p_z(x_w^{(i)}))\\big) > k$ then \n9 $l_{inv} + = \\log \\left(1 - p_m(p_z(x_s^{(i)}))\\right)$ \n10 end \n11 end \n12 Compute and update historical loss, $\\mathcal{H}_i / /$ via Eq. 3 \n13 Update mark $\\tau_{i} = \\mathbb{1}(\\mathcal{H}_{i}\\leq 0\\mathrm{TSU}(H_{i}))$ \n14 end \n15 $l_{total} = l_{sup} + l_{unsup} + \\alpha \\cdot l_{supcon} + \\beta \\cdot l_{con} + \\gamma \\cdot l_{inv}$", + "bbox": [ + 217, + 166, + 787, + 404 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Here, $\\alpha, \\beta$ and $\\gamma$ are loss factors balancing the importance of each loss. We find optimal values of each factor from the empirical study described in Section 4.5.", + "bbox": [ + 212, + 435, + 784, + 465 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 489, + 374, + 507 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section, we discuss the experimental results of our study on the ModelNet40 and ScanobjectNN datasets. First, we discuss the main result, followed by an in-depth ablation study of our proposed modules and sensitivity analysis of different module-specific parameters.", + "bbox": [ + 212, + 520, + 784, + 580 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Implementation Details", + "text_level": 1, + "bbox": [ + 215, + 603, + 455, + 618 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23]. For the implementation details and hyper-parameters, we nearly follow the existing SOTA, ConFid [8], for a fair comparison. We use PointTransformer [10] as the encoder. We train the model with SGD optimizer with a learning rate of 0.00005 for 350 epochs. The unlabelled to labelled batch size ratio is 4, and the labelled batch size is 24. We utilize rotation and random scale as weak augmentation and random scaling, rotation, translation and jitter as strong augmentation. Note that, as a geometric entity, the underline representation of the point clouds must remain invariant under specific transformations [19]. Thus, we only chose the augmentation methods that do not violate this special property of the point clouds. For the AHA module, various combinations of strong augmentation are applied as an additional hard augmentation to the easy samples. A detailed sensitivity analysis on the augmentation strength is discussed in Section 4.5.", + "bbox": [ + 212, + 628, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data", + "bbox": [ + 310, + 113, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/01be1822bfcc2b82bd3f75b377aa30cd086c20e607b11408ddeb021ff37dacb9.jpg", + "table_caption": [ + "Table 1: Comparison of AllMatch with the SOTA methods in 3D object classification task on ModelNet40 dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy." + ], + "table_footnote": [], + "table_body": "
Method2%5%10%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]71.161.077.169.284.677.2
PL [14]69.759.678.369.085.177.7
Flex-PL [28]66.754.974.262.383.270.3
ConFid-PL [8]74.461.980.673.586.580.4
FixMatch [21]70.862.778.971.185.579.4
Dash [27]71.563.079.771.885.980.1
FlexMatch [28]70.161.280.570.486.278.7
ConFid-Match [8]73.864.182.174.387.882.5
AllMatch84.382.689.087.990.289.8
", + "bbox": [ + 256, + 218, + 746, + 390 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Main Result", + "text_level": 1, + "bbox": [ + 215, + 417, + 364, + 431 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The overall comparison to the previous works is presented in Tables 1 and 2 for ModelNet-40 and ScanObjectNN datasets, respectively. Here, PL [14], FixMatch [21], Dash [27], and FlexMatch [28] were initially proposed for the image domain and later adopted to the PointCloud, whereas ConFid [8] is specifically designed for the point cloud. The results for other prior works are directly adopted from the reported results in ConFid [8]. Following the experimental setups of previous literature on this task, we report the results for different amounts of labelled samples. More specifically, we evaluate the performance on three different sizes of labelled sets: $2\\%$ , $5\\%$ , and $10\\%$ for the ModelNet40 dataset and $1\\%$ , $2\\%$ , and $5\\%$ for the ScanObjectNN dataset. We report the overall accuracy and the mean of class-wise accuracy (mean accuracy) on the test set.", + "bbox": [ + 212, + 441, + 787, + 609 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "As we observe from these tables, AllMatch outperforms SOTA by a significant margin across all sizes of unlabelled sets, demonstrating substantial improvement. For example, with only $2\\%$ labelled data from ModelNet40 (Table 1), AllMatch outperforms ConFid by a notable $10.48\\%$ and $18.52\\%$ in overall and mean accuracy. While we also see considerable improvements for $5\\%$ and $10\\%$ data, the biggest improvement is observed when the least amount of labelled data $(2\\%)$ is utilized. This indicates the effectiveness of AllMatch in learning from a very small amount of labelled data.", + "bbox": [ + 212, + 609, + 787, + 729 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Table 2 illustrates a similar on the ScanObjectNN dataset. With only $1\\%$ of the labelled set, AllMatch outperforms the SOTA by a superior $11.20\\%$ on overall accuracy and $14.67\\%$ on mean accuracy. The maximum performance gain is again observed for the least amount of labelled samples.", + "bbox": [ + 212, + 729, + 787, + 791 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/21d6be4d1037a93702607d063cc4806e99174a7d5c49bef6e998da67ca362230.jpg", + "table_caption": [ + "Table 2: Comparison of AllMatch with the SOTA methods in 3D object classification task on ScanObjectNN dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy." + ], + "table_footnote": [], + "table_body": "
Method1%2%5%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]32.126.144.736.556.650.0
PL [14]31.225.847.538.658.151.5
Flex-PL [28]29.224.247.237.660.151.9
Confid-PL [8]32.627.148.841.563.155.2
FixMatch [21]33.527.647.439.959.452.4
Dash [27]35.129.350.344.162.860.3
FlexMatch [28]34.226.248.539.763.457.2
ConFid-Match [8]38.232.757.048.669.465.5
AllMatch49.447.460.858.977.576.0
", + "bbox": [ + 256, + 218, + 746, + 390 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 416, + 388, + 431 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In this section, we perform a detailed ablation study to understand the importance of different components in our proposed method. We start with the main ablation on the 3 main components of AllMatch, then perform another ablation on the contrastive learning approach.", + "bbox": [ + 212, + 440, + 560, + 531 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Main ablation. Table 3 presents the results for the main ablation study. Here, we ablate all the combinations of the three main components of", + "bbox": [ + 212, + 551, + 560, + 595 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "AllMatch: adaptive hard augmentation (AHA), inverse learning and contrastive learning (CL). First, we drop these modules individually and then in groups to investigate their significance on overall performance. We perform this study with $2\\%$ of the labelled data and report the overall accuracy (OA).", + "bbox": [ + 212, + 598, + 785, + 657 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "As we observe from this table, when we drop the AHA module individually, the method's performance declines by $4.29\\%$ . This is considerably higher than the drops observed by dropping inverse learning or contrastive loss, making AHA the most important module in AllMatch. We find the inverse learning to be the second most important component, removing which results in a $3.77\\%$ drop in accuracy. Finally, we find that contrastive learning also plays a critical role. Removing the contrastive learning also results in a $1.34\\%$ drop in accuracy. We find similar trends when two modules are removed at a time. We observe a performance drop of $6.37\\%$ when we remove both the AHA and inverse learning modules. Similarly, removing the AHA and contrastive learning module results in a $4.9\\%$ decline in AllMatch's performance. The least accuracy we find by utilizing a single component is $77.9\\%$ with contrastive learning. Finally, we find", + "bbox": [ + 212, + 659, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/0dfd592887a803125dfe46083bcda1866f594afa795fc786bd128790094447af.jpg", + "table_caption": [ + "Table 3: Ablation study of different proposed components of AllMatch on ModelNet40." + ], + "table_footnote": [], + "table_body": "
Inv. lear.AHACLOA
✓✓✓84.28
✓✓82.94
✓✓79.98
✓✓80.50
✓77.90
✓79.37
✓80.10
74.80
", + "bbox": [ + 573, + 488, + 787, + 584 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data", + "bbox": [ + 310, + 113, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "that removing all components drastically drops the performance by $74.8\\%$ . This further shows the importance of each of the components in AllMatch.", + "bbox": [ + 212, + 146, + 787, + 176 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation on contrastive learning. Next, we perform another study on our contrastive learning module, which consists of supervised and self-supervised contrastive loss. Here, we perform another ablation study by removing the contrastive learning components in different combinations. Similar to the previous study, we do this study on $2\\%$ of labelled data from ModelNet40. The results of this study are presented in Table 4. As we find from this table, removing both of the components results in", + "bbox": [ + 212, + 199, + 584, + 349 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/a7f5bbe7557b603f0a3bce8c5197e559e514764a087c41e46346b5f4fbfda3ac.jpg", + "table_caption": [ + "Table 4: Ablation study of contrastive loss components of AllMatch on ModelNet40 dataset." + ], + "table_footnote": [], + "table_body": "
Sup.Unsup.OA
✓✓84.28
✓83.47
✓83.06
82.94
", + "bbox": [ + 612, + 280, + 764, + 334 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "a considerable drop in performance, with unsupervised contrastive loss having a greater impact on the final performance. More specifically, when both the supervised and unsupervised contrastive losses are employed, AllMatch achieves its highest performance, $84.28\\%$ . By dropping the unsupervised contrastive loss, the method's overall accuracy drops sharply by $1.21\\%$ . However, when the supervised loss is removed, the overall accuracy declines by $0.8\\%$ . This proves AllMatch is gaining better learning signals from the unsupervised contrastive loss component. Finally, when both contrastive losses are removed, AllMatch returns with AHA and inverse learning setting with an overall loss of $82.94\\%$ .", + "bbox": [ + 212, + 351, + 787, + 488 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 Performance on Increased Labelled Set Size", + "text_level": 1, + "bbox": [ + 214, + 508, + 624, + 523 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In this section, we study the performance of different amounts of labelled data. Specifically, we investigate how an increase in the amount of labelled data impacts performance. To this end, we increase the labelled set size to all labelled data with a $10\\%$ interval (Figure 3). It is evident that when only a small amount of labelled data is available $(2\\% -5\\%)$ , the overall accuracy of AllMatch is relatively low and gradually increases until it reaches $10\\%$ of the labelled set. With $10\\%$ labelled data, the overall accuracy reaches $90.19\\%$ , compared to $90.75\\%$ with the whole labelled set. In other words, the performance with $10\\%$ of labelled samples", + "bbox": [ + 212, + 535, + 602, + 715 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "is almost close to the performance with $100\\%$ of the labelled data. This again proves the fact that AllMatch properly utilizes all the unlabelled data, making it possible for $10\\%$ labelled data to reach such performance.", + "bbox": [ + 212, + 715, + 785, + 762 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/12b3d971477273c9c8eff240fe2cfea610cb1d21af7ab24116f18d37429db2de.jpg", + "image_caption": [ + "Fig. 3: Impact of labelled set size." + ], + "image_footnote": [], + "bbox": [ + 620, + 546, + 777, + 667 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Sensitivity Study", + "text_level": 1, + "bbox": [ + 214, + 782, + 406, + 800 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In this section, we perform detailed sensitivity studies on different parameters of the AllMatch. Following, We discuss the details of these experiments.", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/f61fff8535b6de3dcd083e70a22fddf185964423a9e34ff53b5745e2f7197296.jpg", + "table_caption": [ + "Table 5: Impact of different values of loss factors." + ], + "table_footnote": [ + "(a) $\\alpha$ vs acc." + ], + "table_body": "
αOverall accuracy
0.284.28
0.583.38
1.081.96
", + "bbox": [ + 236, + 170, + 377, + 241 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/9db5b2cf6efae7497d3def6e896024f60ad333d7115ae9619dd3770b03a0dd65.jpg", + "table_caption": [], + "table_footnote": [ + "(b) $\\beta$ vs acc." + ], + "table_body": "
βOverall accuracy
0.284.28
0.583.46
1.081.24
", + "bbox": [ + 433, + 170, + 573, + 241 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/df02bd7ff871ddec038d4122b6aeb1e2db2a82e8e5003c2382b4534e012e8cc6.jpg", + "table_caption": [], + "table_footnote": [ + "(c) $\\gamma$ vs acc." + ], + "table_body": "
γOverall accuracy
0.283.22
0.583.38
1.084.28
", + "bbox": [ + 630, + 170, + 769, + 241 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Loss factor. The final loss function for training AllMatch consists of multiple losses and includes weight factors to balance the impact of individual loss components. Table 5 illustrates the influence of different loss factors on AllMatch's overall performance. The experiments are conducted on the ModelNet40 dataset with $2\\%$ of labelled data. It is observed that the overall accuracy of AllMatch is sensitive to the values of these factors. Specifically, lower loss factor values lead to higher performances for both supervised and unsupervised contrastive losses, while higher values for the inverse loss factor prove beneficial. This indicates that the inverse loss plays a more significant role in contributing to AllMatch's performance compared to the contrastive loss.", + "bbox": [ + 212, + 258, + 787, + 411 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Augmentation strength. Augmentation strength is an essential hyperparameter for the Adaptive Hard Augmentation (AHA) module of AllMatch. It indicates the combination of different types of augmentation randomly applied as an additional hard augmentation to the easy samples. In Figure 4, we evaluate the overall performance of AllMatch for different augmentation strengths ranging from 4 to 8. Here, the numbers represent the total number of transformations applied to a sample. As we find from Figure 4, the best result is observed for using 4 transformations. While the augmentations are essential for learning from easy samples, applying a very high number of augmentations makes the optimization of the model difficult.", + "bbox": [ + 212, + 436, + 602, + 648 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/bee5edd3e26872c94ded6b0339cf8d5906d8c325c288a476b088042b900b9207.jpg", + "image_caption": [ + "Fig. 4: Sensitivity study on the augmentation strengths." + ], + "image_footnote": [], + "bbox": [ + 620, + 448, + 779, + 569 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Warm-up epoch for AHA. As discussed in the method section, the AHA module comes into effect after a certain epoch of training. Given that AHA introduces an additional hard augmentation to easy samples, the downstream task becomes challenging for the model. If AHA is applied right at the beginning of the training process, it can negatively impact the model's performance. To this end, warm-up epochs enable the model to learn representations from all samples efficiently during the initial training. As depicted in Figure 5, AllMatch shows superior performance when", + "bbox": [ + 212, + 672, + 602, + 840 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/19767728cb121eb7d24a2fe433b0da72e446c29c8388fbfe28b2311e39f7660f.jpg", + "image_caption": [ + "Fig.5: Sensitivity study on the impact of different warm-up epochs." + ], + "image_footnote": [], + "bbox": [ + 620, + 667, + 777, + 787 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data", + "bbox": [ + 310, + 113, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "warmed up for 50 epochs. However, prolonged warm-up periods diminish performance, as they reduce the effective action period of AHA.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Epoch and learning rate. Finally, we study two hyper-parameters that are important for the optimization of the model, epochs and learning rate. As depicted in Figure 6a, we observe that AllMatch's performance improves by increasing the number of epochs, reaching its peak at 350 epochs with a best performance of $84.28\\%$ . However, extending the num", + "bbox": [ + 212, + 199, + 486, + 349 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/7abb9ce8c59840611ab6cf534f02f417bd8fd82d4529a10bd931010b454cf87f.jpg", + "image_caption": [ + "(a) Epochh vs Acc.", + "Fig.6: Sensitivity study of epoch and learning rate on ModelNet40." + ], + "image_footnote": [], + "bbox": [ + 498, + 198, + 633, + 301 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/4bfdc45e5abac01d82daf2e30ec491c898dbd5d07e0c502297499ecd0bbab700.jpg", + "image_caption": [ + "(b) LR vs Acc." + ], + "image_footnote": [], + "bbox": [ + 643, + 198, + 779, + 301 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "ber of epochs beyond this point results in a decline in performance. This is considerably lower than the previous SOTA, which requires 500 epochs of training. This further shows the benefit of utilizing the unlabelled data properly. In Figure 6b, we analyze the impact of different learning rates on AllMatch's performance. Notably, lower learning rates contribute to improved performance, whereas higher values lead to a collapse in the model's performance. For instance, at a learning rate of 0.0005, AllMatch achieves only $12\\%$ overall accuracy, emphasizing the sensitivity of the model's performance to the choice of learning rate.", + "bbox": [ + 212, + 349, + 787, + 470 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 494, + 359, + 510 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we identify that existing 3D semi-supervised techniques fail to capitalize the whole unlabelled data. To solve this issue, we introduce AllMatch, a novel semi-supervised method for point cloud classification that effectively utilizes the entire unlabelled set to improve the learnt representation. Comprised of adaptive hard augmentation, inverse learning, and contrastive learning components, AllMatch outperforms existing SOTA methods by a significant margin, showcasing superior performance even with minimal (1%) labelled sets. Remarkably, AllMatch, with just $10\\%$ of the labelled set, attains a performance close to the fully supervised learning with all samples, underscoring its efficiency in minimizing reliance on labelled data.", + "bbox": [ + 212, + 526, + 787, + 676 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations. While our proposed method has made significant improvement in efficiently leveraging the entire unlabelled set, there are still opportunities for further exploration in this promising direction. In the AHA module, we successfully incorporated selected transformation-invariant augmentation techniques, showcasing a positive step forward. Expanding our exploration to encompass a more diverse range of augmentation methods could prove to be a fruitful avenue for additional advancements. Furthermore, we only explored contrastive learning as the self-supervised module to ensure the utilization of all unlabelled samples, leaving room for exploring different versions and alternatives of contrastive loss.", + "bbox": [ + 212, + 676, + 787, + 813 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution matching and augmentation anchoring. In: ICLR (2019)", + "2. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. NeurIPS (2019)", + "3. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality tradeoff in semi-supervised learning. In: ICLR (2022)", + "4. Chen, L., Zhang, Y., Lin, Y., Jiang, M., Huang, Y., Lei, Y.: Consistency-based semi-supervised learning for point cloud classification. In: PRAI. pp. 440-445 (2021)", + "5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)", + "6. Chen, Y., Tan, X., Zhao, B., Chen, Z., Song, R., Liang, J., Lu, X.: Boosting semi-supervised learning by exploiting all unlabeled data. In: CVPR. pp. 7548-7557 (2023)", + "7. Chen, Z., Jing, L.: Multimodal semi-supervised learning for 3d objects. In: BMVC (2021)", + "8. Chen, Z., Jing, L., Yang, L., Li, Y., Li, B.: Class-level confidence based 3d semi-supervised learning. In: WACV. pp. 633-642 (2023)", + "9. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: CVPR. pp. 15880-15889 (2023)", + "10. Guo, M.H., Cai, J.X., Liu, Z.N., Mu, T.J., Martin, R.R., Hu, S.M.: Pct: Point cloud transformer. Computational Visual Media 7, 187-199 (2021)", + "1. Jiang, L., Shi, S., Tian, Z., Lai, X., Liu, S., Fu, C.W., Jia, J.: Guided point contrastive learning for semi-supervised point cloud semantic segmentation. In: ICCV. pp. 6423-6432 (2021)", + "2. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS pp. 18661-18673 (2020)", + "3. Kim, J., Min, Y., Kim, D., Lee, G., Seo, J., Ryoo, K., Kim, S.: Conmatch: Semi-supervised learning with confidence-guided consistency regularization. In: ECCV. pp. 674-690 (2022)", + "4. Lee, D.H., et al.: Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks. In: Workshop on challenges in representation learning, ICML. p. 896 (2013)", + "5. Li, J., Xiong, C., Hoi, S.C.: Comatch: Semi-supervised learning with contrastive graph regularization. In: ICCV. pp. 9475-9484 (2021)", + "6. Liu, F., Lin, G., Foo, C.S., Joshi, C.K., Lin, J.: Point discriminative learning for data-efficient 3d point cloud analysis. In: IEEE Int. Conf. on 3D Vision. pp. 42-51 (2022)", + "7. Nguyen, K.B.: Sequencematch: Revisiting the design of weak-strong augmentations for semi-supervised learning. In: WACV. pp. 96-106 (2024)", + "8. Otsu, N.: A threshold selection method from gray-level histograms. TSMC 9, 62-66 (1979)", + "9. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: CVPR. pp. 652-660 (2017)" + ], + "bbox": [ + 225, + 178, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data", + "bbox": [ + 310, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "20. Roy, S., Etemad, A.: Scaling up semi-supervised learning with unconstrained unlabelled data. In: AAAI. pp. 14847-14856 (2024)", + "21. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. NeurIPS pp. 596-608 (2020)", + "22. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. In: NeurIPS. pp. 1195–1204 (2017)", + "23. Uy, M.A., Pham, Q.H., Hua, B.S., Nguyen, D.T., Yeung, S.K.: Revisiting point cloud classification: A new benchmark dataset and classification model on real-world data. In: ICCV. pp. 1588-1597 (2019)", + "24. Wu, J., Yang, H., Gan, T., Ding, N., Jiang, F., Nie, L.: Chmatch: Contrastive hierarchical matching and robust adaptive threshold boosted semi-supervised learning. In: CVPR. pp. 15762-15772 (2023)", + "25. Wu, Z., Song, S., Khosla, A., Yu, F., Zhang, L., Tang, X., Xiao, J.: 3d shapenets: A deep representation for volumetric shapes. In: CVPR. pp. 1912-1920 (2015)", + "26. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. In: NeurIPS. pp. 6256-6268 (2020)", + "27. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: ICML. pp. 11525-11536 (2021)", + "28. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. NeurIPS pp. 18408-18419 (2021)", + "29. Zheng, M., You, S., Huang, L., Wang, F., Qian, C., Xu, C.: Simmatch: Semi-supervised learning with similarity matching. In: CVPR. pp. 14471-14481 (2022)" + ], + "bbox": [ + 215, + 147, + 784, + 494 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Paul et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_model.json b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_model.json new file mode 100644 index 0000000000000000000000000000000000000000..3d54580e4d5d4103f71f6d97008c79a2b26cd35d --- /dev/null +++ b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_model.json @@ -0,0 +1,2135 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.255, + 0.141, + 0.75, + 0.187 + ], + "angle": 0, + "content": "Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "text", + "bbox": [ + 0.312, + 0.213, + 0.687, + 0.228 + ], + "angle": 0, + "content": "Sneha Paul, Zachary Patterson, and Nizar Bouguila" + }, + { + "type": "text", + "bbox": [ + 0.31, + 0.24, + 0.692, + 0.255 + ], + "angle": 0, + "content": "Concordia Institute for Information Systems Engineering," + }, + { + "type": "text", + "bbox": [ + 0.368, + 0.256, + 0.636, + 0.269 + ], + "angle": 0, + "content": "Concordia University, Montreal, Canada" + }, + { + "type": "text", + "bbox": [ + 0.392, + 0.27, + 0.61, + 0.282 + ], + "angle": 0, + "content": "sneha.paul@mail.concordia.ca" + }, + { + "type": "text", + "bbox": [ + 0.321, + 0.284, + 0.682, + 0.296 + ], + "angle": 0, + "content": "{zachary.patterson,nizar.bouguila}@concordia.ca" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.336, + 0.74, + 0.655 + ], + "angle": 0, + "content": "Abstract. Semi-supervised learning (SSL) has shown its effectiveness in learning effective 3D representation from a small amount of labelled data while utilizing large unlabelled data. Traditional semi-supervised approaches rely on the fundamental concept of predicting pseudo-labels for unlabelled data and incorporating them into the learning process. However, we identify that the existing methods do not fully utilize all the unlabelled samples and consequently limit their potential performance. To address this issue, we propose AllMatch, a novel SSL-based 3D classification framework that effectively utilizes all the unlabelled samples. AllMatch comprises three modules: (1) an adaptive hard augmentation module that applies relatively hard augmentations to the high-confident unlabelled samples with lower loss values, thereby enhancing the contribution of such samples, (2) an inverse learning module that further improves the utilization of unlabelled data by learning what not to learn, and (3) a contrastive learning module that ensures learning from all the samples in both supervised and unsupervised settings. Comprehensive experiments on two popular 3D datasets demonstrate a performance improvement of up to \\(11.2\\%\\) with \\(1\\%\\) labelled data, surpassing the SOTA by a significant margin. Furthermore, AllMatch exhibits its efficiency in effectively leveraging all the unlabelled data, demonstrated by the fact that only \\(10\\%\\) of labelled data reaches nearly the same performance as fully-supervised learning with all labelled data. The code of our work is available at: github.com/snehaputul/AllMatch." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.669, + 0.696, + 0.684 + ], + "angle": 0, + "content": "Keywords: Semi-supervised Learning \\(\\cdot\\) Point Cloud \\(\\cdot\\) 3D Vision" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.71, + 0.375, + 0.725 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.734, + 0.555, + 0.84 + ], + "angle": 0, + "content": "In the realm of 3D computer vision, Point Cloud applications are on the rise, finding extensive use in diverse domains. This increasing popularity of Point Cloud applications across various 3D computer vision domains has heightened the demand for annotated data, a resource-intensive and expensive task [16]. To tackle this" + }, + { + "type": "image", + "bbox": [ + 0.568, + 0.695, + 0.787, + 0.82 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.566, + 0.832, + 0.785, + 0.86 + ], + "angle": 0, + "content": "Fig.1: Performance in comparison to unlabelled data usage." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.269 + ], + "angle": 0, + "content": "issue, 3D semi-supervised learning (SSL) emerges as a promising avenue. By capitalizing on scarce labelled data in conjunction with abundant unlabelled data, this approach has demonstrated its efficacy in different computer vision applications, including 3D object recognition. Most popular forms of SSL (e.g. [21], [28]) involve predicting pseudo-labels for the unlabelled data and using only the high-confident predictions for learning. However, due to the hand-designed nature of the high-confidence-based filtering, most of the unlabelled samples never contribute to the learning (Figure 1)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.276, + 0.489, + 0.531 + ], + "angle": 0, + "content": "Some of the more recent works propose different techniques to increase the number of unlabelled samples the model learns from. For example, FlexMatch [28] introduced a dynamic threshold strategy, where the threshold value is adjusted according to the model's learning status using curriculum learning. SoftMatch [3] proposed a trade-off between quality and quantity to increase unlabelled data usage. While there has been some progress in this direction, these methods are specially developed for the image domain and have not been explored in the context of 3D SSL. Furthermore, as shown in Figure" + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.287, + 0.63, + 0.394 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.642, + 0.287, + 0.764, + 0.394 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.497, + 0.399, + 0.788, + 0.524 + ], + "angle": 0, + "content": "Fig.2: (left) Pseudo label utilization over the training epochs by FixMatch and Confid. While ConFid does better utilization than FixMatch, none properly utilizes all unlabelled data. (right) Loss over training for high and low-confident pseudo-labels. The high-confident samples are selected for unsupervised learning, but low loss results in marginal contribution to learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.531, + 0.788, + 0.608 + ], + "angle": 0, + "content": "2 (left) for 3D SSL, FixMatch utilizes about \\(25\\%\\) of the unlabelled data, while the current state-of-the-art (SOTA) method, ConFid [8], utilizes about \\(76\\%\\) of the unlabelled data. Moreover, we find that the correctly predicted pseudo-labels do not contribute much towards the learning, as they have higher confidence in prediction and lower loss (Figure 2 (right))." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.789, + 0.842 + ], + "angle": 0, + "content": "In this work, we propose a novel semi-supervised framework named AllMatch that handles the above-mentioned problems and ensures learning from all the unlabeled data. AllMatch consists of three modules, all of which improve different aspects of increasing unlabeled data usage. While the concepts of these modules are not entirely new, they have never been explored in 3D SSL, especially with the focus on increasing the utilization of unlabeled data. The modules in AllMatch are: (a) An adaptive hard augmentation(AHA) module that increases the augmentation strength of the high-confident unlabeled samples with lower loss. This module ensures better utilization of high-confident samples that the model has already learned, thus leaving no further contribution to the model's learning process. (b) An inverse learning module that further ensures better utilization of unlabeled samples by assigning inverse pseudo labels to the low-confident predictions and learning what not to learn. (c) A contrastive learning (CL) module that learns from all the unlabeled data in unsupervised learning settings. This module ensures that the samples excluded from pseudo-label-based learning also" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.312, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "contribute to the learning process by participating in CL. Additionally, we utilize a modified supervised contrastive loss [12] for learning from the labelled data in a similar learning setting as the unlabelled data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.788, + 0.435 + ], + "angle": 0, + "content": "We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23], with different amounts of labelled sets. We compare AllMatch with the existing SSL methods and find that AllMatch outperforms the existing SOTA by up to \\(11.2\\%\\) and \\(10.45\\%\\) on ScanObjectNN and ModelNet40 datasets, respectively, with a minimal amount of labelled data. AllMatch also shows superior performance with a lower amount of labelled set, indicating its effectiveness in utilizing all unlabelled samples. With our proposed method, only \\(10\\%\\) of the labelled data performs almost as well as in a fully supervised setting with all the labelled data. Furthermore, our method is more computationally efficient than the previous SOTA, ConFid [8], which requires 500 epochs of training compared to 250 in ours. We also conduct an in-depth ablation study and sensitivity analysis demonstrating the importance of all three components for AllMatch's superior performance. Here, the AHA module shows the highest impact on the model's performance, followed by inverse learning and contrastive learning modules. Our main contributions to this work can be summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.446, + 0.784, + 0.488 + ], + "angle": 0, + "content": "- We propose a novel semi-supervised 3D classification framework named All-Match that effectively utilizes the whole unlabelled set to improve the performance." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.491, + 0.785, + 0.549 + ], + "angle": 0, + "content": "- We introduce an adaptive hard augmentation module that efficiently utilizes the higher-confident samples with lower loss and an inverse learning module to further boost the utilization of unlabelled samples by learning from low-confident predictions." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.551, + 0.784, + 0.594 + ], + "angle": 0, + "content": "- We introduce a contrastive learning module to ensure learning from the remainder of the unlabeled data that are not utilized by pseudo-label-based learning." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.596, + 0.784, + 0.655 + ], + "angle": 0, + "content": "- We improve the SOTA for 3D semi-supervised learning by \\(11.2\\%\\), and \\(10.45\\%\\) on the ScanobjectNN and ModelNet40 datasets, respectively. We also show that AllMatch achieves almost similar results in a fully-supervised setting with only \\(10\\%\\) of labelled data." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.446, + 0.785, + 0.655 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.679, + 0.388, + 0.695 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.71, + 0.476, + 0.726 + ], + "angle": 0, + "content": "2.1 Semi-supervised Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.841 + ], + "angle": 0, + "content": "There has been significant progress in semi-supervised learning in recent years, mostly for image representation learning. Most dominant approaches in semi-supervised learning can be divided into two main categories: consistency regularization [22, 26] and entropy minimization [1, 2, 21]. The consistency regularization learns by enforcing consistency in the prediction of the model under different perturbations. On the other hand, entropy minimization learns by reducing the entropy in the prediction of the model on the unlabelled data. One of" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "the most prominent methods in this category is FixMatch [21]. The basic concept of FixMatch is to predict the pseudo-label for the unlabelled data from a weakly augmentation of the input and then utilize this as the supervision for a strongly augmented sample if the confidence of the pseudo-label is high. One main issue with this approach is its reliance on the quality of the pseudo-labels. Also, the fixed thresholding nature results in very low utilization of the unlabelled data as the low confidence prediction does not contribute towards the learning process. Recently, several methods have been proposed to increase the utilization of the unlabelled data by proposing variants of the thresholding concept, including Dash [27], FlexMatch [28], CoMatch [15], SimMatch [29], ConMatch [13]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.788, + 0.706 + ], + "angle": 0, + "content": "Dash [27] selects unlabelled samples based on a criterion where their cross-entropy loss is smaller than an adjustable threshold value. FlexMatch [28] is another popular work that utilizes curriculum learning to adapt the threshold value, taking into account the class-wise learning status. This dynamic threshold is then applied to select pseudo-labels with high confidence. CoMatch [15] introduces a co-training framework that involves the interaction between class probabilities and embeddings. The embeddings impose a smoothness constraint on class probabilities to enhance the quality of pseudo-labels. These refined pseudo-labels are used as targets for training both the classification head with cross-entropy loss and the projection head with a graph-based contrastive loss. SimMatch [29] adeptly aligns similarity relationships at dual levels, utilizing a memory buffer for annotated examples to amplify the synergy between semantic and instance pseudo-labels. ConMatch [13] elevates model efficacy through the integration of confidence-guided consistency regularization. This approach tackles the hurdle of learning from a restricted pool of labelled data by promoting consistent predictions on unlabelled data, all the while taking into account the confidence levels associated with those predictions. SequenceMatch [17] enhances semi-supervised learning by minimizing prediction distribution divergence between weakly and strongly augmented examples. It underscores the significance of diverse augmentations and consistency constraints in the learning process. CHMatch [24] integrates instance-level prediction matching and contrastive graph-level matching through the use of a memory-bank-based adaptive threshold strategy. It employs hierarchical label-guided graph matching to enhance contrastive feature learning, providing a more robust approach to feature representation. While semi-supervised methods exhibit promising performance in the image domain, a notable gap exists in the SSL literature for point clouds, particularly in the context of classification tasks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.726, + 0.603, + 0.743 + ], + "angle": 0, + "content": "2.2 Semi-supervised Learning in Point Cloud" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Semi-supervised learning has recently been explored by a few prior works on the 3D point cloud classification. For example, [4] introduces a semi-supervised learning framework, leveraging consistency constraints to ensure uniform predictions on both original and perturbed point clouds. This approach mitigates overfitting the limited labelled data available. Moreover, it incorporates pseudo-label generation to provide high-quality labels for unlabelled point clouds, thereby enhancing" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.312, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.328 + ], + "angle": 0, + "content": "ing the supervision of the discriminative model. On the other hand, [7] presents a multi-modal semi-supervised learning framework featuring an instance-level consistency constraint and a multi-modal contrastive prototype (M2CP) loss. M2CP works towards minimizing intra-class feature variations by optimizing the distance to class prototypes for each object. ConFid [8] is another prominent work that specifically addresses class-imbalanced data scenarios, which is a prevalent challenge in the context of point clouds. ConFid takes into account class-level confidence through a resampling strategy designed to prevent bias towards high-confident classes. Nevertheless, all existing methods fall short of fully harnessing the potential of unlabeled data. This suggests a potential research gap in the realm of SSL-based 3D classification that maximizes the utilization of all available unlabeled data." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.352, + 0.331, + 0.368 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.384, + 0.438, + 0.399 + ], + "angle": 0, + "content": "3.1 Preliminaries on SSL" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.409, + 0.788, + 0.501 + ], + "angle": 0, + "content": "Semi-supervised methods learn from a small amount of labelled data and a relatively large amount of unlabeled data in supervised and unsupervised settings, respectively. Let, \\( X_{lb} = (x_i,y_i)_{i=1}^n \\) and \\( X_{ulb} = (x_i)_{i=1}^N \\) represent the labelled and unlabeled sets with \\( n \\ll N \\). Here, \\( x_i \\in \\mathcal{R}^{m \\times 3} \\) represents a 3D point cloud with \\( m \\) points, and \\( y_i \\) is the corresponding class label. Consequently, the semi-supervised learning can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.307, + 0.512, + 0.787, + 0.546 + ], + "angle": 0, + "content": "\\[\n\\min _ {\\theta} \\left[ \\sum_ {\\left(x _ {i}, y _ {i}\\right) \\in X _ {l b}} \\mathcal {L} _ {s u p} \\left(x _ {i}, y _ {i}, \\theta\\right) + \\omega \\sum_ {x _ {i} \\in X _ {u l b}} \\mathcal {L} _ {u n s u p} \\left(x _ {i}, \\theta\\right) \\right], \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.788, + 0.597 + ], + "angle": 0, + "content": "Here, \\(\\theta\\) represents the learnable parameters, \\(\\mathcal{L}_{sup}\\) and \\(\\mathcal{L}_{unsup}\\) are supervised loss (cross-entropy loss, \\(H(x_{i},y_{i})\\)) and unsupervised loss. \\(\\omega\\) is the weight that balances the importance of the unsupervised loss." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.788, + 0.779 + ], + "angle": 0, + "content": "Unsupervised learning is the key component of semi-supervised learning, exhibiting variations across different SSL methods. Consistency regularization is one of the common unsupervised losses that is learned by forcing the predictions of the same sample to be consistent under different perturbations (augments) [1,2,20]. Another popular form of unsupervised learning is entropy minimization [21, 28], which learns from the unlabeled data by predicting a pseudo-label for each sample. Our method is built over the entropy minimization concept from FixMatch [21]. More specifically, FixMatch first generates a class prediction for an unlabeled sample from a weakly augmentation of the sample and considers it as a pseudo-label if the confidence of the prediction is above a pre-defined threshold. Finally, these high-confident pseudo-labels are used as supervision for a strong augmentation of the sample." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.779, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Let, \\( x_w^{(i)} = \\phi(x_{ulb}^i) \\) and \\( x_s = \\omega(x_{ulb}^i) \\) be the weakly augmented and strongly augmented samples, and \\( p_m(p_z(x)) \\) be the output of the model, where, \\( p_z \\) is the encoder and \\( p_m \\) is the classifier. The unsupervised loss of FixMatch can be defined as follows:" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "equation", + "bbox": [ + 0.344, + 0.168, + 0.66, + 0.208 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {u n s u p} = \\frac {1}{\\mu B} \\sum_ {b = 1} ^ {\\mu B} \\mathbb {1} \\left(m a x \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right) \\geq \\tau\\right).\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.372, + 0.212, + 0.785, + 0.23 + ], + "angle": 0, + "content": "\\[\nH \\left(\\operatorname {a r g m a x} \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right), p _ {m} \\left(p _ {z} \\left(x _ {s} ^ {(i)}\\right)\\right)\\right), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.236, + 0.784, + 0.266 + ], + "angle": 0, + "content": "where \\(\\tau\\) is the fixed confidence threshold, \\(\\mu\\) is the ratio of unlabelled to labelled batch size, \\(B\\) is the batch size and \\(H\\) represents the cross-entropy loss function." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.267, + 0.785, + 0.418 + ], + "angle": 0, + "content": "Nevertheless, a fixed (high) threshold results in under-utilization of the unlabeled data as the model does not utilize the low-confident samples. To address this, FlexMatch [28] and ConFid [8] propose dynamic pseudo labelling to adjust the threshold value considering the class-wise learning status by curriculum learning. In this context, the learning status refers to the ratio of predicted labels to the target label of a class. Specifically, the threshold value is low for high learning status classes to encourage the learning process, and vice-versa. Yet, the model does not utilize all the available unlabeled samples. Following, we describe our proposed solution, AllMatch, which effectively utilizes all the unlabeled samples for learning." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.436, + 0.341, + 0.451 + ], + "angle": 0, + "content": "3.2 AllMatch" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.458, + 0.784, + 0.504 + ], + "angle": 0, + "content": "AllMatch consists of three components, all aimed towards improving the utilization of the unlabelled data: adaptive hard augmentation, inverse learning and contrastive learning. Following, we discuss each of the components in detail." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.785, + 0.718 + ], + "angle": 0, + "content": "Adaptive hard augmentation (AHA). One limitation of the high confidence-based thresholding method is that the selected (highly confident) samples are already well learned by the model [9]. As a result, the loss for these samples is very low and, therefore, does not contribute towards the learning of the model. Following [9], we refer to these high-confident samples as easy samples and propose an adaptive hard augmentation (AHA) module to further utilize the easy samples. The basic idea is to apply relatively hard augmentations on the easy samples to introduce further regularization while applying the usual strong augmentations for the remaining samples. Note that the alternation between extra hard augmentation and strong augmentation plays a crucial role, as excess augmentation can potentially have a detrimental effect on the model. While the role of hard augmentation is extensively studied in the image semi-supervised learning literature [9], it's not well explored in 3D point clouds." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.784, + 0.764 + ], + "angle": 0, + "content": "We define the easy samples based on a historical loss computed until the current epoch \\( t \\). More specifically, we calculate the historical loss for the \\( i - th \\) sample as the exponential moving average (EMA):" + }, + { + "type": "equation", + "bbox": [ + 0.404, + 0.771, + 0.785, + 0.789 + ], + "angle": 0, + "content": "\\[\n\\mathcal {H} _ {i} ^ {t} = (1 - \\kappa) \\cdot \\mathcal {H} _ {i} ^ {t - 1} + \\kappa \\cdot l _ {i} ^ {t}, \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.795, + 0.4, + 0.811 + ], + "angle": 0, + "content": "where, \\( l_i^t \\) is computed as:" + }, + { + "type": "equation", + "bbox": [ + 0.341, + 0.824, + 0.785, + 0.843 + ], + "angle": 0, + "content": "\\[\nl _ {i} ^ {t} = H \\left(\\operatorname {a r g m a x} \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right), p _ {m} \\left(p _ {z} \\left(x _ {s} ^ {(i)}\\right)\\right)\\right), \\tag {4}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.312, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "The lower historical loss for sample \\( i \\) indicates an easy sample on which we apply additional hard augmentations. To divide the samples into easy and hard samples based on the historic loss, we utilize the OTSU [18] function that returns a binary indicator \\( \\mathcal{T}_i \\) for each sample. Here, \\( \\mathcal{T}_i = 0 \\) indicates easy sample, and \\( \\mathcal{T}_i = 1 \\) indicates hard sample. Finally, for an easy sample, we apply a series of transformations to act as hard augmentation, including random scaling, rotation, translation and jitters. The AHA module can be represented as:" + }, + { + "type": "equation", + "bbox": [ + 0.347, + 0.264, + 0.786, + 0.297 + ], + "angle": 0, + "content": "\\[\nA u g m e n t e d \\operatorname {s a m p l e} \\left(x _ {i}\\right) = \\left\\{ \\begin{array}{l} \\mathcal {K} \\left(x _ {i}\\right), \\mathcal {T} _ {i} = 1 \\\\ \\mathcal {K} ^ {\\prime} \\left(x _ {i}\\right), \\mathcal {T} _ {i} = 0, \\end{array} \\right. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.301, + 0.788, + 0.377 + ], + "angle": 0, + "content": "Here, \\(\\mathcal{K}'(x_i)\\) represents the extra hard augmentation, while \\(\\mathcal{K}(x_i)\\) represents hard augmentation. In the implementation, we start applying the AHA module after certain epochs of training, defined by 'warm-up epochs.' Since the loss is relatively high for all samples at the start of training, adding the AHA from the start of training does not add any benefit." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.397, + 0.788, + 0.517 + ], + "angle": 0, + "content": "Inverse learning. Another challenge in pseudo-labeling-based semi-supervised learning comes from the ambiguity in the predictions of the models. More specifically, the samples with low confidence (high ambiguity) are discarded by the pseudo-labeling concept. These low-confident samples do not contribute to the model's learning process, as pseudo-labels cannot be assigned to them. Consequently, a significant number of unlabelled samples go unused. However, these neglected unlabelled samples can be re-purposed to optimize the model inversely by learning what not to learn." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.518, + 0.788, + 0.638 + ], + "angle": 0, + "content": "As demonstrated in [6] for SSL in the image domain, after a certain number of training iterations, the correct classes are situated in one of the top-k predictions (i.e., the \\( k \\) classes with the highest predicted probabilities) of the model. In essence, the model is extremely confident in its predictions for containing the right class in one of these top-k classes. Therefore, it is advantageous to treat the remaining classes (those outside the top-k predictions) as wrong class for the input. Motivated by [6], we incorporate inverse learning, which learns to avoid predicting such classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.639, + 0.788, + 0.73 + ], + "angle": 0, + "content": "For Inverse learning, following the convention of FixMatch, we first predict a pseudo-label from a weakly augmented sample and find the value of \\( k \\) for which the model achieves 100% accuracy on the strongly augmented samples at the current epoch. Then, we sort the classes in order of highest to lowest confidence using a ranking function, Rank. Finally, for the classes with \\( \\text{Rank} > k \\) we perform inverse learning on the strongly augmented samples as:" + }, + { + "type": "equation", + "bbox": [ + 0.24, + 0.751, + 0.787, + 0.792 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {i n v} = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\sum_ {c = 1} ^ {C} \\mathbb {1} [ R a n k (p _ {m} (p _ {z} (x _ {w} ^ {(i)}))) > k ] \\cdot \\log (1 - p _ {m} (p _ {z} (x _ {s} ^ {(i)}))), \\quad (6)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Contrastive learning (CL). While the AHA and inverse learning module increase the utilization of the unlabeled data, the samples that are neither very" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.298 + ], + "angle": 0, + "content": "high-confident nor very low-confident are not utilized by any of the above modules. To ensure learning from the remainder of the sample, we incorporate a contrastive loss on the unlabelled set that learns from all the samples in an unsupervised setting. Contrastive methods learn from positive and negative samples, with the aim of pushing the positive pairs closer in the embedding space and moving them away from the negative sample. In this context, positive samples are the perturbation of the same sample, while all other samples are considered negative. Contrastive learning has shown remarkable success in learning representation in different computer vision domains [5,11,20]. Since contrastive learning does not require labels, it ensures total usage of unlabelled data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.788, + 0.408 + ], + "angle": 0, + "content": "For each unlabelled sample, \\( x_{ulb}^{(i)} \\in X_{ulb} \\), a weak perturbation \\( \\phi \\) and a strong perturbation \\( \\omega \\) is applied to generate a positive pair. In our case, we apply rotation and random scale as weak augmentation, and for strong augmentation, a couple of different augmentations (e.g. jitter, translation, rotation, random scale) are randomly applied. The augmented samples are then fed to the encoder and projection head that generates the embedding \\( z_{i} = p_{z}(y|x_{ulb_{i}}) \\), where \\( [z_{w_i},z_{s_i}] \\in z_i \\). Finally, the unsupervised contrastive loss [5] function can be described as:" + }, + { + "type": "equation", + "bbox": [ + 0.335, + 0.418, + 0.786, + 0.458 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {c o n} = - \\frac {1}{2 B} \\sum_ {i = 1} ^ {2 B} \\log \\frac {\\exp \\left(z _ {i} , z _ {\\kappa (i)} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 B} \\mathbb {1} _ {[ k \\neq i ]} \\exp \\left(z _ {i} , z _ {k} / \\tau\\right)}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.464, + 0.788, + 0.539 + ], + "angle": 0, + "content": "where, \\(\\kappa (i)\\) is the index of the second augmented sample, \\(\\mathbb{1}_{[k\\neq i]}\\) is an indicator function which returns 1 when \\(k\\) is not equal to \\(i\\), and 0 otherwise. \\(\\tau\\) is a temperature parameter. Note that the pair samples are the same as the ones used for the unsupervised loss mentioned above. So, the contrastive loss does not increase the computational complexity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.54, + 0.788, + 0.63 + ], + "angle": 0, + "content": "Additionally, we utilize a modified supervised version of contrastive loss (supervised contrastive loss [12]) on the labelled set. Like the unsupervised contrastive loss, the supervised contrastive loss learns from the augmented positive and negative samples. However, the additional label information benefits the model by pushing together samples that belong to the same class. The supervised contrastive loss can be formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.227, + 0.654, + 0.786, + 0.697 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {s u p c o n} = \\sum_ {i = 1} ^ {2 B} - \\frac {1}{2 B _ {y _ {i}} - 1} \\sum_ {j = 1} ^ {2 B} \\mathbb {1} _ {[ i \\neq j ]} \\cdot \\mathbb {1} _ {[ y _ {i} = y _ {j} ]} \\cdot \\log \\frac {\\exp (z _ {i} , z _ {j} / \\tau)}{\\sum_ {k = 1} ^ {2 B} \\mathbb {1} _ {[ k \\neq i ]} \\exp (z _ {i} , z _ {k} / \\tau)}, \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.706, + 0.788, + 0.752 + ], + "angle": 0, + "content": "where, \\( y_{i} \\) represents class label of sample \\( i \\). \\( \\mathbb{1}_{[y_i = y_j]} \\) is an indicator function that returns 1 when the samples \\( i \\) and \\( j \\) belongs to same class label. \\( 2B_{y_i} - 1 \\) represents number of positive samples from class \\( y_{i} \\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.773, + 0.348, + 0.787 + ], + "angle": 0, + "content": "3.3 Total Loss" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.798, + 0.733, + 0.813 + ], + "angle": 0, + "content": "Finally, the total loss of AllMatch is the sum of all the described above:" + }, + { + "type": "equation", + "bbox": [ + 0.314, + 0.826, + 0.786, + 0.842 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {\\text {s u p}} + \\mathcal {L} _ {\\text {u n s u p}} + \\alpha \\cdot \\mathcal {L} _ {\\text {s u p c o n}} + \\beta \\cdot \\mathcal {L} _ {\\text {c o n}} + \\gamma \\cdot \\mathcal {L} _ {\\text {i n v}}, \\tag {9}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.312, + 0.114, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "code_caption", + "bbox": [ + 0.228, + 0.15, + 0.489, + 0.165 + ], + "angle": 0, + "content": "Algorithm 1: AllMatch Algorithm" + }, + { + "type": "algorithm", + "bbox": [ + 0.218, + 0.167, + 0.788, + 0.405 + ], + "angle": 0, + "content": "Input: Labelled batch \\(\\mathcal{B}_l = \\{(x_i,y_i)\\}^M\\) , unlabelled batch \\(\\mathcal{B}_u = \\{u_i\\} ^N\\) \n1 Apply AHA to \\(\\mathcal{B}_l\\) as Eq. 5 \n2 \\(l_{sup} = \\mathcal{L}_{sup}(\\mathcal{B}_l)\\) \n3 \\(l_{unsup} = \\mathcal{L}_{unsup}(\\mathcal{B}_u)\\) // via Eq. 2 \n4 \\(l_{con} = \\mathcal{L}_{con}(\\mathcal{B}_u)\\) // via Eq. 7 \n5 \\(l_{supcon} = \\mathcal{L}_{supcon}(\\mathcal{B}_l)\\) // via Eq. 8 \n6 for \\(i\\gets 1\\) to \\(N\\) do \n7 Compute the rank using, \\(\\operatorname {Rank}\\big(p_m(p_z(x_w^{(i)}))\\) for \\(c\\gets 1\\) to \\(C\\) do \n8 if \\(\\operatorname {Rank}\\big(p_m(p_z(x_w^{(i)}))\\big) > k\\) then \n9 \\(l_{inv} + = \\log \\left(1 - p_m(p_z(x_s^{(i)}))\\right)\\) \n10 end \n11 end \n12 Compute and update historical loss, \\(\\mathcal{H}_i / /\\) via Eq. 3 \n13 Update mark \\(\\tau_{i} = \\mathbb{1}(\\mathcal{H}_{i}\\leq 0\\mathrm{TSU}(H_{i}))\\) \n14 end \n15 \\(l_{total} = l_{sup} + l_{unsup} + \\alpha \\cdot l_{supcon} + \\beta \\cdot l_{con} + \\gamma \\cdot l_{inv}\\)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.436, + 0.785, + 0.467 + ], + "angle": 0, + "content": "Here, \\(\\alpha, \\beta\\) and \\(\\gamma\\) are loss factors balancing the importance of each loss. We find optimal values of each factor from the empirical study described in Section 4.5." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.49, + 0.375, + 0.508 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.521, + 0.785, + 0.582 + ], + "angle": 0, + "content": "In this section, we discuss the experimental results of our study on the ModelNet40 and ScanobjectNN datasets. First, we discuss the main result, followed by an in-depth ablation study of our proposed modules and sensitivity analysis of different module-specific parameters." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.604, + 0.457, + 0.619 + ], + "angle": 0, + "content": "4.1 Implementation Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.84 + ], + "angle": 0, + "content": "We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23]. For the implementation details and hyper-parameters, we nearly follow the existing SOTA, ConFid [8], for a fair comparison. We use PointTransformer [10] as the encoder. We train the model with SGD optimizer with a learning rate of 0.00005 for 350 epochs. The unlabelled to labelled batch size ratio is 4, and the labelled batch size is 24. We utilize rotation and random scale as weak augmentation and random scaling, rotation, translation and jitter as strong augmentation. Note that, as a geometric entity, the underline representation of the point clouds must remain invariant under specific transformations [19]. Thus, we only chose the augmentation methods that do not violate this special property of the point clouds. For the AHA module, various combinations of strong augmentation are applied as an additional hard augmentation to the easy samples. A detailed sensitivity analysis on the augmentation strength is discussed in Section 4.5." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 1: Comparison of AllMatch with the SOTA methods in 3D object classification task on ModelNet40 dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy." + }, + { + "type": "table", + "bbox": [ + 0.258, + 0.219, + 0.747, + 0.391 + ], + "angle": 0, + "content": "
Method2%5%10%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]71.161.077.169.284.677.2
PL [14]69.759.678.369.085.177.7
Flex-PL [28]66.754.974.262.383.270.3
ConFid-PL [8]74.461.980.673.586.580.4
FixMatch [21]70.862.778.971.185.579.4
Dash [27]71.563.079.771.885.980.1
FlexMatch [28]70.161.280.570.486.278.7
ConFid-Match [8]73.864.182.174.387.882.5
AllMatch84.382.689.087.990.289.8
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.419, + 0.365, + 0.433 + ], + "angle": 0, + "content": "4.2 Main Result" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.443, + 0.788, + 0.61 + ], + "angle": 0, + "content": "The overall comparison to the previous works is presented in Tables 1 and 2 for ModelNet-40 and ScanObjectNN datasets, respectively. Here, PL [14], FixMatch [21], Dash [27], and FlexMatch [28] were initially proposed for the image domain and later adopted to the PointCloud, whereas ConFid [8] is specifically designed for the point cloud. The results for other prior works are directly adopted from the reported results in ConFid [8]. Following the experimental setups of previous literature on this task, we report the results for different amounts of labelled samples. More specifically, we evaluate the performance on three different sizes of labelled sets: \\(2\\%\\), \\(5\\%\\), and \\(10\\%\\) for the ModelNet40 dataset and \\(1\\%\\), \\(2\\%\\), and \\(5\\%\\) for the ScanObjectNN dataset. We report the overall accuracy and the mean of class-wise accuracy (mean accuracy) on the test set." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.61, + 0.788, + 0.73 + ], + "angle": 0, + "content": "As we observe from these tables, AllMatch outperforms SOTA by a significant margin across all sizes of unlabelled sets, demonstrating substantial improvement. For example, with only \\(2\\%\\) labelled data from ModelNet40 (Table 1), AllMatch outperforms ConFid by a notable \\(10.48\\%\\) and \\(18.52\\%\\) in overall and mean accuracy. While we also see considerable improvements for \\(5\\%\\) and \\(10\\%\\) data, the biggest improvement is observed when the least amount of labelled data \\((2\\%)\\) is utilized. This indicates the effectiveness of AllMatch in learning from a very small amount of labelled data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.73, + 0.788, + 0.792 + ], + "angle": 0, + "content": "Table 2 illustrates a similar on the ScanObjectNN dataset. With only \\(1\\%\\) of the labelled set, AllMatch outperforms the SOTA by a superior \\(11.20\\%\\) on overall accuracy and \\(14.67\\%\\) on mean accuracy. The maximum performance gain is again observed for the least amount of labelled samples." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.312, + 0.114, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.151, + 0.788, + 0.207 + ], + "angle": 0, + "content": "Table 2: Comparison of AllMatch with the SOTA methods in 3D object classification task on ScanObjectNN dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy." + }, + { + "type": "table", + "bbox": [ + 0.258, + 0.219, + 0.747, + 0.391 + ], + "angle": 0, + "content": "
Method1%2%5%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]32.126.144.736.556.650.0
PL [14]31.225.847.538.658.151.5
Flex-PL [28]29.224.247.237.660.151.9
Confid-PL [8]32.627.148.841.563.155.2
FixMatch [21]33.527.647.439.959.452.4
Dash [27]35.129.350.344.162.860.3
FlexMatch [28]34.226.248.539.763.457.2
ConFid-Match [8]38.232.757.048.669.465.5
AllMatch49.447.460.858.977.576.0
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.417, + 0.39, + 0.433 + ], + "angle": 0, + "content": "4.3 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.561, + 0.532 + ], + "angle": 0, + "content": "In this section, we perform a detailed ablation study to understand the importance of different components in our proposed method. We start with the main ablation on the 3 main components of AllMatch, then perform another ablation on the contrastive learning approach." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.561, + 0.597 + ], + "angle": 0, + "content": "Main ablation. Table 3 presents the results for the main ablation study. Here, we ablate all the combinations of the three main components of" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.786, + 0.659 + ], + "angle": 0, + "content": "AllMatch: adaptive hard augmentation (AHA), inverse learning and contrastive learning (CL). First, we drop these modules individually and then in groups to investigate their significance on overall performance. We perform this study with \\(2\\%\\) of the labelled data and report the overall accuracy (OA)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.841 + ], + "angle": 0, + "content": "As we observe from this table, when we drop the AHA module individually, the method's performance declines by \\(4.29\\%\\). This is considerably higher than the drops observed by dropping inverse learning or contrastive loss, making AHA the most important module in AllMatch. We find the inverse learning to be the second most important component, removing which results in a \\(3.77\\%\\) drop in accuracy. Finally, we find that contrastive learning also plays a critical role. Removing the contrastive learning also results in a \\(1.34\\%\\) drop in accuracy. We find similar trends when two modules are removed at a time. We observe a performance drop of \\(6.37\\%\\) when we remove both the AHA and inverse learning modules. Similarly, removing the AHA and contrastive learning module results in a \\(4.9\\%\\) decline in AllMatch's performance. The least accuracy we find by utilizing a single component is \\(77.9\\%\\) with contrastive learning. Finally, we find" + }, + { + "type": "table_caption", + "bbox": [ + 0.572, + 0.441, + 0.788, + 0.483 + ], + "angle": 0, + "content": "Table 3: Ablation study of different proposed components of AllMatch on ModelNet40." + }, + { + "type": "table", + "bbox": [ + 0.574, + 0.489, + 0.789, + 0.585 + ], + "angle": 0, + "content": "
Inv. lear.AHACLOA
✓✓✓84.28
✓✓82.94
✓✓79.98
✓✓80.50
✓77.90
✓79.37
✓80.10
74.80
" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.178 + ], + "angle": 0, + "content": "that removing all components drastically drops the performance by \\(74.8\\%\\). This further shows the importance of each of the components in AllMatch." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.2, + 0.586, + 0.35 + ], + "angle": 0, + "content": "Ablation on contrastive learning. Next, we perform another study on our contrastive learning module, which consists of supervised and self-supervised contrastive loss. Here, we perform another ablation study by removing the contrastive learning components in different combinations. Similar to the previous study, we do this study on \\(2\\%\\) of labelled data from ModelNet40. The results of this study are presented in Table 4. As we find from this table, removing both of the components results in" + }, + { + "type": "table_caption", + "bbox": [ + 0.594, + 0.212, + 0.788, + 0.268 + ], + "angle": 0, + "content": "Table 4: Ablation study of contrastive loss components of AllMatch on ModelNet40 dataset." + }, + { + "type": "table", + "bbox": [ + 0.614, + 0.281, + 0.766, + 0.335 + ], + "angle": 0, + "content": "
Sup.Unsup.OA
✓✓84.28
✓83.47
✓83.06
82.94
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.352, + 0.788, + 0.489 + ], + "angle": 0, + "content": "a considerable drop in performance, with unsupervised contrastive loss having a greater impact on the final performance. More specifically, when both the supervised and unsupervised contrastive losses are employed, AllMatch achieves its highest performance, \\(84.28\\%\\). By dropping the unsupervised contrastive loss, the method's overall accuracy drops sharply by \\(1.21\\%\\). However, when the supervised loss is removed, the overall accuracy declines by \\(0.8\\%\\). This proves AllMatch is gaining better learning signals from the unsupervised contrastive loss component. Finally, when both contrastive losses are removed, AllMatch returns with AHA and inverse learning setting with an overall loss of \\(82.94\\%\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.51, + 0.625, + 0.525 + ], + "angle": 0, + "content": "4.4 Performance on Increased Labelled Set Size" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.536, + 0.603, + 0.716 + ], + "angle": 0, + "content": "In this section, we study the performance of different amounts of labelled data. Specifically, we investigate how an increase in the amount of labelled data impacts performance. To this end, we increase the labelled set size to all labelled data with a \\(10\\%\\) interval (Figure 3). It is evident that when only a small amount of labelled data is available \\((2\\% -5\\%)\\), the overall accuracy of AllMatch is relatively low and gradually increases until it reaches \\(10\\%\\) of the labelled set. With \\(10\\%\\) labelled data, the overall accuracy reaches \\(90.19\\%\\), compared to \\(90.75\\%\\) with the whole labelled set. In other words, the performance with \\(10\\%\\) of labelled samples" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.717, + 0.787, + 0.763 + ], + "angle": 0, + "content": "is almost close to the performance with \\(100\\%\\) of the labelled data. This again proves the fact that AllMatch properly utilizes all the unlabelled data, making it possible for \\(10\\%\\) labelled data to reach such performance." + }, + { + "type": "image", + "bbox": [ + 0.621, + 0.547, + 0.779, + 0.668 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.612, + 0.678, + 0.788, + 0.706 + ], + "angle": 0, + "content": "Fig. 3: Impact of labelled set size." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.784, + 0.407, + 0.801 + ], + "angle": 0, + "content": "4.5 Sensitivity Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.841 + ], + "angle": 0, + "content": "In this section, we perform detailed sensitivity studies on different parameters of the AllMatch. Following, We discuss the details of these experiments." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.312, + 0.114, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.332, + 0.145, + 0.672, + 0.16 + ], + "angle": 0, + "content": "Table 5: Impact of different values of loss factors." + }, + { + "type": "table", + "bbox": [ + 0.238, + 0.171, + 0.379, + 0.242 + ], + "angle": 0, + "content": "
αOverall accuracy
0.284.28
0.583.38
1.081.96
" + }, + { + "type": "table_footnote", + "bbox": [ + 0.266, + 0.242, + 0.341, + 0.254 + ], + "angle": 0, + "content": "(a) \\(\\alpha\\) vs acc." + }, + { + "type": "table", + "bbox": [ + 0.434, + 0.171, + 0.575, + 0.242 + ], + "angle": 0, + "content": "
βOverall accuracy
0.284.28
0.583.46
1.081.24
" + }, + { + "type": "table_footnote", + "bbox": [ + 0.462, + 0.242, + 0.537, + 0.255 + ], + "angle": 0, + "content": "(b) \\(\\beta\\) vs acc." + }, + { + "type": "table", + "bbox": [ + 0.631, + 0.171, + 0.77, + 0.242 + ], + "angle": 0, + "content": "
γOverall accuracy
0.283.22
0.583.38
1.084.28
" + }, + { + "type": "table_footnote", + "bbox": [ + 0.659, + 0.242, + 0.732, + 0.255 + ], + "angle": 0, + "content": "(c) \\(\\gamma\\) vs acc." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.26, + 0.788, + 0.412 + ], + "angle": 0, + "content": "Loss factor. The final loss function for training AllMatch consists of multiple losses and includes weight factors to balance the impact of individual loss components. Table 5 illustrates the influence of different loss factors on AllMatch's overall performance. The experiments are conducted on the ModelNet40 dataset with \\(2\\%\\) of labelled data. It is observed that the overall accuracy of AllMatch is sensitive to the values of these factors. Specifically, lower loss factor values lead to higher performances for both supervised and unsupervised contrastive losses, while higher values for the inverse loss factor prove beneficial. This indicates that the inverse loss plays a more significant role in contributing to AllMatch's performance compared to the contrastive loss." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.438, + 0.603, + 0.649 + ], + "angle": 0, + "content": "Augmentation strength. Augmentation strength is an essential hyperparameter for the Adaptive Hard Augmentation (AHA) module of AllMatch. It indicates the combination of different types of augmentation randomly applied as an additional hard augmentation to the easy samples. In Figure 4, we evaluate the overall performance of AllMatch for different augmentation strengths ranging from 4 to 8. Here, the numbers represent the total number of transformations applied to a sample. As we find from Figure 4, the best result is observed for using 4 transformations. While the augmentations are essential for learning from easy samples, applying a very high number of augmentations makes the optimization of the model difficult." + }, + { + "type": "image", + "bbox": [ + 0.621, + 0.449, + 0.78, + 0.57 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.611, + 0.58, + 0.788, + 0.622 + ], + "angle": 0, + "content": "Fig. 4: Sensitivity study on the augmentation strengths." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.603, + 0.841 + ], + "angle": 0, + "content": "Warm-up epoch for AHA. As discussed in the method section, the AHA module comes into effect after a certain epoch of training. Given that AHA introduces an additional hard augmentation to easy samples, the downstream task becomes challenging for the model. If AHA is applied right at the beginning of the training process, it can negatively impact the model's performance. To this end, warm-up epochs enable the model to learn representations from all samples efficiently during the initial training. As depicted in Figure 5, AllMatch shows superior performance when" + }, + { + "type": "image", + "bbox": [ + 0.622, + 0.668, + 0.778, + 0.788 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.611, + 0.798, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Fig.5: Sensitivity study on the impact of different warm-up epochs." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "warmed up for 50 epochs. However, prolonged warm-up periods diminish performance, as they reduce the effective action period of AHA." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.2, + 0.488, + 0.35 + ], + "angle": 0, + "content": "Epoch and learning rate. Finally, we study two hyper-parameters that are important for the optimization of the model, epochs and learning rate. As depicted in Figure 6a, we observe that AllMatch's performance improves by increasing the number of epochs, reaching its peak at 350 epochs with a best performance of \\(84.28\\%\\). However, extending the num" + }, + { + "type": "image", + "bbox": [ + 0.499, + 0.199, + 0.635, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.501, + 0.303, + 0.63, + 0.316 + ], + "angle": 0, + "content": "(a) Epochh vs Acc." + }, + { + "type": "image", + "bbox": [ + 0.645, + 0.199, + 0.78, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.664, + 0.303, + 0.763, + 0.315 + ], + "angle": 0, + "content": "(b) LR vs Acc." + }, + { + "type": "image_caption", + "bbox": [ + 0.498, + 0.317, + 0.786, + 0.344 + ], + "angle": 0, + "content": "Fig.6: Sensitivity study of epoch and learning rate on ModelNet40." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.351, + 0.788, + 0.472 + ], + "angle": 0, + "content": "ber of epochs beyond this point results in a decline in performance. This is considerably lower than the previous SOTA, which requires 500 epochs of training. This further shows the benefit of utilizing the unlabelled data properly. In Figure 6b, we analyze the impact of different learning rates on AllMatch's performance. Notably, lower learning rates contribute to improved performance, whereas higher values lead to a collapse in the model's performance. For instance, at a learning rate of 0.0005, AllMatch achieves only \\(12\\%\\) overall accuracy, emphasizing the sensitivity of the model's performance to the choice of learning rate." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.495, + 0.36, + 0.511 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.527, + 0.788, + 0.677 + ], + "angle": 0, + "content": "In this work, we identify that existing 3D semi-supervised techniques fail to capitalize the whole unlabelled data. To solve this issue, we introduce AllMatch, a novel semi-supervised method for point cloud classification that effectively utilizes the entire unlabelled set to improve the learnt representation. Comprised of adaptive hard augmentation, inverse learning, and contrastive learning components, AllMatch outperforms existing SOTA methods by a significant margin, showcasing superior performance even with minimal (1%) labelled sets. Remarkably, AllMatch, with just \\(10\\%\\) of the labelled set, attains a performance close to the fully supervised learning with all samples, underscoring its efficiency in minimizing reliance on labelled data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.678, + 0.788, + 0.814 + ], + "angle": 0, + "content": "Limitations. While our proposed method has made significant improvement in efficiently leveraging the entire unlabelled set, there are still opportunities for further exploration in this promising direction. In the AHA module, we successfully incorporated selected transformation-invariant augmentation techniques, showcasing a positive step forward. Expanding our exploration to encompass a more diverse range of augmentation methods could prove to be a fruitful avenue for additional advancements. Furthermore, we only explored contrastive learning as the self-supervised module to ensure the utilization of all unlabelled samples, leaving room for exploring different versions and alternatives of contrastive loss." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.312, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.179, + 0.785, + 0.221 + ], + "angle": 0, + "content": "1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution matching and augmentation anchoring. In: ICLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.223, + 0.785, + 0.249 + ], + "angle": 0, + "content": "2. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. NeurIPS (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.251, + 0.785, + 0.292 + ], + "angle": 0, + "content": "3. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality tradeoff in semi-supervised learning. In: ICLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.294, + 0.785, + 0.32 + ], + "angle": 0, + "content": "4. Chen, L., Zhang, Y., Lin, Y., Jiang, M., Huang, Y., Lei, Y.: Consistency-based semi-supervised learning for point cloud classification. In: PRAI. pp. 440-445 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.321, + 0.785, + 0.348 + ], + "angle": 0, + "content": "5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.35, + 0.785, + 0.39 + ], + "angle": 0, + "content": "6. Chen, Y., Tan, X., Zhao, B., Chen, Z., Song, R., Liang, J., Lu, X.: Boosting semi-supervised learning by exploiting all unlabeled data. In: CVPR. pp. 7548-7557 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.392, + 0.785, + 0.418 + ], + "angle": 0, + "content": "7. Chen, Z., Jing, L.: Multimodal semi-supervised learning for 3d objects. In: BMVC (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.785, + 0.447 + ], + "angle": 0, + "content": "8. Chen, Z., Jing, L., Yang, L., Li, Y., Li, B.: Class-level confidence based 3d semi-supervised learning. In: WACV. pp. 633-642 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.448, + 0.785, + 0.488 + ], + "angle": 0, + "content": "9. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: CVPR. pp. 15880-15889 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.49, + 0.785, + 0.516 + ], + "angle": 0, + "content": "10. Guo, M.H., Cai, J.X., Liu, Z.N., Mu, T.J., Martin, R.R., Hu, S.M.: Pct: Point cloud transformer. Computational Visual Media 7, 187-199 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.518, + 0.785, + 0.559 + ], + "angle": 0, + "content": "1. Jiang, L., Shi, S., Tian, Z., Lai, X., Liu, S., Fu, C.W., Jia, J.: Guided point contrastive learning for semi-supervised point cloud semantic segmentation. In: ICCV. pp. 6423-6432 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.561, + 0.785, + 0.601 + ], + "angle": 0, + "content": "2. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS pp. 18661-18673 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.603, + 0.785, + 0.643 + ], + "angle": 0, + "content": "3. Kim, J., Min, Y., Kim, D., Lee, G., Seo, J., Ryoo, K., Kim, S.: Conmatch: Semi-supervised learning with confidence-guided consistency regularization. In: ECCV. pp. 674-690 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.645, + 0.785, + 0.685 + ], + "angle": 0, + "content": "4. Lee, D.H., et al.: Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks. In: Workshop on challenges in representation learning, ICML. p. 896 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.687, + 0.785, + 0.713 + ], + "angle": 0, + "content": "5. Li, J., Xiong, C., Hoi, S.C.: Comatch: Semi-supervised learning with contrastive graph regularization. In: ICCV. pp. 9475-9484 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.715, + 0.785, + 0.755 + ], + "angle": 0, + "content": "6. Liu, F., Lin, G., Foo, C.S., Joshi, C.K., Lin, J.: Point discriminative learning for data-efficient 3d point cloud analysis. In: IEEE Int. Conf. on 3D Vision. pp. 42-51 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.757, + 0.785, + 0.783 + ], + "angle": 0, + "content": "7. Nguyen, K.B.: Sequencematch: Revisiting the design of weak-strong augmentations for semi-supervised learning. In: WACV. pp. 96-106 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.786, + 0.785, + 0.812 + ], + "angle": 0, + "content": "8. Otsu, N.: A threshold selection method from gray-level histograms. TSMC 9, 62-66 (1979)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "9. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: CVPR. pp. 652-660 (2017)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.179, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "S. Paul et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "20. Roy, S., Etemad, A.: Scaling up semi-supervised learning with unconstrained unlabelled data. In: AAAI. pp. 14847-14856 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.176, + 0.785, + 0.217 + ], + "angle": 0, + "content": "21. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. NeurIPS pp. 596-608 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.785, + 0.259 + ], + "angle": 0, + "content": "22. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. In: NeurIPS. pp. 1195–1204 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.259, + 0.785, + 0.3 + ], + "angle": 0, + "content": "23. Uy, M.A., Pham, Q.H., Hua, B.S., Nguyen, D.T., Yeung, S.K.: Revisiting point cloud classification: A new benchmark dataset and classification model on real-world data. In: ICCV. pp. 1588-1597 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.785, + 0.342 + ], + "angle": 0, + "content": "24. Wu, J., Yang, H., Gan, T., Ding, N., Jiang, F., Nie, L.: Chmatch: Contrastive hierarchical matching and robust adaptive threshold boosted semi-supervised learning. In: CVPR. pp. 15762-15772 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.342, + 0.785, + 0.37 + ], + "angle": 0, + "content": "25. Wu, Z., Song, S., Khosla, A., Yu, F., Zhang, L., Tang, X., Xiao, J.: 3d shapenets: A deep representation for volumetric shapes. In: CVPR. pp. 1912-1920 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.398 + ], + "angle": 0, + "content": "26. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. In: NeurIPS. pp. 6256-6268 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.425 + ], + "angle": 0, + "content": "27. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: ICML. pp. 11525-11536 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.467 + ], + "angle": 0, + "content": "28. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. NeurIPS pp. 18408-18419 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.495 + ], + "angle": 0, + "content": "29. Zheng, M., You, S., Huang, L., Wang, F., Qian, C., Xu, C.: Simmatch: Semi-supervised learning with similarity matching. In: CVPR. pp. 14471-14481 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.495 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_origin.pdf b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8fef90e954c540266bf8b2dfcd473ad2dd0a5e24 --- /dev/null +++ b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/2a1e6534-32cf-406e-baeb-f99a3e49ec22_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6e430170adc148c4b8835be1e4a68933b26691b680c22e2cfa38a16dc897aa99 +size 592040 diff --git a/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/full.md b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/full.md new file mode 100644 index 0000000000000000000000000000000000000000..a22da112e34e81c0288105da8619c9607a993bf9 --- /dev/null +++ b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/full.md @@ -0,0 +1,311 @@ +# Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data + +Sneha Paul, Zachary Patterson, and Nizar Bouguila + +Concordia Institute for Information Systems Engineering, + +Concordia University, Montreal, Canada + +sneha.paul@mail.concordia.ca + +{zachary.patterson,nizar.bouguila}@concordia.ca + +Abstract. Semi-supervised learning (SSL) has shown its effectiveness in learning effective 3D representation from a small amount of labelled data while utilizing large unlabelled data. Traditional semi-supervised approaches rely on the fundamental concept of predicting pseudo-labels for unlabelled data and incorporating them into the learning process. However, we identify that the existing methods do not fully utilize all the unlabelled samples and consequently limit their potential performance. To address this issue, we propose AllMatch, a novel SSL-based 3D classification framework that effectively utilizes all the unlabelled samples. AllMatch comprises three modules: (1) an adaptive hard augmentation module that applies relatively hard augmentations to the high-confident unlabelled samples with lower loss values, thereby enhancing the contribution of such samples, (2) an inverse learning module that further improves the utilization of unlabelled data by learning what not to learn, and (3) a contrastive learning module that ensures learning from all the samples in both supervised and unsupervised settings. Comprehensive experiments on two popular 3D datasets demonstrate a performance improvement of up to $11.2\%$ with $1\%$ labelled data, surpassing the SOTA by a significant margin. Furthermore, AllMatch exhibits its efficiency in effectively leveraging all the unlabelled data, demonstrated by the fact that only $10\%$ of labelled data reaches nearly the same performance as fully-supervised learning with all labelled data. The code of our work is available at: github.com/snehaputul/AllMatch. + +Keywords: Semi-supervised Learning $\cdot$ Point Cloud $\cdot$ 3D Vision + +# 1 Introduction + +In the realm of 3D computer vision, Point Cloud applications are on the rise, finding extensive use in diverse domains. This increasing popularity of Point Cloud applications across various 3D computer vision domains has heightened the demand for annotated data, a resource-intensive and expensive task [16]. To tackle this + +![](images/9a3eeb2f8def16ca97aeb0d67e8f6c55c154ba18f45da9b9510e645faaab9ac2.jpg) +Fig.1: Performance in comparison to unlabelled data usage. + +issue, 3D semi-supervised learning (SSL) emerges as a promising avenue. By capitalizing on scarce labelled data in conjunction with abundant unlabelled data, this approach has demonstrated its efficacy in different computer vision applications, including 3D object recognition. Most popular forms of SSL (e.g. [21], [28]) involve predicting pseudo-labels for the unlabelled data and using only the high-confident predictions for learning. However, due to the hand-designed nature of the high-confidence-based filtering, most of the unlabelled samples never contribute to the learning (Figure 1). + +Some of the more recent works propose different techniques to increase the number of unlabelled samples the model learns from. For example, FlexMatch [28] introduced a dynamic threshold strategy, where the threshold value is adjusted according to the model's learning status using curriculum learning. SoftMatch [3] proposed a trade-off between quality and quantity to increase unlabelled data usage. While there has been some progress in this direction, these methods are specially developed for the image domain and have not been explored in the context of 3D SSL. Furthermore, as shown in Figure + +![](images/bd3afb67132dd7b47f7711309bb3dc8585394b17d26d01eb95dcdb6a841d2467.jpg) +Fig.2: (left) Pseudo label utilization over the training epochs by FixMatch and Confid. While ConFid does better utilization than FixMatch, none properly utilizes all unlabelled data. (right) Loss over training for high and low-confident pseudo-labels. The high-confident samples are selected for unsupervised learning, but low loss results in marginal contribution to learning. + +![](images/3d932bbc68df6f73f648193e708ab6d46885cf8bf6e011719f6e743d6afea006.jpg) + +2 (left) for 3D SSL, FixMatch utilizes about $25\%$ of the unlabelled data, while the current state-of-the-art (SOTA) method, ConFid [8], utilizes about $76\%$ of the unlabelled data. Moreover, we find that the correctly predicted pseudo-labels do not contribute much towards the learning, as they have higher confidence in prediction and lower loss (Figure 2 (right)). + +In this work, we propose a novel semi-supervised framework named AllMatch that handles the above-mentioned problems and ensures learning from all the unlabeled data. AllMatch consists of three modules, all of which improve different aspects of increasing unlabeled data usage. While the concepts of these modules are not entirely new, they have never been explored in 3D SSL, especially with the focus on increasing the utilization of unlabeled data. The modules in AllMatch are: (a) An adaptive hard augmentation(AHA) module that increases the augmentation strength of the high-confident unlabeled samples with lower loss. This module ensures better utilization of high-confident samples that the model has already learned, thus leaving no further contribution to the model's learning process. (b) An inverse learning module that further ensures better utilization of unlabeled samples by assigning inverse pseudo labels to the low-confident predictions and learning what not to learn. (c) A contrastive learning (CL) module that learns from all the unlabeled data in unsupervised learning settings. This module ensures that the samples excluded from pseudo-label-based learning also + +contribute to the learning process by participating in CL. Additionally, we utilize a modified supervised contrastive loss [12] for learning from the labelled data in a similar learning setting as the unlabelled data. + +We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23], with different amounts of labelled sets. We compare AllMatch with the existing SSL methods and find that AllMatch outperforms the existing SOTA by up to $11.2\%$ and $10.45\%$ on ScanObjectNN and ModelNet40 datasets, respectively, with a minimal amount of labelled data. AllMatch also shows superior performance with a lower amount of labelled set, indicating its effectiveness in utilizing all unlabelled samples. With our proposed method, only $10\%$ of the labelled data performs almost as well as in a fully supervised setting with all the labelled data. Furthermore, our method is more computationally efficient than the previous SOTA, ConFid [8], which requires 500 epochs of training compared to 250 in ours. We also conduct an in-depth ablation study and sensitivity analysis demonstrating the importance of all three components for AllMatch's superior performance. Here, the AHA module shows the highest impact on the model's performance, followed by inverse learning and contrastive learning modules. Our main contributions to this work can be summarized as follows: + +- We propose a novel semi-supervised 3D classification framework named All-Match that effectively utilizes the whole unlabelled set to improve the performance. +- We introduce an adaptive hard augmentation module that efficiently utilizes the higher-confident samples with lower loss and an inverse learning module to further boost the utilization of unlabelled samples by learning from low-confident predictions. +- We introduce a contrastive learning module to ensure learning from the remainder of the unlabeled data that are not utilized by pseudo-label-based learning. +- We improve the SOTA for 3D semi-supervised learning by $11.2\%$ , and $10.45\%$ on the ScanobjectNN and ModelNet40 datasets, respectively. We also show that AllMatch achieves almost similar results in a fully-supervised setting with only $10\%$ of labelled data. + +# 2 Related Work + +# 2.1 Semi-supervised Learning + +There has been significant progress in semi-supervised learning in recent years, mostly for image representation learning. Most dominant approaches in semi-supervised learning can be divided into two main categories: consistency regularization [22, 26] and entropy minimization [1, 2, 21]. The consistency regularization learns by enforcing consistency in the prediction of the model under different perturbations. On the other hand, entropy minimization learns by reducing the entropy in the prediction of the model on the unlabelled data. One of + +the most prominent methods in this category is FixMatch [21]. The basic concept of FixMatch is to predict the pseudo-label for the unlabelled data from a weakly augmentation of the input and then utilize this as the supervision for a strongly augmented sample if the confidence of the pseudo-label is high. One main issue with this approach is its reliance on the quality of the pseudo-labels. Also, the fixed thresholding nature results in very low utilization of the unlabelled data as the low confidence prediction does not contribute towards the learning process. Recently, several methods have been proposed to increase the utilization of the unlabelled data by proposing variants of the thresholding concept, including Dash [27], FlexMatch [28], CoMatch [15], SimMatch [29], ConMatch [13]. + +Dash [27] selects unlabelled samples based on a criterion where their cross-entropy loss is smaller than an adjustable threshold value. FlexMatch [28] is another popular work that utilizes curriculum learning to adapt the threshold value, taking into account the class-wise learning status. This dynamic threshold is then applied to select pseudo-labels with high confidence. CoMatch [15] introduces a co-training framework that involves the interaction between class probabilities and embeddings. The embeddings impose a smoothness constraint on class probabilities to enhance the quality of pseudo-labels. These refined pseudo-labels are used as targets for training both the classification head with cross-entropy loss and the projection head with a graph-based contrastive loss. SimMatch [29] adeptly aligns similarity relationships at dual levels, utilizing a memory buffer for annotated examples to amplify the synergy between semantic and instance pseudo-labels. ConMatch [13] elevates model efficacy through the integration of confidence-guided consistency regularization. This approach tackles the hurdle of learning from a restricted pool of labelled data by promoting consistent predictions on unlabelled data, all the while taking into account the confidence levels associated with those predictions. SequenceMatch [17] enhances semi-supervised learning by minimizing prediction distribution divergence between weakly and strongly augmented examples. It underscores the significance of diverse augmentations and consistency constraints in the learning process. CHMatch [24] integrates instance-level prediction matching and contrastive graph-level matching through the use of a memory-bank-based adaptive threshold strategy. It employs hierarchical label-guided graph matching to enhance contrastive feature learning, providing a more robust approach to feature representation. While semi-supervised methods exhibit promising performance in the image domain, a notable gap exists in the SSL literature for point clouds, particularly in the context of classification tasks. + +# 2.2 Semi-supervised Learning in Point Cloud + +Semi-supervised learning has recently been explored by a few prior works on the 3D point cloud classification. For example, [4] introduces a semi-supervised learning framework, leveraging consistency constraints to ensure uniform predictions on both original and perturbed point clouds. This approach mitigates overfitting the limited labelled data available. Moreover, it incorporates pseudo-label generation to provide high-quality labels for unlabelled point clouds, thereby enhancing + +ing the supervision of the discriminative model. On the other hand, [7] presents a multi-modal semi-supervised learning framework featuring an instance-level consistency constraint and a multi-modal contrastive prototype (M2CP) loss. M2CP works towards minimizing intra-class feature variations by optimizing the distance to class prototypes for each object. ConFid [8] is another prominent work that specifically addresses class-imbalanced data scenarios, which is a prevalent challenge in the context of point clouds. ConFid takes into account class-level confidence through a resampling strategy designed to prevent bias towards high-confident classes. Nevertheless, all existing methods fall short of fully harnessing the potential of unlabeled data. This suggests a potential research gap in the realm of SSL-based 3D classification that maximizes the utilization of all available unlabeled data. + +# 3 Method + +# 3.1 Preliminaries on SSL + +Semi-supervised methods learn from a small amount of labelled data and a relatively large amount of unlabeled data in supervised and unsupervised settings, respectively. Let, $X_{lb} = (x_i,y_i)_{i=1}^n$ and $X_{ulb} = (x_i)_{i=1}^N$ represent the labelled and unlabeled sets with $n \ll N$ . Here, $x_i \in \mathcal{R}^{m \times 3}$ represents a 3D point cloud with $m$ points, and $y_i$ is the corresponding class label. Consequently, the semi-supervised learning can be formulated as: + +$$ +\min _ {\theta} \left[ \sum_ {\left(x _ {i}, y _ {i}\right) \in X _ {l b}} \mathcal {L} _ {s u p} \left(x _ {i}, y _ {i}, \theta\right) + \omega \sum_ {x _ {i} \in X _ {u l b}} \mathcal {L} _ {u n s u p} \left(x _ {i}, \theta\right) \right], \tag {1} +$$ + +Here, $\theta$ represents the learnable parameters, $\mathcal{L}_{sup}$ and $\mathcal{L}_{unsup}$ are supervised loss (cross-entropy loss, $H(x_{i},y_{i})$ ) and unsupervised loss. $\omega$ is the weight that balances the importance of the unsupervised loss. + +Unsupervised learning is the key component of semi-supervised learning, exhibiting variations across different SSL methods. Consistency regularization is one of the common unsupervised losses that is learned by forcing the predictions of the same sample to be consistent under different perturbations (augments) [1,2,20]. Another popular form of unsupervised learning is entropy minimization [21, 28], which learns from the unlabeled data by predicting a pseudo-label for each sample. Our method is built over the entropy minimization concept from FixMatch [21]. More specifically, FixMatch first generates a class prediction for an unlabeled sample from a weakly augmentation of the sample and considers it as a pseudo-label if the confidence of the prediction is above a pre-defined threshold. Finally, these high-confident pseudo-labels are used as supervision for a strong augmentation of the sample. + +Let, $x_w^{(i)} = \phi(x_{ulb}^i)$ and $x_s = \omega(x_{ulb}^i)$ be the weakly augmented and strongly augmented samples, and $p_m(p_z(x))$ be the output of the model, where, $p_z$ is the encoder and $p_m$ is the classifier. The unsupervised loss of FixMatch can be defined as follows: + +$$ +\mathcal {L} _ {u n s u p} = \frac {1}{\mu B} \sum_ {b = 1} ^ {\mu B} \mathbb {1} \left(m a x \left(p _ {m} \left(p _ {z} \left(x _ {w} ^ {(i)}\right)\right)\right) \geq \tau\right). +$$ + +$$ +H \left(\operatorname {a r g m a x} \left(p _ {m} \left(p _ {z} \left(x _ {w} ^ {(i)}\right)\right)\right), p _ {m} \left(p _ {z} \left(x _ {s} ^ {(i)}\right)\right)\right), \tag {2} +$$ + +where $\tau$ is the fixed confidence threshold, $\mu$ is the ratio of unlabelled to labelled batch size, $B$ is the batch size and $H$ represents the cross-entropy loss function. + +Nevertheless, a fixed (high) threshold results in under-utilization of the unlabeled data as the model does not utilize the low-confident samples. To address this, FlexMatch [28] and ConFid [8] propose dynamic pseudo labelling to adjust the threshold value considering the class-wise learning status by curriculum learning. In this context, the learning status refers to the ratio of predicted labels to the target label of a class. Specifically, the threshold value is low for high learning status classes to encourage the learning process, and vice-versa. Yet, the model does not utilize all the available unlabeled samples. Following, we describe our proposed solution, AllMatch, which effectively utilizes all the unlabeled samples for learning. + +# 3.2 AllMatch + +AllMatch consists of three components, all aimed towards improving the utilization of the unlabelled data: adaptive hard augmentation, inverse learning and contrastive learning. Following, we discuss each of the components in detail. + +Adaptive hard augmentation (AHA). One limitation of the high confidence-based thresholding method is that the selected (highly confident) samples are already well learned by the model [9]. As a result, the loss for these samples is very low and, therefore, does not contribute towards the learning of the model. Following [9], we refer to these high-confident samples as easy samples and propose an adaptive hard augmentation (AHA) module to further utilize the easy samples. The basic idea is to apply relatively hard augmentations on the easy samples to introduce further regularization while applying the usual strong augmentations for the remaining samples. Note that the alternation between extra hard augmentation and strong augmentation plays a crucial role, as excess augmentation can potentially have a detrimental effect on the model. While the role of hard augmentation is extensively studied in the image semi-supervised learning literature [9], it's not well explored in 3D point clouds. + +We define the easy samples based on a historical loss computed until the current epoch $t$ . More specifically, we calculate the historical loss for the $i - th$ sample as the exponential moving average (EMA): + +$$ +\mathcal {H} _ {i} ^ {t} = (1 - \kappa) \cdot \mathcal {H} _ {i} ^ {t - 1} + \kappa \cdot l _ {i} ^ {t}, \tag {3} +$$ + +where, $l_i^t$ is computed as: + +$$ +l _ {i} ^ {t} = H \left(\operatorname {a r g m a x} \left(p _ {m} \left(p _ {z} \left(x _ {w} ^ {(i)}\right)\right)\right), p _ {m} \left(p _ {z} \left(x _ {s} ^ {(i)}\right)\right)\right), \tag {4} +$$ + +The lower historical loss for sample $i$ indicates an easy sample on which we apply additional hard augmentations. To divide the samples into easy and hard samples based on the historic loss, we utilize the OTSU [18] function that returns a binary indicator $\mathcal{T}_i$ for each sample. Here, $\mathcal{T}_i = 0$ indicates easy sample, and $\mathcal{T}_i = 1$ indicates hard sample. Finally, for an easy sample, we apply a series of transformations to act as hard augmentation, including random scaling, rotation, translation and jitters. The AHA module can be represented as: + +$$ +A u g m e n t e d \operatorname {s a m p l e} \left(x _ {i}\right) = \left\{ \begin{array}{l} \mathcal {K} \left(x _ {i}\right), \mathcal {T} _ {i} = 1 \\ \mathcal {K} ^ {\prime} \left(x _ {i}\right), \mathcal {T} _ {i} = 0, \end{array} \right. \tag {5} +$$ + +Here, $\mathcal{K}'(x_i)$ represents the extra hard augmentation, while $\mathcal{K}(x_i)$ represents hard augmentation. In the implementation, we start applying the AHA module after certain epochs of training, defined by 'warm-up epochs.' Since the loss is relatively high for all samples at the start of training, adding the AHA from the start of training does not add any benefit. + +Inverse learning. Another challenge in pseudo-labeling-based semi-supervised learning comes from the ambiguity in the predictions of the models. More specifically, the samples with low confidence (high ambiguity) are discarded by the pseudo-labeling concept. These low-confident samples do not contribute to the model's learning process, as pseudo-labels cannot be assigned to them. Consequently, a significant number of unlabelled samples go unused. However, these neglected unlabelled samples can be re-purposed to optimize the model inversely by learning what not to learn. + +As demonstrated in [6] for SSL in the image domain, after a certain number of training iterations, the correct classes are situated in one of the top-k predictions (i.e., the $k$ classes with the highest predicted probabilities) of the model. In essence, the model is extremely confident in its predictions for containing the right class in one of these top-k classes. Therefore, it is advantageous to treat the remaining classes (those outside the top-k predictions) as wrong class for the input. Motivated by [6], we incorporate inverse learning, which learns to avoid predicting such classes. + +For Inverse learning, following the convention of FixMatch, we first predict a pseudo-label from a weakly augmented sample and find the value of $k$ for which the model achieves 100% accuracy on the strongly augmented samples at the current epoch. Then, we sort the classes in order of highest to lowest confidence using a ranking function, Rank. Finally, for the classes with $\text{Rank} > k$ we perform inverse learning on the strongly augmented samples as: + +$$ +\mathcal {L} _ {i n v} = - \frac {1}{B} \sum_ {i = 1} ^ {B} \sum_ {c = 1} ^ {C} \mathbb {1} [ R a n k (p _ {m} (p _ {z} (x _ {w} ^ {(i)}))) > k ] \cdot \log (1 - p _ {m} (p _ {z} (x _ {s} ^ {(i)}))), \quad (6) +$$ + +Contrastive learning (CL). While the AHA and inverse learning module increase the utilization of the unlabeled data, the samples that are neither very + +high-confident nor very low-confident are not utilized by any of the above modules. To ensure learning from the remainder of the sample, we incorporate a contrastive loss on the unlabelled set that learns from all the samples in an unsupervised setting. Contrastive methods learn from positive and negative samples, with the aim of pushing the positive pairs closer in the embedding space and moving them away from the negative sample. In this context, positive samples are the perturbation of the same sample, while all other samples are considered negative. Contrastive learning has shown remarkable success in learning representation in different computer vision domains [5,11,20]. Since contrastive learning does not require labels, it ensures total usage of unlabelled data. + +For each unlabelled sample, $x_{ulb}^{(i)} \in X_{ulb}$ , a weak perturbation $\phi$ and a strong perturbation $\omega$ is applied to generate a positive pair. In our case, we apply rotation and random scale as weak augmentation, and for strong augmentation, a couple of different augmentations (e.g. jitter, translation, rotation, random scale) are randomly applied. The augmented samples are then fed to the encoder and projection head that generates the embedding $z_{i} = p_{z}(y|x_{ulb_{i}})$ , where $[z_{w_i},z_{s_i}] \in z_i$ . Finally, the unsupervised contrastive loss [5] function can be described as: + +$$ +\mathcal {L} _ {c o n} = - \frac {1}{2 B} \sum_ {i = 1} ^ {2 B} \log \frac {\exp \left(z _ {i} , z _ {\kappa (i)} / \tau\right)}{\sum_ {k = 1} ^ {2 B} \mathbb {1} _ {[ k \neq i ]} \exp \left(z _ {i} , z _ {k} / \tau\right)}, \tag {7} +$$ + +where, $\kappa (i)$ is the index of the second augmented sample, $\mathbb{1}_{[k\neq i]}$ is an indicator function which returns 1 when $k$ is not equal to $i$ , and 0 otherwise. $\tau$ is a temperature parameter. Note that the pair samples are the same as the ones used for the unsupervised loss mentioned above. So, the contrastive loss does not increase the computational complexity. + +Additionally, we utilize a modified supervised version of contrastive loss (supervised contrastive loss [12]) on the labelled set. Like the unsupervised contrastive loss, the supervised contrastive loss learns from the augmented positive and negative samples. However, the additional label information benefits the model by pushing together samples that belong to the same class. The supervised contrastive loss can be formulated as follows: + +$$ +\mathcal {L} _ {s u p c o n} = \sum_ {i = 1} ^ {2 B} - \frac {1}{2 B _ {y _ {i}} - 1} \sum_ {j = 1} ^ {2 B} \mathbb {1} _ {[ i \neq j ]} \cdot \mathbb {1} _ {[ y _ {i} = y _ {j} ]} \cdot \log \frac {\exp (z _ {i} , z _ {j} / \tau)}{\sum_ {k = 1} ^ {2 B} \mathbb {1} _ {[ k \neq i ]} \exp (z _ {i} , z _ {k} / \tau)}, \tag {8} +$$ + +where, $y_{i}$ represents class label of sample $i$ . $\mathbb{1}_{[y_i = y_j]}$ is an indicator function that returns 1 when the samples $i$ and $j$ belongs to same class label. $2B_{y_i} - 1$ represents number of positive samples from class $y_{i}$ . + +# 3.3 Total Loss + +Finally, the total loss of AllMatch is the sum of all the described above: + +$$ +\mathcal {L} = \mathcal {L} _ {\text {s u p}} + \mathcal {L} _ {\text {u n s u p}} + \alpha \cdot \mathcal {L} _ {\text {s u p c o n}} + \beta \cdot \mathcal {L} _ {\text {c o n}} + \gamma \cdot \mathcal {L} _ {\text {i n v}}, \tag {9} +$$ + +Algorithm 1: AllMatch Algorithm +Input: Labelled batch $\mathcal{B}_l = \{(x_i,y_i)\}^M$ , unlabelled batch $\mathcal{B}_u = \{u_i\} ^N$ +1 Apply AHA to $\mathcal{B}_l$ as Eq. 5 +2 $l_{sup} = \mathcal{L}_{sup}(\mathcal{B}_l)$ +3 $l_{unsup} = \mathcal{L}_{unsup}(\mathcal{B}_u)$ // via Eq. 2 +4 $l_{con} = \mathcal{L}_{con}(\mathcal{B}_u)$ // via Eq. 7 +5 $l_{supcon} = \mathcal{L}_{supcon}(\mathcal{B}_l)$ // via Eq. 8 +6 for $i\gets 1$ to $N$ do +7 Compute the rank using, $\operatorname {Rank}\big(p_m(p_z(x_w^{(i)}))$ for $c\gets 1$ to $C$ do +8 if $\operatorname {Rank}\big(p_m(p_z(x_w^{(i)}))\big) > k$ then +9 $l_{inv} + = \log \left(1 - p_m(p_z(x_s^{(i)}))\right)$ +10 end +11 end +12 Compute and update historical loss, $\mathcal{H}_i / /$ via Eq. 3 +13 Update mark $\tau_{i} = \mathbb{1}(\mathcal{H}_{i}\leq 0\mathrm{TSU}(H_{i}))$ +14 end +15 $l_{total} = l_{sup} + l_{unsup} + \alpha \cdot l_{supcon} + \beta \cdot l_{con} + \gamma \cdot l_{inv}$ + +Here, $\alpha, \beta$ and $\gamma$ are loss factors balancing the importance of each loss. We find optimal values of each factor from the empirical study described in Section 4.5. + +# 4 Experiments + +In this section, we discuss the experimental results of our study on the ModelNet40 and ScanobjectNN datasets. First, we discuss the main result, followed by an in-depth ablation study of our proposed modules and sensitivity analysis of different module-specific parameters. + +# 4.1 Implementation Details + +We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23]. For the implementation details and hyper-parameters, we nearly follow the existing SOTA, ConFid [8], for a fair comparison. We use PointTransformer [10] as the encoder. We train the model with SGD optimizer with a learning rate of 0.00005 for 350 epochs. The unlabelled to labelled batch size ratio is 4, and the labelled batch size is 24. We utilize rotation and random scale as weak augmentation and random scaling, rotation, translation and jitter as strong augmentation. Note that, as a geometric entity, the underline representation of the point clouds must remain invariant under specific transformations [19]. Thus, we only chose the augmentation methods that do not violate this special property of the point clouds. For the AHA module, various combinations of strong augmentation are applied as an additional hard augmentation to the easy samples. A detailed sensitivity analysis on the augmentation strength is discussed in Section 4.5. + +Table 1: Comparison of AllMatch with the SOTA methods in 3D object classification task on ModelNet40 dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy. + +
Method2%5%10%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]71.161.077.169.284.677.2
PL [14]69.759.678.369.085.177.7
Flex-PL [28]66.754.974.262.383.270.3
ConFid-PL [8]74.461.980.673.586.580.4
FixMatch [21]70.862.778.971.185.579.4
Dash [27]71.563.079.771.885.980.1
FlexMatch [28]70.161.280.570.486.278.7
ConFid-Match [8]73.864.182.174.387.882.5
AllMatch84.382.689.087.990.289.8
+ +# 4.2 Main Result + +The overall comparison to the previous works is presented in Tables 1 and 2 for ModelNet-40 and ScanObjectNN datasets, respectively. Here, PL [14], FixMatch [21], Dash [27], and FlexMatch [28] were initially proposed for the image domain and later adopted to the PointCloud, whereas ConFid [8] is specifically designed for the point cloud. The results for other prior works are directly adopted from the reported results in ConFid [8]. Following the experimental setups of previous literature on this task, we report the results for different amounts of labelled samples. More specifically, we evaluate the performance on three different sizes of labelled sets: $2\%$ , $5\%$ , and $10\%$ for the ModelNet40 dataset and $1\%$ , $2\%$ , and $5\%$ for the ScanObjectNN dataset. We report the overall accuracy and the mean of class-wise accuracy (mean accuracy) on the test set. + +As we observe from these tables, AllMatch outperforms SOTA by a significant margin across all sizes of unlabelled sets, demonstrating substantial improvement. For example, with only $2\%$ labelled data from ModelNet40 (Table 1), AllMatch outperforms ConFid by a notable $10.48\%$ and $18.52\%$ in overall and mean accuracy. While we also see considerable improvements for $5\%$ and $10\%$ data, the biggest improvement is observed when the least amount of labelled data $(2\%)$ is utilized. This indicates the effectiveness of AllMatch in learning from a very small amount of labelled data. + +Table 2 illustrates a similar on the ScanObjectNN dataset. With only $1\%$ of the labelled set, AllMatch outperforms the SOTA by a superior $11.20\%$ on overall accuracy and $14.67\%$ on mean accuracy. The maximum performance gain is again observed for the least amount of labelled samples. + +Table 2: Comparison of AllMatch with the SOTA methods in 3D object classification task on ScanObjectNN dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy. + +
Method1%2%5%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]32.126.144.736.556.650.0
PL [14]31.225.847.538.658.151.5
Flex-PL [28]29.224.247.237.660.151.9
Confid-PL [8]32.627.148.841.563.155.2
FixMatch [21]33.527.647.439.959.452.4
Dash [27]35.129.350.344.162.860.3
FlexMatch [28]34.226.248.539.763.457.2
ConFid-Match [8]38.232.757.048.669.465.5
AllMatch49.447.460.858.977.576.0
+ +# 4.3 Ablation Study + +In this section, we perform a detailed ablation study to understand the importance of different components in our proposed method. We start with the main ablation on the 3 main components of AllMatch, then perform another ablation on the contrastive learning approach. + +Main ablation. Table 3 presents the results for the main ablation study. Here, we ablate all the combinations of the three main components of + +AllMatch: adaptive hard augmentation (AHA), inverse learning and contrastive learning (CL). First, we drop these modules individually and then in groups to investigate their significance on overall performance. We perform this study with $2\%$ of the labelled data and report the overall accuracy (OA). + +As we observe from this table, when we drop the AHA module individually, the method's performance declines by $4.29\%$ . This is considerably higher than the drops observed by dropping inverse learning or contrastive loss, making AHA the most important module in AllMatch. We find the inverse learning to be the second most important component, removing which results in a $3.77\%$ drop in accuracy. Finally, we find that contrastive learning also plays a critical role. Removing the contrastive learning also results in a $1.34\%$ drop in accuracy. We find similar trends when two modules are removed at a time. We observe a performance drop of $6.37\%$ when we remove both the AHA and inverse learning modules. Similarly, removing the AHA and contrastive learning module results in a $4.9\%$ decline in AllMatch's performance. The least accuracy we find by utilizing a single component is $77.9\%$ with contrastive learning. Finally, we find + +Table 3: Ablation study of different proposed components of AllMatch on ModelNet40. + +
Inv. lear.AHACLOA
✓✓✓84.28
✓✓82.94
✓✓79.98
✓✓80.50
✓77.90
✓79.37
✓80.10
74.80
+ +that removing all components drastically drops the performance by $74.8\%$ . This further shows the importance of each of the components in AllMatch. + +Ablation on contrastive learning. Next, we perform another study on our contrastive learning module, which consists of supervised and self-supervised contrastive loss. Here, we perform another ablation study by removing the contrastive learning components in different combinations. Similar to the previous study, we do this study on $2\%$ of labelled data from ModelNet40. The results of this study are presented in Table 4. As we find from this table, removing both of the components results in + +Table 4: Ablation study of contrastive loss components of AllMatch on ModelNet40 dataset. + +
Sup.Unsup.OA
✓✓84.28
✓83.47
✓83.06
82.94
+ +a considerable drop in performance, with unsupervised contrastive loss having a greater impact on the final performance. More specifically, when both the supervised and unsupervised contrastive losses are employed, AllMatch achieves its highest performance, $84.28\%$ . By dropping the unsupervised contrastive loss, the method's overall accuracy drops sharply by $1.21\%$ . However, when the supervised loss is removed, the overall accuracy declines by $0.8\%$ . This proves AllMatch is gaining better learning signals from the unsupervised contrastive loss component. Finally, when both contrastive losses are removed, AllMatch returns with AHA and inverse learning setting with an overall loss of $82.94\%$ . + +# 4.4 Performance on Increased Labelled Set Size + +In this section, we study the performance of different amounts of labelled data. Specifically, we investigate how an increase in the amount of labelled data impacts performance. To this end, we increase the labelled set size to all labelled data with a $10\%$ interval (Figure 3). It is evident that when only a small amount of labelled data is available $(2\% -5\%)$ , the overall accuracy of AllMatch is relatively low and gradually increases until it reaches $10\%$ of the labelled set. With $10\%$ labelled data, the overall accuracy reaches $90.19\%$ , compared to $90.75\%$ with the whole labelled set. In other words, the performance with $10\%$ of labelled samples + +is almost close to the performance with $100\%$ of the labelled data. This again proves the fact that AllMatch properly utilizes all the unlabelled data, making it possible for $10\%$ labelled data to reach such performance. + +![](images/12b3d971477273c9c8eff240fe2cfea610cb1d21af7ab24116f18d37429db2de.jpg) +Fig. 3: Impact of labelled set size. + +# 4.5 Sensitivity Study + +In this section, we perform detailed sensitivity studies on different parameters of the AllMatch. Following, We discuss the details of these experiments. + +Table 5: Impact of different values of loss factors. + +
αOverall accuracy
0.284.28
0.583.38
1.081.96
+ +(a) $\alpha$ vs acc. + +
βOverall accuracy
0.284.28
0.583.46
1.081.24
+ +(b) $\beta$ vs acc. + +
γOverall accuracy
0.283.22
0.583.38
1.084.28
+ +(c) $\gamma$ vs acc. + +Loss factor. The final loss function for training AllMatch consists of multiple losses and includes weight factors to balance the impact of individual loss components. Table 5 illustrates the influence of different loss factors on AllMatch's overall performance. The experiments are conducted on the ModelNet40 dataset with $2\%$ of labelled data. It is observed that the overall accuracy of AllMatch is sensitive to the values of these factors. Specifically, lower loss factor values lead to higher performances for both supervised and unsupervised contrastive losses, while higher values for the inverse loss factor prove beneficial. This indicates that the inverse loss plays a more significant role in contributing to AllMatch's performance compared to the contrastive loss. + +Augmentation strength. Augmentation strength is an essential hyperparameter for the Adaptive Hard Augmentation (AHA) module of AllMatch. It indicates the combination of different types of augmentation randomly applied as an additional hard augmentation to the easy samples. In Figure 4, we evaluate the overall performance of AllMatch for different augmentation strengths ranging from 4 to 8. Here, the numbers represent the total number of transformations applied to a sample. As we find from Figure 4, the best result is observed for using 4 transformations. While the augmentations are essential for learning from easy samples, applying a very high number of augmentations makes the optimization of the model difficult. + +![](images/bee5edd3e26872c94ded6b0339cf8d5906d8c325c288a476b088042b900b9207.jpg) +Fig. 4: Sensitivity study on the augmentation strengths. + +Warm-up epoch for AHA. As discussed in the method section, the AHA module comes into effect after a certain epoch of training. Given that AHA introduces an additional hard augmentation to easy samples, the downstream task becomes challenging for the model. If AHA is applied right at the beginning of the training process, it can negatively impact the model's performance. To this end, warm-up epochs enable the model to learn representations from all samples efficiently during the initial training. As depicted in Figure 5, AllMatch shows superior performance when + +![](images/19767728cb121eb7d24a2fe433b0da72e446c29c8388fbfe28b2311e39f7660f.jpg) +Fig.5: Sensitivity study on the impact of different warm-up epochs. + +warmed up for 50 epochs. However, prolonged warm-up periods diminish performance, as they reduce the effective action period of AHA. + +Epoch and learning rate. Finally, we study two hyper-parameters that are important for the optimization of the model, epochs and learning rate. As depicted in Figure 6a, we observe that AllMatch's performance improves by increasing the number of epochs, reaching its peak at 350 epochs with a best performance of $84.28\%$ . However, extending the num + +![](images/7abb9ce8c59840611ab6cf534f02f417bd8fd82d4529a10bd931010b454cf87f.jpg) +(a) Epochh vs Acc. +Fig.6: Sensitivity study of epoch and learning rate on ModelNet40. + +![](images/4bfdc45e5abac01d82daf2e30ec491c898dbd5d07e0c502297499ecd0bbab700.jpg) +(b) LR vs Acc. + +ber of epochs beyond this point results in a decline in performance. This is considerably lower than the previous SOTA, which requires 500 epochs of training. This further shows the benefit of utilizing the unlabelled data properly. In Figure 6b, we analyze the impact of different learning rates on AllMatch's performance. Notably, lower learning rates contribute to improved performance, whereas higher values lead to a collapse in the model's performance. For instance, at a learning rate of 0.0005, AllMatch achieves only $12\%$ overall accuracy, emphasizing the sensitivity of the model's performance to the choice of learning rate. + +# 5 Conclusion + +In this work, we identify that existing 3D semi-supervised techniques fail to capitalize the whole unlabelled data. To solve this issue, we introduce AllMatch, a novel semi-supervised method for point cloud classification that effectively utilizes the entire unlabelled set to improve the learnt representation. Comprised of adaptive hard augmentation, inverse learning, and contrastive learning components, AllMatch outperforms existing SOTA methods by a significant margin, showcasing superior performance even with minimal (1%) labelled sets. Remarkably, AllMatch, with just $10\%$ of the labelled set, attains a performance close to the fully supervised learning with all samples, underscoring its efficiency in minimizing reliance on labelled data. + +Limitations. While our proposed method has made significant improvement in efficiently leveraging the entire unlabelled set, there are still opportunities for further exploration in this promising direction. In the AHA module, we successfully incorporated selected transformation-invariant augmentation techniques, showcasing a positive step forward. Expanding our exploration to encompass a more diverse range of augmentation methods could prove to be a fruitful avenue for additional advancements. Furthermore, we only explored contrastive learning as the self-supervised module to ensure the utilization of all unlabelled samples, leaving room for exploring different versions and alternatives of contrastive loss. + +# References + +1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution matching and augmentation anchoring. In: ICLR (2019) +2. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. NeurIPS (2019) +3. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality tradeoff in semi-supervised learning. In: ICLR (2022) +4. Chen, L., Zhang, Y., Lin, Y., Jiang, M., Huang, Y., Lei, Y.: Consistency-based semi-supervised learning for point cloud classification. In: PRAI. pp. 440-445 (2021) +5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020) +6. Chen, Y., Tan, X., Zhao, B., Chen, Z., Song, R., Liang, J., Lu, X.: Boosting semi-supervised learning by exploiting all unlabeled data. In: CVPR. pp. 7548-7557 (2023) +7. Chen, Z., Jing, L.: Multimodal semi-supervised learning for 3d objects. In: BMVC (2021) +8. Chen, Z., Jing, L., Yang, L., Li, Y., Li, B.: Class-level confidence based 3d semi-supervised learning. In: WACV. pp. 633-642 (2023) +9. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: CVPR. pp. 15880-15889 (2023) +10. Guo, M.H., Cai, J.X., Liu, Z.N., Mu, T.J., Martin, R.R., Hu, S.M.: Pct: Point cloud transformer. Computational Visual Media 7, 187-199 (2021) +1. Jiang, L., Shi, S., Tian, Z., Lai, X., Liu, S., Fu, C.W., Jia, J.: Guided point contrastive learning for semi-supervised point cloud semantic segmentation. In: ICCV. pp. 6423-6432 (2021) +2. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS pp. 18661-18673 (2020) +3. Kim, J., Min, Y., Kim, D., Lee, G., Seo, J., Ryoo, K., Kim, S.: Conmatch: Semi-supervised learning with confidence-guided consistency regularization. In: ECCV. pp. 674-690 (2022) +4. Lee, D.H., et al.: Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks. In: Workshop on challenges in representation learning, ICML. p. 896 (2013) +5. Li, J., Xiong, C., Hoi, S.C.: Comatch: Semi-supervised learning with contrastive graph regularization. In: ICCV. pp. 9475-9484 (2021) +6. Liu, F., Lin, G., Foo, C.S., Joshi, C.K., Lin, J.: Point discriminative learning for data-efficient 3d point cloud analysis. In: IEEE Int. Conf. on 3D Vision. pp. 42-51 (2022) +7. Nguyen, K.B.: Sequencematch: Revisiting the design of weak-strong augmentations for semi-supervised learning. In: WACV. pp. 96-106 (2024) +8. Otsu, N.: A threshold selection method from gray-level histograms. TSMC 9, 62-66 (1979) +9. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: CVPR. pp. 652-660 (2017) + +20. Roy, S., Etemad, A.: Scaling up semi-supervised learning with unconstrained unlabelled data. In: AAAI. pp. 14847-14856 (2024) +21. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. NeurIPS pp. 596-608 (2020) +22. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. In: NeurIPS. pp. 1195–1204 (2017) +23. Uy, M.A., Pham, Q.H., Hua, B.S., Nguyen, D.T., Yeung, S.K.: Revisiting point cloud classification: A new benchmark dataset and classification model on real-world data. In: ICCV. pp. 1588-1597 (2019) +24. Wu, J., Yang, H., Gan, T., Ding, N., Jiang, F., Nie, L.: Chmatch: Contrastive hierarchical matching and robust adaptive threshold boosted semi-supervised learning. In: CVPR. pp. 15762-15772 (2023) +25. Wu, Z., Song, S., Khosla, A., Yu, F., Zhang, L., Tang, X., Xiao, J.: 3d shapenets: A deep representation for volumetric shapes. In: CVPR. pp. 1912-1920 (2015) +26. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. In: NeurIPS. pp. 6256-6268 (2020) +27. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: ICML. pp. 11525-11536 (2021) +28. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. NeurIPS pp. 18408-18419 (2021) +29. Zheng, M., You, S., Huang, L., Wang, F., Qian, C., Xu, C.: Simmatch: Semi-supervised learning with similarity matching. In: CVPR. pp. 14471-14481 (2022) \ No newline at end of file diff --git a/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/images.zip b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..07076dedb620a1ee1233633d10b52b2319f1d9fe --- /dev/null +++ b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f95a8343c0483de7addcea9cc81ed80534eb616dd03d0fa56d120cedd0c615c8 +size 313229 diff --git a/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/layout.json b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..a0338afb874f8ee1b2c091ee55747b50085dd79d --- /dev/null +++ b/2024/Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data/layout.json @@ -0,0 +1,9127 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 156, + 111, + 459, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 111, + 459, + 148 + ], + "spans": [ + { + "bbox": [ + 156, + 111, + 459, + 148 + ], + "type": "text", + "content": "Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 190, + 168, + 420, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 168, + 420, + 180 + ], + "spans": [ + { + "bbox": [ + 190, + 168, + 420, + 180 + ], + "type": "text", + "content": "Sneha Paul, Zachary Patterson, and Nizar Bouguila" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 189, + 190, + 423, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 189, + 190, + 423, + 201 + ], + "spans": [ + { + "bbox": [ + 189, + 190, + 423, + 201 + ], + "type": "text", + "content": "Concordia Institute for Information Systems Engineering," + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 225, + 202, + 389, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 202, + 389, + 213 + ], + "spans": [ + { + "bbox": [ + 225, + 202, + 389, + 213 + ], + "type": "text", + "content": "Concordia University, Montreal, Canada" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 239, + 213, + 373, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 213, + 373, + 223 + ], + "spans": [ + { + "bbox": [ + 239, + 213, + 373, + 223 + ], + "type": "text", + "content": "sneha.paul@mail.concordia.ca" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 196, + 224, + 417, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 196, + 224, + 417, + 234 + ], + "spans": [ + { + "bbox": [ + 196, + 224, + 417, + 234 + ], + "type": "text", + "content": "{zachary.patterson,nizar.bouguila}@concordia.ca" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "spans": [ + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "text", + "content": "Abstract. Semi-supervised learning (SSL) has shown its effectiveness in learning effective 3D representation from a small amount of labelled data while utilizing large unlabelled data. Traditional semi-supervised approaches rely on the fundamental concept of predicting pseudo-labels for unlabelled data and incorporating them into the learning process. However, we identify that the existing methods do not fully utilize all the unlabelled samples and consequently limit their potential performance. To address this issue, we propose AllMatch, a novel SSL-based 3D classification framework that effectively utilizes all the unlabelled samples. AllMatch comprises three modules: (1) an adaptive hard augmentation module that applies relatively hard augmentations to the high-confident unlabelled samples with lower loss values, thereby enhancing the contribution of such samples, (2) an inverse learning module that further improves the utilization of unlabelled data by learning what not to learn, and (3) a contrastive learning module that ensures learning from all the samples in both supervised and unsupervised settings. Comprehensive experiments on two popular 3D datasets demonstrate a performance improvement of up to " + }, + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "inline_equation", + "content": "11.2\\%" + }, + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "text", + "content": " labelled data, surpassing the SOTA by a significant margin. Furthermore, AllMatch exhibits its efficiency in effectively leveraging all the unlabelled data, demonstrated by the fact that only " + }, + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 160, + 266, + 452, + 518 + ], + "type": "text", + "content": " of labelled data reaches nearly the same performance as fully-supervised learning with all labelled data. The code of our work is available at: github.com/snehaputul/AllMatch." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 160, + 529, + 425, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 529, + 425, + 541 + ], + "spans": [ + { + "bbox": [ + 160, + 529, + 425, + 541 + ], + "type": "text", + "content": "Keywords: Semi-supervised Learning " + }, + { + "bbox": [ + 160, + 529, + 425, + 541 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 529, + 425, + 541 + ], + "type": "text", + "content": " Point Cloud " + }, + { + "bbox": [ + 160, + 529, + 425, + 541 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 529, + 425, + 541 + ], + "type": "text", + "content": " 3D Vision" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 562, + 229, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 562, + 229, + 574 + ], + "spans": [ + { + "bbox": [ + 133, + 562, + 229, + 574 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 581, + 339, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 581, + 339, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 581, + 339, + 665 + ], + "type": "text", + "content": "In the realm of 3D computer vision, Point Cloud applications are on the rise, finding extensive use in diverse domains. This increasing popularity of Point Cloud applications across various 3D computer vision domains has heightened the demand for annotated data, a resource-intensive and expensive task [16]. To tackle this" + } + ] + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 347, + 550, + 481, + 649 + ], + "blocks": [ + { + "bbox": [ + 347, + 550, + 481, + 649 + ], + "lines": [ + { + "bbox": [ + 347, + 550, + 481, + 649 + ], + "spans": [ + { + "bbox": [ + 347, + 550, + 481, + 649 + ], + "type": "image", + "image_path": "9a3eeb2f8def16ca97aeb0d67e8f6c55c154ba18f45da9b9510e645faaab9ac2.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 346, + 658, + 480, + 681 + ], + "lines": [ + { + "bbox": [ + 346, + 658, + 480, + 681 + ], + "spans": [ + { + "bbox": [ + 346, + 658, + 480, + 681 + ], + "type": "text", + "content": "Fig.1: Performance in comparison to unlabelled data usage." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": "issue, 3D semi-supervised learning (SSL) emerges as a promising avenue. By capitalizing on scarce labelled data in conjunction with abundant unlabelled data, this approach has demonstrated its efficacy in different computer vision applications, including 3D object recognition. Most popular forms of SSL (e.g. [21], [28]) involve predicting pseudo-labels for the unlabelled data and using only the high-confident predictions for learning. However, due to the hand-designed nature of the high-confidence-based filtering, most of the unlabelled samples never contribute to the learning (Figure 1)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 218, + 299, + 420 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 218, + 299, + 420 + ], + "spans": [ + { + "bbox": [ + 130, + 218, + 299, + 420 + ], + "type": "text", + "content": "Some of the more recent works propose different techniques to increase the number of unlabelled samples the model learns from. For example, FlexMatch [28] introduced a dynamic threshold strategy, where the threshold value is adjusted according to the model's learning status using curriculum learning. SoftMatch [3] proposed a trade-off between quality and quantity to increase unlabelled data usage. While there has been some progress in this direction, these methods are specially developed for the image domain and have not been explored in the context of 3D SSL. Furthermore, as shown in Figure" + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 312, + 227, + 385, + 312 + ], + "blocks": [ + { + "bbox": [ + 312, + 227, + 385, + 312 + ], + "lines": [ + { + "bbox": [ + 312, + 227, + 385, + 312 + ], + "spans": [ + { + "bbox": [ + 312, + 227, + 385, + 312 + ], + "type": "image", + "image_path": "bd3afb67132dd7b47f7711309bb3dc8585394b17d26d01eb95dcdb6a841d2467.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 304, + 316, + 482, + 415 + ], + "lines": [ + { + "bbox": [ + 304, + 316, + 482, + 415 + ], + "spans": [ + { + "bbox": [ + 304, + 316, + 482, + 415 + ], + "type": "text", + "content": "Fig.2: (left) Pseudo label utilization over the training epochs by FixMatch and Confid. While ConFid does better utilization than FixMatch, none properly utilizes all unlabelled data. (right) Loss over training for high and low-confident pseudo-labels. The high-confident samples are selected for unsupervised learning, but low loss results in marginal contribution to learning." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 392, + 227, + 467, + 312 + ], + "blocks": [ + { + "bbox": [ + 392, + 227, + 467, + 312 + ], + "lines": [ + { + "bbox": [ + 392, + 227, + 467, + 312 + ], + "spans": [ + { + "bbox": [ + 392, + 227, + 467, + 312 + ], + "type": "image", + "image_path": "3d932bbc68df6f73f648193e708ab6d46885cf8bf6e011719f6e743d6afea006.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 420, + 482, + 481 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 420, + 482, + 481 + ], + "spans": [ + { + "bbox": [ + 130, + 420, + 482, + 481 + ], + "type": "text", + "content": "2 (left) for 3D SSL, FixMatch utilizes about " + }, + { + "bbox": [ + 130, + 420, + 482, + 481 + ], + "type": "inline_equation", + "content": "25\\%" + }, + { + "bbox": [ + 130, + 420, + 482, + 481 + ], + "type": "text", + "content": " of the unlabelled data, while the current state-of-the-art (SOTA) method, ConFid [8], utilizes about " + }, + { + "bbox": [ + 130, + 420, + 482, + 481 + ], + "type": "inline_equation", + "content": "76\\%" + }, + { + "bbox": [ + 130, + 420, + 482, + 481 + ], + "type": "text", + "content": " of the unlabelled data. Moreover, we find that the correctly predicted pseudo-labels do not contribute much towards the learning, as they have higher confidence in prediction and lower loss (Figure 2 (right))." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": "In this work, we propose a novel semi-supervised framework named AllMatch that handles the above-mentioned problems and ensures learning from all the unlabeled data. AllMatch consists of three modules, all of which improve different aspects of increasing unlabeled data usage. While the concepts of these modules are not entirely new, they have never been explored in 3D SSL, especially with the focus on increasing the utilization of unlabeled data. The modules in AllMatch are: (a) An adaptive hard augmentation(AHA) module that increases the augmentation strength of the high-confident unlabeled samples with lower loss. This module ensures better utilization of high-confident samples that the model has already learned, thus leaving no further contribution to the model's learning process. (b) An inverse learning module that further ensures better utilization of unlabeled samples by assigning inverse pseudo labels to the low-confident predictions and learning what not to learn. (c) A contrastive learning (CL) module that learns from all the unlabeled data in unsupervised learning settings. This module ensures that the samples excluded from pseudo-label-based learning also" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "contribute to the learning process by participating in CL. Additionally, we utilize a modified supervised contrastive loss [12] for learning from the labelled data in a similar learning setting as the unlabelled data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "text", + "content": "We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23], with different amounts of labelled sets. We compare AllMatch with the existing SSL methods and find that AllMatch outperforms the existing SOTA by up to " + }, + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "inline_equation", + "content": "11.2\\%" + }, + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "inline_equation", + "content": "10.45\\%" + }, + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "text", + "content": " on ScanObjectNN and ModelNet40 datasets, respectively, with a minimal amount of labelled data. AllMatch also shows superior performance with a lower amount of labelled set, indicating its effectiveness in utilizing all unlabelled samples. With our proposed method, only " + }, + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 152, + 482, + 344 + ], + "type": "text", + "content": " of the labelled data performs almost as well as in a fully supervised setting with all the labelled data. Furthermore, our method is more computationally efficient than the previous SOTA, ConFid [8], which requires 500 epochs of training compared to 250 in ours. We also conduct an in-depth ablation study and sensitivity analysis demonstrating the importance of all three components for AllMatch's superior performance. Here, the AHA module shows the highest impact on the model's performance, followed by inverse learning and contrastive learning modules. Our main contributions to this work can be summarized as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 353, + 480, + 518 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 353, + 479, + 386 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 353, + 479, + 386 + ], + "spans": [ + { + "bbox": [ + 138, + 353, + 479, + 386 + ], + "type": "text", + "content": "- We propose a novel semi-supervised 3D classification framework named All-Match that effectively utilizes the whole unlabelled set to improve the performance." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 388, + 480, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 388, + 480, + 434 + ], + "spans": [ + { + "bbox": [ + 138, + 388, + 480, + 434 + ], + "type": "text", + "content": "- We introduce an adaptive hard augmentation module that efficiently utilizes the higher-confident samples with lower loss and an inverse learning module to further boost the utilization of unlabelled samples by learning from low-confident predictions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 436, + 479, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 436, + 479, + 470 + ], + "spans": [ + { + "bbox": [ + 138, + 436, + 479, + 470 + ], + "type": "text", + "content": "- We introduce a contrastive learning module to ensure learning from the remainder of the unlabeled data that are not utilized by pseudo-label-based learning." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "spans": [ + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "text", + "content": "- We improve the SOTA for 3D semi-supervised learning by " + }, + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "inline_equation", + "content": "11.2\\%" + }, + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "inline_equation", + "content": "10.45\\%" + }, + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "text", + "content": " on the ScanobjectNN and ModelNet40 datasets, respectively. We also show that AllMatch achieves almost similar results in a fully-supervised setting with only " + }, + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 138, + 472, + 479, + 518 + ], + "type": "text", + "content": " of labelled data." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 537, + 237, + 550 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 537, + 237, + 550 + ], + "spans": [ + { + "bbox": [ + 132, + 537, + 237, + 550 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 562, + 291, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 562, + 291, + 574 + ], + "spans": [ + { + "bbox": [ + 132, + 562, + 291, + 574 + ], + "type": "text", + "content": "2.1 Semi-supervised Learning" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "There has been significant progress in semi-supervised learning in recent years, mostly for image representation learning. Most dominant approaches in semi-supervised learning can be divided into two main categories: consistency regularization [22, 26] and entropy minimization [1, 2, 21]. The consistency regularization learns by enforcing consistency in the prediction of the model under different perturbations. On the other hand, entropy minimization learns by reducing the entropy in the prediction of the model on the unlabelled data. One of" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 190, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 190, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "the most prominent methods in this category is FixMatch [21]. The basic concept of FixMatch is to predict the pseudo-label for the unlabelled data from a weakly augmentation of the input and then utilize this as the supervision for a strongly augmented sample if the confidence of the pseudo-label is high. One main issue with this approach is its reliance on the quality of the pseudo-labels. Also, the fixed thresholding nature results in very low utilization of the unlabelled data as the low confidence prediction does not contribute towards the learning process. Recently, several methods have been proposed to increase the utilization of the unlabelled data by proposing variants of the thresholding concept, including Dash [27], FlexMatch [28], CoMatch [15], SimMatch [29], ConMatch [13]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 559 + ], + "type": "text", + "content": "Dash [27] selects unlabelled samples based on a criterion where their cross-entropy loss is smaller than an adjustable threshold value. FlexMatch [28] is another popular work that utilizes curriculum learning to adapt the threshold value, taking into account the class-wise learning status. This dynamic threshold is then applied to select pseudo-labels with high confidence. CoMatch [15] introduces a co-training framework that involves the interaction between class probabilities and embeddings. The embeddings impose a smoothness constraint on class probabilities to enhance the quality of pseudo-labels. These refined pseudo-labels are used as targets for training both the classification head with cross-entropy loss and the projection head with a graph-based contrastive loss. SimMatch [29] adeptly aligns similarity relationships at dual levels, utilizing a memory buffer for annotated examples to amplify the synergy between semantic and instance pseudo-labels. ConMatch [13] elevates model efficacy through the integration of confidence-guided consistency regularization. This approach tackles the hurdle of learning from a restricted pool of labelled data by promoting consistent predictions on unlabelled data, all the while taking into account the confidence levels associated with those predictions. SequenceMatch [17] enhances semi-supervised learning by minimizing prediction distribution divergence between weakly and strongly augmented examples. It underscores the significance of diverse augmentations and consistency constraints in the learning process. CHMatch [24] integrates instance-level prediction matching and contrastive graph-level matching through the use of a memory-bank-based adaptive threshold strategy. It employs hierarchical label-guided graph matching to enhance contrastive feature learning, providing a more robust approach to feature representation. While semi-supervised methods exhibit promising performance in the image domain, a notable gap exists in the SSL literature for point clouds, particularly in the context of classification tasks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 574, + 369, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 574, + 369, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 574, + 369, + 588 + ], + "type": "text", + "content": "2.2 Semi-supervised Learning in Point Cloud" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Semi-supervised learning has recently been explored by a few prior works on the 3D point cloud classification. For example, [4] introduces a semi-supervised learning framework, leveraging consistency constraints to ensure uniform predictions on both original and perturbed point clouds. This approach mitigates overfitting the limited labelled data available. Moreover, it incorporates pseudo-label generation to provide high-quality labels for unlabelled point clouds, thereby enhancing" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": "ing the supervision of the discriminative model. On the other hand, [7] presents a multi-modal semi-supervised learning framework featuring an instance-level consistency constraint and a multi-modal contrastive prototype (M2CP) loss. M2CP works towards minimizing intra-class feature variations by optimizing the distance to class prototypes for each object. ConFid [8] is another prominent work that specifically addresses class-imbalanced data scenarios, which is a prevalent challenge in the context of point clouds. ConFid takes into account class-level confidence through a resampling strategy designed to prevent bias towards high-confident classes. Nevertheless, all existing methods fall short of fully harnessing the potential of unlabeled data. This suggests a potential research gap in the realm of SSL-based 3D classification that maximizes the utilization of all available unlabeled data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 278, + 202, + 291 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 278, + 202, + 291 + ], + "spans": [ + { + "bbox": [ + 132, + 278, + 202, + 291 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 304, + 268, + 316 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 268, + 316 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 268, + 316 + ], + "type": "text", + "content": "3.1 Preliminaries on SSL" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "content": "Semi-supervised methods learn from a small amount of labelled data and a relatively large amount of unlabeled data in supervised and unsupervised settings, respectively. Let, " + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "inline_equation", + "content": "X_{lb} = (x_i,y_i)_{i=1}^n" + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "inline_equation", + "content": "X_{ulb} = (x_i)_{i=1}^N" + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "content": " represent the labelled and unlabeled sets with " + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "inline_equation", + "content": "n \\ll N" + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "inline_equation", + "content": "x_i \\in \\mathcal{R}^{m \\times 3}" + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "content": " represents a 3D point cloud with " + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "content": " points, and " + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "inline_equation", + "content": "y_i" + }, + { + "bbox": [ + 130, + 323, + 482, + 396 + ], + "type": "text", + "content": " is the corresponding class label. Consequently, the semi-supervised learning can be formulated as:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 187, + 405, + 481, + 432 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 405, + 481, + 432 + ], + "spans": [ + { + "bbox": [ + 187, + 405, + 481, + 432 + ], + "type": "interline_equation", + "content": "\\min _ {\\theta} \\left[ \\sum_ {\\left(x _ {i}, y _ {i}\\right) \\in X _ {l b}} \\mathcal {L} _ {s u p} \\left(x _ {i}, y _ {i}, \\theta\\right) + \\omega \\sum_ {x _ {i} \\in X _ {u l b}} \\mathcal {L} _ {u n s u p} \\left(x _ {i}, \\theta\\right) \\right], \\tag {1}", + "image_path": "724eef286f3c5ea48cb6814da64a3db6f7e2ed3a7de25a9eebbc10974ccf1869.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "text", + "content": " represents the learnable parameters, " + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{sup}" + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{unsup}" + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "text", + "content": " are supervised loss (cross-entropy loss, " + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "inline_equation", + "content": "H(x_{i},y_{i})" + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "text", + "content": ") and unsupervised loss. " + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\omega" + }, + { + "bbox": [ + 130, + 437, + 482, + 472 + ], + "type": "text", + "content": " is the weight that balances the importance of the unsupervised loss." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 472, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 616 + ], + "type": "text", + "content": "Unsupervised learning is the key component of semi-supervised learning, exhibiting variations across different SSL methods. Consistency regularization is one of the common unsupervised losses that is learned by forcing the predictions of the same sample to be consistent under different perturbations (augments) [1,2,20]. Another popular form of unsupervised learning is entropy minimization [21, 28], which learns from the unlabeled data by predicting a pseudo-label for each sample. Our method is built over the entropy minimization concept from FixMatch [21]. More specifically, FixMatch first generates a class prediction for an unlabeled sample from a weakly augmentation of the sample and considers it as a pseudo-label if the confidence of the prediction is above a pre-defined threshold. Finally, these high-confident pseudo-labels are used as supervision for a strong augmentation of the sample." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "text", + "content": "Let, " + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "inline_equation", + "content": "x_w^{(i)} = \\phi(x_{ulb}^i)" + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "inline_equation", + "content": "x_s = \\omega(x_{ulb}^i)" + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "text", + "content": " be the weakly augmented and strongly augmented samples, and " + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "inline_equation", + "content": "p_m(p_z(x))" + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "text", + "content": " be the output of the model, where, " + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "inline_equation", + "content": "p_z" + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "text", + "content": " is the encoder and " + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "inline_equation", + "content": "p_m" + }, + { + "bbox": [ + 130, + 616, + 482, + 665 + ], + "type": "text", + "content": " is the classifier. The unsupervised loss of FixMatch can be defined as follows:" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 190, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 190, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 210, + 133, + 403, + 164 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 133, + 403, + 164 + ], + "spans": [ + { + "bbox": [ + 210, + 133, + 403, + 164 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {u n s u p} = \\frac {1}{\\mu B} \\sum_ {b = 1} ^ {\\mu B} \\mathbb {1} \\left(m a x \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right) \\geq \\tau\\right).", + "image_path": "87ca75e61cf3d68dfd8cd9441f2bcbf93341fcc17b713039583764c638e53e73.jpg" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 227, + 167, + 480, + 182 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 167, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 227, + 167, + 480, + 182 + ], + "type": "interline_equation", + "content": "H \\left(\\operatorname {a r g m a x} \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right), p _ {m} \\left(p _ {z} \\left(x _ {s} ^ {(i)}\\right)\\right)\\right), \\tag {2}", + "image_path": "5dffc498856ada0cafe87a1d4c918c6bf5a993985941665852ea071d940241ef.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "text", + "content": " is the fixed confidence threshold, " + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "text", + "content": " is the ratio of unlabelled to labelled batch size, " + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "inline_equation", + "content": "B" + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "text", + "content": " is the batch size and " + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 130, + 186, + 479, + 210 + ], + "type": "text", + "content": " represents the cross-entropy loss function." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 211, + 480, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 211, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 211, + 480, + 331 + ], + "type": "text", + "content": "Nevertheless, a fixed (high) threshold results in under-utilization of the unlabeled data as the model does not utilize the low-confident samples. To address this, FlexMatch [28] and ConFid [8] propose dynamic pseudo labelling to adjust the threshold value considering the class-wise learning status by curriculum learning. In this context, the learning status refers to the ratio of predicted labels to the target label of a class. Specifically, the threshold value is low for high learning status classes to encourage the learning process, and vice-versa. Yet, the model does not utilize all the available unlabeled samples. Following, we describe our proposed solution, AllMatch, which effectively utilizes all the unlabeled samples for learning." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 345, + 208, + 357 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 345, + 208, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 345, + 208, + 357 + ], + "type": "text", + "content": "3.2 AllMatch" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 362, + 479, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 362, + 479, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 479, + 399 + ], + "type": "text", + "content": "AllMatch consists of three components, all aimed towards improving the utilization of the unlabelled data: adaptive hard augmentation, inverse learning and contrastive learning. Following, we discuss each of the components in detail." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 413, + 480, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 480, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 480, + 568 + ], + "type": "text", + "content": "Adaptive hard augmentation (AHA). One limitation of the high confidence-based thresholding method is that the selected (highly confident) samples are already well learned by the model [9]. As a result, the loss for these samples is very low and, therefore, does not contribute towards the learning of the model. Following [9], we refer to these high-confident samples as easy samples and propose an adaptive hard augmentation (AHA) module to further utilize the easy samples. The basic idea is to apply relatively hard augmentations on the easy samples to introduce further regularization while applying the usual strong augmentations for the remaining samples. Note that the alternation between extra hard augmentation and strong augmentation plays a crucial role, as excess augmentation can potentially have a detrimental effect on the model. While the role of hard augmentation is extensively studied in the image semi-supervised learning literature [9], it's not well explored in 3D point clouds." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 569, + 479, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 479, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 479, + 605 + ], + "type": "text", + "content": "We define the easy samples based on a historical loss computed until the current epoch " + }, + { + "bbox": [ + 130, + 569, + 479, + 605 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 569, + 479, + 605 + ], + "type": "text", + "content": ". More specifically, we calculate the historical loss for the " + }, + { + "bbox": [ + 130, + 569, + 479, + 605 + ], + "type": "inline_equation", + "content": "i - th" + }, + { + "bbox": [ + 130, + 569, + 479, + 605 + ], + "type": "text", + "content": " sample as the exponential moving average (EMA):" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 247, + 610, + 480, + 624 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 610, + 480, + 624 + ], + "spans": [ + { + "bbox": [ + 247, + 610, + 480, + 624 + ], + "type": "interline_equation", + "content": "\\mathcal {H} _ {i} ^ {t} = (1 - \\kappa) \\cdot \\mathcal {H} _ {i} ^ {t - 1} + \\kappa \\cdot l _ {i} ^ {t}, \\tag {3}", + "image_path": "8becfbcd5df232bc620967f95d52ca0e24fc3ab3ff801c6ed21d69d5cd36b4c6.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 629, + 244, + 642 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 244, + 642 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 244, + 642 + ], + "type": "text", + "content": "where, " + }, + { + "bbox": [ + 132, + 629, + 244, + 642 + ], + "type": "inline_equation", + "content": "l_i^t" + }, + { + "bbox": [ + 132, + 629, + 244, + 642 + ], + "type": "text", + "content": " is computed as:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 208, + 652, + 480, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 652, + 480, + 667 + ], + "spans": [ + { + "bbox": [ + 208, + 652, + 480, + 667 + ], + "type": "interline_equation", + "content": "l _ {i} ^ {t} = H \\left(\\operatorname {a r g m a x} \\left(p _ {m} \\left(p _ {z} \\left(x _ {w} ^ {(i)}\\right)\\right)\\right), p _ {m} \\left(p _ {z} \\left(x _ {s} ^ {(i)}\\right)\\right)\\right), \\tag {4}", + "image_path": "f5060a0d2f42786e942c7c63b8519f32a7b4b0cda3bce68bfb23398ebf40e2fd.jpg" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "content": "The lower historical loss for sample " + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "content": " indicates an easy sample on which we apply additional hard augmentations. To divide the samples into easy and hard samples based on the historic loss, we utilize the OTSU [18] function that returns a binary indicator " + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "\\mathcal{T}_i" + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "content": " for each sample. Here, " + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "\\mathcal{T}_i = 0" + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "content": " indicates easy sample, and " + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "\\mathcal{T}_i = 1" + }, + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "content": " indicates hard sample. Finally, for an easy sample, we apply a series of transformations to act as hard augmentation, including random scaling, rotation, translation and jitters. The AHA module can be represented as:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 212, + 209, + 481, + 235 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 212, + 209, + 481, + 235 + ], + "spans": [ + { + "bbox": [ + 212, + 209, + 481, + 235 + ], + "type": "interline_equation", + "content": "A u g m e n t e d \\operatorname {s a m p l e} \\left(x _ {i}\\right) = \\left\\{ \\begin{array}{l} \\mathcal {K} \\left(x _ {i}\\right), \\mathcal {T} _ {i} = 1 \\\\ \\mathcal {K} ^ {\\prime} \\left(x _ {i}\\right), \\mathcal {T} _ {i} = 0, \\end{array} \\right. \\tag {5}", + "image_path": "4756b35e1bc4971291aa6a0e014f95080fde448682197d13fd75ff0c827930ac.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 238, + 482, + 298 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 238, + 482, + 298 + ], + "spans": [ + { + "bbox": [ + 131, + 238, + 482, + 298 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 131, + 238, + 482, + 298 + ], + "type": "inline_equation", + "content": "\\mathcal{K}'(x_i)" + }, + { + "bbox": [ + 131, + 238, + 482, + 298 + ], + "type": "text", + "content": " represents the extra hard augmentation, while " + }, + { + "bbox": [ + 131, + 238, + 482, + 298 + ], + "type": "inline_equation", + "content": "\\mathcal{K}(x_i)" + }, + { + "bbox": [ + 131, + 238, + 482, + 298 + ], + "type": "text", + "content": " represents hard augmentation. In the implementation, we start applying the AHA module after certain epochs of training, defined by 'warm-up epochs.' Since the loss is relatively high for all samples at the start of training, adding the AHA from the start of training does not add any benefit." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 314, + 482, + 409 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 409 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 409 + ], + "type": "text", + "content": "Inverse learning. Another challenge in pseudo-labeling-based semi-supervised learning comes from the ambiguity in the predictions of the models. More specifically, the samples with low confidence (high ambiguity) are discarded by the pseudo-labeling concept. These low-confident samples do not contribute to the model's learning process, as pseudo-labels cannot be assigned to them. Consequently, a significant number of unlabelled samples go unused. However, these neglected unlabelled samples can be re-purposed to optimize the model inversely by learning what not to learn." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 410, + 482, + 505 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 410, + 482, + 505 + ], + "spans": [ + { + "bbox": [ + 130, + 410, + 482, + 505 + ], + "type": "text", + "content": "As demonstrated in [6] for SSL in the image domain, after a certain number of training iterations, the correct classes are situated in one of the top-k predictions (i.e., the " + }, + { + "bbox": [ + 130, + 410, + 482, + 505 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 410, + 482, + 505 + ], + "type": "text", + "content": " classes with the highest predicted probabilities) of the model. In essence, the model is extremely confident in its predictions for containing the right class in one of these top-k classes. Therefore, it is advantageous to treat the remaining classes (those outside the top-k predictions) as wrong class for the input. Motivated by [6], we incorporate inverse learning, which learns to avoid predicting such classes." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 506, + 482, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 482, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 482, + 578 + ], + "type": "text", + "content": "For Inverse learning, following the convention of FixMatch, we first predict a pseudo-label from a weakly augmented sample and find the value of " + }, + { + "bbox": [ + 130, + 506, + 482, + 578 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 506, + 482, + 578 + ], + "type": "text", + "content": " for which the model achieves 100% accuracy on the strongly augmented samples at the current epoch. Then, we sort the classes in order of highest to lowest confidence using a ranking function, Rank. Finally, for the classes with " + }, + { + "bbox": [ + 130, + 506, + 482, + 578 + ], + "type": "inline_equation", + "content": "\\text{Rank} > k" + }, + { + "bbox": [ + 130, + 506, + 482, + 578 + ], + "type": "text", + "content": " we perform inverse learning on the strongly augmented samples as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 146, + 594, + 481, + 627 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 594, + 481, + 627 + ], + "spans": [ + { + "bbox": [ + 146, + 594, + 481, + 627 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {i n v} = - \\frac {1}{B} \\sum_ {i = 1} ^ {B} \\sum_ {c = 1} ^ {C} \\mathbb {1} [ R a n k (p _ {m} (p _ {z} (x _ {w} ^ {(i)}))) > k ] \\cdot \\log (1 - p _ {m} (p _ {z} (x _ {s} ^ {(i)}))), \\quad (6)", + "image_path": "0c03402f7ea73ce1252ba1e6f9598e77e91e6afd57b54e529648611425ce3fc1.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": "Contrastive learning (CL). While the AHA and inverse learning module increase the utilization of the unlabeled data, the samples that are neither very" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 190, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 190, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "high-confident nor very low-confident are not utilized by any of the above modules. To ensure learning from the remainder of the sample, we incorporate a contrastive loss on the unlabelled set that learns from all the samples in an unsupervised setting. Contrastive methods learn from positive and negative samples, with the aim of pushing the positive pairs closer in the embedding space and moving them away from the negative sample. In this context, positive samples are the perturbation of the same sample, while all other samples are considered negative. Contrastive learning has shown remarkable success in learning representation in different computer vision domains [5,11,20]. Since contrastive learning does not require labels, it ensures total usage of unlabelled data." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "text", + "content": "For each unlabelled sample, " + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "inline_equation", + "content": "x_{ulb}^{(i)} \\in X_{ulb}" + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "text", + "content": ", a weak perturbation " + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "text", + "content": " and a strong perturbation " + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "inline_equation", + "content": "\\omega" + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "text", + "content": " is applied to generate a positive pair. In our case, we apply rotation and random scale as weak augmentation, and for strong augmentation, a couple of different augmentations (e.g. jitter, translation, rotation, random scale) are randomly applied. The augmented samples are then fed to the encoder and projection head that generates the embedding " + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "inline_equation", + "content": "z_{i} = p_{z}(y|x_{ulb_{i}})" + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "inline_equation", + "content": "[z_{w_i},z_{s_i}] \\in z_i" + }, + { + "bbox": [ + 130, + 236, + 482, + 323 + ], + "type": "text", + "content": ". Finally, the unsupervised contrastive loss [5] function can be described as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 205, + 331, + 481, + 362 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 331, + 481, + 362 + ], + "spans": [ + { + "bbox": [ + 205, + 331, + 481, + 362 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {c o n} = - \\frac {1}{2 B} \\sum_ {i = 1} ^ {2 B} \\log \\frac {\\exp \\left(z _ {i} , z _ {\\kappa (i)} / \\tau\\right)}{\\sum_ {k = 1} ^ {2 B} \\mathbb {1} _ {[ k \\neq i ]} \\exp \\left(z _ {i} , z _ {k} / \\tau\\right)}, \\tag {7}", + "image_path": "88aa3455605991c694365644967cd41915ced9281e0ccd8307fa02502d99b9d9.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "text", + "content": "where, " + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "inline_equation", + "content": "\\kappa (i)" + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "text", + "content": " is the index of the second augmented sample, " + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "inline_equation", + "content": "\\mathbb{1}_{[k\\neq i]}" + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "text", + "content": " is an indicator function which returns 1 when " + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "text", + "content": " is not equal to " + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "text", + "content": ", and 0 otherwise. " + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 367, + 482, + 426 + ], + "type": "text", + "content": " is a temperature parameter. Note that the pair samples are the same as the ones used for the unsupervised loss mentioned above. So, the contrastive loss does not increase the computational complexity." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 427, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 427, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 427, + 482, + 498 + ], + "type": "text", + "content": "Additionally, we utilize a modified supervised version of contrastive loss (supervised contrastive loss [12]) on the labelled set. Like the unsupervised contrastive loss, the supervised contrastive loss learns from the augmented positive and negative samples. However, the additional label information benefits the model by pushing together samples that belong to the same class. The supervised contrastive loss can be formulated as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 517, + 481, + 552 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 517, + 481, + 552 + ], + "spans": [ + { + "bbox": [ + 138, + 517, + 481, + 552 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {s u p c o n} = \\sum_ {i = 1} ^ {2 B} - \\frac {1}{2 B _ {y _ {i}} - 1} \\sum_ {j = 1} ^ {2 B} \\mathbb {1} _ {[ i \\neq j ]} \\cdot \\mathbb {1} _ {[ y _ {i} = y _ {j} ]} \\cdot \\log \\frac {\\exp (z _ {i} , z _ {j} / \\tau)}{\\sum_ {k = 1} ^ {2 B} \\mathbb {1} _ {[ k \\neq i ]} \\exp (z _ {i} , z _ {k} / \\tau)}, \\tag {8}", + "image_path": "379669f2816550f2119ed2d6f57618c5160a7b73dbbeda1de0994b6f8ce94ad4.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "spans": [ + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": "where, " + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "inline_equation", + "content": "y_{i}" + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": " represents class label of sample " + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "inline_equation", + "content": "\\mathbb{1}_{[y_i = y_j]}" + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": " is an indicator function that returns 1 when the samples " + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": " belongs to same class label. " + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "inline_equation", + "content": "2B_{y_i} - 1" + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": " represents number of positive samples from class " + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "inline_equation", + "content": "y_{i}" + }, + { + "bbox": [ + 130, + 559, + 482, + 595 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 612, + 212, + 623 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 612, + 212, + 623 + ], + "spans": [ + { + "bbox": [ + 131, + 612, + 212, + 623 + ], + "type": "text", + "content": "3.3 Total Loss" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 632, + 448, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 632, + 448, + 643 + ], + "spans": [ + { + "bbox": [ + 131, + 632, + 448, + 643 + ], + "type": "text", + "content": "Finally, the total loss of AllMatch is the sum of all the described above:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 192, + 654, + 481, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 654, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 192, + 654, + 481, + 666 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {\\text {s u p}} + \\mathcal {L} _ {\\text {u n s u p}} + \\alpha \\cdot \\mathcal {L} _ {\\text {s u p c o n}} + \\beta \\cdot \\mathcal {L} _ {\\text {c o n}} + \\gamma \\cdot \\mathcal {L} _ {\\text {i n v}}, \\tag {9}", + "image_path": "5d5679830f0777d0cfd48fb5fb7c38a5bc46bff57d7def6c821c88fd42515fef.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 133, + 132, + 482, + 320 + ], + "blocks": [ + { + "bbox": [ + 139, + 118, + 299, + 130 + ], + "lines": [ + { + "bbox": [ + 139, + 118, + 299, + 130 + ], + "spans": [ + { + "bbox": [ + 139, + 118, + 299, + 130 + ], + "type": "text", + "content": "Algorithm 1: AllMatch Algorithm" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "lines": [ + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "spans": [ + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": "Input: Labelled batch " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\mathcal{B}_l = \\{(x_i,y_i)\\}^M" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " , unlabelled batch " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\mathcal{B}_u = \\{u_i\\} ^N" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " \n1 Apply AHA to " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\mathcal{B}_l" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " as Eq. 5 \n2 " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "l_{sup} = \\mathcal{L}_{sup}(\\mathcal{B}_l)" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " \n3 " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "l_{unsup} = \\mathcal{L}_{unsup}(\\mathcal{B}_u)" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " // via Eq. 2 \n4 " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "l_{con} = \\mathcal{L}_{con}(\\mathcal{B}_u)" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " // via Eq. 7 \n5 " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "l_{supcon} = \\mathcal{L}_{supcon}(\\mathcal{B}_l)" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " // via Eq. 8 \n6 for " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "i\\gets 1" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " do \n7 Compute the rank using, " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\operatorname {Rank}\\big(p_m(p_z(x_w^{(i)}))" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "c\\gets 1" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " do \n8 if " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\operatorname {Rank}\\big(p_m(p_z(x_w^{(i)}))\\big) > k" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " then \n9 " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "l_{inv} + = \\log \\left(1 - p_m(p_z(x_s^{(i)}))\\right)" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " \n10 end \n11 end \n12 Compute and update historical loss, " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\mathcal{H}_i / /" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " via Eq. 3 \n13 Update mark " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\tau_{i} = \\mathbb{1}(\\mathcal{H}_{i}\\leq 0\\mathrm{TSU}(H_{i}))" + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "text", + "content": " \n14 end \n15 " + }, + { + "bbox": [ + 133, + 132, + 482, + 320 + ], + "type": "inline_equation", + "content": "l_{total} = l_{sup} + l_{unsup} + \\alpha \\cdot l_{supcon} + \\beta \\cdot l_{con} + \\gamma \\cdot l_{inv}" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 130, + 345, + 480, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 345, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 345, + 480, + 369 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 130, + 345, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\alpha, \\beta" + }, + { + "bbox": [ + 130, + 345, + 480, + 369 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 345, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 345, + 480, + 369 + ], + "type": "text", + "content": " are loss factors balancing the importance of each loss. We find optimal values of each factor from the empirical study described in Section 4.5." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 388, + 229, + 402 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 388, + 229, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 388, + 229, + 402 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 412, + 480, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 412, + 480, + 460 + ], + "spans": [ + { + "bbox": [ + 130, + 412, + 480, + 460 + ], + "type": "text", + "content": "In this section, we discuss the experimental results of our study on the ModelNet40 and ScanobjectNN datasets. First, we discuss the main result, followed by an in-depth ablation study of our proposed modules and sensitivity analysis of different module-specific parameters." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 478, + 279, + 490 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 478, + 279, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 478, + 279, + 490 + ], + "type": "text", + "content": "4.1 Implementation Details" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 498, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 665 + ], + "type": "text", + "content": "We evaluate AllMatch on two popular point cloud datasets, ModelNet40 [25] and ScanObjectNN [23]. For the implementation details and hyper-parameters, we nearly follow the existing SOTA, ConFid [8], for a fair comparison. We use PointTransformer [10] as the encoder. We train the model with SGD optimizer with a learning rate of 0.00005 for 350 epochs. The unlabelled to labelled batch size ratio is 4, and the labelled batch size is 24. We utilize rotation and random scale as weak augmentation and random scaling, rotation, translation and jitter as strong augmentation. Note that, as a geometric entity, the underline representation of the point clouds must remain invariant under specific transformations [19]. Thus, we only chose the augmentation methods that do not violate this special property of the point clouds. For the AHA module, various combinations of strong augmentation are applied as an additional hard augmentation to the easy samples. A detailed sensitivity analysis on the augmentation strength is discussed in Section 4.5." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 190, + 90, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 90, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 190, + 90, + 447, + 102 + ], + "type": "text", + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 157, + 173, + 457, + 309 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": "Table 1: Comparison of AllMatch with the SOTA methods in 3D object classification task on ModelNet40 dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 157, + 173, + 457, + 309 + ], + "lines": [ + { + "bbox": [ + 157, + 173, + 457, + 309 + ], + "spans": [ + { + "bbox": [ + 157, + 173, + 457, + 309 + ], + "type": "table", + "html": "
Method2%5%10%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]71.161.077.169.284.677.2
PL [14]69.759.678.369.085.177.7
Flex-PL [28]66.754.974.262.383.270.3
ConFid-PL [8]74.461.980.673.586.580.4
FixMatch [21]70.862.778.971.185.579.4
Dash [27]71.563.079.771.885.980.1
FlexMatch [28]70.161.280.570.486.278.7
ConFid-Match [8]73.864.182.174.387.882.5
AllMatch84.382.689.087.990.289.8
", + "image_path": "01be1822bfcc2b82bd3f75b377aa30cd086c20e607b11408ddeb021ff37dacb9.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 331, + 223, + 342 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 331, + 223, + 342 + ], + "spans": [ + { + "bbox": [ + 132, + 331, + 223, + 342 + ], + "type": "text", + "content": "4.2 Main Result" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "content": "The overall comparison to the previous works is presented in Tables 1 and 2 for ModelNet-40 and ScanObjectNN datasets, respectively. Here, PL [14], FixMatch [21], Dash [27], and FlexMatch [28] were initially proposed for the image domain and later adopted to the PointCloud, whereas ConFid [8] is specifically designed for the point cloud. The results for other prior works are directly adopted from the reported results in ConFid [8]. Following the experimental setups of previous literature on this task, we report the results for different amounts of labelled samples. More specifically, we evaluate the performance on three different sizes of labelled sets: " + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "content": " for the ModelNet40 dataset and " + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 350, + 482, + 483 + ], + "type": "text", + "content": " for the ScanObjectNN dataset. We report the overall accuracy and the mean of class-wise accuracy (mean accuracy) on the test set." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "content": "As we observe from these tables, AllMatch outperforms SOTA by a significant margin across all sizes of unlabelled sets, demonstrating substantial improvement. For example, with only " + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "content": " labelled data from ModelNet40 (Table 1), AllMatch outperforms ConFid by a notable " + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "inline_equation", + "content": "10.48\\%" + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "inline_equation", + "content": "18.52\\%" + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "content": " in overall and mean accuracy. While we also see considerable improvements for " + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "content": " data, the biggest improvement is observed when the least amount of labelled data " + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "inline_equation", + "content": "(2\\%)" + }, + { + "bbox": [ + 130, + 483, + 482, + 578 + ], + "type": "text", + "content": " is utilized. This indicates the effectiveness of AllMatch in learning from a very small amount of labelled data." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "spans": [ + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "text", + "content": "Table 2 illustrates a similar on the ScanObjectNN dataset. With only " + }, + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "text", + "content": " of the labelled set, AllMatch outperforms the SOTA by a superior " + }, + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "inline_equation", + "content": "11.20\\%" + }, + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "text", + "content": " on overall accuracy and " + }, + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "inline_equation", + "content": "14.67\\%" + }, + { + "bbox": [ + 130, + 578, + 482, + 627 + ], + "type": "text", + "content": " on mean accuracy. The maximum performance gain is again observed for the least amount of labelled samples." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 157, + 173, + 457, + 309 + ], + "blocks": [ + { + "bbox": [ + 130, + 119, + 482, + 163 + ], + "lines": [ + { + "bbox": [ + 130, + 119, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 119, + 482, + 163 + ], + "type": "text", + "content": "Table 2: Comparison of AllMatch with the SOTA methods in 3D object classification task on ScanObjectNN dataset with different amounts of labelled sets. Results of the prior works are adopted from [8]. Here, 'Overall Acc' and 'Mean Acc' are the overall accuracy and the average of per-class accuracy." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 157, + 173, + 457, + 309 + ], + "lines": [ + { + "bbox": [ + 157, + 173, + 457, + 309 + ], + "spans": [ + { + "bbox": [ + 157, + 173, + 457, + 309 + ], + "type": "table", + "html": "
Method1%2%5%
Overall AccMean AccOverall AccMean AccOverall AccMean Acc
PCT [10]32.126.144.736.556.650.0
PL [14]31.225.847.538.658.151.5
Flex-PL [28]29.224.247.237.660.151.9
Confid-PL [8]32.627.148.841.563.155.2
FixMatch [21]33.527.647.439.959.452.4
Dash [27]35.129.350.344.162.860.3
FlexMatch [28]34.226.248.539.763.457.2
ConFid-Match [8]38.232.757.048.669.465.5
AllMatch49.447.460.858.977.576.0
", + "image_path": "21d6be4d1037a93702607d063cc4806e99174a7d5c49bef6e998da67ca362230.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 330, + 238, + 342 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 330, + 238, + 342 + ], + "spans": [ + { + "bbox": [ + 132, + 330, + 238, + 342 + ], + "type": "text", + "content": "4.3 Ablation Study" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 349, + 343, + 421 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 343, + 421 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 343, + 421 + ], + "type": "text", + "content": "In this section, we perform a detailed ablation study to understand the importance of different components in our proposed method. We start with the main ablation on the 3 main components of AllMatch, then perform another ablation on the contrastive learning approach." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 437, + 343, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 343, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 343, + 472 + ], + "type": "text", + "content": "Main ablation. Table 3 presents the results for the main ablation study. Here, we ablate all the combinations of the three main components of" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 474, + 481, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 481, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 481, + 521 + ], + "type": "text", + "content": "AllMatch: adaptive hard augmentation (AHA), inverse learning and contrastive learning (CL). First, we drop these modules individually and then in groups to investigate their significance on overall performance. We perform this study with " + }, + { + "bbox": [ + 130, + 474, + 481, + 521 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 474, + 481, + 521 + ], + "type": "text", + "content": " of the labelled data and report the overall accuracy (OA)." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": "As we observe from this table, when we drop the AHA module individually, the method's performance declines by " + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "inline_equation", + "content": "4.29\\%" + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": ". This is considerably higher than the drops observed by dropping inverse learning or contrastive loss, making AHA the most important module in AllMatch. We find the inverse learning to be the second most important component, removing which results in a " + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "inline_equation", + "content": "3.77\\%" + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": " drop in accuracy. Finally, we find that contrastive learning also plays a critical role. Removing the contrastive learning also results in a " + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "inline_equation", + "content": "1.34\\%" + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": " drop in accuracy. We find similar trends when two modules are removed at a time. We observe a performance drop of " + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "inline_equation", + "content": "6.37\\%" + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": " when we remove both the AHA and inverse learning modules. Similarly, removing the AHA and contrastive learning module results in a " + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "inline_equation", + "content": "4.9\\%" + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": " decline in AllMatch's performance. The least accuracy we find by utilizing a single component is " + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "inline_equation", + "content": "77.9\\%" + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": " with contrastive learning. Finally, we find" + } + ] + } + ], + "index": 8 + }, + { + "type": "table", + "bbox": [ + 351, + 387, + 482, + 463 + ], + "blocks": [ + { + "bbox": [ + 350, + 349, + 482, + 382 + ], + "lines": [ + { + "bbox": [ + 350, + 349, + 482, + 382 + ], + "spans": [ + { + "bbox": [ + 350, + 349, + 482, + 382 + ], + "type": "text", + "content": "Table 3: Ablation study of different proposed components of AllMatch on ModelNet40." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 351, + 387, + 482, + 463 + ], + "lines": [ + { + "bbox": [ + 351, + 387, + 482, + 463 + ], + "spans": [ + { + "bbox": [ + 351, + 387, + 482, + 463 + ], + "type": "table", + "html": "
Inv. lear.AHACLOA
✓✓✓84.28
✓✓82.94
✓✓79.98
✓✓80.50
✓77.90
✓79.37
✓80.10
74.80
", + "image_path": "0dfd592887a803125dfe46083bcda1866f594afa795fc786bd128790094447af.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_body" + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 190, + 90, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 90, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 190, + 90, + 447, + 102 + ], + "type": "text", + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "type": "text", + "content": "that removing all components drastically drops the performance by " + }, + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "74.8\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 140 + ], + "type": "text", + "content": ". This further shows the importance of each of the components in AllMatch." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 158, + 358, + 277 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 158, + 358, + 277 + ], + "spans": [ + { + "bbox": [ + 130, + 158, + 358, + 277 + ], + "type": "text", + "content": "Ablation on contrastive learning. Next, we perform another study on our contrastive learning module, which consists of supervised and self-supervised contrastive loss. Here, we perform another ablation study by removing the contrastive learning components in different combinations. Similar to the previous study, we do this study on " + }, + { + "bbox": [ + 130, + 158, + 358, + 277 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 158, + 358, + 277 + ], + "type": "text", + "content": " of labelled data from ModelNet40. The results of this study are presented in Table 4. As we find from this table, removing both of the components results in" + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 375, + 222, + 468, + 265 + ], + "blocks": [ + { + "bbox": [ + 363, + 167, + 482, + 212 + ], + "lines": [ + { + "bbox": [ + 363, + 167, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 363, + 167, + 482, + 212 + ], + "type": "text", + "content": "Table 4: Ablation study of contrastive loss components of AllMatch on ModelNet40 dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 375, + 222, + 468, + 265 + ], + "lines": [ + { + "bbox": [ + 375, + 222, + 468, + 265 + ], + "spans": [ + { + "bbox": [ + 375, + 222, + 468, + 265 + ], + "type": "table", + "html": "
Sup.Unsup.OA
✓✓84.28
✓83.47
✓83.06
82.94
", + "image_path": "a7f5bbe7557b603f0a3bce8c5197e559e514764a087c41e46346b5f4fbfda3ac.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "text", + "content": "a considerable drop in performance, with unsupervised contrastive loss having a greater impact on the final performance. More specifically, when both the supervised and unsupervised contrastive losses are employed, AllMatch achieves its highest performance, " + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "inline_equation", + "content": "84.28\\%" + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "text", + "content": ". By dropping the unsupervised contrastive loss, the method's overall accuracy drops sharply by " + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "inline_equation", + "content": "1.21\\%" + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "text", + "content": ". However, when the supervised loss is removed, the overall accuracy declines by " + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "inline_equation", + "content": "0.8\\%" + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "text", + "content": ". This proves AllMatch is gaining better learning signals from the unsupervised contrastive loss component. Finally, when both contrastive losses are removed, AllMatch returns with AHA and inverse learning setting with an overall loss of " + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "inline_equation", + "content": "82.94\\%" + }, + { + "bbox": [ + 130, + 278, + 482, + 387 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 403, + 382, + 415 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 403, + 382, + 415 + ], + "spans": [ + { + "bbox": [ + 131, + 403, + 382, + 415 + ], + "type": "text", + "content": "4.4 Performance on Increased Labelled Set Size" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": "In this section, we study the performance of different amounts of labelled data. Specifically, we investigate how an increase in the amount of labelled data impacts performance. To this end, we increase the labelled set size to all labelled data with a " + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": " interval (Figure 3). It is evident that when only a small amount of labelled data is available " + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "inline_equation", + "content": "(2\\% -5\\%)" + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": ", the overall accuracy of AllMatch is relatively low and gradually increases until it reaches " + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": " of the labelled set. With " + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": " labelled data, the overall accuracy reaches " + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "inline_equation", + "content": "90.19\\%" + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": ", compared to " + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "inline_equation", + "content": "90.75\\%" + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": " with the whole labelled set. In other words, the performance with " + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 424, + 369, + 567 + ], + "type": "text", + "content": " of labelled samples" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 567, + 481, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 567, + 481, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 567, + 481, + 604 + ], + "type": "text", + "content": "is almost close to the performance with " + }, + { + "bbox": [ + 130, + 567, + 481, + 604 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 567, + 481, + 604 + ], + "type": "text", + "content": " of the labelled data. This again proves the fact that AllMatch properly utilizes all the unlabelled data, making it possible for " + }, + { + "bbox": [ + 130, + 567, + 481, + 604 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 567, + 481, + 604 + ], + "type": "text", + "content": " labelled data to reach such performance." + } + ] + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 380, + 433, + 476, + 529 + ], + "blocks": [ + { + "bbox": [ + 380, + 433, + 476, + 529 + ], + "lines": [ + { + "bbox": [ + 380, + 433, + 476, + 529 + ], + "spans": [ + { + "bbox": [ + 380, + 433, + 476, + 529 + ], + "type": "image", + "image_path": "12b3d971477273c9c8eff240fe2cfea610cb1d21af7ab24116f18d37429db2de.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 374, + 536, + 482, + 559 + ], + "lines": [ + { + "bbox": [ + 374, + 536, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 374, + 536, + 482, + 559 + ], + "type": "text", + "content": "Fig. 3: Impact of labelled set size." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 620, + 249, + 634 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 620, + 249, + 634 + ], + "spans": [ + { + "bbox": [ + 131, + 620, + 249, + 634 + ], + "type": "text", + "content": "4.5 Sensitivity Study" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "In this section, we perform detailed sensitivity studies on different parameters of the AllMatch. Following, We discuss the details of these experiments." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 145, + 135, + 231, + 191 + ], + "blocks": [ + { + "bbox": [ + 203, + 114, + 411, + 126 + ], + "lines": [ + { + "bbox": [ + 203, + 114, + 411, + 126 + ], + "spans": [ + { + "bbox": [ + 203, + 114, + 411, + 126 + ], + "type": "text", + "content": "Table 5: Impact of different values of loss factors." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 145, + 135, + 231, + 191 + ], + "lines": [ + { + "bbox": [ + 145, + 135, + 231, + 191 + ], + "spans": [ + { + "bbox": [ + 145, + 135, + 231, + 191 + ], + "type": "table", + "html": "
αOverall accuracy
0.284.28
0.583.38
1.081.96
", + "image_path": "f61fff8535b6de3dcd083e70a22fddf185964423a9e34ff53b5745e2f7197296.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + }, + { + "bbox": [ + 162, + 191, + 208, + 201 + ], + "lines": [ + { + "bbox": [ + 162, + 191, + 208, + 201 + ], + "spans": [ + { + "bbox": [ + 162, + 191, + 208, + 201 + ], + "type": "text", + "content": "(a) " + }, + { + "bbox": [ + 162, + 191, + 208, + 201 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 162, + 191, + 208, + 201 + ], + "type": "text", + "content": " vs acc." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_footnote" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 265, + 135, + 351, + 191 + ], + "blocks": [ + { + "bbox": [ + 265, + 135, + 351, + 191 + ], + "lines": [ + { + "bbox": [ + 265, + 135, + 351, + 191 + ], + "spans": [ + { + "bbox": [ + 265, + 135, + 351, + 191 + ], + "type": "table", + "html": "
βOverall accuracy
0.284.28
0.583.46
1.081.24
", + "image_path": "9db5b2cf6efae7497d3def6e896024f60ad333d7115ae9619dd3770b03a0dd65.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + }, + { + "bbox": [ + 282, + 191, + 328, + 201 + ], + "lines": [ + { + "bbox": [ + 282, + 191, + 328, + 201 + ], + "spans": [ + { + "bbox": [ + 282, + 191, + 328, + 201 + ], + "type": "text", + "content": "(b) " + }, + { + "bbox": [ + 282, + 191, + 328, + 201 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 282, + 191, + 328, + 201 + ], + "type": "text", + "content": " vs acc." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_footnote" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 386, + 135, + 471, + 191 + ], + "blocks": [ + { + "bbox": [ + 386, + 135, + 471, + 191 + ], + "lines": [ + { + "bbox": [ + 386, + 135, + 471, + 191 + ], + "spans": [ + { + "bbox": [ + 386, + 135, + 471, + 191 + ], + "type": "table", + "html": "
γOverall accuracy
0.283.22
0.583.38
1.084.28
", + "image_path": "df02bd7ff871ddec038d4122b6aeb1e2db2a82e8e5003c2382b4534e012e8cc6.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + }, + { + "bbox": [ + 403, + 191, + 447, + 201 + ], + "lines": [ + { + "bbox": [ + 403, + 191, + 447, + 201 + ], + "spans": [ + { + "bbox": [ + 403, + 191, + 447, + 201 + ], + "type": "text", + "content": "(c) " + }, + { + "bbox": [ + 403, + 191, + 447, + 201 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 403, + 191, + 447, + 201 + ], + "type": "text", + "content": " vs acc." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_footnote" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 205, + 482, + 326 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 326 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 326 + ], + "type": "text", + "content": "Loss factor. The final loss function for training AllMatch consists of multiple losses and includes weight factors to balance the impact of individual loss components. Table 5 illustrates the influence of different loss factors on AllMatch's overall performance. The experiments are conducted on the ModelNet40 dataset with " + }, + { + "bbox": [ + 130, + 205, + 482, + 326 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 205, + 482, + 326 + ], + "type": "text", + "content": " of labelled data. It is observed that the overall accuracy of AllMatch is sensitive to the values of these factors. Specifically, lower loss factor values lead to higher performances for both supervised and unsupervised contrastive losses, while higher values for the inverse loss factor prove beneficial. This indicates that the inverse loss plays a more significant role in contributing to AllMatch's performance compared to the contrastive loss." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 346, + 369, + 514 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 346, + 369, + 514 + ], + "spans": [ + { + "bbox": [ + 130, + 346, + 369, + 514 + ], + "type": "text", + "content": "Augmentation strength. Augmentation strength is an essential hyperparameter for the Adaptive Hard Augmentation (AHA) module of AllMatch. It indicates the combination of different types of augmentation randomly applied as an additional hard augmentation to the easy samples. In Figure 4, we evaluate the overall performance of AllMatch for different augmentation strengths ranging from 4 to 8. Here, the numbers represent the total number of transformations applied to a sample. As we find from Figure 4, the best result is observed for using 4 transformations. While the augmentations are essential for learning from easy samples, applying a very high number of augmentations makes the optimization of the model difficult." + } + ] + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 380, + 355, + 477, + 451 + ], + "blocks": [ + { + "bbox": [ + 380, + 355, + 477, + 451 + ], + "lines": [ + { + "bbox": [ + 380, + 355, + 477, + 451 + ], + "spans": [ + { + "bbox": [ + 380, + 355, + 477, + 451 + ], + "type": "image", + "image_path": "bee5edd3e26872c94ded6b0339cf8d5906d8c325c288a476b088042b900b9207.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 373, + 459, + 482, + 492 + ], + "lines": [ + { + "bbox": [ + 373, + 459, + 482, + 492 + ], + "spans": [ + { + "bbox": [ + 373, + 459, + 482, + 492 + ], + "type": "text", + "content": "Fig. 4: Sensitivity study on the augmentation strengths." + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 533, + 369, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 369, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 369, + 666 + ], + "type": "text", + "content": "Warm-up epoch for AHA. As discussed in the method section, the AHA module comes into effect after a certain epoch of training. Given that AHA introduces an additional hard augmentation to easy samples, the downstream task becomes challenging for the model. If AHA is applied right at the beginning of the training process, it can negatively impact the model's performance. To this end, warm-up epochs enable the model to learn representations from all samples efficiently during the initial training. As depicted in Figure 5, AllMatch shows superior performance when" + } + ] + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 380, + 529, + 476, + 624 + ], + "blocks": [ + { + "bbox": [ + 380, + 529, + 476, + 624 + ], + "lines": [ + { + "bbox": [ + 380, + 529, + 476, + 624 + ], + "spans": [ + { + "bbox": [ + 380, + 529, + 476, + 624 + ], + "type": "image", + "image_path": "19767728cb121eb7d24a2fe433b0da72e446c29c8388fbfe28b2311e39f7660f.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 373, + 632, + 482, + 666 + ], + "lines": [ + { + "bbox": [ + 373, + 632, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 373, + 632, + 482, + 666 + ], + "type": "text", + "content": "Fig.5: Sensitivity study on the impact of different warm-up epochs." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 190, + 90, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 90, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 190, + 90, + 448, + 102 + ], + "type": "text", + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "warmed up for 50 epochs. However, prolonged warm-up periods diminish performance, as they reduce the effective action period of AHA." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 158, + 298, + 277 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 158, + 298, + 277 + ], + "spans": [ + { + "bbox": [ + 130, + 158, + 298, + 277 + ], + "type": "text", + "content": "Epoch and learning rate. Finally, we study two hyper-parameters that are important for the optimization of the model, epochs and learning rate. As depicted in Figure 6a, we observe that AllMatch's performance improves by increasing the number of epochs, reaching its peak at 350 epochs with a best performance of " + }, + { + "bbox": [ + 130, + 158, + 298, + 277 + ], + "type": "inline_equation", + "content": "84.28\\%" + }, + { + "bbox": [ + 130, + 158, + 298, + 277 + ], + "type": "text", + "content": ". However, extending the num" + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 305, + 157, + 388, + 239 + ], + "blocks": [ + { + "bbox": [ + 305, + 157, + 388, + 239 + ], + "lines": [ + { + "bbox": [ + 305, + 157, + 388, + 239 + ], + "spans": [ + { + "bbox": [ + 305, + 157, + 388, + 239 + ], + "type": "image", + "image_path": "7abb9ce8c59840611ab6cf534f02f417bd8fd82d4529a10bd931010b454cf87f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 306, + 239, + 385, + 250 + ], + "lines": [ + { + "bbox": [ + 306, + 239, + 385, + 250 + ], + "spans": [ + { + "bbox": [ + 306, + 239, + 385, + 250 + ], + "type": "text", + "content": "(a) Epochh vs Acc." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 304, + 251, + 481, + 272 + ], + "lines": [ + { + "bbox": [ + 304, + 251, + 481, + 272 + ], + "spans": [ + { + "bbox": [ + 304, + 251, + 481, + 272 + ], + "type": "text", + "content": "Fig.6: Sensitivity study of epoch and learning rate on ModelNet40." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 394, + 157, + 477, + 239 + ], + "blocks": [ + { + "bbox": [ + 394, + 157, + 477, + 239 + ], + "lines": [ + { + "bbox": [ + 394, + 157, + 477, + 239 + ], + "spans": [ + { + "bbox": [ + 394, + 157, + 477, + 239 + ], + "type": "image", + "image_path": "4bfdc45e5abac01d82daf2e30ec491c898dbd5d07e0c502297499ecd0bbab700.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 406, + 239, + 466, + 249 + ], + "lines": [ + { + "bbox": [ + 406, + 239, + 466, + 249 + ], + "spans": [ + { + "bbox": [ + 406, + 239, + 466, + 249 + ], + "type": "text", + "content": "(b) LR vs Acc." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 277, + 482, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 277, + 482, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 482, + 373 + ], + "type": "text", + "content": "ber of epochs beyond this point results in a decline in performance. This is considerably lower than the previous SOTA, which requires 500 epochs of training. This further shows the benefit of utilizing the unlabelled data properly. In Figure 6b, we analyze the impact of different learning rates on AllMatch's performance. Notably, lower learning rates contribute to improved performance, whereas higher values lead to a collapse in the model's performance. For instance, at a learning rate of 0.0005, AllMatch achieves only " + }, + { + "bbox": [ + 130, + 277, + 482, + 373 + ], + "type": "inline_equation", + "content": "12\\%" + }, + { + "bbox": [ + 130, + 277, + 482, + 373 + ], + "type": "text", + "content": " overall accuracy, emphasizing the sensitivity of the model's performance to the choice of learning rate." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 220, + 404 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 220, + 404 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 220, + 404 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 417, + 482, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 417, + 482, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 417, + 482, + 536 + ], + "type": "text", + "content": "In this work, we identify that existing 3D semi-supervised techniques fail to capitalize the whole unlabelled data. To solve this issue, we introduce AllMatch, a novel semi-supervised method for point cloud classification that effectively utilizes the entire unlabelled set to improve the learnt representation. Comprised of adaptive hard augmentation, inverse learning, and contrastive learning components, AllMatch outperforms existing SOTA methods by a significant margin, showcasing superior performance even with minimal (1%) labelled sets. Remarkably, AllMatch, with just " + }, + { + "bbox": [ + 130, + 417, + 482, + 536 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 417, + 482, + 536 + ], + "type": "text", + "content": " of the labelled set, attains a performance close to the fully supervised learning with all samples, underscoring its efficiency in minimizing reliance on labelled data." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 536, + 482, + 644 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 536, + 482, + 644 + ], + "spans": [ + { + "bbox": [ + 130, + 536, + 482, + 644 + ], + "type": "text", + "content": "Limitations. While our proposed method has made significant improvement in efficiently leveraging the entire unlabelled set, there are still opportunities for further exploration in this promising direction. In the AHA module, we successfully incorporated selected transformation-invariant augmentation techniques, showcasing a positive step forward. Expanding our exploration to encompass a more diverse range of augmentation methods could prove to be a fruitful avenue for additional advancements. Furthermore, we only explored contrastive learning as the self-supervised module to ensure the utilization of all unlabelled samples, leaving room for exploring different versions and alternatives of contrastive loss." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 141, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 138, + 141, + 480, + 175 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 141, + 480, + 175 + ], + "spans": [ + { + "bbox": [ + 138, + 141, + 480, + 175 + ], + "type": "text", + "content": "1. Berthelot, D., Carlini, N., Cubuk, E.D., Kurakin, A., Sohn, K., Zhang, H., Raffel, C.: Remixmatch: Semi-supervised learning with distribution matching and augmentation anchoring. In: ICLR (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 176, + 480, + 197 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 176, + 480, + 197 + ], + "spans": [ + { + "bbox": [ + 138, + 176, + 480, + 197 + ], + "type": "text", + "content": "2. Berthelot, D., Carlini, N., Goodfellow, I., Papernot, N., Oliver, A., Raffel, C.A.: Mixmatch: A holistic approach to semi-supervised learning. NeurIPS (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 198, + 480, + 231 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 198, + 480, + 231 + ], + "spans": [ + { + "bbox": [ + 138, + 198, + 480, + 231 + ], + "type": "text", + "content": "3. Chen, H., Tao, R., Fan, Y., Wang, Y., Wang, J., Schiele, B., Xie, X., Raj, B., Savvides, M.: Softmatch: Addressing the quantity-quality tradeoff in semi-supervised learning. In: ICLR (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 232, + 480, + 253 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 232, + 480, + 253 + ], + "spans": [ + { + "bbox": [ + 138, + 232, + 480, + 253 + ], + "type": "text", + "content": "4. Chen, L., Zhang, Y., Lin, Y., Jiang, M., Huang, Y., Lei, Y.: Consistency-based semi-supervised learning for point cloud classification. In: PRAI. pp. 440-445 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 254, + 480, + 275 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 254, + 480, + 275 + ], + "spans": [ + { + "bbox": [ + 138, + 254, + 480, + 275 + ], + "type": "text", + "content": "5. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: ICML. pp. 1597-1607 (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 277, + 480, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 277, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 138, + 277, + 480, + 308 + ], + "type": "text", + "content": "6. Chen, Y., Tan, X., Zhao, B., Chen, Z., Song, R., Liang, J., Lu, X.: Boosting semi-supervised learning by exploiting all unlabeled data. In: CVPR. pp. 7548-7557 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 310, + 480, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 310, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 310, + 480, + 331 + ], + "type": "text", + "content": "7. Chen, Z., Jing, L.: Multimodal semi-supervised learning for 3d objects. In: BMVC (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 332, + 480, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 480, + 354 + ], + "type": "text", + "content": "8. Chen, Z., Jing, L., Yang, L., Li, Y., Li, B.: Class-level confidence based 3d semi-supervised learning. In: WACV. pp. 633-642 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 354, + 480, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 354, + 480, + 386 + ], + "spans": [ + { + "bbox": [ + 138, + 354, + 480, + 386 + ], + "type": "text", + "content": "9. Gui, G., Zhao, Z., Qi, L., Zhou, L., Wang, L., Shi, Y.: Enhancing sample utilization through sample adaptive augmentation in semi-supervised learning. In: CVPR. pp. 15880-15889 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 388, + 480, + 408 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 388, + 480, + 408 + ], + "spans": [ + { + "bbox": [ + 138, + 388, + 480, + 408 + ], + "type": "text", + "content": "10. Guo, M.H., Cai, J.X., Liu, Z.N., Mu, T.J., Martin, R.R., Hu, S.M.: Pct: Point cloud transformer. Computational Visual Media 7, 187-199 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 410, + 480, + 442 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 410, + 480, + 442 + ], + "spans": [ + { + "bbox": [ + 138, + 410, + 480, + 442 + ], + "type": "text", + "content": "1. Jiang, L., Shi, S., Tian, Z., Lai, X., Liu, S., Fu, C.W., Jia, J.: Guided point contrastive learning for semi-supervised point cloud semantic segmentation. In: ICCV. pp. 6423-6432 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 444, + 480, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 444, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 138, + 444, + 480, + 475 + ], + "type": "text", + "content": "2. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. NeurIPS pp. 18661-18673 (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 477, + 480, + 509 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 477, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 138, + 477, + 480, + 509 + ], + "type": "text", + "content": "3. Kim, J., Min, Y., Kim, D., Lee, G., Seo, J., Ryoo, K., Kim, S.: Conmatch: Semi-supervised learning with confidence-guided consistency regularization. In: ECCV. pp. 674-690 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "text", + "content": "4. Lee, D.H., et al.: Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks. In: Workshop on challenges in representation learning, ICML. p. 896 (2013)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 544, + 480, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 564 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 564 + ], + "type": "text", + "content": "5. Li, J., Xiong, C., Hoi, S.C.: Comatch: Semi-supervised learning with contrastive graph regularization. In: ICCV. pp. 9475-9484 (2021)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 566, + 480, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 566, + 480, + 597 + ], + "spans": [ + { + "bbox": [ + 138, + 566, + 480, + 597 + ], + "type": "text", + "content": "6. Liu, F., Lin, G., Foo, C.S., Joshi, C.K., Lin, J.: Point discriminative learning for data-efficient 3d point cloud analysis. In: IEEE Int. Conf. on 3D Vision. pp. 42-51 (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 599, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 599, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 138, + 599, + 480, + 620 + ], + "type": "text", + "content": "7. Nguyen, K.B.: Sequencematch: Revisiting the design of weak-strong augmentations for semi-supervised learning. In: WACV. pp. 96-106 (2024)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "text", + "content": "8. Otsu, N.: A threshold selection method from gray-level histograms. TSMC 9, 62-66 (1979)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "text", + "content": "9. Qi, C.R., Su, H., Mo, K., Guibas, L.J.: Pointnet: Deep learning on point sets for 3d classification and segmentation. In: CVPR. pp. 652-660 (2017)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 190, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 190, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving 3D SSL by Effectively Utilizing All Unlabelled Data" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 392 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "text", + "content": "20. Roy, S., Etemad, A.: Scaling up semi-supervised learning with unconstrained unlabelled data. In: AAAI. pp. 14847-14856 (2024)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 139, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 139, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 480, + 171 + ], + "type": "text", + "content": "21. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. NeurIPS pp. 596-608 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 480, + 205 + ], + "type": "text", + "content": "22. Tarvainen, A., Valpola, H.: Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. In: NeurIPS. pp. 1195–1204 (2017)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 480, + 237 + ], + "type": "text", + "content": "23. Uy, M.A., Pham, Q.H., Hua, B.S., Nguyen, D.T., Yeung, S.K.: Revisiting point cloud classification: A new benchmark dataset and classification model on real-world data. In: ICCV. pp. 1588-1597 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 237, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 480, + 270 + ], + "type": "text", + "content": "24. Wu, J., Yang, H., Gan, T., Ding, N., Jiang, F., Nie, L.: Chmatch: Contrastive hierarchical matching and robust adaptive threshold boosted semi-supervised learning. In: CVPR. pp. 15762-15772 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 270, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 480, + 293 + ], + "type": "text", + "content": "25. Wu, Z., Song, S., Khosla, A., Yu, F., Zhang, L., Tang, X., Xiao, J.: 3d shapenets: A deep representation for volumetric shapes. In: CVPR. pp. 1912-1920 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 315 + ], + "type": "text", + "content": "26. Xie, Q., Dai, Z., Hovy, E., Luong, T., Le, Q.: Unsupervised data augmentation for consistency training. In: NeurIPS. pp. 6256-6268 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 315, + 480, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 336 + ], + "type": "text", + "content": "27. Xu, Y., Shang, L., Ye, J., Qian, Q., Li, Y.F., Sun, B., Li, H., Jin, R.: Dash: Semi-supervised learning with dynamic thresholding. In: ICML. pp. 11525-11536 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "text", + "content": "28. Zhang, B., Wang, Y., Hou, W., Wu, H., Wang, J., Okumura, M., Shinozaki, T.: Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling. NeurIPS pp. 18408-18419 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 369, + 480, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 392 + ], + "type": "text", + "content": "29. Zheng, M., You, S., Huang, L., Wang, F., Qian, C., Xu, C.: Simmatch: Semi-supervised learning with similarity matching. In: CVPR. pp. 14471-14481 (2022)" + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "S. Paul et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_content_list.json b/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..b4028dc96643219e44f7e4a884b7423f22f6e0b1 --- /dev/null +++ b/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_content_list.json @@ -0,0 +1,1647 @@ +[ + { + "type": "text", + "text": "Improving Adversarial Transferability via Model Alignment", + "text_level": 1, + "bbox": [ + 264, + 140, + 743, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Avery Ma $^{1,2}$ , Amir-massoud Farahmand $^{1,2}$ , Yangchen Pan $^{3}$ , Philip Torr $^{3}$ , and Jindong Gu $^{3}$", + "bbox": [ + 285, + 210, + 718, + 244 + ], + "page_idx": 0 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1 University of Toronto, Toronto, Canada \nama@cs.toronto.edu", + "$^{2}$ Vector Institute, Toronto, Canada", + "3 University of Oxford, Oxford, UK" + ], + "bbox": [ + 359, + 253, + 642, + 310 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Neural networks are susceptible to adversarial perturbations that are transferable across different models. In this paper, we introduce a novel model alignment technique aimed at improving a given source model's ability in generating transferable adversarial perturbations. During the alignment process, the parameters of the source model are finetuned to minimize an alignment loss. This loss measures the divergence in the predictions between the source model and another, independently trained model, referred to as the witness model. To understand the effect of model alignment, we conduct a geometric analysis of the resulting changes in the loss landscape. Extensive experiments on the ImageNet dataset, using a variety of model architectures, demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. Our source code is available at https://github.com/averyma/model-alignment.", + "bbox": [ + 261, + 347, + 743, + 542 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 566, + 375, + 583 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Adversarial examples with small perturbations can mislead deep neural networks to make wrong predictions [50]. It has been observed that perturbations created to attack one model can also fool other models, which is known as adversarial transferability [14]. The transferability of such perturbations has received significant attention recently since it poses practical concerns for the deployment of machine learning systems in real-world applications [9,28,42].", + "bbox": [ + 212, + 598, + 787, + 688 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "One possible explanation for this transferability is that transferable perturbations exploit similar features present in both the source and target models [23]. To see this, let us first consider the hypothesis that neural networks capture two distinct types of features from data: semantic features and human-imperceptible features. This hypothesis has been proposed and supported in [34, 52, 63]. We provide a summary of their findings as follows. First, models learn semantic features that align with human perception. The extraction of such features is similar across different models, reflecting a shared understanding of the semantics. Second, models learn human-imperceptible features, and their learning is model-specific. For example, Ma et al. [34] showed that the use of these features", + "bbox": [ + 212, + 689, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/8802665858e6c43360cf817fa47d38ebe8f04e60c2147234b6062604f40b8263.jpg", + "image_caption": [ + "Fig. 1: Attacking the aligned source model for more transferable perturbations. We compare the transferability of $\\ell_{\\infty}$ -norm bounded perturbations ( $\\epsilon = 4/255$ ) generated using the source model before and after performing model alignment. The result highlights the compatibility of model alignment with a wide range of attacks, as perturbations generated from the aligned source model become more transferable. Here, the source model is aligned using a witness model from the same architecture but is initialized and trained independently. Results are averaged over all target models." + ], + "image_footnote": [], + "bbox": [ + 220, + 147, + 781, + 272 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "varies with models' optimization processes, while Wang et al. [52] showed that model architecture leads to specific feature interpretations.", + "bbox": [ + 212, + 426, + 785, + 458 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Features and vulnerabilities are highly correlated, as vulnerabilities often stem from the exploitation of certain features [23]. In the context of transferability, the degree of similarity between those exploited features in the source and target model is crucial. That is, the more similar the exploited features between models, the more likely it is that the perturbation will successfully transfer. To support this, Liu et al. [30] showed that different models have similar decision boundaries (from learning similar features), thus enabling some perturbation to be transferable across different models. However, some perturbations exploit features that are specific to the source model. Qin et al. [44] demonstrated that when maximizing the cross entropy loss to find adversarial examples, some perturbations fail to transfer since they are located at sharp local maxima unique to the source model, which do not exist for the target model.", + "bbox": [ + 212, + 458, + 787, + 640 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Motivated by these observations, we propose a model alignment technique to modify the source model to encourage a similar feature extraction as other, independently trained models, which we refer to as witness models.", + "bbox": [ + 212, + 641, + 785, + 686 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our goal is to transform any source model into one from which attacks generate more transferable perturbations.", + "text_level": 1, + "bbox": [ + 251, + 686, + 750, + 717 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "During the alignment process, the source model's parameters are fine-tuned to minimize an alignment loss, which measures the prediction divergence between the source and witness models. Through this alignment process, the source model learns to focus on a set of features that are similarly extracted by the witness model. This allows attack algorithms to more effectively exploit features common across models, leading to more transferable perturbations.", + "bbox": [ + 212, + 718, + 785, + 808 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Because of the orthogonal nature of our approach, model alignment complements, rather than competes with, other attack algorithms. This synergy under-", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "scores our method's key advantage: its broad compatibility with a wide range of attack algorithms, as highlighted in Fig. 1. Extensive experiments on various combinations of architectures, transferability on individual target models, and results with other attacks are included in Sec. 4.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We analyze the effect of the proposed alignment method, demonstrating that perturbations generated from the source model exploit more semantic features that are shared across different models. Additionally, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process. The analysis explores the relationship between model alignment and the use of soft labels [20,49,67]. Results show that there is a notable smoothing effect on the loss surface of the model, which is consistent with prior findings that adversarial examples from flatter maxima are more transferable [16,44]. Our contributions can be summarized as follows:", + "bbox": [ + 212, + 207, + 784, + 340 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We present a model alignment method to fine-tune the source model by minimizing an alignment loss which measures the difference in the output between the source model and the witness model.", + "- To understand the effect of model alignment, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process.", + "- Extensive experiments on ImageNet [25], using convolutional neural networks (CNNs) and Vision Transformers (ViTs) [12,31], demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. We demonstrate that our alignment technique is compatible with a wide range of attacks." + ], + "bbox": [ + 225, + 354, + 784, + 503 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 530, + 387, + 545 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this section, we provide a brief overview of approaches to generate more transferable perturbations. For a more comprehensive review of research related to adversarial transferability, we direct the reader to a recent survey [15].", + "bbox": [ + 212, + 563, + 782, + 608 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Generating Transferable Perturbations", + "text_level": 1, + "bbox": [ + 214, + 631, + 581, + 645 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Existing work on improving the transferability of adversarial examples can be categorized into four groups: data-augmentation-based methods [3,7,11,27,58,61, 74], optimization-based methods [10,18,29,32,53,59,66,71], model-modificationbased methods [2,17,56,60], and ensemble-based methods [16,26,30,43].", + "bbox": [ + 212, + 657, + 784, + 718 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Data-augmentation-based methods: Data augmentation prevents overfitting in deep neural networks, with advanced techniques [8, 33, 65, 67] being key for state-of-the-art generalization on large datasets. Building on this, several works have incorporated data augmentation into attacks to prevent adversarial examples from overfitting to the source model, thereby improving transferability.", + "bbox": [ + 212, + 719, + 784, + 792 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Optimization-based methods: Lin et al. [29] drew a parallel between generating transferable adversarial examples and training neural networks. In this analogy, source models are the training data, adversarial perturbations are model", + "bbox": [ + 212, + 794, + 784, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "parameters, and the target model is the testing data. Thus, transferability of adversarial examples is akin to model generalization. Optimization-based methods, such as momentum [10, 29, 74] and variance tuning [53, 62], initially designed to improve model generalization, can similarly improve adversarial transferability.", + "bbox": [ + 212, + 146, + 785, + 207 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Model-modification-based methods: Several studies have proposed methods to improve transferability by modifying the source model. Benz et al. [2] showed that perturbations from models without batch normalization [24] are more transferable. Methods like Linear Backpropagation (LinBP) [17] and Backward Propagation Attack (BPA) [60] focus on non-linear activations and modify the derivative of ReLU. Wu et al. [56] showed that increasing gradients from skip connections can improve transferability. A key advantage of our approach is its model-agnostic nature: alignment can be applied without changing the model's forward or backward pass, improving any source model's ability to generate more transferable perturbations. In contrast, other methods require changes, such as those seen in LinBP and BPA, or even complete retraining.", + "bbox": [ + 212, + 207, + 785, + 372 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Ensemble-based methods: Another line of approaches involves the use of multiple models for generating adversarial examples. Liu et al. [30] were among the first to propose enhancing transferability by attacking an ensemble of models, with the rationale being that a perturbation capable of fooling multiple models is more likely to deceive the target model. More recently, Gubri et al. [16] proposed constructing an ensemble of source models by collecting weights along the finetuning trajectory of a trained model.", + "bbox": [ + 212, + 373, + 787, + 479 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Understanding Adversarial Transferability", + "text_level": 1, + "bbox": [ + 214, + 498, + 609, + 513 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Several works have focused on understanding the transferability of adversarial perturbations [54, 57, 69, 73], with some analyzing from a geometric perspective [5, 13, 30, 70]. Liu et al. [30] showed that weakly transferable adversarial examples often fall into local maxima of the source model. They found that some perturbations fail to transfer because they reside in tiny pockets corresponding to the ground truth label, present in the source model but not in the target model. Similarly, Gubri et al. [16] hypothesized that adversarial examples at flat loss maxima transfer more effectively than those at sharp maxima. Motivated by these insights, in Sec. 3.3, we extend this geometric perspective to examine how the alignment method influences the source model's loss surface geometry to generate more transferable adversarial examples.", + "bbox": [ + 212, + 520, + 787, + 688 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 214, + 708, + 331, + 724 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We present the model alignment process and understand why aligned models can generate more transferable perturbations.", + "bbox": [ + 214, + 737, + 785, + 767 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Preliminary", + "text_level": 1, + "bbox": [ + 214, + 787, + 362, + 801 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this work, we focus on neural networks used for classification tasks. Let us consider a neural network designed for $m$ -class classification, represented as a", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 230, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 357, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "series of function compositions:", + "bbox": [ + 215, + 146, + 442, + 161 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nf (x) = (\\phi^ {[ l ]} \\circ \\phi^ {[ l - 1 ]} \\circ \\dots \\circ \\phi^ {[ 1 ]}) (x),\n$$\n", + "text_format": "latex", + "bbox": [ + 379, + 172, + 625, + 191 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where each $\\phi^{[i]}$ represents an operation within the network, which could be a linear transformation (such as a fully connected layer), an activation function, or a pooling operation. The parameters of the neural network are collectively denoted as $\\theta$ . The intermediate outputs of these operations are often referred to as hidden representations. We denote them by $z^{[i]}$ , where $z^{[i]} = \\phi^{[i]}(z^{[i-1]})$ for $i = 1, 2, \\ldots, l$ , and the initial input is $z^{[0]} = x$ . Additionally, we incorporate the softmax function into the neural network's definition. Specifically, in the final layer, we have $\\phi^{[l]} = \\operatorname{softmax}(z^{[l-1]})$ , where $z^{[l-1]}$ are called the logits. With this definition, the output of this network, $f(x)$ , can be interpreted as a probability distribution over the $m$ classes where each component $f(x)_i$ represents the probability of the input $x$ belonging to class $i$ .", + "bbox": [ + 212, + 200, + 787, + 367 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Model Alignment", + "text_level": 1, + "bbox": [ + 215, + 388, + 406, + 404 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The goal of model alignment is to modify the source model such that it can extract features similar to those of other models (the witness model). We denote the parameters of the source model and the witness model as $\\theta_s$ and $\\theta_w$ , respectively. Let us consider the following point-wise formulation of the alignment loss:", + "bbox": [ + 212, + 415, + 784, + 476 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\ell_ {a} (x, \\theta_ {s}, \\theta_ {w}) = d \\left(z _ {s} ^ {[ q ]} (x), z _ {w} ^ {[ q ]} (x)\\right), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 488, + 784, + 507 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where the metric $d$ measures the output difference at layer $q$ between the models.", + "bbox": [ + 212, + 513, + 784, + 527 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Model alignment is a fine-tuning process. During alignment, the parameters of the source model are updated to minimize this alignment loss which captures the differences between models' output. Specifically, when $q = l$ , the alignment loss measures the divergence between the probability distributions generated by the two models. In this scenario, the Kullback-Leibler (KL) divergence is particularly suitable, due to its effectiveness in measuring distribution differences and its relative ease of implementation in practice. Our analysis and primary experimental results are based on model alignment in the output space, using KL divergence as $d$ . We also explore total variation and alignment in the embedding space (i.e., $q < l$ ), which is detailed in our ablation study.", + "bbox": [ + 212, + 527, + 785, + 678 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The point-wise loss defined in (1) focuses on aligning the source model with a single witness model. However, alignment can also be extended to multiple witness models to further improve the alignment process. This process involves using a set of witness models, denoted as $\\Theta$ , with the number of witness models represented by $|\\Theta|$ . Finally, the update rule for the parameters of the source model based on SGD can be written as", + "bbox": [ + 212, + 679, + 785, + 768 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\theta_ {s} (t + 1) = \\theta_ {s} (t) - \\eta \\frac {1}{| \\mathcal {B} | | \\Theta |} \\sum_ {x \\in \\mathcal {B}} \\sum_ {\\theta_ {w} \\in \\Theta} \\nabla \\ell_ {a} (x, \\theta_ {s} (t), \\theta_ {w}),\n$$\n", + "text_format": "latex", + "bbox": [ + 307, + 777, + 697, + 815 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathcal{B}$ represents the mini-batch.", + "bbox": [ + 215, + 824, + 470, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 732, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/d20c998a3ab1624cc0dd7ccef37e7c3e4306eb1683775845585547c20677b969.jpg", + "image_caption": [ + "a. ResNet50." + ], + "image_footnote": [], + "bbox": [ + 233, + 143, + 486, + 262 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/c3948fe79675ba4de4b0a1701c36691cfae9f05ef691063e1834620f95e835bc.jpg", + "image_caption": [ + "b. ViT-B/16.", + "Fig.2: A frequency-domain visualization of the differences in the perturbation generated using the original source model and the aligned source model. We compare the magnitude of the DCT coefficients between the perturbations generated by the two models: $|\\mathrm{DCT}(\\Delta x_a)| - |\\mathrm{DCT}(\\Delta x_s)|$ . The pronounced brightness in the top-left region of the spectrum indicates that the primary differences lie within the low-frequency range, which is typically associated with semantic features." + ], + "image_footnote": [], + "bbox": [ + 513, + 143, + 769, + 262 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Understanding Model Alignment", + "text_level": 1, + "bbox": [ + 214, + 401, + 532, + 417 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We now understand the model alignment approach from two perspectives: semantic feature exploitation and geometric analysis of the loss surface. The analysis in this section uses ResNet50 and ViT-B/16 as source models, which are aligned with ResNet18 and ViT-T/16 as their respective witness models. We consider $\\ell_{\\infty}$ -norm adversarial examples generated using 20 iterations of PGD [37] with $\\epsilon = 4 / 255$ and $\\alpha = 1 / 255$ . We use $\\Delta x_{s}$ and $\\Delta x_{a}$ to represent the perturbations generated based on the source and aligned models, respectively.", + "bbox": [ + 212, + 426, + 787, + 532 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Aligned Model Exploits More Semantic Features. To verify that attacks applied to the aligned model exploit more semantic features, we compare the perturbations generated using the original and aligned source models. Adversarial perturbations are imperceptible and difficult to characterize in terms of the specific features they exploit in the spatial domain. However, by analyzing perturbations in the frequency domain, we can observe the types of features each model exploits. Previous work has shown that semantic features mostly concentrate around the low-frequency end of the spectrum [34,52,63]. We consider discrete cosine transform (DCT) [1] and compare the DCT coefficients of the perturbations generated from the source and the aligned model, denoted as $\\mathrm{DCT}(\\Delta x_s)$ and $\\mathrm{DCT}(\\Delta x_a)$ , respectively. The results are averaged over 1000 randomly sampled images from the ImageNet test set. Since our interest lies in the magnitude of these coefficients, we visualize the difference by computing $|\\mathrm{DCT}(\\Delta x_a)| - |\\mathrm{DCT}(\\Delta x_s)|$ .", + "bbox": [ + 212, + 551, + 787, + 763 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The results are illustrated in Fig. 2. We observe that the differences between the perturbations are predominantly located in the top-left corner of the DCT spectrum, indicating that they primarily differ in the amount of low-frequency information. This result shows that adversarial perturbations generated from the aligned exploit more low-frequency, semantic features.", + "bbox": [ + 212, + 765, + 787, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/ad12d108f9562a67bfb5363b781a9afd2f6485665ca3c95dec20dc763f3c391c.jpg", + "image_caption": [ + "Fig. 3: Visualization of the loss surface around adversarial perturbations for original and aligned ResNet50 and ViT-b/16. Each plot illustrates the loss surface projected on the plane defined by the adversarial perturbation direction and its orthogonal vector. We examine the loss landscape around a clean data point (cyan) and an $\\ell_{\\infty}$ -bounded adversially perturbed data point (red), generated from the source $(\\Delta x_{s})$ and aligned models $(\\Delta x_{a})$ . Perturbations from the original source models are at sharper loss maxima, while those from the aligned model are on flatter surfaces." + ], + "image_footnote": [], + "bbox": [ + 243, + 143, + 759, + 265 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Model Alignment Yields Smoother Loss Surface. Previous works have studied the connection between perturbation from sharp loss maxima and their poor transferability [16, 44]. We extend this geometric perspective by examining how model alignment affects the loss surface geometry of the source model, particularly in its capacity to generate more transferable adversarial examples.", + "bbox": [ + 212, + 409, + 782, + 484 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "First, consider when (1) measures the KL divergence between the two models' predictions. During alignment, the source model's parameters are fine-tuned using soft labels from the witness model's outputs. Training deep neural networks with soft labels prevents the model from becoming overly confident in its predictions, thereby improving generalization [20, 21, 39, 49]. Compared to using hard, one-hot encoded labels, it has been shown that training with soft labels implicitly regularizes the norm of the input Jacobian [4, 68], and leads to smoother decision boundaries [51, 67].", + "bbox": [ + 212, + 487, + 787, + 608 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To understand why model alignment can be helpful, we begin by identifying a data point for which the perturbation, when generated based on the original source model, fails to transfer to the target model, but the perturbation generated using the aligned model misleads the target model. In Fig. 3, we visualize the loss surface surrounding this data point, spanned by two pairs of orthogonal vectors: $\\Delta x_{s}$ , $\\Delta x_{s}^{\\perp}$ , $\\Delta x_{a}$ and $\\Delta x_{a}^{\\perp}$ . Here, $\\Delta x_{s}^{\\perp}$ and $\\Delta x_{a}^{\\perp}$ are randomly selected orthogonal vectors and are also bounded by the same $\\epsilon$ . In each plot, the center of the plot (cyan) represents the clean data point, and the adversarial example is highlighted using the red marker.", + "bbox": [ + 212, + 609, + 787, + 747 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We make two observations. First, the bright yellow region around the perturbations generated from the original source model suggests that they are located at sharp loss maxima. However, these same perturbations do not effectively cause a significant increase in loss when applied to the target model. This observation aligns with previous findings indicating that perturbations with poor transferability often correspond to sharp local maxima unique to the source model, which", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/ec7fc20403c3e415c128087ec8822fd955b169b63856afa6f1acdc96fbb48500.jpg", + "table_caption": [ + "Table 1: Comparing the $\\ell_2$ -norm of the input gradient on the original source model and the aligned source model. Results are averaged over 1000 randomly selected ImageNet test samples. The norm decreases significantly when evaluated on all three types of input, suggesting that the smoothing effect induced by the alignment is more global, rather than being confined to specific cases of adversarial examples." + ], + "table_footnote": [], + "table_body": "
DataResNet50VIT-B/16
OriginalAlignedOriginalAligned
Clean0.0560.0320.0600.029
Gaussian-perturbed0.0570.0320.0630.029
PGD-perturbed0.4530.1710.1840.055
", + "bbox": [ + 305, + 226, + 699, + 292 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "are not present in the target model [16, 44]. Second, the loss surface around perturbations generated from the aligned model is noticeably flatter. This is in line with prior findings that adversarial perturbations from flatter maxima tend to be transferable [16, 44]. It is noteworthy that the PGD attack does not explicitly target flat maxima for generating adversarial examples. This observation leads us to hypothesize that the smoothing effect induced by the alignment process is more global, rather than being confined to specific cases of adversarial examples.", + "bbox": [ + 212, + 340, + 785, + 446 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To verify this, we evaluate the change in the $\\ell_2$ -norm of the loss gradients with respect to clean, Gaussian-perturbed $(\\sigma^2 = 0.01)$ , and PGD-perturbed inputs. More formally, we compare $\\| \\nabla_x\\ell (x + \\varDelta x,y,\\theta)\\| _2$ for $\\varDelta x\\in\\{0,\\mathrm{Gaussian},\\mathrm{PGD}\\}$ for $\\theta \\in \\{\\theta_s,\\theta_a\\}$ over 1000 randomly sampled ImageNet test samples.", + "bbox": [ + 212, + 449, + 785, + 511 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The results are summarized in Tab. 1. We observe a significant decrease in gradient norm across all inputs, and the reduction is particularly pronounced at PGD-perturbed data points. This decrease is consistent with the previous finding which demonstrated a connection between the use of soft labels and the smoothing of the loss surface [4,68]. More importantly, this observation explains the improved transferability with the aligned model. In the supplementary material, we discuss additional results on the change in the largest eigenvalue of input Hessian, which is another popular metric in studying the smoothness of the loss landscape [70]. To evaluate the similarity of models, we measure the change in the KL divergence, prediction agreement, and the cosine similarity of input gradients. The latter is crucial due to its role in the attack process. These results are included in the supplementary material.", + "bbox": [ + 212, + 513, + 787, + 694 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 732, + 375, + 750 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this section, we present a series of experiment results to demonstrate the improved ability of a given source model to generate transferable adversarial perturbations. We study factors that can further improve the alignment process and demonstrate the compatibility of our approach with a wide range of attacks.", + "bbox": [ + 212, + 779, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Experiment Setup", + "text_level": 1, + "bbox": [ + 215, + 146, + 413, + 162 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Model: We consider various neural network architectures as source, witness, and target models. For CNNs, we include ResNet18 (Res18), ResNet50 (Res50), ResNet101 (Res101) [19], VGG19 [47], DenseNet121 (DN121) [22], and Inception-v3 (IncV3) [49]. For ViTs, our selection includes Swin Transformers (SWIN) [31], ViT-T/16, ViT-S/16, and ViT-B/16 [12]. We follow the optimization schedule described in the official Pytorch repository to train all models. Training and model details are included in the supplementary material.", + "bbox": [ + 212, + 172, + 787, + 277 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Fine-tune: During alignment, all source models are fine-tuned for one epoch using SGD with a momentum of 0.9, a cosine learning rate decay, and a linear warmup. We sweep over 3 learning rates. No additional data is used, as fine-tuning relies on the same training data used to train the source and witness model. We use a batch size of 128 for CNNs and 512 for ViTs. For ViT-based models, we follow [48] and gradients are clipped at a global norm of 1.", + "bbox": [ + 212, + 277, + 787, + 368 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Dataset: We follow previous work [10,29,64] in which evaluations are based on 1000 randomly selected from the ImageNet test set. For a given source and target model, these samples meet the following criteria: they are correctly classified by both models, and the adversarial examples, when generated from each model, lead to misclassifications in their respective originating models.", + "bbox": [ + 212, + 369, + 787, + 443 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Attack method: We focus on non-targeted adversarial perturbations bounded by the $\\ell_{\\infty}$ -norm. Unless otherwise stated, all perturbations are generated using 20 iterations of PGD with $\\epsilon = 4/255$ and $\\alpha = 1/255$ . All target models have an error rate of $100\\%$ under white-box PGD attacks. Results with different attack methods and larger values of $\\epsilon$ are included in the ablation study.", + "bbox": [ + 212, + 444, + 787, + 518 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Metric: We measure transferability using the error rate, with a higher rate indicating greater transferability. In the tables of this section, we first present a row labeled 'n/a' to denote the error rate for perturbations generated by the original source model. We then demonstrate the change in transferability after alignment following the $+ / -$ sign. A larger change indicates a greater increase in transferability resulting from using the aligned model. All results presented in this section are obtained from the average of three independent runs.", + "bbox": [ + 212, + 520, + 787, + 625 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Model Alignment Improves Transferability", + "text_level": 1, + "bbox": [ + 215, + 648, + 614, + 664 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To demonstrate the improved transferability of perturbations generated using the aligned source model, we evaluate across a diverse set of neural network architectures for both source and witness models, focusing on the transferability to an extensive array of target models. Tab. 2 shows the original error rates and their changes after using the aligned model. We make two key observations.", + "bbox": [ + 212, + 672, + 787, + 750 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "First, the model alignment approach can transform any given source model into one from which the PGD attack generates more transferable perturbations. Such an improvement can be observed across various combinations of source and witness models and is evident in all evaluated target models. This clear improvement validates our approach, showing that aligning the source model can lead to the generation of more transferable adversarial perturbations. Notably,", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/61a718bb852bbead1fb32502e32427ea7841fff473a2e8322320bfde08e422fd.jpg", + "table_caption": [ + "Table 2: Aligning the source model can lead to the generation of more transferable adversarial examples. The result demonstrates the increase in error rates when adversarial examples generated from aligned source models are applied to different target models. Our method improves the transferability of adversarial examples generated from a wide range of architectures, including both CNNs and ViTs." + ], + "table_footnote": [], + "table_body": "
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res50+9.60+9.90+8.12+6.59+8.98+4.79+0.67+0.65+0.42+2.65
VGG19+8.30+7.88+7.41+9.17+9.93+6.76+0.75+0.52+0.17+1.97
DN121+9.39+10.82+8.40+8.41+12.41+7.21+1.87+2.02+0.38+2.61
IncV3+7.69+7.52+5.99+5.56+9.19+8.23+2.29+0.30+0.24+3.01
ViT-B/16-9.41-19.39-17.48-10.04-12.76-8.49-3.25-2.69-1.14-4.17
SWIN-9.23-16.21-14.30-7.27-10.02-5.53-2.72-2.93-2.36-2.73
VGG19n/a33.4930.1026.1379.4332.0730.6223.2719.8518.6623.09
Res50+7.19+4.16+2.76+5.19+7.62+5.91+3.45+1.20+1.36+1.12
VGG19+4.66+2.10+1.77+7.30+3.44+1.74+2.64+0.68+1.39+0.90
DN121+6.35+3.52+5.07+10.60+10.45+5.03+4.09+2.36+2.58+1.31
IncV3+4.91+1.57+1.66+3.82+4.94+4.33+2.70+0.61+0.61+1.04
ViT-B/16-4.34-5.68-5.01-24.66-5.11-3.67-0.83-0.37+0.77-2.53
SWIN-3.24-5.83-4.01-21.91-6.48-4.05-1.11-0.73+0.64-2.96
DN121n/a40.2044.0137.1540.8461.1532.2823.6820.3418.2123.56
Res50+11.67+12.96+8.37+7.32+11.68+5.41+1.69+0.46+1.00+1.59
VGG19+9.02+6.38+4.88+12.34+7.87+3.77+2.72+0.04+1.22+0.94
DN121+12.56+11.60+10.48+9.10+15.47+6.84+3.99+1.59+1.24+1.86
IncV3+8.08+10.50+9.88+9.91+12.76+7.24+3.81+1.23-0.02+2.79
ViT-B/16-3.08-8.43-7.78-6.67-12.96-1.78+2.06+1.26+1.22-2.78
SWIN-4.13-8.57-5.34-6.11-10.21-4.64+0.54-0.16+1.21-1.88
IncV3n/a30.6827.4925.0233.4730.9851.8022.9918.7717.7220.94
Res50+4.92+6.59+4.27+5.49+5.74+4.49+1.71+2.26+2.74+2.23
VGG19+4.65+2.69+3.10+5.70+3.39+4.36+1.05-0.54+0.38+0.53
DN121+4.50+6.38+2.13+7.35+6.52+8.89+3.54+0.68+1.41+1.45
IncV3+1.78+3.91+3.70+3.53+3.06+8.75+1.79+0.49+1.41+1.75
ViT-B/16+0.47-1.13-2.97-0.77-1.35-8.20+2.92+1.64+2.07-0.23
SWIN-0.49-3.36-3.85-3.29-4.54-12.82+0.09+0.76+1.13-1.34
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
Res50+17.53+12.89+12.23+14.83+16.66+15.76+43.47+37.17+29.16+21.16
VGG19+10.89+9.49+9.77+14.23+12.65+10.94+39.63+31.65+21.30+14.97
DN121+17.15+13.92+12.28+15.38+17.68+16.96+47.36+41.88+31.22+21.87
IncV3+15.41+11.87+11.31+15.09+14.23+16.46+46.07+40.39+28.87+19.92
ViT-B/16+5.14+2.04+2.07+4.79+2.87+4.53+24.04+23.14+21.93+6.34
SWIN+6.31+5.75+5.92+8.12+7.46+7.28+39.11+36.49+28.61+14.62
", + "bbox": [ + 220, + 227, + 782, + 571 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "both CNN and ViT-based source models can benefit from the alignment process. Recent studies have shown that the transferability between ViTs and CNNs is poor, and many attack algorithms do not generalize well to ViTs [38,40,55]. Our model alignment method offers a promising solution to bridge this gap.", + "bbox": [ + 212, + 612, + 784, + 672 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Second, we find that CNN-based source models generally benefit from aligning with other CNN-based models, rather than with ViT-based models. On the other hand, the ViT-B/16 source model can benefit from aligning with witness models from both CNN and ViT families. We provide a possible explanation for this phenomenon. Previous studies have shown that ViTs and CNNs learn distinctively different features [45, 72]. Specifically, Raghu et al. [45] focused on early-layer representations learned by the two models and showed that more ResNet layers are required to be modified to match hidden representations of a ViT, compared to the other way around. In the context of model alignment, this suggests an asymmetric behavior in the alignment process; namely, it might be easier to align ViTs with CNNs than to align CNNs with ViTs.", + "bbox": [ + 212, + 674, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Choosing the witness model: The main goal of Tab. 2 is to demonstrate that the improved transferability is not limited to particular choices of witness models. The result also highlights the effectiveness of a straightforward, hyper-parameter-free self-alignment strategy. This is evident from the consistent improvement observed when the source and witness models share the same architecture, but are initialized and trained independently. The selection of witness models is further explored in our ablation studies.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Regularization to prevent overfitting: A prolonged alignment process may inadvertently cause overfitting to the witness model, thereby diminishing the gains in transferability. To counteract overfitting, regularization methods can be implemented. For example, we apply early stopping and limit the alignment to a single epoch. Moreover, an ensemble of witnesses can be used to avert overfitting to any singular witness model. Results with multiple witness models are included in the supplementary material. Furthermore, when aligning by minimizing KL divergence, adjusting the temperature scaling within the softmax function can be an effective measure to prevent the exact replication of the witness model's predictions by the source model.", + "bbox": [ + 212, + 255, + 787, + 405 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Ablation Studies", + "text_level": 1, + "bbox": [ + 215, + 436, + 401, + 452 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We conduct several ablation studies to investigate factors that could further improve the alignment process. Additionally, we demonstrate that our approach is compatible with a wide range of attack algorithms.", + "bbox": [ + 212, + 470, + 785, + 517 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Smaller Witness Model Might Boost Learning Shared Features. Results in Tab. 2 indicate that DN121, which has the fewest parameters, frequently emerges as a more effective witness model. This motivates us to investigate the role of the capacity of the witness model during the alignment. While several factors contribute to a model's capacity, such as its structure, the normalization techniques, and its non-linear activations, our study primarily focuses on the number of parameters as a proxy for capacity. With this in mind, we consider three models each from the ResNet and ViT families.", + "bbox": [ + 212, + 547, + 787, + 669 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tab. 3 summarizes the results of the model capacity analysis, pointing to one key observation. Model alignment is more effective when the witness models have a smaller model capacity. For instance, when using Res101 as the source model, alignment with the lower capacity Res18 as the witness model is more beneficial than alignment with Res50. This matches the previous findings in Tab. 2.", + "bbox": [ + 212, + 672, + 787, + 747 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We provide one interpretation of this observation. Smaller models might tend to focus more on learning semantic features for generalization, as they lack the capacity of larger models to learn imperceptible features. Therefore, when a source model is aligned with a smaller model, it is steered towards learning more semantic features that are commonly shared across different models, thereby leading to more transferable perturbations.", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 732, + 130 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/f8efd4e635b4204b33bc92edb1fab858d4946fc5d8af67b98aa9b1247048884c.jpg", + "table_caption": [ + "Table 3: Analyzing the impact of witness model capacity on the alignment process. We observe a greater improvement in the transferability of adversarial perturbations when the source model is aligned with witness models of smaller capacity." + ], + "table_footnote": [], + "table_body": "
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res18n/a64.1045.8537.0942.9648.5737.3127.5221.1220.5721.31
Res50-1.94+0.41-0.74+0.82-1.24-1.78+0.26+1.33+0.42+1.48
Res101-5.13-3.92-2.70-1.75-1.39-0.22+0.53+0.25+0.03+0.48
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res18+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
Res101+4.27+3.02+3.93+3.61+4.41+3.60+1.86-0.54+0.14+1.36
Res101n/a38.8454.6362.9539.2449.9334.7723.0120.1219.0722.90
Res18+40.64+35.11+27.78+29.63+33.20+28.42+10.10+5.70+2.37+13.99
Res50+14.97+19.56+16.97+13.50+17.07+10.41+4.04+0.98+1.44+4.81
ViT-T/16n/a28.7723.4521.0525.4125.4525.2263.8940.4729.6222.97
ViT-S/16+0.30+0.70+1.02+2.76+0.54+0.69+7.01+3.77+2.92+0.42
ViT-B/16+0.86-0.18-1.11+1.15+0.47+0.81+5.09+4.32+3.55-1.57
ViT-S/16n/a24.2720.4818.8621.8521.9022.9647.3452.0943.8523.87
ViT-T/16+9.64+6.65+6.29+8.51+10.66+7.58+40.53+32.27+26.10+12.35
ViT-B/16+3.10+1.21+2.87+3.75+3.19+3.36+19.07+17.44+13.81+4.73
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
ViT-T/16+10.13+9.71+8.42+10.71+11.30+9.89+51.72+44.99+34.69+20.01
ViT-S/16+7.30+4.57+4.53+4.75+6.21+6.34+36.47+35.66+29.43+12.00
", + "bbox": [ + 222, + 199, + 779, + 388 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/2917394146af1c1e9271cf0438a3ffb168a4588bed739a0799ea44a8d4beb620.jpg", + "table_caption": [ + "Table 4: Improving transferability via embedding-space alignment. We focus on Res50 as the source model and Res18 as the witness model. We observe improved transferability when alignment is performed in the embedding space or when combining output and embedding spaces." + ], + "table_footnote": [], + "table_body": "
MethodTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
KL+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
TV+26.04+19.91+11.88+17.40+20.66+15.93+5.70+1.72+0.85+5.79
RKD [41]+2.95+2.12+2.80+2.78+3.35+4.09-1.26-0.53-0.36+0.21
HINT [46]+5.95+6.55+5.27+5.43+9.54+4.34+2.55-0.01+1.24+2.58
EGA [36]+35.35+23.56+27.09+24.69+28.94+22.00+10.12+4.62+3.80+10.37
NCE [6]+21.51+19.25+20.39+16.06+19.70+13.29+6.78+3.38+1.06+6.73
KL+EGA+35.74+26.10+23.23+28.90+29.59+20.06+8.62+3.81+1.81+14.05
KL+NCE+31.35+24.46+20.12+22.62+27.14+19.06+8.48+1.50+2.36+12.18
", + "bbox": [ + 220, + 488, + 779, + 594 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Alignment in the Embedding Space Can Further Improve Transferability. Recent advances in knowledge distillation highlight the benefits of aligning intermediate representations over aligning outputs [6,36,41]. Motivated by this, we investigate aligning the hidden representations of a Res50 source model with a Res18 witness model. We set $q$ in (1) to the layer before the fully-connected layer and evaluate four embedding-space distillation methods: Relational Knowledge Distillation (RKD) [41], Embedding Graph Alignment (EGA) [36], Intermediate-level Hints (HINT) [46] and Noise Contrastive Estimation (NCE) [6]. These methods correspond to different choices of distance metric $d$ in (1). Moreover, alignment can be performed in both output and embedding spaces, requiring the optimization of a combined objective with a scaling hyper-parameter $(\\lambda)$ : $d_q(z_s^{[q]}(x),z_w^{[q]}(x)) + \\lambda d_p(z_s^{[p]}(x),z_w^{[p]}(x))$ , where $p < q = l$ . In our experiment, we combine KL with EGA and NCE $(\\lambda = 1)$ .", + "bbox": [ + 215, + 641, + 785, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/43d0973a7b78b164d095e1a87d52d8ddd949f2943fb9828e36de7a8a151ff924.jpg", + "table_caption": [ + "Table 5: Compatibility of model alignment with different attack algorithms. The Res50 and ViT-B/16 source models are aligned with a Res18 and ViT-T/16 witness model, respectively. Each entry begins with the error rate for perturbations generated by the original source model. Then, this is followed by the change in the error rate after model alignment. The results demonstrate that the model alignment process enhances the effectiveness of all attack algorithms." + ], + "table_footnote": [], + "table_body": "
SourceAttackTarget
Res18VGG19DN121IncV3ViT-B/16SWIN
Res50MI [10]75.54 + 20.2371.46 + 19.9779.60 + 16.3159.08 + 22.2225.19 + 7.8737.04 + 16.02
NI [29]59.71 + 21.9956.30 + 19.1459.56 + 19.9046.45 + 15.5926.66 + 3.6228.62 + 8.41
VMI [53]85.26 + 12.7083.16 + 13.1388.09 + 9.7271.98 + 16.6829.62 + 8.3249.13 + 15.45
VNI [53]86.92 + 11.1885.64 + 11.3690.47 + 8.2173.60 + 16.4029.15 + 8.5846.64 + 16.75
SINI [29]67.43 + 17.0561.73 + 11.8765.82 + 13.3453.74 + 11.9626.07 + 3.0330.59 + 5.29
TI [11]71.31 + 21.6764.87 + 20.1373.95 + 16.8553.13 + 19.1825.58 + 7.5930.00 + 11.71
DI [61]87.95 + 11.0382.12 + 15.8890.02 + 9.4077.78 + 15.4527.48 + 8.6943.20 + 21.83
ViT-B/16MI [10]33.73 + 15.6035.24 + 12.0632.29 + 13.5133.97 + 11.8571.48 + 24.1333.57 + 20.87
NI [29]35.10 + 6.9335.58 + 4.5831.93 + 7.4433.67 + 5.7053.55 + 17.7330.69 + 8.60
VMI [53]35.59 + 18.6537.82 + 14.7234.55 + 16.1234.42 + 15.1577.20 + 19.1437.63 + 21.75
VNI [53]33.99 + 22.4537.19 + 17.1632.59 + 19.9233.19 + 20.8380.07 + 17.4438.19 + 21.89
SINI [29]36.68 + 11.4036.56 + 7.4933.12 + 9.6335.87 + 9.7062.07 + 9.9733.02 + 10.26
TI [11]36.85 + 29.9632.74 + 24.0535.48 + 25.9832.99 + 21.3167.16 + 27.2332.50 + 25.52
DI [61]41.75 + 30.7939.03 + 30.4241.40 + 26.6938.62 + 30.5184.10 + 13.7042.09 + 29.79
", + "bbox": [ + 222, + 241, + 784, + 393 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/f65ec502b0a9712547bfe7d12b4b75fb73cf6ba1a96a190940967f882d87df7b.jpg", + "table_caption": [ + "Table 6: Improved transferability from using aligned models alone or in an ensemble. Perturbations from the aligned model (Res50*) demonstrate higher transferability compared to those from an ensemble of source and witness models." + ], + "table_footnote": [], + "table_body": "
SourceTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res1887.5367.41152.07458.8567.1250.2231.8824.6519.1630.91
Res5066.9785.0272.1464.8875.8949.5632.1425.2322.5828.96
Res50*92.0395.7389.8690.6092.5171.4244.1233.2425.5149.12
Res50 + Res18 [10]91.2591.5680.6075.9085.3660.1119.0115.9510.9027.10
2×Res50* [10]98.7099.4498.3296.0998.7184.6538.9825.7115.4257.30
2×(Res50 + Res18) [10]97.6998.7396.8192.9598.3278.6123.8718.0612.2541.77
", + "bbox": [ + 217, + 472, + 785, + 551 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The results are summarized in Tab. 4, where we also supplement the previous KL-based results with total variation (TV). These results demonstrate improved transferability with other alignment formulations, including both embedding-space and output-embedding-space alignment. These promising findings pave the way for further exploration of embedding-space model alignment to improve adversarial transferability..", + "bbox": [ + 212, + 590, + 787, + 683 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Model Alignment is Compatible with Other Transfer-enhancing Methods. To demonstrate that model alignment is compatible with a wide range of attack algorithms, we extend our analysis to include additional transfer-enhancing attacks. This includes optimization-based methods such as MI-FGSM [10], NIFGSM/SINI-FGSM [29] and VMI-FGSM/VNI-FGSM [53]. We also include data-augmentation-based methods such as TI-FGSM [11] and DI-FGSM [61]. Moreover, we consider a larger $\\ell_{\\infty}$ -norm constraint of $\\epsilon = 8/255$ with a step size of $\\alpha = 2/255$ , and double the number of iterations to 40. The results are summarized in Tab. 5. Each entry begins with the error rate for perturbations generated", + "bbox": [ + 212, + 703, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "by the original source model. Then, this is followed by the change in the error rate after model alignment. We observe that all considered attack algorithms can leverage the aligned source model to improve transferability.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Model-modification attacks: In addition to the attacks included in the table, we show that model alignment can be integrated with LinBP [17] and BPA [60], two model-modification-based methods. We compare the transferability of MI-FGSM-LinBP and PGD-BPA perturbations from the aligned Res50 to those from the original, unaligned Res50. We observe increased transferability across all target models, with an average increase of $9.66\\%$ and $16.86\\%$ , respectively. These results are included in the supplementary material.", + "bbox": [ + 212, + 194, + 784, + 301 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "**Ensemble attacks:** Given that an additional witness model is involved in the attack process, it is important to compare perturbations produced by an aligned model with those generated by an ensemble of the original source and witness model. In Tab. 6, we first demonstrate transferability using the original Res18 and Res50, followed by a Res50 aligned with Res18 (Res50*). Next, we incorporate the ensemble in logits scheme [10] into the PGD attack, and consider three scenarios: an ensemble of the source and witness models (Res50+Res18), an ensemble of two aligned models $(2 \\times \\text{Res50}^*)$ , and an ensemble of two pairs of source-witness models $(2 \\times (\\text{Res50} + \\text{Res18}))$ .", + "bbox": [ + 212, + 301, + 785, + 439 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We make two observations. First, perturbations from a single aligned model demonstrate higher transferability compared to those from an ensemble of source and witness models, and an ensemble of two aligned models not only further improves transferability but also surpasses the performance of the four-model ensemble. Beyond the improved transferability, model alignment brings the added benefits of faster inference times and lower memory requirements, presenting a significant advantage over conventional ensemble approaches. Second, when targeting ViTs, perturbations generated from ResNet ensembles exhibit limited transferability. This observation is in line with the previous result [35], underscoring the specific challenges in transferring attacks between different architectures.", + "bbox": [ + 212, + 441, + 787, + 592 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusions", + "text_level": 1, + "bbox": [ + 215, + 628, + 367, + 643 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we proposed model alignment as a novel perspective in improving the transferability of adversarial examples. During alignment, the parameters of the source model are fine-tuned to minimize an alignment loss which measures the divergence in the predictions between the source and the witness model. We conduct a geometric analysis to study the changes in the loss landscape resulting from this process to better understand the underlying effect of model alignment. Extensive experiments on the ImageNet dataset demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. A limitation of our study is the absence of a theoretical framework to understand the model alignment process, and we consider it as future work.", + "bbox": [ + 212, + 672, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgments. Avery Ma acknowledges the funding from the Natural Sciences and Engineering Research Council (NSERC) through the Canada Graduate Scholarships - Doctoral (CGS D) program. Amir-massoud Farahmand acknowledges the funding from the CIFAR AI Chairs program, as well as the support of the NSERC through the Discovery Grant program (2021-03701). Yangchen Pan, Philip Torr and Jindong Gu acknowledge the support from the UKRI Grant: Turing AI Fellowship EP/W002981/1, EPSRC/MURI Grant: EP/N019474/, and the Royal Academy of Engineering. Resources used in preparing this research were provided, in part, by the Province of Ontario, the Government of Canada through CIFAR, and companies sponsoring the Vector Institute. We would like to also thank the members of the Adaptive Agents Lab who provided feedback on a draft of this paper.", + "bbox": [ + 212, + 146, + 787, + 328 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 354, + 321, + 369 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Ahmed, N., Natarajan, T., Rao, K.R.: Discrete cosine transform. In: IEEE transactions on Computers (1974)", + "2. Benz, P., Zhang, C., Kweon, I.S.: Batch normalization increases adversarial vulnerability and decreases adversarial transferability: A non-robust feature perspective. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021)", + "3. Byun, J., Cho, S., Kwon, M.J., Kim, H.S., Kim, C.: Improving the transferability of targeted adversarial examples through object-based diverse input. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)", + "4. Carratino, L., Cissé, M., Jenatton, R., Vert, J.P.: On mixup regularization. Journal of Machine Learning Research (JMLR) (2022)", + "5. Charles, Z., Rosenberg, H., Papailiopoulos, D.: A geometric perspective on the transferability of adversarial directions. In: International Conference on Artificial Intelligence and Statistics (AISTATS) (2019)", + "6. Chen, Y., Xian, Y., Koepke, A., Shan, Y., Akata, Z.: Distilling audio-visual knowledge by compositional contrastive learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)", + "7. Cheng, H., Xiao, E., Cao, J., Yang, L., Xu, K., Gu, J., Xu, R.: Typography leads semantic diversifying: Amplifying adversarial transferability across multimodal large language models. arXiv preprint arXiv:2405.20090 (2024)", + "8. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.: AutoAugment: Learning augmentation strategies from data. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)", + "9. Deng, Y., Zheng, X., Zhang, T., Chen, C., Lou, G., Kim, M.: An analysis of adversarial attacks and defenses on autonomous driving models. In: IEEE International Conference on Pervasive Computing and Communications (PerCom) (2020)", + "10. Dong, Y., Liao, F., Pang, T., Su, H., Zhu, J., Hu, X., Li, J.: Boosting adversarial attacks with momentum. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018)", + "11. Dong, Y., Pang, T., Su, H., Zhu, J.: Evading defenses to transferable adversarial examples by translation-invariant attacks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + ], + "bbox": [ + 217, + 388, + 785, + 840 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (ICLR) (2021)", + "13. Fawzi, A., Moosavi-Dezfooli, S.M., Frossard, P.: The robustness of deep networks: A geometrical perspective. In: IEEE Signal Processing Magazine (2017)", + "14. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: International Conference on Learning Representations (ICLR) (2015)", + "15. Gu, J., Jia, X., de Jorge, P., Yu, W., Liu, X., Ma, A., Xun, Y., Hu, A., Khakzar, A., Li, Z., Cao, X., Torr, P.: A survey on transferability of adversarial examples across deep neural networks. Transactions on Machine Learning Research (TMLR) (2024)", + "16. Gubri, M., Cordy, M., Papadakis, M., Traon, Y.L., Sen, K.: Lgv: Boosting adversarial example transferability from large geometric vicinity. In: Proceedings of the European Conference on Computer Vision (ECCV) (2022)", + "17. Guo, Y., Li, Q., Chen, H.: Backpropagating linearly improves transferability of adversarial examples. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)", + "18. Han, D., Jia, X., Bai, Y., Gu, J., Liu, Y., Cao, X.: OT-Attack: Enhancing adversarial transferability of vision-language models via optimal transport optimization. arXiv preprint arXiv:2312.04403 (2023)", + "19. He, K., Zhang, X., Ren, S., Sun, J.: Identity mappings in deep residual networks. In: Proceedings of the European Conference on Computer Vision (ECCV) (2016)", + "20. He, T., Zhang, Z., Zhang, H., Zhang, Z., Xie, J., Li, M.: Bag of tricks for image classification with convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)", + "21. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)", + "22. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017)", + "23. Ilyas, A., Santurkar, S., Tsipras, D., Engstrom, L., Tran, B., Madry, A.: Adversarial examples are not bugs, they are features. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)", + "24. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning (ICML) (2015)", + "25. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Advances in Neural Information Processing Systems (NeurIPS) (2012)", + "26. Li, Q., Guo, Y., Zuo, W., Chen, H.: Making substitute models more bayesian can enhance transferability of adversarial examples. In: International Conference on Learning Representations (ICLR) (2022)", + "27. Li, Y., Bai, S., Xie, C., Liao, Z., Shen, X., Yuille, A.: Regional homogeneity: Towards learning transferable universal adversarial perturbations against defenses. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)", + "28. Li, Z., Shi, C., Xie, Y., Liu, J., Yuan, B., Chen, Y.: Practical adversarial attacks against speaker recognition systems. In: Proceedings of the 21st International Workshop on Mobile Computing Systems and Applications (2020)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "29. Lin, J., Song, C., He, K., Wang, L., Hopcroft, J.E.: Nesterov accelerated gradient and scale invariance for adversarial attacks. In: International Conference on Learning Representations (ICLR) (2020)", + "30. Liu, Y., Chen, X., Liu, C., Song, D.: Delving into transferable adversarial examples and black-box attacks. In: International Conference on Learning Representations (ICLR) (2016)", + "31. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)", + "32. Luo, H., Gu, J., Liu, F., Torr, P.: An image is worth 1000 lies: Transferability of adversarial images across prompts on vision-language models. In: International Conference on Learning Representations (ICLR) (2024)", + "33. Ma, A., Dvornik, N., Zhang, R., Pishdad, L., Derpanis, K.G., Fazly, A.: SAGE: Saliency-guided mixup with optimal rearrangements. In: British Machine Vision Conference (BMVC) (2022)", + "34. Ma, A., Pan, Y., Farahmand, A.m.: Understanding the robustness difference between stochastic gradient descent and adaptive gradient methods. Transactions on Machine Learning Research (TMLR) (2023)", + "35. Ma, W., Li, Y., Jia, X., Xu, W.: Transferable adversarial attack for both vision transformers and convolutional networks via momentum integrated gradients. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023)", + "36. Ma, Y., Chen, Y., Akata, Z.: Distilling knowledge from self-supervised teacher by embedding graph alignment. In: British Machine Vision Conference (BMVC) (2022)", + "37. Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: International Conference on Learning Representations (ICLR) (2018)", + "38. Mahmood, K., Mahmood, R., Van Dijk, M.: On the robustness of vision transformers to adversarial examples. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021)", + "39. Müller, R., Kornblith, S., Hinton, G.E.: When does label smoothing help? In: Advances in Neural Information Processing Systems (NeurIPS) (2019)", + "40. Naseer, M., Ranasinghe, K., Khan, S., Khan, F.S., Porikli, F.: On improving adversarial transferability of vision transformers. In: International Conference on Learning Representations (ICLR) (2021)", + "41. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)", + "42. Qayyum, A., Qadir, J., Bilal, M., Al-Fuqaha, A.: Secure and robust machine learning for healthcare: A survey. In: IEEE Reviews in Biomedical Engineering (2020)", + "43. Qian, Y., He, S., Zhao, C., Sha, J., Wang, W., Wang, B.: Lea2: A lightweight ensemble adversarial attack via non-overlapping vulnerable frequency regions. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023)", + "44. Qin, Z., Fan, Y., Liu, Y., Shen, L., Zhang, Y., Wang, J., Wu, B.: Boosting the transferability of adversarial attacks with reverse adversarial perturbation. In: Advances in Neural Information Processing Systems (NeurIPS) (2022)", + "45. Raghu, M., Unterthiner, T., Kornblith, S., Zhang, C., Dosovitskiy, A.: Do vision transformers see like convolutional neural networks? In: Advances in Neural Information Processing Systems (NeurIPS) (2021)" + ], + "bbox": [ + 215, + 146, + 784, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)", + "47. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (ICLR) (2015)", + "48. Steiner, A., Kolesnikov, A., Zhai, X., Wightman, R., Uszkoreit, J., Beyer, L.: How to train your vit? data, augmentation, and regularization in vision transformers. Transactions on Machine Learning Research (TMLR) (2021)", + "49. Szegedy, C., Vanhoucke, V., Ioffe, S., Shlens, J., Wojna, Z.: Rethinking the inception architecture for computer vision. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016)", + "50. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. In: International Conference on Learning Representations (ICLR) (2014)", + "51. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold Mixup: Better representations by interpolating hidden states. In: International Conference on Learning Representations (ICLR) (2019)", + "52. Wang, H., Wu, X., Huang, Z., Xing, E.P.: High-frequency component helps explain the generalization of convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)", + "53. Wang, X., He, K.: Enhancing the transferability of adversarial attacks through variance tuning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)", + "54. Waseda, F., Nishikawa, S., Le, T.N., Nguyen, H.H., Echizen, I.: Closer look at the transferability of adversarial examples: How they fool different models differently. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) (2023)", + "55. Wei, Z., Chen, J., Goldblum, M., Wu, Z., Goldstein, T., Jiang, Y.G.: Towards transferable adversarial attacks on vision transformers. In: AAAI Conference on Artificial Intelligence (AAAI) (2022)", + "56. Wu, D., Wang, Y., Xia, S.T., Bailey, J., Ma, X.: Skip connections matter: On the transferability of adversarial examples generated with resnets. In: International Conference on Learning Representations (ICLR) (2020)", + "57. Wu, L., Zhu, Z.: Towards understanding and improving the transferability of adversarial examples in deep neural networks. In: Asian Conference on Machine Learning (2020)", + "58. Wu, W., Su, Y., Lyu, M.R., King, I.: Improving the transferability of adversarial samples with adversarial transformations. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)", + "59. Xiao, Z., Gao, X., Fu, C., Dong, Y., Gao, W., Zhang, X., Zhou, J., Zhu, J.: Improving transferability of adversarial patches on face recognition with generative models. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)", + "60. Xiaosen, W., Tong, K., He, K.: Rethinking the backward propagation for adversarial transferability. In: Advances in Neural Information Processing Systems (NeurIPS) (2024)", + "61. Xie, C., Zhang, Z., Zhou, Y., Bai, S., Wang, J., Ren, Z., Yuille, A.L.: Improving transferability of adversarial examples with input diversity. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "A. Ma et al.", + "bbox": [ + 271, + 114, + 354, + 126 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "62. Xiong, Y., Lin, J., Zhang, M., Hopcroft, J.E., He, K.: Stochastic variance reduced ensemble adversarial attack for boosting the adversarial transferability. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)", + "63. Yin, D., Gontijo Lopes, R., Shlens, J., Cubuk, E.D., Gilmer, J.: A Fourier perspective on model robustness in computer vision. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)", + "64. Yu, W., Gu, J., Li, Z., Torr, P.: Reliable evaluation of adversarial transferability. arXiv preprint arXiv:2306.08565 (2023)", + "65. Yun, S., Han, D., Oh, S.J., Chun, S., Choe, J., Yoo, Y.: CutMix: Regularization strategy to train strong classifiers with localizable features. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)", + "66. Zhang, C., Benz, P., Karjauv, A., Cho, J.W., Zhang, K., Kweon, I.S.: Investigating top-k white-box and transferable black-box attack. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)", + "67. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: Mixup: Beyond empirical risk minimization. In: International Conference on Learning Representations (ICLR) (2018)", + "68. Zhang, L., Deng, Z., Kawaguchi, K., Ghorbani, A., Zou, J.: How does mixup help with robustness and generalization? In: International Conference on Learning Representations (ICLR) (2021)", + "69. Zhang, Y., Hu, S., Zhang, L.Y., Shi, J., Li, M., Liu, X., Wan, W., Jin, H.: Why does little robustness help? a further step towards understanding adversarial transferability. In: Proceedings of the IEEE Symposium on Security and Privacy (SP) (2024)", + "70. Zhao, P., Chen, P.Y., Das, P., Ramamurthy, K.N., Lin, X.: Bridging mode connectivity in loss landscapes and adversarial robustness. In: International Conference on Learning Representations (ICLR) (2020)", + "71. Zhao, Z., Liu, Z., Larson, M.: On success and simplicity: A second look at transferable targeted attacks. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)", + "72. Zhou, D., Yu, Z., Xie, E., Xiao, C., Anandkumar, A., Feng, J., Alvarez, J.M.: Understanding the robustness in vision transformers. In: International Conference on Machine Learning (ICML) (2022)", + "73. Zhu, Y., Sun, J., Li, Z.: Rethinking adversarial transferability from a data distribution perspective. In: International Conference on Learning Representations (ICLR) (2021)", + "74. Zou, J., Pan, Z., Qiu, J., Liu, X., Rui, T., Li, W.: Improving the transferability of adversarial examples with resized-diverse-inputs, diversity-ensemble and region fitting. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)" + ], + "bbox": [ + 212, + 146, + 787, + 715 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Improving Adversarial Transferability via Model Alignment", + "bbox": [ + 334, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_model.json b/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_model.json new file mode 100644 index 0000000000000000000000000000000000000000..da2e04390e1de6811d2f085889c02979fd8efdd4 --- /dev/null +++ b/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_model.json @@ -0,0 +1,2526 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.266, + 0.141, + 0.744, + 0.187 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "text", + "bbox": [ + 0.286, + 0.212, + 0.719, + 0.246 + ], + "angle": 0, + "content": "Avery Ma\\(^{1,2}\\), Amir-massoud Farahmand\\(^{1,2}\\), Yangchen Pan\\(^{3}\\), Philip Torr\\(^{3}\\), and Jindong Gu\\(^{3}\\)" + }, + { + "type": "text", + "bbox": [ + 0.361, + 0.255, + 0.643, + 0.282 + ], + "angle": 0, + "content": "1 University of Toronto, Toronto, Canada \nama@cs.toronto.edu" + }, + { + "type": "text", + "bbox": [ + 0.379, + 0.283, + 0.623, + 0.296 + ], + "angle": 0, + "content": "\\(^{2}\\) Vector Institute, Toronto, Canada" + }, + { + "type": "text", + "bbox": [ + 0.38, + 0.297, + 0.622, + 0.311 + ], + "angle": 0, + "content": "3 University of Oxford, Oxford, UK" + }, + { + "type": "list", + "bbox": [ + 0.361, + 0.255, + 0.643, + 0.311 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.348, + 0.744, + 0.543 + ], + "angle": 0, + "content": "Abstract. Neural networks are susceptible to adversarial perturbations that are transferable across different models. In this paper, we introduce a novel model alignment technique aimed at improving a given source model's ability in generating transferable adversarial perturbations. During the alignment process, the parameters of the source model are finetuned to minimize an alignment loss. This loss measures the divergence in the predictions between the source model and another, independently trained model, referred to as the witness model. To understand the effect of model alignment, we conduct a geometric analysis of the resulting changes in the loss landscape. Extensive experiments on the ImageNet dataset, using a variety of model architectures, demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. Our source code is available at https://github.com/averyma/model-alignment." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.568, + 0.377, + 0.584 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.788, + 0.689 + ], + "angle": 0, + "content": "Adversarial examples with small perturbations can mislead deep neural networks to make wrong predictions [50]. It has been observed that perturbations created to attack one model can also fool other models, which is known as adversarial transferability [14]. The transferability of such perturbations has received significant attention recently since it poses practical concerns for the deployment of machine learning systems in real-world applications [9,28,42]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.788, + 0.841 + ], + "angle": 0, + "content": "One possible explanation for this transferability is that transferable perturbations exploit similar features present in both the source and target models [23]. To see this, let us first consider the hypothesis that neural networks capture two distinct types of features from data: semantic features and human-imperceptible features. This hypothesis has been proposed and supported in [34, 52, 63]. We provide a summary of their findings as follows. First, models learn semantic features that align with human perception. The extraction of such features is similar across different models, reflecting a shared understanding of the semantics. Second, models learn human-imperceptible features, and their learning is model-specific. For example, Ma et al. [34] showed that the use of these features" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.127 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.148, + 0.782, + 0.273 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.299, + 0.788, + 0.397 + ], + "angle": 0, + "content": "Fig. 1: Attacking the aligned source model for more transferable perturbations. We compare the transferability of \\(\\ell_{\\infty}\\)-norm bounded perturbations (\\(\\epsilon = 4/255\\)) generated using the source model before and after performing model alignment. The result highlights the compatibility of model alignment with a wide range of attacks, as perturbations generated from the aligned source model become more transferable. Here, the source model is aligned using a witness model from the same architecture but is initialized and trained independently. Results are averaged over all target models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.428, + 0.786, + 0.459 + ], + "angle": 0, + "content": "varies with models' optimization processes, while Wang et al. [52] showed that model architecture leads to specific feature interpretations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.459, + 0.788, + 0.641 + ], + "angle": 0, + "content": "Features and vulnerabilities are highly correlated, as vulnerabilities often stem from the exploitation of certain features [23]. In the context of transferability, the degree of similarity between those exploited features in the source and target model is crucial. That is, the more similar the exploited features between models, the more likely it is that the perturbation will successfully transfer. To support this, Liu et al. [30] showed that different models have similar decision boundaries (from learning similar features), thus enabling some perturbation to be transferable across different models. However, some perturbations exploit features that are specific to the source model. Qin et al. [44] demonstrated that when maximizing the cross entropy loss to find adversarial examples, some perturbations fail to transfer since they are located at sharp local maxima unique to the source model, which do not exist for the target model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.642, + 0.787, + 0.687 + ], + "angle": 0, + "content": "Motivated by these observations, we propose a model alignment technique to modify the source model to encourage a similar feature extraction as other, independently trained models, which we refer to as witness models." + }, + { + "type": "title", + "bbox": [ + 0.253, + 0.688, + 0.751, + 0.718 + ], + "angle": 0, + "content": "Our goal is to transform any source model into one from which attacks generate more transferable perturbations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.787, + 0.809 + ], + "angle": 0, + "content": "During the alignment process, the source model's parameters are fine-tuned to minimize an alignment loss, which measures the prediction divergence between the source and witness models. Through this alignment process, the source model learns to focus on a set of features that are similarly extracted by the witness model. This allows attack algorithms to more effectively exploit features common across models, leading to more transferable perturbations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Because of the orthogonal nature of our approach, model alignment complements, rather than competes with, other attack algorithms. This synergy under-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "scores our method's key advantage: its broad compatibility with a wide range of attack algorithms, as highlighted in Fig. 1. Extensive experiments on various combinations of architectures, transferability on individual target models, and results with other attacks are included in Sec. 4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.785, + 0.342 + ], + "angle": 0, + "content": "We analyze the effect of the proposed alignment method, demonstrating that perturbations generated from the source model exploit more semantic features that are shared across different models. Additionally, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process. The analysis explores the relationship between model alignment and the use of soft labels [20,49,67]. Results show that there is a notable smoothing effect on the loss surface of the model, which is consistent with prior findings that adversarial examples from flatter maxima are more transferable [16,44]. Our contributions can be summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.355, + 0.784, + 0.398 + ], + "angle": 0, + "content": "- We present a model alignment method to fine-tune the source model by minimizing an alignment loss which measures the difference in the output between the source model and the witness model." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.401, + 0.785, + 0.43 + ], + "angle": 0, + "content": "- To understand the effect of model alignment, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.431, + 0.785, + 0.505 + ], + "angle": 0, + "content": "- Extensive experiments on ImageNet [25], using convolutional neural networks (CNNs) and Vision Transformers (ViTs) [12,31], demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. We demonstrate that our alignment technique is compatible with a wide range of attacks." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.355, + 0.785, + 0.505 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.531, + 0.388, + 0.546 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.564, + 0.784, + 0.609 + ], + "angle": 0, + "content": "In this section, we provide a brief overview of approaches to generate more transferable perturbations. For a more comprehensive review of research related to adversarial transferability, we direct the reader to a recent survey [15]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.632, + 0.582, + 0.646 + ], + "angle": 0, + "content": "2.1 Generating Transferable Perturbations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.785, + 0.719 + ], + "angle": 0, + "content": "Existing work on improving the transferability of adversarial examples can be categorized into four groups: data-augmentation-based methods [3,7,11,27,58,61, 74], optimization-based methods [10,18,29,32,53,59,66,71], model-modificationbased methods [2,17,56,60], and ensemble-based methods [16,26,30,43]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.785, + 0.794 + ], + "angle": 0, + "content": "Data-augmentation-based methods: Data augmentation prevents overfitting in deep neural networks, with advanced techniques [8, 33, 65, 67] being key for state-of-the-art generalization on large datasets. Building on this, several works have incorporated data augmentation into attacks to prevent adversarial examples from overfitting to the source model, thereby improving transferability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Optimization-based methods: Lin et al. [29] drew a parallel between generating transferable adversarial examples and training neural networks. In this analogy, source models are the training data, adversarial perturbations are model" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.232, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.358, + 0.129 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.786, + 0.208 + ], + "angle": 0, + "content": "parameters, and the target model is the testing data. Thus, transferability of adversarial examples is akin to model generalization. Optimization-based methods, such as momentum [10, 29, 74] and variance tuning [53, 62], initially designed to improve model generalization, can similarly improve adversarial transferability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.787, + 0.373 + ], + "angle": 0, + "content": "Model-modification-based methods: Several studies have proposed methods to improve transferability by modifying the source model. Benz et al. [2] showed that perturbations from models without batch normalization [24] are more transferable. Methods like Linear Backpropagation (LinBP) [17] and Backward Propagation Attack (BPA) [60] focus on non-linear activations and modify the derivative of ReLU. Wu et al. [56] showed that increasing gradients from skip connections can improve transferability. A key advantage of our approach is its model-agnostic nature: alignment can be applied without changing the model's forward or backward pass, improving any source model's ability to generate more transferable perturbations. In contrast, other methods require changes, such as those seen in LinBP and BPA, or even complete retraining." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.374, + 0.789, + 0.48 + ], + "angle": 0, + "content": "Ensemble-based methods: Another line of approaches involves the use of multiple models for generating adversarial examples. Liu et al. [30] were among the first to propose enhancing transferability by attacking an ensemble of models, with the rationale being that a perturbation capable of fooling multiple models is more likely to deceive the target model. More recently, Gubri et al. [16] proposed constructing an ensemble of source models by collecting weights along the finetuning trajectory of a trained model." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.499, + 0.611, + 0.515 + ], + "angle": 0, + "content": "2.2 Understanding Adversarial Transferability" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.521, + 0.788, + 0.689 + ], + "angle": 0, + "content": "Several works have focused on understanding the transferability of adversarial perturbations [54, 57, 69, 73], with some analyzing from a geometric perspective [5, 13, 30, 70]. Liu et al. [30] showed that weakly transferable adversarial examples often fall into local maxima of the source model. They found that some perturbations fail to transfer because they reside in tiny pockets corresponding to the ground truth label, present in the source model but not in the target model. Similarly, Gubri et al. [16] hypothesized that adversarial examples at flat loss maxima transfer more effectively than those at sharp maxima. Motivated by these insights, in Sec. 3.3, we extend this geometric perspective to examine how the alignment method influences the source model's loss surface geometry to generate more transferable adversarial examples." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.709, + 0.333, + 0.725 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.738, + 0.787, + 0.768 + ], + "angle": 0, + "content": "We present the model alignment process and understand why aligned models can generate more transferable perturbations." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.788, + 0.363, + 0.803 + ], + "angle": 0, + "content": "3.1 Preliminary" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In this work, we focus on neural networks used for classification tasks. Let us consider a neural network designed for \\( m \\)-class classification, represented as a" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.443, + 0.162 + ], + "angle": 0, + "content": "series of function compositions:" + }, + { + "type": "equation", + "bbox": [ + 0.38, + 0.173, + 0.626, + 0.192 + ], + "angle": 0, + "content": "\\[\nf (x) = (\\phi^ {[ l ]} \\circ \\phi^ {[ l - 1 ]} \\circ \\dots \\circ \\phi^ {[ 1 ]}) (x),\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.201, + 0.788, + 0.368 + ], + "angle": 0, + "content": "where each \\(\\phi^{[i]}\\) represents an operation within the network, which could be a linear transformation (such as a fully connected layer), an activation function, or a pooling operation. The parameters of the neural network are collectively denoted as \\(\\theta\\). The intermediate outputs of these operations are often referred to as hidden representations. We denote them by \\(z^{[i]}\\), where \\(z^{[i]} = \\phi^{[i]}(z^{[i-1]})\\) for \\(i = 1, 2, \\ldots, l\\), and the initial input is \\(z^{[0]} = x\\). Additionally, we incorporate the softmax function into the neural network's definition. Specifically, in the final layer, we have \\(\\phi^{[l]} = \\operatorname{softmax}(z^{[l-1]})\\), where \\(z^{[l-1]}\\) are called the logits. With this definition, the output of this network, \\(f(x)\\), can be interpreted as a probability distribution over the \\(m\\) classes where each component \\(f(x)_i\\) represents the probability of the input \\(x\\) belonging to class \\(i\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.39, + 0.407, + 0.405 + ], + "angle": 0, + "content": "3.2 Model Alignment" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.416, + 0.785, + 0.477 + ], + "angle": 0, + "content": "The goal of model alignment is to modify the source model such that it can extract features similar to those of other models (the witness model). We denote the parameters of the source model and the witness model as \\(\\theta_s\\) and \\(\\theta_w\\), respectively. Let us consider the following point-wise formulation of the alignment loss:" + }, + { + "type": "equation", + "bbox": [ + 0.389, + 0.489, + 0.785, + 0.508 + ], + "angle": 0, + "content": "\\[\n\\ell_ {a} (x, \\theta_ {s}, \\theta_ {w}) = d \\left(z _ {s} ^ {[ q ]} (x), z _ {w} ^ {[ q ]} (x)\\right), \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.514, + 0.785, + 0.528 + ], + "angle": 0, + "content": "where the metric \\(d\\) measures the output difference at layer \\(q\\) between the models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.529, + 0.786, + 0.679 + ], + "angle": 0, + "content": "Model alignment is a fine-tuning process. During alignment, the parameters of the source model are updated to minimize this alignment loss which captures the differences between models' output. Specifically, when \\( q = l \\), the alignment loss measures the divergence between the probability distributions generated by the two models. In this scenario, the Kullback-Leibler (KL) divergence is particularly suitable, due to its effectiveness in measuring distribution differences and its relative ease of implementation in practice. Our analysis and primary experimental results are based on model alignment in the output space, using KL divergence as \\( d \\). We also explore total variation and alignment in the embedding space (i.e., \\( q < l \\)), which is detailed in our ablation study." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.68, + 0.787, + 0.77 + ], + "angle": 0, + "content": "The point-wise loss defined in (1) focuses on aligning the source model with a single witness model. However, alignment can also be extended to multiple witness models to further improve the alignment process. This process involves using a set of witness models, denoted as \\(\\Theta\\), with the number of witness models represented by \\(|\\Theta|\\). Finally, the update rule for the parameters of the source model based on SGD can be written as" + }, + { + "type": "equation", + "bbox": [ + 0.308, + 0.779, + 0.698, + 0.816 + ], + "angle": 0, + "content": "\\[\n\\theta_ {s} (t + 1) = \\theta_ {s} (t) - \\eta \\frac {1}{| \\mathcal {B} | | \\Theta |} \\sum_ {x \\in \\mathcal {B}} \\sum_ {\\theta_ {w} \\in \\Theta} \\nabla \\ell_ {a} (x, \\theta_ {s} (t), \\theta_ {w}),\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.825, + 0.471, + 0.84 + ], + "angle": 0, + "content": "where \\(\\mathcal{B}\\) represents the mini-batch." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.127 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "image", + "bbox": [ + 0.234, + 0.145, + 0.487, + 0.263 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.323, + 0.268, + 0.398, + 0.278 + ], + "angle": 0, + "content": "a. ResNet50." + }, + { + "type": "image", + "bbox": [ + 0.514, + 0.145, + 0.77, + 0.263 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.604, + 0.268, + 0.681, + 0.278 + ], + "angle": 0, + "content": "b. ViT-B/16." + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.29, + 0.788, + 0.375 + ], + "angle": 0, + "content": "Fig.2: A frequency-domain visualization of the differences in the perturbation generated using the original source model and the aligned source model. We compare the magnitude of the DCT coefficients between the perturbations generated by the two models: \\( |\\mathrm{DCT}(\\Delta x_a)| - |\\mathrm{DCT}(\\Delta x_s)| \\). The pronounced brightness in the top-left region of the spectrum indicates that the primary differences lie within the low-frequency range, which is typically associated with semantic features." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.402, + 0.533, + 0.418 + ], + "angle": 0, + "content": "3.3 Understanding Model Alignment" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.788, + 0.534 + ], + "angle": 0, + "content": "We now understand the model alignment approach from two perspectives: semantic feature exploitation and geometric analysis of the loss surface. The analysis in this section uses ResNet50 and ViT-B/16 as source models, which are aligned with ResNet18 and ViT-T/16 as their respective witness models. We consider \\(\\ell_{\\infty}\\)-norm adversarial examples generated using 20 iterations of PGD [37] with \\(\\epsilon = 4 / 255\\) and \\(\\alpha = 1 / 255\\). We use \\(\\Delta x_{s}\\) and \\(\\Delta x_{a}\\) to represent the perturbations generated based on the source and aligned models, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.788, + 0.765 + ], + "angle": 0, + "content": "Aligned Model Exploits More Semantic Features. To verify that attacks applied to the aligned model exploit more semantic features, we compare the perturbations generated using the original and aligned source models. Adversarial perturbations are imperceptible and difficult to characterize in terms of the specific features they exploit in the spatial domain. However, by analyzing perturbations in the frequency domain, we can observe the types of features each model exploits. Previous work has shown that semantic features mostly concentrate around the low-frequency end of the spectrum [34,52,63]. We consider discrete cosine transform (DCT) [1] and compare the DCT coefficients of the perturbations generated from the source and the aligned model, denoted as \\(\\mathrm{DCT}(\\Delta x_s)\\) and \\(\\mathrm{DCT}(\\Delta x_a)\\), respectively. The results are averaged over 1000 randomly sampled images from the ImageNet test set. Since our interest lies in the magnitude of these coefficients, we visualize the difference by computing \\(|\\mathrm{DCT}(\\Delta x_a)| - |\\mathrm{DCT}(\\Delta x_s)|\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.788, + 0.84 + ], + "angle": 0, + "content": "The results are illustrated in Fig. 2. We observe that the differences between the perturbations are predominantly located in the top-left corner of the DCT spectrum, indicating that they primarily differ in the amount of low-frequency information. This result shows that adversarial perturbations generated from the aligned exploit more low-frequency, semantic features." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.145, + 0.761, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.278, + 0.788, + 0.377 + ], + "angle": 0, + "content": "Fig. 3: Visualization of the loss surface around adversarial perturbations for original and aligned ResNet50 and ViT-b/16. Each plot illustrates the loss surface projected on the plane defined by the adversarial perturbation direction and its orthogonal vector. We examine the loss landscape around a clean data point (cyan) and an \\(\\ell_{\\infty}\\)-bounded adversially perturbed data point (red), generated from the source \\((\\Delta x_{s})\\) and aligned models \\((\\Delta x_{a})\\). Perturbations from the original source models are at sharper loss maxima, while those from the aligned model are on flatter surfaces." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.41, + 0.784, + 0.485 + ], + "angle": 0, + "content": "Model Alignment Yields Smoother Loss Surface. Previous works have studied the connection between perturbation from sharp loss maxima and their poor transferability [16, 44]. We extend this geometric perspective by examining how model alignment affects the loss surface geometry of the source model, particularly in its capacity to generate more transferable adversarial examples." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.488, + 0.788, + 0.609 + ], + "angle": 0, + "content": "First, consider when (1) measures the KL divergence between the two models' predictions. During alignment, the source model's parameters are fine-tuned using soft labels from the witness model's outputs. Training deep neural networks with soft labels prevents the model from becoming overly confident in its predictions, thereby improving generalization [20, 21, 39, 49]. Compared to using hard, one-hot encoded labels, it has been shown that training with soft labels implicitly regularizes the norm of the input Jacobian [4, 68], and leads to smoother decision boundaries [51, 67]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.611, + 0.788, + 0.748 + ], + "angle": 0, + "content": "To understand why model alignment can be helpful, we begin by identifying a data point for which the perturbation, when generated based on the original source model, fails to transfer to the target model, but the perturbation generated using the aligned model misleads the target model. In Fig. 3, we visualize the loss surface surrounding this data point, spanned by two pairs of orthogonal vectors: \\(\\Delta x_{s}\\), \\(\\Delta x_{s}^{\\perp}\\), \\(\\Delta x_{a}\\) and \\(\\Delta x_{a}^{\\perp}\\). Here, \\(\\Delta x_{s}^{\\perp}\\) and \\(\\Delta x_{a}^{\\perp}\\) are randomly selected orthogonal vectors and are also bounded by the same \\(\\epsilon\\). In each plot, the center of the plot (cyan) represents the clean data point, and the adversarial example is highlighted using the red marker." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We make two observations. First, the bright yellow region around the perturbations generated from the original source model suggests that they are located at sharp loss maxima. However, these same perturbations do not effectively cause a significant increase in loss when applied to the target model. This observation aligns with previous findings indicating that perturbations with poor transferability often correspond to sharp local maxima unique to the source model, which" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.128 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Comparing the \\(\\ell_2\\)-norm of the input gradient on the original source model and the aligned source model. Results are averaged over 1000 randomly selected ImageNet test samples. The norm decreases significantly when evaluated on all three types of input, suggesting that the smoothing effect induced by the alignment is more global, rather than being confined to specific cases of adversarial examples." + }, + { + "type": "table", + "bbox": [ + 0.306, + 0.227, + 0.7, + 0.294 + ], + "angle": 0, + "content": "
DataResNet50VIT-B/16
OriginalAlignedOriginalAligned
Clean0.0560.0320.0600.029
Gaussian-perturbed0.0570.0320.0630.029
PGD-perturbed0.4530.1710.1840.055
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.341, + 0.786, + 0.447 + ], + "angle": 0, + "content": "are not present in the target model [16, 44]. Second, the loss surface around perturbations generated from the aligned model is noticeably flatter. This is in line with prior findings that adversarial perturbations from flatter maxima tend to be transferable [16, 44]. It is noteworthy that the PGD attack does not explicitly target flat maxima for generating adversarial examples. This observation leads us to hypothesize that the smoothing effect induced by the alignment process is more global, rather than being confined to specific cases of adversarial examples." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.45, + 0.787, + 0.512 + ], + "angle": 0, + "content": "To verify this, we evaluate the change in the \\(\\ell_2\\)-norm of the loss gradients with respect to clean, Gaussian-perturbed \\((\\sigma^2 = 0.01)\\), and PGD-perturbed inputs. More formally, we compare \\(\\| \\nabla_x\\ell (x + \\varDelta x,y,\\theta)\\| _2\\) for \\(\\varDelta x\\in\\{0,\\mathrm{Gaussian},\\mathrm{PGD}\\}\\) for \\(\\theta \\in \\{\\theta_s,\\theta_a\\}\\) over 1000 randomly sampled ImageNet test samples." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.514, + 0.788, + 0.695 + ], + "angle": 0, + "content": "The results are summarized in Tab. 1. We observe a significant decrease in gradient norm across all inputs, and the reduction is particularly pronounced at PGD-perturbed data points. This decrease is consistent with the previous finding which demonstrated a connection between the use of soft labels and the smoothing of the loss surface [4,68]. More importantly, this observation explains the improved transferability with the aligned model. In the supplementary material, we discuss additional results on the change in the largest eigenvalue of input Hessian, which is another popular metric in studying the smoothness of the loss landscape [70]. To evaluate the similarity of models, we measure the change in the KL divergence, prediction agreement, and the cosine similarity of input gradients. The latter is crucial due to its role in the attack process. These results are included in the supplementary material." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.733, + 0.376, + 0.751 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.842 + ], + "angle": 0, + "content": "In this section, we present a series of experiment results to demonstrate the improved ability of a given source model to generate transferable adversarial perturbations. We study factors that can further improve the alignment process and demonstrate the compatibility of our approach with a wide range of attacks." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.414, + 0.163 + ], + "angle": 0, + "content": "4.1 Experiment Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.173, + 0.788, + 0.278 + ], + "angle": 0, + "content": "Model: We consider various neural network architectures as source, witness, and target models. For CNNs, we include ResNet18 (Res18), ResNet50 (Res50), ResNet101 (Res101) [19], VGG19 [47], DenseNet121 (DN121) [22], and Inception-v3 (IncV3) [49]. For ViTs, our selection includes Swin Transformers (SWIN) [31], ViT-T/16, ViT-S/16, and ViT-B/16 [12]. We follow the optimization schedule described in the official Pytorch repository to train all models. Training and model details are included in the supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.279, + 0.788, + 0.369 + ], + "angle": 0, + "content": "Fine-tune: During alignment, all source models are fine-tuned for one epoch using SGD with a momentum of 0.9, a cosine learning rate decay, and a linear warmup. We sweep over 3 learning rates. No additional data is used, as fine-tuning relies on the same training data used to train the source and witness model. We use a batch size of 128 for CNNs and 512 for ViTs. For ViT-based models, we follow [48] and gradients are clipped at a global norm of 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.37, + 0.788, + 0.444 + ], + "angle": 0, + "content": "Dataset: We follow previous work [10,29,64] in which evaluations are based on 1000 randomly selected from the ImageNet test set. For a given source and target model, these samples meet the following criteria: they are correctly classified by both models, and the adversarial examples, when generated from each model, lead to misclassifications in their respective originating models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.445, + 0.788, + 0.52 + ], + "angle": 0, + "content": "Attack method: We focus on non-targeted adversarial perturbations bounded by the \\(\\ell_{\\infty}\\)-norm. Unless otherwise stated, all perturbations are generated using 20 iterations of PGD with \\(\\epsilon = 4/255\\) and \\(\\alpha = 1/255\\). All target models have an error rate of \\(100\\%\\) under white-box PGD attacks. Results with different attack methods and larger values of \\(\\epsilon\\) are included in the ablation study." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.521, + 0.788, + 0.626 + ], + "angle": 0, + "content": "Metric: We measure transferability using the error rate, with a higher rate indicating greater transferability. In the tables of this section, we first present a row labeled 'n/a' to denote the error rate for perturbations generated by the original source model. We then demonstrate the change in transferability after alignment following the \\(+ / -\\) sign. A larger change indicates a greater increase in transferability resulting from using the aligned model. All results presented in this section are obtained from the average of three independent runs." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.649, + 0.616, + 0.665 + ], + "angle": 0, + "content": "4.2 Model Alignment Improves Transferability" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.75 + ], + "angle": 0, + "content": "To demonstrate the improved transferability of perturbations generated using the aligned source model, we evaluate across a diverse set of neural network architectures for both source and witness models, focusing on the transferability to an extensive array of target models. Tab. 2 shows the original error rates and their changes after using the aligned model. We make two key observations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "First, the model alignment approach can transform any given source model into one from which the PGD attack generates more transferable perturbations. Such an improvement can be observed across various combinations of source and witness models and is evident in all evaluated target models. This clear improvement validates our approach, showing that aligning the source model can lead to the generation of more transferable adversarial perturbations. Notably," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.127 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.787, + 0.215 + ], + "angle": 0, + "content": "Table 2: Aligning the source model can lead to the generation of more transferable adversarial examples. The result demonstrates the increase in error rates when adversarial examples generated from aligned source models are applied to different target models. Our method improves the transferability of adversarial examples generated from a wide range of architectures, including both CNNs and ViTs." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.228, + 0.784, + 0.573 + ], + "angle": 0, + "content": "
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res50+9.60+9.90+8.12+6.59+8.98+4.79+0.67+0.65+0.42+2.65
VGG19+8.30+7.88+7.41+9.17+9.93+6.76+0.75+0.52+0.17+1.97
DN121+9.39+10.82+8.40+8.41+12.41+7.21+1.87+2.02+0.38+2.61
IncV3+7.69+7.52+5.99+5.56+9.19+8.23+2.29+0.30+0.24+3.01
ViT-B/16-9.41-19.39-17.48-10.04-12.76-8.49-3.25-2.69-1.14-4.17
SWIN-9.23-16.21-14.30-7.27-10.02-5.53-2.72-2.93-2.36-2.73
VGG19n/a33.4930.1026.1379.4332.0730.6223.2719.8518.6623.09
Res50+7.19+4.16+2.76+5.19+7.62+5.91+3.45+1.20+1.36+1.12
VGG19+4.66+2.10+1.77+7.30+3.44+1.74+2.64+0.68+1.39+0.90
DN121+6.35+3.52+5.07+10.60+10.45+5.03+4.09+2.36+2.58+1.31
IncV3+4.91+1.57+1.66+3.82+4.94+4.33+2.70+0.61+0.61+1.04
ViT-B/16-4.34-5.68-5.01-24.66-5.11-3.67-0.83-0.37+0.77-2.53
SWIN-3.24-5.83-4.01-21.91-6.48-4.05-1.11-0.73+0.64-2.96
DN121n/a40.2044.0137.1540.8461.1532.2823.6820.3418.2123.56
Res50+11.67+12.96+8.37+7.32+11.68+5.41+1.69+0.46+1.00+1.59
VGG19+9.02+6.38+4.88+12.34+7.87+3.77+2.72+0.04+1.22+0.94
DN121+12.56+11.60+10.48+9.10+15.47+6.84+3.99+1.59+1.24+1.86
IncV3+8.08+10.50+9.88+9.91+12.76+7.24+3.81+1.23-0.02+2.79
ViT-B/16-3.08-8.43-7.78-6.67-12.96-1.78+2.06+1.26+1.22-2.78
SWIN-4.13-8.57-5.34-6.11-10.21-4.64+0.54-0.16+1.21-1.88
IncV3n/a30.6827.4925.0233.4730.9851.8022.9918.7717.7220.94
Res50+4.92+6.59+4.27+5.49+5.74+4.49+1.71+2.26+2.74+2.23
VGG19+4.65+2.69+3.10+5.70+3.39+4.36+1.05-0.54+0.38+0.53
DN121+4.50+6.38+2.13+7.35+6.52+8.89+3.54+0.68+1.41+1.45
IncV3+1.78+3.91+3.70+3.53+3.06+8.75+1.79+0.49+1.41+1.75
ViT-B/16+0.47-1.13-2.97-0.77-1.35-8.20+2.92+1.64+2.07-0.23
SWIN-0.49-3.36-3.85-3.29-4.54-12.82+0.09+0.76+1.13-1.34
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
Res50+17.53+12.89+12.23+14.83+16.66+15.76+43.47+37.17+29.16+21.16
VGG19+10.89+9.49+9.77+14.23+12.65+10.94+39.63+31.65+21.30+14.97
DN121+17.15+13.92+12.28+15.38+17.68+16.96+47.36+41.88+31.22+21.87
IncV3+15.41+11.87+11.31+15.09+14.23+16.46+46.07+40.39+28.87+19.92
ViT-B/16+5.14+2.04+2.07+4.79+2.87+4.53+24.04+23.14+21.93+6.34
SWIN+6.31+5.75+5.92+8.12+7.46+7.28+39.11+36.49+28.61+14.62
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.785, + 0.674 + ], + "angle": 0, + "content": "both CNN and ViT-based source models can benefit from the alignment process. Recent studies have shown that the transferability between ViTs and CNNs is poor, and many attack algorithms do not generalize well to ViTs [38,40,55]. Our model alignment method offers a promising solution to bridge this gap." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Second, we find that CNN-based source models generally benefit from aligning with other CNN-based models, rather than with ViT-based models. On the other hand, the ViT-B/16 source model can benefit from aligning with witness models from both CNN and ViT families. We provide a possible explanation for this phenomenon. Previous studies have shown that ViTs and CNNs learn distinctively different features [45, 72]. Specifically, Raghu et al. [45] focused on early-layer representations learned by the two models and showed that more ResNet layers are required to be modified to match hidden representations of a ViT, compared to the other way around. In the context of model alignment, this suggests an asymmetric behavior in the alignment process; namely, it might be easier to align ViTs with CNNs than to align CNNs with ViTs." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "Choosing the witness model: The main goal of Tab. 2 is to demonstrate that the improved transferability is not limited to particular choices of witness models. The result also highlights the effectiveness of a straightforward, hyper-parameter-free self-alignment strategy. This is evident from the consistent improvement observed when the source and witness models share the same architecture, but are initialized and trained independently. The selection of witness models is further explored in our ablation studies." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.256, + 0.788, + 0.406 + ], + "angle": 0, + "content": "Regularization to prevent overfitting: A prolonged alignment process may inadvertently cause overfitting to the witness model, thereby diminishing the gains in transferability. To counteract overfitting, regularization methods can be implemented. For example, we apply early stopping and limit the alignment to a single epoch. Moreover, an ensemble of witnesses can be used to avert overfitting to any singular witness model. Results with multiple witness models are included in the supplementary material. Furthermore, when aligning by minimizing KL divergence, adjusting the temperature scaling within the softmax function can be an effective measure to prevent the exact replication of the witness model's predictions by the source model." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.438, + 0.403, + 0.453 + ], + "angle": 0, + "content": "4.3 Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.472, + 0.787, + 0.518 + ], + "angle": 0, + "content": "We conduct several ablation studies to investigate factors that could further improve the alignment process. Additionally, we demonstrate that our approach is compatible with a wide range of attack algorithms." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.549, + 0.788, + 0.67 + ], + "angle": 0, + "content": "Smaller Witness Model Might Boost Learning Shared Features. Results in Tab. 2 indicate that DN121, which has the fewest parameters, frequently emerges as a more effective witness model. This motivates us to investigate the role of the capacity of the witness model during the alignment. While several factors contribute to a model's capacity, such as its structure, the normalization techniques, and its non-linear activations, our study primarily focuses on the number of parameters as a proxy for capacity. With this in mind, we consider three models each from the ResNet and ViT families." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.673, + 0.788, + 0.748 + ], + "angle": 0, + "content": "Tab. 3 summarizes the results of the model capacity analysis, pointing to one key observation. Model alignment is more effective when the witness models have a smaller model capacity. For instance, when using Res101 as the source model, alignment with the lower capacity Res18 as the witness model is more beneficial than alignment with Res50. This matches the previous findings in Tab. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "We provide one interpretation of this observation. Smaller models might tend to focus more on learning semantic features for generalization, as they lack the capacity of larger models to learn imperceptible features. Therefore, when a source model is aligned with a smaller model, it is steered towards learning more semantic features that are commonly shared across different models, thereby leading to more transferable perturbations." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.127 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.187 + ], + "angle": 0, + "content": "Table 3: Analyzing the impact of witness model capacity on the alignment process. We observe a greater improvement in the transferability of adversarial perturbations when the source model is aligned with witness models of smaller capacity." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.2, + 0.781, + 0.389 + ], + "angle": 0, + "content": "
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res18n/a64.1045.8537.0942.9648.5737.3127.5221.1220.5721.31
Res50-1.94+0.41-0.74+0.82-1.24-1.78+0.26+1.33+0.42+1.48
Res101-5.13-3.92-2.70-1.75-1.39-0.22+0.53+0.25+0.03+0.48
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res18+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
Res101+4.27+3.02+3.93+3.61+4.41+3.60+1.86-0.54+0.14+1.36
Res101n/a38.8454.6362.9539.2449.9334.7723.0120.1219.0722.90
Res18+40.64+35.11+27.78+29.63+33.20+28.42+10.10+5.70+2.37+13.99
Res50+14.97+19.56+16.97+13.50+17.07+10.41+4.04+0.98+1.44+4.81
ViT-T/16n/a28.7723.4521.0525.4125.4525.2263.8940.4729.6222.97
ViT-S/16+0.30+0.70+1.02+2.76+0.54+0.69+7.01+3.77+2.92+0.42
ViT-B/16+0.86-0.18-1.11+1.15+0.47+0.81+5.09+4.32+3.55-1.57
ViT-S/16n/a24.2720.4818.8621.8521.9022.9647.3452.0943.8523.87
ViT-T/16+9.64+6.65+6.29+8.51+10.66+7.58+40.53+32.27+26.10+12.35
ViT-B/16+3.10+1.21+2.87+3.75+3.19+3.36+19.07+17.44+13.81+4.73
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
ViT-T/16+10.13+9.71+8.42+10.71+11.30+9.89+51.72+44.99+34.69+20.01
ViT-S/16+7.30+4.57+4.53+4.75+6.21+6.34+36.47+35.66+29.43+12.00
" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.421, + 0.785, + 0.476 + ], + "angle": 0, + "content": "Table 4: Improving transferability via embedding-space alignment. We focus on Res50 as the source model and Res18 as the witness model. We observe improved transferability when alignment is performed in the embedding space or when combining output and embedding spaces." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.489, + 0.781, + 0.595 + ], + "angle": 0, + "content": "
MethodTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
KL+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
TV+26.04+19.91+11.88+17.40+20.66+15.93+5.70+1.72+0.85+5.79
RKD [41]+2.95+2.12+2.80+2.78+3.35+4.09-1.26-0.53-0.36+0.21
HINT [46]+5.95+6.55+5.27+5.43+9.54+4.34+2.55-0.01+1.24+2.58
EGA [36]+35.35+23.56+27.09+24.69+28.94+22.00+10.12+4.62+3.80+10.37
NCE [6]+21.51+19.25+20.39+16.06+19.70+13.29+6.78+3.38+1.06+6.73
KL+EGA+35.74+26.10+23.23+28.90+29.59+20.06+8.62+3.81+1.81+14.05
KL+NCE+31.35+24.46+20.12+22.62+27.14+19.06+8.48+1.50+2.36+12.18
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.642, + 0.786, + 0.84 + ], + "angle": 0, + "content": "Alignment in the Embedding Space Can Further Improve Transferability. Recent advances in knowledge distillation highlight the benefits of aligning intermediate representations over aligning outputs [6,36,41]. Motivated by this, we investigate aligning the hidden representations of a Res50 source model with a Res18 witness model. We set \\( q \\) in (1) to the layer before the fully-connected layer and evaluate four embedding-space distillation methods: Relational Knowledge Distillation (RKD) [41], Embedding Graph Alignment (EGA) [36], Intermediate-level Hints (HINT) [46] and Noise Contrastive Estimation (NCE) [6]. These methods correspond to different choices of distance metric \\( d \\) in (1). Moreover, alignment can be performed in both output and embedding spaces, requiring the optimization of a combined objective with a scaling hyper-parameter \\( (\\lambda) \\): \\( d_q(z_s^{[q]}(x),z_w^{[q]}(x)) + \\lambda d_p(z_s^{[p]}(x),z_w^{[p]}(x)) \\), where \\( p < q = l \\). In our experiment, we combine KL with EGA and NCE \\( (\\lambda = 1) \\)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.228 + ], + "angle": 0, + "content": "Table 5: Compatibility of model alignment with different attack algorithms. The Res50 and ViT-B/16 source models are aligned with a Res18 and ViT-T/16 witness model, respectively. Each entry begins with the error rate for perturbations generated by the original source model. Then, this is followed by the change in the error rate after model alignment. The results demonstrate that the model alignment process enhances the effectiveness of all attack algorithms." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.242, + 0.785, + 0.394 + ], + "angle": 0, + "content": "
SourceAttackTarget
Res18VGG19DN121IncV3ViT-B/16SWIN
Res50MI [10]75.54 + 20.2371.46 + 19.9779.60 + 16.3159.08 + 22.2225.19 + 7.8737.04 + 16.02
NI [29]59.71 + 21.9956.30 + 19.1459.56 + 19.9046.45 + 15.5926.66 + 3.6228.62 + 8.41
VMI [53]85.26 + 12.7083.16 + 13.1388.09 + 9.7271.98 + 16.6829.62 + 8.3249.13 + 15.45
VNI [53]86.92 + 11.1885.64 + 11.3690.47 + 8.2173.60 + 16.4029.15 + 8.5846.64 + 16.75
SINI [29]67.43 + 17.0561.73 + 11.8765.82 + 13.3453.74 + 11.9626.07 + 3.0330.59 + 5.29
TI [11]71.31 + 21.6764.87 + 20.1373.95 + 16.8553.13 + 19.1825.58 + 7.5930.00 + 11.71
DI [61]87.95 + 11.0382.12 + 15.8890.02 + 9.4077.78 + 15.4527.48 + 8.6943.20 + 21.83
ViT-B/16MI [10]33.73 + 15.6035.24 + 12.0632.29 + 13.5133.97 + 11.8571.48 + 24.1333.57 + 20.87
NI [29]35.10 + 6.9335.58 + 4.5831.93 + 7.4433.67 + 5.7053.55 + 17.7330.69 + 8.60
VMI [53]35.59 + 18.6537.82 + 14.7234.55 + 16.1234.42 + 15.1577.20 + 19.1437.63 + 21.75
VNI [53]33.99 + 22.4537.19 + 17.1632.59 + 19.9233.19 + 20.8380.07 + 17.4438.19 + 21.89
SINI [29]36.68 + 11.4036.56 + 7.4933.12 + 9.6335.87 + 9.7062.07 + 9.9733.02 + 10.26
TI [11]36.85 + 29.9632.74 + 24.0535.48 + 25.9832.99 + 21.3167.16 + 27.2332.50 + 25.52
DI [61]41.75 + 30.7939.03 + 30.4241.40 + 26.6938.62 + 30.5184.10 + 13.7042.09 + 29.79
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.418, + 0.788, + 0.461 + ], + "angle": 0, + "content": "Table 6: Improved transferability from using aligned models alone or in an ensemble. Perturbations from the aligned model (Res50*) demonstrate higher transferability compared to those from an ensemble of source and witness models." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.473, + 0.787, + 0.553 + ], + "angle": 0, + "content": "
SourceTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res1887.5367.41152.07458.8567.1250.2231.8824.6519.1630.91
Res5066.9785.0272.1464.8875.8949.5632.1425.2322.5828.96
Res50*92.0395.7389.8690.6092.5171.4244.1233.2425.5149.12
Res50 + Res18 [10]91.2591.5680.6075.9085.3660.1119.0115.9510.9027.10
2×Res50* [10]98.7099.4498.3296.0998.7184.6538.9825.7115.4257.30
2×(Res50 + Res18) [10]97.6998.7396.8192.9598.3278.6123.8718.0612.2541.77
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.592, + 0.788, + 0.684 + ], + "angle": 0, + "content": "The results are summarized in Tab. 4, where we also supplement the previous KL-based results with total variation (TV). These results demonstrate improved transferability with other alignment formulations, including both embedding-space and output-embedding-space alignment. These promising findings pave the way for further exploration of embedding-space model alignment to improve adversarial transferability.." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Model Alignment is Compatible with Other Transfer-enhancing Methods. To demonstrate that model alignment is compatible with a wide range of attack algorithms, we extend our analysis to include additional transfer-enhancing attacks. This includes optimization-based methods such as MI-FGSM [10], NIFGSM/SINI-FGSM [29] and VMI-FGSM/VNI-FGSM [53]. We also include data-augmentation-based methods such as TI-FGSM [11] and DI-FGSM [61]. Moreover, we consider a larger \\(\\ell_{\\infty}\\)-norm constraint of \\(\\epsilon = 8/255\\) with a step size of \\(\\alpha = 2/255\\), and double the number of iterations to 40. The results are summarized in Tab. 5. Each entry begins with the error rate for perturbations generated" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.127 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "by the original source model. Then, this is followed by the change in the error rate after model alignment. We observe that all considered attack algorithms can leverage the aligned source model to improve transferability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.195, + 0.785, + 0.302 + ], + "angle": 0, + "content": "Model-modification attacks: In addition to the attacks included in the table, we show that model alignment can be integrated with LinBP [17] and BPA [60], two model-modification-based methods. We compare the transferability of MI-FGSM-LinBP and PGD-BPA perturbations from the aligned Res50 to those from the original, unaligned Res50. We observe increased transferability across all target models, with an average increase of \\(9.66\\%\\) and \\(16.86\\%\\), respectively. These results are included in the supplementary material." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.303, + 0.787, + 0.44 + ], + "angle": 0, + "content": "**Ensemble attacks:** Given that an additional witness model is involved in the attack process, it is important to compare perturbations produced by an aligned model with those generated by an ensemble of the original source and witness model. In Tab. 6, we first demonstrate transferability using the original Res18 and Res50, followed by a Res50 aligned with Res18 (Res50*). Next, we incorporate the ensemble in logits scheme [10] into the PGD attack, and consider three scenarios: an ensemble of the source and witness models (Res50+Res18), an ensemble of two aligned models \\((2 \\times \\text{Res50}^*)\\), and an ensemble of two pairs of source-witness models \\((2 \\times (\\text{Res50} + \\text{Res18}))\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.442, + 0.788, + 0.593 + ], + "angle": 0, + "content": "We make two observations. First, perturbations from a single aligned model demonstrate higher transferability compared to those from an ensemble of source and witness models, and an ensemble of two aligned models not only further improves transferability but also surpasses the performance of the four-model ensemble. Beyond the improved transferability, model alignment brings the added benefits of faster inference times and lower memory requirements, presenting a significant advantage over conventional ensemble approaches. Second, when targeting ViTs, perturbations generated from ResNet ensembles exhibit limited transferability. This observation is in line with the previous result [35], underscoring the specific challenges in transferring attacks between different architectures." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.629, + 0.368, + 0.645 + ], + "angle": 0, + "content": "5 Conclusions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.84 + ], + "angle": 0, + "content": "In this paper, we proposed model alignment as a novel perspective in improving the transferability of adversarial examples. During alignment, the parameters of the source model are fine-tuned to minimize an alignment loss which measures the divergence in the predictions between the source and the witness model. We conduct a geometric analysis to study the changes in the loss landscape resulting from this process to better understand the underlying effect of model alignment. Extensive experiments on the ImageNet dataset demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. A limitation of our study is the absence of a theoretical framework to understand the model alignment process, and we consider it as future work." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.329 + ], + "angle": 0, + "content": "Acknowledgments. Avery Ma acknowledges the funding from the Natural Sciences and Engineering Research Council (NSERC) through the Canada Graduate Scholarships - Doctoral (CGS D) program. Amir-massoud Farahmand acknowledges the funding from the CIFAR AI Chairs program, as well as the support of the NSERC through the Discovery Grant program (2021-03701). Yangchen Pan, Philip Torr and Jindong Gu acknowledge the support from the UKRI Grant: Turing AI Fellowship EP/W002981/1, EPSRC/MURI Grant: EP/N019474/, and the Royal Academy of Engineering. Resources used in preparing this research were provided, in part, by the Province of Ontario, the Government of Canada through CIFAR, and companies sponsoring the Vector Institute. We would like to also thank the members of the Adaptive Agents Lab who provided feedback on a draft of this paper." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.355, + 0.323, + 0.371 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.389, + 0.785, + 0.418 + ], + "angle": 0, + "content": "1. Ahmed, N., Natarajan, T., Rao, K.R.: Discrete cosine transform. In: IEEE transactions on Computers (1974)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.419, + 0.787, + 0.46 + ], + "angle": 0, + "content": "2. Benz, P., Zhang, C., Kweon, I.S.: Batch normalization increases adversarial vulnerability and decreases adversarial transferability: A non-robust feature perspective. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.461, + 0.787, + 0.516 + ], + "angle": 0, + "content": "3. Byun, J., Cho, S., Kwon, M.J., Kim, H.S., Kim, C.: Improving the transferability of targeted adversarial examples through object-based diverse input. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.517, + 0.787, + 0.544 + ], + "angle": 0, + "content": "4. Carratino, L., Cissé, M., Jenatton, R., Vert, J.P.: On mixup regularization. Journal of Machine Learning Research (JMLR) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.545, + 0.787, + 0.587 + ], + "angle": 0, + "content": "5. Charles, Z., Rosenberg, H., Papailiopoulos, D.: A geometric perspective on the transferability of adversarial directions. In: International Conference on Artificial Intelligence and Statistics (AISTATS) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.588, + 0.787, + 0.629 + ], + "angle": 0, + "content": "6. Chen, Y., Xian, Y., Koepke, A., Shan, Y., Akata, Z.: Distilling audio-visual knowledge by compositional contrastive learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.63, + 0.787, + 0.672 + ], + "angle": 0, + "content": "7. Cheng, H., Xiao, E., Cao, J., Yang, L., Xu, K., Gu, J., Xu, R.: Typography leads semantic diversifying: Amplifying adversarial transferability across multimodal large language models. arXiv preprint arXiv:2405.20090 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.672, + 0.787, + 0.713 + ], + "angle": 0, + "content": "8. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.: AutoAugment: Learning augmentation strategies from data. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.714, + 0.787, + 0.757 + ], + "angle": 0, + "content": "9. Deng, Y., Zheng, X., Zhang, T., Chen, C., Lou, G., Kim, M.: An analysis of adversarial attacks and defenses on autonomous driving models. In: IEEE International Conference on Pervasive Computing and Communications (PerCom) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.757, + 0.786, + 0.799 + ], + "angle": 0, + "content": "10. Dong, Y., Liao, F., Pang, T., Su, H., Zhu, J., Hu, X., Li, J.: Boosting adversarial attacks with momentum. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "11. Dong, Y., Pang, T., Su, H., Zhu, J.: Evading defenses to transferable adversarial examples by translation-invariant attacks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.389, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.127 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (ICLR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.205, + 0.786, + 0.233 + ], + "angle": 0, + "content": "13. Fawzi, A., Moosavi-Dezfooli, S.M., Frossard, P.: The robustness of deep networks: A geometrical perspective. In: IEEE Signal Processing Magazine (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.234, + 0.786, + 0.261 + ], + "angle": 0, + "content": "14. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: International Conference on Learning Representations (ICLR) (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.262, + 0.787, + 0.317 + ], + "angle": 0, + "content": "15. Gu, J., Jia, X., de Jorge, P., Yu, W., Liu, X., Ma, A., Xun, Y., Hu, A., Khakzar, A., Li, Z., Cao, X., Torr, P.: A survey on transferability of adversarial examples across deep neural networks. Transactions on Machine Learning Research (TMLR) (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.318, + 0.787, + 0.359 + ], + "angle": 0, + "content": "16. Gubri, M., Cordy, M., Papadakis, M., Traon, Y.L., Sen, K.: Lgv: Boosting adversarial example transferability from large geometric vicinity. In: Proceedings of the European Conference on Computer Vision (ECCV) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.36, + 0.787, + 0.402 + ], + "angle": 0, + "content": "17. Guo, Y., Li, Q., Chen, H.: Backpropagating linearly improves transferability of adversarial examples. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.403, + 0.787, + 0.445 + ], + "angle": 0, + "content": "18. Han, D., Jia, X., Bai, Y., Gu, J., Liu, Y., Cao, X.: OT-Attack: Enhancing adversarial transferability of vision-language models via optimal transport optimization. arXiv preprint arXiv:2312.04403 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.445, + 0.787, + 0.473 + ], + "angle": 0, + "content": "19. He, K., Zhang, X., Ren, S., Sun, J.: Identity mappings in deep residual networks. In: Proceedings of the European Conference on Computer Vision (ECCV) (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.474, + 0.787, + 0.515 + ], + "angle": 0, + "content": "20. He, T., Zhang, Z., Zhang, H., Zhang, Z., Xie, J., Li, M.: Bag of tricks for image classification with convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.516, + 0.787, + 0.544 + ], + "angle": 0, + "content": "21. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.545, + 0.787, + 0.587 + ], + "angle": 0, + "content": "22. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.588, + 0.787, + 0.628 + ], + "angle": 0, + "content": "23. Ilyas, A., Santurkar, S., Tsipras, D., Engstrom, L., Tran, B., Madry, A.: Adversarial examples are not bugs, they are features. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.63, + 0.787, + 0.671 + ], + "angle": 0, + "content": "24. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning (ICML) (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.672, + 0.787, + 0.713 + ], + "angle": 0, + "content": "25. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Advances in Neural Information Processing Systems (NeurIPS) (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.714, + 0.787, + 0.755 + ], + "angle": 0, + "content": "26. Li, Q., Guo, Y., Zuo, W., Chen, H.: Making substitute models more bayesian can enhance transferability of adversarial examples. In: International Conference on Learning Representations (ICLR) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.757, + 0.787, + 0.798 + ], + "angle": 0, + "content": "27. Li, Y., Bai, S., Xie, C., Liao, Z., Shen, X., Yuille, A.: Regional homogeneity: Towards learning transferable universal adversarial perturbations against defenses. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "28. Li, Z., Shi, C., Xie, Y., Liu, J., Yuan, B., Chen, Y.: Practical adversarial attacks against speaker recognition systems. In: Proceedings of the 21st International Workshop on Mobile Computing Systems and Applications (2020)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "29. Lin, J., Song, C., He, K., Wang, L., Hopcroft, J.E.: Nesterov accelerated gradient and scale invariance for adversarial attacks. In: International Conference on Learning Representations (ICLR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.785, + 0.232 + ], + "angle": 0, + "content": "30. Liu, Y., Chen, X., Liu, C., Song, D.: Delving into transferable adversarial examples and black-box attacks. In: International Conference on Learning Representations (ICLR) (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.785, + 0.286 + ], + "angle": 0, + "content": "31. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.785, + 0.328 + ], + "angle": 0, + "content": "32. Luo, H., Gu, J., Liu, F., Torr, P.: An image is worth 1000 lies: Transferability of adversarial images across prompts on vision-language models. In: International Conference on Learning Representations (ICLR) (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.37 + ], + "angle": 0, + "content": "33. Ma, A., Dvornik, N., Zhang, R., Pishdad, L., Derpanis, K.G., Fazly, A.: SAGE: Saliency-guided mixup with optimal rearrangements. In: British Machine Vision Conference (BMVC) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.412 + ], + "angle": 0, + "content": "34. Ma, A., Pan, Y., Farahmand, A.m.: Understanding the robustness difference between stochastic gradient descent and adaptive gradient methods. Transactions on Machine Learning Research (TMLR) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.785, + 0.453 + ], + "angle": 0, + "content": "35. Ma, W., Li, Y., Jia, X., Xu, W.: Transferable adversarial attack for both vision transformers and convolutional networks via momentum integrated gradients. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.785, + 0.494 + ], + "angle": 0, + "content": "36. Ma, Y., Chen, Y., Akata, Z.: Distilling knowledge from self-supervised teacher by embedding graph alignment. In: British Machine Vision Conference (BMVC) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.785, + 0.536 + ], + "angle": 0, + "content": "37. Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: International Conference on Learning Representations (ICLR) (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.785, + 0.577 + ], + "angle": 0, + "content": "38. Mahmood, K., Mahmood, R., Van Dijk, M.: On the robustness of vision transformers to adversarial examples. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.577, + 0.785, + 0.606 + ], + "angle": 0, + "content": "39. Müller, R., Kornblith, S., Hinton, G.E.: When does label smoothing help? In: Advances in Neural Information Processing Systems (NeurIPS) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.785, + 0.647 + ], + "angle": 0, + "content": "40. Naseer, M., Ranasinghe, K., Khan, S., Khan, F.S., Porikli, F.: On improving adversarial transferability of vision transformers. In: International Conference on Learning Representations (ICLR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.785, + 0.688 + ], + "angle": 0, + "content": "41. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.785, + 0.716 + ], + "angle": 0, + "content": "42. Qayyum, A., Qadir, J., Bilal, M., Al-Fuqaha, A.: Secure and robust machine learning for healthcare: A survey. In: IEEE Reviews in Biomedical Engineering (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.785, + 0.758 + ], + "angle": 0, + "content": "43. Qian, Y., He, S., Zhao, C., Sha, J., Wang, W., Wang, B.: Lea2: A lightweight ensemble adversarial attack via non-overlapping vulnerable frequency regions. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.758, + 0.785, + 0.799 + ], + "angle": 0, + "content": "44. Qin, Z., Fan, Y., Liu, Y., Shen, L., Zhang, Y., Wang, J., Wu, B.: Boosting the transferability of adversarial attacks with reverse adversarial perturbation. In: Advances in Neural Information Processing Systems (NeurIPS) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.841 + ], + "angle": 0, + "content": "45. Raghu, M., Unterthiner, T., Kornblith, S., Zhang, C., Dosovitskiy, A.: Do vision transformers see like convolutional neural networks? In: Advances in Neural Information Processing Systems (NeurIPS) (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.355, + 0.127 + ], + "angle": 0, + "content": "A. Ma et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "46. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.218 + ], + "angle": 0, + "content": "47. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (ICLR) (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.219, + 0.785, + 0.261 + ], + "angle": 0, + "content": "48. Steiner, A., Kolesnikov, A., Zhai, X., Wightman, R., Uszkoreit, J., Beyer, L.: How to train your vit? data, augmentation, and regularization in vision transformers. Transactions on Machine Learning Research (TMLR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.262, + 0.785, + 0.303 + ], + "angle": 0, + "content": "49. Szegedy, C., Vanhoucke, V., Ioffe, S., Shlens, J., Wojna, Z.: Rethinking the inception architecture for computer vision. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.304, + 0.785, + 0.346 + ], + "angle": 0, + "content": "50. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. In: International Conference on Learning Representations (ICLR) (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.346, + 0.785, + 0.389 + ], + "angle": 0, + "content": "51. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold Mixup: Better representations by interpolating hidden states. In: International Conference on Learning Representations (ICLR) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.39, + 0.785, + 0.431 + ], + "angle": 0, + "content": "52. Wang, H., Wu, X., Huang, Z., Xing, E.P.: High-frequency component helps explain the generalization of convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.432, + 0.785, + 0.473 + ], + "angle": 0, + "content": "53. Wang, X., He, K.: Enhancing the transferability of adversarial attacks through variance tuning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.474, + 0.785, + 0.529 + ], + "angle": 0, + "content": "54. Waseda, F., Nishikawa, S., Le, T.N., Nguyen, H.H., Echizen, I.: Closer look at the transferability of adversarial examples: How they fool different models differently. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.53, + 0.785, + 0.572 + ], + "angle": 0, + "content": "55. Wei, Z., Chen, J., Goldblum, M., Wu, Z., Goldstein, T., Jiang, Y.G.: Towards transferable adversarial attacks on vision transformers. In: AAAI Conference on Artificial Intelligence (AAAI) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.573, + 0.785, + 0.614 + ], + "angle": 0, + "content": "56. Wu, D., Wang, Y., Xia, S.T., Bailey, J., Ma, X.: Skip connections matter: On the transferability of adversarial examples generated with resnets. In: International Conference on Learning Representations (ICLR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.615, + 0.785, + 0.655 + ], + "angle": 0, + "content": "57. Wu, L., Zhu, Z.: Towards understanding and improving the transferability of adversarial examples in deep neural networks. In: Asian Conference on Machine Learning (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.657, + 0.785, + 0.699 + ], + "angle": 0, + "content": "58. Wu, W., Su, Y., Lyu, M.R., King, I.: Improving the transferability of adversarial samples with adversarial transformations. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.7, + 0.785, + 0.755 + ], + "angle": 0, + "content": "59. Xiao, Z., Gao, X., Fu, C., Dong, Y., Gao, W., Zhang, X., Zhou, J., Zhu, J.: Improving transferability of adversarial patches on face recognition with generative models. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.785, + 0.798 + ], + "angle": 0, + "content": "60. Xiaosen, W., Tong, K., He, K.: Rethinking the backward propagation for adversarial transferability. In: Advances in Neural Information Processing Systems (NeurIPS) (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "61. Xie, C., Zhang, Z., Zhou, Y., Bai, S., Wang, J., Ren, Z., Yuille, A.L.: Improving transferability of adversarial examples with input diversity. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Adversarial Transferability via Model Alignment" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.203 + ], + "angle": 0, + "content": "62. Xiong, Y., Lin, J., Zhang, M., Hopcroft, J.E., He, K.: Stochastic variance reduced ensemble adversarial attack for boosting the adversarial transferability. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.204, + 0.787, + 0.245 + ], + "angle": 0, + "content": "63. Yin, D., Gontijo Lopes, R., Shlens, J., Cubuk, E.D., Gilmer, J.: A Fourier perspective on model robustness in computer vision. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.246, + 0.786, + 0.273 + ], + "angle": 0, + "content": "64. Yu, W., Gu, J., Li, Z., Torr, P.: Reliable evaluation of adversarial transferability. arXiv preprint arXiv:2306.08565 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.273, + 0.787, + 0.314 + ], + "angle": 0, + "content": "65. Yun, S., Han, D., Oh, S.J., Chun, S., Choe, J., Yoo, Y.: CutMix: Regularization strategy to train strong classifiers with localizable features. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.315, + 0.787, + 0.357 + ], + "angle": 0, + "content": "66. Zhang, C., Benz, P., Karjauv, A., Cho, J.W., Zhang, K., Kweon, I.S.: Investigating top-k white-box and transferable black-box attack. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.357, + 0.787, + 0.396 + ], + "angle": 0, + "content": "67. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: Mixup: Beyond empirical risk minimization. In: International Conference on Learning Representations (ICLR) (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.398, + 0.787, + 0.438 + ], + "angle": 0, + "content": "68. Zhang, L., Deng, Z., Kawaguchi, K., Ghorbani, A., Zou, J.: How does mixup help with robustness and generalization? In: International Conference on Learning Representations (ICLR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.439, + 0.787, + 0.493 + ], + "angle": 0, + "content": "69. Zhang, Y., Hu, S., Zhang, L.Y., Shi, J., Li, M., Liu, X., Wan, W., Jin, H.: Why does little robustness help? a further step towards understanding adversarial transferability. In: Proceedings of the IEEE Symposium on Security and Privacy (SP) (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.494, + 0.787, + 0.535 + ], + "angle": 0, + "content": "70. Zhao, P., Chen, P.Y., Das, P., Ramamurthy, K.N., Lin, X.: Bridging mode connectivity in loss landscapes and adversarial robustness. In: International Conference on Learning Representations (ICLR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.536, + 0.787, + 0.577 + ], + "angle": 0, + "content": "71. Zhao, Z., Liu, Z., Larson, M.: On success and simplicity: A second look at transferable targeted attacks. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.577, + 0.787, + 0.619 + ], + "angle": 0, + "content": "72. Zhou, D., Yu, Z., Xie, E., Xiao, C., Anandkumar, A., Feng, J., Alvarez, J.M.: Understanding the robustness in vision transformers. In: International Conference on Machine Learning (ICML) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.62, + 0.787, + 0.66 + ], + "angle": 0, + "content": "73. Zhu, Y., Sun, J., Li, Z.: Rethinking adversarial transferability from a data distribution perspective. In: International Conference on Learning Representations (ICLR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.66, + 0.787, + 0.716 + ], + "angle": 0, + "content": "74. Zou, J., Pan, Z., Qiu, J., Liu, X., Rui, T., Li, W.: Improving the transferability of adversarial examples with resized-diverse-inputs, diversity-ensemble and region fitting. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.716 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_origin.pdf b/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..493b38ed2a1364de3aad657300b3db4a2cbeeec0 --- /dev/null +++ b/2024/Improving Adversarial Transferability via Model Alignment/0c1bf4f3-0fa0-4bda-a0ba-082cf4033f6f_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c87c3e9fe20ab846c08587c3a5ddcf8880075c3f627f81667b550957ef6e1f5b +size 925697 diff --git a/2024/Improving Adversarial Transferability via Model Alignment/full.md b/2024/Improving Adversarial Transferability via Model Alignment/full.md new file mode 100644 index 0000000000000000000000000000000000000000..277ea1c516c962f9cdbcde53cccec566527efb0e --- /dev/null +++ b/2024/Improving Adversarial Transferability via Model Alignment/full.md @@ -0,0 +1,294 @@ +# Improving Adversarial Transferability via Model Alignment + +Avery Ma $^{1,2}$ , Amir-massoud Farahmand $^{1,2}$ , Yangchen Pan $^{3}$ , Philip Torr $^{3}$ , and Jindong Gu $^{3}$ + +1 University of Toronto, Toronto, Canada +ama@cs.toronto.edu +$^{2}$ Vector Institute, Toronto, Canada +3 University of Oxford, Oxford, UK + +Abstract. Neural networks are susceptible to adversarial perturbations that are transferable across different models. In this paper, we introduce a novel model alignment technique aimed at improving a given source model's ability in generating transferable adversarial perturbations. During the alignment process, the parameters of the source model are finetuned to minimize an alignment loss. This loss measures the divergence in the predictions between the source model and another, independently trained model, referred to as the witness model. To understand the effect of model alignment, we conduct a geometric analysis of the resulting changes in the loss landscape. Extensive experiments on the ImageNet dataset, using a variety of model architectures, demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. Our source code is available at https://github.com/averyma/model-alignment. + +# 1 Introduction + +Adversarial examples with small perturbations can mislead deep neural networks to make wrong predictions [50]. It has been observed that perturbations created to attack one model can also fool other models, which is known as adversarial transferability [14]. The transferability of such perturbations has received significant attention recently since it poses practical concerns for the deployment of machine learning systems in real-world applications [9,28,42]. + +One possible explanation for this transferability is that transferable perturbations exploit similar features present in both the source and target models [23]. To see this, let us first consider the hypothesis that neural networks capture two distinct types of features from data: semantic features and human-imperceptible features. This hypothesis has been proposed and supported in [34, 52, 63]. We provide a summary of their findings as follows. First, models learn semantic features that align with human perception. The extraction of such features is similar across different models, reflecting a shared understanding of the semantics. Second, models learn human-imperceptible features, and their learning is model-specific. For example, Ma et al. [34] showed that the use of these features + +![](images/8802665858e6c43360cf817fa47d38ebe8f04e60c2147234b6062604f40b8263.jpg) +Fig. 1: Attacking the aligned source model for more transferable perturbations. We compare the transferability of $\ell_{\infty}$ -norm bounded perturbations ( $\epsilon = 4/255$ ) generated using the source model before and after performing model alignment. The result highlights the compatibility of model alignment with a wide range of attacks, as perturbations generated from the aligned source model become more transferable. Here, the source model is aligned using a witness model from the same architecture but is initialized and trained independently. Results are averaged over all target models. + +varies with models' optimization processes, while Wang et al. [52] showed that model architecture leads to specific feature interpretations. + +Features and vulnerabilities are highly correlated, as vulnerabilities often stem from the exploitation of certain features [23]. In the context of transferability, the degree of similarity between those exploited features in the source and target model is crucial. That is, the more similar the exploited features between models, the more likely it is that the perturbation will successfully transfer. To support this, Liu et al. [30] showed that different models have similar decision boundaries (from learning similar features), thus enabling some perturbation to be transferable across different models. However, some perturbations exploit features that are specific to the source model. Qin et al. [44] demonstrated that when maximizing the cross entropy loss to find adversarial examples, some perturbations fail to transfer since they are located at sharp local maxima unique to the source model, which do not exist for the target model. + +Motivated by these observations, we propose a model alignment technique to modify the source model to encourage a similar feature extraction as other, independently trained models, which we refer to as witness models. + +# Our goal is to transform any source model into one from which attacks generate more transferable perturbations. + +During the alignment process, the source model's parameters are fine-tuned to minimize an alignment loss, which measures the prediction divergence between the source and witness models. Through this alignment process, the source model learns to focus on a set of features that are similarly extracted by the witness model. This allows attack algorithms to more effectively exploit features common across models, leading to more transferable perturbations. + +Because of the orthogonal nature of our approach, model alignment complements, rather than competes with, other attack algorithms. This synergy under- + +scores our method's key advantage: its broad compatibility with a wide range of attack algorithms, as highlighted in Fig. 1. Extensive experiments on various combinations of architectures, transferability on individual target models, and results with other attacks are included in Sec. 4. + +We analyze the effect of the proposed alignment method, demonstrating that perturbations generated from the source model exploit more semantic features that are shared across different models. Additionally, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process. The analysis explores the relationship between model alignment and the use of soft labels [20,49,67]. Results show that there is a notable smoothing effect on the loss surface of the model, which is consistent with prior findings that adversarial examples from flatter maxima are more transferable [16,44]. Our contributions can be summarized as follows: + +- We present a model alignment method to fine-tune the source model by minimizing an alignment loss which measures the difference in the output between the source model and the witness model. +- To understand the effect of model alignment, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process. +- Extensive experiments on ImageNet [25], using convolutional neural networks (CNNs) and Vision Transformers (ViTs) [12,31], demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. We demonstrate that our alignment technique is compatible with a wide range of attacks. + +# 2 Related Work + +In this section, we provide a brief overview of approaches to generate more transferable perturbations. For a more comprehensive review of research related to adversarial transferability, we direct the reader to a recent survey [15]. + +# 2.1 Generating Transferable Perturbations + +Existing work on improving the transferability of adversarial examples can be categorized into four groups: data-augmentation-based methods [3,7,11,27,58,61, 74], optimization-based methods [10,18,29,32,53,59,66,71], model-modificationbased methods [2,17,56,60], and ensemble-based methods [16,26,30,43]. + +Data-augmentation-based methods: Data augmentation prevents overfitting in deep neural networks, with advanced techniques [8, 33, 65, 67] being key for state-of-the-art generalization on large datasets. Building on this, several works have incorporated data augmentation into attacks to prevent adversarial examples from overfitting to the source model, thereby improving transferability. + +Optimization-based methods: Lin et al. [29] drew a parallel between generating transferable adversarial examples and training neural networks. In this analogy, source models are the training data, adversarial perturbations are model + +parameters, and the target model is the testing data. Thus, transferability of adversarial examples is akin to model generalization. Optimization-based methods, such as momentum [10, 29, 74] and variance tuning [53, 62], initially designed to improve model generalization, can similarly improve adversarial transferability. + +Model-modification-based methods: Several studies have proposed methods to improve transferability by modifying the source model. Benz et al. [2] showed that perturbations from models without batch normalization [24] are more transferable. Methods like Linear Backpropagation (LinBP) [17] and Backward Propagation Attack (BPA) [60] focus on non-linear activations and modify the derivative of ReLU. Wu et al. [56] showed that increasing gradients from skip connections can improve transferability. A key advantage of our approach is its model-agnostic nature: alignment can be applied without changing the model's forward or backward pass, improving any source model's ability to generate more transferable perturbations. In contrast, other methods require changes, such as those seen in LinBP and BPA, or even complete retraining. + +Ensemble-based methods: Another line of approaches involves the use of multiple models for generating adversarial examples. Liu et al. [30] were among the first to propose enhancing transferability by attacking an ensemble of models, with the rationale being that a perturbation capable of fooling multiple models is more likely to deceive the target model. More recently, Gubri et al. [16] proposed constructing an ensemble of source models by collecting weights along the finetuning trajectory of a trained model. + +# 2.2 Understanding Adversarial Transferability + +Several works have focused on understanding the transferability of adversarial perturbations [54, 57, 69, 73], with some analyzing from a geometric perspective [5, 13, 30, 70]. Liu et al. [30] showed that weakly transferable adversarial examples often fall into local maxima of the source model. They found that some perturbations fail to transfer because they reside in tiny pockets corresponding to the ground truth label, present in the source model but not in the target model. Similarly, Gubri et al. [16] hypothesized that adversarial examples at flat loss maxima transfer more effectively than those at sharp maxima. Motivated by these insights, in Sec. 3.3, we extend this geometric perspective to examine how the alignment method influences the source model's loss surface geometry to generate more transferable adversarial examples. + +# 3 Method + +We present the model alignment process and understand why aligned models can generate more transferable perturbations. + +# 3.1 Preliminary + +In this work, we focus on neural networks used for classification tasks. Let us consider a neural network designed for $m$ -class classification, represented as a + +series of function compositions: + +$$ +f (x) = (\phi^ {[ l ]} \circ \phi^ {[ l - 1 ]} \circ \dots \circ \phi^ {[ 1 ]}) (x), +$$ + +where each $\phi^{[i]}$ represents an operation within the network, which could be a linear transformation (such as a fully connected layer), an activation function, or a pooling operation. The parameters of the neural network are collectively denoted as $\theta$ . The intermediate outputs of these operations are often referred to as hidden representations. We denote them by $z^{[i]}$ , where $z^{[i]} = \phi^{[i]}(z^{[i-1]})$ for $i = 1, 2, \ldots, l$ , and the initial input is $z^{[0]} = x$ . Additionally, we incorporate the softmax function into the neural network's definition. Specifically, in the final layer, we have $\phi^{[l]} = \operatorname{softmax}(z^{[l-1]})$ , where $z^{[l-1]}$ are called the logits. With this definition, the output of this network, $f(x)$ , can be interpreted as a probability distribution over the $m$ classes where each component $f(x)_i$ represents the probability of the input $x$ belonging to class $i$ . + +# 3.2 Model Alignment + +The goal of model alignment is to modify the source model such that it can extract features similar to those of other models (the witness model). We denote the parameters of the source model and the witness model as $\theta_s$ and $\theta_w$ , respectively. Let us consider the following point-wise formulation of the alignment loss: + +$$ +\ell_ {a} (x, \theta_ {s}, \theta_ {w}) = d \left(z _ {s} ^ {[ q ]} (x), z _ {w} ^ {[ q ]} (x)\right), \tag {1} +$$ + +where the metric $d$ measures the output difference at layer $q$ between the models. + +Model alignment is a fine-tuning process. During alignment, the parameters of the source model are updated to minimize this alignment loss which captures the differences between models' output. Specifically, when $q = l$ , the alignment loss measures the divergence between the probability distributions generated by the two models. In this scenario, the Kullback-Leibler (KL) divergence is particularly suitable, due to its effectiveness in measuring distribution differences and its relative ease of implementation in practice. Our analysis and primary experimental results are based on model alignment in the output space, using KL divergence as $d$ . We also explore total variation and alignment in the embedding space (i.e., $q < l$ ), which is detailed in our ablation study. + +The point-wise loss defined in (1) focuses on aligning the source model with a single witness model. However, alignment can also be extended to multiple witness models to further improve the alignment process. This process involves using a set of witness models, denoted as $\Theta$ , with the number of witness models represented by $|\Theta|$ . Finally, the update rule for the parameters of the source model based on SGD can be written as + +$$ +\theta_ {s} (t + 1) = \theta_ {s} (t) - \eta \frac {1}{| \mathcal {B} | | \Theta |} \sum_ {x \in \mathcal {B}} \sum_ {\theta_ {w} \in \Theta} \nabla \ell_ {a} (x, \theta_ {s} (t), \theta_ {w}), +$$ + +where $\mathcal{B}$ represents the mini-batch. + +![](images/d20c998a3ab1624cc0dd7ccef37e7c3e4306eb1683775845585547c20677b969.jpg) +a. ResNet50. + +![](images/c3948fe79675ba4de4b0a1701c36691cfae9f05ef691063e1834620f95e835bc.jpg) +b. ViT-B/16. +Fig.2: A frequency-domain visualization of the differences in the perturbation generated using the original source model and the aligned source model. We compare the magnitude of the DCT coefficients between the perturbations generated by the two models: $|\mathrm{DCT}(\Delta x_a)| - |\mathrm{DCT}(\Delta x_s)|$ . The pronounced brightness in the top-left region of the spectrum indicates that the primary differences lie within the low-frequency range, which is typically associated with semantic features. + +# 3.3 Understanding Model Alignment + +We now understand the model alignment approach from two perspectives: semantic feature exploitation and geometric analysis of the loss surface. The analysis in this section uses ResNet50 and ViT-B/16 as source models, which are aligned with ResNet18 and ViT-T/16 as their respective witness models. We consider $\ell_{\infty}$ -norm adversarial examples generated using 20 iterations of PGD [37] with $\epsilon = 4 / 255$ and $\alpha = 1 / 255$ . We use $\Delta x_{s}$ and $\Delta x_{a}$ to represent the perturbations generated based on the source and aligned models, respectively. + +Aligned Model Exploits More Semantic Features. To verify that attacks applied to the aligned model exploit more semantic features, we compare the perturbations generated using the original and aligned source models. Adversarial perturbations are imperceptible and difficult to characterize in terms of the specific features they exploit in the spatial domain. However, by analyzing perturbations in the frequency domain, we can observe the types of features each model exploits. Previous work has shown that semantic features mostly concentrate around the low-frequency end of the spectrum [34,52,63]. We consider discrete cosine transform (DCT) [1] and compare the DCT coefficients of the perturbations generated from the source and the aligned model, denoted as $\mathrm{DCT}(\Delta x_s)$ and $\mathrm{DCT}(\Delta x_a)$ , respectively. The results are averaged over 1000 randomly sampled images from the ImageNet test set. Since our interest lies in the magnitude of these coefficients, we visualize the difference by computing $|\mathrm{DCT}(\Delta x_a)| - |\mathrm{DCT}(\Delta x_s)|$ . + +The results are illustrated in Fig. 2. We observe that the differences between the perturbations are predominantly located in the top-left corner of the DCT spectrum, indicating that they primarily differ in the amount of low-frequency information. This result shows that adversarial perturbations generated from the aligned exploit more low-frequency, semantic features. + +![](images/ad12d108f9562a67bfb5363b781a9afd2f6485665ca3c95dec20dc763f3c391c.jpg) +Fig. 3: Visualization of the loss surface around adversarial perturbations for original and aligned ResNet50 and ViT-b/16. Each plot illustrates the loss surface projected on the plane defined by the adversarial perturbation direction and its orthogonal vector. We examine the loss landscape around a clean data point (cyan) and an $\ell_{\infty}$ -bounded adversially perturbed data point (red), generated from the source $(\Delta x_{s})$ and aligned models $(\Delta x_{a})$ . Perturbations from the original source models are at sharper loss maxima, while those from the aligned model are on flatter surfaces. + +Model Alignment Yields Smoother Loss Surface. Previous works have studied the connection between perturbation from sharp loss maxima and their poor transferability [16, 44]. We extend this geometric perspective by examining how model alignment affects the loss surface geometry of the source model, particularly in its capacity to generate more transferable adversarial examples. + +First, consider when (1) measures the KL divergence between the two models' predictions. During alignment, the source model's parameters are fine-tuned using soft labels from the witness model's outputs. Training deep neural networks with soft labels prevents the model from becoming overly confident in its predictions, thereby improving generalization [20, 21, 39, 49]. Compared to using hard, one-hot encoded labels, it has been shown that training with soft labels implicitly regularizes the norm of the input Jacobian [4, 68], and leads to smoother decision boundaries [51, 67]. + +To understand why model alignment can be helpful, we begin by identifying a data point for which the perturbation, when generated based on the original source model, fails to transfer to the target model, but the perturbation generated using the aligned model misleads the target model. In Fig. 3, we visualize the loss surface surrounding this data point, spanned by two pairs of orthogonal vectors: $\Delta x_{s}$ , $\Delta x_{s}^{\perp}$ , $\Delta x_{a}$ and $\Delta x_{a}^{\perp}$ . Here, $\Delta x_{s}^{\perp}$ and $\Delta x_{a}^{\perp}$ are randomly selected orthogonal vectors and are also bounded by the same $\epsilon$ . In each plot, the center of the plot (cyan) represents the clean data point, and the adversarial example is highlighted using the red marker. + +We make two observations. First, the bright yellow region around the perturbations generated from the original source model suggests that they are located at sharp loss maxima. However, these same perturbations do not effectively cause a significant increase in loss when applied to the target model. This observation aligns with previous findings indicating that perturbations with poor transferability often correspond to sharp local maxima unique to the source model, which + +Table 1: Comparing the $\ell_2$ -norm of the input gradient on the original source model and the aligned source model. Results are averaged over 1000 randomly selected ImageNet test samples. The norm decreases significantly when evaluated on all three types of input, suggesting that the smoothing effect induced by the alignment is more global, rather than being confined to specific cases of adversarial examples. + +
DataResNet50VIT-B/16
OriginalAlignedOriginalAligned
Clean0.0560.0320.0600.029
Gaussian-perturbed0.0570.0320.0630.029
PGD-perturbed0.4530.1710.1840.055
+ +are not present in the target model [16, 44]. Second, the loss surface around perturbations generated from the aligned model is noticeably flatter. This is in line with prior findings that adversarial perturbations from flatter maxima tend to be transferable [16, 44]. It is noteworthy that the PGD attack does not explicitly target flat maxima for generating adversarial examples. This observation leads us to hypothesize that the smoothing effect induced by the alignment process is more global, rather than being confined to specific cases of adversarial examples. + +To verify this, we evaluate the change in the $\ell_2$ -norm of the loss gradients with respect to clean, Gaussian-perturbed $(\sigma^2 = 0.01)$ , and PGD-perturbed inputs. More formally, we compare $\| \nabla_x\ell (x + \varDelta x,y,\theta)\| _2$ for $\varDelta x\in\{0,\mathrm{Gaussian},\mathrm{PGD}\}$ for $\theta \in \{\theta_s,\theta_a\}$ over 1000 randomly sampled ImageNet test samples. + +The results are summarized in Tab. 1. We observe a significant decrease in gradient norm across all inputs, and the reduction is particularly pronounced at PGD-perturbed data points. This decrease is consistent with the previous finding which demonstrated a connection between the use of soft labels and the smoothing of the loss surface [4,68]. More importantly, this observation explains the improved transferability with the aligned model. In the supplementary material, we discuss additional results on the change in the largest eigenvalue of input Hessian, which is another popular metric in studying the smoothness of the loss landscape [70]. To evaluate the similarity of models, we measure the change in the KL divergence, prediction agreement, and the cosine similarity of input gradients. The latter is crucial due to its role in the attack process. These results are included in the supplementary material. + +# 4 Experiments + +In this section, we present a series of experiment results to demonstrate the improved ability of a given source model to generate transferable adversarial perturbations. We study factors that can further improve the alignment process and demonstrate the compatibility of our approach with a wide range of attacks. + +# 4.1 Experiment Setup + +Model: We consider various neural network architectures as source, witness, and target models. For CNNs, we include ResNet18 (Res18), ResNet50 (Res50), ResNet101 (Res101) [19], VGG19 [47], DenseNet121 (DN121) [22], and Inception-v3 (IncV3) [49]. For ViTs, our selection includes Swin Transformers (SWIN) [31], ViT-T/16, ViT-S/16, and ViT-B/16 [12]. We follow the optimization schedule described in the official Pytorch repository to train all models. Training and model details are included in the supplementary material. + +Fine-tune: During alignment, all source models are fine-tuned for one epoch using SGD with a momentum of 0.9, a cosine learning rate decay, and a linear warmup. We sweep over 3 learning rates. No additional data is used, as fine-tuning relies on the same training data used to train the source and witness model. We use a batch size of 128 for CNNs and 512 for ViTs. For ViT-based models, we follow [48] and gradients are clipped at a global norm of 1. + +Dataset: We follow previous work [10,29,64] in which evaluations are based on 1000 randomly selected from the ImageNet test set. For a given source and target model, these samples meet the following criteria: they are correctly classified by both models, and the adversarial examples, when generated from each model, lead to misclassifications in their respective originating models. + +Attack method: We focus on non-targeted adversarial perturbations bounded by the $\ell_{\infty}$ -norm. Unless otherwise stated, all perturbations are generated using 20 iterations of PGD with $\epsilon = 4/255$ and $\alpha = 1/255$ . All target models have an error rate of $100\%$ under white-box PGD attacks. Results with different attack methods and larger values of $\epsilon$ are included in the ablation study. + +Metric: We measure transferability using the error rate, with a higher rate indicating greater transferability. In the tables of this section, we first present a row labeled 'n/a' to denote the error rate for perturbations generated by the original source model. We then demonstrate the change in transferability after alignment following the $+ / -$ sign. A larger change indicates a greater increase in transferability resulting from using the aligned model. All results presented in this section are obtained from the average of three independent runs. + +# 4.2 Model Alignment Improves Transferability + +To demonstrate the improved transferability of perturbations generated using the aligned source model, we evaluate across a diverse set of neural network architectures for both source and witness models, focusing on the transferability to an extensive array of target models. Tab. 2 shows the original error rates and their changes after using the aligned model. We make two key observations. + +First, the model alignment approach can transform any given source model into one from which the PGD attack generates more transferable perturbations. Such an improvement can be observed across various combinations of source and witness models and is evident in all evaluated target models. This clear improvement validates our approach, showing that aligning the source model can lead to the generation of more transferable adversarial perturbations. Notably, + +Table 2: Aligning the source model can lead to the generation of more transferable adversarial examples. The result demonstrates the increase in error rates when adversarial examples generated from aligned source models are applied to different target models. Our method improves the transferability of adversarial examples generated from a wide range of architectures, including both CNNs and ViTs. + +
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res50+9.60+9.90+8.12+6.59+8.98+4.79+0.67+0.65+0.42+2.65
VGG19+8.30+7.88+7.41+9.17+9.93+6.76+0.75+0.52+0.17+1.97
DN121+9.39+10.82+8.40+8.41+12.41+7.21+1.87+2.02+0.38+2.61
IncV3+7.69+7.52+5.99+5.56+9.19+8.23+2.29+0.30+0.24+3.01
ViT-B/16-9.41-19.39-17.48-10.04-12.76-8.49-3.25-2.69-1.14-4.17
SWIN-9.23-16.21-14.30-7.27-10.02-5.53-2.72-2.93-2.36-2.73
VGG19n/a33.4930.1026.1379.4332.0730.6223.2719.8518.6623.09
Res50+7.19+4.16+2.76+5.19+7.62+5.91+3.45+1.20+1.36+1.12
VGG19+4.66+2.10+1.77+7.30+3.44+1.74+2.64+0.68+1.39+0.90
DN121+6.35+3.52+5.07+10.60+10.45+5.03+4.09+2.36+2.58+1.31
IncV3+4.91+1.57+1.66+3.82+4.94+4.33+2.70+0.61+0.61+1.04
ViT-B/16-4.34-5.68-5.01-24.66-5.11-3.67-0.83-0.37+0.77-2.53
SWIN-3.24-5.83-4.01-21.91-6.48-4.05-1.11-0.73+0.64-2.96
DN121n/a40.2044.0137.1540.8461.1532.2823.6820.3418.2123.56
Res50+11.67+12.96+8.37+7.32+11.68+5.41+1.69+0.46+1.00+1.59
VGG19+9.02+6.38+4.88+12.34+7.87+3.77+2.72+0.04+1.22+0.94
DN121+12.56+11.60+10.48+9.10+15.47+6.84+3.99+1.59+1.24+1.86
IncV3+8.08+10.50+9.88+9.91+12.76+7.24+3.81+1.23-0.02+2.79
ViT-B/16-3.08-8.43-7.78-6.67-12.96-1.78+2.06+1.26+1.22-2.78
SWIN-4.13-8.57-5.34-6.11-10.21-4.64+0.54-0.16+1.21-1.88
IncV3n/a30.6827.4925.0233.4730.9851.8022.9918.7717.7220.94
Res50+4.92+6.59+4.27+5.49+5.74+4.49+1.71+2.26+2.74+2.23
VGG19+4.65+2.69+3.10+5.70+3.39+4.36+1.05-0.54+0.38+0.53
DN121+4.50+6.38+2.13+7.35+6.52+8.89+3.54+0.68+1.41+1.45
IncV3+1.78+3.91+3.70+3.53+3.06+8.75+1.79+0.49+1.41+1.75
ViT-B/16+0.47-1.13-2.97-0.77-1.35-8.20+2.92+1.64+2.07-0.23
SWIN-0.49-3.36-3.85-3.29-4.54-12.82+0.09+0.76+1.13-1.34
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
Res50+17.53+12.89+12.23+14.83+16.66+15.76+43.47+37.17+29.16+21.16
VGG19+10.89+9.49+9.77+14.23+12.65+10.94+39.63+31.65+21.30+14.97
DN121+17.15+13.92+12.28+15.38+17.68+16.96+47.36+41.88+31.22+21.87
IncV3+15.41+11.87+11.31+15.09+14.23+16.46+46.07+40.39+28.87+19.92
ViT-B/16+5.14+2.04+2.07+4.79+2.87+4.53+24.04+23.14+21.93+6.34
SWIN+6.31+5.75+5.92+8.12+7.46+7.28+39.11+36.49+28.61+14.62
+ +both CNN and ViT-based source models can benefit from the alignment process. Recent studies have shown that the transferability between ViTs and CNNs is poor, and many attack algorithms do not generalize well to ViTs [38,40,55]. Our model alignment method offers a promising solution to bridge this gap. + +Second, we find that CNN-based source models generally benefit from aligning with other CNN-based models, rather than with ViT-based models. On the other hand, the ViT-B/16 source model can benefit from aligning with witness models from both CNN and ViT families. We provide a possible explanation for this phenomenon. Previous studies have shown that ViTs and CNNs learn distinctively different features [45, 72]. Specifically, Raghu et al. [45] focused on early-layer representations learned by the two models and showed that more ResNet layers are required to be modified to match hidden representations of a ViT, compared to the other way around. In the context of model alignment, this suggests an asymmetric behavior in the alignment process; namely, it might be easier to align ViTs with CNNs than to align CNNs with ViTs. + +Choosing the witness model: The main goal of Tab. 2 is to demonstrate that the improved transferability is not limited to particular choices of witness models. The result also highlights the effectiveness of a straightforward, hyper-parameter-free self-alignment strategy. This is evident from the consistent improvement observed when the source and witness models share the same architecture, but are initialized and trained independently. The selection of witness models is further explored in our ablation studies. + +Regularization to prevent overfitting: A prolonged alignment process may inadvertently cause overfitting to the witness model, thereby diminishing the gains in transferability. To counteract overfitting, regularization methods can be implemented. For example, we apply early stopping and limit the alignment to a single epoch. Moreover, an ensemble of witnesses can be used to avert overfitting to any singular witness model. Results with multiple witness models are included in the supplementary material. Furthermore, when aligning by minimizing KL divergence, adjusting the temperature scaling within the softmax function can be an effective measure to prevent the exact replication of the witness model's predictions by the source model. + +# 4.3 Ablation Studies + +We conduct several ablation studies to investigate factors that could further improve the alignment process. Additionally, we demonstrate that our approach is compatible with a wide range of attack algorithms. + +Smaller Witness Model Might Boost Learning Shared Features. Results in Tab. 2 indicate that DN121, which has the fewest parameters, frequently emerges as a more effective witness model. This motivates us to investigate the role of the capacity of the witness model during the alignment. While several factors contribute to a model's capacity, such as its structure, the normalization techniques, and its non-linear activations, our study primarily focuses on the number of parameters as a proxy for capacity. With this in mind, we consider three models each from the ResNet and ViT families. + +Tab. 3 summarizes the results of the model capacity analysis, pointing to one key observation. Model alignment is more effective when the witness models have a smaller model capacity. For instance, when using Res101 as the source model, alignment with the lower capacity Res18 as the witness model is more beneficial than alignment with Res50. This matches the previous findings in Tab. 2. + +We provide one interpretation of this observation. Smaller models might tend to focus more on learning semantic features for generalization, as they lack the capacity of larger models to learn imperceptible features. Therefore, when a source model is aligned with a smaller model, it is steered towards learning more semantic features that are commonly shared across different models, thereby leading to more transferable perturbations. + +Table 3: Analyzing the impact of witness model capacity on the alignment process. We observe a greater improvement in the transferability of adversarial perturbations when the source model is aligned with witness models of smaller capacity. + +
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res18n/a64.1045.8537.0942.9648.5737.3127.5221.1220.5721.31
Res50-1.94+0.41-0.74+0.82-1.24-1.78+0.26+1.33+0.42+1.48
Res101-5.13-3.92-2.70-1.75-1.39-0.22+0.53+0.25+0.03+0.48
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res18+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
Res101+4.27+3.02+3.93+3.61+4.41+3.60+1.86-0.54+0.14+1.36
Res101n/a38.8454.6362.9539.2449.9334.7723.0120.1219.0722.90
Res18+40.64+35.11+27.78+29.63+33.20+28.42+10.10+5.70+2.37+13.99
Res50+14.97+19.56+16.97+13.50+17.07+10.41+4.04+0.98+1.44+4.81
ViT-T/16n/a28.7723.4521.0525.4125.4525.2263.8940.4729.6222.97
ViT-S/16+0.30+0.70+1.02+2.76+0.54+0.69+7.01+3.77+2.92+0.42
ViT-B/16+0.86-0.18-1.11+1.15+0.47+0.81+5.09+4.32+3.55-1.57
ViT-S/16n/a24.2720.4818.8621.8521.9022.9647.3452.0943.8523.87
ViT-T/16+9.64+6.65+6.29+8.51+10.66+7.58+40.53+32.27+26.10+12.35
ViT-B/16+3.10+1.21+2.87+3.75+3.19+3.36+19.07+17.44+13.81+4.73
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
ViT-T/16+10.13+9.71+8.42+10.71+11.30+9.89+51.72+44.99+34.69+20.01
ViT-S/16+7.30+4.57+4.53+4.75+6.21+6.34+36.47+35.66+29.43+12.00
+ +Table 4: Improving transferability via embedding-space alignment. We focus on Res50 as the source model and Res18 as the witness model. We observe improved transferability when alignment is performed in the embedding space or when combining output and embedding spaces. + +
MethodTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
KL+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
TV+26.04+19.91+11.88+17.40+20.66+15.93+5.70+1.72+0.85+5.79
RKD [41]+2.95+2.12+2.80+2.78+3.35+4.09-1.26-0.53-0.36+0.21
HINT [46]+5.95+6.55+5.27+5.43+9.54+4.34+2.55-0.01+1.24+2.58
EGA [36]+35.35+23.56+27.09+24.69+28.94+22.00+10.12+4.62+3.80+10.37
NCE [6]+21.51+19.25+20.39+16.06+19.70+13.29+6.78+3.38+1.06+6.73
KL+EGA+35.74+26.10+23.23+28.90+29.59+20.06+8.62+3.81+1.81+14.05
KL+NCE+31.35+24.46+20.12+22.62+27.14+19.06+8.48+1.50+2.36+12.18
+ +Alignment in the Embedding Space Can Further Improve Transferability. Recent advances in knowledge distillation highlight the benefits of aligning intermediate representations over aligning outputs [6,36,41]. Motivated by this, we investigate aligning the hidden representations of a Res50 source model with a Res18 witness model. We set $q$ in (1) to the layer before the fully-connected layer and evaluate four embedding-space distillation methods: Relational Knowledge Distillation (RKD) [41], Embedding Graph Alignment (EGA) [36], Intermediate-level Hints (HINT) [46] and Noise Contrastive Estimation (NCE) [6]. These methods correspond to different choices of distance metric $d$ in (1). Moreover, alignment can be performed in both output and embedding spaces, requiring the optimization of a combined objective with a scaling hyper-parameter $(\lambda)$ : $d_q(z_s^{[q]}(x),z_w^{[q]}(x)) + \lambda d_p(z_s^{[p]}(x),z_w^{[p]}(x))$ , where $p < q = l$ . In our experiment, we combine KL with EGA and NCE $(\lambda = 1)$ . + +Table 5: Compatibility of model alignment with different attack algorithms. The Res50 and ViT-B/16 source models are aligned with a Res18 and ViT-T/16 witness model, respectively. Each entry begins with the error rate for perturbations generated by the original source model. Then, this is followed by the change in the error rate after model alignment. The results demonstrate that the model alignment process enhances the effectiveness of all attack algorithms. + +
SourceAttackTarget
Res18VGG19DN121IncV3ViT-B/16SWIN
Res50MI [10]75.54 + 20.2371.46 + 19.9779.60 + 16.3159.08 + 22.2225.19 + 7.8737.04 + 16.02
NI [29]59.71 + 21.9956.30 + 19.1459.56 + 19.9046.45 + 15.5926.66 + 3.6228.62 + 8.41
VMI [53]85.26 + 12.7083.16 + 13.1388.09 + 9.7271.98 + 16.6829.62 + 8.3249.13 + 15.45
VNI [53]86.92 + 11.1885.64 + 11.3690.47 + 8.2173.60 + 16.4029.15 + 8.5846.64 + 16.75
SINI [29]67.43 + 17.0561.73 + 11.8765.82 + 13.3453.74 + 11.9626.07 + 3.0330.59 + 5.29
TI [11]71.31 + 21.6764.87 + 20.1373.95 + 16.8553.13 + 19.1825.58 + 7.5930.00 + 11.71
DI [61]87.95 + 11.0382.12 + 15.8890.02 + 9.4077.78 + 15.4527.48 + 8.6943.20 + 21.83
ViT-B/16MI [10]33.73 + 15.6035.24 + 12.0632.29 + 13.5133.97 + 11.8571.48 + 24.1333.57 + 20.87
NI [29]35.10 + 6.9335.58 + 4.5831.93 + 7.4433.67 + 5.7053.55 + 17.7330.69 + 8.60
VMI [53]35.59 + 18.6537.82 + 14.7234.55 + 16.1234.42 + 15.1577.20 + 19.1437.63 + 21.75
VNI [53]33.99 + 22.4537.19 + 17.1632.59 + 19.9233.19 + 20.8380.07 + 17.4438.19 + 21.89
SINI [29]36.68 + 11.4036.56 + 7.4933.12 + 9.6335.87 + 9.7062.07 + 9.9733.02 + 10.26
TI [11]36.85 + 29.9632.74 + 24.0535.48 + 25.9832.99 + 21.3167.16 + 27.2332.50 + 25.52
DI [61]41.75 + 30.7939.03 + 30.4241.40 + 26.6938.62 + 30.5184.10 + 13.7042.09 + 29.79
+ +Table 6: Improved transferability from using aligned models alone or in an ensemble. Perturbations from the aligned model (Res50*) demonstrate higher transferability compared to those from an ensemble of source and witness models. + +
SourceTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res1887.5367.41152.07458.8567.1250.2231.8824.6519.1630.91
Res5066.9785.0272.1464.8875.8949.5632.1425.2322.5828.96
Res50*92.0395.7389.8690.6092.5171.4244.1233.2425.5149.12
Res50 + Res18 [10]91.2591.5680.6075.9085.3660.1119.0115.9510.9027.10
2×Res50* [10]98.7099.4498.3296.0998.7184.6538.9825.7115.4257.30
2×(Res50 + Res18) [10]97.6998.7396.8192.9598.3278.6123.8718.0612.2541.77
+ +The results are summarized in Tab. 4, where we also supplement the previous KL-based results with total variation (TV). These results demonstrate improved transferability with other alignment formulations, including both embedding-space and output-embedding-space alignment. These promising findings pave the way for further exploration of embedding-space model alignment to improve adversarial transferability.. + +Model Alignment is Compatible with Other Transfer-enhancing Methods. To demonstrate that model alignment is compatible with a wide range of attack algorithms, we extend our analysis to include additional transfer-enhancing attacks. This includes optimization-based methods such as MI-FGSM [10], NIFGSM/SINI-FGSM [29] and VMI-FGSM/VNI-FGSM [53]. We also include data-augmentation-based methods such as TI-FGSM [11] and DI-FGSM [61]. Moreover, we consider a larger $\ell_{\infty}$ -norm constraint of $\epsilon = 8/255$ with a step size of $\alpha = 2/255$ , and double the number of iterations to 40. The results are summarized in Tab. 5. Each entry begins with the error rate for perturbations generated + +by the original source model. Then, this is followed by the change in the error rate after model alignment. We observe that all considered attack algorithms can leverage the aligned source model to improve transferability. + +Model-modification attacks: In addition to the attacks included in the table, we show that model alignment can be integrated with LinBP [17] and BPA [60], two model-modification-based methods. We compare the transferability of MI-FGSM-LinBP and PGD-BPA perturbations from the aligned Res50 to those from the original, unaligned Res50. We observe increased transferability across all target models, with an average increase of $9.66\%$ and $16.86\%$ , respectively. These results are included in the supplementary material. + +**Ensemble attacks:** Given that an additional witness model is involved in the attack process, it is important to compare perturbations produced by an aligned model with those generated by an ensemble of the original source and witness model. In Tab. 6, we first demonstrate transferability using the original Res18 and Res50, followed by a Res50 aligned with Res18 (Res50*). Next, we incorporate the ensemble in logits scheme [10] into the PGD attack, and consider three scenarios: an ensemble of the source and witness models (Res50+Res18), an ensemble of two aligned models $(2 \times \text{Res50}^*)$ , and an ensemble of two pairs of source-witness models $(2 \times (\text{Res50} + \text{Res18}))$ . + +We make two observations. First, perturbations from a single aligned model demonstrate higher transferability compared to those from an ensemble of source and witness models, and an ensemble of two aligned models not only further improves transferability but also surpasses the performance of the four-model ensemble. Beyond the improved transferability, model alignment brings the added benefits of faster inference times and lower memory requirements, presenting a significant advantage over conventional ensemble approaches. Second, when targeting ViTs, perturbations generated from ResNet ensembles exhibit limited transferability. This observation is in line with the previous result [35], underscoring the specific challenges in transferring attacks between different architectures. + +# 5 Conclusions + +In this paper, we proposed model alignment as a novel perspective in improving the transferability of adversarial examples. During alignment, the parameters of the source model are fine-tuned to minimize an alignment loss which measures the divergence in the predictions between the source and the witness model. We conduct a geometric analysis to study the changes in the loss landscape resulting from this process to better understand the underlying effect of model alignment. Extensive experiments on the ImageNet dataset demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. A limitation of our study is the absence of a theoretical framework to understand the model alignment process, and we consider it as future work. + +Acknowledgments. Avery Ma acknowledges the funding from the Natural Sciences and Engineering Research Council (NSERC) through the Canada Graduate Scholarships - Doctoral (CGS D) program. Amir-massoud Farahmand acknowledges the funding from the CIFAR AI Chairs program, as well as the support of the NSERC through the Discovery Grant program (2021-03701). Yangchen Pan, Philip Torr and Jindong Gu acknowledge the support from the UKRI Grant: Turing AI Fellowship EP/W002981/1, EPSRC/MURI Grant: EP/N019474/, and the Royal Academy of Engineering. Resources used in preparing this research were provided, in part, by the Province of Ontario, the Government of Canada through CIFAR, and companies sponsoring the Vector Institute. We would like to also thank the members of the Adaptive Agents Lab who provided feedback on a draft of this paper. + +# References + +1. Ahmed, N., Natarajan, T., Rao, K.R.: Discrete cosine transform. In: IEEE transactions on Computers (1974) +2. Benz, P., Zhang, C., Kweon, I.S.: Batch normalization increases adversarial vulnerability and decreases adversarial transferability: A non-robust feature perspective. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021) +3. Byun, J., Cho, S., Kwon, M.J., Kim, H.S., Kim, C.: Improving the transferability of targeted adversarial examples through object-based diverse input. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) +4. Carratino, L., Cissé, M., Jenatton, R., Vert, J.P.: On mixup regularization. Journal of Machine Learning Research (JMLR) (2022) +5. Charles, Z., Rosenberg, H., Papailiopoulos, D.: A geometric perspective on the transferability of adversarial directions. In: International Conference on Artificial Intelligence and Statistics (AISTATS) (2019) +6. Chen, Y., Xian, Y., Koepke, A., Shan, Y., Akata, Z.: Distilling audio-visual knowledge by compositional contrastive learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021) +7. Cheng, H., Xiao, E., Cao, J., Yang, L., Xu, K., Gu, J., Xu, R.: Typography leads semantic diversifying: Amplifying adversarial transferability across multimodal large language models. arXiv preprint arXiv:2405.20090 (2024) +8. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.: AutoAugment: Learning augmentation strategies from data. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019) +9. Deng, Y., Zheng, X., Zhang, T., Chen, C., Lou, G., Kim, M.: An analysis of adversarial attacks and defenses on autonomous driving models. In: IEEE International Conference on Pervasive Computing and Communications (PerCom) (2020) +10. Dong, Y., Liao, F., Pang, T., Su, H., Zhu, J., Hu, X., Li, J.: Boosting adversarial attacks with momentum. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018) +11. Dong, Y., Pang, T., Su, H., Zhu, J.: Evading defenses to transferable adversarial examples by translation-invariant attacks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019) + +12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (ICLR) (2021) +13. Fawzi, A., Moosavi-Dezfooli, S.M., Frossard, P.: The robustness of deep networks: A geometrical perspective. In: IEEE Signal Processing Magazine (2017) +14. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: International Conference on Learning Representations (ICLR) (2015) +15. Gu, J., Jia, X., de Jorge, P., Yu, W., Liu, X., Ma, A., Xun, Y., Hu, A., Khakzar, A., Li, Z., Cao, X., Torr, P.: A survey on transferability of adversarial examples across deep neural networks. Transactions on Machine Learning Research (TMLR) (2024) +16. Gubri, M., Cordy, M., Papadakis, M., Traon, Y.L., Sen, K.: Lgv: Boosting adversarial example transferability from large geometric vicinity. In: Proceedings of the European Conference on Computer Vision (ECCV) (2022) +17. Guo, Y., Li, Q., Chen, H.: Backpropagating linearly improves transferability of adversarial examples. In: Advances in Neural Information Processing Systems (NeurIPS) (2020) +18. Han, D., Jia, X., Bai, Y., Gu, J., Liu, Y., Cao, X.: OT-Attack: Enhancing adversarial transferability of vision-language models via optimal transport optimization. arXiv preprint arXiv:2312.04403 (2023) +19. He, K., Zhang, X., Ren, S., Sun, J.: Identity mappings in deep residual networks. In: Proceedings of the European Conference on Computer Vision (ECCV) (2016) +20. He, T., Zhang, Z., Zhang, H., Zhang, Z., Xie, J., Li, M.: Bag of tricks for image classification with convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019) +21. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015) +22. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017) +23. Ilyas, A., Santurkar, S., Tsipras, D., Engstrom, L., Tran, B., Madry, A.: Adversarial examples are not bugs, they are features. In: Advances in Neural Information Processing Systems (NeurIPS) (2019) +24. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning (ICML) (2015) +25. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Advances in Neural Information Processing Systems (NeurIPS) (2012) +26. Li, Q., Guo, Y., Zuo, W., Chen, H.: Making substitute models more bayesian can enhance transferability of adversarial examples. In: International Conference on Learning Representations (ICLR) (2022) +27. Li, Y., Bai, S., Xie, C., Liao, Z., Shen, X., Yuille, A.: Regional homogeneity: Towards learning transferable universal adversarial perturbations against defenses. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020) +28. Li, Z., Shi, C., Xie, Y., Liu, J., Yuan, B., Chen, Y.: Practical adversarial attacks against speaker recognition systems. In: Proceedings of the 21st International Workshop on Mobile Computing Systems and Applications (2020) + +29. Lin, J., Song, C., He, K., Wang, L., Hopcroft, J.E.: Nesterov accelerated gradient and scale invariance for adversarial attacks. In: International Conference on Learning Representations (ICLR) (2020) +30. Liu, Y., Chen, X., Liu, C., Song, D.: Delving into transferable adversarial examples and black-box attacks. In: International Conference on Learning Representations (ICLR) (2016) +31. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021) +32. Luo, H., Gu, J., Liu, F., Torr, P.: An image is worth 1000 lies: Transferability of adversarial images across prompts on vision-language models. In: International Conference on Learning Representations (ICLR) (2024) +33. Ma, A., Dvornik, N., Zhang, R., Pishdad, L., Derpanis, K.G., Fazly, A.: SAGE: Saliency-guided mixup with optimal rearrangements. In: British Machine Vision Conference (BMVC) (2022) +34. Ma, A., Pan, Y., Farahmand, A.m.: Understanding the robustness difference between stochastic gradient descent and adaptive gradient methods. Transactions on Machine Learning Research (TMLR) (2023) +35. Ma, W., Li, Y., Jia, X., Xu, W.: Transferable adversarial attack for both vision transformers and convolutional networks via momentum integrated gradients. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023) +36. Ma, Y., Chen, Y., Akata, Z.: Distilling knowledge from self-supervised teacher by embedding graph alignment. In: British Machine Vision Conference (BMVC) (2022) +37. Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: International Conference on Learning Representations (ICLR) (2018) +38. Mahmood, K., Mahmood, R., Van Dijk, M.: On the robustness of vision transformers to adversarial examples. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021) +39. Müller, R., Kornblith, S., Hinton, G.E.: When does label smoothing help? In: Advances in Neural Information Processing Systems (NeurIPS) (2019) +40. Naseer, M., Ranasinghe, K., Khan, S., Khan, F.S., Porikli, F.: On improving adversarial transferability of vision transformers. In: International Conference on Learning Representations (ICLR) (2021) +41. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019) +42. Qayyum, A., Qadir, J., Bilal, M., Al-Fuqaha, A.: Secure and robust machine learning for healthcare: A survey. In: IEEE Reviews in Biomedical Engineering (2020) +43. Qian, Y., He, S., Zhao, C., Sha, J., Wang, W., Wang, B.: Lea2: A lightweight ensemble adversarial attack via non-overlapping vulnerable frequency regions. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023) +44. Qin, Z., Fan, Y., Liu, Y., Shen, L., Zhang, Y., Wang, J., Wu, B.: Boosting the transferability of adversarial attacks with reverse adversarial perturbation. In: Advances in Neural Information Processing Systems (NeurIPS) (2022) +45. Raghu, M., Unterthiner, T., Kornblith, S., Zhang, C., Dosovitskiy, A.: Do vision transformers see like convolutional neural networks? In: Advances in Neural Information Processing Systems (NeurIPS) (2021) + +46. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014) +47. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (ICLR) (2015) +48. Steiner, A., Kolesnikov, A., Zhai, X., Wightman, R., Uszkoreit, J., Beyer, L.: How to train your vit? data, augmentation, and regularization in vision transformers. Transactions on Machine Learning Research (TMLR) (2021) +49. Szegedy, C., Vanhoucke, V., Ioffe, S., Shlens, J., Wojna, Z.: Rethinking the inception architecture for computer vision. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016) +50. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. In: International Conference on Learning Representations (ICLR) (2014) +51. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold Mixup: Better representations by interpolating hidden states. In: International Conference on Learning Representations (ICLR) (2019) +52. Wang, H., Wu, X., Huang, Z., Xing, E.P.: High-frequency component helps explain the generalization of convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020) +53. Wang, X., He, K.: Enhancing the transferability of adversarial attacks through variance tuning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021) +54. Waseda, F., Nishikawa, S., Le, T.N., Nguyen, H.H., Echizen, I.: Closer look at the transferability of adversarial examples: How they fool different models differently. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) (2023) +55. Wei, Z., Chen, J., Goldblum, M., Wu, Z., Goldstein, T., Jiang, Y.G.: Towards transferable adversarial attacks on vision transformers. In: AAAI Conference on Artificial Intelligence (AAAI) (2022) +56. Wu, D., Wang, Y., Xia, S.T., Bailey, J., Ma, X.: Skip connections matter: On the transferability of adversarial examples generated with resnets. In: International Conference on Learning Representations (ICLR) (2020) +57. Wu, L., Zhu, Z.: Towards understanding and improving the transferability of adversarial examples in deep neural networks. In: Asian Conference on Machine Learning (2020) +58. Wu, W., Su, Y., Lyu, M.R., King, I.: Improving the transferability of adversarial samples with adversarial transformations. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021) +59. Xiao, Z., Gao, X., Fu, C., Dong, Y., Gao, W., Zhang, X., Zhou, J., Zhu, J.: Improving transferability of adversarial patches on face recognition with generative models. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021) +60. Xiaosen, W., Tong, K., He, K.: Rethinking the backward propagation for adversarial transferability. In: Advances in Neural Information Processing Systems (NeurIPS) (2024) +61. Xie, C., Zhang, Z., Zhou, Y., Bai, S., Wang, J., Ren, Z., Yuille, A.L.: Improving transferability of adversarial examples with input diversity. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019) + +62. Xiong, Y., Lin, J., Zhang, M., Hopcroft, J.E., He, K.: Stochastic variance reduced ensemble adversarial attack for boosting the adversarial transferability. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) +63. Yin, D., Gontijo Lopes, R., Shlens, J., Cubuk, E.D., Gilmer, J.: A Fourier perspective on model robustness in computer vision. In: Advances in Neural Information Processing Systems (NeurIPS) (2019) +64. Yu, W., Gu, J., Li, Z., Torr, P.: Reliable evaluation of adversarial transferability. arXiv preprint arXiv:2306.08565 (2023) +65. Yun, S., Han, D., Oh, S.J., Chun, S., Choe, J., Yoo, Y.: CutMix: Regularization strategy to train strong classifiers with localizable features. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019) +66. Zhang, C., Benz, P., Karjauv, A., Cho, J.W., Zhang, K., Kweon, I.S.: Investigating top-k white-box and transferable black-box attack. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) +67. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: Mixup: Beyond empirical risk minimization. In: International Conference on Learning Representations (ICLR) (2018) +68. Zhang, L., Deng, Z., Kawaguchi, K., Ghorbani, A., Zou, J.: How does mixup help with robustness and generalization? In: International Conference on Learning Representations (ICLR) (2021) +69. Zhang, Y., Hu, S., Zhang, L.Y., Shi, J., Li, M., Liu, X., Wan, W., Jin, H.: Why does little robustness help? a further step towards understanding adversarial transferability. In: Proceedings of the IEEE Symposium on Security and Privacy (SP) (2024) +70. Zhao, P., Chen, P.Y., Das, P., Ramamurthy, K.N., Lin, X.: Bridging mode connectivity in loss landscapes and adversarial robustness. In: International Conference on Learning Representations (ICLR) (2020) +71. Zhao, Z., Liu, Z., Larson, M.: On success and simplicity: A second look at transferable targeted attacks. In: Advances in Neural Information Processing Systems (NeurIPS) (2021) +72. Zhou, D., Yu, Z., Xie, E., Xiao, C., Anandkumar, A., Feng, J., Alvarez, J.M.: Understanding the robustness in vision transformers. In: International Conference on Machine Learning (ICML) (2022) +73. Zhu, Y., Sun, J., Li, Z.: Rethinking adversarial transferability from a data distribution perspective. In: International Conference on Learning Representations (ICLR) (2021) +74. Zou, J., Pan, Z., Qiu, J., Liu, X., Rui, T., Li, W.: Improving the transferability of adversarial examples with resized-diverse-inputs, diversity-ensemble and region fitting. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020) \ No newline at end of file diff --git a/2024/Improving Adversarial Transferability via Model Alignment/images.zip b/2024/Improving Adversarial Transferability via Model Alignment/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..3a07acf7be7264a94bb0b6f50f2a38e24399f7f0 --- /dev/null +++ b/2024/Improving Adversarial Transferability via Model Alignment/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a1d137547f2192f94b5cd6651b2cfbe468b575085951463ccced4f599dc027f3 +size 559433 diff --git a/2024/Improving Adversarial Transferability via Model Alignment/layout.json b/2024/Improving Adversarial Transferability via Model Alignment/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..4064d976b301304c59f8af76295a0ec6bc4c8662 --- /dev/null +++ b/2024/Improving Adversarial Transferability via Model Alignment/layout.json @@ -0,0 +1,9168 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 162, + 111, + 455, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 111, + 455, + 148 + ], + "spans": [ + { + "bbox": [ + 162, + 111, + 455, + 148 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "spans": [ + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "text", + "content": "Avery Ma" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "text", + "content": ", Amir-massoud Farahmand" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "text", + "content": ", Yangchen Pan" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "text", + "content": ", Philip Torr" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "text", + "content": ", and Jindong Gu" + }, + { + "bbox": [ + 175, + 167, + 440, + 194 + ], + "type": "inline_equation", + "content": "^{3}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 220, + 201, + 393, + 246 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 220, + 201, + 393, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 201, + 393, + 223 + ], + "spans": [ + { + "bbox": [ + 220, + 201, + 393, + 223 + ], + "type": "text", + "content": "1 University of Toronto, Toronto, Canada \nama@cs.toronto.edu" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 231, + 224, + 381, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 224, + 381, + 234 + ], + "spans": [ + { + "bbox": [ + 231, + 224, + 381, + 234 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 231, + 224, + 381, + 234 + ], + "type": "text", + "content": " Vector Institute, Toronto, Canada" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 232, + 235, + 380, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 232, + 235, + 380, + 246 + ], + "spans": [ + { + "bbox": [ + 232, + 235, + 380, + 246 + ], + "type": "text", + "content": "3 University of Oxford, Oxford, UK" + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 160, + 275, + 455, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 275, + 455, + 430 + ], + "spans": [ + { + "bbox": [ + 160, + 275, + 455, + 430 + ], + "type": "text", + "content": "Abstract. Neural networks are susceptible to adversarial perturbations that are transferable across different models. In this paper, we introduce a novel model alignment technique aimed at improving a given source model's ability in generating transferable adversarial perturbations. During the alignment process, the parameters of the source model are finetuned to minimize an alignment loss. This loss measures the divergence in the predictions between the source model and another, independently trained model, referred to as the witness model. To understand the effect of model alignment, we conduct a geometric analysis of the resulting changes in the loss landscape. Extensive experiments on the ImageNet dataset, using a variety of model architectures, demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. Our source code is available at https://github.com/averyma/model-alignment." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 449, + 230, + 462 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 449, + 230, + 462 + ], + "spans": [ + { + "bbox": [ + 133, + 449, + 230, + 462 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 474, + 482, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 545 + ], + "type": "text", + "content": "Adversarial examples with small perturbations can mislead deep neural networks to make wrong predictions [50]. It has been observed that perturbations created to attack one model can also fool other models, which is known as adversarial transferability [14]. The transferability of such perturbations has received significant attention recently since it poses practical concerns for the deployment of machine learning systems in real-world applications [9,28,42]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": "One possible explanation for this transferability is that transferable perturbations exploit similar features present in both the source and target models [23]. To see this, let us first consider the hypothesis that neural networks capture two distinct types of features from data: semantic features and human-imperceptible features. This hypothesis has been proposed and supported in [34, 52, 63]. We provide a summary of their findings as follows. First, models learn semantic features that align with human perception. The extraction of such features is similar across different models, reflecting a shared understanding of the semantics. Second, models learn human-imperceptible features, and their learning is model-specific. For example, Ma et al. [34] showed that the use of these features" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 117, + 478, + 216 + ], + "blocks": [ + { + "bbox": [ + 135, + 117, + 478, + 216 + ], + "lines": [ + { + "bbox": [ + 135, + 117, + 478, + 216 + ], + "spans": [ + { + "bbox": [ + 135, + 117, + 478, + 216 + ], + "type": "image", + "image_path": "8802665858e6c43360cf817fa47d38ebe8f04e60c2147234b6062604f40b8263.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 236, + 482, + 314 + ], + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 314 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 314 + ], + "type": "text", + "content": "Fig. 1: Attacking the aligned source model for more transferable perturbations. We compare the transferability of " + }, + { + "bbox": [ + 130, + 236, + 482, + 314 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 236, + 482, + 314 + ], + "type": "text", + "content": "-norm bounded perturbations (" + }, + { + "bbox": [ + 130, + 236, + 482, + 314 + ], + "type": "inline_equation", + "content": "\\epsilon = 4/255" + }, + { + "bbox": [ + 130, + 236, + 482, + 314 + ], + "type": "text", + "content": ") generated using the source model before and after performing model alignment. The result highlights the compatibility of model alignment with a wide range of attacks, as perturbations generated from the aligned source model become more transferable. Here, the source model is aligned using a witness model from the same architecture but is initialized and trained independently. Results are averaged over all target models." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 338, + 481, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 481, + 363 + ], + "type": "text", + "content": "varies with models' optimization processes, while Wang et al. [52] showed that model architecture leads to specific feature interpretations." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 363, + 482, + 507 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 363, + 482, + 507 + ], + "spans": [ + { + "bbox": [ + 130, + 363, + 482, + 507 + ], + "type": "text", + "content": "Features and vulnerabilities are highly correlated, as vulnerabilities often stem from the exploitation of certain features [23]. In the context of transferability, the degree of similarity between those exploited features in the source and target model is crucial. That is, the more similar the exploited features between models, the more likely it is that the perturbation will successfully transfer. To support this, Liu et al. [30] showed that different models have similar decision boundaries (from learning similar features), thus enabling some perturbation to be transferable across different models. However, some perturbations exploit features that are specific to the source model. Qin et al. [44] demonstrated that when maximizing the cross entropy loss to find adversarial examples, some perturbations fail to transfer since they are located at sharp local maxima unique to the source model, which do not exist for the target model." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 508, + 481, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 508, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 508, + 481, + 544 + ], + "type": "text", + "content": "Motivated by these observations, we propose a model alignment technique to modify the source model to encourage a similar feature extraction as other, independently trained models, which we refer to as witness models." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 154, + 544, + 459, + 568 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 544, + 459, + 568 + ], + "spans": [ + { + "bbox": [ + 154, + 544, + 459, + 568 + ], + "type": "text", + "content": "Our goal is to transform any source model into one from which attacks generate more transferable perturbations." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 569, + 481, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 481, + 640 + ], + "type": "text", + "content": "During the alignment process, the source model's parameters are fine-tuned to minimize an alignment loss, which measures the prediction divergence between the source and witness models. Through this alignment process, the source model learns to focus on a set of features that are similarly extracted by the witness model. This allows attack algorithms to more effectively exploit features common across models, leading to more transferable perturbations." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Because of the orthogonal nature of our approach, model alignment complements, rather than competes with, other attack algorithms. This synergy under-" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "scores our method's key advantage: its broad compatibility with a wide range of attack algorithms, as highlighted in Fig. 1. Extensive experiments on various combinations of architectures, transferability on individual target models, and results with other attacks are included in Sec. 4." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 480, + 270 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 480, + 270 + ], + "type": "text", + "content": "We analyze the effect of the proposed alignment method, demonstrating that perturbations generated from the source model exploit more semantic features that are shared across different models. Additionally, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process. The analysis explores the relationship between model alignment and the use of soft labels [20,49,67]. Results show that there is a notable smoothing effect on the loss surface of the model, which is consistent with prior findings that adversarial examples from flatter maxima are more transferable [16,44]. Our contributions can be summarized as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 281, + 480, + 399 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 281, + 479, + 315 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 281, + 479, + 315 + ], + "spans": [ + { + "bbox": [ + 138, + 281, + 479, + 315 + ], + "type": "text", + "content": "- We present a model alignment method to fine-tune the source model by minimizing an alignment loss which measures the difference in the output between the source model and the witness model." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 317, + 480, + 340 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 317, + 480, + 340 + ], + "spans": [ + { + "bbox": [ + 138, + 317, + 480, + 340 + ], + "type": "text", + "content": "- To understand the effect of model alignment, we conduct a geometric analysis to study the changes in the loss landscape resulting from this process." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 341, + 480, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 341, + 480, + 399 + ], + "spans": [ + { + "bbox": [ + 138, + 341, + 480, + 399 + ], + "type": "text", + "content": "- Extensive experiments on ImageNet [25], using convolutional neural networks (CNNs) and Vision Transformers (ViTs) [12,31], demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. We demonstrate that our alignment technique is compatible with a wide range of attacks." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 420, + 237, + 432 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 420, + 237, + 432 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 237, + 432 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 446, + 479, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 479, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 479, + 482 + ], + "type": "text", + "content": "In this section, we provide a brief overview of approaches to generate more transferable perturbations. For a more comprehensive review of research related to adversarial transferability, we direct the reader to a recent survey [15]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 500, + 356, + 511 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 500, + 356, + 511 + ], + "spans": [ + { + "bbox": [ + 131, + 500, + 356, + 511 + ], + "type": "text", + "content": "2.1 Generating Transferable Perturbations" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 521, + 480, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 480, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 480, + 569 + ], + "type": "text", + "content": "Existing work on improving the transferability of adversarial examples can be categorized into four groups: data-augmentation-based methods [3,7,11,27,58,61, 74], optimization-based methods [10,18,29,32,53,59,66,71], model-modificationbased methods [2,17,56,60], and ensemble-based methods [16,26,30,43]." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 570, + 480, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 480, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 480, + 628 + ], + "type": "text", + "content": "Data-augmentation-based methods: Data augmentation prevents overfitting in deep neural networks, with advanced techniques [8, 33, 65, 67] being key for state-of-the-art generalization on large datasets. Building on this, several works have incorporated data augmentation into attacks to prevent adversarial examples from overfitting to the source model, thereby improving transferability." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "content": "Optimization-based methods: Lin et al. [29] drew a parallel between generating transferable adversarial examples and training neural networks. In this analogy, source models are the training data, adversarial perturbations are model" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 481, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 481, + 164 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 481, + 164 + ], + "type": "text", + "content": "parameters, and the target model is the testing data. Thus, transferability of adversarial examples is akin to model generalization. Optimization-based methods, such as momentum [10, 29, 74] and variance tuning [53, 62], initially designed to improve model generalization, can similarly improve adversarial transferability." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 481, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 481, + 295 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 481, + 295 + ], + "type": "text", + "content": "Model-modification-based methods: Several studies have proposed methods to improve transferability by modifying the source model. Benz et al. [2] showed that perturbations from models without batch normalization [24] are more transferable. Methods like Linear Backpropagation (LinBP) [17] and Backward Propagation Attack (BPA) [60] focus on non-linear activations and modify the derivative of ReLU. Wu et al. [56] showed that increasing gradients from skip connections can improve transferability. A key advantage of our approach is its model-agnostic nature: alignment can be applied without changing the model's forward or backward pass, improving any source model's ability to generate more transferable perturbations. In contrast, other methods require changes, such as those seen in LinBP and BPA, or even complete retraining." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 296, + 482, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 296, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 296, + 482, + 380 + ], + "type": "text", + "content": "Ensemble-based methods: Another line of approaches involves the use of multiple models for generating adversarial examples. Liu et al. [30] were among the first to propose enhancing transferability by attacking an ensemble of models, with the rationale being that a perturbation capable of fooling multiple models is more likely to deceive the target model. More recently, Gubri et al. [16] proposed constructing an ensemble of source models by collecting weights along the finetuning trajectory of a trained model." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 395, + 373, + 407 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 395, + 373, + 407 + ], + "spans": [ + { + "bbox": [ + 131, + 395, + 373, + 407 + ], + "type": "text", + "content": "2.2 Understanding Adversarial Transferability" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 412, + 482, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 412, + 482, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 412, + 482, + 545 + ], + "type": "text", + "content": "Several works have focused on understanding the transferability of adversarial perturbations [54, 57, 69, 73], with some analyzing from a geometric perspective [5, 13, 30, 70]. Liu et al. [30] showed that weakly transferable adversarial examples often fall into local maxima of the source model. They found that some perturbations fail to transfer because they reside in tiny pockets corresponding to the ground truth label, present in the source model but not in the target model. Similarly, Gubri et al. [16] hypothesized that adversarial examples at flat loss maxima transfer more effectively than those at sharp maxima. Motivated by these insights, in Sec. 3.3, we extend this geometric perspective to examine how the alignment method influences the source model's loss surface geometry to generate more transferable adversarial examples." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 561, + 203, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 561, + 203, + 574 + ], + "spans": [ + { + "bbox": [ + 131, + 561, + 203, + 574 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 584, + 481, + 608 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 584, + 481, + 608 + ], + "spans": [ + { + "bbox": [ + 131, + 584, + 481, + 608 + ], + "type": "text", + "content": "We present the model alignment process and understand why aligned models can generate more transferable perturbations." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 624, + 222, + 635 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 624, + 222, + 635 + ], + "spans": [ + { + "bbox": [ + 131, + 624, + 222, + 635 + ], + "type": "text", + "content": "3.1 Preliminary" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "In this work, we focus on neural networks used for classification tasks. Let us consider a neural network designed for " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "-class classification, represented as a" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 102 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 271, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 271, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 271, + 128 + ], + "type": "text", + "content": "series of function compositions:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 232, + 137, + 383, + 152 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 232, + 137, + 383, + 152 + ], + "spans": [ + { + "bbox": [ + 232, + 137, + 383, + 152 + ], + "type": "interline_equation", + "content": "f (x) = (\\phi^ {[ l ]} \\circ \\phi^ {[ l - 1 ]} \\circ \\dots \\circ \\phi^ {[ 1 ]}) (x),", + "image_path": "94fb3611bb12d0a49a26eb0e4bb752de12cb99558bfc63434030fd8ae32adad6.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "spans": [ + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": "where each " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "\\phi^{[i]}" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": " represents an operation within the network, which could be a linear transformation (such as a fully connected layer), an activation function, or a pooling operation. The parameters of the neural network are collectively denoted as " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": ". The intermediate outputs of these operations are often referred to as hidden representations. We denote them by " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "z^{[i]}" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "z^{[i]} = \\phi^{[i]}(z^{[i-1]})" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "i = 1, 2, \\ldots, l" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": ", and the initial input is " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "z^{[0]} = x" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": ". Additionally, we incorporate the softmax function into the neural network's definition. Specifically, in the final layer, we have " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "\\phi^{[l]} = \\operatorname{softmax}(z^{[l-1]})" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "z^{[l-1]}" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": " are called the logits. With this definition, the output of this network, " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "f(x)" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": ", can be interpreted as a probability distribution over the " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": " classes where each component " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "f(x)_i" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": " represents the probability of the input " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": " belonging to class " + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 159, + 482, + 291 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 308, + 249, + 320 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 249, + 320 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 249, + 320 + ], + "type": "text", + "content": "3.2 Model Alignment" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 329, + 480, + 377 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 480, + 377 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 480, + 377 + ], + "type": "text", + "content": "The goal of model alignment is to modify the source model such that it can extract features similar to those of other models (the witness model). We denote the parameters of the source model and the witness model as " + }, + { + "bbox": [ + 130, + 329, + 480, + 377 + ], + "type": "inline_equation", + "content": "\\theta_s" + }, + { + "bbox": [ + 130, + 329, + 480, + 377 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 480, + 377 + ], + "type": "inline_equation", + "content": "\\theta_w" + }, + { + "bbox": [ + 130, + 329, + 480, + 377 + ], + "type": "text", + "content": ", respectively. Let us consider the following point-wise formulation of the alignment loss:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 238, + 387, + 480, + 402 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 387, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 238, + 387, + 480, + 402 + ], + "type": "interline_equation", + "content": "\\ell_ {a} (x, \\theta_ {s}, \\theta_ {w}) = d \\left(z _ {s} ^ {[ q ]} (x), z _ {w} ^ {[ q ]} (x)\\right), \\tag {1}", + "image_path": "b80292a2c7cbeb42854ef8e5f9e96e29d22e793d803d09ddee49478bcf7c7143.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 407, + 480, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 480, + 418 + ], + "type": "text", + "content": "where the metric " + }, + { + "bbox": [ + 130, + 407, + 480, + 418 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 407, + 480, + 418 + ], + "type": "text", + "content": " measures the output difference at layer " + }, + { + "bbox": [ + 130, + 407, + 480, + 418 + ], + "type": "inline_equation", + "content": "q" + }, + { + "bbox": [ + 130, + 407, + 480, + 418 + ], + "type": "text", + "content": " between the models." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "text", + "content": "Model alignment is a fine-tuning process. During alignment, the parameters of the source model are updated to minimize this alignment loss which captures the differences between models' output. Specifically, when " + }, + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "inline_equation", + "content": "q = l" + }, + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "text", + "content": ", the alignment loss measures the divergence between the probability distributions generated by the two models. In this scenario, the Kullback-Leibler (KL) divergence is particularly suitable, due to its effectiveness in measuring distribution differences and its relative ease of implementation in practice. Our analysis and primary experimental results are based on model alignment in the output space, using KL divergence as " + }, + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "text", + "content": ". We also explore total variation and alignment in the embedding space (i.e., " + }, + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "inline_equation", + "content": "q < l" + }, + { + "bbox": [ + 130, + 418, + 481, + 537 + ], + "type": "text", + "content": "), which is detailed in our ablation study." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 538, + 481, + 609 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 538, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 130, + 538, + 481, + 609 + ], + "type": "text", + "content": "The point-wise loss defined in (1) focuses on aligning the source model with a single witness model. However, alignment can also be extended to multiple witness models to further improve the alignment process. This process involves using a set of witness models, denoted as " + }, + { + "bbox": [ + 130, + 538, + 481, + 609 + ], + "type": "inline_equation", + "content": "\\Theta" + }, + { + "bbox": [ + 130, + 538, + 481, + 609 + ], + "type": "text", + "content": ", with the number of witness models represented by " + }, + { + "bbox": [ + 130, + 538, + 481, + 609 + ], + "type": "inline_equation", + "content": "|\\Theta|" + }, + { + "bbox": [ + 130, + 538, + 481, + 609 + ], + "type": "text", + "content": ". Finally, the update rule for the parameters of the source model based on SGD can be written as" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 188, + 616, + 427, + 646 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 188, + 616, + 427, + 646 + ], + "spans": [ + { + "bbox": [ + 188, + 616, + 427, + 646 + ], + "type": "interline_equation", + "content": "\\theta_ {s} (t + 1) = \\theta_ {s} (t) - \\eta \\frac {1}{| \\mathcal {B} | | \\Theta |} \\sum_ {x \\in \\mathcal {B}} \\sum_ {\\theta_ {w} \\in \\Theta} \\nabla \\ell_ {a} (x, \\theta_ {s} (t), \\theta_ {w}),", + "image_path": "bf5c9300ad9252b2fbe18a68e7883946f4c5efe029e5662ea4eff9067a12a93f.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 653, + 288, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 653, + 288, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 653, + 288, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 653, + 288, + 665 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 132, + 653, + 288, + 665 + ], + "type": "text", + "content": " represents the mini-batch." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 114, + 298, + 208 + ], + "blocks": [ + { + "bbox": [ + 143, + 114, + 298, + 208 + ], + "lines": [ + { + "bbox": [ + 143, + 114, + 298, + 208 + ], + "spans": [ + { + "bbox": [ + 143, + 114, + 298, + 208 + ], + "type": "image", + "image_path": "d20c998a3ab1624cc0dd7ccef37e7c3e4306eb1683775845585547c20677b969.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 197, + 212, + 243, + 220 + ], + "lines": [ + { + "bbox": [ + 197, + 212, + 243, + 220 + ], + "spans": [ + { + "bbox": [ + 197, + 212, + 243, + 220 + ], + "type": "text", + "content": "a. ResNet50." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 314, + 114, + 471, + 208 + ], + "blocks": [ + { + "bbox": [ + 314, + 114, + 471, + 208 + ], + "lines": [ + { + "bbox": [ + 314, + 114, + 471, + 208 + ], + "spans": [ + { + "bbox": [ + 314, + 114, + 471, + 208 + ], + "type": "image", + "image_path": "c3948fe79675ba4de4b0a1701c36691cfae9f05ef691063e1834620f95e835bc.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 369, + 212, + 416, + 220 + ], + "lines": [ + { + "bbox": [ + 369, + 212, + 416, + 220 + ], + "spans": [ + { + "bbox": [ + 369, + 212, + 416, + 220 + ], + "type": "text", + "content": "b. ViT-B/16." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 229, + 482, + 297 + ], + "lines": [ + { + "bbox": [ + 130, + 229, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 229, + 482, + 297 + ], + "type": "text", + "content": "Fig.2: A frequency-domain visualization of the differences in the perturbation generated using the original source model and the aligned source model. We compare the magnitude of the DCT coefficients between the perturbations generated by the two models: " + }, + { + "bbox": [ + 130, + 229, + 482, + 297 + ], + "type": "inline_equation", + "content": "|\\mathrm{DCT}(\\Delta x_a)| - |\\mathrm{DCT}(\\Delta x_s)|" + }, + { + "bbox": [ + 130, + 229, + 482, + 297 + ], + "type": "text", + "content": ". The pronounced brightness in the top-left region of the spectrum indicates that the primary differences lie within the low-frequency range, which is typically associated with semantic features." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 318, + 326, + 331 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 318, + 326, + 331 + ], + "spans": [ + { + "bbox": [ + 131, + 318, + 326, + 331 + ], + "type": "text", + "content": "3.3 Understanding Model Alignment" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "text", + "content": "We now understand the model alignment approach from two perspectives: semantic feature exploitation and geometric analysis of the loss surface. The analysis in this section uses ResNet50 and ViT-B/16 as source models, which are aligned with ResNet18 and ViT-T/16 as their respective witness models. We consider " + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "text", + "content": "-norm adversarial examples generated using 20 iterations of PGD [37] with " + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\epsilon = 4 / 255" + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\alpha = 1 / 255" + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "text", + "content": ". We use " + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\Delta x_{s}" + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\Delta x_{a}" + }, + { + "bbox": [ + 130, + 338, + 482, + 422 + ], + "type": "text", + "content": " to represent the perturbations generated based on the source and aligned models, respectively." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "text", + "content": "Aligned Model Exploits More Semantic Features. To verify that attacks applied to the aligned model exploit more semantic features, we compare the perturbations generated using the original and aligned source models. Adversarial perturbations are imperceptible and difficult to characterize in terms of the specific features they exploit in the spatial domain. However, by analyzing perturbations in the frequency domain, we can observe the types of features each model exploits. Previous work has shown that semantic features mostly concentrate around the low-frequency end of the spectrum [34,52,63]. We consider discrete cosine transform (DCT) [1] and compare the DCT coefficients of the perturbations generated from the source and the aligned model, denoted as " + }, + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "inline_equation", + "content": "\\mathrm{DCT}(\\Delta x_s)" + }, + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "inline_equation", + "content": "\\mathrm{DCT}(\\Delta x_a)" + }, + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "text", + "content": ", respectively. The results are averaged over 1000 randomly sampled images from the ImageNet test set. Since our interest lies in the magnitude of these coefficients, we visualize the difference by computing " + }, + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "inline_equation", + "content": "|\\mathrm{DCT}(\\Delta x_a)| - |\\mathrm{DCT}(\\Delta x_s)|" + }, + { + "bbox": [ + 130, + 437, + 482, + 605 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "type": "text", + "content": "The results are illustrated in Fig. 2. We observe that the differences between the perturbations are predominantly located in the top-left corner of the DCT spectrum, indicating that they primarily differ in the amount of low-frequency information. This result shows that adversarial perturbations generated from the aligned exploit more low-frequency, semantic features." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 114, + 465, + 210 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 465, + 210 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 465, + 210 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 465, + 210 + ], + "type": "image", + "image_path": "ad12d108f9562a67bfb5363b781a9afd2f6485665ca3c95dec20dc763f3c391c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "lines": [ + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "spans": [ + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "type": "text", + "content": "Fig. 3: Visualization of the loss surface around adversarial perturbations for original and aligned ResNet50 and ViT-b/16. Each plot illustrates the loss surface projected on the plane defined by the adversarial perturbation direction and its orthogonal vector. We examine the loss landscape around a clean data point (cyan) and an " + }, + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "type": "text", + "content": "-bounded adversially perturbed data point (red), generated from the source " + }, + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "type": "inline_equation", + "content": "(\\Delta x_{s})" + }, + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "type": "text", + "content": " and aligned models " + }, + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "type": "inline_equation", + "content": "(\\Delta x_{a})" + }, + { + "bbox": [ + 131, + 220, + 482, + 298 + ], + "type": "text", + "content": ". Perturbations from the original source models are at sharper loss maxima, while those from the aligned model are on flatter surfaces." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 324, + 479, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 324, + 479, + 384 + ], + "spans": [ + { + "bbox": [ + 130, + 324, + 479, + 384 + ], + "type": "text", + "content": "Model Alignment Yields Smoother Loss Surface. Previous works have studied the connection between perturbation from sharp loss maxima and their poor transferability [16, 44]. We extend this geometric perspective by examining how model alignment affects the loss surface geometry of the source model, particularly in its capacity to generate more transferable adversarial examples." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 386, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 386, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 386, + 482, + 482 + ], + "type": "text", + "content": "First, consider when (1) measures the KL divergence between the two models' predictions. During alignment, the source model's parameters are fine-tuned using soft labels from the witness model's outputs. Training deep neural networks with soft labels prevents the model from becoming overly confident in its predictions, thereby improving generalization [20, 21, 39, 49]. Compared to using hard, one-hot encoded labels, it has been shown that training with soft labels implicitly regularizes the norm of the input Jacobian [4, 68], and leads to smoother decision boundaries [51, 67]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": "To understand why model alignment can be helpful, we begin by identifying a data point for which the perturbation, when generated based on the original source model, fails to transfer to the target model, but the perturbation generated using the aligned model misleads the target model. In Fig. 3, we visualize the loss surface surrounding this data point, spanned by two pairs of orthogonal vectors: " + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "inline_equation", + "content": "\\Delta x_{s}" + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "inline_equation", + "content": "\\Delta x_{s}^{\\perp}" + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "inline_equation", + "content": "\\Delta x_{a}" + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "inline_equation", + "content": "\\Delta x_{a}^{\\perp}" + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "inline_equation", + "content": "\\Delta x_{s}^{\\perp}" + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "inline_equation", + "content": "\\Delta x_{a}^{\\perp}" + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": " are randomly selected orthogonal vectors and are also bounded by the same " + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 483, + 482, + 592 + ], + "type": "text", + "content": ". In each plot, the center of the plot (cyan) represents the clean data point, and the adversarial example is highlighted using the red marker." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "We make two observations. First, the bright yellow region around the perturbations generated from the original source model suggests that they are located at sharp loss maxima. However, these same perturbations do not effectively cause a significant increase in loss when applied to the target model. This observation aligns with previous findings indicating that perturbations with poor transferability often correspond to sharp local maxima unique to the source model, which" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 187, + 179, + 428, + 232 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Comparing the " + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "inline_equation", + "content": "\\ell_2" + }, + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "-norm of the input gradient on the original source model and the aligned source model. Results are averaged over 1000 randomly selected ImageNet test samples. The norm decreases significantly when evaluated on all three types of input, suggesting that the smoothing effect induced by the alignment is more global, rather than being confined to specific cases of adversarial examples." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 187, + 179, + 428, + 232 + ], + "lines": [ + { + "bbox": [ + 187, + 179, + 428, + 232 + ], + "spans": [ + { + "bbox": [ + 187, + 179, + 428, + 232 + ], + "type": "table", + "html": "
DataResNet50VIT-B/16
OriginalAlignedOriginalAligned
Clean0.0560.0320.0600.029
Gaussian-perturbed0.0570.0320.0630.029
PGD-perturbed0.4530.1710.1840.055
", + "image_path": "ec7fc20403c3e415c128087ec8822fd955b169b63856afa6f1acdc96fbb48500.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 270, + 481, + 354 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 481, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 481, + 354 + ], + "type": "text", + "content": "are not present in the target model [16, 44]. Second, the loss surface around perturbations generated from the aligned model is noticeably flatter. This is in line with prior findings that adversarial perturbations from flatter maxima tend to be transferable [16, 44]. It is noteworthy that the PGD attack does not explicitly target flat maxima for generating adversarial examples. This observation leads us to hypothesize that the smoothing effect induced by the alignment process is more global, rather than being confined to specific cases of adversarial examples." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "spans": [ + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "text", + "content": "To verify this, we evaluate the change in the " + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "inline_equation", + "content": "\\ell_2" + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "text", + "content": "-norm of the loss gradients with respect to clean, Gaussian-perturbed " + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "inline_equation", + "content": "(\\sigma^2 = 0.01)" + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "text", + "content": ", and PGD-perturbed inputs. More formally, we compare " + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "inline_equation", + "content": "\\| \\nabla_x\\ell (x + \\varDelta x,y,\\theta)\\| _2" + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "inline_equation", + "content": "\\varDelta x\\in\\{0,\\mathrm{Gaussian},\\mathrm{PGD}\\}" + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "inline_equation", + "content": "\\theta \\in \\{\\theta_s,\\theta_a\\}" + }, + { + "bbox": [ + 130, + 356, + 481, + 405 + ], + "type": "text", + "content": " over 1000 randomly sampled ImageNet test samples." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 407, + 482, + 550 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 550 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 550 + ], + "type": "text", + "content": "The results are summarized in Tab. 1. We observe a significant decrease in gradient norm across all inputs, and the reduction is particularly pronounced at PGD-perturbed data points. This decrease is consistent with the previous finding which demonstrated a connection between the use of soft labels and the smoothing of the loss surface [4,68]. More importantly, this observation explains the improved transferability with the aligned model. In the supplementary material, we discuss additional results on the change in the largest eigenvalue of input Hessian, which is another popular metric in studying the smoothness of the loss landscape [70]. To evaluate the similarity of models, we measure the change in the KL divergence, prediction agreement, and the cosine similarity of input gradients. The latter is crucial due to its role in the attack process. These results are included in the supplementary material." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 580, + 230, + 594 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 580, + 230, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 580, + 230, + 594 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": "In this section, we present a series of experiment results to demonstrate the improved ability of a given source model to generate transferable adversarial perturbations. We study factors that can further improve the alignment process and demonstrate the compatibility of our approach with a wide range of attacks." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 101 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 253, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 253, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 253, + 129 + ], + "type": "text", + "content": "4.1 Experiment Setup" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 482, + 220 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 482, + 220 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 482, + 220 + ], + "type": "text", + "content": "Model: We consider various neural network architectures as source, witness, and target models. For CNNs, we include ResNet18 (Res18), ResNet50 (Res50), ResNet101 (Res101) [19], VGG19 [47], DenseNet121 (DN121) [22], and Inception-v3 (IncV3) [49]. For ViTs, our selection includes Swin Transformers (SWIN) [31], ViT-T/16, ViT-S/16, and ViT-B/16 [12]. We follow the optimization schedule described in the official Pytorch repository to train all models. Training and model details are included in the supplementary material." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 220, + 482, + 292 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 220, + 482, + 292 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 482, + 292 + ], + "type": "text", + "content": "Fine-tune: During alignment, all source models are fine-tuned for one epoch using SGD with a momentum of 0.9, a cosine learning rate decay, and a linear warmup. We sweep over 3 learning rates. No additional data is used, as fine-tuning relies on the same training data used to train the source and witness model. We use a batch size of 128 for CNNs and 512 for ViTs. For ViT-based models, we follow [48] and gradients are clipped at a global norm of 1." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 293, + 482, + 351 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 351 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 351 + ], + "type": "text", + "content": "Dataset: We follow previous work [10,29,64] in which evaluations are based on 1000 randomly selected from the ImageNet test set. For a given source and target model, these samples meet the following criteria: they are correctly classified by both models, and the adversarial examples, when generated from each model, lead to misclassifications in their respective originating models." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "text", + "content": "Attack method: We focus on non-targeted adversarial perturbations bounded by the " + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "text", + "content": "-norm. Unless otherwise stated, all perturbations are generated using 20 iterations of PGD with " + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "inline_equation", + "content": "\\epsilon = 4/255" + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "inline_equation", + "content": "\\alpha = 1/255" + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "text", + "content": ". All target models have an error rate of " + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "text", + "content": " under white-box PGD attacks. Results with different attack methods and larger values of " + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 352, + 482, + 411 + ], + "type": "text", + "content": " are included in the ablation study." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 412, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 412, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 412, + 482, + 495 + ], + "type": "text", + "content": "Metric: We measure transferability using the error rate, with a higher rate indicating greater transferability. In the tables of this section, we first present a row labeled 'n/a' to denote the error rate for perturbations generated by the original source model. We then demonstrate the change in transferability after alignment following the " + }, + { + "bbox": [ + 130, + 412, + 482, + 495 + ], + "type": "inline_equation", + "content": "+ / -" + }, + { + "bbox": [ + 130, + 412, + 482, + 495 + ], + "type": "text", + "content": " sign. A larger change indicates a greater increase in transferability resulting from using the aligned model. All results presented in this section are obtained from the average of three independent runs." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 514, + 376, + 526 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 514, + 376, + 526 + ], + "spans": [ + { + "bbox": [ + 132, + 514, + 376, + 526 + ], + "type": "text", + "content": "4.2 Model Alignment Improves Transferability" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 533, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 594 + ], + "type": "text", + "content": "To demonstrate the improved transferability of perturbations generated using the aligned source model, we evaluate across a diverse set of neural network architectures for both source and witness models, focusing on the transferability to an extensive array of target models. Tab. 2 shows the original error rates and their changes after using the aligned model. We make two key observations." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "First, the model alignment approach can transform any given source model into one from which the PGD attack generates more transferable perturbations. Such an improvement can be observed across various combinations of source and witness models and is evident in all evaluated target models. This clear improvement validates our approach, showing that aligning the source model can lead to the generation of more transferable adversarial perturbations. Notably," + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 180, + 479, + 453 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 481, + 170 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 481, + 170 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 481, + 170 + ], + "type": "text", + "content": "Table 2: Aligning the source model can lead to the generation of more transferable adversarial examples. The result demonstrates the increase in error rates when adversarial examples generated from aligned source models are applied to different target models. Our method improves the transferability of adversarial examples generated from a wide range of architectures, including both CNNs and ViTs." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 180, + 479, + 453 + ], + "lines": [ + { + "bbox": [ + 135, + 180, + 479, + 453 + ], + "spans": [ + { + "bbox": [ + 135, + 180, + 479, + 453 + ], + "type": "table", + "html": "
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res50+9.60+9.90+8.12+6.59+8.98+4.79+0.67+0.65+0.42+2.65
VGG19+8.30+7.88+7.41+9.17+9.93+6.76+0.75+0.52+0.17+1.97
DN121+9.39+10.82+8.40+8.41+12.41+7.21+1.87+2.02+0.38+2.61
IncV3+7.69+7.52+5.99+5.56+9.19+8.23+2.29+0.30+0.24+3.01
ViT-B/16-9.41-19.39-17.48-10.04-12.76-8.49-3.25-2.69-1.14-4.17
SWIN-9.23-16.21-14.30-7.27-10.02-5.53-2.72-2.93-2.36-2.73
VGG19n/a33.4930.1026.1379.4332.0730.6223.2719.8518.6623.09
Res50+7.19+4.16+2.76+5.19+7.62+5.91+3.45+1.20+1.36+1.12
VGG19+4.66+2.10+1.77+7.30+3.44+1.74+2.64+0.68+1.39+0.90
DN121+6.35+3.52+5.07+10.60+10.45+5.03+4.09+2.36+2.58+1.31
IncV3+4.91+1.57+1.66+3.82+4.94+4.33+2.70+0.61+0.61+1.04
ViT-B/16-4.34-5.68-5.01-24.66-5.11-3.67-0.83-0.37+0.77-2.53
SWIN-3.24-5.83-4.01-21.91-6.48-4.05-1.11-0.73+0.64-2.96
DN121n/a40.2044.0137.1540.8461.1532.2823.6820.3418.2123.56
Res50+11.67+12.96+8.37+7.32+11.68+5.41+1.69+0.46+1.00+1.59
VGG19+9.02+6.38+4.88+12.34+7.87+3.77+2.72+0.04+1.22+0.94
DN121+12.56+11.60+10.48+9.10+15.47+6.84+3.99+1.59+1.24+1.86
IncV3+8.08+10.50+9.88+9.91+12.76+7.24+3.81+1.23-0.02+2.79
ViT-B/16-3.08-8.43-7.78-6.67-12.96-1.78+2.06+1.26+1.22-2.78
SWIN-4.13-8.57-5.34-6.11-10.21-4.64+0.54-0.16+1.21-1.88
IncV3n/a30.6827.4925.0233.4730.9851.8022.9918.7717.7220.94
Res50+4.92+6.59+4.27+5.49+5.74+4.49+1.71+2.26+2.74+2.23
VGG19+4.65+2.69+3.10+5.70+3.39+4.36+1.05-0.54+0.38+0.53
DN121+4.50+6.38+2.13+7.35+6.52+8.89+3.54+0.68+1.41+1.45
IncV3+1.78+3.91+3.70+3.53+3.06+8.75+1.79+0.49+1.41+1.75
ViT-B/16+0.47-1.13-2.97-0.77-1.35-8.20+2.92+1.64+2.07-0.23
SWIN-0.49-3.36-3.85-3.29-4.54-12.82+0.09+0.76+1.13-1.34
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
Res50+17.53+12.89+12.23+14.83+16.66+15.76+43.47+37.17+29.16+21.16
VGG19+10.89+9.49+9.77+14.23+12.65+10.94+39.63+31.65+21.30+14.97
DN121+17.15+13.92+12.28+15.38+17.68+16.96+47.36+41.88+31.22+21.87
IncV3+15.41+11.87+11.31+15.09+14.23+16.46+46.07+40.39+28.87+19.92
ViT-B/16+5.14+2.04+2.07+4.79+2.87+4.53+24.04+23.14+21.93+6.34
SWIN+6.31+5.75+5.92+8.12+7.46+7.28+39.11+36.49+28.61+14.62
", + "image_path": "61a718bb852bbead1fb32502e32427ea7841fff473a2e8322320bfde08e422fd.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 485, + 480, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 480, + 533 + ], + "type": "text", + "content": "both CNN and ViT-based source models can benefit from the alignment process. Recent studies have shown that the transferability between ViTs and CNNs is poor, and many attack algorithms do not generalize well to ViTs [38,40,55]. Our model alignment method offers a promising solution to bridge this gap." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 534, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 481, + 665 + ], + "type": "text", + "content": "Second, we find that CNN-based source models generally benefit from aligning with other CNN-based models, rather than with ViT-based models. On the other hand, the ViT-B/16 source model can benefit from aligning with witness models from both CNN and ViT families. We provide a possible explanation for this phenomenon. Previous studies have shown that ViTs and CNNs learn distinctively different features [45, 72]. Specifically, Raghu et al. [45] focused on early-layer representations learned by the two models and showed that more ResNet layers are required to be modified to match hidden representations of a ViT, compared to the other way around. In the context of model alignment, this suggests an asymmetric behavior in the alignment process; namely, it might be easier to align ViTs with CNNs than to align CNNs with ViTs." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "Choosing the witness model: The main goal of Tab. 2 is to demonstrate that the improved transferability is not limited to particular choices of witness models. The result also highlights the effectiveness of a straightforward, hyper-parameter-free self-alignment strategy. This is evident from the consistent improvement observed when the source and witness models share the same architecture, but are initialized and trained independently. The selection of witness models is further explored in our ablation studies." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 202, + 482, + 321 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 202, + 482, + 321 + ], + "spans": [ + { + "bbox": [ + 130, + 202, + 482, + 321 + ], + "type": "text", + "content": "Regularization to prevent overfitting: A prolonged alignment process may inadvertently cause overfitting to the witness model, thereby diminishing the gains in transferability. To counteract overfitting, regularization methods can be implemented. For example, we apply early stopping and limit the alignment to a single epoch. Moreover, an ensemble of witnesses can be used to avert overfitting to any singular witness model. Results with multiple witness models are included in the supplementary material. Furthermore, when aligning by minimizing KL divergence, adjusting the temperature scaling within the softmax function can be an effective measure to prevent the exact replication of the witness model's predictions by the source model." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 346, + 246, + 358 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 346, + 246, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 346, + 246, + 358 + ], + "type": "text", + "content": "4.3 Ablation Studies" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 373, + 481, + 410 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 373, + 481, + 410 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 481, + 410 + ], + "type": "text", + "content": "We conduct several ablation studies to investigate factors that could further improve the alignment process. Additionally, we demonstrate that our approach is compatible with a wide range of attack algorithms." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 434, + 482, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 482, + 530 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 482, + 530 + ], + "type": "text", + "content": "Smaller Witness Model Might Boost Learning Shared Features. Results in Tab. 2 indicate that DN121, which has the fewest parameters, frequently emerges as a more effective witness model. This motivates us to investigate the role of the capacity of the witness model during the alignment. While several factors contribute to a model's capacity, such as its structure, the normalization techniques, and its non-linear activations, our study primarily focuses on the number of parameters as a proxy for capacity. With this in mind, we consider three models each from the ResNet and ViT families." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 533, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 592 + ], + "type": "text", + "content": "Tab. 3 summarizes the results of the model capacity analysis, pointing to one key observation. Model alignment is more effective when the witness models have a smaller model capacity. For instance, when using Res101 as the source model, alignment with the lower capacity Res18 as the witness model is more beneficial than alignment with Res50. This matches the previous findings in Tab. 2." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "We provide one interpretation of this observation. Smaller models might tend to focus more on learning semantic features for generalization, as they lack the capacity of larger models to learn imperceptible features. Therefore, when a source model is aligned with a smaller model, it is steered towards learning more semantic features that are commonly shared across different models, thereby leading to more transferable perturbations." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 158, + 477, + 308 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "type": "text", + "content": "Table 3: Analyzing the impact of witness model capacity on the alignment process. We observe a greater improvement in the transferability of adversarial perturbations when the source model is aligned with witness models of smaller capacity." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 158, + 477, + 308 + ], + "lines": [ + { + "bbox": [ + 136, + 158, + 477, + 308 + ], + "spans": [ + { + "bbox": [ + 136, + 158, + 477, + 308 + ], + "type": "table", + "html": "
SourceWitnessTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res18n/a64.1045.8537.0942.9648.5737.3127.5221.1220.5721.31
Res50-1.94+0.41-0.74+0.82-1.24-1.78+0.26+1.33+0.42+1.48
Res101-5.13-3.92-2.70-1.75-1.39-0.22+0.53+0.25+0.03+0.48
Res50n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
Res18+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
Res101+4.27+3.02+3.93+3.61+4.41+3.60+1.86-0.54+0.14+1.36
Res101n/a38.8454.6362.9539.2449.9334.7723.0120.1219.0722.90
Res18+40.64+35.11+27.78+29.63+33.20+28.42+10.10+5.70+2.37+13.99
Res50+14.97+19.56+16.97+13.50+17.07+10.41+4.04+0.98+1.44+4.81
ViT-T/16n/a28.7723.4521.0525.4125.4525.2263.8940.4729.6222.97
ViT-S/16+0.30+0.70+1.02+2.76+0.54+0.69+7.01+3.77+2.92+0.42
ViT-B/16+0.86-0.18-1.11+1.15+0.47+0.81+5.09+4.32+3.55-1.57
ViT-S/16n/a24.2720.4818.8621.8521.9022.9647.3452.0943.8523.87
ViT-T/16+9.64+6.65+6.29+8.51+10.66+7.58+40.53+32.27+26.10+12.35
ViT-B/16+3.10+1.21+2.87+3.75+3.19+3.36+19.07+17.44+13.81+4.73
ViT-B/16n/a23.0519.6718.3021.8321.9621.5236.4444.5851.2721.22
ViT-T/16+10.13+9.71+8.42+10.71+11.30+9.89+51.72+44.99+34.69+20.01
ViT-S/16+7.30+4.57+4.53+4.75+6.21+6.34+36.47+35.66+29.43+12.00
", + "image_path": "f8efd4e635b4204b33bc92edb1fab858d4946fc5d8af67b98aa9b1247048884c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 387, + 477, + 471 + ], + "blocks": [ + { + "bbox": [ + 132, + 333, + 480, + 376 + ], + "lines": [ + { + "bbox": [ + 132, + 333, + 480, + 376 + ], + "spans": [ + { + "bbox": [ + 132, + 333, + 480, + 376 + ], + "type": "text", + "content": "Table 4: Improving transferability via embedding-space alignment. We focus on Res50 as the source model and Res18 as the witness model. We observe improved transferability when alignment is performed in the embedding space or when combining output and embedding spaces." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 387, + 477, + 471 + ], + "lines": [ + { + "bbox": [ + 135, + 387, + 477, + 471 + ], + "spans": [ + { + "bbox": [ + 135, + 387, + 477, + 471 + ], + "type": "table", + "html": "
MethodTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
n/a44.5261.5153.0143.4750.5936.0525.5821.5418.8622.65
KL+35.30+26.56+25.20+24.38+27.86+19.18+5.49+2.85+1.61+9.60
TV+26.04+19.91+11.88+17.40+20.66+15.93+5.70+1.72+0.85+5.79
RKD [41]+2.95+2.12+2.80+2.78+3.35+4.09-1.26-0.53-0.36+0.21
HINT [46]+5.95+6.55+5.27+5.43+9.54+4.34+2.55-0.01+1.24+2.58
EGA [36]+35.35+23.56+27.09+24.69+28.94+22.00+10.12+4.62+3.80+10.37
NCE [6]+21.51+19.25+20.39+16.06+19.70+13.29+6.78+3.38+1.06+6.73
KL+EGA+35.74+26.10+23.23+28.90+29.59+20.06+8.62+3.81+1.81+14.05
KL+NCE+31.35+24.46+20.12+22.62+27.14+19.06+8.48+1.50+2.36+12.18
", + "image_path": "2917394146af1c1e9271cf0438a3ffb168a4588bed739a0799ea44a8d4beb620.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "content": "Alignment in the Embedding Space Can Further Improve Transferability. Recent advances in knowledge distillation highlight the benefits of aligning intermediate representations over aligning outputs [6,36,41]. Motivated by this, we investigate aligning the hidden representations of a Res50 source model with a Res18 witness model. We set " + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "inline_equation", + "content": "q" + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "content": " in (1) to the layer before the fully-connected layer and evaluate four embedding-space distillation methods: Relational Knowledge Distillation (RKD) [41], Embedding Graph Alignment (EGA) [36], Intermediate-level Hints (HINT) [46] and Noise Contrastive Estimation (NCE) [6]. These methods correspond to different choices of distance metric " + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "content": " in (1). Moreover, alignment can be performed in both output and embedding spaces, requiring the optimization of a combined objective with a scaling hyper-parameter " + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "inline_equation", + "content": "(\\lambda)" + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "content": ": " + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "inline_equation", + "content": "d_q(z_s^{[q]}(x),z_w^{[q]}(x)) + \\lambda d_p(z_s^{[p]}(x),z_w^{[p]}(x))" + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "inline_equation", + "content": "p < q = l" + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "content": ". In our experiment, we combine KL with EGA and NCE " + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "inline_equation", + "content": "(\\lambda = 1)" + }, + { + "bbox": [ + 132, + 508, + 481, + 665 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 191, + 480, + 312 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "text", + "content": "Table 5: Compatibility of model alignment with different attack algorithms. The Res50 and ViT-B/16 source models are aligned with a Res18 and ViT-T/16 witness model, respectively. Each entry begins with the error rate for perturbations generated by the original source model. Then, this is followed by the change in the error rate after model alignment. The results demonstrate that the model alignment process enhances the effectiveness of all attack algorithms." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 191, + 480, + 312 + ], + "lines": [ + { + "bbox": [ + 136, + 191, + 480, + 312 + ], + "spans": [ + { + "bbox": [ + 136, + 191, + 480, + 312 + ], + "type": "table", + "html": "
SourceAttackTarget
Res18VGG19DN121IncV3ViT-B/16SWIN
Res50MI [10]75.54 + 20.2371.46 + 19.9779.60 + 16.3159.08 + 22.2225.19 + 7.8737.04 + 16.02
NI [29]59.71 + 21.9956.30 + 19.1459.56 + 19.9046.45 + 15.5926.66 + 3.6228.62 + 8.41
VMI [53]85.26 + 12.7083.16 + 13.1388.09 + 9.7271.98 + 16.6829.62 + 8.3249.13 + 15.45
VNI [53]86.92 + 11.1885.64 + 11.3690.47 + 8.2173.60 + 16.4029.15 + 8.5846.64 + 16.75
SINI [29]67.43 + 17.0561.73 + 11.8765.82 + 13.3453.74 + 11.9626.07 + 3.0330.59 + 5.29
TI [11]71.31 + 21.6764.87 + 20.1373.95 + 16.8553.13 + 19.1825.58 + 7.5930.00 + 11.71
DI [61]87.95 + 11.0382.12 + 15.8890.02 + 9.4077.78 + 15.4527.48 + 8.6943.20 + 21.83
ViT-B/16MI [10]33.73 + 15.6035.24 + 12.0632.29 + 13.5133.97 + 11.8571.48 + 24.1333.57 + 20.87
NI [29]35.10 + 6.9335.58 + 4.5831.93 + 7.4433.67 + 5.7053.55 + 17.7330.69 + 8.60
VMI [53]35.59 + 18.6537.82 + 14.7234.55 + 16.1234.42 + 15.1577.20 + 19.1437.63 + 21.75
VNI [53]33.99 + 22.4537.19 + 17.1632.59 + 19.9233.19 + 20.8380.07 + 17.4438.19 + 21.89
SINI [29]36.68 + 11.4036.56 + 7.4933.12 + 9.6335.87 + 9.7062.07 + 9.9733.02 + 10.26
TI [11]36.85 + 29.9632.74 + 24.0535.48 + 25.9832.99 + 21.3167.16 + 27.2332.50 + 25.52
DI [61]41.75 + 30.7939.03 + 30.4241.40 + 26.6938.62 + 30.5184.10 + 13.7042.09 + 29.79
", + "image_path": "43d0973a7b78b164d095e1a87d52d8ddd949f2943fb9828e36de7a8a151ff924.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 374, + 481, + 437 + ], + "blocks": [ + { + "bbox": [ + 130, + 331, + 482, + 365 + ], + "lines": [ + { + "bbox": [ + 130, + 331, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 482, + 365 + ], + "type": "text", + "content": "Table 6: Improved transferability from using aligned models alone or in an ensemble. Perturbations from the aligned model (Res50*) demonstrate higher transferability compared to those from an ensemble of source and witness models." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 374, + 481, + 437 + ], + "lines": [ + { + "bbox": [ + 133, + 374, + 481, + 437 + ], + "spans": [ + { + "bbox": [ + 133, + 374, + 481, + 437 + ], + "type": "table", + "html": "
SourceTarget
Res18Res50Res101VGG19DN121IncV3ViT-T/16ViT-S/16ViT-B/16SWIN
Res1887.5367.41152.07458.8567.1250.2231.8824.6519.1630.91
Res5066.9785.0272.1464.8875.8949.5632.1425.2322.5828.96
Res50*92.0395.7389.8690.6092.5171.4244.1233.2425.5149.12
Res50 + Res18 [10]91.2591.5680.6075.9085.3660.1119.0115.9510.9027.10
2×Res50* [10]98.7099.4498.3296.0998.7184.6538.9825.7115.4257.30
2×(Res50 + Res18) [10]97.6998.7396.8192.9598.3278.6123.8718.0612.2541.77
", + "image_path": "f65ec502b0a9712547bfe7d12b4b75fb73cf6ba1a96a190940967f882d87df7b.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 468, + 482, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 541 + ], + "type": "text", + "content": "The results are summarized in Tab. 4, where we also supplement the previous KL-based results with total variation (TV). These results demonstrate improved transferability with other alignment formulations, including both embedding-space and output-embedding-space alignment. These promising findings pave the way for further exploration of embedding-space model alignment to improve adversarial transferability.." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": "Model Alignment is Compatible with Other Transfer-enhancing Methods. To demonstrate that model alignment is compatible with a wide range of attack algorithms, we extend our analysis to include additional transfer-enhancing attacks. This includes optimization-based methods such as MI-FGSM [10], NIFGSM/SINI-FGSM [29] and VMI-FGSM/VNI-FGSM [53]. We also include data-augmentation-based methods such as TI-FGSM [11] and DI-FGSM [61]. Moreover, we consider a larger " + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\ell_{\\infty}" + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": "-norm constraint of " + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\epsilon = 8/255" + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": " with a step size of " + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\alpha = 2/255" + }, + { + "bbox": [ + 130, + 557, + 482, + 666 + ], + "type": "text", + "content": ", and double the number of iterations to 40. The results are summarized in Tab. 5. Each entry begins with the error rate for perturbations generated" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "by the original source model. Then, this is followed by the change in the error rate after model alignment. We observe that all considered attack algorithms can leverage the aligned source model to improve transferability." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 154, + 480, + 239 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 154, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 130, + 154, + 480, + 239 + ], + "type": "text", + "content": "Model-modification attacks: In addition to the attacks included in the table, we show that model alignment can be integrated with LinBP [17] and BPA [60], two model-modification-based methods. We compare the transferability of MI-FGSM-LinBP and PGD-BPA perturbations from the aligned Res50 to those from the original, unaligned Res50. We observe increased transferability across all target models, with an average increase of " + }, + { + "bbox": [ + 130, + 154, + 480, + 239 + ], + "type": "inline_equation", + "content": "9.66\\%" + }, + { + "bbox": [ + 130, + 154, + 480, + 239 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 154, + 480, + 239 + ], + "type": "inline_equation", + "content": "16.86\\%" + }, + { + "bbox": [ + 130, + 154, + 480, + 239 + ], + "type": "text", + "content": ", respectively. These results are included in the supplementary material." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 239, + 481, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 239, + 481, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 239, + 481, + 348 + ], + "type": "text", + "content": "**Ensemble attacks:** Given that an additional witness model is involved in the attack process, it is important to compare perturbations produced by an aligned model with those generated by an ensemble of the original source and witness model. In Tab. 6, we first demonstrate transferability using the original Res18 and Res50, followed by a Res50 aligned with Res18 (Res50*). Next, we incorporate the ensemble in logits scheme [10] into the PGD attack, and consider three scenarios: an ensemble of the source and witness models (Res50+Res18), an ensemble of two aligned models " + }, + { + "bbox": [ + 130, + 239, + 481, + 348 + ], + "type": "inline_equation", + "content": "(2 \\times \\text{Res50}^*)" + }, + { + "bbox": [ + 130, + 239, + 481, + 348 + ], + "type": "text", + "content": ", and an ensemble of two pairs of source-witness models " + }, + { + "bbox": [ + 130, + 239, + 481, + 348 + ], + "type": "inline_equation", + "content": "(2 \\times (\\text{Res50} + \\text{Res18}))" + }, + { + "bbox": [ + 130, + 239, + 481, + 348 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 350, + 482, + 469 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 469 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 469 + ], + "type": "text", + "content": "We make two observations. First, perturbations from a single aligned model demonstrate higher transferability compared to those from an ensemble of source and witness models, and an ensemble of two aligned models not only further improves transferability but also surpasses the performance of the four-model ensemble. Beyond the improved transferability, model alignment brings the added benefits of faster inference times and lower memory requirements, presenting a significant advantage over conventional ensemble approaches. Second, when targeting ViTs, perturbations generated from ResNet ensembles exhibit limited transferability. This observation is in line with the previous result [35], underscoring the specific challenges in transferring attacks between different architectures." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 498, + 225, + 510 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 225, + 510 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 225, + 510 + ], + "type": "text", + "content": "5 Conclusions" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 665 + ], + "type": "text", + "content": "In this paper, we proposed model alignment as a novel perspective in improving the transferability of adversarial examples. During alignment, the parameters of the source model are fine-tuned to minimize an alignment loss which measures the divergence in the predictions between the source and the witness model. We conduct a geometric analysis to study the changes in the loss landscape resulting from this process to better understand the underlying effect of model alignment. Extensive experiments on the ImageNet dataset demonstrate that perturbations generated from aligned source models exhibit significantly higher transferability than those from the original source model. A limitation of our study is the absence of a theoretical framework to understand the model alignment process, and we consider it as future work." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 260 + ], + "type": "text", + "content": "Acknowledgments. Avery Ma acknowledges the funding from the Natural Sciences and Engineering Research Council (NSERC) through the Canada Graduate Scholarships - Doctoral (CGS D) program. Amir-massoud Farahmand acknowledges the funding from the CIFAR AI Chairs program, as well as the support of the NSERC through the Discovery Grant program (2021-03701). Yangchen Pan, Philip Torr and Jindong Gu acknowledge the support from the UKRI Grant: Turing AI Fellowship EP/W002981/1, EPSRC/MURI Grant: EP/N019474/, and the Royal Academy of Engineering. Resources used in preparing this research were provided, in part, by the Province of Ontario, the Government of Canada through CIFAR, and companies sponsoring the Vector Institute. We would like to also thank the members of the Adaptive Agents Lab who provided feedback on a draft of this paper." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 281, + 197, + 293 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 197, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 197, + 293 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 308, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 136, + 308, + 480, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 308, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 136, + 308, + 480, + 331 + ], + "type": "text", + "content": "1. Ahmed, N., Natarajan, T., Rao, K.R.: Discrete cosine transform. In: IEEE transactions on Computers (1974)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 136, + 331, + 481, + 364 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 331, + 481, + 364 + ], + "spans": [ + { + "bbox": [ + 136, + 331, + 481, + 364 + ], + "type": "text", + "content": "2. Benz, P., Zhang, C., Kweon, I.S.: Batch normalization increases adversarial vulnerability and decreases adversarial transferability: A non-robust feature perspective. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 136, + 365, + 481, + 408 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 365, + 481, + 408 + ], + "spans": [ + { + "bbox": [ + 136, + 365, + 481, + 408 + ], + "type": "text", + "content": "3. Byun, J., Cho, S., Kwon, M.J., Kim, H.S., Kim, C.: Improving the transferability of targeted adversarial examples through object-based diverse input. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 136, + 409, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 409, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 136, + 409, + 481, + 430 + ], + "type": "text", + "content": "4. Carratino, L., Cissé, M., Jenatton, R., Vert, J.P.: On mixup regularization. Journal of Machine Learning Research (JMLR) (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 136, + 431, + 481, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 431, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 136, + 431, + 481, + 464 + ], + "type": "text", + "content": "5. Charles, Z., Rosenberg, H., Papailiopoulos, D.: A geometric perspective on the transferability of adversarial directions. In: International Conference on Artificial Intelligence and Statistics (AISTATS) (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 136, + 465, + 481, + 498 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 465, + 481, + 498 + ], + "spans": [ + { + "bbox": [ + 136, + 465, + 481, + 498 + ], + "type": "text", + "content": "6. Chen, Y., Xian, Y., Koepke, A., Shan, Y., Akata, Z.: Distilling audio-visual knowledge by compositional contrastive learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 136, + 498, + 481, + 532 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 498, + 481, + 532 + ], + "spans": [ + { + "bbox": [ + 136, + 498, + 481, + 532 + ], + "type": "text", + "content": "7. Cheng, H., Xiao, E., Cao, J., Yang, L., Xu, K., Gu, J., Xu, R.: Typography leads semantic diversifying: Amplifying adversarial transferability across multimodal large language models. arXiv preprint arXiv:2405.20090 (2024)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 136, + 532, + 481, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 532, + 481, + 564 + ], + "spans": [ + { + "bbox": [ + 136, + 532, + 481, + 564 + ], + "type": "text", + "content": "8. Cubuk, E.D., Zoph, B., Mane, D., Vasudevan, V., Le, Q.: AutoAugment: Learning augmentation strategies from data. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 136, + 565, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 565, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 136, + 565, + 481, + 599 + ], + "type": "text", + "content": "9. Deng, Y., Zheng, X., Zhang, T., Chen, C., Lou, G., Kim, M.: An analysis of adversarial attacks and defenses on autonomous driving models. In: IEEE International Conference on Pervasive Computing and Communications (PerCom) (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 599, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 599, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 133, + 599, + 481, + 632 + ], + "type": "text", + "content": "10. Dong, Y., Liao, F., Pang, T., Su, H., Zhu, J., Hu, X., Li, J.: Boosting adversarial attacks with momentum. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 632, + 481, + 666 + ], + "type": "text", + "content": "11. Dong, Y., Pang, T., Su, H., Zhu, J.: Evading defenses to transferable adversarial examples by translation-invariant attacks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (ICLR) (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 162, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 162, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 132, + 162, + 481, + 184 + ], + "type": "text", + "content": "13. Fawzi, A., Moosavi-Dezfooli, S.M., Frossard, P.: The robustness of deep networks: A geometrical perspective. In: IEEE Signal Processing Magazine (2017)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 185, + 481, + 206 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 185, + 481, + 206 + ], + "spans": [ + { + "bbox": [ + 133, + 185, + 481, + 206 + ], + "type": "text", + "content": "14. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: International Conference on Learning Representations (ICLR) (2015)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 207, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 207, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 134, + 207, + 481, + 251 + ], + "type": "text", + "content": "15. Gu, J., Jia, X., de Jorge, P., Yu, W., Liu, X., Ma, A., Xun, Y., Hu, A., Khakzar, A., Li, Z., Cao, X., Torr, P.: A survey on transferability of adversarial examples across deep neural networks. Transactions on Machine Learning Research (TMLR) (2024)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 134, + 251, + 481, + 284 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 251, + 481, + 284 + ], + "spans": [ + { + "bbox": [ + 134, + 251, + 481, + 284 + ], + "type": "text", + "content": "16. Gubri, M., Cordy, M., Papadakis, M., Traon, Y.L., Sen, K.: Lgv: Boosting adversarial example transferability from large geometric vicinity. In: Proceedings of the European Conference on Computer Vision (ECCV) (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 285, + 481, + 318 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 285, + 481, + 318 + ], + "spans": [ + { + "bbox": [ + 134, + 285, + 481, + 318 + ], + "type": "text", + "content": "17. Guo, Y., Li, Q., Chen, H.: Backpropagating linearly improves transferability of adversarial examples. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 134, + 319, + 481, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 319, + 481, + 352 + ], + "spans": [ + { + "bbox": [ + 134, + 319, + 481, + 352 + ], + "type": "text", + "content": "18. Han, D., Jia, X., Bai, Y., Gu, J., Liu, Y., Cao, X.: OT-Attack: Enhancing adversarial transferability of vision-language models via optimal transport optimization. arXiv preprint arXiv:2312.04403 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 352, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 352, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 134, + 352, + 481, + 374 + ], + "type": "text", + "content": "19. He, K., Zhang, X., Ren, S., Sun, J.: Identity mappings in deep residual networks. In: Proceedings of the European Conference on Computer Vision (ECCV) (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 134, + 375, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 375, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 134, + 375, + 481, + 407 + ], + "type": "text", + "content": "20. He, T., Zhang, Z., Zhang, H., Zhang, Z., Xie, J., Li, M.: Bag of tricks for image classification with convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 134, + 408, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 408, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 134, + 408, + 481, + 430 + ], + "type": "text", + "content": "21. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 134, + 431, + 481, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 431, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 134, + 431, + 481, + 464 + ], + "type": "text", + "content": "22. Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 134, + 465, + 481, + 497 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 465, + 481, + 497 + ], + "spans": [ + { + "bbox": [ + 134, + 465, + 481, + 497 + ], + "type": "text", + "content": "23. Ilyas, A., Santurkar, S., Tsipras, D., Engstrom, L., Tran, B., Madry, A.: Adversarial examples are not bugs, they are features. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 498, + 481, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 498, + 481, + 531 + ], + "spans": [ + { + "bbox": [ + 134, + 498, + 481, + 531 + ], + "type": "text", + "content": "24. Ioffe, S., Szegedy, C.: Batch normalization: Accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning (ICML) (2015)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 532, + 481, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 532, + 481, + 564 + ], + "spans": [ + { + "bbox": [ + 134, + 532, + 481, + 564 + ], + "type": "text", + "content": "25. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Advances in Neural Information Processing Systems (NeurIPS) (2012)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 565, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 565, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 134, + 565, + 481, + 597 + ], + "type": "text", + "content": "26. Li, Q., Guo, Y., Zuo, W., Chen, H.: Making substitute models more bayesian can enhance transferability of adversarial examples. In: International Conference on Learning Representations (ICLR) (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 599, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 599, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 599, + 481, + 632 + ], + "type": "text", + "content": "27. Li, Y., Bai, S., Xie, C., Liao, Z., Shen, X., Yuille, A.: Regional homogeneity: Towards learning transferable universal adversarial perturbations against defenses. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 632, + 481, + 665 + ], + "type": "text", + "content": "28. Li, Z., Shi, C., Xie, Y., Liu, J., Yuan, B., Chen, Y.: Practical adversarial attacks against speaker recognition systems. In: Proceedings of the 21st International Workshop on Mobile Computing Systems and Applications (2020)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 149 + ], + "type": "text", + "content": "29. Lin, J., Song, C., He, K., Wang, L., Hopcroft, J.E.: Nesterov accelerated gradient and scale invariance for adversarial attacks. In: International Conference on Learning Representations (ICLR) (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 480, + 183 + ], + "type": "text", + "content": "30. Liu, Y., Chen, X., Liu, C., Song, D.: Delving into transferable adversarial examples and black-box attacks. In: International Conference on Learning Representations (ICLR) (2016)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 480, + 226 + ], + "type": "text", + "content": "31. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 480, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 480, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 480, + 259 + ], + "type": "text", + "content": "32. Luo, H., Gu, J., Liu, F., Torr, P.: An image is worth 1000 lies: Transferability of adversarial images across prompts on vision-language models. In: International Conference on Learning Representations (ICLR) (2024)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "text", + "content": "33. Ma, A., Dvornik, N., Zhang, R., Pishdad, L., Derpanis, K.G., Fazly, A.: SAGE: Saliency-guided mixup with optimal rearrangements. In: British Machine Vision Conference (BMVC) (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 480, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 326 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 326 + ], + "type": "text", + "content": "34. Ma, A., Pan, Y., Farahmand, A.m.: Understanding the robustness difference between stochastic gradient descent and adaptive gradient methods. Transactions on Machine Learning Research (TMLR) (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 326, + 480, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 480, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 480, + 358 + ], + "type": "text", + "content": "35. Ma, W., Li, Y., Jia, X., Xu, W.: Transferable adversarial attack for both vision transformers and convolutional networks via momentum integrated gradients. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 358, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 480, + 391 + ], + "type": "text", + "content": "36. Ma, Y., Chen, Y., Akata, Z.: Distilling knowledge from self-supervised teacher by embedding graph alignment. In: British Machine Vision Conference (BMVC) (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 480, + 424 + ], + "type": "text", + "content": "37. Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: International Conference on Learning Representations (ICLR) (2018)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "type": "text", + "content": "38. Mahmood, K., Mahmood, R., Van Dijk, M.: On the robustness of vision transformers to adversarial examples. In: Proceedings of the International Conference on Computer Vision (ICCV) (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 456, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 480, + 479 + ], + "type": "text", + "content": "39. Müller, R., Kornblith, S., Hinton, G.E.: When does label smoothing help? In: Advances in Neural Information Processing Systems (NeurIPS) (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "type": "text", + "content": "40. Naseer, M., Ranasinghe, K., Khan, S., Khan, F.S., Porikli, F.: On improving adversarial transferability of vision transformers. In: International Conference on Learning Representations (ICLR) (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "type": "text", + "content": "41. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 545, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 480, + 567 + ], + "type": "text", + "content": "42. Qayyum, A., Qadir, J., Bilal, M., Al-Fuqaha, A.: Secure and robust machine learning for healthcare: A survey. In: IEEE Reviews in Biomedical Engineering (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 567, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 480, + 600 + ], + "type": "text", + "content": "43. Qian, Y., He, S., Zhao, C., Sha, J., Wang, W., Wang, B.: Lea2: A lightweight ensemble adversarial attack via non-overlapping vulnerable frequency regions. In: Proceedings of the International Conference on Computer Vision (ICCV) (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 600, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 600, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 600, + 480, + 632 + ], + "type": "text", + "content": "44. Qin, Z., Fan, Y., Liu, Y., Shen, L., Zhang, Y., Wang, J., Wu, B.: Boosting the transferability of adversarial attacks with reverse adversarial perturbation. In: Advances in Neural Information Processing Systems (NeurIPS) (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 666 + ], + "type": "text", + "content": "45. Raghu, M., Unterthiner, T., Kornblith, S., Zhang, C., Dosovitskiy, A.: Do vision transformers see like convolutional neural networks? In: Advances in Neural Information Processing Systems (NeurIPS) (2021)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "46. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "type": "text", + "content": "47. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. In: International Conference on Learning Representations (ICLR) (2015)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 173, + 480, + 206 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 173, + 480, + 206 + ], + "spans": [ + { + "bbox": [ + 132, + 173, + 480, + 206 + ], + "type": "text", + "content": "48. Steiner, A., Kolesnikov, A., Zhai, X., Wightman, R., Uszkoreit, J., Beyer, L.: How to train your vit? data, augmentation, and regularization in vision transformers. Transactions on Machine Learning Research (TMLR) (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 207, + 480, + 239 + ], + "type": "text", + "content": "49. Szegedy, C., Vanhoucke, V., Ioffe, S., Shlens, J., Wojna, Z.: Rethinking the inception architecture for computer vision. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 240, + 480, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 240, + 480, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 240, + 480, + 274 + ], + "type": "text", + "content": "50. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. In: International Conference on Learning Representations (ICLR) (2014)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 274, + 480, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 480, + 308 + ], + "type": "text", + "content": "51. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold Mixup: Better representations by interpolating hidden states. In: International Conference on Learning Representations (ICLR) (2019)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 308, + 480, + 341 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 480, + 341 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 480, + 341 + ], + "type": "text", + "content": "52. Wang, H., Wu, X., Huang, Z., Xing, E.P.: High-frequency component helps explain the generalization of convolutional neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 342, + 480, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 342, + 480, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 342, + 480, + 374 + ], + "type": "text", + "content": "53. Wang, X., He, K.: Enhancing the transferability of adversarial attacks through variance tuning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 375, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 375, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 375, + 480, + 418 + ], + "type": "text", + "content": "54. Waseda, F., Nishikawa, S., Le, T.N., Nguyen, H.H., Echizen, I.: Closer look at the transferability of adversarial examples: How they fool different models differently. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 419, + 480, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 419, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 419, + 480, + 453 + ], + "type": "text", + "content": "55. Wei, Z., Chen, J., Goldblum, M., Wu, Z., Goldstein, T., Jiang, Y.G.: Towards transferable adversarial attacks on vision transformers. In: AAAI Conference on Artificial Intelligence (AAAI) (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 453, + 480, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 480, + 486 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 480, + 486 + ], + "type": "text", + "content": "56. Wu, D., Wang, Y., Xia, S.T., Bailey, J., Ma, X.: Skip connections matter: On the transferability of adversarial examples generated with resnets. In: International Conference on Learning Representations (ICLR) (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 487, + 480, + 518 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 480, + 518 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 480, + 518 + ], + "type": "text", + "content": "57. Wu, L., Zhu, Z.: Towards understanding and improving the transferability of adversarial examples in deep neural networks. In: Asian Conference on Machine Learning (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 520, + 480, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 520, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 132, + 520, + 480, + 553 + ], + "type": "text", + "content": "58. Wu, W., Su, Y., Lyu, M.R., King, I.: Improving the transferability of adversarial samples with adversarial transformations. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 554, + 480, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 480, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 480, + 597 + ], + "type": "text", + "content": "59. Xiao, Z., Gao, X., Fu, C., Dong, Y., Gao, W., Zhang, X., Zhou, J., Zhu, J.: Improving transferability of adversarial patches on face recognition with generative models. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 480, + 632 + ], + "type": "text", + "content": "60. Xiaosen, W., Tong, K., He, K.: Rethinking the backward propagation for adversarial transferability. In: Advances in Neural Information Processing Systems (NeurIPS) (2024)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "text", + "content": "61. Xie, C., Zhang, Z., Zhou, Y., Bai, S., Wang, J., Ren, Z., Yuille, A.L.: Improving transferability of adversarial examples with input diversity. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 217, + 100 + ], + "type": "text", + "content": "A. Ma et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 567 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "text", + "content": "62. Xiong, Y., Lin, J., Zhang, M., Hopcroft, J.E., He, K.: Stochastic variance reduced ensemble adversarial attack for boosting the adversarial transferability. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 130, + 161, + 481, + 194 + ], + "type": "text", + "content": "63. Yin, D., Gontijo Lopes, R., Shlens, J., Cubuk, E.D., Gilmer, J.: A Fourier perspective on model robustness in computer vision. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "text", + "content": "64. Yu, W., Gu, J., Li, Z., Torr, P.: Reliable evaluation of adversarial transferability. arXiv preprint arXiv:2306.08565 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 248 + ], + "type": "text", + "content": "65. Yun, S., Han, D., Oh, S.J., Chun, S., Choe, J., Yoo, Y.: CutMix: Regularization strategy to train strong classifiers with localizable features. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "text", + "content": "66. Zhang, C., Benz, P., Karjauv, A., Cho, J.W., Zhang, K., Kweon, I.S.: Investigating top-k white-box and transferable black-box attack. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 282, + 481, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 481, + 313 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 481, + 313 + ], + "type": "text", + "content": "67. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: Mixup: Beyond empirical risk minimization. In: International Conference on Learning Representations (ICLR) (2018)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "type": "text", + "content": "68. Zhang, L., Deng, Z., Kawaguchi, K., Ghorbani, A., Zou, J.: How does mixup help with robustness and generalization? In: International Conference on Learning Representations (ICLR) (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "type": "text", + "content": "69. Zhang, Y., Hu, S., Zhang, L.Y., Shi, J., Li, M., Liu, X., Wan, W., Jin, H.: Why does little robustness help? a further step towards understanding adversarial transferability. In: Proceedings of the IEEE Symposium on Security and Privacy (SP) (2024)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 391, + 481, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 391, + 481, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 391, + 481, + 423 + ], + "type": "text", + "content": "70. Zhao, P., Chen, P.Y., Das, P., Ramamurthy, K.N., Lin, X.: Bridging mode connectivity in loss landscapes and adversarial robustness. In: International Conference on Learning Representations (ICLR) (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "text", + "content": "71. Zhao, Z., Liu, Z., Larson, M.: On success and simplicity: A second look at transferable targeted attacks. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 456, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 481, + 490 + ], + "type": "text", + "content": "72. Zhou, D., Yu, Z., Xie, E., Xiao, C., Anandkumar, A., Feng, J., Alvarez, J.M.: Understanding the robustness in vision transformers. In: International Conference on Machine Learning (ICML) (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 491, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 481, + 522 + ], + "type": "text", + "content": "73. Zhu, Y., Sun, J., Li, Z.: Rethinking adversarial transferability from a data distribution perspective. In: International Conference on Learning Representations (ICLR) (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 522, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 522, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 522, + 481, + 567 + ], + "type": "text", + "content": "74. Zou, J., Pan, Z., Qiu, J., Liu, X., Rui, T., Li, W.: Improving the transferability of adversarial examples with resized-diverse-inputs, diversity-ensemble and region fitting. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Adversarial Transferability via Model Alignment" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_content_list.json b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..ed9285738c5fcce51349c9fdb8d90e9d870c9555 --- /dev/null +++ b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_content_list.json @@ -0,0 +1,1544 @@ +[ + { + "type": "text", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "text_level": 1, + "bbox": [ + 222, + 140, + 782, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zhenghao Peng $^{1*}$ , Wenjie Luo $^{2}$ , Yiren Lu $^{2}$ , Tianyi Shen $^{2}$ , Cole Gulino $^{2}$ , Ari Seff $^{2}$ , and Justin Fu $^{2}$", + "bbox": [ + 240, + 210, + 759, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ UCLA, $^{2}$ Waymo", + "bbox": [ + 441, + 253, + 563, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. A major challenge in autonomous vehicle research is modeling agent behaviors, which has critical applications including constructing realistic and reliable simulations for off-board evaluation and forecasting traffic agents motion for onboard planning. While supervised learning has shown success in modeling agents across various domains, these models can suffer from distribution shift when deployed at test-time. In this work, we improve the reliability of agent behaviors by closed-loop fine-tuning of behavior models with reinforcement learning. Our method demonstrates improved overall performance, as well as targeted metrics such as collision rate, on the Waymo Open Sim Agents challenge. Additionally, we present a novel policy evaluation benchmark to directly assess the ability of simulated agents to measure quality of autonomous vehicle planners and demonstrate the effectiveness of our approach on this new benchmark.", + "bbox": [ + 259, + 308, + 743, + 501 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Autonomous Driving $\\cdot$ Reinforcement Learning $\\cdot$ Policy Evaluation $\\cdot$ Behavior Prediction", + "bbox": [ + 261, + 515, + 746, + 542 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 570, + 375, + 585 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Transformer-based architectures have demonstrated state-of-the-art performance in a variety of tasks in language [24], vision [26], and robotics [43]. The success of these models is credited to a widely adopted \"pre-training and fine-tuning\" scheme [40]. In the pre-training phase, the model ac", + "bbox": [ + 212, + 602, + 460, + 738 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "requires knowledge from a very large amount of training data; during fine-tuning, the model behaviors are rectified to align with human preferences and expectations. While supervised learning can be used for fine-tuning, previous work has shown superior performance with reinforcement learning (RL) fine-tuning in language tasks [25] and text-to-image generation [3]. In autonomous driving", + "bbox": [ + 212, + 739, + 787, + 815 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/02bb7ed5dab7056d962be9c97cc408ce7a3870bbe900962b0e5f111a3b786b0f.jpg", + "image_caption": [ + "Fig.1: We propose to fine-tune a pre-trained motion prediction model with closed-loop reinforcement learning." + ], + "image_footnote": [], + "bbox": [ + 475, + 595, + 787, + 666 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "*Work done as an intern at Waymo.", + "bbox": [ + 230, + 824, + 475, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/bcd384eef861d32e03d78ae9190987acfd8a108336500d6a43a552d698fbdfb6.jpg", + "image_caption": [ + "Fig. 2: Left: The agent is trained from scratch using a combined Behavioral Cloning (BC) and Reinforcement Learning (RL) approach. Without pre-training on large datasets, the agent must simultaneously explore the environment and develop its capabilities from scratch. Right: The agent undergoes a two-phase training scheme. Agent acquires a foundational skill set from aligning its actions (green) with ground truth data in pre-training (gray). The fine-tuning through RL refines the agent behaviors in the autoregressive rollout." + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 787, + 266 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "(AD), given the abundance of human driving data, a natural question arises: Can we leverage the popular \"pre-training and RL fine-tuning\" strategy to effectively model agent behaviors?", + "bbox": [ + 212, + 412, + 782, + 458 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we investigate the viability of applying the \"pre-training and RL fine-tuning\" paradigm to model the behaviors of traffic agents in AD scenarios. Such models can be applied in critical AD tasks such as simulation agents (sim agents) [20], enabling high-fidelity simulation systems for off-board evaluation, and behavior prediction for surrounding traffic participants, facilitating onboard planning.", + "bbox": [ + 212, + 460, + 784, + 550 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Behavioral cloning (BC), or training an imitative model using supervised learning on demonstrations [1], has been the predominant approach for learning driving agents [5, 34]. While BC provides supervision for modeling realistic behavior, during closed-loop simulation, the agent behaviors can deviate from the training distribution, known as the \"covariate shift\" issue [27]. Moreover, BC lacks the ability to explicitly incorporate human preferences, expectations and constraints. For example, safety-critical events, such as collisions, are only implicitly discouraged in the BC loss due to their rarity in human driving datasets. In situations where a collision is likely to occur, the model may only have limited examples to learn from. RL fine-tuning can address these limitations. Firstly, RL learns from closed-loop synthetic rollouts, addressing the covariate shift problem as the reward function penalizes actions leading to future trajectories that diverge from ground-truth. Secondly, explicit objectives can be incorporated into the reward function so the agents can learn to align with human preferences and expectations.", + "bbox": [ + 212, + 551, + 785, + 777 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Inspired by the success of fine-tuning large language models to align with human preferences, we apply the \"pre-training and RL fine-tuning\" scheme to training behavior models for sim agents. As demonstrated in Fig. 1, we can fine-tune a pre-trained model via a simple on-policy RL approach with autoregressive", + "bbox": [ + 212, + 779, + 785, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "rollouts. We propose a simple reward function that not only enables the model to satisfy human preferences on the agent behaviors, but also maintains human likeness.", + "bbox": [ + 212, + 146, + 782, + 190 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our experiments on the Waymo Open Sim Agent Challenge (WOSAC) [20] demonstrate that RL fine-tuning significantly improves the reliability of the agent behaviors, especially in terms of collision avoidance. An important application of the learned behaviors is in actuating the traffic agents in AD simulation. We study the reliability of the learned models in a novel planner evaluation benchmark. The intuition is that a simulator with more realistic sim agents model should provide more reliable evaluation across ego AD planners. With this insight, we use different sim agents model to control the traffic agents and assess the performance of a predefined set of AD planners. By comparing the planners' estimated performance as evaluated by the sim agents model against their known performance ranking, we find that our fine-tuned models provide more accurate planner evaluations. This indicates that our approach is beneficial for testing autonomous driving planners. The main contributions of this work are:", + "bbox": [ + 212, + 191, + 787, + 400 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1) We propose to apply the popular \"pre-training and RL fine-tuning\" paradigm commonly used for large language models (LLMs) to the autonomous driving behavior modeling problem, demonstrating the effectiveness of closed-loop finetuning a Transformer-based architecture on the Waymo Open Motion Dataset (WOMD) [15].", + "2) We demonstrate that an on-policy RL algorithm with a simple reward function can successfully preserve the realism in the dataset while aligning human preferences on safety and reliability.", + "3) To better evaluate the performance of sim agents models, we propose a novel planner evaluation task and demonstrate that our method can significantly improve the performance of the sim agents models in terms of its capability to assess the AD planners." + ], + "bbox": [ + 214, + 402, + 792, + 583 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 214, + 604, + 387, + 619 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Pre-training and Fine-tuning of Transformer-based Models", + "text_level": 1, + "bbox": [ + 214, + 635, + 746, + 650 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Transformer-based models have been applied to various domains such as text generation [4], image generation [26], robotics [43], drug discovery [18], disease diagnose [42], and generalist medical AI [22]. Many large Transformer-based models are trained in the \"pre-training then fine-tuning\" manner, where supervised fine-tuning [40] or reinforcement learning with human feedback [25] holds the promise to align the model behaviors to human preferences. In the autonomous driving domain, similar Transformer-based architectures have been applied to various tasks, ranging from perception [19], motion prediction [23], self-driving policies [10] and simulation [31,38,39]. In this work, we focus on the motion prediction problem, where predictors forecast the future trajectories of the target agents by observing history information [23, 29, 30]. Unlike foundational models in other domains such as large language models [24] and vision", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 232, + 114, + 727, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "language models [16], motion prediction models are most commonly trained via supervised learning and rarely fine-tuned to better boost alignment with human preferences.", + "bbox": [ + 212, + 146, + 787, + 191 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Behavior Modeling for Autonomous Driving", + "text_level": 1, + "bbox": [ + 214, + 214, + 627, + 231 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Modeling the behavior of traffic participants is a critical task in many autonomous driving systems, particularly for constructing realistic simulation to test the AD planners. Most existing simulators [6,12,41] rely on hand-crafted rules for traffics and maps generation. However, the data distributions for the map structure, traffic flow, the interaction between traffic participants and other elements do not realistically represent the real world. Modern data-driven simulators [9,13,14,33] address this by replaying the behaviors of the traffic participants from real-world scenarios recorded by an autonomous vehicle (log-replay). Yet, the downside of log-replay is that re-simulation may become unrealistic when the planner behavior diverges from the original logged behavior. For example, if an AD planner is more cautious than the human driver and brakes earlier, the trailing vehicle might collide into it, leading to a false positive collision.", + "bbox": [ + 212, + 239, + 787, + 420 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this work, we mainly focus on the simulation agents task and evaluate our solutions on the Waymo Open Sim Agent Challenge (WOSAC) [20]. Many existing WOSAC submissions apply the marginal motion prediction models [2,7,29], which typically take initial states and predict the positions of traffic participants at all future steps in a single inference (one-shot). Those marginal models do not explicitly model interactions between agents during the prediction horizon. The autoregressive (AR) models naturally fit to the driving behavior modeling, especially in the context of closed-loop simulation [11,28,31,38]. AR decoding [28] allows the interactions between agents to be modeled via a self-attention mechanism at each step of the decoding process. However, closed-loop training of the AR behavior prediction models remains an understudied area. We propose to improve a pre-trained AR model with closed-loop fine-tuning and evaluate the performance on the WOSAC benchmark.", + "bbox": [ + 212, + 421, + 787, + 618 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In contrast to prior research on combining behavior cloning and reinforcement learning [17,36,37], our approach eliminates the need for an external simulator and a dynamics model. Since our model predicts actions for all agents, it functions as a simplified simulation environment itself. From an algorithmic perspective, we avoid back-propagation through time (BPTT) used in existing works [11,36]. Instead, we propose that RL can be conducted with a minimalistic policy gradient algorithm [35]. This allows us to use non-differentiable rewards (such as a boolean collision indicator) and non-differentiable models with discrete outputs which would not be possible with BPTT.", + "bbox": [ + 212, + 618, + 787, + 753 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Preliminaries", + "text_level": 1, + "bbox": [ + 214, + 777, + 382, + 792 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Motion Prediction. A driving scenario includes static information such as the map topology and dynamic information such as the states of traffic participants", + "bbox": [ + 214, + 809, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "and traffic lights. At each time step, the state of a traffic participant is represented by a feature vector containing the position, velocity, and heading angle in global frame, and the object type (vehicle, cyclist, pedestrian). For traffic lights, the feature vector contains their position and state (green, yellow, red or unknown). Given the history states of $N$ traffic participants with indices $\\mathcal{I} = [1\\ldots N]$ , the goal of motion prediction is to predict future trajectories, i.e. the positions in future steps, of these agents.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Behavior Modeling as a Multi-Agent RL Problem. We consider driving behavior modeling as a Multi-agent Markov Decision Process (Multi-agent MDP). The Multi-agent MDP is defined by the tuple $\\langle \\mathcal{I},\\mathcal{S},\\{\\mathcal{A}_i\\} ,\\mathcal{T},\\{\\mathcal{R}_i\\} ,\\Omega ,\\{\\mathcal{O}_i\\} ,\\gamma \\rangle$ where $\\mathcal{S}$ is the joint state space, $\\mathcal{A} = \\times_{i}\\mathcal{A}_{i}$ is the joint action space, the transition function is $\\mathcal{T}:S\\times \\mathcal{A}\\to S$ , the reward functions are $\\mathcal{R}_i(s_t,a_{t,i},s_{t + 1}),\\forall i\\in \\mathcal{I}$ the observation space is $\\varOmega=\\times_i\\varOmega_i$ , the observation functions $\\mathcal{O}_i$ , and the discount factor is $\\gamma$ . In this Multi-agent MDP, the goal is to learn action policies $\\pi_i:\\mathcal{A}_i\\times \\varOmega_i\\rightarrow [0,1]$ for each agent. Each agent aims to maximize its expected cumulative return: $\\pi_{i} = \\arg \\max_{\\pi}\\mathbb{E}_{\\tau \\sim P_{\\pi_{j},\\forall j\\in \\mathcal{I}}}\\left[\\sum_{t = 1}^{T_{\\mathrm{future}}}\\gamma^{t}r_{t,i}\\right]$ where $\\tau = (\\mathbf{s}_0,\\mathbf{a}_0,\\dots,\\mathbf{s}_T,a_T)$ is the joint future rollout obtained by executing the learned policy model conditioned on the initial state. Here, $\\mathbf{a}_t = \\{a_{t,i}\\}_{i\\in \\mathcal{I}}$ is the joint actions.", + "bbox": [ + 212, + 263, + 789, + 450 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Autoregressive Encoder-Decoder Architecture. We use MotionLM [28], an encoder-decoder transformer-based autoregressive motion prediction model. The model's encoder takes a set of tokens representing the initial states of the scenarios as input and generates a scene embedding. These initial states include the traffic lights states, map topology, and the history information of all traffic participants. During inference, we run the decoder for $T_{\\mathrm{pred}}$ prediction steps to autoregressively generate the prediction of all agents. At each prediction step, the decoder takes a set of motion tokens as well as the scene embedding as input and gener", + "bbox": [ + 212, + 462, + 586, + 657 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/cf17228658984bf4c87013dc8a07dd932cde85f94e188608a2027287fcdfb5a4.jpg", + "image_caption": [ + "Fig. 3: The causal mask in the decoder." + ], + "image_footnote": [], + "bbox": [ + 598, + 492, + 769, + 588 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "ates a distribution of $N$ output tokens. The decoder consists of multiple layers, each applying self-attention among input tokens and cross-attention to the scene embedding. All $N$ motion tokens at step $t$ can attend to each other and all previous tokens as shown in Fig. 3, where each row represents a query token and each column a key token and green blocks indicate key tokens that the query can attend. After running $T_{\\mathrm{pred}}$ prediction steps, the $T_{\\mathrm{pred}} \\times N$ output motion tokens form complete trajectories for $N$ agents. This autoregressive approach ensures that each agent's action is based on a temporally causal relationship with the previous actions of all traffic participants, leading to improved modeling of interaction between agents within the prediction horizon.", + "bbox": [ + 212, + 659, + 787, + 809 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We modify the original MotionLM model by adopting a scene-centric input format and predicting the motion of all agents, rather than using a pre-selected", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 232, + 113, + 727, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "subset. The scene-centric representation and the encoder-decoder architecture enable more computationally efficient encoding of the scene context and prediction of all agents' motion.", + "bbox": [ + 212, + 146, + 787, + 191 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Method", + "text_level": 1, + "bbox": [ + 215, + 215, + 330, + 233 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As shown in Algorithm 1, our method has two stages. In the pre-training stage, we reconstruct the ground truth actions from the data and use the maximum likelihood objective to match the joint action distribution of observed behaviors in the dataset:", + "bbox": [ + 212, + 250, + 784, + 306 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\max _ {\\pi_ {\\theta}} \\mathbb {E} _ {\\mathcal {D}} \\sum_ {t = 1} ^ {T _ {\\text {p r e d}}} \\sum_ {i \\in \\mathcal {I}} \\log \\pi_ {\\theta} \\left(a _ {t, i} ^ {\\mathrm {G T}} \\mid o _ {t, i}\\right). \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 306, + 785, + 349 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The second stage of our learning process fine-tunes the model using reinforcement learning (RL). We formalize the problem as a Multi-agent Markov Decision Process (MDP) for our behavior modeling task as follows:", + "bbox": [ + 212, + 356, + 782, + 400 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Action. The action space $\\mathcal{A} = \\times_{i}\\mathcal{A}_{i}$ : The action space for each agent $\\mathcal{A}_i$ is a Verlet-wrapped delta action space [28], where each action represents the X, Y acceleration in scene coordinates. To reconstruct the ground truth action targets, we first infer the accelerations by differentiating the observed positions in the data. These accelerations are then discretized into a $13\\times 13$ uniformly spaced grid, where outliers are clipped to the minimum and maximum values of $6m / s^2$ .", + "bbox": [ + 212, + 401, + 784, + 491 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "State. The state space $S$ contains map features, the joint state of all objects and traffic lights.", + "bbox": [ + 212, + 492, + 784, + 521 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Transition Dynamics. Agents transit to new positions computed by adding previous positions with an offset: $pos_{t+1,i} = (a_{t,i}\\Delta + vel_{t,i})\\Delta + pos_{t,i}$ wherein the velocity $vel_{t,i}$ and the position $pos_{t,i}$ are in $s_t$ and $\\Delta$ is the time interval between steps.", + "bbox": [ + 212, + 522, + 784, + 582 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Observation. We define observations to consist of a historic context $c$ , previous actions of all objects and the agent identity: $o_{t,i} = (c, \\mathbf{a}_1, \\dots, \\mathbf{a}_{t-1}, i)$ . Here, the context $c = (\\{m_i\\}_M, s_{T_{\\mathrm{prev}}}, \\dots, s_0)$ is a set containing $M$ map features and the object and traffic light states for history steps $t = T_{\\mathrm{prev}}, \\dots, 0$ .", + "bbox": [ + 212, + 583, + 784, + 643 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 RL Fine-tuning", + "text_level": 1, + "bbox": [ + 215, + 666, + 393, + 681 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We propose to fine-tune a pre-trained autoregressive motion predictor with RL. The reward function for each agent at each step is defined as:", + "bbox": [ + 212, + 693, + 782, + 723 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nr _ {t, i} = - \\left\\| P o s _ {t, i} - G T _ {t, i} \\right\\| _ {2} - \\lambda C o l l _ {t, i}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 737, + 785, + 753 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $Post_{t,i}$ is the position of agent $i$ in step $t$ and $GT_{t,i}$ is the corresponding position in the logged trajectory. $Coll_{t,i}$ is a Boolean indicator and will be 1 if the bounding box of agent $i$ intersects with others' bounding boxes. This reward function, while simple, captures the key objectives of preserving the behavioral realism as well as satisfying the safety constraint of collision avoidance.", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 5 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1: Pre-train and fine-tune an autoregressive motion predictor." + ], + "code_body": "input: Large-scale driving dataset $\\mathcal{D}$ output:A Sim Agent policy $\\pi_{\\theta}$ \n1 Initialize model parameters $\\theta$ and model $\\pi_{\\theta}$ \n2 for pre-training iterations $j = 1,\\dots$ do \n3 Retrieve $\\mathbf{s}_{\\mathrm{history}},\\mathbf{s}_{\\mathrm{GT}}$ from $\\mathcal{D}$ \n4 Construct target actions $\\mathbf{a}_{\\mathrm{GT}} = \\{a_{t,i}^{\\mathrm{GT}},\\forall t,i\\}$ and construct the observation $o_{t,i}$ with GT actions. \n5 Run the model with the observation and get the predicted actions $\\{a_{t,i},\\forall t,i\\}$ \n6 Update $\\pi_{\\theta}$ via Eq. 1. \n7 for fine-tuning iterations $j = 1,\\dots$ do \n8 Retrieve $\\mathbf{s}_{\\mathrm{history}}$ from $\\mathcal{D}$ ; Set ${\\bf a}_0\\gets$ . \n9 for $t = 1,\\ldots ,T_{pred}$ do Autoregressive Rollout. \n10 $\\begin{array}{rlr}{\\bf o}_t\\leftarrow (\\mathbf{s}_{\\mathrm{history}},\\mathbf{a}_0,\\ldots ,\\mathbf{a}_{t - 1},\\mathcal{I}). & {} & {\\bf \\nabla}\\triangleright \\mathrm{Get~obs}.\\\\ {\\bf a}_t\\leftarrow \\pi_\\theta (\\cdot |\\mathbf{o}_t). & {} & {\\bf \\nabla}\\triangleright \\mathrm{Decode~next~actions}. \\end{array}$ \n11 \n12 Reconstruct predicted states $\\mathbf{s}_{\\mathrm{pred}} = \\{\\hat{s}_{t,i},\\forall t,i\\}$ by translating actions $a_{t,i},\\forall t,i$ \n13 Compute per-agent per-step $r_{t,i}$ via Eq. 2 \n14 Compute normalized return via Eq. 4 and update $\\pi_{\\theta}$ via Eq. 5", + "bbox": [ + 218, + 179, + 784, + 452 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "During fine-tuning, we run the model for $T_{\\mathrm{pred}}$ prediction steps. The encoder first encodes the scene context $c$ as a shared scene embedding, before the autoregressive decoding. At each prediction step $t$ , the fixed scene embedding and the $t \\times N$ tokens are fed to the autoregressive decoder and sample $N$ new actions. Specifically, at prediction step $t = 1$ , we project the agents' current positions through a MLP and get the agent embeddings: $id_i = \\mathrm{MLP}(Pos_{0,i}), i = 1, \\dots, N$ . The agent and scene embeddings serve as the input tokens to the decoder. After several layers of self-attention and cross-attention, $N$ actions are sampled from the categorical distributions constructed from the output of the decoder. The embeddings of those sampled actions will be added with corresponding $id_i$ and concatenated with the tokens in previous steps to form the input tokens for the next step. Compared to the decoding process of a language model, we output $N$ tokens concurrently at each prediction step instead of one token. Our model autoregressively rolls out the actions in $T_{\\mathrm{pred}}$ time steps. After collecting the rollout trajectories, we translate the actions to sequences of 2D positions for computing the rewards following Eq. 2. The return (i.e. the \"reward-to-go\"), for step $t$ and each agent $i$ is:", + "bbox": [ + 212, + 484, + 787, + 743 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nR _ {t, i} = \\sum_ {t ^ {\\prime} = t} ^ {T _ {\\text {p r e d}}} \\gamma^ {t ^ {\\prime} - t} r _ {t ^ {\\prime}, i}. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 424, + 755, + 784, + 797 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We normalize the return across the whole training batch, here Mean and Std are the average and the standard deviation computed across all time steps in all", + "bbox": [ + 212, + 809, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 233, + 114, + 727, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "scenarios for all agents in the training batch:", + "bbox": [ + 215, + 146, + 540, + 161 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {R} _ {t, i} = \\left(R _ {t, i} - \\operatorname {M e a n} (R)\\right) / \\operatorname {S t d} (R). \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 382, + 175, + 785, + 191 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We then apply the REINFORCE [35] method to compute a policy gradient for optimizing the model by differentiating the following surrogate objective:", + "bbox": [ + 214, + 203, + 785, + 233 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\max _ {\\pi_ {\\theta}} \\mathbb {E} _ {\\mathcal {D}} \\sum_ {t = 1} ^ {T _ {\\text {p r e d}}} \\sum_ {i \\in \\mathcal {I}} \\log \\pi_ {\\theta} \\left(a _ {t, i} \\mid o _ {t, i}\\right) \\tilde {R} _ {t, i}. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 247, + 785, + 289 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Policy Evaluation for Sim Agents", + "text_level": 1, + "bbox": [ + 215, + 311, + 537, + 328 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "A key limitation of common \"imitative\" metrics (such as ADE), which compare model rollouts to ground truth trajectories, is the weak connection between the metric and the actual goal of assessing the AD planner performance. A low ADE metric does not guarantee good driving behaviors. Log-replay, for example, has a perfect ADE of zero but would be a poor choice for sim agents because it is non-reactive. To create an evaluation that has a direct connection to measuring the performance of the AD planners, we propose a new policy evaluation framework for sim agents, inspired by the RL policy evaluation literature [32].", + "bbox": [ + 212, + 339, + 787, + 460 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our policy evaluation framework involves ranking and scoring the performance of a predetermined collection of AD planner policies. This is analogous to a real-world use case where one must decide which planner to deploy from a collection of candidate software releases. A better sim-agent model will give a more accurate signal on which policy would be best when deployed in the real world. As shown in Fig. 4, we first prepare a batch of AD planner policies with known performance ranking. Then, we evaluate the performance of these AD planners when the traffic agents in the scenario are controlled by a sim agent model. Therefore, we will generate the estimated performance for those AD planners for the specific sim agent. We then measure the discrepancy between the estimated performance and the ground truth performance of those planners. This discrepancy becomes the measurement of the sim agents model's ability to assess the performance of the planners. Policy evaluation covers two important use cases for the sim agent models in the deployment of autonomous vehicles: evaluation, where we wish to estimate the performance of agents in the simulation, and selection, where we wish to determine a ranking or order between different deployment candidates.", + "bbox": [ + 215, + 460, + 787, + 718 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Choice of policies. In order to perform policy evaluation, we must have a fixed set of policies on hand to rank or evaluate. To generate a large variety of planning policies with both good and bad performance, we propose to use a random shooting search-based policy family, parameterized by the number $(J)$ and depth $(D)$ of trajectories sampled. We compute a \"ground truth\" score for each policy by evaluating it with log playback agents. Note that the choice of ground truth is an important design decision. Any sim agent could serve as a ground truth,", + "bbox": [ + 214, + 734, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/a741a19cd8b763af10b8d8d4b51f68097b11fc501a4e0e87ac7d1b1443d69623.jpg", + "image_caption": [ + "Fig. 4: We evaluate the sim agent by its ability to correctly assess the AD planner." + ], + "image_footnote": [], + "bbox": [ + 230, + 146, + 776, + 272 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "but we need to pick one that is the most fair to all models and we believe log playback to be the most neutral.", + "bbox": [ + 212, + 325, + 782, + 356 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Our random shooting policy operates in a model-predictive control (MPC) fashion: at each time step, our random shooting policy samples from a fixed library of $J$ trajectories, which are generated by maintaining a single steering wheel angle and acceleration for $D$ steps. Note that this action specification is different from the action space of the MotionLM architecture we described in Sec. 4. We found this simple strategy to work much better than randomly selected actions. The trajectories are then scored by a reward function and the first step of the best scoring trajectory is executed. This process repeats for the entirety of the rollout. We used 16 different settings of $J$ , ranging between 9 to 81, and we used 4 values of depth $D \\in [6,8,12,16]$ . We then used the product of these two sets, for a total of 64 different policies evaluated.", + "bbox": [ + 212, + 357, + 784, + 523 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Reward Function. The reward function used for selecting actions from a set of candidate trajectories is a linear combination of collisions, as well as off-road and route-following infractions. We use a modified reward function from Eq. 2 by replacing the L2 norm from the ground truth (which is not available to the planner at execution time) with additional terms for following a reasonable path. We instead give the planner a high-level route in the form of waypoints, and we use a weighted sum of $-10C - O - R + 10^{-4}P$ , where $C \\in \\{0,1\\}$ denotes the collision indicator and is 1 when a collision between AV and another object happens, $O \\in \\{0,1\\}$ denotes the offroad indicator and is 1 when the AV is too close to the road edge, $R \\in \\{0,1\\}$ denotes the off-route indicator which is 1 when the AV's lateral distance to the GT trajectory exceeds a threshold, and $P$ is the projection of the AV's displacement between two time steps when projected onto the logged trajectory and measures the route-following behavior. We use Waymax [9]'s utility function to compute those metrics.", + "bbox": [ + 212, + 535, + 787, + 746 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 215, + 766, + 375, + 782 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We now describe our method's experimental results on the Waymo Open Sim Agents Challenge (WOSAC) [20] and on the Policy Evaluation task introduced in Sec. 4.2. Our experiments are designed to answer the following questions:", + "bbox": [ + 212, + 794, + 784, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 233, + 114, + 727, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/51aedc14d751b9a404c60c52b97eca46111fdde66b59f7455b42f295d0502ee1.jpg", + "table_caption": [], + "table_footnote": [ + "Table 1: Results on the Waymo Open Sim Agents Challenge (WOSAC) benchmark. Metrics marked with $(\\uparrow)$ are better if higher, while metrics marked with $(\\downarrow)$ are better if lower. Fine-tuned agents score better than pre-trained agents on safety-critical metrics such as collision and offroad, which results in a significantly higher composite metric score. We bold the best results for the baseline agents and best results from the model we trained for this work." + ], + "table_body": "
Lin. Speed↑Lin. Acc.↑Ang. Speed↑Ang. Acc.↑Dist. to Obj.↑Collision↑TTC↑Dist. to Road Edge↑Offroad↑Composite↑ADE↓MinADE↓
Random0.0020.0440.0740.1200.0000.0000.7340.1780.2870.15550.73950.706
Constant Velocity0.0740.0580.0190.0350.2080.3450.7370.4540.4550.2877.9237.923
Wayformer0.3310.0980.4130.4060.2970.8700.7820.5920.8660.5752.4982.498
MVTE0.4450.2220.5350.4810.3830.8930.8320.6640.9080.6453.8591.674
Logged Oracle0.5610.3300.5630.4890.4851.0000.8810.7131.0000.7220.0000.000
Pre-trained (1M)0.3900.2350.5040.4470.3480.5440.8030.5820.5250.4906.3323.177
RL-only (1M)0.2570.1150.4870.4290.2440.2390.7590.4560.1640.3207.7856.918
Fine-tuned (1M)0.4120.2190.4510.4200.3480.8630.8140.6370.8040.5972.4361.867
Pre-trained (10M)0.4390.2410.5020.4540.3710.6730.8110.6250.6550.5494.5082.274
Fine-tuned (10M)0.4330.2200.4550.4230.3610.8770.8190.6470.8250.6082.4281.706
", + "bbox": [ + 217, + 143, + 782, + 244 + ], + "page_idx": 9 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. Does RL fine-tuning improve the overall sim agents behavior?", + "2. Can fine-tuning be used to improve targeted metrics through reward engineering?", + "3. Does the fine-tuned sim agents model provide better evaluation of AD planner performance?" + ], + "bbox": [ + 220, + 369, + 782, + 445 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dataset. We train our method and baselines on the Waymo Open Motion Dataset (WOMD) [15] and evaluate on the Waymo Open Sim Agents Challenge (WOSAC) benchmark [20]. WOMD contains scenarios recorded at $10\\mathrm{Hz}$ including one second of history (11 discrete time steps), and 8 seconds of future states (80 time steps) to predict. In total, there are 486k training scenarios, 44k validation scenarios, and 45k test scenarios. Up to 128 agents are simulated in each scenario.", + "bbox": [ + 215, + 460, + 787, + 566 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Model. We use a pre-trained autoregressive motion prediction model MotionLM [28]. For the MotionLM model with 10M parameters, we use 4 encoder and 4 decoder layers. The hidden size is 256. The number of attention heads is 4. The activation is ReLU. The feed-forward network intermediate size is 1024.", + "bbox": [ + 215, + 580, + 807, + 641 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Training. We pre-train a MotionLM model on the WOMD training set with the objective in Eq. 1. The model is then used for RL fine-tuning. The encoder and the decoder of the model are fine-tuned jointly. 1M steps of updates are conducted both in pre-training and fine-tuning. At each training step, 128 scenarios are sampled from the dataset to form a batch. During RL fine-tuning, the learning rate is set to 5e-6 and the discount factor is set to 0.95.", + "bbox": [ + 215, + 656, + 787, + 747 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.1 Waymo Open Sim Agents Challenge", + "text_level": 1, + "bbox": [ + 217, + 768, + 560, + 785 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Baselines. We include several notable baselines reported by [20] on WOSAC. The \"random\" and \"constant velocity\" agents are included to provide a reasonable performance lower bound. The \"logged oracle\" represents the ground truth future", + "bbox": [ + 215, + 794, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "behavior that is not visible to other baselines and represents an upper-bound on performance. Wayformer [23] is a recent transformer-based model which shares the same encoder structure as our model. MVTE [34] is another transformer-based architecture which is the current state-of-the-art on the benchmark. Both Wayformer and MVTE adopt the agent-centric input representation. We also report the performance of our pre-trained 1M parameter and 10M parameter models, which are based on the MotionLM [28] architecture.", + "bbox": [ + 212, + 146, + 787, + 253 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Evaluation Metrics. The Waymo Open Sim Agents challenge evaluates agents on a wide range of likelihood-based metrics. These metrics are designed to measure realistic simulation in aggregate over the entire dataset, while allowing agents to have enough flexibility to deviate from the exact logged ground truth in each scenario. Each benchmarked method samples 32 rollouts for each WOMD test scenario. Metrics (such as velocity and heading angle) are then measured on these samples, but binned into discrete histograms, and the log-likelihood of the ground-truth data is measured under these histograms. The individual scores are then weighted and averaged to produce a final composite metric. In addition, following WOSAC [21] we also report the mean average displacement error (ADE) over 32 rollouts and the minimum average displacement error (minADE) over 32 rollouts.", + "bbox": [ + 212, + 266, + 787, + 446 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Results. We report our results on WOSAC in Table 1. The results provide strong evidence that closed-loop fine-tuning from a pre-trained model can significantly improve performance of the model as a sim agent. We see that both the \"Finetuned 1M\" and \"Finedtuned 10M\" models perform better than \"Pre-trained 1M\" and \"Pre-trained 10M\", respectively. When we look at the breakdown of the constituent metrics, we see that most of the gains come from improved safety-critical metrics such as collision and offroad. As a concrete example, Fig. 5 illustrates a single scenario comparing a rollout from a pre-trained 1M parameter model with a fine-tuned model. The pre-trained model is prone to slowly drifting away from the ground truth trajectory, a distribution shift problem commonly impacting pure imitative and teacher forcing [27] methods. By training the model in closed-loop, we can mitigate this distribution shift issue.", + "bbox": [ + 212, + 460, + 787, + 643 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The composite performance of \"Fine-tuned 10M\" is still lower than the state-of-the-art MVTE [34] model. We believe this can be mostly attributed to the choice of our pre-trained baseline model, which was our re-implemented version of the MotionLM [28] architecture with the encoder architecture of Wayformer [23]. We leave the fine-tuning of MVTE using the same methodology described in this work as future work, which we hypothesize would lead to a sizeable performance gain.", + "bbox": [ + 212, + 643, + 787, + 748 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To measure the effect of reward engineering and the ability to target specific metrics with fine-tuning, we ran an ablation study varying the relative weight $\\lambda$ of the collision metric in Eq. 2, with results reported in Table 2. We fine-tuned the 1M parameter model with 4 different collision weights, and reported the collision score versus the ADE of the predictions. We can clearly see that adding some amount of collision penalty improves the collision metric at the cost", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 233, + 114, + 727, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/ef81a1ffab23c4af7cdeb885970fe8fcfeeea21512bf5900b85d1b061fed2274.jpg", + "image_caption": [ + "Pre-trained Model", + "Fig. 5: Visualization of scenario rollouts using a pre-trained and a fine-tuned model. The start locations of vehicles are marked with a red star, the ground truth futures are marked with a solid black line, and the sampled trajectory is marked with circles of different colors. Left: The pre-trained model suffers from drifting due to distributional shift between training (with teacher forcing) and testing (with an autoregressive rollout). Right: The fine-tuned model is able to follow the ground truth much more precisely, which is quantitatively demonstrated by the better ADE metric." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 488, + 460 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/347aa08ec18f237e7b60e1e2b5cff31fb7c829a4e8fdf7b7b26e2f2109fad7af.jpg", + "image_caption": [ + "Fine-tuned Model" + ], + "image_footnote": [], + "bbox": [ + 514, + 143, + 784, + 460 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/ea9ff6f31c3b8a7cd01ec246c8d6a8ca220d2420869c4ee94abfbb91f5cb8f33.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Collision WeightCollision ↑TTC ↑Composite ↑ADE ↓MinADE ↓
00.8340.8100.5902.4051.871
20.8630.8140.5972.4361.867
50.8440.8170.5952.8381.980
100.8310.8170.5943.0582.023
", + "bbox": [ + 285, + 603, + 718, + 691 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Table 2: WOSAC benchmark scores for different values of the collision fine-tuning weight $\\lambda$ with the 1M parameter model. Increasing the collision weight improves the collision score at the cost of decreasing imitative behavior metrics such as ADE. We find a good balance at an intermediate value.", + "bbox": [ + 212, + 691, + 787, + 748 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "of degrading the ADE metric. This generally makes sense, as the optimization must trade-off the collision penalty versus the displacement error terms in the reward function. However, we also see that at very high values of the collision", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "weight, all metrics tend to degrade, and the best result is with an intermediate cost weight. We hypothesize this is the case because displacement error is a very dense and rich reward signal, whereas collision is a more sparse and noisy signal.", + "bbox": [ + 212, + 146, + 787, + 194 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.2 Policy Evaluation", + "text_level": 1, + "bbox": [ + 214, + 222, + 408, + 238 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "As described in Sec. 4.2, we also propose to evaluate sim agents through the lens of policy evaluation. In particular, we follow the methodology proposed by [8] and report two metrics used in their benchmark: Spearman's rank correlation and absolute error. Rank correlation is a metric for \"selection\" and measures the ability for the simulation to discern between good and bad policies (AD planners). This is useful for the problem setting where one must select the best policy to deploy from a set of candidates. On the other hand, absolute error is a metric for \"evaluation\" and measures how closely a simulation comes close to estimating the true cost or reward accrued by the policy. This is useful if one is interested in concrete performance numbers such as estimating the rate of a particular event of interest. The sim agent causing less absolute error and higher rank correlation is better for evaluating different planners.", + "bbox": [ + 212, + 256, + 787, + 436 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Given a set of planners with known performance ranking, we assess sim agents by measuring how well they estimate the value function of each planner. We generate a Monte-Carlo estimate of each planner's value by running it on each scenario, where all traffic participants are controlled by the sim agent, and computing the empirical returns of the planner. The returns are then averaged across all scenarios in the WOMD test set to form the estimate of the planner. The value estimates are then compared to a \"ground-truth value\", and we show two quantities, rank correlation and absolute error in Table 3 and Table 4, respectively. Each row in these tables represents the policy evaluation results of a sim agent. A sim agent will generate $K = 64$ estimated returns of $K$ policies (AD planners). Due to the absence of real-world simulation, there is no a universal ground truth sim agent that can fully replicate the realistic behaviors. We cannot know the ground truth returns when running these $K$ policies in the real world. In this work, we picked the log-playback sim agent as the \"ground truth sim agent\" and considered the average returns of these $K$ policies when running with the log-playback sim agent as the ground truth value. These form the Log column in Table 3 and Table 4. We also show rank correlation and absolute error relative to each other sim agent we considered for completeness.", + "bbox": [ + 212, + 439, + 789, + 710 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Results. Our results are reported in Table 3 and Table 4. We report results on a total of 64 candidate policies created by varying the depth (D) and the number of sampled trajectories (J). According to the Log column, we see that with fine-tuned models, a higher rank correlation and lower absolute error relative to the log-playback sim agent can be achieved, indicating that the fine-tuned models are more accurate at measuring a planner's performance and deciding whether the planner is better than another.", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 232, + 114, + 727, + 130 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 127 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/e231dcace13767b7b03f331adeebe26d9ff76a1a2b4b935eb4295139f18231c4.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M0.859-0.9540.9530.911
Fine-tuned 1M0.8650.954-0.9590.925
Pre-trained 10M0.8450.9530.959-0.932
Fine-tuned 10M0.8660.9110.9250.932-
", + "bbox": [ + 276, + 143, + 727, + 220 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/ea0bff71dcf0445ec15ec9cee2c0308adcce11109b220aef8a475c8f86b047c3.jpg", + "table_caption": [ + "Table 3: Policy evaluation rank correlation results for pre-trained and fine-tuned models (higher is better). Each cell corresponds to a ranking correlation of estimated returns of a set of predefined AD planners between two sim agent models. For example, the highlighted Fine-tuned 10M - Log means the ranking correlation of predefined AD planners when using the Fine-tuned 10M and the log-playback sim agents." + ], + "table_footnote": [], + "table_body": "
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M10.518-0.5570.5511.013
Fine-tuned 1M10.1010.557-0.4260.729
Pre-trained 10M10.0140.5510.426-0.602
Fine-tuned 10M9.5091.0130.7290.602-
", + "bbox": [ + 274, + 316, + 727, + 391 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 4: Policy evaluation rank absolute error results for pre-trained and fine-tuned models (lower is better).", + "bbox": [ + 212, + 391, + 785, + 419 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 460, + 359, + 476 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We studied the viability of applying the popular \"pre-training and fine-tuning\" scheme to modeling traffic agents for AD simulation. We drew the connection between a multi-agent driving behavior model and a simulation environment - the multi-agent behavior model itself can be used to perform rollouts for closed-loop training. By using an on-policy RL algorithm with a simple reward, we are able to fine-tune a pre-trained large multi-agent behavior model to effectively align the traffic agent behaviors with human expectations, such as collision avoidance. The experimental results show that our method can significantly improve the performance of the pre-trained model on the Waymo Open Sim Agent Challenge (WOSAC) [20]. We also proposed a novel policy evaluation task and demonstrated that the model fine-tuned by our method can achieve more reliable AD testing result.", + "bbox": [ + 212, + 492, + 785, + 672 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations. There are several limitations to the approach we have discussed in this paper. We use a simple transition and action model (based on predicting accelerations and integrating them to estimate positions) as the environment dynamics model, which could produce kinematically unrealistic behaviors during a rollout. A more realistic solution would be to embed a low-level controller into simulation that attempts to reach the positions predicted by the model. In addition, we studied a reward function (Eq. 2) that encourages collision avoidance and minimizes divergence in closed-loop simulation. The reward function can be extended to induce various driving behaviors, such as encouraging adversarial behavior (e.g. using the negative of the ego vehicle's reward) to stress-test challenging scenarios.", + "bbox": [ + 212, + 674, + 785, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Argall, B.D., Chernova, S., Veloso, M., Browning, B.: A survey of robot learning from demonstration. Robotics and autonomous systems 57(5), 469-483 (2009)", + "2. Bergamini, L., Ye, Y., Scheel, O., Chen, L., Hu, C., Del Pero, L., Osinski, B., Grimmett, H., Ondruska, P.: Simnet: Learning reactive self-driving simulations from real-world observations. In: 2021 IEEE International Conference on Robotics and Automation (ICRA). pp. 5119-5125. IEEE (2021)", + "3. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023)", + "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)", + "5. Codevilla, F., Müller, M., López, A., Koltun, V., Dosovitskiy, A.: End-to-end driving via conditional imitation learning. In: 2018 IEEE international conference on robotics and automation (ICRA). pp. 4693-4700. IEEE (2018)", + "6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: CARLA: An open urban driving simulator. In: Proceedings of the 1st Annual Conference on Robot Learning. pp. 1-16 (2017)", + "7. Feng, L., Li, Q., Peng, Z., Tan, S., Zhou, B.: Trafficgen: Learning to generate diverse and realistic traffic scenarios. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3567-3575. IEEE (2023)", + "8. Fu, J., Norouzi, M., Nachum, O., Tucker, G., Novikov, A., Yang, M., Zhang, M.R., Chen, Y., Kumar, A., Paduraru, C., et al.: Benchmarks for deep off-policy evaluation. In: International Conference on Learning Representations (2020)", + "9. Gulino, C., Fu, J., Luo, W., Tucker, G., Bronstein, E., Lu, Y., Harb, J., Pan, X., Wang, Y., Chen, X., et al.: Waymax: An accelerated, data-driven simulator for large-scale autonomous driving research. arXiv preprint arXiv:2310.08710 (2023)", + "10. Hu, Y., Yang, J., Chen, L., Li, K., Sima, C., Zhu, X., Chai, S., Du, S., Lin, T., Wang, W., et al.: Planning-oriented autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17853-17862 (2023)", + "1. Kamenev, A., Wang, L., Bohan, O.B., Kulkarni, I., Kartal, B., Molchanov, A., Birchfield, S., Nister, D., Smolyanskiy, N.: Predictionnet: Real-time joint probabilistic traffic prediction for planning, control, and simulation. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 8936-8942. IEEE (2022)", + "2. Leurent, E.: An environment for autonomous driving decision-making. https://github.com/eleurent/highway-env (2018)", + "3. Li, Q., Peng, Z., Feng, L., Liu, Z., Duan, C., Mo, W., Zhou, B.: ScenarioNet: Open-source platform for large-scale traffic scenario simulation and modeling. Advances in Neural Information Processing Systems (2023)", + "4. Li, Q., Peng, Z., Feng, L., Zhang, Q., Xue, Z., Zhou, B.: Metadrive: Composing diverse driving scenarios for generalizable reinforcement learning. IEEE transactions on pattern analysis and machine intelligence (2022)", + "5. LLC, W.: Waymo open dataset: An autonomous driving dataset (2019)", + "6. Lu, J., Batra, D., Parikh, D., Lee, S.: Vilbert: Pretraining task-agnostic visiolinguistic representations for vision-and-language tasks. Advances in neural information processing systems 32 (2019)" + ], + "bbox": [ + 225, + 178, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 233, + 114, + 727, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Lu, Y., Fu, J., Tucker, G., Pan, X., Bronstein, E., Roelofs, R., Sapp, B., White, B., Faust, A., Whiteson, S., et al.: Imitation is not enough: Robustifying imitation with reinforcement learning for challenging driving scenarios. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 7553-7560. IEEE (2023)", + "18. Mendez-Lucio, O., Nicolaou, C.A., Earnshaw, B.: Mole: a molecular foundation model for drug discovery. In: NeurIPS 2022 Workshop on Learning Meaningful Representations of Life (2022)", + "19. Min, C., Zhao, D., Xiao, L., Nie, Y., Dai, B.: Uniworld: Autonomous driving pretraining via world models. arXiv preprint arXiv:2308.07234 (2023)", + "20. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023)", + "21. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023)", + "22. Moor, M., Banerjee, O., Abad, Z.S.H., Krumholz, H.M., Leskovec, J., Topol, E.J., Rajpurkar, P.: Foundation models for generalist medical artificial intelligence. Nature 616(7956), 259-265 (2023)", + "23. Nayakanti, N., Al-Rfou, R., Zhou, A., Goel, K., Refaat, K.S., Sapp, B.: Wayformer: Motion forecasting via simple & efficient attention networks. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 2980-2987. IEEE (2023)", + "24. OpenAI: Gpt-4 technical report (2023)", + "25. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. Advances in Neural Information Processing Systems 35, 27730-27744 (2022)", + "26. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)", + "27. Ross, S., Gordon, G., Bagnell, D.: A reduction of imitation learning and structured prediction to no-regret online learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 627-635. JMLR Workshop and Conference Proceedings (2011)", + "28. Seff, A., Cera, B., Chen, D., Ng, M., Zhou, A., Nayakanti, N., Refaat, K.S., Al-Rfou, R., Sapp, B.: Motionlm: Multi-agent motion forecasting as language modeling. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8579-8590 (2023)", + "29. Shi, S., Jiang, L., Dai, D., Schiele, B.: Motion transformer with global intention localization and local movement refinement. Advances in Neural Information Processing Systems 35, 6531-6543 (2022)", + "30. Shi, S., Jiang, L., Dai, D., Schiele, B.: Mtr++: Multi-agent motion prediction with symmetric scene modeling and guided intention querying. arXiv preprint arXiv:2306.17770 (2023)", + "31. Suo, S., Regalado, S., Casas, S., Urtasun, R.: Trafficsim: Learning to simulate realistic multi-agent behaviors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10400-10409 (2021)", + "32. Uehara, M., Shi, C., Kallus, N.: A review of off-policy evaluation in reinforcement learning. arXiv preprint arXiv:2212.06355 (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Z. Peng et al.", + "bbox": [ + 271, + 114, + 362, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "33. Vinitsky, E., Lichtlé, N., Yang, X., Amos, B., Foerster, J.: Nocturne: a scalable driving benchmark for bringing multi-agent learning one step closer to the real world. Advances in Neural Information Processing Systems 35, 3962-3974 (2022)", + "34. Wang, Y., Zhao, T., Yi, F.: Multiverse transformer: 1st place solution for waymo open sim agents challenge 2023. arXiv preprint arXiv:2306.11868 (2023)", + "35. Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8, 229-256 (1992)", + "36. Zhang, C., Tu, J., Zhang, L., Wong, K., Suo, S., Urtasun, R.: Learning realistic traffic agents in closed-loop. In: 7th Annual Conference on Robot Learning (2023)", + "37. Zhang, Q., Gao, Y., Zhang, Y., Guo, Y., Ding, D., Wang, Y., Sun, P., Zhao, D.: Trajgen: Generating realistic and diverse trajectories with reactive and feasible agent behaviors for autonomous driving. IEEE Transactions on Intelligent Transportation Systems 23(12), 24474-24487 (2022)", + "38. Zhang, Z., Liniger, A., Dai, D., Yu, F., Van Gool, L.: Trafficbots: Towards world models for autonomous driving simulation and motion prediction. arXiv preprint arXiv:2303.04116 (2023)", + "39. Zhong, Z., Rempe, D., Xu, D., Chen, Y., Veer, S., Che, T., Ray, B., Pavone, M.: Guided conditional diffusion for controllable traffic simulation. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3560-3566. IEEE (2023)", + "40. Zhou, C., Li, Q., Li, C., Yu, J., Liu, Y., Wang, G., Zhang, K., Ji, C., Yan, Q., He, L., et al.: A comprehensive survey on pretrained foundation models: A history from bert to chatgpt. arXiv preprint arXiv:2302.09419 (2023)", + "41. Zhou, M., Luo, J., Villella, J., Yang, Y., Rusu, D., Miao, J., Zhang, W., Alban, M., Fadakar, I., Chen, Z., Huang, A.C., Wen, Y., Hassanzadeh, K., Graves, D., Chen, D., Zhu, Z., Nguyen, N., Elsayed, M., Shao, K., Ahilan, S., Zhang, B., Wu, J., Fu, Z., Rezaee, K., Yadmellat, P., Rohani, M., Nieves, N.P., Ni, Y., Banijamali, S., Rivers, A.C., Tian, Z., Palenicek, D., bou Ammar, H., Zhang, H., Liu, W., Hao, J., Wang, J.: Smarts: Scalable multi-agent reinforcement learning training school for autonomous driving (2020)", + "42. Zhou, Y., Chia, M.A., Wagner, S.K., Ayhan, M.S., Williamson, D.J., Struyven, R.R., Liu, T., Xu, M., Lozano, M.G., Woodward-Court, P., et al.: A foundation model for generalizable disease detection from retinal images. Nature pp. 1-8 (2023)", + "43. Zitkovich, B., Yu, T., Xu, S., Xu, P., Xiao, T., Xia, F., Wu, J., Wohlhart, P., Welker, S., Wahid, A., et al.: Rt-2: Vision-language-action models transfer web knowledge to robotic control. In: 7th Annual Conference on Robot Learning (2023)" + ], + "bbox": [ + 212, + 146, + 787, + 646 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving", + "bbox": [ + 233, + 114, + 727, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_model.json b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_model.json new file mode 100644 index 0000000000000000000000000000000000000000..7fac44535117a5705ce81cb7acee109147a5540a --- /dev/null +++ b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_model.json @@ -0,0 +1,2104 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.223, + 0.141, + 0.783, + 0.187 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.212, + 0.761, + 0.245 + ], + "angle": 0, + "content": "Zhenghao Peng\\(^{1*}\\), Wenjie Luo\\(^{2}\\), Yiren Lu\\(^{2}\\), Tianyi Shen\\(^{2}\\), Cole Gulino\\(^{2}\\), Ari Seff\\(^{2}\\), and Justin Fu\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.442, + 0.254, + 0.564, + 0.27 + ], + "angle": 0, + "content": "\\(^{1}\\)UCLA, \\(^{2}\\)Waymo" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.309, + 0.744, + 0.502 + ], + "angle": 0, + "content": "Abstract. A major challenge in autonomous vehicle research is modeling agent behaviors, which has critical applications including constructing realistic and reliable simulations for off-board evaluation and forecasting traffic agents motion for onboard planning. While supervised learning has shown success in modeling agents across various domains, these models can suffer from distribution shift when deployed at test-time. In this work, we improve the reliability of agent behaviors by closed-loop fine-tuning of behavior models with reinforcement learning. Our method demonstrates improved overall performance, as well as targeted metrics such as collision rate, on the Waymo Open Sim Agents challenge. Additionally, we present a novel policy evaluation benchmark to directly assess the ability of simulated agents to measure quality of autonomous vehicle planners and demonstrate the effectiveness of our approach on this new benchmark." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.516, + 0.747, + 0.543 + ], + "angle": 0, + "content": "Keywords: Autonomous Driving \\(\\cdot\\) Reinforcement Learning \\(\\cdot\\) Policy Evaluation \\(\\cdot\\) Behavior Prediction" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.571, + 0.376, + 0.587 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.603, + 0.461, + 0.739 + ], + "angle": 0, + "content": "Transformer-based architectures have demonstrated state-of-the-art performance in a variety of tasks in language [24], vision [26], and robotics [43]. The success of these models is credited to a widely adopted \"pre-training and fine-tuning\" scheme [40]. In the pre-training phase, the model ac" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.74, + 0.788, + 0.816 + ], + "angle": 0, + "content": "requires knowledge from a very large amount of training data; during fine-tuning, the model behaviors are rectified to align with human preferences and expectations. While supervised learning can be used for fine-tuning, previous work has shown superior performance with reinforcement learning (RL) fine-tuning in language tasks [25] and text-to-image generation [3]. In autonomous driving" + }, + { + "type": "image", + "bbox": [ + 0.476, + 0.597, + 0.789, + 0.667 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.469, + 0.68, + 0.788, + 0.723 + ], + "angle": 0, + "content": "Fig.1: We propose to fine-tune a pre-trained motion prediction model with closed-loop reinforcement learning." + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.825, + 0.477, + 0.84 + ], + "angle": 0, + "content": "*Work done as an intern at Waymo." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.144, + 0.788, + 0.267 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.284, + 0.789, + 0.382 + ], + "angle": 0, + "content": "Fig. 2: Left: The agent is trained from scratch using a combined Behavioral Cloning (BC) and Reinforcement Learning (RL) approach. Without pre-training on large datasets, the agent must simultaneously explore the environment and develop its capabilities from scratch. Right: The agent undergoes a two-phase training scheme. Agent acquires a foundational skill set from aligning its actions (green) with ground truth data in pre-training (gray). The fine-tuning through RL refines the agent behaviors in the autoregressive rollout." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.414, + 0.784, + 0.459 + ], + "angle": 0, + "content": "(AD), given the abundance of human driving data, a natural question arises: Can we leverage the popular \"pre-training and RL fine-tuning\" strategy to effectively model agent behaviors?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.461, + 0.785, + 0.551 + ], + "angle": 0, + "content": "In this paper, we investigate the viability of applying the \"pre-training and RL fine-tuning\" paradigm to model the behaviors of traffic agents in AD scenarios. Such models can be applied in critical AD tasks such as simulation agents (sim agents) [20], enabling high-fidelity simulation systems for off-board evaluation, and behavior prediction for surrounding traffic participants, facilitating onboard planning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.786, + 0.779 + ], + "angle": 0, + "content": "Behavioral cloning (BC), or training an imitative model using supervised learning on demonstrations [1], has been the predominant approach for learning driving agents [5, 34]. While BC provides supervision for modeling realistic behavior, during closed-loop simulation, the agent behaviors can deviate from the training distribution, known as the \"covariate shift\" issue [27]. Moreover, BC lacks the ability to explicitly incorporate human preferences, expectations and constraints. For example, safety-critical events, such as collisions, are only implicitly discouraged in the BC loss due to their rarity in human driving datasets. In situations where a collision is likely to occur, the model may only have limited examples to learn from. RL fine-tuning can address these limitations. Firstly, RL learns from closed-loop synthetic rollouts, addressing the covariate shift problem as the reward function penalizes actions leading to future trajectories that diverge from ground-truth. Secondly, explicit objectives can be incorporated into the reward function so the agents can learn to align with human preferences and expectations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Inspired by the success of fine-tuning large language models to align with human preferences, we apply the \"pre-training and RL fine-tuning\" scheme to training behavior models for sim agents. As demonstrated in Fig. 1, we can fine-tune a pre-trained model via a simple on-policy RL approach with autoregressive" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.233, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.191 + ], + "angle": 0, + "content": "rollouts. We propose a simple reward function that not only enables the model to satisfy human preferences on the agent behaviors, but also maintains human likeness." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.788, + 0.401 + ], + "angle": 0, + "content": "Our experiments on the Waymo Open Sim Agent Challenge (WOSAC) [20] demonstrate that RL fine-tuning significantly improves the reliability of the agent behaviors, especially in terms of collision avoidance. An important application of the learned behaviors is in actuating the traffic agents in AD simulation. We study the reliability of the learned models in a novel planner evaluation benchmark. The intuition is that a simulator with more realistic sim agents model should provide more reliable evaluation across ego AD planners. With this insight, we use different sim agents model to control the traffic agents and assess the performance of a predefined set of AD planners. By comparing the planners' estimated performance as evaluated by the sim agents model against their known performance ranking, we find that our fine-tuned models provide more accurate planner evaluations. This indicates that our approach is beneficial for testing autonomous driving planners. The main contributions of this work are:" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.404, + 0.794, + 0.48 + ], + "angle": 0, + "content": "1) We propose to apply the popular \"pre-training and RL fine-tuning\" paradigm commonly used for large language models (LLMs) to the autonomous driving behavior modeling problem, demonstrating the effectiveness of closed-loop finetuning a Transformer-based architecture on the Waymo Open Motion Dataset (WOMD) [15]." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.48, + 0.787, + 0.525 + ], + "angle": 0, + "content": "2) We demonstrate that an on-policy RL algorithm with a simple reward function can successfully preserve the realism in the dataset while aligning human preferences on safety and reliability." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.525, + 0.787, + 0.584 + ], + "angle": 0, + "content": "3) To better evaluate the performance of sim agents models, we propose a novel planner evaluation task and demonstrate that our method can significantly improve the performance of the sim agents models in terms of its capability to assess the AD planners." + }, + { + "type": "list", + "bbox": [ + 0.215, + 0.404, + 0.794, + 0.584 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.606, + 0.388, + 0.621 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.636, + 0.747, + 0.651 + ], + "angle": 0, + "content": "2.1 Pre-training and Fine-tuning of Transformer-based Models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Transformer-based models have been applied to various domains such as text generation [4], image generation [26], robotics [43], drug discovery [18], disease diagnose [42], and generalist medical AI [22]. Many large Transformer-based models are trained in the \"pre-training then fine-tuning\" manner, where supervised fine-tuning [40] or reinforcement learning with human feedback [25] holds the promise to align the model behaviors to human preferences. In the autonomous driving domain, similar Transformer-based architectures have been applied to various tasks, ranging from perception [19], motion prediction [23], self-driving policies [10] and simulation [31,38,39]. In this work, we focus on the motion prediction problem, where predictors forecast the future trajectories of the target agents by observing history information [23, 29, 30]. Unlike foundational models in other domains such as large language models [24] and vision" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "language models [16], motion prediction models are most commonly trained via supervised learning and rarely fine-tuned to better boost alignment with human preferences." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.215, + 0.629, + 0.232 + ], + "angle": 0, + "content": "2.2 Behavior Modeling for Autonomous Driving" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.241, + 0.789, + 0.421 + ], + "angle": 0, + "content": "Modeling the behavior of traffic participants is a critical task in many autonomous driving systems, particularly for constructing realistic simulation to test the AD planners. Most existing simulators [6,12,41] rely on hand-crafted rules for traffics and maps generation. However, the data distributions for the map structure, traffic flow, the interaction between traffic participants and other elements do not realistically represent the real world. Modern data-driven simulators [9,13,14,33] address this by replaying the behaviors of the traffic participants from real-world scenarios recorded by an autonomous vehicle (log-replay). Yet, the downside of log-replay is that re-simulation may become unrealistic when the planner behavior diverges from the original logged behavior. For example, if an AD planner is more cautious than the human driver and brakes earlier, the trailing vehicle might collide into it, leading to a false positive collision." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.422, + 0.789, + 0.619 + ], + "angle": 0, + "content": "In this work, we mainly focus on the simulation agents task and evaluate our solutions on the Waymo Open Sim Agent Challenge (WOSAC) [20]. Many existing WOSAC submissions apply the marginal motion prediction models [2,7,29], which typically take initial states and predict the positions of traffic participants at all future steps in a single inference (one-shot). Those marginal models do not explicitly model interactions between agents during the prediction horizon. The autoregressive (AR) models naturally fit to the driving behavior modeling, especially in the context of closed-loop simulation [11,28,31,38]. AR decoding [28] allows the interactions between agents to be modeled via a self-attention mechanism at each step of the decoding process. However, closed-loop training of the AR behavior prediction models remains an understudied area. We propose to improve a pre-trained AR model with closed-loop fine-tuning and evaluate the performance on the WOSAC benchmark." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.619, + 0.789, + 0.755 + ], + "angle": 0, + "content": "In contrast to prior research on combining behavior cloning and reinforcement learning [17,36,37], our approach eliminates the need for an external simulator and a dynamics model. Since our model predicts actions for all agents, it functions as a simplified simulation environment itself. From an algorithmic perspective, we avoid back-propagation through time (BPTT) used in existing works [11,36]. Instead, we propose that RL can be conducted with a minimalistic policy gradient algorithm [35]. This allows us to use non-differentiable rewards (such as a boolean collision indicator) and non-differentiable models with discrete outputs which would not be possible with BPTT." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.778, + 0.383, + 0.794 + ], + "angle": 0, + "content": "3 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Motion Prediction. A driving scenario includes static information such as the map topology and dynamic information such as the states of traffic participants" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.233, + 0.114, + 0.728, + 0.131 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "and traffic lights. At each time step, the state of a traffic participant is represented by a feature vector containing the position, velocity, and heading angle in global frame, and the object type (vehicle, cyclist, pedestrian). For traffic lights, the feature vector contains their position and state (green, yellow, red or unknown). Given the history states of \\( N \\) traffic participants with indices \\( \\mathcal{I} = [1\\ldots N] \\), the goal of motion prediction is to predict future trajectories, i.e. the positions in future steps, of these agents." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.265, + 0.79, + 0.451 + ], + "angle": 0, + "content": "Behavior Modeling as a Multi-Agent RL Problem. We consider driving behavior modeling as a Multi-agent Markov Decision Process (Multi-agent MDP). The Multi-agent MDP is defined by the tuple \\(\\langle \\mathcal{I},\\mathcal{S},\\{\\mathcal{A}_i\\} ,\\mathcal{T},\\{\\mathcal{R}_i\\} ,\\Omega ,\\{\\mathcal{O}_i\\} ,\\gamma \\rangle\\) where \\(\\mathcal{S}\\) is the joint state space, \\(\\mathcal{A} = \\times_{i}\\mathcal{A}_{i}\\) is the joint action space, the transition function is \\(\\mathcal{T}:S\\times \\mathcal{A}\\to S\\) , the reward functions are \\(\\mathcal{R}_i(s_t,a_{t,i},s_{t + 1}),\\forall i\\in \\mathcal{I}\\) the observation space is \\(\\varOmega=\\times_i\\varOmega_i\\) , the observation functions \\(\\mathcal{O}_i\\) , and the discount factor is \\(\\gamma\\) . In this Multi-agent MDP, the goal is to learn action policies \\(\\pi_i:\\mathcal{A}_i\\times \\varOmega_i\\rightarrow [0,1]\\) for each agent. Each agent aims to maximize its expected cumulative return: \\(\\pi_{i} = \\arg \\max_{\\pi}\\mathbb{E}_{\\tau \\sim P_{\\pi_{j},\\forall j\\in \\mathcal{I}}}\\left[\\sum_{t = 1}^{T_{\\mathrm{future}}}\\gamma^{t}r_{t,i}\\right]\\) where \\(\\tau = (\\mathbf{s}_0,\\mathbf{a}_0,\\dots,\\mathbf{s}_T,a_T)\\) is the joint future rollout obtained by executing the learned policy model conditioned on the initial state. Here, \\(\\mathbf{a}_t = \\{a_{t,i}\\}_{i\\in \\mathcal{I}}\\) is the joint actions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.588, + 0.659 + ], + "angle": 0, + "content": "Autoregressive Encoder-Decoder Architecture. We use MotionLM [28], an encoder-decoder transformer-based autoregressive motion prediction model. The model's encoder takes a set of tokens representing the initial states of the scenarios as input and generates a scene embedding. These initial states include the traffic lights states, map topology, and the history information of all traffic participants. During inference, we run the decoder for \\( T_{\\mathrm{pred}} \\) prediction steps to autoregressively generate the prediction of all agents. At each prediction step, the decoder takes a set of motion tokens as well as the scene embedding as input and gener" + }, + { + "type": "image", + "bbox": [ + 0.599, + 0.493, + 0.771, + 0.589 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.583, + 0.609, + 0.788, + 0.636 + ], + "angle": 0, + "content": "Fig. 3: The causal mask in the decoder." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.81 + ], + "angle": 0, + "content": "ates a distribution of \\( N \\) output tokens. The decoder consists of multiple layers, each applying self-attention among input tokens and cross-attention to the scene embedding. All \\( N \\) motion tokens at step \\( t \\) can attend to each other and all previous tokens as shown in Fig. 3, where each row represents a query token and each column a key token and green blocks indicate key tokens that the query can attend. After running \\( T_{\\mathrm{pred}} \\) prediction steps, the \\( T_{\\mathrm{pred}} \\times N \\) output motion tokens form complete trajectories for \\( N \\) agents. This autoregressive approach ensures that each agent's action is based on a temporally causal relationship with the previous actions of all traffic participants, leading to improved modeling of interaction between agents within the prediction horizon." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.84 + ], + "angle": 0, + "content": "We modify the original MotionLM model by adopting a scene-centric input format and predicting the motion of all agents, rather than using a pre-selected" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "subset. The scene-centric representation and the encoder-decoder architecture enable more computationally efficient encoding of the scene context and prediction of all agents' motion." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.217, + 0.331, + 0.234 + ], + "angle": 0, + "content": "4 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.25, + 0.785, + 0.307 + ], + "angle": 0, + "content": "As shown in Algorithm 1, our method has two stages. In the pre-training stage, we reconstruct the ground truth actions from the data and use the maximum likelihood objective to match the joint action distribution of observed behaviors in the dataset:" + }, + { + "type": "equation", + "bbox": [ + 0.391, + 0.308, + 0.786, + 0.35 + ], + "angle": 0, + "content": "\\[\n\\max _ {\\pi_ {\\theta}} \\mathbb {E} _ {\\mathcal {D}} \\sum_ {t = 1} ^ {T _ {\\text {p r e d}}} \\sum_ {i \\in \\mathcal {I}} \\log \\pi_ {\\theta} \\left(a _ {t, i} ^ {\\mathrm {G T}} \\mid o _ {t, i}\\right). \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.357, + 0.784, + 0.401 + ], + "angle": 0, + "content": "The second stage of our learning process fine-tunes the model using reinforcement learning (RL). We formalize the problem as a Multi-agent Markov Decision Process (MDP) for our behavior modeling task as follows:" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.402, + 0.785, + 0.492 + ], + "angle": 0, + "content": "Action. The action space \\(\\mathcal{A} = \\times_{i}\\mathcal{A}_{i}\\): The action space for each agent \\(\\mathcal{A}_i\\) is a Verlet-wrapped delta action space [28], where each action represents the X, Y acceleration in scene coordinates. To reconstruct the ground truth action targets, we first infer the accelerations by differentiating the observed positions in the data. These accelerations are then discretized into a \\(13\\times 13\\) uniformly spaced grid, where outliers are clipped to the minimum and maximum values of \\(6m / s^2\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.493, + 0.785, + 0.522 + ], + "angle": 0, + "content": "State. The state space \\( S \\) contains map features, the joint state of all objects and traffic lights." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.523, + 0.785, + 0.583 + ], + "angle": 0, + "content": "Transition Dynamics. Agents transit to new positions computed by adding previous positions with an offset: \\( pos_{t+1,i} = (a_{t,i}\\Delta + vel_{t,i})\\Delta + pos_{t,i} \\) wherein the velocity \\( vel_{t,i} \\) and the position \\( pos_{t,i} \\) are in \\( s_t \\) and \\( \\Delta \\) is the time interval between steps." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.785, + 0.645 + ], + "angle": 0, + "content": "Observation. We define observations to consist of a historic context \\( c \\), previous actions of all objects and the agent identity: \\( o_{t,i} = (c, \\mathbf{a}_1, \\dots, \\mathbf{a}_{t-1}, i) \\). Here, the context \\( c = (\\{m_i\\}_M, s_{T_{\\mathrm{prev}}}, \\dots, s_0) \\) is a set containing \\( M \\) map features and the object and traffic light states for history steps \\( t = T_{\\mathrm{prev}}, \\dots, 0 \\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.667, + 0.394, + 0.683 + ], + "angle": 0, + "content": "4.1 RL Fine-tuning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.694, + 0.784, + 0.724 + ], + "angle": 0, + "content": "We propose to fine-tune a pre-trained autoregressive motion predictor with RL. The reward function for each agent at each step is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.372, + 0.738, + 0.786, + 0.754 + ], + "angle": 0, + "content": "\\[\nr _ {t, i} = - \\left\\| P o s _ {t, i} - G T _ {t, i} \\right\\| _ {2} - \\lambda C o l l _ {t, i}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "where \\( Post_{t,i} \\) is the position of agent \\( i \\) in step \\( t \\) and \\( GT_{t,i} \\) is the corresponding position in the logged trajectory. \\( Coll_{t,i} \\) is a Boolean indicator and will be 1 if the bounding box of agent \\( i \\) intersects with others' bounding boxes. This reward function, while simple, captures the key objectives of preserving the behavioral realism as well as satisfying the safety constraint of collision avoidance." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.234, + 0.115, + 0.728, + 0.13 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "code_caption", + "bbox": [ + 0.227, + 0.15, + 0.739, + 0.179 + ], + "angle": 0, + "content": "Algorithm 1: Pre-train and fine-tune an autoregressive motion predictor." + }, + { + "type": "algorithm", + "bbox": [ + 0.219, + 0.18, + 0.785, + 0.453 + ], + "angle": 0, + "content": "input: Large-scale driving dataset \\(\\mathcal{D}\\) output:A Sim Agent policy \\(\\pi_{\\theta}\\) \n1 Initialize model parameters \\(\\theta\\) and model \\(\\pi_{\\theta}\\) \n2 for pre-training iterations \\(j = 1,\\dots\\) do \n3 Retrieve \\(\\mathbf{s}_{\\mathrm{history}},\\mathbf{s}_{\\mathrm{GT}}\\) from \\(\\mathcal{D}\\) \n4 Construct target actions \\(\\mathbf{a}_{\\mathrm{GT}} = \\{a_{t,i}^{\\mathrm{GT}},\\forall t,i\\}\\) and construct the observation \\(o_{t,i}\\) with GT actions. \n5 Run the model with the observation and get the predicted actions \\(\\{a_{t,i},\\forall t,i\\}\\) \n6 Update \\(\\pi_{\\theta}\\) via Eq. 1. \n7 for fine-tuning iterations \\(j = 1,\\dots\\) do \n8 Retrieve \\(\\mathbf{s}_{\\mathrm{history}}\\) from \\(\\mathcal{D}\\) ; Set \\({\\bf a}_0\\gets\\) . \n9 for \\(t = 1,\\ldots ,T_{pred}\\) do Autoregressive Rollout. \n10 \\(\\begin{array}{rlr}{\\bf o}_t\\leftarrow (\\mathbf{s}_{\\mathrm{history}},\\mathbf{a}_0,\\ldots ,\\mathbf{a}_{t - 1},\\mathcal{I}). & {} & {\\bf \\nabla}\\triangleright \\mathrm{Get~obs}.\\\\ {\\bf a}_t\\leftarrow \\pi_\\theta (\\cdot |\\mathbf{o}_t). & {} & {\\bf \\nabla}\\triangleright \\mathrm{Decode~next~actions}. \\end{array}\\) \n11 \n12 Reconstruct predicted states \\(\\mathbf{s}_{\\mathrm{pred}} = \\{\\hat{s}_{t,i},\\forall t,i\\}\\) by translating actions \\(a_{t,i},\\forall t,i\\) \n13 Compute per-agent per-step \\(r_{t,i}\\) via Eq. 2 \n14 Compute normalized return via Eq. 4 and update \\(\\pi_{\\theta}\\) via Eq. 5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.486, + 0.789, + 0.744 + ], + "angle": 0, + "content": "During fine-tuning, we run the model for \\( T_{\\mathrm{pred}} \\) prediction steps. The encoder first encodes the scene context \\( c \\) as a shared scene embedding, before the autoregressive decoding. At each prediction step \\( t \\), the fixed scene embedding and the \\( t \\times N \\) tokens are fed to the autoregressive decoder and sample \\( N \\) new actions. Specifically, at prediction step \\( t = 1 \\), we project the agents' current positions through a MLP and get the agent embeddings: \\( id_i = \\mathrm{MLP}(Pos_{0,i}), i = 1, \\dots, N \\). The agent and scene embeddings serve as the input tokens to the decoder. After several layers of self-attention and cross-attention, \\( N \\) actions are sampled from the categorical distributions constructed from the output of the decoder. The embeddings of those sampled actions will be added with corresponding \\( id_i \\) and concatenated with the tokens in previous steps to form the input tokens for the next step. Compared to the decoding process of a language model, we output \\( N \\) tokens concurrently at each prediction step instead of one token. Our model autoregressively rolls out the actions in \\( T_{\\mathrm{pred}} \\) time steps. After collecting the rollout trajectories, we translate the actions to sequences of 2D positions for computing the rewards following Eq. 2. The return (i.e. the \"reward-to-go\"), for step \\( t \\) and each agent \\( i \\) is:" + }, + { + "type": "equation", + "bbox": [ + 0.425, + 0.756, + 0.785, + 0.799 + ], + "angle": 0, + "content": "\\[\nR _ {t, i} = \\sum_ {t ^ {\\prime} = t} ^ {T _ {\\text {p r e d}}} \\gamma^ {t ^ {\\prime} - t} r _ {t ^ {\\prime}, i}. \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.789, + 0.842 + ], + "angle": 0, + "content": "We normalize the return across the whole training batch, here Mean and Std are the average and the standard deviation computed across all time steps in all" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.541, + 0.162 + ], + "angle": 0, + "content": "scenarios for all agents in the training batch:" + }, + { + "type": "equation", + "bbox": [ + 0.383, + 0.176, + 0.786, + 0.192 + ], + "angle": 0, + "content": "\\[\n\\tilde {R} _ {t, i} = \\left(R _ {t, i} - \\operatorname {M e a n} (R)\\right) / \\operatorname {S t d} (R). \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.204, + 0.786, + 0.234 + ], + "angle": 0, + "content": "We then apply the REINFORCE [35] method to compute a policy gradient for optimizing the model by differentiating the following surrogate objective:" + }, + { + "type": "equation", + "bbox": [ + 0.382, + 0.248, + 0.786, + 0.29 + ], + "angle": 0, + "content": "\\[\n\\max _ {\\pi_ {\\theta}} \\mathbb {E} _ {\\mathcal {D}} \\sum_ {t = 1} ^ {T _ {\\text {p r e d}}} \\sum_ {i \\in \\mathcal {I}} \\log \\pi_ {\\theta} \\left(a _ {t, i} \\mid o _ {t, i}\\right) \\tilde {R} _ {t, i}. \\tag {5}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.313, + 0.538, + 0.329 + ], + "angle": 0, + "content": "4.2 Policy Evaluation for Sim Agents" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.34, + 0.788, + 0.461 + ], + "angle": 0, + "content": "A key limitation of common \"imitative\" metrics (such as ADE), which compare model rollouts to ground truth trajectories, is the weak connection between the metric and the actual goal of assessing the AD planner performance. A low ADE metric does not guarantee good driving behaviors. Log-replay, for example, has a perfect ADE of zero but would be a poor choice for sim agents because it is non-reactive. To create an evaluation that has a direct connection to measuring the performance of the AD planners, we propose a new policy evaluation framework for sim agents, inspired by the RL policy evaluation literature [32]." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.462, + 0.788, + 0.719 + ], + "angle": 0, + "content": "Our policy evaluation framework involves ranking and scoring the performance of a predetermined collection of AD planner policies. This is analogous to a real-world use case where one must decide which planner to deploy from a collection of candidate software releases. A better sim-agent model will give a more accurate signal on which policy would be best when deployed in the real world. As shown in Fig. 4, we first prepare a batch of AD planner policies with known performance ranking. Then, we evaluate the performance of these AD planners when the traffic agents in the scenario are controlled by a sim agent model. Therefore, we will generate the estimated performance for those AD planners for the specific sim agent. We then measure the discrepancy between the estimated performance and the ground truth performance of those planners. This discrepancy becomes the measurement of the sim agents model's ability to assess the performance of the planners. Policy evaluation covers two important use cases for the sim agent models in the deployment of autonomous vehicles: evaluation, where we wish to estimate the performance of agents in the simulation, and selection, where we wish to determine a ranking or order between different deployment candidates." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.735, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Choice of policies. In order to perform policy evaluation, we must have a fixed set of policies on hand to rank or evaluate. To generate a large variety of planning policies with both good and bad performance, we propose to use a random shooting search-based policy family, parameterized by the number \\((J)\\) and depth \\((D)\\) of trajectories sampled. We compute a \"ground truth\" score for each policy by evaluating it with log playback agents. Note that the choice of ground truth is an important design decision. Any sim agent could serve as a ground truth," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.234, + 0.115, + 0.728, + 0.13 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.147, + 0.777, + 0.273 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.223, + 0.286, + 0.779, + 0.302 + ], + "angle": 0, + "content": "Fig. 4: We evaluate the sim agent by its ability to correctly assess the AD planner." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.327, + 0.784, + 0.357 + ], + "angle": 0, + "content": "but we need to pick one that is the most fair to all models and we believe log playback to be the most neutral." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.358, + 0.785, + 0.525 + ], + "angle": 0, + "content": "Our random shooting policy operates in a model-predictive control (MPC) fashion: at each time step, our random shooting policy samples from a fixed library of \\( J \\) trajectories, which are generated by maintaining a single steering wheel angle and acceleration for \\( D \\) steps. Note that this action specification is different from the action space of the MotionLM architecture we described in Sec. 4. We found this simple strategy to work much better than randomly selected actions. The trajectories are then scored by a reward function and the first step of the best scoring trajectory is executed. This process repeats for the entirety of the rollout. We used 16 different settings of \\( J \\), ranging between 9 to 81, and we used 4 values of depth \\( D \\in [6,8,12,16] \\). We then used the product of these two sets, for a total of 64 different policies evaluated." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.536, + 0.788, + 0.747 + ], + "angle": 0, + "content": "Reward Function. The reward function used for selecting actions from a set of candidate trajectories is a linear combination of collisions, as well as off-road and route-following infractions. We use a modified reward function from Eq. 2 by replacing the L2 norm from the ground truth (which is not available to the planner at execution time) with additional terms for following a reasonable path. We instead give the planner a high-level route in the form of waypoints, and we use a weighted sum of \\(-10C - O - R + 10^{-4}P\\), where \\(C \\in \\{0,1\\}\\) denotes the collision indicator and is 1 when a collision between AV and another object happens, \\(O \\in \\{0,1\\}\\) denotes the offroad indicator and is 1 when the AV is too close to the road edge, \\(R \\in \\{0,1\\}\\) denotes the off-route indicator which is 1 when the AV's lateral distance to the GT trajectory exceeds a threshold, and \\(P\\) is the projection of the AV's displacement between two time steps when projected onto the logged trajectory and measures the route-following behavior. We use Waymax [9]'s utility function to compute those metrics." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.767, + 0.376, + 0.784 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.785, + 0.842 + ], + "angle": 0, + "content": "We now describe our method's experimental results on the Waymo Open Sim Agents Challenge (WOSAC) [20] and on the Policy Evaluation task introduced in Sec. 4.2. Our experiments are designed to answer the following questions:" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.145, + 0.784, + 0.245 + ], + "angle": 0, + "content": "
Lin. Speed↑Lin. Acc.↑Ang. Speed↑Ang. Acc.↑Dist. to Obj.↑Collision↑TTC↑Dist. to Road Edge↑Offroad↑Composite↑ADE↓MinADE↓
Random0.0020.0440.0740.1200.0000.0000.7340.1780.2870.15550.73950.706
Constant Velocity0.0740.0580.0190.0350.2080.3450.7370.4540.4550.2877.9237.923
Wayformer0.3310.0980.4130.4060.2970.8700.7820.5920.8660.5752.4982.498
MVTE0.4450.2220.5350.4810.3830.8930.8320.6640.9080.6453.8591.674
Logged Oracle0.5610.3300.5630.4890.4851.0000.8810.7131.0000.7220.0000.000
Pre-trained (1M)0.3900.2350.5040.4470.3480.5440.8030.5820.5250.4906.3323.177
RL-only (1M)0.2570.1150.4870.4290.2440.2390.7590.4560.1640.3207.7856.918
Fine-tuned (1M)0.4120.2190.4510.4200.3480.8630.8140.6370.8040.5972.4361.867
Pre-trained (10M)0.4390.2410.5020.4540.3710.6730.8110.6250.6550.5494.5082.274
Fine-tuned (10M)0.4330.2200.4550.4230.3610.8770.8190.6470.8250.6082.4281.706
" + }, + { + "type": "table_footnote", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.327 + ], + "angle": 0, + "content": "Table 1: Results on the Waymo Open Sim Agents Challenge (WOSAC) benchmark. Metrics marked with \\((\\uparrow)\\) are better if higher, while metrics marked with \\((\\downarrow)\\) are better if lower. Fine-tuned agents score better than pre-trained agents on safety-critical metrics such as collision and offroad, which results in a significantly higher composite metric score. We bold the best results for the baseline agents and best results from the model we trained for this work." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.371, + 0.692, + 0.386 + ], + "angle": 0, + "content": "1. Does RL fine-tuning improve the overall sim agents behavior?" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.386, + 0.784, + 0.416 + ], + "angle": 0, + "content": "2. Can fine-tuning be used to improve targeted metrics through reward engineering?" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.416, + 0.784, + 0.446 + ], + "angle": 0, + "content": "3. Does the fine-tuned sim agents model provide better evaluation of AD planner performance?" + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.371, + 0.784, + 0.446 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.461, + 0.788, + 0.567 + ], + "angle": 0, + "content": "Dataset. We train our method and baselines on the Waymo Open Motion Dataset (WOMD) [15] and evaluate on the Waymo Open Sim Agents Challenge (WOSAC) benchmark [20]. WOMD contains scenarios recorded at \\(10\\mathrm{Hz}\\) including one second of history (11 discrete time steps), and 8 seconds of future states (80 time steps) to predict. In total, there are 486k training scenarios, 44k validation scenarios, and 45k test scenarios. Up to 128 agents are simulated in each scenario." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.581, + 0.808, + 0.642 + ], + "angle": 0, + "content": "Model. We use a pre-trained autoregressive motion prediction model MotionLM [28]. For the MotionLM model with 10M parameters, we use 4 encoder and 4 decoder layers. The hidden size is 256. The number of attention heads is 4. The activation is ReLU. The feed-forward network intermediate size is 1024." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.657, + 0.788, + 0.748 + ], + "angle": 0, + "content": "Training. We pre-train a MotionLM model on the WOMD training set with the objective in Eq. 1. The model is then used for RL fine-tuning. The encoder and the decoder of the model are fine-tuned jointly. 1M steps of updates are conducted both in pre-training and fine-tuning. At each training step, 128 scenarios are sampled from the dataset to form a batch. During RL fine-tuning, the learning rate is set to 5e-6 and the discount factor is set to 0.95." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.77, + 0.562, + 0.786 + ], + "angle": 0, + "content": "5.1 Waymo Open Sim Agents Challenge" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Baselines. We include several notable baselines reported by [20] on WOSAC. The \"random\" and \"constant velocity\" agents are included to provide a reasonable performance lower bound. The \"logged oracle\" represents the ground truth future" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.234, + 0.115, + 0.728, + 0.13 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.254 + ], + "angle": 0, + "content": "behavior that is not visible to other baselines and represents an upper-bound on performance. Wayformer [23] is a recent transformer-based model which shares the same encoder structure as our model. MVTE [34] is another transformer-based architecture which is the current state-of-the-art on the benchmark. Both Wayformer and MVTE adopt the agent-centric input representation. We also report the performance of our pre-trained 1M parameter and 10M parameter models, which are based on the MotionLM [28] architecture." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.267, + 0.788, + 0.448 + ], + "angle": 0, + "content": "Evaluation Metrics. The Waymo Open Sim Agents challenge evaluates agents on a wide range of likelihood-based metrics. These metrics are designed to measure realistic simulation in aggregate over the entire dataset, while allowing agents to have enough flexibility to deviate from the exact logged ground truth in each scenario. Each benchmarked method samples 32 rollouts for each WOMD test scenario. Metrics (such as velocity and heading angle) are then measured on these samples, but binned into discrete histograms, and the log-likelihood of the ground-truth data is measured under these histograms. The individual scores are then weighted and averaged to produce a final composite metric. In addition, following WOSAC [21] we also report the mean average displacement error (ADE) over 32 rollouts and the minimum average displacement error (minADE) over 32 rollouts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.462, + 0.788, + 0.644 + ], + "angle": 0, + "content": "Results. We report our results on WOSAC in Table 1. The results provide strong evidence that closed-loop fine-tuning from a pre-trained model can significantly improve performance of the model as a sim agent. We see that both the \"Finetuned 1M\" and \"Finedtuned 10M\" models perform better than \"Pre-trained 1M\" and \"Pre-trained 10M\", respectively. When we look at the breakdown of the constituent metrics, we see that most of the gains come from improved safety-critical metrics such as collision and offroad. As a concrete example, Fig. 5 illustrates a single scenario comparing a rollout from a pre-trained 1M parameter model with a fine-tuned model. The pre-trained model is prone to slowly drifting away from the ground truth trajectory, a distribution shift problem commonly impacting pure imitative and teacher forcing [27] methods. By training the model in closed-loop, we can mitigate this distribution shift issue." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.645, + 0.788, + 0.749 + ], + "angle": 0, + "content": "The composite performance of \"Fine-tuned 10M\" is still lower than the state-of-the-art MVTE [34] model. We believe this can be mostly attributed to the choice of our pre-trained baseline model, which was our re-implemented version of the MotionLM [28] architecture with the encoder architecture of Wayformer [23]. We leave the fine-tuning of MVTE using the same methodology described in this work as future work, which we hypothesize would lead to a sizeable performance gain." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "To measure the effect of reward engineering and the ability to target specific metrics with fine-tuning, we ran an ablation study varying the relative weight \\(\\lambda\\) of the collision metric in Eq. 2, with results reported in Table 2. We fine-tuned the 1M parameter model with 4 different collision weights, and reported the collision score versus the ADE of the predictions. We can clearly see that adding some amount of collision penalty improves the collision metric at the cost" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.145, + 0.49, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.31, + 0.464, + 0.398, + 0.474 + ], + "angle": 0, + "content": "Pre-trained Model" + }, + { + "type": "image", + "bbox": [ + 0.515, + 0.145, + 0.785, + 0.462 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.607, + 0.464, + 0.693, + 0.474 + ], + "angle": 0, + "content": "Fine-tuned Model" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.487, + 0.788, + 0.585 + ], + "angle": 0, + "content": "Fig. 5: Visualization of scenario rollouts using a pre-trained and a fine-tuned model. The start locations of vehicles are marked with a red star, the ground truth futures are marked with a solid black line, and the sampled trajectory is marked with circles of different colors. Left: The pre-trained model suffers from drifting due to distributional shift between training (with teacher forcing) and testing (with an autoregressive rollout). Right: The fine-tuned model is able to follow the ground truth much more precisely, which is quantitatively demonstrated by the better ADE metric." + }, + { + "type": "table", + "bbox": [ + 0.286, + 0.604, + 0.72, + 0.693 + ], + "angle": 0, + "content": "
Collision WeightCollision ↑TTC ↑Composite ↑ADE ↓MinADE ↓
00.8340.8100.5902.4051.871
20.8630.8140.5972.4361.867
50.8440.8170.5952.8381.980
100.8310.8170.5943.0582.023
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.693, + 0.788, + 0.749 + ], + "angle": 0, + "content": "Table 2: WOSAC benchmark scores for different values of the collision fine-tuning weight \\(\\lambda\\) with the 1M parameter model. Increasing the collision weight improves the collision score at the cost of decreasing imitative behavior metrics such as ADE. We find a good balance at an intermediate value." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "of degrading the ADE metric. This generally makes sense, as the optimization must trade-off the collision penalty versus the displacement error terms in the reward function. However, we also see that at very high values of the collision" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.233, + 0.115, + 0.728, + 0.131 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.128 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.195 + ], + "angle": 0, + "content": "weight, all metrics tend to degrade, and the best result is with an intermediate cost weight. We hypothesize this is the case because displacement error is a very dense and rich reward signal, whereas collision is a more sparse and noisy signal." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.223, + 0.409, + 0.239 + ], + "angle": 0, + "content": "5.2 Policy Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.257, + 0.789, + 0.438 + ], + "angle": 0, + "content": "As described in Sec. 4.2, we also propose to evaluate sim agents through the lens of policy evaluation. In particular, we follow the methodology proposed by [8] and report two metrics used in their benchmark: Spearman's rank correlation and absolute error. Rank correlation is a metric for \"selection\" and measures the ability for the simulation to discern between good and bad policies (AD planners). This is useful for the problem setting where one must select the best policy to deploy from a set of candidates. On the other hand, absolute error is a metric for \"evaluation\" and measures how closely a simulation comes close to estimating the true cost or reward accrued by the policy. This is useful if one is interested in concrete performance numbers such as estimating the rate of a particular event of interest. The sim agent causing less absolute error and higher rank correlation is better for evaluating different planners." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.44, + 0.79, + 0.712 + ], + "angle": 0, + "content": "Given a set of planners with known performance ranking, we assess sim agents by measuring how well they estimate the value function of each planner. We generate a Monte-Carlo estimate of each planner's value by running it on each scenario, where all traffic participants are controlled by the sim agent, and computing the empirical returns of the planner. The returns are then averaged across all scenarios in the WOMD test set to form the estimate of the planner. The value estimates are then compared to a \"ground-truth value\", and we show two quantities, rank correlation and absolute error in Table 3 and Table 4, respectively. Each row in these tables represents the policy evaluation results of a sim agent. A sim agent will generate \\( K = 64 \\) estimated returns of \\( K \\) policies (AD planners). Due to the absence of real-world simulation, there is no a universal ground truth sim agent that can fully replicate the realistic behaviors. We cannot know the ground truth returns when running these \\( K \\) policies in the real world. In this work, we picked the log-playback sim agent as the \"ground truth sim agent\" and considered the average returns of these \\( K \\) policies when running with the log-playback sim agent as the ground truth value. These form the Log column in Table 3 and Table 4. We also show rank correlation and absolute error relative to each other sim agent we considered for completeness." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Results. Our results are reported in Table 3 and Table 4. We report results on a total of 64 candidate policies created by varying the depth (D) and the number of sampled trajectories (J). According to the Log column, we see that with fine-tuned models, a higher rank correlation and lower absolute error relative to the log-playback sim agent can be achieved, indicating that the fine-tuned models are more accurate at measuring a planner's performance and deciding whether the planner is better than another." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "table", + "bbox": [ + 0.277, + 0.145, + 0.728, + 0.221 + ], + "angle": 0, + "content": "
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M0.859-0.9540.9530.911
Fine-tuned 1M0.8650.954-0.9590.925
Pre-trained 10M0.8450.9530.959-0.932
Fine-tuned 10M0.8660.9110.9250.932-
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.221, + 0.787, + 0.29 + ], + "angle": 0, + "content": "Table 3: Policy evaluation rank correlation results for pre-trained and fine-tuned models (higher is better). Each cell corresponds to a ranking correlation of estimated returns of a set of predefined AD planners between two sim agent models. For example, the highlighted Fine-tuned 10M - Log means the ranking correlation of predefined AD planners when using the Fine-tuned 10M and the log-playback sim agents." + }, + { + "type": "table", + "bbox": [ + 0.276, + 0.318, + 0.728, + 0.392 + ], + "angle": 0, + "content": "
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M10.518-0.5570.5511.013
Fine-tuned 1M10.1010.557-0.4260.729
Pre-trained 10M10.0140.5510.426-0.602
Fine-tuned 10M9.5091.0130.7290.602-
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.392, + 0.787, + 0.42 + ], + "angle": 0, + "content": "Table 4: Policy evaluation rank absolute error results for pre-trained and fine-tuned models (lower is better)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.461, + 0.36, + 0.477 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.493, + 0.787, + 0.674 + ], + "angle": 0, + "content": "We studied the viability of applying the popular \"pre-training and fine-tuning\" scheme to modeling traffic agents for AD simulation. We drew the connection between a multi-agent driving behavior model and a simulation environment - the multi-agent behavior model itself can be used to perform rollouts for closed-loop training. By using an on-policy RL algorithm with a simple reward, we are able to fine-tune a pre-trained large multi-agent behavior model to effectively align the traffic agent behaviors with human expectations, such as collision avoidance. The experimental results show that our method can significantly improve the performance of the pre-trained model on the Waymo Open Sim Agent Challenge (WOSAC) [20]. We also proposed a novel policy evaluation task and demonstrated that the model fine-tuned by our method can achieve more reliable AD testing result." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Limitations. There are several limitations to the approach we have discussed in this paper. We use a simple transition and action model (based on predicting accelerations and integrating them to estimate positions) as the environment dynamics model, which could produce kinematically unrealistic behaviors during a rollout. A more realistic solution would be to embed a low-level controller into simulation that attempts to reach the positions predicted by the model. In addition, we studied a reward function (Eq. 2) that encourages collision avoidance and minimizes divergence in closed-loop simulation. The reward function can be extended to induce various driving behaviors, such as encouraging adversarial behavior (e.g. using the negative of the ego vehicle's reward) to stress-test challenging scenarios." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.234, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.179, + 0.785, + 0.208 + ], + "angle": 0, + "content": "1. Argall, B.D., Chernova, S., Veloso, M., Browning, B.: A survey of robot learning from demonstration. Robotics and autonomous systems 57(5), 469-483 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.209, + 0.785, + 0.263 + ], + "angle": 0, + "content": "2. Bergamini, L., Ye, Y., Scheel, O., Chen, L., Hu, C., Del Pero, L., Osinski, B., Grimmett, H., Ondruska, P.: Simnet: Learning reactive self-driving simulations from real-world observations. In: 2021 IEEE International Conference on Robotics and Automation (ICRA). pp. 5119-5125. IEEE (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.264, + 0.785, + 0.292 + ], + "angle": 0, + "content": "3. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.293, + 0.785, + 0.335 + ], + "angle": 0, + "content": "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.335, + 0.785, + 0.376 + ], + "angle": 0, + "content": "5. Codevilla, F., Müller, M., López, A., Koltun, V., Dosovitskiy, A.: End-to-end driving via conditional imitation learning. In: 2018 IEEE international conference on robotics and automation (ICRA). pp. 4693-4700. IEEE (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.377, + 0.785, + 0.418 + ], + "angle": 0, + "content": "6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: CARLA: An open urban driving simulator. In: Proceedings of the 1st Annual Conference on Robot Learning. pp. 1-16 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.785, + 0.461 + ], + "angle": 0, + "content": "7. Feng, L., Li, Q., Peng, Z., Tan, S., Zhou, B.: Trafficgen: Learning to generate diverse and realistic traffic scenarios. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3567-3575. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.462, + 0.785, + 0.503 + ], + "angle": 0, + "content": "8. Fu, J., Norouzi, M., Nachum, O., Tucker, G., Novikov, A., Yang, M., Zhang, M.R., Chen, Y., Kumar, A., Paduraru, C., et al.: Benchmarks for deep off-policy evaluation. In: International Conference on Learning Representations (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.504, + 0.785, + 0.545 + ], + "angle": 0, + "content": "9. Gulino, C., Fu, J., Luo, W., Tucker, G., Bronstein, E., Lu, Y., Harb, J., Pan, X., Wang, Y., Chen, X., et al.: Waymax: An accelerated, data-driven simulator for large-scale autonomous driving research. arXiv preprint arXiv:2310.08710 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.546, + 0.785, + 0.601 + ], + "angle": 0, + "content": "10. Hu, Y., Yang, J., Chen, L., Li, K., Sima, C., Zhu, X., Chai, S., Du, S., Lin, T., Wang, W., et al.: Planning-oriented autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17853-17862 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.602, + 0.785, + 0.671 + ], + "angle": 0, + "content": "1. Kamenev, A., Wang, L., Bohan, O.B., Kulkarni, I., Kartal, B., Molchanov, A., Birchfield, S., Nister, D., Smolyanskiy, N.: Predictionnet: Real-time joint probabilistic traffic prediction for planning, control, and simulation. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 8936-8942. IEEE (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.672, + 0.785, + 0.699 + ], + "angle": 0, + "content": "2. Leurent, E.: An environment for autonomous driving decision-making. https://github.com/eleurent/highway-env (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.7, + 0.785, + 0.741 + ], + "angle": 0, + "content": "3. Li, Q., Peng, Z., Feng, L., Liu, Z., Duan, C., Mo, W., Zhou, B.: ScenarioNet: Open-source platform for large-scale traffic scenario simulation and modeling. Advances in Neural Information Processing Systems (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.742, + 0.785, + 0.784 + ], + "angle": 0, + "content": "4. Li, Q., Peng, Z., Feng, L., Zhang, Q., Xue, Z., Zhou, B.: Metadrive: Composing diverse driving scenarios for generalizable reinforcement learning. IEEE transactions on pattern analysis and machine intelligence (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.718, + 0.798 + ], + "angle": 0, + "content": "5. LLC, W.: Waymo open dataset: An autonomous driving dataset (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "6. Lu, J., Batra, D., Parikh, D., Lee, S.: Vilbert: Pretraining task-agnostic visiolinguistic representations for vision-and-language tasks. Advances in neural information processing systems 32 (2019)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.179, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.129 + ], + "angle": 0, + "content": "Z. Peng et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.217 + ], + "angle": 0, + "content": "17. Lu, Y., Fu, J., Tucker, G., Pan, X., Bronstein, E., Roelofs, R., Sapp, B., White, B., Faust, A., Whiteson, S., et al.: Imitation is not enough: Robustifying imitation with reinforcement learning for challenging driving scenarios. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 7553-7560. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.787, + 0.259 + ], + "angle": 0, + "content": "18. Mendez-Lucio, O., Nicolaou, C.A., Earnshaw, B.: Mole: a molecular foundation model for drug discovery. In: NeurIPS 2022 Workshop on Learning Meaningful Representations of Life (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.26, + 0.787, + 0.286 + ], + "angle": 0, + "content": "19. Min, C., Zhao, D., Xiao, L., Nie, Y., Dai, B.: Uniworld: Autonomous driving pretraining via world models. arXiv preprint arXiv:2308.07234 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.328 + ], + "angle": 0, + "content": "20. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.787, + 0.37 + ], + "angle": 0, + "content": "21. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.787, + 0.412 + ], + "angle": 0, + "content": "22. Moor, M., Banerjee, O., Abad, Z.S.H., Krumholz, H.M., Leskovec, J., Topol, E.J., Rajpurkar, P.: Foundation models for generalist medical artificial intelligence. Nature 616(7956), 259-265 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.787, + 0.467 + ], + "angle": 0, + "content": "23. Nayakanti, N., Al-Rfou, R., Zhou, A., Goel, K., Refaat, K.S., Sapp, B.: Wayformer: Motion forecasting via simple & efficient attention networks. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 2980-2987. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.503, + 0.48 + ], + "angle": 0, + "content": "24. OpenAI: Gpt-4 technical report (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.481, + 0.787, + 0.535 + ], + "angle": 0, + "content": "25. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. Advances in Neural Information Processing Systems 35, 27730-27744 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.787, + 0.577 + ], + "angle": 0, + "content": "26. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.787, + 0.632 + ], + "angle": 0, + "content": "27. Ross, S., Gordon, G., Bagnell, D.: A reduction of imitation learning and structured prediction to no-regret online learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 627-635. JMLR Workshop and Conference Proceedings (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.787, + 0.687 + ], + "angle": 0, + "content": "28. Seff, A., Cera, B., Chen, D., Ng, M., Zhou, A., Nayakanti, N., Refaat, K.S., Al-Rfou, R., Sapp, B.: Motionlm: Multi-agent motion forecasting as language modeling. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8579-8590 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.688, + 0.787, + 0.729 + ], + "angle": 0, + "content": "29. Shi, S., Jiang, L., Dai, D., Schiele, B.: Motion transformer with global intention localization and local movement refinement. Advances in Neural Information Processing Systems 35, 6531-6543 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.729, + 0.787, + 0.771 + ], + "angle": 0, + "content": "30. Shi, S., Jiang, L., Dai, D., Schiele, B.: Mtr++: Multi-agent motion prediction with symmetric scene modeling and guided intention querying. arXiv preprint arXiv:2306.17770 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.787, + 0.813 + ], + "angle": 0, + "content": "31. Suo, S., Regalado, S., Casas, S., Urtasun, R.: Trafficsim: Learning to simulate realistic multi-agent behaviors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10400-10409 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.814, + 0.787, + 0.84 + ], + "angle": 0, + "content": "32. Uehara, M., Shi, C., Kallus, N.: A review of off-policy evaluation in reinforcement learning. arXiv preprint arXiv:2212.06355 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.234, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "33. Vinitsky, E., Lichtlé, N., Yang, X., Amos, B., Foerster, J.: Nocturne: a scalable driving benchmark for bringing multi-agent learning one step closer to the real world. Advances in Neural Information Processing Systems 35, 3962-3974 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.19, + 0.787, + 0.218 + ], + "angle": 0, + "content": "34. Wang, Y., Zhao, T., Yi, F.: Multiverse transformer: 1st place solution for waymo open sim agents challenge 2023. arXiv preprint arXiv:2306.11868 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.786, + 0.244 + ], + "angle": 0, + "content": "35. Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8, 229-256 (1992)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.245, + 0.787, + 0.273 + ], + "angle": 0, + "content": "36. Zhang, C., Tu, J., Zhang, L., Wong, K., Suo, S., Urtasun, R.: Learning realistic traffic agents in closed-loop. In: 7th Annual Conference on Robot Learning (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.787, + 0.327 + ], + "angle": 0, + "content": "37. Zhang, Q., Gao, Y., Zhang, Y., Guo, Y., Ding, D., Wang, Y., Sun, P., Zhao, D.: Trajgen: Generating realistic and diverse trajectories with reactive and feasible agent behaviors for autonomous driving. IEEE Transactions on Intelligent Transportation Systems 23(12), 24474-24487 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.787, + 0.369 + ], + "angle": 0, + "content": "38. Zhang, Z., Liniger, A., Dai, D., Yu, F., Van Gool, L.: Trafficbots: Towards world models for autonomous driving simulation and motion prediction. arXiv preprint arXiv:2303.04116 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.37, + 0.787, + 0.424 + ], + "angle": 0, + "content": "39. Zhong, Z., Rempe, D., Xu, D., Chen, Y., Veer, S., Che, T., Ray, B., Pavone, M.: Guided conditional diffusion for controllable traffic simulation. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3560-3566. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.467 + ], + "angle": 0, + "content": "40. Zhou, C., Li, Q., Li, C., Yu, J., Liu, Y., Wang, G., Zhang, K., Ji, C., Yan, Q., He, L., et al.: A comprehensive survey on pretrained foundation models: A history from bert to chatgpt. arXiv preprint arXiv:2302.09419 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.787, + 0.563 + ], + "angle": 0, + "content": "41. Zhou, M., Luo, J., Villella, J., Yang, Y., Rusu, D., Miao, J., Zhang, W., Alban, M., Fadakar, I., Chen, Z., Huang, A.C., Wen, Y., Hassanzadeh, K., Graves, D., Chen, D., Zhu, Z., Nguyen, N., Elsayed, M., Shao, K., Ahilan, S., Zhang, B., Wu, J., Fu, Z., Rezaee, K., Yadmellat, P., Rohani, M., Nieves, N.P., Ni, Y., Banijamali, S., Rivers, A.C., Tian, Z., Palenicek, D., bou Ammar, H., Zhang, H., Liu, W., Hao, J., Wang, J.: Smarts: Scalable multi-agent reinforcement learning training school for autonomous driving (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.787, + 0.605 + ], + "angle": 0, + "content": "42. Zhou, Y., Chia, M.A., Wagner, S.K., Ayhan, M.S., Williamson, D.J., Struyven, R.R., Liu, T., Xu, M., Lozano, M.G., Woodward-Court, P., et al.: A foundation model for generalizable disease detection from retinal images. Nature pp. 1-8 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.787, + 0.647 + ], + "angle": 0, + "content": "43. Zitkovich, B., Yu, T., Xu, S., Xu, P., Xiao, T., Xia, F., Wu, J., Wohlhart, P., Welker, S., Wahid, A., et al.: Rt-2: Vision-language-action models transfer web knowledge to robotic control. In: 7th Annual Conference on Robot Learning (2023)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.647 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_origin.pdf b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8df9d23c26b42a6079a459789211649e47eb8c18 --- /dev/null +++ b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/4493735f-e7ad-4f7b-b338-224421df7970_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b6ab14344ab06b259af406a44380ee7decf07ac260f2121d2f6dd6ca80339ca3 +size 3564849 diff --git a/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/full.md b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/full.md new file mode 100644 index 0000000000000000000000000000000000000000..719c8ff30e7f953aae8df301f4867d24b76a5117 --- /dev/null +++ b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/full.md @@ -0,0 +1,271 @@ +# Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving + +Zhenghao Peng $^{1*}$ , Wenjie Luo $^{2}$ , Yiren Lu $^{2}$ , Tianyi Shen $^{2}$ , Cole Gulino $^{2}$ , Ari Seff $^{2}$ , and Justin Fu $^{2}$ + +$^{1}$ UCLA, $^{2}$ Waymo + +Abstract. A major challenge in autonomous vehicle research is modeling agent behaviors, which has critical applications including constructing realistic and reliable simulations for off-board evaluation and forecasting traffic agents motion for onboard planning. While supervised learning has shown success in modeling agents across various domains, these models can suffer from distribution shift when deployed at test-time. In this work, we improve the reliability of agent behaviors by closed-loop fine-tuning of behavior models with reinforcement learning. Our method demonstrates improved overall performance, as well as targeted metrics such as collision rate, on the Waymo Open Sim Agents challenge. Additionally, we present a novel policy evaluation benchmark to directly assess the ability of simulated agents to measure quality of autonomous vehicle planners and demonstrate the effectiveness of our approach on this new benchmark. + +Keywords: Autonomous Driving $\cdot$ Reinforcement Learning $\cdot$ Policy Evaluation $\cdot$ Behavior Prediction + +# 1 Introduction + +Transformer-based architectures have demonstrated state-of-the-art performance in a variety of tasks in language [24], vision [26], and robotics [43]. The success of these models is credited to a widely adopted "pre-training and fine-tuning" scheme [40]. In the pre-training phase, the model ac + +requires knowledge from a very large amount of training data; during fine-tuning, the model behaviors are rectified to align with human preferences and expectations. While supervised learning can be used for fine-tuning, previous work has shown superior performance with reinforcement learning (RL) fine-tuning in language tasks [25] and text-to-image generation [3]. In autonomous driving + +![](images/02bb7ed5dab7056d962be9c97cc408ce7a3870bbe900962b0e5f111a3b786b0f.jpg) +Fig.1: We propose to fine-tune a pre-trained motion prediction model with closed-loop reinforcement learning. + +![](images/bcd384eef861d32e03d78ae9190987acfd8a108336500d6a43a552d698fbdfb6.jpg) +Fig. 2: Left: The agent is trained from scratch using a combined Behavioral Cloning (BC) and Reinforcement Learning (RL) approach. Without pre-training on large datasets, the agent must simultaneously explore the environment and develop its capabilities from scratch. Right: The agent undergoes a two-phase training scheme. Agent acquires a foundational skill set from aligning its actions (green) with ground truth data in pre-training (gray). The fine-tuning through RL refines the agent behaviors in the autoregressive rollout. + +(AD), given the abundance of human driving data, a natural question arises: Can we leverage the popular "pre-training and RL fine-tuning" strategy to effectively model agent behaviors? + +In this paper, we investigate the viability of applying the "pre-training and RL fine-tuning" paradigm to model the behaviors of traffic agents in AD scenarios. Such models can be applied in critical AD tasks such as simulation agents (sim agents) [20], enabling high-fidelity simulation systems for off-board evaluation, and behavior prediction for surrounding traffic participants, facilitating onboard planning. + +Behavioral cloning (BC), or training an imitative model using supervised learning on demonstrations [1], has been the predominant approach for learning driving agents [5, 34]. While BC provides supervision for modeling realistic behavior, during closed-loop simulation, the agent behaviors can deviate from the training distribution, known as the "covariate shift" issue [27]. Moreover, BC lacks the ability to explicitly incorporate human preferences, expectations and constraints. For example, safety-critical events, such as collisions, are only implicitly discouraged in the BC loss due to their rarity in human driving datasets. In situations where a collision is likely to occur, the model may only have limited examples to learn from. RL fine-tuning can address these limitations. Firstly, RL learns from closed-loop synthetic rollouts, addressing the covariate shift problem as the reward function penalizes actions leading to future trajectories that diverge from ground-truth. Secondly, explicit objectives can be incorporated into the reward function so the agents can learn to align with human preferences and expectations. + +Inspired by the success of fine-tuning large language models to align with human preferences, we apply the "pre-training and RL fine-tuning" scheme to training behavior models for sim agents. As demonstrated in Fig. 1, we can fine-tune a pre-trained model via a simple on-policy RL approach with autoregressive + +rollouts. We propose a simple reward function that not only enables the model to satisfy human preferences on the agent behaviors, but also maintains human likeness. + +Our experiments on the Waymo Open Sim Agent Challenge (WOSAC) [20] demonstrate that RL fine-tuning significantly improves the reliability of the agent behaviors, especially in terms of collision avoidance. An important application of the learned behaviors is in actuating the traffic agents in AD simulation. We study the reliability of the learned models in a novel planner evaluation benchmark. The intuition is that a simulator with more realistic sim agents model should provide more reliable evaluation across ego AD planners. With this insight, we use different sim agents model to control the traffic agents and assess the performance of a predefined set of AD planners. By comparing the planners' estimated performance as evaluated by the sim agents model against their known performance ranking, we find that our fine-tuned models provide more accurate planner evaluations. This indicates that our approach is beneficial for testing autonomous driving planners. The main contributions of this work are: + +1) We propose to apply the popular "pre-training and RL fine-tuning" paradigm commonly used for large language models (LLMs) to the autonomous driving behavior modeling problem, demonstrating the effectiveness of closed-loop finetuning a Transformer-based architecture on the Waymo Open Motion Dataset (WOMD) [15]. +2) We demonstrate that an on-policy RL algorithm with a simple reward function can successfully preserve the realism in the dataset while aligning human preferences on safety and reliability. +3) To better evaluate the performance of sim agents models, we propose a novel planner evaluation task and demonstrate that our method can significantly improve the performance of the sim agents models in terms of its capability to assess the AD planners. + +# 2 Related Work + +# 2.1 Pre-training and Fine-tuning of Transformer-based Models + +Transformer-based models have been applied to various domains such as text generation [4], image generation [26], robotics [43], drug discovery [18], disease diagnose [42], and generalist medical AI [22]. Many large Transformer-based models are trained in the "pre-training then fine-tuning" manner, where supervised fine-tuning [40] or reinforcement learning with human feedback [25] holds the promise to align the model behaviors to human preferences. In the autonomous driving domain, similar Transformer-based architectures have been applied to various tasks, ranging from perception [19], motion prediction [23], self-driving policies [10] and simulation [31,38,39]. In this work, we focus on the motion prediction problem, where predictors forecast the future trajectories of the target agents by observing history information [23, 29, 30]. Unlike foundational models in other domains such as large language models [24] and vision + +language models [16], motion prediction models are most commonly trained via supervised learning and rarely fine-tuned to better boost alignment with human preferences. + +# 2.2 Behavior Modeling for Autonomous Driving + +Modeling the behavior of traffic participants is a critical task in many autonomous driving systems, particularly for constructing realistic simulation to test the AD planners. Most existing simulators [6,12,41] rely on hand-crafted rules for traffics and maps generation. However, the data distributions for the map structure, traffic flow, the interaction between traffic participants and other elements do not realistically represent the real world. Modern data-driven simulators [9,13,14,33] address this by replaying the behaviors of the traffic participants from real-world scenarios recorded by an autonomous vehicle (log-replay). Yet, the downside of log-replay is that re-simulation may become unrealistic when the planner behavior diverges from the original logged behavior. For example, if an AD planner is more cautious than the human driver and brakes earlier, the trailing vehicle might collide into it, leading to a false positive collision. + +In this work, we mainly focus on the simulation agents task and evaluate our solutions on the Waymo Open Sim Agent Challenge (WOSAC) [20]. Many existing WOSAC submissions apply the marginal motion prediction models [2,7,29], which typically take initial states and predict the positions of traffic participants at all future steps in a single inference (one-shot). Those marginal models do not explicitly model interactions between agents during the prediction horizon. The autoregressive (AR) models naturally fit to the driving behavior modeling, especially in the context of closed-loop simulation [11,28,31,38]. AR decoding [28] allows the interactions between agents to be modeled via a self-attention mechanism at each step of the decoding process. However, closed-loop training of the AR behavior prediction models remains an understudied area. We propose to improve a pre-trained AR model with closed-loop fine-tuning and evaluate the performance on the WOSAC benchmark. + +In contrast to prior research on combining behavior cloning and reinforcement learning [17,36,37], our approach eliminates the need for an external simulator and a dynamics model. Since our model predicts actions for all agents, it functions as a simplified simulation environment itself. From an algorithmic perspective, we avoid back-propagation through time (BPTT) used in existing works [11,36]. Instead, we propose that RL can be conducted with a minimalistic policy gradient algorithm [35]. This allows us to use non-differentiable rewards (such as a boolean collision indicator) and non-differentiable models with discrete outputs which would not be possible with BPTT. + +# 3 Preliminaries + +Motion Prediction. A driving scenario includes static information such as the map topology and dynamic information such as the states of traffic participants + +and traffic lights. At each time step, the state of a traffic participant is represented by a feature vector containing the position, velocity, and heading angle in global frame, and the object type (vehicle, cyclist, pedestrian). For traffic lights, the feature vector contains their position and state (green, yellow, red or unknown). Given the history states of $N$ traffic participants with indices $\mathcal{I} = [1\ldots N]$ , the goal of motion prediction is to predict future trajectories, i.e. the positions in future steps, of these agents. + +Behavior Modeling as a Multi-Agent RL Problem. We consider driving behavior modeling as a Multi-agent Markov Decision Process (Multi-agent MDP). The Multi-agent MDP is defined by the tuple $\langle \mathcal{I},\mathcal{S},\{\mathcal{A}_i\} ,\mathcal{T},\{\mathcal{R}_i\} ,\Omega ,\{\mathcal{O}_i\} ,\gamma \rangle$ where $\mathcal{S}$ is the joint state space, $\mathcal{A} = \times_{i}\mathcal{A}_{i}$ is the joint action space, the transition function is $\mathcal{T}:S\times \mathcal{A}\to S$ , the reward functions are $\mathcal{R}_i(s_t,a_{t,i},s_{t + 1}),\forall i\in \mathcal{I}$ the observation space is $\varOmega=\times_i\varOmega_i$ , the observation functions $\mathcal{O}_i$ , and the discount factor is $\gamma$ . In this Multi-agent MDP, the goal is to learn action policies $\pi_i:\mathcal{A}_i\times \varOmega_i\rightarrow [0,1]$ for each agent. Each agent aims to maximize its expected cumulative return: $\pi_{i} = \arg \max_{\pi}\mathbb{E}_{\tau \sim P_{\pi_{j},\forall j\in \mathcal{I}}}\left[\sum_{t = 1}^{T_{\mathrm{future}}}\gamma^{t}r_{t,i}\right]$ where $\tau = (\mathbf{s}_0,\mathbf{a}_0,\dots,\mathbf{s}_T,a_T)$ is the joint future rollout obtained by executing the learned policy model conditioned on the initial state. Here, $\mathbf{a}_t = \{a_{t,i}\}_{i\in \mathcal{I}}$ is the joint actions. + +Autoregressive Encoder-Decoder Architecture. We use MotionLM [28], an encoder-decoder transformer-based autoregressive motion prediction model. The model's encoder takes a set of tokens representing the initial states of the scenarios as input and generates a scene embedding. These initial states include the traffic lights states, map topology, and the history information of all traffic participants. During inference, we run the decoder for $T_{\mathrm{pred}}$ prediction steps to autoregressively generate the prediction of all agents. At each prediction step, the decoder takes a set of motion tokens as well as the scene embedding as input and gener + +![](images/cf17228658984bf4c87013dc8a07dd932cde85f94e188608a2027287fcdfb5a4.jpg) +Fig. 3: The causal mask in the decoder. + +ates a distribution of $N$ output tokens. The decoder consists of multiple layers, each applying self-attention among input tokens and cross-attention to the scene embedding. All $N$ motion tokens at step $t$ can attend to each other and all previous tokens as shown in Fig. 3, where each row represents a query token and each column a key token and green blocks indicate key tokens that the query can attend. After running $T_{\mathrm{pred}}$ prediction steps, the $T_{\mathrm{pred}} \times N$ output motion tokens form complete trajectories for $N$ agents. This autoregressive approach ensures that each agent's action is based on a temporally causal relationship with the previous actions of all traffic participants, leading to improved modeling of interaction between agents within the prediction horizon. + +We modify the original MotionLM model by adopting a scene-centric input format and predicting the motion of all agents, rather than using a pre-selected + +subset. The scene-centric representation and the encoder-decoder architecture enable more computationally efficient encoding of the scene context and prediction of all agents' motion. + +# 4 Method + +As shown in Algorithm 1, our method has two stages. In the pre-training stage, we reconstruct the ground truth actions from the data and use the maximum likelihood objective to match the joint action distribution of observed behaviors in the dataset: + +$$ +\max _ {\pi_ {\theta}} \mathbb {E} _ {\mathcal {D}} \sum_ {t = 1} ^ {T _ {\text {p r e d}}} \sum_ {i \in \mathcal {I}} \log \pi_ {\theta} \left(a _ {t, i} ^ {\mathrm {G T}} \mid o _ {t, i}\right). \tag {1} +$$ + +The second stage of our learning process fine-tunes the model using reinforcement learning (RL). We formalize the problem as a Multi-agent Markov Decision Process (MDP) for our behavior modeling task as follows: + +Action. The action space $\mathcal{A} = \times_{i}\mathcal{A}_{i}$ : The action space for each agent $\mathcal{A}_i$ is a Verlet-wrapped delta action space [28], where each action represents the X, Y acceleration in scene coordinates. To reconstruct the ground truth action targets, we first infer the accelerations by differentiating the observed positions in the data. These accelerations are then discretized into a $13\times 13$ uniformly spaced grid, where outliers are clipped to the minimum and maximum values of $6m / s^2$ . + +State. The state space $S$ contains map features, the joint state of all objects and traffic lights. + +Transition Dynamics. Agents transit to new positions computed by adding previous positions with an offset: $pos_{t+1,i} = (a_{t,i}\Delta + vel_{t,i})\Delta + pos_{t,i}$ wherein the velocity $vel_{t,i}$ and the position $pos_{t,i}$ are in $s_t$ and $\Delta$ is the time interval between steps. + +Observation. We define observations to consist of a historic context $c$ , previous actions of all objects and the agent identity: $o_{t,i} = (c, \mathbf{a}_1, \dots, \mathbf{a}_{t-1}, i)$ . Here, the context $c = (\{m_i\}_M, s_{T_{\mathrm{prev}}}, \dots, s_0)$ is a set containing $M$ map features and the object and traffic light states for history steps $t = T_{\mathrm{prev}}, \dots, 0$ . + +# 4.1 RL Fine-tuning + +We propose to fine-tune a pre-trained autoregressive motion predictor with RL. The reward function for each agent at each step is defined as: + +$$ +r _ {t, i} = - \left\| P o s _ {t, i} - G T _ {t, i} \right\| _ {2} - \lambda C o l l _ {t, i}, \tag {2} +$$ + +where $Post_{t,i}$ is the position of agent $i$ in step $t$ and $GT_{t,i}$ is the corresponding position in the logged trajectory. $Coll_{t,i}$ is a Boolean indicator and will be 1 if the bounding box of agent $i$ intersects with others' bounding boxes. This reward function, while simple, captures the key objectives of preserving the behavioral realism as well as satisfying the safety constraint of collision avoidance. + +Algorithm 1: Pre-train and fine-tune an autoregressive motion predictor. +input: Large-scale driving dataset $\mathcal{D}$ output:A Sim Agent policy $\pi_{\theta}$ +1 Initialize model parameters $\theta$ and model $\pi_{\theta}$ +2 for pre-training iterations $j = 1,\dots$ do +3 Retrieve $\mathbf{s}_{\mathrm{history}},\mathbf{s}_{\mathrm{GT}}$ from $\mathcal{D}$ +4 Construct target actions $\mathbf{a}_{\mathrm{GT}} = \{a_{t,i}^{\mathrm{GT}},\forall t,i\}$ and construct the observation $o_{t,i}$ with GT actions. +5 Run the model with the observation and get the predicted actions $\{a_{t,i},\forall t,i\}$ +6 Update $\pi_{\theta}$ via Eq. 1. +7 for fine-tuning iterations $j = 1,\dots$ do +8 Retrieve $\mathbf{s}_{\mathrm{history}}$ from $\mathcal{D}$ ; Set ${\bf a}_0\gets$ . +9 for $t = 1,\ldots ,T_{pred}$ do Autoregressive Rollout. +10 $\begin{array}{rlr}{\bf o}_t\leftarrow (\mathbf{s}_{\mathrm{history}},\mathbf{a}_0,\ldots ,\mathbf{a}_{t - 1},\mathcal{I}). & {} & {\bf \nabla}\triangleright \mathrm{Get~obs}.\\ {\bf a}_t\leftarrow \pi_\theta (\cdot |\mathbf{o}_t). & {} & {\bf \nabla}\triangleright \mathrm{Decode~next~actions}. \end{array}$ +11 +12 Reconstruct predicted states $\mathbf{s}_{\mathrm{pred}} = \{\hat{s}_{t,i},\forall t,i\}$ by translating actions $a_{t,i},\forall t,i$ +13 Compute per-agent per-step $r_{t,i}$ via Eq. 2 +14 Compute normalized return via Eq. 4 and update $\pi_{\theta}$ via Eq. 5 + +During fine-tuning, we run the model for $T_{\mathrm{pred}}$ prediction steps. The encoder first encodes the scene context $c$ as a shared scene embedding, before the autoregressive decoding. At each prediction step $t$ , the fixed scene embedding and the $t \times N$ tokens are fed to the autoregressive decoder and sample $N$ new actions. Specifically, at prediction step $t = 1$ , we project the agents' current positions through a MLP and get the agent embeddings: $id_i = \mathrm{MLP}(Pos_{0,i}), i = 1, \dots, N$ . The agent and scene embeddings serve as the input tokens to the decoder. After several layers of self-attention and cross-attention, $N$ actions are sampled from the categorical distributions constructed from the output of the decoder. The embeddings of those sampled actions will be added with corresponding $id_i$ and concatenated with the tokens in previous steps to form the input tokens for the next step. Compared to the decoding process of a language model, we output $N$ tokens concurrently at each prediction step instead of one token. Our model autoregressively rolls out the actions in $T_{\mathrm{pred}}$ time steps. After collecting the rollout trajectories, we translate the actions to sequences of 2D positions for computing the rewards following Eq. 2. The return (i.e. the "reward-to-go"), for step $t$ and each agent $i$ is: + +$$ +R _ {t, i} = \sum_ {t ^ {\prime} = t} ^ {T _ {\text {p r e d}}} \gamma^ {t ^ {\prime} - t} r _ {t ^ {\prime}, i}. \tag {3} +$$ + +We normalize the return across the whole training batch, here Mean and Std are the average and the standard deviation computed across all time steps in all + +scenarios for all agents in the training batch: + +$$ +\tilde {R} _ {t, i} = \left(R _ {t, i} - \operatorname {M e a n} (R)\right) / \operatorname {S t d} (R). \tag {4} +$$ + +We then apply the REINFORCE [35] method to compute a policy gradient for optimizing the model by differentiating the following surrogate objective: + +$$ +\max _ {\pi_ {\theta}} \mathbb {E} _ {\mathcal {D}} \sum_ {t = 1} ^ {T _ {\text {p r e d}}} \sum_ {i \in \mathcal {I}} \log \pi_ {\theta} \left(a _ {t, i} \mid o _ {t, i}\right) \tilde {R} _ {t, i}. \tag {5} +$$ + +# 4.2 Policy Evaluation for Sim Agents + +A key limitation of common "imitative" metrics (such as ADE), which compare model rollouts to ground truth trajectories, is the weak connection between the metric and the actual goal of assessing the AD planner performance. A low ADE metric does not guarantee good driving behaviors. Log-replay, for example, has a perfect ADE of zero but would be a poor choice for sim agents because it is non-reactive. To create an evaluation that has a direct connection to measuring the performance of the AD planners, we propose a new policy evaluation framework for sim agents, inspired by the RL policy evaluation literature [32]. + +Our policy evaluation framework involves ranking and scoring the performance of a predetermined collection of AD planner policies. This is analogous to a real-world use case where one must decide which planner to deploy from a collection of candidate software releases. A better sim-agent model will give a more accurate signal on which policy would be best when deployed in the real world. As shown in Fig. 4, we first prepare a batch of AD planner policies with known performance ranking. Then, we evaluate the performance of these AD planners when the traffic agents in the scenario are controlled by a sim agent model. Therefore, we will generate the estimated performance for those AD planners for the specific sim agent. We then measure the discrepancy between the estimated performance and the ground truth performance of those planners. This discrepancy becomes the measurement of the sim agents model's ability to assess the performance of the planners. Policy evaluation covers two important use cases for the sim agent models in the deployment of autonomous vehicles: evaluation, where we wish to estimate the performance of agents in the simulation, and selection, where we wish to determine a ranking or order between different deployment candidates. + +Choice of policies. In order to perform policy evaluation, we must have a fixed set of policies on hand to rank or evaluate. To generate a large variety of planning policies with both good and bad performance, we propose to use a random shooting search-based policy family, parameterized by the number $(J)$ and depth $(D)$ of trajectories sampled. We compute a "ground truth" score for each policy by evaluating it with log playback agents. Note that the choice of ground truth is an important design decision. Any sim agent could serve as a ground truth, + +![](images/a741a19cd8b763af10b8d8d4b51f68097b11fc501a4e0e87ac7d1b1443d69623.jpg) +Fig. 4: We evaluate the sim agent by its ability to correctly assess the AD planner. + +but we need to pick one that is the most fair to all models and we believe log playback to be the most neutral. + +Our random shooting policy operates in a model-predictive control (MPC) fashion: at each time step, our random shooting policy samples from a fixed library of $J$ trajectories, which are generated by maintaining a single steering wheel angle and acceleration for $D$ steps. Note that this action specification is different from the action space of the MotionLM architecture we described in Sec. 4. We found this simple strategy to work much better than randomly selected actions. The trajectories are then scored by a reward function and the first step of the best scoring trajectory is executed. This process repeats for the entirety of the rollout. We used 16 different settings of $J$ , ranging between 9 to 81, and we used 4 values of depth $D \in [6,8,12,16]$ . We then used the product of these two sets, for a total of 64 different policies evaluated. + +Reward Function. The reward function used for selecting actions from a set of candidate trajectories is a linear combination of collisions, as well as off-road and route-following infractions. We use a modified reward function from Eq. 2 by replacing the L2 norm from the ground truth (which is not available to the planner at execution time) with additional terms for following a reasonable path. We instead give the planner a high-level route in the form of waypoints, and we use a weighted sum of $-10C - O - R + 10^{-4}P$ , where $C \in \{0,1\}$ denotes the collision indicator and is 1 when a collision between AV and another object happens, $O \in \{0,1\}$ denotes the offroad indicator and is 1 when the AV is too close to the road edge, $R \in \{0,1\}$ denotes the off-route indicator which is 1 when the AV's lateral distance to the GT trajectory exceeds a threshold, and $P$ is the projection of the AV's displacement between two time steps when projected onto the logged trajectory and measures the route-following behavior. We use Waymax [9]'s utility function to compute those metrics. + +# 5 Experiments + +We now describe our method's experimental results on the Waymo Open Sim Agents Challenge (WOSAC) [20] and on the Policy Evaluation task introduced in Sec. 4.2. Our experiments are designed to answer the following questions: + +
Lin. Speed↑Lin. Acc.↑Ang. Speed↑Ang. Acc.↑Dist. to Obj.↑Collision↑TTC↑Dist. to Road Edge↑Offroad↑Composite↑ADE↓MinADE↓
Random0.0020.0440.0740.1200.0000.0000.7340.1780.2870.15550.73950.706
Constant Velocity0.0740.0580.0190.0350.2080.3450.7370.4540.4550.2877.9237.923
Wayformer0.3310.0980.4130.4060.2970.8700.7820.5920.8660.5752.4982.498
MVTE0.4450.2220.5350.4810.3830.8930.8320.6640.9080.6453.8591.674
Logged Oracle0.5610.3300.5630.4890.4851.0000.8810.7131.0000.7220.0000.000
Pre-trained (1M)0.3900.2350.5040.4470.3480.5440.8030.5820.5250.4906.3323.177
RL-only (1M)0.2570.1150.4870.4290.2440.2390.7590.4560.1640.3207.7856.918
Fine-tuned (1M)0.4120.2190.4510.4200.3480.8630.8140.6370.8040.5972.4361.867
Pre-trained (10M)0.4390.2410.5020.4540.3710.6730.8110.6250.6550.5494.5082.274
Fine-tuned (10M)0.4330.2200.4550.4230.3610.8770.8190.6470.8250.6082.4281.706
+ +Table 1: Results on the Waymo Open Sim Agents Challenge (WOSAC) benchmark. Metrics marked with $(\uparrow)$ are better if higher, while metrics marked with $(\downarrow)$ are better if lower. Fine-tuned agents score better than pre-trained agents on safety-critical metrics such as collision and offroad, which results in a significantly higher composite metric score. We bold the best results for the baseline agents and best results from the model we trained for this work. + +1. Does RL fine-tuning improve the overall sim agents behavior? +2. Can fine-tuning be used to improve targeted metrics through reward engineering? +3. Does the fine-tuned sim agents model provide better evaluation of AD planner performance? + +Dataset. We train our method and baselines on the Waymo Open Motion Dataset (WOMD) [15] and evaluate on the Waymo Open Sim Agents Challenge (WOSAC) benchmark [20]. WOMD contains scenarios recorded at $10\mathrm{Hz}$ including one second of history (11 discrete time steps), and 8 seconds of future states (80 time steps) to predict. In total, there are 486k training scenarios, 44k validation scenarios, and 45k test scenarios. Up to 128 agents are simulated in each scenario. + +Model. We use a pre-trained autoregressive motion prediction model MotionLM [28]. For the MotionLM model with 10M parameters, we use 4 encoder and 4 decoder layers. The hidden size is 256. The number of attention heads is 4. The activation is ReLU. The feed-forward network intermediate size is 1024. + +Training. We pre-train a MotionLM model on the WOMD training set with the objective in Eq. 1. The model is then used for RL fine-tuning. The encoder and the decoder of the model are fine-tuned jointly. 1M steps of updates are conducted both in pre-training and fine-tuning. At each training step, 128 scenarios are sampled from the dataset to form a batch. During RL fine-tuning, the learning rate is set to 5e-6 and the discount factor is set to 0.95. + +# 5.1 Waymo Open Sim Agents Challenge + +Baselines. We include several notable baselines reported by [20] on WOSAC. The "random" and "constant velocity" agents are included to provide a reasonable performance lower bound. The "logged oracle" represents the ground truth future + +behavior that is not visible to other baselines and represents an upper-bound on performance. Wayformer [23] is a recent transformer-based model which shares the same encoder structure as our model. MVTE [34] is another transformer-based architecture which is the current state-of-the-art on the benchmark. Both Wayformer and MVTE adopt the agent-centric input representation. We also report the performance of our pre-trained 1M parameter and 10M parameter models, which are based on the MotionLM [28] architecture. + +Evaluation Metrics. The Waymo Open Sim Agents challenge evaluates agents on a wide range of likelihood-based metrics. These metrics are designed to measure realistic simulation in aggregate over the entire dataset, while allowing agents to have enough flexibility to deviate from the exact logged ground truth in each scenario. Each benchmarked method samples 32 rollouts for each WOMD test scenario. Metrics (such as velocity and heading angle) are then measured on these samples, but binned into discrete histograms, and the log-likelihood of the ground-truth data is measured under these histograms. The individual scores are then weighted and averaged to produce a final composite metric. In addition, following WOSAC [21] we also report the mean average displacement error (ADE) over 32 rollouts and the minimum average displacement error (minADE) over 32 rollouts. + +Results. We report our results on WOSAC in Table 1. The results provide strong evidence that closed-loop fine-tuning from a pre-trained model can significantly improve performance of the model as a sim agent. We see that both the "Finetuned 1M" and "Finedtuned 10M" models perform better than "Pre-trained 1M" and "Pre-trained 10M", respectively. When we look at the breakdown of the constituent metrics, we see that most of the gains come from improved safety-critical metrics such as collision and offroad. As a concrete example, Fig. 5 illustrates a single scenario comparing a rollout from a pre-trained 1M parameter model with a fine-tuned model. The pre-trained model is prone to slowly drifting away from the ground truth trajectory, a distribution shift problem commonly impacting pure imitative and teacher forcing [27] methods. By training the model in closed-loop, we can mitigate this distribution shift issue. + +The composite performance of "Fine-tuned 10M" is still lower than the state-of-the-art MVTE [34] model. We believe this can be mostly attributed to the choice of our pre-trained baseline model, which was our re-implemented version of the MotionLM [28] architecture with the encoder architecture of Wayformer [23]. We leave the fine-tuning of MVTE using the same methodology described in this work as future work, which we hypothesize would lead to a sizeable performance gain. + +To measure the effect of reward engineering and the ability to target specific metrics with fine-tuning, we ran an ablation study varying the relative weight $\lambda$ of the collision metric in Eq. 2, with results reported in Table 2. We fine-tuned the 1M parameter model with 4 different collision weights, and reported the collision score versus the ADE of the predictions. We can clearly see that adding some amount of collision penalty improves the collision metric at the cost + +![](images/ef81a1ffab23c4af7cdeb885970fe8fcfeeea21512bf5900b85d1b061fed2274.jpg) +Pre-trained Model +Fig. 5: Visualization of scenario rollouts using a pre-trained and a fine-tuned model. The start locations of vehicles are marked with a red star, the ground truth futures are marked with a solid black line, and the sampled trajectory is marked with circles of different colors. Left: The pre-trained model suffers from drifting due to distributional shift between training (with teacher forcing) and testing (with an autoregressive rollout). Right: The fine-tuned model is able to follow the ground truth much more precisely, which is quantitatively demonstrated by the better ADE metric. + +![](images/347aa08ec18f237e7b60e1e2b5cff31fb7c829a4e8fdf7b7b26e2f2109fad7af.jpg) +Fine-tuned Model + +
Collision WeightCollision ↑TTC ↑Composite ↑ADE ↓MinADE ↓
00.8340.8100.5902.4051.871
20.8630.8140.5972.4361.867
50.8440.8170.5952.8381.980
100.8310.8170.5943.0582.023
+ +Table 2: WOSAC benchmark scores for different values of the collision fine-tuning weight $\lambda$ with the 1M parameter model. Increasing the collision weight improves the collision score at the cost of decreasing imitative behavior metrics such as ADE. We find a good balance at an intermediate value. + +of degrading the ADE metric. This generally makes sense, as the optimization must trade-off the collision penalty versus the displacement error terms in the reward function. However, we also see that at very high values of the collision + +weight, all metrics tend to degrade, and the best result is with an intermediate cost weight. We hypothesize this is the case because displacement error is a very dense and rich reward signal, whereas collision is a more sparse and noisy signal. + +# 5.2 Policy Evaluation + +As described in Sec. 4.2, we also propose to evaluate sim agents through the lens of policy evaluation. In particular, we follow the methodology proposed by [8] and report two metrics used in their benchmark: Spearman's rank correlation and absolute error. Rank correlation is a metric for "selection" and measures the ability for the simulation to discern between good and bad policies (AD planners). This is useful for the problem setting where one must select the best policy to deploy from a set of candidates. On the other hand, absolute error is a metric for "evaluation" and measures how closely a simulation comes close to estimating the true cost or reward accrued by the policy. This is useful if one is interested in concrete performance numbers such as estimating the rate of a particular event of interest. The sim agent causing less absolute error and higher rank correlation is better for evaluating different planners. + +Given a set of planners with known performance ranking, we assess sim agents by measuring how well they estimate the value function of each planner. We generate a Monte-Carlo estimate of each planner's value by running it on each scenario, where all traffic participants are controlled by the sim agent, and computing the empirical returns of the planner. The returns are then averaged across all scenarios in the WOMD test set to form the estimate of the planner. The value estimates are then compared to a "ground-truth value", and we show two quantities, rank correlation and absolute error in Table 3 and Table 4, respectively. Each row in these tables represents the policy evaluation results of a sim agent. A sim agent will generate $K = 64$ estimated returns of $K$ policies (AD planners). Due to the absence of real-world simulation, there is no a universal ground truth sim agent that can fully replicate the realistic behaviors. We cannot know the ground truth returns when running these $K$ policies in the real world. In this work, we picked the log-playback sim agent as the "ground truth sim agent" and considered the average returns of these $K$ policies when running with the log-playback sim agent as the ground truth value. These form the Log column in Table 3 and Table 4. We also show rank correlation and absolute error relative to each other sim agent we considered for completeness. + +Results. Our results are reported in Table 3 and Table 4. We report results on a total of 64 candidate policies created by varying the depth (D) and the number of sampled trajectories (J). According to the Log column, we see that with fine-tuned models, a higher rank correlation and lower absolute error relative to the log-playback sim agent can be achieved, indicating that the fine-tuned models are more accurate at measuring a planner's performance and deciding whether the planner is better than another. + +
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M0.859-0.9540.9530.911
Fine-tuned 1M0.8650.954-0.9590.925
Pre-trained 10M0.8450.9530.959-0.932
Fine-tuned 10M0.8660.9110.9250.932-
+ +Table 3: Policy evaluation rank correlation results for pre-trained and fine-tuned models (higher is better). Each cell corresponds to a ranking correlation of estimated returns of a set of predefined AD planners between two sim agent models. For example, the highlighted Fine-tuned 10M - Log means the ranking correlation of predefined AD planners when using the Fine-tuned 10M and the log-playback sim agents. + +
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M10.518-0.5570.5511.013
Fine-tuned 1M10.1010.557-0.4260.729
Pre-trained 10M10.0140.5510.426-0.602
Fine-tuned 10M9.5091.0130.7290.602-
+ +Table 4: Policy evaluation rank absolute error results for pre-trained and fine-tuned models (lower is better). + +# 6 Conclusion + +We studied the viability of applying the popular "pre-training and fine-tuning" scheme to modeling traffic agents for AD simulation. We drew the connection between a multi-agent driving behavior model and a simulation environment - the multi-agent behavior model itself can be used to perform rollouts for closed-loop training. By using an on-policy RL algorithm with a simple reward, we are able to fine-tune a pre-trained large multi-agent behavior model to effectively align the traffic agent behaviors with human expectations, such as collision avoidance. The experimental results show that our method can significantly improve the performance of the pre-trained model on the Waymo Open Sim Agent Challenge (WOSAC) [20]. We also proposed a novel policy evaluation task and demonstrated that the model fine-tuned by our method can achieve more reliable AD testing result. + +Limitations. There are several limitations to the approach we have discussed in this paper. We use a simple transition and action model (based on predicting accelerations and integrating them to estimate positions) as the environment dynamics model, which could produce kinematically unrealistic behaviors during a rollout. A more realistic solution would be to embed a low-level controller into simulation that attempts to reach the positions predicted by the model. In addition, we studied a reward function (Eq. 2) that encourages collision avoidance and minimizes divergence in closed-loop simulation. The reward function can be extended to induce various driving behaviors, such as encouraging adversarial behavior (e.g. using the negative of the ego vehicle's reward) to stress-test challenging scenarios. + +# References + +1. Argall, B.D., Chernova, S., Veloso, M., Browning, B.: A survey of robot learning from demonstration. Robotics and autonomous systems 57(5), 469-483 (2009) +2. Bergamini, L., Ye, Y., Scheel, O., Chen, L., Hu, C., Del Pero, L., Osinski, B., Grimmett, H., Ondruska, P.: Simnet: Learning reactive self-driving simulations from real-world observations. In: 2021 IEEE International Conference on Robotics and Automation (ICRA). pp. 5119-5125. IEEE (2021) +3. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023) +4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020) +5. Codevilla, F., Müller, M., López, A., Koltun, V., Dosovitskiy, A.: End-to-end driving via conditional imitation learning. In: 2018 IEEE international conference on robotics and automation (ICRA). pp. 4693-4700. IEEE (2018) +6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: CARLA: An open urban driving simulator. In: Proceedings of the 1st Annual Conference on Robot Learning. pp. 1-16 (2017) +7. Feng, L., Li, Q., Peng, Z., Tan, S., Zhou, B.: Trafficgen: Learning to generate diverse and realistic traffic scenarios. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3567-3575. IEEE (2023) +8. Fu, J., Norouzi, M., Nachum, O., Tucker, G., Novikov, A., Yang, M., Zhang, M.R., Chen, Y., Kumar, A., Paduraru, C., et al.: Benchmarks for deep off-policy evaluation. In: International Conference on Learning Representations (2020) +9. Gulino, C., Fu, J., Luo, W., Tucker, G., Bronstein, E., Lu, Y., Harb, J., Pan, X., Wang, Y., Chen, X., et al.: Waymax: An accelerated, data-driven simulator for large-scale autonomous driving research. arXiv preprint arXiv:2310.08710 (2023) +10. Hu, Y., Yang, J., Chen, L., Li, K., Sima, C., Zhu, X., Chai, S., Du, S., Lin, T., Wang, W., et al.: Planning-oriented autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17853-17862 (2023) +1. Kamenev, A., Wang, L., Bohan, O.B., Kulkarni, I., Kartal, B., Molchanov, A., Birchfield, S., Nister, D., Smolyanskiy, N.: Predictionnet: Real-time joint probabilistic traffic prediction for planning, control, and simulation. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 8936-8942. IEEE (2022) +2. Leurent, E.: An environment for autonomous driving decision-making. https://github.com/eleurent/highway-env (2018) +3. Li, Q., Peng, Z., Feng, L., Liu, Z., Duan, C., Mo, W., Zhou, B.: ScenarioNet: Open-source platform for large-scale traffic scenario simulation and modeling. Advances in Neural Information Processing Systems (2023) +4. Li, Q., Peng, Z., Feng, L., Zhang, Q., Xue, Z., Zhou, B.: Metadrive: Composing diverse driving scenarios for generalizable reinforcement learning. IEEE transactions on pattern analysis and machine intelligence (2022) +5. LLC, W.: Waymo open dataset: An autonomous driving dataset (2019) +6. Lu, J., Batra, D., Parikh, D., Lee, S.: Vilbert: Pretraining task-agnostic visiolinguistic representations for vision-and-language tasks. Advances in neural information processing systems 32 (2019) + +17. Lu, Y., Fu, J., Tucker, G., Pan, X., Bronstein, E., Roelofs, R., Sapp, B., White, B., Faust, A., Whiteson, S., et al.: Imitation is not enough: Robustifying imitation with reinforcement learning for challenging driving scenarios. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 7553-7560. IEEE (2023) +18. Mendez-Lucio, O., Nicolaou, C.A., Earnshaw, B.: Mole: a molecular foundation model for drug discovery. In: NeurIPS 2022 Workshop on Learning Meaningful Representations of Life (2022) +19. Min, C., Zhao, D., Xiao, L., Nie, Y., Dai, B.: Uniworld: Autonomous driving pretraining via world models. arXiv preprint arXiv:2308.07234 (2023) +20. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023) +21. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023) +22. Moor, M., Banerjee, O., Abad, Z.S.H., Krumholz, H.M., Leskovec, J., Topol, E.J., Rajpurkar, P.: Foundation models for generalist medical artificial intelligence. Nature 616(7956), 259-265 (2023) +23. Nayakanti, N., Al-Rfou, R., Zhou, A., Goel, K., Refaat, K.S., Sapp, B.: Wayformer: Motion forecasting via simple & efficient attention networks. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 2980-2987. IEEE (2023) +24. OpenAI: Gpt-4 technical report (2023) +25. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. Advances in Neural Information Processing Systems 35, 27730-27744 (2022) +26. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) +27. Ross, S., Gordon, G., Bagnell, D.: A reduction of imitation learning and structured prediction to no-regret online learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 627-635. JMLR Workshop and Conference Proceedings (2011) +28. Seff, A., Cera, B., Chen, D., Ng, M., Zhou, A., Nayakanti, N., Refaat, K.S., Al-Rfou, R., Sapp, B.: Motionlm: Multi-agent motion forecasting as language modeling. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8579-8590 (2023) +29. Shi, S., Jiang, L., Dai, D., Schiele, B.: Motion transformer with global intention localization and local movement refinement. Advances in Neural Information Processing Systems 35, 6531-6543 (2022) +30. Shi, S., Jiang, L., Dai, D., Schiele, B.: Mtr++: Multi-agent motion prediction with symmetric scene modeling and guided intention querying. arXiv preprint arXiv:2306.17770 (2023) +31. Suo, S., Regalado, S., Casas, S., Urtasun, R.: Trafficsim: Learning to simulate realistic multi-agent behaviors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10400-10409 (2021) +32. Uehara, M., Shi, C., Kallus, N.: A review of off-policy evaluation in reinforcement learning. arXiv preprint arXiv:2212.06355 (2022) + +33. Vinitsky, E., Lichtlé, N., Yang, X., Amos, B., Foerster, J.: Nocturne: a scalable driving benchmark for bringing multi-agent learning one step closer to the real world. Advances in Neural Information Processing Systems 35, 3962-3974 (2022) +34. Wang, Y., Zhao, T., Yi, F.: Multiverse transformer: 1st place solution for waymo open sim agents challenge 2023. arXiv preprint arXiv:2306.11868 (2023) +35. Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8, 229-256 (1992) +36. Zhang, C., Tu, J., Zhang, L., Wong, K., Suo, S., Urtasun, R.: Learning realistic traffic agents in closed-loop. In: 7th Annual Conference on Robot Learning (2023) +37. Zhang, Q., Gao, Y., Zhang, Y., Guo, Y., Ding, D., Wang, Y., Sun, P., Zhao, D.: Trajgen: Generating realistic and diverse trajectories with reactive and feasible agent behaviors for autonomous driving. IEEE Transactions on Intelligent Transportation Systems 23(12), 24474-24487 (2022) +38. Zhang, Z., Liniger, A., Dai, D., Yu, F., Van Gool, L.: Trafficbots: Towards world models for autonomous driving simulation and motion prediction. arXiv preprint arXiv:2303.04116 (2023) +39. Zhong, Z., Rempe, D., Xu, D., Chen, Y., Veer, S., Che, T., Ray, B., Pavone, M.: Guided conditional diffusion for controllable traffic simulation. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3560-3566. IEEE (2023) +40. Zhou, C., Li, Q., Li, C., Yu, J., Liu, Y., Wang, G., Zhang, K., Ji, C., Yan, Q., He, L., et al.: A comprehensive survey on pretrained foundation models: A history from bert to chatgpt. arXiv preprint arXiv:2302.09419 (2023) +41. Zhou, M., Luo, J., Villella, J., Yang, Y., Rusu, D., Miao, J., Zhang, W., Alban, M., Fadakar, I., Chen, Z., Huang, A.C., Wen, Y., Hassanzadeh, K., Graves, D., Chen, D., Zhu, Z., Nguyen, N., Elsayed, M., Shao, K., Ahilan, S., Zhang, B., Wu, J., Fu, Z., Rezaee, K., Yadmellat, P., Rohani, M., Nieves, N.P., Ni, Y., Banijamali, S., Rivers, A.C., Tian, Z., Palenicek, D., bou Ammar, H., Zhang, H., Liu, W., Hao, J., Wang, J.: Smarts: Scalable multi-agent reinforcement learning training school for autonomous driving (2020) +42. Zhou, Y., Chia, M.A., Wagner, S.K., Ayhan, M.S., Williamson, D.J., Struyven, R.R., Liu, T., Xu, M., Lozano, M.G., Woodward-Court, P., et al.: A foundation model for generalizable disease detection from retinal images. Nature pp. 1-8 (2023) +43. Zitkovich, B., Yu, T., Xu, S., Xu, P., Xiao, T., Xia, F., Wu, J., Wohlhart, P., Welker, S., Wahid, A., et al.: Rt-2: Vision-language-action models transfer web knowledge to robotic control. In: 7th Annual Conference on Robot Learning (2023) \ No newline at end of file diff --git a/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/images.zip b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..49cf7eff1e47a0071382dcb0215f8526f163fe16 --- /dev/null +++ b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dc25ba3a9d50691c98f69258c0827dfc9305df7a554db326f7d40a54a8ae4978 +size 314461 diff --git a/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/layout.json b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..1917370a5a413ba674699c260a6953fe9294fb78 --- /dev/null +++ b/2024/Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving/layout.json @@ -0,0 +1,8584 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 136, + 111, + 479, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 111, + 479, + 148 + ], + "spans": [ + { + "bbox": [ + 136, + 111, + 479, + 148 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "spans": [ + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "content": "Zhenghao Peng" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "inline_equation", + "content": "^{1*}" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "content": ", Wenjie Luo" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "content": ", Yiren Lu" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "content": ", Tianyi Shen" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "content": ", Cole Gulino" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "content": ", Ari Seff" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "text", + "content": ", and Justin Fu" + }, + { + "bbox": [ + 147, + 167, + 465, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 270, + 201, + 345, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 270, + 201, + 345, + 213 + ], + "spans": [ + { + "bbox": [ + 270, + 201, + 345, + 213 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 270, + 201, + 345, + 213 + ], + "type": "text", + "content": "UCLA, " + }, + { + "bbox": [ + 270, + 201, + 345, + 213 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 270, + 201, + 345, + 213 + ], + "type": "text", + "content": "Waymo" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 159, + 244, + 455, + 397 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 244, + 455, + 397 + ], + "spans": [ + { + "bbox": [ + 159, + 244, + 455, + 397 + ], + "type": "text", + "content": "Abstract. A major challenge in autonomous vehicle research is modeling agent behaviors, which has critical applications including constructing realistic and reliable simulations for off-board evaluation and forecasting traffic agents motion for onboard planning. While supervised learning has shown success in modeling agents across various domains, these models can suffer from distribution shift when deployed at test-time. In this work, we improve the reliability of agent behaviors by closed-loop fine-tuning of behavior models with reinforcement learning. Our method demonstrates improved overall performance, as well as targeted metrics such as collision rate, on the Waymo Open Sim Agents challenge. Additionally, we present a novel policy evaluation benchmark to directly assess the ability of simulated agents to measure quality of autonomous vehicle planners and demonstrate the effectiveness of our approach on this new benchmark." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "spans": [ + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "text", + "content": "Keywords: Autonomous Driving " + }, + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "text", + "content": " Reinforcement Learning " + }, + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "text", + "content": " Policy Evaluation " + }, + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 408, + 457, + 430 + ], + "type": "text", + "content": " Behavior Prediction" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 452, + 230, + 464 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 452, + 230, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 452, + 230, + 464 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 477, + 282, + 585 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 477, + 282, + 585 + ], + "spans": [ + { + "bbox": [ + 130, + 477, + 282, + 585 + ], + "type": "text", + "content": "Transformer-based architectures have demonstrated state-of-the-art performance in a variety of tasks in language [24], vision [26], and robotics [43]. The success of these models is credited to a widely adopted \"pre-training and fine-tuning\" scheme [40]. In the pre-training phase, the model ac" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 586, + 482, + 646 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 586, + 482, + 646 + ], + "spans": [ + { + "bbox": [ + 130, + 586, + 482, + 646 + ], + "type": "text", + "content": "requires knowledge from a very large amount of training data; during fine-tuning, the model behaviors are rectified to align with human preferences and expectations. While supervised learning can be used for fine-tuning, previous work has shown superior performance with reinforcement learning (RL) fine-tuning in language tasks [25] and text-to-image generation [3]. In autonomous driving" + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 291, + 472, + 482, + 528 + ], + "blocks": [ + { + "bbox": [ + 291, + 472, + 482, + 528 + ], + "lines": [ + { + "bbox": [ + 291, + 472, + 482, + 528 + ], + "spans": [ + { + "bbox": [ + 291, + 472, + 482, + 528 + ], + "type": "image", + "image_path": "02bb7ed5dab7056d962be9c97cc408ce7a3870bbe900962b0e5f111a3b786b0f.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 287, + 538, + 482, + 572 + ], + "lines": [ + { + "bbox": [ + 287, + 538, + 482, + 572 + ], + "spans": [ + { + "bbox": [ + 287, + 538, + 482, + 572 + ], + "type": "text", + "content": "Fig.1: We propose to fine-tune a pre-trained motion prediction model with closed-loop reinforcement learning." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 653, + 291, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 653, + 291, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 653, + 291, + 665 + ], + "type": "text", + "content": "*Work done as an intern at Waymo." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 482, + 211 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 482, + 211 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 482, + 211 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 482, + 211 + ], + "type": "image", + "image_path": "bcd384eef861d32e03d78ae9190987acfd8a108336500d6a43a552d698fbdfb6.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 224, + 482, + 302 + ], + "lines": [ + { + "bbox": [ + 130, + 224, + 482, + 302 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 482, + 302 + ], + "type": "text", + "content": "Fig. 2: Left: The agent is trained from scratch using a combined Behavioral Cloning (BC) and Reinforcement Learning (RL) approach. Without pre-training on large datasets, the agent must simultaneously explore the environment and develop its capabilities from scratch. Right: The agent undergoes a two-phase training scheme. Agent acquires a foundational skill set from aligning its actions (green) with ground truth data in pre-training (gray). The fine-tuning through RL refines the agent behaviors in the autoregressive rollout." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 327, + 479, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 327, + 479, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 479, + 363 + ], + "type": "text", + "content": "(AD), given the abundance of human driving data, a natural question arises: Can we leverage the popular \"pre-training and RL fine-tuning\" strategy to effectively model agent behaviors?" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 365, + 480, + 436 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 365, + 480, + 436 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 480, + 436 + ], + "type": "text", + "content": "In this paper, we investigate the viability of applying the \"pre-training and RL fine-tuning\" paradigm to model the behaviors of traffic agents in AD scenarios. Such models can be applied in critical AD tasks such as simulation agents (sim agents) [20], enabling high-fidelity simulation systems for off-board evaluation, and behavior prediction for surrounding traffic participants, facilitating onboard planning." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 437, + 481, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 481, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 481, + 616 + ], + "type": "text", + "content": "Behavioral cloning (BC), or training an imitative model using supervised learning on demonstrations [1], has been the predominant approach for learning driving agents [5, 34]. While BC provides supervision for modeling realistic behavior, during closed-loop simulation, the agent behaviors can deviate from the training distribution, known as the \"covariate shift\" issue [27]. Moreover, BC lacks the ability to explicitly incorporate human preferences, expectations and constraints. For example, safety-critical events, such as collisions, are only implicitly discouraged in the BC loss due to their rarity in human driving datasets. In situations where a collision is likely to occur, the model may only have limited examples to learn from. RL fine-tuning can address these limitations. Firstly, RL learns from closed-loop synthetic rollouts, addressing the covariate shift problem as the reward function penalizes actions leading to future trajectories that diverge from ground-truth. Secondly, explicit objectives can be incorporated into the reward function so the agents can learn to align with human preferences and expectations." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": "Inspired by the success of fine-tuning large language models to align with human preferences, we apply the \"pre-training and RL fine-tuning\" scheme to training behavior models for sim agents. As demonstrated in Fig. 1, we can fine-tune a pre-trained model via a simple on-policy RL approach with autoregressive" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "content": "rollouts. We propose a simple reward function that not only enables the model to satisfy human preferences on the agent behaviors, but also maintains human likeness." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 482, + 317 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 482, + 317 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 482, + 317 + ], + "type": "text", + "content": "Our experiments on the Waymo Open Sim Agent Challenge (WOSAC) [20] demonstrate that RL fine-tuning significantly improves the reliability of the agent behaviors, especially in terms of collision avoidance. An important application of the learned behaviors is in actuating the traffic agents in AD simulation. We study the reliability of the learned models in a novel planner evaluation benchmark. The intuition is that a simulator with more realistic sim agents model should provide more reliable evaluation across ego AD planners. With this insight, we use different sim agents model to control the traffic agents and assess the performance of a predefined set of AD planners. By comparing the planners' estimated performance as evaluated by the sim agents model against their known performance ranking, we find that our fine-tuned models provide more accurate planner evaluations. This indicates that our approach is beneficial for testing autonomous driving planners. The main contributions of this work are:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 319, + 485, + 462 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 131, + 319, + 485, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 319, + 485, + 380 + ], + "spans": [ + { + "bbox": [ + 131, + 319, + 485, + 380 + ], + "type": "text", + "content": "1) We propose to apply the popular \"pre-training and RL fine-tuning\" paradigm commonly used for large language models (LLMs) to the autonomous driving behavior modeling problem, demonstrating the effectiveness of closed-loop finetuning a Transformer-based architecture on the Waymo Open Motion Dataset (WOMD) [15]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 380, + 481, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 380, + 481, + 415 + ], + "spans": [ + { + "bbox": [ + 131, + 380, + 481, + 415 + ], + "type": "text", + "content": "2) We demonstrate that an on-policy RL algorithm with a simple reward function can successfully preserve the realism in the dataset while aligning human preferences on safety and reliability." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 415, + 481, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 415, + 481, + 462 + ], + "spans": [ + { + "bbox": [ + 131, + 415, + 481, + 462 + ], + "type": "text", + "content": "3) To better evaluate the performance of sim agents models, we propose a novel planner evaluation task and demonstrate that our method can significantly improve the performance of the sim agents models in terms of its capability to assess the AD planners." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 131, + 479, + 237, + 491 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 479, + 237, + 491 + ], + "spans": [ + { + "bbox": [ + 131, + 479, + 237, + 491 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 503, + 457, + 515 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 503, + 457, + 515 + ], + "spans": [ + { + "bbox": [ + 131, + 503, + 457, + 515 + ], + "type": "text", + "content": "2.1 Pre-training and Fine-tuning of Transformer-based Models" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "Transformer-based models have been applied to various domains such as text generation [4], image generation [26], robotics [43], drug discovery [18], disease diagnose [42], and generalist medical AI [22]. Many large Transformer-based models are trained in the \"pre-training then fine-tuning\" manner, where supervised fine-tuning [40] or reinforcement learning with human feedback [25] holds the promise to align the model behaviors to human preferences. In the autonomous driving domain, similar Transformer-based architectures have been applied to various tasks, ranging from perception [19], motion prediction [23], self-driving policies [10] and simulation [31,38,39]. In this work, we focus on the motion prediction problem, where predictors forecast the future trajectories of the target agents by observing history information [23, 29, 30]. Unlike foundational models in other domains such as large language models [24] and vision" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 142, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 142, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": "language models [16], motion prediction models are most commonly trained via supervised learning and rarely fine-tuned to better boost alignment with human preferences." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 170, + 384, + 183 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 170, + 384, + 183 + ], + "spans": [ + { + "bbox": [ + 131, + 170, + 384, + 183 + ], + "type": "text", + "content": "2.2 Behavior Modeling for Autonomous Driving" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 190, + 482, + 333 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 190, + 482, + 333 + ], + "spans": [ + { + "bbox": [ + 130, + 190, + 482, + 333 + ], + "type": "text", + "content": "Modeling the behavior of traffic participants is a critical task in many autonomous driving systems, particularly for constructing realistic simulation to test the AD planners. Most existing simulators [6,12,41] rely on hand-crafted rules for traffics and maps generation. However, the data distributions for the map structure, traffic flow, the interaction between traffic participants and other elements do not realistically represent the real world. Modern data-driven simulators [9,13,14,33] address this by replaying the behaviors of the traffic participants from real-world scenarios recorded by an autonomous vehicle (log-replay). Yet, the downside of log-replay is that re-simulation may become unrealistic when the planner behavior diverges from the original logged behavior. For example, if an AD planner is more cautious than the human driver and brakes earlier, the trailing vehicle might collide into it, leading to a false positive collision." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 334, + 482, + 490 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 334, + 482, + 490 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 482, + 490 + ], + "type": "text", + "content": "In this work, we mainly focus on the simulation agents task and evaluate our solutions on the Waymo Open Sim Agent Challenge (WOSAC) [20]. Many existing WOSAC submissions apply the marginal motion prediction models [2,7,29], which typically take initial states and predict the positions of traffic participants at all future steps in a single inference (one-shot). Those marginal models do not explicitly model interactions between agents during the prediction horizon. The autoregressive (AR) models naturally fit to the driving behavior modeling, especially in the context of closed-loop simulation [11,28,31,38]. AR decoding [28] allows the interactions between agents to be modeled via a self-attention mechanism at each step of the decoding process. However, closed-loop training of the AR behavior prediction models remains an understudied area. We propose to improve a pre-trained AR model with closed-loop fine-tuning and evaluate the performance on the WOSAC benchmark." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 490, + 482, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 490, + 482, + 597 + ], + "spans": [ + { + "bbox": [ + 130, + 490, + 482, + 597 + ], + "type": "text", + "content": "In contrast to prior research on combining behavior cloning and reinforcement learning [17,36,37], our approach eliminates the need for an external simulator and a dynamics model. Since our model predicts actions for all agents, it functions as a simplified simulation environment itself. From an algorithmic perspective, we avoid back-propagation through time (BPTT) used in existing works [11,36]. Instead, we propose that RL can be conducted with a minimalistic policy gradient algorithm [35]. This allows us to use non-differentiable rewards (such as a boolean collision indicator) and non-differentiable models with discrete outputs which would not be possible with BPTT." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 616, + 234, + 628 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 616, + 234, + 628 + ], + "spans": [ + { + "bbox": [ + 131, + 616, + 234, + 628 + ], + "type": "text", + "content": "3 Preliminaries" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 482, + 666 + ], + "type": "text", + "content": "Motion Prediction. A driving scenario includes static information such as the map topology and dynamic information such as the states of traffic participants" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "and traffic lights. At each time step, the state of a traffic participant is represented by a feature vector containing the position, velocity, and heading angle in global frame, and the object type (vehicle, cyclist, pedestrian). For traffic lights, the feature vector contains their position and state (green, yellow, red or unknown). Given the history states of " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": " traffic participants with indices " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "\\mathcal{I} = [1\\ldots N]" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": ", the goal of motion prediction is to predict future trajectories, i.e. the positions in future steps, of these agents." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": "Behavior Modeling as a Multi-Agent RL Problem. We consider driving behavior modeling as a Multi-agent Markov Decision Process (Multi-agent MDP). The Multi-agent MDP is defined by the tuple " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\langle \\mathcal{I},\\mathcal{S},\\{\\mathcal{A}_i\\} ,\\mathcal{T},\\{\\mathcal{R}_i\\} ,\\Omega ,\\{\\mathcal{O}_i\\} ,\\gamma \\rangle" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\mathcal{S}" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " is the joint state space, " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\mathcal{A} = \\times_{i}\\mathcal{A}_{i}" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " is the joint action space, the transition function is " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\mathcal{T}:S\\times \\mathcal{A}\\to S" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " , the reward functions are " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_i(s_t,a_{t,i},s_{t + 1}),\\forall i\\in \\mathcal{I}" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " the observation space is " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\varOmega=\\times_i\\varOmega_i" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " , the observation functions " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\mathcal{O}_i" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " , and the discount factor is " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " . In this Multi-agent MDP, the goal is to learn action policies " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\pi_i:\\mathcal{A}_i\\times \\varOmega_i\\rightarrow [0,1]" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " for each agent. Each agent aims to maximize its expected cumulative return: " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\pi_{i} = \\arg \\max_{\\pi}\\mathbb{E}_{\\tau \\sim P_{\\pi_{j},\\forall j\\in \\mathcal{I}}}\\left[\\sum_{t = 1}^{T_{\\mathrm{future}}}\\gamma^{t}r_{t,i}\\right]" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\tau = (\\mathbf{s}_0,\\mathbf{a}_0,\\dots,\\mathbf{s}_T,a_T)" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " is the joint future rollout obtained by executing the learned policy model conditioned on the initial state. Here, " + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "inline_equation", + "content": "\\mathbf{a}_t = \\{a_{t,i}\\}_{i\\in \\mathcal{I}}" + }, + { + "bbox": [ + 130, + 209, + 483, + 357 + ], + "type": "text", + "content": " is the joint actions." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 366, + 359, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 359, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 359, + 521 + ], + "type": "text", + "content": "Autoregressive Encoder-Decoder Architecture. We use MotionLM [28], an encoder-decoder transformer-based autoregressive motion prediction model. The model's encoder takes a set of tokens representing the initial states of the scenarios as input and generates a scene embedding. These initial states include the traffic lights states, map topology, and the history information of all traffic participants. During inference, we run the decoder for " + }, + { + "bbox": [ + 130, + 366, + 359, + 521 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 366, + 359, + 521 + ], + "type": "text", + "content": " prediction steps to autoregressively generate the prediction of all agents. At each prediction step, the decoder takes a set of motion tokens as well as the scene embedding as input and gener" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 366, + 390, + 471, + 466 + ], + "blocks": [ + { + "bbox": [ + 366, + 390, + 471, + 466 + ], + "lines": [ + { + "bbox": [ + 366, + 390, + 471, + 466 + ], + "spans": [ + { + "bbox": [ + 366, + 390, + 471, + 466 + ], + "type": "image", + "image_path": "cf17228658984bf4c87013dc8a07dd932cde85f94e188608a2027287fcdfb5a4.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 356, + 482, + 482, + 503 + ], + "lines": [ + { + "bbox": [ + 356, + 482, + 482, + 503 + ], + "spans": [ + { + "bbox": [ + 356, + 482, + 482, + 503 + ], + "type": "text", + "content": "Fig. 3: The causal mask in the decoder." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "content": "ates a distribution of " + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "content": " output tokens. The decoder consists of multiple layers, each applying self-attention among input tokens and cross-attention to the scene embedding. All " + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "content": " motion tokens at step " + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "content": " can attend to each other and all previous tokens as shown in Fig. 3, where each row represents a query token and each column a key token and green blocks indicate key tokens that the query can attend. After running " + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "content": " prediction steps, the " + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{pred}} \\times N" + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "content": " output motion tokens form complete trajectories for " + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 522, + 482, + 641 + ], + "type": "text", + "content": " agents. This autoregressive approach ensures that each agent's action is based on a temporally causal relationship with the previous actions of all traffic participants, leading to improved modeling of interaction between agents within the prediction horizon." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "We modify the original MotionLM model by adopting a scene-centric input format and predicting the motion of all agents, rather than using a pre-selected" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 142, + 90, + 445, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 90, + 445, + 103 + ], + "spans": [ + { + "bbox": [ + 142, + 90, + 445, + 103 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": "subset. The scene-centric representation and the encoder-decoder architecture enable more computationally efficient encoding of the scene context and prediction of all agents' motion." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 171, + 202, + 185 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 171, + 202, + 185 + ], + "spans": [ + { + "bbox": [ + 132, + 171, + 202, + 185 + ], + "type": "text", + "content": "4 Method" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 198, + 480, + 243 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 198, + 480, + 243 + ], + "spans": [ + { + "bbox": [ + 130, + 198, + 480, + 243 + ], + "type": "text", + "content": "As shown in Algorithm 1, our method has two stages. In the pre-training stage, we reconstruct the ground truth actions from the data and use the maximum likelihood objective to match the joint action distribution of observed behaviors in the dataset:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 239, + 243, + 481, + 277 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 243, + 481, + 277 + ], + "spans": [ + { + "bbox": [ + 239, + 243, + 481, + 277 + ], + "type": "interline_equation", + "content": "\\max _ {\\pi_ {\\theta}} \\mathbb {E} _ {\\mathcal {D}} \\sum_ {t = 1} ^ {T _ {\\text {p r e d}}} \\sum_ {i \\in \\mathcal {I}} \\log \\pi_ {\\theta} \\left(a _ {t, i} ^ {\\mathrm {G T}} \\mid o _ {t, i}\\right). \\tag {1}", + "image_path": "51e82ad133dfc420e0aebd546bcfb1d9b32dd12873155c28637cb097bcdc022d.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 282, + 479, + 317 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 479, + 317 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 479, + 317 + ], + "type": "text", + "content": "The second stage of our learning process fine-tunes the model using reinforcement learning (RL). We formalize the problem as a Multi-agent Markov Decision Process (MDP) for our behavior modeling task as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "text", + "content": "Action. The action space " + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "inline_equation", + "content": "\\mathcal{A} = \\times_{i}\\mathcal{A}_{i}" + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "text", + "content": ": The action space for each agent " + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_i" + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "text", + "content": " is a Verlet-wrapped delta action space [28], where each action represents the X, Y acceleration in scene coordinates. To reconstruct the ground truth action targets, we first infer the accelerations by differentiating the observed positions in the data. These accelerations are then discretized into a " + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "inline_equation", + "content": "13\\times 13" + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "text", + "content": " uniformly spaced grid, where outliers are clipped to the minimum and maximum values of " + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "inline_equation", + "content": "6m / s^2" + }, + { + "bbox": [ + 130, + 318, + 480, + 389 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 390, + 480, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 480, + 413 + ], + "type": "text", + "content": "State. The state space " + }, + { + "bbox": [ + 130, + 390, + 480, + 413 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 390, + 480, + 413 + ], + "type": "text", + "content": " contains map features, the joint state of all objects and traffic lights." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "text", + "content": "Transition Dynamics. Agents transit to new positions computed by adding previous positions with an offset: " + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "inline_equation", + "content": "pos_{t+1,i} = (a_{t,i}\\Delta + vel_{t,i})\\Delta + pos_{t,i}" + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "text", + "content": " wherein the velocity " + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "inline_equation", + "content": "vel_{t,i}" + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "text", + "content": " and the position " + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "inline_equation", + "content": "pos_{t,i}" + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "text", + "content": " are in " + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "inline_equation", + "content": "s_t" + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "inline_equation", + "content": "\\Delta" + }, + { + "bbox": [ + 130, + 414, + 480, + 461 + ], + "type": "text", + "content": " is the time interval between steps." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "text", + "content": "Observation. We define observations to consist of a historic context " + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "text", + "content": ", previous actions of all objects and the agent identity: " + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "inline_equation", + "content": "o_{t,i} = (c, \\mathbf{a}_1, \\dots, \\mathbf{a}_{t-1}, i)" + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "text", + "content": ". Here, the context " + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "inline_equation", + "content": "c = (\\{m_i\\}_M, s_{T_{\\mathrm{prev}}}, \\dots, s_0)" + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "text", + "content": " is a set containing " + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "text", + "content": " map features and the object and traffic light states for history steps " + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "inline_equation", + "content": "t = T_{\\mathrm{prev}}, \\dots, 0" + }, + { + "bbox": [ + 130, + 462, + 480, + 510 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 528, + 241, + 540 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 528, + 241, + 540 + ], + "spans": [ + { + "bbox": [ + 132, + 528, + 241, + 540 + ], + "type": "text", + "content": "4.1 RL Fine-tuning" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 549, + 479, + 573 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 549, + 479, + 573 + ], + "spans": [ + { + "bbox": [ + 130, + 549, + 479, + 573 + ], + "type": "text", + "content": "We propose to fine-tune a pre-trained autoregressive motion predictor with RL. The reward function for each agent at each step is defined as:" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 227, + 584, + 481, + 597 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 584, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 227, + 584, + 481, + 597 + ], + "type": "interline_equation", + "content": "r _ {t, i} = - \\left\\| P o s _ {t, i} - G T _ {t, i} \\right\\| _ {2} - \\lambda C o l l _ {t, i}, \\tag {2}", + "image_path": "6c554924464cc9eec2d5352705d82c45993d45b94ec3c1d688debdac8f789c32.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "Post_{t,i}" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " is the position of agent " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " in step " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "GT_{t,i}" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " is the corresponding position in the logged trajectory. " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "Coll_{t,i}" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " is a Boolean indicator and will be 1 if the bounding box of agent " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " intersects with others' bounding boxes. This reward function, while simple, captures the key objectives of preserving the behavioral realism as well as satisfying the safety constraint of collision avoidance." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 134, + 142, + 480, + 358 + ], + "blocks": [ + { + "bbox": [ + 138, + 118, + 452, + 141 + ], + "lines": [ + { + "bbox": [ + 138, + 118, + 452, + 141 + ], + "spans": [ + { + "bbox": [ + 138, + 118, + 452, + 141 + ], + "type": "text", + "content": "Algorithm 1: Pre-train and fine-tune an autoregressive motion predictor." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "lines": [ + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "spans": [ + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": "input: Large-scale driving dataset " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " output:A Sim Agent policy " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\pi_{\\theta}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " \n1 Initialize model parameters " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " and model " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\pi_{\\theta}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " \n2 for pre-training iterations " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "j = 1,\\dots" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " do \n3 Retrieve " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathbf{s}_{\\mathrm{history}},\\mathbf{s}_{\\mathrm{GT}}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " \n4 Construct target actions " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathbf{a}_{\\mathrm{GT}} = \\{a_{t,i}^{\\mathrm{GT}},\\forall t,i\\}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " and construct the observation " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "o_{t,i}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " with GT actions. \n5 Run the model with the observation and get the predicted actions " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\{a_{t,i},\\forall t,i\\}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " \n6 Update " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\pi_{\\theta}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " via Eq. 1. \n7 for fine-tuning iterations " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "j = 1,\\dots" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " do \n8 Retrieve " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathbf{s}_{\\mathrm{history}}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " ; Set " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "{\\bf a}_0\\gets" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " . \n9 for " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "t = 1,\\ldots ,T_{pred}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " do Autoregressive Rollout. \n10 " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\begin{array}{rlr}{\\bf o}_t\\leftarrow (\\mathbf{s}_{\\mathrm{history}},\\mathbf{a}_0,\\ldots ,\\mathbf{a}_{t - 1},\\mathcal{I}). & {} & {\\bf \\nabla}\\triangleright \\mathrm{Get~obs}.\\\\ {\\bf a}_t\\leftarrow \\pi_\\theta (\\cdot |\\mathbf{o}_t). & {} & {\\bf \\nabla}\\triangleright \\mathrm{Decode~next~actions}. \\end{array}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " \n11 \n12 Reconstruct predicted states " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\mathbf{s}_{\\mathrm{pred}} = \\{\\hat{s}_{t,i},\\forall t,i\\}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " by translating actions " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "a_{t,i},\\forall t,i" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " \n13 Compute per-agent per-step " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "r_{t,i}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " via Eq. 2 \n14 Compute normalized return via Eq. 4 and update " + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "inline_equation", + "content": "\\pi_{\\theta}" + }, + { + "bbox": [ + 134, + 142, + 480, + 358 + ], + "type": "text", + "content": " via Eq. 5" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": "During fine-tuning, we run the model for " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " prediction steps. The encoder first encodes the scene context " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " as a shared scene embedding, before the autoregressive decoding. At each prediction step " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": ", the fixed scene embedding and the " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "t \\times N" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " tokens are fed to the autoregressive decoder and sample " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " new actions. Specifically, at prediction step " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "t = 1" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": ", we project the agents' current positions through a MLP and get the agent embeddings: " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "id_i = \\mathrm{MLP}(Pos_{0,i}), i = 1, \\dots, N" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": ". The agent and scene embeddings serve as the input tokens to the decoder. After several layers of self-attention and cross-attention, " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " actions are sampled from the categorical distributions constructed from the output of the decoder. The embeddings of those sampled actions will be added with corresponding " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "id_i" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " and concatenated with the tokens in previous steps to form the input tokens for the next step. Compared to the decoding process of a language model, we output " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " tokens concurrently at each prediction step instead of one token. Our model autoregressively rolls out the actions in " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " time steps. After collecting the rollout trajectories, we translate the actions to sequences of 2D positions for computing the rewards following Eq. 2. The return (i.e. the \"reward-to-go\"), for step " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " and each agent " + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 384, + 482, + 589 + ], + "type": "text", + "content": " is:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 260, + 598, + 480, + 632 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 260, + 598, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 260, + 598, + 480, + 632 + ], + "type": "interline_equation", + "content": "R _ {t, i} = \\sum_ {t ^ {\\prime} = t} ^ {T _ {\\text {p r e d}}} \\gamma^ {t ^ {\\prime} - t} r _ {t ^ {\\prime}, i}. \\tag {3}", + "image_path": "a0d580ff655615b55ecbc784681b6cf9853bd008b22d636d84e90dbb319f74b3.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": "We normalize the return across the whole training batch, here Mean and Std are the average and the standard deviation computed across all time steps in all" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 331, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 331, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 331, + 128 + ], + "type": "text", + "content": "scenarios for all agents in the training batch:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 234, + 139, + 481, + 152 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 234, + 139, + 481, + 152 + ], + "spans": [ + { + "bbox": [ + 234, + 139, + 481, + 152 + ], + "type": "interline_equation", + "content": "\\tilde {R} _ {t, i} = \\left(R _ {t, i} - \\operatorname {M e a n} (R)\\right) / \\operatorname {S t d} (R). \\tag {4}", + "image_path": "ffe7319ad8def0d7db2e398fd032680fa813e0cd4f1f446f5668fe2167896ae9.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 161, + 481, + 185 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 161, + 481, + 185 + ], + "spans": [ + { + "bbox": [ + 131, + 161, + 481, + 185 + ], + "type": "text", + "content": "We then apply the REINFORCE [35] method to compute a policy gradient for optimizing the model by differentiating the following surrogate objective:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 233, + 196, + 481, + 229 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 196, + 481, + 229 + ], + "spans": [ + { + "bbox": [ + 233, + 196, + 481, + 229 + ], + "type": "interline_equation", + "content": "\\max _ {\\pi_ {\\theta}} \\mathbb {E} _ {\\mathcal {D}} \\sum_ {t = 1} ^ {T _ {\\text {p r e d}}} \\sum_ {i \\in \\mathcal {I}} \\log \\pi_ {\\theta} \\left(a _ {t, i} \\mid o _ {t, i}\\right) \\tilde {R} _ {t, i}. \\tag {5}", + "image_path": "ba0aaac21b70cb290b02d67a7adc1ff600562c95c8bb037a6fcd9874067f48a0.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 247, + 329, + 260 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 247, + 329, + 260 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 329, + 260 + ], + "type": "text", + "content": "4.2 Policy Evaluation for Sim Agents" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 269, + 482, + 365 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 269, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 269, + 482, + 365 + ], + "type": "text", + "content": "A key limitation of common \"imitative\" metrics (such as ADE), which compare model rollouts to ground truth trajectories, is the weak connection between the metric and the actual goal of assessing the AD planner performance. A low ADE metric does not guarantee good driving behaviors. Log-replay, for example, has a perfect ADE of zero but would be a poor choice for sim agents because it is non-reactive. To create an evaluation that has a direct connection to measuring the performance of the AD planners, we propose a new policy evaluation framework for sim agents, inspired by the RL policy evaluation literature [32]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 365, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 482, + 569 + ], + "type": "text", + "content": "Our policy evaluation framework involves ranking and scoring the performance of a predetermined collection of AD planner policies. This is analogous to a real-world use case where one must decide which planner to deploy from a collection of candidate software releases. A better sim-agent model will give a more accurate signal on which policy would be best when deployed in the real world. As shown in Fig. 4, we first prepare a batch of AD planner policies with known performance ranking. Then, we evaluate the performance of these AD planners when the traffic agents in the scenario are controlled by a sim agent model. Therefore, we will generate the estimated performance for those AD planners for the specific sim agent. We then measure the discrepancy between the estimated performance and the ground truth performance of those planners. This discrepancy becomes the measurement of the sim agents model's ability to assess the performance of the planners. Policy evaluation covers two important use cases for the sim agent models in the deployment of autonomous vehicles: evaluation, where we wish to estimate the performance of agents in the simulation, and selection, where we wish to determine a ranking or order between different deployment candidates." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 582, + 482, + 666 + ], + "type": "text", + "content": "Choice of policies. In order to perform policy evaluation, we must have a fixed set of policies on hand to rank or evaluate. To generate a large variety of planning policies with both good and bad performance, we propose to use a random shooting search-based policy family, parameterized by the number " + }, + { + "bbox": [ + 131, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "(J)" + }, + { + "bbox": [ + 131, + 582, + 482, + 666 + ], + "type": "text", + "content": " and depth " + }, + { + "bbox": [ + 131, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "(D)" + }, + { + "bbox": [ + 131, + 582, + 482, + 666 + ], + "type": "text", + "content": " of trajectories sampled. We compute a \"ground truth\" score for each policy by evaluating it with log playback agents. Note that the choice of ground truth is an important design decision. Any sim agent could serve as a ground truth," + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 116, + 475, + 216 + ], + "blocks": [ + { + "bbox": [ + 141, + 116, + 475, + 216 + ], + "lines": [ + { + "bbox": [ + 141, + 116, + 475, + 216 + ], + "spans": [ + { + "bbox": [ + 141, + 116, + 475, + 216 + ], + "type": "image", + "image_path": "a741a19cd8b763af10b8d8d4b51f68097b11fc501a4e0e87ac7d1b1443d69623.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 136, + 226, + 476, + 239 + ], + "lines": [ + { + "bbox": [ + 136, + 226, + 476, + 239 + ], + "spans": [ + { + "bbox": [ + 136, + 226, + 476, + 239 + ], + "type": "text", + "content": "Fig. 4: We evaluate the sim agent by its ability to correctly assess the AD planner." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 258, + 479, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 258, + 479, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 479, + 282 + ], + "type": "text", + "content": "but we need to pick one that is the most fair to all models and we believe log playback to be the most neutral." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "spans": [ + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "text", + "content": "Our random shooting policy operates in a model-predictive control (MPC) fashion: at each time step, our random shooting policy samples from a fixed library of " + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "text", + "content": " trajectories, which are generated by maintaining a single steering wheel angle and acceleration for " + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "text", + "content": " steps. Note that this action specification is different from the action space of the MotionLM architecture we described in Sec. 4. We found this simple strategy to work much better than randomly selected actions. The trajectories are then scored by a reward function and the first step of the best scoring trajectory is executed. This process repeats for the entirety of the rollout. We used 16 different settings of " + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "inline_equation", + "content": "J" + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "text", + "content": ", ranging between 9 to 81, and we used 4 values of depth " + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "inline_equation", + "content": "D \\in [6,8,12,16]" + }, + { + "bbox": [ + 130, + 283, + 480, + 415 + ], + "type": "text", + "content": ". We then used the product of these two sets, for a total of 64 different policies evaluated." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "spans": [ + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "text", + "content": "Reward Function. The reward function used for selecting actions from a set of candidate trajectories is a linear combination of collisions, as well as off-road and route-following infractions. We use a modified reward function from Eq. 2 by replacing the L2 norm from the ground truth (which is not available to the planner at execution time) with additional terms for following a reasonable path. We instead give the planner a high-level route in the form of waypoints, and we use a weighted sum of " + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "inline_equation", + "content": "-10C - O - R + 10^{-4}P" + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "inline_equation", + "content": "C \\in \\{0,1\\}" + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "text", + "content": " denotes the collision indicator and is 1 when a collision between AV and another object happens, " + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "inline_equation", + "content": "O \\in \\{0,1\\}" + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "text", + "content": " denotes the offroad indicator and is 1 when the AV is too close to the road edge, " + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "inline_equation", + "content": "R \\in \\{0,1\\}" + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "text", + "content": " denotes the off-route indicator which is 1 when the AV's lateral distance to the GT trajectory exceeds a threshold, and " + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "inline_equation", + "content": "P" + }, + { + "bbox": [ + 130, + 424, + 482, + 591 + ], + "type": "text", + "content": " is the projection of the AV's displacement between two time steps when projected onto the logged trajectory and measures the route-following behavior. We use Waymax [9]'s utility function to compute those metrics." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 607, + 230, + 620 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 607, + 230, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 607, + 230, + 620 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 480, + 666 + ], + "type": "text", + "content": "We now describe our method's experimental results on the Waymo Open Sim Agents Challenge (WOSAC) [20] and on the Policy Evaluation task introduced in Sec. 4.2. Our experiments are designed to answer the following questions:" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 114, + 479, + 194 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 479, + 194 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 479, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 479, + 194 + ], + "type": "table", + "html": "
Lin. Speed↑Lin. Acc.↑Ang. Speed↑Ang. Acc.↑Dist. to Obj.↑Collision↑TTC↑Dist. to Road Edge↑Offroad↑Composite↑ADE↓MinADE↓
Random0.0020.0440.0740.1200.0000.0000.7340.1780.2870.15550.73950.706
Constant Velocity0.0740.0580.0190.0350.2080.3450.7370.4540.4550.2877.9237.923
Wayformer0.3310.0980.4130.4060.2970.8700.7820.5920.8660.5752.4982.498
MVTE0.4450.2220.5350.4810.3830.8930.8320.6640.9080.6453.8591.674
Logged Oracle0.5610.3300.5630.4890.4851.0000.8810.7131.0000.7220.0000.000
Pre-trained (1M)0.3900.2350.5040.4470.3480.5440.8030.5820.5250.4906.3323.177
RL-only (1M)0.2570.1150.4870.4290.2440.2390.7590.4560.1640.3207.7856.918
Fine-tuned (1M)0.4120.2190.4510.4200.3480.8630.8140.6370.8040.5972.4361.867
Pre-trained (10M)0.4390.2410.5020.4540.3710.6730.8110.6250.6550.5494.5082.274
Fine-tuned (10M)0.4330.2200.4550.4230.3610.8770.8190.6470.8250.6082.4281.706
", + "image_path": "51aedc14d751b9a404c60c52b97eca46111fdde66b59f7455b42f295d0502ee1.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + }, + { + "bbox": [ + 132, + 194, + 481, + 258 + ], + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 258 + ], + "type": "text", + "content": "Table 1: Results on the Waymo Open Sim Agents Challenge (WOSAC) benchmark. Metrics marked with " + }, + { + "bbox": [ + 132, + 194, + 481, + 258 + ], + "type": "inline_equation", + "content": "(\\uparrow)" + }, + { + "bbox": [ + 132, + 194, + 481, + 258 + ], + "type": "text", + "content": " are better if higher, while metrics marked with " + }, + { + "bbox": [ + 132, + 194, + 481, + 258 + ], + "type": "inline_equation", + "content": "(\\downarrow)" + }, + { + "bbox": [ + 132, + 194, + 481, + 258 + ], + "type": "text", + "content": " are better if lower. Fine-tuned agents score better than pre-trained agents on safety-critical metrics such as collision and offroad, which results in a significantly higher composite metric score. We bold the best results for the baseline agents and best results from the model we trained for this work." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_footnote" + } + ], + "index": 2 + }, + { + "bbox": [ + 135, + 293, + 479, + 353 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 135, + 293, + 423, + 305 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 293, + 423, + 305 + ], + "spans": [ + { + "bbox": [ + 135, + 293, + 423, + 305 + ], + "type": "text", + "content": "1. Does RL fine-tuning improve the overall sim agents behavior?" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 135, + 305, + 479, + 329 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 305, + 479, + 329 + ], + "spans": [ + { + "bbox": [ + 135, + 305, + 479, + 329 + ], + "type": "text", + "content": "2. Can fine-tuning be used to improve targeted metrics through reward engineering?" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 135, + 329, + 479, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 329, + 479, + 353 + ], + "spans": [ + { + "bbox": [ + 135, + 329, + 479, + 353 + ], + "type": "text", + "content": "3. Does the fine-tuned sim agents model provide better evaluation of AD planner performance?" + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 365, + 482, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 482, + 449 + ], + "type": "text", + "content": "Dataset. We train our method and baselines on the Waymo Open Motion Dataset (WOMD) [15] and evaluate on the Waymo Open Sim Agents Challenge (WOSAC) benchmark [20]. WOMD contains scenarios recorded at " + }, + { + "bbox": [ + 132, + 365, + 482, + 449 + ], + "type": "inline_equation", + "content": "10\\mathrm{Hz}" + }, + { + "bbox": [ + 132, + 365, + 482, + 449 + ], + "type": "text", + "content": " including one second of history (11 discrete time steps), and 8 seconds of future states (80 time steps) to predict. In total, there are 486k training scenarios, 44k validation scenarios, and 45k test scenarios. Up to 128 agents are simulated in each scenario." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 460, + 494, + 508 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 460, + 494, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 460, + 494, + 508 + ], + "type": "text", + "content": "Model. We use a pre-trained autoregressive motion prediction model MotionLM [28]. For the MotionLM model with 10M parameters, we use 4 encoder and 4 decoder layers. The hidden size is 256. The number of attention heads is 4. The activation is ReLU. The feed-forward network intermediate size is 1024." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 520, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 520, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 132, + 520, + 482, + 592 + ], + "type": "text", + "content": "Training. We pre-train a MotionLM model on the WOMD training set with the objective in Eq. 1. The model is then used for RL fine-tuning. The encoder and the decoder of the model are fine-tuned jointly. 1M steps of updates are conducted both in pre-training and fine-tuning. At each training step, 128 scenarios are sampled from the dataset to form a batch. During RL fine-tuning, the learning rate is set to 5e-6 and the discount factor is set to 0.95." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 609, + 343, + 622 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 609, + 343, + 622 + ], + "spans": [ + { + "bbox": [ + 133, + 609, + 343, + 622 + ], + "type": "text", + "content": "5.1 Waymo Open Sim Agents Challenge" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "content": "Baselines. We include several notable baselines reported by [20] on WOSAC. The \"random\" and \"constant velocity\" agents are included to provide a reasonable performance lower bound. The \"logged oracle\" represents the ground truth future" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 201 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 201 + ], + "type": "text", + "content": "behavior that is not visible to other baselines and represents an upper-bound on performance. Wayformer [23] is a recent transformer-based model which shares the same encoder structure as our model. MVTE [34] is another transformer-based architecture which is the current state-of-the-art on the benchmark. Both Wayformer and MVTE adopt the agent-centric input representation. We also report the performance of our pre-trained 1M parameter and 10M parameter models, which are based on the MotionLM [28] architecture." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 211, + 482, + 354 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 211, + 482, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 211, + 482, + 354 + ], + "type": "text", + "content": "Evaluation Metrics. The Waymo Open Sim Agents challenge evaluates agents on a wide range of likelihood-based metrics. These metrics are designed to measure realistic simulation in aggregate over the entire dataset, while allowing agents to have enough flexibility to deviate from the exact logged ground truth in each scenario. Each benchmarked method samples 32 rollouts for each WOMD test scenario. Metrics (such as velocity and heading angle) are then measured on these samples, but binned into discrete histograms, and the log-likelihood of the ground-truth data is measured under these histograms. The individual scores are then weighted and averaged to produce a final composite metric. In addition, following WOSAC [21] we also report the mean average displacement error (ADE) over 32 rollouts and the minimum average displacement error (minADE) over 32 rollouts." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 365, + 482, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 365, + 482, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 482, + 510 + ], + "type": "text", + "content": "Results. We report our results on WOSAC in Table 1. The results provide strong evidence that closed-loop fine-tuning from a pre-trained model can significantly improve performance of the model as a sim agent. We see that both the \"Finetuned 1M\" and \"Finedtuned 10M\" models perform better than \"Pre-trained 1M\" and \"Pre-trained 10M\", respectively. When we look at the breakdown of the constituent metrics, we see that most of the gains come from improved safety-critical metrics such as collision and offroad. As a concrete example, Fig. 5 illustrates a single scenario comparing a rollout from a pre-trained 1M parameter model with a fine-tuned model. The pre-trained model is prone to slowly drifting away from the ground truth trajectory, a distribution shift problem commonly impacting pure imitative and teacher forcing [27] methods. By training the model in closed-loop, we can mitigate this distribution shift issue." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "type": "text", + "content": "The composite performance of \"Fine-tuned 10M\" is still lower than the state-of-the-art MVTE [34] model. We believe this can be mostly attributed to the choice of our pre-trained baseline model, which was our re-implemented version of the MotionLM [28] architecture with the encoder architecture of Wayformer [23]. We leave the fine-tuning of MVTE using the same methodology described in this work as future work, which we hypothesize would lead to a sizeable performance gain." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "To measure the effect of reward engineering and the ability to target specific metrics with fine-tuning, we ran an ablation study varying the relative weight " + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": " of the collision metric in Eq. 2, with results reported in Table 2. We fine-tuned the 1M parameter model with 4 different collision weights, and reported the collision score versus the ADE of the predictions. We can clearly see that adding some amount of collision penalty improves the collision metric at the cost" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 299, + 365 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 299, + 365 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 299, + 365 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 299, + 365 + ], + "type": "image", + "image_path": "ef81a1ffab23c4af7cdeb885970fe8fcfeeea21512bf5900b85d1b061fed2274.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 189, + 367, + 243, + 375 + ], + "lines": [ + { + "bbox": [ + 189, + 367, + 243, + 375 + ], + "spans": [ + { + "bbox": [ + 189, + 367, + 243, + 375 + ], + "type": "text", + "content": "Pre-trained Model" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 385, + 482, + 463 + ], + "lines": [ + { + "bbox": [ + 130, + 385, + 482, + 463 + ], + "spans": [ + { + "bbox": [ + 130, + 385, + 482, + 463 + ], + "type": "text", + "content": "Fig. 5: Visualization of scenario rollouts using a pre-trained and a fine-tuned model. The start locations of vehicles are marked with a red star, the ground truth futures are marked with a solid black line, and the sampled trajectory is marked with circles of different colors. Left: The pre-trained model suffers from drifting due to distributional shift between training (with teacher forcing) and testing (with an autoregressive rollout). Right: The fine-tuned model is able to follow the ground truth much more precisely, which is quantitatively demonstrated by the better ADE metric." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 315, + 114, + 480, + 365 + ], + "blocks": [ + { + "bbox": [ + 315, + 114, + 480, + 365 + ], + "lines": [ + { + "bbox": [ + 315, + 114, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 315, + 114, + 480, + 365 + ], + "type": "image", + "image_path": "347aa08ec18f237e7b60e1e2b5cff31fb7c829a4e8fdf7b7b26e2f2109fad7af.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 371, + 367, + 424, + 375 + ], + "lines": [ + { + "bbox": [ + 371, + 367, + 424, + 375 + ], + "spans": [ + { + "bbox": [ + 371, + 367, + 424, + 375 + ], + "type": "text", + "content": "Fine-tuned Model" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 175, + 478, + 440, + 548 + ], + "blocks": [ + { + "bbox": [ + 175, + 478, + 440, + 548 + ], + "lines": [ + { + "bbox": [ + 175, + 478, + 440, + 548 + ], + "spans": [ + { + "bbox": [ + 175, + 478, + 440, + 548 + ], + "type": "table", + "html": "
Collision WeightCollision ↑TTC ↑Composite ↑ADE ↓MinADE ↓
00.8340.8100.5902.4051.871
20.8630.8140.5972.4361.867
50.8440.8170.5952.8381.980
100.8310.8170.5943.0582.023
", + "image_path": "ea9ff6f31c3b8a7cd01ec246c8d6a8ca220d2420869c4ee94abfbb91f5cb8f33.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 548, + 482, + 593 + ], + "lines": [ + { + "bbox": [ + 130, + 548, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 548, + 482, + 593 + ], + "type": "text", + "content": "Table 2: WOSAC benchmark scores for different values of the collision fine-tuning weight " + }, + { + "bbox": [ + 130, + 548, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 548, + 482, + 593 + ], + "type": "text", + "content": " with the 1M parameter model. Increasing the collision weight improves the collision score at the cost of decreasing imitative behavior metrics such as ADE. We find a good balance at an intermediate value." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "of degrading the ADE metric. This generally makes sense, as the optimization must trade-off the collision penalty versus the displacement error terms in the reward function. However, we also see that at very high values of the collision" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 154 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 154 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 154 + ], + "type": "text", + "content": "weight, all metrics tend to degrade, and the best result is with an intermediate cost weight. We hypothesize this is the case because displacement error is a very dense and rich reward signal, whereas collision is a more sparse and noisy signal." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 176, + 250, + 189 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 176, + 250, + 189 + ], + "spans": [ + { + "bbox": [ + 131, + 176, + 250, + 189 + ], + "type": "text", + "content": "5.2 Policy Evaluation" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 203, + 482, + 346 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 203, + 482, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 203, + 482, + 346 + ], + "type": "text", + "content": "As described in Sec. 4.2, we also propose to evaluate sim agents through the lens of policy evaluation. In particular, we follow the methodology proposed by [8] and report two metrics used in their benchmark: Spearman's rank correlation and absolute error. Rank correlation is a metric for \"selection\" and measures the ability for the simulation to discern between good and bad policies (AD planners). This is useful for the problem setting where one must select the best policy to deploy from a set of candidates. On the other hand, absolute error is a metric for \"evaluation\" and measures how closely a simulation comes close to estimating the true cost or reward accrued by the policy. This is useful if one is interested in concrete performance numbers such as estimating the rate of a particular event of interest. The sim agent causing less absolute error and higher rank correlation is better for evaluating different planners." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "spans": [ + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "text", + "content": "Given a set of planners with known performance ranking, we assess sim agents by measuring how well they estimate the value function of each planner. We generate a Monte-Carlo estimate of each planner's value by running it on each scenario, where all traffic participants are controlled by the sim agent, and computing the empirical returns of the planner. The returns are then averaged across all scenarios in the WOMD test set to form the estimate of the planner. The value estimates are then compared to a \"ground-truth value\", and we show two quantities, rank correlation and absolute error in Table 3 and Table 4, respectively. Each row in these tables represents the policy evaluation results of a sim agent. A sim agent will generate " + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "inline_equation", + "content": "K = 64" + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "text", + "content": " estimated returns of " + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "text", + "content": " policies (AD planners). Due to the absence of real-world simulation, there is no a universal ground truth sim agent that can fully replicate the realistic behaviors. We cannot know the ground truth returns when running these " + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "text", + "content": " policies in the real world. In this work, we picked the log-playback sim agent as the \"ground truth sim agent\" and considered the average returns of these " + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 348, + 483, + 563 + ], + "type": "text", + "content": " policies when running with the log-playback sim agent as the ground truth value. These form the Log column in Table 3 and Table 4. We also show rank correlation and absolute error relative to each other sim agent we considered for completeness." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Results. Our results are reported in Table 3 and Table 4. We report results on a total of 64 candidate policies created by varying the depth (D) and the number of sampled trajectories (J). According to the Log column, we see that with fine-tuned models, a higher rank correlation and lower absolute error relative to the log-playback sim agent can be achieved, indicating that the fine-tuned models are more accurate at measuring a planner's performance and deciding whether the planner is better than another." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 142, + 91, + 445, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 91, + 445, + 103 + ], + "spans": [ + { + "bbox": [ + 142, + 91, + 445, + 103 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 169, + 114, + 445, + 175 + ], + "blocks": [ + { + "bbox": [ + 169, + 114, + 445, + 175 + ], + "lines": [ + { + "bbox": [ + 169, + 114, + 445, + 175 + ], + "spans": [ + { + "bbox": [ + 169, + 114, + 445, + 175 + ], + "type": "table", + "html": "
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M0.859-0.9540.9530.911
Fine-tuned 1M0.8650.954-0.9590.925
Pre-trained 10M0.8450.9530.959-0.932
Fine-tuned 10M0.8660.9110.9250.932-
", + "image_path": "e231dcace13767b7b03f331adeebe26d9ff76a1a2b4b935eb4295139f18231c4.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 168, + 251, + 445, + 310 + ], + "blocks": [ + { + "bbox": [ + 130, + 175, + 481, + 229 + ], + "lines": [ + { + "bbox": [ + 130, + 175, + 481, + 229 + ], + "spans": [ + { + "bbox": [ + 130, + 175, + 481, + 229 + ], + "type": "text", + "content": "Table 3: Policy evaluation rank correlation results for pre-trained and fine-tuned models (higher is better). Each cell corresponds to a ranking correlation of estimated returns of a set of predefined AD planners between two sim agent models. For example, the highlighted Fine-tuned 10M - Log means the ranking correlation of predefined AD planners when using the Fine-tuned 10M and the log-playback sim agents." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 168, + 251, + 445, + 310 + ], + "lines": [ + { + "bbox": [ + 168, + 251, + 445, + 310 + ], + "spans": [ + { + "bbox": [ + 168, + 251, + 445, + 310 + ], + "type": "table", + "html": "
Sim AgentLogPre. 1MFine. 1MPre. 10MFine. 10M
Pre-trained 1M10.518-0.5570.5511.013
Fine-tuned 1M10.1010.557-0.4260.729
Pre-trained 10M10.0140.5510.426-0.602
Fine-tuned 10M9.5091.0130.7290.602-
", + "image_path": "ea0bff71dcf0445ec15ec9cee2c0308adcce11109b220aef8a475c8f86b047c3.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 310, + 481, + 332 + ], + "lines": [ + { + "bbox": [ + 130, + 310, + 481, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 310, + 481, + 332 + ], + "type": "text", + "content": "Table 4: Policy evaluation rank absolute error results for pre-trained and fine-tuned models (lower is better)." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 365, + 220, + 377 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 220, + 377 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 220, + 377 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 390, + 481, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 481, + 533 + ], + "type": "text", + "content": "We studied the viability of applying the popular \"pre-training and fine-tuning\" scheme to modeling traffic agents for AD simulation. We drew the connection between a multi-agent driving behavior model and a simulation environment - the multi-agent behavior model itself can be used to perform rollouts for closed-loop training. By using an on-policy RL algorithm with a simple reward, we are able to fine-tune a pre-trained large multi-agent behavior model to effectively align the traffic agent behaviors with human expectations, such as collision avoidance. The experimental results show that our method can significantly improve the performance of the pre-trained model on the Waymo Open Sim Agent Challenge (WOSAC) [20]. We also proposed a novel policy evaluation task and demonstrated that the model fine-tuned by our method can achieve more reliable AD testing result." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 534, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 481, + 665 + ], + "type": "text", + "content": "Limitations. There are several limitations to the approach we have discussed in this paper. We use a simple transition and action model (based on predicting accelerations and integrating them to estimate positions) as the environment dynamics model, which could produce kinematically unrealistic behaviors during a rollout. A more realistic solution would be to embed a low-level controller into simulation that attempts to reach the positions predicted by the model. In addition, we studied a reward function (Eq. 2) that encourages collision avoidance and minimizes divergence in closed-loop simulation. The reward function can be extended to induce various driving behaviors, such as encouraging adversarial behavior (e.g. using the negative of the ego vehicle's reward) to stress-test challenging scenarios." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 141, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 141, + 480, + 164 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 141, + 480, + 164 + ], + "spans": [ + { + "bbox": [ + 138, + 141, + 480, + 164 + ], + "type": "text", + "content": "1. Argall, B.D., Chernova, S., Veloso, M., Browning, B.: A survey of robot learning from demonstration. Robotics and autonomous systems 57(5), 469-483 (2009)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 165, + 480, + 208 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 165, + 480, + 208 + ], + "spans": [ + { + "bbox": [ + 138, + 165, + 480, + 208 + ], + "type": "text", + "content": "2. Bergamini, L., Ye, Y., Scheel, O., Chen, L., Hu, C., Del Pero, L., Osinski, B., Grimmett, H., Ondruska, P.: Simnet: Learning reactive self-driving simulations from real-world observations. In: 2021 IEEE International Conference on Robotics and Automation (ICRA). pp. 5119-5125. IEEE (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 209, + 480, + 231 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 209, + 480, + 231 + ], + "spans": [ + { + "bbox": [ + 138, + 209, + 480, + 231 + ], + "type": "text", + "content": "3. Black, K., Janner, M., Du, Y., Kostrikov, I., Levine, S.: Training diffusion models with reinforcement learning. arXiv preprint arXiv:2305.13301 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 232, + 480, + 265 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 232, + 480, + 265 + ], + "spans": [ + { + "bbox": [ + 138, + 232, + 480, + 265 + ], + "type": "text", + "content": "4. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in neural information processing systems 33, 1877-1901 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 265, + 480, + 297 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 265, + 480, + 297 + ], + "spans": [ + { + "bbox": [ + 138, + 265, + 480, + 297 + ], + "type": "text", + "content": "5. Codevilla, F., Müller, M., López, A., Koltun, V., Dosovitskiy, A.: End-to-end driving via conditional imitation learning. In: 2018 IEEE international conference on robotics and automation (ICRA). pp. 4693-4700. IEEE (2018)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 298, + 480, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 298, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 298, + 480, + 331 + ], + "type": "text", + "content": "6. Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., Koltun, V.: CARLA: An open urban driving simulator. In: Proceedings of the 1st Annual Conference on Robot Learning. pp. 1-16 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 332, + 480, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 480, + 365 + ], + "type": "text", + "content": "7. Feng, L., Li, Q., Peng, Z., Tan, S., Zhou, B.: Trafficgen: Learning to generate diverse and realistic traffic scenarios. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3567-3575. IEEE (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 365, + 480, + 398 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 365, + 480, + 398 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 480, + 398 + ], + "type": "text", + "content": "8. Fu, J., Norouzi, M., Nachum, O., Tucker, G., Novikov, A., Yang, M., Zhang, M.R., Chen, Y., Kumar, A., Paduraru, C., et al.: Benchmarks for deep off-policy evaluation. In: International Conference on Learning Representations (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 399, + 480, + 431 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 399, + 480, + 431 + ], + "spans": [ + { + "bbox": [ + 138, + 399, + 480, + 431 + ], + "type": "text", + "content": "9. Gulino, C., Fu, J., Luo, W., Tucker, G., Bronstein, E., Lu, Y., Harb, J., Pan, X., Wang, Y., Chen, X., et al.: Waymax: An accelerated, data-driven simulator for large-scale autonomous driving research. arXiv preprint arXiv:2310.08710 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 432, + 480, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 432, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 138, + 432, + 480, + 475 + ], + "type": "text", + "content": "10. Hu, Y., Yang, J., Chen, L., Li, K., Sima, C., Zhu, X., Chai, S., Du, S., Lin, T., Wang, W., et al.: Planning-oriented autonomous driving. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 17853-17862 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 476, + 480, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 476, + 480, + 531 + ], + "spans": [ + { + "bbox": [ + 138, + 476, + 480, + 531 + ], + "type": "text", + "content": "1. Kamenev, A., Wang, L., Bohan, O.B., Kulkarni, I., Kartal, B., Molchanov, A., Birchfield, S., Nister, D., Smolyanskiy, N.: Predictionnet: Real-time joint probabilistic traffic prediction for planning, control, and simulation. In: 2022 International Conference on Robotics and Automation (ICRA). pp. 8936-8942. IEEE (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 532, + 480, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 532, + 480, + 553 + ], + "spans": [ + { + "bbox": [ + 138, + 532, + 480, + 553 + ], + "type": "text", + "content": "2. Leurent, E.: An environment for autonomous driving decision-making. https://github.com/eleurent/highway-env (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 554, + 480, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 554, + 480, + 586 + ], + "spans": [ + { + "bbox": [ + 138, + 554, + 480, + 586 + ], + "type": "text", + "content": "3. Li, Q., Peng, Z., Feng, L., Liu, Z., Duan, C., Mo, W., Zhou, B.: ScenarioNet: Open-source platform for large-scale traffic scenario simulation and modeling. Advances in Neural Information Processing Systems (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 587, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 587, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 138, + 587, + 480, + 620 + ], + "type": "text", + "content": "4. Li, Q., Peng, Z., Feng, L., Zhang, Q., Xue, Z., Zhou, B.: Metadrive: Composing diverse driving scenarios for generalizable reinforcement learning. IEEE transactions on pattern analysis and machine intelligence (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 621, + 439, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 439, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 439, + 632 + ], + "type": "text", + "content": "5. LLC, W.: Waymo open dataset: An autonomous driving dataset (2019)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "6. Lu, J., Batra, D., Parikh, D., Lee, S.: Vilbert: Pretraining task-agnostic visiolinguistic representations for vision-and-language tasks. Advances in neural information processing systems 32 (2019)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 171 + ], + "type": "text", + "content": "17. Lu, Y., Fu, J., Tucker, G., Pan, X., Bronstein, E., Roelofs, R., Sapp, B., White, B., Faust, A., Whiteson, S., et al.: Imitation is not enough: Robustifying imitation with reinforcement learning for challenging driving scenarios. In: 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 7553-7560. IEEE (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "text", + "content": "18. Mendez-Lucio, O., Nicolaou, C.A., Earnshaw, B.: Mole: a molecular foundation model for drug discovery. In: NeurIPS 2022 Workshop on Learning Meaningful Representations of Life (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 205, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 481, + 226 + ], + "type": "text", + "content": "19. Min, C., Zhao, D., Xiao, L., Nie, Y., Dai, B.: Uniworld: Autonomous driving pretraining via world models. arXiv preprint arXiv:2308.07234 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 259 + ], + "type": "text", + "content": "20. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "text", + "content": "21. Montali, N., Lambert, J., Mougin, P., Kuefler, A., Rhinehart, N., Li, M., Gulino, C., Emrich, T., Yang, Z., Whiteson, S., et al.: The waymo open sim agents challenge. arXiv preprint arXiv:2305.12032 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 481, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 326 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 326 + ], + "type": "text", + "content": "22. Moor, M., Banerjee, O., Abad, Z.S.H., Krumholz, H.M., Leskovec, J., Topol, E.J., Rajpurkar, P.: Foundation models for generalist medical artificial intelligence. Nature 616(7956), 259-265 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 326, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 481, + 369 + ], + "type": "text", + "content": "23. Nayakanti, N., Al-Rfou, R., Zhou, A., Goel, K., Refaat, K.S., Sapp, B.: Wayformer: Motion forecasting via simple & efficient attention networks. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 2980-2987. IEEE (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 369, + 307, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 307, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 307, + 380 + ], + "type": "text", + "content": "24. OpenAI: Gpt-4 technical report (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 380, + 481, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 481, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 481, + 423 + ], + "type": "text", + "content": "25. Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., et al.: Training language models to follow instructions with human feedback. Advances in Neural Information Processing Systems 35, 27730-27744 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 456 + ], + "type": "text", + "content": "26. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "type": "text", + "content": "27. Ross, S., Gordon, G., Bagnell, D.: A reduction of imitation learning and structured prediction to no-regret online learning. In: Proceedings of the fourteenth international conference on artificial intelligence and statistics. pp. 627-635. JMLR Workshop and Conference Proceedings (2011)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 544 + ], + "type": "text", + "content": "28. Seff, A., Cera, B., Chen, D., Ng, M., Zhou, A., Nayakanti, N., Refaat, K.S., Al-Rfou, R., Sapp, B.: Motionlm: Multi-agent motion forecasting as language modeling. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8579-8590 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 544, + 481, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 481, + 577 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 481, + 577 + ], + "type": "text", + "content": "29. Shi, S., Jiang, L., Dai, D., Schiele, B.: Motion transformer with global intention localization and local movement refinement. Advances in Neural Information Processing Systems 35, 6531-6543 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 577, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 577, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 577, + 481, + 610 + ], + "type": "text", + "content": "30. Shi, S., Jiang, L., Dai, D., Schiele, B.: Mtr++: Multi-agent motion prediction with symmetric scene modeling and guided intention querying. arXiv preprint arXiv:2306.17770 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "type": "text", + "content": "31. Suo, S., Regalado, S., Casas, S., Urtasun, R.: Trafficsim: Learning to simulate realistic multi-agent behaviors. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10400-10409 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "text", + "content": "32. Uehara, M., Shi, C., Kallus, N.: A review of off-policy evaluation in reinforcement learning. arXiv preprint arXiv:2212.06355 (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 102 + ], + "type": "text", + "content": "Z. Peng et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 512 + ], + "type": "list", + "angle": 0, + "index": 13, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "33. Vinitsky, E., Lichtlé, N., Yang, X., Amos, B., Foerster, J.: Nocturne: a scalable driving benchmark for bringing multi-agent learning one step closer to the real world. Advances in Neural Information Processing Systems 35, 3962-3974 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 172 + ], + "type": "text", + "content": "34. Wang, Y., Zhao, T., Yi, F.: Multiverse transformer: 1st place solution for waymo open sim agents challenge 2023. arXiv preprint arXiv:2306.11868 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 193 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 193 + ], + "type": "text", + "content": "35. Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8, 229-256 (1992)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 216 + ], + "type": "text", + "content": "36. Zhang, C., Tu, J., Zhang, L., Wong, K., Suo, S., Urtasun, R.: Learning realistic traffic agents in closed-loop. In: 7th Annual Conference on Robot Learning (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 216, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 258 + ], + "type": "text", + "content": "37. Zhang, Q., Gao, Y., Zhang, Y., Guo, Y., Ding, D., Wang, Y., Sun, P., Zhao, D.: Trajgen: Generating realistic and diverse trajectories with reactive and feasible agent behaviors for autonomous driving. IEEE Transactions on Intelligent Transportation Systems 23(12), 24474-24487 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 481, + 292 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 292 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 292 + ], + "type": "text", + "content": "38. Zhang, Z., Liniger, A., Dai, D., Yu, F., Van Gool, L.: Trafficbots: Towards world models for autonomous driving simulation and motion prediction. arXiv preprint arXiv:2303.04116 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "text", + "content": "39. Zhong, Z., Rempe, D., Xu, D., Chen, Y., Veer, S., Che, T., Ray, B., Pavone, M.: Guided conditional diffusion for controllable traffic simulation. In: 2023 IEEE International Conference on Robotics and Automation (ICRA). pp. 3560-3566. IEEE (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "40. Zhou, C., Li, Q., Li, C., Yu, J., Liu, Y., Wang, G., Zhang, K., Ji, C., Yan, Q., He, L., et al.: A comprehensive survey on pretrained foundation models: A history from bert to chatgpt. arXiv preprint arXiv:2302.09419 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 445 + ], + "type": "text", + "content": "41. Zhou, M., Luo, J., Villella, J., Yang, Y., Rusu, D., Miao, J., Zhang, W., Alban, M., Fadakar, I., Chen, Z., Huang, A.C., Wen, Y., Hassanzadeh, K., Graves, D., Chen, D., Zhu, Z., Nguyen, N., Elsayed, M., Shao, K., Ahilan, S., Zhang, B., Wu, J., Fu, Z., Rezaee, K., Yadmellat, P., Rohani, M., Nieves, N.P., Ni, Y., Banijamali, S., Rivers, A.C., Tian, Z., Palenicek, D., bou Ammar, H., Zhang, H., Liu, W., Hao, J., Wang, J.: Smarts: Scalable multi-agent reinforcement learning training school for autonomous driving (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "text", + "content": "42. Zhou, Y., Chia, M.A., Wagner, S.K., Ayhan, M.S., Williamson, D.J., Struyven, R.R., Liu, T., Xu, M., Lozano, M.G., Woodward-Court, P., et al.: A foundation model for generalizable disease detection from retinal images. Nature pp. 1-8 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "type": "text", + "content": "43. Zitkovich, B., Yu, T., Xu, S., Xu, P., Xiao, T., Xia, F., Wu, J., Wohlhart, P., Welker, S., Wahid, A., et al.: Rt-2: Vision-language-action models transfer web knowledge to robotic control. In: 7th Annual Conference on Robot Learning (2023)" + } + ] + } + ], + "index": 12 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 143, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Agent Behaviors with RL Fine-tuning for Autonomous Driving" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_content_list.json b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..961bda8c9f28cb331cff611dc681e6d20e97c7cf --- /dev/null +++ b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_content_list.json @@ -0,0 +1,2717 @@ +[ + { + "type": "text", + "text": "Improving Diffusion Models for Authentic Virtual Try-on in the Wild", + "text_level": 1, + "bbox": [ + 261, + 140, + 741, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yisol Choi $^{1}$ , Sangkyung Kwak $^{1}$ , Kyungmin Lee $^{1}$ , Hyungwon Choi $^{2}$ , and Jinwoo Shin $^{1}$", + "bbox": [ + 323, + 210, + 679, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Korea Advanced Institute of Science and Technology (KAIST) {yisol.choi, skkwak9806, kyungmnlee, jinwoos}@kaist.ac.kr", + "bbox": [ + 277, + 253, + 720, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 OMNIOUS.AI", + "bbox": [ + 444, + 282, + 557, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "hyungwon.choi@omnious.com", + "bbox": [ + 401, + 297, + 599, + 310 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/abfd15de2ab00ed8d9d65a429eceeab551e878ae35f1afff2f682480f7711793.jpg", + "image_caption": [ + "Fig. 1: Virtual try-on images generated by using our IDM-VTON on VITON-HD [3] (top row, first and second column), DressCode [32] (top row, third and fourth column), and collected In-the-Wild dataset (bottom row). Best viewed on a zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 225, + 348, + 772, + 535 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. This paper considers image-based virtual try-on, which renders an image of a person wearing a curated garment, given a pair of images depicting the person and the garment, respectively. Previous works adapt existing exemplar-based inpainting diffusion models for virtual try-on to improve the naturalness of the generated visuals compared to other methods (e.g., GAN-based), but they fail to preserve the identity of the garments. To overcome this limitation, we propose a novel diffusion model that improves garment fidelity and generates authentic virtual try-on images. Our method, coined $IDM - VTON$ , uses two different modules to encode the semantics of garment image; given the base UNet of the diffusion model, 1) the high-level semantics extracted from a visual encoder are fused to the cross-attention layer, and then 2) the low-level features extracted from parallel UNet are fused to the self-attention layer. In addition, we provide detailed textual prompts for both garment and person images to enhance the authenticity of the generated visuals. Finally, we present a customization method using a", + "bbox": [ + 259, + 618, + 743, + 840 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "pair of person-garment images, which significantly improves fidelity and authenticity. Our experimental results show that our method outperforms previous approaches (both diffusion-based and GAN-based) in preserving garment details and generating authentic virtual try-on images, both qualitatively and quantitatively. Furthermore, the proposed customization method demonstrates its effectiveness in a real-world scenario. More visualizations are available in our project page.", + "bbox": [ + 259, + 147, + 743, + 244 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Keywords: Virtual Try-On $\\cdot$ Diffusion Models", + "bbox": [ + 261, + 257, + 581, + 272 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 295, + 375, + 311 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Image-based virtual try-on (VTON) is an important computer vision task, where the goal is to render a visual of an arbitrary person dressing in a specific garment given by images. Due to its convenience and capability to provide a personalized shopping experience to E-commerce users, there is a considerable interest in synthesizing authentic virtual try-on images that exactly depict the garment given as input. The key challenges of VTON is to fit the garment to the human body of various poses or gestures, without creating any distortions in the patterns and textures in garment [12, 51].", + "bbox": [ + 212, + 325, + 785, + 446 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The rapid progress in generative models [8, 14] has led the development of virtual try-on methods. Most of the primary approaches for image-based VTON are based on Generative Adversarial Networks [8, 22] (GANs), where they employ a separate warping module to deform the garment to the human body and use GAN generators to blend with the target person [3, 6, 7, 27, 29, 54]. However, such approaches struggle to generate high-quality images and often fail to generalize to different human images, introducing undesirable distortions to the garment. On the other hand, recently, diffusion models [14, 46] demonstrate superior performance in generating genuine images [30, 36, 39, 40] compared to GANs, showing the potential to overcome such challenges. Recent diffusion-based VTON methods [4, 9, 23, 28, 31, 35] utilize the rich generative prior of pretrained text-to-image (T2I) diffusion models [34, 40, 43] to enhance the naturalness of try-on images. To identify the details of garments, they encode the semantics of garments in pseudo-words [31] or use explicit warping networks [9]. However, those methods fall short in preserving the fine-grained details of garments, e.g., patterns, textures, shapes, or colors, which hinders its application to real-world scenarios.", + "bbox": [ + 212, + 446, + 787, + 702 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To overcome this limitation, this paper proposes an Improved Diffusion Models for Virtual Try-ON(IDM-VTON), which significantly enhances the consistency of the garment image, while generating authentic virtual try-on images. In specific, we design a new approach in conditioning garment images to the diffusion model by designing sophisticated attention modules, which consist of two different components: 1) the image prompt adapter that encodes the high-level semantics of the garment, and 2) the UNet encoder, which we refer to as GarmentNet, that extracts low-level features to preserve fine-grained details. In addition, we propose to customize our model using a single pair of garment and person images, which", + "bbox": [ + 212, + 704, + 789, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 364, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "further improves the visual quality of virtual try-on images, particularly in the wild scenario. Last but not least, we show the importance of providing detailed captions for the garment image which helps retaining the prior knowledge of T2I diffusion models.", + "bbox": [ + 212, + 146, + 787, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We train our model on VITON-HD [3] training dataset, and demonstrate the effectiveness of our method by showing superior results on VITON-HD and DressCode [32] test datasets both qualitatively and quantitatively. Furthermore, to simulate the real-world virtual try-on application, we have collected In-the-Wild dataset, which contains garments with intricate patterns and human images with various poses and gestures, that is largely different from the training data. Our method outperforms other methods on In-the-Wild dataset, and in particular, customizing our model notably enhances retaining the identity of the garment while generating authentic try-on images.", + "bbox": [ + 212, + 205, + 789, + 343 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 364, + 397, + 382 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Image-based virtual try-on. Given a pair of images depicting a target person and a garment, the image-based virtual try-on aims to generate a look of the target person dressing the given garment. A line of works [3,6,7,27,29,54] is based on Generative Adversarial Networks (GANs) [8], where they first deform the garment to the person body shape, and then use the generator to put the deformed garment on the person image. While many works have attempted to reduce the mismatch between the warped garment and the person [3,7,21,27], those approaches lack generalization to arbitrary person images, e.g., with complex backgrounds or intricate poses.", + "bbox": [ + 212, + 396, + 787, + 530 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "As diffusion models have shown great success [14, 47], recent works have studied the application of diffusion models for virtual try-on. TryOnDiffusion [61] proposed an architecture that uses two parallel UNets, and showed the capability of diffusion-based virtual try-on by training on the large-scale dataset. Subsequent works considered virtual try-on as an exemplar-based image inpainting problem [56]. They fine-tuned the inpainting diffusion models on virtual try-on dataset [9, 23, 31] to generate high-quality virtual try-on images. However, those methods still suffer from preserving meticulous details of garments, dampening their applications to real-world scenarios.", + "bbox": [ + 212, + 532, + 787, + 667 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Adding conditional control to diffusion models. While text-to-image (T2I) diffusion models [34,40,43] have shown their capability in generating high-quality images from text prompts, the inaccuracy of natural language lacks fine-grained control in image synthesis. To this end, various works have proposed to add conditional control to T2I diffusion models [33,57,58,60]. ControlNet [58] and T2I-Adapter [33] proposed to fine-tune extra modules that encode spatial information such as edges, depth, and human pose, to control the diffusion model together with text prompts. Image prompt adapter (IP-Adapter) [57] proposed to condition T2I diffusion models with high-level semantics of reference image to control image generation with both textual and visual prompts.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 130 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Customizing diffusion models. Several works have demonstrated the potential of customizing diffusion models with few personal images [5,11,25,42,45]. Together with parameter efficient fine-tuning methods [16,17] and regularized fine-tuning objective [26], T2I diffusion models can be adapted to unseen examples without catastrophic forgetting. Also, many works have studied the customization of diffusion models for various tasks such as masked image completion [48] or image restoration [2]. In this paper, we first present a customization of diffusion models for virtual try-on, where we show it significantly improves the adaptation to real-world scenarios.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 303, + 330, + 318 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Backgrounds on Diffusion Models", + "text_level": 1, + "bbox": [ + 215, + 332, + 539, + 347 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Diffusion models [14, 44] are generative models that consist of a forward process, which gradually adds Gaussian noise to the data, and a reverse process that gradually denoises a random noise to generate a sample. Suppose $\\mathbf{x}_0$ be a data point (e.g., an image or a latent from the output of autoencoder [40]). Given noise schedules $\\{\\alpha_t\\}_{t=1}^T, \\{\\sigma_t\\}_{t=1}^T$ for $t = 1, \\dots, T$ , the forward process at timestep $t$ is given by $\\mathbf{x}_t = \\alpha_t \\mathbf{x}_0 + \\sigma_t \\boldsymbol{\\epsilon}$ , where $\\boldsymbol{\\epsilon} \\sim \\mathcal{N}(\\mathbf{0}, \\mathbf{I})$ is a Gaussian noise. For sufficiently large $\\sigma_T$ , $\\mathbf{x}_T \\sim \\mathcal{N}(\\alpha_T \\mathbf{x}_0, \\sigma_T^2 \\mathbf{I})$ is indiscernible from pure random Gaussian noise. Then the reverse generative process initializes from $\\mathbf{x}_T \\sim \\mathcal{N}(\\mathbf{0}, \\sigma_T^2 \\mathbf{I})$ , and sequentially denoises $\\mathbf{x}_t$ into $\\mathbf{x}_{t-1}$ for each $t$ , so that $\\mathbf{x}_0$ is distributed according to the data distribution.", + "bbox": [ + 212, + 354, + 787, + 505 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Text-to-image (T2I) diffusion models. T2I diffusion models [34, 40, 43] are diffusion models that model the distribution of image conditioned on text, which is encoded by embeddings using the pretrained text encoders (e.g., T5 [38] and CLIP [37] text encoder). While convolutional UNet [41] architecture has been developed for diffusion-based generative models [14, 47], recent works have shown the promise of fusing transformer [50] architectures for UNet. Training a diffusion model is shown to be equivalent to learning a score function of a perturbed data distribution (i.e., denoising score matching [19]), where it is often done by $\\epsilon$ -noise prediction loss [14]. Formally, given data $\\mathbf{x}_0$ and text embedding $\\mathbf{c}$ , the training loss for the T2I diffusion model is given as follows:", + "bbox": [ + 212, + 525, + 787, + 676 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {D M}} (\\theta) = \\mathbb {E} _ {\\epsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}), t \\sim \\mathcal {U} [ 0, T ]} \\left[ \\omega (t) \\| \\epsilon_ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) - \\epsilon \\| _ {2} ^ {2} \\right], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 308, + 684, + 787, + 704 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\mathbf{x}_t = \\alpha_t\\mathbf{x}_0 + \\sigma_t\\pmb{\\epsilon}$ is a forward process of $\\mathbf{x}_0$ and $\\omega (t)$ is a weighting function at each timestep $t$ . To achieve better controllability over text conditioning, it uses classifier-free guidance (CFG) [15], which jointly learns unconditional and conditional. At the training stage, the text conditioning is randomly dropped out (i.e., giving null-text to the input), and at the inference stage, the CFG interpolates the conditional and unconditional noise output to control the strength of text conditioning:", + "bbox": [ + 212, + 710, + 787, + 816 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) = s \\cdot \\left(\\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) - \\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; t)\\right) + \\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; t), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 318, + 824, + 787, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/d620a900c4da094aa6b9a4ed9e4e5b1d3c3a5be61658f894fa3c11769afe0278.jpg", + "image_caption": [ + "Fig. 2: Overview of IDM-VTON. We demonstrate the proposed model architecture and details on the attention modules. (Left) Our model consists of 1) TryonNet which is a main UNet that processes person image, 2) image prompt adapter (IP-Adapter) [57] that encodes high-level semantics of garment image $\\mathbf{x}_g$ , and 3) GarmentNet that encodes low-level features of $\\mathbf{x}_g$ . As of input for UNet, we concatenate the noised latents $\\mathbf{x}_t$ of latents $\\mathcal{E}(\\mathbf{x}_p)$ with the segmentation mask $\\mathbf{m}$ , masked image $\\mathcal{E}(\\mathbf{x}_m)$ , and Densepose [10] $\\mathcal{E}(\\mathbf{x}_{\\mathrm{pose}})$ . We provide a detailed caption to the garment (e.g., [V]: \"short sleeve round neck t-shirts\"). Then it is used for input prompt of GarmentNet (e.g., \"A photo of [V]\") and TryonNet (e.g., \"Model is wearing [V]\"). (Right) The intermediate features of TryonNet and GarmentNet are concatenated and passed to the self-attention layer, and we use the first half (i.e., that from TryonNet) of the output. Then we fuse the output with features from text encoder and IP-Adapter by cross-attention layer. We fine-tune the TryonNet and the IP-Adapter modules, and freeze other components." + ], + "image_footnote": [], + "bbox": [ + 222, + 148, + 614, + 344 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/7b7d885214474cf2dbe1a29ebd18ba600d64d06b5221901907774096ef6d1618.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 617, + 148, + 772, + 345 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $s \\geqslant 1$ is a guidance scale that controls the text conditioning, and $\\epsilon_{\\theta}(\\mathbf{x}_t; t)$ denotes the noise prediction with null-text embeddings.", + "bbox": [ + 212, + 550, + 784, + 580 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Image prompt adapter [57]. To condition the T2I diffusion model with a reference image, Ye et al. [57] proposed Image Prompt Adapter (IP-Adapter), which leverages the features extracted from image encoder (e.g., CLIP [37] image encoder) and attaches additional cross-attention layer to the text conditioning [40]. Let us denote $Q \\in \\mathbb{R}^{N \\times d}$ be the query matrices from the intermediate representation of UNet, and $K_{c} \\in \\mathbb{R}^{N \\times d}$ , $V_{c} \\in \\mathbb{R}^{N \\times d}$ be the key and value matrices from the text embeddings $\\mathbf{c}$ , where $N$ is number of samples. The output of cross-attention layer is given by $\\text{Attention}(Q, K_{c}, V_{c}) = \\text{softmax}\\left(\\frac{Q K_{c}^{\\top}}{\\sqrt{d}}\\right) \\cdot V_{c}$ . Then IP-Adapter computes key and value matrices $K_{i} \\in \\mathbb{R}^{N \\times d}$ , $V_{i} \\in \\mathbb{R}^{N \\times d}$ from the image embeddings $\\mathbf{i}$ , and inserts the cross-attention layer as follows:", + "bbox": [ + 212, + 601, + 787, + 758 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {A t t e n t i o n} \\left(Q, K _ {c}, V _ {c}\\right) + \\operatorname {A t t e n t i o n} \\left(Q, K _ {i}, V _ {i}\\right). \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 331, + 768, + 787, + 785 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Overall, the IP-Adapter freezes the original UNet, and fine-tunes only the (linear) projection layers of key and value matrices of image embeddings $K_{i}$ and $V_{i}$ , and the linear projection layer that maps CLIP image embeddings.", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Proposed Method", + "text_level": 1, + "bbox": [ + 215, + 146, + 410, + 161 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Now, we present our method for designing diffusion models for virtual try-on. Let us denote $\\mathbf{x}_p$ be the image of a person, and $\\mathbf{x}_g$ be the image of a garment. Our primary goal is to generate an image $\\mathbf{x}_{\\mathrm{tr}}$ that visualizes a person from $\\mathbf{x}_p$ wearing a garment in image $\\mathbf{x}_g$ . It is common practice to cast virtual try-on as an exemplar-based image inpainting problem [56], which aims to fill the masked image with a reference image. Here, it is important to extract relevant information of garment, and add conditional control to the diffusion model. To this end, our model is composed of three components; 1) the base UNet (TryonNet) that processes the masked person image with its pose information, 2) the image prompt adapter (IP-Adapter) that extracts the high-level semantics of the garment, and 3) the garment UNet feature encoder (GarmentNet) that extracts the low-level features of the garment. The features from GarmentNet are fused within self-attention layer of TryonNet, and then it is processed with the features of IP-Adapter through cross-attention layer. We provide an overview of our method in Fig. 2, and provide detailed explanation of each component as follows.", + "bbox": [ + 212, + 170, + 789, + 398 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "TryonNet. For the base UNet model, we consider latent diffusion model [40], where the diffusion generative modeling is conducted in latent space of variational autoencoder $\\mathcal{E}$ and the output is passed to decoder $\\mathcal{D}$ to generate an image. As of the input for our base UNet, we concatenate four components as follows: 1) the latent of person image, i.e., $\\mathcal{E}(\\mathbf{x}_p)$ , 2) the (resized) mask $\\mathbf{m}$ that removes the garment on the person image, 3) the latent of masked-out person image $\\mathbf{x}_m = (1 - \\mathbf{m})\\odot \\mathbf{x}_p$ , i.e., $\\mathcal{E}(\\mathbf{x}_m)$ , following [3], and 4) the latent of the Densepose [10] $\\mathbf{x}_{\\mathrm{pose}}$ of a person image, i.e., $\\mathcal{E}(\\mathbf{x}_{\\mathrm{pose}})$ . Then, the latents are aligned within the channel axis, where we expand the convolutional layer of UNet to 13 channels initialized with zero weights. Unlike previous works on virtual try-on with diffusion models [9, 23, 31], we leverage Stable Diffusion XL (SDXL) [36] inpainting model [49].", + "bbox": [ + 212, + 417, + 789, + 587 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Image prompt adapter. To condition the high-level semantics of a garment image, we leverage image prompt adapter (IP-Adapter) [57]. To encode the garment image, we use frozen CLIP image encoder (i.e., OpenCLIP [20] ViT-H/14) to extract feature and fine-tune feature projection layers and cross-attention layers, which are initialized with pretrained IP-Adapters. Note that we pass textual prompts of garments, and the cross-attention is computed as in Eq. (3).", + "bbox": [ + 212, + 606, + 789, + 699 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "GarmentNet. While we already condition the garment image using IP-Adapter, it falls short in preserving the fine-grained details of garments when it has complicated patterns or graphic prints (e.g., see Fig. 6). This is because the CLIP image encoder lacks extracting the low-level features of a garment. To tackle this issue, we propose to utilize an additional UNet encoder (i.e., garment UNet encoder) to encode fine-details of garment images. Given the latent of a garment image $\\mathcal{E}(\\mathbf{x}_g)$ , we pass through the (frozen) pretrained UNet encoder to obtain the intermediate representation, and concatenate with the intermediate representation", + "bbox": [ + 212, + 719, + 789, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 364, + 126 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/6e8d6da3b9d870e602c0c23787fc94d6cd1ed5ce8818d0c6301ffe14f391505c.jpg", + "image_caption": [ + "(a) Public Dataset", + "Fig. 3: Comparisons between datasets used in our experiments. For evaluation, we test on (a) public dataset, including VITON-HD [3] and DressCode [32], and (b) In-the-Wild dataset, which we internally collected from real E-commerce setup. We remark that the In-the-Wild dataset contains more intricate patterns and logos in garment image, and diverse backgrounds, and poses in person image." + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 382, + 301 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/39541a79f2de27f6a0173201049a5b13bc1c49922698891fccdfc8cffdd8c3b1.jpg", + "image_caption": [ + "" + ], + "image_footnote": [], + "bbox": [ + 390, + 143, + 468, + 301 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/a9f04d91b11214fde43bb0685a3bb70a981d18cb343db65bcd9f1c21ee2166c5.jpg", + "image_caption": [ + "(b) In-the-wild Dataset" + ], + "image_footnote": [], + "bbox": [ + 470, + 143, + 776, + 301 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "from the TryonNet. Then we compute the self-attention on the concatenated features and then pass only the first-half dimensions from TryonNet. We use UNet of SDXL [36] for our GarmentNet, which helps utilizing the rich generative prior of the pretrained text-to-image diffusion model, and complements the low-level feature that is often ignored in the cross-attention layer of IP-Adapter. Remark that a similar approach was introduced in [18], which used a similar attention mechanism in preserving consistency for video generation.", + "bbox": [ + 212, + 410, + 787, + 516 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Detailed captioning of garments. While the majority of diffusion-based virtual try-on models leverage pretrained text-to-image diffusion models, they do not take the text prompts as input [9,23] or use a naive text prompts [31] such as \"upper garment\" for any garment image. To fully exploit the rich generative prior of the text-to-image diffusion model, we provide a comprehensive caption [26] that describes the detail of a garment, such as shapes or textures. As shown in Fig. 2, we provide a comprehensive caption to the garment image (e.g., \"short sleeve round neck t-shirts\") and pass it to both GarmentNet (i.e., \"a photo of short sleeve round neck t-shirts\") and the TryonNet (i.e., \"model is wearing short sleeve round neck t-shirts\"). This helps the model to encode the high-level semantics of the garment using natural language, and complements the image-based conditioning (e.g., see Fig. 7). In practice, we utilize an image annotator for fashion images, and manually provide captioning with templates (see Appendix for details).", + "bbox": [ + 212, + 541, + 787, + 739 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Customization of IDM-VTON. While our model is able to capture the fine-details of garments, it often struggles when the person image $\\mathbf{x}_p$ or the garment image $\\mathbf{x}_g$ is different from training distribution (e.g., see Fig. 3). To this end, inspired by text-to-image personalization methods [2, 42, 48], we propose an effective customization of IDM-VTON by fine-tuning TryonNet with a pair", + "bbox": [ + 212, + 763, + 787, + 842 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/ddf3685e761b5a6cd6d8d1401282f3fe3f97b19d42434be2eab0243047fc5236.jpg", + "image_caption": [ + "(a) VITON-HD" + ], + "image_footnote": [], + "bbox": [ + 228, + 142, + 772, + 333 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/6eebb2319360838aa18b0fc6bb380fe83406d1c02b3c07265f403e582a6b86ea.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 228, + 347, + 772, + 435 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/6727e93151ac07107238ec45c10823d14c5665d24dae781b38b90096218e93ff.jpg", + "image_caption": [ + "(b) DressCode (upper body)", + "Fig. 4: Qualitative results on VITON-HD and DressCode dataset. We show generated virtual try-on images using IDM-VTON (ours) compared with other methods on (a) VITON-HD [3], and (b) DressCode (upper body) [32] test datasets. We see that IDM-VTON outperforms others in generating authentic images and preserving fine-grained details of garment. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 228, + 435, + 754, + 521 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "of garment and person images. It is straightforward to fine-tune IDM-VTON when we have a pair of images $\\mathbf{x}_p$ and $\\mathbf{x}_g$ , where the person in $\\mathbf{x}_p$ is wearing the garment in $\\mathbf{x}_g$ . On the other hand, if we only have $\\mathbf{x}_p$ , we segment the garment and white-out backgrounds to obtain $\\mathbf{x}_g$ . Remark that we fine-tune only the attention layers of the up-blocks (i.e., decoder layers) of TryonNet, which empirically works well (e.g., see Table 4).", + "bbox": [ + 212, + 626, + 787, + 718 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiment", + "text_level": 1, + "bbox": [ + 215, + 739, + 366, + 757 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 215, + 770, + 426, + 787 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Implementation details. We use SDXL inpainting model [49] for our TryonNet, pretrained IP-Adapter [57] for image adapter and UNet of SDXL [36] for our GarmentNet. We train our model using VITON-HD [3] train dataset, which", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 364, + 126 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/95b69a74e6e932d4a93d1c945ebe50c152bcbf6b7559ab0902c1b4eb49af62aa.jpg", + "table_caption": [ + "Table 1: Quantitative results on VITON-HD dataset. We evaluate the reconstruction scores (e.g., LPIPS, SSIM) for low-level similarity, CLIP image similarity score (CLIP-I) for high-level semantic similarity, and FID score for image fidelity. We compare with GAN-based virtual try-on methods (e.g., HR-VTON and GP-VTON), and Diffusion-based virtual try-on methods (e.g., LaDI-VTON, DCI-VTON, StableVITON). Bold denotes the best score for each metric." + ], + "table_footnote": [], + "table_body": "
DatasetVITON-HDDressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
GAN-based methods
HR-VITON [27]0.1150.8839.700.8320.1120.91021.420.771
GP-VTON [54]0.1050.8986.430.8740.4840.78055.210.628
Diffusion-based methods
LaDI-VTON [31]0.1560.8728.850.8340.1490.90516.540.803
DCI-VTON [9]0.1660.8568.730.8400.1620.89317.630.777
StableVITON [23]0.1330.8856.520.8710.1070.91014.370.866
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
", + "bbox": [ + 220, + 233, + 772, + 414 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "contains 11,647 person-garment image pairs at $1024 \\times 768$ resolution. We train our model using Adam [24] optimizer with batch size of 24 and learning rate of 1e-5 for 130 epochs. For customization, we fine-tune our model using Adam optimizer with learning rate 1e-6 for 100 steps.", + "bbox": [ + 212, + 430, + 787, + 492 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Evaluation dataset. We evaluate our model on public VITON-HD [3] and DressCode [32] test datasets. Furthermore, we internally collected In-the-Wild dataset, which is crawled from the web to assess the generalization of model to the real-world scenario. While VITON-HD and DressCode contain person images of simple poses and solid backgrounds, our In-the-Wild dataset has person images of various poses and gestures with complex backgrounds. Also, the garments are of various patterns and logos, making virtual try-on more challenging than VITON-HD and DressCode (e.g., see Fig. 3). Furthermore, In-the-Wild dataset contains multiple person images per garment, so it is possible to evaluate the results when we customize our network with each garment. Specifically, it consists of 62 images of upper garments and 312 images of people wearing those garments, where there are 4-6 images of person wearing the same garment. To conduct customization experiment, we select one person image for each garment, and use the left 250 person images for evaluation.", + "bbox": [ + 212, + 513, + 787, + 726 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Baselines. We compare our method with GAN-based methods (HR-VITON [27] and GP-VTON [54]), and diffusion-based methods (LaDI-VTON [31], DCI-VTON [9], and StableVITON [23]). HR-VITON and GP-VTON have a separate warping module to estimate the fitted garment on the target person, generating try-on images with GAN using the garment as input. LaDI-VTON, DCI-VTON, and StableVITON are most relevant baselines of ours, where they also utilize", + "bbox": [ + 212, + 748, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 130 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/597cf9b7a066a184d3d1e0db3dc35c21dd789038486211aead36d6ad61f8e2f5.jpg", + "image_caption": [ + "Fig. 5: Qualitative comparisons on In-the-Wild dataset. We show generated virtual try-on images on In-the-Wild dataset using IDM-VTON (ours) compared with other methods. IDM-VTON outperforms other methods in generating authentic images and preserving fine-grained details of garment. In particular, customizing IDM-VTON, (i.e., IDM-VTON $\\ddagger$ ), significantly enhances the image quality and garment fidelity. When applying customization on StableVITON, (i.e., StableVITON $\\ddagger$ ), the improvements are marginal compared to ours. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 218, + 146, + 777, + 516 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "pretrained Stable Diffusion (SD). In specific, LaDI-VTON and DCI-VTON employ separate warping modules to condition the garment, while StableVITON utilizes the SD Encoder for garment conditioning. We use the pretrained checkpoints provided in their official repositories to generate images. For a fair comparison, we generate images of resolution $1024 \\times 768$ images if available, otherwise generate images of resolution $512 \\times 384$ and upscale to $1024 \\times 768$ using various methods, e.g., interpolation or super resolution [52], and report the best one.", + "bbox": [ + 212, + 636, + 787, + 743 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Evaluation metrics. For quantitative evaluation, we measure low-level reconstruction scores such as LPIPS [59] and SSIM [53], and high-level image similarity using CLIP [37] image similarity score. To evaluate the authenticity of generated images, we compute Frenchet Inception Distance (FID) [13] score on VITON-HD and DressCode test dataset.", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/05d4fc9d0fb5ca3145bf37a60c31a1e755fbd6658ad07e1fc6184d4568a342aa.jpg", + "table_caption": [ + "Table 2: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with other methods on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP [37] image similarity scores. For IDM-VTON and StableVITON [23], we further customize models using a single pair of person-garment images (denoted by $\\ddagger$ ). We see that IDM-VTON outperforms other methods, and customized IDM-VTON (i.e., IDM-VTON $\\ddagger$ ) performs the best." + ], + "table_footnote": [], + "table_body": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
HR-VITON [27]0.3300.7410.701
LaDI-VTON [31]0.3030.7680.819
DCI-VTON [9]0.2830.7350.752
Stable-VITON [23]0.2600.7360.836
IDM-VTON (ours)0.1640.7950.901
Stable-VITON‡ [23]0.2590.7330.858
IDM-VTON‡ (ours)0.1500.7970.909
", + "bbox": [ + 341, + 234, + 656, + 369 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.2 Results on Public Dataset", + "text_level": 1, + "bbox": [ + 215, + 402, + 478, + 417 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Qualitative results. Fig. 4 shows the visual comparisons of IDM-VTON with other methods on VITON-HD and DressCode test datasets. We see that IDM-VTON preserves both low-level details and high-level semantics, while others struggle to capture. While GAN-based methods (i.e., HR-VITON and GP-VTON) show comparable performance in capturing fine details of garment, they fall shorts in generating natural human images compared to diffusion-based methods. On the other hand, prior diffusion-based methods (i.e., LaDI-VTON, DCI-VTON, and StableVITON) fail to preserve the details of garments (e.g., the off-shoulder t-shirts in first row, or the details of sweatshirts in second row of VITON-HD dataset). Also, we observe that IDM-VTON significantly outperforms other methods in generalization to the DressCode dataset. Especially, GAN-based methods show inferior performance on the DressCode dataset, showing its poor generalization ability. While prior diffusion-based methods show better images in generating natural images than GAN-based, the generated images show lower consistency with respect to given garment image compared to IDM-VTON.", + "bbox": [ + 212, + 440, + 787, + 670 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Quantitative results. Tab. 1 shows the quantitative comparisons between IDM-VTON (ours) and other methods on VITON-HD and DressCode test datasets. When compared to GAN-based methods, we observe that IDM-VTON shows comparable performance in reconstruction scores (LPIPS and SSIM) and outperforms in FID and CLIP image similarity score on VITON-HD test dataset. However, the performance of GAN-based methods significantly degrades when tested on DressCode dataset, which we have observed in Fig. 4. We see that IDM-VTON consistently outperforms prior diffusion-based methods in both VITON-HD and DressCode dataset.", + "bbox": [ + 212, + 704, + 789, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 130 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/c9902a59ff939fd8f08487b143cf24d8c90917b896d467210e1e3ca3994ca787.jpg", + "image_caption": [ + "Fig. 6: Effect of GarmentNet. We compare the generated virtual try-on images without using GarmentNet (left) and together with GarmentNet (right). We observe that using GarmentNet significantly improves retaining the fine-grained details of garment (e.g., the graphics in the t-shirts)." + ], + "image_footnote": [], + "bbox": [ + 228, + 145, + 279, + 258 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/40dabe3822f406f8fb03e68a2c3665c9fd39f119f9b11297488da8081c2ce365.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 282, + 145, + 385, + 258 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/5d005e6dd1234734d6ade31afe0afc2fb6067c72781ec1b4d25d905be95298e6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 388, + 145, + 491, + 258 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/85a0e18a24263c5bb50a6eb3f6098441fc864ccb2ad520a0295454b172802efb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 504, + 145, + 665, + 258 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/f72842b6491eb4183ba09c0c1e0acb8355d868833c067bdb59d97767abc3954d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 668, + 146, + 767, + 258 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Results on In-the-Wild Dataset", + "text_level": 1, + "bbox": [ + 215, + 339, + 519, + 353 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Here, we evaluate our methods on challenging In-the-Wild dataset, where we compare with other diffusion-based VTON methods. In addition, we show the results of customization using a single pair of garment-person images. We also test customization on StableVITON [23].", + "bbox": [ + 212, + 364, + 785, + 425 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Qualitative results. Fig. 5 shows the qualitative results of IDM-VTON (ours) compared to other baselines3. We see that IDM-VTON generates more authentic images than LaDI-VTON, DCI-VTON, and StableVITON, yet it struggles to preserve the intricate patterns of garments. By customizing IDM-VTON, we obtain virtual try-on images with a high degree of consistency to the garment (e.g., the logos and the text renderings), but we find the customization does not work well for StableVITON.", + "bbox": [ + 212, + 446, + 787, + 551 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Quantitative results. Tab. 2 reports the quantitative comparisons between our IDM-VTON and other methods. We also provide comparisons between IDM-VTON and StableVITON using customization (i.e., IDM-VTON $\\ddagger$ and StableVITON $\\ddagger$ ). We see that IDM-VTON outperforms other methods on all metrics, even outperforming StableVITON with customization. Furthermore, we observe that IDM-VTON with customization significantly outperforms others, showing its generalization capability.", + "bbox": [ + 212, + 574, + 787, + 680 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 Ablative Studies", + "text_level": 1, + "bbox": [ + 215, + 702, + 398, + 715 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Effect of GarmentNet. We conduct an ablation study on the effect of GarmentNet in preserving the fine-grained details of a garment. For comparison, we train another model without using GarmentNet (i.e., using only IP-Adapter to encode garment image). The qualitative results are in Fig. 6. While training with only IP-Adapter is able to generate authentic virtual try-on images that are", + "bbox": [ + 212, + 727, + 785, + 803 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 11 + }, + { + "type": "page_footnote", + "text": "3 We do not compare with GP-VTON as it uses private parsing modules. Comparison with HR-VITON is in the appendix.", + "bbox": [ + 217, + 810, + 785, + 839 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/959d884610d5549acfe06abf2a760627192536327f5d19d7a5e0a24aa086ddcc.jpg", + "image_caption": [ + "Input" + ], + "image_footnote": [], + "bbox": [ + 228, + 167, + 281, + 268 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/9d0705dc6b23fe725e69e73721d064ef4ecd89625a9dc14cb5779a1daf36cd17.jpg", + "image_caption": [ + "\"upper garment\"" + ], + "image_footnote": [], + "bbox": [ + 287, + 167, + 385, + 268 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/f393137cdb9173a4581e36f49e1e9fc24b0086b27d77d565884a8ebfeee97c88.jpg", + "image_caption": [ + "\"round neck short sleeve blouse\"", + "Fig. 7: Effect of detailed caption for garment. We compare the generated virtual try-on images using naive captions (left) and detailed captions (right). The model trained with detailed captions generates images that are more consistent with the garment. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 393, + 169, + 491, + 268 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/41c857d0ae368e62f1b328411c005312ba2fde4200fa24d4c01832393e3ea814.jpg", + "image_caption": [ + "Input" + ], + "image_footnote": [], + "bbox": [ + 506, + 167, + 558, + 268 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/1f83a3f06ee7e7aee23412bc57f3a1802554ef0da9d049f1648881347dc0fc5b.jpg", + "image_caption": [ + "\"upper garment\"" + ], + "image_footnote": [], + "bbox": [ + 563, + 167, + 663, + 268 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/c7c5fbf57e36553dce21c4e3e1d276e44c7b2efb1dd48cedb84ec12f06409649.jpg", + "image_caption": [ + "\"sleeveless square neck tube top\"" + ], + "image_footnote": [], + "bbox": [ + 669, + 169, + 767, + 268 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/3db519b9eb7a417de75720592fc45bd8018e97bef50c6e9bc2b3a554824aede1.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
GarmentNetLPIPS ↓SSIM ↑CLIP-I ↑
X0.1210.8490.846
✓0.1020.8700.883
", + "bbox": [ + 223, + 421, + 485, + 481 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/7ee3b61cc866c3278275319f93fc7010b28007e6a08df8114e54b5af145dee0f.jpg", + "table_caption": [ + "Table 3: Ablation on GarmentNet. Table 4: Ablation on customization. We ablate the effect of using GarmentNet We compare default IDM-VTON with by comparing LPIPS, SSIM, and CLIP different customization methods by fineimage similarity scores on the VITON-HD tuning all UNet layers, LoRA [17] layers, test dataset. or up-block layers (Decoder)." + ], + "table_footnote": [], + "table_body": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
Default0.16420.7950.901
All UNet0.15120.7970.891
LoRA0.15730.7940.881
Decoder0.15020.7970.909
", + "bbox": [ + 519, + 410, + 759, + 502 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "semantically consistent with the garment images, we see that using GarmentNet significantly improves preserving the identity of the garment (e.g., the graphics of t-shirts). In addition, we conduct a quantitative evaluation on VITON-HD test dataset by measuring LPIPS, SSIM and CLIP image similarity score. In Tab. 3, we see that using GarmentNet quantitatively improves reconstruction scores, as well as image similarity scores, which is aligned with our qualitative results.", + "bbox": [ + 212, + 539, + 787, + 630 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effect of detailed caption. To validate the effectiveness of detailed captioning on garments, we train an identical model to IDM-VTON except that using naive caption [31], and compare with IDM-VTON. In specific, naive caption provides an unified descriptions of all upper garments (e.g., \"model is wearing an upper garment\"), while our detailed captions provide specific descriptions of each garment. Fig. 7 shows generated virtual try-on images using each model trained with naive caption (left) and detailed captions (right). We observe that the model trained with detailed captions generates images with higher consistency to the garment (e.g., meshes around the neck and arms). Thus, the usage of detailed captions complements the potential inaccuracy of image-based virtual try-on by exploiting the generative prior of text-to-image diffusion model.", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablation on customization. During customization, we fine-tune the up-blocks of TryonNet (i.e., decoder layers). Here, we provide an ablation study on the choice of fine-tuning layer for customization. We compare default IDM-VTON (i.e., no customization), fine-tuning all UNet layers, using low rank adaptation (LoRA) [17], and fine-tuning decoder layers. In Tab. 4, we see that all customization methods improve reconstruction score (LPIPS, SSIM) compared to default IDM-VTON, while showing comparable performance in CLIP image similarity score. We see that fine-tuning decoder layers perform the best among customization methods, while fine-tuning all UNet layers shows comparable performance. While finetuning with LoRA is more efficient, we find it underperforms than fine-tuning decoder layers.", + "bbox": [ + 212, + 146, + 787, + 313 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 332, + 359, + 348 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we present IDM-VTON, a novel design of diffusion models for authentic virtual try-on, particularly in the wild scenario. We incorporate two separate modules to encode the garment image, i.e., visual encoder and parallel UNet, which effectively encode high-level semantics and low-level features to the base UNet, respectively. In order to improve the virtual try-on on real world scenario, we propose to customize our model by fine-tuning the decoder layers of UNet given a pair of garment-person images. We also leverage detailed natural language descriptions for garments, which help generating authentic virtual try-on images. Extensive experiments on various datasets show the superiority of our method over prior works in both preserving details of garment, and generating high fidelity images. In particular, we demonstrate the potential of our method in virtual try-on in the wild.", + "bbox": [ + 212, + 359, + 787, + 542 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Potential negative impact. The virtual try-on technology comes with benefits and pitfalls - the tool could be helpful for users to effectively visualize their look with given garment. However, it requires the users to be responsible for protecting the ownership, and avoid malicious use.", + "bbox": [ + 212, + 560, + 787, + 621 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitation. IDM-VTON struggles to preserve human attributes on masked regions such as tattoos or skin moles. One can design a method for conditioning those human attributes of when generating try-on images. Also, while we exploit the prior knowledge of T2I diffusion models by providing comprehensive captions, exploring broader applications to fully utilize the prior, such as controlling garment generation through textual prompts, is left as future work.", + "bbox": [ + 212, + 640, + 787, + 731 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement", + "text_level": 1, + "bbox": [ + 215, + 751, + 395, + 768 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00075 Artificial Intelligence Graduate School Program(KAIST); No.RS-2021-II212068, Artificial Intelligence Innovation Hub).", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Avrahami, O., Hayes, T., Gafni, O., Gupta, S., Taigman, Y., Parikh, D., Lischinski, D., Fried, O., Yin, X.: Spatext: Spatio-textual representation for controllable image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18370-18380 (2023) 20", + "2. Chari, P., Ma, S., Ostashev, D., Kadambi, A., Krishnan, G., Wang, J., Aberman, K.: Personalized restoration via dual-pivot tuning. arXiv preprint arXiv:2312.17234 (2023) 4, 7", + "3. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14131-14140 (2021) 1, 2, 3, 6, 7, 8, 9", + "4. Cui, A., Mahajan, J., Shah, V., Gomathinayagam, P., Lazebnik, S.: Street tryon: Learning in-the-wild virtual try-on from unpaired person images. arXiv preprint arXiv:2311.16094 (2023) 2", + "5. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022) 4", + "6. Ge, C., Song, Y., Ge, Y., Yang, H., Liu, W., Luo, P.: Disentangled cycle consistency for highly-realistic virtual try-on. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16928-16937 (2021) 2, 3", + "7. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8485-8493 (2021) 2, 3", + "8. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139-144 (2020) 2, 3", + "9. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: Proceedings of the 31st ACM International Conference on Multimedia. pp. 7599-7607 (2023) 2, 3, 6, 7, 9, 11", + "0. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7297-7306 (2018) 5, 6", + "1. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. arXiv preprint arXiv:2303.11305 (2023) 4", + "2. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7543-7552 (2018) 2", + "3. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 10", + "4. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020) 2, 3, 4", + "5. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 4, 20", + "6. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: International Conference on Machine Learning. pp. 2790-2799. PMLR (2019) 4" + ], + "bbox": [ + 225, + 175, + 785, + 840 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021) 4, 13, 14", + "18. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023) 7", + "19. Hyvarinen, A., Dayan, P.: Estimation of non-normalized statistical models by score matching. Journal of Machine Learning Research 6(4) (2005) 4", + "20. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below. 6", + "21. Issenhuth, T., Mary, J., Calauzenes, C.: Do not mask what you do not need to mask: a parser-free virtual try-on. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 619-635. Springer (2020) 3", + "22. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4401-4410 (2019) 2", + "23. Kim, J., Gu, G., Park, M., Park, S., Choo, J.: Stableviton: Learning semantic correspondence with latent diffusion model for virtual try-on. arXiv preprint arXiv:2312.01725 (2023) 2, 3, 6, 7, 9, 11, 12, 20", + "24. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 9, 20", + "25. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023) 4", + "26. Lee, K., Kwak, S., Sohn, K., Shin, J.: Direct consistency optimization for compositional text-to-image personalization. arXiv preprint arXiv:2402.12004 (2024) 4, 7", + "27. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: European Conference on Computer Vision. pp. 204-219. Springer (2022) 2, 3, 9, 11", + "28. Li, N., Liu, Q., Singh, K.K., Wang, Y., Zhang, J., Plummer, B.A., Lin, Z.: Unihuman: A unified model for editing human images in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2039-2048 (2024) 2", + "29. Men, Y., Mao, Y., Jiang, Y., Ma, W.Y., Lian, Z.: Controllable person image synthesis with attribute-decomposed gan. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5084-5093 (2020) 2, 3", + "30. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021) 2", + "31. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladivton: Latent diffusion textual-inversion enhanced virtual try-on. arXiv preprint arXiv:2305.13501 (2023) 2, 3, 6, 7, 9, 11, 13", + "32. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2231-2235 (2022) 1, 3, 7, 8, 9" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "33. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023) 3", + "34. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021) 2, 3, 4", + "35. Ning, S., Wang, D., Qin, Y., Jin, Z., Wang, B., Han, X.: Picture: Photorealistic virtual try-on from unconstrained designs. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6976-6985 (2024) 2", + "36. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023) 2, 6, 7, 8", + "37. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 4, 5, 10, 11", + "38. Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., Liu, P.J.: Exploring the limits of transfer learning with a unified text-to-text transformer. The Journal of Machine Learning Research 21(1), 5485-5551 (2020) 4", + "39. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) 2", + "40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) 2, 3, 4, 5, 6", + "41. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) 4", + "42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023) 4, 7", + "43. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) 2, 3, 4", + "44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015) 4", + "45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., et al.: Styledrop: Text-to-image generation in any style. arXiv preprint arXiv:2306.00983 (2023) 4", + "46. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) 2", + "47. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020) 3, 4" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "48. Tang, L., Ruiz, N., Chu, Q., Li, Y., Holynski, A., Jacobs, D.E., Hariharan, B., Pritch, Y., Wadhwa, N., Aberman, K., et al.: Realfill: Reference-driven generation for authentic image completion. arXiv preprint arXiv:2309.16668 (2023) 4, 7", + "49. team, D.: Stable diffusion xl inpainting. link (2023) 6, 8", + "50. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) 4", + "51. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: Proceedings of the European conference on computer vision (ECCV). pp. 589-604 (2018) 2", + "52. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind superresolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021) 10", + "53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 10", + "54. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23550-23559 (2023) 2, 3, 9", + "55. Xu, Y., Gu, T., Chen, W., Chen, C.: Ootdiffusion: Outfitting fusion based latent diffusion for controllable virtual try-on. arXiv preprint arXiv:2403.01779 (2024) 21, 22, 23", + "56. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18381-18391 (2023) 3, 6", + "57. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. arXiv preprint arXiv:2308.06721 (2023) 3, 5, 6, 8", + "58. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 3", + "59. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018) 10", + "60. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unictrlnet: All-in-one control to text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024) 3", + "61. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4606-4615 (2023) 3" + ], + "bbox": [ + 215, + 146, + 785, + 742 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Appendix", + "text_level": 1, + "bbox": [ + 434, + 142, + 571, + 167 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "A Implementation Details", + "text_level": 1, + "bbox": [ + 215, + 186, + 485, + 204 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "A.1 In-the-Wild Dataset", + "text_level": 1, + "bbox": [ + 215, + 217, + 433, + 232 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/38070a8c94a34774734298a924b509fb64649ab55c572c7a939ca65b861fb55d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 223, + 265, + 316, + 359 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/7b1d725fc7bb03b447ac12b05d7a0c04573d8320569962bd0197c860b5dab1ee.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 330, + 266, + 779, + 359 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/9e15a2e00988885208cf68111574899f4fd1cb48d23a8ddef3768585a73aa02e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 223, + 364, + 315, + 459 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/2f9f62fc74cf4866ec3631d5f32b9e2c6e1f4b48fc0010403554cb29119c4974.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 331, + 364, + 779, + 459 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/232dc48ebf557d5e59aca56ee316f4a1ab873a31e888cde202a0aac167022ae4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 223, + 462, + 315, + 556 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/c78aa6fdfdaa4fe5b80c8bc82cd538126ffedf889e52bce128abeb0b39bd3cb6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 331, + 463, + 779, + 556 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/161f9af84c21dd93983d2a31a21e1235c9f627356816332c365099dad518a881.jpg", + "image_caption": [ + "Fig. 8: Examples of In-the-Wild dataset. We collect pairs of garment and human wearing the garment." + ], + "image_footnote": [], + "bbox": [ + 223, + 559, + 315, + 654 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/baecaed37477b1db1eb2183107d39af17bc7e0be9a9671134b40960c0ec98e1d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 331, + 560, + 779, + 652 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "In-the-Wild dataset comprises multiple human images wearing each target garment. Images of garment are collected from MLB online shopping mall4 and images of human wearing each garment are gathered from social media platforms like Instagram. As shown in Fig. 8, the human images exhibit diverse backgrounds, ranging from parks and buildings to snowy landscapes. For preprocessing, we employ center cropping on the human images to achieve resolutions of $1024 \\times 768$", + "bbox": [ + 212, + 726, + 787, + 818 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 130 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 114, + 785, + 127 + ], + "page_idx": 18 + }, + { + "type": "page_footnote", + "text": "4 https://www.mlb-korea.com/main/mall/view", + "bbox": [ + 217, + 823, + 537, + 840 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/292eb4efa140a52b1291f8ca4aa688b016680609a85e6634b8e20a8aa94bd25a.jpg", + "image_caption": [ + "Fig. 9: Illustration of generating detailed captions of garments. We utilize pretrained fashion attribute tagging annotator to extract information of garment and generate detailed captions of the garment based on extracted information." + ], + "image_footnote": [], + "bbox": [ + 225, + 145, + 774, + 229 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "resolutions, while the garment images are resized to the same dimensions for compatible setting.", + "bbox": [ + 214, + 311, + 784, + 344 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "A.2 Training and Inference", + "text_level": 1, + "bbox": [ + 215, + 366, + 455, + 382 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "We train the model using the Adam [24] optimizer with a fixed learning rate of 1e-5 over 130 epochs (63k iterations with batch size of 24). It takes around 40 hours in training with $4 \\times \\mathrm{A800}$ GPUs. We apply data augmentations following StableVITON [23], where we apply horizontal flip (with probability 0.5), random affine shifting and scaling (limit of 0.2, with probability 0.5) to the inputs of TryonNet, i.e., $\\mathbf{x}_p, \\mathbf{x}_{\\mathrm{pose}}, \\mathbf{x}_m$ and $\\mathbf{m}$ . For customization, we fine-tune our model using the Adam optimizer with a fixed learning rate of 1e-6 for 100 steps. It takes around 2 minutes with a single A800 GPU.", + "bbox": [ + 212, + 392, + 787, + 513 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "During the inference, we generate images using the DDPM scheduler with 30 steps. We set the strength value to 1.0, i.e., denoising begins from random Gaussian noise, to ignore the masked portion of the input image. For classifier-free guidance [15] (CFG), we merge both conditioning, i.e., low-level features $\\mathbf{L}_g$ from GarmentNet and high-level semantics $\\mathbf{H}_g$ from IP-Adapter, as these conditions contain features of the same garment image, following SpaText [1]. In specific, the forward is given as follows:", + "bbox": [ + 212, + 513, + 787, + 619 + ], + "page_idx": 19 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; \\mathbf {L} _ {g}, \\mathbf {H} _ {g}, t\\right) = s \\cdot \\left(\\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; \\mathbf {L} _ {g}, \\mathbf {H} _ {g}, t\\right) - \\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; t\\right)\\right) + \\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; t\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 277, + 631, + 787, + 648 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "where $\\epsilon_{\\theta}(\\mathbf{x}_t;\\mathbf{L}_g,\\mathbf{H}_g,t)$ denotes noise prediction with conditions $\\mathbf{L}_g$ and $\\mathbf{H}_g$ , and $\\epsilon_{\\theta}(\\mathbf{x}_t;t)$ denotes unconditional noise prediction. We use guidance scale $s = 2.0$ , which works well in practice.", + "bbox": [ + 214, + 659, + 787, + 705 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "A.3 Detailed captioning of garments", + "text_level": 1, + "bbox": [ + 215, + 729, + 532, + 744 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "We generate detailed captions for each garment to leverage the prior knowledge of T2I diffusion models. We employ OMNIOUS.AI's commercial $^{5}$ fashion attribute tagging annotator, which has been trained with over 1,000 different fashion attributes. The image annotator provides various feature categories present in a", + "bbox": [ + 212, + 755, + 787, + 816 + ], + "page_idx": 19 + }, + { + "type": "page_number", + "text": "20", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 19 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 19 + }, + { + "type": "page_footnote", + "text": "5 https://omnicommerce.ai", + "bbox": [ + 217, + 823, + 405, + 840 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "given image, such as sleeve length and neckline type. We extract three different feature categories: sleeve length, neckline type, and item name, as illustrated in Fig. 9. Subsequently, we generate captions based on this feature information, for example, \"short sleeve off shoulder t-shirts\".", + "bbox": [ + 212, + 146, + 787, + 205 + ], + "page_idx": 20 + }, + { + "type": "image", + "img_path": "images/fb3db19adaaf1c8f85bcfdb52a3e101ff9820f41061d5264996c88d439f9c214.jpg", + "image_caption": [ + "Fig. 10: Comparison between IDM-VTON and OOTDiffusion [55] on VITON-HD and DressCode dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 253, + 231, + 751, + 637 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "B Comparison with Concurrent Work", + "text_level": 1, + "bbox": [ + 215, + 727, + 599, + 744 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "We additionally compare IDM-VTON with OOTDiffusion [55], which is a concurrent work on virtual try-on task. We compare each model trained on VITON-HD and DressCode datasets. We use publicly available model checkpoints for generating try-on images of OOTDiffusion6.", + "bbox": [ + 212, + 756, + 787, + 818 + ], + "page_idx": 20 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 20 + }, + { + "type": "page_number", + "text": "21", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 20 + }, + { + "type": "page_footnote", + "text": "$^{6}$ https://github.com/levihsu/OOTDiffusion", + "bbox": [ + 217, + 823, + 516, + 839 + ], + "page_idx": 20 + }, + { + "type": "table", + "img_path": "images/d9d9186718744ffce05f23b6deffb939324904717461cc1d0afcf7c6656aef76.jpg", + "table_caption": [ + "Table 5: Quantitative results of models trained on VITON-HD training dataset and evaluated on VITON-HD and DressCode (upper body) test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]." + ], + "table_footnote": [], + "table_body": "
Train / TestVITON-HD / VITON-HDVITON-HD / DressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.1200.8466.390.8580.0870.90110.680.852
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
", + "bbox": [ + 222, + 205, + 777, + 284 + ], + "page_idx": 21 + }, + { + "type": "table", + "img_path": "images/02671a292f264ba120f1d166b522b3a6e7ca3f601bb1212c95bbece8a2e3a849.jpg", + "table_caption": [ + "Table 6: Quantitative results of models trained on DressCode training dataset and evaluated on VITON-HD and DressCode test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]." + ], + "table_footnote": [], + "table_body": "
Train / TestDressCode / DressCodeDressCode / VITON-HD
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.0880.8854.180.8510.2050.78857.870.677
IDM-VTON (ours)0.0720.9023.620.9130.1290.85912.570.839
", + "bbox": [ + 222, + 359, + 777, + 439 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Fig. 10 and Fig. 11 present qualitative comparisons of OOTDiffusion and ours on VITON-HD, DressCode and In-the-Wild dataset. As shown in Fig. 10, we see that IDM-VTON outperforms OOTDiffusion in capturing both high-level semantics and low-level details, and generating more authentic images. In particular, we observe notable improvements of IDM-VTON compared to OOTDiffusion on In-the-Wild dataset, which demonstrates the generalization ability of IDM-VTON.", + "bbox": [ + 212, + 465, + 787, + 571 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Tab. 5, Tab. 6 and Tab. 7 show quantitative comparisons between IDM-VTON and OOTDiffusion on VITON-HD, DressCode, and In-the-Wild datasets. One can notify that IDM-VTON outperforms OOTDiffusion on all metrics including image fidelity (FID), and reconstruction of garments (LPIPS, SSIM and CLIP-I), which verifies our claim.", + "bbox": [ + 212, + 571, + 789, + 647 + ], + "page_idx": 21 + }, + { + "type": "page_number", + "text": "22", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 21 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 21 + }, + { + "type": "table", + "img_path": "images/81e0096351f209da473cc66010ffe9ccdefa3c87e5ef1f44beead88e90bc6067.jpg", + "table_caption": [ + "Table 7: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with the concurrent work OOTDiffusion [55] on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP image similarity scores." + ], + "table_footnote": [], + "table_body": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
OOTDiffusion [55]0.2030.7520.861
IDM-VTON (ours)0.1640.7950.901
", + "bbox": [ + 344, + 209, + 653, + 267 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/88147a737f5b865c3e8da7372a0007bc45feaf830c165c1a28e18e7174faba09.jpg", + "image_caption": [ + "Input" + ], + "image_footnote": [], + "bbox": [ + 228, + 332, + 281, + 435 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/7eeb0f4080c40dbc65dac8af01dc27d2dd90458785cae41527dbaf631ca3ea3f.jpg", + "image_caption": [ + "OOTDiffusion" + ], + "image_footnote": [], + "bbox": [ + 287, + 332, + 387, + 434 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/307ba17b8eae42cdfd47ce8df6f8452b9a8716c8fab08154b40047d5b2771094.jpg", + "image_caption": [ + "IDM-VTON (Ours)" + ], + "image_footnote": [], + "bbox": [ + 393, + 332, + 493, + 435 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/fabb79bd274c38e7680c85f1337449ce655f6e42004cdce51eb9ca0c6ac2cee8.jpg", + "image_caption": [ + "Input" + ], + "image_footnote": [], + "bbox": [ + 509, + 332, + 563, + 435 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/9422680077d1fb5492929fa5a5c28ac117e84c9df1b00962c10f02baf6fdc666.jpg", + "image_caption": [ + "OOTDiffusion" + ], + "image_footnote": [], + "bbox": [ + 566, + 332, + 666, + 435 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/ae18ec398c6a79517efac2d5ef5270715ec245826255f84f17ce28028f889515.jpg", + "image_caption": [ + "IDM-VTON (Ours)" + ], + "image_footnote": [], + "bbox": [ + 671, + 332, + 772, + 435 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/7d8cad5c38d1b64c59a730220378c161a89071798e144f17ff02abf762e0c255.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 228, + 436, + 279, + 541 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/38afecafa40c5e9904d80d8980c1a741a207022fe3ccdb40006dda762fb48400.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 289, + 436, + 387, + 540 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/867b0d34451c361e1442a5642ea66937ef7b476853d66c5f20c34d10c0ce6edb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 393, + 436, + 493, + 540 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/b4a7368cc04b82fd388a780be611a8ba78633dbf22cd7cb8cab2cb7eea8ce5c4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 509, + 436, + 563, + 541 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/514c840f53977cc04c789a460824720d57d78ea7bd0684a725d58842ad9855b3.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 566, + 436, + 666, + 541 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/74c78de813196823cad3f1c5943452b315ab6c566be485ac758e94161a8bb614.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 671, + 436, + 772, + 541 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/cccef36426bed0e85c11ea00e40afb1934a51936e63ce438fce47b85eccfc836.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 228, + 542, + 281, + 647 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/2dfdbe41b2fa7f7dd034d5051658ba42658819f445d59f6f80cd9eaad6bda05e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 287, + 542, + 387, + 646 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/0dd1fd8b56fb2fb77aa6057db06c226c26eb9cf2cca771ce163d60e272647f02.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 393, + 542, + 493, + 646 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/7f440d978f1d835b2fa0cdd7d7bf211b62e61e4008c2e57f6a5ba08b65fb7663.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 511, + 542, + 563, + 647 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/ffa0b47f52c0d18ba8c5354cd323eebd3e852884c9984a17bb97037299206a68.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 568, + 542, + 666, + 646 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/a5d8a1de905d61ad8027baec0d2d15d6774f2f4f7cebfa1b757dd6e41575866b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 671, + 544, + 772, + 646 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/f4d11feb48c897efd7aef02cc854a3a261d99a302e4f0b81bd4ff7ca69ac378e.jpg", + "image_caption": [ + "Fig. 11: Comparison between IDM-VTON and OOTDiffusion [55] on In-the-Wild dataset. We provide visual comparison results on In-the-Wild dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 228, + 648, + 281, + 752 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/347164352941c354ef70d86d4ed005721e8e0b032992bdb48a7f203ce5eb2e2b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 287, + 648, + 387, + 752 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/c036d099157d7eae1b2cd892ea288cf42495da47a085ffb3f9de1d5034d8bf96.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 393, + 648, + 493, + 752 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/c2ab04002d27ee60a246f2ea2fe78e4632c00606a4f2bba27e0a196aa3a39443.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 511, + 648, + 563, + 752 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/24737bee5539aa587cb52d6e573ab27d658a06eceb72771eb41899babdd0ab66.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 566, + 648, + 666, + 752 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/6bb076ceba9a194a9eb1f5358d6834d6efb1162e327c7887a23a6d153dee2998.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 671, + 648, + 772, + 752 + ], + "page_idx": 22 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 22 + }, + { + "type": "page_number", + "text": "23", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/ff5da5fe2f5784de1abb73537c82263fbd852d143ff85ac5c0054489789e3eb4.jpg", + "image_caption": [ + "Fig. 12: Qualitative comparison on VITON-HD and DressCode dataset. As we observed in our quantitative analysis, GAN-based methods generally struggle to generate high-fidelity images introducing non-desirable distortions (e.g., non-realistic body and arms) while diffusion-based methods fail to capture low-level features or high-level semantics. All methods are trained on VITON-HD training data." + ], + "image_footnote": [], + "bbox": [ + 218, + 284, + 781, + 623 + ], + "page_idx": 23 + }, + { + "type": "page_number", + "text": "24", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 23 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 364, + 126 + ], + "page_idx": 23 + }, + { + "type": "image", + "img_path": "images/d3f5c0f19516de2f793e7eccad0723b378e6b3bd5805a9aae4671c5e0706db18.jpg", + "image_caption": [ + "Fig. 13: Qualitative comparison on In-the-Wild dataset. While baselines fail to generate natural images or capture the details of clothing, IDM-VTON produces realistic images and preserves fine details effectively. All methods are trained on VITON-HD training data." + ], + "image_footnote": [], + "bbox": [ + 218, + 279, + 781, + 654 + ], + "page_idx": 24 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 24 + }, + { + "type": "page_number", + "text": "25", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 24 + }, + { + "type": "image", + "img_path": "images/14fdf3e2e3e600a983f6438ab0c8b5a167204e91750cfe8ffd9b0f1f0b68398e.jpg", + "image_caption": [ + "Fig. 14: Try-on results on VITON-HD test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 230, + 181, + 772, + 758 + ], + "page_idx": 25 + }, + { + "type": "page_number", + "text": "26", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 25 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 25 + }, + { + "type": "image", + "img_path": "images/f61ad4b56344445bb5743d79c431d5382f2f55214b11292453d8ca4a2e4a27ce.jpg", + "image_caption": [ + "Fig. 15: Try-on results on DressCode test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 230, + 181, + 769, + 758 + ], + "page_idx": 26 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 26 + }, + { + "type": "page_number", + "text": "27", + "bbox": [ + 767, + 114, + 784, + 127 + ], + "page_idx": 26 + }, + { + "type": "image", + "img_path": "images/55a136d10b0d654d75e414688c70d74f3c264bf509eeffa545f4d481bbe91766.jpg", + "image_caption": [ + "Fig. 16: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 230, + 181, + 772, + 760 + ], + "page_idx": 27 + }, + { + "type": "page_number", + "text": "28", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 27 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 364, + 126 + ], + "page_idx": 27 + }, + { + "type": "image", + "img_path": "images/5440ec8b9da172ed3d8e33a9fdf7796175e7ac7232648d3a7b311bf4266c4dd1.jpg", + "image_caption": [ + "Fig. 17: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 230, + 181, + 772, + 758 + ], + "page_idx": 28 + }, + { + "type": "header", + "text": "Improving Diffusion Models for Virtual Try-on", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 28 + }, + { + "type": "page_number", + "text": "29", + "bbox": [ + 767, + 114, + 785, + 127 + ], + "page_idx": 28 + }, + { + "type": "image", + "img_path": "images/129d3a7a608c19847b6cbf62cb6be9da6f3cb77e269579f237c0a2d28fa115ba.jpg", + "image_caption": [ + "Fig. 18: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + ], + "image_footnote": [], + "bbox": [ + 230, + 181, + 772, + 758 + ], + "page_idx": 29 + }, + { + "type": "page_number", + "text": "30", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 29 + }, + { + "type": "header", + "text": "Y. Choi et al.", + "bbox": [ + 271, + 114, + 362, + 126 + ], + "page_idx": 29 + } +] \ No newline at end of file diff --git a/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_model.json b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_model.json new file mode 100644 index 0000000000000000000000000000000000000000..92a4277b6ba60d3a4b9e755a8ed915c39905698a --- /dev/null +++ b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_model.json @@ -0,0 +1,3582 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.262, + 0.141, + 0.743, + 0.187 + ], + "angle": 0, + "content": "Improving Diffusion Models for Authentic Virtual Try-on in the Wild" + }, + { + "type": "text", + "bbox": [ + 0.325, + 0.212, + 0.681, + 0.245 + ], + "angle": 0, + "content": "Yisol Choi\\(^{1}\\), Sangkyung Kwak\\(^{1}\\), Kyungmin Lee\\(^{1}\\), Hyungwon Choi\\(^{2}\\), and Jinwoo Shin\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.279, + 0.255, + 0.721, + 0.283 + ], + "angle": 0, + "content": "\\(^{1}\\) Korea Advanced Institute of Science and Technology (KAIST) {yisol.choi, skkwak9806, kyungmnlee, jinwoos}@kaist.ac.kr" + }, + { + "type": "text", + "bbox": [ + 0.445, + 0.283, + 0.558, + 0.296 + ], + "angle": 0, + "content": "2 OMNIOUS.AI" + }, + { + "type": "text", + "bbox": [ + 0.403, + 0.299, + 0.6, + 0.311 + ], + "angle": 0, + "content": "hyungwon.choi@omnious.com" + }, + { + "type": "image", + "bbox": [ + 0.227, + 0.349, + 0.773, + 0.536 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.537, + 0.788, + 0.58 + ], + "angle": 0, + "content": "Fig. 1: Virtual try-on images generated by using our IDM-VTON on VITON-HD [3] (top row, first and second column), DressCode [32] (top row, third and fourth column), and collected In-the-Wild dataset (bottom row). Best viewed on a zoomed, color monitor." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.619, + 0.744, + 0.842 + ], + "angle": 0, + "content": "Abstract. This paper considers image-based virtual try-on, which renders an image of a person wearing a curated garment, given a pair of images depicting the person and the garment, respectively. Previous works adapt existing exemplar-based inpainting diffusion models for virtual try-on to improve the naturalness of the generated visuals compared to other methods (e.g., GAN-based), but they fail to preserve the identity of the garments. To overcome this limitation, we propose a novel diffusion model that improves garment fidelity and generates authentic virtual try-on images. Our method, coined \\( IDM - VTON\\), uses two different modules to encode the semantics of garment image; given the base UNet of the diffusion model, 1) the high-level semantics extracted from a visual encoder are fused to the cross-attention layer, and then 2) the low-level features extracted from parallel UNet are fused to the self-attention layer. In addition, we provide detailed textual prompts for both garment and person images to enhance the authenticity of the generated visuals. Finally, we present a customization method using a" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.148, + 0.744, + 0.246 + ], + "angle": 0, + "content": "pair of person-garment images, which significantly improves fidelity and authenticity. Our experimental results show that our method outperforms previous approaches (both diffusion-based and GAN-based) in preserving garment details and generating authentic virtual try-on images, both qualitatively and quantitatively. Furthermore, the proposed customization method demonstrates its effectiveness in a real-world scenario. More visualizations are available in our project page." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.258, + 0.582, + 0.273 + ], + "angle": 0, + "content": "Keywords: Virtual Try-On \\(\\cdot\\) Diffusion Models" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.296, + 0.377, + 0.312 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.327, + 0.787, + 0.447 + ], + "angle": 0, + "content": "Image-based virtual try-on (VTON) is an important computer vision task, where the goal is to render a visual of an arbitrary person dressing in a specific garment given by images. Due to its convenience and capability to provide a personalized shopping experience to E-commerce users, there is a considerable interest in synthesizing authentic virtual try-on images that exactly depict the garment given as input. The key challenges of VTON is to fit the garment to the human body of various poses or gestures, without creating any distortions in the patterns and textures in garment [12, 51]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.448, + 0.789, + 0.703 + ], + "angle": 0, + "content": "The rapid progress in generative models [8, 14] has led the development of virtual try-on methods. Most of the primary approaches for image-based VTON are based on Generative Adversarial Networks [8, 22] (GANs), where they employ a separate warping module to deform the garment to the human body and use GAN generators to blend with the target person [3, 6, 7, 27, 29, 54]. However, such approaches struggle to generate high-quality images and often fail to generalize to different human images, introducing undesirable distortions to the garment. On the other hand, recently, diffusion models [14, 46] demonstrate superior performance in generating genuine images [30, 36, 39, 40] compared to GANs, showing the potential to overcome such challenges. Recent diffusion-based VTON methods [4, 9, 23, 28, 31, 35] utilize the rich generative prior of pretrained text-to-image (T2I) diffusion models [34, 40, 43] to enhance the naturalness of try-on images. To identify the details of garments, they encode the semantics of garments in pseudo-words [31] or use explicit warping networks [9]. However, those methods fall short in preserving the fine-grained details of garments, e.g., patterns, textures, shapes, or colors, which hinders its application to real-world scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.79, + 0.84 + ], + "angle": 0, + "content": "To overcome this limitation, this paper proposes an Improved Diffusion Models for Virtual Try-ON(IDM-VTON), which significantly enhances the consistency of the garment image, while generating authentic virtual try-on images. In specific, we design a new approach in conditioning garment images to the diffusion model by designing sophisticated attention modules, which consist of two different components: 1) the image prompt adapter that encodes the high-level semantics of the garment, and 2) the UNet encoder, which we refer to as GarmentNet, that extracts low-level features to preserve fine-grained details. In addition, we propose to customize our model using a single pair of garment and person images, which" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.206 + ], + "angle": 0, + "content": "further improves the visual quality of virtual try-on images, particularly in the wild scenario. Last but not least, we show the importance of providing detailed captions for the garment image which helps retaining the prior knowledge of T2I diffusion models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.207, + 0.79, + 0.344 + ], + "angle": 0, + "content": "We train our model on VITON-HD [3] training dataset, and demonstrate the effectiveness of our method by showing superior results on VITON-HD and DressCode [32] test datasets both qualitatively and quantitatively. Furthermore, to simulate the real-world virtual try-on application, we have collected In-the-Wild dataset, which contains garments with intricate patterns and human images with various poses and gestures, that is largely different from the training data. Our method outperforms other methods on In-the-Wild dataset, and in particular, customizing our model notably enhances retaining the identity of the garment while generating authentic try-on images." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.366, + 0.398, + 0.383 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.397, + 0.788, + 0.531 + ], + "angle": 0, + "content": "Image-based virtual try-on. Given a pair of images depicting a target person and a garment, the image-based virtual try-on aims to generate a look of the target person dressing the given garment. A line of works [3,6,7,27,29,54] is based on Generative Adversarial Networks (GANs) [8], where they first deform the garment to the person body shape, and then use the generator to put the deformed garment on the person image. While many works have attempted to reduce the mismatch between the warped garment and the person [3,7,21,27], those approaches lack generalization to arbitrary person images, e.g., with complex backgrounds or intricate poses." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.533, + 0.789, + 0.669 + ], + "angle": 0, + "content": "As diffusion models have shown great success [14, 47], recent works have studied the application of diffusion models for virtual try-on. TryOnDiffusion [61] proposed an architecture that uses two parallel UNets, and showed the capability of diffusion-based virtual try-on by training on the large-scale dataset. Subsequent works considered virtual try-on as an exemplar-based image inpainting problem [56]. They fine-tuned the inpainting diffusion models on virtual try-on dataset [9, 23, 31] to generate high-quality virtual try-on images. However, those methods still suffer from preserving meticulous details of garments, dampening their applications to real-world scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Adding conditional control to diffusion models. While text-to-image (T2I) diffusion models [34,40,43] have shown their capability in generating high-quality images from text prompts, the inaccuracy of natural language lacks fine-grained control in image synthesis. To this end, various works have proposed to add conditional control to T2I diffusion models [33,57,58,60]. ControlNet [58] and T2I-Adapter [33] proposed to fine-tune extra modules that encode spatial information such as edges, depth, and human pose, to control the diffusion model together with text prompts. Image prompt adapter (IP-Adapter) [57] proposed to condition T2I diffusion models with high-level semantics of reference image to control image generation with both textual and visual prompts." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.283 + ], + "angle": 0, + "content": "Customizing diffusion models. Several works have demonstrated the potential of customizing diffusion models with few personal images [5,11,25,42,45]. Together with parameter efficient fine-tuning methods [16,17] and regularized fine-tuning objective [26], T2I diffusion models can be adapted to unseen examples without catastrophic forgetting. Also, many works have studied the customization of diffusion models for various tasks such as masked image completion [48] or image restoration [2]. In this paper, we first present a customization of diffusion models for virtual try-on, where we show it significantly improves the adaptation to real-world scenarios." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.304, + 0.331, + 0.319 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.333, + 0.54, + 0.348 + ], + "angle": 0, + "content": "3.1 Backgrounds on Diffusion Models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.355, + 0.789, + 0.506 + ], + "angle": 0, + "content": "Diffusion models [14, 44] are generative models that consist of a forward process, which gradually adds Gaussian noise to the data, and a reverse process that gradually denoises a random noise to generate a sample. Suppose \\(\\mathbf{x}_0\\) be a data point (e.g., an image or a latent from the output of autoencoder [40]). Given noise schedules \\(\\{\\alpha_t\\}_{t=1}^T, \\{\\sigma_t\\}_{t=1}^T\\) for \\(t = 1, \\dots, T\\), the forward process at timestep \\(t\\) is given by \\(\\mathbf{x}_t = \\alpha_t \\mathbf{x}_0 + \\sigma_t \\boldsymbol{\\epsilon}\\), where \\(\\boldsymbol{\\epsilon} \\sim \\mathcal{N}(\\mathbf{0}, \\mathbf{I})\\) is a Gaussian noise. For sufficiently large \\(\\sigma_T\\), \\(\\mathbf{x}_T \\sim \\mathcal{N}(\\alpha_T \\mathbf{x}_0, \\sigma_T^2 \\mathbf{I})\\) is indiscernible from pure random Gaussian noise. Then the reverse generative process initializes from \\(\\mathbf{x}_T \\sim \\mathcal{N}(\\mathbf{0}, \\sigma_T^2 \\mathbf{I})\\), and sequentially denoises \\(\\mathbf{x}_t\\) into \\(\\mathbf{x}_{t-1}\\) for each \\(t\\), so that \\(\\mathbf{x}_0\\) is distributed according to the data distribution." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.526, + 0.789, + 0.678 + ], + "angle": 0, + "content": "Text-to-image (T2I) diffusion models. T2I diffusion models [34, 40, 43] are diffusion models that model the distribution of image conditioned on text, which is encoded by embeddings using the pretrained text encoders (e.g., T5 [38] and CLIP [37] text encoder). While convolutional UNet [41] architecture has been developed for diffusion-based generative models [14, 47], recent works have shown the promise of fusing transformer [50] architectures for UNet. Training a diffusion model is shown to be equivalent to learning a score function of a perturbed data distribution (i.e., denoising score matching [19]), where it is often done by \\(\\epsilon\\)-noise prediction loss [14]. Formally, given data \\(\\mathbf{x}_0\\) and text embedding \\(\\mathbf{c}\\), the training loss for the T2I diffusion model is given as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.31, + 0.685, + 0.788, + 0.705 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {D M}} (\\theta) = \\mathbb {E} _ {\\epsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}), t \\sim \\mathcal {U} [ 0, T ]} \\left[ \\omega (t) \\| \\epsilon_ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) - \\epsilon \\| _ {2} ^ {2} \\right], \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.711, + 0.788, + 0.817 + ], + "angle": 0, + "content": "where \\(\\mathbf{x}_t = \\alpha_t\\mathbf{x}_0 + \\sigma_t\\pmb{\\epsilon}\\) is a forward process of \\(\\mathbf{x}_0\\) and \\(\\omega (t)\\) is a weighting function at each timestep \\(t\\). To achieve better controllability over text conditioning, it uses classifier-free guidance (CFG) [15], which jointly learns unconditional and conditional. At the training stage, the text conditioning is randomly dropped out (i.e., giving null-text to the input), and at the inference stage, the CFG interpolates the conditional and unconditional noise output to control the strength of text conditioning:" + }, + { + "type": "equation", + "bbox": [ + 0.319, + 0.825, + 0.788, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) = s \\cdot \\left(\\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) - \\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; t)\\right) + \\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; t), \\tag {2}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.15, + 0.615, + 0.345 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.15, + 0.774, + 0.346 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.355, + 0.788, + 0.537 + ], + "angle": 0, + "content": "Fig. 2: Overview of IDM-VTON. We demonstrate the proposed model architecture and details on the attention modules. (Left) Our model consists of 1) TryonNet which is a main UNet that processes person image, 2) image prompt adapter (IP-Adapter) [57] that encodes high-level semantics of garment image \\(\\mathbf{x}_g\\), and 3) GarmentNet that encodes low-level features of \\(\\mathbf{x}_g\\). As of input for UNet, we concatenate the noised latents \\(\\mathbf{x}_t\\) of latents \\(\\mathcal{E}(\\mathbf{x}_p)\\) with the segmentation mask \\(\\mathbf{m}\\), masked image \\(\\mathcal{E}(\\mathbf{x}_m)\\), and Densepose [10] \\(\\mathcal{E}(\\mathbf{x}_{\\mathrm{pose}})\\). We provide a detailed caption to the garment (e.g., [V]: \"short sleeve round neck t-shirts\"). Then it is used for input prompt of GarmentNet (e.g., \"A photo of [V]\") and TryonNet (e.g., \"Model is wearing [V]\"). (Right) The intermediate features of TryonNet and GarmentNet are concatenated and passed to the self-attention layer, and we use the first half (i.e., that from TryonNet) of the output. Then we fuse the output with features from text encoder and IP-Adapter by cross-attention layer. We fine-tune the TryonNet and the IP-Adapter modules, and freeze other components." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.551, + 0.785, + 0.581 + ], + "angle": 0, + "content": "where \\(s \\geqslant 1\\) is a guidance scale that controls the text conditioning, and \\(\\epsilon_{\\theta}(\\mathbf{x}_t; t)\\) denotes the noise prediction with null-text embeddings." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.602, + 0.789, + 0.76 + ], + "angle": 0, + "content": "Image prompt adapter [57]. To condition the T2I diffusion model with a reference image, Ye et al. [57] proposed Image Prompt Adapter (IP-Adapter), which leverages the features extracted from image encoder (e.g., CLIP [37] image encoder) and attaches additional cross-attention layer to the text conditioning [40]. Let us denote \\(Q \\in \\mathbb{R}^{N \\times d}\\) be the query matrices from the intermediate representation of UNet, and \\(K_{c} \\in \\mathbb{R}^{N \\times d}\\), \\(V_{c} \\in \\mathbb{R}^{N \\times d}\\) be the key and value matrices from the text embeddings \\(\\mathbf{c}\\), where \\(N\\) is number of samples. The output of cross-attention layer is given by \\(\\text{Attention}(Q, K_{c}, V_{c}) = \\text{softmax}\\left(\\frac{Q K_{c}^{\\top}}{\\sqrt{d}}\\right) \\cdot V_{c}\\). Then IP-Adapter computes key and value matrices \\(K_{i} \\in \\mathbb{R}^{N \\times d}\\), \\(V_{i} \\in \\mathbb{R}^{N \\times d}\\) from the image embeddings \\(\\mathbf{i}\\), and inserts the cross-attention layer as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.333, + 0.769, + 0.788, + 0.786 + ], + "angle": 0, + "content": "\\[\n\\operatorname {A t t e n t i o n} \\left(Q, K _ {c}, V _ {c}\\right) + \\operatorname {A t t e n t i o n} \\left(Q, K _ {i}, V _ {i}\\right). \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Overall, the IP-Adapter freezes the original UNet, and fine-tunes only the (linear) projection layers of key and value matrices of image embeddings \\( K_{i} \\) and \\( V_{i} \\), and the linear projection layer that maps CLIP image embeddings." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.411, + 0.162 + ], + "angle": 0, + "content": "3.2 Proposed Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.79, + 0.399 + ], + "angle": 0, + "content": "Now, we present our method for designing diffusion models for virtual try-on. Let us denote \\(\\mathbf{x}_p\\) be the image of a person, and \\(\\mathbf{x}_g\\) be the image of a garment. Our primary goal is to generate an image \\(\\mathbf{x}_{\\mathrm{tr}}\\) that visualizes a person from \\(\\mathbf{x}_p\\) wearing a garment in image \\(\\mathbf{x}_g\\). It is common practice to cast virtual try-on as an exemplar-based image inpainting problem [56], which aims to fill the masked image with a reference image. Here, it is important to extract relevant information of garment, and add conditional control to the diffusion model. To this end, our model is composed of three components; 1) the base UNet (TryonNet) that processes the masked person image with its pose information, 2) the image prompt adapter (IP-Adapter) that extracts the high-level semantics of the garment, and 3) the garment UNet feature encoder (GarmentNet) that extracts the low-level features of the garment. The features from GarmentNet are fused within self-attention layer of TryonNet, and then it is processed with the features of IP-Adapter through cross-attention layer. We provide an overview of our method in Fig. 2, and provide detailed explanation of each component as follows." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.419, + 0.79, + 0.588 + ], + "angle": 0, + "content": "TryonNet. For the base UNet model, we consider latent diffusion model [40], where the diffusion generative modeling is conducted in latent space of variational autoencoder \\(\\mathcal{E}\\) and the output is passed to decoder \\(\\mathcal{D}\\) to generate an image. As of the input for our base UNet, we concatenate four components as follows: 1) the latent of person image, i.e., \\(\\mathcal{E}(\\mathbf{x}_p)\\), 2) the (resized) mask \\(\\mathbf{m}\\) that removes the garment on the person image, 3) the latent of masked-out person image \\(\\mathbf{x}_m = (1 - \\mathbf{m})\\odot \\mathbf{x}_p\\), i.e., \\(\\mathcal{E}(\\mathbf{x}_m)\\), following [3], and 4) the latent of the Densepose [10] \\(\\mathbf{x}_{\\mathrm{pose}}\\) of a person image, i.e., \\(\\mathcal{E}(\\mathbf{x}_{\\mathrm{pose}})\\). Then, the latents are aligned within the channel axis, where we expand the convolutional layer of UNet to 13 channels initialized with zero weights. Unlike previous works on virtual try-on with diffusion models [9, 23, 31], we leverage Stable Diffusion XL (SDXL) [36] inpainting model [49]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.607, + 0.79, + 0.7 + ], + "angle": 0, + "content": "Image prompt adapter. To condition the high-level semantics of a garment image, we leverage image prompt adapter (IP-Adapter) [57]. To encode the garment image, we use frozen CLIP image encoder (i.e., OpenCLIP [20] ViT-H/14) to extract feature and fine-tune feature projection layers and cross-attention layers, which are initialized with pretrained IP-Adapters. Note that we pass textual prompts of garments, and the cross-attention is computed as in Eq. (3)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.79, + 0.842 + ], + "angle": 0, + "content": "GarmentNet. While we already condition the garment image using IP-Adapter, it falls short in preserving the fine-grained details of garments when it has complicated patterns or graphic prints (e.g., see Fig. 6). This is because the CLIP image encoder lacks extracting the low-level features of a garment. To tackle this issue, we propose to utilize an additional UNet encoder (i.e., garment UNet encoder) to encode fine-details of garment images. Given the latent of a garment image \\(\\mathcal{E}(\\mathbf{x}_g)\\), we pass through the (frozen) pretrained UNet encoder to obtain the intermediate representation, and concatenate with the intermediate representation" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.144, + 0.383, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.245, + 0.303, + 0.358, + 0.316 + ], + "angle": 0, + "content": "(a) Public Dataset" + }, + { + "type": "image", + "bbox": [ + 0.391, + 0.144, + 0.469, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.391, + 0.303, + 0.468, + 0.309 + ], + "angle": 0, + "content": "" + }, + { + "type": "image", + "bbox": [ + 0.472, + 0.144, + 0.777, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.512, + 0.303, + 0.655, + 0.316 + ], + "angle": 0, + "content": "(b) In-the-wild Dataset" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.322, + 0.788, + 0.392 + ], + "angle": 0, + "content": "Fig. 3: Comparisons between datasets used in our experiments. For evaluation, we test on (a) public dataset, including VITON-HD [3] and DressCode [32], and (b) In-the-Wild dataset, which we internally collected from real E-commerce setup. We remark that the In-the-Wild dataset contains more intricate patterns and logos in garment image, and diverse backgrounds, and poses in person image." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.411, + 0.788, + 0.517 + ], + "angle": 0, + "content": "from the TryonNet. Then we compute the self-attention on the concatenated features and then pass only the first-half dimensions from TryonNet. We use UNet of SDXL [36] for our GarmentNet, which helps utilizing the rich generative prior of the pretrained text-to-image diffusion model, and complements the low-level feature that is often ignored in the cross-attention layer of IP-Adapter. Remark that a similar approach was introduced in [18], which used a similar attention mechanism in preserving consistency for video generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.542, + 0.788, + 0.74 + ], + "angle": 0, + "content": "Detailed captioning of garments. While the majority of diffusion-based virtual try-on models leverage pretrained text-to-image diffusion models, they do not take the text prompts as input [9,23] or use a naive text prompts [31] such as \"upper garment\" for any garment image. To fully exploit the rich generative prior of the text-to-image diffusion model, we provide a comprehensive caption [26] that describes the detail of a garment, such as shapes or textures. As shown in Fig. 2, we provide a comprehensive caption to the garment image (e.g., \"short sleeve round neck t-shirts\") and pass it to both GarmentNet (i.e., \"a photo of short sleeve round neck t-shirts\") and the TryonNet (i.e., \"model is wearing short sleeve round neck t-shirts\"). This helps the model to encode the high-level semantics of the garment using natural language, and complements the image-based conditioning (e.g., see Fig. 7). In practice, we utilize an image annotator for fashion images, and manually provide captioning with templates (see Appendix for details)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Customization of IDM-VTON. While our model is able to capture the fine-details of garments, it often struggles when the person image \\(\\mathbf{x}_p\\) or the garment image \\(\\mathbf{x}_g\\) is different from training distribution (e.g., see Fig. 3). To this end, inspired by text-to-image personalization methods [2, 42, 48], we propose an effective customization of IDM-VTON by fine-tuning TryonNet with a pair" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.23, + 0.143, + 0.773, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.462, + 0.334, + 0.537, + 0.346 + ], + "angle": 0, + "content": "(a) VITON-HD" + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.348, + 0.773, + 0.436 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.23, + 0.436, + 0.756, + 0.522 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.434, + 0.522, + 0.566, + 0.534 + ], + "angle": 0, + "content": "(b) DressCode (upper body)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.541, + 0.788, + 0.611 + ], + "angle": 0, + "content": "Fig. 4: Qualitative results on VITON-HD and DressCode dataset. We show generated virtual try-on images using IDM-VTON (ours) compared with other methods on (a) VITON-HD [3], and (b) DressCode (upper body) [32] test datasets. We see that IDM-VTON outperforms others in generating authentic images and preserving fine-grained details of garment. Best viewed in zoomed, color monitor." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.627, + 0.788, + 0.719 + ], + "angle": 0, + "content": "of garment and person images. It is straightforward to fine-tune IDM-VTON when we have a pair of images \\(\\mathbf{x}_p\\) and \\(\\mathbf{x}_g\\), where the person in \\(\\mathbf{x}_p\\) is wearing the garment in \\(\\mathbf{x}_g\\). On the other hand, if we only have \\(\\mathbf{x}_p\\), we segment the garment and white-out backgrounds to obtain \\(\\mathbf{x}_g\\). Remark that we fine-tune only the attention layers of the up-blocks (i.e., decoder layers) of TryonNet, which empirically works well (e.g., see Table 4)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.74, + 0.367, + 0.758 + ], + "angle": 0, + "content": "4 Experiment" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.771, + 0.428, + 0.788 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Implementation details. We use SDXL inpainting model [49] for our TryonNet, pretrained IP-Adapter [57] for image adapter and UNet of SDXL [36] for our GarmentNet. We train our model using VITON-HD [3] train dataset, which" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.228 + ], + "angle": 0, + "content": "Table 1: Quantitative results on VITON-HD dataset. We evaluate the reconstruction scores (e.g., LPIPS, SSIM) for low-level similarity, CLIP image similarity score (CLIP-I) for high-level semantic similarity, and FID score for image fidelity. We compare with GAN-based virtual try-on methods (e.g., HR-VTON and GP-VTON), and Diffusion-based virtual try-on methods (e.g., LaDI-VTON, DCI-VTON, StableVITON). Bold denotes the best score for each metric." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.234, + 0.773, + 0.415 + ], + "angle": 0, + "content": "
DatasetVITON-HDDressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
GAN-based methods
HR-VITON [27]0.1150.8839.700.8320.1120.91021.420.771
GP-VTON [54]0.1050.8986.430.8740.4840.78055.210.628
Diffusion-based methods
LaDI-VTON [31]0.1560.8728.850.8340.1490.90516.540.803
DCI-VTON [9]0.1660.8568.730.8400.1620.89317.630.777
StableVITON [23]0.1330.8856.520.8710.1070.91014.370.866
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.493 + ], + "angle": 0, + "content": "contains 11,647 person-garment image pairs at \\(1024 \\times 768\\) resolution. We train our model using Adam [24] optimizer with batch size of 24 and learning rate of 1e-5 for 130 epochs. For customization, we fine-tune our model using Adam optimizer with learning rate 1e-6 for 100 steps." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.514, + 0.788, + 0.727 + ], + "angle": 0, + "content": "Evaluation dataset. We evaluate our model on public VITON-HD [3] and DressCode [32] test datasets. Furthermore, we internally collected In-the-Wild dataset, which is crawled from the web to assess the generalization of model to the real-world scenario. While VITON-HD and DressCode contain person images of simple poses and solid backgrounds, our In-the-Wild dataset has person images of various poses and gestures with complex backgrounds. Also, the garments are of various patterns and logos, making virtual try-on more challenging than VITON-HD and DressCode (e.g., see Fig. 3). Furthermore, In-the-Wild dataset contains multiple person images per garment, so it is possible to evaluate the results when we customize our network with each garment. Specifically, it consists of 62 images of upper garments and 312 images of people wearing those garments, where there are 4-6 images of person wearing the same garment. To conduct customization experiment, we select one person image for each garment, and use the left 250 person images for evaluation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Baselines. We compare our method with GAN-based methods (HR-VITON [27] and GP-VTON [54]), and diffusion-based methods (LaDI-VTON [31], DCI-VTON [9], and StableVITON [23]). HR-VITON and GP-VTON have a separate warping module to estimate the fitted garment on the target person, generating try-on images with GAN using the garment as input. LaDI-VTON, DCI-VTON, and StableVITON are most relevant baselines of ours, where they also utilize" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.147, + 0.779, + 0.517 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.521, + 0.788, + 0.619 + ], + "angle": 0, + "content": "Fig. 5: Qualitative comparisons on In-the-Wild dataset. We show generated virtual try-on images on In-the-Wild dataset using IDM-VTON (ours) compared with other methods. IDM-VTON outperforms other methods in generating authentic images and preserving fine-grained details of garment. In particular, customizing IDM-VTON, (i.e., IDM-VTON\\(\\ddagger\\)), significantly enhances the image quality and garment fidelity. When applying customization on StableVITON, (i.e., StableVITON\\(\\ddagger\\)), the improvements are marginal compared to ours. Best viewed in zoomed, color monitor." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.637, + 0.788, + 0.744 + ], + "angle": 0, + "content": "pretrained Stable Diffusion (SD). In specific, LaDI-VTON and DCI-VTON employ separate warping modules to condition the garment, while StableVITON utilizes the SD Encoder for garment conditioning. We use the pretrained checkpoints provided in their official repositories to generate images. For a fair comparison, we generate images of resolution \\(1024 \\times 768\\) images if available, otherwise generate images of resolution \\(512 \\times 384\\) and upscale to \\(1024 \\times 768\\) using various methods, e.g., interpolation or super resolution [52], and report the best one." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Evaluation metrics. For quantitative evaluation, we measure low-level reconstruction scores such as LPIPS [59] and SSIM [53], and high-level image similarity using CLIP [37] image similarity score. To evaluate the authenticity of generated images, we compute Frenchet Inception Distance (FID) [13] score on VITON-HD and DressCode test dataset." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.228 + ], + "angle": 0, + "content": "Table 2: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with other methods on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP [37] image similarity scores. For IDM-VTON and StableVITON [23], we further customize models using a single pair of person-garment images (denoted by \\(\\ddagger\\)). We see that IDM-VTON outperforms other methods, and customized IDM-VTON (i.e., IDM-VTON\\(\\ddagger\\)) performs the best." + }, + { + "type": "table", + "bbox": [ + 0.342, + 0.235, + 0.658, + 0.37 + ], + "angle": 0, + "content": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
HR-VITON [27]0.3300.7410.701
LaDI-VTON [31]0.3030.7680.819
DCI-VTON [9]0.2830.7350.752
Stable-VITON [23]0.2600.7360.836
IDM-VTON (ours)0.1640.7950.901
Stable-VITON‡ [23]0.2590.7330.858
IDM-VTON‡ (ours)0.1500.7970.909
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.404, + 0.479, + 0.418 + ], + "angle": 0, + "content": "4.2 Results on Public Dataset" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.789, + 0.671 + ], + "angle": 0, + "content": "Qualitative results. Fig. 4 shows the visual comparisons of IDM-VTON with other methods on VITON-HD and DressCode test datasets. We see that IDM-VTON preserves both low-level details and high-level semantics, while others struggle to capture. While GAN-based methods (i.e., HR-VITON and GP-VTON) show comparable performance in capturing fine details of garment, they fall shorts in generating natural human images compared to diffusion-based methods. On the other hand, prior diffusion-based methods (i.e., LaDI-VTON, DCI-VTON, and StableVITON) fail to preserve the details of garments (e.g., the off-shoulder t-shirts in first row, or the details of sweatshirts in second row of VITON-HD dataset). Also, we observe that IDM-VTON significantly outperforms other methods in generalization to the DressCode dataset. Especially, GAN-based methods show inferior performance on the DressCode dataset, showing its poor generalization ability. While prior diffusion-based methods show better images in generating natural images than GAN-based, the generated images show lower consistency with respect to given garment image compared to IDM-VTON." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.79, + 0.84 + ], + "angle": 0, + "content": "Quantitative results. Tab. 1 shows the quantitative comparisons between IDM-VTON (ours) and other methods on VITON-HD and DressCode test datasets. When compared to GAN-based methods, we observe that IDM-VTON shows comparable performance in reconstruction scores (LPIPS and SSIM) and outperforms in FID and CLIP image similarity score on VITON-HD test dataset. However, the performance of GAN-based methods significantly degrades when tested on DressCode dataset, which we have observed in Fig. 4. We see that IDM-VTON consistently outperforms prior diffusion-based methods in both VITON-HD and DressCode dataset." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.146, + 0.28, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.284, + 0.146, + 0.387, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.39, + 0.146, + 0.492, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.146, + 0.666, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.669, + 0.147, + 0.769, + 0.26 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.267, + 0.787, + 0.323 + ], + "angle": 0, + "content": "Fig. 6: Effect of GarmentNet. We compare the generated virtual try-on images without using GarmentNet (left) and together with GarmentNet (right). We observe that using GarmentNet significantly improves retaining the fine-grained details of garment (e.g., the graphics in the t-shirts)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.34, + 0.521, + 0.354 + ], + "angle": 0, + "content": "4.3 Results on In-the-Wild Dataset" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.365, + 0.786, + 0.426 + ], + "angle": 0, + "content": "Here, we evaluate our methods on challenging In-the-Wild dataset, where we compare with other diffusion-based VTON methods. In addition, we show the results of customization using a single pair of garment-person images. We also test customization on StableVITON [23]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.447, + 0.788, + 0.552 + ], + "angle": 0, + "content": "Qualitative results. Fig. 5 shows the qualitative results of IDM-VTON (ours) compared to other baselines3. We see that IDM-VTON generates more authentic images than LaDI-VTON, DCI-VTON, and StableVITON, yet it struggles to preserve the intricate patterns of garments. By customizing IDM-VTON, we obtain virtual try-on images with a high degree of consistency to the garment (e.g., the logos and the text renderings), but we find the customization does not work well for StableVITON." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.575, + 0.788, + 0.681 + ], + "angle": 0, + "content": "Quantitative results. Tab. 2 reports the quantitative comparisons between our IDM-VTON and other methods. We also provide comparisons between IDM-VTON and StableVITON using customization (i.e., IDM-VTON\\(\\ddagger\\) and StableVITON\\(\\ddagger\\)). We see that IDM-VTON outperforms other methods on all metrics, even outperforming StableVITON with customization. Furthermore, we observe that IDM-VTON with customization significantly outperforms others, showing its generalization capability." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.703, + 0.4, + 0.717 + ], + "angle": 0, + "content": "4.4 Ablative Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.728, + 0.787, + 0.804 + ], + "angle": 0, + "content": "Effect of GarmentNet. We conduct an ablation study on the effect of GarmentNet in preserving the fine-grained details of a garment. For comparison, we train another model without using GarmentNet (i.e., using only IP-Adapter to encode garment image). The qualitative results are in Fig. 6. While training with only IP-Adapter is able to generate authentic virtual try-on images that are" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.786, + 0.84 + ], + "angle": 0, + "content": "3 We do not compare with GP-VTON as it uses private parsing modules. Comparison with HR-VITON is in the appendix." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image_caption", + "bbox": [ + 0.23, + 0.151, + 0.27, + 0.162 + ], + "angle": 0, + "content": "Input" + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.168, + 0.282, + 0.27 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.297, + 0.152, + 0.376, + 0.164 + ], + "angle": 0, + "content": "\"upper garment\"" + }, + { + "type": "image", + "bbox": [ + 0.288, + 0.168, + 0.387, + 0.27 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.395, + 0.149, + 0.488, + 0.168 + ], + "angle": 0, + "content": "\"round neck short sleeve blouse\"" + }, + { + "type": "image", + "bbox": [ + 0.394, + 0.17, + 0.493, + 0.27 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.519, + 0.152, + 0.549, + 0.163 + ], + "angle": 0, + "content": "Input" + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.168, + 0.56, + 0.269 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.576, + 0.152, + 0.654, + 0.163 + ], + "angle": 0, + "content": "\"upper garment\"" + }, + { + "type": "image", + "bbox": [ + 0.564, + 0.168, + 0.665, + 0.269 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.675, + 0.148, + 0.764, + 0.169 + ], + "angle": 0, + "content": "\"sleeveless square neck tube top\"" + }, + { + "type": "image", + "bbox": [ + 0.671, + 0.17, + 0.769, + 0.269 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.275, + 0.785, + 0.331 + ], + "angle": 0, + "content": "Fig. 7: Effect of detailed caption for garment. We compare the generated virtual try-on images using naive captions (left) and detailed captions (right). The model trained with detailed captions generates images that are more consistent with the garment. Best viewed in zoomed, color monitor." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.34, + 0.784, + 0.41 + ], + "angle": 0, + "content": "Table 3: Ablation on GarmentNet. Table 4: Ablation on customization. We ablate the effect of using GarmentNet We compare default IDM-VTON with by comparing LPIPS, SSIM, and CLIP different customization methods by fineimage similarity scores on the VITON-HD tuning all UNet layers, LoRA [17] layers, test dataset. or up-block layers (Decoder)." + }, + { + "type": "table", + "bbox": [ + 0.224, + 0.422, + 0.486, + 0.482 + ], + "angle": 0, + "content": "
GarmentNetLPIPS ↓SSIM ↑CLIP-I ↑
X0.1210.8490.846
✓0.1020.8700.883
" + }, + { + "type": "table", + "bbox": [ + 0.521, + 0.411, + 0.761, + 0.503 + ], + "angle": 0, + "content": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
Default0.16420.7950.901
All UNet0.15120.7970.891
LoRA0.15730.7940.881
Decoder0.15020.7970.909
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.54, + 0.788, + 0.631 + ], + "angle": 0, + "content": "semantically consistent with the garment images, we see that using GarmentNet significantly improves preserving the identity of the garment (e.g., the graphics of t-shirts). In addition, we conduct a quantitative evaluation on VITON-HD test dataset by measuring LPIPS, SSIM and CLIP image similarity score. In Tab. 3, we see that using GarmentNet quantitatively improves reconstruction scores, as well as image similarity scores, which is aligned with our qualitative results." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Effect of detailed caption. To validate the effectiveness of detailed captioning on garments, we train an identical model to IDM-VTON except that using naive caption [31], and compare with IDM-VTON. In specific, naive caption provides an unified descriptions of all upper garments (e.g., \"model is wearing an upper garment\"), while our detailed captions provide specific descriptions of each garment. Fig. 7 shows generated virtual try-on images using each model trained with naive caption (left) and detailed captions (right). We observe that the model trained with detailed captions generates images with higher consistency to the garment (e.g., meshes around the neck and arms). Thus, the usage of detailed captions complements the potential inaccuracy of image-based virtual try-on by exploiting the generative prior of text-to-image diffusion model." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.314 + ], + "angle": 0, + "content": "Ablation on customization. During customization, we fine-tune the up-blocks of TryonNet (i.e., decoder layers). Here, we provide an ablation study on the choice of fine-tuning layer for customization. We compare default IDM-VTON (i.e., no customization), fine-tuning all UNet layers, using low rank adaptation (LoRA) [17], and fine-tuning decoder layers. In Tab. 4, we see that all customization methods improve reconstruction score (LPIPS, SSIM) compared to default IDM-VTON, while showing comparable performance in CLIP image similarity score. We see that fine-tuning decoder layers perform the best among customization methods, while fine-tuning all UNet layers shows comparable performance. While finetuning with LoRA is more efficient, we find it underperforms than fine-tuning decoder layers." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.333, + 0.36, + 0.349 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.361, + 0.788, + 0.543 + ], + "angle": 0, + "content": "In this paper, we present IDM-VTON, a novel design of diffusion models for authentic virtual try-on, particularly in the wild scenario. We incorporate two separate modules to encode the garment image, i.e., visual encoder and parallel UNet, which effectively encode high-level semantics and low-level features to the base UNet, respectively. In order to improve the virtual try-on on real world scenario, we propose to customize our model by fine-tuning the decoder layers of UNet given a pair of garment-person images. We also leverage detailed natural language descriptions for garments, which help generating authentic virtual try-on images. Extensive experiments on various datasets show the superiority of our method over prior works in both preserving details of garment, and generating high fidelity images. In particular, we demonstrate the potential of our method in virtual try-on in the wild." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.561, + 0.788, + 0.622 + ], + "angle": 0, + "content": "Potential negative impact. The virtual try-on technology comes with benefits and pitfalls - the tool could be helpful for users to effectively visualize their look with given garment. However, it requires the users to be responsible for protecting the ownership, and avoid malicious use." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.641, + 0.788, + 0.732 + ], + "angle": 0, + "content": "Limitation. IDM-VTON struggles to preserve human attributes on masked regions such as tattoos or skin moles. One can design a method for conditioning those human attributes of when generating try-on images. Also, while we exploit the prior knowledge of T2I diffusion models by providing comprehensive captions, exploring broader applications to fully utilize the prior, such as controlling garment generation through textual prompts, is left as future work." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.752, + 0.396, + 0.769 + ], + "angle": 0, + "content": "Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00075 Artificial Intelligence Graduate School Program(KAIST); No.RS-2021-II212068, Artificial Intelligence Innovation Hub)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.176, + 0.787, + 0.232 + ], + "angle": 0, + "content": "1. Avrahami, O., Hayes, T., Gafni, O., Gupta, S., Taigman, Y., Parikh, D., Lischinski, D., Fried, O., Yin, X.: Spatext: Spatio-textual representation for controllable image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18370-18380 (2023) 20" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.233, + 0.787, + 0.272 + ], + "angle": 0, + "content": "2. Chari, P., Ma, S., Ostashev, D., Kadambi, A., Krishnan, G., Wang, J., Aberman, K.: Personalized restoration via dual-pivot tuning. arXiv preprint arXiv:2312.17234 (2023) 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.787, + 0.327 + ], + "angle": 0, + "content": "3. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14131-14140 (2021) 1, 2, 3, 6, 7, 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.329, + 0.787, + 0.37 + ], + "angle": 0, + "content": "4. Cui, A., Mahajan, J., Shah, V., Gomathinayagam, P., Lazebnik, S.: Street tryon: Learning in-the-wild virtual try-on from unpaired person images. arXiv preprint arXiv:2311.16094 (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.371, + 0.787, + 0.412 + ], + "angle": 0, + "content": "5. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.412, + 0.787, + 0.453 + ], + "angle": 0, + "content": "6. Ge, C., Song, Y., Ge, Y., Yang, H., Liu, W., Luo, P.: Disentangled cycle consistency for highly-realistic virtual try-on. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16928-16937 (2021) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.454, + 0.787, + 0.495 + ], + "angle": 0, + "content": "7. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8485-8493 (2021) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.495, + 0.787, + 0.536 + ], + "angle": 0, + "content": "8. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139-144 (2020) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.537, + 0.787, + 0.59 + ], + "angle": 0, + "content": "9. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: Proceedings of the 31st ACM International Conference on Multimedia. pp. 7599-7607 (2023) 2, 3, 6, 7, 9, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.591, + 0.787, + 0.633 + ], + "angle": 0, + "content": "0. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7297-7306 (2018) 5, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.633, + 0.787, + 0.661 + ], + "angle": 0, + "content": "1. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. arXiv preprint arXiv:2303.11305 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.787, + 0.702 + ], + "angle": 0, + "content": "2. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7543-7552 (2018) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.702, + 0.787, + 0.743 + ], + "angle": 0, + "content": "3. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.744, + 0.787, + 0.771 + ], + "angle": 0, + "content": "4. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020) 2, 3, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.772, + 0.787, + 0.799 + ], + "angle": 0, + "content": "5. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 4, 20" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "6. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: International Conference on Machine Learning. pp. 2790-2799. PMLR (2019) 4" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.176, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "17. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021) 4, 13, 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.787, + 0.229 + ], + "angle": 0, + "content": "18. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.229, + 0.787, + 0.256 + ], + "angle": 0, + "content": "19. Hyvarinen, A., Dayan, P.: Estimation of non-normalized statistical models by score matching. Journal of Machine Learning Research 6(4) (2005) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.256, + 0.787, + 0.323 + ], + "angle": 0, + "content": "20. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below. 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.324, + 0.787, + 0.379 + ], + "angle": 0, + "content": "21. Issenhuth, T., Mary, J., Calauzenes, C.: Do not mask what you do not need to mask: a parser-free virtual try-on. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 619-635. Springer (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.379, + 0.787, + 0.42 + ], + "angle": 0, + "content": "22. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4401-4410 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.42, + 0.787, + 0.461 + ], + "angle": 0, + "content": "23. Kim, J., Gu, G., Park, M., Park, S., Choo, J.: Stableviton: Learning semantic correspondence with latent diffusion model for virtual try-on. arXiv preprint arXiv:2312.01725 (2023) 2, 3, 6, 7, 9, 11, 12, 20" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.461, + 0.787, + 0.487 + ], + "angle": 0, + "content": "24. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 9, 20" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.487, + 0.787, + 0.528 + ], + "angle": 0, + "content": "25. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.528, + 0.787, + 0.568 + ], + "angle": 0, + "content": "26. Lee, K., Kwak, S., Sohn, K., Shin, J.: Direct consistency optimization for compositional text-to-image personalization. arXiv preprint arXiv:2402.12004 (2024) 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.568, + 0.787, + 0.609 + ], + "angle": 0, + "content": "27. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: European Conference on Computer Vision. pp. 204-219. Springer (2022) 2, 3, 9, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.609, + 0.787, + 0.663 + ], + "angle": 0, + "content": "28. Li, N., Liu, Q., Singh, K.K., Wang, Y., Zhang, J., Plummer, B.A., Lin, Z.: Unihuman: A unified model for editing human images in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2039-2048 (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.663, + 0.787, + 0.704 + ], + "angle": 0, + "content": "29. Men, Y., Mao, Y., Jiang, Y., Ma, W.Y., Lian, Z.: Controllable person image synthesis with attribute-decomposed gan. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5084-5093 (2020) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.704, + 0.787, + 0.744 + ], + "angle": 0, + "content": "30. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.787, + 0.785 + ], + "angle": 0, + "content": "31. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladivton: Latent diffusion textual-inversion enhanced virtual try-on. arXiv preprint arXiv:2305.13501 (2023) 2, 3, 6, 7, 9, 11, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.785, + 0.787, + 0.84 + ], + "angle": 0, + "content": "32. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2231-2235 (2022) 1, 3, 7, 8, 9" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "33. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.233 + ], + "angle": 0, + "content": "34. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021) 2, 3, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.234, + 0.788, + 0.275 + ], + "angle": 0, + "content": "35. Ning, S., Wang, D., Qin, Y., Jin, Z., Wang, B., Han, X.: Picture: Photorealistic virtual try-on from unconstrained designs. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6976-6985 (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.276, + 0.788, + 0.317 + ], + "angle": 0, + "content": "36. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023) 2, 6, 7, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.318, + 0.788, + 0.374 + ], + "angle": 0, + "content": "37. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 4, 5, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.375, + 0.788, + 0.416 + ], + "angle": 0, + "content": "38. Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., Liu, P.J.: Exploring the limits of transfer learning with a unified text-to-text transformer. The Journal of Machine Learning Research 21(1), 5485-5551 (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.417, + 0.788, + 0.459 + ], + "angle": 0, + "content": "39. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.46, + 0.788, + 0.514 + ], + "angle": 0, + "content": "40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) 2, 3, 4, 5, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.516, + 0.788, + 0.572 + ], + "angle": 0, + "content": "41. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.573, + 0.788, + 0.627 + ], + "angle": 0, + "content": "42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023) 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.684 + ], + "angle": 0, + "content": "43. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) 2, 3, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.685, + 0.788, + 0.727 + ], + "angle": 0, + "content": "44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.728, + 0.788, + 0.769 + ], + "angle": 0, + "content": "45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., et al.: Styledrop: Text-to-image generation in any style. arXiv preprint arXiv:2306.00983 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.77, + 0.788, + 0.798 + ], + "angle": 0, + "content": "46. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.788, + 0.84 + ], + "angle": 0, + "content": "47. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020) 3, 4" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "48. Tang, L., Ruiz, N., Chu, Q., Li, Y., Holynski, A., Jacobs, D.E., Hariharan, B., Pritch, Y., Wadhwa, N., Aberman, K., et al.: Realfill: Reference-driven generation for authentic image completion. arXiv preprint arXiv:2309.16668 (2023) 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.616, + 0.203 + ], + "angle": 0, + "content": "49. team, D.: Stable diffusion xl inpainting. link (2023) 6, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.204, + 0.787, + 0.245 + ], + "angle": 0, + "content": "50. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "51. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: Proceedings of the European conference on computer vision (ECCV). pp. 589-604 (2018) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.327 + ], + "angle": 0, + "content": "52. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind superresolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.787, + 0.369 + ], + "angle": 0, + "content": "53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.37, + 0.787, + 0.424 + ], + "angle": 0, + "content": "54. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23550-23559 (2023) 2, 3, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.465 + ], + "angle": 0, + "content": "55. Xu, Y., Gu, T., Chen, W., Chen, C.: Ootdiffusion: Outfitting fusion based latent diffusion for controllable virtual try-on. arXiv preprint arXiv:2403.01779 (2024) 21, 22, 23" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.787, + 0.522 + ], + "angle": 0, + "content": "56. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18381-18391 (2023) 3, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.787, + 0.563 + ], + "angle": 0, + "content": "57. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. arXiv preprint arXiv:2308.06721 (2023) 3, 5, 6, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.787, + 0.605 + ], + "angle": 0, + "content": "58. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.787, + 0.646 + ], + "angle": 0, + "content": "59. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.787, + 0.687 + ], + "angle": 0, + "content": "60. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unictrlnet: All-in-one control to text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.688, + 0.787, + 0.743 + ], + "angle": 0, + "content": "61. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4606-4615 (2023) 3" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.743 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.128 + ], + "angle": 0, + "content": "19" + }, + { + "type": "title", + "bbox": [ + 0.436, + 0.143, + 0.572, + 0.168 + ], + "angle": 0, + "content": "Appendix" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.187, + 0.486, + 0.205 + ], + "angle": 0, + "content": "A Implementation Details" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.218, + 0.434, + 0.233 + ], + "angle": 0, + "content": "A.1 In-the-Wild Dataset" + }, + { + "type": "image", + "bbox": [ + 0.224, + 0.266, + 0.317, + 0.36 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.331, + 0.267, + 0.78, + 0.361 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.224, + 0.365, + 0.316, + 0.46 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.366, + 0.78, + 0.46 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.224, + 0.463, + 0.316, + 0.557 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.464, + 0.78, + 0.557 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.224, + 0.56, + 0.316, + 0.655 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.561, + 0.78, + 0.654 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.666, + 0.788, + 0.695 + ], + "angle": 0, + "content": "Fig. 8: Examples of In-the-Wild dataset. We collect pairs of garment and human wearing the garment." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.727, + 0.788, + 0.819 + ], + "angle": 0, + "content": "In-the-Wild dataset comprises multiple human images wearing each target garment. Images of garment are collected from MLB online shopping mall4 and images of human wearing each garment are gathered from social media platforms like Instagram. As shown in Fig. 8, the human images exhibit diverse backgrounds, ranging from parks and buildings to snowy landscapes. For preprocessing, we employ center cropping on the human images to achieve resolutions of \\(1024 \\times 768\\)" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.538, + 0.841 + ], + "angle": 0, + "content": "4 https://www.mlb-korea.com/main/mall/view" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "20" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.146, + 0.775, + 0.23 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.24, + 0.788, + 0.283 + ], + "angle": 0, + "content": "Fig. 9: Illustration of generating detailed captions of garments. We utilize pretrained fashion attribute tagging annotator to extract information of garment and generate detailed captions of the garment based on extracted information." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.313, + 0.785, + 0.345 + ], + "angle": 0, + "content": "resolutions, while the garment images are resized to the same dimensions for compatible setting." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.367, + 0.456, + 0.383 + ], + "angle": 0, + "content": "A.2 Training and Inference" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.393, + 0.788, + 0.514 + ], + "angle": 0, + "content": "We train the model using the Adam [24] optimizer with a fixed learning rate of 1e-5 over 130 epochs (63k iterations with batch size of 24). It takes around 40 hours in training with \\(4 \\times \\mathrm{A800}\\) GPUs. We apply data augmentations following StableVITON [23], where we apply horizontal flip (with probability 0.5), random affine shifting and scaling (limit of 0.2, with probability 0.5) to the inputs of TryonNet, i.e., \\(\\mathbf{x}_p, \\mathbf{x}_{\\mathrm{pose}}, \\mathbf{x}_m\\) and \\(\\mathbf{m}\\). For customization, we fine-tune our model using the Adam optimizer with a fixed learning rate of 1e-6 for 100 steps. It takes around 2 minutes with a single A800 GPU." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.514, + 0.788, + 0.62 + ], + "angle": 0, + "content": "During the inference, we generate images using the DDPM scheduler with 30 steps. We set the strength value to 1.0, i.e., denoising begins from random Gaussian noise, to ignore the masked portion of the input image. For classifier-free guidance [15] (CFG), we merge both conditioning, i.e., low-level features \\(\\mathbf{L}_g\\) from GarmentNet and high-level semantics \\(\\mathbf{H}_g\\) from IP-Adapter, as these conditions contain features of the same garment image, following SpaText [1]. In specific, the forward is given as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.279, + 0.632, + 0.788, + 0.65 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; \\mathbf {L} _ {g}, \\mathbf {H} _ {g}, t\\right) = s \\cdot \\left(\\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; \\mathbf {L} _ {g}, \\mathbf {H} _ {g}, t\\right) - \\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; t\\right)\\right) + \\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; t\\right), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.66, + 0.788, + 0.707 + ], + "angle": 0, + "content": "where \\(\\epsilon_{\\theta}(\\mathbf{x}_t;\\mathbf{L}_g,\\mathbf{H}_g,t)\\) denotes noise prediction with conditions \\(\\mathbf{L}_g\\) and \\(\\mathbf{H}_g\\), and \\(\\epsilon_{\\theta}(\\mathbf{x}_t;t)\\) denotes unconditional noise prediction. We use guidance scale \\(s = 2.0\\), which works well in practice." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.73, + 0.533, + 0.746 + ], + "angle": 0, + "content": "A.3 Detailed captioning of garments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.756, + 0.788, + 0.817 + ], + "angle": 0, + "content": "We generate detailed captions for each garment to leverage the prior knowledge of T2I diffusion models. We employ OMNIOUS.AI's commercial \\(^{5}\\) fashion attribute tagging annotator, which has been trained with over 1,000 different fashion attributes. The image annotator provides various feature categories present in a" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.406, + 0.841 + ], + "angle": 0, + "content": "5 https://omnicommerce.ai" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "21" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.207 + ], + "angle": 0, + "content": "given image, such as sleeve length and neckline type. We extract three different feature categories: sleeve length, neckline type, and item name, as illustrated in Fig. 9. Subsequently, we generate captions based on this feature information, for example, \"short sleeve off shoulder t-shirts\"." + }, + { + "type": "image", + "bbox": [ + 0.254, + 0.232, + 0.752, + 0.638 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.648, + 0.79, + 0.689 + ], + "angle": 0, + "content": "Fig. 10: Comparison between IDM-VTON and OOTDiffusion [55] on VITON-HD and DressCode dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.728, + 0.6, + 0.746 + ], + "angle": 0, + "content": "B Comparison with Concurrent Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.757, + 0.788, + 0.819 + ], + "angle": 0, + "content": "We additionally compare IDM-VTON with OOTDiffusion [55], which is a concurrent work on virtual try-on task. We compare each model trained on VITON-HD and DressCode datasets. We use publicly available model checkpoints for generating try-on images of OOTDiffusion6." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.517, + 0.84 + ], + "angle": 0, + "content": "\\(^{6}\\) https://github.com/levihsu/OOTDiffusion" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "22" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 5: Quantitative results of models trained on VITON-HD training dataset and evaluated on VITON-HD and DressCode (upper body) test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.207, + 0.778, + 0.285 + ], + "angle": 0, + "content": "
Train / TestVITON-HD / VITON-HDVITON-HD / DressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.1200.8466.390.8580.0870.90110.680.852
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.298, + 0.789, + 0.355 + ], + "angle": 0, + "content": "Table 6: Quantitative results of models trained on DressCode training dataset and evaluated on VITON-HD and DressCode test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.361, + 0.778, + 0.44 + ], + "angle": 0, + "content": "
Train / TestDressCode / DressCodeDressCode / VITON-HD
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.0880.8854.180.8510.2050.78857.870.677
IDM-VTON (ours)0.0720.9023.620.9130.1290.85912.570.839
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.467, + 0.789, + 0.572 + ], + "angle": 0, + "content": "Fig. 10 and Fig. 11 present qualitative comparisons of OOTDiffusion and ours on VITON-HD, DressCode and In-the-Wild dataset. As shown in Fig. 10, we see that IDM-VTON outperforms OOTDiffusion in capturing both high-level semantics and low-level details, and generating more authentic images. In particular, we observe notable improvements of IDM-VTON compared to OOTDiffusion on In-the-Wild dataset, which demonstrates the generalization ability of IDM-VTON." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.573, + 0.79, + 0.648 + ], + "angle": 0, + "content": "Tab. 5, Tab. 6 and Tab. 7 show quantitative comparisons between IDM-VTON and OOTDiffusion on VITON-HD, DressCode, and In-the-Wild datasets. One can notify that IDM-VTON outperforms OOTDiffusion on all metrics including image fidelity (FID), and reconstruction of garments (LPIPS, SSIM and CLIP-I), which verifies our claim." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "23" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.161, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 7: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with the concurrent work OOTDiffusion [55] on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP image similarity scores." + }, + { + "type": "table", + "bbox": [ + 0.346, + 0.21, + 0.654, + 0.268 + ], + "angle": 0, + "content": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
OOTDiffusion [55]0.2030.7520.861
IDM-VTON (ours)0.1640.7950.901
" + }, + { + "type": "image_caption", + "bbox": [ + 0.236, + 0.315, + 0.272, + 0.328 + ], + "angle": 0, + "content": "Input" + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.333, + 0.282, + 0.436 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.299, + 0.315, + 0.376, + 0.327 + ], + "angle": 0, + "content": "OOTDiffusion" + }, + { + "type": "image", + "bbox": [ + 0.288, + 0.333, + 0.388, + 0.435 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.395, + 0.315, + 0.493, + 0.327 + ], + "angle": 0, + "content": "IDM-VTON (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.394, + 0.333, + 0.495, + 0.436 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.522, + 0.316, + 0.551, + 0.327 + ], + "angle": 0, + "content": "Input" + }, + { + "type": "image_caption", + "bbox": [ + 0.582, + 0.315, + 0.656, + 0.327 + ], + "angle": 0, + "content": "OOTDiffusion" + }, + { + "type": "image", + "bbox": [ + 0.511, + 0.333, + 0.564, + 0.436 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.568, + 0.333, + 0.668, + 0.436 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.672, + 0.315, + 0.771, + 0.327 + ], + "angle": 0, + "content": "IDM-VTON (Ours)" + }, + { + "type": "image", + "bbox": [ + 0.672, + 0.333, + 0.774, + 0.436 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.438, + 0.281, + 0.542 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.29, + 0.438, + 0.388, + 0.541 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.395, + 0.438, + 0.494, + 0.541 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.511, + 0.438, + 0.564, + 0.542 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.568, + 0.438, + 0.668, + 0.542 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.673, + 0.438, + 0.774, + 0.542 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.544, + 0.282, + 0.648 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.288, + 0.544, + 0.388, + 0.647 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.395, + 0.544, + 0.494, + 0.647 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.512, + 0.544, + 0.564, + 0.648 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.569, + 0.544, + 0.668, + 0.647 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.673, + 0.545, + 0.774, + 0.647 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.229, + 0.65, + 0.282, + 0.753 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.288, + 0.65, + 0.388, + 0.753 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.395, + 0.65, + 0.494, + 0.753 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.512, + 0.65, + 0.564, + 0.753 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.568, + 0.65, + 0.668, + 0.753 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.673, + 0.65, + 0.774, + 0.753 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.764, + 0.788, + 0.819 + ], + "angle": 0, + "content": "Fig. 11: Comparison between IDM-VTON and OOTDiffusion [55] on In-the-Wild dataset. We provide visual comparison results on In-the-Wild dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "24" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.285, + 0.782, + 0.624 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.642, + 0.788, + 0.711 + ], + "angle": 0, + "content": "Fig. 12: Qualitative comparison on VITON-HD and DressCode dataset. As we observed in our quantitative analysis, GAN-based methods generally struggle to generate high-fidelity images introducing non-desirable distortions (e.g., non-realistic body and arms) while diffusion-based methods fail to capture low-level features or high-level semantics. All methods are trained on VITON-HD training data." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "25" + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.28, + 0.782, + 0.655 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.659, + 0.788, + 0.715 + ], + "angle": 0, + "content": "Fig. 13: Qualitative comparison on In-the-Wild dataset. While baselines fail to generate natural images or capture the details of clothing, IDM-VTON produces realistic images and preserves fine details effectively. All methods are trained on VITON-HD training data." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "26" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.183, + 0.773, + 0.76 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.769, + 0.787, + 0.797 + ], + "angle": 0, + "content": "Fig. 14: Try-on results on VITON-HD test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.785, + 0.128 + ], + "angle": 0, + "content": "27" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.183, + 0.77, + 0.759 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.769, + 0.788, + 0.798 + ], + "angle": 0, + "content": "Fig. 15: Try-on results on DressCode test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "28" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.365, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.182, + 0.774, + 0.761 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.769, + 0.787, + 0.797 + ], + "angle": 0, + "content": "Fig. 16: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Diffusion Models for Virtual Try-on" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.128 + ], + "angle": 0, + "content": "29" + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.182, + 0.773, + 0.759 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.769, + 0.788, + 0.798 + ], + "angle": 0, + "content": "Fig. 17: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "30" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.364, + 0.127 + ], + "angle": 0, + "content": "Y. Choi et al." + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.182, + 0.773, + 0.76 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.769, + 0.787, + 0.797 + ], + "angle": 0, + "content": "Fig. 18: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ] +] \ No newline at end of file diff --git a/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_origin.pdf b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..462042cc7e8b8513d0340874610f11275320a58a --- /dev/null +++ b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/c4be6fe3-34b2-402e-9968-2f0685e92b43_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b007c4862604fd2749f9c5e999301a8e23f97e7345da2b79c7239b22d9be02a1 +size 55466225 diff --git a/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/full.md b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/full.md new file mode 100644 index 0000000000000000000000000000000000000000..adc07318af55ddc310f0ecd845e86a3c3509ed1b --- /dev/null +++ b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/full.md @@ -0,0 +1,422 @@ +# Improving Diffusion Models for Authentic Virtual Try-on in the Wild + +Yisol Choi $^{1}$ , Sangkyung Kwak $^{1}$ , Kyungmin Lee $^{1}$ , Hyungwon Choi $^{2}$ , and Jinwoo Shin $^{1}$ + +$^{1}$ Korea Advanced Institute of Science and Technology (KAIST) {yisol.choi, skkwak9806, kyungmnlee, jinwoos}@kaist.ac.kr + +2 OMNIOUS.AI + +hyungwon.choi@omnious.com + +![](images/abfd15de2ab00ed8d9d65a429eceeab551e878ae35f1afff2f682480f7711793.jpg) +Fig. 1: Virtual try-on images generated by using our IDM-VTON on VITON-HD [3] (top row, first and second column), DressCode [32] (top row, third and fourth column), and collected In-the-Wild dataset (bottom row). Best viewed on a zoomed, color monitor. + +Abstract. This paper considers image-based virtual try-on, which renders an image of a person wearing a curated garment, given a pair of images depicting the person and the garment, respectively. Previous works adapt existing exemplar-based inpainting diffusion models for virtual try-on to improve the naturalness of the generated visuals compared to other methods (e.g., GAN-based), but they fail to preserve the identity of the garments. To overcome this limitation, we propose a novel diffusion model that improves garment fidelity and generates authentic virtual try-on images. Our method, coined $IDM - VTON$ , uses two different modules to encode the semantics of garment image; given the base UNet of the diffusion model, 1) the high-level semantics extracted from a visual encoder are fused to the cross-attention layer, and then 2) the low-level features extracted from parallel UNet are fused to the self-attention layer. In addition, we provide detailed textual prompts for both garment and person images to enhance the authenticity of the generated visuals. Finally, we present a customization method using a + +pair of person-garment images, which significantly improves fidelity and authenticity. Our experimental results show that our method outperforms previous approaches (both diffusion-based and GAN-based) in preserving garment details and generating authentic virtual try-on images, both qualitatively and quantitatively. Furthermore, the proposed customization method demonstrates its effectiveness in a real-world scenario. More visualizations are available in our project page. + +Keywords: Virtual Try-On $\cdot$ Diffusion Models + +# 1 Introduction + +Image-based virtual try-on (VTON) is an important computer vision task, where the goal is to render a visual of an arbitrary person dressing in a specific garment given by images. Due to its convenience and capability to provide a personalized shopping experience to E-commerce users, there is a considerable interest in synthesizing authentic virtual try-on images that exactly depict the garment given as input. The key challenges of VTON is to fit the garment to the human body of various poses or gestures, without creating any distortions in the patterns and textures in garment [12, 51]. + +The rapid progress in generative models [8, 14] has led the development of virtual try-on methods. Most of the primary approaches for image-based VTON are based on Generative Adversarial Networks [8, 22] (GANs), where they employ a separate warping module to deform the garment to the human body and use GAN generators to blend with the target person [3, 6, 7, 27, 29, 54]. However, such approaches struggle to generate high-quality images and often fail to generalize to different human images, introducing undesirable distortions to the garment. On the other hand, recently, diffusion models [14, 46] demonstrate superior performance in generating genuine images [30, 36, 39, 40] compared to GANs, showing the potential to overcome such challenges. Recent diffusion-based VTON methods [4, 9, 23, 28, 31, 35] utilize the rich generative prior of pretrained text-to-image (T2I) diffusion models [34, 40, 43] to enhance the naturalness of try-on images. To identify the details of garments, they encode the semantics of garments in pseudo-words [31] or use explicit warping networks [9]. However, those methods fall short in preserving the fine-grained details of garments, e.g., patterns, textures, shapes, or colors, which hinders its application to real-world scenarios. + +To overcome this limitation, this paper proposes an Improved Diffusion Models for Virtual Try-ON(IDM-VTON), which significantly enhances the consistency of the garment image, while generating authentic virtual try-on images. In specific, we design a new approach in conditioning garment images to the diffusion model by designing sophisticated attention modules, which consist of two different components: 1) the image prompt adapter that encodes the high-level semantics of the garment, and 2) the UNet encoder, which we refer to as GarmentNet, that extracts low-level features to preserve fine-grained details. In addition, we propose to customize our model using a single pair of garment and person images, which + +further improves the visual quality of virtual try-on images, particularly in the wild scenario. Last but not least, we show the importance of providing detailed captions for the garment image which helps retaining the prior knowledge of T2I diffusion models. + +We train our model on VITON-HD [3] training dataset, and demonstrate the effectiveness of our method by showing superior results on VITON-HD and DressCode [32] test datasets both qualitatively and quantitatively. Furthermore, to simulate the real-world virtual try-on application, we have collected In-the-Wild dataset, which contains garments with intricate patterns and human images with various poses and gestures, that is largely different from the training data. Our method outperforms other methods on In-the-Wild dataset, and in particular, customizing our model notably enhances retaining the identity of the garment while generating authentic try-on images. + +# 2 Related Works + +Image-based virtual try-on. Given a pair of images depicting a target person and a garment, the image-based virtual try-on aims to generate a look of the target person dressing the given garment. A line of works [3,6,7,27,29,54] is based on Generative Adversarial Networks (GANs) [8], where they first deform the garment to the person body shape, and then use the generator to put the deformed garment on the person image. While many works have attempted to reduce the mismatch between the warped garment and the person [3,7,21,27], those approaches lack generalization to arbitrary person images, e.g., with complex backgrounds or intricate poses. + +As diffusion models have shown great success [14, 47], recent works have studied the application of diffusion models for virtual try-on. TryOnDiffusion [61] proposed an architecture that uses two parallel UNets, and showed the capability of diffusion-based virtual try-on by training on the large-scale dataset. Subsequent works considered virtual try-on as an exemplar-based image inpainting problem [56]. They fine-tuned the inpainting diffusion models on virtual try-on dataset [9, 23, 31] to generate high-quality virtual try-on images. However, those methods still suffer from preserving meticulous details of garments, dampening their applications to real-world scenarios. + +Adding conditional control to diffusion models. While text-to-image (T2I) diffusion models [34,40,43] have shown their capability in generating high-quality images from text prompts, the inaccuracy of natural language lacks fine-grained control in image synthesis. To this end, various works have proposed to add conditional control to T2I diffusion models [33,57,58,60]. ControlNet [58] and T2I-Adapter [33] proposed to fine-tune extra modules that encode spatial information such as edges, depth, and human pose, to control the diffusion model together with text prompts. Image prompt adapter (IP-Adapter) [57] proposed to condition T2I diffusion models with high-level semantics of reference image to control image generation with both textual and visual prompts. + +Customizing diffusion models. Several works have demonstrated the potential of customizing diffusion models with few personal images [5,11,25,42,45]. Together with parameter efficient fine-tuning methods [16,17] and regularized fine-tuning objective [26], T2I diffusion models can be adapted to unseen examples without catastrophic forgetting. Also, many works have studied the customization of diffusion models for various tasks such as masked image completion [48] or image restoration [2]. In this paper, we first present a customization of diffusion models for virtual try-on, where we show it significantly improves the adaptation to real-world scenarios. + +# 3 Method + +# 3.1 Backgrounds on Diffusion Models + +Diffusion models [14, 44] are generative models that consist of a forward process, which gradually adds Gaussian noise to the data, and a reverse process that gradually denoises a random noise to generate a sample. Suppose $\mathbf{x}_0$ be a data point (e.g., an image or a latent from the output of autoencoder [40]). Given noise schedules $\{\alpha_t\}_{t=1}^T, \{\sigma_t\}_{t=1}^T$ for $t = 1, \dots, T$ , the forward process at timestep $t$ is given by $\mathbf{x}_t = \alpha_t \mathbf{x}_0 + \sigma_t \boldsymbol{\epsilon}$ , where $\boldsymbol{\epsilon} \sim \mathcal{N}(\mathbf{0}, \mathbf{I})$ is a Gaussian noise. For sufficiently large $\sigma_T$ , $\mathbf{x}_T \sim \mathcal{N}(\alpha_T \mathbf{x}_0, \sigma_T^2 \mathbf{I})$ is indiscernible from pure random Gaussian noise. Then the reverse generative process initializes from $\mathbf{x}_T \sim \mathcal{N}(\mathbf{0}, \sigma_T^2 \mathbf{I})$ , and sequentially denoises $\mathbf{x}_t$ into $\mathbf{x}_{t-1}$ for each $t$ , so that $\mathbf{x}_0$ is distributed according to the data distribution. + +Text-to-image (T2I) diffusion models. T2I diffusion models [34, 40, 43] are diffusion models that model the distribution of image conditioned on text, which is encoded by embeddings using the pretrained text encoders (e.g., T5 [38] and CLIP [37] text encoder). While convolutional UNet [41] architecture has been developed for diffusion-based generative models [14, 47], recent works have shown the promise of fusing transformer [50] architectures for UNet. Training a diffusion model is shown to be equivalent to learning a score function of a perturbed data distribution (i.e., denoising score matching [19]), where it is often done by $\epsilon$ -noise prediction loss [14]. Formally, given data $\mathbf{x}_0$ and text embedding $\mathbf{c}$ , the training loss for the T2I diffusion model is given as follows: + +$$ +\mathcal {L} _ {\mathrm {D M}} (\theta) = \mathbb {E} _ {\epsilon \sim \mathcal {N} (\mathbf {0}, \mathbf {I}), t \sim \mathcal {U} [ 0, T ]} \left[ \omega (t) \| \epsilon_ {\theta} (\mathbf {x} _ {t}; \mathbf {c}, t) - \epsilon \| _ {2} ^ {2} \right], \tag {1} +$$ + +where $\mathbf{x}_t = \alpha_t\mathbf{x}_0 + \sigma_t\pmb{\epsilon}$ is a forward process of $\mathbf{x}_0$ and $\omega (t)$ is a weighting function at each timestep $t$ . To achieve better controllability over text conditioning, it uses classifier-free guidance (CFG) [15], which jointly learns unconditional and conditional. At the training stage, the text conditioning is randomly dropped out (i.e., giving null-text to the input), and at the inference stage, the CFG interpolates the conditional and unconditional noise output to control the strength of text conditioning: + +$$ +\hat {\epsilon} _ {\theta} (\mathbf {x} _ {t}; \mathbf {c}, t) = s \cdot \left(\boldsymbol {\epsilon} _ {\theta} (\mathbf {x} _ {t}; \mathbf {c}, t) - \boldsymbol {\epsilon} _ {\theta} (\mathbf {x} _ {t}; t)\right) + \boldsymbol {\epsilon} _ {\theta} (\mathbf {x} _ {t}; t), \tag {2} +$$ + +![](images/d620a900c4da094aa6b9a4ed9e4e5b1d3c3a5be61658f894fa3c11769afe0278.jpg) +Fig. 2: Overview of IDM-VTON. We demonstrate the proposed model architecture and details on the attention modules. (Left) Our model consists of 1) TryonNet which is a main UNet that processes person image, 2) image prompt adapter (IP-Adapter) [57] that encodes high-level semantics of garment image $\mathbf{x}_g$ , and 3) GarmentNet that encodes low-level features of $\mathbf{x}_g$ . As of input for UNet, we concatenate the noised latents $\mathbf{x}_t$ of latents $\mathcal{E}(\mathbf{x}_p)$ with the segmentation mask $\mathbf{m}$ , masked image $\mathcal{E}(\mathbf{x}_m)$ , and Densepose [10] $\mathcal{E}(\mathbf{x}_{\mathrm{pose}})$ . We provide a detailed caption to the garment (e.g., [V]: "short sleeve round neck t-shirts"). Then it is used for input prompt of GarmentNet (e.g., "A photo of [V]") and TryonNet (e.g., "Model is wearing [V]"). (Right) The intermediate features of TryonNet and GarmentNet are concatenated and passed to the self-attention layer, and we use the first half (i.e., that from TryonNet) of the output. Then we fuse the output with features from text encoder and IP-Adapter by cross-attention layer. We fine-tune the TryonNet and the IP-Adapter modules, and freeze other components. + +![](images/7b7d885214474cf2dbe1a29ebd18ba600d64d06b5221901907774096ef6d1618.jpg) + +where $s \geqslant 1$ is a guidance scale that controls the text conditioning, and $\epsilon_{\theta}(\mathbf{x}_t; t)$ denotes the noise prediction with null-text embeddings. + +Image prompt adapter [57]. To condition the T2I diffusion model with a reference image, Ye et al. [57] proposed Image Prompt Adapter (IP-Adapter), which leverages the features extracted from image encoder (e.g., CLIP [37] image encoder) and attaches additional cross-attention layer to the text conditioning [40]. Let us denote $Q \in \mathbb{R}^{N \times d}$ be the query matrices from the intermediate representation of UNet, and $K_{c} \in \mathbb{R}^{N \times d}$ , $V_{c} \in \mathbb{R}^{N \times d}$ be the key and value matrices from the text embeddings $\mathbf{c}$ , where $N$ is number of samples. The output of cross-attention layer is given by $\text{Attention}(Q, K_{c}, V_{c}) = \text{softmax}\left(\frac{Q K_{c}^{\top}}{\sqrt{d}}\right) \cdot V_{c}$ . Then IP-Adapter computes key and value matrices $K_{i} \in \mathbb{R}^{N \times d}$ , $V_{i} \in \mathbb{R}^{N \times d}$ from the image embeddings $\mathbf{i}$ , and inserts the cross-attention layer as follows: + +$$ +\operatorname {A t t e n t i o n} \left(Q, K _ {c}, V _ {c}\right) + \operatorname {A t t e n t i o n} \left(Q, K _ {i}, V _ {i}\right). \tag {3} +$$ + +Overall, the IP-Adapter freezes the original UNet, and fine-tunes only the (linear) projection layers of key and value matrices of image embeddings $K_{i}$ and $V_{i}$ , and the linear projection layer that maps CLIP image embeddings. + +# 3.2 Proposed Method + +Now, we present our method for designing diffusion models for virtual try-on. Let us denote $\mathbf{x}_p$ be the image of a person, and $\mathbf{x}_g$ be the image of a garment. Our primary goal is to generate an image $\mathbf{x}_{\mathrm{tr}}$ that visualizes a person from $\mathbf{x}_p$ wearing a garment in image $\mathbf{x}_g$ . It is common practice to cast virtual try-on as an exemplar-based image inpainting problem [56], which aims to fill the masked image with a reference image. Here, it is important to extract relevant information of garment, and add conditional control to the diffusion model. To this end, our model is composed of three components; 1) the base UNet (TryonNet) that processes the masked person image with its pose information, 2) the image prompt adapter (IP-Adapter) that extracts the high-level semantics of the garment, and 3) the garment UNet feature encoder (GarmentNet) that extracts the low-level features of the garment. The features from GarmentNet are fused within self-attention layer of TryonNet, and then it is processed with the features of IP-Adapter through cross-attention layer. We provide an overview of our method in Fig. 2, and provide detailed explanation of each component as follows. + +TryonNet. For the base UNet model, we consider latent diffusion model [40], where the diffusion generative modeling is conducted in latent space of variational autoencoder $\mathcal{E}$ and the output is passed to decoder $\mathcal{D}$ to generate an image. As of the input for our base UNet, we concatenate four components as follows: 1) the latent of person image, i.e., $\mathcal{E}(\mathbf{x}_p)$ , 2) the (resized) mask $\mathbf{m}$ that removes the garment on the person image, 3) the latent of masked-out person image $\mathbf{x}_m = (1 - \mathbf{m})\odot \mathbf{x}_p$ , i.e., $\mathcal{E}(\mathbf{x}_m)$ , following [3], and 4) the latent of the Densepose [10] $\mathbf{x}_{\mathrm{pose}}$ of a person image, i.e., $\mathcal{E}(\mathbf{x}_{\mathrm{pose}})$ . Then, the latents are aligned within the channel axis, where we expand the convolutional layer of UNet to 13 channels initialized with zero weights. Unlike previous works on virtual try-on with diffusion models [9, 23, 31], we leverage Stable Diffusion XL (SDXL) [36] inpainting model [49]. + +Image prompt adapter. To condition the high-level semantics of a garment image, we leverage image prompt adapter (IP-Adapter) [57]. To encode the garment image, we use frozen CLIP image encoder (i.e., OpenCLIP [20] ViT-H/14) to extract feature and fine-tune feature projection layers and cross-attention layers, which are initialized with pretrained IP-Adapters. Note that we pass textual prompts of garments, and the cross-attention is computed as in Eq. (3). + +GarmentNet. While we already condition the garment image using IP-Adapter, it falls short in preserving the fine-grained details of garments when it has complicated patterns or graphic prints (e.g., see Fig. 6). This is because the CLIP image encoder lacks extracting the low-level features of a garment. To tackle this issue, we propose to utilize an additional UNet encoder (i.e., garment UNet encoder) to encode fine-details of garment images. Given the latent of a garment image $\mathcal{E}(\mathbf{x}_g)$ , we pass through the (frozen) pretrained UNet encoder to obtain the intermediate representation, and concatenate with the intermediate representation + +![](images/6e8d6da3b9d870e602c0c23787fc94d6cd1ed5ce8818d0c6301ffe14f391505c.jpg) +(a) Public Dataset +Fig. 3: Comparisons between datasets used in our experiments. For evaluation, we test on (a) public dataset, including VITON-HD [3] and DressCode [32], and (b) In-the-Wild dataset, which we internally collected from real E-commerce setup. We remark that the In-the-Wild dataset contains more intricate patterns and logos in garment image, and diverse backgrounds, and poses in person image. + +![](images/39541a79f2de27f6a0173201049a5b13bc1c49922698891fccdfc8cffdd8c3b1.jpg) + +![](images/a9f04d91b11214fde43bb0685a3bb70a981d18cb343db65bcd9f1c21ee2166c5.jpg) +(b) In-the-wild Dataset + +from the TryonNet. Then we compute the self-attention on the concatenated features and then pass only the first-half dimensions from TryonNet. We use UNet of SDXL [36] for our GarmentNet, which helps utilizing the rich generative prior of the pretrained text-to-image diffusion model, and complements the low-level feature that is often ignored in the cross-attention layer of IP-Adapter. Remark that a similar approach was introduced in [18], which used a similar attention mechanism in preserving consistency for video generation. + +Detailed captioning of garments. While the majority of diffusion-based virtual try-on models leverage pretrained text-to-image diffusion models, they do not take the text prompts as input [9,23] or use a naive text prompts [31] such as "upper garment" for any garment image. To fully exploit the rich generative prior of the text-to-image diffusion model, we provide a comprehensive caption [26] that describes the detail of a garment, such as shapes or textures. As shown in Fig. 2, we provide a comprehensive caption to the garment image (e.g., "short sleeve round neck t-shirts") and pass it to both GarmentNet (i.e., "a photo of short sleeve round neck t-shirts") and the TryonNet (i.e., "model is wearing short sleeve round neck t-shirts"). This helps the model to encode the high-level semantics of the garment using natural language, and complements the image-based conditioning (e.g., see Fig. 7). In practice, we utilize an image annotator for fashion images, and manually provide captioning with templates (see Appendix for details). + +Customization of IDM-VTON. While our model is able to capture the fine-details of garments, it often struggles when the person image $\mathbf{x}_p$ or the garment image $\mathbf{x}_g$ is different from training distribution (e.g., see Fig. 3). To this end, inspired by text-to-image personalization methods [2, 42, 48], we propose an effective customization of IDM-VTON by fine-tuning TryonNet with a pair + +![](images/ddf3685e761b5a6cd6d8d1401282f3fe3f97b19d42434be2eab0243047fc5236.jpg) +(a) VITON-HD + +![](images/6eebb2319360838aa18b0fc6bb380fe83406d1c02b3c07265f403e582a6b86ea.jpg) + +![](images/6727e93151ac07107238ec45c10823d14c5665d24dae781b38b90096218e93ff.jpg) +(b) DressCode (upper body) +Fig. 4: Qualitative results on VITON-HD and DressCode dataset. We show generated virtual try-on images using IDM-VTON (ours) compared with other methods on (a) VITON-HD [3], and (b) DressCode (upper body) [32] test datasets. We see that IDM-VTON outperforms others in generating authentic images and preserving fine-grained details of garment. Best viewed in zoomed, color monitor. + +of garment and person images. It is straightforward to fine-tune IDM-VTON when we have a pair of images $\mathbf{x}_p$ and $\mathbf{x}_g$ , where the person in $\mathbf{x}_p$ is wearing the garment in $\mathbf{x}_g$ . On the other hand, if we only have $\mathbf{x}_p$ , we segment the garment and white-out backgrounds to obtain $\mathbf{x}_g$ . Remark that we fine-tune only the attention layers of the up-blocks (i.e., decoder layers) of TryonNet, which empirically works well (e.g., see Table 4). + +# 4 Experiment + +# 4.1 Experimental Setup + +Implementation details. We use SDXL inpainting model [49] for our TryonNet, pretrained IP-Adapter [57] for image adapter and UNet of SDXL [36] for our GarmentNet. We train our model using VITON-HD [3] train dataset, which + +Table 1: Quantitative results on VITON-HD dataset. We evaluate the reconstruction scores (e.g., LPIPS, SSIM) for low-level similarity, CLIP image similarity score (CLIP-I) for high-level semantic similarity, and FID score for image fidelity. We compare with GAN-based virtual try-on methods (e.g., HR-VTON and GP-VTON), and Diffusion-based virtual try-on methods (e.g., LaDI-VTON, DCI-VTON, StableVITON). Bold denotes the best score for each metric. + +
DatasetVITON-HDDressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
GAN-based methods
HR-VITON [27]0.1150.8839.700.8320.1120.91021.420.771
GP-VTON [54]0.1050.8986.430.8740.4840.78055.210.628
Diffusion-based methods
LaDI-VTON [31]0.1560.8728.850.8340.1490.90516.540.803
DCI-VTON [9]0.1660.8568.730.8400.1620.89317.630.777
StableVITON [23]0.1330.8856.520.8710.1070.91014.370.866
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
+ +contains 11,647 person-garment image pairs at $1024 \times 768$ resolution. We train our model using Adam [24] optimizer with batch size of 24 and learning rate of 1e-5 for 130 epochs. For customization, we fine-tune our model using Adam optimizer with learning rate 1e-6 for 100 steps. + +Evaluation dataset. We evaluate our model on public VITON-HD [3] and DressCode [32] test datasets. Furthermore, we internally collected In-the-Wild dataset, which is crawled from the web to assess the generalization of model to the real-world scenario. While VITON-HD and DressCode contain person images of simple poses and solid backgrounds, our In-the-Wild dataset has person images of various poses and gestures with complex backgrounds. Also, the garments are of various patterns and logos, making virtual try-on more challenging than VITON-HD and DressCode (e.g., see Fig. 3). Furthermore, In-the-Wild dataset contains multiple person images per garment, so it is possible to evaluate the results when we customize our network with each garment. Specifically, it consists of 62 images of upper garments and 312 images of people wearing those garments, where there are 4-6 images of person wearing the same garment. To conduct customization experiment, we select one person image for each garment, and use the left 250 person images for evaluation. + +Baselines. We compare our method with GAN-based methods (HR-VITON [27] and GP-VTON [54]), and diffusion-based methods (LaDI-VTON [31], DCI-VTON [9], and StableVITON [23]). HR-VITON and GP-VTON have a separate warping module to estimate the fitted garment on the target person, generating try-on images with GAN using the garment as input. LaDI-VTON, DCI-VTON, and StableVITON are most relevant baselines of ours, where they also utilize + +![](images/597cf9b7a066a184d3d1e0db3dc35c21dd789038486211aead36d6ad61f8e2f5.jpg) +Fig. 5: Qualitative comparisons on In-the-Wild dataset. We show generated virtual try-on images on In-the-Wild dataset using IDM-VTON (ours) compared with other methods. IDM-VTON outperforms other methods in generating authentic images and preserving fine-grained details of garment. In particular, customizing IDM-VTON, (i.e., IDM-VTON $\ddagger$ ), significantly enhances the image quality and garment fidelity. When applying customization on StableVITON, (i.e., StableVITON $\ddagger$ ), the improvements are marginal compared to ours. Best viewed in zoomed, color monitor. + +pretrained Stable Diffusion (SD). In specific, LaDI-VTON and DCI-VTON employ separate warping modules to condition the garment, while StableVITON utilizes the SD Encoder for garment conditioning. We use the pretrained checkpoints provided in their official repositories to generate images. For a fair comparison, we generate images of resolution $1024 \times 768$ images if available, otherwise generate images of resolution $512 \times 384$ and upscale to $1024 \times 768$ using various methods, e.g., interpolation or super resolution [52], and report the best one. + +Evaluation metrics. For quantitative evaluation, we measure low-level reconstruction scores such as LPIPS [59] and SSIM [53], and high-level image similarity using CLIP [37] image similarity score. To evaluate the authenticity of generated images, we compute Frenchet Inception Distance (FID) [13] score on VITON-HD and DressCode test dataset. + +Table 2: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with other methods on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP [37] image similarity scores. For IDM-VTON and StableVITON [23], we further customize models using a single pair of person-garment images (denoted by $\ddagger$ ). We see that IDM-VTON outperforms other methods, and customized IDM-VTON (i.e., IDM-VTON $\ddagger$ ) performs the best. + +
MethodLPIPS ↓SSIM ↑CLIP-I ↑
HR-VITON [27]0.3300.7410.701
LaDI-VTON [31]0.3030.7680.819
DCI-VTON [9]0.2830.7350.752
Stable-VITON [23]0.2600.7360.836
IDM-VTON (ours)0.1640.7950.901
Stable-VITON‡ [23]0.2590.7330.858
IDM-VTON‡ (ours)0.1500.7970.909
+ +# 4.2 Results on Public Dataset + +Qualitative results. Fig. 4 shows the visual comparisons of IDM-VTON with other methods on VITON-HD and DressCode test datasets. We see that IDM-VTON preserves both low-level details and high-level semantics, while others struggle to capture. While GAN-based methods (i.e., HR-VITON and GP-VTON) show comparable performance in capturing fine details of garment, they fall shorts in generating natural human images compared to diffusion-based methods. On the other hand, prior diffusion-based methods (i.e., LaDI-VTON, DCI-VTON, and StableVITON) fail to preserve the details of garments (e.g., the off-shoulder t-shirts in first row, or the details of sweatshirts in second row of VITON-HD dataset). Also, we observe that IDM-VTON significantly outperforms other methods in generalization to the DressCode dataset. Especially, GAN-based methods show inferior performance on the DressCode dataset, showing its poor generalization ability. While prior diffusion-based methods show better images in generating natural images than GAN-based, the generated images show lower consistency with respect to given garment image compared to IDM-VTON. + +Quantitative results. Tab. 1 shows the quantitative comparisons between IDM-VTON (ours) and other methods on VITON-HD and DressCode test datasets. When compared to GAN-based methods, we observe that IDM-VTON shows comparable performance in reconstruction scores (LPIPS and SSIM) and outperforms in FID and CLIP image similarity score on VITON-HD test dataset. However, the performance of GAN-based methods significantly degrades when tested on DressCode dataset, which we have observed in Fig. 4. We see that IDM-VTON consistently outperforms prior diffusion-based methods in both VITON-HD and DressCode dataset. + +![](images/c9902a59ff939fd8f08487b143cf24d8c90917b896d467210e1e3ca3994ca787.jpg) +Fig. 6: Effect of GarmentNet. We compare the generated virtual try-on images without using GarmentNet (left) and together with GarmentNet (right). We observe that using GarmentNet significantly improves retaining the fine-grained details of garment (e.g., the graphics in the t-shirts). + +![](images/40dabe3822f406f8fb03e68a2c3665c9fd39f119f9b11297488da8081c2ce365.jpg) + +![](images/5d005e6dd1234734d6ade31afe0afc2fb6067c72781ec1b4d25d905be95298e6.jpg) + +![](images/85a0e18a24263c5bb50a6eb3f6098441fc864ccb2ad520a0295454b172802efb.jpg) + +![](images/f72842b6491eb4183ba09c0c1e0acb8355d868833c067bdb59d97767abc3954d.jpg) + +# 4.3 Results on In-the-Wild Dataset + +Here, we evaluate our methods on challenging In-the-Wild dataset, where we compare with other diffusion-based VTON methods. In addition, we show the results of customization using a single pair of garment-person images. We also test customization on StableVITON [23]. + +Qualitative results. Fig. 5 shows the qualitative results of IDM-VTON (ours) compared to other baselines3. We see that IDM-VTON generates more authentic images than LaDI-VTON, DCI-VTON, and StableVITON, yet it struggles to preserve the intricate patterns of garments. By customizing IDM-VTON, we obtain virtual try-on images with a high degree of consistency to the garment (e.g., the logos and the text renderings), but we find the customization does not work well for StableVITON. + +Quantitative results. Tab. 2 reports the quantitative comparisons between our IDM-VTON and other methods. We also provide comparisons between IDM-VTON and StableVITON using customization (i.e., IDM-VTON $\ddagger$ and StableVITON $\ddagger$ ). We see that IDM-VTON outperforms other methods on all metrics, even outperforming StableVITON with customization. Furthermore, we observe that IDM-VTON with customization significantly outperforms others, showing its generalization capability. + +# 4.4 Ablative Studies + +Effect of GarmentNet. We conduct an ablation study on the effect of GarmentNet in preserving the fine-grained details of a garment. For comparison, we train another model without using GarmentNet (i.e., using only IP-Adapter to encode garment image). The qualitative results are in Fig. 6. While training with only IP-Adapter is able to generate authentic virtual try-on images that are + +![](images/959d884610d5549acfe06abf2a760627192536327f5d19d7a5e0a24aa086ddcc.jpg) +Input + +![](images/9d0705dc6b23fe725e69e73721d064ef4ecd89625a9dc14cb5779a1daf36cd17.jpg) +"upper garment" + +![](images/f393137cdb9173a4581e36f49e1e9fc24b0086b27d77d565884a8ebfeee97c88.jpg) +"round neck short sleeve blouse" +Fig. 7: Effect of detailed caption for garment. We compare the generated virtual try-on images using naive captions (left) and detailed captions (right). The model trained with detailed captions generates images that are more consistent with the garment. Best viewed in zoomed, color monitor. + +![](images/41c857d0ae368e62f1b328411c005312ba2fde4200fa24d4c01832393e3ea814.jpg) +Input + +![](images/1f83a3f06ee7e7aee23412bc57f3a1802554ef0da9d049f1648881347dc0fc5b.jpg) +"upper garment" + +![](images/c7c5fbf57e36553dce21c4e3e1d276e44c7b2efb1dd48cedb84ec12f06409649.jpg) +"sleeveless square neck tube top" + +
GarmentNetLPIPS ↓SSIM ↑CLIP-I ↑
X0.1210.8490.846
✓0.1020.8700.883
+ +Table 3: Ablation on GarmentNet. Table 4: Ablation on customization. We ablate the effect of using GarmentNet We compare default IDM-VTON with by comparing LPIPS, SSIM, and CLIP different customization methods by fineimage similarity scores on the VITON-HD tuning all UNet layers, LoRA [17] layers, test dataset. or up-block layers (Decoder). + +
MethodLPIPS ↓SSIM ↑CLIP-I ↑
Default0.16420.7950.901
All UNet0.15120.7970.891
LoRA0.15730.7940.881
Decoder0.15020.7970.909
+ +semantically consistent with the garment images, we see that using GarmentNet significantly improves preserving the identity of the garment (e.g., the graphics of t-shirts). In addition, we conduct a quantitative evaluation on VITON-HD test dataset by measuring LPIPS, SSIM and CLIP image similarity score. In Tab. 3, we see that using GarmentNet quantitatively improves reconstruction scores, as well as image similarity scores, which is aligned with our qualitative results. + +Effect of detailed caption. To validate the effectiveness of detailed captioning on garments, we train an identical model to IDM-VTON except that using naive caption [31], and compare with IDM-VTON. In specific, naive caption provides an unified descriptions of all upper garments (e.g., "model is wearing an upper garment"), while our detailed captions provide specific descriptions of each garment. Fig. 7 shows generated virtual try-on images using each model trained with naive caption (left) and detailed captions (right). We observe that the model trained with detailed captions generates images with higher consistency to the garment (e.g., meshes around the neck and arms). Thus, the usage of detailed captions complements the potential inaccuracy of image-based virtual try-on by exploiting the generative prior of text-to-image diffusion model. + +Ablation on customization. During customization, we fine-tune the up-blocks of TryonNet (i.e., decoder layers). Here, we provide an ablation study on the choice of fine-tuning layer for customization. We compare default IDM-VTON (i.e., no customization), fine-tuning all UNet layers, using low rank adaptation (LoRA) [17], and fine-tuning decoder layers. In Tab. 4, we see that all customization methods improve reconstruction score (LPIPS, SSIM) compared to default IDM-VTON, while showing comparable performance in CLIP image similarity score. We see that fine-tuning decoder layers perform the best among customization methods, while fine-tuning all UNet layers shows comparable performance. While finetuning with LoRA is more efficient, we find it underperforms than fine-tuning decoder layers. + +# 5 Conclusion + +In this paper, we present IDM-VTON, a novel design of diffusion models for authentic virtual try-on, particularly in the wild scenario. We incorporate two separate modules to encode the garment image, i.e., visual encoder and parallel UNet, which effectively encode high-level semantics and low-level features to the base UNet, respectively. In order to improve the virtual try-on on real world scenario, we propose to customize our model by fine-tuning the decoder layers of UNet given a pair of garment-person images. We also leverage detailed natural language descriptions for garments, which help generating authentic virtual try-on images. Extensive experiments on various datasets show the superiority of our method over prior works in both preserving details of garment, and generating high fidelity images. In particular, we demonstrate the potential of our method in virtual try-on in the wild. + +Potential negative impact. The virtual try-on technology comes with benefits and pitfalls - the tool could be helpful for users to effectively visualize their look with given garment. However, it requires the users to be responsible for protecting the ownership, and avoid malicious use. + +Limitation. IDM-VTON struggles to preserve human attributes on masked regions such as tattoos or skin moles. One can design a method for conditioning those human attributes of when generating try-on images. Also, while we exploit the prior knowledge of T2I diffusion models by providing comprehensive captions, exploring broader applications to fully utilize the prior, such as controlling garment generation through textual prompts, is left as future work. + +# Acknowledgement + +This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00075 Artificial Intelligence Graduate School Program(KAIST); No.RS-2021-II212068, Artificial Intelligence Innovation Hub). + +# References + +1. Avrahami, O., Hayes, T., Gafni, O., Gupta, S., Taigman, Y., Parikh, D., Lischinski, D., Fried, O., Yin, X.: Spatext: Spatio-textual representation for controllable image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18370-18380 (2023) 20 +2. Chari, P., Ma, S., Ostashev, D., Kadambi, A., Krishnan, G., Wang, J., Aberman, K.: Personalized restoration via dual-pivot tuning. arXiv preprint arXiv:2312.17234 (2023) 4, 7 +3. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14131-14140 (2021) 1, 2, 3, 6, 7, 8, 9 +4. Cui, A., Mahajan, J., Shah, V., Gomathinayagam, P., Lazebnik, S.: Street tryon: Learning in-the-wild virtual try-on from unpaired person images. arXiv preprint arXiv:2311.16094 (2023) 2 +5. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022) 4 +6. Ge, C., Song, Y., Ge, Y., Yang, H., Liu, W., Luo, P.: Disentangled cycle consistency for highly-realistic virtual try-on. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16928-16937 (2021) 2, 3 +7. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8485-8493 (2021) 2, 3 +8. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139-144 (2020) 2, 3 +9. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: Proceedings of the 31st ACM International Conference on Multimedia. pp. 7599-7607 (2023) 2, 3, 6, 7, 9, 11 +0. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7297-7306 (2018) 5, 6 +1. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. arXiv preprint arXiv:2303.11305 (2023) 4 +2. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7543-7552 (2018) 2 +3. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 10 +4. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020) 2, 3, 4 +5. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 4, 20 +6. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: International Conference on Machine Learning. pp. 2790-2799. PMLR (2019) 4 + +17. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021) 4, 13, 14 +18. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023) 7 +19. Hyvarinen, A., Dayan, P.: Estimation of non-normalized statistical models by score matching. Journal of Machine Learning Research 6(4) (2005) 4 +20. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below. 6 +21. Issenhuth, T., Mary, J., Calauzenes, C.: Do not mask what you do not need to mask: a parser-free virtual try-on. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 619-635. Springer (2020) 3 +22. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4401-4410 (2019) 2 +23. Kim, J., Gu, G., Park, M., Park, S., Choo, J.: Stableviton: Learning semantic correspondence with latent diffusion model for virtual try-on. arXiv preprint arXiv:2312.01725 (2023) 2, 3, 6, 7, 9, 11, 12, 20 +24. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 9, 20 +25. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023) 4 +26. Lee, K., Kwak, S., Sohn, K., Shin, J.: Direct consistency optimization for compositional text-to-image personalization. arXiv preprint arXiv:2402.12004 (2024) 4, 7 +27. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: European Conference on Computer Vision. pp. 204-219. Springer (2022) 2, 3, 9, 11 +28. Li, N., Liu, Q., Singh, K.K., Wang, Y., Zhang, J., Plummer, B.A., Lin, Z.: Unihuman: A unified model for editing human images in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2039-2048 (2024) 2 +29. Men, Y., Mao, Y., Jiang, Y., Ma, W.Y., Lian, Z.: Controllable person image synthesis with attribute-decomposed gan. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5084-5093 (2020) 2, 3 +30. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021) 2 +31. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladivton: Latent diffusion textual-inversion enhanced virtual try-on. arXiv preprint arXiv:2305.13501 (2023) 2, 3, 6, 7, 9, 11, 13 +32. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2231-2235 (2022) 1, 3, 7, 8, 9 + +33. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023) 3 +34. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021) 2, 3, 4 +35. Ning, S., Wang, D., Qin, Y., Jin, Z., Wang, B., Han, X.: Picture: Photorealistic virtual try-on from unconstrained designs. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6976-6985 (2024) 2 +36. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023) 2, 6, 7, 8 +37. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 4, 5, 10, 11 +38. Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., Liu, P.J.: Exploring the limits of transfer learning with a unified text-to-text transformer. The Journal of Machine Learning Research 21(1), 5485-5551 (2020) 4 +39. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) 2 +40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) 2, 3, 4, 5, 6 +41. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) 4 +42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023) 4, 7 +43. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) 2, 3, 4 +44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015) 4 +45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., et al.: Styledrop: Text-to-image generation in any style. arXiv preprint arXiv:2306.00983 (2023) 4 +46. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) 2 +47. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020) 3, 4 + +48. Tang, L., Ruiz, N., Chu, Q., Li, Y., Holynski, A., Jacobs, D.E., Hariharan, B., Pritch, Y., Wadhwa, N., Aberman, K., et al.: Realfill: Reference-driven generation for authentic image completion. arXiv preprint arXiv:2309.16668 (2023) 4, 7 +49. team, D.: Stable diffusion xl inpainting. link (2023) 6, 8 +50. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) 4 +51. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: Proceedings of the European conference on computer vision (ECCV). pp. 589-604 (2018) 2 +52. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind superresolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021) 10 +53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 10 +54. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23550-23559 (2023) 2, 3, 9 +55. Xu, Y., Gu, T., Chen, W., Chen, C.: Ootdiffusion: Outfitting fusion based latent diffusion for controllable virtual try-on. arXiv preprint arXiv:2403.01779 (2024) 21, 22, 23 +56. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18381-18391 (2023) 3, 6 +57. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. arXiv preprint arXiv:2308.06721 (2023) 3, 5, 6, 8 +58. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 3 +59. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018) 10 +60. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unictrlnet: All-in-one control to text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024) 3 +61. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4606-4615 (2023) 3 + +# Appendix + +# A Implementation Details + +# A.1 In-the-Wild Dataset + +![](images/38070a8c94a34774734298a924b509fb64649ab55c572c7a939ca65b861fb55d.jpg) + +![](images/7b1d725fc7bb03b447ac12b05d7a0c04573d8320569962bd0197c860b5dab1ee.jpg) + +![](images/9e15a2e00988885208cf68111574899f4fd1cb48d23a8ddef3768585a73aa02e.jpg) + +![](images/2f9f62fc74cf4866ec3631d5f32b9e2c6e1f4b48fc0010403554cb29119c4974.jpg) + +![](images/232dc48ebf557d5e59aca56ee316f4a1ab873a31e888cde202a0aac167022ae4.jpg) + +![](images/c78aa6fdfdaa4fe5b80c8bc82cd538126ffedf889e52bce128abeb0b39bd3cb6.jpg) + +![](images/161f9af84c21dd93983d2a31a21e1235c9f627356816332c365099dad518a881.jpg) +Fig. 8: Examples of In-the-Wild dataset. We collect pairs of garment and human wearing the garment. + +![](images/baecaed37477b1db1eb2183107d39af17bc7e0be9a9671134b40960c0ec98e1d.jpg) + +In-the-Wild dataset comprises multiple human images wearing each target garment. Images of garment are collected from MLB online shopping mall4 and images of human wearing each garment are gathered from social media platforms like Instagram. As shown in Fig. 8, the human images exhibit diverse backgrounds, ranging from parks and buildings to snowy landscapes. For preprocessing, we employ center cropping on the human images to achieve resolutions of $1024 \times 768$ + +![](images/292eb4efa140a52b1291f8ca4aa688b016680609a85e6634b8e20a8aa94bd25a.jpg) +Fig. 9: Illustration of generating detailed captions of garments. We utilize pretrained fashion attribute tagging annotator to extract information of garment and generate detailed captions of the garment based on extracted information. + +resolutions, while the garment images are resized to the same dimensions for compatible setting. + +# A.2 Training and Inference + +We train the model using the Adam [24] optimizer with a fixed learning rate of 1e-5 over 130 epochs (63k iterations with batch size of 24). It takes around 40 hours in training with $4 \times \mathrm{A800}$ GPUs. We apply data augmentations following StableVITON [23], where we apply horizontal flip (with probability 0.5), random affine shifting and scaling (limit of 0.2, with probability 0.5) to the inputs of TryonNet, i.e., $\mathbf{x}_p, \mathbf{x}_{\mathrm{pose}}, \mathbf{x}_m$ and $\mathbf{m}$ . For customization, we fine-tune our model using the Adam optimizer with a fixed learning rate of 1e-6 for 100 steps. It takes around 2 minutes with a single A800 GPU. + +During the inference, we generate images using the DDPM scheduler with 30 steps. We set the strength value to 1.0, i.e., denoising begins from random Gaussian noise, to ignore the masked portion of the input image. For classifier-free guidance [15] (CFG), we merge both conditioning, i.e., low-level features $\mathbf{L}_g$ from GarmentNet and high-level semantics $\mathbf{H}_g$ from IP-Adapter, as these conditions contain features of the same garment image, following SpaText [1]. In specific, the forward is given as follows: + +$$ +\hat {\epsilon} _ {\theta} \left(\mathbf {x} _ {t}; \mathbf {L} _ {g}, \mathbf {H} _ {g}, t\right) = s \cdot \left(\boldsymbol {\epsilon} _ {\theta} \left(\mathbf {x} _ {t}; \mathbf {L} _ {g}, \mathbf {H} _ {g}, t\right) - \boldsymbol {\epsilon} _ {\theta} \left(\mathbf {x} _ {t}; t\right)\right) + \boldsymbol {\epsilon} _ {\theta} \left(\mathbf {x} _ {t}; t\right), \tag {4} +$$ + +where $\epsilon_{\theta}(\mathbf{x}_t;\mathbf{L}_g,\mathbf{H}_g,t)$ denotes noise prediction with conditions $\mathbf{L}_g$ and $\mathbf{H}_g$ , and $\epsilon_{\theta}(\mathbf{x}_t;t)$ denotes unconditional noise prediction. We use guidance scale $s = 2.0$ , which works well in practice. + +# A.3 Detailed captioning of garments + +We generate detailed captions for each garment to leverage the prior knowledge of T2I diffusion models. We employ OMNIOUS.AI's commercial $^{5}$ fashion attribute tagging annotator, which has been trained with over 1,000 different fashion attributes. The image annotator provides various feature categories present in a + +given image, such as sleeve length and neckline type. We extract three different feature categories: sleeve length, neckline type, and item name, as illustrated in Fig. 9. Subsequently, we generate captions based on this feature information, for example, "short sleeve off shoulder t-shirts". + +![](images/fb3db19adaaf1c8f85bcfdb52a3e101ff9820f41061d5264996c88d439f9c214.jpg) +Fig. 10: Comparison between IDM-VTON and OOTDiffusion [55] on VITON-HD and DressCode dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor. + +# B Comparison with Concurrent Work + +We additionally compare IDM-VTON with OOTDiffusion [55], which is a concurrent work on virtual try-on task. We compare each model trained on VITON-HD and DressCode datasets. We use publicly available model checkpoints for generating try-on images of OOTDiffusion6. + +Table 5: Quantitative results of models trained on VITON-HD training dataset and evaluated on VITON-HD and DressCode (upper body) test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]. + +
Train / TestVITON-HD / VITON-HDVITON-HD / DressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.1200.8466.390.8580.0870.90110.680.852
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
+ +Table 6: Quantitative results of models trained on DressCode training dataset and evaluated on VITON-HD and DressCode test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]. + +
Train / TestDressCode / DressCodeDressCode / VITON-HD
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.0880.8854.180.8510.2050.78857.870.677
IDM-VTON (ours)0.0720.9023.620.9130.1290.85912.570.839
+ +Fig. 10 and Fig. 11 present qualitative comparisons of OOTDiffusion and ours on VITON-HD, DressCode and In-the-Wild dataset. As shown in Fig. 10, we see that IDM-VTON outperforms OOTDiffusion in capturing both high-level semantics and low-level details, and generating more authentic images. In particular, we observe notable improvements of IDM-VTON compared to OOTDiffusion on In-the-Wild dataset, which demonstrates the generalization ability of IDM-VTON. + +Tab. 5, Tab. 6 and Tab. 7 show quantitative comparisons between IDM-VTON and OOTDiffusion on VITON-HD, DressCode, and In-the-Wild datasets. One can notify that IDM-VTON outperforms OOTDiffusion on all metrics including image fidelity (FID), and reconstruction of garments (LPIPS, SSIM and CLIP-I), which verifies our claim. + +Table 7: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with the concurrent work OOTDiffusion [55] on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP image similarity scores. + +
MethodLPIPS ↓SSIM ↑CLIP-I ↑
OOTDiffusion [55]0.2030.7520.861
IDM-VTON (ours)0.1640.7950.901
+ +![](images/88147a737f5b865c3e8da7372a0007bc45feaf830c165c1a28e18e7174faba09.jpg) +Input + +![](images/7eeb0f4080c40dbc65dac8af01dc27d2dd90458785cae41527dbaf631ca3ea3f.jpg) +OOTDiffusion + +![](images/307ba17b8eae42cdfd47ce8df6f8452b9a8716c8fab08154b40047d5b2771094.jpg) +IDM-VTON (Ours) + +![](images/fabb79bd274c38e7680c85f1337449ce655f6e42004cdce51eb9ca0c6ac2cee8.jpg) +Input + +![](images/9422680077d1fb5492929fa5a5c28ac117e84c9df1b00962c10f02baf6fdc666.jpg) +OOTDiffusion + +![](images/ae18ec398c6a79517efac2d5ef5270715ec245826255f84f17ce28028f889515.jpg) +IDM-VTON (Ours) + +![](images/7d8cad5c38d1b64c59a730220378c161a89071798e144f17ff02abf762e0c255.jpg) + +![](images/38afecafa40c5e9904d80d8980c1a741a207022fe3ccdb40006dda762fb48400.jpg) + +![](images/867b0d34451c361e1442a5642ea66937ef7b476853d66c5f20c34d10c0ce6edb.jpg) + +![](images/b4a7368cc04b82fd388a780be611a8ba78633dbf22cd7cb8cab2cb7eea8ce5c4.jpg) + +![](images/514c840f53977cc04c789a460824720d57d78ea7bd0684a725d58842ad9855b3.jpg) + +![](images/74c78de813196823cad3f1c5943452b315ab6c566be485ac758e94161a8bb614.jpg) + +![](images/cccef36426bed0e85c11ea00e40afb1934a51936e63ce438fce47b85eccfc836.jpg) + +![](images/2dfdbe41b2fa7f7dd034d5051658ba42658819f445d59f6f80cd9eaad6bda05e.jpg) + +![](images/0dd1fd8b56fb2fb77aa6057db06c226c26eb9cf2cca771ce163d60e272647f02.jpg) + +![](images/7f440d978f1d835b2fa0cdd7d7bf211b62e61e4008c2e57f6a5ba08b65fb7663.jpg) + +![](images/ffa0b47f52c0d18ba8c5354cd323eebd3e852884c9984a17bb97037299206a68.jpg) + +![](images/a5d8a1de905d61ad8027baec0d2d15d6774f2f4f7cebfa1b757dd6e41575866b.jpg) + +![](images/f4d11feb48c897efd7aef02cc854a3a261d99a302e4f0b81bd4ff7ca69ac378e.jpg) +Fig. 11: Comparison between IDM-VTON and OOTDiffusion [55] on In-the-Wild dataset. We provide visual comparison results on In-the-Wild dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor. + +![](images/347164352941c354ef70d86d4ed005721e8e0b032992bdb48a7f203ce5eb2e2b.jpg) + +![](images/c036d099157d7eae1b2cd892ea288cf42495da47a085ffb3f9de1d5034d8bf96.jpg) + +![](images/c2ab04002d27ee60a246f2ea2fe78e4632c00606a4f2bba27e0a196aa3a39443.jpg) + +![](images/24737bee5539aa587cb52d6e573ab27d658a06eceb72771eb41899babdd0ab66.jpg) + +![](images/6bb076ceba9a194a9eb1f5358d6834d6efb1162e327c7887a23a6d153dee2998.jpg) + +![](images/ff5da5fe2f5784de1abb73537c82263fbd852d143ff85ac5c0054489789e3eb4.jpg) +Fig. 12: Qualitative comparison on VITON-HD and DressCode dataset. As we observed in our quantitative analysis, GAN-based methods generally struggle to generate high-fidelity images introducing non-desirable distortions (e.g., non-realistic body and arms) while diffusion-based methods fail to capture low-level features or high-level semantics. All methods are trained on VITON-HD training data. + +![](images/d3f5c0f19516de2f793e7eccad0723b378e6b3bd5805a9aae4671c5e0706db18.jpg) +Fig. 13: Qualitative comparison on In-the-Wild dataset. While baselines fail to generate natural images or capture the details of clothing, IDM-VTON produces realistic images and preserves fine details effectively. All methods are trained on VITON-HD training data. + +![](images/14fdf3e2e3e600a983f6438ab0c8b5a167204e91750cfe8ffd9b0f1f0b68398e.jpg) +Fig. 14: Try-on results on VITON-HD test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor. + +![](images/f61ad4b56344445bb5743d79c431d5382f2f55214b11292453d8ca4a2e4a27ce.jpg) +Fig. 15: Try-on results on DressCode test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor. + +![](images/55a136d10b0d654d75e414688c70d74f3c264bf509eeffa545f4d481bbe91766.jpg) +Fig. 16: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor. + +![](images/5440ec8b9da172ed3d8e33a9fdf7796175e7ac7232648d3a7b311bf4266c4dd1.jpg) +Fig. 17: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor. + +![](images/129d3a7a608c19847b6cbf62cb6be9da6f3cb77e269579f237c0a2d28fa115ba.jpg) +Fig. 18: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor. \ No newline at end of file diff --git a/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/images.zip b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..a23334f133be9d7548e5f9b3c0c6c01f1e649e2a --- /dev/null +++ b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0f5a84a7b88d65127cd02b3b70cc3ccd48cedc4aac56eb7b029a5291078b1d11 +size 2381212 diff --git a/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/layout.json b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..5abc78d9225f6d78aa187b8729011798e24f0afb --- /dev/null +++ b/2024/Improving Diffusion Models for Authentic Virtual Try-on in the Wild/layout.json @@ -0,0 +1,13478 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 160, + 111, + 454, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 111, + 454, + 148 + ], + "spans": [ + { + "bbox": [ + 160, + 111, + 454, + 148 + ], + "type": "text", + "content": "Improving Diffusion Models for Authentic Virtual Try-on in the Wild" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "spans": [ + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "text", + "content": "Yisol Choi" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "text", + "content": ", Sangkyung Kwak" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "text", + "content": ", Kyungmin Lee" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "text", + "content": ", Hyungwon Choi" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "text", + "content": ", and Jinwoo Shin" + }, + { + "bbox": [ + 198, + 167, + 416, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 170, + 201, + 441, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 170, + 201, + 441, + 224 + ], + "spans": [ + { + "bbox": [ + 170, + 201, + 441, + 224 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 170, + 201, + 441, + 224 + ], + "type": "text", + "content": " Korea Advanced Institute of Science and Technology (KAIST) {yisol.choi, skkwak9806, kyungmnlee, jinwoos}@kaist.ac.kr" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 272, + 224, + 341, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 224, + 341, + 234 + ], + "spans": [ + { + "bbox": [ + 272, + 224, + 341, + 234 + ], + "type": "text", + "content": "2 OMNIOUS.AI" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 246, + 236, + 367, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 246, + 236, + 367, + 246 + ], + "spans": [ + { + "bbox": [ + 246, + 236, + 367, + 246 + ], + "type": "text", + "content": "hyungwon.choi@omnious.com" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 138, + 276, + 473, + 424 + ], + "blocks": [ + { + "bbox": [ + 138, + 276, + 473, + 424 + ], + "lines": [ + { + "bbox": [ + 138, + 276, + 473, + 424 + ], + "spans": [ + { + "bbox": [ + 138, + 276, + 473, + 424 + ], + "type": "image", + "image_path": "abfd15de2ab00ed8d9d65a429eceeab551e878ae35f1afff2f682480f7711793.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 425, + 482, + 459 + ], + "lines": [ + { + "bbox": [ + 130, + 425, + 482, + 459 + ], + "spans": [ + { + "bbox": [ + 130, + 425, + 482, + 459 + ], + "type": "text", + "content": "Fig. 1: Virtual try-on images generated by using our IDM-VTON on VITON-HD [3] (top row, first and second column), DressCode [32] (top row, third and fourth column), and collected In-the-Wild dataset (bottom row). Best viewed on a zoomed, color monitor." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 490, + 455, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 490, + 455, + 666 + ], + "spans": [ + { + "bbox": [ + 159, + 490, + 455, + 666 + ], + "type": "text", + "content": "Abstract. This paper considers image-based virtual try-on, which renders an image of a person wearing a curated garment, given a pair of images depicting the person and the garment, respectively. Previous works adapt existing exemplar-based inpainting diffusion models for virtual try-on to improve the naturalness of the generated visuals compared to other methods (e.g., GAN-based), but they fail to preserve the identity of the garments. To overcome this limitation, we propose a novel diffusion model that improves garment fidelity and generates authentic virtual try-on images. Our method, coined " + }, + { + "bbox": [ + 159, + 490, + 455, + 666 + ], + "type": "inline_equation", + "content": "IDM - VTON" + }, + { + "bbox": [ + 159, + 490, + 455, + 666 + ], + "type": "text", + "content": ", uses two different modules to encode the semantics of garment image; given the base UNet of the diffusion model, 1) the high-level semantics extracted from a visual encoder are fused to the cross-attention layer, and then 2) the low-level features extracted from parallel UNet are fused to the self-attention layer. In addition, we provide detailed textual prompts for both garment and person images to enhance the authenticity of the generated visuals. Finally, we present a customization method using a" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 159, + 117, + 455, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 117, + 455, + 194 + ], + "spans": [ + { + "bbox": [ + 159, + 117, + 455, + 194 + ], + "type": "text", + "content": "pair of person-garment images, which significantly improves fidelity and authenticity. Our experimental results show that our method outperforms previous approaches (both diffusion-based and GAN-based) in preserving garment details and generating authentic virtual try-on images, both qualitatively and quantitatively. Furthermore, the proposed customization method demonstrates its effectiveness in a real-world scenario. More visualizations are available in our project page." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 204, + 356, + 216 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 204, + 356, + 216 + ], + "spans": [ + { + "bbox": [ + 160, + 204, + 356, + 216 + ], + "type": "text", + "content": "Keywords: Virtual Try-On " + }, + { + "bbox": [ + 160, + 204, + 356, + 216 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 204, + 356, + 216 + ], + "type": "text", + "content": " Diffusion Models" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 234, + 230, + 247 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 234, + 230, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 234, + 230, + 247 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 258, + 481, + 354 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 258, + 481, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 481, + 354 + ], + "type": "text", + "content": "Image-based virtual try-on (VTON) is an important computer vision task, where the goal is to render a visual of an arbitrary person dressing in a specific garment given by images. Due to its convenience and capability to provide a personalized shopping experience to E-commerce users, there is a considerable interest in synthesizing authentic virtual try-on images that exactly depict the garment given as input. The key challenges of VTON is to fit the garment to the human body of various poses or gestures, without creating any distortions in the patterns and textures in garment [12, 51]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 354, + 482, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 556 + ], + "type": "text", + "content": "The rapid progress in generative models [8, 14] has led the development of virtual try-on methods. Most of the primary approaches for image-based VTON are based on Generative Adversarial Networks [8, 22] (GANs), where they employ a separate warping module to deform the garment to the human body and use GAN generators to blend with the target person [3, 6, 7, 27, 29, 54]. However, such approaches struggle to generate high-quality images and often fail to generalize to different human images, introducing undesirable distortions to the garment. On the other hand, recently, diffusion models [14, 46] demonstrate superior performance in generating genuine images [30, 36, 39, 40] compared to GANs, showing the potential to overcome such challenges. Recent diffusion-based VTON methods [4, 9, 23, 28, 31, 35] utilize the rich generative prior of pretrained text-to-image (T2I) diffusion models [34, 40, 43] to enhance the naturalness of try-on images. To identify the details of garments, they encode the semantics of garments in pseudo-words [31] or use explicit warping networks [9]. However, those methods fall short in preserving the fine-grained details of garments, e.g., patterns, textures, shapes, or colors, which hinders its application to real-world scenarios." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": "To overcome this limitation, this paper proposes an Improved Diffusion Models for Virtual Try-ON(IDM-VTON), which significantly enhances the consistency of the garment image, while generating authentic virtual try-on images. In specific, we design a new approach in conditioning garment images to the diffusion model by designing sophisticated attention modules, which consist of two different components: 1) the image prompt adapter that encodes the high-level semantics of the garment, and 2) the UNet encoder, which we refer to as GarmentNet, that extracts low-level features to preserve fine-grained details. In addition, we propose to customize our model using a single pair of garment and person images, which" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": "further improves the visual quality of virtual try-on images, particularly in the wild scenario. Last but not least, we show the importance of providing detailed captions for the garment image which helps retaining the prior knowledge of T2I diffusion models." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 163, + 483, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 163, + 483, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 163, + 483, + 272 + ], + "type": "text", + "content": "We train our model on VITON-HD [3] training dataset, and demonstrate the effectiveness of our method by showing superior results on VITON-HD and DressCode [32] test datasets both qualitatively and quantitatively. Furthermore, to simulate the real-world virtual try-on application, we have collected In-the-Wild dataset, which contains garments with intricate patterns and human images with various poses and gestures, that is largely different from the training data. Our method outperforms other methods on In-the-Wild dataset, and in particular, customizing our model notably enhances retaining the identity of the garment while generating authentic try-on images." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 289, + 243, + 303 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 289, + 243, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 289, + 243, + 303 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 314, + 482, + 420 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 420 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 420 + ], + "type": "text", + "content": "Image-based virtual try-on. Given a pair of images depicting a target person and a garment, the image-based virtual try-on aims to generate a look of the target person dressing the given garment. A line of works [3,6,7,27,29,54] is based on Generative Adversarial Networks (GANs) [8], where they first deform the garment to the person body shape, and then use the generator to put the deformed garment on the person image. While many works have attempted to reduce the mismatch between the warped garment and the person [3,7,21,27], those approaches lack generalization to arbitrary person images, e.g., with complex backgrounds or intricate poses." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 422, + 482, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 529 + ], + "type": "text", + "content": "As diffusion models have shown great success [14, 47], recent works have studied the application of diffusion models for virtual try-on. TryOnDiffusion [61] proposed an architecture that uses two parallel UNets, and showed the capability of diffusion-based virtual try-on by training on the large-scale dataset. Subsequent works considered virtual try-on as an exemplar-based image inpainting problem [56]. They fine-tuned the inpainting diffusion models on virtual try-on dataset [9, 23, 31] to generate high-quality virtual try-on images. However, those methods still suffer from preserving meticulous details of garments, dampening their applications to real-world scenarios." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Adding conditional control to diffusion models. While text-to-image (T2I) diffusion models [34,40,43] have shown their capability in generating high-quality images from text prompts, the inaccuracy of natural language lacks fine-grained control in image synthesis. To this end, various works have proposed to add conditional control to T2I diffusion models [33,57,58,60]. ControlNet [58] and T2I-Adapter [33] proposed to fine-tune extra modules that encode spatial information such as edges, depth, and human pose, to control the diffusion model together with text prompts. Image prompt adapter (IP-Adapter) [57] proposed to condition T2I diffusion models with high-level semantics of reference image to control image generation with both textual and visual prompts." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "Customizing diffusion models. Several works have demonstrated the potential of customizing diffusion models with few personal images [5,11,25,42,45]. Together with parameter efficient fine-tuning methods [16,17] and regularized fine-tuning objective [26], T2I diffusion models can be adapted to unseen examples without catastrophic forgetting. Also, many works have studied the customization of diffusion models for various tasks such as masked image completion [48] or image restoration [2]. In this paper, we first present a customization of diffusion models for virtual try-on, where we show it significantly improves the adaptation to real-world scenarios." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 240, + 202, + 252 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 240, + 202, + 252 + ], + "spans": [ + { + "bbox": [ + 132, + 240, + 202, + 252 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 263, + 330, + 275 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 263, + 330, + 275 + ], + "spans": [ + { + "bbox": [ + 132, + 263, + 330, + 275 + ], + "type": "text", + "content": "3.1 Backgrounds on Diffusion Models" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "spans": [ + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": "Diffusion models [14, 44] are generative models that consist of a forward process, which gradually adds Gaussian noise to the data, and a reverse process that gradually denoises a random noise to generate a sample. Suppose " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " be a data point (e.g., an image or a latent from the output of autoencoder [40]). Given noise schedules " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\{\\alpha_t\\}_{t=1}^T, \\{\\sigma_t\\}_{t=1}^T" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "t = 1, \\dots, T" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": ", the forward process at timestep " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " is given by " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t = \\alpha_t \\mathbf{x}_0 + \\sigma_t \\boldsymbol{\\epsilon}" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\boldsymbol{\\epsilon} \\sim \\mathcal{N}(\\mathbf{0}, \\mathbf{I})" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " is a Gaussian noise. For sufficiently large " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\sigma_T" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_T \\sim \\mathcal{N}(\\alpha_T \\mathbf{x}_0, \\sigma_T^2 \\mathbf{I})" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " is indiscernible from pure random Gaussian noise. Then the reverse generative process initializes from " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_T \\sim \\mathcal{N}(\\mathbf{0}, \\sigma_T^2 \\mathbf{I})" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": ", and sequentially denoises " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " into " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{t-1}" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " for each " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": ", so that " + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0" + }, + { + "bbox": [ + 130, + 281, + 482, + 400 + ], + "type": "text", + "content": " is distributed according to the data distribution." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "content": "Text-to-image (T2I) diffusion models. T2I diffusion models [34, 40, 43] are diffusion models that model the distribution of image conditioned on text, which is encoded by embeddings using the pretrained text encoders (e.g., T5 [38] and CLIP [37] text encoder). While convolutional UNet [41] architecture has been developed for diffusion-based generative models [14, 47], recent works have shown the promise of fusing transformer [50] architectures for UNet. Training a diffusion model is shown to be equivalent to learning a score function of a perturbed data distribution (i.e., denoising score matching [19]), where it is often done by " + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "content": "-noise prediction loss [14]. Formally, given data " + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0" + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "content": " and text embedding " + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "inline_equation", + "content": "\\mathbf{c}" + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "content": ", the training loss for the T2I diffusion model is given as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 189, + 542, + 482, + 558 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 189, + 542, + 482, + 558 + ], + "spans": [ + { + "bbox": [ + 189, + 542, + 482, + 558 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {D M}} (\\theta) = \\mathbb {E} _ {\\epsilon \\sim \\mathcal {N} (\\mathbf {0}, \\mathbf {I}), t \\sim \\mathcal {U} [ 0, T ]} \\left[ \\omega (t) \\| \\epsilon_ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) - \\epsilon \\| _ {2} ^ {2} \\right], \\tag {1}", + "image_path": "8483d9f4ac70fafa2561b2d83e538461501c802a6b7a0f7621f0bd052c330da9.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t = \\alpha_t\\mathbf{x}_0 + \\sigma_t\\pmb{\\epsilon}" + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "content": " is a forward process of " + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0" + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\omega (t)" + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "content": " is a weighting function at each timestep " + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 563, + 482, + 647 + ], + "type": "text", + "content": ". To achieve better controllability over text conditioning, it uses classifier-free guidance (CFG) [15], which jointly learns unconditional and conditional. At the training stage, the text conditioning is randomly dropped out (i.e., giving null-text to the input), and at the inference stage, the CFG interpolates the conditional and unconditional noise output to control the strength of text conditioning:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 195, + 653, + 482, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 195, + 653, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 195, + 653, + 482, + 667 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) = s \\cdot \\left(\\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; \\mathbf {c}, t) - \\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; t)\\right) + \\boldsymbol {\\epsilon} _ {\\theta} (\\mathbf {x} _ {t}; t), \\tag {2}", + "image_path": "931d4b275a153705867474dacba669f983862937217243b572a93035ec287866.jpg" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 118, + 376, + 273 + ], + "blocks": [ + { + "bbox": [ + 136, + 118, + 376, + 273 + ], + "lines": [ + { + "bbox": [ + 136, + 118, + 376, + 273 + ], + "spans": [ + { + "bbox": [ + 136, + 118, + 376, + 273 + ], + "type": "image", + "image_path": "d620a900c4da094aa6b9a4ed9e4e5b1d3c3a5be61658f894fa3c11769afe0278.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "lines": [ + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "spans": [ + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": "Fig. 2: Overview of IDM-VTON. We demonstrate the proposed model architecture and details on the attention modules. (Left) Our model consists of 1) TryonNet which is a main UNet that processes person image, 2) image prompt adapter (IP-Adapter) [57] that encodes high-level semantics of garment image " + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": ", and 3) GarmentNet that encodes low-level features of " + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": ". As of input for UNet, we concatenate the noised latents " + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": " of latents " + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathbf{x}_p)" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": " with the segmentation mask " + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathbf{m}" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": ", masked image " + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathbf{x}_m)" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": ", and Densepose [10] " + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathbf{x}_{\\mathrm{pose}})" + }, + { + "bbox": [ + 130, + 281, + 482, + 425 + ], + "type": "text", + "content": ". We provide a detailed caption to the garment (e.g., [V]: \"short sleeve round neck t-shirts\"). Then it is used for input prompt of GarmentNet (e.g., \"A photo of [V]\") and TryonNet (e.g., \"Model is wearing [V]\"). (Right) The intermediate features of TryonNet and GarmentNet are concatenated and passed to the self-attention layer, and we use the first half (i.e., that from TryonNet) of the output. Then we fuse the output with features from text encoder and IP-Adapter by cross-attention layer. We fine-tune the TryonNet and the IP-Adapter modules, and freeze other components." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 378, + 118, + 473, + 274 + ], + "blocks": [ + { + "bbox": [ + 378, + 118, + 473, + 274 + ], + "lines": [ + { + "bbox": [ + 378, + 118, + 473, + 274 + ], + "spans": [ + { + "bbox": [ + 378, + 118, + 473, + 274 + ], + "type": "image", + "image_path": "7b7d885214474cf2dbe1a29ebd18ba600d64d06b5221901907774096ef6d1618.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 436, + 480, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 436, + 480, + 460 + ], + "spans": [ + { + "bbox": [ + 130, + 436, + 480, + 460 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 436, + 480, + 460 + ], + "type": "inline_equation", + "content": "s \\geqslant 1" + }, + { + "bbox": [ + 130, + 436, + 480, + 460 + ], + "type": "text", + "content": " is a guidance scale that controls the text conditioning, and " + }, + { + "bbox": [ + 130, + 436, + 480, + 460 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(\\mathbf{x}_t; t)" + }, + { + "bbox": [ + 130, + 436, + 480, + 460 + ], + "type": "text", + "content": " denotes the noise prediction with null-text embeddings." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": "Image prompt adapter [57]. To condition the T2I diffusion model with a reference image, Ye et al. [57] proposed Image Prompt Adapter (IP-Adapter), which leverages the features extracted from image encoder (e.g., CLIP [37] image encoder) and attaches additional cross-attention layer to the text conditioning [40]. Let us denote " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "Q \\in \\mathbb{R}^{N \\times d}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": " be the query matrices from the intermediate representation of UNet, and " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "K_{c} \\in \\mathbb{R}^{N \\times d}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "V_{c} \\in \\mathbb{R}^{N \\times d}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": " be the key and value matrices from the text embeddings " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathbf{c}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": " is number of samples. The output of cross-attention layer is given by " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\text{Attention}(Q, K_{c}, V_{c}) = \\text{softmax}\\left(\\frac{Q K_{c}^{\\top}}{\\sqrt{d}}\\right) \\cdot V_{c}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": ". Then IP-Adapter computes key and value matrices " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "K_{i} \\in \\mathbb{R}^{N \\times d}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "V_{i} \\in \\mathbb{R}^{N \\times d}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": " from the image embeddings " + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathbf{i}" + }, + { + "bbox": [ + 130, + 476, + 482, + 601 + ], + "type": "text", + "content": ", and inserts the cross-attention layer as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 203, + 609, + 482, + 622 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 203, + 609, + 482, + 622 + ], + "spans": [ + { + "bbox": [ + 203, + 609, + 482, + 622 + ], + "type": "interline_equation", + "content": "\\operatorname {A t t e n t i o n} \\left(Q, K _ {c}, V _ {c}\\right) + \\operatorname {A t t e n t i o n} \\left(Q, K _ {i}, V _ {i}\\right). \\tag {3}", + "image_path": "8cb6e704763d955cd48d2d9e3317057a63c7c8dbc6fd3fac9d9077bf37bb2265.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Overall, the IP-Adapter freezes the original UNet, and fine-tunes only the (linear) projection layers of key and value matrices of image embeddings " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "K_{i}" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "V_{i}" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": ", and the linear projection layer that maps CLIP image embeddings." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 251, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 251, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 251, + 128 + ], + "type": "text", + "content": "3.2 Proposed Method" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "text", + "content": "Now, we present our method for designing diffusion models for virtual try-on. Let us denote " + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_p" + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "text", + "content": " be the image of a person, and " + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "text", + "content": " be the image of a garment. Our primary goal is to generate an image " + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{tr}}" + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "text", + "content": " that visualizes a person from " + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_p" + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "text", + "content": " wearing a garment in image " + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 135, + 483, + 316 + ], + "type": "text", + "content": ". It is common practice to cast virtual try-on as an exemplar-based image inpainting problem [56], which aims to fill the masked image with a reference image. Here, it is important to extract relevant information of garment, and add conditional control to the diffusion model. To this end, our model is composed of three components; 1) the base UNet (TryonNet) that processes the masked person image with its pose information, 2) the image prompt adapter (IP-Adapter) that extracts the high-level semantics of the garment, and 3) the garment UNet feature encoder (GarmentNet) that extracts the low-level features of the garment. The features from GarmentNet are fused within self-attention layer of TryonNet, and then it is processed with the features of IP-Adapter through cross-attention layer. We provide an overview of our method in Fig. 2, and provide detailed explanation of each component as follows." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": "TryonNet. For the base UNet model, we consider latent diffusion model [40], where the diffusion generative modeling is conducted in latent space of variational autoencoder " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": " and the output is passed to decoder " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": " to generate an image. As of the input for our base UNet, we concatenate four components as follows: 1) the latent of person image, i.e., " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathbf{x}_p)" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": ", 2) the (resized) mask " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{m}" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": " that removes the garment on the person image, 3) the latent of masked-out person image " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_m = (1 - \\mathbf{m})\\odot \\mathbf{x}_p" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": ", i.e., " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathbf{x}_m)" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": ", following [3], and 4) the latent of the Densepose [10] " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_{\\mathrm{pose}}" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": " of a person image, i.e., " + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathbf{x}_{\\mathrm{pose}})" + }, + { + "bbox": [ + 130, + 331, + 483, + 465 + ], + "type": "text", + "content": ". Then, the latents are aligned within the channel axis, where we expand the convolutional layer of UNet to 13 channels initialized with zero weights. Unlike previous works on virtual try-on with diffusion models [9, 23, 31], we leverage Stable Diffusion XL (SDXL) [36] inpainting model [49]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 480, + 483, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 480, + 483, + 554 + ], + "spans": [ + { + "bbox": [ + 130, + 480, + 483, + 554 + ], + "type": "text", + "content": "Image prompt adapter. To condition the high-level semantics of a garment image, we leverage image prompt adapter (IP-Adapter) [57]. To encode the garment image, we use frozen CLIP image encoder (i.e., OpenCLIP [20] ViT-H/14) to extract feature and fine-tune feature projection layers and cross-attention layers, which are initialized with pretrained IP-Adapters. Note that we pass textual prompts of garments, and the cross-attention is computed as in Eq. (3)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "text", + "content": "GarmentNet. While we already condition the garment image using IP-Adapter, it falls short in preserving the fine-grained details of garments when it has complicated patterns or graphic prints (e.g., see Fig. 6). This is because the CLIP image encoder lacks extracting the low-level features of a garment. To tackle this issue, we propose to utilize an additional UNet encoder (i.e., garment UNet encoder) to encode fine-details of garment images. Given the latent of a garment image " + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\mathbf{x}_g)" + }, + { + "bbox": [ + 130, + 570, + 483, + 666 + ], + "type": "text", + "content": ", we pass through the (frozen) pretrained UNet encoder to obtain the intermediate representation, and concatenate with the intermediate representation" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 234, + 239 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 234, + 239 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 234, + 239 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 234, + 239 + ], + "type": "image", + "image_path": "6e8d6da3b9d870e602c0c23787fc94d6cd1ed5ce8818d0c6301ffe14f391505c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 149, + 239, + 219, + 250 + ], + "lines": [ + { + "bbox": [ + 149, + 239, + 219, + 250 + ], + "spans": [ + { + "bbox": [ + 149, + 239, + 219, + 250 + ], + "type": "text", + "content": "(a) Public Dataset" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 255, + 482, + 310 + ], + "lines": [ + { + "bbox": [ + 130, + 255, + 482, + 310 + ], + "spans": [ + { + "bbox": [ + 130, + 255, + 482, + 310 + ], + "type": "text", + "content": "Fig. 3: Comparisons between datasets used in our experiments. For evaluation, we test on (a) public dataset, including VITON-HD [3] and DressCode [32], and (b) In-the-Wild dataset, which we internally collected from real E-commerce setup. We remark that the In-the-Wild dataset contains more intricate patterns and logos in garment image, and diverse backgrounds, and poses in person image." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 239, + 114, + 287, + 239 + ], + "blocks": [ + { + "bbox": [ + 239, + 114, + 287, + 239 + ], + "lines": [ + { + "bbox": [ + 239, + 114, + 287, + 239 + ], + "spans": [ + { + "bbox": [ + 239, + 114, + 287, + 239 + ], + "type": "image", + "image_path": "39541a79f2de27f6a0173201049a5b13bc1c49922698891fccdfc8cffdd8c3b1.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 239, + 239, + 286, + 244 + ], + "lines": [ + { + "bbox": [ + 239, + 239, + 286, + 244 + ], + "spans": [ + { + "bbox": [ + 239, + 239, + 286, + 244 + ], + "type": "text", + "content": "" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 288, + 114, + 475, + 239 + ], + "blocks": [ + { + "bbox": [ + 288, + 114, + 475, + 239 + ], + "lines": [ + { + "bbox": [ + 288, + 114, + 475, + 239 + ], + "spans": [ + { + "bbox": [ + 288, + 114, + 475, + 239 + ], + "type": "image", + "image_path": "a9f04d91b11214fde43bb0685a3bb70a981d18cb343db65bcd9f1c21ee2166c5.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 313, + 239, + 400, + 250 + ], + "lines": [ + { + "bbox": [ + 313, + 239, + 400, + 250 + ], + "spans": [ + { + "bbox": [ + 313, + 239, + 400, + 250 + ], + "type": "text", + "content": "(b) In-the-wild Dataset" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 325, + 482, + 409 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 409 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 409 + ], + "type": "text", + "content": "from the TryonNet. Then we compute the self-attention on the concatenated features and then pass only the first-half dimensions from TryonNet. We use UNet of SDXL [36] for our GarmentNet, which helps utilizing the rich generative prior of the pretrained text-to-image diffusion model, and complements the low-level feature that is often ignored in the cross-attention layer of IP-Adapter. Remark that a similar approach was introduced in [18], which used a similar attention mechanism in preserving consistency for video generation." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 429, + 482, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 429, + 482, + 586 + ], + "spans": [ + { + "bbox": [ + 130, + 429, + 482, + 586 + ], + "type": "text", + "content": "Detailed captioning of garments. While the majority of diffusion-based virtual try-on models leverage pretrained text-to-image diffusion models, they do not take the text prompts as input [9,23] or use a naive text prompts [31] such as \"upper garment\" for any garment image. To fully exploit the rich generative prior of the text-to-image diffusion model, we provide a comprehensive caption [26] that describes the detail of a garment, such as shapes or textures. As shown in Fig. 2, we provide a comprehensive caption to the garment image (e.g., \"short sleeve round neck t-shirts\") and pass it to both GarmentNet (i.e., \"a photo of short sleeve round neck t-shirts\") and the TryonNet (i.e., \"model is wearing short sleeve round neck t-shirts\"). This helps the model to encode the high-level semantics of the garment using natural language, and complements the image-based conditioning (e.g., see Fig. 7). In practice, we utilize an image annotator for fashion images, and manually provide captioning with templates (see Appendix for details)." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "content": "Customization of IDM-VTON. While our model is able to capture the fine-details of garments, it often struggles when the person image " + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_p" + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "content": " or the garment image " + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 605, + 482, + 667 + ], + "type": "text", + "content": " is different from training distribution (e.g., see Fig. 3). To this end, inspired by text-to-image personalization methods [2, 42, 48], we propose an effective customization of IDM-VTON by fine-tuning TryonNet with a pair" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 113, + 473, + 264 + ], + "blocks": [ + { + "bbox": [ + 140, + 113, + 473, + 264 + ], + "lines": [ + { + "bbox": [ + 140, + 113, + 473, + 264 + ], + "spans": [ + { + "bbox": [ + 140, + 113, + 473, + 264 + ], + "type": "image", + "image_path": "ddf3685e761b5a6cd6d8d1401282f3fe3f97b19d42434be2eab0243047fc5236.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 282, + 264, + 328, + 274 + ], + "lines": [ + { + "bbox": [ + 282, + 264, + 328, + 274 + ], + "spans": [ + { + "bbox": [ + 282, + 264, + 328, + 274 + ], + "type": "text", + "content": "(a) VITON-HD" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 140, + 275, + 473, + 345 + ], + "blocks": [ + { + "bbox": [ + 140, + 275, + 473, + 345 + ], + "lines": [ + { + "bbox": [ + 140, + 275, + 473, + 345 + ], + "spans": [ + { + "bbox": [ + 140, + 275, + 473, + 345 + ], + "type": "image", + "image_path": "6eebb2319360838aa18b0fc6bb380fe83406d1c02b3c07265f403e582a6b86ea.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 140, + 345, + 462, + 413 + ], + "blocks": [ + { + "bbox": [ + 140, + 345, + 462, + 413 + ], + "lines": [ + { + "bbox": [ + 140, + 345, + 462, + 413 + ], + "spans": [ + { + "bbox": [ + 140, + 345, + 462, + 413 + ], + "type": "image", + "image_path": "6727e93151ac07107238ec45c10823d14c5665d24dae781b38b90096218e93ff.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 265, + 413, + 346, + 422 + ], + "lines": [ + { + "bbox": [ + 265, + 413, + 346, + 422 + ], + "spans": [ + { + "bbox": [ + 265, + 413, + 346, + 422 + ], + "type": "text", + "content": "(b) DressCode (upper body)" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 428, + 482, + 483 + ], + "lines": [ + { + "bbox": [ + 130, + 428, + 482, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 428, + 482, + 483 + ], + "type": "text", + "content": "Fig. 4: Qualitative results on VITON-HD and DressCode dataset. We show generated virtual try-on images using IDM-VTON (ours) compared with other methods on (a) VITON-HD [3], and (b) DressCode (upper body) [32] test datasets. We see that IDM-VTON outperforms others in generating authentic images and preserving fine-grained details of garment. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "content": "of garment and person images. It is straightforward to fine-tune IDM-VTON when we have a pair of images " + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_p" + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "content": ", where the person in " + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_p" + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "content": " is wearing the garment in " + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "content": ". On the other hand, if we only have " + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_p" + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "content": ", we segment the garment and white-out backgrounds to obtain " + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_g" + }, + { + "bbox": [ + 130, + 496, + 482, + 569 + ], + "type": "text", + "content": ". Remark that we fine-tune only the attention layers of the up-blocks (i.e., decoder layers) of TryonNet, which empirically works well (e.g., see Table 4)." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 586, + 224, + 600 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 586, + 224, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 586, + 224, + 600 + ], + "type": "text", + "content": "4 Experiment" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 610, + 261, + 624 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 261, + 624 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 261, + 624 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Implementation details. We use SDXL inpainting model [49] for our TryonNet, pretrained IP-Adapter [57] for image adapter and UNet of SDXL [36] for our GarmentNet. We train our model using VITON-HD [3] train dataset, which" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 185, + 473, + 328 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "text", + "content": "Table 1: Quantitative results on VITON-HD dataset. We evaluate the reconstruction scores (e.g., LPIPS, SSIM) for low-level similarity, CLIP image similarity score (CLIP-I) for high-level semantic similarity, and FID score for image fidelity. We compare with GAN-based virtual try-on methods (e.g., HR-VTON and GP-VTON), and Diffusion-based virtual try-on methods (e.g., LaDI-VTON, DCI-VTON, StableVITON). Bold denotes the best score for each metric." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 185, + 473, + 328 + ], + "lines": [ + { + "bbox": [ + 135, + 185, + 473, + 328 + ], + "spans": [ + { + "bbox": [ + 135, + 185, + 473, + 328 + ], + "type": "table", + "html": "
DatasetVITON-HDDressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
GAN-based methods
HR-VITON [27]0.1150.8839.700.8320.1120.91021.420.771
GP-VTON [54]0.1050.8986.430.8740.4840.78055.210.628
Diffusion-based methods
LaDI-VTON [31]0.1560.8728.850.8340.1490.90516.540.803
DCI-VTON [9]0.1660.8568.730.8400.1620.89317.630.777
StableVITON [23]0.1330.8856.520.8710.1070.91014.370.866
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
", + "image_path": "95b69a74e6e932d4a93d1c945ebe50c152bcbf6b7559ab0902c1b4eb49af62aa.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 341, + 482, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 390 + ], + "type": "text", + "content": "contains 11,647 person-garment image pairs at " + }, + { + "bbox": [ + 130, + 341, + 482, + 390 + ], + "type": "inline_equation", + "content": "1024 \\times 768" + }, + { + "bbox": [ + 130, + 341, + 482, + 390 + ], + "type": "text", + "content": " resolution. We train our model using Adam [24] optimizer with batch size of 24 and learning rate of 1e-5 for 130 epochs. For customization, we fine-tune our model using Adam optimizer with learning rate 1e-6 for 100 steps." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 407, + 482, + 575 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 575 + ], + "type": "text", + "content": "Evaluation dataset. We evaluate our model on public VITON-HD [3] and DressCode [32] test datasets. Furthermore, we internally collected In-the-Wild dataset, which is crawled from the web to assess the generalization of model to the real-world scenario. While VITON-HD and DressCode contain person images of simple poses and solid backgrounds, our In-the-Wild dataset has person images of various poses and gestures with complex backgrounds. Also, the garments are of various patterns and logos, making virtual try-on more challenging than VITON-HD and DressCode (e.g., see Fig. 3). Furthermore, In-the-Wild dataset contains multiple person images per garment, so it is possible to evaluate the results when we customize our network with each garment. Specifically, it consists of 62 images of upper garments and 312 images of people wearing those garments, where there are 4-6 images of person wearing the same garment. To conduct customization experiment, we select one person image for each garment, and use the left 250 person images for evaluation." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "content": "Baselines. We compare our method with GAN-based methods (HR-VITON [27] and GP-VTON [54]), and diffusion-based methods (LaDI-VTON [31], DCI-VTON [9], and StableVITON [23]). HR-VITON and GP-VTON have a separate warping module to estimate the fitted garment on the target person, generating try-on images with GAN using the garment as input. LaDI-VTON, DCI-VTON, and StableVITON are most relevant baselines of ours, where they also utilize" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 116, + 476, + 409 + ], + "blocks": [ + { + "bbox": [ + 134, + 116, + 476, + 409 + ], + "lines": [ + { + "bbox": [ + 134, + 116, + 476, + 409 + ], + "spans": [ + { + "bbox": [ + 134, + 116, + 476, + 409 + ], + "type": "image", + "image_path": "597cf9b7a066a184d3d1e0db3dc35c21dd789038486211aead36d6ad61f8e2f5.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 412, + 482, + 490 + ], + "lines": [ + { + "bbox": [ + 130, + 412, + 482, + 490 + ], + "spans": [ + { + "bbox": [ + 130, + 412, + 482, + 490 + ], + "type": "text", + "content": "Fig. 5: Qualitative comparisons on In-the-Wild dataset. We show generated virtual try-on images on In-the-Wild dataset using IDM-VTON (ours) compared with other methods. IDM-VTON outperforms other methods in generating authentic images and preserving fine-grained details of garment. In particular, customizing IDM-VTON, (i.e., IDM-VTON" + }, + { + "bbox": [ + 130, + 412, + 482, + 490 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 412, + 482, + 490 + ], + "type": "text", + "content": "), significantly enhances the image quality and garment fidelity. When applying customization on StableVITON, (i.e., StableVITON" + }, + { + "bbox": [ + 130, + 412, + 482, + 490 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 412, + 482, + 490 + ], + "type": "text", + "content": "), the improvements are marginal compared to ours. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "spans": [ + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "text", + "content": "pretrained Stable Diffusion (SD). In specific, LaDI-VTON and DCI-VTON employ separate warping modules to condition the garment, while StableVITON utilizes the SD Encoder for garment conditioning. We use the pretrained checkpoints provided in their official repositories to generate images. For a fair comparison, we generate images of resolution " + }, + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "inline_equation", + "content": "1024 \\times 768" + }, + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "text", + "content": " images if available, otherwise generate images of resolution " + }, + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "inline_equation", + "content": "512 \\times 384" + }, + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "text", + "content": " and upscale to " + }, + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "inline_equation", + "content": "1024 \\times 768" + }, + { + "bbox": [ + 130, + 504, + 482, + 589 + ], + "type": "text", + "content": " using various methods, e.g., interpolation or super resolution [52], and report the best one." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "Evaluation metrics. For quantitative evaluation, we measure low-level reconstruction scores such as LPIPS [59] and SSIM [53], and high-level image similarity using CLIP [37] image similarity score. To evaluate the authenticity of generated images, we compute Frenchet Inception Distance (FID) [13] score on VITON-HD and DressCode test dataset." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 209, + 186, + 402, + 293 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "text", + "content": "Table 2: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with other methods on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP [37] image similarity scores. For IDM-VTON and StableVITON [23], we further customize models using a single pair of person-garment images (denoted by " + }, + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "text", + "content": "). We see that IDM-VTON outperforms other methods, and customized IDM-VTON (i.e., IDM-VTON" + }, + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 114, + 482, + 180 + ], + "type": "text", + "content": ") performs the best." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 209, + 186, + 402, + 293 + ], + "lines": [ + { + "bbox": [ + 209, + 186, + 402, + 293 + ], + "spans": [ + { + "bbox": [ + 209, + 186, + 402, + 293 + ], + "type": "table", + "html": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
HR-VITON [27]0.3300.7410.701
LaDI-VTON [31]0.3030.7680.819
DCI-VTON [9]0.2830.7350.752
Stable-VITON [23]0.2600.7360.836
IDM-VTON (ours)0.1640.7950.901
Stable-VITON‡ [23]0.2590.7330.858
IDM-VTON‡ (ours)0.1500.7970.909
", + "image_path": "05d4fc9d0fb5ca3145bf37a60c31a1e755fbd6658ad07e1fc6184d4568a342aa.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 319, + 293, + 331 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 319, + 293, + 331 + ], + "spans": [ + { + "bbox": [ + 132, + 319, + 293, + 331 + ], + "type": "text", + "content": "4.2 Results on Public Dataset" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 349, + 482, + 531 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 482, + 531 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 482, + 531 + ], + "type": "text", + "content": "Qualitative results. Fig. 4 shows the visual comparisons of IDM-VTON with other methods on VITON-HD and DressCode test datasets. We see that IDM-VTON preserves both low-level details and high-level semantics, while others struggle to capture. While GAN-based methods (i.e., HR-VITON and GP-VTON) show comparable performance in capturing fine details of garment, they fall shorts in generating natural human images compared to diffusion-based methods. On the other hand, prior diffusion-based methods (i.e., LaDI-VTON, DCI-VTON, and StableVITON) fail to preserve the details of garments (e.g., the off-shoulder t-shirts in first row, or the details of sweatshirts in second row of VITON-HD dataset). Also, we observe that IDM-VTON significantly outperforms other methods in generalization to the DressCode dataset. Especially, GAN-based methods show inferior performance on the DressCode dataset, showing its poor generalization ability. While prior diffusion-based methods show better images in generating natural images than GAN-based, the generated images show lower consistency with respect to given garment image compared to IDM-VTON." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": "Quantitative results. Tab. 1 shows the quantitative comparisons between IDM-VTON (ours) and other methods on VITON-HD and DressCode test datasets. When compared to GAN-based methods, we observe that IDM-VTON shows comparable performance in reconstruction scores (LPIPS and SSIM) and outperforms in FID and CLIP image similarity score on VITON-HD test dataset. However, the performance of GAN-based methods significantly degrades when tested on DressCode dataset, which we have observed in Fig. 4. We see that IDM-VTON consistently outperforms prior diffusion-based methods in both VITON-HD and DressCode dataset." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 115, + 171, + 205 + ], + "blocks": [ + { + "bbox": [ + 140, + 115, + 171, + 205 + ], + "lines": [ + { + "bbox": [ + 140, + 115, + 171, + 205 + ], + "spans": [ + { + "bbox": [ + 140, + 115, + 171, + 205 + ], + "type": "image", + "image_path": "c9902a59ff939fd8f08487b143cf24d8c90917b896d467210e1e3ca3994ca787.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 211, + 481, + 255 + ], + "lines": [ + { + "bbox": [ + 130, + 211, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 130, + 211, + 481, + 255 + ], + "type": "text", + "content": "Fig. 6: Effect of GarmentNet. We compare the generated virtual try-on images without using GarmentNet (left) and together with GarmentNet (right). We observe that using GarmentNet significantly improves retaining the fine-grained details of garment (e.g., the graphics in the t-shirts)." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 173, + 115, + 236, + 205 + ], + "blocks": [ + { + "bbox": [ + 173, + 115, + 236, + 205 + ], + "lines": [ + { + "bbox": [ + 173, + 115, + 236, + 205 + ], + "spans": [ + { + "bbox": [ + 173, + 115, + 236, + 205 + ], + "type": "image", + "image_path": "40dabe3822f406f8fb03e68a2c3665c9fd39f119f9b11297488da8081c2ce365.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 238, + 115, + 301, + 205 + ], + "blocks": [ + { + "bbox": [ + 238, + 115, + 301, + 205 + ], + "lines": [ + { + "bbox": [ + 238, + 115, + 301, + 205 + ], + "spans": [ + { + "bbox": [ + 238, + 115, + 301, + 205 + ], + "type": "image", + "image_path": "5d005e6dd1234734d6ade31afe0afc2fb6067c72781ec1b4d25d905be95298e6.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 309, + 115, + 407, + 205 + ], + "blocks": [ + { + "bbox": [ + 309, + 115, + 407, + 205 + ], + "lines": [ + { + "bbox": [ + 309, + 115, + 407, + 205 + ], + "spans": [ + { + "bbox": [ + 309, + 115, + 407, + 205 + ], + "type": "image", + "image_path": "85a0e18a24263c5bb50a6eb3f6098441fc864ccb2ad520a0295454b172802efb.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 409, + 116, + 470, + 205 + ], + "blocks": [ + { + "bbox": [ + 409, + 116, + 470, + 205 + ], + "lines": [ + { + "bbox": [ + 409, + 116, + 470, + 205 + ], + "spans": [ + { + "bbox": [ + 409, + 116, + 470, + 205 + ], + "type": "image", + "image_path": "f72842b6491eb4183ba09c0c1e0acb8355d868833c067bdb59d97767abc3954d.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 269, + 318, + 280 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 269, + 318, + 280 + ], + "spans": [ + { + "bbox": [ + 132, + 269, + 318, + 280 + ], + "type": "text", + "content": "4.3 Results on In-the-Wild Dataset" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 289, + 481, + 337 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 481, + 337 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 481, + 337 + ], + "type": "text", + "content": "Here, we evaluate our methods on challenging In-the-Wild dataset, where we compare with other diffusion-based VTON methods. In addition, we show the results of customization using a single pair of garment-person images. We also test customization on StableVITON [23]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 354, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 437 + ], + "type": "text", + "content": "Qualitative results. Fig. 5 shows the qualitative results of IDM-VTON (ours) compared to other baselines3. We see that IDM-VTON generates more authentic images than LaDI-VTON, DCI-VTON, and StableVITON, yet it struggles to preserve the intricate patterns of garments. By customizing IDM-VTON, we obtain virtual try-on images with a high degree of consistency to the garment (e.g., the logos and the text renderings), but we find the customization does not work well for StableVITON." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 455, + 482, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 455, + 482, + 539 + ], + "spans": [ + { + "bbox": [ + 130, + 455, + 482, + 539 + ], + "type": "text", + "content": "Quantitative results. Tab. 2 reports the quantitative comparisons between our IDM-VTON and other methods. We also provide comparisons between IDM-VTON and StableVITON using customization (i.e., IDM-VTON" + }, + { + "bbox": [ + 130, + 455, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 455, + 482, + 539 + ], + "type": "text", + "content": " and StableVITON" + }, + { + "bbox": [ + 130, + 455, + 482, + 539 + ], + "type": "inline_equation", + "content": "\\ddagger" + }, + { + "bbox": [ + 130, + 455, + 482, + 539 + ], + "type": "text", + "content": "). We see that IDM-VTON outperforms other methods on all metrics, even outperforming StableVITON with customization. Furthermore, we observe that IDM-VTON with customization significantly outperforms others, showing its generalization capability." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 556, + 244, + 567 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 556, + 244, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 556, + 244, + 567 + ], + "type": "text", + "content": "4.4 Ablative Studies" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 576, + 481, + 636 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 576, + 481, + 636 + ], + "spans": [ + { + "bbox": [ + 130, + 576, + 481, + 636 + ], + "type": "text", + "content": "Effect of GarmentNet. We conduct an ablation study on the effect of GarmentNet in preserving the fine-grained details of a garment. For comparison, we train another model without using GarmentNet (i.e., using only IP-Adapter to encode garment image). The qualitative results are in Fig. 6. While training with only IP-Adapter is able to generate authentic virtual try-on images that are" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "text", + "content": "3 We do not compare with GP-VTON as it uses private parsing modules. Comparison with HR-VITON is in the appendix." + } + ] + } + ], + "index": 14 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 133, + 172, + 213 + ], + "blocks": [ + { + "bbox": [ + 140, + 119, + 165, + 128 + ], + "lines": [ + { + "bbox": [ + 140, + 119, + 165, + 128 + ], + "spans": [ + { + "bbox": [ + 140, + 119, + 165, + 128 + ], + "type": "text", + "content": "Input" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 140, + 133, + 172, + 213 + ], + "lines": [ + { + "bbox": [ + 140, + 133, + 172, + 213 + ], + "spans": [ + { + "bbox": [ + 140, + 133, + 172, + 213 + ], + "type": "image", + "image_path": "959d884610d5549acfe06abf2a760627192536327f5d19d7a5e0a24aa086ddcc.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 176, + 133, + 236, + 213 + ], + "blocks": [ + { + "bbox": [ + 181, + 120, + 230, + 129 + ], + "lines": [ + { + "bbox": [ + 181, + 120, + 230, + 129 + ], + "spans": [ + { + "bbox": [ + 181, + 120, + 230, + 129 + ], + "type": "text", + "content": "\"upper garment\"" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 176, + 133, + 236, + 213 + ], + "lines": [ + { + "bbox": [ + 176, + 133, + 236, + 213 + ], + "spans": [ + { + "bbox": [ + 176, + 133, + 236, + 213 + ], + "type": "image", + "image_path": "9d0705dc6b23fe725e69e73721d064ef4ecd89625a9dc14cb5779a1daf36cd17.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 241, + 134, + 301, + 213 + ], + "blocks": [ + { + "bbox": [ + 241, + 118, + 298, + 133 + ], + "lines": [ + { + "bbox": [ + 241, + 118, + 298, + 133 + ], + "spans": [ + { + "bbox": [ + 241, + 118, + 298, + 133 + ], + "type": "text", + "content": "\"round neck short sleeve blouse\"" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 241, + 134, + 301, + 213 + ], + "lines": [ + { + "bbox": [ + 241, + 134, + 301, + 213 + ], + "spans": [ + { + "bbox": [ + 241, + 134, + 301, + 213 + ], + "type": "image", + "image_path": "f393137cdb9173a4581e36f49e1e9fc24b0086b27d77d565884a8ebfeee97c88.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 217, + 480, + 262 + ], + "lines": [ + { + "bbox": [ + 130, + 217, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 130, + 217, + 480, + 262 + ], + "type": "text", + "content": "Fig. 7: Effect of detailed caption for garment. We compare the generated virtual try-on images using naive captions (left) and detailed captions (right). The model trained with detailed captions generates images that are more consistent with the garment. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 310, + 133, + 342, + 213 + ], + "blocks": [ + { + "bbox": [ + 317, + 120, + 335, + 129 + ], + "lines": [ + { + "bbox": [ + 317, + 120, + 335, + 129 + ], + "spans": [ + { + "bbox": [ + 317, + 120, + 335, + 129 + ], + "type": "text", + "content": "Input" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 310, + 133, + 342, + 213 + ], + "lines": [ + { + "bbox": [ + 310, + 133, + 342, + 213 + ], + "spans": [ + { + "bbox": [ + 310, + 133, + 342, + 213 + ], + "type": "image", + "image_path": "41c857d0ae368e62f1b328411c005312ba2fde4200fa24d4c01832393e3ea814.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 345, + 133, + 406, + 213 + ], + "blocks": [ + { + "bbox": [ + 352, + 120, + 400, + 129 + ], + "lines": [ + { + "bbox": [ + 352, + 120, + 400, + 129 + ], + "spans": [ + { + "bbox": [ + 352, + 120, + 400, + 129 + ], + "type": "text", + "content": "\"upper garment\"" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 345, + 133, + 406, + 213 + ], + "lines": [ + { + "bbox": [ + 345, + 133, + 406, + 213 + ], + "spans": [ + { + "bbox": [ + 345, + 133, + 406, + 213 + ], + "type": "image", + "image_path": "1f83a3f06ee7e7aee23412bc57f3a1802554ef0da9d049f1648881347dc0fc5b.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 410, + 134, + 470, + 213 + ], + "blocks": [ + { + "bbox": [ + 413, + 117, + 467, + 133 + ], + "lines": [ + { + "bbox": [ + 413, + 117, + 467, + 133 + ], + "spans": [ + { + "bbox": [ + 413, + 117, + 467, + 133 + ], + "type": "text", + "content": "\"sleeveless square neck tube top\"" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 410, + 134, + 470, + 213 + ], + "lines": [ + { + "bbox": [ + 410, + 134, + 470, + 213 + ], + "spans": [ + { + "bbox": [ + 410, + 134, + 470, + 213 + ], + "type": "image", + "image_path": "c7c5fbf57e36553dce21c4e3e1d276e44c7b2efb1dd48cedb84ec12f06409649.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "table", + "bbox": [ + 137, + 334, + 297, + 381 + ], + "blocks": [ + { + "bbox": [ + 137, + 334, + 297, + 381 + ], + "lines": [ + { + "bbox": [ + 137, + 334, + 297, + 381 + ], + "spans": [ + { + "bbox": [ + 137, + 334, + 297, + 381 + ], + "type": "table", + "html": "
GarmentNetLPIPS ↓SSIM ↑CLIP-I ↑
X0.1210.8490.846
✓0.1020.8700.883
", + "image_path": "3db519b9eb7a417de75720592fc45bd8018e97bef50c6e9bc2b3a554824aede1.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "table_body" + } + ], + "index": 16 + }, + { + "type": "table", + "bbox": [ + 318, + 325, + 465, + 398 + ], + "blocks": [ + { + "bbox": [ + 130, + 269, + 479, + 324 + ], + "lines": [ + { + "bbox": [ + 130, + 269, + 479, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 269, + 479, + 324 + ], + "type": "text", + "content": "Table 3: Ablation on GarmentNet. Table 4: Ablation on customization. We ablate the effect of using GarmentNet We compare default IDM-VTON with by comparing LPIPS, SSIM, and CLIP different customization methods by fineimage similarity scores on the VITON-HD tuning all UNet layers, LoRA [17] layers, test dataset. or up-block layers (Decoder)." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 318, + 325, + 465, + 398 + ], + "lines": [ + { + "bbox": [ + 318, + 325, + 465, + 398 + ], + "spans": [ + { + "bbox": [ + 318, + 325, + 465, + 398 + ], + "type": "table", + "html": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
Default0.16420.7950.901
All UNet0.15120.7970.891
LoRA0.15730.7940.881
Decoder0.15020.7970.909
", + "image_path": "7ee3b61cc866c3278275319f93fc7010b28007e6a08df8114e54b5af145dee0f.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "table_body" + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 427, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 427, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 427, + 482, + 499 + ], + "type": "text", + "content": "semantically consistent with the garment images, we see that using GarmentNet significantly improves preserving the identity of the garment (e.g., the graphics of t-shirts). In addition, we conduct a quantitative evaluation on VITON-HD test dataset by measuring LPIPS, SSIM and CLIP image similarity score. In Tab. 3, we see that using GarmentNet quantitatively improves reconstruction scores, as well as image similarity scores, which is aligned with our qualitative results." + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Effect of detailed caption. To validate the effectiveness of detailed captioning on garments, we train an identical model to IDM-VTON except that using naive caption [31], and compare with IDM-VTON. In specific, naive caption provides an unified descriptions of all upper garments (e.g., \"model is wearing an upper garment\"), while our detailed captions provide specific descriptions of each garment. Fig. 7 shows generated virtual try-on images using each model trained with naive caption (left) and detailed captions (right). We observe that the model trained with detailed captions generates images with higher consistency to the garment (e.g., meshes around the neck and arms). Thus, the usage of detailed captions complements the potential inaccuracy of image-based virtual try-on by exploiting the generative prior of text-to-image diffusion model." + } + ] + } + ], + "index": 19 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": "Ablation on customization. During customization, we fine-tune the up-blocks of TryonNet (i.e., decoder layers). Here, we provide an ablation study on the choice of fine-tuning layer for customization. We compare default IDM-VTON (i.e., no customization), fine-tuning all UNet layers, using low rank adaptation (LoRA) [17], and fine-tuning decoder layers. In Tab. 4, we see that all customization methods improve reconstruction score (LPIPS, SSIM) compared to default IDM-VTON, while showing comparable performance in CLIP image similarity score. We see that fine-tuning decoder layers perform the best among customization methods, while fine-tuning all UNet layers shows comparable performance. While finetuning with LoRA is more efficient, we find it underperforms than fine-tuning decoder layers." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 263, + 220, + 276 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 263, + 220, + 276 + ], + "spans": [ + { + "bbox": [ + 132, + 263, + 220, + 276 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 285, + 482, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 285, + 482, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 482, + 430 + ], + "type": "text", + "content": "In this paper, we present IDM-VTON, a novel design of diffusion models for authentic virtual try-on, particularly in the wild scenario. We incorporate two separate modules to encode the garment image, i.e., visual encoder and parallel UNet, which effectively encode high-level semantics and low-level features to the base UNet, respectively. In order to improve the virtual try-on on real world scenario, we propose to customize our model by fine-tuning the decoder layers of UNet given a pair of garment-person images. We also leverage detailed natural language descriptions for garments, which help generating authentic virtual try-on images. Extensive experiments on various datasets show the superiority of our method over prior works in both preserving details of garment, and generating high fidelity images. In particular, we demonstrate the potential of our method in virtual try-on in the wild." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 444, + 482, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 444, + 482, + 492 + ], + "spans": [ + { + "bbox": [ + 130, + 444, + 482, + 492 + ], + "type": "text", + "content": "Potential negative impact. The virtual try-on technology comes with benefits and pitfalls - the tool could be helpful for users to effectively visualize their look with given garment. However, it requires the users to be responsible for protecting the ownership, and avoid malicious use." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 507, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 507, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 507, + 482, + 579 + ], + "type": "text", + "content": "Limitation. IDM-VTON struggles to preserve human attributes on masked regions such as tattoos or skin moles. One can design a method for conditioning those human attributes of when generating try-on images. Also, while we exploit the prior knowledge of T2I diffusion models by providing comprehensive captions, exploring broader applications to fully utilize the prior, such as controlling garment generation through textual prompts, is left as future work." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 595, + 242, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 595, + 242, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 595, + 242, + 609 + ], + "type": "text", + "content": "Acknowledgement" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00075 Artificial Intelligence Graduate School Program(KAIST); No.RS-2021-II212068, Artificial Intelligence Innovation Hub)." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 139, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "type": "text", + "content": "1. Avrahami, O., Hayes, T., Gafni, O., Gupta, S., Taigman, Y., Parikh, D., Lischinski, D., Fried, O., Yin, X.: Spatext: Spatio-textual representation for controllable image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18370-18380 (2023) 20" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 184, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 481, + 215 + ], + "type": "text", + "content": "2. Chari, P., Ma, S., Ostashev, D., Kadambi, A., Krishnan, G., Wang, J., Aberman, K.: Personalized restoration via dual-pivot tuning. arXiv preprint arXiv:2312.17234 (2023) 4, 7" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 217, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 481, + 258 + ], + "type": "text", + "content": "3. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14131-14140 (2021) 1, 2, 3, 6, 7, 8, 9" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 260, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 260, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 260, + 481, + 293 + ], + "type": "text", + "content": "4. Cui, A., Mahajan, J., Shah, V., Gomathinayagam, P., Lazebnik, S.: Street tryon: Learning in-the-wild virtual try-on from unpaired person images. arXiv preprint arXiv:2311.16094 (2023) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 293, + 481, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 293, + 481, + 326 + ], + "spans": [ + { + "bbox": [ + 138, + 293, + 481, + 326 + ], + "type": "text", + "content": "5. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 326, + 481, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 326, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 138, + 326, + 481, + 358 + ], + "type": "text", + "content": "6. Ge, C., Song, Y., Ge, Y., Yang, H., Liu, W., Luo, P.: Disentangled cycle consistency for highly-realistic virtual try-on. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16928-16937 (2021) 2, 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 359, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 359, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 138, + 359, + 481, + 392 + ], + "type": "text", + "content": "7. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 8485-8493 (2021) 2, 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 392, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 481, + 424 + ], + "type": "text", + "content": "8. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139-144 (2020) 2, 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 425, + 481, + 467 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 425, + 481, + 467 + ], + "spans": [ + { + "bbox": [ + 138, + 425, + 481, + 467 + ], + "type": "text", + "content": "9. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: Proceedings of the 31st ACM International Conference on Multimedia. pp. 7599-7607 (2023) 2, 3, 6, 7, 9, 11" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 468, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 481, + 501 + ], + "type": "text", + "content": "0. Güler, R.A., Neverova, N., Kokkinos, I.: Densesepose: Dense human pose estimation in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7297-7306 (2018) 5, 6" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 501, + 481, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 501, + 481, + 523 + ], + "spans": [ + { + "bbox": [ + 138, + 501, + 481, + 523 + ], + "type": "text", + "content": "1. Han, L., Li, Y., Zhang, H., Milanfar, P., Metaxas, D., Yang, F.: Svdiff: Compact parameter space for diffusion fine-tuning. arXiv preprint arXiv:2303.11305 (2023) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "type": "text", + "content": "2. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 7543-7552 (2018) 2" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 555, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 555, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 138, + 555, + 481, + 588 + ], + "type": "text", + "content": "3. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 10" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 589, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 589, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 138, + 589, + 481, + 610 + ], + "type": "text", + "content": "4. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020) 2, 3, 4" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 611, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 481, + 632 + ], + "type": "text", + "content": "5. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 4, 20" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "type": "text", + "content": "6. Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., De Laroussilhe, Q., Gesmundo, A., Attariyan, M., Gelly, S.: Parameter-efficient transfer learning for nlp. In: International Conference on Machine Learning. pp. 2790-2799. PMLR (2019) 4" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "17. Hu, E.J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W.: Lora: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021) 4, 13, 14" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 481, + 181 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 481, + 181 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 481, + 181 + ], + "type": "text", + "content": "18. Hu, L., Gao, X., Zhang, P., Sun, K., Zhang, B., Bo, L.: Animate anyone: Consistent and controllable image-to-video synthesis for character animation. arXiv preprint arXiv:2311.17117 (2023) 7" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 181, + 481, + 202 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 181, + 481, + 202 + ], + "spans": [ + { + "bbox": [ + 132, + 181, + 481, + 202 + ], + "type": "text", + "content": "19. Hyvarinen, A., Dayan, P.: Estimation of non-normalized statistical models by score matching. Journal of Machine Learning Research 6(4) (2005) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 202, + 481, + 255 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 202, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 132, + 202, + 481, + 255 + ], + "type": "text", + "content": "20. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below. 6" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 256, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 256, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 256, + 481, + 300 + ], + "type": "text", + "content": "21. Issenhuth, T., Mary, J., Calauzenes, C.: Do not mask what you do not need to mask: a parser-free virtual try-on. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 619-635. Springer (2020) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 481, + 332 + ], + "type": "text", + "content": "22. Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4401-4410 (2019) 2" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 332, + 481, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 332, + 481, + 365 + ], + "spans": [ + { + "bbox": [ + 132, + 332, + 481, + 365 + ], + "type": "text", + "content": "23. Kim, J., Gu, G., Park, M., Park, S., Choo, J.: Stableviton: Learning semantic correspondence with latent diffusion model for virtual try-on. arXiv preprint arXiv:2312.01725 (2023) 2, 3, 6, 7, 9, 11, 12, 20" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 365, + 481, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 481, + 385 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 481, + 385 + ], + "type": "text", + "content": "24. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 9, 20" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 385, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 385, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 385, + 481, + 418 + ], + "type": "text", + "content": "25. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 418, + 481, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 481, + 449 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 481, + 449 + ], + "type": "text", + "content": "26. Lee, K., Kwak, S., Sohn, K., Shin, J.: Direct consistency optimization for compositional text-to-image personalization. arXiv preprint arXiv:2402.12004 (2024) 4, 7" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 449, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 449, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 132, + 449, + 481, + 482 + ], + "type": "text", + "content": "27. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: European Conference on Computer Vision. pp. 204-219. Springer (2022) 2, 3, 9, 11" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "type": "text", + "content": "28. Li, N., Liu, Q., Singh, K.K., Wang, Y., Zhang, J., Plummer, B.A., Lin, Z.: Unihuman: A unified model for editing human images in the wild. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2039-2048 (2024) 2" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "text", + "content": "29. Men, Y., Mao, Y., Jiang, Y., Ma, W.Y., Lian, Z.: Controllable person image synthesis with attribute-decomposed gan. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5084-5093 (2020) 2, 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 557, + 481, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 481, + 589 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 481, + 589 + ], + "type": "text", + "content": "30. Meng, C., He, Y., Song, Y., Song, J., Wu, J., Zhu, J.Y., Ermon, S.: Sdedit: Guided image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073 (2021) 2" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 481, + 621 + ], + "type": "text", + "content": "31. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladivton: Latent diffusion textual-inversion enhanced virtual try-on. arXiv preprint arXiv:2305.13501 (2023) 2, 3, 6, 7, 9, 11, 13" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 621, + 481, + 665 + ], + "type": "text", + "content": "32. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2231-2235 (2022) 1, 3, 7, 8, 9" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "33. Mou, C., Wang, X., Xie, L., Wu, Y., Zhang, J., Qi, Z., Shan, Y., Qie, X.: T2i-adapter: Learning adapters to dig out more controllable ability for text-to-image diffusion models. arXiv preprint arXiv:2302.08453 (2023) 3" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 184 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 184 + ], + "type": "text", + "content": "34. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021) 2, 3, 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 185, + 482, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 185, + 482, + 217 + ], + "spans": [ + { + "bbox": [ + 130, + 185, + 482, + 217 + ], + "type": "text", + "content": "35. Ning, S., Wang, D., Qin, Y., Jin, Z., Wang, B., Han, X.: Picture: Photorealistic virtual try-on from unconstrained designs. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6976-6985 (2024) 2" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 218, + 482, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 218, + 482, + 251 + ], + "spans": [ + { + "bbox": [ + 130, + 218, + 482, + 251 + ], + "type": "text", + "content": "36. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023) 2, 6, 7, 8" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 251, + 482, + 296 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 482, + 296 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 482, + 296 + ], + "type": "text", + "content": "37. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) 4, 5, 10, 11" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 297, + 482, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 297, + 482, + 329 + ], + "spans": [ + { + "bbox": [ + 130, + 297, + 482, + 329 + ], + "type": "text", + "content": "38. Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., Liu, P.J.: Exploring the limits of transfer learning with a unified text-to-text transformer. The Journal of Machine Learning Research 21(1), 5485-5551 (2020) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 330, + 482, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 330, + 482, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 330, + 482, + 363 + ], + "type": "text", + "content": "39. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) 2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 364, + 482, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 482, + 407 + ], + "type": "text", + "content": "40. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) 2, 3, 4, 5, 6" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 408, + 482, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 408, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 408, + 482, + 453 + ], + "type": "text", + "content": "41. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 453, + 482, + 496 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 482, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 482, + 496 + ], + "type": "text", + "content": "42. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22500-22510 (2023) 4, 7" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 498, + 482, + 541 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 541 + ], + "type": "text", + "content": "43. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) 2, 3, 4" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 542, + 482, + 575 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 542, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 130, + 542, + 482, + 575 + ], + "type": "text", + "content": "44. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 576, + 482, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 576, + 482, + 609 + ], + "spans": [ + { + "bbox": [ + 130, + 576, + 482, + 609 + ], + "type": "text", + "content": "45. Sohn, K., Ruiz, N., Lee, K., Chin, D.C., Blok, I., Chang, H., Barber, J., Jiang, L., Entis, G., Li, Y., et al.: Styledrop: Text-to-image generation in any style. arXiv preprint arXiv:2306.00983 (2023) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 609, + 482, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 609, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 609, + 482, + 632 + ], + "type": "text", + "content": "46. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) 2" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 632, + 482, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 482, + 665 + ], + "type": "text", + "content": "47. Song, Y., Sohl-Dickstein, J., Kingma, D.P., Kumar, A., Ermon, S., Poole, B.: Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456 (2020) 3, 4" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 588 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "48. Tang, L., Ruiz, N., Chu, Q., Li, Y., Holynski, A., Jacobs, D.E., Hariharan, B., Pritch, Y., Wadhwa, N., Aberman, K., et al.: Realfill: Reference-driven generation for authentic image completion. arXiv preprint arXiv:2309.16668 (2023) 4, 7" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 376, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 376, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 376, + 160 + ], + "type": "text", + "content": "49. team, D.: Stable diffusion xl inpainting. link (2023) 6, 8" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 481, + 194 + ], + "type": "text", + "content": "50. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. Advances in neural information processing systems 30 (2017) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "51. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: Proceedings of the European conference on computer vision (ECCV). pp. 589-604 (2018) 2" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 227, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 258 + ], + "type": "text", + "content": "52. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind superresolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021) 10" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 481, + 292 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 292 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 292 + ], + "type": "text", + "content": "53. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 10" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "text", + "content": "54. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23550-23559 (2023) 2, 3, 9" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 368 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 368 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 368 + ], + "type": "text", + "content": "55. Xu, Y., Gu, T., Chen, W., Chen, C.: Ootdiffusion: Outfitting fusion based latent diffusion for controllable virtual try-on. arXiv preprint arXiv:2403.01779 (2024) 21, 22, 23" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 413 + ], + "type": "text", + "content": "56. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18381-18391 (2023) 3, 6" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 413, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 481, + 445 + ], + "type": "text", + "content": "57. Ye, H., Zhang, J., Liu, S., Han, X., Yang, W.: Ip-adapter: Text compatible image prompt adapter for text-to-image diffusion models. arXiv preprint arXiv:2308.06721 (2023) 3, 5, 6, 8" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "text", + "content": "58. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "text", + "content": "59. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 586-595 (2018) 10" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "type": "text", + "content": "60. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unictrlnet: All-in-one control to text-to-image diffusion models. Advances in Neural Information Processing Systems 36 (2024) 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 544, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 481, + 588 + ], + "type": "text", + "content": "61. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4606-4615 (2023) 3" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 266, + 113, + 350, + 133 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 266, + 113, + 350, + 133 + ], + "spans": [ + { + "bbox": [ + 266, + 113, + 350, + 133 + ], + "type": "text", + "content": "Appendix" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 148, + 297, + 162 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 148, + 297, + 162 + ], + "spans": [ + { + "bbox": [ + 132, + 148, + 297, + 162 + ], + "type": "text", + "content": "A Implementation Details" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 265, + 184 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 265, + 184 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 265, + 184 + ], + "type": "text", + "content": "A.1 In-the-Wild Dataset" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 137, + 210, + 194, + 285 + ], + "blocks": [ + { + "bbox": [ + 137, + 210, + 194, + 285 + ], + "lines": [ + { + "bbox": [ + 137, + 210, + 194, + 285 + ], + "spans": [ + { + "bbox": [ + 137, + 210, + 194, + 285 + ], + "type": "image", + "image_path": "38070a8c94a34774734298a924b509fb64649ab55c572c7a939ca65b861fb55d.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 202, + 211, + 477, + 285 + ], + "blocks": [ + { + "bbox": [ + 202, + 211, + 477, + 285 + ], + "lines": [ + { + "bbox": [ + 202, + 211, + 477, + 285 + ], + "spans": [ + { + "bbox": [ + 202, + 211, + 477, + 285 + ], + "type": "image", + "image_path": "7b1d725fc7bb03b447ac12b05d7a0c04573d8320569962bd0197c860b5dab1ee.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 137, + 289, + 193, + 364 + ], + "blocks": [ + { + "bbox": [ + 137, + 289, + 193, + 364 + ], + "lines": [ + { + "bbox": [ + 137, + 289, + 193, + 364 + ], + "spans": [ + { + "bbox": [ + 137, + 289, + 193, + 364 + ], + "type": "image", + "image_path": "9e15a2e00988885208cf68111574899f4fd1cb48d23a8ddef3768585a73aa02e.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 203, + 289, + 477, + 364 + ], + "blocks": [ + { + "bbox": [ + 203, + 289, + 477, + 364 + ], + "lines": [ + { + "bbox": [ + 203, + 289, + 477, + 364 + ], + "spans": [ + { + "bbox": [ + 203, + 289, + 477, + 364 + ], + "type": "image", + "image_path": "2f9f62fc74cf4866ec3631d5f32b9e2c6e1f4b48fc0010403554cb29119c4974.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 137, + 366, + 193, + 441 + ], + "blocks": [ + { + "bbox": [ + 137, + 366, + 193, + 441 + ], + "lines": [ + { + "bbox": [ + 137, + 366, + 193, + 441 + ], + "spans": [ + { + "bbox": [ + 137, + 366, + 193, + 441 + ], + "type": "image", + "image_path": "232dc48ebf557d5e59aca56ee316f4a1ab873a31e888cde202a0aac167022ae4.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 203, + 367, + 477, + 441 + ], + "blocks": [ + { + "bbox": [ + 203, + 367, + 477, + 441 + ], + "lines": [ + { + "bbox": [ + 203, + 367, + 477, + 441 + ], + "spans": [ + { + "bbox": [ + 203, + 367, + 477, + 441 + ], + "type": "image", + "image_path": "c78aa6fdfdaa4fe5b80c8bc82cd538126ffedf889e52bce128abeb0b39bd3cb6.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 137, + 443, + 193, + 518 + ], + "blocks": [ + { + "bbox": [ + 137, + 443, + 193, + 518 + ], + "lines": [ + { + "bbox": [ + 137, + 443, + 193, + 518 + ], + "spans": [ + { + "bbox": [ + 137, + 443, + 193, + 518 + ], + "type": "image", + "image_path": "161f9af84c21dd93983d2a31a21e1235c9f627356816332c365099dad518a881.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 527, + 482, + 550 + ], + "lines": [ + { + "bbox": [ + 130, + 527, + 482, + 550 + ], + "spans": [ + { + "bbox": [ + 130, + 527, + 482, + 550 + ], + "type": "text", + "content": "Fig. 8: Examples of In-the-Wild dataset. We collect pairs of garment and human wearing the garment." + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 203, + 444, + 477, + 517 + ], + "blocks": [ + { + "bbox": [ + 203, + 444, + 477, + 517 + ], + "lines": [ + { + "bbox": [ + 203, + 444, + 477, + 517 + ], + "spans": [ + { + "bbox": [ + 203, + 444, + 477, + 517 + ], + "type": "image", + "image_path": "baecaed37477b1db1eb2183107d39af17bc7e0be9a9671134b40960c0ec98e1d.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 575, + 482, + 648 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 575, + 482, + 648 + ], + "spans": [ + { + "bbox": [ + 130, + 575, + 482, + 648 + ], + "type": "text", + "content": "In-the-Wild dataset comprises multiple human images wearing each target garment. Images of garment are collected from MLB online shopping mall4 and images of human wearing each garment are gathered from social media platforms like Instagram. As shown in Fig. 8, the human images exhibit diverse backgrounds, ranging from parks and buildings to snowy landscapes. For preprocessing, we employ center cropping on the human images to achieve resolutions of " + }, + { + "bbox": [ + 130, + 575, + 482, + 648 + ], + "type": "inline_equation", + "content": "1024 \\times 768" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 103 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 652, + 329, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 329, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 329, + 666 + ], + "type": "text", + "content": "4 https://www.mlb-korea.com/main/mall/view" + } + ] + } + ], + "index": 15 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 115, + 474, + 182 + ], + "blocks": [ + { + "bbox": [ + 138, + 115, + 474, + 182 + ], + "lines": [ + { + "bbox": [ + 138, + 115, + 474, + 182 + ], + "spans": [ + { + "bbox": [ + 138, + 115, + 474, + 182 + ], + "type": "image", + "image_path": "292eb4efa140a52b1291f8ca4aa688b016680609a85e6634b8e20a8aa94bd25a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 190, + 482, + 224 + ], + "lines": [ + { + "bbox": [ + 131, + 190, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 131, + 190, + 482, + 224 + ], + "type": "text", + "content": "Fig. 9: Illustration of generating detailed captions of garments. We utilize pretrained fashion attribute tagging annotator to extract information of garment and generate detailed captions of the garment based on extracted information." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 247, + 480, + 273 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 247, + 480, + 273 + ], + "spans": [ + { + "bbox": [ + 131, + 247, + 480, + 273 + ], + "type": "text", + "content": "resolutions, while the garment images are resized to the same dimensions for compatible setting." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 290, + 279, + 303 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 290, + 279, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 290, + 279, + 303 + ], + "type": "text", + "content": "A.2 Training and Inference" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "text", + "content": "We train the model using the Adam [24] optimizer with a fixed learning rate of 1e-5 over 130 epochs (63k iterations with batch size of 24). It takes around 40 hours in training with " + }, + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "inline_equation", + "content": "4 \\times \\mathrm{A800}" + }, + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "text", + "content": " GPUs. We apply data augmentations following StableVITON [23], where we apply horizontal flip (with probability 0.5), random affine shifting and scaling (limit of 0.2, with probability 0.5) to the inputs of TryonNet, i.e., " + }, + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_p, \\mathbf{x}_{\\mathrm{pose}}, \\mathbf{x}_m" + }, + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "inline_equation", + "content": "\\mathbf{m}" + }, + { + "bbox": [ + 130, + 311, + 482, + 407 + ], + "type": "text", + "content": ". For customization, we fine-tune our model using the Adam optimizer with a fixed learning rate of 1e-6 for 100 steps. It takes around 2 minutes with a single A800 GPU." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 407, + 482, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 491 + ], + "type": "text", + "content": "During the inference, we generate images using the DDPM scheduler with 30 steps. We set the strength value to 1.0, i.e., denoising begins from random Gaussian noise, to ignore the masked portion of the input image. For classifier-free guidance [15] (CFG), we merge both conditioning, i.e., low-level features " + }, + { + "bbox": [ + 130, + 407, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\mathbf{L}_g" + }, + { + "bbox": [ + 130, + 407, + 482, + 491 + ], + "type": "text", + "content": " from GarmentNet and high-level semantics " + }, + { + "bbox": [ + 130, + 407, + 482, + 491 + ], + "type": "inline_equation", + "content": "\\mathbf{H}_g" + }, + { + "bbox": [ + 130, + 407, + 482, + 491 + ], + "type": "text", + "content": " from IP-Adapter, as these conditions contain features of the same garment image, following SpaText [1]. In specific, the forward is given as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 170, + 500, + 482, + 514 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 170, + 500, + 482, + 514 + ], + "spans": [ + { + "bbox": [ + 170, + 500, + 482, + 514 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; \\mathbf {L} _ {g}, \\mathbf {H} _ {g}, t\\right) = s \\cdot \\left(\\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; \\mathbf {L} _ {g}, \\mathbf {H} _ {g}, t\\right) - \\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; t\\right)\\right) + \\boldsymbol {\\epsilon} _ {\\theta} \\left(\\mathbf {x} _ {t}; t\\right), \\tag {4}", + "image_path": "776b20a2fc8782930424c2e5cc260dd959fb36db529e8b79d4effb845afa0e15.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(\\mathbf{x}_t;\\mathbf{L}_g,\\mathbf{H}_g,t)" + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "text", + "content": " denotes noise prediction with conditions " + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\mathbf{L}_g" + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\mathbf{H}_g" + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(\\mathbf{x}_t;t)" + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "text", + "content": " denotes unconditional noise prediction. We use guidance scale " + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "inline_equation", + "content": "s = 2.0" + }, + { + "bbox": [ + 131, + 522, + 482, + 559 + ], + "type": "text", + "content": ", which works well in practice." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 578, + 326, + 590 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 326, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 326, + 590 + ], + "type": "text", + "content": "A.3 Detailed captioning of garments" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "text", + "content": "We generate detailed captions for each garment to leverage the prior knowledge of T2I diffusion models. We employ OMNIOUS.AI's commercial " + }, + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "inline_equation", + "content": "^{5}" + }, + { + "bbox": [ + 130, + 598, + 482, + 647 + ], + "type": "text", + "content": " fashion attribute tagging annotator, which has been trained with over 1,000 different fashion attributes. The image annotator provides various feature categories present in a" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "20" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 652, + 248, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 248, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 248, + 666 + ], + "type": "text", + "content": "5 https://omnicommerce.ai" + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 19 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": "given image, such as sleeve length and neckline type. We extract three different feature categories: sleeve length, neckline type, and item name, as illustrated in Fig. 9. Subsequently, we generate captions based on this feature information, for example, \"short sleeve off shoulder t-shirts\"." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 155, + 183, + 460, + 505 + ], + "blocks": [ + { + "bbox": [ + 155, + 183, + 460, + 505 + ], + "lines": [ + { + "bbox": [ + 155, + 183, + 460, + 505 + ], + "spans": [ + { + "bbox": [ + 155, + 183, + 460, + 505 + ], + "type": "image", + "image_path": "fb3db19adaaf1c8f85bcfdb52a3e101ff9820f41061d5264996c88d439f9c214.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 513, + 483, + 545 + ], + "lines": [ + { + "bbox": [ + 130, + 513, + 483, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 513, + 483, + 545 + ], + "type": "text", + "content": "Fig. 10: Comparison between IDM-VTON and OOTDiffusion [55] on VITON-HD and DressCode dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 576, + 367, + 590 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 576, + 367, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 576, + 367, + 590 + ], + "type": "text", + "content": "B Comparison with Concurrent Work" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 599, + 482, + 648 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 599, + 482, + 648 + ], + "spans": [ + { + "bbox": [ + 130, + 599, + 482, + 648 + ], + "type": "text", + "content": "We additionally compare IDM-VTON with OOTDiffusion [55], which is a concurrent work on virtual try-on task. We compare each model trained on VITON-HD and DressCode datasets. We use publicly available model checkpoints for generating try-on images of OOTDiffusion6." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "21" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 652, + 316, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 316, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 316, + 665 + ], + "type": "inline_equation", + "content": "^{6}" + }, + { + "bbox": [ + 133, + 652, + 316, + 665 + ], + "type": "text", + "content": " https://github.com/levihsu/OOTDiffusion" + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 20 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 163, + 476, + 225 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 5: Quantitative results of models trained on VITON-HD training dataset and evaluated on VITON-HD and DressCode (upper body) test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 163, + 476, + 225 + ], + "lines": [ + { + "bbox": [ + 136, + 163, + 476, + 225 + ], + "spans": [ + { + "bbox": [ + 136, + 163, + 476, + 225 + ], + "type": "table", + "html": "
Train / TestVITON-HD / VITON-HDVITON-HD / DressCode
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.1200.8466.390.8580.0870.90110.680.852
IDM-VTON (ours)0.1020.8706.290.8830.0620.9208.640.904
", + "image_path": "d9d9186718744ffce05f23b6deffb939324904717461cc1d0afcf7c6656aef76.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 136, + 285, + 476, + 348 + ], + "blocks": [ + { + "bbox": [ + 130, + 236, + 482, + 281 + ], + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 281 + ], + "type": "text", + "content": "Table 6: Quantitative results of models trained on DressCode training dataset and evaluated on VITON-HD and DressCode test dataset. We additionally compare the metric scores of IDM-VTON (ours) with the concurrent work OOTDiffusion [55]." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 285, + 476, + 348 + ], + "lines": [ + { + "bbox": [ + 136, + 285, + 476, + 348 + ], + "spans": [ + { + "bbox": [ + 136, + 285, + 476, + 348 + ], + "type": "table", + "html": "
Train / TestDressCode / DressCodeDressCode / VITON-HD
MethodLPIPS ↓SSIM ↑FID ↓CLIP-I ↑LPIPS ↓SSIM ↑FID ↓CLIP-I ↑
OOTDiffusion [55]0.0880.8854.180.8510.2050.78857.870.677
IDM-VTON (ours)0.0720.9023.620.9130.1290.85912.570.839
", + "image_path": "02671a292f264ba120f1d166b522b3a6e7ca3f601bb1212c95bbece8a2e3a849.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 453 + ], + "type": "text", + "content": "Fig. 10 and Fig. 11 present qualitative comparisons of OOTDiffusion and ours on VITON-HD, DressCode and In-the-Wild dataset. As shown in Fig. 10, we see that IDM-VTON outperforms OOTDiffusion in capturing both high-level semantics and low-level details, and generating more authentic images. In particular, we observe notable improvements of IDM-VTON compared to OOTDiffusion on In-the-Wild dataset, which demonstrates the generalization ability of IDM-VTON." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 453, + 483, + 513 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 483, + 513 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 483, + 513 + ], + "type": "text", + "content": "Tab. 5, Tab. 6 and Tab. 7 show quantitative comparisons between IDM-VTON and OOTDiffusion on VITON-HD, DressCode, and In-the-Wild datasets. One can notify that IDM-VTON outperforms OOTDiffusion on all metrics including image fidelity (FID), and reconstruction of garments (LPIPS, SSIM and CLIP-I), which verifies our claim." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "22" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 21 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 211, + 166, + 400, + 212 + ], + "blocks": [ + { + "bbox": [ + 130, + 127, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 130, + 127, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 127, + 482, + 160 + ], + "type": "text", + "content": "Table 7: Quantitative results on In-the-Wild dataset. We compare IDM-VTON (ours) with the concurrent work OOTDiffusion [55] on In-the-Wild dataset to assess the generalization capabilities. We report LPIPS, SSIM and CLIP image similarity scores." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 211, + 166, + 400, + 212 + ], + "lines": [ + { + "bbox": [ + 211, + 166, + 400, + 212 + ], + "spans": [ + { + "bbox": [ + 211, + 166, + 400, + 212 + ], + "type": "table", + "html": "
MethodLPIPS ↓SSIM ↑CLIP-I ↑
OOTDiffusion [55]0.2030.7520.861
IDM-VTON (ours)0.1640.7950.901
", + "image_path": "81e0096351f209da473cc66010ffe9ccdefa3c87e5ef1f44beead88e90bc6067.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 140, + 263, + 172, + 345 + ], + "blocks": [ + { + "bbox": [ + 144, + 249, + 166, + 259 + ], + "lines": [ + { + "bbox": [ + 144, + 249, + 166, + 259 + ], + "spans": [ + { + "bbox": [ + 144, + 249, + 166, + 259 + ], + "type": "text", + "content": "Input" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 140, + 263, + 172, + 345 + ], + "lines": [ + { + "bbox": [ + 140, + 263, + 172, + 345 + ], + "spans": [ + { + "bbox": [ + 140, + 263, + 172, + 345 + ], + "type": "image", + "image_path": "88147a737f5b865c3e8da7372a0007bc45feaf830c165c1a28e18e7174faba09.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 176, + 263, + 237, + 344 + ], + "blocks": [ + { + "bbox": [ + 182, + 249, + 230, + 258 + ], + "lines": [ + { + "bbox": [ + 182, + 249, + 230, + 258 + ], + "spans": [ + { + "bbox": [ + 182, + 249, + 230, + 258 + ], + "type": "text", + "content": "OOTDiffusion" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 176, + 263, + 237, + 344 + ], + "lines": [ + { + "bbox": [ + 176, + 263, + 237, + 344 + ], + "spans": [ + { + "bbox": [ + 176, + 263, + 237, + 344 + ], + "type": "image", + "image_path": "7eeb0f4080c40dbc65dac8af01dc27d2dd90458785cae41527dbaf631ca3ea3f.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 241, + 263, + 302, + 345 + ], + "blocks": [ + { + "bbox": [ + 241, + 249, + 301, + 258 + ], + "lines": [ + { + "bbox": [ + 241, + 249, + 301, + 258 + ], + "spans": [ + { + "bbox": [ + 241, + 249, + 301, + 258 + ], + "type": "text", + "content": "IDM-VTON (Ours)" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 241, + 263, + 302, + 345 + ], + "lines": [ + { + "bbox": [ + 241, + 263, + 302, + 345 + ], + "spans": [ + { + "bbox": [ + 241, + 263, + 302, + 345 + ], + "type": "image", + "image_path": "307ba17b8eae42cdfd47ce8df6f8452b9a8716c8fab08154b40047d5b2771094.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 312, + 263, + 345, + 345 + ], + "blocks": [ + { + "bbox": [ + 319, + 250, + 337, + 258 + ], + "lines": [ + { + "bbox": [ + 319, + 250, + 337, + 258 + ], + "spans": [ + { + "bbox": [ + 319, + 250, + 337, + 258 + ], + "type": "text", + "content": "Input" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 312, + 263, + 345, + 345 + ], + "lines": [ + { + "bbox": [ + 312, + 263, + 345, + 345 + ], + "spans": [ + { + "bbox": [ + 312, + 263, + 345, + 345 + ], + "type": "image", + "image_path": "fabb79bd274c38e7680c85f1337449ce655f6e42004cdce51eb9ca0c6ac2cee8.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 347, + 263, + 408, + 345 + ], + "blocks": [ + { + "bbox": [ + 356, + 249, + 401, + 258 + ], + "lines": [ + { + "bbox": [ + 356, + 249, + 401, + 258 + ], + "spans": [ + { + "bbox": [ + 356, + 249, + 401, + 258 + ], + "type": "text", + "content": "OOTDiffusion" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 347, + 263, + 408, + 345 + ], + "lines": [ + { + "bbox": [ + 347, + 263, + 408, + 345 + ], + "spans": [ + { + "bbox": [ + 347, + 263, + 408, + 345 + ], + "type": "image", + "image_path": "9422680077d1fb5492929fa5a5c28ac117e84c9df1b00962c10f02baf6fdc666.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 411, + 263, + 473, + 345 + ], + "blocks": [ + { + "bbox": [ + 411, + 249, + 471, + 258 + ], + "lines": [ + { + "bbox": [ + 411, + 249, + 471, + 258 + ], + "spans": [ + { + "bbox": [ + 411, + 249, + 471, + 258 + ], + "type": "text", + "content": "IDM-VTON (Ours)" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 411, + 263, + 473, + 345 + ], + "lines": [ + { + "bbox": [ + 411, + 263, + 473, + 345 + ], + "spans": [ + { + "bbox": [ + 411, + 263, + 473, + 345 + ], + "type": "image", + "image_path": "ae18ec398c6a79517efac2d5ef5270715ec245826255f84f17ce28028f889515.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + } + ], + "index": 15 + }, + { + "type": "image", + "bbox": [ + 140, + 346, + 171, + 429 + ], + "blocks": [ + { + "bbox": [ + 140, + 346, + 171, + 429 + ], + "lines": [ + { + "bbox": [ + 140, + 346, + 171, + 429 + ], + "spans": [ + { + "bbox": [ + 140, + 346, + 171, + 429 + ], + "type": "image", + "image_path": "7d8cad5c38d1b64c59a730220378c161a89071798e144f17ff02abf762e0c255.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 177, + 346, + 237, + 428 + ], + "blocks": [ + { + "bbox": [ + 177, + 346, + 237, + 428 + ], + "lines": [ + { + "bbox": [ + 177, + 346, + 237, + 428 + ], + "spans": [ + { + "bbox": [ + 177, + 346, + 237, + 428 + ], + "type": "image", + "image_path": "38afecafa40c5e9904d80d8980c1a741a207022fe3ccdb40006dda762fb48400.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 241, + 346, + 302, + 428 + ], + "blocks": [ + { + "bbox": [ + 241, + 346, + 302, + 428 + ], + "lines": [ + { + "bbox": [ + 241, + 346, + 302, + 428 + ], + "spans": [ + { + "bbox": [ + 241, + 346, + 302, + 428 + ], + "type": "image", + "image_path": "867b0d34451c361e1442a5642ea66937ef7b476853d66c5f20c34d10c0ce6edb.jpg" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_body" + } + ], + "index": 18 + }, + { + "type": "image", + "bbox": [ + 312, + 346, + 345, + 429 + ], + "blocks": [ + { + "bbox": [ + 312, + 346, + 345, + 429 + ], + "lines": [ + { + "bbox": [ + 312, + 346, + 345, + 429 + ], + "spans": [ + { + "bbox": [ + 312, + 346, + 345, + 429 + ], + "type": "image", + "image_path": "b4a7368cc04b82fd388a780be611a8ba78633dbf22cd7cb8cab2cb7eea8ce5c4.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 347, + 346, + 408, + 429 + ], + "blocks": [ + { + "bbox": [ + 347, + 346, + 408, + 429 + ], + "lines": [ + { + "bbox": [ + 347, + 346, + 408, + 429 + ], + "spans": [ + { + "bbox": [ + 347, + 346, + 408, + 429 + ], + "type": "image", + "image_path": "514c840f53977cc04c789a460824720d57d78ea7bd0684a725d58842ad9855b3.jpg" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_body" + } + ], + "index": 20 + }, + { + "type": "image", + "bbox": [ + 411, + 346, + 473, + 429 + ], + "blocks": [ + { + "bbox": [ + 411, + 346, + 473, + 429 + ], + "lines": [ + { + "bbox": [ + 411, + 346, + 473, + 429 + ], + "spans": [ + { + "bbox": [ + 411, + 346, + 473, + 429 + ], + "type": "image", + "image_path": "74c78de813196823cad3f1c5943452b315ab6c566be485ac758e94161a8bb614.jpg" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_body" + } + ], + "index": 21 + }, + { + "type": "image", + "bbox": [ + 140, + 430, + 172, + 513 + ], + "blocks": [ + { + "bbox": [ + 140, + 430, + 172, + 513 + ], + "lines": [ + { + "bbox": [ + 140, + 430, + 172, + 513 + ], + "spans": [ + { + "bbox": [ + 140, + 430, + 172, + 513 + ], + "type": "image", + "image_path": "cccef36426bed0e85c11ea00e40afb1934a51936e63ce438fce47b85eccfc836.jpg" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_body" + } + ], + "index": 22 + }, + { + "type": "image", + "bbox": [ + 176, + 430, + 237, + 512 + ], + "blocks": [ + { + "bbox": [ + 176, + 430, + 237, + 512 + ], + "lines": [ + { + "bbox": [ + 176, + 430, + 237, + 512 + ], + "spans": [ + { + "bbox": [ + 176, + 430, + 237, + 512 + ], + "type": "image", + "image_path": "2dfdbe41b2fa7f7dd034d5051658ba42658819f445d59f6f80cd9eaad6bda05e.jpg" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_body" + } + ], + "index": 23 + }, + { + "type": "image", + "bbox": [ + 241, + 430, + 302, + 512 + ], + "blocks": [ + { + "bbox": [ + 241, + 430, + 302, + 512 + ], + "lines": [ + { + "bbox": [ + 241, + 430, + 302, + 512 + ], + "spans": [ + { + "bbox": [ + 241, + 430, + 302, + 512 + ], + "type": "image", + "image_path": "0dd1fd8b56fb2fb77aa6057db06c226c26eb9cf2cca771ce163d60e272647f02.jpg" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_body" + } + ], + "index": 24 + }, + { + "type": "image", + "bbox": [ + 313, + 430, + 345, + 513 + ], + "blocks": [ + { + "bbox": [ + 313, + 430, + 345, + 513 + ], + "lines": [ + { + "bbox": [ + 313, + 430, + 345, + 513 + ], + "spans": [ + { + "bbox": [ + 313, + 430, + 345, + 513 + ], + "type": "image", + "image_path": "7f440d978f1d835b2fa0cdd7d7bf211b62e61e4008c2e57f6a5ba08b65fb7663.jpg" + } + ] + } + ], + "index": 25, + "angle": 0, + "type": "image_body" + } + ], + "index": 25 + }, + { + "type": "image", + "bbox": [ + 348, + 430, + 408, + 512 + ], + "blocks": [ + { + "bbox": [ + 348, + 430, + 408, + 512 + ], + "lines": [ + { + "bbox": [ + 348, + 430, + 408, + 512 + ], + "spans": [ + { + "bbox": [ + 348, + 430, + 408, + 512 + ], + "type": "image", + "image_path": "ffa0b47f52c0d18ba8c5354cd323eebd3e852884c9984a17bb97037299206a68.jpg" + } + ] + } + ], + "index": 26, + "angle": 0, + "type": "image_body" + } + ], + "index": 26 + }, + { + "type": "image", + "bbox": [ + 411, + 431, + 473, + 512 + ], + "blocks": [ + { + "bbox": [ + 411, + 431, + 473, + 512 + ], + "lines": [ + { + "bbox": [ + 411, + 431, + 473, + 512 + ], + "spans": [ + { + "bbox": [ + 411, + 431, + 473, + 512 + ], + "type": "image", + "image_path": "a5d8a1de905d61ad8027baec0d2d15d6774f2f4f7cebfa1b757dd6e41575866b.jpg" + } + ] + } + ], + "index": 27, + "angle": 0, + "type": "image_body" + } + ], + "index": 27 + }, + { + "type": "image", + "bbox": [ + 140, + 514, + 172, + 596 + ], + "blocks": [ + { + "bbox": [ + 140, + 514, + 172, + 596 + ], + "lines": [ + { + "bbox": [ + 140, + 514, + 172, + 596 + ], + "spans": [ + { + "bbox": [ + 140, + 514, + 172, + 596 + ], + "type": "image", + "image_path": "f4d11feb48c897efd7aef02cc854a3a261d99a302e4f0b81bd4ff7ca69ac378e.jpg" + } + ] + } + ], + "index": 28, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 605, + 482, + 648 + ], + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 648 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 648 + ], + "type": "text", + "content": "Fig. 11: Comparison between IDM-VTON and OOTDiffusion [55] on In-the-Wild dataset. We provide visual comparison results on In-the-Wild dataset. Both methods are trained on VITON-HD training dataset. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 34, + "angle": 0, + "type": "image_caption" + } + ], + "index": 28 + }, + { + "type": "image", + "bbox": [ + 176, + 514, + 237, + 596 + ], + "blocks": [ + { + "bbox": [ + 176, + 514, + 237, + 596 + ], + "lines": [ + { + "bbox": [ + 176, + 514, + 237, + 596 + ], + "spans": [ + { + "bbox": [ + 176, + 514, + 237, + 596 + ], + "type": "image", + "image_path": "347164352941c354ef70d86d4ed005721e8e0b032992bdb48a7f203ce5eb2e2b.jpg" + } + ] + } + ], + "index": 29, + "angle": 0, + "type": "image_body" + } + ], + "index": 29 + }, + { + "type": "image", + "bbox": [ + 241, + 514, + 302, + 596 + ], + "blocks": [ + { + "bbox": [ + 241, + 514, + 302, + 596 + ], + "lines": [ + { + "bbox": [ + 241, + 514, + 302, + 596 + ], + "spans": [ + { + "bbox": [ + 241, + 514, + 302, + 596 + ], + "type": "image", + "image_path": "c036d099157d7eae1b2cd892ea288cf42495da47a085ffb3f9de1d5034d8bf96.jpg" + } + ] + } + ], + "index": 30, + "angle": 0, + "type": "image_body" + } + ], + "index": 30 + }, + { + "type": "image", + "bbox": [ + 313, + 514, + 345, + 596 + ], + "blocks": [ + { + "bbox": [ + 313, + 514, + 345, + 596 + ], + "lines": [ + { + "bbox": [ + 313, + 514, + 345, + 596 + ], + "spans": [ + { + "bbox": [ + 313, + 514, + 345, + 596 + ], + "type": "image", + "image_path": "c2ab04002d27ee60a246f2ea2fe78e4632c00606a4f2bba27e0a196aa3a39443.jpg" + } + ] + } + ], + "index": 31, + "angle": 0, + "type": "image_body" + } + ], + "index": 31 + }, + { + "type": "image", + "bbox": [ + 347, + 514, + 408, + 596 + ], + "blocks": [ + { + "bbox": [ + 347, + 514, + 408, + 596 + ], + "lines": [ + { + "bbox": [ + 347, + 514, + 408, + 596 + ], + "spans": [ + { + "bbox": [ + 347, + 514, + 408, + 596 + ], + "type": "image", + "image_path": "24737bee5539aa587cb52d6e573ab27d658a06eceb72771eb41899babdd0ab66.jpg" + } + ] + } + ], + "index": 32, + "angle": 0, + "type": "image_body" + } + ], + "index": 32 + }, + { + "type": "image", + "bbox": [ + 411, + 514, + 473, + 596 + ], + "blocks": [ + { + "bbox": [ + 411, + 514, + 473, + 596 + ], + "lines": [ + { + "bbox": [ + 411, + 514, + 473, + 596 + ], + "spans": [ + { + "bbox": [ + 411, + 514, + 473, + 596 + ], + "type": "image", + "image_path": "6bb076ceba9a194a9eb1f5358d6834d6efb1162e327c7887a23a6d153dee2998.jpg" + } + ] + } + ], + "index": 33, + "angle": 0, + "type": "image_body" + } + ], + "index": 33 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "23" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 22 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 225, + 478, + 494 + ], + "blocks": [ + { + "bbox": [ + 134, + 225, + 478, + 494 + ], + "lines": [ + { + "bbox": [ + 134, + 225, + 478, + 494 + ], + "spans": [ + { + "bbox": [ + 134, + 225, + 478, + 494 + ], + "type": "image", + "image_path": "ff5da5fe2f5784de1abb73537c82263fbd852d143ff85ac5c0054489789e3eb4.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 508, + 482, + 563 + ], + "lines": [ + { + "bbox": [ + 132, + 508, + 482, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 508, + 482, + 563 + ], + "type": "text", + "content": "Fig. 12: Qualitative comparison on VITON-HD and DressCode dataset. As we observed in our quantitative analysis, GAN-based methods generally struggle to generate high-fidelity images introducing non-desirable distortions (e.g., non-realistic body and arms) while diffusion-based methods fail to capture low-level features or high-level semantics. All methods are trained on VITON-HD training data." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "24" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 23 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 221, + 478, + 518 + ], + "blocks": [ + { + "bbox": [ + 134, + 221, + 478, + 518 + ], + "lines": [ + { + "bbox": [ + 134, + 221, + 478, + 518 + ], + "spans": [ + { + "bbox": [ + 134, + 221, + 478, + 518 + ], + "type": "image", + "image_path": "d3f5c0f19516de2f793e7eccad0723b378e6b3bd5805a9aae4671c5e0706db18.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 521, + 482, + 566 + ], + "lines": [ + { + "bbox": [ + 132, + 521, + 482, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 521, + 482, + 566 + ], + "type": "text", + "content": "Fig. 13: Qualitative comparison on In-the-Wild dataset. While baselines fail to generate natural images or capture the details of clothing, IDM-VTON produces realistic images and preserves fine details effectively. All methods are trained on VITON-HD training data." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "25" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 24 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 144, + 473, + 601 + ], + "blocks": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "lines": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "spans": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "type": "image", + "image_path": "14fdf3e2e3e600a983f6438ab0c8b5a167204e91750cfe8ffd9b0f1f0b68398e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "lines": [ + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "type": "text", + "content": "Fig. 14: Try-on results on VITON-HD test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "26" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 25 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 144, + 471, + 601 + ], + "blocks": [ + { + "bbox": [ + 141, + 144, + 471, + 601 + ], + "lines": [ + { + "bbox": [ + 141, + 144, + 471, + 601 + ], + "spans": [ + { + "bbox": [ + 141, + 144, + 471, + 601 + ], + "type": "image", + "image_path": "f61ad4b56344445bb5743d79c431d5382f2f55214b11292453d8ca4a2e4a27ce.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 609, + 482, + 632 + ], + "lines": [ + { + "bbox": [ + 132, + 609, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 482, + 632 + ], + "type": "text", + "content": "Fig. 15: Try-on results on DressCode test data by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 101 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 101 + ], + "type": "text", + "content": "27" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 26 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 144, + 473, + 602 + ], + "blocks": [ + { + "bbox": [ + 141, + 144, + 473, + 602 + ], + "lines": [ + { + "bbox": [ + 141, + 144, + 473, + 602 + ], + "spans": [ + { + "bbox": [ + 141, + 144, + 473, + 602 + ], + "type": "image", + "image_path": "55a136d10b0d654d75e414688c70d74f3c264bf509eeffa545f4d481bbe91766.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "lines": [ + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "type": "text", + "content": "Fig. 16: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "28" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 223, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 27 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 144, + 473, + 601 + ], + "blocks": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "lines": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "spans": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "type": "image", + "image_path": "5440ec8b9da172ed3d8e33a9fdf7796175e7ac7232648d3a7b311bf4266c4dd1.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 609, + 482, + 632 + ], + "lines": [ + { + "bbox": [ + 132, + 609, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 482, + 632 + ], + "type": "text", + "content": "Fig. 17: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Diffusion Models for Virtual Try-on" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 101 + ], + "type": "text", + "content": "29" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 28 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 144, + 473, + 601 + ], + "blocks": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "lines": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "spans": [ + { + "bbox": [ + 141, + 144, + 473, + 601 + ], + "type": "image", + "image_path": "129d3a7a608c19847b6cbf62cb6be9da6f3cb77e269579f237c0a2d28fa115ba.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "lines": [ + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 481, + 631 + ], + "type": "text", + "content": "Fig. 18: Try-on results on In-the-Wild dataset by IDM-VTON trained on VITON-HD training data. Best viewed in zoomed, color monitor." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "30" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 222, + 100 + ], + "type": "text", + "content": "Y. Choi et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 29 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_content_list.json b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..c28d52c92c17fc40e0d8e2b9dda926228fd1bf8d --- /dev/null +++ b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_content_list.json @@ -0,0 +1,1855 @@ +[ + { + "type": "text", + "text": "Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training", + "text_level": 1, + "bbox": [ + 236, + 140, + 767, + 209 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yuanqi Yao $^{1}$ , Gang Wu $^{1}$ , Kui Jiang $^{1}$ , Siao Liu $^{2}$ , Jian Kuai $^{1}$ , Xianming Liu $^{1}$ , and Junjun Jiang $^{\\star 1}$", + "bbox": [ + 217, + 233, + 784, + 265 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China {yuanqiyao,kuaijian}@stu.hit.edu.cn {gwu,jiangkui,csxm,jiangjunjun}@hit.edu.cn $^{2}$ Academy for Engineering & Technology, Fudan University saliu20@fudan.edu.com", + "bbox": [ + 236, + 276, + 764, + 345 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Learning a self-supervised Monocular Depth Estimation (MD) model with great generalization remains significantly challenging. Despite the success of adversarial augmentation in the supervised learning generalization, naively incorporating it into self-supervised MDE models potentially causes over-regularization, suffering from severe performance degradation. In this paper, we conduct qualitative analysis and illuminate the main causes: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), integrating adversarial data augmentation into self-supervised MDE methods to achieve a balance between stability and generalization. Specifically, we devise an effective scaling depth network that tunes the coefficients of long skip connection and effectively stabilizes the training process. Then, we propose a conflict gradient surgery strategy, which progressively integrates the adversarial gradient and optimizes the model toward a conflict-free direction. Extensive experiments on five benchmarks demonstrate that SCAT can achieve state-of-the-art performance and significantly improve the generalization capability of existing self-supervised MDE methods.", + "bbox": [ + 259, + 381, + 738, + 657 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Domain Generalization $\\cdot$ Self-Supervised Monocular Depth Estimation $\\cdot$ Stabilized Adversarial Training", + "bbox": [ + 259, + 672, + 743, + 700 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 724, + 375, + 742 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Monocular depth estimation (MDE) plays an important role in various 3D perceptual fields such as robotic navigation [17], autonomous driving [16] and 3D reconstruction [30]. However, due to the dynamic nature of the real world, even minor perturbations in the environment can result in significant domain shifts in", + "bbox": [ + 212, + 756, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author", + "bbox": [ + 217, + 824, + 382, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/e305a494b2c1eacfea5b0a00f7092a1b4e7f34923ceeb9b8c48384f0e33c5280.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 259, + 152, + 424, + 273 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/e42463e005bff75012c9d98c7960f25b73824cf0289a5776ef2eff491a265284.jpg", + "image_caption": [ + "(b)", + "Fig. 1: Visualization of the domain generalization over various methods.(a) Comparisons with offline scenario-specific data augmentation methods.(b) Comparisons with vanilla Gaussian noise and vanilla adversarial data augmentation.(c) Comparisons of different LSCs scaling factors. The results show that our SCAT has excellent generalization performance under multiple unseen domains and retains the performance on the original training set." + ], + "image_footnote": [], + "bbox": [ + 424, + 156, + 584, + 275 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/4dda3d3efaef5bbe7c9f122ccd732b50c835d762e633761f8d36d9d6d1e4f412.jpg", + "image_caption": [ + "(c)" + ], + "image_footnote": [], + "bbox": [ + 594, + 156, + 741, + 273 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "the visual observations, which makes the trained model hard to generalize into unseen scenarios and restricts its application in the physical world.", + "bbox": [ + 212, + 393, + 784, + 425 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To improve the generalization capability, several studies [19, 28, 66] utilize data augmentation methods to generate synthetic data and diversify the training environments, yielding considerable performance improvements. However, existing methods such as [19] mostly select some specific data augmentation schemes for target scenarios, yielding poor generalization performance in environments varying far from the augmented images. Compared with above mentioned offline data augmentation, adversarial data augmentation (ADA) does not make any target distribution assumption and synchronously optimizes the augmenter during the training phase, providing a promising pre-processing solution. Unfortunately, there is a dilemma in naively incorporating ADA into self-supervised MDE. Although adversarial data augmentation can effectively improve generalization capability in multiple supervised visual tasks [19], self-supervised MDE algorithms are quite sensitive to such excessive perturbation, resulting in significant performance degradation and training collapse. Therefore, it is necessary to rethink why self-supervised MDE cannot benefit from ADA as much as supervised learning.", + "bbox": [ + 212, + 428, + 787, + 671 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this work, we first conduct extensive quantitative analysis to investigate the causes of performance degradation when applying adversarial data augmentation to common self-supervised MDE models. There are two primary factors for this phenomenon: (i) inherent sensitivity of long skip connections (LSC) in UNet-alike depth estimation networks; (ii) dual optimization conflict caused by over-regularization. Specifically, as a core component in the MDE, LSC is widely adopted in the UNet-alike Depth Networks to combine multi-scale features and preserve low-level detail, yielding better prediction performance. However, the presence of these shortcut connections amplifies adversarial gradients, when coupled with pixel-level adversarial data augmentation, leading to severe training instability and collapse. Moreover, compared to offline data augmentation, ad", + "bbox": [ + 212, + 674, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 336, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "versarial augmentation data commonly act as the worst-case training examples [36,37] and often provides over-regularization for the model training, which results in optimization gradients that oppose those of the original data, leading to severe gradient conflicts and a subsequent decline in convergence performance.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), tailored for self-supervised monocular depth estimation. SCAT is designed to enhance both generalization capability and stability. In particular, we develop an innovative scaling depth network that adjusts the coefficients of long skip connections within UNet architecture, thereby ensuring a more stable training regime through a theoretically supported. Furthermore, we advance a Conflict Gradient Surgery method, progressively blending the adversarial gradient to guide the model optimization along a direction devoid of conflicts. It is worth noting that one of the merits of our method SCAT is model-agnostic, and the stabilized adversarial training can be applied to diverse SOTA methods, yielding consistent generalization enhancement. To validate the effectiveness of SCAT, we conduct extensive experiments on both KITTI and KITTI-C datasets, demonstrating its cross-domain generalization capability on Foggy CityScapes, DrivingStereo and NuScenes datasets. In summary, our contributions are summarized as follows:", + "bbox": [ + 212, + 207, + 787, + 434 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We point out the inherent sensitivity of UNet-based depth networks and the dual optimization conflict caused by over-regularization, providing a theoretical analysis of the self-supervised MDE model's instability.", + "- We propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which efficiently incorporates adversarial augmentation into self-supervised MDE, and significantly improves the model generalization capabilities across multiple unseen domains.", + "- We developed Conflict Gradient Surgery (CGS) to address the dual optimization conflicts induced by adversarial over-regularization, achieving a balance between model stability and generalization." + ], + "bbox": [ + 225, + 443, + 797, + 590 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 617, + 395, + 633 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Self-Supervised Monocular Depth Estimation", + "text_level": 1, + "bbox": [ + 215, + 648, + 635, + 666 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Self-supervised monocular depth estimation (MDE) has made remarkable progress in recent years, enabling depth learning from unlabeled data. The seminal work by Zhou et al. [23] laid the foundation by jointly optimizing depth and pose networks using an image reconstruction loss. Since then, two main approaches have emerged: stereo training and monocular training. Stereo training methods utilize synchronized stereo image pairs to predict disparity maps, with notable contributions including photometric consistency loss [4], left-right consistency [6], and continuous disparity prediction [45]. Monocular training, on the other hand, relies on the consistency between synthesized and actual scene views, with SfM-Learner [23] pioneering the joint training of a DepthNet and a PoseNet using a photometric loss. Researchers have also explored complementary techniques", + "bbox": [ + 212, + 672, + 789, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "to further boost performance, such as occlusion modeling [38-41], scale ambiguity [42] advanced network architectures [12, 43, 44], semantic information integration [46-50], and object size cues [48, 51]. The proposed use of orthogonal planes for improved depth representation in driving scenarios contributes to the ongoing advancements in this field.", + "bbox": [ + 212, + 146, + 787, + 220 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Domain Generalization in Monocular Depth Estimation", + "text_level": 1, + "bbox": [ + 214, + 258, + 723, + 273 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "A line of studies investigated how to utilize data augmentation or synthetic data generation to improve the domain generalization capability of MDE [19, 28, 29, 52-56]. ADDS-DepthNet [28] generates night image pairs from day images using GANs, training the network to be effective in both day and night domains. It uses day depth estimates as pseudo-supervision for night scenes, which limits the night depth estimation to the accuracy of the day estimates. Additionally, ADDS-DepthNet focuses on reconstructing GAN-generated night images, which generates reconstruction targets with high variance, resulting detrimental to the self-supervised MDE algorithm. ITDFA [56] employs a fixed depth decoder and adapts the encoders for each domain to enforce feature consistency across domains, which is limited to the performance. Robust-Depth [19] put forward an offline data augmentation method. By exploiting the correspondence between unaugmented and augmented data they introduce a pseudo-supervised loss for both depth and pose estimation. However, previous approaches limited the ability to handle environments with pre-defined variations and require substantial architectural modifications to obtain realistic depth estimates, leading to severe domain bias when applied to real-world scenes [19, 28].", + "bbox": [ + 212, + 297, + 789, + 554 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.3 Adversarial Training", + "text_level": 1, + "bbox": [ + 214, + 590, + 433, + 606 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Adversarial training has emerged as a popular technique to improve the generalization capability of deep neural networks. This approach involves incorporating both benign and adversarial examples during the training process, enabling models to learn more robust features [57]. Researchers have successfully applied adversarial training to various computer vision tasks, such as image classification [26, 57], object detection [58, 59], and segmentation [60, 61]. However, generating adversarial examples typically requires ground truth labels, which limits the applicability of adversarial training to supervised learning settings. To address this limitation, semi-supervised adversarial learning methods [62, 63] have been proposed, which leverage a small portion of labeled data to enhance robustness. Additionally, contrastive learning [64, 65] has been combined with adversarial examples to improve self-supervised learning and model robustness. In the context of MDE, adversarial training remains largely unexplored, particularly in self-supervised MDE which absent the ground truth depth information.", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 230, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 338, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 143, + 382, + 160 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Problem Formulation", + "text_level": 1, + "bbox": [ + 215, + 175, + 439, + 189 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Following [5, 7], we regard the self-supervised depth estimation as an image reconstruction task, where the objective is to reconstruct the target current frame image $I_{t}$ from consecutive frames $I_{t}^{\\prime} \\in \\{I_{t - 1}, I_{t + 1}\\}$ . Specifically, we construct a dual-branch framework, involving a DepthNet and a PoseNet. The former is used for estimating depth map $D_{t}$ while the latter is introduced to predict the relative poses $T_{t' \\to t}$ through the inverse warping as below, the predicted depth map $D_{t}$ in conjunction with the relative poses $T_{t' \\to t}$ can synthesize the target image $I_{t' \\to t}$ , depicted as:", + "bbox": [ + 212, + 200, + 787, + 321 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nI _ {t ^ {\\prime} \\rightarrow t} = I _ {t ^ {\\prime}} \\left\\langle \\operatorname {p r o j} \\left(D _ {t}, T _ {t \\rightarrow t ^ {\\prime}}, K\\right)\\right\\rangle , \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 330, + 785, + 357 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $proj(\\cdot)$ generates the resulting 2D coordinates of the projected depths $Dt$ in $It'$ and $\\langle \\rangle$ refers to the sampling operator. We minimize the photometric reprojection error $\\mathcal{L}_p$ to supervise the DepthNet,", + "bbox": [ + 214, + 366, + 787, + 412 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {p} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, I _ {t ^ {\\prime} \\rightarrow t}\\right), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 418, + 422, + 785, + 454 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $pe$ is the photometric reconstruction error. As suggestion in [6, 13], we adopt the weighted combination of $L_{1}$ loss and SSIM [24] to formulate the photometric error function $pe$ , denoted as:", + "bbox": [ + 214, + 464, + 787, + 510 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\np e (I _ {a}, I _ {b}) = \\frac {\\alpha}{2} (1 - \\operatorname {S S I M} (I _ {a}, I _ {b})) + (1 - \\alpha) | | I _ {a} - I _ {b} | | _ {1}. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 310, + 520, + 785, + 546 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Analysis on Unstable Self-Supervised MDE", + "text_level": 1, + "bbox": [ + 215, + 564, + 620, + 579 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we aim to investigate the primary causes why naively applying adversarial data augmentation in self-supervised MDE leads to instability.", + "bbox": [ + 212, + 589, + 785, + 619 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Pitfall1: Sensitive UNet-alike Depth Network. In previous self-supervised MDE methods [7-9], UNet [32] is the most popular depth network backbone, since its long skip connects (LSCs) to connect distant network blocks can fuse multi-granularity semantic information and spatial information:", + "bbox": [ + 214, + 619, + 785, + 679 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \\circ [ a _ {i + 1} \\circ x + f _ {i + 1} (a _ {i + 1} \\circ x) ], \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 272, + 691, + 785, + 708 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $x \\in R^{m}$ denotes the input, $a_{i}$ and $b_{i}(i \\geq 1)$ are the trainable parameter of the $i$ -th block. For the vector operation $\\circ$ , it can be designed to implement different networks. Assume an extra noise $\\epsilon_{\\delta} \\sim N(0, \\sigma_{\\delta}^2 I)$ is injected into $I_{t}$ which yields a new input $\\tilde{I}_{t}'$ , self-supervised MDE with data augmentations aims to reprojection $I_{t' \\to t}$ from the noisy input $\\tilde{I}_{t'}$ . Accordingly, if the variance $\\sigma_{\\delta}^2$ of extra noise is large, it can hinder re-projecting the desired target image $I_{t' \\to t}$ . In adversarial training, the variance of this extra noise varies along training iterations, further exacerbating the instability of self-supervised MDE training.", + "bbox": [ + 212, + 717, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Recent work [35] also reveals a similar phenomenon, which demonstrates that the UNet-based segmentation architecture is sensitive to perturbed noise, suffering from catastrophic training collapse. It is noteworthy that, although our theoretical analysis is focused on UNet-based depth estimation architectures, the LSC component is extensively employed across various mainstream architectures [11], thereby lending a degree of extensibility to our empirical results.", + "bbox": [ + 212, + 146, + 787, + 236 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Pitfall2: Dual Optimization Conflict by Over-Regularization. Compared to the offline data augmentation in Robust-Depth [19], Adversarial Data Augmentation (ADA) makes no assumptions about the target distribution and synchronously optimizes augmenters during the training phase, offering a promising pre-processing solution. Unfortunately, naively incorporating ADA into self-supervised Monocular Depth Estimation (MDE) presents a dilemma. While adversarial data augmentation can effectively enhance generalization in various supervised visual tasks, a dual optimization conflict arises due to the opposing gradient optimization directions between the adversarial-perturbed data and the original data. Similar to [31], we also define $\\phi_{ij}$ as the angle between origin data $g_i$ and adversarial-perturbed data gradient $g_j$ , the gradients as conflicting when $\\cos \\phi_{ij} < 0$ . Therefore, for self-supervised MDE, over-regularization leads to ADA dominating the gradient updates, resulting in significant performance degradation and training collapse. We refer to this issue as a dual optimization conflict caused by over-regularization.", + "bbox": [ + 212, + 237, + 787, + 465 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Method", + "text_level": 1, + "bbox": [ + 215, + 486, + 330, + 502 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 Architectural Overview", + "text_level": 1, + "bbox": [ + 215, + 518, + 455, + 532 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which is compatible with any self-supervised MDE method. An overview of the SCAT architecture is provided in Fig. 2. To circumvent erroneous bootstrapping from adversarial augmented data, augmentation was applied to improve generalization by reconstructing the unaugmented $I_{t}$ , rather than the augmented image $\\tilde{I}_{t}$ .", + "bbox": [ + 212, + 542, + 787, + 633 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {I} _ {t ^ {\\prime}} = I _ {t ^ {\\prime}} + \\delta \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 459, + 643, + 784, + 662 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {I} _ {t ^ {\\prime} \\rightarrow t} = I _ {t ^ {\\prime}} \\left\\langle \\operatorname {p r o j} \\left(\\tilde {D} _ {t}, \\tilde {T} _ {t \\rightarrow t ^ {\\prime}}, K\\right)\\right\\rangle , \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 672, + 784, + 696 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {p} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, I _ {t ^ {\\prime} \\rightarrow t}\\right) + p e \\left(I _ {t}, \\tilde {I} _ {t ^ {\\prime} \\rightarrow t}\\right). \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 366, + 704, + 784, + 733 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "If $\\delta$ is learned (i.e. SCAT is implemented with an adversarial generator $\\delta = g_{\\phi}(z)$ , to introduce adversarial training into self-supervised MDE, we calculate the reprojection loss for the current frame image reconstructed from the perturbed images and use it as the self-supervised constraint loss $\\mathcal{L}_{AD}$ :", + "bbox": [ + 212, + 739, + 787, + 801 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {A D} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, \\tilde {I} _ {t ^ {\\prime} \\rightarrow t}\\right). \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 411, + 811, + 784, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 336, + 126 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/56def8c71425cdb824d196156fc7bf72c3e3e97dcd82899a9a96c55e56aa835d.jpg", + "image_caption": [ + "Fig. 2: Overview of our SCAT architecture. Our method introduces an adversarial noise generator, which is optimized through $\\mathcal{L}_{AD}$ and acts as an adversarial constraint, while $\\mathcal{L}_p$ imposes self-supervised constraints to optimize self-supervised MDE model. CGS incrementally applies adversarial augmenters from multiple iterations, enabling a balanced achievement in model generalization and stability. Meanwhile, we utilize a scaling depth network(SDN) to stabilize the training process." + ], + "image_footnote": [], + "bbox": [ + 222, + 156, + 782, + 369 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Our goal is to find a noise distribution $p_{\\phi}(\\delta)$ , $\\delta \\in R^{N}$ and $\\| \\delta \\| _2 = \\epsilon$ , such that noise samples added to input clean image $I_{t}$ maximally confuse the depth network. More concisely, we optimize the following equation, depicted as", + "bbox": [ + 212, + 500, + 784, + 546 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\min _ {\\theta} \\max _ {\\phi} \\mathbb {E} _ {\\tilde {I} _ {t ^ {\\prime}}, I _ {t}} \\mathbb {E} _ {\\delta \\sim p _ {\\phi} (\\delta)} \\left[ \\mathcal {L} \\left(f _ {\\theta} \\left(\\tilde {I} _ {t ^ {\\prime}}\\right), I _ {t}\\right) \\right]. \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 556, + 784, + 585 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Specifically, $\\max_{\\phi}$ represents the adversarial noise generator's attempt to maximize the $\\mathcal{L}_{AD}$ , thereby generating adversarial samples that maximally perturb the depth network. Conversely, $\\min_{\\theta}$ denotes the depth network's effort to minimize the $\\mathcal{L}_p$ on these adversarial samples, aiming to achieve robustness in depth estimation across various adversarial inputs. Through training iterations provided in Algorithm 1 in our SCAT framework, self-supervised MDE models becomes proficient at accurately inferring various perturbed images.", + "bbox": [ + 212, + 597, + 782, + 703 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "However, as the variance of this extra adversarial noise varies along training, the standard UNet-based depth network is too sensitive to these perturbations. Hence, we propose a Scaling Depth Network (SDN), which appropriately scales the coefficients $\\kappa_{i}$ to lower reconstruction error. In addition, conflict arises by opposing gradient optimization directions between the adversarial-perturbed data and original data, further exacerbating the training instability. To ensure the model has enough representational power while preventing unstable parameter updates, we propose Conflict Gradient Surgery (CGS) to refine the adversarial training gradient update process, which we introduce in the following section.", + "bbox": [ + 212, + 704, + 784, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 Scaling Depth Network", + "text_level": 1, + "bbox": [ + 215, + 146, + 455, + 162 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To alleviate the impact of extra noise, we devise scaling depth network (SDN) to scale the coefficients $\\kappa_{i}$ of LSCs:", + "bbox": [ + 214, + 171, + 782, + 202 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \\circ \\left[ k _ {i + 1} \\cdot a _ {i + 1} \\circ x + f _ {i + 1} \\left(a _ {i + 1} \\circ x\\right) \\right], \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 235, + 213, + 785, + 231 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\kappa_{i} > 0$ , $(i \\geq 1)$ are the scaling coefficients and are set to 1 in standard UNet-based depth network. For scaling depth network in Eq.10, assume $M_0 = \\max \\{||b_i \\circ a_i||_2, 1 \\leq i \\leq N\\}$ and $f_N$ is $L_0$ -Lipschitz continuous, $c_0$ is a constant related to $M_0$ and $L_0$ . Suppose $I_t^{\\epsilon_\\delta}$ is an perturbed input of the vanilla input $I_t$ with a small perturbation $\\epsilon_\\delta = ||I_t^{\\epsilon_\\delta} - I_t||_2$ . Then we have", + "bbox": [ + 214, + 241, + 782, + 318 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\left| \\left| f _ {\\theta} \\left(\\mathbf {I} _ {t} ^ {\\epsilon_ {\\delta}}\\right) - f _ {\\theta} \\left(\\mathbf {I} _ {t}\\right) \\right| \\right| _ {2} \\leq \\epsilon_ {\\delta} \\left[ \\sum_ {i = 1} ^ {N} \\kappa_ {i} M _ {0} ^ {i} + c _ {0} \\right], \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 329, + 785, + 371 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $N$ is the number of the long skip connections. See the proof in Appendix.", + "bbox": [ + 214, + 380, + 782, + 395 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Eq.11 shows that for a perturbation magnitude $\\epsilon_{\\delta}$ , the reconstruction error bound of depth network is $\\mathcal{O}(\\epsilon_{\\delta}\\left(\\sum_{k = 1}K_{i}M_{0}^{i}\\right)$ . For standard UNet-based depth network ( $\\kappa_{i} = 1\\forall i$ ), this bound becomes a very large bound $\\mathcal{O}(NM_0^N)$ . This implies that a standard UNet-based depth network is sensitive to extra noise in the input, especially when LSC number $N$ is large. Intuitively, setting appropriate scaling coefficients $\\kappa_{i}$ in our scaling depth network can enhance the robustness of the model to input perturbations, thereby improving better stability for self-supervised MDE. To derive the scaling coefficient $\\kappa$ , we adopt a heuristic algorithm to assign a uniform constant value of $\\kappa_{*}$ across all LSCs, with the default set to 0.7. In terms of implementation, a line of parameter optimization techniques [33,35] can be applied, e.g. incorporating an adaptive projection layer [35] for each LSC component. The empirical discussions in the Appendix demonstrate that a singular scaling parameter $\\kappa$ is sufficient to strike to balance performance and efficiency for the self-supervised MDE task.", + "bbox": [ + 212, + 396, + 787, + 608 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 Conflict Gradient Surgery", + "text_level": 1, + "bbox": [ + 215, + 628, + 477, + 645 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Here, we propose to modify the standard adversarial data augmentation (ADA) by incorporating conflict gradient surgery named CGS, aiming to change the distribution of $\\cos(\\theta)$ tends towards positive values, where $\\theta$ is the angle between the gradient of the original data and the gradient of the CGS adversarial data, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, and finally improves the robustness of the model to perturbations:", + "bbox": [ + 212, + 654, + 782, + 760 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbb {E} \\left[ \\cos (\\theta) \\right] > 0, \\quad \\text {w h e r e} \\cos (\\theta_ {i}) = \\frac {g _ {i} \\cdot g _ {\\operatorname* {m i x} _ {i}}}{| g _ {i} | | g _ {\\operatorname* {m i x} _ {i}} |}\n$$\n", + "text_format": "latex", + "bbox": [ + 346, + 771, + 656, + 801 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $g_{i}$ is the gradient of the i-th original data, $g_{mix_i}$ is the gradient of the i-th mixed adversarial data. We calculate the gradient cosine similarity between", + "bbox": [ + 214, + 809, + 782, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 338, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "the gradient of the adversarial-perturbed data and the original data. We define two gradients as conflicting if their cosine similarity is negative, indicating they are diverging from one another. If the distribution of cosine similarities tends to be negative, it signifies the presence of numerous adversely oriented gradients, which can mislead the gradient optimization process. As illustrated in Fig. 3, we extracted 1000 images from the KITTI dataset and recorded the gradient cosine similarity between pairs of adversarial perturbation data and original data. Without employing conflict gradient surgery, the gradient conflict becomes a prevalent issue as the adversarial training progresses iteratively, consequently leading slower convergence and performance degradation.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/64bced7f5a3e5465cff9e17de3d1ff2bb01e725674c9e98280481a2adf224221.jpg", + "image_caption": [ + "Fig. 3: (a) Statistics of gradient cosine similarity. Through CGS, we have shifted the distribution of cosine similarities from being negatively skewed to positively skewed, mitigating the previously prevalent issue of adversely oriented gradients. (b) Illustration of training oscillation issue arising from Dual Optimization Conflict." + ], + "image_footnote": [], + "bbox": [ + 243, + 303, + 750, + 458 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Experimental observations provided in Fig. 3 demonstrate that our approach ensures the expectation of $\\cos(\\theta)$ is positive, thereby skewing the distribution of $\\cos(\\theta)$ tends towards positive values, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, ultimately enhancing the model's robustness against perturbations. Specifically, given a set of gradient vectors (one for each adversarial data augmentation), we construct the adversarial perturbation data while employing multiple adversarial generators from previous iterations, restraining the over-regularization caused by the conflict component through our conflict gradient surgery. The update procedure of the CGS algorithm is provided in Algorithm 1.", + "bbox": [ + 212, + 525, + 787, + 676 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 215, + 696, + 375, + 714 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.1 Experimental Settings", + "text_level": 1, + "bbox": [ + 215, + 726, + 446, + 742 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "KITTI [1] KITTI dataset is collected for mobile robotics and autonomous driving, involving hours of traffic scenarios recorded with a variety of sensor modalities, including high-resolution RGB, grayscale stereo cameras, and a 3D laser scanner. Following the setting in [5], we use 39,810 images for training and 4,424 for validation. Subsequently, we rigorously evaluate the proposed method and other compared methods on the KITTI eigen test dataset [3].", + "bbox": [ + 212, + 748, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "code", + "sub_type": "code", + "code_caption": [ + "Algorithm 1 Generic SCAT self-supervised MDE algorithm" + ], + "code_body": "( $\\triangleright$ vanilla self-supervised MDE, $\\triangleright$ our modifications)", + "guess_lang": "javascript", + "bbox": [ + 405, + 161, + 785, + 176 + ], + "page_idx": 9 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [], + "code_body": "1: for Epoch e = 1...n do do \n2: Adversarial Data Augmentation via CGS: \n3: g1:j ~ Sample(B, j) ▷Randomly select generators from History Buffer. \n4: δ1:j = g1:j(It) ▷Generate adversarial noise from clean images. \n5: I1:j = It + δ1:j ▷Obtain adversarial images. \n6: Deterministic Reprojection with SDN: \n7: Dt = ScalingDepthNet(It), Pt = PoseNet(It) \n8: Obtain clean depth map and camera poses. \n9: Obtain adversarial depth map and camera poses. \n10: I t'→t ⇔ fθ(I t'), I t'→t ⇔ fθ(I t') \n11: Reconstruct adversarial and clean images with the same target. \n12: B ← B ∪ ge ▷Add current Generator into History Buffer B. \n13: θ ← θ - ηθ∇θLp(f, It; θ) ▷Optimize MDE fθ with LP in Eq. 7. \n14: φ ← φ + ηφ∇φLAD(gφ, It; φ) ▷Optimize Generator gφ with LAD in Eq. 8. \n15: end for", + "bbox": [ + 215, + 179, + 787, + 377 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/e90bfb563817bef6947bffe5b59ab9632ff7aaefbff61b6b0e786637a2ac830f.jpg", + "table_caption": [ + "Table 1: Quantitative Results for the KITTI-C Dataset. Pink cell denotes the best performance, while yellow one denotes suboptimal." + ], + "table_footnote": [], + "table_body": "
MethodW × HmCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]640 × 192101.0484.080.2481.7646.8520.2910.6980.8740.944
+ DA640 × 19297.7284.960.2271.7616.7350.2930.7100.8760.944
+ ADA640 × 19289.3187.310.1931.6326.4270.2780.7340.8820.945
+ SCAT (ours)640 × 19286.3290.130.1651.5736.1570.2690.7620.8930.951
CADepth [8]640 × 192108.1080.120.2711.9026.9000.3020.6740.8600.938
+ DA640 × 192107.1481.310.2611.8746.8320.2990.6910.8650.939
+ ADA640 × 19299.8183.130.2351.8666.5650.2780.7210.8710.940
+ SCAT (ours)640 × 19295.5487.930.1971.7946.2580.2640.7470.8830.948
HR-Depth [9]640 × 192103.6782.880.2551.9606.9090.3090.6700.8540.933
+ DA640 × 192101.7483.230.2431.9426.7870.2940.6850.8590.936
+ ADA640 × 19293.8485.320.2151.8316.6250.2780.6990.8610.939
+ SCAT (ours)640 × 19287.0689.470.1891.7326.2040.2580.7410.8710.945
MonoVit [11]640 × 19280.5488.980.1911.2745.9980.2450.7710.9220.964
+ DA640 × 19278.3290.470.1871.2565.8730.2280.7870.9310.965
+ ADA640 × 19272.4192.340.1661.1345.6260.2110.8190.9350.969
+ SCAT (ours)640 × 19262.7495.380.1271.0585.2740.2080.8460.9470.976
Robust-Depth* [19]640 × 19255.7296.460.1210.9545.0510.2010.8540.9520.978
+ DA640 × 19260.1296.340.1240.9635.0120.2130.8520.9510.977
+ ADA640 × 19254.2397.590.1190.9434.9850.1990.8530.9510.977
+ SCAT (ours)640 × 19253.3798.190.1170.9324.8720.1870.8610.9550.979
", + "bbox": [ + 215, + 438, + 787, + 642 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "KITTI-C [67] To evaluate the robustness and safety of our method in out-of-distribution (OoD) scenarios, we utilize KITTI-C dataset as a benchmark. The diverse corruptions enable the reliability of simulation to the potential perturbation distribution in real-world scenarios.", + "bbox": [ + 212, + 662, + 787, + 724 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "DrivingStereo [14] It contains 500 images captured under different weather conditions, involving foggy, cloudy, rainy, and sunny. These images offer a realistic representation of various driving scenarios, enabling robust evaluation of depth estimation performance across diverse domains.", + "bbox": [ + 212, + 728, + 787, + 789 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Foggy CityScapes [2] Foggy CityScapes is a synthetic fog dataset that simulates real-world foggy scenarios. Each foggy sample is generated using the corresponding clear image and depth map from CityScapes dataset.", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 336, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/99343199e3592b79f2309340975a5c137d386047be29bcf10cb1eaa0984febec.jpg", + "image_caption": [ + "$\\epsilon_{m} = 20$", + "Fig. 4: Example images with different $\\epsilon_{m}$ of adversarial perturbation." + ], + "image_footnote": [], + "bbox": [ + 220, + 146, + 359, + 200 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/79954a7612ca79864ff5cf0dc87b4a02f90c88c45f19d4269b75a2814ccae9b5.jpg", + "image_caption": [ + "$\\epsilon_{m} = 40$" + ], + "image_footnote": [], + "bbox": [ + 362, + 146, + 500, + 200 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/9d9eea900275057248df8a9b390cb913bc2f1bc302cc165470ce9cd17bf40c4a.jpg", + "image_caption": [ + "$\\epsilon_{m} = 80$" + ], + "image_footnote": [], + "bbox": [ + 500, + 146, + 640, + 200 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/89083d7fb9f2d8d1b3e529884d4c2776b9229a415b05d07c54c013320eea0276.jpg", + "image_caption": [ + "$\\epsilon_{m} = 135$" + ], + "image_footnote": [], + "bbox": [ + 640, + 146, + 779, + 200 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "NuScenes [15] The NuScenes dataset comprises approximately 15,000 images captured in real nighttime urban street settings. To validate the model generalization, NuScenes is also selected as an evaluation benchmark in our study.", + "bbox": [ + 212, + 236, + 782, + 281 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/4b23b99b5bd26b29479c48d92847767e54c0beb01351aeecd0cc1b5a791988e2.jpg", + "table_caption": [ + "Table 2: Quantitative Results for the KITTI Eigen Test Dataset. The results indicate that SCAT largely maintains the performance of all baselines compared to vanilla ADA, ensuring the ability to infer accurate depth information on clean images." + ], + "table_footnote": [], + "table_body": "
MethodW × HAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
Monodepth2 [7]640 × 1920.1150.9034.8630.1930.8770.9590.981
+ ADA640 × 1920.1210.9784.9920.2210.8620.9530.978
+ SCAT (ours)640 × 1920.1160.9424.8770.1930.8770.9580.981
CADepth [8]640 × 1920.1050.7694.5350.1810.8920.9640.983
+ ADA640 × 1920.1080.8124.5850.1900.8870.9620.982
+ SCAT (ours)640 × 1920.1060.7964.5790.1830.8900.9630.983
DIFFNet [10]640 × 1920.1020.7494.4450.1790.8970.9650.983
+ ADA640 × 1920.1060.7934.5920.1840.8890.9630.982
+ SCAT (ours)640 × 1920.1030.7644.4530.1800.8970.9650.983
MonoVit [11]640 × 1920.0990.7084.3720.1750.9000.9670.984
+ ADA640 × 1920.1060.7334.5910.1840.8970.9630.982
+ SCAT (ours)640 × 1920.1000.7164.3890.1750.8990.9670.984
Robust-Depth* [19]640 × 1920.1000.7474.4550.1770.8950.9660.984
+ ADA640 × 1920.1050.7834.6980.1820.8890.9530.981
+ SCAT (ours)640 × 1920.1010.7544.4590.1770.8950.9660.984
", + "bbox": [ + 215, + 344, + 785, + 534 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.2 Effect of Perturbation Sizes", + "text_level": 1, + "bbox": [ + 215, + 564, + 490, + 578 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To evaluate the effect of adversarial perturbation magnitude on model generalization, here we employ $\\epsilon_{m}$ to perturbation sizes:", + "bbox": [ + 212, + 592, + 782, + 622 + ], + "page_idx": 10 + }, + { + "type": "equation", + "text": "\n$$\n\\epsilon_ {m} = \\min \\| \\delta_ {\\min } \\| _ {2}. \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 434, + 636, + 784, + 652 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We measure model generalization capability by calculating the median perturbation size $\\epsilon_{m}$ and report the results in Tab. 3. To provide a better intuition for the noise level for particular $\\epsilon_{m}$ , we display example images in Fig. 4.", + "bbox": [ + 212, + 665, + 782, + 710 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.3 Results on KITTI-C and KITTI", + "text_level": 1, + "bbox": [ + 215, + 736, + 527, + 750 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In this section, we compare the depth estimation performance of our SCAT on the KITTI-C and KITTI datasets. Quantitative results on the KITTI-C dataset are shown in Tab. 1. We conducted extensive experiments on multiple baseline models, comparing it with the generalization performance between offline data augmentation (DA) and vanilla adversarial data augmentation (ADA). As", + "bbox": [ + 212, + 763, + 784, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/98dfd4f0393c6c818ed979d29fecd3a94ac7cf442035967d49c7e455a96f05f7.jpg", + "table_caption": [ + "Table 3: Qualitative Results for different perturbation sizes. We compare the results obtained by $\\epsilon_{m} = 135.0$ adversarial noise generator with its counterparts of different perturbation sizes. Note that $\\epsilon_{m} = 135.0$ was used in all experiments in this paper apart from this ablation study." + ], + "table_footnote": [], + "table_body": "
ModelMCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]101.0484.080.2481.7646.8520.2910.6980.8740.944
+ gφεm = 2093.9686.170.1961.6196.3850.2850.7380.8830.947
+ gφεm = 4090.1586.930.1871.6136.3510.2820.7410.8850.949
+ gφεm = 8088.9587.210.1821.6026.2880.2790.7490.8900.949
+ gφεm = 13586.3290.130.1651.5736.1570.2690.7620.8930.951
+ gφεm = 18088.1786.830.1771.5946.1950.2770.7580.8910.950
", + "bbox": [ + 217, + 212, + 785, + 292 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/378c4ba91cd101cf89219ca7d227bcb3b1de8db63a940d553d856d37699f153a.jpg", + "image_caption": [ + "Fig. 5: Qualitative Results for KITTI-C. As the SOTA self-supervised MDE methods, MonoDepth and MonoVit excel on the KITTI dataset, but struggle to accurately infer depth information from various types of damaged images in out-of-distribution (OoD) domains. With our SCAT framework, their depth estimation performance in challenging cross-domain scenarios can be substantially improved." + ], + "image_footnote": [], + "bbox": [ + 217, + 305, + 781, + 506 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "expected, our method demonstrates a significant advantage on the mean corruption error (mCE) and mean resilience rate (mRR) scores. Especially for 18 common out-of-distribution corruption types, with all baseline models, our proposed SCAT method outperforms the competitors in almost all of metrics, providing a general framework to enhance cross-domain generalization capability for existing self-supervised monocular depth estimation methods.", + "bbox": [ + 215, + 607, + 787, + 699 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.4 Results on Cross-Domain Generalization", + "text_level": 1, + "bbox": [ + 215, + 722, + 596, + 738 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "To demonstrate the generalization capability of our SCAT over real cross-domain scenarios, like foggy and nighttime samples, we also conduct the experiments on Foggy CityScapes dataset, DrivingStereo dataset and NuScenes dataset, which are shown in Fig. 6 and Fig. 7. As expected, our SCAT generates depth estimation results with more reliable and clearer contours in all weather conditions. By contrast, vanilla MonoDepth2 and MonoVit suffer from significant performance", + "bbox": [ + 215, + 750, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 336, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/a03730ef370f22dccf5165181772f98891c599019b64a422b3ca78f4f6a207d3.jpg", + "image_caption": [ + "Fig. 6: Qualitative Results for Foggy CityScapes. We conduct testing to assess SCAT's generalization on a synthetically generated dataset with more severe fog." + ], + "image_footnote": [], + "bbox": [ + 222, + 150, + 781, + 277 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/4ee06ecdc0294e65ce8ba2c725e5ad5fb2308a12117b4f3cfcd112f96f343cf2.jpg", + "table_caption": [ + "Table 4: Quantitative Results for the Real-World NuScenes-Night Dataset." + ], + "table_footnote": [], + "table_body": "
DatasetMethodAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252↑δ < 1.253↑
NuScenes-Night [15]Monodepth2 [7]0.3976.20614.5690.5680.3780.6500.794
+ SCAT (ours)0.3555.11212.4360.4990.3920.6710.863
HR-Depth [9]0.4616.63315.0280.6220.3010.5710.749
+ SCAT (ours)0.4245.80213.6850.6020.3240.5840.827
CADepth [8]0.4215.94914.5090.5930.3310.6130.776
+ SCAT (ours)0.3875.52411.9620.5770.3650.6550.834
MonoVit [11]0.3134.14312.2520.4550.4850.7360.858
+ SCAT (ours)0.2844.12610.1390.4010.4970.7520.879
Robust-Depth* [19]0.2764.07510.4700.3800.6070.8190.912
+ SCAT (ours)0.2633.9739.4620.3710.6090.8190.913
", + "bbox": [ + 217, + 361, + 782, + 474 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "decline when handling real and unknown scenarios, in particular in the rainy and nighttime scenes. Notably, it can be observed that our SCAT method can effectively recover challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real-world cross-domain scenarios. Quantitative results are summarized in Tab. 4, showing that our proposed SCAT framework gains better performance on all metrics with multiple state-of-the-art methods. More results are shown in the Appendix.", + "bbox": [ + 212, + 491, + 787, + 597 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.5 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 617, + 390, + 633 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effectiveness of Individual Components. To improve the stability and generalization capability of self-supervised MDE methods, SCAT presents a stabilized adversarial training framework with Conflict Gradient Surgery (CGS), progressively integrating the adversarial-perturbed data to prevent gradient conflict. In addition, we propose a scaling depth network named SDN, reducing the perturbation sensitivity of the UNet-based depth network. We perform an ablation study to investigate the effectiveness of individual components in SCAT and the results are shown in Tab. 5. Individually, each of these contributes significantly to the improvement of generalization performance across multiple datasets.", + "bbox": [ + 212, + 641, + 787, + 777 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Impact of LSCs Coefficient $\\kappa$ . In our experiments, the value of the long skip connections (LSCs) coefficient $\\kappa$ was set to balance the self-supervised MDE model's stability and generalization capability, which defaults to 0.7 in the paper. To assess the perturbation sensitivity of UNet-based depth networks, we", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/6c36c9768b8a32089eb261a692a407294ab3c3ae4318b2f9c507a2d122de8572.jpg", + "image_caption": [ + "Fig. 7: Qualitative results on Driving Stereo and Nuscenes. It can be observed that our SCAT method effectively recovers challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real scenarios." + ], + "image_footnote": [], + "bbox": [ + 217, + 141, + 781, + 250 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/89914bd137d1fa0e367bb7f1faa275b56be3239cd88780168a722ea5e605d1af.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
CGSSDNKITTIKITTI-C
Abs Relδ < 1.25Abs Relδ < 1.25
0.1210.8620.1930.734
✓0.1170.8690.1740.752
✓0.1180.8650.1790.748
✓✓0.1160.8770.1650.762
", + "bbox": [ + 241, + 409, + 542, + 467 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 5: Effect of individual components.", + "bbox": [ + 250, + 467, + 532, + 479 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/187a5c83bff5433065600879278b1ebd942a66ecdf478e635d2350daa4ae1e42.jpg", + "image_caption": [ + "compare the model performance over constant values of $\\kappa \\in \\{0.1, 0.3, 0.7, 1.0\\}$ . Fig. 1 shows that when $\\kappa$ is set to 0.7, our scaling depth network has extraordinary generalization capability to unseen scenarios in the KITTI-C dataset while keeping the depth estimation performance of the KITTI dataset.", + "Fig. 8: Effect of the scaling factor $\\kappa$ ." + ], + "image_footnote": [], + "bbox": [ + 571, + 393, + 779, + 468 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 491, + 359, + 507 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we initially illuminate the main causes of training collapse under adversarial data augmentation: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To address these issues, we propose SCAT, a simple yet effective model-agnostic framework that leverages stabilized adversarial training to bootstrap the generalization capability of self-supervised MDE models in unseen scenarios. Extensive experiments on a variety of scenarios from five benchmarks validate the merits of our adversarial data augmentation, which endows the model with universal generalization capability and better training efficiency. In addition, empirical results indicate that each component in our method and the utilization of targeted reconstruction are crucial for generalization performance gain. Our exploration may inspire more researchers to dig into the great potential of utilizing adversarial training in self-supervised MDE.", + "bbox": [ + 212, + 523, + 787, + 720 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "7 Limitation", + "text_level": 1, + "bbox": [ + 215, + 744, + 354, + 760 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In the future, we would like to explore iterative adversarial data augmentation [34], which is a more promising parameter-efficient solution.", + "bbox": [ + 212, + 779, + 784, + 808 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement. The research was supported by the National Natural Science Foundation of China (U23B2009).", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 336, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. A. Geiger, P. Lenz, and R. Urtasun, \"Are we ready for autonomous driving? the kitti vision benchmark suite,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2012, pp. 3354-3361.", + "2. C. Sakaridis, D. Dai, and L. Van Gool, \"Semantic foggy scene understanding with synthetic data,\" International Journal of Computer Vision, vol. 126, no. 9, pp. 973-992, 2018.", + "3. D. Eigen, C. Puhrsch, and R. Fergus, \"Depth map prediction from a single image using a multi-scale deep network,\" in Advances in Neural Information Processing System (NeurIPS), 2014.", + "4. R. Garg, B. V. Kumar, G. Carneiro, and I. Reid, \"Unsupervised cnn for single view depth estimation: Geometry to the rescue,\" in European Conference on Computer Vision (ECCV), 2016, pp. 740-756.", + "5. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, \"Unsupervised learning of depth and ego-motion from video,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 1851-1858.", + "6. C. Godard, O. M. Aodha, and G. J. Brostow, \"Unsupervised monocular depth estimation with left-right consistency,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 270-279.", + "7. C. Godard, O. M. Aodha, M. Firman, and G. J. Brostow, \"Digging into self-supervised monocular depth prediction,\" in IEEE/CVF International Conference on Computer Vision (ICCV), 2019, pp. 3828-3838.", + "8. J. Yan, H. Zhao, P. Bu, and Y. Jin, \"Channel-wise attention-based network for self-supervised monocular depth estimation,\" in IEEE International Conference on 3D Vision (3DV), 2021, pp. 464-473.", + "9. X. Lyu, L. Liu, M. Wang, X. Kong, L. Liu, Y. Liu, X. Chen, and Y. Yuan, “Hr-depth: High resolution self-supervised monocular depth estimation,” in AAAI Conference on Artificial Intelligence (AAAI), 2021, pp. 2294-2301.", + "10. H. Zhou, D. Greenwood, and S. Taylor, \"Self-supervised monocular depth estimation with internal feature fusion,\" in *British Machine Vision Conference (BMVC)*, 2021.", + "11. C. Zhao, Y. Zhang, M. Poggi, F. Tosi, X. Guo, Z. Zhu, G. Huang, Y. Tang, and S. Mattoccia, \"MonoVit: Self-supervised monocular depth estimation with a vision transformer,\" in IEEE International Conference on 3D Vision (3DV), 2022.", + "12. S. Pillai, R. Ambru, and A. Gaidon, \"Superdepth: Self-supervised, super-resolved monocular depth estimation,\" in IEEE International Conference on Robotics and Automation (ICRA), 2019, pp. 9250-9256.", + "13. H. Zhao, O. Gallo, I. Frosio, and J. Kautz, \"Loss functions for image restoration with neural networks,\" IEEE Transactions on Computational Imaging (TCI), vol. 3, no. 1, pp. 47-57, 2016.", + "14. L. Wang, X. Sun, W. Jiang, and J. Yang, \"Drivingstereo: A large-scale dataset for stereo matching in autonomous driving scenarios,\" in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2018, pp. 5554-5561.", + "15. H. Caesar, V. Bankiti, A. H. Lang, S. Vora, V. E. Liong, Q. Xu, A. Krishnan, Y. Pan, G. Baldan, and O. Beijbom, \"nuscenes: A multimodal dataset for autonomous driving,\" arXiv preprint arXiv:1903.11027, 2019." + ], + "bbox": [ + 225, + 178, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "16. Y. Wang, W.-L. Chao, D. Garg, B. Hariharan, M. Campbell, and K. Q. Weinberger, \"Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 8445-8453.", + "17. X. Dong, M. A. Garratt, S. G. Anavatti, and H. A. Abbass, \"Towards real-time monocular depth estimation for robotics: A survey,\" IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 10, pp. 16940-16961, 2022.", + "18. Z. Cheng, J. Liang, G. Tao, D. Liu, and X. Zhang, \"Adversarial training of self-supervised monocular depth estimation against physical-world attacks,\" arXiv preprint arXiv:2301.13487, 2023.", + "19. K. Saunders, G. Vogiatzis, and L. Manso, \"Self-supervised monocular depth estimation: Let's talk about the weather,\" arXiv preprint arXiv:2307.08357, 2023.", + "20. J. Hu, M. Ozay, Y. Zhang, and T. Okatani, \"Revisiting single image depth estimation: Toward higher resolution maps with accurate object boundaries,\" in 2019 IEEE winter conference on applications of computer vision (WACV). IEEE, 2019, pp. 1043-1051.", + "21. F. Aleotti, F. Tosi, M. Poggi, and S. Mattoccia, \"Generative adversarial networks for unsupervised monocular depth prediction,\" in Proceedings of the European conference on computer vision (ECCV) workshops, 2018, pp. 0-0.", + "22. Y. Luo, J. Ren, M. Lin, J. Pang, W. Sun, H. Li, and L. Lin, \"Single view stereo matching,\" in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 155-163.", + "23. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, \"Unsupervised learning of depth and ego-motion from video,\" in Proceedings of the IEEE conference on computer vision and pattern recognition, 2017, pp. 1851-1858.", + "24. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, \"Image quality assessment: from error visibility to structural similarity,\" IEEE transactions on image processing, vol. 13, no. 4, pp. 600-612, 2004.", + "25. J. Bae, S. Moon, and S. Im, \"Deep digging into the generalization of self-supervised monocular depth estimation,\" in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 1, 2023, pp. 187-196.", + "26. E. Rusak, L. Schott, R. S. Zimmermann, J. Bitterwolf, O. Bringmann, M. Bethge, and W. Brendel, \"A simple way to make neural networks robust against diverse image corruptions,\" in Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part III 16. Springer, 2020, pp. 53-69.", + "27. L. Kong, S. Xie, H. Hu, L. X. Ng, B. Cotterreau, and W. T. Ooi, \"Robodepth: Robust out-of-distribution depth estimation under corruptions,\" Advances in Neural Information Processing Systems, vol. 36, 2024.", + "28. L. Liu, X. Song, M. Wang, Y. Liu, and L. Zhang, \"Self-supervised monocular depth estimation for all day images using domain separation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12737-12746.", + "29. A. Gurram, A. F. Tuna, F. Shen, O. Urfalioglu, and A. M. López, \"Monocular depth estimation through virtual-world supervision and real-world sfm self-supervision,\" IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 8, pp. 12738-12751, 2021.", + "30. J. Wu, C. Zhang, X. Zhang, Z. Zhang, W. T. Freeman, and J. B. Tenenbaum, \"Learning shape priors for single-view 3d completion and reconstruction,\" in Proceedings of the European Conference on Computer Vision (ECCV), 2018, pp. 646-662." + ], + "bbox": [ + 225, + 146, + 785, + 838 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 336, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "31. T. Yu, S. Kumar, A. Gupta, S. Levine, K. Hausman, and C. Finn, \"Gradient surgery for multi-task learning,\" Advances in Neural Information Processing Systems, vol. 33, pp. 5824-5836, 2020.", + "32. O. Ronneberger, P. Fischer, and T. Brox, \"U-net: Convolutional networks for biomedical image segmentation,\" in Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. Springer, 2015, pp. 234-241.", + "33. P. Liashchynskyi and P. Liashchynskyi, \"Grid search, random search, genetic algorithm: a big comparison for nas,\" arXiv preprint arXiv:1912.06059, 2019.", + "34. S. Liu, Z. Chen, W. Li, J. Zhu, J. Wang, W. Zhang, and Z. Gan, \"Efficient universal shuffle attack for visual object tracking,\" in ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2022, pp. 2739-2743.", + "35. Z. Huang, P. Zhou, S. Yan, and L. Lin, \"Scalelong: Towards more stable training of diffusion model via scaling network long skip connection,\" Advances in Neural Information Processing Systems, vol. 36, 2024.", + "36. L. Rice, A. Bair, H. Zhang, and J. Z. Kolter, \"Robustness between the worst and average case,\" Advances in Neural Information Processing Systems, vol. 34, pp. 27840-27851, 2021.", + "37. Y. Wang, Y. Ba, H. C. Zhang, H. Zhang, A. Kadambi, S. Soatto, A. Wong, and C.-J. Hsieh, “Evaluating worst case adversarial weather perturbations robustness,” in NeurIPS ML Safety Workshop, 2022.", + "38. C. Godard, O. Mac Aodha, M. Firman, and G. J. Brostow, \"Digging into self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF international conference on computer vision, 2019, pp. 3828-3838.", + "39. M. Poggi, F. Tosi, and S. Mattoccia, \"Learning monocular depth estimation with unsupervised trinocular assumptions,\" in 2018 International conference on 3d vision (3DV). IEEE, 2018, pp. 324-333.", + "40. M. Ramamonjisoa, Y. Du, and V. Lepetit, \"Predicting sharp and accurate occlusion boundaries in monocular depth estimation using displacement fields,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14648-14657.", + "41. A. Wong and S. Soatto, \"Bilateral cyclic constraint and adaptive regularization for unsupervised monocular depth prediction,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 5644-5653.", + "42. S. Zhang, J. Zhang, and D. Tao, \"Towards scale-aware, robust, and generalizable unsupervised monocular depth estimation by integrating imu motion dynamics,\" in European Conference on Computer Vision. Springer, 2022, pp. 143-160.", + "43. W. Han, J. Yin, X. Jin, X. Dai, and J. Shen, \"Brnet: Exploring comprehensive features for monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 586-602.", + "44. Z. Zhou and Q. Dong, \"Self-distilled feature aggregation for self-supervised monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 709-726.", + "45. D. Garg, Y. Wang, B. Hariharan, M. Campbell, K. Q. Weinberger, and W.-L. Chao, \"Wasserstein distances for stereo disparity estimation,\" Advances in Neural Information Processing Systems, vol. 33, pp. 22 517-22 529, 2020.", + "46. X. Chen, R. Zhang, J. Jiang, Y. Wang, G. Li, and T. H. Li, \"Self-supervised monocular depth estimation: Solving the edge-fattening problem,\" in Proceedings" + ], + "bbox": [ + 225, + 146, + 785, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2023, pp. 5776-5786.", + "47. J. Ma, X. Lei, N. Liu, X. Zhao, and S. Pu, \"Towards comprehensive representation enhancement in semantics-guided self-supervised monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 304-321.", + "48. S. Zhu, G. Brazil, and X. Liu, \"The edge of depth: Explicit constraints between segmentation and depth,\" in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2020, pp. 13116-13125.", + "49. P.-Y. Chen, A. H. Liu, Y.-C. Liu, and Y.-C. F. Wang, \"Towards scene understanding: Unsupervised monocular depth estimation with semantic-aware representation,\" in Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition, 2019, pp. 2624-2632.", + "50. H. Jung, E. Park, and S. Yoo, \"Fine-grained semantics-aware representation enhancement for self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12642-12652.", + "51. R. Peng, R. Wang, Y. Lai, L. Tang, and Y. Cai, \"Excavating the potential capacity of self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 15560-15569.", + "52. K. Wang, Z. Zhang, Z. Yan, X. Li, B. Xu, J. Li, and J. Yang, \"Regularizing nighttime weirdness: Efficient self-supervised monocular depth estimation in the dark,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 16055-16064.", + "53. M. Vankadari, S. Golodetz, S. Garg, S. Shin, A. Markham, and N. Trigoni, \"When the sun goes down: Repairing photometric losses for all-day depth estimation,\" in Conference on Robot Learning. PMLR, 2023, pp. 1992-2003.", + "54. J. Spencer, R. Bowden, and S. Hadfield, \"Defeat-net: General monocular depth via simultaneous unsupervised representation learning,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14402-14413.", + "55. A. Atapour-Abarghouei and T. P. Breckon, \"Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer,\" in Proceedings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 2800-2810.", + "56. C. Zhao, Y. Tang, and Q. Sun, \"Unsupervised monocular depth estimation in highly complex environments,\" IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 6, no. 5, pp. 1237-1246, 2022.", + "57. N. Carlini and D. Wagner, \"Towards evaluating the robustness of neural networks,\" in 2017 IEEE symposium on security and privacy (sp). IEEE, 2017, pp. 39-57.", + "58. H. Zhang and J. Wang, \"Towards adversarially robust object detection,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2019, pp. 421-430.", + "59. X. Chen, C. Xie, M. Tan, L. Zhang, C.-J. Hsieh, and B. Gong, \"Robust and accurate object detection via adversarial learning,\" in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2021, pp. 16622-16631.", + "60. X. Xu, H. Zhao, and J. Jia, \"Dynamic divide-and-conquer adversarial training for robust semantic segmentation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 7486-7495." + ], + "bbox": [ + 225, + 146, + 785, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Yao et al.", + "bbox": [ + 271, + 114, + 336, + 126 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "61. W.-C. Hung, Y.-H. Tsai, Y.-T. Liou, Y.-Y. Lin, and M.-H. Yang, “Adversarial learning for semi-supervised semantic segmentation,” arXiv preprint arXiv:1802.07934, 2018.", + "62. Y. Carmon, A. Raghunathan, L. Schmidt, J. C. Duchi, and P. S. Liang, \"Unlabeled data improves adversarial robustness,\" Advances in neural information processing systems, vol. 32, 2019.", + "63. J.-B. Alayrac, J. Uesato, P.-S. Huang, A. Fawzi, R. Stanforth, and P. Kohli, \"Are labels required for improving adversarial robustness?\" Advances in Neural Information Processing Systems, vol. 32, 2019.", + "64. C.-H. Ho and N. Nvasconcelos, \"Contrastive learning with adversarial examples,\" Advances in Neural Information Processing Systems, vol. 33, pp. 17081-17093, 2020.", + "65. M. Kim, J. Tack, and S. J. Hwang, \"Adversarial self-supervised contrastive learning,\" Advances in Neural Information Processing Systems, vol. 33, pp. 2983-2994, 2020.", + "66. S. Liu, Z. Chen, Y. Liu, Y. Wang, D. Yang, Z. Zhao, Z. Zhou, X. Yi, W. Li, W. Zhang et al., \"Improving generalization in visual reinforcement learning via conflict-aware gradient agreement augmentation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023, pp. 23436-23446.", + "67. L. Kong, Y. Niu, S. Xie, H. Hu, L. X. Ng, B. R. Cottereau, D. Zhao, L. Zhang, H. Wang, W. T. Ooi, R. Zhu, Z. Song, L. Liu, T. Zhang, J. Yu, M. Jing, P. Li, X. Qi, C. Jin, Y. Chen, J. Hou, J. Zhang, Z. Kan, Q. Ling, L. Peng, M. Li, D. Xu, C. Yang, Y. Yao, G. Wu, J. Kuai, X. Liu, J. Jiang, J. Huang, B. Li, J. Chen, S. Zhang, S. Ao, Z. Li, R. Chen, H. Luo, F. Zhao, and J. Yu, \"The robodepth challenge: Methods and advancements towards robust depth estimation,\" 2023." + ], + "bbox": [ + 222, + 146, + 787, + 507 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "SCAT", + "bbox": [ + 687, + 114, + 730, + 126 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_model.json b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_model.json new file mode 100644 index 0000000000000000000000000000000000000000..3159b97ad7f762798771cc1b7b311306049b214f --- /dev/null +++ b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_model.json @@ -0,0 +1,2702 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.237, + 0.141, + 0.768, + 0.21 + ], + "angle": 0, + "content": "Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.234, + 0.785, + 0.266 + ], + "angle": 0, + "content": "Yuanqi Yao\\(^{1}\\), Gang Wu\\(^{1}\\), Kui Jiang\\(^{1}\\), Siao Liu\\(^{2}\\), Jian Kuai\\(^{1}\\), Xianming Liu\\(^{1}\\), and Junjun Jiang\\(^{\\star 1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.237, + 0.277, + 0.765, + 0.346 + ], + "angle": 0, + "content": "\\(^{1}\\) Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China {yuanqiyao,kuaijian}@stu.hit.edu.cn {gwu,jiangkui,csxm,jiangjunjun}@hit.edu.cn \\(^{2}\\) Academy for Engineering & Technology, Fudan University saliu20@fudan.edu.com" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.382, + 0.74, + 0.659 + ], + "angle": 0, + "content": "Abstract. Learning a self-supervised Monocular Depth Estimation (MD) model with great generalization remains significantly challenging. Despite the success of adversarial augmentation in the supervised learning generalization, naively incorporating it into self-supervised MDE models potentially causes over-regularization, suffering from severe performance degradation. In this paper, we conduct qualitative analysis and illuminate the main causes: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), integrating adversarial data augmentation into self-supervised MDE methods to achieve a balance between stability and generalization. Specifically, we devise an effective scaling depth network that tunes the coefficients of long skip connection and effectively stabilizes the training process. Then, we propose a conflict gradient surgery strategy, which progressively integrates the adversarial gradient and optimizes the model toward a conflict-free direction. Extensive experiments on five benchmarks demonstrate that SCAT can achieve state-of-the-art performance and significantly improve the generalization capability of existing self-supervised MDE methods." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.673, + 0.744, + 0.702 + ], + "angle": 0, + "content": "Keywords: Domain Generalization \\(\\cdot\\) Self-Supervised Monocular Depth Estimation \\(\\cdot\\) Stabilized Adversarial Training" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.726, + 0.377, + 0.743 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.757, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Monocular depth estimation (MDE) plays an important role in various 3D perceptual fields such as robotic navigation [17], autonomous driving [16] and 3D reconstruction [30]. However, due to the dynamic nature of the real world, even minor perturbations in the environment can result in significant domain shifts in" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.383, + 0.84 + ], + "angle": 0, + "content": "* Corresponding author" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.338, + 0.127 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "image", + "bbox": [ + 0.261, + 0.154, + 0.425, + 0.274 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.343, + 0.276, + 0.358, + 0.286 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.425, + 0.157, + 0.585, + 0.276 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.501, + 0.276, + 0.517, + 0.287 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image", + "bbox": [ + 0.596, + 0.157, + 0.743, + 0.275 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.664, + 0.276, + 0.679, + 0.287 + ], + "angle": 0, + "content": "(c)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.299, + 0.788, + 0.384 + ], + "angle": 0, + "content": "Fig. 1: Visualization of the domain generalization over various methods.(a) Comparisons with offline scenario-specific data augmentation methods.(b) Comparisons with vanilla Gaussian noise and vanilla adversarial data augmentation.(c) Comparisons of different LSCs scaling factors. The results show that our SCAT has excellent generalization performance under multiple unseen domains and retains the performance on the original training set." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.395, + 0.785, + 0.426 + ], + "angle": 0, + "content": "the visual observations, which makes the trained model hard to generalize into unseen scenarios and restricts its application in the physical world." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.429, + 0.788, + 0.672 + ], + "angle": 0, + "content": "To improve the generalization capability, several studies [19, 28, 66] utilize data augmentation methods to generate synthetic data and diversify the training environments, yielding considerable performance improvements. However, existing methods such as [19] mostly select some specific data augmentation schemes for target scenarios, yielding poor generalization performance in environments varying far from the augmented images. Compared with above mentioned offline data augmentation, adversarial data augmentation (ADA) does not make any target distribution assumption and synchronously optimizes the augmenter during the training phase, providing a promising pre-processing solution. Unfortunately, there is a dilemma in naively incorporating ADA into self-supervised MDE. Although adversarial data augmentation can effectively improve generalization capability in multiple supervised visual tasks [19], self-supervised MDE algorithms are quite sensitive to such excessive perturbation, resulting in significant performance degradation and training collapse. Therefore, it is necessary to rethink why self-supervised MDE cannot benefit from ADA as much as supervised learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.788, + 0.842 + ], + "angle": 0, + "content": "In this work, we first conduct extensive quantitative analysis to investigate the causes of performance degradation when applying adversarial data augmentation to common self-supervised MDE models. There are two primary factors for this phenomenon: (i) inherent sensitivity of long skip connections (LSC) in UNet-alike depth estimation networks; (ii) dual optimization conflict caused by over-regularization. Specifically, as a core component in the MDE, LSC is widely adopted in the UNet-alike Depth Networks to combine multi-scale features and preserve low-level detail, yielding better prediction performance. However, the presence of these shortcut connections amplifies adversarial gradients, when coupled with pixel-level adversarial data augmentation, leading to severe training instability and collapse. Moreover, compared to offline data augmentation, ad" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "versarial augmentation data commonly act as the worst-case training examples [36,37] and often provides over-regularization for the model training, which results in optimization gradients that oppose those of the original data, leading to severe gradient conflicts and a subsequent decline in convergence performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.788, + 0.435 + ], + "angle": 0, + "content": "To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), tailored for self-supervised monocular depth estimation. SCAT is designed to enhance both generalization capability and stability. In particular, we develop an innovative scaling depth network that adjusts the coefficients of long skip connections within UNet architecture, thereby ensuring a more stable training regime through a theoretically supported. Furthermore, we advance a Conflict Gradient Surgery method, progressively blending the adversarial gradient to guide the model optimization along a direction devoid of conflicts. It is worth noting that one of the merits of our method SCAT is model-agnostic, and the stabilized adversarial training can be applied to diverse SOTA methods, yielding consistent generalization enhancement. To validate the effectiveness of SCAT, we conduct extensive experiments on both KITTI and KITTI-C datasets, demonstrating its cross-domain generalization capability on Foggy CityScapes, DrivingStereo and NuScenes datasets. In summary, our contributions are summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.444, + 0.784, + 0.486 + ], + "angle": 0, + "content": "- We point out the inherent sensitivity of UNet-based depth networks and the dual optimization conflict caused by over-regularization, providing a theoretical analysis of the self-supervised MDE model's instability." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.489, + 0.798, + 0.546 + ], + "angle": 0, + "content": "- We propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which efficiently incorporates adversarial augmentation into self-supervised MDE, and significantly improves the model generalization capabilities across multiple unseen domains." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.55, + 0.784, + 0.592 + ], + "angle": 0, + "content": "- We developed Conflict Gradient Surgery (CGS) to address the dual optimization conflicts induced by adversarial over-regularization, achieving a balance between model stability and generalization." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.444, + 0.798, + 0.592 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.618, + 0.396, + 0.634 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.65, + 0.636, + 0.667 + ], + "angle": 0, + "content": "2.1 Self-Supervised Monocular Depth Estimation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.79, + 0.84 + ], + "angle": 0, + "content": "Self-supervised monocular depth estimation (MDE) has made remarkable progress in recent years, enabling depth learning from unlabeled data. The seminal work by Zhou et al. [23] laid the foundation by jointly optimizing depth and pose networks using an image reconstruction loss. Since then, two main approaches have emerged: stereo training and monocular training. Stereo training methods utilize synchronized stereo image pairs to predict disparity maps, with notable contributions including photometric consistency loss [4], left-right consistency [6], and continuous disparity prediction [45]. Monocular training, on the other hand, relies on the consistency between synthesized and actual scene views, with SfM-Learner [23] pioneering the joint training of a DepthNet and a PoseNet using a photometric loss. Researchers have also explored complementary techniques" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.232, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.339, + 0.129 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.222 + ], + "angle": 0, + "content": "to further boost performance, such as occlusion modeling [38-41], scale ambiguity [42] advanced network architectures [12, 43, 44], semantic information integration [46-50], and object size cues [48, 51]. The proposed use of orthogonal planes for improved depth representation in driving scenarios contributes to the ongoing advancements in this field." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.259, + 0.724, + 0.274 + ], + "angle": 0, + "content": "2.2 Domain Generalization in Monocular Depth Estimation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.298, + 0.79, + 0.555 + ], + "angle": 0, + "content": "A line of studies investigated how to utilize data augmentation or synthetic data generation to improve the domain generalization capability of MDE [19, 28, 29, 52-56]. ADDS-DepthNet [28] generates night image pairs from day images using GANs, training the network to be effective in both day and night domains. It uses day depth estimates as pseudo-supervision for night scenes, which limits the night depth estimation to the accuracy of the day estimates. Additionally, ADDS-DepthNet focuses on reconstructing GAN-generated night images, which generates reconstruction targets with high variance, resulting detrimental to the self-supervised MDE algorithm. ITDFA [56] employs a fixed depth decoder and adapts the encoders for each domain to enforce feature consistency across domains, which is limited to the performance. Robust-Depth [19] put forward an offline data augmentation method. By exploiting the correspondence between unaugmented and augmented data they introduce a pseudo-supervised loss for both depth and pose estimation. However, previous approaches limited the ability to handle environments with pre-defined variations and require substantial architectural modifications to obtain realistic depth estimates, leading to severe domain bias when applied to real-world scenes [19, 28]." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.591, + 0.434, + 0.607 + ], + "angle": 0, + "content": "2.3 Adversarial Training" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Adversarial training has emerged as a popular technique to improve the generalization capability of deep neural networks. This approach involves incorporating both benign and adversarial examples during the training process, enabling models to learn more robust features [57]. Researchers have successfully applied adversarial training to various computer vision tasks, such as image classification [26, 57], object detection [58, 59], and segmentation [60, 61]. However, generating adversarial examples typically requires ground truth labels, which limits the applicability of adversarial training to supervised learning settings. To address this limitation, semi-supervised adversarial learning methods [62, 63] have been proposed, which leverage a small portion of labeled data to enhance robustness. Additionally, contrastive learning [64, 65] has been combined with adversarial examples to improve self-supervised learning and model robustness. In the context of MDE, adversarial training remains largely unexplored, particularly in self-supervised MDE which absent the ground truth depth information." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.383, + 0.161 + ], + "angle": 0, + "content": "3 Preliminaries" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.176, + 0.44, + 0.19 + ], + "angle": 0, + "content": "3.1 Problem Formulation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.201, + 0.788, + 0.322 + ], + "angle": 0, + "content": "Following [5, 7], we regard the self-supervised depth estimation as an image reconstruction task, where the objective is to reconstruct the target current frame image \\( I_{t} \\) from consecutive frames \\( I_{t}^{\\prime} \\in \\{I_{t - 1}, I_{t + 1}\\} \\). Specifically, we construct a dual-branch framework, involving a DepthNet and a PoseNet. The former is used for estimating depth map \\( D_{t} \\) while the latter is introduced to predict the relative poses \\( T_{t' \\to t} \\) through the inverse warping as below, the predicted depth map \\( D_{t} \\) in conjunction with the relative poses \\( T_{t' \\to t} \\) can synthesize the target image \\( I_{t' \\to t} \\), depicted as:" + }, + { + "type": "equation", + "bbox": [ + 0.382, + 0.332, + 0.786, + 0.358 + ], + "angle": 0, + "content": "\\[\nI _ {t ^ {\\prime} \\rightarrow t} = I _ {t ^ {\\prime}} \\left\\langle \\operatorname {p r o j} \\left(D _ {t}, T _ {t \\rightarrow t ^ {\\prime}}, K\\right)\\right\\rangle , \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.367, + 0.788, + 0.414 + ], + "angle": 0, + "content": "where \\( proj(\\cdot) \\) generates the resulting 2D coordinates of the projected depths \\( Dt \\) in \\( It' \\) and \\( \\langle \\rangle \\) refers to the sampling operator. We minimize the photometric reprojection error \\( \\mathcal{L}_p \\) to supervise the DepthNet," + }, + { + "type": "equation", + "bbox": [ + 0.419, + 0.424, + 0.786, + 0.455 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {p} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, I _ {t ^ {\\prime} \\rightarrow t}\\right), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.465, + 0.788, + 0.511 + ], + "angle": 0, + "content": "where \\(pe\\) is the photometric reconstruction error. As suggestion in [6, 13], we adopt the weighted combination of \\(L_{1}\\) loss and SSIM [24] to formulate the photometric error function \\(pe\\), denoted as:" + }, + { + "type": "equation", + "bbox": [ + 0.312, + 0.521, + 0.786, + 0.547 + ], + "angle": 0, + "content": "\\[\np e (I _ {a}, I _ {b}) = \\frac {\\alpha}{2} (1 - \\operatorname {S S I M} (I _ {a}, I _ {b})) + (1 - \\alpha) | | I _ {a} - I _ {b} | | _ {1}. \\tag {3}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.565, + 0.621, + 0.58 + ], + "angle": 0, + "content": "3.2 Analysis on Unstable Self-Supervised MDE" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.59, + 0.787, + 0.62 + ], + "angle": 0, + "content": "In this section, we aim to investigate the primary causes why naively applying adversarial data augmentation in self-supervised MDE leads to instability." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.62, + 0.787, + 0.68 + ], + "angle": 0, + "content": "Pitfall1: Sensitive UNet-alike Depth Network. In previous self-supervised MDE methods [7-9], UNet [32] is the most popular depth network backbone, since its long skip connects (LSCs) to connect distant network blocks can fuse multi-granularity semantic information and spatial information:" + }, + { + "type": "equation", + "bbox": [ + 0.273, + 0.692, + 0.787, + 0.709 + ], + "angle": 0, + "content": "\\[\n\\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \\circ [ a _ {i + 1} \\circ x + f _ {i + 1} (a _ {i + 1} \\circ x) ], \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.718, + 0.788, + 0.841 + ], + "angle": 0, + "content": "where \\( x \\in R^{m} \\) denotes the input, \\( a_{i} \\) and \\( b_{i}(i \\geq 1) \\) are the trainable parameter of the \\( i \\)-th block. For the vector operation \\( \\circ \\), it can be designed to implement different networks. Assume an extra noise \\( \\epsilon_{\\delta} \\sim N(0, \\sigma_{\\delta}^2 I) \\) is injected into \\( I_{t} \\) which yields a new input \\( \\tilde{I}_{t}' \\), self-supervised MDE with data augmentations aims to reprojection \\( I_{t' \\to t} \\) from the noisy input \\( \\tilde{I}_{t'} \\). Accordingly, if the variance \\( \\sigma_{\\delta}^2 \\) of extra noise is large, it can hinder re-projecting the desired target image \\( I_{t' \\to t} \\). In adversarial training, the variance of this extra noise varies along training iterations, further exacerbating the instability of self-supervised MDE training." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.338, + 0.127 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.237 + ], + "angle": 0, + "content": "Recent work [35] also reveals a similar phenomenon, which demonstrates that the UNet-based segmentation architecture is sensitive to perturbed noise, suffering from catastrophic training collapse. It is noteworthy that, although our theoretical analysis is focused on UNet-based depth estimation architectures, the LSC component is extensively employed across various mainstream architectures [11], thereby lending a degree of extensibility to our empirical results." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.238, + 0.789, + 0.466 + ], + "angle": 0, + "content": "Pitfall2: Dual Optimization Conflict by Over-Regularization. Compared to the offline data augmentation in Robust-Depth [19], Adversarial Data Augmentation (ADA) makes no assumptions about the target distribution and synchronously optimizes augmenters during the training phase, offering a promising pre-processing solution. Unfortunately, naively incorporating ADA into self-supervised Monocular Depth Estimation (MDE) presents a dilemma. While adversarial data augmentation can effectively enhance generalization in various supervised visual tasks, a dual optimization conflict arises due to the opposing gradient optimization directions between the adversarial-perturbed data and the original data. Similar to [31], we also define \\(\\phi_{ij}\\) as the angle between origin data \\(g_i\\) and adversarial-perturbed data gradient \\(g_j\\), the gradients as conflicting when \\(\\cos \\phi_{ij} < 0\\). Therefore, for self-supervised MDE, over-regularization leads to ADA dominating the gradient updates, resulting in significant performance degradation and training collapse. We refer to this issue as a dual optimization conflict caused by over-regularization." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.487, + 0.331, + 0.503 + ], + "angle": 0, + "content": "4 Method" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.519, + 0.456, + 0.533 + ], + "angle": 0, + "content": "4.1 Architectural Overview" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.543, + 0.788, + 0.634 + ], + "angle": 0, + "content": "In this section, we propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which is compatible with any self-supervised MDE method. An overview of the SCAT architecture is provided in Fig. 2. To circumvent erroneous bootstrapping from adversarial augmented data, augmentation was applied to improve generalization by reconstructing the unaugmented \\( I_{t} \\), rather than the augmented image \\( \\tilde{I}_{t} \\)." + }, + { + "type": "equation", + "bbox": [ + 0.46, + 0.645, + 0.785, + 0.663 + ], + "angle": 0, + "content": "\\[\n\\tilde {I} _ {t ^ {\\prime}} = I _ {t ^ {\\prime}} + \\delta \\tag {5}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.382, + 0.673, + 0.785, + 0.697 + ], + "angle": 0, + "content": "\\[\n\\tilde {I} _ {t ^ {\\prime} \\rightarrow t} = I _ {t ^ {\\prime}} \\left\\langle \\operatorname {p r o j} \\left(\\tilde {D} _ {t}, \\tilde {T} _ {t \\rightarrow t ^ {\\prime}}, K\\right)\\right\\rangle , \\tag {6}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.367, + 0.705, + 0.785, + 0.734 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {p} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, I _ {t ^ {\\prime} \\rightarrow t}\\right) + p e \\left(I _ {t}, \\tilde {I} _ {t ^ {\\prime} \\rightarrow t}\\right). \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.741, + 0.788, + 0.802 + ], + "angle": 0, + "content": "If \\(\\delta\\) is learned (i.e. SCAT is implemented with an adversarial generator \\(\\delta = g_{\\phi}(z)\\), to introduce adversarial training into self-supervised MDE, we calculate the reprojection loss for the current frame image reconstructed from the perturbed images and use it as the self-supervised constraint loss \\(\\mathcal{L}_{AD}\\):" + }, + { + "type": "equation", + "bbox": [ + 0.413, + 0.813, + 0.785, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {A D} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, \\tilde {I} _ {t ^ {\\prime} \\rightarrow t}\\right). \\tag {8}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.157, + 0.784, + 0.371 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.386, + 0.785, + 0.476 + ], + "angle": 0, + "content": "Fig. 2: Overview of our SCAT architecture. Our method introduces an adversarial noise generator, which is optimized through \\(\\mathcal{L}_{AD}\\) and acts as an adversarial constraint, while \\(\\mathcal{L}_p\\) imposes self-supervised constraints to optimize self-supervised MDE model. CGS incrementally applies adversarial augmenters from multiple iterations, enabling a balanced achievement in model generalization and stability. Meanwhile, we utilize a scaling depth network(SDN) to stabilize the training process." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.501, + 0.785, + 0.547 + ], + "angle": 0, + "content": "Our goal is to find a noise distribution \\(p_{\\phi}(\\delta)\\), \\(\\delta \\in R^{N}\\) and \\(\\| \\delta \\| _2 = \\epsilon\\), such that noise samples added to input clean image \\(I_{t}\\) maximally confuse the depth network. More concisely, we optimize the following equation, depicted as" + }, + { + "type": "equation", + "bbox": [ + 0.353, + 0.558, + 0.785, + 0.587 + ], + "angle": 0, + "content": "\\[\n\\min _ {\\theta} \\max _ {\\phi} \\mathbb {E} _ {\\tilde {I} _ {t ^ {\\prime}}, I _ {t}} \\mathbb {E} _ {\\delta \\sim p _ {\\phi} (\\delta)} \\left[ \\mathcal {L} \\left(f _ {\\theta} \\left(\\tilde {I} _ {t ^ {\\prime}}\\right), I _ {t}\\right) \\right]. \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.598, + 0.784, + 0.704 + ], + "angle": 0, + "content": "Specifically, \\( \\max_{\\phi} \\) represents the adversarial noise generator's attempt to maximize the \\( \\mathcal{L}_{AD} \\), thereby generating adversarial samples that maximally perturb the depth network. Conversely, \\( \\min_{\\theta} \\) denotes the depth network's effort to minimize the \\( \\mathcal{L}_p \\) on these adversarial samples, aiming to achieve robustness in depth estimation across various adversarial inputs. Through training iterations provided in Algorithm 1 in our SCAT framework, self-supervised MDE models becomes proficient at accurately inferring various perturbed images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.785, + 0.841 + ], + "angle": 0, + "content": "However, as the variance of this extra adversarial noise varies along training, the standard UNet-based depth network is too sensitive to these perturbations. Hence, we propose a Scaling Depth Network (SDN), which appropriately scales the coefficients \\(\\kappa_{i}\\) to lower reconstruction error. In addition, conflict arises by opposing gradient optimization directions between the adversarial-perturbed data and original data, further exacerbating the training instability. To ensure the model has enough representational power while preventing unstable parameter updates, we propose Conflict Gradient Surgery (CGS) to refine the adversarial training gradient update process, which we introduce in the following section." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.339, + 0.128 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.457, + 0.163 + ], + "angle": 0, + "content": "4.2 Scaling Depth Network" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.172, + 0.784, + 0.203 + ], + "angle": 0, + "content": "To alleviate the impact of extra noise, we devise scaling depth network (SDN) to scale the coefficients \\(\\kappa_{i}\\) of LSCs:" + }, + { + "type": "equation", + "bbox": [ + 0.236, + 0.214, + 0.786, + 0.232 + ], + "angle": 0, + "content": "\\[\n\\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \\circ \\left[ k _ {i + 1} \\cdot a _ {i + 1} \\circ x + f _ {i + 1} \\left(a _ {i + 1} \\circ x\\right) \\right], \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.242, + 0.784, + 0.319 + ], + "angle": 0, + "content": "where \\(\\kappa_{i} > 0\\), \\((i \\geq 1)\\) are the scaling coefficients and are set to 1 in standard UNet-based depth network. For scaling depth network in Eq.10, assume \\(M_0 = \\max \\{||b_i \\circ a_i||_2, 1 \\leq i \\leq N\\}\\) and \\(f_N\\) is \\(L_0\\)-Lipschitz continuous, \\(c_0\\) is a constant related to \\(M_0\\) and \\(L_0\\). Suppose \\(I_t^{\\epsilon_\\delta}\\) is an perturbed input of the vanilla input \\(I_t\\) with a small perturbation \\(\\epsilon_\\delta = ||I_t^{\\epsilon_\\delta} - I_t||_2\\). Then we have" + }, + { + "type": "equation", + "bbox": [ + 0.353, + 0.33, + 0.786, + 0.372 + ], + "angle": 0, + "content": "\\[\n\\left| \\left| f _ {\\theta} \\left(\\mathbf {I} _ {t} ^ {\\epsilon_ {\\delta}}\\right) - f _ {\\theta} \\left(\\mathbf {I} _ {t}\\right) \\right| \\right| _ {2} \\leq \\epsilon_ {\\delta} \\left[ \\sum_ {i = 1} ^ {N} \\kappa_ {i} M _ {0} ^ {i} + c _ {0} \\right], \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.381, + 0.784, + 0.396 + ], + "angle": 0, + "content": "where \\(N\\) is the number of the long skip connections. See the proof in Appendix." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.397, + 0.788, + 0.609 + ], + "angle": 0, + "content": "Eq.11 shows that for a perturbation magnitude \\(\\epsilon_{\\delta}\\), the reconstruction error bound of depth network is \\(\\mathcal{O}(\\epsilon_{\\delta}\\left(\\sum_{k = 1}K_{i}M_{0}^{i}\\right)\\). For standard UNet-based depth network (\\(\\kappa_{i} = 1\\forall i\\)), this bound becomes a very large bound \\(\\mathcal{O}(NM_0^N)\\). This implies that a standard UNet-based depth network is sensitive to extra noise in the input, especially when LSC number \\(N\\) is large. Intuitively, setting appropriate scaling coefficients \\(\\kappa_{i}\\) in our scaling depth network can enhance the robustness of the model to input perturbations, thereby improving better stability for self-supervised MDE. To derive the scaling coefficient \\(\\kappa\\), we adopt a heuristic algorithm to assign a uniform constant value of \\(\\kappa_{*}\\) across all LSCs, with the default set to 0.7. In terms of implementation, a line of parameter optimization techniques [33,35] can be applied, e.g. incorporating an adaptive projection layer [35] for each LSC component. The empirical discussions in the Appendix demonstrate that a singular scaling parameter \\(\\kappa\\) is sufficient to strike to balance performance and efficiency for the self-supervised MDE task." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.63, + 0.478, + 0.646 + ], + "angle": 0, + "content": "4.3 Conflict Gradient Surgery" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.655, + 0.784, + 0.761 + ], + "angle": 0, + "content": "Here, we propose to modify the standard adversarial data augmentation (ADA) by incorporating conflict gradient surgery named CGS, aiming to change the distribution of \\( \\cos(\\theta) \\) tends towards positive values, where \\( \\theta \\) is the angle between the gradient of the original data and the gradient of the CGS adversarial data, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, and finally improves the robustness of the model to perturbations:" + }, + { + "type": "equation", + "bbox": [ + 0.347, + 0.772, + 0.657, + 0.802 + ], + "angle": 0, + "content": "\\[\n\\mathbb {E} \\left[ \\cos (\\theta) \\right] > 0, \\quad \\text {w h e r e} \\cos (\\theta_ {i}) = \\frac {g _ {i} \\cdot g _ {\\operatorname* {m i x} _ {i}}}{| g _ {i} | | g _ {\\operatorname* {m i x} _ {i}} |}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "where \\( g_{i} \\) is the gradient of the i-th original data, \\( g_{mix_i} \\) is the gradient of the i-th mixed adversarial data. We calculate the gradient cosine similarity between" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.299 + ], + "angle": 0, + "content": "the gradient of the adversarial-perturbed data and the original data. We define two gradients as conflicting if their cosine similarity is negative, indicating they are diverging from one another. If the distribution of cosine similarities tends to be negative, it signifies the presence of numerous adversely oriented gradients, which can mislead the gradient optimization process. As illustrated in Fig. 3, we extracted 1000 images from the KITTI dataset and recorded the gradient cosine similarity between pairs of adversarial perturbation data and original data. Without employing conflict gradient surgery, the gradient conflict becomes a prevalent issue as the adversarial training progresses iteratively, consequently leading slower convergence and performance degradation." + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.304, + 0.75, + 0.459 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.462, + 0.788, + 0.52 + ], + "angle": 0, + "content": "Fig. 3: (a) Statistics of gradient cosine similarity. Through CGS, we have shifted the distribution of cosine similarities from being negatively skewed to positively skewed, mitigating the previously prevalent issue of adversely oriented gradients. (b) Illustration of training oscillation issue arising from Dual Optimization Conflict." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.526, + 0.788, + 0.678 + ], + "angle": 0, + "content": "Experimental observations provided in Fig. 3 demonstrate that our approach ensures the expectation of \\( \\cos(\\theta) \\) is positive, thereby skewing the distribution of \\( \\cos(\\theta) \\) tends towards positive values, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, ultimately enhancing the model's robustness against perturbations. Specifically, given a set of gradient vectors (one for each adversarial data augmentation), we construct the adversarial perturbation data while employing multiple adversarial generators from previous iterations, restraining the over-regularization caused by the conflict component through our conflict gradient surgery. The update procedure of the CGS algorithm is provided in Algorithm 1." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.697, + 0.377, + 0.715 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.727, + 0.447, + 0.743 + ], + "angle": 0, + "content": "5.1 Experimental Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.841 + ], + "angle": 0, + "content": "KITTI [1] KITTI dataset is collected for mobile robotics and autonomous driving, involving hours of traffic scenarios recorded with a variety of sensor modalities, including high-resolution RGB, grayscale stereo cameras, and a 3D laser scanner. Following the setting in [5], we use 39,810 images for training and 4,424 for validation. Subsequently, we rigorously evaluate the proposed method and other compared methods on the KITTI eigen test dataset [3]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.338, + 0.127 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "code_caption", + "bbox": [ + 0.218, + 0.146, + 0.657, + 0.161 + ], + "angle": 0, + "content": "Algorithm 1 Generic SCAT self-supervised MDE algorithm" + }, + { + "type": "code", + "bbox": [ + 0.406, + 0.162, + 0.786, + 0.178 + ], + "angle": 0, + "content": "( \\(\\triangleright\\) vanilla self-supervised MDE, \\(\\triangleright\\) our modifications)" + }, + { + "type": "algorithm", + "bbox": [ + 0.217, + 0.18, + 0.789, + 0.378 + ], + "angle": 0, + "content": "1: for Epoch e = 1...n do do \n2: Adversarial Data Augmentation via CGS: \n3: g1:j ~ Sample(B, j) ▷Randomly select generators from History Buffer. \n4: δ1:j = g1:j(It) ▷Generate adversarial noise from clean images. \n5: I1:j = It + δ1:j ▷Obtain adversarial images. \n6: Deterministic Reprojection with SDN: \n7: Dt = ScalingDepthNet(It), Pt = PoseNet(It) \n8: Obtain clean depth map and camera poses. \n9: Obtain adversarial depth map and camera poses. \n10: I t'→t ⇔ fθ(I t'), I t'→t ⇔ fθ(I t') \n11: Reconstruct adversarial and clean images with the same target. \n12: B ← B ∪ ge ▷Add current Generator into History Buffer B. \n13: θ ← θ - ηθ∇θLp(f, It; θ) ▷Optimize MDE fθ with LP in Eq. 7. \n14: φ ← φ + ηφ∇φLAD(gφ, It; φ) ▷Optimize Generator gφ with LAD in Eq. 8. \n15: end for" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.393, + 0.789, + 0.425 + ], + "angle": 0, + "content": "Table 1: Quantitative Results for the KITTI-C Dataset. Pink cell denotes the best performance, while yellow one denotes suboptimal." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.439, + 0.789, + 0.643 + ], + "angle": 0, + "content": "
MethodW × HmCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]640 × 192101.0484.080.2481.7646.8520.2910.6980.8740.944
+ DA640 × 19297.7284.960.2271.7616.7350.2930.7100.8760.944
+ ADA640 × 19289.3187.310.1931.6326.4270.2780.7340.8820.945
+ SCAT (ours)640 × 19286.3290.130.1651.5736.1570.2690.7620.8930.951
CADepth [8]640 × 192108.1080.120.2711.9026.9000.3020.6740.8600.938
+ DA640 × 192107.1481.310.2611.8746.8320.2990.6910.8650.939
+ ADA640 × 19299.8183.130.2351.8666.5650.2780.7210.8710.940
+ SCAT (ours)640 × 19295.5487.930.1971.7946.2580.2640.7470.8830.948
HR-Depth [9]640 × 192103.6782.880.2551.9606.9090.3090.6700.8540.933
+ DA640 × 192101.7483.230.2431.9426.7870.2940.6850.8590.936
+ ADA640 × 19293.8485.320.2151.8316.6250.2780.6990.8610.939
+ SCAT (ours)640 × 19287.0689.470.1891.7326.2040.2580.7410.8710.945
MonoVit [11]640 × 19280.5488.980.1911.2745.9980.2450.7710.9220.964
+ DA640 × 19278.3290.470.1871.2565.8730.2280.7870.9310.965
+ ADA640 × 19272.4192.340.1661.1345.6260.2110.8190.9350.969
+ SCAT (ours)640 × 19262.7495.380.1271.0585.2740.2080.8460.9470.976
Robust-Depth* [19]640 × 19255.7296.460.1210.9545.0510.2010.8540.9520.978
+ DA640 × 19260.1296.340.1240.9635.0120.2130.8520.9510.977
+ ADA640 × 19254.2397.590.1190.9434.9850.1990.8530.9510.977
+ SCAT (ours)640 × 19253.3798.190.1170.9324.8720.1870.8610.9550.979
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.664, + 0.788, + 0.725 + ], + "angle": 0, + "content": "KITTI-C [67] To evaluate the robustness and safety of our method in out-of-distribution (OoD) scenarios, we utilize KITTI-C dataset as a benchmark. The diverse corruptions enable the reliability of simulation to the potential perturbation distribution in real-world scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.729, + 0.788, + 0.79 + ], + "angle": 0, + "content": "DrivingStereo [14] It contains 500 images captured under different weather conditions, involving foggy, cloudy, rainy, and sunny. These images offer a realistic representation of various driving scenarios, enabling robust evaluation of depth estimation performance across diverse domains." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Foggy CityScapes [2] Foggy CityScapes is a synthetic fog dataset that simulates real-world foggy scenarios. Each foggy sample is generated using the corresponding clear image and depth map from CityScapes dataset." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.222, + 0.147, + 0.361, + 0.201 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.271, + 0.202, + 0.31, + 0.209 + ], + "angle": 0, + "content": "\\(\\epsilon_{m} = 20\\)" + }, + { + "type": "image", + "bbox": [ + 0.363, + 0.147, + 0.501, + 0.201 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.413, + 0.201, + 0.452, + 0.209 + ], + "angle": 0, + "content": "\\(\\epsilon_{m} = 40\\)" + }, + { + "type": "image", + "bbox": [ + 0.501, + 0.147, + 0.641, + 0.201 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.552, + 0.201, + 0.591, + 0.21 + ], + "angle": 0, + "content": "\\(\\epsilon_{m} = 80\\)" + }, + { + "type": "image", + "bbox": [ + 0.642, + 0.147, + 0.781, + 0.201 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.692, + 0.201, + 0.738, + 0.21 + ], + "angle": 0, + "content": "\\(\\epsilon_{m} = 135\\)" + }, + { + "type": "image_caption", + "bbox": [ + 0.268, + 0.211, + 0.733, + 0.224 + ], + "angle": 0, + "content": "Fig. 4: Example images with different \\(\\epsilon_{m}\\) of adversarial perturbation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.237, + 0.784, + 0.282 + ], + "angle": 0, + "content": "NuScenes [15] The NuScenes dataset comprises approximately 15,000 images captured in real nighttime urban street settings. To validate the model generalization, NuScenes is also selected as an evaluation benchmark in our study." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.291, + 0.785, + 0.334 + ], + "angle": 0, + "content": "Table 2: Quantitative Results for the KITTI Eigen Test Dataset. The results indicate that SCAT largely maintains the performance of all baselines compared to vanilla ADA, ensuring the ability to infer accurate depth information on clean images." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.345, + 0.787, + 0.535 + ], + "angle": 0, + "content": "
MethodW × HAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
Monodepth2 [7]640 × 1920.1150.9034.8630.1930.8770.9590.981
+ ADA640 × 1920.1210.9784.9920.2210.8620.9530.978
+ SCAT (ours)640 × 1920.1160.9424.8770.1930.8770.9580.981
CADepth [8]640 × 1920.1050.7694.5350.1810.8920.9640.983
+ ADA640 × 1920.1080.8124.5850.1900.8870.9620.982
+ SCAT (ours)640 × 1920.1060.7964.5790.1830.8900.9630.983
DIFFNet [10]640 × 1920.1020.7494.4450.1790.8970.9650.983
+ ADA640 × 1920.1060.7934.5920.1840.8890.9630.982
+ SCAT (ours)640 × 1920.1030.7644.4530.1800.8970.9650.983
MonoVit [11]640 × 1920.0990.7084.3720.1750.9000.9670.984
+ ADA640 × 1920.1060.7334.5910.1840.8970.9630.982
+ SCAT (ours)640 × 1920.1000.7164.3890.1750.8990.9670.984
Robust-Depth* [19]640 × 1920.1000.7474.4550.1770.8950.9660.984
+ ADA640 × 1920.1050.7834.6980.1820.8890.9530.981
+ SCAT (ours)640 × 1920.1010.7544.4590.1770.8950.9660.984
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.565, + 0.491, + 0.579 + ], + "angle": 0, + "content": "5.2 Effect of Perturbation Sizes" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.593, + 0.784, + 0.623 + ], + "angle": 0, + "content": "To evaluate the effect of adversarial perturbation magnitude on model generalization, here we employ \\(\\epsilon_{m}\\) to perturbation sizes:" + }, + { + "type": "equation", + "bbox": [ + 0.435, + 0.637, + 0.785, + 0.653 + ], + "angle": 0, + "content": "\\[\n\\epsilon_ {m} = \\min \\| \\delta_ {\\min } \\| _ {2}. \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.666, + 0.784, + 0.711 + ], + "angle": 0, + "content": "We measure model generalization capability by calculating the median perturbation size \\(\\epsilon_{m}\\) and report the results in Tab. 3. To provide a better intuition for the noise level for particular \\(\\epsilon_{m}\\), we display example images in Fig. 4." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.737, + 0.528, + 0.751 + ], + "angle": 0, + "content": "5.3 Results on KITTI-C and KITTI" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.785, + 0.84 + ], + "angle": 0, + "content": "In this section, we compare the depth estimation performance of our SCAT on the KITTI-C and KITTI datasets. Quantitative results on the KITTI-C dataset are shown in Tab. 1. We conducted extensive experiments on multiple baseline models, comparing it with the generalization performance between offline data augmentation (DA) and vanilla adversarial data augmentation (ADA). As" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.338, + 0.127 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 3: Qualitative Results for different perturbation sizes. We compare the results obtained by \\(\\epsilon_{m} = 135.0\\) adversarial noise generator with its counterparts of different perturbation sizes. Note that \\(\\epsilon_{m} = 135.0\\) was used in all experiments in this paper apart from this ablation study." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.213, + 0.787, + 0.294 + ], + "angle": 0, + "content": "
ModelMCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]101.0484.080.2481.7646.8520.2910.6980.8740.944
+ gφεm = 2093.9686.170.1961.6196.3850.2850.7380.8830.947
+ gφεm = 4090.1586.930.1871.6136.3510.2820.7410.8850.949
+ gφεm = 8088.9587.210.1821.6026.2880.2790.7490.8900.949
+ gφεm = 13586.3290.130.1651.5736.1570.2690.7620.8930.951
+ gφεm = 18088.1786.830.1771.5946.1950.2770.7580.8910.950
" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.306, + 0.782, + 0.507 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.52, + 0.788, + 0.592 + ], + "angle": 0, + "content": "Fig. 5: Qualitative Results for KITTI-C. As the SOTA self-supervised MDE methods, MonoDepth and MonoVit excel on the KITTI dataset, but struggle to accurately infer depth information from various types of damaged images in out-of-distribution (OoD) domains. With our SCAT framework, their depth estimation performance in challenging cross-domain scenarios can be substantially improved." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.608, + 0.788, + 0.7 + ], + "angle": 0, + "content": "expected, our method demonstrates a significant advantage on the mean corruption error (mCE) and mean resilience rate (mRR) scores. Especially for 18 common out-of-distribution corruption types, with all baseline models, our proposed SCAT method outperforms the competitors in almost all of metrics, providing a general framework to enhance cross-domain generalization capability for existing self-supervised monocular depth estimation methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.723, + 0.598, + 0.739 + ], + "angle": 0, + "content": "5.4 Results on Cross-Domain Generalization" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "To demonstrate the generalization capability of our SCAT over real cross-domain scenarios, like foggy and nighttime samples, we also conduct the experiments on Foggy CityScapes dataset, DrivingStereo dataset and NuScenes dataset, which are shown in Fig. 6 and Fig. 7. As expected, our SCAT generates depth estimation results with more reliable and clearer contours in all weather conditions. By contrast, vanilla MonoDepth2 and MonoVit suffer from significant performance" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.151, + 0.782, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.293, + 0.788, + 0.322 + ], + "angle": 0, + "content": "Fig. 6: Qualitative Results for Foggy CityScapes. We conduct testing to assess SCAT's generalization on a synthetically generated dataset with more severe fog." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.335, + 0.785, + 0.35 + ], + "angle": 0, + "content": "Table 4: Quantitative Results for the Real-World NuScenes-Night Dataset." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.362, + 0.784, + 0.476 + ], + "angle": 0, + "content": "
DatasetMethodAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252↑δ < 1.253↑
NuScenes-Night [15]Monodepth2 [7]0.3976.20614.5690.5680.3780.6500.794
+ SCAT (ours)0.3555.11212.4360.4990.3920.6710.863
HR-Depth [9]0.4616.63315.0280.6220.3010.5710.749
+ SCAT (ours)0.4245.80213.6850.6020.3240.5840.827
CADepth [8]0.4215.94914.5090.5930.3310.6130.776
+ SCAT (ours)0.3875.52411.9620.5770.3650.6550.834
MonoVit [11]0.3134.14312.2520.4550.4850.7360.858
+ SCAT (ours)0.2844.12610.1390.4010.4970.7520.879
Robust-Depth* [19]0.2764.07510.4700.3800.6070.8190.912
+ SCAT (ours)0.2633.9739.4620.3710.6090.8190.913
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.788, + 0.598 + ], + "angle": 0, + "content": "decline when handling real and unknown scenarios, in particular in the rainy and nighttime scenes. Notably, it can be observed that our SCAT method can effectively recover challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real-world cross-domain scenarios. Quantitative results are summarized in Tab. 4, showing that our proposed SCAT framework gains better performance on all metrics with multiple state-of-the-art methods. More results are shown in the Appendix." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.618, + 0.391, + 0.634 + ], + "angle": 0, + "content": "5.5 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.642, + 0.788, + 0.779 + ], + "angle": 0, + "content": "Effectiveness of Individual Components. To improve the stability and generalization capability of self-supervised MDE methods, SCAT presents a stabilized adversarial training framework with Conflict Gradient Surgery (CGS), progressively integrating the adversarial-perturbed data to prevent gradient conflict. In addition, we propose a scaling depth network named SDN, reducing the perturbation sensitivity of the UNet-based depth network. We perform an ablation study to investigate the effectiveness of individual components in SCAT and the results are shown in Tab. 5. Individually, each of these contributes significantly to the improvement of generalization performance across multiple datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Impact of LSCs Coefficient \\(\\kappa\\). In our experiments, the value of the long skip connections (LSCs) coefficient \\(\\kappa\\) was set to balance the self-supervised MDE model's stability and generalization capability, which defaults to 0.7 in the paper. To assess the perturbation sensitivity of UNet-based depth networks, we" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.338, + 0.127 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.142, + 0.782, + 0.251 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.263, + 0.788, + 0.306 + ], + "angle": 0, + "content": "Fig. 7: Qualitative results on Driving Stereo and Nuscenes. It can be observed that our SCAT method effectively recovers challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real scenarios." + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.31, + 0.788, + 0.372 + ], + "angle": 0, + "content": "compare the model performance over constant values of \\(\\kappa \\in \\{0.1, 0.3, 0.7, 1.0\\}\\). Fig. 1 shows that when \\(\\kappa\\) is set to 0.7, our scaling depth network has extraordinary generalization capability to unseen scenarios in the KITTI-C dataset while keeping the depth estimation performance of the KITTI dataset." + }, + { + "type": "table", + "bbox": [ + 0.242, + 0.41, + 0.544, + 0.468 + ], + "angle": 0, + "content": "
CGSSDNKITTIKITTI-C
Abs Relδ < 1.25Abs Relδ < 1.25
0.1210.8620.1930.734
✓0.1170.8690.1740.752
✓0.1180.8650.1790.748
✓✓0.1160.8770.1650.762
" + }, + { + "type": "table_caption", + "bbox": [ + 0.25, + 0.468, + 0.533, + 0.48 + ], + "angle": 0, + "content": "Table 5: Effect of individual components." + }, + { + "type": "image", + "bbox": [ + 0.572, + 0.394, + 0.78, + 0.469 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.551, + 0.469, + 0.798, + 0.482 + ], + "angle": 0, + "content": "Fig. 8: Effect of the scaling factor \\(\\kappa\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.492, + 0.36, + 0.508 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.525, + 0.788, + 0.722 + ], + "angle": 0, + "content": "In this work, we initially illuminate the main causes of training collapse under adversarial data augmentation: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To address these issues, we propose SCAT, a simple yet effective model-agnostic framework that leverages stabilized adversarial training to bootstrap the generalization capability of self-supervised MDE models in unseen scenarios. Extensive experiments on a variety of scenarios from five benchmarks validate the merits of our adversarial data augmentation, which endows the model with universal generalization capability and better training efficiency. In addition, empirical results indicate that each component in our method and the utilization of targeted reconstruction are crucial for generalization performance gain. Our exploration may inspire more researchers to dig into the great potential of utilizing adversarial training in self-supervised MDE." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.746, + 0.356, + 0.761 + ], + "angle": 0, + "content": "7 Limitation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.785, + 0.809 + ], + "angle": 0, + "content": "In the future, we would like to explore iterative adversarial data augmentation [34], which is a more promising parameter-efficient solution." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.786, + 0.84 + ], + "angle": 0, + "content": "Acknowledgement. The research was supported by the National Natural Science Foundation of China (U23B2009)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.179, + 0.787, + 0.222 + ], + "angle": 0, + "content": "1. A. Geiger, P. Lenz, and R. Urtasun, \"Are we ready for autonomous driving? the kitti vision benchmark suite,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2012, pp. 3354-3361." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.223, + 0.787, + 0.262 + ], + "angle": 0, + "content": "2. C. Sakaridis, D. Dai, and L. Van Gool, \"Semantic foggy scene understanding with synthetic data,\" International Journal of Computer Vision, vol. 126, no. 9, pp. 973-992, 2018." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.264, + 0.787, + 0.305 + ], + "angle": 0, + "content": "3. D. Eigen, C. Puhrsch, and R. Fergus, \"Depth map prediction from a single image using a multi-scale deep network,\" in Advances in Neural Information Processing System (NeurIPS), 2014." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.307, + 0.787, + 0.348 + ], + "angle": 0, + "content": "4. R. Garg, B. V. Kumar, G. Carneiro, and I. Reid, \"Unsupervised cnn for single view depth estimation: Geometry to the rescue,\" in European Conference on Computer Vision (ECCV), 2016, pp. 740-756." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.349, + 0.787, + 0.39 + ], + "angle": 0, + "content": "5. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, \"Unsupervised learning of depth and ego-motion from video,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 1851-1858." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.391, + 0.787, + 0.432 + ], + "angle": 0, + "content": "6. C. Godard, O. M. Aodha, and G. J. Brostow, \"Unsupervised monocular depth estimation with left-right consistency,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 270-279." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.434, + 0.787, + 0.474 + ], + "angle": 0, + "content": "7. C. Godard, O. M. Aodha, M. Firman, and G. J. Brostow, \"Digging into self-supervised monocular depth prediction,\" in IEEE/CVF International Conference on Computer Vision (ICCV), 2019, pp. 3828-3838." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.476, + 0.787, + 0.517 + ], + "angle": 0, + "content": "8. J. Yan, H. Zhao, P. Bu, and Y. Jin, \"Channel-wise attention-based network for self-supervised monocular depth estimation,\" in IEEE International Conference on 3D Vision (3DV), 2021, pp. 464-473." + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.518, + 0.787, + 0.559 + ], + "angle": 0, + "content": "9. X. Lyu, L. Liu, M. Wang, X. Kong, L. Liu, Y. Liu, X. Chen, and Y. Yuan, “Hr-depth: High resolution self-supervised monocular depth estimation,” in AAAI Conference on Artificial Intelligence (AAAI), 2021, pp. 2294-2301." + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.56, + 0.786, + 0.599 + ], + "angle": 0, + "content": "10. H. Zhou, D. Greenwood, and S. Taylor, \"Self-supervised monocular depth estimation with internal feature fusion,\" in *British Machine Vision Conference (BMVC)*, 2021." + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.601, + 0.786, + 0.655 + ], + "angle": 0, + "content": "11. C. Zhao, Y. Zhang, M. Poggi, F. Tosi, X. Guo, Z. Zhu, G. Huang, Y. Tang, and S. Mattoccia, \"MonoVit: Self-supervised monocular depth estimation with a vision transformer,\" in IEEE International Conference on 3D Vision (3DV), 2022." + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.657, + 0.787, + 0.699 + ], + "angle": 0, + "content": "12. S. Pillai, R. Ambru, and A. Gaidon, \"Superdepth: Self-supervised, super-resolved monocular depth estimation,\" in IEEE International Conference on Robotics and Automation (ICRA), 2019, pp. 9250-9256." + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.7, + 0.787, + 0.741 + ], + "angle": 0, + "content": "13. H. Zhao, O. Gallo, I. Frosio, and J. Kautz, \"Loss functions for image restoration with neural networks,\" IEEE Transactions on Computational Imaging (TCI), vol. 3, no. 1, pp. 47-57, 2016." + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.742, + 0.787, + 0.797 + ], + "angle": 0, + "content": "14. L. Wang, X. Sun, W. Jiang, and J. Yang, \"Drivingstereo: A large-scale dataset for stereo matching in autonomous driving scenarios,\" in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2018, pp. 5554-5561." + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.798, + 0.787, + 0.84 + ], + "angle": 0, + "content": "15. H. Caesar, V. Bankiti, A. H. Lang, S. Vora, V. E. Liong, Q. Xu, A. Krishnan, Y. Pan, G. Baldan, and O. Beijbom, \"nuscenes: A multimodal dataset for autonomous driving,\" arXiv preprint arXiv:1903.11027, 2019." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.179, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.338, + 0.127 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "16. Y. Wang, W.-L. Chao, D. Garg, B. Hariharan, M. Campbell, and K. Q. Weinberger, \"Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 8445-8453." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.203, + 0.787, + 0.243 + ], + "angle": 0, + "content": "17. X. Dong, M. A. Garratt, S. G. Anavatti, and H. A. Abbass, \"Towards real-time monocular depth estimation for robotics: A survey,\" IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 10, pp. 16940-16961, 2022." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.243, + 0.787, + 0.284 + ], + "angle": 0, + "content": "18. Z. Cheng, J. Liang, G. Tao, D. Liu, and X. Zhang, \"Adversarial training of self-supervised monocular depth estimation against physical-world attacks,\" arXiv preprint arXiv:2301.13487, 2023." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.284, + 0.787, + 0.311 + ], + "angle": 0, + "content": "19. K. Saunders, G. Vogiatzis, and L. Manso, \"Self-supervised monocular depth estimation: Let's talk about the weather,\" arXiv preprint arXiv:2307.08357, 2023." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.311, + 0.787, + 0.365 + ], + "angle": 0, + "content": "20. J. Hu, M. Ozay, Y. Zhang, and T. Okatani, \"Revisiting single image depth estimation: Toward higher resolution maps with accurate object boundaries,\" in 2019 IEEE winter conference on applications of computer vision (WACV). IEEE, 2019, pp. 1043-1051." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.365, + 0.787, + 0.406 + ], + "angle": 0, + "content": "21. F. Aleotti, F. Tosi, M. Poggi, and S. Mattoccia, \"Generative adversarial networks for unsupervised monocular depth prediction,\" in Proceedings of the European conference on computer vision (ECCV) workshops, 2018, pp. 0-0." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.406, + 0.787, + 0.446 + ], + "angle": 0, + "content": "22. Y. Luo, J. Ren, M. Lin, J. Pang, W. Sun, H. Li, and L. Lin, \"Single view stereo matching,\" in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 155-163." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.446, + 0.787, + 0.487 + ], + "angle": 0, + "content": "23. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, \"Unsupervised learning of depth and ego-motion from video,\" in Proceedings of the IEEE conference on computer vision and pattern recognition, 2017, pp. 1851-1858." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.487, + 0.787, + 0.528 + ], + "angle": 0, + "content": "24. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, \"Image quality assessment: from error visibility to structural similarity,\" IEEE transactions on image processing, vol. 13, no. 4, pp. 600-612, 2004." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.528, + 0.787, + 0.568 + ], + "angle": 0, + "content": "25. J. Bae, S. Moon, and S. Im, \"Deep digging into the generalization of self-supervised monocular depth estimation,\" in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 1, 2023, pp. 187-196." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.568, + 0.787, + 0.635 + ], + "angle": 0, + "content": "26. E. Rusak, L. Schott, R. S. Zimmermann, J. Bitterwolf, O. Bringmann, M. Bethge, and W. Brendel, \"A simple way to make neural networks robust against diverse image corruptions,\" in Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part III 16. Springer, 2020, pp. 53-69." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.635, + 0.787, + 0.677 + ], + "angle": 0, + "content": "27. L. Kong, S. Xie, H. Hu, L. X. Ng, B. Cotterreau, and W. T. Ooi, \"Robodepth: Robust out-of-distribution depth estimation under corruptions,\" Advances in Neural Information Processing Systems, vol. 36, 2024." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.677, + 0.787, + 0.731 + ], + "angle": 0, + "content": "28. L. Liu, X. Song, M. Wang, Y. Liu, and L. Zhang, \"Self-supervised monocular depth estimation for all day images using domain separation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12737-12746." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.787, + 0.785 + ], + "angle": 0, + "content": "29. A. Gurram, A. F. Tuna, F. Shen, O. Urfalioglu, and A. M. López, \"Monocular depth estimation through virtual-world supervision and real-world sfm self-supervision,\" IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 8, pp. 12738-12751, 2021." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.787, + 0.839 + ], + "angle": 0, + "content": "30. J. Wu, C. Zhang, X. Zhang, Z. Zhang, W. T. Freeman, and J. B. Tenenbaum, \"Learning shape priors for single-view 3d completion and reconstruction,\" in Proceedings of the European Conference on Computer Vision (ECCV), 2018, pp. 646-662." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.787, + 0.839 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.786, + 0.188 + ], + "angle": 0, + "content": "31. T. Yu, S. Kumar, A. Gupta, S. Levine, K. Hausman, and C. Finn, \"Gradient surgery for multi-task learning,\" Advances in Neural Information Processing Systems, vol. 33, pp. 5824-5836, 2020." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.189, + 0.787, + 0.258 + ], + "angle": 0, + "content": "32. O. Ronneberger, P. Fischer, and T. Brox, \"U-net: Convolutional networks for biomedical image segmentation,\" in Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. Springer, 2015, pp. 234-241." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.259, + 0.786, + 0.286 + ], + "angle": 0, + "content": "33. P. Liashchynskyi and P. Liashchynskyi, \"Grid search, random search, genetic algorithm: a big comparison for nas,\" arXiv preprint arXiv:1912.06059, 2019." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.287, + 0.787, + 0.342 + ], + "angle": 0, + "content": "34. S. Liu, Z. Chen, W. Li, J. Zhu, J. Wang, W. Zhang, and Z. Gan, \"Efficient universal shuffle attack for visual object tracking,\" in ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2022, pp. 2739-2743." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.343, + 0.787, + 0.383 + ], + "angle": 0, + "content": "35. Z. Huang, P. Zhou, S. Yan, and L. Lin, \"Scalelong: Towards more stable training of diffusion model via scaling network long skip connection,\" Advances in Neural Information Processing Systems, vol. 36, 2024." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.384, + 0.786, + 0.424 + ], + "angle": 0, + "content": "36. L. Rice, A. Bair, H. Zhang, and J. Z. Kolter, \"Robustness between the worst and average case,\" Advances in Neural Information Processing Systems, vol. 34, pp. 27840-27851, 2021." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.425, + 0.786, + 0.466 + ], + "angle": 0, + "content": "37. Y. Wang, Y. Ba, H. C. Zhang, H. Zhang, A. Kadambi, S. Soatto, A. Wong, and C.-J. Hsieh, “Evaluating worst case adversarial weather perturbations robustness,” in NeurIPS ML Safety Workshop, 2022." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.467, + 0.786, + 0.508 + ], + "angle": 0, + "content": "38. C. Godard, O. Mac Aodha, M. Firman, and G. J. Brostow, \"Digging into self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF international conference on computer vision, 2019, pp. 3828-3838." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.509, + 0.787, + 0.55 + ], + "angle": 0, + "content": "39. M. Poggi, F. Tosi, and S. Mattoccia, \"Learning monocular depth estimation with unsupervised trinocular assumptions,\" in 2018 International conference on 3d vision (3DV). IEEE, 2018, pp. 324-333." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.55, + 0.786, + 0.605 + ], + "angle": 0, + "content": "40. M. Ramamonjisoa, Y. Du, and V. Lepetit, \"Predicting sharp and accurate occlusion boundaries in monocular depth estimation using displacement fields,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14648-14657." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.606, + 0.787, + 0.647 + ], + "angle": 0, + "content": "41. A. Wong and S. Soatto, \"Bilateral cyclic constraint and adaptive regularization for unsupervised monocular depth prediction,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 5644-5653." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.647, + 0.786, + 0.688 + ], + "angle": 0, + "content": "42. S. Zhang, J. Zhang, and D. Tao, \"Towards scale-aware, robust, and generalizable unsupervised monocular depth estimation by integrating imu motion dynamics,\" in European Conference on Computer Vision. Springer, 2022, pp. 143-160." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.787, + 0.729 + ], + "angle": 0, + "content": "43. W. Han, J. Yin, X. Jin, X. Dai, and J. Shen, \"Brnet: Exploring comprehensive features for monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 586-602." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.786, + 0.771 + ], + "angle": 0, + "content": "44. Z. Zhou and Q. Dong, \"Self-distilled feature aggregation for self-supervised monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 709-726." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.772, + 0.787, + 0.812 + ], + "angle": 0, + "content": "45. D. Garg, Y. Wang, B. Hariharan, M. Campbell, K. Q. Weinberger, and W.-L. Chao, \"Wasserstein distances for stereo disparity estimation,\" Advances in Neural Information Processing Systems, vol. 33, pp. 22 517-22 529, 2020." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.787, + 0.84 + ], + "angle": 0, + "content": "46. X. Chen, R. Zhang, J. Jiang, Y. Wang, G. Li, and T. H. Li, \"Self-supervised monocular depth estimation: Solving the edge-fattening problem,\" in Proceedings" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.338, + 0.127 + ], + "angle": 0, + "content": "Yao et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.251, + 0.147, + 0.786, + 0.175 + ], + "angle": 0, + "content": "of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2023, pp. 5776-5786." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.177, + 0.787, + 0.218 + ], + "angle": 0, + "content": "47. J. Ma, X. Lei, N. Liu, X. Zhao, and S. Pu, \"Towards comprehensive representation enhancement in semantics-guided self-supervised monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 304-321." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.219, + 0.787, + 0.261 + ], + "angle": 0, + "content": "48. S. Zhu, G. Brazil, and X. Liu, \"The edge of depth: Explicit constraints between segmentation and depth,\" in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2020, pp. 13116-13125." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.262, + 0.787, + 0.317 + ], + "angle": 0, + "content": "49. P.-Y. Chen, A. H. Liu, Y.-C. Liu, and Y.-C. F. Wang, \"Towards scene understanding: Unsupervised monocular depth estimation with semantic-aware representation,\" in Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition, 2019, pp. 2624-2632." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.787, + 0.373 + ], + "angle": 0, + "content": "50. H. Jung, E. Park, and S. Yoo, \"Fine-grained semantics-aware representation enhancement for self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12642-12652." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.374, + 0.787, + 0.416 + ], + "angle": 0, + "content": "51. R. Peng, R. Wang, Y. Lai, L. Tang, and Y. Cai, \"Excavating the potential capacity of self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 15560-15569." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.417, + 0.787, + 0.472 + ], + "angle": 0, + "content": "52. K. Wang, Z. Zhang, Z. Yan, X. Li, B. Xu, J. Li, and J. Yang, \"Regularizing nighttime weirdness: Efficient self-supervised monocular depth estimation in the dark,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 16055-16064." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.473, + 0.787, + 0.515 + ], + "angle": 0, + "content": "53. M. Vankadari, S. Golodetz, S. Garg, S. Shin, A. Markham, and N. Trigoni, \"When the sun goes down: Repairing photometric losses for all-day depth estimation,\" in Conference on Robot Learning. PMLR, 2023, pp. 1992-2003." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.516, + 0.787, + 0.57 + ], + "angle": 0, + "content": "54. J. Spencer, R. Bowden, and S. Hadfield, \"Defeat-net: General monocular depth via simultaneous unsupervised representation learning,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14402-14413." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.571, + 0.787, + 0.627 + ], + "angle": 0, + "content": "55. A. Atapour-Abarghouei and T. P. Breckon, \"Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer,\" in Proceedings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 2800-2810." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.628, + 0.787, + 0.67 + ], + "angle": 0, + "content": "56. C. Zhao, Y. Tang, and Q. Sun, \"Unsupervised monocular depth estimation in highly complex environments,\" IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 6, no. 5, pp. 1237-1246, 2022." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.671, + 0.787, + 0.711 + ], + "angle": 0, + "content": "57. N. Carlini and D. Wagner, \"Towards evaluating the robustness of neural networks,\" in 2017 IEEE symposium on security and privacy (sp). IEEE, 2017, pp. 39-57." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.712, + 0.787, + 0.755 + ], + "angle": 0, + "content": "58. H. Zhang and J. Wang, \"Towards adversarially robust object detection,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2019, pp. 421-430." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.756, + 0.787, + 0.798 + ], + "angle": 0, + "content": "59. X. Chen, C. Xie, M. Tan, L. Zhang, C.-J. Hsieh, and B. Gong, \"Robust and accurate object detection via adversarial learning,\" in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2021, pp. 16622-16631." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "60. X. Xu, H. Zhao, and J. Jia, \"Dynamic divide-and-conquer adversarial training for robust semantic segmentation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 7486-7495." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.688, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "SCAT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.147, + 0.788, + 0.188 + ], + "angle": 0, + "content": "61. W.-C. Hung, Y.-H. Tsai, Y.-T. Liou, Y.-Y. Lin, and M.-H. Yang, “Adversarial learning for semi-supervised semantic segmentation,” arXiv preprint arXiv:1802.07934, 2018." + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.189, + 0.788, + 0.231 + ], + "angle": 0, + "content": "62. Y. Carmon, A. Raghunathan, L. Schmidt, J. C. Duchi, and P. S. Liang, \"Unlabeled data improves adversarial robustness,\" Advances in neural information processing systems, vol. 32, 2019." + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.231, + 0.788, + 0.272 + ], + "angle": 0, + "content": "63. J.-B. Alayrac, J. Uesato, P.-S. Huang, A. Fawzi, R. Stanforth, and P. Kohli, \"Are labels required for improving adversarial robustness?\" Advances in Neural Information Processing Systems, vol. 32, 2019." + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.273, + 0.788, + 0.313 + ], + "angle": 0, + "content": "64. C.-H. Ho and N. Nvasconcelos, \"Contrastive learning with adversarial examples,\" Advances in Neural Information Processing Systems, vol. 33, pp. 17081-17093, 2020." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.314, + 0.788, + 0.355 + ], + "angle": 0, + "content": "65. M. Kim, J. Tack, and S. J. Hwang, \"Adversarial self-supervised contrastive learning,\" Advances in Neural Information Processing Systems, vol. 33, pp. 2983-2994, 2020." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.356, + 0.788, + 0.424 + ], + "angle": 0, + "content": "66. S. Liu, Z. Chen, Y. Liu, Y. Wang, D. Yang, Z. Zhao, Z. Zhou, X. Yi, W. Li, W. Zhang et al., \"Improving generalization in visual reinforcement learning via conflict-aware gradient agreement augmentation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023, pp. 23436-23446." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.425, + 0.788, + 0.508 + ], + "angle": 0, + "content": "67. L. Kong, Y. Niu, S. Xie, H. Hu, L. X. Ng, B. R. Cottereau, D. Zhao, L. Zhang, H. Wang, W. T. Ooi, R. Zhu, Z. Song, L. Liu, T. Zhang, J. Yu, M. Jing, P. Li, X. Qi, C. Jin, Y. Chen, J. Hou, J. Zhang, Z. Kan, Q. Ling, L. Peng, M. Li, D. Xu, C. Yang, Y. Yao, G. Wu, J. Kuai, X. Liu, J. Jiang, J. Huang, B. Li, J. Chen, S. Zhang, S. Ao, Z. Li, R. Chen, H. Luo, F. Zhao, and J. Yu, \"The robodepth challenge: Methods and advancements towards robust depth estimation,\" 2023." + }, + { + "type": "list", + "bbox": [ + 0.223, + 0.147, + 0.788, + 0.508 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_origin.pdf b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3451247a9349ffaa08071cc3fee5d08c073fa6bc --- /dev/null +++ b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/735d10f0-6511-486f-ac2e-dcb725a3f997_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b102c7e06f5c381f26dd57bae47ade31637f98968d5aa0497173ca0466a1ec15 +size 7384784 diff --git a/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/full.md b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/full.md new file mode 100644 index 0000000000000000000000000000000000000000..96f74cde67b95e73864b9c58d6ecdef0ee4cf5be --- /dev/null +++ b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/full.md @@ -0,0 +1,357 @@ +# Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training + +Yuanqi Yao $^{1}$ , Gang Wu $^{1}$ , Kui Jiang $^{1}$ , Siao Liu $^{2}$ , Jian Kuai $^{1}$ , Xianming Liu $^{1}$ , and Junjun Jiang $^{\star 1}$ + +$^{1}$ Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China {yuanqiyao,kuaijian}@stu.hit.edu.cn {gwu,jiangkui,csxm,jiangjunjun}@hit.edu.cn $^{2}$ Academy for Engineering & Technology, Fudan University saliu20@fudan.edu.com + +Abstract. Learning a self-supervised Monocular Depth Estimation (MD) model with great generalization remains significantly challenging. Despite the success of adversarial augmentation in the supervised learning generalization, naively incorporating it into self-supervised MDE models potentially causes over-regularization, suffering from severe performance degradation. In this paper, we conduct qualitative analysis and illuminate the main causes: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), integrating adversarial data augmentation into self-supervised MDE methods to achieve a balance between stability and generalization. Specifically, we devise an effective scaling depth network that tunes the coefficients of long skip connection and effectively stabilizes the training process. Then, we propose a conflict gradient surgery strategy, which progressively integrates the adversarial gradient and optimizes the model toward a conflict-free direction. Extensive experiments on five benchmarks demonstrate that SCAT can achieve state-of-the-art performance and significantly improve the generalization capability of existing self-supervised MDE methods. + +Keywords: Domain Generalization $\cdot$ Self-Supervised Monocular Depth Estimation $\cdot$ Stabilized Adversarial Training + +# 1 Introduction + +Monocular depth estimation (MDE) plays an important role in various 3D perceptual fields such as robotic navigation [17], autonomous driving [16] and 3D reconstruction [30]. However, due to the dynamic nature of the real world, even minor perturbations in the environment can result in significant domain shifts in + +![](images/e305a494b2c1eacfea5b0a00f7092a1b4e7f34923ceeb9b8c48384f0e33c5280.jpg) +(a) + +![](images/e42463e005bff75012c9d98c7960f25b73824cf0289a5776ef2eff491a265284.jpg) +(b) +Fig. 1: Visualization of the domain generalization over various methods.(a) Comparisons with offline scenario-specific data augmentation methods.(b) Comparisons with vanilla Gaussian noise and vanilla adversarial data augmentation.(c) Comparisons of different LSCs scaling factors. The results show that our SCAT has excellent generalization performance under multiple unseen domains and retains the performance on the original training set. + +![](images/4dda3d3efaef5bbe7c9f122ccd732b50c835d762e633761f8d36d9d6d1e4f412.jpg) +(c) + +the visual observations, which makes the trained model hard to generalize into unseen scenarios and restricts its application in the physical world. + +To improve the generalization capability, several studies [19, 28, 66] utilize data augmentation methods to generate synthetic data and diversify the training environments, yielding considerable performance improvements. However, existing methods such as [19] mostly select some specific data augmentation schemes for target scenarios, yielding poor generalization performance in environments varying far from the augmented images. Compared with above mentioned offline data augmentation, adversarial data augmentation (ADA) does not make any target distribution assumption and synchronously optimizes the augmenter during the training phase, providing a promising pre-processing solution. Unfortunately, there is a dilemma in naively incorporating ADA into self-supervised MDE. Although adversarial data augmentation can effectively improve generalization capability in multiple supervised visual tasks [19], self-supervised MDE algorithms are quite sensitive to such excessive perturbation, resulting in significant performance degradation and training collapse. Therefore, it is necessary to rethink why self-supervised MDE cannot benefit from ADA as much as supervised learning. + +In this work, we first conduct extensive quantitative analysis to investigate the causes of performance degradation when applying adversarial data augmentation to common self-supervised MDE models. There are two primary factors for this phenomenon: (i) inherent sensitivity of long skip connections (LSC) in UNet-alike depth estimation networks; (ii) dual optimization conflict caused by over-regularization. Specifically, as a core component in the MDE, LSC is widely adopted in the UNet-alike Depth Networks to combine multi-scale features and preserve low-level detail, yielding better prediction performance. However, the presence of these shortcut connections amplifies adversarial gradients, when coupled with pixel-level adversarial data augmentation, leading to severe training instability and collapse. Moreover, compared to offline data augmentation, ad + +versarial augmentation data commonly act as the worst-case training examples [36,37] and often provides over-regularization for the model training, which results in optimization gradients that oppose those of the original data, leading to severe gradient conflicts and a subsequent decline in convergence performance. + +To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), tailored for self-supervised monocular depth estimation. SCAT is designed to enhance both generalization capability and stability. In particular, we develop an innovative scaling depth network that adjusts the coefficients of long skip connections within UNet architecture, thereby ensuring a more stable training regime through a theoretically supported. Furthermore, we advance a Conflict Gradient Surgery method, progressively blending the adversarial gradient to guide the model optimization along a direction devoid of conflicts. It is worth noting that one of the merits of our method SCAT is model-agnostic, and the stabilized adversarial training can be applied to diverse SOTA methods, yielding consistent generalization enhancement. To validate the effectiveness of SCAT, we conduct extensive experiments on both KITTI and KITTI-C datasets, demonstrating its cross-domain generalization capability on Foggy CityScapes, DrivingStereo and NuScenes datasets. In summary, our contributions are summarized as follows: + +- We point out the inherent sensitivity of UNet-based depth networks and the dual optimization conflict caused by over-regularization, providing a theoretical analysis of the self-supervised MDE model's instability. +- We propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which efficiently incorporates adversarial augmentation into self-supervised MDE, and significantly improves the model generalization capabilities across multiple unseen domains. +- We developed Conflict Gradient Surgery (CGS) to address the dual optimization conflicts induced by adversarial over-regularization, achieving a balance between model stability and generalization. + +# 2 Related Works + +# 2.1 Self-Supervised Monocular Depth Estimation + +Self-supervised monocular depth estimation (MDE) has made remarkable progress in recent years, enabling depth learning from unlabeled data. The seminal work by Zhou et al. [23] laid the foundation by jointly optimizing depth and pose networks using an image reconstruction loss. Since then, two main approaches have emerged: stereo training and monocular training. Stereo training methods utilize synchronized stereo image pairs to predict disparity maps, with notable contributions including photometric consistency loss [4], left-right consistency [6], and continuous disparity prediction [45]. Monocular training, on the other hand, relies on the consistency between synthesized and actual scene views, with SfM-Learner [23] pioneering the joint training of a DepthNet and a PoseNet using a photometric loss. Researchers have also explored complementary techniques + +to further boost performance, such as occlusion modeling [38-41], scale ambiguity [42] advanced network architectures [12, 43, 44], semantic information integration [46-50], and object size cues [48, 51]. The proposed use of orthogonal planes for improved depth representation in driving scenarios contributes to the ongoing advancements in this field. + +# 2.2 Domain Generalization in Monocular Depth Estimation + +A line of studies investigated how to utilize data augmentation or synthetic data generation to improve the domain generalization capability of MDE [19, 28, 29, 52-56]. ADDS-DepthNet [28] generates night image pairs from day images using GANs, training the network to be effective in both day and night domains. It uses day depth estimates as pseudo-supervision for night scenes, which limits the night depth estimation to the accuracy of the day estimates. Additionally, ADDS-DepthNet focuses on reconstructing GAN-generated night images, which generates reconstruction targets with high variance, resulting detrimental to the self-supervised MDE algorithm. ITDFA [56] employs a fixed depth decoder and adapts the encoders for each domain to enforce feature consistency across domains, which is limited to the performance. Robust-Depth [19] put forward an offline data augmentation method. By exploiting the correspondence between unaugmented and augmented data they introduce a pseudo-supervised loss for both depth and pose estimation. However, previous approaches limited the ability to handle environments with pre-defined variations and require substantial architectural modifications to obtain realistic depth estimates, leading to severe domain bias when applied to real-world scenes [19, 28]. + +# 2.3 Adversarial Training + +Adversarial training has emerged as a popular technique to improve the generalization capability of deep neural networks. This approach involves incorporating both benign and adversarial examples during the training process, enabling models to learn more robust features [57]. Researchers have successfully applied adversarial training to various computer vision tasks, such as image classification [26, 57], object detection [58, 59], and segmentation [60, 61]. However, generating adversarial examples typically requires ground truth labels, which limits the applicability of adversarial training to supervised learning settings. To address this limitation, semi-supervised adversarial learning methods [62, 63] have been proposed, which leverage a small portion of labeled data to enhance robustness. Additionally, contrastive learning [64, 65] has been combined with adversarial examples to improve self-supervised learning and model robustness. In the context of MDE, adversarial training remains largely unexplored, particularly in self-supervised MDE which absent the ground truth depth information. + +# 3 Preliminaries + +# 3.1 Problem Formulation + +Following [5, 7], we regard the self-supervised depth estimation as an image reconstruction task, where the objective is to reconstruct the target current frame image $I_{t}$ from consecutive frames $I_{t}^{\prime} \in \{I_{t - 1}, I_{t + 1}\}$ . Specifically, we construct a dual-branch framework, involving a DepthNet and a PoseNet. The former is used for estimating depth map $D_{t}$ while the latter is introduced to predict the relative poses $T_{t' \to t}$ through the inverse warping as below, the predicted depth map $D_{t}$ in conjunction with the relative poses $T_{t' \to t}$ can synthesize the target image $I_{t' \to t}$ , depicted as: + +$$ +I _ {t ^ {\prime} \rightarrow t} = I _ {t ^ {\prime}} \left\langle \operatorname {p r o j} \left(D _ {t}, T _ {t \rightarrow t ^ {\prime}}, K\right)\right\rangle , \tag {1} +$$ + +where $proj(\cdot)$ generates the resulting 2D coordinates of the projected depths $Dt$ in $It'$ and $\langle \rangle$ refers to the sampling operator. We minimize the photometric reprojection error $\mathcal{L}_p$ to supervise the DepthNet, + +$$ +\mathcal {L} _ {p} = \sum_ {t ^ {\prime}} p e \left(I _ {t}, I _ {t ^ {\prime} \rightarrow t}\right), \tag {2} +$$ + +where $pe$ is the photometric reconstruction error. As suggestion in [6, 13], we adopt the weighted combination of $L_{1}$ loss and SSIM [24] to formulate the photometric error function $pe$ , denoted as: + +$$ +p e (I _ {a}, I _ {b}) = \frac {\alpha}{2} (1 - \operatorname {S S I M} (I _ {a}, I _ {b})) + (1 - \alpha) | | I _ {a} - I _ {b} | | _ {1}. \tag {3} +$$ + +# 3.2 Analysis on Unstable Self-Supervised MDE + +In this section, we aim to investigate the primary causes why naively applying adversarial data augmentation in self-supervised MDE leads to instability. + +Pitfall1: Sensitive UNet-alike Depth Network. In previous self-supervised MDE methods [7-9], UNet [32] is the most popular depth network backbone, since its long skip connects (LSCs) to connect distant network blocks can fuse multi-granularity semantic information and spatial information: + +$$ +\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \circ [ a _ {i + 1} \circ x + f _ {i + 1} (a _ {i + 1} \circ x) ], \tag {4} +$$ + +where $x \in R^{m}$ denotes the input, $a_{i}$ and $b_{i}(i \geq 1)$ are the trainable parameter of the $i$ -th block. For the vector operation $\circ$ , it can be designed to implement different networks. Assume an extra noise $\epsilon_{\delta} \sim N(0, \sigma_{\delta}^2 I)$ is injected into $I_{t}$ which yields a new input $\tilde{I}_{t}'$ , self-supervised MDE with data augmentations aims to reprojection $I_{t' \to t}$ from the noisy input $\tilde{I}_{t'}$ . Accordingly, if the variance $\sigma_{\delta}^2$ of extra noise is large, it can hinder re-projecting the desired target image $I_{t' \to t}$ . In adversarial training, the variance of this extra noise varies along training iterations, further exacerbating the instability of self-supervised MDE training. + +Recent work [35] also reveals a similar phenomenon, which demonstrates that the UNet-based segmentation architecture is sensitive to perturbed noise, suffering from catastrophic training collapse. It is noteworthy that, although our theoretical analysis is focused on UNet-based depth estimation architectures, the LSC component is extensively employed across various mainstream architectures [11], thereby lending a degree of extensibility to our empirical results. + +Pitfall2: Dual Optimization Conflict by Over-Regularization. Compared to the offline data augmentation in Robust-Depth [19], Adversarial Data Augmentation (ADA) makes no assumptions about the target distribution and synchronously optimizes augmenters during the training phase, offering a promising pre-processing solution. Unfortunately, naively incorporating ADA into self-supervised Monocular Depth Estimation (MDE) presents a dilemma. While adversarial data augmentation can effectively enhance generalization in various supervised visual tasks, a dual optimization conflict arises due to the opposing gradient optimization directions between the adversarial-perturbed data and the original data. Similar to [31], we also define $\phi_{ij}$ as the angle between origin data $g_i$ and adversarial-perturbed data gradient $g_j$ , the gradients as conflicting when $\cos \phi_{ij} < 0$ . Therefore, for self-supervised MDE, over-regularization leads to ADA dominating the gradient updates, resulting in significant performance degradation and training collapse. We refer to this issue as a dual optimization conflict caused by over-regularization. + +# 4 Method + +# 4.1 Architectural Overview + +In this section, we propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which is compatible with any self-supervised MDE method. An overview of the SCAT architecture is provided in Fig. 2. To circumvent erroneous bootstrapping from adversarial augmented data, augmentation was applied to improve generalization by reconstructing the unaugmented $I_{t}$ , rather than the augmented image $\tilde{I}_{t}$ . + +$$ +\tilde {I} _ {t ^ {\prime}} = I _ {t ^ {\prime}} + \delta \tag {5} +$$ + +$$ +\tilde {I} _ {t ^ {\prime} \rightarrow t} = I _ {t ^ {\prime}} \left\langle \operatorname {p r o j} \left(\tilde {D} _ {t}, \tilde {T} _ {t \rightarrow t ^ {\prime}}, K\right)\right\rangle , \tag {6} +$$ + +$$ +\mathcal {L} _ {p} = \sum_ {t ^ {\prime}} p e \left(I _ {t}, I _ {t ^ {\prime} \rightarrow t}\right) + p e \left(I _ {t}, \tilde {I} _ {t ^ {\prime} \rightarrow t}\right). \tag {7} +$$ + +If $\delta$ is learned (i.e. SCAT is implemented with an adversarial generator $\delta = g_{\phi}(z)$ , to introduce adversarial training into self-supervised MDE, we calculate the reprojection loss for the current frame image reconstructed from the perturbed images and use it as the self-supervised constraint loss $\mathcal{L}_{AD}$ : + +$$ +\mathcal {L} _ {A D} = \sum_ {t ^ {\prime}} p e \left(I _ {t}, \tilde {I} _ {t ^ {\prime} \rightarrow t}\right). \tag {8} +$$ + +![](images/56def8c71425cdb824d196156fc7bf72c3e3e97dcd82899a9a96c55e56aa835d.jpg) +Fig. 2: Overview of our SCAT architecture. Our method introduces an adversarial noise generator, which is optimized through $\mathcal{L}_{AD}$ and acts as an adversarial constraint, while $\mathcal{L}_p$ imposes self-supervised constraints to optimize self-supervised MDE model. CGS incrementally applies adversarial augmenters from multiple iterations, enabling a balanced achievement in model generalization and stability. Meanwhile, we utilize a scaling depth network(SDN) to stabilize the training process. + +Our goal is to find a noise distribution $p_{\phi}(\delta)$ , $\delta \in R^{N}$ and $\| \delta \| _2 = \epsilon$ , such that noise samples added to input clean image $I_{t}$ maximally confuse the depth network. More concisely, we optimize the following equation, depicted as + +$$ +\min _ {\theta} \max _ {\phi} \mathbb {E} _ {\tilde {I} _ {t ^ {\prime}}, I _ {t}} \mathbb {E} _ {\delta \sim p _ {\phi} (\delta)} \left[ \mathcal {L} \left(f _ {\theta} \left(\tilde {I} _ {t ^ {\prime}}\right), I _ {t}\right) \right]. \tag {9} +$$ + +Specifically, $\max_{\phi}$ represents the adversarial noise generator's attempt to maximize the $\mathcal{L}_{AD}$ , thereby generating adversarial samples that maximally perturb the depth network. Conversely, $\min_{\theta}$ denotes the depth network's effort to minimize the $\mathcal{L}_p$ on these adversarial samples, aiming to achieve robustness in depth estimation across various adversarial inputs. Through training iterations provided in Algorithm 1 in our SCAT framework, self-supervised MDE models becomes proficient at accurately inferring various perturbed images. + +However, as the variance of this extra adversarial noise varies along training, the standard UNet-based depth network is too sensitive to these perturbations. Hence, we propose a Scaling Depth Network (SDN), which appropriately scales the coefficients $\kappa_{i}$ to lower reconstruction error. In addition, conflict arises by opposing gradient optimization directions between the adversarial-perturbed data and original data, further exacerbating the training instability. To ensure the model has enough representational power while preventing unstable parameter updates, we propose Conflict Gradient Surgery (CGS) to refine the adversarial training gradient update process, which we introduce in the following section. + +# 4.2 Scaling Depth Network + +To alleviate the impact of extra noise, we devise scaling depth network (SDN) to scale the coefficients $\kappa_{i}$ of LSCs: + +$$ +\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \circ \left[ k _ {i + 1} \cdot a _ {i + 1} \circ x + f _ {i + 1} \left(a _ {i + 1} \circ x\right) \right], \tag {10} +$$ + +where $\kappa_{i} > 0$ , $(i \geq 1)$ are the scaling coefficients and are set to 1 in standard UNet-based depth network. For scaling depth network in Eq.10, assume $M_0 = \max \{||b_i \circ a_i||_2, 1 \leq i \leq N\}$ and $f_N$ is $L_0$ -Lipschitz continuous, $c_0$ is a constant related to $M_0$ and $L_0$ . Suppose $I_t^{\epsilon_\delta}$ is an perturbed input of the vanilla input $I_t$ with a small perturbation $\epsilon_\delta = ||I_t^{\epsilon_\delta} - I_t||_2$ . Then we have + +$$ +\left| \left| f _ {\theta} \left(\mathbf {I} _ {t} ^ {\epsilon_ {\delta}}\right) - f _ {\theta} \left(\mathbf {I} _ {t}\right) \right| \right| _ {2} \leq \epsilon_ {\delta} \left[ \sum_ {i = 1} ^ {N} \kappa_ {i} M _ {0} ^ {i} + c _ {0} \right], \tag {11} +$$ + +where $N$ is the number of the long skip connections. See the proof in Appendix. + +Eq.11 shows that for a perturbation magnitude $\epsilon_{\delta}$ , the reconstruction error bound of depth network is $\mathcal{O}(\epsilon_{\delta}\left(\sum_{k = 1}K_{i}M_{0}^{i}\right)$ . For standard UNet-based depth network ( $\kappa_{i} = 1\forall i$ ), this bound becomes a very large bound $\mathcal{O}(NM_0^N)$ . This implies that a standard UNet-based depth network is sensitive to extra noise in the input, especially when LSC number $N$ is large. Intuitively, setting appropriate scaling coefficients $\kappa_{i}$ in our scaling depth network can enhance the robustness of the model to input perturbations, thereby improving better stability for self-supervised MDE. To derive the scaling coefficient $\kappa$ , we adopt a heuristic algorithm to assign a uniform constant value of $\kappa_{*}$ across all LSCs, with the default set to 0.7. In terms of implementation, a line of parameter optimization techniques [33,35] can be applied, e.g. incorporating an adaptive projection layer [35] for each LSC component. The empirical discussions in the Appendix demonstrate that a singular scaling parameter $\kappa$ is sufficient to strike to balance performance and efficiency for the self-supervised MDE task. + +# 4.3 Conflict Gradient Surgery + +Here, we propose to modify the standard adversarial data augmentation (ADA) by incorporating conflict gradient surgery named CGS, aiming to change the distribution of $\cos(\theta)$ tends towards positive values, where $\theta$ is the angle between the gradient of the original data and the gradient of the CGS adversarial data, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, and finally improves the robustness of the model to perturbations: + +$$ +\mathbb {E} \left[ \cos (\theta) \right] > 0, \quad \text {w h e r e} \cos (\theta_ {i}) = \frac {g _ {i} \cdot g _ {\operatorname* {m i x} _ {i}}}{| g _ {i} | | g _ {\operatorname* {m i x} _ {i}} |} +$$ + +where $g_{i}$ is the gradient of the i-th original data, $g_{mix_i}$ is the gradient of the i-th mixed adversarial data. We calculate the gradient cosine similarity between + +the gradient of the adversarial-perturbed data and the original data. We define two gradients as conflicting if their cosine similarity is negative, indicating they are diverging from one another. If the distribution of cosine similarities tends to be negative, it signifies the presence of numerous adversely oriented gradients, which can mislead the gradient optimization process. As illustrated in Fig. 3, we extracted 1000 images from the KITTI dataset and recorded the gradient cosine similarity between pairs of adversarial perturbation data and original data. Without employing conflict gradient surgery, the gradient conflict becomes a prevalent issue as the adversarial training progresses iteratively, consequently leading slower convergence and performance degradation. + +![](images/64bced7f5a3e5465cff9e17de3d1ff2bb01e725674c9e98280481a2adf224221.jpg) +Fig. 3: (a) Statistics of gradient cosine similarity. Through CGS, we have shifted the distribution of cosine similarities from being negatively skewed to positively skewed, mitigating the previously prevalent issue of adversely oriented gradients. (b) Illustration of training oscillation issue arising from Dual Optimization Conflict. + +Experimental observations provided in Fig. 3 demonstrate that our approach ensures the expectation of $\cos(\theta)$ is positive, thereby skewing the distribution of $\cos(\theta)$ tends towards positive values, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, ultimately enhancing the model's robustness against perturbations. Specifically, given a set of gradient vectors (one for each adversarial data augmentation), we construct the adversarial perturbation data while employing multiple adversarial generators from previous iterations, restraining the over-regularization caused by the conflict component through our conflict gradient surgery. The update procedure of the CGS algorithm is provided in Algorithm 1. + +# 5 Experiments + +# 5.1 Experimental Settings + +KITTI [1] KITTI dataset is collected for mobile robotics and autonomous driving, involving hours of traffic scenarios recorded with a variety of sensor modalities, including high-resolution RGB, grayscale stereo cameras, and a 3D laser scanner. Following the setting in [5], we use 39,810 images for training and 4,424 for validation. Subsequently, we rigorously evaluate the proposed method and other compared methods on the KITTI eigen test dataset [3]. + +Algorithm 1 Generic SCAT self-supervised MDE algorithm +```javascript +( $\triangleright$ vanilla self-supervised MDE, $\triangleright$ our modifications) +``` + +1: for Epoch e = 1...n do do +2: Adversarial Data Augmentation via CGS: +3: g1:j ~ Sample(B, j) ▷Randomly select generators from History Buffer. +4: δ1:j = g1:j(It) ▷Generate adversarial noise from clean images. +5: I1:j = It + δ1:j ▷Obtain adversarial images. +6: Deterministic Reprojection with SDN: +7: Dt = ScalingDepthNet(It), Pt = PoseNet(It) +8: Obtain clean depth map and camera poses. +9: Obtain adversarial depth map and camera poses. +10: I t'→t ⇔ fθ(I t'), I t'→t ⇔ fθ(I t') +11: Reconstruct adversarial and clean images with the same target. +12: B ← B ∪ ge ▷Add current Generator into History Buffer B. +13: θ ← θ - ηθ∇θLp(f, It; θ) ▷Optimize MDE fθ with LP in Eq. 7. +14: φ ← φ + ηφ∇φLAD(gφ, It; φ) ▷Optimize Generator gφ with LAD in Eq. 8. +15: end for + +Table 1: Quantitative Results for the KITTI-C Dataset. Pink cell denotes the best performance, while yellow one denotes suboptimal. + +
MethodW × HmCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]640 × 192101.0484.080.2481.7646.8520.2910.6980.8740.944
+ DA640 × 19297.7284.960.2271.7616.7350.2930.7100.8760.944
+ ADA640 × 19289.3187.310.1931.6326.4270.2780.7340.8820.945
+ SCAT (ours)640 × 19286.3290.130.1651.5736.1570.2690.7620.8930.951
CADepth [8]640 × 192108.1080.120.2711.9026.9000.3020.6740.8600.938
+ DA640 × 192107.1481.310.2611.8746.8320.2990.6910.8650.939
+ ADA640 × 19299.8183.130.2351.8666.5650.2780.7210.8710.940
+ SCAT (ours)640 × 19295.5487.930.1971.7946.2580.2640.7470.8830.948
HR-Depth [9]640 × 192103.6782.880.2551.9606.9090.3090.6700.8540.933
+ DA640 × 192101.7483.230.2431.9426.7870.2940.6850.8590.936
+ ADA640 × 19293.8485.320.2151.8316.6250.2780.6990.8610.939
+ SCAT (ours)640 × 19287.0689.470.1891.7326.2040.2580.7410.8710.945
MonoVit [11]640 × 19280.5488.980.1911.2745.9980.2450.7710.9220.964
+ DA640 × 19278.3290.470.1871.2565.8730.2280.7870.9310.965
+ ADA640 × 19272.4192.340.1661.1345.6260.2110.8190.9350.969
+ SCAT (ours)640 × 19262.7495.380.1271.0585.2740.2080.8460.9470.976
Robust-Depth* [19]640 × 19255.7296.460.1210.9545.0510.2010.8540.9520.978
+ DA640 × 19260.1296.340.1240.9635.0120.2130.8520.9510.977
+ ADA640 × 19254.2397.590.1190.9434.9850.1990.8530.9510.977
+ SCAT (ours)640 × 19253.3798.190.1170.9324.8720.1870.8610.9550.979
+ +KITTI-C [67] To evaluate the robustness and safety of our method in out-of-distribution (OoD) scenarios, we utilize KITTI-C dataset as a benchmark. The diverse corruptions enable the reliability of simulation to the potential perturbation distribution in real-world scenarios. + +DrivingStereo [14] It contains 500 images captured under different weather conditions, involving foggy, cloudy, rainy, and sunny. These images offer a realistic representation of various driving scenarios, enabling robust evaluation of depth estimation performance across diverse domains. + +Foggy CityScapes [2] Foggy CityScapes is a synthetic fog dataset that simulates real-world foggy scenarios. Each foggy sample is generated using the corresponding clear image and depth map from CityScapes dataset. + +![](images/99343199e3592b79f2309340975a5c137d386047be29bcf10cb1eaa0984febec.jpg) +$\epsilon_{m} = 20$ +Fig. 4: Example images with different $\epsilon_{m}$ of adversarial perturbation. + +![](images/79954a7612ca79864ff5cf0dc87b4a02f90c88c45f19d4269b75a2814ccae9b5.jpg) +$\epsilon_{m} = 40$ + +![](images/9d9eea900275057248df8a9b390cb913bc2f1bc302cc165470ce9cd17bf40c4a.jpg) +$\epsilon_{m} = 80$ + +![](images/89083d7fb9f2d8d1b3e529884d4c2776b9229a415b05d07c54c013320eea0276.jpg) +$\epsilon_{m} = 135$ + +NuScenes [15] The NuScenes dataset comprises approximately 15,000 images captured in real nighttime urban street settings. To validate the model generalization, NuScenes is also selected as an evaluation benchmark in our study. + +Table 2: Quantitative Results for the KITTI Eigen Test Dataset. The results indicate that SCAT largely maintains the performance of all baselines compared to vanilla ADA, ensuring the ability to infer accurate depth information on clean images. + +
MethodW × HAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
Monodepth2 [7]640 × 1920.1150.9034.8630.1930.8770.9590.981
+ ADA640 × 1920.1210.9784.9920.2210.8620.9530.978
+ SCAT (ours)640 × 1920.1160.9424.8770.1930.8770.9580.981
CADepth [8]640 × 1920.1050.7694.5350.1810.8920.9640.983
+ ADA640 × 1920.1080.8124.5850.1900.8870.9620.982
+ SCAT (ours)640 × 1920.1060.7964.5790.1830.8900.9630.983
DIFFNet [10]640 × 1920.1020.7494.4450.1790.8970.9650.983
+ ADA640 × 1920.1060.7934.5920.1840.8890.9630.982
+ SCAT (ours)640 × 1920.1030.7644.4530.1800.8970.9650.983
MonoVit [11]640 × 1920.0990.7084.3720.1750.9000.9670.984
+ ADA640 × 1920.1060.7334.5910.1840.8970.9630.982
+ SCAT (ours)640 × 1920.1000.7164.3890.1750.8990.9670.984
Robust-Depth* [19]640 × 1920.1000.7474.4550.1770.8950.9660.984
+ ADA640 × 1920.1050.7834.6980.1820.8890.9530.981
+ SCAT (ours)640 × 1920.1010.7544.4590.1770.8950.9660.984
+ +# 5.2 Effect of Perturbation Sizes + +To evaluate the effect of adversarial perturbation magnitude on model generalization, here we employ $\epsilon_{m}$ to perturbation sizes: + +$$ +\epsilon_ {m} = \min \| \delta_ {\min } \| _ {2}. \tag {12} +$$ + +We measure model generalization capability by calculating the median perturbation size $\epsilon_{m}$ and report the results in Tab. 3. To provide a better intuition for the noise level for particular $\epsilon_{m}$ , we display example images in Fig. 4. + +# 5.3 Results on KITTI-C and KITTI + +In this section, we compare the depth estimation performance of our SCAT on the KITTI-C and KITTI datasets. Quantitative results on the KITTI-C dataset are shown in Tab. 1. We conducted extensive experiments on multiple baseline models, comparing it with the generalization performance between offline data augmentation (DA) and vanilla adversarial data augmentation (ADA). As + +Table 3: Qualitative Results for different perturbation sizes. We compare the results obtained by $\epsilon_{m} = 135.0$ adversarial noise generator with its counterparts of different perturbation sizes. Note that $\epsilon_{m} = 135.0$ was used in all experiments in this paper apart from this ablation study. + +
ModelMCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]101.0484.080.2481.7646.8520.2910.6980.8740.944
+ gφεm = 2093.9686.170.1961.6196.3850.2850.7380.8830.947
+ gφεm = 4090.1586.930.1871.6136.3510.2820.7410.8850.949
+ gφεm = 8088.9587.210.1821.6026.2880.2790.7490.8900.949
+ gφεm = 13586.3290.130.1651.5736.1570.2690.7620.8930.951
+ gφεm = 18088.1786.830.1771.5946.1950.2770.7580.8910.950
+ +![](images/378c4ba91cd101cf89219ca7d227bcb3b1de8db63a940d553d856d37699f153a.jpg) +Fig. 5: Qualitative Results for KITTI-C. As the SOTA self-supervised MDE methods, MonoDepth and MonoVit excel on the KITTI dataset, but struggle to accurately infer depth information from various types of damaged images in out-of-distribution (OoD) domains. With our SCAT framework, their depth estimation performance in challenging cross-domain scenarios can be substantially improved. + +expected, our method demonstrates a significant advantage on the mean corruption error (mCE) and mean resilience rate (mRR) scores. Especially for 18 common out-of-distribution corruption types, with all baseline models, our proposed SCAT method outperforms the competitors in almost all of metrics, providing a general framework to enhance cross-domain generalization capability for existing self-supervised monocular depth estimation methods. + +# 5.4 Results on Cross-Domain Generalization + +To demonstrate the generalization capability of our SCAT over real cross-domain scenarios, like foggy and nighttime samples, we also conduct the experiments on Foggy CityScapes dataset, DrivingStereo dataset and NuScenes dataset, which are shown in Fig. 6 and Fig. 7. As expected, our SCAT generates depth estimation results with more reliable and clearer contours in all weather conditions. By contrast, vanilla MonoDepth2 and MonoVit suffer from significant performance + +![](images/a03730ef370f22dccf5165181772f98891c599019b64a422b3ca78f4f6a207d3.jpg) +Fig. 6: Qualitative Results for Foggy CityScapes. We conduct testing to assess SCAT's generalization on a synthetically generated dataset with more severe fog. + +Table 4: Quantitative Results for the Real-World NuScenes-Night Dataset. + +
DatasetMethodAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252↑δ < 1.253↑
NuScenes-Night [15]Monodepth2 [7]0.3976.20614.5690.5680.3780.6500.794
+ SCAT (ours)0.3555.11212.4360.4990.3920.6710.863
HR-Depth [9]0.4616.63315.0280.6220.3010.5710.749
+ SCAT (ours)0.4245.80213.6850.6020.3240.5840.827
CADepth [8]0.4215.94914.5090.5930.3310.6130.776
+ SCAT (ours)0.3875.52411.9620.5770.3650.6550.834
MonoVit [11]0.3134.14312.2520.4550.4850.7360.858
+ SCAT (ours)0.2844.12610.1390.4010.4970.7520.879
Robust-Depth* [19]0.2764.07510.4700.3800.6070.8190.912
+ SCAT (ours)0.2633.9739.4620.3710.6090.8190.913
+ +decline when handling real and unknown scenarios, in particular in the rainy and nighttime scenes. Notably, it can be observed that our SCAT method can effectively recover challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real-world cross-domain scenarios. Quantitative results are summarized in Tab. 4, showing that our proposed SCAT framework gains better performance on all metrics with multiple state-of-the-art methods. More results are shown in the Appendix. + +# 5.5 Ablation Study + +Effectiveness of Individual Components. To improve the stability and generalization capability of self-supervised MDE methods, SCAT presents a stabilized adversarial training framework with Conflict Gradient Surgery (CGS), progressively integrating the adversarial-perturbed data to prevent gradient conflict. In addition, we propose a scaling depth network named SDN, reducing the perturbation sensitivity of the UNet-based depth network. We perform an ablation study to investigate the effectiveness of individual components in SCAT and the results are shown in Tab. 5. Individually, each of these contributes significantly to the improvement of generalization performance across multiple datasets. + +Impact of LSCs Coefficient $\kappa$ . In our experiments, the value of the long skip connections (LSCs) coefficient $\kappa$ was set to balance the self-supervised MDE model's stability and generalization capability, which defaults to 0.7 in the paper. To assess the perturbation sensitivity of UNet-based depth networks, we + +![](images/6c36c9768b8a32089eb261a692a407294ab3c3ae4318b2f9c507a2d122de8572.jpg) +Fig. 7: Qualitative results on Driving Stereo and Nuscenes. It can be observed that our SCAT method effectively recovers challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real scenarios. + +
CGSSDNKITTIKITTI-C
Abs Relδ < 1.25Abs Relδ < 1.25
0.1210.8620.1930.734
✓0.1170.8690.1740.752
✓0.1180.8650.1790.748
✓✓0.1160.8770.1650.762
+ +Table 5: Effect of individual components. + +![](images/187a5c83bff5433065600879278b1ebd942a66ecdf478e635d2350daa4ae1e42.jpg) +compare the model performance over constant values of $\kappa \in \{0.1, 0.3, 0.7, 1.0\}$ . Fig. 1 shows that when $\kappa$ is set to 0.7, our scaling depth network has extraordinary generalization capability to unseen scenarios in the KITTI-C dataset while keeping the depth estimation performance of the KITTI dataset. +Fig. 8: Effect of the scaling factor $\kappa$ . + +# 6 Conclusion + +In this work, we initially illuminate the main causes of training collapse under adversarial data augmentation: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To address these issues, we propose SCAT, a simple yet effective model-agnostic framework that leverages stabilized adversarial training to bootstrap the generalization capability of self-supervised MDE models in unseen scenarios. Extensive experiments on a variety of scenarios from five benchmarks validate the merits of our adversarial data augmentation, which endows the model with universal generalization capability and better training efficiency. In addition, empirical results indicate that each component in our method and the utilization of targeted reconstruction are crucial for generalization performance gain. Our exploration may inspire more researchers to dig into the great potential of utilizing adversarial training in self-supervised MDE. + +# 7 Limitation + +In the future, we would like to explore iterative adversarial data augmentation [34], which is a more promising parameter-efficient solution. + +Acknowledgement. The research was supported by the National Natural Science Foundation of China (U23B2009). + +# References + +1. A. Geiger, P. Lenz, and R. Urtasun, "Are we ready for autonomous driving? the kitti vision benchmark suite," in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2012, pp. 3354-3361. +2. C. Sakaridis, D. Dai, and L. Van Gool, "Semantic foggy scene understanding with synthetic data," International Journal of Computer Vision, vol. 126, no. 9, pp. 973-992, 2018. +3. D. Eigen, C. Puhrsch, and R. Fergus, "Depth map prediction from a single image using a multi-scale deep network," in Advances in Neural Information Processing System (NeurIPS), 2014. +4. R. Garg, B. V. Kumar, G. Carneiro, and I. Reid, "Unsupervised cnn for single view depth estimation: Geometry to the rescue," in European Conference on Computer Vision (ECCV), 2016, pp. 740-756. +5. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, "Unsupervised learning of depth and ego-motion from video," in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 1851-1858. +6. C. Godard, O. M. Aodha, and G. J. Brostow, "Unsupervised monocular depth estimation with left-right consistency," in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 270-279. +7. C. Godard, O. M. Aodha, M. Firman, and G. J. Brostow, "Digging into self-supervised monocular depth prediction," in IEEE/CVF International Conference on Computer Vision (ICCV), 2019, pp. 3828-3838. +8. J. Yan, H. Zhao, P. Bu, and Y. Jin, "Channel-wise attention-based network for self-supervised monocular depth estimation," in IEEE International Conference on 3D Vision (3DV), 2021, pp. 464-473. +9. X. Lyu, L. Liu, M. Wang, X. Kong, L. Liu, Y. Liu, X. Chen, and Y. Yuan, “Hr-depth: High resolution self-supervised monocular depth estimation,” in AAAI Conference on Artificial Intelligence (AAAI), 2021, pp. 2294-2301. +10. H. Zhou, D. Greenwood, and S. Taylor, "Self-supervised monocular depth estimation with internal feature fusion," in *British Machine Vision Conference (BMVC)*, 2021. +11. C. Zhao, Y. Zhang, M. Poggi, F. Tosi, X. Guo, Z. Zhu, G. Huang, Y. Tang, and S. Mattoccia, "MonoVit: Self-supervised monocular depth estimation with a vision transformer," in IEEE International Conference on 3D Vision (3DV), 2022. +12. S. Pillai, R. Ambru, and A. Gaidon, "Superdepth: Self-supervised, super-resolved monocular depth estimation," in IEEE International Conference on Robotics and Automation (ICRA), 2019, pp. 9250-9256. +13. H. Zhao, O. Gallo, I. Frosio, and J. Kautz, "Loss functions for image restoration with neural networks," IEEE Transactions on Computational Imaging (TCI), vol. 3, no. 1, pp. 47-57, 2016. +14. L. Wang, X. Sun, W. Jiang, and J. Yang, "Drivingstereo: A large-scale dataset for stereo matching in autonomous driving scenarios," in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2018, pp. 5554-5561. +15. H. Caesar, V. Bankiti, A. H. Lang, S. Vora, V. E. Liong, Q. Xu, A. Krishnan, Y. Pan, G. Baldan, and O. Beijbom, "nuscenes: A multimodal dataset for autonomous driving," arXiv preprint arXiv:1903.11027, 2019. + +16. Y. Wang, W.-L. Chao, D. Garg, B. Hariharan, M. Campbell, and K. Q. Weinberger, "Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 8445-8453. +17. X. Dong, M. A. Garratt, S. G. Anavatti, and H. A. Abbass, "Towards real-time monocular depth estimation for robotics: A survey," IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 10, pp. 16940-16961, 2022. +18. Z. Cheng, J. Liang, G. Tao, D. Liu, and X. Zhang, "Adversarial training of self-supervised monocular depth estimation against physical-world attacks," arXiv preprint arXiv:2301.13487, 2023. +19. K. Saunders, G. Vogiatzis, and L. Manso, "Self-supervised monocular depth estimation: Let's talk about the weather," arXiv preprint arXiv:2307.08357, 2023. +20. J. Hu, M. Ozay, Y. Zhang, and T. Okatani, "Revisiting single image depth estimation: Toward higher resolution maps with accurate object boundaries," in 2019 IEEE winter conference on applications of computer vision (WACV). IEEE, 2019, pp. 1043-1051. +21. F. Aleotti, F. Tosi, M. Poggi, and S. Mattoccia, "Generative adversarial networks for unsupervised monocular depth prediction," in Proceedings of the European conference on computer vision (ECCV) workshops, 2018, pp. 0-0. +22. Y. Luo, J. Ren, M. Lin, J. Pang, W. Sun, H. Li, and L. Lin, "Single view stereo matching," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 155-163. +23. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, "Unsupervised learning of depth and ego-motion from video," in Proceedings of the IEEE conference on computer vision and pattern recognition, 2017, pp. 1851-1858. +24. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, "Image quality assessment: from error visibility to structural similarity," IEEE transactions on image processing, vol. 13, no. 4, pp. 600-612, 2004. +25. J. Bae, S. Moon, and S. Im, "Deep digging into the generalization of self-supervised monocular depth estimation," in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 1, 2023, pp. 187-196. +26. E. Rusak, L. Schott, R. S. Zimmermann, J. Bitterwolf, O. Bringmann, M. Bethge, and W. Brendel, "A simple way to make neural networks robust against diverse image corruptions," in Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part III 16. Springer, 2020, pp. 53-69. +27. L. Kong, S. Xie, H. Hu, L. X. Ng, B. Cotterreau, and W. T. Ooi, "Robodepth: Robust out-of-distribution depth estimation under corruptions," Advances in Neural Information Processing Systems, vol. 36, 2024. +28. L. Liu, X. Song, M. Wang, Y. Liu, and L. Zhang, "Self-supervised monocular depth estimation for all day images using domain separation," in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12737-12746. +29. A. Gurram, A. F. Tuna, F. Shen, O. Urfalioglu, and A. M. López, "Monocular depth estimation through virtual-world supervision and real-world sfm self-supervision," IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 8, pp. 12738-12751, 2021. +30. J. Wu, C. Zhang, X. Zhang, Z. Zhang, W. T. Freeman, and J. B. Tenenbaum, "Learning shape priors for single-view 3d completion and reconstruction," in Proceedings of the European Conference on Computer Vision (ECCV), 2018, pp. 646-662. + +31. T. Yu, S. Kumar, A. Gupta, S. Levine, K. Hausman, and C. Finn, "Gradient surgery for multi-task learning," Advances in Neural Information Processing Systems, vol. 33, pp. 5824-5836, 2020. +32. O. Ronneberger, P. Fischer, and T. Brox, "U-net: Convolutional networks for biomedical image segmentation," in Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. Springer, 2015, pp. 234-241. +33. P. Liashchynskyi and P. Liashchynskyi, "Grid search, random search, genetic algorithm: a big comparison for nas," arXiv preprint arXiv:1912.06059, 2019. +34. S. Liu, Z. Chen, W. Li, J. Zhu, J. Wang, W. Zhang, and Z. Gan, "Efficient universal shuffle attack for visual object tracking," in ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2022, pp. 2739-2743. +35. Z. Huang, P. Zhou, S. Yan, and L. Lin, "Scalelong: Towards more stable training of diffusion model via scaling network long skip connection," Advances in Neural Information Processing Systems, vol. 36, 2024. +36. L. Rice, A. Bair, H. Zhang, and J. Z. Kolter, "Robustness between the worst and average case," Advances in Neural Information Processing Systems, vol. 34, pp. 27840-27851, 2021. +37. Y. Wang, Y. Ba, H. C. Zhang, H. Zhang, A. Kadambi, S. Soatto, A. Wong, and C.-J. Hsieh, “Evaluating worst case adversarial weather perturbations robustness,” in NeurIPS ML Safety Workshop, 2022. +38. C. Godard, O. Mac Aodha, M. Firman, and G. J. Brostow, "Digging into self-supervised monocular depth estimation," in Proceedings of the IEEE/CVF international conference on computer vision, 2019, pp. 3828-3838. +39. M. Poggi, F. Tosi, and S. Mattoccia, "Learning monocular depth estimation with unsupervised trinocular assumptions," in 2018 International conference on 3d vision (3DV). IEEE, 2018, pp. 324-333. +40. M. Ramamonjisoa, Y. Du, and V. Lepetit, "Predicting sharp and accurate occlusion boundaries in monocular depth estimation using displacement fields," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14648-14657. +41. A. Wong and S. Soatto, "Bilateral cyclic constraint and adaptive regularization for unsupervised monocular depth prediction," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 5644-5653. +42. S. Zhang, J. Zhang, and D. Tao, "Towards scale-aware, robust, and generalizable unsupervised monocular depth estimation by integrating imu motion dynamics," in European Conference on Computer Vision. Springer, 2022, pp. 143-160. +43. W. Han, J. Yin, X. Jin, X. Dai, and J. Shen, "Brnet: Exploring comprehensive features for monocular depth estimation," in European Conference on Computer Vision. Springer, 2022, pp. 586-602. +44. Z. Zhou and Q. Dong, "Self-distilled feature aggregation for self-supervised monocular depth estimation," in European Conference on Computer Vision. Springer, 2022, pp. 709-726. +45. D. Garg, Y. Wang, B. Hariharan, M. Campbell, K. Q. Weinberger, and W.-L. Chao, "Wasserstein distances for stereo disparity estimation," Advances in Neural Information Processing Systems, vol. 33, pp. 22 517-22 529, 2020. +46. X. Chen, R. Zhang, J. Jiang, Y. Wang, G. Li, and T. H. Li, "Self-supervised monocular depth estimation: Solving the edge-fattening problem," in Proceedings + +of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2023, pp. 5776-5786. +47. J. Ma, X. Lei, N. Liu, X. Zhao, and S. Pu, "Towards comprehensive representation enhancement in semantics-guided self-supervised monocular depth estimation," in European Conference on Computer Vision. Springer, 2022, pp. 304-321. +48. S. Zhu, G. Brazil, and X. Liu, "The edge of depth: Explicit constraints between segmentation and depth," in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2020, pp. 13116-13125. +49. P.-Y. Chen, A. H. Liu, Y.-C. Liu, and Y.-C. F. Wang, "Towards scene understanding: Unsupervised monocular depth estimation with semantic-aware representation," in Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition, 2019, pp. 2624-2632. +50. H. Jung, E. Park, and S. Yoo, "Fine-grained semantics-aware representation enhancement for self-supervised monocular depth estimation," in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12642-12652. +51. R. Peng, R. Wang, Y. Lai, L. Tang, and Y. Cai, "Excavating the potential capacity of self-supervised monocular depth estimation," in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 15560-15569. +52. K. Wang, Z. Zhang, Z. Yan, X. Li, B. Xu, J. Li, and J. Yang, "Regularizing nighttime weirdness: Efficient self-supervised monocular depth estimation in the dark," in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 16055-16064. +53. M. Vankadari, S. Golodetz, S. Garg, S. Shin, A. Markham, and N. Trigoni, "When the sun goes down: Repairing photometric losses for all-day depth estimation," in Conference on Robot Learning. PMLR, 2023, pp. 1992-2003. +54. J. Spencer, R. Bowden, and S. Hadfield, "Defeat-net: General monocular depth via simultaneous unsupervised representation learning," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14402-14413. +55. A. Atapour-Abarghouei and T. P. Breckon, "Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer," in Proceedings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 2800-2810. +56. C. Zhao, Y. Tang, and Q. Sun, "Unsupervised monocular depth estimation in highly complex environments," IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 6, no. 5, pp. 1237-1246, 2022. +57. N. Carlini and D. Wagner, "Towards evaluating the robustness of neural networks," in 2017 IEEE symposium on security and privacy (sp). IEEE, 2017, pp. 39-57. +58. H. Zhang and J. Wang, "Towards adversarially robust object detection," in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2019, pp. 421-430. +59. X. Chen, C. Xie, M. Tan, L. Zhang, C.-J. Hsieh, and B. Gong, "Robust and accurate object detection via adversarial learning," in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2021, pp. 16622-16631. +60. X. Xu, H. Zhao, and J. Jia, "Dynamic divide-and-conquer adversarial training for robust semantic segmentation," in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 7486-7495. + +61. W.-C. Hung, Y.-H. Tsai, Y.-T. Liou, Y.-Y. Lin, and M.-H. Yang, “Adversarial learning for semi-supervised semantic segmentation,” arXiv preprint arXiv:1802.07934, 2018. +62. Y. Carmon, A. Raghunathan, L. Schmidt, J. C. Duchi, and P. S. Liang, "Unlabeled data improves adversarial robustness," Advances in neural information processing systems, vol. 32, 2019. +63. J.-B. Alayrac, J. Uesato, P.-S. Huang, A. Fawzi, R. Stanforth, and P. Kohli, "Are labels required for improving adversarial robustness?" Advances in Neural Information Processing Systems, vol. 32, 2019. +64. C.-H. Ho and N. Nvasconcelos, "Contrastive learning with adversarial examples," Advances in Neural Information Processing Systems, vol. 33, pp. 17081-17093, 2020. +65. M. Kim, J. Tack, and S. J. Hwang, "Adversarial self-supervised contrastive learning," Advances in Neural Information Processing Systems, vol. 33, pp. 2983-2994, 2020. +66. S. Liu, Z. Chen, Y. Liu, Y. Wang, D. Yang, Z. Zhao, Z. Zhou, X. Yi, W. Li, W. Zhang et al., "Improving generalization in visual reinforcement learning via conflict-aware gradient agreement augmentation," in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023, pp. 23436-23446. +67. L. Kong, Y. Niu, S. Xie, H. Hu, L. X. Ng, B. R. Cottereau, D. Zhao, L. Zhang, H. Wang, W. T. Ooi, R. Zhu, Z. Song, L. Liu, T. Zhang, J. Yu, M. Jing, P. Li, X. Qi, C. Jin, Y. Chen, J. Hou, J. Zhang, Z. Kan, Q. Ling, L. Peng, M. Li, D. Xu, C. Yang, Y. Yao, G. Wu, J. Kuai, X. Liu, J. Jiang, J. Huang, B. Li, J. Chen, S. Zhang, S. Ao, Z. Li, R. Chen, H. Luo, F. Zhao, and J. Yu, "The robodepth challenge: Methods and advancements towards robust depth estimation," 2023. \ No newline at end of file diff --git a/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/images.zip b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..43d5934d601d0d040154434fb06887ff7794367e --- /dev/null +++ b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ef1dd45a41fbbb53847b55a560a4ac4bf6b63be89f3d76269578034fd340e0e1 +size 729091 diff --git a/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/layout.json b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..b035692be178b69ea701151f05d2703024ed9b01 --- /dev/null +++ b/2024/Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training/layout.json @@ -0,0 +1,10308 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 145, + 111, + 470, + 166 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 111, + 470, + 166 + ], + "spans": [ + { + "bbox": [ + 145, + 111, + 470, + 166 + ], + "type": "text", + "content": "Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "spans": [ + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "content": "Yuanqi Yao" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "content": ", Gang Wu" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "content": ", Kui Jiang" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "content": ", Siao Liu" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "content": ", Jian Kuai" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "content": ", Xianming Liu" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "text", + "content": ", and Junjun Jiang" + }, + { + "bbox": [ + 133, + 185, + 480, + 210 + ], + "type": "inline_equation", + "content": "^{\\star 1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 145, + 219, + 468, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 145, + 219, + 468, + 274 + ], + "spans": [ + { + "bbox": [ + 145, + 219, + 468, + 274 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 145, + 219, + 468, + 274 + ], + "type": "text", + "content": " Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China {yuanqiyao,kuaijian}@stu.hit.edu.cn {gwu,jiangkui,csxm,jiangjunjun}@hit.edu.cn " + }, + { + "bbox": [ + 145, + 219, + 468, + 274 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 145, + 219, + 468, + 274 + ], + "type": "text", + "content": " Academy for Engineering & Technology, Fudan University saliu20@fudan.edu.com" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 159, + 302, + 452, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 302, + 452, + 521 + ], + "spans": [ + { + "bbox": [ + 159, + 302, + 452, + 521 + ], + "type": "text", + "content": "Abstract. Learning a self-supervised Monocular Depth Estimation (MD) model with great generalization remains significantly challenging. Despite the success of adversarial augmentation in the supervised learning generalization, naively incorporating it into self-supervised MDE models potentially causes over-regularization, suffering from severe performance degradation. In this paper, we conduct qualitative analysis and illuminate the main causes: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), integrating adversarial data augmentation into self-supervised MDE methods to achieve a balance between stability and generalization. Specifically, we devise an effective scaling depth network that tunes the coefficients of long skip connection and effectively stabilizes the training process. Then, we propose a conflict gradient surgery strategy, which progressively integrates the adversarial gradient and optimizes the model toward a conflict-free direction. Extensive experiments on five benchmarks demonstrate that SCAT can achieve state-of-the-art performance and significantly improve the generalization capability of existing self-supervised MDE methods." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 533, + 455, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 533, + 455, + 555 + ], + "spans": [ + { + "bbox": [ + 159, + 533, + 455, + 555 + ], + "type": "text", + "content": "Keywords: Domain Generalization " + }, + { + "bbox": [ + 159, + 533, + 455, + 555 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 533, + 455, + 555 + ], + "type": "text", + "content": " Self-Supervised Monocular Depth Estimation " + }, + { + "bbox": [ + 159, + 533, + 455, + 555 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 533, + 455, + 555 + ], + "type": "text", + "content": " Stabilized Adversarial Training" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 574, + 230, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 574, + 230, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 574, + 230, + 588 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 599, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 599, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 599, + 482, + 647 + ], + "type": "text", + "content": "Monocular depth estimation (MDE) plays an important role in various 3D perceptual fields such as robotic navigation [17], autonomous driving [16] and 3D reconstruction [30]. However, due to the dynamic nature of the real world, even minor perturbations in the environment can result in significant domain shifts in" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 234, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 234, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 234, + 665 + ], + "type": "text", + "content": "* Corresponding author" + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 159, + 121, + 260, + 217 + ], + "blocks": [ + { + "bbox": [ + 159, + 121, + 260, + 217 + ], + "lines": [ + { + "bbox": [ + 159, + 121, + 260, + 217 + ], + "spans": [ + { + "bbox": [ + 159, + 121, + 260, + 217 + ], + "type": "image", + "image_path": "e305a494b2c1eacfea5b0a00f7092a1b4e7f34923ceeb9b8c48384f0e33c5280.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 209, + 218, + 219, + 226 + ], + "lines": [ + { + "bbox": [ + 209, + 218, + 219, + 226 + ], + "spans": [ + { + "bbox": [ + 209, + 218, + 219, + 226 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 260, + 124, + 358, + 218 + ], + "blocks": [ + { + "bbox": [ + 260, + 124, + 358, + 218 + ], + "lines": [ + { + "bbox": [ + 260, + 124, + 358, + 218 + ], + "spans": [ + { + "bbox": [ + 260, + 124, + 358, + 218 + ], + "type": "image", + "image_path": "e42463e005bff75012c9d98c7960f25b73824cf0289a5776ef2eff491a265284.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 306, + 218, + 316, + 227 + ], + "lines": [ + { + "bbox": [ + 306, + 218, + 316, + 227 + ], + "spans": [ + { + "bbox": [ + 306, + 218, + 316, + 227 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 236, + 482, + 304 + ], + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 304 + ], + "type": "text", + "content": "Fig. 1: Visualization of the domain generalization over various methods.(a) Comparisons with offline scenario-specific data augmentation methods.(b) Comparisons with vanilla Gaussian noise and vanilla adversarial data augmentation.(c) Comparisons of different LSCs scaling factors. The results show that our SCAT has excellent generalization performance under multiple unseen domains and retains the performance on the original training set." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 364, + 124, + 454, + 217 + ], + "blocks": [ + { + "bbox": [ + 364, + 124, + 454, + 217 + ], + "lines": [ + { + "bbox": [ + 364, + 124, + 454, + 217 + ], + "spans": [ + { + "bbox": [ + 364, + 124, + 454, + 217 + ], + "type": "image", + "image_path": "4dda3d3efaef5bbe7c9f122ccd732b50c835d762e633761f8d36d9d6d1e4f412.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 406, + 218, + 415, + 227 + ], + "lines": [ + { + "bbox": [ + 406, + 218, + 415, + 227 + ], + "spans": [ + { + "bbox": [ + 406, + 218, + 415, + 227 + ], + "type": "text", + "content": "(c)" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 312, + 480, + 337 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 312, + 480, + 337 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 480, + 337 + ], + "type": "text", + "content": "the visual observations, which makes the trained model hard to generalize into unseen scenarios and restricts its application in the physical world." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 339, + 482, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 339, + 482, + 532 + ], + "spans": [ + { + "bbox": [ + 130, + 339, + 482, + 532 + ], + "type": "text", + "content": "To improve the generalization capability, several studies [19, 28, 66] utilize data augmentation methods to generate synthetic data and diversify the training environments, yielding considerable performance improvements. However, existing methods such as [19] mostly select some specific data augmentation schemes for target scenarios, yielding poor generalization performance in environments varying far from the augmented images. Compared with above mentioned offline data augmentation, adversarial data augmentation (ADA) does not make any target distribution assumption and synchronously optimizes the augmenter during the training phase, providing a promising pre-processing solution. Unfortunately, there is a dilemma in naively incorporating ADA into self-supervised MDE. Although adversarial data augmentation can effectively improve generalization capability in multiple supervised visual tasks [19], self-supervised MDE algorithms are quite sensitive to such excessive perturbation, resulting in significant performance degradation and training collapse. Therefore, it is necessary to rethink why self-supervised MDE cannot benefit from ADA as much as supervised learning." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": "In this work, we first conduct extensive quantitative analysis to investigate the causes of performance degradation when applying adversarial data augmentation to common self-supervised MDE models. There are two primary factors for this phenomenon: (i) inherent sensitivity of long skip connections (LSC) in UNet-alike depth estimation networks; (ii) dual optimization conflict caused by over-regularization. Specifically, as a core component in the MDE, LSC is widely adopted in the UNet-alike Depth Networks to combine multi-scale features and preserve low-level detail, yielding better prediction performance. However, the presence of these shortcut connections amplifies adversarial gradients, when coupled with pixel-level adversarial data augmentation, leading to severe training instability and collapse. Moreover, compared to offline data augmentation, ad" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "versarial augmentation data commonly act as the worst-case training examples [36,37] and often provides over-regularization for the model training, which results in optimization gradients that oppose those of the original data, leading to severe gradient conflicts and a subsequent decline in convergence performance." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 482, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 482, + 344 + ], + "type": "text", + "content": "To tackle these issues, we propose a general adversarial training framework, named Stabilized Conflict-optimization Adversarial Training (SCAT), tailored for self-supervised monocular depth estimation. SCAT is designed to enhance both generalization capability and stability. In particular, we develop an innovative scaling depth network that adjusts the coefficients of long skip connections within UNet architecture, thereby ensuring a more stable training regime through a theoretically supported. Furthermore, we advance a Conflict Gradient Surgery method, progressively blending the adversarial gradient to guide the model optimization along a direction devoid of conflicts. It is worth noting that one of the merits of our method SCAT is model-agnostic, and the stabilized adversarial training can be applied to diverse SOTA methods, yielding consistent generalization enhancement. To validate the effectiveness of SCAT, we conduct extensive experiments on both KITTI and KITTI-C datasets, demonstrating its cross-domain generalization capability on Foggy CityScapes, DrivingStereo and NuScenes datasets. In summary, our contributions are summarized as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 351, + 488, + 468 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 351, + 479, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 351, + 479, + 384 + ], + "spans": [ + { + "bbox": [ + 138, + 351, + 479, + 384 + ], + "type": "text", + "content": "- We point out the inherent sensitivity of UNet-based depth networks and the dual optimization conflict caused by over-regularization, providing a theoretical analysis of the self-supervised MDE model's instability." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 139, + 387, + 488, + 432 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 387, + 488, + 432 + ], + "spans": [ + { + "bbox": [ + 139, + 387, + 488, + 432 + ], + "type": "text", + "content": "- We propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which efficiently incorporates adversarial augmentation into self-supervised MDE, and significantly improves the model generalization capabilities across multiple unseen domains." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 139, + 435, + 479, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 435, + 479, + 468 + ], + "spans": [ + { + "bbox": [ + 139, + 435, + 479, + 468 + ], + "type": "text", + "content": "- We developed Conflict Gradient Surgery (CGS) to address the dual optimization conflicts induced by adversarial over-regularization, achieving a balance between model stability and generalization." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 489, + 242, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 489, + 242, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 489, + 242, + 502 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 514, + 389, + 528 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 514, + 389, + 528 + ], + "spans": [ + { + "bbox": [ + 132, + 514, + 389, + 528 + ], + "type": "text", + "content": "2.1 Self-Supervised Monocular Depth Estimation" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 483, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 483, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 483, + 665 + ], + "type": "text", + "content": "Self-supervised monocular depth estimation (MDE) has made remarkable progress in recent years, enabling depth learning from unlabeled data. The seminal work by Zhou et al. [23] laid the foundation by jointly optimizing depth and pose networks using an image reconstruction loss. Since then, two main approaches have emerged: stereo training and monocular training. Stereo training methods utilize synchronized stereo image pairs to predict disparity maps, with notable contributions including photometric consistency loss [4], left-right consistency [6], and continuous disparity prediction [45]. Monocular training, on the other hand, relies on the consistency between synthesized and actual scene views, with SfM-Learner [23] pioneering the joint training of a DepthNet and a PoseNet using a photometric loss. Researchers have also explored complementary techniques" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": "to further boost performance, such as occlusion modeling [38-41], scale ambiguity [42] advanced network architectures [12, 43, 44], semantic information integration [46-50], and object size cues [48, 51]. The proposed use of orthogonal planes for improved depth representation in driving scenarios contributes to the ongoing advancements in this field." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 205, + 443, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 205, + 443, + 217 + ], + "spans": [ + { + "bbox": [ + 131, + 205, + 443, + 217 + ], + "type": "text", + "content": "2.2 Domain Generalization in Monocular Depth Estimation" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 236, + 483, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 483, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 483, + 439 + ], + "type": "text", + "content": "A line of studies investigated how to utilize data augmentation or synthetic data generation to improve the domain generalization capability of MDE [19, 28, 29, 52-56]. ADDS-DepthNet [28] generates night image pairs from day images using GANs, training the network to be effective in both day and night domains. It uses day depth estimates as pseudo-supervision for night scenes, which limits the night depth estimation to the accuracy of the day estimates. Additionally, ADDS-DepthNet focuses on reconstructing GAN-generated night images, which generates reconstruction targets with high variance, resulting detrimental to the self-supervised MDE algorithm. ITDFA [56] employs a fixed depth decoder and adapts the encoders for each domain to enforce feature consistency across domains, which is limited to the performance. Robust-Depth [19] put forward an offline data augmentation method. By exploiting the correspondence between unaugmented and augmented data they introduce a pseudo-supervised loss for both depth and pose estimation. However, previous approaches limited the ability to handle environments with pre-defined variations and require substantial architectural modifications to obtain realistic depth estimates, leading to severe domain bias when applied to real-world scenes [19, 28]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 468, + 265, + 480 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 468, + 265, + 480 + ], + "spans": [ + { + "bbox": [ + 131, + 468, + 265, + 480 + ], + "type": "text", + "content": "2.3 Adversarial Training" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "Adversarial training has emerged as a popular technique to improve the generalization capability of deep neural networks. This approach involves incorporating both benign and adversarial examples during the training process, enabling models to learn more robust features [57]. Researchers have successfully applied adversarial training to various computer vision tasks, such as image classification [26, 57], object detection [58, 59], and segmentation [60, 61]. However, generating adversarial examples typically requires ground truth labels, which limits the applicability of adversarial training to supervised learning settings. To address this limitation, semi-supervised adversarial learning methods [62, 63] have been proposed, which leverage a small portion of labeled data to enhance robustness. Additionally, contrastive learning [64, 65] has been combined with adversarial examples to improve self-supervised learning and model robustness. In the context of MDE, adversarial training remains largely unexplored, particularly in self-supervised MDE which absent the ground truth depth information." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 141, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 207, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 207, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 207, + 102 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 234, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 234, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 234, + 127 + ], + "type": "text", + "content": "3 Preliminaries" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 139, + 269, + 150 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 139, + 269, + 150 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 269, + 150 + ], + "type": "text", + "content": "3.1 Problem Formulation" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "spans": [ + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": "Following [5, 7], we regard the self-supervised depth estimation as an image reconstruction task, where the objective is to reconstruct the target current frame image " + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "inline_equation", + "content": "I_{t}" + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": " from consecutive frames " + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "inline_equation", + "content": "I_{t}^{\\prime} \\in \\{I_{t - 1}, I_{t + 1}\\}" + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": ". Specifically, we construct a dual-branch framework, involving a DepthNet and a PoseNet. The former is used for estimating depth map " + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "inline_equation", + "content": "D_{t}" + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": " while the latter is introduced to predict the relative poses " + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "inline_equation", + "content": "T_{t' \\to t}" + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": " through the inverse warping as below, the predicted depth map " + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "inline_equation", + "content": "D_{t}" + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": " in conjunction with the relative poses " + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "inline_equation", + "content": "T_{t' \\to t}" + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": " can synthesize the target image " + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "inline_equation", + "content": "I_{t' \\to t}" + }, + { + "bbox": [ + 130, + 159, + 482, + 255 + ], + "type": "text", + "content": ", depicted as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 233, + 262, + 481, + 283 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 262, + 481, + 283 + ], + "spans": [ + { + "bbox": [ + 233, + 262, + 481, + 283 + ], + "type": "interline_equation", + "content": "I _ {t ^ {\\prime} \\rightarrow t} = I _ {t ^ {\\prime}} \\left\\langle \\operatorname {p r o j} \\left(D _ {t}, T _ {t \\rightarrow t ^ {\\prime}}, K\\right)\\right\\rangle , \\tag {1}", + "image_path": "bba1d5b6b5c63820b508928616a10edc432467c768ae188a4b7b548ac6191193.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "spans": [ + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "inline_equation", + "content": "proj(\\cdot)" + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "text", + "content": " generates the resulting 2D coordinates of the projected depths " + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "inline_equation", + "content": "Dt" + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "text", + "content": " in " + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "inline_equation", + "content": "It'" + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "inline_equation", + "content": "\\langle \\rangle" + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "text", + "content": " refers to the sampling operator. We minimize the photometric reprojection error " + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_p" + }, + { + "bbox": [ + 131, + 290, + 482, + 327 + ], + "type": "text", + "content": " to supervise the DepthNet," + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 256, + 335, + 481, + 360 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 256, + 335, + 481, + 360 + ], + "spans": [ + { + "bbox": [ + 256, + 335, + 481, + 360 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {p} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, I _ {t ^ {\\prime} \\rightarrow t}\\right), \\tag {2}", + "image_path": "ba48fdeaeb266a91e445409bcd3b049502f862aab28b6698ccbf9cb371363bf1.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "spans": [ + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "inline_equation", + "content": "pe" + }, + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "text", + "content": " is the photometric reconstruction error. As suggestion in [6, 13], we adopt the weighted combination of " + }, + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "inline_equation", + "content": "L_{1}" + }, + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "text", + "content": " loss and SSIM [24] to formulate the photometric error function " + }, + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "inline_equation", + "content": "pe" + }, + { + "bbox": [ + 131, + 368, + 482, + 404 + ], + "type": "text", + "content": ", denoted as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 190, + 412, + 481, + 433 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 412, + 481, + 433 + ], + "spans": [ + { + "bbox": [ + 190, + 412, + 481, + 433 + ], + "type": "interline_equation", + "content": "p e (I _ {a}, I _ {b}) = \\frac {\\alpha}{2} (1 - \\operatorname {S S I M} (I _ {a}, I _ {b})) + (1 - \\alpha) | | I _ {a} - I _ {b} | | _ {1}. \\tag {3}", + "image_path": "b136f6ec73e9e16400bec31797278a015a7c4f0270d15619ad0c1ca3b3db0c6e.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 447, + 380, + 459 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 380, + 459 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 380, + 459 + ], + "type": "text", + "content": "3.2 Analysis on Unstable Self-Supervised MDE" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 467, + 481, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 467, + 481, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 467, + 481, + 491 + ], + "type": "text", + "content": "In this section, we aim to investigate the primary causes why naively applying adversarial data augmentation in self-supervised MDE leads to instability." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 491, + 481, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 491, + 481, + 538 + ], + "spans": [ + { + "bbox": [ + 131, + 491, + 481, + 538 + ], + "type": "text", + "content": "Pitfall1: Sensitive UNet-alike Depth Network. In previous self-supervised MDE methods [7-9], UNet [32] is the most popular depth network backbone, since its long skip connects (LSCs) to connect distant network blocks can fuse multi-granularity semantic information and spatial information:" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 167, + 548, + 481, + 561 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 548, + 481, + 561 + ], + "spans": [ + { + "bbox": [ + 167, + 548, + 481, + 561 + ], + "type": "interline_equation", + "content": "\\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \\circ [ a _ {i + 1} \\circ x + f _ {i + 1} (a _ {i + 1} \\circ x) ], \\tag {4}", + "image_path": "db0b5704678c03c37972b5cf8da58b7b59be313d07bf83806069b826f598ad47.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "x \\in R^{m}" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": " denotes the input, " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "a_{i}" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "b_{i}(i \\geq 1)" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": " are the trainable parameter of the " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": "-th block. For the vector operation " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\circ" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": ", it can be designed to implement different networks. Assume an extra noise " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\delta} \\sim N(0, \\sigma_{\\delta}^2 I)" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": " is injected into " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "I_{t}" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": " which yields a new input " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\tilde{I}_{t}'" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": ", self-supervised MDE with data augmentations aims to reprojection " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "I_{t' \\to t}" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": " from the noisy input " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\tilde{I}_{t'}" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": ". Accordingly, if the variance " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sigma_{\\delta}^2" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": " of extra noise is large, it can hinder re-projecting the desired target image " + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "inline_equation", + "content": "I_{t' \\to t}" + }, + { + "bbox": [ + 130, + 568, + 482, + 666 + ], + "type": "text", + "content": ". In adversarial training, the variance of this extra noise varies along training iterations, further exacerbating the instability of self-supervised MDE training." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": "Recent work [35] also reveals a similar phenomenon, which demonstrates that the UNet-based segmentation architecture is sensitive to perturbed noise, suffering from catastrophic training collapse. It is noteworthy that, although our theoretical analysis is focused on UNet-based depth estimation architectures, the LSC component is extensively employed across various mainstream architectures [11], thereby lending a degree of extensibility to our empirical results." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "text", + "content": "Pitfall2: Dual Optimization Conflict by Over-Regularization. Compared to the offline data augmentation in Robust-Depth [19], Adversarial Data Augmentation (ADA) makes no assumptions about the target distribution and synchronously optimizes augmenters during the training phase, offering a promising pre-processing solution. Unfortunately, naively incorporating ADA into self-supervised Monocular Depth Estimation (MDE) presents a dilemma. While adversarial data augmentation can effectively enhance generalization in various supervised visual tasks, a dual optimization conflict arises due to the opposing gradient optimization directions between the adversarial-perturbed data and the original data. Similar to [31], we also define " + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\phi_{ij}" + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "text", + "content": " as the angle between origin data " + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "inline_equation", + "content": "g_i" + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "text", + "content": " and adversarial-perturbed data gradient " + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "inline_equation", + "content": "g_j" + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "text", + "content": ", the gradients as conflicting when " + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\cos \\phi_{ij} < 0" + }, + { + "bbox": [ + 130, + 188, + 482, + 369 + ], + "type": "text", + "content": ". Therefore, for self-supervised MDE, over-regularization leads to ADA dominating the gradient updates, resulting in significant performance degradation and training collapse. We refer to this issue as a dual optimization conflict caused by over-regularization." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 385, + 202, + 398 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 385, + 202, + 398 + ], + "spans": [ + { + "bbox": [ + 132, + 385, + 202, + 398 + ], + "type": "text", + "content": "4 Method" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 411, + 279, + 422 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 411, + 279, + 422 + ], + "spans": [ + { + "bbox": [ + 132, + 411, + 279, + 422 + ], + "type": "text", + "content": "4.1 Architectural Overview" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "text", + "content": "In this section, we propose a general adversarial training framework named Stabilized Conflict-optimization Adversarial Training (SCAT), which is compatible with any self-supervised MDE method. An overview of the SCAT architecture is provided in Fig. 2. To circumvent erroneous bootstrapping from adversarial augmented data, augmentation was applied to improve generalization by reconstructing the unaugmented " + }, + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "inline_equation", + "content": "I_{t}" + }, + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "text", + "content": ", rather than the augmented image " + }, + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "inline_equation", + "content": "\\tilde{I}_{t}" + }, + { + "bbox": [ + 130, + 430, + 482, + 502 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 281, + 510, + 480, + 525 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 281, + 510, + 480, + 525 + ], + "spans": [ + { + "bbox": [ + 281, + 510, + 480, + 525 + ], + "type": "interline_equation", + "content": "\\tilde {I} _ {t ^ {\\prime}} = I _ {t ^ {\\prime}} + \\delta \\tag {5}", + "image_path": "2fa0f17de1d3f5a1c418e7ce4fdece50afe2803a01e27e6ac08b870441cee3b4.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 233, + 533, + 480, + 552 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 533, + 480, + 552 + ], + "spans": [ + { + "bbox": [ + 233, + 533, + 480, + 552 + ], + "type": "interline_equation", + "content": "\\tilde {I} _ {t ^ {\\prime} \\rightarrow t} = I _ {t ^ {\\prime}} \\left\\langle \\operatorname {p r o j} \\left(\\tilde {D} _ {t}, \\tilde {T} _ {t \\rightarrow t ^ {\\prime}}, K\\right)\\right\\rangle , \\tag {6}", + "image_path": "8451a8279d80d40166fe441b43308625146f0287bd3b43d6f77228db12248fdf.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 224, + 558, + 480, + 581 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 224, + 558, + 480, + 581 + ], + "spans": [ + { + "bbox": [ + 224, + 558, + 480, + 581 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {p} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, I _ {t ^ {\\prime} \\rightarrow t}\\right) + p e \\left(I _ {t}, \\tilde {I} _ {t ^ {\\prime} \\rightarrow t}\\right). \\tag {7}", + "image_path": "1b1e70b5432cf21129ba0faf6ea718e4c55cd823d70a1b2bcc55d2e28dbee92e.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "text", + "content": "If " + }, + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "text", + "content": " is learned (i.e. SCAT is implemented with an adversarial generator " + }, + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\delta = g_{\\phi}(z)" + }, + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "text", + "content": ", to introduce adversarial training into self-supervised MDE, we calculate the reprojection loss for the current frame image reconstructed from the perturbed images and use it as the self-supervised constraint loss " + }, + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{AD}" + }, + { + "bbox": [ + 130, + 586, + 482, + 635 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 252, + 643, + 480, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 643, + 480, + 667 + ], + "spans": [ + { + "bbox": [ + 252, + 643, + 480, + 667 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {A D} = \\sum_ {t ^ {\\prime}} p e \\left(I _ {t}, \\tilde {I} _ {t ^ {\\prime} \\rightarrow t}\\right). \\tag {8}", + "image_path": "d2961da89392b0d74d7a0f1feaa11bd82be83e2c5271a66523f12aecab1a437d.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 124, + 479, + 293 + ], + "blocks": [ + { + "bbox": [ + 136, + 124, + 479, + 293 + ], + "lines": [ + { + "bbox": [ + 136, + 124, + 479, + 293 + ], + "spans": [ + { + "bbox": [ + 136, + 124, + 479, + 293 + ], + "type": "image", + "image_path": "56def8c71425cdb824d196156fc7bf72c3e3e97dcd82899a9a96c55e56aa835d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 305, + 480, + 376 + ], + "lines": [ + { + "bbox": [ + 131, + 305, + 480, + 376 + ], + "spans": [ + { + "bbox": [ + 131, + 305, + 480, + 376 + ], + "type": "text", + "content": "Fig. 2: Overview of our SCAT architecture. Our method introduces an adversarial noise generator, which is optimized through " + }, + { + "bbox": [ + 131, + 305, + 480, + 376 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{AD}" + }, + { + "bbox": [ + 131, + 305, + 480, + 376 + ], + "type": "text", + "content": " and acts as an adversarial constraint, while " + }, + { + "bbox": [ + 131, + 305, + 480, + 376 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_p" + }, + { + "bbox": [ + 131, + 305, + 480, + 376 + ], + "type": "text", + "content": " imposes self-supervised constraints to optimize self-supervised MDE model. CGS incrementally applies adversarial augmenters from multiple iterations, enabling a balanced achievement in model generalization and stability. Meanwhile, we utilize a scaling depth network(SDN) to stabilize the training process." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "spans": [ + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "text", + "content": "Our goal is to find a noise distribution " + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "inline_equation", + "content": "p_{\\phi}(\\delta)" + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "inline_equation", + "content": "\\delta \\in R^{N}" + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "inline_equation", + "content": "\\| \\delta \\| _2 = \\epsilon" + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "text", + "content": ", such that noise samples added to input clean image " + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "inline_equation", + "content": "I_{t}" + }, + { + "bbox": [ + 130, + 396, + 480, + 433 + ], + "type": "text", + "content": " maximally confuse the depth network. More concisely, we optimize the following equation, depicted as" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 216, + 441, + 480, + 464 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 441, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 216, + 441, + 480, + 464 + ], + "type": "interline_equation", + "content": "\\min _ {\\theta} \\max _ {\\phi} \\mathbb {E} _ {\\tilde {I} _ {t ^ {\\prime}}, I _ {t}} \\mathbb {E} _ {\\delta \\sim p _ {\\phi} (\\delta)} \\left[ \\mathcal {L} \\left(f _ {\\theta} \\left(\\tilde {I} _ {t ^ {\\prime}}\\right), I _ {t}\\right) \\right]. \\tag {9}", + "image_path": "b3c279898fd44402c93c33892421273332d060b240758a5a846d1c4b76d4b368.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "text", + "content": "Specifically, " + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "inline_equation", + "content": "\\max_{\\phi}" + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "text", + "content": " represents the adversarial noise generator's attempt to maximize the " + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{AD}" + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "text", + "content": ", thereby generating adversarial samples that maximally perturb the depth network. Conversely, " + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "inline_equation", + "content": "\\min_{\\theta}" + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "text", + "content": " denotes the depth network's effort to minimize the " + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_p" + }, + { + "bbox": [ + 130, + 473, + 479, + 557 + ], + "type": "text", + "content": " on these adversarial samples, aiming to achieve robustness in depth estimation across various adversarial inputs. Through training iterations provided in Algorithm 1 in our SCAT framework, self-supervised MDE models becomes proficient at accurately inferring various perturbed images." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 558, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 480, + 666 + ], + "type": "text", + "content": "However, as the variance of this extra adversarial noise varies along training, the standard UNet-based depth network is too sensitive to these perturbations. Hence, we propose a Scaling Depth Network (SDN), which appropriately scales the coefficients " + }, + { + "bbox": [ + 130, + 558, + 480, + 666 + ], + "type": "inline_equation", + "content": "\\kappa_{i}" + }, + { + "bbox": [ + 130, + 558, + 480, + 666 + ], + "type": "text", + "content": " to lower reconstruction error. In addition, conflict arises by opposing gradient optimization directions between the adversarial-perturbed data and original data, further exacerbating the training instability. To ensure the model has enough representational power while preventing unstable parameter updates, we propose Conflict Gradient Surgery (CGS) to refine the adversarial training gradient update process, which we introduce in the following section." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 279, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 279, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 279, + 129 + ], + "type": "text", + "content": "4.2 Scaling Depth Network" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 136, + 479, + 160 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 136, + 479, + 160 + ], + "spans": [ + { + "bbox": [ + 131, + 136, + 479, + 160 + ], + "type": "text", + "content": "To alleviate the impact of extra noise, we devise scaling depth network (SDN) to scale the coefficients " + }, + { + "bbox": [ + 131, + 136, + 479, + 160 + ], + "type": "inline_equation", + "content": "\\kappa_{i}" + }, + { + "bbox": [ + 131, + 136, + 479, + 160 + ], + "type": "text", + "content": " of LSCs:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 144, + 169, + 481, + 183 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 169, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 144, + 169, + 481, + 183 + ], + "type": "interline_equation", + "content": "\\operatorname {D e p t h N e t} (x) = f _ {0} (x), f _ {i} (x) = b _ {i + 1} \\circ \\left[ k _ {i + 1} \\cdot a _ {i + 1} \\circ x + f _ {i + 1} \\left(a _ {i + 1} \\circ x\\right) \\right], \\tag {10}", + "image_path": "cfe5d1ed523328bf453fab4f0b2877831e7ae953c68b4255e5105801ea167235.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "spans": [ + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "\\kappa_{i} > 0" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "(i \\geq 1)" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": " are the scaling coefficients and are set to 1 in standard UNet-based depth network. For scaling depth network in Eq.10, assume " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "M_0 = \\max \\{||b_i \\circ a_i||_2, 1 \\leq i \\leq N\\}" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "f_N" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": " is " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "L_0" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": "-Lipschitz continuous, " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "c_0" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": " is a constant related to " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "M_0" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "L_0" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": ". Suppose " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "I_t^{\\epsilon_\\delta}" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": " is an perturbed input of the vanilla input " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "I_t" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": " with a small perturbation " + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "inline_equation", + "content": "\\epsilon_\\delta = ||I_t^{\\epsilon_\\delta} - I_t||_2" + }, + { + "bbox": [ + 131, + 191, + 479, + 252 + ], + "type": "text", + "content": ". Then we have" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 216, + 261, + 481, + 294 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 261, + 481, + 294 + ], + "spans": [ + { + "bbox": [ + 216, + 261, + 481, + 294 + ], + "type": "interline_equation", + "content": "\\left| \\left| f _ {\\theta} \\left(\\mathbf {I} _ {t} ^ {\\epsilon_ {\\delta}}\\right) - f _ {\\theta} \\left(\\mathbf {I} _ {t}\\right) \\right| \\right| _ {2} \\leq \\epsilon_ {\\delta} \\left[ \\sum_ {i = 1} ^ {N} \\kappa_ {i} M _ {0} ^ {i} + c _ {0} \\right], \\tag {11}", + "image_path": "a7eba1dcbf6494782f1eaf4e37c823b17042f0c2348741eee86ec4f5d8ccaebf.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 301, + 479, + 313 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 301, + 479, + 313 + ], + "spans": [ + { + "bbox": [ + 131, + 301, + 479, + 313 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 301, + 479, + 313 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 131, + 301, + 479, + 313 + ], + "type": "text", + "content": " is the number of the long skip connections. See the proof in Appendix." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": "Eq.11 shows that for a perturbation magnitude " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\delta}" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": ", the reconstruction error bound of depth network is " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\mathcal{O}(\\epsilon_{\\delta}\\left(\\sum_{k = 1}K_{i}M_{0}^{i}\\right)" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": ". For standard UNet-based depth network (" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\kappa_{i} = 1\\forall i" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": "), this bound becomes a very large bound " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\mathcal{O}(NM_0^N)" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": ". This implies that a standard UNet-based depth network is sensitive to extra noise in the input, especially when LSC number " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": " is large. Intuitively, setting appropriate scaling coefficients " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\kappa_{i}" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": " in our scaling depth network can enhance the robustness of the model to input perturbations, thereby improving better stability for self-supervised MDE. To derive the scaling coefficient " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\kappa" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": ", we adopt a heuristic algorithm to assign a uniform constant value of " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\kappa_{*}" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": " across all LSCs, with the default set to 0.7. In terms of implementation, a line of parameter optimization techniques [33,35] can be applied, e.g. incorporating an adaptive projection layer [35] for each LSC component. The empirical discussions in the Appendix demonstrate that a singular scaling parameter " + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\kappa" + }, + { + "bbox": [ + 130, + 314, + 482, + 482 + ], + "type": "text", + "content": " is sufficient to strike to balance performance and efficiency for the self-supervised MDE task." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 498, + 292, + 511 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 292, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 292, + 511 + ], + "type": "text", + "content": "4.3 Conflict Gradient Surgery" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 518, + 479, + 602 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 518, + 479, + 602 + ], + "spans": [ + { + "bbox": [ + 130, + 518, + 479, + 602 + ], + "type": "text", + "content": "Here, we propose to modify the standard adversarial data augmentation (ADA) by incorporating conflict gradient surgery named CGS, aiming to change the distribution of " + }, + { + "bbox": [ + 130, + 518, + 479, + 602 + ], + "type": "inline_equation", + "content": "\\cos(\\theta)" + }, + { + "bbox": [ + 130, + 518, + 479, + 602 + ], + "type": "text", + "content": " tends towards positive values, where " + }, + { + "bbox": [ + 130, + 518, + 479, + 602 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 518, + 479, + 602 + ], + "type": "text", + "content": " is the angle between the gradient of the original data and the gradient of the CGS adversarial data, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, and finally improves the robustness of the model to perturbations:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 212, + 611, + 402, + 635 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 212, + 611, + 402, + 635 + ], + "spans": [ + { + "bbox": [ + 212, + 611, + 402, + 635 + ], + "type": "interline_equation", + "content": "\\mathbb {E} \\left[ \\cos (\\theta) \\right] > 0, \\quad \\text {w h e r e} \\cos (\\theta_ {i}) = \\frac {g _ {i} \\cdot g _ {\\operatorname* {m i x} _ {i}}}{| g _ {i} | | g _ {\\operatorname* {m i x} _ {i}} |}", + "image_path": "2fc00895d9a9ebe54dde98a79021cb380ab898dad003eadf300f4725cfdc4a07.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "g_{i}" + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": " is the gradient of the i-th original data, " + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "g_{mix_i}" + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": " is the gradient of the i-th mixed adversarial data. We calculate the gradient cosine similarity between" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 207, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 207, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 207, + 101 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "the gradient of the adversarial-perturbed data and the original data. We define two gradients as conflicting if their cosine similarity is negative, indicating they are diverging from one another. If the distribution of cosine similarities tends to be negative, it signifies the presence of numerous adversely oriented gradients, which can mislead the gradient optimization process. As illustrated in Fig. 3, we extracted 1000 images from the KITTI dataset and recorded the gradient cosine similarity between pairs of adversarial perturbation data and original data. Without employing conflict gradient surgery, the gradient conflict becomes a prevalent issue as the adversarial training progresses iteratively, consequently leading slower convergence and performance degradation." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 149, + 240, + 459, + 363 + ], + "blocks": [ + { + "bbox": [ + 149, + 240, + 459, + 363 + ], + "lines": [ + { + "bbox": [ + 149, + 240, + 459, + 363 + ], + "spans": [ + { + "bbox": [ + 149, + 240, + 459, + 363 + ], + "type": "image", + "image_path": "64bced7f5a3e5465cff9e17de3d1ff2bb01e725674c9e98280481a2adf224221.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 365, + 482, + 411 + ], + "lines": [ + { + "bbox": [ + 130, + 365, + 482, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 482, + 411 + ], + "type": "text", + "content": "Fig. 3: (a) Statistics of gradient cosine similarity. Through CGS, we have shifted the distribution of cosine similarities from being negatively skewed to positively skewed, mitigating the previously prevalent issue of adversely oriented gradients. (b) Illustration of training oscillation issue arising from Dual Optimization Conflict." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "content": "Experimental observations provided in Fig. 3 demonstrate that our approach ensures the expectation of " + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "inline_equation", + "content": "\\cos(\\theta)" + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "content": " is positive, thereby skewing the distribution of " + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "inline_equation", + "content": "\\cos(\\theta)" + }, + { + "bbox": [ + 130, + 416, + 482, + 536 + ], + "type": "text", + "content": " tends towards positive values, so that the gradient update guided by the adversarial data points in the direction of the conflict-free direction, ultimately enhancing the model's robustness against perturbations. Specifically, given a set of gradient vectors (one for each adversarial data augmentation), we construct the adversarial perturbation data while employing multiple adversarial generators from previous iterations, restraining the over-regularization caused by the conflict component through our conflict gradient surgery. The update procedure of the CGS algorithm is provided in Algorithm 1." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 552, + 230, + 566 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 552, + 230, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 552, + 230, + 566 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 575, + 273, + 588 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 575, + 273, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 575, + 273, + 588 + ], + "type": "text", + "content": "5.1 Experimental Settings" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": "KITTI [1] KITTI dataset is collected for mobile robotics and autonomous driving, involving hours of traffic scenarios recorded with a variety of sensor modalities, including high-resolution RGB, grayscale stereo cameras, and a 3D laser scanner. Following the setting in [5], we use 39,810 images for training and 4,424 for validation. Subsequently, we rigorously evaluate the proposed method and other compared methods on the KITTI eigen test dataset [3]." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 248, + 128, + 481, + 140 + ], + "blocks": [ + { + "bbox": [ + 133, + 115, + 402, + 127 + ], + "lines": [ + { + "bbox": [ + 133, + 115, + 402, + 127 + ], + "spans": [ + { + "bbox": [ + 133, + 115, + 402, + 127 + ], + "type": "text", + "content": "Algorithm 1 Generic SCAT self-supervised MDE algorithm" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 248, + 128, + 481, + 140 + ], + "lines": [ + { + "bbox": [ + 248, + 128, + 481, + 140 + ], + "spans": [ + { + "bbox": [ + 248, + 128, + 481, + 140 + ], + "type": "text", + "content": "( " + }, + { + "bbox": [ + 248, + 128, + 481, + 140 + ], + "type": "inline_equation", + "content": "\\triangleright" + }, + { + "bbox": [ + 248, + 128, + 481, + 140 + ], + "type": "text", + "content": " vanilla self-supervised MDE, " + }, + { + "bbox": [ + 248, + 128, + 481, + 140 + ], + "type": "inline_equation", + "content": "\\triangleright" + }, + { + "bbox": [ + 248, + 128, + 481, + 140 + ], + "type": "text", + "content": " our modifications)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "code", + "guess_lang": "javascript" + }, + { + "type": "code", + "bbox": [ + 132, + 142, + 482, + 299 + ], + "blocks": [ + { + "bbox": [ + 132, + 142, + 482, + 299 + ], + "lines": [ + { + "bbox": [ + 132, + 142, + 482, + 299 + ], + "spans": [ + { + "bbox": [ + 132, + 142, + 482, + 299 + ], + "type": "text", + "content": "1: for Epoch e = 1...n do do \n2: Adversarial Data Augmentation via CGS: \n3: g1:j ~ Sample(B, j) ▷Randomly select generators from History Buffer. \n4: δ1:j = g1:j(It) ▷Generate adversarial noise from clean images. \n5: I1:j = It + δ1:j ▷Obtain adversarial images. \n6: Deterministic Reprojection with SDN: \n7: Dt = ScalingDepthNet(It), Pt = PoseNet(It) \n8: Obtain clean depth map and camera poses. \n9: Obtain adversarial depth map and camera poses. \n10: I t'→t ⇔ fθ(I t'), I t'→t ⇔ fθ(I t') \n11: Reconstruct adversarial and clean images with the same target. \n12: B ← B ∪ ge ▷Add current Generator into History Buffer B. \n13: θ ← θ - ηθ∇θLp(f, It; θ) ▷Optimize MDE fθ with LP in Eq. 7. \n14: φ ← φ + ηφ∇φLAD(gφ, It; φ) ▷Optimize Generator gφ with LAD in Eq. 8. \n15: end for" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "code_body" + } + ], + "index": 4, + "sub_type": "algorithm" + }, + { + "type": "table", + "bbox": [ + 132, + 347, + 482, + 509 + ], + "blocks": [ + { + "bbox": [ + 132, + 311, + 482, + 336 + ], + "lines": [ + { + "bbox": [ + 132, + 311, + 482, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 311, + 482, + 336 + ], + "type": "text", + "content": "Table 1: Quantitative Results for the KITTI-C Dataset. Pink cell denotes the best performance, while yellow one denotes suboptimal." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 347, + 482, + 509 + ], + "lines": [ + { + "bbox": [ + 132, + 347, + 482, + 509 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 482, + 509 + ], + "type": "table", + "html": "
MethodW × HmCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]640 × 192101.0484.080.2481.7646.8520.2910.6980.8740.944
+ DA640 × 19297.7284.960.2271.7616.7350.2930.7100.8760.944
+ ADA640 × 19289.3187.310.1931.6326.4270.2780.7340.8820.945
+ SCAT (ours)640 × 19286.3290.130.1651.5736.1570.2690.7620.8930.951
CADepth [8]640 × 192108.1080.120.2711.9026.9000.3020.6740.8600.938
+ DA640 × 192107.1481.310.2611.8746.8320.2990.6910.8650.939
+ ADA640 × 19299.8183.130.2351.8666.5650.2780.7210.8710.940
+ SCAT (ours)640 × 19295.5487.930.1971.7946.2580.2640.7470.8830.948
HR-Depth [9]640 × 192103.6782.880.2551.9606.9090.3090.6700.8540.933
+ DA640 × 192101.7483.230.2431.9426.7870.2940.6850.8590.936
+ ADA640 × 19293.8485.320.2151.8316.6250.2780.6990.8610.939
+ SCAT (ours)640 × 19287.0689.470.1891.7326.2040.2580.7410.8710.945
MonoVit [11]640 × 19280.5488.980.1911.2745.9980.2450.7710.9220.964
+ DA640 × 19278.3290.470.1871.2565.8730.2280.7870.9310.965
+ ADA640 × 19272.4192.340.1661.1345.6260.2110.8190.9350.969
+ SCAT (ours)640 × 19262.7495.380.1271.0585.2740.2080.8460.9470.976
Robust-Depth* [19]640 × 19255.7296.460.1210.9545.0510.2010.8540.9520.978
+ DA640 × 19260.1296.340.1240.9635.0120.2130.8520.9510.977
+ ADA640 × 19254.2397.590.1190.9434.9850.1990.8530.9510.977
+ SCAT (ours)640 × 19253.3798.190.1170.9324.8720.1870.8610.9550.979
", + "image_path": "e90bfb563817bef6947bffe5b59ab9632ff7aaefbff61b6b0e786637a2ac830f.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 525, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 574 + ], + "type": "text", + "content": "KITTI-C [67] To evaluate the robustness and safety of our method in out-of-distribution (OoD) scenarios, we utilize KITTI-C dataset as a benchmark. The diverse corruptions enable the reliability of simulation to the potential perturbation distribution in real-world scenarios." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 577, + 482, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 577, + 482, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 577, + 482, + 625 + ], + "type": "text", + "content": "DrivingStereo [14] It contains 500 images captured under different weather conditions, involving foggy, cloudy, rainy, and sunny. These images offer a realistic representation of various driving scenarios, enabling robust evaluation of depth estimation performance across diverse domains." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Foggy CityScapes [2] Foggy CityScapes is a synthetic fog dataset that simulates real-world foggy scenarios. Each foggy sample is generated using the corresponding clear image and depth map from CityScapes dataset." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 116, + 220, + 159 + ], + "blocks": [ + { + "bbox": [ + 135, + 116, + 220, + 159 + ], + "lines": [ + { + "bbox": [ + 135, + 116, + 220, + 159 + ], + "spans": [ + { + "bbox": [ + 135, + 116, + 220, + 159 + ], + "type": "image", + "image_path": "99343199e3592b79f2309340975a5c137d386047be29bcf10cb1eaa0984febec.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 165, + 159, + 189, + 165 + ], + "lines": [ + { + "bbox": [ + 165, + 159, + 189, + 165 + ], + "spans": [ + { + "bbox": [ + 165, + 159, + 189, + 165 + ], + "type": "inline_equation", + "content": "\\epsilon_{m} = 20" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 164, + 167, + 448, + 177 + ], + "lines": [ + { + "bbox": [ + 164, + 167, + 448, + 177 + ], + "spans": [ + { + "bbox": [ + 164, + 167, + 448, + 177 + ], + "type": "text", + "content": "Fig. 4: Example images with different " + }, + { + "bbox": [ + 164, + 167, + 448, + 177 + ], + "type": "inline_equation", + "content": "\\epsilon_{m}" + }, + { + "bbox": [ + 164, + 167, + 448, + 177 + ], + "type": "text", + "content": " of adversarial perturbation." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 222, + 116, + 306, + 159 + ], + "blocks": [ + { + "bbox": [ + 222, + 116, + 306, + 159 + ], + "lines": [ + { + "bbox": [ + 222, + 116, + 306, + 159 + ], + "spans": [ + { + "bbox": [ + 222, + 116, + 306, + 159 + ], + "type": "image", + "image_path": "79954a7612ca79864ff5cf0dc87b4a02f90c88c45f19d4269b75a2814ccae9b5.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 252, + 159, + 276, + 165 + ], + "lines": [ + { + "bbox": [ + 252, + 159, + 276, + 165 + ], + "spans": [ + { + "bbox": [ + 252, + 159, + 276, + 165 + ], + "type": "inline_equation", + "content": "\\epsilon_{m} = 40" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 306, + 116, + 392, + 159 + ], + "blocks": [ + { + "bbox": [ + 306, + 116, + 392, + 159 + ], + "lines": [ + { + "bbox": [ + 306, + 116, + 392, + 159 + ], + "spans": [ + { + "bbox": [ + 306, + 116, + 392, + 159 + ], + "type": "image", + "image_path": "9d9eea900275057248df8a9b390cb913bc2f1bc302cc165470ce9cd17bf40c4a.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 337, + 159, + 361, + 166 + ], + "lines": [ + { + "bbox": [ + 337, + 159, + 361, + 166 + ], + "spans": [ + { + "bbox": [ + 337, + 159, + 361, + 166 + ], + "type": "inline_equation", + "content": "\\epsilon_{m} = 80" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 392, + 116, + 477, + 159 + ], + "blocks": [ + { + "bbox": [ + 392, + 116, + 477, + 159 + ], + "lines": [ + { + "bbox": [ + 392, + 116, + 477, + 159 + ], + "spans": [ + { + "bbox": [ + 392, + 116, + 477, + 159 + ], + "type": "image", + "image_path": "89083d7fb9f2d8d1b3e529884d4c2776b9229a415b05d07c54c013320eea0276.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 423, + 159, + 451, + 166 + ], + "lines": [ + { + "bbox": [ + 423, + 159, + 451, + 166 + ], + "spans": [ + { + "bbox": [ + 423, + 159, + 451, + 166 + ], + "type": "inline_equation", + "content": "\\epsilon_{m} = 135" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 187, + 479, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 187, + 479, + 223 + ], + "spans": [ + { + "bbox": [ + 130, + 187, + 479, + 223 + ], + "type": "text", + "content": "NuScenes [15] The NuScenes dataset comprises approximately 15,000 images captured in real nighttime urban street settings. To validate the model generalization, NuScenes is also selected as an evaluation benchmark in our study." + } + ] + } + ], + "index": 11 + }, + { + "type": "table", + "bbox": [ + 132, + 273, + 481, + 423 + ], + "blocks": [ + { + "bbox": [ + 130, + 230, + 480, + 264 + ], + "lines": [ + { + "bbox": [ + 130, + 230, + 480, + 264 + ], + "spans": [ + { + "bbox": [ + 130, + 230, + 480, + 264 + ], + "type": "text", + "content": "Table 2: Quantitative Results for the KITTI Eigen Test Dataset. The results indicate that SCAT largely maintains the performance of all baselines compared to vanilla ADA, ensuring the ability to infer accurate depth information on clean images." + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 273, + 481, + 423 + ], + "lines": [ + { + "bbox": [ + 132, + 273, + 481, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 273, + 481, + 423 + ], + "type": "table", + "html": "
MethodW × HAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
Monodepth2 [7]640 × 1920.1150.9034.8630.1930.8770.9590.981
+ ADA640 × 1920.1210.9784.9920.2210.8620.9530.978
+ SCAT (ours)640 × 1920.1160.9424.8770.1930.8770.9580.981
CADepth [8]640 × 1920.1050.7694.5350.1810.8920.9640.983
+ ADA640 × 1920.1080.8124.5850.1900.8870.9620.982
+ SCAT (ours)640 × 1920.1060.7964.5790.1830.8900.9630.983
DIFFNet [10]640 × 1920.1020.7494.4450.1790.8970.9650.983
+ ADA640 × 1920.1060.7934.5920.1840.8890.9630.982
+ SCAT (ours)640 × 1920.1030.7644.4530.1800.8970.9650.983
MonoVit [11]640 × 1920.0990.7084.3720.1750.9000.9670.984
+ ADA640 × 1920.1060.7334.5910.1840.8970.9630.982
+ SCAT (ours)640 × 1920.1000.7164.3890.1750.8990.9670.984
Robust-Depth* [19]640 × 1920.1000.7474.4550.1770.8950.9660.984
+ ADA640 × 1920.1050.7834.6980.1820.8890.9530.981
+ SCAT (ours)640 × 1920.1010.7544.4590.1770.8950.9660.984
", + "image_path": "4b23b99b5bd26b29479c48d92847767e54c0beb01351aeecd0cc1b5a791988e2.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "table_body" + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 447, + 300, + 458 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 300, + 458 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 300, + 458 + ], + "type": "text", + "content": "5.2 Effect of Perturbation Sizes" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 469, + 479, + 493 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 469, + 479, + 493 + ], + "spans": [ + { + "bbox": [ + 130, + 469, + 479, + 493 + ], + "type": "text", + "content": "To evaluate the effect of adversarial perturbation magnitude on model generalization, here we employ " + }, + { + "bbox": [ + 130, + 469, + 479, + 493 + ], + "type": "inline_equation", + "content": "\\epsilon_{m}" + }, + { + "bbox": [ + 130, + 469, + 479, + 493 + ], + "type": "text", + "content": " to perturbation sizes:" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 266, + 504, + 480, + 517 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 266, + 504, + 480, + 517 + ], + "spans": [ + { + "bbox": [ + 266, + 504, + 480, + 517 + ], + "type": "interline_equation", + "content": "\\epsilon_ {m} = \\min \\| \\delta_ {\\min } \\| _ {2}. \\tag {12}", + "image_path": "9412e2146b4e358cd8e163af4a2c51ca7daa2c169746352bf745f571b9036016.jpg" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 527, + 479, + 563 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 527, + 479, + 563 + ], + "spans": [ + { + "bbox": [ + 130, + 527, + 479, + 563 + ], + "type": "text", + "content": "We measure model generalization capability by calculating the median perturbation size " + }, + { + "bbox": [ + 130, + 527, + 479, + 563 + ], + "type": "inline_equation", + "content": "\\epsilon_{m}" + }, + { + "bbox": [ + 130, + 527, + 479, + 563 + ], + "type": "text", + "content": " and report the results in Tab. 3. To provide a better intuition for the noise level for particular " + }, + { + "bbox": [ + 130, + 527, + 479, + 563 + ], + "type": "inline_equation", + "content": "\\epsilon_{m}" + }, + { + "bbox": [ + 130, + 527, + 479, + 563 + ], + "type": "text", + "content": ", we display example images in Fig. 4." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 583, + 323, + 594 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 583, + 323, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 583, + 323, + 594 + ], + "type": "text", + "content": "5.3 Results on KITTI-C and KITTI" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "type": "text", + "content": "In this section, we compare the depth estimation performance of our SCAT on the KITTI-C and KITTI datasets. Quantitative results on the KITTI-C dataset are shown in Tab. 1. We conducted extensive experiments on multiple baseline models, comparing it with the generalization performance between offline data augmentation (DA) and vanilla adversarial data augmentation (ADA). As" + } + ] + } + ], + "index": 19 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 168, + 481, + 232 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 3: Qualitative Results for different perturbation sizes. We compare the results obtained by " + }, + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "inline_equation", + "content": "\\epsilon_{m} = 135.0" + }, + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "text", + "content": " adversarial noise generator with its counterparts of different perturbation sizes. Note that " + }, + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "inline_equation", + "content": "\\epsilon_{m} = 135.0" + }, + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "text", + "content": " was used in all experiments in this paper apart from this ablation study." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 168, + 481, + 232 + ], + "lines": [ + { + "bbox": [ + 133, + 168, + 481, + 232 + ], + "spans": [ + { + "bbox": [ + 133, + 168, + 481, + 232 + ], + "type": "table", + "html": "
ModelMCE(%)↓mRR(%)↑Abs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252 ↑δ < 1.253 ↑
MonoDepth2 [7]101.0484.080.2481.7646.8520.2910.6980.8740.944
+ gφεm = 2093.9686.170.1961.6196.3850.2850.7380.8830.947
+ gφεm = 4090.1586.930.1871.6136.3510.2820.7410.8850.949
+ gφεm = 8088.9587.210.1821.6026.2880.2790.7490.8900.949
+ gφεm = 13586.3290.130.1651.5736.1570.2690.7620.8930.951
+ gφεm = 18088.1786.830.1771.5946.1950.2770.7580.8910.950
", + "image_path": "98dfd4f0393c6c818ed979d29fecd3a94ac7cf442035967d49c7e455a96f05f7.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 133, + 242, + 478, + 401 + ], + "blocks": [ + { + "bbox": [ + 133, + 242, + 478, + 401 + ], + "lines": [ + { + "bbox": [ + 133, + 242, + 478, + 401 + ], + "spans": [ + { + "bbox": [ + 133, + 242, + 478, + 401 + ], + "type": "image", + "image_path": "378c4ba91cd101cf89219ca7d227bcb3b1de8db63a940d553d856d37699f153a.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 411, + 482, + 468 + ], + "lines": [ + { + "bbox": [ + 132, + 411, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 411, + 482, + 468 + ], + "type": "text", + "content": "Fig. 5: Qualitative Results for KITTI-C. As the SOTA self-supervised MDE methods, MonoDepth and MonoVit excel on the KITTI dataset, but struggle to accurately infer depth information from various types of damaged images in out-of-distribution (OoD) domains. With our SCAT framework, their depth estimation performance in challenging cross-domain scenarios can be substantially improved." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 481, + 482, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 481, + 482, + 554 + ], + "spans": [ + { + "bbox": [ + 132, + 481, + 482, + 554 + ], + "type": "text", + "content": "expected, our method demonstrates a significant advantage on the mean corruption error (mCE) and mean resilience rate (mRR) scores. Especially for 18 common out-of-distribution corruption types, with all baseline models, our proposed SCAT method outperforms the competitors in almost all of metrics, providing a general framework to enhance cross-domain generalization capability for existing self-supervised monocular depth estimation methods." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 572, + 365, + 585 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 572, + 365, + 585 + ], + "spans": [ + { + "bbox": [ + 132, + 572, + 365, + 585 + ], + "type": "text", + "content": "5.4 Results on Cross-Domain Generalization" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 594, + 482, + 666 + ], + "type": "text", + "content": "To demonstrate the generalization capability of our SCAT over real cross-domain scenarios, like foggy and nighttime samples, we also conduct the experiments on Foggy CityScapes dataset, DrivingStereo dataset and NuScenes dataset, which are shown in Fig. 6 and Fig. 7. As expected, our SCAT generates depth estimation results with more reliable and clearer contours in all weather conditions. By contrast, vanilla MonoDepth2 and MonoVit suffer from significant performance" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 119, + 478, + 220 + ], + "blocks": [ + { + "bbox": [ + 136, + 119, + 478, + 220 + ], + "lines": [ + { + "bbox": [ + 136, + 119, + 478, + 220 + ], + "spans": [ + { + "bbox": [ + 136, + 119, + 478, + 220 + ], + "type": "image", + "image_path": "a03730ef370f22dccf5165181772f98891c599019b64a422b3ca78f4f6a207d3.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 232, + 482, + 255 + ], + "lines": [ + { + "bbox": [ + 131, + 232, + 482, + 255 + ], + "spans": [ + { + "bbox": [ + 131, + 232, + 482, + 255 + ], + "type": "text", + "content": "Fig. 6: Qualitative Results for Foggy CityScapes. We conduct testing to assess SCAT's generalization on a synthetically generated dataset with more severe fog." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 133, + 286, + 479, + 376 + ], + "blocks": [ + { + "bbox": [ + 132, + 265, + 480, + 277 + ], + "lines": [ + { + "bbox": [ + 132, + 265, + 480, + 277 + ], + "spans": [ + { + "bbox": [ + 132, + 265, + 480, + 277 + ], + "type": "text", + "content": "Table 4: Quantitative Results for the Real-World NuScenes-Night Dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 286, + 479, + 376 + ], + "lines": [ + { + "bbox": [ + 133, + 286, + 479, + 376 + ], + "spans": [ + { + "bbox": [ + 133, + 286, + 479, + 376 + ], + "type": "table", + "html": "
DatasetMethodAbs Rel↓Sq Rel↓RMSE↓RMSE log↓δ < 1.25 ↑δ < 1.252↑δ < 1.253↑
NuScenes-Night [15]Monodepth2 [7]0.3976.20614.5690.5680.3780.6500.794
+ SCAT (ours)0.3555.11212.4360.4990.3920.6710.863
HR-Depth [9]0.4616.63315.0280.6220.3010.5710.749
+ SCAT (ours)0.4245.80213.6850.6020.3240.5840.827
CADepth [8]0.4215.94914.5090.5930.3310.6130.776
+ SCAT (ours)0.3875.52411.9620.5770.3650.6550.834
MonoVit [11]0.3134.14312.2520.4550.4850.7360.858
+ SCAT (ours)0.2844.12610.1390.4010.4970.7520.879
Robust-Depth* [19]0.2764.07510.4700.3800.6070.8190.912
+ SCAT (ours)0.2633.9739.4620.3710.6090.8190.913
", + "image_path": "4ee06ecdc0294e65ce8ba2c725e5ad5fb2308a12117b4f3cfcd112f96f343cf2.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 389, + 482, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 482, + 473 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 482, + 473 + ], + "type": "text", + "content": "decline when handling real and unknown scenarios, in particular in the rainy and nighttime scenes. Notably, it can be observed that our SCAT method can effectively recover challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real-world cross-domain scenarios. Quantitative results are summarized in Tab. 4, showing that our proposed SCAT framework gains better performance on all metrics with multiple state-of-the-art methods. More results are shown in the Appendix." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 489, + 239, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 489, + 239, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 489, + 239, + 502 + ], + "type": "text", + "content": "5.5 Ablation Study" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 508, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 508, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 508, + 482, + 616 + ], + "type": "text", + "content": "Effectiveness of Individual Components. To improve the stability and generalization capability of self-supervised MDE methods, SCAT presents a stabilized adversarial training framework with Conflict Gradient Surgery (CGS), progressively integrating the adversarial-perturbed data to prevent gradient conflict. In addition, we propose a scaling depth network named SDN, reducing the perturbation sensitivity of the UNet-based depth network. We perform an ablation study to investigate the effectiveness of individual components in SCAT and the results are shown in Tab. 5. Individually, each of these contributes significantly to the improvement of generalization performance across multiple datasets." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Impact of LSCs Coefficient " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\kappa" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ". In our experiments, the value of the long skip connections (LSCs) coefficient " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\kappa" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " was set to balance the self-supervised MDE model's stability and generalization capability, which defaults to 0.7 in the paper. To assess the perturbation sensitivity of UNet-based depth networks, we" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 112, + 478, + 198 + ], + "blocks": [ + { + "bbox": [ + 133, + 112, + 478, + 198 + ], + "lines": [ + { + "bbox": [ + 133, + 112, + 478, + 198 + ], + "spans": [ + { + "bbox": [ + 133, + 112, + 478, + 198 + ], + "type": "image", + "image_path": "6c36c9768b8a32089eb261a692a407294ab3c3ae4318b2f9c507a2d122de8572.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 208, + 482, + 242 + ], + "lines": [ + { + "bbox": [ + 130, + 208, + 482, + 242 + ], + "spans": [ + { + "bbox": [ + 130, + 208, + 482, + 242 + ], + "type": "text", + "content": "Fig. 7: Qualitative results on Driving Stereo and Nuscenes. It can be observed that our SCAT method effectively recovers challenging distant objects such as vehicles or streetlights when dealing with complex and unknown images in real scenarios." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 148, + 324, + 332, + 370 + ], + "blocks": [ + { + "bbox": [ + 148, + 324, + 332, + 370 + ], + "lines": [ + { + "bbox": [ + 148, + 324, + 332, + 370 + ], + "spans": [ + { + "bbox": [ + 148, + 324, + 332, + 370 + ], + "type": "table", + "html": "
CGSSDNKITTIKITTI-C
Abs Relδ < 1.25Abs Relδ < 1.25
0.1210.8620.1930.734
✓0.1170.8690.1740.752
✓0.1180.8650.1790.748
✓✓0.1160.8770.1650.762
", + "image_path": "89914bd137d1fa0e367bb7f1faa275b56be3239cd88780168a722ea5e605d1af.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 153, + 370, + 326, + 380 + ], + "lines": [ + { + "bbox": [ + 153, + 370, + 326, + 380 + ], + "spans": [ + { + "bbox": [ + 153, + 370, + 326, + 380 + ], + "type": "text", + "content": "Table 5: Effect of individual components." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "text" + }, + { + "type": "image", + "bbox": [ + 350, + 312, + 477, + 371 + ], + "blocks": [ + { + "bbox": [ + 130, + 245, + 482, + 294 + ], + "lines": [ + { + "bbox": [ + 130, + 245, + 482, + 294 + ], + "spans": [ + { + "bbox": [ + 130, + 245, + 482, + 294 + ], + "type": "text", + "content": "compare the model performance over constant values of " + }, + { + "bbox": [ + 130, + 245, + 482, + 294 + ], + "type": "inline_equation", + "content": "\\kappa \\in \\{0.1, 0.3, 0.7, 1.0\\}" + }, + { + "bbox": [ + 130, + 245, + 482, + 294 + ], + "type": "text", + "content": ". Fig. 1 shows that when " + }, + { + "bbox": [ + 130, + 245, + 482, + 294 + ], + "type": "inline_equation", + "content": "\\kappa" + }, + { + "bbox": [ + 130, + 245, + 482, + 294 + ], + "type": "text", + "content": " is set to 0.7, our scaling depth network has extraordinary generalization capability to unseen scenarios in the KITTI-C dataset while keeping the depth estimation performance of the KITTI dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 350, + 312, + 477, + 371 + ], + "lines": [ + { + "bbox": [ + 350, + 312, + 477, + 371 + ], + "spans": [ + { + "bbox": [ + 350, + 312, + 477, + 371 + ], + "type": "image", + "image_path": "187a5c83bff5433065600879278b1ebd942a66ecdf478e635d2350daa4ae1e42.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 337, + 371, + 488, + 381 + ], + "lines": [ + { + "bbox": [ + 337, + 371, + 488, + 381 + ], + "spans": [ + { + "bbox": [ + 337, + 371, + 488, + 381 + ], + "type": "text", + "content": "Fig. 8: Effect of the scaling factor " + }, + { + "bbox": [ + 337, + 371, + 488, + 381 + ], + "type": "inline_equation", + "content": "\\kappa" + }, + { + "bbox": [ + 337, + 371, + 488, + 381 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 389, + 220, + 402 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 389, + 220, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 389, + 220, + 402 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 415, + 482, + 571 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 482, + 571 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 482, + 571 + ], + "type": "text", + "content": "In this work, we initially illuminate the main causes of training collapse under adversarial data augmentation: (i) inherent sensitivity in the UNet-alike depth network and (ii) dual optimization conflict caused by over-regularization. To address these issues, we propose SCAT, a simple yet effective model-agnostic framework that leverages stabilized adversarial training to bootstrap the generalization capability of self-supervised MDE models in unseen scenarios. Extensive experiments on a variety of scenarios from five benchmarks validate the merits of our adversarial data augmentation, which endows the model with universal generalization capability and better training efficiency. In addition, empirical results indicate that each component in our method and the utilization of targeted reconstruction are crucial for generalization performance gain. Our exploration may inspire more researchers to dig into the great potential of utilizing adversarial training in self-supervised MDE." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 590, + 217, + 602 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 590, + 217, + 602 + ], + "spans": [ + { + "bbox": [ + 132, + 590, + 217, + 602 + ], + "type": "text", + "content": "7 Limitation" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 617, + 480, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 480, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 480, + 640 + ], + "type": "text", + "content": "In the future, we would like to explore iterative adversarial data augmentation [34], which is a more promising parameter-efficient solution." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "Acknowledgement. The research was supported by the National Natural Science Foundation of China (U23B2009)." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 141, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 142, + 141, + 481, + 175 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 141, + 481, + 175 + ], + "spans": [ + { + "bbox": [ + 142, + 141, + 481, + 175 + ], + "type": "text", + "content": "1. A. Geiger, P. Lenz, and R. Urtasun, \"Are we ready for autonomous driving? the kitti vision benchmark suite,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2012, pp. 3354-3361." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 142, + 176, + 481, + 207 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 176, + 481, + 207 + ], + "spans": [ + { + "bbox": [ + 142, + 176, + 481, + 207 + ], + "type": "text", + "content": "2. C. Sakaridis, D. Dai, and L. Van Gool, \"Semantic foggy scene understanding with synthetic data,\" International Journal of Computer Vision, vol. 126, no. 9, pp. 973-992, 2018." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 142, + 209, + 481, + 241 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 209, + 481, + 241 + ], + "spans": [ + { + "bbox": [ + 142, + 209, + 481, + 241 + ], + "type": "text", + "content": "3. D. Eigen, C. Puhrsch, and R. Fergus, \"Depth map prediction from a single image using a multi-scale deep network,\" in Advances in Neural Information Processing System (NeurIPS), 2014." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 142, + 243, + 481, + 275 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 243, + 481, + 275 + ], + "spans": [ + { + "bbox": [ + 142, + 243, + 481, + 275 + ], + "type": "text", + "content": "4. R. Garg, B. V. Kumar, G. Carneiro, and I. Reid, \"Unsupervised cnn for single view depth estimation: Geometry to the rescue,\" in European Conference on Computer Vision (ECCV), 2016, pp. 740-756." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 142, + 276, + 481, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 276, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 142, + 276, + 481, + 308 + ], + "type": "text", + "content": "5. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, \"Unsupervised learning of depth and ego-motion from video,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 1851-1858." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 309, + 481, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 309, + 481, + 342 + ], + "spans": [ + { + "bbox": [ + 142, + 309, + 481, + 342 + ], + "type": "text", + "content": "6. C. Godard, O. M. Aodha, and G. J. Brostow, \"Unsupervised monocular depth estimation with left-right consistency,\" in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 270-279." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 142, + 343, + 481, + 375 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 343, + 481, + 375 + ], + "spans": [ + { + "bbox": [ + 142, + 343, + 481, + 375 + ], + "type": "text", + "content": "7. C. Godard, O. M. Aodha, M. Firman, and G. J. Brostow, \"Digging into self-supervised monocular depth prediction,\" in IEEE/CVF International Conference on Computer Vision (ICCV), 2019, pp. 3828-3838." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 142, + 376, + 481, + 409 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 376, + 481, + 409 + ], + "spans": [ + { + "bbox": [ + 142, + 376, + 481, + 409 + ], + "type": "text", + "content": "8. J. Yan, H. Zhao, P. Bu, and Y. Jin, \"Channel-wise attention-based network for self-supervised monocular depth estimation,\" in IEEE International Conference on 3D Vision (3DV), 2021, pp. 464-473." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 410, + 481, + 442 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 410, + 481, + 442 + ], + "spans": [ + { + "bbox": [ + 142, + 410, + 481, + 442 + ], + "type": "text", + "content": "9. X. Lyu, L. Liu, M. Wang, X. Kong, L. Liu, Y. Liu, X. Chen, and Y. Yuan, “Hr-depth: High resolution self-supervised monocular depth estimation,” in AAAI Conference on Artificial Intelligence (AAAI), 2021, pp. 2294-2301." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 443, + 481, + 474 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 443, + 481, + 474 + ], + "spans": [ + { + "bbox": [ + 138, + 443, + 481, + 474 + ], + "type": "text", + "content": "10. H. Zhou, D. Greenwood, and S. Taylor, \"Self-supervised monocular depth estimation with internal feature fusion,\" in *British Machine Vision Conference (BMVC)*, 2021." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 475, + 481, + 518 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 475, + 481, + 518 + ], + "spans": [ + { + "bbox": [ + 138, + 475, + 481, + 518 + ], + "type": "text", + "content": "11. C. Zhao, Y. Zhang, M. Poggi, F. Tosi, X. Guo, Z. Zhu, G. Huang, Y. Tang, and S. Mattoccia, \"MonoVit: Self-supervised monocular depth estimation with a vision transformer,\" in IEEE International Conference on 3D Vision (3DV), 2022." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 520, + 481, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 520, + 481, + 553 + ], + "spans": [ + { + "bbox": [ + 138, + 520, + 481, + 553 + ], + "type": "text", + "content": "12. S. Pillai, R. Ambru, and A. Gaidon, \"Superdepth: Self-supervised, super-resolved monocular depth estimation,\" in IEEE International Conference on Robotics and Automation (ICRA), 2019, pp. 9250-9256." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 554, + 481, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 554, + 481, + 586 + ], + "spans": [ + { + "bbox": [ + 138, + 554, + 481, + 586 + ], + "type": "text", + "content": "13. H. Zhao, O. Gallo, I. Frosio, and J. Kautz, \"Loss functions for image restoration with neural networks,\" IEEE Transactions on Computational Imaging (TCI), vol. 3, no. 1, pp. 47-57, 2016." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 587, + 481, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 587, + 481, + 631 + ], + "spans": [ + { + "bbox": [ + 138, + 587, + 481, + 631 + ], + "type": "text", + "content": "14. L. Wang, X. Sun, W. Jiang, and J. Yang, \"Drivingstereo: A large-scale dataset for stereo matching in autonomous driving scenarios,\" in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2018, pp. 5554-5561." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "type": "text", + "content": "15. H. Caesar, V. Bankiti, A. H. Lang, S. Vora, V. E. Liong, Q. Xu, A. Krishnan, Y. Pan, G. Baldan, and O. Beijbom, \"nuscenes: A multimodal dataset for autonomous driving,\" arXiv preprint arXiv:1903.11027, 2019." + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 664 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "type": "text", + "content": "16. Y. Wang, W.-L. Chao, D. Garg, B. Hariharan, M. Campbell, and K. Q. Weinberger, \"Pseudo-lidar from visual depth estimation: Bridging the gap in 3d object detection for autonomous driving,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 8445-8453." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 160, + 481, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 160, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 138, + 160, + 481, + 192 + ], + "type": "text", + "content": "17. X. Dong, M. A. Garratt, S. G. Anavatti, and H. A. Abbass, \"Towards real-time monocular depth estimation for robotics: A survey,\" IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 10, pp. 16940-16961, 2022." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 192, + 481, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 192, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 138, + 192, + 481, + 224 + ], + "type": "text", + "content": "18. Z. Cheng, J. Liang, G. Tao, D. Liu, and X. Zhang, \"Adversarial training of self-supervised monocular depth estimation against physical-world attacks,\" arXiv preprint arXiv:2301.13487, 2023." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 224, + 481, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 224, + 481, + 246 + ], + "spans": [ + { + "bbox": [ + 138, + 224, + 481, + 246 + ], + "type": "text", + "content": "19. K. Saunders, G. Vogiatzis, and L. Manso, \"Self-supervised monocular depth estimation: Let's talk about the weather,\" arXiv preprint arXiv:2307.08357, 2023." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 246, + 481, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 246, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 138, + 246, + 481, + 289 + ], + "type": "text", + "content": "20. J. Hu, M. Ozay, Y. Zhang, and T. Okatani, \"Revisiting single image depth estimation: Toward higher resolution maps with accurate object boundaries,\" in 2019 IEEE winter conference on applications of computer vision (WACV). IEEE, 2019, pp. 1043-1051." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 289, + 481, + 321 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 289, + 481, + 321 + ], + "spans": [ + { + "bbox": [ + 138, + 289, + 481, + 321 + ], + "type": "text", + "content": "21. F. Aleotti, F. Tosi, M. Poggi, and S. Mattoccia, \"Generative adversarial networks for unsupervised monocular depth prediction,\" in Proceedings of the European conference on computer vision (ECCV) workshops, 2018, pp. 0-0." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 321, + 481, + 353 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 321, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 138, + 321, + 481, + 353 + ], + "type": "text", + "content": "22. Y. Luo, J. Ren, M. Lin, J. Pang, W. Sun, H. Li, and L. Lin, \"Single view stereo matching,\" in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 155-163." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 353, + 481, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 353, + 481, + 385 + ], + "spans": [ + { + "bbox": [ + 138, + 353, + 481, + 385 + ], + "type": "text", + "content": "23. T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, \"Unsupervised learning of depth and ego-motion from video,\" in Proceedings of the IEEE conference on computer vision and pattern recognition, 2017, pp. 1851-1858." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 385, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 385, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 385, + 481, + 418 + ], + "type": "text", + "content": "24. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, \"Image quality assessment: from error visibility to structural similarity,\" IEEE transactions on image processing, vol. 13, no. 4, pp. 600-612, 2004." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 418, + 481, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 418, + 481, + 449 + ], + "spans": [ + { + "bbox": [ + 138, + 418, + 481, + 449 + ], + "type": "text", + "content": "25. J. Bae, S. Moon, and S. Im, \"Deep digging into the generalization of self-supervised monocular depth estimation,\" in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 1, 2023, pp. 187-196." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 449, + 481, + 502 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 481, + 502 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 481, + 502 + ], + "type": "text", + "content": "26. E. Rusak, L. Schott, R. S. Zimmermann, J. Bitterwolf, O. Bringmann, M. Bethge, and W. Brendel, \"A simple way to make neural networks robust against diverse image corruptions,\" in Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part III 16. Springer, 2020, pp. 53-69." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 502, + 481, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 481, + 536 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 481, + 536 + ], + "type": "text", + "content": "27. L. Kong, S. Xie, H. Hu, L. X. Ng, B. Cotterreau, and W. T. Ooi, \"Robodepth: Robust out-of-distribution depth estimation under corruptions,\" Advances in Neural Information Processing Systems, vol. 36, 2024." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 536, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 536, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 536, + 481, + 578 + ], + "type": "text", + "content": "28. L. Liu, X. Song, M. Wang, Y. Liu, and L. Zhang, \"Self-supervised monocular depth estimation for all day images using domain separation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12737-12746." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 578, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 481, + 621 + ], + "type": "text", + "content": "29. A. Gurram, A. F. Tuna, F. Shen, O. Urfalioglu, and A. M. López, \"Monocular depth estimation through virtual-world supervision and real-world sfm self-supervision,\" IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 8, pp. 12738-12751, 2021." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 621, + 481, + 664 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 481, + 664 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 481, + 664 + ], + "type": "text", + "content": "30. J. Wu, C. Zhang, X. Zhang, Z. Zhang, W. T. Freeman, and J. B. Tenenbaum, \"Learning shape priors for single-view 3d completion and reconstruction,\" in Proceedings of the European Conference on Computer Vision (ECCV), 2018, pp. 646-662." + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 481, + 148 + ], + "type": "text", + "content": "31. T. Yu, S. Kumar, A. Gupta, S. Levine, K. Hausman, and C. Finn, \"Gradient surgery for multi-task learning,\" Advances in Neural Information Processing Systems, vol. 33, pp. 5824-5836, 2020." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 149, + 481, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 149, + 481, + 204 + ], + "spans": [ + { + "bbox": [ + 138, + 149, + 481, + 204 + ], + "type": "text", + "content": "32. O. Ronneberger, P. Fischer, and T. Brox, \"U-net: Convolutional networks for biomedical image segmentation,\" in Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. Springer, 2015, pp. 234-241." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 205, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 205, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 138, + 205, + 481, + 226 + ], + "type": "text", + "content": "33. P. Liashchynskyi and P. Liashchynskyi, \"Grid search, random search, genetic algorithm: a big comparison for nas,\" arXiv preprint arXiv:1912.06059, 2019." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 227, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 227, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 138, + 227, + 481, + 270 + ], + "type": "text", + "content": "34. S. Liu, Z. Chen, W. Li, J. Zhu, J. Wang, W. Zhang, and Z. Gan, \"Efficient universal shuffle attack for visual object tracking,\" in ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2022, pp. 2739-2743." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 271, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 271, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 138, + 271, + 481, + 303 + ], + "type": "text", + "content": "35. Z. Huang, P. Zhou, S. Yan, and L. Lin, \"Scalelong: Towards more stable training of diffusion model via scaling network long skip connection,\" Advances in Neural Information Processing Systems, vol. 36, 2024." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 304, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 304, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 138, + 304, + 481, + 335 + ], + "type": "text", + "content": "36. L. Rice, A. Bair, H. Zhang, and J. Z. Kolter, \"Robustness between the worst and average case,\" Advances in Neural Information Processing Systems, vol. 34, pp. 27840-27851, 2021." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 138, + 336, + 481, + 369 + ], + "type": "text", + "content": "37. Y. Wang, Y. Ba, H. C. Zhang, H. Zhang, A. Kadambi, S. Soatto, A. Wong, and C.-J. Hsieh, “Evaluating worst case adversarial weather perturbations robustness,” in NeurIPS ML Safety Workshop, 2022." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 369, + 481, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 369, + 481, + 402 + ], + "spans": [ + { + "bbox": [ + 138, + 369, + 481, + 402 + ], + "type": "text", + "content": "38. C. Godard, O. Mac Aodha, M. Firman, and G. J. Brostow, \"Digging into self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF international conference on computer vision, 2019, pp. 3828-3838." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 403, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 481, + 435 + ], + "type": "text", + "content": "39. M. Poggi, F. Tosi, and S. Mattoccia, \"Learning monocular depth estimation with unsupervised trinocular assumptions,\" in 2018 International conference on 3d vision (3DV). IEEE, 2018, pp. 324-333." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 435, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 435, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 435, + 481, + 479 + ], + "type": "text", + "content": "40. M. Ramamonjisoa, Y. Du, and V. Lepetit, \"Predicting sharp and accurate occlusion boundaries in monocular depth estimation using displacement fields,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14648-14657." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 479, + 481, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 479, + 481, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 479, + 481, + 512 + ], + "type": "text", + "content": "41. A. Wong and S. Soatto, \"Bilateral cyclic constraint and adaptive regularization for unsupervised monocular depth prediction,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 5644-5653." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 512, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 512, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 512, + 481, + 544 + ], + "type": "text", + "content": "42. S. Zhang, J. Zhang, and D. Tao, \"Towards scale-aware, robust, and generalizable unsupervised monocular depth estimation by integrating imu motion dynamics,\" in European Conference on Computer Vision. Springer, 2022, pp. 143-160." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 545, + 481, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 481, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 481, + 577 + ], + "type": "text", + "content": "43. W. Han, J. Yin, X. Jin, X. Dai, and J. Shen, \"Brnet: Exploring comprehensive features for monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 586-602." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 577, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 481, + 610 + ], + "type": "text", + "content": "44. Z. Zhou and Q. Dong, \"Self-distilled feature aggregation for self-supervised monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 709-726." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 611, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 481, + 643 + ], + "type": "text", + "content": "45. D. Garg, Y. Wang, B. Hariharan, M. Campbell, K. Q. Weinberger, and W.-L. Chao, \"Wasserstein distances for stereo disparity estimation,\" Advances in Neural Information Processing Systems, vol. 33, pp. 22 517-22 529, 2020." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 481, + 665 + ], + "type": "text", + "content": "46. X. Chen, R. Zhang, J. Jiang, Y. Wang, G. Li, and T. H. Li, \"Self-supervised monocular depth estimation: Solving the edge-fattening problem,\" in Proceedings" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 153, + 116, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 116, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 153, + 116, + 481, + 138 + ], + "type": "text", + "content": "of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2023, pp. 5776-5786." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 481, + 172 + ], + "type": "text", + "content": "47. J. Ma, X. Lei, N. Liu, X. Zhao, and S. Pu, \"Towards comprehensive representation enhancement in semantics-guided self-supervised monocular depth estimation,\" in European Conference on Computer Vision. Springer, 2022, pp. 304-321." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 173, + 481, + 206 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 173, + 481, + 206 + ], + "spans": [ + { + "bbox": [ + 138, + 173, + 481, + 206 + ], + "type": "text", + "content": "48. S. Zhu, G. Brazil, and X. Liu, \"The edge of depth: Explicit constraints between segmentation and depth,\" in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2020, pp. 13116-13125." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 207, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 207, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 138, + 207, + 481, + 251 + ], + "type": "text", + "content": "49. P.-Y. Chen, A. H. Liu, Y.-C. Liu, and Y.-C. F. Wang, \"Towards scene understanding: Unsupervised monocular depth estimation with semantic-aware representation,\" in Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition, 2019, pp. 2624-2632." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 251, + 481, + 295 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 481, + 295 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 481, + 295 + ], + "type": "text", + "content": "50. H. Jung, E. Park, and S. Yoo, \"Fine-grained semantics-aware representation enhancement for self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 12642-12652." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 296, + 481, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 296, + 481, + 329 + ], + "spans": [ + { + "bbox": [ + 138, + 296, + 481, + 329 + ], + "type": "text", + "content": "51. R. Peng, R. Wang, Y. Lai, L. Tang, and Y. Cai, \"Excavating the potential capacity of self-supervised monocular depth estimation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 15560-15569." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 330, + 481, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 330, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 138, + 330, + 481, + 373 + ], + "type": "text", + "content": "52. K. Wang, Z. Zhang, Z. Yan, X. Li, B. Xu, J. Li, and J. Yang, \"Regularizing nighttime weirdness: Efficient self-supervised monocular depth estimation in the dark,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 16055-16064." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 374, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 374, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 374, + 481, + 407 + ], + "type": "text", + "content": "53. M. Vankadari, S. Golodetz, S. Garg, S. Shin, A. Markham, and N. Trigoni, \"When the sun goes down: Repairing photometric losses for all-day depth estimation,\" in Conference on Robot Learning. PMLR, 2023, pp. 1992-2003." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 408, + 481, + 451 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 408, + 481, + 451 + ], + "spans": [ + { + "bbox": [ + 138, + 408, + 481, + 451 + ], + "type": "text", + "content": "54. J. Spencer, R. Bowden, and S. Hadfield, \"Defeat-net: General monocular depth via simultaneous unsupervised representation learning,\" in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020, pp. 14402-14413." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 452, + 481, + 496 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 452, + 481, + 496 + ], + "spans": [ + { + "bbox": [ + 138, + 452, + 481, + 496 + ], + "type": "text", + "content": "55. A. Atapour-Abarghouei and T. P. Breckon, \"Real-time monocular depth estimation using synthetic data with domain adaptation via image style transfer,\" in Proceedings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 2800-2810." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 497, + 481, + 530 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 497, + 481, + 530 + ], + "spans": [ + { + "bbox": [ + 138, + 497, + 481, + 530 + ], + "type": "text", + "content": "56. C. Zhao, Y. Tang, and Q. Sun, \"Unsupervised monocular depth estimation in highly complex environments,\" IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 6, no. 5, pp. 1237-1246, 2022." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 531, + 481, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 531, + 481, + 563 + ], + "spans": [ + { + "bbox": [ + 138, + 531, + 481, + 563 + ], + "type": "text", + "content": "57. N. Carlini and D. Wagner, \"Towards evaluating the robustness of neural networks,\" in 2017 IEEE symposium on security and privacy (sp). IEEE, 2017, pp. 39-57." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 563, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 563, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 138, + 563, + 481, + 597 + ], + "type": "text", + "content": "58. H. Zhang and J. Wang, \"Towards adversarially robust object detection,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2019, pp. 421-430." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 598, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 598, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 598, + 481, + 632 + ], + "type": "text", + "content": "59. X. Chen, C. Xie, M. Tan, L. Zhang, C.-J. Hsieh, and B. Gong, \"Robust and accurate object detection via adversarial learning,\" in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2021, pp. 16622-16631." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 481, + 665 + ], + "type": "text", + "content": "60. X. Xu, H. Zhao, and J. Jia, \"Dynamic divide-and-conquer adversarial training for robust semantic segmentation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2021, pp. 7486-7495." + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 206, + 100 + ], + "type": "text", + "content": "Yao et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 136, + 116, + 482, + 402 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 136, + 116, + 482, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 116, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 136, + 116, + 482, + 148 + ], + "type": "text", + "content": "61. W.-C. Hung, Y.-H. Tsai, Y.-T. Liou, Y.-Y. Lin, and M.-H. Yang, “Adversarial learning for semi-supervised semantic segmentation,” arXiv preprint arXiv:1802.07934, 2018." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 137, + 149, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 149, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 137, + 149, + 482, + 182 + ], + "type": "text", + "content": "62. Y. Carmon, A. Raghunathan, L. Schmidt, J. C. Duchi, and P. S. Liang, \"Unlabeled data improves adversarial robustness,\" Advances in neural information processing systems, vol. 32, 2019." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 137, + 182, + 482, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 182, + 482, + 215 + ], + "spans": [ + { + "bbox": [ + 137, + 182, + 482, + 215 + ], + "type": "text", + "content": "63. J.-B. Alayrac, J. Uesato, P.-S. Huang, A. Fawzi, R. Stanforth, and P. Kohli, \"Are labels required for improving adversarial robustness?\" Advances in Neural Information Processing Systems, vol. 32, 2019." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 216, + 482, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 216, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 137, + 216, + 482, + 247 + ], + "type": "text", + "content": "64. C.-H. Ho and N. Nvasconcelos, \"Contrastive learning with adversarial examples,\" Advances in Neural Information Processing Systems, vol. 33, pp. 17081-17093, 2020." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 248, + 482, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 248, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 138, + 248, + 482, + 281 + ], + "type": "text", + "content": "65. M. Kim, J. Tack, and S. J. Hwang, \"Adversarial self-supervised contrastive learning,\" Advances in Neural Information Processing Systems, vol. 33, pp. 2983-2994, 2020." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 281, + 482, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 281, + 482, + 335 + ], + "spans": [ + { + "bbox": [ + 138, + 281, + 482, + 335 + ], + "type": "text", + "content": "66. S. Liu, Z. Chen, Y. Liu, Y. Wang, D. Yang, Z. Zhao, Z. Zhou, X. Yi, W. Li, W. Zhang et al., \"Improving generalization in visual reinforcement learning via conflict-aware gradient agreement augmentation,\" in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023, pp. 23436-23446." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 336, + 482, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 336, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 138, + 336, + 482, + 402 + ], + "type": "text", + "content": "67. L. Kong, Y. Niu, S. Xie, H. Hu, L. X. Ng, B. R. Cottereau, D. Zhao, L. Zhang, H. Wang, W. T. Ooi, R. Zhu, Z. Song, L. Liu, T. Zhang, J. Yu, M. Jing, P. Li, X. Qi, C. Jin, Y. Chen, J. Hou, J. Zhang, Z. Kan, Q. Ling, L. Peng, M. Li, D. Xu, C. Yang, Y. Yao, G. Wu, J. Kuai, X. Liu, J. Jiang, J. Huang, B. Li, J. Chen, S. Zhang, S. Ao, Z. Li, R. Chen, H. Luo, F. Zhao, and J. Yu, \"The robodepth challenge: Methods and advancements towards robust depth estimation,\" 2023." + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 421, + 91, + 447, + 100 + ], + "type": "text", + "content": "SCAT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_content_list.json b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..b7f08af222a6033a3b64b9721966d7a5020f0179 --- /dev/null +++ b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_content_list.json @@ -0,0 +1,1834 @@ +[ + { + "type": "text", + "text": "Improving Feature Stability during Upsampling – Spectral Artifacts and the Importance of Spatial Context", + "text_level": 1, + "bbox": [ + 215, + 141, + 787, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Shashank Agnihotri1, Julia Grabinski1,2,3, and Margret Keuper1,4", + "bbox": [ + 267, + 210, + 733, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Data and Web Science Group, University of Mannheim", + "bbox": [ + 328, + 238, + 671, + 252 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 Fraunhofer ITWM, Kaiserslautern", + "bbox": [ + 392, + 253, + 611, + 266 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{3}$ Institute for Machine Learning and Analytics (IMLA), Offenburg University", + "bbox": [ + 267, + 267, + 733, + 280 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "4 Max-Planck-Institute for Informatics, Saarland Informatics Campus", + "bbox": [ + 292, + 281, + 709, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{shashank.agnihotri, julia.grabinski, keuper}@uni-mannheim.de", + "bbox": [ + 241, + 296, + 761, + 309 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Pixel-wise predictions are required in a wide variety of tasks such as image restoration, image segmentation, or disparity estimation. Common models involve several stages of data resampling, in which the resolution of feature maps is first reduced to aggregate information and then increased to generate a high-resolution output. Previous works have shown that resampling operations are subject to artifacts such as aliasing. During downsampling, aliases have been shown to compromise the prediction stability of image classifiers. During upsampling, they have been leveraged to detect generated content. Yet, the effect of aliases during upsampling has not yet been discussed w.r.t. the stability and robustness of pixel-wise predictions. While falling under the same term (aliasing), the challenges for correct upsampling in neural networks differ significantly from those during downsampling: when downsampling, some high frequencies can not be correctly represented and have to be removed to avoid aliases. However, when upsampling for pixel-wise predictions, we actually require the model to restore such high frequencies that can not be encoded in lower resolutions. The application of findings from signal processing is therefore a necessary but not a sufficient condition to achieve the desirable output. In contrast, we find that the availability of large spatial context during upsampling allows to provide stable, high-quality pixel-wise predictions, even when fully learning all filter weights.", + "bbox": [ + 261, + 345, + 743, + 609 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 657, + 356, + 672 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Most computer vision models addressing perceptual tasks such as image restoration [16, 89], semantic segmentation [7, 35, 70], optical flow estimation [20, 43, 83] and disparity estimation [6, 11, 50] in realistic scenarios are required to behave in a stable way, at least under mild corruptions. Interestingly, for the slightly simpler task of image classification, recent progress has shown that a model's robustness does not only depend on its training but also on its architecture [29-32, 41, 42, 45, 58, 91, 95]. Specifically, aliasing, i.e. spectral artifacts that emerge from naive image resampling, have shown to compromise prediction stability, in particular in the context of classical convolutional models [33, 37, 48, 52, 69, 80, 82] which predominantly use small filter kernels in combination with severe data aggregation during downsampling [30, 58]. Principled cures", + "bbox": [ + 212, + 689, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/fc525b5856a7973b4e68e320d1436301dac33a9726dd012f3b72c7765fd29229.jpg", + "image_caption": [ + "Fig. 1: Image restoration example using NAFNet [16] variants on GoPro [63]. Upsampling techniques like Pixel Shuffle [77] (first row) and transposed convolution [22] using small learnable filters $(2\\times 2$ or $3\\times 3)$ (second row) are used by most prior art. Both lead to spectral artifacts for which the model needs to compensate. The clean (in-domain) restored images look appealing - while adversaries (here 5-step PGD [49] attack) can leverage aliases such that artifacts become easily visible. When observed in the frequency domain, they manifest as repeating peaks all over the spectra. Based on sampling theoretic considerations, we propose Large Context Transposed Convolutions $(7\\times 7$ or larger) (bottom row). They significantly increase the model's stability during upsampling, observable in the restored image under attack and the frequency spectrum." + ], + "image_footnote": [], + "bbox": [ + 225, + 142, + 777, + 386 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "usually refer to basic concepts from signal processing such as anti-aliasing by blurring before downsampling [29, 91]. While this discussion on classifier (i.e. encoder) networks is insightful, it does not provide a recipe to counteract aliases emerging during upsampling for pixel-wise prediction tasks such as image restoration. Specifically, naive upsampling introduces artifacts in the feature representation, such as grid artifacts [4, 65] or ringing artifacts [62]. As shown in Fig. 1, these artifacts, an inherent property of inadequate upsampling (refer Sec. 3) are not always visible to the human eye, are accentuated under adversarial attack such that they can also be seen with a human eye. We leverage this effect in our analysis. When observed in the frequency domain, these artifacts are apparent as multiple peaks, i.e. aliases of the original data.", + "bbox": [ + 212, + 547, + 787, + 700 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "While for downsampling, signal processing laws basically prescribe which part of the information can be retained at lower resolutions without aliases [76], \"correct\", alias-free upsampling can not restore the original high-resolution information. Thus, learning to upsample feature maps such that the feature stability is not harmed is of paramount importance. In this paper, we therefore first provide a synopsis of different aliases that emerge from different upsampling techniques. Based on this work, we propose a simple, transposed convolution-based upsampling block. We study our proposed operation in the context of various models, from image restoration [16,89] over semantic segmentation [70] to disparity estimation [50].", + "bbox": [ + 212, + 704, + 789, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 379, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our main contributions can be summarized as follows:", + "bbox": [ + 238, + 146, + 599, + 160 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Motivated by sampling theory [76], we study upsampling in models for diverse pixel-wise prediction tasks. We find that the availability of large kernels in transposed convolutions helps the feature stability and significantly improves over standard, small kernel transposed convolutions as well as pixel shuffle [77].", + "- While large kernels are required to allow for reduced aliasing and to provide the necessary spatial context for increasing the resolution, additional small kernels can add details and remain useful.", + "- We provide empirical evidence for our findings on diverse architectures (including vision transformer-based architectures) and downstream tasks such as image restoration, semantic segmentation, and depth estimation.", + "- We show empirically that our proposed upsampling operation complements other feature stability-increasing approaches like adversarial training." + ], + "bbox": [ + 225, + 172, + 785, + 352 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 376, + 366, + 391 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In the following, we discuss recent challenges for neural networks regarding artifacts introduced by spatial sampling methods [4, 62, 65]. Further, we review related work on the most recent use of large kernels in CNNs. Finally, we provide an overview of adversarial attacks to gauge the quality of representations learned by a network.", + "bbox": [ + 212, + 407, + 785, + 468 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Spectral Artifacts. Several prior works have studied the effect of downsampling operations on model robustness, e.g. [2, 29, 30, 42, 46, 91, 95]. Inspired by [30], [29] propose an aliasing-free downsampling in the frequency domain which translates to an infinitely large blurring filter before downsampling in the spatial domain. Thus, for image classification, using large filter kernels has been shown to remove artifacts from downsampled representations and it leads to favorable robustness in all these cases [30, 42, 46]. However, all these works focus on improving the properties of encoder networks.", + "bbox": [ + 212, + 483, + 785, + 589 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Models that use transposed convolutions in their decoders5 are widely used for tasks like image generation [27, 68] or segmentation [7, 55, 64, 70]. However, in simple transposed convolutions, the convolution kernels overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Further, image resampling can lead to aliases that become visible as ringing artifacts [76]. In the context of deepFake detection, image generation, and deblurring, several works analyzed [14, 18, 21, 23, 38, 44, 47] and improved upsampling techniques [26, 46, 78, 87] to reduce visual artifacts.", + "bbox": [ + 212, + 589, + 785, + 724 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Some architectures like PSPNet [93], PSANet [94], or PSMNet [15] simply use bilinear interpolation operations for upsampling the feature representations. While this reduces grid artifacts as bilinear interpolation smoothens out the feature maps, it also has major drawbacks as they sample incorrectly. These new artifacts are sometimes visible as overly smooth predictions, in particular, apparent in the PSPNet segmentation masks. The segmentation masks over-smoothen around edges and often miss out on thin", + "bbox": [ + 212, + 724, + 785, + 816 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_footnote", + "text": "For more details on Transposed Convolutions refer to [22].", + "bbox": [ + 220, + 824, + 580, + 839 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "details (predictions showing these are included in the Appendix B.4). This observation already shows why image encoding and decoding have to be considered separately when it comes to sampling artifacts. While during encoding, artifacts can be reduced by blurring, the main purpose of decoder networks is reducing blur in many applications, to create fine-granular, pixel-wise accurate outputs, which our approach facilitates.", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Large Kernels. For image classification, [54] showed that using large kernels like $7 \\times 7$ in the CNN convolution layer can outperform self-attention based vision transformers [53,84]. In [17,33,35,51,66], the receptive field of the convolution operations was further expanded by using larger kernels, up to $31 \\times 31$ and $51 \\times 51$ . These larger receptive fields provide more context to the encoder, leading to better performance on classification, segmentation, or object detection tasks. [17,51] use a small kernel in parallel to capture the local context along with the global context. In contrast to these works, which are limited to exploring increased context only during encoding, we investigate if larger kernels can benefit upsampling when considering pixel-wise prediction tasks such as image restoration or segmentation.", + "bbox": [ + 212, + 234, + 789, + 387 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Adversarial Attacks. The purpose of adversarial attacks is to reveal neural networks' weaknesses [3, 30, 74, 81] by perturbing pixel values in the input image [12, 28, 49]. These perturbations should lead to a false prediction even though the changes are hardly visible [28, 61, 81]. Especially attacks that have access to the network's architecture and weights, so-called white-box attacks, are a common approach to analyzing weaknesses within the networks' structure [12, 28]. They employ the gradient of the network to optimize the perturbation, which is bounded within an $\\epsilon$ -ball of the original image, i.e. $\\epsilon$ defines the strength of the attack. Most adversarial attacks are proposed to attack classification networks like the one-step Fast Gradient Sign Method (FGSM) [28] or the multi-step Projected Gradient Descent (PGD) attack [49]. However, they can be adapted to other tasks as e.g. in [59, 67, 88]. Furthermore, there are dedicated methods like SegPGD [34] for attacks on semantic segmentation models or PCFA [74] and [71, 73] for optical flow models and CosPGD [3] and others [72] for other pixel-wise prediction tasks. We evaluate the stability of upsampled features using adversarial attacks such as PGD and CosPGD for image restoration and FGSM and SegPGD for segmentation.", + "bbox": [ + 212, + 388, + 789, + 618 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Spectral Upsampling Artifacts and How They Can Be Reduced", + "text_level": 1, + "bbox": [ + 212, + 638, + 774, + 657 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Following, we first theoretically review artifacts that are caused during upsampling from a signal processing aspect. We start by describing the spectral artifacts [76] induced by the bed of nails interpolation, similar to the discussion in [23], and then extend the theoretical analysis to further upsampling schemes. Second, we derive from this analysis two hypotheses for the prediction stability of encoder-decoder networks, depending on their architecture. These hypotheses will motivate the remainder of the manuscript.", + "bbox": [ + 212, + 669, + 787, + 758 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Consider, w.l.o.g., a one-dimensional signal $I$ and its discrete Fourier Transform $\\mathcal{F}(I)$ with $k$ being the index of discrete frequencies", + "bbox": [ + 212, + 758, + 787, + 791 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {F} (I) _ {k} = \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j k}{N}} \\cdot I _ {j}, \\quad \\mathrm {f o r} \\quad k = 0, \\ldots , N - 1.\n$$\n", + "text_format": "latex", + "bbox": [ + 316, + 800, + 684, + 843 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 380, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "During decoding, we need to upsample the spatial resolution of $I$ to get $I^{\\mathrm{up}}$ . For example for an upsampling factor of 2 (often used in DNNs [1, 16, 19, 82, 89]) we have for $\\bar{k} = 0,\\dots ,2N - 1$", + "bbox": [ + 212, + 146, + 787, + 191 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {F} (I) _ {\\bar {k}} ^ {\\mathrm {u p}} = \\sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{2 \\cdot N}} \\cdot I _ {j} ^ {\\mathrm {u p}} = \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {2 \\cdot j \\bar {k}}{2 \\cdot N}} I _ {j} + \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {(2 j + 1) \\bar {k}}{2 \\cdot N}} \\bar {I} _ {j}, \\quad (1)\n$$\n", + "text_format": "latex", + "bbox": [ + 240, + 199, + 785, + 244 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\bar{I}_j = 0$ in bed of nails interpolation. Therefore, the second term in (1) can be dropped and the first term resembles the original $\\mathcal{F}(I)$ . Equivalently, we can rewrite Eq. (1), for $\\bar{I}_j = 0$ , using a Dirac impulse comb as", + "bbox": [ + 212, + 251, + 787, + 299 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n(1) = \\sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j k}{2 \\cdot N}} \\cdot \\sum_ {t = - \\infty} ^ {\\infty} I _ {j} ^ {\\mathrm {u p}} \\cdot \\delta (j - 2 t). \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 349, + 305, + 785, + 349 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "If we now apply the pointwise multiplication with the Dirac impulse comb as convolution in the Fourier domain (assuming periodicity) [25], it is", + "bbox": [ + 214, + 356, + 785, + 388 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {F} (I) _ {\\bar {k}} ^ {\\mathrm {u p}} = \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\left(\\sum_ {j = - \\infty} ^ {\\infty} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{2 N}} I _ {j} ^ {\\mathrm {u p}}\\right) \\left(\\bar {k} - \\frac {t}{2}\\right) \\tag {3} \\\\ \\stackrel {(1)} {=} \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\left(\\sum_ {j = - \\infty} ^ {\\infty} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{N}} \\cdot I _ {j}\\right) \\left(\\bar {k} - \\frac {t}{2}\\right) = \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\mathcal {F} (I) _ {\\bar {k}} \\left(\\bar {k} - \\frac {t}{2}\\right). \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 225, + 393, + 785, + 494 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We can see that such upsampling creates high-frequency replica of the signal at $\\frac{t}{2}$ for $t$ in $-\\infty, \\ldots, \\infty$ in $\\mathcal{F}(I)^{\\mathrm{up}}$ and spatial frequencies apparent beyond array positions $\\frac{N}{2}$ will be impacted by spectral artifacts if no appropriate countermeasures are taken.", + "bbox": [ + 212, + 501, + 787, + 547 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A standard countermeasure is interpolation of the inserted values with $\\bar{I}_j = \\frac{I_{j-1} + I_j}{2}$ for linear interpolation in Eq. (1). Linear interpolation (and in consequence bi-linear interpolation in 2D signals) corresponds to a convolution with a triangular impulse with width 2, which can be represented as the convolution of two rectangle functions with width 1. Accordingly, the Fourier response for frequency $\\ell$ , $\\mathcal{F}_{\\ell}$ of the triangular impulse is a squared sinc function ( $\\mathrm{sinc}^2(\\ell)$ ) with $\\mathrm{sinc}(\\ell) = \\frac{\\sin(\\pi\\ell)}{\\pi\\ell}$ . Since the output signal after interpolation is still discrete, i.e. sampled with sampling rate $\\frac{1}{2}$ , a replica of the interpolation function, the $\\mathrm{sinc}^2$ function, will appear with rate 2 in the resulting spectrum (see also Fig. 2). The resulting interpolated signal is not optimal for several reasons. Most importantly, the spectrum of the interpolation function is not flat although the estimated values appear overly smooth (see Fig. 3.). This is arguably suboptimal for, for example, image restoration or segmentation tasks, where fine structural details are supposed to emerge in the upsampled data.", + "bbox": [ + 212, + 547, + 787, + 748 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Note that, in Eq. (1), pixel shuffle [77] will set $\\bar{I}_j$ to completely unrelated values of a different feature map channel, leading to a highly non-smooth signal with frequencies at the band limit. The resulting issues in the spectrum are similar to the ones caused by the bed of nails interpolation. These spectral artifacts can be visually observed in Fig. 3.", + "bbox": [ + 212, + 750, + 787, + 809 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Therefore, in transposed convolutions, the interpolation function is not fixed to a predefined smoothing kernel but learned so that the resulting signal can represent fine", + "bbox": [ + 212, + 810, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 732, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/483e9d42478417ee8dd5447a498aa1d40ffa1d2dca849cc3b3588f5bcd44a1d0.jpg", + "image_caption": [ + "Fig. 2: (Left) Linear interpolation (pink) of the samples (green) causes aliases. (Right) Optimal signal reconstruction (pink) is achieved by sinc interpolation. In practice our spatial context is limited and the interpolation function is discrete. Yet, increasing the kernel size enables the approximation of larger sinc-like structures." + ], + "image_footnote": [], + "bbox": [ + 230, + 143, + 774, + 224 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/131fb698a5f2f20d136fa1ba201f0a4c7784df97c4c9ae933458aa67e779c933.jpg", + "image_caption": [ + "Artifact-free Ground Truth" + ], + "image_footnote": [], + "bbox": [ + 222, + 300, + 362, + 362 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/ff83c23c0545801c77fe48c0de1423717dd199dc6047b0b67c2a3a78a98d87f5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 362, + 301, + 500, + 362 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/1417d635400ce59198447e04e524c461d8e3b9ee573820434920b11bc34ea9fb.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 501, + 301, + 640, + 362 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/8bc7bde927c34a1c449e02bf7095282f035ae7739407716c41977877d5d1c605.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 640, + 301, + 779, + 362 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/3b5b7e6266bade45b5fa3ffe7892e025bc4c2e87a3c9541872adca6b39c7e7da.jpg", + "image_caption": [ + "Zoomed-in Ground Truth", + "Fig.3: An image from GoPro [63] downsampled with $3 \\times 3$ MaxPooling and then upsampled using various upsampling techniques. The resulting artifacts are compared on zoomed-in red box regions for better visibility. Bilinear interpolation causes over-smoothing. Bicubic interpolation causes overestimation along image boundaries while Pixel Shuffle and Nearest Neighbor cause strong grid artifacts along with discoloration. Small kernel transposed convolutions cause grid artifacts, however, on increasing kernel size we start getting better upsampling." + ], + "image_footnote": [], + "bbox": [ + 222, + 375, + 361, + 436 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/140c721446f8e5fd4c2fe4fe30fa7ff7bfd848cd3b3d2f324274d4ada07bde0e.jpg", + "image_caption": [ + "Bicubic Interpolation", + "Bilinear Interpolation" + ], + "image_footnote": [], + "bbox": [ + 362, + 375, + 500, + 436 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/b7e51fd72f78d07a889a1aade61571a581f12e7b186c121243e9288cec4eebed.jpg", + "image_caption": [ + "Nearest Neighbor Interpolation", + "Pixel Shuffle" + ], + "image_footnote": [], + "bbox": [ + 501, + 375, + 638, + 436 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/139e3393d8d96d79b8ddd38c42af954d449490b13cdd157a30677618b1678de9.jpg", + "image_caption": [ + "Small(3×3) Transposed Conv", + "Large(7×7+3×3) Transposed Conv" + ], + "image_footnote": [], + "bbox": [ + 640, + 375, + 779, + 436 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "details after the initial bed of nails interpolation and potentially learn to add fine details. One issue is that the learned convolution kernels may overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Besides this rather technical aspect, transposed convolutions, if sufficiently large (thus also containing more context), could in principle learn to approximate correct upsampling functions. This can be understood when again looking at the Fourier representation. When interpolating, we want to increase the signal array size so that all the original information is preserved and the model can easily learn additional details. Such upsampling to preserve the information from the original low-resolution data is most easily achieved by transforming the signal to the Fourier domain, then padding the missing high-frequency parts with zeros and transforming the resulting array back to the spatial domain [79]. In the Fourier domain, this padding operation can be understood as a point-wise multiplication of the desired full spectrum with a rectangle function with width $N$ (denoted $\\operatorname{rect}_N$ ). Conversely, this operation corresponds to a convolution with $\\mathcal{F}^{-1}(\\operatorname{rect}_N) = \\frac{1}{N}\\operatorname{sinc}(xN)$ in the spatial domain. While the sinc function drops off as $x$ increases, it never drops to zero. When applied for interpolation, its crests and the troughs cancel out the aliasing to a large", + "bbox": [ + 212, + 566, + 787, + 843 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 379, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "extent as shown in Fig. 2. Thus, in order to allow the approximation of the optimal interpolation function, the kernel size in transposed convolutions has to be chosen as large as possible. This is, however, at odds with the \"learnability\" of suitable filter weights. Note that for pixel-wise predictions, models not only need to correctly interpolate, but they also need to \"fill in\" the missing details, which requires global as well as local context. Therefore, we expect a trade-off on the kernel size of transposed convolutions, where larger kernels improve the stability of the upsampled features and thus can reduce artifacts while the absolute prediction quality can suffer from very large learnable kernels. Sufficiently but not overly large kernels provide sufficient spatial context and are appropriate to allow for the model to learn when to blur and when to preserve/sharpen upsampled features. We illustrate this in Fig. 12 in Appendix C.4.", + "bbox": [ + 212, + 146, + 787, + 311 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "From this theoretical analysis of common upsampling methods, we derive the following hypotheses that we deem relevant for encoder-decoder architectures:", + "bbox": [ + 212, + 311, + 785, + 342 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Hypothesis 1 (H1): Large Context Transposed Convolutions (LCTC) i.e. Large kernels in transposed convolution operations provide more context and reduce spectral artifacts and can therefore be leveraged by the network to facilitate better and more robust pixel-wise predictions.", + "bbox": [ + 212, + 353, + 787, + 412 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Hypothesis 2 (H2, Null Hypothesis): To leverage prediction context and reduce spectral artifacts, it is crucial to increase the size of the transposed convolution kernels (upsample using large filters). Increasing the size of normal (i.e. non-upsampling) decoder convolutions does not have this effect.", + "bbox": [ + 212, + 422, + 787, + 484 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In the following, we show the proposed, simple, and principled architecture changes that allow for studying the above hypotheses and improving robustness by improving feature stability.", + "bbox": [ + 212, + 496, + 787, + 542 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 Upsampling using Large Context Transposed Convolutions", + "text_level": 1, + "bbox": [ + 212, + 565, + 741, + 583 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Driven by the observations on upsampling artifacts, we investigate the advantage of larger kernel sizes during upsampling, for applications such as semantic segmentation or disparity estimation. Therefore, we keep the models' encoder part fixed and exclusively change operations in the architecture of the decoder part of the model. There, we have two design choices: Upsampling - The kernel size for the transposed convolution operations that learn upsampling, and Decoder Block - The kernel size in the convolution operations of blocks that learn to decode the features. Probing options for Upsampling works towards proving H1 while a combination of both options proves H2, i.e. shows that a pure increase in the decoder parameters does not have the desired effect. This is considered in our ablation study in Sec. 5.2.", + "bbox": [ + 212, + 598, + 787, + 748 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Figure 4 summarizes the studied options for an abstract encoder-decoder architecture like [70]. The model decoder is depicted in the green box. Operations that we consider to be executed along the red upwards arrows (Upsampling Operators) are detailed in the top right part of the figure (operations a) to c). Operations that we consider to be executed along the blue sideways arrows (Decoder Building Blocks) are depicted in the bottom right (operations d) to f).", + "bbox": [ + 212, + 750, + 787, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 125 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/8ae4127bb897c8164f06fb8a67b2e5dfc414961de90c1ee810dc481e3ef85fb6.jpg", + "image_caption": [ + "Fig. 4: Abstract representation of an encoder-decoder architecture. While for different tasks, the implementation of the model encoder varies (including transformer-based encoders), our study focuses on the model decoder (in green). The backbone for the decoder is commonly a ResNet-like structure for feature extraction [7, 70], additionally we also used a ConvNeXt-like [54] structure. We investigate variants of different upsampling operations (the operations along the red arrows in the decoder) for fixed decoder blocks. We consider, as a probe for H1, the baseline transposed deconvolution (a) in the top right), and for LCTC an increased convolution kernel size (b) in the top right), and an increased convolution kernel with a second path using a small convolution kernel (c) in the top right). To test whether the plain increase in parameters is responsible for improved results (zero hypotheses, H2), we also ablate on the increase of convolution kernel size in the decoder block (operations along the blue arrows in the green block), as shown on the bottom right. We consider the common ResNet-like decoder building block structure (in d)) and two ConvNext-like structured backbones for the decoder building block in e) and f), where f) has an additional small convolution applied in parallel, analog to c)." + ], + "image_footnote": [], + "bbox": [ + 212, + 141, + 787, + 366 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Model Details. Here, we provide details on the studied models. All implementation details are given in the Appendix A.", + "bbox": [ + 212, + 593, + 787, + 625 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Transposed Convolution Kernels for Upsampling. The upsampling operation is typically performed with small kernels ( $2 \\times 2$ or $3 \\times 3$ ) in the transposed convolution operations [8, 13, 70]. We aim to increase the spatial context during upsampling and to reduce grid artifacts. Thus we use Large Context Transposed Convolutions (LCTC). We either use $7 \\times 7$ transposed convolutions or $11 \\times 11$ transposed convolutions with a parallel $3 \\times 3$ transposed convolution. Adding a parallel $3 \\times 3$ kernel is motivated by [17], as large convolution kernels tend to lose local context, and thus adding a parallel small kernel helps to overcome this potential drawback (see Appendix B.3).", + "bbox": [ + 212, + 626, + 787, + 747 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Decoder Building Blocks. To verify that the measurable effects are due to the improved upsampling and not due to merely increasing the decoder capacity, we ablate on decoder convolution blocks similar to convolution blocks used in the ConvNeXt [54] basic block for encoding. While the standard ConvNeXt block uses a $7 \\times 7$ depth-wise convolution, we consider $7 \\times 7$ and $11 \\times 11$ group-wise convolutions, followed by layers present in a ConvNeXt basic block to analyze the importance of the receptive field within the block.", + "bbox": [ + 212, + 750, + 789, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 379, + 128 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/74f907f2794a09d199fedc840d5cfd6e1f259f50db4214e6f01a95188bbb11a1.jpg", + "image_caption": [ + "Fig. 5: NAFNet, as proposed, uses Pixel Shuffle for upsampling. We modify only the upsampling operations to transposed convolution with kernel size $(3\\times 3)$ and LCTC (Ours) for comparisons. We observe, for example, under a 10-step PGD attack with $\\epsilon \\approx \\frac{8}{255}$ our proposed H1 gains validity. More examples for [16, 89] using different attacks and budgets are in Appendix C.3." + ], + "image_footnote": [], + "bbox": [ + 215, + 143, + 782, + 272 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/3c545fc0c8c4a3ac09c02baed44a52c67d3fd83caaa685e177b41b4e32b30388.jpg", + "table_caption": [ + "Table 1: Comparison of performances of different upsampling methods in SotA Image Restoration Networks on the GoPro dataset. The architectures use Pixel Shuffle for Upsampling, we propose replacing the Pixel Shuffle with Large Context Transposed Convolutions (LCTC). We report additional results using adversarial training in Tab. 15. Note, that some trade-off between clean performance and robustness is expected [85,90]." + ], + "table_footnote": [], + "table_body": "
NetworkUpsampling MethodTest AccuracyCosPGD (ε ≈ 8/255) attack iterationsPGD (ε ≈ 8/255) attack iterations
PSNRSSIM5102051020
PSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIM
RestomerPixel Shuffle31.990.963511.360.32369.050.22427.590.154811.410.32569.040.22347.580.1543
Transposed Conv 3×39.680.0958.240.04528.530.06288.440.06317.660.04647.720.05778.640.0527
LCTC: 7×7 + 3 × 3 (Ours)29.510.933713.690.418611.530.313610.160.248413.690.418311.540.313710.160.2483
LCTC: 11×11 + 3×3 (Ours)29.440.932414.650.425112.830.343811.480.2914.650.425312.840.344511.480.2893
NAFNetPixel Shuffle32.870.96068.670.22646.680.11275.810.061710.270.31798.660.22825.950.0714
Transposed Conv 3×331.020.94226.150.03325.950.02585.870.02336.150.03325.950.02585.870.0234
LCTC: 7×7 + 3 × 3 (Ours)31.120.943014.540.482711.050.32209.060.221314.530.482311.030.32019.080.2224
LCTC: 11×11 + 3×3 (Ours)30.770.939214.340.449211.410.32449.540.241114.340.4511.40.32369.550.2398
", + "bbox": [ + 217, + 439, + 782, + 542 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Figure 4 (bottom right e) and f)) shows the structure of a ConvNeXt-style building block used in our work. First, a group-wise convolution is performed, followed by a LayerNorm [5] and two $1 \\times 1$ convolutions which, similar to [54], creates an inverted bottleneck by first increasing the channel dimension and after a GELU [40] activation compressing the channel dimension again. We consider the ResNet-style building block (Figure 4, d)), with $3 \\times 3$ convolution, yet without skip connection, as our baseline when studying this architectural design choice.", + "bbox": [ + 212, + 563, + 784, + 667 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Experiments", + "text_level": 1, + "bbox": [ + 215, + 696, + 356, + 714 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In the following, we evaluate the effect of the considered upsampling operators in several applications. We start by evaluating the effect on the upsampled feature stability of recent state-of-the-art (SotA) image restoration models [16,89], then provide results on semantic segmentation using more generic convolutional architectures that allow us to provide compulsory ablations. Last, we show that our results also extend to disparity estimation [50]. We provide details on the used adversarial attacks, datasets, reported metrics, and other experimental details in Appendix A.", + "bbox": [ + 212, + 734, + 782, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 732, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In all cases, we observe that Large Context Transposed Convolutions (LCTC) improve the results of the respective pixel-wise prediction task in terms of stability under attack, showing that H1 holds. Further, our extensive ablation on image segmentation shows that increasing the convolution kernel in the decoder building blocks does not have this beneficial effect, providing experimental evidence for our hypothesis H2 and confirming the impact of spectral artifacts on pixel-wise predictions.", + "bbox": [ + 212, + 146, + 787, + 238 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.1 Image Restoration", + "text_level": 1, + "bbox": [ + 214, + 258, + 387, + 273 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "For image restoration, we consider the Vision Transformer-based Restormer [89] and NAFNet [16]. Both originally use the Pixel Shuffle [77] for upsampling. Here, we compare the reconstructions from these proposed architectures to their variants using the proposed operators with large transposed convolution filters. We use the same metrics as [16, 89], Peak Signal-to-Noise Ratio (PSNR), and structural similarity index measure (SSIM) [86]. We perform our experiments on the GoPro [63] image deblurring dataset, following the experimental setup in [1].", + "bbox": [ + 212, + 282, + 787, + 388 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results on Image Restoration. We first consider qualitative results on NAFNet [16] in Figure 5 and Restormer [89] in Fig. 10, Fig. 11(in Appendix C.3), where we see that the proposed upsampling operators allow for visually good results in image deblurring on clean data (similar to pixel shuffle). Yet, in contrast to pixel shuffle and the baseline small transposed convolution filters, the proposed Large Context Transposed Convolutions (LCTC) significantly reduces artifacts that arise on attacked images (in this case, 10-step PGD with $\\epsilon \\approx \\frac{8}{255}$ ). attacks with varying numbers of steps.", + "bbox": [ + 212, + 401, + 787, + 507 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In Table 1, we report the average PSNR and SSIM values of the reconstructed images from the GoPro test set. These results confirm that at filter size $3 \\times 3$ , the performance of the transposed convolution variant of both the considered networks is significantly worse than the originally proposed Pixel Shuffle variant, justifying the community's extensive use of Pixel Shuffle. However, we observe on increasing context by increasing the kernel size to $7 \\times 7$ that the performance of the transposed convolution variants significantly improves, especially making the networks more stable when facing adversarial attacks. This boost in performance is further accentuated by increasing the kernel size to $11 \\times 11$ (both with parallel small kernels). These results provide evidence for Hypothesis 1.", + "bbox": [ + 212, + 508, + 787, + 657 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Note that the slightly reduced performance on clean images, seen in Table 1, is expected to some degree: here, we only investigate sampling in the decoder, while pixel unshuffle is used in the encoder, potentially causing a mismatch. Further, previous works have shown that there exists a trade-off between adversarial robustness and clean performance [85, 90]. However, we do not observe this trade-off for matching encoder-decoder architectures, e.g. in semantic segmentation.", + "bbox": [ + 212, + 659, + 787, + 750 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.2 Semantic Segmentation", + "text_level": 1, + "bbox": [ + 214, + 770, + 421, + 786 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "As baseline architecture for semantic segmentation, we consider a UNet-like architecture [70] with encoder backbone layers from ConvNeXt [54] (see Appendix B.2 on the choice of encoder). This generic architecture facilitates providing a thorough ablation", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 380, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/af608a39e596ab204fd4874b23d60acd8a111dbc4351255f8e9ae34eb99585ae.jpg", + "image_caption": [ + "Fig. 6: A comparison of semantic segmentation mask predictions for the shown input images. The row labeled \"Prediction Difference\" shows the difference in predictions between the baseline model and the model with Large Context Transposed Convolutions $(11\\times 11 + 3\\times 3$ kernels). On white pixels, both models agree. Red pixels indicate that the baseline model predicts correctly but our modified model predicts incorrectly. Green pixels indicate that our modified model predicts correctly but the baseline does not. The ground truth segmentation boundaries are drawn in black. Our modification improves the segmentation result along object boundaries, which can be attributed to spectral artifact removal, but also in more extended regions, where the context plays a more crucial role." + ], + "image_footnote": [], + "bbox": [ + 235, + 142, + 767, + 226 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/c072c6b6e93558b534d8f2a8bc38ca9565e1b94317dc916814397ecab60aa7ea.jpg", + "table_caption": [ + "Table 2: Semantic Segmentation performance on the PASCAL VOC2012 validation set for UNet with ConvNeXt encoder, and the baseline UNet decoder (see Figure 4) with differently sized kernels in transposed convolution for feature map upscaling while keeping rest of the architecture fixed. Additional results are provided in Tab. 7 and Tab. 8 in Appendix B.1." + ], + "table_footnote": [], + "table_body": "
TransposedConvolution KernelsCleanTest AccuracymIoU mAcc allAccFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations320mIoU mAcc allAcc
mIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAcc
2×2 (baseline)78.3486.8995.1553.5470.9686.0847.0265.4182.7823.0646.51
LCTC: 7×7 (Ours)78.9288.0695.2356.0274.1386.4549.2468.8982.8726.5353.05
LCTC: 11×11 + 3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6427.4953.08
7.0823.30
", + "bbox": [ + 217, + 436, + 787, + 506 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "on all considered blocks in the decoder network. Our experiments are conducted on the PASCAL VOC 2012 dataset [24]. We report the mean Intersection over Union (mIoU) of the predicted and ground truth segmentation mask, the mean accuracy over all pixels (mAcc), and the mean accuracy over all classes (allAcc).", + "bbox": [ + 212, + 527, + 787, + 588 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Results on Semantic Segmentation. We first discuss the results for different upsampling operations. The remaining architecture is kept identical, with ResNet-style building blocks in the decoder, throughout these experiments. The clean test accuracies are shown in Table 2. We see that as we increase the kernel size of the transposed convolution layers, there is a slight increase across all three evaluation metrics. Moreover, Figure 6 visually demonstrates that, as we increase the size of the kernels in transposed convolution from $2 \\times 2$ (baseline) to $11 \\times 11$ , the segmentations of the thin end and protrusions, for example, in the wing of the aircraft sample image are improving. The baseline model with small transposed convolution kernels could not predict these details. As hypothesized in H1, we observe that increasing the context can reduce spectral artifacts caused when representation and images are upsampled using LCTC.", + "bbox": [ + 212, + 612, + 787, + 777 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Further, in Table 2, we evaluate the performance of the segmentation models against FGSM [28] and the multi-step attack SegPGD [34] adversarial attacks for the indicated $\\epsilon$ values. As expected, with the increasing intensity of the attack, the performance of all models drops. Yet, even at high attack intensities, the larger kernels perform better than", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/523c55e01c314fb1bf307aba439061ba4e6ee29a0a07212f9c9027f969204fec.jpg", + "table_caption": [ + "Table 3: Adversarially trained models using FGSM ( $\\epsilon \\approx \\frac{8}{255}$ ) from Table 2 tested against SegPGD adversarial attacks ( $\\epsilon \\approx \\frac{8}{255}$ ) on UNet with ConvNeXt encoder and decoder with different sized kernels in the transposed convolution for upsampling, while keeping rest of the architecture identical. See Tab. 10 in Appendix B.6 for more evaluations including PGD training." + ], + "table_footnote": [], + "table_body": "
TransposedConvolution KernelsCleanTest DatamIoU mAcc allAccSegPGD attack iterations
3mIoU mAcc allAcc20mIoU mAcc allAcc
\\( 2 \\times 2 \\)78.57 86.68 95.2326.59 48.99 67.717.6 24.06 31.37
LCTC: \\( 7 \\times 7 \\) (Ours)78.41 86.22 95.2028.11 53.39 66.308.36 28.54 28.13
LCTC: \\( 11 \\times 11 + 3 \\times 3 \\) (Ours)79.57 88.1 95.330.37 55.54 68.39.4 29.79 32.37
", + "bbox": [ + 263, + 212, + 738, + 287 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/998ce861d929dea4cd1a14c4ae12fe47b40d1a04136fc66ab963927d988ec4c6.jpg", + "table_caption": [ + "Table 4: Empirical evaluations for H2 using a UNet with ConvNeXt encoder. We observe that across different-sized kernels in transposed convolution, for a fixed kernel size, increasing the context in the decoder building blocks by using larger kernels causes performance deterioration. These observations for image decoding contrast the findings on image encoding by [17, 51, 54]." + ], + "table_footnote": [], + "table_body": "
Transposed Convolution KernelsDecoder Building Block StyleTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255) attack iterations
mIoU / mAcc / allAcc1/255mIoU / mAcc / allAcc8/255mIoU / mAcc / allAcc3mIoU / mAcc / allAcc20mIoU / mAcc / allAcc
2×2ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.34 / 86.89 / 95.1577.17 / 86.86 / 94.8177.17 / 86.86 / 94.8153.54 / 70.96 / 86.0849.98 / 72.22 / 83.9347.34 / 67.72 / 83.3447.02 / 65.41 / 82.7842.04 / 64.86 / 79.0837.91 / 57.79 / 78.2123.06 / 46.51 / 60.0417.94 / 44.81 / 47.9613.97 / 35.82 / 45.685.54 / 18.79 / 23.723.20 / 14.73 / 9.812.21 / 10.75 / 5.297.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 7×7 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.92 / 88.06 / 95.2377.57 / 87.04 / 94.9277.99 / 87.86 / 94.9656.02 / 74.13 / 86.4552.93 / 72.18 / 85.5151.61 / 73.01 / 84.8549.24 / 68.89 / 82.8744.89 / 65.71 / 80.7443.93 / 66.22 / 80.7326.53 / 53.05 / 61.1617.64 / 43.32 / 47.8017.07 / 42.30 / 48.787.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 11×11+3×3 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×379.33 / 87.81 / 95.4178.32 / 86.98 / 95.0977.42 / 86.24 / 94.9458.04 / 74.93 / 87.8053.31 / 72.45 / 86.1654.48 / 72.53 / 86.2551.25 / 69.31 / 84.6444.89 / 65.18 / 82.0346.67 / 66.59 / 82.2927.49 / 53.08 / 64.1316.14 / 40.65 / 50.3918.76 / 44.60 / 51.497.08 / 23.30 / 26.821.93 / 9.35 / 3.902.31 / 8.70 / 3.50
", + "bbox": [ + 217, + 368, + 789, + 479 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "the small ones, and we see a trend of improvement in performance as we increase the kernel size, providing more evidence for Hypothesis 1.", + "bbox": [ + 212, + 501, + 785, + 532 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation Study. In the following, we first consider the effects of additional adversarial training, then ablate on the impact of other decoder building blocks and the filter size. Variations of the model encoder are ablated in the Appendix B.2, the impact of using small parallel kernels in addition to large kernels is ablated and discussed in Appendix B.3, and competing upsampling techniques are ablated in Appendix B.5.", + "bbox": [ + 212, + 542, + 787, + 619 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Adversarial Training. In Table 3, we report results for FGSM adversarially trained models under SegPGD attack, with attacks as in Table 2. While the overall performance under attack is improved as expected, the trend of LCTC providing better results persists. More results for FGSM attack and SegPGD attacks with different numbers of iterations are given in Tab. 7 and Tab. 8 in the Appendix. In Table 15, we additionally evaluate image restoration models under adversarial training.", + "bbox": [ + 212, + 623, + 787, + 715 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Change in the decoder backbone architecture. While all previous experiments focused on the upsampling using transposed convolutions in the decoder, we now evaluate the influence of the convolutional kernel size within the decoder which does not upsample (see Section 4). For these experiments, we use a UNet-like architecture with a ConvNeXt backbone in the encoder and the PASCAL VOC 2012 dataset.", + "bbox": [ + 212, + 719, + 787, + 794 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Table 4 we observe, for a fixed transposed convolution kernel size, as we increase the size of the convolution kernel in the decoder building blocks, the performance of the model decreases. This phenomenon extends to the performance of the architectures", + "bbox": [ + 212, + 795, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 380, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/dba1adb58b2552621269cd5d4b2e02ad925b4e8a13364b15b7671c41de68c821.jpg", + "image_caption": [ + "Fig. 7: Performance comparison on PASCAL VOC2012 using UNet with ConvNeXt encoder for different LCTC sizes from $2 \\times 2$ (small) to $31 \\times 31$ (LCTC) kernels. All, besides the baseline with $2 \\times 2$ and $3 \\times 3$ , have a parallel $3 \\times 3$ kernel, as shown in Figure 4 (bottom left). For the decoder building block backbone, a ResNet Style $3 \\times 3$ style is used. See Tab. 9 for the values." + ], + "image_footnote": [], + "bbox": [ + 300, + 142, + 450, + 229 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/62797189d1f74cada56500a124cdedd2f32546ae38f256affa1543d634fa3817.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 452, + 142, + 702, + 229 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/f33c22591c5f9a969a2006ddcf7ab8a1a4158ba4ce30f9b6adc406605e639df7.jpg", + "table_caption": [ + "Table 5: Comparison of performances of different upsampling methods in the UNet-like architecture. All architectures use the baseline (ConvNeXt) encoder and $3 \\times 3$ convolution kernels in the decoder block. Please refer to Table 13 in Appendix B.5 for more evaluations and discussion, including those with ConvNeXt style $7 \\times 7 + 3 \\times 3$ Convolution kernels in the decoder blocks." + ], + "table_footnote": [], + "table_body": "
Upsampling MethodTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations
mIoU mAcc allAcc1/255mIoU mAcc allAcc8/255mIoU mAcc allAcc5mIoU mAcc allAcc20mIoU mAcc allAcc
Pixel Shuffle78.5487.3295.1853.8271.5885.8846.6765.0381.7115.0638.8541.716.6923.4324.05
Nearest Neighbour Interpolation78.4088.1695.0952.6873.5184.5546.0867.9680.2215.3444.5336.217.6527.8920.48
Transposed Convolution 2×278.4586.6695.2053.7670.6286.3247.3364.5883.1614.4335.5045.305.5418.7923.72
LCTC: 11×11+3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6418.1543.5149.367.0823.3026.82
", + "bbox": [ + 222, + 377, + 781, + 448 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "under adversarial attacks, showing that a mere increase in parameters in the model decoder does not have a positive effect on model performance or on its stability. This proves the validity of hypothesis H2. An explanation for this phenomenon could be that we only need to increase context during the actual upsampling step, increasing context in the consequent decoder building blocks has a negligible effect on the quality of representations learned. However, the increase in the number of parameters makes the architecture more susceptible to adversarial attacks.", + "bbox": [ + 212, + 459, + 787, + 565 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablation on filter size saturation. After proving H1 one could argue that networks will consistently improve with increased kernel size for Large Context Transposed Convolutions. Hence, we test larger kernel sizes of $15 \\times 15$ , $17 \\times 17$ , $19 \\times 19$ and $31 \\times 31$ kernels. Yet, as seen in Figure 7, the effect of the kernel size appears to saturate: the performance after $13 \\times 13$ and the performance of $31 \\times 31$ kernels is not better than for $11 \\times 11$ kernels. Yet, they are significantly better than the baseline's performance.", + "bbox": [ + 212, + 566, + 787, + 657 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ablation on different Upsampling Methods. Following, we compare different upsampling techniques thus justifying our advocacy for using LCTC instead of other upsampling techniques like interpolation and pixel shuffle in the real world.", + "bbox": [ + 212, + 659, + 787, + 703 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We report the comparison in Table 5 and observe that both Pixel shuffle and Nearest Neighbor interpolation perform better than the usually used Transposed Convolution with a $2 \\times 2$ kernel size. However, as we increase the kernel size for Transposed Convolution to $11 \\times 11$ with a $3 \\times 3$ small kernel in parallel, we observe that LCTC is strictly outperforming Pixel Shuffle, on both clean unperturbed images and under adversarial attacks, across all metrics used. Large Context Transposed Convolutions are either outperforming or performing at par with Nearest Neighbor interpolation. Thus we demonstrate the superior clean and adversarial performance of Large Context Transposed Convolutions operation over other commonly used techniques.", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 732, + 130 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5.3 Disparity Estimation", + "text_level": 1, + "bbox": [ + 215, + 146, + 401, + 161 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "To show that the observations extend from image restorations and segmentation to other tasks, we conduct additional experiments for disparity estimation. We consider the STTR-light [50] architecture, built from STTR, which is a recent state-of-the-art vision-transformer based model for disparity estimation and occlusion detection. To implement the proposed modification, we alter the kernel sizes in the transposed convolution layers used for pixel-wise upsampling in the \"feature extractor\" module of the architecture from $3 \\times 3$ kernels to larger kernels. We conduct evaluations on FlyingThings3D [60] and keep all other details as implemented in [50].", + "bbox": [ + 212, + 169, + 787, + 290 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In Table 6, we report the improvements in performance due to our architecture modification of increasing the size of the transposed convolution kernels used for upsampling, from the $3 \\times 3$ in the baseline model to $7 \\times 7$ (LCTC). Similar to previous applications, the increased kernel sizes with parallel $3 \\times 3$ kernels further facilitate", + "bbox": [ + 212, + 291, + 450, + 439 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/4f570a875900b41ae66fa97a9003b562437fd34f5b0478a4606860068faaf3be.jpg", + "table_caption": [ + "Table 6: Comparison of performance of STTR-light architecture with different sized kernels in transposed convolution for upsampling the feature maps in the feature extractor (lower is better). The entire set of results is provided as Tab. 17 in Appendix D.1." + ], + "table_footnote": [], + "table_body": "
TransposedConvolution KernelsTest Accuracy3-Step PGD attack
epe↓3px error↓epe↓3px error↓
STTR-light [50] reported0.51.54--
3×3 [50] reproduced0.49271.544.0518.5
LCTC: 7×7 + 3×3 (Ours)0.47881.504.0218.3
", + "bbox": [ + 464, + 369, + 781, + 429 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "to stabilize the model when attacked, as evaluated here for 3 attack iterations using PGD with $\\epsilon \\approx \\frac{8}{255}$ on the disparity loss. Indicating that larger kernels in the transposed convolutions can better decode learned representations from the encoder regardless of the specific downstream task. We provide visual results in Appendix D.1.", + "bbox": [ + 212, + 441, + 787, + 502 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 523, + 344, + 539 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We provide conclusive reasoning and empirical evidence for our hypotheses on the importance of context during upsampling. While increasing the size of convolutions during upsampling (LCTC) increases prediction stability, increasing the size of those convolution layers without upsampling does not benefit the network. This indicates that observations made for increased context during encoding do not translate to decoding. Further, we show that our simple LCTC can be directly incorporated into recent models, yielding better stability even in ViT-based architectures like Restormer, NAFNet, and STTR-light as well as in classical CNNs. Our observations are consistent across several architectures and downstream tasks.", + "bbox": [ + 212, + 553, + 787, + 686 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations. Current metrics for measuring performance do not completely account for spectral artifacts. Spectral artifacts begin affecting these metrics only when they become pronounced such as under adversarial attacks, and here LCTC consistently performs better across tasks and architectures. Ideally, we would want infinitely large kernels, however, with increasing kernel size and task complexity, training extremely large kernels can be challenging. Thus, in this work, while having ablated over kernels as large as $31 \\times 31$ , we propose using kernels only as large as $7 \\times 7$ to $11 \\times 11$ for good practical trade-offs. Further improvements might be possible when jointly optimizing the encoder and decoder. Moreover, there might exist other factors that contribute to the introduction and existence of spectral artifacts such as spatial bias.", + "bbox": [ + 212, + 689, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 380, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements.", + "text_level": 1, + "bbox": [ + 217, + 145, + 385, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Margret Keuper acknowledges funding by the DFG Research Unit 5336 - Learning to Sense. The OMNI cluster of the University of Siegen was used for some of the initial computations. Additionally, Shashank Agnihotri would like to thank Dr. Bin Zhao for his help in translating [75].", + "bbox": [ + 215, + 174, + 785, + 233 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 255, + 310, + 270 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Agnihotri, S., Gandikota, K.V., Grabinski, J., Chandramouli, P., Keuper, M.: On the unreasonable vulnerability of transformers for image restoration-and an easy fix. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3707-3717 (2023)", + "2. Agnihotri, S., Grabinski, J., Keuper, J., Keuper, M.: Beware of aliases–signal preservation is crucial for robust image restoration. arXiv preprint arXiv:2406.07435 (2024)", + "3. Agnihotri, S., Jung, S., Keuper, M.: CosPGD: A unified white-box adversarial attack for pixel-wise prediction tasks. In: International Conference on Machine Learning (2024)", + "4. Aitken, A., Ledig, C., Theis, L., Caballero, J., Wang, Z., Shi, W.: Checkerboard artifact free sub-pixel convolution: A note on sub-pixel convolution, resize convolution and convolution resize. arXiv preprint arXiv:1707.02937 (2017)", + "5. Ba, J.L., Kiros, J.R., Hinton, G.E.: Layer normalization. arXiv preprint arXiv:1607.06450 (2016)", + "6. Badki, A., Troccoli, A., Kim, K., Kautz, J., Sen, P., Gallo, O.: Bi3D: Stereo depth estimation via binary classifications. In: The IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)", + "7. Badrinarayanan, V., Kendall, A., Cipolla, R.: Segnet: A deep convolutional encoder-decoder architecture for image segmentation. IEEE transactions on pattern analysis and machine intelligence 39(12), 2481-2495 (2017)", + "8. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models (2021)", + "9. Brigham, E.O., Morrow, R.: The fast fourier transform. IEEE spectrum 4(12), 63-70 (1967)", + "10. Brunton, S.L., Kutz, J.N.: Data-driven science and engineering: Machine learning, dynamical systems, and control. Cambridge University Press (2022)", + "11. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020)", + "12. Carlini, N., Wagner, D.: Towards evaluating the robustness of neural networks. In: 2017 IEEE symposium on security and privacy (sp). pp. 39-57. IEEE (2017)", + "13. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in neural information processing systems 33, 9912-9924 (2020)", + "14. Chandrasegaran, K., Tran, N.T., Cheung, N.M.: A closer look at fourier spectrum discrepancies for cnn-generated images detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7200-7209 (June 2021)", + "15. Chang, J.R., Chen, Y.S.: Pyramid stereo matching network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5410-5418 (2018)", + "16. Chen, L., Chu, X., Zhang, X., Sun, J.: Simple baselines for image restoration. In: European Conference on Computer Vision. pp. 17-33. Springer (2022)", + "17. Ding, X., Zhang, X., Han, J., Ding, G.: Scaling up your kernels to 31x31: Revisiting large kernel design in cnns. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11963-11975 (2022)" + ], + "bbox": [ + 218, + 282, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 769, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Dosovitskiy, A., Brox, T.: Generating images with perceptual similarity metrics based on deep networks. Advances in neural information processing systems 29 (2016)", + "19. Dosovitskiy, A., Brox, T.: Inverting visual representations with convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4829-4837 (2016)", + "20. Dosovitskiy, A., Fischer, P., Ilg, E., Hausser, P., Hazirbas, C., Golkov, V., Van Der Smagt, P., Cremers, D., Brox, T.: Flownet: Learning optical flow with convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 2758-2766 (2015)", + "21. Dosovitskiy, A., Springenberg, J.T., Tatarchenko, M., Brox, T.: Learning to generate chairs, tables and cars with convolutional networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(4), 692-705 (2017)", + "22. Dumoulin, V., Visin, F.: A guide to convolution arithmetic for deep learning. arXiv preprint arXiv:1603.07285 (2016)", + "23. Durall, R., Keuper, M., Keuper, J.: Watch your up-convolution: Cnn based generative deep neural networks are failing to reproduce spectral distributions. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 7890–7899 (2020)", + "24. Everingham, M., Van Gool, L., Williams, C.K.I., Winn, J., Zisserman, A.: The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results. http://www.pascalnetwork.org/challenges/VOC/voc2012/workshop/index.html (2012)", + "25. Forsyth, D.A., Ponce, J.: Computer vision: a modern approach. Prentice Hall professional technical reference (2002)", + "26. Gal, R., Hochberg, D.C., Bermano, A., Cohen-Or, D.: SWAGAN: A style-based wavelet-driven generative model. ACM Transactions on Graphics (TOG) 40(4), 1-11 (2021)", + "27. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)", + "28. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014)", + "29. Grabinski, J., Jung, S., Keuper, J., Keuper, M.: Frequencylowcut pooling-plug and play against catastrophic overfitting. In: European Conference on Computer Vision. pp. 36-57. Springer (2022)", + "30. Grabinski, J., Keuper, J., Keuper, M.: Aliasing and adversarial robust generalization of cnns. Machine Learning pp. 1-27 (2022)", + "31. Grabinski, J., Keuper, J., Keuper, M.: Aliasing coincides with cnns vulnerability towards adversarial attacks. In: The AAAI-22 Workshop on Adversarial Machine Learning and Beyond. pp. 1-5 (2022)", + "32. Grabinski, J., Keuper, J., Keuper, M.: Fix your downsampling asap! be natively more robust via aliasing and spectral artifact free pooling (2023)", + "33. Grabinski, J., Keuper, J., Keuper, M.: As large as it gets - studying infinitely large convolutions via neural implicit frequency filters. Transactions on Machine Learning Research (2024), https://openreview.net/forum?id=xRy1YRcHWj, featured Certification", + "34. Gu, J., Zhao, H., Tresp, V., Torr, P.H.: Segpgd: An effective and efficient adversarial attack for evaluating and boosting segmentation robustness. In: European Conference on Computer Vision. pp. 308-325. Springer (2022)", + "35. Guo, M.H., Lu, C.Z., Hou, Q., Liu, Z., Cheng, M.M., Hu, S.M.: Segnext: Rethinking convolutional attention design for semantic segmentation. Advances in Neural Information Processing Systems 35, 1140-1156 (2022)", + "36. Hariharan, B., Arbeláez, P., Bourdev, L., Maji, S., Malik, J.: Semantic contours from inverse detectors. In: 2011 international conference on computer vision. pp. 991-998. IEEE (2011)" + ], + "bbox": [ + 215, + 147, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 379, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "37. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)", + "38. He, Y., Yu, N., Keuper, M., Fritz, M.: Beyond the spectrum: Detecting deepfakes via resynthesis. In: Zhou, Z.H. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. pp. 2534–2541. International Joint Conferences on Artificial Intelligence Organization (8 2021), main Track", + "39. Hendrycks, D., Dietterich, T.: Benchmarking neural network robustness to common corruptions and perturbations. Proceedings of the International Conference on Learning Representations (2019)", + "40. Hendrycks, D., Gimpel, K.: Gaussian error linear units (gelus). arXiv preprint arXiv:1606.08415 (2016)", + "41. Hoffmann, J., Agnihotri, S., Saikia, T., Brox, T.: Towards improving robustness of compressed cnns. In: ICML Workshop on Uncertainty and Robustness in Deep Learning (UDL) (2021)", + "42. Hossain, M.T., Teng, S.W., Lu, G., Rahman, M.A., Sohel, F.: Anti-aliasing deep image classifiers using novel depth adaptive blurring and activation function. Neurocomputing 536, 164-174 (2023)", + "43. Ilg, E., Mayer, N., Saikia, T., Keuper, M., Dosovitskiy, A., Brox, T.: Flownet 2.0: Evolution of optical flow estimation with deep networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2462-2470 (2017)", + "44. Jung, S., Keuper, M.: Spectral distribution aware image generation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 35, pp. 1734-1742 (2021)", + "45. Jung, S., Lukasik, J., Keuper, M.: Neural architecture design and robustness: A dataset. In: Eleventh International Conference on Learning Representations. OpenReview.net (2023)", + "46. Karras, T., Aittala, M., Laine, S., Härkönen, E., Hellsten, J., Lehtinen, J., Aila, T.: Alias-free generative adversarial networks. Advances in Neural Information Processing Systems 34, 852-863 (2021)", + "47. Khayatkhoei, M., Elgammal, A.: Spatial frequency bias in convolutional generative adversarial networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 7152-7159 (2022)", + "48. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012)", + "49. Kurakin, A., Goodfellow, I.J., Bengio, S.: Adversarial machine learning at scale. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=BJm4T4Kgx", + "50. Li, Z., Liu, X., Drenkow, N., Ding, A., Creighton, F.X., Taylor, R.H., Unberath, M.: Revisiting stereo depth estimation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 6197-6206 (2021)", + "51. Liu, S., Chen, T., Chen, X., Chen, X., Xiao, Q., Wu, B., Kärkkäinen, T., Pechenizkiy, M., Mocanu, D., Wang, Z.: More convnets in the 2020s: Scaling up kernels beyond 51x51 using sparsity. arXiv preprint arXiv:2207.03620 (2022)", + "52. Liu, S., Deng, W.: Very deep convolutional neural network based image classification using small training sample size. In: 2015 3rd IAPR Asian conference on pattern recognition (ACPR). pp. 730-734. IEEE (2015)", + "53. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "54. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11976-11986 (2022)", + "55. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015)", + "56. Loshchilov, I., Hutter, F.: SGDR: Stochastic gradient descent with warm restarts. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=Skq89Scxx", + "57. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=Bkg6RiCqY7", + "58. Maiya, S.R., Ehrlich, M., Agarwal, V., Lim, S.N., Goldstein, T., Shrivastava, A.: A frequency perspective of adversarial robustness (2021)", + "59. Mathew, A., Patra, A., Mathew, J.: Monocular depth estimators: Vulnerabilities and attacks. ArXiv abs/2005.14302 (2020)", + "60. Mayer, N., Ilg, E., Hausser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A large dataset to train convolutional networks for disparity, optical flow, and scene flow estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4040-4048 (2016)", + "61. Moosavi-Dezfooli, S.M., Fawzi, A., Frossard, P.: Deepfool: a simple and accurate method to fool deep neural networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2574–2582 (2016)", + "62. Mosleh, A., Langlois, J.M.P., Green, P.: Image deconvolution ringing artifact detection and removal via psf frequency analysis. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) Computer Vision - ECCV 2014. pp. 247-262. Springer International Publishing, Cham (2014)", + "63. Nah, S., Kim, T.H., Lee, K.M.: Deep multi-scale convolutional neural network for dynamic scene deblurring. In: CVPR (July 2017)", + "64. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proceedings of the IEEE international conference on computer vision. pp. 1520-1528 (2015)", + "65. Odena, A., Dumoulin, V., Olah, C.: Deconvolution and checkerboard artifacts. Distill 1(10), e3 (2016)", + "66. Peng, C., Zhang, X., Yu, G., Luo, G., Sun, J.: Large kernel matters - improve semantic segmentation by global convolutional network. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (July 2017)", + "67. Pervin, M., Tao, L., Huq, A., He, Z., Huo, L., et al.: Adversarial attack driven data augmentation for accurate and robust medical image segmentation. arXiv preprint arXiv:2105.12106 (2021)", + "68. Radford, A., Metz, L., Chintala, S.: Unsupervised representation learning with deep convolutional generative adversarial networks. arXiv preprint arXiv:1511.06434 (2015)", + "69. Radosavovic, I., Kosaraju, R.P., Girshick, R., He, K., Dollar, P.: Designing network design spaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020)", + "70. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)", + "71. Scheurer, E., Schmalfuss, J., Lis, A., Bruhn, A.: Detection defenses: An empty promise against adversarial patch attacks on optical flow. arXiv preprint arXiv:2310.17403 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 380, + 128 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "72. Schmalfuss, J., Mehl, L., Bruhn, A.: Attacking motion estimation with adversarial snow. arXiv preprint arXiv:2210.11242 (2022)", + "73. Schmalfuss, J., Mehl, L., Bruhn, A.: Distracting downpour: Adversarial weather attacks for motion estimation (2023)", + "74. Schmalfuss, J., Scholze, P., Bruhn, A.: A perturbation-constrained adversarial attack for evaluating the robustness of optical flow (2022)", + "75. segcv: segcv/pspnet. https://github.com/segcv/PSPNet/blob/master/Train.md (2021)", + "76. Shannon, C.E.: Communication in the presence of noise. Proceedings of the IRE 37(1), 10-21 (1949)", + "77. Shi, W., Caballero, J., Huszar, F., Totz, J., Aitken, A.P., Bishop, R., Ruekert, D., Wang, Z.: Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network (2016)", + "78. Si-Yao, L., Ren, D., Yin, Q.: Understanding kernel size in blind deconvolution. In: 2019 IEEE Winter Conference on Applications of Computer Vision (WACV). pp. 2068-2076. IEEE (2019)", + "79. Smith III, J.O.: Physical audio signal processing: For virtual musical instruments and audio effects. (No Title) (2010)", + "80. Sommerhoff, H., Agnihotri, S., Saleh, M., Moeller, M., Keuper, M., Kolb, A.: Differentiable sensor layouts for end-to-end learning of task-specific camera parameters. arXiv preprint arXiv:2304.14736 (2023)", + "81. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 (2013)", + "82. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021)", + "83. Teed, Z., Deng, J.: Raft: Recurrent all-pairs field transforms for optical flow. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part II 16. pp. 402-419. Springer (2020)", + "84. Touvron, H., Cord, M., Douze, M., Massa, F., Sablayrolles, A., Jégou, H.: Training data-efficient image transformers & distillation through attention. In: International conference on machine learning. pp. 10347-10357. PMLR (2021)", + "85. Tsipras, D., Santurkar, S., Engstrom, L., Turner, A., Madry, A.: Robustness may be at odds with accuracy. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=SyxAb30cY7", + "86. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)", + "87. Xu, L., Ren, J.S., Liu, C., Jia, J.: Deep convolutional neural network for image deconvolution. Advances in neural information processing systems 27 (2014)", + "88. Yamanaka, K., Matsumoto, R., Takahashi, K., Fujii, T.: Adversarial patch attacks on monocular depth estimation networks. IEEE Access 8, 179094-179104 (2020)", + "89. Zamir, S.W., Arora, A., Khan, S., Hayat, M., Khan, F.S., Yang, M.H.: Restormer: Efficient transformer for high-resolution image restoration. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5728-5739 (2022)", + "90. Zhang, H., Yu, Y., Jiao, J., Xing, E., El Ghaoui, L., Jordan, M.: Theoretically principled trade-off between robustness and accuracy. In: ICML (2019)", + "91. Zhang, R.: Making convolutional networks shift-invariant again. In: ICML (2019)", + "92. Zhao, H.: semseg. https://github.com/hszhao/semseg (2019)", + "93. Zhao, H., Shi, J., Qi, X., Wang, X., Jia, J.: Pyramid scene parsing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2881-2890 (2017)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Improving Feature Stability during Upsampling", + "bbox": [ + 447, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 769, + 114, + 785, + 126 + ], + "page_idx": 18 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "94. Zhao, H., Zhang, Y., Liu, S., Shi, J., Loy, C.C., Lin, D., Jia, J.: PSANet: Point-wise spatial attention network for scene parsing. In: ECCV (2018)", + "95. Zou, X., Xiao, F., Yu, Z., Lee, Y.J.: Delving deeper into anti-aliasing in convnets. In: BMVC (2020)" + ], + "bbox": [ + 215, + 146, + 785, + 202 + ], + "page_idx": 19 + }, + { + "type": "page_number", + "text": "20", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 19 + }, + { + "type": "header", + "text": "S. Agnihotri et al.", + "bbox": [ + 271, + 114, + 380, + 128 + ], + "page_idx": 19 + } +] \ No newline at end of file diff --git a/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_model.json b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_model.json new file mode 100644 index 0000000000000000000000000000000000000000..05926d31bb38e507caec2b857229e4976f7f8623 --- /dev/null +++ b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_model.json @@ -0,0 +1,2979 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.217, + 0.142, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling – Spectral Artifacts and the Importance of Spatial Context" + }, + { + "type": "text", + "bbox": [ + 0.268, + 0.212, + 0.735, + 0.228 + ], + "angle": 0, + "content": "Shashank Agnihotri1, Julia Grabinski1,2,3, and Margret Keuper1,4" + }, + { + "type": "text", + "bbox": [ + 0.33, + 0.239, + 0.673, + 0.253 + ], + "angle": 0, + "content": "1 Data and Web Science Group, University of Mannheim" + }, + { + "type": "text", + "bbox": [ + 0.393, + 0.254, + 0.612, + 0.267 + ], + "angle": 0, + "content": "2 Fraunhofer ITWM, Kaiserslautern" + }, + { + "type": "text", + "bbox": [ + 0.268, + 0.268, + 0.735, + 0.281 + ], + "angle": 0, + "content": "\\(^{3}\\) Institute for Machine Learning and Analytics (IMLA), Offenburg University" + }, + { + "type": "text", + "bbox": [ + 0.294, + 0.282, + 0.71, + 0.296 + ], + "angle": 0, + "content": "4 Max-Planck-Institute for Informatics, Saarland Informatics Campus" + }, + { + "type": "text", + "bbox": [ + 0.243, + 0.297, + 0.762, + 0.31 + ], + "angle": 0, + "content": "{shashank.agnihotri, julia.grabinski, keuper}@uni-mannheim.de" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.347, + 0.744, + 0.611 + ], + "angle": 0, + "content": "Abstract. Pixel-wise predictions are required in a wide variety of tasks such as image restoration, image segmentation, or disparity estimation. Common models involve several stages of data resampling, in which the resolution of feature maps is first reduced to aggregate information and then increased to generate a high-resolution output. Previous works have shown that resampling operations are subject to artifacts such as aliasing. During downsampling, aliases have been shown to compromise the prediction stability of image classifiers. During upsampling, they have been leveraged to detect generated content. Yet, the effect of aliases during upsampling has not yet been discussed w.r.t. the stability and robustness of pixel-wise predictions. While falling under the same term (aliasing), the challenges for correct upsampling in neural networks differ significantly from those during downsampling: when downsampling, some high frequencies can not be correctly represented and have to be removed to avoid aliases. However, when upsampling for pixel-wise predictions, we actually require the model to restore such high frequencies that can not be encoded in lower resolutions. The application of findings from signal processing is therefore a necessary but not a sufficient condition to achieve the desirable output. In contrast, we find that the availability of large spatial context during upsampling allows to provide stable, high-quality pixel-wise predictions, even when fully learning all filter weights." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.658, + 0.357, + 0.673 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Most computer vision models addressing perceptual tasks such as image restoration [16, 89], semantic segmentation [7, 35, 70], optical flow estimation [20, 43, 83] and disparity estimation [6, 11, 50] in realistic scenarios are required to behave in a stable way, at least under mild corruptions. Interestingly, for the slightly simpler task of image classification, recent progress has shown that a model's robustness does not only depend on its training but also on its architecture [29-32, 41, 42, 45, 58, 91, 95]. Specifically, aliasing, i.e. spectral artifacts that emerge from naive image resampling, have shown to compromise prediction stability, in particular in the context of classical convolutional models [33, 37, 48, 52, 69, 80, 82] which predominantly use small filter kernels in combination with severe data aggregation during downsampling [30, 58]. Principled cures" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.38, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "image", + "bbox": [ + 0.227, + 0.143, + 0.778, + 0.387 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.396, + 0.789, + 0.522 + ], + "angle": 0, + "content": "Fig. 1: Image restoration example using NAFNet [16] variants on GoPro [63]. Upsampling techniques like Pixel Shuffle [77] (first row) and transposed convolution [22] using small learnable filters \\((2\\times 2\\) or \\(3\\times 3)\\) (second row) are used by most prior art. Both lead to spectral artifacts for which the model needs to compensate. The clean (in-domain) restored images look appealing - while adversaries (here 5-step PGD [49] attack) can leverage aliases such that artifacts become easily visible. When observed in the frequency domain, they manifest as repeating peaks all over the spectra. Based on sampling theoretic considerations, we propose Large Context Transposed Convolutions \\((7\\times 7\\) or larger) (bottom row). They significantly increase the model's stability during upsampling, observable in the restored image under attack and the frequency spectrum." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.549, + 0.789, + 0.701 + ], + "angle": 0, + "content": "usually refer to basic concepts from signal processing such as anti-aliasing by blurring before downsampling [29, 91]. While this discussion on classifier (i.e. encoder) networks is insightful, it does not provide a recipe to counteract aliases emerging during upsampling for pixel-wise prediction tasks such as image restoration. Specifically, naive upsampling introduces artifacts in the feature representation, such as grid artifacts [4, 65] or ringing artifacts [62]. As shown in Fig. 1, these artifacts, an inherent property of inadequate upsampling (refer Sec. 3) are not always visible to the human eye, are accentuated under adversarial attack such that they can also be seen with a human eye. We leverage this effect in our analysis. When observed in the frequency domain, these artifacts are apparent as multiple peaks, i.e. aliases of the original data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.79, + 0.84 + ], + "angle": 0, + "content": "While for downsampling, signal processing laws basically prescribe which part of the information can be retained at lower resolutions without aliases [76], \"correct\", alias-free upsampling can not restore the original high-resolution information. Thus, learning to upsample feature maps such that the feature stability is not harmed is of paramount importance. In this paper, we therefore first provide a synopsis of different aliases that emerge from different upsampling techniques. Based on this work, we propose a simple, transposed convolution-based upsampling block. We study our proposed operation in the context of various models, from image restoration [16,89] over semantic segmentation [70] to disparity estimation [50]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.147, + 0.601, + 0.161 + ], + "angle": 0, + "content": "Our main contributions can be summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.173, + 0.786, + 0.231 + ], + "angle": 0, + "content": "- Motivated by sampling theory [76], we study upsampling in models for diverse pixel-wise prediction tasks. We find that the availability of large kernels in transposed convolutions helps the feature stability and significantly improves over standard, small kernel transposed convolutions as well as pixel shuffle [77]." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.233, + 0.786, + 0.276 + ], + "angle": 0, + "content": "- While large kernels are required to allow for reduced aliasing and to provide the necessary spatial context for increasing the resolution, additional small kernels can add details and remain useful." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.278, + 0.786, + 0.322 + ], + "angle": 0, + "content": "- We provide empirical evidence for our findings on diverse architectures (including vision transformer-based architectures) and downstream tasks such as image restoration, semantic segmentation, and depth estimation." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.324, + 0.786, + 0.353 + ], + "angle": 0, + "content": "- We show empirically that our proposed upsampling operation complements other feature stability-increasing approaches like adversarial training." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.173, + 0.786, + 0.353 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.377, + 0.367, + 0.392 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.409, + 0.787, + 0.469 + ], + "angle": 0, + "content": "In the following, we discuss recent challenges for neural networks regarding artifacts introduced by spatial sampling methods [4, 62, 65]. Further, we review related work on the most recent use of large kernels in CNNs. Finally, we provide an overview of adversarial attacks to gauge the quality of representations learned by a network." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.484, + 0.787, + 0.59 + ], + "angle": 0, + "content": "Spectral Artifacts. Several prior works have studied the effect of downsampling operations on model robustness, e.g. [2, 29, 30, 42, 46, 91, 95]. Inspired by [30], [29] propose an aliasing-free downsampling in the frequency domain which translates to an infinitely large blurring filter before downsampling in the spatial domain. Thus, for image classification, using large filter kernels has been shown to remove artifacts from downsampled representations and it leads to favorable robustness in all these cases [30, 42, 46]. However, all these works focus on improving the properties of encoder networks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.59, + 0.787, + 0.725 + ], + "angle": 0, + "content": "Models that use transposed convolutions in their decoders5 are widely used for tasks like image generation [27, 68] or segmentation [7, 55, 64, 70]. However, in simple transposed convolutions, the convolution kernels overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Further, image resampling can lead to aliases that become visible as ringing artifacts [76]. In the context of deepFake detection, image generation, and deblurring, several works analyzed [14, 18, 21, 23, 38, 44, 47] and improved upsampling techniques [26, 46, 78, 87] to reduce visual artifacts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.726, + 0.787, + 0.817 + ], + "angle": 0, + "content": "Some architectures like PSPNet [93], PSANet [94], or PSMNet [15] simply use bilinear interpolation operations for upsampling the feature representations. While this reduces grid artifacts as bilinear interpolation smoothens out the feature maps, it also has major drawbacks as they sample incorrectly. These new artifacts are sometimes visible as overly smooth predictions, in particular, apparent in the PSPNet segmentation masks. The segmentation masks over-smoothen around edges and often miss out on thin" + }, + { + "type": "page_footnote", + "bbox": [ + 0.221, + 0.825, + 0.581, + 0.84 + ], + "angle": 0, + "content": "For more details on Transposed Convolutions refer to [22]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "details (predictions showing these are included in the Appendix B.4). This observation already shows why image encoding and decoding have to be considered separately when it comes to sampling artifacts. While during encoding, artifacts can be reduced by blurring, the main purpose of decoder networks is reducing blur in many applications, to create fine-granular, pixel-wise accurate outputs, which our approach facilitates." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.236, + 0.79, + 0.388 + ], + "angle": 0, + "content": "Large Kernels. For image classification, [54] showed that using large kernels like \\(7 \\times 7\\) in the CNN convolution layer can outperform self-attention based vision transformers [53,84]. In [17,33,35,51,66], the receptive field of the convolution operations was further expanded by using larger kernels, up to \\(31 \\times 31\\) and \\(51 \\times 51\\). These larger receptive fields provide more context to the encoder, leading to better performance on classification, segmentation, or object detection tasks. [17,51] use a small kernel in parallel to capture the local context along with the global context. In contrast to these works, which are limited to exploring increased context only during encoding, we investigate if larger kernels can benefit upsampling when considering pixel-wise prediction tasks such as image restoration or segmentation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.39, + 0.79, + 0.619 + ], + "angle": 0, + "content": "Adversarial Attacks. The purpose of adversarial attacks is to reveal neural networks' weaknesses [3, 30, 74, 81] by perturbing pixel values in the input image [12, 28, 49]. These perturbations should lead to a false prediction even though the changes are hardly visible [28, 61, 81]. Especially attacks that have access to the network's architecture and weights, so-called white-box attacks, are a common approach to analyzing weaknesses within the networks' structure [12, 28]. They employ the gradient of the network to optimize the perturbation, which is bounded within an \\(\\epsilon\\)-ball of the original image, i.e. \\(\\epsilon\\) defines the strength of the attack. Most adversarial attacks are proposed to attack classification networks like the one-step Fast Gradient Sign Method (FGSM) [28] or the multi-step Projected Gradient Descent (PGD) attack [49]. However, they can be adapted to other tasks as e.g. in [59, 67, 88]. Furthermore, there are dedicated methods like SegPGD [34] for attacks on semantic segmentation models or PCFA [74] and [71, 73] for optical flow models and CosPGD [3] and others [72] for other pixel-wise prediction tasks. We evaluate the stability of upsampled features using adversarial attacks such as PGD and CosPGD for image restoration and FGSM and SegPGD for segmentation." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.639, + 0.776, + 0.658 + ], + "angle": 0, + "content": "3 Spectral Upsampling Artifacts and How They Can Be Reduced" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.67, + 0.788, + 0.759 + ], + "angle": 0, + "content": "Following, we first theoretically review artifacts that are caused during upsampling from a signal processing aspect. We start by describing the spectral artifacts [76] induced by the bed of nails interpolation, similar to the discussion in [23], and then extend the theoretical analysis to further upsampling schemes. Second, we derive from this analysis two hypotheses for the prediction stability of encoder-decoder networks, depending on their architecture. These hypotheses will motivate the remainder of the manuscript." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.76, + 0.788, + 0.792 + ], + "angle": 0, + "content": "Consider, w.l.o.g., a one-dimensional signal \\(I\\) and its discrete Fourier Transform \\(\\mathcal{F}(I)\\) with \\(k\\) being the index of discrete frequencies" + }, + { + "type": "equation", + "bbox": [ + 0.318, + 0.801, + 0.685, + 0.844 + ], + "angle": 0, + "content": "\\[\n\\mathcal {F} (I) _ {k} = \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j k}{N}} \\cdot I _ {j}, \\quad \\mathrm {f o r} \\quad k = 0, \\ldots , N - 1.\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "During decoding, we need to upsample the spatial resolution of \\(I\\) to get \\(I^{\\mathrm{up}}\\). For example for an upsampling factor of 2 (often used in DNNs [1, 16, 19, 82, 89]) we have for \\(\\bar{k} = 0,\\dots ,2N - 1\\)" + }, + { + "type": "equation", + "bbox": [ + 0.241, + 0.2, + 0.787, + 0.245 + ], + "angle": 0, + "content": "\\[\n\\mathcal {F} (I) _ {\\bar {k}} ^ {\\mathrm {u p}} = \\sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{2 \\cdot N}} \\cdot I _ {j} ^ {\\mathrm {u p}} = \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {2 \\cdot j \\bar {k}}{2 \\cdot N}} I _ {j} + \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {(2 j + 1) \\bar {k}}{2 \\cdot N}} \\bar {I} _ {j}, \\quad (1)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.252, + 0.788, + 0.3 + ], + "angle": 0, + "content": "where \\(\\bar{I}_j = 0\\) in bed of nails interpolation. Therefore, the second term in (1) can be dropped and the first term resembles the original \\(\\mathcal{F}(I)\\). Equivalently, we can rewrite Eq. (1), for \\(\\bar{I}_j = 0\\), using a Dirac impulse comb as" + }, + { + "type": "equation", + "bbox": [ + 0.35, + 0.306, + 0.787, + 0.351 + ], + "angle": 0, + "content": "\\[\n(1) = \\sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j k}{2 \\cdot N}} \\cdot \\sum_ {t = - \\infty} ^ {\\infty} I _ {j} ^ {\\mathrm {u p}} \\cdot \\delta (j - 2 t). \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.357, + 0.787, + 0.389 + ], + "angle": 0, + "content": "If we now apply the pointwise multiplication with the Dirac impulse comb as convolution in the Fourier domain (assuming periodicity) [25], it is" + }, + { + "type": "equation", + "bbox": [ + 0.226, + 0.395, + 0.787, + 0.495 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {F} (I) _ {\\bar {k}} ^ {\\mathrm {u p}} = \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\left(\\sum_ {j = - \\infty} ^ {\\infty} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{2 N}} I _ {j} ^ {\\mathrm {u p}}\\right) \\left(\\bar {k} - \\frac {t}{2}\\right) \\tag {3} \\\\ \\stackrel {(1)} {=} \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\left(\\sum_ {j = - \\infty} ^ {\\infty} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{N}} \\cdot I _ {j}\\right) \\left(\\bar {k} - \\frac {t}{2}\\right) = \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\mathcal {F} (I) _ {\\bar {k}} \\left(\\bar {k} - \\frac {t}{2}\\right). \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.502, + 0.788, + 0.548 + ], + "angle": 0, + "content": "We can see that such upsampling creates high-frequency replica of the signal at \\( \\frac{t}{2} \\) for \\( t \\) in \\( -\\infty, \\ldots, \\infty \\) in \\( \\mathcal{F}(I)^{\\mathrm{up}} \\) and spatial frequencies apparent beyond array positions \\( \\frac{N}{2} \\) will be impacted by spectral artifacts if no appropriate countermeasures are taken." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.548, + 0.788, + 0.749 + ], + "angle": 0, + "content": "A standard countermeasure is interpolation of the inserted values with \\(\\bar{I}_j = \\frac{I_{j-1} + I_j}{2}\\) for linear interpolation in Eq. (1). Linear interpolation (and in consequence bi-linear interpolation in 2D signals) corresponds to a convolution with a triangular impulse with width 2, which can be represented as the convolution of two rectangle functions with width 1. Accordingly, the Fourier response for frequency \\(\\ell\\), \\(\\mathcal{F}_{\\ell}\\) of the triangular impulse is a squared sinc function (\\(\\mathrm{sinc}^2(\\ell)\\)) with \\(\\mathrm{sinc}(\\ell) = \\frac{\\sin(\\pi\\ell)}{\\pi\\ell}\\). Since the output signal after interpolation is still discrete, i.e. sampled with sampling rate \\(\\frac{1}{2}\\), a replica of the interpolation function, the \\(\\mathrm{sinc}^2\\) function, will appear with rate 2 in the resulting spectrum (see also Fig. 2). The resulting interpolated signal is not optimal for several reasons. Most importantly, the spectrum of the interpolation function is not flat although the estimated values appear overly smooth (see Fig. 3.). This is arguably suboptimal for, for example, image restoration or segmentation tasks, where fine structural details are supposed to emerge in the upsampled data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.81 + ], + "angle": 0, + "content": "Note that, in Eq. (1), pixel shuffle [77] will set \\(\\bar{I}_j\\) to completely unrelated values of a different feature map channel, leading to a highly non-smooth signal with frequencies at the band limit. The resulting issues in the spectrum are similar to the ones caused by the bed of nails interpolation. These spectral artifacts can be visually observed in Fig. 3." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.811, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Therefore, in transposed convolutions, the interpolation function is not fixed to a predefined smoothing kernel but learned so that the resulting signal can represent fine" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.38, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.145, + 0.775, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.236, + 0.788, + 0.293 + ], + "angle": 0, + "content": "Fig. 2: (Left) Linear interpolation (pink) of the samples (green) causes aliases. (Right) Optimal signal reconstruction (pink) is achieved by sinc interpolation. In practice our spatial context is limited and the interpolation function is discrete. Yet, increasing the kernel size enables the approximation of larger sinc-like structures." + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.301, + 0.363, + 0.363 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.233, + 0.365, + 0.353, + 0.374 + ], + "angle": 0, + "content": "Artifact-free Ground Truth" + }, + { + "type": "image", + "bbox": [ + 0.364, + 0.302, + 0.501, + 0.363 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.385, + 0.365, + 0.48, + 0.375 + ], + "angle": 0, + "content": "Bicubic Interpolation" + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.302, + 0.641, + 0.363 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.503, + 0.365, + 0.64, + 0.375 + ], + "angle": 0, + "content": "Nearest Neighbor Interpolation" + }, + { + "type": "image", + "bbox": [ + 0.642, + 0.302, + 0.781, + 0.363 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.649, + 0.365, + 0.773, + 0.375 + ], + "angle": 0, + "content": "Small(3×3) Transposed Conv" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.375, + 0.362, + 0.437 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.235, + 0.439, + 0.351, + 0.448 + ], + "angle": 0, + "content": "Zoomed-in Ground Truth" + }, + { + "type": "image", + "bbox": [ + 0.363, + 0.375, + 0.501, + 0.437 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.383, + 0.439, + 0.481, + 0.449 + ], + "angle": 0, + "content": "Bilinear Interpolation" + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.375, + 0.64, + 0.437 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.542, + 0.439, + 0.601, + 0.448 + ], + "angle": 0, + "content": "Pixel Shuffle" + }, + { + "type": "image", + "bbox": [ + 0.642, + 0.375, + 0.781, + 0.438 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.642, + 0.439, + 0.781, + 0.449 + ], + "angle": 0, + "content": "Large(7×7+3×3) Transposed Conv" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.461, + 0.788, + 0.545 + ], + "angle": 0, + "content": "Fig.3: An image from GoPro [63] downsampled with \\(3 \\times 3\\) MaxPooling and then upsampled using various upsampling techniques. The resulting artifacts are compared on zoomed-in red box regions for better visibility. Bilinear interpolation causes over-smoothing. Bicubic interpolation causes overestimation along image boundaries while Pixel Shuffle and Nearest Neighbor cause strong grid artifacts along with discoloration. Small kernel transposed convolutions cause grid artifacts, however, on increasing kernel size we start getting better upsampling." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.789, + 0.844 + ], + "angle": 0, + "content": "details after the initial bed of nails interpolation and potentially learn to add fine details. One issue is that the learned convolution kernels may overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Besides this rather technical aspect, transposed convolutions, if sufficiently large (thus also containing more context), could in principle learn to approximate correct upsampling functions. This can be understood when again looking at the Fourier representation. When interpolating, we want to increase the signal array size so that all the original information is preserved and the model can easily learn additional details. Such upsampling to preserve the information from the original low-resolution data is most easily achieved by transforming the signal to the Fourier domain, then padding the missing high-frequency parts with zeros and transforming the resulting array back to the spatial domain [79]. In the Fourier domain, this padding operation can be understood as a point-wise multiplication of the desired full spectrum with a rectangle function with width \\( N \\) (denoted \\( \\operatorname{rect}_N \\)). Conversely, this operation corresponds to a convolution with \\( \\mathcal{F}^{-1}(\\operatorname{rect}_N) = \\frac{1}{N}\\operatorname{sinc}(xN) \\) in the spatial domain. While the sinc function drops off as \\( x \\) increases, it never drops to zero. When applied for interpolation, its crests and the troughs cancel out the aliasing to a large" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.126 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.312 + ], + "angle": 0, + "content": "extent as shown in Fig. 2. Thus, in order to allow the approximation of the optimal interpolation function, the kernel size in transposed convolutions has to be chosen as large as possible. This is, however, at odds with the \"learnability\" of suitable filter weights. Note that for pixel-wise predictions, models not only need to correctly interpolate, but they also need to \"fill in\" the missing details, which requires global as well as local context. Therefore, we expect a trade-off on the kernel size of transposed convolutions, where larger kernels improve the stability of the upsampled features and thus can reduce artifacts while the absolute prediction quality can suffer from very large learnable kernels. Sufficiently but not overly large kernels provide sufficient spatial context and are appropriate to allow for the model to learn when to blur and when to preserve/sharpen upsampled features. We illustrate this in Fig. 12 in Appendix C.4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.313, + 0.787, + 0.343 + ], + "angle": 0, + "content": "From this theoretical analysis of common upsampling methods, we derive the following hypotheses that we deem relevant for encoder-decoder architectures:" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.354, + 0.788, + 0.414 + ], + "angle": 0, + "content": "Hypothesis 1 (H1): Large Context Transposed Convolutions (LCTC) i.e. Large kernels in transposed convolution operations provide more context and reduce spectral artifacts and can therefore be leveraged by the network to facilitate better and more robust pixel-wise predictions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.424, + 0.788, + 0.485 + ], + "angle": 0, + "content": "Hypothesis 2 (H2, Null Hypothesis): To leverage prediction context and reduce spectral artifacts, it is crucial to increase the size of the transposed convolution kernels (upsample using large filters). Increasing the size of normal (i.e. non-upsampling) decoder convolutions does not have this effect." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.497, + 0.788, + 0.543 + ], + "angle": 0, + "content": "In the following, we show the proposed, simple, and principled architecture changes that allow for studying the above hypotheses and improving robustness by improving feature stability." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.566, + 0.743, + 0.584 + ], + "angle": 0, + "content": "4 Upsampling using Large Context Transposed Convolutions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.788, + 0.749 + ], + "angle": 0, + "content": "Driven by the observations on upsampling artifacts, we investigate the advantage of larger kernel sizes during upsampling, for applications such as semantic segmentation or disparity estimation. Therefore, we keep the models' encoder part fixed and exclusively change operations in the architecture of the decoder part of the model. There, we have two design choices: Upsampling - The kernel size for the transposed convolution operations that learn upsampling, and Decoder Block - The kernel size in the convolution operations of blocks that learn to decode the features. Probing options for Upsampling works towards proving H1 while a combination of both options proves H2, i.e. shows that a pure increase in the decoder parameters does not have the desired effect. This is considered in our ablation study in Sec. 5.2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Figure 4 summarizes the studied options for an abstract encoder-decoder architecture like [70]. The model decoder is depicted in the green box. Operations that we consider to be executed along the red upwards arrows (Upsampling Operators) are detailed in the top right part of the figure (operations a) to c). Operations that we consider to be executed along the blue sideways arrows (Decoder Building Blocks) are depicted in the bottom right (operations d) to f)." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.38, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "image", + "bbox": [ + 0.214, + 0.142, + 0.788, + 0.367 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.375, + 0.79, + 0.57 + ], + "angle": 0, + "content": "Fig. 4: Abstract representation of an encoder-decoder architecture. While for different tasks, the implementation of the model encoder varies (including transformer-based encoders), our study focuses on the model decoder (in green). The backbone for the decoder is commonly a ResNet-like structure for feature extraction [7, 70], additionally we also used a ConvNeXt-like [54] structure. We investigate variants of different upsampling operations (the operations along the red arrows in the decoder) for fixed decoder blocks. We consider, as a probe for H1, the baseline transposed deconvolution (a) in the top right), and for LCTC an increased convolution kernel size (b) in the top right), and an increased convolution kernel with a second path using a small convolution kernel (c) in the top right). To test whether the plain increase in parameters is responsible for improved results (zero hypotheses, H2), we also ablate on the increase of convolution kernel size in the decoder block (operations along the blue arrows in the green block), as shown on the bottom right. We consider the common ResNet-like decoder building block structure (in d)) and two ConvNext-like structured backbones for the decoder building block in e) and f), where f) has an additional small convolution applied in parallel, analog to c)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.594, + 0.789, + 0.625 + ], + "angle": 0, + "content": "Model Details. Here, we provide details on the studied models. All implementation details are given in the Appendix A." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.627, + 0.789, + 0.748 + ], + "angle": 0, + "content": "Transposed Convolution Kernels for Upsampling. The upsampling operation is typically performed with small kernels (\\(2 \\times 2\\) or \\(3 \\times 3\\)) in the transposed convolution operations [8, 13, 70]. We aim to increase the spatial context during upsampling and to reduce grid artifacts. Thus we use Large Context Transposed Convolutions (LCTC). We either use \\(7 \\times 7\\) transposed convolutions or \\(11 \\times 11\\) transposed convolutions with a parallel \\(3 \\times 3\\) transposed convolution. Adding a parallel \\(3 \\times 3\\) kernel is motivated by [17], as large convolution kernels tend to lose local context, and thus adding a parallel small kernel helps to overcome this potential drawback (see Appendix B.3)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.79, + 0.841 + ], + "angle": 0, + "content": "Decoder Building Blocks. To verify that the measurable effects are due to the improved upsampling and not due to merely increasing the decoder capacity, we ablate on decoder convolution blocks similar to convolution blocks used in the ConvNeXt [54] basic block for encoding. While the standard ConvNeXt block uses a \\(7 \\times 7\\) depth-wise convolution, we consider \\(7 \\times 7\\) and \\(11 \\times 11\\) group-wise convolutions, followed by layers present in a ConvNeXt basic block to analyze the importance of the receptive field within the block." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.144, + 0.784, + 0.273 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.287, + 0.785, + 0.342 + ], + "angle": 0, + "content": "Fig. 5: NAFNet, as proposed, uses Pixel Shuffle for upsampling. We modify only the upsampling operations to transposed convolution with kernel size \\((3\\times 3)\\) and LCTC (Ours) for comparisons. We observe, for example, under a 10-step PGD attack with \\(\\epsilon \\approx \\frac{8}{255}\\) our proposed H1 gains validity. More examples for [16, 89] using different attacks and budgets are in Appendix C.3." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.359, + 0.785, + 0.429 + ], + "angle": 0, + "content": "Table 1: Comparison of performances of different upsampling methods in SotA Image Restoration Networks on the GoPro dataset. The architectures use Pixel Shuffle for Upsampling, we propose replacing the Pixel Shuffle with Large Context Transposed Convolutions (LCTC). We report additional results using adversarial training in Tab. 15. Note, that some trade-off between clean performance and robustness is expected [85,90]." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.44, + 0.784, + 0.543 + ], + "angle": 0, + "content": "
NetworkUpsampling MethodTest AccuracyCosPGD (ε ≈ 8/255) attack iterationsPGD (ε ≈ 8/255) attack iterations
PSNRSSIM5102051020
PSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIM
RestomerPixel Shuffle31.990.963511.360.32369.050.22427.590.154811.410.32569.040.22347.580.1543
Transposed Conv 3×39.680.0958.240.04528.530.06288.440.06317.660.04647.720.05778.640.0527
LCTC: 7×7 + 3 × 3 (Ours)29.510.933713.690.418611.530.313610.160.248413.690.418311.540.313710.160.2483
LCTC: 11×11 + 3×3 (Ours)29.440.932414.650.425112.830.343811.480.2914.650.425312.840.344511.480.2893
NAFNetPixel Shuffle32.870.96068.670.22646.680.11275.810.061710.270.31798.660.22825.950.0714
Transposed Conv 3×331.020.94226.150.03325.950.02585.870.02336.150.03325.950.02585.870.0234
LCTC: 7×7 + 3 × 3 (Ours)31.120.943014.540.482711.050.32209.060.221314.530.482311.030.32019.080.2224
LCTC: 11×11 + 3×3 (Ours)30.770.939214.340.449211.410.32449.540.241114.340.4511.40.32369.550.2398
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.564, + 0.785, + 0.669 + ], + "angle": 0, + "content": "Figure 4 (bottom right e) and f)) shows the structure of a ConvNeXt-style building block used in our work. First, a group-wise convolution is performed, followed by a LayerNorm [5] and two \\(1 \\times 1\\) convolutions which, similar to [54], creates an inverted bottleneck by first increasing the channel dimension and after a GELU [40] activation compressing the channel dimension again. We consider the ResNet-style building block (Figure 4, d)), with \\(3 \\times 3\\) convolution, yet without skip connection, as our baseline when studying this architectural design choice." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.698, + 0.357, + 0.715 + ], + "angle": 0, + "content": "5 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.784, + 0.84 + ], + "angle": 0, + "content": "In the following, we evaluate the effect of the considered upsampling operators in several applications. We start by evaluating the effect on the upsampled feature stability of recent state-of-the-art (SotA) image restoration models [16,89], then provide results on semantic segmentation using more generic convolutional architectures that allow us to provide compulsory ablations. Last, we show that our results also extend to disparity estimation [50]. We provide details on the used adversarial attacks, datasets, reported metrics, and other experimental details in Appendix A." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.239 + ], + "angle": 0, + "content": "In all cases, we observe that Large Context Transposed Convolutions (LCTC) improve the results of the respective pixel-wise prediction task in terms of stability under attack, showing that H1 holds. Further, our extensive ablation on image segmentation shows that increasing the convolution kernel in the decoder building blocks does not have this beneficial effect, providing experimental evidence for our hypothesis H2 and confirming the impact of spectral artifacts on pixel-wise predictions." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.259, + 0.388, + 0.274 + ], + "angle": 0, + "content": "5.1 Image Restoration" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.283, + 0.788, + 0.39 + ], + "angle": 0, + "content": "For image restoration, we consider the Vision Transformer-based Restormer [89] and NAFNet [16]. Both originally use the Pixel Shuffle [77] for upsampling. Here, we compare the reconstructions from these proposed architectures to their variants using the proposed operators with large transposed convolution filters. We use the same metrics as [16, 89], Peak Signal-to-Noise Ratio (PSNR), and structural similarity index measure (SSIM) [86]. We perform our experiments on the GoPro [63] image deblurring dataset, following the experimental setup in [1]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.402, + 0.788, + 0.508 + ], + "angle": 0, + "content": "Results on Image Restoration. We first consider qualitative results on NAFNet [16] in Figure 5 and Restormer [89] in Fig. 10, Fig. 11(in Appendix C.3), where we see that the proposed upsampling operators allow for visually good results in image deblurring on clean data (similar to pixel shuffle). Yet, in contrast to pixel shuffle and the baseline small transposed convolution filters, the proposed Large Context Transposed Convolutions (LCTC) significantly reduces artifacts that arise on attacked images (in this case, 10-step PGD with \\(\\epsilon \\approx \\frac{8}{255}\\)). attacks with varying numbers of steps." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.659 + ], + "angle": 0, + "content": "In Table 1, we report the average PSNR and SSIM values of the reconstructed images from the GoPro test set. These results confirm that at filter size \\(3 \\times 3\\), the performance of the transposed convolution variant of both the considered networks is significantly worse than the originally proposed Pixel Shuffle variant, justifying the community's extensive use of Pixel Shuffle. However, we observe on increasing context by increasing the kernel size to \\(7 \\times 7\\) that the performance of the transposed convolution variants significantly improves, especially making the networks more stable when facing adversarial attacks. This boost in performance is further accentuated by increasing the kernel size to \\(11 \\times 11\\) (both with parallel small kernels). These results provide evidence for Hypothesis 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.751 + ], + "angle": 0, + "content": "Note that the slightly reduced performance on clean images, seen in Table 1, is expected to some degree: here, we only investigate sampling in the decoder, while pixel unshuffle is used in the encoder, potentially causing a mismatch. Further, previous works have shown that there exists a trade-off between adversarial robustness and clean performance [85, 90]. However, we do not observe this trade-off for matching encoder-decoder architectures, e.g. in semantic segmentation." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.771, + 0.422, + 0.787 + ], + "angle": 0, + "content": "5.2 Semantic Segmentation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.843 + ], + "angle": 0, + "content": "As baseline architecture for semantic segmentation, we consider a UNet-like architecture [70] with encoder backbone layers from ConvNeXt [54] (see Appendix B.2 on the choice of encoder). This generic architecture facilitates providing a thorough ablation" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.236, + 0.143, + 0.768, + 0.227 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.239, + 0.788, + 0.363 + ], + "angle": 0, + "content": "Fig. 6: A comparison of semantic segmentation mask predictions for the shown input images. The row labeled \"Prediction Difference\" shows the difference in predictions between the baseline model and the model with Large Context Transposed Convolutions \\((11\\times 11 + 3\\times 3\\) kernels). On white pixels, both models agree. Red pixels indicate that the baseline model predicts correctly but our modified model predicts incorrectly. Green pixels indicate that our modified model predicts correctly but the baseline does not. The ground truth segmentation boundaries are drawn in black. Our modification improves the segmentation result along object boundaries, which can be attributed to spectral artifact removal, but also in more extended regions, where the context plays a more crucial role." + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.37, + 0.789, + 0.427 + ], + "angle": 0, + "content": "Table 2: Semantic Segmentation performance on the PASCAL VOC2012 validation set for UNet with ConvNeXt encoder, and the baseline UNet decoder (see Figure 4) with differently sized kernels in transposed convolution for feature map upscaling while keeping rest of the architecture fixed. Additional results are provided in Tab. 7 and Tab. 8 in Appendix B.1." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.438, + 0.788, + 0.507 + ], + "angle": 0, + "content": "
TransposedConvolution KernelsCleanTest AccuracymIoU mAcc allAccFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations320mIoU mAcc allAcc
mIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAcc
2×2 (baseline)78.3486.8995.1553.5470.9686.0847.0265.4182.7823.0646.51
LCTC: 7×7 (Ours)78.9288.0695.2356.0274.1386.4549.2468.8982.8726.5353.05
LCTC: 11×11 + 3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6427.4953.08
7.0823.30
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.528, + 0.788, + 0.589 + ], + "angle": 0, + "content": "on all considered blocks in the decoder network. Our experiments are conducted on the PASCAL VOC 2012 dataset [24]. We report the mean Intersection over Union (mIoU) of the predicted and ground truth segmentation mask, the mean accuracy over all pixels (mAcc), and the mean accuracy over all classes (allAcc)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.788, + 0.779 + ], + "angle": 0, + "content": "Results on Semantic Segmentation. We first discuss the results for different upsampling operations. The remaining architecture is kept identical, with ResNet-style building blocks in the decoder, throughout these experiments. The clean test accuracies are shown in Table 2. We see that as we increase the kernel size of the transposed convolution layers, there is a slight increase across all three evaluation metrics. Moreover, Figure 6 visually demonstrates that, as we increase the size of the kernels in transposed convolution from \\(2 \\times 2\\) (baseline) to \\(11 \\times 11\\), the segmentations of the thin end and protrusions, for example, in the wing of the aircraft sample image are improving. The baseline model with small transposed convolution kernels could not predict these details. As hypothesized in H1, we observe that increasing the context can reduce spectral artifacts caused when representation and images are upsampled using LCTC." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Further, in Table 2, we evaluate the performance of the segmentation models against FGSM [28] and the multi-step attack SegPGD [34] adversarial attacks for the indicated \\(\\epsilon\\) values. As expected, with the increasing intensity of the attack, the performance of all models drops. Yet, even at high attack intensities, the larger kernels perform better than" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 3: Adversarially trained models using FGSM (\\(\\epsilon \\approx \\frac{8}{255}\\)) from Table 2 tested against SegPGD adversarial attacks (\\(\\epsilon \\approx \\frac{8}{255}\\)) on UNet with ConvNeXt encoder and decoder with different sized kernels in the transposed convolution for upsampling, while keeping rest of the architecture identical. See Tab. 10 in Appendix B.6 for more evaluations including PGD training." + }, + { + "type": "table", + "bbox": [ + 0.264, + 0.213, + 0.74, + 0.289 + ], + "angle": 0, + "content": "
TransposedConvolution KernelsCleanTest DatamIoU mAcc allAccSegPGD attack iterations
3mIoU mAcc allAcc20mIoU mAcc allAcc
\\( 2 \\times 2 \\)78.57 86.68 95.2326.59 48.99 67.717.6 24.06 31.37
LCTC: \\( 7 \\times 7 \\) (Ours)78.41 86.22 95.2028.11 53.39 66.308.36 28.54 28.13
LCTC: \\( 11 \\times 11 + 3 \\times 3 \\) (Ours)79.57 88.1 95.330.37 55.54 68.39.4 29.79 32.37
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.301, + 0.788, + 0.358 + ], + "angle": 0, + "content": "Table 4: Empirical evaluations for H2 using a UNet with ConvNeXt encoder. We observe that across different-sized kernels in transposed convolution, for a fixed kernel size, increasing the context in the decoder building blocks by using larger kernels causes performance deterioration. These observations for image decoding contrast the findings on image encoding by [17, 51, 54]." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.369, + 0.79, + 0.48 + ], + "angle": 0, + "content": "
Transposed Convolution KernelsDecoder Building Block StyleTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255) attack iterations
mIoU / mAcc / allAcc1/255mIoU / mAcc / allAcc8/255mIoU / mAcc / allAcc3mIoU / mAcc / allAcc20mIoU / mAcc / allAcc
2×2ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.34 / 86.89 / 95.1577.17 / 86.86 / 94.8177.17 / 86.86 / 94.8153.54 / 70.96 / 86.0849.98 / 72.22 / 83.9347.34 / 67.72 / 83.3447.02 / 65.41 / 82.7842.04 / 64.86 / 79.0837.91 / 57.79 / 78.2123.06 / 46.51 / 60.0417.94 / 44.81 / 47.9613.97 / 35.82 / 45.685.54 / 18.79 / 23.723.20 / 14.73 / 9.812.21 / 10.75 / 5.297.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 7×7 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.92 / 88.06 / 95.2377.57 / 87.04 / 94.9277.99 / 87.86 / 94.9656.02 / 74.13 / 86.4552.93 / 72.18 / 85.5151.61 / 73.01 / 84.8549.24 / 68.89 / 82.8744.89 / 65.71 / 80.7443.93 / 66.22 / 80.7326.53 / 53.05 / 61.1617.64 / 43.32 / 47.8017.07 / 42.30 / 48.787.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 11×11+3×3 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×379.33 / 87.81 / 95.4178.32 / 86.98 / 95.0977.42 / 86.24 / 94.9458.04 / 74.93 / 87.8053.31 / 72.45 / 86.1654.48 / 72.53 / 86.2551.25 / 69.31 / 84.6444.89 / 65.18 / 82.0346.67 / 66.59 / 82.2927.49 / 53.08 / 64.1316.14 / 40.65 / 50.3918.76 / 44.60 / 51.497.08 / 23.30 / 26.821.93 / 9.35 / 3.902.31 / 8.70 / 3.50
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.502, + 0.787, + 0.534 + ], + "angle": 0, + "content": "the small ones, and we see a trend of improvement in performance as we increase the kernel size, providing more evidence for Hypothesis 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.544, + 0.788, + 0.621 + ], + "angle": 0, + "content": "Ablation Study. In the following, we first consider the effects of additional adversarial training, then ablate on the impact of other decoder building blocks and the filter size. Variations of the model encoder are ablated in the Appendix B.2, the impact of using small parallel kernels in addition to large kernels is ablated and discussed in Appendix B.3, and competing upsampling techniques are ablated in Appendix B.5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.624, + 0.788, + 0.716 + ], + "angle": 0, + "content": "Adversarial Training. In Table 3, we report results for FGSM adversarially trained models under SegPGD attack, with attacks as in Table 2. While the overall performance under attack is improved as expected, the trend of LCTC providing better results persists. More results for FGSM attack and SegPGD attacks with different numbers of iterations are given in Tab. 7 and Tab. 8 in the Appendix. In Table 15, we additionally evaluate image restoration models under adversarial training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.795 + ], + "angle": 0, + "content": "Change in the decoder backbone architecture. While all previous experiments focused on the upsampling using transposed convolutions in the decoder, we now evaluate the influence of the convolutional kernel size within the decoder which does not upsample (see Section 4). For these experiments, we use a UNet-like architecture with a ConvNeXt backbone in the encoder and the PASCAL VOC 2012 dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In Table 4 we observe, for a fixed transposed convolution kernel size, as we increase the size of the convolution kernel in the decoder building blocks, the performance of the model decreases. This phenomenon extends to the performance of the architectures" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.302, + 0.143, + 0.452, + 0.23 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.453, + 0.143, + 0.703, + 0.23 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.24, + 0.788, + 0.296 + ], + "angle": 0, + "content": "Fig. 7: Performance comparison on PASCAL VOC2012 using UNet with ConvNeXt encoder for different LCTC sizes from \\(2 \\times 2\\) (small) to \\(31 \\times 31\\) (LCTC) kernels. All, besides the baseline with \\(2 \\times 2\\) and \\(3 \\times 3\\), have a parallel \\(3 \\times 3\\) kernel, as shown in Figure 4 (bottom left). For the decoder building block backbone, a ResNet Style \\(3 \\times 3\\) style is used. See Tab. 9 for the values." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.31, + 0.788, + 0.366 + ], + "angle": 0, + "content": "Table 5: Comparison of performances of different upsampling methods in the UNet-like architecture. All architectures use the baseline (ConvNeXt) encoder and \\(3 \\times 3\\) convolution kernels in the decoder block. Please refer to Table 13 in Appendix B.5 for more evaluations and discussion, including those with ConvNeXt style \\(7 \\times 7 + 3 \\times 3\\) Convolution kernels in the decoder blocks." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.378, + 0.782, + 0.449 + ], + "angle": 0, + "content": "
Upsampling MethodTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations
mIoU mAcc allAcc1/255mIoU mAcc allAcc8/255mIoU mAcc allAcc5mIoU mAcc allAcc20mIoU mAcc allAcc
Pixel Shuffle78.5487.3295.1853.8271.5885.8846.6765.0381.7115.0638.8541.716.6923.4324.05
Nearest Neighbour Interpolation78.4088.1695.0952.6873.5184.5546.0867.9680.2215.3444.5336.217.6527.8920.48
Transposed Convolution 2×278.4586.6695.2053.7670.6286.3247.3364.5883.1614.4335.5045.305.5418.7923.72
LCTC: 11×11+3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6418.1543.5149.367.0823.3026.82
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.788, + 0.566 + ], + "angle": 0, + "content": "under adversarial attacks, showing that a mere increase in parameters in the model decoder does not have a positive effect on model performance or on its stability. This proves the validity of hypothesis H2. An explanation for this phenomenon could be that we only need to increase context during the actual upsampling step, increasing context in the consequent decoder building blocks has a negligible effect on the quality of representations learned. However, the increase in the number of parameters makes the architecture more susceptible to adversarial attacks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.567, + 0.788, + 0.658 + ], + "angle": 0, + "content": "Ablation on filter size saturation. After proving H1 one could argue that networks will consistently improve with increased kernel size for Large Context Transposed Convolutions. Hence, we test larger kernel sizes of \\( 15 \\times 15 \\), \\( 17 \\times 17 \\), \\( 19 \\times 19 \\) and \\( 31 \\times 31 \\) kernels. Yet, as seen in Figure 7, the effect of the kernel size appears to saturate: the performance after \\( 13 \\times 13 \\) and the performance of \\( 31 \\times 31 \\) kernels is not better than for \\( 11 \\times 11 \\) kernels. Yet, they are significantly better than the baseline's performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.704 + ], + "angle": 0, + "content": "Ablation on different Upsampling Methods. Following, we compare different upsampling techniques thus justifying our advocacy for using LCTC instead of other upsampling techniques like interpolation and pixel shuffle in the real world." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We report the comparison in Table 5 and observe that both Pixel shuffle and Nearest Neighbor interpolation perform better than the usually used Transposed Convolution with a \\(2 \\times 2\\) kernel size. However, as we increase the kernel size for Transposed Convolution to \\(11 \\times 11\\) with a \\(3 \\times 3\\) small kernel in parallel, we observe that LCTC is strictly outperforming Pixel Shuffle, on both clean unperturbed images and under adversarial attacks, across all metrics used. Large Context Transposed Convolutions are either outperforming or performing at par with Nearest Neighbor interpolation. Thus we demonstrate the superior clean and adversarial performance of Large Context Transposed Convolutions operation over other commonly used techniques." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.403, + 0.162 + ], + "angle": 0, + "content": "5.3 Disparity Estimation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.17, + 0.788, + 0.291 + ], + "angle": 0, + "content": "To show that the observations extend from image restorations and segmentation to other tasks, we conduct additional experiments for disparity estimation. We consider the STTR-light [50] architecture, built from STTR, which is a recent state-of-the-art vision-transformer based model for disparity estimation and occlusion detection. To implement the proposed modification, we alter the kernel sizes in the transposed convolution layers used for pixel-wise upsampling in the \"feature extractor\" module of the architecture from \\(3 \\times 3\\) kernels to larger kernels. We conduct evaluations on FlyingThings3D [60] and keep all other details as implemented in [50]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.292, + 0.452, + 0.44 + ], + "angle": 0, + "content": "In Table 6, we report the improvements in performance due to our architecture modification of increasing the size of the transposed convolution kernels used for upsampling, from the \\(3 \\times 3\\) in the baseline model to \\(7 \\times 7\\) (LCTC). Similar to previous applications, the increased kernel sizes with parallel \\(3 \\times 3\\) kernels further facilitate" + }, + { + "type": "table_caption", + "bbox": [ + 0.46, + 0.299, + 0.788, + 0.369 + ], + "angle": 0, + "content": "Table 6: Comparison of performance of STTR-light architecture with different sized kernels in transposed convolution for upsampling the feature maps in the feature extractor (lower is better). The entire set of results is provided as Tab. 17 in Appendix D.1." + }, + { + "type": "table", + "bbox": [ + 0.465, + 0.37, + 0.782, + 0.43 + ], + "angle": 0, + "content": "
TransposedConvolution KernelsTest Accuracy3-Step PGD attack
epe↓3px error↓epe↓3px error↓
STTR-light [50] reported0.51.54--
3×3 [50] reproduced0.49271.544.0518.5
LCTC: 7×7 + 3×3 (Ours)0.47881.504.0218.3
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.442, + 0.788, + 0.503 + ], + "angle": 0, + "content": "to stabilize the model when attacked, as evaluated here for 3 attack iterations using PGD with \\(\\epsilon \\approx \\frac{8}{255}\\) on the disparity loss. Indicating that larger kernels in the transposed convolutions can better decode learned representations from the encoder regardless of the specific downstream task. We provide visual results in Appendix D.1." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.524, + 0.345, + 0.54 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.554, + 0.788, + 0.688 + ], + "angle": 0, + "content": "We provide conclusive reasoning and empirical evidence for our hypotheses on the importance of context during upsampling. While increasing the size of convolutions during upsampling (LCTC) increases prediction stability, increasing the size of those convolution layers without upsampling does not benefit the network. This indicates that observations made for increased context during encoding do not translate to decoding. Further, we show that our simple LCTC can be directly incorporated into recent models, yielding better stability even in ViT-based architectures like Restormer, NAFNet, and STTR-light as well as in classical CNNs. Our observations are consistent across several architectures and downstream tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Limitations. Current metrics for measuring performance do not completely account for spectral artifacts. Spectral artifacts begin affecting these metrics only when they become pronounced such as under adversarial attacks, and here LCTC consistently performs better across tasks and architectures. Ideally, we would want infinitely large kernels, however, with increasing kernel size and task complexity, training extremely large kernels can be challenging. Thus, in this work, while having ablated over kernels as large as \\(31 \\times 31\\), we propose using kernels only as large as \\(7 \\times 7\\) to \\(11 \\times 11\\) for good practical trade-offs. Further improvements might be possible when jointly optimizing the encoder and decoder. Moreover, there might exist other factors that contribute to the introduction and existence of spectral artifacts such as spatial bias." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.77, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.146, + 0.387, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.175, + 0.787, + 0.234 + ], + "angle": 0, + "content": "Margret Keuper acknowledges funding by the DFG Research Unit 5336 - Learning to Sense. The OMNI cluster of the University of Siegen was used for some of the initial computations. Additionally, Shashank Agnihotri would like to thank Dr. Bin Zhao for his help in translating [75]." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.256, + 0.312, + 0.271 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.284, + 0.786, + 0.325 + ], + "angle": 0, + "content": "1. Agnihotri, S., Gandikota, K.V., Grabinski, J., Chandramouli, P., Keuper, M.: On the unreasonable vulnerability of transformers for image restoration-and an easy fix. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3707-3717 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.326, + 0.786, + 0.352 + ], + "angle": 0, + "content": "2. Agnihotri, S., Grabinski, J., Keuper, J., Keuper, M.: Beware of aliases–signal preservation is crucial for robust image restoration. arXiv preprint arXiv:2406.07435 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.353, + 0.786, + 0.379 + ], + "angle": 0, + "content": "3. Agnihotri, S., Jung, S., Keuper, M.: CosPGD: A unified white-box adversarial attack for pixel-wise prediction tasks. In: International Conference on Machine Learning (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.38, + 0.786, + 0.419 + ], + "angle": 0, + "content": "4. Aitken, A., Ledig, C., Theis, L., Caballero, J., Wang, Z., Shi, W.: Checkerboard artifact free sub-pixel convolution: A note on sub-pixel convolution, resize convolution and convolution resize. arXiv preprint arXiv:1707.02937 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.786, + 0.446 + ], + "angle": 0, + "content": "5. Ba, J.L., Kiros, J.R., Hinton, G.E.: Layer normalization. arXiv preprint arXiv:1607.06450 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.447, + 0.786, + 0.488 + ], + "angle": 0, + "content": "6. Badki, A., Troccoli, A., Kim, K., Kautz, J., Sen, P., Gallo, O.: Bi3D: Stereo depth estimation via binary classifications. In: The IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.489, + 0.786, + 0.528 + ], + "angle": 0, + "content": "7. Badrinarayanan, V., Kendall, A., Cipolla, R.: Segnet: A deep convolutional encoder-decoder architecture for image segmentation. IEEE transactions on pattern analysis and machine intelligence 39(12), 2481-2495 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.53, + 0.786, + 0.555 + ], + "angle": 0, + "content": "8. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.556, + 0.786, + 0.569 + ], + "angle": 0, + "content": "9. Brigham, E.O., Morrow, R.: The fast fourier transform. IEEE spectrum 4(12), 63-70 (1967)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.57, + 0.786, + 0.595 + ], + "angle": 0, + "content": "10. Brunton, S.L., Kutz, J.N.: Data-driven science and engineering: Machine learning, dynamical systems, and control. Cambridge University Press (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.597, + 0.786, + 0.636 + ], + "angle": 0, + "content": "11. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.637, + 0.786, + 0.663 + ], + "angle": 0, + "content": "12. Carlini, N., Wagner, D.: Towards evaluating the robustness of neural networks. In: 2017 IEEE symposium on security and privacy (sp). pp. 39-57. IEEE (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.664, + 0.786, + 0.704 + ], + "angle": 0, + "content": "13. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in neural information processing systems 33, 9912-9924 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.705, + 0.786, + 0.745 + ], + "angle": 0, + "content": "14. Chandrasegaran, K., Tran, N.T., Cheung, N.M.: A closer look at fourier spectrum discrepancies for cnn-generated images detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7200-7209 (June 2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.746, + 0.786, + 0.772 + ], + "angle": 0, + "content": "15. Chang, J.R., Chen, Y.S.: Pyramid stereo matching network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5410-5418 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.773, + 0.786, + 0.799 + ], + "angle": 0, + "content": "16. Chen, L., Chu, X., Zhang, X., Sun, J.: Simple baselines for image restoration. In: European Conference on Computer Vision. pp. 17-33. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.8, + 0.786, + 0.84 + ], + "angle": 0, + "content": "17. Ding, X., Zhang, X., Han, J., Ding, G.: Scaling up your kernels to 31x31: Revisiting large kernel design in cnns. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11963-11975 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.284, + 0.786, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.38, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "18. Dosovitskiy, A., Brox, T.: Generating images with perceptual similarity metrics based on deep networks. Advances in neural information processing systems 29 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.177, + 0.787, + 0.215 + ], + "angle": 0, + "content": "19. Dosovitskiy, A., Brox, T.: Inverting visual representations with convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4829-4837 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.786, + 0.259 + ], + "angle": 0, + "content": "20. Dosovitskiy, A., Fischer, P., Ilg, E., Hausser, P., Hazirbas, C., Golkov, V., Van Der Smagt, P., Cremers, D., Brox, T.: Flownet: Learning optical flow with convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 2758-2766 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.26, + 0.786, + 0.3 + ], + "angle": 0, + "content": "21. Dosovitskiy, A., Springenberg, J.T., Tatarchenko, M., Brox, T.: Learning to generate chairs, tables and cars with convolutional networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(4), 692-705 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.301, + 0.786, + 0.327 + ], + "angle": 0, + "content": "22. Dumoulin, V., Visin, F.: A guide to convolution arithmetic for deep learning. arXiv preprint arXiv:1603.07285 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.786, + 0.37 + ], + "angle": 0, + "content": "23. Durall, R., Keuper, M., Keuper, J.: Watch your up-convolution: Cnn based generative deep neural networks are failing to reproduce spectral distributions. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 7890–7899 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.786, + 0.411 + ], + "angle": 0, + "content": "24. Everingham, M., Van Gool, L., Williams, C.K.I., Winn, J., Zisserman, A.: The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results. http://www.pascalnetwork.org/challenges/VOC/voc2012/workshop/index.html (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.786, + 0.438 + ], + "angle": 0, + "content": "25. Forsyth, D.A., Ponce, J.: Computer vision: a modern approach. Prentice Hall professional technical reference (2002)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.786, + 0.466 + ], + "angle": 0, + "content": "26. Gal, R., Hochberg, D.C., Bermano, A., Cohen-Or, D.: SWAGAN: A style-based wavelet-driven generative model. ACM Transactions on Graphics (TOG) 40(4), 1-11 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.786, + 0.508 + ], + "angle": 0, + "content": "27. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.508, + 0.786, + 0.536 + ], + "angle": 0, + "content": "28. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.537, + 0.786, + 0.577 + ], + "angle": 0, + "content": "29. Grabinski, J., Jung, S., Keuper, J., Keuper, M.: Frequencylowcut pooling-plug and play against catastrophic overfitting. In: European Conference on Computer Vision. pp. 36-57. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.786, + 0.605 + ], + "angle": 0, + "content": "30. Grabinski, J., Keuper, J., Keuper, M.: Aliasing and adversarial robust generalization of cnns. Machine Learning pp. 1-27 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.786, + 0.646 + ], + "angle": 0, + "content": "31. Grabinski, J., Keuper, J., Keuper, M.: Aliasing coincides with cnns vulnerability towards adversarial attacks. In: The AAAI-22 Workshop on Adversarial Machine Learning and Beyond. pp. 1-5 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.786, + 0.674 + ], + "angle": 0, + "content": "32. Grabinski, J., Keuper, J., Keuper, M.: Fix your downsampling asap! be natively more robust via aliasing and spectral artifact free pooling (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.786, + 0.728 + ], + "angle": 0, + "content": "33. Grabinski, J., Keuper, J., Keuper, M.: As large as it gets - studying infinitely large convolutions via neural implicit frequency filters. Transactions on Machine Learning Research (2024), https://openreview.net/forum?id=xRy1YRcHWj, featured Certification" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.729, + 0.786, + 0.771 + ], + "angle": 0, + "content": "34. Gu, J., Zhao, H., Tresp, V., Torr, P.H.: Segpgd: An effective and efficient adversarial attack for evaluating and boosting segmentation robustness. In: European Conference on Computer Vision. pp. 308-325. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.786, + 0.812 + ], + "angle": 0, + "content": "35. Guo, M.H., Lu, C.Z., Hou, Q., Liu, Z., Cheng, M.M., Hu, S.M.: Segnext: Rethinking convolutional attention design for semantic segmentation. Advances in Neural Information Processing Systems 35, 1140-1156 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.786, + 0.84 + ], + "angle": 0, + "content": "36. Hariharan, B., Arbeláez, P., Bourdev, L., Maji, S., Malik, J.: Semantic contours from inverse detectors. In: 2011 international conference on computer vision. pp. 991-998. IEEE (2011)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "37. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.191, + 0.787, + 0.245 + ], + "angle": 0, + "content": "38. He, Y., Yu, N., Keuper, M., Fritz, M.: Beyond the spectrum: Detecting deepfakes via resynthesis. In: Zhou, Z.H. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. pp. 2534–2541. International Joint Conferences on Artificial Intelligence Organization (8 2021), main Track" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.247, + 0.787, + 0.288 + ], + "angle": 0, + "content": "39. Hendrycks, D., Dietterich, T.: Benchmarking neural network robustness to common corruptions and perturbations. Proceedings of the International Conference on Learning Representations (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.29, + 0.787, + 0.317 + ], + "angle": 0, + "content": "40. Hendrycks, D., Gimpel, K.: Gaussian error linear units (gelus). arXiv preprint arXiv:1606.08415 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.318, + 0.787, + 0.358 + ], + "angle": 0, + "content": "41. Hoffmann, J., Agnihotri, S., Saikia, T., Brox, T.: Towards improving robustness of compressed cnns. In: ICML Workshop on Uncertainty and Robustness in Deep Learning (UDL) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.361, + 0.787, + 0.401 + ], + "angle": 0, + "content": "42. Hossain, M.T., Teng, S.W., Lu, G., Rahman, M.A., Sohel, F.: Anti-aliasing deep image classifiers using novel depth adaptive blurring and activation function. Neurocomputing 536, 164-174 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.403, + 0.787, + 0.444 + ], + "angle": 0, + "content": "43. Ilg, E., Mayer, N., Saikia, T., Keuper, M., Dosovitskiy, A., Brox, T.: Flownet 2.0: Evolution of optical flow estimation with deep networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2462-2470 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.446, + 0.787, + 0.472 + ], + "angle": 0, + "content": "44. Jung, S., Keuper, M.: Spectral distribution aware image generation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 35, pp. 1734-1742 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.474, + 0.787, + 0.501 + ], + "angle": 0, + "content": "45. Jung, S., Lukasik, J., Keuper, M.: Neural architecture design and robustness: A dataset. In: Eleventh International Conference on Learning Representations. OpenReview.net (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.503, + 0.787, + 0.543 + ], + "angle": 0, + "content": "46. Karras, T., Aittala, M., Laine, S., Härkönen, E., Hellsten, J., Lehtinen, J., Aila, T.: Alias-free generative adversarial networks. Advances in Neural Information Processing Systems 34, 852-863 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.545, + 0.787, + 0.585 + ], + "angle": 0, + "content": "47. Khayatkhoei, M., Elgammal, A.: Spatial frequency bias in convolutional generative adversarial networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 7152-7159 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.587, + 0.787, + 0.614 + ], + "angle": 0, + "content": "48. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.616, + 0.787, + 0.656 + ], + "angle": 0, + "content": "49. Kurakin, A., Goodfellow, I.J., Bengio, S.: Adversarial machine learning at scale. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=BJm4T4Kgx" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.657, + 0.787, + 0.712 + ], + "angle": 0, + "content": "50. Li, Z., Liu, X., Drenkow, N., Ding, A., Creighton, F.X., Taylor, R.H., Unberath, M.: Revisiting stereo depth estimation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 6197-6206 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.714, + 0.787, + 0.755 + ], + "angle": 0, + "content": "51. Liu, S., Chen, T., Chen, X., Chen, X., Xiao, Q., Wu, B., Kärkkäinen, T., Pechenizkiy, M., Mocanu, D., Wang, Z.: More convnets in the 2020s: Scaling up kernels beyond 51x51 using sparsity. arXiv preprint arXiv:2207.03620 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.787, + 0.797 + ], + "angle": 0, + "content": "52. Liu, S., Deng, W.: Very deep convolutional neural network based image classification using small training sample size. In: 2015 3rd IAPR Asian conference on pattern recognition (ACPR). pp. 730-734. IEEE (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "53. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.189 + ], + "angle": 0, + "content": "54. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11976-11986 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.231 + ], + "angle": 0, + "content": "55. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.231, + 0.786, + 0.272 + ], + "angle": 0, + "content": "56. Loshchilov, I., Hutter, F.: SGDR: Stochastic gradient descent with warm restarts. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=Skq89Scxx" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.786, + 0.313 + ], + "angle": 0, + "content": "57. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=Bkg6RiCqY7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.314, + 0.786, + 0.342 + ], + "angle": 0, + "content": "58. Maiya, S.R., Ehrlich, M., Agarwal, V., Lim, S.N., Goldstein, T., Shrivastava, A.: A frequency perspective of adversarial robustness (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.343, + 0.786, + 0.369 + ], + "angle": 0, + "content": "59. Mathew, A., Patra, A., Mathew, J.: Monocular depth estimators: Vulnerabilities and attacks. ArXiv abs/2005.14302 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.37, + 0.786, + 0.424 + ], + "angle": 0, + "content": "60. Mayer, N., Ilg, E., Hausser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A large dataset to train convolutional networks for disparity, optical flow, and scene flow estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4040-4048 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.786, + 0.467 + ], + "angle": 0, + "content": "61. Moosavi-Dezfooli, S.M., Fawzi, A., Frossard, P.: Deepfool: a simple and accurate method to fool deep neural networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2574–2582 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.468, + 0.786, + 0.522 + ], + "angle": 0, + "content": "62. Mosleh, A., Langlois, J.M.P., Green, P.: Image deconvolution ringing artifact detection and removal via psf frequency analysis. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) Computer Vision - ECCV 2014. pp. 247-262. Springer International Publishing, Cham (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.523, + 0.786, + 0.55 + ], + "angle": 0, + "content": "63. Nah, S., Kim, T.H., Lee, K.M.: Deep multi-scale convolutional neural network for dynamic scene deblurring. In: CVPR (July 2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.786, + 0.577 + ], + "angle": 0, + "content": "64. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proceedings of the IEEE international conference on computer vision. pp. 1520-1528 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.786, + 0.604 + ], + "angle": 0, + "content": "65. Odena, A., Dumoulin, V., Olah, C.: Deconvolution and checkerboard artifacts. Distill 1(10), e3 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.605, + 0.786, + 0.646 + ], + "angle": 0, + "content": "66. Peng, C., Zhang, X., Yu, G., Luo, G., Sun, J.: Large kernel matters - improve semantic segmentation by global convolutional network. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (July 2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.786, + 0.688 + ], + "angle": 0, + "content": "67. Pervin, M., Tao, L., Huq, A., He, Z., Huo, L., et al.: Adversarial attack driven data augmentation for accurate and robust medical image segmentation. arXiv preprint arXiv:2105.12106 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.786, + 0.715 + ], + "angle": 0, + "content": "68. Radford, A., Metz, L., Chintala, S.: Unsupervised representation learning with deep convolutional generative adversarial networks. arXiv preprint arXiv:1511.06434 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.786, + 0.757 + ], + "angle": 0, + "content": "69. Radosavovic, I., Kosaraju, R.P., Girshick, R., He, K., Dollar, P.: Designing network design spaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.758, + 0.786, + 0.813 + ], + "angle": 0, + "content": "70. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.814, + 0.786, + 0.84 + ], + "angle": 0, + "content": "71. Scheurer, E., Schmalfuss, J., Lis, A., Bruhn, A.: Detection defenses: An empty promise against adversarial patch attacks on optical flow. arXiv preprint arXiv:2310.17403 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.448, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Feature Stability during Upsampling" + }, + { + "type": "page_number", + "bbox": [ + 0.77, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "72. Schmalfuss, J., Mehl, L., Bruhn, A.: Attacking motion estimation with adversarial snow. arXiv preprint arXiv:2210.11242 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.202 + ], + "angle": 0, + "content": "73. Schmalfuss, J., Mehl, L., Bruhn, A.: Distracting downpour: Adversarial weather attacks for motion estimation (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.785, + 0.231 + ], + "angle": 0, + "content": "74. Schmalfuss, J., Scholze, P., Bruhn, A.: A perturbation-constrained adversarial attack for evaluating the robustness of optical flow (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.232, + 0.785, + 0.258 + ], + "angle": 0, + "content": "75. segcv: segcv/pspnet. https://github.com/segcv/PSPNet/blob/master/Train.md (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.26, + 0.785, + 0.285 + ], + "angle": 0, + "content": "76. Shannon, C.E.: Communication in the presence of noise. Proceedings of the IRE 37(1), 10-21 (1949)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.287, + 0.785, + 0.327 + ], + "angle": 0, + "content": "77. Shi, W., Caballero, J., Huszar, F., Totz, J., Aitken, A.P., Bishop, R., Ruekert, D., Wang, Z.: Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.329, + 0.785, + 0.369 + ], + "angle": 0, + "content": "78. Si-Yao, L., Ren, D., Yin, Q.: Understanding kernel size in blind deconvolution. In: 2019 IEEE Winter Conference on Applications of Computer Vision (WACV). pp. 2068-2076. IEEE (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.371, + 0.785, + 0.396 + ], + "angle": 0, + "content": "79. Smith III, J.O.: Physical audio signal processing: For virtual musical instruments and audio effects. (No Title) (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.398, + 0.785, + 0.438 + ], + "angle": 0, + "content": "80. Sommerhoff, H., Agnihotri, S., Saleh, M., Moeller, M., Keuper, M., Kolb, A.: Differentiable sensor layouts for end-to-end learning of task-specific camera parameters. arXiv preprint arXiv:2304.14736 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.439, + 0.785, + 0.466 + ], + "angle": 0, + "content": "81. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.468, + 0.785, + 0.494 + ], + "angle": 0, + "content": "82. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.496, + 0.785, + 0.536 + ], + "angle": 0, + "content": "83. Teed, Z., Deng, J.: Raft: Recurrent all-pairs field transforms for optical flow. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part II 16. pp. 402-419. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.537, + 0.785, + 0.577 + ], + "angle": 0, + "content": "84. Touvron, H., Cord, M., Douze, M., Massa, F., Sablayrolles, A., Jégou, H.: Training data-efficient image transformers & distillation through attention. In: International conference on machine learning. pp. 10347-10357. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.579, + 0.785, + 0.618 + ], + "angle": 0, + "content": "85. Tsipras, D., Santurkar, S., Engstrom, L., Turner, A., Madry, A.: Robustness may be at odds with accuracy. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=SyxAb30cY7" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.62, + 0.785, + 0.659 + ], + "angle": 0, + "content": "86. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.661, + 0.785, + 0.688 + ], + "angle": 0, + "content": "87. Xu, L., Ren, J.S., Liu, C., Jia, J.: Deep convolutional neural network for image deconvolution. Advances in neural information processing systems 27 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.689, + 0.785, + 0.715 + ], + "angle": 0, + "content": "88. Yamanaka, K., Matsumoto, R., Takahashi, K., Fujii, T.: Adversarial patch attacks on monocular depth estimation networks. IEEE Access 8, 179094-179104 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.717, + 0.785, + 0.757 + ], + "angle": 0, + "content": "89. Zamir, S.W., Arora, A., Khan, S., Hayat, M., Khan, F.S., Yang, M.H.: Restormer: Efficient transformer for high-resolution image restoration. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5728-5739 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.758, + 0.785, + 0.784 + ], + "angle": 0, + "content": "90. Zhang, H., Yu, Y., Jiao, J., Xing, E., El Ghaoui, L., Jordan, M.: Theoretically principled trade-off between robustness and accuracy. In: ICML (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.786, + 0.727, + 0.798 + ], + "angle": 0, + "content": "91. Zhang, R.: Making convolutional networks shift-invariant again. In: ICML (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.8, + 0.681, + 0.812 + ], + "angle": 0, + "content": "92. Zhao, H.: semseg. https://github.com/hszhao/semseg (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "93. Zhao, H., Shi, J., Qi, X., Wang, X., Jia, J.: Pyramid scene parsing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2881-2890 (2017)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "20" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.116, + 0.381, + 0.129 + ], + "angle": 0, + "content": "S. Agnihotri et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "94. Zhao, H., Zhang, Y., Liu, S., Shi, J., Loy, C.C., Lin, D., Jia, J.: PSANet: Point-wise spatial attention network for scene parsing. In: ECCV (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.176, + 0.787, + 0.203 + ], + "angle": 0, + "content": "95. Zou, X., Xiao, F., Yu, Z., Lee, Y.J.: Delving deeper into anti-aliasing in convnets. In: BMVC (2020)" + }, + { + "type": "list", + "bbox": [ + 0.216, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_origin.pdf b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..eb8490b7d37d35982bc81ddae347c6565cbb5ff8 --- /dev/null +++ b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/84962bfb-afc7-4e06-aea4-c3159e0b9e17_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fe3abcee03f5515b673759c1d6acd31ceed54ca30c4d8c86e6d9d515b2563f8b +size 8839449 diff --git a/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/full.md b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/full.md new file mode 100644 index 0000000000000000000000000000000000000000..75d4c50fd5a2ebf9da65297c3f0e5226f814629b --- /dev/null +++ b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/full.md @@ -0,0 +1,342 @@ +# Improving Feature Stability during Upsampling – Spectral Artifacts and the Importance of Spatial Context + +Shashank Agnihotri1, Julia Grabinski1,2,3, and Margret Keuper1,4 + +1 Data and Web Science Group, University of Mannheim + +2 Fraunhofer ITWM, Kaiserslautern + +$^{3}$ Institute for Machine Learning and Analytics (IMLA), Offenburg University + +4 Max-Planck-Institute for Informatics, Saarland Informatics Campus + +{shashank.agnihotri, julia.grabinski, keuper}@uni-mannheim.de + +Abstract. Pixel-wise predictions are required in a wide variety of tasks such as image restoration, image segmentation, or disparity estimation. Common models involve several stages of data resampling, in which the resolution of feature maps is first reduced to aggregate information and then increased to generate a high-resolution output. Previous works have shown that resampling operations are subject to artifacts such as aliasing. During downsampling, aliases have been shown to compromise the prediction stability of image classifiers. During upsampling, they have been leveraged to detect generated content. Yet, the effect of aliases during upsampling has not yet been discussed w.r.t. the stability and robustness of pixel-wise predictions. While falling under the same term (aliasing), the challenges for correct upsampling in neural networks differ significantly from those during downsampling: when downsampling, some high frequencies can not be correctly represented and have to be removed to avoid aliases. However, when upsampling for pixel-wise predictions, we actually require the model to restore such high frequencies that can not be encoded in lower resolutions. The application of findings from signal processing is therefore a necessary but not a sufficient condition to achieve the desirable output. In contrast, we find that the availability of large spatial context during upsampling allows to provide stable, high-quality pixel-wise predictions, even when fully learning all filter weights. + +# 1 Introduction + +Most computer vision models addressing perceptual tasks such as image restoration [16, 89], semantic segmentation [7, 35, 70], optical flow estimation [20, 43, 83] and disparity estimation [6, 11, 50] in realistic scenarios are required to behave in a stable way, at least under mild corruptions. Interestingly, for the slightly simpler task of image classification, recent progress has shown that a model's robustness does not only depend on its training but also on its architecture [29-32, 41, 42, 45, 58, 91, 95]. Specifically, aliasing, i.e. spectral artifacts that emerge from naive image resampling, have shown to compromise prediction stability, in particular in the context of classical convolutional models [33, 37, 48, 52, 69, 80, 82] which predominantly use small filter kernels in combination with severe data aggregation during downsampling [30, 58]. Principled cures + +![](images/fc525b5856a7973b4e68e320d1436301dac33a9726dd012f3b72c7765fd29229.jpg) +Fig. 1: Image restoration example using NAFNet [16] variants on GoPro [63]. Upsampling techniques like Pixel Shuffle [77] (first row) and transposed convolution [22] using small learnable filters $(2\times 2$ or $3\times 3)$ (second row) are used by most prior art. Both lead to spectral artifacts for which the model needs to compensate. The clean (in-domain) restored images look appealing - while adversaries (here 5-step PGD [49] attack) can leverage aliases such that artifacts become easily visible. When observed in the frequency domain, they manifest as repeating peaks all over the spectra. Based on sampling theoretic considerations, we propose Large Context Transposed Convolutions $(7\times 7$ or larger) (bottom row). They significantly increase the model's stability during upsampling, observable in the restored image under attack and the frequency spectrum. + +usually refer to basic concepts from signal processing such as anti-aliasing by blurring before downsampling [29, 91]. While this discussion on classifier (i.e. encoder) networks is insightful, it does not provide a recipe to counteract aliases emerging during upsampling for pixel-wise prediction tasks such as image restoration. Specifically, naive upsampling introduces artifacts in the feature representation, such as grid artifacts [4, 65] or ringing artifacts [62]. As shown in Fig. 1, these artifacts, an inherent property of inadequate upsampling (refer Sec. 3) are not always visible to the human eye, are accentuated under adversarial attack such that they can also be seen with a human eye. We leverage this effect in our analysis. When observed in the frequency domain, these artifacts are apparent as multiple peaks, i.e. aliases of the original data. + +While for downsampling, signal processing laws basically prescribe which part of the information can be retained at lower resolutions without aliases [76], "correct", alias-free upsampling can not restore the original high-resolution information. Thus, learning to upsample feature maps such that the feature stability is not harmed is of paramount importance. In this paper, we therefore first provide a synopsis of different aliases that emerge from different upsampling techniques. Based on this work, we propose a simple, transposed convolution-based upsampling block. We study our proposed operation in the context of various models, from image restoration [16,89] over semantic segmentation [70] to disparity estimation [50]. + +Our main contributions can be summarized as follows: + +- Motivated by sampling theory [76], we study upsampling in models for diverse pixel-wise prediction tasks. We find that the availability of large kernels in transposed convolutions helps the feature stability and significantly improves over standard, small kernel transposed convolutions as well as pixel shuffle [77]. +- While large kernels are required to allow for reduced aliasing and to provide the necessary spatial context for increasing the resolution, additional small kernels can add details and remain useful. +- We provide empirical evidence for our findings on diverse architectures (including vision transformer-based architectures) and downstream tasks such as image restoration, semantic segmentation, and depth estimation. +- We show empirically that our proposed upsampling operation complements other feature stability-increasing approaches like adversarial training. + +# 2 Related Work + +In the following, we discuss recent challenges for neural networks regarding artifacts introduced by spatial sampling methods [4, 62, 65]. Further, we review related work on the most recent use of large kernels in CNNs. Finally, we provide an overview of adversarial attacks to gauge the quality of representations learned by a network. + +Spectral Artifacts. Several prior works have studied the effect of downsampling operations on model robustness, e.g. [2, 29, 30, 42, 46, 91, 95]. Inspired by [30], [29] propose an aliasing-free downsampling in the frequency domain which translates to an infinitely large blurring filter before downsampling in the spatial domain. Thus, for image classification, using large filter kernels has been shown to remove artifacts from downsampled representations and it leads to favorable robustness in all these cases [30, 42, 46]. However, all these works focus on improving the properties of encoder networks. + +Models that use transposed convolutions in their decoders5 are widely used for tasks like image generation [27, 68] or segmentation [7, 55, 64, 70]. However, in simple transposed convolutions, the convolution kernels overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Further, image resampling can lead to aliases that become visible as ringing artifacts [76]. In the context of deepFake detection, image generation, and deblurring, several works analyzed [14, 18, 21, 23, 38, 44, 47] and improved upsampling techniques [26, 46, 78, 87] to reduce visual artifacts. + +Some architectures like PSPNet [93], PSANet [94], or PSMNet [15] simply use bilinear interpolation operations for upsampling the feature representations. While this reduces grid artifacts as bilinear interpolation smoothens out the feature maps, it also has major drawbacks as they sample incorrectly. These new artifacts are sometimes visible as overly smooth predictions, in particular, apparent in the PSPNet segmentation masks. The segmentation masks over-smoothen around edges and often miss out on thin + +details (predictions showing these are included in the Appendix B.4). This observation already shows why image encoding and decoding have to be considered separately when it comes to sampling artifacts. While during encoding, artifacts can be reduced by blurring, the main purpose of decoder networks is reducing blur in many applications, to create fine-granular, pixel-wise accurate outputs, which our approach facilitates. + +Large Kernels. For image classification, [54] showed that using large kernels like $7 \times 7$ in the CNN convolution layer can outperform self-attention based vision transformers [53,84]. In [17,33,35,51,66], the receptive field of the convolution operations was further expanded by using larger kernels, up to $31 \times 31$ and $51 \times 51$ . These larger receptive fields provide more context to the encoder, leading to better performance on classification, segmentation, or object detection tasks. [17,51] use a small kernel in parallel to capture the local context along with the global context. In contrast to these works, which are limited to exploring increased context only during encoding, we investigate if larger kernels can benefit upsampling when considering pixel-wise prediction tasks such as image restoration or segmentation. + +Adversarial Attacks. The purpose of adversarial attacks is to reveal neural networks' weaknesses [3, 30, 74, 81] by perturbing pixel values in the input image [12, 28, 49]. These perturbations should lead to a false prediction even though the changes are hardly visible [28, 61, 81]. Especially attacks that have access to the network's architecture and weights, so-called white-box attacks, are a common approach to analyzing weaknesses within the networks' structure [12, 28]. They employ the gradient of the network to optimize the perturbation, which is bounded within an $\epsilon$ -ball of the original image, i.e. $\epsilon$ defines the strength of the attack. Most adversarial attacks are proposed to attack classification networks like the one-step Fast Gradient Sign Method (FGSM) [28] or the multi-step Projected Gradient Descent (PGD) attack [49]. However, they can be adapted to other tasks as e.g. in [59, 67, 88]. Furthermore, there are dedicated methods like SegPGD [34] for attacks on semantic segmentation models or PCFA [74] and [71, 73] for optical flow models and CosPGD [3] and others [72] for other pixel-wise prediction tasks. We evaluate the stability of upsampled features using adversarial attacks such as PGD and CosPGD for image restoration and FGSM and SegPGD for segmentation. + +# 3 Spectral Upsampling Artifacts and How They Can Be Reduced + +Following, we first theoretically review artifacts that are caused during upsampling from a signal processing aspect. We start by describing the spectral artifacts [76] induced by the bed of nails interpolation, similar to the discussion in [23], and then extend the theoretical analysis to further upsampling schemes. Second, we derive from this analysis two hypotheses for the prediction stability of encoder-decoder networks, depending on their architecture. These hypotheses will motivate the remainder of the manuscript. + +Consider, w.l.o.g., a one-dimensional signal $I$ and its discrete Fourier Transform $\mathcal{F}(I)$ with $k$ being the index of discrete frequencies + +$$ +\mathcal {F} (I) _ {k} = \sum_ {j = 0} ^ {N - 1} e ^ {- 2 \pi i \cdot \frac {j k}{N}} \cdot I _ {j}, \quad \mathrm {f o r} \quad k = 0, \ldots , N - 1. +$$ + +During decoding, we need to upsample the spatial resolution of $I$ to get $I^{\mathrm{up}}$ . For example for an upsampling factor of 2 (often used in DNNs [1, 16, 19, 82, 89]) we have for $\bar{k} = 0,\dots ,2N - 1$ + +$$ +\mathcal {F} (I) _ {\bar {k}} ^ {\mathrm {u p}} = \sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \pi i \cdot \frac {j \bar {k}}{2 \cdot N}} \cdot I _ {j} ^ {\mathrm {u p}} = \sum_ {j = 0} ^ {N - 1} e ^ {- 2 \pi i \cdot \frac {2 \cdot j \bar {k}}{2 \cdot N}} I _ {j} + \sum_ {j = 0} ^ {N - 1} e ^ {- 2 \pi i \cdot \frac {(2 j + 1) \bar {k}}{2 \cdot N}} \bar {I} _ {j}, \quad (1) +$$ + +where $\bar{I}_j = 0$ in bed of nails interpolation. Therefore, the second term in (1) can be dropped and the first term resembles the original $\mathcal{F}(I)$ . Equivalently, we can rewrite Eq. (1), for $\bar{I}_j = 0$ , using a Dirac impulse comb as + +$$ +(1) = \sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \pi i \cdot \frac {j k}{2 \cdot N}} \cdot \sum_ {t = - \infty} ^ {\infty} I _ {j} ^ {\mathrm {u p}} \cdot \delta (j - 2 t). \tag {2} +$$ + +If we now apply the pointwise multiplication with the Dirac impulse comb as convolution in the Fourier domain (assuming periodicity) [25], it is + +$$ +\begin{array}{l} \mathcal {F} (I) _ {\bar {k}} ^ {\mathrm {u p}} = \frac {1}{2} \sum_ {t = - \infty} ^ {\infty} \left(\sum_ {j = - \infty} ^ {\infty} e ^ {- 2 \pi i \cdot \frac {j \bar {k}}{2 N}} I _ {j} ^ {\mathrm {u p}}\right) \left(\bar {k} - \frac {t}{2}\right) \tag {3} \\ \stackrel {(1)} {=} \frac {1}{2} \sum_ {t = - \infty} ^ {\infty} \left(\sum_ {j = - \infty} ^ {\infty} e ^ {- 2 \pi i \cdot \frac {j \bar {k}}{N}} \cdot I _ {j}\right) \left(\bar {k} - \frac {t}{2}\right) = \frac {1}{2} \sum_ {t = - \infty} ^ {\infty} \mathcal {F} (I) _ {\bar {k}} \left(\bar {k} - \frac {t}{2}\right). \\ \end{array} +$$ + +We can see that such upsampling creates high-frequency replica of the signal at $\frac{t}{2}$ for $t$ in $-\infty, \ldots, \infty$ in $\mathcal{F}(I)^{\mathrm{up}}$ and spatial frequencies apparent beyond array positions $\frac{N}{2}$ will be impacted by spectral artifacts if no appropriate countermeasures are taken. + +A standard countermeasure is interpolation of the inserted values with $\bar{I}_j = \frac{I_{j-1} + I_j}{2}$ for linear interpolation in Eq. (1). Linear interpolation (and in consequence bi-linear interpolation in 2D signals) corresponds to a convolution with a triangular impulse with width 2, which can be represented as the convolution of two rectangle functions with width 1. Accordingly, the Fourier response for frequency $\ell$ , $\mathcal{F}_{\ell}$ of the triangular impulse is a squared sinc function ( $\mathrm{sinc}^2(\ell)$ ) with $\mathrm{sinc}(\ell) = \frac{\sin(\pi\ell)}{\pi\ell}$ . Since the output signal after interpolation is still discrete, i.e. sampled with sampling rate $\frac{1}{2}$ , a replica of the interpolation function, the $\mathrm{sinc}^2$ function, will appear with rate 2 in the resulting spectrum (see also Fig. 2). The resulting interpolated signal is not optimal for several reasons. Most importantly, the spectrum of the interpolation function is not flat although the estimated values appear overly smooth (see Fig. 3.). This is arguably suboptimal for, for example, image restoration or segmentation tasks, where fine structural details are supposed to emerge in the upsampled data. + +Note that, in Eq. (1), pixel shuffle [77] will set $\bar{I}_j$ to completely unrelated values of a different feature map channel, leading to a highly non-smooth signal with frequencies at the band limit. The resulting issues in the spectrum are similar to the ones caused by the bed of nails interpolation. These spectral artifacts can be visually observed in Fig. 3. + +Therefore, in transposed convolutions, the interpolation function is not fixed to a predefined smoothing kernel but learned so that the resulting signal can represent fine + +![](images/483e9d42478417ee8dd5447a498aa1d40ffa1d2dca849cc3b3588f5bcd44a1d0.jpg) +Fig. 2: (Left) Linear interpolation (pink) of the samples (green) causes aliases. (Right) Optimal signal reconstruction (pink) is achieved by sinc interpolation. In practice our spatial context is limited and the interpolation function is discrete. Yet, increasing the kernel size enables the approximation of larger sinc-like structures. + +![](images/131fb698a5f2f20d136fa1ba201f0a4c7784df97c4c9ae933458aa67e779c933.jpg) +Artifact-free Ground Truth + +![](images/ff83c23c0545801c77fe48c0de1423717dd199dc6047b0b67c2a3a78a98d87f5.jpg) + +![](images/1417d635400ce59198447e04e524c461d8e3b9ee573820434920b11bc34ea9fb.jpg) + +![](images/8bc7bde927c34a1c449e02bf7095282f035ae7739407716c41977877d5d1c605.jpg) + +![](images/3b5b7e6266bade45b5fa3ffe7892e025bc4c2e87a3c9541872adca6b39c7e7da.jpg) +Zoomed-in Ground Truth +Fig.3: An image from GoPro [63] downsampled with $3 \times 3$ MaxPooling and then upsampled using various upsampling techniques. The resulting artifacts are compared on zoomed-in red box regions for better visibility. Bilinear interpolation causes over-smoothing. Bicubic interpolation causes overestimation along image boundaries while Pixel Shuffle and Nearest Neighbor cause strong grid artifacts along with discoloration. Small kernel transposed convolutions cause grid artifacts, however, on increasing kernel size we start getting better upsampling. + +![](images/140c721446f8e5fd4c2fe4fe30fa7ff7bfd848cd3b3d2f324274d4ada07bde0e.jpg) +Bicubic Interpolation +Bilinear Interpolation + +![](images/b7e51fd72f78d07a889a1aade61571a581f12e7b186c121243e9288cec4eebed.jpg) +Nearest Neighbor Interpolation +Pixel Shuffle + +![](images/139e3393d8d96d79b8ddd38c42af954d449490b13cdd157a30677618b1678de9.jpg) +Small(3×3) Transposed Conv +Large(7×7+3×3) Transposed Conv + +details after the initial bed of nails interpolation and potentially learn to add fine details. One issue is that the learned convolution kernels may overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Besides this rather technical aspect, transposed convolutions, if sufficiently large (thus also containing more context), could in principle learn to approximate correct upsampling functions. This can be understood when again looking at the Fourier representation. When interpolating, we want to increase the signal array size so that all the original information is preserved and the model can easily learn additional details. Such upsampling to preserve the information from the original low-resolution data is most easily achieved by transforming the signal to the Fourier domain, then padding the missing high-frequency parts with zeros and transforming the resulting array back to the spatial domain [79]. In the Fourier domain, this padding operation can be understood as a point-wise multiplication of the desired full spectrum with a rectangle function with width $N$ (denoted $\operatorname{rect}_N$ ). Conversely, this operation corresponds to a convolution with $\mathcal{F}^{-1}(\operatorname{rect}_N) = \frac{1}{N}\operatorname{sinc}(xN)$ in the spatial domain. While the sinc function drops off as $x$ increases, it never drops to zero. When applied for interpolation, its crests and the troughs cancel out the aliasing to a large + +extent as shown in Fig. 2. Thus, in order to allow the approximation of the optimal interpolation function, the kernel size in transposed convolutions has to be chosen as large as possible. This is, however, at odds with the "learnability" of suitable filter weights. Note that for pixel-wise predictions, models not only need to correctly interpolate, but they also need to "fill in" the missing details, which requires global as well as local context. Therefore, we expect a trade-off on the kernel size of transposed convolutions, where larger kernels improve the stability of the upsampled features and thus can reduce artifacts while the absolute prediction quality can suffer from very large learnable kernels. Sufficiently but not overly large kernels provide sufficient spatial context and are appropriate to allow for the model to learn when to blur and when to preserve/sharpen upsampled features. We illustrate this in Fig. 12 in Appendix C.4. + +From this theoretical analysis of common upsampling methods, we derive the following hypotheses that we deem relevant for encoder-decoder architectures: + +Hypothesis 1 (H1): Large Context Transposed Convolutions (LCTC) i.e. Large kernels in transposed convolution operations provide more context and reduce spectral artifacts and can therefore be leveraged by the network to facilitate better and more robust pixel-wise predictions. + +Hypothesis 2 (H2, Null Hypothesis): To leverage prediction context and reduce spectral artifacts, it is crucial to increase the size of the transposed convolution kernels (upsample using large filters). Increasing the size of normal (i.e. non-upsampling) decoder convolutions does not have this effect. + +In the following, we show the proposed, simple, and principled architecture changes that allow for studying the above hypotheses and improving robustness by improving feature stability. + +# 4 Upsampling using Large Context Transposed Convolutions + +Driven by the observations on upsampling artifacts, we investigate the advantage of larger kernel sizes during upsampling, for applications such as semantic segmentation or disparity estimation. Therefore, we keep the models' encoder part fixed and exclusively change operations in the architecture of the decoder part of the model. There, we have two design choices: Upsampling - The kernel size for the transposed convolution operations that learn upsampling, and Decoder Block - The kernel size in the convolution operations of blocks that learn to decode the features. Probing options for Upsampling works towards proving H1 while a combination of both options proves H2, i.e. shows that a pure increase in the decoder parameters does not have the desired effect. This is considered in our ablation study in Sec. 5.2. + +Figure 4 summarizes the studied options for an abstract encoder-decoder architecture like [70]. The model decoder is depicted in the green box. Operations that we consider to be executed along the red upwards arrows (Upsampling Operators) are detailed in the top right part of the figure (operations a) to c). Operations that we consider to be executed along the blue sideways arrows (Decoder Building Blocks) are depicted in the bottom right (operations d) to f). + +![](images/8ae4127bb897c8164f06fb8a67b2e5dfc414961de90c1ee810dc481e3ef85fb6.jpg) +Fig. 4: Abstract representation of an encoder-decoder architecture. While for different tasks, the implementation of the model encoder varies (including transformer-based encoders), our study focuses on the model decoder (in green). The backbone for the decoder is commonly a ResNet-like structure for feature extraction [7, 70], additionally we also used a ConvNeXt-like [54] structure. We investigate variants of different upsampling operations (the operations along the red arrows in the decoder) for fixed decoder blocks. We consider, as a probe for H1, the baseline transposed deconvolution (a) in the top right), and for LCTC an increased convolution kernel size (b) in the top right), and an increased convolution kernel with a second path using a small convolution kernel (c) in the top right). To test whether the plain increase in parameters is responsible for improved results (zero hypotheses, H2), we also ablate on the increase of convolution kernel size in the decoder block (operations along the blue arrows in the green block), as shown on the bottom right. We consider the common ResNet-like decoder building block structure (in d)) and two ConvNext-like structured backbones for the decoder building block in e) and f), where f) has an additional small convolution applied in parallel, analog to c). + +Model Details. Here, we provide details on the studied models. All implementation details are given in the Appendix A. + +Transposed Convolution Kernels for Upsampling. The upsampling operation is typically performed with small kernels ( $2 \times 2$ or $3 \times 3$ ) in the transposed convolution operations [8, 13, 70]. We aim to increase the spatial context during upsampling and to reduce grid artifacts. Thus we use Large Context Transposed Convolutions (LCTC). We either use $7 \times 7$ transposed convolutions or $11 \times 11$ transposed convolutions with a parallel $3 \times 3$ transposed convolution. Adding a parallel $3 \times 3$ kernel is motivated by [17], as large convolution kernels tend to lose local context, and thus adding a parallel small kernel helps to overcome this potential drawback (see Appendix B.3). + +Decoder Building Blocks. To verify that the measurable effects are due to the improved upsampling and not due to merely increasing the decoder capacity, we ablate on decoder convolution blocks similar to convolution blocks used in the ConvNeXt [54] basic block for encoding. While the standard ConvNeXt block uses a $7 \times 7$ depth-wise convolution, we consider $7 \times 7$ and $11 \times 11$ group-wise convolutions, followed by layers present in a ConvNeXt basic block to analyze the importance of the receptive field within the block. + +![](images/74f907f2794a09d199fedc840d5cfd6e1f259f50db4214e6f01a95188bbb11a1.jpg) +Fig. 5: NAFNet, as proposed, uses Pixel Shuffle for upsampling. We modify only the upsampling operations to transposed convolution with kernel size $(3\times 3)$ and LCTC (Ours) for comparisons. We observe, for example, under a 10-step PGD attack with $\epsilon \approx \frac{8}{255}$ our proposed H1 gains validity. More examples for [16, 89] using different attacks and budgets are in Appendix C.3. + +Table 1: Comparison of performances of different upsampling methods in SotA Image Restoration Networks on the GoPro dataset. The architectures use Pixel Shuffle for Upsampling, we propose replacing the Pixel Shuffle with Large Context Transposed Convolutions (LCTC). We report additional results using adversarial training in Tab. 15. Note, that some trade-off between clean performance and robustness is expected [85,90]. + +
NetworkUpsampling MethodTest AccuracyCosPGD (ε ≈ 8/255) attack iterationsPGD (ε ≈ 8/255) attack iterations
PSNRSSIM5102051020
PSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIM
RestomerPixel Shuffle31.990.963511.360.32369.050.22427.590.154811.410.32569.040.22347.580.1543
Transposed Conv 3×39.680.0958.240.04528.530.06288.440.06317.660.04647.720.05778.640.0527
LCTC: 7×7 + 3 × 3 (Ours)29.510.933713.690.418611.530.313610.160.248413.690.418311.540.313710.160.2483
LCTC: 11×11 + 3×3 (Ours)29.440.932414.650.425112.830.343811.480.2914.650.425312.840.344511.480.2893
NAFNetPixel Shuffle32.870.96068.670.22646.680.11275.810.061710.270.31798.660.22825.950.0714
Transposed Conv 3×331.020.94226.150.03325.950.02585.870.02336.150.03325.950.02585.870.0234
LCTC: 7×7 + 3 × 3 (Ours)31.120.943014.540.482711.050.32209.060.221314.530.482311.030.32019.080.2224
LCTC: 11×11 + 3×3 (Ours)30.770.939214.340.449211.410.32449.540.241114.340.4511.40.32369.550.2398
+ +Figure 4 (bottom right e) and f)) shows the structure of a ConvNeXt-style building block used in our work. First, a group-wise convolution is performed, followed by a LayerNorm [5] and two $1 \times 1$ convolutions which, similar to [54], creates an inverted bottleneck by first increasing the channel dimension and after a GELU [40] activation compressing the channel dimension again. We consider the ResNet-style building block (Figure 4, d)), with $3 \times 3$ convolution, yet without skip connection, as our baseline when studying this architectural design choice. + +# 5 Experiments + +In the following, we evaluate the effect of the considered upsampling operators in several applications. We start by evaluating the effect on the upsampled feature stability of recent state-of-the-art (SotA) image restoration models [16,89], then provide results on semantic segmentation using more generic convolutional architectures that allow us to provide compulsory ablations. Last, we show that our results also extend to disparity estimation [50]. We provide details on the used adversarial attacks, datasets, reported metrics, and other experimental details in Appendix A. + +In all cases, we observe that Large Context Transposed Convolutions (LCTC) improve the results of the respective pixel-wise prediction task in terms of stability under attack, showing that H1 holds. Further, our extensive ablation on image segmentation shows that increasing the convolution kernel in the decoder building blocks does not have this beneficial effect, providing experimental evidence for our hypothesis H2 and confirming the impact of spectral artifacts on pixel-wise predictions. + +# 5.1 Image Restoration + +For image restoration, we consider the Vision Transformer-based Restormer [89] and NAFNet [16]. Both originally use the Pixel Shuffle [77] for upsampling. Here, we compare the reconstructions from these proposed architectures to their variants using the proposed operators with large transposed convolution filters. We use the same metrics as [16, 89], Peak Signal-to-Noise Ratio (PSNR), and structural similarity index measure (SSIM) [86]. We perform our experiments on the GoPro [63] image deblurring dataset, following the experimental setup in [1]. + +Results on Image Restoration. We first consider qualitative results on NAFNet [16] in Figure 5 and Restormer [89] in Fig. 10, Fig. 11(in Appendix C.3), where we see that the proposed upsampling operators allow for visually good results in image deblurring on clean data (similar to pixel shuffle). Yet, in contrast to pixel shuffle and the baseline small transposed convolution filters, the proposed Large Context Transposed Convolutions (LCTC) significantly reduces artifacts that arise on attacked images (in this case, 10-step PGD with $\epsilon \approx \frac{8}{255}$ ). attacks with varying numbers of steps. + +In Table 1, we report the average PSNR and SSIM values of the reconstructed images from the GoPro test set. These results confirm that at filter size $3 \times 3$ , the performance of the transposed convolution variant of both the considered networks is significantly worse than the originally proposed Pixel Shuffle variant, justifying the community's extensive use of Pixel Shuffle. However, we observe on increasing context by increasing the kernel size to $7 \times 7$ that the performance of the transposed convolution variants significantly improves, especially making the networks more stable when facing adversarial attacks. This boost in performance is further accentuated by increasing the kernel size to $11 \times 11$ (both with parallel small kernels). These results provide evidence for Hypothesis 1. + +Note that the slightly reduced performance on clean images, seen in Table 1, is expected to some degree: here, we only investigate sampling in the decoder, while pixel unshuffle is used in the encoder, potentially causing a mismatch. Further, previous works have shown that there exists a trade-off between adversarial robustness and clean performance [85, 90]. However, we do not observe this trade-off for matching encoder-decoder architectures, e.g. in semantic segmentation. + +# 5.2 Semantic Segmentation + +As baseline architecture for semantic segmentation, we consider a UNet-like architecture [70] with encoder backbone layers from ConvNeXt [54] (see Appendix B.2 on the choice of encoder). This generic architecture facilitates providing a thorough ablation + +![](images/af608a39e596ab204fd4874b23d60acd8a111dbc4351255f8e9ae34eb99585ae.jpg) +Fig. 6: A comparison of semantic segmentation mask predictions for the shown input images. The row labeled "Prediction Difference" shows the difference in predictions between the baseline model and the model with Large Context Transposed Convolutions $(11\times 11 + 3\times 3$ kernels). On white pixels, both models agree. Red pixels indicate that the baseline model predicts correctly but our modified model predicts incorrectly. Green pixels indicate that our modified model predicts correctly but the baseline does not. The ground truth segmentation boundaries are drawn in black. Our modification improves the segmentation result along object boundaries, which can be attributed to spectral artifact removal, but also in more extended regions, where the context plays a more crucial role. + +Table 2: Semantic Segmentation performance on the PASCAL VOC2012 validation set for UNet with ConvNeXt encoder, and the baseline UNet decoder (see Figure 4) with differently sized kernels in transposed convolution for feature map upscaling while keeping rest of the architecture fixed. Additional results are provided in Tab. 7 and Tab. 8 in Appendix B.1. + +
TransposedConvolution KernelsCleanTest AccuracymIoU mAcc allAccFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations320mIoU mAcc allAcc
mIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAcc
2×2 (baseline)78.3486.8995.1553.5470.9686.0847.0265.4182.7823.0646.51
LCTC: 7×7 (Ours)78.9288.0695.2356.0274.1386.4549.2468.8982.8726.5353.05
LCTC: 11×11 + 3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6427.4953.08
7.0823.30
+ +on all considered blocks in the decoder network. Our experiments are conducted on the PASCAL VOC 2012 dataset [24]. We report the mean Intersection over Union (mIoU) of the predicted and ground truth segmentation mask, the mean accuracy over all pixels (mAcc), and the mean accuracy over all classes (allAcc). + +Results on Semantic Segmentation. We first discuss the results for different upsampling operations. The remaining architecture is kept identical, with ResNet-style building blocks in the decoder, throughout these experiments. The clean test accuracies are shown in Table 2. We see that as we increase the kernel size of the transposed convolution layers, there is a slight increase across all three evaluation metrics. Moreover, Figure 6 visually demonstrates that, as we increase the size of the kernels in transposed convolution from $2 \times 2$ (baseline) to $11 \times 11$ , the segmentations of the thin end and protrusions, for example, in the wing of the aircraft sample image are improving. The baseline model with small transposed convolution kernels could not predict these details. As hypothesized in H1, we observe that increasing the context can reduce spectral artifacts caused when representation and images are upsampled using LCTC. + +Further, in Table 2, we evaluate the performance of the segmentation models against FGSM [28] and the multi-step attack SegPGD [34] adversarial attacks for the indicated $\epsilon$ values. As expected, with the increasing intensity of the attack, the performance of all models drops. Yet, even at high attack intensities, the larger kernels perform better than + +Table 3: Adversarially trained models using FGSM ( $\epsilon \approx \frac{8}{255}$ ) from Table 2 tested against SegPGD adversarial attacks ( $\epsilon \approx \frac{8}{255}$ ) on UNet with ConvNeXt encoder and decoder with different sized kernels in the transposed convolution for upsampling, while keeping rest of the architecture identical. See Tab. 10 in Appendix B.6 for more evaluations including PGD training. + +
TransposedConvolution KernelsCleanTest DatamIoU mAcc allAccSegPGD attack iterations
3mIoU mAcc allAcc20mIoU mAcc allAcc
\( 2 \times 2 \)78.57 86.68 95.2326.59 48.99 67.717.6 24.06 31.37
LCTC: \( 7 \times 7 \) (Ours)78.41 86.22 95.2028.11 53.39 66.308.36 28.54 28.13
LCTC: \( 11 \times 11 + 3 \times 3 \) (Ours)79.57 88.1 95.330.37 55.54 68.39.4 29.79 32.37
+ +Table 4: Empirical evaluations for H2 using a UNet with ConvNeXt encoder. We observe that across different-sized kernels in transposed convolution, for a fixed kernel size, increasing the context in the decoder building blocks by using larger kernels causes performance deterioration. These observations for image decoding contrast the findings on image encoding by [17, 51, 54]. + +
Transposed Convolution KernelsDecoder Building Block StyleTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255) attack iterations
mIoU / mAcc / allAcc1/255mIoU / mAcc / allAcc8/255mIoU / mAcc / allAcc3mIoU / mAcc / allAcc20mIoU / mAcc / allAcc
2×2ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.34 / 86.89 / 95.1577.17 / 86.86 / 94.8177.17 / 86.86 / 94.8153.54 / 70.96 / 86.0849.98 / 72.22 / 83.9347.34 / 67.72 / 83.3447.02 / 65.41 / 82.7842.04 / 64.86 / 79.0837.91 / 57.79 / 78.2123.06 / 46.51 / 60.0417.94 / 44.81 / 47.9613.97 / 35.82 / 45.685.54 / 18.79 / 23.723.20 / 14.73 / 9.812.21 / 10.75 / 5.297.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 7×7 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.92 / 88.06 / 95.2377.57 / 87.04 / 94.9277.99 / 87.86 / 94.9656.02 / 74.13 / 86.4552.93 / 72.18 / 85.5151.61 / 73.01 / 84.8549.24 / 68.89 / 82.8744.89 / 65.71 / 80.7443.93 / 66.22 / 80.7326.53 / 53.05 / 61.1617.64 / 43.32 / 47.8017.07 / 42.30 / 48.787.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 11×11+3×3 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×379.33 / 87.81 / 95.4178.32 / 86.98 / 95.0977.42 / 86.24 / 94.9458.04 / 74.93 / 87.8053.31 / 72.45 / 86.1654.48 / 72.53 / 86.2551.25 / 69.31 / 84.6444.89 / 65.18 / 82.0346.67 / 66.59 / 82.2927.49 / 53.08 / 64.1316.14 / 40.65 / 50.3918.76 / 44.60 / 51.497.08 / 23.30 / 26.821.93 / 9.35 / 3.902.31 / 8.70 / 3.50
+ +the small ones, and we see a trend of improvement in performance as we increase the kernel size, providing more evidence for Hypothesis 1. + +Ablation Study. In the following, we first consider the effects of additional adversarial training, then ablate on the impact of other decoder building blocks and the filter size. Variations of the model encoder are ablated in the Appendix B.2, the impact of using small parallel kernels in addition to large kernels is ablated and discussed in Appendix B.3, and competing upsampling techniques are ablated in Appendix B.5. + +Adversarial Training. In Table 3, we report results for FGSM adversarially trained models under SegPGD attack, with attacks as in Table 2. While the overall performance under attack is improved as expected, the trend of LCTC providing better results persists. More results for FGSM attack and SegPGD attacks with different numbers of iterations are given in Tab. 7 and Tab. 8 in the Appendix. In Table 15, we additionally evaluate image restoration models under adversarial training. + +Change in the decoder backbone architecture. While all previous experiments focused on the upsampling using transposed convolutions in the decoder, we now evaluate the influence of the convolutional kernel size within the decoder which does not upsample (see Section 4). For these experiments, we use a UNet-like architecture with a ConvNeXt backbone in the encoder and the PASCAL VOC 2012 dataset. + +In Table 4 we observe, for a fixed transposed convolution kernel size, as we increase the size of the convolution kernel in the decoder building blocks, the performance of the model decreases. This phenomenon extends to the performance of the architectures + +![](images/dba1adb58b2552621269cd5d4b2e02ad925b4e8a13364b15b7671c41de68c821.jpg) +Fig. 7: Performance comparison on PASCAL VOC2012 using UNet with ConvNeXt encoder for different LCTC sizes from $2 \times 2$ (small) to $31 \times 31$ (LCTC) kernels. All, besides the baseline with $2 \times 2$ and $3 \times 3$ , have a parallel $3 \times 3$ kernel, as shown in Figure 4 (bottom left). For the decoder building block backbone, a ResNet Style $3 \times 3$ style is used. See Tab. 9 for the values. + +![](images/62797189d1f74cada56500a124cdedd2f32546ae38f256affa1543d634fa3817.jpg) + +Table 5: Comparison of performances of different upsampling methods in the UNet-like architecture. All architectures use the baseline (ConvNeXt) encoder and $3 \times 3$ convolution kernels in the decoder block. Please refer to Table 13 in Appendix B.5 for more evaluations and discussion, including those with ConvNeXt style $7 \times 7 + 3 \times 3$ Convolution kernels in the decoder blocks. + +
Upsampling MethodTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations
mIoU mAcc allAcc1/255mIoU mAcc allAcc8/255mIoU mAcc allAcc5mIoU mAcc allAcc20mIoU mAcc allAcc
Pixel Shuffle78.5487.3295.1853.8271.5885.8846.6765.0381.7115.0638.8541.716.6923.4324.05
Nearest Neighbour Interpolation78.4088.1695.0952.6873.5184.5546.0867.9680.2215.3444.5336.217.6527.8920.48
Transposed Convolution 2×278.4586.6695.2053.7670.6286.3247.3364.5883.1614.4335.5045.305.5418.7923.72
LCTC: 11×11+3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6418.1543.5149.367.0823.3026.82
+ +under adversarial attacks, showing that a mere increase in parameters in the model decoder does not have a positive effect on model performance or on its stability. This proves the validity of hypothesis H2. An explanation for this phenomenon could be that we only need to increase context during the actual upsampling step, increasing context in the consequent decoder building blocks has a negligible effect on the quality of representations learned. However, the increase in the number of parameters makes the architecture more susceptible to adversarial attacks. + +Ablation on filter size saturation. After proving H1 one could argue that networks will consistently improve with increased kernel size for Large Context Transposed Convolutions. Hence, we test larger kernel sizes of $15 \times 15$ , $17 \times 17$ , $19 \times 19$ and $31 \times 31$ kernels. Yet, as seen in Figure 7, the effect of the kernel size appears to saturate: the performance after $13 \times 13$ and the performance of $31 \times 31$ kernels is not better than for $11 \times 11$ kernels. Yet, they are significantly better than the baseline's performance. + +Ablation on different Upsampling Methods. Following, we compare different upsampling techniques thus justifying our advocacy for using LCTC instead of other upsampling techniques like interpolation and pixel shuffle in the real world. + +We report the comparison in Table 5 and observe that both Pixel shuffle and Nearest Neighbor interpolation perform better than the usually used Transposed Convolution with a $2 \times 2$ kernel size. However, as we increase the kernel size for Transposed Convolution to $11 \times 11$ with a $3 \times 3$ small kernel in parallel, we observe that LCTC is strictly outperforming Pixel Shuffle, on both clean unperturbed images and under adversarial attacks, across all metrics used. Large Context Transposed Convolutions are either outperforming or performing at par with Nearest Neighbor interpolation. Thus we demonstrate the superior clean and adversarial performance of Large Context Transposed Convolutions operation over other commonly used techniques. + +# 5.3 Disparity Estimation + +To show that the observations extend from image restorations and segmentation to other tasks, we conduct additional experiments for disparity estimation. We consider the STTR-light [50] architecture, built from STTR, which is a recent state-of-the-art vision-transformer based model for disparity estimation and occlusion detection. To implement the proposed modification, we alter the kernel sizes in the transposed convolution layers used for pixel-wise upsampling in the "feature extractor" module of the architecture from $3 \times 3$ kernels to larger kernels. We conduct evaluations on FlyingThings3D [60] and keep all other details as implemented in [50]. + +In Table 6, we report the improvements in performance due to our architecture modification of increasing the size of the transposed convolution kernels used for upsampling, from the $3 \times 3$ in the baseline model to $7 \times 7$ (LCTC). Similar to previous applications, the increased kernel sizes with parallel $3 \times 3$ kernels further facilitate + +Table 6: Comparison of performance of STTR-light architecture with different sized kernels in transposed convolution for upsampling the feature maps in the feature extractor (lower is better). The entire set of results is provided as Tab. 17 in Appendix D.1. + +
TransposedConvolution KernelsTest Accuracy3-Step PGD attack
epe↓3px error↓epe↓3px error↓
STTR-light [50] reported0.51.54--
3×3 [50] reproduced0.49271.544.0518.5
LCTC: 7×7 + 3×3 (Ours)0.47881.504.0218.3
+ +to stabilize the model when attacked, as evaluated here for 3 attack iterations using PGD with $\epsilon \approx \frac{8}{255}$ on the disparity loss. Indicating that larger kernels in the transposed convolutions can better decode learned representations from the encoder regardless of the specific downstream task. We provide visual results in Appendix D.1. + +# 6 Conclusion + +We provide conclusive reasoning and empirical evidence for our hypotheses on the importance of context during upsampling. While increasing the size of convolutions during upsampling (LCTC) increases prediction stability, increasing the size of those convolution layers without upsampling does not benefit the network. This indicates that observations made for increased context during encoding do not translate to decoding. Further, we show that our simple LCTC can be directly incorporated into recent models, yielding better stability even in ViT-based architectures like Restormer, NAFNet, and STTR-light as well as in classical CNNs. Our observations are consistent across several architectures and downstream tasks. + +Limitations. Current metrics for measuring performance do not completely account for spectral artifacts. Spectral artifacts begin affecting these metrics only when they become pronounced such as under adversarial attacks, and here LCTC consistently performs better across tasks and architectures. Ideally, we would want infinitely large kernels, however, with increasing kernel size and task complexity, training extremely large kernels can be challenging. Thus, in this work, while having ablated over kernels as large as $31 \times 31$ , we propose using kernels only as large as $7 \times 7$ to $11 \times 11$ for good practical trade-offs. Further improvements might be possible when jointly optimizing the encoder and decoder. Moreover, there might exist other factors that contribute to the introduction and existence of spectral artifacts such as spatial bias. + +# Acknowledgements. + +Margret Keuper acknowledges funding by the DFG Research Unit 5336 - Learning to Sense. The OMNI cluster of the University of Siegen was used for some of the initial computations. Additionally, Shashank Agnihotri would like to thank Dr. Bin Zhao for his help in translating [75]. + +# References + +1. Agnihotri, S., Gandikota, K.V., Grabinski, J., Chandramouli, P., Keuper, M.: On the unreasonable vulnerability of transformers for image restoration-and an easy fix. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3707-3717 (2023) +2. Agnihotri, S., Grabinski, J., Keuper, J., Keuper, M.: Beware of aliases–signal preservation is crucial for robust image restoration. arXiv preprint arXiv:2406.07435 (2024) +3. Agnihotri, S., Jung, S., Keuper, M.: CosPGD: A unified white-box adversarial attack for pixel-wise prediction tasks. In: International Conference on Machine Learning (2024) +4. Aitken, A., Ledig, C., Theis, L., Caballero, J., Wang, Z., Shi, W.: Checkerboard artifact free sub-pixel convolution: A note on sub-pixel convolution, resize convolution and convolution resize. arXiv preprint arXiv:1707.02937 (2017) +5. Ba, J.L., Kiros, J.R., Hinton, G.E.: Layer normalization. arXiv preprint arXiv:1607.06450 (2016) +6. Badki, A., Troccoli, A., Kim, K., Kautz, J., Sen, P., Gallo, O.: Bi3D: Stereo depth estimation via binary classifications. In: The IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020) +7. Badrinarayanan, V., Kendall, A., Cipolla, R.: Segnet: A deep convolutional encoder-decoder architecture for image segmentation. IEEE transactions on pattern analysis and machine intelligence 39(12), 2481-2495 (2017) +8. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models (2021) +9. Brigham, E.O., Morrow, R.: The fast fourier transform. IEEE spectrum 4(12), 63-70 (1967) +10. Brunton, S.L., Kutz, J.N.: Data-driven science and engineering: Machine learning, dynamical systems, and control. Cambridge University Press (2022) +11. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020) +12. Carlini, N., Wagner, D.: Towards evaluating the robustness of neural networks. In: 2017 IEEE symposium on security and privacy (sp). pp. 39-57. IEEE (2017) +13. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in neural information processing systems 33, 9912-9924 (2020) +14. Chandrasegaran, K., Tran, N.T., Cheung, N.M.: A closer look at fourier spectrum discrepancies for cnn-generated images detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7200-7209 (June 2021) +15. Chang, J.R., Chen, Y.S.: Pyramid stereo matching network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5410-5418 (2018) +16. Chen, L., Chu, X., Zhang, X., Sun, J.: Simple baselines for image restoration. In: European Conference on Computer Vision. pp. 17-33. Springer (2022) +17. Ding, X., Zhang, X., Han, J., Ding, G.: Scaling up your kernels to 31x31: Revisiting large kernel design in cnns. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11963-11975 (2022) + +18. Dosovitskiy, A., Brox, T.: Generating images with perceptual similarity metrics based on deep networks. Advances in neural information processing systems 29 (2016) +19. Dosovitskiy, A., Brox, T.: Inverting visual representations with convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4829-4837 (2016) +20. Dosovitskiy, A., Fischer, P., Ilg, E., Hausser, P., Hazirbas, C., Golkov, V., Van Der Smagt, P., Cremers, D., Brox, T.: Flownet: Learning optical flow with convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 2758-2766 (2015) +21. Dosovitskiy, A., Springenberg, J.T., Tatarchenko, M., Brox, T.: Learning to generate chairs, tables and cars with convolutional networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(4), 692-705 (2017) +22. Dumoulin, V., Visin, F.: A guide to convolution arithmetic for deep learning. arXiv preprint arXiv:1603.07285 (2016) +23. Durall, R., Keuper, M., Keuper, J.: Watch your up-convolution: Cnn based generative deep neural networks are failing to reproduce spectral distributions. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 7890–7899 (2020) +24. Everingham, M., Van Gool, L., Williams, C.K.I., Winn, J., Zisserman, A.: The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results. http://www.pascalnetwork.org/challenges/VOC/voc2012/workshop/index.html (2012) +25. Forsyth, D.A., Ponce, J.: Computer vision: a modern approach. Prentice Hall professional technical reference (2002) +26. Gal, R., Hochberg, D.C., Bermano, A., Cohen-Or, D.: SWAGAN: A style-based wavelet-driven generative model. ACM Transactions on Graphics (TOG) 40(4), 1-11 (2021) +27. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020) +28. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014) +29. Grabinski, J., Jung, S., Keuper, J., Keuper, M.: Frequencylowcut pooling-plug and play against catastrophic overfitting. In: European Conference on Computer Vision. pp. 36-57. Springer (2022) +30. Grabinski, J., Keuper, J., Keuper, M.: Aliasing and adversarial robust generalization of cnns. Machine Learning pp. 1-27 (2022) +31. Grabinski, J., Keuper, J., Keuper, M.: Aliasing coincides with cnns vulnerability towards adversarial attacks. In: The AAAI-22 Workshop on Adversarial Machine Learning and Beyond. pp. 1-5 (2022) +32. Grabinski, J., Keuper, J., Keuper, M.: Fix your downsampling asap! be natively more robust via aliasing and spectral artifact free pooling (2023) +33. Grabinski, J., Keuper, J., Keuper, M.: As large as it gets - studying infinitely large convolutions via neural implicit frequency filters. Transactions on Machine Learning Research (2024), https://openreview.net/forum?id=xRy1YRcHWj, featured Certification +34. Gu, J., Zhao, H., Tresp, V., Torr, P.H.: Segpgd: An effective and efficient adversarial attack for evaluating and boosting segmentation robustness. In: European Conference on Computer Vision. pp. 308-325. Springer (2022) +35. Guo, M.H., Lu, C.Z., Hou, Q., Liu, Z., Cheng, M.M., Hu, S.M.: Segnext: Rethinking convolutional attention design for semantic segmentation. Advances in Neural Information Processing Systems 35, 1140-1156 (2022) +36. Hariharan, B., Arbeláez, P., Bourdev, L., Maji, S., Malik, J.: Semantic contours from inverse detectors. In: 2011 international conference on computer vision. pp. 991-998. IEEE (2011) + +37. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) +38. He, Y., Yu, N., Keuper, M., Fritz, M.: Beyond the spectrum: Detecting deepfakes via resynthesis. In: Zhou, Z.H. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. pp. 2534–2541. International Joint Conferences on Artificial Intelligence Organization (8 2021), main Track +39. Hendrycks, D., Dietterich, T.: Benchmarking neural network robustness to common corruptions and perturbations. Proceedings of the International Conference on Learning Representations (2019) +40. Hendrycks, D., Gimpel, K.: Gaussian error linear units (gelus). arXiv preprint arXiv:1606.08415 (2016) +41. Hoffmann, J., Agnihotri, S., Saikia, T., Brox, T.: Towards improving robustness of compressed cnns. In: ICML Workshop on Uncertainty and Robustness in Deep Learning (UDL) (2021) +42. Hossain, M.T., Teng, S.W., Lu, G., Rahman, M.A., Sohel, F.: Anti-aliasing deep image classifiers using novel depth adaptive blurring and activation function. Neurocomputing 536, 164-174 (2023) +43. Ilg, E., Mayer, N., Saikia, T., Keuper, M., Dosovitskiy, A., Brox, T.: Flownet 2.0: Evolution of optical flow estimation with deep networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2462-2470 (2017) +44. Jung, S., Keuper, M.: Spectral distribution aware image generation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 35, pp. 1734-1742 (2021) +45. Jung, S., Lukasik, J., Keuper, M.: Neural architecture design and robustness: A dataset. In: Eleventh International Conference on Learning Representations. OpenReview.net (2023) +46. Karras, T., Aittala, M., Laine, S., Härkönen, E., Hellsten, J., Lehtinen, J., Aila, T.: Alias-free generative adversarial networks. Advances in Neural Information Processing Systems 34, 852-863 (2021) +47. Khayatkhoei, M., Elgammal, A.: Spatial frequency bias in convolutional generative adversarial networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 7152-7159 (2022) +48. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012) +49. Kurakin, A., Goodfellow, I.J., Bengio, S.: Adversarial machine learning at scale. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=BJm4T4Kgx +50. Li, Z., Liu, X., Drenkow, N., Ding, A., Creighton, F.X., Taylor, R.H., Unberath, M.: Revisiting stereo depth estimation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 6197-6206 (2021) +51. Liu, S., Chen, T., Chen, X., Chen, X., Xiao, Q., Wu, B., Kärkkäinen, T., Pechenizkiy, M., Mocanu, D., Wang, Z.: More convnets in the 2020s: Scaling up kernels beyond 51x51 using sparsity. arXiv preprint arXiv:2207.03620 (2022) +52. Liu, S., Deng, W.: Very deep convolutional neural network based image classification using small training sample size. In: 2015 3rd IAPR Asian conference on pattern recognition (ACPR). pp. 730-734. IEEE (2015) +53. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021) + +54. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11976-11986 (2022) +55. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015) +56. Loshchilov, I., Hutter, F.: SGDR: Stochastic gradient descent with warm restarts. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=Skq89Scxx +57. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=Bkg6RiCqY7 +58. Maiya, S.R., Ehrlich, M., Agarwal, V., Lim, S.N., Goldstein, T., Shrivastava, A.: A frequency perspective of adversarial robustness (2021) +59. Mathew, A., Patra, A., Mathew, J.: Monocular depth estimators: Vulnerabilities and attacks. ArXiv abs/2005.14302 (2020) +60. Mayer, N., Ilg, E., Hausser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A large dataset to train convolutional networks for disparity, optical flow, and scene flow estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4040-4048 (2016) +61. Moosavi-Dezfooli, S.M., Fawzi, A., Frossard, P.: Deepfool: a simple and accurate method to fool deep neural networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2574–2582 (2016) +62. Mosleh, A., Langlois, J.M.P., Green, P.: Image deconvolution ringing artifact detection and removal via psf frequency analysis. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) Computer Vision - ECCV 2014. pp. 247-262. Springer International Publishing, Cham (2014) +63. Nah, S., Kim, T.H., Lee, K.M.: Deep multi-scale convolutional neural network for dynamic scene deblurring. In: CVPR (July 2017) +64. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proceedings of the IEEE international conference on computer vision. pp. 1520-1528 (2015) +65. Odena, A., Dumoulin, V., Olah, C.: Deconvolution and checkerboard artifacts. Distill 1(10), e3 (2016) +66. Peng, C., Zhang, X., Yu, G., Luo, G., Sun, J.: Large kernel matters - improve semantic segmentation by global convolutional network. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (July 2017) +67. Pervin, M., Tao, L., Huq, A., He, Z., Huo, L., et al.: Adversarial attack driven data augmentation for accurate and robust medical image segmentation. arXiv preprint arXiv:2105.12106 (2021) +68. Radford, A., Metz, L., Chintala, S.: Unsupervised representation learning with deep convolutional generative adversarial networks. arXiv preprint arXiv:1511.06434 (2015) +69. Radosavovic, I., Kosaraju, R.P., Girshick, R., He, K., Dollar, P.: Designing network design spaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020) +70. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) +71. Scheurer, E., Schmalfuss, J., Lis, A., Bruhn, A.: Detection defenses: An empty promise against adversarial patch attacks on optical flow. arXiv preprint arXiv:2310.17403 (2023) + +72. Schmalfuss, J., Mehl, L., Bruhn, A.: Attacking motion estimation with adversarial snow. arXiv preprint arXiv:2210.11242 (2022) +73. Schmalfuss, J., Mehl, L., Bruhn, A.: Distracting downpour: Adversarial weather attacks for motion estimation (2023) +74. Schmalfuss, J., Scholze, P., Bruhn, A.: A perturbation-constrained adversarial attack for evaluating the robustness of optical flow (2022) +75. segcv: segcv/pspnet. https://github.com/segcv/PSPNet/blob/master/Train.md (2021) +76. Shannon, C.E.: Communication in the presence of noise. Proceedings of the IRE 37(1), 10-21 (1949) +77. Shi, W., Caballero, J., Huszar, F., Totz, J., Aitken, A.P., Bishop, R., Ruekert, D., Wang, Z.: Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network (2016) +78. Si-Yao, L., Ren, D., Yin, Q.: Understanding kernel size in blind deconvolution. In: 2019 IEEE Winter Conference on Applications of Computer Vision (WACV). pp. 2068-2076. IEEE (2019) +79. Smith III, J.O.: Physical audio signal processing: For virtual musical instruments and audio effects. (No Title) (2010) +80. Sommerhoff, H., Agnihotri, S., Saleh, M., Moeller, M., Keuper, M., Kolb, A.: Differentiable sensor layouts for end-to-end learning of task-specific camera parameters. arXiv preprint arXiv:2304.14736 (2023) +81. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 (2013) +82. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021) +83. Teed, Z., Deng, J.: Raft: Recurrent all-pairs field transforms for optical flow. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part II 16. pp. 402-419. Springer (2020) +84. Touvron, H., Cord, M., Douze, M., Massa, F., Sablayrolles, A., Jégou, H.: Training data-efficient image transformers & distillation through attention. In: International conference on machine learning. pp. 10347-10357. PMLR (2021) +85. Tsipras, D., Santurkar, S., Engstrom, L., Turner, A., Madry, A.: Robustness may be at odds with accuracy. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=SyxAb30cY7 +86. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) +87. Xu, L., Ren, J.S., Liu, C., Jia, J.: Deep convolutional neural network for image deconvolution. Advances in neural information processing systems 27 (2014) +88. Yamanaka, K., Matsumoto, R., Takahashi, K., Fujii, T.: Adversarial patch attacks on monocular depth estimation networks. IEEE Access 8, 179094-179104 (2020) +89. Zamir, S.W., Arora, A., Khan, S., Hayat, M., Khan, F.S., Yang, M.H.: Restormer: Efficient transformer for high-resolution image restoration. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5728-5739 (2022) +90. Zhang, H., Yu, Y., Jiao, J., Xing, E., El Ghaoui, L., Jordan, M.: Theoretically principled trade-off between robustness and accuracy. In: ICML (2019) +91. Zhang, R.: Making convolutional networks shift-invariant again. In: ICML (2019) +92. Zhao, H.: semseg. https://github.com/hszhao/semseg (2019) +93. Zhao, H., Shi, J., Qi, X., Wang, X., Jia, J.: Pyramid scene parsing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2881-2890 (2017) + +94. Zhao, H., Zhang, Y., Liu, S., Shi, J., Loy, C.C., Lin, D., Jia, J.: PSANet: Point-wise spatial attention network for scene parsing. In: ECCV (2018) +95. Zou, X., Xiao, F., Yu, Z., Lee, Y.J.: Delving deeper into anti-aliasing in convnets. In: BMVC (2020) \ No newline at end of file diff --git a/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/images.zip b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..14ea3d7c7272010f21ff42e6a96f58904ef060c6 --- /dev/null +++ b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f4a06db114f24c8aa0b95e88d4df138e338694971128940b8f56605011628c1b +size 617693 diff --git a/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/layout.json b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..88dc24b5b691d8fb52e7e0a201143a2010e0460b --- /dev/null +++ b/2024/Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context/layout.json @@ -0,0 +1,10845 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 132, + 112, + 482, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 112, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 112, + 482, + 148 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling – Spectral Artifacts and the Importance of Spatial Context" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 164, + 167, + 449, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 167, + 449, + 180 + ], + "spans": [ + { + "bbox": [ + 164, + 167, + 449, + 180 + ], + "type": "text", + "content": "Shashank Agnihotri1, Julia Grabinski1,2,3, and Margret Keuper1,4" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 201, + 189, + 411, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 201, + 189, + 411, + 200 + ], + "spans": [ + { + "bbox": [ + 201, + 189, + 411, + 200 + ], + "type": "text", + "content": "1 Data and Web Science Group, University of Mannheim" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 240, + 201, + 374, + 211 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 240, + 201, + 374, + 211 + ], + "spans": [ + { + "bbox": [ + 240, + 201, + 374, + 211 + ], + "type": "text", + "content": "2 Fraunhofer ITWM, Kaiserslautern" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 164, + 212, + 449, + 222 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 212, + 449, + 222 + ], + "spans": [ + { + "bbox": [ + 164, + 212, + 449, + 222 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 164, + 212, + 449, + 222 + ], + "type": "text", + "content": " Institute for Machine Learning and Analytics (IMLA), Offenburg University" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 179, + 223, + 434, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 179, + 223, + 434, + 234 + ], + "spans": [ + { + "bbox": [ + 179, + 223, + 434, + 234 + ], + "type": "text", + "content": "4 Max-Planck-Institute for Informatics, Saarland Informatics Campus" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 148, + 235, + 466, + 245 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 148, + 235, + 466, + 245 + ], + "spans": [ + { + "bbox": [ + 148, + 235, + 466, + 245 + ], + "type": "text", + "content": "{shashank.agnihotri, julia.grabinski, keuper}@uni-mannheim.de" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 160, + 274, + 455, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 274, + 455, + 483 + ], + "spans": [ + { + "bbox": [ + 160, + 274, + 455, + 483 + ], + "type": "text", + "content": "Abstract. Pixel-wise predictions are required in a wide variety of tasks such as image restoration, image segmentation, or disparity estimation. Common models involve several stages of data resampling, in which the resolution of feature maps is first reduced to aggregate information and then increased to generate a high-resolution output. Previous works have shown that resampling operations are subject to artifacts such as aliasing. During downsampling, aliases have been shown to compromise the prediction stability of image classifiers. During upsampling, they have been leveraged to detect generated content. Yet, the effect of aliases during upsampling has not yet been discussed w.r.t. the stability and robustness of pixel-wise predictions. While falling under the same term (aliasing), the challenges for correct upsampling in neural networks differ significantly from those during downsampling: when downsampling, some high frequencies can not be correctly represented and have to be removed to avoid aliases. However, when upsampling for pixel-wise predictions, we actually require the model to restore such high frequencies that can not be encoded in lower resolutions. The application of findings from signal processing is therefore a necessary but not a sufficient condition to achieve the desirable output. In contrast, we find that the availability of large spatial context during upsampling allows to provide stable, high-quality pixel-wise predictions, even when fully learning all filter weights." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 521, + 218, + 533 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 521, + 218, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 521, + 218, + 533 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": "Most computer vision models addressing perceptual tasks such as image restoration [16, 89], semantic segmentation [7, 35, 70], optical flow estimation [20, 43, 83] and disparity estimation [6, 11, 50] in realistic scenarios are required to behave in a stable way, at least under mild corruptions. Interestingly, for the slightly simpler task of image classification, recent progress has shown that a model's robustness does not only depend on its training but also on its architecture [29-32, 41, 42, 45, 58, 91, 95]. Specifically, aliasing, i.e. spectral artifacts that emerge from naive image resampling, have shown to compromise prediction stability, in particular in the context of classical convolutional models [33, 37, 48, 52, 69, 80, 82] which predominantly use small filter kernels in combination with severe data aggregation during downsampling [30, 58]. Principled cures" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 113, + 476, + 306 + ], + "blocks": [ + { + "bbox": [ + 138, + 113, + 476, + 306 + ], + "lines": [ + { + "bbox": [ + 138, + 113, + 476, + 306 + ], + "spans": [ + { + "bbox": [ + 138, + 113, + 476, + 306 + ], + "type": "image", + "image_path": "fc525b5856a7973b4e68e320d1436301dac33a9726dd012f3b72c7765fd29229.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "lines": [ + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "type": "text", + "content": "Fig. 1: Image restoration example using NAFNet [16] variants on GoPro [63]. Upsampling techniques like Pixel Shuffle [77] (first row) and transposed convolution [22] using small learnable filters " + }, + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "type": "inline_equation", + "content": "(2\\times 2" + }, + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "type": "inline_equation", + "content": "3\\times 3)" + }, + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "type": "text", + "content": " (second row) are used by most prior art. Both lead to spectral artifacts for which the model needs to compensate. The clean (in-domain) restored images look appealing - while adversaries (here 5-step PGD [49] attack) can leverage aliases such that artifacts become easily visible. When observed in the frequency domain, they manifest as repeating peaks all over the spectra. Based on sampling theoretic considerations, we propose Large Context Transposed Convolutions " + }, + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "type": "inline_equation", + "content": "(7\\times 7" + }, + { + "bbox": [ + 130, + 313, + 482, + 413 + ], + "type": "text", + "content": " or larger) (bottom row). They significantly increase the model's stability during upsampling, observable in the restored image under attack and the frequency spectrum." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 434, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 482, + 555 + ], + "type": "text", + "content": "usually refer to basic concepts from signal processing such as anti-aliasing by blurring before downsampling [29, 91]. While this discussion on classifier (i.e. encoder) networks is insightful, it does not provide a recipe to counteract aliases emerging during upsampling for pixel-wise prediction tasks such as image restoration. Specifically, naive upsampling introduces artifacts in the feature representation, such as grid artifacts [4, 65] or ringing artifacts [62]. As shown in Fig. 1, these artifacts, an inherent property of inadequate upsampling (refer Sec. 3) are not always visible to the human eye, are accentuated under adversarial attack such that they can also be seen with a human eye. We leverage this effect in our analysis. When observed in the frequency domain, these artifacts are apparent as multiple peaks, i.e. aliases of the original data." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 483, + 665 + ], + "type": "text", + "content": "While for downsampling, signal processing laws basically prescribe which part of the information can be retained at lower resolutions without aliases [76], \"correct\", alias-free upsampling can not restore the original high-resolution information. Thus, learning to upsample feature maps such that the feature stability is not harmed is of paramount importance. In this paper, we therefore first provide a synopsis of different aliases that emerge from different upsampling techniques. Based on this work, we propose a simple, transposed convolution-based upsampling block. We study our proposed operation in the context of various models, from image restoration [16,89] over semantic segmentation [70] to disparity estimation [50]." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 146, + 116, + 367, + 127 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 116, + 367, + 127 + ], + "spans": [ + { + "bbox": [ + 146, + 116, + 367, + 127 + ], + "type": "text", + "content": "Our main contributions can be summarized as follows:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 137, + 481, + 279 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 137, + 481, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 137, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 138, + 137, + 481, + 182 + ], + "type": "text", + "content": "- Motivated by sampling theory [76], we study upsampling in models for diverse pixel-wise prediction tasks. We find that the availability of large kernels in transposed convolutions helps the feature stability and significantly improves over standard, small kernel transposed convolutions as well as pixel shuffle [77]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 184, + 481, + 218 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 481, + 218 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 481, + 218 + ], + "type": "text", + "content": "- While large kernels are required to allow for reduced aliasing and to provide the necessary spatial context for increasing the resolution, additional small kernels can add details and remain useful." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 220, + 481, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 220, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 138, + 220, + 481, + 255 + ], + "type": "text", + "content": "- We provide empirical evidence for our findings on diverse architectures (including vision transformer-based architectures) and downstream tasks such as image restoration, semantic segmentation, and depth estimation." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 256, + 481, + 279 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 256, + 481, + 279 + ], + "spans": [ + { + "bbox": [ + 138, + 256, + 481, + 279 + ], + "type": "text", + "content": "- We show empirically that our proposed upsampling operation complements other feature stability-increasing approaches like adversarial training." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 298, + 224, + 310 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 298, + 224, + 310 + ], + "spans": [ + { + "bbox": [ + 132, + 298, + 224, + 310 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 323, + 481, + 371 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 481, + 371 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 481, + 371 + ], + "type": "text", + "content": "In the following, we discuss recent challenges for neural networks regarding artifacts introduced by spatial sampling methods [4, 62, 65]. Further, we review related work on the most recent use of large kernels in CNNs. Finally, we provide an overview of adversarial attacks to gauge the quality of representations learned by a network." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 383, + 481, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 383, + 481, + 467 + ], + "spans": [ + { + "bbox": [ + 130, + 383, + 481, + 467 + ], + "type": "text", + "content": "Spectral Artifacts. Several prior works have studied the effect of downsampling operations on model robustness, e.g. [2, 29, 30, 42, 46, 91, 95]. Inspired by [30], [29] propose an aliasing-free downsampling in the frequency domain which translates to an infinitely large blurring filter before downsampling in the spatial domain. Thus, for image classification, using large filter kernels has been shown to remove artifacts from downsampled representations and it leads to favorable robustness in all these cases [30, 42, 46]. However, all these works focus on improving the properties of encoder networks." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 467, + 481, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 467, + 481, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 467, + 481, + 574 + ], + "type": "text", + "content": "Models that use transposed convolutions in their decoders5 are widely used for tasks like image generation [27, 68] or segmentation [7, 55, 64, 70]. However, in simple transposed convolutions, the convolution kernels overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Further, image resampling can lead to aliases that become visible as ringing artifacts [76]. In the context of deepFake detection, image generation, and deblurring, several works analyzed [14, 18, 21, 23, 38, 44, 47] and improved upsampling techniques [26, 46, 78, 87] to reduce visual artifacts." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 574, + 481, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 574, + 481, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 574, + 481, + 647 + ], + "type": "text", + "content": "Some architectures like PSPNet [93], PSANet [94], or PSMNet [15] simply use bilinear interpolation operations for upsampling the feature representations. While this reduces grid artifacts as bilinear interpolation smoothens out the feature maps, it also has major drawbacks as they sample incorrectly. These new artifacts are sometimes visible as overly smooth predictions, in particular, apparent in the PSPNet segmentation masks. The segmentation masks over-smoothen around edges and often miss out on thin" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 135, + 653, + 355, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 653, + 355, + 665 + ], + "spans": [ + { + "bbox": [ + 135, + 653, + 355, + 665 + ], + "type": "text", + "content": "For more details on Transposed Convolutions refer to [22]." + } + ] + } + ], + "index": 13 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "details (predictions showing these are included in the Appendix B.4). This observation already shows why image encoding and decoding have to be considered separately when it comes to sampling artifacts. While during encoding, artifacts can be reduced by blurring, the main purpose of decoder networks is reducing blur in many applications, to create fine-granular, pixel-wise accurate outputs, which our approach facilitates." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "text", + "content": "Large Kernels. For image classification, [54] showed that using large kernels like " + }, + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "inline_equation", + "content": "7 \\times 7" + }, + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "text", + "content": " in the CNN convolution layer can outperform self-attention based vision transformers [53,84]. In [17,33,35,51,66], the receptive field of the convolution operations was further expanded by using larger kernels, up to " + }, + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "inline_equation", + "content": "31 \\times 31" + }, + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "inline_equation", + "content": "51 \\times 51" + }, + { + "bbox": [ + 130, + 186, + 483, + 307 + ], + "type": "text", + "content": ". These larger receptive fields provide more context to the encoder, leading to better performance on classification, segmentation, or object detection tasks. [17,51] use a small kernel in parallel to capture the local context along with the global context. In contrast to these works, which are limited to exploring increased context only during encoding, we investigate if larger kernels can benefit upsampling when considering pixel-wise prediction tasks such as image restoration or segmentation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 308, + 483, + 490 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 483, + 490 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 483, + 490 + ], + "type": "text", + "content": "Adversarial Attacks. The purpose of adversarial attacks is to reveal neural networks' weaknesses [3, 30, 74, 81] by perturbing pixel values in the input image [12, 28, 49]. These perturbations should lead to a false prediction even though the changes are hardly visible [28, 61, 81]. Especially attacks that have access to the network's architecture and weights, so-called white-box attacks, are a common approach to analyzing weaknesses within the networks' structure [12, 28]. They employ the gradient of the network to optimize the perturbation, which is bounded within an " + }, + { + "bbox": [ + 130, + 308, + 483, + 490 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 308, + 483, + 490 + ], + "type": "text", + "content": "-ball of the original image, i.e. " + }, + { + "bbox": [ + 130, + 308, + 483, + 490 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 308, + 483, + 490 + ], + "type": "text", + "content": " defines the strength of the attack. Most adversarial attacks are proposed to attack classification networks like the one-step Fast Gradient Sign Method (FGSM) [28] or the multi-step Projected Gradient Descent (PGD) attack [49]. However, they can be adapted to other tasks as e.g. in [59, 67, 88]. Furthermore, there are dedicated methods like SegPGD [34] for attacks on semantic segmentation models or PCFA [74] and [71, 73] for optical flow models and CosPGD [3] and others [72] for other pixel-wise prediction tasks. We evaluate the stability of upsampled features using adversarial attacks such as PGD and CosPGD for image restoration and FGSM and SegPGD for segmentation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 506, + 474, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 474, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 474, + 521 + ], + "type": "text", + "content": "3 Spectral Upsampling Artifacts and How They Can Be Reduced" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 530, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 530, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 530, + 482, + 601 + ], + "type": "text", + "content": "Following, we first theoretically review artifacts that are caused during upsampling from a signal processing aspect. We start by describing the spectral artifacts [76] induced by the bed of nails interpolation, similar to the discussion in [23], and then extend the theoretical analysis to further upsampling schemes. Second, we derive from this analysis two hypotheses for the prediction stability of encoder-decoder networks, depending on their architecture. These hypotheses will motivate the remainder of the manuscript." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "spans": [ + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "text", + "content": "Consider, w.l.o.g., a one-dimensional signal " + }, + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "text", + "content": " and its discrete Fourier Transform " + }, + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "inline_equation", + "content": "\\mathcal{F}(I)" + }, + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 601, + 482, + 627 + ], + "type": "text", + "content": " being the index of discrete frequencies" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 194, + 634, + 419, + 668 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 194, + 634, + 419, + 668 + ], + "spans": [ + { + "bbox": [ + 194, + 634, + 419, + 668 + ], + "type": "interline_equation", + "content": "\\mathcal {F} (I) _ {k} = \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j k}{N}} \\cdot I _ {j}, \\quad \\mathrm {f o r} \\quad k = 0, \\ldots , N - 1.", + "image_path": "17614cec5afa09a3fe65898a9050205cf8ba5173029a031623df037a3848e6e4.jpg" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": "During decoding, we need to upsample the spatial resolution of " + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": " to get " + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "I^{\\mathrm{up}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": ". For example for an upsampling factor of 2 (often used in DNNs [1, 16, 19, 82, 89]) we have for " + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "\\bar{k} = 0,\\dots ,2N - 1" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 147, + 158, + 481, + 194 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 158, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 147, + 158, + 481, + 194 + ], + "type": "interline_equation", + "content": "\\mathcal {F} (I) _ {\\bar {k}} ^ {\\mathrm {u p}} = \\sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{2 \\cdot N}} \\cdot I _ {j} ^ {\\mathrm {u p}} = \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {2 \\cdot j \\bar {k}}{2 \\cdot N}} I _ {j} + \\sum_ {j = 0} ^ {N - 1} e ^ {- 2 \\pi i \\cdot \\frac {(2 j + 1) \\bar {k}}{2 \\cdot N}} \\bar {I} _ {j}, \\quad (1)", + "image_path": "d617c40b0c62b45fd9e0319c840fd5a8cc1998ee5b798710f4ac985bf42f5712.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\bar{I}_j = 0" + }, + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "text", + "content": " in bed of nails interpolation. Therefore, the second term in (1) can be dropped and the first term resembles the original " + }, + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\mathcal{F}(I)" + }, + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "text", + "content": ". Equivalently, we can rewrite Eq. (1), for " + }, + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\bar{I}_j = 0" + }, + { + "bbox": [ + 130, + 199, + 482, + 237 + ], + "type": "text", + "content": ", using a Dirac impulse comb as" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 214, + 242, + 481, + 277 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 242, + 481, + 277 + ], + "spans": [ + { + "bbox": [ + 214, + 242, + 481, + 277 + ], + "type": "interline_equation", + "content": "(1) = \\sum_ {j = 0} ^ {2 N - 1} e ^ {- 2 \\pi i \\cdot \\frac {j k}{2 \\cdot N}} \\cdot \\sum_ {t = - \\infty} ^ {\\infty} I _ {j} ^ {\\mathrm {u p}} \\cdot \\delta (j - 2 t). \\tag {2}", + "image_path": "1a7ea610bd5767f7aeb0a36ec3bf578f5ed87bb6dca2f32cfd4dbbb62c720b49.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 282, + 481, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 282, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 131, + 282, + 481, + 308 + ], + "type": "text", + "content": "If we now apply the pointwise multiplication with the Dirac impulse comb as convolution in the Fourier domain (assuming periodicity) [25], it is" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 312, + 481, + 392 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 312, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 138, + 312, + 481, + 392 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {F} (I) _ {\\bar {k}} ^ {\\mathrm {u p}} = \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\left(\\sum_ {j = - \\infty} ^ {\\infty} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{2 N}} I _ {j} ^ {\\mathrm {u p}}\\right) \\left(\\bar {k} - \\frac {t}{2}\\right) \\tag {3} \\\\ \\stackrel {(1)} {=} \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\left(\\sum_ {j = - \\infty} ^ {\\infty} e ^ {- 2 \\pi i \\cdot \\frac {j \\bar {k}}{N}} \\cdot I _ {j}\\right) \\left(\\bar {k} - \\frac {t}{2}\\right) = \\frac {1}{2} \\sum_ {t = - \\infty} ^ {\\infty} \\mathcal {F} (I) _ {\\bar {k}} \\left(\\bar {k} - \\frac {t}{2}\\right). \\\\ \\end{array}", + "image_path": "94d9cfcc2fab1646ba6577f0274d1ca66361d095a0cbc213d0b3624634ed5e49.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "text", + "content": "We can see that such upsampling creates high-frequency replica of the signal at " + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "inline_equation", + "content": "\\frac{t}{2}" + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "text", + "content": " in " + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "inline_equation", + "content": "-\\infty, \\ldots, \\infty" + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "text", + "content": " in " + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "inline_equation", + "content": "\\mathcal{F}(I)^{\\mathrm{up}}" + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "text", + "content": " and spatial frequencies apparent beyond array positions " + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "inline_equation", + "content": "\\frac{N}{2}" + }, + { + "bbox": [ + 130, + 397, + 482, + 434 + ], + "type": "text", + "content": " will be impacted by spectral artifacts if no appropriate countermeasures are taken." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": "A standard countermeasure is interpolation of the inserted values with " + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\bar{I}_j = \\frac{I_{j-1} + I_j}{2}" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": " for linear interpolation in Eq. (1). Linear interpolation (and in consequence bi-linear interpolation in 2D signals) corresponds to a convolution with a triangular impulse with width 2, which can be represented as the convolution of two rectangle functions with width 1. Accordingly, the Fourier response for frequency " + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\ell" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_{\\ell}" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": " of the triangular impulse is a squared sinc function (" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\mathrm{sinc}^2(\\ell)" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": ") with " + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\mathrm{sinc}(\\ell) = \\frac{\\sin(\\pi\\ell)}{\\pi\\ell}" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": ". Since the output signal after interpolation is still discrete, i.e. sampled with sampling rate " + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\frac{1}{2}" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": ", a replica of the interpolation function, the " + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "inline_equation", + "content": "\\mathrm{sinc}^2" + }, + { + "bbox": [ + 130, + 434, + 482, + 593 + ], + "type": "text", + "content": " function, will appear with rate 2 in the resulting spectrum (see also Fig. 2). The resulting interpolated signal is not optimal for several reasons. Most importantly, the spectrum of the interpolation function is not flat although the estimated values appear overly smooth (see Fig. 3.). This is arguably suboptimal for, for example, image restoration or segmentation tasks, where fine structural details are supposed to emerge in the upsampled data." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 594, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 641 + ], + "type": "text", + "content": "Note that, in Eq. (1), pixel shuffle [77] will set " + }, + { + "bbox": [ + 130, + 594, + 482, + 641 + ], + "type": "inline_equation", + "content": "\\bar{I}_j" + }, + { + "bbox": [ + 130, + 594, + 482, + 641 + ], + "type": "text", + "content": " to completely unrelated values of a different feature map channel, leading to a highly non-smooth signal with frequencies at the band limit. The resulting issues in the spectrum are similar to the ones caused by the bed of nails interpolation. These spectral artifacts can be visually observed in Fig. 3." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 642, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 642, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 642, + 482, + 666 + ], + "type": "text", + "content": "Therefore, in transposed convolutions, the interpolation function is not fixed to a predefined smoothing kernel but learned so that the resulting signal can represent fine" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 114, + 474, + 178 + ], + "blocks": [ + { + "bbox": [ + 141, + 114, + 474, + 178 + ], + "lines": [ + { + "bbox": [ + 141, + 114, + 474, + 178 + ], + "spans": [ + { + "bbox": [ + 141, + 114, + 474, + 178 + ], + "type": "image", + "image_path": "483e9d42478417ee8dd5447a498aa1d40ffa1d2dca849cc3b3588f5bcd44a1d0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 186, + 482, + 232 + ], + "lines": [ + { + "bbox": [ + 130, + 186, + 482, + 232 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 482, + 232 + ], + "type": "text", + "content": "Fig. 2: (Left) Linear interpolation (pink) of the samples (green) causes aliases. (Right) Optimal signal reconstruction (pink) is achieved by sinc interpolation. In practice our spatial context is limited and the interpolation function is discrete. Yet, increasing the kernel size enables the approximation of larger sinc-like structures." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 136, + 238, + 222, + 287 + ], + "blocks": [ + { + "bbox": [ + 136, + 238, + 222, + 287 + ], + "lines": [ + { + "bbox": [ + 136, + 238, + 222, + 287 + ], + "spans": [ + { + "bbox": [ + 136, + 238, + 222, + 287 + ], + "type": "image", + "image_path": "131fb698a5f2f20d136fa1ba201f0a4c7784df97c4c9ae933458aa67e779c933.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 142, + 289, + 216, + 296 + ], + "lines": [ + { + "bbox": [ + 142, + 289, + 216, + 296 + ], + "spans": [ + { + "bbox": [ + 142, + 289, + 216, + 296 + ], + "type": "text", + "content": "Artifact-free Ground Truth" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 222, + 239, + 306, + 287 + ], + "blocks": [ + { + "bbox": [ + 222, + 239, + 306, + 287 + ], + "lines": [ + { + "bbox": [ + 222, + 239, + 306, + 287 + ], + "spans": [ + { + "bbox": [ + 222, + 239, + 306, + 287 + ], + "type": "image", + "image_path": "ff83c23c0545801c77fe48c0de1423717dd199dc6047b0b67c2a3a78a98d87f5.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 307, + 239, + 392, + 287 + ], + "blocks": [ + { + "bbox": [ + 307, + 239, + 392, + 287 + ], + "lines": [ + { + "bbox": [ + 307, + 239, + 392, + 287 + ], + "spans": [ + { + "bbox": [ + 307, + 239, + 392, + 287 + ], + "type": "image", + "image_path": "1417d635400ce59198447e04e524c461d8e3b9ee573820434920b11bc34ea9fb.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 392, + 239, + 477, + 287 + ], + "blocks": [ + { + "bbox": [ + 392, + 239, + 477, + 287 + ], + "lines": [ + { + "bbox": [ + 392, + 239, + 477, + 287 + ], + "spans": [ + { + "bbox": [ + 392, + 239, + 477, + 287 + ], + "type": "image", + "image_path": "8bc7bde927c34a1c449e02bf7095282f035ae7739407716c41977877d5d1c605.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 136, + 297, + 221, + 346 + ], + "blocks": [ + { + "bbox": [ + 136, + 297, + 221, + 346 + ], + "lines": [ + { + "bbox": [ + 136, + 297, + 221, + 346 + ], + "spans": [ + { + "bbox": [ + 136, + 297, + 221, + 346 + ], + "type": "image", + "image_path": "3b5b7e6266bade45b5fa3ffe7892e025bc4c2e87a3c9541872adca6b39c7e7da.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 143, + 347, + 214, + 354 + ], + "lines": [ + { + "bbox": [ + 143, + 347, + 214, + 354 + ], + "spans": [ + { + "bbox": [ + 143, + 347, + 214, + 354 + ], + "type": "text", + "content": "Zoomed-in Ground Truth" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 365, + 482, + 431 + ], + "lines": [ + { + "bbox": [ + 130, + 365, + 482, + 431 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 482, + 431 + ], + "type": "text", + "content": "Fig.3: An image from GoPro [63] downsampled with " + }, + { + "bbox": [ + 130, + 365, + 482, + 431 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 365, + 482, + 431 + ], + "type": "text", + "content": " MaxPooling and then upsampled using various upsampling techniques. The resulting artifacts are compared on zoomed-in red box regions for better visibility. Bilinear interpolation causes over-smoothing. Bicubic interpolation causes overestimation along image boundaries while Pixel Shuffle and Nearest Neighbor cause strong grid artifacts along with discoloration. Small kernel transposed convolutions cause grid artifacts, however, on increasing kernel size we start getting better upsampling." + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 222, + 297, + 306, + 346 + ], + "blocks": [ + { + "bbox": [ + 235, + 289, + 293, + 297 + ], + "lines": [ + { + "bbox": [ + 235, + 289, + 293, + 297 + ], + "spans": [ + { + "bbox": [ + 235, + 289, + 293, + 297 + ], + "type": "text", + "content": "Bicubic Interpolation" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 222, + 297, + 306, + 346 + ], + "lines": [ + { + "bbox": [ + 222, + 297, + 306, + 346 + ], + "spans": [ + { + "bbox": [ + 222, + 297, + 306, + 346 + ], + "type": "image", + "image_path": "140c721446f8e5fd4c2fe4fe30fa7ff7bfd848cd3b3d2f324274d4ada07bde0e.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 234, + 347, + 294, + 355 + ], + "lines": [ + { + "bbox": [ + 234, + 347, + 294, + 355 + ], + "spans": [ + { + "bbox": [ + 234, + 347, + 294, + 355 + ], + "type": "text", + "content": "Bilinear Interpolation" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 307, + 297, + 391, + 346 + ], + "blocks": [ + { + "bbox": [ + 307, + 289, + 391, + 297 + ], + "lines": [ + { + "bbox": [ + 307, + 289, + 391, + 297 + ], + "spans": [ + { + "bbox": [ + 307, + 289, + 391, + 297 + ], + "type": "text", + "content": "Nearest Neighbor Interpolation" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 307, + 297, + 391, + 346 + ], + "lines": [ + { + "bbox": [ + 307, + 297, + 391, + 346 + ], + "spans": [ + { + "bbox": [ + 307, + 297, + 391, + 346 + ], + "type": "image", + "image_path": "b7e51fd72f78d07a889a1aade61571a581f12e7b186c121243e9288cec4eebed.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 331, + 347, + 367, + 354 + ], + "lines": [ + { + "bbox": [ + 331, + 347, + 367, + 354 + ], + "spans": [ + { + "bbox": [ + 331, + 347, + 367, + 354 + ], + "type": "text", + "content": "Pixel Shuffle" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 392, + 297, + 477, + 346 + ], + "blocks": [ + { + "bbox": [ + 397, + 289, + 473, + 297 + ], + "lines": [ + { + "bbox": [ + 397, + 289, + 473, + 297 + ], + "spans": [ + { + "bbox": [ + 397, + 289, + 473, + 297 + ], + "type": "text", + "content": "Small(3×3) Transposed Conv" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 392, + 297, + 477, + 346 + ], + "lines": [ + { + "bbox": [ + 392, + 297, + 477, + 346 + ], + "spans": [ + { + "bbox": [ + 392, + 297, + 477, + 346 + ], + "type": "image", + "image_path": "139e3393d8d96d79b8ddd38c42af954d449490b13cdd157a30677618b1678de9.jpg" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 392, + 347, + 477, + 355 + ], + "lines": [ + { + "bbox": [ + 392, + 347, + 477, + 355 + ], + "spans": [ + { + "bbox": [ + 392, + 347, + 477, + 355 + ], + "type": "text", + "content": "Large(7×7+3×3) Transposed Conv" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_caption" + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "text", + "content": "details after the initial bed of nails interpolation and potentially learn to add fine details. One issue is that the learned convolution kernels may overlap based on the chosen stride and kernel size. If the stride is smaller than the kernel size, this will cause overlaps in the operation, leading to uneven contributions to different pixels in the upsampled feature map and thus to grid-like artifacts [4, 65]. Besides this rather technical aspect, transposed convolutions, if sufficiently large (thus also containing more context), could in principle learn to approximate correct upsampling functions. This can be understood when again looking at the Fourier representation. When interpolating, we want to increase the signal array size so that all the original information is preserved and the model can easily learn additional details. Such upsampling to preserve the information from the original low-resolution data is most easily achieved by transforming the signal to the Fourier domain, then padding the missing high-frequency parts with zeros and transforming the resulting array back to the spatial domain [79]. In the Fourier domain, this padding operation can be understood as a point-wise multiplication of the desired full spectrum with a rectangle function with width " + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "text", + "content": " (denoted " + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\operatorname{rect}_N" + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "text", + "content": "). Conversely, this operation corresponds to a convolution with " + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\mathcal{F}^{-1}(\\operatorname{rect}_N) = \\frac{1}{N}\\operatorname{sinc}(xN)" + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "text", + "content": " in the spatial domain. While the sinc function drops off as " + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 449, + 482, + 668 + ], + "type": "text", + "content": " increases, it never drops to zero. When applied for interpolation, its crests and the troughs cancel out the aliasing to a large" + } + ] + } + ], + "index": 21 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "type": "text", + "content": "extent as shown in Fig. 2. Thus, in order to allow the approximation of the optimal interpolation function, the kernel size in transposed convolutions has to be chosen as large as possible. This is, however, at odds with the \"learnability\" of suitable filter weights. Note that for pixel-wise predictions, models not only need to correctly interpolate, but they also need to \"fill in\" the missing details, which requires global as well as local context. Therefore, we expect a trade-off on the kernel size of transposed convolutions, where larger kernels improve the stability of the upsampled features and thus can reduce artifacts while the absolute prediction quality can suffer from very large learnable kernels. Sufficiently but not overly large kernels provide sufficient spatial context and are appropriate to allow for the model to learn when to blur and when to preserve/sharpen upsampled features. We illustrate this in Fig. 12 in Appendix C.4." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 247, + 481, + 271 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 247, + 481, + 271 + ], + "spans": [ + { + "bbox": [ + 130, + 247, + 481, + 271 + ], + "type": "text", + "content": "From this theoretical analysis of common upsampling methods, we derive the following hypotheses that we deem relevant for encoder-decoder architectures:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 280, + 482, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 280, + 482, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 280, + 482, + 327 + ], + "type": "text", + "content": "Hypothesis 1 (H1): Large Context Transposed Convolutions (LCTC) i.e. Large kernels in transposed convolution operations provide more context and reduce spectral artifacts and can therefore be leveraged by the network to facilitate better and more robust pixel-wise predictions." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 335, + 482, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 335, + 482, + 384 + ], + "spans": [ + { + "bbox": [ + 130, + 335, + 482, + 384 + ], + "type": "text", + "content": "Hypothesis 2 (H2, Null Hypothesis): To leverage prediction context and reduce spectral artifacts, it is crucial to increase the size of the transposed convolution kernels (upsample using large filters). Increasing the size of normal (i.e. non-upsampling) decoder convolutions does not have this effect." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 393, + 482, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 393, + 482, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 393, + 482, + 430 + ], + "type": "text", + "content": "In the following, we show the proposed, simple, and principled architecture changes that allow for studying the above hypotheses and improving robustness by improving feature stability." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 448, + 454, + 462 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 448, + 454, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 448, + 454, + 462 + ], + "type": "text", + "content": "4 Upsampling using Large Context Transposed Convolutions" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 474, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 593 + ], + "type": "text", + "content": "Driven by the observations on upsampling artifacts, we investigate the advantage of larger kernel sizes during upsampling, for applications such as semantic segmentation or disparity estimation. Therefore, we keep the models' encoder part fixed and exclusively change operations in the architecture of the decoder part of the model. There, we have two design choices: Upsampling - The kernel size for the transposed convolution operations that learn upsampling, and Decoder Block - The kernel size in the convolution operations of blocks that learn to decode the features. Probing options for Upsampling works towards proving H1 while a combination of both options proves H2, i.e. shows that a pure increase in the decoder parameters does not have the desired effect. This is considered in our ablation study in Sec. 5.2." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 665 + ], + "type": "text", + "content": "Figure 4 summarizes the studied options for an abstract encoder-decoder architecture like [70]. The model decoder is depicted in the green box. Operations that we consider to be executed along the red upwards arrows (Upsampling Operators) are detailed in the top right part of the figure (operations a) to c). Operations that we consider to be executed along the blue sideways arrows (Decoder Building Blocks) are depicted in the bottom right (operations d) to f)." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 130, + 112, + 482, + 290 + ], + "blocks": [ + { + "bbox": [ + 130, + 112, + 482, + 290 + ], + "lines": [ + { + "bbox": [ + 130, + 112, + 482, + 290 + ], + "spans": [ + { + "bbox": [ + 130, + 112, + 482, + 290 + ], + "type": "image", + "image_path": "8ae4127bb897c8164f06fb8a67b2e5dfc414961de90c1ee810dc481e3ef85fb6.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 297, + 483, + 451 + ], + "lines": [ + { + "bbox": [ + 130, + 297, + 483, + 451 + ], + "spans": [ + { + "bbox": [ + 130, + 297, + 483, + 451 + ], + "type": "text", + "content": "Fig. 4: Abstract representation of an encoder-decoder architecture. While for different tasks, the implementation of the model encoder varies (including transformer-based encoders), our study focuses on the model decoder (in green). The backbone for the decoder is commonly a ResNet-like structure for feature extraction [7, 70], additionally we also used a ConvNeXt-like [54] structure. We investigate variants of different upsampling operations (the operations along the red arrows in the decoder) for fixed decoder blocks. We consider, as a probe for H1, the baseline transposed deconvolution (a) in the top right), and for LCTC an increased convolution kernel size (b) in the top right), and an increased convolution kernel with a second path using a small convolution kernel (c) in the top right). To test whether the plain increase in parameters is responsible for improved results (zero hypotheses, H2), we also ablate on the increase of convolution kernel size in the decoder block (operations along the blue arrows in the green block), as shown on the bottom right. We consider the common ResNet-like decoder building block structure (in d)) and two ConvNext-like structured backbones for the decoder building block in e) and f), where f) has an additional small convolution applied in parallel, analog to c)." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 470, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 470, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 470, + 482, + 495 + ], + "type": "text", + "content": "Model Details. Here, we provide details on the studied models. All implementation details are given in the Appendix A." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "content": "Transposed Convolution Kernels for Upsampling. The upsampling operation is typically performed with small kernels (" + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "inline_equation", + "content": "2 \\times 2" + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "content": ") in the transposed convolution operations [8, 13, 70]. We aim to increase the spatial context during upsampling and to reduce grid artifacts. Thus we use Large Context Transposed Convolutions (LCTC). We either use " + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "inline_equation", + "content": "7 \\times 7" + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "content": " transposed convolutions or " + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "inline_equation", + "content": "11 \\times 11" + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "content": " transposed convolutions with a parallel " + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "content": " transposed convolution. Adding a parallel " + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 496, + 482, + 592 + ], + "type": "text", + "content": " kernel is motivated by [17], as large convolution kernels tend to lose local context, and thus adding a parallel small kernel helps to overcome this potential drawback (see Appendix B.3)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": "Decoder Building Blocks. To verify that the measurable effects are due to the improved upsampling and not due to merely increasing the decoder capacity, we ablate on decoder convolution blocks similar to convolution blocks used in the ConvNeXt [54] basic block for encoding. While the standard ConvNeXt block uses a " + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "inline_equation", + "content": "7 \\times 7" + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": " depth-wise convolution, we consider " + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "inline_equation", + "content": "7 \\times 7" + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "inline_equation", + "content": "11 \\times 11" + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": " group-wise convolutions, followed by layers present in a ConvNeXt basic block to analyze the importance of the receptive field within the block." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 114, + 479, + 216 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 479, + 216 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 479, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 479, + 216 + ], + "type": "image", + "image_path": "74f907f2794a09d199fedc840d5cfd6e1f259f50db4214e6f01a95188bbb11a1.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 227, + 480, + 270 + ], + "lines": [ + { + "bbox": [ + 130, + 227, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 227, + 480, + 270 + ], + "type": "text", + "content": "Fig. 5: NAFNet, as proposed, uses Pixel Shuffle for upsampling. We modify only the upsampling operations to transposed convolution with kernel size " + }, + { + "bbox": [ + 130, + 227, + 480, + 270 + ], + "type": "inline_equation", + "content": "(3\\times 3)" + }, + { + "bbox": [ + 130, + 227, + 480, + 270 + ], + "type": "text", + "content": " and LCTC (Ours) for comparisons. We observe, for example, under a 10-step PGD attack with " + }, + { + "bbox": [ + 130, + 227, + 480, + 270 + ], + "type": "inline_equation", + "content": "\\epsilon \\approx \\frac{8}{255}" + }, + { + "bbox": [ + 130, + 227, + 480, + 270 + ], + "type": "text", + "content": " our proposed H1 gains validity. More examples for [16, 89] using different attacks and budgets are in Appendix C.3." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 133, + 348, + 479, + 430 + ], + "blocks": [ + { + "bbox": [ + 130, + 284, + 480, + 339 + ], + "lines": [ + { + "bbox": [ + 130, + 284, + 480, + 339 + ], + "spans": [ + { + "bbox": [ + 130, + 284, + 480, + 339 + ], + "type": "text", + "content": "Table 1: Comparison of performances of different upsampling methods in SotA Image Restoration Networks on the GoPro dataset. The architectures use Pixel Shuffle for Upsampling, we propose replacing the Pixel Shuffle with Large Context Transposed Convolutions (LCTC). We report additional results using adversarial training in Tab. 15. Note, that some trade-off between clean performance and robustness is expected [85,90]." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 348, + 479, + 430 + ], + "lines": [ + { + "bbox": [ + 133, + 348, + 479, + 430 + ], + "spans": [ + { + "bbox": [ + 133, + 348, + 479, + 430 + ], + "type": "table", + "html": "
NetworkUpsampling MethodTest AccuracyCosPGD (ε ≈ 8/255) attack iterationsPGD (ε ≈ 8/255) attack iterations
PSNRSSIM5102051020
PSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIMPSNRSSIM
RestomerPixel Shuffle31.990.963511.360.32369.050.22427.590.154811.410.32569.040.22347.580.1543
Transposed Conv 3×39.680.0958.240.04528.530.06288.440.06317.660.04647.720.05778.640.0527
LCTC: 7×7 + 3 × 3 (Ours)29.510.933713.690.418611.530.313610.160.248413.690.418311.540.313710.160.2483
LCTC: 11×11 + 3×3 (Ours)29.440.932414.650.425112.830.343811.480.2914.650.425312.840.344511.480.2893
NAFNetPixel Shuffle32.870.96068.670.22646.680.11275.810.061710.270.31798.660.22825.950.0714
Transposed Conv 3×331.020.94226.150.03325.950.02585.870.02336.150.03325.950.02585.870.0234
LCTC: 7×7 + 3 × 3 (Ours)31.120.943014.540.482711.050.32209.060.221314.530.482311.030.32019.080.2224
LCTC: 11×11 + 3×3 (Ours)30.770.939214.340.449211.410.32449.540.241114.340.4511.40.32369.550.2398
", + "image_path": "3c545fc0c8c4a3ac09c02baed44a52c67d3fd83caaa685e177b41b4e32b30388.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 446, + 480, + 529 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 480, + 529 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 480, + 529 + ], + "type": "text", + "content": "Figure 4 (bottom right e) and f)) shows the structure of a ConvNeXt-style building block used in our work. First, a group-wise convolution is performed, followed by a LayerNorm [5] and two " + }, + { + "bbox": [ + 130, + 446, + 480, + 529 + ], + "type": "inline_equation", + "content": "1 \\times 1" + }, + { + "bbox": [ + 130, + 446, + 480, + 529 + ], + "type": "text", + "content": " convolutions which, similar to [54], creates an inverted bottleneck by first increasing the channel dimension and after a GELU [40] activation compressing the channel dimension again. We consider the ResNet-style building block (Figure 4, d)), with " + }, + { + "bbox": [ + 130, + 446, + 480, + 529 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 446, + 480, + 529 + ], + "type": "text", + "content": " convolution, yet without skip connection, as our baseline when studying this architectural design choice." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 552, + 218, + 566 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 552, + 218, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 552, + 218, + 566 + ], + "type": "text", + "content": "5 Experiments" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 582, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 479, + 665 + ], + "type": "text", + "content": "In the following, we evaluate the effect of the considered upsampling operators in several applications. We start by evaluating the effect on the upsampled feature stability of recent state-of-the-art (SotA) image restoration models [16,89], then provide results on semantic segmentation using more generic convolutional architectures that allow us to provide compulsory ablations. Last, we show that our results also extend to disparity estimation [50]. We provide details on the used adversarial attacks, datasets, reported metrics, and other experimental details in Appendix A." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": "In all cases, we observe that Large Context Transposed Convolutions (LCTC) improve the results of the respective pixel-wise prediction task in terms of stability under attack, showing that H1 holds. Further, our extensive ablation on image segmentation shows that increasing the convolution kernel in the decoder building blocks does not have this beneficial effect, providing experimental evidence for our hypothesis H2 and confirming the impact of spectral artifacts on pixel-wise predictions." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 205, + 237, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 205, + 237, + 217 + ], + "spans": [ + { + "bbox": [ + 131, + 205, + 237, + 217 + ], + "type": "text", + "content": "5.1 Image Restoration" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 224, + 482, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 224, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 482, + 308 + ], + "type": "text", + "content": "For image restoration, we consider the Vision Transformer-based Restormer [89] and NAFNet [16]. Both originally use the Pixel Shuffle [77] for upsampling. Here, we compare the reconstructions from these proposed architectures to their variants using the proposed operators with large transposed convolution filters. We use the same metrics as [16, 89], Peak Signal-to-Noise Ratio (PSNR), and structural similarity index measure (SSIM) [86]. We perform our experiments on the GoPro [63] image deblurring dataset, following the experimental setup in [1]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 318, + 482, + 402 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 318, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 318, + 482, + 402 + ], + "type": "text", + "content": "Results on Image Restoration. We first consider qualitative results on NAFNet [16] in Figure 5 and Restormer [89] in Fig. 10, Fig. 11(in Appendix C.3), where we see that the proposed upsampling operators allow for visually good results in image deblurring on clean data (similar to pixel shuffle). Yet, in contrast to pixel shuffle and the baseline small transposed convolution filters, the proposed Large Context Transposed Convolutions (LCTC) significantly reduces artifacts that arise on attacked images (in this case, 10-step PGD with " + }, + { + "bbox": [ + 130, + 318, + 482, + 402 + ], + "type": "inline_equation", + "content": "\\epsilon \\approx \\frac{8}{255}" + }, + { + "bbox": [ + 130, + 318, + 482, + 402 + ], + "type": "text", + "content": "). attacks with varying numbers of steps." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "text", + "content": "In Table 1, we report the average PSNR and SSIM values of the reconstructed images from the GoPro test set. These results confirm that at filter size " + }, + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "text", + "content": ", the performance of the transposed convolution variant of both the considered networks is significantly worse than the originally proposed Pixel Shuffle variant, justifying the community's extensive use of Pixel Shuffle. However, we observe on increasing context by increasing the kernel size to " + }, + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "inline_equation", + "content": "7 \\times 7" + }, + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "text", + "content": " that the performance of the transposed convolution variants significantly improves, especially making the networks more stable when facing adversarial attacks. This boost in performance is further accentuated by increasing the kernel size to " + }, + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "inline_equation", + "content": "11 \\times 11" + }, + { + "bbox": [ + 130, + 403, + 482, + 521 + ], + "type": "text", + "content": " (both with parallel small kernels). These results provide evidence for Hypothesis 1." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 522, + 482, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 594 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 594 + ], + "type": "text", + "content": "Note that the slightly reduced performance on clean images, seen in Table 1, is expected to some degree: here, we only investigate sampling in the decoder, while pixel unshuffle is used in the encoder, potentially causing a mismatch. Further, previous works have shown that there exists a trade-off between adversarial robustness and clean performance [85, 90]. However, we do not observe this trade-off for matching encoder-decoder architectures, e.g. in semantic segmentation." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 610, + 258, + 623 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 610, + 258, + 623 + ], + "spans": [ + { + "bbox": [ + 131, + 610, + 258, + 623 + ], + "type": "text", + "content": "5.2 Semantic Segmentation" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "As baseline architecture for semantic segmentation, we consider a UNet-like architecture [70] with encoder backbone layers from ConvNeXt [54] (see Appendix B.2 on the choice of encoder). This generic architecture facilitates providing a thorough ablation" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 144, + 113, + 470, + 179 + ], + "blocks": [ + { + "bbox": [ + 144, + 113, + 470, + 179 + ], + "lines": [ + { + "bbox": [ + 144, + 113, + 470, + 179 + ], + "spans": [ + { + "bbox": [ + 144, + 113, + 470, + 179 + ], + "type": "image", + "image_path": "af608a39e596ab204fd4874b23d60acd8a111dbc4351255f8e9ae34eb99585ae.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 189, + 482, + 287 + ], + "lines": [ + { + "bbox": [ + 130, + 189, + 482, + 287 + ], + "spans": [ + { + "bbox": [ + 130, + 189, + 482, + 287 + ], + "type": "text", + "content": "Fig. 6: A comparison of semantic segmentation mask predictions for the shown input images. The row labeled \"Prediction Difference\" shows the difference in predictions between the baseline model and the model with Large Context Transposed Convolutions " + }, + { + "bbox": [ + 130, + 189, + 482, + 287 + ], + "type": "inline_equation", + "content": "(11\\times 11 + 3\\times 3" + }, + { + "bbox": [ + 130, + 189, + 482, + 287 + ], + "type": "text", + "content": " kernels). On white pixels, both models agree. Red pixels indicate that the baseline model predicts correctly but our modified model predicts incorrectly. Green pixels indicate that our modified model predicts correctly but the baseline does not. The ground truth segmentation boundaries are drawn in black. Our modification improves the segmentation result along object boundaries, which can be attributed to spectral artifact removal, but also in more extended regions, where the context plays a more crucial role." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 133, + 346, + 482, + 401 + ], + "blocks": [ + { + "bbox": [ + 131, + 293, + 482, + 338 + ], + "lines": [ + { + "bbox": [ + 131, + 293, + 482, + 338 + ], + "spans": [ + { + "bbox": [ + 131, + 293, + 482, + 338 + ], + "type": "text", + "content": "Table 2: Semantic Segmentation performance on the PASCAL VOC2012 validation set for UNet with ConvNeXt encoder, and the baseline UNet decoder (see Figure 4) with differently sized kernels in transposed convolution for feature map upscaling while keeping rest of the architecture fixed. Additional results are provided in Tab. 7 and Tab. 8 in Appendix B.1." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 346, + 482, + 401 + ], + "lines": [ + { + "bbox": [ + 133, + 346, + 482, + 401 + ], + "spans": [ + { + "bbox": [ + 133, + 346, + 482, + 401 + ], + "type": "table", + "html": "
TransposedConvolution KernelsCleanTest AccuracymIoU mAcc allAccFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations320mIoU mAcc allAcc
mIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAccmIoU mAccallAcc
2×2 (baseline)78.3486.8995.1553.5470.9686.0847.0265.4182.7823.0646.51
LCTC: 7×7 (Ours)78.9288.0695.2356.0274.1386.4549.2468.8982.8726.5353.05
LCTC: 11×11 + 3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6427.4953.08
7.0823.30
", + "image_path": "c072c6b6e93558b534d8f2a8bc38ca9565e1b94317dc916814397ecab60aa7ea.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 418, + 482, + 466 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 482, + 466 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 482, + 466 + ], + "type": "text", + "content": "on all considered blocks in the decoder network. Our experiments are conducted on the PASCAL VOC 2012 dataset [24]. We report the mean Intersection over Union (mIoU) of the predicted and ground truth segmentation mask, the mean accuracy over all pixels (mAcc), and the mean accuracy over all classes (allAcc)." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": "Results on Semantic Segmentation. We first discuss the results for different upsampling operations. The remaining architecture is kept identical, with ResNet-style building blocks in the decoder, throughout these experiments. The clean test accuracies are shown in Table 2. We see that as we increase the kernel size of the transposed convolution layers, there is a slight increase across all three evaluation metrics. Moreover, Figure 6 visually demonstrates that, as we increase the size of the kernels in transposed convolution from " + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "inline_equation", + "content": "2 \\times 2" + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": " (baseline) to " + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "inline_equation", + "content": "11 \\times 11" + }, + { + "bbox": [ + 130, + 485, + 482, + 616 + ], + "type": "text", + "content": ", the segmentations of the thin end and protrusions, for example, in the wing of the aircraft sample image are improving. The baseline model with small transposed convolution kernels could not predict these details. As hypothesized in H1, we observe that increasing the context can reduce spectral artifacts caused when representation and images are upsampled using LCTC." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Further, in Table 2, we evaluate the performance of the segmentation models against FGSM [28] and the multi-step attack SegPGD [34] adversarial attacks for the indicated " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " values. As expected, with the increasing intensity of the attack, the performance of all models drops. Yet, even at high attack intensities, the larger kernels perform better than" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 161, + 168, + 452, + 228 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": "Table 3: Adversarially trained models using FGSM (" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "inline_equation", + "content": "\\epsilon \\approx \\frac{8}{255}" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": ") from Table 2 tested against SegPGD adversarial attacks (" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "inline_equation", + "content": "\\epsilon \\approx \\frac{8}{255}" + }, + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": ") on UNet with ConvNeXt encoder and decoder with different sized kernels in the transposed convolution for upsampling, while keeping rest of the architecture identical. See Tab. 10 in Appendix B.6 for more evaluations including PGD training." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 161, + 168, + 452, + 228 + ], + "lines": [ + { + "bbox": [ + 161, + 168, + 452, + 228 + ], + "spans": [ + { + "bbox": [ + 161, + 168, + 452, + 228 + ], + "type": "table", + "html": "
TransposedConvolution KernelsCleanTest DatamIoU mAcc allAccSegPGD attack iterations
3mIoU mAcc allAcc20mIoU mAcc allAcc
\\( 2 \\times 2 \\)78.57 86.68 95.2326.59 48.99 67.717.6 24.06 31.37
LCTC: \\( 7 \\times 7 \\) (Ours)78.41 86.22 95.2028.11 53.39 66.308.36 28.54 28.13
LCTC: \\( 11 \\times 11 + 3 \\times 3 \\) (Ours)79.57 88.1 95.330.37 55.54 68.39.4 29.79 32.37
", + "image_path": "523c55e01c314fb1bf307aba439061ba4e6ee29a0a07212f9c9027f969204fec.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 292, + 483, + 380 + ], + "blocks": [ + { + "bbox": [ + 130, + 238, + 482, + 283 + ], + "lines": [ + { + "bbox": [ + 130, + 238, + 482, + 283 + ], + "spans": [ + { + "bbox": [ + 130, + 238, + 482, + 283 + ], + "type": "text", + "content": "Table 4: Empirical evaluations for H2 using a UNet with ConvNeXt encoder. We observe that across different-sized kernels in transposed convolution, for a fixed kernel size, increasing the context in the decoder building blocks by using larger kernels causes performance deterioration. These observations for image decoding contrast the findings on image encoding by [17, 51, 54]." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 292, + 483, + 380 + ], + "lines": [ + { + "bbox": [ + 133, + 292, + 483, + 380 + ], + "spans": [ + { + "bbox": [ + 133, + 292, + 483, + 380 + ], + "type": "table", + "html": "
Transposed Convolution KernelsDecoder Building Block StyleTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255) attack iterations
mIoU / mAcc / allAcc1/255mIoU / mAcc / allAcc8/255mIoU / mAcc / allAcc3mIoU / mAcc / allAcc20mIoU / mAcc / allAcc
2×2ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.34 / 86.89 / 95.1577.17 / 86.86 / 94.8177.17 / 86.86 / 94.8153.54 / 70.96 / 86.0849.98 / 72.22 / 83.9347.34 / 67.72 / 83.3447.02 / 65.41 / 82.7842.04 / 64.86 / 79.0837.91 / 57.79 / 78.2123.06 / 46.51 / 60.0417.94 / 44.81 / 47.9613.97 / 35.82 / 45.685.54 / 18.79 / 23.723.20 / 14.73 / 9.812.21 / 10.75 / 5.297.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 7×7 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×378.92 / 88.06 / 95.2377.57 / 87.04 / 94.9277.99 / 87.86 / 94.9656.02 / 74.13 / 86.4552.93 / 72.18 / 85.5151.61 / 73.01 / 84.8549.24 / 68.89 / 82.8744.89 / 65.71 / 80.7443.93 / 66.22 / 80.7326.53 / 53.05 / 61.1617.64 / 43.32 / 47.8017.07 / 42.30 / 48.787.17 / 23.05 / 27.521.86 / 7.18 / 3.551.70 / 7.11 / 3.04
LCTC: 11×11+3×3 (Ours)ResNet Style 3×3ConvNeXt style 7×7ConvNeXt style 11×11+3×379.33 / 87.81 / 95.4178.32 / 86.98 / 95.0977.42 / 86.24 / 94.9458.04 / 74.93 / 87.8053.31 / 72.45 / 86.1654.48 / 72.53 / 86.2551.25 / 69.31 / 84.6444.89 / 65.18 / 82.0346.67 / 66.59 / 82.2927.49 / 53.08 / 64.1316.14 / 40.65 / 50.3918.76 / 44.60 / 51.497.08 / 23.30 / 26.821.93 / 9.35 / 3.902.31 / 8.70 / 3.50
", + "image_path": "998ce861d929dea4cd1a14c4ae12fe47b40d1a04136fc66ab963927d988ec4c6.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 397, + 481, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 397, + 481, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 481, + 422 + ], + "type": "text", + "content": "the small ones, and we see a trend of improvement in performance as we increase the kernel size, providing more evidence for Hypothesis 1." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 430, + 482, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 482, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 482, + 491 + ], + "type": "text", + "content": "Ablation Study. In the following, we first consider the effects of additional adversarial training, then ablate on the impact of other decoder building blocks and the filter size. Variations of the model encoder are ablated in the Appendix B.2, the impact of using small parallel kernels in addition to large kernels is ablated and discussed in Appendix B.3, and competing upsampling techniques are ablated in Appendix B.5." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 494, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 494, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 494, + 482, + 567 + ], + "type": "text", + "content": "Adversarial Training. In Table 3, we report results for FGSM adversarially trained models under SegPGD attack, with attacks as in Table 2. While the overall performance under attack is improved as expected, the trend of LCTC providing better results persists. More results for FGSM attack and SegPGD attacks with different numbers of iterations are given in Tab. 7 and Tab. 8 in the Appendix. In Table 15, we additionally evaluate image restoration models under adversarial training." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 570, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 629 + ], + "type": "text", + "content": "Change in the decoder backbone architecture. While all previous experiments focused on the upsampling using transposed convolutions in the decoder, we now evaluate the influence of the convolutional kernel size within the decoder which does not upsample (see Section 4). For these experiments, we use a UNet-like architecture with a ConvNeXt backbone in the encoder and the PASCAL VOC 2012 dataset." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": "In Table 4 we observe, for a fixed transposed convolution kernel size, as we increase the size of the convolution kernel in the decoder building blocks, the performance of the model decreases. This phenomenon extends to the performance of the architectures" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 184, + 113, + 276, + 182 + ], + "blocks": [ + { + "bbox": [ + 184, + 113, + 276, + 182 + ], + "lines": [ + { + "bbox": [ + 184, + 113, + 276, + 182 + ], + "spans": [ + { + "bbox": [ + 184, + 113, + 276, + 182 + ], + "type": "image", + "image_path": "dba1adb58b2552621269cd5d4b2e02ad925b4e8a13364b15b7671c41de68c821.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "lines": [ + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "spans": [ + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "text", + "content": "Fig. 7: Performance comparison on PASCAL VOC2012 using UNet with ConvNeXt encoder for different LCTC sizes from " + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "inline_equation", + "content": "2 \\times 2" + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "text", + "content": " (small) to " + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "inline_equation", + "content": "31 \\times 31" + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "text", + "content": " (LCTC) kernels. All, besides the baseline with " + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "inline_equation", + "content": "2 \\times 2" + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "text", + "content": ", have a parallel " + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "text", + "content": " kernel, as shown in Figure 4 (bottom left). For the decoder building block backbone, a ResNet Style " + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 190, + 482, + 234 + ], + "type": "text", + "content": " style is used. See Tab. 9 for the values." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 277, + 113, + 430, + 182 + ], + "blocks": [ + { + "bbox": [ + 277, + 113, + 430, + 182 + ], + "lines": [ + { + "bbox": [ + 277, + 113, + 430, + 182 + ], + "spans": [ + { + "bbox": [ + 277, + 113, + 430, + 182 + ], + "type": "image", + "image_path": "62797189d1f74cada56500a124cdedd2f32546ae38f256affa1543d634fa3817.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 136, + 299, + 478, + 355 + ], + "blocks": [ + { + "bbox": [ + 130, + 245, + 482, + 289 + ], + "lines": [ + { + "bbox": [ + 130, + 245, + 482, + 289 + ], + "spans": [ + { + "bbox": [ + 130, + 245, + 482, + 289 + ], + "type": "text", + "content": "Table 5: Comparison of performances of different upsampling methods in the UNet-like architecture. All architectures use the baseline (ConvNeXt) encoder and " + }, + { + "bbox": [ + 130, + 245, + 482, + 289 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 245, + 482, + 289 + ], + "type": "text", + "content": " convolution kernels in the decoder block. Please refer to Table 13 in Appendix B.5 for more evaluations and discussion, including those with ConvNeXt style " + }, + { + "bbox": [ + 130, + 245, + 482, + 289 + ], + "type": "inline_equation", + "content": "7 \\times 7 + 3 \\times 3" + }, + { + "bbox": [ + 130, + 245, + 482, + 289 + ], + "type": "text", + "content": " Convolution kernels in the decoder blocks." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 299, + 478, + 355 + ], + "lines": [ + { + "bbox": [ + 136, + 299, + 478, + 355 + ], + "spans": [ + { + "bbox": [ + 136, + 299, + 478, + 355 + ], + "type": "table", + "html": "
Upsampling MethodTest AccuracyFGSM attack epsilonSegPGD (ε ≈ 8/255)attack iterations
mIoU mAcc allAcc1/255mIoU mAcc allAcc8/255mIoU mAcc allAcc5mIoU mAcc allAcc20mIoU mAcc allAcc
Pixel Shuffle78.5487.3295.1853.8271.5885.8846.6765.0381.7115.0638.8541.716.6923.4324.05
Nearest Neighbour Interpolation78.4088.1695.0952.6873.5184.5546.0867.9680.2215.3444.5336.217.6527.8920.48
Transposed Convolution 2×278.4586.6695.2053.7670.6286.3247.3364.5883.1614.4335.5045.305.5418.7923.72
LCTC: 11×11+3×3 (Ours)79.3387.8195.4158.0474.9387.8051.2569.3184.6418.1543.5149.367.0823.3026.82
", + "image_path": "f33c22591c5f9a969a2006ddcf7ab8a1a4158ba4ce30f9b6adc406605e639df7.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 364, + 482, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 482, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 482, + 448 + ], + "type": "text", + "content": "under adversarial attacks, showing that a mere increase in parameters in the model decoder does not have a positive effect on model performance or on its stability. This proves the validity of hypothesis H2. An explanation for this phenomenon could be that we only need to increase context during the actual upsampling step, increasing context in the consequent decoder building blocks has a negligible effect on the quality of representations learned. However, the increase in the number of parameters makes the architecture more susceptible to adversarial attacks." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": "Ablation on filter size saturation. After proving H1 one could argue that networks will consistently improve with increased kernel size for Large Context Transposed Convolutions. Hence, we test larger kernel sizes of " + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "inline_equation", + "content": "15 \\times 15" + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "inline_equation", + "content": "17 \\times 17" + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "inline_equation", + "content": "19 \\times 19" + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "inline_equation", + "content": "31 \\times 31" + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": " kernels. Yet, as seen in Figure 7, the effect of the kernel size appears to saturate: the performance after " + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "inline_equation", + "content": "13 \\times 13" + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": " and the performance of " + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "inline_equation", + "content": "31 \\times 31" + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": " kernels is not better than for " + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "inline_equation", + "content": "11 \\times 11" + }, + { + "bbox": [ + 130, + 449, + 482, + 521 + ], + "type": "text", + "content": " kernels. Yet, they are significantly better than the baseline's performance." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 522, + 482, + 557 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 557 + ], + "type": "text", + "content": "Ablation on different Upsampling Methods. Following, we compare different upsampling techniques thus justifying our advocacy for using LCTC instead of other upsampling techniques like interpolation and pixel shuffle in the real world." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "We report the comparison in Table 5 and observe that both Pixel shuffle and Nearest Neighbor interpolation perform better than the usually used Transposed Convolution with a " + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "inline_equation", + "content": "2 \\times 2" + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": " kernel size. However, as we increase the kernel size for Transposed Convolution to " + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "inline_equation", + "content": "11 \\times 11" + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": " with a " + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": " small kernel in parallel, we observe that LCTC is strictly outperforming Pixel Shuffle, on both clean unperturbed images and under adversarial attacks, across all metrics used. Large Context Transposed Convolutions are either outperforming or performing at par with Nearest Neighbor interpolation. Thus we demonstrate the superior clean and adversarial performance of Large Context Transposed Convolutions operation over other commonly used techniques." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 246, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 246, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 246, + 128 + ], + "type": "text", + "content": "5.3 Disparity Estimation" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 134, + 482, + 230 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 134, + 482, + 230 + ], + "spans": [ + { + "bbox": [ + 130, + 134, + 482, + 230 + ], + "type": "text", + "content": "To show that the observations extend from image restorations and segmentation to other tasks, we conduct additional experiments for disparity estimation. We consider the STTR-light [50] architecture, built from STTR, which is a recent state-of-the-art vision-transformer based model for disparity estimation and occlusion detection. To implement the proposed modification, we alter the kernel sizes in the transposed convolution layers used for pixel-wise upsampling in the \"feature extractor\" module of the architecture from " + }, + { + "bbox": [ + 130, + 134, + 482, + 230 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 134, + 482, + 230 + ], + "type": "text", + "content": " kernels to larger kernels. We conduct evaluations on FlyingThings3D [60] and keep all other details as implemented in [50]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "text", + "content": "In Table 6, we report the improvements in performance due to our architecture modification of increasing the size of the transposed convolution kernels used for upsampling, from the " + }, + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "text", + "content": " in the baseline model to " + }, + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "inline_equation", + "content": "7 \\times 7" + }, + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "text", + "content": " (LCTC). Similar to previous applications, the increased kernel sizes with parallel " + }, + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 231, + 276, + 348 + ], + "type": "text", + "content": " kernels further facilitate" + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 284, + 293, + 478, + 340 + ], + "blocks": [ + { + "bbox": [ + 281, + 236, + 482, + 292 + ], + "lines": [ + { + "bbox": [ + 281, + 236, + 482, + 292 + ], + "spans": [ + { + "bbox": [ + 281, + 236, + 482, + 292 + ], + "type": "text", + "content": "Table 6: Comparison of performance of STTR-light architecture with different sized kernels in transposed convolution for upsampling the feature maps in the feature extractor (lower is better). The entire set of results is provided as Tab. 17 in Appendix D.1." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 284, + 293, + 478, + 340 + ], + "lines": [ + { + "bbox": [ + 284, + 293, + 478, + 340 + ], + "spans": [ + { + "bbox": [ + 284, + 293, + 478, + 340 + ], + "type": "table", + "html": "
TransposedConvolution KernelsTest Accuracy3-Step PGD attack
epe↓3px error↓epe↓3px error↓
STTR-light [50] reported0.51.54--
3×3 [50] reproduced0.49271.544.0518.5
LCTC: 7×7 + 3×3 (Ours)0.47881.504.0218.3
", + "image_path": "4f570a875900b41ae66fa97a9003b562437fd34f5b0478a4606860068faaf3be.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 350, + 482, + 398 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 398 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 398 + ], + "type": "text", + "content": "to stabilize the model when attacked, as evaluated here for 3 attack iterations using PGD with " + }, + { + "bbox": [ + 130, + 350, + 482, + 398 + ], + "type": "inline_equation", + "content": "\\epsilon \\approx \\frac{8}{255}" + }, + { + "bbox": [ + 130, + 350, + 482, + 398 + ], + "type": "text", + "content": " on the disparity loss. Indicating that larger kernels in the transposed convolutions can better decode learned representations from the encoder regardless of the specific downstream task. We provide visual results in Appendix D.1." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 415, + 211, + 427 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 415, + 211, + 427 + ], + "spans": [ + { + "bbox": [ + 132, + 415, + 211, + 427 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "text", + "content": "We provide conclusive reasoning and empirical evidence for our hypotheses on the importance of context during upsampling. While increasing the size of convolutions during upsampling (LCTC) increases prediction stability, increasing the size of those convolution layers without upsampling does not benefit the network. This indicates that observations made for increased context during encoding do not translate to decoding. Further, we show that our simple LCTC can be directly incorporated into recent models, yielding better stability even in ViT-based architectures like Restormer, NAFNet, and STTR-light as well as in classical CNNs. Our observations are consistent across several architectures and downstream tasks." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "text", + "content": "Limitations. Current metrics for measuring performance do not completely account for spectral artifacts. Spectral artifacts begin affecting these metrics only when they become pronounced such as under adversarial attacks, and here LCTC consistently performs better across tasks and architectures. Ideally, we would want infinitely large kernels, however, with increasing kernel size and task complexity, training extremely large kernels can be challenging. Thus, in this work, while having ablated over kernels as large as " + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "inline_equation", + "content": "31 \\times 31" + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "text", + "content": ", we propose using kernels only as large as " + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "inline_equation", + "content": "7 \\times 7" + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "inline_equation", + "content": "11 \\times 11" + }, + { + "bbox": [ + 130, + 546, + 482, + 665 + ], + "type": "text", + "content": " for good practical trade-offs. Further improvements might be possible when jointly optimizing the encoder and decoder. Moreover, there might exist other factors that contribute to the introduction and existence of spectral artifacts such as spatial bias." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 115, + 236, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 115, + 236, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 115, + 236, + 129 + ], + "type": "text", + "content": "Acknowledgements." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 138, + 481, + 185 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 138, + 481, + 185 + ], + "spans": [ + { + "bbox": [ + 132, + 138, + 481, + 185 + ], + "type": "text", + "content": "Margret Keuper acknowledges funding by the DFG Research Unit 5336 - Learning to Sense. The OMNI cluster of the University of Siegen was used for some of the initial computations. Additionally, Shashank Agnihotri would like to thank Dr. Bin Zhao for his help in translating [75]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 202, + 190, + 214 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 202, + 190, + 214 + ], + "spans": [ + { + "bbox": [ + 133, + 202, + 190, + 214 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 224, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 138, + 224, + 481, + 257 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 224, + 481, + 257 + ], + "spans": [ + { + "bbox": [ + 138, + 224, + 481, + 257 + ], + "type": "text", + "content": "1. Agnihotri, S., Gandikota, K.V., Grabinski, J., Chandramouli, P., Keuper, M.: On the unreasonable vulnerability of transformers for image restoration-and an easy fix. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3707-3717 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 258, + 481, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 258, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 138, + 258, + 481, + 278 + ], + "type": "text", + "content": "2. Agnihotri, S., Grabinski, J., Keuper, J., Keuper, M.: Beware of aliases–signal preservation is crucial for robust image restoration. arXiv preprint arXiv:2406.07435 (2024)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 279, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 279, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 138, + 279, + 481, + 300 + ], + "type": "text", + "content": "3. Agnihotri, S., Jung, S., Keuper, M.: CosPGD: A unified white-box adversarial attack for pixel-wise prediction tasks. In: International Conference on Machine Learning (2024)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 300, + 481, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 300, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 300, + 481, + 331 + ], + "type": "text", + "content": "4. Aitken, A., Ledig, C., Theis, L., Caballero, J., Wang, Z., Shi, W.: Checkerboard artifact free sub-pixel convolution: A note on sub-pixel convolution, resize convolution and convolution resize. arXiv preprint arXiv:1707.02937 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 332, + 481, + 353 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 481, + 353 + ], + "type": "text", + "content": "5. Ba, J.L., Kiros, J.R., Hinton, G.E.: Layer normalization. arXiv preprint arXiv:1607.06450 (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 354, + 481, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 354, + 481, + 386 + ], + "spans": [ + { + "bbox": [ + 138, + 354, + 481, + 386 + ], + "type": "text", + "content": "6. Badki, A., Troccoli, A., Kim, K., Kautz, J., Sen, P., Gallo, O.: Bi3D: Stereo depth estimation via binary classifications. In: The IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 387, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 387, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 387, + 481, + 418 + ], + "type": "text", + "content": "7. Badrinarayanan, V., Kendall, A., Cipolla, R.: Segnet: A deep convolutional encoder-decoder architecture for image segmentation. IEEE transactions on pattern analysis and machine intelligence 39(12), 2481-2495 (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 419, + 481, + 439 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 419, + 481, + 439 + ], + "spans": [ + { + "bbox": [ + 138, + 419, + 481, + 439 + ], + "type": "text", + "content": "8. Baranchuk, D., Rubachev, I., Voynov, A., Khrulkov, V., Babenko, A.: Label-efficient semantic segmentation with diffusion models (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 440, + 481, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 440, + 481, + 450 + ], + "spans": [ + { + "bbox": [ + 138, + 440, + 481, + 450 + ], + "type": "text", + "content": "9. Brigham, E.O., Morrow, R.: The fast fourier transform. IEEE spectrum 4(12), 63-70 (1967)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 451, + 481, + 471 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 451, + 481, + 471 + ], + "spans": [ + { + "bbox": [ + 134, + 451, + 481, + 471 + ], + "type": "text", + "content": "10. Brunton, S.L., Kutz, J.N.: Data-driven science and engineering: Machine learning, dynamical systems, and control. Cambridge University Press (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 472, + 481, + 503 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 472, + 481, + 503 + ], + "spans": [ + { + "bbox": [ + 134, + 472, + 481, + 503 + ], + "type": "text", + "content": "11. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: European conference on computer vision. pp. 213-229. Springer (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 504, + 481, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 504, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 134, + 504, + 481, + 525 + ], + "type": "text", + "content": "12. Carlini, N., Wagner, D.: Towards evaluating the robustness of neural networks. In: 2017 IEEE symposium on security and privacy (sp). pp. 39-57. IEEE (2017)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 525, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 525, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 134, + 525, + 481, + 557 + ], + "type": "text", + "content": "13. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in neural information processing systems 33, 9912-9924 (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 558, + 481, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 558, + 481, + 590 + ], + "spans": [ + { + "bbox": [ + 134, + 558, + 481, + 590 + ], + "type": "text", + "content": "14. Chandrasegaran, K., Tran, N.T., Cheung, N.M.: A closer look at fourier spectrum discrepancies for cnn-generated images detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7200-7209 (June 2021)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 134, + 590, + 481, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 590, + 481, + 611 + ], + "spans": [ + { + "bbox": [ + 134, + 590, + 481, + 611 + ], + "type": "text", + "content": "15. Chang, J.R., Chen, Y.S.: Pyramid stereo matching network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5410-5418 (2018)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 134, + 612, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 612, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 612, + 481, + 632 + ], + "type": "text", + "content": "16. Chen, L., Chu, X., Zhang, X., Sun, J.: Simple baselines for image restoration. In: European Conference on Computer Vision. pp. 17-33. Springer (2022)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 134, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 633, + 481, + 665 + ], + "type": "text", + "content": "17. Ding, X., Zhang, X., Han, J., Ding, G.: Scaling up your kernels to 31x31: Revisiting large kernel design in cnns. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11963-11975 (2022)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 471, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 471, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 471, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "18. Dosovitskiy, A., Brox, T.: Generating images with perceptual similarity metrics based on deep networks. Advances in neural information processing systems 29 (2016)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 481, + 170 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 481, + 170 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 481, + 170 + ], + "type": "text", + "content": "19. Dosovitskiy, A., Brox, T.: Inverting visual representations with convolutional networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4829-4837 (2016)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 205 + ], + "type": "text", + "content": "20. Dosovitskiy, A., Fischer, P., Ilg, E., Hausser, P., Hazirbas, C., Golkov, V., Van Der Smagt, P., Cremers, D., Brox, T.: Flownet: Learning optical flow with convolutional networks. In: Proceedings of the IEEE international conference on computer vision. pp. 2758-2766 (2015)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "text", + "content": "21. Dosovitskiy, A., Springenberg, J.T., Tatarchenko, M., Brox, T.: Learning to generate chairs, tables and cars with convolutional networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 39(4), 692-705 (2017)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 238, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 238, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 238, + 481, + 258 + ], + "type": "text", + "content": "22. Dumoulin, V., Visin, F.: A guide to convolution arithmetic for deep learning. arXiv preprint arXiv:1603.07285 (2016)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 481, + 293 + ], + "type": "text", + "content": "23. Durall, R., Keuper, M., Keuper, J.: Watch your up-convolution: Cnn based generative deep neural networks are failing to reproduce spectral distributions. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 7890–7899 (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "text", + "content": "24. Everingham, M., Van Gool, L., Williams, C.K.I., Winn, J., Zisserman, A.: The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results. http://www.pascalnetwork.org/challenges/VOC/voc2012/workshop/index.html (2012)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 326, + 481, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 481, + 346 + ], + "type": "text", + "content": "25. Forsyth, D.A., Ponce, J.: Computer vision: a modern approach. Prentice Hall professional technical reference (2002)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 369 + ], + "type": "text", + "content": "26. Gal, R., Hochberg, D.C., Bermano, A., Cohen-Or, D.: SWAGAN: A style-based wavelet-driven generative model. ACM Transactions on Graphics (TOG) 40(4), 1-11 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 369, + 481, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 402 + ], + "type": "text", + "content": "27. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 402, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 481, + 424 + ], + "type": "text", + "content": "28. Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 425, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 425, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 425, + 481, + 456 + ], + "type": "text", + "content": "29. Grabinski, J., Jung, S., Keuper, J., Keuper, M.: Frequencylowcut pooling-plug and play against catastrophic overfitting. In: European Conference on Computer Vision. pp. 36-57. Springer (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 457, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 479 + ], + "type": "text", + "content": "30. Grabinski, J., Keuper, J., Keuper, M.: Aliasing and adversarial robust generalization of cnns. Machine Learning pp. 1-27 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "text", + "content": "31. Grabinski, J., Keuper, J., Keuper, M.: Aliasing coincides with cnns vulnerability towards adversarial attacks. In: The AAAI-22 Workshop on Adversarial Machine Learning and Beyond. pp. 1-5 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "type": "text", + "content": "32. Grabinski, J., Keuper, J., Keuper, M.: Fix your downsampling asap! be natively more robust via aliasing and spectral artifact free pooling (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 534, + 481, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 576 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 576 + ], + "type": "text", + "content": "33. Grabinski, J., Keuper, J., Keuper, M.: As large as it gets - studying infinitely large convolutions via neural implicit frequency filters. Transactions on Machine Learning Research (2024), https://openreview.net/forum?id=xRy1YRcHWj, featured Certification" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 577, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 577, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 577, + 481, + 610 + ], + "type": "text", + "content": "34. Gu, J., Zhao, H., Tresp, V., Torr, P.H.: Segpgd: An effective and efficient adversarial attack for evaluating and boosting segmentation robustness. In: European Conference on Computer Vision. pp. 308-325. Springer (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 481, + 643 + ], + "type": "text", + "content": "35. Guo, M.H., Lu, C.Z., Hou, Q., Liu, Z., Cheng, M.M., Hu, S.M.: Segnext: Rethinking convolutional attention design for semantic segmentation. Advances in Neural Information Processing Systems 35, 1140-1156 (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "text", + "content": "36. Hariharan, B., Arbeláez, P., Bourdev, L., Maji, S., Malik, J.: Semantic contours from inverse detectors. In: 2011 international conference on computer vision. pp. 991-998. IEEE (2011)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 232, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "37. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 151, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 151, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 151, + 481, + 194 + ], + "type": "text", + "content": "38. He, Y., Yu, N., Keuper, M., Fritz, M.: Beyond the spectrum: Detecting deepfakes via resynthesis. In: Zhou, Z.H. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. pp. 2534–2541. International Joint Conferences on Artificial Intelligence Organization (8 2021), main Track" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "type": "text", + "content": "39. Hendrycks, D., Dietterich, T.: Benchmarking neural network robustness to common corruptions and perturbations. Proceedings of the International Conference on Learning Representations (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 229, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 229, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 481, + 251 + ], + "type": "text", + "content": "40. Hendrycks, D., Gimpel, K.: Gaussian error linear units (gelus). arXiv preprint arXiv:1606.08415 (2016)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 251, + 481, + 283 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 481, + 283 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 481, + 283 + ], + "type": "text", + "content": "41. Hoffmann, J., Agnihotri, S., Saikia, T., Brox, T.: Towards improving robustness of compressed cnns. In: ICML Workshop on Uncertainty and Robustness in Deep Learning (UDL) (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 285, + 481, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 481, + 317 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 481, + 317 + ], + "type": "text", + "content": "42. Hossain, M.T., Teng, S.W., Lu, G., Rahman, M.A., Sohel, F.: Anti-aliasing deep image classifiers using novel depth adaptive blurring and activation function. Neurocomputing 536, 164-174 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 319, + 481, + 351 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 319, + 481, + 351 + ], + "spans": [ + { + "bbox": [ + 132, + 319, + 481, + 351 + ], + "type": "text", + "content": "43. Ilg, E., Mayer, N., Saikia, T., Keuper, M., Dosovitskiy, A., Brox, T.: Flownet 2.0: Evolution of optical flow estimation with deep networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2462-2470 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 353, + 481, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 353, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 132, + 353, + 481, + 373 + ], + "type": "text", + "content": "44. Jung, S., Keuper, M.: Spectral distribution aware image generation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 35, pp. 1734-1742 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 375, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 375, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 375, + 481, + 396 + ], + "type": "text", + "content": "45. Jung, S., Lukasik, J., Keuper, M.: Neural architecture design and robustness: A dataset. In: Eleventh International Conference on Learning Representations. OpenReview.net (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 398, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 398, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 398, + 481, + 430 + ], + "type": "text", + "content": "46. Karras, T., Aittala, M., Laine, S., Härkönen, E., Hellsten, J., Lehtinen, J., Aila, T.: Alias-free generative adversarial networks. Advances in Neural Information Processing Systems 34, 852-863 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 431, + 481, + 463 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 431, + 481, + 463 + ], + "spans": [ + { + "bbox": [ + 132, + 431, + 481, + 463 + ], + "type": "text", + "content": "47. Khayatkhoei, M., Elgammal, A.: Spatial frequency bias in convolutional generative adversarial networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 36, pp. 7152-7159 (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 464, + 481, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 481, + 486 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 481, + 486 + ], + "type": "text", + "content": "48. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems 25 (2012)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 487, + 481, + 519 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 481, + 519 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 481, + 519 + ], + "type": "text", + "content": "49. Kurakin, A., Goodfellow, I.J., Bengio, S.: Adversarial machine learning at scale. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=BJm4T4Kgx" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 520, + 481, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 520, + 481, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 520, + 481, + 563 + ], + "type": "text", + "content": "50. Li, Z., Liu, X., Drenkow, N., Ding, A., Creighton, F.X., Taylor, R.H., Unberath, M.: Revisiting stereo depth estimation from a sequence-to-sequence perspective with transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 6197-6206 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "type": "text", + "content": "51. Liu, S., Chen, T., Chen, X., Chen, X., Xiao, Q., Wu, B., Kärkkäinen, T., Pechenizkiy, M., Mocanu, D., Wang, Z.: More convnets in the 2020s: Scaling up kernels beyond 51x51 using sparsity. arXiv preprint arXiv:2207.03620 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "type": "text", + "content": "52. Liu, S., Deng, W.: Very deep convolutional neural network based image classification using small training sample size. In: 2015 3rd IAPR Asian conference on pattern recognition (ACPR). pp. 730-734. IEEE (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "53. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (2021)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 149 + ], + "type": "text", + "content": "54. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11976-11986 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "type": "text", + "content": "55. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 182, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 481, + 215 + ], + "type": "text", + "content": "56. Loshchilov, I., Hutter, F.: SGDR: Stochastic gradient descent with warm restarts. In: International Conference on Learning Representations (2017), https://openreview.net/forum?id=Skq89Scxx" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 247 + ], + "type": "text", + "content": "57. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=Bkg6RiCqY7" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 248, + 481, + 270 + ], + "type": "text", + "content": "58. Maiya, S.R., Ehrlich, M., Agarwal, V., Lim, S.N., Goldstein, T., Shrivastava, A.: A frequency perspective of adversarial robustness (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 271, + 481, + 292 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 481, + 292 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 481, + 292 + ], + "type": "text", + "content": "59. Mathew, A., Patra, A., Mathew, J.: Monocular depth estimators: Vulnerabilities and attacks. ArXiv abs/2005.14302 (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 335 + ], + "type": "text", + "content": "60. Mayer, N., Ilg, E., Hausser, P., Fischer, P., Cremers, D., Dosovitskiy, A., Brox, T.: A large dataset to train convolutional networks for disparity, optical flow, and scene flow estimation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4040-4048 (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "61. Moosavi-Dezfooli, S.M., Fawzi, A., Frossard, P.: Deepfool: a simple and accurate method to fool deep neural networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2574–2582 (2016)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 370, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 370, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 370, + 481, + 413 + ], + "type": "text", + "content": "62. Mosleh, A., Langlois, J.M.P., Green, P.: Image deconvolution ringing artifact detection and removal via psf frequency analysis. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) Computer Vision - ECCV 2014. pp. 247-262. Springer International Publishing, Cham (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 414, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 414, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 481, + 435 + ], + "type": "text", + "content": "63. Nah, S., Kim, T.H., Lee, K.M.: Deep multi-scale convolutional neural network for dynamic scene deblurring. In: CVPR (July 2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 435, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 481, + 456 + ], + "type": "text", + "content": "64. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proceedings of the IEEE international conference on computer vision. pp. 1520-1528 (2015)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 457, + 481, + 478 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 478 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 478 + ], + "type": "text", + "content": "65. Odena, A., Dumoulin, V., Olah, C.: Deconvolution and checkerboard artifacts. Distill 1(10), e3 (2016)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "text", + "content": "66. Peng, C., Zhang, X., Yu, G., Luo, G., Sun, J.: Large kernel matters - improve semantic segmentation by global convolutional network. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (July 2017)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "type": "text", + "content": "67. Pervin, M., Tao, L., Huq, A., He, Z., Huo, L., et al.: Adversarial attack driven data augmentation for accurate and robust medical image segmentation. arXiv preprint arXiv:2105.12106 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 545, + 481, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 481, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 481, + 566 + ], + "type": "text", + "content": "68. Radford, A., Metz, L., Chintala, S.: Unsupervised representation learning with deep convolutional generative adversarial networks. arXiv preprint arXiv:1511.06434 (2015)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 599 + ], + "type": "text", + "content": "69. Radosavovic, I., Kosaraju, R.P., Girshick, R., He, K., Dollar, P.: Designing network design spaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (June 2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 600, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 600, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 600, + 481, + 643 + ], + "type": "text", + "content": "70. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "text", + "content": "71. Scheurer, E., Schmalfuss, J., Lis, A., Bruhn, A.: Detection defenses: An empty promise against adversarial patch attacks on optical flow. arXiv preprint arXiv:2310.17403 (2023)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 24, + "blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "text", + "content": "72. Schmalfuss, J., Mehl, L., Bruhn, A.: Attacking motion estimation with adversarial snow. arXiv preprint arXiv:2210.11242 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 159 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 159 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 159 + ], + "type": "text", + "content": "73. Schmalfuss, J., Mehl, L., Bruhn, A.: Distracting downpour: Adversarial weather attacks for motion estimation (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "text", + "content": "74. Schmalfuss, J., Scholze, P., Bruhn, A.: A perturbation-constrained adversarial attack for evaluating the robustness of optical flow (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 183, + 480, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 183, + 480, + 204 + ], + "spans": [ + { + "bbox": [ + 133, + 183, + 480, + 204 + ], + "type": "text", + "content": "75. segcv: segcv/pspnet. https://github.com/segcv/PSPNet/blob/master/Train.md (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 134, + 205, + 480, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 205, + 480, + 225 + ], + "spans": [ + { + "bbox": [ + 134, + 205, + 480, + 225 + ], + "type": "text", + "content": "76. Shannon, C.E.: Communication in the presence of noise. Proceedings of the IRE 37(1), 10-21 (1949)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 227, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 227, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 134, + 227, + 480, + 258 + ], + "type": "text", + "content": "77. Shi, W., Caballero, J., Huszar, F., Totz, J., Aitken, A.P., Bishop, R., Ruekert, D., Wang, Z.: Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 134, + 260, + 480, + 292 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 260, + 480, + 292 + ], + "spans": [ + { + "bbox": [ + 134, + 260, + 480, + 292 + ], + "type": "text", + "content": "78. Si-Yao, L., Ren, D., Yin, Q.: Understanding kernel size in blind deconvolution. In: 2019 IEEE Winter Conference on Applications of Computer Vision (WACV). pp. 2068-2076. IEEE (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 293, + 480, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 293, + 480, + 313 + ], + "spans": [ + { + "bbox": [ + 134, + 293, + 480, + 313 + ], + "type": "text", + "content": "79. Smith III, J.O.: Physical audio signal processing: For virtual musical instruments and audio effects. (No Title) (2010)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 134, + 315, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 315, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 134, + 315, + 480, + 346 + ], + "type": "text", + "content": "80. Sommerhoff, H., Agnihotri, S., Saleh, M., Moeller, M., Keuper, M., Kolb, A.: Differentiable sensor layouts for end-to-end learning of task-specific camera parameters. arXiv preprint arXiv:2304.14736 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 134, + 347, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 347, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 134, + 347, + 480, + 369 + ], + "type": "text", + "content": "81. Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 (2013)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 134, + 370, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 370, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 134, + 370, + 480, + 391 + ], + "type": "text", + "content": "82. Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International conference on machine learning. pp. 10096-10106. PMLR (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 134, + 392, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 392, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 134, + 392, + 480, + 424 + ], + "type": "text", + "content": "83. Teed, Z., Deng, J.: Raft: Recurrent all-pairs field transforms for optical flow. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part II 16. pp. 402-419. Springer (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 425, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 425, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 134, + 425, + 480, + 456 + ], + "type": "text", + "content": "84. Touvron, H., Cord, M., Douze, M., Massa, F., Sablayrolles, A., Jégou, H.: Training data-efficient image transformers & distillation through attention. In: International conference on machine learning. pp. 10347-10357. PMLR (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 458, + 480, + 489 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 458, + 480, + 489 + ], + "spans": [ + { + "bbox": [ + 134, + 458, + 480, + 489 + ], + "type": "text", + "content": "85. Tsipras, D., Santurkar, S., Engstrom, L., Turner, A., Madry, A.: Robustness may be at odds with accuracy. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=SyxAb30cY7" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 491, + 480, + 521 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 491, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 134, + 491, + 480, + 521 + ], + "type": "text", + "content": "86. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 523, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 523, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 134, + 523, + 480, + 544 + ], + "type": "text", + "content": "87. Xu, L., Ren, J.S., Liu, C., Jia, J.: Deep convolutional neural network for image deconvolution. Advances in neural information processing systems 27 (2014)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 545, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 545, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 134, + 545, + 480, + 566 + ], + "type": "text", + "content": "88. Yamanaka, K., Matsumoto, R., Takahashi, K., Fujii, T.: Adversarial patch attacks on monocular depth estimation networks. IEEE Access 8, 179094-179104 (2020)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 134, + 567, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 567, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 134, + 567, + 480, + 599 + ], + "type": "text", + "content": "89. Zamir, S.W., Arora, A., Khan, S., Hayat, M., Khan, F.S., Yang, M.H.: Restormer: Efficient transformer for high-resolution image restoration. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5728-5739 (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 134, + 600, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 600, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 134, + 600, + 480, + 620 + ], + "type": "text", + "content": "90. Zhang, H., Yu, Y., Jiao, J., Xing, E., El Ghaoui, L., Jordan, M.: Theoretically principled trade-off between robustness and accuracy. In: ICML (2019)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 134, + 622, + 444, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 622, + 444, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 622, + 444, + 632 + ], + "type": "text", + "content": "91. Zhang, R.: Making convolutional networks shift-invariant again. In: ICML (2019)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 134, + 633, + 416, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 633, + 416, + 643 + ], + "spans": [ + { + "bbox": [ + 134, + 633, + 416, + 643 + ], + "type": "text", + "content": "92. Zhao, H.: semseg. https://github.com/hszhao/semseg (2019)" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 134, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 644, + 480, + 665 + ], + "type": "text", + "content": "93. Zhao, H., Shi, J., Qi, X., Wang, X., Jia, J.: Pyramid scene parsing network. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2881-2890 (2017)" + } + ] + } + ], + "index": 23 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 274, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Feature Stability during Upsampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 471, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 471, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 471, + 91, + 481, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 160 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "text", + "content": "94. Zhao, H., Zhang, Y., Liu, S., Shi, J., Loy, C.C., Lin, D., Jia, J.: PSANet: Point-wise spatial attention network for scene parsing. In: ECCV (2018)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 139, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 139, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 481, + 160 + ], + "type": "text", + "content": "95. Zou, X., Xiao, F., Yu, Z., Lee, Y.J.: Delving deeper into anti-aliasing in convnets. In: BMVC (2020)" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "20" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 102 + ], + "type": "text", + "content": "S. Agnihotri et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 19 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_content_list.json b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..0df03ab428d971d8bf48081ec2964c62583d7106 --- /dev/null +++ b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_content_list.json @@ -0,0 +1,1773 @@ +[ + { + "type": "text", + "text": "Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance", + "text_level": 1, + "bbox": [ + 240, + 141, + 763, + 184 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Reyhane Askari Hemmat $^{1}$ , Melissa Hall $^{1}$ , Alicia Sun $^{1}$ , Candace Ross $^{1}$ , Michal Drozdzal $^{1}$ , and Adriana Romero-Soriano $^{1,2,3,4}$", + "bbox": [ + 233, + 210, + 767, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 FAIR at Meta, 2 Mila, 3 McGill University, 4 Canada CIFAR AI Chair", + "bbox": [ + 256, + 253, + 743, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. With the growing popularity of text-to-image generative models, there has been increasing focus on understanding their risks and biases. Recent work has found that state-of-the-art models struggle to depict everyday objects with the true diversity of the real world and have notable gaps between geographic regions. In this work, we aim to increase the diversity of generated images of common objects such that per-region variations are representative of the real world. We introduce an inference-time intervention, contextualized Vendi Score Guidance (c-VSG), that guides the backwards steps of latent diffusion models to increase the diversity of a sample as compared to a \"memory bank\" of previously generated images while constraining the amount of variation within that of an exemplar set of real-world contextualizing images. We evaluate c-VSG with two geographically representative datasets and find that it substantially increases the diversity of generated images, both for the worst-performing regions and on average, while simultaneously maintaining or improving image quality and consistency. Additionally, qualitative analyses reveal that diversity of generated images is significantly improved, including along the lines of reductive region portrayals present in the original model. We hope that this work is a step towards text-to-image generative models that reflect the true geographic diversity of the world.", + "bbox": [ + 259, + 301, + 743, + 593 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: geo-diversity $\\cdot$ image generation $\\cdot$ diffusion models", + "bbox": [ + 261, + 606, + 686, + 621 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 666, + 375, + 681 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The unprecedented results achieved by text-to-image systems [15,32,36,39] and their wide-spread use as plug-and-play solutions have propelled a body of research to understand their potential risks and biases [18,27]. Recent works have highlighted through qualitative and quantitative evaluations the disparities in demographic traits of people represented in the generated images [19,31,49], triggering the design of mitigation strategies based on textual interventions [16], attention-weight modification [17], and semantic guidance [14].", + "bbox": [ + 212, + 696, + 787, + 805 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Equal Contribution.", + "bbox": [ + 218, + 811, + 369, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "1 https://github.com/facebookresearch/Contextualized-Vendi-Score-Guidance", + "bbox": [ + 220, + 824, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/307d3d9394a24da6021903b8f71570aa552d3141691ef2276cd35c8975880b3b.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 243, + 159, + 496, + 299 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/26ae13afff23f9b14c03a368b77c86fb4aa3e08f9fb4ee553946a294e0c4e404.jpg", + "image_caption": [ + "(b)", + "Fig.1: (a) We present Contextualized Vendi Score Guidance (c-VSG), an inference-time intervention to increase the diversity of images generated by latent diffusion models (LDMs). c-VSG guides backwards steps of the diffusion process using the Vendi Score [13] to increase the diversity among a sample $x_{t}$ and a memory bank of previous generations (with weight $\\alpha$ ) while constraining excessive variation using a small set of real, contextualizing exemplar images (with weight $\\beta$ ). (b) Generations of dog in Africa, all with the same seed. First row has zero c-VSG guidance scale and as a result all samples are the same. As we increase the c-VSG guidance scale, we observe increased diversity in generations." + ], + "image_footnote": [], + "bbox": [ + 504, + 157, + 754, + 299 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Beyond human-centric representations, research has shown that stereotypical biases also occur for representations of objects and their surroundings across the globe [2,4,18]. In particular, previous studies highlighted that progress in image quality or realism has come at the expense of representation diversity and text-image consistency [18]. This trade-off affects some regions more than others, hindering the progress towards conditional image generative systems that truly work well for all geographic regions. Notably, images generated with text prompts that include regional information contain limited object diversity and heightened geographic stereotypes. As shown in [18], many generations depict limited diversity in object type. Yet, to the best of our knowledge, no mitigation strategies have directly targeted geo-diversity in text-to-image systems.", + "bbox": [ + 212, + 487, + 787, + 654 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we aim to mitigate disparities in representation diversity of common objects across worldwide regions. More precisely, our goal is to increase the objects' representation diversity such that per-region variation in type of object, as observed in the real world, is better reflected in the generations. In doing so, we aim to maintain (or improve) the quality of images as well as their text-image consistency.", + "bbox": [ + 212, + 656, + 789, + 747 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We devise a novel approach called Vendi Score Guidance (VSG) that increases the representation diversity of the generations by leveraging the Vendi Score (VS) [13] - a dataset diversity evaluation metric. In particular, VSG extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other, intuitively maximizing the effective number of samples among the obtained generations. This", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 496, + 127 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 821, + 609, + 831, + 619 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 885, + 627, + 893, + 635 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "requires the proposed guidance strategy to operate auto-regressively w.r.t. the previous generations. We implement this by keeping a memory bank of past generations that ensures that the current sample differs from those in the memory.do Yet, increasing diversity in an unconstrained way results in generations that lack either image realism or text-generation consistency. Therefore, we propose to contextualize VSG by providing a small set of randomly selected real images of objects, referred to as exemplar images, and guiding the generation process towards diverse samples that are grounded on those exemplar images. We evaluate the proposed approach by measuring precision [26,40], recall [26,40], and CLIPScore [24] to assess image realism/quality, representation diversity, and text-image consistency, respectively. We report results on two geographically diverse datasets that contain images of the common objects collected around the world, GeoDE [35] and DollarStreet [38].", + "bbox": [ + 212, + 146, + 787, + 345 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our results show that contextualized Vendi Score Guidance improves worst-region and average F1 for both datasets, including a relative improvement of $40\\%$ in worst-region F1 over the Latent Diffusion Model (LDM) baseline without any intervention when measured on GeoDE and $11\\%$ over the next closest baseline, and reduces performance disparities across regions. Even without contextualization, VSG shows relative improvements of up to $10\\%$ over the LDM baseline in F1. Upon visual inspection we find the object diversity in images to be significantly improved, with greater variation in object color, type, shape, and size. In addition, VSG improvements often coincide with improved regional representations beyond reductive portrayals present in the original model. Finally, we find in ablations that our combined use of the Vendi Score to encourage image diversity relative to previous generations while constraining variation to that of the real world with contextualizing exemplar images meaningfully navigates the diversity vs. quality tradeoff.", + "bbox": [ + 212, + 361, + 787, + 571 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The contributions of this work can be summarized as follows:", + "bbox": [ + 238, + 590, + 683, + 606 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We introduce a new inference-time intervention, contextualized Vendi Score Guidance (c-VSG), to increase the diversity of images generated by LDMs using a memory bank of previously generated images and exemplar images.", + "- When evaluated with two geographically representative real world datasets, c-VSG shows significant improvement in diversity and quality over the vanilla LDM, while maintaining text-image consistency.", + "- c-VSG shows improvements in average and worst-region F1 over state-of-the-art baselines, while exhibiting reduced disparities in quality, diversity and text-generation consistency across regions.", + "- Our ablations demonstrate the efficacy of the memory and contextualizing components of the c-VSG criterion." + ], + "bbox": [ + 225, + 625, + 784, + 789 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We hope this work contributes to image generations that better reflect the geographic diversity of the real world.", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 730, + 127 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Method", + "text_level": 1, + "bbox": [ + 215, + 143, + 330, + 160 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this work, we focus on increasing the diversity of latent diffusion models (LDMs). We first provide preliminary details about the components of the LDM generation process in which we apply our interventions, as well as the Vendi Score metric. Then, we introduce our proposed methodology, Vendi Score Guidance.", + "bbox": [ + 214, + 176, + 787, + 237 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.1 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 258, + 372, + 272 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Sampling in LDMs. In this work, we focus on a class of LDMs called denoising diffusion implicit models (DDIMs) [45]. At inference or generation time, DDIMs use a reverse process defined as:", + "bbox": [ + 214, + 282, + 787, + 329 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\nx _ {t - 1} = \\sqrt {\\xi_ {t - 1}} \\hat {x} _ {0, t} + \\underbrace {\\sqrt {1 - \\xi_ {t - 1} - \\sigma_ {t} ^ {2}} \\cdot \\epsilon_ {\\theta} ^ {(t)} (x _ {t})} _ {\\text {d i r e c t i o n p o i n t i n g t o} x _ {t}} + \\underbrace {\\sigma_ {t} \\epsilon_ {t}} _ {\\text {r a n d o m n o i s e}}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 292, + 339, + 785, + 385 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $x_{t}$ is the sample at time step $t$ , $\\epsilon_t \\sim \\mathcal{N}(\\mathbf{0},\\mathbf{I})$ and $\\xi_{t}$ and $\\sigma_{t}$ are time-dependent coefficients, and $\\hat{x}_{0,t}$ is the DDIM approximation of the denoised sample given current $x_{t}$ ,", + "bbox": [ + 214, + 395, + 787, + 441 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {x} _ {0, t} = \\operatorname {D D I M A p p r o x} \\left(x _ {t}\\right) := \\frac {x _ {t} - \\sqrt {1 - \\xi_ {t}} \\epsilon_ {\\theta} ^ {(t)} \\left(x _ {t}\\right)}{\\sqrt {\\xi_ {t}}}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 450, + 785, + 488 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "and $\\epsilon_{\\theta}^{(t)}$ is the pretrained denoising network parameterized by $\\theta$ that approximates the score function conditioned on a class or prompt $y$ ,", + "bbox": [ + 214, + 500, + 785, + 531 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p (x _ {t} | y). \\qquad \\qquad (3)\n$$\n", + "text_format": "latex", + "bbox": [ + 426, + 541, + 785, + 561 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this work, we modify this score function to guide the sampling process towards generating more diverse samples.", + "bbox": [ + 214, + 571, + 785, + 601 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Guidance in LDMs. LDMs often condition generated samples on labels or text prompts in the score function. If one has access to a pretrained denoising network that only approximates the unconditional score function $(\\nabla_{x}\\log p(x))$ , one can use classifier-guidance [12] to generate a conditional sample. Classifier-guidance modifies the score function using a pretrained classifier that provides $\\log p(y|x_t)$ ,", + "bbox": [ + 214, + 602, + 787, + 694 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p _ {\\gamma} (x _ {t} | y) = \\nabla_ {x} \\log p (x _ {t}) + \\gamma \\nabla_ {x} \\log p (y | x _ {t}), \\qquad (4)\n$$\n", + "text_format": "latex", + "bbox": [ + 307, + 704, + 785, + 724 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\gamma$ is a scaling factor controlling the strength of class-conditional generation. In this work, we adapt this concept of guidance by utilizing the Vendi Score [13], rather than a classifier, as our guidance function.", + "bbox": [ + 214, + 734, + 785, + 779 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Vendi Score (VS). The VS is a metric for evaluating diversity in machine learning [13]. It applies a user-defined similarity function to a set of samples, without the need for a reference dataset as opposed to metrics such as recall or coverage [26,30,40]. VS measures the effective number of examples by computing", + "bbox": [ + 214, + 779, + 787, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 496, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "the soft-rank of a similarity or kernel matrix. The similarity matrix is calculated using a similarity function that takes two samples and returns a positive value indicating how similar they are. Higher rank of the similarity matrix corresponds to higher Vendi Score and diversity.", + "bbox": [ + 212, + 146, + 782, + 205 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Formally, given a set of samples $x_{1},\\ldots ,x_{n}$ , we can define a positive semi-definite similarity function $k$ with $k(x,x) = 1$ for all $x$ . The similarity function is applied on every pair of samples in our dataset to create a similarity matrix, $\\mathcal{K}$ where $\\mathcal{K}_{i,j} = k(x_i,x_j)$ . VS is then defined as the soft-rank of $\\mathcal{K} / n$ , i.e., the exponential of the entropy of the eigenvalues of $\\mathcal{K} / n$ [13]:", + "bbox": [ + 212, + 208, + 784, + 285 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {V S} \\left(x _ {1}, \\dots , x _ {n}\\right) = \\exp \\left(- \\sum_ {i = 1} ^ {n} \\lambda_ {i} \\log \\lambda_ {i}\\right), \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 299, + 785, + 340 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\lambda_1, \\ldots, \\lambda_n$ are the eigenvalues of $\\mathcal{K} / n$ .", + "bbox": [ + 214, + 349, + 537, + 364 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A common choice for the similarity function is the cosine-similarity of every pair of samples in the dataset in a pre-defined feature space.", + "bbox": [ + 212, + 366, + 782, + 396 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.2 Vendi Score Guidance", + "text_level": 1, + "bbox": [ + 214, + 425, + 444, + 439 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we introduce our proposed approach, called Vendi Score Guidance (VSG). Our goal is to increase the diversity of the generated samples by incorporating the Vendi Score as an auto-regressive guidance mechanism during diffusion model inference. In other words, every new generation will take into consideration all previously generated samples and will aim to generate a sample which is substantially different from the previous ones.", + "bbox": [ + 212, + 455, + 784, + 546 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Let us define a memory bank which contains all the previously generated samples as $\\mathbf{X}_{\\mathbf{f}}: \\{x^{1}, \\ldots, x^{n}\\}$ . Given the $\\mathbf{X}_{\\mathbf{f}}$ , and a newly generated sample $x$ , we can compute $\\mathrm{VS}(x, \\mathbf{X}_{\\mathbf{f}})$ . Our goal is to modify the generation process of $x$ by steering it towards part of the manifold that increases VS, and thus, augment the sample diversity. We can achieve this via the following score function,", + "bbox": [ + 212, + 547, + 784, + 623 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p _ {\\gamma , \\alpha} \\left(x _ {t} | y, \\mathbf {X} _ {\\mathbf {f}}\\right) = \\nabla_ {x} \\log p _ {\\gamma} \\left(x _ {t} | y\\right) + \\alpha \\nabla_ {x} \\operatorname {V S} \\left(\\hat {x} _ {0, t}, \\mathbf {X} _ {\\mathbf {f}}\\right), \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 269, + 638, + 784, + 657 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\alpha$ is a scaling factor that controls the strength of the Vendi Score guidance and $\\hat{x}_{0,t}$ is the predicted denoised sample.", + "bbox": [ + 212, + 671, + 782, + 700 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A naive way of finding $\\hat{x}_{0,t}$ is to apply all the $T$ steps of the backward diffusion process and use the denoised image to compute the Vendi Score. However, this is computationally expensive. Thus, we use the efficient DDIM approximation of a denoised sample, given in Eq. 2.", + "bbox": [ + 212, + 702, + 784, + 762 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We note that the original Vendi Score formulation in Eq. 5 is not differentiable, since it requires finding the singular values of the similarity matrix, and singular value decomposition is not differentiable. To overcome this limitation, we developed a simple algorithm to compute the Vendi Score in a differentiable way and present it in Appendix 6.2.", + "bbox": [ + 212, + 763, + 785, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 732, + 127 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Contextualized Vendi Score Guidance (c-VSG). In experimentation, we found that unconstrained VSG can have limited efficacy, as generated images may drift from real world representations. Thus, in the second part of our method, we use Vendi Score a second time with a small set of randomly selected exemplar images, $\\mathbf{X}_{\\mathbf{r}}$ . This set of exemplar images is used to contextualize the Vendi Score computation and thus, the generation process. Similar to Eq. 6, we compute $\\mathrm{VS}(x,\\mathbf{X_r})$ . However, because we want to reduce excessive drift from the exemplar representation of images, we calculate the gradients with respect to the negative of this score. Overall, we use the following score function which combines VSG with contextualized samples:", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\nabla_ {x} \\log p (x _ {t} | y, \\mathbf {X _ {f}}, \\mathbf {X _ {r}}) = \\nabla_ {x} \\log p _ {\\gamma , \\alpha} (x _ {t} | y, \\mathbf {X _ {f}}) - \\beta \\nabla_ {x} \\mathrm {V S} (\\hat {x} _ {0, t}, \\mathbf {X _ {r}}), \\qquad (7)\n$$\n", + "text_format": "latex", + "bbox": [ + 267, + 310, + 785, + 327 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\beta$ is a scaling factor that controls the strength of VSG contextualization. This formulation allows the model to generate samples that remain close to the exemplar images without the need for additional training. Intuitively, the modified score function (Eq. 7) steers the generation process towards parts of the space which would result in a sample that increases the rank of the memory bank while staying close to the exemplar images.", + "bbox": [ + 212, + 338, + 787, + 429 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Algorithm $\\mathbb{I}$ presents the c-VSG computation step by step. Note that we use $G_{\\text{freq}}$ to control the rate at which c-VSG is applied in the diffusion process, allowing for a balance between efficiency and diversity. To generate image $x^n$ , we apply the proposed guidance in the backward diffusion process. In the intermediate steps and when the sample is not yet generated, we use DDIM's approximation of $\\hat{x}_0$ and feed it to the VS computation. After the final diffusion step and once the image is completely denoised, $x^n$ is added to the memory bank of generated images and used for future image generations.", + "bbox": [ + 212, + 430, + 787, + 551 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3 Experiments", + "text_level": 1, + "bbox": [ + 215, + 575, + 375, + 593 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we describe evaluation datasets and metrics, baselines, and setup. We then present experimental results and ablations.", + "bbox": [ + 212, + 608, + 785, + 640 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Datasets and metrics", + "text_level": 1, + "bbox": [ + 215, + 662, + 437, + 676 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In our experiments, we report worst-region and average F1, recall, precision, and CLIPScore. We follow [18] and evaluate performance w.r.t. two geographically diverse datasets containing images of objects in multiple regions: GeoDE [35] and DollarStreet [38]. Both datasets contain images of objects in their everyday settings and are intended to be geographically representative. However, images in GeoDE were submitted by people living in the regions of interest and were collected with specific guidelines, e.g., that the object of focus fills at least $25\\%$ of the image, while images in DollarStreet were collected by photographers who travelled to various regions, with a special focus on \"disadvantaged and isolated areas\" [38]. Thus, DollarStreet likely has more income variation than GeoDE.", + "bbox": [ + 212, + 689, + 787, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 496, + 128 + ], + "page_idx": 5 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1 Contextualized Vendi Score Guidance (c-VSG)" + ], + "code_body": "Require: Class label $y$ , a single fake image $x_{f}$ , a tensor of $M$ real images $\\mathbf{X}_{\\mathbf{r}}$ , pretrained diffusion model $\\epsilon_{\\theta}$ , $N$ number of generations to obtain, $T$ number of diffusion steps, $G$ frequency, $\\alpha$ , $\\beta$ and $\\gamma$ guidance weights \nEnsure: $\\mathbf{X}_{\\mathbf{f}}$ a tensor with $N$ diverse model samples \n $\\mathbf{X}_{\\mathbf{f}} \\gets x_{f}$ \nfor $n = 1, \\ldots, N - 1$ do \n $x^{n} \\sim \\mathcal{N}(\\mathbf{0}, \\mathbf{I})$ \nfor $t = T, \\ldots, 1$ do \nif $t \\% G$ frequency == 0 then \n $\\hat{x}_{0,t}^{n} = \\mathrm{DDIMApprox}(x_{t}^{n})$ $\\epsilon_{\\theta}^{(t)} \\gets \\nabla_{x} \\log p_{\\gamma}(x_{t}|y) + \\alpha \\nabla_{x} \\mathrm{VS}(\\hat{x}_{0,t}^{n}, \\mathbf{X}_{\\mathbf{f}}) - \\beta \\nabla_{x} \\mathrm{VS}(\\hat{x}_{0,t}^{n}, \\mathbf{X}_{\\mathbf{r}})$ $\\boldsymbol{x}_{t-1}^{n} \\gets$ one step of DDIM \nelse \n $\\epsilon_{\\theta}^{(t)} \\gets \\nabla_{x} \\log p_{\\gamma}(x_{t}|y)$ $\\boldsymbol{x}_{t-1}^{n} \\gets$ one step of DDIM \nend if \nend for \n $\\mathbf{X}_{\\mathbf{f}} \\gets \\mathrm{cat}(\\mathbf{X}_{\\mathbf{f}}, x_{0}^{n})$ \nAdd final denoised sample to the memory \nend for", + "bbox": [ + 215, + 165, + 785, + 433 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Furthermore, DollarStreet contains large imbalances between regions. We filter GeoDE to obtain 180 images from each region for a total of 27 objects. The remaining images are used as the pool for randomly selected exemplar real images. We subsample DollarStreet so that images contain only one concrete class, e.g., removing classes corresponding to favorite objects and images with multiple classes, and use the original distribution exclusive of the images used for contextualizing. For CLIPScore, we compute the average of the $10th$ -percentile for each object class, as prior work suggests that the lower tail of the distribution tends to be most informative in capturing generation inconsistencies [18, 20].", + "bbox": [ + 212, + 462, + 787, + 602 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.2 Baselines", + "text_level": 1, + "bbox": [ + 215, + 619, + 339, + 633 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We split our discussion between baselines that do not utilize any information specific to the task in order to improve generation diversity, and those that use small amounts of information from the task. To see examples of generations for different methods, see Appendix 6.4", + "bbox": [ + 212, + 643, + 787, + 704 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Without any additional information:", + "text_level": 1, + "bbox": [ + 215, + 705, + 519, + 718 + ], + "page_idx": 6 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- LDM: This is the baseline setup where the unaltered LDM is used with the prompt {object} in {region} to condition the generation process.", + "- Synonyms: This strategy maps each object class to its corresponding ImageNet [11] class and WordNet [29] synset. Each synset contains lemmas representing a specific \"sense\" of the given class. We generate images stratified across all possible lemmas (including the original object word), for each class, i.e., {synonym} in {region} is used to condition the generation process. The list of synonyms can be found in Appendix [6.1]." + ], + "bbox": [ + 225, + 719, + 785, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "With additional information:", + "text_level": 1, + "bbox": [ + 215, + 146, + 457, + 159 + ], + "page_idx": 7 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Paraphrasing: We use the LLaMA-2-70B-chat [48] large language model to generate paraphrases of the original prompt template, {object} in {region}. We include the specifications and descriptions used in the collection of GeoDE and DollarStreet. The metaprompts and paraphrases, as well as our method of tuning prompts and model specifications, are included in Appendix [6.1].", + "- Semantic Guidance: As observed in [18] and highlighted in Fig. 3, generated images tend to contain diversity issues related to the magnification of region-specific representations of objects beyond those in the evaluation task. To reduce this amplification of region information in the generated images, we employ Semantic Guidance [6,14] by adding negative guidance corresponding to the region term for each generation. Note that this baseline requires knowing the biases embedded in the text-to-image system upfront.", + "- Feedback Guidance (FG): Following [22,43], during generation we use feedback from an external CLIP-based classifier to predict region labels of the generated images. We experiment with two versions of feedback guidance to encourage more diverse generations: one that maximizes the loss of the classifier and one that maximizes the entropy of predicted class distributions.", + "- Textual Inversion: Textual inversion injects a learned token embedding using small subset of images from the evaluation task to better represent the reference images [16]. We apply textual inversion by learning an embedding for each object in the evaluation dataset using four images per object." + ], + "bbox": [ + 225, + 162, + 799, + 479 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Experimental set-up", + "text_level": 1, + "bbox": [ + 215, + 505, + 429, + 520 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We perform all experiments using an open sourced version of an LDM trained on a large scale dataset [39]. For c-VSG, we use $\\alpha = 1$ and $\\beta = 2$ unless otherwise specified, with two exemplar images as real world context and set $G_{\\text{freq}}$ to 5. We calculate the Vendi Score in the CLIP ViT-B32 [34] feature space. For each method, we perform a hyperparameter search across guidance scales, as well as the weighting of contextual information, where applicable. We perform one-region-out hyper-parameter selection, selecting the best hyper-parameters for a given region based on the F1 for all the other regions. For computational complexity and efficiency see Appendix Sec. [6.5].", + "bbox": [ + 212, + 532, + 787, + 672 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.4 Results", + "text_level": 1, + "bbox": [ + 215, + 695, + 323, + 709 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Overall results. On GeoDE (reported in Tab. 1), VSG without contextualization achieves a relative improvement in average F1 of $9.6\\%$ over generations obtained with the LDM (VSG achieves F1 of 0.399 and LDM achieves F1 of 0.364), an improvement over baselines that do not leverage any additional information. Similarly, VSG yields relative improvement in worst-region F1 by $10.6\\%$ .", + "bbox": [ + 212, + 723, + 787, + 801 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 496, + 127 + ], + "page_idx": 7 + }, + { + "type": "page_footnote", + "text": "2 In this baseline, we do not implement the additional real/fake discriminator as suggested in [43], as we focus only on methods that utilize existing classifiers.", + "bbox": [ + 217, + 810, + 785, + 842 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/d0f2ccc351259c5e16c1d120ad1aa4e8fbbca30f0fe2a252db10fe581d905147.jpg", + "table_caption": [ + "Table 1: Comparison to baselines on GeoDE. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with increases, or little cost to, quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). AF: Africa, WAS: West Asia, \"label\" refers to region label, \"desc\" to text description, and \"img\" to exemplar images." + ], + "table_footnote": [], + "table_body": "
MethodRef. Info.Worst-Reg.F1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
LDM✘AF0.3640.3220.4130.2730.3370.3950.2420.218
Synonyms✘AF0.3570.3060.3500.2980.3660.3150.2150.203
VSG (ours)✘AF0.3990.3560.3490.3070.4700.4240.1800.191
ParaphrasingdescWAS0.3840.3540.3380.3090.4490.4150.2310.228
Semantic GuidancelabelWAS0.4200.4010.4590.5190.3910.3260.2450.253
FG CLIP (Loss)labelWAS0.4090.3780.3870.3830.4360.3730.2280.223
FG CLIP (Ent.)labelAF0.3800.3370.3440.3290.4290.3450.2240.227
Textual InversionimgAF0.3690.3630.4090.4440.3380.3080.2340.232
c-VSG (Ours)imgAF0.4550.4440.4240.4170.4930.4760.2540.253
", + "bbox": [ + 218, + 224, + 785, + 364 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/84f9139720c8d718c30427f6fdc2e112bba732220afb9f751a0437dc4a3860f5.jpg", + "table_caption": [ + "Table 2: Comparison to baselines on DollarStreet. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with little cost to quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). c-VSG outperforms all the methods by at least $8\\%$ relative F1 improvement. AF: Africa, AS: Asia, \"label\" refers to region label, \"desc\" to text description, and \"img\" to exemplar images." + ], + "table_footnote": [], + "table_body": "
MethodRef. Info.Worst- Reg.F1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
LDMXAS0.4480.4420.4280.4340.4720.4500.2310.235
SynonymsXAS0.4640.4570.4510.4480.4790.4670.2160.220
VSG (ours)XAS0.4570.4440.4130.3880.5160.5180.1910.198
ParaphrasingdescAF0.4540.4450.4450.4540.4650.4370.2260.215
Semantic GuidancelabelAS0.4700.4580.4470.4490.4980.4670.2300.233
FG CLIP (Loss)labelAS0.4370.3940.4010.3210.4880.5100.2230.206
FG CLIP (Entropy)labelAS0.4650.4620.4120.4040.5350.5400.2220.219
Textual InversionimgAS0.4250.3980.4780.4910.3860.3350.2170.219
c-VSG (Ours)imgAS0.4970.4830.4860.4860.5110.4790.2340.238
", + "bbox": [ + 220, + 474, + 782, + 612 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Interestingly, using Synonyms tends to decrease performance, perhaps due to its enforcement of a strict, yet limited, distribution of object names.", + "bbox": [ + 215, + 642, + 784, + 671 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "When considering methods that include additional information, we observe that leveraging textual descriptions of the evaluation dataset (Paraphrasing) is useful to improve average and worst-region F1. However, leveraging region information (Semantic Guidance, FG CLIP) yields better results. Notably, when the additional region information corresponds to known biases embedded in text-to-image systems, as is the case of Semantic Guidance, we observe substantial relative performance improvements of $15.4\\%$ and $24.5\\%$ in average and worst-region F1 over the LDM baseline.", + "bbox": [ + 215, + 672, + 785, + 792 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Leveraging exemplar images to contextualize VSG results in further performance gains. In particular, c-VSG shows a $25\\%$ and $37.9\\%$ relative improvement in average and worst F1 compared to the LDM baseline. Comparing c-VSG with", + "bbox": [ + 215, + 794, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 730, + 127 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/6e13e9737ea50112cbda0838290071eb9c49e536db90fcb2b5b298d47ba438f8.jpg", + "image_caption": [ + "(a) No VSG, i.e., {object} in {region} baseline" + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 496, + 263 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/bda6909bd409bd0eb933905249c99df9c27699d6ff5aba38954451e9c98fdde6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 500, + 143, + 777, + 263 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/1e69ee7957b215c5ed9cc331b4257b487646bbf8930b56d1e0f84631b528fcf2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 220, + 277, + 496, + 396 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/3df8512c14d4b37c803a34c99c1ccefae907ae1ec986a9f08e5ebead96edf65b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 500, + 277, + 776, + 396 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/629d701ab08baac948b253a789c056d54643782681d2de4ff9c538df517793cd.jpg", + "image_caption": [ + "(b) Vendi Score Guidance", + "(c) Contextualized Vendi Score Guidance", + "Fig. 2: Generated images of cooking pots (Left) and cars (Right). The same six seeds are shared among the examples, and the box colors indicate images pertaining to Africa, Europe, and Southeast Asia. Vendi Score Guidance increases the diversity of generated images, including object type, positioning, and quality. Contextualization with exemplar images increases similarity to real world diversity. (More examples are shown in Appendix Figures [7] and [8])" + ], + "image_footnote": [], + "bbox": [ + 220, + 409, + 496, + 527 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/799e12255fc7f9114ab96e0b22a0c56bb2f8f7f61164eaef16cf27248de61e00.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 500, + 409, + 776, + 527 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "the closest competitor, Semantic Guidance, we observe a relative improvement of $8.3\\%$ and $10.7\\%$ in average and worst-region F1.", + "bbox": [ + 212, + 670, + 787, + 700 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tab. 2 presents results on DollarStreet. In this case, uncontextualized VSG only moderately improves over the LDM baseline in average and worst-region F1. However, when including exemplar images per c-VSG, the patterns of improvement are consistent with GeoDE. c-VSG achieves $5.7\\%$ and $4.5\\%$ improvements over the closest baselines in average and worst-region F1, respectively.", + "bbox": [ + 212, + 700, + 787, + 777 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In the reminder of this section, we analyze the findings described above in the context of improvements to diversity, quality, and consistency.", + "bbox": [ + 212, + 777, + 787, + 808 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "VSG improves diversity. The improvements in F1 relate to consistent boosting of both worst-region and average recall: for GeoDE (Tab. 1, recall), VSG", + "bbox": [ + 212, + 809, + 787, + 842 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 495, + 127 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "both with and without contextualization show improvements for all baselines, and by at least $7.3\\%$ (and up to $46.2\\%$ ) over the LDM baseline. Similarly, VSG exhibits among the highest recall values in DollarStreet (Tab. 2, recall). FG CLIP (Ent.) achieves the highest recall values, but those come with significant drops in precision. Notably, for DollarStreet, VSG has better recall when exemplar images are not used. Again, this comes at a cost to precision.", + "bbox": [ + 212, + 146, + 787, + 238 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Diversity improvements are also reflected in qualitative examples. Fig. 2 reveals that VSG leads to greater variation in object color, type, and shape, such as more colorful cars for Africa, sports-cars for Europe, and lengthened hoods for Southeast Asia. With VSG, image backgrounds also show greater variety in textures and diversity in indoor vs. outdoor settings. In addition, VSG enables more inter-region diversity. For example, in Fig. 2 the same seed can look much more similar across regions in the baseline than with c-VSG.", + "bbox": [ + 212, + 239, + 787, + 345 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Contextualized VSG improves quality. In GeoDE, c-VSG also allows for improvement in both average and worst-region precision over the LDM baseline, the latter by up to $52.7\\%$ (Tab. 1, precision). Similar precision gains are observed in DollarStreet (Tab. 2, precision): leveraging exemplar images results in relative improvements of $12\\%$ in worst-region over the LDM baseline. Comparing c-VSG with VSG shows relative gains of $17.7\\%$ and $25.3\\%$ in average and worst-region precision, respectively. Interestingly, Semantic Guidance allows for higher precision than c-VSG on GeoDE, whose images were submitted by people living in the regions of interest. The lower precision achieved by Semantic Guidance on DollarStreet might be related to the datasets' focus on disadvantaged and isolated areas. Thus, Semantic Guidance requires an understanding of whether applying region information helps or hurts the diversity of the generations.", + "bbox": [ + 212, + 347, + 787, + 530 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Contextualized VSG improves consistency. In both GeoDE and DollarStreet, we observe that VSG without contextualization slightly reduces consistency (Tab. 1 and 2, CLIPScore). This highlights the importance of contextualization when using VSG: leveraging exemplar images in c-VSG results in the highest CLIPscores across the board, on average and for the worst-region.", + "bbox": [ + 212, + 532, + 787, + 608 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Contextualized VSG reduces disparities across regions. When comparing c-VSG to VSG, we observe that disparities across regions appear substantially reduced on both datasets. On GeoDE, contextualization reduces the performance gap between average and worst-region in F1, recall, precision, and CLIPScore. Similar trends may be observed for DollarStreet, where c-VSG exhibits remarkably lower disparities across all metrics when compared to the LDM baseline. It is worth noting that Semantic Guidance also has low disparities.", + "bbox": [ + 212, + 609, + 787, + 717 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Contextualized VSG shows early improvements in region representation. While this work does not focus particularly on mitigation of reductive regional representations, we find in initial qualitative inspections that representations of regions can change positively after applying contextualized VSG. We find that for Africa, objects like cars and cooking pots are less dilapidated with VSG, as compared to the original generations. In addition, some objects tend to be larger and more central in the image, reducing the prevalence of unrepresentative background fixtures, as shown in Appendix 6.2. The improve", + "bbox": [ + 212, + 719, + 787, + 842 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 730, + 127 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "ment of consistency with contextualization similarly reduces the dominance of non-representative regional background information. Remaining images without objects tend to have less repetition in reductive backgrounds associated with regional tropes. For example, Appendix 6.2 shows that generated images of bags in Europe can have more variety in their backgrounds when using c-VSG.", + "bbox": [ + 212, + 146, + 787, + 220 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "3.5 Ablations", + "text_level": 1, + "bbox": [ + 215, + 243, + 343, + 257 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We next discuss ablations on the variations of VSG criteria and the strength, quantity, and type of exemplar images used in c-VSG.", + "bbox": [ + 212, + 268, + 785, + 297 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Variations of c-VSG Criteria. We compare the use of the full contextualized Vendi Score Guidance criterion from our approach ( $\\alpha > 0$ , $\\beta > 0$ , c-VSG) to Vendi Score guidance without contextualization ( $\\alpha > 0$ , $\\beta = 0$ , VSG), a criterion using the exemplar contextualizing images exclusively ( $\\alpha = 0$ , $\\beta > 0$ ), and the LDM without intervention ( $\\alpha = 0$ , $\\beta = 0$ ). Results are shown in Tab. 3 and visual examples in Appendix 6.2.", + "bbox": [ + 212, + 297, + 785, + 388 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "When evaluating with GeoDE, we find that Vendi Score guidance without contextualization can lead to images with improved diversity but unrealistic object shapes and colors, as well as extreme variation in styles, such as black-and-white or film-style photos. While using exclusively contextualizing images helps in almost all aspects as opposed to only the Vendi Score guidance on the bank of generated images, the methods combined tend to have the best diversity. For DollarStreet, there is a slight trade-off in precision and recall between the inclusion of contextualizing images versus previously generated images in the criterion: while the combination of the two has moderately better measures over only contextualizing images, the use of only previously generated images shows the highest recall.", + "bbox": [ + 212, + 388, + 787, + 540 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Strength of exemplar images. Tab. 4 shows ablations of the strength of exemplar images used in the contextualized VSG criterion. Unsurprisingly, lower weight $\\beta$ of real exemplar images yields greater recall while a higher weight leads to a larger precision, emphasizing the quality vs. diversity trade-off. For example, increasing $\\beta$ can correlate with changes in camera angle of cars to more closely match those in the reference images, as shown in Appendix 6.2 In addition, consistency is improved with additional weight to exemplar images.", + "bbox": [ + 212, + 540, + 787, + 647 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/c56a2dee26fe3d781d433afeab33dae9b5636687fef6acf5b36126ae114ab7e9.jpg", + "table_caption": [ + "Table 3: Ablation study on variations of VSG criteria." + ], + "table_footnote": [], + "table_body": "
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDE000.3640.3220.4130.2730.3370.3950.2420.218
GeoDEtuned00.3990.3560.3490.3070.4700.4240.1800.191
GeoDE0tuned0.4460.4270.4310.4090.4640.4470.2610.254
GeoDEtunedtuned0.4550.4440.4240.4170.4930.4760.2540.253
DollarStreet000.4480.4420.4280.4340.4720.4500.2310.235
DollarStreettuned00.4570.4440.4130.3880.5160.5180.1910.198
DollarStreet0tuned0.4920.4800.4860.4830.5000.4760.2400.242
DollarStreettunedtuned0.4970.4830.4860.4860.5110.4790.2340.238
", + "bbox": [ + 220, + 696, + 787, + 838 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 495, + 127 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/61cb83b01846f143b4526e55481fd18568ac08411f539c9ce092007af5e738d9.jpg", + "table_caption": [ + "Table 4: Ablation study on exemplar images strength in contextualized VSG." + ], + "table_footnote": [], + "table_body": "
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDEtunedα0.4510.4340.3840.3800.5470.5060.2160.221
GeoDEtuned2α0.4550.4440.4240.4170.4930.4760.2540.253
GeoDEtuned4α0.4480.4370.4280.4350.4720.4380.2610.261
", + "bbox": [ + 220, + 170, + 785, + 252 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/d5cee3b41c1255fc45b0e0f29ecd429e7a99492e4c04308ba4c2e0aa7df0256a.jpg", + "table_caption": [ + "Table 5: Ablation study on the number of exemplar images per object used in the contextualized Vendi Score computation, or $M$ in Algorithm 1. Results are reported based on GeoDE dataset." + ], + "table_footnote": [], + "table_body": "
Method#imgsF1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
c-VSG2 per obj.0.4550.4440.4240.4170.4930.4760.2540.253
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG8 per obj.0.4550.4420.4450.4360.4660.4490.2620.257
c-VSG20 per obj.0.4600.4330.4400.4340.4850.4330.2510.246
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG4 per obj.-reg.0.4540.4450.4360.4310.4750.4590.2590.253
", + "bbox": [ + 220, + 319, + 785, + 436 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Quantity and type of exemplar images. In Tab. 5, we first study how the number of images selected as exemplar images in c-VSG affects image generation diversity. Generally, using fewer exemplar images tends to help with diversity while increasing this number helps with quality, although these trends appear minor in some cases. In Appendix 6.2, we visually inspect images and find that trends in quality and consistency for a single seed can also reverse as the number of images increases, first improving, then worsening (or vice versa). In addition, we study whether exemplar images randomly selected across all possible regions or the same number images selected specifically for a given region yields better diversity. We find that region-stratified exemplar images yield results within $1 - 2\\%$ of those when using randomly selected images for all measures except for worst-region recall, for which there is a $5\\%$ improvement.", + "bbox": [ + 212, + 465, + 787, + 647 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4 Related Work", + "text_level": 1, + "bbox": [ + 215, + 670, + 387, + 686 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Prior work often focuses on mitigating general diversity issues in text-to-image models. For example, 37.50 focus on preventing mode collapse while 44 generates a balanced distribution, focusing on the long-tail, by using synthetic images. In addition, there is growing research focused on issues related to diversity through a lens of reducing person-related bias. One line of work reduces people-related biases, e.g., related to gender, through concept forgetting or erasure 23, 33, 52, rather than diversification. The idea is that, by modifying a model's understanding of a concept, the harmful or biased content is not generated. 10 augments the original prompt with real-world distributions of gender", + "bbox": [ + 212, + 704, + 787, + 842 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "and ethnicity using a finetuned language model, and [25,51] learn token embeddings for a diverse set of sensitive attributes and concatenate them to the original prompt. Building on work in NLP [5], other approaches remove the components of sensitive attributes like race and gender from the text embeddings altogether [9,47] or modify the cross attention layer [17,33] to remove implicit assumptions about the world. However, there is little work investigating improvements to geographic diversity. To the best of our knowledge, prior work primarily discusses the (minimal) improvement in diversity when including more granular geographic information in text prompts [2,18].", + "bbox": [ + 212, + 145, + 787, + 284 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Our proposed method is most relevant to works that use classifier guidance during inference time. [7,42] use classifier guidance to guide generations away from inappropriate content. In the context of augmenting a dataset with synthetic samples, [22] has extended the idea of classifier guidance to feedback guidance where loss and entropy are used as the guidance mechanism. While the Vendi Score has been used at training time to increase the diversity of generative adversarial networks (GANs) across modes in the training dataset [3], to the best of our knowledge, we are the first to apply it to diffusion models and as guidance at inference time.", + "bbox": [ + 212, + 284, + 787, + 419 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 450, + 357, + 465 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we introduced an inference time intervention that extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other while still representative of the real world. Through extensive experiments, we showed that our approach produces images with higher intra- and inter-region diversity, while exhibiting increased image quality and text-image consistency; overall resulting in reduced disparities in generation diversity, quality and consistency.", + "bbox": [ + 212, + 489, + 787, + 595 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Limitations. In this work, we focus on improving worst-region F1 while also analyzing worst and average region precision, recall, and consistency. Automatic metrics are susceptible to several challenges, including region representations in the reference dataset, reliance on pre-existing feature extractors, and the composition of geographic groupings. The metrics are aggregates and do not account for individual preferences. A human evaluation study would be necessary for capturing subjective and personal perspectives about the effect of c-VSG. Finally, our approach is only a single effort at improving the diversity of text-to-image generative models, and there remains future work for their further improvement.", + "bbox": [ + 212, + 595, + 787, + 733 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Societal Impacts. This work involves representations of geographic regions. While our qualitative analyses show that c-VSG tends to help mitigate reductive representations of regions, our method may not always remove harmful representations in the underlying generative models. Furthermore, increasing the diversity of text-to-image models may yield unexpected generations. Thorough study of the full range of potential outcomes is necessary before deployment of these methods in real world systems.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 495, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgments", + "text_level": 1, + "bbox": [ + 217, + 143, + 392, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We would like to thank Oscar Manas and Pietro Astolfi for helpful discussion and pointers regarding in-context learning and paraphrasing approaches. We also thank Mohammad Pezeshki for useful discussions, feedback and support. In addition, we thank the participants of the qualitative study of c-VSG, discussed in Appendix 6.3.", + "bbox": [ + 215, + 176, + 785, + 253 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 323, + 159 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bansal, H., Yin, D., Monajatipoor, M., Chang, K.W.: How well can text-to-image generative models understand ethical natural language interventions? In: EMNLP (Short) (2022)", + "2. Basu, A., Babu, R.V., Pruthi, D.: Inspecting the geographical representativeness of images from text-to-image models. arXiv preprint arXiv:2305.11080 (2023)", + "3. Berns, S., Colton, S., Guckelsberger, C.: Towards mode balancing of generative models via diversity weights (2023)", + "4. Bianchi, F., Kalluri, P., Durmus, E., Ladhak, F., Cheng, M., Nozza, D., Hashimoto, T., Jurafsky, D., Zou, J., Caliskan, A.: Easily accessible text-to-image generation amplifies demographic stereotypes at large scale (2022)", + "5. Bolukbasi, T., Chang, K.W., Zou, J.Y., Saligrama, V., Kalai, A.T.: Man is to computer programmer as woman is to homemaker? debiasing word embeddings. Advances in neural information processing systems 29 (2016)", + "6. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing text-to-image models using semantic guidance (2023)", + "7. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023)", + "8. Cho, J., Zala, A., Bansal, M.: Dall-eval: Probing the reasoning skills and social biases of text-to-image generative transformers (2022)", + "9. Chuang, C.Y., Jampani, V., Li, Y., Torralba, A., Jegelka, S.: Debiasing vision-language models via biased prompts. arXiv preprint arXiv:2302.00070 (2023)", + "0. Clemmer, C., Ding, J., Feng, Y.: Precisedebias: An automatic prompt engineering approach for generative ai to mitigate image demographic biases. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 8596-8605 (2024)", + "1. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009). https://doi.org/10.1109/CVPR.2009.5206848", + "2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021)", + "3. Friedman, D., Dieng, A.B.: The vendi score: A diversity evaluation metric for machine learning. arXiv preprint arXiv:2210.02410 (2022)", + "4. Friedrich, F., Schramowski, P., Brack, M., Struppek, L., Hintersdorf, D., Luccioni, S., Kersting, K.: Fair diffusion: Instructing text-to-image generation models on fairness (2023)", + "5. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Makea-scene: Scene-based text-to-image generation with human priors. In: Computer Vision-ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23-27, 2022, Proceedings, Part XV. pp. 89-106. Springer (2022)", + "6. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022)", + "7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023)", + "8. Hall, M., Ross, C., Williams, A., Carion, N., Drozdzal, M., Soriano, A.R.: Dig in: Evaluating disparities in image generations with indicators for geographic diversity (2023)" + ], + "bbox": [ + 225, + 172, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 495, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "19. Hao, S., Shelby, R., Liu, Y., Srinivasan, H., Bhutani, M., Ayan, B.K., Poddar, S., Laszlo, S.: Harm amplification in text-to-image models (2024)", + "20. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? arXiv preprint arXiv:2210.07574 (2022)", + "21. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? (2023), https://arxiv.org/abs/2210.07574", + "22. Hemmat, R.A., Pezeshki, M., Bordes, F., Drozdjal, M., Romero-Soriano, A.: Feedback-guided data synthesis for imbalanced classification (2023)", + "23. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. Advances in Neural Information Processing Systems 36 (2024)", + "24. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021)", + "25. Kim, E., Kim, S., Shin, C., Yoon, S.: De-stereotyping text-to-image models through prompt tuning (2023)", + "26. Kynkänniemi, T., Karras, T., Laine, S., Lehtinen, J., Aila, T.: Improved precision and recall metric for assessing generative models (2019)", + "27. Luccioni, A.S., Akiki, C., Mitchell, M., Jernite, Y.: Stable bias: Analyzing societal representations in diffusion models (2023)", + "28. Manas, O., Astolfi, P., Hall, M., Ross, C., Urbanek, J., Williams, A., Agrawal, A., Romero-Soriano, A., Drozdzal, M.: Improving text-to-image consistency via automatic prompt optimization (2024)", + "29. Miller, G.A.: WordNet: A lexical database for English. In: Human Language Technology: Proceedings of a Workshop held at Plainsboro, New Jersey, March 8-11, 1994 (1994), https://aclanthology.org/H94-1111", + "30. Naeem, M.F., Oh, S.J., Uh, Y., Choi, Y., Yoo, J.: Reliable fidelity and diversity metrics for generative models. In: International Conference on Machine Learning. pp. 7176-7185. PMLR (2020)", + "31. Naik, R., Nushi, B.: Social biases through the text-to-image generation lens (2023)", + "32. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: GLIDE: towards photorealistic image generation and editing with text-guided diffusion models. CoRR abs/2112.10741 (2021), https://arxiv.org/abs/2112.10741", + "33. Orgad, H., Kawar, B., Belinkov, Y.: Editing implicit assumptions in text-to-image diffusion models. arXiv preprint arXiv:2303.08084 (2023)", + "34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021)", + "35. Ramaswamy, V.V., Lin, S.Y., Zhao, D., Adcock, A.B., van der Maaten, L., Ghadiyaram, D., Russakovsky, O.: Beyond web-scraping: Crowd-sourcing a geodiverse dataset. In: arXiv preprint (2023)", + "36. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents (2022)", + "37. Rangwani, H., Jaswani, N., Karmali, T., Jampani, V., Babu, R.V.: Improving gans for long-tailed data through group spectral regularization. In: European Conference on Computer Vision. pp. 426-442. Springer (2022)" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Contextualized Vendi Score Guidance", + "bbox": [ + 478, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "38. Rojas, W.A.G., Diamos, S., Kini, K.R., Kanter, D., Reddi, V.J., Coleman, C.: The dollar street dataset: Images representing the geographic and socioeconomic diversity of the world. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022)", + "39. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. CoRR abs/2112.10752 (2021), https://arxiv.org/abs/2112.10752", + "40. Sajjadi, M.S.M., Bachem, O., Lučić, M., Bousquet, O., Gelly, S.: Assessing Generative Models via Precision and Recall. In: Advances in Neural Information Processing Systems (NeurIPS) (2018)", + "41. Salimans, T., Ho, J.: Progressive distillation for fast sampling of diffusion models. arXiv preprint arXiv:2202.00512 (2022)", + "42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22522-22531 (2023)", + "43. Sehwag, V., Hazirbas, C., Gordo, A., Ozgenel, F., Ferrer, C.C.: Generating high fidelity data from low-density regions using diffusion models (2022)", + "44. Shin, J., Kang, M., Park, J.: Fill-up: Balancing long-tailed data with generative models. arXiv preprint arXiv:2306.07200 (2023)", + "45. Song, J., Meng, C., Ermon, S.: Denoising Diffusion Implicit Models. In: Proceedings of the International Conference on Learning Representations (ICLR) (2020)", + "46. Song, Y., Dhariwal, P., Chen, M., Sutskever, I.: Consistency models (2023)", + "47. Tanjim, M.M., Singh, K.K., Kafle, K., Sinha, R., Cottrell, G.W.: Discovering and mitigating biases in clip-based image editing. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2984-2993 (2024)", + "48. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023)", + "49. Wan, Y., Chang, K.W.: The male ceo and the female assistant: Probing gender biases in text-to-image models through paired stereotype test (2024)", + "50. Yu, N., Li, K., Zhou, P., Malik, J., Davis, L., Fritz, M.: Inclusive gan: Improving data and minority coverage in generative models. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 377-393. Springer (2020)", + "51. Zhang, C., Chen, X., Chai, S., Wu, C.H., Lagun, D., Beeler, T., De la Torre, F.: Iti-gen: Inclusive text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3969-3980 (2023)", + "52. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2303.17591 (2023)" + ], + "bbox": [ + 215, + 146, + 787, + 702 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "R. Askari Hemmat, M. Hall et al.", + "bbox": [ + 271, + 114, + 495, + 127 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_model.json b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_model.json new file mode 100644 index 0000000000000000000000000000000000000000..5407ca5346ebea7b0c10684f3f118cf3dfdf2d50 --- /dev/null +++ b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_model.json @@ -0,0 +1,2491 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.241, + 0.142, + 0.764, + 0.185 + ], + "angle": 0, + "content": "Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance" + }, + { + "type": "text", + "bbox": [ + 0.235, + 0.212, + 0.768, + 0.245 + ], + "angle": 0, + "content": "Reyhane Askari Hemmat\\(^{1}\\), Melissa Hall\\(^{1}\\), Alicia Sun\\(^{1}\\), Candace Ross\\(^{1}\\), Michal Drozdzal\\(^{1}\\), and Adriana Romero-Soriano\\(^{1,2,3,4}\\)" + }, + { + "type": "text", + "bbox": [ + 0.258, + 0.254, + 0.744, + 0.27 + ], + "angle": 0, + "content": "1 FAIR at Meta, 2 Mila, 3 McGill University, 4 Canada CIFAR AI Chair" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.303, + 0.745, + 0.594 + ], + "angle": 0, + "content": "Abstract. With the growing popularity of text-to-image generative models, there has been increasing focus on understanding their risks and biases. Recent work has found that state-of-the-art models struggle to depict everyday objects with the true diversity of the real world and have notable gaps between geographic regions. In this work, we aim to increase the diversity of generated images of common objects such that per-region variations are representative of the real world. We introduce an inference-time intervention, contextualized Vendi Score Guidance (c-VSG), that guides the backwards steps of latent diffusion models to increase the diversity of a sample as compared to a \"memory bank\" of previously generated images while constraining the amount of variation within that of an exemplar set of real-world contextualizing images. We evaluate c-VSG with two geographically representative datasets and find that it substantially increases the diversity of generated images, both for the worst-performing regions and on average, while simultaneously maintaining or improving image quality and consistency. Additionally, qualitative analyses reveal that diversity of generated images is significantly improved, including along the lines of reductive region portrayals present in the original model. We hope that this work is a step towards text-to-image generative models that reflect the true geographic diversity of the world." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.607, + 0.687, + 0.622 + ], + "angle": 0, + "content": "Keywords: geo-diversity \\(\\cdot\\) image generation \\(\\cdot\\) diffusion models" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.667, + 0.377, + 0.683 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.697, + 0.788, + 0.806 + ], + "angle": 0, + "content": "The unprecedented results achieved by text-to-image systems [15,32,36,39] and their wide-spread use as plug-and-play solutions have propelled a body of research to understand their potential risks and biases [18,27]. Recent works have highlighted through qualitative and quantitative evaluations the disparities in demographic traits of people represented in the generated images [19,31,49], triggering the design of mitigation strategies based on textual interventions [16], attention-weight modification [17], and semantic guidance [14]." + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.812, + 0.37, + 0.825 + ], + "angle": 0, + "content": "* Equal Contribution." + }, + { + "type": "page_footnote", + "bbox": [ + 0.222, + 0.825, + 0.788, + 0.842 + ], + "angle": 0, + "content": "1 https://github.com/facebookresearch/Contextualized-Vendi-Score-Guidance" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.812, + 0.788, + 0.842 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.498, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.16, + 0.498, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.363, + 0.304, + 0.382, + 0.316 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.159, + 0.756, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.621, + 0.304, + 0.642, + 0.316 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.327, + 0.789, + 0.455 + ], + "angle": 0, + "content": "Fig.1: (a) We present Contextualized Vendi Score Guidance (c-VSG), an inference-time intervention to increase the diversity of images generated by latent diffusion models (LDMs). c-VSG guides backwards steps of the diffusion process using the Vendi Score [13] to increase the diversity among a sample \\( x_{t} \\) and a memory bank of previous generations (with weight \\( \\alpha \\)) while constraining excessive variation using a small set of real, contextualizing exemplar images (with weight \\( \\beta \\)). (b) Generations of dog in Africa, all with the same seed. First row has zero c-VSG guidance scale and as a result all samples are the same. As we increase the c-VSG guidance scale, we observe increased diversity in generations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.488, + 0.789, + 0.655 + ], + "angle": 0, + "content": "Beyond human-centric representations, research has shown that stereotypical biases also occur for representations of objects and their surroundings across the globe [2,4,18]. In particular, previous studies highlighted that progress in image quality or realism has come at the expense of representation diversity and text-image consistency [18]. This trade-off affects some regions more than others, hindering the progress towards conditional image generative systems that truly work well for all geographic regions. Notably, images generated with text prompts that include regional information contain limited object diversity and heightened geographic stereotypes. As shown in [18], many generations depict limited diversity in object type. Yet, to the best of our knowledge, no mitigation strategies have directly targeted geo-diversity in text-to-image systems." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.657, + 0.79, + 0.748 + ], + "angle": 0, + "content": "In this paper, we aim to mitigate disparities in representation diversity of common objects across worldwide regions. More precisely, our goal is to increase the objects' representation diversity such that per-region variation in type of object, as observed in the real world, is better reflected in the generations. In doing so, we aim to maintain (or improve) the quality of images as well as their text-image consistency." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.789, + 0.841 + ], + "angle": 0, + "content": "We devise a novel approach called Vendi Score Guidance (VSG) that increases the representation diversity of the generations by leveraging the Vendi Score (VS) [13] - a dataset diversity evaluation metric. In particular, VSG extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other, intuitively maximizing the effective number of samples among the obtained generations. This" + }, + { + "type": "page_number", + "bbox": [ + 0.822, + 0.61, + 0.833, + 0.62 + ], + "angle": 0, + "content": "2" + }, + { + "type": "page_number", + "bbox": [ + 0.886, + 0.628, + 0.895, + 0.636 + ], + "angle": 0, + "content": "2" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.346 + ], + "angle": 0, + "content": "requires the proposed guidance strategy to operate auto-regressively w.r.t. the previous generations. We implement this by keeping a memory bank of past generations that ensures that the current sample differs from those in the memory.do Yet, increasing diversity in an unconstrained way results in generations that lack either image realism or text-generation consistency. Therefore, we propose to contextualize VSG by providing a small set of randomly selected real images of objects, referred to as exemplar images, and guiding the generation process towards diverse samples that are grounded on those exemplar images. We evaluate the proposed approach by measuring precision [26,40], recall [26,40], and CLIPScore [24] to assess image realism/quality, representation diversity, and text-image consistency, respectively. We report results on two geographically diverse datasets that contain images of the common objects collected around the world, GeoDE [35] and DollarStreet [38]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.362, + 0.789, + 0.573 + ], + "angle": 0, + "content": "Our results show that contextualized Vendi Score Guidance improves worst-region and average F1 for both datasets, including a relative improvement of \\(40\\%\\) in worst-region F1 over the Latent Diffusion Model (LDM) baseline without any intervention when measured on GeoDE and \\(11\\%\\) over the next closest baseline, and reduces performance disparities across regions. Even without contextualization, VSG shows relative improvements of up to \\(10\\%\\) over the LDM baseline in F1. Upon visual inspection we find the object diversity in images to be significantly improved, with greater variation in object color, type, shape, and size. In addition, VSG improvements often coincide with improved regional representations beyond reductive portrayals present in the original model. Finally, we find in ablations that our combined use of the Vendi Score to encourage image diversity relative to previous generations while constraining variation to that of the real world with contextualizing exemplar images meaningfully navigates the diversity vs. quality tradeoff." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.592, + 0.684, + 0.607 + ], + "angle": 0, + "content": "The contributions of this work can be summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.626, + 0.784, + 0.67 + ], + "angle": 0, + "content": "- We introduce a new inference-time intervention, contextualized Vendi Score Guidance (c-VSG), to increase the diversity of images generated by LDMs using a memory bank of previously generated images and exemplar images." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.672, + 0.785, + 0.715 + ], + "angle": 0, + "content": "- When evaluated with two geographically representative real world datasets, c-VSG shows significant improvement in diversity and quality over the vanilla LDM, while maintaining text-image consistency." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.717, + 0.784, + 0.761 + ], + "angle": 0, + "content": "- c-VSG shows improvements in average and worst-region F1 over state-of-the-art baselines, while exhibiting reduced disparities in quality, diversity and text-generation consistency across regions." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.762, + 0.784, + 0.79 + ], + "angle": 0, + "content": "- Our ablations demonstrate the efficacy of the memory and contextualizing components of the c-VSG criterion." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.626, + 0.785, + 0.79 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "We hope this work contributes to image generations that better reflect the geographic diversity of the real world." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.498, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.331, + 0.161 + ], + "angle": 0, + "content": "2 Method" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.177, + 0.788, + 0.238 + ], + "angle": 0, + "content": "In this work, we focus on increasing the diversity of latent diffusion models (LDMs). We first provide preliminary details about the components of the LDM generation process in which we apply our interventions, as well as the Vendi Score metric. Then, we introduce our proposed methodology, Vendi Score Guidance." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.259, + 0.373, + 0.273 + ], + "angle": 0, + "content": "2.1 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.284, + 0.789, + 0.33 + ], + "angle": 0, + "content": "Sampling in LDMs. In this work, we focus on a class of LDMs called denoising diffusion implicit models (DDIMs) [45]. At inference or generation time, DDIMs use a reverse process defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.293, + 0.34, + 0.786, + 0.386 + ], + "angle": 0, + "content": "\\[\nx _ {t - 1} = \\sqrt {\\xi_ {t - 1}} \\hat {x} _ {0, t} + \\underbrace {\\sqrt {1 - \\xi_ {t - 1} - \\sigma_ {t} ^ {2}} \\cdot \\epsilon_ {\\theta} ^ {(t)} (x _ {t})} _ {\\text {d i r e c t i o n p o i n t i n g t o} x _ {t}} + \\underbrace {\\sigma_ {t} \\epsilon_ {t}} _ {\\text {r a n d o m n o i s e}}, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.396, + 0.788, + 0.442 + ], + "angle": 0, + "content": "where \\( x_{t} \\) is the sample at time step \\( t \\), \\( \\epsilon_t \\sim \\mathcal{N}(\\mathbf{0},\\mathbf{I}) \\) and \\( \\xi_{t} \\) and \\( \\sigma_{t} \\) are time-dependent coefficients, and \\( \\hat{x}_{0,t} \\) is the DDIM approximation of the denoised sample given current \\( x_{t} \\)," + }, + { + "type": "equation", + "bbox": [ + 0.327, + 0.452, + 0.786, + 0.489 + ], + "angle": 0, + "content": "\\[\n\\hat {x} _ {0, t} = \\operatorname {D D I M A p p r o x} \\left(x _ {t}\\right) := \\frac {x _ {t} - \\sqrt {1 - \\xi_ {t}} \\epsilon_ {\\theta} ^ {(t)} \\left(x _ {t}\\right)}{\\sqrt {\\xi_ {t}}}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.5, + 0.787, + 0.532 + ], + "angle": 0, + "content": "and \\(\\epsilon_{\\theta}^{(t)}\\) is the pretrained denoising network parameterized by \\(\\theta\\) that approximates the score function conditioned on a class or prompt \\(y\\)," + }, + { + "type": "equation", + "bbox": [ + 0.428, + 0.542, + 0.786, + 0.563 + ], + "angle": 0, + "content": "\\[\n\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p (x _ {t} | y). \\qquad \\qquad (3)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.572, + 0.787, + 0.602 + ], + "angle": 0, + "content": "In this work, we modify this score function to guide the sampling process towards generating more diverse samples." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.603, + 0.788, + 0.695 + ], + "angle": 0, + "content": "Guidance in LDMs. LDMs often condition generated samples on labels or text prompts in the score function. If one has access to a pretrained denoising network that only approximates the unconditional score function \\((\\nabla_{x}\\log p(x))\\), one can use classifier-guidance [12] to generate a conditional sample. Classifier-guidance modifies the score function using a pretrained classifier that provides \\(\\log p(y|x_t)\\)," + }, + { + "type": "equation", + "bbox": [ + 0.308, + 0.705, + 0.787, + 0.726 + ], + "angle": 0, + "content": "\\[\n\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p _ {\\gamma} (x _ {t} | y) = \\nabla_ {x} \\log p (x _ {t}) + \\gamma \\nabla_ {x} \\log p (y | x _ {t}), \\qquad (4)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.735, + 0.787, + 0.78 + ], + "angle": 0, + "content": "where \\(\\gamma\\) is a scaling factor controlling the strength of class-conditional generation. In this work, we adapt this concept of guidance by utilizing the Vendi Score [13], rather than a classifier, as our guidance function." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.78, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Vendi Score (VS). The VS is a metric for evaluating diversity in machine learning [13]. It applies a user-defined similarity function to a set of samples, without the need for a reference dataset as opposed to metrics such as recall or coverage [26,30,40]. VS measures the effective number of examples by computing" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.733, + 0.128 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "the soft-rank of a similarity or kernel matrix. The similarity matrix is calculated using a similarity function that takes two samples and returns a positive value indicating how similar they are. Higher rank of the similarity matrix corresponds to higher Vendi Score and diversity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.209, + 0.785, + 0.286 + ], + "angle": 0, + "content": "Formally, given a set of samples \\( x_{1},\\ldots ,x_{n} \\), we can define a positive semi-definite similarity function \\( k \\) with \\( k(x,x) = 1 \\) for all \\( x \\). The similarity function is applied on every pair of samples in our dataset to create a similarity matrix, \\( \\mathcal{K} \\) where \\( \\mathcal{K}_{i,j} = k(x_i,x_j) \\). VS is then defined as the soft-rank of \\( \\mathcal{K} / n \\), i.e., the exponential of the entropy of the eigenvalues of \\( \\mathcal{K} / n \\) [13]:" + }, + { + "type": "equation", + "bbox": [ + 0.358, + 0.3, + 0.786, + 0.341 + ], + "angle": 0, + "content": "\\[\n\\operatorname {V S} \\left(x _ {1}, \\dots , x _ {n}\\right) = \\exp \\left(- \\sum_ {i = 1} ^ {n} \\lambda_ {i} \\log \\lambda_ {i}\\right), \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.351, + 0.538, + 0.366 + ], + "angle": 0, + "content": "where \\(\\lambda_1, \\ldots, \\lambda_n\\) are the eigenvalues of \\(\\mathcal{K} / n\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.367, + 0.784, + 0.397 + ], + "angle": 0, + "content": "A common choice for the similarity function is the cosine-similarity of every pair of samples in the dataset in a pre-defined feature space." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.426, + 0.445, + 0.44 + ], + "angle": 0, + "content": "2.2 Vendi Score Guidance" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.457, + 0.785, + 0.547 + ], + "angle": 0, + "content": "In this section, we introduce our proposed approach, called Vendi Score Guidance (VSG). Our goal is to increase the diversity of the generated samples by incorporating the Vendi Score as an auto-regressive guidance mechanism during diffusion model inference. In other words, every new generation will take into consideration all previously generated samples and will aim to generate a sample which is substantially different from the previous ones." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.549, + 0.785, + 0.624 + ], + "angle": 0, + "content": "Let us define a memory bank which contains all the previously generated samples as \\(\\mathbf{X}_{\\mathbf{f}}: \\{x^{1}, \\ldots, x^{n}\\}\\). Given the \\(\\mathbf{X}_{\\mathbf{f}}\\), and a newly generated sample \\(x\\), we can compute \\(\\mathrm{VS}(x, \\mathbf{X}_{\\mathbf{f}})\\). Our goal is to modify the generation process of \\(x\\) by steering it towards part of the manifold that increases VS, and thus, augment the sample diversity. We can achieve this via the following score function," + }, + { + "type": "equation", + "bbox": [ + 0.27, + 0.639, + 0.785, + 0.658 + ], + "angle": 0, + "content": "\\[\n\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p _ {\\gamma , \\alpha} \\left(x _ {t} | y, \\mathbf {X} _ {\\mathbf {f}}\\right) = \\nabla_ {x} \\log p _ {\\gamma} \\left(x _ {t} | y\\right) + \\alpha \\nabla_ {x} \\operatorname {V S} \\left(\\hat {x} _ {0, t}, \\mathbf {X} _ {\\mathbf {f}}\\right), \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.672, + 0.784, + 0.701 + ], + "angle": 0, + "content": "where \\(\\alpha\\) is a scaling factor that controls the strength of the Vendi Score guidance and \\(\\hat{x}_{0,t}\\) is the predicted denoised sample." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.703, + 0.785, + 0.763 + ], + "angle": 0, + "content": "A naive way of finding \\(\\hat{x}_{0,t}\\) is to apply all the \\(T\\) steps of the backward diffusion process and use the denoised image to compute the Vendi Score. However, this is computationally expensive. Thus, we use the efficient DDIM approximation of a denoised sample, given in Eq. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.786, + 0.841 + ], + "angle": 0, + "content": "We note that the original Vendi Score formulation in Eq. 5 is not differentiable, since it requires finding the singular values of the similarity matrix, and singular value decomposition is not differentiable. To overcome this limitation, we developed a simple algorithm to compute the Vendi Score in a differentiable way and present it in Appendix 6.2." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.498, + 0.129 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.299 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance (c-VSG). In experimentation, we found that unconstrained VSG can have limited efficacy, as generated images may drift from real world representations. Thus, in the second part of our method, we use Vendi Score a second time with a small set of randomly selected exemplar images, \\(\\mathbf{X}_{\\mathbf{r}}\\). This set of exemplar images is used to contextualize the Vendi Score computation and thus, the generation process. Similar to Eq. 6, we compute \\(\\mathrm{VS}(x,\\mathbf{X_r})\\). However, because we want to reduce excessive drift from the exemplar representation of images, we calculate the gradients with respect to the negative of this score. Overall, we use the following score function which combines VSG with contextualized samples:" + }, + { + "type": "equation", + "bbox": [ + 0.269, + 0.311, + 0.786, + 0.328 + ], + "angle": 0, + "content": "\\[\n\\nabla_ {x} \\log p (x _ {t} | y, \\mathbf {X _ {f}}, \\mathbf {X _ {r}}) = \\nabla_ {x} \\log p _ {\\gamma , \\alpha} (x _ {t} | y, \\mathbf {X _ {f}}) - \\beta \\nabla_ {x} \\mathrm {V S} (\\hat {x} _ {0, t}, \\mathbf {X _ {r}}), \\qquad (7)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.339, + 0.788, + 0.43 + ], + "angle": 0, + "content": "where \\(\\beta\\) is a scaling factor that controls the strength of VSG contextualization. This formulation allows the model to generate samples that remain close to the exemplar images without the need for additional training. Intuitively, the modified score function (Eq. 7) steers the generation process towards parts of the space which would result in a sample that increases the rank of the memory bank while staying close to the exemplar images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.552 + ], + "angle": 0, + "content": "Algorithm \\(\\mathbb{I}\\) presents the c-VSG computation step by step. Note that we use \\(G_{\\text{freq}}\\) to control the rate at which c-VSG is applied in the diffusion process, allowing for a balance between efficiency and diversity. To generate image \\(x^n\\), we apply the proposed guidance in the backward diffusion process. In the intermediate steps and when the sample is not yet generated, we use DDIM's approximation of \\(\\hat{x}_0\\) and feed it to the VS computation. After the final diffusion step and once the image is completely denoised, \\(x^n\\) is added to the memory bank of generated images and used for future image generations." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.576, + 0.377, + 0.594 + ], + "angle": 0, + "content": "3 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.609, + 0.787, + 0.641 + ], + "angle": 0, + "content": "In this section, we describe evaluation datasets and metrics, baselines, and setup. We then present experimental results and ablations." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.663, + 0.439, + 0.677 + ], + "angle": 0, + "content": "3.1 Datasets and metrics" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.788, + 0.843 + ], + "angle": 0, + "content": "In our experiments, we report worst-region and average F1, recall, precision, and CLIPScore. We follow [18] and evaluate performance w.r.t. two geographically diverse datasets containing images of objects in multiple regions: GeoDE [35] and DollarStreet [38]. Both datasets contain images of objects in their everyday settings and are intended to be geographically representative. However, images in GeoDE were submitted by people living in the regions of interest and were collected with specific guidelines, e.g., that the object of focus fills at least \\(25\\%\\) of the image, while images in DollarStreet were collected by photographers who travelled to various regions, with a special focus on \"disadvantaged and isolated areas\" [38]. Thus, DollarStreet likely has more income variation than GeoDE." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "code_caption", + "bbox": [ + 0.218, + 0.147, + 0.66, + 0.163 + ], + "angle": 0, + "content": "Algorithm 1 Contextualized Vendi Score Guidance (c-VSG)" + }, + { + "type": "algorithm", + "bbox": [ + 0.217, + 0.166, + 0.787, + 0.434 + ], + "angle": 0, + "content": "Require: Class label \\(y\\), a single fake image \\(x_{f}\\), a tensor of \\(M\\) real images \\(\\mathbf{X}_{\\mathbf{r}}\\), pretrained diffusion model \\(\\epsilon_{\\theta}\\), \\(N\\) number of generations to obtain, \\(T\\) number of diffusion steps, \\(G\\) frequency, \\(\\alpha\\), \\(\\beta\\) and \\(\\gamma\\) guidance weights \nEnsure: \\(\\mathbf{X}_{\\mathbf{f}}\\) a tensor with \\(N\\) diverse model samples \n\\(\\mathbf{X}_{\\mathbf{f}} \\gets x_{f}\\) \nfor \\(n = 1, \\ldots, N - 1\\) do \n\\(x^{n} \\sim \\mathcal{N}(\\mathbf{0}, \\mathbf{I})\\) \nfor \\(t = T, \\ldots, 1\\) do \nif \\(t \\% G\\) frequency == 0 then \n\\(\\hat{x}_{0,t}^{n} = \\mathrm{DDIMApprox}(x_{t}^{n})\\) \n\\(\\epsilon_{\\theta}^{(t)} \\gets \\nabla_{x} \\log p_{\\gamma}(x_{t}|y) + \\alpha \\nabla_{x} \\mathrm{VS}(\\hat{x}_{0,t}^{n}, \\mathbf{X}_{\\mathbf{f}}) - \\beta \\nabla_{x} \\mathrm{VS}(\\hat{x}_{0,t}^{n}, \\mathbf{X}_{\\mathbf{r}})\\) \n\\(\\boldsymbol{x}_{t-1}^{n} \\gets\\) one step of DDIM \nelse \n\\(\\epsilon_{\\theta}^{(t)} \\gets \\nabla_{x} \\log p_{\\gamma}(x_{t}|y)\\) \n\\(\\boldsymbol{x}_{t-1}^{n} \\gets\\) one step of DDIM \nend if \nend for \n\\(\\mathbf{X}_{\\mathbf{f}} \\gets \\mathrm{cat}(\\mathbf{X}_{\\mathbf{f}}, x_{0}^{n})\\) \nAdd final denoised sample to the memory \nend for" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.788, + 0.603 + ], + "angle": 0, + "content": "Furthermore, DollarStreet contains large imbalances between regions. We filter GeoDE to obtain 180 images from each region for a total of 27 objects. The remaining images are used as the pool for randomly selected exemplar real images. We subsample DollarStreet so that images contain only one concrete class, e.g., removing classes corresponding to favorite objects and images with multiple classes, and use the original distribution exclusive of the images used for contextualizing. For CLIPScore, we compute the average of the \\(10th\\)-percentile for each object class, as prior work suggests that the lower tail of the distribution tends to be most informative in capturing generation inconsistencies [18, 20]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.62, + 0.341, + 0.635 + ], + "angle": 0, + "content": "3.2 Baselines" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.705 + ], + "angle": 0, + "content": "We split our discussion between baselines that do not utilize any information specific to the task in order to improve generation diversity, and those that use small amounts of information from the task. To see examples of generations for different methods, see Appendix 6.4" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.706, + 0.52, + 0.719 + ], + "angle": 0, + "content": "Without any additional information:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.72, + 0.785, + 0.749 + ], + "angle": 0, + "content": "- LDM: This is the baseline setup where the unaltered LDM is used with the prompt {object} in {region} to condition the generation process." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.75, + 0.786, + 0.841 + ], + "angle": 0, + "content": "- Synonyms: This strategy maps each object class to its corresponding ImageNet [11] class and WordNet [29] synset. Each synset contains lemmas representing a specific \"sense\" of the given class. We generate images stratified across all possible lemmas (including the original object word), for each class, i.e., {synonym} in {region} is used to condition the generation process. The list of synonyms can be found in Appendix [6.1]." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.72, + 0.786, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.498, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.147, + 0.458, + 0.16 + ], + "angle": 0, + "content": "With additional information:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.163, + 0.8, + 0.238 + ], + "angle": 0, + "content": "- Paraphrasing: We use the LLaMA-2-70B-chat [48] large language model to generate paraphrases of the original prompt template, {object} in {region}. We include the specifications and descriptions used in the collection of GeoDE and DollarStreet. The metaprompts and paraphrases, as well as our method of tuning prompts and model specifications, are included in Appendix [6.1]." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.238, + 0.788, + 0.344 + ], + "angle": 0, + "content": "- Semantic Guidance: As observed in [18] and highlighted in Fig. 3, generated images tend to contain diversity issues related to the magnification of region-specific representations of objects beyond those in the evaluation task. To reduce this amplification of region information in the generated images, we employ Semantic Guidance [6,14] by adding negative guidance corresponding to the region term for each generation. Note that this baseline requires knowing the biases embedded in the text-to-image system upfront." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.344, + 0.788, + 0.419 + ], + "angle": 0, + "content": "- Feedback Guidance (FG): Following [22,43], during generation we use feedback from an external CLIP-based classifier to predict region labels of the generated images. We experiment with two versions of feedback guidance to encourage more diverse generations: one that maximizes the loss of the classifier and one that maximizes the entropy of predicted class distributions." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.42, + 0.788, + 0.48 + ], + "angle": 0, + "content": "- Textual Inversion: Textual inversion injects a learned token embedding using small subset of images from the evaluation task to better represent the reference images [16]. We apply textual inversion by learning an embedding for each object in the evaluation dataset using four images per object." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.163, + 0.8, + 0.48 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.506, + 0.431, + 0.521 + ], + "angle": 0, + "content": "3.3 Experimental set-up" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.534, + 0.789, + 0.673 + ], + "angle": 0, + "content": "We perform all experiments using an open sourced version of an LDM trained on a large scale dataset [39]. For c-VSG, we use \\(\\alpha = 1\\) and \\(\\beta = 2\\) unless otherwise specified, with two exemplar images as real world context and set \\(G_{\\text{freq}}\\) to 5. We calculate the Vendi Score in the CLIP ViT-B32 [34] feature space. For each method, we perform a hyperparameter search across guidance scales, as well as the weighting of contextual information, where applicable. We perform one-region-out hyper-parameter selection, selecting the best hyper-parameters for a given region based on the F1 for all the other regions. For computational complexity and efficiency see Appendix Sec. [6.5]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.696, + 0.325, + 0.71 + ], + "angle": 0, + "content": "3.4 Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.724, + 0.789, + 0.802 + ], + "angle": 0, + "content": "Overall results. On GeoDE (reported in Tab. 1), VSG without contextualization achieves a relative improvement in average F1 of \\(9.6\\%\\) over generations obtained with the LDM (VSG achieves F1 of 0.399 and LDM achieves F1 of 0.364), an improvement over baselines that do not leverage any additional information. Similarly, VSG yields relative improvement in worst-region F1 by \\(10.6\\%\\)." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.787, + 0.843 + ], + "angle": 0, + "content": "2 In this baseline, we do not implement the additional real/fake discriminator as suggested in [43], as we focus only on methods that utilize existing classifiers." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.787, + 0.215 + ], + "angle": 0, + "content": "Table 1: Comparison to baselines on GeoDE. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with increases, or little cost to, quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). AF: Africa, WAS: West Asia, \"label\" refers to region label, \"desc\" to text description, and \"img\" to exemplar images." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.226, + 0.787, + 0.366 + ], + "angle": 0, + "content": "
MethodRef. Info.Worst-Reg.F1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
LDM✘AF0.3640.3220.4130.2730.3370.3950.2420.218
Synonyms✘AF0.3570.3060.3500.2980.3660.3150.2150.203
VSG (ours)✘AF0.3990.3560.3490.3070.4700.4240.1800.191
ParaphrasingdescWAS0.3840.3540.3380.3090.4490.4150.2310.228
Semantic GuidancelabelWAS0.4200.4010.4590.5190.3910.3260.2450.253
FG CLIP (Loss)labelWAS0.4090.3780.3870.3830.4360.3730.2280.223
FG CLIP (Ent.)labelAF0.3800.3370.3440.3290.4290.3450.2240.227
Textual InversionimgAF0.3690.3630.4090.4440.3380.3080.2340.232
c-VSG (Ours)imgAF0.4550.4440.4240.4170.4930.4760.2540.253
" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.38, + 0.787, + 0.463 + ], + "angle": 0, + "content": "Table 2: Comparison to baselines on DollarStreet. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with little cost to quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). c-VSG outperforms all the methods by at least \\(8\\%\\) relative F1 improvement. AF: Africa, AS: Asia, \"label\" refers to region label, \"desc\" to text description, and \"img\" to exemplar images." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.476, + 0.784, + 0.613 + ], + "angle": 0, + "content": "
MethodRef. Info.Worst- Reg.F1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
LDMXAS0.4480.4420.4280.4340.4720.4500.2310.235
SynonymsXAS0.4640.4570.4510.4480.4790.4670.2160.220
VSG (ours)XAS0.4570.4440.4130.3880.5160.5180.1910.198
ParaphrasingdescAF0.4540.4450.4450.4540.4650.4370.2260.215
Semantic GuidancelabelAS0.4700.4580.4470.4490.4980.4670.2300.233
FG CLIP (Loss)labelAS0.4370.3940.4010.3210.4880.5100.2230.206
FG CLIP (Entropy)labelAS0.4650.4620.4120.4040.5350.5400.2220.219
Textual InversionimgAS0.4250.3980.4780.4910.3860.3350.2170.219
c-VSG (Ours)imgAS0.4970.4830.4860.4860.5110.4790.2340.238
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.643, + 0.785, + 0.672 + ], + "angle": 0, + "content": "Interestingly, using Synonyms tends to decrease performance, perhaps due to its enforcement of a strict, yet limited, distribution of object names." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.674, + 0.787, + 0.793 + ], + "angle": 0, + "content": "When considering methods that include additional information, we observe that leveraging textual descriptions of the evaluation dataset (Paraphrasing) is useful to improve average and worst-region F1. However, leveraging region information (Semantic Guidance, FG CLIP) yields better results. Notably, when the additional region information corresponds to known biases embedded in text-to-image systems, as is the case of Semantic Guidance, we observe substantial relative performance improvements of \\(15.4\\%\\) and \\(24.5\\%\\) in average and worst-region F1 over the LDM baseline." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Leveraging exemplar images to contextualize VSG results in further performance gains. In particular, c-VSG shows a \\(25\\%\\) and \\(37.9\\%\\) relative improvement in average and worst F1 compared to the LDM baseline. Comparing c-VSG with" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.496, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.144, + 0.498, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.5, + 0.144, + 0.778, + 0.264 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.361, + 0.266, + 0.64, + 0.277 + ], + "angle": 0, + "content": "(a) No VSG, i.e., {object} in {region} baseline" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.278, + 0.498, + 0.397 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.5, + 0.278, + 0.777, + 0.397 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.424, + 0.399, + 0.576, + 0.41 + ], + "angle": 0, + "content": "(b) Vendi Score Guidance" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.41, + 0.498, + 0.529 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.5, + 0.41, + 0.777, + 0.529 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.379, + 0.531, + 0.62, + 0.542 + ], + "angle": 0, + "content": "(c) Contextualized Vendi Score Guidance" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.554, + 0.788, + 0.641 + ], + "angle": 0, + "content": "Fig. 2: Generated images of cooking pots (Left) and cars (Right). The same six seeds are shared among the examples, and the box colors indicate images pertaining to Africa, Europe, and Southeast Asia. Vendi Score Guidance increases the diversity of generated images, including object type, positioning, and quality. Contextualization with exemplar images increases similarity to real world diversity. (More examples are shown in Appendix Figures [7] and [8])" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.671, + 0.788, + 0.701 + ], + "angle": 0, + "content": "the closest competitor, Semantic Guidance, we observe a relative improvement of \\(8.3\\%\\) and \\(10.7\\%\\) in average and worst-region F1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.702, + 0.788, + 0.778 + ], + "angle": 0, + "content": "Tab. 2 presents results on DollarStreet. In this case, uncontextualized VSG only moderately improves over the LDM baseline in average and worst-region F1. However, when including exemplar images per c-VSG, the patterns of improvement are consistent with GeoDE. c-VSG achieves \\(5.7\\%\\) and \\(4.5\\%\\) improvements over the closest baselines in average and worst-region F1, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.779, + 0.788, + 0.809 + ], + "angle": 0, + "content": "In the reminder of this section, we analyze the findings described above in the context of improvements to diversity, quality, and consistency." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.843 + ], + "angle": 0, + "content": "VSG improves diversity. The improvements in F1 relate to consistent boosting of both worst-region and average recall: for GeoDE (Tab. 1, recall), VSG" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.239 + ], + "angle": 0, + "content": "both with and without contextualization show improvements for all baselines, and by at least \\(7.3\\%\\) (and up to \\(46.2\\%\\)) over the LDM baseline. Similarly, VSG exhibits among the highest recall values in DollarStreet (Tab. 2, recall). FG CLIP (Ent.) achieves the highest recall values, but those come with significant drops in precision. Notably, for DollarStreet, VSG has better recall when exemplar images are not used. Again, this comes at a cost to precision." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.24, + 0.788, + 0.346 + ], + "angle": 0, + "content": "Diversity improvements are also reflected in qualitative examples. Fig. 2 reveals that VSG leads to greater variation in object color, type, and shape, such as more colorful cars for Africa, sports-cars for Europe, and lengthened hoods for Southeast Asia. With VSG, image backgrounds also show greater variety in textures and diversity in indoor vs. outdoor settings. In addition, VSG enables more inter-region diversity. For example, in Fig. 2 the same seed can look much more similar across regions in the baseline than with c-VSG." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.348, + 0.788, + 0.531 + ], + "angle": 0, + "content": "Contextualized VSG improves quality. In GeoDE, c-VSG also allows for improvement in both average and worst-region precision over the LDM baseline, the latter by up to \\(52.7\\%\\) (Tab. 1, precision). Similar precision gains are observed in DollarStreet (Tab. 2, precision): leveraging exemplar images results in relative improvements of \\(12\\%\\) in worst-region over the LDM baseline. Comparing c-VSG with VSG shows relative gains of \\(17.7\\%\\) and \\(25.3\\%\\) in average and worst-region precision, respectively. Interestingly, Semantic Guidance allows for higher precision than c-VSG on GeoDE, whose images were submitted by people living in the regions of interest. The lower precision achieved by Semantic Guidance on DollarStreet might be related to the datasets' focus on disadvantaged and isolated areas. Thus, Semantic Guidance requires an understanding of whether applying region information helps or hurts the diversity of the generations." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.533, + 0.788, + 0.609 + ], + "angle": 0, + "content": "Contextualized VSG improves consistency. In both GeoDE and DollarStreet, we observe that VSG without contextualization slightly reduces consistency (Tab. 1 and 2, CLIPScore). This highlights the importance of contextualization when using VSG: leveraging exemplar images in c-VSG results in the highest CLIPscores across the board, on average and for the worst-region." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.611, + 0.788, + 0.718 + ], + "angle": 0, + "content": "Contextualized VSG reduces disparities across regions. When comparing c-VSG to VSG, we observe that disparities across regions appear substantially reduced on both datasets. On GeoDE, contextualization reduces the performance gap between average and worst-region in F1, recall, precision, and CLIPScore. Similar trends may be observed for DollarStreet, where c-VSG exhibits remarkably lower disparities across all metrics when compared to the LDM baseline. It is worth noting that Semantic Guidance also has low disparities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Contextualized VSG shows early improvements in region representation. While this work does not focus particularly on mitigation of reductive regional representations, we find in initial qualitative inspections that representations of regions can change positively after applying contextualized VSG. We find that for Africa, objects like cars and cooking pots are less dilapidated with VSG, as compared to the original generations. In addition, some objects tend to be larger and more central in the image, reducing the prevalence of unrepresentative background fixtures, as shown in Appendix 6.2. The improve" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.496, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.222 + ], + "angle": 0, + "content": "ment of consistency with contextualization similarly reduces the dominance of non-representative regional background information. Remaining images without objects tend to have less repetition in reductive backgrounds associated with regional tropes. For example, Appendix 6.2 shows that generated images of bags in Europe can have more variety in their backgrounds when using c-VSG." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.244, + 0.344, + 0.258 + ], + "angle": 0, + "content": "3.5 Ablations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.269, + 0.786, + 0.299 + ], + "angle": 0, + "content": "We next discuss ablations on the variations of VSG criteria and the strength, quantity, and type of exemplar images used in c-VSG." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.787, + 0.389 + ], + "angle": 0, + "content": "Variations of c-VSG Criteria. We compare the use of the full contextualized Vendi Score Guidance criterion from our approach (\\(\\alpha > 0\\), \\(\\beta > 0\\), c-VSG) to Vendi Score guidance without contextualization (\\(\\alpha > 0\\), \\(\\beta = 0\\), VSG), a criterion using the exemplar contextualizing images exclusively (\\(\\alpha = 0\\), \\(\\beta > 0\\)), and the LDM without intervention (\\(\\alpha = 0\\), \\(\\beta = 0\\)). Results are shown in Tab. 3 and visual examples in Appendix 6.2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.39, + 0.788, + 0.541 + ], + "angle": 0, + "content": "When evaluating with GeoDE, we find that Vendi Score guidance without contextualization can lead to images with improved diversity but unrealistic object shapes and colors, as well as extreme variation in styles, such as black-and-white or film-style photos. While using exclusively contextualizing images helps in almost all aspects as opposed to only the Vendi Score guidance on the bank of generated images, the methods combined tend to have the best diversity. For DollarStreet, there is a slight trade-off in precision and recall between the inclusion of contextualizing images versus previously generated images in the criterion: while the combination of the two has moderately better measures over only contextualizing images, the use of only previously generated images shows the highest recall." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.541, + 0.788, + 0.648 + ], + "angle": 0, + "content": "Strength of exemplar images. Tab. 4 shows ablations of the strength of exemplar images used in the contextualized VSG criterion. Unsurprisingly, lower weight \\(\\beta\\) of real exemplar images yields greater recall while a higher weight leads to a larger precision, emphasizing the quality vs. diversity trade-off. For example, increasing \\(\\beta\\) can correlate with changes in camera angle of cars to more closely match those in the reference images, as shown in Appendix 6.2 In addition, consistency is improved with additional weight to exemplar images." + }, + { + "type": "table_caption", + "bbox": [ + 0.316, + 0.672, + 0.687, + 0.687 + ], + "angle": 0, + "content": "Table 3: Ablation study on variations of VSG criteria." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.698, + 0.789, + 0.839 + ], + "angle": 0, + "content": "
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDE000.3640.3220.4130.2730.3370.3950.2420.218
GeoDEtuned00.3990.3560.3490.3070.4700.4240.1800.191
GeoDE0tuned0.4460.4270.4310.4090.4640.4470.2610.254
GeoDEtunedtuned0.4550.4440.4240.4170.4930.4760.2540.253
DollarStreet000.4480.4420.4280.4340.4720.4500.2310.235
DollarStreettuned00.4570.4440.4130.3880.5160.5180.1910.198
DollarStreet0tuned0.4920.4800.4860.4830.5000.4760.2400.242
DollarStreettunedtuned0.4970.4830.4860.4860.5110.4790.2340.238
" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.24, + 0.145, + 0.761, + 0.159 + ], + "angle": 0, + "content": "Table 4: Ablation study on exemplar images strength in contextualized VSG." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.171, + 0.787, + 0.253 + ], + "angle": 0, + "content": "
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDEtunedα0.4510.4340.3840.3800.5470.5060.2160.221
GeoDEtuned2α0.4550.4440.4240.4170.4930.4760.2540.253
GeoDEtuned4α0.4480.4370.4280.4350.4720.4380.2610.261
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.266, + 0.785, + 0.307 + ], + "angle": 0, + "content": "Table 5: Ablation study on the number of exemplar images per object used in the contextualized Vendi Score computation, or \\( M \\) in Algorithm 1. Results are reported based on GeoDE dataset." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.32, + 0.787, + 0.438 + ], + "angle": 0, + "content": "
Method#imgsF1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
c-VSG2 per obj.0.4550.4440.4240.4170.4930.4760.2540.253
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG8 per obj.0.4550.4420.4450.4360.4660.4490.2620.257
c-VSG20 per obj.0.4600.4330.4400.4340.4850.4330.2510.246
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG4 per obj.-reg.0.4540.4450.4360.4310.4750.4590.2590.253
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.466, + 0.788, + 0.648 + ], + "angle": 0, + "content": "Quantity and type of exemplar images. In Tab. 5, we first study how the number of images selected as exemplar images in c-VSG affects image generation diversity. Generally, using fewer exemplar images tends to help with diversity while increasing this number helps with quality, although these trends appear minor in some cases. In Appendix 6.2, we visually inspect images and find that trends in quality and consistency for a single seed can also reverse as the number of images increases, first improving, then worsening (or vice versa). In addition, we study whether exemplar images randomly selected across all possible regions or the same number images selected specifically for a given region yields better diversity. We find that region-stratified exemplar images yield results within \\(1 - 2\\%\\) of those when using randomly selected images for all measures except for worst-region recall, for which there is a \\(5\\%\\) improvement." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.671, + 0.388, + 0.687 + ], + "angle": 0, + "content": "4 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Prior work often focuses on mitigating general diversity issues in text-to-image models. For example, 37.50 focus on preventing mode collapse while 44 generates a balanced distribution, focusing on the long-tail, by using synthetic images. In addition, there is growing research focused on issues related to diversity through a lens of reducing person-related bias. One line of work reduces people-related biases, e.g., related to gender, through concept forgetting or erasure 23, 33, 52, rather than diversification. The idea is that, by modifying a model's understanding of a concept, the harmful or biased content is not generated. 10 augments the original prompt with real-world distributions of gender" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.496, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.285 + ], + "angle": 0, + "content": "and ethnicity using a finetuned language model, and [25,51] learn token embeddings for a diverse set of sensitive attributes and concatenate them to the original prompt. Building on work in NLP [5], other approaches remove the components of sensitive attributes like race and gender from the text embeddings altogether [9,47] or modify the cross attention layer [17,33] to remove implicit assumptions about the world. However, there is little work investigating improvements to geographic diversity. To the best of our knowledge, prior work primarily discusses the (minimal) improvement in diversity when including more granular geographic information in text prompts [2,18]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.285, + 0.788, + 0.42 + ], + "angle": 0, + "content": "Our proposed method is most relevant to works that use classifier guidance during inference time. [7,42] use classifier guidance to guide generations away from inappropriate content. In the context of augmenting a dataset with synthetic samples, [22] has extended the idea of classifier guidance to feedback guidance where loss and entropy are used as the guidance mechanism. While the Vendi Score has been used at training time to increase the diversity of generative adversarial networks (GANs) across modes in the training dataset [3], to the best of our knowledge, we are the first to apply it to diffusion models and as guidance at inference time." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.451, + 0.359, + 0.467 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.49, + 0.788, + 0.596 + ], + "angle": 0, + "content": "In this work, we introduced an inference time intervention that extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other while still representative of the real world. Through extensive experiments, we showed that our approach produces images with higher intra- and inter-region diversity, while exhibiting increased image quality and text-image consistency; overall resulting in reduced disparities in generation diversity, quality and consistency." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.788, + 0.734 + ], + "angle": 0, + "content": "Limitations. In this work, we focus on improving worst-region F1 while also analyzing worst and average region precision, recall, and consistency. Automatic metrics are susceptible to several challenges, including region representations in the reference dataset, reliance on pre-existing feature extractors, and the composition of geographic groupings. The metrics are aggregates and do not account for individual preferences. A human evaluation study would be necessary for capturing subjective and personal perspectives about the effect of c-VSG. Finally, our approach is only a single effort at improving the diversity of text-to-image generative models, and there remains future work for their further improvement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Societal Impacts. This work involves representations of geographic regions. While our qualitative analyses show that c-VSG tends to help mitigate reductive representations of regions, our method may not always remove harmful representations in the underlying generative models. Furthermore, increasing the diversity of text-to-image models may yield unexpected generations. Thorough study of the full range of potential outcomes is necessary before deployment of these methods in real world systems." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.393, + 0.163 + ], + "angle": 0, + "content": "Acknowledgments" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.177, + 0.787, + 0.254 + ], + "angle": 0, + "content": "We would like to thank Oscar Manas and Pietro Astolfi for helpful discussion and pointers regarding in-context learning and paraphrasing approaches. We also thank Mohammad Pezeshki for useful discussions, feedback and support. In addition, we thank the participants of the qualitative study of c-VSG, discussed in Appendix 6.3." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.496, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.324, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.173, + 0.787, + 0.214 + ], + "angle": 0, + "content": "1. Bansal, H., Yin, D., Monajatipoor, M., Chang, K.W.: How well can text-to-image generative models understand ethical natural language interventions? In: EMNLP (Short) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.215, + 0.787, + 0.242 + ], + "angle": 0, + "content": "2. Basu, A., Babu, R.V., Pruthi, D.: Inspecting the geographical representativeness of images from text-to-image models. arXiv preprint arXiv:2305.11080 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.242, + 0.787, + 0.268 + ], + "angle": 0, + "content": "3. Berns, S., Colton, S., Guckelsberger, C.: Towards mode balancing of generative models via diversity weights (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.269, + 0.787, + 0.31 + ], + "angle": 0, + "content": "4. Bianchi, F., Kalluri, P., Durmus, E., Ladhak, F., Cheng, M., Nozza, D., Hashimoto, T., Jurafsky, D., Zou, J., Caliskan, A.: Easily accessible text-to-image generation amplifies demographic stereotypes at large scale (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.31, + 0.787, + 0.351 + ], + "angle": 0, + "content": "5. Bolukbasi, T., Chang, K.W., Zou, J.Y., Saligrama, V., Kalai, A.T.: Man is to computer programmer as woman is to homemaker? debiasing word embeddings. Advances in neural information processing systems 29 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.351, + 0.787, + 0.378 + ], + "angle": 0, + "content": "6. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing text-to-image models using semantic guidance (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.378, + 0.787, + 0.418 + ], + "angle": 0, + "content": "7. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.419, + 0.787, + 0.446 + ], + "angle": 0, + "content": "8. Cho, J., Zala, A., Bansal, M.: Dall-eval: Probing the reasoning skills and social biases of text-to-image generative transformers (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.446, + 0.787, + 0.472 + ], + "angle": 0, + "content": "9. Chuang, C.Y., Jampani, V., Li, Y., Torralba, A., Jegelka, S.: Debiasing vision-language models via biased prompts. arXiv preprint arXiv:2302.00070 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.472, + 0.787, + 0.527 + ], + "angle": 0, + "content": "0. Clemmer, C., Ding, J., Feng, Y.: Precisedebias: An automatic prompt engineering approach for generative ai to mitigate image demographic biases. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 8596-8605 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.527, + 0.787, + 0.58 + ], + "angle": 0, + "content": "1. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009). https://doi.org/10.1109/CVPR.2009.5206848" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.581, + 0.787, + 0.609 + ], + "angle": 0, + "content": "2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.609, + 0.787, + 0.636 + ], + "angle": 0, + "content": "3. Friedman, D., Dieng, A.B.: The vendi score: A diversity evaluation metric for machine learning. arXiv preprint arXiv:2210.02410 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.636, + 0.787, + 0.677 + ], + "angle": 0, + "content": "4. Friedrich, F., Schramowski, P., Brack, M., Struppek, L., Hintersdorf, D., Luccioni, S., Kersting, K.: Fair diffusion: Instructing text-to-image generation models on fairness (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.677, + 0.787, + 0.731 + ], + "angle": 0, + "content": "5. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Makea-scene: Scene-based text-to-image generation with human priors. In: Computer Vision-ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23-27, 2022, Proceedings, Part XV. pp. 89-106. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.787, + 0.772 + ], + "angle": 0, + "content": "6. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.772, + 0.787, + 0.799 + ], + "angle": 0, + "content": "7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "8. Hall, M., Ross, C., Williams, A., Carion, N., Drozdzal, M., Soriano, A.R.: Dig in: Evaluating disparities in image generations with indicators for geographic diversity (2023)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.173, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.48, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "Contextualized Vendi Score Guidance" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "19. Hao, S., Shelby, R., Liu, Y., Srinivasan, H., Bhutani, M., Ayan, B.K., Poddar, S., Laszlo, S.: Harm amplification in text-to-image models (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.218 + ], + "angle": 0, + "content": "20. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? arXiv preprint arXiv:2210.07574 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.219, + 0.785, + 0.261 + ], + "angle": 0, + "content": "21. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? (2023), https://arxiv.org/abs/2210.07574" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.262, + 0.785, + 0.289 + ], + "angle": 0, + "content": "22. Hemmat, R.A., Pezeshki, M., Bordes, F., Drozdjal, M., Romero-Soriano, A.: Feedback-guided data synthesis for imbalanced classification (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.29, + 0.785, + 0.331 + ], + "angle": 0, + "content": "23. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. Advances in Neural Information Processing Systems 36 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.332, + 0.785, + 0.36 + ], + "angle": 0, + "content": "24. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.361, + 0.785, + 0.388 + ], + "angle": 0, + "content": "25. Kim, E., Kim, S., Shin, C., Yoon, S.: De-stereotyping text-to-image models through prompt tuning (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.389, + 0.785, + 0.416 + ], + "angle": 0, + "content": "26. Kynkänniemi, T., Karras, T., Laine, S., Lehtinen, J., Aila, T.: Improved precision and recall metric for assessing generative models (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.418, + 0.785, + 0.445 + ], + "angle": 0, + "content": "27. Luccioni, A.S., Akiki, C., Mitchell, M., Jernite, Y.: Stable bias: Analyzing societal representations in diffusion models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.446, + 0.785, + 0.488 + ], + "angle": 0, + "content": "28. Manas, O., Astolfi, P., Hall, M., Ross, C., Urbanek, J., Williams, A., Agrawal, A., Romero-Soriano, A., Drozdzal, M.: Improving text-to-image consistency via automatic prompt optimization (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.489, + 0.785, + 0.531 + ], + "angle": 0, + "content": "29. Miller, G.A.: WordNet: A lexical database for English. In: Human Language Technology: Proceedings of a Workshop held at Plainsboro, New Jersey, March 8-11, 1994 (1994), https://aclanthology.org/H94-1111" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.531, + 0.785, + 0.572 + ], + "angle": 0, + "content": "30. Naeem, M.F., Oh, S.J., Uh, Y., Choi, Y., Yoo, J.: Reliable fidelity and diversity metrics for generative models. In: International Conference on Machine Learning. pp. 7176-7185. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.573, + 0.785, + 0.587 + ], + "angle": 0, + "content": "31. Naik, R., Nushi, B.: Social biases through the text-to-image generation lens (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.588, + 0.785, + 0.643 + ], + "angle": 0, + "content": "32. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: GLIDE: towards photorealistic image generation and editing with text-guided diffusion models. CoRR abs/2112.10741 (2021), https://arxiv.org/abs/2112.10741" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.644, + 0.785, + 0.671 + ], + "angle": 0, + "content": "33. Orgad, H., Kawar, B., Belinkov, Y.: Editing implicit assumptions in text-to-image diffusion models. arXiv preprint arXiv:2303.08084 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.672, + 0.785, + 0.728 + ], + "angle": 0, + "content": "34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.729, + 0.785, + 0.77 + ], + "angle": 0, + "content": "35. Ramaswamy, V.V., Lin, S.Y., Zhao, D., Adcock, A.B., van der Maaten, L., Ghadiyaram, D., Russakovsky, O.: Beyond web-scraping: Crowd-sourcing a geodiverse dataset. In: arXiv preprint (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.771, + 0.785, + 0.798 + ], + "angle": 0, + "content": "36. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "37. Rangwani, H., Jaswani, N., Karmali, T., Jampani, V., Babu, R.V.: Improving gans for long-tailed data through group spectral regularization. In: European Conference on Computer Vision. pp. 426-442. Springer (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.496, + 0.128 + ], + "angle": 0, + "content": "R. Askari Hemmat, M. Hall et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.203 + ], + "angle": 0, + "content": "38. Rojas, W.A.G., Diamos, S., Kini, K.R., Kanter, D., Reddi, V.J., Coleman, C.: The dollar street dataset: Images representing the geographic and socioeconomic diversity of the world. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.204, + 0.788, + 0.245 + ], + "angle": 0, + "content": "39. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. CoRR abs/2112.10752 (2021), https://arxiv.org/abs/2112.10752" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.788, + 0.286 + ], + "angle": 0, + "content": "40. Sajjadi, M.S.M., Bachem, O., Lučić, M., Bousquet, O., Gelly, S.: Assessing Generative Models via Precision and Recall. In: Advances in Neural Information Processing Systems (NeurIPS) (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.788, + 0.314 + ], + "angle": 0, + "content": "41. Salimans, T., Ho, J.: Progressive distillation for fast sampling of diffusion models. arXiv preprint arXiv:2202.00512 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.788, + 0.369 + ], + "angle": 0, + "content": "42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22522-22531 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.37, + 0.788, + 0.397 + ], + "angle": 0, + "content": "43. Sehwag, V., Hazirbas, C., Gordo, A., Ozgenel, F., Ferrer, C.C.: Generating high fidelity data from low-density regions using diffusion models (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.788, + 0.425 + ], + "angle": 0, + "content": "44. Shin, J., Kang, M., Park, J.: Fill-up: Balancing long-tailed data with generative models. arXiv preprint arXiv:2306.07200 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.426, + 0.788, + 0.452 + ], + "angle": 0, + "content": "45. Song, J., Meng, C., Ermon, S.: Denoising Diffusion Implicit Models. In: Proceedings of the International Conference on Learning Representations (ICLR) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.743, + 0.467 + ], + "angle": 0, + "content": "46. Song, Y., Dhariwal, P., Chen, M., Sutskever, I.: Consistency models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.468, + 0.788, + 0.508 + ], + "angle": 0, + "content": "47. Tanjim, M.M., Singh, K.K., Kafle, K., Sinha, R., Cottrell, G.W.: Discovering and mitigating biases in clip-based image editing. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2984-2993 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.788, + 0.55 + ], + "angle": 0, + "content": "48. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.551, + 0.788, + 0.577 + ], + "angle": 0, + "content": "49. Wan, Y., Chang, K.W.: The male ceo and the female assistant: Probing gender biases in text-to-image models through paired stereotype test (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.788, + 0.632 + ], + "angle": 0, + "content": "50. Yu, N., Li, K., Zhou, P., Malik, J., Davis, L., Fritz, M.: Inclusive gan: Improving data and minority coverage in generative models. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 377-393. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.788, + 0.674 + ], + "angle": 0, + "content": "51. Zhang, C., Chen, X., Chai, S., Wu, C.H., Lagun, D., Beeler, T., De la Torre, F.: Iti-gen: Inclusive text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3969-3980 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.788, + 0.703 + ], + "angle": 0, + "content": "52. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2303.17591 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.703 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_origin.pdf b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a0cefb5fdcaa539d63c8beff5d19fc95fd92007b --- /dev/null +++ b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/d70dc69d-c78f-4d6e-811f-98ee4353aa24_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c7009cac2f903038cbbed28824c03022bd97501c3a9733d3cb507fecc57dfb97 +size 8478129 diff --git a/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/full.md b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/full.md new file mode 100644 index 0000000000000000000000000000000000000000..d5502e040c36454eb7721779d6544033f348783c --- /dev/null +++ b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/full.md @@ -0,0 +1,317 @@ +# Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance + +Reyhane Askari Hemmat $^{1}$ , Melissa Hall $^{1}$ , Alicia Sun $^{1}$ , Candace Ross $^{1}$ , Michal Drozdzal $^{1}$ , and Adriana Romero-Soriano $^{1,2,3,4}$ + +1 FAIR at Meta, 2 Mila, 3 McGill University, 4 Canada CIFAR AI Chair + +Abstract. With the growing popularity of text-to-image generative models, there has been increasing focus on understanding their risks and biases. Recent work has found that state-of-the-art models struggle to depict everyday objects with the true diversity of the real world and have notable gaps between geographic regions. In this work, we aim to increase the diversity of generated images of common objects such that per-region variations are representative of the real world. We introduce an inference-time intervention, contextualized Vendi Score Guidance (c-VSG), that guides the backwards steps of latent diffusion models to increase the diversity of a sample as compared to a "memory bank" of previously generated images while constraining the amount of variation within that of an exemplar set of real-world contextualizing images. We evaluate c-VSG with two geographically representative datasets and find that it substantially increases the diversity of generated images, both for the worst-performing regions and on average, while simultaneously maintaining or improving image quality and consistency. Additionally, qualitative analyses reveal that diversity of generated images is significantly improved, including along the lines of reductive region portrayals present in the original model. We hope that this work is a step towards text-to-image generative models that reflect the true geographic diversity of the world. + +Keywords: geo-diversity $\cdot$ image generation $\cdot$ diffusion models + +# 1 Introduction + +The unprecedented results achieved by text-to-image systems [15,32,36,39] and their wide-spread use as plug-and-play solutions have propelled a body of research to understand their potential risks and biases [18,27]. Recent works have highlighted through qualitative and quantitative evaluations the disparities in demographic traits of people represented in the generated images [19,31,49], triggering the design of mitigation strategies based on textual interventions [16], attention-weight modification [17], and semantic guidance [14]. + +![](images/307d3d9394a24da6021903b8f71570aa552d3141691ef2276cd35c8975880b3b.jpg) +(a) + +![](images/26ae13afff23f9b14c03a368b77c86fb4aa3e08f9fb4ee553946a294e0c4e404.jpg) +(b) +Fig.1: (a) We present Contextualized Vendi Score Guidance (c-VSG), an inference-time intervention to increase the diversity of images generated by latent diffusion models (LDMs). c-VSG guides backwards steps of the diffusion process using the Vendi Score [13] to increase the diversity among a sample $x_{t}$ and a memory bank of previous generations (with weight $\alpha$ ) while constraining excessive variation using a small set of real, contextualizing exemplar images (with weight $\beta$ ). (b) Generations of dog in Africa, all with the same seed. First row has zero c-VSG guidance scale and as a result all samples are the same. As we increase the c-VSG guidance scale, we observe increased diversity in generations. + +Beyond human-centric representations, research has shown that stereotypical biases also occur for representations of objects and their surroundings across the globe [2,4,18]. In particular, previous studies highlighted that progress in image quality or realism has come at the expense of representation diversity and text-image consistency [18]. This trade-off affects some regions more than others, hindering the progress towards conditional image generative systems that truly work well for all geographic regions. Notably, images generated with text prompts that include regional information contain limited object diversity and heightened geographic stereotypes. As shown in [18], many generations depict limited diversity in object type. Yet, to the best of our knowledge, no mitigation strategies have directly targeted geo-diversity in text-to-image systems. + +In this paper, we aim to mitigate disparities in representation diversity of common objects across worldwide regions. More precisely, our goal is to increase the objects' representation diversity such that per-region variation in type of object, as observed in the real world, is better reflected in the generations. In doing so, we aim to maintain (or improve) the quality of images as well as their text-image consistency. + +We devise a novel approach called Vendi Score Guidance (VSG) that increases the representation diversity of the generations by leveraging the Vendi Score (VS) [13] - a dataset diversity evaluation metric. In particular, VSG extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other, intuitively maximizing the effective number of samples among the obtained generations. This + +requires the proposed guidance strategy to operate auto-regressively w.r.t. the previous generations. We implement this by keeping a memory bank of past generations that ensures that the current sample differs from those in the memory.do Yet, increasing diversity in an unconstrained way results in generations that lack either image realism or text-generation consistency. Therefore, we propose to contextualize VSG by providing a small set of randomly selected real images of objects, referred to as exemplar images, and guiding the generation process towards diverse samples that are grounded on those exemplar images. We evaluate the proposed approach by measuring precision [26,40], recall [26,40], and CLIPScore [24] to assess image realism/quality, representation diversity, and text-image consistency, respectively. We report results on two geographically diverse datasets that contain images of the common objects collected around the world, GeoDE [35] and DollarStreet [38]. + +Our results show that contextualized Vendi Score Guidance improves worst-region and average F1 for both datasets, including a relative improvement of $40\%$ in worst-region F1 over the Latent Diffusion Model (LDM) baseline without any intervention when measured on GeoDE and $11\%$ over the next closest baseline, and reduces performance disparities across regions. Even without contextualization, VSG shows relative improvements of up to $10\%$ over the LDM baseline in F1. Upon visual inspection we find the object diversity in images to be significantly improved, with greater variation in object color, type, shape, and size. In addition, VSG improvements often coincide with improved regional representations beyond reductive portrayals present in the original model. Finally, we find in ablations that our combined use of the Vendi Score to encourage image diversity relative to previous generations while constraining variation to that of the real world with contextualizing exemplar images meaningfully navigates the diversity vs. quality tradeoff. + +The contributions of this work can be summarized as follows: + +- We introduce a new inference-time intervention, contextualized Vendi Score Guidance (c-VSG), to increase the diversity of images generated by LDMs using a memory bank of previously generated images and exemplar images. +- When evaluated with two geographically representative real world datasets, c-VSG shows significant improvement in diversity and quality over the vanilla LDM, while maintaining text-image consistency. +- c-VSG shows improvements in average and worst-region F1 over state-of-the-art baselines, while exhibiting reduced disparities in quality, diversity and text-generation consistency across regions. +- Our ablations demonstrate the efficacy of the memory and contextualizing components of the c-VSG criterion. + +We hope this work contributes to image generations that better reflect the geographic diversity of the real world. + +# 2 Method + +In this work, we focus on increasing the diversity of latent diffusion models (LDMs). We first provide preliminary details about the components of the LDM generation process in which we apply our interventions, as well as the Vendi Score metric. Then, we introduce our proposed methodology, Vendi Score Guidance. + +# 2.1 Preliminaries + +Sampling in LDMs. In this work, we focus on a class of LDMs called denoising diffusion implicit models (DDIMs) [45]. At inference or generation time, DDIMs use a reverse process defined as: + +$$ +x _ {t - 1} = \sqrt {\xi_ {t - 1}} \hat {x} _ {0, t} + \underbrace {\sqrt {1 - \xi_ {t - 1} - \sigma_ {t} ^ {2}} \cdot \epsilon_ {\theta} ^ {(t)} (x _ {t})} _ {\text {d i r e c t i o n p o i n t i n g t o} x _ {t}} + \underbrace {\sigma_ {t} \epsilon_ {t}} _ {\text {r a n d o m n o i s e}}, \tag {1} +$$ + +where $x_{t}$ is the sample at time step $t$ , $\epsilon_t \sim \mathcal{N}(\mathbf{0},\mathbf{I})$ and $\xi_{t}$ and $\sigma_{t}$ are time-dependent coefficients, and $\hat{x}_{0,t}$ is the DDIM approximation of the denoised sample given current $x_{t}$ , + +$$ +\hat {x} _ {0, t} = \operatorname {D D I M A p p r o x} \left(x _ {t}\right) := \frac {x _ {t} - \sqrt {1 - \xi_ {t}} \epsilon_ {\theta} ^ {(t)} \left(x _ {t}\right)}{\sqrt {\xi_ {t}}}, \tag {2} +$$ + +and $\epsilon_{\theta}^{(t)}$ is the pretrained denoising network parameterized by $\theta$ that approximates the score function conditioned on a class or prompt $y$ , + +$$ +\epsilon_ {\theta} ^ {(t)} \approx \nabla_ {x} \log p (x _ {t} | y). \qquad \qquad (3) +$$ + +In this work, we modify this score function to guide the sampling process towards generating more diverse samples. + +Guidance in LDMs. LDMs often condition generated samples on labels or text prompts in the score function. If one has access to a pretrained denoising network that only approximates the unconditional score function $(\nabla_{x}\log p(x))$ , one can use classifier-guidance [12] to generate a conditional sample. Classifier-guidance modifies the score function using a pretrained classifier that provides $\log p(y|x_t)$ , + +$$ +\epsilon_ {\theta} ^ {(t)} \approx \nabla_ {x} \log p _ {\gamma} (x _ {t} | y) = \nabla_ {x} \log p (x _ {t}) + \gamma \nabla_ {x} \log p (y | x _ {t}), \qquad (4) +$$ + +where $\gamma$ is a scaling factor controlling the strength of class-conditional generation. In this work, we adapt this concept of guidance by utilizing the Vendi Score [13], rather than a classifier, as our guidance function. + +Vendi Score (VS). The VS is a metric for evaluating diversity in machine learning [13]. It applies a user-defined similarity function to a set of samples, without the need for a reference dataset as opposed to metrics such as recall or coverage [26,30,40]. VS measures the effective number of examples by computing + +the soft-rank of a similarity or kernel matrix. The similarity matrix is calculated using a similarity function that takes two samples and returns a positive value indicating how similar they are. Higher rank of the similarity matrix corresponds to higher Vendi Score and diversity. + +Formally, given a set of samples $x_{1},\ldots ,x_{n}$ , we can define a positive semi-definite similarity function $k$ with $k(x,x) = 1$ for all $x$ . The similarity function is applied on every pair of samples in our dataset to create a similarity matrix, $\mathcal{K}$ where $\mathcal{K}_{i,j} = k(x_i,x_j)$ . VS is then defined as the soft-rank of $\mathcal{K} / n$ , i.e., the exponential of the entropy of the eigenvalues of $\mathcal{K} / n$ [13]: + +$$ +\operatorname {V S} \left(x _ {1}, \dots , x _ {n}\right) = \exp \left(- \sum_ {i = 1} ^ {n} \lambda_ {i} \log \lambda_ {i}\right), \tag {5} +$$ + +where $\lambda_1, \ldots, \lambda_n$ are the eigenvalues of $\mathcal{K} / n$ . + +A common choice for the similarity function is the cosine-similarity of every pair of samples in the dataset in a pre-defined feature space. + +# 2.2 Vendi Score Guidance + +In this section, we introduce our proposed approach, called Vendi Score Guidance (VSG). Our goal is to increase the diversity of the generated samples by incorporating the Vendi Score as an auto-regressive guidance mechanism during diffusion model inference. In other words, every new generation will take into consideration all previously generated samples and will aim to generate a sample which is substantially different from the previous ones. + +Let us define a memory bank which contains all the previously generated samples as $\mathbf{X}_{\mathbf{f}}: \{x^{1}, \ldots, x^{n}\}$ . Given the $\mathbf{X}_{\mathbf{f}}$ , and a newly generated sample $x$ , we can compute $\mathrm{VS}(x, \mathbf{X}_{\mathbf{f}})$ . Our goal is to modify the generation process of $x$ by steering it towards part of the manifold that increases VS, and thus, augment the sample diversity. We can achieve this via the following score function, + +$$ +\epsilon_ {\theta} ^ {(t)} \approx \nabla_ {x} \log p _ {\gamma , \alpha} \left(x _ {t} | y, \mathbf {X} _ {\mathbf {f}}\right) = \nabla_ {x} \log p _ {\gamma} \left(x _ {t} | y\right) + \alpha \nabla_ {x} \operatorname {V S} \left(\hat {x} _ {0, t}, \mathbf {X} _ {\mathbf {f}}\right), \tag {6} +$$ + +where $\alpha$ is a scaling factor that controls the strength of the Vendi Score guidance and $\hat{x}_{0,t}$ is the predicted denoised sample. + +A naive way of finding $\hat{x}_{0,t}$ is to apply all the $T$ steps of the backward diffusion process and use the denoised image to compute the Vendi Score. However, this is computationally expensive. Thus, we use the efficient DDIM approximation of a denoised sample, given in Eq. 2. + +We note that the original Vendi Score formulation in Eq. 5 is not differentiable, since it requires finding the singular values of the similarity matrix, and singular value decomposition is not differentiable. To overcome this limitation, we developed a simple algorithm to compute the Vendi Score in a differentiable way and present it in Appendix 6.2. + +Contextualized Vendi Score Guidance (c-VSG). In experimentation, we found that unconstrained VSG can have limited efficacy, as generated images may drift from real world representations. Thus, in the second part of our method, we use Vendi Score a second time with a small set of randomly selected exemplar images, $\mathbf{X}_{\mathbf{r}}$ . This set of exemplar images is used to contextualize the Vendi Score computation and thus, the generation process. Similar to Eq. 6, we compute $\mathrm{VS}(x,\mathbf{X_r})$ . However, because we want to reduce excessive drift from the exemplar representation of images, we calculate the gradients with respect to the negative of this score. Overall, we use the following score function which combines VSG with contextualized samples: + +$$ +\nabla_ {x} \log p (x _ {t} | y, \mathbf {X _ {f}}, \mathbf {X _ {r}}) = \nabla_ {x} \log p _ {\gamma , \alpha} (x _ {t} | y, \mathbf {X _ {f}}) - \beta \nabla_ {x} \mathrm {V S} (\hat {x} _ {0, t}, \mathbf {X _ {r}}), \qquad (7) +$$ + +where $\beta$ is a scaling factor that controls the strength of VSG contextualization. This formulation allows the model to generate samples that remain close to the exemplar images without the need for additional training. Intuitively, the modified score function (Eq. 7) steers the generation process towards parts of the space which would result in a sample that increases the rank of the memory bank while staying close to the exemplar images. + +Algorithm $\mathbb{I}$ presents the c-VSG computation step by step. Note that we use $G_{\text{freq}}$ to control the rate at which c-VSG is applied in the diffusion process, allowing for a balance between efficiency and diversity. To generate image $x^n$ , we apply the proposed guidance in the backward diffusion process. In the intermediate steps and when the sample is not yet generated, we use DDIM's approximation of $\hat{x}_0$ and feed it to the VS computation. After the final diffusion step and once the image is completely denoised, $x^n$ is added to the memory bank of generated images and used for future image generations. + +# 3 Experiments + +In this section, we describe evaluation datasets and metrics, baselines, and setup. We then present experimental results and ablations. + +# 3.1 Datasets and metrics + +In our experiments, we report worst-region and average F1, recall, precision, and CLIPScore. We follow [18] and evaluate performance w.r.t. two geographically diverse datasets containing images of objects in multiple regions: GeoDE [35] and DollarStreet [38]. Both datasets contain images of objects in their everyday settings and are intended to be geographically representative. However, images in GeoDE were submitted by people living in the regions of interest and were collected with specific guidelines, e.g., that the object of focus fills at least $25\%$ of the image, while images in DollarStreet were collected by photographers who travelled to various regions, with a special focus on "disadvantaged and isolated areas" [38]. Thus, DollarStreet likely has more income variation than GeoDE. + +Algorithm 1 Contextualized Vendi Score Guidance (c-VSG) +Require: Class label $y$ , a single fake image $x_{f}$ , a tensor of $M$ real images $\mathbf{X}_{\mathbf{r}}$ , pretrained diffusion model $\epsilon_{\theta}$ , $N$ number of generations to obtain, $T$ number of diffusion steps, $G$ frequency, $\alpha$ , $\beta$ and $\gamma$ guidance weights +Ensure: $\mathbf{X}_{\mathbf{f}}$ a tensor with $N$ diverse model samples + $\mathbf{X}_{\mathbf{f}} \gets x_{f}$ +for $n = 1, \ldots, N - 1$ do + $x^{n} \sim \mathcal{N}(\mathbf{0}, \mathbf{I})$ +for $t = T, \ldots, 1$ do +if $t \% G$ frequency == 0 then + $\hat{x}_{0,t}^{n} = \mathrm{DDIMApprox}(x_{t}^{n})$ $\epsilon_{\theta}^{(t)} \gets \nabla_{x} \log p_{\gamma}(x_{t}|y) + \alpha \nabla_{x} \mathrm{VS}(\hat{x}_{0,t}^{n}, \mathbf{X}_{\mathbf{f}}) - \beta \nabla_{x} \mathrm{VS}(\hat{x}_{0,t}^{n}, \mathbf{X}_{\mathbf{r}})$ $\boldsymbol{x}_{t-1}^{n} \gets$ one step of DDIM +else + $\epsilon_{\theta}^{(t)} \gets \nabla_{x} \log p_{\gamma}(x_{t}|y)$ $\boldsymbol{x}_{t-1}^{n} \gets$ one step of DDIM +end if +end for + $\mathbf{X}_{\mathbf{f}} \gets \mathrm{cat}(\mathbf{X}_{\mathbf{f}}, x_{0}^{n})$ +Add final denoised sample to the memory +end for + +Furthermore, DollarStreet contains large imbalances between regions. We filter GeoDE to obtain 180 images from each region for a total of 27 objects. The remaining images are used as the pool for randomly selected exemplar real images. We subsample DollarStreet so that images contain only one concrete class, e.g., removing classes corresponding to favorite objects and images with multiple classes, and use the original distribution exclusive of the images used for contextualizing. For CLIPScore, we compute the average of the $10th$ -percentile for each object class, as prior work suggests that the lower tail of the distribution tends to be most informative in capturing generation inconsistencies [18, 20]. + +# 3.2 Baselines + +We split our discussion between baselines that do not utilize any information specific to the task in order to improve generation diversity, and those that use small amounts of information from the task. To see examples of generations for different methods, see Appendix 6.4 + +# Without any additional information: + +- LDM: This is the baseline setup where the unaltered LDM is used with the prompt {object} in {region} to condition the generation process. +- Synonyms: This strategy maps each object class to its corresponding ImageNet [11] class and WordNet [29] synset. Each synset contains lemmas representing a specific "sense" of the given class. We generate images stratified across all possible lemmas (including the original object word), for each class, i.e., {synonym} in {region} is used to condition the generation process. The list of synonyms can be found in Appendix [6.1]. + +# With additional information: + +- Paraphrasing: We use the LLaMA-2-70B-chat [48] large language model to generate paraphrases of the original prompt template, {object} in {region}. We include the specifications and descriptions used in the collection of GeoDE and DollarStreet. The metaprompts and paraphrases, as well as our method of tuning prompts and model specifications, are included in Appendix [6.1]. +- Semantic Guidance: As observed in [18] and highlighted in Fig. 3, generated images tend to contain diversity issues related to the magnification of region-specific representations of objects beyond those in the evaluation task. To reduce this amplification of region information in the generated images, we employ Semantic Guidance [6,14] by adding negative guidance corresponding to the region term for each generation. Note that this baseline requires knowing the biases embedded in the text-to-image system upfront. +- Feedback Guidance (FG): Following [22,43], during generation we use feedback from an external CLIP-based classifier to predict region labels of the generated images. We experiment with two versions of feedback guidance to encourage more diverse generations: one that maximizes the loss of the classifier and one that maximizes the entropy of predicted class distributions. +- Textual Inversion: Textual inversion injects a learned token embedding using small subset of images from the evaluation task to better represent the reference images [16]. We apply textual inversion by learning an embedding for each object in the evaluation dataset using four images per object. + +# 3.3 Experimental set-up + +We perform all experiments using an open sourced version of an LDM trained on a large scale dataset [39]. For c-VSG, we use $\alpha = 1$ and $\beta = 2$ unless otherwise specified, with two exemplar images as real world context and set $G_{\text{freq}}$ to 5. We calculate the Vendi Score in the CLIP ViT-B32 [34] feature space. For each method, we perform a hyperparameter search across guidance scales, as well as the weighting of contextual information, where applicable. We perform one-region-out hyper-parameter selection, selecting the best hyper-parameters for a given region based on the F1 for all the other regions. For computational complexity and efficiency see Appendix Sec. [6.5]. + +# 3.4 Results + +Overall results. On GeoDE (reported in Tab. 1), VSG without contextualization achieves a relative improvement in average F1 of $9.6\%$ over generations obtained with the LDM (VSG achieves F1 of 0.399 and LDM achieves F1 of 0.364), an improvement over baselines that do not leverage any additional information. Similarly, VSG yields relative improvement in worst-region F1 by $10.6\%$ . + +Table 1: Comparison to baselines on GeoDE. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with increases, or little cost to, quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). AF: Africa, WAS: West Asia, "label" refers to region label, "desc" to text description, and "img" to exemplar images. + +
MethodRef. Info.Worst-Reg.F1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
LDM✘AF0.3640.3220.4130.2730.3370.3950.2420.218
Synonyms✘AF0.3570.3060.3500.2980.3660.3150.2150.203
VSG (ours)✘AF0.3990.3560.3490.3070.4700.4240.1800.191
ParaphrasingdescWAS0.3840.3540.3380.3090.4490.4150.2310.228
Semantic GuidancelabelWAS0.4200.4010.4590.5190.3910.3260.2450.253
FG CLIP (Loss)labelWAS0.4090.3780.3870.3830.4360.3730.2280.223
FG CLIP (Ent.)labelAF0.3800.3370.3440.3290.4290.3450.2240.227
Textual InversionimgAF0.3690.3630.4090.4440.3380.3080.2340.232
c-VSG (Ours)imgAF0.4550.4440.4240.4170.4930.4760.2540.253
+ +Table 2: Comparison to baselines on DollarStreet. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with little cost to quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). c-VSG outperforms all the methods by at least $8\%$ relative F1 improvement. AF: Africa, AS: Asia, "label" refers to region label, "desc" to text description, and "img" to exemplar images. + +
MethodRef. Info.Worst- Reg.F1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
LDMXAS0.4480.4420.4280.4340.4720.4500.2310.235
SynonymsXAS0.4640.4570.4510.4480.4790.4670.2160.220
VSG (ours)XAS0.4570.4440.4130.3880.5160.5180.1910.198
ParaphrasingdescAF0.4540.4450.4450.4540.4650.4370.2260.215
Semantic GuidancelabelAS0.4700.4580.4470.4490.4980.4670.2300.233
FG CLIP (Loss)labelAS0.4370.3940.4010.3210.4880.5100.2230.206
FG CLIP (Entropy)labelAS0.4650.4620.4120.4040.5350.5400.2220.219
Textual InversionimgAS0.4250.3980.4780.4910.3860.3350.2170.219
c-VSG (Ours)imgAS0.4970.4830.4860.4860.5110.4790.2340.238
+ +Interestingly, using Synonyms tends to decrease performance, perhaps due to its enforcement of a strict, yet limited, distribution of object names. + +When considering methods that include additional information, we observe that leveraging textual descriptions of the evaluation dataset (Paraphrasing) is useful to improve average and worst-region F1. However, leveraging region information (Semantic Guidance, FG CLIP) yields better results. Notably, when the additional region information corresponds to known biases embedded in text-to-image systems, as is the case of Semantic Guidance, we observe substantial relative performance improvements of $15.4\%$ and $24.5\%$ in average and worst-region F1 over the LDM baseline. + +Leveraging exemplar images to contextualize VSG results in further performance gains. In particular, c-VSG shows a $25\%$ and $37.9\%$ relative improvement in average and worst F1 compared to the LDM baseline. Comparing c-VSG with + +![](images/6e13e9737ea50112cbda0838290071eb9c49e536db90fcb2b5b298d47ba438f8.jpg) +(a) No VSG, i.e., {object} in {region} baseline + +![](images/bda6909bd409bd0eb933905249c99df9c27699d6ff5aba38954451e9c98fdde6.jpg) + +![](images/1e69ee7957b215c5ed9cc331b4257b487646bbf8930b56d1e0f84631b528fcf2.jpg) + +![](images/3df8512c14d4b37c803a34c99c1ccefae907ae1ec986a9f08e5ebead96edf65b.jpg) + +![](images/629d701ab08baac948b253a789c056d54643782681d2de4ff9c538df517793cd.jpg) +(b) Vendi Score Guidance +(c) Contextualized Vendi Score Guidance +Fig. 2: Generated images of cooking pots (Left) and cars (Right). The same six seeds are shared among the examples, and the box colors indicate images pertaining to Africa, Europe, and Southeast Asia. Vendi Score Guidance increases the diversity of generated images, including object type, positioning, and quality. Contextualization with exemplar images increases similarity to real world diversity. (More examples are shown in Appendix Figures [7] and [8]) + +![](images/799e12255fc7f9114ab96e0b22a0c56bb2f8f7f61164eaef16cf27248de61e00.jpg) + +the closest competitor, Semantic Guidance, we observe a relative improvement of $8.3\%$ and $10.7\%$ in average and worst-region F1. + +Tab. 2 presents results on DollarStreet. In this case, uncontextualized VSG only moderately improves over the LDM baseline in average and worst-region F1. However, when including exemplar images per c-VSG, the patterns of improvement are consistent with GeoDE. c-VSG achieves $5.7\%$ and $4.5\%$ improvements over the closest baselines in average and worst-region F1, respectively. + +In the reminder of this section, we analyze the findings described above in the context of improvements to diversity, quality, and consistency. + +VSG improves diversity. The improvements in F1 relate to consistent boosting of both worst-region and average recall: for GeoDE (Tab. 1, recall), VSG + +both with and without contextualization show improvements for all baselines, and by at least $7.3\%$ (and up to $46.2\%$ ) over the LDM baseline. Similarly, VSG exhibits among the highest recall values in DollarStreet (Tab. 2, recall). FG CLIP (Ent.) achieves the highest recall values, but those come with significant drops in precision. Notably, for DollarStreet, VSG has better recall when exemplar images are not used. Again, this comes at a cost to precision. + +Diversity improvements are also reflected in qualitative examples. Fig. 2 reveals that VSG leads to greater variation in object color, type, and shape, such as more colorful cars for Africa, sports-cars for Europe, and lengthened hoods for Southeast Asia. With VSG, image backgrounds also show greater variety in textures and diversity in indoor vs. outdoor settings. In addition, VSG enables more inter-region diversity. For example, in Fig. 2 the same seed can look much more similar across regions in the baseline than with c-VSG. + +Contextualized VSG improves quality. In GeoDE, c-VSG also allows for improvement in both average and worst-region precision over the LDM baseline, the latter by up to $52.7\%$ (Tab. 1, precision). Similar precision gains are observed in DollarStreet (Tab. 2, precision): leveraging exemplar images results in relative improvements of $12\%$ in worst-region over the LDM baseline. Comparing c-VSG with VSG shows relative gains of $17.7\%$ and $25.3\%$ in average and worst-region precision, respectively. Interestingly, Semantic Guidance allows for higher precision than c-VSG on GeoDE, whose images were submitted by people living in the regions of interest. The lower precision achieved by Semantic Guidance on DollarStreet might be related to the datasets' focus on disadvantaged and isolated areas. Thus, Semantic Guidance requires an understanding of whether applying region information helps or hurts the diversity of the generations. + +Contextualized VSG improves consistency. In both GeoDE and DollarStreet, we observe that VSG without contextualization slightly reduces consistency (Tab. 1 and 2, CLIPScore). This highlights the importance of contextualization when using VSG: leveraging exemplar images in c-VSG results in the highest CLIPscores across the board, on average and for the worst-region. + +Contextualized VSG reduces disparities across regions. When comparing c-VSG to VSG, we observe that disparities across regions appear substantially reduced on both datasets. On GeoDE, contextualization reduces the performance gap between average and worst-region in F1, recall, precision, and CLIPScore. Similar trends may be observed for DollarStreet, where c-VSG exhibits remarkably lower disparities across all metrics when compared to the LDM baseline. It is worth noting that Semantic Guidance also has low disparities. + +Contextualized VSG shows early improvements in region representation. While this work does not focus particularly on mitigation of reductive regional representations, we find in initial qualitative inspections that representations of regions can change positively after applying contextualized VSG. We find that for Africa, objects like cars and cooking pots are less dilapidated with VSG, as compared to the original generations. In addition, some objects tend to be larger and more central in the image, reducing the prevalence of unrepresentative background fixtures, as shown in Appendix 6.2. The improve + +ment of consistency with contextualization similarly reduces the dominance of non-representative regional background information. Remaining images without objects tend to have less repetition in reductive backgrounds associated with regional tropes. For example, Appendix 6.2 shows that generated images of bags in Europe can have more variety in their backgrounds when using c-VSG. + +# 3.5 Ablations + +We next discuss ablations on the variations of VSG criteria and the strength, quantity, and type of exemplar images used in c-VSG. + +Variations of c-VSG Criteria. We compare the use of the full contextualized Vendi Score Guidance criterion from our approach ( $\alpha > 0$ , $\beta > 0$ , c-VSG) to Vendi Score guidance without contextualization ( $\alpha > 0$ , $\beta = 0$ , VSG), a criterion using the exemplar contextualizing images exclusively ( $\alpha = 0$ , $\beta > 0$ ), and the LDM without intervention ( $\alpha = 0$ , $\beta = 0$ ). Results are shown in Tab. 3 and visual examples in Appendix 6.2. + +When evaluating with GeoDE, we find that Vendi Score guidance without contextualization can lead to images with improved diversity but unrealistic object shapes and colors, as well as extreme variation in styles, such as black-and-white or film-style photos. While using exclusively contextualizing images helps in almost all aspects as opposed to only the Vendi Score guidance on the bank of generated images, the methods combined tend to have the best diversity. For DollarStreet, there is a slight trade-off in precision and recall between the inclusion of contextualizing images versus previously generated images in the criterion: while the combination of the two has moderately better measures over only contextualizing images, the use of only previously generated images shows the highest recall. + +Strength of exemplar images. Tab. 4 shows ablations of the strength of exemplar images used in the contextualized VSG criterion. Unsurprisingly, lower weight $\beta$ of real exemplar images yields greater recall while a higher weight leads to a larger precision, emphasizing the quality vs. diversity trade-off. For example, increasing $\beta$ can correlate with changes in camera angle of cars to more closely match those in the reference images, as shown in Appendix 6.2 In addition, consistency is improved with additional weight to exemplar images. + +Table 3: Ablation study on variations of VSG criteria. + +
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDE000.3640.3220.4130.2730.3370.3950.2420.218
GeoDEtuned00.3990.3560.3490.3070.4700.4240.1800.191
GeoDE0tuned0.4460.4270.4310.4090.4640.4470.2610.254
GeoDEtunedtuned0.4550.4440.4240.4170.4930.4760.2540.253
DollarStreet000.4480.4420.4280.4340.4720.4500.2310.235
DollarStreettuned00.4570.4440.4130.3880.5160.5180.1910.198
DollarStreet0tuned0.4920.4800.4860.4830.5000.4760.2400.242
DollarStreettunedtuned0.4970.4830.4860.4860.5110.4790.2340.238
+ +Table 4: Ablation study on exemplar images strength in contextualized VSG. + +
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDEtunedα0.4510.4340.3840.3800.5470.5060.2160.221
GeoDEtuned2α0.4550.4440.4240.4170.4930.4760.2540.253
GeoDEtuned4α0.4480.4370.4280.4350.4720.4380.2610.261
+ +Table 5: Ablation study on the number of exemplar images per object used in the contextualized Vendi Score computation, or $M$ in Algorithm 1. Results are reported based on GeoDE dataset. + +
Method#imgsF1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
c-VSG2 per obj.0.4550.4440.4240.4170.4930.4760.2540.253
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG8 per obj.0.4550.4420.4450.4360.4660.4490.2620.257
c-VSG20 per obj.0.4600.4330.4400.4340.4850.4330.2510.246
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG4 per obj.-reg.0.4540.4450.4360.4310.4750.4590.2590.253
+ +Quantity and type of exemplar images. In Tab. 5, we first study how the number of images selected as exemplar images in c-VSG affects image generation diversity. Generally, using fewer exemplar images tends to help with diversity while increasing this number helps with quality, although these trends appear minor in some cases. In Appendix 6.2, we visually inspect images and find that trends in quality and consistency for a single seed can also reverse as the number of images increases, first improving, then worsening (or vice versa). In addition, we study whether exemplar images randomly selected across all possible regions or the same number images selected specifically for a given region yields better diversity. We find that region-stratified exemplar images yield results within $1 - 2\%$ of those when using randomly selected images for all measures except for worst-region recall, for which there is a $5\%$ improvement. + +# 4 Related Work + +Prior work often focuses on mitigating general diversity issues in text-to-image models. For example, 37.50 focus on preventing mode collapse while 44 generates a balanced distribution, focusing on the long-tail, by using synthetic images. In addition, there is growing research focused on issues related to diversity through a lens of reducing person-related bias. One line of work reduces people-related biases, e.g., related to gender, through concept forgetting or erasure 23, 33, 52, rather than diversification. The idea is that, by modifying a model's understanding of a concept, the harmful or biased content is not generated. 10 augments the original prompt with real-world distributions of gender + +and ethnicity using a finetuned language model, and [25,51] learn token embeddings for a diverse set of sensitive attributes and concatenate them to the original prompt. Building on work in NLP [5], other approaches remove the components of sensitive attributes like race and gender from the text embeddings altogether [9,47] or modify the cross attention layer [17,33] to remove implicit assumptions about the world. However, there is little work investigating improvements to geographic diversity. To the best of our knowledge, prior work primarily discusses the (minimal) improvement in diversity when including more granular geographic information in text prompts [2,18]. + +Our proposed method is most relevant to works that use classifier guidance during inference time. [7,42] use classifier guidance to guide generations away from inappropriate content. In the context of augmenting a dataset with synthetic samples, [22] has extended the idea of classifier guidance to feedback guidance where loss and entropy are used as the guidance mechanism. While the Vendi Score has been used at training time to increase the diversity of generative adversarial networks (GANs) across modes in the training dataset [3], to the best of our knowledge, we are the first to apply it to diffusion models and as guidance at inference time. + +# 5 Conclusion + +In this work, we introduced an inference time intervention that extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other while still representative of the real world. Through extensive experiments, we showed that our approach produces images with higher intra- and inter-region diversity, while exhibiting increased image quality and text-image consistency; overall resulting in reduced disparities in generation diversity, quality and consistency. + +Limitations. In this work, we focus on improving worst-region F1 while also analyzing worst and average region precision, recall, and consistency. Automatic metrics are susceptible to several challenges, including region representations in the reference dataset, reliance on pre-existing feature extractors, and the composition of geographic groupings. The metrics are aggregates and do not account for individual preferences. A human evaluation study would be necessary for capturing subjective and personal perspectives about the effect of c-VSG. Finally, our approach is only a single effort at improving the diversity of text-to-image generative models, and there remains future work for their further improvement. + +Societal Impacts. This work involves representations of geographic regions. While our qualitative analyses show that c-VSG tends to help mitigate reductive representations of regions, our method may not always remove harmful representations in the underlying generative models. Furthermore, increasing the diversity of text-to-image models may yield unexpected generations. Thorough study of the full range of potential outcomes is necessary before deployment of these methods in real world systems. + +# Acknowledgments + +We would like to thank Oscar Manas and Pietro Astolfi for helpful discussion and pointers regarding in-context learning and paraphrasing approaches. We also thank Mohammad Pezeshki for useful discussions, feedback and support. In addition, we thank the participants of the qualitative study of c-VSG, discussed in Appendix 6.3. + +# References + +1. Bansal, H., Yin, D., Monajatipoor, M., Chang, K.W.: How well can text-to-image generative models understand ethical natural language interventions? In: EMNLP (Short) (2022) +2. Basu, A., Babu, R.V., Pruthi, D.: Inspecting the geographical representativeness of images from text-to-image models. arXiv preprint arXiv:2305.11080 (2023) +3. Berns, S., Colton, S., Guckelsberger, C.: Towards mode balancing of generative models via diversity weights (2023) +4. Bianchi, F., Kalluri, P., Durmus, E., Ladhak, F., Cheng, M., Nozza, D., Hashimoto, T., Jurafsky, D., Zou, J., Caliskan, A.: Easily accessible text-to-image generation amplifies demographic stereotypes at large scale (2022) +5. Bolukbasi, T., Chang, K.W., Zou, J.Y., Saligrama, V., Kalai, A.T.: Man is to computer programmer as woman is to homemaker? debiasing word embeddings. Advances in neural information processing systems 29 (2016) +6. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing text-to-image models using semantic guidance (2023) +7. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023) +8. Cho, J., Zala, A., Bansal, M.: Dall-eval: Probing the reasoning skills and social biases of text-to-image generative transformers (2022) +9. Chuang, C.Y., Jampani, V., Li, Y., Torralba, A., Jegelka, S.: Debiasing vision-language models via biased prompts. arXiv preprint arXiv:2302.00070 (2023) +0. Clemmer, C., Ding, J., Feng, Y.: Precisedebias: An automatic prompt engineering approach for generative ai to mitigate image demographic biases. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 8596-8605 (2024) +1. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009). https://doi.org/10.1109/CVPR.2009.5206848 +2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021) +3. Friedman, D., Dieng, A.B.: The vendi score: A diversity evaluation metric for machine learning. arXiv preprint arXiv:2210.02410 (2022) +4. Friedrich, F., Schramowski, P., Brack, M., Struppek, L., Hintersdorf, D., Luccioni, S., Kersting, K.: Fair diffusion: Instructing text-to-image generation models on fairness (2023) +5. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Makea-scene: Scene-based text-to-image generation with human priors. In: Computer Vision-ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23-27, 2022, Proceedings, Part XV. pp. 89-106. Springer (2022) +6. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022) +7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023) +8. Hall, M., Ross, C., Williams, A., Carion, N., Drozdzal, M., Soriano, A.R.: Dig in: Evaluating disparities in image generations with indicators for geographic diversity (2023) + +19. Hao, S., Shelby, R., Liu, Y., Srinivasan, H., Bhutani, M., Ayan, B.K., Poddar, S., Laszlo, S.: Harm amplification in text-to-image models (2024) +20. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? arXiv preprint arXiv:2210.07574 (2022) +21. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? (2023), https://arxiv.org/abs/2210.07574 +22. Hemmat, R.A., Pezeshki, M., Bordes, F., Drozdjal, M., Romero-Soriano, A.: Feedback-guided data synthesis for imbalanced classification (2023) +23. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. Advances in Neural Information Processing Systems 36 (2024) +24. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021) +25. Kim, E., Kim, S., Shin, C., Yoon, S.: De-stereotyping text-to-image models through prompt tuning (2023) +26. Kynkänniemi, T., Karras, T., Laine, S., Lehtinen, J., Aila, T.: Improved precision and recall metric for assessing generative models (2019) +27. Luccioni, A.S., Akiki, C., Mitchell, M., Jernite, Y.: Stable bias: Analyzing societal representations in diffusion models (2023) +28. Manas, O., Astolfi, P., Hall, M., Ross, C., Urbanek, J., Williams, A., Agrawal, A., Romero-Soriano, A., Drozdzal, M.: Improving text-to-image consistency via automatic prompt optimization (2024) +29. Miller, G.A.: WordNet: A lexical database for English. In: Human Language Technology: Proceedings of a Workshop held at Plainsboro, New Jersey, March 8-11, 1994 (1994), https://aclanthology.org/H94-1111 +30. Naeem, M.F., Oh, S.J., Uh, Y., Choi, Y., Yoo, J.: Reliable fidelity and diversity metrics for generative models. In: International Conference on Machine Learning. pp. 7176-7185. PMLR (2020) +31. Naik, R., Nushi, B.: Social biases through the text-to-image generation lens (2023) +32. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: GLIDE: towards photorealistic image generation and editing with text-guided diffusion models. CoRR abs/2112.10741 (2021), https://arxiv.org/abs/2112.10741 +33. Orgad, H., Kawar, B., Belinkov, Y.: Editing implicit assumptions in text-to-image diffusion models. arXiv preprint arXiv:2303.08084 (2023) +34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021) +35. Ramaswamy, V.V., Lin, S.Y., Zhao, D., Adcock, A.B., van der Maaten, L., Ghadiyaram, D., Russakovsky, O.: Beyond web-scraping: Crowd-sourcing a geodiverse dataset. In: arXiv preprint (2023) +36. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents (2022) +37. Rangwani, H., Jaswani, N., Karmali, T., Jampani, V., Babu, R.V.: Improving gans for long-tailed data through group spectral regularization. In: European Conference on Computer Vision. pp. 426-442. Springer (2022) + +38. Rojas, W.A.G., Diamos, S., Kini, K.R., Kanter, D., Reddi, V.J., Coleman, C.: The dollar street dataset: Images representing the geographic and socioeconomic diversity of the world. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022) +39. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. CoRR abs/2112.10752 (2021), https://arxiv.org/abs/2112.10752 +40. Sajjadi, M.S.M., Bachem, O., Lučić, M., Bousquet, O., Gelly, S.: Assessing Generative Models via Precision and Recall. In: Advances in Neural Information Processing Systems (NeurIPS) (2018) +41. Salimans, T., Ho, J.: Progressive distillation for fast sampling of diffusion models. arXiv preprint arXiv:2202.00512 (2022) +42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22522-22531 (2023) +43. Sehwag, V., Hazirbas, C., Gordo, A., Ozgenel, F., Ferrer, C.C.: Generating high fidelity data from low-density regions using diffusion models (2022) +44. Shin, J., Kang, M., Park, J.: Fill-up: Balancing long-tailed data with generative models. arXiv preprint arXiv:2306.07200 (2023) +45. Song, J., Meng, C., Ermon, S.: Denoising Diffusion Implicit Models. In: Proceedings of the International Conference on Learning Representations (ICLR) (2020) +46. Song, Y., Dhariwal, P., Chen, M., Sutskever, I.: Consistency models (2023) +47. Tanjim, M.M., Singh, K.K., Kafle, K., Sinha, R., Cottrell, G.W.: Discovering and mitigating biases in clip-based image editing. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2984-2993 (2024) +48. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023) +49. Wan, Y., Chang, K.W.: The male ceo and the female assistant: Probing gender biases in text-to-image models through paired stereotype test (2024) +50. Yu, N., Li, K., Zhou, P., Malik, J., Davis, L., Fritz, M.: Inclusive gan: Improving data and minority coverage in generative models. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 377-393. Springer (2020) +51. Zhang, C., Chen, X., Chai, S., Wu, C.H., Lagun, D., Beeler, T., De la Torre, F.: Iti-gen: Inclusive text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3969-3980 (2023) +52. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2303.17591 (2023) \ No newline at end of file diff --git a/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/images.zip b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..59793920ca3ba05a86644def6903804567a2301e --- /dev/null +++ b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:be2c254fd35a7b7f252dab44786f3b423f53d39845093e26b6e923cb6c2abb05 +size 585772 diff --git a/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/layout.json b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..90dd36ba6237b2342d5c6c8da28d935a885527d6 --- /dev/null +++ b/2024/Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance/layout.json @@ -0,0 +1,9817 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 147, + 112, + 467, + 146 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 112, + 467, + 146 + ], + "spans": [ + { + "bbox": [ + 147, + 112, + 467, + 146 + ], + "type": "text", + "content": "Improving Geo-diversity of Generated Images with Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "spans": [ + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "text", + "content": "Reyhane Askari Hemmat" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "text", + "content": ", Melissa Hall" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "text", + "content": ", Alicia Sun" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "text", + "content": ", Candace Ross" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "text", + "content": ", Michal Drozdzal" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "text", + "content": ", and Adriana Romero-Soriano" + }, + { + "bbox": [ + 143, + 167, + 470, + 194 + ], + "type": "inline_equation", + "content": "^{1,2,3,4}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 157, + 201, + 455, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 157, + 201, + 455, + 213 + ], + "spans": [ + { + "bbox": [ + 157, + 201, + 455, + 213 + ], + "type": "text", + "content": "1 FAIR at Meta, 2 Mila, 3 McGill University, 4 Canada CIFAR AI Chair" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 159, + 239, + 455, + 470 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 239, + 455, + 470 + ], + "spans": [ + { + "bbox": [ + 159, + 239, + 455, + 470 + ], + "type": "text", + "content": "Abstract. With the growing popularity of text-to-image generative models, there has been increasing focus on understanding their risks and biases. Recent work has found that state-of-the-art models struggle to depict everyday objects with the true diversity of the real world and have notable gaps between geographic regions. In this work, we aim to increase the diversity of generated images of common objects such that per-region variations are representative of the real world. We introduce an inference-time intervention, contextualized Vendi Score Guidance (c-VSG), that guides the backwards steps of latent diffusion models to increase the diversity of a sample as compared to a \"memory bank\" of previously generated images while constraining the amount of variation within that of an exemplar set of real-world contextualizing images. We evaluate c-VSG with two geographically representative datasets and find that it substantially increases the diversity of generated images, both for the worst-performing regions and on average, while simultaneously maintaining or improving image quality and consistency. Additionally, qualitative analyses reveal that diversity of generated images is significantly improved, including along the lines of reductive region portrayals present in the original model. We hope that this work is a step towards text-to-image generative models that reflect the true geographic diversity of the world." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 480, + 420, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 480, + 420, + 492 + ], + "spans": [ + { + "bbox": [ + 160, + 480, + 420, + 492 + ], + "type": "text", + "content": "Keywords: geo-diversity " + }, + { + "bbox": [ + 160, + 480, + 420, + 492 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 480, + 420, + 492 + ], + "type": "text", + "content": " image generation " + }, + { + "bbox": [ + 160, + 480, + 420, + 492 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 480, + 420, + 492 + ], + "type": "text", + "content": " diffusion models" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 528, + 230, + 540 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 528, + 230, + 540 + ], + "spans": [ + { + "bbox": [ + 132, + 528, + 230, + 540 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 552, + 482, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 552, + 482, + 638 + ], + "spans": [ + { + "bbox": [ + 130, + 552, + 482, + 638 + ], + "type": "text", + "content": "The unprecedented results achieved by text-to-image systems [15,32,36,39] and their wide-spread use as plug-and-play solutions have propelled a body of research to understand their potential risks and biases [18,27]. Recent works have highlighted through qualitative and quantitative evaluations the disparities in demographic traits of people represented in the generated images [19,31,49], triggering the design of mitigation strategies based on textual interventions [16], attention-weight modification [17], and semantic guidance [14]." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 134, + 643, + 226, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 643, + 226, + 653 + ], + "spans": [ + { + "bbox": [ + 134, + 643, + 226, + 653 + ], + "type": "text", + "content": "* Equal Contribution." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 135, + 653, + 482, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 653, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 135, + 653, + 482, + 666 + ], + "type": "text", + "content": "1 https://github.com/facebookresearch/Contextualized-Vendi-Score-Guidance" + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 126, + 304, + 237 + ], + "blocks": [ + { + "bbox": [ + 149, + 126, + 304, + 237 + ], + "lines": [ + { + "bbox": [ + 149, + 126, + 304, + 237 + ], + "spans": [ + { + "bbox": [ + 149, + 126, + 304, + 237 + ], + "type": "image", + "image_path": "307d3d9394a24da6021903b8f71570aa552d3141691ef2276cd35c8975880b3b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 222, + 240, + 233, + 250 + ], + "lines": [ + { + "bbox": [ + 222, + 240, + 233, + 250 + ], + "spans": [ + { + "bbox": [ + 222, + 240, + 233, + 250 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 309, + 125, + 462, + 237 + ], + "blocks": [ + { + "bbox": [ + 309, + 125, + 462, + 237 + ], + "lines": [ + { + "bbox": [ + 309, + 125, + 462, + 237 + ], + "spans": [ + { + "bbox": [ + 309, + 125, + 462, + 237 + ], + "type": "image", + "image_path": "26ae13afff23f9b14c03a368b77c86fb4aa3e08f9fb4ee553946a294e0c4e404.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 380, + 240, + 392, + 250 + ], + "lines": [ + { + "bbox": [ + 380, + 240, + 392, + 250 + ], + "spans": [ + { + "bbox": [ + 380, + 240, + 392, + 250 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "lines": [ + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "type": "text", + "content": "Fig.1: (a) We present Contextualized Vendi Score Guidance (c-VSG), an inference-time intervention to increase the diversity of images generated by latent diffusion models (LDMs). c-VSG guides backwards steps of the diffusion process using the Vendi Score [13] to increase the diversity among a sample " + }, + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "type": "inline_equation", + "content": "x_{t}" + }, + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "type": "text", + "content": " and a memory bank of previous generations (with weight " + }, + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "type": "text", + "content": ") while constraining excessive variation using a small set of real, contextualizing exemplar images (with weight " + }, + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 258, + 482, + 360 + ], + "type": "text", + "content": "). (b) Generations of dog in Africa, all with the same seed. First row has zero c-VSG guidance scale and as a result all samples are the same. As we increase the c-VSG guidance scale, we observe increased diversity in generations." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 386, + 482, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 386, + 482, + 518 + ], + "spans": [ + { + "bbox": [ + 130, + 386, + 482, + 518 + ], + "type": "text", + "content": "Beyond human-centric representations, research has shown that stereotypical biases also occur for representations of objects and their surroundings across the globe [2,4,18]. In particular, previous studies highlighted that progress in image quality or realism has come at the expense of representation diversity and text-image consistency [18]. This trade-off affects some regions more than others, hindering the progress towards conditional image generative systems that truly work well for all geographic regions. Notably, images generated with text prompts that include regional information contain limited object diversity and heightened geographic stereotypes. As shown in [18], many generations depict limited diversity in object type. Yet, to the best of our knowledge, no mitigation strategies have directly targeted geo-diversity in text-to-image systems." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 520, + 483, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 520, + 483, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 520, + 483, + 592 + ], + "type": "text", + "content": "In this paper, we aim to mitigate disparities in representation diversity of common objects across worldwide regions. More precisely, our goal is to increase the objects' representation diversity such that per-region variation in type of object, as observed in the real world, is better reflected in the generations. In doing so, we aim to maintain (or improve) the quality of images as well as their text-image consistency." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "We devise a novel approach called Vendi Score Guidance (VSG) that increases the representation diversity of the generations by leveraging the Vendi Score (VS) [13] - a dataset diversity evaluation metric. In particular, VSG extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other, intuitively maximizing the effective number of samples among the obtained generations. This" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 503, + 483, + 509, + 491 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 503, + 483, + 509, + 491 + ], + "spans": [ + { + "bbox": [ + 503, + 483, + 509, + 491 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 542, + 497, + 547, + 503 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 542, + 497, + 547, + 503 + ], + "spans": [ + { + "bbox": [ + 542, + 497, + 547, + 503 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 274 + ], + "type": "text", + "content": "requires the proposed guidance strategy to operate auto-regressively w.r.t. the previous generations. We implement this by keeping a memory bank of past generations that ensures that the current sample differs from those in the memory.do Yet, increasing diversity in an unconstrained way results in generations that lack either image realism or text-generation consistency. Therefore, we propose to contextualize VSG by providing a small set of randomly selected real images of objects, referred to as exemplar images, and guiding the generation process towards diverse samples that are grounded on those exemplar images. We evaluate the proposed approach by measuring precision [26,40], recall [26,40], and CLIPScore [24] to assess image realism/quality, representation diversity, and text-image consistency, respectively. We report results on two geographically diverse datasets that contain images of the common objects collected around the world, GeoDE [35] and DollarStreet [38]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "text", + "content": "Our results show that contextualized Vendi Score Guidance improves worst-region and average F1 for both datasets, including a relative improvement of " + }, + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "inline_equation", + "content": "40\\%" + }, + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "text", + "content": " in worst-region F1 over the Latent Diffusion Model (LDM) baseline without any intervention when measured on GeoDE and " + }, + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "inline_equation", + "content": "11\\%" + }, + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "text", + "content": " over the next closest baseline, and reduces performance disparities across regions. Even without contextualization, VSG shows relative improvements of up to " + }, + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 286, + 482, + 453 + ], + "type": "text", + "content": " over the LDM baseline in F1. Upon visual inspection we find the object diversity in images to be significantly improved, with greater variation in object color, type, shape, and size. In addition, VSG improvements often coincide with improved regional representations beyond reductive portrayals present in the original model. Finally, we find in ablations that our combined use of the Vendi Score to encourage image diversity relative to previous generations while constraining variation to that of the real world with contextualizing exemplar images meaningfully navigates the diversity vs. quality tradeoff." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 468, + 418, + 480 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 468, + 418, + 480 + ], + "spans": [ + { + "bbox": [ + 146, + 468, + 418, + 480 + ], + "type": "text", + "content": "The contributions of this work can be summarized as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 495, + 480, + 625 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 138, + 495, + 479, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 495, + 479, + 530 + ], + "spans": [ + { + "bbox": [ + 138, + 495, + 479, + 530 + ], + "type": "text", + "content": "- We introduce a new inference-time intervention, contextualized Vendi Score Guidance (c-VSG), to increase the diversity of images generated by LDMs using a memory bank of previously generated images and exemplar images." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 532, + 480, + 566 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 532, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 138, + 532, + 480, + 566 + ], + "type": "text", + "content": "- When evaluated with two geographically representative real world datasets, c-VSG shows significant improvement in diversity and quality over the vanilla LDM, while maintaining text-image consistency." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 567, + 479, + 602 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 479, + 602 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 479, + 602 + ], + "type": "text", + "content": "- c-VSG shows improvements in average and worst-region F1 over state-of-the-art baselines, while exhibiting reduced disparities in quality, diversity and text-generation consistency across regions." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 603, + 479, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 603, + 479, + 625 + ], + "spans": [ + { + "bbox": [ + 138, + 603, + 479, + 625 + ], + "type": "text", + "content": "- Our ablations demonstrate the efficacy of the memory and contextualizing components of the c-VSG criterion." + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "We hope this work contributes to image generations that better reflect the geographic diversity of the real world." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 202, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 202, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 202, + 127 + ], + "type": "text", + "content": "2 Method" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 140, + 482, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 140, + 482, + 188 + ], + "spans": [ + { + "bbox": [ + 131, + 140, + 482, + 188 + ], + "type": "text", + "content": "In this work, we focus on increasing the diversity of latent diffusion models (LDMs). We first provide preliminary details about the components of the LDM generation process in which we apply our interventions, as well as the Vendi Score metric. Then, we introduce our proposed methodology, Vendi Score Guidance." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 205, + 228, + 216 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 228, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 228, + 216 + ], + "type": "text", + "content": "2.1 Preliminaries" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 224, + 482, + 261 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 224, + 482, + 261 + ], + "spans": [ + { + "bbox": [ + 131, + 224, + 482, + 261 + ], + "type": "text", + "content": "Sampling in LDMs. In this work, we focus on a class of LDMs called denoising diffusion implicit models (DDIMs) [45]. At inference or generation time, DDIMs use a reverse process defined as:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 179, + 269, + 481, + 305 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 179, + 269, + 481, + 305 + ], + "spans": [ + { + "bbox": [ + 179, + 269, + 481, + 305 + ], + "type": "interline_equation", + "content": "x _ {t - 1} = \\sqrt {\\xi_ {t - 1}} \\hat {x} _ {0, t} + \\underbrace {\\sqrt {1 - \\xi_ {t - 1} - \\sigma_ {t} ^ {2}} \\cdot \\epsilon_ {\\theta} ^ {(t)} (x _ {t})} _ {\\text {d i r e c t i o n p o i n t i n g t o} x _ {t}} + \\underbrace {\\sigma_ {t} \\epsilon_ {t}} _ {\\text {r a n d o m n o i s e}}, \\tag {1}", + "image_path": "39299c1d81a68267c2e06e6e16beea765c879589506a569b91e240deaed98f47.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "spans": [ + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "inline_equation", + "content": "x_{t}" + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": " is the sample at time step " + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\epsilon_t \\sim \\mathcal{N}(\\mathbf{0},\\mathbf{I})" + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\xi_{t}" + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\sigma_{t}" + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": " are time-dependent coefficients, and " + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\hat{x}_{0,t}" + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": " is the DDIM approximation of the denoised sample given current " + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "inline_equation", + "content": "x_{t}" + }, + { + "bbox": [ + 131, + 313, + 482, + 350 + ], + "type": "text", + "content": "," + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 200, + 357, + 481, + 387 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 357, + 481, + 387 + ], + "spans": [ + { + "bbox": [ + 200, + 357, + 481, + 387 + ], + "type": "interline_equation", + "content": "\\hat {x} _ {0, t} = \\operatorname {D D I M A p p r o x} \\left(x _ {t}\\right) := \\frac {x _ {t} - \\sqrt {1 - \\xi_ {t}} \\epsilon_ {\\theta} ^ {(t)} \\left(x _ {t}\\right)}{\\sqrt {\\xi_ {t}}}, \\tag {2}", + "image_path": "ad918b27e3cb8f1f0db16b40d9e55cf2ce0d21c82bd3fed2fd0f7b711e34498a.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "spans": [ + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "text", + "content": "and " + }, + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}^{(t)}" + }, + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "text", + "content": " is the pretrained denoising network parameterized by " + }, + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "text", + "content": " that approximates the score function conditioned on a class or prompt " + }, + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 131, + 396, + 481, + 421 + ], + "type": "text", + "content": "," + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 261, + 429, + 481, + 445 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 261, + 429, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 261, + 429, + 481, + 445 + ], + "type": "interline_equation", + "content": "\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p (x _ {t} | y). \\qquad \\qquad (3)", + "image_path": "a772e705c4be8b86c6f3952749c225f5a5a1d9c65579e7f37cd75f60c84632a9.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 453, + 481, + 476 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 453, + 481, + 476 + ], + "spans": [ + { + "bbox": [ + 131, + 453, + 481, + 476 + ], + "type": "text", + "content": "In this work, we modify this score function to guide the sampling process towards generating more diverse samples." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 477, + 482, + 550 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 477, + 482, + 550 + ], + "spans": [ + { + "bbox": [ + 131, + 477, + 482, + 550 + ], + "type": "text", + "content": "Guidance in LDMs. LDMs often condition generated samples on labels or text prompts in the score function. If one has access to a pretrained denoising network that only approximates the unconditional score function " + }, + { + "bbox": [ + 131, + 477, + 482, + 550 + ], + "type": "inline_equation", + "content": "(\\nabla_{x}\\log p(x))" + }, + { + "bbox": [ + 131, + 477, + 482, + 550 + ], + "type": "text", + "content": ", one can use classifier-guidance [12] to generate a conditional sample. Classifier-guidance modifies the score function using a pretrained classifier that provides " + }, + { + "bbox": [ + 131, + 477, + 482, + 550 + ], + "type": "inline_equation", + "content": "\\log p(y|x_t)" + }, + { + "bbox": [ + 131, + 477, + 482, + 550 + ], + "type": "text", + "content": "," + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 188, + 558, + 481, + 574 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 188, + 558, + 481, + 574 + ], + "spans": [ + { + "bbox": [ + 188, + 558, + 481, + 574 + ], + "type": "interline_equation", + "content": "\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p _ {\\gamma} (x _ {t} | y) = \\nabla_ {x} \\log p (x _ {t}) + \\gamma \\nabla_ {x} \\log p (y | x _ {t}), \\qquad (4)", + "image_path": "1da09879d9d173c50f5e58021a80a6ba858d605a24419b93f79b0c169410d6ce.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 582, + 481, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 582, + 481, + 617 + ], + "spans": [ + { + "bbox": [ + 131, + 582, + 481, + 617 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 582, + 481, + 617 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 131, + 582, + 481, + 617 + ], + "type": "text", + "content": " is a scaling factor controlling the strength of class-conditional generation. In this work, we adapt this concept of guidance by utilizing the Vendi Score [13], rather than a classifier, as our guidance function." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 617, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 617, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 131, + 617, + 482, + 667 + ], + "type": "text", + "content": "Vendi Score (VS). The VS is a metric for evaluating diversity in machine learning [13]. It applies a user-defined similarity function to a set of samples, without the need for a reference dataset as opposed to metrics such as recall or coverage [26,30,40]. VS measures the effective number of examples by computing" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 163 + ], + "type": "text", + "content": "the soft-rank of a similarity or kernel matrix. The similarity matrix is calculated using a similarity function that takes two samples and returns a positive value indicating how similar they are. Higher rank of the similarity matrix corresponds to higher Vendi Score and diversity." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": "Formally, given a set of samples " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "x_{1},\\ldots ,x_{n}" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": ", we can define a positive semi-definite similarity function " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "k(x,x) = 1" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": " for all " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": ". The similarity function is applied on every pair of samples in our dataset to create a similarity matrix, " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "\\mathcal{K}" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "\\mathcal{K}_{i,j} = k(x_i,x_j)" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": ". VS is then defined as the soft-rank of " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "\\mathcal{K} / n" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": ", i.e., the exponential of the entropy of the eigenvalues of " + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "inline_equation", + "content": "\\mathcal{K} / n" + }, + { + "bbox": [ + 130, + 165, + 480, + 226 + ], + "type": "text", + "content": " [13]:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 219, + 237, + 481, + 270 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 237, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 219, + 237, + 481, + 270 + ], + "type": "interline_equation", + "content": "\\operatorname {V S} \\left(x _ {1}, \\dots , x _ {n}\\right) = \\exp \\left(- \\sum_ {i = 1} ^ {n} \\lambda_ {i} \\log \\lambda_ {i}\\right), \\tag {5}", + "image_path": "f3dd38bd722504e90beb14b64ec236a73df138b4c251050a237fc594e77c51b8.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 277, + 329, + 289 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 277, + 329, + 289 + ], + "spans": [ + { + "bbox": [ + 131, + 277, + 329, + 289 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 277, + 329, + 289 + ], + "type": "inline_equation", + "content": "\\lambda_1, \\ldots, \\lambda_n" + }, + { + "bbox": [ + 131, + 277, + 329, + 289 + ], + "type": "text", + "content": " are the eigenvalues of " + }, + { + "bbox": [ + 131, + 277, + 329, + 289 + ], + "type": "inline_equation", + "content": "\\mathcal{K} / n" + }, + { + "bbox": [ + 131, + 277, + 329, + 289 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 290, + 479, + 314 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 290, + 479, + 314 + ], + "spans": [ + { + "bbox": [ + 130, + 290, + 479, + 314 + ], + "type": "text", + "content": "A common choice for the similarity function is the cosine-similarity of every pair of samples in the dataset in a pre-defined feature space." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 337, + 272, + 348 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 337, + 272, + 348 + ], + "spans": [ + { + "bbox": [ + 131, + 337, + 272, + 348 + ], + "type": "text", + "content": "2.2 Vendi Score Guidance" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 361, + 480, + 433 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 361, + 480, + 433 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 480, + 433 + ], + "type": "text", + "content": "In this section, we introduce our proposed approach, called Vendi Score Guidance (VSG). Our goal is to increase the diversity of the generated samples by incorporating the Vendi Score as an auto-regressive guidance mechanism during diffusion model inference. In other words, every new generation will take into consideration all previously generated samples and will aim to generate a sample which is substantially different from the previous ones." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "text", + "content": "Let us define a memory bank which contains all the previously generated samples as " + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "inline_equation", + "content": "\\mathbf{X}_{\\mathbf{f}}: \\{x^{1}, \\ldots, x^{n}\\}" + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "text", + "content": ". Given the " + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "inline_equation", + "content": "\\mathbf{X}_{\\mathbf{f}}" + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "text", + "content": ", and a newly generated sample " + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "text", + "content": ", we can compute " + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "inline_equation", + "content": "\\mathrm{VS}(x, \\mathbf{X}_{\\mathbf{f}})" + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "text", + "content": ". Our goal is to modify the generation process of " + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 434, + 480, + 494 + ], + "type": "text", + "content": " by steering it towards part of the manifold that increases VS, and thus, augment the sample diversity. We can achieve this via the following score function," + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 165, + 506, + 480, + 521 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 506, + 480, + 521 + ], + "spans": [ + { + "bbox": [ + 165, + 506, + 480, + 521 + ], + "type": "interline_equation", + "content": "\\epsilon_ {\\theta} ^ {(t)} \\approx \\nabla_ {x} \\log p _ {\\gamma , \\alpha} \\left(x _ {t} | y, \\mathbf {X} _ {\\mathbf {f}}\\right) = \\nabla_ {x} \\log p _ {\\gamma} \\left(x _ {t} | y\\right) + \\alpha \\nabla_ {x} \\operatorname {V S} \\left(\\hat {x} _ {0, t}, \\mathbf {X} _ {\\mathbf {f}}\\right), \\tag {6}", + "image_path": "fc82a0ccd9e49883361b26c535487a936f1a4585b01ce733c581dc2dcffd2351.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 532, + 479, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 532, + 479, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 532, + 479, + 555 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 532, + 479, + 555 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 532, + 479, + 555 + ], + "type": "text", + "content": " is a scaling factor that controls the strength of the Vendi Score guidance and " + }, + { + "bbox": [ + 130, + 532, + 479, + 555 + ], + "type": "inline_equation", + "content": "\\hat{x}_{0,t}" + }, + { + "bbox": [ + 130, + 532, + 479, + 555 + ], + "type": "text", + "content": " is the predicted denoised sample." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 556, + 480, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 556, + 480, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 556, + 480, + 604 + ], + "type": "text", + "content": "A naive way of finding " + }, + { + "bbox": [ + 130, + 556, + 480, + 604 + ], + "type": "inline_equation", + "content": "\\hat{x}_{0,t}" + }, + { + "bbox": [ + 130, + 556, + 480, + 604 + ], + "type": "text", + "content": " is to apply all the " + }, + { + "bbox": [ + 130, + 556, + 480, + 604 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 556, + 480, + 604 + ], + "type": "text", + "content": " steps of the backward diffusion process and use the denoised image to compute the Vendi Score. However, this is computationally expensive. Thus, we use the efficient DDIM approximation of a denoised sample, given in Eq. 2." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "content": "We note that the original Vendi Score formulation in Eq. 5 is not differentiable, since it requires finding the singular values of the similarity matrix, and singular value decomposition is not differentiable. To overcome this limitation, we developed a simple algorithm to compute the Vendi Score in a differentiable way and present it in Appendix 6.2." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 448, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 448, + 101 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 448, + 101 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance (c-VSG). In experimentation, we found that unconstrained VSG can have limited efficacy, as generated images may drift from real world representations. Thus, in the second part of our method, we use Vendi Score a second time with a small set of randomly selected exemplar images, " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\mathbf{X}_{\\mathbf{r}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". This set of exemplar images is used to contextualize the Vendi Score computation and thus, the generation process. Similar to Eq. 6, we compute " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\mathrm{VS}(x,\\mathbf{X_r})" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": ". However, because we want to reduce excessive drift from the exemplar representation of images, we calculate the gradients with respect to the negative of this score. Overall, we use the following score function which combines VSG with contextualized samples:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 164, + 246, + 481, + 259 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 246, + 481, + 259 + ], + "spans": [ + { + "bbox": [ + 164, + 246, + 481, + 259 + ], + "type": "interline_equation", + "content": "\\nabla_ {x} \\log p (x _ {t} | y, \\mathbf {X _ {f}}, \\mathbf {X _ {r}}) = \\nabla_ {x} \\log p _ {\\gamma , \\alpha} (x _ {t} | y, \\mathbf {X _ {f}}) - \\beta \\nabla_ {x} \\mathrm {V S} (\\hat {x} _ {0, t}, \\mathbf {X _ {r}}), \\qquad (7)", + "image_path": "5289898f15313b1c95e12676596ef68979299228c0352cb6607aa8e60ace7f46.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 268, + 482, + 340 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 268, + 482, + 340 + ], + "spans": [ + { + "bbox": [ + 130, + 268, + 482, + 340 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 268, + 482, + 340 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 268, + 482, + 340 + ], + "type": "text", + "content": " is a scaling factor that controls the strength of VSG contextualization. This formulation allows the model to generate samples that remain close to the exemplar images without the need for additional training. Intuitively, the modified score function (Eq. 7) steers the generation process towards parts of the space which would result in a sample that increases the rank of the memory bank while staying close to the exemplar images." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "text", + "content": "Algorithm " + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathbb{I}" + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "text", + "content": " presents the c-VSG computation step by step. Note that we use " + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "inline_equation", + "content": "G_{\\text{freq}}" + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "text", + "content": " to control the rate at which c-VSG is applied in the diffusion process, allowing for a balance between efficiency and diversity. To generate image " + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "inline_equation", + "content": "x^n" + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "text", + "content": ", we apply the proposed guidance in the backward diffusion process. In the intermediate steps and when the sample is not yet generated, we use DDIM's approximation of " + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\hat{x}_0" + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "text", + "content": " and feed it to the VS computation. After the final diffusion step and once the image is completely denoised, " + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "inline_equation", + "content": "x^n" + }, + { + "bbox": [ + 130, + 341, + 482, + 437 + ], + "type": "text", + "content": " is added to the memory bank of generated images and used for future image generations." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 456, + 230, + 470 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 230, + 470 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 230, + 470 + ], + "type": "text", + "content": "3 Experiments" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 482, + 481, + 507 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 482, + 481, + 507 + ], + "spans": [ + { + "bbox": [ + 130, + 482, + 481, + 507 + ], + "type": "text", + "content": "In this section, we describe evaluation datasets and metrics, baselines, and setup. We then present experimental results and ablations." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 525, + 268, + 536 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 268, + 536 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 268, + 536 + ], + "type": "text", + "content": "3.1 Datasets and metrics" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 546, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 667 + ], + "type": "text", + "content": "In our experiments, we report worst-region and average F1, recall, precision, and CLIPScore. We follow [18] and evaluate performance w.r.t. two geographically diverse datasets containing images of objects in multiple regions: GeoDE [35] and DollarStreet [38]. Both datasets contain images of objects in their everyday settings and are intended to be geographically representative. However, images in GeoDE were submitted by people living in the regions of interest and were collected with specific guidelines, e.g., that the object of focus fills at least " + }, + { + "bbox": [ + 130, + 546, + 482, + 667 + ], + "type": "inline_equation", + "content": "25\\%" + }, + { + "bbox": [ + 130, + 546, + 482, + 667 + ], + "type": "text", + "content": " of the image, while images in DollarStreet were collected by photographers who travelled to various regions, with a special focus on \"disadvantaged and isolated areas\" [38]. Thus, DollarStreet likely has more income variation than GeoDE." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 304, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 304, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 304, + 102 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 132, + 131, + 481, + 343 + ], + "blocks": [ + { + "bbox": [ + 133, + 116, + 403, + 129 + ], + "lines": [ + { + "bbox": [ + 133, + 116, + 403, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 403, + 129 + ], + "type": "text", + "content": "Algorithm 1 Contextualized Vendi Score Guidance (c-VSG)" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "lines": [ + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "spans": [ + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": "Require: Class label " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": ", a single fake image " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "x_{f}" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": ", a tensor of " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " real images " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\mathbf{X}_{\\mathbf{r}}" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": ", pretrained diffusion model " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " number of generations to obtain, " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " number of diffusion steps, " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "G" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " frequency, " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " guidance weights \nEnsure: " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\mathbf{X}_{\\mathbf{f}}" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " a tensor with " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " diverse model samples \n" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\mathbf{X}_{\\mathbf{f}} \\gets x_{f}" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " \nfor " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "n = 1, \\ldots, N - 1" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " do \n" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "x^{n} \\sim \\mathcal{N}(\\mathbf{0}, \\mathbf{I})" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " \nfor " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "t = T, \\ldots, 1" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " do \nif " + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "t \\% G" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " frequency == 0 then \n" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\hat{x}_{0,t}^{n} = \\mathrm{DDIMApprox}(x_{t}^{n})" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}^{(t)} \\gets \\nabla_{x} \\log p_{\\gamma}(x_{t}|y) + \\alpha \\nabla_{x} \\mathrm{VS}(\\hat{x}_{0,t}^{n}, \\mathbf{X}_{\\mathbf{f}}) - \\beta \\nabla_{x} \\mathrm{VS}(\\hat{x}_{0,t}^{n}, \\mathbf{X}_{\\mathbf{r}})" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\boldsymbol{x}_{t-1}^{n} \\gets" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " one step of DDIM \nelse \n" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}^{(t)} \\gets \\nabla_{x} \\log p_{\\gamma}(x_{t}|y)" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\boldsymbol{x}_{t-1}^{n} \\gets" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " one step of DDIM \nend if \nend for \n" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "inline_equation", + "content": "\\mathbf{X}_{\\mathbf{f}} \\gets \\mathrm{cat}(\\mathbf{X}_{\\mathbf{f}}, x_{0}^{n})" + }, + { + "bbox": [ + 132, + 131, + 481, + 343 + ], + "type": "text", + "content": " \nAdd final denoised sample to the memory \nend for" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 130, + 366, + 482, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 482, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 482, + 477 + ], + "type": "text", + "content": "Furthermore, DollarStreet contains large imbalances between regions. We filter GeoDE to obtain 180 images from each region for a total of 27 objects. The remaining images are used as the pool for randomly selected exemplar real images. We subsample DollarStreet so that images contain only one concrete class, e.g., removing classes corresponding to favorite objects and images with multiple classes, and use the original distribution exclusive of the images used for contextualizing. For CLIPScore, we compute the average of the " + }, + { + "bbox": [ + 130, + 366, + 482, + 477 + ], + "type": "inline_equation", + "content": "10th" + }, + { + "bbox": [ + 130, + 366, + 482, + 477 + ], + "type": "text", + "content": "-percentile for each object class, as prior work suggests that the lower tail of the distribution tends to be most informative in capturing generation inconsistencies [18, 20]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 491, + 208, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 208, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 208, + 502 + ], + "type": "text", + "content": "3.2 Baselines" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 510, + 482, + 558 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 558 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 558 + ], + "type": "text", + "content": "We split our discussion between baselines that do not utilize any information specific to the task in order to improve generation diversity, and those that use small amounts of information from the task. To see examples of generations for different methods, see Appendix 6.4" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 559, + 318, + 569 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 559, + 318, + 569 + ], + "spans": [ + { + "bbox": [ + 132, + 559, + 318, + 569 + ], + "type": "text", + "content": "Without any additional information:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 570, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 10, + "blocks": [ + { + "bbox": [ + 138, + 570, + 480, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 570, + 480, + 593 + ], + "spans": [ + { + "bbox": [ + 138, + 570, + 480, + 593 + ], + "type": "text", + "content": "- LDM: This is the baseline setup where the unaltered LDM is used with the prompt {object} in {region} to condition the generation process." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 594, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 594, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 138, + 594, + 481, + 666 + ], + "type": "text", + "content": "- Synonyms: This strategy maps each object class to its corresponding ImageNet [11] class and WordNet [29] synset. Each synset contains lemmas representing a specific \"sense\" of the given class. We generate images stratified across all possible lemmas (including the original object word), for each class, i.e., {synonym} in {region} is used to condition the generation process. The list of synonyms can be found in Appendix [6.1]." + } + ] + } + ], + "index": 9 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 280, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 280, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 280, + 126 + ], + "type": "text", + "content": "With additional information:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 129, + 489, + 380 + ], + "type": "list", + "angle": 0, + "index": 7, + "blocks": [ + { + "bbox": [ + 138, + 129, + 489, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 129, + 489, + 188 + ], + "spans": [ + { + "bbox": [ + 138, + 129, + 489, + 188 + ], + "type": "text", + "content": "- Paraphrasing: We use the LLaMA-2-70B-chat [48] large language model to generate paraphrases of the original prompt template, {object} in {region}. We include the specifications and descriptions used in the collection of GeoDE and DollarStreet. The metaprompts and paraphrases, as well as our method of tuning prompts and model specifications, are included in Appendix [6.1]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 188, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 188, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 138, + 188, + 482, + 272 + ], + "type": "text", + "content": "- Semantic Guidance: As observed in [18] and highlighted in Fig. 3, generated images tend to contain diversity issues related to the magnification of region-specific representations of objects beyond those in the evaluation task. To reduce this amplification of region information in the generated images, we employ Semantic Guidance [6,14] by adding negative guidance corresponding to the region term for each generation. Note that this baseline requires knowing the biases embedded in the text-to-image system upfront." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 272, + 482, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 272, + 482, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 272, + 482, + 331 + ], + "type": "text", + "content": "- Feedback Guidance (FG): Following [22,43], during generation we use feedback from an external CLIP-based classifier to predict region labels of the generated images. We experiment with two versions of feedback guidance to encourage more diverse generations: one that maximizes the loss of the classifier and one that maximizes the entropy of predicted class distributions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 332, + 482, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 482, + 380 + ], + "type": "text", + "content": "- Textual Inversion: Textual inversion injects a learned token embedding using small subset of images from the evaluation task to better represent the reference images [16]. We apply textual inversion by learning an embedding for each object in the evaluation dataset using four images per object." + } + ] + } + ], + "index": 6 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 400, + 263, + 412 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 400, + 263, + 412 + ], + "spans": [ + { + "bbox": [ + 132, + 400, + 263, + 412 + ], + "type": "text", + "content": "3.3 Experimental set-up" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "text", + "content": "We perform all experiments using an open sourced version of an LDM trained on a large scale dataset [39]. For c-VSG, we use " + }, + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\alpha = 1" + }, + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\beta = 2" + }, + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "text", + "content": " unless otherwise specified, with two exemplar images as real world context and set " + }, + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "inline_equation", + "content": "G_{\\text{freq}}" + }, + { + "bbox": [ + 130, + 422, + 482, + 533 + ], + "type": "text", + "content": " to 5. We calculate the Vendi Score in the CLIP ViT-B32 [34] feature space. For each method, we perform a hyperparameter search across guidance scales, as well as the weighting of contextual information, where applicable. We perform one-region-out hyper-parameter selection, selecting the best hyper-parameters for a given region based on the F1 for all the other regions. For computational complexity and efficiency see Appendix Sec. [6.5]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 551, + 198, + 562 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 551, + 198, + 562 + ], + "spans": [ + { + "bbox": [ + 132, + 551, + 198, + 562 + ], + "type": "text", + "content": "3.4 Results" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 573, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 573, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 573, + 482, + 635 + ], + "type": "text", + "content": "Overall results. On GeoDE (reported in Tab. 1), VSG without contextualization achieves a relative improvement in average F1 of " + }, + { + "bbox": [ + 130, + 573, + 482, + 635 + ], + "type": "inline_equation", + "content": "9.6\\%" + }, + { + "bbox": [ + 130, + 573, + 482, + 635 + ], + "type": "text", + "content": " over generations obtained with the LDM (VSG achieves F1 of 0.399 and LDM achieves F1 of 0.364), an improvement over baselines that do not leverage any additional information. Similarly, VSG yields relative improvement in worst-region F1 by " + }, + { + "bbox": [ + 130, + 573, + 482, + 635 + ], + "type": "inline_equation", + "content": "10.6\\%" + }, + { + "bbox": [ + 130, + 573, + 482, + 635 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 304, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 481, + 667 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 481, + 667 + ], + "type": "text", + "content": "2 In this baseline, we do not implement the additional real/fake discriminator as suggested in [43], as we focus only on methods that utilize existing classifiers." + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 178, + 481, + 289 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 481, + 170 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 481, + 170 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 481, + 170 + ], + "type": "text", + "content": "Table 1: Comparison to baselines on GeoDE. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with increases, or little cost to, quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). AF: Africa, WAS: West Asia, \"label\" refers to region label, \"desc\" to text description, and \"img\" to exemplar images." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 178, + 481, + 289 + ], + "lines": [ + { + "bbox": [ + 134, + 178, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 134, + 178, + 481, + 289 + ], + "type": "table", + "html": "
MethodRef. Info.Worst-Reg.F1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
LDM✘AF0.3640.3220.4130.2730.3370.3950.2420.218
Synonyms✘AF0.3570.3060.3500.2980.3660.3150.2150.203
VSG (ours)✘AF0.3990.3560.3490.3070.4700.4240.1800.191
ParaphrasingdescWAS0.3840.3540.3380.3090.4490.4150.2310.228
Semantic GuidancelabelWAS0.4200.4010.4590.5190.3910.3260.2450.253
FG CLIP (Loss)labelWAS0.4090.3780.3870.3830.4360.3730.2280.223
FG CLIP (Ent.)labelAF0.3800.3370.3440.3290.4290.3450.2240.227
Textual InversionimgAF0.3690.3630.4090.4440.3380.3080.2340.232
c-VSG (Ours)imgAF0.4550.4440.4240.4170.4930.4760.2540.253
", + "image_path": "d0f2ccc351259c5e16c1d120ad1aa4e8fbbca30f0fe2a252db10fe581d905147.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 376, + 479, + 485 + ], + "blocks": [ + { + "bbox": [ + 132, + 300, + 481, + 366 + ], + "lines": [ + { + "bbox": [ + 132, + 300, + 481, + 366 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 481, + 366 + ], + "type": "text", + "content": "Table 2: Comparison to baselines on DollarStreet. Contextualized Vendi Score Guidance contributes to greater diversity improvements (recall) with little cost to quality (precision) and consistency (CLIPScore), both on average and for the worst performing region (determined by F1). c-VSG outperforms all the methods by at least " + }, + { + "bbox": [ + 132, + 300, + 481, + 366 + ], + "type": "inline_equation", + "content": "8\\%" + }, + { + "bbox": [ + 132, + 300, + 481, + 366 + ], + "type": "text", + "content": " relative F1 improvement. AF: Africa, AS: Asia, \"label\" refers to region label, \"desc\" to text description, and \"img\" to exemplar images." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 376, + 479, + 485 + ], + "lines": [ + { + "bbox": [ + 135, + 376, + 479, + 485 + ], + "spans": [ + { + "bbox": [ + 135, + 376, + 479, + 485 + ], + "type": "table", + "html": "
MethodRef. Info.Worst- Reg.F1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
LDMXAS0.4480.4420.4280.4340.4720.4500.2310.235
SynonymsXAS0.4640.4570.4510.4480.4790.4670.2160.220
VSG (ours)XAS0.4570.4440.4130.3880.5160.5180.1910.198
ParaphrasingdescAF0.4540.4450.4450.4540.4650.4370.2260.215
Semantic GuidancelabelAS0.4700.4580.4470.4490.4980.4670.2300.233
FG CLIP (Loss)labelAS0.4370.3940.4010.3210.4880.5100.2230.206
FG CLIP (Entropy)labelAS0.4650.4620.4120.4040.5350.5400.2220.219
Textual InversionimgAS0.4250.3980.4780.4910.3860.3350.2170.219
c-VSG (Ours)imgAS0.4970.4830.4860.4860.5110.4790.2340.238
", + "image_path": "84f9139720c8d718c30427f6fdc2e112bba732220afb9f751a0437dc4a3860f5.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 509, + 480, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 480, + 532 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 480, + 532 + ], + "type": "text", + "content": "Interestingly, using Synonyms tends to decrease performance, perhaps due to its enforcement of a strict, yet limited, distribution of object names." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 533, + 481, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 533, + 481, + 628 + ], + "spans": [ + { + "bbox": [ + 132, + 533, + 481, + 628 + ], + "type": "text", + "content": "When considering methods that include additional information, we observe that leveraging textual descriptions of the evaluation dataset (Paraphrasing) is useful to improve average and worst-region F1. However, leveraging region information (Semantic Guidance, FG CLIP) yields better results. Notably, when the additional region information corresponds to known biases embedded in text-to-image systems, as is the case of Semantic Guidance, we observe substantial relative performance improvements of " + }, + { + "bbox": [ + 132, + 533, + 481, + 628 + ], + "type": "inline_equation", + "content": "15.4\\%" + }, + { + "bbox": [ + 132, + 533, + 481, + 628 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 533, + 481, + 628 + ], + "type": "inline_equation", + "content": "24.5\\%" + }, + { + "bbox": [ + 132, + 533, + 481, + 628 + ], + "type": "text", + "content": " in average and worst-region F1 over the LDM baseline." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "content": "Leveraging exemplar images to contextualize VSG results in further performance gains. In particular, c-VSG shows a " + }, + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "25\\%" + }, + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "inline_equation", + "content": "37.9\\%" + }, + { + "bbox": [ + 132, + 629, + 481, + 665 + ], + "type": "text", + "content": " relative improvement in average and worst F1 compared to the LDM baseline. Comparing c-VSG with" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 304, + 209 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 304, + 209 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 304, + 209 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 304, + 209 + ], + "type": "image", + "image_path": "6e13e9737ea50112cbda0838290071eb9c49e536db90fcb2b5b298d47ba438f8.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 220, + 210, + 391, + 219 + ], + "lines": [ + { + "bbox": [ + 220, + 210, + 391, + 219 + ], + "spans": [ + { + "bbox": [ + 220, + 210, + 391, + 219 + ], + "type": "text", + "content": "(a) No VSG, i.e., {object} in {region} baseline" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 306, + 114, + 476, + 209 + ], + "blocks": [ + { + "bbox": [ + 306, + 114, + 476, + 209 + ], + "lines": [ + { + "bbox": [ + 306, + 114, + 476, + 209 + ], + "spans": [ + { + "bbox": [ + 306, + 114, + 476, + 209 + ], + "type": "image", + "image_path": "bda6909bd409bd0eb933905249c99df9c27699d6ff5aba38954451e9c98fdde6.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 135, + 220, + 304, + 314 + ], + "blocks": [ + { + "bbox": [ + 135, + 220, + 304, + 314 + ], + "lines": [ + { + "bbox": [ + 135, + 220, + 304, + 314 + ], + "spans": [ + { + "bbox": [ + 135, + 220, + 304, + 314 + ], + "type": "image", + "image_path": "1e69ee7957b215c5ed9cc331b4257b487646bbf8930b56d1e0f84631b528fcf2.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 306, + 220, + 475, + 314 + ], + "blocks": [ + { + "bbox": [ + 306, + 220, + 475, + 314 + ], + "lines": [ + { + "bbox": [ + 306, + 220, + 475, + 314 + ], + "spans": [ + { + "bbox": [ + 306, + 220, + 475, + 314 + ], + "type": "image", + "image_path": "3df8512c14d4b37c803a34c99c1ccefae907ae1ec986a9f08e5ebead96edf65b.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 135, + 324, + 304, + 418 + ], + "blocks": [ + { + "bbox": [ + 259, + 316, + 352, + 324 + ], + "lines": [ + { + "bbox": [ + 259, + 316, + 352, + 324 + ], + "spans": [ + { + "bbox": [ + 259, + 316, + 352, + 324 + ], + "type": "text", + "content": "(b) Vendi Score Guidance" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 135, + 324, + 304, + 418 + ], + "lines": [ + { + "bbox": [ + 135, + 324, + 304, + 418 + ], + "spans": [ + { + "bbox": [ + 135, + 324, + 304, + 418 + ], + "type": "image", + "image_path": "629d701ab08baac948b253a789c056d54643782681d2de4ff9c538df517793cd.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 231, + 420, + 379, + 429 + ], + "lines": [ + { + "bbox": [ + 231, + 420, + 379, + 429 + ], + "spans": [ + { + "bbox": [ + 231, + 420, + 379, + 429 + ], + "type": "text", + "content": "(c) Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 438, + 482, + 507 + ], + "lines": [ + { + "bbox": [ + 130, + 438, + 482, + 507 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 482, + 507 + ], + "type": "text", + "content": "Fig. 2: Generated images of cooking pots (Left) and cars (Right). The same six seeds are shared among the examples, and the box colors indicate images pertaining to Africa, Europe, and Southeast Asia. Vendi Score Guidance increases the diversity of generated images, including object type, positioning, and quality. Contextualization with exemplar images increases similarity to real world diversity. (More examples are shown in Appendix Figures [7] and [8])" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 306, + 324, + 475, + 418 + ], + "blocks": [ + { + "bbox": [ + 306, + 324, + 475, + 418 + ], + "lines": [ + { + "bbox": [ + 306, + 324, + 475, + 418 + ], + "spans": [ + { + "bbox": [ + 306, + 324, + 475, + 418 + ], + "type": "image", + "image_path": "799e12255fc7f9114ab96e0b22a0c56bb2f8f7f61164eaef16cf27248de61e00.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 531, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 531, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 531, + 482, + 555 + ], + "type": "text", + "content": "the closest competitor, Semantic Guidance, we observe a relative improvement of " + }, + { + "bbox": [ + 130, + 531, + 482, + 555 + ], + "type": "inline_equation", + "content": "8.3\\%" + }, + { + "bbox": [ + 130, + 531, + 482, + 555 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 531, + 482, + 555 + ], + "type": "inline_equation", + "content": "10.7\\%" + }, + { + "bbox": [ + 130, + 531, + 482, + 555 + ], + "type": "text", + "content": " in average and worst-region F1." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "text", + "content": "Tab. 2 presents results on DollarStreet. In this case, uncontextualized VSG only moderately improves over the LDM baseline in average and worst-region F1. However, when including exemplar images per c-VSG, the patterns of improvement are consistent with GeoDE. c-VSG achieves " + }, + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "inline_equation", + "content": "5.7\\%" + }, + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "inline_equation", + "content": "4.5\\%" + }, + { + "bbox": [ + 130, + 555, + 482, + 616 + ], + "type": "text", + "content": " improvements over the closest baselines in average and worst-region F1, respectively." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 616, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 616, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 616, + 482, + 640 + ], + "type": "text", + "content": "In the reminder of this section, we analyze the findings described above in the context of improvements to diversity, quality, and consistency." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 641, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 667 + ], + "type": "text", + "content": "VSG improves diversity. The improvements in F1 relate to consistent boosting of both worst-region and average recall: for GeoDE (Tab. 1, recall), VSG" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": "both with and without contextualization show improvements for all baselines, and by at least " + }, + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "inline_equation", + "content": "7.3\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": " (and up to " + }, + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "inline_equation", + "content": "46.2\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": ") over the LDM baseline. Similarly, VSG exhibits among the highest recall values in DollarStreet (Tab. 2, recall). FG CLIP (Ent.) achieves the highest recall values, but those come with significant drops in precision. Notably, for DollarStreet, VSG has better recall when exemplar images are not used. Again, this comes at a cost to precision." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 190, + 482, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 190, + 482, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 190, + 482, + 274 + ], + "type": "text", + "content": "Diversity improvements are also reflected in qualitative examples. Fig. 2 reveals that VSG leads to greater variation in object color, type, and shape, such as more colorful cars for Africa, sports-cars for Europe, and lengthened hoods for Southeast Asia. With VSG, image backgrounds also show greater variety in textures and diversity in indoor vs. outdoor settings. In addition, VSG enables more inter-region diversity. For example, in Fig. 2 the same seed can look much more similar across regions in the baseline than with c-VSG." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "spans": [ + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "text", + "content": "Contextualized VSG improves quality. In GeoDE, c-VSG also allows for improvement in both average and worst-region precision over the LDM baseline, the latter by up to " + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "inline_equation", + "content": "52.7\\%" + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "text", + "content": " (Tab. 1, precision). Similar precision gains are observed in DollarStreet (Tab. 2, precision): leveraging exemplar images results in relative improvements of " + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "inline_equation", + "content": "12\\%" + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "text", + "content": " in worst-region over the LDM baseline. Comparing c-VSG with VSG shows relative gains of " + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "inline_equation", + "content": "17.7\\%" + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "inline_equation", + "content": "25.3\\%" + }, + { + "bbox": [ + 130, + 275, + 482, + 420 + ], + "type": "text", + "content": " in average and worst-region precision, respectively. Interestingly, Semantic Guidance allows for higher precision than c-VSG on GeoDE, whose images were submitted by people living in the regions of interest. The lower precision achieved by Semantic Guidance on DollarStreet might be related to the datasets' focus on disadvantaged and isolated areas. Thus, Semantic Guidance requires an understanding of whether applying region information helps or hurts the diversity of the generations." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "content": "Contextualized VSG improves consistency. In both GeoDE and DollarStreet, we observe that VSG without contextualization slightly reduces consistency (Tab. 1 and 2, CLIPScore). This highlights the importance of contextualization when using VSG: leveraging exemplar images in c-VSG results in the highest CLIPscores across the board, on average and for the worst-region." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 483, + 482, + 568 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 483, + 482, + 568 + ], + "spans": [ + { + "bbox": [ + 130, + 483, + 482, + 568 + ], + "type": "text", + "content": "Contextualized VSG reduces disparities across regions. When comparing c-VSG to VSG, we observe that disparities across regions appear substantially reduced on both datasets. On GeoDE, contextualization reduces the performance gap between average and worst-region in F1, recall, precision, and CLIPScore. Similar trends may be observed for DollarStreet, where c-VSG exhibits remarkably lower disparities across all metrics when compared to the LDM baseline. It is worth noting that Semantic Guidance also has low disparities." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": "Contextualized VSG shows early improvements in region representation. While this work does not focus particularly on mitigation of reductive regional representations, we find in initial qualitative inspections that representations of regions can change positively after applying contextualized VSG. We find that for Africa, objects like cars and cooking pots are less dilapidated with VSG, as compared to the original generations. In addition, some objects tend to be larger and more central in the image, reducing the prevalence of unrepresentative background fixtures, as shown in Appendix 6.2. The improve" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 447, + 101 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": "ment of consistency with contextualization similarly reduces the dominance of non-representative regional background information. Remaining images without objects tend to have less repetition in reductive backgrounds associated with regional tropes. For example, Appendix 6.2 shows that generated images of bags in Europe can have more variety in their backgrounds when using c-VSG." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 193, + 210, + 204 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 193, + 210, + 204 + ], + "spans": [ + { + "bbox": [ + 132, + 193, + 210, + 204 + ], + "type": "text", + "content": "3.5 Ablations" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 213, + 481, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 213, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 213, + 481, + 236 + ], + "type": "text", + "content": "We next discuss ablations on the variations of VSG criteria and the strength, quantity, and type of exemplar images used in c-VSG." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": "Variations of c-VSG Criteria. We compare the use of the full contextualized Vendi Score Guidance criterion from our approach (" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\alpha > 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\beta > 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": ", c-VSG) to Vendi Score guidance without contextualization (" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\alpha > 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\beta = 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": ", VSG), a criterion using the exemplar contextualizing images exclusively (" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\alpha = 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\beta > 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": "), and the LDM without intervention (" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\alpha = 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "inline_equation", + "content": "\\beta = 0" + }, + { + "bbox": [ + 130, + 236, + 481, + 308 + ], + "type": "text", + "content": "). Results are shown in Tab. 3 and visual examples in Appendix 6.2." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 308, + 482, + 428 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 428 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 428 + ], + "type": "text", + "content": "When evaluating with GeoDE, we find that Vendi Score guidance without contextualization can lead to images with improved diversity but unrealistic object shapes and colors, as well as extreme variation in styles, such as black-and-white or film-style photos. While using exclusively contextualizing images helps in almost all aspects as opposed to only the Vendi Score guidance on the bank of generated images, the methods combined tend to have the best diversity. For DollarStreet, there is a slight trade-off in precision and recall between the inclusion of contextualizing images versus previously generated images in the criterion: while the combination of the two has moderately better measures over only contextualizing images, the use of only previously generated images shows the highest recall." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 428, + 482, + 513 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 428, + 482, + 513 + ], + "spans": [ + { + "bbox": [ + 130, + 428, + 482, + 513 + ], + "type": "text", + "content": "Strength of exemplar images. Tab. 4 shows ablations of the strength of exemplar images used in the contextualized VSG criterion. Unsurprisingly, lower weight " + }, + { + "bbox": [ + 130, + 428, + 482, + 513 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 428, + 482, + 513 + ], + "type": "text", + "content": " of real exemplar images yields greater recall while a higher weight leads to a larger precision, emphasizing the quality vs. diversity trade-off. For example, increasing " + }, + { + "bbox": [ + 130, + 428, + 482, + 513 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 428, + 482, + 513 + ], + "type": "text", + "content": " can correlate with changes in camera angle of cars to more closely match those in the reference images, as shown in Appendix 6.2 In addition, consistency is improved with additional weight to exemplar images." + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 135, + 552, + 482, + 664 + ], + "blocks": [ + { + "bbox": [ + 193, + 532, + 420, + 544 + ], + "lines": [ + { + "bbox": [ + 193, + 532, + 420, + 544 + ], + "spans": [ + { + "bbox": [ + 193, + 532, + 420, + 544 + ], + "type": "text", + "content": "Table 3: Ablation study on variations of VSG criteria." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 552, + 482, + 664 + ], + "lines": [ + { + "bbox": [ + 135, + 552, + 482, + 664 + ], + "spans": [ + { + "bbox": [ + 135, + 552, + 482, + 664 + ], + "type": "table", + "html": "
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDE000.3640.3220.4130.2730.3370.3950.2420.218
GeoDEtuned00.3990.3560.3490.3070.4700.4240.1800.191
GeoDE0tuned0.4460.4270.4310.4090.4640.4470.2610.254
GeoDEtunedtuned0.4550.4440.4240.4170.4930.4760.2540.253
DollarStreet000.4480.4420.4280.4340.4720.4500.2310.235
DollarStreettuned00.4570.4440.4130.3880.5160.5180.1910.198
DollarStreet0tuned0.4920.4800.4860.4830.5000.4760.2400.242
DollarStreettunedtuned0.4970.4830.4860.4860.5110.4790.2340.238
", + "image_path": "c56a2dee26fe3d781d433afeab33dae9b5636687fef6acf5b36126ae114ab7e9.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 135, + 481, + 200 + ], + "blocks": [ + { + "bbox": [ + 146, + 114, + 465, + 125 + ], + "lines": [ + { + "bbox": [ + 146, + 114, + 465, + 125 + ], + "spans": [ + { + "bbox": [ + 146, + 114, + 465, + 125 + ], + "type": "text", + "content": "Table 4: Ablation study on exemplar images strength in contextualized VSG." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 135, + 481, + 200 + ], + "lines": [ + { + "bbox": [ + 135, + 135, + 481, + 200 + ], + "spans": [ + { + "bbox": [ + 135, + 135, + 481, + 200 + ], + "type": "table", + "html": "
DatasetαβF1PrecisionRecallCLIPScore
Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.Avg.Worst-Reg.
GeoDEtunedα0.4510.4340.3840.3800.5470.5060.2160.221
GeoDEtuned2α0.4550.4440.4240.4170.4930.4760.2540.253
GeoDEtuned4α0.4480.4370.4280.4350.4720.4380.2610.261
", + "image_path": "61cb83b01846f143b4526e55481fd18568ac08411f539c9ce092007af5e738d9.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 253, + 481, + 346 + ], + "blocks": [ + { + "bbox": [ + 132, + 210, + 480, + 243 + ], + "lines": [ + { + "bbox": [ + 132, + 210, + 480, + 243 + ], + "spans": [ + { + "bbox": [ + 132, + 210, + 480, + 243 + ], + "type": "text", + "content": "Table 5: Ablation study on the number of exemplar images per object used in the contextualized Vendi Score computation, or " + }, + { + "bbox": [ + 132, + 210, + 480, + 243 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 132, + 210, + 480, + 243 + ], + "type": "text", + "content": " in Algorithm 1. Results are reported based on GeoDE dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 253, + 481, + 346 + ], + "lines": [ + { + "bbox": [ + 135, + 253, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 135, + 253, + 481, + 346 + ], + "type": "table", + "html": "
Method#imgsF1PrecisionRecallCLIPScore
Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.Avg.Worst Reg.
c-VSG2 per obj.0.4550.4440.4240.4170.4930.4760.2540.253
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG8 per obj.0.4550.4420.4450.4360.4660.4490.2620.257
c-VSG20 per obj.0.4600.4330.4400.4340.4850.4330.2510.246
c-VSG4 per obj.0.4480.4370.4280.4350.4720.4380.2610.257
c-VSG4 per obj.-reg.0.4540.4450.4360.4310.4750.4590.2590.253
", + "image_path": "d5cee3b41c1255fc45b0e0f29ecd429e7a99492e4c04308ba4c2e0aa7df0256a.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 369, + 482, + 513 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 513 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 513 + ], + "type": "text", + "content": "Quantity and type of exemplar images. In Tab. 5, we first study how the number of images selected as exemplar images in c-VSG affects image generation diversity. Generally, using fewer exemplar images tends to help with diversity while increasing this number helps with quality, although these trends appear minor in some cases. In Appendix 6.2, we visually inspect images and find that trends in quality and consistency for a single seed can also reverse as the number of images increases, first improving, then worsening (or vice versa). In addition, we study whether exemplar images randomly selected across all possible regions or the same number images selected specifically for a given region yields better diversity. We find that region-stratified exemplar images yield results within " + }, + { + "bbox": [ + 130, + 369, + 482, + 513 + ], + "type": "inline_equation", + "content": "1 - 2\\%" + }, + { + "bbox": [ + 130, + 369, + 482, + 513 + ], + "type": "text", + "content": " of those when using randomly selected images for all measures except for worst-region recall, for which there is a " + }, + { + "bbox": [ + 130, + 369, + 482, + 513 + ], + "type": "inline_equation", + "content": "5\\%" + }, + { + "bbox": [ + 130, + 369, + 482, + 513 + ], + "type": "text", + "content": " improvement." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "type": "text", + "content": "4 Related Work" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 558, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 667 + ], + "type": "text", + "content": "Prior work often focuses on mitigating general diversity issues in text-to-image models. For example, 37.50 focus on preventing mode collapse while 44 generates a balanced distribution, focusing on the long-tail, by using synthetic images. In addition, there is growing research focused on issues related to diversity through a lens of reducing person-related bias. One line of work reduces people-related biases, e.g., related to gender, through concept forgetting or erasure 23, 33, 52, rather than diversification. The idea is that, by modifying a model's understanding of a concept, the harmful or biased content is not generated. 10 augments the original prompt with real-world distributions of gender" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 225 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 225 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 225 + ], + "type": "text", + "content": "and ethnicity using a finetuned language model, and [25,51] learn token embeddings for a diverse set of sensitive attributes and concatenate them to the original prompt. Building on work in NLP [5], other approaches remove the components of sensitive attributes like race and gender from the text embeddings altogether [9,47] or modify the cross attention layer [17,33] to remove implicit assumptions about the world. However, there is little work investigating improvements to geographic diversity. To the best of our knowledge, prior work primarily discusses the (minimal) improvement in diversity when including more granular geographic information in text prompts [2,18]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 225, + 482, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 225, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 225, + 482, + 332 + ], + "type": "text", + "content": "Our proposed method is most relevant to works that use classifier guidance during inference time. [7,42] use classifier guidance to guide generations away from inappropriate content. In the context of augmenting a dataset with synthetic samples, [22] has extended the idea of classifier guidance to feedback guidance where loss and entropy are used as the guidance mechanism. While the Vendi Score has been used at training time to increase the diversity of generative adversarial networks (GANs) across modes in the training dataset [3], to the best of our knowledge, we are the first to apply it to diffusion models and as guidance at inference time." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 357, + 219, + 369 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 357, + 219, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 219, + 369 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 388, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 472 + ], + "type": "text", + "content": "In this work, we introduced an inference time intervention that extends the guidance toolbox of diffusion models by driving the generation process towards samples that are substantially different from each other while still representative of the real world. Through extensive experiments, we showed that our approach produces images with higher intra- and inter-region diversity, while exhibiting increased image quality and text-image consistency; overall resulting in reduced disparities in generation diversity, quality and consistency." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 472, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 581 + ], + "type": "text", + "content": "Limitations. In this work, we focus on improving worst-region F1 while also analyzing worst and average region precision, recall, and consistency. Automatic metrics are susceptible to several challenges, including region representations in the reference dataset, reliance on pre-existing feature extractors, and the composition of geographic groupings. The metrics are aggregates and do not account for individual preferences. A human evaluation study would be necessary for capturing subjective and personal perspectives about the effect of c-VSG. Finally, our approach is only a single effort at improving the diversity of text-to-image generative models, and there remains future work for their further improvement." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Societal Impacts. This work involves representations of geographic regions. While our qualitative analyses show that c-VSG tends to help mitigate reductive representations of regions, our method may not always remove harmful representations in the underlying generative models. Furthermore, increasing the diversity of text-to-image models may yield unexpected generations. Thorough study of the full range of potential outcomes is necessary before deployment of these methods in real world systems." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "text", + "content": "Acknowledgments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 481, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 481, + 201 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 481, + 201 + ], + "type": "text", + "content": "We would like to thank Oscar Manas and Pietro Astolfi for helpful discussion and pointers regarding in-context learning and paraphrasing approaches. We also thank Mohammad Pezeshki for useful discussions, feedback and support. In addition, we thank the participants of the qualitative study of c-VSG, discussed in Appendix 6.3." + } + ] + } + ], + "index": 3 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 198, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 198, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 198, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 137, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 138, + 137, + 481, + 169 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 137, + 481, + 169 + ], + "spans": [ + { + "bbox": [ + 138, + 137, + 481, + 169 + ], + "type": "text", + "content": "1. Bansal, H., Yin, D., Monajatipoor, M., Chang, K.W.: How well can text-to-image generative models understand ethical natural language interventions? In: EMNLP (Short) (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 170, + 481, + 191 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 170, + 481, + 191 + ], + "spans": [ + { + "bbox": [ + 138, + 170, + 481, + 191 + ], + "type": "text", + "content": "2. Basu, A., Babu, R.V., Pruthi, D.: Inspecting the geographical representativeness of images from text-to-image models. arXiv preprint arXiv:2305.11080 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 191, + 481, + 212 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 191, + 481, + 212 + ], + "spans": [ + { + "bbox": [ + 138, + 191, + 481, + 212 + ], + "type": "text", + "content": "3. Berns, S., Colton, S., Guckelsberger, C.: Towards mode balancing of generative models via diversity weights (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 213, + 481, + 245 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 213, + 481, + 245 + ], + "spans": [ + { + "bbox": [ + 138, + 213, + 481, + 245 + ], + "type": "text", + "content": "4. Bianchi, F., Kalluri, P., Durmus, E., Ladhak, F., Cheng, M., Nozza, D., Hashimoto, T., Jurafsky, D., Zou, J., Caliskan, A.: Easily accessible text-to-image generation amplifies demographic stereotypes at large scale (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 245, + 481, + 277 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 245, + 481, + 277 + ], + "spans": [ + { + "bbox": [ + 138, + 245, + 481, + 277 + ], + "type": "text", + "content": "5. Bolukbasi, T., Chang, K.W., Zou, J.Y., Saligrama, V., Kalai, A.T.: Man is to computer programmer as woman is to homemaker? debiasing word embeddings. Advances in neural information processing systems 29 (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 277, + 481, + 299 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 277, + 481, + 299 + ], + "spans": [ + { + "bbox": [ + 138, + 277, + 481, + 299 + ], + "type": "text", + "content": "6. Brack, M., Friedrich, F., Hintersdorf, D., Struppek, L., Schramowski, P., Kersting, K.: Sega: Instructing text-to-image models using semantic guidance (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 299, + 481, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 299, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 299, + 481, + 331 + ], + "type": "text", + "content": "7. Brack, M., Friedrich, F., Schramowski, P., Kersting, K.: Mitigating inappropriateness in image generation: Can there be value in reflecting the world's ugliness? arXiv preprint arXiv:2305.18398 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 331, + 481, + 353 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 331, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 138, + 331, + 481, + 353 + ], + "type": "text", + "content": "8. Cho, J., Zala, A., Bansal, M.: Dall-eval: Probing the reasoning skills and social biases of text-to-image generative transformers (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 353, + 481, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 353, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 138, + 353, + 481, + 373 + ], + "type": "text", + "content": "9. Chuang, C.Y., Jampani, V., Li, Y., Torralba, A., Jegelka, S.: Debiasing vision-language models via biased prompts. arXiv preprint arXiv:2302.00070 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 373, + 481, + 417 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 373, + 481, + 417 + ], + "spans": [ + { + "bbox": [ + 138, + 373, + 481, + 417 + ], + "type": "text", + "content": "0. Clemmer, C., Ding, J., Feng, Y.: Precisedebias: An automatic prompt engineering approach for generative ai to mitigate image demographic biases. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 8596-8605 (2024)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 417, + 481, + 459 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 417, + 481, + 459 + ], + "spans": [ + { + "bbox": [ + 138, + 417, + 481, + 459 + ], + "type": "text", + "content": "1. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009). https://doi.org/10.1109/CVPR.2009.5206848" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 460, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 460, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 138, + 460, + 481, + 482 + ], + "type": "text", + "content": "2. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. Advances in neural information processing systems 34, 8780-8794 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 482, + 481, + 503 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 482, + 481, + 503 + ], + "spans": [ + { + "bbox": [ + 138, + 482, + 481, + 503 + ], + "type": "text", + "content": "3. Friedman, D., Dieng, A.B.: The vendi score: A diversity evaluation metric for machine learning. arXiv preprint arXiv:2210.02410 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 503, + 481, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 503, + 481, + 536 + ], + "spans": [ + { + "bbox": [ + 138, + 503, + 481, + 536 + ], + "type": "text", + "content": "4. Friedrich, F., Schramowski, P., Brack, M., Struppek, L., Hintersdorf, D., Luccioni, S., Kersting, K.: Fair diffusion: Instructing text-to-image generation models on fairness (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 536, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 536, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 536, + 481, + 578 + ], + "type": "text", + "content": "5. Gafni, O., Polyak, A., Ashual, O., Sheynin, S., Parikh, D., Taigman, Y.: Makea-scene: Scene-based text-to-image generation with human priors. In: Computer Vision-ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23-27, 2022, Proceedings, Part XV. pp. 89-106. Springer (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 578, + 481, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 481, + 611 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 481, + 611 + ], + "type": "text", + "content": "6. Gal, R., Alaluf, Y., Atzmon, Y., Patashnik, O., Bermano, A.H., Chechik, G., Cohen-Or, D.: An image is worth one word: Personalizing text-to-image generation using textual inversion. arXiv preprint arXiv:2208.01618 (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 611, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 611, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 611, + 481, + 632 + ], + "type": "text", + "content": "7. Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., Bau, D.: Erasing concepts from diffusion models. arXiv preprint arXiv:2303.07345 (2023)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 481, + 666 + ], + "type": "text", + "content": "8. Hall, M., Ross, C., Williams, A., Carion, N., Drozdzal, M., Soriano, A.R.: Dig in: Evaluating disparities in image generations with indicators for geographic diversity (2023)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "text", + "content": "19. Hao, S., Shelby, R., Liu, Y., Srinivasan, H., Bhutani, M., Ayan, B.K., Poddar, S., Laszlo, S.: Harm amplification in text-to-image models (2024)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 172 + ], + "type": "text", + "content": "20. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? arXiv preprint arXiv:2210.07574 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 173, + 480, + 206 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 173, + 480, + 206 + ], + "spans": [ + { + "bbox": [ + 132, + 173, + 480, + 206 + ], + "type": "text", + "content": "21. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., Qi, X.: Is synthetic data from generative models ready for image recognition? (2023), https://arxiv.org/abs/2210.07574" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 207, + 480, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 207, + 480, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 207, + 480, + 228 + ], + "type": "text", + "content": "22. Hemmat, R.A., Pezeshki, M., Bordes, F., Drozdjal, M., Romero-Soriano, A.: Feedback-guided data synthesis for imbalanced classification (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 229, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 229, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 480, + 262 + ], + "type": "text", + "content": "23. Heng, A., Soh, H.: Selective amnesia: A continual learning approach to forgetting in deep generative models. Advances in Neural Information Processing Systems 36 (2024)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 262, + 480, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 262, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 132, + 262, + 480, + 285 + ], + "type": "text", + "content": "24. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 285, + 480, + 307 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 480, + 307 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 480, + 307 + ], + "type": "text", + "content": "25. Kim, E., Kim, S., Shin, C., Yoon, S.: De-stereotyping text-to-image models through prompt tuning (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 308, + 480, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 308, + 480, + 329 + ], + "spans": [ + { + "bbox": [ + 132, + 308, + 480, + 329 + ], + "type": "text", + "content": "26. Kynkänniemi, T., Karras, T., Laine, S., Lehtinen, J., Aila, T.: Improved precision and recall metric for assessing generative models (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 331, + 480, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 331, + 480, + 352 + ], + "spans": [ + { + "bbox": [ + 132, + 331, + 480, + 352 + ], + "type": "text", + "content": "27. Luccioni, A.S., Akiki, C., Mitchell, M., Jernite, Y.: Stable bias: Analyzing societal representations in diffusion models (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 353, + 480, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 353, + 480, + 386 + ], + "spans": [ + { + "bbox": [ + 132, + 353, + 480, + 386 + ], + "type": "text", + "content": "28. Manas, O., Astolfi, P., Hall, M., Ross, C., Urbanek, J., Williams, A., Agrawal, A., Romero-Soriano, A., Drozdzal, M.: Improving text-to-image consistency via automatic prompt optimization (2024)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 387, + 480, + 420 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 387, + 480, + 420 + ], + "spans": [ + { + "bbox": [ + 132, + 387, + 480, + 420 + ], + "type": "text", + "content": "29. Miller, G.A.: WordNet: A lexical database for English. In: Human Language Technology: Proceedings of a Workshop held at Plainsboro, New Jersey, March 8-11, 1994 (1994), https://aclanthology.org/H94-1111" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 420, + 480, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 420, + 480, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 480, + 453 + ], + "type": "text", + "content": "30. Naeem, M.F., Oh, S.J., Uh, Y., Choi, Y., Yoo, J.: Reliable fidelity and diversity metrics for generative models. In: International Conference on Machine Learning. pp. 7176-7185. PMLR (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 453, + 480, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 480, + 464 + ], + "type": "text", + "content": "31. Naik, R., Nushi, B.: Social biases through the text-to-image generation lens (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 465, + 480, + 509 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 465, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 132, + 465, + 480, + 509 + ], + "type": "text", + "content": "32. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: GLIDE: towards photorealistic image generation and editing with text-guided diffusion models. CoRR abs/2112.10741 (2021), https://arxiv.org/abs/2112.10741" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 510, + 480, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 480, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 480, + 531 + ], + "type": "text", + "content": "33. Orgad, H., Kawar, B., Belinkov, Y.: Editing implicit assumptions in text-to-image diffusion models. arXiv preprint arXiv:2303.08084 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 532, + 480, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 480, + 576 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 480, + 576 + ], + "type": "text", + "content": "34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 577, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 577, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 577, + 480, + 609 + ], + "type": "text", + "content": "35. Ramaswamy, V.V., Lin, S.Y., Zhao, D., Adcock, A.B., van der Maaten, L., Ghadiyaram, D., Russakovsky, O.: Beyond web-scraping: Crowd-sourcing a geodiverse dataset. In: arXiv preprint (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 610, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 480, + 632 + ], + "type": "text", + "content": "36. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 480, + 665 + ], + "type": "text", + "content": "37. Rangwani, H., Jaswani, N., Karmali, T., Jampani, V., Babu, R.V.: Improving gans for long-tailed data through group spectral regularization. In: European Conference on Computer Vision. pp. 426-442. Springer (2022)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 293, + 91, + 447, + 100 + ], + "type": "text", + "content": "Contextualized Vendi Score Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 556 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 160 + ], + "type": "text", + "content": "38. Rojas, W.A.G., Diamos, S., Kini, K.R., Kanter, D., Reddi, V.J., Coleman, C.: The dollar street dataset: Images representing the geographic and socioeconomic diversity of the world. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 161, + 482, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 482, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 482, + 194 + ], + "type": "text", + "content": "39. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. CoRR abs/2112.10752 (2021), https://arxiv.org/abs/2112.10752" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 482, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 482, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 482, + 226 + ], + "type": "text", + "content": "40. Sajjadi, M.S.M., Bachem, O., Lučić, M., Bousquet, O., Gelly, S.: Assessing Generative Models via Precision and Recall. In: Advances in Neural Information Processing Systems (NeurIPS) (2018)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 482, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 482, + 248 + ], + "type": "text", + "content": "41. Salimans, T., Ho, J.: Progressive distillation for fast sampling of diffusion models. arXiv preprint arXiv:2202.00512 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 482, + 292 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 482, + 292 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 482, + 292 + ], + "type": "text", + "content": "42. Schramowski, P., Brack, M., Deiseroth, B., Kersting, K.: Safe latent diffusion: Mitigating inappropriate degeneration in diffusion models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22522-22531 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 482, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 482, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 482, + 314 + ], + "type": "text", + "content": "43. Sehwag, V., Hazirbas, C., Gordo, A., Ozgenel, F., Ferrer, C.C.: Generating high fidelity data from low-density regions using diffusion models (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 482, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 482, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 482, + 336 + ], + "type": "text", + "content": "44. Shin, J., Kang, M., Park, J.: Fill-up: Balancing long-tailed data with generative models. arXiv preprint arXiv:2306.07200 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 337, + 482, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 337, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 337, + 482, + 357 + ], + "type": "text", + "content": "45. Song, J., Meng, C., Ermon, S.: Denoising Diffusion Implicit Models. In: Proceedings of the International Conference on Learning Representations (ICLR) (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 358, + 454, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 454, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 454, + 369 + ], + "type": "text", + "content": "46. Song, Y., Dhariwal, P., Chen, M., Sutskever, I.: Consistency models (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 370, + 482, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 370, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 370, + 482, + 402 + ], + "type": "text", + "content": "47. Tanjim, M.M., Singh, K.K., Kafle, K., Sinha, R., Cottrell, G.W.: Discovering and mitigating biases in clip-based image editing. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2984-2993 (2024)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 403, + 482, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 482, + 435 + ], + "type": "text", + "content": "48. Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., Rodriguez, A., Joulin, A., Grave, E., Lample, G.: Llama: Open and efficient foundation language models (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 436, + 482, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 436, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 436, + 482, + 456 + ], + "type": "text", + "content": "49. Wan, Y., Chang, K.W.: The male ceo and the female assistant: Probing gender biases in text-to-image models through paired stereotype test (2024)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 457, + 482, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 482, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 482, + 500 + ], + "type": "text", + "content": "50. Yu, N., Li, K., Zhou, P., Malik, J., Davis, L., Fritz, M.: Inclusive gan: Improving data and minority coverage in generative models. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXII 16. pp. 377-393. Springer (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 501, + 482, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 482, + 533 + ], + "type": "text", + "content": "51. Zhang, C., Chen, X., Chai, S., Wu, C.H., Lagun, D., Beeler, T., De la Torre, F.: Iti-gen: Inclusive text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3969-3980 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 534, + 482, + 556 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 482, + 556 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 482, + 556 + ], + "type": "text", + "content": "52. Zhang, E., Wang, K., Xu, X., Wang, Z., Shi, H.: Forget-me-not: Learning to forget in text-to-image diffusion models. arXiv preprint arXiv:2303.17591 (2023)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 303, + 101 + ], + "type": "text", + "content": "R. Askari Hemmat, M. Hall et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_content_list.json b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..d26d5813d4cc2829a138fe6c99fbcda10c11544c --- /dev/null +++ b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_content_list.json @@ -0,0 +1,1722 @@ +[ + { + "type": "text", + "text": "Improving Hyperbolic Representations via Gromov-Wasserstein Regularization", + "text_level": 1, + "bbox": [ + 259, + 140, + 743, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yifei Yang $^{1}$ , Wonjun Lee $^{2}$ , Dongmian Zou $^{3}$ , and Gilad Lerman $^{2}$", + "bbox": [ + 250, + 210, + 754, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Wuhan University, Wuhan, Hubei 430072, China", + "bbox": [ + 333, + 238, + 669, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "yflyang@whu.edu.cn", + "bbox": [ + 434, + 255, + 566, + 267 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ University of Minnesota, Minneapolis, MN 55455, USA", + "bbox": [ + 312, + 267, + 691, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{lee01273,lerman}@umn.edu", + "bbox": [ + 403, + 282, + 599, + 294 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{3}$ Duke Kunshan University, Kunshan, Jiangsu 215316, China", + "bbox": [ + 295, + 295, + 707, + 308 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "dongmian.zou@duke.edu", + "bbox": [ + 419, + 310, + 583, + 323 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Hyperbolic representations have shown remarkable efficacy in modeling inherent hierarchies and complexities within data structures. Hyperbolic neural networks have been commonly applied for learning such representations from data, but they often fall short in preserving the geometric structures of the original feature spaces. In response to this challenge, our work applies the Gromov-Wasserstein (GW) distance as a novel regularization mechanism within hyperbolic neural networks. The GW distance quantifies how well the original data structure is maintained after embedding the data in a hyperbolic space. Specifically, we explicitly treat the layers of the hyperbolic neural networks as a transport map and calculate the GW distance accordingly. We validate that the GW distance computed based on a training set well approximates the GW distance of the underlying data distribution. Our approach demonstrates consistent enhancements over current state-of-the-art methods across various tasks, including few-shot image classification, as well as semi-supervised graph link prediction and node classification.", + "bbox": [ + 259, + 357, + 743, + 580 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Gromov-Wasserstein distance $\\cdot$ Hyperbolic neural networks", + "bbox": [ + 261, + 590, + 740, + 604 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "·Few-shot learning $\\cdot$ Semi-supervised learning", + "bbox": [ + 261, + 604, + 570, + 619 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 643, + 375, + 657 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The success of many machine learning applications relies on effectively capturing the geometric intricacies of complex data structures. This challenge necessitates a careful selection of the underlying space that aligns with the inherent properties of data. In this context, hyperbolic spaces have emerged as a popular choice for modeling data with hierarchical structures such as lexical databases [23] and phylogenetic trees [28]. This is attributed to their distinctive capacity to embody exponential growth and branching patterns, a feature rooted in their constant negative curvature. Such a geometric framework can reflect the tree-like architectures that are ubiquitous across numerous real-world networks.", + "bbox": [ + 212, + 672, + 787, + 808 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Interestingly, hyperbolic spaces also play a significant role in computer vision [2, 14], particularly in tasks like image classification and object recognition", + "bbox": [ + 212, + 810, + 785, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/5ed87fd2a1729b52bda7b4a3ece2d6ef06ba6a3ef22f063c1e9d854370ce2116.jpg", + "image_caption": [ + "Fig. 1: Illustration of hierarchical structures in image data. The images are taken from the MiniImagenet dataset." + ], + "image_footnote": [], + "bbox": [ + 232, + 150, + 781, + 381 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where hierarchical relationships among instances and concepts are common. For example, within the broader category of animals, there are dogs, which further subdivide into breeds such as bulldogs, Gordon setters, Newfoundland dogs, etc. This is illustrated in Fig. 1. Hyperbolic embeddings can capture these hierarchies, thereby potentially improving classification performance and providing more interpretable models.", + "bbox": [ + 212, + 457, + 787, + 547 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In crafting hyperbolic representations from non-hyperbolic features, two main strategies emerge: principled design and data-driven learning. The principled approach, exemplified by methods like Sarkar's algorithm [29], focuses on constructing embeddings that rigorously preserve the inherent geometric structure from data. This method particularly excels at maintaining hierarchical relationships within the data, ensuring that the embedded representation reflects structure of the original dataset with low distortion. On the other hand, the data-driven approach leverages the capabilities of end-to-end neural networks to learn the hyperbolic embedding directly from data. Such neural networks are well-known as hyperbolic neural networks (HNNs), which are pioneered in [10]. HNNs prioritize the development of hyperbolically coherent neural operations that are expressive and mirror the Euclidean counterparts. When dealing with input that is primarily Euclidean, HNNs employ straightforward operations, such as exponential maps, to transition features into the hyperbolic space, thereafter learning to extract deep features in a manner driven by the data. This method adapts the embedding to specific tasks, potentially unveiling intricate patterns and relationships inherent within data.", + "bbox": [ + 212, + 550, + 787, + 806 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In our work, we aim to establish a methodology that integrates the benefits of low-distortion embedding into data-driven learning. In the context of learning", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where generalization is the goal, we can view hyperbolic embedding as a method of embedding the data distribution into hyperbolic spaces. Therefore, we need to compare the distributions before and after the embedding. This necessitates a comparison of data distributions before and after embedding, which is complicated by the fundamental differences in geometric principles, such as curvature and dimensionality, that govern Euclidean and hyperbolic spaces. Direct comparisons between such disparate spaces are inherently complex and challenging.", + "bbox": [ + 212, + 146, + 782, + 252 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To address this challenge, we rely on the Gromov-Wasserstein (GW) distance [19], a tool proven effective in comparing distributions across diverse metric spaces. Specifically, we employ the Gromov-Monge (GM) formulation, an alternative form of the GW distance, to compute the explicit transport map between heterogeneous metric spaces. The HNN layers induce the embedding distribution, thus serving as the transport map. Consequently, the GM formulation is a more suitable approach for the corresponding HNN layers. However, implementing the GM distance poses computational challenges due to its complex constraints. Therefore, in light of this, we extend the GM-based embedding technique introduced in [16] to compute the geometry-preserving transport map from data distribution in Euclidean space to hyperbolic spaces.", + "bbox": [ + 212, + 252, + 784, + 417 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The contribution of the current work is summarized as follows:", + "bbox": [ + 238, + 417, + 692, + 431 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. We propose a novel methodology that incorporates the GM distance into an end-to-end learning framework for hyperbolic representation learning. This approach ensures a more faithful representation of the intrinsic hierarchical structures. Moreover, we verify that our approach maintains computational efficiency by analyzing its time complexity.", + "2. We validate that the embedding faithfully represents an embedding of distributions from the original domain by providing an upper bound for the sampling error. Therefore, regularization on the training sample generalizes to the underlying data distribution.", + "3. We provide empirical evidence showing that our regularization strategy leads to consistent improvements over existing baseline methods when applied to datasets with hierarchical structures, including both image and graph data." + ], + "bbox": [ + 220, + 441, + 782, + 619 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 643, + 395, + 659 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Hyperbolic embedding The adoption of hyperbolic geometries for representing hierarchical connections between data points has attracted considerable attention. The exploration began when researchers considered low-distortion embedding of tree or tree-like graphs into the hyperbolic domain. In their seminal work, Sarkar [29] showed that a tree can be embedded into the Poincaré disk with arbitrarily low distortion. Sala et al. [28] generalized the embedding to high dimensional Poincaré balls and discussed embedding general graphs into trees. Sonthalia and Gilbert [32] bypassed the intermediary step of general graph structures, opting instead to directly infer tree architectures from the data itself. In addition to combinatorial methods, gradient-based methods are also used in hyperbolic embedding [23, 24].", + "bbox": [ + 212, + 672, + 784, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Hyperbolic Reps via GW Reg", + "bbox": [ + 459, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Hyperbolic neural networks More recently, the advancement in hyperbolic representation learning has evolved to be more closely aligned with specific end tasks and specific datasets, such as text [34], images [14], biology [41], molecular [18], and knowledge graph [6]. This has led to the emergence of hyperbolic neural networks (HNNs) as a preferred framework for learning their representations. Numerous HNN architectures have emerged [3, 5, 10, 11, 18, 24, 31]. Comprehensive surveys on HNN include [26, 40]. These HNNs define operations that conform with a choice of coordinate system in the hyperbolic space. However, when communicating between the Euclidean features and their hyperbolic embeddings, these HNNs take very simple approaches. For instance, Ganea et al. [10] directly used logarithmic and exponential maps at the origin, leading to unavoidable distortions. There are also very recent works addressing representations learned by HNNs. For instance, CO-SNE [12] reduces the dimensions of hyperbolic features for visualization, which is an analogy to t-SNE in the Euclidean domain. Parallel to this, Fan et al. [9] developed a systematic method for embedding data into nested hyperbolic spaces, which not only results in dimensionality reduction but also extends to design of HNNs. Nikolentzos et al. [25] applied the Weisfeiler-Leman algorithm to capture hierarchy in data and built HNNs accordingly. However, none of the above methods have considered comparing distributions before and after embedding into the hyperbolic space.", + "bbox": [ + 212, + 145, + 787, + 450 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "GW distance GW distance, a variant of optimal transport distance, has been widely utilized to quantify structural differences between different distributions. Memoli provided a detailed introduction and study of GW distance in [19, 20]. Subsequently, Sturm [33] presented a more in-depth mathematical exposition of GW distance, focusing on its geodesic structure and gradient flow. Following these foundational works, GW distance has found applications in various fields, including computer vision [27, 30], recommendation systems [17], natural language processing [1], generative models [4, 16, 22, 35]. In particular, Lee et al. [16] employed the GM formulation to achieve geometry-preserving dimension reduction within a generative modeling framework. The discussion on the GM formulation can also be traced to [8, 21]. Moreover, GW distance has been applied to specific data types such as graphs [38, 39] and specific neural network architectures such as transformers [13]. To the best of our knowledge, GW distance has not yet been explored in the context of hyperbolic neural networks.", + "bbox": [ + 212, + 470, + 787, + 684 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Methodology", + "text_level": 1, + "bbox": [ + 215, + 705, + 380, + 724 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Preliminaries of Hyperbolic Geometry", + "text_level": 1, + "bbox": [ + 215, + 738, + 578, + 753 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Hyperbolic geometry, characterized by its constant negative curvature, represents a non-Euclidean geometry essential for capturing complex hierarchical representations. We review operations that are defined in two different isometric coordinate systems, namely the Poincaré ball (Poincaré disk) model and the Lorentz (hyperboloid) model.", + "bbox": [ + 212, + 763, + 785, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Poincaré ball model [10,31] The Poincaré ball model for an $n$ -dimensional hyperbolic space with curvature $-c$ is defined by", + "bbox": [ + 214, + 146, + 782, + 176 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbb {B} _ {c} ^ {n} = \\left\\{\\mathbf {x} \\in \\mathbb {R} ^ {n}: c \\| \\mathbf {x} \\| < 1, c > 0 \\right\\}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 191, + 784, + 208 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "with the corresponding Riemannian metric given by $\\mathfrak{g}^{\\mathbb{B}} = (\\lambda_{\\mathbf{x}}^{c})^{2}\\mathbf{I}$ , where $\\lambda_{\\mathbf{x}}^{c} = 2(1 - c\\|\\mathbf{x}\\|^{2})^{-1}$ is the conformal factor.", + "bbox": [ + 214, + 220, + 782, + 253 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The analogy of a linear layer in HNN depends on two important operations, namely Möbius addition and multiplication. The Möbius addition $\\oplus$ is defined as:", + "bbox": [ + 214, + 255, + 782, + 297 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {x} \\oplus_ {c} \\mathbf {y} = \\frac {\\left(1 + 2 c \\langle \\mathbf {x} , \\mathbf {y} \\rangle + c \\| \\mathbf {y} \\| ^ {2}\\right) \\mathbf {x} + \\left(1 - c \\| \\mathbf {x} \\| ^ {2}\\right) \\mathbf {y}}{1 + 2 c \\langle \\mathbf {x} , \\mathbf {y} \\rangle + c \\| \\mathbf {x} \\| ^ {2} \\| \\mathbf {y} \\| ^ {2}}. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 308, + 300, + 784, + 345 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The Möbius multiplication $\\mathbf{M} \\otimes_{c} \\mathbf{x}$ is defined as:", + "bbox": [ + 215, + 352, + 566, + 368 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {M} \\otimes_ {c} \\mathbf {x} = \\frac {1}{\\sqrt {c}} \\tanh \\left(\\frac {\\| \\mathbf {M x} \\|}{\\mathbf {M x}} \\tanh ^ {- 1} (\\sqrt {c} \\| \\mathbf {x} \\|)\\right) \\frac {\\mathbf {M x}}{\\| \\mathbf {M x} \\|}. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 310, + 381, + 784, + 415 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Finally, the geodesic distance between two points $\\mathbf{x}$ and $\\mathbf{y}$ in the Poincaré ball can be expressed as:", + "bbox": [ + 214, + 426, + 782, + 458 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nd _ {\\mathbb {B}} ^ {c} (\\mathbf {x}, \\mathbf {y}) = \\frac {2}{\\sqrt {c}} \\tanh ^ {- 1} \\left(\\sqrt {c} \\| - \\mathbf {x} \\oplus_ {c} \\mathbf {y} \\|\\right). \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 359, + 470, + 784, + 501 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Unless otherwise specified, we follow the common choice to take $c = 1$ .", + "bbox": [ + 215, + 513, + 723, + 529 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Lorentz model [5,6] The Lorentz model of an $n$ -dimensional hyperbolic space $\\mathbb{L}^n$ is a manifold embedded in a $(n + 1)$ -dimensional Minkowski space. More specifically, this Minkowski space contains the same points as $\\mathbb{R}^{n + 1}$ , but with an inner product $\\langle \\cdot ,\\cdot \\rangle_{\\mathbb{L}}$ defined by", + "bbox": [ + 214, + 558, + 782, + 619 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\langle \\mathbf {x}, \\mathbf {y} \\rangle_ {\\mathbb {L}} = - x _ {0} y _ {0} + \\sum_ {i = 1} ^ {n} x _ {i} y _ {i}, \\mathbf {x} = (x _ {0}, \\dots , x _ {n}), \\mathbf {y} = (y _ {0}, \\dots , y _ {n}) \\in \\mathbb {R} ^ {n + 1}. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 243, + 635, + 784, + 672 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The Lorentz model $\\mathbb{L}^n$ contains points with $\\langle \\mathbf{x},\\mathbf{x}\\rangle_{\\mathbb{L}} = -c$ , where $-c$ is the curvature. That is,", + "bbox": [ + 214, + 686, + 782, + 715 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbb {L} ^ {n} = \\left\\{\\mathbf {x} = \\left(x _ {0}, \\dots , x _ {n}\\right) \\in \\mathbb {R} ^ {n + 1}: \\langle \\mathbf {x}, \\mathbf {x} \\rangle_ {\\mathbb {L}} = - c, x _ {0} > 0 \\right\\}, \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 300, + 731, + 784, + 750 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The geodesic distance between two points $\\mathbf{x}$ and $\\mathbf{y}$ in the Lorentz model $\\mathbb{L}^n$ is expressed as", + "bbox": [ + 214, + 762, + 782, + 792 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nd _ {\\mathbb {L}} ^ {c} (\\mathbf {x}, \\mathbf {y}) = \\frac {1}{\\sqrt {c}} \\cosh^ {- 1} (- \\langle \\mathbf {x}, \\mathbf {y} \\rangle_ {\\mathbb {L}}). \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 379, + 795, + 784, + 825 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Hyperbolic Reps via GW Reg", + "bbox": [ + 457, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/2ae3aa16a9dabe2531f7467da1216a4bdb4f1bc78a925d0bbe82f7ecc892c89a.jpg", + "image_caption": [ + "Fig. 2: Illustration of the transport map $T$ . The feature distribution $\\mu$ defined on $\\mathbb{X}$ is pushed forward to $\\nu = T_{\\#}\\mu$ on $\\mathbb{H}$ ." + ], + "image_footnote": [], + "bbox": [ + 326, + 164, + 669, + 276 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 GW Regularization", + "text_level": 1, + "bbox": [ + 215, + 369, + 421, + 383 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To effectively utilize HNNs for learning from data, extending the geometry-preserving embedding technique introduced in [16], we employ a regularized learning approach focused on preserving the intrinsic geometric structures of the input features onto hyperbolic spaces. This involves employing a cost function capable of comparing two measures across distinct geometric spaces.", + "bbox": [ + 212, + 392, + 782, + 467 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To bridge this gap, we consider the Gromov-Wasserstein (GW) distance [19] as it is adept at quantifying the similarity between probability distributions defined on distinct metric spaces. For two probability distributions $\\mu$ and $\\nu$ in a Euclidean feature space $\\mathbb{X}$ and a hyperbolic space $\\mathbb{H}$ , respectively, the GW distance is defined as:", + "bbox": [ + 212, + 467, + 784, + 542 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {G W} (\\mu , \\nu): := \\min _ {\\pi \\in \\Pi (\\mu , \\nu)} \\mathbb {E} _ {\\left((\\mathbf {x}, \\mathbf {y}), \\left(\\mathbf {x} ^ {\\prime}, \\mathbf {y} ^ {\\prime}\\right)\\right) \\sim \\pi^ {2}} \\left[ \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) - c _ {\\mathbb {H}} \\left(\\mathbf {y}, \\mathbf {y} ^ {\\prime}\\right) \\right| ^ {2} \\right] \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 272, + 546, + 784, + 575 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $c_{\\mathbb{X}}$ and $c_{\\mathbb{H}}$ represent the cost functions in the two spaces, and $\\varPi(\\mu,\\nu)$ denotes the set of transport plans between $\\mu$ and $\\nu$ , which contains all joint distributions whose first and second marginals are given by $\\mu$ and $\\nu$ , respectively. By comparing the pairwise distances between two probability distributions to evaluate the similarity of geometric structures across different metric spaces.", + "bbox": [ + 212, + 583, + 782, + 657 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "When working with HNNs, an explicit map $T$ from $\\mathbb{X}$ to $\\mathbb{H}$ is induced by the HNN layers, as illustrated in Fig. 2. The minimization problem presented in (8) can be reformulated as a Gromov-Monge (GM) distance minimization problem concerning a map $T$ , defined as", + "bbox": [ + 212, + 659, + 782, + 719 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {G M} (\\mu , \\nu) := \\min _ {T _ {\\#} \\mu = \\nu} \\underset {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim \\mu^ {2}} {\\mathbb {E}} \\left[ \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) - c _ {\\mathbb {H}} \\left(T (\\mathbf {x}), T \\left(\\mathbf {x} ^ {\\prime}\\right)\\right) \\right| ^ {2} \\right]. \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 282, + 726, + 784, + 753 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In an HNN, when embedding the probability distribution $\\mu$ from a Euclidean space to a hyperbolic space, we can consider minimizing the following cost over $T\\in \\mathcal{H}$ , where $\\mathcal{H}$ is a hypothesis class determined by the HNN:", + "bbox": [ + 212, + 761, + 782, + 806 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {G M} (T; \\mu) := \\underset {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim \\mu^ {2}} {\\mathbb {E}} \\left[ \\left| c _ {\\mathbb {X}} (\\mathbf {x}, \\mathbf {x} ^ {\\prime}) - c _ {\\mathbb {H}} (T (\\mathbf {x}), T (\\mathbf {x} ^ {\\prime})) \\right| ^ {2} \\right]. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 303, + 813, + 784, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/d6ec6beb4b8a11c607571c42ac4bf2a3e5b98a47e5b92a66752c73fd707fe74f.jpg", + "image_caption": [ + "Fig. 3: The framework of our GW regularization." + ], + "image_footnote": [], + "bbox": [ + 285, + 157, + 738, + 272 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Thus, we have $\\min_{T\\in \\mathcal{H}}\\mathrm{GM}(\\mu ,T_{\\#}\\mu) = \\min_{T\\in \\mathcal{H}}\\mathrm{GM}(T;\\mu)$ . While the GM problem described in (9) is highly challenging due to its pushforward constraint, minimizing the cost function in (10) is comparatively easier, as it does not require the pushforward constraint.", + "bbox": [ + 212, + 349, + 782, + 409 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In practical implementation, we can employ the simple cost function $c_{\\mathbb{X}}(\\mathbf{x}, \\mathbf{x}^{\\prime}) = \\| \\mathbf{x} - \\mathbf{x}^{\\prime} \\|^{2}$ or other cost functions such as $c_{\\mathbb{X}}(\\mathbf{x}, \\mathbf{x}^{\\prime}) = \\log \\left(1 + \\| \\mathbf{x} - \\mathbf{x}^{\\prime} \\|^{2}\\right)$ . Additionally, the explicit form of $c_{\\mathbb{H}}$ can be derived from equations (4) and (7): we can use $c_{\\mathbb{H}} = d_{\\mathbb{H}}^{c}$ or $c_{\\mathbb{H}} = \\log \\left(1 + d_{\\mathbb{H}}^{c}\\right)$ , where $\\mathbb{H} = \\mathbb{B}$ or $\\mathbb{H} = \\mathbb{L}$ .", + "bbox": [ + 212, + 410, + 795, + 478 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "When we have data points $\\{\\mathbf{x}_i\\}_{i=1}^m$ sampled independently and identically distributed (i.i.d.) from $\\mu$ , we consider an empirical version of the GM distance, namely,", + "bbox": [ + 212, + 479, + 784, + 523 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {G M} (T; \\left\\{\\mathbf {x} _ {i} \\right\\} _ {i = 1} ^ {m}) = \\frac {1}{m (m - 1)} \\sum_ {i, j = 1} ^ {m} \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x} _ {i}, \\mathbf {x} _ {j}\\right) - c _ {\\mathbb {H}} \\left(T \\left(\\mathbf {x} _ {i}\\right), T \\left(\\mathbf {x} _ {j}\\right)\\right) \\right| ^ {2}. \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 245, + 535, + 784, + 575 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The overall framework of our GW regularization is shown in Fig. 3. Here, $\\{\\mathbf{x}_i\\}_{i=1}^m$ are the Euclidean features that are fed into the HNN layers denoted by $T$ , $\\{\\mathbf{z}_i\\}_{i=1}^m$ are the hyperbolic representations so that $\\mathbf{z}_i = T(\\mathbf{x}_i)$ for each $i$ . The GM distance, calculated according to (11), is used as a penalty term, multiplied with a hyperparameter $\\beta$ and then added to the loss function associated with the specific task.", + "bbox": [ + 214, + 588, + 787, + 679 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Generalization analysis In the tasks we consider, the ability to generalize beyond the given data points is essential. Although (11) only provides a formulation based on the training data, we anticipate that it will serve as an effective approximation of (10), provided that the training set $\\{\\mathbf{x}_i\\}_{i=1}^m$ adequately captures the characteristics of the underlying distribution $\\mu$ . This expectation is encapsulated in the theorem we present below, which formalizes the relationship between the pointwise formulation and its distributional approximation under the condition of a representative sample.", + "bbox": [ + 212, + 703, + 787, + 825 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Hyperbolic Reps via GW Reg", + "bbox": [ + 457, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 1. Given cost functions $c_{\\mathbb{X}}$ and $c_{\\mathbb{H}}$ , suppose that there exists a constant $0 < \\alpha \\leq 1$ for which $T$ satisfies the following bi-Lipschitz condition:", + "bbox": [ + 215, + 146, + 787, + 176 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\alpha c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) \\leq c _ {\\mathbb {H}} \\left(T (\\mathbf {x}), T \\left(\\mathbf {x} ^ {\\prime}\\right)\\right) \\leq \\frac {1}{\\alpha} c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right), \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 348, + 186, + 785, + 214 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "for any $\\mathbf{x},\\mathbf{x}^{\\prime}\\in \\mathbb{X}$ . Let $\\mu$ be a distribution defined on $\\mathbb{X}$ and $\\{\\mathbf{x}_i\\}_{i = 1}^m$ be i.i.d. sampled from $\\mu$ . Then,", + "bbox": [ + 212, + 222, + 782, + 253 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\left| \\operatorname {G M} \\left(T; \\left\\{\\mathbf {x} _ {i} \\right\\} _ {i = 1} ^ {m}\\right) - \\operatorname {G M} (T; \\mu) \\right| \\leq C \\frac {(1 / \\alpha - 1) ^ {2}}{R ^ {2}} \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 338, + 262, + 785, + 292 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "holds with probability at least $1 - 2\\exp \\left(-\\frac{mC}{8R^4}\\right)$ where $C$ is a constant depending on $\\mu$ and $R\\coloneqq \\max_{\\mathbf{x},\\mathbf{x}^{\\prime}\\in \\mathrm{supp}(\\mu)}c_{\\mathbb{X}}(\\mathbf{x},\\mathbf{x}^{\\prime})$", + "bbox": [ + 214, + 301, + 785, + 351 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The proof of Theorem 1 is presented in the appendix.", + "bbox": [ + 238, + 358, + 627, + 375 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Complexity analysis Since the time complexity for calculating each Euclidean distance is $O(n)$ and the time complexity for calculating each hyperbolic distance (in either the Poincaré ball model or the Lorentz model) is $O(n)$ , the time complexity for calculating the GW regularization term is $O(nm^2)$ .", + "bbox": [ + 214, + 393, + 785, + 455 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Note that, if we only consider linear layers in an $L$ -layer Vanilla HNN, the time complexity is $O(mn^{2}L)$ . In the few-shot learning task and the semi-supervised graph node-level tasks that we consider in this paper, the number of data points $m$ is usually smaller than or comparable with $n$ . Moreover, in tasks such as link prediction, one also needs to compare pairs of data points, leading to a time complexity of $O(mn^{2}L)$ in computing the task loss. Therefore, adding the regularization term will not lead to change of the order of time complexity.", + "bbox": [ + 212, + 455, + 787, + 561 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 583, + 375, + 599 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To validate the effectiveness of the GW regularization method, we conduct experiments on both image datasets and graph datasets. We present results on few-shot image classification in Section 4.1 and results on graph node classification and link prediction in Section 4.2. All the presented experiments are implemented on a server with RTX 4090 (24GB) GPUs, where each implementation runs on a single GPU. The implementation of our proposed methods can be accessed at https://github.com/yyf1217/GW-Regularization.", + "bbox": [ + 212, + 613, + 787, + 720 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Few-Shot Image Classification", + "text_level": 1, + "bbox": [ + 215, + 739, + 511, + 756 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We consider the important task of few-shot image classification where the goal is to recognize new categories with very few labeled examples per class. Unlike supervised image classification, this task aims to generalize from a small number of examples, typically one to five images per class. Learning structures of images is crucial since there is very limited labeled data.", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/04748d46788b31df74ddaa321fb60648eb3f263939cd8c7236853d96b91a11ba.jpg", + "image_caption": [ + "Fig. 4: The framework of the GW regularized hyperbolic ProtoNet model." + ], + "image_footnote": [], + "bbox": [ + 223, + 152, + 779, + 289 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets We consider two widely used image datasets, namely MiniImageNet [36] and Caltech-UCSD Birds-200-2011 (CUB) [37]. These datasets have been used in [14], where the hyperbolic ProtoNet model excels Euclidean baselines. The MiniImageNet dataset is a subset of the ImageNet dataset [7]. It comprises images from 100 classes, with 600 images per class. The classes have a $64/16/20$ split for training/validation/test. The CUB dataset consists of 200 categories of bird images, totaling 11,788 pictures. In this dataset, the training/validation/test split is $100/50/50$ .", + "bbox": [ + 212, + 349, + 787, + 469 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Setting We apply our GW regularization on the hyperbolic ProtoNet model [14], which primarily consists of convolutional neural network (CNN) layers used for feature extraction from Euclidean image data and subsequent HNN layers for classification. In [14], the HNN layers are taken to be a simple exponential map from the Euclidean space to the Poincaré ball. In our implementation, we utilize the publicly available code for the hyperbolic ProtoNet model from https://github.com/leymir/hyperbolic-image-embeddings.", + "bbox": [ + 212, + 492, + 787, + 598 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For clarity, we illustrate the framework for this task in Fig. 4, which is based on Fig. 3. We take the features $\\{\\mathbf{x}_i\\}_{i=1}^m$ from the output of the CNN layers, and then the HNN layers process them into $\\{\\mathbf{z}_i\\}_{i=1}^m$ . Following this, the hyperbolic distance between each hyperbolic embedding $\\mathbf{z}_i$ and the origin of the Poincaré ball is computed according to (4), which is then used to calculate the maximum class probability. Finally, the cross-entropy loss is computed using the maximum class probability and the labels. We add $\\beta \\mathrm{GM}(T; \\{\\mathbf{x}_i\\}_{i=1}^m)$ to the cross-entropy loss to formulate our regularized loss function.", + "bbox": [ + 212, + 598, + 787, + 718 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We consider various CNN architectures including Conv4, ResNet10, ResNet12, and ResNet18. The HNN layers within the model incorporate linear layers from [10]. Additionally, ReLU is used as the activation function across the model. For Conv4, the embedding dimension is set to 1,600, while for ResNet10, ResNet12, and ResNet18, the embedding dimension is set to 512. The initial learning rate is 0.001. We consider both the 1-Shot 5-Way and 5-Shot 5-Way settings, which means there are five classes involved for the task and only one/five examples per class for training. In all experiments for the 1-Shot 5-Way task, a consistent", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Hyperbolic Reps via GW Reg", + "bbox": [ + 457, + 114, + 732, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/59c199a1737b97e4afbf120c097508759d254fe3d0e18f1568beba014facdc10.jpg", + "table_caption": [ + "Table 1: Hyperparameters used in few-shot image classification. \"ResNet\" abbreviated as \"Res\" due to space constraints." + ], + "table_footnote": [], + "table_body": "
Initial learning rate (lr)β
Conv4Res10Res12Res18Conv4Res10Res12Res18
MiniImageNet1-Shot 5-Way0.00050.0010.0010.0010.60.50.10.7
5-Shot 5-Way0.010.0010.0010.001140.10.50.5
CUB1-Shot 5-Way0.0010.0010.0010.0010.020.0150.150.1
5-Shot 5-Way0.010.0010.0010.0010.070.010.250.1
", + "bbox": [ + 259, + 196, + 743, + 297 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "curvature parameter of $-0.08$ is employed. Similarly, for the 5-Shot 5-Way task, we uniformly set the curvature to $-0.01$ throughout all experiments. Both curvatures agree with the recommended settings in the original hyperbolic ProtoNet. The hyperparameter $\\beta$ is selected according to the validation set. We report the initial learning rate as well as the best $\\beta$ in Table 1.", + "bbox": [ + 212, + 338, + 784, + 412 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results We present our numerical results for both the 1-Shot 5-Way and 5-Shot 5-Way settings in Table 2. We randomly sample 10,000 data points from the test set to evaluate the performance of the model and report $95\\%$ confidence intervals for all results. Each entry reports the average classification accuracy, including means and standard deviations.", + "bbox": [ + 212, + 438, + 784, + 513 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/60a5b879d42675a76749636b1c9b48422352223f8a4b3a5ee54e5ff85f6fb11d.jpg", + "table_caption": [ + "Table 2: Accuracy (%) results for few-shot image classification." + ], + "table_footnote": [], + "table_body": "
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv453.77±0.2071.33±0.1664.66±0.2380.29±0.16
Conv4+GW55.57±0.2273.04±0.1668.67±0.2380.54±0.16
ResNet1056.45±0.2165.39±0.1772.01±0.2280.75±0.15
ResNet10+GW57.50±0.2267.62±0.1772.67±0.2283.73±0.14
ResNet1255.96±0.2270.32±0.1775.77±0.2282.90±0.15
ResNet12+GW56.95±0.2273.04±0.1677.24±0.2185.66±0.14
ResNet1857.04±0.2268.43±0.1671.86±0.2285.31±0.13
ResNet18+GW58.51±0.2271.64±0.1672.64±0.2285.83±0.13
", + "bbox": [ + 256, + 579, + 746, + 739 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "From the results, we observe that our GW regularization consistently boosts the accuracy of the model. This improvement is evident in both datasets and both scenarios, regardless of the underlying CNN architecture. For most CNN architectures, the improvement is more evident in the 5-Shot 5-Way scenario", + "bbox": [ + 212, + 779, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "than in the 1-Shot 5-Way scenario. We believe that this can be attributed to the increased number of training instances available in the 5-Shot scenario, which provides a richer structure that GW regularization can leverage.", + "bbox": [ + 218, + 146, + 782, + 191 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Runtime We report the average run time for training one epoch in Table 3. As anticipated, incorporating GW regularization results in extended epoch training times. However, the increase in runtime is not significant, aligning with the time complexity analysis in Section 3.2. This observation underscores the efficiency of our GW regularization approach, ensuring that the added computational demand does not impose a significant burden on the overall training process.", + "bbox": [ + 218, + 212, + 782, + 303 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/418c41b695251ce8ef5e871d386ab01bfa4b3a3b3417e2f7e247ed2756a0e49c.jpg", + "table_caption": [ + "Table 3: Average runtime (in seconds) for training one epoch in few-shot image classification." + ], + "table_footnote": [], + "table_body": "
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv431.225.232.432.9
Conv4+GW33.626.435.132.9
ResNet1037.228.838.434.9
ResNet10+GW40.834.843.238.4
ResNet1242.036.046.842.0
ResNet12+GW45.640.850.445.6
ResNet1855.243.260.052.8
ResNet18+GW57.649.262.457.6
", + "bbox": [ + 256, + 380, + 743, + 537 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.2 Semi-Supervised Link Prediction and Node Classification", + "text_level": 1, + "bbox": [ + 218, + 599, + 730, + 614 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We consider graph link prediction and node classification, which are widely benchmarked semi-supervised tasks in graph deep learning literature.", + "bbox": [ + 218, + 622, + 782, + 652 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Datasets We consider nine datasets for node classification, namely Cora, Disease, Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor. For the first three datasets, namely Disease, Airport, and Cora, we also perform link prediction. We briefly introduce the datasets in the appendix and summarize the statistics of the graphs in Table 4.", + "bbox": [ + 218, + 672, + 782, + 748 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In link prediction tasks, we randomly split edges into $85\\% / 5\\% / 10\\%$ for training, validation, and test sets. For node classification tasks, we use a $70\\% / 15\\% / 15\\%$ splits for Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor, we use $30\\% / 10\\% / 60\\%$ splits for Disease, and we use standard splits with 20 train examples per class for Cora. The above split settings agree with standard settings in the baseline papers.", + "bbox": [ + 218, + 750, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Hyperbolic Reps via GW Reg", + "bbox": [ + 459, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/54f9b7da680aeed29959f098f6f8b93748ab0aa18eda4a9e0252cbcb009a6cd2.jpg", + "table_caption": [ + "Table 4: Statistics of graph datasets." + ], + "table_footnote": [], + "table_body": "
Disease-LPDisease-NCAirportCoraCornellTexasWisconsinChameleonSquirrelActor
# nodes2,6651,0443,1882,7081831832512,2775,2017,600
# edges2,2652,26515,8374,48828029546631,421198,49326,752
# features111,000111,4331,7031,7031,7032,3252,089931
# classesN/A247555555
", + "bbox": [ + 215, + 171, + 802, + 239 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Setting For the graph datasets, we consider the following three HNNs: the vanilla HNN [10], HGCN [5], and HyboNet [6]. We utilize the publicly available code for HNN and HGCN from https://github.com/HazyResearch/hgcn and HyboNet from https://github.com/chenweize1998/fully-hyperbolic-nn.", + "bbox": [ + 212, + 272, + 782, + 333 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For each model, we apply GW distance to the input node features and their hyperbolic representations after applying the Euclidean-to-hyperbolic operation. The regularization framework is the same as Fig. 3.", + "bbox": [ + 212, + 335, + 784, + 381 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In these experiments, the HNN models share a common architecture consisting of HNN layers and output layers. These models employ different HNN layers to extract features from graph data and generate hyperbolic embeddings $\\{\\mathbf{z}_i\\}_{i=1}^m$ . Specifically, the Vanilla HNN and HGCN employ the Poincaré model to build linear layers and activation. HGCN also has aggregation operation, facilitating message passing. Differently, HyboNet employs the linear layers and aggregation in the Lorentz model. The output layers are used to accomplish various tasks. For node classification, the obtained hyperbolic embeddings are directly projected to the Euclidean space. A linear layer is then used to predict the class probabilities, with which the negative log-likelihood loss is computed. For link prediction, the hyperbolic distances between the hyperbolic embeddings are computed. Subsequently, the Fermi-Dirac algorithm [15] is employed to transform the hyperbolic distances into the edge probabilities. Finally, cross-entropy losses are computed using these edge probabilities and the true edge labels.", + "bbox": [ + 212, + 383, + 787, + 595 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For simplicity, the curvature of the hyperbolic space is set as $-1$ for all experiments, which is a common setting for graph datasets. Tables 5 and 6 list hyperparameters such as initial learning rate, the number of the HNN layers, weight decay, dropout, and embedding dimensions. The hyperparameter $\\beta$ from validation is also listed for different datasets.", + "bbox": [ + 212, + 598, + 787, + 674 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/b77797134bd46494242b501face038d7e6bc856096342c81005e105cf5ad1696.jpg", + "table_caption": [ + "Table 5: Hyperparameters used in the Vanilla HNN and HGCN." + ], + "table_footnote": [], + "table_body": "
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNC
Initial lr0.010.010.010.010.010.010.010.010.010.010.010.01
# layers222222222222
Weight decay0.00.0010.00050.00.0050.0010.0010.0010.0010.0010.0010.001
Dropout0.00.10.00.00.50.50.50.50.50.50.50.5
# embeddings316161616161616161655
HNN β0.90.0821.250.50.350.250.10.150.020.0010.03
HGCN β0.30.0921.50.10.60.250.150.20.080.010.03
", + "bbox": [ + 215, + 729, + 800, + 838 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/54216acaf5beb479e989d522d03211ad30a26a9c3e4d409c4c2016e6a9724a30.jpg", + "table_caption": [ + "Table 6: Hyperparameters used in HyboNet." + ], + "table_footnote": [], + "table_body": "
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNCNCNCNCNCNC
Initial lr0.0050.0050.010.020.020.020.0050.0050.0050.0050.0050.0050.0050.010.010.01
# layers2426232222222222
Weight decay0.00.00.00.00010.0010.010.00.00.00.00.00.00.00.0010.0010.001
Dropout0.00.10.00.00.70.90.20.20.20.20.20.20.20.20.20.2
# embeddings16161616161616161616161616161616
β0.30.071.51.10.250.250.130.10.10.11.31.32.50.010.010.01
", + "bbox": [ + 215, + 170, + 802, + 270 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Results For the link prediction task, we report the AUC scores in Table 7. For the node classification task, we report the F1 scores, in Table 8. Each score reports the average from three random runs as well as the standard deviation. For clarity, we just use \"HNN\" in place of the Vanilla HNN in the tables.", + "bbox": [ + 212, + 318, + 787, + 380 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/48081118b23b1d88cf1f874634aeb522669b4581224f2f375d1c5927dbb8e6f5.jpg", + "table_caption": [ + "Table 7: AUC (%) results of the link prediction task." + ], + "table_footnote": [], + "table_body": "
DiseaseAirportCora
HNN92.83±1.8393.56±0.3088.80±1.29
HNN+GW94.45±0.5894.23±0.3389.76±2.07
HGCN92.41±1.7893.42±0.1593.37±0.15
HGCN+GW93.79±1.1595.81±0.0293.48±0.22
HYBONET95.65±0.5796.18±0.0592.04±0.37
HYBONET+GW96.58±0.5796.44±0.0293.33±0.22
", + "bbox": [ + 323, + 430, + 679, + 547 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "From Table 7, it is evident that our GW regularization consistently enhances the AUC scores across different network architectures and across all datasets. Similarly, Table 8 showcases that GW regularization again demonstrates a positive impact on model performance across various datasets and architectures. In many scenarios of node classification, GW regularization actually achieves substantial improvement, such as HNN+GW for Disease, HGCN+GW for Cornell and HyboNet+GW for Wisconsin.", + "bbox": [ + 212, + 573, + 787, + 679 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Runtime We report the average run time for training one epoch for link prediction in Table 9. Similarly to the previous experiment, the runtime for GW regularized training is longer, but not significantly. This again aligns with the complexity analysis in Section 3.2.", + "bbox": [ + 212, + 699, + 787, + 761 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 214, + 780, + 359, + 796 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In this paper, we have delved into the integration of the GW distance as a novel regularization term within the realms of hyperbolic neural networks, with a par-", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Hyperbolic Reps via GW Reg", + "bbox": [ + 459, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/bc8a3c2e7b34257bed1109afa7800ac7f0be1883abeebcc5507bbdd76f995f52.jpg", + "table_caption": [ + "Table 8: F1 (%) result of the node classification task." + ], + "table_footnote": [], + "table_body": "
DiseaseAirportCoraChameleonSquirrel
HNN58.40±2.5387.40±1.3453.73±0.9171.43±1.6347.89±2.21
HNN+GW65.62±1.9889.38±0.6755.33±0.3572.53±0.1949.44±1.05
HGCN93.04±1.6486.96±0.2279.47±1.0177.72±0.9051.79±0.58
HGCN+GW95.28±0.4087.91±0.7280.00±0.6279.18±1.6452.70±1.24
HYBONET85.70±0.6093.13±0.1973.53±0.7582.05±0.5574.04±2.42
HYBONET+GW87.66±1.2194.46±0.2079.40±0.9583.58±0.2877.27±0.78
CornellTexasWisconsinActor
HNN93.94±1.3194.69±1.3193.21±3.8642.63±1.73
HNN+GW95.45±2.2896.97±1.3298.15±1.8545.03±1.73
HGCN83.33±3.4778.79±4.7375.31±2.8336.39±1.00
HGCN+GW88.64±2.2881.82±3.9483.33±1.8639.19±0.67
HYBONET78.79±4.7367.42±3.4774.07±1.8645.74±2.13
HYBONET+GW81.82±3.9374.24±1.3180.87±3.8649.64±0.38
", + "bbox": [ + 246, + 171, + 756, + 400 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/8d0c9f40d3b1c1e4f9063dc88db49257cdea806af39134435c460d0e479fca4b.jpg", + "table_caption": [ + "Table 9: Average runtime (in seconds) for training one epoch in link prediction." + ], + "table_footnote": [], + "table_body": "
DiseaseAirportCora
HNN0.03010.08810.0549
HNN+GW0.03130.08840.0563
HGCN0.04890.10750.0743
HGCN+GW0.05050.10780.0747
HYBONET0.03010.06310.0374
HYBONET+GW0.03230.06390.0379
", + "bbox": [ + 362, + 448, + 638, + 564 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "ticular emphasis on leveraging the GM formulation. This approach has allowed for a sophisticated comparison of distributions across the Euclidean space and the hyperbolic space, capturing the essence of the underlying structures while not increasing the order of the time complexity. We have demonstrated that the hyperbolic embeddings of the data points resonate closely with distributions where they are sampled from.", + "bbox": [ + 212, + 602, + 784, + 694 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Our regularization method has been rigorously tested and validated across diverse datasets including image data for the few-shot classification task and graph data for the semi-supervised link prediction and node classification tasks, showcasing a uniform elevation in performance metrics.", + "bbox": [ + 212, + 698, + 784, + 758 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Our future work involves more efficient methods in large scale settings, where the number of instances is much larger than feature dimensions. Additionally, we are intrigued by the potential of integrating our GW regularization framework with emerging geometric deep learning architectures for complex data structures, where the flexibility with the choice of underlying spaces is crucial.", + "bbox": [ + 212, + 763, + 785, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement", + "text_level": 1, + "bbox": [ + 217, + 143, + 392, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "YY and DZ acknowledge funding from National Natural Science Foundation of China (NSFC) under award number 12301117, WL acknowledges funding from the National Institute of Standards and Technology (NIST) under award number 70NANB22H021, and GL acknowledges funding from NSF award DMS 2124913.", + "bbox": [ + 215, + 172, + 785, + 233 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 253, + 321, + 270 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Alvarez-Melis, D., Jaakkola, T.S.: Gromov-Wasserstein alignment of word embedding spaces. arXiv preprint arXiv:1809.00013 (2018)", + "2. Atigh, M.G., Schoep, J., Acar, E., van Noord, N., Mettes, P.: Hyperbolic image segmentation. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)", + "3. Bachmann, G., Bécigneul, G., Ganea, O.: Constant curvature graph convolutional networks. In: Int. Conf. Mach. Learn. pp. 486-496. PMLR (2020)", + "4. Bunne, C., Alvarez-Melis, D., Krause, A., Jegelka, S.: Learning generative models across incomparable spaces. In: Int. Conf. Mach. Learn. pp. 851-861. PMLR (2019)", + "5. Chami, I., Ying, Z., Ré, C., Leskovec, J.: Hyperbolic graph convolutional neural networks. Adv. Neural Inform. Process. Syst. 32, 4868-4879 (2019)", + "6. Chen, W., Han, X., Lin, Y., Zhao, H., Liu, Z., Li, P., Sun, M., Zhou, J.: Fully hyperbolic neural networks. In: Annu. Meeting Assoc. Comput. Linguistics. pp. 5672-5686 (2022)", + "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009)", + "8. Dumont, T., Lacombe, T., Vialard, F.X.: On the existence of Monge maps for the Gromov-Wasserstein problem (2022)", + "9. Fan, X., Yang, C.H., Vemuri, B.C.: Nested hyperbolic spaces for dimensionality reduction and hyperbolic NN design. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)", + "10. Ganea, O., Bécigneul, G., Hofmann, T.: Hyperbolic neural networks. Adv. Neural Inform. Process. Syst. 31, 5345-5355 (2018)", + "11. Gulcehre, C., Denil, M., Malinowski, M., Razavi, A., Pascanu, R., Hermann, K.M., Battaglia, P., Bapst, V., Raposo, D., Santoro, A., de Freitas, N.: Hyperbolic attention networks. In: Int. Conf. Learn. Represent. (2019), https://openreview.net/forum?id=rJxHsjRqFQ", + "12. Guo, Y., Guo, H., Yu, S.X.: Co-SNE: Dimensionality reduction and visualization for hyperbolic data. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)", + "13. Huang, Y., Zhang, T., Zhu, H.: Improving word alignment by adding Gromov-Wasserstein into attention neural network. In: J. Phys. Conf. Ser. vol. 2171, p. 012043. IOP Publishing (2022)", + "14. Khrulkov, V., Mirvakhabova, L., Ustinova, E., Oseledets, I., Lempitsky, V.: Hyperbolic image embeddings. In: IEEE Conf. Comput. Vis. Pattern Recog. (2020)", + "15. Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguná, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)", + "16. Lee, W., Yang, Y., Zou, D., Lerman, G.: Monotone generative modeling via a gromov-monge embedding. arXiv e-prints (2023)", + "17. Li, X., Qiu, Z., Zhao, X., Wang, Z., Zhang, Y., Xing, C., Wu, X.: Gromov-Wasserstein guided representation learning for cross-domain recommendation. In: ACM Int. Conf. Inf. Knowl. Manage. pp. 1199-1208 (2022)" + ], + "bbox": [ + 218, + 282, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Hyperbolic Reps via GW Reg", + "bbox": [ + 457, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Liu, Q., Nickel, M., Kiela, D.: Hyperbolic graph neural networks. Adv. Neural Inform. Process. Syst. 32, 8230-8241 (2019)", + "19. Mémoli, F.: On the use of Gromov-Hausdorff distances for shape comparison. In: PBG@Eurographics (2007)", + "20. Mémoli, F.: Gromov-Wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11, 417-487 (2011)", + "21. Mémoli, F., Needham, T.: Distance distributions and inverse problems for metric measure spaces. Stud. Appl. Math. 149(4), 943-1001 (2022)", + "22. Nakagawa, N., Togo, R., Ogawa, T., Haseyama, M.: Gromov-Wasserstein autoencoders. In: Int. Conf. Learn. Represent. (2023), https://openreview.net/forum?id=sbS10BCtC7", + "23. Nickel, M., Kiela, D.: Poincaré embeddings for learning hierarchical representations. Adv. Neural Inform. Process. Syst. 30 (2017)", + "24. Nickel, M., Kiela, D.: Learning continuous hierarchies in the lorentz model of hyperbolic geometry. In: Int. Conf. Mach. Learn. (2018)", + "25. Nikolentzos, G., Chatzianastasis, M., Vazirgiannis, M.: Weisfeiler and Leman go hyperbolic: Learning distance preserving node representations. In: Int. Conf. Artif. Intell. Statist. pp. 1037-1054 (2023)", + "26. Peng, W., Varanka, T., Mostafa, A., Shi, H., Zhao, G.: Hyperbolic deep neural networks: A survey. IEEE Trans. Pattern Anal. Mach. Intell. (December 2021)", + "27. Peyre, G., Cuturi, M., Solomon, J.: Gromov-Wasserstein averaging of kernel and distance matrices. In: Int. Conf. Mach. Learn. pp. 2664-2672. PMLR (2016)", + "28. Sala, F., De Sa, C., Gu, A., Ré, C.: Representation tradeoffs for hyperbolic embeddings. In: Int. Conf. Mach. Learn. (2018)", + "29. Sarkar, R.: Low distortion delaunay embedding of trees in hyperbolic plane. In: Int. Symp. Graph Drawing. pp. 355-366. Springer (2011)", + "30. Schmitzer, B., Schnörr, C.: Modelling convex shape priors and matching based on the Gromov-Wasserstein distance. J. Math. Imaging Vision 46, 143-159 (2013)", + "31. Shimizu, R., Mukuta, Y., Harada, T.: Hyperbolic neural networks++. In: Int. Conf. Learn. Represent. (2021)", + "32. Sonthalia, R., Gilbert, A.: Tree! I am no tree! I am a low dimensional hyperbolic embedding. Adv. Neural Inform. Process. Syst. 33, 845-856 (2020)", + "33. Sturm, K.T.: The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces, vol. 290. American Mathematical Society (2023)", + "34. Tifrea, A., Bécigneul, G., Ganea, O.E.: Poincaré glove: Hyperbolic word embeddings. In: Int. Conf. Learn. Represent. (2018)", + "35. Titouan, V., Flamary, R., Courty, N., Tavenard, R., Chapel, L.: Sliced Gromov-Wasserstein. Adv. Neural Inform. Process. Syst. 32 (2019)", + "36. Vinyals, O., Blundell, C., Lillicrap, T., Wierstra, D., et al.: Matching networks for one shot learning. Adv. Neural Inform. Process. Syst. 29 (2016)", + "37. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The Caltech-UCSD birds-200-2011 dataset (2011)", + "38. Xu, H., Luo, D., Carin, L.: Scalable Gromov-Wasserstein learning for graph partitioning and matching. Adv. Neural Inform. Process. Syst. 32 (2019)", + "39. Xu, H., Luo, D., Zha, H., Carin, L.: Gromov-Wasserstein learning for graph matching and node embedding. In: Int. Conf. Mach. Learn. pp. 6932-6941. PMLR (2019)", + "40. Yang, M., Zhou, M., Li, Z., Liu, J., Pan, L., Xiong, H., King, I.: Hyperbolic graph neural networks: A review of methods and applications (2022)", + "41. Zhou, Y., Sharpee, T.O.: Hyperbolic geometry of gene expression. Iscience 24(3) (2021)" + ], + "bbox": [ + 215, + 146, + 784, + 829 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Yang et al.", + "bbox": [ + 271, + 114, + 367, + 128 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_model.json b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_model.json new file mode 100644 index 0000000000000000000000000000000000000000..6d4a9c48f39728c8287ddb0acf04090cd575f6be --- /dev/null +++ b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_model.json @@ -0,0 +1,2245 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.26, + 0.141, + 0.745, + 0.187 + ], + "angle": 0, + "content": "Improving Hyperbolic Representations via Gromov-Wasserstein Regularization" + }, + { + "type": "text", + "bbox": [ + 0.25, + 0.212, + 0.756, + 0.229 + ], + "angle": 0, + "content": "Yifei Yang\\(^{1}\\), Wonjun Lee\\(^{2}\\), Dongmian Zou\\(^{3}\\), and Gilad Lerman\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.334, + 0.239, + 0.671, + 0.254 + ], + "angle": 0, + "content": "1 Wuhan University, Wuhan, Hubei 430072, China" + }, + { + "type": "text", + "bbox": [ + 0.435, + 0.256, + 0.568, + 0.268 + ], + "angle": 0, + "content": "yflyang@whu.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.313, + 0.268, + 0.692, + 0.282 + ], + "angle": 0, + "content": "\\(^{2}\\) University of Minnesota, Minneapolis, MN 55455, USA" + }, + { + "type": "text", + "bbox": [ + 0.405, + 0.284, + 0.6, + 0.295 + ], + "angle": 0, + "content": "{lee01273,lerman}@umn.edu" + }, + { + "type": "text", + "bbox": [ + 0.296, + 0.296, + 0.708, + 0.309 + ], + "angle": 0, + "content": "\\(^{3}\\) Duke Kunshan University, Kunshan, Jiangsu 215316, China" + }, + { + "type": "text", + "bbox": [ + 0.42, + 0.311, + 0.584, + 0.324 + ], + "angle": 0, + "content": "dongmian.zou@duke.edu" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.358, + 0.744, + 0.581 + ], + "angle": 0, + "content": "Abstract. Hyperbolic representations have shown remarkable efficacy in modeling inherent hierarchies and complexities within data structures. Hyperbolic neural networks have been commonly applied for learning such representations from data, but they often fall short in preserving the geometric structures of the original feature spaces. In response to this challenge, our work applies the Gromov-Wasserstein (GW) distance as a novel regularization mechanism within hyperbolic neural networks. The GW distance quantifies how well the original data structure is maintained after embedding the data in a hyperbolic space. Specifically, we explicitly treat the layers of the hyperbolic neural networks as a transport map and calculate the GW distance accordingly. We validate that the GW distance computed based on a training set well approximates the GW distance of the underlying data distribution. Our approach demonstrates consistent enhancements over current state-of-the-art methods across various tasks, including few-shot image classification, as well as semi-supervised graph link prediction and node classification." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.592, + 0.741, + 0.605 + ], + "angle": 0, + "content": "Keywords: Gromov-Wasserstein distance \\(\\cdot\\) Hyperbolic neural networks" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.606, + 0.571, + 0.62 + ], + "angle": 0, + "content": "·Few-shot learning \\(\\cdot\\) Semi-supervised learning" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.644, + 0.376, + 0.659 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.809 + ], + "angle": 0, + "content": "The success of many machine learning applications relies on effectively capturing the geometric intricacies of complex data structures. This challenge necessitates a careful selection of the underlying space that aligns with the inherent properties of data. In this context, hyperbolic spaces have emerged as a popular choice for modeling data with hierarchical structures such as lexical databases [23] and phylogenetic trees [28]. This is attributed to their distinctive capacity to embody exponential growth and branching patterns, a feature rooted in their constant negative curvature. Such a geometric framework can reflect the tree-like architectures that are ubiquitous across numerous real-world networks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.811, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Interestingly, hyperbolic spaces also play a significant role in computer vision [2, 14], particularly in tasks like image classification and object recognition" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.233, + 0.151, + 0.782, + 0.382 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.395, + 0.788, + 0.424 + ], + "angle": 0, + "content": "Fig. 1: Illustration of hierarchical structures in image data. The images are taken from the MiniImagenet dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.458, + 0.788, + 0.548 + ], + "angle": 0, + "content": "where hierarchical relationships among instances and concepts are common. For example, within the broader category of animals, there are dogs, which further subdivide into breeds such as bulldogs, Gordon setters, Newfoundland dogs, etc. This is illustrated in Fig. 1. Hyperbolic embeddings can capture these hierarchies, thereby potentially improving classification performance and providing more interpretable models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.551, + 0.788, + 0.808 + ], + "angle": 0, + "content": "In crafting hyperbolic representations from non-hyperbolic features, two main strategies emerge: principled design and data-driven learning. The principled approach, exemplified by methods like Sarkar's algorithm [29], focuses on constructing embeddings that rigorously preserve the inherent geometric structure from data. This method particularly excels at maintaining hierarchical relationships within the data, ensuring that the embedded representation reflects structure of the original dataset with low distortion. On the other hand, the data-driven approach leverages the capabilities of end-to-end neural networks to learn the hyperbolic embedding directly from data. Such neural networks are well-known as hyperbolic neural networks (HNNs), which are pioneered in [10]. HNNs prioritize the development of hyperbolically coherent neural operations that are expressive and mirror the Euclidean counterparts. When dealing with input that is primarily Euclidean, HNNs employ straightforward operations, such as exponential maps, to transition features into the hyperbolic space, thereafter learning to extract deep features in a manner driven by the data. This method adapts the embedding to specific tasks, potentially unveiling intricate patterns and relationships inherent within data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In our work, we aim to establish a methodology that integrates the benefits of low-distortion embedding into data-driven learning. In the context of learning" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.46, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Hyperbolic Reps via GW Reg" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.253 + ], + "angle": 0, + "content": "where generalization is the goal, we can view hyperbolic embedding as a method of embedding the data distribution into hyperbolic spaces. Therefore, we need to compare the distributions before and after the embedding. This necessitates a comparison of data distributions before and after embedding, which is complicated by the fundamental differences in geometric principles, such as curvature and dimensionality, that govern Euclidean and hyperbolic spaces. Direct comparisons between such disparate spaces are inherently complex and challenging." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.253, + 0.785, + 0.418 + ], + "angle": 0, + "content": "To address this challenge, we rely on the Gromov-Wasserstein (GW) distance [19], a tool proven effective in comparing distributions across diverse metric spaces. Specifically, we employ the Gromov-Monge (GM) formulation, an alternative form of the GW distance, to compute the explicit transport map between heterogeneous metric spaces. The HNN layers induce the embedding distribution, thus serving as the transport map. Consequently, the GM formulation is a more suitable approach for the corresponding HNN layers. However, implementing the GM distance poses computational challenges due to its complex constraints. Therefore, in light of this, we extend the GM-based embedding technique introduced in [16] to compute the geometry-preserving transport map from data distribution in Euclidean space to hyperbolic spaces." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.419, + 0.694, + 0.433 + ], + "angle": 0, + "content": "The contribution of the current work is summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.442, + 0.784, + 0.516 + ], + "angle": 0, + "content": "1. We propose a novel methodology that incorporates the GM distance into an end-to-end learning framework for hyperbolic representation learning. This approach ensures a more faithful representation of the intrinsic hierarchical structures. Moreover, we verify that our approach maintains computational efficiency by analyzing its time complexity." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.517, + 0.784, + 0.573 + ], + "angle": 0, + "content": "2. We validate that the embedding faithfully represents an embedding of distributions from the original domain by providing an upper bound for the sampling error. Therefore, regularization on the training sample generalizes to the underlying data distribution." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.577, + 0.784, + 0.62 + ], + "angle": 0, + "content": "3. We provide empirical evidence showing that our regularization strategy leads to consistent improvements over existing baseline methods when applied to datasets with hierarchical structures, including both image and graph data." + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.442, + 0.784, + 0.62 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.644, + 0.396, + 0.66 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Hyperbolic embedding The adoption of hyperbolic geometries for representing hierarchical connections between data points has attracted considerable attention. The exploration began when researchers considered low-distortion embedding of tree or tree-like graphs into the hyperbolic domain. In their seminal work, Sarkar [29] showed that a tree can be embedded into the Poincaré disk with arbitrarily low distortion. Sala et al. [28] generalized the embedding to high dimensional Poincaré balls and discussed embedding general graphs into trees. Sonthalia and Gilbert [32] bypassed the intermediary step of general graph structures, opting instead to directly infer tree architectures from the data itself. In addition to combinatorial methods, gradient-based methods are also used in hyperbolic embedding [23, 24]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.451 + ], + "angle": 0, + "content": "Hyperbolic neural networks More recently, the advancement in hyperbolic representation learning has evolved to be more closely aligned with specific end tasks and specific datasets, such as text [34], images [14], biology [41], molecular [18], and knowledge graph [6]. This has led to the emergence of hyperbolic neural networks (HNNs) as a preferred framework for learning their representations. Numerous HNN architectures have emerged [3, 5, 10, 11, 18, 24, 31]. Comprehensive surveys on HNN include [26, 40]. These HNNs define operations that conform with a choice of coordinate system in the hyperbolic space. However, when communicating between the Euclidean features and their hyperbolic embeddings, these HNNs take very simple approaches. For instance, Ganea et al. [10] directly used logarithmic and exponential maps at the origin, leading to unavoidable distortions. There are also very recent works addressing representations learned by HNNs. For instance, CO-SNE [12] reduces the dimensions of hyperbolic features for visualization, which is an analogy to t-SNE in the Euclidean domain. Parallel to this, Fan et al. [9] developed a systematic method for embedding data into nested hyperbolic spaces, which not only results in dimensionality reduction but also extends to design of HNNs. Nikolentzos et al. [25] applied the Weisfeiler-Leman algorithm to capture hierarchy in data and built HNNs accordingly. However, none of the above methods have considered comparing distributions before and after embedding into the hyperbolic space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.471, + 0.788, + 0.685 + ], + "angle": 0, + "content": "GW distance GW distance, a variant of optimal transport distance, has been widely utilized to quantify structural differences between different distributions. Memoli provided a detailed introduction and study of GW distance in [19, 20]. Subsequently, Sturm [33] presented a more in-depth mathematical exposition of GW distance, focusing on its geodesic structure and gradient flow. Following these foundational works, GW distance has found applications in various fields, including computer vision [27, 30], recommendation systems [17], natural language processing [1], generative models [4, 16, 22, 35]. In particular, Lee et al. [16] employed the GM formulation to achieve geometry-preserving dimension reduction within a generative modeling framework. The discussion on the GM formulation can also be traced to [8, 21]. Moreover, GW distance has been applied to specific data types such as graphs [38, 39] and specific neural network architectures such as transformers [13]. To the best of our knowledge, GW distance has not yet been explored in the context of hyperbolic neural networks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.707, + 0.381, + 0.725 + ], + "angle": 0, + "content": "3 Methodology" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.739, + 0.58, + 0.755 + ], + "angle": 0, + "content": "3.1 Preliminaries of Hyperbolic Geometry" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Hyperbolic geometry, characterized by its constant negative curvature, represents a non-Euclidean geometry essential for capturing complex hierarchical representations. We review operations that are defined in two different isometric coordinate systems, namely the Poincaré ball (Poincaré disk) model and the Lorentz (hyperboloid) model." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.458, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving Hyperbolic Reps via GW Reg" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "Poincaré ball model [10,31] The Poincaré ball model for an \\(n\\)-dimensional hyperbolic space with curvature \\(-c\\) is defined by" + }, + { + "type": "equation", + "bbox": [ + 0.382, + 0.192, + 0.785, + 0.209 + ], + "angle": 0, + "content": "\\[\n\\mathbb {B} _ {c} ^ {n} = \\left\\{\\mathbf {x} \\in \\mathbb {R} ^ {n}: c \\| \\mathbf {x} \\| < 1, c > 0 \\right\\}, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.222, + 0.784, + 0.255 + ], + "angle": 0, + "content": "with the corresponding Riemannian metric given by \\(\\mathfrak{g}^{\\mathbb{B}} = (\\lambda_{\\mathbf{x}}^{c})^{2}\\mathbf{I}\\), where \\(\\lambda_{\\mathbf{x}}^{c} = 2(1 - c\\|\\mathbf{x}\\|^{2})^{-1}\\) is the conformal factor." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.256, + 0.784, + 0.299 + ], + "angle": 0, + "content": "The analogy of a linear layer in HNN depends on two important operations, namely Möbius addition and multiplication. The Möbius addition \\(\\oplus\\) is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.31, + 0.301, + 0.785, + 0.346 + ], + "angle": 0, + "content": "\\[\n\\mathbf {x} \\oplus_ {c} \\mathbf {y} = \\frac {\\left(1 + 2 c \\langle \\mathbf {x} , \\mathbf {y} \\rangle + c \\| \\mathbf {y} \\| ^ {2}\\right) \\mathbf {x} + \\left(1 - c \\| \\mathbf {x} \\| ^ {2}\\right) \\mathbf {y}}{1 + 2 c \\langle \\mathbf {x} , \\mathbf {y} \\rangle + c \\| \\mathbf {x} \\| ^ {2} \\| \\mathbf {y} \\| ^ {2}}. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.353, + 0.568, + 0.369 + ], + "angle": 0, + "content": "The Möbius multiplication \\(\\mathbf{M} \\otimes_{c} \\mathbf{x}\\) is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.311, + 0.382, + 0.785, + 0.416 + ], + "angle": 0, + "content": "\\[\n\\mathbf {M} \\otimes_ {c} \\mathbf {x} = \\frac {1}{\\sqrt {c}} \\tanh \\left(\\frac {\\| \\mathbf {M x} \\|}{\\mathbf {M x}} \\tanh ^ {- 1} (\\sqrt {c} \\| \\mathbf {x} \\|)\\right) \\frac {\\mathbf {M x}}{\\| \\mathbf {M x} \\|}. \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.427, + 0.784, + 0.459 + ], + "angle": 0, + "content": "Finally, the geodesic distance between two points \\(\\mathbf{x}\\) and \\(\\mathbf{y}\\) in the Poincaré ball can be expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.36, + 0.471, + 0.785, + 0.502 + ], + "angle": 0, + "content": "\\[\nd _ {\\mathbb {B}} ^ {c} (\\mathbf {x}, \\mathbf {y}) = \\frac {2}{\\sqrt {c}} \\tanh ^ {- 1} \\left(\\sqrt {c} \\| - \\mathbf {x} \\oplus_ {c} \\mathbf {y} \\|\\right). \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.515, + 0.724, + 0.53 + ], + "angle": 0, + "content": "Unless otherwise specified, we follow the common choice to take \\( c = 1 \\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.559, + 0.784, + 0.621 + ], + "angle": 0, + "content": "Lorentz model [5,6] The Lorentz model of an \\(n\\)-dimensional hyperbolic space \\(\\mathbb{L}^n\\) is a manifold embedded in a \\((n + 1)\\)-dimensional Minkowski space. More specifically, this Minkowski space contains the same points as \\(\\mathbb{R}^{n + 1}\\), but with an inner product \\(\\langle \\cdot ,\\cdot \\rangle_{\\mathbb{L}}\\) defined by" + }, + { + "type": "equation", + "bbox": [ + 0.244, + 0.636, + 0.785, + 0.673 + ], + "angle": 0, + "content": "\\[\n\\langle \\mathbf {x}, \\mathbf {y} \\rangle_ {\\mathbb {L}} = - x _ {0} y _ {0} + \\sum_ {i = 1} ^ {n} x _ {i} y _ {i}, \\mathbf {x} = (x _ {0}, \\dots , x _ {n}), \\mathbf {y} = (y _ {0}, \\dots , y _ {n}) \\in \\mathbb {R} ^ {n + 1}. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.687, + 0.784, + 0.717 + ], + "angle": 0, + "content": "The Lorentz model \\(\\mathbb{L}^n\\) contains points with \\(\\langle \\mathbf{x},\\mathbf{x}\\rangle_{\\mathbb{L}} = -c\\), where \\(-c\\) is the curvature. That is," + }, + { + "type": "equation", + "bbox": [ + 0.302, + 0.732, + 0.785, + 0.75 + ], + "angle": 0, + "content": "\\[\n\\mathbb {L} ^ {n} = \\left\\{\\mathbf {x} = \\left(x _ {0}, \\dots , x _ {n}\\right) \\in \\mathbb {R} ^ {n + 1}: \\langle \\mathbf {x}, \\mathbf {x} \\rangle_ {\\mathbb {L}} = - c, x _ {0} > 0 \\right\\}, \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.763, + 0.784, + 0.793 + ], + "angle": 0, + "content": "The geodesic distance between two points \\(\\mathbf{x}\\) and \\(\\mathbf{y}\\) in the Lorentz model \\(\\mathbb{L}^n\\) is expressed as" + }, + { + "type": "equation", + "bbox": [ + 0.38, + 0.796, + 0.785, + 0.827 + ], + "angle": 0, + "content": "\\[\nd _ {\\mathbb {L}} ^ {c} (\\mathbf {x}, \\mathbf {y}) = \\frac {1}{\\sqrt {c}} \\cosh^ {- 1} (- \\langle \\mathbf {x}, \\mathbf {y} \\rangle_ {\\mathbb {L}}). \\tag {7}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.328, + 0.165, + 0.67, + 0.277 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.315, + 0.788, + 0.345 + ], + "angle": 0, + "content": "Fig. 2: Illustration of the transport map \\( T \\). The feature distribution \\( \\mu \\) defined on \\( \\mathbb{X} \\) is pushed forward to \\( \\nu = T_{\\#}\\mu \\) on \\( \\mathbb{H} \\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.371, + 0.423, + 0.385 + ], + "angle": 0, + "content": "3.2 GW Regularization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.393, + 0.784, + 0.468 + ], + "angle": 0, + "content": "To effectively utilize HNNs for learning from data, extending the geometry-preserving embedding technique introduced in [16], we employ a regularized learning approach focused on preserving the intrinsic geometric structures of the input features onto hyperbolic spaces. This involves employing a cost function capable of comparing two measures across distinct geometric spaces." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.468, + 0.785, + 0.543 + ], + "angle": 0, + "content": "To bridge this gap, we consider the Gromov-Wasserstein (GW) distance [19] as it is adept at quantifying the similarity between probability distributions defined on distinct metric spaces. For two probability distributions \\(\\mu\\) and \\(\\nu\\) in a Euclidean feature space \\(\\mathbb{X}\\) and a hyperbolic space \\(\\mathbb{H}\\), respectively, the GW distance is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.273, + 0.547, + 0.785, + 0.577 + ], + "angle": 0, + "content": "\\[\n\\operatorname {G W} (\\mu , \\nu): := \\min _ {\\pi \\in \\Pi (\\mu , \\nu)} \\mathbb {E} _ {\\left((\\mathbf {x}, \\mathbf {y}), \\left(\\mathbf {x} ^ {\\prime}, \\mathbf {y} ^ {\\prime}\\right)\\right) \\sim \\pi^ {2}} \\left[ \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) - c _ {\\mathbb {H}} \\left(\\mathbf {y}, \\mathbf {y} ^ {\\prime}\\right) \\right| ^ {2} \\right] \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.784, + 0.659 + ], + "angle": 0, + "content": "where \\( c_{\\mathbb{X}} \\) and \\( c_{\\mathbb{H}} \\) represent the cost functions in the two spaces, and \\( \\varPi(\\mu,\\nu) \\) denotes the set of transport plans between \\( \\mu \\) and \\( \\nu \\), which contains all joint distributions whose first and second marginals are given by \\( \\mu \\) and \\( \\nu \\), respectively. By comparing the pairwise distances between two probability distributions to evaluate the similarity of geometric structures across different metric spaces." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.784, + 0.72 + ], + "angle": 0, + "content": "When working with HNNs, an explicit map \\( T \\) from \\( \\mathbb{X} \\) to \\( \\mathbb{H} \\) is induced by the HNN layers, as illustrated in Fig. 2. The minimization problem presented in (8) can be reformulated as a Gromov-Monge (GM) distance minimization problem concerning a map \\( T \\), defined as" + }, + { + "type": "equation", + "bbox": [ + 0.283, + 0.727, + 0.785, + 0.755 + ], + "angle": 0, + "content": "\\[\n\\operatorname {G M} (\\mu , \\nu) := \\min _ {T _ {\\#} \\mu = \\nu} \\underset {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim \\mu^ {2}} {\\mathbb {E}} \\left[ \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) - c _ {\\mathbb {H}} \\left(T (\\mathbf {x}), T \\left(\\mathbf {x} ^ {\\prime}\\right)\\right) \\right| ^ {2} \\right]. \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.762, + 0.784, + 0.807 + ], + "angle": 0, + "content": "In an HNN, when embedding the probability distribution \\(\\mu\\) from a Euclidean space to a hyperbolic space, we can consider minimizing the following cost over \\(T\\in \\mathcal{H}\\), where \\(\\mathcal{H}\\) is a hypothesis class determined by the HNN:" + }, + { + "type": "equation", + "bbox": [ + 0.304, + 0.814, + 0.785, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\operatorname {G M} (T; \\mu) := \\underset {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim \\mu^ {2}} {\\mathbb {E}} \\left[ \\left| c _ {\\mathbb {X}} (\\mathbf {x}, \\mathbf {x} ^ {\\prime}) - c _ {\\mathbb {H}} (T (\\mathbf {x}), T (\\mathbf {x} ^ {\\prime})) \\right| ^ {2} \\right]. \\tag {10}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Hyperbolic Reps via GW Reg" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.286, + 0.159, + 0.74, + 0.273 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.334, + 0.305, + 0.666, + 0.32 + ], + "angle": 0, + "content": "Fig. 3: The framework of our GW regularization." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.35, + 0.784, + 0.41 + ], + "angle": 0, + "content": "Thus, we have \\(\\min_{T\\in \\mathcal{H}}\\mathrm{GM}(\\mu ,T_{\\#}\\mu) = \\min_{T\\in \\mathcal{H}}\\mathrm{GM}(T;\\mu)\\). While the GM problem described in (9) is highly challenging due to its pushforward constraint, minimizing the cost function in (10) is comparatively easier, as it does not require the pushforward constraint." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.411, + 0.797, + 0.479 + ], + "angle": 0, + "content": "In practical implementation, we can employ the simple cost function \\( c_{\\mathbb{X}}(\\mathbf{x}, \\mathbf{x}^{\\prime}) = \\| \\mathbf{x} - \\mathbf{x}^{\\prime} \\|^{2} \\) or other cost functions such as \\( c_{\\mathbb{X}}(\\mathbf{x}, \\mathbf{x}^{\\prime}) = \\log \\left(1 + \\| \\mathbf{x} - \\mathbf{x}^{\\prime} \\|^{2}\\right) \\). Additionally, the explicit form of \\( c_{\\mathbb{H}} \\) can be derived from equations (4) and (7): we can use \\( c_{\\mathbb{H}} = d_{\\mathbb{H}}^{c} \\) or \\( c_{\\mathbb{H}} = \\log \\left(1 + d_{\\mathbb{H}}^{c}\\right) \\), where \\( \\mathbb{H} = \\mathbb{B} \\) or \\( \\mathbb{H} = \\mathbb{L} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.48, + 0.785, + 0.525 + ], + "angle": 0, + "content": "When we have data points \\(\\{\\mathbf{x}_i\\}_{i=1}^m\\) sampled independently and identically distributed (i.i.d.) from \\(\\mu\\), we consider an empirical version of the GM distance, namely," + }, + { + "type": "equation", + "bbox": [ + 0.246, + 0.536, + 0.785, + 0.577 + ], + "angle": 0, + "content": "\\[\n\\operatorname {G M} (T; \\left\\{\\mathbf {x} _ {i} \\right\\} _ {i = 1} ^ {m}) = \\frac {1}{m (m - 1)} \\sum_ {i, j = 1} ^ {m} \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x} _ {i}, \\mathbf {x} _ {j}\\right) - c _ {\\mathbb {H}} \\left(T \\left(\\mathbf {x} _ {i}\\right), T \\left(\\mathbf {x} _ {j}\\right)\\right) \\right| ^ {2}. \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.589, + 0.788, + 0.68 + ], + "angle": 0, + "content": "The overall framework of our GW regularization is shown in Fig. 3. Here, \\(\\{\\mathbf{x}_i\\}_{i=1}^m\\) are the Euclidean features that are fed into the HNN layers denoted by \\(T\\), \\(\\{\\mathbf{z}_i\\}_{i=1}^m\\) are the hyperbolic representations so that \\(\\mathbf{z}_i = T(\\mathbf{x}_i)\\) for each \\(i\\). The GM distance, calculated according to (11), is used as a penalty term, multiplied with a hyperparameter \\(\\beta\\) and then added to the loss function associated with the specific task." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.827 + ], + "angle": 0, + "content": "Generalization analysis In the tasks we consider, the ability to generalize beyond the given data points is essential. Although (11) only provides a formulation based on the training data, we anticipate that it will serve as an effective approximation of (10), provided that the training set \\(\\{\\mathbf{x}_i\\}_{i=1}^m\\) adequately captures the characteristics of the underlying distribution \\(\\mu\\). This expectation is encapsulated in the theorem we present below, which formalizes the relationship between the pointwise formulation and its distributional approximation under the condition of a representative sample." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.369, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.788, + 0.178 + ], + "angle": 0, + "content": "Theorem 1. Given cost functions \\( c_{\\mathbb{X}} \\) and \\( c_{\\mathbb{H}} \\), suppose that there exists a constant \\( 0 < \\alpha \\leq 1 \\) for which \\( T \\) satisfies the following bi-Lipschitz condition:" + }, + { + "type": "equation", + "bbox": [ + 0.349, + 0.187, + 0.786, + 0.215 + ], + "angle": 0, + "content": "\\[\n\\alpha c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) \\leq c _ {\\mathbb {H}} \\left(T (\\mathbf {x}), T \\left(\\mathbf {x} ^ {\\prime}\\right)\\right) \\leq \\frac {1}{\\alpha} c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right), \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.223, + 0.784, + 0.254 + ], + "angle": 0, + "content": "for any \\(\\mathbf{x},\\mathbf{x}^{\\prime}\\in \\mathbb{X}\\). Let \\(\\mu\\) be a distribution defined on \\(\\mathbb{X}\\) and \\(\\{\\mathbf{x}_i\\}_{i = 1}^m\\) be i.i.d. sampled from \\(\\mu\\). Then," + }, + { + "type": "equation", + "bbox": [ + 0.339, + 0.263, + 0.786, + 0.294 + ], + "angle": 0, + "content": "\\[\n\\left| \\operatorname {G M} \\left(T; \\left\\{\\mathbf {x} _ {i} \\right\\} _ {i = 1} ^ {m}\\right) - \\operatorname {G M} (T; \\mu) \\right| \\leq C \\frac {(1 / \\alpha - 1) ^ {2}}{R ^ {2}} \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.303, + 0.787, + 0.352 + ], + "angle": 0, + "content": "holds with probability at least \\(1 - 2\\exp \\left(-\\frac{mC}{8R^4}\\right)\\) where \\(C\\) is a constant depending on \\(\\mu\\) and \\(R\\coloneqq \\max_{\\mathbf{x},\\mathbf{x}^{\\prime}\\in \\mathrm{supp}(\\mu)}c_{\\mathbb{X}}(\\mathbf{x},\\mathbf{x}^{\\prime})\\)" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.359, + 0.629, + 0.375 + ], + "angle": 0, + "content": "The proof of Theorem 1 is presented in the appendix." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.395, + 0.787, + 0.456 + ], + "angle": 0, + "content": "Complexity analysis Since the time complexity for calculating each Euclidean distance is \\( O(n) \\) and the time complexity for calculating each hyperbolic distance (in either the Poincaré ball model or the Lorentz model) is \\( O(n) \\), the time complexity for calculating the GW regularization term is \\( O(nm^2) \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.456, + 0.788, + 0.562 + ], + "angle": 0, + "content": "Note that, if we only consider linear layers in an \\(L\\)-layer Vanilla HNN, the time complexity is \\(O(mn^{2}L)\\). In the few-shot learning task and the semi-supervised graph node-level tasks that we consider in this paper, the number of data points \\(m\\) is usually smaller than or comparable with \\(n\\). Moreover, in tasks such as link prediction, one also needs to compare pairs of data points, leading to a time complexity of \\(O(mn^{2}L)\\) in computing the task loss. Therefore, adding the regularization term will not lead to change of the order of time complexity." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.584, + 0.377, + 0.601 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.721 + ], + "angle": 0, + "content": "To validate the effectiveness of the GW regularization method, we conduct experiments on both image datasets and graph datasets. We present results on few-shot image classification in Section 4.1 and results on graph node classification and link prediction in Section 4.2. All the presented experiments are implemented on a server with RTX 4090 (24GB) GPUs, where each implementation runs on a single GPU. The implementation of our proposed methods can be accessed at https://github.com/yyf1217/GW-Regularization." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.741, + 0.512, + 0.757 + ], + "angle": 0, + "content": "4.1 Few-Shot Image Classification" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We consider the important task of few-shot image classification where the goal is to recognize new categories with very few labeled examples per class. Unlike supervised image classification, this task aims to generalize from a small number of examples, typically one to five images per class. Learning structures of images is crucial since there is very limited labeled data." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving Hyperbolic Reps via GW Reg" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.224, + 0.154, + 0.78, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.251, + 0.305, + 0.747, + 0.319 + ], + "angle": 0, + "content": "Fig. 4: The framework of the GW regularized hyperbolic ProtoNet model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.35, + 0.788, + 0.47 + ], + "angle": 0, + "content": "Datasets We consider two widely used image datasets, namely MiniImageNet [36] and Caltech-UCSD Birds-200-2011 (CUB) [37]. These datasets have been used in [14], where the hyperbolic ProtoNet model excels Euclidean baselines. The MiniImageNet dataset is a subset of the ImageNet dataset [7]. It comprises images from 100 classes, with 600 images per class. The classes have a \\(64/16/20\\) split for training/validation/test. The CUB dataset consists of 200 categories of bird images, totaling 11,788 pictures. In this dataset, the training/validation/test split is \\(100/50/50\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.493, + 0.788, + 0.599 + ], + "angle": 0, + "content": "Setting We apply our GW regularization on the hyperbolic ProtoNet model [14], which primarily consists of convolutional neural network (CNN) layers used for feature extraction from Euclidean image data and subsequent HNN layers for classification. In [14], the HNN layers are taken to be a simple exponential map from the Euclidean space to the Poincaré ball. In our implementation, we utilize the publicly available code for the hyperbolic ProtoNet model from https://github.com/leymir/hyperbolic-image-embeddings." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.788, + 0.719 + ], + "angle": 0, + "content": "For clarity, we illustrate the framework for this task in Fig. 4, which is based on Fig. 3. We take the features \\(\\{\\mathbf{x}_i\\}_{i=1}^m\\) from the output of the CNN layers, and then the HNN layers process them into \\(\\{\\mathbf{z}_i\\}_{i=1}^m\\). Following this, the hyperbolic distance between each hyperbolic embedding \\(\\mathbf{z}_i\\) and the origin of the Poincaré ball is computed according to (4), which is then used to calculate the maximum class probability. Finally, the cross-entropy loss is computed using the maximum class probability and the labels. We add \\(\\beta \\mathrm{GM}(T; \\{\\mathbf{x}_i\\}_{i=1}^m)\\) to the cross-entropy loss to formulate our regularized loss function." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.789, + 0.84 + ], + "angle": 0, + "content": "We consider various CNN architectures including Conv4, ResNet10, ResNet12, and ResNet18. The HNN layers within the model incorporate linear layers from [10]. Additionally, ReLU is used as the activation function across the model. For Conv4, the embedding dimension is set to 1,600, while for ResNet10, ResNet12, and ResNet18, the embedding dimension is set to 512. The initial learning rate is 0.001. We consider both the 1-Shot 5-Way and 5-Shot 5-Way settings, which means there are five classes involved for the task and only one/five examples per class for training. In all experiments for the 1-Shot 5-Way task, a consistent" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.785, + 0.173 + ], + "angle": 0, + "content": "Table 1: Hyperparameters used in few-shot image classification. \"ResNet\" abbreviated as \"Res\" due to space constraints." + }, + { + "type": "table", + "bbox": [ + 0.261, + 0.198, + 0.744, + 0.298 + ], + "angle": 0, + "content": "
Initial learning rate (lr)β
Conv4Res10Res12Res18Conv4Res10Res12Res18
MiniImageNet1-Shot 5-Way0.00050.0010.0010.0010.60.50.10.7
5-Shot 5-Way0.010.0010.0010.001140.10.50.5
CUB1-Shot 5-Way0.0010.0010.0010.0010.020.0150.150.1
5-Shot 5-Way0.010.0010.0010.0010.070.010.250.1
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.339, + 0.785, + 0.414 + ], + "angle": 0, + "content": "curvature parameter of \\(-0.08\\) is employed. Similarly, for the 5-Shot 5-Way task, we uniformly set the curvature to \\(-0.01\\) throughout all experiments. Both curvatures agree with the recommended settings in the original hyperbolic ProtoNet. The hyperparameter \\(\\beta\\) is selected according to the validation set. We report the initial learning rate as well as the best \\(\\beta\\) in Table 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.439, + 0.785, + 0.514 + ], + "angle": 0, + "content": "Results We present our numerical results for both the 1-Shot 5-Way and 5-Shot 5-Way settings in Table 2. We randomly sample 10,000 data points from the test set to evaluate the performance of the model and report \\(95\\%\\) confidence intervals for all results. Each entry reports the average classification accuracy, including means and standard deviations." + }, + { + "type": "table_caption", + "bbox": [ + 0.287, + 0.542, + 0.714, + 0.556 + ], + "angle": 0, + "content": "Table 2: Accuracy (%) results for few-shot image classification." + }, + { + "type": "table", + "bbox": [ + 0.258, + 0.58, + 0.747, + 0.74 + ], + "angle": 0, + "content": "
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv453.77±0.2071.33±0.1664.66±0.2380.29±0.16
Conv4+GW55.57±0.2273.04±0.1668.67±0.2380.54±0.16
ResNet1056.45±0.2165.39±0.1772.01±0.2280.75±0.15
ResNet10+GW57.50±0.2267.62±0.1772.67±0.2283.73±0.14
ResNet1255.96±0.2270.32±0.1775.77±0.2282.90±0.15
ResNet12+GW56.95±0.2273.04±0.1677.24±0.2185.66±0.14
ResNet1857.04±0.2268.43±0.1671.86±0.2285.31±0.13
ResNet18+GW58.51±0.2271.64±0.1672.64±0.2285.83±0.13
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.84 + ], + "angle": 0, + "content": "From the results, we observe that our GW regularization consistently boosts the accuracy of the model. This improvement is evident in both datasets and both scenarios, regardless of the underlying CNN architecture. For most CNN architectures, the improvement is more evident in the 5-Shot 5-Way scenario" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.46, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Hyperbolic Reps via GW Reg" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "than in the 1-Shot 5-Way scenario. We believe that this can be attributed to the increased number of training instances available in the 5-Shot scenario, which provides a richer structure that GW regularization can leverage." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.213, + 0.784, + 0.304 + ], + "angle": 0, + "content": "Runtime We report the average run time for training one epoch in Table 3. As anticipated, incorporating GW regularization results in extended epoch training times. However, the increase in runtime is not significant, aligning with the time complexity analysis in Section 3.2. This observation underscores the efficiency of our GW regularization approach, ensuring that the added computational demand does not impose a significant burden on the overall training process." + }, + { + "type": "table_caption", + "bbox": [ + 0.219, + 0.329, + 0.784, + 0.356 + ], + "angle": 0, + "content": "Table 3: Average runtime (in seconds) for training one epoch in few-shot image classification." + }, + { + "type": "table", + "bbox": [ + 0.258, + 0.381, + 0.744, + 0.539 + ], + "angle": 0, + "content": "
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv431.225.232.432.9
Conv4+GW33.626.435.132.9
ResNet1037.228.838.434.9
ResNet10+GW40.834.843.238.4
ResNet1242.036.046.842.0
ResNet12+GW45.640.850.445.6
ResNet1855.243.260.052.8
ResNet18+GW57.649.262.457.6
" + }, + { + "type": "title", + "bbox": [ + 0.219, + 0.6, + 0.732, + 0.615 + ], + "angle": 0, + "content": "4.2 Semi-Supervised Link Prediction and Node Classification" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.623, + 0.784, + 0.654 + ], + "angle": 0, + "content": "We consider graph link prediction and node classification, which are widely benchmarked semi-supervised tasks in graph deep learning literature." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.673, + 0.784, + 0.749 + ], + "angle": 0, + "content": "Datasets We consider nine datasets for node classification, namely Cora, Disease, Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor. For the first three datasets, namely Disease, Airport, and Cora, we also perform link prediction. We briefly introduce the datasets in the appendix and summarize the statistics of the graphs in Table 4." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.75, + 0.789, + 0.84 + ], + "angle": 0, + "content": "In link prediction tasks, we randomly split edges into \\(85\\% / 5\\% / 10\\%\\) for training, validation, and test sets. For node classification tasks, we use a \\(70\\% / 15\\% / 15\\%\\) splits for Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor, we use \\(30\\% / 10\\% / 60\\%\\) splits for Disease, and we use standard splits with 20 train examples per class for Cora. The above split settings agree with standard settings in the baseline papers." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.375, + 0.145, + 0.628, + 0.16 + ], + "angle": 0, + "content": "Table 4: Statistics of graph datasets." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.172, + 0.803, + 0.24 + ], + "angle": 0, + "content": "
Disease-LPDisease-NCAirportCoraCornellTexasWisconsinChameleonSquirrelActor
# nodes2,6651,0443,1882,7081831832512,2775,2017,600
# edges2,2652,26515,8374,48828029546631,421198,49326,752
# features111,000111,4331,7031,7031,7032,3252,089931
# classesN/A247555555
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.273, + 0.784, + 0.334 + ], + "angle": 0, + "content": "Setting For the graph datasets, we consider the following three HNNs: the vanilla HNN [10], HGCN [5], and HyboNet [6]. We utilize the publicly available code for HNN and HGCN from https://github.com/HazyResearch/hgcn and HyboNet from https://github.com/chenweize1998/fully-hyperbolic-nn." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.336, + 0.785, + 0.382 + ], + "angle": 0, + "content": "For each model, we apply GW distance to the input node features and their hyperbolic representations after applying the Euclidean-to-hyperbolic operation. The regularization framework is the same as Fig. 3." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.385, + 0.789, + 0.596 + ], + "angle": 0, + "content": "In these experiments, the HNN models share a common architecture consisting of HNN layers and output layers. These models employ different HNN layers to extract features from graph data and generate hyperbolic embeddings \\(\\{\\mathbf{z}_i\\}_{i=1}^m\\). Specifically, the Vanilla HNN and HGCN employ the Poincaré model to build linear layers and activation. HGCN also has aggregation operation, facilitating message passing. Differently, HyboNet employs the linear layers and aggregation in the Lorentz model. The output layers are used to accomplish various tasks. For node classification, the obtained hyperbolic embeddings are directly projected to the Euclidean space. A linear layer is then used to predict the class probabilities, with which the negative log-likelihood loss is computed. For link prediction, the hyperbolic distances between the hyperbolic embeddings are computed. Subsequently, the Fermi-Dirac algorithm [15] is employed to transform the hyperbolic distances into the edge probabilities. Finally, cross-entropy losses are computed using these edge probabilities and the true edge labels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.789, + 0.675 + ], + "angle": 0, + "content": "For simplicity, the curvature of the hyperbolic space is set as \\(-1\\) for all experiments, which is a common setting for graph datasets. Tables 5 and 6 list hyperparameters such as initial learning rate, the number of the HNN layers, weight decay, dropout, and embedding dimensions. The hyperparameter \\(\\beta\\) from validation is also listed for different datasets." + }, + { + "type": "table_caption", + "bbox": [ + 0.283, + 0.703, + 0.719, + 0.718 + ], + "angle": 0, + "content": "Table 5: Hyperparameters used in the Vanilla HNN and HGCN." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.73, + 0.802, + 0.839 + ], + "angle": 0, + "content": "
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNC
Initial lr0.010.010.010.010.010.010.010.010.010.010.010.01
# layers222222222222
Weight decay0.00.0010.00050.00.0050.0010.0010.0010.0010.0010.0010.001
Dropout0.00.10.00.00.50.50.50.50.50.50.50.5
# embeddings316161616161616161655
HNN β0.90.0821.250.50.350.250.10.150.020.0010.03
HGCN β0.30.0921.50.10.60.250.150.20.080.010.03
" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.46, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Hyperbolic Reps via GW Reg" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.348, + 0.145, + 0.654, + 0.16 + ], + "angle": 0, + "content": "Table 6: Hyperparameters used in HyboNet." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.171, + 0.803, + 0.271 + ], + "angle": 0, + "content": "
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNCNCNCNCNCNC
Initial lr0.0050.0050.010.020.020.020.0050.0050.0050.0050.0050.0050.0050.010.010.01
# layers2426232222222222
Weight decay0.00.00.00.00010.0010.010.00.00.00.00.00.00.00.0010.0010.001
Dropout0.00.10.00.00.70.90.20.20.20.20.20.20.20.20.20.2
# embeddings16161616161616161616161616161616
β0.30.071.51.10.250.250.130.10.10.11.31.32.50.010.010.01
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.319, + 0.788, + 0.381 + ], + "angle": 0, + "content": "Results For the link prediction task, we report the AUC scores in Table 7. For the node classification task, we report the F1 scores, in Table 8. Each score reports the average from three random runs as well as the standard deviation. For clarity, we just use \"HNN\" in place of the Vanilla HNN in the tables." + }, + { + "type": "table_caption", + "bbox": [ + 0.32, + 0.405, + 0.681, + 0.42 + ], + "angle": 0, + "content": "Table 7: AUC (%) results of the link prediction task." + }, + { + "type": "table", + "bbox": [ + 0.324, + 0.431, + 0.681, + 0.548 + ], + "angle": 0, + "content": "
DiseaseAirportCora
HNN92.83±1.8393.56±0.3088.80±1.29
HNN+GW94.45±0.5894.23±0.3389.76±2.07
HGCN92.41±1.7893.42±0.1593.37±0.15
HGCN+GW93.79±1.1595.81±0.0293.48±0.22
HYBONET95.65±0.5796.18±0.0592.04±0.37
HYBONET+GW96.58±0.5796.44±0.0293.33±0.22
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.574, + 0.788, + 0.68 + ], + "angle": 0, + "content": "From Table 7, it is evident that our GW regularization consistently enhances the AUC scores across different network architectures and across all datasets. Similarly, Table 8 showcases that GW regularization again demonstrates a positive impact on model performance across various datasets and architectures. In many scenarios of node classification, GW regularization actually achieves substantial improvement, such as HNN+GW for Disease, HGCN+GW for Cornell and HyboNet+GW for Wisconsin." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.7, + 0.788, + 0.762 + ], + "angle": 0, + "content": "Runtime We report the average run time for training one epoch for link prediction in Table 9. Similarly to the previous experiment, the runtime for GW regularized training is longer, but not significantly. This again aligns with the complexity analysis in Section 3.2." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.781, + 0.36, + 0.797 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "In this paper, we have delved into the integration of the GW distance as a novel regularization term within the realms of hyperbolic neural networks, with a par-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.32, + 0.145, + 0.681, + 0.159 + ], + "angle": 0, + "content": "Table 8: F1 (%) result of the node classification task." + }, + { + "type": "table", + "bbox": [ + 0.248, + 0.172, + 0.758, + 0.401 + ], + "angle": 0, + "content": "
DiseaseAirportCoraChameleonSquirrel
HNN58.40±2.5387.40±1.3453.73±0.9171.43±1.6347.89±2.21
HNN+GW65.62±1.9889.38±0.6755.33±0.3572.53±0.1949.44±1.05
HGCN93.04±1.6486.96±0.2279.47±1.0177.72±0.9051.79±0.58
HGCN+GW95.28±0.4087.91±0.7280.00±0.6279.18±1.6452.70±1.24
HYBONET85.70±0.6093.13±0.1973.53±0.7582.05±0.5574.04±2.42
HYBONET+GW87.66±1.2194.46±0.2079.40±0.9583.58±0.2877.27±0.78
CornellTexasWisconsinActor
HNN93.94±1.3194.69±1.3193.21±3.8642.63±1.73
HNN+GW95.45±2.2896.97±1.3298.15±1.8545.03±1.73
HGCN83.33±3.4778.79±4.7375.31±2.8336.39±1.00
HGCN+GW88.64±2.2881.82±3.9483.33±1.8639.19±0.67
HYBONET78.79±4.7367.42±3.4774.07±1.8645.74±2.13
HYBONET+GW81.82±3.9374.24±1.3180.87±3.8649.64±0.38
" + }, + { + "type": "table_caption", + "bbox": [ + 0.234, + 0.423, + 0.768, + 0.438 + ], + "angle": 0, + "content": "Table 9: Average runtime (in seconds) for training one epoch in link prediction." + }, + { + "type": "table", + "bbox": [ + 0.364, + 0.449, + 0.64, + 0.565 + ], + "angle": 0, + "content": "
DiseaseAirportCora
HNN0.03010.08810.0549
HNN+GW0.03130.08840.0563
HGCN0.04890.10750.0743
HGCN+GW0.05050.10780.0747
HYBONET0.03010.06310.0374
HYBONET+GW0.03230.06390.0379
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.603, + 0.785, + 0.695 + ], + "angle": 0, + "content": "ticular emphasis on leveraging the GM formulation. This approach has allowed for a sophisticated comparison of distributions across the Euclidean space and the hyperbolic space, capturing the essence of the underlying structures while not increasing the order of the time complexity. We have demonstrated that the hyperbolic embeddings of the data points resonate closely with distributions where they are sampled from." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.699, + 0.785, + 0.76 + ], + "angle": 0, + "content": "Our regularization method has been rigorously tested and validated across diverse datasets including image data for the few-shot classification task and graph data for the semi-supervised link prediction and node classification tasks, showcasing a uniform elevation in performance metrics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Our future work involves more efficient methods in large scale settings, where the number of instances is much larger than feature dimensions. Additionally, we are intrigued by the potential of integrating our GW regularization framework with emerging geometric deep learning architectures for complex data structures, where the flexibility with the choice of underlying spaces is crucial." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.459, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Hyperbolic Reps via GW Reg" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.393, + 0.163 + ], + "angle": 0, + "content": "Acknowledgement" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.174, + 0.787, + 0.234 + ], + "angle": 0, + "content": "YY and DZ acknowledge funding from National Natural Science Foundation of China (NSFC) under award number 12301117, WL acknowledges funding from the National Institute of Standards and Technology (NIST) under award number 70NANB22H021, and GL acknowledges funding from NSF award DMS 2124913." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.255, + 0.322, + 0.271 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.284, + 0.785, + 0.31 + ], + "angle": 0, + "content": "1. Alvarez-Melis, D., Jaakkola, T.S.: Gromov-Wasserstein alignment of word embedding spaces. arXiv preprint arXiv:1809.00013 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.311, + 0.785, + 0.338 + ], + "angle": 0, + "content": "2. Atigh, M.G., Schoep, J., Acar, E., van Noord, N., Mettes, P.: Hyperbolic image segmentation. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.339, + 0.785, + 0.365 + ], + "angle": 0, + "content": "3. Bachmann, G., Bécigneul, G., Ganea, O.: Constant curvature graph convolutional networks. In: Int. Conf. Mach. Learn. pp. 486-496. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.365, + 0.785, + 0.392 + ], + "angle": 0, + "content": "4. Bunne, C., Alvarez-Melis, D., Krause, A., Jegelka, S.: Learning generative models across incomparable spaces. In: Int. Conf. Mach. Learn. pp. 851-861. PMLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.393, + 0.785, + 0.419 + ], + "angle": 0, + "content": "5. Chami, I., Ying, Z., Ré, C., Leskovec, J.: Hyperbolic graph convolutional neural networks. Adv. Neural Inform. Process. Syst. 32, 4868-4879 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.42, + 0.785, + 0.459 + ], + "angle": 0, + "content": "6. Chen, W., Han, X., Lin, Y., Zhao, H., Liu, Z., Li, P., Sun, M., Zhou, J.: Fully hyperbolic neural networks. In: Annu. Meeting Assoc. Comput. Linguistics. pp. 5672-5686 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.46, + 0.785, + 0.5 + ], + "angle": 0, + "content": "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.501, + 0.785, + 0.528 + ], + "angle": 0, + "content": "8. Dumont, T., Lacombe, T., Vialard, F.X.: On the existence of Monge maps for the Gromov-Wasserstein problem (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.529, + 0.785, + 0.568 + ], + "angle": 0, + "content": "9. Fan, X., Yang, C.H., Vemuri, B.C.: Nested hyperbolic spaces for dimensionality reduction and hyperbolic NN design. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.569, + 0.785, + 0.595 + ], + "angle": 0, + "content": "10. Ganea, O., Bécigneul, G., Hofmann, T.: Hyperbolic neural networks. Adv. Neural Inform. Process. Syst. 31, 5345-5355 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.597, + 0.785, + 0.65 + ], + "angle": 0, + "content": "11. Gulcehre, C., Denil, M., Malinowski, M., Razavi, A., Pascanu, R., Hermann, K.M., Battaglia, P., Bapst, V., Raposo, D., Santoro, A., de Freitas, N.: Hyperbolic attention networks. In: Int. Conf. Learn. Represent. (2019), https://openreview.net/forum?id=rJxHsjRqFQ" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.651, + 0.785, + 0.677 + ], + "angle": 0, + "content": "12. Guo, Y., Guo, H., Yu, S.X.: Co-SNE: Dimensionality reduction and visualization for hyperbolic data. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.678, + 0.785, + 0.718 + ], + "angle": 0, + "content": "13. Huang, Y., Zhang, T., Zhu, H.: Improving word alignment by adding Gromov-Wasserstein into attention neural network. In: J. Phys. Conf. Ser. vol. 2171, p. 012043. IOP Publishing (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.719, + 0.785, + 0.746 + ], + "angle": 0, + "content": "14. Khrulkov, V., Mirvakhabova, L., Ustinova, E., Oseledets, I., Lempitsky, V.: Hyperbolic image embeddings. In: IEEE Conf. Comput. Vis. Pattern Recog. (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.746, + 0.785, + 0.772 + ], + "angle": 0, + "content": "15. Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguná, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.773, + 0.785, + 0.799 + ], + "angle": 0, + "content": "16. Lee, W., Yang, Y., Zou, D., Lerman, G.: Monotone generative modeling via a gromov-monge embedding. arXiv e-prints (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "17. Li, X., Qiu, Z., Zhao, X., Wang, Z., Zhang, Y., Xing, C., Wu, X.: Gromov-Wasserstein guided representation learning for cross-domain recommendation. In: ACM Int. Conf. Inf. Knowl. Manage. pp. 1199-1208 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.284, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.368, + 0.129 + ], + "angle": 0, + "content": "Y. Yang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "18. Liu, Q., Nickel, M., Kiela, D.: Hyperbolic graph neural networks. Adv. Neural Inform. Process. Syst. 32, 8230-8241 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.175, + 0.785, + 0.202 + ], + "angle": 0, + "content": "19. Mémoli, F.: On the use of Gromov-Hausdorff distances for shape comparison. In: PBG@Eurographics (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.203, + 0.785, + 0.23 + ], + "angle": 0, + "content": "20. Mémoli, F.: Gromov-Wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11, 417-487 (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.23, + 0.785, + 0.257 + ], + "angle": 0, + "content": "21. Mémoli, F., Needham, T.: Distance distributions and inverse problems for metric measure spaces. Stud. Appl. Math. 149(4), 943-1001 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.257, + 0.785, + 0.297 + ], + "angle": 0, + "content": "22. Nakagawa, N., Togo, R., Ogawa, T., Haseyama, M.: Gromov-Wasserstein autoencoders. In: Int. Conf. Learn. Represent. (2023), https://openreview.net/forum?id=sbS10BCtC7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.298, + 0.785, + 0.325 + ], + "angle": 0, + "content": "23. Nickel, M., Kiela, D.: Poincaré embeddings for learning hierarchical representations. Adv. Neural Inform. Process. Syst. 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.326, + 0.785, + 0.353 + ], + "angle": 0, + "content": "24. Nickel, M., Kiela, D.: Learning continuous hierarchies in the lorentz model of hyperbolic geometry. In: Int. Conf. Mach. Learn. (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.353, + 0.785, + 0.393 + ], + "angle": 0, + "content": "25. Nikolentzos, G., Chatzianastasis, M., Vazirgiannis, M.: Weisfeiler and Leman go hyperbolic: Learning distance preserving node representations. In: Int. Conf. Artif. Intell. Statist. pp. 1037-1054 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.394, + 0.785, + 0.421 + ], + "angle": 0, + "content": "26. Peng, W., Varanka, T., Mostafa, A., Shi, H., Zhao, G.: Hyperbolic deep neural networks: A survey. IEEE Trans. Pattern Anal. Mach. Intell. (December 2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.421, + 0.785, + 0.448 + ], + "angle": 0, + "content": "27. Peyre, G., Cuturi, M., Solomon, J.: Gromov-Wasserstein averaging of kernel and distance matrices. In: Int. Conf. Mach. Learn. pp. 2664-2672. PMLR (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.449, + 0.785, + 0.475 + ], + "angle": 0, + "content": "28. Sala, F., De Sa, C., Gu, A., Ré, C.: Representation tradeoffs for hyperbolic embeddings. In: Int. Conf. Mach. Learn. (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.476, + 0.785, + 0.503 + ], + "angle": 0, + "content": "29. Sarkar, R.: Low distortion delaunay embedding of trees in hyperbolic plane. In: Int. Symp. Graph Drawing. pp. 355-366. Springer (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.503, + 0.785, + 0.53 + ], + "angle": 0, + "content": "30. Schmitzer, B., Schnörr, C.: Modelling convex shape priors and matching based on the Gromov-Wasserstein distance. J. Math. Imaging Vision 46, 143-159 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.53, + 0.785, + 0.557 + ], + "angle": 0, + "content": "31. Shimizu, R., Mukuta, Y., Harada, T.: Hyperbolic neural networks++. In: Int. Conf. Learn. Represent. (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.557, + 0.785, + 0.584 + ], + "angle": 0, + "content": "32. Sonthalia, R., Gilbert, A.: Tree! I am no tree! I am a low dimensional hyperbolic embedding. Adv. Neural Inform. Process. Syst. 33, 845-856 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.585, + 0.785, + 0.611 + ], + "angle": 0, + "content": "33. Sturm, K.T.: The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces, vol. 290. American Mathematical Society (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.612, + 0.785, + 0.639 + ], + "angle": 0, + "content": "34. Tifrea, A., Bécigneul, G., Ganea, O.E.: Poincaré glove: Hyperbolic word embeddings. In: Int. Conf. Learn. Represent. (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.639, + 0.785, + 0.666 + ], + "angle": 0, + "content": "35. Titouan, V., Flamary, R., Courty, N., Tavenard, R., Chapel, L.: Sliced Gromov-Wasserstein. Adv. Neural Inform. Process. Syst. 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.666, + 0.785, + 0.693 + ], + "angle": 0, + "content": "36. Vinyals, O., Blundell, C., Lillicrap, T., Wierstra, D., et al.: Matching networks for one shot learning. Adv. Neural Inform. Process. Syst. 29 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.693, + 0.785, + 0.72 + ], + "angle": 0, + "content": "37. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The Caltech-UCSD birds-200-2011 dataset (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.721, + 0.785, + 0.748 + ], + "angle": 0, + "content": "38. Xu, H., Luo, D., Carin, L.: Scalable Gromov-Wasserstein learning for graph partitioning and matching. Adv. Neural Inform. Process. Syst. 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.748, + 0.785, + 0.775 + ], + "angle": 0, + "content": "39. Xu, H., Luo, D., Zha, H., Carin, L.: Gromov-Wasserstein learning for graph matching and node embedding. In: Int. Conf. Mach. Learn. pp. 6932-6941. PMLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.776, + 0.785, + 0.802 + ], + "angle": 0, + "content": "40. Yang, M., Zhou, M., Li, Z., Liu, J., Pan, L., Xiong, H., King, I.: Hyperbolic graph neural networks: A review of methods and applications (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.802, + 0.785, + 0.83 + ], + "angle": 0, + "content": "41. Zhou, Y., Sharpee, T.O.: Hyperbolic geometry of gene expression. Iscience 24(3) (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.83 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_origin.pdf b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..1fb4eced6b48e52eb45e8a6aeb45c6eb0c5c4e47 --- /dev/null +++ b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/d3d3f3d4-0115-4b3c-98da-de7b944986cf_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:eddc5cb58dc033af32dd8743018f494a404f81e199cda6e6875e08c4dfcaedad +size 1026257 diff --git a/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/full.md b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/full.md new file mode 100644 index 0000000000000000000000000000000000000000..30643a720edc77ed9cf187728ee953b1b90e7b10 --- /dev/null +++ b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/full.md @@ -0,0 +1,316 @@ +# Improving Hyperbolic Representations via Gromov-Wasserstein Regularization + +Yifei Yang $^{1}$ , Wonjun Lee $^{2}$ , Dongmian Zou $^{3}$ , and Gilad Lerman $^{2}$ + +1 Wuhan University, Wuhan, Hubei 430072, China + +yflyang@whu.edu.cn + +$^{2}$ University of Minnesota, Minneapolis, MN 55455, USA + +{lee01273,lerman}@umn.edu + +$^{3}$ Duke Kunshan University, Kunshan, Jiangsu 215316, China + +dongmian.zou@duke.edu + +Abstract. Hyperbolic representations have shown remarkable efficacy in modeling inherent hierarchies and complexities within data structures. Hyperbolic neural networks have been commonly applied for learning such representations from data, but they often fall short in preserving the geometric structures of the original feature spaces. In response to this challenge, our work applies the Gromov-Wasserstein (GW) distance as a novel regularization mechanism within hyperbolic neural networks. The GW distance quantifies how well the original data structure is maintained after embedding the data in a hyperbolic space. Specifically, we explicitly treat the layers of the hyperbolic neural networks as a transport map and calculate the GW distance accordingly. We validate that the GW distance computed based on a training set well approximates the GW distance of the underlying data distribution. Our approach demonstrates consistent enhancements over current state-of-the-art methods across various tasks, including few-shot image classification, as well as semi-supervised graph link prediction and node classification. + +Keywords: Gromov-Wasserstein distance $\cdot$ Hyperbolic neural networks + +·Few-shot learning $\cdot$ Semi-supervised learning + +# 1 Introduction + +The success of many machine learning applications relies on effectively capturing the geometric intricacies of complex data structures. This challenge necessitates a careful selection of the underlying space that aligns with the inherent properties of data. In this context, hyperbolic spaces have emerged as a popular choice for modeling data with hierarchical structures such as lexical databases [23] and phylogenetic trees [28]. This is attributed to their distinctive capacity to embody exponential growth and branching patterns, a feature rooted in their constant negative curvature. Such a geometric framework can reflect the tree-like architectures that are ubiquitous across numerous real-world networks. + +Interestingly, hyperbolic spaces also play a significant role in computer vision [2, 14], particularly in tasks like image classification and object recognition + +![](images/5ed87fd2a1729b52bda7b4a3ece2d6ef06ba6a3ef22f063c1e9d854370ce2116.jpg) +Fig. 1: Illustration of hierarchical structures in image data. The images are taken from the MiniImagenet dataset. + +where hierarchical relationships among instances and concepts are common. For example, within the broader category of animals, there are dogs, which further subdivide into breeds such as bulldogs, Gordon setters, Newfoundland dogs, etc. This is illustrated in Fig. 1. Hyperbolic embeddings can capture these hierarchies, thereby potentially improving classification performance and providing more interpretable models. + +In crafting hyperbolic representations from non-hyperbolic features, two main strategies emerge: principled design and data-driven learning. The principled approach, exemplified by methods like Sarkar's algorithm [29], focuses on constructing embeddings that rigorously preserve the inherent geometric structure from data. This method particularly excels at maintaining hierarchical relationships within the data, ensuring that the embedded representation reflects structure of the original dataset with low distortion. On the other hand, the data-driven approach leverages the capabilities of end-to-end neural networks to learn the hyperbolic embedding directly from data. Such neural networks are well-known as hyperbolic neural networks (HNNs), which are pioneered in [10]. HNNs prioritize the development of hyperbolically coherent neural operations that are expressive and mirror the Euclidean counterparts. When dealing with input that is primarily Euclidean, HNNs employ straightforward operations, such as exponential maps, to transition features into the hyperbolic space, thereafter learning to extract deep features in a manner driven by the data. This method adapts the embedding to specific tasks, potentially unveiling intricate patterns and relationships inherent within data. + +In our work, we aim to establish a methodology that integrates the benefits of low-distortion embedding into data-driven learning. In the context of learning + +where generalization is the goal, we can view hyperbolic embedding as a method of embedding the data distribution into hyperbolic spaces. Therefore, we need to compare the distributions before and after the embedding. This necessitates a comparison of data distributions before and after embedding, which is complicated by the fundamental differences in geometric principles, such as curvature and dimensionality, that govern Euclidean and hyperbolic spaces. Direct comparisons between such disparate spaces are inherently complex and challenging. + +To address this challenge, we rely on the Gromov-Wasserstein (GW) distance [19], a tool proven effective in comparing distributions across diverse metric spaces. Specifically, we employ the Gromov-Monge (GM) formulation, an alternative form of the GW distance, to compute the explicit transport map between heterogeneous metric spaces. The HNN layers induce the embedding distribution, thus serving as the transport map. Consequently, the GM formulation is a more suitable approach for the corresponding HNN layers. However, implementing the GM distance poses computational challenges due to its complex constraints. Therefore, in light of this, we extend the GM-based embedding technique introduced in [16] to compute the geometry-preserving transport map from data distribution in Euclidean space to hyperbolic spaces. + +The contribution of the current work is summarized as follows: + +1. We propose a novel methodology that incorporates the GM distance into an end-to-end learning framework for hyperbolic representation learning. This approach ensures a more faithful representation of the intrinsic hierarchical structures. Moreover, we verify that our approach maintains computational efficiency by analyzing its time complexity. +2. We validate that the embedding faithfully represents an embedding of distributions from the original domain by providing an upper bound for the sampling error. Therefore, regularization on the training sample generalizes to the underlying data distribution. +3. We provide empirical evidence showing that our regularization strategy leads to consistent improvements over existing baseline methods when applied to datasets with hierarchical structures, including both image and graph data. + +# 2 Related Works + +Hyperbolic embedding The adoption of hyperbolic geometries for representing hierarchical connections between data points has attracted considerable attention. The exploration began when researchers considered low-distortion embedding of tree or tree-like graphs into the hyperbolic domain. In their seminal work, Sarkar [29] showed that a tree can be embedded into the Poincaré disk with arbitrarily low distortion. Sala et al. [28] generalized the embedding to high dimensional Poincaré balls and discussed embedding general graphs into trees. Sonthalia and Gilbert [32] bypassed the intermediary step of general graph structures, opting instead to directly infer tree architectures from the data itself. In addition to combinatorial methods, gradient-based methods are also used in hyperbolic embedding [23, 24]. + +Hyperbolic neural networks More recently, the advancement in hyperbolic representation learning has evolved to be more closely aligned with specific end tasks and specific datasets, such as text [34], images [14], biology [41], molecular [18], and knowledge graph [6]. This has led to the emergence of hyperbolic neural networks (HNNs) as a preferred framework for learning their representations. Numerous HNN architectures have emerged [3, 5, 10, 11, 18, 24, 31]. Comprehensive surveys on HNN include [26, 40]. These HNNs define operations that conform with a choice of coordinate system in the hyperbolic space. However, when communicating between the Euclidean features and their hyperbolic embeddings, these HNNs take very simple approaches. For instance, Ganea et al. [10] directly used logarithmic and exponential maps at the origin, leading to unavoidable distortions. There are also very recent works addressing representations learned by HNNs. For instance, CO-SNE [12] reduces the dimensions of hyperbolic features for visualization, which is an analogy to t-SNE in the Euclidean domain. Parallel to this, Fan et al. [9] developed a systematic method for embedding data into nested hyperbolic spaces, which not only results in dimensionality reduction but also extends to design of HNNs. Nikolentzos et al. [25] applied the Weisfeiler-Leman algorithm to capture hierarchy in data and built HNNs accordingly. However, none of the above methods have considered comparing distributions before and after embedding into the hyperbolic space. + +GW distance GW distance, a variant of optimal transport distance, has been widely utilized to quantify structural differences between different distributions. Memoli provided a detailed introduction and study of GW distance in [19, 20]. Subsequently, Sturm [33] presented a more in-depth mathematical exposition of GW distance, focusing on its geodesic structure and gradient flow. Following these foundational works, GW distance has found applications in various fields, including computer vision [27, 30], recommendation systems [17], natural language processing [1], generative models [4, 16, 22, 35]. In particular, Lee et al. [16] employed the GM formulation to achieve geometry-preserving dimension reduction within a generative modeling framework. The discussion on the GM formulation can also be traced to [8, 21]. Moreover, GW distance has been applied to specific data types such as graphs [38, 39] and specific neural network architectures such as transformers [13]. To the best of our knowledge, GW distance has not yet been explored in the context of hyperbolic neural networks. + +# 3 Methodology + +# 3.1 Preliminaries of Hyperbolic Geometry + +Hyperbolic geometry, characterized by its constant negative curvature, represents a non-Euclidean geometry essential for capturing complex hierarchical representations. We review operations that are defined in two different isometric coordinate systems, namely the Poincaré ball (Poincaré disk) model and the Lorentz (hyperboloid) model. + +Poincaré ball model [10,31] The Poincaré ball model for an $n$ -dimensional hyperbolic space with curvature $-c$ is defined by + +$$ +\mathbb {B} _ {c} ^ {n} = \left\{\mathbf {x} \in \mathbb {R} ^ {n}: c \| \mathbf {x} \| < 1, c > 0 \right\}, \tag {1} +$$ + +with the corresponding Riemannian metric given by $\mathfrak{g}^{\mathbb{B}} = (\lambda_{\mathbf{x}}^{c})^{2}\mathbf{I}$ , where $\lambda_{\mathbf{x}}^{c} = 2(1 - c\|\mathbf{x}\|^{2})^{-1}$ is the conformal factor. + +The analogy of a linear layer in HNN depends on two important operations, namely Möbius addition and multiplication. The Möbius addition $\oplus$ is defined as: + +$$ +\mathbf {x} \oplus_ {c} \mathbf {y} = \frac {\left(1 + 2 c \langle \mathbf {x} , \mathbf {y} \rangle + c \| \mathbf {y} \| ^ {2}\right) \mathbf {x} + \left(1 - c \| \mathbf {x} \| ^ {2}\right) \mathbf {y}}{1 + 2 c \langle \mathbf {x} , \mathbf {y} \rangle + c \| \mathbf {x} \| ^ {2} \| \mathbf {y} \| ^ {2}}. \tag {2} +$$ + +The Möbius multiplication $\mathbf{M} \otimes_{c} \mathbf{x}$ is defined as: + +$$ +\mathbf {M} \otimes_ {c} \mathbf {x} = \frac {1}{\sqrt {c}} \tanh \left(\frac {\| \mathbf {M x} \|}{\mathbf {M x}} \tanh ^ {- 1} (\sqrt {c} \| \mathbf {x} \|)\right) \frac {\mathbf {M x}}{\| \mathbf {M x} \|}. \tag {3} +$$ + +Finally, the geodesic distance between two points $\mathbf{x}$ and $\mathbf{y}$ in the Poincaré ball can be expressed as: + +$$ +d _ {\mathbb {B}} ^ {c} (\mathbf {x}, \mathbf {y}) = \frac {2}{\sqrt {c}} \tanh ^ {- 1} \left(\sqrt {c} \| - \mathbf {x} \oplus_ {c} \mathbf {y} \|\right). \tag {4} +$$ + +Unless otherwise specified, we follow the common choice to take $c = 1$ . + +Lorentz model [5,6] The Lorentz model of an $n$ -dimensional hyperbolic space $\mathbb{L}^n$ is a manifold embedded in a $(n + 1)$ -dimensional Minkowski space. More specifically, this Minkowski space contains the same points as $\mathbb{R}^{n + 1}$ , but with an inner product $\langle \cdot ,\cdot \rangle_{\mathbb{L}}$ defined by + +$$ +\langle \mathbf {x}, \mathbf {y} \rangle_ {\mathbb {L}} = - x _ {0} y _ {0} + \sum_ {i = 1} ^ {n} x _ {i} y _ {i}, \mathbf {x} = (x _ {0}, \dots , x _ {n}), \mathbf {y} = (y _ {0}, \dots , y _ {n}) \in \mathbb {R} ^ {n + 1}. \tag {5} +$$ + +The Lorentz model $\mathbb{L}^n$ contains points with $\langle \mathbf{x},\mathbf{x}\rangle_{\mathbb{L}} = -c$ , where $-c$ is the curvature. That is, + +$$ +\mathbb {L} ^ {n} = \left\{\mathbf {x} = \left(x _ {0}, \dots , x _ {n}\right) \in \mathbb {R} ^ {n + 1}: \langle \mathbf {x}, \mathbf {x} \rangle_ {\mathbb {L}} = - c, x _ {0} > 0 \right\}, \tag {6} +$$ + +The geodesic distance between two points $\mathbf{x}$ and $\mathbf{y}$ in the Lorentz model $\mathbb{L}^n$ is expressed as + +$$ +d _ {\mathbb {L}} ^ {c} (\mathbf {x}, \mathbf {y}) = \frac {1}{\sqrt {c}} \cosh^ {- 1} (- \langle \mathbf {x}, \mathbf {y} \rangle_ {\mathbb {L}}). \tag {7} +$$ + +![](images/2ae3aa16a9dabe2531f7467da1216a4bdb4f1bc78a925d0bbe82f7ecc892c89a.jpg) +Fig. 2: Illustration of the transport map $T$ . The feature distribution $\mu$ defined on $\mathbb{X}$ is pushed forward to $\nu = T_{\#}\mu$ on $\mathbb{H}$ . + +# 3.2 GW Regularization + +To effectively utilize HNNs for learning from data, extending the geometry-preserving embedding technique introduced in [16], we employ a regularized learning approach focused on preserving the intrinsic geometric structures of the input features onto hyperbolic spaces. This involves employing a cost function capable of comparing two measures across distinct geometric spaces. + +To bridge this gap, we consider the Gromov-Wasserstein (GW) distance [19] as it is adept at quantifying the similarity between probability distributions defined on distinct metric spaces. For two probability distributions $\mu$ and $\nu$ in a Euclidean feature space $\mathbb{X}$ and a hyperbolic space $\mathbb{H}$ , respectively, the GW distance is defined as: + +$$ +\operatorname {G W} (\mu , \nu): := \min _ {\pi \in \Pi (\mu , \nu)} \mathbb {E} _ {\left((\mathbf {x}, \mathbf {y}), \left(\mathbf {x} ^ {\prime}, \mathbf {y} ^ {\prime}\right)\right) \sim \pi^ {2}} \left[ \left| c _ {\mathbb {X}} \left(\mathbf {x}, \mathbf {x} ^ {\prime}\right) - c _ {\mathbb {H}} \left(\mathbf {y}, \mathbf {y} ^ {\prime}\right) \right| ^ {2} \right] \tag {8} +$$ + +where $c_{\mathbb{X}}$ and $c_{\mathbb{H}}$ represent the cost functions in the two spaces, and $\varPi(\mu,\nu)$ denotes the set of transport plans between $\mu$ and $\nu$ , which contains all joint distributions whose first and second marginals are given by $\mu$ and $\nu$ , respectively. By comparing the pairwise distances between two probability distributions to evaluate the similarity of geometric structures across different metric spaces. + +When working with HNNs, an explicit map $T$ from $\mathbb{X}$ to $\mathbb{H}$ is induced by the HNN layers, as illustrated in Fig. 2. The minimization problem presented in (8) can be reformulated as a Gromov-Monge (GM) distance minimization problem concerning a map $T$ , defined as + +$$ +\operatorname {G M} (\mu , \nu) := \min _ {T _ {\#} \mu = \nu} \underset {(\mathbf {x}, \mathbf {x} ^ {\prime}) \sim \mu^ {2}} {\mathbb {E}} \left[ \left| c _ {\mathbb {X}} \left(\mathbf {x}, \mathbf {x} ^ {\prime}\right) - c _ {\mathbb {H}} \left(T (\mathbf {x}), T \left(\mathbf {x} ^ {\prime}\right)\right) \right| ^ {2} \right]. \tag {9} +$$ + +In an HNN, when embedding the probability distribution $\mu$ from a Euclidean space to a hyperbolic space, we can consider minimizing the following cost over $T\in \mathcal{H}$ , where $\mathcal{H}$ is a hypothesis class determined by the HNN: + +$$ +\operatorname {G M} (T; \mu) := \underset {(\mathbf {x}, \mathbf {x} ^ {\prime}) \sim \mu^ {2}} {\mathbb {E}} \left[ \left| c _ {\mathbb {X}} (\mathbf {x}, \mathbf {x} ^ {\prime}) - c _ {\mathbb {H}} (T (\mathbf {x}), T (\mathbf {x} ^ {\prime})) \right| ^ {2} \right]. \tag {10} +$$ + +![](images/d6ec6beb4b8a11c607571c42ac4bf2a3e5b98a47e5b92a66752c73fd707fe74f.jpg) +Fig. 3: The framework of our GW regularization. + +Thus, we have $\min_{T\in \mathcal{H}}\mathrm{GM}(\mu ,T_{\#}\mu) = \min_{T\in \mathcal{H}}\mathrm{GM}(T;\mu)$ . While the GM problem described in (9) is highly challenging due to its pushforward constraint, minimizing the cost function in (10) is comparatively easier, as it does not require the pushforward constraint. + +In practical implementation, we can employ the simple cost function $c_{\mathbb{X}}(\mathbf{x}, \mathbf{x}^{\prime}) = \| \mathbf{x} - \mathbf{x}^{\prime} \|^{2}$ or other cost functions such as $c_{\mathbb{X}}(\mathbf{x}, \mathbf{x}^{\prime}) = \log \left(1 + \| \mathbf{x} - \mathbf{x}^{\prime} \|^{2}\right)$ . Additionally, the explicit form of $c_{\mathbb{H}}$ can be derived from equations (4) and (7): we can use $c_{\mathbb{H}} = d_{\mathbb{H}}^{c}$ or $c_{\mathbb{H}} = \log \left(1 + d_{\mathbb{H}}^{c}\right)$ , where $\mathbb{H} = \mathbb{B}$ or $\mathbb{H} = \mathbb{L}$ . + +When we have data points $\{\mathbf{x}_i\}_{i=1}^m$ sampled independently and identically distributed (i.i.d.) from $\mu$ , we consider an empirical version of the GM distance, namely, + +$$ +\operatorname {G M} (T; \left\{\mathbf {x} _ {i} \right\} _ {i = 1} ^ {m}) = \frac {1}{m (m - 1)} \sum_ {i, j = 1} ^ {m} \left| c _ {\mathbb {X}} \left(\mathbf {x} _ {i}, \mathbf {x} _ {j}\right) - c _ {\mathbb {H}} \left(T \left(\mathbf {x} _ {i}\right), T \left(\mathbf {x} _ {j}\right)\right) \right| ^ {2}. \tag {11} +$$ + +The overall framework of our GW regularization is shown in Fig. 3. Here, $\{\mathbf{x}_i\}_{i=1}^m$ are the Euclidean features that are fed into the HNN layers denoted by $T$ , $\{\mathbf{z}_i\}_{i=1}^m$ are the hyperbolic representations so that $\mathbf{z}_i = T(\mathbf{x}_i)$ for each $i$ . The GM distance, calculated according to (11), is used as a penalty term, multiplied with a hyperparameter $\beta$ and then added to the loss function associated with the specific task. + +Generalization analysis In the tasks we consider, the ability to generalize beyond the given data points is essential. Although (11) only provides a formulation based on the training data, we anticipate that it will serve as an effective approximation of (10), provided that the training set $\{\mathbf{x}_i\}_{i=1}^m$ adequately captures the characteristics of the underlying distribution $\mu$ . This expectation is encapsulated in the theorem we present below, which formalizes the relationship between the pointwise formulation and its distributional approximation under the condition of a representative sample. + +Theorem 1. Given cost functions $c_{\mathbb{X}}$ and $c_{\mathbb{H}}$ , suppose that there exists a constant $0 < \alpha \leq 1$ for which $T$ satisfies the following bi-Lipschitz condition: + +$$ +\alpha c _ {\mathbb {X}} \left(\mathbf {x}, \mathbf {x} ^ {\prime}\right) \leq c _ {\mathbb {H}} \left(T (\mathbf {x}), T \left(\mathbf {x} ^ {\prime}\right)\right) \leq \frac {1}{\alpha} c _ {\mathbb {X}} \left(\mathbf {x}, \mathbf {x} ^ {\prime}\right), \tag {12} +$$ + +for any $\mathbf{x},\mathbf{x}^{\prime}\in \mathbb{X}$ . Let $\mu$ be a distribution defined on $\mathbb{X}$ and $\{\mathbf{x}_i\}_{i = 1}^m$ be i.i.d. sampled from $\mu$ . Then, + +$$ +\left| \operatorname {G M} \left(T; \left\{\mathbf {x} _ {i} \right\} _ {i = 1} ^ {m}\right) - \operatorname {G M} (T; \mu) \right| \leq C \frac {(1 / \alpha - 1) ^ {2}}{R ^ {2}} \tag {13} +$$ + +holds with probability at least $1 - 2\exp \left(-\frac{mC}{8R^4}\right)$ where $C$ is a constant depending on $\mu$ and $R\coloneqq \max_{\mathbf{x},\mathbf{x}^{\prime}\in \mathrm{supp}(\mu)}c_{\mathbb{X}}(\mathbf{x},\mathbf{x}^{\prime})$ + +The proof of Theorem 1 is presented in the appendix. + +Complexity analysis Since the time complexity for calculating each Euclidean distance is $O(n)$ and the time complexity for calculating each hyperbolic distance (in either the Poincaré ball model or the Lorentz model) is $O(n)$ , the time complexity for calculating the GW regularization term is $O(nm^2)$ . + +Note that, if we only consider linear layers in an $L$ -layer Vanilla HNN, the time complexity is $O(mn^{2}L)$ . In the few-shot learning task and the semi-supervised graph node-level tasks that we consider in this paper, the number of data points $m$ is usually smaller than or comparable with $n$ . Moreover, in tasks such as link prediction, one also needs to compare pairs of data points, leading to a time complexity of $O(mn^{2}L)$ in computing the task loss. Therefore, adding the regularization term will not lead to change of the order of time complexity. + +# 4 Experiments + +To validate the effectiveness of the GW regularization method, we conduct experiments on both image datasets and graph datasets. We present results on few-shot image classification in Section 4.1 and results on graph node classification and link prediction in Section 4.2. All the presented experiments are implemented on a server with RTX 4090 (24GB) GPUs, where each implementation runs on a single GPU. The implementation of our proposed methods can be accessed at https://github.com/yyf1217/GW-Regularization. + +# 4.1 Few-Shot Image Classification + +We consider the important task of few-shot image classification where the goal is to recognize new categories with very few labeled examples per class. Unlike supervised image classification, this task aims to generalize from a small number of examples, typically one to five images per class. Learning structures of images is crucial since there is very limited labeled data. + +![](images/04748d46788b31df74ddaa321fb60648eb3f263939cd8c7236853d96b91a11ba.jpg) +Fig. 4: The framework of the GW regularized hyperbolic ProtoNet model. + +Datasets We consider two widely used image datasets, namely MiniImageNet [36] and Caltech-UCSD Birds-200-2011 (CUB) [37]. These datasets have been used in [14], where the hyperbolic ProtoNet model excels Euclidean baselines. The MiniImageNet dataset is a subset of the ImageNet dataset [7]. It comprises images from 100 classes, with 600 images per class. The classes have a $64/16/20$ split for training/validation/test. The CUB dataset consists of 200 categories of bird images, totaling 11,788 pictures. In this dataset, the training/validation/test split is $100/50/50$ . + +Setting We apply our GW regularization on the hyperbolic ProtoNet model [14], which primarily consists of convolutional neural network (CNN) layers used for feature extraction from Euclidean image data and subsequent HNN layers for classification. In [14], the HNN layers are taken to be a simple exponential map from the Euclidean space to the Poincaré ball. In our implementation, we utilize the publicly available code for the hyperbolic ProtoNet model from https://github.com/leymir/hyperbolic-image-embeddings. + +For clarity, we illustrate the framework for this task in Fig. 4, which is based on Fig. 3. We take the features $\{\mathbf{x}_i\}_{i=1}^m$ from the output of the CNN layers, and then the HNN layers process them into $\{\mathbf{z}_i\}_{i=1}^m$ . Following this, the hyperbolic distance between each hyperbolic embedding $\mathbf{z}_i$ and the origin of the Poincaré ball is computed according to (4), which is then used to calculate the maximum class probability. Finally, the cross-entropy loss is computed using the maximum class probability and the labels. We add $\beta \mathrm{GM}(T; \{\mathbf{x}_i\}_{i=1}^m)$ to the cross-entropy loss to formulate our regularized loss function. + +We consider various CNN architectures including Conv4, ResNet10, ResNet12, and ResNet18. The HNN layers within the model incorporate linear layers from [10]. Additionally, ReLU is used as the activation function across the model. For Conv4, the embedding dimension is set to 1,600, while for ResNet10, ResNet12, and ResNet18, the embedding dimension is set to 512. The initial learning rate is 0.001. We consider both the 1-Shot 5-Way and 5-Shot 5-Way settings, which means there are five classes involved for the task and only one/five examples per class for training. In all experiments for the 1-Shot 5-Way task, a consistent + +Table 1: Hyperparameters used in few-shot image classification. "ResNet" abbreviated as "Res" due to space constraints. + +
Initial learning rate (lr)β
Conv4Res10Res12Res18Conv4Res10Res12Res18
MiniImageNet1-Shot 5-Way0.00050.0010.0010.0010.60.50.10.7
5-Shot 5-Way0.010.0010.0010.001140.10.50.5
CUB1-Shot 5-Way0.0010.0010.0010.0010.020.0150.150.1
5-Shot 5-Way0.010.0010.0010.0010.070.010.250.1
+ +curvature parameter of $-0.08$ is employed. Similarly, for the 5-Shot 5-Way task, we uniformly set the curvature to $-0.01$ throughout all experiments. Both curvatures agree with the recommended settings in the original hyperbolic ProtoNet. The hyperparameter $\beta$ is selected according to the validation set. We report the initial learning rate as well as the best $\beta$ in Table 1. + +Results We present our numerical results for both the 1-Shot 5-Way and 5-Shot 5-Way settings in Table 2. We randomly sample 10,000 data points from the test set to evaluate the performance of the model and report $95\%$ confidence intervals for all results. Each entry reports the average classification accuracy, including means and standard deviations. + +Table 2: Accuracy (%) results for few-shot image classification. + +
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv453.77±0.2071.33±0.1664.66±0.2380.29±0.16
Conv4+GW55.57±0.2273.04±0.1668.67±0.2380.54±0.16
ResNet1056.45±0.2165.39±0.1772.01±0.2280.75±0.15
ResNet10+GW57.50±0.2267.62±0.1772.67±0.2283.73±0.14
ResNet1255.96±0.2270.32±0.1775.77±0.2282.90±0.15
ResNet12+GW56.95±0.2273.04±0.1677.24±0.2185.66±0.14
ResNet1857.04±0.2268.43±0.1671.86±0.2285.31±0.13
ResNet18+GW58.51±0.2271.64±0.1672.64±0.2285.83±0.13
+ +From the results, we observe that our GW regularization consistently boosts the accuracy of the model. This improvement is evident in both datasets and both scenarios, regardless of the underlying CNN architecture. For most CNN architectures, the improvement is more evident in the 5-Shot 5-Way scenario + +than in the 1-Shot 5-Way scenario. We believe that this can be attributed to the increased number of training instances available in the 5-Shot scenario, which provides a richer structure that GW regularization can leverage. + +Runtime We report the average run time for training one epoch in Table 3. As anticipated, incorporating GW regularization results in extended epoch training times. However, the increase in runtime is not significant, aligning with the time complexity analysis in Section 3.2. This observation underscores the efficiency of our GW regularization approach, ensuring that the added computational demand does not impose a significant burden on the overall training process. + +Table 3: Average runtime (in seconds) for training one epoch in few-shot image classification. + +
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv431.225.232.432.9
Conv4+GW33.626.435.132.9
ResNet1037.228.838.434.9
ResNet10+GW40.834.843.238.4
ResNet1242.036.046.842.0
ResNet12+GW45.640.850.445.6
ResNet1855.243.260.052.8
ResNet18+GW57.649.262.457.6
+ +# 4.2 Semi-Supervised Link Prediction and Node Classification + +We consider graph link prediction and node classification, which are widely benchmarked semi-supervised tasks in graph deep learning literature. + +Datasets We consider nine datasets for node classification, namely Cora, Disease, Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor. For the first three datasets, namely Disease, Airport, and Cora, we also perform link prediction. We briefly introduce the datasets in the appendix and summarize the statistics of the graphs in Table 4. + +In link prediction tasks, we randomly split edges into $85\% / 5\% / 10\%$ for training, validation, and test sets. For node classification tasks, we use a $70\% / 15\% / 15\%$ splits for Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor, we use $30\% / 10\% / 60\%$ splits for Disease, and we use standard splits with 20 train examples per class for Cora. The above split settings agree with standard settings in the baseline papers. + +Table 4: Statistics of graph datasets. + +
Disease-LPDisease-NCAirportCoraCornellTexasWisconsinChameleonSquirrelActor
# nodes2,6651,0443,1882,7081831832512,2775,2017,600
# edges2,2652,26515,8374,48828029546631,421198,49326,752
# features111,000111,4331,7031,7031,7032,3252,089931
# classesN/A247555555
+ +Setting For the graph datasets, we consider the following three HNNs: the vanilla HNN [10], HGCN [5], and HyboNet [6]. We utilize the publicly available code for HNN and HGCN from https://github.com/HazyResearch/hgcn and HyboNet from https://github.com/chenweize1998/fully-hyperbolic-nn. + +For each model, we apply GW distance to the input node features and their hyperbolic representations after applying the Euclidean-to-hyperbolic operation. The regularization framework is the same as Fig. 3. + +In these experiments, the HNN models share a common architecture consisting of HNN layers and output layers. These models employ different HNN layers to extract features from graph data and generate hyperbolic embeddings $\{\mathbf{z}_i\}_{i=1}^m$ . Specifically, the Vanilla HNN and HGCN employ the Poincaré model to build linear layers and activation. HGCN also has aggregation operation, facilitating message passing. Differently, HyboNet employs the linear layers and aggregation in the Lorentz model. The output layers are used to accomplish various tasks. For node classification, the obtained hyperbolic embeddings are directly projected to the Euclidean space. A linear layer is then used to predict the class probabilities, with which the negative log-likelihood loss is computed. For link prediction, the hyperbolic distances between the hyperbolic embeddings are computed. Subsequently, the Fermi-Dirac algorithm [15] is employed to transform the hyperbolic distances into the edge probabilities. Finally, cross-entropy losses are computed using these edge probabilities and the true edge labels. + +For simplicity, the curvature of the hyperbolic space is set as $-1$ for all experiments, which is a common setting for graph datasets. Tables 5 and 6 list hyperparameters such as initial learning rate, the number of the HNN layers, weight decay, dropout, and embedding dimensions. The hyperparameter $\beta$ from validation is also listed for different datasets. + +Table 5: Hyperparameters used in the Vanilla HNN and HGCN. + +
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNC
Initial lr0.010.010.010.010.010.010.010.010.010.010.010.01
# layers222222222222
Weight decay0.00.0010.00050.00.0050.0010.0010.0010.0010.0010.0010.001
Dropout0.00.10.00.00.50.50.50.50.50.50.50.5
# embeddings316161616161616161655
HNN β0.90.0821.250.50.350.250.10.150.020.0010.03
HGCN β0.30.0921.50.10.60.250.150.20.080.010.03
+ +Table 6: Hyperparameters used in HyboNet. + +
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNCNCNCNCNCNC
Initial lr0.0050.0050.010.020.020.020.0050.0050.0050.0050.0050.0050.0050.010.010.01
# layers2426232222222222
Weight decay0.00.00.00.00010.0010.010.00.00.00.00.00.00.00.0010.0010.001
Dropout0.00.10.00.00.70.90.20.20.20.20.20.20.20.20.20.2
# embeddings16161616161616161616161616161616
β0.30.071.51.10.250.250.130.10.10.11.31.32.50.010.010.01
+ +Results For the link prediction task, we report the AUC scores in Table 7. For the node classification task, we report the F1 scores, in Table 8. Each score reports the average from three random runs as well as the standard deviation. For clarity, we just use "HNN" in place of the Vanilla HNN in the tables. + +Table 7: AUC (%) results of the link prediction task. + +
DiseaseAirportCora
HNN92.83±1.8393.56±0.3088.80±1.29
HNN+GW94.45±0.5894.23±0.3389.76±2.07
HGCN92.41±1.7893.42±0.1593.37±0.15
HGCN+GW93.79±1.1595.81±0.0293.48±0.22
HYBONET95.65±0.5796.18±0.0592.04±0.37
HYBONET+GW96.58±0.5796.44±0.0293.33±0.22
+ +From Table 7, it is evident that our GW regularization consistently enhances the AUC scores across different network architectures and across all datasets. Similarly, Table 8 showcases that GW regularization again demonstrates a positive impact on model performance across various datasets and architectures. In many scenarios of node classification, GW regularization actually achieves substantial improvement, such as HNN+GW for Disease, HGCN+GW for Cornell and HyboNet+GW for Wisconsin. + +Runtime We report the average run time for training one epoch for link prediction in Table 9. Similarly to the previous experiment, the runtime for GW regularized training is longer, but not significantly. This again aligns with the complexity analysis in Section 3.2. + +# 5 Conclusion + +In this paper, we have delved into the integration of the GW distance as a novel regularization term within the realms of hyperbolic neural networks, with a par- + +Table 8: F1 (%) result of the node classification task. + +
DiseaseAirportCoraChameleonSquirrel
HNN58.40±2.5387.40±1.3453.73±0.9171.43±1.6347.89±2.21
HNN+GW65.62±1.9889.38±0.6755.33±0.3572.53±0.1949.44±1.05
HGCN93.04±1.6486.96±0.2279.47±1.0177.72±0.9051.79±0.58
HGCN+GW95.28±0.4087.91±0.7280.00±0.6279.18±1.6452.70±1.24
HYBONET85.70±0.6093.13±0.1973.53±0.7582.05±0.5574.04±2.42
HYBONET+GW87.66±1.2194.46±0.2079.40±0.9583.58±0.2877.27±0.78
CornellTexasWisconsinActor
HNN93.94±1.3194.69±1.3193.21±3.8642.63±1.73
HNN+GW95.45±2.2896.97±1.3298.15±1.8545.03±1.73
HGCN83.33±3.4778.79±4.7375.31±2.8336.39±1.00
HGCN+GW88.64±2.2881.82±3.9483.33±1.8639.19±0.67
HYBONET78.79±4.7367.42±3.4774.07±1.8645.74±2.13
HYBONET+GW81.82±3.9374.24±1.3180.87±3.8649.64±0.38
+ +Table 9: Average runtime (in seconds) for training one epoch in link prediction. + +
DiseaseAirportCora
HNN0.03010.08810.0549
HNN+GW0.03130.08840.0563
HGCN0.04890.10750.0743
HGCN+GW0.05050.10780.0747
HYBONET0.03010.06310.0374
HYBONET+GW0.03230.06390.0379
+ +ticular emphasis on leveraging the GM formulation. This approach has allowed for a sophisticated comparison of distributions across the Euclidean space and the hyperbolic space, capturing the essence of the underlying structures while not increasing the order of the time complexity. We have demonstrated that the hyperbolic embeddings of the data points resonate closely with distributions where they are sampled from. + +Our regularization method has been rigorously tested and validated across diverse datasets including image data for the few-shot classification task and graph data for the semi-supervised link prediction and node classification tasks, showcasing a uniform elevation in performance metrics. + +Our future work involves more efficient methods in large scale settings, where the number of instances is much larger than feature dimensions. Additionally, we are intrigued by the potential of integrating our GW regularization framework with emerging geometric deep learning architectures for complex data structures, where the flexibility with the choice of underlying spaces is crucial. + +# Acknowledgement + +YY and DZ acknowledge funding from National Natural Science Foundation of China (NSFC) under award number 12301117, WL acknowledges funding from the National Institute of Standards and Technology (NIST) under award number 70NANB22H021, and GL acknowledges funding from NSF award DMS 2124913. + +# References + +1. Alvarez-Melis, D., Jaakkola, T.S.: Gromov-Wasserstein alignment of word embedding spaces. arXiv preprint arXiv:1809.00013 (2018) +2. Atigh, M.G., Schoep, J., Acar, E., van Noord, N., Mettes, P.: Hyperbolic image segmentation. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022) +3. Bachmann, G., Bécigneul, G., Ganea, O.: Constant curvature graph convolutional networks. In: Int. Conf. Mach. Learn. pp. 486-496. PMLR (2020) +4. Bunne, C., Alvarez-Melis, D., Krause, A., Jegelka, S.: Learning generative models across incomparable spaces. In: Int. Conf. Mach. Learn. pp. 851-861. PMLR (2019) +5. Chami, I., Ying, Z., Ré, C., Leskovec, J.: Hyperbolic graph convolutional neural networks. Adv. Neural Inform. Process. Syst. 32, 4868-4879 (2019) +6. Chen, W., Han, X., Lin, Y., Zhao, H., Liu, Z., Li, P., Sun, M., Zhou, J.: Fully hyperbolic neural networks. In: Annu. Meeting Assoc. Comput. Linguistics. pp. 5672-5686 (2022) +7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009) +8. Dumont, T., Lacombe, T., Vialard, F.X.: On the existence of Monge maps for the Gromov-Wasserstein problem (2022) +9. Fan, X., Yang, C.H., Vemuri, B.C.: Nested hyperbolic spaces for dimensionality reduction and hyperbolic NN design. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022) +10. Ganea, O., Bécigneul, G., Hofmann, T.: Hyperbolic neural networks. Adv. Neural Inform. Process. Syst. 31, 5345-5355 (2018) +11. Gulcehre, C., Denil, M., Malinowski, M., Razavi, A., Pascanu, R., Hermann, K.M., Battaglia, P., Bapst, V., Raposo, D., Santoro, A., de Freitas, N.: Hyperbolic attention networks. In: Int. Conf. Learn. Represent. (2019), https://openreview.net/forum?id=rJxHsjRqFQ +12. Guo, Y., Guo, H., Yu, S.X.: Co-SNE: Dimensionality reduction and visualization for hyperbolic data. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022) +13. Huang, Y., Zhang, T., Zhu, H.: Improving word alignment by adding Gromov-Wasserstein into attention neural network. In: J. Phys. Conf. Ser. vol. 2171, p. 012043. IOP Publishing (2022) +14. Khrulkov, V., Mirvakhabova, L., Ustinova, E., Oseledets, I., Lempitsky, V.: Hyperbolic image embeddings. In: IEEE Conf. Comput. Vis. Pattern Recog. (2020) +15. Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguná, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010) +16. Lee, W., Yang, Y., Zou, D., Lerman, G.: Monotone generative modeling via a gromov-monge embedding. arXiv e-prints (2023) +17. Li, X., Qiu, Z., Zhao, X., Wang, Z., Zhang, Y., Xing, C., Wu, X.: Gromov-Wasserstein guided representation learning for cross-domain recommendation. In: ACM Int. Conf. Inf. Knowl. Manage. pp. 1199-1208 (2022) + +18. Liu, Q., Nickel, M., Kiela, D.: Hyperbolic graph neural networks. Adv. Neural Inform. Process. Syst. 32, 8230-8241 (2019) +19. Mémoli, F.: On the use of Gromov-Hausdorff distances for shape comparison. In: PBG@Eurographics (2007) +20. Mémoli, F.: Gromov-Wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11, 417-487 (2011) +21. Mémoli, F., Needham, T.: Distance distributions and inverse problems for metric measure spaces. Stud. Appl. Math. 149(4), 943-1001 (2022) +22. Nakagawa, N., Togo, R., Ogawa, T., Haseyama, M.: Gromov-Wasserstein autoencoders. In: Int. Conf. Learn. Represent. (2023), https://openreview.net/forum?id=sbS10BCtC7 +23. Nickel, M., Kiela, D.: Poincaré embeddings for learning hierarchical representations. Adv. Neural Inform. Process. Syst. 30 (2017) +24. Nickel, M., Kiela, D.: Learning continuous hierarchies in the lorentz model of hyperbolic geometry. In: Int. Conf. Mach. Learn. (2018) +25. Nikolentzos, G., Chatzianastasis, M., Vazirgiannis, M.: Weisfeiler and Leman go hyperbolic: Learning distance preserving node representations. In: Int. Conf. Artif. Intell. Statist. pp. 1037-1054 (2023) +26. Peng, W., Varanka, T., Mostafa, A., Shi, H., Zhao, G.: Hyperbolic deep neural networks: A survey. IEEE Trans. Pattern Anal. Mach. Intell. (December 2021) +27. Peyre, G., Cuturi, M., Solomon, J.: Gromov-Wasserstein averaging of kernel and distance matrices. In: Int. Conf. Mach. Learn. pp. 2664-2672. PMLR (2016) +28. Sala, F., De Sa, C., Gu, A., Ré, C.: Representation tradeoffs for hyperbolic embeddings. In: Int. Conf. Mach. Learn. (2018) +29. Sarkar, R.: Low distortion delaunay embedding of trees in hyperbolic plane. In: Int. Symp. Graph Drawing. pp. 355-366. Springer (2011) +30. Schmitzer, B., Schnörr, C.: Modelling convex shape priors and matching based on the Gromov-Wasserstein distance. J. Math. Imaging Vision 46, 143-159 (2013) +31. Shimizu, R., Mukuta, Y., Harada, T.: Hyperbolic neural networks++. In: Int. Conf. Learn. Represent. (2021) +32. Sonthalia, R., Gilbert, A.: Tree! I am no tree! I am a low dimensional hyperbolic embedding. Adv. Neural Inform. Process. Syst. 33, 845-856 (2020) +33. Sturm, K.T.: The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces, vol. 290. American Mathematical Society (2023) +34. Tifrea, A., Bécigneul, G., Ganea, O.E.: Poincaré glove: Hyperbolic word embeddings. In: Int. Conf. Learn. Represent. (2018) +35. Titouan, V., Flamary, R., Courty, N., Tavenard, R., Chapel, L.: Sliced Gromov-Wasserstein. Adv. Neural Inform. Process. Syst. 32 (2019) +36. Vinyals, O., Blundell, C., Lillicrap, T., Wierstra, D., et al.: Matching networks for one shot learning. Adv. Neural Inform. Process. Syst. 29 (2016) +37. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The Caltech-UCSD birds-200-2011 dataset (2011) +38. Xu, H., Luo, D., Carin, L.: Scalable Gromov-Wasserstein learning for graph partitioning and matching. Adv. Neural Inform. Process. Syst. 32 (2019) +39. Xu, H., Luo, D., Zha, H., Carin, L.: Gromov-Wasserstein learning for graph matching and node embedding. In: Int. Conf. Mach. Learn. pp. 6932-6941. PMLR (2019) +40. Yang, M., Zhou, M., Li, Z., Liu, J., Pan, L., Xiong, H., King, I.: Hyperbolic graph neural networks: A review of methods and applications (2022) +41. Zhou, Y., Sharpee, T.O.: Hyperbolic geometry of gene expression. Iscience 24(3) (2021) \ No newline at end of file diff --git a/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/images.zip b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..0dc3d425804a3a12a51e249d877cf5011370c48c --- /dev/null +++ b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:84c548350449c34eec00a0dc6d33e446d4c43bb8d3b4b9969b683b7088062c20 +size 643209 diff --git a/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/layout.json b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..d53ad6b557c9f49024ce81b9a8d732534af0cdb3 --- /dev/null +++ b/2024/Improving Hyperbolic Representations via Gromov-Wasserstein Regularization/layout.json @@ -0,0 +1,9035 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 159, + 111, + 455, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 111, + 455, + 148 + ], + "spans": [ + { + "bbox": [ + 159, + 111, + 455, + 148 + ], + "type": "text", + "content": "Improving Hyperbolic Representations via Gromov-Wasserstein Regularization" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "spans": [ + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "text", + "content": "Yifei Yang" + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "text", + "content": ", Wonjun Lee" + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "text", + "content": ", Dongmian Zou" + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "text", + "content": ", and Gilad Lerman" + }, + { + "bbox": [ + 153, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 204, + 189, + 410, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 204, + 189, + 410, + 201 + ], + "spans": [ + { + "bbox": [ + 204, + 189, + 410, + 201 + ], + "type": "text", + "content": "1 Wuhan University, Wuhan, Hubei 430072, China" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 266, + 202, + 347, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 266, + 202, + 347, + 212 + ], + "spans": [ + { + "bbox": [ + 266, + 202, + 347, + 212 + ], + "type": "text", + "content": "yflyang@whu.edu.cn" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 191, + 212, + 423, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 191, + 212, + 423, + 223 + ], + "spans": [ + { + "bbox": [ + 191, + 212, + 423, + 223 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 191, + 212, + 423, + 223 + ], + "type": "text", + "content": " University of Minnesota, Minneapolis, MN 55455, USA" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 247, + 224, + 367, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 224, + 367, + 233 + ], + "spans": [ + { + "bbox": [ + 247, + 224, + 367, + 233 + ], + "type": "text", + "content": "{lee01273,lerman}@umn.edu" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 181, + 234, + 433, + 244 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 181, + 234, + 433, + 244 + ], + "spans": [ + { + "bbox": [ + 181, + 234, + 433, + 244 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 181, + 234, + 433, + 244 + ], + "type": "text", + "content": " Duke Kunshan University, Kunshan, Jiangsu 215316, China" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 257, + 246, + 357, + 256 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 246, + 357, + 256 + ], + "spans": [ + { + "bbox": [ + 257, + 246, + 357, + 256 + ], + "type": "text", + "content": "dongmian.zou@duke.edu" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 159, + 283, + 455, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 283, + 455, + 460 + ], + "spans": [ + { + "bbox": [ + 159, + 283, + 455, + 460 + ], + "type": "text", + "content": "Abstract. Hyperbolic representations have shown remarkable efficacy in modeling inherent hierarchies and complexities within data structures. Hyperbolic neural networks have been commonly applied for learning such representations from data, but they often fall short in preserving the geometric structures of the original feature spaces. In response to this challenge, our work applies the Gromov-Wasserstein (GW) distance as a novel regularization mechanism within hyperbolic neural networks. The GW distance quantifies how well the original data structure is maintained after embedding the data in a hyperbolic space. Specifically, we explicitly treat the layers of the hyperbolic neural networks as a transport map and calculate the GW distance accordingly. We validate that the GW distance computed based on a training set well approximates the GW distance of the underlying data distribution. Our approach demonstrates consistent enhancements over current state-of-the-art methods across various tasks, including few-shot image classification, as well as semi-supervised graph link prediction and node classification." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 160, + 468, + 453, + 479 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 468, + 453, + 479 + ], + "spans": [ + { + "bbox": [ + 160, + 468, + 453, + 479 + ], + "type": "text", + "content": "Keywords: Gromov-Wasserstein distance " + }, + { + "bbox": [ + 160, + 468, + 453, + 479 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 468, + 453, + 479 + ], + "type": "text", + "content": " Hyperbolic neural networks" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 160, + 479, + 349, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 479, + 349, + 491 + ], + "spans": [ + { + "bbox": [ + 160, + 479, + 349, + 491 + ], + "type": "text", + "content": "·Few-shot learning " + }, + { + "bbox": [ + 160, + 479, + 349, + 491 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 479, + 349, + 491 + ], + "type": "text", + "content": " Semi-supervised learning" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 510, + 230, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 230, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 230, + 521 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 533, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 640 + ], + "type": "text", + "content": "The success of many machine learning applications relies on effectively capturing the geometric intricacies of complex data structures. This challenge necessitates a careful selection of the underlying space that aligns with the inherent properties of data. In this context, hyperbolic spaces have emerged as a popular choice for modeling data with hierarchical structures such as lexical databases [23] and phylogenetic trees [28]. This is attributed to their distinctive capacity to embody exponential growth and branching patterns, a feature rooted in their constant negative curvature. Such a geometric framework can reflect the tree-like architectures that are ubiquitous across numerous real-world networks." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 642, + 481, + 666 + ], + "type": "text", + "content": "Interestingly, hyperbolic spaces also play a significant role in computer vision [2, 14], particularly in tasks like image classification and object recognition" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 142, + 119, + 478, + 302 + ], + "blocks": [ + { + "bbox": [ + 142, + 119, + 478, + 302 + ], + "lines": [ + { + "bbox": [ + 142, + 119, + 478, + 302 + ], + "spans": [ + { + "bbox": [ + 142, + 119, + 478, + 302 + ], + "type": "image", + "image_path": "5ed87fd2a1729b52bda7b4a3ece2d6ef06ba6a3ef22f063c1e9d854370ce2116.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 312, + 482, + 335 + ], + "lines": [ + { + "bbox": [ + 131, + 312, + 482, + 335 + ], + "spans": [ + { + "bbox": [ + 131, + 312, + 482, + 335 + ], + "type": "text", + "content": "Fig. 1: Illustration of hierarchical structures in image data. The images are taken from the MiniImagenet dataset." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 362, + 482, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 362, + 482, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 482, + 434 + ], + "type": "text", + "content": "where hierarchical relationships among instances and concepts are common. For example, within the broader category of animals, there are dogs, which further subdivide into breeds such as bulldogs, Gordon setters, Newfoundland dogs, etc. This is illustrated in Fig. 1. Hyperbolic embeddings can capture these hierarchies, thereby potentially improving classification performance and providing more interpretable models." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 436, + 482, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 436, + 482, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 436, + 482, + 639 + ], + "type": "text", + "content": "In crafting hyperbolic representations from non-hyperbolic features, two main strategies emerge: principled design and data-driven learning. The principled approach, exemplified by methods like Sarkar's algorithm [29], focuses on constructing embeddings that rigorously preserve the inherent geometric structure from data. This method particularly excels at maintaining hierarchical relationships within the data, ensuring that the embedded representation reflects structure of the original dataset with low distortion. On the other hand, the data-driven approach leverages the capabilities of end-to-end neural networks to learn the hyperbolic embedding directly from data. Such neural networks are well-known as hyperbolic neural networks (HNNs), which are pioneered in [10]. HNNs prioritize the development of hyperbolically coherent neural operations that are expressive and mirror the Euclidean counterparts. When dealing with input that is primarily Euclidean, HNNs employ straightforward operations, such as exponential maps, to transition features into the hyperbolic space, thereafter learning to extract deep features in a manner driven by the data. This method adapts the embedding to specific tasks, potentially unveiling intricate patterns and relationships inherent within data." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "In our work, we aim to establish a methodology that integrates the benefits of low-distortion embedding into data-driven learning. In the context of learning" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 200 + ], + "type": "text", + "content": "where generalization is the goal, we can view hyperbolic embedding as a method of embedding the data distribution into hyperbolic spaces. Therefore, we need to compare the distributions before and after the embedding. This necessitates a comparison of data distributions before and after embedding, which is complicated by the fundamental differences in geometric principles, such as curvature and dimensionality, that govern Euclidean and hyperbolic spaces. Direct comparisons between such disparate spaces are inherently complex and challenging." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 200, + 480, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 200, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 200, + 480, + 331 + ], + "type": "text", + "content": "To address this challenge, we rely on the Gromov-Wasserstein (GW) distance [19], a tool proven effective in comparing distributions across diverse metric spaces. Specifically, we employ the Gromov-Monge (GM) formulation, an alternative form of the GW distance, to compute the explicit transport map between heterogeneous metric spaces. The HNN layers induce the embedding distribution, thus serving as the transport map. Consequently, the GM formulation is a more suitable approach for the corresponding HNN layers. However, implementing the GM distance poses computational challenges due to its complex constraints. Therefore, in light of this, we extend the GM-based embedding technique introduced in [16] to compute the geometry-preserving transport map from data distribution in Euclidean space to hyperbolic spaces." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 331, + 424, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 331, + 424, + 342 + ], + "spans": [ + { + "bbox": [ + 146, + 331, + 424, + 342 + ], + "type": "text", + "content": "The contribution of the current work is summarized as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 135, + 350, + 479, + 491 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 136, + 350, + 479, + 408 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 350, + 479, + 408 + ], + "spans": [ + { + "bbox": [ + 136, + 350, + 479, + 408 + ], + "type": "text", + "content": "1. We propose a novel methodology that incorporates the GM distance into an end-to-end learning framework for hyperbolic representation learning. This approach ensures a more faithful representation of the intrinsic hierarchical structures. Moreover, we verify that our approach maintains computational efficiency by analyzing its time complexity." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 136, + 409, + 479, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 409, + 479, + 453 + ], + "spans": [ + { + "bbox": [ + 136, + 409, + 479, + 453 + ], + "type": "text", + "content": "2. We validate that the embedding faithfully represents an embedding of distributions from the original domain by providing an upper bound for the sampling error. Therefore, regularization on the training sample generalizes to the underlying data distribution." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 135, + 456, + 479, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 456, + 479, + 491 + ], + "spans": [ + { + "bbox": [ + 135, + 456, + 479, + 491 + ], + "type": "text", + "content": "3. We provide empirical evidence showing that our regularization strategy leads to consistent improvements over existing baseline methods when applied to datasets with hierarchical structures, including both image and graph data." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 510, + 242, + 522 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 242, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 242, + 522 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 480, + 665 + ], + "type": "text", + "content": "Hyperbolic embedding The adoption of hyperbolic geometries for representing hierarchical connections between data points has attracted considerable attention. The exploration began when researchers considered low-distortion embedding of tree or tree-like graphs into the hyperbolic domain. In their seminal work, Sarkar [29] showed that a tree can be embedded into the Poincaré disk with arbitrarily low distortion. Sala et al. [28] generalized the embedding to high dimensional Poincaré balls and discussed embedding general graphs into trees. Sonthalia and Gilbert [32] bypassed the intermediary step of general graph structures, opting instead to directly infer tree architectures from the data itself. In addition to combinatorial methods, gradient-based methods are also used in hyperbolic embedding [23, 24]." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Hyperbolic Reps via GW Reg" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 357 + ], + "type": "text", + "content": "Hyperbolic neural networks More recently, the advancement in hyperbolic representation learning has evolved to be more closely aligned with specific end tasks and specific datasets, such as text [34], images [14], biology [41], molecular [18], and knowledge graph [6]. This has led to the emergence of hyperbolic neural networks (HNNs) as a preferred framework for learning their representations. Numerous HNN architectures have emerged [3, 5, 10, 11, 18, 24, 31]. Comprehensive surveys on HNN include [26, 40]. These HNNs define operations that conform with a choice of coordinate system in the hyperbolic space. However, when communicating between the Euclidean features and their hyperbolic embeddings, these HNNs take very simple approaches. For instance, Ganea et al. [10] directly used logarithmic and exponential maps at the origin, leading to unavoidable distortions. There are also very recent works addressing representations learned by HNNs. For instance, CO-SNE [12] reduces the dimensions of hyperbolic features for visualization, which is an analogy to t-SNE in the Euclidean domain. Parallel to this, Fan et al. [9] developed a systematic method for embedding data into nested hyperbolic spaces, which not only results in dimensionality reduction but also extends to design of HNNs. Nikolentzos et al. [25] applied the Weisfeiler-Leman algorithm to capture hierarchy in data and built HNNs accordingly. However, none of the above methods have considered comparing distributions before and after embedding into the hyperbolic space." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 373, + 482, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 373, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 482, + 542 + ], + "type": "text", + "content": "GW distance GW distance, a variant of optimal transport distance, has been widely utilized to quantify structural differences between different distributions. Memoli provided a detailed introduction and study of GW distance in [19, 20]. Subsequently, Sturm [33] presented a more in-depth mathematical exposition of GW distance, focusing on its geodesic structure and gradient flow. Following these foundational works, GW distance has found applications in various fields, including computer vision [27, 30], recommendation systems [17], natural language processing [1], generative models [4, 16, 22, 35]. In particular, Lee et al. [16] employed the GM formulation to achieve geometry-preserving dimension reduction within a generative modeling framework. The discussion on the GM formulation can also be traced to [8, 21]. Moreover, GW distance has been applied to specific data types such as graphs [38, 39] and specific neural network architectures such as transformers [13]. To the best of our knowledge, GW distance has not yet been explored in the context of hyperbolic neural networks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 559, + 233, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 559, + 233, + 574 + ], + "spans": [ + { + "bbox": [ + 132, + 559, + 233, + 574 + ], + "type": "text", + "content": "3 Methodology" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 585, + 354, + 597 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 585, + 354, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 585, + 354, + 597 + ], + "type": "text", + "content": "3.1 Preliminaries of Hyperbolic Geometry" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 481, + 666 + ], + "type": "text", + "content": "Hyperbolic geometry, characterized by its constant negative curvature, represents a non-Euclidean geometry essential for capturing complex hierarchical representations. We review operations that are defined in two different isometric coordinate systems, namely the Poincaré ball (Poincaré disk) model and the Lorentz (hyperboloid) model." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "Poincaré ball model [10,31] The Poincaré ball model for an " + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "-dimensional hyperbolic space with curvature " + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "-c" + }, + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": " is defined by" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 233, + 152, + 480, + 165 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 152, + 480, + 165 + ], + "spans": [ + { + "bbox": [ + 233, + 152, + 480, + 165 + ], + "type": "interline_equation", + "content": "\\mathbb {B} _ {c} ^ {n} = \\left\\{\\mathbf {x} \\in \\mathbb {R} ^ {n}: c \\| \\mathbf {x} \\| < 1, c > 0 \\right\\}, \\tag {1}", + "image_path": "4ccefb8a43b8e221cd0c5c7929267c263dc4cc1e6921b6ee5fd616cf6acc2ff8.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 175, + 479, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 175, + 479, + 201 + ], + "spans": [ + { + "bbox": [ + 131, + 175, + 479, + 201 + ], + "type": "text", + "content": "with the corresponding Riemannian metric given by " + }, + { + "bbox": [ + 131, + 175, + 479, + 201 + ], + "type": "inline_equation", + "content": "\\mathfrak{g}^{\\mathbb{B}} = (\\lambda_{\\mathbf{x}}^{c})^{2}\\mathbf{I}" + }, + { + "bbox": [ + 131, + 175, + 479, + 201 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 175, + 479, + 201 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathbf{x}}^{c} = 2(1 - c\\|\\mathbf{x}\\|^{2})^{-1}" + }, + { + "bbox": [ + 131, + 175, + 479, + 201 + ], + "type": "text", + "content": " is the conformal factor." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 202, + 479, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 202, + 479, + 236 + ], + "spans": [ + { + "bbox": [ + 131, + 202, + 479, + 236 + ], + "type": "text", + "content": "The analogy of a linear layer in HNN depends on two important operations, namely Möbius addition and multiplication. The Möbius addition " + }, + { + "bbox": [ + 131, + 202, + 479, + 236 + ], + "type": "inline_equation", + "content": "\\oplus" + }, + { + "bbox": [ + 131, + 202, + 479, + 236 + ], + "type": "text", + "content": " is defined as:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 189, + 238, + 480, + 274 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 189, + 238, + 480, + 274 + ], + "spans": [ + { + "bbox": [ + 189, + 238, + 480, + 274 + ], + "type": "interline_equation", + "content": "\\mathbf {x} \\oplus_ {c} \\mathbf {y} = \\frac {\\left(1 + 2 c \\langle \\mathbf {x} , \\mathbf {y} \\rangle + c \\| \\mathbf {y} \\| ^ {2}\\right) \\mathbf {x} + \\left(1 - c \\| \\mathbf {x} \\| ^ {2}\\right) \\mathbf {y}}{1 + 2 c \\langle \\mathbf {x} , \\mathbf {y} \\rangle + c \\| \\mathbf {x} \\| ^ {2} \\| \\mathbf {y} \\| ^ {2}}. \\tag {2}", + "image_path": "c99ed3db2c47134dda63e916fa1ac0632af9ca5ea8bd40bc1e434541c6886513.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 279, + 347, + 292 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 279, + 347, + 292 + ], + "spans": [ + { + "bbox": [ + 132, + 279, + 347, + 292 + ], + "type": "text", + "content": "The Möbius multiplication " + }, + { + "bbox": [ + 132, + 279, + 347, + 292 + ], + "type": "inline_equation", + "content": "\\mathbf{M} \\otimes_{c} \\mathbf{x}" + }, + { + "bbox": [ + 132, + 279, + 347, + 292 + ], + "type": "text", + "content": " is defined as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 190, + 302, + 480, + 329 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 190, + 302, + 480, + 329 + ], + "spans": [ + { + "bbox": [ + 190, + 302, + 480, + 329 + ], + "type": "interline_equation", + "content": "\\mathbf {M} \\otimes_ {c} \\mathbf {x} = \\frac {1}{\\sqrt {c}} \\tanh \\left(\\frac {\\| \\mathbf {M x} \\|}{\\mathbf {M x}} \\tanh ^ {- 1} (\\sqrt {c} \\| \\mathbf {x} \\|)\\right) \\frac {\\mathbf {M x}}{\\| \\mathbf {M x} \\|}. \\tag {3}", + "image_path": "8f6bb30a85369b19391af42b4c2305140685273f0c405df4bbcab85847b12ca8.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 338, + 479, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 338, + 479, + 363 + ], + "spans": [ + { + "bbox": [ + 131, + 338, + 479, + 363 + ], + "type": "text", + "content": "Finally, the geodesic distance between two points " + }, + { + "bbox": [ + 131, + 338, + 479, + 363 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 131, + 338, + 479, + 363 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 338, + 479, + 363 + ], + "type": "inline_equation", + "content": "\\mathbf{y}" + }, + { + "bbox": [ + 131, + 338, + 479, + 363 + ], + "type": "text", + "content": " in the Poincaré ball can be expressed as:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 220, + 373, + 480, + 397 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 373, + 480, + 397 + ], + "spans": [ + { + "bbox": [ + 220, + 373, + 480, + 397 + ], + "type": "interline_equation", + "content": "d _ {\\mathbb {B}} ^ {c} (\\mathbf {x}, \\mathbf {y}) = \\frac {2}{\\sqrt {c}} \\tanh ^ {- 1} \\left(\\sqrt {c} \\| - \\mathbf {x} \\oplus_ {c} \\mathbf {y} \\|\\right). \\tag {4}", + "image_path": "6c355138d77ae9b643673b9f16cbda8af1d69ab26f1bfa42a7e5c11d16d04bcf.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 407, + 443, + 419 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 443, + 419 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 443, + 419 + ], + "type": "text", + "content": "Unless otherwise specified, we follow the common choice to take " + }, + { + "bbox": [ + 132, + 407, + 443, + 419 + ], + "type": "inline_equation", + "content": "c = 1" + }, + { + "bbox": [ + 132, + 407, + 443, + 419 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "spans": [ + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "text", + "content": "Lorentz model [5,6] The Lorentz model of an " + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "text", + "content": "-dimensional hyperbolic space " + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\mathbb{L}^n" + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "text", + "content": " is a manifold embedded in a " + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "inline_equation", + "content": "(n + 1)" + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "text", + "content": "-dimensional Minkowski space. More specifically, this Minkowski space contains the same points as " + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\mathbb{R}^{n + 1}" + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "text", + "content": ", but with an inner product " + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\langle \\cdot ,\\cdot \\rangle_{\\mathbb{L}}" + }, + { + "bbox": [ + 131, + 442, + 479, + 491 + ], + "type": "text", + "content": " defined by" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 149, + 503, + 480, + 533 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 503, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 149, + 503, + 480, + 533 + ], + "type": "interline_equation", + "content": "\\langle \\mathbf {x}, \\mathbf {y} \\rangle_ {\\mathbb {L}} = - x _ {0} y _ {0} + \\sum_ {i = 1} ^ {n} x _ {i} y _ {i}, \\mathbf {x} = (x _ {0}, \\dots , x _ {n}), \\mathbf {y} = (y _ {0}, \\dots , y _ {n}) \\in \\mathbb {R} ^ {n + 1}. \\tag {5}", + "image_path": "0731bf6e3acf37feedcc19dd5977c1741df7b127abbf0e45e04eec10cf18a8f2.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "spans": [ + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "text", + "content": "The Lorentz model " + }, + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "inline_equation", + "content": "\\mathbb{L}^n" + }, + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "text", + "content": " contains points with " + }, + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "inline_equation", + "content": "\\langle \\mathbf{x},\\mathbf{x}\\rangle_{\\mathbb{L}} = -c" + }, + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "inline_equation", + "content": "-c" + }, + { + "bbox": [ + 131, + 544, + 479, + 567 + ], + "type": "text", + "content": " is the curvature. That is," + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 184, + 579, + 480, + 594 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 184, + 579, + 480, + 594 + ], + "spans": [ + { + "bbox": [ + 184, + 579, + 480, + 594 + ], + "type": "interline_equation", + "content": "\\mathbb {L} ^ {n} = \\left\\{\\mathbf {x} = \\left(x _ {0}, \\dots , x _ {n}\\right) \\in \\mathbb {R} ^ {n + 1}: \\langle \\mathbf {x}, \\mathbf {x} \\rangle_ {\\mathbb {L}} = - c, x _ {0} > 0 \\right\\}, \\tag {6}", + "image_path": "44f9fbdeb831ef2a7d20be553c91d4e34ba160cf58de87ce082ab0d01164a37a.jpg" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "spans": [ + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "text", + "content": "The geodesic distance between two points " + }, + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "inline_equation", + "content": "\\mathbf{y}" + }, + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "text", + "content": " in the Lorentz model " + }, + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "inline_equation", + "content": "\\mathbb{L}^n" + }, + { + "bbox": [ + 131, + 604, + 479, + 628 + ], + "type": "text", + "content": " is expressed as" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 232, + 630, + 480, + 654 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 232, + 630, + 480, + 654 + ], + "spans": [ + { + "bbox": [ + 232, + 630, + 480, + 654 + ], + "type": "interline_equation", + "content": "d _ {\\mathbb {L}} ^ {c} (\\mathbf {x}, \\mathbf {y}) = \\frac {1}{\\sqrt {c}} \\cosh^ {- 1} (- \\langle \\mathbf {x}, \\mathbf {y} \\rangle_ {\\mathbb {L}}). \\tag {7}", + "image_path": "f2da1c4e3984dbedca8dd6e268ae40a6e4051de7edb4a3dbd9078a617cccca49.jpg" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Hyperbolic Reps via GW Reg" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 200, + 130, + 410, + 219 + ], + "blocks": [ + { + "bbox": [ + 200, + 130, + 410, + 219 + ], + "lines": [ + { + "bbox": [ + 200, + 130, + 410, + 219 + ], + "spans": [ + { + "bbox": [ + 200, + 130, + 410, + 219 + ], + "type": "image", + "image_path": "2ae3aa16a9dabe2531f7467da1216a4bdb4f1bc78a925d0bbe82f7ecc892c89a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "lines": [ + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "spans": [ + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "text", + "content": "Fig. 2: Illustration of the transport map " + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "text", + "content": ". The feature distribution " + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "text", + "content": " defined on " + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "inline_equation", + "content": "\\mathbb{X}" + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "text", + "content": " is pushed forward to " + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "inline_equation", + "content": "\\nu = T_{\\#}\\mu" + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "text", + "content": " on " + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "inline_equation", + "content": "\\mathbb{H}" + }, + { + "bbox": [ + 131, + 249, + 482, + 273 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 293, + 258, + 304 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 258, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 258, + 304 + ], + "type": "text", + "content": "3.2 GW Regularization" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 311, + 479, + 370 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 479, + 370 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 479, + 370 + ], + "type": "text", + "content": "To effectively utilize HNNs for learning from data, extending the geometry-preserving embedding technique introduced in [16], we employ a regularized learning approach focused on preserving the intrinsic geometric structures of the input features onto hyperbolic spaces. This involves employing a cost function capable of comparing two measures across distinct geometric spaces." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "text", + "content": "To bridge this gap, we consider the Gromov-Wasserstein (GW) distance [19] as it is adept at quantifying the similarity between probability distributions defined on distinct metric spaces. For two probability distributions " + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "inline_equation", + "content": "\\nu" + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "text", + "content": " in a Euclidean feature space " + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "inline_equation", + "content": "\\mathbb{X}" + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "text", + "content": " and a hyperbolic space " + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "inline_equation", + "content": "\\mathbb{H}" + }, + { + "bbox": [ + 130, + 370, + 480, + 430 + ], + "type": "text", + "content": ", respectively, the GW distance is defined as:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 167, + 433, + 480, + 456 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 433, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 167, + 433, + 480, + 456 + ], + "type": "interline_equation", + "content": "\\operatorname {G W} (\\mu , \\nu): := \\min _ {\\pi \\in \\Pi (\\mu , \\nu)} \\mathbb {E} _ {\\left((\\mathbf {x}, \\mathbf {y}), \\left(\\mathbf {x} ^ {\\prime}, \\mathbf {y} ^ {\\prime}\\right)\\right) \\sim \\pi^ {2}} \\left[ \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) - c _ {\\mathbb {H}} \\left(\\mathbf {y}, \\mathbf {y} ^ {\\prime}\\right) \\right| ^ {2} \\right] \\tag {8}", + "image_path": "1d7d158bafbfcd962f263d4e89c9af6ffccf1d240fe74db0f254bb1044dd1796.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{X}}" + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{H}}" + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": " represent the cost functions in the two spaces, and " + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "inline_equation", + "content": "\\varPi(\\mu,\\nu)" + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": " denotes the set of transport plans between " + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "inline_equation", + "content": "\\nu" + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": ", which contains all joint distributions whose first and second marginals are given by " + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "inline_equation", + "content": "\\nu" + }, + { + "bbox": [ + 130, + 462, + 479, + 521 + ], + "type": "text", + "content": ", respectively. By comparing the pairwise distances between two probability distributions to evaluate the similarity of geometric structures across different metric spaces." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "text", + "content": "When working with HNNs, an explicit map " + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "text", + "content": " from " + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "inline_equation", + "content": "\\mathbb{X}" + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "inline_equation", + "content": "\\mathbb{H}" + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "text", + "content": " is induced by the HNN layers, as illustrated in Fig. 2. The minimization problem presented in (8) can be reformulated as a Gromov-Monge (GM) distance minimization problem concerning a map " + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 522, + 479, + 570 + ], + "type": "text", + "content": ", defined as" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 173, + 575, + 480, + 597 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 575, + 480, + 597 + ], + "spans": [ + { + "bbox": [ + 173, + 575, + 480, + 597 + ], + "type": "interline_equation", + "content": "\\operatorname {G M} (\\mu , \\nu) := \\min _ {T _ {\\#} \\mu = \\nu} \\underset {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim \\mu^ {2}} {\\mathbb {E}} \\left[ \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) - c _ {\\mathbb {H}} \\left(T (\\mathbf {x}), T \\left(\\mathbf {x} ^ {\\prime}\\right)\\right) \\right| ^ {2} \\right]. \\tag {9}", + "image_path": "0244155336c626b6c5fde091988f9793e838d1341b720ba731497484af412694.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "text", + "content": "In an HNN, when embedding the probability distribution " + }, + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "text", + "content": " from a Euclidean space to a hyperbolic space, we can consider minimizing the following cost over " + }, + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "inline_equation", + "content": "T\\in \\mathcal{H}" + }, + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "inline_equation", + "content": "\\mathcal{H}" + }, + { + "bbox": [ + 130, + 603, + 479, + 639 + ], + "type": "text", + "content": " is a hypothesis class determined by the HNN:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 186, + 644, + 480, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 186, + 644, + 480, + 667 + ], + "spans": [ + { + "bbox": [ + 186, + 644, + 480, + 667 + ], + "type": "interline_equation", + "content": "\\operatorname {G M} (T; \\mu) := \\underset {(\\mathbf {x}, \\mathbf {x} ^ {\\prime}) \\sim \\mu^ {2}} {\\mathbb {E}} \\left[ \\left| c _ {\\mathbb {X}} (\\mathbf {x}, \\mathbf {x} ^ {\\prime}) - c _ {\\mathbb {H}} (T (\\mathbf {x}), T (\\mathbf {x} ^ {\\prime})) \\right| ^ {2} \\right]. \\tag {10}", + "image_path": "1d96fac99f0f844237553f9ac971651a0dd810a5e6bd5efe57c77300d6dda138.jpg" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 175, + 125, + 452, + 216 + ], + "blocks": [ + { + "bbox": [ + 175, + 125, + 452, + 216 + ], + "lines": [ + { + "bbox": [ + 175, + 125, + 452, + 216 + ], + "spans": [ + { + "bbox": [ + 175, + 125, + 452, + 216 + ], + "type": "image", + "image_path": "d6ec6beb4b8a11c607571c42ac4bf2a3e5b98a47e5b92a66752c73fd707fe74f.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 204, + 241, + 407, + 253 + ], + "lines": [ + { + "bbox": [ + 204, + 241, + 407, + 253 + ], + "spans": [ + { + "bbox": [ + 204, + 241, + 407, + 253 + ], + "type": "text", + "content": "Fig. 3: The framework of our GW regularization." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 277, + 479, + 324 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 277, + 479, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 479, + 324 + ], + "type": "text", + "content": "Thus, we have " + }, + { + "bbox": [ + 130, + 277, + 479, + 324 + ], + "type": "inline_equation", + "content": "\\min_{T\\in \\mathcal{H}}\\mathrm{GM}(\\mu ,T_{\\#}\\mu) = \\min_{T\\in \\mathcal{H}}\\mathrm{GM}(T;\\mu)" + }, + { + "bbox": [ + 130, + 277, + 479, + 324 + ], + "type": "text", + "content": ". While the GM problem described in (9) is highly challenging due to its pushforward constraint, minimizing the cost function in (10) is comparatively easier, as it does not require the pushforward constraint." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": "In practical implementation, we can employ the simple cost function " + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{X}}(\\mathbf{x}, \\mathbf{x}^{\\prime}) = \\| \\mathbf{x} - \\mathbf{x}^{\\prime} \\|^{2}" + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": " or other cost functions such as " + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{X}}(\\mathbf{x}, \\mathbf{x}^{\\prime}) = \\log \\left(1 + \\| \\mathbf{x} - \\mathbf{x}^{\\prime} \\|^{2}\\right)" + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": ". Additionally, the explicit form of " + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{H}}" + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": " can be derived from equations (4) and (7): we can use " + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{H}} = d_{\\mathbb{H}}^{c}" + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{H}} = \\log \\left(1 + d_{\\mathbb{H}}^{c}\\right)" + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "inline_equation", + "content": "\\mathbb{H} = \\mathbb{B}" + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "inline_equation", + "content": "\\mathbb{H} = \\mathbb{L}" + }, + { + "bbox": [ + 130, + 325, + 487, + 379 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 380, + 480, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 480, + 415 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 480, + 415 + ], + "type": "text", + "content": "When we have data points " + }, + { + "bbox": [ + 130, + 380, + 480, + 415 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{x}_i\\}_{i=1}^m" + }, + { + "bbox": [ + 130, + 380, + 480, + 415 + ], + "type": "text", + "content": " sampled independently and identically distributed (i.i.d.) from " + }, + { + "bbox": [ + 130, + 380, + 480, + 415 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 380, + 480, + 415 + ], + "type": "text", + "content": ", we consider an empirical version of the GM distance, namely," + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 150, + 424, + 480, + 456 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 150, + 424, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 150, + 424, + 480, + 456 + ], + "type": "interline_equation", + "content": "\\operatorname {G M} (T; \\left\\{\\mathbf {x} _ {i} \\right\\} _ {i = 1} ^ {m}) = \\frac {1}{m (m - 1)} \\sum_ {i, j = 1} ^ {m} \\left| c _ {\\mathbb {X}} \\left(\\mathbf {x} _ {i}, \\mathbf {x} _ {j}\\right) - c _ {\\mathbb {H}} \\left(T \\left(\\mathbf {x} _ {i}\\right), T \\left(\\mathbf {x} _ {j}\\right)\\right) \\right| ^ {2}. \\tag {11}", + "image_path": "204db82e713cbfa20d9ecb57b5beab126741413123b9f042b95c60181f3f4686.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "spans": [ + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "content": "The overall framework of our GW regularization is shown in Fig. 3. Here, " + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{x}_i\\}_{i=1}^m" + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "content": " are the Euclidean features that are fed into the HNN layers denoted by " + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{z}_i\\}_{i=1}^m" + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "content": " are the hyperbolic representations so that " + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_i = T(\\mathbf{x}_i)" + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "content": " for each " + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "content": ". The GM distance, calculated according to (11), is used as a penalty term, multiplied with a hyperparameter " + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 131, + 466, + 482, + 538 + ], + "type": "text", + "content": " and then added to the loss function associated with the specific task." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 557, + 482, + 654 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 654 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 654 + ], + "type": "text", + "content": "Generalization analysis In the tasks we consider, the ability to generalize beyond the given data points is essential. Although (11) only provides a formulation based on the training data, we anticipate that it will serve as an effective approximation of (10), provided that the training set " + }, + { + "bbox": [ + 130, + 557, + 482, + 654 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{x}_i\\}_{i=1}^m" + }, + { + "bbox": [ + 130, + 557, + 482, + 654 + ], + "type": "text", + "content": " adequately captures the characteristics of the underlying distribution " + }, + { + "bbox": [ + 130, + 557, + 482, + 654 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 557, + 482, + 654 + ], + "type": "text", + "content": ". This expectation is encapsulated in the theorem we present below, which formalizes the relationship between the pointwise formulation and its distributional approximation under the condition of a representative sample." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Hyperbolic Reps via GW Reg" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": "Theorem 1. Given cost functions " + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{X}}" + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "c_{\\mathbb{H}}" + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": ", suppose that there exists a constant " + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "0 < \\alpha \\leq 1" + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": " for which " + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": " satisfies the following bi-Lipschitz condition:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 213, + 148, + 481, + 170 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 213, + 148, + 481, + 170 + ], + "spans": [ + { + "bbox": [ + 213, + 148, + 481, + 170 + ], + "type": "interline_equation", + "content": "\\alpha c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right) \\leq c _ {\\mathbb {H}} \\left(T (\\mathbf {x}), T \\left(\\mathbf {x} ^ {\\prime}\\right)\\right) \\leq \\frac {1}{\\alpha} c _ {\\mathbb {X}} \\left(\\mathbf {x}, \\mathbf {x} ^ {\\prime}\\right), \\tag {12}", + "image_path": "2449e212d44b8a911e38b3d8b8822f1ab9335f493957d92aca6cbd7a47786a55.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "spans": [ + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "text", + "content": "for any " + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "inline_equation", + "content": "\\mathbf{x},\\mathbf{x}^{\\prime}\\in \\mathbb{X}" + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "text", + "content": ". Let " + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "text", + "content": " be a distribution defined on " + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "inline_equation", + "content": "\\mathbb{X}" + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{x}_i\\}_{i = 1}^m" + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "text", + "content": " be i.i.d. sampled from " + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 130, + 176, + 479, + 201 + ], + "type": "text", + "content": ". Then," + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 207, + 208, + 481, + 232 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 207, + 208, + 481, + 232 + ], + "spans": [ + { + "bbox": [ + 207, + 208, + 481, + 232 + ], + "type": "interline_equation", + "content": "\\left| \\operatorname {G M} \\left(T; \\left\\{\\mathbf {x} _ {i} \\right\\} _ {i = 1} ^ {m}\\right) - \\operatorname {G M} (T; \\mu) \\right| \\leq C \\frac {(1 / \\alpha - 1) ^ {2}}{R ^ {2}} \\tag {13}", + "image_path": "40d9a6a2729e1dab7872aa8e6bec7bcd1cd5496c6719cfdf53e1600d1fb9f84e.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "text", + "content": "holds with probability at least " + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "inline_equation", + "content": "1 - 2\\exp \\left(-\\frac{mC}{8R^4}\\right)" + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "text", + "content": " is a constant depending on " + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "inline_equation", + "content": "\\mu" + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 239, + 481, + 278 + ], + "type": "inline_equation", + "content": "R\\coloneqq \\max_{\\mathbf{x},\\mathbf{x}^{\\prime}\\in \\mathrm{supp}(\\mu)}c_{\\mathbb{X}}(\\mathbf{x},\\mathbf{x}^{\\prime})" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 146, + 284, + 384, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 284, + 384, + 297 + ], + "spans": [ + { + "bbox": [ + 146, + 284, + 384, + 297 + ], + "type": "text", + "content": "The proof of Theorem 1 is presented in the appendix." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "spans": [ + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "text", + "content": "Complexity analysis Since the time complexity for calculating each Euclidean distance is " + }, + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "inline_equation", + "content": "O(n)" + }, + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "text", + "content": " and the time complexity for calculating each hyperbolic distance (in either the Poincaré ball model or the Lorentz model) is " + }, + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "inline_equation", + "content": "O(n)" + }, + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "text", + "content": ", the time complexity for calculating the GW regularization term is " + }, + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "inline_equation", + "content": "O(nm^2)" + }, + { + "bbox": [ + 131, + 312, + 481, + 361 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "spans": [ + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "text", + "content": "Note that, if we only consider linear layers in an " + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "inline_equation", + "content": "L" + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "text", + "content": "-layer Vanilla HNN, the time complexity is " + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "inline_equation", + "content": "O(mn^{2}L)" + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "text", + "content": ". In the few-shot learning task and the semi-supervised graph node-level tasks that we consider in this paper, the number of data points " + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "text", + "content": " is usually smaller than or comparable with " + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "text", + "content": ". Moreover, in tasks such as link prediction, one also needs to compare pairs of data points, leading to a time complexity of " + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "inline_equation", + "content": "O(mn^{2}L)" + }, + { + "bbox": [ + 130, + 361, + 482, + 445 + ], + "type": "text", + "content": " in computing the task loss. Therefore, adding the regularization term will not lead to change of the order of time complexity." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 462, + 230, + 475 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 462, + 230, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 462, + 230, + 475 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 486, + 482, + 571 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 571 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 571 + ], + "type": "text", + "content": "To validate the effectiveness of the GW regularization method, we conduct experiments on both image datasets and graph datasets. We present results on few-shot image classification in Section 4.1 and results on graph node classification and link prediction in Section 4.2. All the presented experiments are implemented on a server with RTX 4090 (24GB) GPUs, where each implementation runs on a single GPU. The implementation of our proposed methods can be accessed at https://github.com/yyf1217/GW-Regularization." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 586, + 313, + 599 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 586, + 313, + 599 + ], + "spans": [ + { + "bbox": [ + 132, + 586, + 313, + 599 + ], + "type": "text", + "content": "4.1 Few-Shot Image Classification" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "We consider the important task of few-shot image classification where the goal is to recognize new categories with very few labeled examples per class. Unlike supervised image classification, this task aims to generalize from a small number of examples, typically one to five images per class. Learning structures of images is crucial since there is very limited labeled data." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 121, + 477, + 229 + ], + "blocks": [ + { + "bbox": [ + 137, + 121, + 477, + 229 + ], + "lines": [ + { + "bbox": [ + 137, + 121, + 477, + 229 + ], + "spans": [ + { + "bbox": [ + 137, + 121, + 477, + 229 + ], + "type": "image", + "image_path": "04748d46788b31df74ddaa321fb60648eb3f263939cd8c7236853d96b91a11ba.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 153, + 241, + 457, + 252 + ], + "lines": [ + { + "bbox": [ + 153, + 241, + 457, + 252 + ], + "spans": [ + { + "bbox": [ + 153, + 241, + 457, + 252 + ], + "type": "text", + "content": "Fig. 4: The framework of the GW regularized hyperbolic ProtoNet model." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 277, + 482, + 372 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 277, + 482, + 372 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 482, + 372 + ], + "type": "text", + "content": "Datasets We consider two widely used image datasets, namely MiniImageNet [36] and Caltech-UCSD Birds-200-2011 (CUB) [37]. These datasets have been used in [14], where the hyperbolic ProtoNet model excels Euclidean baselines. The MiniImageNet dataset is a subset of the ImageNet dataset [7]. It comprises images from 100 classes, with 600 images per class. The classes have a " + }, + { + "bbox": [ + 130, + 277, + 482, + 372 + ], + "type": "inline_equation", + "content": "64/16/20" + }, + { + "bbox": [ + 130, + 277, + 482, + 372 + ], + "type": "text", + "content": " split for training/validation/test. The CUB dataset consists of 200 categories of bird images, totaling 11,788 pictures. In this dataset, the training/validation/test split is " + }, + { + "bbox": [ + 130, + 277, + 482, + 372 + ], + "type": "inline_equation", + "content": "100/50/50" + }, + { + "bbox": [ + 130, + 277, + 482, + 372 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 390, + 482, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 482, + 474 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 482, + 474 + ], + "type": "text", + "content": "Setting We apply our GW regularization on the hyperbolic ProtoNet model [14], which primarily consists of convolutional neural network (CNN) layers used for feature extraction from Euclidean image data and subsequent HNN layers for classification. In [14], the HNN layers are taken to be a simple exponential map from the Euclidean space to the Poincaré ball. In our implementation, we utilize the publicly available code for the hyperbolic ProtoNet model from https://github.com/leymir/hyperbolic-image-embeddings." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "content": "For clarity, we illustrate the framework for this task in Fig. 4, which is based on Fig. 3. We take the features " + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{x}_i\\}_{i=1}^m" + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "content": " from the output of the CNN layers, and then the HNN layers process them into " + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{z}_i\\}_{i=1}^m" + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "content": ". Following this, the hyperbolic distance between each hyperbolic embedding " + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_i" + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "content": " and the origin of the Poincaré ball is computed according to (4), which is then used to calculate the maximum class probability. Finally, the cross-entropy loss is computed using the maximum class probability and the labels. We add " + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "inline_equation", + "content": "\\beta \\mathrm{GM}(T; \\{\\mathbf{x}_i\\}_{i=1}^m)" + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "content": " to the cross-entropy loss to formulate our regularized loss function." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "We consider various CNN architectures including Conv4, ResNet10, ResNet12, and ResNet18. The HNN layers within the model incorporate linear layers from [10]. Additionally, ReLU is used as the activation function across the model. For Conv4, the embedding dimension is set to 1,600, while for ResNet10, ResNet12, and ResNet18, the embedding dimension is set to 512. The initial learning rate is 0.001. We consider both the 1-Shot 5-Way and 5-Shot 5-Way settings, which means there are five classes involved for the task and only one/five examples per class for training. In all experiments for the 1-Shot 5-Way task, a consistent" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Hyperbolic Reps via GW Reg" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 159, + 156, + 455, + 236 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 1: Hyperparameters used in few-shot image classification. \"ResNet\" abbreviated as \"Res\" due to space constraints." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 159, + 156, + 455, + 236 + ], + "lines": [ + { + "bbox": [ + 159, + 156, + 455, + 236 + ], + "spans": [ + { + "bbox": [ + 159, + 156, + 455, + 236 + ], + "type": "table", + "html": "
Initial learning rate (lr)β
Conv4Res10Res12Res18Conv4Res10Res12Res18
MiniImageNet1-Shot 5-Way0.00050.0010.0010.0010.60.50.10.7
5-Shot 5-Way0.010.0010.0010.001140.10.50.5
CUB1-Shot 5-Way0.0010.0010.0010.0010.020.0150.150.1
5-Shot 5-Way0.010.0010.0010.0010.070.010.250.1
", + "image_path": "59c199a1737b97e4afbf120c097508759d254fe3d0e18f1568beba014facdc10.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "text", + "content": "curvature parameter of " + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "inline_equation", + "content": "-0.08" + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "text", + "content": " is employed. Similarly, for the 5-Shot 5-Way task, we uniformly set the curvature to " + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "inline_equation", + "content": "-0.01" + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "text", + "content": " throughout all experiments. Both curvatures agree with the recommended settings in the original hyperbolic ProtoNet. The hyperparameter " + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "text", + "content": " is selected according to the validation set. We report the initial learning rate as well as the best " + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 268, + 480, + 327 + ], + "type": "text", + "content": " in Table 1." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 347, + 480, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 480, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 480, + 407 + ], + "type": "text", + "content": "Results We present our numerical results for both the 1-Shot 5-Way and 5-Shot 5-Way settings in Table 2. We randomly sample 10,000 data points from the test set to evaluate the performance of the model and report " + }, + { + "bbox": [ + 130, + 347, + 480, + 407 + ], + "type": "inline_equation", + "content": "95\\%" + }, + { + "bbox": [ + 130, + 347, + 480, + 407 + ], + "type": "text", + "content": " confidence intervals for all results. Each entry reports the average classification accuracy, including means and standard deviations." + } + ] + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 157, + 459, + 457, + 586 + ], + "blocks": [ + { + "bbox": [ + 175, + 429, + 436, + 440 + ], + "lines": [ + { + "bbox": [ + 175, + 429, + 436, + 440 + ], + "spans": [ + { + "bbox": [ + 175, + 429, + 436, + 440 + ], + "type": "text", + "content": "Table 2: Accuracy (%) results for few-shot image classification." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 157, + 459, + 457, + 586 + ], + "lines": [ + { + "bbox": [ + 157, + 459, + 457, + 586 + ], + "spans": [ + { + "bbox": [ + 157, + 459, + 457, + 586 + ], + "type": "table", + "html": "
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv453.77±0.2071.33±0.1664.66±0.2380.29±0.16
Conv4+GW55.57±0.2273.04±0.1668.67±0.2380.54±0.16
ResNet1056.45±0.2165.39±0.1772.01±0.2280.75±0.15
ResNet10+GW57.50±0.2267.62±0.1772.67±0.2283.73±0.14
ResNet1255.96±0.2270.32±0.1775.77±0.2282.90±0.15
ResNet12+GW56.95±0.2273.04±0.1677.24±0.2185.66±0.14
ResNet1857.04±0.2268.43±0.1671.86±0.2285.31±0.13
ResNet18+GW58.51±0.2271.64±0.1672.64±0.2285.83±0.13
", + "image_path": "60a5b879d42675a76749636b1c9b48422352223f8a4b3a5ee54e5ff85f6fb11d.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 665 + ], + "type": "text", + "content": "From the results, we observe that our GW regularization consistently boosts the accuracy of the model. This improvement is evident in both datasets and both scenarios, regardless of the underlying CNN architecture. For most CNN architectures, the improvement is more evident in the 5-Shot 5-Way scenario" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 134, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 134, + 116, + 479, + 152 + ], + "type": "text", + "content": "than in the 1-Shot 5-Way scenario. We believe that this can be attributed to the increased number of training instances available in the 5-Shot scenario, which provides a richer structure that GW regularization can leverage." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 134, + 168, + 479, + 240 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 168, + 479, + 240 + ], + "spans": [ + { + "bbox": [ + 134, + 168, + 479, + 240 + ], + "type": "text", + "content": "Runtime We report the average run time for training one epoch in Table 3. As anticipated, incorporating GW regularization results in extended epoch training times. However, the increase in runtime is not significant, aligning with the time complexity analysis in Section 3.2. This observation underscores the efficiency of our GW regularization approach, ensuring that the added computational demand does not impose a significant burden on the overall training process." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 157, + 301, + 455, + 426 + ], + "blocks": [ + { + "bbox": [ + 134, + 260, + 479, + 281 + ], + "lines": [ + { + "bbox": [ + 134, + 260, + 479, + 281 + ], + "spans": [ + { + "bbox": [ + 134, + 260, + 479, + 281 + ], + "type": "text", + "content": "Table 3: Average runtime (in seconds) for training one epoch in few-shot image classification." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 157, + 301, + 455, + 426 + ], + "lines": [ + { + "bbox": [ + 157, + 301, + 455, + 426 + ], + "spans": [ + { + "bbox": [ + 157, + 301, + 455, + 426 + ], + "type": "table", + "html": "
MiniImageNetCUB
1-Shot 5-Way5-Shot 5-Way1-Shot 5-Way5-Shot 5-Way
Conv431.225.232.432.9
Conv4+GW33.626.435.132.9
ResNet1037.228.838.434.9
ResNet10+GW40.834.843.238.4
ResNet1242.036.046.842.0
ResNet12+GW45.640.850.445.6
ResNet1855.243.260.052.8
ResNet18+GW57.649.262.457.6
", + "image_path": "418c41b695251ce8ef5e871d386ab01bfa4b3a3b3417e2f7e247ed2756a0e49c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 134, + 475, + 447, + 487 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 475, + 447, + 487 + ], + "spans": [ + { + "bbox": [ + 134, + 475, + 447, + 487 + ], + "type": "text", + "content": "4.2 Semi-Supervised Link Prediction and Node Classification" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 493, + 479, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 493, + 479, + 517 + ], + "spans": [ + { + "bbox": [ + 134, + 493, + 479, + 517 + ], + "type": "text", + "content": "We consider graph link prediction and node classification, which are widely benchmarked semi-supervised tasks in graph deep learning literature." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 134, + 533, + 479, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 533, + 479, + 593 + ], + "spans": [ + { + "bbox": [ + 134, + 533, + 479, + 593 + ], + "type": "text", + "content": "Datasets We consider nine datasets for node classification, namely Cora, Disease, Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor. For the first three datasets, namely Disease, Airport, and Cora, we also perform link prediction. We briefly introduce the datasets in the appendix and summarize the statistics of the graphs in Table 4." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "text", + "content": "In link prediction tasks, we randomly split edges into " + }, + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "85\\% / 5\\% / 10\\%" + }, + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "text", + "content": " for training, validation, and test sets. For node classification tasks, we use a " + }, + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "70\\% / 15\\% / 15\\%" + }, + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "text", + "content": " splits for Airport, Cornell, Texas, Wisconsin, Chameleon, Squirrel, and Actor, we use " + }, + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "inline_equation", + "content": "30\\% / 10\\% / 60\\%" + }, + { + "bbox": [ + 134, + 594, + 482, + 665 + ], + "type": "text", + "content": " splits for Disease, and we use standard splits with 20 train examples per class for Cora. The above split settings agree with standard settings in the baseline papers." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Hyperbolic Reps via GW Reg" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 136, + 491, + 190 + ], + "blocks": [ + { + "bbox": [ + 229, + 114, + 384, + 126 + ], + "lines": [ + { + "bbox": [ + 229, + 114, + 384, + 126 + ], + "spans": [ + { + "bbox": [ + 229, + 114, + 384, + 126 + ], + "type": "text", + "content": "Table 4: Statistics of graph datasets." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 136, + 491, + 190 + ], + "lines": [ + { + "bbox": [ + 132, + 136, + 491, + 190 + ], + "spans": [ + { + "bbox": [ + 132, + 136, + 491, + 190 + ], + "type": "table", + "html": "
Disease-LPDisease-NCAirportCoraCornellTexasWisconsinChameleonSquirrelActor
# nodes2,6651,0443,1882,7081831832512,2775,2017,600
# edges2,2652,26515,8374,48828029546631,421198,49326,752
# features111,000111,4331,7031,7031,7032,3252,089931
# classesN/A247555555
", + "image_path": "54f9b7da680aeed29959f098f6f8b93748ab0aa18eda4a9e0252cbcb009a6cd2.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 216, + 479, + 264 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 216, + 479, + 264 + ], + "spans": [ + { + "bbox": [ + 130, + 216, + 479, + 264 + ], + "type": "text", + "content": "Setting For the graph datasets, we consider the following three HNNs: the vanilla HNN [10], HGCN [5], and HyboNet [6]. We utilize the publicly available code for HNN and HGCN from https://github.com/HazyResearch/hgcn and HyboNet from https://github.com/chenweize1998/fully-hyperbolic-nn." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 266, + 480, + 302 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 266, + 480, + 302 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 480, + 302 + ], + "type": "text", + "content": "For each model, we apply GW distance to the input node features and their hyperbolic representations after applying the Euclidean-to-hyperbolic operation. The regularization framework is the same as Fig. 3." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 304, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 472 + ], + "type": "text", + "content": "In these experiments, the HNN models share a common architecture consisting of HNN layers and output layers. These models employ different HNN layers to extract features from graph data and generate hyperbolic embeddings " + }, + { + "bbox": [ + 130, + 304, + 482, + 472 + ], + "type": "inline_equation", + "content": "\\{\\mathbf{z}_i\\}_{i=1}^m" + }, + { + "bbox": [ + 130, + 304, + 482, + 472 + ], + "type": "text", + "content": ". Specifically, the Vanilla HNN and HGCN employ the Poincaré model to build linear layers and activation. HGCN also has aggregation operation, facilitating message passing. Differently, HyboNet employs the linear layers and aggregation in the Lorentz model. The output layers are used to accomplish various tasks. For node classification, the obtained hyperbolic embeddings are directly projected to the Euclidean space. A linear layer is then used to predict the class probabilities, with which the negative log-likelihood loss is computed. For link prediction, the hyperbolic distances between the hyperbolic embeddings are computed. Subsequently, the Fermi-Dirac algorithm [15] is employed to transform the hyperbolic distances into the edge probabilities. Finally, cross-entropy losses are computed using these edge probabilities and the true edge labels." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 474, + 482, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 534 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 534 + ], + "type": "text", + "content": "For simplicity, the curvature of the hyperbolic space is set as " + }, + { + "bbox": [ + 130, + 474, + 482, + 534 + ], + "type": "inline_equation", + "content": "-1" + }, + { + "bbox": [ + 130, + 474, + 482, + 534 + ], + "type": "text", + "content": " for all experiments, which is a common setting for graph datasets. Tables 5 and 6 list hyperparameters such as initial learning rate, the number of the HNN layers, weight decay, dropout, and embedding dimensions. The hyperparameter " + }, + { + "bbox": [ + 130, + 474, + 482, + 534 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 474, + 482, + 534 + ], + "type": "text", + "content": " from validation is also listed for different datasets." + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 132, + 578, + 490, + 664 + ], + "blocks": [ + { + "bbox": [ + 173, + 556, + 440, + 568 + ], + "lines": [ + { + "bbox": [ + 173, + 556, + 440, + 568 + ], + "spans": [ + { + "bbox": [ + 173, + 556, + 440, + 568 + ], + "type": "text", + "content": "Table 5: Hyperparameters used in the Vanilla HNN and HGCN." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 578, + 490, + 664 + ], + "lines": [ + { + "bbox": [ + 132, + 578, + 490, + 664 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 490, + 664 + ], + "type": "table", + "html": "
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNC
Initial lr0.010.010.010.010.010.010.010.010.010.010.010.01
# layers222222222222
Weight decay0.00.0010.00050.00.0050.0010.0010.0010.0010.0010.0010.001
Dropout0.00.10.00.00.50.50.50.50.50.50.50.5
# embeddings316161616161616161655
HNN β0.90.0821.250.50.350.250.10.150.020.0010.03
HGCN β0.30.0921.50.10.60.250.150.20.080.010.03
", + "image_path": "b77797134bd46494242b501face038d7e6bc856096342c81005e105cf5ad1696.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 135, + 491, + 214 + ], + "blocks": [ + { + "bbox": [ + 212, + 114, + 400, + 126 + ], + "lines": [ + { + "bbox": [ + 212, + 114, + 400, + 126 + ], + "spans": [ + { + "bbox": [ + 212, + 114, + 400, + 126 + ], + "type": "text", + "content": "Table 6: Hyperparameters used in HyboNet." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 135, + 491, + 214 + ], + "lines": [ + { + "bbox": [ + 132, + 135, + 491, + 214 + ], + "spans": [ + { + "bbox": [ + 132, + 135, + 491, + 214 + ], + "type": "table", + "html": "
DiseaseAirportCoraCornellTexasWisconsinChameleonSquirrelActor
LPNCLPNCLPNCNCNCNCNCNCNCNCNCNCNCNC
Initial lr0.0050.0050.010.020.020.020.0050.0050.0050.0050.0050.0050.0050.010.010.01
# layers2426232222222222
Weight decay0.00.00.00.00010.0010.010.00.00.00.00.00.00.00.0010.0010.001
Dropout0.00.10.00.00.70.90.20.20.20.20.20.20.20.20.20.2
# embeddings16161616161616161616161616161616
β0.30.071.51.10.250.250.130.10.10.11.31.32.50.010.010.01
", + "image_path": "54216acaf5beb479e989d522d03211ad30a26a9c3e4d409c4c2016e6a9724a30.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 252, + 482, + 301 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 252, + 482, + 301 + ], + "spans": [ + { + "bbox": [ + 130, + 252, + 482, + 301 + ], + "type": "text", + "content": "Results For the link prediction task, we report the AUC scores in Table 7. For the node classification task, we report the F1 scores, in Table 8. Each score reports the average from three random runs as well as the standard deviation. For clarity, we just use \"HNN\" in place of the Vanilla HNN in the tables." + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 198, + 341, + 416, + 434 + ], + "blocks": [ + { + "bbox": [ + 195, + 320, + 416, + 332 + ], + "lines": [ + { + "bbox": [ + 195, + 320, + 416, + 332 + ], + "spans": [ + { + "bbox": [ + 195, + 320, + 416, + 332 + ], + "type": "text", + "content": "Table 7: AUC (%) results of the link prediction task." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 198, + 341, + 416, + 434 + ], + "lines": [ + { + "bbox": [ + 198, + 341, + 416, + 434 + ], + "spans": [ + { + "bbox": [ + 198, + 341, + 416, + 434 + ], + "type": "table", + "html": "
DiseaseAirportCora
HNN92.83±1.8393.56±0.3088.80±1.29
HNN+GW94.45±0.5894.23±0.3389.76±2.07
HGCN92.41±1.7893.42±0.1593.37±0.15
HGCN+GW93.79±1.1595.81±0.0293.48±0.22
HYBONET95.65±0.5796.18±0.0592.04±0.37
HYBONET+GW96.58±0.5796.44±0.0293.33±0.22
", + "image_path": "48081118b23b1d88cf1f874634aeb522669b4581224f2f375d1c5927dbb8e6f5.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 454, + 482, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 454, + 482, + 538 + ], + "spans": [ + { + "bbox": [ + 130, + 454, + 482, + 538 + ], + "type": "text", + "content": "From Table 7, it is evident that our GW regularization consistently enhances the AUC scores across different network architectures and across all datasets. Similarly, Table 8 showcases that GW regularization again demonstrates a positive impact on model performance across various datasets and architectures. In many scenarios of node classification, GW regularization actually achieves substantial improvement, such as HNN+GW for Disease, HGCN+GW for Cornell and HyboNet+GW for Wisconsin." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 554, + 482, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 554, + 482, + 603 + ], + "spans": [ + { + "bbox": [ + 130, + 554, + 482, + 603 + ], + "type": "text", + "content": "Runtime We report the average run time for training one epoch for link prediction in Table 9. Similarly to the previous experiment, the runtime for GW regularized training is longer, but not significantly. This again aligns with the complexity analysis in Section 3.2." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 618, + 220, + 631 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 618, + 220, + 631 + ], + "spans": [ + { + "bbox": [ + 131, + 618, + 220, + 631 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "In this paper, we have delved into the integration of the GW distance as a novel regularization term within the realms of hyperbolic neural networks, with a par-" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 281, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Hyperbolic Reps via GW Reg" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 151, + 136, + 463, + 317 + ], + "blocks": [ + { + "bbox": [ + 195, + 114, + 416, + 125 + ], + "lines": [ + { + "bbox": [ + 195, + 114, + 416, + 125 + ], + "spans": [ + { + "bbox": [ + 195, + 114, + 416, + 125 + ], + "type": "text", + "content": "Table 8: F1 (%) result of the node classification task." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 151, + 136, + 463, + 317 + ], + "lines": [ + { + "bbox": [ + 151, + 136, + 463, + 317 + ], + "spans": [ + { + "bbox": [ + 151, + 136, + 463, + 317 + ], + "type": "table", + "html": "
DiseaseAirportCoraChameleonSquirrel
HNN58.40±2.5387.40±1.3453.73±0.9171.43±1.6347.89±2.21
HNN+GW65.62±1.9889.38±0.6755.33±0.3572.53±0.1949.44±1.05
HGCN93.04±1.6486.96±0.2279.47±1.0177.72±0.9051.79±0.58
HGCN+GW95.28±0.4087.91±0.7280.00±0.6279.18±1.6452.70±1.24
HYBONET85.70±0.6093.13±0.1973.53±0.7582.05±0.5574.04±2.42
HYBONET+GW87.66±1.2194.46±0.2079.40±0.9583.58±0.2877.27±0.78
CornellTexasWisconsinActor
HNN93.94±1.3194.69±1.3193.21±3.8642.63±1.73
HNN+GW95.45±2.2896.97±1.3298.15±1.8545.03±1.73
HGCN83.33±3.4778.79±4.7375.31±2.8336.39±1.00
HGCN+GW88.64±2.2881.82±3.9483.33±1.8639.19±0.67
HYBONET78.79±4.7367.42±3.4774.07±1.8645.74±2.13
HYBONET+GW81.82±3.9374.24±1.3180.87±3.8649.64±0.38
", + "image_path": "bc8a3c2e7b34257bed1109afa7800ac7f0be1883abeebcc5507bbdd76f995f52.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 222, + 355, + 391, + 447 + ], + "blocks": [ + { + "bbox": [ + 143, + 335, + 470, + 346 + ], + "lines": [ + { + "bbox": [ + 143, + 335, + 470, + 346 + ], + "spans": [ + { + "bbox": [ + 143, + 335, + 470, + 346 + ], + "type": "text", + "content": "Table 9: Average runtime (in seconds) for training one epoch in link prediction." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 222, + 355, + 391, + 447 + ], + "lines": [ + { + "bbox": [ + 222, + 355, + 391, + 447 + ], + "spans": [ + { + "bbox": [ + 222, + 355, + 391, + 447 + ], + "type": "table", + "html": "
DiseaseAirportCora
HNN0.03010.08810.0549
HNN+GW0.03130.08840.0563
HGCN0.04890.10750.0743
HGCN+GW0.05050.10780.0747
HYBONET0.03010.06310.0374
HYBONET+GW0.03230.06390.0379
", + "image_path": "8d0c9f40d3b1c1e4f9063dc88db49257cdea806af39134435c460d0e479fca4b.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 477, + 480, + 550 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 477, + 480, + 550 + ], + "spans": [ + { + "bbox": [ + 130, + 477, + 480, + 550 + ], + "type": "text", + "content": "ticular emphasis on leveraging the GM formulation. This approach has allowed for a sophisticated comparison of distributions across the Euclidean space and the hyperbolic space, capturing the essence of the underlying structures while not increasing the order of the time complexity. We have demonstrated that the hyperbolic embeddings of the data points resonate closely with distributions where they are sampled from." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 553, + 480, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 553, + 480, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 553, + 480, + 601 + ], + "type": "text", + "content": "Our regularization method has been rigorously tested and validated across diverse datasets including image data for the few-shot classification task and graph data for the semi-supervised link prediction and node classification tasks, showcasing a uniform elevation in performance metrics." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 605, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 481, + 665 + ], + "type": "text", + "content": "Our future work involves more efficient methods in large scale settings, where the number of instances is much larger than feature dimensions. Additionally, we are intrigued by the potential of integrating our GW regularization framework with emerging geometric deep learning architectures for complex data structures, where the flexibility with the choice of underlying spaces is crucial." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 240, + 129 + ], + "type": "text", + "content": "Acknowledgement" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 137, + 481, + 185 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 137, + 481, + 185 + ], + "spans": [ + { + "bbox": [ + 132, + 137, + 481, + 185 + ], + "type": "text", + "content": "YY and DZ acknowledge funding from National Natural Science Foundation of China (NSFC) under award number 12301117, WL acknowledges funding from the National Institute of Standards and Technology (NIST) under award number 70NANB22H021, and GL acknowledges funding from NSF award DMS 2124913." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 201, + 197, + 214 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 201, + 197, + 214 + ], + "spans": [ + { + "bbox": [ + 133, + 201, + 197, + 214 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 224, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 138, + 224, + 480, + 245 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 224, + 480, + 245 + ], + "spans": [ + { + "bbox": [ + 138, + 224, + 480, + 245 + ], + "type": "text", + "content": "1. Alvarez-Melis, D., Jaakkola, T.S.: Gromov-Wasserstein alignment of word embedding spaces. arXiv preprint arXiv:1809.00013 (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 246, + 480, + 267 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 246, + 480, + 267 + ], + "spans": [ + { + "bbox": [ + 138, + 246, + 480, + 267 + ], + "type": "text", + "content": "2. Atigh, M.G., Schoep, J., Acar, E., van Noord, N., Mettes, P.: Hyperbolic image segmentation. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 268, + 480, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 268, + 480, + 289 + ], + "spans": [ + { + "bbox": [ + 138, + 268, + 480, + 289 + ], + "type": "text", + "content": "3. Bachmann, G., Bécigneul, G., Ganea, O.: Constant curvature graph convolutional networks. In: Int. Conf. Mach. Learn. pp. 486-496. PMLR (2020)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 289, + 480, + 310 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 289, + 480, + 310 + ], + "spans": [ + { + "bbox": [ + 138, + 289, + 480, + 310 + ], + "type": "text", + "content": "4. Bunne, C., Alvarez-Melis, D., Krause, A., Jegelka, S.: Learning generative models across incomparable spaces. In: Int. Conf. Mach. Learn. pp. 851-861. PMLR (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 311, + 480, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 311, + 480, + 331 + ], + "spans": [ + { + "bbox": [ + 138, + 311, + 480, + 331 + ], + "type": "text", + "content": "5. Chami, I., Ying, Z., Ré, C., Leskovec, J.: Hyperbolic graph convolutional neural networks. Adv. Neural Inform. Process. Syst. 32, 4868-4879 (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 332, + 480, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 332, + 480, + 363 + ], + "spans": [ + { + "bbox": [ + 138, + 332, + 480, + 363 + ], + "type": "text", + "content": "6. Chen, W., Han, X., Lin, Y., Zhao, H., Liu, Z., Li, P., Sun, M., Zhou, J.: Fully hyperbolic neural networks. In: Annu. Meeting Assoc. Comput. Linguistics. pp. 5672-5686 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 364, + 480, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 364, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 138, + 364, + 480, + 396 + ], + "type": "text", + "content": "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: IEEE Conf. Comput. Vis. Pattern Recog. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 396, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 396, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 396, + 480, + 418 + ], + "type": "text", + "content": "8. Dumont, T., Lacombe, T., Vialard, F.X.: On the existence of Monge maps for the Gromov-Wasserstein problem (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 418, + 480, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 418, + 480, + 449 + ], + "spans": [ + { + "bbox": [ + 138, + 418, + 480, + 449 + ], + "type": "text", + "content": "9. Fan, X., Yang, C.H., Vemuri, B.C.: Nested hyperbolic spaces for dimensionality reduction and hyperbolic NN design. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 450, + 480, + 471 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 450, + 480, + 471 + ], + "spans": [ + { + "bbox": [ + 138, + 450, + 480, + 471 + ], + "type": "text", + "content": "10. Ganea, O., Bécigneul, G., Hofmann, T.: Hyperbolic neural networks. Adv. Neural Inform. Process. Syst. 31, 5345-5355 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 472, + 480, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 472, + 480, + 514 + ], + "spans": [ + { + "bbox": [ + 134, + 472, + 480, + 514 + ], + "type": "text", + "content": "11. Gulcehre, C., Denil, M., Malinowski, M., Razavi, A., Pascanu, R., Hermann, K.M., Battaglia, P., Bapst, V., Raposo, D., Santoro, A., de Freitas, N.: Hyperbolic attention networks. In: Int. Conf. Learn. Represent. (2019), https://openreview.net/forum?id=rJxHsjRqFQ" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 515, + 480, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 515, + 480, + 536 + ], + "spans": [ + { + "bbox": [ + 134, + 515, + 480, + 536 + ], + "type": "text", + "content": "12. Guo, Y., Guo, H., Yu, S.X.: Co-SNE: Dimensionality reduction and visualization for hyperbolic data. In: IEEE Conf. Comput. Vis. Pattern Recog. (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 536, + 480, + 568 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 536, + 480, + 568 + ], + "spans": [ + { + "bbox": [ + 134, + 536, + 480, + 568 + ], + "type": "text", + "content": "13. Huang, Y., Zhang, T., Zhu, H.: Improving word alignment by adding Gromov-Wasserstein into attention neural network. In: J. Phys. Conf. Ser. vol. 2171, p. 012043. IOP Publishing (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 569, + 480, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 569, + 480, + 590 + ], + "spans": [ + { + "bbox": [ + 134, + 569, + 480, + 590 + ], + "type": "text", + "content": "14. Khrulkov, V., Mirvakhabova, L., Ustinova, E., Oseledets, I., Lempitsky, V.: Hyperbolic image embeddings. In: IEEE Conf. Comput. Vis. Pattern Recog. (2020)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 134, + 590, + 480, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 590, + 480, + 611 + ], + "spans": [ + { + "bbox": [ + 134, + 590, + 480, + 611 + ], + "type": "text", + "content": "15. Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguná, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 134, + 612, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 612, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 612, + 480, + 632 + ], + "type": "text", + "content": "16. Lee, W., Yang, Y., Zou, D., Lerman, G.: Monotone generative modeling via a gromov-monge embedding. arXiv e-prints (2023)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "type": "text", + "content": "17. Li, X., Qiu, Z., Zhao, X., Wang, Z., Zhang, Y., Xing, C., Wu, X.: Gromov-Wasserstein guided representation learning for cross-domain recommendation. In: ACM Int. Conf. Inf. Knowl. Manage. pp. 1199-1208 (2022)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 280, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Hyperbolic Reps via GW Reg" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 657 + ], + "type": "list", + "angle": 0, + "index": 26, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "text", + "content": "18. Liu, Q., Nickel, M., Kiela, D.: Hyperbolic graph neural networks. Adv. Neural Inform. Process. Syst. 32, 8230-8241 (2019)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 138, + 480, + 159 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 138, + 480, + 159 + ], + "spans": [ + { + "bbox": [ + 133, + 138, + 480, + 159 + ], + "type": "text", + "content": "19. Mémoli, F.: On the use of Gromov-Hausdorff distances for shape comparison. In: PBG@Eurographics (2007)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 160, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 160, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 132, + 160, + 480, + 182 + ], + "type": "text", + "content": "20. Mémoli, F.: Gromov-Wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11, 417-487 (2011)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 182, + 480, + 203 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 480, + 203 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 480, + 203 + ], + "type": "text", + "content": "21. Mémoli, F., Needham, T.: Distance distributions and inverse problems for metric measure spaces. Stud. Appl. Math. 149(4), 943-1001 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 203, + 480, + 235 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 203, + 480, + 235 + ], + "spans": [ + { + "bbox": [ + 132, + 203, + 480, + 235 + ], + "type": "text", + "content": "22. Nakagawa, N., Togo, R., Ogawa, T., Haseyama, M.: Gromov-Wasserstein autoencoders. In: Int. Conf. Learn. Represent. (2023), https://openreview.net/forum?id=sbS10BCtC7" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 236, + 480, + 257 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 480, + 257 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 480, + 257 + ], + "type": "text", + "content": "23. Nickel, M., Kiela, D.: Poincaré embeddings for learning hierarchical representations. Adv. Neural Inform. Process. Syst. 30 (2017)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 258, + 480, + 279 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 258, + 480, + 279 + ], + "spans": [ + { + "bbox": [ + 132, + 258, + 480, + 279 + ], + "type": "text", + "content": "24. Nickel, M., Kiela, D.: Learning continuous hierarchies in the lorentz model of hyperbolic geometry. In: Int. Conf. Mach. Learn. (2018)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 279, + 480, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 279, + 480, + 311 + ], + "spans": [ + { + "bbox": [ + 132, + 279, + 480, + 311 + ], + "type": "text", + "content": "25. Nikolentzos, G., Chatzianastasis, M., Vazirgiannis, M.: Weisfeiler and Leman go hyperbolic: Learning distance preserving node representations. In: Int. Conf. Artif. Intell. Statist. pp. 1037-1054 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 312, + 480, + 333 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 312, + 480, + 333 + ], + "spans": [ + { + "bbox": [ + 132, + 312, + 480, + 333 + ], + "type": "text", + "content": "26. Peng, W., Varanka, T., Mostafa, A., Shi, H., Zhao, G.: Hyperbolic deep neural networks: A survey. IEEE Trans. Pattern Anal. Mach. Intell. (December 2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 333, + 480, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 333, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 132, + 333, + 480, + 354 + ], + "type": "text", + "content": "27. Peyre, G., Cuturi, M., Solomon, J.: Gromov-Wasserstein averaging of kernel and distance matrices. In: Int. Conf. Mach. Learn. pp. 2664-2672. PMLR (2016)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 355, + 480, + 376 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 355, + 480, + 376 + ], + "spans": [ + { + "bbox": [ + 132, + 355, + 480, + 376 + ], + "type": "text", + "content": "28. Sala, F., De Sa, C., Gu, A., Ré, C.: Representation tradeoffs for hyperbolic embeddings. In: Int. Conf. Mach. Learn. (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 376, + 480, + 398 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 376, + 480, + 398 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 480, + 398 + ], + "type": "text", + "content": "29. Sarkar, R.: Low distortion delaunay embedding of trees in hyperbolic plane. In: Int. Symp. Graph Drawing. pp. 355-366. Springer (2011)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 398, + 480, + 419 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 398, + 480, + 419 + ], + "spans": [ + { + "bbox": [ + 132, + 398, + 480, + 419 + ], + "type": "text", + "content": "30. Schmitzer, B., Schnörr, C.: Modelling convex shape priors and matching based on the Gromov-Wasserstein distance. J. Math. Imaging Vision 46, 143-159 (2013)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 419, + 480, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 419, + 480, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 419, + 480, + 441 + ], + "type": "text", + "content": "31. Shimizu, R., Mukuta, Y., Harada, T.: Hyperbolic neural networks++. In: Int. Conf. Learn. Represent. (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 441, + 480, + 462 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 441, + 480, + 462 + ], + "spans": [ + { + "bbox": [ + 132, + 441, + 480, + 462 + ], + "type": "text", + "content": "32. Sonthalia, R., Gilbert, A.: Tree! I am no tree! I am a low dimensional hyperbolic embedding. Adv. Neural Inform. Process. Syst. 33, 845-856 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 463, + 480, + 483 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 463, + 480, + 483 + ], + "spans": [ + { + "bbox": [ + 132, + 463, + 480, + 483 + ], + "type": "text", + "content": "33. Sturm, K.T.: The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces, vol. 290. American Mathematical Society (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 484, + 480, + 506 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 484, + 480, + 506 + ], + "spans": [ + { + "bbox": [ + 132, + 484, + 480, + 506 + ], + "type": "text", + "content": "34. Tifrea, A., Bécigneul, G., Ganea, O.E.: Poincaré glove: Hyperbolic word embeddings. In: Int. Conf. Learn. Represent. (2018)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 506, + 480, + 527 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 506, + 480, + 527 + ], + "spans": [ + { + "bbox": [ + 132, + 506, + 480, + 527 + ], + "type": "text", + "content": "35. Titouan, V., Flamary, R., Courty, N., Tavenard, R., Chapel, L.: Sliced Gromov-Wasserstein. Adv. Neural Inform. Process. Syst. 32 (2019)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 527, + 480, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 527, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 132, + 527, + 480, + 548 + ], + "type": "text", + "content": "36. Vinyals, O., Blundell, C., Lillicrap, T., Wierstra, D., et al.: Matching networks for one shot learning. Adv. Neural Inform. Process. Syst. 29 (2016)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 548, + 480, + 570 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 480, + 570 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 480, + 570 + ], + "type": "text", + "content": "37. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The Caltech-UCSD birds-200-2011 dataset (2011)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 132, + 571, + 480, + 592 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 571, + 480, + 592 + ], + "spans": [ + { + "bbox": [ + 132, + 571, + 480, + 592 + ], + "type": "text", + "content": "38. Xu, H., Luo, D., Carin, L.: Scalable Gromov-Wasserstein learning for graph partitioning and matching. Adv. Neural Inform. Process. Syst. 32 (2019)" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 132, + 592, + 480, + 613 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 592, + 480, + 613 + ], + "spans": [ + { + "bbox": [ + 132, + 592, + 480, + 613 + ], + "type": "text", + "content": "39. Xu, H., Luo, D., Zha, H., Carin, L.: Gromov-Wasserstein learning for graph matching and node embedding. In: Int. Conf. Mach. Learn. pp. 6932-6941. PMLR (2019)" + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 132, + 614, + 480, + 635 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 614, + 480, + 635 + ], + "spans": [ + { + "bbox": [ + 132, + 614, + 480, + 635 + ], + "type": "text", + "content": "40. Yang, M., Zhou, M., Li, Z., Liu, J., Pan, L., Xiong, H., King, I.: Hyperbolic graph neural networks: A review of methods and applications (2022)" + } + ] + } + ], + "index": 24 + }, + { + "bbox": [ + 132, + 635, + 480, + 657 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 635, + 480, + 657 + ], + "spans": [ + { + "bbox": [ + 132, + 635, + 480, + 657 + ], + "type": "text", + "content": "41. Zhou, Y., Sharpee, T.O.: Hyperbolic geometry of gene expression. Iscience 24(3) (2021)" + } + ] + } + ], + "index": 25 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 225, + 102 + ], + "type": "text", + "content": "Y. Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_content_list.json b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..21c6f7ae9d927ee29629965d8bd4f2d29165c64c --- /dev/null +++ b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_content_list.json @@ -0,0 +1,1392 @@ +[ + { + "type": "text", + "text": "Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models", + "text_level": 1, + "bbox": [ + 248, + 140, + 754, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Nishad Singhi1 Jae Myung Kim1 Karsten Roth1 Zeynep Akata2", + "bbox": [ + 251, + 210, + 750, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Primary contact: nishadsinghi@gmail.com", + "bbox": [ + 357, + 229, + 645, + 242 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Tübingen AI Center, University of Tübingen $^{2}$ Helmholtz München, TU München", + "bbox": [ + 218, + 253, + 781, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Concept Bottleneck Models (CBMs) ground image classification on human-understandable concepts to allow for interpretable model decisions as well as human interventions, in which expert users can modify misaligned concept choices to interpretably influence the decision of the model. However, existing approaches often require numerous human interventions per image to achieve strong performances, posing practical challenges in scenarios where obtaining human feedback is expensive. In this paper, we find that this is driven by an independent treatment of concepts during intervention, wherein a change of one concept does not influence the use of other ones. To address this issue, we introduce a trainable concept intervention realignment module, which leverages concept relations to realign concept assignments post-intervention. Across standard benchmarks, we find that concept realignment significantly improves intervention efficacy and reduces the number of interventions needed to reach a target classification performance or concept prediction accuracy. Moreover, it easily integrates into existing concept-based architectures without requiring changes to the models themselves. This reduced cost of human-model collaboration is crucial to enhance the feasibility of CBMs in resource-constrained environments. Our code is available at https://github.com/ExplainableML/concept_realignment.", + "bbox": [ + 261, + 300, + 743, + 579 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Concept Bottlenecks $\\cdot$ Trustworthiness $\\cdot$ Interventions", + "bbox": [ + 261, + 590, + 710, + 604 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 628, + 375, + 643 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Despite tremendous progress of Deep Learning (DL) techniques in research and applications, their adoption to high-stakes scenarios has been limited [9, 27, 29]. This is in large part due to unpredictable failure cases of deep models when transferring to unseen data or complex & ambiguous cases. The black-box nature of typical DL models further exacerbates this problem, as it makes understanding and debugging the decision-making process of these models difficult. Consequently, it becomes hard for human practitioners to trustworthily operate these models in scenarios with significant legal [5, 21] or ethical [4, 17] constraints. To foster trust, transparency in the decision-making process, and the ability to operate alongside expert feedback are required. In order to incorporate these desiderata into the design space of deep models, Koh et al. [9] introduced Concept Bottleneck Models (CBMs). These models break the decision process into", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/d206da68c11f2103f21a215344c770850d762dd2727cb855dbbe970a6cc41e27.jpg", + "image_caption": [ + "Fig. 1: Concept-based classification models allow for human intervention, where a human expert can correct specifically assigned concepts. However, to achieve satisfactory performance, concept-based classification models often require a large number of interventions, where each additional intervention requires costly human interaction." + ], + "image_footnote": [], + "bbox": [ + 243, + 143, + 759, + 292 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "the extraction of human-interpretable concepts (such as \"white wings\" and \"orange beak\" when classifying a seagull) from a given input, and a subsequent concept-grounded classifier operating on top of these concept predictions. While this allows users to peek into the model decision process - maybe even more importantly, it also uniquely allows for human-guided intervention and feedback integration at test time. This is done through concept interventions, wherein an expert user analyses predicted concepts and optionally replaces those they deem incorrect with ground-truth information (Fig. 1). Such interventions can significantly raise the performance and reliability of these models [9,20,27,29], while offering a natural interface for human-AI collaboration. However, human annotation is expensive, especially when resources and access to expert knowledge are limited. Ideally, such concept models should operate well with minimal human input. This becomes particularly prevalent as CBMs (as well as follow-up extensions such as Concept Embedding Models (CEMs, [27])) often require numerous interventions in order to significantly boost model performance [9,27,29], as the set of concepts these models operate on can often be rather extensive. For example, on the widely used CUB benchmark (bird classification, [22]), it takes 13 interventions per image on average to raise the accuracy of a baseline CBM model from around $68\\%$ to $90\\%$ (Fig. 4). In this work, we posit that a large part of this limited intervention efficacy can be traced back to the independent nature of how concept interventions are treated. This means that correcting for one concept (or a set of concepts) does not affect which other concepts are predicted for the same image. However, the occurrence of concepts in real life is often correlated, and informing the model about one concept should consequently influence the use of related ones. Not doing so means that we do not leverage human feedback to its full extent - intervening on one specific concept naturally gives additional context about the potential occurrence of other concepts, which should be taken into account in the final classification process. In particular, we study the extent of this crucial aspect when operating with concept-based models. Our study highlights how the use of a simple concept intervention realignment module, which learns from statistical concept relations, can effec", + "bbox": [ + 212, + 369, + 787, + 843 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 393, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "tively and automatically realign concept values after an intervention (or multiple) have been performed. Our experiments reveal how our concept realignment seamlessly integrates into and improves existing CBM approaches (e.g. default CBMs [9], CEMs [27] or intervention-aware CEMs [29]), and can be deployed both jointly during the initial training of the concept model, and as a post-hoc trained realignment mechanism. Across three standard, real-world benchmarks (CUB [22], CelebA [11] and AwA2 [23]), we showcase consistent, in parts very significant improvements in intervention efficacy. Across concept prediction and overall classification accuracy, performance increases more rapidly with interventions as compared to baselines without realignment (reducing the number of interventions needed to reach a target performance by over $70\\%$ ). Combined with its versatile usage and minimal additional resource requirements, we believe our insights into concept intervention realignment to be of high practical relevance, helping to drive down the cost of human-model collaboration and facilitate the corresponding practical deployment of concept-based models.", + "bbox": [ + 212, + 146, + 787, + 375 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Works", + "text_level": 1, + "bbox": [ + 215, + 393, + 395, + 409 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Concept Bottleneck Models (CBMs) have been extensively studied since their introduction by [9]. [27] proposed Concept Embedding Models as a generalization, utilizing embedding vectors for concepts rather than scalar probabilities, thus enhancing task performance while maintaining interpretability. Recent efforts have explored methods to enhance CBMs without requiring explicit concept supervision during training, leveraging pre-trained vision backbones and language guidance [15, 25, 26]. [2] introduced Self-explaining Neural Networks (SENNs) for unsupervised concept learning, while [18] proposed CBMAUC combining SENNs with CBMs. Probabilistic CBMs [8] were proposed to model uncertainty in concepts and final predictions. [12, 14] addressed concept leakage, while [6, 13] aimed to alleviate it. Our work complements these efforts by enabling CBMs to update predictions of all concepts after human intervention.", + "bbox": [ + 212, + 421, + 787, + 602 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Interventions on CBMs. [9] showed that intervening on random concepts enhances classification in CBMs. [3] and [19] proposed uncertainty-based strategies for interventions. [20] extensively studied concept selection strategies, focusing on task performance and execution cost. [29] introduced interventions during training to enhance model receptiveness to test-time interventions. We complement existing methods by updating predictions of all concepts following expert interventions. Concurrently, [24] proposed Energy-based CBMs to automate concept prediction updates. In comparison, our method benefits from higher simplicity, improved performance, and seamless integration with existing CBMs.", + "bbox": [ + 212, + 603, + 787, + 739 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 Methods", + "text_level": 1, + "bbox": [ + 215, + 758, + 336, + 773 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 Background and Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 787, + 511, + 801 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Concept Bottleneck Models. A Concept-Bottleneck Model (CBM) can be viewed as a composition of two models, $h = f(g(x)): \\mathcal{X} \\to \\mathcal{Y}$ , with concept en-", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Concept Realignment in CBMs", + "bbox": [ + 521, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "coder $g: \\mathcal{X} \\to \\mathcal{C}$ , and concept-based classification head $f: \\mathcal{C} \\to \\mathcal{Y}$ . $\\mathcal{X}, \\mathcal{Y}$ , where $\\mathcal{C}$ denote input, class label, and concept sets, respectively. CBMs get their name from an inherently bifurcated optimization process: While the concept encoder $g(x)$ is trained to predict concepts $\\hat{c} \\in \\mathbb{R}^k$ from the concept set with $\\| \\mathcal{C} \\| = k$ concepts given an image $x \\in \\mathbb{R}^d$ , the classification head $f(\\cdot)$ is optimized to predict final target labels $y \\in \\mathcal{Y} \\in \\mathbb{R}^M$ solely based on concept assignments produces by $g$ . CBM training data is thus given as $\\mathcal{D} := \\{x^{(i)}, c^{(i)}, y^{(i)}\\}_{i=1}^N$ , where $x^{(i)}, c^{(i)}, y^{(i)}$ are the inputs, ground-truth concepts, and ground-truth labels, respectively. Following existing works [9, 27-29], the concept encoder $g$ is trained using a (weighted) binary cross-entropy loss $(\\mathcal{L}_{\\mathrm{concept}}(\\hat{c}, c))$ , while the classification head $f$ utilizes a cross-entropy classification objective $(\\mathcal{L}_{\\mathrm{task}}(\\hat{y}, y) = \\mathcal{L}_{\\mathrm{CE}}(\\hat{y}, y))$ . Overall, there are three established schemes [9] for training CBMs: (1) Independent training: the concept encoder and classification head are trained entirely independently, with ground-truth concepts $c$ provided as inputs to the classification head during training. (2) Sequential training: the concept encoder $g$ is trained first, followed by the classification head $f$ trained using the concepts predicted by $g$ . (3) Joint training: both the concept encoder $g$ and the classification head $f$ are trained together using a combination of $\\mathcal{L}_{\\mathrm{concept}}$ and $\\mathcal{L}_{\\mathrm{task}}$ , respectively. In all cases, this means that the classification head leverages only information on concept (co-)occurrences to predict final class labels, making it easy to ground the final classification decision on interpretable concept assignments.", + "bbox": [ + 212, + 145, + 787, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Concept Embedding Models. The flow of information in a CBM is bottlenecked by the set of user-defined concepts. This can potentially limit the processing capacity of the model, especially when the concepts do not contain all the information that is needed to perform the downstream task. To overcome this issue, [27] proposed Concept Embedding Models (CEMs) as a generalization of CBMs wherein every concept $i$ is represented by a pair of high-dimensional vectors, $\\hat{\\mathbf{c}}_i^+$ and $\\hat{\\mathbf{c}}_i^-$ (as opposed to scalar concepts in CBMs). These embeddings are generated by passing $x$ through concept-specific networks $\\phi_i^+$ and $\\phi_i^-$ , and represent the concept being present and absent, respectively. The probability $\\hat{p}_i$ of the concept $i$ being in $x$ is then simply computed by passing $\\hat{\\mathbf{c}}_i^+$ and $\\hat{\\mathbf{c}}_i^-$ to a scoring function $s$ as $\\hat{p}_i = s([\\hat{\\mathbf{c}}_i^+, \\hat{\\mathbf{c}}_i^-])$ . Similarly, both embeddings can also be combined as $\\hat{\\mathbf{c}}_i = \\hat{p}_i \\hat{\\mathbf{c}}_i^+ + (1 - \\hat{p}_i) \\hat{\\mathbf{c}}_i^-$ to parameterize a joint embedding for concept $i$ . The final concept embedding which represents the full image $x$ and is passed to the classification head is then given as $\\hat{\\mathbf{c}} := [\\hat{\\mathbf{c}}_1, \\hat{\\mathbf{c}}_2, ..., \\hat{\\mathbf{c}}_k]$ . Notice the higher dimensionality, as we concatenate $k$ concept-specific embeddings.", + "bbox": [ + 212, + 470, + 787, + 698 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Concept Interventions. Both CBMs and CEMs allow users to intervene on concepts at test time. Concretely, starting from the concept predictions of the model, $\\hat{c}$ , the user sequentially intervenes on $T \\leq k$ concepts. As a human expert has to both investigate concept predictions and compare against input data, interventions are difficult to parallelize, effectively equating concept intervention into a trajectory of $T$ concept intervention steps [20] (see also Fig. 1 for intuition). Let $\\mathcal{S}_t$ represent the set of concepts that have been intervened on up to time $t \\leq T$ . The corresponding concept embedding at time $t$ is then given as $\\tilde{c}_t = \\{c_{\\mathcal{S}_t}, \\hat{c}_{\\backslash \\mathcal{S}_t}\\}$ , where $c_{\\mathcal{S}_t}$ denotes the ground truth values of the intervened concepts,", + "bbox": [ + 212, + 703, + 787, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 393, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "and $\\hat{c}_{\\backslash S_t}$ are the model's predictions of non-intervened concepts. Intervening on concepts in this way updates the final prediction of the model from $\\hat{y}$ to $\\tilde{y} = f(\\tilde{c})$ . In the case of a CEM, intervening on concept $i$ to update its value from $\\hat{p}_i$ to $p_i$ changes its embedding from $\\hat{\\mathbf{c}}_i$ to $\\tilde{\\mathbf{c}}_i = p_i\\hat{\\mathbf{c}}_i^+ +(1 - p_i)\\hat{\\mathbf{c}}_i^-$ . After each intervention $t$ , we use a concept intervention policy $\\pi (\\tilde{c}_t)$ to decide which concept to intervene on next. While $\\pi$ can simply suggest random concepts for intervention, it is often much better to leverage heuristics that rank concepts in the order of importance (by some measure). A commonly deployed policy is UCP [10, 20], which uses the uncertainty of concepts; selecting concepts with the highest uncertainty (concept predictions closest to 0.5).", + "bbox": [ + 212, + 146, + 782, + 296 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Intervention-aware CEMs. While test-time interventions typically improve performance, this is not always guaranteed. In fact, recent works have shown that concept interventions can in some cases even hurt the model's performance [20, 28]. [29] noted that this stems from the lack of training incentive for the model to perform well under intervention. To address this, they proposed Intervention-aware CEMs (IntCEMs), which introduce interventions during the training process to improve the model's receptiveness to interventions at test time, outperforming all existing methods in the intervention setting. In particular, they train a CEM to minimize the following objective:", + "bbox": [ + 212, + 297, + 784, + 434 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {I n t C E M}} (x, c, y, \\mathcal {T}) = \\mathcal {L} _ {\\text {p r e d}} (x, c, y, \\hat {c}, \\tilde {c} _ {t}) + \\lambda_ {\\text {c o n c}} \\mathcal {L} _ {\\text {c o n c}} (\\hat {c}, c) + \\lambda_ {\\text {r o l l}} \\mathcal {L} _ {\\text {r o l l}} (x, c, y, \\mathcal {T}) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 222, + 458, + 784, + 489 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {p r e d}} (x, c, y, \\tilde {c} _ {0}, \\kappa_ {t}) = \\frac {\\mathrm {C E} (f (\\hat {c} , y) + \\gamma^ {T} \\mathrm {C E} (f (\\tilde {c} _ {t}) , y)}{1 + \\gamma^ {T}}\n$$\n", + "text_format": "latex", + "bbox": [ + 320, + 488, + 681, + 520 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "$\\mathcal{L}_{\\mathrm{pred}}$ is the prediction loss for $y$ , $\\mathcal{L}_{\\mathrm{conc}}$ the concept prediction loss, $\\mathcal{L}_{\\mathrm{roll}}$ the rollout loss incentivizing the model to predict the most informative concept for intervention. $\\lambda_{\\mathrm{conc}}$ and $\\lambda_{\\mathrm{roll}}$ are user-defined weights corresponding to $\\mathcal{L}_{\\mathrm{conc}}$ and $\\mathcal{L}_{\\mathrm{pred}}$ respectively, while $\\mathcal{T}$ denotes the intervention trajectory. $\\mathcal{L}_{\\mathrm{pred}}$ penalizes the model for incorrect predictions both before and after the intervention, and $\\gamma \\geq 1$ is a scaling term that prioritizes correct predictions after intervention.", + "bbox": [ + 212, + 523, + 782, + 614 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Concept Intervention Realignment", + "text_level": 1, + "bbox": [ + 214, + 635, + 545, + 650 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Previous works incrementally improve on predecessor methods by better parameterizing concept representations or introducing an intervention-aware training objective. However, all these works still treat concept interventions independently. This means that an intervention on one specific concept has no effect on the assignment of other concepts. This disregards relationships between concepts, which in practice do not occur independently (e.g., \"white wing\" and \"white belly\" are more likely to co-occur). As a result, the existing intervention process does not utilize human feedback optimally, as information about the verified existence of one concept should naturally guide the prediction of other concepts. While this aspect is naturally important to ensure that an accurate concept representation is passed to the label classifier, it is also crucial when utilizing concept-selection criteria such as UCP because intervening on one concept", + "bbox": [ + 212, + 659, + 784, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Concept Realignment in CBMs", + "bbox": [ + 521, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/33c29434c9938a5ef57a9856c386ef26e2c9d946b6dad8797e20f58f53c232a8.jpg", + "image_caption": [ + "Fig. 2: Illustration of the concept intervention realignment module. Given the concept encoding $g(x)$ , we intervene on the concept $i$ selected by a concept selection policy $\\pi$ . This concept is replaced with a ground-truth (GT) value $(\\in \\{0,1\\}$ depending on whether it is present in a given image or not) to obtain $\\tilde{c}_t$ (representing intervention step $t \\in \\{1,\\dots,T\\}$ ). This intervened concept representation is then passed into the concept realignment module (leveraging e.g. an MLP or LSTM reweighting mode), which outputs the realigned $u(\\tilde{c}_t)$ . To ensure that the ground-truth values provided by the user are not overwritten during realignment, $u(\\tilde{c}_t)$ retains ground-truth corrections. The final concept vector is then based into a concept-based classifier $f$ ." + ], + "image_footnote": [], + "bbox": [ + 243, + 143, + 759, + 272 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "should consequently reduce the chances of intervening on other closely related, likely co-occurring concepts, while also raising the probability that uncertain and unrelated concepts get intervened on.", + "bbox": [ + 212, + 426, + 782, + 472 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Intervention Realignment Module. To address this, we propose a concept intervention realignment module (CIRM), which consists of two interdependent components: (a) a concept realignment model (CRM), $u: \\mathcal{C} \\to \\mathcal{C}$ . After a user intervenes on a subset of concepts $S$ , the remaining concepts ( $\\backslash S$ ) are updated by a realigner network; and (b) an intervention policy $\\pi$ . The concepts predicted by the realignment model are fed to the policy to suggest which concept to intervene on next. Both components are interdependent, and together form the overall concept intervention realignment module, as also visualized in Figure 2. The training of the full CIRM comprising both selection policy and concept realignment model aims to simulate the complete intervention process. It thus starts from the concept predictions of the base model, $\\hat{c}$ , where we sequentially intervene on concepts for $T \\leq k$ time steps by following a policy of choice, $\\pi$ (in our case UCP by default, which we experimentally find to outperform random intervention significantly; See supp. §B).", + "bbox": [ + 212, + 491, + 787, + 700 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As in §3.1, let $S_{t}$ denote the set of intervened concepts and $\\tilde{c}_{t} = \\{c_{S_{t}},\\hat{c}_{\\setminus S_{t}}\\}$ denote the concepts at time $t$ , respectively. At every intervention time step, we feed $\\tilde{c}_{t}$ to the realignment model to obtain updated concept predictions as $\\kappa_{t} = u(\\tilde{c}_{t})$ , which in turn are utilized by $\\pi (\\kappa_{t})$ to produce intervention recommendations for $t + 1$ . Finally, we train $u$ with the ground-truth labels as targets using the loss $\\mathcal{L}(u) = (\\sum_{t = 0}^{T}\\mathrm{CE}(u(\\tilde{c}_{t}),c)) / T$ .", + "bbox": [ + 212, + 703, + 787, + 794 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Using this simple objective, the concept realignment model $u$ learns to take concept representations and leverage intervened concepts $S_{t}$ to predict an updated concept distribution, i.e., $p(i; \\hat{c}, S_{t})$ . Note that this training objective uti", + "bbox": [ + 212, + 795, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 393, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "izes standard CBM training information (i.e., concept annotations, [9, 20, 27-29]); so no additional information beyond the standard CBM pipeline is required.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The overall training pipeline can still follow the standard CBM training paradigms (see previous section), with the intervention realignment module being trained independently on top of a pre-trained frozen CBM/CEM as a posthoc realignment method, or jointly with the CBM/CEM to introduce an explicit realignment objective during training. For posthoc realignment, we first train the backbone $f$ and the classification head $g$ . Subsequently, we freeze those components and train the realignment model $u$ .", + "bbox": [ + 212, + 178, + 784, + 282 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Realignment Models. As shown in Fig. 2, we parameterize our concept realignment model with a neural network $v$ . To ensure that $u$ does not overwrite the ground-truth concepts provided by the user, we also keep track of the already intervened concepts $S_{t}$ . Using this information, we replace the output of the realigned concept embedding with the user-provided values for concepts in $S_{t}$ . Hence, the final output of $u$ for the $i^{th}$ concept is given as", + "bbox": [ + 212, + 304, + 782, + 393 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nu \\left(\\tilde {c} _ {t}, \\mathcal {S} _ {t}\\right) ^ {(i)} = v \\left(\\tilde {c} _ {t}\\right) ^ {(i)} \\quad \\text {i f} i \\notin \\mathcal {S} _ {t} \\text {e l s e} \\quad \\tilde {c} _ {t} ^ {(i)} \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 349, + 407, + 784, + 428 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Depending on the assumptions made on the realignment process, $v$ is either a simple MLP or a recurrent model (such as an LSTM [7]). The former parametrizes our default concept intervention realignment model, which only passes the set of intervened and un-intervened concepts at intervention step $t$ to the concept realignment model consisting of a simple MLP. The set of concepts fed into the MLP may either be the original concept embedding $\\tilde{c}_0$ , where all intervened concepts up to and including step $t$ have been replaced with ground-truth values, or the previously realigned $\\kappa_{t-1}$ with similarly updated intervened concepts (c.f. Fig. 2, \"GT\"). Note that in either case, $\\kappa_{t-1}$ informs the selection process of the subsequent concept to intervene on. After all interventions, the final concept embedding fed into the classifier is always $u(\\tilde{c}_T)$ . Practically, we found using $\\tilde{c}_t$ to work slightly better than $\\kappa_{t-1}$ . Both cases above however only pass the final set of concepts at time $t$ to the realignment model. Given the sequential nature of interventions, however, it may also be beneficial to account for the entire intervention history to inform future concept realignment. As a result, we also introduce a recurrent realignment variant, $u_{\\mathrm{rec}}$ , which employs an LSTM model to retain the entire history of interventions until time $t$ . An algorithmic summary is provided in supplementary §A.", + "bbox": [ + 212, + 440, + 787, + 713 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "End-to-End Realignment. In order to jointly train the CIR module and the base model $f \\circ g$ , we will perform interventions while also training the base model. This naturally combines with the IntCEM framework [29], which incorporates train-time interventions, and as such is our default choice for joint model and realignment module training.", + "bbox": [ + 212, + 732, + 782, + 808 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Concretely, we modify IntCEMs such that after $t$ interventions, concepts $\\tilde{c}_t$ are corrected post-intervention to obtain $\\kappa_t = u(\\tilde{c}_t)$ , which is then fed to the", + "bbox": [ + 212, + 809, + 782, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Concept Realignment in CBMs", + "bbox": [ + 521, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "classifier $f$ . The new training objective, then, is:", + "bbox": [ + 215, + 146, + 565, + 162 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {I n t C E M - R e A}} (x, c, y, \\mathcal {T}) = \\mathcal {L} _ {\\text {p r e d}} (x, c, y, \\tilde {c} _ {0}, \\kappa_ {t}) + \\lambda_ {\\text {c o n c}} \\mathcal {L} _ {\\text {c o n c - R e A}} (\\hat {c}, c, \\kappa_ {0}, \\kappa_ {t}) + \\lambda_ {\\text {r o l l}} \\mathcal {L} _ {\\text {r o l l}} \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 215, + 174, + 802, + 205 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {c o n c - R e A}} (\\hat {c}, c, \\kappa_ {0}, \\kappa_ {t}) = \\frac {1}{2} \\left(\\mathcal {L} _ {\\text {c o n c}} (\\hat {c}, c) + \\frac {\\mathrm {C E} (\\kappa_ {0} , c) + \\gamma^ {T} \\mathrm {C E} (\\kappa_ {T} , c)}{1 + \\gamma^ {T}}\\right) \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 259, + 215, + 785, + 250 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathcal{L}_{\\mathrm{conc - ReA}}$ is the modified concept prediction loss which trains both the backbone $g$ of the base model (first term) as well as the CRM (second term). We use the same $\\gamma$ as in $\\mathcal{L}_{\\mathrm{pred}}$ to prioritize correct predictions by the CRM after intervention, and the same $\\lambda_{\\mathrm{conc}}$ and $\\lambda_{\\mathrm{roll}}$ as in Eq. 1.", + "bbox": [ + 215, + 255, + 785, + 316 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 339, + 375, + 357 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Preliminaries", + "text_level": 1, + "bbox": [ + 215, + 372, + 372, + 386 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Datasets & Implementation. We perform experiments on three datasets: (1) Caltech-UCSD Birds-200-2011 (CUB) [22] containing $n = 11,788$ bird images over 200 classes. Following the original CBM paper [9], we use 112 concepts grouped into 28 concept groups with the same splits. (2) Large-scale CelebFaces Attributes (CelebA) [11] contains over 200,000 celebrity images annotated with 40 attribute labels, including noisy characteristics such as gender and age. Following [27, 29], we use only the most balanced 8 concepts in our experiments, resulting in $2^8 = 256$ classes. (3) Animals with Attributes 2 (AwA2) [23] is a collection of $n = 37,322$ animal images over 50 classes annotated with 85 attributes such as species, color, and behavior. We perform experiments on CEMs, IntCEMs, and three types of CBMs (sequential, independent, and joint). For all models and datasets, we follow the hyperparameters used in [29]. During CIRM training, we sequentially intervene on concepts $T = k$ times. By default, we use UCP both during training and inference, and if not stated otherwise, use a multi-layered perceptron (MLP) for concept realignment. We use the predictions of the base CBM $(\\tilde{c}_t)$ as its input for un-intervened concept representations. We perform a small, standard hyperparameter using Optuna [1] with 50 trials to search over the number of hidden layers $\\in \\{1,2,3\\}$ and units $\\in \\{k,2k,k/2\\}$ , the learning rate $\\in [10^{-5},10^{-1}]$ and weight decay $\\in [10^{-6},5\\times 10^{-5}]$ , and use the same batch size as used to train the base model. We employ early stopping and learning rate decay on the validation loss. For joint training, we instantiate the realigner MLP 2 hidden layers containing $k$ neurons each. Experiments are conducted using PyTorch [16].", + "bbox": [ + 215, + 397, + 787, + 746 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 Concept Realignment Improves Intervention Efficacy", + "text_level": 1, + "bbox": [ + 215, + 768, + 697, + 784 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To probe the efficacy of our concept intervention realignment module, we evaluate both the change in concept prediction loss as well as overall classification accuracy as a function of intervened concept counts. These are visualized in Fig. 3", + "bbox": [ + 215, + 794, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 393, + 128 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/4f0634b52f39203f76a68198ceb304cfe9f5fec82fff6ba0d854d8e259213ad2.jpg", + "image_caption": [ + "Fig. 3: Concept prediction loss vs. the number of intervened concepts with and without concept realignment. Concept realignment consistently improves concept predictions." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 401, + 257 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/f62223b8209a4f0f8fd56d81b60e5bb2c3eab76b34eb28cf83cf3b2b855ab6b0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 405, + 143, + 586, + 257 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/911a49d89a8e0493cbd5434042f13c8f7828b6aef23126feebea0f4fa21025ff.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 589, + 143, + 781, + 257 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/486fc9e937013077583530908d787db2c06008e1fdc9cc2db782cb5aea8f54c8.jpg", + "image_caption": [ + "Fig. 4: Classification accuracy vs. the number of intervened concepts with and without concept realignment. Realignment consistently improves classification accuracy." + ], + "image_footnote": [], + "bbox": [ + 235, + 299, + 406, + 406 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/ac7c9c8bca790519b78d922e3b55ed9064743009e776501e5b4e4f686c7cec7e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 411, + 300, + 583, + 406 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/d5efa0ab317140b1f17a19f70be107ae1fb51b1f46fffdaa9125fd5165cab9d9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 586, + 301, + 759, + 406 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "and Fig. 4 for sequentially trained CBMs (see §3.1), respectively, for all benchmark test sets - CUB, CelebA and AwA2. Note that for AwA2, we only show the first 50 interventions for visual clarity, as performance beyond that heavily plateaus since sufficient concepts have been intervened on to perfectly solve the test data. Table 1 numerically summarizes these results via AUC scores and provides additional scores for independently trained CBMs, jointly trained CBMs as well as Concept Embedding Models (CEMs). Runs in Tab. 1 & Figs. 3, 4 all utilize the stronger UCP selection policy as opposed to the weaker random selection policy (\\$B) to measure intervention efficacy at the highest level, and train the concept realignment module on top of already trained concept models.", + "bbox": [ + 212, + 464, + 787, + 617 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Improved concept attribution through intervention. Across all datasets, we can observe a consistent, in parts vast reduction in concept prediction loss, which measures the correct assignment of concepts for each input (using the concept loss described in §3.1). For example on CUB, a tenfold reduction of the original unintervened concept loss ( $\\sim 0.6$ to $\\sim 0.06$ ) can be achieved with half the number of interventions (11 with concept realignment, 23 without). This effect becomes even more prevalent on AwA2, where a tenfold reduction ( $\\sim 0.17 \\rightarrow \\sim 0.017$ ) is achieved after around 16 interventions with realignment versus more than 60 without; marking a more than $70\\%$ reduction in intervention efforts. This is also reflected in Tab. 1, where concept loss AUC drops by in parts more than half for CUB and from 4.26 to 1.13 on AwA2. We find this significant improvement in concept attribution persists across all CBMs and CEMs, as well as random seed initializations (see Supp. Tab. 2 and 3)", + "bbox": [ + 214, + 643, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Concept Realignment in CBMs", + "bbox": [ + 521, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/ce4d13cd17820686fc40204ba4309e4d99d20c69b666717f43c362146ab5f05b.jpg", + "table_caption": [ + "Table 1: Area Under Curve (AUC) of Concept Prediction Loss and Classification Accuracy with/without CIRM (non-averaged sum). We use the same backbone throughout. CIRM improves performance across all models and datasets. Intervention curves share long saturation plateaus for high intervention counts. Accuracy AUC scores are thus saturated, and best combined with performance graphs in Figs. 3, 4." + ], + "table_footnote": [], + "table_body": "
Base ModelRealignedConcept LossAUC ↓Accuracy AUC ↑
CUBCelebAAwA2CUBCelebAAwA2
Sequential CBM×6.711.594.262460.8280.78364.0
✓3.151.521.132510.9284.38397.6
Independent CBM×6.711.594.262653.4280.28403.4
✓3.151.521.132678.3282.18437.0
Joint CBM×5.933.064.772580.3273.18276.4
✓3.671.761.482609.0273.98327.4
CEM×5.991.614.902521.4396.38429.3
✓3.201.461.692558.4400.18433.9
", + "bbox": [ + 264, + 220, + 718, + 349 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We do find that for CelebA with a much more restrictive concept bottleneck than e.g. CUB and AwA2, due to significantly fewer (note that in CUB concepts are already grouped, see §4.1) and noisier concepts, that the overall gain in concept accuracy is smaller. This is also reflected in the notably weaker performance of the base CBM (c.f. Fig. 4, middle - less than $38\\%$ accuracy when intervening on all concepts), which strongly points towards overall insufficient concept information provided in the CelebA training data. Overall, however, we find very clear evidence that the concept intervention realignment module allows practitioners to leverage human intervention feedback to a much larger extent to attribute the correct concepts to respective inputs. This means that the subsequent classifier will operate on a much more accurate set of concepts, thereby improving the overall interpretability of the final classification decision.", + "bbox": [ + 212, + 367, + 787, + 547 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Improved overall classification through intervention. On top of that, we also find that the significant gain in intervention efficacy on a concept attribution level also translates to subsequent gains in intervention efficacy for the overall classification performance (Fig. 4). For example on CUB, the final classification accuracy after intervening on all concepts is $93.9\\%$ , which is achieved already after $\\sim 16$ intervention steps. A comparable performance without concept intervention realignment requires nearly complete, $\\sim 24$ intervention steps, marking a $50\\%$ increase. The same can be seen on CelebA and AwA2 as well, where the upper-bound performance can be achieved with much fewer interventions (particularly without the need to intervene on all concepts). Even intermediate performance targets are achieved much earlier; a classification accuracy target of e.g. $98\\%$ on AwA2 requires only 12 concept interventions with realignment, while the non-aligned baseline needs 19 interventions on average. We find these results to be also reflected numerically in Tab 1, where accuracy AUC increases from e.g. 2460.8 to 2510.9 on CUB. We do point towards high numerical saturation given the larger performance plateaus at higher intervention counts, and high starting accuracies (e.g. $\\sim 90\\%$ on AwA2). Numerical results are thus best considered alongside the intervention trajectories in Figs. 3 and 4.", + "bbox": [ + 212, + 568, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 392, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/d0023cba8915d0aeb0c3f19f15cf338dddf16c3b508b03f58e37dc129c855dfc.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 297, + 143, + 495, + 266 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/67da66eb9ebfa1e49919a178026db1dd117bbefb3c6d1cb9020bcd80a44e1655.jpg", + "image_caption": [ + "(b)", + "Fig. 5: Concept Intervention Realignment in intervention-aware CEMs. (a) Concept prediction loss and (b) classification accuracy with jointly and post-hoc trained CIRMs. In both cases, significant benefits can be seen, especially for correct concept attribution after intervention - both for jointly and posthoc trained realignment modules." + ], + "image_footnote": [], + "bbox": [ + 496, + 143, + 700, + 267 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Together, our experiments provide strong evidence that concept intervention realignment is crucial to best leverage human feedback in concept-based decision systems; allowing to significantly reduce intervention budgets by in parts over $70\\%$ to achieve a desired target performance. These gains can also be achieved after concept models have been trained, allowing for versatile applicability.", + "bbox": [ + 214, + 362, + 784, + 439 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Intervention Realignment for Intervention-aware CEMs", + "text_level": 1, + "bbox": [ + 215, + 463, + 718, + 479 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In this section, we investigate training the CIRM during the training process of an already intervention-regularized concept model; namely the recently proposed, state-of-the-art intervention-aware CEM [29] (see also §3.1). Following the objective described in Eq. 3, we operate and train the concept intervention module in conjunction with the intervention objective proposed by [29].", + "bbox": [ + 212, + 491, + 784, + 566 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Our results are shown in Fig. 5. First, we find that explicit concept intervention realignment can significantly improve correct concept attribution, even in intervention-aware training setups (c.f. Fig. 5a). While not as significant as improvements over standard CBM models, for specific target concept prediction losses (such as a fivefold reduction from 0.5 to 0.1), half the number of intervention steps are needed (11 versus 20). The improved concept attribution is also reflected in higher intervention accuracies as seen in Fig. 5b, albeit the overall (still notable!) improvement is less reflective of the significant gains on a concept level (additional results can be found in supp. §C). Overall, however, our experiments highlight that even when applied to state-of-the-art approaches that specifically simulate the intervention process during training, improved intervention efficacy can be found. Importantly, the consistently significant improvements on a concept attribution level mean that classification decisions are much better grounded on correct concept attributions, which is crucial for interpretability [9, 27] of classification results. Finally, we find that concept intervention realignment can be applied both as a regularization mechanism during training, as well as adapted entirely posthoc, while still offering consistent benefits. This supports the high versatility of CIRMs as a general-purpose tool to increase intervention efficacy.", + "bbox": [ + 214, + 568, + 785, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Concept Realignment in CBMs", + "bbox": [ + 522, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/9a6d418ed986b3afd0c8682ab92ced1bdab24833cb6a560c23e225f3a1005c8d.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 297, + 145, + 496, + 263 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/b4e038a43eb1cf321afef6c8c4ce618c608e622ccfb857c6c20ec581211fc8d5.jpg", + "image_caption": [ + "(b)", + "Fig. 6: (a) Concept prediction loss and (b) classification accuracy for various realigner architectures alongside UCP policy. Using an MLP with concept predictions of the base model works better than compounding refinements and accounting for intervention trajectories using LSTMs." + ], + "image_footnote": [], + "bbox": [ + 501, + 143, + 699, + 265 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 Realignment Module Ablations", + "text_level": 1, + "bbox": [ + 215, + 357, + 519, + 372 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "**Realignment Model Architectures.** In this section, we study the effect of various design choices for the realignment module along two dimensions: (1) Recurrent vs. Feedforward Networks: Since we intervene on concepts sequentially, it is possible that the realignment module can benefit from the overall order and history of interventions to make more accurate concept predictions. To do this, we instantiate the concept realignment network using an LSTM [7]. We compare this against our default MLP. (2) Previous Output vs. Original Concepts: By default, the realignment module takes as input a combination of ground-truth concepts provided by the user and values predicted by the base model at $t = 0$ for the concepts that have not been intervened on (see also §3.2). Due to the sequential nature of interventions, one may also directly feed the output of the realignment module at time $t - 1$ as input to it at time $t$ in order to compound the refinements over multiple time steps. Combining both axes results in four recombinations, which we compare in Fig. 6. As can be seen, there is limited gain when accounting for the complete intervention history using an LSTM realigner network. Similarly, we find that applying the MLP primarily for concept selection alongside UCP and as final input to the classification head works better than compounding refinements over intervention steps.", + "bbox": [ + 212, + 383, + 787, + 656 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Intervention Policy Transfer. In this section, we study the importance of aligning intervention policies used during training with those deployed at test time. In particular, we operate on the base setup, which deploys the CBM and the concept intervention realignment module using only the much weaker random intervention policy at test time. However, we change the policy used to train the concept intervention realignment module. Our results are visualized in Fig. 7. As can be seen, while a realignment module trained with UCP can still be effective when deployed with a random intervention policy, it is notably outperformed by the weaker random policy at test-time when the realignment module has been trained on the same random policy as well. This means that the realignment module adapts to the selection policy used during training. Thus to get the", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 393, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/52cf06560caf640256b950a2fc1a6977539bf0c9d5315954bbca7e1779e9abc8.jpg", + "image_caption": [ + "Fig. 7: Concept prediction loss and classification accuracy under random interventions for realignment modules trained with random and UCP policy, respectively. Results indicate that alignment of policy used during training and deployment is important." + ], + "image_footnote": [], + "bbox": [ + 295, + 143, + 496, + 263 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/da9a1db1716396b83a3db4550b393b719586353de477d3ef39a3a30cd99c0074.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 501, + 143, + 700, + 265 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "most benefits out of concept intervention realignment, selection policies should align during training and deployment.", + "bbox": [ + 212, + 329, + 782, + 359 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Alignment $b / w$ Realignment Module Components. Finally, we study how important the alignment between the concept realignment model and intervention policy (i.e., UCP) is to form the overall concept intervention realignment module. To accomplish this, we employ two module variations: (a) an original policy denoted as $\\pi (\\hat{c}_0)$ , which only applies the UCP criterion to the original concept predictions generated by the base model without any concept realignment (i.e., the policy does not change over time), and (b) our default setup (updated policy), which informs the intervention policy using realigned concept values $(\\pi (\\kappa_{t}))$ . Note that in both cases, the clas", + "bbox": [ + 215, + 373, + 544, + 598 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "sification head still receives realigned concept embeddings, as we only want to study the importance of alignment between the concept realignment model and the intervention policy. Results in Fig. 8 clearly reveal that while simple realignment on its own can already help improve intervention efficacy, much larger efficacy gains are unlocked when both policy and the realignment model are utilized in conjunction.", + "bbox": [ + 212, + 599, + 784, + 689 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/d2f209a2642fc7f42f49ae445509a5a341202a944b53480c701fd1a198f9ffff.jpg", + "image_caption": [ + "Fig. 8: Classification accuracy vs concept interv. counts, showing our updated selection policies improving over the static one." + ], + "image_footnote": [], + "bbox": [ + 555, + 382, + 782, + 525 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A Closer Look at Concept Realignment. To understand the impact of the realignment process qualitatively, we also provide examples in Fig. 9. In this figure, we showcase the impact of interventions on the top 10 concepts with the highest prediction errors, and the specific number of interventions required to predict the correct label. For both examples, we find that intervention on a single concept is insufficient to flip incorrect class predictions. However, as we intervene on more concepts, we can clearly see that concept realignment jointly allows concept prediction error - even on the initially worst predicted concepts - to be significantly reduced, while also reaching correct image classification with", + "bbox": [ + 212, + 703, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Concept Realignment in CBMs", + "bbox": [ + 522, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/dbf23b4fe5e321f8ccfe216749dce3c58e1b62f554bd188fe0786dfd00d96031.jpg", + "image_caption": [ + "Fig. 9: Examples for the improved intervention efficiency of CIRM. We show the change in concept prediction errors of the ten worst predicted concepts, as a function of concept intervention steps $t$ : concept realignment allows concept error even for strongly mispredicted concepts to be significantly reduced with interventions, achieving correct label classification after much fewer interventions compared to non-realigned baselines." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 781, + 335 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "in parts less than half the number of interventions (for Crested Auklet). These results conceptually support the quantitative benefits of concept realignment seen in previous benchmark experiments.", + "bbox": [ + 212, + 428, + 787, + 474 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 492, + 359, + 508 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we identify the independent treatment of concepts during test-time interventions in CBMs as a cause for reduced intervention efficacy. To remedy this problem, we propose a concept intervention realignment module - a simple and lightweight technique to automatically update concept assignments after human intervention on one or multiple concepts. Our experiments demonstrate significant gains in concept attribution as well as overall classification accuracy of concept-based models under intervention. We show that our approach is versatile and can be applied to a wide range of concept-based models, intervention policies, and training schemes. We believe that the reduction in required human interventions to reach performance targets facilitates the practical deployment of concept-based models even in resource-constrained environments.", + "bbox": [ + 212, + 521, + 787, + 686 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 705, + 403, + 724 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Karsten Roth and Jae Myung Kim thank the European Laboratory for Learning and Intelligent Systems (ELLIS) PhD program and the International Max Planck Research School for Intelligent Systems (IMPRS-IS) for support. This work was supported by DFG project number 276693517, by BMBF FKZ: 01IS18039A, by the ERC (853489 - DEXIM), by EXC number 2064/1 - project number 390727645. The authors would like to thank Shyamgopal Karthik and Leander Gerrbach for their helpful feedback on the manuscript.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 393, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 323, + 160 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: A next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. pp. 2623-2631 (2019) 8", + "2. Alvarez Melis, D., Jaakkola, T.: Towards robust interpretability with self-explaining neural networks. Advances in neural information processing systems 31 (2018) 3", + "3. Chauhan, K., Tiwari, R., Freyberg, J., Shenoy, P., Dvijotham, K.: Interactive concept bottleneck models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 5948-5955 (2023) 3", + "4. Durán, J.M., Jongsma, K.R.: Who is afraid of black box algorithms? on the epistemological and ethical basis of trust in medical ai. Journal of Medical Ethics 47(5), 329-335 (2021). https://doi.org/10.1136/medethics-2020-106820, https://jme.bmj.com/content/47/5/329 1", + "5. EUGDPR: Gdpr. general data protection regulation (2017) 1", + "6. Havasi, M., Parbhoo, S., Doshi-Velez, F.: Addressing leakage in concept bottle-neck models. Advances in Neural Information Processing Systems 35, 23386-23397 (2022) 3", + "7. Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural computation 9(8), 1735-1780 (1997) 7, 12", + "8. Kim, E., Jung, D., Park, S., Kim, S., Yoon, S.: Probabilistic concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 16521-16540. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/kim23g.html 3", + "9. Koh, P.W., Nguyen, T., Tang, Y.S., Mussmann, S., Pierson, E., Kim, B., Liang, P.: Concept bottleneck models. In: International conference on machine learning. pp. 5338-5348. PMLR (2020) 1, 2, 3, 4, 7, 8, 11", + "0. Lewis, D.D., Catlett, J.: Heterogeneous uncertainty sampling for supervised learning. In: Machine learning proceedings 1994, pp. 148-156. Elsevier (1994) 5", + "1. Liu, Z., Luo, P., Wang, X., Tang, X.: Deep learning face attributes in the wild. In: Proceedings of the IEEE international conference on computer vision. pp. 3730-3738 (2015) 3, 8", + "2. Mahinpei, A., Clark, J., Lage, I., Doshi-Velez, F., Pan, W.: Promises and pitfalls of black-box concept learning models. arXiv preprint arXiv:2106.13314 (2021) 3", + "3. Marconato, E., Passerini, A., Teso, S.: Glancenets: Interpretable, leak-proof concept-based models. Advances in Neural Information Processing Systems 35, 21212-21227 (2022) 3", + "4. Margeloiu, A., Ashman, M., Bhatt, U., Chen, Y., Jamnik, M., Weller, A.: Do concept bottleneck models learn as intended? arXiv preprint arXiv:2105.04289 (2021) 3", + "5. Oikarinen, T., Das, S., Nguyen, L.M., Weng, T.W.: Label-free concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3", + "6. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., Kopf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., Fang, L., Bai, J., Chintala, S.: Pytorch: An imperative style, high-performance deep learning library. In: Advances" + ], + "bbox": [ + 225, + 175, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Concept Realignment in CBMs", + "bbox": [ + 521, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "in Neural Information Processing Systems 32, pp. 8024-8035. Curran Associates, Inc. (2019), http://papers.neurips.cc/paper/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf 8", + "17. Piano, S.L.: Ethical principles in machine learning and artificial intelligence: cases from the field and possible ways forward. Palgrave Communications 7(1), 1-7 (2020), https://EconPapers.repec.org/RePEc:pal:palcom:v:7:y:2020:i:1:d:10.1057_s41599-020-0501-9_1", + "18. Sawada, Y., Nakamura, K.: Concept bottleneck model with additional unsupervised concepts. IEEE Access 10, 41758-41765 (2022) 3", + "19. Sheth, I., Rahman, A.A., Sevyeri, L.R., Havaei, M., Kahou, S.E.: Learning from uncertain concepts via test time interventions. In: Workshop on Trustworthy and Socially Responsible Machine Learning, NeurIPS 2022 (2022) 3", + "20. Shin, S., Jo, Y., Ahn, S., Lee, N.: A closer look at the intervention procedure of concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 31504-31520. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/ shin23a.html 2, 3, 4, 5, 7", + "21. Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: Automated decisions and the gdpr (2018) 1", + "22. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) 2, 3, 8", + "23. Xian, Y., Lampert, C.H., Schiele, B., Akata, Z.: Zero-shot learning—a comprehensive evaluation of the good, the bad and the ugly. IEEE transactions on pattern analysis and machine intelligence 41(9), 2251-2265 (2018) 3, 8", + "24. Xu, X., Qin, Y., Mi, L., Wang, H., Li, X.: Energy-based concept bottleneck models. In: The Twelfth International Conference on Learning Representations (2023) 3", + "25. Yang, Y., Panagopoulou, A., Zhou, S., Jin, D., Callison-Burch, C., Yatskar, M.: Language in a bottle: Language model guided concept bottlenecks for interpretable image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19187-19197 (2023) 3", + "26. Yuksekgonul, M., Wang, M., Zou, J.: Post-hoc concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3", + "27. Zarlenga, M.E., Barbiero, P., Ciravegna, G., Marra, G., Giannini, F., Diligenti, M., Shams, Z., Precioso, F., Melacci, S., Weller, A., et al.: Concept embedding models. arXiv preprint arXiv:2209.09056 (2022) 1, 2, 3, 4, 7, 8, 11", + "28. Zarlenga, M.E., Barbiero, P., Shams, Z., Kazhdan, D., Bhatt, U., Weller, A., Jamnik, M.: Towards robust metrics for concept representation evaluation. arXiv preprint arXiv:2301.10367 (2023) 4, 5, 7", + "29. Zarlenga, M.E., Collins, K.M., Dvijotham, K.D., Weller, A., Shams, Z., Jamnik, M.: Learning to receive help: Intervention-aware concept embedding models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023) 1, 2, 3, 4, 5, 7, 8, 11" + ], + "bbox": [ + 215, + 147, + 785, + 741 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Singhi et al., 2024", + "bbox": [ + 271, + 114, + 392, + 127 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_model.json b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_model.json new file mode 100644 index 0000000000000000000000000000000000000000..d492179b88128bda04579cc84637ef17ce7323a8 --- /dev/null +++ b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_model.json @@ -0,0 +1,1794 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.249, + 0.141, + 0.756, + 0.187 + ], + "angle": 0, + "content": "Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models" + }, + { + "type": "text", + "bbox": [ + 0.252, + 0.212, + 0.751, + 0.228 + ], + "angle": 0, + "content": "Nishad Singhi1 Jae Myung Kim1 Karsten Roth1 Zeynep Akata2" + }, + { + "type": "text", + "bbox": [ + 0.358, + 0.23, + 0.646, + 0.243 + ], + "angle": 0, + "content": "Primary contact: nishadsinghi@gmail.com" + }, + { + "type": "text", + "bbox": [ + 0.22, + 0.255, + 0.782, + 0.27 + ], + "angle": 0, + "content": "\\(^{1}\\)Tübingen AI Center, University of Tübingen \\(^{2}\\)Helmholtz München, TU München" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.301, + 0.744, + 0.58 + ], + "angle": 0, + "content": "Abstract. Concept Bottleneck Models (CBMs) ground image classification on human-understandable concepts to allow for interpretable model decisions as well as human interventions, in which expert users can modify misaligned concept choices to interpretably influence the decision of the model. However, existing approaches often require numerous human interventions per image to achieve strong performances, posing practical challenges in scenarios where obtaining human feedback is expensive. In this paper, we find that this is driven by an independent treatment of concepts during intervention, wherein a change of one concept does not influence the use of other ones. To address this issue, we introduce a trainable concept intervention realignment module, which leverages concept relations to realign concept assignments post-intervention. Across standard benchmarks, we find that concept realignment significantly improves intervention efficacy and reduces the number of interventions needed to reach a target classification performance or concept prediction accuracy. Moreover, it easily integrates into existing concept-based architectures without requiring changes to the models themselves. This reduced cost of human-model collaboration is crucial to enhance the feasibility of CBMs in resource-constrained environments. Our code is available at https://github.com/ExplainableML/concept_realignment." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.592, + 0.711, + 0.606 + ], + "angle": 0, + "content": "Keywords: Concept Bottlenecks \\(\\cdot\\) Trustworthiness \\(\\cdot\\) Interventions" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.629, + 0.376, + 0.645 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Despite tremendous progress of Deep Learning (DL) techniques in research and applications, their adoption to high-stakes scenarios has been limited [9, 27, 29]. This is in large part due to unpredictable failure cases of deep models when transferring to unseen data or complex & ambiguous cases. The black-box nature of typical DL models further exacerbates this problem, as it makes understanding and debugging the decision-making process of these models difficult. Consequently, it becomes hard for human practitioners to trustworthily operate these models in scenarios with significant legal [5, 21] or ethical [4, 17] constraints. To foster trust, transparency in the decision-making process, and the ability to operate alongside expert feedback are required. In order to incorporate these desiderata into the design space of deep models, Koh et al. [9] introduced Concept Bottleneck Models (CBMs). These models break the decision process into" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.395, + 0.129 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "image", + "bbox": [ + 0.244, + 0.144, + 0.761, + 0.294 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.303, + 0.788, + 0.361 + ], + "angle": 0, + "content": "Fig. 1: Concept-based classification models allow for human intervention, where a human expert can correct specifically assigned concepts. However, to achieve satisfactory performance, concept-based classification models often require a large number of interventions, where each additional intervention requires costly human interaction." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.371, + 0.789, + 0.844 + ], + "angle": 0, + "content": "the extraction of human-interpretable concepts (such as \"white wings\" and \"orange beak\" when classifying a seagull) from a given input, and a subsequent concept-grounded classifier operating on top of these concept predictions. While this allows users to peek into the model decision process - maybe even more importantly, it also uniquely allows for human-guided intervention and feedback integration at test time. This is done through concept interventions, wherein an expert user analyses predicted concepts and optionally replaces those they deem incorrect with ground-truth information (Fig. 1). Such interventions can significantly raise the performance and reliability of these models [9,20,27,29], while offering a natural interface for human-AI collaboration. However, human annotation is expensive, especially when resources and access to expert knowledge are limited. Ideally, such concept models should operate well with minimal human input. This becomes particularly prevalent as CBMs (as well as follow-up extensions such as Concept Embedding Models (CEMs, [27])) often require numerous interventions in order to significantly boost model performance [9,27,29], as the set of concepts these models operate on can often be rather extensive. For example, on the widely used CUB benchmark (bird classification, [22]), it takes 13 interventions per image on average to raise the accuracy of a baseline CBM model from around \\(68\\%\\) to \\(90\\%\\) (Fig. 4). In this work, we posit that a large part of this limited intervention efficacy can be traced back to the independent nature of how concept interventions are treated. This means that correcting for one concept (or a set of concepts) does not affect which other concepts are predicted for the same image. However, the occurrence of concepts in real life is often correlated, and informing the model about one concept should consequently influence the use of related ones. Not doing so means that we do not leverage human feedback to its full extent - intervening on one specific concept naturally gives additional context about the potential occurrence of other concepts, which should be taken into account in the final classification process. In particular, we study the extent of this crucial aspect when operating with concept-based models. Our study highlights how the use of a simple concept intervention realignment module, which learns from statistical concept relations, can effec" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.522, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Concept Realignment in CBMs" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.375 + ], + "angle": 0, + "content": "tively and automatically realign concept values after an intervention (or multiple) have been performed. Our experiments reveal how our concept realignment seamlessly integrates into and improves existing CBM approaches (e.g. default CBMs [9], CEMs [27] or intervention-aware CEMs [29]), and can be deployed both jointly during the initial training of the concept model, and as a post-hoc trained realignment mechanism. Across three standard, real-world benchmarks (CUB [22], CelebA [11] and AwA2 [23]), we showcase consistent, in parts very significant improvements in intervention efficacy. Across concept prediction and overall classification accuracy, performance increases more rapidly with interventions as compared to baselines without realignment (reducing the number of interventions needed to reach a target performance by over \\(70\\%\\)). Combined with its versatile usage and minimal additional resource requirements, we believe our insights into concept intervention realignment to be of high practical relevance, helping to drive down the cost of human-model collaboration and facilitate the corresponding practical deployment of concept-based models." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.394, + 0.396, + 0.41 + ], + "angle": 0, + "content": "2 Related Works" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.422, + 0.788, + 0.603 + ], + "angle": 0, + "content": "Concept Bottleneck Models (CBMs) have been extensively studied since their introduction by [9]. [27] proposed Concept Embedding Models as a generalization, utilizing embedding vectors for concepts rather than scalar probabilities, thus enhancing task performance while maintaining interpretability. Recent efforts have explored methods to enhance CBMs without requiring explicit concept supervision during training, leveraging pre-trained vision backbones and language guidance [15, 25, 26]. [2] introduced Self-explaining Neural Networks (SENNs) for unsupervised concept learning, while [18] proposed CBMAUC combining SENNs with CBMs. Probabilistic CBMs [8] were proposed to model uncertainty in concepts and final predictions. [12, 14] addressed concept leakage, while [6, 13] aimed to alleviate it. Our work complements these efforts by enabling CBMs to update predictions of all concepts after human intervention." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.604, + 0.788, + 0.74 + ], + "angle": 0, + "content": "Interventions on CBMs. [9] showed that intervening on random concepts enhances classification in CBMs. [3] and [19] proposed uncertainty-based strategies for interventions. [20] extensively studied concept selection strategies, focusing on task performance and execution cost. [29] introduced interventions during training to enhance model receptiveness to test-time interventions. We complement existing methods by updating predictions of all concepts following expert interventions. Concurrently, [24] proposed Energy-based CBMs to automate concept prediction updates. In comparison, our method benefits from higher simplicity, improved performance, and seamless integration with existing CBMs." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.76, + 0.338, + 0.775 + ], + "angle": 0, + "content": "3 Methods" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.788, + 0.513, + 0.803 + ], + "angle": 0, + "content": "3.1 Background and Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Concept Bottleneck Models. A Concept-Bottleneck Model (CBM) can be viewed as a composition of two models, \\( h = f(g(x)): \\mathcal{X} \\to \\mathcal{Y} \\), with concept en-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.395, + 0.129 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.466 + ], + "angle": 0, + "content": "coder \\( g: \\mathcal{X} \\to \\mathcal{C} \\), and concept-based classification head \\( f: \\mathcal{C} \\to \\mathcal{Y} \\). \\( \\mathcal{X}, \\mathcal{Y} \\), where \\( \\mathcal{C} \\) denote input, class label, and concept sets, respectively. CBMs get their name from an inherently bifurcated optimization process: While the concept encoder \\( g(x) \\) is trained to predict concepts \\( \\hat{c} \\in \\mathbb{R}^k \\) from the concept set with \\( \\| \\mathcal{C} \\| = k \\) concepts given an image \\( x \\in \\mathbb{R}^d \\), the classification head \\( f(\\cdot) \\) is optimized to predict final target labels \\( y \\in \\mathcal{Y} \\in \\mathbb{R}^M \\) solely based on concept assignments produces by \\( g \\). CBM training data is thus given as \\( \\mathcal{D} := \\{x^{(i)}, c^{(i)}, y^{(i)}\\}_{i=1}^N \\), where \\( x^{(i)}, c^{(i)}, y^{(i)} \\) are the inputs, ground-truth concepts, and ground-truth labels, respectively. Following existing works [9, 27-29], the concept encoder \\( g \\) is trained using a (weighted) binary cross-entropy loss \\( (\\mathcal{L}_{\\mathrm{concept}}(\\hat{c}, c)) \\), while the classification head \\( f \\) utilizes a cross-entropy classification objective \\( (\\mathcal{L}_{\\mathrm{task}}(\\hat{y}, y) = \\mathcal{L}_{\\mathrm{CE}}(\\hat{y}, y)) \\). Overall, there are three established schemes [9] for training CBMs: (1) Independent training: the concept encoder and classification head are trained entirely independently, with ground-truth concepts \\( c \\) provided as inputs to the classification head during training. (2) Sequential training: the concept encoder \\( g \\) is trained first, followed by the classification head \\( f \\) trained using the concepts predicted by \\( g \\). (3) Joint training: both the concept encoder \\( g \\) and the classification head \\( f \\) are trained together using a combination of \\( \\mathcal{L}_{\\mathrm{concept}} \\) and \\( \\mathcal{L}_{\\mathrm{task}} \\), respectively. In all cases, this means that the classification head leverages only information on concept (co-)occurrences to predict final class labels, making it easy to ground the final classification decision on interpretable concept assignments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.471, + 0.788, + 0.699 + ], + "angle": 0, + "content": "Concept Embedding Models. The flow of information in a CBM is bottlenecked by the set of user-defined concepts. This can potentially limit the processing capacity of the model, especially when the concepts do not contain all the information that is needed to perform the downstream task. To overcome this issue, [27] proposed Concept Embedding Models (CEMs) as a generalization of CBMs wherein every concept \\( i \\) is represented by a pair of high-dimensional vectors, \\( \\hat{\\mathbf{c}}_i^+ \\) and \\( \\hat{\\mathbf{c}}_i^- \\) (as opposed to scalar concepts in CBMs). These embeddings are generated by passing \\( x \\) through concept-specific networks \\( \\phi_i^+ \\) and \\( \\phi_i^- \\), and represent the concept being present and absent, respectively. The probability \\( \\hat{p}_i \\) of the concept \\( i \\) being in \\( x \\) is then simply computed by passing \\( \\hat{\\mathbf{c}}_i^+ \\) and \\( \\hat{\\mathbf{c}}_i^- \\) to a scoring function \\( s \\) as \\( \\hat{p}_i = s([\\hat{\\mathbf{c}}_i^+, \\hat{\\mathbf{c}}_i^-]) \\). Similarly, both embeddings can also be combined as \\( \\hat{\\mathbf{c}}_i = \\hat{p}_i \\hat{\\mathbf{c}}_i^+ + (1 - \\hat{p}_i) \\hat{\\mathbf{c}}_i^- \\) to parameterize a joint embedding for concept \\( i \\). The final concept embedding which represents the full image \\( x \\) and is passed to the classification head is then given as \\( \\hat{\\mathbf{c}} := [\\hat{\\mathbf{c}}_1, \\hat{\\mathbf{c}}_2, ..., \\hat{\\mathbf{c}}_k] \\). Notice the higher dimensionality, as we concatenate \\( k \\) concept-specific embeddings." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Concept Interventions. Both CBMs and CEMs allow users to intervene on concepts at test time. Concretely, starting from the concept predictions of the model, \\(\\hat{c}\\), the user sequentially intervenes on \\(T \\leq k\\) concepts. As a human expert has to both investigate concept predictions and compare against input data, interventions are difficult to parallelize, effectively equating concept intervention into a trajectory of \\(T\\) concept intervention steps [20] (see also Fig. 1 for intuition). Let \\(\\mathcal{S}_t\\) represent the set of concepts that have been intervened on up to time \\(t \\leq T\\). The corresponding concept embedding at time \\(t\\) is then given as \\(\\tilde{c}_t = \\{c_{\\mathcal{S}_t}, \\hat{c}_{\\backslash \\mathcal{S}_t}\\}\\), where \\(c_{\\mathcal{S}_t}\\) denotes the ground truth values of the intervened concepts," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.522, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Concept Realignment in CBMs" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.297 + ], + "angle": 0, + "content": "and \\(\\hat{c}_{\\backslash S_t}\\) are the model's predictions of non-intervened concepts. Intervening on concepts in this way updates the final prediction of the model from \\(\\hat{y}\\) to \\(\\tilde{y} = f(\\tilde{c})\\). In the case of a CEM, intervening on concept \\(i\\) to update its value from \\(\\hat{p}_i\\) to \\(p_i\\) changes its embedding from \\(\\hat{\\mathbf{c}}_i\\) to \\(\\tilde{\\mathbf{c}}_i = p_i\\hat{\\mathbf{c}}_i^+ +(1 - p_i)\\hat{\\mathbf{c}}_i^-\\). After each intervention \\(t\\), we use a concept intervention policy \\(\\pi (\\tilde{c}_t)\\) to decide which concept to intervene on next. While \\(\\pi\\) can simply suggest random concepts for intervention, it is often much better to leverage heuristics that rank concepts in the order of importance (by some measure). A commonly deployed policy is UCP [10, 20], which uses the uncertainty of concepts; selecting concepts with the highest uncertainty (concept predictions closest to 0.5)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.298, + 0.785, + 0.435 + ], + "angle": 0, + "content": "Intervention-aware CEMs. While test-time interventions typically improve performance, this is not always guaranteed. In fact, recent works have shown that concept interventions can in some cases even hurt the model's performance [20, 28]. [29] noted that this stems from the lack of training incentive for the model to perform well under intervention. To address this, they proposed Intervention-aware CEMs (IntCEMs), which introduce interventions during the training process to improve the model's receptiveness to interventions at test time, outperforming all existing methods in the intervention setting. In particular, they train a CEM to minimize the following objective:" + }, + { + "type": "equation", + "bbox": [ + 0.223, + 0.459, + 0.785, + 0.49 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {I n t C E M}} (x, c, y, \\mathcal {T}) = \\mathcal {L} _ {\\text {p r e d}} (x, c, y, \\hat {c}, \\tilde {c} _ {t}) + \\lambda_ {\\text {c o n c}} \\mathcal {L} _ {\\text {c o n c}} (\\hat {c}, c) + \\lambda_ {\\text {r o l l}} \\mathcal {L} _ {\\text {r o l l}} (x, c, y, \\mathcal {T}) \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.321, + 0.489, + 0.682, + 0.521 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {p r e d}} (x, c, y, \\tilde {c} _ {0}, \\kappa_ {t}) = \\frac {\\mathrm {C E} (f (\\hat {c} , y) + \\gamma^ {T} \\mathrm {C E} (f (\\tilde {c} _ {t}) , y)}{1 + \\gamma^ {T}}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.784, + 0.616 + ], + "angle": 0, + "content": "\\(\\mathcal{L}_{\\mathrm{pred}}\\) is the prediction loss for \\(y\\), \\(\\mathcal{L}_{\\mathrm{conc}}\\) the concept prediction loss, \\(\\mathcal{L}_{\\mathrm{roll}}\\) the rollout loss incentivizing the model to predict the most informative concept for intervention. \\(\\lambda_{\\mathrm{conc}}\\) and \\(\\lambda_{\\mathrm{roll}}\\) are user-defined weights corresponding to \\(\\mathcal{L}_{\\mathrm{conc}}\\) and \\(\\mathcal{L}_{\\mathrm{pred}}\\) respectively, while \\(\\mathcal{T}\\) denotes the intervention trajectory. \\(\\mathcal{L}_{\\mathrm{pred}}\\) penalizes the model for incorrect predictions both before and after the intervention, and \\(\\gamma \\geq 1\\) is a scaling term that prioritizes correct predictions after intervention." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.636, + 0.547, + 0.651 + ], + "angle": 0, + "content": "3.2 Concept Intervention Realignment" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.785, + 0.841 + ], + "angle": 0, + "content": "Previous works incrementally improve on predecessor methods by better parameterizing concept representations or introducing an intervention-aware training objective. However, all these works still treat concept interventions independently. This means that an intervention on one specific concept has no effect on the assignment of other concepts. This disregards relationships between concepts, which in practice do not occur independently (e.g., \"white wing\" and \"white belly\" are more likely to co-occur). As a result, the existing intervention process does not utilize human feedback optimally, as information about the verified existence of one concept should naturally guide the prediction of other concepts. While this aspect is naturally important to ensure that an accurate concept representation is passed to the label classifier, it is also crucial when utilizing concept-selection criteria such as UCP because intervening on one concept" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.395, + 0.128 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.144, + 0.761, + 0.273 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.282, + 0.789, + 0.409 + ], + "angle": 0, + "content": "Fig. 2: Illustration of the concept intervention realignment module. Given the concept encoding \\( g(x) \\), we intervene on the concept \\( i \\) selected by a concept selection policy \\( \\pi \\). This concept is replaced with a ground-truth (GT) value \\( (\\in \\{0,1\\} \\) depending on whether it is present in a given image or not) to obtain \\( \\tilde{c}_t \\) (representing intervention step \\( t \\in \\{1,\\dots,T\\} \\)). This intervened concept representation is then passed into the concept realignment module (leveraging e.g. an MLP or LSTM reweighting mode), which outputs the realigned \\( u(\\tilde{c}_t) \\). To ensure that the ground-truth values provided by the user are not overwritten during realignment, \\( u(\\tilde{c}_t) \\) retains ground-truth corrections. The final concept vector is then based into a concept-based classifier \\( f \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.784, + 0.473 + ], + "angle": 0, + "content": "should consequently reduce the chances of intervening on other closely related, likely co-occurring concepts, while also raising the probability that uncertain and unrelated concepts get intervened on." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.789, + 0.702 + ], + "angle": 0, + "content": "Intervention Realignment Module. To address this, we propose a concept intervention realignment module (CIRM), which consists of two interdependent components: (a) a concept realignment model (CRM), \\( u: \\mathcal{C} \\to \\mathcal{C} \\). After a user intervenes on a subset of concepts \\( S \\), the remaining concepts (\\(\\backslash S\\)) are updated by a realigner network; and (b) an intervention policy \\( \\pi \\). The concepts predicted by the realignment model are fed to the policy to suggest which concept to intervene on next. Both components are interdependent, and together form the overall concept intervention realignment module, as also visualized in Figure 2. The training of the full CIRM comprising both selection policy and concept realignment model aims to simulate the complete intervention process. It thus starts from the concept predictions of the base model, \\( \\hat{c} \\), where we sequentially intervene on concepts for \\( T \\leq k \\) time steps by following a policy of choice, \\( \\pi \\) (in our case UCP by default, which we experimentally find to outperform random intervention significantly; See supp. §B)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.789, + 0.795 + ], + "angle": 0, + "content": "As in §3.1, let \\( S_{t} \\) denote the set of intervened concepts and \\( \\tilde{c}_{t} = \\{c_{S_{t}},\\hat{c}_{\\setminus S_{t}}\\} \\) denote the concepts at time \\( t \\), respectively. At every intervention time step, we feed \\( \\tilde{c}_{t} \\) to the realignment model to obtain updated concept predictions as \\( \\kappa_{t} = u(\\tilde{c}_{t}) \\), which in turn are utilized by \\( \\pi (\\kappa_{t}) \\) to produce intervention recommendations for \\( t + 1 \\). Finally, we train \\( u \\) with the ground-truth labels as targets using the loss \\( \\mathcal{L}(u) = (\\sum_{t = 0}^{T}\\mathrm{CE}(u(\\tilde{c}_{t}),c)) / T \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Using this simple objective, the concept realignment model \\( u \\) learns to take concept representations and leverage intervened concepts \\( S_{t} \\) to predict an updated concept distribution, i.e., \\( p(i; \\hat{c}, S_{t}) \\). Note that this training objective uti" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.522, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Concept Realignment in CBMs" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "izes standard CBM training information (i.e., concept annotations, [9, 20, 27-29]); so no additional information beyond the standard CBM pipeline is required." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.785, + 0.283 + ], + "angle": 0, + "content": "The overall training pipeline can still follow the standard CBM training paradigms (see previous section), with the intervention realignment module being trained independently on top of a pre-trained frozen CBM/CEM as a posthoc realignment method, or jointly with the CBM/CEM to introduce an explicit realignment objective during training. For posthoc realignment, we first train the backbone \\( f \\) and the classification head \\( g \\). Subsequently, we freeze those components and train the realignment model \\( u \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.305, + 0.784, + 0.395 + ], + "angle": 0, + "content": "Realignment Models. As shown in Fig. 2, we parameterize our concept realignment model with a neural network \\( v \\). To ensure that \\( u \\) does not overwrite the ground-truth concepts provided by the user, we also keep track of the already intervened concepts \\( S_{t} \\). Using this information, we replace the output of the realigned concept embedding with the user-provided values for concepts in \\( S_{t} \\). Hence, the final output of \\( u \\) for the \\( i^{th} \\) concept is given as" + }, + { + "type": "equation", + "bbox": [ + 0.351, + 0.408, + 0.785, + 0.429 + ], + "angle": 0, + "content": "\\[\nu \\left(\\tilde {c} _ {t}, \\mathcal {S} _ {t}\\right) ^ {(i)} = v \\left(\\tilde {c} _ {t}\\right) ^ {(i)} \\quad \\text {i f} i \\notin \\mathcal {S} _ {t} \\text {e l s e} \\quad \\tilde {c} _ {t} ^ {(i)} \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.788, + 0.714 + ], + "angle": 0, + "content": "Depending on the assumptions made on the realignment process, \\( v \\) is either a simple MLP or a recurrent model (such as an LSTM [7]). The former parametrizes our default concept intervention realignment model, which only passes the set of intervened and un-intervened concepts at intervention step \\( t \\) to the concept realignment model consisting of a simple MLP. The set of concepts fed into the MLP may either be the original concept embedding \\( \\tilde{c}_0 \\), where all intervened concepts up to and including step \\( t \\) have been replaced with ground-truth values, or the previously realigned \\( \\kappa_{t-1} \\) with similarly updated intervened concepts (c.f. Fig. 2, \"GT\"). Note that in either case, \\( \\kappa_{t-1} \\) informs the selection process of the subsequent concept to intervene on. After all interventions, the final concept embedding fed into the classifier is always \\( u(\\tilde{c}_T) \\). Practically, we found using \\( \\tilde{c}_t \\) to work slightly better than \\( \\kappa_{t-1} \\). Both cases above however only pass the final set of concepts at time \\( t \\) to the realignment model. Given the sequential nature of interventions, however, it may also be beneficial to account for the entire intervention history to inform future concept realignment. As a result, we also introduce a recurrent realignment variant, \\( u_{\\mathrm{rec}} \\), which employs an LSTM model to retain the entire history of interventions until time \\( t \\). An algorithmic summary is provided in supplementary §A." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.733, + 0.784, + 0.809 + ], + "angle": 0, + "content": "End-to-End Realignment. In order to jointly train the CIR module and the base model \\( f \\circ g \\), we will perform interventions while also training the base model. This naturally combines with the IntCEM framework [29], which incorporates train-time interventions, and as such is our default choice for joint model and realignment module training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Concretely, we modify IntCEMs such that after \\(t\\) interventions, concepts \\(\\tilde{c}_t\\) are corrected post-intervention to obtain \\(\\kappa_t = u(\\tilde{c}_t)\\), which is then fed to the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.395, + 0.129 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.566, + 0.163 + ], + "angle": 0, + "content": "classifier \\(f\\). The new training objective, then, is:" + }, + { + "type": "equation", + "bbox": [ + 0.217, + 0.175, + 0.803, + 0.206 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {I n t C E M - R e A}} (x, c, y, \\mathcal {T}) = \\mathcal {L} _ {\\text {p r e d}} (x, c, y, \\tilde {c} _ {0}, \\kappa_ {t}) + \\lambda_ {\\text {c o n c}} \\mathcal {L} _ {\\text {c o n c - R e A}} (\\hat {c}, c, \\kappa_ {0}, \\kappa_ {t}) + \\lambda_ {\\text {r o l l}} \\mathcal {L} _ {\\text {r o l l}} \\tag {3}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.26, + 0.216, + 0.786, + 0.251 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {c o n c - R e A}} (\\hat {c}, c, \\kappa_ {0}, \\kappa_ {t}) = \\frac {1}{2} \\left(\\mathcal {L} _ {\\text {c o n c}} (\\hat {c}, c) + \\frac {\\mathrm {C E} (\\kappa_ {0} , c) + \\gamma^ {T} \\mathrm {C E} (\\kappa_ {T} , c)}{1 + \\gamma^ {T}}\\right) \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.256, + 0.787, + 0.318 + ], + "angle": 0, + "content": "where \\(\\mathcal{L}_{\\mathrm{conc - ReA}}\\) is the modified concept prediction loss which trains both the backbone \\(g\\) of the base model (first term) as well as the CRM (second term). We use the same \\(\\gamma\\) as in \\(\\mathcal{L}_{\\mathrm{pred}}\\) to prioritize correct predictions by the CRM after intervention, and the same \\(\\lambda_{\\mathrm{conc}}\\) and \\(\\lambda_{\\mathrm{roll}}\\) as in Eq. 1." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.34, + 0.376, + 0.358 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.373, + 0.373, + 0.387 + ], + "angle": 0, + "content": "4.1 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.398, + 0.788, + 0.747 + ], + "angle": 0, + "content": "Datasets & Implementation. We perform experiments on three datasets: (1) Caltech-UCSD Birds-200-2011 (CUB) [22] containing \\( n = 11,788 \\) bird images over 200 classes. Following the original CBM paper [9], we use 112 concepts grouped into 28 concept groups with the same splits. (2) Large-scale CelebFaces Attributes (CelebA) [11] contains over 200,000 celebrity images annotated with 40 attribute labels, including noisy characteristics such as gender and age. Following [27, 29], we use only the most balanced 8 concepts in our experiments, resulting in \\( 2^8 = 256 \\) classes. (3) Animals with Attributes 2 (AwA2) [23] is a collection of \\( n = 37,322 \\) animal images over 50 classes annotated with 85 attributes such as species, color, and behavior. We perform experiments on CEMs, IntCEMs, and three types of CBMs (sequential, independent, and joint). For all models and datasets, we follow the hyperparameters used in [29]. During CIRM training, we sequentially intervene on concepts \\( T = k \\) times. By default, we use UCP both during training and inference, and if not stated otherwise, use a multi-layered perceptron (MLP) for concept realignment. We use the predictions of the base CBM \\( (\\tilde{c}_t) \\) as its input for un-intervened concept representations. We perform a small, standard hyperparameter using Optuna [1] with 50 trials to search over the number of hidden layers \\( \\in \\{1,2,3\\} \\) and units \\( \\in \\{k,2k,k/2\\} \\), the learning rate \\( \\in [10^{-5},10^{-1}] \\) and weight decay \\( \\in [10^{-6},5\\times 10^{-5}] \\), and use the same batch size as used to train the base model. We employ early stopping and learning rate decay on the validation loss. For joint training, we instantiate the realigner MLP 2 hidden layers containing \\( k \\) neurons each. Experiments are conducted using PyTorch [16]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.769, + 0.699, + 0.785 + ], + "angle": 0, + "content": "4.2 Concept Realignment Improves Intervention Efficacy" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "To probe the efficacy of our concept intervention realignment module, we evaluate both the change in concept prediction loss as well as overall classification accuracy as a function of intervened concept counts. These are visualized in Fig. 3" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.522, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Concept Realignment in CBMs" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.145, + 0.402, + 0.258 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.406, + 0.145, + 0.588, + 0.258 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.591, + 0.145, + 0.782, + 0.258 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.265, + 0.785, + 0.294 + ], + "angle": 0, + "content": "Fig. 3: Concept prediction loss vs. the number of intervened concepts with and without concept realignment. Concept realignment consistently improves concept predictions." + }, + { + "type": "image", + "bbox": [ + 0.236, + 0.3, + 0.408, + 0.407 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.413, + 0.301, + 0.584, + 0.407 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.587, + 0.302, + 0.761, + 0.407 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.415, + 0.785, + 0.444 + ], + "angle": 0, + "content": "Fig. 4: Classification accuracy vs. the number of intervened concepts with and without concept realignment. Realignment consistently improves classification accuracy." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.465, + 0.788, + 0.618 + ], + "angle": 0, + "content": "and Fig. 4 for sequentially trained CBMs (see §3.1), respectively, for all benchmark test sets - CUB, CelebA and AwA2. Note that for AwA2, we only show the first 50 interventions for visual clarity, as performance beyond that heavily plateaus since sufficient concepts have been intervened on to perfectly solve the test data. Table 1 numerically summarizes these results via AUC scores and provides additional scores for independently trained CBMs, jointly trained CBMs as well as Concept Embedding Models (CEMs). Runs in Tab. 1 & Figs. 3, 4 all utilize the stronger UCP selection policy as opposed to the weaker random selection policy (\\$B) to measure intervention efficacy at the highest level, and train the concept realignment module on top of already trained concept models." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.644, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Improved concept attribution through intervention. Across all datasets, we can observe a consistent, in parts vast reduction in concept prediction loss, which measures the correct assignment of concepts for each input (using the concept loss described in §3.1). For example on CUB, a tenfold reduction of the original unintervened concept loss (\\(\\sim 0.6\\) to \\(\\sim 0.06\\)) can be achieved with half the number of interventions (11 with concept realignment, 23 without). This effect becomes even more prevalent on AwA2, where a tenfold reduction (\\(\\sim 0.17 \\rightarrow \\sim 0.017\\)) is achieved after around 16 interventions with realignment versus more than 60 without; marking a more than \\(70\\%\\) reduction in intervention efforts. This is also reflected in Tab. 1, where concept loss AUC drops by in parts more than half for CUB and from 4.26 to 1.13 on AwA2. We find this significant improvement in concept attribution persists across all CBMs and CEMs, as well as random seed initializations (see Supp. Tab. 2 and 3)" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.393, + 0.129 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Area Under Curve (AUC) of Concept Prediction Loss and Classification Accuracy with/without CIRM (non-averaged sum). We use the same backbone throughout. CIRM improves performance across all models and datasets. Intervention curves share long saturation plateaus for high intervention counts. Accuracy AUC scores are thus saturated, and best combined with performance graphs in Figs. 3, 4." + }, + { + "type": "table", + "bbox": [ + 0.265, + 0.221, + 0.72, + 0.35 + ], + "angle": 0, + "content": "
Base ModelRealignedConcept LossAUC ↓Accuracy AUC ↑
CUBCelebAAwA2CUBCelebAAwA2
Sequential CBM×6.711.594.262460.8280.78364.0
✓3.151.521.132510.9284.38397.6
Independent CBM×6.711.594.262653.4280.28403.4
✓3.151.521.132678.3282.18437.0
Joint CBM×5.933.064.772580.3273.18276.4
✓3.671.761.482609.0273.98327.4
CEM×5.991.614.902521.4396.38429.3
✓3.201.461.692558.4400.18433.9
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.368, + 0.788, + 0.549 + ], + "angle": 0, + "content": "We do find that for CelebA with a much more restrictive concept bottleneck than e.g. CUB and AwA2, due to significantly fewer (note that in CUB concepts are already grouped, see §4.1) and noisier concepts, that the overall gain in concept accuracy is smaller. This is also reflected in the notably weaker performance of the base CBM (c.f. Fig. 4, middle - less than \\(38\\%\\) accuracy when intervening on all concepts), which strongly points towards overall insufficient concept information provided in the CelebA training data. Overall, however, we find very clear evidence that the concept intervention realignment module allows practitioners to leverage human intervention feedback to a much larger extent to attribute the correct concepts to respective inputs. This means that the subsequent classifier will operate on a much more accurate set of concepts, thereby improving the overall interpretability of the final classification decision." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Improved overall classification through intervention. On top of that, we also find that the significant gain in intervention efficacy on a concept attribution level also translates to subsequent gains in intervention efficacy for the overall classification performance (Fig. 4). For example on CUB, the final classification accuracy after intervening on all concepts is \\(93.9\\%\\), which is achieved already after \\(\\sim 16\\) intervention steps. A comparable performance without concept intervention realignment requires nearly complete, \\(\\sim 24\\) intervention steps, marking a \\(50\\%\\) increase. The same can be seen on CelebA and AwA2 as well, where the upper-bound performance can be achieved with much fewer interventions (particularly without the need to intervene on all concepts). Even intermediate performance targets are achieved much earlier; a classification accuracy target of e.g. \\(98\\%\\) on AwA2 requires only 12 concept interventions with realignment, while the non-aligned baseline needs 19 interventions on average. We find these results to be also reflected numerically in Tab 1, where accuracy AUC increases from e.g. 2460.8 to 2510.9 on CUB. We do point towards high numerical saturation given the larger performance plateaus at higher intervention counts, and high starting accuracies (e.g. \\(\\sim 90\\%\\) on AwA2). Numerical results are thus best considered alongside the intervention trajectories in Figs. 3 and 4." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.523, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Concept Realignment in CBMs" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.298, + 0.145, + 0.496, + 0.267 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.387, + 0.271, + 0.406, + 0.283 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.145, + 0.701, + 0.268 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.591, + 0.271, + 0.612, + 0.283 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.288, + 0.785, + 0.345 + ], + "angle": 0, + "content": "Fig. 5: Concept Intervention Realignment in intervention-aware CEMs. (a) Concept prediction loss and (b) classification accuracy with jointly and post-hoc trained CIRMs. In both cases, significant benefits can be seen, especially for correct concept attribution after intervention - both for jointly and posthoc trained realignment modules." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.363, + 0.785, + 0.44 + ], + "angle": 0, + "content": "Together, our experiments provide strong evidence that concept intervention realignment is crucial to best leverage human feedback in concept-based decision systems; allowing to significantly reduce intervention budgets by in parts over \\(70\\%\\) to achieve a desired target performance. These gains can also be achieved after concept models have been trained, allowing for versatile applicability." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.464, + 0.72, + 0.48 + ], + "angle": 0, + "content": "4.3 Intervention Realignment for Intervention-aware CEMs" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.785, + 0.568 + ], + "angle": 0, + "content": "In this section, we investigate training the CIRM during the training process of an already intervention-regularized concept model; namely the recently proposed, state-of-the-art intervention-aware CEM [29] (see also §3.1). Following the objective described in Eq. 3, we operate and train the concept intervention module in conjunction with the intervention objective proposed by [29]." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.569, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Our results are shown in Fig. 5. First, we find that explicit concept intervention realignment can significantly improve correct concept attribution, even in intervention-aware training setups (c.f. Fig. 5a). While not as significant as improvements over standard CBM models, for specific target concept prediction losses (such as a fivefold reduction from 0.5 to 0.1), half the number of intervention steps are needed (11 versus 20). The improved concept attribution is also reflected in higher intervention accuracies as seen in Fig. 5b, albeit the overall (still notable!) improvement is less reflective of the significant gains on a concept level (additional results can be found in supp. §C). Overall, however, our experiments highlight that even when applied to state-of-the-art approaches that specifically simulate the intervention process during training, improved intervention efficacy can be found. Importantly, the consistently significant improvements on a concept attribution level mean that classification decisions are much better grounded on correct concept attributions, which is crucial for interpretability [9, 27] of classification results. Finally, we find that concept intervention realignment can be applied both as a regularization mechanism during training, as well as adapted entirely posthoc, while still offering consistent benefits. This supports the high versatility of CIRMs as a general-purpose tool to increase intervention efficacy." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.395, + 0.129 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "image", + "bbox": [ + 0.299, + 0.146, + 0.498, + 0.265 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.388, + 0.269, + 0.408, + 0.281 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.145, + 0.7, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.591, + 0.269, + 0.612, + 0.28 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.283, + 0.788, + 0.34 + ], + "angle": 0, + "content": "Fig. 6: (a) Concept prediction loss and (b) classification accuracy for various realigner architectures alongside UCP policy. Using an MLP with concept predictions of the base model works better than compounding refinements and accounting for intervention trajectories using LSTMs." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.358, + 0.521, + 0.373 + ], + "angle": 0, + "content": "4.4 Realignment Module Ablations" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.385, + 0.789, + 0.657 + ], + "angle": 0, + "content": "**Realignment Model Architectures.** In this section, we study the effect of various design choices for the realignment module along two dimensions: (1) Recurrent vs. Feedforward Networks: Since we intervene on concepts sequentially, it is possible that the realignment module can benefit from the overall order and history of interventions to make more accurate concept predictions. To do this, we instantiate the concept realignment network using an LSTM [7]. We compare this against our default MLP. (2) Previous Output vs. Original Concepts: By default, the realignment module takes as input a combination of ground-truth concepts provided by the user and values predicted by the base model at \\( t = 0 \\) for the concepts that have not been intervened on (see also §3.2). Due to the sequential nature of interventions, one may also directly feed the output of the realignment module at time \\( t - 1 \\) as input to it at time \\( t \\) in order to compound the refinements over multiple time steps. Combining both axes results in four recombinations, which we compare in Fig. 6. As can be seen, there is limited gain when accounting for the complete intervention history using an LSTM realigner network. Similarly, we find that applying the MLP primarily for concept selection alongside UCP and as final input to the classification head works better than compounding refinements over intervention steps." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Intervention Policy Transfer. In this section, we study the importance of aligning intervention policies used during training with those deployed at test time. In particular, we operate on the base setup, which deploys the CBM and the concept intervention realignment module using only the much weaker random intervention policy at test time. However, we change the policy used to train the concept intervention realignment module. Our results are visualized in Fig. 7. As can be seen, while a realignment module trained with UCP can still be effective when deployed with a random intervention policy, it is notably outperformed by the weaker random policy at test-time when the realignment module has been trained on the same random policy as well. This means that the realignment module adapts to the selection policy used during training. Thus to get the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.523, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Concept Realignment in CBMs" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.297, + 0.145, + 0.498, + 0.265 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.145, + 0.702, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.272, + 0.785, + 0.314 + ], + "angle": 0, + "content": "Fig. 7: Concept prediction loss and classification accuracy under random interventions for realignment modules trained with random and UCP policy, respectively. Results indicate that alignment of policy used during training and deployment is important." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.33, + 0.784, + 0.361 + ], + "angle": 0, + "content": "most benefits out of concept intervention realignment, selection policies should align during training and deployment." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.374, + 0.545, + 0.599 + ], + "angle": 0, + "content": "Alignment \\(b / w\\) Realignment Module Components. Finally, we study how important the alignment between the concept realignment model and intervention policy (i.e., UCP) is to form the overall concept intervention realignment module. To accomplish this, we employ two module variations: (a) an original policy denoted as \\(\\pi (\\hat{c}_0)\\), which only applies the UCP criterion to the original concept predictions generated by the base model without any concept realignment (i.e., the policy does not change over time), and (b) our default setup (updated policy), which informs the intervention policy using realigned concept values \\((\\pi (\\kappa_{t}))\\). Note that in both cases, the clas" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.601, + 0.785, + 0.69 + ], + "angle": 0, + "content": "sification head still receives realigned concept embeddings, as we only want to study the importance of alignment between the concept realignment model and the intervention policy. Results in Fig. 8 clearly reveal that while simple realignment on its own can already help improve intervention efficacy, much larger efficacy gains are unlocked when both policy and the realignment model are utilized in conjunction." + }, + { + "type": "image", + "bbox": [ + 0.557, + 0.383, + 0.784, + 0.526 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.554, + 0.535, + 0.788, + 0.59 + ], + "angle": 0, + "content": "Fig. 8: Classification accuracy vs concept interv. counts, showing our updated selection policies improving over the static one." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.84 + ], + "angle": 0, + "content": "A Closer Look at Concept Realignment. To understand the impact of the realignment process qualitatively, we also provide examples in Fig. 9. In this figure, we showcase the impact of interventions on the top 10 concepts with the highest prediction errors, and the specific number of interventions required to predict the correct label. For both examples, we find that intervention on a single concept is insufficient to flip incorrect class predictions. However, as we intervene on more concepts, we can clearly see that concept realignment jointly allows concept prediction error - even on the initially worst predicted concepts - to be significantly reduced, while also reaching correct image classification with" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.395, + 0.129 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.782, + 0.337 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.345, + 0.788, + 0.416 + ], + "angle": 0, + "content": "Fig. 9: Examples for the improved intervention efficiency of CIRM. We show the change in concept prediction errors of the ten worst predicted concepts, as a function of concept intervention steps \\( t \\): concept realignment allows concept error even for strongly mispredicted concepts to be significantly reduced with interventions, achieving correct label classification after much fewer interventions compared to non-realigned baselines." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.429, + 0.788, + 0.475 + ], + "angle": 0, + "content": "in parts less than half the number of interventions (for Crested Auklet). These results conceptually support the quantitative benefits of concept realignment seen in previous benchmark experiments." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.493, + 0.36, + 0.51 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.789, + 0.688 + ], + "angle": 0, + "content": "In this work, we identify the independent treatment of concepts during test-time interventions in CBMs as a cause for reduced intervention efficacy. To remedy this problem, we propose a concept intervention realignment module - a simple and lightweight technique to automatically update concept assignments after human intervention on one or multiple concepts. Our experiments demonstrate significant gains in concept attribution as well as overall classification accuracy of concept-based models under intervention. We show that our approach is versatile and can be applied to a wide range of concept-based models, intervention policies, and training schemes. We believe that the reduction in required human interventions to reach performance targets facilitates the practical deployment of concept-based models even in resource-constrained environments." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.707, + 0.405, + 0.725 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Karsten Roth and Jae Myung Kim thank the European Laboratory for Learning and Intelligent Systems (ELLIS) PhD program and the International Max Planck Research School for Intelligent Systems (IMPRS-IS) for support. This work was supported by DFG project number 276693517, by BMBF FKZ: 01IS18039A, by the ERC (853489 - DEXIM), by EXC number 2064/1 - project number 390727645. The authors would like to thank Shyamgopal Karthik and Leander Gerrbach for their helpful feedback on the manuscript." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.522, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Concept Realignment in CBMs" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.324, + 0.161 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.176, + 0.786, + 0.232 + ], + "angle": 0, + "content": "1. Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: A next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. pp. 2623-2631 (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.233, + 0.786, + 0.273 + ], + "angle": 0, + "content": "2. Alvarez Melis, D., Jaakkola, T.: Towards robust interpretability with self-explaining neural networks. Advances in neural information processing systems 31 (2018) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.786, + 0.315 + ], + "angle": 0, + "content": "3. Chauhan, K., Tiwari, R., Freyberg, J., Shenoy, P., Dvijotham, K.: Interactive concept bottleneck models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 5948-5955 (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.316, + 0.786, + 0.37 + ], + "angle": 0, + "content": "4. Durán, J.M., Jongsma, K.R.: Who is afraid of black box algorithms? on the epistemological and ethical basis of trust in medical ai. Journal of Medical Ethics 47(5), 329-335 (2021). https://doi.org/10.1136/medethics-2020-106820, https://jme.bmj.com/content/47/5/329 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.371, + 0.652, + 0.384 + ], + "angle": 0, + "content": "5. EUGDPR: Gdpr. general data protection regulation (2017) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.385, + 0.786, + 0.425 + ], + "angle": 0, + "content": "6. Havasi, M., Parbhoo, S., Doshi-Velez, F.: Addressing leakage in concept bottle-neck models. Advances in Neural Information Processing Systems 35, 23386-23397 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.786, + 0.453 + ], + "angle": 0, + "content": "7. Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural computation 9(8), 1735-1780 (1997) 7, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.454, + 0.786, + 0.522 + ], + "angle": 0, + "content": "8. Kim, E., Jung, D., Park, S., Kim, S., Yoon, S.: Probabilistic concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 16521-16540. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/kim23g.html 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.523, + 0.786, + 0.564 + ], + "angle": 0, + "content": "9. Koh, P.W., Nguyen, T., Tang, Y.S., Mussmann, S., Pierson, E., Kim, B., Liang, P.: Concept bottleneck models. In: International conference on machine learning. pp. 5338-5348. PMLR (2020) 1, 2, 3, 4, 7, 8, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.565, + 0.786, + 0.592 + ], + "angle": 0, + "content": "0. Lewis, D.D., Catlett, J.: Heterogeneous uncertainty sampling for supervised learning. In: Machine learning proceedings 1994, pp. 148-156. Elsevier (1994) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.593, + 0.786, + 0.632 + ], + "angle": 0, + "content": "1. Liu, Z., Luo, P., Wang, X., Tang, X.: Deep learning face attributes in the wild. In: Proceedings of the IEEE international conference on computer vision. pp. 3730-3738 (2015) 3, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.633, + 0.786, + 0.661 + ], + "angle": 0, + "content": "2. Mahinpei, A., Clark, J., Lage, I., Doshi-Velez, F., Pan, W.: Promises and pitfalls of black-box concept learning models. arXiv preprint arXiv:2106.13314 (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.786, + 0.702 + ], + "angle": 0, + "content": "3. Marconato, E., Passerini, A., Teso, S.: Glancenets: Interpretable, leak-proof concept-based models. Advances in Neural Information Processing Systems 35, 21212-21227 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.702, + 0.786, + 0.742 + ], + "angle": 0, + "content": "4. Margeloiu, A., Ashman, M., Bhatt, U., Chen, Y., Jamnik, M., Weller, A.: Do concept bottleneck models learn as intended? arXiv preprint arXiv:2105.04289 (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.743, + 0.786, + 0.785 + ], + "angle": 0, + "content": "5. Oikarinen, T., Das, S., Nguyen, L.M., Weng, T.W.: Label-free concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.786, + 0.84 + ], + "angle": 0, + "content": "6. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., Kopf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., Fang, L., Bai, J., Chintala, S.: Pytorch: An imperative style, high-performance deep learning library. In: Advances" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.176, + 0.786, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.393, + 0.128 + ], + "angle": 0, + "content": "Singhi et al., 2024" + }, + { + "type": "ref_text", + "bbox": [ + 0.245, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "in Neural Information Processing Systems 32, pp. 8024-8035. Curran Associates, Inc. (2019), http://papers.neurips.cc/paper/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.243 + ], + "angle": 0, + "content": "17. Piano, S.L.: Ethical principles in machine learning and artificial intelligence: cases from the field and possible ways forward. Palgrave Communications 7(1), 1-7 (2020), https://EconPapers.repec.org/RePEc:pal:palcom:v:7:y:2020:i:1:d:10.1057_s41599-020-0501-9_1" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.246, + 0.786, + 0.272 + ], + "angle": 0, + "content": "18. Sawada, Y., Nakamura, K.: Concept bottleneck model with additional unsupervised concepts. IEEE Access 10, 41758-41765 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.273, + 0.786, + 0.314 + ], + "angle": 0, + "content": "19. Sheth, I., Rahman, A.A., Sevyeri, L.R., Havaei, M., Kahou, S.E.: Learning from uncertain concepts via test time interventions. In: Workshop on Trustworthy and Socially Responsible Machine Learning, NeurIPS 2022 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.787, + 0.396 + ], + "angle": 0, + "content": "20. Shin, S., Jo, Y., Ahn, S., Lee, N.: A closer look at the intervention procedure of concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 31504-31520. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/ shin23a.html 2, 3, 4, 5, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.786, + 0.424 + ], + "angle": 0, + "content": "21. Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: Automated decisions and the gdpr (2018) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.786, + 0.452 + ], + "angle": 0, + "content": "22. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) 2, 3, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.786, + 0.493 + ], + "angle": 0, + "content": "23. Xian, Y., Lampert, C.H., Schiele, B., Akata, Z.: Zero-shot learning—a comprehensive evaluation of the good, the bad and the ugly. IEEE transactions on pattern analysis and machine intelligence 41(9), 2251-2265 (2018) 3, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.494, + 0.786, + 0.522 + ], + "angle": 0, + "content": "24. Xu, X., Qin, Y., Mi, L., Wang, H., Li, X.: Energy-based concept bottleneck models. In: The Twelfth International Conference on Learning Representations (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.786, + 0.577 + ], + "angle": 0, + "content": "25. Yang, Y., Panagopoulou, A., Zhou, S., Jin, D., Callison-Burch, C., Yatskar, M.: Language in a bottle: Language model guided concept bottlenecks for interpretable image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19187-19197 (2023) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.786, + 0.604 + ], + "angle": 0, + "content": "26. Yuksekgonul, M., Wang, M., Zou, J.: Post-hoc concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.605, + 0.786, + 0.646 + ], + "angle": 0, + "content": "27. Zarlenga, M.E., Barbiero, P., Ciravegna, G., Marra, G., Giannini, F., Diligenti, M., Shams, Z., Precioso, F., Melacci, S., Weller, A., et al.: Concept embedding models. arXiv preprint arXiv:2209.09056 (2022) 1, 2, 3, 4, 7, 8, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.786, + 0.687 + ], + "angle": 0, + "content": "28. Zarlenga, M.E., Barbiero, P., Shams, Z., Kazhdan, D., Bhatt, U., Weller, A., Jamnik, M.: Towards robust metrics for concept representation evaluation. arXiv preprint arXiv:2301.10367 (2023) 4, 5, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.688, + 0.786, + 0.742 + ], + "angle": 0, + "content": "29. Zarlenga, M.E., Collins, K.M., Dvijotham, K.D., Weller, A., Shams, Z., Jamnik, M.: Learning to receive help: Intervention-aware concept embedding models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023) 1, 2, 3, 4, 5, 7, 8, 11" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.787, + 0.742 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_origin.pdf b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8d5d54a2439863b3ae5592a9301c6709e51886c4 --- /dev/null +++ b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/b87f9961-1363-42af-af3c-357c0eb68823_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:299f0de6540368e33ddefdb24affd6d94bc48c7e721b2c41379b5f3d4f3dea9c +size 2057204 diff --git a/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/full.md b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/full.md new file mode 100644 index 0000000000000000000000000000000000000000..10d022c8c1f00b52cce2bc8084399e64ec05799d --- /dev/null +++ b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/full.md @@ -0,0 +1,224 @@ +# Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models + +Nishad Singhi1 Jae Myung Kim1 Karsten Roth1 Zeynep Akata2 + +Primary contact: nishadsinghi@gmail.com + +$^{1}$ Tübingen AI Center, University of Tübingen $^{2}$ Helmholtz München, TU München + +Abstract. Concept Bottleneck Models (CBMs) ground image classification on human-understandable concepts to allow for interpretable model decisions as well as human interventions, in which expert users can modify misaligned concept choices to interpretably influence the decision of the model. However, existing approaches often require numerous human interventions per image to achieve strong performances, posing practical challenges in scenarios where obtaining human feedback is expensive. In this paper, we find that this is driven by an independent treatment of concepts during intervention, wherein a change of one concept does not influence the use of other ones. To address this issue, we introduce a trainable concept intervention realignment module, which leverages concept relations to realign concept assignments post-intervention. Across standard benchmarks, we find that concept realignment significantly improves intervention efficacy and reduces the number of interventions needed to reach a target classification performance or concept prediction accuracy. Moreover, it easily integrates into existing concept-based architectures without requiring changes to the models themselves. This reduced cost of human-model collaboration is crucial to enhance the feasibility of CBMs in resource-constrained environments. Our code is available at https://github.com/ExplainableML/concept_realignment. + +Keywords: Concept Bottlenecks $\cdot$ Trustworthiness $\cdot$ Interventions + +# 1 Introduction + +Despite tremendous progress of Deep Learning (DL) techniques in research and applications, their adoption to high-stakes scenarios has been limited [9, 27, 29]. This is in large part due to unpredictable failure cases of deep models when transferring to unseen data or complex & ambiguous cases. The black-box nature of typical DL models further exacerbates this problem, as it makes understanding and debugging the decision-making process of these models difficult. Consequently, it becomes hard for human practitioners to trustworthily operate these models in scenarios with significant legal [5, 21] or ethical [4, 17] constraints. To foster trust, transparency in the decision-making process, and the ability to operate alongside expert feedback are required. In order to incorporate these desiderata into the design space of deep models, Koh et al. [9] introduced Concept Bottleneck Models (CBMs). These models break the decision process into + +![](images/d206da68c11f2103f21a215344c770850d762dd2727cb855dbbe970a6cc41e27.jpg) +Fig. 1: Concept-based classification models allow for human intervention, where a human expert can correct specifically assigned concepts. However, to achieve satisfactory performance, concept-based classification models often require a large number of interventions, where each additional intervention requires costly human interaction. + +the extraction of human-interpretable concepts (such as "white wings" and "orange beak" when classifying a seagull) from a given input, and a subsequent concept-grounded classifier operating on top of these concept predictions. While this allows users to peek into the model decision process - maybe even more importantly, it also uniquely allows for human-guided intervention and feedback integration at test time. This is done through concept interventions, wherein an expert user analyses predicted concepts and optionally replaces those they deem incorrect with ground-truth information (Fig. 1). Such interventions can significantly raise the performance and reliability of these models [9,20,27,29], while offering a natural interface for human-AI collaboration. However, human annotation is expensive, especially when resources and access to expert knowledge are limited. Ideally, such concept models should operate well with minimal human input. This becomes particularly prevalent as CBMs (as well as follow-up extensions such as Concept Embedding Models (CEMs, [27])) often require numerous interventions in order to significantly boost model performance [9,27,29], as the set of concepts these models operate on can often be rather extensive. For example, on the widely used CUB benchmark (bird classification, [22]), it takes 13 interventions per image on average to raise the accuracy of a baseline CBM model from around $68\%$ to $90\%$ (Fig. 4). In this work, we posit that a large part of this limited intervention efficacy can be traced back to the independent nature of how concept interventions are treated. This means that correcting for one concept (or a set of concepts) does not affect which other concepts are predicted for the same image. However, the occurrence of concepts in real life is often correlated, and informing the model about one concept should consequently influence the use of related ones. Not doing so means that we do not leverage human feedback to its full extent - intervening on one specific concept naturally gives additional context about the potential occurrence of other concepts, which should be taken into account in the final classification process. In particular, we study the extent of this crucial aspect when operating with concept-based models. Our study highlights how the use of a simple concept intervention realignment module, which learns from statistical concept relations, can effec + +tively and automatically realign concept values after an intervention (or multiple) have been performed. Our experiments reveal how our concept realignment seamlessly integrates into and improves existing CBM approaches (e.g. default CBMs [9], CEMs [27] or intervention-aware CEMs [29]), and can be deployed both jointly during the initial training of the concept model, and as a post-hoc trained realignment mechanism. Across three standard, real-world benchmarks (CUB [22], CelebA [11] and AwA2 [23]), we showcase consistent, in parts very significant improvements in intervention efficacy. Across concept prediction and overall classification accuracy, performance increases more rapidly with interventions as compared to baselines without realignment (reducing the number of interventions needed to reach a target performance by over $70\%$ ). Combined with its versatile usage and minimal additional resource requirements, we believe our insights into concept intervention realignment to be of high practical relevance, helping to drive down the cost of human-model collaboration and facilitate the corresponding practical deployment of concept-based models. + +# 2 Related Works + +Concept Bottleneck Models (CBMs) have been extensively studied since their introduction by [9]. [27] proposed Concept Embedding Models as a generalization, utilizing embedding vectors for concepts rather than scalar probabilities, thus enhancing task performance while maintaining interpretability. Recent efforts have explored methods to enhance CBMs without requiring explicit concept supervision during training, leveraging pre-trained vision backbones and language guidance [15, 25, 26]. [2] introduced Self-explaining Neural Networks (SENNs) for unsupervised concept learning, while [18] proposed CBMAUC combining SENNs with CBMs. Probabilistic CBMs [8] were proposed to model uncertainty in concepts and final predictions. [12, 14] addressed concept leakage, while [6, 13] aimed to alleviate it. Our work complements these efforts by enabling CBMs to update predictions of all concepts after human intervention. + +Interventions on CBMs. [9] showed that intervening on random concepts enhances classification in CBMs. [3] and [19] proposed uncertainty-based strategies for interventions. [20] extensively studied concept selection strategies, focusing on task performance and execution cost. [29] introduced interventions during training to enhance model receptiveness to test-time interventions. We complement existing methods by updating predictions of all concepts following expert interventions. Concurrently, [24] proposed Energy-based CBMs to automate concept prediction updates. In comparison, our method benefits from higher simplicity, improved performance, and seamless integration with existing CBMs. + +# 3 Methods + +# 3.1 Background and Preliminaries + +Concept Bottleneck Models. A Concept-Bottleneck Model (CBM) can be viewed as a composition of two models, $h = f(g(x)): \mathcal{X} \to \mathcal{Y}$ , with concept en- + +coder $g: \mathcal{X} \to \mathcal{C}$ , and concept-based classification head $f: \mathcal{C} \to \mathcal{Y}$ . $\mathcal{X}, \mathcal{Y}$ , where $\mathcal{C}$ denote input, class label, and concept sets, respectively. CBMs get their name from an inherently bifurcated optimization process: While the concept encoder $g(x)$ is trained to predict concepts $\hat{c} \in \mathbb{R}^k$ from the concept set with $\| \mathcal{C} \| = k$ concepts given an image $x \in \mathbb{R}^d$ , the classification head $f(\cdot)$ is optimized to predict final target labels $y \in \mathcal{Y} \in \mathbb{R}^M$ solely based on concept assignments produces by $g$ . CBM training data is thus given as $\mathcal{D} := \{x^{(i)}, c^{(i)}, y^{(i)}\}_{i=1}^N$ , where $x^{(i)}, c^{(i)}, y^{(i)}$ are the inputs, ground-truth concepts, and ground-truth labels, respectively. Following existing works [9, 27-29], the concept encoder $g$ is trained using a (weighted) binary cross-entropy loss $(\mathcal{L}_{\mathrm{concept}}(\hat{c}, c))$ , while the classification head $f$ utilizes a cross-entropy classification objective $(\mathcal{L}_{\mathrm{task}}(\hat{y}, y) = \mathcal{L}_{\mathrm{CE}}(\hat{y}, y))$ . Overall, there are three established schemes [9] for training CBMs: (1) Independent training: the concept encoder and classification head are trained entirely independently, with ground-truth concepts $c$ provided as inputs to the classification head during training. (2) Sequential training: the concept encoder $g$ is trained first, followed by the classification head $f$ trained using the concepts predicted by $g$ . (3) Joint training: both the concept encoder $g$ and the classification head $f$ are trained together using a combination of $\mathcal{L}_{\mathrm{concept}}$ and $\mathcal{L}_{\mathrm{task}}$ , respectively. In all cases, this means that the classification head leverages only information on concept (co-)occurrences to predict final class labels, making it easy to ground the final classification decision on interpretable concept assignments. + +Concept Embedding Models. The flow of information in a CBM is bottlenecked by the set of user-defined concepts. This can potentially limit the processing capacity of the model, especially when the concepts do not contain all the information that is needed to perform the downstream task. To overcome this issue, [27] proposed Concept Embedding Models (CEMs) as a generalization of CBMs wherein every concept $i$ is represented by a pair of high-dimensional vectors, $\hat{\mathbf{c}}_i^+$ and $\hat{\mathbf{c}}_i^-$ (as opposed to scalar concepts in CBMs). These embeddings are generated by passing $x$ through concept-specific networks $\phi_i^+$ and $\phi_i^-$ , and represent the concept being present and absent, respectively. The probability $\hat{p}_i$ of the concept $i$ being in $x$ is then simply computed by passing $\hat{\mathbf{c}}_i^+$ and $\hat{\mathbf{c}}_i^-$ to a scoring function $s$ as $\hat{p}_i = s([\hat{\mathbf{c}}_i^+, \hat{\mathbf{c}}_i^-])$ . Similarly, both embeddings can also be combined as $\hat{\mathbf{c}}_i = \hat{p}_i \hat{\mathbf{c}}_i^+ + (1 - \hat{p}_i) \hat{\mathbf{c}}_i^-$ to parameterize a joint embedding for concept $i$ . The final concept embedding which represents the full image $x$ and is passed to the classification head is then given as $\hat{\mathbf{c}} := [\hat{\mathbf{c}}_1, \hat{\mathbf{c}}_2, ..., \hat{\mathbf{c}}_k]$ . Notice the higher dimensionality, as we concatenate $k$ concept-specific embeddings. + +Concept Interventions. Both CBMs and CEMs allow users to intervene on concepts at test time. Concretely, starting from the concept predictions of the model, $\hat{c}$ , the user sequentially intervenes on $T \leq k$ concepts. As a human expert has to both investigate concept predictions and compare against input data, interventions are difficult to parallelize, effectively equating concept intervention into a trajectory of $T$ concept intervention steps [20] (see also Fig. 1 for intuition). Let $\mathcal{S}_t$ represent the set of concepts that have been intervened on up to time $t \leq T$ . The corresponding concept embedding at time $t$ is then given as $\tilde{c}_t = \{c_{\mathcal{S}_t}, \hat{c}_{\backslash \mathcal{S}_t}\}$ , where $c_{\mathcal{S}_t}$ denotes the ground truth values of the intervened concepts, + +and $\hat{c}_{\backslash S_t}$ are the model's predictions of non-intervened concepts. Intervening on concepts in this way updates the final prediction of the model from $\hat{y}$ to $\tilde{y} = f(\tilde{c})$ . In the case of a CEM, intervening on concept $i$ to update its value from $\hat{p}_i$ to $p_i$ changes its embedding from $\hat{\mathbf{c}}_i$ to $\tilde{\mathbf{c}}_i = p_i\hat{\mathbf{c}}_i^+ +(1 - p_i)\hat{\mathbf{c}}_i^-$ . After each intervention $t$ , we use a concept intervention policy $\pi (\tilde{c}_t)$ to decide which concept to intervene on next. While $\pi$ can simply suggest random concepts for intervention, it is often much better to leverage heuristics that rank concepts in the order of importance (by some measure). A commonly deployed policy is UCP [10, 20], which uses the uncertainty of concepts; selecting concepts with the highest uncertainty (concept predictions closest to 0.5). + +Intervention-aware CEMs. While test-time interventions typically improve performance, this is not always guaranteed. In fact, recent works have shown that concept interventions can in some cases even hurt the model's performance [20, 28]. [29] noted that this stems from the lack of training incentive for the model to perform well under intervention. To address this, they proposed Intervention-aware CEMs (IntCEMs), which introduce interventions during the training process to improve the model's receptiveness to interventions at test time, outperforming all existing methods in the intervention setting. In particular, they train a CEM to minimize the following objective: + +$$ +\mathcal {L} _ {\text {I n t C E M}} (x, c, y, \mathcal {T}) = \mathcal {L} _ {\text {p r e d}} (x, c, y, \hat {c}, \tilde {c} _ {t}) + \lambda_ {\text {c o n c}} \mathcal {L} _ {\text {c o n c}} (\hat {c}, c) + \lambda_ {\text {r o l l}} \mathcal {L} _ {\text {r o l l}} (x, c, y, \mathcal {T}) \tag {1} +$$ + +$$ +\mathcal {L} _ {\mathrm {p r e d}} (x, c, y, \tilde {c} _ {0}, \kappa_ {t}) = \frac {\mathrm {C E} (f (\hat {c} , y) + \gamma^ {T} \mathrm {C E} (f (\tilde {c} _ {t}) , y)}{1 + \gamma^ {T}} +$$ + +$\mathcal{L}_{\mathrm{pred}}$ is the prediction loss for $y$ , $\mathcal{L}_{\mathrm{conc}}$ the concept prediction loss, $\mathcal{L}_{\mathrm{roll}}$ the rollout loss incentivizing the model to predict the most informative concept for intervention. $\lambda_{\mathrm{conc}}$ and $\lambda_{\mathrm{roll}}$ are user-defined weights corresponding to $\mathcal{L}_{\mathrm{conc}}$ and $\mathcal{L}_{\mathrm{pred}}$ respectively, while $\mathcal{T}$ denotes the intervention trajectory. $\mathcal{L}_{\mathrm{pred}}$ penalizes the model for incorrect predictions both before and after the intervention, and $\gamma \geq 1$ is a scaling term that prioritizes correct predictions after intervention. + +# 3.2 Concept Intervention Realignment + +Previous works incrementally improve on predecessor methods by better parameterizing concept representations or introducing an intervention-aware training objective. However, all these works still treat concept interventions independently. This means that an intervention on one specific concept has no effect on the assignment of other concepts. This disregards relationships between concepts, which in practice do not occur independently (e.g., "white wing" and "white belly" are more likely to co-occur). As a result, the existing intervention process does not utilize human feedback optimally, as information about the verified existence of one concept should naturally guide the prediction of other concepts. While this aspect is naturally important to ensure that an accurate concept representation is passed to the label classifier, it is also crucial when utilizing concept-selection criteria such as UCP because intervening on one concept + +![](images/33c29434c9938a5ef57a9856c386ef26e2c9d946b6dad8797e20f58f53c232a8.jpg) +Fig. 2: Illustration of the concept intervention realignment module. Given the concept encoding $g(x)$ , we intervene on the concept $i$ selected by a concept selection policy $\pi$ . This concept is replaced with a ground-truth (GT) value $(\in \{0,1\}$ depending on whether it is present in a given image or not) to obtain $\tilde{c}_t$ (representing intervention step $t \in \{1,\dots,T\}$ ). This intervened concept representation is then passed into the concept realignment module (leveraging e.g. an MLP or LSTM reweighting mode), which outputs the realigned $u(\tilde{c}_t)$ . To ensure that the ground-truth values provided by the user are not overwritten during realignment, $u(\tilde{c}_t)$ retains ground-truth corrections. The final concept vector is then based into a concept-based classifier $f$ . + +should consequently reduce the chances of intervening on other closely related, likely co-occurring concepts, while also raising the probability that uncertain and unrelated concepts get intervened on. + +Intervention Realignment Module. To address this, we propose a concept intervention realignment module (CIRM), which consists of two interdependent components: (a) a concept realignment model (CRM), $u: \mathcal{C} \to \mathcal{C}$ . After a user intervenes on a subset of concepts $S$ , the remaining concepts ( $\backslash S$ ) are updated by a realigner network; and (b) an intervention policy $\pi$ . The concepts predicted by the realignment model are fed to the policy to suggest which concept to intervene on next. Both components are interdependent, and together form the overall concept intervention realignment module, as also visualized in Figure 2. The training of the full CIRM comprising both selection policy and concept realignment model aims to simulate the complete intervention process. It thus starts from the concept predictions of the base model, $\hat{c}$ , where we sequentially intervene on concepts for $T \leq k$ time steps by following a policy of choice, $\pi$ (in our case UCP by default, which we experimentally find to outperform random intervention significantly; See supp. §B). + +As in §3.1, let $S_{t}$ denote the set of intervened concepts and $\tilde{c}_{t} = \{c_{S_{t}},\hat{c}_{\setminus S_{t}}\}$ denote the concepts at time $t$ , respectively. At every intervention time step, we feed $\tilde{c}_{t}$ to the realignment model to obtain updated concept predictions as $\kappa_{t} = u(\tilde{c}_{t})$ , which in turn are utilized by $\pi (\kappa_{t})$ to produce intervention recommendations for $t + 1$ . Finally, we train $u$ with the ground-truth labels as targets using the loss $\mathcal{L}(u) = (\sum_{t = 0}^{T}\mathrm{CE}(u(\tilde{c}_{t}),c)) / T$ . + +Using this simple objective, the concept realignment model $u$ learns to take concept representations and leverage intervened concepts $S_{t}$ to predict an updated concept distribution, i.e., $p(i; \hat{c}, S_{t})$ . Note that this training objective uti + +izes standard CBM training information (i.e., concept annotations, [9, 20, 27-29]); so no additional information beyond the standard CBM pipeline is required. + +The overall training pipeline can still follow the standard CBM training paradigms (see previous section), with the intervention realignment module being trained independently on top of a pre-trained frozen CBM/CEM as a posthoc realignment method, or jointly with the CBM/CEM to introduce an explicit realignment objective during training. For posthoc realignment, we first train the backbone $f$ and the classification head $g$ . Subsequently, we freeze those components and train the realignment model $u$ . + +Realignment Models. As shown in Fig. 2, we parameterize our concept realignment model with a neural network $v$ . To ensure that $u$ does not overwrite the ground-truth concepts provided by the user, we also keep track of the already intervened concepts $S_{t}$ . Using this information, we replace the output of the realigned concept embedding with the user-provided values for concepts in $S_{t}$ . Hence, the final output of $u$ for the $i^{th}$ concept is given as + +$$ +u \left(\tilde {c} _ {t}, \mathcal {S} _ {t}\right) ^ {(i)} = v \left(\tilde {c} _ {t}\right) ^ {(i)} \quad \text {i f} i \notin \mathcal {S} _ {t} \text {e l s e} \quad \tilde {c} _ {t} ^ {(i)} \tag {2} +$$ + +Depending on the assumptions made on the realignment process, $v$ is either a simple MLP or a recurrent model (such as an LSTM [7]). The former parametrizes our default concept intervention realignment model, which only passes the set of intervened and un-intervened concepts at intervention step $t$ to the concept realignment model consisting of a simple MLP. The set of concepts fed into the MLP may either be the original concept embedding $\tilde{c}_0$ , where all intervened concepts up to and including step $t$ have been replaced with ground-truth values, or the previously realigned $\kappa_{t-1}$ with similarly updated intervened concepts (c.f. Fig. 2, "GT"). Note that in either case, $\kappa_{t-1}$ informs the selection process of the subsequent concept to intervene on. After all interventions, the final concept embedding fed into the classifier is always $u(\tilde{c}_T)$ . Practically, we found using $\tilde{c}_t$ to work slightly better than $\kappa_{t-1}$ . Both cases above however only pass the final set of concepts at time $t$ to the realignment model. Given the sequential nature of interventions, however, it may also be beneficial to account for the entire intervention history to inform future concept realignment. As a result, we also introduce a recurrent realignment variant, $u_{\mathrm{rec}}$ , which employs an LSTM model to retain the entire history of interventions until time $t$ . An algorithmic summary is provided in supplementary §A. + +End-to-End Realignment. In order to jointly train the CIR module and the base model $f \circ g$ , we will perform interventions while also training the base model. This naturally combines with the IntCEM framework [29], which incorporates train-time interventions, and as such is our default choice for joint model and realignment module training. + +Concretely, we modify IntCEMs such that after $t$ interventions, concepts $\tilde{c}_t$ are corrected post-intervention to obtain $\kappa_t = u(\tilde{c}_t)$ , which is then fed to the + +classifier $f$ . The new training objective, then, is: + +$$ +\mathcal {L} _ {\text {I n t C E M - R e A}} (x, c, y, \mathcal {T}) = \mathcal {L} _ {\text {p r e d}} (x, c, y, \tilde {c} _ {0}, \kappa_ {t}) + \lambda_ {\text {c o n c}} \mathcal {L} _ {\text {c o n c - R e A}} (\hat {c}, c, \kappa_ {0}, \kappa_ {t}) + \lambda_ {\text {r o l l}} \mathcal {L} _ {\text {r o l l}} \tag {3} +$$ + +$$ +\mathcal {L} _ {\text {c o n c - R e A}} (\hat {c}, c, \kappa_ {0}, \kappa_ {t}) = \frac {1}{2} \left(\mathcal {L} _ {\text {c o n c}} (\hat {c}, c) + \frac {\mathrm {C E} (\kappa_ {0} , c) + \gamma^ {T} \mathrm {C E} (\kappa_ {T} , c)}{1 + \gamma^ {T}}\right) \tag {4} +$$ + +where $\mathcal{L}_{\mathrm{conc - ReA}}$ is the modified concept prediction loss which trains both the backbone $g$ of the base model (first term) as well as the CRM (second term). We use the same $\gamma$ as in $\mathcal{L}_{\mathrm{pred}}$ to prioritize correct predictions by the CRM after intervention, and the same $\lambda_{\mathrm{conc}}$ and $\lambda_{\mathrm{roll}}$ as in Eq. 1. + +# 4 Experiments + +# 4.1 Preliminaries + +Datasets & Implementation. We perform experiments on three datasets: (1) Caltech-UCSD Birds-200-2011 (CUB) [22] containing $n = 11,788$ bird images over 200 classes. Following the original CBM paper [9], we use 112 concepts grouped into 28 concept groups with the same splits. (2) Large-scale CelebFaces Attributes (CelebA) [11] contains over 200,000 celebrity images annotated with 40 attribute labels, including noisy characteristics such as gender and age. Following [27, 29], we use only the most balanced 8 concepts in our experiments, resulting in $2^8 = 256$ classes. (3) Animals with Attributes 2 (AwA2) [23] is a collection of $n = 37,322$ animal images over 50 classes annotated with 85 attributes such as species, color, and behavior. We perform experiments on CEMs, IntCEMs, and three types of CBMs (sequential, independent, and joint). For all models and datasets, we follow the hyperparameters used in [29]. During CIRM training, we sequentially intervene on concepts $T = k$ times. By default, we use UCP both during training and inference, and if not stated otherwise, use a multi-layered perceptron (MLP) for concept realignment. We use the predictions of the base CBM $(\tilde{c}_t)$ as its input for un-intervened concept representations. We perform a small, standard hyperparameter using Optuna [1] with 50 trials to search over the number of hidden layers $\in \{1,2,3\}$ and units $\in \{k,2k,k/2\}$ , the learning rate $\in [10^{-5},10^{-1}]$ and weight decay $\in [10^{-6},5\times 10^{-5}]$ , and use the same batch size as used to train the base model. We employ early stopping and learning rate decay on the validation loss. For joint training, we instantiate the realigner MLP 2 hidden layers containing $k$ neurons each. Experiments are conducted using PyTorch [16]. + +# 4.2 Concept Realignment Improves Intervention Efficacy + +To probe the efficacy of our concept intervention realignment module, we evaluate both the change in concept prediction loss as well as overall classification accuracy as a function of intervened concept counts. These are visualized in Fig. 3 + +![](images/4f0634b52f39203f76a68198ceb304cfe9f5fec82fff6ba0d854d8e259213ad2.jpg) +Fig. 3: Concept prediction loss vs. the number of intervened concepts with and without concept realignment. Concept realignment consistently improves concept predictions. + +![](images/f62223b8209a4f0f8fd56d81b60e5bb2c3eab76b34eb28cf83cf3b2b855ab6b0.jpg) + +![](images/911a49d89a8e0493cbd5434042f13c8f7828b6aef23126feebea0f4fa21025ff.jpg) + +![](images/486fc9e937013077583530908d787db2c06008e1fdc9cc2db782cb5aea8f54c8.jpg) +Fig. 4: Classification accuracy vs. the number of intervened concepts with and without concept realignment. Realignment consistently improves classification accuracy. + +![](images/ac7c9c8bca790519b78d922e3b55ed9064743009e776501e5b4e4f686c7cec7e.jpg) + +![](images/d5efa0ab317140b1f17a19f70be107ae1fb51b1f46fffdaa9125fd5165cab9d9.jpg) + +and Fig. 4 for sequentially trained CBMs (see §3.1), respectively, for all benchmark test sets - CUB, CelebA and AwA2. Note that for AwA2, we only show the first 50 interventions for visual clarity, as performance beyond that heavily plateaus since sufficient concepts have been intervened on to perfectly solve the test data. Table 1 numerically summarizes these results via AUC scores and provides additional scores for independently trained CBMs, jointly trained CBMs as well as Concept Embedding Models (CEMs). Runs in Tab. 1 & Figs. 3, 4 all utilize the stronger UCP selection policy as opposed to the weaker random selection policy (\$B) to measure intervention efficacy at the highest level, and train the concept realignment module on top of already trained concept models. + +Improved concept attribution through intervention. Across all datasets, we can observe a consistent, in parts vast reduction in concept prediction loss, which measures the correct assignment of concepts for each input (using the concept loss described in §3.1). For example on CUB, a tenfold reduction of the original unintervened concept loss ( $\sim 0.6$ to $\sim 0.06$ ) can be achieved with half the number of interventions (11 with concept realignment, 23 without). This effect becomes even more prevalent on AwA2, where a tenfold reduction ( $\sim 0.17 \rightarrow \sim 0.017$ ) is achieved after around 16 interventions with realignment versus more than 60 without; marking a more than $70\%$ reduction in intervention efforts. This is also reflected in Tab. 1, where concept loss AUC drops by in parts more than half for CUB and from 4.26 to 1.13 on AwA2. We find this significant improvement in concept attribution persists across all CBMs and CEMs, as well as random seed initializations (see Supp. Tab. 2 and 3) + +Table 1: Area Under Curve (AUC) of Concept Prediction Loss and Classification Accuracy with/without CIRM (non-averaged sum). We use the same backbone throughout. CIRM improves performance across all models and datasets. Intervention curves share long saturation plateaus for high intervention counts. Accuracy AUC scores are thus saturated, and best combined with performance graphs in Figs. 3, 4. + +
Base ModelRealignedConcept LossAUC ↓Accuracy AUC ↑
CUBCelebAAwA2CUBCelebAAwA2
Sequential CBM×6.711.594.262460.8280.78364.0
✓3.151.521.132510.9284.38397.6
Independent CBM×6.711.594.262653.4280.28403.4
✓3.151.521.132678.3282.18437.0
Joint CBM×5.933.064.772580.3273.18276.4
✓3.671.761.482609.0273.98327.4
CEM×5.991.614.902521.4396.38429.3
✓3.201.461.692558.4400.18433.9
+ +We do find that for CelebA with a much more restrictive concept bottleneck than e.g. CUB and AwA2, due to significantly fewer (note that in CUB concepts are already grouped, see §4.1) and noisier concepts, that the overall gain in concept accuracy is smaller. This is also reflected in the notably weaker performance of the base CBM (c.f. Fig. 4, middle - less than $38\%$ accuracy when intervening on all concepts), which strongly points towards overall insufficient concept information provided in the CelebA training data. Overall, however, we find very clear evidence that the concept intervention realignment module allows practitioners to leverage human intervention feedback to a much larger extent to attribute the correct concepts to respective inputs. This means that the subsequent classifier will operate on a much more accurate set of concepts, thereby improving the overall interpretability of the final classification decision. + +Improved overall classification through intervention. On top of that, we also find that the significant gain in intervention efficacy on a concept attribution level also translates to subsequent gains in intervention efficacy for the overall classification performance (Fig. 4). For example on CUB, the final classification accuracy after intervening on all concepts is $93.9\%$ , which is achieved already after $\sim 16$ intervention steps. A comparable performance without concept intervention realignment requires nearly complete, $\sim 24$ intervention steps, marking a $50\%$ increase. The same can be seen on CelebA and AwA2 as well, where the upper-bound performance can be achieved with much fewer interventions (particularly without the need to intervene on all concepts). Even intermediate performance targets are achieved much earlier; a classification accuracy target of e.g. $98\%$ on AwA2 requires only 12 concept interventions with realignment, while the non-aligned baseline needs 19 interventions on average. We find these results to be also reflected numerically in Tab 1, where accuracy AUC increases from e.g. 2460.8 to 2510.9 on CUB. We do point towards high numerical saturation given the larger performance plateaus at higher intervention counts, and high starting accuracies (e.g. $\sim 90\%$ on AwA2). Numerical results are thus best considered alongside the intervention trajectories in Figs. 3 and 4. + +![](images/d0023cba8915d0aeb0c3f19f15cf338dddf16c3b508b03f58e37dc129c855dfc.jpg) +(a) + +![](images/67da66eb9ebfa1e49919a178026db1dd117bbefb3c6d1cb9020bcd80a44e1655.jpg) +(b) +Fig. 5: Concept Intervention Realignment in intervention-aware CEMs. (a) Concept prediction loss and (b) classification accuracy with jointly and post-hoc trained CIRMs. In both cases, significant benefits can be seen, especially for correct concept attribution after intervention - both for jointly and posthoc trained realignment modules. + +Together, our experiments provide strong evidence that concept intervention realignment is crucial to best leverage human feedback in concept-based decision systems; allowing to significantly reduce intervention budgets by in parts over $70\%$ to achieve a desired target performance. These gains can also be achieved after concept models have been trained, allowing for versatile applicability. + +# 4.3 Intervention Realignment for Intervention-aware CEMs + +In this section, we investigate training the CIRM during the training process of an already intervention-regularized concept model; namely the recently proposed, state-of-the-art intervention-aware CEM [29] (see also §3.1). Following the objective described in Eq. 3, we operate and train the concept intervention module in conjunction with the intervention objective proposed by [29]. + +Our results are shown in Fig. 5. First, we find that explicit concept intervention realignment can significantly improve correct concept attribution, even in intervention-aware training setups (c.f. Fig. 5a). While not as significant as improvements over standard CBM models, for specific target concept prediction losses (such as a fivefold reduction from 0.5 to 0.1), half the number of intervention steps are needed (11 versus 20). The improved concept attribution is also reflected in higher intervention accuracies as seen in Fig. 5b, albeit the overall (still notable!) improvement is less reflective of the significant gains on a concept level (additional results can be found in supp. §C). Overall, however, our experiments highlight that even when applied to state-of-the-art approaches that specifically simulate the intervention process during training, improved intervention efficacy can be found. Importantly, the consistently significant improvements on a concept attribution level mean that classification decisions are much better grounded on correct concept attributions, which is crucial for interpretability [9, 27] of classification results. Finally, we find that concept intervention realignment can be applied both as a regularization mechanism during training, as well as adapted entirely posthoc, while still offering consistent benefits. This supports the high versatility of CIRMs as a general-purpose tool to increase intervention efficacy. + +![](images/9a6d418ed986b3afd0c8682ab92ced1bdab24833cb6a560c23e225f3a1005c8d.jpg) +(a) + +![](images/b4e038a43eb1cf321afef6c8c4ce618c608e622ccfb857c6c20ec581211fc8d5.jpg) +(b) +Fig. 6: (a) Concept prediction loss and (b) classification accuracy for various realigner architectures alongside UCP policy. Using an MLP with concept predictions of the base model works better than compounding refinements and accounting for intervention trajectories using LSTMs. + +# 4.4 Realignment Module Ablations + +**Realignment Model Architectures.** In this section, we study the effect of various design choices for the realignment module along two dimensions: (1) Recurrent vs. Feedforward Networks: Since we intervene on concepts sequentially, it is possible that the realignment module can benefit from the overall order and history of interventions to make more accurate concept predictions. To do this, we instantiate the concept realignment network using an LSTM [7]. We compare this against our default MLP. (2) Previous Output vs. Original Concepts: By default, the realignment module takes as input a combination of ground-truth concepts provided by the user and values predicted by the base model at $t = 0$ for the concepts that have not been intervened on (see also §3.2). Due to the sequential nature of interventions, one may also directly feed the output of the realignment module at time $t - 1$ as input to it at time $t$ in order to compound the refinements over multiple time steps. Combining both axes results in four recombinations, which we compare in Fig. 6. As can be seen, there is limited gain when accounting for the complete intervention history using an LSTM realigner network. Similarly, we find that applying the MLP primarily for concept selection alongside UCP and as final input to the classification head works better than compounding refinements over intervention steps. + +Intervention Policy Transfer. In this section, we study the importance of aligning intervention policies used during training with those deployed at test time. In particular, we operate on the base setup, which deploys the CBM and the concept intervention realignment module using only the much weaker random intervention policy at test time. However, we change the policy used to train the concept intervention realignment module. Our results are visualized in Fig. 7. As can be seen, while a realignment module trained with UCP can still be effective when deployed with a random intervention policy, it is notably outperformed by the weaker random policy at test-time when the realignment module has been trained on the same random policy as well. This means that the realignment module adapts to the selection policy used during training. Thus to get the + +![](images/52cf06560caf640256b950a2fc1a6977539bf0c9d5315954bbca7e1779e9abc8.jpg) +Fig. 7: Concept prediction loss and classification accuracy under random interventions for realignment modules trained with random and UCP policy, respectively. Results indicate that alignment of policy used during training and deployment is important. + +![](images/da9a1db1716396b83a3db4550b393b719586353de477d3ef39a3a30cd99c0074.jpg) + +most benefits out of concept intervention realignment, selection policies should align during training and deployment. + +Alignment $b / w$ Realignment Module Components. Finally, we study how important the alignment between the concept realignment model and intervention policy (i.e., UCP) is to form the overall concept intervention realignment module. To accomplish this, we employ two module variations: (a) an original policy denoted as $\pi (\hat{c}_0)$ , which only applies the UCP criterion to the original concept predictions generated by the base model without any concept realignment (i.e., the policy does not change over time), and (b) our default setup (updated policy), which informs the intervention policy using realigned concept values $(\pi (\kappa_{t}))$ . Note that in both cases, the clas + +sification head still receives realigned concept embeddings, as we only want to study the importance of alignment between the concept realignment model and the intervention policy. Results in Fig. 8 clearly reveal that while simple realignment on its own can already help improve intervention efficacy, much larger efficacy gains are unlocked when both policy and the realignment model are utilized in conjunction. + +![](images/d2f209a2642fc7f42f49ae445509a5a341202a944b53480c701fd1a198f9ffff.jpg) +Fig. 8: Classification accuracy vs concept interv. counts, showing our updated selection policies improving over the static one. + +A Closer Look at Concept Realignment. To understand the impact of the realignment process qualitatively, we also provide examples in Fig. 9. In this figure, we showcase the impact of interventions on the top 10 concepts with the highest prediction errors, and the specific number of interventions required to predict the correct label. For both examples, we find that intervention on a single concept is insufficient to flip incorrect class predictions. However, as we intervene on more concepts, we can clearly see that concept realignment jointly allows concept prediction error - even on the initially worst predicted concepts - to be significantly reduced, while also reaching correct image classification with + +![](images/dbf23b4fe5e321f8ccfe216749dce3c58e1b62f554bd188fe0786dfd00d96031.jpg) +Fig. 9: Examples for the improved intervention efficiency of CIRM. We show the change in concept prediction errors of the ten worst predicted concepts, as a function of concept intervention steps $t$ : concept realignment allows concept error even for strongly mispredicted concepts to be significantly reduced with interventions, achieving correct label classification after much fewer interventions compared to non-realigned baselines. + +in parts less than half the number of interventions (for Crested Auklet). These results conceptually support the quantitative benefits of concept realignment seen in previous benchmark experiments. + +# 5 Conclusion + +In this work, we identify the independent treatment of concepts during test-time interventions in CBMs as a cause for reduced intervention efficacy. To remedy this problem, we propose a concept intervention realignment module - a simple and lightweight technique to automatically update concept assignments after human intervention on one or multiple concepts. Our experiments demonstrate significant gains in concept attribution as well as overall classification accuracy of concept-based models under intervention. We show that our approach is versatile and can be applied to a wide range of concept-based models, intervention policies, and training schemes. We believe that the reduction in required human interventions to reach performance targets facilitates the practical deployment of concept-based models even in resource-constrained environments. + +# Acknowledgements + +Karsten Roth and Jae Myung Kim thank the European Laboratory for Learning and Intelligent Systems (ELLIS) PhD program and the International Max Planck Research School for Intelligent Systems (IMPRS-IS) for support. This work was supported by DFG project number 276693517, by BMBF FKZ: 01IS18039A, by the ERC (853489 - DEXIM), by EXC number 2064/1 - project number 390727645. The authors would like to thank Shyamgopal Karthik and Leander Gerrbach for their helpful feedback on the manuscript. + +# References + +1. Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: A next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. pp. 2623-2631 (2019) 8 +2. Alvarez Melis, D., Jaakkola, T.: Towards robust interpretability with self-explaining neural networks. Advances in neural information processing systems 31 (2018) 3 +3. Chauhan, K., Tiwari, R., Freyberg, J., Shenoy, P., Dvijotham, K.: Interactive concept bottleneck models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 5948-5955 (2023) 3 +4. Durán, J.M., Jongsma, K.R.: Who is afraid of black box algorithms? on the epistemological and ethical basis of trust in medical ai. Journal of Medical Ethics 47(5), 329-335 (2021). https://doi.org/10.1136/medethics-2020-106820, https://jme.bmj.com/content/47/5/329 1 +5. EUGDPR: Gdpr. general data protection regulation (2017) 1 +6. Havasi, M., Parbhoo, S., Doshi-Velez, F.: Addressing leakage in concept bottle-neck models. Advances in Neural Information Processing Systems 35, 23386-23397 (2022) 3 +7. Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural computation 9(8), 1735-1780 (1997) 7, 12 +8. Kim, E., Jung, D., Park, S., Kim, S., Yoon, S.: Probabilistic concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 16521-16540. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/kim23g.html 3 +9. Koh, P.W., Nguyen, T., Tang, Y.S., Mussmann, S., Pierson, E., Kim, B., Liang, P.: Concept bottleneck models. In: International conference on machine learning. pp. 5338-5348. PMLR (2020) 1, 2, 3, 4, 7, 8, 11 +0. Lewis, D.D., Catlett, J.: Heterogeneous uncertainty sampling for supervised learning. In: Machine learning proceedings 1994, pp. 148-156. Elsevier (1994) 5 +1. Liu, Z., Luo, P., Wang, X., Tang, X.: Deep learning face attributes in the wild. In: Proceedings of the IEEE international conference on computer vision. pp. 3730-3738 (2015) 3, 8 +2. Mahinpei, A., Clark, J., Lage, I., Doshi-Velez, F., Pan, W.: Promises and pitfalls of black-box concept learning models. arXiv preprint arXiv:2106.13314 (2021) 3 +3. Marconato, E., Passerini, A., Teso, S.: Glancenets: Interpretable, leak-proof concept-based models. Advances in Neural Information Processing Systems 35, 21212-21227 (2022) 3 +4. Margeloiu, A., Ashman, M., Bhatt, U., Chen, Y., Jamnik, M., Weller, A.: Do concept bottleneck models learn as intended? arXiv preprint arXiv:2105.04289 (2021) 3 +5. Oikarinen, T., Das, S., Nguyen, L.M., Weng, T.W.: Label-free concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3 +6. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., Kopf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., Fang, L., Bai, J., Chintala, S.: Pytorch: An imperative style, high-performance deep learning library. In: Advances + +in Neural Information Processing Systems 32, pp. 8024-8035. Curran Associates, Inc. (2019), http://papers.neurips.cc/paper/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf 8 +17. Piano, S.L.: Ethical principles in machine learning and artificial intelligence: cases from the field and possible ways forward. Palgrave Communications 7(1), 1-7 (2020), https://EconPapers.repec.org/RePEc:pal:palcom:v:7:y:2020:i:1:d:10.1057_s41599-020-0501-9_1 +18. Sawada, Y., Nakamura, K.: Concept bottleneck model with additional unsupervised concepts. IEEE Access 10, 41758-41765 (2022) 3 +19. Sheth, I., Rahman, A.A., Sevyeri, L.R., Havaei, M., Kahou, S.E.: Learning from uncertain concepts via test time interventions. In: Workshop on Trustworthy and Socially Responsible Machine Learning, NeurIPS 2022 (2022) 3 +20. Shin, S., Jo, Y., Ahn, S., Lee, N.: A closer look at the intervention procedure of concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 31504-31520. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/ shin23a.html 2, 3, 4, 5, 7 +21. Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: Automated decisions and the gdpr (2018) 1 +22. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) 2, 3, 8 +23. Xian, Y., Lampert, C.H., Schiele, B., Akata, Z.: Zero-shot learning—a comprehensive evaluation of the good, the bad and the ugly. IEEE transactions on pattern analysis and machine intelligence 41(9), 2251-2265 (2018) 3, 8 +24. Xu, X., Qin, Y., Mi, L., Wang, H., Li, X.: Energy-based concept bottleneck models. In: The Twelfth International Conference on Learning Representations (2023) 3 +25. Yang, Y., Panagopoulou, A., Zhou, S., Jin, D., Callison-Burch, C., Yatskar, M.: Language in a bottle: Language model guided concept bottlenecks for interpretable image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19187-19197 (2023) 3 +26. Yuksekgonul, M., Wang, M., Zou, J.: Post-hoc concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3 +27. Zarlenga, M.E., Barbiero, P., Ciravegna, G., Marra, G., Giannini, F., Diligenti, M., Shams, Z., Precioso, F., Melacci, S., Weller, A., et al.: Concept embedding models. arXiv preprint arXiv:2209.09056 (2022) 1, 2, 3, 4, 7, 8, 11 +28. Zarlenga, M.E., Barbiero, P., Shams, Z., Kazhdan, D., Bhatt, U., Weller, A., Jamnik, M.: Towards robust metrics for concept representation evaluation. arXiv preprint arXiv:2301.10367 (2023) 4, 5, 7 +29. Zarlenga, M.E., Collins, K.M., Dvijotham, K.D., Weller, A., Shams, Z., Jamnik, M.: Learning to receive help: Intervention-aware concept embedding models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023) 1, 2, 3, 4, 5, 7, 8, 11 \ No newline at end of file diff --git a/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/images.zip b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..cd766286ca27e187efa4117246d8df7e78786498 --- /dev/null +++ b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:689d3b09d3b61b3da938ef5e5e4d48e3268fb35825a5077c276d2e570890c01c +size 450783 diff --git a/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/layout.json b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..b87d60d10b3004bc4083d0b8e96b87cb9685aef5 --- /dev/null +++ b/2024/Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models/layout.json @@ -0,0 +1,9013 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "spans": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "type": "text", + "content": "Improving Intervention Efficacy via Concept Realignment in Concept Bottleneck Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 154, + 167, + 459, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 167, + 459, + 180 + ], + "spans": [ + { + "bbox": [ + 154, + 167, + 459, + 180 + ], + "type": "text", + "content": "Nishad Singhi1 Jae Myung Kim1 Karsten Roth1 Zeynep Akata2" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 219, + 182, + 395, + 192 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 182, + 395, + 192 + ], + "spans": [ + { + "bbox": [ + 219, + 182, + 395, + 192 + ], + "type": "text", + "content": "Primary contact: nishadsinghi@gmail.com" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 134, + 201, + 478, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 201, + 478, + 213 + ], + "spans": [ + { + "bbox": [ + 134, + 201, + 478, + 213 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 134, + 201, + 478, + 213 + ], + "type": "text", + "content": "Tübingen AI Center, University of Tübingen " + }, + { + "bbox": [ + 134, + 201, + 478, + 213 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 134, + 201, + 478, + 213 + ], + "type": "text", + "content": "Helmholtz München, TU München" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 238, + 455, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 238, + 455, + 459 + ], + "spans": [ + { + "bbox": [ + 160, + 238, + 455, + 459 + ], + "type": "text", + "content": "Abstract. Concept Bottleneck Models (CBMs) ground image classification on human-understandable concepts to allow for interpretable model decisions as well as human interventions, in which expert users can modify misaligned concept choices to interpretably influence the decision of the model. However, existing approaches often require numerous human interventions per image to achieve strong performances, posing practical challenges in scenarios where obtaining human feedback is expensive. In this paper, we find that this is driven by an independent treatment of concepts during intervention, wherein a change of one concept does not influence the use of other ones. To address this issue, we introduce a trainable concept intervention realignment module, which leverages concept relations to realign concept assignments post-intervention. Across standard benchmarks, we find that concept realignment significantly improves intervention efficacy and reduces the number of interventions needed to reach a target classification performance or concept prediction accuracy. Moreover, it easily integrates into existing concept-based architectures without requiring changes to the models themselves. This reduced cost of human-model collaboration is crucial to enhance the feasibility of CBMs in resource-constrained environments. Our code is available at https://github.com/ExplainableML/concept_realignment." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 160, + 468, + 435, + 479 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 468, + 435, + 479 + ], + "spans": [ + { + "bbox": [ + 160, + 468, + 435, + 479 + ], + "type": "text", + "content": "Keywords: Concept Bottlenecks " + }, + { + "bbox": [ + 160, + 468, + 435, + 479 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 468, + 435, + 479 + ], + "type": "text", + "content": " Trustworthiness " + }, + { + "bbox": [ + 160, + 468, + 435, + 479 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 468, + 435, + 479 + ], + "type": "text", + "content": " Interventions" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 498, + 230, + 510 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 230, + 510 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 230, + 510 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "Despite tremendous progress of Deep Learning (DL) techniques in research and applications, their adoption to high-stakes scenarios has been limited [9, 27, 29]. This is in large part due to unpredictable failure cases of deep models when transferring to unseen data or complex & ambiguous cases. The black-box nature of typical DL models further exacerbates this problem, as it makes understanding and debugging the decision-making process of these models difficult. Consequently, it becomes hard for human practitioners to trustworthily operate these models in scenarios with significant legal [5, 21] or ethical [4, 17] constraints. To foster trust, transparency in the decision-making process, and the ability to operate alongside expert feedback are required. In order to incorporate these desiderata into the design space of deep models, Koh et al. [9] introduced Concept Bottleneck Models (CBMs). These models break the decision process into" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 114, + 465, + 232 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 465, + 232 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 465, + 232 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 465, + 232 + ], + "type": "image", + "image_path": "d206da68c11f2103f21a215344c770850d762dd2727cb855dbbe970a6cc41e27.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 239, + 482, + 285 + ], + "lines": [ + { + "bbox": [ + 131, + 239, + 482, + 285 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 482, + 285 + ], + "type": "text", + "content": "Fig. 1: Concept-based classification models allow for human intervention, where a human expert can correct specifically assigned concepts. However, to achieve satisfactory performance, concept-based classification models often require a large number of interventions, where each additional intervention requires costly human interaction." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 293, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 668 + ], + "type": "text", + "content": "the extraction of human-interpretable concepts (such as \"white wings\" and \"orange beak\" when classifying a seagull) from a given input, and a subsequent concept-grounded classifier operating on top of these concept predictions. While this allows users to peek into the model decision process - maybe even more importantly, it also uniquely allows for human-guided intervention and feedback integration at test time. This is done through concept interventions, wherein an expert user analyses predicted concepts and optionally replaces those they deem incorrect with ground-truth information (Fig. 1). Such interventions can significantly raise the performance and reliability of these models [9,20,27,29], while offering a natural interface for human-AI collaboration. However, human annotation is expensive, especially when resources and access to expert knowledge are limited. Ideally, such concept models should operate well with minimal human input. This becomes particularly prevalent as CBMs (as well as follow-up extensions such as Concept Embedding Models (CEMs, [27])) often require numerous interventions in order to significantly boost model performance [9,27,29], as the set of concepts these models operate on can often be rather extensive. For example, on the widely used CUB benchmark (bird classification, [22]), it takes 13 interventions per image on average to raise the accuracy of a baseline CBM model from around " + }, + { + "bbox": [ + 130, + 293, + 482, + 668 + ], + "type": "inline_equation", + "content": "68\\%" + }, + { + "bbox": [ + 130, + 293, + 482, + 668 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 293, + 482, + 668 + ], + "type": "inline_equation", + "content": "90\\%" + }, + { + "bbox": [ + 130, + 293, + 482, + 668 + ], + "type": "text", + "content": " (Fig. 4). In this work, we posit that a large part of this limited intervention efficacy can be traced back to the independent nature of how concept interventions are treated. This means that correcting for one concept (or a set of concepts) does not affect which other concepts are predicted for the same image. However, the occurrence of concepts in real life is often correlated, and informing the model about one concept should consequently influence the use of related ones. Not doing so means that we do not leverage human feedback to its full extent - intervening on one specific concept naturally gives additional context about the potential occurrence of other concepts, which should be taken into account in the final classification process. In particular, we study the extent of this crucial aspect when operating with concept-based models. Our study highlights how the use of a simple concept intervention realignment module, which learns from statistical concept relations, can effec" + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "content": "tively and automatically realign concept values after an intervention (or multiple) have been performed. Our experiments reveal how our concept realignment seamlessly integrates into and improves existing CBM approaches (e.g. default CBMs [9], CEMs [27] or intervention-aware CEMs [29]), and can be deployed both jointly during the initial training of the concept model, and as a post-hoc trained realignment mechanism. Across three standard, real-world benchmarks (CUB [22], CelebA [11] and AwA2 [23]), we showcase consistent, in parts very significant improvements in intervention efficacy. Across concept prediction and overall classification accuracy, performance increases more rapidly with interventions as compared to baselines without realignment (reducing the number of interventions needed to reach a target performance by over " + }, + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "inline_equation", + "content": "70\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 297 + ], + "type": "text", + "content": "). Combined with its versatile usage and minimal additional resource requirements, we believe our insights into concept intervention realignment to be of high practical relevance, helping to drive down the cost of human-model collaboration and facilitate the corresponding practical deployment of concept-based models." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 312, + 242, + 324 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 312, + 242, + 324 + ], + "spans": [ + { + "bbox": [ + 132, + 312, + 242, + 324 + ], + "type": "text", + "content": "2 Related Works" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 334, + 482, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 334, + 482, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 482, + 477 + ], + "type": "text", + "content": "Concept Bottleneck Models (CBMs) have been extensively studied since their introduction by [9]. [27] proposed Concept Embedding Models as a generalization, utilizing embedding vectors for concepts rather than scalar probabilities, thus enhancing task performance while maintaining interpretability. Recent efforts have explored methods to enhance CBMs without requiring explicit concept supervision during training, leveraging pre-trained vision backbones and language guidance [15, 25, 26]. [2] introduced Self-explaining Neural Networks (SENNs) for unsupervised concept learning, while [18] proposed CBMAUC combining SENNs with CBMs. Probabilistic CBMs [8] were proposed to model uncertainty in concepts and final predictions. [12, 14] addressed concept leakage, while [6, 13] aimed to alleviate it. Our work complements these efforts by enabling CBMs to update predictions of all concepts after human intervention." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 478, + 482, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 478, + 482, + 586 + ], + "spans": [ + { + "bbox": [ + 130, + 478, + 482, + 586 + ], + "type": "text", + "content": "Interventions on CBMs. [9] showed that intervening on random concepts enhances classification in CBMs. [3] and [19] proposed uncertainty-based strategies for interventions. [20] extensively studied concept selection strategies, focusing on task performance and execution cost. [29] introduced interventions during training to enhance model receptiveness to test-time interventions. We complement existing methods by updating predictions of all concepts following expert interventions. Concurrently, [24] proposed Energy-based CBMs to automate concept prediction updates. In comparison, our method benefits from higher simplicity, improved performance, and seamless integration with existing CBMs." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 601, + 206, + 613 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 206, + 613 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 206, + 613 + ], + "type": "text", + "content": "3 Methods" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 624, + 313, + 635 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 624, + 313, + 635 + ], + "spans": [ + { + "bbox": [ + 132, + 624, + 313, + 635 + ], + "type": "text", + "content": "3.1 Background and Preliminaries" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Concept Bottleneck Models. A Concept-Bottleneck Model (CBM) can be viewed as a composition of two models, " + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "h = f(g(x)): \\mathcal{X} \\to \\mathcal{Y}" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": ", with concept en-" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "text", + "content": "Concept Realignment in CBMs" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": "coder " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "g: \\mathcal{X} \\to \\mathcal{C}" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ", and concept-based classification head " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "f: \\mathcal{C} \\to \\mathcal{Y}" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\mathcal{X}, \\mathcal{Y}" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " denote input, class label, and concept sets, respectively. CBMs get their name from an inherently bifurcated optimization process: While the concept encoder " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "g(x)" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " is trained to predict concepts " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\hat{c} \\in \\mathbb{R}^k" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " from the concept set with " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\| \\mathcal{C} \\| = k" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " concepts given an image " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "x \\in \\mathbb{R}^d" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ", the classification head " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " is optimized to predict final target labels " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "y \\in \\mathcal{Y} \\in \\mathbb{R}^M" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " solely based on concept assignments produces by " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ". CBM training data is thus given as " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\mathcal{D} := \\{x^{(i)}, c^{(i)}, y^{(i)}\\}_{i=1}^N" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "x^{(i)}, c^{(i)}, y^{(i)}" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " are the inputs, ground-truth concepts, and ground-truth labels, respectively. Following existing works [9, 27-29], the concept encoder " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " is trained using a (weighted) binary cross-entropy loss " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "(\\mathcal{L}_{\\mathrm{concept}}(\\hat{c}, c))" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ", while the classification head " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " utilizes a cross-entropy classification objective " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "(\\mathcal{L}_{\\mathrm{task}}(\\hat{y}, y) = \\mathcal{L}_{\\mathrm{CE}}(\\hat{y}, y))" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ". Overall, there are three established schemes [9] for training CBMs: (1) Independent training: the concept encoder and classification head are trained entirely independently, with ground-truth concepts " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " provided as inputs to the classification head during training. (2) Sequential training: the concept encoder " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " is trained first, followed by the classification head " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " trained using the concepts predicted by " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ". (3) Joint training: both the concept encoder " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " and the classification head " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " are trained together using a combination of " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{concept}}" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{task}}" + }, + { + "bbox": [ + 130, + 115, + 482, + 369 + ], + "type": "text", + "content": ", respectively. In all cases, this means that the classification head leverages only information on concept (co-)occurrences to predict final class labels, making it easy to ground the final classification decision on interpretable concept assignments." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "spans": [ + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": "Concept Embedding Models. The flow of information in a CBM is bottlenecked by the set of user-defined concepts. This can potentially limit the processing capacity of the model, especially when the concepts do not contain all the information that is needed to perform the downstream task. To overcome this issue, [27] proposed Concept Embedding Models (CEMs) as a generalization of CBMs wherein every concept " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " is represented by a pair of high-dimensional vectors, " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{c}}_i^+" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{c}}_i^-" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " (as opposed to scalar concepts in CBMs). These embeddings are generated by passing " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " through concept-specific networks " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\phi_i^+" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\phi_i^-" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": ", and represent the concept being present and absent, respectively. The probability " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{p}_i" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " of the concept " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " being in " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " is then simply computed by passing " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{c}}_i^+" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{c}}_i^-" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " to a scoring function " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " as " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{p}_i = s([\\hat{\\mathbf{c}}_i^+, \\hat{\\mathbf{c}}_i^-])" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": ". Similarly, both embeddings can also be combined as " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{c}}_i = \\hat{p}_i \\hat{\\mathbf{c}}_i^+ + (1 - \\hat{p}_i) \\hat{\\mathbf{c}}_i^-" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " to parameterize a joint embedding for concept " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": ". The final concept embedding which represents the full image " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " and is passed to the classification head is then given as " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{c}} := [\\hat{\\mathbf{c}}_1, \\hat{\\mathbf{c}}_2, ..., \\hat{\\mathbf{c}}_k]" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": ". Notice the higher dimensionality, as we concatenate " + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 373, + 482, + 553 + ], + "type": "text", + "content": " concept-specific embeddings." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": "Concept Interventions. Both CBMs and CEMs allow users to intervene on concepts at test time. Concretely, starting from the concept predictions of the model, " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{c}" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": ", the user sequentially intervenes on " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "T \\leq k" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": " concepts. As a human expert has to both investigate concept predictions and compare against input data, interventions are difficult to parallelize, effectively equating concept intervention into a trajectory of " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": " concept intervention steps [20] (see also Fig. 1 for intuition). Let " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{S}_t" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": " represent the set of concepts that have been intervened on up to time " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "t \\leq T" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": ". The corresponding concept embedding at time " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": " is then given as " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\tilde{c}_t = \\{c_{\\mathcal{S}_t}, \\hat{c}_{\\backslash \\mathcal{S}_t}\\}" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "inline_equation", + "content": "c_{\\mathcal{S}_t}" + }, + { + "bbox": [ + 130, + 557, + 482, + 667 + ], + "type": "text", + "content": " denotes the ground truth values of the intervened concepts," + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": "and " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\hat{c}_{\\backslash S_t}" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " are the model's predictions of non-intervened concepts. Intervening on concepts in this way updates the final prediction of the model from " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\hat{y}" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\tilde{y} = f(\\tilde{c})" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": ". In the case of a CEM, intervening on concept " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " to update its value from " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\hat{p}_i" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "p_i" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " changes its embedding from " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{c}}_i" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\tilde{\\mathbf{c}}_i = p_i\\hat{\\mathbf{c}}_i^+ +(1 - p_i)\\hat{\\mathbf{c}}_i^-" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": ". After each intervention " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": ", we use a concept intervention policy " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\pi (\\tilde{c}_t)" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " to decide which concept to intervene on next. While " + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "inline_equation", + "content": "\\pi" + }, + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": " can simply suggest random concepts for intervention, it is often much better to leverage heuristics that rank concepts in the order of importance (by some measure). A commonly deployed policy is UCP [10, 20], which uses the uncertainty of concepts; selecting concepts with the highest uncertainty (concept predictions closest to 0.5)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 480, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 480, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 480, + 344 + ], + "type": "text", + "content": "Intervention-aware CEMs. While test-time interventions typically improve performance, this is not always guaranteed. In fact, recent works have shown that concept interventions can in some cases even hurt the model's performance [20, 28]. [29] noted that this stems from the lack of training incentive for the model to perform well under intervention. To address this, they proposed Intervention-aware CEMs (IntCEMs), which introduce interventions during the training process to improve the model's receptiveness to interventions at test time, outperforming all existing methods in the intervention setting. In particular, they train a CEM to minimize the following objective:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 136, + 363, + 480, + 388 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 363, + 480, + 388 + ], + "spans": [ + { + "bbox": [ + 136, + 363, + 480, + 388 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {I n t C E M}} (x, c, y, \\mathcal {T}) = \\mathcal {L} _ {\\text {p r e d}} (x, c, y, \\hat {c}, \\tilde {c} _ {t}) + \\lambda_ {\\text {c o n c}} \\mathcal {L} _ {\\text {c o n c}} (\\hat {c}, c) + \\lambda_ {\\text {r o l l}} \\mathcal {L} _ {\\text {r o l l}} (x, c, y, \\mathcal {T}) \\tag {1}", + "image_path": "d098874c5f7bf4b393dc7f71657ac6981171be585d473ba03901935953c9131f.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 196, + 387, + 417, + 412 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 196, + 387, + 417, + 412 + ], + "spans": [ + { + "bbox": [ + 196, + 387, + 417, + 412 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {p r e d}} (x, c, y, \\tilde {c} _ {0}, \\kappa_ {t}) = \\frac {\\mathrm {C E} (f (\\hat {c} , y) + \\gamma^ {T} \\mathrm {C E} (f (\\tilde {c} _ {t}) , y)}{1 + \\gamma^ {T}}", + "image_path": "2d2e3c7b62d6936cbb7fd3da2b27228efc28c785f56035ae071ee3401753ee30.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " is the prediction loss for " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{conc}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " the concept prediction loss, " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{roll}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " the rollout loss incentivizing the model to predict the most informative concept for intervention. " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{conc}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{roll}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " are user-defined weights corresponding to " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{conc}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " respectively, while " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\mathcal{T}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " denotes the intervention trajectory. " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{pred}}" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " penalizes the model for incorrect predictions both before and after the intervention, and " + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "inline_equation", + "content": "\\gamma \\geq 1" + }, + { + "bbox": [ + 130, + 415, + 479, + 487 + ], + "type": "text", + "content": " is a scaling term that prioritizes correct predictions after intervention." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 503, + 334, + 515 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 503, + 334, + 515 + ], + "spans": [ + { + "bbox": [ + 131, + 503, + 334, + 515 + ], + "type": "text", + "content": "3.2 Concept Intervention Realignment" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 522, + 480, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 480, + 666 + ], + "type": "text", + "content": "Previous works incrementally improve on predecessor methods by better parameterizing concept representations or introducing an intervention-aware training objective. However, all these works still treat concept interventions independently. This means that an intervention on one specific concept has no effect on the assignment of other concepts. This disregards relationships between concepts, which in practice do not occur independently (e.g., \"white wing\" and \"white belly\" are more likely to co-occur). As a result, the existing intervention process does not utilize human feedback optimally, as information about the verified existence of one concept should naturally guide the prediction of other concepts. While this aspect is naturally important to ensure that an accurate concept representation is passed to the label classifier, it is also crucial when utilizing concept-selection criteria such as UCP because intervening on one concept" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "text", + "content": "Concept Realignment in CBMs" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 114, + 465, + 216 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 465, + 216 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 465, + 216 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 465, + 216 + ], + "type": "image", + "image_path": "33c29434c9938a5ef57a9856c386ef26e2c9d946b6dad8797e20f58f53c232a8.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "lines": [ + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": "Fig. 2: Illustration of the concept intervention realignment module. Given the concept encoding " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "g(x)" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": ", we intervene on the concept " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": " selected by a concept selection policy " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "\\pi" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": ". This concept is replaced with a ground-truth (GT) value " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "(\\in \\{0,1\\}" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": " depending on whether it is present in a given image or not) to obtain " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "\\tilde{c}_t" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": " (representing intervention step " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "t \\in \\{1,\\dots,T\\}" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": "). This intervened concept representation is then passed into the concept realignment module (leveraging e.g. an MLP or LSTM reweighting mode), which outputs the realigned " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "u(\\tilde{c}_t)" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": ". To ensure that the ground-truth values provided by the user are not overwritten during realignment, " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "u(\\tilde{c}_t)" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": " retains ground-truth corrections. The final concept vector is then based into a concept-based classifier " + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 223, + 482, + 323 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 338, + 479, + 374 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 479, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 479, + 374 + ], + "type": "text", + "content": "should consequently reduce the chances of intervening on other closely related, likely co-occurring concepts, while also raising the probability that uncertain and unrelated concepts get intervened on." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": "Intervention Realignment Module. To address this, we propose a concept intervention realignment module (CIRM), which consists of two interdependent components: (a) a concept realignment model (CRM), " + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "inline_equation", + "content": "u: \\mathcal{C} \\to \\mathcal{C}" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": ". After a user intervenes on a subset of concepts " + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": ", the remaining concepts (" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\backslash S" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": ") are updated by a realigner network; and (b) an intervention policy " + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\pi" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": ". The concepts predicted by the realignment model are fed to the policy to suggest which concept to intervene on next. Both components are interdependent, and together form the overall concept intervention realignment module, as also visualized in Figure 2. The training of the full CIRM comprising both selection policy and concept realignment model aims to simulate the complete intervention process. It thus starts from the concept predictions of the base model, " + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\hat{c}" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": ", where we sequentially intervene on concepts for " + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "inline_equation", + "content": "T \\leq k" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": " time steps by following a policy of choice, " + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\pi" + }, + { + "bbox": [ + 130, + 389, + 482, + 555 + ], + "type": "text", + "content": " (in our case UCP by default, which we experimentally find to outperform random intervention significantly; See supp. §B)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": "As in §3.1, let " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "S_{t}" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": " denote the set of intervened concepts and " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\tilde{c}_{t} = \\{c_{S_{t}},\\hat{c}_{\\setminus S_{t}}\\}" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": " denote the concepts at time " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": ", respectively. At every intervention time step, we feed " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\tilde{c}_{t}" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": " to the realignment model to obtain updated concept predictions as " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\kappa_{t} = u(\\tilde{c}_{t})" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": ", which in turn are utilized by " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\pi (\\kappa_{t})" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": " to produce intervention recommendations for " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "t + 1" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": ". Finally, we train " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": " with the ground-truth labels as targets using the loss " + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "inline_equation", + "content": "\\mathcal{L}(u) = (\\sum_{t = 0}^{T}\\mathrm{CE}(u(\\tilde{c}_{t}),c)) / T" + }, + { + "bbox": [ + 130, + 557, + 482, + 629 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": "Using this simple objective, the concept realignment model " + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": " learns to take concept representations and leverage intervened concepts " + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "inline_equation", + "content": "S_{t}" + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": " to predict an updated concept distribution, i.e., " + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "inline_equation", + "content": "p(i; \\hat{c}, S_{t})" + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": ". Note that this training objective uti" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 241, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 241, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 241, + 101 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "izes standard CBM training information (i.e., concept annotations, [9, 20, 27-29]); so no additional information beyond the standard CBM pipeline is required." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "text", + "content": "The overall training pipeline can still follow the standard CBM training paradigms (see previous section), with the intervention realignment module being trained independently on top of a pre-trained frozen CBM/CEM as a posthoc realignment method, or jointly with the CBM/CEM to introduce an explicit realignment objective during training. For posthoc realignment, we first train the backbone " + }, + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "text", + "content": " and the classification head " + }, + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "text", + "content": ". Subsequently, we freeze those components and train the realignment model " + }, + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 130, + 141, + 480, + 224 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "spans": [ + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "content": "Realignment Models. As shown in Fig. 2, we parameterize our concept realignment model with a neural network " + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "content": ". To ensure that " + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "content": " does not overwrite the ground-truth concepts provided by the user, we also keep track of the already intervened concepts " + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "inline_equation", + "content": "S_{t}" + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "content": ". Using this information, we replace the output of the realigned concept embedding with the user-provided values for concepts in " + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "inline_equation", + "content": "S_{t}" + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "content": ". Hence, the final output of " + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "content": " for the " + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "inline_equation", + "content": "i^{th}" + }, + { + "bbox": [ + 130, + 241, + 479, + 312 + ], + "type": "text", + "content": " concept is given as" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 214, + 323, + 480, + 339 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 323, + 480, + 339 + ], + "spans": [ + { + "bbox": [ + 214, + 323, + 480, + 339 + ], + "type": "interline_equation", + "content": "u \\left(\\tilde {c} _ {t}, \\mathcal {S} _ {t}\\right) ^ {(i)} = v \\left(\\tilde {c} _ {t}\\right) ^ {(i)} \\quad \\text {i f} i \\notin \\mathcal {S} _ {t} \\text {e l s e} \\quad \\tilde {c} _ {t} ^ {(i)} \\tag {2}", + "image_path": "8749f4cd6af2a54f5350544290c2de566a99151f086183e78631d4ec7566f0ca.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": "Depending on the assumptions made on the realignment process, " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": " is either a simple MLP or a recurrent model (such as an LSTM [7]). The former parametrizes our default concept intervention realignment model, which only passes the set of intervened and un-intervened concepts at intervention step " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": " to the concept realignment model consisting of a simple MLP. The set of concepts fed into the MLP may either be the original concept embedding " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "\\tilde{c}_0" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": ", where all intervened concepts up to and including step " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": " have been replaced with ground-truth values, or the previously realigned " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "\\kappa_{t-1}" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": " with similarly updated intervened concepts (c.f. Fig. 2, \"GT\"). Note that in either case, " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "\\kappa_{t-1}" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": " informs the selection process of the subsequent concept to intervene on. After all interventions, the final concept embedding fed into the classifier is always " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "u(\\tilde{c}_T)" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": ". Practically, we found using " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "\\tilde{c}_t" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": " to work slightly better than " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "\\kappa_{t-1}" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": ". Both cases above however only pass the final set of concepts at time " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": " to the realignment model. Given the sequential nature of interventions, however, it may also be beneficial to account for the entire intervention history to inform future concept realignment. As a result, we also introduce a recurrent realignment variant, " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "u_{\\mathrm{rec}}" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": ", which employs an LSTM model to retain the entire history of interventions until time " + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 349, + 482, + 565 + ], + "type": "text", + "content": ". An algorithmic summary is provided in supplementary §A." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 580, + 479, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 580, + 479, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 580, + 479, + 640 + ], + "type": "text", + "content": "End-to-End Realignment. In order to jointly train the CIR module and the base model " + }, + { + "bbox": [ + 130, + 580, + 479, + 640 + ], + "type": "inline_equation", + "content": "f \\circ g" + }, + { + "bbox": [ + 130, + 580, + 479, + 640 + ], + "type": "text", + "content": ", we will perform interventions while also training the base model. This naturally combines with the IntCEM framework [29], which incorporates train-time interventions, and as such is our default choice for joint model and realignment module training." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": "Concretely, we modify IntCEMs such that after " + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": " interventions, concepts " + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\tilde{c}_t" + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": " are corrected post-intervention to obtain " + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "inline_equation", + "content": "\\kappa_t = u(\\tilde{c}_t)" + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": ", which is then fed to the" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "text", + "content": "Concept Realignment in CBMs" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 346, + 129 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 346, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 346, + 129 + ], + "type": "text", + "content": "classifier " + }, + { + "bbox": [ + 132, + 116, + 346, + 129 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 132, + 116, + 346, + 129 + ], + "type": "text", + "content": ". The new training objective, then, is:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 138, + 491, + 163 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 138, + 491, + 163 + ], + "spans": [ + { + "bbox": [ + 132, + 138, + 491, + 163 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {I n t C E M - R e A}} (x, c, y, \\mathcal {T}) = \\mathcal {L} _ {\\text {p r e d}} (x, c, y, \\tilde {c} _ {0}, \\kappa_ {t}) + \\lambda_ {\\text {c o n c}} \\mathcal {L} _ {\\text {c o n c - R e A}} (\\hat {c}, c, \\kappa_ {0}, \\kappa_ {t}) + \\lambda_ {\\text {r o l l}} \\mathcal {L} _ {\\text {r o l l}} \\tag {3}", + "image_path": "a19d45fc4b967b51ec4ab6cdeb9181da00bacbb5f4d749b10f245c8b9bc536e5.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 171, + 481, + 198 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 171, + 481, + 198 + ], + "spans": [ + { + "bbox": [ + 159, + 171, + 481, + 198 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {c o n c - R e A}} (\\hat {c}, c, \\kappa_ {0}, \\kappa_ {t}) = \\frac {1}{2} \\left(\\mathcal {L} _ {\\text {c o n c}} (\\hat {c}, c) + \\frac {\\mathrm {C E} (\\kappa_ {0} , c) + \\gamma^ {T} \\mathrm {C E} (\\kappa_ {T} , c)}{1 + \\gamma^ {T}}\\right) \\tag {4}", + "image_path": "71c5c618005316af979cdd6ef97ad3e2d8f94e449fa3ba7794509bc5976ea1c3.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{conc - ReA}}" + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "content": " is the modified concept prediction loss which trains both the backbone " + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "inline_equation", + "content": "g" + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "content": " of the base model (first term) as well as the CRM (second term). We use the same " + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "content": " as in " + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{pred}}" + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "content": " to prioritize correct predictions by the CRM after intervention, and the same " + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{conc}}" + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "inline_equation", + "content": "\\lambda_{\\mathrm{roll}}" + }, + { + "bbox": [ + 132, + 202, + 481, + 251 + ], + "type": "text", + "content": " as in Eq. 1." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 269, + 230, + 283 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 269, + 230, + 283 + ], + "spans": [ + { + "bbox": [ + 132, + 269, + 230, + 283 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 295, + 228, + 306 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 295, + 228, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 295, + 228, + 306 + ], + "type": "text", + "content": "4.1 Preliminaries" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": "Datasets & Implementation. We perform experiments on three datasets: (1) Caltech-UCSD Birds-200-2011 (CUB) [22] containing " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "n = 11,788" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " bird images over 200 classes. Following the original CBM paper [9], we use 112 concepts grouped into 28 concept groups with the same splits. (2) Large-scale CelebFaces Attributes (CelebA) [11] contains over 200,000 celebrity images annotated with 40 attribute labels, including noisy characteristics such as gender and age. Following [27, 29], we use only the most balanced 8 concepts in our experiments, resulting in " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "2^8 = 256" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " classes. (3) Animals with Attributes 2 (AwA2) [23] is a collection of " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "n = 37,322" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " animal images over 50 classes annotated with 85 attributes such as species, color, and behavior. We perform experiments on CEMs, IntCEMs, and three types of CBMs (sequential, independent, and joint). For all models and datasets, we follow the hyperparameters used in [29]. During CIRM training, we sequentially intervene on concepts " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "T = k" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " times. By default, we use UCP both during training and inference, and if not stated otherwise, use a multi-layered perceptron (MLP) for concept realignment. We use the predictions of the base CBM " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "(\\tilde{c}_t)" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " as its input for un-intervened concept representations. We perform a small, standard hyperparameter using Optuna [1] with 50 trials to search over the number of hidden layers " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "\\in \\{1,2,3\\}" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " and units " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "\\in \\{k,2k,k/2\\}" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": ", the learning rate " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "\\in [10^{-5},10^{-1}]" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " and weight decay " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "\\in [10^{-6},5\\times 10^{-5}]" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": ", and use the same batch size as used to train the base model. We employ early stopping and learning rate decay on the validation loss. For joint training, we instantiate the realigner MLP 2 hidden layers containing " + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 132, + 315, + 482, + 591 + ], + "type": "text", + "content": " neurons each. Experiments are conducted using PyTorch [16]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 609, + 427, + 621 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 427, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 427, + 621 + ], + "type": "text", + "content": "4.2 Concept Realignment Improves Intervention Efficacy" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 629, + 481, + 666 + ], + "type": "text", + "content": "To probe the efficacy of our concept intervention realignment module, we evaluate both the change in concept prediction loss as well as overall classification accuracy as a function of intervened concept counts. These are visualized in Fig. 3" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 246, + 204 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 246, + 204 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 246, + 204 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 246, + 204 + ], + "type": "image", + "image_path": "4f0634b52f39203f76a68198ceb304cfe9f5fec82fff6ba0d854d8e259213ad2.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 209, + 480, + 232 + ], + "lines": [ + { + "bbox": [ + 131, + 209, + 480, + 232 + ], + "spans": [ + { + "bbox": [ + 131, + 209, + 480, + 232 + ], + "type": "text", + "content": "Fig. 3: Concept prediction loss vs. the number of intervened concepts with and without concept realignment. Concept realignment consistently improves concept predictions." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 248, + 114, + 359, + 204 + ], + "blocks": [ + { + "bbox": [ + 248, + 114, + 359, + 204 + ], + "lines": [ + { + "bbox": [ + 248, + 114, + 359, + 204 + ], + "spans": [ + { + "bbox": [ + 248, + 114, + 359, + 204 + ], + "type": "image", + "image_path": "f62223b8209a4f0f8fd56d81b60e5bb2c3eab76b34eb28cf83cf3b2b855ab6b0.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 361, + 114, + 478, + 204 + ], + "blocks": [ + { + "bbox": [ + 361, + 114, + 478, + 204 + ], + "lines": [ + { + "bbox": [ + 361, + 114, + 478, + 204 + ], + "spans": [ + { + "bbox": [ + 361, + 114, + 478, + 204 + ], + "type": "image", + "image_path": "911a49d89a8e0493cbd5434042f13c8f7828b6aef23126feebea0f4fa21025ff.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 144, + 237, + 249, + 322 + ], + "blocks": [ + { + "bbox": [ + 144, + 237, + 249, + 322 + ], + "lines": [ + { + "bbox": [ + 144, + 237, + 249, + 322 + ], + "spans": [ + { + "bbox": [ + 144, + 237, + 249, + 322 + ], + "type": "image", + "image_path": "486fc9e937013077583530908d787db2c06008e1fdc9cc2db782cb5aea8f54c8.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 328, + 480, + 351 + ], + "lines": [ + { + "bbox": [ + 131, + 328, + 480, + 351 + ], + "spans": [ + { + "bbox": [ + 131, + 328, + 480, + 351 + ], + "type": "text", + "content": "Fig. 4: Classification accuracy vs. the number of intervened concepts with and without concept realignment. Realignment consistently improves classification accuracy." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 252, + 238, + 357, + 322 + ], + "blocks": [ + { + "bbox": [ + 252, + 238, + 357, + 322 + ], + "lines": [ + { + "bbox": [ + 252, + 238, + 357, + 322 + ], + "spans": [ + { + "bbox": [ + 252, + 238, + 357, + 322 + ], + "type": "image", + "image_path": "ac7c9c8bca790519b78d922e3b55ed9064743009e776501e5b4e4f686c7cec7e.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 359, + 239, + 465, + 322 + ], + "blocks": [ + { + "bbox": [ + 359, + 239, + 465, + 322 + ], + "lines": [ + { + "bbox": [ + 359, + 239, + 465, + 322 + ], + "spans": [ + { + "bbox": [ + 359, + 239, + 465, + 322 + ], + "type": "image", + "image_path": "d5efa0ab317140b1f17a19f70be107ae1fb51b1f46fffdaa9125fd5165cab9d9.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 368, + 482, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 368, + 482, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 368, + 482, + 489 + ], + "type": "text", + "content": "and Fig. 4 for sequentially trained CBMs (see §3.1), respectively, for all benchmark test sets - CUB, CelebA and AwA2. Note that for AwA2, we only show the first 50 interventions for visual clarity, as performance beyond that heavily plateaus since sufficient concepts have been intervened on to perfectly solve the test data. Table 1 numerically summarizes these results via AUC scores and provides additional scores for independently trained CBMs, jointly trained CBMs as well as Concept Embedding Models (CEMs). Runs in Tab. 1 & Figs. 3, 4 all utilize the stronger UCP selection policy as opposed to the weaker random selection policy (\\$B) to measure intervention efficacy at the highest level, and train the concept realignment module on top of already trained concept models." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "text", + "content": "Improved concept attribution through intervention. Across all datasets, we can observe a consistent, in parts vast reduction in concept prediction loss, which measures the correct assignment of concepts for each input (using the concept loss described in §3.1). For example on CUB, a tenfold reduction of the original unintervened concept loss (" + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sim 0.6" + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sim 0.06" + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "text", + "content": ") can be achieved with half the number of interventions (11 with concept realignment, 23 without). This effect becomes even more prevalent on AwA2, where a tenfold reduction (" + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sim 0.17 \\rightarrow \\sim 0.017" + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "text", + "content": ") is achieved after around 16 interventions with realignment versus more than 60 without; marking a more than " + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "inline_equation", + "content": "70\\%" + }, + { + "bbox": [ + 131, + 510, + 482, + 666 + ], + "type": "text", + "content": " reduction in intervention efforts. This is also reflected in Tab. 1, where concept loss AUC drops by in parts more than half for CUB and from 4.26 to 1.13 on AwA2. We find this significant improvement in concept attribution persists across all CBMs and CEMs, as well as random seed initializations (see Supp. Tab. 2 and 3)" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "text", + "content": "Concept Realignment in CBMs" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 162, + 175, + 440, + 277 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Area Under Curve (AUC) of Concept Prediction Loss and Classification Accuracy with/without CIRM (non-averaged sum). We use the same backbone throughout. CIRM improves performance across all models and datasets. Intervention curves share long saturation plateaus for high intervention counts. Accuracy AUC scores are thus saturated, and best combined with performance graphs in Figs. 3, 4." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 162, + 175, + 440, + 277 + ], + "lines": [ + { + "bbox": [ + 162, + 175, + 440, + 277 + ], + "spans": [ + { + "bbox": [ + 162, + 175, + 440, + 277 + ], + "type": "table", + "html": "
Base ModelRealignedConcept LossAUC ↓Accuracy AUC ↑
CUBCelebAAwA2CUBCelebAAwA2
Sequential CBM×6.711.594.262460.8280.78364.0
✓3.151.521.132510.9284.38397.6
Independent CBM×6.711.594.262653.4280.28403.4
✓3.151.521.132678.3282.18437.0
Joint CBM×5.933.064.772580.3273.18276.4
✓3.671.761.482609.0273.98327.4
CEM×5.991.614.902521.4396.38429.3
✓3.201.461.692558.4400.18433.9
", + "image_path": "ce4d13cd17820686fc40204ba4309e4d99d20c69b666717f43c362146ab5f05b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 291, + 482, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 291, + 482, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 291, + 482, + 434 + ], + "type": "text", + "content": "We do find that for CelebA with a much more restrictive concept bottleneck than e.g. CUB and AwA2, due to significantly fewer (note that in CUB concepts are already grouped, see §4.1) and noisier concepts, that the overall gain in concept accuracy is smaller. This is also reflected in the notably weaker performance of the base CBM (c.f. Fig. 4, middle - less than " + }, + { + "bbox": [ + 130, + 291, + 482, + 434 + ], + "type": "inline_equation", + "content": "38\\%" + }, + { + "bbox": [ + 130, + 291, + 482, + 434 + ], + "type": "text", + "content": " accuracy when intervening on all concepts), which strongly points towards overall insufficient concept information provided in the CelebA training data. Overall, however, we find very clear evidence that the concept intervention realignment module allows practitioners to leverage human intervention feedback to a much larger extent to attribute the correct concepts to respective inputs. This means that the subsequent classifier will operate on a much more accurate set of concepts, thereby improving the overall interpretability of the final classification decision." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": "Improved overall classification through intervention. On top of that, we also find that the significant gain in intervention efficacy on a concept attribution level also translates to subsequent gains in intervention efficacy for the overall classification performance (Fig. 4). For example on CUB, the final classification accuracy after intervening on all concepts is " + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "inline_equation", + "content": "93.9\\%" + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": ", which is achieved already after " + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sim 16" + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": " intervention steps. A comparable performance without concept intervention realignment requires nearly complete, " + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sim 24" + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": " intervention steps, marking a " + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": " increase. The same can be seen on CelebA and AwA2 as well, where the upper-bound performance can be achieved with much fewer interventions (particularly without the need to intervene on all concepts). Even intermediate performance targets are achieved much earlier; a classification accuracy target of e.g. " + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "inline_equation", + "content": "98\\%" + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": " on AwA2 requires only 12 concept interventions with realignment, while the non-aligned baseline needs 19 interventions on average. We find these results to be also reflected numerically in Tab 1, where accuracy AUC increases from e.g. 2460.8 to 2510.9 on CUB. We do point towards high numerical saturation given the larger performance plateaus at higher intervention counts, and high starting accuracies (e.g. " + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sim 90\\%" + }, + { + "bbox": [ + 130, + 450, + 482, + 666 + ], + "type": "text", + "content": " on AwA2). Numerical results are thus best considered alongside the intervention trajectories in Figs. 3 and 4." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 240, + 102 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 182, + 114, + 303, + 211 + ], + "blocks": [ + { + "bbox": [ + 182, + 114, + 303, + 211 + ], + "lines": [ + { + "bbox": [ + 182, + 114, + 303, + 211 + ], + "spans": [ + { + "bbox": [ + 182, + 114, + 303, + 211 + ], + "type": "image", + "image_path": "d0023cba8915d0aeb0c3f19f15cf338dddf16c3b508b03f58e37dc129c855dfc.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 236, + 214, + 248, + 224 + ], + "lines": [ + { + "bbox": [ + 236, + 214, + 248, + 224 + ], + "spans": [ + { + "bbox": [ + 236, + 214, + 248, + 224 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 304, + 114, + 429, + 212 + ], + "blocks": [ + { + "bbox": [ + 304, + 114, + 429, + 212 + ], + "lines": [ + { + "bbox": [ + 304, + 114, + 429, + 212 + ], + "spans": [ + { + "bbox": [ + 304, + 114, + 429, + 212 + ], + "type": "image", + "image_path": "67da66eb9ebfa1e49919a178026db1dd117bbefb3c6d1cb9020bcd80a44e1655.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 361, + 214, + 374, + 224 + ], + "lines": [ + { + "bbox": [ + 361, + 214, + 374, + 224 + ], + "spans": [ + { + "bbox": [ + 361, + 214, + 374, + 224 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 228, + 480, + 273 + ], + "lines": [ + { + "bbox": [ + 131, + 228, + 480, + 273 + ], + "spans": [ + { + "bbox": [ + 131, + 228, + 480, + 273 + ], + "type": "text", + "content": "Fig. 5: Concept Intervention Realignment in intervention-aware CEMs. (a) Concept prediction loss and (b) classification accuracy with jointly and post-hoc trained CIRMs. In both cases, significant benefits can be seen, especially for correct concept attribution after intervention - both for jointly and posthoc trained realignment modules." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 287, + 480, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 287, + 480, + 348 + ], + "spans": [ + { + "bbox": [ + 131, + 287, + 480, + 348 + ], + "type": "text", + "content": "Together, our experiments provide strong evidence that concept intervention realignment is crucial to best leverage human feedback in concept-based decision systems; allowing to significantly reduce intervention budgets by in parts over " + }, + { + "bbox": [ + 131, + 287, + 480, + 348 + ], + "type": "inline_equation", + "content": "70\\%" + }, + { + "bbox": [ + 131, + 287, + 480, + 348 + ], + "type": "text", + "content": " to achieve a desired target performance. These gains can also be achieved after concept models have been trained, allowing for versatile applicability." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 367, + 440, + 380 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 367, + 440, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 367, + 440, + 380 + ], + "type": "text", + "content": "4.3 Intervention Realignment for Intervention-aware CEMs" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 389, + 480, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 480, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 480, + 449 + ], + "type": "text", + "content": "In this section, we investigate training the CIRM during the training process of an already intervention-regularized concept model; namely the recently proposed, state-of-the-art intervention-aware CEM [29] (see also §3.1). Following the objective described in Eq. 3, we operate and train the concept intervention module in conjunction with the intervention objective proposed by [29]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 450, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 450, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 450, + 481, + 666 + ], + "type": "text", + "content": "Our results are shown in Fig. 5. First, we find that explicit concept intervention realignment can significantly improve correct concept attribution, even in intervention-aware training setups (c.f. Fig. 5a). While not as significant as improvements over standard CBM models, for specific target concept prediction losses (such as a fivefold reduction from 0.5 to 0.1), half the number of intervention steps are needed (11 versus 20). The improved concept attribution is also reflected in higher intervention accuracies as seen in Fig. 5b, albeit the overall (still notable!) improvement is less reflective of the significant gains on a concept level (additional results can be found in supp. §C). Overall, however, our experiments highlight that even when applied to state-of-the-art approaches that specifically simulate the intervention process during training, improved intervention efficacy can be found. Importantly, the consistently significant improvements on a concept attribution level mean that classification decisions are much better grounded on correct concept attributions, which is crucial for interpretability [9, 27] of classification results. Finally, we find that concept intervention realignment can be applied both as a regularization mechanism during training, as well as adapted entirely posthoc, while still offering consistent benefits. This supports the high versatility of CIRMs as a general-purpose tool to increase intervention efficacy." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 320, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 320, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 320, + 91, + 447, + 102 + ], + "type": "text", + "content": "Concept Realignment in CBMs" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 182, + 115, + 304, + 209 + ], + "blocks": [ + { + "bbox": [ + 182, + 115, + 304, + 209 + ], + "lines": [ + { + "bbox": [ + 182, + 115, + 304, + 209 + ], + "spans": [ + { + "bbox": [ + 182, + 115, + 304, + 209 + ], + "type": "image", + "image_path": "9a6d418ed986b3afd0c8682ab92ced1bdab24833cb6a560c23e225f3a1005c8d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 237, + 213, + 249, + 222 + ], + "lines": [ + { + "bbox": [ + 237, + 213, + 249, + 222 + ], + "spans": [ + { + "bbox": [ + 237, + 213, + 249, + 222 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 307, + 114, + 428, + 210 + ], + "blocks": [ + { + "bbox": [ + 307, + 114, + 428, + 210 + ], + "lines": [ + { + "bbox": [ + 307, + 114, + 428, + 210 + ], + "spans": [ + { + "bbox": [ + 307, + 114, + 428, + 210 + ], + "type": "image", + "image_path": "b4e038a43eb1cf321afef6c8c4ce618c608e622ccfb857c6c20ec581211fc8d5.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 361, + 213, + 374, + 221 + ], + "lines": [ + { + "bbox": [ + 361, + 213, + 374, + 221 + ], + "spans": [ + { + "bbox": [ + 361, + 213, + 374, + 221 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 224, + 482, + 269 + ], + "lines": [ + { + "bbox": [ + 130, + 224, + 482, + 269 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 482, + 269 + ], + "type": "text", + "content": "Fig. 6: (a) Concept prediction loss and (b) classification accuracy for various realigner architectures alongside UCP policy. Using an MLP with concept predictions of the base model works better than compounding refinements and accounting for intervention trajectories using LSTMs." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 283, + 318, + 295 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 283, + 318, + 295 + ], + "spans": [ + { + "bbox": [ + 132, + 283, + 318, + 295 + ], + "type": "text", + "content": "4.4 Realignment Module Ablations" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "text", + "content": "**Realignment Model Architectures.** In this section, we study the effect of various design choices for the realignment module along two dimensions: (1) Recurrent vs. Feedforward Networks: Since we intervene on concepts sequentially, it is possible that the realignment module can benefit from the overall order and history of interventions to make more accurate concept predictions. To do this, we instantiate the concept realignment network using an LSTM [7]. We compare this against our default MLP. (2) Previous Output vs. Original Concepts: By default, the realignment module takes as input a combination of ground-truth concepts provided by the user and values predicted by the base model at " + }, + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "inline_equation", + "content": "t = 0" + }, + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "text", + "content": " for the concepts that have not been intervened on (see also §3.2). Due to the sequential nature of interventions, one may also directly feed the output of the realignment module at time " + }, + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "inline_equation", + "content": "t - 1" + }, + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "text", + "content": " as input to it at time " + }, + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 304, + 482, + 520 + ], + "type": "text", + "content": " in order to compound the refinements over multiple time steps. Combining both axes results in four recombinations, which we compare in Fig. 6. As can be seen, there is limited gain when accounting for the complete intervention history using an LSTM realigner network. Similarly, we find that applying the MLP primarily for concept selection alongside UCP and as final input to the classification head works better than compounding refinements over intervention steps." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Intervention Policy Transfer. In this section, we study the importance of aligning intervention policies used during training with those deployed at test time. In particular, we operate on the base setup, which deploys the CBM and the concept intervention realignment module using only the much weaker random intervention policy at test time. However, we change the policy used to train the concept intervention realignment module. Our results are visualized in Fig. 7. As can be seen, while a realignment module trained with UCP can still be effective when deployed with a random intervention policy, it is notably outperformed by the weaker random policy at test-time when the realignment module has been trained on the same random policy as well. This means that the realignment module adapts to the selection policy used during training. Thus to get the" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 181, + 114, + 304, + 209 + ], + "blocks": [ + { + "bbox": [ + 181, + 114, + 304, + 209 + ], + "lines": [ + { + "bbox": [ + 181, + 114, + 304, + 209 + ], + "spans": [ + { + "bbox": [ + 181, + 114, + 304, + 209 + ], + "type": "image", + "image_path": "52cf06560caf640256b950a2fc1a6977539bf0c9d5315954bbca7e1779e9abc8.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 215, + 480, + 248 + ], + "lines": [ + { + "bbox": [ + 131, + 215, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 131, + 215, + 480, + 248 + ], + "type": "text", + "content": "Fig. 7: Concept prediction loss and classification accuracy under random interventions for realignment modules trained with random and UCP policy, respectively. Results indicate that alignment of policy used during training and deployment is important." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 307, + 114, + 429, + 210 + ], + "blocks": [ + { + "bbox": [ + 307, + 114, + 429, + 210 + ], + "lines": [ + { + "bbox": [ + 307, + 114, + 429, + 210 + ], + "spans": [ + { + "bbox": [ + 307, + 114, + 429, + 210 + ], + "type": "image", + "image_path": "da9a1db1716396b83a3db4550b393b719586353de477d3ef39a3a30cd99c0074.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 261, + 479, + 285 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 261, + 479, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 479, + 285 + ], + "type": "text", + "content": "most benefits out of concept intervention realignment, selection policies should align during training and deployment." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "text", + "content": "Alignment " + }, + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "inline_equation", + "content": "b / w" + }, + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "text", + "content": " Realignment Module Components. Finally, we study how important the alignment between the concept realignment model and intervention policy (i.e., UCP) is to form the overall concept intervention realignment module. To accomplish this, we employ two module variations: (a) an original policy denoted as " + }, + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "inline_equation", + "content": "\\pi (\\hat{c}_0)" + }, + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "text", + "content": ", which only applies the UCP criterion to the original concept predictions generated by the base model without any concept realignment (i.e., the policy does not change over time), and (b) our default setup (updated policy), which informs the intervention policy using realigned concept values " + }, + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "inline_equation", + "content": "(\\pi (\\kappa_{t}))" + }, + { + "bbox": [ + 132, + 296, + 333, + 474 + ], + "type": "text", + "content": ". Note that in both cases, the clas" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 475, + 480, + 546 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 475, + 480, + 546 + ], + "spans": [ + { + "bbox": [ + 130, + 475, + 480, + 546 + ], + "type": "text", + "content": "sification head still receives realigned concept embeddings, as we only want to study the importance of alignment between the concept realignment model and the intervention policy. Results in Fig. 8 clearly reveal that while simple realignment on its own can already help improve intervention efficacy, much larger efficacy gains are unlocked when both policy and the realignment model are utilized in conjunction." + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 340, + 303, + 479, + 416 + ], + "blocks": [ + { + "bbox": [ + 340, + 303, + 479, + 416 + ], + "lines": [ + { + "bbox": [ + 340, + 303, + 479, + 416 + ], + "spans": [ + { + "bbox": [ + 340, + 303, + 479, + 416 + ], + "type": "image", + "image_path": "d2f209a2642fc7f42f49ae445509a5a341202a944b53480c701fd1a198f9ffff.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 339, + 423, + 482, + 467 + ], + "lines": [ + { + "bbox": [ + 339, + 423, + 482, + 467 + ], + "spans": [ + { + "bbox": [ + 339, + 423, + 482, + 467 + ], + "type": "text", + "content": "Fig. 8: Classification accuracy vs concept interv. counts, showing our updated selection policies improving over the static one." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 557, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 665 + ], + "type": "text", + "content": "A Closer Look at Concept Realignment. To understand the impact of the realignment process qualitatively, we also provide examples in Fig. 9. In this figure, we showcase the impact of interventions on the top 10 concepts with the highest prediction errors, and the specific number of interventions required to predict the correct label. For both examples, we find that intervention on a single concept is insufficient to flip incorrect class predictions. However, as we intervene on more concepts, we can clearly see that concept realignment jointly allows concept prediction error - even on the initially worst predicted concepts - to be significantly reduced, while also reaching correct image classification with" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 320, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 320, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 320, + 91, + 447, + 102 + ], + "type": "text", + "content": "Concept Realignment in CBMs" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 478, + 266 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 478, + 266 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 478, + 266 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 478, + 266 + ], + "type": "image", + "image_path": "dbf23b4fe5e321f8ccfe216749dce3c58e1b62f554bd188fe0786dfd00d96031.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 273, + 482, + 329 + ], + "lines": [ + { + "bbox": [ + 130, + 273, + 482, + 329 + ], + "spans": [ + { + "bbox": [ + 130, + 273, + 482, + 329 + ], + "type": "text", + "content": "Fig. 9: Examples for the improved intervention efficiency of CIRM. We show the change in concept prediction errors of the ten worst predicted concepts, as a function of concept intervention steps " + }, + { + "bbox": [ + 130, + 273, + 482, + 329 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 273, + 482, + 329 + ], + "type": "text", + "content": ": concept realignment allows concept error even for strongly mispredicted concepts to be significantly reduced with interventions, achieving correct label classification after much fewer interventions compared to non-realigned baselines." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 339, + 482, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 339, + 482, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 339, + 482, + 376 + ], + "type": "text", + "content": "in parts less than half the number of interventions (for Crested Auklet). These results conceptually support the quantitative benefits of concept realignment seen in previous benchmark experiments." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 390, + 220, + 403 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 390, + 220, + 403 + ], + "spans": [ + { + "bbox": [ + 132, + 390, + 220, + 403 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 413, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 544 + ], + "type": "text", + "content": "In this work, we identify the independent treatment of concepts during test-time interventions in CBMs as a cause for reduced intervention efficacy. To remedy this problem, we propose a concept intervention realignment module - a simple and lightweight technique to automatically update concept assignments after human intervention on one or multiple concepts. Our experiments demonstrate significant gains in concept attribution as well as overall classification accuracy of concept-based models under intervention. We show that our approach is versatile and can be applied to a wide range of concept-based models, intervention policies, and training schemes. We believe that the reduction in required human interventions to reach performance targets facilitates the practical deployment of concept-based models even in resource-constrained environments." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 559, + 247, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 559, + 247, + 574 + ], + "spans": [ + { + "bbox": [ + 132, + 559, + 247, + 574 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Karsten Roth and Jae Myung Kim thank the European Laboratory for Learning and Intelligent Systems (ELLIS) PhD program and the International Max Planck Research School for Intelligent Systems (IMPRS-IS) for support. This work was supported by DFG project number 276693517, by BMBF FKZ: 01IS18039A, by the ERC (853489 - DEXIM), by EXC number 2064/1 - project number 390727645. The authors would like to thank Shyamgopal Karthik and Leander Gerrbach for their helpful feedback on the manuscript." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 241, + 102 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 198, + 127 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 139, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 139, + 481, + 183 + ], + "type": "text", + "content": "1. Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: A next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. pp. 2623-2631 (2019) 8" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 184, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 481, + 216 + ], + "type": "text", + "content": "2. Alvarez Melis, D., Jaakkola, T.: Towards robust interpretability with self-explaining neural networks. Advances in neural information processing systems 31 (2018) 3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 217, + 481, + 249 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 481, + 249 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 481, + 249 + ], + "type": "text", + "content": "3. Chauhan, K., Tiwari, R., Freyberg, J., Shenoy, P., Dvijotham, K.: Interactive concept bottleneck models. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 5948-5955 (2023) 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 250, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 250, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 250, + 481, + 293 + ], + "type": "text", + "content": "4. Durán, J.M., Jongsma, K.R.: Who is afraid of black box algorithms? on the epistemological and ethical basis of trust in medical ai. Journal of Medical Ethics 47(5), 329-335 (2021). https://doi.org/10.1136/medethics-2020-106820, https://jme.bmj.com/content/47/5/329 1" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 293, + 399, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 293, + 399, + 304 + ], + "spans": [ + { + "bbox": [ + 138, + 293, + 399, + 304 + ], + "type": "text", + "content": "5. EUGDPR: Gdpr. general data protection regulation (2017) 1" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 304, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 304, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 138, + 304, + 481, + 336 + ], + "type": "text", + "content": "6. Havasi, M., Parbhoo, S., Doshi-Velez, F.: Addressing leakage in concept bottle-neck models. Advances in Neural Information Processing Systems 35, 23386-23397 (2022) 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 337, + 481, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 481, + 358 + ], + "type": "text", + "content": "7. Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural computation 9(8), 1735-1780 (1997) 7, 12" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 359, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 359, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 138, + 359, + 481, + 413 + ], + "type": "text", + "content": "8. Kim, E., Jung, D., Park, S., Kim, S., Yoon, S.: Probabilistic concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 16521-16540. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/kim23g.html 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 414, + 481, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 414, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 414, + 481, + 446 + ], + "type": "text", + "content": "9. Koh, P.W., Nguyen, T., Tang, Y.S., Mussmann, S., Pierson, E., Kim, B., Liang, P.: Concept bottleneck models. In: International conference on machine learning. pp. 5338-5348. PMLR (2020) 1, 2, 3, 4, 7, 8, 11" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 447, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 447, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 447, + 481, + 468 + ], + "type": "text", + "content": "0. Lewis, D.D., Catlett, J.: Heterogeneous uncertainty sampling for supervised learning. In: Machine learning proceedings 1994, pp. 148-156. Elsevier (1994) 5" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 469, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 469, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 138, + 469, + 481, + 500 + ], + "type": "text", + "content": "1. Liu, Z., Luo, P., Wang, X., Tang, X.: Deep learning face attributes in the wild. In: Proceedings of the IEEE international conference on computer vision. pp. 3730-3738 (2015) 3, 8" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 501, + 481, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 501, + 481, + 523 + ], + "spans": [ + { + "bbox": [ + 138, + 501, + 481, + 523 + ], + "type": "text", + "content": "2. Mahinpei, A., Clark, J., Lage, I., Doshi-Velez, F., Pan, W.: Promises and pitfalls of black-box concept learning models. arXiv preprint arXiv:2106.13314 (2021) 3" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 481, + 555 + ], + "type": "text", + "content": "3. Marconato, E., Passerini, A., Teso, S.: Glancenets: Interpretable, leak-proof concept-based models. Advances in Neural Information Processing Systems 35, 21212-21227 (2022) 3" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 555, + 481, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 555, + 481, + 587 + ], + "spans": [ + { + "bbox": [ + 138, + 555, + 481, + 587 + ], + "type": "text", + "content": "4. Margeloiu, A., Ashman, M., Bhatt, U., Chen, Y., Jamnik, M., Weller, A.: Do concept bottleneck models learn as intended? arXiv preprint arXiv:2105.04289 (2021) 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 588, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 588, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 588, + 481, + 621 + ], + "type": "text", + "content": "5. Oikarinen, T., Das, S., Nguyen, L.M., Weng, T.W.: Label-free concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 621, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 481, + 665 + ], + "type": "text", + "content": "6. Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., Kopf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., Fang, L., Bai, J., Chintala, S.: Pytorch: An imperative style, high-performance deep learning library. In: Advances" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 319, + 91, + 447, + 102 + ], + "type": "text", + "content": "Concept Realignment in CBMs" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 481, + 587 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 149, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 149, + 117, + 480, + 149 + ], + "type": "text", + "content": "in Neural Information Processing Systems 32, pp. 8024-8035. Curran Associates, Inc. (2019), http://papers.neurips.cc/paper/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf 8" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 192 + ], + "type": "text", + "content": "17. Piano, S.L.: Ethical principles in machine learning and artificial intelligence: cases from the field and possible ways forward. Palgrave Communications 7(1), 1-7 (2020), https://EconPapers.repec.org/RePEc:pal:palcom:v:7:y:2020:i:1:d:10.1057_s41599-020-0501-9_1" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 194, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 481, + 215 + ], + "type": "text", + "content": "18. Sawada, Y., Nakamura, K.: Concept bottleneck model with additional unsupervised concepts. IEEE Access 10, 41758-41765 (2022) 3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 216, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 216, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 216, + 481, + 248 + ], + "type": "text", + "content": "19. Sheth, I., Rahman, A.A., Sevyeri, L.R., Havaei, M., Kahou, S.E.: Learning from uncertain concepts via test time interventions. In: Workshop on Trustworthy and Socially Responsible Machine Learning, NeurIPS 2022 (2022) 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 481, + 313 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 313 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 313 + ], + "type": "text", + "content": "20. Shin, S., Jo, Y., Ahn, S., Lee, N.: A closer look at the intervention procedure of concept bottleneck models. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 202, pp. 31504-31520. PMLR (23-29 Jul 2023), https://proceedings.mlr.press/v202/ shin23a.html 2, 3, 4, 5, 7" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 315, + 481, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 335 + ], + "type": "text", + "content": "21. Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: Automated decisions and the gdpr (2018) 1" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "text", + "content": "22. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) 2, 3, 8" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 358, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 390 + ], + "type": "text", + "content": "23. Xian, Y., Lampert, C.H., Schiele, B., Akata, Z.: Zero-shot learning—a comprehensive evaluation of the good, the bad and the ugly. IEEE transactions on pattern analysis and machine intelligence 41(9), 2251-2265 (2018) 3, 8" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 391, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 391, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 391, + 481, + 413 + ], + "type": "text", + "content": "24. Xu, X., Qin, Y., Mi, L., Wang, H., Li, X.: Energy-based concept bottleneck models. In: The Twelfth International Conference on Learning Representations (2023) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 413, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 481, + 456 + ], + "type": "text", + "content": "25. Yang, Y., Panagopoulou, A., Zhou, S., Jin, D., Callison-Burch, C., Yatskar, M.: Language in a bottle: Language model guided concept bottlenecks for interpretable image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19187-19197 (2023) 3" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 457, + 481, + 478 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 478 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 478 + ], + "type": "text", + "content": "26. Yuksekgonul, M., Wang, M., Zou, J.: Post-hoc concept bottleneck models. In: The Eleventh International Conference on Learning Representations (2022) 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 511 + ], + "type": "text", + "content": "27. Zarlenga, M.E., Barbiero, P., Ciravegna, G., Marra, G., Giannini, F., Diligenti, M., Shams, Z., Precioso, F., Melacci, S., Weller, A., et al.: Concept embedding models. arXiv preprint arXiv:2209.09056 (2022) 1, 2, 3, 4, 7, 8, 11" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 481, + 544 + ], + "type": "text", + "content": "28. Zarlenga, M.E., Barbiero, P., Shams, Z., Kazhdan, D., Bhatt, U., Weller, A., Jamnik, M.: Towards robust metrics for concept representation evaluation. arXiv preprint arXiv:2301.10367 (2023) 4, 5, 7" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 544, + 481, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 544, + 481, + 587 + ], + "spans": [ + { + "bbox": [ + 132, + 544, + 481, + 587 + ], + "type": "text", + "content": "29. Zarlenga, M.E., Collins, K.M., Dvijotham, K.D., Weller, A., Shams, Z., Jamnik, M.: Learning to receive help: Intervention-aware concept embedding models. In: Thirty-seventh Conference on Neural Information Processing Systems (2023) 1, 2, 3, 4, 5, 7, 8, 11" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 240, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 240, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 240, + 101 + ], + "type": "text", + "content": "Singhi et al., 2024" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_content_list.json b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..8cdba20b9304f5dca0a0e891959242df4a96fab8 --- /dev/null +++ b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_content_list.json @@ -0,0 +1,1947 @@ +[ + { + "type": "text", + "text": "Improving Knowledge Distillation via Regularizing Feature Direction and Norm", + "text_level": 1, + "bbox": [ + 217, + 140, + 785, + 184 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yuzhu Wang $^{1}$ , Lechao Cheng $^{2\\boxtimes}$ , Manni Duan $^{1}$ , Yongheng Wang $^{1}$ , Zunlei Feng $^{3}$ , and Shu Kong $^{4,5,6}$", + "bbox": [ + 263, + 210, + 738, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Zhejiang Lab $^{2}$ Hefei University of Technology $^{3}$ Zhejiang University $^{4}$ University of Macau $^{5}$ Institute of Collaborative Innovation $^{6}$ Texas A&M University https://github.com/WangYZ1608/Knowledge-Distillation-via-ND", + "bbox": [ + 215, + 253, + 787, + 297 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Knowledge distillation (KD) is a particular technique of model compression that exploits a large well-trained teacher neural network to train a small student network. Treating teacher's feature as knowledge, prevailing methods train student by aligning its features with the teacher's, e.g., by minimizing the KL-divergence or L2-distance between their (logits) features. While it is natural to assume that better feature alignment helps distill teacher's knowledge, simply forcing this alignment does not directly contribute to the student's performance, e.g., classification accuracy. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student classifier. We are motivated to regularize student features at the penultimate layer using teacher towards training a better student classifier. Specifically, we present a rather simple method that uses teacher's class-mean features to align student features w.r.t their direction. Experiments show that this significantly improves KD performance. Moreover, we empirically find that student produces features that have notably smaller norms than teacher's, motivating us to regularize student to produce large-norm features. Experiments show that doing so also yields better performance. Finally, we present a simple loss as our main technical contribution that regularizes student by simultaneously (1) aligning the direction of its features with the teacher class-mean feature, and (2) encouraging it to produce large-norm features. Experiments on standard benchmarks demonstrate that adopting our technique remarkably improves existing KD methods, achieving the state-of-the-art KD performance through the lens of image classification (on ImageNet and CIFAR100 datasets) and object detection (on the COCO dataset).", + "bbox": [ + 261, + 330, + 743, + 705 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: knowledge distillation $\\cdot$ large-norm $\\cdot$ feature direction", + "bbox": [ + 261, + 717, + 705, + 731 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 756, + 375, + 771 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Knowledge distillation (KD) is a specific technique for model compression that aims to train a smaller model (called student) by distilling knowledge learned", + "bbox": [ + 212, + 786, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "$\\text{忍}$ Corresponding author: chenglc@hfut.edu.cn", + "bbox": [ + 215, + 824, + 524, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/4e57f54de727772ac07d7878093b79ad057ff021698868cfceabcb8b3f53ea9d.jpg", + "image_caption": [ + "student" + ], + "image_footnote": [], + "bbox": [ + 341, + 145, + 357, + 154 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/eaca632918e2ee2130018d250228f5acef0eff6563bf0026d8721666c8ba55e4.jpg", + "image_caption": [ + "acher" + ], + "image_footnote": [], + "bbox": [ + 406, + 147, + 429, + 156 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/fa091acb0b0245ef65d581fc031919b546f6c751274bd6f773b02a08edc7699d.jpg", + "image_caption": [ + "existing loss, e.g., $\\mathcal{L}_{ce},\\mathcal{L}_{kd}$" + ], + "image_footnote": [], + "bbox": [ + 468, + 147, + 483, + 157 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/9b72e3acbfa34bd9cb0478f4ba2320c4667fefb479c3e2ce586dfbb12906af24.jpg", + "image_caption": [ + "our proposed loss $\\mathcal{L}$", + "1 1" + ], + "image_footnote": [], + "bbox": [ + 617, + 145, + 633, + 154 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/6790b80897748213a6a5a85666a9e6546751e62ae28939ec4c795f1ef8a5740c.jpg", + "image_caption": [ + "logit distillation" + ], + "image_footnote": [], + "bbox": [ + 243, + 169, + 495, + 300 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/24a1e6959aa909f98be6e727f9b6419252eca28a1c29876e2fd786ee6b87b3e9.jpg", + "image_caption": [ + "feature distillation", + "Fig. 1: Our main contribution is a simple loss, termed $\\mathcal{L}_{dino}$ , that regularizes the direction and norm of the student features (details in Sec. 3.3). $\\mathcal{L}_{dino}$ is applicable to different KD methods which can be categorized into two types in the context of classification: (left) logit distillation that regularizes logits or softmax scores (e.g., KD [15] and DKD [48]), and (right) feature distillation that regularizes features other than logits (e.g., ReviewKD [4]). In this work, we apply $\\mathcal{L}_{dino}$ to the embedding feature particularly at the penultimate layer (before logits). Experiments show that learning with $\\mathcal{L}_{dino}$ improves existing KD methods, achieving the state-of-the-art benchmarking results for image classification (Tab. 1) and object detection (Tab. 3)." + ], + "image_footnote": [], + "bbox": [ + 504, + 170, + 756, + 301 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "by a larger teacher model [15]. Deploying the small student model reduces inference computation (e.g., running time and memory use) compared against the original large model. Different from other model compression methods such as pruning [44] and quantization [10], KD has the flexibility of using different architectures of the student, which is preferred by certain real-world applications.", + "bbox": [ + 212, + 488, + 787, + 564 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Status quo. Treating teacher features as knowledge, KD distills such knowledge to train student by encouraging its features to be similar to the teacher's. Through the lens of image classification, prevailing methods can be categorized into two types: logit distillation (Fig. 1-left), and feature distillation (Fig. 1-right). Logit distillation trains the student by minimizing the KL divergence between its logits and the teacher's [15,48]. It assumes that, if student can produce logits more similar to teacher's, it should achieve better performance that approaches teacher's performance. However, logit distillation considers only the logit layer but not other intermediate layers. To exploit such, feature distillation trains student by encouraging its intermediate-layer features to be similar to the teacher's, e.g., by minimizing the L2 distance between their features [4,46].", + "bbox": [ + 212, + 566, + 787, + 733 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Motivation. Despite the promising results of logit distillation and feature distillation methods, forcing the student to produce similar logits or features to the teacher's does not directly serve the final task, e.g., classification. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student-classifier. Rather, student features are better regularized by the teacher to facilitate learning a better student classifier. Therefore, we are", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "motivated to exploit teacher's classifier to train better student towards better performance. Moreover, we empirically find that encouraging the student to produce large-norm features yields better performance (Fig. 2). Other lines of work such as domain adaptation [40] and pruning [44] also find the benefit of learning large-norm features, motivating us to train the student to produce large-norm features.", + "bbox": [ + 212, + 146, + 787, + 236 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Contributions. We make three major contributions. First, we take a novel perspective to improve KD by regularizing student to produce features that (1) are aligned with class-means features computed by the teacher, and (2) have sufficiently large norms. Second, we study multiple baseline methods to achieve such regularizations. We show that when incorporating either or both, existing KD methods yields better performance, e.g., classification accuracy and object detection precision by the student. Third, we propose a novel and simple loss that simultaneously regularizes feature direction and norm, termed dino-loss. Experiments demonstrate that additionally adopting our dino-loss helps existing KD methods achieve better performance. For example, on the standard benchmark ImageNet [5], applying dino-loss to KD [15] achieves $72.49\\%$ classification accuracy (Fig. 5), better than the original KD $(71.35\\%)$ , with ResNet-18 and ResNet-50 architectures for student and teacher, respectively. This outperforms recent methods ReviewKD [4] $(71.09\\%)$ and DKD [48] $(71.85\\%)$ .", + "bbox": [ + 212, + 237, + 789, + 450 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 473, + 387, + 489 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Knowledge distillation. (KD) aims to train a small student model by distilling knowledge of a well-trained large teacher model. The knowledge is delivered by features produced by the teacher for training data. Therefore, the key to KD is to align student features to the teacher's. The seminal KD method [15] propose to train student by aligning its logits with the teacher's, i.e., minimizing the Kullback-Leibler divergence (KL) between logits. Other works improve KD by decoupling the KL loss into multiple terms [48] or consider logits rankings [16]. Distilling logit knowledge alone may not be sufficient as this does not exploit intermediate-layer features. Hence, feature distillation proposes to align more features at other layers [1, 4, 14, 25, 26, 30, 34, 41, 45, 46]. Another line of research adopts network architecture search towards finding small student for KD [7, 19, 20], achieving the state-of-the-art at a cost of extra computation for architecture search. In this work, we take a different and orthogonal perspective to improve KD with simple methods, by encouraging the student to produce features to be aligned with the direction of teacher classifier and of large norms.", + "bbox": [ + 212, + 507, + 787, + 734 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Constructing classifiers using off-the-shelf features. Off-the-shelf features extracted from a well-trained model can be used to construct strong classifiers. One simple classifier is to compute class-mean of training examples in the feature space, and uses such as the classifier [6,17,33]. On the other hand, recent literature of pretrained large models [28] shows that using off-the-shelf features and cosine similarity is a powerful classifier for zero-shot recognition. In this work, we propose to regularize student features using class-mean of teacher", + "bbox": [ + 212, + 734, + 789, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/ac9c9e9e19c23ae2e0b4645b4b4f8f358e64e8b5ee5ddb1ecaeb00d2c6dc6491.jpg", + "image_caption": [ + "(a) regularize feature direction" + ], + "image_footnote": [], + "bbox": [ + 215, + 143, + 390, + 234 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/c67dadee9ddfcb682cf7694f9223a4fe5e8c9a9e91b52dfda9b9193c9b4e734d.jpg", + "image_caption": [ + "(b) teacher feature" + ], + "image_footnote": [], + "bbox": [ + 395, + 143, + 506, + 233 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/38652112356f14203b112569763a680ba23707943cee52b2a04ff00f5c439c52.jpg", + "image_caption": [ + "(c) student feature" + ], + "image_footnote": [], + "bbox": [ + 513, + 143, + 620, + 233 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/f55a1f6bcad131cc9b2958564ccdc475b13364ea315604d7277e0a41e0e9eeb6.jpg", + "image_caption": [ + "(d) regularize feature norm", + "Fig. 2: Regularizing feature direction and norm helps knowledge distillation and improves student's performance. We train a ResNet-56 teacher and use the classic KD method [15] to train a ResNet-8 student on the CIFAR10 dataset. (a) We propose to regularize student by aligning its feature direction with the class-mean features computed by teacher. To do so, we adopt a simple cosine loss term on the penultimate-layer features (Sec. 3.2). Results show that regularizing feature direction improves student's performance. (b-c) We train teacher and student to produce 2D features at the penultimate layer from scratch (without using method KD [15]). We visualize them as 2D points, colored by class labels, and mark the class center by $\\star$ . Notably, the large teacher model produces large-norm features (b), while the small student model produces small-norm features (c). (d) This motivates us to regularize student by encouraging it to produce large-norm features (Sec. 3.2). To do so, we use the method SIFN [40]. Results show that properly regularizing feature norms improves student's performance. Our technical contribution is a simple loss that simultaneously regularizes student feature direction and norm, so we call it dino-loss." + ], + "image_footnote": [], + "bbox": [ + 629, + 143, + 787, + 234 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "features, as well as other different methods for feature alignment. We hypothesize that doing so helps learn better student classifiers. Indeed, our experiments justify this hypothesis (Tab. 4).", + "bbox": [ + 212, + 503, + 785, + 547 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Learning large-norm features. Multiple lines of work find it important to learn large-norm features or weight parameters. For example, domain adaptation [40] reveals that the erratic discrimination of the target domain mainly stems from its much smaller feature norms w.r.t that of the source domain, and adopting a larger-norm constraint helps adapt a pretrained model (in the source domain) to a new target domain. Moreover, model pruning finds that features with smaller norms play a less informative role during the inference [44], so it is safe to remove weight parameters that produce small-norm features without causing notable performance drop. In our work, we also empirically find that a small-capacity model produces features that tend to collide in the small-norm region (Fig. 2c). Therefore, we are motivated to train student to produce large-norm features, hypothesizing that doing so improves student performance. Our experiments justify this hypothesis (Fig. 2d, Tab. 4).", + "bbox": [ + 212, + 550, + 787, + 747 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Feature regularization w.r.t norm and direction. The literature has multiple works studying feature regularization w.r.t its norm and direction in KD. We present them and explain how our method stands out. PKD [2] normalizes student and teacher features to have zero mean and unit variances to eliminate the gap in feature norms between them, and applies MSE loss between the normalized features. Our method encourages learning large-norm features of the", + "bbox": [ + 212, + 750, + 789, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "student and additionally regularizes features using teacher classifier for better classification. Guo [8] transforms student logits to have the same norm of the teacher logits and performs KL-divergence on the transformed logits, whereas we encourage learning large-norm student features which can have feature norm larger than the teacher's (Fig. 4). FNKD [39] also advocates learning large-norm features but chooses to tune a temperature (shared by all classes) to enlarge logit values before softmax; differently, our method unifies norm regularization and feature direction regularization into a simple loss. Both SimKD [3] and SRRL [42] use MSE loss to align the student features with the teacher's without enlarging feature norms; Wang [35] uses an L2 loss to align features of teacher and student models and further adopts a loss based on locality-sensitive hashing to encourage the direction of student features to be aligned with teacher's. These methods do not necessarily learn a student to have feature norms that can be larger than the teacher's. In sum, our simple dino-loss not only aligns directions of student and teacher features but also explicitly encourages learning student to produce large-norm features.", + "bbox": [ + 212, + 146, + 787, + 388 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Improving Knowledge Distillation by Regularizing Feature Direction & Norm", + "text_level": 1, + "bbox": [ + 214, + 412, + 751, + 446 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We first describe notations and motivate our study of regularizing feature direction and norm to improve KD. Then, we introduce baselines, followed by our proposed dino-loss.", + "bbox": [ + 212, + 462, + 787, + 508 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Notations and Background", + "text_level": 1, + "bbox": [ + 214, + 532, + 483, + 547 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Notations. Without losing generality, we think of a classification neural network as two modules: a feature extractor $f(\\cdot; \\Theta)$ , and a classifier $g(\\cdot; \\mathbf{w})$ , which are parameterized by $\\Theta$ and $\\mathbf{w}$ , respectively. For the teacher, given input data $\\mathbf{x}$ , we denote its embedding feature as $\\mathbf{f}^t = f^t(\\mathbf{x}; \\Theta^t)$ , and the logits as $\\mathbf{z}^t = g^t(\\mathbf{f}^t; \\mathbf{w}^t)$ . Similarly, the student outputs the embedding features for $\\mathbf{x}$ as $\\mathbf{f}^s = f^s(\\mathbf{x}; \\Theta^s)$ and logits as $\\mathbf{z}^s = g^s(\\mathbf{f}^s; \\mathbf{w}^s)$ . We compute softmax scores in a vector $\\mathbf{q}^t = \\mathrm{softmax}(\\mathbf{z}^t; \\tau)$ , where $\\tau$ is a temperature (default value as 1). Given $N$ training examples from $C$ classes, $\\mathbf{x}_i$ and its label $y_i$ (where $i = 1, \\dots, N$ ), one can train a classification model (e.g., the teacher) by minimizing the cross-entropy (CE) loss $\\mathcal{L}_{ce}$ on all the training data.", + "bbox": [ + 212, + 558, + 787, + 709 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Logit distillation trains the student by transferring the teacher knowledge using both the CE loss $\\mathcal{L}_{ce}$ and a KD loss $\\mathcal{L}_{kd}$ . The seminal work of KD [15] uses KL divergence as the KD loss $\\mathcal{L}_{kd}$ , i.e., $\\mathcal{L}_{kd} = \\frac{1}{N}\\sum_{i=1}^{N}\\mathbf{KL}(\\mathbf{q}_i^t,\\mathbf{q}_i^s)$ .", + "bbox": [ + 212, + 710, + 787, + 758 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Feature distillation distills teacher knowledge by minimizing the difference of intermediate features at more layers other than the logits [4, 45, 46]. A typical loss term is the L2 distance $\\mathcal{L}_2$ between student and teacher features. For", + "bbox": [ + 212, + 757, + 787, + 801 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_footnote", + "text": "1 When student and teacher have different features dimensions, one can learn extra layers in student to project its features to the same dimension as teacher's [4].", + "bbox": [ + 217, + 810, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "example, over the embedding features at the penultimate layer (before logits), it applies the L2 loss $\\mathcal{L}_{kd} = \\frac{1}{N}\\sum_{i=1}^{N}\\mathcal{L}_2(\\mathbf{f}_i^s,\\mathbf{f}_i^t)$ in addition to the CE loss $\\mathcal{L}_{ce}$ .", + "bbox": [ + 212, + 146, + 782, + 179 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The final loss is $\\mathcal{L} = \\mathcal{L}_{ce} + \\alpha \\mathcal{L}_{kd}$ , where $\\alpha$ controls the significance of the KD loss $\\mathcal{L}_{kd}$ depending on distillation choice: logit distillation or feature distillation.", + "bbox": [ + 212, + 179, + 787, + 209 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Baseline Methods", + "text_level": 1, + "bbox": [ + 215, + 232, + 410, + 247 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Recall that we are motivated to regularize student features during training: aligning their direction with teacher class-mean features, and encouraging them to be large in norm. In the main paper, we focus on the embedding features $\\mathbf{f}^s$ at the penultimate layer, which are the direct input to a classifier; we also validate its effectiveness at other layers (Tab. 5). We compute the class-mean of the $k^{th}$ class as $\\mathbf{c}_k = \\frac{1}{|\\mathcal{I}_k|}\\sum_{j\\in \\mathcal{I}_k}\\mathbf{f}_j^t$ , where $\\mathcal{I}_k$ is the set of indices of training examples belonging to class- $k$ . We now introduce simple techniques to regularize student features using $\\mathbf{c}_k$ w.r.t feature direction and norm.", + "bbox": [ + 212, + 258, + 787, + 378 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Feature Direction Regularization. We present two simple baseline methods below to regularize student w.r.t feature direction.", + "bbox": [ + 212, + 380, + 787, + 409 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Baseline-1: cosine similarity. We use a simple cosine similarity based loss term to regularize the feature direction of $\\mathbf{f}_i^s$ according to the mean feature $\\mathbf{c}_k$ of the corresponding class- $k$ :", + "bbox": [ + 212, + 411, + 787, + 455 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {d} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\left(1 - \\cos \\left(\\mathbf {f} _ {i} ^ {s}, \\mathbf {c} _ {k}\\right)\\right) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 467, + 787, + 503 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Baseline-2: InfoNCE. Using the cosine similarity loss Eq. 1 considers only paired examples and their corresponding class-mean. Inspired by InfoNCE [24], we also consider inter-class examples and class-means. Therefore, we train student by minimizing:", + "bbox": [ + 212, + 513, + 787, + 574 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {d} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} - \\log \\frac {\\exp \\left(\\cos \\left(\\mathbf {f} _ {i} ^ {s} , \\mathbf {c} _ {k}\\right)\\right)}{\\sum_ {j = 1} ^ {C} \\exp \\left(\\cos \\left(\\mathbf {f} _ {i} ^ {s} , \\mathbf {c} _ {j}\\right)\\right)} \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 339, + 585, + 787, + 625 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Feature Norm Regularization. We present two baseline methods below to regularize student towards producing large-norm features.", + "bbox": [ + 212, + 632, + 787, + 662 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Baseline-1: $\\mathcal{L}_2$ distance. As shown by Fig. 2c, the small-capacity student model produces features that have notably smaller norm than the teacher's. To train the student to produce larger-norm features, perhaps a naive method is to increase student feature norm towards teacher's. To this end, we minimize the L2 distance between features of student and teacher:", + "bbox": [ + 212, + 662, + 787, + 737 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {n} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\| \\mathbf {f} _ {i} ^ {s} - \\mathbf {f} _ {i} ^ {t} \\| _ {2} ^ {2} \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 398, + 747, + 787, + 785 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Minimizing Eq. 3 is a common practice in feature distillation [1,4,14]. It implicitly trains student to produce features with norms approaching the corresponding larger-norm teacher features.", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Baseline-2: Stepwise increasing feature norms (SIFN). We now describe a loss to explicitly increase the norm of the student features. Inspired by [40], we gradually increase the feature norm by minimizing:", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {n} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\mathcal {L} _ {2} \\left(f ^ {s} \\left(\\mathbf {x} _ {i}; \\Theta_ {\\text {p r e v i o u s}} ^ {s}\\right) + r, f ^ {s} \\left(\\mathbf {x} _ {i}; \\Theta_ {\\text {c u r r e n t}} ^ {s}\\right)\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 316, + 202, + 787, + 239 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\Theta_{previous}^{s}$ and $\\Theta_{current}^{s}$ are parameters of an early checkpoint and the current model being optimized, respectively; $r$ is a step size to increase the norm of student features during training.", + "bbox": [ + 212, + 248, + 782, + 294 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 The Proposed dino Loss", + "text_level": 1, + "bbox": [ + 214, + 316, + 460, + 333 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We now present the proposed dino-loss that simultaneously achieves the above two goals: (1) aligning student features to teacher's w.r.t direction, and (2) learning large-norm student features. For simplicity, we drop the subscript (i.e., the index of a training example or class ID). Let $\\mathbf{f}^s$ and $\\mathbf{f}^t$ be the embedding features of an input $\\mathbf{x}$ computed by student and teacher, respectively. Based on $\\mathbf{x}$ 's ground-truth label $y$ , we have its corresponding class-mean $\\mathbf{c}$ . We denote the unit vector $\\mathbf{e} = \\mathbf{c} / \\| \\mathbf{c}\\|_2$ , and $\\mathbf{p}^t = \\mathbf{e}\\| \\mathbf{f}^t\\|_2$ . We compute the projection of $\\mathbf{f}^s$ along $\\mathbf{c}$ 's direction: $\\mathbf{p}^s = \\mathbf{e}\\| \\mathbf{f}^s\\|_2\\cos (\\mathbf{f}^s,\\mathbf{c})$ . Fig. 3 shows the geometric meaning.", + "bbox": [ + 212, + 344, + 784, + 465 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "When the norm of $\\mathbf{f}^s$ is small, or its projection $\\mathbf{p}^s$ has small norm, i.e., $\\| \\mathbf{p}^s\\| _2 < \\| \\mathbf{f}^t\\| _2$ , we encourage the student to output larger-norm features and align them with the teacher class-mean by minimizing $\\| \\mathbf{p}^t -\\mathbf{p}^s\\| _2$ .", + "bbox": [ + 212, + 465, + 571, + 541 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Because the feature norms of different examples can vary by an order of magnitude (see Fig. 2c), naively learning with the above can produce artificially large gradients from specific training data and negatively affect training. Thus, we divide the above by $\\| \\mathbf{f}^t\\| _2$ , which is equivalent to $\\| \\mathbf{p}^t\\| _2$ ..", + "bbox": [ + 212, + 542, + 573, + 633 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {d i n o}} = \\frac {\\| \\mathbf {p} ^ {t} - \\mathbf {p} ^ {s} \\| _ {2}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} = \\frac {\\| \\mathbf {p} ^ {t} \\| _ {2} - \\| \\mathbf {p} ^ {s} \\| _ {2}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} = 1 - \\frac {\\mathbf {f} ^ {s} \\cdot \\mathbf {e}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 225, + 643, + 571, + 685 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/20d7293459eaa1334e3b2609e7171cf229eaab2a7a32085318e17c11a1a915ea.jpg", + "image_caption": [ + "Fig. 3: Illustration of notations used in our dino-loss loss and its geometric meaning." + ], + "image_footnote": [], + "bbox": [ + 617, + 502, + 751, + 597 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Minimizing Eq. 5 amounts to simultaneously", + "bbox": [ + 240, + 686, + 571, + 700 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "(1) increasing the norm of $\\mathbf{f}^s$ and (2) reducing the angular distance between $\\mathbf{f}^s$ and the class-mean $\\mathbf{c}$ .", + "bbox": [ + 212, + 700, + 782, + 729 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "When $\\mathbf{f}^s$ has large norm, i.e., $\\| \\mathbf{f}^s\\| _2\\geq \\| \\mathbf{f}^t\\| _2$ , we only minimize the angular distance between student feature and the class-mean defined by the teacher:", + "bbox": [ + 212, + 731, + 782, + 761 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {d i n o}} = 1 - \\frac {\\mathbf {f} ^ {s} \\cdot \\mathbf {e}}{\\| \\mathbf {f} ^ {s} \\| _ {2}} \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 437, + 771, + 785, + 800 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The above loss means that the feature norm of student is no longer explicitly required to reach a larger value if it is already large enough; yet it is still allowed", + "bbox": [ + 212, + 809, + 782, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "to increase freely during training. We merge Eq. 5 and 6 and average over all training examples as our dino-loss (dropping the constant 1):", + "bbox": [ + 215, + 146, + 787, + 176 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {d i n o} = - \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\frac {\\mathbf {f} _ {i} ^ {s} \\cdot \\mathbf {e} _ {k}}{\\max \\left\\{\\| \\mathbf {f} _ {i} ^ {s} \\| _ {2} , \\| \\mathbf {f} _ {i} ^ {t} \\| _ {2} \\right\\}} \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 186, + 787, + 224 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Compatible with existing KD methods, our dino-loss $\\mathcal{L}_{dino}$ can be used altogether with CE loss $\\mathcal{L}_{ce}$ and KD loss $\\mathcal{L}_{kd}$ to train student:", + "bbox": [ + 215, + 233, + 787, + 263 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {c e} + \\alpha \\mathcal {L} _ {k d} + \\beta \\mathcal {L} _ {d i n o} \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 418, + 273, + 787, + 289 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "$\\alpha$ and $\\beta$ are the weights for $\\mathcal{L}_{kd}$ and $\\mathcal{L}_{dino}$ , respectively. The definition of $\\mathcal{L}_{kd}$ depends on the distillation method. Otherwise stated, we study $\\mathcal{L}_{dino}$ with the seminal logit distillation method KD [15], so $\\mathcal{L}_{kd} = \\mathbf{KL}$ .", + "bbox": [ + 212, + 297, + 784, + 343 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Remark. The dino-loss simultaneously encourages student to output large-norm features (possibly larger than teacher's, as shown in Fig. 4), and minimizes the angular distance between student features and the class-mean defined by the teacher during training. This is a desired property in terms of training the student to achieve better classification accuracy.", + "bbox": [ + 214, + 344, + 787, + 419 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 441, + 375, + 459 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Datasets and Settings", + "text_level": 1, + "bbox": [ + 215, + 474, + 442, + 489 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For fair comparisons, our implementation adheres to the previous methodologies outlined in [4, 16, 34, 48].", + "bbox": [ + 212, + 498, + 784, + 527 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "CIFAR-100 [18] contains 50k training images and 10k testing images. During training, we adopt random cropping and random left-right flipping augmentations. We randomly initialize weight parameters following [12] and train all student networks from scratch. The teacher models are publicly available that are adopted in prior art [34]. The student networks are trained using a batch size of 128 for 240 epochs (with a linear warm-up for the first 20 epochs), employing SGD with a weight decay of 5e-4 and momentum of 0.9. We set the initial learning rate of 0.1 for ResNet [13] and WRN [47] backbones, and 0.02 for MobileNet [32] and ShuffleNet [23] backbones, decaying it with a factor of 10 at 150th, 180th, and 210th epochs. The temperature is empirically set to 4.", + "bbox": [ + 212, + 529, + 787, + 679 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "ImageNet [31] has 1.28 million training images and 50,000 validation images spanning by 1,000 categories. We employ SGD with a batch size of 512 for a total of 100 epochs (with a linear warm-up for the first 5 epochs). The initial learning rate is set to 0.2 and is reduced by a factor of 10 every 30 epochs. Besides, the weight decay and momentum are set to 1e-4 and 0.9, respectively. The pre-trained weights for teacher come from PyTorch² and TIMM [38] for fair comparisons. The temperature for knowledge distillation is set to 1.", + "bbox": [ + 212, + 680, + 787, + 784 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "COCO 2017 [22] consists of 80 object categories with 118k training images and 5k validation images. We utilize Faster R-CNN [29] with FPN [21] as the", + "bbox": [ + 212, + 785, + 787, + 816 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 7 + }, + { + "type": "page_footnote", + "text": "2 https://pytorch.org/vision/stable/models.html", + "bbox": [ + 217, + 823, + 545, + 840 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/7efb00c18422612fc79b076e79c3c02e5d5f33273fb0644cc04c510e8ab07abc.jpg", + "table_caption": [ + "Table 1: Benchmarking results on CIFAR100. Methods are reported w.r.t top-1 accuracy (\\%) on the test set. ++ means that we apply the proposed dino-loss to existing methods. Clearly, doing so improves performance over the original KD methods and outperforms prior KD methods. We mark performance gains over corresponding methods using green superscripts." + ], + "table_footnote": [], + "table_body": "
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher (T)72.3475.6179.4279.3479.4279.42
student (S)69.0671.9872.5064.6070.5071.82
Feature distillation methods
FitNet [30]69.2172.2473.5063.1673.5973.54
RKD [25]69.6172.2271.9064.4372.2873.21
PKT [27]70.3473.4573.6466.5274.1074.69
OFD [14]70.9874.3374.9569.0475.9876.82
CRD [34]71.1674.1475.5169.1175.1175.65
ReviewKD [4]71.8975.0975.6369.8977.4577.78
ReviewKD++72.05+0.1675.66+0.5776.07+0.4470.45+0.5677.68+0.2377.93+0.15
Logit distillation methods
KD [15]70.6673.5473.3367.6574.0774.45
KD++72.53+1.8774.59+1.0575.54+2.2170.10+2.3575.45+1.3876.42+1.97
DIST [16]71.7874.4275.7969.1775.2376.08
DIST++72.52+0.7475.00+0.5876.13+0.3469.80+0.6375.60+0.3776.64+0.56
DKD [48]71.9774.8175.4470.3576.4577.07
DKD++72.16+0.1975.02+0.2176.28+0.8470.82+0.4777.11+0.6677.49+0.42
", + "bbox": [ + 212, + 224, + 784, + 452 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "feature extractor, and employ the dino-loss on the R-CNN head, wherein both teacher and student models adopt ResNet [13] as the backbone. In addition, MobileNet-V2 [32] is used as a heterogeneous student model. All student models are trained with 1x scheduler, following the public toolbox Detectron2.3", + "bbox": [ + 212, + 477, + 787, + 540 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Comparisons with State-of-the-art Results", + "text_level": 1, + "bbox": [ + 214, + 561, + 609, + 577 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "CIFAR-100 classification. Tab. 1 shows the KD performances on the CIFAR-100 dataset. In this context, spanning homogeneous and heterogeneous architectures, we undertake an extensive assessment over prominent feature distillation methods and logits distillation methods. The ++ signifies the integration of our novel dino-loss into the existing methods. A salient conclusion from Tab. 1 is that our proposed dino-loss empowers existing KD methods to achieve better classification accuracy. This suggests the effectiveness and compatibility of the dino-loss, which can serve as a plugin for existing KD methods, irrespective of the homogeneity or heterogeneity for network architectures.", + "bbox": [ + 212, + 588, + 787, + 724 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ImageNet classification. We demonstrate the effectiveness of the proposed dino-loss on the well-established benchmark ImageNet. Tab. 2 lists detailed results. It is worth noting that with our simple dino-loss, the method $\\mathbf{KD}++$ already outperforms most of previous methods (e.g., ReviewKD [4], DKD [48], and SRRL [43]). Moreover, incorporating our dino-loss, other methods such as ReviewKD++ and DKD++ also achieve notable improvements.", + "bbox": [ + 212, + 724, + 787, + 816 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_footnote", + "text": "3 https://github.com/facebookresearch/detectron2", + "bbox": [ + 217, + 824, + 560, + 839 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/0293ba2864b11f4ea366de85e9953c84851af649b1c75faf6a93cff7e685188e.jpg", + "table_caption": [ + "Table 2: Comparisons with state-of-the-art methods on the ImageNet validation set. $\\mathrm{KD}++$ serves as a stronger baseline that introduces no more parameters and negligible training time over the vanilla KD [15] and outperforms most of previous methods (e.g., ReviewKD [4], SRRL [42], and MGD [43]). Methods marked by $\\dagger$ adopts a searching strategy, demanding significant more computation cost to achieve the state-of-the-art performance. In contrast, our dino-loss is rather simple that helps existing KD methods to rival search-based methods." + ], + "table_footnote": [], + "table_body": "
MethodsResNet-34 → Top-1ResNet-18 Top-5ResNet-50 → Top-1MobileNet-V1 Top-5
student69.7689.4368.8788.76
teacher73.3191.5976.1692.86
CRD ICLR2020 [34]71.1790.1371.3790.42
SRRL ICLR2021 [42]71.7390.6072.4990.92
MGD ECCV2022 [43]71.5890.3572.3591.00
CAT-KD CVPR2023 [9]71.2690.4572.2491.13
KD NeurIPS2015 [15]70.6689.8870.5089.80
KD++71.98 (+1.32)90.53 (+0.65)72.77 (+2.27)91.14 (+1.34)
ReviewKD CVPR2021 [4]71.6290.5172.5691.00
ReviewKD++71.64 (-0.02)90.61 (+0.10)72.96 (+0.40)91.16 (+0.16)
DKD CVPR2022 [48]71.7090.4172.0591.05
DKD++72.07 (+0.37)90.59 (+0.18)72.63 (+0.58)91.07 (+0.02)
KD-Zero NeurIPS2023 [19]†72.1790.4673.0291.05
Auto-KD ICCV2023 [20]†72.4590.6973.2691.17
", + "bbox": [ + 241, + 253, + 753, + 422 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/5f043d04061f6cc3c47497a7305b31a7b665328c63b7dcabfa7e36d085327c47.jpg", + "table_caption": [ + "Table 3: Benchmarking KD methods for object detection on the COCO val2017 dataset (mAP in %). All methods use the Faster R-CNN detector with various teacher and student architectures, including RestNet {18,50,101} and MobileNet-V2 (MV2). Incorporating our dino-loss, simple methods $\\mathrm{KD + + }$ and ReviewKD++ obtain notable performance gains (marks in green) over their original counterparts, achieving the state-of-the-art performance." + ], + "table_footnote": [], + "table_body": "
MethodsR101→R18R101→R50R50→MV2
mAP\\( AP^{50} \\)\\( AP^{75} \\)mAP\\( AP^{50} \\)\\( AP^{75} \\)mAP\\( AP^{50} \\)\\( AP^{75} \\)
teacher42.0462.4845.8842.0462.4845.8840.2261.0243.81
student33.2653.6135.2637.9358.8441.0529.4748.8730.90
KD [15]33.9754.6636.6238.3559.4141.7130.1350.2831.35
FitNet [30]34.1354.1636.7138.7659.6241.8030.2049.8031.69
FGFI [36]35.4455.5138.1739.4460.2743.0431.1650.6832.92
DKD [48]35.0556.6037.5439.2560.9042.7332.3453.7734.01
ReviewKD [4]36.7556.7234.0040.3660.9744.0833.7153.1536.13
KD++36.12 (+2.15)56.81 (+2.15)37.64 (+1.02)39.86 (+1.51)61.07 (+1.66)43.57 (+1.86)33.26 (+3.13)53.71 (+3.43)34.85 (+3.50)
ReviewKD++37.43 (+0.68)57.96 (+1.24)40.15 (+6.15)41.03 (+0.67)61.80 (+0.83)44.94 (+0.86)34.51 (+0.80)55.18 (+2.03)37.21 (+1.08)
", + "bbox": [ + 217, + 544, + 784, + 636 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We note that recent KD methods adopt a searching strategy for better results, e.g., KD-Zero [19] and Auto-KD [20]. These methods search for a distiller in a space of predefined modules, e.g., normalization methods, losses, transform operations, activation functions, etc. At the cost of significantly more computation time for searching, they achieve the best performance on the benchmark, slightly better than ours. Nevertheless, our dino-loss helps existing much simpler methods rival search-based approaches! Compared against search-based methods, applying our dino-loss, methods such as $\\mathrm{KD}++$ introduce no more parameters and negligible training time over the counterparts (e.g., vanilla KD [15]). This makes the use of our dino-loss a stronger baseline for knowledge distillation. Interestingly, current search-based methods do not consider our proposed regularization methods, i.e., feature norm regularizer and feature direction regularizer. That said, our method", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Table 4: Analysis of feature direction and norm regularization. We train teacher (ResNet-50, ResNet-56) and student (MobileNet-V2, ResNet-20) models on the CIFAR100 dataset and report accuracy $(\\%)$ on its test-set. We use KD [15] as the baseline, which is a logit distillation method. From (a-b), we see that applying either direction or norm regularization on student features improves KD as shown by the increased student accuracy. While combining both outperforms baseline (c), using dino-loss achieves the best (d).", + "bbox": [ + 212, + 143, + 787, + 242 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "(a) Regularizing feature direction only. Cosine is more robust than InfoNCE.", + "bbox": [ + 212, + 265, + 478, + 292 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/5825b384b0df4defdf30d19b28a927255ac0395973ceb20ab20bc8f52c0d778b.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
caseR50→MV2R56→R20
baseline67.6570.66
cosine69.18 (+1.53)71.75 (+1.09)
InfoNCE69.06 (+1.41)70.73 (+0.07)
", + "bbox": [ + 240, + 306, + 450, + 358 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "(c) Regularizing both feature norm and direction. Simple addition does not yield better results (e.g., cosine + $\\mathcal{L}_2$ vs. cosine vs. $\\mathcal{L}_2$ ).", + "bbox": [ + 212, + 361, + 475, + 416 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/8de6c4a55ce258ec1ff56d293a32a9faddccf19f4512a27ce9fddd147f1d02dd.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
caseR50→MV2R56→R20
cosine + L268.62 (+0.97)71.58 (+0.92)
cosine + SIFN69.07 (+1.42)71.72 (+1.06)
InfoNCE + L268.47 (+0.82)70.81 (+0.15)
InfoNCE + SIFN68.71 (+1.06)71.04 (+0.38)
", + "bbox": [ + 225, + 430, + 470, + 492 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "(b) Regularizing feature norm only. $SIFN$ is more robust than $\\mathcal{L}_2$", + "bbox": [ + 524, + 265, + 787, + 292 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/a7e3681dba933f070c44804e9a584079f0acb6380ad6203c511e8adce0613182.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
caseR50→MV2R56→R20
baseline67.6570.66
L269.05 (+1.40)71.85 (+1.19)
SIFN69.32 (+1.67)72.13 (+1.47)
", + "bbox": [ + 553, + 306, + 756, + 358 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "(d) The proposed dino-loss can perfectly integrate the advantages of regularization feature norm and direction, and perform best.", + "bbox": [ + 519, + 361, + 782, + 416 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/25ac6699346a1673a166cfcac6b779138db42e2beab969319831b78ee262a98d.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
caseR50→MV2R56→R20
CE + KL (baseline)67.6570.66
CE + dino68.78 (+1.13)71.96 (+1.30)
KL + dino68.68 (+1.03)72.04 (+1.38)
CE + KL + dino70.10 (+2.45)72.53 (+1.87)
", + "bbox": [ + 529, + 430, + 795, + 492 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "is orthogonal to existing KD methods and can potentially serve as modules for searching, suggesting the novelty of our work.", + "bbox": [ + 212, + 521, + 784, + 550 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "COCO Object Detection. We verify the efficacy of the proposed dino-loss for knowledge distillation through the lens of object detection on the COCO dataset. Tab. 3 lists detailed results compared to prior works. Specifically, the ReviewKD++ yields a significant improvement in performance, outperforming state-of-the-art results with a remarkable margin. Moreover, this experiment and the above demonstrate the applicability of our dino-loss across tasks (i.e., image classification and object detection).", + "bbox": [ + 212, + 551, + 787, + 657 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Ablation Study", + "text_level": 1, + "bbox": [ + 214, + 679, + 390, + 695 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In this subsection, we first conduct an ablation study on feature norm and direction regularization with the CIFAR-100 dataset. Subsequently, we perform a visual analysis of the impact before and after applying dino-loss. Finally, we conduct intriguing experiments on ImageNet to validate the benefits of using our approach that encourages learning large-norm features of the student model.", + "bbox": [ + 212, + 704, + 787, + 779 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The effectiveness feature direction and norm regularization. Recall the baseline methods in Sec. 3.2 and 3.2 for feature direction and norm regularization. We present results for $\\mathcal{L}_2$ (Eq. 3) and SIFN (Eq. 4) on CIFAR-100 in Tab. 4b. Yet additional offline experiments substantiate that SIFN outperforms", + "bbox": [ + 212, + 780, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/de55f35bdf412f1c5e9636ce45d821b59306e4ac22eced837e6eec27acb8672e.jpg", + "table_caption": [ + "Table 5: Comparison of using teacher's classifier weights (dubbed \"w/ weights\") versus per-class mean features (dubbed \"w/ class-mean\") in our dino-loss. We study them with the KD method [15] on CIFAR-100. Results show that using per-class mean features outperforms classifier weights. Moreover, we apply our dino-loss at more layers other than the penultimate layer (cf. the bottom row block). Here, layer-x means that the dino-loss is applied to all the x layers right before the penultimate layer. In particular, layer-0 means that the dino-loss is applied only at the penultimate layer (i.e., \"w/ class-mean\" in this table). Results show that applying dino-loss at other layers also leads to improvements but doing so at the penultimate layer achieves the best performance." + ], + "table_footnote": [], + "table_body": "
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher72.3475.6179.4279.3479.4279.42
student69.0671.9872.5064.6070.5071.82
KD [15]70.6673.5473.3367.6574.0774.45
L2 ofcls weights70.5473.6173.7666.8173.6274.13
w/ weights71.7373.9775.0669.7675.2475.61
w/ class-mean72.5374.5975.5470.1075.4576.42
apply dino-loss to other layers
layer-171.3073.7474.2369.4475.0176.26
layer-271.9673.8174.1269.1075.7276.53
layer-371.1973.6173.9268.8774.9376.10
", + "bbox": [ + 215, + 282, + 784, + 431 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "$\\mathcal{L}_2$ regularization in terms of performance and consistently affirm that large student feature norms encapsulate more teacher knowledge. Similarly, Tab. 4a shows superior gains of cosine similarity-based regularizer (Eq. 1) over InfoNCE (Eq. 2); both underscore the significance of feature direction regularization.", + "bbox": [ + 212, + 468, + 785, + 529 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Our dino-loss yields better results. Tab. 4c shows that feature direction regularization (cosine, InfoNCE) and feature norm regularization $(\\mathcal{L}_2$ , SIFN) improve KD. While combining them helps KD (e.g., cosine + $\\mathcal{L}_2$ , cosine + SIFN), our dino-loss performs the best at $70.10\\%$ accuracy (Tab. 4d). This convincingly shows the superiority of our dino-loss over others.", + "bbox": [ + 212, + 532, + 787, + 608 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Class-mean vs. classifier weights in regularizing student feature direction. We perform a quantitative analysis of using the teacher's classifier weights and per-class feature mean to regularize student's features. We adopt the classifier weights that are derived from teacher as centers in our dino-loss to train student models (dubbed \"w/ weights\"). In comparison, we utilize per-class feature means, denoted as \"w/ class-mean\" (which is our proposed method). The results in Tab. 5 clearly demonstrate that the utilization of per-class feature mean performs better than the method of using teacher's classifier weights for feature direction regularization. Additionally, we have implemented an alternative approach that employs an L2 loss to guide the student to output classifier weights similar to those of the teacher (referred to as \"L2 of cls weight\"). However, this approach consistently underperforms our \"w/ class-mean\" method and even lags behind the baseline KD method [15] in most experimental settings. These findings provide strong evidence for the superiority of employing class-mean features over the teacher's classifier weights.", + "bbox": [ + 212, + 613, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/14c4506ec9823b1b3a6b6387342c6763f68c5d2ab1e12efefd22130c976e5e95.jpg", + "image_caption": [ + "(a) teacher" + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 356, + 244 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/556ddce9117ef3695e31dd7644d08198cb8dd87924059aca1dc7074a635879ee.jpg", + "image_caption": [ + "(b) naive small model" + ], + "image_footnote": [], + "bbox": [ + 361, + 143, + 496, + 244 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/e6b8213c397e71e940ddb344b8f912534dc964a3852049e4d4a735be37b3d700.jpg", + "image_caption": [ + "(c) student by KD", + "Fig. 4: Visualization of 2D embedding features. (a) Features computed by teacher (ResNet-50) are well separated at class label; note the purple class pointed by red arrow. (b) A small-capacity model (ResNet-18) fails to separate this purple class, which is occluded by others. (c) Even using KD [15] to train ResNet-18 student cannot reveal this purple class. (d) Using our dino-loss along with KD, i.e., $\\mathrm{KD}++$ , achieves better separation of the points and reveals purple class. This attributes to the feature direction regularization using teacher class-means. Moreover, student features in (d) have larger-norms than the teacher in (a) because our dino-loss explicitly encourages learning large-norm features of the student." + ], + "image_footnote": [], + "bbox": [ + 506, + 143, + 638, + 244 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/acdd697d656102cb01277422379fc0e1d9365fc2061e9aceb74e305b64732d32.jpg", + "image_caption": [ + "(d) student by $\\mathrm{KD} + +$" + ], + "image_footnote": [], + "bbox": [ + 648, + 145, + 784, + 244 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Applying the dino-loss to other layers. In the above experiment, we apply the dino-loss to the penultimate layer only. Here, we study applying it to other layers and evaluate on CIFAR-100 in bottom of Tab. 5. Results show that our dino-loss applied at other layers also improves over the baseline KD but performs the best when applied at the penultimate layer.", + "bbox": [ + 212, + 428, + 787, + 503 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "$\\mathrm{KD}++$ is a strong baseline. Tab. 4d illustrates the impacts of different losses in KD. By incorporating dino-loss into conventional KD framework [15], $\\mathrm{KD}++$ (i.e., $\\mathrm{CE} + \\mathrm{KL} + \\mathrm{dino}$ ) achieves a significant improvement: KD $(67.65\\%) \\rightarrow \\mathrm{KD}++$ $(70.10\\%)$ . Further, combining dino-loss with CE or KL can also boost the accuracy by $\\sim 1\\%$ compared to the original KD method. It is worth noting that $\\mathrm{KD}++$ introduces no additional parameters and negligible computation overhead, making it a strong baseline for KD (cf. more results in Tab. 1, 2, & 3).", + "bbox": [ + 212, + 503, + 789, + 609 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In addition, following [37], we visually examine the student feature in Fig. 4. First, as indicated in Fig. 4d, $\\mathrm{KD}++$ demonstrates notably amplified feature norms, surpassing even those of the teacher depicted in Fig. 4a. Furthermore, the direction in $\\mathrm{KD}++$ align well with the teacher (Fig. 4a vs. Fig. 4d, thereby maintaining consistent relative margins among categories. Another observation is that both the naive student (Fig. 4b) and the conventional KD (Fig. 4c) exhibit direct failures in classifying the purple category, whereas our approach, $\\mathrm{KD}++$ (Fig. 4d), effectively learns student features that can discriminate all classes.", + "bbox": [ + 212, + 611, + 787, + 731 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The benefit from larger teacher models. Now we investigate whether our approach exhibits monotonically incremental performance gains when exploiting a larger teacher. We first examine the classic KD [15] framework, and two other recently proposed methods, namely ReviewKD [4] and DKD [48].", + "bbox": [ + 212, + 733, + 787, + 792 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "As shown in Fig. 5, it is clear that for KD [15], DKD [48] and ReviewKD [4] show a degradation or fluctuation when scaling up the teacher from ResNet-34 to ResNet-152, with ResNet-18 as student. The main obstacle is the huge capacity", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/b3369adbd20a647a6fd1ee5e8b1f6307b697a6a36aeabe6f0d904ebef93c39b0.jpg", + "image_caption": [ + "Fig. 5: Using our dino-loss can benefit from larger teacher models. The student is ResNet-18, with scaling up the teacher from ResNet-34 to ResNet-152 (denoted in the $x$ -axis). We report the top-1 accuracy (\\%) on the ImageNet validation set. All results are the average accuracy over five runs. With the teacher capacity increasing, our methods, $\\mathrm{KD}++$ , $\\mathrm{DKD}++$ and $\\mathrm{ReviewKD}++$ (red) achieve better knowledge distillation results, even though the original distillation methods (blue) suffer from performance degradation with large teacher models (e.g., ResNet-152)." + ], + "image_footnote": [], + "bbox": [ + 215, + 143, + 397, + 250 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/1e1d6fa1f4a687f270ed3d9c153330126c508371470a3e8b5aa9c15c1d32450b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 408, + 143, + 589, + 250 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/d6ea9f25c56200a33d20072bf6356b0d1c3e5f495ba481242a670ba8cd421845.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 599, + 143, + 782, + 250 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/b9d3eb72ad423f680a6393c6759e718d51cb6116ed078adff51a62a771699061.jpg", + "table_caption": [ + "Table 6: A larger student gets better knowledge distillation performance. The teacher is ResNet-152 (top-1 acc, $78.31\\%$ ). We report the top-1 accuracy (\\%) on the ImageNet validation set. Model marked with $\\dagger$ adopts a stronger recipe [11]. Results show that our dino-loss achieves consistent improvement, outperforming the model trained from scratch (cf. the first row)." + ], + "table_footnote": [], + "table_body": "
studentResNet-18ResNet-34ResNet-50ResNet-101ViT-SViT-BViT-B†
trained from scratch69.7673.3176.1677.3774.6478.0081.80
KD [15]70.6674.8476.9378.0475.7778.5182.39
KD++71.98 (+1.32)75.53 (+0.69)77.48 (+0.55)79.15 (+1.11)76.53 (+0.76)79.85 (+1.34)82.92 (+0.53)
", + "bbox": [ + 215, + 452, + 782, + 497 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "gap between student and teacher [1,16,34]. Surprisingly, upon incorporating our dino-loss, distillation methods yield significant improvements compared to the original methods (e.g., $\\mathrm{KD}++$ vs. KD, ReviewKD++ vs. ReviewKD). More importantly, they show a consistent improvement with scaling up the teacher size (e.g., $\\mathrm{KD}++: 71.99\\% \\rightarrow 72.49\\% \\rightarrow 72.54\\% \\rightarrow 72.59\\%$ ).", + "bbox": [ + 212, + 525, + 784, + 599 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The benefit from larger student models. We use $\\mathrm{KD}++$ to study the effect of increasing the size of the student for knowledge distillation, and set the teacher as ResNet-152. The results in Tab. 6 demonstrate that increasing the capacity of the student significantly improves distillation results.", + "bbox": [ + 212, + 601, + 785, + 662 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Discussion and Conclusion", + "text_level": 1, + "bbox": [ + 215, + 685, + 508, + 700 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Broader Impacts As our work falls in the area of knowledge distillation, we do not see any new potential societal impacts other than those already known, e.g., student models might learn bias and unfairness delivered by the teacher.", + "bbox": [ + 212, + 717, + 785, + 761 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Conclusion. We study feature regularization w.r.t norm and direction when training student models for better knowledge distillation (KD). Indeed, sufficient experiments and ablation studies demonstrate that doing so with our proposed dino-loss helps existing KD methods to achieve better performance.", + "bbox": [ + 212, + 762, + 785, + 823 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The authors would like to thank the anonymous reviewers for their valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China (U22A2032), by the Zhejiang Provincial Science and Technology Plan Project (2024SSYS0013), and in part by the National Natural Science Foundation of China under Grant No. (62106235). Shu Kong acknowledges the support by the University of Macau (SRG2023-00044-FST).", + "bbox": [ + 212, + 175, + 787, + 267 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 287, + 321, + 303 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10925-10934 (2022)", + "2. Cao, W., Zhang, Y., Gao, J., Cheng, A., Cheng, K., Cheng, J.: Pkd: General distillation framework for object detectors via pearson correlation coefficient. Advances in Neural Information Processing Systems 35, 15394-15406 (2022)", + "3. Chen, D., Mei, J.P., Zhang, H., Wang, C., Feng, Y., Chen, C.: Knowledge distillation with the reused teacher classifier. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11933-11942 (2022)", + "4. Chen, P., Liu, S., Zhao, H., Jia, J.: Distilling knowledge via knowledge review. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5008-5017 (2021)", + "5. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009)", + "6. Donahue, J., Jia, Y., Vinyals, O., Hoffman, J., Zhang, N., Tzeng, E., Darrell, T.: Decaf: A deep convolutional activation feature for generic visual recognition. In: International conference on machine learning. pp. 647-655. PMLR (2014)", + "7. Dong, P., Li, L., Wei, Z.: Diswot: Student architecture search for distillation without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11898-11908 (2023)", + "8. Guo, J., Chen, M., Zhao, Y., Pan, B., Zhu, C., Hu, Y., Wang, H., He, X., Cai, D.: Reducing the capacity gap via spherical knowledge distillation (2022)", + "9. Guo, Z., Yan, H., Li, H., Lin, X.: Class attention transfer based knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11868-11877 (June 2023)", + "0. Han, S., Mao, H., Dally, W.J.: Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015)", + "1. He, K., Chen, X., Xie, S., Li, Y., Dólar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022)", + "2. He, K., Zhang, X., Ren, S., Sun, J.: Delving deep into rectifiers: Surpassing human-level performance on imagenet classification. In: Proceedings of the IEEE international conference on computer vision. pp. 1026-1034 (2015)", + "3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + ], + "bbox": [ + 225, + 316, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Heo, B., Kim, J., Yun, S., Park, H., Kwak, N., Choi, J.Y.: A comprehensive overhaul of feature distillation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1921-1930 (2019)", + "15. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)", + "16. Huang, T., You, S., Wang, F., Qian, C., Xu, C.: Knowledge distillation from a stronger teacher. arXiv preprint arXiv:2205.10536 (2022)", + "17. Kong, S., Ramanan, D.: Opengan: Open-set recognition via open data generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 813-822 (2021)", + "18. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)", + "19. Li, L., Dong, P., Li, A., Wei, Z., Ya, Y.: Kd-zero: Evolving knowledge distiller for any teacher-student pairs. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)", + "20. Li, L., Dong, P., Wei, Z., Yang, Y.: Automated knowledge distillation via monte carlo tree search. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 17413-17424 (October 2023)", + "21. Lin, T.Y., Dólar, P., Girshick, R., He, K., Hariharan, B., Belongie, S.: Feature pyramid networks for object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2117-2125 (2017)", + "22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)", + "23. Ma, N., Zhang, X., Zheng, H.T., Sun, J.: Shufflenet v2: Practical guidelines for efficient cnn architecture design. In: Proceedings of the European conference on computer vision (ECCV). pp. 116-131 (2018)", + "24. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)", + "25. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3967-3976 (2019)", + "26. Passalis, N., Tefas, A.: Learning deep representations with probabilistic knowledge transfer. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 268-284 (2018)", + "27. Passalis, N., Tefas, A.: Probabilistic knowledge transfer for deep representation learning. CoRR, abs/1803.10837 1(2), 5 (2018)", + "28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)", + "29. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. Advances in neural information processing systems 28 (2015)", + "30. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)", + "31. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115, 211-252 (2015)" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Wang et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "32. Sandler, M., Howard, A., Zhu, M., Zhmoginov, A., Chen, L.C.: Mobilenetv2: Inverted residuals and linear bottlenecks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4510-4520 (2018)", + "33. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014)", + "34. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019)", + "35. Wang, G.H., Ge, Y., Wu, J.: Distilling knowledge by mimicking features. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(11), 8183-8195 (2021)", + "36. Wang, T., Yuan, L., Zhang, X., Feng, J.: Distilling object detectors with fine-grained feature imitation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4933-4942 (2019)", + "37. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part VII 14. pp. 499-515. Springer (2016)", + "38. Wightman, R.: Pytorch image models. https://github.com/rwrightman/pytorch-image-models (2019). https://doi.org/10.5281/zenodo.4414861", + "39. Xu, K., Rui, L., Li, Y., Gu, L.: Feature normalized knowledge distillation for image classification. In: European conference on computer vision. pp. 664-680. Springer (2020)", + "40. Xu, R., Li, G., Yang, J., Lin, L.: Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1426-1435 (2019)", + "41. Yang, C., Zhou, H., An, Z., Jiang, X., Xu, Y., Zhang, Q.: Cross-image relational knowledge distillation for semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12319-12328 (2022)", + "42. Yang, J., Martinez, B., Bulat, A., Tzimiropoulos, G., et al.: Knowledge distillation via softmax regression representation learning. International Conference on Learning Representations (ICLR) (2021)", + "43. Yang, Z., Li, Z., Shao, M., Shi, D., Yuan, Z., Yuan, C.: Masked generative distillation. In: European Conference on Computer Vision. pp. 53-69. Springer (2022)", + "44. Ye, J., Lu, X., Lin, Z., Wang, J.Z.: Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers. arXiv preprint arXiv:1802.00124 (2018)", + "45. Yim, J., Joo, D., Bae, J., Kim, J.: A gift from knowledge distillation: Fast optimization, network minimization and transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4133-4141 (2017)", + "46. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016)", + "47. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016)", + "48. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11953-11962 (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 811 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving KD via Regularizing Feature Direction and Norm", + "bbox": [ + 326, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_model.json b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_model.json new file mode 100644 index 0000000000000000000000000000000000000000..2383f134a779f433b8df189ecc8168e5287902c4 --- /dev/null +++ b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_model.json @@ -0,0 +1,2599 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.218, + 0.141, + 0.787, + 0.185 + ], + "angle": 0, + "content": "Improving Knowledge Distillation via Regularizing Feature Direction and Norm" + }, + { + "type": "text", + "bbox": [ + 0.264, + 0.212, + 0.74, + 0.244 + ], + "angle": 0, + "content": "Yuzhu Wang\\(^{1}\\), Lechao Cheng\\(^{2\\boxtimes}\\), Manni Duan\\(^{1}\\), Yongheng Wang\\(^{1}\\), Zunlei Feng\\(^{3}\\), and Shu Kong\\(^{4,5,6}\\)" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.254, + 0.788, + 0.298 + ], + "angle": 0, + "content": "\\(^{1}\\)Zhejiang Lab \\(^{2}\\)Hefei University of Technology \\(^{3}\\)Zhejiang University \\(^{4}\\)University of Macau \\(^{5}\\)Institute of Collaborative Innovation \\(^{6}\\)Texas A&M University https://github.com/WangYZ1608/Knowledge-Distillation-via-ND" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.331, + 0.744, + 0.706 + ], + "angle": 0, + "content": "Abstract. Knowledge distillation (KD) is a particular technique of model compression that exploits a large well-trained teacher neural network to train a small student network. Treating teacher's feature as knowledge, prevailing methods train student by aligning its features with the teacher's, e.g., by minimizing the KL-divergence or L2-distance between their (logits) features. While it is natural to assume that better feature alignment helps distill teacher's knowledge, simply forcing this alignment does not directly contribute to the student's performance, e.g., classification accuracy. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student classifier. We are motivated to regularize student features at the penultimate layer using teacher towards training a better student classifier. Specifically, we present a rather simple method that uses teacher's class-mean features to align student features w.r.t their direction. Experiments show that this significantly improves KD performance. Moreover, we empirically find that student produces features that have notably smaller norms than teacher's, motivating us to regularize student to produce large-norm features. Experiments show that doing so also yields better performance. Finally, we present a simple loss as our main technical contribution that regularizes student by simultaneously (1) aligning the direction of its features with the teacher class-mean feature, and (2) encouraging it to produce large-norm features. Experiments on standard benchmarks demonstrate that adopting our technique remarkably improves existing KD methods, achieving the state-of-the-art KD performance through the lens of image classification (on ImageNet and CIFAR100 datasets) and object detection (on the COCO dataset)." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.718, + 0.706, + 0.732 + ], + "angle": 0, + "content": "Keywords: knowledge distillation \\(\\cdot\\) large-norm \\(\\cdot\\) feature direction" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.757, + 0.377, + 0.772 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.787, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Knowledge distillation (KD) is a specific technique for model compression that aims to train a smaller model (called student) by distilling knowledge learned" + }, + { + "type": "page_footnote", + "bbox": [ + 0.216, + 0.825, + 0.525, + 0.84 + ], + "angle": 0, + "content": "\\(\\text{忍}\\) Corresponding author: chenglc@hfut.edu.cn" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "image", + "bbox": [ + 0.342, + 0.146, + 0.358, + 0.155 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.36, + 0.148, + 0.394, + 0.157 + ], + "angle": 0, + "content": "student" + }, + { + "type": "image", + "bbox": [ + 0.408, + 0.148, + 0.431, + 0.157 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.434, + 0.148, + 0.457, + 0.157 + ], + "angle": 0, + "content": "acher" + }, + { + "type": "image", + "bbox": [ + 0.47, + 0.148, + 0.484, + 0.159 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.487, + 0.148, + 0.605, + 0.159 + ], + "angle": 0, + "content": "existing loss, e.g., \\(\\mathcal{L}_{ce},\\mathcal{L}_{kd}\\)" + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.146, + 0.634, + 0.155 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.636, + 0.148, + 0.73, + 0.156 + ], + "angle": 0, + "content": "our proposed loss \\(\\mathcal{L}\\)" + }, + { + "type": "image_caption", + "bbox": [ + 0.637, + 0.156, + 0.745, + 0.162 + ], + "angle": 0, + "content": "1 1" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.17, + 0.496, + 0.301 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.311, + 0.305, + 0.418, + 0.318 + ], + "angle": 0, + "content": "logit distillation" + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.171, + 0.758, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.568, + 0.305, + 0.692, + 0.318 + ], + "angle": 0, + "content": "feature distillation" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.329, + 0.788, + 0.455 + ], + "angle": 0, + "content": "Fig. 1: Our main contribution is a simple loss, termed \\(\\mathcal{L}_{dino}\\), that regularizes the direction and norm of the student features (details in Sec. 3.3). \\(\\mathcal{L}_{dino}\\) is applicable to different KD methods which can be categorized into two types in the context of classification: (left) logit distillation that regularizes logits or softmax scores (e.g., KD [15] and DKD [48]), and (right) feature distillation that regularizes features other than logits (e.g., ReviewKD [4]). In this work, we apply \\(\\mathcal{L}_{dino}\\) to the embedding feature particularly at the penultimate layer (before logits). Experiments show that learning with \\(\\mathcal{L}_{dino}\\) improves existing KD methods, achieving the state-of-the-art benchmarking results for image classification (Tab. 1) and object detection (Tab. 3)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.489, + 0.788, + 0.565 + ], + "angle": 0, + "content": "by a larger teacher model [15]. Deploying the small student model reduces inference computation (e.g., running time and memory use) compared against the original large model. Different from other model compression methods such as pruning [44] and quantization [10], KD has the flexibility of using different architectures of the student, which is preferred by certain real-world applications." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.567, + 0.788, + 0.734 + ], + "angle": 0, + "content": "Status quo. Treating teacher features as knowledge, KD distills such knowledge to train student by encouraging its features to be similar to the teacher's. Through the lens of image classification, prevailing methods can be categorized into two types: logit distillation (Fig. 1-left), and feature distillation (Fig. 1-right). Logit distillation trains the student by minimizing the KL divergence between its logits and the teacher's [15,48]. It assumes that, if student can produce logits more similar to teacher's, it should achieve better performance that approaches teacher's performance. However, logit distillation considers only the logit layer but not other intermediate layers. To exploit such, feature distillation trains student by encouraging its intermediate-layer features to be similar to the teacher's, e.g., by minimizing the L2 distance between their features [4,46]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Motivation. Despite the promising results of logit distillation and feature distillation methods, forcing the student to produce similar logits or features to the teacher's does not directly serve the final task, e.g., classification. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student-classifier. Rather, student features are better regularized by the teacher to facilitate learning a better student classifier. Therefore, we are" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.237 + ], + "angle": 0, + "content": "motivated to exploit teacher's classifier to train better student towards better performance. Moreover, we empirically find that encouraging the student to produce large-norm features yields better performance (Fig. 2). Other lines of work such as domain adaptation [40] and pruning [44] also find the benefit of learning large-norm features, motivating us to train the student to produce large-norm features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.238, + 0.79, + 0.451 + ], + "angle": 0, + "content": "Contributions. We make three major contributions. First, we take a novel perspective to improve KD by regularizing student to produce features that (1) are aligned with class-means features computed by the teacher, and (2) have sufficiently large norms. Second, we study multiple baseline methods to achieve such regularizations. We show that when incorporating either or both, existing KD methods yields better performance, e.g., classification accuracy and object detection precision by the student. Third, we propose a novel and simple loss that simultaneously regularizes feature direction and norm, termed dino-loss. Experiments demonstrate that additionally adopting our dino-loss helps existing KD methods achieve better performance. For example, on the standard benchmark ImageNet [5], applying dino-loss to KD [15] achieves \\(72.49\\%\\) classification accuracy (Fig. 5), better than the original KD \\((71.35\\%)\\), with ResNet-18 and ResNet-50 architectures for student and teacher, respectively. This outperforms recent methods ReviewKD [4] \\((71.09\\%)\\) and DKD [48] \\((71.85\\%)\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.474, + 0.388, + 0.49 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.789, + 0.735 + ], + "angle": 0, + "content": "Knowledge distillation. (KD) aims to train a small student model by distilling knowledge of a well-trained large teacher model. The knowledge is delivered by features produced by the teacher for training data. Therefore, the key to KD is to align student features to the teacher's. The seminal KD method [15] propose to train student by aligning its logits with the teacher's, i.e., minimizing the Kullback-Leibler divergence (KL) between logits. Other works improve KD by decoupling the KL loss into multiple terms [48] or consider logits rankings [16]. Distilling logit knowledge alone may not be sufficient as this does not exploit intermediate-layer features. Hence, feature distillation proposes to align more features at other layers [1, 4, 14, 25, 26, 30, 34, 41, 45, 46]. Another line of research adopts network architecture search towards finding small student for KD [7, 19, 20], achieving the state-of-the-art at a cost of extra computation for architecture search. In this work, we take a different and orthogonal perspective to improve KD with simple methods, by encouraging the student to produce features to be aligned with the direction of teacher classifier and of large norms." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.79, + 0.84 + ], + "angle": 0, + "content": "Constructing classifiers using off-the-shelf features. Off-the-shelf features extracted from a well-trained model can be used to construct strong classifiers. One simple classifier is to compute class-mean of training examples in the feature space, and uses such as the classifier [6,17,33]. On the other hand, recent literature of pretrained large models [28] shows that using off-the-shelf features and cosine similarity is a powerful classifier for zero-shot recognition. In this work, we propose to regularize student features using class-mean of teacher" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.144, + 0.391, + 0.236 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.217, + 0.237, + 0.391, + 0.249 + ], + "angle": 0, + "content": "(a) regularize feature direction" + }, + { + "type": "image", + "bbox": [ + 0.397, + 0.145, + 0.508, + 0.234 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.397, + 0.237, + 0.508, + 0.249 + ], + "angle": 0, + "content": "(b) teacher feature" + }, + { + "type": "image", + "bbox": [ + 0.514, + 0.145, + 0.622, + 0.234 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.513, + 0.237, + 0.624, + 0.249 + ], + "angle": 0, + "content": "(c) student feature" + }, + { + "type": "image", + "bbox": [ + 0.63, + 0.144, + 0.788, + 0.236 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.63, + 0.237, + 0.786, + 0.249 + ], + "angle": 0, + "content": "(d) regularize feature norm" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.261, + 0.788, + 0.469 + ], + "angle": 0, + "content": "Fig. 2: Regularizing feature direction and norm helps knowledge distillation and improves student's performance. We train a ResNet-56 teacher and use the classic KD method [15] to train a ResNet-8 student on the CIFAR10 dataset. (a) We propose to regularize student by aligning its feature direction with the class-mean features computed by teacher. To do so, we adopt a simple cosine loss term on the penultimate-layer features (Sec. 3.2). Results show that regularizing feature direction improves student's performance. (b-c) We train teacher and student to produce 2D features at the penultimate layer from scratch (without using method KD [15]). We visualize them as 2D points, colored by class labels, and mark the class center by \\(\\star\\). Notably, the large teacher model produces large-norm features (b), while the small student model produces small-norm features (c). (d) This motivates us to regularize student by encouraging it to produce large-norm features (Sec. 3.2). To do so, we use the method SIFN [40]. Results show that properly regularizing feature norms improves student's performance. Our technical contribution is a simple loss that simultaneously regularizes student feature direction and norm, so we call it dino-loss." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.504, + 0.787, + 0.549 + ], + "angle": 0, + "content": "features, as well as other different methods for feature alignment. We hypothesize that doing so helps learn better student classifiers. Indeed, our experiments justify this hypothesis (Tab. 4)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.551, + 0.789, + 0.748 + ], + "angle": 0, + "content": "Learning large-norm features. Multiple lines of work find it important to learn large-norm features or weight parameters. For example, domain adaptation [40] reveals that the erratic discrimination of the target domain mainly stems from its much smaller feature norms w.r.t that of the source domain, and adopting a larger-norm constraint helps adapt a pretrained model (in the source domain) to a new target domain. Moreover, model pruning finds that features with smaller norms play a less informative role during the inference [44], so it is safe to remove weight parameters that produce small-norm features without causing notable performance drop. In our work, we also empirically find that a small-capacity model produces features that tend to collide in the small-norm region (Fig. 2c). Therefore, we are motivated to train student to produce large-norm features, hypothesizing that doing so improves student performance. Our experiments justify this hypothesis (Fig. 2d, Tab. 4)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.79, + 0.841 + ], + "angle": 0, + "content": "Feature regularization w.r.t norm and direction. The literature has multiple works studying feature regularization w.r.t its norm and direction in KD. We present them and explain how our method stands out. PKD [2] normalizes student and teacher features to have zero mean and unit variances to eliminate the gap in feature norms between them, and applies MSE loss between the normalized features. Our method encourages learning large-norm features of the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.389 + ], + "angle": 0, + "content": "student and additionally regularizes features using teacher classifier for better classification. Guo [8] transforms student logits to have the same norm of the teacher logits and performs KL-divergence on the transformed logits, whereas we encourage learning large-norm student features which can have feature norm larger than the teacher's (Fig. 4). FNKD [39] also advocates learning large-norm features but chooses to tune a temperature (shared by all classes) to enlarge logit values before softmax; differently, our method unifies norm regularization and feature direction regularization into a simple loss. Both SimKD [3] and SRRL [42] use MSE loss to align the student features with the teacher's without enlarging feature norms; Wang [35] uses an L2 loss to align features of teacher and student models and further adopts a loss based on locality-sensitive hashing to encourage the direction of student features to be aligned with teacher's. These methods do not necessarily learn a student to have feature norms that can be larger than the teacher's. In sum, our simple dino-loss not only aligns directions of student and teacher features but also explicitly encourages learning student to produce large-norm features." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.413, + 0.753, + 0.448 + ], + "angle": 0, + "content": "3 Improving Knowledge Distillation by Regularizing Feature Direction & Norm" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.788, + 0.51 + ], + "angle": 0, + "content": "We first describe notations and motivate our study of regularizing feature direction and norm to improve KD. Then, we introduce baselines, followed by our proposed dino-loss." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.533, + 0.484, + 0.549 + ], + "angle": 0, + "content": "3.1 Notations and Background" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.559, + 0.789, + 0.71 + ], + "angle": 0, + "content": "Notations. Without losing generality, we think of a classification neural network as two modules: a feature extractor \\( f(\\cdot; \\Theta) \\), and a classifier \\( g(\\cdot; \\mathbf{w}) \\), which are parameterized by \\( \\Theta \\) and \\( \\mathbf{w} \\), respectively. For the teacher, given input data \\( \\mathbf{x} \\), we denote its embedding feature as \\( \\mathbf{f}^t = f^t(\\mathbf{x}; \\Theta^t) \\), and the logits as \\( \\mathbf{z}^t = g^t(\\mathbf{f}^t; \\mathbf{w}^t) \\). Similarly, the student outputs the embedding features for \\( \\mathbf{x} \\) as \\( \\mathbf{f}^s = f^s(\\mathbf{x}; \\Theta^s) \\) and logits as \\( \\mathbf{z}^s = g^s(\\mathbf{f}^s; \\mathbf{w}^s) \\). We compute softmax scores in a vector \\( \\mathbf{q}^t = \\mathrm{softmax}(\\mathbf{z}^t; \\tau) \\), where \\( \\tau \\) is a temperature (default value as 1). Given \\( N \\) training examples from \\( C \\) classes, \\( \\mathbf{x}_i \\) and its label \\( y_i \\) (where \\( i = 1, \\dots, N \\)), one can train a classification model (e.g., the teacher) by minimizing the cross-entropy (CE) loss \\( \\mathcal{L}_{ce} \\) on all the training data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.711, + 0.788, + 0.759 + ], + "angle": 0, + "content": "Logit distillation trains the student by transferring the teacher knowledge using both the CE loss \\(\\mathcal{L}_{ce}\\) and a KD loss \\(\\mathcal{L}_{kd}\\). The seminal work of KD [15] uses KL divergence as the KD loss \\(\\mathcal{L}_{kd}\\), i.e., \\(\\mathcal{L}_{kd} = \\frac{1}{N}\\sum_{i=1}^{N}\\mathbf{KL}(\\mathbf{q}_i^t,\\mathbf{q}_i^s)\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.758, + 0.788, + 0.803 + ], + "angle": 0, + "content": "Feature distillation distills teacher knowledge by minimizing the difference of intermediate features at more layers other than the logits [4, 45, 46]. A typical loss term is the L2 distance \\(\\mathcal{L}_2\\) between student and teacher features. For" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.788, + 0.842 + ], + "angle": 0, + "content": "1 When student and teacher have different features dimensions, one can learn extra layers in student to project its features to the same dimension as teacher's [4]." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.18 + ], + "angle": 0, + "content": "example, over the embedding features at the penultimate layer (before logits), it applies the L2 loss \\(\\mathcal{L}_{kd} = \\frac{1}{N}\\sum_{i=1}^{N}\\mathcal{L}_2(\\mathbf{f}_i^s,\\mathbf{f}_i^t)\\) in addition to the CE loss \\(\\mathcal{L}_{ce}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.18, + 0.788, + 0.21 + ], + "angle": 0, + "content": "The final loss is \\(\\mathcal{L} = \\mathcal{L}_{ce} + \\alpha \\mathcal{L}_{kd}\\), where \\(\\alpha\\) controls the significance of the KD loss \\(\\mathcal{L}_{kd}\\) depending on distillation choice: logit distillation or feature distillation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.233, + 0.411, + 0.248 + ], + "angle": 0, + "content": "3.2 Baseline Methods" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.38 + ], + "angle": 0, + "content": "Recall that we are motivated to regularize student features during training: aligning their direction with teacher class-mean features, and encouraging them to be large in norm. In the main paper, we focus on the embedding features \\(\\mathbf{f}^s\\) at the penultimate layer, which are the direct input to a classifier; we also validate its effectiveness at other layers (Tab. 5). We compute the class-mean of the \\(k^{th}\\) class as \\(\\mathbf{c}_k = \\frac{1}{|\\mathcal{I}_k|}\\sum_{j\\in \\mathcal{I}_k}\\mathbf{f}_j^t\\), where \\(\\mathcal{I}_k\\) is the set of indices of training examples belonging to class-\\(k\\). We now introduce simple techniques to regularize student features using \\(\\mathbf{c}_k\\) w.r.t feature direction and norm." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.381, + 0.789, + 0.41 + ], + "angle": 0, + "content": "Feature Direction Regularization. We present two simple baseline methods below to regularize student w.r.t feature direction." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.412, + 0.789, + 0.457 + ], + "angle": 0, + "content": "Baseline-1: cosine similarity. We use a simple cosine similarity based loss term to regularize the feature direction of \\(\\mathbf{f}_i^s\\) according to the mean feature \\(\\mathbf{c}_k\\) of the corresponding class-\\(k\\):" + }, + { + "type": "equation", + "bbox": [ + 0.381, + 0.468, + 0.788, + 0.505 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {d} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\left(1 - \\cos \\left(\\mathbf {f} _ {i} ^ {s}, \\mathbf {c} _ {k}\\right)\\right) \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.514, + 0.788, + 0.575 + ], + "angle": 0, + "content": "Baseline-2: InfoNCE. Using the cosine similarity loss Eq. 1 considers only paired examples and their corresponding class-mean. Inspired by InfoNCE [24], we also consider inter-class examples and class-means. Therefore, we train student by minimizing:" + }, + { + "type": "equation", + "bbox": [ + 0.34, + 0.587, + 0.788, + 0.625 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {d} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} - \\log \\frac {\\exp \\left(\\cos \\left(\\mathbf {f} _ {i} ^ {s} , \\mathbf {c} _ {k}\\right)\\right)}{\\sum_ {j = 1} ^ {C} \\exp \\left(\\cos \\left(\\mathbf {f} _ {i} ^ {s} , \\mathbf {c} _ {j}\\right)\\right)} \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.663 + ], + "angle": 0, + "content": "Feature Norm Regularization. We present two baseline methods below to regularize student towards producing large-norm features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.664, + 0.788, + 0.738 + ], + "angle": 0, + "content": "Baseline-1: \\(\\mathcal{L}_2\\) distance. As shown by Fig. 2c, the small-capacity student model produces features that have notably smaller norm than the teacher's. To train the student to produce larger-norm features, perhaps a naive method is to increase student feature norm towards teacher's. To this end, we minimize the L2 distance between features of student and teacher:" + }, + { + "type": "equation", + "bbox": [ + 0.399, + 0.748, + 0.788, + 0.786 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {n} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\| \\mathbf {f} _ {i} ^ {s} - \\mathbf {f} _ {i} ^ {t} \\| _ {2} ^ {2} \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Minimizing Eq. 3 is a common practice in feature distillation [1,4,14]. It implicitly trains student to produce features with norms approaching the corresponding larger-norm teacher features." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "Baseline-2: Stepwise increasing feature norms (SIFN). We now describe a loss to explicitly increase the norm of the student features. Inspired by [40], we gradually increase the feature norm by minimizing:" + }, + { + "type": "equation", + "bbox": [ + 0.318, + 0.203, + 0.788, + 0.24 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {n} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\mathcal {L} _ {2} \\left(f ^ {s} \\left(\\mathbf {x} _ {i}; \\Theta_ {\\text {p r e v i o u s}} ^ {s}\\right) + r, f ^ {s} \\left(\\mathbf {x} _ {i}; \\Theta_ {\\text {c u r r e n t}} ^ {s}\\right)\\right), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.249, + 0.784, + 0.295 + ], + "angle": 0, + "content": "where \\(\\Theta_{previous}^{s}\\) and \\(\\Theta_{current}^{s}\\) are parameters of an early checkpoint and the current model being optimized, respectively; \\(r\\) is a step size to increase the norm of student features during training." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.318, + 0.461, + 0.334 + ], + "angle": 0, + "content": "3.3 The Proposed dino Loss" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.345, + 0.785, + 0.466 + ], + "angle": 0, + "content": "We now present the proposed dino-loss that simultaneously achieves the above two goals: (1) aligning student features to teacher's w.r.t direction, and (2) learning large-norm student features. For simplicity, we drop the subscript (i.e., the index of a training example or class ID). Let \\(\\mathbf{f}^s\\) and \\(\\mathbf{f}^t\\) be the embedding features of an input \\(\\mathbf{x}\\) computed by student and teacher, respectively. Based on \\(\\mathbf{x}\\)'s ground-truth label \\(y\\), we have its corresponding class-mean \\(\\mathbf{c}\\). We denote the unit vector \\(\\mathbf{e} = \\mathbf{c} / \\| \\mathbf{c}\\|_2\\), and \\(\\mathbf{p}^t = \\mathbf{e}\\| \\mathbf{f}^t\\|_2\\). We compute the projection of \\(\\mathbf{f}^s\\) along \\(\\mathbf{c}\\)'s direction: \\(\\mathbf{p}^s = \\mathbf{e}\\| \\mathbf{f}^s\\|_2\\cos (\\mathbf{f}^s,\\mathbf{c})\\). Fig. 3 shows the geometric meaning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.467, + 0.573, + 0.542 + ], + "angle": 0, + "content": "When the norm of \\(\\mathbf{f}^s\\) is small, or its projection \\(\\mathbf{p}^s\\) has small norm, i.e., \\(\\| \\mathbf{p}^s\\| _2 < \\| \\mathbf{f}^t\\| _2\\), we encourage the student to output larger-norm features and align them with the teacher class-mean by minimizing \\(\\| \\mathbf{p}^t -\\mathbf{p}^s\\| _2\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.543, + 0.574, + 0.635 + ], + "angle": 0, + "content": "Because the feature norms of different examples can vary by an order of magnitude (see Fig. 2c), naively learning with the above can produce artificially large gradients from specific training data and negatively affect training. Thus, we divide the above by \\(\\| \\mathbf{f}^t\\| _2\\) , which is equivalent to \\(\\| \\mathbf{p}^t\\| _2\\) .." + }, + { + "type": "equation", + "bbox": [ + 0.227, + 0.644, + 0.572, + 0.686 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {d i n o}} = \\frac {\\| \\mathbf {p} ^ {t} - \\mathbf {p} ^ {s} \\| _ {2}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} = \\frac {\\| \\mathbf {p} ^ {t} \\| _ {2} - \\| \\mathbf {p} ^ {s} \\| _ {2}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} = 1 - \\frac {\\mathbf {f} ^ {s} \\cdot \\mathbf {e}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} \\tag {5}\n\\]" + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.503, + 0.752, + 0.598 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.583, + 0.614, + 0.788, + 0.656 + ], + "angle": 0, + "content": "Fig. 3: Illustration of notations used in our dino-loss loss and its geometric meaning." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.687, + 0.572, + 0.701 + ], + "angle": 0, + "content": "Minimizing Eq. 5 amounts to simultaneously" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.702, + 0.784, + 0.731 + ], + "angle": 0, + "content": "(1) increasing the norm of \\(\\mathbf{f}^s\\) and (2) reducing the angular distance between \\(\\mathbf{f}^s\\) and the class-mean \\(\\mathbf{c}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.732, + 0.784, + 0.762 + ], + "angle": 0, + "content": "When \\(\\mathbf{f}^s\\) has large norm, i.e., \\(\\| \\mathbf{f}^s\\| _2\\geq \\| \\mathbf{f}^t\\| _2\\), we only minimize the angular distance between student feature and the class-mean defined by the teacher:" + }, + { + "type": "equation", + "bbox": [ + 0.439, + 0.772, + 0.787, + 0.801 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {d i n o}} = 1 - \\frac {\\mathbf {f} ^ {s} \\cdot \\mathbf {e}}{\\| \\mathbf {f} ^ {s} \\| _ {2}} \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "The above loss means that the feature norm of student is no longer explicitly required to reach a larger value if it is already large enough; yet it is still allowed" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.129 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.788, + 0.178 + ], + "angle": 0, + "content": "to increase freely during training. We merge Eq. 5 and 6 and average over all training examples as our dino-loss (dropping the constant 1):" + }, + { + "type": "equation", + "bbox": [ + 0.354, + 0.188, + 0.788, + 0.226 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {d i n o} = - \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\frac {\\mathbf {f} _ {i} ^ {s} \\cdot \\mathbf {e} _ {k}}{\\max \\left\\{\\| \\mathbf {f} _ {i} ^ {s} \\| _ {2} , \\| \\mathbf {f} _ {i} ^ {t} \\| _ {2} \\right\\}} \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.234, + 0.788, + 0.264 + ], + "angle": 0, + "content": "Compatible with existing KD methods, our dino-loss \\(\\mathcal{L}_{dino}\\) can be used altogether with CE loss \\(\\mathcal{L}_{ce}\\) and KD loss \\(\\mathcal{L}_{kd}\\) to train student:" + }, + { + "type": "equation", + "bbox": [ + 0.419, + 0.275, + 0.788, + 0.29 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {c e} + \\alpha \\mathcal {L} _ {k d} + \\beta \\mathcal {L} _ {d i n o} \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.785, + 0.344 + ], + "angle": 0, + "content": "\\(\\alpha\\) and \\(\\beta\\) are the weights for \\(\\mathcal{L}_{kd}\\) and \\(\\mathcal{L}_{dino}\\), respectively. The definition of \\(\\mathcal{L}_{kd}\\) depends on the distillation method. Otherwise stated, we study \\(\\mathcal{L}_{dino}\\) with the seminal logit distillation method KD [15], so \\(\\mathcal{L}_{kd} = \\mathbf{KL}\\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.345, + 0.788, + 0.42 + ], + "angle": 0, + "content": "Remark. The dino-loss simultaneously encourages student to output large-norm features (possibly larger than teacher's, as shown in Fig. 4), and minimizes the angular distance between student features and the class-mean defined by the teacher during training. This is a desired property in terms of training the student to achieve better classification accuracy." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.443, + 0.376, + 0.46 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.475, + 0.444, + 0.49 + ], + "angle": 0, + "content": "4.1 Datasets and Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.499, + 0.785, + 0.529 + ], + "angle": 0, + "content": "For fair comparisons, our implementation adheres to the previous methodologies outlined in [4, 16, 34, 48]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.53, + 0.788, + 0.68 + ], + "angle": 0, + "content": "CIFAR-100 [18] contains 50k training images and 10k testing images. During training, we adopt random cropping and random left-right flipping augmentations. We randomly initialize weight parameters following [12] and train all student networks from scratch. The teacher models are publicly available that are adopted in prior art [34]. The student networks are trained using a batch size of 128 for 240 epochs (with a linear warm-up for the first 20 epochs), employing SGD with a weight decay of 5e-4 and momentum of 0.9. We set the initial learning rate of 0.1 for ResNet [13] and WRN [47] backbones, and 0.02 for MobileNet [32] and ShuffleNet [23] backbones, decaying it with a factor of 10 at 150th, 180th, and 210th epochs. The temperature is empirically set to 4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.681, + 0.788, + 0.785 + ], + "angle": 0, + "content": "ImageNet [31] has 1.28 million training images and 50,000 validation images spanning by 1,000 categories. We employ SGD with a batch size of 512 for a total of 100 epochs (with a linear warm-up for the first 5 epochs). The initial learning rate is set to 0.2 and is reduced by a factor of 10 every 30 epochs. Besides, the weight decay and momentum are set to 1e-4 and 0.9, respectively. The pre-trained weights for teacher come from PyTorch² and TIMM [38] for fair comparisons. The temperature for knowledge distillation is set to 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.786, + 0.788, + 0.817 + ], + "angle": 0, + "content": "COCO 2017 [22] consists of 80 object categories with 118k training images and 5k validation images. We utilize Faster R-CNN [29] with FPN [21] as the" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.547, + 0.841 + ], + "angle": 0, + "content": "2 https://pytorch.org/vision/stable/models.html" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Benchmarking results on CIFAR100. Methods are reported w.r.t top-1 accuracy (\\%) on the test set. ++ means that we apply the proposed dino-loss to existing methods. Clearly, doing so improves performance over the original KD methods and outperforms prior KD methods. We mark performance gains over corresponding methods using green superscripts." + }, + { + "type": "table", + "bbox": [ + 0.214, + 0.226, + 0.785, + 0.453 + ], + "angle": 0, + "content": "
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher (T)72.3475.6179.4279.3479.4279.42
student (S)69.0671.9872.5064.6070.5071.82
Feature distillation methods
FitNet [30]69.2172.2473.5063.1673.5973.54
RKD [25]69.6172.2271.9064.4372.2873.21
PKT [27]70.3473.4573.6466.5274.1074.69
OFD [14]70.9874.3374.9569.0475.9876.82
CRD [34]71.1674.1475.5169.1175.1175.65
ReviewKD [4]71.8975.0975.6369.8977.4577.78
ReviewKD++72.05+0.1675.66+0.5776.07+0.4470.45+0.5677.68+0.2377.93+0.15
Logit distillation methods
KD [15]70.6673.5473.3367.6574.0774.45
KD++72.53+1.8774.59+1.0575.54+2.2170.10+2.3575.45+1.3876.42+1.97
DIST [16]71.7874.4275.7969.1775.2376.08
DIST++72.52+0.7475.00+0.5876.13+0.3469.80+0.6375.60+0.3776.64+0.56
DKD [48]71.9774.8175.4470.3576.4577.07
DKD++72.16+0.1975.02+0.2176.28+0.8470.82+0.4777.11+0.6677.49+0.42
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.788, + 0.541 + ], + "angle": 0, + "content": "feature extractor, and employ the dino-loss on the R-CNN head, wherein both teacher and student models adopt ResNet [13] as the backbone. In addition, MobileNet-V2 [32] is used as a heterogeneous student model. All student models are trained with 1x scheduler, following the public toolbox Detectron2.3" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.563, + 0.611, + 0.578 + ], + "angle": 0, + "content": "4.2 Comparisons with State-of-the-art Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.589, + 0.789, + 0.725 + ], + "angle": 0, + "content": "CIFAR-100 classification. Tab. 1 shows the KD performances on the CIFAR-100 dataset. In this context, spanning homogeneous and heterogeneous architectures, we undertake an extensive assessment over prominent feature distillation methods and logits distillation methods. The ++ signifies the integration of our novel dino-loss into the existing methods. A salient conclusion from Tab. 1 is that our proposed dino-loss empowers existing KD methods to achieve better classification accuracy. This suggests the effectiveness and compatibility of the dino-loss, which can serve as a plugin for existing KD methods, irrespective of the homogeneity or heterogeneity for network architectures." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.726, + 0.789, + 0.817 + ], + "angle": 0, + "content": "ImageNet classification. We demonstrate the effectiveness of the proposed dino-loss on the well-established benchmark ImageNet. Tab. 2 lists detailed results. It is worth noting that with our simple dino-loss, the method \\(\\mathbf{KD}++\\) already outperforms most of previous methods (e.g., ReviewKD [4], DKD [48], and SRRL [43]). Moreover, incorporating our dino-loss, other methods such as ReviewKD++ and DKD++ also achieve notable improvements." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.561, + 0.84 + ], + "angle": 0, + "content": "3 https://github.com/facebookresearch/detectron2" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.242 + ], + "angle": 0, + "content": "Table 2: Comparisons with state-of-the-art methods on the ImageNet validation set. \\(\\mathrm{KD}++\\) serves as a stronger baseline that introduces no more parameters and negligible training time over the vanilla KD [15] and outperforms most of previous methods (e.g., ReviewKD [4], SRRL [42], and MGD [43]). Methods marked by \\(\\dagger\\) adopts a searching strategy, demanding significant more computation cost to achieve the state-of-the-art performance. In contrast, our dino-loss is rather simple that helps existing KD methods to rival search-based methods." + }, + { + "type": "table", + "bbox": [ + 0.242, + 0.254, + 0.754, + 0.424 + ], + "angle": 0, + "content": "
MethodsResNet-34 → Top-1ResNet-18 Top-5ResNet-50 → Top-1MobileNet-V1 Top-5
student69.7689.4368.8788.76
teacher73.3191.5976.1692.86
CRD ICLR2020 [34]71.1790.1371.3790.42
SRRL ICLR2021 [42]71.7390.6072.4990.92
MGD ECCV2022 [43]71.5890.3572.3591.00
CAT-KD CVPR2023 [9]71.2690.4572.2491.13
KD NeurIPS2015 [15]70.6689.8870.5089.80
KD++71.98 (+1.32)90.53 (+0.65)72.77 (+2.27)91.14 (+1.34)
ReviewKD CVPR2021 [4]71.6290.5172.5691.00
ReviewKD++71.64 (-0.02)90.61 (+0.10)72.96 (+0.40)91.16 (+0.16)
DKD CVPR2022 [48]71.7090.4172.0591.05
DKD++72.07 (+0.37)90.59 (+0.18)72.63 (+0.58)91.07 (+0.02)
KD-Zero NeurIPS2023 [19]†72.1790.4673.0291.05
Auto-KD ICCV2023 [20]†72.4590.6973.2691.17
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.449, + 0.788, + 0.534 + ], + "angle": 0, + "content": "Table 3: Benchmarking KD methods for object detection on the COCO val2017 dataset (mAP in %). All methods use the Faster R-CNN detector with various teacher and student architectures, including RestNet {18,50,101} and MobileNet-V2 (MV2). Incorporating our dino-loss, simple methods \\(\\mathrm{KD + + }\\) and ReviewKD++ obtain notable performance gains (marks in green) over their original counterparts, achieving the state-of-the-art performance." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.545, + 0.785, + 0.637 + ], + "angle": 0, + "content": "
MethodsR101→R18R101→R50R50→MV2
mAP\\( AP^{50} \\)\\( AP^{75} \\)mAP\\( AP^{50} \\)\\( AP^{75} \\)mAP\\( AP^{50} \\)\\( AP^{75} \\)
teacher42.0462.4845.8842.0462.4845.8840.2261.0243.81
student33.2653.6135.2637.9358.8441.0529.4748.8730.90
KD [15]33.9754.6636.6238.3559.4141.7130.1350.2831.35
FitNet [30]34.1354.1636.7138.7659.6241.8030.2049.8031.69
FGFI [36]35.4455.5138.1739.4460.2743.0431.1650.6832.92
DKD [48]35.0556.6037.5439.2560.9042.7332.3453.7734.01
ReviewKD [4]36.7556.7234.0040.3660.9744.0833.7153.1536.13
KD++36.12 (+2.15)56.81 (+2.15)37.64 (+1.02)39.86 (+1.51)61.07 (+1.66)43.57 (+1.86)33.26 (+3.13)53.71 (+3.43)34.85 (+3.50)
ReviewKD++37.43 (+0.68)57.96 (+1.24)40.15 (+6.15)41.03 (+0.67)61.80 (+0.83)44.94 (+0.86)34.51 (+0.80)55.18 (+2.03)37.21 (+1.08)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.789, + 0.841 + ], + "angle": 0, + "content": "We note that recent KD methods adopt a searching strategy for better results, e.g., KD-Zero [19] and Auto-KD [20]. These methods search for a distiller in a space of predefined modules, e.g., normalization methods, losses, transform operations, activation functions, etc. At the cost of significantly more computation time for searching, they achieve the best performance on the benchmark, slightly better than ours. Nevertheless, our dino-loss helps existing much simpler methods rival search-based approaches! Compared against search-based methods, applying our dino-loss, methods such as \\(\\mathrm{KD}++\\) introduce no more parameters and negligible training time over the counterparts (e.g., vanilla KD [15]). This makes the use of our dino-loss a stronger baseline for knowledge distillation. Interestingly, current search-based methods do not consider our proposed regularization methods, i.e., feature norm regularizer and feature direction regularizer. That said, our method" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.243 + ], + "angle": 0, + "content": "Table 4: Analysis of feature direction and norm regularization. We train teacher (ResNet-50, ResNet-56) and student (MobileNet-V2, ResNet-20) models on the CIFAR100 dataset and report accuracy \\((\\%)\\) on its test-set. We use KD [15] as the baseline, which is a logit distillation method. From (a-b), we see that applying either direction or norm regularization on student features improves KD as shown by the increased student accuracy. While combining both outperforms baseline (c), using dino-loss achieves the best (d)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.266, + 0.479, + 0.294 + ], + "angle": 0, + "content": "(a) Regularizing feature direction only. Cosine is more robust than InfoNCE." + }, + { + "type": "table", + "bbox": [ + 0.241, + 0.308, + 0.451, + 0.359 + ], + "angle": 0, + "content": "
caseR50→MV2R56→R20
baseline67.6570.66
cosine69.18 (+1.53)71.75 (+1.09)
InfoNCE69.06 (+1.41)70.73 (+0.07)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.362, + 0.476, + 0.417 + ], + "angle": 0, + "content": "(c) Regularizing both feature norm and direction. Simple addition does not yield better results (e.g., cosine + \\(\\mathcal{L}_2\\) vs. cosine vs. \\(\\mathcal{L}_2\\))." + }, + { + "type": "table", + "bbox": [ + 0.226, + 0.431, + 0.472, + 0.493 + ], + "angle": 0, + "content": "
caseR50→MV2R56→R20
cosine + L268.62 (+0.97)71.58 (+0.92)
cosine + SIFN69.07 (+1.42)71.72 (+1.06)
InfoNCE + L268.47 (+0.82)70.81 (+0.15)
InfoNCE + SIFN68.71 (+1.06)71.04 (+0.38)
" + }, + { + "type": "text", + "bbox": [ + 0.525, + 0.266, + 0.789, + 0.294 + ], + "angle": 0, + "content": "(b) Regularizing feature norm only. \\(SIFN\\) is more robust than \\(\\mathcal{L}_2\\)" + }, + { + "type": "table", + "bbox": [ + 0.554, + 0.308, + 0.758, + 0.359 + ], + "angle": 0, + "content": "
caseR50→MV2R56→R20
baseline67.6570.66
L269.05 (+1.40)71.85 (+1.19)
SIFN69.32 (+1.67)72.13 (+1.47)
" + }, + { + "type": "text", + "bbox": [ + 0.52, + 0.362, + 0.783, + 0.417 + ], + "angle": 0, + "content": "(d) The proposed dino-loss can perfectly integrate the advantages of regularization feature norm and direction, and perform best." + }, + { + "type": "table", + "bbox": [ + 0.531, + 0.431, + 0.796, + 0.493 + ], + "angle": 0, + "content": "
caseR50→MV2R56→R20
CE + KL (baseline)67.6570.66
CE + dino68.78 (+1.13)71.96 (+1.30)
KL + dino68.68 (+1.03)72.04 (+1.38)
CE + KL + dino70.10 (+2.45)72.53 (+1.87)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.785, + 0.551 + ], + "angle": 0, + "content": "is orthogonal to existing KD methods and can potentially serve as modules for searching, suggesting the novelty of our work." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.788, + 0.659 + ], + "angle": 0, + "content": "COCO Object Detection. We verify the efficacy of the proposed dino-loss for knowledge distillation through the lens of object detection on the COCO dataset. Tab. 3 lists detailed results compared to prior works. Specifically, the ReviewKD++ yields a significant improvement in performance, outperforming state-of-the-art results with a remarkable margin. Moreover, this experiment and the above demonstrate the applicability of our dino-loss across tasks (i.e., image classification and object detection)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.68, + 0.391, + 0.696 + ], + "angle": 0, + "content": "4.3 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.78 + ], + "angle": 0, + "content": "In this subsection, we first conduct an ablation study on feature norm and direction regularization with the CIFAR-100 dataset. Subsequently, we perform a visual analysis of the impact before and after applying dino-loss. Finally, we conduct intriguing experiments on ImageNet to validate the benefits of using our approach that encourages learning large-norm features of the student model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.781, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The effectiveness feature direction and norm regularization. Recall the baseline methods in Sec. 3.2 and 3.2 for feature direction and norm regularization. We present results for \\(\\mathcal{L}_2\\) (Eq. 3) and SIFN (Eq. 4) on CIFAR-100 in Tab. 4b. Yet additional offline experiments substantiate that SIFN outperforms" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.271 + ], + "angle": 0, + "content": "Table 5: Comparison of using teacher's classifier weights (dubbed \"w/ weights\") versus per-class mean features (dubbed \"w/ class-mean\") in our dino-loss. We study them with the KD method [15] on CIFAR-100. Results show that using per-class mean features outperforms classifier weights. Moreover, we apply our dino-loss at more layers other than the penultimate layer (cf. the bottom row block). Here, layer-x means that the dino-loss is applied to all the x layers right before the penultimate layer. In particular, layer-0 means that the dino-loss is applied only at the penultimate layer (i.e., \"w/ class-mean\" in this table). Results show that applying dino-loss at other layers also leads to improvements but doing so at the penultimate layer achieves the best performance." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.283, + 0.785, + 0.433 + ], + "angle": 0, + "content": "
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher72.3475.6179.4279.3479.4279.42
student69.0671.9872.5064.6070.5071.82
KD [15]70.6673.5473.3367.6574.0774.45
L2 ofcls weights70.5473.6173.7666.8173.6274.13
w/ weights71.7373.9775.0669.7675.2475.61
w/ class-mean72.5374.5975.5470.1075.4576.42
apply dino-loss to other layers
layer-171.3073.7474.2369.4475.0176.26
layer-271.9673.8174.1269.1075.7276.53
layer-371.1973.6173.9268.8774.9376.10
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.469, + 0.787, + 0.53 + ], + "angle": 0, + "content": "\\(\\mathcal{L}_2\\) regularization in terms of performance and consistently affirm that large student feature norms encapsulate more teacher knowledge. Similarly, Tab. 4a shows superior gains of cosine similarity-based regularizer (Eq. 1) over InfoNCE (Eq. 2); both underscore the significance of feature direction regularization." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.534, + 0.788, + 0.609 + ], + "angle": 0, + "content": "Our dino-loss yields better results. Tab. 4c shows that feature direction regularization (cosine, InfoNCE) and feature norm regularization \\((\\mathcal{L}_2\\), SIFN) improve KD. While combining them helps KD (e.g., cosine + \\(\\mathcal{L}_2\\), cosine + SIFN), our dino-loss performs the best at \\(70.10\\%\\) accuracy (Tab. 4d). This convincingly shows the superiority of our dino-loss over others." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Class-mean vs. classifier weights in regularizing student feature direction. We perform a quantitative analysis of using the teacher's classifier weights and per-class feature mean to regularize student's features. We adopt the classifier weights that are derived from teacher as centers in our dino-loss to train student models (dubbed \"w/ weights\"). In comparison, we utilize per-class feature means, denoted as \"w/ class-mean\" (which is our proposed method). The results in Tab. 5 clearly demonstrate that the utilization of per-class feature mean performs better than the method of using teacher's classifier weights for feature direction regularization. Additionally, we have implemented an alternative approach that employs an L2 loss to guide the student to output classifier weights similar to those of the teacher (referred to as \"L2 of cls weight\"). However, this approach consistently underperforms our \"w/ class-mean\" method and even lags behind the baseline KD method [15] in most experimental settings. These findings provide strong evidence for the superiority of employing class-mean features over the teacher's classifier weights." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.357, + 0.246 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.253, + 0.248, + 0.321, + 0.26 + ], + "angle": 0, + "content": "(a) teacher" + }, + { + "type": "image", + "bbox": [ + 0.362, + 0.145, + 0.498, + 0.245 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.365, + 0.248, + 0.495, + 0.26 + ], + "angle": 0, + "content": "(b) naive small model" + }, + { + "type": "image", + "bbox": [ + 0.507, + 0.145, + 0.64, + 0.245 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.518, + 0.248, + 0.627, + 0.26 + ], + "angle": 0, + "content": "(c) student by KD" + }, + { + "type": "image", + "bbox": [ + 0.649, + 0.146, + 0.785, + 0.245 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.65, + 0.248, + 0.782, + 0.26 + ], + "angle": 0, + "content": "(d) student by \\(\\mathrm{KD} + +\\)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.271, + 0.789, + 0.397 + ], + "angle": 0, + "content": "Fig. 4: Visualization of 2D embedding features. (a) Features computed by teacher (ResNet-50) are well separated at class label; note the purple class pointed by red arrow. (b) A small-capacity model (ResNet-18) fails to separate this purple class, which is occluded by others. (c) Even using KD [15] to train ResNet-18 student cannot reveal this purple class. (d) Using our dino-loss along with KD, i.e., \\(\\mathrm{KD}++\\), achieves better separation of the points and reveals purple class. This attributes to the feature direction regularization using teacher class-means. Moreover, student features in (d) have larger-norms than the teacher in (a) because our dino-loss explicitly encourages learning large-norm features of the student." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.429, + 0.789, + 0.504 + ], + "angle": 0, + "content": "Applying the dino-loss to other layers. In the above experiment, we apply the dino-loss to the penultimate layer only. Here, we study applying it to other layers and evaluate on CIFAR-100 in bottom of Tab. 5. Results show that our dino-loss applied at other layers also improves over the baseline KD but performs the best when applied at the penultimate layer." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.505, + 0.79, + 0.611 + ], + "angle": 0, + "content": "\\(\\mathrm{KD}++\\) is a strong baseline. Tab. 4d illustrates the impacts of different losses in KD. By incorporating dino-loss into conventional KD framework [15], \\(\\mathrm{KD}++\\) (i.e., \\(\\mathrm{CE} + \\mathrm{KL} + \\mathrm{dino}\\)) achieves a significant improvement: KD \\((67.65\\%) \\rightarrow \\mathrm{KD}++\\) \\((70.10\\%)\\). Further, combining dino-loss with CE or KL can also boost the accuracy by \\(\\sim 1\\%\\) compared to the original KD method. It is worth noting that \\(\\mathrm{KD}++\\) introduces no additional parameters and negligible computation overhead, making it a strong baseline for KD (cf. more results in Tab. 1, 2, & 3)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.612, + 0.789, + 0.732 + ], + "angle": 0, + "content": "In addition, following [37], we visually examine the student feature in Fig. 4. First, as indicated in Fig. 4d, \\(\\mathrm{KD}++\\) demonstrates notably amplified feature norms, surpassing even those of the teacher depicted in Fig. 4a. Furthermore, the direction in \\(\\mathrm{KD}++\\) align well with the teacher (Fig. 4a vs. Fig. 4d, thereby maintaining consistent relative margins among categories. Another observation is that both the naive student (Fig. 4b) and the conventional KD (Fig. 4c) exhibit direct failures in classifying the purple category, whereas our approach, \\(\\mathrm{KD}++\\) (Fig. 4d), effectively learns student features that can discriminate all classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.789, + 0.794 + ], + "angle": 0, + "content": "The benefit from larger teacher models. Now we investigate whether our approach exhibits monotonically incremental performance gains when exploiting a larger teacher. We first examine the classic KD [15] framework, and two other recently proposed methods, namely ReviewKD [4] and DKD [48]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.841 + ], + "angle": 0, + "content": "As shown in Fig. 5, it is clear that for KD [15], DKD [48] and ReviewKD [4] show a degradation or fluctuation when scaling up the teacher from ResNet-34 to ResNet-152, with ResNet-18 as student. The main obstacle is the huge capacity" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "image", + "bbox": [ + 0.216, + 0.144, + 0.398, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.409, + 0.144, + 0.591, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.601, + 0.144, + 0.784, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.357 + ], + "angle": 0, + "content": "Fig. 5: Using our dino-loss can benefit from larger teacher models. The student is ResNet-18, with scaling up the teacher from ResNet-34 to ResNet-152 (denoted in the \\(x\\)-axis). We report the top-1 accuracy (\\%) on the ImageNet validation set. All results are the average accuracy over five runs. With the teacher capacity increasing, our methods, \\(\\mathrm{KD}++\\), \\(\\mathrm{DKD}++\\) and \\(\\mathrm{ReviewKD}++\\) (red) achieve better knowledge distillation results, even though the original distillation methods (blue) suffer from performance degradation with large teacher models (e.g., ResNet-152)." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.371, + 0.789, + 0.442 + ], + "angle": 0, + "content": "Table 6: A larger student gets better knowledge distillation performance. The teacher is ResNet-152 (top-1 acc, \\(78.31\\%\\)). We report the top-1 accuracy (\\%) on the ImageNet validation set. Model marked with \\(\\dagger\\) adopts a stronger recipe [11]. Results show that our dino-loss achieves consistent improvement, outperforming the model trained from scratch (cf. the first row)." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.453, + 0.784, + 0.498 + ], + "angle": 0, + "content": "
studentResNet-18ResNet-34ResNet-50ResNet-101ViT-SViT-BViT-B†
trained from scratch69.7673.3176.1677.3774.6478.0081.80
KD [15]70.6674.8476.9378.0475.7778.5182.39
KD++71.98 (+1.32)75.53 (+0.69)77.48 (+0.55)79.15 (+1.11)76.53 (+0.76)79.85 (+1.34)82.92 (+0.53)
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.526, + 0.785, + 0.601 + ], + "angle": 0, + "content": "gap between student and teacher [1,16,34]. Surprisingly, upon incorporating our dino-loss, distillation methods yield significant improvements compared to the original methods (e.g., \\(\\mathrm{KD}++\\) vs. KD, ReviewKD++ vs. ReviewKD). More importantly, they show a consistent improvement with scaling up the teacher size (e.g., \\(\\mathrm{KD}++: 71.99\\% \\rightarrow 72.49\\% \\rightarrow 72.54\\% \\rightarrow 72.59\\%\\))." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.602, + 0.787, + 0.663 + ], + "angle": 0, + "content": "The benefit from larger student models. We use \\(\\mathrm{KD}++\\) to study the effect of increasing the size of the student for knowledge distillation, and set the teacher as ResNet-152. The results in Tab. 6 demonstrate that increasing the capacity of the student significantly improves distillation results." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.686, + 0.509, + 0.701 + ], + "angle": 0, + "content": "5 Discussion and Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.718, + 0.787, + 0.762 + ], + "angle": 0, + "content": "Broader Impacts As our work falls in the area of knowledge distillation, we do not see any new potential societal impacts other than those already known, e.g., student models might learn bias and unfairness delivered by the teacher." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.763, + 0.787, + 0.824 + ], + "angle": 0, + "content": "Conclusion. We study feature regularization w.r.t norm and direction when training student models for better knowledge distillation (KD). Indeed, sufficient experiments and ablation studies demonstrate that doing so with our proposed dino-loss helps existing KD methods to achieve better performance." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.268 + ], + "angle": 0, + "content": "The authors would like to thank the anonymous reviewers for their valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China (U22A2032), by the Zhejiang Provincial Science and Technology Plan Project (2024SSYS0013), and in part by the National Natural Science Foundation of China under Grant No. (62106235). Shu Kong acknowledges the support by the University of Macau (SRG2023-00044-FST)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.288, + 0.323, + 0.304 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.787, + 0.36 + ], + "angle": 0, + "content": "1. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10925-10934 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.361, + 0.787, + 0.401 + ], + "angle": 0, + "content": "2. Cao, W., Zhang, Y., Gao, J., Cheng, A., Cheng, K., Cheng, J.: Pkd: General distillation framework for object detectors via pearson correlation coefficient. Advances in Neural Information Processing Systems 35, 15394-15406 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.402, + 0.787, + 0.442 + ], + "angle": 0, + "content": "3. Chen, D., Mei, J.P., Zhang, H., Wang, C., Feng, Y., Chen, C.: Knowledge distillation with the reused teacher classifier. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11933-11942 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.443, + 0.787, + 0.483 + ], + "angle": 0, + "content": "4. Chen, P., Liu, S., Zhao, H., Jia, J.: Distilling knowledge via knowledge review. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5008-5017 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.484, + 0.787, + 0.525 + ], + "angle": 0, + "content": "5. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.526, + 0.787, + 0.566 + ], + "angle": 0, + "content": "6. Donahue, J., Jia, Y., Vinyals, O., Hoffman, J., Zhang, N., Tzeng, E., Darrell, T.: Decaf: A deep convolutional activation feature for generic visual recognition. In: International conference on machine learning. pp. 647-655. PMLR (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.567, + 0.787, + 0.607 + ], + "angle": 0, + "content": "7. Dong, P., Li, L., Wei, Z.: Diswot: Student architecture search for distillation without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11898-11908 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.608, + 0.787, + 0.636 + ], + "angle": 0, + "content": "8. Guo, J., Chen, M., Zhao, Y., Pan, B., Zhu, C., Hu, Y., Wang, H., He, X., Cai, D.: Reducing the capacity gap via spherical knowledge distillation (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.636, + 0.787, + 0.675 + ], + "angle": 0, + "content": "9. Guo, Z., Yan, H., Li, H., Lin, X.: Class attention transfer based knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11868-11877 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.676, + 0.787, + 0.717 + ], + "angle": 0, + "content": "0. Han, S., Mao, H., Dally, W.J.: Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.718, + 0.787, + 0.758 + ], + "angle": 0, + "content": "1. He, K., Chen, X., Xie, S., Li, Y., Dólar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.787, + 0.799 + ], + "angle": 0, + "content": "2. He, K., Zhang, X., Ren, S., Sun, J.: Delving deep into rectifiers: Surpassing human-level performance on imagenet classification. In: Proceedings of the IEEE international conference on computer vision. pp. 1026-1034 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.8, + 0.787, + 0.84 + ], + "angle": 0, + "content": "3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.318, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "Y. Wang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "14. Heo, B., Kim, J., Yun, S., Park, H., Kwak, N., Choi, J.Y.: A comprehensive overhaul of feature distillation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1921-1930 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.218 + ], + "angle": 0, + "content": "15. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.787, + 0.245 + ], + "angle": 0, + "content": "16. Huang, T., You, S., Wang, F., Qian, C., Xu, C.: Knowledge distillation from a stronger teacher. arXiv preprint arXiv:2205.10536 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "17. Kong, S., Ramanan, D.: Opengan: Open-set recognition via open data generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 813-822 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.314 + ], + "angle": 0, + "content": "18. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.787, + 0.357 + ], + "angle": 0, + "content": "19. Li, L., Dong, P., Li, A., Wei, Z., Ya, Y.: Kd-zero: Evolving knowledge distiller for any teacher-student pairs. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.357, + 0.787, + 0.398 + ], + "angle": 0, + "content": "20. Li, L., Dong, P., Wei, Z., Yang, Y.: Automated knowledge distillation via monte carlo tree search. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 17413-17424 (October 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.787, + 0.439 + ], + "angle": 0, + "content": "21. Lin, T.Y., Dólar, P., Girshick, R., He, K., Hariharan, B., Belongie, S.: Feature pyramid networks for object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2117-2125 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.787, + 0.495 + ], + "angle": 0, + "content": "22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.787, + 0.536 + ], + "angle": 0, + "content": "23. Ma, N., Zhang, X., Zheng, H.T., Sun, J.: Shufflenet v2: Practical guidelines for efficient cnn architecture design. In: Proceedings of the European conference on computer vision (ECCV). pp. 116-131 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.787, + 0.564 + ], + "angle": 0, + "content": "24. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.787, + 0.605 + ], + "angle": 0, + "content": "25. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3967-3976 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.787, + 0.647 + ], + "angle": 0, + "content": "26. Passalis, N., Tefas, A.: Learning deep representations with probabilistic knowledge transfer. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 268-284 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.787, + 0.674 + ], + "angle": 0, + "content": "27. Passalis, N., Tefas, A.: Probabilistic knowledge transfer for deep representation learning. CoRR, abs/1803.10837 1(2), 5 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.787, + 0.73 + ], + "angle": 0, + "content": "28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.787, + 0.771 + ], + "angle": 0, + "content": "29. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. Advances in neural information processing systems 28 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.787, + 0.799 + ], + "angle": 0, + "content": "30. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "31. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115, 211-252 (2015)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.328, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving KD via Regularizing Feature Direction and Norm" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "32. Sandler, M., Howard, A., Zhu, M., Zhmoginov, A., Chen, L.C.: Mobilenetv2: Inverted residuals and linear bottlenecks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4510-4520 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "33. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.232, + 0.788, + 0.259 + ], + "angle": 0, + "content": "34. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.3 + ], + "angle": 0, + "content": "35. Wang, G.H., Ge, Y., Wu, J.: Distilling knowledge by mimicking features. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(11), 8183-8195 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.3, + 0.788, + 0.342 + ], + "angle": 0, + "content": "36. Wang, T., Yuan, L., Zhang, X., Feng, J.: Distilling object detectors with fine-grained feature imitation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4933-4942 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.342, + 0.788, + 0.397 + ], + "angle": 0, + "content": "37. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part VII 14. pp. 499-515. Springer (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.397, + 0.788, + 0.425 + ], + "angle": 0, + "content": "38. Wightman, R.: Pytorch image models. https://github.com/rwrightman/pytorch-image-models (2019). https://doi.org/10.5281/zenodo.4414861" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.425, + 0.788, + 0.467 + ], + "angle": 0, + "content": "39. Xu, K., Rui, L., Li, Y., Gu, L.: Feature normalized knowledge distillation for image classification. In: European conference on computer vision. pp. 664-680. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.467, + 0.788, + 0.508 + ], + "angle": 0, + "content": "40. Xu, R., Li, G., Yang, J., Lin, L.: Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1426-1435 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.55 + ], + "angle": 0, + "content": "41. Yang, C., Zhou, H., An, Z., Jiang, X., Xu, Y., Zhang, Q.: Cross-image relational knowledge distillation for semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12319-12328 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.55, + 0.788, + 0.592 + ], + "angle": 0, + "content": "42. Yang, J., Martinez, B., Bulat, A., Tzimiropoulos, G., et al.: Knowledge distillation via softmax regression representation learning. International Conference on Learning Representations (ICLR) (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.592, + 0.788, + 0.62 + ], + "angle": 0, + "content": "43. Yang, Z., Li, Z., Shao, M., Shi, D., Yuan, Z., Yuan, C.: Masked generative distillation. In: European Conference on Computer Vision. pp. 53-69. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.62, + 0.788, + 0.66 + ], + "angle": 0, + "content": "44. Ye, J., Lu, X., Lin, Z., Wang, J.Z.: Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers. arXiv preprint arXiv:1802.00124 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.702 + ], + "angle": 0, + "content": "45. Yim, J., Joo, D., Bae, J., Kim, J.: A gift from knowledge distillation: Fast optimization, network minimization and transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4133-4141 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.702, + 0.788, + 0.743 + ], + "angle": 0, + "content": "46. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.743, + 0.788, + 0.771 + ], + "angle": 0, + "content": "47. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.771, + 0.788, + 0.813 + ], + "angle": 0, + "content": "48. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11953-11962 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.813 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_origin.pdf b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dd18c9a5345d39099c927fdcf6ccc7d95118365d --- /dev/null +++ b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/2776484f-e96e-4a75-8542-98fc31a4ae56_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f57a02d9153fac33fff1817c505510e37476d8e4434de9042fcad83b72b2a3a3 +size 1175238 diff --git a/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/full.md b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/full.md new file mode 100644 index 0000000000000000000000000000000000000000..b1536f5b93141d51cb1f07b9756117e121b75b15 --- /dev/null +++ b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/full.md @@ -0,0 +1,338 @@ +# Improving Knowledge Distillation via Regularizing Feature Direction and Norm + +Yuzhu Wang $^{1}$ , Lechao Cheng $^{2\boxtimes}$ , Manni Duan $^{1}$ , Yongheng Wang $^{1}$ , Zunlei Feng $^{3}$ , and Shu Kong $^{4,5,6}$ + +$^{1}$ Zhejiang Lab $^{2}$ Hefei University of Technology $^{3}$ Zhejiang University $^{4}$ University of Macau $^{5}$ Institute of Collaborative Innovation $^{6}$ Texas A&M University https://github.com/WangYZ1608/Knowledge-Distillation-via-ND + +Abstract. Knowledge distillation (KD) is a particular technique of model compression that exploits a large well-trained teacher neural network to train a small student network. Treating teacher's feature as knowledge, prevailing methods train student by aligning its features with the teacher's, e.g., by minimizing the KL-divergence or L2-distance between their (logits) features. While it is natural to assume that better feature alignment helps distill teacher's knowledge, simply forcing this alignment does not directly contribute to the student's performance, e.g., classification accuracy. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student classifier. We are motivated to regularize student features at the penultimate layer using teacher towards training a better student classifier. Specifically, we present a rather simple method that uses teacher's class-mean features to align student features w.r.t their direction. Experiments show that this significantly improves KD performance. Moreover, we empirically find that student produces features that have notably smaller norms than teacher's, motivating us to regularize student to produce large-norm features. Experiments show that doing so also yields better performance. Finally, we present a simple loss as our main technical contribution that regularizes student by simultaneously (1) aligning the direction of its features with the teacher class-mean feature, and (2) encouraging it to produce large-norm features. Experiments on standard benchmarks demonstrate that adopting our technique remarkably improves existing KD methods, achieving the state-of-the-art KD performance through the lens of image classification (on ImageNet and CIFAR100 datasets) and object detection (on the COCO dataset). + +Keywords: knowledge distillation $\cdot$ large-norm $\cdot$ feature direction + +# 1 Introduction + +Knowledge distillation (KD) is a specific technique for model compression that aims to train a smaller model (called student) by distilling knowledge learned + +![](images/4e57f54de727772ac07d7878093b79ad057ff021698868cfceabcb8b3f53ea9d.jpg) +student + +![](images/eaca632918e2ee2130018d250228f5acef0eff6563bf0026d8721666c8ba55e4.jpg) +acher + +![](images/fa091acb0b0245ef65d581fc031919b546f6c751274bd6f773b02a08edc7699d.jpg) +existing loss, e.g., $\mathcal{L}_{ce},\mathcal{L}_{kd}$ + +![](images/9b72e3acbfa34bd9cb0478f4ba2320c4667fefb479c3e2ce586dfbb12906af24.jpg) +our proposed loss $\mathcal{L}$ +1 1 + +![](images/6790b80897748213a6a5a85666a9e6546751e62ae28939ec4c795f1ef8a5740c.jpg) +logit distillation + +![](images/24a1e6959aa909f98be6e727f9b6419252eca28a1c29876e2fd786ee6b87b3e9.jpg) +feature distillation +Fig. 1: Our main contribution is a simple loss, termed $\mathcal{L}_{dino}$ , that regularizes the direction and norm of the student features (details in Sec. 3.3). $\mathcal{L}_{dino}$ is applicable to different KD methods which can be categorized into two types in the context of classification: (left) logit distillation that regularizes logits or softmax scores (e.g., KD [15] and DKD [48]), and (right) feature distillation that regularizes features other than logits (e.g., ReviewKD [4]). In this work, we apply $\mathcal{L}_{dino}$ to the embedding feature particularly at the penultimate layer (before logits). Experiments show that learning with $\mathcal{L}_{dino}$ improves existing KD methods, achieving the state-of-the-art benchmarking results for image classification (Tab. 1) and object detection (Tab. 3). + +by a larger teacher model [15]. Deploying the small student model reduces inference computation (e.g., running time and memory use) compared against the original large model. Different from other model compression methods such as pruning [44] and quantization [10], KD has the flexibility of using different architectures of the student, which is preferred by certain real-world applications. + +Status quo. Treating teacher features as knowledge, KD distills such knowledge to train student by encouraging its features to be similar to the teacher's. Through the lens of image classification, prevailing methods can be categorized into two types: logit distillation (Fig. 1-left), and feature distillation (Fig. 1-right). Logit distillation trains the student by minimizing the KL divergence between its logits and the teacher's [15,48]. It assumes that, if student can produce logits more similar to teacher's, it should achieve better performance that approaches teacher's performance. However, logit distillation considers only the logit layer but not other intermediate layers. To exploit such, feature distillation trains student by encouraging its intermediate-layer features to be similar to the teacher's, e.g., by minimizing the L2 distance between their features [4,46]. + +Motivation. Despite the promising results of logit distillation and feature distillation methods, forcing the student to produce similar logits or features to the teacher's does not directly serve the final task, e.g., classification. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student-classifier. Rather, student features are better regularized by the teacher to facilitate learning a better student classifier. Therefore, we are + +motivated to exploit teacher's classifier to train better student towards better performance. Moreover, we empirically find that encouraging the student to produce large-norm features yields better performance (Fig. 2). Other lines of work such as domain adaptation [40] and pruning [44] also find the benefit of learning large-norm features, motivating us to train the student to produce large-norm features. + +Contributions. We make three major contributions. First, we take a novel perspective to improve KD by regularizing student to produce features that (1) are aligned with class-means features computed by the teacher, and (2) have sufficiently large norms. Second, we study multiple baseline methods to achieve such regularizations. We show that when incorporating either or both, existing KD methods yields better performance, e.g., classification accuracy and object detection precision by the student. Third, we propose a novel and simple loss that simultaneously regularizes feature direction and norm, termed dino-loss. Experiments demonstrate that additionally adopting our dino-loss helps existing KD methods achieve better performance. For example, on the standard benchmark ImageNet [5], applying dino-loss to KD [15] achieves $72.49\%$ classification accuracy (Fig. 5), better than the original KD $(71.35\%)$ , with ResNet-18 and ResNet-50 architectures for student and teacher, respectively. This outperforms recent methods ReviewKD [4] $(71.09\%)$ and DKD [48] $(71.85\%)$ . + +# 2 Related Work + +Knowledge distillation. (KD) aims to train a small student model by distilling knowledge of a well-trained large teacher model. The knowledge is delivered by features produced by the teacher for training data. Therefore, the key to KD is to align student features to the teacher's. The seminal KD method [15] propose to train student by aligning its logits with the teacher's, i.e., minimizing the Kullback-Leibler divergence (KL) between logits. Other works improve KD by decoupling the KL loss into multiple terms [48] or consider logits rankings [16]. Distilling logit knowledge alone may not be sufficient as this does not exploit intermediate-layer features. Hence, feature distillation proposes to align more features at other layers [1, 4, 14, 25, 26, 30, 34, 41, 45, 46]. Another line of research adopts network architecture search towards finding small student for KD [7, 19, 20], achieving the state-of-the-art at a cost of extra computation for architecture search. In this work, we take a different and orthogonal perspective to improve KD with simple methods, by encouraging the student to produce features to be aligned with the direction of teacher classifier and of large norms. + +Constructing classifiers using off-the-shelf features. Off-the-shelf features extracted from a well-trained model can be used to construct strong classifiers. One simple classifier is to compute class-mean of training examples in the feature space, and uses such as the classifier [6,17,33]. On the other hand, recent literature of pretrained large models [28] shows that using off-the-shelf features and cosine similarity is a powerful classifier for zero-shot recognition. In this work, we propose to regularize student features using class-mean of teacher + +![](images/ac9c9e9e19c23ae2e0b4645b4b4f8f358e64e8b5ee5ddb1ecaeb00d2c6dc6491.jpg) +(a) regularize feature direction + +![](images/c67dadee9ddfcb682cf7694f9223a4fe5e8c9a9e91b52dfda9b9193c9b4e734d.jpg) +(b) teacher feature + +![](images/38652112356f14203b112569763a680ba23707943cee52b2a04ff00f5c439c52.jpg) +(c) student feature + +![](images/f55a1f6bcad131cc9b2958564ccdc475b13364ea315604d7277e0a41e0e9eeb6.jpg) +(d) regularize feature norm +Fig. 2: Regularizing feature direction and norm helps knowledge distillation and improves student's performance. We train a ResNet-56 teacher and use the classic KD method [15] to train a ResNet-8 student on the CIFAR10 dataset. (a) We propose to regularize student by aligning its feature direction with the class-mean features computed by teacher. To do so, we adopt a simple cosine loss term on the penultimate-layer features (Sec. 3.2). Results show that regularizing feature direction improves student's performance. (b-c) We train teacher and student to produce 2D features at the penultimate layer from scratch (without using method KD [15]). We visualize them as 2D points, colored by class labels, and mark the class center by $\star$ . Notably, the large teacher model produces large-norm features (b), while the small student model produces small-norm features (c). (d) This motivates us to regularize student by encouraging it to produce large-norm features (Sec. 3.2). To do so, we use the method SIFN [40]. Results show that properly regularizing feature norms improves student's performance. Our technical contribution is a simple loss that simultaneously regularizes student feature direction and norm, so we call it dino-loss. + +features, as well as other different methods for feature alignment. We hypothesize that doing so helps learn better student classifiers. Indeed, our experiments justify this hypothesis (Tab. 4). + +Learning large-norm features. Multiple lines of work find it important to learn large-norm features or weight parameters. For example, domain adaptation [40] reveals that the erratic discrimination of the target domain mainly stems from its much smaller feature norms w.r.t that of the source domain, and adopting a larger-norm constraint helps adapt a pretrained model (in the source domain) to a new target domain. Moreover, model pruning finds that features with smaller norms play a less informative role during the inference [44], so it is safe to remove weight parameters that produce small-norm features without causing notable performance drop. In our work, we also empirically find that a small-capacity model produces features that tend to collide in the small-norm region (Fig. 2c). Therefore, we are motivated to train student to produce large-norm features, hypothesizing that doing so improves student performance. Our experiments justify this hypothesis (Fig. 2d, Tab. 4). + +Feature regularization w.r.t norm and direction. The literature has multiple works studying feature regularization w.r.t its norm and direction in KD. We present them and explain how our method stands out. PKD [2] normalizes student and teacher features to have zero mean and unit variances to eliminate the gap in feature norms between them, and applies MSE loss between the normalized features. Our method encourages learning large-norm features of the + +student and additionally regularizes features using teacher classifier for better classification. Guo [8] transforms student logits to have the same norm of the teacher logits and performs KL-divergence on the transformed logits, whereas we encourage learning large-norm student features which can have feature norm larger than the teacher's (Fig. 4). FNKD [39] also advocates learning large-norm features but chooses to tune a temperature (shared by all classes) to enlarge logit values before softmax; differently, our method unifies norm regularization and feature direction regularization into a simple loss. Both SimKD [3] and SRRL [42] use MSE loss to align the student features with the teacher's without enlarging feature norms; Wang [35] uses an L2 loss to align features of teacher and student models and further adopts a loss based on locality-sensitive hashing to encourage the direction of student features to be aligned with teacher's. These methods do not necessarily learn a student to have feature norms that can be larger than the teacher's. In sum, our simple dino-loss not only aligns directions of student and teacher features but also explicitly encourages learning student to produce large-norm features. + +# 3 Improving Knowledge Distillation by Regularizing Feature Direction & Norm + +We first describe notations and motivate our study of regularizing feature direction and norm to improve KD. Then, we introduce baselines, followed by our proposed dino-loss. + +# 3.1 Notations and Background + +Notations. Without losing generality, we think of a classification neural network as two modules: a feature extractor $f(\cdot; \Theta)$ , and a classifier $g(\cdot; \mathbf{w})$ , which are parameterized by $\Theta$ and $\mathbf{w}$ , respectively. For the teacher, given input data $\mathbf{x}$ , we denote its embedding feature as $\mathbf{f}^t = f^t(\mathbf{x}; \Theta^t)$ , and the logits as $\mathbf{z}^t = g^t(\mathbf{f}^t; \mathbf{w}^t)$ . Similarly, the student outputs the embedding features for $\mathbf{x}$ as $\mathbf{f}^s = f^s(\mathbf{x}; \Theta^s)$ and logits as $\mathbf{z}^s = g^s(\mathbf{f}^s; \mathbf{w}^s)$ . We compute softmax scores in a vector $\mathbf{q}^t = \mathrm{softmax}(\mathbf{z}^t; \tau)$ , where $\tau$ is a temperature (default value as 1). Given $N$ training examples from $C$ classes, $\mathbf{x}_i$ and its label $y_i$ (where $i = 1, \dots, N$ ), one can train a classification model (e.g., the teacher) by minimizing the cross-entropy (CE) loss $\mathcal{L}_{ce}$ on all the training data. + +Logit distillation trains the student by transferring the teacher knowledge using both the CE loss $\mathcal{L}_{ce}$ and a KD loss $\mathcal{L}_{kd}$ . The seminal work of KD [15] uses KL divergence as the KD loss $\mathcal{L}_{kd}$ , i.e., $\mathcal{L}_{kd} = \frac{1}{N}\sum_{i=1}^{N}\mathbf{KL}(\mathbf{q}_i^t,\mathbf{q}_i^s)$ . + +Feature distillation distills teacher knowledge by minimizing the difference of intermediate features at more layers other than the logits [4, 45, 46]. A typical loss term is the L2 distance $\mathcal{L}_2$ between student and teacher features. For + +example, over the embedding features at the penultimate layer (before logits), it applies the L2 loss $\mathcal{L}_{kd} = \frac{1}{N}\sum_{i=1}^{N}\mathcal{L}_2(\mathbf{f}_i^s,\mathbf{f}_i^t)$ in addition to the CE loss $\mathcal{L}_{ce}$ . + +The final loss is $\mathcal{L} = \mathcal{L}_{ce} + \alpha \mathcal{L}_{kd}$ , where $\alpha$ controls the significance of the KD loss $\mathcal{L}_{kd}$ depending on distillation choice: logit distillation or feature distillation. + +# 3.2 Baseline Methods + +Recall that we are motivated to regularize student features during training: aligning their direction with teacher class-mean features, and encouraging them to be large in norm. In the main paper, we focus on the embedding features $\mathbf{f}^s$ at the penultimate layer, which are the direct input to a classifier; we also validate its effectiveness at other layers (Tab. 5). We compute the class-mean of the $k^{th}$ class as $\mathbf{c}_k = \frac{1}{|\mathcal{I}_k|}\sum_{j\in \mathcal{I}_k}\mathbf{f}_j^t$ , where $\mathcal{I}_k$ is the set of indices of training examples belonging to class- $k$ . We now introduce simple techniques to regularize student features using $\mathbf{c}_k$ w.r.t feature direction and norm. + +Feature Direction Regularization. We present two simple baseline methods below to regularize student w.r.t feature direction. + +Baseline-1: cosine similarity. We use a simple cosine similarity based loss term to regularize the feature direction of $\mathbf{f}_i^s$ according to the mean feature $\mathbf{c}_k$ of the corresponding class- $k$ : + +$$ +\mathcal {L} _ {d} = \frac {1}{C} \sum_ {k = 1} ^ {C} \frac {1}{| \mathcal {I} _ {k} |} \sum_ {i \in \mathcal {I} _ {k}} \left(1 - \cos \left(\mathbf {f} _ {i} ^ {s}, \mathbf {c} _ {k}\right)\right) \tag {1} +$$ + +Baseline-2: InfoNCE. Using the cosine similarity loss Eq. 1 considers only paired examples and their corresponding class-mean. Inspired by InfoNCE [24], we also consider inter-class examples and class-means. Therefore, we train student by minimizing: + +$$ +\mathcal {L} _ {d} = \frac {1}{C} \sum_ {k = 1} ^ {C} \frac {1}{| \mathcal {I} _ {k} |} \sum_ {i \in \mathcal {I} _ {k}} - \log \frac {\exp \left(\cos \left(\mathbf {f} _ {i} ^ {s} , \mathbf {c} _ {k}\right)\right)}{\sum_ {j = 1} ^ {C} \exp \left(\cos \left(\mathbf {f} _ {i} ^ {s} , \mathbf {c} _ {j}\right)\right)} \tag {2} +$$ + +Feature Norm Regularization. We present two baseline methods below to regularize student towards producing large-norm features. + +Baseline-1: $\mathcal{L}_2$ distance. As shown by Fig. 2c, the small-capacity student model produces features that have notably smaller norm than the teacher's. To train the student to produce larger-norm features, perhaps a naive method is to increase student feature norm towards teacher's. To this end, we minimize the L2 distance between features of student and teacher: + +$$ +\mathcal {L} _ {n} = \frac {1}{C} \sum_ {k = 1} ^ {C} \frac {1}{| \mathcal {I} _ {k} |} \sum_ {i \in \mathcal {I} _ {k}} \| \mathbf {f} _ {i} ^ {s} - \mathbf {f} _ {i} ^ {t} \| _ {2} ^ {2} \tag {3} +$$ + +Minimizing Eq. 3 is a common practice in feature distillation [1,4,14]. It implicitly trains student to produce features with norms approaching the corresponding larger-norm teacher features. + +Baseline-2: Stepwise increasing feature norms (SIFN). We now describe a loss to explicitly increase the norm of the student features. Inspired by [40], we gradually increase the feature norm by minimizing: + +$$ +\mathcal {L} _ {n} = \frac {1}{N} \sum_ {i = 1} ^ {N} \mathcal {L} _ {2} \left(f ^ {s} \left(\mathbf {x} _ {i}; \Theta_ {\text {p r e v i o u s}} ^ {s}\right) + r, f ^ {s} \left(\mathbf {x} _ {i}; \Theta_ {\text {c u r r e n t}} ^ {s}\right)\right), \tag {4} +$$ + +where $\Theta_{previous}^{s}$ and $\Theta_{current}^{s}$ are parameters of an early checkpoint and the current model being optimized, respectively; $r$ is a step size to increase the norm of student features during training. + +# 3.3 The Proposed dino Loss + +We now present the proposed dino-loss that simultaneously achieves the above two goals: (1) aligning student features to teacher's w.r.t direction, and (2) learning large-norm student features. For simplicity, we drop the subscript (i.e., the index of a training example or class ID). Let $\mathbf{f}^s$ and $\mathbf{f}^t$ be the embedding features of an input $\mathbf{x}$ computed by student and teacher, respectively. Based on $\mathbf{x}$ 's ground-truth label $y$ , we have its corresponding class-mean $\mathbf{c}$ . We denote the unit vector $\mathbf{e} = \mathbf{c} / \| \mathbf{c}\|_2$ , and $\mathbf{p}^t = \mathbf{e}\| \mathbf{f}^t\|_2$ . We compute the projection of $\mathbf{f}^s$ along $\mathbf{c}$ 's direction: $\mathbf{p}^s = \mathbf{e}\| \mathbf{f}^s\|_2\cos (\mathbf{f}^s,\mathbf{c})$ . Fig. 3 shows the geometric meaning. + +When the norm of $\mathbf{f}^s$ is small, or its projection $\mathbf{p}^s$ has small norm, i.e., $\| \mathbf{p}^s\| _2 < \| \mathbf{f}^t\| _2$ , we encourage the student to output larger-norm features and align them with the teacher class-mean by minimizing $\| \mathbf{p}^t -\mathbf{p}^s\| _2$ . + +Because the feature norms of different examples can vary by an order of magnitude (see Fig. 2c), naively learning with the above can produce artificially large gradients from specific training data and negatively affect training. Thus, we divide the above by $\| \mathbf{f}^t\| _2$ , which is equivalent to $\| \mathbf{p}^t\| _2$ .. + +$$ +\mathcal {L} _ {\text {d i n o}} = \frac {\| \mathbf {p} ^ {t} - \mathbf {p} ^ {s} \| _ {2}}{\| \mathbf {f} ^ {t} \| _ {2}} = \frac {\| \mathbf {p} ^ {t} \| _ {2} - \| \mathbf {p} ^ {s} \| _ {2}}{\| \mathbf {f} ^ {t} \| _ {2}} = 1 - \frac {\mathbf {f} ^ {s} \cdot \mathbf {e}}{\| \mathbf {f} ^ {t} \| _ {2}} \tag {5} +$$ + +![](images/20d7293459eaa1334e3b2609e7171cf229eaab2a7a32085318e17c11a1a915ea.jpg) +Fig. 3: Illustration of notations used in our dino-loss loss and its geometric meaning. + +Minimizing Eq. 5 amounts to simultaneously + +(1) increasing the norm of $\mathbf{f}^s$ and (2) reducing the angular distance between $\mathbf{f}^s$ and the class-mean $\mathbf{c}$ . + +When $\mathbf{f}^s$ has large norm, i.e., $\| \mathbf{f}^s\| _2\geq \| \mathbf{f}^t\| _2$ , we only minimize the angular distance between student feature and the class-mean defined by the teacher: + +$$ +\mathcal {L} _ {\text {d i n o}} = 1 - \frac {\mathbf {f} ^ {s} \cdot \mathbf {e}}{\| \mathbf {f} ^ {s} \| _ {2}} \tag {6} +$$ + +The above loss means that the feature norm of student is no longer explicitly required to reach a larger value if it is already large enough; yet it is still allowed + +to increase freely during training. We merge Eq. 5 and 6 and average over all training examples as our dino-loss (dropping the constant 1): + +$$ +\mathcal {L} _ {d i n o} = - \frac {1}{C} \sum_ {k = 1} ^ {C} \frac {1}{| \mathcal {I} _ {k} |} \sum_ {i \in \mathcal {I} _ {k}} \frac {\mathbf {f} _ {i} ^ {s} \cdot \mathbf {e} _ {k}}{\max \left\{\| \mathbf {f} _ {i} ^ {s} \| _ {2} , \| \mathbf {f} _ {i} ^ {t} \| _ {2} \right\}} \tag {7} +$$ + +Compatible with existing KD methods, our dino-loss $\mathcal{L}_{dino}$ can be used altogether with CE loss $\mathcal{L}_{ce}$ and KD loss $\mathcal{L}_{kd}$ to train student: + +$$ +\mathcal {L} = \mathcal {L} _ {c e} + \alpha \mathcal {L} _ {k d} + \beta \mathcal {L} _ {d i n o} \tag {8} +$$ + +$\alpha$ and $\beta$ are the weights for $\mathcal{L}_{kd}$ and $\mathcal{L}_{dino}$ , respectively. The definition of $\mathcal{L}_{kd}$ depends on the distillation method. Otherwise stated, we study $\mathcal{L}_{dino}$ with the seminal logit distillation method KD [15], so $\mathcal{L}_{kd} = \mathbf{KL}$ . + +Remark. The dino-loss simultaneously encourages student to output large-norm features (possibly larger than teacher's, as shown in Fig. 4), and minimizes the angular distance between student features and the class-mean defined by the teacher during training. This is a desired property in terms of training the student to achieve better classification accuracy. + +# 4 Experiments + +# 4.1 Datasets and Settings + +For fair comparisons, our implementation adheres to the previous methodologies outlined in [4, 16, 34, 48]. + +CIFAR-100 [18] contains 50k training images and 10k testing images. During training, we adopt random cropping and random left-right flipping augmentations. We randomly initialize weight parameters following [12] and train all student networks from scratch. The teacher models are publicly available that are adopted in prior art [34]. The student networks are trained using a batch size of 128 for 240 epochs (with a linear warm-up for the first 20 epochs), employing SGD with a weight decay of 5e-4 and momentum of 0.9. We set the initial learning rate of 0.1 for ResNet [13] and WRN [47] backbones, and 0.02 for MobileNet [32] and ShuffleNet [23] backbones, decaying it with a factor of 10 at 150th, 180th, and 210th epochs. The temperature is empirically set to 4. + +ImageNet [31] has 1.28 million training images and 50,000 validation images spanning by 1,000 categories. We employ SGD with a batch size of 512 for a total of 100 epochs (with a linear warm-up for the first 5 epochs). The initial learning rate is set to 0.2 and is reduced by a factor of 10 every 30 epochs. Besides, the weight decay and momentum are set to 1e-4 and 0.9, respectively. The pre-trained weights for teacher come from PyTorch² and TIMM [38] for fair comparisons. The temperature for knowledge distillation is set to 1. + +COCO 2017 [22] consists of 80 object categories with 118k training images and 5k validation images. We utilize Faster R-CNN [29] with FPN [21] as the + +Table 1: Benchmarking results on CIFAR100. Methods are reported w.r.t top-1 accuracy (\%) on the test set. ++ means that we apply the proposed dino-loss to existing methods. Clearly, doing so improves performance over the original KD methods and outperforms prior KD methods. We mark performance gains over corresponding methods using green superscripts. + +
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher (T)72.3475.6179.4279.3479.4279.42
student (S)69.0671.9872.5064.6070.5071.82
Feature distillation methods
FitNet [30]69.2172.2473.5063.1673.5973.54
RKD [25]69.6172.2271.9064.4372.2873.21
PKT [27]70.3473.4573.6466.5274.1074.69
OFD [14]70.9874.3374.9569.0475.9876.82
CRD [34]71.1674.1475.5169.1175.1175.65
ReviewKD [4]71.8975.0975.6369.8977.4577.78
ReviewKD++72.05+0.1675.66+0.5776.07+0.4470.45+0.5677.68+0.2377.93+0.15
Logit distillation methods
KD [15]70.6673.5473.3367.6574.0774.45
KD++72.53+1.8774.59+1.0575.54+2.2170.10+2.3575.45+1.3876.42+1.97
DIST [16]71.7874.4275.7969.1775.2376.08
DIST++72.52+0.7475.00+0.5876.13+0.3469.80+0.6375.60+0.3776.64+0.56
DKD [48]71.9774.8175.4470.3576.4577.07
DKD++72.16+0.1975.02+0.2176.28+0.8470.82+0.4777.11+0.6677.49+0.42
+ +feature extractor, and employ the dino-loss on the R-CNN head, wherein both teacher and student models adopt ResNet [13] as the backbone. In addition, MobileNet-V2 [32] is used as a heterogeneous student model. All student models are trained with 1x scheduler, following the public toolbox Detectron2.3 + +# 4.2 Comparisons with State-of-the-art Results + +CIFAR-100 classification. Tab. 1 shows the KD performances on the CIFAR-100 dataset. In this context, spanning homogeneous and heterogeneous architectures, we undertake an extensive assessment over prominent feature distillation methods and logits distillation methods. The ++ signifies the integration of our novel dino-loss into the existing methods. A salient conclusion from Tab. 1 is that our proposed dino-loss empowers existing KD methods to achieve better classification accuracy. This suggests the effectiveness and compatibility of the dino-loss, which can serve as a plugin for existing KD methods, irrespective of the homogeneity or heterogeneity for network architectures. + +ImageNet classification. We demonstrate the effectiveness of the proposed dino-loss on the well-established benchmark ImageNet. Tab. 2 lists detailed results. It is worth noting that with our simple dino-loss, the method $\mathbf{KD}++$ already outperforms most of previous methods (e.g., ReviewKD [4], DKD [48], and SRRL [43]). Moreover, incorporating our dino-loss, other methods such as ReviewKD++ and DKD++ also achieve notable improvements. + +Table 2: Comparisons with state-of-the-art methods on the ImageNet validation set. $\mathrm{KD}++$ serves as a stronger baseline that introduces no more parameters and negligible training time over the vanilla KD [15] and outperforms most of previous methods (e.g., ReviewKD [4], SRRL [42], and MGD [43]). Methods marked by $\dagger$ adopts a searching strategy, demanding significant more computation cost to achieve the state-of-the-art performance. In contrast, our dino-loss is rather simple that helps existing KD methods to rival search-based methods. + +
MethodsResNet-34 → Top-1ResNet-18 Top-5ResNet-50 → Top-1MobileNet-V1 Top-5
student69.7689.4368.8788.76
teacher73.3191.5976.1692.86
CRD ICLR2020 [34]71.1790.1371.3790.42
SRRL ICLR2021 [42]71.7390.6072.4990.92
MGD ECCV2022 [43]71.5890.3572.3591.00
CAT-KD CVPR2023 [9]71.2690.4572.2491.13
KD NeurIPS2015 [15]70.6689.8870.5089.80
KD++71.98 (+1.32)90.53 (+0.65)72.77 (+2.27)91.14 (+1.34)
ReviewKD CVPR2021 [4]71.6290.5172.5691.00
ReviewKD++71.64 (-0.02)90.61 (+0.10)72.96 (+0.40)91.16 (+0.16)
DKD CVPR2022 [48]71.7090.4172.0591.05
DKD++72.07 (+0.37)90.59 (+0.18)72.63 (+0.58)91.07 (+0.02)
KD-Zero NeurIPS2023 [19]†72.1790.4673.0291.05
Auto-KD ICCV2023 [20]†72.4590.6973.2691.17
+ +Table 3: Benchmarking KD methods for object detection on the COCO val2017 dataset (mAP in %). All methods use the Faster R-CNN detector with various teacher and student architectures, including RestNet {18,50,101} and MobileNet-V2 (MV2). Incorporating our dino-loss, simple methods $\mathrm{KD + + }$ and ReviewKD++ obtain notable performance gains (marks in green) over their original counterparts, achieving the state-of-the-art performance. + +
MethodsR101→R18R101→R50R50→MV2
mAP\( AP^{50} \)\( AP^{75} \)mAP\( AP^{50} \)\( AP^{75} \)mAP\( AP^{50} \)\( AP^{75} \)
teacher42.0462.4845.8842.0462.4845.8840.2261.0243.81
student33.2653.6135.2637.9358.8441.0529.4748.8730.90
KD [15]33.9754.6636.6238.3559.4141.7130.1350.2831.35
FitNet [30]34.1354.1636.7138.7659.6241.8030.2049.8031.69
FGFI [36]35.4455.5138.1739.4460.2743.0431.1650.6832.92
DKD [48]35.0556.6037.5439.2560.9042.7332.3453.7734.01
ReviewKD [4]36.7556.7234.0040.3660.9744.0833.7153.1536.13
KD++36.12 (+2.15)56.81 (+2.15)37.64 (+1.02)39.86 (+1.51)61.07 (+1.66)43.57 (+1.86)33.26 (+3.13)53.71 (+3.43)34.85 (+3.50)
ReviewKD++37.43 (+0.68)57.96 (+1.24)40.15 (+6.15)41.03 (+0.67)61.80 (+0.83)44.94 (+0.86)34.51 (+0.80)55.18 (+2.03)37.21 (+1.08)
+ +We note that recent KD methods adopt a searching strategy for better results, e.g., KD-Zero [19] and Auto-KD [20]. These methods search for a distiller in a space of predefined modules, e.g., normalization methods, losses, transform operations, activation functions, etc. At the cost of significantly more computation time for searching, they achieve the best performance on the benchmark, slightly better than ours. Nevertheless, our dino-loss helps existing much simpler methods rival search-based approaches! Compared against search-based methods, applying our dino-loss, methods such as $\mathrm{KD}++$ introduce no more parameters and negligible training time over the counterparts (e.g., vanilla KD [15]). This makes the use of our dino-loss a stronger baseline for knowledge distillation. Interestingly, current search-based methods do not consider our proposed regularization methods, i.e., feature norm regularizer and feature direction regularizer. That said, our method + +Table 4: Analysis of feature direction and norm regularization. We train teacher (ResNet-50, ResNet-56) and student (MobileNet-V2, ResNet-20) models on the CIFAR100 dataset and report accuracy $(\%)$ on its test-set. We use KD [15] as the baseline, which is a logit distillation method. From (a-b), we see that applying either direction or norm regularization on student features improves KD as shown by the increased student accuracy. While combining both outperforms baseline (c), using dino-loss achieves the best (d). + +(a) Regularizing feature direction only. Cosine is more robust than InfoNCE. + +
caseR50→MV2R56→R20
baseline67.6570.66
cosine69.18 (+1.53)71.75 (+1.09)
InfoNCE69.06 (+1.41)70.73 (+0.07)
+ +(c) Regularizing both feature norm and direction. Simple addition does not yield better results (e.g., cosine + $\mathcal{L}_2$ vs. cosine vs. $\mathcal{L}_2$ ). + +
caseR50→MV2R56→R20
cosine + L268.62 (+0.97)71.58 (+0.92)
cosine + SIFN69.07 (+1.42)71.72 (+1.06)
InfoNCE + L268.47 (+0.82)70.81 (+0.15)
InfoNCE + SIFN68.71 (+1.06)71.04 (+0.38)
+ +(b) Regularizing feature norm only. $SIFN$ is more robust than $\mathcal{L}_2$ + +
caseR50→MV2R56→R20
baseline67.6570.66
L269.05 (+1.40)71.85 (+1.19)
SIFN69.32 (+1.67)72.13 (+1.47)
+ +(d) The proposed dino-loss can perfectly integrate the advantages of regularization feature norm and direction, and perform best. + +
caseR50→MV2R56→R20
CE + KL (baseline)67.6570.66
CE + dino68.78 (+1.13)71.96 (+1.30)
KL + dino68.68 (+1.03)72.04 (+1.38)
CE + KL + dino70.10 (+2.45)72.53 (+1.87)
+ +is orthogonal to existing KD methods and can potentially serve as modules for searching, suggesting the novelty of our work. + +COCO Object Detection. We verify the efficacy of the proposed dino-loss for knowledge distillation through the lens of object detection on the COCO dataset. Tab. 3 lists detailed results compared to prior works. Specifically, the ReviewKD++ yields a significant improvement in performance, outperforming state-of-the-art results with a remarkable margin. Moreover, this experiment and the above demonstrate the applicability of our dino-loss across tasks (i.e., image classification and object detection). + +# 4.3 Ablation Study + +In this subsection, we first conduct an ablation study on feature norm and direction regularization with the CIFAR-100 dataset. Subsequently, we perform a visual analysis of the impact before and after applying dino-loss. Finally, we conduct intriguing experiments on ImageNet to validate the benefits of using our approach that encourages learning large-norm features of the student model. + +The effectiveness feature direction and norm regularization. Recall the baseline methods in Sec. 3.2 and 3.2 for feature direction and norm regularization. We present results for $\mathcal{L}_2$ (Eq. 3) and SIFN (Eq. 4) on CIFAR-100 in Tab. 4b. Yet additional offline experiments substantiate that SIFN outperforms + +Table 5: Comparison of using teacher's classifier weights (dubbed "w/ weights") versus per-class mean features (dubbed "w/ class-mean") in our dino-loss. We study them with the KD method [15] on CIFAR-100. Results show that using per-class mean features outperforms classifier weights. Moreover, we apply our dino-loss at more layers other than the penultimate layer (cf. the bottom row block). Here, layer-x means that the dino-loss is applied to all the x layers right before the penultimate layer. In particular, layer-0 means that the dino-loss is applied only at the penultimate layer (i.e., "w/ class-mean" in this table). Results show that applying dino-loss at other layers also leads to improvements but doing so at the penultimate layer achieves the best performance. + +
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher72.3475.6179.4279.3479.4279.42
student69.0671.9872.5064.6070.5071.82
KD [15]70.6673.5473.3367.6574.0774.45
L2 ofcls weights70.5473.6173.7666.8173.6274.13
w/ weights71.7373.9775.0669.7675.2475.61
w/ class-mean72.5374.5975.5470.1075.4576.42
apply dino-loss to other layers
layer-171.3073.7474.2369.4475.0176.26
layer-271.9673.8174.1269.1075.7276.53
layer-371.1973.6173.9268.8774.9376.10
+ +$\mathcal{L}_2$ regularization in terms of performance and consistently affirm that large student feature norms encapsulate more teacher knowledge. Similarly, Tab. 4a shows superior gains of cosine similarity-based regularizer (Eq. 1) over InfoNCE (Eq. 2); both underscore the significance of feature direction regularization. + +Our dino-loss yields better results. Tab. 4c shows that feature direction regularization (cosine, InfoNCE) and feature norm regularization $(\mathcal{L}_2$ , SIFN) improve KD. While combining them helps KD (e.g., cosine + $\mathcal{L}_2$ , cosine + SIFN), our dino-loss performs the best at $70.10\%$ accuracy (Tab. 4d). This convincingly shows the superiority of our dino-loss over others. + +Class-mean vs. classifier weights in regularizing student feature direction. We perform a quantitative analysis of using the teacher's classifier weights and per-class feature mean to regularize student's features. We adopt the classifier weights that are derived from teacher as centers in our dino-loss to train student models (dubbed "w/ weights"). In comparison, we utilize per-class feature means, denoted as "w/ class-mean" (which is our proposed method). The results in Tab. 5 clearly demonstrate that the utilization of per-class feature mean performs better than the method of using teacher's classifier weights for feature direction regularization. Additionally, we have implemented an alternative approach that employs an L2 loss to guide the student to output classifier weights similar to those of the teacher (referred to as "L2 of cls weight"). However, this approach consistently underperforms our "w/ class-mean" method and even lags behind the baseline KD method [15] in most experimental settings. These findings provide strong evidence for the superiority of employing class-mean features over the teacher's classifier weights. + +![](images/14c4506ec9823b1b3a6b6387342c6763f68c5d2ab1e12efefd22130c976e5e95.jpg) +(a) teacher + +![](images/556ddce9117ef3695e31dd7644d08198cb8dd87924059aca1dc7074a635879ee.jpg) +(b) naive small model + +![](images/e6b8213c397e71e940ddb344b8f912534dc964a3852049e4d4a735be37b3d700.jpg) +(c) student by KD +Fig. 4: Visualization of 2D embedding features. (a) Features computed by teacher (ResNet-50) are well separated at class label; note the purple class pointed by red arrow. (b) A small-capacity model (ResNet-18) fails to separate this purple class, which is occluded by others. (c) Even using KD [15] to train ResNet-18 student cannot reveal this purple class. (d) Using our dino-loss along with KD, i.e., $\mathrm{KD}++$ , achieves better separation of the points and reveals purple class. This attributes to the feature direction regularization using teacher class-means. Moreover, student features in (d) have larger-norms than the teacher in (a) because our dino-loss explicitly encourages learning large-norm features of the student. + +![](images/acdd697d656102cb01277422379fc0e1d9365fc2061e9aceb74e305b64732d32.jpg) +(d) student by $\mathrm{KD} + +$ + +Applying the dino-loss to other layers. In the above experiment, we apply the dino-loss to the penultimate layer only. Here, we study applying it to other layers and evaluate on CIFAR-100 in bottom of Tab. 5. Results show that our dino-loss applied at other layers also improves over the baseline KD but performs the best when applied at the penultimate layer. + +$\mathrm{KD}++$ is a strong baseline. Tab. 4d illustrates the impacts of different losses in KD. By incorporating dino-loss into conventional KD framework [15], $\mathrm{KD}++$ (i.e., $\mathrm{CE} + \mathrm{KL} + \mathrm{dino}$ ) achieves a significant improvement: KD $(67.65\%) \rightarrow \mathrm{KD}++$ $(70.10\%)$ . Further, combining dino-loss with CE or KL can also boost the accuracy by $\sim 1\%$ compared to the original KD method. It is worth noting that $\mathrm{KD}++$ introduces no additional parameters and negligible computation overhead, making it a strong baseline for KD (cf. more results in Tab. 1, 2, & 3). + +In addition, following [37], we visually examine the student feature in Fig. 4. First, as indicated in Fig. 4d, $\mathrm{KD}++$ demonstrates notably amplified feature norms, surpassing even those of the teacher depicted in Fig. 4a. Furthermore, the direction in $\mathrm{KD}++$ align well with the teacher (Fig. 4a vs. Fig. 4d, thereby maintaining consistent relative margins among categories. Another observation is that both the naive student (Fig. 4b) and the conventional KD (Fig. 4c) exhibit direct failures in classifying the purple category, whereas our approach, $\mathrm{KD}++$ (Fig. 4d), effectively learns student features that can discriminate all classes. + +The benefit from larger teacher models. Now we investigate whether our approach exhibits monotonically incremental performance gains when exploiting a larger teacher. We first examine the classic KD [15] framework, and two other recently proposed methods, namely ReviewKD [4] and DKD [48]. + +As shown in Fig. 5, it is clear that for KD [15], DKD [48] and ReviewKD [4] show a degradation or fluctuation when scaling up the teacher from ResNet-34 to ResNet-152, with ResNet-18 as student. The main obstacle is the huge capacity + +![](images/b3369adbd20a647a6fd1ee5e8b1f6307b697a6a36aeabe6f0d904ebef93c39b0.jpg) +Fig. 5: Using our dino-loss can benefit from larger teacher models. The student is ResNet-18, with scaling up the teacher from ResNet-34 to ResNet-152 (denoted in the $x$ -axis). We report the top-1 accuracy (\%) on the ImageNet validation set. All results are the average accuracy over five runs. With the teacher capacity increasing, our methods, $\mathrm{KD}++$ , $\mathrm{DKD}++$ and $\mathrm{ReviewKD}++$ (red) achieve better knowledge distillation results, even though the original distillation methods (blue) suffer from performance degradation with large teacher models (e.g., ResNet-152). + +![](images/1e1d6fa1f4a687f270ed3d9c153330126c508371470a3e8b5aa9c15c1d32450b.jpg) + +![](images/d6ea9f25c56200a33d20072bf6356b0d1c3e5f495ba481242a670ba8cd421845.jpg) + +Table 6: A larger student gets better knowledge distillation performance. The teacher is ResNet-152 (top-1 acc, $78.31\%$ ). We report the top-1 accuracy (\%) on the ImageNet validation set. Model marked with $\dagger$ adopts a stronger recipe [11]. Results show that our dino-loss achieves consistent improvement, outperforming the model trained from scratch (cf. the first row). + +
studentResNet-18ResNet-34ResNet-50ResNet-101ViT-SViT-BViT-B†
trained from scratch69.7673.3176.1677.3774.6478.0081.80
KD [15]70.6674.8476.9378.0475.7778.5182.39
KD++71.98 (+1.32)75.53 (+0.69)77.48 (+0.55)79.15 (+1.11)76.53 (+0.76)79.85 (+1.34)82.92 (+0.53)
+ +gap between student and teacher [1,16,34]. Surprisingly, upon incorporating our dino-loss, distillation methods yield significant improvements compared to the original methods (e.g., $\mathrm{KD}++$ vs. KD, ReviewKD++ vs. ReviewKD). More importantly, they show a consistent improvement with scaling up the teacher size (e.g., $\mathrm{KD}++: 71.99\% \rightarrow 72.49\% \rightarrow 72.54\% \rightarrow 72.59\%$ ). + +The benefit from larger student models. We use $\mathrm{KD}++$ to study the effect of increasing the size of the student for knowledge distillation, and set the teacher as ResNet-152. The results in Tab. 6 demonstrate that increasing the capacity of the student significantly improves distillation results. + +# 5 Discussion and Conclusion + +Broader Impacts As our work falls in the area of knowledge distillation, we do not see any new potential societal impacts other than those already known, e.g., student models might learn bias and unfairness delivered by the teacher. + +Conclusion. We study feature regularization w.r.t norm and direction when training student models for better knowledge distillation (KD). Indeed, sufficient experiments and ablation studies demonstrate that doing so with our proposed dino-loss helps existing KD methods to achieve better performance. + +# Acknowledgements + +The authors would like to thank the anonymous reviewers for their valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China (U22A2032), by the Zhejiang Provincial Science and Technology Plan Project (2024SSYS0013), and in part by the National Natural Science Foundation of China under Grant No. (62106235). Shu Kong acknowledges the support by the University of Macau (SRG2023-00044-FST). + +# References + +1. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10925-10934 (2022) +2. Cao, W., Zhang, Y., Gao, J., Cheng, A., Cheng, K., Cheng, J.: Pkd: General distillation framework for object detectors via pearson correlation coefficient. Advances in Neural Information Processing Systems 35, 15394-15406 (2022) +3. Chen, D., Mei, J.P., Zhang, H., Wang, C., Feng, Y., Chen, C.: Knowledge distillation with the reused teacher classifier. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11933-11942 (2022) +4. Chen, P., Liu, S., Zhao, H., Jia, J.: Distilling knowledge via knowledge review. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5008-5017 (2021) +5. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009) +6. Donahue, J., Jia, Y., Vinyals, O., Hoffman, J., Zhang, N., Tzeng, E., Darrell, T.: Decaf: A deep convolutional activation feature for generic visual recognition. In: International conference on machine learning. pp. 647-655. PMLR (2014) +7. Dong, P., Li, L., Wei, Z.: Diswot: Student architecture search for distillation without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11898-11908 (2023) +8. Guo, J., Chen, M., Zhao, Y., Pan, B., Zhu, C., Hu, Y., Wang, H., He, X., Cai, D.: Reducing the capacity gap via spherical knowledge distillation (2022) +9. Guo, Z., Yan, H., Li, H., Lin, X.: Class attention transfer based knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11868-11877 (June 2023) +0. Han, S., Mao, H., Dally, W.J.: Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015) +1. He, K., Chen, X., Xie, S., Li, Y., Dólar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022) +2. He, K., Zhang, X., Ren, S., Sun, J.: Delving deep into rectifiers: Surpassing human-level performance on imagenet classification. In: Proceedings of the IEEE international conference on computer vision. pp. 1026-1034 (2015) +3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016) + +14. Heo, B., Kim, J., Yun, S., Park, H., Kwak, N., Choi, J.Y.: A comprehensive overhaul of feature distillation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1921-1930 (2019) +15. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015) +16. Huang, T., You, S., Wang, F., Qian, C., Xu, C.: Knowledge distillation from a stronger teacher. arXiv preprint arXiv:2205.10536 (2022) +17. Kong, S., Ramanan, D.: Opengan: Open-set recognition via open data generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 813-822 (2021) +18. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009) +19. Li, L., Dong, P., Li, A., Wei, Z., Ya, Y.: Kd-zero: Evolving knowledge distiller for any teacher-student pairs. In: Thirty-seventh Conference on Neural Information Processing Systems (2023) +20. Li, L., Dong, P., Wei, Z., Yang, Y.: Automated knowledge distillation via monte carlo tree search. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 17413-17424 (October 2023) +21. Lin, T.Y., Dólar, P., Girshick, R., He, K., Hariharan, B., Belongie, S.: Feature pyramid networks for object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2117-2125 (2017) +22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014) +23. Ma, N., Zhang, X., Zheng, H.T., Sun, J.: Shufflenet v2: Practical guidelines for efficient cnn architecture design. In: Proceedings of the European conference on computer vision (ECCV). pp. 116-131 (2018) +24. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018) +25. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3967-3976 (2019) +26. Passalis, N., Tefas, A.: Learning deep representations with probabilistic knowledge transfer. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 268-284 (2018) +27. Passalis, N., Tefas, A.: Probabilistic knowledge transfer for deep representation learning. CoRR, abs/1803.10837 1(2), 5 (2018) +28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) +29. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. Advances in neural information processing systems 28 (2015) +30. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014) +31. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115, 211-252 (2015) + +32. Sandler, M., Howard, A., Zhu, M., Zhmoginov, A., Chen, L.C.: Mobilenetv2: Inverted residuals and linear bottlenecks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4510-4520 (2018) +33. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014) +34. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019) +35. Wang, G.H., Ge, Y., Wu, J.: Distilling knowledge by mimicking features. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(11), 8183-8195 (2021) +36. Wang, T., Yuan, L., Zhang, X., Feng, J.: Distilling object detectors with fine-grained feature imitation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4933-4942 (2019) +37. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part VII 14. pp. 499-515. Springer (2016) +38. Wightman, R.: Pytorch image models. https://github.com/rwrightman/pytorch-image-models (2019). https://doi.org/10.5281/zenodo.4414861 +39. Xu, K., Rui, L., Li, Y., Gu, L.: Feature normalized knowledge distillation for image classification. In: European conference on computer vision. pp. 664-680. Springer (2020) +40. Xu, R., Li, G., Yang, J., Lin, L.: Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1426-1435 (2019) +41. Yang, C., Zhou, H., An, Z., Jiang, X., Xu, Y., Zhang, Q.: Cross-image relational knowledge distillation for semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12319-12328 (2022) +42. Yang, J., Martinez, B., Bulat, A., Tzimiropoulos, G., et al.: Knowledge distillation via softmax regression representation learning. International Conference on Learning Representations (ICLR) (2021) +43. Yang, Z., Li, Z., Shao, M., Shi, D., Yuan, Z., Yuan, C.: Masked generative distillation. In: European Conference on Computer Vision. pp. 53-69. Springer (2022) +44. Ye, J., Lu, X., Lin, Z., Wang, J.Z.: Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers. arXiv preprint arXiv:1802.00124 (2018) +45. Yim, J., Joo, D., Bae, J., Kim, J.: A gift from knowledge distillation: Fast optimization, network minimization and transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4133-4141 (2017) +46. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016) +47. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016) +48. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11953-11962 (2022) \ No newline at end of file diff --git a/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/images.zip b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..eaf0ba40ab542cbedd229c5e16b3cea1d4d3a6b5 --- /dev/null +++ b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b69ff31fec2ca1753e021211cbb1622f0286c30369a5a253e2e59b7a73d1d7ec +size 482292 diff --git a/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/layout.json b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..631d07d984be1b5acc97676b2fb3e76ad1cd982d --- /dev/null +++ b/2024/Improving Knowledge Distillation via Regularizing Feature Direction and Norm/layout.json @@ -0,0 +1,10756 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 133, + 111, + 481, + 146 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 111, + 481, + 146 + ], + "spans": [ + { + "bbox": [ + 133, + 111, + 481, + 146 + ], + "type": "text", + "content": "Improving Knowledge Distillation via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "spans": [ + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "text", + "content": "Yuzhu Wang" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "text", + "content": ", Lechao Cheng" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "inline_equation", + "content": "^{2\\boxtimes}" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "text", + "content": ", Manni Duan" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "text", + "content": ", Yongheng Wang" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "text", + "content": ", Zunlei Feng" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "text", + "content": ", and Shu Kong" + }, + { + "bbox": [ + 161, + 167, + 452, + 193 + ], + "type": "inline_equation", + "content": "^{4,5,6}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "text", + "content": "Zhejiang Lab " + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "text", + "content": "Hefei University of Technology " + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "text", + "content": "Zhejiang University " + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "inline_equation", + "content": "^{4}" + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "text", + "content": "University of Macau " + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "inline_equation", + "content": "^{5}" + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "text", + "content": "Institute of Collaborative Innovation " + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "inline_equation", + "content": "^{6}" + }, + { + "bbox": [ + 132, + 201, + 482, + 236 + ], + "type": "text", + "content": "Texas A&M University https://github.com/WangYZ1608/Knowledge-Distillation-via-ND" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 262, + 455, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 262, + 455, + 559 + ], + "spans": [ + { + "bbox": [ + 160, + 262, + 455, + 559 + ], + "type": "text", + "content": "Abstract. Knowledge distillation (KD) is a particular technique of model compression that exploits a large well-trained teacher neural network to train a small student network. Treating teacher's feature as knowledge, prevailing methods train student by aligning its features with the teacher's, e.g., by minimizing the KL-divergence or L2-distance between their (logits) features. While it is natural to assume that better feature alignment helps distill teacher's knowledge, simply forcing this alignment does not directly contribute to the student's performance, e.g., classification accuracy. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student classifier. We are motivated to regularize student features at the penultimate layer using teacher towards training a better student classifier. Specifically, we present a rather simple method that uses teacher's class-mean features to align student features w.r.t their direction. Experiments show that this significantly improves KD performance. Moreover, we empirically find that student produces features that have notably smaller norms than teacher's, motivating us to regularize student to produce large-norm features. Experiments show that doing so also yields better performance. Finally, we present a simple loss as our main technical contribution that regularizes student by simultaneously (1) aligning the direction of its features with the teacher class-mean feature, and (2) encouraging it to produce large-norm features. Experiments on standard benchmarks demonstrate that adopting our technique remarkably improves existing KD methods, achieving the state-of-the-art KD performance through the lens of image classification (on ImageNet and CIFAR100 datasets) and object detection (on the COCO dataset)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 568, + 432, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 568, + 432, + 579 + ], + "spans": [ + { + "bbox": [ + 160, + 568, + 432, + 579 + ], + "type": "text", + "content": "Keywords: knowledge distillation " + }, + { + "bbox": [ + 160, + 568, + 432, + 579 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 568, + 432, + 579 + ], + "type": "text", + "content": " large-norm " + }, + { + "bbox": [ + 160, + 568, + 432, + 579 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 568, + 432, + 579 + ], + "type": "text", + "content": " feature direction" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 599, + 230, + 611 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 230, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 230, + 611 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 623, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 623, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 623, + 482, + 647 + ], + "type": "text", + "content": "Knowledge distillation (KD) is a specific technique for model compression that aims to train a smaller model (called student) by distilling knowledge learned" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 132, + 653, + 321, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 653, + 321, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 653, + 321, + 665 + ], + "type": "inline_equation", + "content": "\\text{忍}" + }, + { + "bbox": [ + 132, + 653, + 321, + 665 + ], + "type": "text", + "content": " Corresponding author: chenglc@hfut.edu.cn" + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 209, + 115, + 219, + 122 + ], + "blocks": [ + { + "bbox": [ + 209, + 115, + 219, + 122 + ], + "lines": [ + { + "bbox": [ + 209, + 115, + 219, + 122 + ], + "spans": [ + { + "bbox": [ + 209, + 115, + 219, + 122 + ], + "type": "image", + "image_path": "4e57f54de727772ac07d7878093b79ad057ff021698868cfceabcb8b3f53ea9d.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 220, + 117, + 241, + 124 + ], + "lines": [ + { + "bbox": [ + 220, + 117, + 241, + 124 + ], + "spans": [ + { + "bbox": [ + 220, + 117, + 241, + 124 + ], + "type": "text", + "content": "student" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 249, + 117, + 263, + 124 + ], + "blocks": [ + { + "bbox": [ + 249, + 117, + 263, + 124 + ], + "lines": [ + { + "bbox": [ + 249, + 117, + 263, + 124 + ], + "spans": [ + { + "bbox": [ + 249, + 117, + 263, + 124 + ], + "type": "image", + "image_path": "eaca632918e2ee2130018d250228f5acef0eff6563bf0026d8721666c8ba55e4.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 265, + 117, + 279, + 124 + ], + "lines": [ + { + "bbox": [ + 265, + 117, + 279, + 124 + ], + "spans": [ + { + "bbox": [ + 265, + 117, + 279, + 124 + ], + "type": "text", + "content": "acher" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 287, + 117, + 296, + 125 + ], + "blocks": [ + { + "bbox": [ + 287, + 117, + 296, + 125 + ], + "lines": [ + { + "bbox": [ + 287, + 117, + 296, + 125 + ], + "spans": [ + { + "bbox": [ + 287, + 117, + 296, + 125 + ], + "type": "image", + "image_path": "fa091acb0b0245ef65d581fc031919b546f6c751274bd6f773b02a08edc7699d.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 298, + 117, + 370, + 125 + ], + "lines": [ + { + "bbox": [ + 298, + 117, + 370, + 125 + ], + "spans": [ + { + "bbox": [ + 298, + 117, + 370, + 125 + ], + "type": "text", + "content": "existing loss, e.g., " + }, + { + "bbox": [ + 298, + 117, + 370, + 125 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{ce},\\mathcal{L}_{kd}" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 378, + 115, + 388, + 122 + ], + "blocks": [ + { + "bbox": [ + 378, + 115, + 388, + 122 + ], + "lines": [ + { + "bbox": [ + 378, + 115, + 388, + 122 + ], + "spans": [ + { + "bbox": [ + 378, + 115, + 388, + 122 + ], + "type": "image", + "image_path": "9b72e3acbfa34bd9cb0478f4ba2320c4667fefb479c3e2ce586dfbb12906af24.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 389, + 117, + 446, + 123 + ], + "lines": [ + { + "bbox": [ + 389, + 117, + 446, + 123 + ], + "spans": [ + { + "bbox": [ + 389, + 117, + 446, + 123 + ], + "type": "text", + "content": "our proposed loss " + }, + { + "bbox": [ + 389, + 117, + 446, + 123 + ], + "type": "inline_equation", + "content": "\\mathcal{L}" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 389, + 123, + 455, + 128 + ], + "lines": [ + { + "bbox": [ + 389, + 123, + 455, + 128 + ], + "spans": [ + { + "bbox": [ + 389, + 123, + 455, + 128 + ], + "type": "text", + "content": "1 1" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 149, + 134, + 303, + 238 + ], + "blocks": [ + { + "bbox": [ + 149, + 134, + 303, + 238 + ], + "lines": [ + { + "bbox": [ + 149, + 134, + 303, + 238 + ], + "spans": [ + { + "bbox": [ + 149, + 134, + 303, + 238 + ], + "type": "image", + "image_path": "6790b80897748213a6a5a85666a9e6546751e62ae28939ec4c795f1ef8a5740c.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 190, + 241, + 255, + 251 + ], + "lines": [ + { + "bbox": [ + 190, + 241, + 255, + 251 + ], + "spans": [ + { + "bbox": [ + 190, + 241, + 255, + 251 + ], + "type": "text", + "content": "logit distillation" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 309, + 135, + 463, + 239 + ], + "blocks": [ + { + "bbox": [ + 309, + 135, + 463, + 239 + ], + "lines": [ + { + "bbox": [ + 309, + 135, + 463, + 239 + ], + "spans": [ + { + "bbox": [ + 309, + 135, + 463, + 239 + ], + "type": "image", + "image_path": "24a1e6959aa909f98be6e727f9b6419252eca28a1c29876e2fd786ee6b87b3e9.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 347, + 241, + 423, + 251 + ], + "lines": [ + { + "bbox": [ + 347, + 241, + 423, + 251 + ], + "spans": [ + { + "bbox": [ + 347, + 241, + 423, + 251 + ], + "type": "text", + "content": "feature distillation" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "lines": [ + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "text", + "content": "Fig. 1: Our main contribution is a simple loss, termed " + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dino}" + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "text", + "content": ", that regularizes the direction and norm of the student features (details in Sec. 3.3). " + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dino}" + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "text", + "content": " is applicable to different KD methods which can be categorized into two types in the context of classification: (left) logit distillation that regularizes logits or softmax scores (e.g., KD [15] and DKD [48]), and (right) feature distillation that regularizes features other than logits (e.g., ReviewKD [4]). In this work, we apply " + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dino}" + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "text", + "content": " to the embedding feature particularly at the penultimate layer (before logits). Experiments show that learning with " + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dino}" + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "text", + "content": " improves existing KD methods, achieving the state-of-the-art benchmarking results for image classification (Tab. 1) and object detection (Tab. 3)." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 387, + 482, + 447 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 387, + 482, + 447 + ], + "spans": [ + { + "bbox": [ + 130, + 387, + 482, + 447 + ], + "type": "text", + "content": "by a larger teacher model [15]. Deploying the small student model reduces inference computation (e.g., running time and memory use) compared against the original large model. Different from other model compression methods such as pruning [44] and quantization [10], KD has the flexibility of using different architectures of the student, which is preferred by certain real-world applications." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 449, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 581 + ], + "type": "text", + "content": "Status quo. Treating teacher features as knowledge, KD distills such knowledge to train student by encouraging its features to be similar to the teacher's. Through the lens of image classification, prevailing methods can be categorized into two types: logit distillation (Fig. 1-left), and feature distillation (Fig. 1-right). Logit distillation trains the student by minimizing the KL divergence between its logits and the teacher's [15,48]. It assumes that, if student can produce logits more similar to teacher's, it should achieve better performance that approaches teacher's performance. However, logit distillation considers only the logit layer but not other intermediate layers. To exploit such, feature distillation trains student by encouraging its intermediate-layer features to be similar to the teacher's, e.g., by minimizing the L2 distance between their features [4,46]." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Motivation. Despite the promising results of logit distillation and feature distillation methods, forcing the student to produce similar logits or features to the teacher's does not directly serve the final task, e.g., classification. For example, minimizing the L2 distance between the penultimate-layer features (used to compute logits for classification) does not necessarily help learn a better student-classifier. Rather, student features are better regularized by the teacher to facilitate learning a better student classifier. Therefore, we are" + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": "motivated to exploit teacher's classifier to train better student towards better performance. Moreover, we empirically find that encouraging the student to produce large-norm features yields better performance (Fig. 2). Other lines of work such as domain adaptation [40] and pruning [44] also find the benefit of learning large-norm features, motivating us to train the student to produce large-norm features." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "text", + "content": "Contributions. We make three major contributions. First, we take a novel perspective to improve KD by regularizing student to produce features that (1) are aligned with class-means features computed by the teacher, and (2) have sufficiently large norms. Second, we study multiple baseline methods to achieve such regularizations. We show that when incorporating either or both, existing KD methods yields better performance, e.g., classification accuracy and object detection precision by the student. Third, we propose a novel and simple loss that simultaneously regularizes feature direction and norm, termed dino-loss. Experiments demonstrate that additionally adopting our dino-loss helps existing KD methods achieve better performance. For example, on the standard benchmark ImageNet [5], applying dino-loss to KD [15] achieves " + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "inline_equation", + "content": "72.49\\%" + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "text", + "content": " classification accuracy (Fig. 5), better than the original KD " + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "inline_equation", + "content": "(71.35\\%)" + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "text", + "content": ", with ResNet-18 and ResNet-50 architectures for student and teacher, respectively. This outperforms recent methods ReviewKD [4] " + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "inline_equation", + "content": "(71.09\\%)" + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "text", + "content": " and DKD [48] " + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "inline_equation", + "content": "(71.85\\%)" + }, + { + "bbox": [ + 130, + 188, + 483, + 357 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 375, + 237, + 388 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 375, + 237, + 388 + ], + "spans": [ + { + "bbox": [ + 132, + 375, + 237, + 388 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 402, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 582 + ], + "type": "text", + "content": "Knowledge distillation. (KD) aims to train a small student model by distilling knowledge of a well-trained large teacher model. The knowledge is delivered by features produced by the teacher for training data. Therefore, the key to KD is to align student features to the teacher's. The seminal KD method [15] propose to train student by aligning its logits with the teacher's, i.e., minimizing the Kullback-Leibler divergence (KL) between logits. Other works improve KD by decoupling the KL loss into multiple terms [48] or consider logits rankings [16]. Distilling logit knowledge alone may not be sufficient as this does not exploit intermediate-layer features. Hence, feature distillation proposes to align more features at other layers [1, 4, 14, 25, 26, 30, 34, 41, 45, 46]. Another line of research adopts network architecture search towards finding small student for KD [7, 19, 20], achieving the state-of-the-art at a cost of extra computation for architecture search. In this work, we take a different and orthogonal perspective to improve KD with simple methods, by encouraging the student to produce features to be aligned with the direction of teacher classifier and of large norms." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 483, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 483, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 483, + 665 + ], + "type": "text", + "content": "Constructing classifiers using off-the-shelf features. Off-the-shelf features extracted from a well-trained model can be used to construct strong classifiers. One simple classifier is to compute class-mean of training examples in the feature space, and uses such as the classifier [6,17,33]. On the other hand, recent literature of pretrained large models [28] shows that using off-the-shelf features and cosine similarity is a powerful classifier for zero-shot recognition. In this work, we propose to regularize student features using class-mean of teacher" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 114, + 239, + 186 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 239, + 186 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 239, + 186 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 239, + 186 + ], + "type": "image", + "image_path": "ac9c9e9e19c23ae2e0b4645b4b4f8f358e64e8b5ee5ddb1ecaeb00d2c6dc6491.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 187, + 239, + 197 + ], + "lines": [ + { + "bbox": [ + 132, + 187, + 239, + 197 + ], + "spans": [ + { + "bbox": [ + 132, + 187, + 239, + 197 + ], + "type": "text", + "content": "(a) regularize feature direction" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 242, + 114, + 310, + 185 + ], + "blocks": [ + { + "bbox": [ + 242, + 114, + 310, + 185 + ], + "lines": [ + { + "bbox": [ + 242, + 114, + 310, + 185 + ], + "spans": [ + { + "bbox": [ + 242, + 114, + 310, + 185 + ], + "type": "image", + "image_path": "c67dadee9ddfcb682cf7694f9223a4fe5e8c9a9e91b52dfda9b9193c9b4e734d.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 242, + 187, + 310, + 197 + ], + "lines": [ + { + "bbox": [ + 242, + 187, + 310, + 197 + ], + "spans": [ + { + "bbox": [ + 242, + 187, + 310, + 197 + ], + "type": "text", + "content": "(b) teacher feature" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 314, + 114, + 380, + 185 + ], + "blocks": [ + { + "bbox": [ + 314, + 114, + 380, + 185 + ], + "lines": [ + { + "bbox": [ + 314, + 114, + 380, + 185 + ], + "spans": [ + { + "bbox": [ + 314, + 114, + 380, + 185 + ], + "type": "image", + "image_path": "38652112356f14203b112569763a680ba23707943cee52b2a04ff00f5c439c52.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 313, + 187, + 381, + 197 + ], + "lines": [ + { + "bbox": [ + 313, + 187, + 381, + 197 + ], + "spans": [ + { + "bbox": [ + 313, + 187, + 381, + 197 + ], + "type": "text", + "content": "(c) student feature" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 385, + 114, + 482, + 186 + ], + "blocks": [ + { + "bbox": [ + 385, + 114, + 482, + 186 + ], + "lines": [ + { + "bbox": [ + 385, + 114, + 482, + 186 + ], + "spans": [ + { + "bbox": [ + 385, + 114, + 482, + 186 + ], + "type": "image", + "image_path": "f55a1f6bcad131cc9b2958564ccdc475b13364ea315604d7277e0a41e0e9eeb6.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 385, + 187, + 481, + 197 + ], + "lines": [ + { + "bbox": [ + 385, + 187, + 481, + 197 + ], + "spans": [ + { + "bbox": [ + 385, + 187, + 481, + 197 + ], + "type": "text", + "content": "(d) regularize feature norm" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 206, + 482, + 371 + ], + "lines": [ + { + "bbox": [ + 130, + 206, + 482, + 371 + ], + "spans": [ + { + "bbox": [ + 130, + 206, + 482, + 371 + ], + "type": "text", + "content": "Fig. 2: Regularizing feature direction and norm helps knowledge distillation and improves student's performance. We train a ResNet-56 teacher and use the classic KD method [15] to train a ResNet-8 student on the CIFAR10 dataset. (a) We propose to regularize student by aligning its feature direction with the class-mean features computed by teacher. To do so, we adopt a simple cosine loss term on the penultimate-layer features (Sec. 3.2). Results show that regularizing feature direction improves student's performance. (b-c) We train teacher and student to produce 2D features at the penultimate layer from scratch (without using method KD [15]). We visualize them as 2D points, colored by class labels, and mark the class center by " + }, + { + "bbox": [ + 130, + 206, + 482, + 371 + ], + "type": "inline_equation", + "content": "\\star" + }, + { + "bbox": [ + 130, + 206, + 482, + 371 + ], + "type": "text", + "content": ". Notably, the large teacher model produces large-norm features (b), while the small student model produces small-norm features (c). (d) This motivates us to regularize student by encouraging it to produce large-norm features (Sec. 3.2). To do so, we use the method SIFN [40]. Results show that properly regularizing feature norms improves student's performance. Our technical contribution is a simple loss that simultaneously regularizes student feature direction and norm, so we call it dino-loss." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 399, + 481, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 481, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 481, + 434 + ], + "type": "text", + "content": "features, as well as other different methods for feature alignment. We hypothesize that doing so helps learn better student classifiers. Indeed, our experiments justify this hypothesis (Tab. 4)." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 436, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 436, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 436, + 482, + 592 + ], + "type": "text", + "content": "Learning large-norm features. Multiple lines of work find it important to learn large-norm features or weight parameters. For example, domain adaptation [40] reveals that the erratic discrimination of the target domain mainly stems from its much smaller feature norms w.r.t that of the source domain, and adopting a larger-norm constraint helps adapt a pretrained model (in the source domain) to a new target domain. Moreover, model pruning finds that features with smaller norms play a less informative role during the inference [44], so it is safe to remove weight parameters that produce small-norm features without causing notable performance drop. In our work, we also empirically find that a small-capacity model produces features that tend to collide in the small-norm region (Fig. 2c). Therefore, we are motivated to train student to produce large-norm features, hypothesizing that doing so improves student performance. Our experiments justify this hypothesis (Fig. 2d, Tab. 4)." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": "Feature regularization w.r.t norm and direction. The literature has multiple works studying feature regularization w.r.t its norm and direction in KD. We present them and explain how our method stands out. PKD [2] normalizes student and teacher features to have zero mean and unit variances to eliminate the gap in feature norms between them, and applies MSE loss between the normalized features. Our method encourages learning large-norm features of the" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": "student and additionally regularizes features using teacher classifier for better classification. Guo [8] transforms student logits to have the same norm of the teacher logits and performs KL-divergence on the transformed logits, whereas we encourage learning large-norm student features which can have feature norm larger than the teacher's (Fig. 4). FNKD [39] also advocates learning large-norm features but chooses to tune a temperature (shared by all classes) to enlarge logit values before softmax; differently, our method unifies norm regularization and feature direction regularization into a simple loss. Both SimKD [3] and SRRL [42] use MSE loss to align the student features with the teacher's without enlarging feature norms; Wang [35] uses an L2 loss to align features of teacher and student models and further adopts a loss based on locality-sensitive hashing to encourage the direction of student features to be aligned with teacher's. These methods do not necessarily learn a student to have feature norms that can be larger than the teacher's. In sum, our simple dino-loss not only aligns directions of student and teacher features but also explicitly encourages learning student to produce large-norm features." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 327, + 460, + 354 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 327, + 460, + 354 + ], + "spans": [ + { + "bbox": [ + 131, + 327, + 460, + 354 + ], + "type": "text", + "content": "3 Improving Knowledge Distillation by Regularizing Feature Direction & Norm" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 366, + 482, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 482, + 403 + ], + "type": "text", + "content": "We first describe notations and motivate our study of regularizing feature direction and norm to improve KD. Then, we introduce baselines, followed by our proposed dino-loss." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 422, + 296, + 434 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 422, + 296, + 434 + ], + "spans": [ + { + "bbox": [ + 131, + 422, + 296, + 434 + ], + "type": "text", + "content": "3.1 Notations and Background" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "spans": [ + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": "Notations. Without losing generality, we think of a classification neural network as two modules: a feature extractor " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "f(\\cdot; \\Theta)" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ", and a classifier " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "g(\\cdot; \\mathbf{w})" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ", which are parameterized by " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\Theta" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{w}" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ", respectively. For the teacher, given input data " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ", we denote its embedding feature as " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^t = f^t(\\mathbf{x}; \\Theta^t)" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ", and the logits as " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{z}^t = g^t(\\mathbf{f}^t; \\mathbf{w}^t)" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ". Similarly, the student outputs the embedding features for " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " as " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s = f^s(\\mathbf{x}; \\Theta^s)" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " and logits as " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{z}^s = g^s(\\mathbf{f}^s; \\mathbf{w}^s)" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ". We compute softmax scores in a vector " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{q}^t = \\mathrm{softmax}(\\mathbf{z}^t; \\tau)" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " is a temperature (default value as 1). Given " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " training examples from " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " classes, " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_i" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " and its label " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "y_i" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " (where " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "i = 1, \\dots, N" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": "), one can train a classification model (e.g., the teacher) by minimizing the cross-entropy (CE) loss " + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{ce}" + }, + { + "bbox": [ + 130, + 442, + 482, + 562 + ], + "type": "text", + "content": " on all the training data." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "text", + "content": "Logit distillation trains the student by transferring the teacher knowledge using both the CE loss " + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{ce}" + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "text", + "content": " and a KD loss " + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd}" + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "text", + "content": ". The seminal work of KD [15] uses KL divergence as the KD loss " + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd}" + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "text", + "content": ", i.e., " + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd} = \\frac{1}{N}\\sum_{i=1}^{N}\\mathbf{KL}(\\mathbf{q}_i^t,\\mathbf{q}_i^s)" + }, + { + "bbox": [ + 130, + 563, + 482, + 601 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 600, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 600, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 600, + 482, + 635 + ], + "type": "text", + "content": "Feature distillation distills teacher knowledge by minimizing the difference of intermediate features at more layers other than the logits [4, 45, 46]. A typical loss term is the L2 distance " + }, + { + "bbox": [ + 130, + 600, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 600, + 482, + 635 + ], + "type": "text", + "content": " between student and teacher features. For" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 482, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 482, + 666 + ], + "type": "text", + "content": "1 When student and teacher have different features dimensions, one can learn extra layers in student to project its features to the same dimension as teacher's [4]." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 142 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 142 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 142 + ], + "type": "text", + "content": "example, over the embedding features at the penultimate layer (before logits), it applies the L2 loss " + }, + { + "bbox": [ + 130, + 116, + 479, + 142 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd} = \\frac{1}{N}\\sum_{i=1}^{N}\\mathcal{L}_2(\\mathbf{f}_i^s,\\mathbf{f}_i^t)" + }, + { + "bbox": [ + 130, + 116, + 479, + 142 + ], + "type": "text", + "content": " in addition to the CE loss " + }, + { + "bbox": [ + 130, + 116, + 479, + 142 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{ce}" + }, + { + "bbox": [ + 130, + 116, + 479, + 142 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "spans": [ + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "text", + "content": "The final loss is " + }, + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "inline_equation", + "content": "\\mathcal{L} = \\mathcal{L}_{ce} + \\alpha \\mathcal{L}_{kd}" + }, + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "text", + "content": " controls the significance of the KD loss " + }, + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd}" + }, + { + "bbox": [ + 130, + 142, + 482, + 166 + ], + "type": "text", + "content": " depending on distillation choice: logit distillation or feature distillation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 184, + 251, + 196 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 184, + 251, + 196 + ], + "spans": [ + { + "bbox": [ + 132, + 184, + 251, + 196 + ], + "type": "text", + "content": "3.2 Baseline Methods" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "content": "Recall that we are motivated to regularize student features during training: aligning their direction with teacher class-mean features, and encouraging them to be large in norm. In the main paper, we focus on the embedding features " + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s" + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "content": " at the penultimate layer, which are the direct input to a classifier; we also validate its effectiveness at other layers (Tab. 5). We compute the class-mean of the " + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "inline_equation", + "content": "k^{th}" + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "content": " class as " + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "inline_equation", + "content": "\\mathbf{c}_k = \\frac{1}{|\\mathcal{I}_k|}\\sum_{j\\in \\mathcal{I}_k}\\mathbf{f}_j^t" + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "inline_equation", + "content": "\\mathcal{I}_k" + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "content": " is the set of indices of training examples belonging to class-" + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "content": ". We now introduce simple techniques to regularize student features using " + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "inline_equation", + "content": "\\mathbf{c}_k" + }, + { + "bbox": [ + 130, + 205, + 482, + 300 + ], + "type": "text", + "content": " w.r.t feature direction and norm." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 301, + 482, + 324 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 301, + 482, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 301, + 482, + 324 + ], + "type": "text", + "content": "Feature Direction Regularization. We present two simple baseline methods below to regularize student w.r.t feature direction." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "spans": [ + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "text", + "content": "Baseline-1: cosine similarity. We use a simple cosine similarity based loss term to regularize the feature direction of " + }, + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_i^s" + }, + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "text", + "content": " according to the mean feature " + }, + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "inline_equation", + "content": "\\mathbf{c}_k" + }, + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "text", + "content": " of the corresponding class-" + }, + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 326, + 482, + 361 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 233, + 370, + 482, + 399 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 370, + 482, + 399 + ], + "spans": [ + { + "bbox": [ + 233, + 370, + 482, + 399 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {d} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\left(1 - \\cos \\left(\\mathbf {f} _ {i} ^ {s}, \\mathbf {c} _ {k}\\right)\\right) \\tag {1}", + "image_path": "5814bd8a4b59a3d411066f3b6aeb03e98d1e563c33a85dde6f876c4da408954b.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 407, + 482, + 455 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 455 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 455 + ], + "type": "text", + "content": "Baseline-2: InfoNCE. Using the cosine similarity loss Eq. 1 considers only paired examples and their corresponding class-mean. Inspired by InfoNCE [24], we also consider inter-class examples and class-means. Therefore, we train student by minimizing:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 208, + 464, + 482, + 495 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 464, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 208, + 464, + 482, + 495 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {d} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} - \\log \\frac {\\exp \\left(\\cos \\left(\\mathbf {f} _ {i} ^ {s} , \\mathbf {c} _ {k}\\right)\\right)}{\\sum_ {j = 1} ^ {C} \\exp \\left(\\cos \\left(\\mathbf {f} _ {i} ^ {s} , \\mathbf {c} _ {j}\\right)\\right)} \\tag {2}", + "image_path": "ee901f7a706d1a1e11f247901f6298195944d9088e111426028669df98060a71.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 501, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 525 + ], + "type": "text", + "content": "Feature Norm Regularization. We present two baseline methods below to regularize student towards producing large-norm features." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 525, + 482, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 482, + 584 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 482, + 584 + ], + "type": "text", + "content": "Baseline-1: " + }, + { + "bbox": [ + 130, + 525, + 482, + 584 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 525, + 482, + 584 + ], + "type": "text", + "content": " distance. As shown by Fig. 2c, the small-capacity student model produces features that have notably smaller norm than the teacher's. To train the student to produce larger-norm features, perhaps a naive method is to increase student feature norm towards teacher's. To this end, we minimize the L2 distance between features of student and teacher:" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 244, + 592, + 482, + 622 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 592, + 482, + 622 + ], + "spans": [ + { + "bbox": [ + 244, + 592, + 482, + 622 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {n} = \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\| \\mathbf {f} _ {i} ^ {s} - \\mathbf {f} _ {i} ^ {t} \\| _ {2} ^ {2} \\tag {3}", + "image_path": "b07508237ee76eb0634215c10e7025218adf5f614df472ef1bdbec5469d7eeac.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Minimizing Eq. 3 is a common practice in feature distillation [1,4,14]. It implicitly trains student to produce features with norms approaching the corresponding larger-norm teacher features." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "Baseline-2: Stepwise increasing feature norms (SIFN). We now describe a loss to explicitly increase the norm of the student features. Inspired by [40], we gradually increase the feature norm by minimizing:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 194, + 160, + 482, + 190 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 194, + 160, + 482, + 190 + ], + "spans": [ + { + "bbox": [ + 194, + 160, + 482, + 190 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {n} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\mathcal {L} _ {2} \\left(f ^ {s} \\left(\\mathbf {x} _ {i}; \\Theta_ {\\text {p r e v i o u s}} ^ {s}\\right) + r, f ^ {s} \\left(\\mathbf {x} _ {i}; \\Theta_ {\\text {c u r r e n t}} ^ {s}\\right)\\right), \\tag {4}", + "image_path": "2da35cbdca07c9ae1b6ee008d2088628b789d2c252b6392ae3079a025c9ae0ee.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "spans": [ + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "inline_equation", + "content": "\\Theta_{previous}^{s}" + }, + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "inline_equation", + "content": "\\Theta_{current}^{s}" + }, + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "text", + "content": " are parameters of an early checkpoint and the current model being optimized, respectively; " + }, + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "inline_equation", + "content": "r" + }, + { + "bbox": [ + 130, + 197, + 479, + 233 + ], + "type": "text", + "content": " is a step size to increase the norm of student features during training." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 251, + 282, + 264 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 251, + 282, + 264 + ], + "spans": [ + { + "bbox": [ + 131, + 251, + 282, + 264 + ], + "type": "text", + "content": "3.3 The Proposed dino Loss" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": "We now present the proposed dino-loss that simultaneously achieves the above two goals: (1) aligning student features to teacher's w.r.t direction, and (2) learning large-norm student features. For simplicity, we drop the subscript (i.e., the index of a training example or class ID). Let " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^t" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": " be the embedding features of an input " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": " computed by student and teacher, respectively. Based on " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{x}" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": "'s ground-truth label " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": ", we have its corresponding class-mean " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{c}" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": ". We denote the unit vector " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{e} = \\mathbf{c} / \\| \\mathbf{c}\\|_2" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{p}^t = \\mathbf{e}\\| \\mathbf{f}^t\\|_2" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": ". We compute the projection of " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": " along " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{c}" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": "'s direction: " + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "inline_equation", + "content": "\\mathbf{p}^s = \\mathbf{e}\\| \\mathbf{f}^s\\|_2\\cos (\\mathbf{f}^s,\\mathbf{c})" + }, + { + "bbox": [ + 130, + 273, + 480, + 369 + ], + "type": "text", + "content": ". Fig. 3 shows the geometric meaning." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "text", + "content": "When the norm of " + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s" + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "text", + "content": " is small, or its projection " + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "inline_equation", + "content": "\\mathbf{p}^s" + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "text", + "content": " has small norm, i.e., " + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "inline_equation", + "content": "\\| \\mathbf{p}^s\\| _2 < \\| \\mathbf{f}^t\\| _2" + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "text", + "content": ", we encourage the student to output larger-norm features and align them with the teacher class-mean by minimizing " + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "inline_equation", + "content": "\\| \\mathbf{p}^t -\\mathbf{p}^s\\| _2" + }, + { + "bbox": [ + 130, + 369, + 350, + 429 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 430, + 351, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 351, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 351, + 502 + ], + "type": "text", + "content": "Because the feature norms of different examples can vary by an order of magnitude (see Fig. 2c), naively learning with the above can produce artificially large gradients from specific training data and negatively affect training. Thus, we divide the above by " + }, + { + "bbox": [ + 130, + 430, + 351, + 502 + ], + "type": "inline_equation", + "content": "\\| \\mathbf{f}^t\\| _2" + }, + { + "bbox": [ + 130, + 430, + 351, + 502 + ], + "type": "text", + "content": " , which is equivalent to " + }, + { + "bbox": [ + 130, + 430, + 351, + 502 + ], + "type": "inline_equation", + "content": "\\| \\mathbf{p}^t\\| _2" + }, + { + "bbox": [ + 130, + 430, + 351, + 502 + ], + "type": "text", + "content": " .." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 510, + 350, + 543 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 350, + 543 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 350, + 543 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {d i n o}} = \\frac {\\| \\mathbf {p} ^ {t} - \\mathbf {p} ^ {s} \\| _ {2}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} = \\frac {\\| \\mathbf {p} ^ {t} \\| _ {2} - \\| \\mathbf {p} ^ {s} \\| _ {2}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} = 1 - \\frac {\\mathbf {f} ^ {s} \\cdot \\mathbf {e}}{\\| \\mathbf {f} ^ {t} \\| _ {2}} \\tag {5}", + "image_path": "874aeeb51954223cc88543ad075b53d3a2bb69cb1a13ca03ee7f289ec4528e81.jpg" + } + ] + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 378, + 398, + 460, + 473 + ], + "blocks": [ + { + "bbox": [ + 378, + 398, + 460, + 473 + ], + "lines": [ + { + "bbox": [ + 378, + 398, + 460, + 473 + ], + "spans": [ + { + "bbox": [ + 378, + 398, + 460, + 473 + ], + "type": "image", + "image_path": "20d7293459eaa1334e3b2609e7171cf229eaab2a7a32085318e17c11a1a915ea.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 356, + 486, + 482, + 519 + ], + "lines": [ + { + "bbox": [ + 356, + 486, + 482, + 519 + ], + "spans": [ + { + "bbox": [ + 356, + 486, + 482, + 519 + ], + "type": "text", + "content": "Fig. 3: Illustration of notations used in our dino-loss loss and its geometric meaning." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "bbox": [ + 147, + 544, + 350, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 544, + 350, + 555 + ], + "spans": [ + { + "bbox": [ + 147, + 544, + 350, + 555 + ], + "type": "text", + "content": "Minimizing Eq. 5 amounts to simultaneously" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "text", + "content": "(1) increasing the norm of " + }, + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s" + }, + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "text", + "content": " and (2) reducing the angular distance between " + }, + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s" + }, + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "text", + "content": " and the class-mean " + }, + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "inline_equation", + "content": "\\mathbf{c}" + }, + { + "bbox": [ + 130, + 555, + 479, + 578 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 579, + 479, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 579, + 479, + 603 + ], + "spans": [ + { + "bbox": [ + 130, + 579, + 479, + 603 + ], + "type": "text", + "content": "When " + }, + { + "bbox": [ + 130, + 579, + 479, + 603 + ], + "type": "inline_equation", + "content": "\\mathbf{f}^s" + }, + { + "bbox": [ + 130, + 579, + 479, + 603 + ], + "type": "text", + "content": " has large norm, i.e., " + }, + { + "bbox": [ + 130, + 579, + 479, + 603 + ], + "type": "inline_equation", + "content": "\\| \\mathbf{f}^s\\| _2\\geq \\| \\mathbf{f}^t\\| _2" + }, + { + "bbox": [ + 130, + 579, + 479, + 603 + ], + "type": "text", + "content": ", we only minimize the angular distance between student feature and the class-mean defined by the teacher:" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 268, + 611, + 481, + 634 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 268, + 611, + 481, + 634 + ], + "spans": [ + { + "bbox": [ + 268, + 611, + 481, + 634 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {d i n o}} = 1 - \\frac {\\mathbf {f} ^ {s} \\cdot \\mathbf {e}}{\\| \\mathbf {f} ^ {s} \\| _ {2}} \\tag {6}", + "image_path": "d6068eef0e703bf16662629f8cfd462d6810c939b212726d991f9c265f3f48b7.jpg" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": "The above loss means that the feature norm of student is no longer explicitly required to reach a larger value if it is already large enough; yet it is still allowed" + } + ] + } + ], + "index": 16 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": "to increase freely during training. We merge Eq. 5 and 6 and average over all training examples as our dino-loss (dropping the constant 1):" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 216, + 148, + 482, + 178 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 148, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 216, + 148, + 482, + 178 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {d i n o} = - \\frac {1}{C} \\sum_ {k = 1} ^ {C} \\frac {1}{| \\mathcal {I} _ {k} |} \\sum_ {i \\in \\mathcal {I} _ {k}} \\frac {\\mathbf {f} _ {i} ^ {s} \\cdot \\mathbf {e} _ {k}}{\\max \\left\\{\\| \\mathbf {f} _ {i} ^ {s} \\| _ {2} , \\| \\mathbf {f} _ {i} ^ {t} \\| _ {2} \\right\\}} \\tag {7}", + "image_path": "19b9366dd53297d0ba740ac535684830f5b1d1c063d5b18eb4e8f3082514f300.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "text", + "content": "Compatible with existing KD methods, our dino-loss " + }, + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dino}" + }, + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "text", + "content": " can be used altogether with CE loss " + }, + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{ce}" + }, + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "text", + "content": " and KD loss " + }, + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd}" + }, + { + "bbox": [ + 132, + 185, + 482, + 209 + ], + "type": "text", + "content": " to train student:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 256, + 217, + 482, + 229 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 256, + 217, + 482, + 229 + ], + "spans": [ + { + "bbox": [ + 256, + 217, + 482, + 229 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {c e} + \\alpha \\mathcal {L} _ {k d} + \\beta \\mathcal {L} _ {d i n o} \\tag {8}", + "image_path": "3b987aa2d66a7cd7eac9ecd289955db92be2375869c85feca0953552a2c02567.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "inline_equation", + "content": "\\beta" + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "content": " are the weights for " + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd}" + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dino}" + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "content": ", respectively. The definition of " + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd}" + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "content": " depends on the distillation method. Otherwise stated, we study " + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dino}" + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "content": " with the seminal logit distillation method KD [15], so " + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{kd} = \\mathbf{KL}" + }, + { + "bbox": [ + 130, + 236, + 480, + 272 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 273, + 482, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 273, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 131, + 273, + 482, + 332 + ], + "type": "text", + "content": "Remark. The dino-loss simultaneously encourages student to output large-norm features (possibly larger than teacher's, as shown in Fig. 4), and minimizes the angular distance between student features and the class-mean defined by the teacher during training. This is a desired property in terms of training the student to achieve better classification accuracy." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 350, + 230, + 364 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 350, + 230, + 364 + ], + "spans": [ + { + "bbox": [ + 132, + 350, + 230, + 364 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 376, + 271, + 388 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 376, + 271, + 388 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 271, + 388 + ], + "type": "text", + "content": "4.1 Datasets and Settings" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 395, + 480, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 395, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 130, + 395, + 480, + 418 + ], + "type": "text", + "content": "For fair comparisons, our implementation adheres to the previous methodologies outlined in [4, 16, 34, 48]." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 419, + 482, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 419, + 482, + 538 + ], + "spans": [ + { + "bbox": [ + 130, + 419, + 482, + 538 + ], + "type": "text", + "content": "CIFAR-100 [18] contains 50k training images and 10k testing images. During training, we adopt random cropping and random left-right flipping augmentations. We randomly initialize weight parameters following [12] and train all student networks from scratch. The teacher models are publicly available that are adopted in prior art [34]. The student networks are trained using a batch size of 128 for 240 epochs (with a linear warm-up for the first 20 epochs), employing SGD with a weight decay of 5e-4 and momentum of 0.9. We set the initial learning rate of 0.1 for ResNet [13] and WRN [47] backbones, and 0.02 for MobileNet [32] and ShuffleNet [23] backbones, decaying it with a factor of 10 at 150th, 180th, and 210th epochs. The temperature is empirically set to 4." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 539, + 482, + 621 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 539, + 482, + 621 + ], + "spans": [ + { + "bbox": [ + 130, + 539, + 482, + 621 + ], + "type": "text", + "content": "ImageNet [31] has 1.28 million training images and 50,000 validation images spanning by 1,000 categories. We employ SGD with a batch size of 512 for a total of 100 epochs (with a linear warm-up for the first 5 epochs). The initial learning rate is set to 0.2 and is reduced by a factor of 10 every 30 epochs. Besides, the weight decay and momentum are set to 1e-4 and 0.9, respectively. The pre-trained weights for teacher come from PyTorch² and TIMM [38] for fair comparisons. The temperature for knowledge distillation is set to 1." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 622, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 622, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 622, + 482, + 647 + ], + "type": "text", + "content": "COCO 2017 [22] consists of 80 object categories with 118k training images and 5k validation images. We utilize Faster R-CNN [29] with FPN [21] as the" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 652, + 334, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 334, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 334, + 666 + ], + "type": "text", + "content": "2 https://pytorch.org/vision/stable/models.html" + } + ] + } + ], + "index": 14 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 130, + 178, + 480, + 358 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Benchmarking results on CIFAR100. Methods are reported w.r.t top-1 accuracy (\\%) on the test set. ++ means that we apply the proposed dino-loss to existing methods. Clearly, doing so improves performance over the original KD methods and outperforms prior KD methods. We mark performance gains over corresponding methods using green superscripts." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 130, + 178, + 480, + 358 + ], + "lines": [ + { + "bbox": [ + 130, + 178, + 480, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 178, + 480, + 358 + ], + "type": "table", + "html": "
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher (T)72.3475.6179.4279.3479.4279.42
student (S)69.0671.9872.5064.6070.5071.82
Feature distillation methods
FitNet [30]69.2172.2473.5063.1673.5973.54
RKD [25]69.6172.2271.9064.4372.2873.21
PKT [27]70.3473.4573.6466.5274.1074.69
OFD [14]70.9874.3374.9569.0475.9876.82
CRD [34]71.1674.1475.5169.1175.1175.65
ReviewKD [4]71.8975.0975.6369.8977.4577.78
ReviewKD++72.05+0.1675.66+0.5776.07+0.4470.45+0.5677.68+0.2377.93+0.15
Logit distillation methods
KD [15]70.6673.5473.3367.6574.0774.45
KD++72.53+1.8774.59+1.0575.54+2.2170.10+2.3575.45+1.3876.42+1.97
DIST [16]71.7874.4275.7969.1775.2376.08
DIST++72.52+0.7475.00+0.5876.13+0.3469.80+0.6375.60+0.3776.64+0.56
DKD [48]71.9774.8175.4470.3576.4577.07
DKD++72.16+0.1975.02+0.2176.28+0.8470.82+0.4777.11+0.6677.49+0.42
", + "image_path": "7efb00c18422612fc79b076e79c3c02e5d5f33273fb0644cc04c510e8ab07abc.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 378, + 482, + 428 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 428 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 428 + ], + "type": "text", + "content": "feature extractor, and employ the dino-loss on the R-CNN head, wherein both teacher and student models adopt ResNet [13] as the backbone. In addition, MobileNet-V2 [32] is used as a heterogeneous student model. All student models are trained with 1x scheduler, following the public toolbox Detectron2.3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 445, + 373, + 457 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 445, + 373, + 457 + ], + "spans": [ + { + "bbox": [ + 131, + 445, + 373, + 457 + ], + "type": "text", + "content": "4.2 Comparisons with State-of-the-art Results" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 466, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 466, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 466, + 482, + 574 + ], + "type": "text", + "content": "CIFAR-100 classification. Tab. 1 shows the KD performances on the CIFAR-100 dataset. In this context, spanning homogeneous and heterogeneous architectures, we undertake an extensive assessment over prominent feature distillation methods and logits distillation methods. The ++ signifies the integration of our novel dino-loss into the existing methods. A salient conclusion from Tab. 1 is that our proposed dino-loss empowers existing KD methods to achieve better classification accuracy. This suggests the effectiveness and compatibility of the dino-loss, which can serve as a plugin for existing KD methods, irrespective of the homogeneity or heterogeneity for network architectures." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "content": "ImageNet classification. We demonstrate the effectiveness of the proposed dino-loss on the well-established benchmark ImageNet. Tab. 2 lists detailed results. It is worth noting that with our simple dino-loss, the method " + }, + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "inline_equation", + "content": "\\mathbf{KD}++" + }, + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "content": " already outperforms most of previous methods (e.g., ReviewKD [4], DKD [48], and SRRL [43]). Moreover, incorporating our dino-loss, other methods such as ReviewKD++ and DKD++ also achieve notable improvements." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 343, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 343, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 343, + 665 + ], + "type": "text", + "content": "3 https://github.com/facebookresearch/detectron2" + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 201, + 461, + 335 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 191 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 191 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 191 + ], + "type": "text", + "content": "Table 2: Comparisons with state-of-the-art methods on the ImageNet validation set. " + }, + { + "bbox": [ + 130, + 114, + 482, + 191 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 114, + 482, + 191 + ], + "type": "text", + "content": " serves as a stronger baseline that introduces no more parameters and negligible training time over the vanilla KD [15] and outperforms most of previous methods (e.g., ReviewKD [4], SRRL [42], and MGD [43]). Methods marked by " + }, + { + "bbox": [ + 130, + 114, + 482, + 191 + ], + "type": "inline_equation", + "content": "\\dagger" + }, + { + "bbox": [ + 130, + 114, + 482, + 191 + ], + "type": "text", + "content": " adopts a searching strategy, demanding significant more computation cost to achieve the state-of-the-art performance. In contrast, our dino-loss is rather simple that helps existing KD methods to rival search-based methods." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 201, + 461, + 335 + ], + "lines": [ + { + "bbox": [ + 148, + 201, + 461, + 335 + ], + "spans": [ + { + "bbox": [ + 148, + 201, + 461, + 335 + ], + "type": "table", + "html": "
MethodsResNet-34 → Top-1ResNet-18 Top-5ResNet-50 → Top-1MobileNet-V1 Top-5
student69.7689.4368.8788.76
teacher73.3191.5976.1692.86
CRD ICLR2020 [34]71.1790.1371.3790.42
SRRL ICLR2021 [42]71.7390.6072.4990.92
MGD ECCV2022 [43]71.5890.3572.3591.00
CAT-KD CVPR2023 [9]71.2690.4572.2491.13
KD NeurIPS2015 [15]70.6689.8870.5089.80
KD++71.98 (+1.32)90.53 (+0.65)72.77 (+2.27)91.14 (+1.34)
ReviewKD CVPR2021 [4]71.6290.5172.5691.00
ReviewKD++71.64 (-0.02)90.61 (+0.10)72.96 (+0.40)91.16 (+0.16)
DKD CVPR2022 [48]71.7090.4172.0591.05
DKD++72.07 (+0.37)90.59 (+0.18)72.63 (+0.58)91.07 (+0.02)
KD-Zero NeurIPS2023 [19]†72.1790.4673.0291.05
Auto-KD ICCV2023 [20]†72.4590.6973.2691.17
", + "image_path": "0293ba2864b11f4ea366de85e9953c84851af649b1c75faf6a93cff7e685188e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 431, + 480, + 504 + ], + "blocks": [ + { + "bbox": [ + 130, + 355, + 482, + 422 + ], + "lines": [ + { + "bbox": [ + 130, + 355, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 355, + 482, + 422 + ], + "type": "text", + "content": "Table 3: Benchmarking KD methods for object detection on the COCO val2017 dataset (mAP in %). All methods use the Faster R-CNN detector with various teacher and student architectures, including RestNet {18,50,101} and MobileNet-V2 (MV2). Incorporating our dino-loss, simple methods " + }, + { + "bbox": [ + 130, + 355, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathrm{KD + + }" + }, + { + "bbox": [ + 130, + 355, + 482, + 422 + ], + "type": "text", + "content": " and ReviewKD++ obtain notable performance gains (marks in green) over their original counterparts, achieving the state-of-the-art performance." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 431, + 480, + 504 + ], + "lines": [ + { + "bbox": [ + 133, + 431, + 480, + 504 + ], + "spans": [ + { + "bbox": [ + 133, + 431, + 480, + 504 + ], + "type": "table", + "html": "
MethodsR101→R18R101→R50R50→MV2
mAP\\( AP^{50} \\)\\( AP^{75} \\)mAP\\( AP^{50} \\)\\( AP^{75} \\)mAP\\( AP^{50} \\)\\( AP^{75} \\)
teacher42.0462.4845.8842.0462.4845.8840.2261.0243.81
student33.2653.6135.2637.9358.8441.0529.4748.8730.90
KD [15]33.9754.6636.6238.3559.4141.7130.1350.2831.35
FitNet [30]34.1354.1636.7138.7659.6241.8030.2049.8031.69
FGFI [36]35.4455.5138.1739.4460.2743.0431.1650.6832.92
DKD [48]35.0556.6037.5439.2560.9042.7332.3453.7734.01
ReviewKD [4]36.7556.7234.0040.3660.9744.0833.7153.1536.13
KD++36.12 (+2.15)56.81 (+2.15)37.64 (+1.02)39.86 (+1.51)61.07 (+1.66)43.57 (+1.86)33.26 (+3.13)53.71 (+3.43)34.85 (+3.50)
ReviewKD++37.43 (+0.68)57.96 (+1.24)40.15 (+6.15)41.03 (+0.67)61.80 (+0.83)44.94 (+0.86)34.51 (+0.80)55.18 (+2.03)37.21 (+1.08)
", + "image_path": "5f043d04061f6cc3c47497a7305b31a7b665328c63b7dcabfa7e36d085327c47.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "We note that recent KD methods adopt a searching strategy for better results, e.g., KD-Zero [19] and Auto-KD [20]. These methods search for a distiller in a space of predefined modules, e.g., normalization methods, losses, transform operations, activation functions, etc. At the cost of significantly more computation time for searching, they achieve the best performance on the benchmark, slightly better than ours. Nevertheless, our dino-loss helps existing much simpler methods rival search-based approaches! Compared against search-based methods, applying our dino-loss, methods such as " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " introduce no more parameters and negligible training time over the counterparts (e.g., vanilla KD [15]). This makes the use of our dino-loss a stronger baseline for knowledge distillation. Interestingly, current search-based methods do not consider our proposed regularization methods, i.e., feature norm regularizer and feature direction regularizer. That said, our method" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 192 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 192 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 192 + ], + "type": "text", + "content": "Table 4: Analysis of feature direction and norm regularization. We train teacher (ResNet-50, ResNet-56) and student (MobileNet-V2, ResNet-20) models on the CIFAR100 dataset and report accuracy " + }, + { + "bbox": [ + 130, + 114, + 482, + 192 + ], + "type": "inline_equation", + "content": "(\\%)" + }, + { + "bbox": [ + 130, + 114, + 482, + 192 + ], + "type": "text", + "content": " on its test-set. We use KD [15] as the baseline, which is a logit distillation method. From (a-b), we see that applying either direction or norm regularization on student features improves KD as shown by the increased student accuracy. While combining both outperforms baseline (c), using dino-loss achieves the best (d)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 210, + 293, + 232 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 210, + 293, + 232 + ], + "spans": [ + { + "bbox": [ + 130, + 210, + 293, + 232 + ], + "type": "text", + "content": "(a) Regularizing feature direction only. Cosine is more robust than InfoNCE." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 147, + 243, + 276, + 284 + ], + "blocks": [ + { + "bbox": [ + 147, + 243, + 276, + 284 + ], + "lines": [ + { + "bbox": [ + 147, + 243, + 276, + 284 + ], + "spans": [ + { + "bbox": [ + 147, + 243, + 276, + 284 + ], + "type": "table", + "html": "
caseR50→MV2R56→R20
baseline67.6570.66
cosine69.18 (+1.53)71.75 (+1.09)
InfoNCE69.06 (+1.41)70.73 (+0.07)
", + "image_path": "5825b384b0df4defdf30d19b28a927255ac0395973ceb20ab20bc8f52c0d778b.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 286, + 291, + 330 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 286, + 291, + 330 + ], + "spans": [ + { + "bbox": [ + 130, + 286, + 291, + 330 + ], + "type": "text", + "content": "(c) Regularizing both feature norm and direction. Simple addition does not yield better results (e.g., cosine + " + }, + { + "bbox": [ + 130, + 286, + 291, + 330 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 286, + 291, + 330 + ], + "type": "text", + "content": " vs. cosine vs. " + }, + { + "bbox": [ + 130, + 286, + 291, + 330 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 286, + 291, + 330 + ], + "type": "text", + "content": ")." + } + ] + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 138, + 341, + 288, + 390 + ], + "blocks": [ + { + "bbox": [ + 138, + 341, + 288, + 390 + ], + "lines": [ + { + "bbox": [ + 138, + 341, + 288, + 390 + ], + "spans": [ + { + "bbox": [ + 138, + 341, + 288, + 390 + ], + "type": "table", + "html": "
caseR50→MV2R56→R20
cosine + L268.62 (+0.97)71.58 (+0.92)
cosine + SIFN69.07 (+1.42)71.72 (+1.06)
InfoNCE + L268.47 (+0.82)70.81 (+0.15)
InfoNCE + SIFN68.71 (+1.06)71.04 (+0.38)
", + "image_path": "8de6c4a55ce258ec1ff56d293a32a9faddccf19f4512a27ce9fddd147f1d02dd.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 321, + 210, + 482, + 232 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 321, + 210, + 482, + 232 + ], + "spans": [ + { + "bbox": [ + 321, + 210, + 482, + 232 + ], + "type": "text", + "content": "(b) Regularizing feature norm only. " + }, + { + "bbox": [ + 321, + 210, + 482, + 232 + ], + "type": "inline_equation", + "content": "SIFN" + }, + { + "bbox": [ + 321, + 210, + 482, + 232 + ], + "type": "text", + "content": " is more robust than " + }, + { + "bbox": [ + 321, + 210, + 482, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 339, + 243, + 463, + 284 + ], + "blocks": [ + { + "bbox": [ + 339, + 243, + 463, + 284 + ], + "lines": [ + { + "bbox": [ + 339, + 243, + 463, + 284 + ], + "spans": [ + { + "bbox": [ + 339, + 243, + 463, + 284 + ], + "type": "table", + "html": "
caseR50→MV2R56→R20
baseline67.6570.66
L269.05 (+1.40)71.85 (+1.19)
SIFN69.32 (+1.67)72.13 (+1.47)
", + "image_path": "a7e3681dba933f070c44804e9a584079f0acb6380ad6203c511e8adce0613182.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 318, + 286, + 479, + 330 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 318, + 286, + 479, + 330 + ], + "spans": [ + { + "bbox": [ + 318, + 286, + 479, + 330 + ], + "type": "text", + "content": "(d) The proposed dino-loss can perfectly integrate the advantages of regularization feature norm and direction, and perform best." + } + ] + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 324, + 341, + 487, + 390 + ], + "blocks": [ + { + "bbox": [ + 324, + 341, + 487, + 390 + ], + "lines": [ + { + "bbox": [ + 324, + 341, + 487, + 390 + ], + "spans": [ + { + "bbox": [ + 324, + 341, + 487, + 390 + ], + "type": "table", + "html": "
caseR50→MV2R56→R20
CE + KL (baseline)67.6570.66
CE + dino68.78 (+1.13)71.96 (+1.30)
KL + dino68.68 (+1.03)72.04 (+1.38)
CE + KL + dino70.10 (+2.45)72.53 (+1.87)
", + "image_path": "25ac6699346a1673a166cfcac6b779138db42e2beab969319831b78ee262a98d.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 413, + 480, + 436 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 480, + 436 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 480, + 436 + ], + "type": "text", + "content": "is orthogonal to existing KD methods and can potentially serve as modules for searching, suggesting the novelty of our work." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 437, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 521 + ], + "type": "text", + "content": "COCO Object Detection. We verify the efficacy of the proposed dino-loss for knowledge distillation through the lens of object detection on the COCO dataset. Tab. 3 lists detailed results compared to prior works. Specifically, the ReviewKD++ yields a significant improvement in performance, outperforming state-of-the-art results with a remarkable margin. Moreover, this experiment and the above demonstrate the applicability of our dino-loss across tasks (i.e., image classification and object detection)." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 538, + 239, + 551 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 538, + 239, + 551 + ], + "spans": [ + { + "bbox": [ + 131, + 538, + 239, + 551 + ], + "type": "text", + "content": "4.3 Ablation Study" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 558, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 617 + ], + "type": "text", + "content": "In this subsection, we first conduct an ablation study on feature norm and direction regularization with the CIFAR-100 dataset. Subsequently, we perform a visual analysis of the impact before and after applying dino-loss. Finally, we conduct intriguing experiments on ImageNet to validate the benefits of using our approach that encourages learning large-norm features of the student model." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 618, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 618, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 618, + 482, + 666 + ], + "type": "text", + "content": "The effectiveness feature direction and norm regularization. Recall the baseline methods in Sec. 3.2 and 3.2 for feature direction and norm regularization. We present results for " + }, + { + "bbox": [ + 130, + 618, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 618, + 482, + 666 + ], + "type": "text", + "content": " (Eq. 3) and SIFN (Eq. 4) on CIFAR-100 in Tab. 4b. Yet additional offline experiments substantiate that SIFN outperforms" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 224, + 480, + 342 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 214 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 214 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 214 + ], + "type": "text", + "content": "Table 5: Comparison of using teacher's classifier weights (dubbed \"w/ weights\") versus per-class mean features (dubbed \"w/ class-mean\") in our dino-loss. We study them with the KD method [15] on CIFAR-100. Results show that using per-class mean features outperforms classifier weights. Moreover, we apply our dino-loss at more layers other than the penultimate layer (cf. the bottom row block). Here, layer-x means that the dino-loss is applied to all the x layers right before the penultimate layer. In particular, layer-0 means that the dino-loss is applied only at the penultimate layer (i.e., \"w/ class-mean\" in this table). Results show that applying dino-loss at other layers also leads to improvements but doing so at the penultimate layer achieves the best performance." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 224, + 480, + 342 + ], + "lines": [ + { + "bbox": [ + 132, + 224, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 480, + 342 + ], + "type": "table", + "html": "
MethodsHomogeneous architecturesHeterogeneous architectures
ResNet-56wide-ResNet-40-2ResNet-32×4ResNet-50ResNet-32×4ResNet-32×4
ResNet-20wide-ResNet-40-1ResNet-8×4MobileNet-V2ShuffleNet-V1ShuffleNet-V2
teacher72.3475.6179.4279.3479.4279.42
student69.0671.9872.5064.6070.5071.82
KD [15]70.6673.5473.3367.6574.0774.45
L2 ofcls weights70.5473.6173.7666.8173.6274.13
w/ weights71.7373.9775.0669.7675.2475.61
w/ class-mean72.5374.5975.5470.1075.4576.42
apply dino-loss to other layers
layer-171.3073.7474.2369.4475.0176.26
layer-271.9673.8174.1269.1075.7276.53
layer-371.1973.6173.9268.8774.9376.10
", + "image_path": "de55f35bdf412f1c5e9636ce45d821b59306e4ac22eced837e6eec27acb8672e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 371, + 481, + 419 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 371, + 481, + 419 + ], + "spans": [ + { + "bbox": [ + 130, + 371, + 481, + 419 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 371, + 481, + 419 + ], + "type": "text", + "content": " regularization in terms of performance and consistently affirm that large student feature norms encapsulate more teacher knowledge. Similarly, Tab. 4a shows superior gains of cosine similarity-based regularizer (Eq. 1) over InfoNCE (Eq. 2); both underscore the significance of feature direction regularization." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "content": "Our dino-loss yields better results. Tab. 4c shows that feature direction regularization (cosine, InfoNCE) and feature norm regularization " + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "inline_equation", + "content": "(\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "content": ", SIFN) improve KD. While combining them helps KD (e.g., cosine + " + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_2" + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "content": ", cosine + SIFN), our dino-loss performs the best at " + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "inline_equation", + "content": "70.10\\%" + }, + { + "bbox": [ + 130, + 422, + 482, + 482 + ], + "type": "text", + "content": " accuracy (Tab. 4d). This convincingly shows the superiority of our dino-loss over others." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": "Class-mean vs. classifier weights in regularizing student feature direction. We perform a quantitative analysis of using the teacher's classifier weights and per-class feature mean to regularize student's features. We adopt the classifier weights that are derived from teacher as centers in our dino-loss to train student models (dubbed \"w/ weights\"). In comparison, we utilize per-class feature means, denoted as \"w/ class-mean\" (which is our proposed method). The results in Tab. 5 clearly demonstrate that the utilization of per-class feature mean performs better than the method of using teacher's classifier weights for feature direction regularization. Additionally, we have implemented an alternative approach that employs an L2 loss to guide the student to output classifier weights similar to those of the teacher (referred to as \"L2 of cls weight\"). However, this approach consistently underperforms our \"w/ class-mean\" method and even lags behind the baseline KD method [15] in most experimental settings. These findings provide strong evidence for the superiority of employing class-mean features over the teacher's classifier weights." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 218, + 194 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 218, + 194 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 218, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 218, + 194 + ], + "type": "image", + "image_path": "14c4506ec9823b1b3a6b6387342c6763f68c5d2ab1e12efefd22130c976e5e95.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 154, + 196, + 196, + 205 + ], + "lines": [ + { + "bbox": [ + 154, + 196, + 196, + 205 + ], + "spans": [ + { + "bbox": [ + 154, + 196, + 196, + 205 + ], + "type": "text", + "content": "(a) teacher" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 221, + 114, + 304, + 194 + ], + "blocks": [ + { + "bbox": [ + 221, + 114, + 304, + 194 + ], + "lines": [ + { + "bbox": [ + 221, + 114, + 304, + 194 + ], + "spans": [ + { + "bbox": [ + 221, + 114, + 304, + 194 + ], + "type": "image", + "image_path": "556ddce9117ef3695e31dd7644d08198cb8dd87924059aca1dc7074a635879ee.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 223, + 196, + 302, + 205 + ], + "lines": [ + { + "bbox": [ + 223, + 196, + 302, + 205 + ], + "spans": [ + { + "bbox": [ + 223, + 196, + 302, + 205 + ], + "type": "text", + "content": "(b) naive small model" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 310, + 114, + 391, + 194 + ], + "blocks": [ + { + "bbox": [ + 310, + 114, + 391, + 194 + ], + "lines": [ + { + "bbox": [ + 310, + 114, + 391, + 194 + ], + "spans": [ + { + "bbox": [ + 310, + 114, + 391, + 194 + ], + "type": "image", + "image_path": "e6b8213c397e71e940ddb344b8f912534dc964a3852049e4d4a735be37b3d700.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 317, + 196, + 383, + 205 + ], + "lines": [ + { + "bbox": [ + 317, + 196, + 383, + 205 + ], + "spans": [ + { + "bbox": [ + 317, + 196, + 383, + 205 + ], + "type": "text", + "content": "(c) student by KD" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 214, + 482, + 314 + ], + "lines": [ + { + "bbox": [ + 130, + 214, + 482, + 314 + ], + "spans": [ + { + "bbox": [ + 130, + 214, + 482, + 314 + ], + "type": "text", + "content": "Fig. 4: Visualization of 2D embedding features. (a) Features computed by teacher (ResNet-50) are well separated at class label; note the purple class pointed by red arrow. (b) A small-capacity model (ResNet-18) fails to separate this purple class, which is occluded by others. (c) Even using KD [15] to train ResNet-18 student cannot reveal this purple class. (d) Using our dino-loss along with KD, i.e., " + }, + { + "bbox": [ + 130, + 214, + 482, + 314 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 214, + 482, + 314 + ], + "type": "text", + "content": ", achieves better separation of the points and reveals purple class. This attributes to the feature direction regularization using teacher class-means. Moreover, student features in (d) have larger-norms than the teacher in (a) because our dino-loss explicitly encourages learning large-norm features of the student." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 397, + 115, + 480, + 194 + ], + "blocks": [ + { + "bbox": [ + 397, + 115, + 480, + 194 + ], + "lines": [ + { + "bbox": [ + 397, + 115, + 480, + 194 + ], + "spans": [ + { + "bbox": [ + 397, + 115, + 480, + 194 + ], + "type": "image", + "image_path": "acdd697d656102cb01277422379fc0e1d9365fc2061e9aceb74e305b64732d32.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 397, + 196, + 478, + 205 + ], + "lines": [ + { + "bbox": [ + 397, + 196, + 478, + 205 + ], + "spans": [ + { + "bbox": [ + 397, + 196, + 478, + 205 + ], + "type": "text", + "content": "(d) student by " + }, + { + "bbox": [ + 397, + 196, + 478, + 205 + ], + "type": "inline_equation", + "content": "\\mathrm{KD} + +" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 339, + 482, + 399 + ], + "type": "text", + "content": "Applying the dino-loss to other layers. In the above experiment, we apply the dino-loss to the penultimate layer only. Here, we study applying it to other layers and evaluate on CIFAR-100 in bottom of Tab. 5. Results show that our dino-loss applied at other layers also improves over the baseline KD but performs the best when applied at the penultimate layer." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "text", + "content": " is a strong baseline. Tab. 4d illustrates the impacts of different losses in KD. By incorporating dino-loss into conventional KD framework [15], " + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "text", + "content": " (i.e., " + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "inline_equation", + "content": "\\mathrm{CE} + \\mathrm{KL} + \\mathrm{dino}" + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "text", + "content": ") achieves a significant improvement: KD " + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "inline_equation", + "content": "(67.65\\%) \\rightarrow \\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "inline_equation", + "content": "(70.10\\%)" + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "text", + "content": ". Further, combining dino-loss with CE or KL can also boost the accuracy by " + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "inline_equation", + "content": "\\sim 1\\%" + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "text", + "content": " compared to the original KD method. It is worth noting that " + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 399, + 483, + 483 + ], + "type": "text", + "content": " introduces no additional parameters and negligible computation overhead, making it a strong baseline for KD (cf. more results in Tab. 1, 2, & 3)." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "text", + "content": "In addition, following [37], we visually examine the student feature in Fig. 4. First, as indicated in Fig. 4d, " + }, + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "text", + "content": " demonstrates notably amplified feature norms, surpassing even those of the teacher depicted in Fig. 4a. Furthermore, the direction in " + }, + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "text", + "content": " align well with the teacher (Fig. 4a vs. Fig. 4d, thereby maintaining consistent relative margins among categories. Another observation is that both the naive student (Fig. 4b) and the conventional KD (Fig. 4c) exhibit direct failures in classifying the purple category, whereas our approach, " + }, + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 484, + 482, + 579 + ], + "type": "text", + "content": " (Fig. 4d), effectively learns student features that can discriminate all classes." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 581, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 628 + ], + "type": "text", + "content": "The benefit from larger teacher models. Now we investigate whether our approach exhibits monotonically incremental performance gains when exploiting a larger teacher. We first examine the classic KD [15] framework, and two other recently proposed methods, namely ReviewKD [4] and DKD [48]." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "As shown in Fig. 5, it is clear that for KD [15], DKD [48] and ReviewKD [4] show a degradation or fluctuation when scaling up the teacher from ResNet-34 to ResNet-152, with ResNet-18 as student. The main obstacle is the huge capacity" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 114, + 243, + 198 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 243, + 198 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 243, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 243, + 198 + ], + "type": "image", + "image_path": "b3369adbd20a647a6fd1ee5e8b1f6307b697a6a36aeabe6f0d904ebef93c39b0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "text", + "content": "Fig. 5: Using our dino-loss can benefit from larger teacher models. The student is ResNet-18, with scaling up the teacher from ResNet-34 to ResNet-152 (denoted in the " + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "text", + "content": "-axis). We report the top-1 accuracy (\\%) on the ImageNet validation set. All results are the average accuracy over five runs. With the teacher capacity increasing, our methods, " + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "inline_equation", + "content": "\\mathrm{DKD}++" + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "inline_equation", + "content": "\\mathrm{ReviewKD}++" + }, + { + "bbox": [ + 130, + 205, + 482, + 282 + ], + "type": "text", + "content": " (red) achieve better knowledge distillation results, even though the original distillation methods (blue) suffer from performance degradation with large teacher models (e.g., ResNet-152)." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 250, + 114, + 361, + 198 + ], + "blocks": [ + { + "bbox": [ + 250, + 114, + 361, + 198 + ], + "lines": [ + { + "bbox": [ + 250, + 114, + 361, + 198 + ], + "spans": [ + { + "bbox": [ + 250, + 114, + 361, + 198 + ], + "type": "image", + "image_path": "1e1d6fa1f4a687f270ed3d9c153330126c508371470a3e8b5aa9c15c1d32450b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 367, + 114, + 479, + 198 + ], + "blocks": [ + { + "bbox": [ + 367, + 114, + 479, + 198 + ], + "lines": [ + { + "bbox": [ + 367, + 114, + 479, + 198 + ], + "spans": [ + { + "bbox": [ + 367, + 114, + 479, + 198 + ], + "type": "image", + "image_path": "d6ea9f25c56200a33d20072bf6356b0d1c3e5f495ba481242a670ba8cd421845.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 132, + 358, + 479, + 394 + ], + "blocks": [ + { + "bbox": [ + 130, + 293, + 482, + 350 + ], + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 350 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 350 + ], + "type": "text", + "content": "Table 6: A larger student gets better knowledge distillation performance. The teacher is ResNet-152 (top-1 acc, " + }, + { + "bbox": [ + 130, + 293, + 482, + 350 + ], + "type": "inline_equation", + "content": "78.31\\%" + }, + { + "bbox": [ + 130, + 293, + 482, + 350 + ], + "type": "text", + "content": "). We report the top-1 accuracy (\\%) on the ImageNet validation set. Model marked with " + }, + { + "bbox": [ + 130, + 293, + 482, + 350 + ], + "type": "inline_equation", + "content": "\\dagger" + }, + { + "bbox": [ + 130, + 293, + 482, + 350 + ], + "type": "text", + "content": " adopts a stronger recipe [11]. Results show that our dino-loss achieves consistent improvement, outperforming the model trained from scratch (cf. the first row)." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 358, + 479, + 394 + ], + "lines": [ + { + "bbox": [ + 132, + 358, + 479, + 394 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 479, + 394 + ], + "type": "table", + "html": "
studentResNet-18ResNet-34ResNet-50ResNet-101ViT-SViT-BViT-B†
trained from scratch69.7673.3176.1677.3774.6478.0081.80
KD [15]70.6674.8476.9378.0475.7778.5182.39
KD++71.98 (+1.32)75.53 (+0.69)77.48 (+0.55)79.15 (+1.11)76.53 (+0.76)79.85 (+1.34)82.92 (+0.53)
", + "image_path": "b9d3eb72ad423f680a6393c6759e718d51cb6116ed078adff51a62a771699061.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 416, + 480, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 416, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 416, + 480, + 475 + ], + "type": "text", + "content": "gap between student and teacher [1,16,34]. Surprisingly, upon incorporating our dino-loss, distillation methods yield significant improvements compared to the original methods (e.g., " + }, + { + "bbox": [ + 130, + 416, + 480, + 475 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 416, + 480, + 475 + ], + "type": "text", + "content": " vs. KD, ReviewKD++ vs. ReviewKD). More importantly, they show a consistent improvement with scaling up the teacher size (e.g., " + }, + { + "bbox": [ + 130, + 416, + 480, + 475 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++: 71.99\\% \\rightarrow 72.49\\% \\rightarrow 72.54\\% \\rightarrow 72.59\\%" + }, + { + "bbox": [ + 130, + 416, + 480, + 475 + ], + "type": "text", + "content": ")." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 476, + 481, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 476, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 476, + 481, + 525 + ], + "type": "text", + "content": "The benefit from larger student models. We use " + }, + { + "bbox": [ + 130, + 476, + 481, + 525 + ], + "type": "inline_equation", + "content": "\\mathrm{KD}++" + }, + { + "bbox": [ + 130, + 476, + 481, + 525 + ], + "type": "text", + "content": " to study the effect of increasing the size of the student for knowledge distillation, and set the teacher as ResNet-152. The results in Tab. 6 demonstrate that increasing the capacity of the student significantly improves distillation results." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 543, + 311, + 555 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 543, + 311, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 543, + 311, + 555 + ], + "type": "text", + "content": "5 Discussion and Conclusion" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 568, + 481, + 603 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 568, + 481, + 603 + ], + "spans": [ + { + "bbox": [ + 130, + 568, + 481, + 603 + ], + "type": "text", + "content": "Broader Impacts As our work falls in the area of knowledge distillation, we do not see any new potential societal impacts other than those already known, e.g., student models might learn bias and unfairness delivered by the teacher." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 604, + 481, + 652 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 604, + 481, + 652 + ], + "spans": [ + { + "bbox": [ + 130, + 604, + 481, + 652 + ], + "type": "text", + "content": "Conclusion. We study feature regularization w.r.t norm and direction when training student models for better knowledge distillation (KD). Indeed, sufficient experiments and ablation studies demonstrate that doing so with our proposed dino-loss helps existing KD methods to achieve better performance." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 212 + ], + "type": "text", + "content": "The authors would like to thank the anonymous reviewers for their valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China (U22A2032), by the Zhejiang Provincial Science and Technology Plan Project (2024SSYS0013), and in part by the National Natural Science Foundation of China under Grant No. (62106235). Shu Kong acknowledges the support by the University of Macau (SRG2023-00044-FST)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 197, + 240 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 251, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 251, + 481, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 481, + 285 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 481, + 285 + ], + "type": "text", + "content": "1. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10925-10934 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 285, + 481, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 481, + 317 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 481, + 317 + ], + "type": "text", + "content": "2. Cao, W., Zhang, Y., Gao, J., Cheng, A., Cheng, K., Cheng, J.: Pkd: General distillation framework for object detectors via pearson correlation coefficient. Advances in Neural Information Processing Systems 35, 15394-15406 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 318, + 481, + 350 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 318, + 481, + 350 + ], + "spans": [ + { + "bbox": [ + 138, + 318, + 481, + 350 + ], + "type": "text", + "content": "3. Chen, D., Mei, J.P., Zhang, H., Wang, C., Feng, Y., Chen, C.: Knowledge distillation with the reused teacher classifier. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11933-11942 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 350, + 481, + 382 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 350, + 481, + 382 + ], + "spans": [ + { + "bbox": [ + 138, + 350, + 481, + 382 + ], + "type": "text", + "content": "4. Chen, P., Liu, S., Zhao, H., Jia, J.: Distilling knowledge via knowledge review. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5008-5017 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 383, + 481, + 415 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 383, + 481, + 415 + ], + "spans": [ + { + "bbox": [ + 138, + 383, + 481, + 415 + ], + "type": "text", + "content": "5. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 248-255 (2009)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 416, + 481, + 448 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 416, + 481, + 448 + ], + "spans": [ + { + "bbox": [ + 138, + 416, + 481, + 448 + ], + "type": "text", + "content": "6. Donahue, J., Jia, Y., Vinyals, O., Hoffman, J., Zhang, N., Tzeng, E., Darrell, T.: Decaf: A deep convolutional activation feature for generic visual recognition. In: International conference on machine learning. pp. 647-655. PMLR (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 449, + 481, + 480 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 481, + 480 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 481, + 480 + ], + "type": "text", + "content": "7. Dong, P., Li, L., Wei, Z.: Diswot: Student architecture search for distillation without training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11898-11908 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 481, + 481, + 503 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 481, + 481, + 503 + ], + "spans": [ + { + "bbox": [ + 138, + 481, + 481, + 503 + ], + "type": "text", + "content": "8. Guo, J., Chen, M., Zhao, Y., Pan, B., Zhu, C., Hu, Y., Wang, H., He, X., Cai, D.: Reducing the capacity gap via spherical knowledge distillation (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 503, + 481, + 534 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 503, + 481, + 534 + ], + "spans": [ + { + "bbox": [ + 138, + 503, + 481, + 534 + ], + "type": "text", + "content": "9. Guo, Z., Yan, H., Li, H., Lin, X.: Class attention transfer based knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11868-11877 (June 2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 535, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 535, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 535, + 481, + 567 + ], + "type": "text", + "content": "0. Han, S., Mao, H., Dally, W.J.: Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 568, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 568, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 568, + 481, + 600 + ], + "type": "text", + "content": "1. He, K., Chen, X., Xie, S., Li, Y., Dólar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 601, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 481, + 632 + ], + "type": "text", + "content": "2. He, K., Zhang, X., Ren, S., Sun, J.: Delving deep into rectifiers: Surpassing human-level performance on imagenet classification. In: Proceedings of the IEEE international conference on computer vision. pp. 1026-1034 (2015)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 633, + 481, + 665 + ], + "type": "text", + "content": "3. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "14. Heo, B., Kim, J., Yun, S., Park, H., Kwak, N., Choi, J.Y.: A comprehensive overhaul of feature distillation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1921-1930 (2019)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 172 + ], + "type": "text", + "content": "15. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 194 + ], + "type": "text", + "content": "16. Huang, T., You, S., Wang, F., Qian, C., Xu, C.: Knowledge distillation from a stronger teacher. arXiv preprint arXiv:2205.10536 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 481, + 226 + ], + "type": "text", + "content": "17. Kong, S., Ramanan, D.: Opengan: Open-set recognition via open data generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 813-822 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 227, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 248 + ], + "type": "text", + "content": "18. Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 481, + 282 + ], + "type": "text", + "content": "19. Li, L., Dong, P., Li, A., Wei, Z., Ya, Y.: Kd-zero: Evolving knowledge distiller for any teacher-student pairs. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 282, + 481, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 481, + 315 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 481, + 315 + ], + "type": "text", + "content": "20. Li, L., Dong, P., Wei, Z., Yang, Y.: Automated knowledge distillation via monte carlo tree search. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 17413-17424 (October 2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 315, + 481, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 347 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 347 + ], + "type": "text", + "content": "21. Lin, T.Y., Dólar, P., Girshick, R., He, K., Hariharan, B., Belongie, S.: Feature pyramid networks for object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2117-2125 (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 347, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 392 + ], + "type": "text", + "content": "22. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 424 + ], + "type": "text", + "content": "23. Ma, N., Zhang, X., Zheng, H.T., Sun, J.: Shufflenet v2: Practical guidelines for efficient cnn architecture design. In: Proceedings of the European conference on computer vision (ECCV). pp. 116-131 (2018)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 424, + 481, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 446 + ], + "type": "text", + "content": "24. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 479 + ], + "type": "text", + "content": "25. Park, W., Kim, D., Lu, Y., Cho, M.: Relational knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3967-3976 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 512 + ], + "type": "text", + "content": "26. Passalis, N., Tefas, A.: Learning deep representations with probabilistic knowledge transfer. In: Proceedings of the European Conference on Computer Vision (ECCV). pp. 268-284 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 481, + 533 + ], + "type": "text", + "content": "27. Passalis, N., Tefas, A.: Probabilistic knowledge transfer for deep representation learning. CoRR, abs/1803.10837 1(2), 5 (2018)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 534, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 578 + ], + "type": "text", + "content": "28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 578, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 481, + 610 + ], + "type": "text", + "content": "29. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. Advances in neural information processing systems 28 (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 611, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 481, + 632 + ], + "type": "text", + "content": "30. Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550 (2014)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "31. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International journal of computer vision 115, 211-252 (2015)" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "Y. Wang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 643 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "32. Sandler, M., Howard, A., Zhu, M., Zhmoginov, A., Chen, L.C.: Mobilenetv2: Inverted residuals and linear bottlenecks. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4510-4520 (2018)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "text", + "content": "33. Sharif Razavian, A., Azizpour, H., Sullivan, J., Carlsson, S.: Cnn features off-the-shelf: an astounding baseline for recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 806-813 (2014)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 183, + 482, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 482, + 205 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 482, + 205 + ], + "type": "text", + "content": "34. Tian, Y., Krishnan, D., Isola, P.: Contrastive representation distillation. arXiv preprint arXiv:1910.10699 (2019)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 205, + 482, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 237 + ], + "type": "text", + "content": "35. Wang, G.H., Ge, Y., Wu, J.: Distilling knowledge by mimicking features. IEEE Transactions on Pattern Analysis and Machine Intelligence 44(11), 8183-8195 (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 237, + 482, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 237, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 482, + 270 + ], + "type": "text", + "content": "36. Wang, T., Yuan, L., Zhang, X., Feng, J.: Distilling object detectors with fine-grained feature imitation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4933-4942 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 270, + 482, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 314 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 314 + ], + "type": "text", + "content": "37. Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part VII 14. pp. 499-515. Springer (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 314, + 482, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 336 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 336 + ], + "type": "text", + "content": "38. Wightman, R.: Pytorch image models. https://github.com/rwrightman/pytorch-image-models (2019). https://doi.org/10.5281/zenodo.4414861" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 336, + 482, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 336, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 336, + 482, + 369 + ], + "type": "text", + "content": "39. Xu, K., Rui, L., Li, Y., Gu, L.: Feature normalized knowledge distillation for image classification. In: European conference on computer vision. pp. 664-680. Springer (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 369, + 482, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 402 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 402 + ], + "type": "text", + "content": "40. Xu, R., Li, G., Yang, J., Lin, L.: Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1426-1435 (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 402, + 482, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 435 + ], + "type": "text", + "content": "41. Yang, C., Zhou, H., An, Z., Jiang, X., Xu, Y., Zhang, Q.: Cross-image relational knowledge distillation for semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12319-12328 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "type": "text", + "content": "42. Yang, J., Martinez, B., Bulat, A., Tzimiropoulos, G., et al.: Knowledge distillation via softmax regression representation learning. International Conference on Learning Representations (ICLR) (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 468, + 482, + 491 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 491 + ], + "type": "text", + "content": "43. Yang, Z., Li, Z., Shao, M., Shi, D., Yuan, Z., Yuan, C.: Masked generative distillation. In: European Conference on Computer Vision. pp. 53-69. Springer (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 491, + 482, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 482, + 522 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 482, + 522 + ], + "type": "text", + "content": "44. Ye, J., Lu, X., Lin, Z., Wang, J.Z.: Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers. arXiv preprint arXiv:1802.00124 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 522, + 482, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 555 + ], + "type": "text", + "content": "45. Yim, J., Joo, D., Bae, J., Kim, J.: A gift from knowledge distillation: Fast optimization, network minimization and transfer learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4133-4141 (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 555, + 482, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 588 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 588 + ], + "type": "text", + "content": "46. Zagoruyko, S., Komodakis, N.: Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. arXiv preprint arXiv:1612.03928 (2016)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 588, + 482, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 588, + 482, + 610 + ], + "spans": [ + { + "bbox": [ + 130, + 588, + 482, + 610 + ], + "type": "text", + "content": "47. Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 610, + 482, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 610, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 610, + 482, + 643 + ], + "type": "text", + "content": "48. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11953-11962 (2022)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 200, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving KD via Regularizing Feature Direction and Norm" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_content_list.json b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..3492bfab39b30ab20891b637a8742b26ddcbce27 --- /dev/null +++ b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_content_list.json @@ -0,0 +1,1630 @@ +[ + { + "type": "text", + "text": "Improving Medical Multi-modal Contrastive Learning with Expert Annotations", + "text_level": 1, + "bbox": [ + 248, + 140, + 754, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yogesh Kumar and Pekka Marttinen", + "bbox": [ + 357, + 212, + 645, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Department of Computer Science, Aalto University, Finland {firstname_lastname}@aalto.fi", + "bbox": [ + 300, + 239, + 700, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. We introduce eCLIP, an enhanced version of the CLIP model that integrates expert annotations in the form of radiologist eye-gaze heatmaps. It tackles key challenges in contrastive multi-modal medical imaging analysis, notably data scarcity and the \"modality gap\" - a significant disparity between image and text embeddings that diminishes the quality of representations and hampers cross-modal interoperability. eCLIP integrates a heatmap processor and leverages mixup augmentation to efficiently utilize the scarce expert annotations, thus boosting the model's learning effectiveness. eCLIP is designed to be generally applicable to any variant of CLIP without requiring any modifications of the core architecture. Through detailed evaluations across several tasks, including zero-shot inference, linear probing, cross-modal retrieval, and Retrieval Augmented Generation (RAG) of radiology reports using a frozen Large Language Model, eCLIP showcases consistent improvements in embedding quality. The outcomes reveal enhanced alignment and uniformity, affirming eCLIP's capability to harness high-quality annotations for enriched multi-modal analysis in the medical imaging domain.", + "bbox": [ + 261, + 306, + 743, + 542 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Contrastive Learning $\\cdot$ Medical Imaging $\\cdot$ Zero-shot Inference", + "bbox": [ + 259, + 556, + 740, + 583 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 611, + 375, + 627 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Pretraining foundation models on multi-modal data - particularly leveraging the relationships between text and images - has proven to be a robust strategy for generating versatile embeddings [18,36]. These embeddings enhance the efficacy in several downstream tasks, from image generation to advanced vision-language integration [26, 37, 40]. Central to this approach is the employment of a contrastive learning (CL) loss objective [4, 34, 61], where models are trained to align positive pairs (e.g., an image and its corresponding caption) while diversifying negative ones. A significant hurdle in this approach is the necessity of vast datasets, often comprising several millions of data points, for competitive results. Models such as CLIP [36] have been trained on internet-scale datasets, estimated to encompass hundreds of millions of image-text pairs [5, 57]. Acquiring datasets of this magnitude poses substantial challenges in specialized fields that require expert knowledge for data collection, processing and annotation.", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/0014a845aec8b23c4efaad74333aaca295140fadad83b26235d68f7c1423d08b.jpg", + "image_caption": [ + "Fig. 1: Analysis of CLIP Embeddings in Medical Imaging The figure presents embeddings generated by a CLIP model, pretrained on an internet-scale dataset, applied to the Open-I dataset pairing X-rays with corresponding radiology reports." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 781, + 354 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The medical imaging domain exemplifies these difficulties, where acquiring even a single data point, such as a chest X-ray, involves complex processes requiring expertise and significant resources. Moreover, the procurement of such data for machine learning research is further complicated by ethical considerations, patient privacy concerns and the need for extensive de-identification procedures.", + "bbox": [ + 212, + 441, + 782, + 517 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This has led to the prevalent use of foundation models, initialized with weights from models trained on extensive internet-scale datasets, for tasks in the medical domain [15,23,54,65]. However, the areas of interest within medical images are often nuanced and require expert knowledge to interpret, rendering them indistinguishable to a general-purpose model. In Fig. 1a, we investigate the embeddings generated by a CLIP model – initially pretrained on internet data – using samples from the Open-I dataset [6], which includes X-rays and corresponding radiology reports. We categorize the samples into subgroups based on the primary abnormality identified in each report, such as 'normal', cardiomegaly, atelectasis and opacity. A histogram of the cosine similarities between embeddings from different groups indicates a high degree of similarity, with values approaching 1. This could lead to potential challenges in downstream zero-shot inference tasks, which rely on the spatial segregation of embeddings from different groups [36]. Typically, continual pretraining on medically relevant data is employed to enhance the model's ability to differentiate between various abnormalities.", + "bbox": [ + 212, + 518, + 787, + 760 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Recent studies [11, 25, 33, 46, 67] have identified a \"modality gap\" in multimodal contrastive representation learning, where the embeddings from different modalities (e.g., images and text) fall in distinct regions in the shared embedding space. This separation, which arises from factors such as initial model weights and the objectives of contrastive learning [25, 67], leads to the \"cone effect\" where", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/440f70b30b3b150fa536e456fd430454245f6df8c8eb23d5dd7fb5a74221e0f2.jpg", + "image_caption": [ + "Fig. 2: eCLIP Pretraining with Expert Annotations. eCLIP adds a Heatmap Processor (right), featuring a multi-headed attention layer, to the standard Image and Text encoders in CLIP. This processor, along with vision and text encoders, maps inputs into a shared hypersphere. Here, the original image $(I_i)$ , its text $(T_i)$ and the heatmap-processed image $(I_i^E)$ are positioned within a tripartite area (shown here after 2D UMAP projection, please refer to the Supplement for a scaled version). We employ mixup between $I_i$ and $I_i^E$ to generate the embedding $v_i^\\lambda$ , which gives us additional positive pairs to enhance the CLIP InfoNCE loss optimization. An auxiliary loss, $\\mathcal{L}_{\\mathrm{priming}}$ , is used during the initial training steps to \"prime\" the heatmap processor to imitate an identity function when the heatmap is composed of all ones." + ], + "image_footnote": [], + "bbox": [ + 232, + 146, + 777, + 324 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "embeddings of each modality are restricted to a narrow region of the embedding hypersphere. In Fig. 1b, we illustrate this within the medical domain with a 2D UMAP [27] projection of image and text embeddings. This example highlights how embeddings from the same modality but different semantic groups, such as X-ray images of varying abnormalities, cluster closely together. This makes it difficult for a model to distinguish between semantically different images, undermining its performance in medical image analysis.", + "bbox": [ + 212, + 507, + 787, + 612 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We investigate the potential of integrating expert annotations, specifically radiologist eye-gaze heatmaps, to alleviate these issues. Processing the eye-gaze data from radiologists [22] provides us with heatmaps indicative of the radiologist's attention across different regions of the X-ray images. This heatmap reflects areas of clinical interest aligned with details present in radiology reports. We posit that this could help capture nuanced visual cues in the X-rays and therefore pairing it with reports can enrich the CLIP training data with high-quality positive pairs. Due to the scarcity of such expert annotated data, we employ the mixup strategy, a data augmentation technique which has been effective in both supervised [13,48,62] and contrastive learning [33,49], to create additional synthetic samples.", + "bbox": [ + 212, + 613, + 787, + 779 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We present eCLIP (expert-annotated CLIP), an adaptation of the CLIP model that incorporates expert eye-gaze heatmaps, without modifying the CLIP model's core architecture. The operational workflow of eCLIP is depicted in Fig. 2. Our contributions are as follows:", + "bbox": [ + 212, + 779, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Utilization of Expert Annotations. We harness radiologist eye-gaze heatmaps to create additional embeddings, effectively introducing valuable positive and negative pairs for enhancing the contrastive learning process.", + "- eCLIP Architecture. Our implementation features a heatmap processing mechanism utilizing multi-headed attention (MHA), optimized for handling both heatmaps and original images. This is complemented by a mixup strategy to addresses the challenge of data scarcity, and curriculum learning to ensure a gradual introduction of expert annotations.", + "- Comprehensive Evaluation. We assess eCLIP's zero-shot classification accuracy, sample efficiency and cross-modal retrieval performance and embedding quality across multiple chest X-ray datasets. We also evaluate the cross-modal embeddings to generate radiology reports using a frozen Large Language Model (LLM) without explicitly fine-tuning on medical data." + ], + "bbox": [ + 223, + 146, + 785, + 343 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 368, + 387, + 383 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Modality Gap: Liang et al. [25] pinpoint the origins of the modality gap to the nuances of model initialization and the objectives of contrastive learning, underscoring its impact on downstream tasks and fairness. Oh et al. [33] highlight poor uniformity and alignment in CLIP's embeddings and propose a finetuning method for robust representations. Zhang et al. [67] explore the geometry of this embedding space, and provide both theoretical and empirical insights on the nature of this geometry. Subsequent research has produced methods to mitigate the modality gap through diverse and creative approaches [11, 12, 32, 46, 66].", + "bbox": [ + 212, + 400, + 785, + 521 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Improving Contrastive Learning: Several methods have improved upon the CLIP objective by introducing auxiliary losses, e.g., SLIP [30] uses SimCLR [4] loss, M3MAE [10,55] augment the Masked Autoencoder [14] reconstruction loss, FLIP [24] randomly masks out input images to improve scaling, DACL [49] proposes a domain agnostic mixup strategy, SILC [31] uses self-distillation, Mo et al. [28] utilized specialist captions to generate pseudo labels for unpaired images, Zhang et al. [63] propose Multi-task Paired Masking with Alignment to improve cross-modal interaction. Similarly there have been works that have identified the need to make the CLIP model focus on sub-regions in order to enhance its utility and downstream performance, GLoRIA [15] considers the loss from local regions from within the image and reports, Alpha-CLIP [45] uses the alpha channel to guide the CLIP model to focus on different regions of the image and generate the masks for all the images in the corpus using an image segmentation pipeline and TIER [35] uses a regularization term to improve the local focus of the model.", + "bbox": [ + 212, + 523, + 785, + 747 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Multi-modal Contrastive Learning in Medical Imaging: Zhang et al. [65] demonstrated enhanced downstream performance by jointly using chest X-ray and report pairing for training a contrastive learning model. This was further improved by Huang et al. [15], by exploiting local and global features from both modalities; Wang et al. [54] and You et al. [59] achieved impressive results by using a Swin Tiny model as the image encoder and by adding modifications", + "bbox": [ + 212, + 750, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "to the contrastive loss. Several other works have developed similar contrastive learning foundation models while utilizing the biomedical image texts to achieve impressive results [16, 29, 44, 47, 56, 58]. Karargyris et al. [22] and Bigolin et al. [3] augment a subset of the MIMIC-CXR [21] samples with high quality eye-tracking and verbal transcripts from several radiologists. van Sonsbeek et al. [43] and Wang et al. [50] utilize the heatmaps from eye-gaze to improve image classification.", + "bbox": [ + 214, + 146, + 787, + 252 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 273, + 330, + 287 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Notations. For a given chest X-ray image $I_{i}$ and its radiology report $T_{i}$ , indexed by $i$ in our dataset, we denote their L2-normalized embeddings as $v_{i}$ and $t_i$ respectively, residing in a d-dimensional space $(v_{i},t_{i}\\in \\mathcal{R}^{d})$ . Image embeddings are obtained through an encoder $v_{i} = f(I_{i})$ and text embeddings via $t_i = g(T_i)$ . Applying an expert heatmap $E_{i}$ to an image results in the corresponding image embedding $v_{i}^{E}$ . We denote the loss value for the $i$ -th sample as $\\mathcal{L}_i$ . For the case of contrastive loss, this is computed in terms of some similarity measure between the embeddings, $sim(v_{i},t_{i})$ , typically cosine similarity defined as $v_{i}\\cdot t_{i}$ .", + "bbox": [ + 214, + 301, + 787, + 426 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Background", + "text_level": 1, + "bbox": [ + 215, + 443, + 361, + 458 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Central to CLIP's effectiveness is the InfoNCE loss [34], a mechanism engineered to optimize the similarity measures between corresponding (positive) pairs and to minimize those among non-corresponding (negative) pairs. The formulation of the CLIP loss objective is as follows:", + "bbox": [ + 214, + 465, + 787, + 527 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {t e x t}} = \\underset {(t _ {i}, v _ {i}) \\sim p o s} {\\mathbb {E}} \\left[ - \\log \\frac {\\exp (s i m (t _ {i} , v _ {i}) / \\tau)}{\\exp (s i m (t _ {i} , v _ {i}) / \\tau) + \\sum_ {j \\neq i} \\exp (s i m (t _ {i} , v _ {j}) / \\tau)} \\right] \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 235, + 546, + 785, + 588 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Total loss is then defined as, $\\mathcal{L}_{\\mathrm{total}} = \\frac{1}{2}\\left(\\mathcal{L}_{\\mathrm{text}} + \\mathcal{L}_{\\mathrm{image}}\\right)$ , where $\\mathcal{L}_{\\mathrm{image}}$ denotes the corresponding loss for the image to text mapping. Here, $\\tau$ represents the temperature parameter that controls the scale of the similarity scores, typically framed as a learnable parameter during training. The loss expectation is taken over all the positive pairings in the dataset.", + "bbox": [ + 214, + 595, + 787, + 672 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theoretical results on CL indicate the concepts of alignment and uniformity as critical for the quality of embeddings [51, 52]. Alignment focuses on reducing the distance between positive pairs while uniformity seeks to evenly distribute the embeddings across the unit hypersphere, preventing extreme clustering that could impair the model's generalizability and discriminative capabilities. The alignment and uniformity can be defined formally as follows [33]:", + "bbox": [ + 214, + 672, + 787, + 765 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\text {A l i g n m e n t} = - \\mathbb {E} _ {\\left(v _ {i}, t _ {i}\\right) \\sim p o s} \\left[ \\| v _ {i} - t _ {i} \\| _ {2} ^ {2} - \\min _ {j \\neq i} \\| v _ {i} - t _ {j} \\| _ {2} ^ {2} \\right] \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 303, + 782, + 785, + 816 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathrm {U n i f o r m i t y} = - \\log \\mathbb {E} _ {(v _ {i}, t _ {j}) \\sim \\mathcal {D}} \\left[ \\exp (- 2 \\| v _ {i} - t _ {j} \\| _ {2} ^ {2}) \\right] \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 303, + 818, + 785, + 838 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/199377f11c57e7f243444a20b6fd69d54cb619bdc3ec24ef532fc946ed837fab.jpg", + "image_caption": [ + "Fig. 3: Comparing eCLIP with $m^2$ -mixup [33]. (left) Standard CLIP showing image-text positive pairs $(v_i, t_i)$ (solid line), while the other image embeddings serve as negative pairs (dashed line). (center) the $m^2$ -mixup creates negative pairs $(v_j^\\lambda, t_i)$ via interpolation between embeddings along the geodesic. (right) eCLIP adds expert image embedding, $v_i^E$ , in addition to $v_i$ for text $t_i$ , forming additional positive and negative pairs" + ], + "image_footnote": [], + "bbox": [ + 289, + 148, + 411, + 251 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/3b72a706562807f42f35658b6c5aefa4a27f5860eefc26b25355e6a92647109c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 429, + 150, + 552, + 252 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/f15e63f971990328f480afb83d774722c7e20064b72c8e09e5b137f2db4e57c0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 575, + 148, + 694, + 252 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "High intra-modal similarity, e.g. between two images as seen in Fig. 1, can inadvertently enhance similarity among negative pairs, inflating the denominator of the loss function in Equation (1), and, consequently, hurting the model's ability to differentiate between positive and negative pairs during training. A conventional method to counter this involves incorporating hard negative pairs, a strategy Oh et al. [33] employ by mixing embeddings from different modalities. While effective, this cross-modal mixup may obscure the semantic clarity of embeddings. As an alternative we propose increasing the dataset with additional positive pairs that exhibit minimal semantic overlap by integrating expert annotations. Fig. 3 compares the positive and negative pair creation in eCLIP with traditional CLIP and $m^2$ -mixup.", + "bbox": [ + 212, + 378, + 787, + 546 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Introducing Expert Annotations to CLIP", + "text_level": 1, + "bbox": [ + 215, + 570, + 602, + 585 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Our objective with eCLIP is to enhance the CLIP framework by integrating expert annotations - radiologist eye-gaze heatmaps - to diversify the pool of positive samples. The eCLIP model is designed to be compatible across all CLIP variants without modifying its core architecture. The heatmap processor (Fig. 2, right) first converts the images and heatmaps into a sequence of patches and applies multi-headed attention (MHA) over the sequences. The patched heatmap overlaid images serve as queries, while the original image's patches act as keys and values. The processed output is then reconstructed back to its original image format, enabling the standard CLIP image encoder to obtain expert image embeddings. These new embeddings and their text embedding pair introduce additional positive samples for the contrastive loss objective (Fig. 3, right).", + "bbox": [ + 212, + 597, + 787, + 777 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "However, the size of the expert annotated data is orders of magnitude smaller than the data available for CLIP training. To effectively leverage the scarce expert-annotated data, we implement mixup augmentation [62]. As illustrated in Fig. 2 (left), this involves blending an original image $I_{i}$ with its expert version", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 5 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1 eCLIP Algorithm" + ], + "code_body": "Require: Image Encoder $f(\\cdot)$ // Compute Total Loss \nRequire: Text Encoder $g(\\cdot)$ \n1: $\\mathcal{L}_{\\mathrm{priming}} \\gets 0; n_{\\mathrm{p}} \\gets 0$ \n2: for minibatch $\\{x_i\\}_{i=1}^N$ do \n3: Unpack $x_i$ to $(T_i, I_i)$ and optionally $E_i$ \n4: $t_i \\gets g(T_i)$ \n5: $v_i \\gets f(I_i)$ \n6: $p_{\\mathrm{uni}} \\sim \\mathrm{Uniform}(0,1)$ \n7: if $p_{\\mathrm{uni}} < p_{\\mathrm{curr}}$ and $E_i$ is provided then \n8: // Process expert image \n9: $\\lambda \\sim \\mathrm{Beta}(\\alpha, \\alpha)$ \n10: $I_i^E \\gets \\mathrm{HeatmapProcessor}(I_i, E_i)$ \n11: $I_i^\\lambda \\gets I_i\\lambda + I_i^E(1 - \\lambda)$ \n12: $v_i^\\lambda \\gets f(I_i^\\lambda)$ \n13: end if \n14: if $E_i$ is entirely ones then \n15: $I_i^R \\gets \\mathrm{HeatmapProcessor}(I_i, E_i)$ \n16: $\\mathcal{L}_{\\mathrm{priming}} \\gets \\mathcal{L}_{\\mathrm{priming}} + (I_i - I_i^R)^2$ \n17: $n_{\\mathrm{p}} \\gets n_{\\mathrm{p}} + 1$ \n18: end if \n19: end for", + "bbox": [ + 215, + 162, + 785, + 469 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "$I_{i}^{E}$ to create $I_{i}^{\\lambda} = \\lambda I_{i} + (1 - \\lambda)I_{i}^{E}$ , where $\\lambda \\sim \\mathrm{Beta}(\\alpha, \\alpha)$ . (We set $\\alpha = 0.3$ in all our experiments.) The eCLIP image encoder then processes $I_{i}^{\\lambda}$ to produce the image embedding $v_{i}^{\\lambda} = f(I_{i}^{\\lambda})$ . These expert embeddings form new positive pairs $(v_{i}^{\\lambda}, t_{i})$ as well as corresponding negative pairs, which are added with existing pairs $(v_{i}, t_{i})$ during the computation of the CLIP InfoNCE Loss, $\\mathcal{L}_{i}$ .", + "bbox": [ + 212, + 501, + 784, + 578 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To seamlessly integrate expert annotations without disrupting the foundational training of the eCLIP model, we employ a phased curriculum learning strategy [2]. This approach comprises a cold start phase where the model is initially trained without the expert annotations to establish a robust baseline. This phase accounts for about $10\\%$ of the total training iterations. It then transitions into a warmup phase, gradually increasing the inclusion of expert examples from 0.05 to 0.5 probability over the next $30\\%$ of iterations. Finally, a cooldown phase reduces expert example probability to 0.1 for the subsequent $40\\%$ of iterations, fine-tuning the model's performance by balancing foundational and expert-driven insights.", + "bbox": [ + 212, + 580, + 785, + 731 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Additionally, we regularize the heatmap processor to behave as an identity function in scenarios where the heatmap is entirely composed of ones. We achieve this through a priming phase that coincides with the curriculum learning's cold start phase. We setup an auxiliary mean-squared error loss to force the heatmap processor to reconstruct the original image $I_{i}$ when the heatmap $E_{i} = 1$ . This priming ensures the heatmap processor's adaptability, allowing it to process expert annotations effectively when available, while falling back to the", + "bbox": [ + 212, + 734, + 785, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "model's original performance in their absence. The total loss during this phase is, $\\mathcal{L}_{\\mathrm{total}} = w_{\\mathrm{p}}\\cdot \\mathcal{L}_{\\mathrm{priming}} + (1 - w_{\\mathrm{p}})\\cdot \\mathcal{L}_{\\mathrm{clip}}$ , where $w_{\\mathrm{p}}$ is a hyperparameter which we set to 0.1. The pseudocode for eCLIP is shown in Algorithm 1.", + "bbox": [ + 212, + 146, + 787, + 191 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 214, + 375, + 231 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our experiments are designed to evaluate the influence of expert heatmap annotations on the quality of the learned representations. Unless stated otherwise, we assume that a large set of image-text pairs, of which a small fraction is annotated with eye-gaze heatmaps, is used for training, but for test samples no annotations are used. We utilize both quantitative measures and qualitative assessments to study the contributions of these annotations towards enhancing model performance. The source code is available online.", + "bbox": [ + 212, + 244, + 787, + 349 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Setup", + "text_level": 1, + "bbox": [ + 215, + 372, + 310, + 387 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Baselines To validate our approach, we compare eCLIP against a model trained using traditional CLIP (referred to as the base model) and a \"naive\" baseline, where the expert annotated samples are directly added to the training set without using mixup or curriculum learning. We also examine the impact of two mixup methods: Domain Agnostic Contrastive Learning (DACL) [49] and $m^3$ -mixup [33] which blends image and text embeddings to improve alignment and uniformity across modalities. While DACL is integrated during pretraining, $m^3$ -mixup is applied post-pretraining, in a manner akin to fine-tuning. eCLIP can be applied to any variant of CLIP, which we demonstrate also with GLoRIA [15] which has a Resnet50 image encoder. We introduce two variants of our technique: eCLIP, which integrates expert annotations during the initial CLIP pretraining phase, and eCLIP $^{\\mathcal{P}}$ , which instead continually finetunes a trained CLIP model with expert annotations, similar to $m^3$ -mixup.", + "bbox": [ + 212, + 395, + 787, + 592 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Datasets For pretraining phase we utilize the MIMIC-CXR dataset [21], which pairs roughly 200K chest X-rays with free-text radiology reports. The images were processed into JPEG format as described in [20], and the accompanying reports were stripped of unnecessary punctuation and tokenized using the Wordpiece scheme [7]. We obtain the eye-gaze heatmap from the EGD-CXR dataset [6] and process the eye-tracking data to obtain the normalized eye-gaze heatmap which are available for 1080 datapoints.", + "bbox": [ + 212, + 613, + 787, + 719 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our evaluation setup includes multiple publicly available chest X-ray datasets, specifically CheXpert [17], RSNA Pneumonia [39], NIH CXR [53] and Open-I [6], each offering a distinct set of imaging and reporting characteristics. Following previous works [15, 54, 59], we prepare the test sets from MIMIC and CheXpert, selecting 200 random samples for five specific pathologies from the CheXpert competition, resulting in 1000 samples for each dataset (MIMIC 5x200 and CheXpert 5x200, respectively). For the NIH-CXR dataset, we assembled a subset of 100 samples for each of 14 abnormalities, thereby creating CXR 14x100", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "test set. The Open-I dataset is utilized for text retrieval and radiology report generation tasks. For linear probe evaluations, we use CXR-8 [53], RSNA dataset and construct an OpenI-5 dataset by extracting labels from the 'Problems' field within the reports that match the CheXpert competition labels.", + "bbox": [ + 218, + 146, + 782, + 205 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Training We employed CLIP pretraining on the MIMIC-CXR dataset, utilizing a subset with roughly 1000 images with expert eye-gaze heatmap annotations, while validation and all other downstream evaluations proceed without these annotations. Our model architecture includes Swin Tiny, following recent studies [54,59], alongside Vision Transformer (ViT) Small and Base, with image encoders pretrained on ImageNet and Clinical BERT [1] with max length of sequences set to 256 as the text encoder. We cropped images to (224, 224) using random resized crop augmentation and turned off all other image augmentations. Pretraining utilized 8 AMD MI250X GPUs, maintaining an effective batch size of 512 for 10,000 steps. The learning rate was $1e^{-4}$ for standard CLIP, increased to $2e^{-4}$ for eCLIP variants, with cosine annealing plus a linear warmup for the first $10\\%$ of iterations, weight decay of $1e^{-3}$ , and learnable temperature parameter in the contrastive loss initialized at 0.07. Models for $m^3$ -mixup and $\\mathrm{eCLIP}^{\\mathcal{P}}$ are initialized with weights from CLIP pretraining and further finetuned for 1,000 iterations with a learning rate of $1e^{-5}$ . Detailed setup information is available in the Supplement.", + "bbox": [ + 218, + 226, + 784, + 467 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Zero-shot Image Classification", + "text_level": 1, + "bbox": [ + 218, + 488, + 509, + 503 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Following CLIP [36], our zero-shot classification method categorizes images into predefined classes without direct finetuning, thus relying on the quality of embeddings generated during pretraining. To formulate the embedding of each class label, we first generate descriptive prompts to obtain a list of text embeddings corresponding to the label using the text encoder [15, 54, 59]. The mean of these embeddings is taken as the representation of the label. For each image, classification is then performed by matching the image embedding with its closest label embedding through cosine similarity. More details of the prompts used are provided in the Supplement.", + "bbox": [ + 218, + 511, + 784, + 645 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Tab. 1 illustrates the zero-shot classification performance on CheXpert 5x200, MIMIC 5x200, RSNA, and CXR 14x100 datasets. The results, based on macro-averaged F1 scores from three random initializations, highlight eCLIP variants' superior performance over the base models across all datasets. While the $m^3$ -mixup excels in MIMIC for certain architectures, eCLIP variants show broader generalization. Notably, eCLIP's advantages are more pronounced in multi-class scenarios (CheXpert, MIMIC and CXR14) compared to binary classification on RSNA.", + "bbox": [ + 218, + 647, + 782, + 765 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 Sample Efficiency", + "text_level": 1, + "bbox": [ + 218, + 787, + 403, + 801 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sample efficiency measures how well a model learns from limited amount of training data. eCLIP improves this efficiency by using expert annotated im", + "bbox": [ + 218, + 809, + 782, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/eea71e1a60b0501e605f60dacef126e32537149b9959dfe6a4a201f99f6e8b0c.jpg", + "table_caption": [ + "Table 1: Zero-shot classification performance on 4 X-ray datasets and model configurations, reported as macro-averaged F1 scores from three independent random seeds. The highest score per dataset and model configuration is underlined. The overall best-performing model for each dataset is highlighted in bold." + ], + "table_footnote": [], + "table_body": "
ModelDataset
Chexpert 5x200MIMIC 5x200RSNACXR 14x100
GLoRIAResnet500.478±.0230.457±.0160.736±.0240.155±.001
+naive0.391±.0690.334±.0570.731±.0230.113±.024
+DACL0.506±.0290.430±.0110.736±.0070.158±.004
+m3-mix0.512±.0050.467±.0040.760±.0060.160±.003
+expert (ours)0.507±.0040.430±.0090.761±.0170.156±.023
+expertP(ours)0.507±.0050.475±.0080.775±.0010.159±.001
CLIPSwin Tiny0.517±.0250.452±.0020.808±.0000.169±.003
+naive0.532±.0100.452±.0220.807±.0070.167±.007
+DACL0.465±.0080.389±.0150.768±.0180.101±.013
+m3-mix0.554±.0060.469±.0080.802±.0040.179±.008
+expert (ours)0.549±.0160.445±.0210.818±.0040.172±.006
+expertP(ours)0.558±.0040.463±.0070.819±.0000.192±.003
CLIPViT Small0.525±.0240.441±.0060.807±.0060.159±.007
+naive0.534±.0160.440±.0190.805±.0040.156±.017
+DACL0.475±.0250.398±.0150.761±.0090.133±.007
+m3-mix0.557±.0020.454±.0030.809±.0020.164±.002
+expert (ours)0.545±.0160.452±.0130.803±.0030.165±.007
+expertP(ours)0.559±.0010.439±.0040.817±.0010.165±.004
CLIPViT Base0.540±.0170.465±.0040.805±.0010.183±.011
+naive0.506±.0110.426±.0060.805±.0040.151±.009
+DACL0.474±.0070.400±.0020.759±.0010.106±.003
+m3-mix0.542±.0210.465±.0130.798±.0040.183±.020
+expert (ours)0.563±.0210.477±.0040.814±.0030.193±.017
+expertP(ours)0.549±.0030.452±.0070.810±.0010.185±.002
", + "bbox": [ + 245, + 212, + 759, + 619 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "ages to form new positive and negative pairs, aiming to improve the quality of the learned embeddings. To test this, we first looked at zero-shot classification performance, adjusting the number of training batches available for pretraining. Results, shown in Fig. 4 (top row), reveal that eCLIP is more sample efficient across MIMIC 5x200, CheXpert 5x200 and CXR 14x100 datasets compared to the base model. Additionally, by applying supervised fine-tuning (SFT) with a linear probe on class-imbalanced datasets - CXR-8, RSNA and OpenI-5 (Sec. 4.1) - eCLIP demonstrates stronger performance in multi-label classification tasks, CXR-8 and OpenI-5 and remains competitive in binary classification for RSNA. This is shown in Fig. 4 (bottom row) where we plot the ROC AUC scores against different training sample sizes for linear probing. These findings highlight eCLIP's ability to effectively learn from fewer samples.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/dc2e4670e024d6f3b2333c54b99d3c168ff07671300e27842f90d2a4e04d794a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 276, + 146, + 424, + 237 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/73ed6b375a88ca48f932cd1f9291d45f42782ed71a8c2191a4cfbe6265e5b460.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 429, + 146, + 575, + 237 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/1a68cb4853412b7b6b1807655629850318d58902b5d4be0fac4d6d086e60a64c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 578, + 146, + 728, + 237 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/3525da3b71ca747c28ada3de628167b670b88048871c786d4993d0ff6b611e74.jpg", + "image_caption": [ + "Fig. 4: Sample Efficiency. (top row) Zero-shot performance on three multi-label classification test sets for CLIP and eCLIP Swin Tiny models, trained with varying amounts of training batches. (bottom row) Linear probe scores with varying amounts of training data." + ], + "image_footnote": [], + "bbox": [ + 276, + 243, + 426, + 333 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/ebfb2ea057e0bb8fb6005598a6278788ff2dc5cbb5328774c1bba9c7c9078b68.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 429, + 243, + 575, + 333 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/d2d7b9f9fd495dbc93e377a552d90b5240339b24ad0657e85c01adea0263041d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 580, + 243, + 725, + 333 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.4 Text retrieval and retrieval augmented generation (RAG)", + "text_level": 1, + "bbox": [ + 215, + 434, + 733, + 450 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To compare eCLIP's cross-modal functionality with that of CLIP we focused on text retrieval task using the Open-I dataset, which consists of pairs of X-rays and radiology reports. We used the FAISS vector database [8] to index the text embeddings generated by the text encoder. For a given X-ray image $I_{i}$ , we then retrieve the closest text reports from the database based on the cosine similarity in the embedding space, $\\min_j(v_i\\cdot t_j)$ . Results in Tab. 2 compare the performance of eCLIP against CLIP in text retrieval measured in Recall@1, 5, and 10. The performance of eCLIP indicates a notable improvement in its embedding quality. Note that our evaluation followed a strict criterion for recall computation, where a retrieval was counted as successful only if the exact correct report was identified. While more nuanced measures based on semantic similarity could be employed [59], we opted this approach to maintain a clear and simple evaluation framework.", + "bbox": [ + 212, + 460, + 787, + 656 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Next we extend our analysis from retrieval to report generation using a frozen Large Language Model (LLM), Mistral 7B Instruct v2 [19], aiming to generate radiology reports through Retrieval Augmented Generation (RAG). This setup tests the CLIP model's capacity to retrieve texts which can be used to prompt an LLM to generate a report without finetuning on medical data. First we randomly selected 389 samples from the Open-I dataset for testing and utilized the FAISS database to index the reports from the remaining samples (i.e., training set). Given a test image we retrieve five closest reports from the training set and use them in the prompt for the LLM to generate a report for the test image. The eCLIP variant showed a small but consistent improvement over the base model in generating reports, as indicated in Tab. 3. A comparative analysis of generated report versus ground truth shown in Tab. 5, with discrepancies marked, further", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/4c83cb67d9115fb95a4442283c59688fe394ccecb356abcbc07ab1f60a3872b3.jpg", + "table_caption": [ + "Table 2: Performance on Image to Report retrieval with Open-I dataset. We report the Recall@{1, 5, 10}" + ], + "table_footnote": [], + "table_body": "
ModelR@1R@5R@10
CLIP_Swin_Tiny3.17.611.3
+m3-mix2.46.59.8
+expert (ours)3.79.413.4
+expertP(ours)3.18.211.7
CLIP_ViT_Base3.79.213.2
+m3-mix4.18.813.0
+expert (ours)4.410.313.5
+expertP(ours)3.99.413.2
", + "bbox": [ + 215, + 198, + 470, + 348 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/0b64094d01e69b2929b9d46a24c3d04111d2481f2d62572f978ead39ea421f02.jpg", + "table_caption": [ + "Table 3: Performance on report generation with Open-I dataset. We report the BLEU-2 score (BL-2), BERT recall score [64] (B-R), Cosine similarity between the sentence embeddings of the generated and ground-truth report for MPNet [42] Sentence Transformer model [38] $(\\mathrm{S}_{emb})$ ,and for the CheXBERT model [41] $(\\mathrm{CB}_{emb})$" + ], + "table_footnote": [], + "table_body": "
ModelBL-2B-RSembCBemb
CLIP0.1720.7130.7910.492
+m3-mix0.1720.7110.7880.496
eCLIP0.1770.7120.7950.506
", + "bbox": [ + 215, + 481, + 506, + 554 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/afe96a94126e0b0867f38a6c46125a38cb4328d6233ea059198c9d55aad13d36.jpg", + "table_caption": [ + "Table 4: Ablation Study with Swin Tiny. Zero-shot performance on CheXpert (CXP) and CXR14 (C14) datasets for the base CLIP and models with expert annotation integration $(+\\mathrm{E})$ is presented. Methods include mask multiplication $(\\odot)$ , CNN, and Multi-headed Attention (MHA) encoders. Key augmentations: Mixup $(+\\mathrm{M})$ , Curriculum Learning $(+\\mathrm{C})$ , and Encoder Priming $(+\\mathrm{P})$ demonstrate performance gains. A control with a random mask (rand) confirms the significance of expert annotations. We report macro-averaged F1 scores from three random initialization" + ], + "table_footnote": [], + "table_body": "
MethodCXPC14
Base0.517±.0240.169±.003
⊗ Mask (+ E)0.540±.0190.165±.006
CNN Encoder (+ E)0.534±.0120.163±.008
MHA Encoder (+ E)0.534±.0130.153±.002
MHA Encoder (+ E, M)0.532±.0180.160±.010
MHA Encoder (+ E, M, C)0.545±.0080.173±.018
MHA Encoder (+ rand, M, C, P)0.537±.0200.166±.003
MHA Encoder (+ E, M, C, P)0.549±.0160.172±.006
", + "bbox": [ + 509, + 364, + 790, + 563 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "validates the effectiveness of eCLIP's embeddings in supporting complex cross-modal tasks. Additional details, including LLM prompts and generated report samples are available in the Supplement.", + "bbox": [ + 212, + 587, + 784, + 633 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Embedding Quality", + "text_level": 1, + "bbox": [ + 215, + 651, + 423, + 667 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For qualitative evaluations, we first examine the histogram of the cosine similarities of the embeddings from different abnormality subgroups obtained from the CLIP image encoder. In Fig. 5 (top row), we can see that the similarities for the CLIP model has considerably dropped below 1 after continual pretraining on MIMIC-CXR compared to Fig. 1. This indicates that the model's ability to distinguish between different conditions has improved. The introduction of expert annotations in the eCLIP variant further improves this with mean cosine similarities for 'normal' versus cardiomegaly, atelectasis and opacity dropping to 0.36, 0.4 and 0.4 respectively.", + "bbox": [ + 212, + 672, + 787, + 809 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Our evaluation of uniformity and alignment reveals that eCLIP surpasses both the MIMIC-pretrained and internet-pretrained models in these key metrics,", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/353a50900c3d2a057d934993645745044b27d037fbbf8e4658ba68f64eff2231.jpg", + "table_caption": [ + "Table 5: Random samples of generated report. For each image in the Open-I dataset, the five closest text snippets based on embedding cosine similarity is used as prompts for Mistral 7B LLM. Utilizing in-context learning, we prompt the LLM with two such snippet-report pairs. The conditions that the generated report identified correctly are highlighted in green while those it missed are shown in red." + ], + "table_footnote": [], + "table_body": "
ProblemsGround TruthGenerated
normalThe lungs and pleural spaces show no acute abnormality. Heart size and pulmonary vascularity within normal limits.The lungs are clear with no evidence of consolidation, pneumothorax, or pleural effusion. Heart size and mediastinal contour are normal. No acute abnormalities noted in the visualized osseous structures.
Pulmonary At-electasis. Pleural Effusion. Cardiomegaly. Pulmonary CongestionAP and lateral views were obtained. Bibasilar atelectasis and small left-sided pleural effusion. Stable cardiomegaly. No pneumothorax. Mild pulmonary vascular congestion.The lungs show bibasilar airspace opacities, possibly due to infection or atelectasis. Heart size is mildly enlarged. No pneumothorax or pleural effusion.
Lung. Density. EmphysemaThere is hyperexpansion. The heart size is normal. There is no pleural effusion or pneumothorax. Two circular densities overlying the right ribs which were not present in the XXXX CT. No focal infiltratesThe lungs are hyperexpanded with clear fields and no acute consolidations or pleural effusions. Heart size and pulmonary vascularity are within normal limits. Degenerative changes are present in the thoracic spine. A calcified granuloma is noted in the left perihilar region. No pneumothorax or large pleural effusion is observed.
", + "bbox": [ + 223, + 224, + 774, + 503 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "indicating a marked improvement in the quality of embeddings (Fig. 5, bottom left). We also note a modest decrease in the modality gap with eCLIP (Fig. 5, bottom center). Clustering analysis via K-means (with $k = 5$ for 5 abnormalities in data) highlights eCLIP's superior performance in grouping abnormalities, as seen from improved scored in Normalized Mutual Information (NMI), Silhouette score, and Calinski-Harabasz (CH) index (Fig. 5, bottom right).", + "bbox": [ + 212, + 532, + 787, + 623 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.6 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 646, + 388, + 662 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Our ablation study with the Swin Tiny encoder shows the impact of key components in our eCLIP model: multi-headed attention (MHA) layer for heatmap processing, curriculum learning for phased introduction of expert annotations, mixup augmentation to compensate for limited number of export annotated data and priming of heatmap processor during initial training phase. Results shown in Tab. 4 reveal that the MHA-based heatmap processor improves zero-shot classification performance on CheXpert 5x200 and CXR 14x100 datasets compared to basic methods like direct application of heatmaps as mask ( $\\odot$ Mask) or using a CNN encoder. We note a significant performance drop with randomly generated heatmaps versus expert eye-gaze heatmaps. This highlights that while our methodological improvements contribute to the performance gains, the in", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/2272f010eb80f246b16f322d19e7a20f4db88dbf607c559b88169858e87d9480.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 246, + 145, + 375, + 238 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/69ed5c70a743be77b6d0c3719ff0de8b3bd40719325c7548e5d53cea3a7f1bc2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 379, + 146, + 501, + 238 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/212e4f8e20f91c607835cb493e85ef90056014c81f724febf66b921989ebbeae.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 504, + 146, + 627, + 238 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/5c8ff4805b5fd12d79a8894356cb8b92bcbc4a5a58a0301306eaaf712044315c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 630, + 146, + 753, + 238 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/1a23f8e9e09b1527ba885d82b5a03544e0088a6195cba15ebefc3112832ce5f5.jpg", + "image_caption": [ + "Fig. 5: Qualitative Analysis of CLIP Pretraining. top row illustrates the cosine similarity distributions for CLIP and eCLIP image embeddings. bottom left and center sections display uniformity, alignment, and modality gap comparisons among the internet pretrained model (ZS), CLIP pretrained on MIMIC, and eCLIP. bottom right details K-means clustering metrics for image embeddings with $k = 5$ for both CLIP and eCLIP models." + ], + "image_footnote": [], + "bbox": [ + 248, + 243, + 424, + 332 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/95e49cdd3ef9010ab1f8b8cadb78eff430ac38b01807682624b1fd7eeea92987.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 433, + 243, + 578, + 330 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/f76b37e8036aacb1a54f91eb3209d9d975f210d52043ecdf82c49139c3239da0.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 602, + 243, + 754, + 340 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "tegration of meaningful, expert-derived signals is essential for achieving optimal results.", + "bbox": [ + 214, + 469, + 784, + 498 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 525, + 359, + 540 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We introduce eCLIP, an adaptation of CLIP, demonstrating the integration of radiologist eye-tracking heatmap to overcome challenges faced in multi-modal contrastive learning. This study highlights the impact of integrating these high-quality expert annotations on improving the quality of learned embeddings and assess its influence on sample efficiency and cross-modal retrieval tasks. An important future research direction would be extending this approach to include expert annotations from the text modality (e.g., by adapting SimCSE [9]) and to leverage the temporal dynamics of eye-tracking data by aligning the sequential frames with the corresponding report snippets.", + "bbox": [ + 214, + 558, + 787, + 696 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "**Limitations** Our study is limited by the small size of expert annotated data and thus does not comprehensively analyze the impact of size or distribution of expert annotations across different abnormalities. eCLIP also incurs extra computational costs during training due to the additional forward pass required for processing expert images in the warmup and cool-down phases. Additionally, the clinical relevance of generated radiology reports has not been validated by medical experts, relying instead on standard metrics known for potential biases and inaccuracies in reflecting clinical accuracy [60].", + "bbox": [ + 214, + 719, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported by the Research Council of Finland (Flagship programme: Finnish Center for Artificial Intelligence FCAI, and grants 352986, 358246) and EU (H2020 grant 101016775 and NextGenerationEU). We acknowledge the computational resources provided by Aalto Science-IT project. We acknowledge CSC for awarding this project access to the LUMI supercomputer, owned by the EuroHPC Joint Undertaking, hosted by CSC (Finland) and the LUMI consortium through Finland.", + "bbox": [ + 212, + 180, + 787, + 286 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 311, + 321, + 328 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Alsentzer, E., Murphy, J.R., Boag, W., Weng, W.H., Jin, D., Naumann, T., McDermott, M.: Publicly available clinical BERT embeddings. arXiv preprint arXiv:1904.03323 (2019) 9", + "2. Bengio, Y., Louradour, J., Collobert, R., Weston, J.: Curriculum learning. In: Proceedings of the 26th Annual International Conference on Machine Learning. pp. 41-48 (2009) 7", + "3. Bigolin Lanfredi, R., Zhang, M., Auffermann, W.F., Chan, J., Duong, P.A.T., Srikumar, V., Drew, T., Schroeder, J.D., Tasdizen, T.: REFLACX, A dataset of reports and eye-tracking data for localization of abnormalities in chest x-rays. Scientific Data 9(1), 350 (2022) 5", + "4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607. PMLR (2020) 1, 4", + "5. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023) 1", + "6. Demner-Fushman, D., Kohli, M.D., Rosenman, M.B., Shooshan, S.E., Rodriguez, L., Antani, S., Thoma, G.R., McDonald, C.J.: Preparing a collection of radiology examinations for distribution and retrieval. Journal of the American Medical Informatics Association 23(2), 304-310 (2016) 2, 8", + "7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 8", + "8. Douze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.E., Lomeli, M., Hosseini, L., Jégou, H.: The faiss library. arXiv preprint arXiv:2401.08281 (2024) 11", + "9. Gao, T., Yao, X., Chen, D.: SimCSE: Simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821 (2021) 14", + "10. Geng, X., Liu, H., Lee, L., Schuurmans, D., Levine, S., Abbeel, P.: M3AE: Multimodal masked autoencoders learn transferable representations. Tech. rep., Technical Report 4", + "11. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: CyCLIP: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022) 2, 4" + ], + "bbox": [ + 218, + 347, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "12. Gu, S., Clark, C., Kembhavi, A.: I can't believe there's no images! learning visual tasks using only language supervision. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2672-2683 (2023) 4", + "13. Han, Z., Liang, Z., Yang, F., Liu, L., Li, L., Bian, Y., Zhao, P., Wu, B., Zhang, C., Yao, J.: Umix: Improving importance weighting for subpopulation shift via uncertainty-aware mixup. Advances in Neural Information Processing Systems 35, 37704-37718 (2022) 3", + "14. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022) 4", + "15. Huang, S.C., Shen, L., Lungren, M.P., Yeung, S.: Gloria: A multimodal global-local representation learning framework for label-efficient medical image recognition. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3942-3951 (2021) 2, 4, 8, 9", + "16. Huang, Z., Bianchi, F., Yuksekgonul, M., Montine, T.J., Zou, J.: A visual-language foundation model for pathology image analysis using medical twitter. Nature Medicine 29(9), 2307-2316 (2023) 5", + "17. Irvin, J., Rajpurkar, P., Ko, M., Yu, Y., Ciurea-Ilicus, S., Chute, C., Marklund, H., Haghgoo, B., Ball, R., Shpanskaya, K., et al.: CheXpert: A large chest radiograph dataset with uncertainty labels and expert comparison. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 33, pp. 590-597 (2019) 8", + "18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International Conference on Machine Learning. pp. 4904-4916. PMLR (2021) 1", + "19. Jiang, A.Q., Sablayrolles, A., Mensch, A., Bamford, C., Chaplot, D.S., Casas, D.d.l., Bressand, F., Lengyel, G., Lample, G., Saulnier, L., et al.: Mistral 7B. arXiv preprint arXiv:2310.06825 (2023) 11", + "20. Johnson, A., Lungren, M., Peng, Y., Lu, Z., Mark, R., Berkowitz, S., Horng, S.: MIMIC-CXR-JPG-Chest radiographs with structured labels. PhysioNet (2019) 8", + "21. Johnson, A.E., Pollard, T.J., Berkowitz, S.J., Greenbaum, N.R., Lungren, M.P., Deng, C.y., Mark, R.G., Horng, S.: MIMIC-CXR, a de-identified publicly available database of chest radiographs with free-text reports. Scientific data 6(1), 317 (2019) 5, 8", + "22. Karargyris, A., Kashyap, S., Lourentzou, I., Wu, J.T., Sharma, A., Tong, M., Abedin, S., Beymer, D., Mukherjee, V., Krupinski, E.A., et al.: Creation and validation of a chest X-ray dataset with eye-tracking and report dictation for AI development. Scientific Data 8(1), 92 (2021) 3, 5", + "23. Krishnan, R., Rajpurkar, P., Topol, E.J.: Self-supervised learning in medicine and healthcare. Nature Biomedical Engineering 6(12), 1346-1352 (2022) 2", + "24. Li, Y., Fan, H., Hu, R., Feichtenhofer, C., He, K.: Scaling language-image pretraining via masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23390-23400 (2023) 4", + "25. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022) 2, 4", + "26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. arXiv preprint arXiv:2304.08485 (2023) 1", + "27. McInnes, L., Healy, J., Melville, J.: UMAP: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 3" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "28. Mo, S., Kim, M., Lee, K., Shin, J.: S-clip: Semi-supervised vision-language learning using few specialist captions. Advances in Neural Information Processing Systems 36 (2024) 4", + "29. Moor, M., Huang, Q., Wu, S., Yasunaga, M., Dalmia, Y., Leskovec, J., Zakka, C., Reis, E.P., Rajpurkar, P.: Med-flamingo: a multimodal medical few-shot learner. In: Machine Learning for Health (ML4H). pp. 353-367. PMLR (2023) 5", + "30. Mu, N., Kirillov, A., Wagner, D., Xie, S.: Slip: Self-supervision meets language-image pre-training. In: European Conference on Computer Vision. pp. 529-544. Springer (2022) 4", + "31. Naeem, M.F., Xian, Y., Zhai, X., Hoyer, L., Van Gool, L., Tombari, F.: SILC: Improving vision language pretraining with self-distillation. arXiv preprint arXiv:2310.13355 (2023) 4", + "32. Nukrai, D., Mokady, R., Globerson, A.: Text-only training for image captioning using noise-injected clip. arXiv preprint arXiv:2211.00575 (2022) 4", + "33. Oh, C., So, J., Byun, H., Lim, Y., Shin, M., Jeon, J.J., Song, K.: Geodesic multi-modal mixup for robust fine-tuning. Advances in Neural Information Processing Systems 36 (2023) 2, 3, 4, 5, 6, 8", + "34. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018) 1, 5", + "35. Palepu, A., Beam, A.: Tier: Text-image entropy regularization for medical clip-style models. In: Machine Learning for Healthcare Conference. pp. 548-564. PMLR (2023) 4", + "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021) 1, 2, 9", + "37. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021) 1", + "38. Reimers, N., Gurevych, I.: Sentence-BERT: Sentence embeddings using siamese BERT-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 3982-3992 (2019) 12", + "39. Shih, G., Wu, C.C., Halabi, S.S., Kohli, M.D., Prevedello, L.M., Cook, T.S., Sharma, A., Amorosa, J.K., Arteaga, V., Galperin-Aizenberg, M., et al.: Aug-mentation the national institutes of health chest radiograph dataset with expert annotations of possible pneumonia. Radiology: Artificial Intelligence 1(1), e180041 (2019) 8", + "40. Singh, A., Hu, R., Goswami, V., Couairon, G., Galuba, W., Rohrbach, M., Kiela, D.: Flava: A foundational language and vision alignment model. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15638-15650 (2022) 1", + "41. Smit, A., Jain, S., Rajpurkar, P., Pareek, A., Ng, A.Y., Lungren, M.: Combining automatic labelers and expert annotations for accurate radiology report labeling using BERT. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). pp. 1500-1519 (2020) 12", + "42. Song, K., Tan, X., Qin, T., Lu, J., Liu, T.Y.: MPNet: Masked and permuted pretraining for language understanding. Advances in Neural Information Processing Systems 33, 16857-16867 (2020) 12" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "43. van Sonsbeek, T., Zhen, X., Mahapatra, D., Worring, M.: Probabilistic integration of object level annotations in chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3630-3640 (2023) 5", + "44. Sowrirajan, H., Yang, J., Ng, A.Y., Rajpurkar, P.: MoCo-CXR: MoCo pretraining improves representation and transferability of chest X-ray models, 2021. URL https://arxiv.org/abs (2010) 5", + "45. Sun, Z., Fang, Y., Wu, T., Zhang, P., Zang, Y., Kong, S., Xiong, Y., Lin, D., Wang, J.: Alpha-CLIP: A clip model focusing on wherever you want. arXiv preprint arXiv:2312.03818 (2023) 4", + "46. Tschannen, M., Mustafa, B., Houlsby, N.: CLIPPO: Image-and-language understanding from pixels only. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11006-11017 (2023) 2, 4", + "47. Tu, T., Azizi, S., Driess, D., Schaekermann, M., Amin, M., Chang, P.C., Carroll, A., Lau, C., Tanno, R., Ktena, I., et al.: Towards generalist biomedical ai. NEJM AI 1(3), AIoa2300138 (2024) 5", + "48. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International Conference on Machine Learning. pp. 6438-6447. PMLR (2019) 3", + "49. Verma, V., Luong, T., Kawaguchi, K., Pham, H., Le, Q.: Towards domain-agnostic contrastive learning. In: International Conference on Machine Learning. pp. 10530-10541. PMLR (2021) 3, 4, 8", + "50. Wang, B., Pan, H., Aboah, A., Zhang, Z., Keles, E., Torigian, D., Turkbey, B., Krupinski, E., Udupa, J., Bagci, U.: GazeGNN: A gaze-guided graph neural network for chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2194-2203 (2024) 5", + "51. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2021) 5", + "52. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020) 5", + "53. Wang, X., Peng, Y., Lu, L., Lu, Z., Bagheri, M., Summers, R.M.: ChestX-Ray8: Hospital-scale chest x-ray database and benchmarks on weakly-supervised classification and localization of common thorax diseases. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2097-2106 (2017) 8, 9", + "54. Wang, Z., Wu, Z., Agarwal, D., Sun, J.: MedCLIP: Contrastive learning from unpaired medical images and text. arXiv preprint arXiv:2210.10163 (2022) 2, 4, 8, 9", + "55. Weers, F., Shankar, V., Katharopoulos, A., Yang, Y., Gunter, T.: Masked autoencoding does not help natural language supervision at scale. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23432-23444 (2023) 4", + "56. Wu, C., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Medklip: Medical knowledge enhanced language-image pre-training. medRxiv pp. 2023-01 (2023) 5", + "57. Xu, H., Xie, S., Tan, X.E., Huang, P.Y., Howes, R., Sharma, V., Li, S.W., Ghosh, G., Zettlemoyer, L., Feichtenhofer, C.: Demystifying CLIP data. arXiv preprint arXiv:2309.16671 (2023) 1" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Y. Kumar and P. Marttinen", + "bbox": [ + 271, + 114, + 460, + 127 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "58. Xu, S., Yang, L., Kelly, C., Sieniek, M., Kohlberger, T., Ma, M., Weng, W.H., Kiraly, A., Kazemzadeh, S., Melamed, Z., et al.: Elixir: Towards a general purpose x-ray artificial intelligence system through alignment of large language models and radiology vision encoders. arXiv preprint arXiv:2308.01317 (2023) 5", + "59. You, K., Gu, J., Ham, J., Park, B., Kim, J., Hong, E.K., Baek, W., Roh, B.: CXR-CLIP: Toward large scale chest X-ray language-image pre-training. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 101-111. Springer (2023) 4, 8, 9, 11", + "60. Yu, F., Endo, M., Krishnan, R., Pan, I., Tsai, A., Reis, E.P., Fonseca, E.K.U.N., Lee, H.M.H., Abad, Z.S.H., Ng, A.Y., et al.: Evaluating progress in automatic chest x-ray radiology report generation. Patterns 4(9) (2023) 14", + "61. Zbontar, J., Jing, L., Misra, I., LeCun, Y., Deny, S.: Barlow twins: Self-supervised learning via redundancy reduction. In: International Conference on Machine Learning. pp. 12310-12320. PMLR (2021) 1", + "62. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017) 3, 6", + "63. Zhang, K., Yang, Y., Yu, J., Jiang, H., Fan, J., Huang, Q., Han, W.: Multi-task paired masking with alignment modeling for medical vision-language pre-training. IEEE Transactions on Multimedia (2023) 4", + "64. Zhang, T., Kishore, V., Wu, F., Weinberger, K.Q., Artzi, Y.: BERTScore: Evaluating text generation with BERT. In: International Conference on Learning Representations (2019) 12", + "65. Zhang, Y., Jiang, H., Miura, Y., Manning, C.D., Langlotz, C.P.: Contrastive learning of medical visual representations from paired images and text. In: Machine Learning for Healthcare Conference. pp. 2-25. PMLR (2022) 2, 4", + "66. Zhang, Y., HaoChen, J.Z., Huang, S.C., Wang, K.C., Zou, J., Yeung, S.: Diagnosing and rectifying vision models using language. arXiv preprint arXiv:2302.04269 (2023) 4", + "67. Zhang, Y., Sui, E., Yeung, S.: Connect, Collapse, Corrupt: Learning cross-modal tasks with uni-modal data. In: The Twelfth International Conference on Learning Representations (2024) 2, 4" + ], + "bbox": [ + 212, + 146, + 787, + 575 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "eCLIP", + "bbox": [ + 684, + 114, + 730, + 126 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_model.json b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_model.json new file mode 100644 index 0000000000000000000000000000000000000000..f279252615a9bd3bbab54f8d283f2ecf8211e465 --- /dev/null +++ b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_model.json @@ -0,0 +1,2383 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.249, + 0.141, + 0.756, + 0.187 + ], + "angle": 0, + "content": "Improving Medical Multi-modal Contrastive Learning with Expert Annotations" + }, + { + "type": "text", + "bbox": [ + 0.358, + 0.213, + 0.646, + 0.228 + ], + "angle": 0, + "content": "Yogesh Kumar and Pekka Marttinen" + }, + { + "type": "text", + "bbox": [ + 0.301, + 0.24, + 0.702, + 0.269 + ], + "angle": 0, + "content": "Department of Computer Science, Aalto University, Finland {firstname_lastname}@aalto.fi" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.308, + 0.744, + 0.543 + ], + "angle": 0, + "content": "Abstract. We introduce eCLIP, an enhanced version of the CLIP model that integrates expert annotations in the form of radiologist eye-gaze heatmaps. It tackles key challenges in contrastive multi-modal medical imaging analysis, notably data scarcity and the \"modality gap\" - a significant disparity between image and text embeddings that diminishes the quality of representations and hampers cross-modal interoperability. eCLIP integrates a heatmap processor and leverages mixup augmentation to efficiently utilize the scarce expert annotations, thus boosting the model's learning effectiveness. eCLIP is designed to be generally applicable to any variant of CLIP without requiring any modifications of the core architecture. Through detailed evaluations across several tasks, including zero-shot inference, linear probing, cross-modal retrieval, and Retrieval Augmented Generation (RAG) of radiology reports using a frozen Large Language Model, eCLIP showcases consistent improvements in embedding quality. The outcomes reveal enhanced alignment and uniformity, affirming eCLIP's capability to harness high-quality annotations for enriched multi-modal analysis in the medical imaging domain." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.557, + 0.741, + 0.584 + ], + "angle": 0, + "content": "Keywords: Contrastive Learning \\(\\cdot\\) Medical Imaging \\(\\cdot\\) Zero-shot Inference" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.612, + 0.377, + 0.628 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Pretraining foundation models on multi-modal data - particularly leveraging the relationships between text and images - has proven to be a robust strategy for generating versatile embeddings [18,36]. These embeddings enhance the efficacy in several downstream tasks, from image generation to advanced vision-language integration [26, 37, 40]. Central to this approach is the employment of a contrastive learning (CL) loss objective [4, 34, 61], where models are trained to align positive pairs (e.g., an image and its corresponding caption) while diversifying negative ones. A significant hurdle in this approach is the necessity of vast datasets, often comprising several millions of data points, for competitive results. Models such as CLIP [36] have been trained on internet-scale datasets, estimated to encompass hundreds of millions of image-text pairs [5, 57]. Acquiring datasets of this magnitude poses substantial challenges in specialized fields that require expert knowledge for data collection, processing and annotation." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.782, + 0.355 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.365, + 0.788, + 0.409 + ], + "angle": 0, + "content": "Fig. 1: Analysis of CLIP Embeddings in Medical Imaging The figure presents embeddings generated by a CLIP model, pretrained on an internet-scale dataset, applied to the Open-I dataset pairing X-rays with corresponding radiology reports." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.442, + 0.784, + 0.518 + ], + "angle": 0, + "content": "The medical imaging domain exemplifies these difficulties, where acquiring even a single data point, such as a chest X-ray, involves complex processes requiring expertise and significant resources. Moreover, the procurement of such data for machine learning research is further complicated by ethical considerations, patient privacy concerns and the need for extensive de-identification procedures." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.52, + 0.788, + 0.761 + ], + "angle": 0, + "content": "This has led to the prevalent use of foundation models, initialized with weights from models trained on extensive internet-scale datasets, for tasks in the medical domain [15,23,54,65]. However, the areas of interest within medical images are often nuanced and require expert knowledge to interpret, rendering them indistinguishable to a general-purpose model. In Fig. 1a, we investigate the embeddings generated by a CLIP model – initially pretrained on internet data – using samples from the Open-I dataset [6], which includes X-rays and corresponding radiology reports. We categorize the samples into subgroups based on the primary abnormality identified in each report, such as 'normal', cardiomegaly, atelectasis and opacity. A histogram of the cosine similarities between embeddings from different groups indicates a high degree of similarity, with values approaching 1. This could lead to potential challenges in downstream zero-shot inference tasks, which rely on the spatial segregation of embeddings from different groups [36]. Typically, continual pretraining on medically relevant data is employed to enhance the model's ability to differentiate between various abnormalities." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Recent studies [11, 25, 33, 46, 67] have identified a \"modality gap\" in multimodal contrastive representation learning, where the embeddings from different modalities (e.g., images and text) fall in distinct regions in the shared embedding space. This separation, which arises from factors such as initial model weights and the objectives of contrastive learning [25, 67], leads to the \"cone effect\" where" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.686, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.233, + 0.147, + 0.778, + 0.325 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.338, + 0.788, + 0.477 + ], + "angle": 0, + "content": "Fig. 2: eCLIP Pretraining with Expert Annotations. eCLIP adds a Heatmap Processor (right), featuring a multi-headed attention layer, to the standard Image and Text encoders in CLIP. This processor, along with vision and text encoders, maps inputs into a shared hypersphere. Here, the original image \\((I_i)\\), its text \\((T_i)\\) and the heatmap-processed image \\((I_i^E)\\) are positioned within a tripartite area (shown here after 2D UMAP projection, please refer to the Supplement for a scaled version). We employ mixup between \\(I_i\\) and \\(I_i^E\\) to generate the embedding \\(v_i^\\lambda\\), which gives us additional positive pairs to enhance the CLIP InfoNCE loss optimization. An auxiliary loss, \\(\\mathcal{L}_{\\mathrm{priming}}\\), is used during the initial training steps to \"prime\" the heatmap processor to imitate an identity function when the heatmap is composed of all ones." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.613 + ], + "angle": 0, + "content": "embeddings of each modality are restricted to a narrow region of the embedding hypersphere. In Fig. 1b, we illustrate this within the medical domain with a 2D UMAP [27] projection of image and text embeddings. This example highlights how embeddings from the same modality but different semantic groups, such as X-ray images of varying abnormalities, cluster closely together. This makes it difficult for a model to distinguish between semantically different images, undermining its performance in medical image analysis." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.78 + ], + "angle": 0, + "content": "We investigate the potential of integrating expert annotations, specifically radiologist eye-gaze heatmaps, to alleviate these issues. Processing the eye-gaze data from radiologists [22] provides us with heatmaps indicative of the radiologist's attention across different regions of the X-ray images. This heatmap reflects areas of clinical interest aligned with details present in radiology reports. We posit that this could help capture nuanced visual cues in the X-rays and therefore pairing it with reports can enrich the CLIP training data with high-quality positive pairs. Due to the scarcity of such expert annotated data, we employ the mixup strategy, a data augmentation technique which has been effective in both supervised [13,48,62] and contrastive learning [33,49], to create additional synthetic samples." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "We present eCLIP (expert-annotated CLIP), an adaptation of the CLIP model that incorporates expert eye-gaze heatmaps, without modifying the CLIP model's core architecture. The operational workflow of eCLIP is depicted in Fig. 2. Our contributions are as follows:" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.147, + 0.786, + 0.193 + ], + "angle": 0, + "content": "- Utilization of Expert Annotations. We harness radiologist eye-gaze heatmaps to create additional embeddings, effectively introducing valuable positive and negative pairs for enhancing the contrastive learning process." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.193, + 0.787, + 0.268 + ], + "angle": 0, + "content": "- eCLIP Architecture. Our implementation features a heatmap processing mechanism utilizing multi-headed attention (MHA), optimized for handling both heatmaps and original images. This is complemented by a mixup strategy to addresses the challenge of data scarcity, and curriculum learning to ensure a gradual introduction of expert annotations." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.268, + 0.787, + 0.344 + ], + "angle": 0, + "content": "- Comprehensive Evaluation. We assess eCLIP's zero-shot classification accuracy, sample efficiency and cross-modal retrieval performance and embedding quality across multiple chest X-ray datasets. We also evaluate the cross-modal embeddings to generate radiology reports using a frozen Large Language Model (LLM) without explicitly fine-tuning on medical data." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.147, + 0.787, + 0.344 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.369, + 0.388, + 0.385 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.401, + 0.787, + 0.522 + ], + "angle": 0, + "content": "Modality Gap: Liang et al. [25] pinpoint the origins of the modality gap to the nuances of model initialization and the objectives of contrastive learning, underscoring its impact on downstream tasks and fairness. Oh et al. [33] highlight poor uniformity and alignment in CLIP's embeddings and propose a finetuning method for robust representations. Zhang et al. [67] explore the geometry of this embedding space, and provide both theoretical and empirical insights on the nature of this geometry. Subsequent research has produced methods to mitigate the modality gap through diverse and creative approaches [11, 12, 32, 46, 66]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.787, + 0.748 + ], + "angle": 0, + "content": "Improving Contrastive Learning: Several methods have improved upon the CLIP objective by introducing auxiliary losses, e.g., SLIP [30] uses SimCLR [4] loss, M3MAE [10,55] augment the Masked Autoencoder [14] reconstruction loss, FLIP [24] randomly masks out input images to improve scaling, DACL [49] proposes a domain agnostic mixup strategy, SILC [31] uses self-distillation, Mo et al. [28] utilized specialist captions to generate pseudo labels for unpaired images, Zhang et al. [63] propose Multi-task Paired Masking with Alignment to improve cross-modal interaction. Similarly there have been works that have identified the need to make the CLIP model focus on sub-regions in order to enhance its utility and downstream performance, GLoRIA [15] considers the loss from local regions from within the image and reports, Alpha-CLIP [45] uses the alpha channel to guide the CLIP model to focus on different regions of the image and generate the masks for all the images in the corpus using an image segmentation pipeline and TIER [35] uses a regularization term to improve the local focus of the model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Multi-modal Contrastive Learning in Medical Imaging: Zhang et al. [65] demonstrated enhanced downstream performance by jointly using chest X-ray and report pairing for training a contrastive learning model. This was further improved by Huang et al. [15], by exploiting local and global features from both modalities; Wang et al. [54] and You et al. [59] achieved impressive results by using a Swin Tiny model as the image encoder and by adding modifications" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.685, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "to the contrastive loss. Several other works have developed similar contrastive learning foundation models while utilizing the biomedical image texts to achieve impressive results [16, 29, 44, 47, 56, 58]. Karargyris et al. [22] and Bigolin et al. [3] augment a subset of the MIMIC-CXR [21] samples with high quality eye-tracking and verbal transcripts from several radiologists. van Sonsbeek et al. [43] and Wang et al. [50] utilize the heatmaps from eye-gaze to improve image classification." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.274, + 0.331, + 0.289 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.303, + 0.789, + 0.427 + ], + "angle": 0, + "content": "Notations. For a given chest X-ray image \\(I_{i}\\) and its radiology report \\(T_{i}\\), indexed by \\(i\\) in our dataset, we denote their L2-normalized embeddings as \\(v_{i}\\) and \\(t_i\\) respectively, residing in a d-dimensional space \\((v_{i},t_{i}\\in \\mathcal{R}^{d})\\). Image embeddings are obtained through an encoder \\(v_{i} = f(I_{i})\\) and text embeddings via \\(t_i = g(T_i)\\). Applying an expert heatmap \\(E_{i}\\) to an image results in the corresponding image embedding \\(v_{i}^{E}\\). We denote the loss value for the \\(i\\)-th sample as \\(\\mathcal{L}_i\\). For the case of contrastive loss, this is computed in terms of some similarity measure between the embeddings, \\(sim(v_{i},t_{i})\\), typically cosine similarity defined as \\(v_{i}\\cdot t_{i}\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.444, + 0.362, + 0.459 + ], + "angle": 0, + "content": "3.1 Background" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.467, + 0.788, + 0.528 + ], + "angle": 0, + "content": "Central to CLIP's effectiveness is the InfoNCE loss [34], a mechanism engineered to optimize the similarity measures between corresponding (positive) pairs and to minimize those among non-corresponding (negative) pairs. The formulation of the CLIP loss objective is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.236, + 0.547, + 0.786, + 0.589 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {t e x t}} = \\underset {(t _ {i}, v _ {i}) \\sim p o s} {\\mathbb {E}} \\left[ - \\log \\frac {\\exp (s i m (t _ {i} , v _ {i}) / \\tau)}{\\exp (s i m (t _ {i} , v _ {i}) / \\tau) + \\sum_ {j \\neq i} \\exp (s i m (t _ {i} , v _ {j}) / \\tau)} \\right] \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.597, + 0.788, + 0.673 + ], + "angle": 0, + "content": "Total loss is then defined as, \\(\\mathcal{L}_{\\mathrm{total}} = \\frac{1}{2}\\left(\\mathcal{L}_{\\mathrm{text}} + \\mathcal{L}_{\\mathrm{image}}\\right)\\), where \\(\\mathcal{L}_{\\mathrm{image}}\\) denotes the corresponding loss for the image to text mapping. Here, \\(\\tau\\) represents the temperature parameter that controls the scale of the similarity scores, typically framed as a learnable parameter during training. The loss expectation is taken over all the positive pairings in the dataset." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.673, + 0.789, + 0.766 + ], + "angle": 0, + "content": "Theoretical results on CL indicate the concepts of alignment and uniformity as critical for the quality of embeddings [51, 52]. Alignment focuses on reducing the distance between positive pairs while uniformity seeks to evenly distribute the embeddings across the unit hypersphere, preventing extreme clustering that could impair the model's generalizability and discriminative capabilities. The alignment and uniformity can be defined formally as follows [33]:" + }, + { + "type": "equation", + "bbox": [ + 0.304, + 0.783, + 0.786, + 0.817 + ], + "angle": 0, + "content": "\\[\n\\text {A l i g n m e n t} = - \\mathbb {E} _ {\\left(v _ {i}, t _ {i}\\right) \\sim p o s} \\left[ \\| v _ {i} - t _ {i} \\| _ {2} ^ {2} - \\min _ {j \\neq i} \\| v _ {i} - t _ {j} \\| _ {2} ^ {2} \\right] \\tag {2}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.304, + 0.819, + 0.786, + 0.839 + ], + "angle": 0, + "content": "\\[\n\\mathrm {U n i f o r m i t y} = - \\log \\mathbb {E} _ {(v _ {i}, t _ {j}) \\sim \\mathcal {D}} \\left[ \\exp (- 2 \\| v _ {i} - t _ {j} \\| _ {2} ^ {2}) \\right] \\tag {3}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "image", + "bbox": [ + 0.29, + 0.15, + 0.413, + 0.252 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.43, + 0.151, + 0.553, + 0.253 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.576, + 0.15, + 0.696, + 0.253 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.265, + 0.788, + 0.349 + ], + "angle": 0, + "content": "Fig. 3: Comparing eCLIP with \\( m^2 \\)-mixup [33]. (left) Standard CLIP showing image-text positive pairs \\( (v_i, t_i) \\) (solid line), while the other image embeddings serve as negative pairs (dashed line). (center) the \\( m^2 \\)-mixup creates negative pairs \\( (v_j^\\lambda, t_i) \\) via interpolation between embeddings along the geodesic. (right) eCLIP adds expert image embedding, \\( v_i^E \\), in addition to \\( v_i \\) for text \\( t_i \\), forming additional positive and negative pairs" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.38, + 0.789, + 0.547 + ], + "angle": 0, + "content": "High intra-modal similarity, e.g. between two images as seen in Fig. 1, can inadvertently enhance similarity among negative pairs, inflating the denominator of the loss function in Equation (1), and, consequently, hurting the model's ability to differentiate between positive and negative pairs during training. A conventional method to counter this involves incorporating hard negative pairs, a strategy Oh et al. [33] employ by mixing embeddings from different modalities. While effective, this cross-modal mixup may obscure the semantic clarity of embeddings. As an alternative we propose increasing the dataset with additional positive pairs that exhibit minimal semantic overlap by integrating expert annotations. Fig. 3 compares the positive and negative pair creation in eCLIP with traditional CLIP and \\( m^2 \\)-mixup." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.571, + 0.604, + 0.587 + ], + "angle": 0, + "content": "3.2 Introducing Expert Annotations to CLIP" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.598, + 0.789, + 0.779 + ], + "angle": 0, + "content": "Our objective with eCLIP is to enhance the CLIP framework by integrating expert annotations - radiologist eye-gaze heatmaps - to diversify the pool of positive samples. The eCLIP model is designed to be compatible across all CLIP variants without modifying its core architecture. The heatmap processor (Fig. 2, right) first converts the images and heatmaps into a sequence of patches and applies multi-headed attention (MHA) over the sequences. The patched heatmap overlaid images serve as queries, while the original image's patches act as keys and values. The processed output is then reconstructed back to its original image format, enabling the standard CLIP image encoder to obtain expert image embeddings. These new embeddings and their text embedding pair introduce additional positive samples for the contrastive loss objective (Fig. 3, right)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.789, + 0.841 + ], + "angle": 0, + "content": "However, the size of the expert annotated data is orders of magnitude smaller than the data available for CLIP training. To effectively leverage the scarce expert-annotated data, we implement mixup augmentation [62]. As illustrated in Fig. 2 (left), this involves blending an original image \\( I_{i} \\) with its expert version" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.686, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "code_caption", + "bbox": [ + 0.217, + 0.146, + 0.451, + 0.162 + ], + "angle": 0, + "content": "Algorithm 1 eCLIP Algorithm" + }, + { + "type": "algorithm", + "bbox": [ + 0.217, + 0.164, + 0.787, + 0.47 + ], + "angle": 0, + "content": "Require: Image Encoder \\(f(\\cdot)\\) // Compute Total Loss \nRequire: Text Encoder \\(g(\\cdot)\\) \n1: \\(\\mathcal{L}_{\\mathrm{priming}} \\gets 0; n_{\\mathrm{p}} \\gets 0\\) \n2: for minibatch \\(\\{x_i\\}_{i=1}^N\\) do \n3: Unpack \\(x_i\\) to \\((T_i, I_i)\\) and optionally \\(E_i\\) \n4: \\(t_i \\gets g(T_i)\\) \n5: \\(v_i \\gets f(I_i)\\) \n6: \\(p_{\\mathrm{uni}} \\sim \\mathrm{Uniform}(0,1)\\) \n7: if \\(p_{\\mathrm{uni}} < p_{\\mathrm{curr}}\\) and \\(E_i\\) is provided then \n8: // Process expert image \n9: \\(\\lambda \\sim \\mathrm{Beta}(\\alpha, \\alpha)\\) \n10: \\(I_i^E \\gets \\mathrm{HeatmapProcessor}(I_i, E_i)\\) \n11: \\(I_i^\\lambda \\gets I_i\\lambda + I_i^E(1 - \\lambda)\\) \n12: \\(v_i^\\lambda \\gets f(I_i^\\lambda)\\) \n13: end if \n14: if \\(E_i\\) is entirely ones then \n15: \\(I_i^R \\gets \\mathrm{HeatmapProcessor}(I_i, E_i)\\) \n16: \\(\\mathcal{L}_{\\mathrm{priming}} \\gets \\mathcal{L}_{\\mathrm{priming}} + (I_i - I_i^R)^2\\) \n17: \\(n_{\\mathrm{p}} \\gets n_{\\mathrm{p}} + 1\\) \n18: end if \n19: end for" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.502, + 0.785, + 0.579 + ], + "angle": 0, + "content": "\\(I_{i}^{E}\\) to create \\(I_{i}^{\\lambda} = \\lambda I_{i} + (1 - \\lambda)I_{i}^{E}\\), where \\(\\lambda \\sim \\mathrm{Beta}(\\alpha, \\alpha)\\). (We set \\(\\alpha = 0.3\\) in all our experiments.) The eCLIP image encoder then processes \\(I_{i}^{\\lambda}\\) to produce the image embedding \\(v_{i}^{\\lambda} = f(I_{i}^{\\lambda})\\). These expert embeddings form new positive pairs \\((v_{i}^{\\lambda}, t_{i})\\) as well as corresponding negative pairs, which are added with existing pairs \\((v_{i}, t_{i})\\) during the computation of the CLIP InfoNCE Loss, \\(\\mathcal{L}_{i}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.581, + 0.787, + 0.732 + ], + "angle": 0, + "content": "To seamlessly integrate expert annotations without disrupting the foundational training of the eCLIP model, we employ a phased curriculum learning strategy [2]. This approach comprises a cold start phase where the model is initially trained without the expert annotations to establish a robust baseline. This phase accounts for about \\(10\\%\\) of the total training iterations. It then transitions into a warmup phase, gradually increasing the inclusion of expert examples from 0.05 to 0.5 probability over the next \\(30\\%\\) of iterations. Finally, a cooldown phase reduces expert example probability to 0.1 for the subsequent \\(40\\%\\) of iterations, fine-tuning the model's performance by balancing foundational and expert-driven insights." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Additionally, we regularize the heatmap processor to behave as an identity function in scenarios where the heatmap is entirely composed of ones. We achieve this through a priming phase that coincides with the curriculum learning's cold start phase. We setup an auxiliary mean-squared error loss to force the heatmap processor to reconstruct the original image \\( I_{i} \\) when the heatmap \\( E_{i} = 1 \\). This priming ensures the heatmap processor's adaptability, allowing it to process expert annotations effectively when available, while falling back to the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "model's original performance in their absence. The total loss during this phase is, \\(\\mathcal{L}_{\\mathrm{total}} = w_{\\mathrm{p}}\\cdot \\mathcal{L}_{\\mathrm{priming}} + (1 - w_{\\mathrm{p}})\\cdot \\mathcal{L}_{\\mathrm{clip}}\\), where \\(w_{\\mathrm{p}}\\) is a hyperparameter which we set to 0.1. The pseudocode for eCLIP is shown in Algorithm 1." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.215, + 0.376, + 0.232 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.245, + 0.788, + 0.351 + ], + "angle": 0, + "content": "Our experiments are designed to evaluate the influence of expert heatmap annotations on the quality of the learned representations. Unless stated otherwise, we assume that a large set of image-text pairs, of which a small fraction is annotated with eye-gaze heatmaps, is used for training, but for test samples no annotations are used. We utilize both quantitative measures and qualitative assessments to study the contributions of these annotations towards enhancing model performance. The source code is available online." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.373, + 0.312, + 0.388 + ], + "angle": 0, + "content": "4.1 Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.396, + 0.789, + 0.593 + ], + "angle": 0, + "content": "Baselines To validate our approach, we compare eCLIP against a model trained using traditional CLIP (referred to as the base model) and a \"naive\" baseline, where the expert annotated samples are directly added to the training set without using mixup or curriculum learning. We also examine the impact of two mixup methods: Domain Agnostic Contrastive Learning (DACL) [49] and \\( m^3 \\)-mixup [33] which blends image and text embeddings to improve alignment and uniformity across modalities. While DACL is integrated during pretraining, \\( m^3 \\)-mixup is applied post-pretraining, in a manner akin to fine-tuning. eCLIP can be applied to any variant of CLIP, which we demonstrate also with GLoRIA [15] which has a Resnet50 image encoder. We introduce two variants of our technique: eCLIP, which integrates expert annotations during the initial CLIP pretraining phase, and eCLIP\\(^{\\mathcal{P}}\\), which instead continually finetunes a trained CLIP model with expert annotations, similar to \\( m^3 \\)-mixup." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.72 + ], + "angle": 0, + "content": "Datasets For pretraining phase we utilize the MIMIC-CXR dataset [21], which pairs roughly 200K chest X-rays with free-text radiology reports. The images were processed into JPEG format as described in [20], and the accompanying reports were stripped of unnecessary punctuation and tokenized using the Wordpiece scheme [7]. We obtain the eye-gaze heatmap from the EGD-CXR dataset [6] and process the eye-tracking data to obtain the normalized eye-gaze heatmap which are available for 1080 datapoints." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Our evaluation setup includes multiple publicly available chest X-ray datasets, specifically CheXpert [17], RSNA Pneumonia [39], NIH CXR [53] and Open-I [6], each offering a distinct set of imaging and reporting characteristics. Following previous works [15, 54, 59], we prepare the test sets from MIMIC and CheXpert, selecting 200 random samples for five specific pathologies from the CheXpert competition, resulting in 1000 samples for each dataset (MIMIC 5x200 and CheXpert 5x200, respectively). For the NIH-CXR dataset, we assembled a subset of 100 samples for each of 14 abnormalities, thereby creating CXR 14x100" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.686, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.147, + 0.784, + 0.207 + ], + "angle": 0, + "content": "test set. The Open-I dataset is utilized for text retrieval and radiology report generation tasks. For linear probe evaluations, we use CXR-8 [53], RSNA dataset and construct an OpenI-5 dataset by extracting labels from the 'Problems' field within the reports that match the CheXpert competition labels." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.227, + 0.785, + 0.468 + ], + "angle": 0, + "content": "Training We employed CLIP pretraining on the MIMIC-CXR dataset, utilizing a subset with roughly 1000 images with expert eye-gaze heatmap annotations, while validation and all other downstream evaluations proceed without these annotations. Our model architecture includes Swin Tiny, following recent studies [54,59], alongside Vision Transformer (ViT) Small and Base, with image encoders pretrained on ImageNet and Clinical BERT [1] with max length of sequences set to 256 as the text encoder. We cropped images to (224, 224) using random resized crop augmentation and turned off all other image augmentations. Pretraining utilized 8 AMD MI250X GPUs, maintaining an effective batch size of 512 for 10,000 steps. The learning rate was \\(1e^{-4}\\) for standard CLIP, increased to \\(2e^{-4}\\) for eCLIP variants, with cosine annealing plus a linear warmup for the first \\(10\\%\\) of iterations, weight decay of \\(1e^{-3}\\), and learnable temperature parameter in the contrastive loss initialized at 0.07. Models for \\(m^3\\)-mixup and \\(\\mathrm{eCLIP}^{\\mathcal{P}}\\) are initialized with weights from CLIP pretraining and further finetuned for 1,000 iterations with a learning rate of \\(1e^{-5}\\). Detailed setup information is available in the Supplement." + }, + { + "type": "title", + "bbox": [ + 0.219, + 0.489, + 0.51, + 0.504 + ], + "angle": 0, + "content": "4.2 Zero-shot Image Classification" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.512, + 0.785, + 0.646 + ], + "angle": 0, + "content": "Following CLIP [36], our zero-shot classification method categorizes images into predefined classes without direct finetuning, thus relying on the quality of embeddings generated during pretraining. To formulate the embedding of each class label, we first generate descriptive prompts to obtain a list of text embeddings corresponding to the label using the text encoder [15, 54, 59]. The mean of these embeddings is taken as the representation of the label. For each image, classification is then performed by matching the image embedding with its closest label embedding through cosine similarity. More details of the prompts used are provided in the Supplement." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.648, + 0.784, + 0.766 + ], + "angle": 0, + "content": "Tab. 1 illustrates the zero-shot classification performance on CheXpert 5x200, MIMIC 5x200, RSNA, and CXR 14x100 datasets. The results, based on macro-averaged F1 scores from three random initializations, highlight eCLIP variants' superior performance over the base models across all datasets. While the \\( m^3 \\)-mixup excels in MIMIC for certain architectures, eCLIP variants show broader generalization. Notably, eCLIP's advantages are more pronounced in multi-class scenarios (CheXpert, MIMIC and CXR14) compared to binary classification on RSNA." + }, + { + "type": "title", + "bbox": [ + 0.219, + 0.788, + 0.405, + 0.803 + ], + "angle": 0, + "content": "4.3 Sample Efficiency" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Sample efficiency measures how well a model learns from limited amount of training data. eCLIP improves this efficiency by using expert annotated im" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 1: Zero-shot classification performance on 4 X-ray datasets and model configurations, reported as macro-averaged F1 scores from three independent random seeds. The highest score per dataset and model configuration is underlined. The overall best-performing model for each dataset is highlighted in bold." + }, + { + "type": "table", + "bbox": [ + 0.246, + 0.213, + 0.761, + 0.621 + ], + "angle": 0, + "content": "
ModelDataset
Chexpert 5x200MIMIC 5x200RSNACXR 14x100
GLoRIAResnet500.478±.0230.457±.0160.736±.0240.155±.001
+naive0.391±.0690.334±.0570.731±.0230.113±.024
+DACL0.506±.0290.430±.0110.736±.0070.158±.004
+m3-mix0.512±.0050.467±.0040.760±.0060.160±.003
+expert (ours)0.507±.0040.430±.0090.761±.0170.156±.023
+expertP(ours)0.507±.0050.475±.0080.775±.0010.159±.001
CLIPSwin Tiny0.517±.0250.452±.0020.808±.0000.169±.003
+naive0.532±.0100.452±.0220.807±.0070.167±.007
+DACL0.465±.0080.389±.0150.768±.0180.101±.013
+m3-mix0.554±.0060.469±.0080.802±.0040.179±.008
+expert (ours)0.549±.0160.445±.0210.818±.0040.172±.006
+expertP(ours)0.558±.0040.463±.0070.819±.0000.192±.003
CLIPViT Small0.525±.0240.441±.0060.807±.0060.159±.007
+naive0.534±.0160.440±.0190.805±.0040.156±.017
+DACL0.475±.0250.398±.0150.761±.0090.133±.007
+m3-mix0.557±.0020.454±.0030.809±.0020.164±.002
+expert (ours)0.545±.0160.452±.0130.803±.0030.165±.007
+expertP(ours)0.559±.0010.439±.0040.817±.0010.165±.004
CLIPViT Base0.540±.0170.465±.0040.805±.0010.183±.011
+naive0.506±.0110.426±.0060.805±.0040.151±.009
+DACL0.474±.0070.400±.0020.759±.0010.106±.003
+m3-mix0.542±.0210.465±.0130.798±.0040.183±.020
+expert (ours)0.563±.0210.477±.0040.814±.0030.193±.017
+expertP(ours)0.549±.0030.452±.0070.810±.0010.185±.002
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.842 + ], + "angle": 0, + "content": "ages to form new positive and negative pairs, aiming to improve the quality of the learned embeddings. To test this, we first looked at zero-shot classification performance, adjusting the number of training batches available for pretraining. Results, shown in Fig. 4 (top row), reveal that eCLIP is more sample efficient across MIMIC 5x200, CheXpert 5x200 and CXR 14x100 datasets compared to the base model. Additionally, by applying supervised fine-tuning (SFT) with a linear probe on class-imbalanced datasets - CXR-8, RSNA and OpenI-5 (Sec. 4.1) - eCLIP demonstrates stronger performance in multi-label classification tasks, CXR-8 and OpenI-5 and remains competitive in binary classification for RSNA. This is shown in Fig. 4 (bottom row) where we plot the ROC AUC scores against different training sample sizes for linear probing. These findings highlight eCLIP's ability to effectively learn from fewer samples." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.686, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.277, + 0.147, + 0.425, + 0.238 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.431, + 0.147, + 0.576, + 0.238 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.58, + 0.147, + 0.73, + 0.238 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.277, + 0.244, + 0.427, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.431, + 0.244, + 0.576, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.581, + 0.244, + 0.727, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.348, + 0.788, + 0.404 + ], + "angle": 0, + "content": "Fig. 4: Sample Efficiency. (top row) Zero-shot performance on three multi-label classification test sets for CLIP and eCLIP Swin Tiny models, trained with varying amounts of training batches. (bottom row) Linear probe scores with varying amounts of training data." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.435, + 0.735, + 0.451 + ], + "angle": 0, + "content": "4.4 Text retrieval and retrieval augmented generation (RAG)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.462, + 0.788, + 0.657 + ], + "angle": 0, + "content": "To compare eCLIP's cross-modal functionality with that of CLIP we focused on text retrieval task using the Open-I dataset, which consists of pairs of X-rays and radiology reports. We used the FAISS vector database [8] to index the text embeddings generated by the text encoder. For a given X-ray image \\( I_{i} \\), we then retrieve the closest text reports from the database based on the cosine similarity in the embedding space, \\( \\min_j(v_i\\cdot t_j) \\). Results in Tab. 2 compare the performance of eCLIP against CLIP in text retrieval measured in Recall@1, 5, and 10. The performance of eCLIP indicates a notable improvement in its embedding quality. Note that our evaluation followed a strict criterion for recall computation, where a retrieval was counted as successful only if the exact correct report was identified. While more nuanced measures based on semantic similarity could be employed [59], we opted this approach to maintain a clear and simple evaluation framework." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Next we extend our analysis from retrieval to report generation using a frozen Large Language Model (LLM), Mistral 7B Instruct v2 [19], aiming to generate radiology reports through Retrieval Augmented Generation (RAG). This setup tests the CLIP model's capacity to retrieve texts which can be used to prompt an LLM to generate a report without finetuning on medical data. First we randomly selected 389 samples from the Open-I dataset for testing and utilized the FAISS database to index the reports from the remaining samples (i.e., training set). Given a test image we retrieve five closest reports from the training set and use them in the prompt for the LLM to generate a report for the test image. The eCLIP variant showed a small but consistent improvement over the base model in generating reports, as indicated in Tab. 3. A comparative analysis of generated report versus ground truth shown in Tab. 5, with discrepancies marked, further" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.493, + 0.188 + ], + "angle": 0, + "content": "Table 2: Performance on Image to Report retrieval with Open-I dataset. We report the Recall@{1, 5, 10}" + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.199, + 0.472, + 0.349 + ], + "angle": 0, + "content": "
ModelR@1R@5R@10
CLIP_Swin_Tiny3.17.611.3
+m3-mix2.46.59.8
+expert (ours)3.79.413.4
+expertP(ours)3.18.211.7
CLIP_ViT_Base3.79.213.2
+m3-mix4.18.813.0
+expert (ours)4.410.313.5
+expertP(ours)3.99.413.2
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.359, + 0.493, + 0.471 + ], + "angle": 0, + "content": "Table 3: Performance on report generation with Open-I dataset. We report the BLEU-2 score (BL-2), BERT recall score [64] (B-R), Cosine similarity between the sentence embeddings of the generated and ground-truth report for MPNet [42] Sentence Transformer model [38] \\((\\mathrm{S}_{emb})\\) ,and for the CheXBERT model [41] \\((\\mathrm{CB}_{emb})\\)" + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.482, + 0.508, + 0.555 + ], + "angle": 0, + "content": "
ModelBL-2B-RSembCBemb
CLIP0.1720.7130.7910.492
+m3-mix0.1720.7110.7880.496
eCLIP0.1770.7120.7950.506
" + }, + { + "type": "table_caption", + "bbox": [ + 0.508, + 0.145, + 0.788, + 0.352 + ], + "angle": 0, + "content": "Table 4: Ablation Study with Swin Tiny. Zero-shot performance on CheXpert (CXP) and CXR14 (C14) datasets for the base CLIP and models with expert annotation integration \\((+\\mathrm{E})\\) is presented. Methods include mask multiplication \\((\\odot)\\), CNN, and Multi-headed Attention (MHA) encoders. Key augmentations: Mixup \\((+\\mathrm{M})\\), Curriculum Learning \\((+\\mathrm{C})\\), and Encoder Priming \\((+\\mathrm{P})\\) demonstrate performance gains. A control with a random mask (rand) confirms the significance of expert annotations. We report macro-averaged F1 scores from three random initialization" + }, + { + "type": "table", + "bbox": [ + 0.51, + 0.366, + 0.792, + 0.564 + ], + "angle": 0, + "content": "
MethodCXPC14
Base0.517±.0240.169±.003
⊗ Mask (+ E)0.540±.0190.165±.006
CNN Encoder (+ E)0.534±.0120.163±.008
MHA Encoder (+ E)0.534±.0130.153±.002
MHA Encoder (+ E, M)0.532±.0180.160±.010
MHA Encoder (+ E, M, C)0.545±.0080.173±.018
MHA Encoder (+ rand, M, C, P)0.537±.0200.166±.003
MHA Encoder (+ E, M, C, P)0.549±.0160.172±.006
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.588, + 0.785, + 0.634 + ], + "angle": 0, + "content": "validates the effectiveness of eCLIP's embeddings in supporting complex cross-modal tasks. Additional details, including LLM prompts and generated report samples are available in the Supplement." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.652, + 0.424, + 0.669 + ], + "angle": 0, + "content": "4.5 Embedding Quality" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.81 + ], + "angle": 0, + "content": "For qualitative evaluations, we first examine the histogram of the cosine similarities of the embeddings from different abnormality subgroups obtained from the CLIP image encoder. In Fig. 5 (top row), we can see that the similarities for the CLIP model has considerably dropped below 1 after continual pretraining on MIMIC-CXR compared to Fig. 1. This indicates that the model's ability to distinguish between different conditions has improved. The introduction of expert annotations in the eCLIP variant further improves this with mean cosine similarities for 'normal' versus cardiomegaly, atelectasis and opacity dropping to 0.36, 0.4 and 0.4 respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Our evaluation of uniformity and alignment reveals that eCLIP surpasses both the MIMIC-pretrained and internet-pretrained models in these key metrics," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.685, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 5: Random samples of generated report. For each image in the Open-I dataset, the five closest text snippets based on embedding cosine similarity is used as prompts for Mistral 7B LLM. Utilizing in-context learning, we prompt the LLM with two such snippet-report pairs. The conditions that the generated report identified correctly are highlighted in green while those it missed are shown in red." + }, + { + "type": "table", + "bbox": [ + 0.224, + 0.226, + 0.775, + 0.504 + ], + "angle": 0, + "content": "
ProblemsGround TruthGenerated
normalThe lungs and pleural spaces show no acute abnormality. Heart size and pulmonary vascularity within normal limits.The lungs are clear with no evidence of consolidation, pneumothorax, or pleural effusion. Heart size and mediastinal contour are normal. No acute abnormalities noted in the visualized osseous structures.
Pulmonary At-electasis. Pleural Effusion. Cardiomegaly. Pulmonary CongestionAP and lateral views were obtained. Bibasilar atelectasis and small left-sided pleural effusion. Stable cardiomegaly. No pneumothorax. Mild pulmonary vascular congestion.The lungs show bibasilar airspace opacities, possibly due to infection or atelectasis. Heart size is mildly enlarged. No pneumothorax or pleural effusion.
Lung. Density. EmphysemaThere is hyperexpansion. The heart size is normal. There is no pleural effusion or pneumothorax. Two circular densities overlying the right ribs which were not present in the XXXX CT. No focal infiltratesThe lungs are hyperexpanded with clear fields and no acute consolidations or pleural effusions. Heart size and pulmonary vascularity are within normal limits. Degenerative changes are present in the thoracic spine. A calcified granuloma is noted in the left perihilar region. No pneumothorax or large pleural effusion is observed.
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.533, + 0.788, + 0.624 + ], + "angle": 0, + "content": "indicating a marked improvement in the quality of embeddings (Fig. 5, bottom left). We also note a modest decrease in the modality gap with eCLIP (Fig. 5, bottom center). Clustering analysis via K-means (with \\( k = 5 \\) for 5 abnormalities in data) highlights eCLIP's superior performance in grouping abnormalities, as seen from improved scored in Normalized Mutual Information (NMI), Silhouette score, and Calinski-Harabasz (CH) index (Fig. 5, bottom right)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.647, + 0.39, + 0.663 + ], + "angle": 0, + "content": "4.6 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Our ablation study with the Swin Tiny encoder shows the impact of key components in our eCLIP model: multi-headed attention (MHA) layer for heatmap processing, curriculum learning for phased introduction of expert annotations, mixup augmentation to compensate for limited number of export annotated data and priming of heatmap processor during initial training phase. Results shown in Tab. 4 reveal that the MHA-based heatmap processor improves zero-shot classification performance on CheXpert 5x200 and CXR 14x100 datasets compared to basic methods like direct application of heatmaps as mask (\\(\\odot\\)Mask) or using a CNN encoder. We note a significant performance drop with randomly generated heatmaps versus expert eye-gaze heatmaps. This highlights that while our methodological improvements contribute to the performance gains, the in" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.146, + 0.377, + 0.239 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.38, + 0.147, + 0.503, + 0.239 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.505, + 0.147, + 0.629, + 0.239 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.632, + 0.147, + 0.754, + 0.239 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.249, + 0.244, + 0.425, + 0.333 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.434, + 0.244, + 0.58, + 0.332 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.604, + 0.244, + 0.756, + 0.341 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.356, + 0.788, + 0.438 + ], + "angle": 0, + "content": "Fig. 5: Qualitative Analysis of CLIP Pretraining. top row illustrates the cosine similarity distributions for CLIP and eCLIP image embeddings. bottom left and center sections display uniformity, alignment, and modality gap comparisons among the internet pretrained model (ZS), CLIP pretrained on MIMIC, and eCLIP. bottom right details K-means clustering metrics for image embeddings with \\( k = 5 \\) for both CLIP and eCLIP models." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.47, + 0.785, + 0.499 + ], + "angle": 0, + "content": "tegration of meaningful, expert-derived signals is essential for achieving optimal results." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.526, + 0.36, + 0.541 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.559, + 0.788, + 0.697 + ], + "angle": 0, + "content": "We introduce eCLIP, an adaptation of CLIP, demonstrating the integration of radiologist eye-tracking heatmap to overcome challenges faced in multi-modal contrastive learning. This study highlights the impact of integrating these high-quality expert annotations on improving the quality of learned embeddings and assess its influence on sample efficiency and cross-modal retrieval tasks. An important future research direction would be extending this approach to include expert annotations from the text modality (e.g., by adapting SimCSE [9]) and to leverage the temporal dynamics of eye-tracking data by aligning the sequential frames with the corresponding report snippets." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "**Limitations** Our study is limited by the small size of expert annotated data and thus does not comprehensively analyze the impact of size or distribution of expert annotations across different abnormalities. eCLIP also incurs extra computational costs during training due to the additional forward pass required for processing expert images in the warmup and cool-down phases. Additionally, the clinical relevance of generated radiology reports has not been validated by medical experts, relying instead on standard metrics known for potential biases and inaccuracies in reflecting clinical accuracy [60]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.685, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.181, + 0.788, + 0.287 + ], + "angle": 0, + "content": "This work was supported by the Research Council of Finland (Flagship programme: Finnish Center for Artificial Intelligence FCAI, and grants 352986, 358246) and EU (H2020 grant 101016775 and NextGenerationEU). We acknowledge the computational resources provided by Aalto Science-IT project. We acknowledge CSC for awarding this project access to the LUMI supercomputer, owned by the EuroHPC Joint Undertaking, hosted by CSC (Finland) and the LUMI consortium through Finland." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.313, + 0.323, + 0.329 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.348, + 0.785, + 0.39 + ], + "angle": 0, + "content": "1. Alsentzer, E., Murphy, J.R., Boag, W., Weng, W.H., Jin, D., Naumann, T., McDermott, M.: Publicly available clinical BERT embeddings. arXiv preprint arXiv:1904.03323 (2019) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.392, + 0.785, + 0.432 + ], + "angle": 0, + "content": "2. Bengio, Y., Louradour, J., Collobert, R., Weston, J.: Curriculum learning. In: Proceedings of the 26th Annual International Conference on Machine Learning. pp. 41-48 (2009) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.434, + 0.785, + 0.489 + ], + "angle": 0, + "content": "3. Bigolin Lanfredi, R., Zhang, M., Auffermann, W.F., Chan, J., Duong, P.A.T., Srikumar, V., Drew, T., Schroeder, J.D., Tasdizen, T.: REFLACX, A dataset of reports and eye-tracking data for localization of abnormalities in chest x-rays. Scientific Data 9(1), 350 (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.49, + 0.785, + 0.531 + ], + "angle": 0, + "content": "4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607. PMLR (2020) 1, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.532, + 0.785, + 0.587 + ], + "angle": 0, + "content": "5. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.588, + 0.785, + 0.643 + ], + "angle": 0, + "content": "6. Demner-Fushman, D., Kohli, M.D., Rosenman, M.B., Shooshan, S.E., Rodriguez, L., Antani, S., Thoma, G.R., McDonald, C.J.: Preparing a collection of radiology examinations for distribution and retrieval. Journal of the American Medical Informatics Association 23(2), 304-310 (2016) 2, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.644, + 0.785, + 0.685 + ], + "angle": 0, + "content": "7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.686, + 0.785, + 0.728 + ], + "angle": 0, + "content": "8. Douze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.E., Lomeli, M., Hosseini, L., Jégou, H.: The faiss library. arXiv preprint arXiv:2401.08281 (2024) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.785, + 0.756 + ], + "angle": 0, + "content": "9. Gao, T., Yao, X., Chen, D.: SimCSE: Simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821 (2021) 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.757, + 0.785, + 0.798 + ], + "angle": 0, + "content": "10. Geng, X., Liu, H., Lee, L., Schuurmans, D., Levine, S., Abbeel, P.: M3AE: Multimodal masked autoencoders learn transferable representations. Tech. rep., Technical Report 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "11. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: CyCLIP: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022) 2, 4" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.348, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "12. Gu, S., Clark, C., Kembhavi, A.: I can't believe there's no images! learning visual tasks using only language supervision. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2672-2683 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.245 + ], + "angle": 0, + "content": "13. Han, Z., Liang, Z., Yang, F., Liu, L., Li, L., Bian, Y., Zhao, P., Wu, B., Zhang, C., Yao, J.: Umix: Improving importance weighting for subpopulation shift via uncertainty-aware mixup. Advances in Neural Information Processing Systems 35, 37704-37718 (2022) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.787, + 0.286 + ], + "angle": 0, + "content": "14. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.787, + 0.342 + ], + "angle": 0, + "content": "15. Huang, S.C., Shen, L., Lungren, M.P., Yeung, S.: Gloria: A multimodal global-local representation learning framework for label-efficient medical image recognition. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3942-3951 (2021) 2, 4, 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.343, + 0.787, + 0.383 + ], + "angle": 0, + "content": "16. Huang, Z., Bianchi, F., Yuksekgonul, M., Montine, T.J., Zou, J.: A visual-language foundation model for pathology image analysis using medical twitter. Nature Medicine 29(9), 2307-2316 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.787, + 0.438 + ], + "angle": 0, + "content": "17. Irvin, J., Rajpurkar, P., Ko, M., Yu, Y., Ciurea-Ilicus, S., Chute, C., Marklund, H., Haghgoo, B., Ball, R., Shpanskaya, K., et al.: CheXpert: A large chest radiograph dataset with uncertainty labels and expert comparison. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 33, pp. 590-597 (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.787, + 0.493 + ], + "angle": 0, + "content": "18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International Conference on Machine Learning. pp. 4904-4916. PMLR (2021) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.787, + 0.535 + ], + "angle": 0, + "content": "19. Jiang, A.Q., Sablayrolles, A., Mensch, A., Bamford, C., Chaplot, D.S., Casas, D.d.l., Bressand, F., Lengyel, G., Lample, G., Saulnier, L., et al.: Mistral 7B. arXiv preprint arXiv:2310.06825 (2023) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.787, + 0.563 + ], + "angle": 0, + "content": "20. Johnson, A., Lungren, M., Peng, Y., Lu, Z., Mark, R., Berkowitz, S., Horng, S.: MIMIC-CXR-JPG-Chest radiographs with structured labels. PhysioNet (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.787, + 0.618 + ], + "angle": 0, + "content": "21. Johnson, A.E., Pollard, T.J., Berkowitz, S.J., Greenbaum, N.R., Lungren, M.P., Deng, C.y., Mark, R.G., Horng, S.: MIMIC-CXR, a de-identified publicly available database of chest radiographs with free-text reports. Scientific data 6(1), 317 (2019) 5, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.62, + 0.787, + 0.674 + ], + "angle": 0, + "content": "22. Karargyris, A., Kashyap, S., Lourentzou, I., Wu, J.T., Sharma, A., Tong, M., Abedin, S., Beymer, D., Mukherjee, V., Krupinski, E.A., et al.: Creation and validation of a chest X-ray dataset with eye-tracking and report dictation for AI development. Scientific Data 8(1), 92 (2021) 3, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.787, + 0.702 + ], + "angle": 0, + "content": "23. Krishnan, R., Rajpurkar, P., Topol, E.J.: Self-supervised learning in medicine and healthcare. Nature Biomedical Engineering 6(12), 1346-1352 (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.703, + 0.787, + 0.742 + ], + "angle": 0, + "content": "24. Li, Y., Fan, H., Hu, R., Feichtenhofer, C., He, K.: Scaling language-image pretraining via masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23390-23400 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.743, + 0.787, + 0.785 + ], + "angle": 0, + "content": "25. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.786, + 0.787, + 0.812 + ], + "angle": 0, + "content": "26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. arXiv preprint arXiv:2304.08485 (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.787, + 0.84 + ], + "angle": 0, + "content": "27. McInnes, L., Healy, J., Melville, J.: UMAP: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 3" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.686, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "28. Mo, S., Kim, M., Lee, K., Shin, J.: S-clip: Semi-supervised vision-language learning using few specialist captions. Advances in Neural Information Processing Systems 36 (2024) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.787, + 0.233 + ], + "angle": 0, + "content": "29. Moor, M., Huang, Q., Wu, S., Yasunaga, M., Dalmia, Y., Leskovec, J., Zakka, C., Reis, E.P., Rajpurkar, P.: Med-flamingo: a multimodal medical few-shot learner. In: Machine Learning for Health (ML4H). pp. 353-367. PMLR (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.234, + 0.787, + 0.274 + ], + "angle": 0, + "content": "30. Mu, N., Kirillov, A., Wagner, D., Xie, S.: Slip: Self-supervision meets language-image pre-training. In: European Conference on Computer Vision. pp. 529-544. Springer (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.276, + 0.787, + 0.317 + ], + "angle": 0, + "content": "31. Naeem, M.F., Xian, Y., Zhai, X., Hoyer, L., Van Gool, L., Tombari, F.: SILC: Improving vision language pretraining with self-distillation. arXiv preprint arXiv:2310.13355 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.318, + 0.787, + 0.347 + ], + "angle": 0, + "content": "32. Nukrai, D., Mokady, R., Globerson, A.: Text-only training for image captioning using noise-injected clip. arXiv preprint arXiv:2211.00575 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.348, + 0.787, + 0.389 + ], + "angle": 0, + "content": "33. Oh, C., So, J., Byun, H., Lim, Y., Shin, M., Jeon, J.J., Song, K.: Geodesic multi-modal mixup for robust fine-tuning. Advances in Neural Information Processing Systems 36 (2023) 2, 3, 4, 5, 6, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.39, + 0.787, + 0.418 + ], + "angle": 0, + "content": "34. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018) 1, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.419, + 0.787, + 0.46 + ], + "angle": 0, + "content": "35. Palepu, A., Beam, A.: Tier: Text-image entropy regularization for medical clip-style models. In: Machine Learning for Healthcare Conference. pp. 548-564. PMLR (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.461, + 0.787, + 0.516 + ], + "angle": 0, + "content": "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021) 1, 2, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.517, + 0.787, + 0.559 + ], + "angle": 0, + "content": "37. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.56, + 0.787, + 0.615 + ], + "angle": 0, + "content": "38. Reimers, N., Gurevych, I.: Sentence-BERT: Sentence embeddings using siamese BERT-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 3982-3992 (2019) 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.616, + 0.787, + 0.685 + ], + "angle": 0, + "content": "39. Shih, G., Wu, C.C., Halabi, S.S., Kohli, M.D., Prevedello, L.M., Cook, T.S., Sharma, A., Amorosa, J.K., Arteaga, V., Galperin-Aizenberg, M., et al.: Aug-mentation the national institutes of health chest radiograph dataset with expert annotations of possible pneumonia. Radiology: Artificial Intelligence 1(1), e180041 (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.687, + 0.787, + 0.741 + ], + "angle": 0, + "content": "40. Singh, A., Hu, R., Goswami, V., Couairon, G., Galuba, W., Rohrbach, M., Kiela, D.: Flava: A foundational language and vision alignment model. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15638-15650 (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.742, + 0.787, + 0.798 + ], + "angle": 0, + "content": "41. Smit, A., Jain, S., Rajpurkar, P., Pareek, A., Ng, A.Y., Lungren, M.: Combining automatic labelers and expert annotations for accurate radiology report labeling using BERT. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). pp. 1500-1519 (2020) 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "42. Song, K., Tan, X., Qin, T., Lu, J., Liu, T.Y.: MPNet: Masked and permuted pretraining for language understanding. Advances in Neural Information Processing Systems 33, 16857-16867 (2020) 12" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.461, + 0.128 + ], + "angle": 0, + "content": "Y. Kumar and P. Marttinen" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "43. van Sonsbeek, T., Zhen, X., Mahapatra, D., Worring, M.: Probabilistic integration of object level annotations in chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3630-3640 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.204, + 0.787, + 0.247 + ], + "angle": 0, + "content": "44. Sowrirajan, H., Yang, J., Ng, A.Y., Rajpurkar, P.: MoCo-CXR: MoCo pretraining improves representation and transferability of chest X-ray models, 2021. URL https://arxiv.org/abs (2010) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.247, + 0.787, + 0.288 + ], + "angle": 0, + "content": "45. Sun, Z., Fang, Y., Wu, T., Zhang, P., Zang, Y., Kong, S., Xiong, Y., Lin, D., Wang, J.: Alpha-CLIP: A clip model focusing on wherever you want. arXiv preprint arXiv:2312.03818 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.289, + 0.787, + 0.331 + ], + "angle": 0, + "content": "46. Tschannen, M., Mustafa, B., Houlsby, N.: CLIPPO: Image-and-language understanding from pixels only. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11006-11017 (2023) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.332, + 0.787, + 0.374 + ], + "angle": 0, + "content": "47. Tu, T., Azizi, S., Driess, D., Schaekermann, M., Amin, M., Chang, P.C., Carroll, A., Lau, C., Tanno, R., Ktena, I., et al.: Towards generalist biomedical ai. NEJM AI 1(3), AIoa2300138 (2024) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.375, + 0.787, + 0.416 + ], + "angle": 0, + "content": "48. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International Conference on Machine Learning. pp. 6438-6447. PMLR (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.417, + 0.787, + 0.459 + ], + "angle": 0, + "content": "49. Verma, V., Luong, T., Kawaguchi, K., Pham, H., Le, Q.: Towards domain-agnostic contrastive learning. In: International Conference on Machine Learning. pp. 10530-10541. PMLR (2021) 3, 4, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.459, + 0.787, + 0.515 + ], + "angle": 0, + "content": "50. Wang, B., Pan, H., Aboah, A., Zhang, Z., Keles, E., Torigian, D., Turkbey, B., Krupinski, E., Udupa, J., Bagci, U.: GazeGNN: A gaze-guided graph neural network for chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2194-2203 (2024) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.516, + 0.787, + 0.557 + ], + "angle": 0, + "content": "51. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2021) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.558, + 0.787, + 0.6 + ], + "angle": 0, + "content": "52. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.601, + 0.787, + 0.668 + ], + "angle": 0, + "content": "53. Wang, X., Peng, Y., Lu, L., Lu, Z., Bagheri, M., Summers, R.M.: ChestX-Ray8: Hospital-scale chest x-ray database and benchmarks on weakly-supervised classification and localization of common thorax diseases. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2097-2106 (2017) 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.67, + 0.787, + 0.711 + ], + "angle": 0, + "content": "54. Wang, Z., Wu, Z., Agarwal, D., Sun, J.: MedCLIP: Contrastive learning from unpaired medical images and text. arXiv preprint arXiv:2210.10163 (2022) 2, 4, 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.712, + 0.787, + 0.769 + ], + "angle": 0, + "content": "55. Weers, F., Shankar, V., Katharopoulos, A., Yang, Y., Gunter, T.: Masked autoencoding does not help natural language supervision at scale. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23432-23444 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.769, + 0.787, + 0.798 + ], + "angle": 0, + "content": "56. Wu, C., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Medklip: Medical knowledge enhanced language-image pre-training. medRxiv pp. 2023-01 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "57. Xu, H., Xie, S., Tan, X.E., Huang, P.Y., Howes, R., Sharma, V., Li, S.W., Ghosh, G., Zettlemoyer, L., Feichtenhofer, C.: Demystifying CLIP data. arXiv preprint arXiv:2309.16671 (2023) 1" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.685, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "eCLIP" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.203 + ], + "angle": 0, + "content": "58. Xu, S., Yang, L., Kelly, C., Sieniek, M., Kohlberger, T., Ma, M., Weng, W.H., Kiraly, A., Kazemzadeh, S., Melamed, Z., et al.: Elixir: Towards a general purpose x-ray artificial intelligence system through alignment of large language models and radiology vision encoders. arXiv preprint arXiv:2308.01317 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.204, + 0.788, + 0.259 + ], + "angle": 0, + "content": "59. You, K., Gu, J., Ham, J., Park, B., Kim, J., Hong, E.K., Baek, W., Roh, B.: CXR-CLIP: Toward large scale chest X-ray language-image pre-training. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 101-111. Springer (2023) 4, 8, 9, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.259, + 0.788, + 0.3 + ], + "angle": 0, + "content": "60. Yu, F., Endo, M., Krishnan, R., Pan, I., Tsai, A., Reis, E.P., Fonseca, E.K.U.N., Lee, H.M.H., Abad, Z.S.H., Ng, A.Y., et al.: Evaluating progress in automatic chest x-ray radiology report generation. Patterns 4(9) (2023) 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.3, + 0.788, + 0.342 + ], + "angle": 0, + "content": "61. Zbontar, J., Jing, L., Misra, I., LeCun, Y., Deny, S.: Barlow twins: Self-supervised learning via redundancy reduction. In: International Conference on Machine Learning. pp. 12310-12320. PMLR (2021) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.342, + 0.788, + 0.37 + ], + "angle": 0, + "content": "62. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017) 3, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.37, + 0.788, + 0.411 + ], + "angle": 0, + "content": "63. Zhang, K., Yang, Y., Yu, J., Jiang, H., Fan, J., Huang, Q., Han, W.: Multi-task paired masking with alignment modeling for medical vision-language pre-training. IEEE Transactions on Multimedia (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.411, + 0.788, + 0.452 + ], + "angle": 0, + "content": "64. Zhang, T., Kishore, V., Wu, F., Weinberger, K.Q., Artzi, Y.: BERTScore: Evaluating text generation with BERT. In: International Conference on Learning Representations (2019) 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.493 + ], + "angle": 0, + "content": "65. Zhang, Y., Jiang, H., Miura, Y., Manning, C.D., Langlotz, C.P.: Contrastive learning of medical visual representations from paired images and text. In: Machine Learning for Healthcare Conference. pp. 2-25. PMLR (2022) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.493, + 0.788, + 0.535 + ], + "angle": 0, + "content": "66. Zhang, Y., HaoChen, J.Z., Huang, S.C., Wang, K.C., Zou, J., Yeung, S.: Diagnosing and rectifying vision models using language. arXiv preprint arXiv:2302.04269 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.577 + ], + "angle": 0, + "content": "67. Zhang, Y., Sui, E., Yeung, S.: Connect, Collapse, Corrupt: Learning cross-modal tasks with uni-modal data. In: The Twelfth International Conference on Learning Representations (2024) 2, 4" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.577 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_origin.pdf b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..cbe8933d71a7d7da0a0b7d986ef34b6ebb31589c --- /dev/null +++ b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/5e801d51-4717-4177-893f-1bbc8c06f5a6_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:58a4cab1bcf4f231165035967df9f86f9e272c168eadbf9ad54dade3c06d059d +size 1544836 diff --git a/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/full.md b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/full.md new file mode 100644 index 0000000000000000000000000000000000000000..83eeebf18780bd5844b7dff25d009bd09edd2718 --- /dev/null +++ b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/full.md @@ -0,0 +1,297 @@ +# Improving Medical Multi-modal Contrastive Learning with Expert Annotations + +Yogesh Kumar and Pekka Marttinen + +Department of Computer Science, Aalto University, Finland {firstname_lastname}@aalto.fi + +Abstract. We introduce eCLIP, an enhanced version of the CLIP model that integrates expert annotations in the form of radiologist eye-gaze heatmaps. It tackles key challenges in contrastive multi-modal medical imaging analysis, notably data scarcity and the "modality gap" - a significant disparity between image and text embeddings that diminishes the quality of representations and hampers cross-modal interoperability. eCLIP integrates a heatmap processor and leverages mixup augmentation to efficiently utilize the scarce expert annotations, thus boosting the model's learning effectiveness. eCLIP is designed to be generally applicable to any variant of CLIP without requiring any modifications of the core architecture. Through detailed evaluations across several tasks, including zero-shot inference, linear probing, cross-modal retrieval, and Retrieval Augmented Generation (RAG) of radiology reports using a frozen Large Language Model, eCLIP showcases consistent improvements in embedding quality. The outcomes reveal enhanced alignment and uniformity, affirming eCLIP's capability to harness high-quality annotations for enriched multi-modal analysis in the medical imaging domain. + +Keywords: Contrastive Learning $\cdot$ Medical Imaging $\cdot$ Zero-shot Inference + +# 1 Introduction + +Pretraining foundation models on multi-modal data - particularly leveraging the relationships between text and images - has proven to be a robust strategy for generating versatile embeddings [18,36]. These embeddings enhance the efficacy in several downstream tasks, from image generation to advanced vision-language integration [26, 37, 40]. Central to this approach is the employment of a contrastive learning (CL) loss objective [4, 34, 61], where models are trained to align positive pairs (e.g., an image and its corresponding caption) while diversifying negative ones. A significant hurdle in this approach is the necessity of vast datasets, often comprising several millions of data points, for competitive results. Models such as CLIP [36] have been trained on internet-scale datasets, estimated to encompass hundreds of millions of image-text pairs [5, 57]. Acquiring datasets of this magnitude poses substantial challenges in specialized fields that require expert knowledge for data collection, processing and annotation. + +![](images/0014a845aec8b23c4efaad74333aaca295140fadad83b26235d68f7c1423d08b.jpg) +Fig. 1: Analysis of CLIP Embeddings in Medical Imaging The figure presents embeddings generated by a CLIP model, pretrained on an internet-scale dataset, applied to the Open-I dataset pairing X-rays with corresponding radiology reports. + +The medical imaging domain exemplifies these difficulties, where acquiring even a single data point, such as a chest X-ray, involves complex processes requiring expertise and significant resources. Moreover, the procurement of such data for machine learning research is further complicated by ethical considerations, patient privacy concerns and the need for extensive de-identification procedures. + +This has led to the prevalent use of foundation models, initialized with weights from models trained on extensive internet-scale datasets, for tasks in the medical domain [15,23,54,65]. However, the areas of interest within medical images are often nuanced and require expert knowledge to interpret, rendering them indistinguishable to a general-purpose model. In Fig. 1a, we investigate the embeddings generated by a CLIP model – initially pretrained on internet data – using samples from the Open-I dataset [6], which includes X-rays and corresponding radiology reports. We categorize the samples into subgroups based on the primary abnormality identified in each report, such as 'normal', cardiomegaly, atelectasis and opacity. A histogram of the cosine similarities between embeddings from different groups indicates a high degree of similarity, with values approaching 1. This could lead to potential challenges in downstream zero-shot inference tasks, which rely on the spatial segregation of embeddings from different groups [36]. Typically, continual pretraining on medically relevant data is employed to enhance the model's ability to differentiate between various abnormalities. + +Recent studies [11, 25, 33, 46, 67] have identified a "modality gap" in multimodal contrastive representation learning, where the embeddings from different modalities (e.g., images and text) fall in distinct regions in the shared embedding space. This separation, which arises from factors such as initial model weights and the objectives of contrastive learning [25, 67], leads to the "cone effect" where + +![](images/440f70b30b3b150fa536e456fd430454245f6df8c8eb23d5dd7fb5a74221e0f2.jpg) +Fig. 2: eCLIP Pretraining with Expert Annotations. eCLIP adds a Heatmap Processor (right), featuring a multi-headed attention layer, to the standard Image and Text encoders in CLIP. This processor, along with vision and text encoders, maps inputs into a shared hypersphere. Here, the original image $(I_i)$ , its text $(T_i)$ and the heatmap-processed image $(I_i^E)$ are positioned within a tripartite area (shown here after 2D UMAP projection, please refer to the Supplement for a scaled version). We employ mixup between $I_i$ and $I_i^E$ to generate the embedding $v_i^\lambda$ , which gives us additional positive pairs to enhance the CLIP InfoNCE loss optimization. An auxiliary loss, $\mathcal{L}_{\mathrm{priming}}$ , is used during the initial training steps to "prime" the heatmap processor to imitate an identity function when the heatmap is composed of all ones. + +embeddings of each modality are restricted to a narrow region of the embedding hypersphere. In Fig. 1b, we illustrate this within the medical domain with a 2D UMAP [27] projection of image and text embeddings. This example highlights how embeddings from the same modality but different semantic groups, such as X-ray images of varying abnormalities, cluster closely together. This makes it difficult for a model to distinguish between semantically different images, undermining its performance in medical image analysis. + +We investigate the potential of integrating expert annotations, specifically radiologist eye-gaze heatmaps, to alleviate these issues. Processing the eye-gaze data from radiologists [22] provides us with heatmaps indicative of the radiologist's attention across different regions of the X-ray images. This heatmap reflects areas of clinical interest aligned with details present in radiology reports. We posit that this could help capture nuanced visual cues in the X-rays and therefore pairing it with reports can enrich the CLIP training data with high-quality positive pairs. Due to the scarcity of such expert annotated data, we employ the mixup strategy, a data augmentation technique which has been effective in both supervised [13,48,62] and contrastive learning [33,49], to create additional synthetic samples. + +We present eCLIP (expert-annotated CLIP), an adaptation of the CLIP model that incorporates expert eye-gaze heatmaps, without modifying the CLIP model's core architecture. The operational workflow of eCLIP is depicted in Fig. 2. Our contributions are as follows: + +- Utilization of Expert Annotations. We harness radiologist eye-gaze heatmaps to create additional embeddings, effectively introducing valuable positive and negative pairs for enhancing the contrastive learning process. +- eCLIP Architecture. Our implementation features a heatmap processing mechanism utilizing multi-headed attention (MHA), optimized for handling both heatmaps and original images. This is complemented by a mixup strategy to addresses the challenge of data scarcity, and curriculum learning to ensure a gradual introduction of expert annotations. +- Comprehensive Evaluation. We assess eCLIP's zero-shot classification accuracy, sample efficiency and cross-modal retrieval performance and embedding quality across multiple chest X-ray datasets. We also evaluate the cross-modal embeddings to generate radiology reports using a frozen Large Language Model (LLM) without explicitly fine-tuning on medical data. + +# 2 Related Work + +Modality Gap: Liang et al. [25] pinpoint the origins of the modality gap to the nuances of model initialization and the objectives of contrastive learning, underscoring its impact on downstream tasks and fairness. Oh et al. [33] highlight poor uniformity and alignment in CLIP's embeddings and propose a finetuning method for robust representations. Zhang et al. [67] explore the geometry of this embedding space, and provide both theoretical and empirical insights on the nature of this geometry. Subsequent research has produced methods to mitigate the modality gap through diverse and creative approaches [11, 12, 32, 46, 66]. + +Improving Contrastive Learning: Several methods have improved upon the CLIP objective by introducing auxiliary losses, e.g., SLIP [30] uses SimCLR [4] loss, M3MAE [10,55] augment the Masked Autoencoder [14] reconstruction loss, FLIP [24] randomly masks out input images to improve scaling, DACL [49] proposes a domain agnostic mixup strategy, SILC [31] uses self-distillation, Mo et al. [28] utilized specialist captions to generate pseudo labels for unpaired images, Zhang et al. [63] propose Multi-task Paired Masking with Alignment to improve cross-modal interaction. Similarly there have been works that have identified the need to make the CLIP model focus on sub-regions in order to enhance its utility and downstream performance, GLoRIA [15] considers the loss from local regions from within the image and reports, Alpha-CLIP [45] uses the alpha channel to guide the CLIP model to focus on different regions of the image and generate the masks for all the images in the corpus using an image segmentation pipeline and TIER [35] uses a regularization term to improve the local focus of the model. + +Multi-modal Contrastive Learning in Medical Imaging: Zhang et al. [65] demonstrated enhanced downstream performance by jointly using chest X-ray and report pairing for training a contrastive learning model. This was further improved by Huang et al. [15], by exploiting local and global features from both modalities; Wang et al. [54] and You et al. [59] achieved impressive results by using a Swin Tiny model as the image encoder and by adding modifications + +to the contrastive loss. Several other works have developed similar contrastive learning foundation models while utilizing the biomedical image texts to achieve impressive results [16, 29, 44, 47, 56, 58]. Karargyris et al. [22] and Bigolin et al. [3] augment a subset of the MIMIC-CXR [21] samples with high quality eye-tracking and verbal transcripts from several radiologists. van Sonsbeek et al. [43] and Wang et al. [50] utilize the heatmaps from eye-gaze to improve image classification. + +# 3 Method + +Notations. For a given chest X-ray image $I_{i}$ and its radiology report $T_{i}$ , indexed by $i$ in our dataset, we denote their L2-normalized embeddings as $v_{i}$ and $t_i$ respectively, residing in a d-dimensional space $(v_{i},t_{i}\in \mathcal{R}^{d})$ . Image embeddings are obtained through an encoder $v_{i} = f(I_{i})$ and text embeddings via $t_i = g(T_i)$ . Applying an expert heatmap $E_{i}$ to an image results in the corresponding image embedding $v_{i}^{E}$ . We denote the loss value for the $i$ -th sample as $\mathcal{L}_i$ . For the case of contrastive loss, this is computed in terms of some similarity measure between the embeddings, $sim(v_{i},t_{i})$ , typically cosine similarity defined as $v_{i}\cdot t_{i}$ . + +# 3.1 Background + +Central to CLIP's effectiveness is the InfoNCE loss [34], a mechanism engineered to optimize the similarity measures between corresponding (positive) pairs and to minimize those among non-corresponding (negative) pairs. The formulation of the CLIP loss objective is as follows: + +$$ +\mathcal {L} _ {\mathrm {t e x t}} = \underset {(t _ {i}, v _ {i}) \sim p o s} {\mathbb {E}} \left[ - \log \frac {\exp (s i m (t _ {i} , v _ {i}) / \tau)}{\exp (s i m (t _ {i} , v _ {i}) / \tau) + \sum_ {j \neq i} \exp (s i m (t _ {i} , v _ {j}) / \tau)} \right] \tag {1} +$$ + +Total loss is then defined as, $\mathcal{L}_{\mathrm{total}} = \frac{1}{2}\left(\mathcal{L}_{\mathrm{text}} + \mathcal{L}_{\mathrm{image}}\right)$ , where $\mathcal{L}_{\mathrm{image}}$ denotes the corresponding loss for the image to text mapping. Here, $\tau$ represents the temperature parameter that controls the scale of the similarity scores, typically framed as a learnable parameter during training. The loss expectation is taken over all the positive pairings in the dataset. + +Theoretical results on CL indicate the concepts of alignment and uniformity as critical for the quality of embeddings [51, 52]. Alignment focuses on reducing the distance between positive pairs while uniformity seeks to evenly distribute the embeddings across the unit hypersphere, preventing extreme clustering that could impair the model's generalizability and discriminative capabilities. The alignment and uniformity can be defined formally as follows [33]: + +$$ +\text {A l i g n m e n t} = - \mathbb {E} _ {\left(v _ {i}, t _ {i}\right) \sim p o s} \left[ \| v _ {i} - t _ {i} \| _ {2} ^ {2} - \min _ {j \neq i} \| v _ {i} - t _ {j} \| _ {2} ^ {2} \right] \tag {2} +$$ + +$$ +\mathrm {U n i f o r m i t y} = - \log \mathbb {E} _ {(v _ {i}, t _ {j}) \sim \mathcal {D}} \left[ \exp (- 2 \| v _ {i} - t _ {j} \| _ {2} ^ {2}) \right] \tag {3} +$$ + +![](images/199377f11c57e7f243444a20b6fd69d54cb619bdc3ec24ef532fc946ed837fab.jpg) +Fig. 3: Comparing eCLIP with $m^2$ -mixup [33]. (left) Standard CLIP showing image-text positive pairs $(v_i, t_i)$ (solid line), while the other image embeddings serve as negative pairs (dashed line). (center) the $m^2$ -mixup creates negative pairs $(v_j^\lambda, t_i)$ via interpolation between embeddings along the geodesic. (right) eCLIP adds expert image embedding, $v_i^E$ , in addition to $v_i$ for text $t_i$ , forming additional positive and negative pairs + +![](images/3b72a706562807f42f35658b6c5aefa4a27f5860eefc26b25355e6a92647109c.jpg) + +![](images/f15e63f971990328f480afb83d774722c7e20064b72c8e09e5b137f2db4e57c0.jpg) + +High intra-modal similarity, e.g. between two images as seen in Fig. 1, can inadvertently enhance similarity among negative pairs, inflating the denominator of the loss function in Equation (1), and, consequently, hurting the model's ability to differentiate between positive and negative pairs during training. A conventional method to counter this involves incorporating hard negative pairs, a strategy Oh et al. [33] employ by mixing embeddings from different modalities. While effective, this cross-modal mixup may obscure the semantic clarity of embeddings. As an alternative we propose increasing the dataset with additional positive pairs that exhibit minimal semantic overlap by integrating expert annotations. Fig. 3 compares the positive and negative pair creation in eCLIP with traditional CLIP and $m^2$ -mixup. + +# 3.2 Introducing Expert Annotations to CLIP + +Our objective with eCLIP is to enhance the CLIP framework by integrating expert annotations - radiologist eye-gaze heatmaps - to diversify the pool of positive samples. The eCLIP model is designed to be compatible across all CLIP variants without modifying its core architecture. The heatmap processor (Fig. 2, right) first converts the images and heatmaps into a sequence of patches and applies multi-headed attention (MHA) over the sequences. The patched heatmap overlaid images serve as queries, while the original image's patches act as keys and values. The processed output is then reconstructed back to its original image format, enabling the standard CLIP image encoder to obtain expert image embeddings. These new embeddings and their text embedding pair introduce additional positive samples for the contrastive loss objective (Fig. 3, right). + +However, the size of the expert annotated data is orders of magnitude smaller than the data available for CLIP training. To effectively leverage the scarce expert-annotated data, we implement mixup augmentation [62]. As illustrated in Fig. 2 (left), this involves blending an original image $I_{i}$ with its expert version + +Algorithm 1 eCLIP Algorithm +Require: Image Encoder $f(\cdot)$ // Compute Total Loss +Require: Text Encoder $g(\cdot)$ +1: $\mathcal{L}_{\mathrm{priming}} \gets 0; n_{\mathrm{p}} \gets 0$ +2: for minibatch $\{x_i\}_{i=1}^N$ do +3: Unpack $x_i$ to $(T_i, I_i)$ and optionally $E_i$ +4: $t_i \gets g(T_i)$ +5: $v_i \gets f(I_i)$ +6: $p_{\mathrm{uni}} \sim \mathrm{Uniform}(0,1)$ +7: if $p_{\mathrm{uni}} < p_{\mathrm{curr}}$ and $E_i$ is provided then +8: // Process expert image +9: $\lambda \sim \mathrm{Beta}(\alpha, \alpha)$ +10: $I_i^E \gets \mathrm{HeatmapProcessor}(I_i, E_i)$ +11: $I_i^\lambda \gets I_i\lambda + I_i^E(1 - \lambda)$ +12: $v_i^\lambda \gets f(I_i^\lambda)$ +13: end if +14: if $E_i$ is entirely ones then +15: $I_i^R \gets \mathrm{HeatmapProcessor}(I_i, E_i)$ +16: $\mathcal{L}_{\mathrm{priming}} \gets \mathcal{L}_{\mathrm{priming}} + (I_i - I_i^R)^2$ +17: $n_{\mathrm{p}} \gets n_{\mathrm{p}} + 1$ +18: end if +19: end for + +$I_{i}^{E}$ to create $I_{i}^{\lambda} = \lambda I_{i} + (1 - \lambda)I_{i}^{E}$ , where $\lambda \sim \mathrm{Beta}(\alpha, \alpha)$ . (We set $\alpha = 0.3$ in all our experiments.) The eCLIP image encoder then processes $I_{i}^{\lambda}$ to produce the image embedding $v_{i}^{\lambda} = f(I_{i}^{\lambda})$ . These expert embeddings form new positive pairs $(v_{i}^{\lambda}, t_{i})$ as well as corresponding negative pairs, which are added with existing pairs $(v_{i}, t_{i})$ during the computation of the CLIP InfoNCE Loss, $\mathcal{L}_{i}$ . + +To seamlessly integrate expert annotations without disrupting the foundational training of the eCLIP model, we employ a phased curriculum learning strategy [2]. This approach comprises a cold start phase where the model is initially trained without the expert annotations to establish a robust baseline. This phase accounts for about $10\%$ of the total training iterations. It then transitions into a warmup phase, gradually increasing the inclusion of expert examples from 0.05 to 0.5 probability over the next $30\%$ of iterations. Finally, a cooldown phase reduces expert example probability to 0.1 for the subsequent $40\%$ of iterations, fine-tuning the model's performance by balancing foundational and expert-driven insights. + +Additionally, we regularize the heatmap processor to behave as an identity function in scenarios where the heatmap is entirely composed of ones. We achieve this through a priming phase that coincides with the curriculum learning's cold start phase. We setup an auxiliary mean-squared error loss to force the heatmap processor to reconstruct the original image $I_{i}$ when the heatmap $E_{i} = 1$ . This priming ensures the heatmap processor's adaptability, allowing it to process expert annotations effectively when available, while falling back to the + +model's original performance in their absence. The total loss during this phase is, $\mathcal{L}_{\mathrm{total}} = w_{\mathrm{p}}\cdot \mathcal{L}_{\mathrm{priming}} + (1 - w_{\mathrm{p}})\cdot \mathcal{L}_{\mathrm{clip}}$ , where $w_{\mathrm{p}}$ is a hyperparameter which we set to 0.1. The pseudocode for eCLIP is shown in Algorithm 1. + +# 4 Experiments + +Our experiments are designed to evaluate the influence of expert heatmap annotations on the quality of the learned representations. Unless stated otherwise, we assume that a large set of image-text pairs, of which a small fraction is annotated with eye-gaze heatmaps, is used for training, but for test samples no annotations are used. We utilize both quantitative measures and qualitative assessments to study the contributions of these annotations towards enhancing model performance. The source code is available online. + +# 4.1 Setup + +Baselines To validate our approach, we compare eCLIP against a model trained using traditional CLIP (referred to as the base model) and a "naive" baseline, where the expert annotated samples are directly added to the training set without using mixup or curriculum learning. We also examine the impact of two mixup methods: Domain Agnostic Contrastive Learning (DACL) [49] and $m^3$ -mixup [33] which blends image and text embeddings to improve alignment and uniformity across modalities. While DACL is integrated during pretraining, $m^3$ -mixup is applied post-pretraining, in a manner akin to fine-tuning. eCLIP can be applied to any variant of CLIP, which we demonstrate also with GLoRIA [15] which has a Resnet50 image encoder. We introduce two variants of our technique: eCLIP, which integrates expert annotations during the initial CLIP pretraining phase, and eCLIP $^{\mathcal{P}}$ , which instead continually finetunes a trained CLIP model with expert annotations, similar to $m^3$ -mixup. + +Datasets For pretraining phase we utilize the MIMIC-CXR dataset [21], which pairs roughly 200K chest X-rays with free-text radiology reports. The images were processed into JPEG format as described in [20], and the accompanying reports were stripped of unnecessary punctuation and tokenized using the Wordpiece scheme [7]. We obtain the eye-gaze heatmap from the EGD-CXR dataset [6] and process the eye-tracking data to obtain the normalized eye-gaze heatmap which are available for 1080 datapoints. + +Our evaluation setup includes multiple publicly available chest X-ray datasets, specifically CheXpert [17], RSNA Pneumonia [39], NIH CXR [53] and Open-I [6], each offering a distinct set of imaging and reporting characteristics. Following previous works [15, 54, 59], we prepare the test sets from MIMIC and CheXpert, selecting 200 random samples for five specific pathologies from the CheXpert competition, resulting in 1000 samples for each dataset (MIMIC 5x200 and CheXpert 5x200, respectively). For the NIH-CXR dataset, we assembled a subset of 100 samples for each of 14 abnormalities, thereby creating CXR 14x100 + +test set. The Open-I dataset is utilized for text retrieval and radiology report generation tasks. For linear probe evaluations, we use CXR-8 [53], RSNA dataset and construct an OpenI-5 dataset by extracting labels from the 'Problems' field within the reports that match the CheXpert competition labels. + +Training We employed CLIP pretraining on the MIMIC-CXR dataset, utilizing a subset with roughly 1000 images with expert eye-gaze heatmap annotations, while validation and all other downstream evaluations proceed without these annotations. Our model architecture includes Swin Tiny, following recent studies [54,59], alongside Vision Transformer (ViT) Small and Base, with image encoders pretrained on ImageNet and Clinical BERT [1] with max length of sequences set to 256 as the text encoder. We cropped images to (224, 224) using random resized crop augmentation and turned off all other image augmentations. Pretraining utilized 8 AMD MI250X GPUs, maintaining an effective batch size of 512 for 10,000 steps. The learning rate was $1e^{-4}$ for standard CLIP, increased to $2e^{-4}$ for eCLIP variants, with cosine annealing plus a linear warmup for the first $10\%$ of iterations, weight decay of $1e^{-3}$ , and learnable temperature parameter in the contrastive loss initialized at 0.07. Models for $m^3$ -mixup and $\mathrm{eCLIP}^{\mathcal{P}}$ are initialized with weights from CLIP pretraining and further finetuned for 1,000 iterations with a learning rate of $1e^{-5}$ . Detailed setup information is available in the Supplement. + +# 4.2 Zero-shot Image Classification + +Following CLIP [36], our zero-shot classification method categorizes images into predefined classes without direct finetuning, thus relying on the quality of embeddings generated during pretraining. To formulate the embedding of each class label, we first generate descriptive prompts to obtain a list of text embeddings corresponding to the label using the text encoder [15, 54, 59]. The mean of these embeddings is taken as the representation of the label. For each image, classification is then performed by matching the image embedding with its closest label embedding through cosine similarity. More details of the prompts used are provided in the Supplement. + +Tab. 1 illustrates the zero-shot classification performance on CheXpert 5x200, MIMIC 5x200, RSNA, and CXR 14x100 datasets. The results, based on macro-averaged F1 scores from three random initializations, highlight eCLIP variants' superior performance over the base models across all datasets. While the $m^3$ -mixup excels in MIMIC for certain architectures, eCLIP variants show broader generalization. Notably, eCLIP's advantages are more pronounced in multi-class scenarios (CheXpert, MIMIC and CXR14) compared to binary classification on RSNA. + +# 4.3 Sample Efficiency + +Sample efficiency measures how well a model learns from limited amount of training data. eCLIP improves this efficiency by using expert annotated im + +Table 1: Zero-shot classification performance on 4 X-ray datasets and model configurations, reported as macro-averaged F1 scores from three independent random seeds. The highest score per dataset and model configuration is underlined. The overall best-performing model for each dataset is highlighted in bold. + +
ModelDataset
Chexpert 5x200MIMIC 5x200RSNACXR 14x100
GLoRIAResnet500.478±.0230.457±.0160.736±.0240.155±.001
+naive0.391±.0690.334±.0570.731±.0230.113±.024
+DACL0.506±.0290.430±.0110.736±.0070.158±.004
+m3-mix0.512±.0050.467±.0040.760±.0060.160±.003
+expert (ours)0.507±.0040.430±.0090.761±.0170.156±.023
+expertP(ours)0.507±.0050.475±.0080.775±.0010.159±.001
CLIPSwin Tiny0.517±.0250.452±.0020.808±.0000.169±.003
+naive0.532±.0100.452±.0220.807±.0070.167±.007
+DACL0.465±.0080.389±.0150.768±.0180.101±.013
+m3-mix0.554±.0060.469±.0080.802±.0040.179±.008
+expert (ours)0.549±.0160.445±.0210.818±.0040.172±.006
+expertP(ours)0.558±.0040.463±.0070.819±.0000.192±.003
CLIPViT Small0.525±.0240.441±.0060.807±.0060.159±.007
+naive0.534±.0160.440±.0190.805±.0040.156±.017
+DACL0.475±.0250.398±.0150.761±.0090.133±.007
+m3-mix0.557±.0020.454±.0030.809±.0020.164±.002
+expert (ours)0.545±.0160.452±.0130.803±.0030.165±.007
+expertP(ours)0.559±.0010.439±.0040.817±.0010.165±.004
CLIPViT Base0.540±.0170.465±.0040.805±.0010.183±.011
+naive0.506±.0110.426±.0060.805±.0040.151±.009
+DACL0.474±.0070.400±.0020.759±.0010.106±.003
+m3-mix0.542±.0210.465±.0130.798±.0040.183±.020
+expert (ours)0.563±.0210.477±.0040.814±.0030.193±.017
+expertP(ours)0.549±.0030.452±.0070.810±.0010.185±.002
+ +ages to form new positive and negative pairs, aiming to improve the quality of the learned embeddings. To test this, we first looked at zero-shot classification performance, adjusting the number of training batches available for pretraining. Results, shown in Fig. 4 (top row), reveal that eCLIP is more sample efficient across MIMIC 5x200, CheXpert 5x200 and CXR 14x100 datasets compared to the base model. Additionally, by applying supervised fine-tuning (SFT) with a linear probe on class-imbalanced datasets - CXR-8, RSNA and OpenI-5 (Sec. 4.1) - eCLIP demonstrates stronger performance in multi-label classification tasks, CXR-8 and OpenI-5 and remains competitive in binary classification for RSNA. This is shown in Fig. 4 (bottom row) where we plot the ROC AUC scores against different training sample sizes for linear probing. These findings highlight eCLIP's ability to effectively learn from fewer samples. + +![](images/dc2e4670e024d6f3b2333c54b99d3c168ff07671300e27842f90d2a4e04d794a.jpg) + +![](images/73ed6b375a88ca48f932cd1f9291d45f42782ed71a8c2191a4cfbe6265e5b460.jpg) + +![](images/1a68cb4853412b7b6b1807655629850318d58902b5d4be0fac4d6d086e60a64c.jpg) + +![](images/3525da3b71ca747c28ada3de628167b670b88048871c786d4993d0ff6b611e74.jpg) +Fig. 4: Sample Efficiency. (top row) Zero-shot performance on three multi-label classification test sets for CLIP and eCLIP Swin Tiny models, trained with varying amounts of training batches. (bottom row) Linear probe scores with varying amounts of training data. + +![](images/ebfb2ea057e0bb8fb6005598a6278788ff2dc5cbb5328774c1bba9c7c9078b68.jpg) + +![](images/d2d7b9f9fd495dbc93e377a552d90b5240339b24ad0657e85c01adea0263041d.jpg) + +# 4.4 Text retrieval and retrieval augmented generation (RAG) + +To compare eCLIP's cross-modal functionality with that of CLIP we focused on text retrieval task using the Open-I dataset, which consists of pairs of X-rays and radiology reports. We used the FAISS vector database [8] to index the text embeddings generated by the text encoder. For a given X-ray image $I_{i}$ , we then retrieve the closest text reports from the database based on the cosine similarity in the embedding space, $\min_j(v_i\cdot t_j)$ . Results in Tab. 2 compare the performance of eCLIP against CLIP in text retrieval measured in Recall@1, 5, and 10. The performance of eCLIP indicates a notable improvement in its embedding quality. Note that our evaluation followed a strict criterion for recall computation, where a retrieval was counted as successful only if the exact correct report was identified. While more nuanced measures based on semantic similarity could be employed [59], we opted this approach to maintain a clear and simple evaluation framework. + +Next we extend our analysis from retrieval to report generation using a frozen Large Language Model (LLM), Mistral 7B Instruct v2 [19], aiming to generate radiology reports through Retrieval Augmented Generation (RAG). This setup tests the CLIP model's capacity to retrieve texts which can be used to prompt an LLM to generate a report without finetuning on medical data. First we randomly selected 389 samples from the Open-I dataset for testing and utilized the FAISS database to index the reports from the remaining samples (i.e., training set). Given a test image we retrieve five closest reports from the training set and use them in the prompt for the LLM to generate a report for the test image. The eCLIP variant showed a small but consistent improvement over the base model in generating reports, as indicated in Tab. 3. A comparative analysis of generated report versus ground truth shown in Tab. 5, with discrepancies marked, further + +Table 2: Performance on Image to Report retrieval with Open-I dataset. We report the Recall@{1, 5, 10} + +
ModelR@1R@5R@10
CLIP_Swin_Tiny3.17.611.3
+m3-mix2.46.59.8
+expert (ours)3.79.413.4
+expertP(ours)3.18.211.7
CLIP_ViT_Base3.79.213.2
+m3-mix4.18.813.0
+expert (ours)4.410.313.5
+expertP(ours)3.99.413.2
+ +Table 3: Performance on report generation with Open-I dataset. We report the BLEU-2 score (BL-2), BERT recall score [64] (B-R), Cosine similarity between the sentence embeddings of the generated and ground-truth report for MPNet [42] Sentence Transformer model [38] $(\mathrm{S}_{emb})$ ,and for the CheXBERT model [41] $(\mathrm{CB}_{emb})$ + +
ModelBL-2B-RSembCBemb
CLIP0.1720.7130.7910.492
+m3-mix0.1720.7110.7880.496
eCLIP0.1770.7120.7950.506
+ +Table 4: Ablation Study with Swin Tiny. Zero-shot performance on CheXpert (CXP) and CXR14 (C14) datasets for the base CLIP and models with expert annotation integration $(+\mathrm{E})$ is presented. Methods include mask multiplication $(\odot)$ , CNN, and Multi-headed Attention (MHA) encoders. Key augmentations: Mixup $(+\mathrm{M})$ , Curriculum Learning $(+\mathrm{C})$ , and Encoder Priming $(+\mathrm{P})$ demonstrate performance gains. A control with a random mask (rand) confirms the significance of expert annotations. We report macro-averaged F1 scores from three random initialization + +
MethodCXPC14
Base0.517±.0240.169±.003
⊗ Mask (+ E)0.540±.0190.165±.006
CNN Encoder (+ E)0.534±.0120.163±.008
MHA Encoder (+ E)0.534±.0130.153±.002
MHA Encoder (+ E, M)0.532±.0180.160±.010
MHA Encoder (+ E, M, C)0.545±.0080.173±.018
MHA Encoder (+ rand, M, C, P)0.537±.0200.166±.003
MHA Encoder (+ E, M, C, P)0.549±.0160.172±.006
+ +validates the effectiveness of eCLIP's embeddings in supporting complex cross-modal tasks. Additional details, including LLM prompts and generated report samples are available in the Supplement. + +# 4.5 Embedding Quality + +For qualitative evaluations, we first examine the histogram of the cosine similarities of the embeddings from different abnormality subgroups obtained from the CLIP image encoder. In Fig. 5 (top row), we can see that the similarities for the CLIP model has considerably dropped below 1 after continual pretraining on MIMIC-CXR compared to Fig. 1. This indicates that the model's ability to distinguish between different conditions has improved. The introduction of expert annotations in the eCLIP variant further improves this with mean cosine similarities for 'normal' versus cardiomegaly, atelectasis and opacity dropping to 0.36, 0.4 and 0.4 respectively. + +Our evaluation of uniformity and alignment reveals that eCLIP surpasses both the MIMIC-pretrained and internet-pretrained models in these key metrics, + +Table 5: Random samples of generated report. For each image in the Open-I dataset, the five closest text snippets based on embedding cosine similarity is used as prompts for Mistral 7B LLM. Utilizing in-context learning, we prompt the LLM with two such snippet-report pairs. The conditions that the generated report identified correctly are highlighted in green while those it missed are shown in red. + +
ProblemsGround TruthGenerated
normalThe lungs and pleural spaces show no acute abnormality. Heart size and pulmonary vascularity within normal limits.The lungs are clear with no evidence of consolidation, pneumothorax, or pleural effusion. Heart size and mediastinal contour are normal. No acute abnormalities noted in the visualized osseous structures.
Pulmonary At-electasis. Pleural Effusion. Cardiomegaly. Pulmonary CongestionAP and lateral views were obtained. Bibasilar atelectasis and small left-sided pleural effusion. Stable cardiomegaly. No pneumothorax. Mild pulmonary vascular congestion.The lungs show bibasilar airspace opacities, possibly due to infection or atelectasis. Heart size is mildly enlarged. No pneumothorax or pleural effusion.
Lung. Density. EmphysemaThere is hyperexpansion. The heart size is normal. There is no pleural effusion or pneumothorax. Two circular densities overlying the right ribs which were not present in the XXXX CT. No focal infiltratesThe lungs are hyperexpanded with clear fields and no acute consolidations or pleural effusions. Heart size and pulmonary vascularity are within normal limits. Degenerative changes are present in the thoracic spine. A calcified granuloma is noted in the left perihilar region. No pneumothorax or large pleural effusion is observed.
+ +indicating a marked improvement in the quality of embeddings (Fig. 5, bottom left). We also note a modest decrease in the modality gap with eCLIP (Fig. 5, bottom center). Clustering analysis via K-means (with $k = 5$ for 5 abnormalities in data) highlights eCLIP's superior performance in grouping abnormalities, as seen from improved scored in Normalized Mutual Information (NMI), Silhouette score, and Calinski-Harabasz (CH) index (Fig. 5, bottom right). + +# 4.6 Ablation Study + +Our ablation study with the Swin Tiny encoder shows the impact of key components in our eCLIP model: multi-headed attention (MHA) layer for heatmap processing, curriculum learning for phased introduction of expert annotations, mixup augmentation to compensate for limited number of export annotated data and priming of heatmap processor during initial training phase. Results shown in Tab. 4 reveal that the MHA-based heatmap processor improves zero-shot classification performance on CheXpert 5x200 and CXR 14x100 datasets compared to basic methods like direct application of heatmaps as mask ( $\odot$ Mask) or using a CNN encoder. We note a significant performance drop with randomly generated heatmaps versus expert eye-gaze heatmaps. This highlights that while our methodological improvements contribute to the performance gains, the in + +![](images/2272f010eb80f246b16f322d19e7a20f4db88dbf607c559b88169858e87d9480.jpg) + +![](images/69ed5c70a743be77b6d0c3719ff0de8b3bd40719325c7548e5d53cea3a7f1bc2.jpg) + +![](images/212e4f8e20f91c607835cb493e85ef90056014c81f724febf66b921989ebbeae.jpg) + +![](images/5c8ff4805b5fd12d79a8894356cb8b92bcbc4a5a58a0301306eaaf712044315c.jpg) + +![](images/1a23f8e9e09b1527ba885d82b5a03544e0088a6195cba15ebefc3112832ce5f5.jpg) +Fig. 5: Qualitative Analysis of CLIP Pretraining. top row illustrates the cosine similarity distributions for CLIP and eCLIP image embeddings. bottom left and center sections display uniformity, alignment, and modality gap comparisons among the internet pretrained model (ZS), CLIP pretrained on MIMIC, and eCLIP. bottom right details K-means clustering metrics for image embeddings with $k = 5$ for both CLIP and eCLIP models. + +![](images/95e49cdd3ef9010ab1f8b8cadb78eff430ac38b01807682624b1fd7eeea92987.jpg) + +![](images/f76b37e8036aacb1a54f91eb3209d9d975f210d52043ecdf82c49139c3239da0.jpg) + +tegration of meaningful, expert-derived signals is essential for achieving optimal results. + +# 5 Conclusion + +We introduce eCLIP, an adaptation of CLIP, demonstrating the integration of radiologist eye-tracking heatmap to overcome challenges faced in multi-modal contrastive learning. This study highlights the impact of integrating these high-quality expert annotations on improving the quality of learned embeddings and assess its influence on sample efficiency and cross-modal retrieval tasks. An important future research direction would be extending this approach to include expert annotations from the text modality (e.g., by adapting SimCSE [9]) and to leverage the temporal dynamics of eye-tracking data by aligning the sequential frames with the corresponding report snippets. + +**Limitations** Our study is limited by the small size of expert annotated data and thus does not comprehensively analyze the impact of size or distribution of expert annotations across different abnormalities. eCLIP also incurs extra computational costs during training due to the additional forward pass required for processing expert images in the warmup and cool-down phases. Additionally, the clinical relevance of generated radiology reports has not been validated by medical experts, relying instead on standard metrics known for potential biases and inaccuracies in reflecting clinical accuracy [60]. + +# Acknowledgements + +This work was supported by the Research Council of Finland (Flagship programme: Finnish Center for Artificial Intelligence FCAI, and grants 352986, 358246) and EU (H2020 grant 101016775 and NextGenerationEU). We acknowledge the computational resources provided by Aalto Science-IT project. We acknowledge CSC for awarding this project access to the LUMI supercomputer, owned by the EuroHPC Joint Undertaking, hosted by CSC (Finland) and the LUMI consortium through Finland. + +# References + +1. Alsentzer, E., Murphy, J.R., Boag, W., Weng, W.H., Jin, D., Naumann, T., McDermott, M.: Publicly available clinical BERT embeddings. arXiv preprint arXiv:1904.03323 (2019) 9 +2. Bengio, Y., Louradour, J., Collobert, R., Weston, J.: Curriculum learning. In: Proceedings of the 26th Annual International Conference on Machine Learning. pp. 41-48 (2009) 7 +3. Bigolin Lanfredi, R., Zhang, M., Auffermann, W.F., Chan, J., Duong, P.A.T., Srikumar, V., Drew, T., Schroeder, J.D., Tasdizen, T.: REFLACX, A dataset of reports and eye-tracking data for localization of abnormalities in chest x-rays. Scientific Data 9(1), 350 (2022) 5 +4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607. PMLR (2020) 1, 4 +5. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023) 1 +6. Demner-Fushman, D., Kohli, M.D., Rosenman, M.B., Shooshan, S.E., Rodriguez, L., Antani, S., Thoma, G.R., McDonald, C.J.: Preparing a collection of radiology examinations for distribution and retrieval. Journal of the American Medical Informatics Association 23(2), 304-310 (2016) 2, 8 +7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 8 +8. Douze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.E., Lomeli, M., Hosseini, L., Jégou, H.: The faiss library. arXiv preprint arXiv:2401.08281 (2024) 11 +9. Gao, T., Yao, X., Chen, D.: SimCSE: Simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821 (2021) 14 +10. Geng, X., Liu, H., Lee, L., Schuurmans, D., Levine, S., Abbeel, P.: M3AE: Multimodal masked autoencoders learn transferable representations. Tech. rep., Technical Report 4 +11. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: CyCLIP: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022) 2, 4 + +12. Gu, S., Clark, C., Kembhavi, A.: I can't believe there's no images! learning visual tasks using only language supervision. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2672-2683 (2023) 4 +13. Han, Z., Liang, Z., Yang, F., Liu, L., Li, L., Bian, Y., Zhao, P., Wu, B., Zhang, C., Yao, J.: Umix: Improving importance weighting for subpopulation shift via uncertainty-aware mixup. Advances in Neural Information Processing Systems 35, 37704-37718 (2022) 3 +14. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022) 4 +15. Huang, S.C., Shen, L., Lungren, M.P., Yeung, S.: Gloria: A multimodal global-local representation learning framework for label-efficient medical image recognition. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3942-3951 (2021) 2, 4, 8, 9 +16. Huang, Z., Bianchi, F., Yuksekgonul, M., Montine, T.J., Zou, J.: A visual-language foundation model for pathology image analysis using medical twitter. Nature Medicine 29(9), 2307-2316 (2023) 5 +17. Irvin, J., Rajpurkar, P., Ko, M., Yu, Y., Ciurea-Ilicus, S., Chute, C., Marklund, H., Haghgoo, B., Ball, R., Shpanskaya, K., et al.: CheXpert: A large chest radiograph dataset with uncertainty labels and expert comparison. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 33, pp. 590-597 (2019) 8 +18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International Conference on Machine Learning. pp. 4904-4916. PMLR (2021) 1 +19. Jiang, A.Q., Sablayrolles, A., Mensch, A., Bamford, C., Chaplot, D.S., Casas, D.d.l., Bressand, F., Lengyel, G., Lample, G., Saulnier, L., et al.: Mistral 7B. arXiv preprint arXiv:2310.06825 (2023) 11 +20. Johnson, A., Lungren, M., Peng, Y., Lu, Z., Mark, R., Berkowitz, S., Horng, S.: MIMIC-CXR-JPG-Chest radiographs with structured labels. PhysioNet (2019) 8 +21. Johnson, A.E., Pollard, T.J., Berkowitz, S.J., Greenbaum, N.R., Lungren, M.P., Deng, C.y., Mark, R.G., Horng, S.: MIMIC-CXR, a de-identified publicly available database of chest radiographs with free-text reports. Scientific data 6(1), 317 (2019) 5, 8 +22. Karargyris, A., Kashyap, S., Lourentzou, I., Wu, J.T., Sharma, A., Tong, M., Abedin, S., Beymer, D., Mukherjee, V., Krupinski, E.A., et al.: Creation and validation of a chest X-ray dataset with eye-tracking and report dictation for AI development. Scientific Data 8(1), 92 (2021) 3, 5 +23. Krishnan, R., Rajpurkar, P., Topol, E.J.: Self-supervised learning in medicine and healthcare. Nature Biomedical Engineering 6(12), 1346-1352 (2022) 2 +24. Li, Y., Fan, H., Hu, R., Feichtenhofer, C., He, K.: Scaling language-image pretraining via masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23390-23400 (2023) 4 +25. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022) 2, 4 +26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. arXiv preprint arXiv:2304.08485 (2023) 1 +27. McInnes, L., Healy, J., Melville, J.: UMAP: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 3 + +28. Mo, S., Kim, M., Lee, K., Shin, J.: S-clip: Semi-supervised vision-language learning using few specialist captions. Advances in Neural Information Processing Systems 36 (2024) 4 +29. Moor, M., Huang, Q., Wu, S., Yasunaga, M., Dalmia, Y., Leskovec, J., Zakka, C., Reis, E.P., Rajpurkar, P.: Med-flamingo: a multimodal medical few-shot learner. In: Machine Learning for Health (ML4H). pp. 353-367. PMLR (2023) 5 +30. Mu, N., Kirillov, A., Wagner, D., Xie, S.: Slip: Self-supervision meets language-image pre-training. In: European Conference on Computer Vision. pp. 529-544. Springer (2022) 4 +31. Naeem, M.F., Xian, Y., Zhai, X., Hoyer, L., Van Gool, L., Tombari, F.: SILC: Improving vision language pretraining with self-distillation. arXiv preprint arXiv:2310.13355 (2023) 4 +32. Nukrai, D., Mokady, R., Globerson, A.: Text-only training for image captioning using noise-injected clip. arXiv preprint arXiv:2211.00575 (2022) 4 +33. Oh, C., So, J., Byun, H., Lim, Y., Shin, M., Jeon, J.J., Song, K.: Geodesic multi-modal mixup for robust fine-tuning. Advances in Neural Information Processing Systems 36 (2023) 2, 3, 4, 5, 6, 8 +34. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018) 1, 5 +35. Palepu, A., Beam, A.: Tier: Text-image entropy regularization for medical clip-style models. In: Machine Learning for Healthcare Conference. pp. 548-564. PMLR (2023) 4 +36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021) 1, 2, 9 +37. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021) 1 +38. Reimers, N., Gurevych, I.: Sentence-BERT: Sentence embeddings using siamese BERT-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 3982-3992 (2019) 12 +39. Shih, G., Wu, C.C., Halabi, S.S., Kohli, M.D., Prevedello, L.M., Cook, T.S., Sharma, A., Amorosa, J.K., Arteaga, V., Galperin-Aizenberg, M., et al.: Aug-mentation the national institutes of health chest radiograph dataset with expert annotations of possible pneumonia. Radiology: Artificial Intelligence 1(1), e180041 (2019) 8 +40. Singh, A., Hu, R., Goswami, V., Couairon, G., Galuba, W., Rohrbach, M., Kiela, D.: Flava: A foundational language and vision alignment model. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15638-15650 (2022) 1 +41. Smit, A., Jain, S., Rajpurkar, P., Pareek, A., Ng, A.Y., Lungren, M.: Combining automatic labelers and expert annotations for accurate radiology report labeling using BERT. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). pp. 1500-1519 (2020) 12 +42. Song, K., Tan, X., Qin, T., Lu, J., Liu, T.Y.: MPNet: Masked and permuted pretraining for language understanding. Advances in Neural Information Processing Systems 33, 16857-16867 (2020) 12 + +43. van Sonsbeek, T., Zhen, X., Mahapatra, D., Worring, M.: Probabilistic integration of object level annotations in chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3630-3640 (2023) 5 +44. Sowrirajan, H., Yang, J., Ng, A.Y., Rajpurkar, P.: MoCo-CXR: MoCo pretraining improves representation and transferability of chest X-ray models, 2021. URL https://arxiv.org/abs (2010) 5 +45. Sun, Z., Fang, Y., Wu, T., Zhang, P., Zang, Y., Kong, S., Xiong, Y., Lin, D., Wang, J.: Alpha-CLIP: A clip model focusing on wherever you want. arXiv preprint arXiv:2312.03818 (2023) 4 +46. Tschannen, M., Mustafa, B., Houlsby, N.: CLIPPO: Image-and-language understanding from pixels only. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11006-11017 (2023) 2, 4 +47. Tu, T., Azizi, S., Driess, D., Schaekermann, M., Amin, M., Chang, P.C., Carroll, A., Lau, C., Tanno, R., Ktena, I., et al.: Towards generalist biomedical ai. NEJM AI 1(3), AIoa2300138 (2024) 5 +48. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International Conference on Machine Learning. pp. 6438-6447. PMLR (2019) 3 +49. Verma, V., Luong, T., Kawaguchi, K., Pham, H., Le, Q.: Towards domain-agnostic contrastive learning. In: International Conference on Machine Learning. pp. 10530-10541. PMLR (2021) 3, 4, 8 +50. Wang, B., Pan, H., Aboah, A., Zhang, Z., Keles, E., Torigian, D., Turkbey, B., Krupinski, E., Udupa, J., Bagci, U.: GazeGNN: A gaze-guided graph neural network for chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2194-2203 (2024) 5 +51. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2021) 5 +52. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020) 5 +53. Wang, X., Peng, Y., Lu, L., Lu, Z., Bagheri, M., Summers, R.M.: ChestX-Ray8: Hospital-scale chest x-ray database and benchmarks on weakly-supervised classification and localization of common thorax diseases. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2097-2106 (2017) 8, 9 +54. Wang, Z., Wu, Z., Agarwal, D., Sun, J.: MedCLIP: Contrastive learning from unpaired medical images and text. arXiv preprint arXiv:2210.10163 (2022) 2, 4, 8, 9 +55. Weers, F., Shankar, V., Katharopoulos, A., Yang, Y., Gunter, T.: Masked autoencoding does not help natural language supervision at scale. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23432-23444 (2023) 4 +56. Wu, C., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Medklip: Medical knowledge enhanced language-image pre-training. medRxiv pp. 2023-01 (2023) 5 +57. Xu, H., Xie, S., Tan, X.E., Huang, P.Y., Howes, R., Sharma, V., Li, S.W., Ghosh, G., Zettlemoyer, L., Feichtenhofer, C.: Demystifying CLIP data. arXiv preprint arXiv:2309.16671 (2023) 1 + +58. Xu, S., Yang, L., Kelly, C., Sieniek, M., Kohlberger, T., Ma, M., Weng, W.H., Kiraly, A., Kazemzadeh, S., Melamed, Z., et al.: Elixir: Towards a general purpose x-ray artificial intelligence system through alignment of large language models and radiology vision encoders. arXiv preprint arXiv:2308.01317 (2023) 5 +59. You, K., Gu, J., Ham, J., Park, B., Kim, J., Hong, E.K., Baek, W., Roh, B.: CXR-CLIP: Toward large scale chest X-ray language-image pre-training. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 101-111. Springer (2023) 4, 8, 9, 11 +60. Yu, F., Endo, M., Krishnan, R., Pan, I., Tsai, A., Reis, E.P., Fonseca, E.K.U.N., Lee, H.M.H., Abad, Z.S.H., Ng, A.Y., et al.: Evaluating progress in automatic chest x-ray radiology report generation. Patterns 4(9) (2023) 14 +61. Zbontar, J., Jing, L., Misra, I., LeCun, Y., Deny, S.: Barlow twins: Self-supervised learning via redundancy reduction. In: International Conference on Machine Learning. pp. 12310-12320. PMLR (2021) 1 +62. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017) 3, 6 +63. Zhang, K., Yang, Y., Yu, J., Jiang, H., Fan, J., Huang, Q., Han, W.: Multi-task paired masking with alignment modeling for medical vision-language pre-training. IEEE Transactions on Multimedia (2023) 4 +64. Zhang, T., Kishore, V., Wu, F., Weinberger, K.Q., Artzi, Y.: BERTScore: Evaluating text generation with BERT. In: International Conference on Learning Representations (2019) 12 +65. Zhang, Y., Jiang, H., Miura, Y., Manning, C.D., Langlotz, C.P.: Contrastive learning of medical visual representations from paired images and text. In: Machine Learning for Healthcare Conference. pp. 2-25. PMLR (2022) 2, 4 +66. Zhang, Y., HaoChen, J.Z., Huang, S.C., Wang, K.C., Zou, J., Yeung, S.: Diagnosing and rectifying vision models using language. arXiv preprint arXiv:2302.04269 (2023) 4 +67. Zhang, Y., Sui, E., Yeung, S.: Connect, Collapse, Corrupt: Learning cross-modal tasks with uni-modal data. In: The Twelfth International Conference on Learning Representations (2024) 2, 4 \ No newline at end of file diff --git a/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/images.zip b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..928718bb26098586401ccc7d9d42ae7210a54e03 --- /dev/null +++ b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f57a477b4423c94c44c09f4838158fcbcebd3ffbc6ff1837f19114aa8b1579d4 +size 572389 diff --git a/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/layout.json b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..6eda25424cab9e36e8127320f52ee027fe5de4f6 --- /dev/null +++ b/2024/Improving Medical Multi-modal Contrastive Learning with Expert Annotations/layout.json @@ -0,0 +1,9306 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "spans": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "type": "text", + "content": "Improving Medical Multi-modal Contrastive Learning with Expert Annotations" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 219, + 168, + 395, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 168, + 395, + 180 + ], + "spans": [ + { + "bbox": [ + 219, + 168, + 395, + 180 + ], + "type": "text", + "content": "Yogesh Kumar and Pekka Marttinen" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 184, + 190, + 429, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 184, + 190, + 429, + 213 + ], + "spans": [ + { + "bbox": [ + 184, + 190, + 429, + 213 + ], + "type": "text", + "content": "Department of Computer Science, Aalto University, Finland {firstname_lastname}@aalto.fi" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 243, + 455, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 243, + 455, + 430 + ], + "spans": [ + { + "bbox": [ + 160, + 243, + 455, + 430 + ], + "type": "text", + "content": "Abstract. We introduce eCLIP, an enhanced version of the CLIP model that integrates expert annotations in the form of radiologist eye-gaze heatmaps. It tackles key challenges in contrastive multi-modal medical imaging analysis, notably data scarcity and the \"modality gap\" - a significant disparity between image and text embeddings that diminishes the quality of representations and hampers cross-modal interoperability. eCLIP integrates a heatmap processor and leverages mixup augmentation to efficiently utilize the scarce expert annotations, thus boosting the model's learning effectiveness. eCLIP is designed to be generally applicable to any variant of CLIP without requiring any modifications of the core architecture. Through detailed evaluations across several tasks, including zero-shot inference, linear probing, cross-modal retrieval, and Retrieval Augmented Generation (RAG) of radiology reports using a frozen Large Language Model, eCLIP showcases consistent improvements in embedding quality. The outcomes reveal enhanced alignment and uniformity, affirming eCLIP's capability to harness high-quality annotations for enriched multi-modal analysis in the medical imaging domain." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 441, + 453, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 441, + 453, + 462 + ], + "spans": [ + { + "bbox": [ + 159, + 441, + 453, + 462 + ], + "type": "text", + "content": "Keywords: Contrastive Learning " + }, + { + "bbox": [ + 159, + 441, + 453, + 462 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 441, + 453, + 462 + ], + "type": "text", + "content": " Medical Imaging " + }, + { + "bbox": [ + 159, + 441, + 453, + 462 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 441, + 453, + 462 + ], + "type": "text", + "content": " Zero-shot Inference" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 484, + 230, + 497 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 484, + 230, + 497 + ], + "spans": [ + { + "bbox": [ + 132, + 484, + 230, + 497 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "Pretraining foundation models on multi-modal data - particularly leveraging the relationships between text and images - has proven to be a robust strategy for generating versatile embeddings [18,36]. These embeddings enhance the efficacy in several downstream tasks, from image generation to advanced vision-language integration [26, 37, 40]. Central to this approach is the employment of a contrastive learning (CL) loss objective [4, 34, 61], where models are trained to align positive pairs (e.g., an image and its corresponding caption) while diversifying negative ones. A significant hurdle in this approach is the necessity of vast datasets, often comprising several millions of data points, for competitive results. Models such as CLIP [36] have been trained on internet-scale datasets, estimated to encompass hundreds of millions of image-text pairs [5, 57]. Acquiring datasets of this magnitude poses substantial challenges in specialized fields that require expert knowledge for data collection, processing and annotation." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 478, + 281 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 478, + 281 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 478, + 281 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 478, + 281 + ], + "type": "image", + "image_path": "0014a845aec8b23c4efaad74333aaca295140fadad83b26235d68f7c1423d08b.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 289, + 482, + 323 + ], + "lines": [ + { + "bbox": [ + 130, + 289, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 482, + 323 + ], + "type": "text", + "content": "Fig. 1: Analysis of CLIP Embeddings in Medical Imaging The figure presents embeddings generated by a CLIP model, pretrained on an internet-scale dataset, applied to the Open-I dataset pairing X-rays with corresponding radiology reports." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 350, + 479, + 410 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 479, + 410 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 479, + 410 + ], + "type": "text", + "content": "The medical imaging domain exemplifies these difficulties, where acquiring even a single data point, such as a chest X-ray, involves complex processes requiring expertise and significant resources. Moreover, the procurement of such data for machine learning research is further complicated by ethical considerations, patient privacy concerns and the need for extensive de-identification procedures." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 411, + 482, + 602 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 602 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 602 + ], + "type": "text", + "content": "This has led to the prevalent use of foundation models, initialized with weights from models trained on extensive internet-scale datasets, for tasks in the medical domain [15,23,54,65]. However, the areas of interest within medical images are often nuanced and require expert knowledge to interpret, rendering them indistinguishable to a general-purpose model. In Fig. 1a, we investigate the embeddings generated by a CLIP model – initially pretrained on internet data – using samples from the Open-I dataset [6], which includes X-rays and corresponding radiology reports. We categorize the samples into subgroups based on the primary abnormality identified in each report, such as 'normal', cardiomegaly, atelectasis and opacity. A histogram of the cosine similarities between embeddings from different groups indicates a high degree of similarity, with values approaching 1. This could lead to potential challenges in downstream zero-shot inference tasks, which rely on the spatial segregation of embeddings from different groups [36]. Typically, continual pretraining on medically relevant data is employed to enhance the model's ability to differentiate between various abnormalities." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "Recent studies [11, 25, 33, 46, 67] have identified a \"modality gap\" in multimodal contrastive representation learning, where the embeddings from different modalities (e.g., images and text) fall in distinct regions in the shared embedding space. This separation, which arises from factors such as initial model weights and the objectives of contrastive learning [25, 67], leads to the \"cone effect\" where" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 142, + 116, + 476, + 257 + ], + "blocks": [ + { + "bbox": [ + 142, + 116, + 476, + 257 + ], + "lines": [ + { + "bbox": [ + 142, + 116, + 476, + 257 + ], + "spans": [ + { + "bbox": [ + 142, + 116, + 476, + 257 + ], + "type": "image", + "image_path": "440f70b30b3b150fa536e456fd430454245f6df8c8eb23d5dd7fb5a74221e0f2.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "lines": [ + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "spans": [ + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": "Fig. 2: eCLIP Pretraining with Expert Annotations. eCLIP adds a Heatmap Processor (right), featuring a multi-headed attention layer, to the standard Image and Text encoders in CLIP. This processor, along with vision and text encoders, maps inputs into a shared hypersphere. Here, the original image " + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "inline_equation", + "content": "(I_i)" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": ", its text " + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "inline_equation", + "content": "(T_i)" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": " and the heatmap-processed image " + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "inline_equation", + "content": "(I_i^E)" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": " are positioned within a tripartite area (shown here after 2D UMAP projection, please refer to the Supplement for a scaled version). We employ mixup between " + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "inline_equation", + "content": "I_i" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "inline_equation", + "content": "I_i^E" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": " to generate the embedding " + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "inline_equation", + "content": "v_i^\\lambda" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": ", which gives us additional positive pairs to enhance the CLIP InfoNCE loss optimization. An auxiliary loss, " + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{priming}}" + }, + { + "bbox": [ + 130, + 267, + 482, + 377 + ], + "type": "text", + "content": ", is used during the initial training steps to \"prime\" the heatmap processor to imitate an identity function when the heatmap is composed of all ones." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 402, + 482, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 485 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 485 + ], + "type": "text", + "content": "embeddings of each modality are restricted to a narrow region of the embedding hypersphere. In Fig. 1b, we illustrate this within the medical domain with a 2D UMAP [27] projection of image and text embeddings. This example highlights how embeddings from the same modality but different semantic groups, such as X-ray images of varying abnormalities, cluster closely together. This makes it difficult for a model to distinguish between semantically different images, undermining its performance in medical image analysis." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 486, + 482, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 617 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 617 + ], + "type": "text", + "content": "We investigate the potential of integrating expert annotations, specifically radiologist eye-gaze heatmaps, to alleviate these issues. Processing the eye-gaze data from radiologists [22] provides us with heatmaps indicative of the radiologist's attention across different regions of the X-ray images. This heatmap reflects areas of clinical interest aligned with details present in radiology reports. We posit that this could help capture nuanced visual cues in the X-rays and therefore pairing it with reports can enrich the CLIP training data with high-quality positive pairs. Due to the scarcity of such expert annotated data, we employ the mixup strategy, a data augmentation technique which has been effective in both supervised [13,48,62] and contrastive learning [33,49], to create additional synthetic samples." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": "We present eCLIP (expert-annotated CLIP), an adaptation of the CLIP model that incorporates expert eye-gaze heatmaps, without modifying the CLIP model's core architecture. The operational workflow of eCLIP is depicted in Fig. 2. Our contributions are as follows:" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 116, + 481, + 272 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 137, + 116, + 481, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 116, + 481, + 152 + ], + "spans": [ + { + "bbox": [ + 137, + 116, + 481, + 152 + ], + "type": "text", + "content": "- Utilization of Expert Annotations. We harness radiologist eye-gaze heatmaps to create additional embeddings, effectively introducing valuable positive and negative pairs for enhancing the contrastive learning process." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 152, + 481, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 152, + 481, + 212 + ], + "spans": [ + { + "bbox": [ + 138, + 152, + 481, + 212 + ], + "type": "text", + "content": "- eCLIP Architecture. Our implementation features a heatmap processing mechanism utilizing multi-headed attention (MHA), optimized for handling both heatmaps and original images. This is complemented by a mixup strategy to addresses the challenge of data scarcity, and curriculum learning to ensure a gradual introduction of expert annotations." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 212, + 481, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 212, + 481, + 272 + ], + "spans": [ + { + "bbox": [ + 138, + 212, + 481, + 272 + ], + "type": "text", + "content": "- Comprehensive Evaluation. We assess eCLIP's zero-shot classification accuracy, sample efficiency and cross-modal retrieval performance and embedding quality across multiple chest X-ray datasets. We also evaluate the cross-modal embeddings to generate radiology reports using a frozen Large Language Model (LLM) without explicitly fine-tuning on medical data." + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 292, + 237, + 304 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 292, + 237, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 292, + 237, + 304 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 317, + 481, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 317, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 317, + 481, + 413 + ], + "type": "text", + "content": "Modality Gap: Liang et al. [25] pinpoint the origins of the modality gap to the nuances of model initialization and the objectives of contrastive learning, underscoring its impact on downstream tasks and fairness. Oh et al. [33] highlight poor uniformity and alignment in CLIP's embeddings and propose a finetuning method for robust representations. Zhang et al. [67] explore the geometry of this embedding space, and provide both theoretical and empirical insights on the nature of this geometry. Subsequent research has produced methods to mitigate the modality gap through diverse and creative approaches [11, 12, 32, 46, 66]." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 415, + 481, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 481, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 481, + 592 + ], + "type": "text", + "content": "Improving Contrastive Learning: Several methods have improved upon the CLIP objective by introducing auxiliary losses, e.g., SLIP [30] uses SimCLR [4] loss, M3MAE [10,55] augment the Masked Autoencoder [14] reconstruction loss, FLIP [24] randomly masks out input images to improve scaling, DACL [49] proposes a domain agnostic mixup strategy, SILC [31] uses self-distillation, Mo et al. [28] utilized specialist captions to generate pseudo labels for unpaired images, Zhang et al. [63] propose Multi-task Paired Masking with Alignment to improve cross-modal interaction. Similarly there have been works that have identified the need to make the CLIP model focus on sub-regions in order to enhance its utility and downstream performance, GLoRIA [15] considers the loss from local regions from within the image and reports, Alpha-CLIP [45] uses the alpha channel to guide the CLIP model to focus on different regions of the image and generate the masks for all the images in the corpus using an image segmentation pipeline and TIER [35] uses a regularization term to improve the local focus of the model." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 481, + 665 + ], + "type": "text", + "content": "Multi-modal Contrastive Learning in Medical Imaging: Zhang et al. [65] demonstrated enhanced downstream performance by jointly using chest X-ray and report pairing for training a contrastive learning model. This was further improved by Huang et al. [15], by exploiting local and global features from both modalities; Wang et al. [54] and You et al. [59] achieved impressive results by using a Swin Tiny model as the image encoder and by adding modifications" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 482, + 200 + ], + "type": "text", + "content": "to the contrastive loss. Several other works have developed similar contrastive learning foundation models while utilizing the biomedical image texts to achieve impressive results [16, 29, 44, 47, 56, 58]. Karargyris et al. [22] and Bigolin et al. [3] augment a subset of the MIMIC-CXR [21] samples with high quality eye-tracking and verbal transcripts from several radiologists. van Sonsbeek et al. [43] and Wang et al. [50] utilize the heatmaps from eye-gaze to improve image classification." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 217, + 202, + 228 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 217, + 202, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 217, + 202, + 228 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": "Notations. For a given chest X-ray image " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "I_{i}" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": " and its radiology report " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "T_{i}" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": ", indexed by " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": " in our dataset, we denote their L2-normalized embeddings as " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "v_{i}" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "t_i" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": " respectively, residing in a d-dimensional space " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "(v_{i},t_{i}\\in \\mathcal{R}^{d})" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": ". Image embeddings are obtained through an encoder " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "v_{i} = f(I_{i})" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": " and text embeddings via " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "t_i = g(T_i)" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": ". Applying an expert heatmap " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "E_{i}" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": " to an image results in the corresponding image embedding " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "v_{i}^{E}" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": ". We denote the loss value for the " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": "-th sample as " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_i" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": ". For the case of contrastive loss, this is computed in terms of some similarity measure between the embeddings, " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "sim(v_{i},t_{i})" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": ", typically cosine similarity defined as " + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "inline_equation", + "content": "v_{i}\\cdot t_{i}" + }, + { + "bbox": [ + 131, + 239, + 482, + 338 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 351, + 221, + 363 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 351, + 221, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 351, + 221, + 363 + ], + "type": "text", + "content": "3.1 Background" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 369, + 482, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 369, + 482, + 418 + ], + "spans": [ + { + "bbox": [ + 131, + 369, + 482, + 418 + ], + "type": "text", + "content": "Central to CLIP's effectiveness is the InfoNCE loss [34], a mechanism engineered to optimize the similarity measures between corresponding (positive) pairs and to minimize those among non-corresponding (negative) pairs. The formulation of the CLIP loss objective is as follows:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 144, + 433, + 481, + 466 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 433, + 481, + 466 + ], + "spans": [ + { + "bbox": [ + 144, + 433, + 481, + 466 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {t e x t}} = \\underset {(t _ {i}, v _ {i}) \\sim p o s} {\\mathbb {E}} \\left[ - \\log \\frac {\\exp (s i m (t _ {i} , v _ {i}) / \\tau)}{\\exp (s i m (t _ {i} , v _ {i}) / \\tau) + \\sum_ {j \\neq i} \\exp (s i m (t _ {i} , v _ {j}) / \\tau)} \\right] \\tag {1}", + "image_path": "62b299e53359ad173f479c3d0060ed685d9eb4de0267ba50293a9a7a5366876a.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "text", + "content": "Total loss is then defined as, " + }, + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{total}} = \\frac{1}{2}\\left(\\mathcal{L}_{\\mathrm{text}} + \\mathcal{L}_{\\mathrm{image}}\\right)" + }, + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{image}}" + }, + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "text", + "content": " denotes the corresponding loss for the image to text mapping. Here, " + }, + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 131, + 472, + 482, + 533 + ], + "type": "text", + "content": " represents the temperature parameter that controls the scale of the similarity scores, typically framed as a learnable parameter during training. The loss expectation is taken over all the positive pairings in the dataset." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 533, + 482, + 606 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 533, + 482, + 606 + ], + "spans": [ + { + "bbox": [ + 131, + 533, + 482, + 606 + ], + "type": "text", + "content": "Theoretical results on CL indicate the concepts of alignment and uniformity as critical for the quality of embeddings [51, 52]. Alignment focuses on reducing the distance between positive pairs while uniformity seeks to evenly distribute the embeddings across the unit hypersphere, preventing extreme clustering that could impair the model's generalizability and discriminative capabilities. The alignment and uniformity can be defined formally as follows [33]:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 186, + 620, + 481, + 647 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 186, + 620, + 481, + 647 + ], + "spans": [ + { + "bbox": [ + 186, + 620, + 481, + 647 + ], + "type": "interline_equation", + "content": "\\text {A l i g n m e n t} = - \\mathbb {E} _ {\\left(v _ {i}, t _ {i}\\right) \\sim p o s} \\left[ \\| v _ {i} - t _ {i} \\| _ {2} ^ {2} - \\min _ {j \\neq i} \\| v _ {i} - t _ {j} \\| _ {2} ^ {2} \\right] \\tag {2}", + "image_path": "7192a21f04ecd0a6dbc1077a1e27f054fc13b81564c48184879fe9656b42ea30.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 186, + 648, + 481, + 664 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 186, + 648, + 481, + 664 + ], + "spans": [ + { + "bbox": [ + 186, + 648, + 481, + 664 + ], + "type": "interline_equation", + "content": "\\mathrm {U n i f o r m i t y} = - \\log \\mathbb {E} _ {(v _ {i}, t _ {j}) \\sim \\mathcal {D}} \\left[ \\exp (- 2 \\| v _ {i} - t _ {j} \\| _ {2} ^ {2}) \\right] \\tag {3}", + "image_path": "99abfe1fee8d7551b5785db3fb0e098e2c1fdb2eedfa831c6236de92130dbb0d.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 177, + 118, + 252, + 199 + ], + "blocks": [ + { + "bbox": [ + 177, + 118, + 252, + 199 + ], + "lines": [ + { + "bbox": [ + 177, + 118, + 252, + 199 + ], + "spans": [ + { + "bbox": [ + 177, + 118, + 252, + 199 + ], + "type": "image", + "image_path": "199377f11c57e7f243444a20b6fd69d54cb619bdc3ec24ef532fc946ed837fab.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "lines": [ + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "spans": [ + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": "Fig. 3: Comparing eCLIP with " + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "inline_equation", + "content": "m^2" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": "-mixup [33]. (left) Standard CLIP showing image-text positive pairs " + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "inline_equation", + "content": "(v_i, t_i)" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": " (solid line), while the other image embeddings serve as negative pairs (dashed line). (center) the " + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "inline_equation", + "content": "m^2" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": "-mixup creates negative pairs " + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "inline_equation", + "content": "(v_j^\\lambda, t_i)" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": " via interpolation between embeddings along the geodesic. (right) eCLIP adds expert image embedding, " + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "inline_equation", + "content": "v_i^E" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": ", in addition to " + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "inline_equation", + "content": "v_i" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": " for text " + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "inline_equation", + "content": "t_i" + }, + { + "bbox": [ + 130, + 209, + 482, + 276 + ], + "type": "text", + "content": ", forming additional positive and negative pairs" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 263, + 119, + 338, + 200 + ], + "blocks": [ + { + "bbox": [ + 263, + 119, + 338, + 200 + ], + "lines": [ + { + "bbox": [ + 263, + 119, + 338, + 200 + ], + "spans": [ + { + "bbox": [ + 263, + 119, + 338, + 200 + ], + "type": "image", + "image_path": "3b72a706562807f42f35658b6c5aefa4a27f5860eefc26b25355e6a92647109c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 352, + 118, + 425, + 200 + ], + "blocks": [ + { + "bbox": [ + 352, + 118, + 425, + 200 + ], + "lines": [ + { + "bbox": [ + 352, + 118, + 425, + 200 + ], + "spans": [ + { + "bbox": [ + 352, + 118, + 425, + 200 + ], + "type": "image", + "image_path": "f15e63f971990328f480afb83d774722c7e20064b72c8e09e5b137f2db4e57c0.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 300, + 482, + 433 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 482, + 433 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 482, + 433 + ], + "type": "text", + "content": "High intra-modal similarity, e.g. between two images as seen in Fig. 1, can inadvertently enhance similarity among negative pairs, inflating the denominator of the loss function in Equation (1), and, consequently, hurting the model's ability to differentiate between positive and negative pairs during training. A conventional method to counter this involves incorporating hard negative pairs, a strategy Oh et al. [33] employ by mixing embeddings from different modalities. While effective, this cross-modal mixup may obscure the semantic clarity of embeddings. As an alternative we propose increasing the dataset with additional positive pairs that exhibit minimal semantic overlap by integrating expert annotations. Fig. 3 compares the positive and negative pair creation in eCLIP with traditional CLIP and " + }, + { + "bbox": [ + 130, + 300, + 482, + 433 + ], + "type": "inline_equation", + "content": "m^2" + }, + { + "bbox": [ + 130, + 300, + 482, + 433 + ], + "type": "text", + "content": "-mixup." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 452, + 369, + 464 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 452, + 369, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 452, + 369, + 464 + ], + "type": "text", + "content": "3.2 Introducing Expert Annotations to CLIP" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 473, + 482, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 473, + 482, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 473, + 482, + 616 + ], + "type": "text", + "content": "Our objective with eCLIP is to enhance the CLIP framework by integrating expert annotations - radiologist eye-gaze heatmaps - to diversify the pool of positive samples. The eCLIP model is designed to be compatible across all CLIP variants without modifying its core architecture. The heatmap processor (Fig. 2, right) first converts the images and heatmaps into a sequence of patches and applies multi-headed attention (MHA) over the sequences. The patched heatmap overlaid images serve as queries, while the original image's patches act as keys and values. The processed output is then reconstructed back to its original image format, enabling the standard CLIP image encoder to obtain expert image embeddings. These new embeddings and their text embedding pair introduce additional positive samples for the contrastive loss objective (Fig. 3, right)." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "However, the size of the expert annotated data is orders of magnitude smaller than the data available for CLIP training. To effectively leverage the scarce expert-annotated data, we implement mixup augmentation [62]. As illustrated in Fig. 2 (left), this involves blending an original image " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "I_{i}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " with its expert version" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 132, + 129, + 481, + 372 + ], + "blocks": [ + { + "bbox": [ + 132, + 115, + 276, + 128 + ], + "lines": [ + { + "bbox": [ + 132, + 115, + 276, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 115, + 276, + 128 + ], + "type": "text", + "content": "Algorithm 1 eCLIP Algorithm" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "lines": [ + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "spans": [ + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": "Require: Image Encoder " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "f(\\cdot)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " // Compute Total Loss \nRequire: Text Encoder " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "g(\\cdot)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n1: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{priming}} \\gets 0; n_{\\mathrm{p}} \\gets 0" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n2: for minibatch " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "\\{x_i\\}_{i=1}^N" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " do \n3: Unpack " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "x_i" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "(T_i, I_i)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " and optionally " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "E_i" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n4: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "t_i \\gets g(T_i)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n5: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "v_i \\gets f(I_i)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n6: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "p_{\\mathrm{uni}} \\sim \\mathrm{Uniform}(0,1)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n7: if " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "p_{\\mathrm{uni}} < p_{\\mathrm{curr}}" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "E_i" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " is provided then \n8: // Process expert image \n9: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "\\lambda \\sim \\mathrm{Beta}(\\alpha, \\alpha)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n10: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "I_i^E \\gets \\mathrm{HeatmapProcessor}(I_i, E_i)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n11: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "I_i^\\lambda \\gets I_i\\lambda + I_i^E(1 - \\lambda)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n12: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "v_i^\\lambda \\gets f(I_i^\\lambda)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n13: end if \n14: if " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "E_i" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " is entirely ones then \n15: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "I_i^R \\gets \\mathrm{HeatmapProcessor}(I_i, E_i)" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n16: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{priming}} \\gets \\mathcal{L}_{\\mathrm{priming}} + (I_i - I_i^R)^2" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n17: " + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "inline_equation", + "content": "n_{\\mathrm{p}} \\gets n_{\\mathrm{p}} + 1" + }, + { + "bbox": [ + 132, + 129, + 481, + 372 + ], + "type": "text", + "content": " \n18: end if \n19: end for" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "I_{i}^{E}" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": " to create " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "I_{i}^{\\lambda} = \\lambda I_{i} + (1 - \\lambda)I_{i}^{E}" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "\\lambda \\sim \\mathrm{Beta}(\\alpha, \\alpha)" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": ". (We set " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "\\alpha = 0.3" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": " in all our experiments.) The eCLIP image encoder then processes " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "I_{i}^{\\lambda}" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": " to produce the image embedding " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "v_{i}^{\\lambda} = f(I_{i}^{\\lambda})" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": ". These expert embeddings form new positive pairs " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "(v_{i}^{\\lambda}, t_{i})" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": " as well as corresponding negative pairs, which are added with existing pairs " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "(v_{i}, t_{i})" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": " during the computation of the CLIP InfoNCE Loss, " + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{i}" + }, + { + "bbox": [ + 130, + 397, + 480, + 458 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "text", + "content": "To seamlessly integrate expert annotations without disrupting the foundational training of the eCLIP model, we employ a phased curriculum learning strategy [2]. This approach comprises a cold start phase where the model is initially trained without the expert annotations to establish a robust baseline. This phase accounts for about " + }, + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "text", + "content": " of the total training iterations. It then transitions into a warmup phase, gradually increasing the inclusion of expert examples from 0.05 to 0.5 probability over the next " + }, + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "inline_equation", + "content": "30\\%" + }, + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "text", + "content": " of iterations. Finally, a cooldown phase reduces expert example probability to 0.1 for the subsequent " + }, + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "inline_equation", + "content": "40\\%" + }, + { + "bbox": [ + 130, + 460, + 481, + 579 + ], + "type": "text", + "content": " of iterations, fine-tuning the model's performance by balancing foundational and expert-driven insights." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "content": "Additionally, we regularize the heatmap processor to behave as an identity function in scenarios where the heatmap is entirely composed of ones. We achieve this through a priming phase that coincides with the curriculum learning's cold start phase. We setup an auxiliary mean-squared error loss to force the heatmap processor to reconstruct the original image " + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "I_{i}" + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "content": " when the heatmap " + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "E_{i} = 1" + }, + { + "bbox": [ + 130, + 582, + 481, + 666 + ], + "type": "text", + "content": ". This priming ensures the heatmap processor's adaptability, allowing it to process expert annotations effectively when available, while falling back to the" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": "model's original performance in their absence. The total loss during this phase is, " + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\mathrm{total}} = w_{\\mathrm{p}}\\cdot \\mathcal{L}_{\\mathrm{priming}} + (1 - w_{\\mathrm{p}})\\cdot \\mathcal{L}_{\\mathrm{clip}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "inline_equation", + "content": "w_{\\mathrm{p}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 152 + ], + "type": "text", + "content": " is a hyperparameter which we set to 0.1. The pseudocode for eCLIP is shown in Algorithm 1." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 170, + 230, + 183 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 170, + 230, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 170, + 230, + 183 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 194, + 482, + 277 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 194, + 482, + 277 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 482, + 277 + ], + "type": "text", + "content": "Our experiments are designed to evaluate the influence of expert heatmap annotations on the quality of the learned representations. Unless stated otherwise, we assume that a large set of image-text pairs, of which a small fraction is annotated with eye-gaze heatmaps, is used for training, but for test samples no annotations are used. We utilize both quantitative measures and qualitative assessments to study the contributions of these annotations towards enhancing model performance. The source code is available online." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 295, + 190, + 307 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 295, + 190, + 307 + ], + "spans": [ + { + "bbox": [ + 132, + 295, + 190, + 307 + ], + "type": "text", + "content": "4.1 Setup" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "spans": [ + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "text", + "content": "Baselines To validate our approach, we compare eCLIP against a model trained using traditional CLIP (referred to as the base model) and a \"naive\" baseline, where the expert annotated samples are directly added to the training set without using mixup or curriculum learning. We also examine the impact of two mixup methods: Domain Agnostic Contrastive Learning (DACL) [49] and " + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "inline_equation", + "content": "m^3" + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "text", + "content": "-mixup [33] which blends image and text embeddings to improve alignment and uniformity across modalities. While DACL is integrated during pretraining, " + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "inline_equation", + "content": "m^3" + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "text", + "content": "-mixup is applied post-pretraining, in a manner akin to fine-tuning. eCLIP can be applied to any variant of CLIP, which we demonstrate also with GLoRIA [15] which has a Resnet50 image encoder. We introduce two variants of our technique: eCLIP, which integrates expert annotations during the initial CLIP pretraining phase, and eCLIP" + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "inline_equation", + "content": "^{\\mathcal{P}}" + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "text", + "content": ", which instead continually finetunes a trained CLIP model with expert annotations, similar to " + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "inline_equation", + "content": "m^3" + }, + { + "bbox": [ + 130, + 313, + 482, + 469 + ], + "type": "text", + "content": "-mixup." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 486, + 482, + 570 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 570 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 570 + ], + "type": "text", + "content": "Datasets For pretraining phase we utilize the MIMIC-CXR dataset [21], which pairs roughly 200K chest X-rays with free-text radiology reports. The images were processed into JPEG format as described in [20], and the accompanying reports were stripped of unnecessary punctuation and tokenized using the Wordpiece scheme [7]. We obtain the eye-gaze heatmap from the EGD-CXR dataset [6] and process the eye-tracking data to obtain the normalized eye-gaze heatmap which are available for 1080 datapoints." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "Our evaluation setup includes multiple publicly available chest X-ray datasets, specifically CheXpert [17], RSNA Pneumonia [39], NIH CXR [53] and Open-I [6], each offering a distinct set of imaging and reporting characteristics. Following previous works [15, 54, 59], we prepare the test sets from MIMIC and CheXpert, selecting 200 random samples for five specific pathologies from the CheXpert competition, resulting in 1000 samples for each dataset (MIMIC 5x200 and CheXpert 5x200, respectively). For the NIH-CXR dataset, we assembled a subset of 100 samples for each of 14 abnormalities, thereby creating CXR 14x100" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 134, + 116, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 116, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 134, + 116, + 479, + 163 + ], + "type": "text", + "content": "test set. The Open-I dataset is utilized for text retrieval and radiology report generation tasks. For linear probe evaluations, we use CXR-8 [53], RSNA dataset and construct an OpenI-5 dataset by extracting labels from the 'Problems' field within the reports that match the CheXpert competition labels." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "spans": [ + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": "Training We employed CLIP pretraining on the MIMIC-CXR dataset, utilizing a subset with roughly 1000 images with expert eye-gaze heatmap annotations, while validation and all other downstream evaluations proceed without these annotations. Our model architecture includes Swin Tiny, following recent studies [54,59], alongside Vision Transformer (ViT) Small and Base, with image encoders pretrained on ImageNet and Clinical BERT [1] with max length of sequences set to 256 as the text encoder. We cropped images to (224, 224) using random resized crop augmentation and turned off all other image augmentations. Pretraining utilized 8 AMD MI250X GPUs, maintaining an effective batch size of 512 for 10,000 steps. The learning rate was " + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "inline_equation", + "content": "1e^{-4}" + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": " for standard CLIP, increased to " + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "inline_equation", + "content": "2e^{-4}" + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": " for eCLIP variants, with cosine annealing plus a linear warmup for the first " + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": " of iterations, weight decay of " + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "inline_equation", + "content": "1e^{-3}" + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": ", and learnable temperature parameter in the contrastive loss initialized at 0.07. Models for " + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "inline_equation", + "content": "m^3" + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": "-mixup and " + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "inline_equation", + "content": "\\mathrm{eCLIP}^{\\mathcal{P}}" + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": " are initialized with weights from CLIP pretraining and further finetuned for 1,000 iterations with a learning rate of " + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "inline_equation", + "content": "1e^{-5}" + }, + { + "bbox": [ + 134, + 179, + 480, + 370 + ], + "type": "text", + "content": ". Detailed setup information is available in the Supplement." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 134, + 387, + 312, + 399 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 387, + 312, + 399 + ], + "spans": [ + { + "bbox": [ + 134, + 387, + 312, + 399 + ], + "type": "text", + "content": "4.2 Zero-shot Image Classification" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 405, + 480, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 405, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 134, + 405, + 480, + 511 + ], + "type": "text", + "content": "Following CLIP [36], our zero-shot classification method categorizes images into predefined classes without direct finetuning, thus relying on the quality of embeddings generated during pretraining. To formulate the embedding of each class label, we first generate descriptive prompts to obtain a list of text embeddings corresponding to the label using the text encoder [15, 54, 59]. The mean of these embeddings is taken as the representation of the label. For each image, classification is then performed by matching the image embedding with its closest label embedding through cosine similarity. More details of the prompts used are provided in the Supplement." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 134, + 513, + 479, + 606 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 513, + 479, + 606 + ], + "spans": [ + { + "bbox": [ + 134, + 513, + 479, + 606 + ], + "type": "text", + "content": "Tab. 1 illustrates the zero-shot classification performance on CheXpert 5x200, MIMIC 5x200, RSNA, and CXR 14x100 datasets. The results, based on macro-averaged F1 scores from three random initializations, highlight eCLIP variants' superior performance over the base models across all datasets. While the " + }, + { + "bbox": [ + 134, + 513, + 479, + 606 + ], + "type": "inline_equation", + "content": "m^3" + }, + { + "bbox": [ + 134, + 513, + 479, + 606 + ], + "type": "text", + "content": "-mixup excels in MIMIC for certain architectures, eCLIP variants show broader generalization. Notably, eCLIP's advantages are more pronounced in multi-class scenarios (CheXpert, MIMIC and CXR14) compared to binary classification on RSNA." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 624, + 247, + 635 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 624, + 247, + 635 + ], + "spans": [ + { + "bbox": [ + 134, + 624, + 247, + 635 + ], + "type": "text", + "content": "4.3 Sample Efficiency" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 134, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 641, + 479, + 665 + ], + "type": "text", + "content": "Sample efficiency measures how well a model learns from limited amount of training data. eCLIP improves this efficiency by using expert annotated im" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 150, + 168, + 465, + 491 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 160 + ], + "type": "text", + "content": "Table 1: Zero-shot classification performance on 4 X-ray datasets and model configurations, reported as macro-averaged F1 scores from three independent random seeds. The highest score per dataset and model configuration is underlined. The overall best-performing model for each dataset is highlighted in bold." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 150, + 168, + 465, + 491 + ], + "lines": [ + { + "bbox": [ + 150, + 168, + 465, + 491 + ], + "spans": [ + { + "bbox": [ + 150, + 168, + 465, + 491 + ], + "type": "table", + "html": "
ModelDataset
Chexpert 5x200MIMIC 5x200RSNACXR 14x100
GLoRIAResnet500.478±.0230.457±.0160.736±.0240.155±.001
+naive0.391±.0690.334±.0570.731±.0230.113±.024
+DACL0.506±.0290.430±.0110.736±.0070.158±.004
+m3-mix0.512±.0050.467±.0040.760±.0060.160±.003
+expert (ours)0.507±.0040.430±.0090.761±.0170.156±.023
+expertP(ours)0.507±.0050.475±.0080.775±.0010.159±.001
CLIPSwin Tiny0.517±.0250.452±.0020.808±.0000.169±.003
+naive0.532±.0100.452±.0220.807±.0070.167±.007
+DACL0.465±.0080.389±.0150.768±.0180.101±.013
+m3-mix0.554±.0060.469±.0080.802±.0040.179±.008
+expert (ours)0.549±.0160.445±.0210.818±.0040.172±.006
+expertP(ours)0.558±.0040.463±.0070.819±.0000.192±.003
CLIPViT Small0.525±.0240.441±.0060.807±.0060.159±.007
+naive0.534±.0160.440±.0190.805±.0040.156±.017
+DACL0.475±.0250.398±.0150.761±.0090.133±.007
+m3-mix0.557±.0020.454±.0030.809±.0020.164±.002
+expert (ours)0.545±.0160.452±.0130.803±.0030.165±.007
+expertP(ours)0.559±.0010.439±.0040.817±.0010.165±.004
CLIPViT Base0.540±.0170.465±.0040.805±.0010.183±.011
+naive0.506±.0110.426±.0060.805±.0040.151±.009
+DACL0.474±.0070.400±.0020.759±.0010.106±.003
+m3-mix0.542±.0210.465±.0130.798±.0040.183±.020
+expert (ours)0.563±.0210.477±.0040.814±.0030.193±.017
+expertP(ours)0.549±.0030.452±.0070.810±.0010.185±.002
", + "image_path": "eea71e1a60b0501e605f60dacef126e32537149b9959dfe6a4a201f99f6e8b0c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "ages to form new positive and negative pairs, aiming to improve the quality of the learned embeddings. To test this, we first looked at zero-shot classification performance, adjusting the number of training batches available for pretraining. Results, shown in Fig. 4 (top row), reveal that eCLIP is more sample efficient across MIMIC 5x200, CheXpert 5x200 and CXR 14x100 datasets compared to the base model. Additionally, by applying supervised fine-tuning (SFT) with a linear probe on class-imbalanced datasets - CXR-8, RSNA and OpenI-5 (Sec. 4.1) - eCLIP demonstrates stronger performance in multi-label classification tasks, CXR-8 and OpenI-5 and remains competitive in binary classification for RSNA. This is shown in Fig. 4 (bottom row) where we plot the ROC AUC scores against different training sample sizes for linear probing. These findings highlight eCLIP's ability to effectively learn from fewer samples." + } + ] + } + ], + "index": 4 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 169, + 116, + 260, + 188 + ], + "blocks": [ + { + "bbox": [ + 169, + 116, + 260, + 188 + ], + "lines": [ + { + "bbox": [ + 169, + 116, + 260, + 188 + ], + "spans": [ + { + "bbox": [ + 169, + 116, + 260, + 188 + ], + "type": "image", + "image_path": "dc2e4670e024d6f3b2333c54b99d3c168ff07671300e27842f90d2a4e04d794a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 263, + 116, + 352, + 188 + ], + "blocks": [ + { + "bbox": [ + 263, + 116, + 352, + 188 + ], + "lines": [ + { + "bbox": [ + 263, + 116, + 352, + 188 + ], + "spans": [ + { + "bbox": [ + 263, + 116, + 352, + 188 + ], + "type": "image", + "image_path": "73ed6b375a88ca48f932cd1f9291d45f42782ed71a8c2191a4cfbe6265e5b460.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 354, + 116, + 446, + 188 + ], + "blocks": [ + { + "bbox": [ + 354, + 116, + 446, + 188 + ], + "lines": [ + { + "bbox": [ + 354, + 116, + 446, + 188 + ], + "spans": [ + { + "bbox": [ + 354, + 116, + 446, + 188 + ], + "type": "image", + "image_path": "1a68cb4853412b7b6b1807655629850318d58902b5d4be0fac4d6d086e60a64c.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 169, + 193, + 261, + 264 + ], + "blocks": [ + { + "bbox": [ + 169, + 193, + 261, + 264 + ], + "lines": [ + { + "bbox": [ + 169, + 193, + 261, + 264 + ], + "spans": [ + { + "bbox": [ + 169, + 193, + 261, + 264 + ], + "type": "image", + "image_path": "3525da3b71ca747c28ada3de628167b670b88048871c786d4993d0ff6b611e74.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 275, + 482, + 319 + ], + "lines": [ + { + "bbox": [ + 130, + 275, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 275, + 482, + 319 + ], + "type": "text", + "content": "Fig. 4: Sample Efficiency. (top row) Zero-shot performance on three multi-label classification test sets for CLIP and eCLIP Swin Tiny models, trained with varying amounts of training batches. (bottom row) Linear probe scores with varying amounts of training data." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 263, + 193, + 352, + 264 + ], + "blocks": [ + { + "bbox": [ + 263, + 193, + 352, + 264 + ], + "lines": [ + { + "bbox": [ + 263, + 193, + 352, + 264 + ], + "spans": [ + { + "bbox": [ + 263, + 193, + 352, + 264 + ], + "type": "image", + "image_path": "ebfb2ea057e0bb8fb6005598a6278788ff2dc5cbb5328774c1bba9c7c9078b68.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 355, + 193, + 444, + 264 + ], + "blocks": [ + { + "bbox": [ + 355, + 193, + 444, + 264 + ], + "lines": [ + { + "bbox": [ + 355, + 193, + 444, + 264 + ], + "spans": [ + { + "bbox": [ + 355, + 193, + 444, + 264 + ], + "type": "image", + "image_path": "d2d7b9f9fd495dbc93e377a552d90b5240339b24ad0657e85c01adea0263041d.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 344, + 449, + 357 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 344, + 449, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 344, + 449, + 357 + ], + "type": "text", + "content": "4.4 Text retrieval and retrieval augmented generation (RAG)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": "To compare eCLIP's cross-modal functionality with that of CLIP we focused on text retrieval task using the Open-I dataset, which consists of pairs of X-rays and radiology reports. We used the FAISS vector database [8] to index the text embeddings generated by the text encoder. For a given X-ray image " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "I_{i}" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": ", we then retrieve the closest text reports from the database based on the cosine similarity in the embedding space, " + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "inline_equation", + "content": "\\min_j(v_i\\cdot t_j)" + }, + { + "bbox": [ + 130, + 365, + 482, + 520 + ], + "type": "text", + "content": ". Results in Tab. 2 compare the performance of eCLIP against CLIP in text retrieval measured in Recall@1, 5, and 10. The performance of eCLIP indicates a notable improvement in its embedding quality. Note that our evaluation followed a strict criterion for recall computation, where a retrieval was counted as successful only if the exact correct report was identified. While more nuanced measures based on semantic similarity could be employed [59], we opted this approach to maintain a clear and simple evaluation framework." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "Next we extend our analysis from retrieval to report generation using a frozen Large Language Model (LLM), Mistral 7B Instruct v2 [19], aiming to generate radiology reports through Retrieval Augmented Generation (RAG). This setup tests the CLIP model's capacity to retrieve texts which can be used to prompt an LLM to generate a report without finetuning on medical data. First we randomly selected 389 samples from the Open-I dataset for testing and utilized the FAISS database to index the reports from the remaining samples (i.e., training set). Given a test image we retrieve five closest reports from the training set and use them in the prompt for the LLM to generate a report for the test image. The eCLIP variant showed a small but consistent improvement over the base model in generating reports, as indicated in Tab. 3. A comparative analysis of generated report versus ground truth shown in Tab. 5, with discrepancies marked, further" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 157, + 288, + 276 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 301, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 301, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 301, + 148 + ], + "type": "text", + "content": "Table 2: Performance on Image to Report retrieval with Open-I dataset. We report the Recall@{1, 5, 10}" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 157, + 288, + 276 + ], + "lines": [ + { + "bbox": [ + 132, + 157, + 288, + 276 + ], + "spans": [ + { + "bbox": [ + 132, + 157, + 288, + 276 + ], + "type": "table", + "html": "
ModelR@1R@5R@10
CLIP_Swin_Tiny3.17.611.3
+m3-mix2.46.59.8
+expert (ours)3.79.413.4
+expertP(ours)3.18.211.7
CLIP_ViT_Base3.79.213.2
+m3-mix4.18.813.0
+expert (ours)4.410.313.5
+expertP(ours)3.99.413.2
", + "image_path": "4c83cb67d9115fb95a4442283c59688fe394ccecb356abcbc07ab1f60a3872b3.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 132, + 381, + 310, + 439 + ], + "blocks": [ + { + "bbox": [ + 132, + 284, + 301, + 373 + ], + "lines": [ + { + "bbox": [ + 132, + 284, + 301, + 373 + ], + "spans": [ + { + "bbox": [ + 132, + 284, + 301, + 373 + ], + "type": "text", + "content": "Table 3: Performance on report generation with Open-I dataset. We report the BLEU-2 score (BL-2), BERT recall score [64] (B-R), Cosine similarity between the sentence embeddings of the generated and ground-truth report for MPNet [42] Sentence Transformer model [38] " + }, + { + "bbox": [ + 132, + 284, + 301, + 373 + ], + "type": "inline_equation", + "content": "(\\mathrm{S}_{emb})" + }, + { + "bbox": [ + 132, + 284, + 301, + 373 + ], + "type": "text", + "content": " ,and for the CheXBERT model [41] " + }, + { + "bbox": [ + 132, + 284, + 301, + 373 + ], + "type": "inline_equation", + "content": "(\\mathrm{CB}_{emb})" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 381, + 310, + 439 + ], + "lines": [ + { + "bbox": [ + 132, + 381, + 310, + 439 + ], + "spans": [ + { + "bbox": [ + 132, + 381, + 310, + 439 + ], + "type": "table", + "html": "
ModelBL-2B-RSembCBemb
CLIP0.1720.7130.7910.492
+m3-mix0.1720.7110.7880.496
eCLIP0.1770.7120.7950.506
", + "image_path": "0b64094d01e69b2929b9d46a24c3d04111d2481f2d62572f978ead39ea421f02.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 312, + 289, + 484, + 446 + ], + "blocks": [ + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "lines": [ + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "spans": [ + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "text", + "content": "Table 4: Ablation Study with Swin Tiny. Zero-shot performance on CheXpert (CXP) and CXR14 (C14) datasets for the base CLIP and models with expert annotation integration " + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "inline_equation", + "content": "(+\\mathrm{E})" + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "text", + "content": " is presented. Methods include mask multiplication " + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "inline_equation", + "content": "(\\odot)" + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "text", + "content": ", CNN, and Multi-headed Attention (MHA) encoders. Key augmentations: Mixup " + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "inline_equation", + "content": "(+\\mathrm{M})" + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "text", + "content": ", Curriculum Learning " + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "inline_equation", + "content": "(+\\mathrm{C})" + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "text", + "content": ", and Encoder Priming " + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "inline_equation", + "content": "(+\\mathrm{P})" + }, + { + "bbox": [ + 310, + 114, + 482, + 278 + ], + "type": "text", + "content": " demonstrate performance gains. A control with a random mask (rand) confirms the significance of expert annotations. We report macro-averaged F1 scores from three random initialization" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 312, + 289, + 484, + 446 + ], + "lines": [ + { + "bbox": [ + 312, + 289, + 484, + 446 + ], + "spans": [ + { + "bbox": [ + 312, + 289, + 484, + 446 + ], + "type": "table", + "html": "
MethodCXPC14
Base0.517±.0240.169±.003
⊗ Mask (+ E)0.540±.0190.165±.006
CNN Encoder (+ E)0.534±.0120.163±.008
MHA Encoder (+ E)0.534±.0130.153±.002
MHA Encoder (+ E, M)0.532±.0180.160±.010
MHA Encoder (+ E, M, C)0.545±.0080.173±.018
MHA Encoder (+ rand, M, C, P)0.537±.0200.166±.003
MHA Encoder (+ E, M, C, P)0.549±.0160.172±.006
", + "image_path": "afe96a94126e0b0867f38a6c46125a38cb4328d6233ea059198c9d55aad13d36.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 465, + 480, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 465, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 465, + 480, + 502 + ], + "type": "text", + "content": "validates the effectiveness of eCLIP's embeddings in supporting complex cross-modal tasks. Additional details, including LLM prompts and generated report samples are available in the Supplement." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 516, + 259, + 529 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 516, + 259, + 529 + ], + "spans": [ + { + "bbox": [ + 132, + 516, + 259, + 529 + ], + "type": "text", + "content": "4.5 Embedding Quality" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 533, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 641 + ], + "type": "text", + "content": "For qualitative evaluations, we first examine the histogram of the cosine similarities of the embeddings from different abnormality subgroups obtained from the CLIP image encoder. In Fig. 5 (top row), we can see that the similarities for the CLIP model has considerably dropped below 1 after continual pretraining on MIMIC-CXR compared to Fig. 1. This indicates that the model's ability to distinguish between different conditions has improved. The introduction of expert annotations in the eCLIP variant further improves this with mean cosine similarities for 'normal' versus cardiomegaly, atelectasis and opacity dropping to 0.36, 0.4 and 0.4 respectively." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "Our evaluation of uniformity and alignment reveals that eCLIP surpasses both the MIMIC-pretrained and internet-pretrained models in these key metrics," + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 137, + 178, + 474, + 399 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 5: Random samples of generated report. For each image in the Open-I dataset, the five closest text snippets based on embedding cosine similarity is used as prompts for Mistral 7B LLM. Utilizing in-context learning, we prompt the LLM with two such snippet-report pairs. The conditions that the generated report identified correctly are highlighted in green while those it missed are shown in red." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 137, + 178, + 474, + 399 + ], + "lines": [ + { + "bbox": [ + 137, + 178, + 474, + 399 + ], + "spans": [ + { + "bbox": [ + 137, + 178, + 474, + 399 + ], + "type": "table", + "html": "
ProblemsGround TruthGenerated
normalThe lungs and pleural spaces show no acute abnormality. Heart size and pulmonary vascularity within normal limits.The lungs are clear with no evidence of consolidation, pneumothorax, or pleural effusion. Heart size and mediastinal contour are normal. No acute abnormalities noted in the visualized osseous structures.
Pulmonary At-electasis. Pleural Effusion. Cardiomegaly. Pulmonary CongestionAP and lateral views were obtained. Bibasilar atelectasis and small left-sided pleural effusion. Stable cardiomegaly. No pneumothorax. Mild pulmonary vascular congestion.The lungs show bibasilar airspace opacities, possibly due to infection or atelectasis. Heart size is mildly enlarged. No pneumothorax or pleural effusion.
Lung. Density. EmphysemaThere is hyperexpansion. The heart size is normal. There is no pleural effusion or pneumothorax. Two circular densities overlying the right ribs which were not present in the XXXX CT. No focal infiltratesThe lungs are hyperexpanded with clear fields and no acute consolidations or pleural effusions. Heart size and pulmonary vascularity are within normal limits. Degenerative changes are present in the thoracic spine. A calcified granuloma is noted in the left perihilar region. No pneumothorax or large pleural effusion is observed.
", + "image_path": "353a50900c3d2a057d934993645745044b27d037fbbf8e4658ba68f64eff2231.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 422, + 482, + 494 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 494 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 494 + ], + "type": "text", + "content": "indicating a marked improvement in the quality of embeddings (Fig. 5, bottom left). We also note a modest decrease in the modality gap with eCLIP (Fig. 5, bottom center). Clustering analysis via K-means (with " + }, + { + "bbox": [ + 130, + 422, + 482, + 494 + ], + "type": "inline_equation", + "content": "k = 5" + }, + { + "bbox": [ + 130, + 422, + 482, + 494 + ], + "type": "text", + "content": " for 5 abnormalities in data) highlights eCLIP's superior performance in grouping abnormalities, as seen from improved scored in Normalized Mutual Information (NMI), Silhouette score, and Calinski-Harabasz (CH) index (Fig. 5, bottom right)." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 512, + 238, + 525 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 238, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 238, + 525 + ], + "type": "text", + "content": "4.6 Ablation Study" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Our ablation study with the Swin Tiny encoder shows the impact of key components in our eCLIP model: multi-headed attention (MHA) layer for heatmap processing, curriculum learning for phased introduction of expert annotations, mixup augmentation to compensate for limited number of export annotated data and priming of heatmap processor during initial training phase. Results shown in Tab. 4 reveal that the MHA-based heatmap processor improves zero-shot classification performance on CheXpert 5x200 and CXR 14x100 datasets compared to basic methods like direct application of heatmaps as mask (" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\odot" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "Mask) or using a CNN encoder. We note a significant performance drop with randomly generated heatmaps versus expert eye-gaze heatmaps. This highlights that while our methodological improvements contribute to the performance gains, the in" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 115, + 230, + 189 + ], + "blocks": [ + { + "bbox": [ + 151, + 115, + 230, + 189 + ], + "lines": [ + { + "bbox": [ + 151, + 115, + 230, + 189 + ], + "spans": [ + { + "bbox": [ + 151, + 115, + 230, + 189 + ], + "type": "image", + "image_path": "2272f010eb80f246b16f322d19e7a20f4db88dbf607c559b88169858e87d9480.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 232, + 116, + 307, + 189 + ], + "blocks": [ + { + "bbox": [ + 232, + 116, + 307, + 189 + ], + "lines": [ + { + "bbox": [ + 232, + 116, + 307, + 189 + ], + "spans": [ + { + "bbox": [ + 232, + 116, + 307, + 189 + ], + "type": "image", + "image_path": "69ed5c70a743be77b6d0c3719ff0de8b3bd40719325c7548e5d53cea3a7f1bc2.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 309, + 116, + 384, + 189 + ], + "blocks": [ + { + "bbox": [ + 309, + 116, + 384, + 189 + ], + "lines": [ + { + "bbox": [ + 309, + 116, + 384, + 189 + ], + "spans": [ + { + "bbox": [ + 309, + 116, + 384, + 189 + ], + "type": "image", + "image_path": "212e4f8e20f91c607835cb493e85ef90056014c81f724febf66b921989ebbeae.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 386, + 116, + 461, + 189 + ], + "blocks": [ + { + "bbox": [ + 386, + 116, + 461, + 189 + ], + "lines": [ + { + "bbox": [ + 386, + 116, + 461, + 189 + ], + "spans": [ + { + "bbox": [ + 386, + 116, + 461, + 189 + ], + "type": "image", + "image_path": "5c8ff4805b5fd12d79a8894356cb8b92bcbc4a5a58a0301306eaaf712044315c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 152, + 193, + 260, + 263 + ], + "blocks": [ + { + "bbox": [ + 152, + 193, + 260, + 263 + ], + "lines": [ + { + "bbox": [ + 152, + 193, + 260, + 263 + ], + "spans": [ + { + "bbox": [ + 152, + 193, + 260, + 263 + ], + "type": "image", + "image_path": "1a23f8e9e09b1527ba885d82b5a03544e0088a6195cba15ebefc3112832ce5f5.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 281, + 482, + 346 + ], + "lines": [ + { + "bbox": [ + 131, + 281, + 482, + 346 + ], + "spans": [ + { + "bbox": [ + 131, + 281, + 482, + 346 + ], + "type": "text", + "content": "Fig. 5: Qualitative Analysis of CLIP Pretraining. top row illustrates the cosine similarity distributions for CLIP and eCLIP image embeddings. bottom left and center sections display uniformity, alignment, and modality gap comparisons among the internet pretrained model (ZS), CLIP pretrained on MIMIC, and eCLIP. bottom right details K-means clustering metrics for image embeddings with " + }, + { + "bbox": [ + 131, + 281, + 482, + 346 + ], + "type": "inline_equation", + "content": "k = 5" + }, + { + "bbox": [ + 131, + 281, + 482, + 346 + ], + "type": "text", + "content": " for both CLIP and eCLIP models." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 265, + 193, + 354, + 262 + ], + "blocks": [ + { + "bbox": [ + 265, + 193, + 354, + 262 + ], + "lines": [ + { + "bbox": [ + 265, + 193, + 354, + 262 + ], + "spans": [ + { + "bbox": [ + 265, + 193, + 354, + 262 + ], + "type": "image", + "image_path": "95e49cdd3ef9010ab1f8b8cadb78eff430ac38b01807682624b1fd7eeea92987.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 369, + 193, + 462, + 270 + ], + "blocks": [ + { + "bbox": [ + 369, + 193, + 462, + 270 + ], + "lines": [ + { + "bbox": [ + 369, + 193, + 462, + 270 + ], + "spans": [ + { + "bbox": [ + 369, + 193, + 462, + 270 + ], + "type": "image", + "image_path": "f76b37e8036aacb1a54f91eb3209d9d975f210d52043ecdf82c49139c3239da0.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 372, + 480, + 395 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 372, + 480, + 395 + ], + "spans": [ + { + "bbox": [ + 131, + 372, + 480, + 395 + ], + "type": "text", + "content": "tegration of meaningful, expert-derived signals is essential for achieving optimal results." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 416, + 220, + 428 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 416, + 220, + 428 + ], + "spans": [ + { + "bbox": [ + 132, + 416, + 220, + 428 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 442, + 482, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 442, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 131, + 442, + 482, + 552 + ], + "type": "text", + "content": "We introduce eCLIP, an adaptation of CLIP, demonstrating the integration of radiologist eye-tracking heatmap to overcome challenges faced in multi-modal contrastive learning. This study highlights the impact of integrating these high-quality expert annotations on improving the quality of learned embeddings and assess its influence on sample efficiency and cross-modal retrieval tasks. An important future research direction would be extending this approach to include expert annotations from the text modality (e.g., by adapting SimCSE [9]) and to leverage the temporal dynamics of eye-tracking data by aligning the sequential frames with the corresponding report snippets." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 570, + 482, + 666 + ], + "type": "text", + "content": "**Limitations** Our study is limited by the small size of expert annotated data and thus does not comprehensively analyze the impact of size or distribution of expert annotations across different abnormalities. eCLIP also incurs extra computational costs during training due to the additional forward pass required for processing expert images in the warmup and cool-down phases. Additionally, the clinical relevance of generated radiology reports has not been validated by medical experts, relying instead on standard metrics known for potential biases and inaccuracies in reflecting clinical accuracy [60]." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 143, + 482, + 227 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 143, + 482, + 227 + ], + "spans": [ + { + "bbox": [ + 130, + 143, + 482, + 227 + ], + "type": "text", + "content": "This work was supported by the Research Council of Finland (Flagship programme: Finnish Center for Artificial Intelligence FCAI, and grants 352986, 358246) and EU (H2020 grant 101016775 and NextGenerationEU). We acknowledge the computational resources provided by Aalto Science-IT project. We acknowledge CSC for awarding this project access to the LUMI supercomputer, owned by the EuroHPC Joint Undertaking, hosted by CSC (Finland) and the LUMI consortium through Finland." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 247, + 197, + 260 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 247, + 197, + 260 + ], + "spans": [ + { + "bbox": [ + 133, + 247, + 197, + 260 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 275, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 138, + 275, + 480, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 275, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 138, + 275, + 480, + 308 + ], + "type": "text", + "content": "1. Alsentzer, E., Murphy, J.R., Boag, W., Weng, W.H., Jin, D., Naumann, T., McDermott, M.: Publicly available clinical BERT embeddings. arXiv preprint arXiv:1904.03323 (2019) 9" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 310, + 480, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 310, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 138, + 310, + 480, + 342 + ], + "type": "text", + "content": "2. Bengio, Y., Louradour, J., Collobert, R., Weston, J.: Curriculum learning. In: Proceedings of the 26th Annual International Conference on Machine Learning. pp. 41-48 (2009) 7" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 343, + 480, + 387 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 343, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 138, + 343, + 480, + 387 + ], + "type": "text", + "content": "3. Bigolin Lanfredi, R., Zhang, M., Auffermann, W.F., Chan, J., Duong, P.A.T., Srikumar, V., Drew, T., Schroeder, J.D., Tasdizen, T.: REFLACX, A dataset of reports and eye-tracking data for localization of abnormalities in chest x-rays. Scientific Data 9(1), 350 (2022) 5" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 388, + 480, + 420 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 388, + 480, + 420 + ], + "spans": [ + { + "bbox": [ + 138, + 388, + 480, + 420 + ], + "type": "text", + "content": "4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning. pp. 1597-1607. PMLR (2020) 1, 4" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 421, + 480, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 421, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 138, + 421, + 480, + 464 + ], + "type": "text", + "content": "5. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023) 1" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 465, + 480, + 509 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 465, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 138, + 465, + 480, + 509 + ], + "type": "text", + "content": "6. Demner-Fushman, D., Kohli, M.D., Rosenman, M.B., Shooshan, S.E., Rodriguez, L., Antani, S., Thoma, G.R., McDonald, C.J.: Preparing a collection of radiology examinations for distribution and retrieval. Journal of the American Medical Informatics Association 23(2), 304-310 (2016) 2, 8" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "text", + "content": "7. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) 8" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 543, + 480, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 543, + 480, + 576 + ], + "spans": [ + { + "bbox": [ + 138, + 543, + 480, + 576 + ], + "type": "text", + "content": "8. Douze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.E., Lomeli, M., Hosseini, L., Jégou, H.: The faiss library. arXiv preprint arXiv:2401.08281 (2024) 11" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 577, + 480, + 598 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 480, + 598 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 480, + 598 + ], + "type": "text", + "content": "9. Gao, T., Yao, X., Chen, D.: SimCSE: Simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821 (2021) 14" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 599, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 599, + 480, + 632 + ], + "type": "text", + "content": "10. Geng, X., Liu, H., Lee, L., Schuurmans, D., Levine, S., Abbeel, P.: M3AE: Multimodal masked autoencoders learn transferable representations. Tech. rep., Technical Report 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "text", + "content": "11. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: CyCLIP: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022) 2, 4" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "12. Gu, S., Clark, C., Kembhavi, A.: I can't believe there's no images! learning visual tasks using only language supervision. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2672-2683 (2023) 4" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "text", + "content": "13. Han, Z., Liang, Z., Yang, F., Liu, L., Li, L., Bian, Y., Zhao, P., Wu, B., Zhang, C., Yao, J.: Umix: Improving importance weighting for subpopulation shift via uncertainty-aware mixup. Advances in Neural Information Processing Systems 35, 37704-37718 (2022) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 481, + 226 + ], + "type": "text", + "content": "14. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 481, + 270 + ], + "type": "text", + "content": "15. Huang, S.C., Shen, L., Lungren, M.P., Yeung, S.: Gloria: A multimodal global-local representation learning framework for label-efficient medical image recognition. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3942-3951 (2021) 2, 4, 8, 9" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 271, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 481, + 303 + ], + "type": "text", + "content": "16. Huang, Z., Bianchi, F., Yuksekgonul, M., Montine, T.J., Zou, J.: A visual-language foundation model for pathology image analysis using medical twitter. Nature Medicine 29(9), 2307-2316 (2023) 5" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 304, + 481, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 481, + 346 + ], + "type": "text", + "content": "17. Irvin, J., Rajpurkar, P., Ko, M., Yu, Y., Ciurea-Ilicus, S., Chute, C., Marklund, H., Haghgoo, B., Ball, R., Shpanskaya, K., et al.: CheXpert: A large chest radiograph dataset with uncertainty labels and expert comparison. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 33, pp. 590-597 (2019) 8" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 390 + ], + "type": "text", + "content": "18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International Conference on Machine Learning. pp. 4904-4916. PMLR (2021) 1" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 392, + 481, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 423 + ], + "type": "text", + "content": "19. Jiang, A.Q., Sablayrolles, A., Mensch, A., Bamford, C., Chaplot, D.S., Casas, D.d.l., Bressand, F., Lengyel, G., Lample, G., Saulnier, L., et al.: Mistral 7B. arXiv preprint arXiv:2310.06825 (2023) 11" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 424, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 481, + 445 + ], + "type": "text", + "content": "20. Johnson, A., Lungren, M., Peng, Y., Lu, Z., Mark, R., Berkowitz, S., Horng, S.: MIMIC-CXR-JPG-Chest radiographs with structured labels. PhysioNet (2019) 8" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 447, + 481, + 489 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 481, + 489 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 481, + 489 + ], + "type": "text", + "content": "21. Johnson, A.E., Pollard, T.J., Berkowitz, S.J., Greenbaum, N.R., Lungren, M.P., Deng, C.y., Mark, R.G., Horng, S.: MIMIC-CXR, a de-identified publicly available database of chest radiographs with free-text reports. Scientific data 6(1), 317 (2019) 5, 8" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 491, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 481, + 533 + ], + "type": "text", + "content": "22. Karargyris, A., Kashyap, S., Lourentzou, I., Wu, J.T., Sharma, A., Tong, M., Abedin, S., Beymer, D., Mukherjee, V., Krupinski, E.A., et al.: Creation and validation of a chest X-ray dataset with eye-tracking and report dictation for AI development. Scientific Data 8(1), 92 (2021) 3, 5" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 534, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 555 + ], + "type": "text", + "content": "23. Krishnan, R., Rajpurkar, P., Topol, E.J.: Self-supervised learning in medicine and healthcare. Nature Biomedical Engineering 6(12), 1346-1352 (2022) 2" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 556, + 481, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 556, + 481, + 587 + ], + "spans": [ + { + "bbox": [ + 132, + 556, + 481, + 587 + ], + "type": "text", + "content": "24. Li, Y., Fan, H., Hu, R., Feichtenhofer, C., He, K.: Scaling language-image pretraining via masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23390-23400 (2023) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 588, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 481, + 621 + ], + "type": "text", + "content": "25. Liang, V.W., Zhang, Y., Kwon, Y., Yeung, S., Zou, J.Y.: Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning. Advances in Neural Information Processing Systems 35, 17612-17625 (2022) 2, 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 622, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 622, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 622, + 481, + 643 + ], + "type": "text", + "content": "26. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. arXiv preprint arXiv:2304.08485 (2023) 1" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "text", + "content": "27. McInnes, L., Healy, J., Melville, J.: UMAP: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 3" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "28. Mo, S., Kim, M., Lee, K., Shin, J.: S-clip: Semi-supervised vision-language learning using few specialist captions. Advances in Neural Information Processing Systems 36 (2024) 4" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 481, + 184 + ], + "type": "text", + "content": "29. Moor, M., Huang, Q., Wu, S., Yasunaga, M., Dalmia, Y., Leskovec, J., Zakka, C., Reis, E.P., Rajpurkar, P.: Med-flamingo: a multimodal medical few-shot learner. In: Machine Learning for Health (ML4H). pp. 353-367. PMLR (2023) 5" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 185, + 481, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 185, + 481, + 217 + ], + "spans": [ + { + "bbox": [ + 130, + 185, + 481, + 217 + ], + "type": "text", + "content": "30. Mu, N., Kirillov, A., Wagner, D., Xie, S.: Slip: Self-supervision meets language-image pre-training. In: European Conference on Computer Vision. pp. 529-544. Springer (2022) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 218, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 218, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 130, + 218, + 481, + 251 + ], + "type": "text", + "content": "31. Naeem, M.F., Xian, Y., Zhai, X., Hoyer, L., Van Gool, L., Tombari, F.: SILC: Improving vision language pretraining with self-distillation. arXiv preprint arXiv:2310.13355 (2023) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 251, + 481, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 481, + 274 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 481, + 274 + ], + "type": "text", + "content": "32. Nukrai, D., Mokady, R., Globerson, A.: Text-only training for image captioning using noise-injected clip. arXiv preprint arXiv:2211.00575 (2022) 4" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 275, + 481, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 275, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 275, + 481, + 308 + ], + "type": "text", + "content": "33. Oh, C., So, J., Byun, H., Lim, Y., Shin, M., Jeon, J.J., Song, K.: Geodesic multi-modal mixup for robust fine-tuning. Advances in Neural Information Processing Systems 36 (2023) 2, 3, 4, 5, 6, 8" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 308, + 481, + 331 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 481, + 331 + ], + "type": "text", + "content": "34. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018) 1, 5" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 331, + 481, + 364 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 481, + 364 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 481, + 364 + ], + "type": "text", + "content": "35. Palepu, A., Beam, A.: Tier: Text-image entropy regularization for medical clip-style models. In: Machine Learning for Healthcare Conference. pp. 548-564. PMLR (2023) 4" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 365, + 481, + 408 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 365, + 481, + 408 + ], + "spans": [ + { + "bbox": [ + 130, + 365, + 481, + 408 + ], + "type": "text", + "content": "36. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763. PMLR (2021) 1, 2, 9" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 409, + 481, + 442 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 409, + 481, + 442 + ], + "spans": [ + { + "bbox": [ + 130, + 409, + 481, + 442 + ], + "type": "text", + "content": "37. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021) 1" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 443, + 481, + 487 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 443, + 481, + 487 + ], + "spans": [ + { + "bbox": [ + 130, + 443, + 481, + 487 + ], + "type": "text", + "content": "38. Reimers, N., Gurevych, I.: Sentence-BERT: Sentence embeddings using siamese BERT-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 3982-3992 (2019) 12" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 487, + 481, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 481, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 481, + 542 + ], + "type": "text", + "content": "39. Shih, G., Wu, C.C., Halabi, S.S., Kohli, M.D., Prevedello, L.M., Cook, T.S., Sharma, A., Amorosa, J.K., Arteaga, V., Galperin-Aizenberg, M., et al.: Aug-mentation the national institutes of health chest radiograph dataset with expert annotations of possible pneumonia. Radiology: Artificial Intelligence 1(1), e180041 (2019) 8" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 544, + 481, + 586 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 481, + 586 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 481, + 586 + ], + "type": "text", + "content": "40. Singh, A., Hu, R., Goswami, V., Couairon, G., Galuba, W., Rohrbach, M., Kiela, D.: Flava: A foundational language and vision alignment model. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15638-15650 (2022) 1" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 587, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 587, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 587, + 481, + 632 + ], + "type": "text", + "content": "41. Smit, A., Jain, S., Rajpurkar, P., Pareek, A., Ng, A.Y., Lungren, M.: Combining automatic labelers and expert annotations for accurate radiology report labeling using BERT. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). pp. 1500-1519 (2020) 12" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 481, + 665 + ], + "type": "text", + "content": "42. Song, K., Tan, X., Qin, T., Lu, J., Liu, T.Y.: MPNet: Masked and permuted pretraining for language understanding. Advances in Neural Information Processing Systems 33, 16857-16867 (2020) 12" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "43. van Sonsbeek, T., Zhen, X., Mahapatra, D., Worring, M.: Probabilistic integration of object level annotations in chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 3630-3640 (2023) 5" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 161, + 481, + 195 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 481, + 195 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 481, + 195 + ], + "type": "text", + "content": "44. Sowrirajan, H., Yang, J., Ng, A.Y., Rajpurkar, P.: MoCo-CXR: MoCo pretraining improves representation and transferability of chest X-ray models, 2021. URL https://arxiv.org/abs (2010) 5" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "type": "text", + "content": "45. Sun, Z., Fang, Y., Wu, T., Zhang, P., Zang, Y., Kong, S., Xiong, Y., Lin, D., Wang, J.: Alpha-CLIP: A clip model focusing on wherever you want. arXiv preprint arXiv:2312.03818 (2023) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 228, + 481, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 481, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 481, + 262 + ], + "type": "text", + "content": "46. Tschannen, M., Mustafa, B., Houlsby, N.: CLIPPO: Image-and-language understanding from pixels only. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11006-11017 (2023) 2, 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 262, + 481, + 296 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 262, + 481, + 296 + ], + "spans": [ + { + "bbox": [ + 132, + 262, + 481, + 296 + ], + "type": "text", + "content": "47. Tu, T., Azizi, S., Driess, D., Schaekermann, M., Amin, M., Chang, P.C., Carroll, A., Lau, C., Tanno, R., Ktena, I., et al.: Towards generalist biomedical ai. NEJM AI 1(3), AIoa2300138 (2024) 5" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 297, + 481, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 297, + 481, + 329 + ], + "spans": [ + { + "bbox": [ + 132, + 297, + 481, + 329 + ], + "type": "text", + "content": "48. Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Lopez-Paz, D., Bengio, Y.: Manifold mixup: Better representations by interpolating hidden states. In: International Conference on Machine Learning. pp. 6438-6447. PMLR (2019) 3" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 330, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 330, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 330, + 481, + 363 + ], + "type": "text", + "content": "49. Verma, V., Luong, T., Kawaguchi, K., Pham, H., Le, Q.: Towards domain-agnostic contrastive learning. In: International Conference on Machine Learning. pp. 10530-10541. PMLR (2021) 3, 4, 8" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 363, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 363, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 363, + 481, + 407 + ], + "type": "text", + "content": "50. Wang, B., Pan, H., Aboah, A., Zhang, Z., Keles, E., Torigian, D., Turkbey, B., Krupinski, E., Udupa, J., Bagci, U.: GazeGNN: A gaze-guided graph neural network for chest x-ray classification. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 2194-2203 (2024) 5" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 481, + 441 + ], + "type": "text", + "content": "51. Wang, F., Liu, H.: Understanding the behaviour of contrastive loss. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2021) 5" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 441, + 481, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 441, + 481, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 441, + 481, + 475 + ], + "type": "text", + "content": "52. Wang, T., Isola, P.: Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In: International Conference on Machine Learning. pp. 9929-9939. PMLR (2020) 5" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 475, + 481, + 529 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 481, + 529 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 481, + 529 + ], + "type": "text", + "content": "53. Wang, X., Peng, Y., Lu, L., Lu, Z., Bagheri, M., Summers, R.M.: ChestX-Ray8: Hospital-scale chest x-ray database and benchmarks on weakly-supervised classification and localization of common thorax diseases. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 2097-2106 (2017) 8, 9" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 530, + 481, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 530, + 481, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 530, + 481, + 563 + ], + "type": "text", + "content": "54. Wang, Z., Wu, Z., Agarwal, D., Sun, J.: MedCLIP: Contrastive learning from unpaired medical images and text. arXiv preprint arXiv:2210.10163 (2022) 2, 4, 8, 9" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 563, + 481, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 563, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 563, + 481, + 609 + ], + "type": "text", + "content": "55. Weers, F., Shankar, V., Katharopoulos, A., Yang, Y., Gunter, T.: Masked autoencoding does not help natural language supervision at scale. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23432-23444 (2023) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 609, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 609, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 609, + 481, + 632 + ], + "type": "text", + "content": "56. Wu, C., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Medklip: Medical knowledge enhanced language-image pre-training. medRxiv pp. 2023-01 (2023) 5" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "57. Xu, H., Xie, S., Tan, X.E., Huang, P.Y., Howes, R., Sharma, V., Li, S.W., Ghosh, G., Zettlemoyer, L., Feichtenhofer, C.: Demystifying CLIP data. arXiv preprint arXiv:2309.16671 (2023) 1" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 101 + ], + "type": "text", + "content": "Y. Kumar and P. Marttinen" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 456 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 160 + ], + "type": "text", + "content": "58. Xu, S., Yang, L., Kelly, C., Sieniek, M., Kohlberger, T., Ma, M., Weng, W.H., Kiraly, A., Kazemzadeh, S., Melamed, Z., et al.: Elixir: Towards a general purpose x-ray artificial intelligence system through alignment of large language models and radiology vision encoders. arXiv preprint arXiv:2308.01317 (2023) 5" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 161, + 482, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 161, + 482, + 205 + ], + "spans": [ + { + "bbox": [ + 130, + 161, + 482, + 205 + ], + "type": "text", + "content": "59. You, K., Gu, J., Ham, J., Park, B., Kim, J., Hong, E.K., Baek, W., Roh, B.: CXR-CLIP: Toward large scale chest X-ray language-image pre-training. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 101-111. Springer (2023) 4, 8, 9, 11" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 205, + 482, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 482, + 237 + ], + "type": "text", + "content": "60. Yu, F., Endo, M., Krishnan, R., Pan, I., Tsai, A., Reis, E.P., Fonseca, E.K.U.N., Lee, H.M.H., Abad, Z.S.H., Ng, A.Y., et al.: Evaluating progress in automatic chest x-ray radiology report generation. Patterns 4(9) (2023) 14" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 237, + 482, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 237, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 482, + 270 + ], + "type": "text", + "content": "61. Zbontar, J., Jing, L., Misra, I., LeCun, Y., Deny, S.: Barlow twins: Self-supervised learning via redundancy reduction. In: International Conference on Machine Learning. pp. 12310-12320. PMLR (2021) 1" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "type": "text", + "content": "62. Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412 (2017) 3, 6" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 293, + 482, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 325 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 325 + ], + "type": "text", + "content": "63. Zhang, K., Yang, Y., Yu, J., Jiang, H., Fan, J., Huang, Q., Han, W.: Multi-task paired masking with alignment modeling for medical vision-language pre-training. IEEE Transactions on Multimedia (2023) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 325, + 482, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 357 + ], + "type": "text", + "content": "64. Zhang, T., Kishore, V., Wu, F., Weinberger, K.Q., Artzi, Y.: BERTScore: Evaluating text generation with BERT. In: International Conference on Learning Representations (2019) 12" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 358, + 482, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 390 + ], + "type": "text", + "content": "65. Zhang, Y., Jiang, H., Miura, Y., Manning, C.D., Langlotz, C.P.: Contrastive learning of medical visual representations from paired images and text. In: Machine Learning for Healthcare Conference. pp. 2-25. PMLR (2022) 2, 4" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 390, + 482, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 482, + 423 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 482, + 423 + ], + "type": "text", + "content": "66. Zhang, Y., HaoChen, J.Z., Huang, S.C., Wang, K.C., Zou, J., Yeung, S.: Diagnosing and rectifying vision models using language. arXiv preprint arXiv:2302.04269 (2023) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 423, + 482, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 456 + ], + "type": "text", + "content": "67. Zhang, Y., Sui, E., Yeung, S.: Connect, Collapse, Corrupt: Learning cross-modal tasks with uni-modal data. In: The Twelfth International Conference on Learning Representations (2024) 2, 4" + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 419, + 91, + 447, + 100 + ], + "type": "text", + "content": "eCLIP" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_content_list.json b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..ea8bcacbef34b39e4f25833c365b4d259fd81f9c --- /dev/null +++ b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_content_list.json @@ -0,0 +1,1753 @@ +[ + { + "type": "text", + "text": "Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images", + "text_level": 1, + "bbox": [ + 233, + 140, + 772, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Xinlin Ren $^{1*}$ , Chenjie Cao $^{1,2*}$ , Yanwei Fu $^{1\\dagger}$ , and Xiangyang Xue $^{1}$", + "bbox": [ + 240, + 218, + 761, + 236 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Fudan University \n $^{2}$ Alibaba Group, DAMO Academy \n{xlren20,cjcao20,yanweifu,xyxue}@fudan.edu.cn", + "bbox": [ + 326, + 244, + 676, + 291 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Recent advancements in Neural Surface Reconstruction (NSR) have significantly improved multi-view reconstruction when coupled with volume rendering. However, relying solely on photometric consistency in image space falls short of addressing complexities posed by real-world data, including occlusions and non-Lambertian surfaces. To tackle these challenges, we propose an investigation into feature-level consistent loss, aiming to harness valuable feature priors from diverse pretext visual tasks and overcome current limitations. It is crucial to note the existing gap in determining the most effective pretext visual task for enhancing NSR. In this study, we comprehensively explore multi-view feature priors from seven pretext visual tasks, comprising thirteen methods. Our main goal is to strengthen NSR training by considering a wide range of possibilities. Additionally, we examine the impact of varying feature resolutions and evaluate both pixel-wise and patch-wise consistent losses, providing insights into effective strategies for improving NSR performance. By incorporating pre-trained representations from MVSFormer [2] and QuadTree [38], our approach can generate variations of MVS-NeuS and Match-NeuS, respectively. Our results, analyzed on DTU and EPFL datasets, reveal that feature priors from image matching and multi-view stereo outperform other pretext tasks. Moreover, we discover that extending patch-wise photometric consistency to the feature level surpasses the performance of pixel-wise approaches. These findings underscore the effectiveness of these techniques in enhancing NSR outcomes. Codes and models are available at https://github.com/maybeLx/MVS_NeuS.", + "bbox": [ + 261, + 324, + 746, + 657 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Feature Priors $\\cdot$ Neural Surface Reconstruction", + "bbox": [ + 261, + 670, + 663, + 684 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 710, + 377, + 726 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Reconstructing surface from multi-view images is a crucial task in 3D computer vision. Traditionally, this task is addressed using a pipeline that includes depth prediction, point cloud reconstruction, and maximizing point consistency for surface mesh [1,17,21,35]. Unfortunately, these traditional methods often result in", + "bbox": [ + 212, + 741, + 787, + 803 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "*: Equal Contributions.", + "bbox": [ + 232, + 811, + 393, + 824 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "†: Corresponding Author", + "bbox": [ + 232, + 824, + 401, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/6e8dd36dab400e4252f8a6f0f796c2772b9ffdd9beb4a21895434b1266c097ea.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 228, + 155, + 566, + 277 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/d8a00c901c89d62981699dc5fccc63a226219e00c95e8f9b26ad0f94579b0c3d.jpg", + "image_caption": [ + "(b)", + "Fig. 1: (a) Pixel-wise similarity for RGB images: MVS features [2] and matching features [38] on non-Lambertian surfaces. (b) Multi-view consistency of feature priors: Given a ray direction, the geometry network can extract surface points, which are used to project and align source features to the reference view for optimizing patch-wise photometric consistency loss." + ], + "image_footnote": [], + "bbox": [ + 571, + 146, + 767, + 279 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "visual errors due to the complexity of these procedures. In contrast, recent approaches opt to represent the surface through volume rendering, inspired by the Neural Radiance Fields (NeRF) [28], thereby avoiding the accumulation of errors seen in the traditional pipeline. Notably, Neural Surface Reconstruction (NSR) has made significant strides in multi-view reconstruction, leveraging techniques such as Signed Distance Functions (SDF) [42, 51] and occupancy [31] combined with volume rendering. However, despite these advancements, these sophisticated methods still grapple with fundamental challenges in surface reconstruction, including maintaining geometric consistency across different views. This challenge becomes particularly pronounced when dealing with non-Lambertian surfaces and occlusions [6, 9], as illustrated in Fig. 1a.", + "bbox": [ + 212, + 383, + 787, + 549 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To tackle these challenges, earlier studies [6, 9] have delved into optimizing patch-wise warping losses in image space, employing metrics such as Structural Similarity (SSIM) [45] or Normalized Cross-Correlation (NCC) [10]. In an effort to enhance the robustness of geometric consistency in real-world scenarios, Chen et al. [3] utilized features extracted from a learning-based Multi-View Stereo (MVS) model [55] to compute pixel-wise feature similarity. Despite promising results with MVS features, it remains unclear whether the neural surface reconstruction can benefit from other pretext tasks and what key factors contribute to improved reconstruction. Furthermore, it is worth investigating whether these features can also benefit from patch-wise photometric consistency.", + "bbox": [ + 212, + 551, + 789, + 702 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This study aims to address these questions by conducting a comprehensive investigation into the impact of diverse pre-trained feature priors obtained from various pretext visual tasks for NSR learning. We thoroughly consider seven distinctly different pretext visual tasks, encompassing 2D supervised [4, 26, 47], 2D self-supervised [11, 15, 46], and 3D supervised [2, 13, 19, 24, 33, 38, 48] approaches. The pre-trained models from these tasks can serve as feature extractors for our NSR task. Crucially, we not only compare various architectures used in these models, ranging from Convolution Neural Networks (CNNs) [13, 24, 26, 48] to Vision Transformers (ViTs) [2, 15, 46, 47], but also explore feature maps from dif", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "ferent layers within the same model to identify common factors relevant to NSR. Furthermore, we propose for extending patch-wise photometric consistency to the feature level, resulting in substantial improvements.", + "bbox": [ + 212, + 146, + 784, + 191 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Formally, our approach enhances NSR by integrating various feature priors derived from multi-view images. Building upon the robust foundation of NeuS [42], which acts as the baseline method in this paper, we further improve NSR by introducing feature-level consistent loss from diverse pre-trained models, as depicted in Fig. 1b. Specifically, we compare 13 pre-trained models across 7 distinct pretext tasks, as listed in Tab. 1. To the best of our knowledge, this evaluation represents the most comprehensive assessment of pretext tasks on NSR to date, encompassing masked image modeling [11, 15, 46], image classification [4, 26], semantic segmentation [47], monocular depth estimation [19, 33], stereo matching [24, 48], image matching [38], and MVS [2, 13]. The DTU and EPFL datasets serve as the benchmark for evaluation [16].", + "bbox": [ + 212, + 196, + 787, + 364 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Notably and interestingly, our empirical findings reveal that models pretrained on MVS and image matching tasks consistently outperform others significantly. This success is attributed to the feature similarity supervision provided by depth annotation [16] for MVS and Structure from Motion (SfM) [23] for image matching. Moreover, these tasks yield high-resolution features, emerging as another crucial factor contributing to the superior performance of NSR models.", + "bbox": [ + 212, + 369, + 787, + 460 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Furthermore, we observe that 3D-CNN regularization, designed to denoise the 3D cost volume [2, 13, 48], impedes effective 2D feature learning. Consequently, utilizing features from pre-trained models of image matching tasks without 3D cost volume regularization achieves the best performance and generalization in NSR. Moreover, in our experiments on the EPFL dataset [36], we make an intriguing observation that patch-wise photometric consistency can be effectively generalized to the feature level, resulting in remarkable improvements. Thus, bolstered by patch-wise photometric consistency losses from pre-trained models in both MVSFormer [2] and QuadTree [38] our approach can produce variations of MVS-NeuS and Match-NeuS. These variations demonstrate state-of-the-art performance on the DTU and EPFL datasets, respectively. Additionally, we take a further exploration of the feature priors on grid-based methods such as Neuralangelo [22], where feature priors still enjoy promising benefits. Thus our method could be extended to different neural representations (MLP or grid-based methods). Our contributions can be highlighted as follows:", + "bbox": [ + 212, + 465, + 787, + 691 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1) We are the first to conduct a comprehensive evaluation of prior features derived from various pretext tasks on NSR. Additionally, we delve into a detailed comparison of pixel-wise feature consistent loss across these approaches. This comprehensive analysis advances our understanding of the effect of different feature priors for NSR.", + "2) Our research brings to light a significant finding: models pre-trained on image matching and MVS tasks consistently outperform others in the realm of NSR. This superior performance is attributed to the advantages gained from feature-similarity related pretext training and the utilization of high-resolution" + ], + "bbox": [ + 212, + 698, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 313, + 114, + 727, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 2 + }, + { + "type": "table", + "img_path": "images/6555cdc78b6d9a153a685807ca9014b7e3c7b729999411e6532f14aa23cb844b.jpg", + "table_caption": [ + "Table 1: A summary of models from various pretext tasks including MIM (masked image modeling), IC (image classification), MDE (monocular depth estimation), SM (stereo matching), SS (semantic segmentation), IM (image matching), and MVS. Only the feature dimensions and resolutions of the highest and lowest features are shown. (Res: Resolution, Dim: Dimension)" + ], + "table_footnote": [], + "table_body": "
TaskModelArchitectFeature ResFeature Dim
MIMMAE [15]ViT1/161024
CovMAE [11]ViT+CNN1/16,1/4768,256
CroCo [46]ViT1/16768
ICTwins [4]ViT1/32, 1/41024,128
ConvNeXt [26]CNN1/32, 1/42048,256
SSSegFormer [47]ViT1/32, 1/4512,64
MDEGLPN [19]ViT1/32, 1/4512,64
MiDaS [33]ViT1/322048
SMIGEV [48]CNN1/32, 1/4160,96
RAFT-Stereo [24]CNN1/4256
IMQuadTree [38]ViT+CNN1/8,1/2256,128
MVSCascadeMVS [13]CNN1/8,132,8
MVSFormer [2]ViT+CNN1/8,132,8
", + "bbox": [ + 316, + 217, + 679, + 436 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "features. By identifying these key factors, our work contributes valuable insights that can inform future developments in NSR methods.", + "bbox": [ + 212, + 454, + 785, + 483 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3) Another notable contribution of our research lies in the successful extension of the patch-wise photometric consistency loss to the feature level. This innovative approach stands as a significant advancement, leading to improved results regardless of different neural representations (MLP or grid-based methods). By bridging the gap between patch-wise and feature-level considerations, our work reaches the state-of-the-art in NSR.", + "bbox": [ + 212, + 484, + 787, + 575 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 597, + 388, + 614 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Neural Surfaces Reconstruction (NSR). Surface reconstruction based on deep learning has garnered significant attention due to its expressive representation capabilities. Representative algorithms focus on utilizing implicit representations to encode the geometry and appearance of 3D scenes through neural networks. These representations include occupancy fields [27, 31] and SDF [25, 49, 52, 56, 57]. Since the emergence of volume rendering techniques pioneered by NeRF [28], numerous NSR methods have seen a dramatic rise [3, 6, 9, 14, 32, 42-44, 51, 54]. Notably, VolSDF [51] and NeuS [42] convert volume density to SDF without the need for masks, while UNISURF [32] unifies both surface and volume rendering. Concurrently, grid-based representation methods are gaining attention [22, 29, 37, 41], as they offer faster convergence compared to implicit ones with competitive results. Essentially, note that these explicit NSR methods serve as robust foundations, and our contributions are orthogonal to these approaches. However, it is crucial to highlight that all these existing methods", + "bbox": [ + 212, + 628, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/e209a18ddf1681b98aee9ad9758663d6f5ec0f01b1b9afae5ff4637afccedf55.jpg", + "image_caption": [ + "Fig. 2: Approach overview. Our method is based on NeuS [42]. After achieving surface points from geometry network $f_{\\theta_g}$ , we further apply the multi-view consistent loss based on features from pre-trained models to improve the reconstruction quality." + ], + "image_footnote": [], + "bbox": [ + 303, + 143, + 694, + 321 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "overlook the importance of multi-view consistency during surface reconstruction. This gap forms the basis for our unique contributions in addressing this aspect.", + "bbox": [ + 212, + 388, + 785, + 419 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Photometric Consistency. Many previous studies have delved into the application of photometric consistency across various 3D reconstruction tasks [5, 18, 30, 34, 39, 40, 50, 53]. For SfM, several researches aim to optimize camera poses by minimizing photometric errors between corresponding pixels in different images [34, 39, 40]. Similarly, various self-supervised MVS methods [5, 18, 50] leverage consistent loss to supervise depth prediction. Moreover, in Simultaneous Localization and Mapping (SLAM), photometric consistency plays a crucial role. By comparing the appearance of projected 3D points in the image with the actual observed images, photometric consistency can detect potential errors or inaccuracies in geometry [30, 53].", + "bbox": [ + 212, + 419, + 785, + 570 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Photometric Consistency in NSR. Prior works [6,9,14] have incorporated patch-wise photometric consistency directly computed from raw images or pixelwise feature similarity to enhance NSR training. NeuralWarp [14] introduces a patch-wise warping loss along with a visibility map that masks incorrect warps arising from occlusion. Similarly, GeoNeus [9] and D-NeuS [6] focus on locating the zero-level set of geometry network to enforce multi-view geometry constraints, resulting in more accurate reconstruction outcomes. Despite these advancements, none of these methods thoroughly explore the distinctions between patch-wise and pixel-wise consistent loss, nor do they investigate the potential benefits of incorporating prior features from other pretext visual tasks as opposed to using raw images.", + "bbox": [ + 212, + 570, + 785, + 736 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 NSR based on Feature Priors", + "text_level": 1, + "bbox": [ + 214, + 761, + 537, + 777 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Overview. Given a set of posed multi-view images, the goal of NSR is to reconstruct high-quality surfaces by neural volume rendering, as illustrated in Fig. 2. We revisit the NeuS baseline [42] for multi-view consistency zero-crossing points.", + "bbox": [ + 212, + 794, + 785, + 842 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 313, + 114, + 727, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We briefly introduce pretext tasks in Sec. 3.1 and discuss consistent loss in both pixel-wise and patch-wise terms in Sec. 3.2. By utilizing pre-trained representations from MVS and image matching pretext tasks, we have MVS-NeuS and Match-NeuS, which are compared in the experiments.", + "bbox": [ + 212, + 146, + 787, + 205 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "NeuS [42] proposes a novel scheme to achieve unbiased reconstructed surfaces in the first-order approximation of SDF. In this scheme, a ray $\\{p(t) = o + tv|t > 0\\}$ is emitted from a camera center at $o$ with view direction $v$ . Colors $\\hat{C}(r)$ along a ray can be accumulated by volume rendering [8], which is approximated by $N$ discretely sampled points as follows:", + "bbox": [ + 212, + 207, + 787, + 282 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {C} (r) = \\sum_ {i = 1} ^ {N} T _ {i} \\alpha_ {i} c _ {i}, \\quad T _ {i} = \\prod_ {j = 1} ^ {i - 1} \\left(1 - \\alpha_ {j}\\right), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 364, + 296, + 785, + 339 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\alpha_{i}$ and $T_{i}$ are the opacity and accumulated transmittance along the ray respectively. To achieve the unbiased surface, we can compute $\\alpha_{i}$ by:", + "bbox": [ + 212, + 351, + 787, + 383 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\alpha_ {i} = \\max \\left(\\frac {\\Phi_ {s} (s d f (p _ {i})) - \\Phi_ {s} (s d f (p _ {i + 1}))}{\\Phi_ {s} (s d f (p _ {i}))}, 0\\right), \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 346, + 396, + 785, + 430 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $sdf(\\cdot)$ is the SDF function modeled by the geometry network $f_{\\theta_g}$ . $\\varPhi_s(\\cdot)$ is the sigmoid function and $s$ is a learnable parameter.", + "bbox": [ + 212, + 436, + 787, + 468 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Differentiable Zero-Crossing Points. Since achieving photometric consistency involves warping patches or pixels based on a specific depth, we define the depth planes through zero-crossing points achieved from the zero-level set of SDF function as [3, 6]. So it is crucial to apply photometric consistency specifically to the zero-crossing points of geometry network $f_{\\theta_g}$ , as shown in Fig. 3. We only require the first set of zero-crossing points $T^*$ which is visible from the corresponding view. It can be expressed as:", + "bbox": [ + 212, + 469, + 787, + 575 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nT ^ {*} = \\left\\{t \\mid t = \\frac {s d f \\left(p _ {t _ {i}}\\right) t _ {i + 1} - s d f \\left(p _ {t _ {i + 1}}\\right) t _ {i}}{s d f \\left(p _ {t _ {i}}\\right) - s d f \\left(p _ {t _ {i + 1}}\\right)}, t _ {i} \\in T \\right\\}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 321, + 587, + 785, + 622 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nT = \\underset {i} {\\arg \\min } \\left\\{t _ {i} | s d f \\left(p _ {t _ {i}}\\right) \\cdot s d f \\left(p _ {t _ {t + 1}}\\right)) < 0 \\right\\}. \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 343, + 643, + 785, + 667 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/91980f2eb3abe61184f57a25cf7d327831127e1e730b0c95e43a5797f38bf15c.jpg", + "image_caption": [ + "Reference Image", + "Depth of Zero-Crossing Points" + ], + "image_footnote": [], + "bbox": [ + 289, + 693, + 424, + 772 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/9611627002db96db70cc172d2bc878f4193e586e124ab41a6bbbfef49363c7b4.jpg", + "image_caption": [ + "Fig. 3: Two different ways to locate surface points during the network training at 5000 iterations. Compared with volume rendering, it is more accurate to find the surface points via Eq. 3. Accurate surface points are crucial for applying consistent loss." + ], + "image_footnote": [], + "bbox": [ + 424, + 693, + 562, + 772 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/bcc42edf56195d6e34e738980c4e37986af7a1c179124dd1ef6cdabc8d7ef5b6.jpg", + "image_caption": [ + "Depth from Volume Rendering" + ], + "image_footnote": [], + "bbox": [ + 563, + 693, + 700, + 772 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 Predtext Tasks", + "text_level": 1, + "bbox": [ + 215, + 146, + 377, + 159 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Various models in different pretext visual tasks have been explored as shown in Tab. 1. Our emphasis is specifically on the features obtained from the feature encoder modules of these pre-trained models. Importantly, many of these models include multi-scale feature maps. In this context, our focus is on the most representative features at both the highest and lowest scales, encompassing high-level semantic understanding and fine-grained low-level details, respectively.", + "bbox": [ + 212, + 172, + 787, + 263 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Masked Image Modeling (MIM) has been widely investigated recently, as an effective self-supervised task [15]. MIM randomly masks input images at a relatively high rate and subsequently predicts the masked regions based on the context of unmasked areas. MIM has gained significant attention recently, with several pioneering works demonstrating its effectiveness in various downstream tasks [11, 15, 46]. In contrast to other self-supervised tasks, MIM exhibits favorable fine-grained feature correlations that can potentially benefit NSR learning.", + "bbox": [ + 212, + 263, + 787, + 369 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Image Classification (IC) is a well-established supervised task known for extracting discriminative features. In this paper, we investigate models built on CNNs [26] and ViTs [4] that are pre-trained for image classification on ImageNet [7]. These models serve as baselines, helping us answer the question of whether engaging in such a classic pretext task also enhances the NSR.", + "bbox": [ + 212, + 369, + 787, + 445 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Semantic Segmentation (SS). Models like [20, 47] have demonstrated outstanding performance in semantic segmentation by training on large-scale datasets. Unlike classification tasks, these models can capture more detailed, class-specific features, which holds the potential to enhance NSR training.", + "bbox": [ + 212, + 446, + 795, + 506 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Monocular Depth Estimation (MDE) aims to predict the depth map of a scene using a single input view, essentially creating a 2D representation of a 3D scene. Several successful works [19, 33] have demonstrated the ability to recover fine details of the scene in this process.", + "bbox": [ + 212, + 507, + 787, + 566 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Stereo Matching (SM) is the process of identifying corresponding pixels between two rectified images along epipolar lines, ultimately determining the disparity between these corresponding points. Noteworthy approaches like IGEV [48] and RAFT-Stereo [24] have demonstrated promising results in this task. The learning involved in establishing correspondences bears some similarities to the learning of consistent loss in NSR.", + "bbox": [ + 212, + 566, + 787, + 656 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Multi-View Stereo (MVS) differs from stereo matching in that it involves multiple input views with known camera poses. However, the MVS problem often faces challenges such as occlusions and varying light conditions. Consequently, MVS methods like CasMVSNet [13] and MVSFormer [52] need to enhance feature learning to accurately identify corresponding pixels along epipolar lines. It's worth noting that MVS methods may encounter data bias, as discussed in Sec. 4.2, particularly on the DTU dataset [16].", + "bbox": [ + 212, + 657, + 787, + 763 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Image Matching (IM). In comparison to stereo matching and MVS, image matching tackles a more intractable problem, i.e., detecting fine-grained matching pairs between two images without assistance from known camera poses. To solve this challenge, Tand et al. [38] utilize a transformer with a lightweight QuadTree attention mechanism to capture long-range dependencies. Despite", + "bbox": [ + 212, + 765, + 787, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 313, + 114, + 727, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "working without constraints from camera poses, we observe that image matching methods can still achieve effective feature representation.", + "bbox": [ + 215, + 146, + 787, + 176 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.2 Feature-Level Photometric Consistency", + "text_level": 1, + "bbox": [ + 215, + 199, + 588, + 215 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To leverage the consistency of geometry across different views, we utilize the features $\\mathbf{F}_r$ and $\\mathbf{F}_s$ extracted from the reference and source images through various pre-trained models respectively. Photometric consistency can be applied to these multi-view features to enforce their alignment and coherence. Specifically, from the reference viewpoint, we locate a surface point $p$ derived from Eq. 3 with its 2D projection coordinate denoted as $x$ . This 2D point is then associated with the corresponding point $x'$ in the source images through the homography $H$ :", + "bbox": [ + 215, + 223, + 787, + 330 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nx ^ {\\prime} = H x, \\quad n ^ {T} p + d = 0, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 340, + 785, + 357 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nH = K _ {s} R _ {s} \\left(I - \\frac {\\left(R _ {s} ^ {- 1} t _ {s} - R _ {r} ^ {- 1} t _ {r}\\right) n ^ {T} R _ {r}}{d}\\right) R _ {r} ^ {- 1} K _ {r} ^ {- 1}, \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 328, + 378, + 785, + 410 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $K_{s}$ and $K_{r}$ denote the internal calibration matrix of source and reference cameras, $(R_{s}, R_{r})$ and $(t_{s}, t_{r})$ are the $3 \\times 3$ rotation matrix, and 3D translation vector of two views, respectively. $n$ denotes the surface normal, which can be computed by automatic differentiation of the geometry network at each point $p$ . Additionally, $I$ represents the identity matrix and $d$ is the distance from the camera center to the plane of the zero-crossing point (Eq. 3).", + "bbox": [ + 215, + 414, + 787, + 503 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Pixel Warping. To compute the pixel-level consistency loss, we can evaluate the feature difference between the pixel $x$ in the reference view and its corresponding pixel $x'$ in the source views:", + "bbox": [ + 215, + 505, + 787, + 550 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {p i x e l}} = D _ {\\text {p i x e l}} \\left(\\mathbf {F} _ {r} (x), \\mathbf {F} _ {s} \\left(x ^ {\\prime}\\right)\\right), \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 561, + 785, + 579 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $D_{pixel}$ is the cosine similarity function to measure the feature similarity in pixel-wise.", + "bbox": [ + 212, + 589, + 785, + 618 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Patch Warping. To more effectively incorporate local feature information, we can broaden the concept of pixel warping to patch warping. To define a small patch $s$ on the surface, traditionally we would compute the surface points using Eq. 3 and sample numerous points around those surface points to construct the patch. However, this is computationally expensive. As an alternative, we use the central point $\\hat{s}$ of the patch $s$ to represent it and derive the homography matrix $H$ . We can perform patch warping from the source view to the reference view and measure the difference between them. The patch-wise consistent loss is", + "bbox": [ + 215, + 619, + 787, + 739 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {p a t c h} = D _ {p a t c h} \\left(\\mathbf {F} _ {r} (\\hat {s}), \\mathbf {F} _ {s} \\left(\\hat {s} ^ {\\prime}\\right)\\right), \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 392, + 753, + 785, + 768 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\hat{s}$ , $\\hat{s}^{\\prime}$ denote the centers of reference view patches and projected source view patches respectively. $D_{patch}$ can be represented as NCC [10], SSIM [45], or patch similarity which measures the average of similarity between corresponding elements in the two patches. Since grid-based manners [22] can also locate the", + "bbox": [ + 215, + 779, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "surface points via Eq. 3, we easily extend our method to the grid-based methods in Sec. 4.3. More detailed formulas will be explained in the supplementary.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "About Occlusion. Although we can utilize photometric consistency to supervise the geometry network and encourage accurate surface learning, it's important to note that not all surface points are visible in source view images. Choosing unsuitable source images would cause prominent degradation to the reconstruction. To address this issue, we employ a simple yet effective strategy called Top-k view selection. Specifically, we sort and select 10 source views based on their relative angles from small to large to the reference perspective. Subsequently, we choose Top-k views to compute the patch-wise consistent loss according to the best k photometric scores. We empirically set k to 4 with proper generalization for most scenes. However, we have observed that this strategy does not provide significant benefits to pixel-wise consistency due to the incomplete local feature information which results in unstable view selection during training (Sec. 4.2).", + "bbox": [ + 212, + 178, + 787, + 358 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Training Loss. To render colors from a specific view, the overall loss function is defined as:", + "bbox": [ + 212, + 359, + 785, + 387 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {\\text {c o l o r}} + \\lambda_ {1} \\cdot \\mathcal {L} _ {\\text {e i k}} + \\lambda_ {2} \\cdot \\mathcal {L} _ {\\text {f e a t}}, \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 391, + 785, + 407 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\mathcal{L}_{color} = \\sum_{r\\in \\mathcal{R}}\\| \\hat{C} (\\mathbf{r}) - C(\\mathbf{r})\\| _1$ is the $\\ell_1$ loss from minibatch of rays $\\mathcal{R}$ . $\\mathcal{L}_{eik}$ is the eikonal loss defined in [12] to regularize the SDF values predicted by the geometry network $f_{\\theta_a}$ as depicted in Fig. 2.", + "bbox": [ + 212, + 415, + 782, + 460 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We use feature loss, denoted as $\\mathcal{L}_{\\text {feat }}$ , and it is implemented as $\\mathcal{L}_{\\text {patch }}$ . Additionally, in Sec. 4.1, we apply the feature loss as $\\mathcal{L}_{\\text {pixel }}$ to assess the features of pre-trained models derived from different pretext tasks. Our results demonstrate that $\\mathcal{L}_{\\text {patch }}$ exhibits greater robustness compared to $\\mathcal{L}_{\\text {pixel }}$ , emphasizing the effectiveness of our patch warping loss. During the training stage, we set $\\lambda_{1}$ and $\\lambda_{2}$ as 0.1 and 0.5, respectively.", + "bbox": [ + 212, + 462, + 787, + 551 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Discussion. While NeuralWarp [14] has introduced a patching-based warping method to transform source view patches to the reference view, it posits that every sampled point along the ray could be projected to other views to obtain the warped colors, leading to the final warped colors through volume rendering. In contrast, our approach prioritizes the surface points, offering a more accurate and reasonable method that does not depend on visible maps. Furthermore, we extend the patch warping from RGB pixel-level to feature-level, significantly improving the overall quality of reconstruction.", + "bbox": [ + 212, + 553, + 787, + 674 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 699, + 375, + 717 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets. The DTU dataset tested in NSR comprises 15 scenes with 49 or 64 multi-view images collected in an indoor environment with fixed camera poses following [52]. The Chamfer Distance (CD) is utilized to evaluate the performance of reconstructed results on the DTU. We also test two outdoor scenes in EPFL dataset [36], which has 7 and 11 images at a resolution of $2048 \\times 3072$ , and one of the scenes is particularly challenging due to the occlusions caused by limited viewpoints.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 313, + 114, + 727, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation Details. We use the same architecture as [42]. During the training, 512 rays are sampled for each batch following the hierarchical sampling strategy in NeuS [42]. The learning rate is linearly warmed up from 0 to 5e-3 in the first 5k steps and then decayed to 2.5e-5 with a cosine schedule. For each scene, we train the network for 300k steps costing 10 hours on a single A6000.", + "bbox": [ + 215, + 145, + 787, + 220 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.1 Experiments for Different Pretext Tasks", + "text_level": 1, + "bbox": [ + 215, + 244, + 593, + 260 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Settings. We evaluate the effect of various pretext tasks in Tab. 1 by applying pixel similarity as the consistency loss on a subset of the DTU dataset including Scan24, Scan37, and Scan106. These objects are relatively challenging due to difficult lighting conditions and occlusions. Because of the quadratic memory footprint of ViT in high-resolution features, we downsample all images into $512 \\times 768$ for a fair comparison. We only consider the highest and lowest features from the feature encoder as mentioned in Sec. 3.1. More experiments on multi-scale features are presented in the supplementary.", + "bbox": [ + 215, + 271, + 787, + 392 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/4c26786de16fcdbe20f7deec71e70da191fe692608e6e292aa9143eaf4c32543.jpg", + "image_caption": [ + "(a)" + ], + "image_footnote": [], + "bbox": [ + 323, + 402, + 488, + 513 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/8047e110c0120ce9d40b5b05dfe4b57fef989fb6a00dc674c34c39d7fdb77fa8.jpg", + "image_caption": [ + "(b)", + "Fig. 4: Quantitative results of using prior features from different pretext tasks for two scenarios: (a) with the lowest resolution features (high-level features), and (b) with the highest resolution features (low-level features). The red lines indicate the performance of NeuS, with lower values indicating better performance in terms of Chamfer Distance. High-resolution features generally outperform the low-resolution ones." + ], + "image_footnote": [], + "bbox": [ + 501, + 402, + 666, + 513 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In-depth Discussions. As depicted in Fig. 4, when employing low-resolution features for the same model, the performance is noticeably worse compared to using high-resolution features. This is because projecting surface points onto low-resolution feature maps does not yield fine-grained effective features, thus hindering the geometry network from accurately learning the correct geometry. Furthermore, models optimized with high-resolution features from MIM, image classification, semantic segmentation, and monocular depth estimation only perform slightly better than the baseline NeuS [42]. For classification [4,26] and segmentation [47], we think that these pretext tasks focus on high-level semantic information that is not suitable for NSR. For MIM [11,15,46], the most concern is that the effective feature correlations are not fine-grained enough, which limits the performance. For the depth estimation task [19,33], we think that it shares little connection with NSR learning.", + "bbox": [ + 215, + 612, + 787, + 809 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In contrast, models being optimized with feature priors from stereo matching, image matching, and MVS achieve good performance. These tasks share an", + "bbox": [ + 215, + 809, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/526f762368c2e28e23045b364fcd70c05cc145386a32d2d8e1af6d9567594d2d.jpg", + "table_caption": [ + "Table 2: Quantitative results of CD (mm) on the EPFL dataset with different consistent losses. (Fou: Fountain, Her: Herzjesu)" + ], + "table_footnote": [], + "table_body": "
ModelPre-TrainedConsistent LossFouHerMean
Match-NeuSQuadTree [38]Pixel Similarity1.2881.8321.560
Patch Similarity1.3881.7221.555
Patch NCC1.2061.6221.414
Patch SSIM1.2181.6781.448
MVS-NeuSMVSFormer [2]Pixel Similarity1.1991.6981.449
Patch Similarity1.2121.6891.451
Patch NCC1.2421.6461.444
Patch SSIM1.2611.7061.484
NeuralWarp [42]/Patch SSIM1.922.031.97
NeuS [42]//1.7415.6133.677
", + "bbox": [ + 264, + 176, + 733, + 363 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "important common factor, i.e., matching feature similarity across different viewpoints, while the supervision is usually annotated by the depth captured from SfM [23] or specific devices [16]. Thus, low-level and fine-grained feature correlations should be considered in these manners. In general, using feature priors from the same task generally results in a similar performance. However, in the stereo matching task, there is a significant performance gap between IGEV [48] and RAFT-Stereo [24], even though these two models have a similar architecture except for the cost volume regularization. Specifically, IGEV builds the cost volume as a regularization module that encodes and denoises feature conflicts caused by occlusions and non-Lambertian in the image level through 3D CNNs. Although 3D cost volume addresses the issues from the 2D feature encoder, we clarify that it could not help to learn essentially better 2D feature representation. As evidence, features from IGEV achieve inferior performance than RAFT-Stereo, because of the lightweight local cost volume GRU in RAFT-Stereo [24], which releases the capacity of 2D features learned by the feature encoder. From Fig. 4, we observe that QuadTree [38] pre-trained with image matching and MVS methods [2,13] enhanced NeuS achieve much better results compared with others. As mentioned in Tab. 1, models pre-trained on these two tasks enjoy more fine-grained features (1/2 and 1:1). MVS methods are all pre-trained on the DTU dataset [16], while the matching method is pre-trained on the MegaDepth [23]. So MVS manners may suffer from a little data leakage in Fig. 4. To be fair, we further compare the performance of image matching and MVS on EPFL dataset in Sec. 4.2.", + "bbox": [ + 212, + 378, + 787, + 728 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.2 MVS and Image Matching based NSR", + "text_level": 1, + "bbox": [ + 214, + 751, + 578, + 767 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "By incorporating features of pre-trained models such as MVSFormer [2] and QuadTree [38], our approach can generate variants of MVS-NeuS and Match-NeuS, respectively. Additionally, the evaluation is conducted on EPFL [36] and includes both pixel-wise and patch-wise losses.", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 313, + 114, + 727, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/0a9918be8320b5aa2b8ea884dd747dc911892e025ed59aec47b0663118e732fa.jpg", + "image_caption": [ + "Pixel Similarity" + ], + "image_footnote": [], + "bbox": [ + 281, + 128, + 385, + 196 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/f39ec3f0a09749a7c2453e2d0f3b87c5651874582caaef2066066bbff5f4dea0.jpg", + "image_caption": [ + "Patch Similarity", + "Top-K View Selection", + "Fig. 5: Qualitative results of different source view selecting strategies based on pixel similarity and patch similarity consistent losses in the Herzjesu of EPFL dataset." + ], + "image_footnote": [], + "bbox": [ + 387, + 128, + 488, + 199 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/f999ae6aa5c22dc9577d2f7a8cb637e31e0b89d9356d5d6d962d96005082fe59.jpg", + "image_caption": [ + "Pixel Similarity", + "Nearby View Selection" + ], + "image_footnote": [], + "bbox": [ + 503, + 127, + 606, + 199 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/34cc6e61567796fcd0341514db3beb4fae516b7f73774b6052eb5e2a665a1ef2.jpg", + "image_caption": [ + "Patch Similarity" + ], + "image_footnote": [], + "bbox": [ + 612, + 128, + 714, + 198 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "From Tab. 2, we find that the patch-wise NCC and SSIM could be successfully extended to feature level, and achieve better results compared with pixel similarity for Match-NeuS. Additionally, Match-NeuS with patch NCC outperforms MVS-NeuS, despite features from MVSFormer containing larger resolutions. As discussed in Sec. 4.1, the main reason for the better performance of Match-NeuS is that image matching models are pre-trained without the cost volume regularization, because no camera poses could be used to formulate the 3D cost volume. Furthermore, due to the prohibitive computation for the 3D CNN in the cost volume regularization, MVS methods should reduce the 2D feature channels for efficiency. Thus the matching-based QuadTree has 256 feature channels, while MVSformer only contains 8 feature channels with less capacity. In Fig. 6, we show that Match-NeuS with patch NCC recovers more detailed structures in Fountain, while reconstructing smoother walls.", + "bbox": [ + 212, + 261, + 787, + 458 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/81de63365c043b25a92b46f1f473fe02be450721e8a890952e1f282b7381aec0.jpg", + "image_caption": [ + "Fig.6: Qualitative comparisons on EPFL dataset." + ], + "image_footnote": [], + "bbox": [ + 302, + 460, + 705, + 589 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/f07c52e822ddc91d3f163f7cf2b74aeeef8b7039f71fc440fe8629e234a5e7e5.jpg", + "table_caption": [ + "Table 3: Ablation study of CD (mm) on matching features w/wo attention modules. We further compare them to the results of high-resolution features $(1 / 2)$ without attention modules." + ], + "table_footnote": [], + "table_body": "
ModelConsistent Loss Res.FountainHerzjesuMean
Match-NeuSPixel Similarity1/21.2881.832
Match-NeuSPixel Similarity1/81.6343.360
+ AttentionPixel Similarity1/81.5023.010
", + "bbox": [ + 292, + 667, + 705, + 739 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "View Selection. We compare the view selection for both pixel-wise and patchwise losses in Fig. 5, From Fig. 5, the Top-k view selection mentioned in Sec. 3.2 fails to adaptively choose reasonable source views through pixel-wise feature similarity, resulting in poor reconstruction. Thus we need to manually select nearby source views to stabilize the training of pixel-wise feature similarity. However, the Top-k view selection based on patch-wise feature similarity can", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 269, + 114, + 359, + 126 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "achieve stable training and better reconstruction. Because local patches usually capture more information with larger perceptive fields, effectively addressing occlusion issues.", + "bbox": [ + 212, + 146, + 784, + 190 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Features with Attention Modules. We observe that QuadTree employs the interleaved attention mechanism [38] including self and cross-attention modules. Attention modules enable explicit feature matching across different views and enhance the feature capacity. However, due to its high computational cost, the transformer layer is designed to refine only 1/8 feature scale. Hence this improvement fails to be transferred to high-resolution feature learning (1/2). We have presented a comparison in Tab. 3 to showcase this improvement. It is evident that by incorporating the features after attention learning, Match-NeuS improves its performance, but it still performs worse than high-resolution feature learning.", + "bbox": [ + 212, + 191, + 787, + 328 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.3 Extension of Feature Prior on Grid-based Representation.", + "text_level": 1, + "bbox": [ + 215, + 348, + 741, + 363 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/e6a5ef65d8148da556aab6fc2ad06d7be2f7b39c2988c96f21d6be6e058d327a.jpg", + "image_caption": [ + "Fig. 7: Qualitative results of Neuralangelo with feature priors." + ], + "image_footnote": [], + "bbox": [ + 320, + 373, + 684, + 520 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We incorporate feature priors into grid-based Neuralangelo [22] as in Fig 7. Specifically, we train Neuralangelo with MVSFormer feature priors on DTU dataset for $300\\mathrm{k}$ iterations. The inclusion of MVS features enhances the accuracy of geometry and accelerates convergence, especially in intricate objects like scissors' handles in Scan37 and the snowman in Scan69. Moreover, Neuralangelo with feature priors achieves smoother flat surfaces in Scan40 and Scan63.", + "bbox": [ + 212, + 554, + 787, + 645 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.4 Full Models Compared on DTU", + "text_level": 1, + "bbox": [ + 214, + 665, + 526, + 681 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We compare MVS-NeuS and Match-NeuS with patch NCC as the consistent loss to other competitors on 15 scenes in the DTU dataset. Tab. 4 shows the quantitative results. Notably, our methods outperform other competitors by a large margin. Furthermore, we observed the qualitative results in Fig. 8 that our method can accurately reconstruct the geometry of these scenes. Specifically, our method is capable of not only modeling smooth flat planes but also clearly capturing gaps between two planes or the handle of scissors. In contrast, many other methods tend to fuse together in Scan37 with obvious artifacts. Quantitative results in Tab. 4 show that our model significantly outperforms other competing approaches.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 313, + 114, + 727, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/792e9a07e724d827f078d24a206e1f42a14a990f286aec4b5fd4defc166f156a.jpg", + "image_caption": [ + "Fig. 8: Comparisons of surface reconstruction in DTU dataset." + ], + "image_footnote": [], + "bbox": [ + 236, + 141, + 774, + 369 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/a540bbd59e1e7f41de2f1e6db695d3995ca34e349b62bf9b3157a6617c0a2d4b.jpg", + "table_caption": [ + "Table 4: Results of CD (mm) compared on DTU dataset (lower is better). The upper part methods enjoy additional annotations such as masks (IDR and COLMAP) or custom filtering (MVSDF). Note that the results of GeoNeuS* are re-trained by ourselves, The best results are in bold." + ], + "table_footnote": [], + "table_body": "
Scan243740556365698397105106110114118122Mean
COLMAP [35]0.450.910.370.370.901.000.541.221.080.640.480.590.320.450.430.65
MVSDF [56]0.931.750.880.441.110.900.751.261.021.350.870.840.340.470.470.88
IDR [52]1.631.870.630.481.040.790.771.331.160.760.670.900.420.510.530.90
NeRF [28]1.901.601.850.582.281.271.471.672.051.070.882.531.061.150.961.49
NeuS [42]1.371.210.730.401.200.700.721.011.160.820.661.690.390.490.510.87
VolSDF [51]1.141.260.810.491.250.700.721.291.180.700.661.080.420.610.550.86
NeuralWarp [6]0.490.710.380.380.790.810.821.201.060.680.660.740.410.630.510.68
GeoNeuS* [9]0.400.690.360.370.790.780.481.170.880.600.500.730.300.390.410.59
D-NeuS [3]0.440.790.350.390.880.580.551.350.910.760.400.720.310.390.390.61
PET-NeuS [44]0.560.750.680.360.870.760.691.331.080.660.511.040.340.510.480.71
MVS-NeuS0.370.630.310.320.790.510.501.120.870.620.460.640.290.380.410.548
Match-NeuS0.390.670.320.330.790.510.491.210.870.630.480.710.290.380.410.565
", + "bbox": [ + 220, + 467, + 782, + 638 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 655, + 359, + 671 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we conducted an evaluation of various pretext tasks and consistent losses for NSR. Our findings showed that the feature priors from some pretext visual tasks including MVS and image matching can significantly improve the NSR performance. We also empirically observed that features with higher resolution consistently outperform the lower ones. Additionally, we further explored optimizing MVS and image matching enhanced NSR with both pixel-wise and patch-wise consistent losses. The results showed that the patch-wise consistent loss could be successfully generalized to the feature level and achieve superior reconstruction for the matching-based Match-NeuS.", + "bbox": [ + 212, + 704, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported in part by the National Natural Science Foundation of China under Grant 62076067 and Shanghai Municipal Science and Technology Major Project (NO. 2021SHZDZX0103). This work was performed using the CFFF platform of Fudan University. Yanwei Fu is with School of Data Science, Fudan ISTBI—ZJNU Algorithm Centre for Brain-inspired Intelligence, Fudan University, Shanghai Key Lab of Intelligent Information Processing, and Technology Innovation Center of Calligraphy and Painting Digital Generation, Ministry of Culture and Tourism, China. Email: yanweifu@fudan.edu.cn", + "bbox": [ + 212, + 172, + 787, + 292 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 311, + 321, + 328 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009)", + "2. Cao, C., Ren, X., Fu, Y.: Mvsformer: Multi-view stereo by learning robust image features and temperature-based depth. Transactions of Machine Learning Research", + "3. Chen, D., Zhang, P., Feldmann, I., Schreer, O., Eisert, P.: Recovering fine details for neural implicit surface reconstruction. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4330-4339 (2023)", + "4. Chu, X., Tian, Z., Wang, Y., Zhang, B., Ren, H., Wei, X., Xia, H., Shen, C.: Twins: Revisiting the design of spatial attention in vision transformers. Advances in Neural Information Processing Systems 34, 9355-9366 (2021)", + "5. Dai, Y., Zhu, Z., Rao, Z., Li, B.: Mvs2: Deep unsupervised multi-view stereo with multi-view symmetry. In: 2019 International Conference on 3D Vision (3DV). pp. 1-8. IEEE (2019)", + "6. Darmon, F., Bascle, B., Devaux, J.C., Monasse, P., Aubry, M.: Improving neural implicit surfaces geometrym fan with patch warping. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6260-6269 (2022)", + "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)", + "8. Drebin, R.A., Carpenter, L., Hanrahan, P.: Volume rendering. ACM Siggraph Computer Graphics 22(4), 65-74 (1988)", + "9. Fu, Q., Xu, Q., Ong, Y.S., Tao, W.: Geo-neus: geometry-consistent neural implicit surfaces learning for multi-view reconstruction. arXiv preprint arXiv:2205.15848 (2022)", + "10. Galliani, S., Lasinger, K., Schindler, K.: Massively parallel multiview stereopsis by surface normal diffusion. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 873-881 (2015)", + "11. Gao, P., Ma, T., Li, H., Dai, J., Qiao, Y.: Convmae: Masked convolution meets masked autoencoders. arXiv preprint arXiv:2205.03892 (2022)", + "12. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. arXiv preprint arXiv:2002.10099 (2020)", + "13. Gu, X., Fan, Z., Zhu, S., Dai, Z., Tan, F., Tan, P.: Cascade cost volume for high-resolution multi-view stereo and stereo matching. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2020)" + ], + "bbox": [ + 218, + 339, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 313, + 114, + 727, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Guo, H., Peng, S., Lin, H., Wang, Q., Zhang, G., Bao, H., Zhou, X.: Neural 3d scene reconstruction with the manhattan-world assumption. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5511-5520 (2022)", + "15. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022)", + "16. Jensen, R., Dahl, A., Vogiatzis, G., Tola, E., Aanæs, H.: Large scale multi-view stereopsis evaluation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 406-413 (2014)", + "17. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013)", + "18. Khot, T., Agrawal, S., Tulsiani, S., Mertz, C., Lucey, S., Hebert, M.: Learning unsupervised multi-view stereopsis via robust photometric consistency. arXiv preprint arXiv:1905.02706 (2019)", + "19. Kim, D., Ka, W., Ahn, P., Joo, D., Chun, S., Kim, J.: Global-local path networks for monocular depth estimation with vertical cutdepth. arXiv preprint arXiv:2201.07436 (2022)", + "20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)", + "21. Labatut, P., Pons, J.P., Keriven, R.: Efficient multi-view reconstruction of large-scale scenes using interest points, delaunay triangulation and graph cuts. In: 2007 IEEE 11th international conference on computer vision. pp. 1-8. IEEE (2007)", + "22. Li, Z., Müller, T., Evans, A., Taylor, R.H., Unberath, M., Liu, M.Y., Lin, C.H.: Neuralangelo: High-fidelity neural surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8456-8465 (2023)", + "23. Li, Z., Snavely, N.: Megadepth: Learning single-view depth prediction from internet photos. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2041-2050 (2018)", + "24. Lipson, L., Teed, Z., Deng, J.: Raft-stereo: Multilevel recurrent field transforms for stereo matching. In: 2021 International Conference on 3D Vision (3DV). pp. 218-227. IEEE (2021)", + "25. Liu, S., Zhang, Y., Peng, S., Shi, B., Pollefeys, M., Cui, Z.: Dist: Rendering deep implicit signed distance function with differentiable sphere tracing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2019-2028 (2020)", + "26. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022)", + "27. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4460-4470 (2019)", + "28. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)", + "29. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "30. Mur-Artal, R., Tardós, J.D.: Orb-slam2: An open-source slam system for monoc- \ncular, stereo, and rgb-d cameras. IEEE transactions on robotics 33(5), 1255-1262 (2017)", + "31. Niemeyer, M., Mescheder, L., Oechsle, M., Geiger, A.: Differentiable volumetric rendering: Learning implicit 3d representations without 3d supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3504-3515 (2020)", + "32. Oechsle, M., Peng, S., Geiger, A.: Unisurf: Unifying neural implicit surfaces and radiance fields for multi-view reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5589-5599 (2021)", + "33. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE transactions on pattern analysis and machine intelligence 44(3), 1623-1637 (2020)", + "34. Schonberger, J.L., Frahm, J.M.: Structure-from-motion revisited. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4104-4113 (2016)", + "35. Schonberger, J.L., Zheng, E., Frahm, J.M., Pollefeys, M.: Pixelwise view selection for unstructured multi-view stereo. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 501-518. Springer (2016)", + "36. Strecha, C., Von Hansen, W., Van Gool, L., Fua, P., Thoennessen, U.: On benchmarking camera calibration and multi-view stereo for high resolution imagery. In: 2008 IEEE conference on computer vision and pattern recognition. pp. 1-8. IEEE (2008)", + "37. Sun, C., Sun, M., Chen, H.T.: Direct voxel grid optimization: Super-fast convergence for radiance fields reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5459-5469 (2022)", + "38. Tang, S., Zhang, J., Zhu, S., Tan, P.: Quadtree attention for vision transformers. ICLR (2022)", + "39. Teed, Z., Deng, J.: Deepv2d: Video to depth with differentiable structure from motion. arXiv preprint arXiv:1812.04605 (2018)", + "40. Vijayanarasimhan, S., Ricco, S., Schmid, C., Sukthankar, R., Fragkiadaki, K.: Sfnet: Learning of structure and motion from video. arXiv preprint arXiv:1704.07804 (2017)", + "41. Wang, J., Bleja, T., Agapito, L.: Go-surf: Neural feature grid optimization for fast, high-fidelity rgb-d surface reconstruction. arXiv preprint arXiv:2206.14735 (2022)", + "42. Wang, P., Liu, L., Liu, Y., Theobalt, C., Komura, T., Wang, W.: Neus: Learning neural implicit surfaces by volume rendering for multi-view reconstruction. arXiv preprint arXiv:2106.10689 (2021)", + "43. Wang, Y., Skorokhodov, I., Wonka, P.: Hf-neus: Improved surface reconstruction using high-frequency details. Advances in Neural Information Processing Systems 35, 1966-1978 (2022)", + "44. Wang, Y., Skorokhodov, I., Wonka, P.: Pet-neus: Positional encoding tri-planes for neural surfaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12598-12607 (2023)", + "45. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Neural Surface Reconstruction with Feature Priors", + "bbox": [ + 315, + 114, + 727, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: Croco: Self-supervised pre-training for 3d vision tasks by cross-view completion. arXiv preprint arXiv:2210.10716 (2022)", + "47. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. Advances in Neural Information Processing Systems 34, 12077-12090 (2021)", + "48. Xu, G., Wang, X., Ding, X., Yang, X.: Iterative geometry encoding volume for stereo matching. arXiv preprint arXiv:2303.06615 (2023)", + "49. Xu, Q., Wang, W., Ceylan, D., Mech, R., Neumann, U.: Disn: Deep implicit surface network for high-quality single-view 3d reconstruction. Advances in neural information processing systems 32 (2019)", + "50. Yang, Z., Wang, P., Xu, W., Zhao, L., Nevatia, R.: Unsupervised learning of geometry from videos with edge-aware depth-normal consistency. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 32 (2018)", + "51. Yariv, L., Gu, J., Kasten, Y., Lipman, Y.: Volume rendering of neural implicit surfaces. Advances in Neural Information Processing Systems 34, 4805-4815 (2021)", + "52. Yariv, L., Kasten, Y., Moran, D., Galun, M., Atzmon, M., Ronen, B., Lipman, Y.: Multiview neural surface reconstruction by disentangling geometry and appearance. Advances in Neural Information Processing Systems 33, 2492-2502 (2020)", + "53. Yi, X., Zhou, Y., Habermann, M., Golyanik, V., Pan, S., Theobalt, C., Xu, F.: Ecolocate: Real-time motion capture, localization, and mapping with sparse body-mounted sensors. arXiv preprint arXiv:2305.01599 (2023)", + "54. Yu, Z., Peng, S., Niemeyer, M., Sattler, T., Geiger, A.: Monosdf: Exploring monocular geometric cues for neural implicit surface reconstruction. arXiv preprint arXiv:2206.00665 (2022)", + "55. Zhang, J., Yao, Y., Li, S., Luo, Z., Fang, T.: Visibility-aware multi-view stereo network. arXiv preprint arXiv:2008.07928 (2020)", + "56. Zhang, J., Yao, Y., Quan, L.: Learning signed distance field for multi-view surface reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6525-6534 (2021)", + "57. Zhang, K., Luan, F., Wang, Q., Bala, K., Snavely, N.: Physg: Inverse rendering with spherical gaussians for physics-based material editing and relighting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5453-5462 (2021)" + ], + "bbox": [ + 215, + 146, + 785, + 619 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "X. Ren et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_model.json b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_model.json new file mode 100644 index 0000000000000000000000000000000000000000..19623f141fdb0b644842d9b7e81d18210c53da9d --- /dev/null +++ b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_model.json @@ -0,0 +1,2546 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.235, + 0.141, + 0.773, + 0.188 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images" + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.219, + 0.763, + 0.237 + ], + "angle": 0, + "content": "Xinlin Ren\\(^{1*}\\), Chenjie Cao\\(^{1,2*}\\), Yanwei Fu\\(^{1\\dagger}\\), and Xiangyang Xue\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.327, + 0.246, + 0.677, + 0.292 + ], + "angle": 0, + "content": "\\(^{1}\\) Fudan University \n\\(^{2}\\) Alibaba Group, DAMO Academy \n{xlren20,cjcao20,yanweifu,xyxue}@fudan.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.325, + 0.747, + 0.658 + ], + "angle": 0, + "content": "Abstract. Recent advancements in Neural Surface Reconstruction (NSR) have significantly improved multi-view reconstruction when coupled with volume rendering. However, relying solely on photometric consistency in image space falls short of addressing complexities posed by real-world data, including occlusions and non-Lambertian surfaces. To tackle these challenges, we propose an investigation into feature-level consistent loss, aiming to harness valuable feature priors from diverse pretext visual tasks and overcome current limitations. It is crucial to note the existing gap in determining the most effective pretext visual task for enhancing NSR. In this study, we comprehensively explore multi-view feature priors from seven pretext visual tasks, comprising thirteen methods. Our main goal is to strengthen NSR training by considering a wide range of possibilities. Additionally, we examine the impact of varying feature resolutions and evaluate both pixel-wise and patch-wise consistent losses, providing insights into effective strategies for improving NSR performance. By incorporating pre-trained representations from MVSFormer [2] and QuadTree [38], our approach can generate variations of MVS-NeuS and Match-NeuS, respectively. Our results, analyzed on DTU and EPFL datasets, reveal that feature priors from image matching and multi-view stereo outperform other pretext tasks. Moreover, we discover that extending patch-wise photometric consistency to the feature level surpasses the performance of pixel-wise approaches. These findings underscore the effectiveness of these techniques in enhancing NSR outcomes. Codes and models are available at https://github.com/maybeLx/MVS_NeuS." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.671, + 0.665, + 0.685 + ], + "angle": 0, + "content": "Keywords: Feature Priors \\(\\cdot\\) Neural Surface Reconstruction" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.711, + 0.378, + 0.727 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.742, + 0.788, + 0.804 + ], + "angle": 0, + "content": "Reconstructing surface from multi-view images is a crucial task in 3D computer vision. Traditionally, this task is addressed using a pipeline that includes depth prediction, point cloud reconstruction, and maximizing point consistency for surface mesh [1,17,21,35]. Unfortunately, these traditional methods often result in" + }, + { + "type": "page_footnote", + "bbox": [ + 0.233, + 0.812, + 0.394, + 0.825 + ], + "angle": 0, + "content": "*: Equal Contributions." + }, + { + "type": "page_footnote", + "bbox": [ + 0.233, + 0.825, + 0.402, + 0.84 + ], + "angle": 0, + "content": "†: Corresponding Author" + }, + { + "type": "list", + "bbox": [ + 0.233, + 0.812, + 0.402, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "image", + "bbox": [ + 0.23, + 0.156, + 0.568, + 0.279 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.385, + 0.284, + 0.406, + 0.296 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.572, + 0.147, + 0.768, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.659, + 0.284, + 0.68, + 0.296 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.299, + 0.789, + 0.37 + ], + "angle": 0, + "content": "Fig. 1: (a) Pixel-wise similarity for RGB images: MVS features [2] and matching features [38] on non-Lambertian surfaces. (b) Multi-view consistency of feature priors: Given a ray direction, the geometry network can extract surface points, which are used to project and align source features to the reference view for optimizing patch-wise photometric consistency loss." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.384, + 0.789, + 0.55 + ], + "angle": 0, + "content": "visual errors due to the complexity of these procedures. In contrast, recent approaches opt to represent the surface through volume rendering, inspired by the Neural Radiance Fields (NeRF) [28], thereby avoiding the accumulation of errors seen in the traditional pipeline. Notably, Neural Surface Reconstruction (NSR) has made significant strides in multi-view reconstruction, leveraging techniques such as Signed Distance Functions (SDF) [42, 51] and occupancy [31] combined with volume rendering. However, despite these advancements, these sophisticated methods still grapple with fundamental challenges in surface reconstruction, including maintaining geometric consistency across different views. This challenge becomes particularly pronounced when dealing with non-Lambertian surfaces and occlusions [6, 9], as illustrated in Fig. 1a." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.79, + 0.703 + ], + "angle": 0, + "content": "To tackle these challenges, earlier studies [6, 9] have delved into optimizing patch-wise warping losses in image space, employing metrics such as Structural Similarity (SSIM) [45] or Normalized Cross-Correlation (NCC) [10]. In an effort to enhance the robustness of geometric consistency in real-world scenarios, Chen et al. [3] utilized features extracted from a learning-based Multi-View Stereo (MVS) model [55] to compute pixel-wise feature similarity. Despite promising results with MVS features, it remains unclear whether the neural surface reconstruction can benefit from other pretext tasks and what key factors contribute to improved reconstruction. Furthermore, it is worth investigating whether these features can also benefit from patch-wise photometric consistency." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.789, + 0.842 + ], + "angle": 0, + "content": "This study aims to address these questions by conducting a comprehensive investigation into the impact of diverse pre-trained feature priors obtained from various pretext visual tasks for NSR learning. We thoroughly consider seven distinctly different pretext visual tasks, encompassing 2D supervised [4, 26, 47], 2D self-supervised [11, 15, 46], and 3D supervised [2, 13, 19, 24, 33, 38, 48] approaches. The pre-trained models from these tasks can serve as feature extractors for our NSR task. Crucially, we not only compare various architectures used in these models, ranging from Convolution Neural Networks (CNNs) [13, 24, 26, 48] to Vision Transformers (ViTs) [2, 15, 46, 47], but also explore feature maps from dif" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.315, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.787, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.785, + 0.193 + ], + "angle": 0, + "content": "ferent layers within the same model to identify common factors relevant to NSR. Furthermore, we propose for extending patch-wise photometric consistency to the feature level, resulting in substantial improvements." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.198, + 0.788, + 0.365 + ], + "angle": 0, + "content": "Formally, our approach enhances NSR by integrating various feature priors derived from multi-view images. Building upon the robust foundation of NeuS [42], which acts as the baseline method in this paper, we further improve NSR by introducing feature-level consistent loss from diverse pre-trained models, as depicted in Fig. 1b. Specifically, we compare 13 pre-trained models across 7 distinct pretext tasks, as listed in Tab. 1. To the best of our knowledge, this evaluation represents the most comprehensive assessment of pretext tasks on NSR to date, encompassing masked image modeling [11, 15, 46], image classification [4, 26], semantic segmentation [47], monocular depth estimation [19, 33], stereo matching [24, 48], image matching [38], and MVS [2, 13]. The DTU and EPFL datasets serve as the benchmark for evaluation [16]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.371, + 0.788, + 0.462 + ], + "angle": 0, + "content": "Notably and interestingly, our empirical findings reveal that models pretrained on MVS and image matching tasks consistently outperform others significantly. This success is attributed to the feature similarity supervision provided by depth annotation [16] for MVS and Structure from Motion (SfM) [23] for image matching. Moreover, these tasks yield high-resolution features, emerging as another crucial factor contributing to the superior performance of NSR models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.467, + 0.788, + 0.693 + ], + "angle": 0, + "content": "Furthermore, we observe that 3D-CNN regularization, designed to denoise the 3D cost volume [2, 13, 48], impedes effective 2D feature learning. Consequently, utilizing features from pre-trained models of image matching tasks without 3D cost volume regularization achieves the best performance and generalization in NSR. Moreover, in our experiments on the EPFL dataset [36], we make an intriguing observation that patch-wise photometric consistency can be effectively generalized to the feature level, resulting in remarkable improvements. Thus, bolstered by patch-wise photometric consistency losses from pre-trained models in both MVSFormer [2] and QuadTree [38] our approach can produce variations of MVS-NeuS and Match-NeuS. These variations demonstrate state-of-the-art performance on the DTU and EPFL datasets, respectively. Additionally, we take a further exploration of the feature priors on grid-based methods such as Neuralangelo [22], where feature priors still enjoy promising benefits. Thus our method could be extended to different neural representations (MLP or grid-based methods). Our contributions can be highlighted as follows:" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.699, + 0.788, + 0.775 + ], + "angle": 0, + "content": "1) We are the first to conduct a comprehensive evaluation of prior features derived from various pretext tasks on NSR. Additionally, we delve into a detailed comparison of pixel-wise feature consistent loss across these approaches. This comprehensive analysis advances our understanding of the effect of different feature priors for NSR." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "2) Our research brings to light a significant finding: models pre-trained on image matching and MVS tasks consistently outperform others in the realm of NSR. This superior performance is attributed to the advantages gained from feature-similarity related pretext training and the utilization of high-resolution" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.699, + 0.788, + 0.842 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: A summary of models from various pretext tasks including MIM (masked image modeling), IC (image classification), MDE (monocular depth estimation), SM (stereo matching), SS (semantic segmentation), IM (image matching), and MVS. Only the feature dimensions and resolutions of the highest and lowest features are shown. (Res: Resolution, Dim: Dimension)" + }, + { + "type": "table", + "bbox": [ + 0.317, + 0.218, + 0.681, + 0.437 + ], + "angle": 0, + "content": "
TaskModelArchitectFeature ResFeature Dim
MIMMAE [15]ViT1/161024
CovMAE [11]ViT+CNN1/16,1/4768,256
CroCo [46]ViT1/16768
ICTwins [4]ViT1/32, 1/41024,128
ConvNeXt [26]CNN1/32, 1/42048,256
SSSegFormer [47]ViT1/32, 1/4512,64
MDEGLPN [19]ViT1/32, 1/4512,64
MiDaS [33]ViT1/322048
SMIGEV [48]CNN1/32, 1/4160,96
RAFT-Stereo [24]CNN1/4256
IMQuadTree [38]ViT+CNN1/8,1/2256,128
MVSCascadeMVS [13]CNN1/8,132,8
MVSFormer [2]ViT+CNN1/8,132,8
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.455, + 0.786, + 0.484 + ], + "angle": 0, + "content": "features. By identifying these key factors, our work contributes valuable insights that can inform future developments in NSR methods." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.485, + 0.788, + 0.577 + ], + "angle": 0, + "content": "3) Another notable contribution of our research lies in the successful extension of the patch-wise photometric consistency loss to the feature level. This innovative approach stands as a significant advancement, leading to improved results regardless of different neural representations (MLP or grid-based methods). By bridging the gap between patch-wise and feature-level considerations, our work reaches the state-of-the-art in NSR." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.598, + 0.389, + 0.615 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Neural Surfaces Reconstruction (NSR). Surface reconstruction based on deep learning has garnered significant attention due to its expressive representation capabilities. Representative algorithms focus on utilizing implicit representations to encode the geometry and appearance of 3D scenes through neural networks. These representations include occupancy fields [27, 31] and SDF [25, 49, 52, 56, 57]. Since the emergence of volume rendering techniques pioneered by NeRF [28], numerous NSR methods have seen a dramatic rise [3, 6, 9, 14, 32, 42-44, 51, 54]. Notably, VolSDF [51] and NeuS [42] convert volume density to SDF without the need for masks, while UNISURF [32] unifies both surface and volume rendering. Concurrently, grid-based representation methods are gaining attention [22, 29, 37, 41], as they offer faster convergence compared to implicit ones with competitive results. Essentially, note that these explicit NSR methods serve as robust foundations, and our contributions are orthogonal to these approaches. However, it is crucial to highlight that all these existing methods" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.315, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.304, + 0.145, + 0.695, + 0.322 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.33, + 0.788, + 0.375 + ], + "angle": 0, + "content": "Fig. 2: Approach overview. Our method is based on NeuS [42]. After achieving surface points from geometry network \\( f_{\\theta_g} \\), we further apply the multi-view consistent loss based on features from pre-trained models to improve the reconstruction quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.39, + 0.787, + 0.42 + ], + "angle": 0, + "content": "overlook the importance of multi-view consistency during surface reconstruction. This gap forms the basis for our unique contributions in addressing this aspect." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.42, + 0.787, + 0.571 + ], + "angle": 0, + "content": "Photometric Consistency. Many previous studies have delved into the application of photometric consistency across various 3D reconstruction tasks [5, 18, 30, 34, 39, 40, 50, 53]. For SfM, several researches aim to optimize camera poses by minimizing photometric errors between corresponding pixels in different images [34, 39, 40]. Similarly, various self-supervised MVS methods [5, 18, 50] leverage consistent loss to supervise depth prediction. Moreover, in Simultaneous Localization and Mapping (SLAM), photometric consistency plays a crucial role. By comparing the appearance of projected 3D points in the image with the actual observed images, photometric consistency can detect potential errors or inaccuracies in geometry [30, 53]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.571, + 0.787, + 0.737 + ], + "angle": 0, + "content": "Photometric Consistency in NSR. Prior works [6,9,14] have incorporated patch-wise photometric consistency directly computed from raw images or pixelwise feature similarity to enhance NSR training. NeuralWarp [14] introduces a patch-wise warping loss along with a visibility map that masks incorrect warps arising from occlusion. Similarly, GeoNeus [9] and D-NeuS [6] focus on locating the zero-level set of geometry network to enforce multi-view geometry constraints, resulting in more accurate reconstruction outcomes. Despite these advancements, none of these methods thoroughly explore the distinctions between patch-wise and pixel-wise consistent loss, nor do they investigate the potential benefits of incorporating prior features from other pretext visual tasks as opposed to using raw images." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.762, + 0.538, + 0.779 + ], + "angle": 0, + "content": "3 NSR based on Feature Priors" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.843 + ], + "angle": 0, + "content": "Overview. Given a set of posed multi-view images, the goal of NSR is to reconstruct high-quality surfaces by neural volume rendering, as illustrated in Fig. 2. We revisit the NeuS baseline [42] for multi-view consistency zero-crossing points." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.207 + ], + "angle": 0, + "content": "We briefly introduce pretext tasks in Sec. 3.1 and discuss consistent loss in both pixel-wise and patch-wise terms in Sec. 3.2. By utilizing pre-trained representations from MVS and image matching pretext tasks, we have MVS-NeuS and Match-NeuS, which are compared in the experiments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.788, + 0.284 + ], + "angle": 0, + "content": "NeuS [42] proposes a novel scheme to achieve unbiased reconstructed surfaces in the first-order approximation of SDF. In this scheme, a ray \\(\\{p(t) = o + tv|t > 0\\}\\) is emitted from a camera center at \\(o\\) with view direction \\(v\\). Colors \\(\\hat{C}(r)\\) along a ray can be accumulated by volume rendering [8], which is approximated by \\(N\\) discretely sampled points as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.365, + 0.297, + 0.786, + 0.34 + ], + "angle": 0, + "content": "\\[\n\\hat {C} (r) = \\sum_ {i = 1} ^ {N} T _ {i} \\alpha_ {i} c _ {i}, \\quad T _ {i} = \\prod_ {j = 1} ^ {i - 1} \\left(1 - \\alpha_ {j}\\right), \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.352, + 0.788, + 0.385 + ], + "angle": 0, + "content": "where \\(\\alpha_{i}\\) and \\(T_{i}\\) are the opacity and accumulated transmittance along the ray respectively. To achieve the unbiased surface, we can compute \\(\\alpha_{i}\\) by:" + }, + { + "type": "equation", + "bbox": [ + 0.347, + 0.397, + 0.786, + 0.431 + ], + "angle": 0, + "content": "\\[\n\\alpha_ {i} = \\max \\left(\\frac {\\Phi_ {s} (s d f (p _ {i})) - \\Phi_ {s} (s d f (p _ {i + 1}))}{\\Phi_ {s} (s d f (p _ {i}))}, 0\\right), \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.438, + 0.788, + 0.469 + ], + "angle": 0, + "content": "where \\( sdf(\\cdot) \\) is the SDF function modeled by the geometry network \\( f_{\\theta_g} \\). \\( \\varPhi_s(\\cdot) \\) is the sigmoid function and \\( s \\) is a learnable parameter." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.47, + 0.788, + 0.577 + ], + "angle": 0, + "content": "Differentiable Zero-Crossing Points. Since achieving photometric consistency involves warping patches or pixels based on a specific depth, we define the depth planes through zero-crossing points achieved from the zero-level set of SDF function as [3, 6]. So it is crucial to apply photometric consistency specifically to the zero-crossing points of geometry network \\( f_{\\theta_g} \\), as shown in Fig. 3. We only require the first set of zero-crossing points \\( T^* \\) which is visible from the corresponding view. It can be expressed as:" + }, + { + "type": "equation", + "bbox": [ + 0.323, + 0.588, + 0.787, + 0.623 + ], + "angle": 0, + "content": "\\[\nT ^ {*} = \\left\\{t \\mid t = \\frac {s d f \\left(p _ {t _ {i}}\\right) t _ {i + 1} - s d f \\left(p _ {t _ {i + 1}}\\right) t _ {i}}{s d f \\left(p _ {t _ {i}}\\right) - s d f \\left(p _ {t _ {i + 1}}\\right)}, t _ {i} \\in T \\right\\}, \\tag {3}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.344, + 0.644, + 0.787, + 0.669 + ], + "angle": 0, + "content": "\\[\nT = \\underset {i} {\\arg \\min } \\left\\{t _ {i} | s d f \\left(p _ {t _ {i}}\\right) \\cdot s d f \\left(p _ {t _ {t + 1}}\\right)) < 0 \\right\\}. \\tag {4}\n\\]" + }, + { + "type": "image", + "bbox": [ + 0.29, + 0.694, + 0.425, + 0.773 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.317, + 0.775, + 0.394, + 0.786 + ], + "angle": 0, + "content": "Reference Image" + }, + { + "type": "image", + "bbox": [ + 0.426, + 0.694, + 0.563, + 0.773 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.425, + 0.775, + 0.56, + 0.786 + ], + "angle": 0, + "content": "Depth of Zero-Crossing Points" + }, + { + "type": "image", + "bbox": [ + 0.564, + 0.694, + 0.701, + 0.773 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.568, + 0.775, + 0.704, + 0.786 + ], + "angle": 0, + "content": "Depth from Volume Rendering" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.789, + 0.788, + 0.831 + ], + "angle": 0, + "content": "Fig. 3: Two different ways to locate surface points during the network training at 5000 iterations. Compared with volume rendering, it is more accurate to find the surface points via Eq. 3. Accurate surface points are crucial for applying consistent loss." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.315, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.378, + 0.16 + ], + "angle": 0, + "content": "3.1 Predtext Tasks" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.174, + 0.788, + 0.264 + ], + "angle": 0, + "content": "Various models in different pretext visual tasks have been explored as shown in Tab. 1. Our emphasis is specifically on the features obtained from the feature encoder modules of these pre-trained models. Importantly, many of these models include multi-scale feature maps. In this context, our focus is on the most representative features at both the highest and lowest scales, encompassing high-level semantic understanding and fine-grained low-level details, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.265, + 0.788, + 0.37 + ], + "angle": 0, + "content": "Masked Image Modeling (MIM) has been widely investigated recently, as an effective self-supervised task [15]. MIM randomly masks input images at a relatively high rate and subsequently predicts the masked regions based on the context of unmasked areas. MIM has gained significant attention recently, with several pioneering works demonstrating its effectiveness in various downstream tasks [11, 15, 46]. In contrast to other self-supervised tasks, MIM exhibits favorable fine-grained feature correlations that can potentially benefit NSR learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.371, + 0.788, + 0.446 + ], + "angle": 0, + "content": "Image Classification (IC) is a well-established supervised task known for extracting discriminative features. In this paper, we investigate models built on CNNs [26] and ViTs [4] that are pre-trained for image classification on ImageNet [7]. These models serve as baselines, helping us answer the question of whether engaging in such a classic pretext task also enhances the NSR." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.447, + 0.796, + 0.507 + ], + "angle": 0, + "content": "Semantic Segmentation (SS). Models like [20, 47] have demonstrated outstanding performance in semantic segmentation by training on large-scale datasets. Unlike classification tasks, these models can capture more detailed, class-specific features, which holds the potential to enhance NSR training." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.568 + ], + "angle": 0, + "content": "Monocular Depth Estimation (MDE) aims to predict the depth map of a scene using a single input view, essentially creating a 2D representation of a 3D scene. Several successful works [19, 33] have demonstrated the ability to recover fine details of the scene in this process." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.568, + 0.788, + 0.657 + ], + "angle": 0, + "content": "Stereo Matching (SM) is the process of identifying corresponding pixels between two rectified images along epipolar lines, ultimately determining the disparity between these corresponding points. Noteworthy approaches like IGEV [48] and RAFT-Stereo [24] have demonstrated promising results in this task. The learning involved in establishing correspondences bears some similarities to the learning of consistent loss in NSR." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.765 + ], + "angle": 0, + "content": "Multi-View Stereo (MVS) differs from stereo matching in that it involves multiple input views with known camera poses. However, the MVS problem often faces challenges such as occlusions and varying light conditions. Consequently, MVS methods like CasMVSNet [13] and MVSFormer [52] need to enhance feature learning to accurately identify corresponding pixels along epipolar lines. It's worth noting that MVS methods may encounter data bias, as discussed in Sec. 4.2, particularly on the DTU dataset [16]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.766, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Image Matching (IM). In comparison to stereo matching and MVS, image matching tackles a more intractable problem, i.e., detecting fine-grained matching pairs between two images without assistance from known camera poses. To solve this challenge, Tand et al. [38] utilize a transformer with a lightweight QuadTree attention mechanism to capture long-range dependencies. Despite" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.788, + 0.178 + ], + "angle": 0, + "content": "working without constraints from camera poses, we observe that image matching methods can still achieve effective feature representation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.2, + 0.589, + 0.216 + ], + "angle": 0, + "content": "3.2 Feature-Level Photometric Consistency" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.224, + 0.788, + 0.332 + ], + "angle": 0, + "content": "To leverage the consistency of geometry across different views, we utilize the features \\(\\mathbf{F}_r\\) and \\(\\mathbf{F}_s\\) extracted from the reference and source images through various pre-trained models respectively. Photometric consistency can be applied to these multi-view features to enforce their alignment and coherence. Specifically, from the reference viewpoint, we locate a surface point \\(p\\) derived from Eq. 3 with its 2D projection coordinate denoted as \\(x\\). This 2D point is then associated with the corresponding point \\(x'\\) in the source images through the homography \\(H\\):" + }, + { + "type": "equation", + "bbox": [ + 0.417, + 0.341, + 0.786, + 0.358 + ], + "angle": 0, + "content": "\\[\nx ^ {\\prime} = H x, \\quad n ^ {T} p + d = 0, \\tag {5}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.329, + 0.38, + 0.786, + 0.411 + ], + "angle": 0, + "content": "\\[\nH = K _ {s} R _ {s} \\left(I - \\frac {\\left(R _ {s} ^ {- 1} t _ {s} - R _ {r} ^ {- 1} t _ {r}\\right) n ^ {T} R _ {r}}{d}\\right) R _ {r} ^ {- 1} K _ {r} ^ {- 1}, \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.415, + 0.788, + 0.505 + ], + "angle": 0, + "content": "where \\( K_{s} \\) and \\( K_{r} \\) denote the internal calibration matrix of source and reference cameras, \\( (R_{s}, R_{r}) \\) and \\( (t_{s}, t_{r}) \\) are the \\( 3 \\times 3 \\) rotation matrix, and 3D translation vector of two views, respectively. \\( n \\) denotes the surface normal, which can be computed by automatic differentiation of the geometry network at each point \\( p \\). Additionally, \\( I \\) represents the identity matrix and \\( d \\) is the distance from the camera center to the plane of the zero-crossing point (Eq. 3)." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.506, + 0.788, + 0.551 + ], + "angle": 0, + "content": "Pixel Warping. To compute the pixel-level consistency loss, we can evaluate the feature difference between the pixel \\( x \\) in the reference view and its corresponding pixel \\( x' \\) in the source views:" + }, + { + "type": "equation", + "bbox": [ + 0.394, + 0.563, + 0.786, + 0.58 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {p i x e l}} = D _ {\\text {p i x e l}} \\left(\\mathbf {F} _ {r} (x), \\mathbf {F} _ {s} \\left(x ^ {\\prime}\\right)\\right), \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.59, + 0.787, + 0.619 + ], + "angle": 0, + "content": "where \\( D_{pixel} \\) is the cosine similarity function to measure the feature similarity in pixel-wise." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.62, + 0.788, + 0.741 + ], + "angle": 0, + "content": "Patch Warping. To more effectively incorporate local feature information, we can broaden the concept of pixel warping to patch warping. To define a small patch \\( s \\) on the surface, traditionally we would compute the surface points using Eq. 3 and sample numerous points around those surface points to construct the patch. However, this is computationally expensive. As an alternative, we use the central point \\( \\hat{s} \\) of the patch \\( s \\) to represent it and derive the homography matrix \\( H \\). We can perform patch warping from the source view to the reference view and measure the difference between them. The patch-wise consistent loss is" + }, + { + "type": "equation", + "bbox": [ + 0.393, + 0.754, + 0.786, + 0.77 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {p a t c h} = D _ {p a t c h} \\left(\\mathbf {F} _ {r} (\\hat {s}), \\mathbf {F} _ {s} \\left(\\hat {s} ^ {\\prime}\\right)\\right), \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "where \\(\\hat{s}\\), \\(\\hat{s}^{\\prime}\\) denote the centers of reference view patches and projected source view patches respectively. \\(D_{patch}\\) can be represented as NCC [10], SSIM [45], or patch similarity which measures the average of similarity between corresponding elements in the two patches. Since grid-based manners [22] can also locate the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.315, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.787, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "surface points via Eq. 3, we easily extend our method to the grid-based methods in Sec. 4.3. More detailed formulas will be explained in the supplementary." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.788, + 0.359 + ], + "angle": 0, + "content": "About Occlusion. Although we can utilize photometric consistency to supervise the geometry network and encourage accurate surface learning, it's important to note that not all surface points are visible in source view images. Choosing unsuitable source images would cause prominent degradation to the reconstruction. To address this issue, we employ a simple yet effective strategy called Top-k view selection. Specifically, we sort and select 10 source views based on their relative angles from small to large to the reference perspective. Subsequently, we choose Top-k views to compute the patch-wise consistent loss according to the best k photometric scores. We empirically set k to 4 with proper generalization for most scenes. However, we have observed that this strategy does not provide significant benefits to pixel-wise consistency due to the incomplete local feature information which results in unstable view selection during training (Sec. 4.2)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.36, + 0.786, + 0.388 + ], + "angle": 0, + "content": "Training Loss. To render colors from a specific view, the overall loss function is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.381, + 0.392, + 0.786, + 0.408 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {\\text {c o l o r}} + \\lambda_ {1} \\cdot \\mathcal {L} _ {\\text {e i k}} + \\lambda_ {2} \\cdot \\mathcal {L} _ {\\text {f e a t}}, \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.416, + 0.784, + 0.461 + ], + "angle": 0, + "content": "where \\(\\mathcal{L}_{color} = \\sum_{r\\in \\mathcal{R}}\\| \\hat{C} (\\mathbf{r}) - C(\\mathbf{r})\\| _1\\) is the \\(\\ell_1\\) loss from minibatch of rays \\(\\mathcal{R}\\). \\(\\mathcal{L}_{eik}\\) is the eikonal loss defined in [12] to regularize the SDF values predicted by the geometry network \\(f_{\\theta_a}\\) as depicted in Fig. 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.788, + 0.553 + ], + "angle": 0, + "content": "We use feature loss, denoted as \\(\\mathcal{L}_{\\text {feat }}\\), and it is implemented as \\(\\mathcal{L}_{\\text {patch }}\\). Additionally, in Sec. 4.1, we apply the feature loss as \\(\\mathcal{L}_{\\text {pixel }}\\) to assess the features of pre-trained models derived from different pretext tasks. Our results demonstrate that \\(\\mathcal{L}_{\\text {patch }}\\) exhibits greater robustness compared to \\(\\mathcal{L}_{\\text {pixel }}\\), emphasizing the effectiveness of our patch warping loss. During the training stage, we set \\(\\lambda_{1}\\) and \\(\\lambda_{2}\\) as 0.1 and 0.5, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.554, + 0.788, + 0.675 + ], + "angle": 0, + "content": "Discussion. While NeuralWarp [14] has introduced a patching-based warping method to transform source view patches to the reference view, it posits that every sampled point along the ray could be projected to other views to obtain the warped colors, leading to the final warped colors through volume rendering. In contrast, our approach prioritizes the surface points, offering a more accurate and reasonable method that does not depend on visible maps. Furthermore, we extend the patch warping from RGB pixel-level to feature-level, significantly improving the overall quality of reconstruction." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.7, + 0.377, + 0.718 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Datasets. The DTU dataset tested in NSR comprises 15 scenes with 49 or 64 multi-view images collected in an indoor environment with fixed camera poses following [52]. The Chamfer Distance (CD) is utilized to evaluate the performance of reconstructed results on the DTU. We also test two outdoor scenes in EPFL dataset [36], which has 7 and 11 images at a resolution of \\(2048 \\times 3072\\), and one of the scenes is particularly challenging due to the occlusions caused by limited viewpoints." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.146, + 0.788, + 0.222 + ], + "angle": 0, + "content": "Implementation Details. We use the same architecture as [42]. During the training, 512 rays are sampled for each batch following the hierarchical sampling strategy in NeuS [42]. The learning rate is linearly warmed up from 0 to 5e-3 in the first 5k steps and then decayed to 2.5e-5 with a cosine schedule. For each scene, we train the network for 300k steps costing 10 hours on a single A6000." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.246, + 0.594, + 0.261 + ], + "angle": 0, + "content": "4.1 Experiments for Different Pretext Tasks" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.272, + 0.788, + 0.393 + ], + "angle": 0, + "content": "Settings. We evaluate the effect of various pretext tasks in Tab. 1 by applying pixel similarity as the consistency loss on a subset of the DTU dataset including Scan24, Scan37, and Scan106. These objects are relatively challenging due to difficult lighting conditions and occlusions. Because of the quadratic memory footprint of ViT in high-resolution features, we downsample all images into \\(512 \\times 768\\) for a fair comparison. We only consider the highest and lowest features from the feature encoder as mentioned in Sec. 3.1. More experiments on multi-scale features are presented in the supplementary." + }, + { + "type": "image", + "bbox": [ + 0.325, + 0.403, + 0.489, + 0.514 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.4, + 0.516, + 0.42, + 0.528 + ], + "angle": 0, + "content": "(a)" + }, + { + "type": "image", + "bbox": [ + 0.502, + 0.403, + 0.668, + 0.514 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.574, + 0.516, + 0.595, + 0.528 + ], + "angle": 0, + "content": "(b)" + }, + { + "type": "image_caption", + "bbox": [ + 0.217, + 0.531, + 0.788, + 0.601 + ], + "angle": 0, + "content": "Fig. 4: Quantitative results of using prior features from different pretext tasks for two scenarios: (a) with the lowest resolution features (high-level features), and (b) with the highest resolution features (low-level features). The red lines indicate the performance of NeuS, with lower values indicating better performance in terms of Chamfer Distance. High-resolution features generally outperform the low-resolution ones." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.613, + 0.788, + 0.81 + ], + "angle": 0, + "content": "In-depth Discussions. As depicted in Fig. 4, when employing low-resolution features for the same model, the performance is noticeably worse compared to using high-resolution features. This is because projecting surface points onto low-resolution feature maps does not yield fine-grained effective features, thus hindering the geometry network from accurately learning the correct geometry. Furthermore, models optimized with high-resolution features from MIM, image classification, semantic segmentation, and monocular depth estimation only perform slightly better than the baseline NeuS [42]. For classification [4,26] and segmentation [47], we think that these pretext tasks focus on high-level semantic information that is not suitable for NSR. For MIM [11,15,46], the most concern is that the effective feature correlations are not fine-grained enough, which limits the performance. For the depth estimation task [19,33], we think that it shares little connection with NSR learning." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In contrast, models being optimized with feature priors from stereo matching, image matching, and MVS achieve good performance. These tasks share an" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.315, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.144, + 0.787, + 0.174 + ], + "angle": 0, + "content": "Table 2: Quantitative results of CD (mm) on the EPFL dataset with different consistent losses. (Fou: Fountain, Her: Herzjesu)" + }, + { + "type": "table", + "bbox": [ + 0.266, + 0.177, + 0.734, + 0.364 + ], + "angle": 0, + "content": "
ModelPre-TrainedConsistent LossFouHerMean
Match-NeuSQuadTree [38]Pixel Similarity1.2881.8321.560
Patch Similarity1.3881.7221.555
Patch NCC1.2061.6221.414
Patch SSIM1.2181.6781.448
MVS-NeuSMVSFormer [2]Pixel Similarity1.1991.6981.449
Patch Similarity1.2121.6891.451
Patch NCC1.2421.6461.444
Patch SSIM1.2611.7061.484
NeuralWarp [42]/Patch SSIM1.922.031.97
NeuS [42]//1.7415.6133.677
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.38, + 0.789, + 0.729 + ], + "angle": 0, + "content": "important common factor, i.e., matching feature similarity across different viewpoints, while the supervision is usually annotated by the depth captured from SfM [23] or specific devices [16]. Thus, low-level and fine-grained feature correlations should be considered in these manners. In general, using feature priors from the same task generally results in a similar performance. However, in the stereo matching task, there is a significant performance gap between IGEV [48] and RAFT-Stereo [24], even though these two models have a similar architecture except for the cost volume regularization. Specifically, IGEV builds the cost volume as a regularization module that encodes and denoises feature conflicts caused by occlusions and non-Lambertian in the image level through 3D CNNs. Although 3D cost volume addresses the issues from the 2D feature encoder, we clarify that it could not help to learn essentially better 2D feature representation. As evidence, features from IGEV achieve inferior performance than RAFT-Stereo, because of the lightweight local cost volume GRU in RAFT-Stereo [24], which releases the capacity of 2D features learned by the feature encoder. From Fig. 4, we observe that QuadTree [38] pre-trained with image matching and MVS methods [2,13] enhanced NeuS achieve much better results compared with others. As mentioned in Tab. 1, models pre-trained on these two tasks enjoy more fine-grained features (1/2 and 1:1). MVS methods are all pre-trained on the DTU dataset [16], while the matching method is pre-trained on the MegaDepth [23]. So MVS manners may suffer from a little data leakage in Fig. 4. To be fair, we further compare the performance of image matching and MVS on EPFL dataset in Sec. 4.2." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.752, + 0.58, + 0.768 + ], + "angle": 0, + "content": "4.2 MVS and Image Matching based NSR" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.841 + ], + "angle": 0, + "content": "By incorporating features of pre-trained models such as MVSFormer [2] and QuadTree [38], our approach can generate variants of MVS-NeuS and Match-NeuS, respectively. Additionally, the evaluation is conducted on EPFL [36] and includes both pixel-wise and patch-wise losses." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.271, + 0.115, + 0.36, + 0.127 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "image", + "bbox": [ + 0.282, + 0.13, + 0.387, + 0.197 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.299, + 0.202, + 0.357, + 0.211 + ], + "angle": 0, + "content": "Pixel Similarity" + }, + { + "type": "image", + "bbox": [ + 0.388, + 0.13, + 0.489, + 0.2 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.414, + 0.202, + 0.472, + 0.211 + ], + "angle": 0, + "content": "Patch Similarity" + }, + { + "type": "image_caption", + "bbox": [ + 0.342, + 0.213, + 0.421, + 0.221 + ], + "angle": 0, + "content": "Top-K View Selection" + }, + { + "type": "image", + "bbox": [ + 0.504, + 0.128, + 0.607, + 0.2 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.525, + 0.202, + 0.58, + 0.211 + ], + "angle": 0, + "content": "Pixel Similarity" + }, + { + "type": "image", + "bbox": [ + 0.614, + 0.129, + 0.715, + 0.199 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.637, + 0.202, + 0.695, + 0.211 + ], + "angle": 0, + "content": "Patch Similarity" + }, + { + "type": "image_caption", + "bbox": [ + 0.566, + 0.213, + 0.647, + 0.222 + ], + "angle": 0, + "content": "Nearby View Selection" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.225, + 0.785, + 0.253 + ], + "angle": 0, + "content": "Fig. 5: Qualitative results of different source view selecting strategies based on pixel similarity and patch similarity consistent losses in the Herzjesu of EPFL dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.262, + 0.788, + 0.459 + ], + "angle": 0, + "content": "From Tab. 2, we find that the patch-wise NCC and SSIM could be successfully extended to feature level, and achieve better results compared with pixel similarity for Match-NeuS. Additionally, Match-NeuS with patch NCC outperforms MVS-NeuS, despite features from MVSFormer containing larger resolutions. As discussed in Sec. 4.1, the main reason for the better performance of Match-NeuS is that image matching models are pre-trained without the cost volume regularization, because no camera poses could be used to formulate the 3D cost volume. Furthermore, due to the prohibitive computation for the 3D CNN in the cost volume regularization, MVS methods should reduce the 2D feature channels for efficiency. Thus the matching-based QuadTree has 256 feature channels, while MVSformer only contains 8 feature channels with less capacity. In Fig. 6, we show that Match-NeuS with patch NCC recovers more detailed structures in Fountain, while reconstructing smoother walls." + }, + { + "type": "image", + "bbox": [ + 0.303, + 0.462, + 0.706, + 0.59 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.329, + 0.599, + 0.667, + 0.614 + ], + "angle": 0, + "content": "Fig.6: Qualitative comparisons on EPFL dataset." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.623, + 0.785, + 0.663 + ], + "angle": 0, + "content": "Table 3: Ablation study of CD (mm) on matching features w/wo attention modules. We further compare them to the results of high-resolution features \\((1 / 2)\\) without attention modules." + }, + { + "type": "table", + "bbox": [ + 0.293, + 0.668, + 0.706, + 0.741 + ], + "angle": 0, + "content": "
ModelConsistent Loss Res.FountainHerzjesuMean
Match-NeuSPixel Similarity1/21.2881.832
Match-NeuSPixel Similarity1/81.6343.360
+ AttentionPixel Similarity1/81.5023.010
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "View Selection. We compare the view selection for both pixel-wise and patchwise losses in Fig. 5, From Fig. 5, the Top-k view selection mentioned in Sec. 3.2 fails to adaptively choose reasonable source views through pixel-wise feature similarity, resulting in poor reconstruction. Thus we need to manually select nearby source views to stabilize the training of pixel-wise feature similarity. However, the Top-k view selection based on patch-wise feature similarity can" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.315, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.785, + 0.191 + ], + "angle": 0, + "content": "achieve stable training and better reconstruction. Because local patches usually capture more information with larger perceptive fields, effectively addressing occlusion issues." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.788, + 0.329 + ], + "angle": 0, + "content": "Features with Attention Modules. We observe that QuadTree employs the interleaved attention mechanism [38] including self and cross-attention modules. Attention modules enable explicit feature matching across different views and enhance the feature capacity. However, due to its high computational cost, the transformer layer is designed to refine only 1/8 feature scale. Hence this improvement fails to be transferred to high-resolution feature learning (1/2). We have presented a comparison in Tab. 3 to showcase this improvement. It is evident that by incorporating the features after attention learning, Match-NeuS improves its performance, but it still performs worse than high-resolution feature learning." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.349, + 0.742, + 0.364 + ], + "angle": 0, + "content": "4.3 Extension of Feature Prior on Grid-based Representation." + }, + { + "type": "image", + "bbox": [ + 0.321, + 0.374, + 0.686, + 0.521 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.291, + 0.535, + 0.71, + 0.55 + ], + "angle": 0, + "content": "Fig. 7: Qualitative results of Neuralangelo with feature priors." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.555, + 0.788, + 0.646 + ], + "angle": 0, + "content": "We incorporate feature priors into grid-based Neuralangelo [22] as in Fig 7. Specifically, we train Neuralangelo with MVSFormer feature priors on DTU dataset for \\(300\\mathrm{k}\\) iterations. The inclusion of MVS features enhances the accuracy of geometry and accelerates convergence, especially in intricate objects like scissors' handles in Scan37 and the snowman in Scan69. Moreover, Neuralangelo with feature priors achieves smoother flat surfaces in Scan40 and Scan63." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.666, + 0.527, + 0.683 + ], + "angle": 0, + "content": "4.4 Full Models Compared on DTU" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.841 + ], + "angle": 0, + "content": "We compare MVS-NeuS and Match-NeuS with patch NCC as the consistent loss to other competitors on 15 scenes in the DTU dataset. Tab. 4 shows the quantitative results. Notably, our methods outperform other competitors by a large margin. Furthermore, we observed the qualitative results in Fig. 8 that our method can accurately reconstruct the geometry of these scenes. Specifically, our method is capable of not only modeling smooth flat planes but also clearly capturing gaps between two planes or the handle of scissors. In contrast, many other methods tend to fuse together in Scan37 with obvious artifacts. Quantitative results in Tab. 4 show that our model significantly outperforms other competing approaches." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.127 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "image", + "bbox": [ + 0.237, + 0.142, + 0.775, + 0.371 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.29, + 0.388, + 0.713, + 0.403 + ], + "angle": 0, + "content": "Fig. 8: Comparisons of surface reconstruction in DTU dataset." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.412, + 0.788, + 0.467 + ], + "angle": 0, + "content": "Table 4: Results of CD (mm) compared on DTU dataset (lower is better). The upper part methods enjoy additional annotations such as masks (IDR and COLMAP) or custom filtering (MVSDF). Note that the results of GeoNeuS* are re-trained by ourselves, The best results are in bold." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.468, + 0.784, + 0.64 + ], + "angle": 0, + "content": "
Scan243740556365698397105106110114118122Mean
COLMAP [35]0.450.910.370.370.901.000.541.221.080.640.480.590.320.450.430.65
MVSDF [56]0.931.750.880.441.110.900.751.261.021.350.870.840.340.470.470.88
IDR [52]1.631.870.630.481.040.790.771.331.160.760.670.900.420.510.530.90
NeRF [28]1.901.601.850.582.281.271.471.672.051.070.882.531.061.150.961.49
NeuS [42]1.371.210.730.401.200.700.721.011.160.820.661.690.390.490.510.87
VolSDF [51]1.141.260.810.491.250.700.721.291.180.700.661.080.420.610.550.86
NeuralWarp [6]0.490.710.380.380.790.810.821.201.060.680.660.740.410.630.510.68
GeoNeuS* [9]0.400.690.360.370.790.780.481.170.880.600.500.730.300.390.410.59
D-NeuS [3]0.440.790.350.390.880.580.551.350.910.760.400.720.310.390.390.61
PET-NeuS [44]0.560.750.680.360.870.760.691.331.080.660.511.040.340.510.480.71
MVS-NeuS0.370.630.310.320.790.510.501.120.870.620.460.640.290.380.410.548
Match-NeuS0.390.670.320.330.790.510.491.210.870.630.480.710.290.380.410.565
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.656, + 0.36, + 0.672 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.789, + 0.84 + ], + "angle": 0, + "content": "In this paper, we conducted an evaluation of various pretext tasks and consistent losses for NSR. Our findings showed that the feature priors from some pretext visual tasks including MVS and image matching can significantly improve the NSR performance. We also empirically observed that features with higher resolution consistently outperform the lower ones. Additionally, we further explored optimizing MVS and image matching enhanced NSR with both pixel-wise and patch-wise consistent losses. The results showed that the patch-wise consistent loss could be successfully generalized to the feature level and achieve superior reconstruction for the matching-based Match-NeuS." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.315, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.173, + 0.788, + 0.294 + ], + "angle": 0, + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant 62076067 and Shanghai Municipal Science and Technology Major Project (NO. 2021SHZDZX0103). This work was performed using the CFFF platform of Fudan University. Yanwei Fu is with School of Data Science, Fudan ISTBI—ZJNU Algorithm Centre for Brain-inspired Intelligence, Fudan University, Shanghai Key Lab of Intelligent Information Processing, and Technology Innovation Center of Calligraphy and Painting Digital Generation, Ministry of Culture and Tourism, China. Email: yanweifu@fudan.edu.cn" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.313, + 0.323, + 0.329 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.34, + 0.785, + 0.38 + ], + "angle": 0, + "content": "1. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.382, + 0.785, + 0.407 + ], + "angle": 0, + "content": "2. Cao, C., Ren, X., Fu, Y.: Mvsformer: Multi-view stereo by learning robust image features and temperature-based depth. Transactions of Machine Learning Research" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.409, + 0.785, + 0.448 + ], + "angle": 0, + "content": "3. Chen, D., Zhang, P., Feldmann, I., Schreer, O., Eisert, P.: Recovering fine details for neural implicit surface reconstruction. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4330-4339 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.449, + 0.785, + 0.488 + ], + "angle": 0, + "content": "4. Chu, X., Tian, Z., Wang, Y., Zhang, B., Ren, H., Wei, X., Xia, H., Shen, C.: Twins: Revisiting the design of spatial attention in vision transformers. Advances in Neural Information Processing Systems 34, 9355-9366 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.489, + 0.785, + 0.529 + ], + "angle": 0, + "content": "5. Dai, Y., Zhu, Z., Rao, Z., Li, B.: Mvs2: Deep unsupervised multi-view stereo with multi-view symmetry. In: 2019 International Conference on 3D Vision (3DV). pp. 1-8. IEEE (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.53, + 0.785, + 0.583 + ], + "angle": 0, + "content": "6. Darmon, F., Bascle, B., Devaux, J.C., Monasse, P., Aubry, M.: Improving neural implicit surfaces geometrym fan with patch warping. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6260-6269 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.584, + 0.785, + 0.624 + ], + "angle": 0, + "content": "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.625, + 0.785, + 0.651 + ], + "angle": 0, + "content": "8. Drebin, R.A., Carpenter, L., Hanrahan, P.: Volume rendering. ACM Siggraph Computer Graphics 22(4), 65-74 (1988)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.652, + 0.785, + 0.691 + ], + "angle": 0, + "content": "9. Fu, Q., Xu, Q., Ong, Y.S., Tao, W.: Geo-neus: geometry-consistent neural implicit surfaces learning for multi-view reconstruction. arXiv preprint arXiv:2205.15848 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.692, + 0.785, + 0.732 + ], + "angle": 0, + "content": "10. Galliani, S., Lasinger, K., Schindler, K.: Massively parallel multiview stereopsis by surface normal diffusion. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 873-881 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.733, + 0.785, + 0.758 + ], + "angle": 0, + "content": "11. Gao, P., Ma, T., Li, H., Dai, J., Qiao, Y.: Convmae: Masked convolution meets masked autoencoders. arXiv preprint arXiv:2205.03892 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.759, + 0.785, + 0.785 + ], + "angle": 0, + "content": "12. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. arXiv preprint arXiv:2002.10099 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.786, + 0.785, + 0.84 + ], + "angle": 0, + "content": "13. Gu, X., Fan, Z., Zhu, S., Dai, Z., Tan, F., Tan, P.: Cascade cost volume for high-resolution multi-view stereo and stereo matching. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.34, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.36, + 0.127 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "14. Guo, H., Peng, S., Lin, H., Wang, Q., Zhang, G., Bao, H., Zhou, X.: Neural 3d scene reconstruction with the manhattan-world assumption. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5511-5520 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.203, + 0.787, + 0.244 + ], + "angle": 0, + "content": "15. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.244, + 0.787, + 0.284 + ], + "angle": 0, + "content": "16. Jensen, R., Dahl, A., Vogiatzis, G., Tola, E., Aanæs, H.: Large scale multi-view stereopsis evaluation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 406-413 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.284, + 0.787, + 0.311 + ], + "angle": 0, + "content": "17. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.311, + 0.787, + 0.352 + ], + "angle": 0, + "content": "18. Khot, T., Agrawal, S., Tulsiani, S., Mertz, C., Lucey, S., Hebert, M.: Learning unsupervised multi-view stereopsis via robust photometric consistency. arXiv preprint arXiv:1905.02706 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.352, + 0.787, + 0.392 + ], + "angle": 0, + "content": "19. Kim, D., Ka, W., Ahn, P., Joo, D., Chun, S., Kim, J.: Global-local path networks for monocular depth estimation with vertical cutdepth. arXiv preprint arXiv:2201.07436 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.392, + 0.787, + 0.433 + ], + "angle": 0, + "content": "20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.433, + 0.787, + 0.473 + ], + "angle": 0, + "content": "21. Labatut, P., Pons, J.P., Keriven, R.: Efficient multi-view reconstruction of large-scale scenes using interest points, delaunay triangulation and graph cuts. In: 2007 IEEE 11th international conference on computer vision. pp. 1-8. IEEE (2007)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.473, + 0.787, + 0.528 + ], + "angle": 0, + "content": "22. Li, Z., Müller, T., Evans, A., Taylor, R.H., Unberath, M., Liu, M.Y., Lin, C.H.: Neuralangelo: High-fidelity neural surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8456-8465 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.528, + 0.787, + 0.569 + ], + "angle": 0, + "content": "23. Li, Z., Snavely, N.: Megadepth: Learning single-view depth prediction from internet photos. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2041-2050 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.569, + 0.787, + 0.609 + ], + "angle": 0, + "content": "24. Lipson, L., Teed, Z., Deng, J.: Raft-stereo: Multilevel recurrent field transforms for stereo matching. In: 2021 International Conference on 3D Vision (3DV). pp. 218-227. IEEE (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.609, + 0.787, + 0.663 + ], + "angle": 0, + "content": "25. Liu, S., Zhang, Y., Peng, S., Shi, B., Pollefeys, M., Cui, Z.: Dist: Rendering deep implicit signed distance function with differentiable sphere tracing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2019-2028 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.663, + 0.787, + 0.704 + ], + "angle": 0, + "content": "26. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.704, + 0.787, + 0.759 + ], + "angle": 0, + "content": "27. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4460-4470 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.787, + 0.8 + ], + "angle": 0, + "content": "28. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.787, + 0.84 + ], + "angle": 0, + "content": "29. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.316, + 0.115, + 0.728, + 0.129 + ], + "angle": 0, + "content": "Improving Neural Surface Reconstruction with Feature Priors" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "30. Mur-Artal, R., Tardós, J.D.: Orb-slam2: An open-source slam system for monoc- \ncular, stereo, and rgb-d cameras. IEEE transactions on robotics 33(5), 1255-1262 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.191, + 0.787, + 0.245 + ], + "angle": 0, + "content": "31. Niemeyer, M., Mescheder, L., Oechsle, M., Geiger, A.: Differentiable volumetric rendering: Learning implicit 3d representations without 3d supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3504-3515 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.247, + 0.787, + 0.288 + ], + "angle": 0, + "content": "32. Oechsle, M., Peng, S., Geiger, A.: Unisurf: Unifying neural implicit surfaces and radiance fields for multi-view reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5589-5599 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.29, + 0.787, + 0.344 + ], + "angle": 0, + "content": "33. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE transactions on pattern analysis and machine intelligence 44(3), 1623-1637 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.346, + 0.787, + 0.387 + ], + "angle": 0, + "content": "34. Schonberger, J.L., Frahm, J.M.: Structure-from-motion revisited. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4104-4113 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.388, + 0.787, + 0.443 + ], + "angle": 0, + "content": "35. Schonberger, J.L., Zheng, E., Frahm, J.M., Pollefeys, M.: Pixelwise view selection for unstructured multi-view stereo. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 501-518. Springer (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.445, + 0.787, + 0.499 + ], + "angle": 0, + "content": "36. Strecha, C., Von Hansen, W., Van Gool, L., Fua, P., Thoennessen, U.: On benchmarking camera calibration and multi-view stereo for high resolution imagery. In: 2008 IEEE conference on computer vision and pattern recognition. pp. 1-8. IEEE (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.501, + 0.787, + 0.542 + ], + "angle": 0, + "content": "37. Sun, C., Sun, M., Chen, H.T.: Direct voxel grid optimization: Super-fast convergence for radiance fields reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5459-5469 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.543, + 0.787, + 0.571 + ], + "angle": 0, + "content": "38. Tang, S., Zhang, J., Zhu, S., Tan, P.: Quadtree attention for vision transformers. ICLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.572, + 0.787, + 0.599 + ], + "angle": 0, + "content": "39. Teed, Z., Deng, J.: Deepv2d: Video to depth with differentiable structure from motion. arXiv preprint arXiv:1812.04605 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.601, + 0.787, + 0.641 + ], + "angle": 0, + "content": "40. Vijayanarasimhan, S., Ricco, S., Schmid, C., Sukthankar, R., Fragkiadaki, K.: Sfnet: Learning of structure and motion from video. arXiv preprint arXiv:1704.07804 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.787, + 0.671 + ], + "angle": 0, + "content": "41. Wang, J., Bleja, T., Agapito, L.: Go-surf: Neural feature grid optimization for fast, high-fidelity rgb-d surface reconstruction. arXiv preprint arXiv:2206.14735 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.672, + 0.787, + 0.712 + ], + "angle": 0, + "content": "42. Wang, P., Liu, L., Liu, Y., Theobalt, C., Komura, T., Wang, W.: Neus: Learning neural implicit surfaces by volume rendering for multi-view reconstruction. arXiv preprint arXiv:2106.10689 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.714, + 0.787, + 0.755 + ], + "angle": 0, + "content": "43. Wang, Y., Skorokhodov, I., Wonka, P.: Hf-neus: Improved surface reconstruction using high-frequency details. Advances in Neural Information Processing Systems 35, 1966-1978 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.757, + 0.787, + 0.797 + ], + "angle": 0, + "content": "44. Wang, Y., Skorokhodov, I., Wonka, P.: Pet-neus: Positional encoding tri-planes for neural surfaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12598-12607 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "45. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "X. Ren et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "46. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: Croco: Self-supervised pre-training for 3d vision tasks by cross-view completion. arXiv preprint arXiv:2210.10716 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.231 + ], + "angle": 0, + "content": "47. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. Advances in Neural Information Processing Systems 34, 12077-12090 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.231, + 0.787, + 0.259 + ], + "angle": 0, + "content": "48. Xu, G., Wang, X., Ding, X., Yang, X.: Iterative geometry encoding volume for stereo matching. arXiv preprint arXiv:2303.06615 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.259, + 0.787, + 0.3 + ], + "angle": 0, + "content": "49. Xu, Q., Wang, W., Ceylan, D., Mech, R., Neumann, U.: Disn: Deep implicit surface network for high-quality single-view 3d reconstruction. Advances in neural information processing systems 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.787, + 0.342 + ], + "angle": 0, + "content": "50. Yang, Z., Wang, P., Xu, W., Zhao, L., Nevatia, R.: Unsupervised learning of geometry from videos with edge-aware depth-normal consistency. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 32 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.342, + 0.787, + 0.37 + ], + "angle": 0, + "content": "51. Yariv, L., Gu, J., Kasten, Y., Lipman, Y.: Volume rendering of neural implicit surfaces. Advances in Neural Information Processing Systems 34, 4805-4815 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.37, + 0.787, + 0.411 + ], + "angle": 0, + "content": "52. Yariv, L., Kasten, Y., Moran, D., Galun, M., Atzmon, M., Ronen, B., Lipman, Y.: Multiview neural surface reconstruction by disentangling geometry and appearance. Advances in Neural Information Processing Systems 33, 2492-2502 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.411, + 0.787, + 0.453 + ], + "angle": 0, + "content": "53. Yi, X., Zhou, Y., Habermann, M., Golyanik, V., Pan, S., Theobalt, C., Xu, F.: Ecolocate: Real-time motion capture, localization, and mapping with sparse body-mounted sensors. arXiv preprint arXiv:2305.01599 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.787, + 0.494 + ], + "angle": 0, + "content": "54. Yu, Z., Peng, S., Niemeyer, M., Sattler, T., Geiger, A.: Monosdf: Exploring monocular geometric cues for neural implicit surface reconstruction. arXiv preprint arXiv:2206.00665 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.494, + 0.787, + 0.522 + ], + "angle": 0, + "content": "55. Zhang, J., Yao, Y., Li, S., Luo, Z., Fang, T.: Visibility-aware multi-view stereo network. arXiv preprint arXiv:2008.07928 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.787, + 0.564 + ], + "angle": 0, + "content": "56. Zhang, J., Yao, Y., Quan, L.: Learning signed distance field for multi-view surface reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6525-6534 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.787, + 0.62 + ], + "angle": 0, + "content": "57. Zhang, K., Luan, F., Wang, Q., Bala, K., Snavely, N.: Physg: Inverse rendering with spherical gaussians for physics-based material editing and relighting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5453-5462 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.62 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_origin.pdf b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ea542075e130227cdea1a8c63e8bea47f3e8bdc2 --- /dev/null +++ b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/ac44814b-3daa-415a-bab2-3a060356d9f3_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3bfc3657b63908fecddbc6e0a5f0512d994e266cfcfb0d96b36c32c6bb724b29 +size 7393942 diff --git a/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/full.md b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/full.md new file mode 100644 index 0000000000000000000000000000000000000000..eb73551010067869029fc70d775553258c6e74db --- /dev/null +++ b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/full.md @@ -0,0 +1,317 @@ +# Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images + +Xinlin Ren $^{1*}$ , Chenjie Cao $^{1,2*}$ , Yanwei Fu $^{1\dagger}$ , and Xiangyang Xue $^{1}$ + +$^{1}$ Fudan University + $^{2}$ Alibaba Group, DAMO Academy +{xlren20,cjcao20,yanweifu,xyxue}@fudan.edu.cn + +Abstract. Recent advancements in Neural Surface Reconstruction (NSR) have significantly improved multi-view reconstruction when coupled with volume rendering. However, relying solely on photometric consistency in image space falls short of addressing complexities posed by real-world data, including occlusions and non-Lambertian surfaces. To tackle these challenges, we propose an investigation into feature-level consistent loss, aiming to harness valuable feature priors from diverse pretext visual tasks and overcome current limitations. It is crucial to note the existing gap in determining the most effective pretext visual task for enhancing NSR. In this study, we comprehensively explore multi-view feature priors from seven pretext visual tasks, comprising thirteen methods. Our main goal is to strengthen NSR training by considering a wide range of possibilities. Additionally, we examine the impact of varying feature resolutions and evaluate both pixel-wise and patch-wise consistent losses, providing insights into effective strategies for improving NSR performance. By incorporating pre-trained representations from MVSFormer [2] and QuadTree [38], our approach can generate variations of MVS-NeuS and Match-NeuS, respectively. Our results, analyzed on DTU and EPFL datasets, reveal that feature priors from image matching and multi-view stereo outperform other pretext tasks. Moreover, we discover that extending patch-wise photometric consistency to the feature level surpasses the performance of pixel-wise approaches. These findings underscore the effectiveness of these techniques in enhancing NSR outcomes. Codes and models are available at https://github.com/maybeLx/MVS_NeuS. + +Keywords: Feature Priors $\cdot$ Neural Surface Reconstruction + +# 1 Introduction + +Reconstructing surface from multi-view images is a crucial task in 3D computer vision. Traditionally, this task is addressed using a pipeline that includes depth prediction, point cloud reconstruction, and maximizing point consistency for surface mesh [1,17,21,35]. Unfortunately, these traditional methods often result in + +![](images/6e8dd36dab400e4252f8a6f0f796c2772b9ffdd9beb4a21895434b1266c097ea.jpg) +(a) + +![](images/d8a00c901c89d62981699dc5fccc63a226219e00c95e8f9b26ad0f94579b0c3d.jpg) +(b) +Fig. 1: (a) Pixel-wise similarity for RGB images: MVS features [2] and matching features [38] on non-Lambertian surfaces. (b) Multi-view consistency of feature priors: Given a ray direction, the geometry network can extract surface points, which are used to project and align source features to the reference view for optimizing patch-wise photometric consistency loss. + +visual errors due to the complexity of these procedures. In contrast, recent approaches opt to represent the surface through volume rendering, inspired by the Neural Radiance Fields (NeRF) [28], thereby avoiding the accumulation of errors seen in the traditional pipeline. Notably, Neural Surface Reconstruction (NSR) has made significant strides in multi-view reconstruction, leveraging techniques such as Signed Distance Functions (SDF) [42, 51] and occupancy [31] combined with volume rendering. However, despite these advancements, these sophisticated methods still grapple with fundamental challenges in surface reconstruction, including maintaining geometric consistency across different views. This challenge becomes particularly pronounced when dealing with non-Lambertian surfaces and occlusions [6, 9], as illustrated in Fig. 1a. + +To tackle these challenges, earlier studies [6, 9] have delved into optimizing patch-wise warping losses in image space, employing metrics such as Structural Similarity (SSIM) [45] or Normalized Cross-Correlation (NCC) [10]. In an effort to enhance the robustness of geometric consistency in real-world scenarios, Chen et al. [3] utilized features extracted from a learning-based Multi-View Stereo (MVS) model [55] to compute pixel-wise feature similarity. Despite promising results with MVS features, it remains unclear whether the neural surface reconstruction can benefit from other pretext tasks and what key factors contribute to improved reconstruction. Furthermore, it is worth investigating whether these features can also benefit from patch-wise photometric consistency. + +This study aims to address these questions by conducting a comprehensive investigation into the impact of diverse pre-trained feature priors obtained from various pretext visual tasks for NSR learning. We thoroughly consider seven distinctly different pretext visual tasks, encompassing 2D supervised [4, 26, 47], 2D self-supervised [11, 15, 46], and 3D supervised [2, 13, 19, 24, 33, 38, 48] approaches. The pre-trained models from these tasks can serve as feature extractors for our NSR task. Crucially, we not only compare various architectures used in these models, ranging from Convolution Neural Networks (CNNs) [13, 24, 26, 48] to Vision Transformers (ViTs) [2, 15, 46, 47], but also explore feature maps from dif + +ferent layers within the same model to identify common factors relevant to NSR. Furthermore, we propose for extending patch-wise photometric consistency to the feature level, resulting in substantial improvements. + +Formally, our approach enhances NSR by integrating various feature priors derived from multi-view images. Building upon the robust foundation of NeuS [42], which acts as the baseline method in this paper, we further improve NSR by introducing feature-level consistent loss from diverse pre-trained models, as depicted in Fig. 1b. Specifically, we compare 13 pre-trained models across 7 distinct pretext tasks, as listed in Tab. 1. To the best of our knowledge, this evaluation represents the most comprehensive assessment of pretext tasks on NSR to date, encompassing masked image modeling [11, 15, 46], image classification [4, 26], semantic segmentation [47], monocular depth estimation [19, 33], stereo matching [24, 48], image matching [38], and MVS [2, 13]. The DTU and EPFL datasets serve as the benchmark for evaluation [16]. + +Notably and interestingly, our empirical findings reveal that models pretrained on MVS and image matching tasks consistently outperform others significantly. This success is attributed to the feature similarity supervision provided by depth annotation [16] for MVS and Structure from Motion (SfM) [23] for image matching. Moreover, these tasks yield high-resolution features, emerging as another crucial factor contributing to the superior performance of NSR models. + +Furthermore, we observe that 3D-CNN regularization, designed to denoise the 3D cost volume [2, 13, 48], impedes effective 2D feature learning. Consequently, utilizing features from pre-trained models of image matching tasks without 3D cost volume regularization achieves the best performance and generalization in NSR. Moreover, in our experiments on the EPFL dataset [36], we make an intriguing observation that patch-wise photometric consistency can be effectively generalized to the feature level, resulting in remarkable improvements. Thus, bolstered by patch-wise photometric consistency losses from pre-trained models in both MVSFormer [2] and QuadTree [38] our approach can produce variations of MVS-NeuS and Match-NeuS. These variations demonstrate state-of-the-art performance on the DTU and EPFL datasets, respectively. Additionally, we take a further exploration of the feature priors on grid-based methods such as Neuralangelo [22], where feature priors still enjoy promising benefits. Thus our method could be extended to different neural representations (MLP or grid-based methods). Our contributions can be highlighted as follows: + +1) We are the first to conduct a comprehensive evaluation of prior features derived from various pretext tasks on NSR. Additionally, we delve into a detailed comparison of pixel-wise feature consistent loss across these approaches. This comprehensive analysis advances our understanding of the effect of different feature priors for NSR. +2) Our research brings to light a significant finding: models pre-trained on image matching and MVS tasks consistently outperform others in the realm of NSR. This superior performance is attributed to the advantages gained from feature-similarity related pretext training and the utilization of high-resolution + +Table 1: A summary of models from various pretext tasks including MIM (masked image modeling), IC (image classification), MDE (monocular depth estimation), SM (stereo matching), SS (semantic segmentation), IM (image matching), and MVS. Only the feature dimensions and resolutions of the highest and lowest features are shown. (Res: Resolution, Dim: Dimension) + +
TaskModelArchitectFeature ResFeature Dim
MIMMAE [15]ViT1/161024
CovMAE [11]ViT+CNN1/16,1/4768,256
CroCo [46]ViT1/16768
ICTwins [4]ViT1/32, 1/41024,128
ConvNeXt [26]CNN1/32, 1/42048,256
SSSegFormer [47]ViT1/32, 1/4512,64
MDEGLPN [19]ViT1/32, 1/4512,64
MiDaS [33]ViT1/322048
SMIGEV [48]CNN1/32, 1/4160,96
RAFT-Stereo [24]CNN1/4256
IMQuadTree [38]ViT+CNN1/8,1/2256,128
MVSCascadeMVS [13]CNN1/8,132,8
MVSFormer [2]ViT+CNN1/8,132,8
+ +features. By identifying these key factors, our work contributes valuable insights that can inform future developments in NSR methods. + +3) Another notable contribution of our research lies in the successful extension of the patch-wise photometric consistency loss to the feature level. This innovative approach stands as a significant advancement, leading to improved results regardless of different neural representations (MLP or grid-based methods). By bridging the gap between patch-wise and feature-level considerations, our work reaches the state-of-the-art in NSR. + +# 2 Related Work + +Neural Surfaces Reconstruction (NSR). Surface reconstruction based on deep learning has garnered significant attention due to its expressive representation capabilities. Representative algorithms focus on utilizing implicit representations to encode the geometry and appearance of 3D scenes through neural networks. These representations include occupancy fields [27, 31] and SDF [25, 49, 52, 56, 57]. Since the emergence of volume rendering techniques pioneered by NeRF [28], numerous NSR methods have seen a dramatic rise [3, 6, 9, 14, 32, 42-44, 51, 54]. Notably, VolSDF [51] and NeuS [42] convert volume density to SDF without the need for masks, while UNISURF [32] unifies both surface and volume rendering. Concurrently, grid-based representation methods are gaining attention [22, 29, 37, 41], as they offer faster convergence compared to implicit ones with competitive results. Essentially, note that these explicit NSR methods serve as robust foundations, and our contributions are orthogonal to these approaches. However, it is crucial to highlight that all these existing methods + +![](images/e209a18ddf1681b98aee9ad9758663d6f5ec0f01b1b9afae5ff4637afccedf55.jpg) +Fig. 2: Approach overview. Our method is based on NeuS [42]. After achieving surface points from geometry network $f_{\theta_g}$ , we further apply the multi-view consistent loss based on features from pre-trained models to improve the reconstruction quality. + +overlook the importance of multi-view consistency during surface reconstruction. This gap forms the basis for our unique contributions in addressing this aspect. + +Photometric Consistency. Many previous studies have delved into the application of photometric consistency across various 3D reconstruction tasks [5, 18, 30, 34, 39, 40, 50, 53]. For SfM, several researches aim to optimize camera poses by minimizing photometric errors between corresponding pixels in different images [34, 39, 40]. Similarly, various self-supervised MVS methods [5, 18, 50] leverage consistent loss to supervise depth prediction. Moreover, in Simultaneous Localization and Mapping (SLAM), photometric consistency plays a crucial role. By comparing the appearance of projected 3D points in the image with the actual observed images, photometric consistency can detect potential errors or inaccuracies in geometry [30, 53]. + +Photometric Consistency in NSR. Prior works [6,9,14] have incorporated patch-wise photometric consistency directly computed from raw images or pixelwise feature similarity to enhance NSR training. NeuralWarp [14] introduces a patch-wise warping loss along with a visibility map that masks incorrect warps arising from occlusion. Similarly, GeoNeus [9] and D-NeuS [6] focus on locating the zero-level set of geometry network to enforce multi-view geometry constraints, resulting in more accurate reconstruction outcomes. Despite these advancements, none of these methods thoroughly explore the distinctions between patch-wise and pixel-wise consistent loss, nor do they investigate the potential benefits of incorporating prior features from other pretext visual tasks as opposed to using raw images. + +# 3 NSR based on Feature Priors + +Overview. Given a set of posed multi-view images, the goal of NSR is to reconstruct high-quality surfaces by neural volume rendering, as illustrated in Fig. 2. We revisit the NeuS baseline [42] for multi-view consistency zero-crossing points. + +We briefly introduce pretext tasks in Sec. 3.1 and discuss consistent loss in both pixel-wise and patch-wise terms in Sec. 3.2. By utilizing pre-trained representations from MVS and image matching pretext tasks, we have MVS-NeuS and Match-NeuS, which are compared in the experiments. + +NeuS [42] proposes a novel scheme to achieve unbiased reconstructed surfaces in the first-order approximation of SDF. In this scheme, a ray $\{p(t) = o + tv|t > 0\}$ is emitted from a camera center at $o$ with view direction $v$ . Colors $\hat{C}(r)$ along a ray can be accumulated by volume rendering [8], which is approximated by $N$ discretely sampled points as follows: + +$$ +\hat {C} (r) = \sum_ {i = 1} ^ {N} T _ {i} \alpha_ {i} c _ {i}, \quad T _ {i} = \prod_ {j = 1} ^ {i - 1} \left(1 - \alpha_ {j}\right), \tag {1} +$$ + +where $\alpha_{i}$ and $T_{i}$ are the opacity and accumulated transmittance along the ray respectively. To achieve the unbiased surface, we can compute $\alpha_{i}$ by: + +$$ +\alpha_ {i} = \max \left(\frac {\Phi_ {s} (s d f (p _ {i})) - \Phi_ {s} (s d f (p _ {i + 1}))}{\Phi_ {s} (s d f (p _ {i}))}, 0\right), \tag {2} +$$ + +where $sdf(\cdot)$ is the SDF function modeled by the geometry network $f_{\theta_g}$ . $\varPhi_s(\cdot)$ is the sigmoid function and $s$ is a learnable parameter. + +Differentiable Zero-Crossing Points. Since achieving photometric consistency involves warping patches or pixels based on a specific depth, we define the depth planes through zero-crossing points achieved from the zero-level set of SDF function as [3, 6]. So it is crucial to apply photometric consistency specifically to the zero-crossing points of geometry network $f_{\theta_g}$ , as shown in Fig. 3. We only require the first set of zero-crossing points $T^*$ which is visible from the corresponding view. It can be expressed as: + +$$ +T ^ {*} = \left\{t \mid t = \frac {s d f \left(p _ {t _ {i}}\right) t _ {i + 1} - s d f \left(p _ {t _ {i + 1}}\right) t _ {i}}{s d f \left(p _ {t _ {i}}\right) - s d f \left(p _ {t _ {i + 1}}\right)}, t _ {i} \in T \right\}, \tag {3} +$$ + +$$ +T = \underset {i} {\arg \min } \left\{t _ {i} | s d f \left(p _ {t _ {i}}\right) \cdot s d f \left(p _ {t _ {t + 1}}\right)) < 0 \right\}. \tag {4} +$$ + +![](images/91980f2eb3abe61184f57a25cf7d327831127e1e730b0c95e43a5797f38bf15c.jpg) +Reference Image +Depth of Zero-Crossing Points + +![](images/9611627002db96db70cc172d2bc878f4193e586e124ab41a6bbbfef49363c7b4.jpg) +Fig. 3: Two different ways to locate surface points during the network training at 5000 iterations. Compared with volume rendering, it is more accurate to find the surface points via Eq. 3. Accurate surface points are crucial for applying consistent loss. + +![](images/bcc42edf56195d6e34e738980c4e37986af7a1c179124dd1ef6cdabc8d7ef5b6.jpg) +Depth from Volume Rendering + +# 3.1 Predtext Tasks + +Various models in different pretext visual tasks have been explored as shown in Tab. 1. Our emphasis is specifically on the features obtained from the feature encoder modules of these pre-trained models. Importantly, many of these models include multi-scale feature maps. In this context, our focus is on the most representative features at both the highest and lowest scales, encompassing high-level semantic understanding and fine-grained low-level details, respectively. + +Masked Image Modeling (MIM) has been widely investigated recently, as an effective self-supervised task [15]. MIM randomly masks input images at a relatively high rate and subsequently predicts the masked regions based on the context of unmasked areas. MIM has gained significant attention recently, with several pioneering works demonstrating its effectiveness in various downstream tasks [11, 15, 46]. In contrast to other self-supervised tasks, MIM exhibits favorable fine-grained feature correlations that can potentially benefit NSR learning. + +Image Classification (IC) is a well-established supervised task known for extracting discriminative features. In this paper, we investigate models built on CNNs [26] and ViTs [4] that are pre-trained for image classification on ImageNet [7]. These models serve as baselines, helping us answer the question of whether engaging in such a classic pretext task also enhances the NSR. + +Semantic Segmentation (SS). Models like [20, 47] have demonstrated outstanding performance in semantic segmentation by training on large-scale datasets. Unlike classification tasks, these models can capture more detailed, class-specific features, which holds the potential to enhance NSR training. + +Monocular Depth Estimation (MDE) aims to predict the depth map of a scene using a single input view, essentially creating a 2D representation of a 3D scene. Several successful works [19, 33] have demonstrated the ability to recover fine details of the scene in this process. + +Stereo Matching (SM) is the process of identifying corresponding pixels between two rectified images along epipolar lines, ultimately determining the disparity between these corresponding points. Noteworthy approaches like IGEV [48] and RAFT-Stereo [24] have demonstrated promising results in this task. The learning involved in establishing correspondences bears some similarities to the learning of consistent loss in NSR. + +Multi-View Stereo (MVS) differs from stereo matching in that it involves multiple input views with known camera poses. However, the MVS problem often faces challenges such as occlusions and varying light conditions. Consequently, MVS methods like CasMVSNet [13] and MVSFormer [52] need to enhance feature learning to accurately identify corresponding pixels along epipolar lines. It's worth noting that MVS methods may encounter data bias, as discussed in Sec. 4.2, particularly on the DTU dataset [16]. + +Image Matching (IM). In comparison to stereo matching and MVS, image matching tackles a more intractable problem, i.e., detecting fine-grained matching pairs between two images without assistance from known camera poses. To solve this challenge, Tand et al. [38] utilize a transformer with a lightweight QuadTree attention mechanism to capture long-range dependencies. Despite + +working without constraints from camera poses, we observe that image matching methods can still achieve effective feature representation. + +# 3.2 Feature-Level Photometric Consistency + +To leverage the consistency of geometry across different views, we utilize the features $\mathbf{F}_r$ and $\mathbf{F}_s$ extracted from the reference and source images through various pre-trained models respectively. Photometric consistency can be applied to these multi-view features to enforce their alignment and coherence. Specifically, from the reference viewpoint, we locate a surface point $p$ derived from Eq. 3 with its 2D projection coordinate denoted as $x$ . This 2D point is then associated with the corresponding point $x'$ in the source images through the homography $H$ : + +$$ +x ^ {\prime} = H x, \quad n ^ {T} p + d = 0, \tag {5} +$$ + +$$ +H = K _ {s} R _ {s} \left(I - \frac {\left(R _ {s} ^ {- 1} t _ {s} - R _ {r} ^ {- 1} t _ {r}\right) n ^ {T} R _ {r}}{d}\right) R _ {r} ^ {- 1} K _ {r} ^ {- 1}, \tag {6} +$$ + +where $K_{s}$ and $K_{r}$ denote the internal calibration matrix of source and reference cameras, $(R_{s}, R_{r})$ and $(t_{s}, t_{r})$ are the $3 \times 3$ rotation matrix, and 3D translation vector of two views, respectively. $n$ denotes the surface normal, which can be computed by automatic differentiation of the geometry network at each point $p$ . Additionally, $I$ represents the identity matrix and $d$ is the distance from the camera center to the plane of the zero-crossing point (Eq. 3). + +Pixel Warping. To compute the pixel-level consistency loss, we can evaluate the feature difference between the pixel $x$ in the reference view and its corresponding pixel $x'$ in the source views: + +$$ +\mathcal {L} _ {\text {p i x e l}} = D _ {\text {p i x e l}} \left(\mathbf {F} _ {r} (x), \mathbf {F} _ {s} \left(x ^ {\prime}\right)\right), \tag {7} +$$ + +where $D_{pixel}$ is the cosine similarity function to measure the feature similarity in pixel-wise. + +Patch Warping. To more effectively incorporate local feature information, we can broaden the concept of pixel warping to patch warping. To define a small patch $s$ on the surface, traditionally we would compute the surface points using Eq. 3 and sample numerous points around those surface points to construct the patch. However, this is computationally expensive. As an alternative, we use the central point $\hat{s}$ of the patch $s$ to represent it and derive the homography matrix $H$ . We can perform patch warping from the source view to the reference view and measure the difference between them. The patch-wise consistent loss is + +$$ +\mathcal {L} _ {p a t c h} = D _ {p a t c h} \left(\mathbf {F} _ {r} (\hat {s}), \mathbf {F} _ {s} \left(\hat {s} ^ {\prime}\right)\right), \tag {8} +$$ + +where $\hat{s}$ , $\hat{s}^{\prime}$ denote the centers of reference view patches and projected source view patches respectively. $D_{patch}$ can be represented as NCC [10], SSIM [45], or patch similarity which measures the average of similarity between corresponding elements in the two patches. Since grid-based manners [22] can also locate the + +surface points via Eq. 3, we easily extend our method to the grid-based methods in Sec. 4.3. More detailed formulas will be explained in the supplementary. + +About Occlusion. Although we can utilize photometric consistency to supervise the geometry network and encourage accurate surface learning, it's important to note that not all surface points are visible in source view images. Choosing unsuitable source images would cause prominent degradation to the reconstruction. To address this issue, we employ a simple yet effective strategy called Top-k view selection. Specifically, we sort and select 10 source views based on their relative angles from small to large to the reference perspective. Subsequently, we choose Top-k views to compute the patch-wise consistent loss according to the best k photometric scores. We empirically set k to 4 with proper generalization for most scenes. However, we have observed that this strategy does not provide significant benefits to pixel-wise consistency due to the incomplete local feature information which results in unstable view selection during training (Sec. 4.2). + +Training Loss. To render colors from a specific view, the overall loss function is defined as: + +$$ +\mathcal {L} = \mathcal {L} _ {\text {c o l o r}} + \lambda_ {1} \cdot \mathcal {L} _ {\text {e i k}} + \lambda_ {2} \cdot \mathcal {L} _ {\text {f e a t}}, \tag {9} +$$ + +where $\mathcal{L}_{color} = \sum_{r\in \mathcal{R}}\| \hat{C} (\mathbf{r}) - C(\mathbf{r})\| _1$ is the $\ell_1$ loss from minibatch of rays $\mathcal{R}$ . $\mathcal{L}_{eik}$ is the eikonal loss defined in [12] to regularize the SDF values predicted by the geometry network $f_{\theta_a}$ as depicted in Fig. 2. + +We use feature loss, denoted as $\mathcal{L}_{\text {feat }}$ , and it is implemented as $\mathcal{L}_{\text {patch }}$ . Additionally, in Sec. 4.1, we apply the feature loss as $\mathcal{L}_{\text {pixel }}$ to assess the features of pre-trained models derived from different pretext tasks. Our results demonstrate that $\mathcal{L}_{\text {patch }}$ exhibits greater robustness compared to $\mathcal{L}_{\text {pixel }}$ , emphasizing the effectiveness of our patch warping loss. During the training stage, we set $\lambda_{1}$ and $\lambda_{2}$ as 0.1 and 0.5, respectively. + +Discussion. While NeuralWarp [14] has introduced a patching-based warping method to transform source view patches to the reference view, it posits that every sampled point along the ray could be projected to other views to obtain the warped colors, leading to the final warped colors through volume rendering. In contrast, our approach prioritizes the surface points, offering a more accurate and reasonable method that does not depend on visible maps. Furthermore, we extend the patch warping from RGB pixel-level to feature-level, significantly improving the overall quality of reconstruction. + +# 4 Experiments + +Datasets. The DTU dataset tested in NSR comprises 15 scenes with 49 or 64 multi-view images collected in an indoor environment with fixed camera poses following [52]. The Chamfer Distance (CD) is utilized to evaluate the performance of reconstructed results on the DTU. We also test two outdoor scenes in EPFL dataset [36], which has 7 and 11 images at a resolution of $2048 \times 3072$ , and one of the scenes is particularly challenging due to the occlusions caused by limited viewpoints. + +Implementation Details. We use the same architecture as [42]. During the training, 512 rays are sampled for each batch following the hierarchical sampling strategy in NeuS [42]. The learning rate is linearly warmed up from 0 to 5e-3 in the first 5k steps and then decayed to 2.5e-5 with a cosine schedule. For each scene, we train the network for 300k steps costing 10 hours on a single A6000. + +# 4.1 Experiments for Different Pretext Tasks + +Settings. We evaluate the effect of various pretext tasks in Tab. 1 by applying pixel similarity as the consistency loss on a subset of the DTU dataset including Scan24, Scan37, and Scan106. These objects are relatively challenging due to difficult lighting conditions and occlusions. Because of the quadratic memory footprint of ViT in high-resolution features, we downsample all images into $512 \times 768$ for a fair comparison. We only consider the highest and lowest features from the feature encoder as mentioned in Sec. 3.1. More experiments on multi-scale features are presented in the supplementary. + +![](images/4c26786de16fcdbe20f7deec71e70da191fe692608e6e292aa9143eaf4c32543.jpg) +(a) + +![](images/8047e110c0120ce9d40b5b05dfe4b57fef989fb6a00dc674c34c39d7fdb77fa8.jpg) +(b) +Fig. 4: Quantitative results of using prior features from different pretext tasks for two scenarios: (a) with the lowest resolution features (high-level features), and (b) with the highest resolution features (low-level features). The red lines indicate the performance of NeuS, with lower values indicating better performance in terms of Chamfer Distance. High-resolution features generally outperform the low-resolution ones. + +In-depth Discussions. As depicted in Fig. 4, when employing low-resolution features for the same model, the performance is noticeably worse compared to using high-resolution features. This is because projecting surface points onto low-resolution feature maps does not yield fine-grained effective features, thus hindering the geometry network from accurately learning the correct geometry. Furthermore, models optimized with high-resolution features from MIM, image classification, semantic segmentation, and monocular depth estimation only perform slightly better than the baseline NeuS [42]. For classification [4,26] and segmentation [47], we think that these pretext tasks focus on high-level semantic information that is not suitable for NSR. For MIM [11,15,46], the most concern is that the effective feature correlations are not fine-grained enough, which limits the performance. For the depth estimation task [19,33], we think that it shares little connection with NSR learning. + +In contrast, models being optimized with feature priors from stereo matching, image matching, and MVS achieve good performance. These tasks share an + +Table 2: Quantitative results of CD (mm) on the EPFL dataset with different consistent losses. (Fou: Fountain, Her: Herzjesu) + +
ModelPre-TrainedConsistent LossFouHerMean
Match-NeuSQuadTree [38]Pixel Similarity1.2881.8321.560
Patch Similarity1.3881.7221.555
Patch NCC1.2061.6221.414
Patch SSIM1.2181.6781.448
MVS-NeuSMVSFormer [2]Pixel Similarity1.1991.6981.449
Patch Similarity1.2121.6891.451
Patch NCC1.2421.6461.444
Patch SSIM1.2611.7061.484
NeuralWarp [42]/Patch SSIM1.922.031.97
NeuS [42]//1.7415.6133.677
+ +important common factor, i.e., matching feature similarity across different viewpoints, while the supervision is usually annotated by the depth captured from SfM [23] or specific devices [16]. Thus, low-level and fine-grained feature correlations should be considered in these manners. In general, using feature priors from the same task generally results in a similar performance. However, in the stereo matching task, there is a significant performance gap between IGEV [48] and RAFT-Stereo [24], even though these two models have a similar architecture except for the cost volume regularization. Specifically, IGEV builds the cost volume as a regularization module that encodes and denoises feature conflicts caused by occlusions and non-Lambertian in the image level through 3D CNNs. Although 3D cost volume addresses the issues from the 2D feature encoder, we clarify that it could not help to learn essentially better 2D feature representation. As evidence, features from IGEV achieve inferior performance than RAFT-Stereo, because of the lightweight local cost volume GRU in RAFT-Stereo [24], which releases the capacity of 2D features learned by the feature encoder. From Fig. 4, we observe that QuadTree [38] pre-trained with image matching and MVS methods [2,13] enhanced NeuS achieve much better results compared with others. As mentioned in Tab. 1, models pre-trained on these two tasks enjoy more fine-grained features (1/2 and 1:1). MVS methods are all pre-trained on the DTU dataset [16], while the matching method is pre-trained on the MegaDepth [23]. So MVS manners may suffer from a little data leakage in Fig. 4. To be fair, we further compare the performance of image matching and MVS on EPFL dataset in Sec. 4.2. + +# 4.2 MVS and Image Matching based NSR + +By incorporating features of pre-trained models such as MVSFormer [2] and QuadTree [38], our approach can generate variants of MVS-NeuS and Match-NeuS, respectively. Additionally, the evaluation is conducted on EPFL [36] and includes both pixel-wise and patch-wise losses. + +![](images/0a9918be8320b5aa2b8ea884dd747dc911892e025ed59aec47b0663118e732fa.jpg) +Pixel Similarity + +![](images/f39ec3f0a09749a7c2453e2d0f3b87c5651874582caaef2066066bbff5f4dea0.jpg) +Patch Similarity +Top-K View Selection +Fig. 5: Qualitative results of different source view selecting strategies based on pixel similarity and patch similarity consistent losses in the Herzjesu of EPFL dataset. + +![](images/f999ae6aa5c22dc9577d2f7a8cb637e31e0b89d9356d5d6d962d96005082fe59.jpg) +Pixel Similarity +Nearby View Selection + +![](images/34cc6e61567796fcd0341514db3beb4fae516b7f73774b6052eb5e2a665a1ef2.jpg) +Patch Similarity + +From Tab. 2, we find that the patch-wise NCC and SSIM could be successfully extended to feature level, and achieve better results compared with pixel similarity for Match-NeuS. Additionally, Match-NeuS with patch NCC outperforms MVS-NeuS, despite features from MVSFormer containing larger resolutions. As discussed in Sec. 4.1, the main reason for the better performance of Match-NeuS is that image matching models are pre-trained without the cost volume regularization, because no camera poses could be used to formulate the 3D cost volume. Furthermore, due to the prohibitive computation for the 3D CNN in the cost volume regularization, MVS methods should reduce the 2D feature channels for efficiency. Thus the matching-based QuadTree has 256 feature channels, while MVSformer only contains 8 feature channels with less capacity. In Fig. 6, we show that Match-NeuS with patch NCC recovers more detailed structures in Fountain, while reconstructing smoother walls. + +![](images/81de63365c043b25a92b46f1f473fe02be450721e8a890952e1f282b7381aec0.jpg) +Fig.6: Qualitative comparisons on EPFL dataset. + +Table 3: Ablation study of CD (mm) on matching features w/wo attention modules. We further compare them to the results of high-resolution features $(1 / 2)$ without attention modules. + +
ModelConsistent Loss Res.FountainHerzjesuMean
Match-NeuSPixel Similarity1/21.2881.832
Match-NeuSPixel Similarity1/81.6343.360
+ AttentionPixel Similarity1/81.5023.010
+ +View Selection. We compare the view selection for both pixel-wise and patchwise losses in Fig. 5, From Fig. 5, the Top-k view selection mentioned in Sec. 3.2 fails to adaptively choose reasonable source views through pixel-wise feature similarity, resulting in poor reconstruction. Thus we need to manually select nearby source views to stabilize the training of pixel-wise feature similarity. However, the Top-k view selection based on patch-wise feature similarity can + +achieve stable training and better reconstruction. Because local patches usually capture more information with larger perceptive fields, effectively addressing occlusion issues. + +Features with Attention Modules. We observe that QuadTree employs the interleaved attention mechanism [38] including self and cross-attention modules. Attention modules enable explicit feature matching across different views and enhance the feature capacity. However, due to its high computational cost, the transformer layer is designed to refine only 1/8 feature scale. Hence this improvement fails to be transferred to high-resolution feature learning (1/2). We have presented a comparison in Tab. 3 to showcase this improvement. It is evident that by incorporating the features after attention learning, Match-NeuS improves its performance, but it still performs worse than high-resolution feature learning. + +# 4.3 Extension of Feature Prior on Grid-based Representation. + +![](images/e6a5ef65d8148da556aab6fc2ad06d7be2f7b39c2988c96f21d6be6e058d327a.jpg) +Fig. 7: Qualitative results of Neuralangelo with feature priors. + +We incorporate feature priors into grid-based Neuralangelo [22] as in Fig 7. Specifically, we train Neuralangelo with MVSFormer feature priors on DTU dataset for $300\mathrm{k}$ iterations. The inclusion of MVS features enhances the accuracy of geometry and accelerates convergence, especially in intricate objects like scissors' handles in Scan37 and the snowman in Scan69. Moreover, Neuralangelo with feature priors achieves smoother flat surfaces in Scan40 and Scan63. + +# 4.4 Full Models Compared on DTU + +We compare MVS-NeuS and Match-NeuS with patch NCC as the consistent loss to other competitors on 15 scenes in the DTU dataset. Tab. 4 shows the quantitative results. Notably, our methods outperform other competitors by a large margin. Furthermore, we observed the qualitative results in Fig. 8 that our method can accurately reconstruct the geometry of these scenes. Specifically, our method is capable of not only modeling smooth flat planes but also clearly capturing gaps between two planes or the handle of scissors. In contrast, many other methods tend to fuse together in Scan37 with obvious artifacts. Quantitative results in Tab. 4 show that our model significantly outperforms other competing approaches. + +![](images/792e9a07e724d827f078d24a206e1f42a14a990f286aec4b5fd4defc166f156a.jpg) +Fig. 8: Comparisons of surface reconstruction in DTU dataset. + +Table 4: Results of CD (mm) compared on DTU dataset (lower is better). The upper part methods enjoy additional annotations such as masks (IDR and COLMAP) or custom filtering (MVSDF). Note that the results of GeoNeuS* are re-trained by ourselves, The best results are in bold. + +
Scan243740556365698397105106110114118122Mean
COLMAP [35]0.450.910.370.370.901.000.541.221.080.640.480.590.320.450.430.65
MVSDF [56]0.931.750.880.441.110.900.751.261.021.350.870.840.340.470.470.88
IDR [52]1.631.870.630.481.040.790.771.331.160.760.670.900.420.510.530.90
NeRF [28]1.901.601.850.582.281.271.471.672.051.070.882.531.061.150.961.49
NeuS [42]1.371.210.730.401.200.700.721.011.160.820.661.690.390.490.510.87
VolSDF [51]1.141.260.810.491.250.700.721.291.180.700.661.080.420.610.550.86
NeuralWarp [6]0.490.710.380.380.790.810.821.201.060.680.660.740.410.630.510.68
GeoNeuS* [9]0.400.690.360.370.790.780.481.170.880.600.500.730.300.390.410.59
D-NeuS [3]0.440.790.350.390.880.580.551.350.910.760.400.720.310.390.390.61
PET-NeuS [44]0.560.750.680.360.870.760.691.331.080.660.511.040.340.510.480.71
MVS-NeuS0.370.630.310.320.790.510.501.120.870.620.460.640.290.380.410.548
Match-NeuS0.390.670.320.330.790.510.491.210.870.630.480.710.290.380.410.565
+ +# 5 Conclusion + +In this paper, we conducted an evaluation of various pretext tasks and consistent losses for NSR. Our findings showed that the feature priors from some pretext visual tasks including MVS and image matching can significantly improve the NSR performance. We also empirically observed that features with higher resolution consistently outperform the lower ones. Additionally, we further explored optimizing MVS and image matching enhanced NSR with both pixel-wise and patch-wise consistent losses. The results showed that the patch-wise consistent loss could be successfully generalized to the feature level and achieve superior reconstruction for the matching-based Match-NeuS. + +# Acknowledgements + +This work was supported in part by the National Natural Science Foundation of China under Grant 62076067 and Shanghai Municipal Science and Technology Major Project (NO. 2021SHZDZX0103). This work was performed using the CFFF platform of Fudan University. Yanwei Fu is with School of Data Science, Fudan ISTBI—ZJNU Algorithm Centre for Brain-inspired Intelligence, Fudan University, Shanghai Key Lab of Intelligent Information Processing, and Technology Innovation Center of Calligraphy and Painting Digital Generation, Ministry of Culture and Tourism, China. Email: yanweifu@fudan.edu.cn + +# References + +1. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009) +2. Cao, C., Ren, X., Fu, Y.: Mvsformer: Multi-view stereo by learning robust image features and temperature-based depth. Transactions of Machine Learning Research +3. Chen, D., Zhang, P., Feldmann, I., Schreer, O., Eisert, P.: Recovering fine details for neural implicit surface reconstruction. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4330-4339 (2023) +4. Chu, X., Tian, Z., Wang, Y., Zhang, B., Ren, H., Wei, X., Xia, H., Shen, C.: Twins: Revisiting the design of spatial attention in vision transformers. Advances in Neural Information Processing Systems 34, 9355-9366 (2021) +5. Dai, Y., Zhu, Z., Rao, Z., Li, B.: Mvs2: Deep unsupervised multi-view stereo with multi-view symmetry. In: 2019 International Conference on 3D Vision (3DV). pp. 1-8. IEEE (2019) +6. Darmon, F., Bascle, B., Devaux, J.C., Monasse, P., Aubry, M.: Improving neural implicit surfaces geometrym fan with patch warping. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6260-6269 (2022) +7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009) +8. Drebin, R.A., Carpenter, L., Hanrahan, P.: Volume rendering. ACM Siggraph Computer Graphics 22(4), 65-74 (1988) +9. Fu, Q., Xu, Q., Ong, Y.S., Tao, W.: Geo-neus: geometry-consistent neural implicit surfaces learning for multi-view reconstruction. arXiv preprint arXiv:2205.15848 (2022) +10. Galliani, S., Lasinger, K., Schindler, K.: Massively parallel multiview stereopsis by surface normal diffusion. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 873-881 (2015) +11. Gao, P., Ma, T., Li, H., Dai, J., Qiao, Y.: Convmae: Masked convolution meets masked autoencoders. arXiv preprint arXiv:2205.03892 (2022) +12. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. arXiv preprint arXiv:2002.10099 (2020) +13. Gu, X., Fan, Z., Zhu, S., Dai, Z., Tan, F., Tan, P.: Cascade cost volume for high-resolution multi-view stereo and stereo matching. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2020) + +14. Guo, H., Peng, S., Lin, H., Wang, Q., Zhang, G., Bao, H., Zhou, X.: Neural 3d scene reconstruction with the manhattan-world assumption. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5511-5520 (2022) +15. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022) +16. Jensen, R., Dahl, A., Vogiatzis, G., Tola, E., Aanæs, H.: Large scale multi-view stereopsis evaluation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 406-413 (2014) +17. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013) +18. Khot, T., Agrawal, S., Tulsiani, S., Mertz, C., Lucey, S., Hebert, M.: Learning unsupervised multi-view stereopsis via robust photometric consistency. arXiv preprint arXiv:1905.02706 (2019) +19. Kim, D., Ka, W., Ahn, P., Joo, D., Chun, S., Kim, J.: Global-local path networks for monocular depth estimation with vertical cutdepth. arXiv preprint arXiv:2201.07436 (2022) +20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) +21. Labatut, P., Pons, J.P., Keriven, R.: Efficient multi-view reconstruction of large-scale scenes using interest points, delaunay triangulation and graph cuts. In: 2007 IEEE 11th international conference on computer vision. pp. 1-8. IEEE (2007) +22. Li, Z., Müller, T., Evans, A., Taylor, R.H., Unberath, M., Liu, M.Y., Lin, C.H.: Neuralangelo: High-fidelity neural surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8456-8465 (2023) +23. Li, Z., Snavely, N.: Megadepth: Learning single-view depth prediction from internet photos. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2041-2050 (2018) +24. Lipson, L., Teed, Z., Deng, J.: Raft-stereo: Multilevel recurrent field transforms for stereo matching. In: 2021 International Conference on 3D Vision (3DV). pp. 218-227. IEEE (2021) +25. Liu, S., Zhang, Y., Peng, S., Shi, B., Pollefeys, M., Cui, Z.: Dist: Rendering deep implicit signed distance function with differentiable sphere tracing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2019-2028 (2020) +26. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022) +27. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4460-4470 (2019) +28. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021) +29. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022) + +30. Mur-Artal, R., Tardós, J.D.: Orb-slam2: An open-source slam system for monoc- +cular, stereo, and rgb-d cameras. IEEE transactions on robotics 33(5), 1255-1262 (2017) +31. Niemeyer, M., Mescheder, L., Oechsle, M., Geiger, A.: Differentiable volumetric rendering: Learning implicit 3d representations without 3d supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3504-3515 (2020) +32. Oechsle, M., Peng, S., Geiger, A.: Unisurf: Unifying neural implicit surfaces and radiance fields for multi-view reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5589-5599 (2021) +33. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE transactions on pattern analysis and machine intelligence 44(3), 1623-1637 (2020) +34. Schonberger, J.L., Frahm, J.M.: Structure-from-motion revisited. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4104-4113 (2016) +35. Schonberger, J.L., Zheng, E., Frahm, J.M., Pollefeys, M.: Pixelwise view selection for unstructured multi-view stereo. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 501-518. Springer (2016) +36. Strecha, C., Von Hansen, W., Van Gool, L., Fua, P., Thoennessen, U.: On benchmarking camera calibration and multi-view stereo for high resolution imagery. In: 2008 IEEE conference on computer vision and pattern recognition. pp. 1-8. IEEE (2008) +37. Sun, C., Sun, M., Chen, H.T.: Direct voxel grid optimization: Super-fast convergence for radiance fields reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5459-5469 (2022) +38. Tang, S., Zhang, J., Zhu, S., Tan, P.: Quadtree attention for vision transformers. ICLR (2022) +39. Teed, Z., Deng, J.: Deepv2d: Video to depth with differentiable structure from motion. arXiv preprint arXiv:1812.04605 (2018) +40. Vijayanarasimhan, S., Ricco, S., Schmid, C., Sukthankar, R., Fragkiadaki, K.: Sfnet: Learning of structure and motion from video. arXiv preprint arXiv:1704.07804 (2017) +41. Wang, J., Bleja, T., Agapito, L.: Go-surf: Neural feature grid optimization for fast, high-fidelity rgb-d surface reconstruction. arXiv preprint arXiv:2206.14735 (2022) +42. Wang, P., Liu, L., Liu, Y., Theobalt, C., Komura, T., Wang, W.: Neus: Learning neural implicit surfaces by volume rendering for multi-view reconstruction. arXiv preprint arXiv:2106.10689 (2021) +43. Wang, Y., Skorokhodov, I., Wonka, P.: Hf-neus: Improved surface reconstruction using high-frequency details. Advances in Neural Information Processing Systems 35, 1966-1978 (2022) +44. Wang, Y., Skorokhodov, I., Wonka, P.: Pet-neus: Positional encoding tri-planes for neural surfaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12598-12607 (2023) +45. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) + +46. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: Croco: Self-supervised pre-training for 3d vision tasks by cross-view completion. arXiv preprint arXiv:2210.10716 (2022) +47. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. Advances in Neural Information Processing Systems 34, 12077-12090 (2021) +48. Xu, G., Wang, X., Ding, X., Yang, X.: Iterative geometry encoding volume for stereo matching. arXiv preprint arXiv:2303.06615 (2023) +49. Xu, Q., Wang, W., Ceylan, D., Mech, R., Neumann, U.: Disn: Deep implicit surface network for high-quality single-view 3d reconstruction. Advances in neural information processing systems 32 (2019) +50. Yang, Z., Wang, P., Xu, W., Zhao, L., Nevatia, R.: Unsupervised learning of geometry from videos with edge-aware depth-normal consistency. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 32 (2018) +51. Yariv, L., Gu, J., Kasten, Y., Lipman, Y.: Volume rendering of neural implicit surfaces. Advances in Neural Information Processing Systems 34, 4805-4815 (2021) +52. Yariv, L., Kasten, Y., Moran, D., Galun, M., Atzmon, M., Ronen, B., Lipman, Y.: Multiview neural surface reconstruction by disentangling geometry and appearance. Advances in Neural Information Processing Systems 33, 2492-2502 (2020) +53. Yi, X., Zhou, Y., Habermann, M., Golyanik, V., Pan, S., Theobalt, C., Xu, F.: Ecolocate: Real-time motion capture, localization, and mapping with sparse body-mounted sensors. arXiv preprint arXiv:2305.01599 (2023) +54. Yu, Z., Peng, S., Niemeyer, M., Sattler, T., Geiger, A.: Monosdf: Exploring monocular geometric cues for neural implicit surface reconstruction. arXiv preprint arXiv:2206.00665 (2022) +55. Zhang, J., Yao, Y., Li, S., Luo, Z., Fang, T.: Visibility-aware multi-view stereo network. arXiv preprint arXiv:2008.07928 (2020) +56. Zhang, J., Yao, Y., Quan, L.: Learning signed distance field for multi-view surface reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6525-6534 (2021) +57. Zhang, K., Luan, F., Wang, Q., Bala, K., Snavely, N.: Physg: Inverse rendering with spherical gaussians for physics-based material editing and relighting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5453-5462 (2021) \ No newline at end of file diff --git a/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/images.zip b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..35515bb0d044d6df125a16bfcdbbb1949f64b93f --- /dev/null +++ b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:24b99d4c8f7bb7d36bf6f882023208a1ec17f303c89dc9cfc05a30b1fcc66f20 +size 531881 diff --git a/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/layout.json b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..ba638055a6ee732da2e1e29a5667c350fc13ac38 --- /dev/null +++ b/2024/Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images/layout.json @@ -0,0 +1,9081 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 143, + 111, + 473, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 111, + 473, + 148 + ], + "spans": [ + { + "bbox": [ + 143, + 111, + 473, + 148 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors from Multi-View Images" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "spans": [ + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "text", + "content": "Xinlin Ren" + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "inline_equation", + "content": "^{1*}" + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "text", + "content": ", Chenjie Cao" + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "inline_equation", + "content": "^{1,2*}" + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "text", + "content": ", Yanwei Fu" + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "inline_equation", + "content": "^{1\\dagger}" + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "text", + "content": ", and Xiangyang Xue" + }, + { + "bbox": [ + 147, + 173, + 466, + 187 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 200, + 194, + 414, + 231 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 194, + 414, + 231 + ], + "spans": [ + { + "bbox": [ + 200, + 194, + 414, + 231 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 200, + 194, + 414, + 231 + ], + "type": "text", + "content": " Fudan University \n" + }, + { + "bbox": [ + 200, + 194, + 414, + 231 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 200, + 194, + 414, + 231 + ], + "type": "text", + "content": " Alibaba Group, DAMO Academy \n{xlren20,cjcao20,yanweifu,xyxue}@fudan.edu.cn" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 257, + 457, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 257, + 457, + 521 + ], + "spans": [ + { + "bbox": [ + 160, + 257, + 457, + 521 + ], + "type": "text", + "content": "Abstract. Recent advancements in Neural Surface Reconstruction (NSR) have significantly improved multi-view reconstruction when coupled with volume rendering. However, relying solely on photometric consistency in image space falls short of addressing complexities posed by real-world data, including occlusions and non-Lambertian surfaces. To tackle these challenges, we propose an investigation into feature-level consistent loss, aiming to harness valuable feature priors from diverse pretext visual tasks and overcome current limitations. It is crucial to note the existing gap in determining the most effective pretext visual task for enhancing NSR. In this study, we comprehensively explore multi-view feature priors from seven pretext visual tasks, comprising thirteen methods. Our main goal is to strengthen NSR training by considering a wide range of possibilities. Additionally, we examine the impact of varying feature resolutions and evaluate both pixel-wise and patch-wise consistent losses, providing insights into effective strategies for improving NSR performance. By incorporating pre-trained representations from MVSFormer [2] and QuadTree [38], our approach can generate variations of MVS-NeuS and Match-NeuS, respectively. Our results, analyzed on DTU and EPFL datasets, reveal that feature priors from image matching and multi-view stereo outperform other pretext tasks. Moreover, we discover that extending patch-wise photometric consistency to the feature level surpasses the performance of pixel-wise approaches. These findings underscore the effectiveness of these techniques in enhancing NSR outcomes. Codes and models are available at https://github.com/maybeLx/MVS_NeuS." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 531, + 406, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 531, + 406, + 542 + ], + "spans": [ + { + "bbox": [ + 160, + 531, + 406, + 542 + ], + "type": "text", + "content": "Keywords: Feature Priors " + }, + { + "bbox": [ + 160, + 531, + 406, + 542 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 531, + 406, + 542 + ], + "type": "text", + "content": " Neural Surface Reconstruction" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 563, + 231, + 575 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 563, + 231, + 575 + ], + "spans": [ + { + "bbox": [ + 132, + 563, + 231, + 575 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 587, + 482, + 636 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 587, + 482, + 636 + ], + "spans": [ + { + "bbox": [ + 130, + 587, + 482, + 636 + ], + "type": "text", + "content": "Reconstructing surface from multi-view images is a crucial task in 3D computer vision. Traditionally, this task is addressed using a pipeline that includes depth prediction, point cloud reconstruction, and maximizing point consistency for surface mesh [1,17,21,35]. Unfortunately, these traditional methods often result in" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 142, + 643, + 241, + 653 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 643, + 241, + 653 + ], + "spans": [ + { + "bbox": [ + 142, + 643, + 241, + 653 + ], + "type": "text", + "content": "*: Equal Contributions." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 653, + 246, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 653, + 246, + 665 + ], + "spans": [ + { + "bbox": [ + 142, + 653, + 246, + 665 + ], + "type": "text", + "content": "†: Corresponding Author" + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 123, + 347, + 220 + ], + "blocks": [ + { + "bbox": [ + 140, + 123, + 347, + 220 + ], + "lines": [ + { + "bbox": [ + 140, + 123, + 347, + 220 + ], + "spans": [ + { + "bbox": [ + 140, + 123, + 347, + 220 + ], + "type": "image", + "image_path": "6e8dd36dab400e4252f8a6f0f796c2772b9ffdd9beb4a21895434b1266c097ea.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 235, + 224, + 248, + 234 + ], + "lines": [ + { + "bbox": [ + 235, + 224, + 248, + 234 + ], + "spans": [ + { + "bbox": [ + 235, + 224, + 248, + 234 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 350, + 116, + 470, + 221 + ], + "blocks": [ + { + "bbox": [ + 350, + 116, + 470, + 221 + ], + "lines": [ + { + "bbox": [ + 350, + 116, + 470, + 221 + ], + "spans": [ + { + "bbox": [ + 350, + 116, + 470, + 221 + ], + "type": "image", + "image_path": "d8a00c901c89d62981699dc5fccc63a226219e00c95e8f9b26ad0f94579b0c3d.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 403, + 224, + 416, + 234 + ], + "lines": [ + { + "bbox": [ + 403, + 224, + 416, + 234 + ], + "spans": [ + { + "bbox": [ + 403, + 224, + 416, + 234 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 236, + 482, + 293 + ], + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 293 + ], + "type": "text", + "content": "Fig. 1: (a) Pixel-wise similarity for RGB images: MVS features [2] and matching features [38] on non-Lambertian surfaces. (b) Multi-view consistency of feature priors: Given a ray direction, the geometry network can extract surface points, which are used to project and align source features to the reference view for optimizing patch-wise photometric consistency loss." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 435 + ], + "type": "text", + "content": "visual errors due to the complexity of these procedures. In contrast, recent approaches opt to represent the surface through volume rendering, inspired by the Neural Radiance Fields (NeRF) [28], thereby avoiding the accumulation of errors seen in the traditional pipeline. Notably, Neural Surface Reconstruction (NSR) has made significant strides in multi-view reconstruction, leveraging techniques such as Signed Distance Functions (SDF) [42, 51] and occupancy [31] combined with volume rendering. However, despite these advancements, these sophisticated methods still grapple with fundamental challenges in surface reconstruction, including maintaining geometric consistency across different views. This challenge becomes particularly pronounced when dealing with non-Lambertian surfaces and occlusions [6, 9], as illustrated in Fig. 1a." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 437, + 483, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 483, + 556 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 483, + 556 + ], + "type": "text", + "content": "To tackle these challenges, earlier studies [6, 9] have delved into optimizing patch-wise warping losses in image space, employing metrics such as Structural Similarity (SSIM) [45] or Normalized Cross-Correlation (NCC) [10]. In an effort to enhance the robustness of geometric consistency in real-world scenarios, Chen et al. [3] utilized features extracted from a learning-based Multi-View Stereo (MVS) model [55] to compute pixel-wise feature similarity. Despite promising results with MVS features, it remains unclear whether the neural surface reconstruction can benefit from other pretext tasks and what key factors contribute to improved reconstruction. Furthermore, it is worth investigating whether these features can also benefit from patch-wise photometric consistency." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "This study aims to address these questions by conducting a comprehensive investigation into the impact of diverse pre-trained feature priors obtained from various pretext visual tasks for NSR learning. We thoroughly consider seven distinctly different pretext visual tasks, encompassing 2D supervised [4, 26, 47], 2D self-supervised [11, 15, 46], and 3D supervised [2, 13, 19, 24, 33, 38, 48] approaches. The pre-trained models from these tasks can serve as feature extractors for our NSR task. Crucially, we not only compare various architectures used in these models, ranging from Convolution Neural Networks (CNNs) [13, 24, 26, 48] to Vision Transformers (ViTs) [2, 15, 46, 47], but also explore feature maps from dif" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "content": "ferent layers within the same model to identify common factors relevant to NSR. Furthermore, we propose for extending patch-wise photometric consistency to the feature level, resulting in substantial improvements." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 156, + 482, + 289 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 156, + 482, + 289 + ], + "spans": [ + { + "bbox": [ + 130, + 156, + 482, + 289 + ], + "type": "text", + "content": "Formally, our approach enhances NSR by integrating various feature priors derived from multi-view images. Building upon the robust foundation of NeuS [42], which acts as the baseline method in this paper, we further improve NSR by introducing feature-level consistent loss from diverse pre-trained models, as depicted in Fig. 1b. Specifically, we compare 13 pre-trained models across 7 distinct pretext tasks, as listed in Tab. 1. To the best of our knowledge, this evaluation represents the most comprehensive assessment of pretext tasks on NSR to date, encompassing masked image modeling [11, 15, 46], image classification [4, 26], semantic segmentation [47], monocular depth estimation [19, 33], stereo matching [24, 48], image matching [38], and MVS [2, 13]. The DTU and EPFL datasets serve as the benchmark for evaluation [16]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 293, + 482, + 365 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 365 + ], + "type": "text", + "content": "Notably and interestingly, our empirical findings reveal that models pretrained on MVS and image matching tasks consistently outperform others significantly. This success is attributed to the feature similarity supervision provided by depth annotation [16] for MVS and Structure from Motion (SfM) [23] for image matching. Moreover, these tasks yield high-resolution features, emerging as another crucial factor contributing to the superior performance of NSR models." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 369, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 548 + ], + "type": "text", + "content": "Furthermore, we observe that 3D-CNN regularization, designed to denoise the 3D cost volume [2, 13, 48], impedes effective 2D feature learning. Consequently, utilizing features from pre-trained models of image matching tasks without 3D cost volume regularization achieves the best performance and generalization in NSR. Moreover, in our experiments on the EPFL dataset [36], we make an intriguing observation that patch-wise photometric consistency can be effectively generalized to the feature level, resulting in remarkable improvements. Thus, bolstered by patch-wise photometric consistency losses from pre-trained models in both MVSFormer [2] and QuadTree [38] our approach can produce variations of MVS-NeuS and Match-NeuS. These variations demonstrate state-of-the-art performance on the DTU and EPFL datasets, respectively. Additionally, we take a further exploration of the feature priors on grid-based methods such as Neuralangelo [22], where feature priors still enjoy promising benefits. Thus our method could be extended to different neural representations (MLP or grid-based methods). Our contributions can be highlighted as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 553, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 130, + 553, + 482, + 613 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 553, + 482, + 613 + ], + "spans": [ + { + "bbox": [ + 130, + 553, + 482, + 613 + ], + "type": "text", + "content": "1) We are the first to conduct a comprehensive evaluation of prior features derived from various pretext tasks on NSR. Additionally, we delve into a detailed comparison of pixel-wise feature consistent loss across these approaches. This comprehensive analysis advances our understanding of the effect of different feature priors for NSR." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "2) Our research brings to light a significant finding: models pre-trained on image matching and MVS tasks consistently outperform others in the realm of NSR. This superior performance is attributed to the advantages gained from feature-similarity related pretext training and the utilization of high-resolution" + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 194, + 172, + 416, + 346 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: A summary of models from various pretext tasks including MIM (masked image modeling), IC (image classification), MDE (monocular depth estimation), SM (stereo matching), SS (semantic segmentation), IM (image matching), and MVS. Only the feature dimensions and resolutions of the highest and lowest features are shown. (Res: Resolution, Dim: Dimension)" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 194, + 172, + 416, + 346 + ], + "lines": [ + { + "bbox": [ + 194, + 172, + 416, + 346 + ], + "spans": [ + { + "bbox": [ + 194, + 172, + 416, + 346 + ], + "type": "table", + "html": "
TaskModelArchitectFeature ResFeature Dim
MIMMAE [15]ViT1/161024
CovMAE [11]ViT+CNN1/16,1/4768,256
CroCo [46]ViT1/16768
ICTwins [4]ViT1/32, 1/41024,128
ConvNeXt [26]CNN1/32, 1/42048,256
SSSegFormer [47]ViT1/32, 1/4512,64
MDEGLPN [19]ViT1/32, 1/4512,64
MiDaS [33]ViT1/322048
SMIGEV [48]CNN1/32, 1/4160,96
RAFT-Stereo [24]CNN1/4256
IMQuadTree [38]ViT+CNN1/8,1/2256,128
MVSCascadeMVS [13]CNN1/8,132,8
MVSFormer [2]ViT+CNN1/8,132,8
", + "image_path": "6555cdc78b6d9a153a685807ca9014b7e3c7b729999411e6532f14aa23cb844b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 360, + 481, + 383 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 360, + 481, + 383 + ], + "spans": [ + { + "bbox": [ + 130, + 360, + 481, + 383 + ], + "type": "text", + "content": "features. By identifying these key factors, our work contributes valuable insights that can inform future developments in NSR methods." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 456 + ], + "type": "text", + "content": "3) Another notable contribution of our research lies in the successful extension of the patch-wise photometric consistency loss to the feature level. This innovative approach stands as a significant advancement, leading to improved results regardless of different neural representations (MLP or grid-based methods). By bridging the gap between patch-wise and feature-level considerations, our work reaches the state-of-the-art in NSR." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 473, + 238, + 487 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 473, + 238, + 487 + ], + "spans": [ + { + "bbox": [ + 132, + 473, + 238, + 487 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 666 + ], + "type": "text", + "content": "Neural Surfaces Reconstruction (NSR). Surface reconstruction based on deep learning has garnered significant attention due to its expressive representation capabilities. Representative algorithms focus on utilizing implicit representations to encode the geometry and appearance of 3D scenes through neural networks. These representations include occupancy fields [27, 31] and SDF [25, 49, 52, 56, 57]. Since the emergence of volume rendering techniques pioneered by NeRF [28], numerous NSR methods have seen a dramatic rise [3, 6, 9, 14, 32, 42-44, 51, 54]. Notably, VolSDF [51] and NeuS [42] convert volume density to SDF without the need for masks, while UNISURF [32] unifies both surface and volume rendering. Concurrently, grid-based representation methods are gaining attention [22, 29, 37, 41], as they offer faster convergence compared to implicit ones with competitive results. Essentially, note that these explicit NSR methods serve as robust foundations, and our contributions are orthogonal to these approaches. However, it is crucial to highlight that all these existing methods" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 186, + 114, + 425, + 255 + ], + "blocks": [ + { + "bbox": [ + 186, + 114, + 425, + 255 + ], + "lines": [ + { + "bbox": [ + 186, + 114, + 425, + 255 + ], + "spans": [ + { + "bbox": [ + 186, + 114, + 425, + 255 + ], + "type": "image", + "image_path": "e209a18ddf1681b98aee9ad9758663d6f5ec0f01b1b9afae5ff4637afccedf55.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 261, + 482, + 297 + ], + "lines": [ + { + "bbox": [ + 131, + 261, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 131, + 261, + 482, + 297 + ], + "type": "text", + "content": "Fig. 2: Approach overview. Our method is based on NeuS [42]. After achieving surface points from geometry network " + }, + { + "bbox": [ + 131, + 261, + 482, + 297 + ], + "type": "inline_equation", + "content": "f_{\\theta_g}" + }, + { + "bbox": [ + 131, + 261, + 482, + 297 + ], + "type": "text", + "content": ", we further apply the multi-view consistent loss based on features from pre-trained models to improve the reconstruction quality." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 308, + 481, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 481, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 481, + 332 + ], + "type": "text", + "content": "overlook the importance of multi-view consistency during surface reconstruction. This gap forms the basis for our unique contributions in addressing this aspect." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 332, + 481, + 452 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 481, + 452 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 481, + 452 + ], + "type": "text", + "content": "Photometric Consistency. Many previous studies have delved into the application of photometric consistency across various 3D reconstruction tasks [5, 18, 30, 34, 39, 40, 50, 53]. For SfM, several researches aim to optimize camera poses by minimizing photometric errors between corresponding pixels in different images [34, 39, 40]. Similarly, various self-supervised MVS methods [5, 18, 50] leverage consistent loss to supervise depth prediction. Moreover, in Simultaneous Localization and Mapping (SLAM), photometric consistency plays a crucial role. By comparing the appearance of projected 3D points in the image with the actual observed images, photometric consistency can detect potential errors or inaccuracies in geometry [30, 53]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 452, + 481, + 583 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 452, + 481, + 583 + ], + "spans": [ + { + "bbox": [ + 130, + 452, + 481, + 583 + ], + "type": "text", + "content": "Photometric Consistency in NSR. Prior works [6,9,14] have incorporated patch-wise photometric consistency directly computed from raw images or pixelwise feature similarity to enhance NSR training. NeuralWarp [14] introduces a patch-wise warping loss along with a visibility map that masks incorrect warps arising from occlusion. Similarly, GeoNeus [9] and D-NeuS [6] focus on locating the zero-level set of geometry network to enforce multi-view geometry constraints, resulting in more accurate reconstruction outcomes. Despite these advancements, none of these methods thoroughly explore the distinctions between patch-wise and pixel-wise consistent loss, nor do they investigate the potential benefits of incorporating prior features from other pretext visual tasks as opposed to using raw images." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 603, + 329, + 616 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 603, + 329, + 616 + ], + "spans": [ + { + "bbox": [ + 131, + 603, + 329, + 616 + ], + "type": "text", + "content": "3 NSR based on Feature Priors" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 481, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 667 + ], + "type": "text", + "content": "Overview. Given a set of posed multi-view images, the goal of NSR is to reconstruct high-quality surfaces by neural volume rendering, as illustrated in Fig. 2. We revisit the NeuS baseline [42] for multi-view consistency zero-crossing points." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 163 + ], + "type": "text", + "content": "We briefly introduce pretext tasks in Sec. 3.1 and discuss consistent loss in both pixel-wise and patch-wise terms in Sec. 3.2. By utilizing pre-trained representations from MVS and image matching pretext tasks, we have MVS-NeuS and Match-NeuS, which are compared in the experiments." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "text", + "content": "NeuS [42] proposes a novel scheme to achieve unbiased reconstructed surfaces in the first-order approximation of SDF. In this scheme, a ray " + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "inline_equation", + "content": "\\{p(t) = o + tv|t > 0\\}" + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "text", + "content": " is emitted from a camera center at " + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "inline_equation", + "content": "o" + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "text", + "content": " with view direction " + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "inline_equation", + "content": "v" + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "text", + "content": ". Colors " + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "inline_equation", + "content": "\\hat{C}(r)" + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "text", + "content": " along a ray can be accumulated by volume rendering [8], which is approximated by " + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 164, + 482, + 224 + ], + "type": "text", + "content": " discretely sampled points as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 223, + 235, + 481, + 269 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 235, + 481, + 269 + ], + "spans": [ + { + "bbox": [ + 223, + 235, + 481, + 269 + ], + "type": "interline_equation", + "content": "\\hat {C} (r) = \\sum_ {i = 1} ^ {N} T _ {i} \\alpha_ {i} c _ {i}, \\quad T _ {i} = \\prod_ {j = 1} ^ {i - 1} \\left(1 - \\alpha_ {j}\\right), \\tag {1}", + "image_path": "bacd71ca825cc981f709efdb697fe29f88a44755e2ae1ab168599d5eae0b1baf.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\alpha_{i}" + }, + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "inline_equation", + "content": "T_{i}" + }, + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "text", + "content": " are the opacity and accumulated transmittance along the ray respectively. To achieve the unbiased surface, we can compute " + }, + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "inline_equation", + "content": "\\alpha_{i}" + }, + { + "bbox": [ + 130, + 278, + 482, + 304 + ], + "type": "text", + "content": " by:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 212, + 314, + 481, + 341 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 212, + 314, + 481, + 341 + ], + "spans": [ + { + "bbox": [ + 212, + 314, + 481, + 341 + ], + "type": "interline_equation", + "content": "\\alpha_ {i} = \\max \\left(\\frac {\\Phi_ {s} (s d f (p _ {i})) - \\Phi_ {s} (s d f (p _ {i + 1}))}{\\Phi_ {s} (s d f (p _ {i}))}, 0\\right), \\tag {2}", + "image_path": "0567e3bf9f4a02cdaf7e7ff30839d9c49dbb66a0aa6002f8374aebd6df063324.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "spans": [ + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "inline_equation", + "content": "sdf(\\cdot)" + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "text", + "content": " is the SDF function modeled by the geometry network " + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "inline_equation", + "content": "f_{\\theta_g}" + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "inline_equation", + "content": "\\varPhi_s(\\cdot)" + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "text", + "content": " is the sigmoid function and " + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 346, + 482, + 371 + ], + "type": "text", + "content": " is a learnable parameter." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 372, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 372, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 372, + 482, + 456 + ], + "type": "text", + "content": "Differentiable Zero-Crossing Points. Since achieving photometric consistency involves warping patches or pixels based on a specific depth, we define the depth planes through zero-crossing points achieved from the zero-level set of SDF function as [3, 6]. So it is crucial to apply photometric consistency specifically to the zero-crossing points of geometry network " + }, + { + "bbox": [ + 130, + 372, + 482, + 456 + ], + "type": "inline_equation", + "content": "f_{\\theta_g}" + }, + { + "bbox": [ + 130, + 372, + 482, + 456 + ], + "type": "text", + "content": ", as shown in Fig. 3. We only require the first set of zero-crossing points " + }, + { + "bbox": [ + 130, + 372, + 482, + 456 + ], + "type": "inline_equation", + "content": "T^*" + }, + { + "bbox": [ + 130, + 372, + 482, + 456 + ], + "type": "text", + "content": " which is visible from the corresponding view. It can be expressed as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 197, + 465, + 481, + 493 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 465, + 481, + 493 + ], + "spans": [ + { + "bbox": [ + 197, + 465, + 481, + 493 + ], + "type": "interline_equation", + "content": "T ^ {*} = \\left\\{t \\mid t = \\frac {s d f \\left(p _ {t _ {i}}\\right) t _ {i + 1} - s d f \\left(p _ {t _ {i + 1}}\\right) t _ {i}}{s d f \\left(p _ {t _ {i}}\\right) - s d f \\left(p _ {t _ {i + 1}}\\right)}, t _ {i} \\in T \\right\\}, \\tag {3}", + "image_path": "79465afcb857941e5da9978529a34cd6812262e2a7b16f133f01ae1e6a16d70a.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 210, + 510, + 481, + 529 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 510, + 481, + 529 + ], + "spans": [ + { + "bbox": [ + 210, + 510, + 481, + 529 + ], + "type": "interline_equation", + "content": "T = \\underset {i} {\\arg \\min } \\left\\{t _ {i} | s d f \\left(p _ {t _ {i}}\\right) \\cdot s d f \\left(p _ {t _ {t + 1}}\\right)) < 0 \\right\\}. \\tag {4}", + "image_path": "f0ce4a76488c4c7b5e9220db3b135e6ccb792628a5f1aadde45495b7e611dc8c.jpg" + } + ] + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 177, + 549, + 260, + 612 + ], + "blocks": [ + { + "bbox": [ + 177, + 549, + 260, + 612 + ], + "lines": [ + { + "bbox": [ + 177, + 549, + 260, + 612 + ], + "spans": [ + { + "bbox": [ + 177, + 549, + 260, + 612 + ], + "type": "image", + "image_path": "91980f2eb3abe61184f57a25cf7d327831127e1e730b0c95e43a5797f38bf15c.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 194, + 613, + 241, + 622 + ], + "lines": [ + { + "bbox": [ + 194, + 613, + 241, + 622 + ], + "spans": [ + { + "bbox": [ + 194, + 613, + 241, + 622 + ], + "type": "text", + "content": "Reference Image" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 260, + 613, + 342, + 622 + ], + "lines": [ + { + "bbox": [ + 260, + 613, + 342, + 622 + ], + "spans": [ + { + "bbox": [ + 260, + 613, + 342, + 622 + ], + "type": "text", + "content": "Depth of Zero-Crossing Points" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 260, + 549, + 344, + 612 + ], + "blocks": [ + { + "bbox": [ + 260, + 549, + 344, + 612 + ], + "lines": [ + { + "bbox": [ + 260, + 549, + 344, + 612 + ], + "spans": [ + { + "bbox": [ + 260, + 549, + 344, + 612 + ], + "type": "image", + "image_path": "9611627002db96db70cc172d2bc878f4193e586e124ab41a6bbbfef49363c7b4.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 624, + 482, + 658 + ], + "lines": [ + { + "bbox": [ + 130, + 624, + 482, + 658 + ], + "spans": [ + { + "bbox": [ + 130, + 624, + 482, + 658 + ], + "type": "text", + "content": "Fig. 3: Two different ways to locate surface points during the network training at 5000 iterations. Compared with volume rendering, it is more accurate to find the surface points via Eq. 3. Accurate surface points are crucial for applying consistent loss." + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 345, + 549, + 429, + 612 + ], + "blocks": [ + { + "bbox": [ + 345, + 549, + 429, + 612 + ], + "lines": [ + { + "bbox": [ + 345, + 549, + 429, + 612 + ], + "spans": [ + { + "bbox": [ + 345, + 549, + 429, + 612 + ], + "type": "image", + "image_path": "bcc42edf56195d6e34e738980c4e37986af7a1c179124dd1ef6cdabc8d7ef5b6.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 347, + 613, + 430, + 622 + ], + "lines": [ + { + "bbox": [ + 347, + 613, + 430, + 622 + ], + "spans": [ + { + "bbox": [ + 347, + 613, + 430, + 622 + ], + "type": "text", + "content": "Depth from Volume Rendering" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 231, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 231, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 231, + 126 + ], + "type": "text", + "content": "3.1 Predtext Tasks" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 482, + 209 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 482, + 209 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 482, + 209 + ], + "type": "text", + "content": "Various models in different pretext visual tasks have been explored as shown in Tab. 1. Our emphasis is specifically on the features obtained from the feature encoder modules of these pre-trained models. Importantly, many of these models include multi-scale feature maps. In this context, our focus is on the most representative features at both the highest and lowest scales, encompassing high-level semantic understanding and fine-grained low-level details, respectively." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 209, + 482, + 293 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 209, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 209, + 482, + 293 + ], + "type": "text", + "content": "Masked Image Modeling (MIM) has been widely investigated recently, as an effective self-supervised task [15]. MIM randomly masks input images at a relatively high rate and subsequently predicts the masked regions based on the context of unmasked areas. MIM has gained significant attention recently, with several pioneering works demonstrating its effectiveness in various downstream tasks [11, 15, 46]. In contrast to other self-supervised tasks, MIM exhibits favorable fine-grained feature correlations that can potentially benefit NSR learning." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 293, + 482, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 353 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 353 + ], + "type": "text", + "content": "Image Classification (IC) is a well-established supervised task known for extracting discriminative features. In this paper, we investigate models built on CNNs [26] and ViTs [4] that are pre-trained for image classification on ImageNet [7]. These models serve as baselines, helping us answer the question of whether engaging in such a classic pretext task also enhances the NSR." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 354, + 487, + 401 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 487, + 401 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 487, + 401 + ], + "type": "text", + "content": "Semantic Segmentation (SS). Models like [20, 47] have demonstrated outstanding performance in semantic segmentation by training on large-scale datasets. Unlike classification tasks, these models can capture more detailed, class-specific features, which holds the potential to enhance NSR training." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 402, + 482, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 449 + ], + "type": "text", + "content": "Monocular Depth Estimation (MDE) aims to predict the depth map of a scene using a single input view, essentially creating a 2D representation of a 3D scene. Several successful works [19, 33] have demonstrated the ability to recover fine details of the scene in this process." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 449, + 482, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 449, + 482, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 449, + 482, + 520 + ], + "type": "text", + "content": "Stereo Matching (SM) is the process of identifying corresponding pixels between two rectified images along epipolar lines, ultimately determining the disparity between these corresponding points. Noteworthy approaches like IGEV [48] and RAFT-Stereo [24] have demonstrated promising results in this task. The learning involved in establishing correspondences bears some similarities to the learning of consistent loss in NSR." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 521, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 605 + ], + "type": "text", + "content": "Multi-View Stereo (MVS) differs from stereo matching in that it involves multiple input views with known camera poses. However, the MVS problem often faces challenges such as occlusions and varying light conditions. Consequently, MVS methods like CasMVSNet [13] and MVSFormer [52] need to enhance feature learning to accurately identify corresponding pixels along epipolar lines. It's worth noting that MVS methods may encounter data bias, as discussed in Sec. 4.2, particularly on the DTU dataset [16]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 606, + 482, + 665 + ], + "type": "text", + "content": "Image Matching (IM). In comparison to stereo matching and MVS, image matching tackles a more intractable problem, i.e., detecting fine-grained matching pairs between two images without assistance from known camera poses. To solve this challenge, Tand et al. [38] utilize a transformer with a lightweight QuadTree attention mechanism to capture long-range dependencies. Despite" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 140 + ], + "type": "text", + "content": "working without constraints from camera poses, we observe that image matching methods can still achieve effective feature representation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 158, + 360, + 171 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 158, + 360, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 158, + 360, + 171 + ], + "type": "text", + "content": "3.2 Feature-Level Photometric Consistency" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "content": "To leverage the consistency of geometry across different views, we utilize the features " + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_r" + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "inline_equation", + "content": "\\mathbf{F}_s" + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "content": " extracted from the reference and source images through various pre-trained models respectively. Photometric consistency can be applied to these multi-view features to enforce their alignment and coherence. Specifically, from the reference viewpoint, we locate a surface point " + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "content": " derived from Eq. 3 with its 2D projection coordinate denoted as " + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "content": ". This 2D point is then associated with the corresponding point " + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "inline_equation", + "content": "x'" + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "content": " in the source images through the homography " + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 132, + 177, + 482, + 262 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 255, + 270, + 481, + 283 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 270, + 481, + 283 + ], + "spans": [ + { + "bbox": [ + 255, + 270, + 481, + 283 + ], + "type": "interline_equation", + "content": "x ^ {\\prime} = H x, \\quad n ^ {T} p + d = 0, \\tag {5}", + "image_path": "975da0af3afee00ae7a8936be14edaa01968c296674667e53f022120409d8620.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 201, + 300, + 481, + 325 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 201, + 300, + 481, + 325 + ], + "spans": [ + { + "bbox": [ + 201, + 300, + 481, + 325 + ], + "type": "interline_equation", + "content": "H = K _ {s} R _ {s} \\left(I - \\frac {\\left(R _ {s} ^ {- 1} t _ {s} - R _ {r} ^ {- 1} t _ {r}\\right) n ^ {T} R _ {r}}{d}\\right) R _ {r} ^ {- 1} K _ {r} ^ {- 1}, \\tag {6}", + "image_path": "f8a3ffa76f662b929503a6d4dbb9de608352702b07845b696531669ac961a18d.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "spans": [ + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "K_{s}" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "K_{r}" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " denote the internal calibration matrix of source and reference cameras, " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "(R_{s}, R_{r})" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "(t_{s}, t_{r})" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " are the " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " rotation matrix, and 3D translation vector of two views, respectively. " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " denotes the surface normal, which can be computed by automatic differentiation of the geometry network at each point " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": ". Additionally, " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " represents the identity matrix and " + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 132, + 328, + 482, + 399 + ], + "type": "text", + "content": " is the distance from the camera center to the plane of the zero-crossing point (Eq. 3)." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 400, + 482, + 436 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 400, + 482, + 436 + ], + "spans": [ + { + "bbox": [ + 132, + 400, + 482, + 436 + ], + "type": "text", + "content": "Pixel Warping. To compute the pixel-level consistency loss, we can evaluate the feature difference between the pixel " + }, + { + "bbox": [ + 132, + 400, + 482, + 436 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 132, + 400, + 482, + 436 + ], + "type": "text", + "content": " in the reference view and its corresponding pixel " + }, + { + "bbox": [ + 132, + 400, + 482, + 436 + ], + "type": "inline_equation", + "content": "x'" + }, + { + "bbox": [ + 132, + 400, + 482, + 436 + ], + "type": "text", + "content": " in the source views:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 241, + 445, + 481, + 459 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 445, + 481, + 459 + ], + "spans": [ + { + "bbox": [ + 241, + 445, + 481, + 459 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {p i x e l}} = D _ {\\text {p i x e l}} \\left(\\mathbf {F} _ {r} (x), \\mathbf {F} _ {s} \\left(x ^ {\\prime}\\right)\\right), \\tag {7}", + "image_path": "34ed9908f5b383f535523f9dfc020c39859daac91fe188afa91792cd51a9d407.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 467, + 481, + 490 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 467, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 130, + 467, + 481, + 490 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 467, + 481, + 490 + ], + "type": "inline_equation", + "content": "D_{pixel}" + }, + { + "bbox": [ + 130, + 467, + 481, + 490 + ], + "type": "text", + "content": " is the cosine similarity function to measure the feature similarity in pixel-wise." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "text", + "content": "Patch Warping. To more effectively incorporate local feature information, we can broaden the concept of pixel warping to patch warping. To define a small patch " + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "text", + "content": " on the surface, traditionally we would compute the surface points using Eq. 3 and sample numerous points around those surface points to construct the patch. However, this is computationally expensive. As an alternative, we use the central point " + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "inline_equation", + "content": "\\hat{s}" + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "text", + "content": " of the patch " + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "text", + "content": " to represent it and derive the homography matrix " + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "inline_equation", + "content": "H" + }, + { + "bbox": [ + 132, + 491, + 482, + 586 + ], + "type": "text", + "content": ". We can perform patch warping from the source view to the reference view and measure the difference between them. The patch-wise consistent loss is" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 240, + 597, + 481, + 609 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 240, + 597, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 240, + 597, + 481, + 609 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {p a t c h} = D _ {p a t c h} \\left(\\mathbf {F} _ {r} (\\hat {s}), \\mathbf {F} _ {s} \\left(\\hat {s} ^ {\\prime}\\right)\\right), \\tag {8}", + "image_path": "4bd60a221872b229c24abdb578782005190788870f5dc8674f0a18b0e50c0be7.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\hat{s}" + }, + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\hat{s}^{\\prime}" + }, + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "text", + "content": " denote the centers of reference view patches and projected source view patches respectively. " + }, + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "D_{patch}" + }, + { + "bbox": [ + 132, + 617, + 482, + 666 + ], + "type": "text", + "content": " can be represented as NCC [10], SSIM [45], or patch similarity which measures the average of similarity between corresponding elements in the two patches. Since grid-based manners [22] can also locate the" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "surface points via Eq. 3, we easily extend our method to the grid-based methods in Sec. 4.3. More detailed formulas will be explained in the supplementary." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 482, + 284 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 482, + 284 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 482, + 284 + ], + "type": "text", + "content": "About Occlusion. Although we can utilize photometric consistency to supervise the geometry network and encourage accurate surface learning, it's important to note that not all surface points are visible in source view images. Choosing unsuitable source images would cause prominent degradation to the reconstruction. To address this issue, we employ a simple yet effective strategy called Top-k view selection. Specifically, we sort and select 10 source views based on their relative angles from small to large to the reference perspective. Subsequently, we choose Top-k views to compute the patch-wise consistent loss according to the best k photometric scores. We empirically set k to 4 with proper generalization for most scenes. However, we have observed that this strategy does not provide significant benefits to pixel-wise consistency due to the incomplete local feature information which results in unstable view selection during training (Sec. 4.2)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 285, + 481, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 285, + 481, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 481, + 307 + ], + "type": "text", + "content": "Training Loss. To render colors from a specific view, the overall loss function is defined as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 233, + 310, + 481, + 323 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 310, + 481, + 323 + ], + "spans": [ + { + "bbox": [ + 233, + 310, + 481, + 323 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {\\text {c o l o r}} + \\lambda_ {1} \\cdot \\mathcal {L} _ {\\text {e i k}} + \\lambda_ {2} \\cdot \\mathcal {L} _ {\\text {f e a t}}, \\tag {9}", + "image_path": "e8da7dc49d5c881532830651c0c8766658b0d04489b5313b257f7da308d19dbc.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{color} = \\sum_{r\\in \\mathcal{R}}\\| \\hat{C} (\\mathbf{r}) - C(\\mathbf{r})\\| _1" + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "text", + "content": " is the " + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "inline_equation", + "content": "\\ell_1" + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "text", + "content": " loss from minibatch of rays " + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "inline_equation", + "content": "\\mathcal{R}" + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{eik}" + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "text", + "content": " is the eikonal loss defined in [12] to regularize the SDF values predicted by the geometry network " + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "inline_equation", + "content": "f_{\\theta_a}" + }, + { + "bbox": [ + 130, + 329, + 479, + 365 + ], + "type": "text", + "content": " as depicted in Fig. 2." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": "We use feature loss, denoted as " + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text {feat }}" + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": ", and it is implemented as " + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text {patch }}" + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": ". Additionally, in Sec. 4.1, we apply the feature loss as " + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text {pixel }}" + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": " to assess the features of pre-trained models derived from different pretext tasks. Our results demonstrate that " + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text {patch }}" + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": " exhibits greater robustness compared to " + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text {pixel }}" + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": ", emphasizing the effectiveness of our patch warping loss. During the training stage, we set " + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\lambda_{1}" + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "inline_equation", + "content": "\\lambda_{2}" + }, + { + "bbox": [ + 130, + 366, + 482, + 437 + ], + "type": "text", + "content": " as 0.1 and 0.5, respectively." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 438, + 482, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 438, + 482, + 534 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 482, + 534 + ], + "type": "text", + "content": "Discussion. While NeuralWarp [14] has introduced a patching-based warping method to transform source view patches to the reference view, it posits that every sampled point along the ray could be projected to other views to obtain the warped colors, leading to the final warped colors through volume rendering. In contrast, our approach prioritizes the surface points, offering a more accurate and reasonable method that does not depend on visible maps. Furthermore, we extend the patch warping from RGB pixel-level to feature-level, significantly improving the overall quality of reconstruction." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 554, + 230, + 568 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 230, + 568 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 230, + 568 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Datasets. The DTU dataset tested in NSR comprises 15 scenes with 49 or 64 multi-view images collected in an indoor environment with fixed camera poses following [52]. The Chamfer Distance (CD) is utilized to evaluate the performance of reconstructed results on the DTU. We also test two outdoor scenes in EPFL dataset [36], which has 7 and 11 images at a resolution of " + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "2048 \\times 3072" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": ", and one of the scenes is particularly challenging due to the occlusions caused by limited viewpoints." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 115, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 115, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 132, + 115, + 482, + 175 + ], + "type": "text", + "content": "Implementation Details. We use the same architecture as [42]. During the training, 512 rays are sampled for each batch following the hierarchical sampling strategy in NeuS [42]. The learning rate is linearly warmed up from 0 to 5e-3 in the first 5k steps and then decayed to 2.5e-5 with a cosine schedule. For each scene, we train the network for 300k steps costing 10 hours on a single A6000." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 194, + 363, + 206 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 363, + 206 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 363, + 206 + ], + "type": "text", + "content": "4.1 Experiments for Different Pretext Tasks" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 215, + 482, + 311 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 215, + 482, + 311 + ], + "spans": [ + { + "bbox": [ + 132, + 215, + 482, + 311 + ], + "type": "text", + "content": "Settings. We evaluate the effect of various pretext tasks in Tab. 1 by applying pixel similarity as the consistency loss on a subset of the DTU dataset including Scan24, Scan37, and Scan106. These objects are relatively challenging due to difficult lighting conditions and occlusions. Because of the quadratic memory footprint of ViT in high-resolution features, we downsample all images into " + }, + { + "bbox": [ + 132, + 215, + 482, + 311 + ], + "type": "inline_equation", + "content": "512 \\times 768" + }, + { + "bbox": [ + 132, + 215, + 482, + 311 + ], + "type": "text", + "content": " for a fair comparison. We only consider the highest and lowest features from the feature encoder as mentioned in Sec. 3.1. More experiments on multi-scale features are presented in the supplementary." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 198, + 319, + 299, + 407 + ], + "blocks": [ + { + "bbox": [ + 198, + 319, + 299, + 407 + ], + "lines": [ + { + "bbox": [ + 198, + 319, + 299, + 407 + ], + "spans": [ + { + "bbox": [ + 198, + 319, + 299, + 407 + ], + "type": "image", + "image_path": "4c26786de16fcdbe20f7deec71e70da191fe692608e6e292aa9143eaf4c32543.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 244, + 408, + 257, + 418 + ], + "lines": [ + { + "bbox": [ + 244, + 408, + 257, + 418 + ], + "spans": [ + { + "bbox": [ + 244, + 408, + 257, + 418 + ], + "type": "text", + "content": "(a)" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 307, + 319, + 408, + 407 + ], + "blocks": [ + { + "bbox": [ + 307, + 319, + 408, + 407 + ], + "lines": [ + { + "bbox": [ + 307, + 319, + 408, + 407 + ], + "spans": [ + { + "bbox": [ + 307, + 319, + 408, + 407 + ], + "type": "image", + "image_path": "8047e110c0120ce9d40b5b05dfe4b57fef989fb6a00dc674c34c39d7fdb77fa8.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 351, + 408, + 364, + 418 + ], + "lines": [ + { + "bbox": [ + 351, + 408, + 364, + 418 + ], + "spans": [ + { + "bbox": [ + 351, + 408, + 364, + 418 + ], + "type": "text", + "content": "(b)" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 132, + 420, + 482, + 475 + ], + "lines": [ + { + "bbox": [ + 132, + 420, + 482, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 482, + 475 + ], + "type": "text", + "content": "Fig. 4: Quantitative results of using prior features from different pretext tasks for two scenarios: (a) with the lowest resolution features (high-level features), and (b) with the highest resolution features (low-level features). The red lines indicate the performance of NeuS, with lower values indicating better performance in terms of Chamfer Distance. High-resolution features generally outperform the low-resolution ones." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 485, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 485, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 132, + 485, + 482, + 641 + ], + "type": "text", + "content": "In-depth Discussions. As depicted in Fig. 4, when employing low-resolution features for the same model, the performance is noticeably worse compared to using high-resolution features. This is because projecting surface points onto low-resolution feature maps does not yield fine-grained effective features, thus hindering the geometry network from accurately learning the correct geometry. Furthermore, models optimized with high-resolution features from MIM, image classification, semantic segmentation, and monocular depth estimation only perform slightly better than the baseline NeuS [42]. For classification [4,26] and segmentation [47], we think that these pretext tasks focus on high-level semantic information that is not suitable for NSR. For MIM [11,15,46], the most concern is that the effective feature correlations are not fine-grained enough, which limits the performance. For the depth estimation task [19,33], we think that it shares little connection with NSR learning." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "content": "In contrast, models being optimized with feature priors from stereo matching, image matching, and MVS achieve good performance. These tasks share an" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 162, + 140, + 449, + 288 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 481, + 137 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 481, + 137 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 481, + 137 + ], + "type": "text", + "content": "Table 2: Quantitative results of CD (mm) on the EPFL dataset with different consistent losses. (Fou: Fountain, Her: Herzjesu)" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 162, + 140, + 449, + 288 + ], + "lines": [ + { + "bbox": [ + 162, + 140, + 449, + 288 + ], + "spans": [ + { + "bbox": [ + 162, + 140, + 449, + 288 + ], + "type": "table", + "html": "
ModelPre-TrainedConsistent LossFouHerMean
Match-NeuSQuadTree [38]Pixel Similarity1.2881.8321.560
Patch Similarity1.3881.7221.555
Patch NCC1.2061.6221.414
Patch SSIM1.2181.6781.448
MVS-NeuSMVSFormer [2]Pixel Similarity1.1991.6981.449
Patch Similarity1.2121.6891.451
Patch NCC1.2421.6461.444
Patch SSIM1.2611.7061.484
NeuralWarp [42]/Patch SSIM1.922.031.97
NeuS [42]//1.7415.6133.677
", + "image_path": "526f762368c2e28e23045b364fcd70c05cc145386a32d2d8e1af6d9567594d2d.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 300, + 482, + 577 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 482, + 577 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 482, + 577 + ], + "type": "text", + "content": "important common factor, i.e., matching feature similarity across different viewpoints, while the supervision is usually annotated by the depth captured from SfM [23] or specific devices [16]. Thus, low-level and fine-grained feature correlations should be considered in these manners. In general, using feature priors from the same task generally results in a similar performance. However, in the stereo matching task, there is a significant performance gap between IGEV [48] and RAFT-Stereo [24], even though these two models have a similar architecture except for the cost volume regularization. Specifically, IGEV builds the cost volume as a regularization module that encodes and denoises feature conflicts caused by occlusions and non-Lambertian in the image level through 3D CNNs. Although 3D cost volume addresses the issues from the 2D feature encoder, we clarify that it could not help to learn essentially better 2D feature representation. As evidence, features from IGEV achieve inferior performance than RAFT-Stereo, because of the lightweight local cost volume GRU in RAFT-Stereo [24], which releases the capacity of 2D features learned by the feature encoder. From Fig. 4, we observe that QuadTree [38] pre-trained with image matching and MVS methods [2,13] enhanced NeuS achieve much better results compared with others. As mentioned in Tab. 1, models pre-trained on these two tasks enjoy more fine-grained features (1/2 and 1:1). MVS methods are all pre-trained on the DTU dataset [16], while the matching method is pre-trained on the MegaDepth [23]. So MVS manners may suffer from a little data leakage in Fig. 4. To be fair, we further compare the performance of image matching and MVS on EPFL dataset in Sec. 4.2." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 595, + 354, + 608 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 595, + 354, + 608 + ], + "spans": [ + { + "bbox": [ + 131, + 595, + 354, + 608 + ], + "type": "text", + "content": "4.2 MVS and Image Matching based NSR" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "By incorporating features of pre-trained models such as MVSFormer [2] and QuadTree [38], our approach can generate variants of MVS-NeuS and Match-NeuS, respectively. Additionally, the evaluation is conducted on EPFL [36] and includes both pixel-wise and patch-wise losses." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 172, + 102, + 236, + 156 + ], + "blocks": [ + { + "bbox": [ + 172, + 102, + 236, + 156 + ], + "lines": [ + { + "bbox": [ + 172, + 102, + 236, + 156 + ], + "spans": [ + { + "bbox": [ + 172, + 102, + 236, + 156 + ], + "type": "image", + "image_path": "0a9918be8320b5aa2b8ea884dd747dc911892e025ed59aec47b0663118e732fa.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 182, + 159, + 218, + 167 + ], + "lines": [ + { + "bbox": [ + 182, + 159, + 218, + 167 + ], + "spans": [ + { + "bbox": [ + 182, + 159, + 218, + 167 + ], + "type": "text", + "content": "Pixel Similarity" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 237, + 102, + 299, + 158 + ], + "blocks": [ + { + "bbox": [ + 237, + 102, + 299, + 158 + ], + "lines": [ + { + "bbox": [ + 237, + 102, + 299, + 158 + ], + "spans": [ + { + "bbox": [ + 237, + 102, + 299, + 158 + ], + "type": "image", + "image_path": "f39ec3f0a09749a7c2453e2d0f3b87c5651874582caaef2066066bbff5f4dea0.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 253, + 159, + 288, + 167 + ], + "lines": [ + { + "bbox": [ + 253, + 159, + 288, + 167 + ], + "spans": [ + { + "bbox": [ + 253, + 159, + 288, + 167 + ], + "type": "text", + "content": "Patch Similarity" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 209, + 168, + 257, + 175 + ], + "lines": [ + { + "bbox": [ + 209, + 168, + 257, + 175 + ], + "spans": [ + { + "bbox": [ + 209, + 168, + 257, + 175 + ], + "type": "text", + "content": "Top-K View Selection" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 178, + 480, + 200 + ], + "lines": [ + { + "bbox": [ + 130, + 178, + 480, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 178, + 480, + 200 + ], + "type": "text", + "content": "Fig. 5: Qualitative results of different source view selecting strategies based on pixel similarity and patch similarity consistent losses in the Herzjesu of EPFL dataset." + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 308, + 101, + 371, + 158 + ], + "blocks": [ + { + "bbox": [ + 308, + 101, + 371, + 158 + ], + "lines": [ + { + "bbox": [ + 308, + 101, + 371, + 158 + ], + "spans": [ + { + "bbox": [ + 308, + 101, + 371, + 158 + ], + "type": "image", + "image_path": "f999ae6aa5c22dc9577d2f7a8cb637e31e0b89d9356d5d6d962d96005082fe59.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 321, + 159, + 354, + 167 + ], + "lines": [ + { + "bbox": [ + 321, + 159, + 354, + 167 + ], + "spans": [ + { + "bbox": [ + 321, + 159, + 354, + 167 + ], + "type": "text", + "content": "Pixel Similarity" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 346, + 168, + 395, + 175 + ], + "lines": [ + { + "bbox": [ + 346, + 168, + 395, + 175 + ], + "spans": [ + { + "bbox": [ + 346, + 168, + 395, + 175 + ], + "type": "text", + "content": "Nearby View Selection" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 375, + 102, + 437, + 157 + ], + "blocks": [ + { + "bbox": [ + 375, + 102, + 437, + 157 + ], + "lines": [ + { + "bbox": [ + 375, + 102, + 437, + 157 + ], + "spans": [ + { + "bbox": [ + 375, + 102, + 437, + 157 + ], + "type": "image", + "image_path": "34cc6e61567796fcd0341514db3beb4fae516b7f73774b6052eb5e2a665a1ef2.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 389, + 159, + 425, + 167 + ], + "lines": [ + { + "bbox": [ + 389, + 159, + 425, + 167 + ], + "spans": [ + { + "bbox": [ + 389, + 159, + 425, + 167 + ], + "type": "text", + "content": "Patch Similarity" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 207, + 482, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 207, + 482, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 207, + 482, + 363 + ], + "type": "text", + "content": "From Tab. 2, we find that the patch-wise NCC and SSIM could be successfully extended to feature level, and achieve better results compared with pixel similarity for Match-NeuS. Additionally, Match-NeuS with patch NCC outperforms MVS-NeuS, despite features from MVSFormer containing larger resolutions. As discussed in Sec. 4.1, the main reason for the better performance of Match-NeuS is that image matching models are pre-trained without the cost volume regularization, because no camera poses could be used to formulate the 3D cost volume. Furthermore, due to the prohibitive computation for the 3D CNN in the cost volume regularization, MVS methods should reduce the 2D feature channels for efficiency. Thus the matching-based QuadTree has 256 feature channels, while MVSformer only contains 8 feature channels with less capacity. In Fig. 6, we show that Match-NeuS with patch NCC recovers more detailed structures in Fountain, while reconstructing smoother walls." + } + ] + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 185, + 365, + 432, + 467 + ], + "blocks": [ + { + "bbox": [ + 185, + 365, + 432, + 467 + ], + "lines": [ + { + "bbox": [ + 185, + 365, + 432, + 467 + ], + "spans": [ + { + "bbox": [ + 185, + 365, + 432, + 467 + ], + "type": "image", + "image_path": "81de63365c043b25a92b46f1f473fe02be450721e8a890952e1f282b7381aec0.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 201, + 474, + 408, + 486 + ], + "lines": [ + { + "bbox": [ + 201, + 474, + 408, + 486 + ], + "spans": [ + { + "bbox": [ + 201, + 474, + 408, + 486 + ], + "type": "text", + "content": "Fig.6: Qualitative comparisons on EPFL dataset." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "table", + "bbox": [ + 179, + 529, + 432, + 586 + ], + "blocks": [ + { + "bbox": [ + 130, + 493, + 480, + 525 + ], + "lines": [ + { + "bbox": [ + 130, + 493, + 480, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 493, + 480, + 525 + ], + "type": "text", + "content": "Table 3: Ablation study of CD (mm) on matching features w/wo attention modules. We further compare them to the results of high-resolution features " + }, + { + "bbox": [ + 130, + 493, + 480, + 525 + ], + "type": "inline_equation", + "content": "(1 / 2)" + }, + { + "bbox": [ + 130, + 493, + 480, + 525 + ], + "type": "text", + "content": " without attention modules." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 179, + 529, + 432, + 586 + ], + "lines": [ + { + "bbox": [ + 179, + 529, + 432, + 586 + ], + "spans": [ + { + "bbox": [ + 179, + 529, + 432, + 586 + ], + "type": "table", + "html": "
ModelConsistent Loss Res.FountainHerzjesuMean
Match-NeuSPixel Similarity1/21.2881.832
Match-NeuSPixel Similarity1/81.6343.360
+ AttentionPixel Similarity1/81.5023.010
", + "image_path": "f07c52e822ddc91d3f163f7cf2b74aeeef8b7039f71fc440fe8629e234a5e7e5.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "table_body" + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "View Selection. We compare the view selection for both pixel-wise and patchwise losses in Fig. 5, From Fig. 5, the Top-k view selection mentioned in Sec. 3.2 fails to adaptively choose reasonable source views through pixel-wise feature similarity, resulting in poor reconstruction. Thus we need to manually select nearby source views to stabilize the training of pixel-wise feature similarity. However, the Top-k view selection based on patch-wise feature similarity can" + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 165, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 165, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 165, + 91, + 220, + 100 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 480, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 480, + 151 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 480, + 151 + ], + "type": "text", + "content": "achieve stable training and better reconstruction. Because local patches usually capture more information with larger perceptive fields, effectively addressing occlusion issues." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 482, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 482, + 260 + ], + "type": "text", + "content": "Features with Attention Modules. We observe that QuadTree employs the interleaved attention mechanism [38] including self and cross-attention modules. Attention modules enable explicit feature matching across different views and enhance the feature capacity. However, due to its high computational cost, the transformer layer is designed to refine only 1/8 feature scale. Hence this improvement fails to be transferred to high-resolution feature learning (1/2). We have presented a comparison in Tab. 3 to showcase this improvement. It is evident that by incorporating the features after attention learning, Match-NeuS improves its performance, but it still performs worse than high-resolution feature learning." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 276, + 454, + 288 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 276, + 454, + 288 + ], + "spans": [ + { + "bbox": [ + 132, + 276, + 454, + 288 + ], + "type": "text", + "content": "4.3 Extension of Feature Prior on Grid-based Representation." + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 196, + 296, + 419, + 412 + ], + "blocks": [ + { + "bbox": [ + 196, + 296, + 419, + 412 + ], + "lines": [ + { + "bbox": [ + 196, + 296, + 419, + 412 + ], + "spans": [ + { + "bbox": [ + 196, + 296, + 419, + 412 + ], + "type": "image", + "image_path": "e6a5ef65d8148da556aab6fc2ad06d7be2f7b39c2988c96f21d6be6e058d327a.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 178, + 423, + 434, + 435 + ], + "lines": [ + { + "bbox": [ + 178, + 423, + 434, + 435 + ], + "spans": [ + { + "bbox": [ + 178, + 423, + 434, + 435 + ], + "type": "text", + "content": "Fig. 7: Qualitative results of Neuralangelo with feature priors." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 439, + 482, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 439, + 482, + 511 + ], + "spans": [ + { + "bbox": [ + 130, + 439, + 482, + 511 + ], + "type": "text", + "content": "We incorporate feature priors into grid-based Neuralangelo [22] as in Fig 7. Specifically, we train Neuralangelo with MVSFormer feature priors on DTU dataset for " + }, + { + "bbox": [ + 130, + 439, + 482, + 511 + ], + "type": "inline_equation", + "content": "300\\mathrm{k}" + }, + { + "bbox": [ + 130, + 439, + 482, + 511 + ], + "type": "text", + "content": " iterations. The inclusion of MVS features enhances the accuracy of geometry and accelerates convergence, especially in intricate objects like scissors' handles in Scan37 and the snowman in Scan69. Moreover, Neuralangelo with feature priors achieves smoother flat surfaces in Scan40 and Scan63." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 527, + 322, + 540 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 527, + 322, + 540 + ], + "spans": [ + { + "bbox": [ + 131, + 527, + 322, + 540 + ], + "type": "text", + "content": "4.4 Full Models Compared on DTU" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "We compare MVS-NeuS and Match-NeuS with patch NCC as the consistent loss to other competitors on 15 scenes in the DTU dataset. Tab. 4 shows the quantitative results. Notably, our methods outperform other competitors by a large margin. Furthermore, we observed the qualitative results in Fig. 8 that our method can accurately reconstruct the geometry of these scenes. Specifically, our method is capable of not only modeling smooth flat planes but also clearly capturing gaps between two planes or the handle of scissors. In contrast, many other methods tend to fuse together in Scan37 with obvious artifacts. Quantitative results in Tab. 4 show that our model significantly outperforms other competing approaches." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 145, + 112, + 474, + 293 + ], + "blocks": [ + { + "bbox": [ + 145, + 112, + 474, + 293 + ], + "lines": [ + { + "bbox": [ + 145, + 112, + 474, + 293 + ], + "spans": [ + { + "bbox": [ + 145, + 112, + 474, + 293 + ], + "type": "image", + "image_path": "792e9a07e724d827f078d24a206e1f42a14a990f286aec4b5fd4defc166f156a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 177, + 307, + 436, + 319 + ], + "lines": [ + { + "bbox": [ + 177, + 307, + 436, + 319 + ], + "spans": [ + { + "bbox": [ + 177, + 307, + 436, + 319 + ], + "type": "text", + "content": "Fig. 8: Comparisons of surface reconstruction in DTU dataset." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 135, + 370, + 479, + 506 + ], + "blocks": [ + { + "bbox": [ + 132, + 326, + 482, + 369 + ], + "lines": [ + { + "bbox": [ + 132, + 326, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 482, + 369 + ], + "type": "text", + "content": "Table 4: Results of CD (mm) compared on DTU dataset (lower is better). The upper part methods enjoy additional annotations such as masks (IDR and COLMAP) or custom filtering (MVSDF). Note that the results of GeoNeuS* are re-trained by ourselves, The best results are in bold." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 370, + 479, + 506 + ], + "lines": [ + { + "bbox": [ + 135, + 370, + 479, + 506 + ], + "spans": [ + { + "bbox": [ + 135, + 370, + 479, + 506 + ], + "type": "table", + "html": "
Scan243740556365698397105106110114118122Mean
COLMAP [35]0.450.910.370.370.901.000.541.221.080.640.480.590.320.450.430.65
MVSDF [56]0.931.750.880.441.110.900.751.261.021.350.870.840.340.470.470.88
IDR [52]1.631.870.630.481.040.790.771.331.160.760.670.900.420.510.530.90
NeRF [28]1.901.601.850.582.281.271.471.672.051.070.882.531.061.150.961.49
NeuS [42]1.371.210.730.401.200.700.721.011.160.820.661.690.390.490.510.87
VolSDF [51]1.141.260.810.491.250.700.721.291.180.700.661.080.420.610.550.86
NeuralWarp [6]0.490.710.380.380.790.810.821.201.060.680.660.740.410.630.510.68
GeoNeuS* [9]0.400.690.360.370.790.780.481.170.880.600.500.730.300.390.410.59
D-NeuS [3]0.440.790.350.390.880.580.551.350.910.760.400.720.310.390.390.61
PET-NeuS [44]0.560.750.680.360.870.760.691.331.080.660.511.040.340.510.480.71
MVS-NeuS0.370.630.310.320.790.510.501.120.870.620.460.640.290.380.410.548
Match-NeuS0.390.670.320.330.790.510.491.210.870.630.480.710.290.380.410.565
", + "image_path": "a540bbd59e1e7f41de2f1e6db695d3995ca34e349b62bf9b3157a6617c0a2d4b.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 519, + 220, + 532 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 519, + 220, + 532 + ], + "spans": [ + { + "bbox": [ + 132, + 519, + 220, + 532 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 665 + ], + "type": "text", + "content": "In this paper, we conducted an evaluation of various pretext tasks and consistent losses for NSR. Our findings showed that the feature priors from some pretext visual tasks including MVS and image matching can significantly improve the NSR performance. We also empirically observed that features with higher resolution consistently outperform the lower ones. Additionally, we further explored optimizing MVS and image matching enhanced NSR with both pixel-wise and patch-wise consistent losses. The results showed that the patch-wise consistent loss could be successfully generalized to the feature level and achieve superior reconstruction for the matching-based Match-NeuS." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 482, + 232 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 482, + 232 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 482, + 232 + ], + "type": "text", + "content": "This work was supported in part by the National Natural Science Foundation of China under Grant 62076067 and Shanghai Municipal Science and Technology Major Project (NO. 2021SHZDZX0103). This work was performed using the CFFF platform of Fudan University. Yanwei Fu is with School of Data Science, Fudan ISTBI—ZJNU Algorithm Centre for Brain-inspired Intelligence, Fudan University, Shanghai Key Lab of Intelligent Information Processing, and Technology Innovation Center of Calligraphy and Painting Digital Generation, Ministry of Culture and Tourism, China. Email: yanweifu@fudan.edu.cn" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 247, + 197, + 260 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 247, + 197, + 260 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 197, + 260 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 269, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 269, + 480, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 269, + 480, + 300 + ], + "spans": [ + { + "bbox": [ + 138, + 269, + 480, + 300 + ], + "type": "text", + "content": "1. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 302, + 480, + 322 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 302, + 480, + 322 + ], + "spans": [ + { + "bbox": [ + 138, + 302, + 480, + 322 + ], + "type": "text", + "content": "2. Cao, C., Ren, X., Fu, Y.: Mvsformer: Multi-view stereo by learning robust image features and temperature-based depth. Transactions of Machine Learning Research" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 323, + 480, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 323, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 138, + 323, + 480, + 354 + ], + "type": "text", + "content": "3. Chen, D., Zhang, P., Feldmann, I., Schreer, O., Eisert, P.: Recovering fine details for neural implicit surface reconstruction. In: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision. pp. 4330-4339 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 355, + 480, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 355, + 480, + 386 + ], + "spans": [ + { + "bbox": [ + 138, + 355, + 480, + 386 + ], + "type": "text", + "content": "4. Chu, X., Tian, Z., Wang, Y., Zhang, B., Ren, H., Wei, X., Xia, H., Shen, C.: Twins: Revisiting the design of spatial attention in vision transformers. Advances in Neural Information Processing Systems 34, 9355-9366 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 387, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 387, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 387, + 480, + 418 + ], + "type": "text", + "content": "5. Dai, Y., Zhu, Z., Rao, Z., Li, B.: Mvs2: Deep unsupervised multi-view stereo with multi-view symmetry. In: 2019 International Conference on 3D Vision (3DV). pp. 1-8. IEEE (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 419, + 480, + 461 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 419, + 480, + 461 + ], + "spans": [ + { + "bbox": [ + 138, + 419, + 480, + 461 + ], + "type": "text", + "content": "6. Darmon, F., Bascle, B., Devaux, J.C., Monasse, P., Aubry, M.: Improving neural implicit surfaces geometrym fan with patch warping. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6260-6269 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 462, + 480, + 494 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 462, + 480, + 494 + ], + "spans": [ + { + "bbox": [ + 138, + 462, + 480, + 494 + ], + "type": "text", + "content": "7. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 495, + 480, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 495, + 480, + 515 + ], + "spans": [ + { + "bbox": [ + 138, + 495, + 480, + 515 + ], + "type": "text", + "content": "8. Drebin, R.A., Carpenter, L., Hanrahan, P.: Volume rendering. ACM Siggraph Computer Graphics 22(4), 65-74 (1988)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 516, + 480, + 547 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 516, + 480, + 547 + ], + "spans": [ + { + "bbox": [ + 138, + 516, + 480, + 547 + ], + "type": "text", + "content": "9. Fu, Q., Xu, Q., Ong, Y.S., Tao, W.: Geo-neus: geometry-consistent neural implicit surfaces learning for multi-view reconstruction. arXiv preprint arXiv:2205.15848 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 548, + 480, + 579 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 548, + 480, + 579 + ], + "spans": [ + { + "bbox": [ + 134, + 548, + 480, + 579 + ], + "type": "text", + "content": "10. Galliani, S., Lasinger, K., Schindler, K.: Massively parallel multiview stereopsis by surface normal diffusion. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 873-881 (2015)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 580, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 580, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 134, + 580, + 480, + 600 + ], + "type": "text", + "content": "11. Gao, P., Ma, T., Li, H., Dai, J., Qiao, Y.: Convmae: Masked convolution meets masked autoencoders. arXiv preprint arXiv:2205.03892 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 601, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 601, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 134, + 601, + 480, + 621 + ], + "type": "text", + "content": "12. Gropp, A., Yariv, L., Haim, N., Atzmon, M., Lipman, Y.: Implicit geometric regularization for learning shapes. arXiv preprint arXiv:2002.10099 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 622, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 622, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 622, + 480, + 665 + ], + "type": "text", + "content": "13. Gu, X., Fan, Z., Zhu, S., Dai, Z., Tan, F., Tan, P.: Cascade cost volume for high-resolution multi-view stereo and stereo matching. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 2495-2504 (2020)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 192, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 160 + ], + "type": "text", + "content": "14. Guo, H., Peng, S., Lin, H., Wang, Q., Zhang, G., Bao, H., Zhou, X.: Neural 3d scene reconstruction with the manhattan-world assumption. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5511-5520 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 160, + 481, + 193 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 160, + 481, + 193 + ], + "spans": [ + { + "bbox": [ + 133, + 160, + 481, + 193 + ], + "type": "text", + "content": "15. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16000-16009 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 193, + 481, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 193, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 133, + 193, + 481, + 224 + ], + "type": "text", + "content": "16. Jensen, R., Dahl, A., Vogiatzis, G., Tola, E., Aanæs, H.: Large scale multi-view stereopsis evaluation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 406-413 (2014)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 224, + 481, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 481, + 246 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 481, + 246 + ], + "type": "text", + "content": "17. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Transactions on Graphics (ToG) 32(3), 1-13 (2013)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 246, + 481, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 246, + 481, + 278 + ], + "spans": [ + { + "bbox": [ + 132, + 246, + 481, + 278 + ], + "type": "text", + "content": "18. Khot, T., Agrawal, S., Tulsiani, S., Mertz, C., Lucey, S., Hebert, M.: Learning unsupervised multi-view stereopsis via robust photometric consistency. arXiv preprint arXiv:1905.02706 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 278, + 481, + 310 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 278, + 481, + 310 + ], + "spans": [ + { + "bbox": [ + 132, + 278, + 481, + 310 + ], + "type": "text", + "content": "19. Kim, D., Ka, W., Ahn, P., Joo, D., Chun, S., Kim, J.: Global-local path networks for monocular depth estimation with vertical cutdepth. arXiv preprint arXiv:2201.07436 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 310, + 481, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 310, + 481, + 342 + ], + "spans": [ + { + "bbox": [ + 132, + 310, + 481, + 342 + ], + "type": "text", + "content": "20. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 342, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 342, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 342, + 481, + 374 + ], + "type": "text", + "content": "21. Labatut, P., Pons, J.P., Keriven, R.: Efficient multi-view reconstruction of large-scale scenes using interest points, delaunay triangulation and graph cuts. In: 2007 IEEE 11th international conference on computer vision. pp. 1-8. IEEE (2007)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 374, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 374, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 374, + 481, + 418 + ], + "type": "text", + "content": "22. Li, Z., Müller, T., Evans, A., Taylor, R.H., Unberath, M., Liu, M.Y., Lin, C.H.: Neuralangelo: High-fidelity neural surface reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8456-8465 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 418, + 481, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 481, + 450 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 481, + 450 + ], + "type": "text", + "content": "23. Li, Z., Snavely, N.: Megadepth: Learning single-view depth prediction from internet photos. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 2041-2050 (2018)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 450, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 450, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 132, + 450, + 481, + 482 + ], + "type": "text", + "content": "24. Lipson, L., Teed, Z., Deng, J.: Raft-stereo: Multilevel recurrent field transforms for stereo matching. In: 2021 International Conference on 3D Vision (3DV). pp. 218-227. IEEE (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "spans": [ + { + "bbox": [ + 132, + 482, + 481, + 525 + ], + "type": "text", + "content": "25. Liu, S., Zhang, Y., Peng, S., Shi, B., Pollefeys, M., Cui, Z.: Dist: Rendering deep implicit signed distance function with differentiable sphere tracing. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2019-2028 (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 481, + 557 + ], + "type": "text", + "content": "26. Liu, Z., Mao, H., Wu, C.Y., Feichtenhofer, C., Darrell, T., Xie, S.: A convnet for the 2020s. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 557, + 481, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 481, + 601 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 481, + 601 + ], + "type": "text", + "content": "27. Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., Geiger, A.: Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4460-4470 (2019)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "type": "text", + "content": "28. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. Communications of the ACM 65(1), 99-106 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "text", + "content": "29. Müller, T., Evans, A., Schied, C., Keller, A.: Instant neural graphics primitives with a multiresolution hash encoding. ACM Transactions on Graphics (ToG) 41(4), 1-15 (2022)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 100 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "30. Mur-Artal, R., Tardós, J.D.: Orb-slam2: An open-source slam system for monoc- \ncular, stereo, and rgb-d cameras. IEEE transactions on robotics 33(5), 1255-1262 (2017)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 151, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 151, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 132, + 151, + 481, + 194 + ], + "type": "text", + "content": "31. Niemeyer, M., Mescheder, L., Oechsle, M., Geiger, A.: Differentiable volumetric rendering: Learning implicit 3d representations without 3d supervision. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3504-3515 (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 132, + 195, + 481, + 228 + ], + "type": "text", + "content": "32. Oechsle, M., Peng, S., Geiger, A.: Unisurf: Unifying neural implicit surfaces and radiance fields for multi-view reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 5589-5599 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 229, + 481, + 272 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 229, + 481, + 272 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 481, + 272 + ], + "type": "text", + "content": "33. Ranftl, R., Lasinger, K., Hafner, D., Schindler, K., Koltun, V.: Towards robust monocular depth estimation: Mixing datasets for zero-shot cross-dataset transfer. IEEE transactions on pattern analysis and machine intelligence 44(3), 1623-1637 (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 306 + ], + "type": "text", + "content": "34. Schonberger, J.L., Frahm, J.M.: Structure-from-motion revisited. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4104-4113 (2016)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 307, + 481, + 350 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 307, + 481, + 350 + ], + "spans": [ + { + "bbox": [ + 132, + 307, + 481, + 350 + ], + "type": "text", + "content": "35. Schonberger, J.L., Zheng, E., Frahm, J.M., Pollefeys, M.: Pixelwise view selection for unstructured multi-view stereo. In: Computer Vision-ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part III 14. pp. 501-518. Springer (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 352, + 481, + 395 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 352, + 481, + 395 + ], + "spans": [ + { + "bbox": [ + 132, + 352, + 481, + 395 + ], + "type": "text", + "content": "36. Strecha, C., Von Hansen, W., Van Gool, L., Fua, P., Thoennessen, U.: On benchmarking camera calibration and multi-view stereo for high resolution imagery. In: 2008 IEEE conference on computer vision and pattern recognition. pp. 1-8. IEEE (2008)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 429 + ], + "type": "text", + "content": "37. Sun, C., Sun, M., Chen, H.T.: Direct voxel grid optimization: Super-fast convergence for radiance fields reconstruction. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5459-5469 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 430, + 481, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 481, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 481, + 452 + ], + "type": "text", + "content": "38. Tang, S., Zhang, J., Zhu, S., Tan, P.: Quadtree attention for vision transformers. ICLR (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 453, + 481, + 474 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 481, + 474 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 481, + 474 + ], + "type": "text", + "content": "39. Teed, Z., Deng, J.: Deepv2d: Video to depth with differentiable structure from motion. arXiv preprint arXiv:1812.04605 (2018)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 475, + 481, + 507 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 481, + 507 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 481, + 507 + ], + "type": "text", + "content": "40. Vijayanarasimhan, S., Ricco, S., Schmid, C., Sukthankar, R., Fragkiadaki, K.: Sfnet: Learning of structure and motion from video. arXiv preprint arXiv:1704.07804 (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 509, + 481, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 531 + ], + "type": "text", + "content": "41. Wang, J., Bleja, T., Agapito, L.: Go-surf: Neural feature grid optimization for fast, high-fidelity rgb-d surface reconstruction. arXiv preprint arXiv:2206.14735 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 532, + 481, + 563 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 532, + 481, + 563 + ], + "spans": [ + { + "bbox": [ + 132, + 532, + 481, + 563 + ], + "type": "text", + "content": "42. Wang, P., Liu, L., Liu, Y., Theobalt, C., Komura, T., Wang, W.: Neus: Learning neural implicit surfaces by volume rendering for multi-view reconstruction. arXiv preprint arXiv:2106.10689 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 565, + 481, + 597 + ], + "type": "text", + "content": "43. Wang, Y., Skorokhodov, I., Wonka, P.: Hf-neus: Improved surface reconstruction using high-frequency details. Advances in Neural Information Processing Systems 35, 1966-1978 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 599, + 481, + 631 + ], + "type": "text", + "content": "44. Wang, Y., Skorokhodov, I., Wonka, P.: Pet-neus: Positional encoding tri-planes for neural surfaces. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 12598-12607 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "45. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 193, + 91, + 445, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 193, + 91, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 193, + 91, + 445, + 102 + ], + "type": "text", + "content": "Improving Neural Surface Reconstruction with Feature Priors" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 491 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "46. Weinzaepfel, P., Leroy, V., Lucas, T., Brégier, R., Cabon, Y., Arora, V., Antsfeld, L., Chidlovskii, B., Csurka, G., Revaud, J.: Croco: Self-supervised pre-training for 3d vision tasks by cross-view completion. arXiv preprint arXiv:2210.10716 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 182 + ], + "type": "text", + "content": "47. Xie, E., Wang, W., Yu, Z., Anandkumar, A., Alvarez, J.M., Luo, P.: Segformer: Simple and efficient design for semantic segmentation with transformers. Advances in Neural Information Processing Systems 34, 12077-12090 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 182, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 481, + 205 + ], + "type": "text", + "content": "48. Xu, G., Wang, X., Ding, X., Yang, X.: Iterative geometry encoding volume for stereo matching. arXiv preprint arXiv:2303.06615 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "text", + "content": "49. Xu, Q., Wang, W., Ceylan, D., Mech, R., Neumann, U.: Disn: Deep implicit surface network for high-quality single-view 3d reconstruction. Advances in neural information processing systems 32 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "type": "text", + "content": "50. Yang, Z., Wang, P., Xu, W., Zhao, L., Nevatia, R.: Unsupervised learning of geometry from videos with edge-aware depth-normal consistency. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 32 (2018)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 270, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 481, + 293 + ], + "type": "text", + "content": "51. Yariv, L., Gu, J., Kasten, Y., Lipman, Y.: Volume rendering of neural implicit surfaces. Advances in Neural Information Processing Systems 34, 4805-4815 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 325 + ], + "type": "text", + "content": "52. Yariv, L., Kasten, Y., Moran, D., Galun, M., Atzmon, M., Ronen, B., Lipman, Y.: Multiview neural surface reconstruction by disentangling geometry and appearance. Advances in Neural Information Processing Systems 33, 2492-2502 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 325, + 481, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 325, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 132, + 325, + 481, + 358 + ], + "type": "text", + "content": "53. Yi, X., Zhou, Y., Habermann, M., Golyanik, V., Pan, S., Theobalt, C., Xu, F.: Ecolocate: Real-time motion capture, localization, and mapping with sparse body-mounted sensors. arXiv preprint arXiv:2305.01599 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 358, + 481, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 391 + ], + "type": "text", + "content": "54. Yu, Z., Peng, S., Niemeyer, M., Sattler, T., Geiger, A.: Monosdf: Exploring monocular geometric cues for neural implicit surface reconstruction. arXiv preprint arXiv:2206.00665 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 391, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 391, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 391, + 481, + 413 + ], + "type": "text", + "content": "55. Zhang, J., Yao, Y., Li, S., Luo, Z., Fang, T.: Visibility-aware multi-view stereo network. arXiv preprint arXiv:2008.07928 (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 413, + 481, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 481, + 446 + ], + "type": "text", + "content": "56. Zhang, J., Yao, Y., Quan, L.: Learning signed distance field for multi-view surface reconstruction. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 6525-6534 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 446, + 481, + 491 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 491 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 491 + ], + "type": "text", + "content": "57. Zhang, K., Luan, F., Wang, Q., Bala, K., Snavely, N.: Physg: Inverse rendering with spherical gaussians for physics-based material editing and relighting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5453-5462 (2021)" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "X. Ren et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_content_list.json b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..248f35c5b1dc7a8ec5c929602f03e0755b91f2b4 --- /dev/null +++ b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_content_list.json @@ -0,0 +1,1820 @@ +[ + { + "type": "text", + "text": "Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance", + "text_level": 1, + "bbox": [ + 225, + 140, + 779, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "I-Hsiang Chen $^{1}$ , Wei-Ting Chen $^{1,2}$ , Yu-Wei Liu $^{1}$ , Ming-Hsuan Yang $^{2,3}$ , and Sy-Yen Kuo $^{1,4}$", + "bbox": [ + 228, + 210, + 774, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ National Taiwan University, Taiwan", + "bbox": [ + 374, + 253, + 630, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 University of California at Merced, USA", + "bbox": [ + 359, + 268, + 642, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 Google DeepMind, USA", + "bbox": [ + 411, + 282, + 589, + 296 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "4 Chang Gung University, Taiwan", + "bbox": [ + 387, + 296, + 614, + 310 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{f09921058,f05943089,r12943109}@ntu.edu.tw, mhyang@ucmerced.edu,", + "bbox": [ + 254, + 311, + 746, + 325 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "sykuo@ntu.edu.tw", + "bbox": [ + 437, + 325, + 565, + 337 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Crowd counting and localization have become increasingly important in computer vision due to their wide-ranging applications. While point-based strategies have been widely used in crowd counting methods, they face a significant challenge, i.e., the lack of an effective learning strategy to guide the matching process. This deficiency leads to instability in matching point proposals to target points, adversely affecting overall performance. To address this issue, we introduce an effective approach to stabilize the proposal-target matching in point-based methods. We propose Auxiliary Point Guidance (APG) to provide clear and effective guidance for proposal selection and optimization, addressing the core issue of matching uncertainty. Additionally, we develop Implicit Feature Interpolation (IFI) to enable adaptive feature extraction in diverse crowd scenarios, further enhancing the model's robustness and accuracy. Extensive experiments demonstrate the effectiveness of our approach, showing significant improvements in crowd counting and localization performance, particularly under challenging conditions.", + "bbox": [ + 259, + 378, + 743, + 599 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Crowd Counting, Crowd Localization, Auxiliary Learning, Feature Interpolation", + "bbox": [ + 259, + 613, + 740, + 642 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 691, + 377, + 708 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recent years have witnessed the advances and importance of crowd counting and localization in numerous tasks, including surveillance, event management, and urban planning [1,8,14,18,21,22,27,46,48]. The pursuit of accurately estimating crowd size and discerning individual locations is fraught with challenges, ranging from fluctuating crowd densities and occlusions to varying environmental settings.", + "bbox": [ + 212, + 724, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "footer", + "text": "Project page: https://apgcc.github.io/", + "bbox": [ + 230, + 825, + 491, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/0e3338a5cd9aaee42c69b2729dcce790390aa1a1a5ac90892ba31c619883740e.jpg", + "image_caption": [ + "Fig. 1: (Left) Crowd Counting and Localization: Comparison with state-of-the-art methods (e.g., LSC-CNN [39], TopoCount [1], P2PNet [43] and CLTR [20]) demonstrating the proposed APGCC's effectiveness in accurately counting and localizing in crowded scenes. (Right) Matching Process Instability: Illustrates the instability in selecting point proposals during the matching process by existing point-based methods (e.g., Matcher [16]) across training epochs, indicated by the Instability Rate (IR), which measures the inconsistency rate of point proposal selection per epoch, leading to limited performance. Both evaluations are conducted on the ShanghaiTech A (SHHA) [53] dataset." + ], + "image_footnote": [], + "bbox": [ + 259, + 147, + 496, + 313 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/e9e399ff79d8c55d2f528361ef60b8d05ffa68e757d2fa8a6500396e48827228.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 496, + 146, + 736, + 311 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Within the domain of crowd analysis, two principal methodologies emerge: map-based and localization-based approaches. Map-based methods, employing Gaussian kernels to render density maps, effectively provide models with critical information for learning crowd densities. Renowned for their high accuracy in crowd counting, these methods have been validated across a series of studies, including [11,14,25,26,28,31]. Despite their capacity to achieve localization through additional designs [1,13,46], they still confront challenges such as the overlapping of maps in densely populated areas and the need for multi-scale representations. This leads to difficulties in precise localization with non-differentiable post-processing techniques like \"find-maxima\".", + "bbox": [ + 212, + 488, + 787, + 638 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Localization-based approaches encompass two divergent strategies: detection-based and point-based methods. Detection-based techniques [29, 39], characterized by the initiation of pseudo ground truth bounding boxes using nearest-neighbor distances, are tailored for specific scenarios but encounter accuracy limitations in highly congested and sparse areas. Despite their practicality, these methods often contend with the constraints of heuristic post-processing, such as non-maximum suppression, potentially leading to inaccuracies [20].", + "bbox": [ + 212, + 641, + 787, + 747 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In contrast, the elegance of point-based methods [20, 24, 43] lies in directly using point annotations as learning targets. These frameworks can direct the regression of individual coordinates, simplifying the localization process. These methods are celebrated for their simplicity, end-to-end trainability, and independence from complex pre-processing and multi-scale feature map fusion. However, a significant challenge in point-based methods for crowd analysis is the insta", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "bility of proposal-target matching during training, as illustrated in Figure 1. In each epoch, a large proportion of target points are matched with different point proposals compared to the previous epoch. This issue arises due to the absence of an effective learning strategy to guide the network in consistently selecting the most appropriate proposals during optimization. Consequently, the constantly changing relationships between proposals and targets lead to vague and unclear learning objectives for each proposal. This uncertainty in the learning process often results in localized inaccuracies, manifesting as either underestimation or overestimation in specific areas of crowded scenes.", + "bbox": [ + 212, + 146, + 787, + 282 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this paper, we address the prevailing issue of uncertainty in proposal-target matching within point-based methods for crowd analysis. We introduce a novel learning paradigm, Auxiliary Point Guidance Crowd Counting (APGCC), designed to instruct the network on the precise selection and optimization of point proposals for matching with target points. APGCC provides a clear and effective directive, ensuring accurate and informed decisions in the proposal selection and optimization process.", + "bbox": [ + 212, + 282, + 787, + 387 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To facilitate the application of APGCC, which necessitates feature extraction at arbitrary positions, we propose a method utilizing Implicit Feature Interpolation. This technique adeptly addresses the challenge of accessing features from diverse locations within the network, thereby ensuring the versatility and efficacy of our model in various crowd scenarios. By enhancing the robustness of the matching relationships between proposals and targets, our approach significantly improves the precision and reliability of crowd analysis models.", + "bbox": [ + 212, + 388, + 787, + 492 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Extensive experimental results demonstrate that the proposed APG strategy effectively addresses the instability issues in proposal-target matching during the training process (orange curve in Figure 1). Moreover, it significantly enhances the performance of crowd counting. Our method performs robustly and favorably against state-of-the-art schemes in both crowd counting and localization tasks. We make the following contributions in this work:", + "bbox": [ + 212, + 493, + 787, + 583 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We introduce Auxiliary Point Guidance, a novel strategy to address the uncertainty in proposal-target matching within point-based crowd counting methods. APG guides the precise selection and optimization of proposals, enhancing model accuracy.", + "- We develop an Implicit Feature Interpolation method, enabling effective feature extraction at arbitrary positions. This technique improves the robustness and versatility of our model, particularly in various crowd scenarios." + ], + "bbox": [ + 222, + 584, + 785, + 689 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 214, + 713, + 387, + 729 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In the realm of crowd counting, methodologies are broadly categorized into map-based [2, 2, 11, 14, 18, 25, 25, 26, 28, 31, 33, 49] and localization-based approaches [17, 19, 23, 29, 39], each with distinct strategies and challenges.", + "bbox": [ + 212, + 744, + 785, + 792 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Map-based Approaches use Gaussian kernel density maps to achieve localization and counting. Pioneered by researchers like Idrees et al. [13] and Gao et al. [8], these methods identify individual positions as peaks on density maps.", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "However, they encounter challenges with overlapping in dense crowds. Innovations such as the Distance Label Map [51], Focal Inverse Distance Transform Map (FIDTM) [21], and Independent Instance Map (IIM) [9] have been introduced to mitigate these issues, though they still require complex post-processing steps. Concurrently, these approaches also advance crowd counting accuracy by integrating density map values, with enhancements like composition loss [13] and inter-domain feature segregation [8]. These approaches successfully reduce overlaps in crowded areas, yet they require a post-processing step, such as \"find-maxima\", to pinpoint individual locations. Additionally, their reliance on multiscale feature maps adds to their complexity, detracting from their simplicity and elegance.", + "bbox": [ + 212, + 146, + 787, + 311 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Localization-based Approaches: In crowd analysis, localization-based methods integrate both detection-based and point-based strategies. Detection-based approaches, utilizing frameworks like Faster RCNN [37], focus on generating pseudo bounding boxes using techniques such as nearest neighbor distance, as seen in [39], and a winner-take-all loss for refining box selection, especially beneficial for high-resolution images. Liu et al. [29] employs curriculum learning to enhance detection and bounding box prediction accuracy. However, these methods often contend with the challenge of pseudo-ground-truth boxes derived from weak point supervision, which can be particularly unreliable in densely populated areas, thus impeding model training and leading to imprecise box predictions. Additionally, they typically involve Non-Maximum Suppression (NMS) in their box filtering process, which is not designed for end-to-end training [48].", + "bbox": [ + 212, + 315, + 787, + 496 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In contrast, point-based approaches like those proposed by Song et al. [43] (P2PNet), Liang et al. [20] (CLTR), and Liu et al. [24] (PET) emphasize directly estimating individual head positions, dynamically adjusting to various crowd densities. These methods significantly enhance the accuracy and process efficiency of localization tasks. Nevertheless, their performance can be limited by the instability of proposal-target matching during training, often leading to regional underestimation or overestimation due to unclear learning objectives for proposals.", + "bbox": [ + 212, + 497, + 787, + 617 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Preliminary: Point-based Crowd Counting Framework", + "text_level": 1, + "bbox": [ + 214, + 638, + 774, + 657 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "This framework [43] comprises three main components essential for point-based crowd counting: Point Proposal Prediction, Proposal-Target Matching, and Loss Calculation.", + "bbox": [ + 212, + 670, + 785, + 715 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Point Proposal Prediction involves generating point proposals from the deep feature map $\\mathcal{F}_s$ outputted by the backbone network, where $s$ is the downsampling stride, and $\\mathcal{F}_s$ has a size of $H\\times W$ . The process includes two parallel branches: regression for predicting point coordinate offsets and classification for determining confidence scores. Each pixel on $\\mathcal{F}_s$ corresponds to a patch in the input image, with a predefined set of reference points $\\mathcal{R} = R_k|k\\in \\{1,\\dots,K\\}$ where $K$ is the total number of reference points. The regression branch outputs $H\\times W\\times K$ point proposals, with the coordinates of a proposal $\\hat{p}_j = (\\hat{x}_j,\\hat{y}_j)$", + "bbox": [ + 212, + 719, + 787, + 842 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "calculated as: $\\hat{x}_j = x_k + \\gamma \\Delta_{jx}^k$ and $\\hat{y}_j = y_k + \\gamma \\Delta_{jy}^k$ where $\\gamma$ scales the predicted offsets, $\\Delta_{jx}^k$ and $\\Delta_{jy}^k$ present predicted offsets for its coordinates of a proposal $\\hat{p}_j = (\\hat{x}_j, \\hat{y}_j)$ .", + "bbox": [ + 212, + 145, + 782, + 194 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Proposal-Target Matching follows the Point Proposal Prediction, utilizing the Hungarian algorithm [16] as proposal-target matching $\\mathcal{O}(\\mathcal{P},\\hat{\\mathcal{P}},\\mathcal{D})$ . This strategy ensures a one-to-one correspondence where each ground truth target from $\\mathcal{P}$ is matched with a point proposal in $\\hat{\\mathcal{P}}$ . The matching is based on the pair-wise cost matrix $\\mathcal{D}$ of size $N\\times M$ where $N$ and $M$ denote the number of ground truth points and point proposals. The matrix $\\mathcal{D}$ combines the Euclidean distance between point pairs and the confidence score $\\hat{c}_j$ of each proposal, defined as $D(P,\\hat{P}) = \\left(\\tau ||p_i - \\hat{p}_j||_2 - \\hat{c}_j\\right)_{i\\in N,j\\in M}$ , where $\\tau$ balances the pixel distance and $\\hat{c}_j$ is the confidence score of proposal $\\hat{p}_j$ .", + "bbox": [ + 212, + 196, + 784, + 335 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "After the matching process, in the optimal matching results denoted as $\\Theta$ , each ground truth point $p_i$ is optimally matched to a point proposal $\\hat{p}_j$ , with the matching result represented by the permutation $\\psi = \\Theta(\\mathcal{P}, \\hat{\\mathcal{P}}, \\mathcal{D})$ . Thus, $\\hat{p}_{\\psi(i)}$ is the proposal matched to ground truth point $p_i$ . The set of matched proposals, $\\hat{\\mathcal{P}}\\mathrm{pos} = \\hat{p}_{\\psi(i)}|i \\in \\{1, \\dots, N\\}$ , are considered positives, while the unmatched ones, $\\hat{\\mathcal{P}}\\mathrm{neg} = \\hat{p}_{\\psi(i)}|i \\in \\{N + 1, \\dots, M\\}$ , are negatives.", + "bbox": [ + 212, + 335, + 782, + 431 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Loss Calculation integrates Euclidean loss $\\mathcal{L}_{loc}$ for point regression and Cross Entropy loss $\\mathcal{L}_{cls}$ for proposal classification. The combined loss function $\\mathcal{L}_{point}$ is:", + "bbox": [ + 212, + 434, + 782, + 477 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {c l s} = - \\frac {1}{M} \\left(\\sum_ {i = 1} ^ {N} \\log \\hat {c} _ {\\psi (i)} + \\lambda_ {1} \\sum_ {i = N + 1} ^ {M} \\log \\left(1 - \\hat {c} _ {\\psi (i)}\\right)\\right), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 313, + 478, + 782, + 517 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {l o c} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\left| \\left| p _ {i} - \\hat {p} _ {\\psi (i)} \\right| \\right| _ {2} ^ {2}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 401, + 527, + 782, + 566 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {p o i n t}} = \\mathcal {L} _ {\\text {c l s}} + \\lambda_ {2} \\mathcal {L} _ {\\text {l o c}}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 580, + 782, + 595 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\hat{c}_{\\psi(i)}$ is the confidence score of the matched proposal $\\hat{p}_{\\psi(i)}$ , $\\lambda_1$ adjusts the impact of negative proposals, and $\\lambda_2$ balances the regression loss.", + "bbox": [ + 212, + 601, + 782, + 632 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 Proposed Method", + "text_level": 1, + "bbox": [ + 214, + 654, + 426, + 672 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "While current Point-based Approaches demonstrate promising results in crowd counting and localization, we identified instability in the optimization of the matching process, potentially limiting overall performance. We introduce several components designed to stabilize and enhance the matching mechanism to address this challenge.", + "bbox": [ + 212, + 686, + 782, + 762 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 Auxiliary Point Guidance", + "text_level": 1, + "bbox": [ + 214, + 784, + 472, + 799 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We introduce an explicit guidance mechanism to enhance the optimization process's stability during the network's matching phase. As shown in Figure 2,", + "bbox": [ + 212, + 809, + 782, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/a61dec336c408d749859d71e5d1418ba2a0742f9047dec1bd8386ad14527c61c.jpg", + "image_caption": [ + "Fig.2: Illustration of the Auxiliary Point Guidance framework. During the model's training, we additionally introduce auxiliary positive $(A_{\\mathrm{pos}})$ and negative $(A_{\\mathrm{pos}})$ points based on each ground truth position to guide the network's learning. This approach helps in directing the optimization process more effectively by distinguishing between potential positive and negative matches." + ], + "image_footnote": [], + "bbox": [ + 259, + 148, + 736, + 308 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "this involves the strategic designation of auxiliary positive $(A_{\\mathrm{pos}})$ and negative $(A_{\\mathrm{neg}})$ points within the optimization framework, determined based on ground truth coordinates $(x,y)$ . The sets of positive and negative points are defined as $A_{\\mathrm{pos}}^i = \\{(x + R_{\\mathrm{pos}}^{i,x},y + R_{\\mathrm{pos}}^{i,y}) \\mid i = 1,2,\\ldots,k_{\\mathrm{pos}}\\}$ and $A_{\\mathrm{neg}}^j = \\{(x + R_{\\mathrm{neg}}^{j,x},y + R_{\\mathrm{neg}}^{j,y}) \\mid j = 1,2,\\ldots,k_{\\mathrm{neg}}\\}$ . Here, $R_{\\mathrm{pos}}^{i,x}$ and $R_{\\mathrm{pos}}^{i,y}$ represent a series of randomness numbers used to generate the $x$ and $y$ coordinates of positive points, respectively, with each number uniformly distributed between $-n_{\\mathrm{pos}}$ and $n_{\\mathrm{pos}}$ . Similarly, $R_{\\mathrm{neg}}^{j,x}$ and $R_{\\mathrm{neg}}^{j,y}$ denote series of randomness numbers for generating the $x$ and $y$ coordinates of negative points, each uniformly distributed between $[-n_{\\mathrm{neg}}, - n_{\\mathrm{pos}}]$ or $[n_{\\mathrm{pos}},n_{\\mathrm{neg}}]$ . The variables $k_{\\mathrm{pos}}$ and $k_{\\mathrm{neg}}$ denote the total number of positive and negative points generated, respectively. Each set $R_{\\mathrm{pos}}^i$ and $R_{\\mathrm{neg}}^j$ is used to create a unique set of coordinates for $A_{\\mathrm{pos}}$ and $A_{\\mathrm{neg}}$ , thereby offsetting the ground truth position $(x,y)$ by these randomness numbers.", + "bbox": [ + 212, + 415, + 787, + 613 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Based on the auxiliary positive points $A_{\\mathrm{pos}}$ , we extract their corresponding features. From these features, we then predict the confidence $\\hat{c}_{\\mathrm{pos}}^{\\star}$ and offset and then calculate the position of the proposal $\\hat{p}_{\\mathrm{pos}}^{\\star}$ for each point. Our objective is to ensure that the confidence of auxiliary positive points is as close to one as possible and that their predicted offsets closely match the added randomness number. To achieve this, we formulate the loss function for the auxiliary positive point as follows:", + "bbox": [ + 212, + 614, + 787, + 720 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {A P G} ^ {p o s} = \\frac {1}{N} \\frac {1}{k _ {\\mathrm {p o s}}} \\sum_ {l = 1} ^ {N} \\sum_ {i = 1} ^ {k _ {\\mathrm {p o s}}} (\\log \\hat {c} _ {\\mathrm {p o s}} ^ {\\star} (l, i) + \\lambda_ {3} \\left| | p _ {l} - \\hat {p} _ {\\mathrm {p o s}} ^ {\\star} (l, i) | | _ {2} ^ {2}\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 284, + 729, + 785, + 772 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\lambda_3$ represents a scaling factor.", + "bbox": [ + 215, + 779, + 478, + 794 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For the auxiliary negative points $(A_{\\mathrm{neg}})$ , our aim is for their confidence $\\hat{c}_{\\mathrm{neg}}^{\\star}$ to be as close to zero as possible. Similarly, we desire their offsets $\\varDelta_{\\mathrm{neg}}^{\\star}$ to approach zero, preventing negative points from using offsets to bring their proposal", + "bbox": [ + 212, + 795, + 787, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/e948333983eee293c817c614e2b90d44b809c44f4beb332bdf179cc9ae370f01.jpg", + "image_caption": [ + "Fig. 3: Illustration of Implicit Feature Interpolation. Given an arbitrary desired point position $(x, y)$ , we concatenate the nearest four feature maps $(Z_1^{\\star} - Z_4^{\\star})$ along with their distances $(\\delta_1^{\\star} - \\delta_4^{\\star})$ to the $(x, y)$ with positional encoding $\\phi$ and utilize a Multi-Layer Perceptron (MLP) $f_{\\theta}$ to interpolate the latent feature for that specific location. This approach enables precise feature extraction at non-grid locations, facilitating more flexible and accurate feature representation." + ], + "image_footnote": [], + "bbox": [ + 267, + 146, + 733, + 308 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "coordinates close to the ground truth. This is crucial to mitigate the potential of these negative points being erroneously considered as matched proposals during the matching process. The loss function specifically formulated for auxiliary negative points is as follows:", + "bbox": [ + 214, + 436, + 782, + 497 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {A P G} ^ {n e g} = \\frac {1}{N} \\frac {1}{k _ {\\text {n e g}}} \\sum_ {l = 1} ^ {N} \\sum_ {j = 1} ^ {k _ {\\text {n e g}}} \\left(\\log \\left(1 - \\hat {c} _ {\\text {n e g}} ^ {\\star} (l, j)\\right) + \\lambda_ {4} \\left| | \\Delta_ {\\text {n e g}} ^ {\\star} (l, j) | | _ {2} ^ {2}\\right), \\right. \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 274, + 510, + 784, + 554 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\lambda_4$ represents a scaling factor.", + "bbox": [ + 215, + 566, + 478, + 580 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The total loss of the Auxiliary Point Guidance can be formulated as:", + "bbox": [ + 238, + 583, + 736, + 598 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {A P G} = \\mathcal {L} _ {A P G} ^ {\\text {p o s}} + \\mathcal {L} _ {A P G} ^ {\\text {n e g}}. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 411, + 611, + 784, + 630 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Through this additional guidance, we can direct the network to train point proposals closest to the ground truth points as positive points, while treating those farther away as negative points. This guidance assists the network in consistently selecting the same positive point for each ground truth point during the matching process. Importantly, the chosen positive point is likely to be the correct match, being in close proximity to the ground truth point. By employing this guidance, we address the instability issue inherent in the matching process, thereby enhancing the network's performance.", + "bbox": [ + 214, + 642, + 787, + 763 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "However, since auxiliary points are randomly assigned based on ground truth coordinates, traditional bilinear interpolation is not suitable for extracting features at these arbitrary positions. Therefore, we propose the use of implicit feature interpolation to obtain these features. The details of this approach will be described in the following section.", + "bbox": [ + 214, + 763, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 Implicit Feature Interpolation", + "text_level": 1, + "bbox": [ + 215, + 146, + 509, + 162 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Implicit functions have demonstrated their efficacy in providing robust and continuous feature representations, significantly benefiting various computer vision tasks as evidenced in previous studies [4, 34, 35]. In Auxiliary Point Guidance, we leverage implicit function-based interpolation to extract latent features that are both arbitrary and robust. As depicted in Figure 3, for a given point location $(x,y)$ , we first determine the four nearest latent features, denoted as $Z_{i}^{*}|i\\in \\{1,\\dots,4\\}$ . We then calculate their respective spatial distances from the target latent feature, represented as $\\delta_i^* |i\\in \\{1,\\dots,4\\}$ . These four latent features, along with their calculated distances, are concatenated channel-wise. This concatenated information is then fed into a MLP to yield the target latent feature. However, it is known that MLPs tend to prioritize low-frequency information, often overlooking crucial high-frequency details, which can impact the performance of the MLP [3, 36, 44]. To counter this limitation, we employ positional encoding as suggested in [52], enhancing the dimensionality of the distance information. By integrating positional encoding with the distance data, we address this high-frequency detail loss. The entire implicit feature interpolation process is encapsulated in the following formulation:", + "bbox": [ + 212, + 170, + 787, + 428 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nF _ {\\text {p r o p o s a l}} (x, y) = \\sum_ {i = 1} ^ {4} \\frac {S _ {i}}{S} f _ {\\theta} \\left(Z _ {i} ^ {*}, \\delta_ {i} ^ {*}, \\phi \\left(\\delta_ {i} ^ {*}\\right)\\right), \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 354, + 436, + 785, + 477 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $S_{i}$ represents the area surrounding the diagonal point with the target point, and $S$ is the sum of these areas, calculated as $S = \\sum_{i=1}^{4} S_{i}$ . Here, $f_{\\theta}(\\cdot)$ symbolizes the MLP, $\\phi(\\cdot)$ denotes positional encoding, and $F_{proposal}(x,y)$ is the resultant interpolated feature for the point $(x,y)$ .", + "bbox": [ + 212, + 484, + 787, + 547 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 Architecture Overview", + "text_level": 1, + "bbox": [ + 215, + 566, + 450, + 580 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our architecture, as illustrated in Figure 4, begins with the extraction of image features using a pre-trained backbone, specifically VGG-16 [41]. We focus on the feature maps from the final two layers (i.e., conv 3 and conv 4). These features are then enhanced for scale diversity through the application of Atrous Spatial Pyramid Pooling (ASPP) [7]. Following this, each set of features undergoes an implicit feature interpolation process, which results in the computation of the corresponding features $F_{proposal}(x,y)$ . The interpolated features are subsequently concatenated and input into both the confidence and regression modules. These modules are responsible for predicting the confidence level and offset for each point in the image. The training of the network is accomplished using a combination of the original point-based constraint, as defined in (3), and the proposed Auxiliary Point Guidance, as stated in (6). The total loss function, denoted as $\\mathcal{L}_{overall}$ , is formulated as follows:", + "bbox": [ + 212, + 590, + 787, + 787 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {o v e r a l l}} = \\mathcal {L} _ {\\text {p o i n t}} + \\lambda_ {5} \\mathcal {L} _ {\\text {A P G}}, \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 397, + 797, + 785, + 816 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\lambda_5$ represents a scaling factor.", + "bbox": [ + 215, + 824, + 480, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 127 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/44a15ff6054023f8f1a19230e91e492b8c92f5f207e6d5244efe2d153e726740.jpg", + "image_caption": [ + "Fig. 4: Illustration of the proposed APGCC for crowd counting and localization. A VGG encoder extracts image features, where features from conv3 and conv4 layers undergo refinement via Atrous Spatial Pyramid Pooling [7]. Subsequently, target latent features are interpolated using implicit feature interpolation. These latent features are then processed through a prediction head to obtain confidence score $\\hat{c}$ and offsets $(\\Delta_x, \\Delta_y)$ , facilitating precise crowd counting and localization." + ], + "image_footnote": [], + "bbox": [ + 246, + 148, + 759, + 369 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Implementation Details", + "text_level": 1, + "bbox": [ + 215, + 493, + 478, + 510 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.1 Datasets", + "text_level": 1, + "bbox": [ + 215, + 523, + 333, + 537 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We use the ShanghaiTechA [53], ShanghaiTechB [53], UCF_CC_50 [12], UCF-QNRF [13], JHU-Crowd++ [42], and NWPU-Crowd [47] datasets to evaluate the performance of the proposed method against the state-of-the-art approaches. ShanghaiTech A dataset [53] includes 482 images with 244,167 annotated points. The dataset is divided into 300 training images and 182 testing images.", + "bbox": [ + 212, + 547, + 787, + 626 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ShanghaiTech B (SHHB) dataset [53] features 716 images and 88,488 annotated points, with a split of 400 training images and 316 testing images.", + "bbox": [ + 212, + 628, + 785, + 660 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "UCF_CC_50 dataset [12] encompasses 50 images, totaling 63,974 annotated points. We adhere to a five-fold cross-validation as outlined in [12].", + "bbox": [ + 214, + 662, + 785, + 694 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "UCF-QNRF dataset [13] contains 1,535 high-resolution web-collected images, with over 1.25 million annotated points. It splits into 1,201 training images and 334 testing images, featuring a broad people count range from 49 to 12,865.", + "bbox": [ + 214, + 696, + 785, + 743 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "JHU-Crowd++ dataset [42] comprises 4,372 images, totaling 1.51 million annotated points. It allocates 2,272 images for training, 500 for validation, and reserves 1,600 images for testing.", + "bbox": [ + 214, + 744, + 785, + 792 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "NWPU-Crowd dataset [47] includes 5,109 images with more than 2.13 million annotated points, distributed across 3,109 training images, 500 validation images, and 1,500 testing images.", + "bbox": [ + 214, + 794, + 785, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.2 Evaluation Protocol", + "text_level": 1, + "bbox": [ + 215, + 146, + 426, + 160 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Counting Metrics. We employ Mean Absolute Error (MAE) and Mean Squared Error (MSE) as our primary performance metrics, in line with standard practices in the field, defined as $MAE = \\frac{1}{Q}\\sum_{i=1}^{Q}|GT_i - N_i|$ , $MSE = \\sqrt{\\frac{1}{Q}\\sum_{i=1}^{Q}(GT_i - N_i)^2}$ , where $Q$ represents the total number of images in the dataset, with $GT_i$ and $N_i$ indicating the actual and predicted crowd counts for the $i$ -th image, respectively. Localization Metrics. To assess localization accuracy, we utilize Precision (P), Recall (R), and F1-measure (F), following the methodologies in [13, 47]. A predicted point is considered a True Positive (TP) if its distance from the corresponding ground truth (GT) point is within a specified threshold $\\sigma$ . For the NWPU-Crowd dataset [47], which includes box-level annotations, $\\sigma$ is defined as $\\sqrt{(w^2 + h^2)/2}$ , where $w$ and $h$ are the width and height of each head. In contrast, for the ShanghaiTech dataset, we apply fixed thresholds of $\\sigma = 4$ and $\\sigma = 8$ .", + "bbox": [ + 212, + 172, + 797, + 383 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.3 Training Details", + "text_level": 1, + "bbox": [ + 215, + 407, + 395, + 422 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We utilize Adam optimization [15] with a learning rate of $10^{-4}$ for general model optimization. Given that the VGG-16 backbone network weights are pre-trained on ImageNet, a reduced learning rate of $10^{-5}$ is applied for these components. We adopted a grid layout strategy [43] for mapping proposals. The initial point proposal stride is set at $s = 8$ . The number of reference points $K$ varies depending on the dataset: 4 for most and 8 for the QNRF dataset, aligned with dataset statistics to ensure $M > N$ . The prediction head comprises four layers with hidden feature dimensions of [1024, 512, 256, 256], and a shared prediction head is used for our point proposals. For point regression, we set $\\gamma$ at 100, and the matching weight term $\\tau$ at $5 \\times 10^{-2}$ . In auxiliary points learning, the number of positive and negative points $(k_{\\mathrm{pos}}, k_{\\mathrm{neg}})$ are set to (2, 2). Randomness ranges $(n_{\\mathrm{pos}}, n_{\\mathrm{neg}})$ are set to (2, 8). The loss coefficients are adjusted as $\\lambda_1 = 0.5$ , $\\lambda_2 = 2 \\times 10^{-4}$ , $\\lambda_3 = 2 \\times 10^{-4}$ , $\\lambda_4 = 2 \\times 10^{-4}$ , and $\\lambda_5 = 0.2$ to balance different term contributions.", + "bbox": [ + 212, + 433, + 787, + 645 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Data augmentation involves initial random scaling (factor range: [0.7, 1.3]), ensuring the shorter side is at least 128 pixels. Images are then randomly cropped to $128 \\times 128$ patches and subjected to random flipping with a 0.5 probability. The training batch size is 8. The longer side of each image is restricted to 1920 pixels for UCF-QNRF, JHU-Crowd++, and NWPU-Crowd, while maintaining the original aspect ratio.", + "bbox": [ + 212, + 646, + 787, + 737 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "6 Experimental Results", + "text_level": 1, + "bbox": [ + 215, + 761, + 460, + 777 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In this section, we present the evaluation results of the proposed method for crowd counting and localization. More results are available in the supplementary material.", + "bbox": [ + 212, + 794, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/93c580fa23a32b42a35199c630b6e101b0d789b779d44496b591e5130c8a9bbe.jpg", + "table_caption": [ + "Table 1: Evaluation of crowd counting on SHHA [53], SHHB [53], UCF-QNRF [13], JHU-Crowd [42] datasets." + ], + "table_footnote": [], + "table_body": "
MethodLocalizationMannerSHHASHHBUCF-QNRFJHU-Crowd+
MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓
AMSNet [11]XMap-based56.793.46.710.2101.8163.2--
SDA+DM [30]XMap-based55.092.7--80.7146.359.3248.9
GauNet+CSRNet [5]XMap-based61.297.87.612.784.2152.469.4262.4
DC [50]XMap-based61.696.77.111.191.4157.567.2288.2
ChfL [40]XMap-based57.594.36.911.080.3137.657.0235.7
HMoDE [6]XMap-based54.487.46.29.8--55.7214.6
LSC-CNN [39]✓Detection-based66.4117.08.112.7120.5218.2112.7454.4
TopoCount [1]✓Detection-based61.2104.67.813.789.0159.060.9267.4
GL [46]✓Map-based61.395.47.311.784.3147.559.9259.5
P2PNet [43]✓Point-based52.785.16.29.985.3154.5--
CLTR [20]✓Point-based56.995.26.510.685.8141.359.5240.6
PET [24]✓Point-based49.378.76.19.679.5144.358.5238.0
APGCC✓Point-based48.876.75.68.780.1136.654.3225.9
", + "bbox": [ + 276, + 184, + 730, + 320 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/272e6524aa9c9d537d51101fdc3e1a4912ebeb426e4fb21b97d7e30f4fbdf7e7.jpg", + "table_caption": [ + "Table 2: Evaluation of crowd count- Table 3: Evaluation of crowding on UCF CC 50 [12] dataset. counting on NWPU [47] dataset." + ], + "table_footnote": [], + "table_body": "
MethodLocalizationMannerMAE ↓MSE ↓
BL [31]XMap-based229.3308.2
AMSNet [11]XMap-based208.4297.3
GauNet+CSRNet [5]XMap-based215.4296.4
HMoDE [6]XMap-based159.6211.2
P2PNet [43]✓Point-based172.7256.1
PET [24]✓Point-based159.9223.7
APGCC✓Point-based154.8205.5
", + "bbox": [ + 228, + 373, + 478, + 450 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/bab5406693fd9456375a1e9ad54a072c42ed15ad89ca2a13aaffa97d40e7406e.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodLocalizationMannerMAE \\( \\downarrow \\)MSE \\( \\downarrow \\)
NoisyCC [45]✘Map-based96.9534.2
UOT [32]✘Map-based87.8387.5
MAN [22]✘Map-based76.5323.0
ChfL [40]✘Map-based76.8343.0
HMoDE+REL [6]✘Map-based73.4331.8
RAZ [23]✓Map-based151.4634.6
GL [46]✓Map-based79.3346.1
AutoScale [51]✓Map-based123.9515.5
TopoCount [1]✓Detection-based107.8438.5
P2PNet [43]✓Point-based77.4362.0
CLTR [20]✓Point-based74.3333.8
PET [24]✓Point-based74.4328.5
APGCC✓Point-based71.7284.4
", + "bbox": [ + 514, + 375, + 728, + 479 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "6.1 Evaluation on Crowd Counting", + "text_level": 1, + "bbox": [ + 214, + 508, + 517, + 523 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "This section outlines our comparative analysis of crowd counting methods, where our approach is benchmarked against an array of state-of-the-art techniques across diverse datasets. We evaluate our performance against both map-based [5, 6, 11, 22, 23, 30-32, 40, 45, 46, 50, 51], detection-based [1, 39] and point-based [20, 24, 43] methodologies. Our experiments, detailed in Tables 1, 2, and 3, highlight APGCC's leading performance, with the best results in bold and the second-best results underlined. These findings affirm the effectiveness and adaptability of our approach in various crowd counting scenarios.", + "bbox": [ + 212, + 537, + 785, + 656 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Table 1 focuses on datasets such as SHHA [53], SHHB [53], UCF-QNRF [13] and JHU-Crowd [42], showcasing APGCC's significant improvements in accuracy metrics like MAE and MSE. For example, compared to P2PNet [43] on the SHHA [53] and SHHB [53] datasets, APGCC achieved substantial reductions in both MAE and MSE, demonstrating its effectiveness even in sparse and simple scene conditions.", + "bbox": [ + 212, + 657, + 785, + 747 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In Table 2, we specifically examine the UCF_CC_50 dataset [12], a challenging set of 50 images with complex scenes. Our approach notably excels, achieving impressive results that underscore the efficiency and stability of our learning strategy, particularly beneficial for datasets with limited images.", + "bbox": [ + 212, + 748, + 784, + 808 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Finally, Table 3 presents our performance on the NWPU-Crowd dataset [47], the most extensive congested dataset considered in our study. Our approach out-", + "bbox": [ + 214, + 809, + 784, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/fcbd637dbbfe8ee23da64d92db506ea79461d40b3733f4de41b8528dc740cec2.jpg", + "table_caption": [ + "Table 4: Evaluation of crowd localization on NWPU [47] dataset." + ], + "table_footnote": [], + "table_body": "
MethodManner\\( {\\sigma }_{t} \\) (large threshold)\\( {\\sigma }_{s} \\) (small threshold)
F(%) \\( \\uparrow \\)P(%) \\( \\uparrow \\)R(%) \\( \\uparrow \\)F(%) \\( \\uparrow \\)P(%) \\( \\uparrow \\)R(%) \\( \\uparrow \\)
RAZ [23]Map-based59.866.654.357.647.051.7
AutoScale [51]Map-based67.357.462.0---
GL [46]Map-based66.080.056.258.771.150.0
TinyFaces [10]Detection-based56.752.961.152.649.156.6
TopoCount [1]Detection-based63.765.162.4---
P2PNet [43]Point-based71.272.969.567.568.466.6
CLTR [20]Point-based68.569.467.659.159.958.3
PET [24]Point-based74.275.273.267.568.466.6
APGCCPoint-based76.479.273.668.971.566.5
", + "bbox": [ + 228, + 186, + 493, + 271 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/3f311a885595e3d52add6a11480baf6fa8386970040f348d237406a4644fb3c9.jpg", + "table_caption": [ + "Table 5: Evaluation of crowd localization on SHHA [53] dataset." + ], + "table_footnote": [], + "table_body": "
MethodMannerσ = 4σ = 8
F(%) ↑P(%) ↑R(%) ↑F(%) ↑P(%) ↑R(%) ↑
LOBB [38]Map-based25.934.920.753.967.644.8
LCFCN [17]Detection-based32.543.326.056.375.145.1
LSC-CNN [39]Detection-based32.633.431.962.463.961.0
TopoCount [1]Detection-based41.141.740.673.674.672.7
P2PNet [43]Point-based40.641.539.874.676.273.1
CLTR [20]Point-based43.243.642.774.274.973.5
APGCCPoint-based48.749.248.378.479.177.7
", + "bbox": [ + 511, + 186, + 777, + 256 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "performs the competition, including the second-best method, HMoDE+REL [6], by achieving lower MAE and MSE. This success can be attributed mainly to our implementation of Auxiliary Points Guidance and the enhancement provided by the Implicit Feature Interpolation technique, which together significantly improve model reliability and adaptability to different scales and densities.", + "bbox": [ + 212, + 300, + 782, + 377 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "6.2 Evaluation on Crowd Localization", + "text_level": 1, + "bbox": [ + 214, + 402, + 540, + 417 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We benchmark our approach against a diverse array of methods, including map-based methods such as RAZ [23], AutoScale [51], LOBB [38], and GL [46]; detection-based methods like TinyFaces [10], TopoCount [1], LSC-CNN [39], and LCFCN [17]; as well as point-based methods including P2PNet [43], CLTR [20], and PET [24].", + "bbox": [ + 212, + 433, + 784, + 508 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Table 4, focusing on the NWPU dataset [47], showcases APGCC's superior performance. Compared to detection-based methods that utilize box-level annotations and other point-based approaches, APGCC leverages IFI to acquire precise features and utilizes closer proposal predictions to achieve optimal precision. Conversely, in the SHHA dataset [53], as detailed in Table 5, APGCC secures comprehensive improvements: at a $\\sigma = 4$ , the F1-measure increased by $5.5\\%$ , and at $\\sigma = 8$ , it rose by $3.8\\%$ .", + "bbox": [ + 212, + 510, + 785, + 614 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "6.3 Evaluation of Model Complexity", + "text_level": 1, + "bbox": [ + 214, + 643, + 532, + 660 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Table 6, we benchmark APGCC against other point-based methods, focusing on the number of parameters and inference time. The inference time evaluations are conducted on an NVIDIA 3090 GPU with an input resolution of $1024 \\times 1024$ . The findings illustrate that APGCC maintains efficient computational complexity and delivers superior performance in crowd counting and localization tasks. Note that since our APG training mechanism is employed only during training, it does not incur additional computational overhead during inference. Compared to the original point-based method (i.e., P2PNet [43]) that utilizes traditional upsampling to process features, our use of IFI allows for more accurate representation learning with fewer parameters. This method enhances computational efficiency, as employing MLPs for feature interpolation is known to be efficient [35].", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 127 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "6.4 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 146, + 388, + 161 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We evaluate the effectiveness of the proposed two modules, APG and IFI. We evaluate the performance on SHHA dataset [53].", + "bbox": [ + 212, + 169, + 782, + 199 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effectiveness of APG. We explore the impact of different optimization strategies, with several distinct settings as follows: (a) \"Matcher\" solely employs the matching strategy as described in Section 3 and [43], (b) \"Nearest Point\" directly selects the proposal closest to the ground truth as the positive proposal, with all others considered negative, (c) \"APG\", which exclusively utilizes the proposed APG for training, and (d) \"Matcher + APG\" (Ours). The experimental results, as shown in Table 7, indicate that while strategy (b) may seem intuitive and straightforward to design, it risks multiple ground truths mapping to the same proposal, severely underestimating the final counting. Consequently, using (a) can guide the model on how to allocate proposals for learning and introduce confidence information to enhance discrimination. Our proposed APG effectively addresses the shortcomings of the nearest point, providing an equivalent number of proposals for the model to learn to match the closest proposals. However, as auxiliary positive points cannot be provided during the inference phase, relying solely on APG can make the model overly dependent on reference values. Therefore, by combining the advantages of Matcher and APG (i.e., (d)), we not only teach the model how to allocate a fixed number of proposals but also guide it to make more elegant choices.", + "bbox": [ + 212, + 202, + 787, + 474 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Optimizing APG Setup. Our exploration into optimizing APG focuses on two key aspects: (i) determining the optimal number of potential positive and negative points ( $k_{\\mathrm{pos}}$ and $k_{\\mathrm{neg}}$ ), as defined in Section 4.1, and (ii) adjusting the randomness scale of APG ( $n_{\\mathrm{neg}}$ and $n_{\\mathrm{pos}}$ ), with findings detailed in Tables 8 and 9.", + "bbox": [ + 212, + 477, + 787, + 551 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 8 explores the impact of the number of auxiliary positive and negative points on performance, essential for validating the APG's effectiveness. The results indicate that while using only auxiliary positive points slightly favors the selection of nearest proposals, it's limited in preventing duplicate predictions. Introducing auxiliary negative points enhances differentiation and training stability by encouraging the model to reject distant proposals. Despite an increase in auxiliary point pairs leading to better stabilization (lower Avg. IR and Avg. $\\Delta$ ), the effect on final performance (MAE) is minimal. Thus, we suggest utilizing a balanced (2, 2) ratio of positive to negative points to achieve better learning performance. This is because training with a (5, 5) setting requires roughly twice the training effort compared to (2, 2), without a significant improvement in performance.", + "bbox": [ + 212, + 553, + 787, + 733 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Additionally, the degree of randomness applied to auxiliary proposals plays a pivotal role in the configuration of the APG. Our experiments, executed with a stride of 8, have demonstrated that a precise range of randomness is crucial for attaining optimal results, as evidenced in Table 9. While a constrained randomness range may limit the diversity in proposal selection, an excessive range of randomness could jeopardize the model's confidence uniformity across different areas, impacting its effectiveness.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/dc3355987ac90d16b62c94d3c7184559de466f37d259a2c645e2d9026c063564.jpg", + "table_caption": [ + "Table 6: Comparison of model complexity with Point-based Approaches." + ], + "table_footnote": [], + "table_body": "
MethodP2PNet [43]CLTR [20]PET [24]APGCC
Parameters (M) ↓21.643.420.918.68
Inference Time (s) ↓0.0740.1070.0970.071
", + "bbox": [ + 218, + 200, + 498, + 234 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/fed33fdacae52afd330f4ce50f1b2fcb524e653b4ffc93e97440a086b5eed406.jpg", + "table_caption": [ + "Table 8: Evaluation of different number of auxiliary points" + ], + "table_footnote": [], + "table_body": "
Num. of Auxiliary Points (kpos, kneg)(0, 0)(1, 0)(2, 0)(1, 1)(2, 2)(5, 5)
MAE ↓54.0451.5751.4749.2448.8448.81
Avg. IR ↓0.700.490.480.380.360.34
Avg. Δ ↓6.873.893.371.621.581.49
", + "bbox": [ + 218, + 299, + 496, + 335 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/a758184b7e91e6b7224942590a89b8b0ecd066672c5b9d868a295cf9688ab978.jpg", + "table_caption": [ + "Table 7: Analysis on alternatives of optimization strategies." + ], + "table_footnote": [], + "table_body": "
SettingStrategyMAE ↓MSE ↓
(a)Matcher54.0486.97
(b)Nearest Point76.91118.60
(c)APG58.4696.71
(d)Matcher + APG (Ours)48.8476.79
", + "bbox": [ + 519, + 185, + 781, + 250 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/c96bd01da7bb6c0226fefa0b6d687c38c2e1ef157a1131799261984323602800.jpg", + "table_caption": [ + "Table 9: Comparison of different range of randomness for auxiliary points" + ], + "table_footnote": [], + "table_body": "
Randomness Range (npos, nneg)(1, 4)(2, 8)(3, 12)(4, 16)
MAE ↓49.2548.8450.2351.23
", + "bbox": [ + 519, + 305, + 781, + 329 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/4121c9148e0d2dfae887e0f27cb2744b6aea9cc413c51e5765bf2e368dd0a36a.jpg", + "table_caption": [ + "Table 10: Ablation study of Implicit Feature Interpolation." + ], + "table_footnote": [], + "table_body": "
SettingMethodMAE ↓MSE ↓F1@4 ↑F1@8 ↑
(a)Nearest Neighbor without MLP53.1683.3143.5976.27
(b)Bilinear Interpolation without MLP51.2579.9245.7877.67
(c)IFI with Single Reference Point49.7377.9747.4078.27
(d)IFI w/o Positional Encoding49.2478.2747.9778.38
(e)IFI48.8476.7948.7678.46
", + "bbox": [ + 349, + 376, + 656, + 434 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Effectiveness of IFI. To accurately capture the correct features for proposals at arbitrary positions, we introduce IFI. Other feasible approaches include: (a) Nearest Neighbor without MLP, which directly utilizes the closest latent feature without any transformation; (b) Bilinear Interpolation without MLP, deriving features at each position through bilinear interpolation, implying no use of coordinate and continuous function transformation; (c) IFI solely employing a single reference point for continuous transformation (MLP with coordinate information); (d) IFI w/o Positional Encoding; and (e) IFI.", + "bbox": [ + 212, + 462, + 784, + 582 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The results, as displayed in Table 10, reveal several clear trends. First, the use of interpolation outperforms the nearest-neighbor approach by providing a richer feature context. Second, a comparison between (b) and (d) highlights the benefits of using distance information for continuous transformation. Third, incorporating Positional Encoding significantly aids the MLP in achieving better learning outcomes. By integrating all these methods, we can notably enhance the representation features obtained at any given position.", + "bbox": [ + 212, + 583, + 785, + 689 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "7 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 710, + 359, + 727 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we proposed Auxiliary Point Guidance and Implicit Feature Interpolation to address challenges in point-based crowd counting and localization. APGCC improved the stability of proposal-target matching and enabled accurate feature extraction at any position. Extensive experiments against state-of-the-art methods, our approach showed superior performance in various scenarios.", + "bbox": [ + 212, + 743, + 784, + 819 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We thank to National Center for High-performance Computing (NCHC) for providing computational and storage resources. This research was supported by the Research Center for Information Technology Innovation and Taiwan's National Science and Technology Council under Grant NSTC112-2634-F-001-001-MBK, NSTC 111-2221-E-002-136-MY3.", + "bbox": [ + 212, + 175, + 787, + 251 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 273, + 321, + 289 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Abousamra, S., Hoai, M., Samaras, D., Chen, C.: Localization in the crowd with topological constraints. In: AAAI (2021) 1, 2, 11, 12", + "2. Bai, S., He, Z., Qiao, Y., Hu, H., Wu, W., Yan, J.: Adaptive dilated network with self-correction supervision for counting. In: CVPR (2020) 3", + "3. Basri, R., Galun, M., Geifman, A., Jacobs, D., Kasten, Y., Kritchman, S.: Frequency bias in neural networks for input of non-uniform density. In: ICML (2020) 8", + "4. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: CVPR (2021) 8", + "5. Cheng, Z.Q., Dai, Q., Li, H., Song, J., Wu, X., Hauptmann, A.G.: Rethinking spatial invariance of convolutional networks for object counting. In: CVPR (2022) 11", + "6. Du, Z., Shi, M., Deng, J., Zafeiriou, S.: Redesigning multi-scale neural network for crowd counting. TIP (2023) 11, 12", + "7. Florian, L.C., Adam, S.H.: Rethinking atrous convolution for semantic image segmentation. In: CVPR (2017) 8, 9", + "8. Gao, J., Han, T., Wang, Q., Yuan, Y.: Domain-adaptive crowd counting via inter-domain features segregation and gaussian-prior reconstruction. arXiv preprint arXiv:1912.03677 (2019) 1, 3, 4", + "9. Gao, J., Han, T., Yuan, Y., Wang, Q.: Learning independent instance maps for crowd localization. arXiv preprint arXiv:2012.04164 (2020) 4", + "10. Hu, P., Ramanan, D.: Finding tiny faces. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 951-959 (2017) 12", + "11. Hu, Y., Jiang, X., Liu, X., Zhang, B., Han, J., Cao, X., Doermann, D.: Nas-count: Counting-by-density with neural architecture search. In: ECCV (2020) 2, 3, 11", + "12. Idrees, H., Saleemi, I., Seibert, C., Shah, M.: Multi-source multi-scale counting in extremely dense crowd images. In: CVPR (2013) 9, 11", + "13. Idrees, H., Tayyab, M., Athrey, K., Zhang, D., Al-Maadeed, S., Rajpoot, N., Shah, M.: Composition loss for counting, density map estimation and localization in dense crowds. In: ECCV (2018) 2, 3, 4, 9, 10, 11", + "14. Jiang, X., Zhang, L., Xu, M., Zhang, T., Lv, P., Zhou, B., Yang, X., Pang, Y.: Attention scaling for crowd counting. In: CVPR (2020) 1, 2, 3", + "15. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 10", + "16. Kuhn, H.W.: The hungarian method for the assignment problem. NRL (1955) 2, 5", + "17. Laradji, I.H., Rostamzadeh, N., Pinheiro, P.O., Vazquez, D., Schmidt, M.: Where are the blobs: Counting by localization with point supervision. In: ECCV (2018) 3, 12" + ], + "bbox": [ + 217, + 303, + 784, + 838 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "18. Li, Y., Zhang, X., Chen, D.: Csrnet: Dilated convolutional neural networks for understanding the highly congested scenes. In: CVPR (2018) 1, 3", + "19. Lian, D., Li, J., Zheng, J., Luo, W., Gao, S.: Density map regression guided detection network for rgb-d crowd counting and localization. In: CVPR (2019) 3", + "20. Liang, D., Xu, W., Bai, X.: An end-to-end transformer model for crowd localization. In: ECCV (2022) 2, 4, 11, 12, 14", + "21. Liang, D., Xu, W., Zhu, Y., Zhou, Y.: Focal inverse distance transform maps for crowd localization. TMM (2022) 1, 4", + "22. Lin, H., Ma, Z., Ji, R., Wang, Y., Hong, X.: Boosting crowd counting via multifaceted attention. In: CVPR (2022) 1, 11", + "23. Liu, C., Weng, X., Mu, Y.: Recurrent attentive zooming for joint crowd counting and precise localization. In: CVPR (2019) 3, 11, 12", + "24. Liu, C., Lu, H., Cao, Z., Liu, T.: Point-query quadtree for crowd counting, localization, and more. In: ICCV. pp. 1676-1685 (2023) 2, 4, 11, 12, 14", + "25. Liu, L., Lu, H., Xiong, H., Xian, K., Cao, Z., Shen, C.: Counting objects by blockwise classification. TCSVT (2019) 2, 3", + "26. Liu, L., Lu, H., Zou, H., Xiong, H., Cao, Z., Shen, C.: Weighing counts: Sequential crowd counting by reinforcement learning. In: ECCV (2020) 2, 3", + "27. Liu, W., Durasov, N., Fua, P.: Leveraging self-supervision for cross-domain crowd counting. In: CVPR (2022) 1", + "28. Liu, X., Yang, J., Ding, W.: Adaptive mixture regression network with local counting map for crowd counting. In: ECCV (2020) 2, 3", + "29. Liu, Y., Shi, M., Zhao, Q., Wang, X.: Point in, box out: Beyond counting persons in crowds. In: CVPR (2019) 2, 3, 4", + "30. Ma, Z., Hong, X., Wei, X., Qiu, Y., Gong, Y.: Towards a universal model for cross-dataset crowd counting. In: ICCV (2021) 11", + "31. Ma, Z., Wei, X., Hong, X., Gong, Y.: Bayesian loss for crowd count estimation with point supervision. In: ICCV (2019) 2, 3, 11", + "32. Ma, Z., Wei, X., Hong, X., Lin, H., Qiu, Y., Gong, Y.: Learning to count via unbalanced optimal transport. In: AAAI (2021) 11", + "33. Miao, Y., Lin, Z., Ding, G., Han, J.: Shallow feature based dense attention network for crowd counting. In: AAAI (2020) 3", + "34. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. ACM (2021) 8", + "35. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: CVPR (2019) 8, 12", + "36. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: ICML. pp. 5301-5310. PMLR (2019) 8", + "37. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. NeurIPS (2015) 4", + "38. Ribera, J., Guera, D., Chen, Y., Delp, E.J.: Locating objects without bounding boxes. In: CVPR (2019) 12", + "39. Sam, D.B., Peri, S.V., Sundararaman, M.N., Kamath, A., Babu, R.V.: Locate, size, and count: accurately resolving people in dense crowds via detection. TPAMI (2020) 2, 3, 4, 11, 12", + "40. Shu, W., Wan, J., Tan, K.C., Kwong, S., Chan, A.B.: Crowd counting in the frequency domain. In: CVPR (2022) 11" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Chen et al.", + "bbox": [ + 271, + 114, + 346, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "41. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014) 8", + "42. Sindagi, V.A., Yasarla, R., Patel, V.M.: Jhu-crowd++: Large-scale crowd counting dataset and a benchmark method. TPAMI (2020) 9, 11", + "43. Song, Q., Wang, C., Jiang, Z., Wang, Y., Tai, Y., Wang, C., Li, J., Huang, F., Wu, Y.: Rethinking counting and localization in crowds: A purely point-based framework. In: ICCV (2021) 2, 4, 10, 11, 12, 13, 14", + "44. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020) 8", + "45. Wan, J., Chan, A.: Modeling noisy annotations for crowd counting. NeurIPS (2020) 11", + "46. Wan, J., Liu, Z., Chan, A.B.: A generalized loss function for crowd counting and localization. In: CVPR (2021) 1, 2, 11, 12", + "47. Wang, Q., Gao, J., Lin, W., Li, X.: Nwpu-crowd: A large-scale benchmark for crowd counting and localization. TPAMI (2020) 9, 10, 11, 12", + "48. Wang, Y., Hou, J., Hou, X., Chau, L.P.: A self-training approach for point-supervised object detection and counting in crowds. TIP (2021) 1, 4", + "49. Xiong, H., Lu, H., Liu, C., Liu, L., Cao, Z., Shen, C.: From open set to closed set: Counting objects by spatial divide-and-conquer. In: ICCV (2019) 3", + "50. Xiong, H., Yao, A.: Discrete-constrained regression for local counting models. In: ECCV (2022) 11", + "51. Xu, C., Liang, D., Xu, Y., Bai, S., Zhan, W., Bai, X., Tomizuka, M.: Autoscale: learning to scale for crowd counting. IJCV (2022) 4, 11, 12", + "52. Xu, X., Wang, Z., Shi, H.: Ultrasr: Spatial encoding is a missing key for implicit image function-based arbitrary-scale super-resolution. arXiv preprint arXiv:2103.12716 (2021) 8", + "53. Zhang, Y., Zhou, D., Chen, S., Gao, S., Ma, Y.: Single-image crowd counting via multi-column convolutional neural network. In: CVPR (2016) 2, 9, 11, 12, 13" + ], + "bbox": [ + 212, + 146, + 787, + 549 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Auxiliary Point Guidance Crowd Counting", + "bbox": [ + 444, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_model.json b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_model.json new file mode 100644 index 0000000000000000000000000000000000000000..855e1d704a7be0f6161c033c0ba8a835565966ec --- /dev/null +++ b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_model.json @@ -0,0 +1,2445 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.227, + 0.141, + 0.78, + 0.187 + ], + "angle": 0, + "content": "Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance" + }, + { + "type": "text", + "bbox": [ + 0.23, + 0.212, + 0.775, + 0.245 + ], + "angle": 0, + "content": "I-Hsiang Chen\\(^{1}\\), Wei-Ting Chen\\(^{1,2}\\), Yu-Wei Liu\\(^{1}\\), Ming-Hsuan Yang\\(^{2,3}\\), and Sy-Yen Kuo\\(^{1,4}\\)" + }, + { + "type": "text", + "bbox": [ + 0.375, + 0.255, + 0.632, + 0.269 + ], + "angle": 0, + "content": "\\(^{1}\\) National Taiwan University, Taiwan" + }, + { + "type": "text", + "bbox": [ + 0.36, + 0.27, + 0.643, + 0.283 + ], + "angle": 0, + "content": "2 University of California at Merced, USA" + }, + { + "type": "text", + "bbox": [ + 0.413, + 0.283, + 0.59, + 0.297 + ], + "angle": 0, + "content": "3 Google DeepMind, USA" + }, + { + "type": "text", + "bbox": [ + 0.388, + 0.297, + 0.616, + 0.311 + ], + "angle": 0, + "content": "4 Chang Gung University, Taiwan" + }, + { + "type": "text", + "bbox": [ + 0.255, + 0.312, + 0.748, + 0.326 + ], + "angle": 0, + "content": "{f09921058,f05943089,r12943109}@ntu.edu.tw, mhyang@ucmerced.edu," + }, + { + "type": "text", + "bbox": [ + 0.439, + 0.327, + 0.566, + 0.338 + ], + "angle": 0, + "content": "sykuo@ntu.edu.tw" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.379, + 0.744, + 0.601 + ], + "angle": 0, + "content": "Abstract. Crowd counting and localization have become increasingly important in computer vision due to their wide-ranging applications. While point-based strategies have been widely used in crowd counting methods, they face a significant challenge, i.e., the lack of an effective learning strategy to guide the matching process. This deficiency leads to instability in matching point proposals to target points, adversely affecting overall performance. To address this issue, we introduce an effective approach to stabilize the proposal-target matching in point-based methods. We propose Auxiliary Point Guidance (APG) to provide clear and effective guidance for proposal selection and optimization, addressing the core issue of matching uncertainty. Additionally, we develop Implicit Feature Interpolation (IFI) to enable adaptive feature extraction in diverse crowd scenarios, further enhancing the model's robustness and accuracy. Extensive experiments demonstrate the effectiveness of our approach, showing significant improvements in crowd counting and localization performance, particularly under challenging conditions." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.614, + 0.741, + 0.643 + ], + "angle": 0, + "content": "Keywords: Crowd Counting, Crowd Localization, Auxiliary Learning, Feature Interpolation" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.692, + 0.378, + 0.709 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.725, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Recent years have witnessed the advances and importance of crowd counting and localization in numerous tasks, including surveillance, event management, and urban planning [1,8,14,18,21,22,27,46,48]. The pursuit of accurately estimating crowd size and discerning individual locations is fraught with challenges, ranging from fluctuating crowd densities and occlusions to varying environmental settings." + }, + { + "type": "footer", + "bbox": [ + 0.232, + 0.826, + 0.492, + 0.841 + ], + "angle": 0, + "content": "Project page: https://apgcc.github.io/" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "image", + "bbox": [ + 0.261, + 0.148, + 0.498, + 0.314 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.147, + 0.737, + 0.313 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.329, + 0.788, + 0.455 + ], + "angle": 0, + "content": "Fig. 1: (Left) Crowd Counting and Localization: Comparison with state-of-the-art methods (e.g., LSC-CNN [39], TopoCount [1], P2PNet [43] and CLTR [20]) demonstrating the proposed APGCC's effectiveness in accurately counting and localizing in crowded scenes. (Right) Matching Process Instability: Illustrates the instability in selecting point proposals during the matching process by existing point-based methods (e.g., Matcher [16]) across training epochs, indicated by the Instability Rate (IR), which measures the inconsistency rate of point proposal selection per epoch, leading to limited performance. Both evaluations are conducted on the ShanghaiTech A (SHHA) [53] dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.489, + 0.788, + 0.64 + ], + "angle": 0, + "content": "Within the domain of crowd analysis, two principal methodologies emerge: map-based and localization-based approaches. Map-based methods, employing Gaussian kernels to render density maps, effectively provide models with critical information for learning crowd densities. Renowned for their high accuracy in crowd counting, these methods have been validated across a series of studies, including [11,14,25,26,28,31]. Despite their capacity to achieve localization through additional designs [1,13,46], they still confront challenges such as the overlapping of maps in densely populated areas and the need for multi-scale representations. This leads to difficulties in precise localization with non-differentiable post-processing techniques like \"find-maxima\"." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.642, + 0.788, + 0.748 + ], + "angle": 0, + "content": "Localization-based approaches encompass two divergent strategies: detection-based and point-based methods. Detection-based techniques [29, 39], characterized by the initiation of pseudo ground truth bounding boxes using nearest-neighbor distances, are tailored for specific scenarios but encounter accuracy limitations in highly congested and sparse areas. Despite their practicality, these methods often contend with the constraints of heuristic post-processing, such as non-maximum suppression, potentially leading to inaccuracies [20]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In contrast, the elegance of point-based methods [20, 24, 43] lies in directly using point annotations as learning targets. These frameworks can direct the regression of individual coordinates, simplifying the localization process. These methods are celebrated for their simplicity, end-to-end trainability, and independence from complex pre-processing and multi-scale feature map fusion. However, a significant challenge in point-based methods for crowd analysis is the insta" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.445, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.283 + ], + "angle": 0, + "content": "bility of proposal-target matching during training, as illustrated in Figure 1. In each epoch, a large proportion of target points are matched with different point proposals compared to the previous epoch. This issue arises due to the absence of an effective learning strategy to guide the network in consistently selecting the most appropriate proposals during optimization. Consequently, the constantly changing relationships between proposals and targets lead to vague and unclear learning objectives for each proposal. This uncertainty in the learning process often results in localized inaccuracies, manifesting as either underestimation or overestimation in specific areas of crowded scenes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.283, + 0.788, + 0.388 + ], + "angle": 0, + "content": "In this paper, we address the prevailing issue of uncertainty in proposal-target matching within point-based methods for crowd analysis. We introduce a novel learning paradigm, Auxiliary Point Guidance Crowd Counting (APGCC), designed to instruct the network on the precise selection and optimization of point proposals for matching with target points. APGCC provides a clear and effective directive, ensuring accurate and informed decisions in the proposal selection and optimization process." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.389, + 0.788, + 0.493 + ], + "angle": 0, + "content": "To facilitate the application of APGCC, which necessitates feature extraction at arbitrary positions, we propose a method utilizing Implicit Feature Interpolation. This technique adeptly addresses the challenge of accessing features from diverse locations within the network, thereby ensuring the versatility and efficacy of our model in various crowd scenarios. By enhancing the robustness of the matching relationships between proposals and targets, our approach significantly improves the precision and reliability of crowd analysis models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.494, + 0.788, + 0.584 + ], + "angle": 0, + "content": "Extensive experimental results demonstrate that the proposed APG strategy effectively addresses the instability issues in proposal-target matching during the training process (orange curve in Figure 1). Moreover, it significantly enhances the performance of crowd counting. Our method performs robustly and favorably against state-of-the-art schemes in both crowd counting and localization tasks. We make the following contributions in this work:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.585, + 0.787, + 0.645 + ], + "angle": 0, + "content": "- We introduce Auxiliary Point Guidance, a novel strategy to address the uncertainty in proposal-target matching within point-based crowd counting methods. APG guides the precise selection and optimization of proposals, enhancing model accuracy." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.645, + 0.787, + 0.69 + ], + "angle": 0, + "content": "- We develop an Implicit Feature Interpolation method, enabling effective feature extraction at arbitrary positions. This technique improves the robustness and versatility of our model, particularly in various crowd scenarios." + }, + { + "type": "list", + "bbox": [ + 0.223, + 0.585, + 0.787, + 0.69 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.714, + 0.388, + 0.73 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.746, + 0.787, + 0.793 + ], + "angle": 0, + "content": "In the realm of crowd counting, methodologies are broadly categorized into map-based [2, 2, 11, 14, 18, 25, 25, 26, 28, 31, 33, 49] and localization-based approaches [17, 19, 23, 29, 39], each with distinct strategies and challenges." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Map-based Approaches use Gaussian kernel density maps to achieve localization and counting. Pioneered by researchers like Idrees et al. [13] and Gao et al. [8], these methods identify individual positions as peaks on density maps." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.348, + 0.128 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.313 + ], + "angle": 0, + "content": "However, they encounter challenges with overlapping in dense crowds. Innovations such as the Distance Label Map [51], Focal Inverse Distance Transform Map (FIDTM) [21], and Independent Instance Map (IIM) [9] have been introduced to mitigate these issues, though they still require complex post-processing steps. Concurrently, these approaches also advance crowd counting accuracy by integrating density map values, with enhancements like composition loss [13] and inter-domain feature segregation [8]. These approaches successfully reduce overlaps in crowded areas, yet they require a post-processing step, such as \"find-maxima\", to pinpoint individual locations. Additionally, their reliance on multiscale feature maps adds to their complexity, detracting from their simplicity and elegance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.316, + 0.788, + 0.497 + ], + "angle": 0, + "content": "Localization-based Approaches: In crowd analysis, localization-based methods integrate both detection-based and point-based strategies. Detection-based approaches, utilizing frameworks like Faster RCNN [37], focus on generating pseudo bounding boxes using techniques such as nearest neighbor distance, as seen in [39], and a winner-take-all loss for refining box selection, especially beneficial for high-resolution images. Liu et al. [29] employs curriculum learning to enhance detection and bounding box prediction accuracy. However, these methods often contend with the challenge of pseudo-ground-truth boxes derived from weak point supervision, which can be particularly unreliable in densely populated areas, thus impeding model training and leading to imprecise box predictions. Additionally, they typically involve Non-Maximum Suppression (NMS) in their box filtering process, which is not designed for end-to-end training [48]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.498, + 0.788, + 0.618 + ], + "angle": 0, + "content": "In contrast, point-based approaches like those proposed by Song et al. [43] (P2PNet), Liang et al. [20] (CLTR), and Liu et al. [24] (PET) emphasize directly estimating individual head positions, dynamically adjusting to various crowd densities. These methods significantly enhance the accuracy and process efficiency of localization tasks. Nevertheless, their performance can be limited by the instability of proposal-target matching during training, often leading to regional underestimation or overestimation due to unclear learning objectives for proposals." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.64, + 0.776, + 0.659 + ], + "angle": 0, + "content": "3 Preliminary: Point-based Crowd Counting Framework" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.671, + 0.787, + 0.716 + ], + "angle": 0, + "content": "This framework [43] comprises three main components essential for point-based crowd counting: Point Proposal Prediction, Proposal-Target Matching, and Loss Calculation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Point Proposal Prediction involves generating point proposals from the deep feature map \\(\\mathcal{F}_s\\) outputted by the backbone network, where \\(s\\) is the downsampling stride, and \\(\\mathcal{F}_s\\) has a size of \\(H\\times W\\). The process includes two parallel branches: regression for predicting point coordinate offsets and classification for determining confidence scores. Each pixel on \\(\\mathcal{F}_s\\) corresponds to a patch in the input image, with a predefined set of reference points \\(\\mathcal{R} = R_k|k\\in \\{1,\\dots,K\\}\\) where \\(K\\) is the total number of reference points. The regression branch outputs \\(H\\times W\\times K\\) point proposals, with the coordinates of a proposal \\(\\hat{p}_j = (\\hat{x}_j,\\hat{y}_j)\\)" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.445, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.784, + 0.195 + ], + "angle": 0, + "content": "calculated as: \\(\\hat{x}_j = x_k + \\gamma \\Delta_{jx}^k\\) and \\(\\hat{y}_j = y_k + \\gamma \\Delta_{jy}^k\\) where \\(\\gamma\\) scales the predicted offsets, \\(\\Delta_{jx}^k\\) and \\(\\Delta_{jy}^k\\) present predicted offsets for its coordinates of a proposal \\(\\hat{p}_j = (\\hat{x}_j, \\hat{y}_j)\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.197, + 0.785, + 0.337 + ], + "angle": 0, + "content": "Proposal-Target Matching follows the Point Proposal Prediction, utilizing the Hungarian algorithm [16] as proposal-target matching \\(\\mathcal{O}(\\mathcal{P},\\hat{\\mathcal{P}},\\mathcal{D})\\). This strategy ensures a one-to-one correspondence where each ground truth target from \\(\\mathcal{P}\\) is matched with a point proposal in \\(\\hat{\\mathcal{P}}\\). The matching is based on the pair-wise cost matrix \\(\\mathcal{D}\\) of size \\(N\\times M\\) where \\(N\\) and \\(M\\) denote the number of ground truth points and point proposals. The matrix \\(\\mathcal{D}\\) combines the Euclidean distance between point pairs and the confidence score \\(\\hat{c}_j\\) of each proposal, defined as \\(D(P,\\hat{P}) = \\left(\\tau ||p_i - \\hat{p}_j||_2 - \\hat{c}_j\\right)_{i\\in N,j\\in M}\\), where \\(\\tau\\) balances the pixel distance and \\(\\hat{c}_j\\) is the confidence score of proposal \\(\\hat{p}_j\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.337, + 0.784, + 0.433 + ], + "angle": 0, + "content": "After the matching process, in the optimal matching results denoted as \\(\\Theta\\), each ground truth point \\(p_i\\) is optimally matched to a point proposal \\(\\hat{p}_j\\), with the matching result represented by the permutation \\(\\psi = \\Theta(\\mathcal{P}, \\hat{\\mathcal{P}}, \\mathcal{D})\\). Thus, \\(\\hat{p}_{\\psi(i)}\\) is the proposal matched to ground truth point \\(p_i\\). The set of matched proposals, \\(\\hat{\\mathcal{P}}\\mathrm{pos} = \\hat{p}_{\\psi(i)}|i \\in \\{1, \\dots, N\\}\\), are considered positives, while the unmatched ones, \\(\\hat{\\mathcal{P}}\\mathrm{neg} = \\hat{p}_{\\psi(i)}|i \\in \\{N + 1, \\dots, M\\}\\), are negatives." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.435, + 0.784, + 0.478 + ], + "angle": 0, + "content": "Loss Calculation integrates Euclidean loss \\(\\mathcal{L}_{loc}\\) for point regression and Cross Entropy loss \\(\\mathcal{L}_{cls}\\) for proposal classification. The combined loss function \\(\\mathcal{L}_{point}\\) is:" + }, + { + "type": "equation", + "bbox": [ + 0.314, + 0.479, + 0.784, + 0.518 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {c l s} = - \\frac {1}{M} \\left(\\sum_ {i = 1} ^ {N} \\log \\hat {c} _ {\\psi (i)} + \\lambda_ {1} \\sum_ {i = N + 1} ^ {M} \\log \\left(1 - \\hat {c} _ {\\psi (i)}\\right)\\right), \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.402, + 0.529, + 0.784, + 0.567 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {l o c} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\left| \\left| p _ {i} - \\hat {p} _ {\\psi (i)} \\right| \\right| _ {2} ^ {2}, \\tag {2}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.421, + 0.581, + 0.784, + 0.596 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {p o i n t}} = \\mathcal {L} _ {\\text {c l s}} + \\lambda_ {2} \\mathcal {L} _ {\\text {l o c}}, \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.602, + 0.784, + 0.633 + ], + "angle": 0, + "content": "where \\(\\hat{c}_{\\psi(i)}\\) is the confidence score of the matched proposal \\(\\hat{p}_{\\psi(i)}\\), \\(\\lambda_1\\) adjusts the impact of negative proposals, and \\(\\lambda_2\\) balances the regression loss." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.655, + 0.427, + 0.673 + ], + "angle": 0, + "content": "4 Proposed Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.687, + 0.784, + 0.763 + ], + "angle": 0, + "content": "While current Point-based Approaches demonstrate promising results in crowd counting and localization, we identified instability in the optimization of the matching process, potentially limiting overall performance. We introduce several components designed to stabilize and enhance the matching mechanism to address this challenge." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.785, + 0.473, + 0.8 + ], + "angle": 0, + "content": "4.1 Auxiliary Point Guidance" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "We introduce an explicit guidance mechanism to enhance the optimization process's stability during the network's matching phase. As shown in Figure 2," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "image", + "bbox": [ + 0.261, + 0.149, + 0.737, + 0.309 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.318, + 0.788, + 0.389 + ], + "angle": 0, + "content": "Fig.2: Illustration of the Auxiliary Point Guidance framework. During the model's training, we additionally introduce auxiliary positive \\((A_{\\mathrm{pos}})\\) and negative \\((A_{\\mathrm{pos}})\\) points based on each ground truth position to guide the network's learning. This approach helps in directing the optimization process more effectively by distinguishing between potential positive and negative matches." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.416, + 0.789, + 0.614 + ], + "angle": 0, + "content": "this involves the strategic designation of auxiliary positive \\((A_{\\mathrm{pos}})\\) and negative \\((A_{\\mathrm{neg}})\\) points within the optimization framework, determined based on ground truth coordinates \\((x,y)\\). The sets of positive and negative points are defined as \\(A_{\\mathrm{pos}}^i = \\{(x + R_{\\mathrm{pos}}^{i,x},y + R_{\\mathrm{pos}}^{i,y}) \\mid i = 1,2,\\ldots,k_{\\mathrm{pos}}\\}\\) and \\(A_{\\mathrm{neg}}^j = \\{(x + R_{\\mathrm{neg}}^{j,x},y + R_{\\mathrm{neg}}^{j,y}) \\mid j = 1,2,\\ldots,k_{\\mathrm{neg}}\\}\\). Here, \\(R_{\\mathrm{pos}}^{i,x}\\) and \\(R_{\\mathrm{pos}}^{i,y}\\) represent a series of randomness numbers used to generate the \\(x\\) and \\(y\\) coordinates of positive points, respectively, with each number uniformly distributed between \\(-n_{\\mathrm{pos}}\\) and \\(n_{\\mathrm{pos}}\\). Similarly, \\(R_{\\mathrm{neg}}^{j,x}\\) and \\(R_{\\mathrm{neg}}^{j,y}\\) denote series of randomness numbers for generating the \\(x\\) and \\(y\\) coordinates of negative points, each uniformly distributed between \\([-n_{\\mathrm{neg}}, - n_{\\mathrm{pos}}]\\) or \\([n_{\\mathrm{pos}},n_{\\mathrm{neg}}]\\). The variables \\(k_{\\mathrm{pos}}\\) and \\(k_{\\mathrm{neg}}\\) denote the total number of positive and negative points generated, respectively. Each set \\(R_{\\mathrm{pos}}^i\\) and \\(R_{\\mathrm{neg}}^j\\) is used to create a unique set of coordinates for \\(A_{\\mathrm{pos}}\\) and \\(A_{\\mathrm{neg}}\\), thereby offsetting the ground truth position \\((x,y)\\) by these randomness numbers." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.616, + 0.789, + 0.721 + ], + "angle": 0, + "content": "Based on the auxiliary positive points \\( A_{\\mathrm{pos}} \\), we extract their corresponding features. From these features, we then predict the confidence \\( \\hat{c}_{\\mathrm{pos}}^{\\star} \\) and offset and then calculate the position of the proposal \\( \\hat{p}_{\\mathrm{pos}}^{\\star} \\) for each point. Our objective is to ensure that the confidence of auxiliary positive points is as close to one as possible and that their predicted offsets closely match the added randomness number. To achieve this, we formulate the loss function for the auxiliary positive point as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.285, + 0.73, + 0.787, + 0.773 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {A P G} ^ {p o s} = \\frac {1}{N} \\frac {1}{k _ {\\mathrm {p o s}}} \\sum_ {l = 1} ^ {N} \\sum_ {i = 1} ^ {k _ {\\mathrm {p o s}}} (\\log \\hat {c} _ {\\mathrm {p o s}} ^ {\\star} (l, i) + \\lambda_ {3} \\left| | p _ {l} - \\hat {p} _ {\\mathrm {p o s}} ^ {\\star} (l, i) | | _ {2} ^ {2}\\right), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.78, + 0.48, + 0.795 + ], + "angle": 0, + "content": "where \\(\\lambda_3\\) represents a scaling factor." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.789, + 0.843 + ], + "angle": 0, + "content": "For the auxiliary negative points \\((A_{\\mathrm{neg}})\\), our aim is for their confidence \\(\\hat{c}_{\\mathrm{neg}}^{\\star}\\) to be as close to zero as possible. Similarly, we desire their offsets \\(\\varDelta_{\\mathrm{neg}}^{\\star}\\) to approach zero, preventing negative points from using offsets to bring their proposal" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.445, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.268, + 0.147, + 0.734, + 0.309 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.321, + 0.788, + 0.405 + ], + "angle": 0, + "content": "Fig. 3: Illustration of Implicit Feature Interpolation. Given an arbitrary desired point position \\((x, y)\\), we concatenate the nearest four feature maps \\((Z_1^{\\star} - Z_4^{\\star})\\) along with their distances \\((\\delta_1^{\\star} - \\delta_4^{\\star})\\) to the \\((x, y)\\) with positional encoding \\(\\phi\\) and utilize a Multi-Layer Perceptron (MLP) \\(f_{\\theta}\\) to interpolate the latent feature for that specific location. This approach enables precise feature extraction at non-grid locations, facilitating more flexible and accurate feature representation." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.437, + 0.784, + 0.498 + ], + "angle": 0, + "content": "coordinates close to the ground truth. This is crucial to mitigate the potential of these negative points being erroneously considered as matched proposals during the matching process. The loss function specifically formulated for auxiliary negative points is as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.276, + 0.511, + 0.785, + 0.555 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {A P G} ^ {n e g} = \\frac {1}{N} \\frac {1}{k _ {\\text {n e g}}} \\sum_ {l = 1} ^ {N} \\sum_ {j = 1} ^ {k _ {\\text {n e g}}} \\left(\\log \\left(1 - \\hat {c} _ {\\text {n e g}} ^ {\\star} (l, j)\\right) + \\lambda_ {4} \\left| | \\Delta_ {\\text {n e g}} ^ {\\star} (l, j) | | _ {2} ^ {2}\\right), \\right. \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.568, + 0.48, + 0.582 + ], + "angle": 0, + "content": "where \\(\\lambda_4\\) represents a scaling factor." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.584, + 0.737, + 0.599 + ], + "angle": 0, + "content": "The total loss of the Auxiliary Point Guidance can be formulated as:" + }, + { + "type": "equation", + "bbox": [ + 0.412, + 0.612, + 0.785, + 0.631 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {A P G} = \\mathcal {L} _ {A P G} ^ {\\text {p o s}} + \\mathcal {L} _ {A P G} ^ {\\text {n e g}}. \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.643, + 0.788, + 0.764 + ], + "angle": 0, + "content": "Through this additional guidance, we can direct the network to train point proposals closest to the ground truth points as positive points, while treating those farther away as negative points. This guidance assists the network in consistently selecting the same positive point for each ground truth point during the matching process. Importantly, the chosen positive point is likely to be the correct match, being in close proximity to the ground truth point. By employing this guidance, we address the instability issue inherent in the matching process, thereby enhancing the network's performance." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "However, since auxiliary points are randomly assigned based on ground truth coordinates, traditional bilinear interpolation is not suitable for extracting features at these arbitrary positions. Therefore, we propose the use of implicit feature interpolation to obtain these features. The details of this approach will be described in the following section." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.348, + 0.128 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.51, + 0.163 + ], + "angle": 0, + "content": "4.2 Implicit Feature Interpolation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.171, + 0.788, + 0.429 + ], + "angle": 0, + "content": "Implicit functions have demonstrated their efficacy in providing robust and continuous feature representations, significantly benefiting various computer vision tasks as evidenced in previous studies [4, 34, 35]. In Auxiliary Point Guidance, we leverage implicit function-based interpolation to extract latent features that are both arbitrary and robust. As depicted in Figure 3, for a given point location \\((x,y)\\), we first determine the four nearest latent features, denoted as \\(Z_{i}^{*}|i\\in \\{1,\\dots,4\\}\\). We then calculate their respective spatial distances from the target latent feature, represented as \\(\\delta_i^* |i\\in \\{1,\\dots,4\\}\\). These four latent features, along with their calculated distances, are concatenated channel-wise. This concatenated information is then fed into a MLP to yield the target latent feature. However, it is known that MLPs tend to prioritize low-frequency information, often overlooking crucial high-frequency details, which can impact the performance of the MLP [3, 36, 44]. To counter this limitation, we employ positional encoding as suggested in [52], enhancing the dimensionality of the distance information. By integrating positional encoding with the distance data, we address this high-frequency detail loss. The entire implicit feature interpolation process is encapsulated in the following formulation:" + }, + { + "type": "equation", + "bbox": [ + 0.355, + 0.438, + 0.786, + 0.478 + ], + "angle": 0, + "content": "\\[\nF _ {\\text {p r o p o s a l}} (x, y) = \\sum_ {i = 1} ^ {4} \\frac {S _ {i}}{S} f _ {\\theta} \\left(Z _ {i} ^ {*}, \\delta_ {i} ^ {*}, \\phi \\left(\\delta_ {i} ^ {*}\\right)\\right), \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.486, + 0.788, + 0.548 + ], + "angle": 0, + "content": "where \\( S_{i} \\) represents the area surrounding the diagonal point with the target point, and \\( S \\) is the sum of these areas, calculated as \\( S = \\sum_{i=1}^{4} S_{i} \\). Here, \\( f_{\\theta}(\\cdot) \\) symbolizes the MLP, \\( \\phi(\\cdot) \\) denotes positional encoding, and \\( F_{proposal}(x,y) \\) is the resultant interpolated feature for the point \\( (x,y) \\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.568, + 0.452, + 0.582 + ], + "angle": 0, + "content": "4.3 Architecture Overview" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.592, + 0.789, + 0.789 + ], + "angle": 0, + "content": "Our architecture, as illustrated in Figure 4, begins with the extraction of image features using a pre-trained backbone, specifically VGG-16 [41]. We focus on the feature maps from the final two layers (i.e., conv 3 and conv 4). These features are then enhanced for scale diversity through the application of Atrous Spatial Pyramid Pooling (ASPP) [7]. Following this, each set of features undergoes an implicit feature interpolation process, which results in the computation of the corresponding features \\( F_{proposal}(x,y) \\). The interpolated features are subsequently concatenated and input into both the confidence and regression modules. These modules are responsible for predicting the confidence level and offset for each point in the image. The training of the network is accomplished using a combination of the original point-based constraint, as defined in (3), and the proposed Auxiliary Point Guidance, as stated in (6). The total loss function, denoted as \\( \\mathcal{L}_{overall} \\), is formulated as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.398, + 0.799, + 0.786, + 0.817 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {o v e r a l l}} = \\mathcal {L} _ {\\text {p o i n t}} + \\lambda_ {5} \\mathcal {L} _ {\\text {A P G}}, \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.825, + 0.481, + 0.841 + ], + "angle": 0, + "content": "where \\(\\lambda_5\\) represents a scaling factor." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.446, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.15, + 0.761, + 0.371 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.383, + 0.788, + 0.468 + ], + "angle": 0, + "content": "Fig. 4: Illustration of the proposed APGCC for crowd counting and localization. A VGG encoder extracts image features, where features from conv3 and conv4 layers undergo refinement via Atrous Spatial Pyramid Pooling [7]. Subsequently, target latent features are interpolated using implicit feature interpolation. These latent features are then processed through a prediction head to obtain confidence score \\(\\hat{c}\\) and offsets \\((\\Delta_x, \\Delta_y)\\), facilitating precise crowd counting and localization." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.494, + 0.48, + 0.511 + ], + "angle": 0, + "content": "5 Implementation Details" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.524, + 0.334, + 0.538 + ], + "angle": 0, + "content": "5.1 Datasets" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.548, + 0.788, + 0.627 + ], + "angle": 0, + "content": "We use the ShanghaiTechA [53], ShanghaiTechB [53], UCF_CC_50 [12], UCF-QNRF [13], JHU-Crowd++ [42], and NWPU-Crowd [47] datasets to evaluate the performance of the proposed method against the state-of-the-art approaches. ShanghaiTech A dataset [53] includes 482 images with 244,167 annotated points. The dataset is divided into 300 training images and 182 testing images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.787, + 0.661 + ], + "angle": 0, + "content": "ShanghaiTech B (SHHB) dataset [53] features 716 images and 88,488 annotated points, with a split of 400 training images and 316 testing images." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.664, + 0.787, + 0.695 + ], + "angle": 0, + "content": "UCF_CC_50 dataset [12] encompasses 50 images, totaling 63,974 annotated points. We adhere to a five-fold cross-validation as outlined in [12]." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.698, + 0.787, + 0.744 + ], + "angle": 0, + "content": "UCF-QNRF dataset [13] contains 1,535 high-resolution web-collected images, with over 1.25 million annotated points. It splits into 1,201 training images and 334 testing images, featuring a broad people count range from 49 to 12,865." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.746, + 0.787, + 0.793 + ], + "angle": 0, + "content": "JHU-Crowd++ dataset [42] comprises 4,372 images, totaling 1.51 million annotated points. It allocates 2,272 images for training, 500 for validation, and reserves 1,600 images for testing." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.795, + 0.787, + 0.841 + ], + "angle": 0, + "content": "NWPU-Crowd dataset [47] includes 5,109 images with more than 2.13 million annotated points, distributed across 3,109 training images, 500 validation images, and 1,500 testing images." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.348, + 0.128 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.428, + 0.161 + ], + "angle": 0, + "content": "5.2 Evaluation Protocol" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.173, + 0.799, + 0.385 + ], + "angle": 0, + "content": "Counting Metrics. We employ Mean Absolute Error (MAE) and Mean Squared Error (MSE) as our primary performance metrics, in line with standard practices in the field, defined as \\( MAE = \\frac{1}{Q}\\sum_{i=1}^{Q}|GT_i - N_i| \\), \\( MSE = \\sqrt{\\frac{1}{Q}\\sum_{i=1}^{Q}(GT_i - N_i)^2} \\), where \\( Q \\) represents the total number of images in the dataset, with \\( GT_i \\) and \\( N_i \\) indicating the actual and predicted crowd counts for the \\( i \\)-th image, respectively. Localization Metrics. To assess localization accuracy, we utilize Precision (P), Recall (R), and F1-measure (F), following the methodologies in [13, 47]. A predicted point is considered a True Positive (TP) if its distance from the corresponding ground truth (GT) point is within a specified threshold \\( \\sigma \\). For the NWPU-Crowd dataset [47], which includes box-level annotations, \\( \\sigma \\) is defined as \\( \\sqrt{(w^2 + h^2)/2} \\), where \\( w \\) and \\( h \\) are the width and height of each head. In contrast, for the ShanghaiTech dataset, we apply fixed thresholds of \\( \\sigma = 4 \\) and \\( \\sigma = 8 \\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.409, + 0.396, + 0.424 + ], + "angle": 0, + "content": "5.3 Training Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.434, + 0.788, + 0.646 + ], + "angle": 0, + "content": "We utilize Adam optimization [15] with a learning rate of \\( 10^{-4} \\) for general model optimization. Given that the VGG-16 backbone network weights are pre-trained on ImageNet, a reduced learning rate of \\( 10^{-5} \\) is applied for these components. We adopted a grid layout strategy [43] for mapping proposals. The initial point proposal stride is set at \\( s = 8 \\). The number of reference points \\( K \\) varies depending on the dataset: 4 for most and 8 for the QNRF dataset, aligned with dataset statistics to ensure \\( M > N \\). The prediction head comprises four layers with hidden feature dimensions of [1024, 512, 256, 256], and a shared prediction head is used for our point proposals. For point regression, we set \\( \\gamma \\) at 100, and the matching weight term \\( \\tau \\) at \\( 5 \\times 10^{-2} \\). In auxiliary points learning, the number of positive and negative points \\( (k_{\\mathrm{pos}}, k_{\\mathrm{neg}}) \\) are set to (2, 2). Randomness ranges \\( (n_{\\mathrm{pos}}, n_{\\mathrm{neg}}) \\) are set to (2, 8). The loss coefficients are adjusted as \\( \\lambda_1 = 0.5 \\), \\( \\lambda_2 = 2 \\times 10^{-4} \\), \\( \\lambda_3 = 2 \\times 10^{-4} \\), \\( \\lambda_4 = 2 \\times 10^{-4} \\), and \\( \\lambda_5 = 0.2 \\) to balance different term contributions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.647, + 0.788, + 0.738 + ], + "angle": 0, + "content": "Data augmentation involves initial random scaling (factor range: [0.7, 1.3]), ensuring the shorter side is at least 128 pixels. Images are then randomly cropped to \\(128 \\times 128\\) patches and subjected to random flipping with a 0.5 probability. The training batch size is 8. The longer side of each image is restricted to 1920 pixels for UCF-QNRF, JHU-Crowd++, and NWPU-Crowd, while maintaining the original aspect ratio." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.762, + 0.462, + 0.779 + ], + "angle": 0, + "content": "6 Experimental Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In this section, we present the evaluation results of the proposed method for crowd counting and localization. More results are available in the supplementary material." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.445, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.144, + 0.784, + 0.174 + ], + "angle": 0, + "content": "Table 1: Evaluation of crowd counting on SHHA [53], SHHB [53], UCF-QNRF [13], JHU-Crowd [42] datasets." + }, + { + "type": "table", + "bbox": [ + 0.277, + 0.185, + 0.731, + 0.321 + ], + "angle": 0, + "content": "
MethodLocalizationMannerSHHASHHBUCF-QNRFJHU-Crowd+
MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓
AMSNet [11]XMap-based56.793.46.710.2101.8163.2--
SDA+DM [30]XMap-based55.092.7--80.7146.359.3248.9
GauNet+CSRNet [5]XMap-based61.297.87.612.784.2152.469.4262.4
DC [50]XMap-based61.696.77.111.191.4157.567.2288.2
ChfL [40]XMap-based57.594.36.911.080.3137.657.0235.7
HMoDE [6]XMap-based54.487.46.29.8--55.7214.6
LSC-CNN [39]✓Detection-based66.4117.08.112.7120.5218.2112.7454.4
TopoCount [1]✓Detection-based61.2104.67.813.789.0159.060.9267.4
GL [46]✓Map-based61.395.47.311.784.3147.559.9259.5
P2PNet [43]✓Point-based52.785.16.29.985.3154.5--
CLTR [20]✓Point-based56.995.26.510.685.8141.359.5240.6
PET [24]✓Point-based49.378.76.19.679.5144.358.5238.0
APGCC✓Point-based48.876.75.68.780.1136.654.3225.9
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.347, + 0.751, + 0.374 + ], + "angle": 0, + "content": "Table 2: Evaluation of crowd count- Table 3: Evaluation of crowding on UCF CC 50 [12] dataset. counting on NWPU [47] dataset." + }, + { + "type": "table", + "bbox": [ + 0.229, + 0.374, + 0.48, + 0.451 + ], + "angle": 0, + "content": "
MethodLocalizationMannerMAE ↓MSE ↓
BL [31]XMap-based229.3308.2
AMSNet [11]XMap-based208.4297.3
GauNet+CSRNet [5]XMap-based215.4296.4
HMoDE [6]XMap-based159.6211.2
P2PNet [43]✓Point-based172.7256.1
PET [24]✓Point-based159.9223.7
APGCC✓Point-based154.8205.5
" + }, + { + "type": "table", + "bbox": [ + 0.516, + 0.376, + 0.73, + 0.48 + ], + "angle": 0, + "content": "
MethodLocalizationMannerMAE \\( \\downarrow \\)MSE \\( \\downarrow \\)
NoisyCC [45]✘Map-based96.9534.2
UOT [32]✘Map-based87.8387.5
MAN [22]✘Map-based76.5323.0
ChfL [40]✘Map-based76.8343.0
HMoDE+REL [6]✘Map-based73.4331.8
RAZ [23]✓Map-based151.4634.6
GL [46]✓Map-based79.3346.1
AutoScale [51]✓Map-based123.9515.5
TopoCount [1]✓Detection-based107.8438.5
P2PNet [43]✓Point-based77.4362.0
CLTR [20]✓Point-based74.3333.8
PET [24]✓Point-based74.4328.5
APGCC✓Point-based71.7284.4
" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.51, + 0.519, + 0.525 + ], + "angle": 0, + "content": "6.1 Evaluation on Crowd Counting" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.787, + 0.657 + ], + "angle": 0, + "content": "This section outlines our comparative analysis of crowd counting methods, where our approach is benchmarked against an array of state-of-the-art techniques across diverse datasets. We evaluate our performance against both map-based [5, 6, 11, 22, 23, 30-32, 40, 45, 46, 50, 51], detection-based [1, 39] and point-based [20, 24, 43] methodologies. Our experiments, detailed in Tables 1, 2, and 3, highlight APGCC's leading performance, with the best results in bold and the second-best results underlined. These findings affirm the effectiveness and adaptability of our approach in various crowd counting scenarios." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.658, + 0.787, + 0.748 + ], + "angle": 0, + "content": "Table 1 focuses on datasets such as SHHA [53], SHHB [53], UCF-QNRF [13] and JHU-Crowd [42], showcasing APGCC's significant improvements in accuracy metrics like MAE and MSE. For example, compared to P2PNet [43] on the SHHA [53] and SHHB [53] datasets, APGCC achieved substantial reductions in both MAE and MSE, demonstrating its effectiveness even in sparse and simple scene conditions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.785, + 0.809 + ], + "angle": 0, + "content": "In Table 2, we specifically examine the UCF_CC_50 dataset [12], a challenging set of 50 images with complex scenes. Our approach notably excels, achieving impressive results that underscore the efficiency and stability of our learning strategy, particularly beneficial for datasets with limited images." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Finally, Table 3 presents our performance on the NWPU-Crowd dataset [47], the most extensive congested dataset considered in our study. Our approach out-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.348, + 0.128 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.158, + 0.501, + 0.186 + ], + "angle": 0, + "content": "Table 4: Evaluation of crowd localization on NWPU [47] dataset." + }, + { + "type": "table", + "bbox": [ + 0.229, + 0.187, + 0.495, + 0.272 + ], + "angle": 0, + "content": "
MethodManner\\( {\\sigma }_{t} \\) (large threshold)\\( {\\sigma }_{s} \\) (small threshold)
F(%) \\( \\uparrow \\)P(%) \\( \\uparrow \\)R(%) \\( \\uparrow \\)F(%) \\( \\uparrow \\)P(%) \\( \\uparrow \\)R(%) \\( \\uparrow \\)
RAZ [23]Map-based59.866.654.357.647.051.7
AutoScale [51]Map-based67.357.462.0---
GL [46]Map-based66.080.056.258.771.150.0
TinyFaces [10]Detection-based56.752.961.152.649.156.6
TopoCount [1]Detection-based63.765.162.4---
P2PNet [43]Point-based71.272.969.567.568.466.6
CLTR [20]Point-based68.569.467.659.159.958.3
PET [24]Point-based74.275.273.267.568.466.6
APGCCPoint-based76.479.273.668.971.566.5
" + }, + { + "type": "table_caption", + "bbox": [ + 0.503, + 0.158, + 0.78, + 0.186 + ], + "angle": 0, + "content": "Table 5: Evaluation of crowd localization on SHHA [53] dataset." + }, + { + "type": "table", + "bbox": [ + 0.512, + 0.187, + 0.778, + 0.257 + ], + "angle": 0, + "content": "
MethodMannerσ = 4σ = 8
F(%) ↑P(%) ↑R(%) ↑F(%) ↑P(%) ↑R(%) ↑
LOBB [38]Map-based25.934.920.753.967.644.8
LCFCN [17]Detection-based32.543.326.056.375.145.1
LSC-CNN [39]Detection-based32.633.431.962.463.961.0
TopoCount [1]Detection-based41.141.740.673.674.672.7
P2PNet [43]Point-based40.641.539.874.676.273.1
CLTR [20]Point-based43.243.642.774.274.973.5
APGCCPoint-based48.749.248.378.479.177.7
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.301, + 0.784, + 0.378 + ], + "angle": 0, + "content": "performs the competition, including the second-best method, HMoDE+REL [6], by achieving lower MAE and MSE. This success can be attributed mainly to our implementation of Auxiliary Points Guidance and the enhancement provided by the Implicit Feature Interpolation technique, which together significantly improve model reliability and adaptability to different scales and densities." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.404, + 0.542, + 0.419 + ], + "angle": 0, + "content": "6.2 Evaluation on Crowd Localization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.434, + 0.785, + 0.51 + ], + "angle": 0, + "content": "We benchmark our approach against a diverse array of methods, including map-based methods such as RAZ [23], AutoScale [51], LOBB [38], and GL [46]; detection-based methods like TinyFaces [10], TopoCount [1], LSC-CNN [39], and LCFCN [17]; as well as point-based methods including P2PNet [43], CLTR [20], and PET [24]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.511, + 0.787, + 0.616 + ], + "angle": 0, + "content": "Table 4, focusing on the NWPU dataset [47], showcases APGCC's superior performance. Compared to detection-based methods that utilize box-level annotations and other point-based approaches, APGCC leverages IFI to acquire precise features and utilizes closer proposal predictions to achieve optimal precision. Conversely, in the SHHA dataset [53], as detailed in Table 5, APGCC secures comprehensive improvements: at a \\(\\sigma = 4\\), the F1-measure increased by \\(5.5\\%\\), and at \\(\\sigma = 8\\), it rose by \\(3.8\\%\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.644, + 0.533, + 0.661 + ], + "angle": 0, + "content": "6.3 Evaluation of Model Complexity" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.788, + 0.842 + ], + "angle": 0, + "content": "In Table 6, we benchmark APGCC against other point-based methods, focusing on the number of parameters and inference time. The inference time evaluations are conducted on an NVIDIA 3090 GPU with an input resolution of \\(1024 \\times 1024\\). The findings illustrate that APGCC maintains efficient computational complexity and delivers superior performance in crowd counting and localization tasks. Note that since our APG training mechanism is employed only during training, it does not incur additional computational overhead during inference. Compared to the original point-based method (i.e., P2PNet [43]) that utilizes traditional upsampling to process features, our use of IFI allows for more accurate representation learning with fewer parameters. This method enhances computational efficiency, as employing MLPs for feature interpolation is known to be efficient [35]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.445, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.389, + 0.162 + ], + "angle": 0, + "content": "6.4 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.17, + 0.784, + 0.2 + ], + "angle": 0, + "content": "We evaluate the effectiveness of the proposed two modules, APG and IFI. We evaluate the performance on SHHA dataset [53]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.203, + 0.788, + 0.475 + ], + "angle": 0, + "content": "Effectiveness of APG. We explore the impact of different optimization strategies, with several distinct settings as follows: (a) \"Matcher\" solely employs the matching strategy as described in Section 3 and [43], (b) \"Nearest Point\" directly selects the proposal closest to the ground truth as the positive proposal, with all others considered negative, (c) \"APG\", which exclusively utilizes the proposed APG for training, and (d) \"Matcher + APG\" (Ours). The experimental results, as shown in Table 7, indicate that while strategy (b) may seem intuitive and straightforward to design, it risks multiple ground truths mapping to the same proposal, severely underestimating the final counting. Consequently, using (a) can guide the model on how to allocate proposals for learning and introduce confidence information to enhance discrimination. Our proposed APG effectively addresses the shortcomings of the nearest point, providing an equivalent number of proposals for the model to learn to match the closest proposals. However, as auxiliary positive points cannot be provided during the inference phase, relying solely on APG can make the model overly dependent on reference values. Therefore, by combining the advantages of Matcher and APG (i.e., (d)), we not only teach the model how to allocate a fixed number of proposals but also guide it to make more elegant choices." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.788, + 0.552 + ], + "angle": 0, + "content": "Optimizing APG Setup. Our exploration into optimizing APG focuses on two key aspects: (i) determining the optimal number of potential positive and negative points (\\(k_{\\mathrm{pos}}\\) and \\(k_{\\mathrm{neg}}\\)), as defined in Section 4.1, and (ii) adjusting the randomness scale of APG (\\(n_{\\mathrm{neg}}\\) and \\(n_{\\mathrm{pos}}\\)), with findings detailed in Tables 8 and 9." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.554, + 0.788, + 0.734 + ], + "angle": 0, + "content": "Table 8 explores the impact of the number of auxiliary positive and negative points on performance, essential for validating the APG's effectiveness. The results indicate that while using only auxiliary positive points slightly favors the selection of nearest proposals, it's limited in preventing duplicate predictions. Introducing auxiliary negative points enhances differentiation and training stability by encouraging the model to reject distant proposals. Despite an increase in auxiliary point pairs leading to better stabilization (lower Avg. IR and Avg. \\(\\Delta\\)), the effect on final performance (MAE) is minimal. Thus, we suggest utilizing a balanced (2, 2) ratio of positive to negative points to achieve better learning performance. This is because training with a (5, 5) setting requires roughly twice the training effort compared to (2, 2), without a significant improvement in performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Additionally, the degree of randomness applied to auxiliary proposals plays a pivotal role in the configuration of the APG. Our experiments, executed with a stride of 8, have demonstrated that a precise range of randomness is crucial for attaining optimal results, as evidenced in Table 9. While a constrained randomness range may limit the diversity in proposal selection, an excessive range of randomness could jeopardize the model's confidence uniformity across different areas, impacting its effectiveness." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.348, + 0.128 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.159, + 0.492, + 0.2 + ], + "angle": 0, + "content": "Table 6: Comparison of model complexity with Point-based Approaches." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.202, + 0.499, + 0.236 + ], + "angle": 0, + "content": "
MethodP2PNet [43]CLTR [20]PET [24]APGCC
Parameters (M) ↓21.643.420.918.68
Inference Time (s) ↓0.0740.1070.0970.071
" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.27, + 0.492, + 0.298 + ], + "angle": 0, + "content": "Table 8: Evaluation of different number of auxiliary points" + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.3, + 0.498, + 0.336 + ], + "angle": 0, + "content": "
Num. of Auxiliary Points (kpos, kneg)(0, 0)(1, 0)(2, 0)(1, 1)(2, 2)(5, 5)
MAE ↓54.0451.5751.4749.2448.8448.81
Avg. IR ↓0.700.490.480.380.360.34
Avg. Δ ↓6.873.893.371.621.581.49
" + }, + { + "type": "table_caption", + "bbox": [ + 0.509, + 0.158, + 0.787, + 0.185 + ], + "angle": 0, + "content": "Table 7: Analysis on alternatives of optimization strategies." + }, + { + "type": "table", + "bbox": [ + 0.521, + 0.186, + 0.782, + 0.251 + ], + "angle": 0, + "content": "
SettingStrategyMAE ↓MSE ↓
(a)Matcher54.0486.97
(b)Nearest Point76.91118.60
(c)APG58.4696.71
(d)Matcher + APG (Ours)48.8476.79
" + }, + { + "type": "table_caption", + "bbox": [ + 0.509, + 0.262, + 0.786, + 0.304 + ], + "angle": 0, + "content": "Table 9: Comparison of different range of randomness for auxiliary points" + }, + { + "type": "table", + "bbox": [ + 0.52, + 0.306, + 0.782, + 0.33 + ], + "angle": 0, + "content": "
Randomness Range (npos, nneg)(1, 4)(2, 8)(3, 12)(4, 16)
MAE ↓49.2548.8450.2351.23
" + }, + { + "type": "table_caption", + "bbox": [ + 0.276, + 0.349, + 0.725, + 0.364 + ], + "angle": 0, + "content": "Table 10: Ablation study of Implicit Feature Interpolation." + }, + { + "type": "table", + "bbox": [ + 0.35, + 0.377, + 0.658, + 0.435 + ], + "angle": 0, + "content": "
SettingMethodMAE ↓MSE ↓F1@4 ↑F1@8 ↑
(a)Nearest Neighbor without MLP53.1683.3143.5976.27
(b)Bilinear Interpolation without MLP51.2579.9245.7877.67
(c)IFI with Single Reference Point49.7377.9747.4078.27
(d)IFI w/o Positional Encoding49.2478.2747.9778.38
(e)IFI48.8476.7948.7678.46
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.785, + 0.583 + ], + "angle": 0, + "content": "Effectiveness of IFI. To accurately capture the correct features for proposals at arbitrary positions, we introduce IFI. Other feasible approaches include: (a) Nearest Neighbor without MLP, which directly utilizes the closest latent feature without any transformation; (b) Bilinear Interpolation without MLP, deriving features at each position through bilinear interpolation, implying no use of coordinate and continuous function transformation; (c) IFI solely employing a single reference point for continuous transformation (MLP with coordinate information); (d) IFI w/o Positional Encoding; and (e) IFI." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.787, + 0.69 + ], + "angle": 0, + "content": "The results, as displayed in Table 10, reveal several clear trends. First, the use of interpolation outperforms the nearest-neighbor approach by providing a richer feature context. Second, a comparison between (b) and (d) highlights the benefits of using distance information for continuous transformation. Third, incorporating Positional Encoding significantly aids the MLP in achieving better learning outcomes. By integrating all these methods, we can notably enhance the representation features obtained at any given position." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.712, + 0.36, + 0.728 + ], + "angle": 0, + "content": "7 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.744, + 0.785, + 0.82 + ], + "angle": 0, + "content": "In this paper, we proposed Auxiliary Point Guidance and Implicit Feature Interpolation to address challenges in point-based crowd counting and localization. APGCC improved the stability of proposal-target matching and enabled accurate feature extraction at any position. Extensive experiments against state-of-the-art methods, our approach showed superior performance in various scenarios." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.445, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.252 + ], + "angle": 0, + "content": "We thank to National Center for High-performance Computing (NCHC) for providing computational and storage resources. This research was supported by the Research Center for Information Technology Innovation and Taiwan's National Science and Technology Council under Grant NSTC112-2634-F-001-001-MBK, NSTC 111-2221-E-002-136-MY3." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.274, + 0.323, + 0.29 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.304, + 0.785, + 0.331 + ], + "angle": 0, + "content": "1. Abousamra, S., Hoai, M., Samaras, D., Chen, C.: Localization in the crowd with topological constraints. In: AAAI (2021) 1, 2, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.333, + 0.785, + 0.358 + ], + "angle": 0, + "content": "2. Bai, S., He, Z., Qiao, Y., Hu, H., Wu, W., Yan, J.: Adaptive dilated network with self-correction supervision for counting. In: CVPR (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.361, + 0.785, + 0.398 + ], + "angle": 0, + "content": "3. Basri, R., Galun, M., Geifman, A., Jacobs, D., Kasten, Y., Kritchman, S.: Frequency bias in neural networks for input of non-uniform density. In: ICML (2020) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.401, + 0.785, + 0.427 + ], + "angle": 0, + "content": "4. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: CVPR (2021) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.429, + 0.785, + 0.467 + ], + "angle": 0, + "content": "5. Cheng, Z.Q., Dai, Q., Li, H., Song, J., Wu, X., Hauptmann, A.G.: Rethinking spatial invariance of convolutional networks for object counting. In: CVPR (2022) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.47, + 0.785, + 0.496 + ], + "angle": 0, + "content": "6. Du, Z., Shi, M., Deng, J., Zafeiriou, S.: Redesigning multi-scale neural network for crowd counting. TIP (2023) 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.498, + 0.785, + 0.524 + ], + "angle": 0, + "content": "7. Florian, L.C., Adam, S.H.: Rethinking atrous convolution for semantic image segmentation. In: CVPR (2017) 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.526, + 0.785, + 0.564 + ], + "angle": 0, + "content": "8. Gao, J., Han, T., Wang, Q., Yuan, Y.: Domain-adaptive crowd counting via inter-domain features segregation and gaussian-prior reconstruction. arXiv preprint arXiv:1912.03677 (2019) 1, 3, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.567, + 0.785, + 0.592 + ], + "angle": 0, + "content": "9. Gao, J., Han, T., Yuan, Y., Wang, Q.: Learning independent instance maps for crowd localization. arXiv preprint arXiv:2012.04164 (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.595, + 0.785, + 0.62 + ], + "angle": 0, + "content": "10. Hu, P., Ramanan, D.: Finding tiny faces. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 951-959 (2017) 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.622, + 0.785, + 0.647 + ], + "angle": 0, + "content": "11. Hu, Y., Jiang, X., Liu, X., Zhang, B., Han, J., Cao, X., Doermann, D.: Nas-count: Counting-by-density with neural architecture search. In: ECCV (2020) 2, 3, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.649, + 0.785, + 0.674 + ], + "angle": 0, + "content": "12. Idrees, H., Saleemi, I., Seibert, C., Shah, M.: Multi-source multi-scale counting in extremely dense crowd images. In: CVPR (2013) 9, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.676, + 0.785, + 0.716 + ], + "angle": 0, + "content": "13. Idrees, H., Tayyab, M., Athrey, K., Zhang, D., Al-Maadeed, S., Rajpoot, N., Shah, M.: Composition loss for counting, density map estimation and localization in dense crowds. In: ECCV (2018) 2, 3, 4, 9, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.718, + 0.785, + 0.744 + ], + "angle": 0, + "content": "14. Jiang, X., Zhang, L., Xu, M., Zhang, T., Lv, P., Zhou, B., Yang, X., Pang, Y.: Attention scaling for crowd counting. In: CVPR (2020) 1, 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.746, + 0.785, + 0.771 + ], + "angle": 0, + "content": "15. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.773, + 0.785, + 0.797 + ], + "angle": 0, + "content": "16. Kuhn, H.W.: The hungarian method for the assignment problem. NRL (1955) 2, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.8, + 0.785, + 0.839 + ], + "angle": 0, + "content": "17. Laradji, I.H., Rostamzadeh, N., Pinheiro, P.O., Vazquez, D., Schmidt, M.: Where are the blobs: Counting by localization with point supervision. In: ECCV (2018) 3, 12" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.304, + 0.785, + 0.839 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.127 + ], + "angle": 0, + "content": "Chen et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "18. Li, Y., Zhang, X., Chen, D.: Csrnet: Dilated convolutional neural networks for understanding the highly congested scenes. In: CVPR (2018) 1, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.203 + ], + "angle": 0, + "content": "19. Lian, D., Li, J., Zheng, J., Luo, W., Gao, S.: Density map regression guided detection network for rgb-d crowd counting and localization. In: CVPR (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.785, + 0.231 + ], + "angle": 0, + "content": "20. Liang, D., Xu, W., Bai, X.: An end-to-end transformer model for crowd localization. In: ECCV (2022) 2, 4, 11, 12, 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.785, + 0.259 + ], + "angle": 0, + "content": "21. Liang, D., Xu, W., Zhu, Y., Zhou, Y.: Focal inverse distance transform maps for crowd localization. TMM (2022) 1, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.26, + 0.785, + 0.286 + ], + "angle": 0, + "content": "22. Lin, H., Ma, Z., Ji, R., Wang, Y., Hong, X.: Boosting crowd counting via multifaceted attention. In: CVPR (2022) 1, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.288, + 0.785, + 0.314 + ], + "angle": 0, + "content": "23. Liu, C., Weng, X., Mu, Y.: Recurrent attentive zooming for joint crowd counting and precise localization. In: CVPR (2019) 3, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.785, + 0.342 + ], + "angle": 0, + "content": "24. Liu, C., Lu, H., Cao, Z., Liu, T.: Point-query quadtree for crowd counting, localization, and more. In: ICCV. pp. 1676-1685 (2023) 2, 4, 11, 12, 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.343, + 0.785, + 0.37 + ], + "angle": 0, + "content": "25. Liu, L., Lu, H., Xiong, H., Xian, K., Cao, Z., Shen, C.: Counting objects by blockwise classification. TCSVT (2019) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.397 + ], + "angle": 0, + "content": "26. Liu, L., Lu, H., Zou, H., Xiong, H., Cao, Z., Shen, C.: Weighing counts: Sequential crowd counting by reinforcement learning. In: ECCV (2020) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.424 + ], + "angle": 0, + "content": "27. Liu, W., Durasov, N., Fua, P.: Leveraging self-supervision for cross-domain crowd counting. In: CVPR (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.452 + ], + "angle": 0, + "content": "28. Liu, X., Yang, J., Ding, W.: Adaptive mixture regression network with local counting map for crowd counting. In: ECCV (2020) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.785, + 0.479 + ], + "angle": 0, + "content": "29. Liu, Y., Shi, M., Zhao, Q., Wang, X.: Point in, box out: Beyond counting persons in crowds. In: CVPR (2019) 2, 3, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.48, + 0.785, + 0.508 + ], + "angle": 0, + "content": "30. Ma, Z., Hong, X., Wei, X., Qiu, Y., Gong, Y.: Towards a universal model for cross-dataset crowd counting. In: ICCV (2021) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.785, + 0.536 + ], + "angle": 0, + "content": "31. Ma, Z., Wei, X., Hong, X., Gong, Y.: Bayesian loss for crowd count estimation with point supervision. In: ICCV (2019) 2, 3, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.537, + 0.785, + 0.563 + ], + "angle": 0, + "content": "32. Ma, Z., Wei, X., Hong, X., Lin, H., Qiu, Y., Gong, Y.: Learning to count via unbalanced optimal transport. In: AAAI (2021) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.785, + 0.591 + ], + "angle": 0, + "content": "33. Miao, Y., Lin, Z., Ding, G., Han, J.: Shallow feature based dense attention network for crowd counting. In: AAAI (2020) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.592, + 0.785, + 0.632 + ], + "angle": 0, + "content": "34. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. ACM (2021) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.785, + 0.672 + ], + "angle": 0, + "content": "35. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: CVPR (2019) 8, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.674, + 0.785, + 0.715 + ], + "angle": 0, + "content": "36. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: ICML. pp. 5301-5310. PMLR (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.785, + 0.743 + ], + "angle": 0, + "content": "37. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. NeurIPS (2015) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.785, + 0.771 + ], + "angle": 0, + "content": "38. Ribera, J., Guera, D., Chen, Y., Delp, E.J.: Locating objects without bounding boxes. In: CVPR (2019) 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "39. Sam, D.B., Peri, S.V., Sundararaman, M.N., Kamath, A., Babu, R.V.: Locate, size, and count: accurately resolving people in dense crowds via detection. TPAMI (2020) 2, 3, 4, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "40. Shu, W., Wan, J., Tan, K.C., Kwong, S., Chan, A.B.: Crowd counting in the frequency domain. In: CVPR (2022) 11" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.445, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Auxiliary Point Guidance Crowd Counting" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.175 + ], + "angle": 0, + "content": "41. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.175, + 0.788, + 0.203 + ], + "angle": 0, + "content": "42. Sindagi, V.A., Yasarla, R., Patel, V.M.: Jhu-crowd++: Large-scale crowd counting dataset and a benchmark method. TPAMI (2020) 9, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.203, + 0.788, + 0.245 + ], + "angle": 0, + "content": "43. Song, Q., Wang, C., Jiang, Z., Wang, Y., Tai, Y., Wang, C., Li, J., Huang, F., Wu, Y.: Rethinking counting and localization in crowds: A purely point-based framework. In: ICCV (2021) 2, 4, 10, 11, 12, 13, 14" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.245, + 0.788, + 0.286 + ], + "angle": 0, + "content": "44. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.286, + 0.788, + 0.313 + ], + "angle": 0, + "content": "45. Wan, J., Chan, A.: Modeling noisy annotations for crowd counting. NeurIPS (2020) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.314, + 0.788, + 0.342 + ], + "angle": 0, + "content": "46. Wan, J., Liu, Z., Chan, A.B.: A generalized loss function for crowd counting and localization. In: CVPR (2021) 1, 2, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.342, + 0.788, + 0.37 + ], + "angle": 0, + "content": "47. Wang, Q., Gao, J., Lin, W., Li, X.: Nwpu-crowd: A large-scale benchmark for crowd counting and localization. TPAMI (2020) 9, 10, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.37, + 0.788, + 0.397 + ], + "angle": 0, + "content": "48. Wang, Y., Hou, J., Hou, X., Chau, L.P.: A self-training approach for point-supervised object detection and counting in crowds. TIP (2021) 1, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.397, + 0.788, + 0.425 + ], + "angle": 0, + "content": "49. Xiong, H., Lu, H., Liu, C., Liu, L., Cao, Z., Shen, C.: From open set to closed set: Counting objects by spatial divide-and-conquer. In: ICCV (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.425, + 0.788, + 0.452 + ], + "angle": 0, + "content": "50. Xiong, H., Yao, A.: Discrete-constrained regression for local counting models. In: ECCV (2022) 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.452, + 0.788, + 0.479 + ], + "angle": 0, + "content": "51. Xu, C., Liang, D., Xu, Y., Bai, S., Zhan, W., Bai, X., Tomizuka, M.: Autoscale: learning to scale for crowd counting. IJCV (2022) 4, 11, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.48, + 0.788, + 0.522 + ], + "angle": 0, + "content": "52. Xu, X., Wang, Z., Shi, H.: Ultrasr: Spatial encoding is a missing key for implicit image function-based arbitrary-scale super-resolution. arXiv preprint arXiv:2103.12716 (2021) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.522, + 0.788, + 0.55 + ], + "angle": 0, + "content": "53. Zhang, Y., Zhou, D., Chen, S., Gao, S., Ma, Y.: Single-image crowd counting via multi-column convolutional neural network. In: CVPR (2016) 2, 9, 11, 12, 13" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.55 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_origin.pdf b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..77fe99979e358c544869e3298f4b42b515403162 --- /dev/null +++ b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/b63f26cb-4637-4c38-a9db-12df96b5019b_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8ae7aa9b107396b0dacf809e4515af9332f23a09ae3878c8522ca7da0eedbaba +size 1585577 diff --git a/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/full.md b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/full.md new file mode 100644 index 0000000000000000000000000000000000000000..de41b904b8e05978bc3de6993604cb11022b88f3 --- /dev/null +++ b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/full.md @@ -0,0 +1,324 @@ +# Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance + +I-Hsiang Chen $^{1}$ , Wei-Ting Chen $^{1,2}$ , Yu-Wei Liu $^{1}$ , Ming-Hsuan Yang $^{2,3}$ , and Sy-Yen Kuo $^{1,4}$ + +$^{1}$ National Taiwan University, Taiwan + +2 University of California at Merced, USA + +3 Google DeepMind, USA + +4 Chang Gung University, Taiwan + +{f09921058,f05943089,r12943109}@ntu.edu.tw, mhyang@ucmerced.edu, + +sykuo@ntu.edu.tw + +Abstract. Crowd counting and localization have become increasingly important in computer vision due to their wide-ranging applications. While point-based strategies have been widely used in crowd counting methods, they face a significant challenge, i.e., the lack of an effective learning strategy to guide the matching process. This deficiency leads to instability in matching point proposals to target points, adversely affecting overall performance. To address this issue, we introduce an effective approach to stabilize the proposal-target matching in point-based methods. We propose Auxiliary Point Guidance (APG) to provide clear and effective guidance for proposal selection and optimization, addressing the core issue of matching uncertainty. Additionally, we develop Implicit Feature Interpolation (IFI) to enable adaptive feature extraction in diverse crowd scenarios, further enhancing the model's robustness and accuracy. Extensive experiments demonstrate the effectiveness of our approach, showing significant improvements in crowd counting and localization performance, particularly under challenging conditions. + +Keywords: Crowd Counting, Crowd Localization, Auxiliary Learning, Feature Interpolation + +# 1 Introduction + +Recent years have witnessed the advances and importance of crowd counting and localization in numerous tasks, including surveillance, event management, and urban planning [1,8,14,18,21,22,27,46,48]. The pursuit of accurately estimating crowd size and discerning individual locations is fraught with challenges, ranging from fluctuating crowd densities and occlusions to varying environmental settings. + +![](images/0e3338a5cd9aaee42c69b2729dcce790390aa1a1a5ac90892ba31c619883740e.jpg) +Fig. 1: (Left) Crowd Counting and Localization: Comparison with state-of-the-art methods (e.g., LSC-CNN [39], TopoCount [1], P2PNet [43] and CLTR [20]) demonstrating the proposed APGCC's effectiveness in accurately counting and localizing in crowded scenes. (Right) Matching Process Instability: Illustrates the instability in selecting point proposals during the matching process by existing point-based methods (e.g., Matcher [16]) across training epochs, indicated by the Instability Rate (IR), which measures the inconsistency rate of point proposal selection per epoch, leading to limited performance. Both evaluations are conducted on the ShanghaiTech A (SHHA) [53] dataset. + +![](images/e9e399ff79d8c55d2f528361ef60b8d05ffa68e757d2fa8a6500396e48827228.jpg) + +Within the domain of crowd analysis, two principal methodologies emerge: map-based and localization-based approaches. Map-based methods, employing Gaussian kernels to render density maps, effectively provide models with critical information for learning crowd densities. Renowned for their high accuracy in crowd counting, these methods have been validated across a series of studies, including [11,14,25,26,28,31]. Despite their capacity to achieve localization through additional designs [1,13,46], they still confront challenges such as the overlapping of maps in densely populated areas and the need for multi-scale representations. This leads to difficulties in precise localization with non-differentiable post-processing techniques like "find-maxima". + +Localization-based approaches encompass two divergent strategies: detection-based and point-based methods. Detection-based techniques [29, 39], characterized by the initiation of pseudo ground truth bounding boxes using nearest-neighbor distances, are tailored for specific scenarios but encounter accuracy limitations in highly congested and sparse areas. Despite their practicality, these methods often contend with the constraints of heuristic post-processing, such as non-maximum suppression, potentially leading to inaccuracies [20]. + +In contrast, the elegance of point-based methods [20, 24, 43] lies in directly using point annotations as learning targets. These frameworks can direct the regression of individual coordinates, simplifying the localization process. These methods are celebrated for their simplicity, end-to-end trainability, and independence from complex pre-processing and multi-scale feature map fusion. However, a significant challenge in point-based methods for crowd analysis is the insta + +bility of proposal-target matching during training, as illustrated in Figure 1. In each epoch, a large proportion of target points are matched with different point proposals compared to the previous epoch. This issue arises due to the absence of an effective learning strategy to guide the network in consistently selecting the most appropriate proposals during optimization. Consequently, the constantly changing relationships between proposals and targets lead to vague and unclear learning objectives for each proposal. This uncertainty in the learning process often results in localized inaccuracies, manifesting as either underestimation or overestimation in specific areas of crowded scenes. + +In this paper, we address the prevailing issue of uncertainty in proposal-target matching within point-based methods for crowd analysis. We introduce a novel learning paradigm, Auxiliary Point Guidance Crowd Counting (APGCC), designed to instruct the network on the precise selection and optimization of point proposals for matching with target points. APGCC provides a clear and effective directive, ensuring accurate and informed decisions in the proposal selection and optimization process. + +To facilitate the application of APGCC, which necessitates feature extraction at arbitrary positions, we propose a method utilizing Implicit Feature Interpolation. This technique adeptly addresses the challenge of accessing features from diverse locations within the network, thereby ensuring the versatility and efficacy of our model in various crowd scenarios. By enhancing the robustness of the matching relationships between proposals and targets, our approach significantly improves the precision and reliability of crowd analysis models. + +Extensive experimental results demonstrate that the proposed APG strategy effectively addresses the instability issues in proposal-target matching during the training process (orange curve in Figure 1). Moreover, it significantly enhances the performance of crowd counting. Our method performs robustly and favorably against state-of-the-art schemes in both crowd counting and localization tasks. We make the following contributions in this work: + +- We introduce Auxiliary Point Guidance, a novel strategy to address the uncertainty in proposal-target matching within point-based crowd counting methods. APG guides the precise selection and optimization of proposals, enhancing model accuracy. +- We develop an Implicit Feature Interpolation method, enabling effective feature extraction at arbitrary positions. This technique improves the robustness and versatility of our model, particularly in various crowd scenarios. + +# 2 Related Work + +In the realm of crowd counting, methodologies are broadly categorized into map-based [2, 2, 11, 14, 18, 25, 25, 26, 28, 31, 33, 49] and localization-based approaches [17, 19, 23, 29, 39], each with distinct strategies and challenges. + +Map-based Approaches use Gaussian kernel density maps to achieve localization and counting. Pioneered by researchers like Idrees et al. [13] and Gao et al. [8], these methods identify individual positions as peaks on density maps. + +However, they encounter challenges with overlapping in dense crowds. Innovations such as the Distance Label Map [51], Focal Inverse Distance Transform Map (FIDTM) [21], and Independent Instance Map (IIM) [9] have been introduced to mitigate these issues, though they still require complex post-processing steps. Concurrently, these approaches also advance crowd counting accuracy by integrating density map values, with enhancements like composition loss [13] and inter-domain feature segregation [8]. These approaches successfully reduce overlaps in crowded areas, yet they require a post-processing step, such as "find-maxima", to pinpoint individual locations. Additionally, their reliance on multiscale feature maps adds to their complexity, detracting from their simplicity and elegance. + +Localization-based Approaches: In crowd analysis, localization-based methods integrate both detection-based and point-based strategies. Detection-based approaches, utilizing frameworks like Faster RCNN [37], focus on generating pseudo bounding boxes using techniques such as nearest neighbor distance, as seen in [39], and a winner-take-all loss for refining box selection, especially beneficial for high-resolution images. Liu et al. [29] employs curriculum learning to enhance detection and bounding box prediction accuracy. However, these methods often contend with the challenge of pseudo-ground-truth boxes derived from weak point supervision, which can be particularly unreliable in densely populated areas, thus impeding model training and leading to imprecise box predictions. Additionally, they typically involve Non-Maximum Suppression (NMS) in their box filtering process, which is not designed for end-to-end training [48]. + +In contrast, point-based approaches like those proposed by Song et al. [43] (P2PNet), Liang et al. [20] (CLTR), and Liu et al. [24] (PET) emphasize directly estimating individual head positions, dynamically adjusting to various crowd densities. These methods significantly enhance the accuracy and process efficiency of localization tasks. Nevertheless, their performance can be limited by the instability of proposal-target matching during training, often leading to regional underestimation or overestimation due to unclear learning objectives for proposals. + +# 3 Preliminary: Point-based Crowd Counting Framework + +This framework [43] comprises three main components essential for point-based crowd counting: Point Proposal Prediction, Proposal-Target Matching, and Loss Calculation. + +Point Proposal Prediction involves generating point proposals from the deep feature map $\mathcal{F}_s$ outputted by the backbone network, where $s$ is the downsampling stride, and $\mathcal{F}_s$ has a size of $H\times W$ . The process includes two parallel branches: regression for predicting point coordinate offsets and classification for determining confidence scores. Each pixel on $\mathcal{F}_s$ corresponds to a patch in the input image, with a predefined set of reference points $\mathcal{R} = R_k|k\in \{1,\dots,K\}$ where $K$ is the total number of reference points. The regression branch outputs $H\times W\times K$ point proposals, with the coordinates of a proposal $\hat{p}_j = (\hat{x}_j,\hat{y}_j)$ + +calculated as: $\hat{x}_j = x_k + \gamma \Delta_{jx}^k$ and $\hat{y}_j = y_k + \gamma \Delta_{jy}^k$ where $\gamma$ scales the predicted offsets, $\Delta_{jx}^k$ and $\Delta_{jy}^k$ present predicted offsets for its coordinates of a proposal $\hat{p}_j = (\hat{x}_j, \hat{y}_j)$ . + +Proposal-Target Matching follows the Point Proposal Prediction, utilizing the Hungarian algorithm [16] as proposal-target matching $\mathcal{O}(\mathcal{P},\hat{\mathcal{P}},\mathcal{D})$ . This strategy ensures a one-to-one correspondence where each ground truth target from $\mathcal{P}$ is matched with a point proposal in $\hat{\mathcal{P}}$ . The matching is based on the pair-wise cost matrix $\mathcal{D}$ of size $N\times M$ where $N$ and $M$ denote the number of ground truth points and point proposals. The matrix $\mathcal{D}$ combines the Euclidean distance between point pairs and the confidence score $\hat{c}_j$ of each proposal, defined as $D(P,\hat{P}) = \left(\tau ||p_i - \hat{p}_j||_2 - \hat{c}_j\right)_{i\in N,j\in M}$ , where $\tau$ balances the pixel distance and $\hat{c}_j$ is the confidence score of proposal $\hat{p}_j$ . + +After the matching process, in the optimal matching results denoted as $\Theta$ , each ground truth point $p_i$ is optimally matched to a point proposal $\hat{p}_j$ , with the matching result represented by the permutation $\psi = \Theta(\mathcal{P}, \hat{\mathcal{P}}, \mathcal{D})$ . Thus, $\hat{p}_{\psi(i)}$ is the proposal matched to ground truth point $p_i$ . The set of matched proposals, $\hat{\mathcal{P}}\mathrm{pos} = \hat{p}_{\psi(i)}|i \in \{1, \dots, N\}$ , are considered positives, while the unmatched ones, $\hat{\mathcal{P}}\mathrm{neg} = \hat{p}_{\psi(i)}|i \in \{N + 1, \dots, M\}$ , are negatives. + +Loss Calculation integrates Euclidean loss $\mathcal{L}_{loc}$ for point regression and Cross Entropy loss $\mathcal{L}_{cls}$ for proposal classification. The combined loss function $\mathcal{L}_{point}$ is: + +$$ +\mathcal {L} _ {c l s} = - \frac {1}{M} \left(\sum_ {i = 1} ^ {N} \log \hat {c} _ {\psi (i)} + \lambda_ {1} \sum_ {i = N + 1} ^ {M} \log \left(1 - \hat {c} _ {\psi (i)}\right)\right), \tag {1} +$$ + +$$ +\mathcal {L} _ {l o c} = \frac {1}{N} \sum_ {i = 1} ^ {N} \left| \left| p _ {i} - \hat {p} _ {\psi (i)} \right| \right| _ {2} ^ {2}, \tag {2} +$$ + +$$ +\mathcal {L} _ {\text {p o i n t}} = \mathcal {L} _ {\text {c l s}} + \lambda_ {2} \mathcal {L} _ {\text {l o c}}, \tag {3} +$$ + +where $\hat{c}_{\psi(i)}$ is the confidence score of the matched proposal $\hat{p}_{\psi(i)}$ , $\lambda_1$ adjusts the impact of negative proposals, and $\lambda_2$ balances the regression loss. + +# 4 Proposed Method + +While current Point-based Approaches demonstrate promising results in crowd counting and localization, we identified instability in the optimization of the matching process, potentially limiting overall performance. We introduce several components designed to stabilize and enhance the matching mechanism to address this challenge. + +# 4.1 Auxiliary Point Guidance + +We introduce an explicit guidance mechanism to enhance the optimization process's stability during the network's matching phase. As shown in Figure 2, + +![](images/a61dec336c408d749859d71e5d1418ba2a0742f9047dec1bd8386ad14527c61c.jpg) +Fig.2: Illustration of the Auxiliary Point Guidance framework. During the model's training, we additionally introduce auxiliary positive $(A_{\mathrm{pos}})$ and negative $(A_{\mathrm{pos}})$ points based on each ground truth position to guide the network's learning. This approach helps in directing the optimization process more effectively by distinguishing between potential positive and negative matches. + +this involves the strategic designation of auxiliary positive $(A_{\mathrm{pos}})$ and negative $(A_{\mathrm{neg}})$ points within the optimization framework, determined based on ground truth coordinates $(x,y)$ . The sets of positive and negative points are defined as $A_{\mathrm{pos}}^i = \{(x + R_{\mathrm{pos}}^{i,x},y + R_{\mathrm{pos}}^{i,y}) \mid i = 1,2,\ldots,k_{\mathrm{pos}}\}$ and $A_{\mathrm{neg}}^j = \{(x + R_{\mathrm{neg}}^{j,x},y + R_{\mathrm{neg}}^{j,y}) \mid j = 1,2,\ldots,k_{\mathrm{neg}}\}$ . Here, $R_{\mathrm{pos}}^{i,x}$ and $R_{\mathrm{pos}}^{i,y}$ represent a series of randomness numbers used to generate the $x$ and $y$ coordinates of positive points, respectively, with each number uniformly distributed between $-n_{\mathrm{pos}}$ and $n_{\mathrm{pos}}$ . Similarly, $R_{\mathrm{neg}}^{j,x}$ and $R_{\mathrm{neg}}^{j,y}$ denote series of randomness numbers for generating the $x$ and $y$ coordinates of negative points, each uniformly distributed between $[-n_{\mathrm{neg}}, - n_{\mathrm{pos}}]$ or $[n_{\mathrm{pos}},n_{\mathrm{neg}}]$ . The variables $k_{\mathrm{pos}}$ and $k_{\mathrm{neg}}$ denote the total number of positive and negative points generated, respectively. Each set $R_{\mathrm{pos}}^i$ and $R_{\mathrm{neg}}^j$ is used to create a unique set of coordinates for $A_{\mathrm{pos}}$ and $A_{\mathrm{neg}}$ , thereby offsetting the ground truth position $(x,y)$ by these randomness numbers. + +Based on the auxiliary positive points $A_{\mathrm{pos}}$ , we extract their corresponding features. From these features, we then predict the confidence $\hat{c}_{\mathrm{pos}}^{\star}$ and offset and then calculate the position of the proposal $\hat{p}_{\mathrm{pos}}^{\star}$ for each point. Our objective is to ensure that the confidence of auxiliary positive points is as close to one as possible and that their predicted offsets closely match the added randomness number. To achieve this, we formulate the loss function for the auxiliary positive point as follows: + +$$ +\mathcal {L} _ {A P G} ^ {p o s} = \frac {1}{N} \frac {1}{k _ {\mathrm {p o s}}} \sum_ {l = 1} ^ {N} \sum_ {i = 1} ^ {k _ {\mathrm {p o s}}} (\log \hat {c} _ {\mathrm {p o s}} ^ {\star} (l, i) + \lambda_ {3} \left| | p _ {l} - \hat {p} _ {\mathrm {p o s}} ^ {\star} (l, i) | | _ {2} ^ {2}\right), \tag {4} +$$ + +where $\lambda_3$ represents a scaling factor. + +For the auxiliary negative points $(A_{\mathrm{neg}})$ , our aim is for their confidence $\hat{c}_{\mathrm{neg}}^{\star}$ to be as close to zero as possible. Similarly, we desire their offsets $\varDelta_{\mathrm{neg}}^{\star}$ to approach zero, preventing negative points from using offsets to bring their proposal + +![](images/e948333983eee293c817c614e2b90d44b809c44f4beb332bdf179cc9ae370f01.jpg) +Fig. 3: Illustration of Implicit Feature Interpolation. Given an arbitrary desired point position $(x, y)$ , we concatenate the nearest four feature maps $(Z_1^{\star} - Z_4^{\star})$ along with their distances $(\delta_1^{\star} - \delta_4^{\star})$ to the $(x, y)$ with positional encoding $\phi$ and utilize a Multi-Layer Perceptron (MLP) $f_{\theta}$ to interpolate the latent feature for that specific location. This approach enables precise feature extraction at non-grid locations, facilitating more flexible and accurate feature representation. + +coordinates close to the ground truth. This is crucial to mitigate the potential of these negative points being erroneously considered as matched proposals during the matching process. The loss function specifically formulated for auxiliary negative points is as follows: + +$$ +\mathcal {L} _ {A P G} ^ {n e g} = \frac {1}{N} \frac {1}{k _ {\text {n e g}}} \sum_ {l = 1} ^ {N} \sum_ {j = 1} ^ {k _ {\text {n e g}}} \left(\log \left(1 - \hat {c} _ {\text {n e g}} ^ {\star} (l, j)\right) + \lambda_ {4} \left| | \Delta_ {\text {n e g}} ^ {\star} (l, j) | | _ {2} ^ {2}\right), \right. \tag {5} +$$ + +where $\lambda_4$ represents a scaling factor. + +The total loss of the Auxiliary Point Guidance can be formulated as: + +$$ +\mathcal {L} _ {A P G} = \mathcal {L} _ {A P G} ^ {\text {p o s}} + \mathcal {L} _ {A P G} ^ {\text {n e g}}. \tag {6} +$$ + +Through this additional guidance, we can direct the network to train point proposals closest to the ground truth points as positive points, while treating those farther away as negative points. This guidance assists the network in consistently selecting the same positive point for each ground truth point during the matching process. Importantly, the chosen positive point is likely to be the correct match, being in close proximity to the ground truth point. By employing this guidance, we address the instability issue inherent in the matching process, thereby enhancing the network's performance. + +However, since auxiliary points are randomly assigned based on ground truth coordinates, traditional bilinear interpolation is not suitable for extracting features at these arbitrary positions. Therefore, we propose the use of implicit feature interpolation to obtain these features. The details of this approach will be described in the following section. + +# 4.2 Implicit Feature Interpolation + +Implicit functions have demonstrated their efficacy in providing robust and continuous feature representations, significantly benefiting various computer vision tasks as evidenced in previous studies [4, 34, 35]. In Auxiliary Point Guidance, we leverage implicit function-based interpolation to extract latent features that are both arbitrary and robust. As depicted in Figure 3, for a given point location $(x,y)$ , we first determine the four nearest latent features, denoted as $Z_{i}^{*}|i\in \{1,\dots,4\}$ . We then calculate their respective spatial distances from the target latent feature, represented as $\delta_i^* |i\in \{1,\dots,4\}$ . These four latent features, along with their calculated distances, are concatenated channel-wise. This concatenated information is then fed into a MLP to yield the target latent feature. However, it is known that MLPs tend to prioritize low-frequency information, often overlooking crucial high-frequency details, which can impact the performance of the MLP [3, 36, 44]. To counter this limitation, we employ positional encoding as suggested in [52], enhancing the dimensionality of the distance information. By integrating positional encoding with the distance data, we address this high-frequency detail loss. The entire implicit feature interpolation process is encapsulated in the following formulation: + +$$ +F _ {\text {p r o p o s a l}} (x, y) = \sum_ {i = 1} ^ {4} \frac {S _ {i}}{S} f _ {\theta} \left(Z _ {i} ^ {*}, \delta_ {i} ^ {*}, \phi \left(\delta_ {i} ^ {*}\right)\right), \tag {7} +$$ + +where $S_{i}$ represents the area surrounding the diagonal point with the target point, and $S$ is the sum of these areas, calculated as $S = \sum_{i=1}^{4} S_{i}$ . Here, $f_{\theta}(\cdot)$ symbolizes the MLP, $\phi(\cdot)$ denotes positional encoding, and $F_{proposal}(x,y)$ is the resultant interpolated feature for the point $(x,y)$ . + +# 4.3 Architecture Overview + +Our architecture, as illustrated in Figure 4, begins with the extraction of image features using a pre-trained backbone, specifically VGG-16 [41]. We focus on the feature maps from the final two layers (i.e., conv 3 and conv 4). These features are then enhanced for scale diversity through the application of Atrous Spatial Pyramid Pooling (ASPP) [7]. Following this, each set of features undergoes an implicit feature interpolation process, which results in the computation of the corresponding features $F_{proposal}(x,y)$ . The interpolated features are subsequently concatenated and input into both the confidence and regression modules. These modules are responsible for predicting the confidence level and offset for each point in the image. The training of the network is accomplished using a combination of the original point-based constraint, as defined in (3), and the proposed Auxiliary Point Guidance, as stated in (6). The total loss function, denoted as $\mathcal{L}_{overall}$ , is formulated as follows: + +$$ +\mathcal {L} _ {\text {o v e r a l l}} = \mathcal {L} _ {\text {p o i n t}} + \lambda_ {5} \mathcal {L} _ {\text {A P G}}, \tag {8} +$$ + +where $\lambda_5$ represents a scaling factor. + +![](images/44a15ff6054023f8f1a19230e91e492b8c92f5f207e6d5244efe2d153e726740.jpg) +Fig. 4: Illustration of the proposed APGCC for crowd counting and localization. A VGG encoder extracts image features, where features from conv3 and conv4 layers undergo refinement via Atrous Spatial Pyramid Pooling [7]. Subsequently, target latent features are interpolated using implicit feature interpolation. These latent features are then processed through a prediction head to obtain confidence score $\hat{c}$ and offsets $(\Delta_x, \Delta_y)$ , facilitating precise crowd counting and localization. + +# 5 Implementation Details + +# 5.1 Datasets + +We use the ShanghaiTechA [53], ShanghaiTechB [53], UCF_CC_50 [12], UCF-QNRF [13], JHU-Crowd++ [42], and NWPU-Crowd [47] datasets to evaluate the performance of the proposed method against the state-of-the-art approaches. ShanghaiTech A dataset [53] includes 482 images with 244,167 annotated points. The dataset is divided into 300 training images and 182 testing images. + +ShanghaiTech B (SHHB) dataset [53] features 716 images and 88,488 annotated points, with a split of 400 training images and 316 testing images. + +UCF_CC_50 dataset [12] encompasses 50 images, totaling 63,974 annotated points. We adhere to a five-fold cross-validation as outlined in [12]. + +UCF-QNRF dataset [13] contains 1,535 high-resolution web-collected images, with over 1.25 million annotated points. It splits into 1,201 training images and 334 testing images, featuring a broad people count range from 49 to 12,865. + +JHU-Crowd++ dataset [42] comprises 4,372 images, totaling 1.51 million annotated points. It allocates 2,272 images for training, 500 for validation, and reserves 1,600 images for testing. + +NWPU-Crowd dataset [47] includes 5,109 images with more than 2.13 million annotated points, distributed across 3,109 training images, 500 validation images, and 1,500 testing images. + +# 5.2 Evaluation Protocol + +Counting Metrics. We employ Mean Absolute Error (MAE) and Mean Squared Error (MSE) as our primary performance metrics, in line with standard practices in the field, defined as $MAE = \frac{1}{Q}\sum_{i=1}^{Q}|GT_i - N_i|$ , $MSE = \sqrt{\frac{1}{Q}\sum_{i=1}^{Q}(GT_i - N_i)^2}$ , where $Q$ represents the total number of images in the dataset, with $GT_i$ and $N_i$ indicating the actual and predicted crowd counts for the $i$ -th image, respectively. Localization Metrics. To assess localization accuracy, we utilize Precision (P), Recall (R), and F1-measure (F), following the methodologies in [13, 47]. A predicted point is considered a True Positive (TP) if its distance from the corresponding ground truth (GT) point is within a specified threshold $\sigma$ . For the NWPU-Crowd dataset [47], which includes box-level annotations, $\sigma$ is defined as $\sqrt{(w^2 + h^2)/2}$ , where $w$ and $h$ are the width and height of each head. In contrast, for the ShanghaiTech dataset, we apply fixed thresholds of $\sigma = 4$ and $\sigma = 8$ . + +# 5.3 Training Details + +We utilize Adam optimization [15] with a learning rate of $10^{-4}$ for general model optimization. Given that the VGG-16 backbone network weights are pre-trained on ImageNet, a reduced learning rate of $10^{-5}$ is applied for these components. We adopted a grid layout strategy [43] for mapping proposals. The initial point proposal stride is set at $s = 8$ . The number of reference points $K$ varies depending on the dataset: 4 for most and 8 for the QNRF dataset, aligned with dataset statistics to ensure $M > N$ . The prediction head comprises four layers with hidden feature dimensions of [1024, 512, 256, 256], and a shared prediction head is used for our point proposals. For point regression, we set $\gamma$ at 100, and the matching weight term $\tau$ at $5 \times 10^{-2}$ . In auxiliary points learning, the number of positive and negative points $(k_{\mathrm{pos}}, k_{\mathrm{neg}})$ are set to (2, 2). Randomness ranges $(n_{\mathrm{pos}}, n_{\mathrm{neg}})$ are set to (2, 8). The loss coefficients are adjusted as $\lambda_1 = 0.5$ , $\lambda_2 = 2 \times 10^{-4}$ , $\lambda_3 = 2 \times 10^{-4}$ , $\lambda_4 = 2 \times 10^{-4}$ , and $\lambda_5 = 0.2$ to balance different term contributions. + +Data augmentation involves initial random scaling (factor range: [0.7, 1.3]), ensuring the shorter side is at least 128 pixels. Images are then randomly cropped to $128 \times 128$ patches and subjected to random flipping with a 0.5 probability. The training batch size is 8. The longer side of each image is restricted to 1920 pixels for UCF-QNRF, JHU-Crowd++, and NWPU-Crowd, while maintaining the original aspect ratio. + +# 6 Experimental Results + +In this section, we present the evaluation results of the proposed method for crowd counting and localization. More results are available in the supplementary material. + +Table 1: Evaluation of crowd counting on SHHA [53], SHHB [53], UCF-QNRF [13], JHU-Crowd [42] datasets. + +
MethodLocalizationMannerSHHASHHBUCF-QNRFJHU-Crowd+
MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓
AMSNet [11]XMap-based56.793.46.710.2101.8163.2--
SDA+DM [30]XMap-based55.092.7--80.7146.359.3248.9
GauNet+CSRNet [5]XMap-based61.297.87.612.784.2152.469.4262.4
DC [50]XMap-based61.696.77.111.191.4157.567.2288.2
ChfL [40]XMap-based57.594.36.911.080.3137.657.0235.7
HMoDE [6]XMap-based54.487.46.29.8--55.7214.6
LSC-CNN [39]✓Detection-based66.4117.08.112.7120.5218.2112.7454.4
TopoCount [1]✓Detection-based61.2104.67.813.789.0159.060.9267.4
GL [46]✓Map-based61.395.47.311.784.3147.559.9259.5
P2PNet [43]✓Point-based52.785.16.29.985.3154.5--
CLTR [20]✓Point-based56.995.26.510.685.8141.359.5240.6
PET [24]✓Point-based49.378.76.19.679.5144.358.5238.0
APGCC✓Point-based48.876.75.68.780.1136.654.3225.9
+ +Table 2: Evaluation of crowd count- Table 3: Evaluation of crowding on UCF CC 50 [12] dataset. counting on NWPU [47] dataset. + +
MethodLocalizationMannerMAE ↓MSE ↓
BL [31]XMap-based229.3308.2
AMSNet [11]XMap-based208.4297.3
GauNet+CSRNet [5]XMap-based215.4296.4
HMoDE [6]XMap-based159.6211.2
P2PNet [43]✓Point-based172.7256.1
PET [24]✓Point-based159.9223.7
APGCC✓Point-based154.8205.5
+ +
MethodLocalizationMannerMAE \( \downarrow \)MSE \( \downarrow \)
NoisyCC [45]✘Map-based96.9534.2
UOT [32]✘Map-based87.8387.5
MAN [22]✘Map-based76.5323.0
ChfL [40]✘Map-based76.8343.0
HMoDE+REL [6]✘Map-based73.4331.8
RAZ [23]✓Map-based151.4634.6
GL [46]✓Map-based79.3346.1
AutoScale [51]✓Map-based123.9515.5
TopoCount [1]✓Detection-based107.8438.5
P2PNet [43]✓Point-based77.4362.0
CLTR [20]✓Point-based74.3333.8
PET [24]✓Point-based74.4328.5
APGCC✓Point-based71.7284.4
+ +# 6.1 Evaluation on Crowd Counting + +This section outlines our comparative analysis of crowd counting methods, where our approach is benchmarked against an array of state-of-the-art techniques across diverse datasets. We evaluate our performance against both map-based [5, 6, 11, 22, 23, 30-32, 40, 45, 46, 50, 51], detection-based [1, 39] and point-based [20, 24, 43] methodologies. Our experiments, detailed in Tables 1, 2, and 3, highlight APGCC's leading performance, with the best results in bold and the second-best results underlined. These findings affirm the effectiveness and adaptability of our approach in various crowd counting scenarios. + +Table 1 focuses on datasets such as SHHA [53], SHHB [53], UCF-QNRF [13] and JHU-Crowd [42], showcasing APGCC's significant improvements in accuracy metrics like MAE and MSE. For example, compared to P2PNet [43] on the SHHA [53] and SHHB [53] datasets, APGCC achieved substantial reductions in both MAE and MSE, demonstrating its effectiveness even in sparse and simple scene conditions. + +In Table 2, we specifically examine the UCF_CC_50 dataset [12], a challenging set of 50 images with complex scenes. Our approach notably excels, achieving impressive results that underscore the efficiency and stability of our learning strategy, particularly beneficial for datasets with limited images. + +Finally, Table 3 presents our performance on the NWPU-Crowd dataset [47], the most extensive congested dataset considered in our study. Our approach out- + +Table 4: Evaluation of crowd localization on NWPU [47] dataset. + +
MethodManner\( {\sigma }_{t} \) (large threshold)\( {\sigma }_{s} \) (small threshold)
F(%) \( \uparrow \)P(%) \( \uparrow \)R(%) \( \uparrow \)F(%) \( \uparrow \)P(%) \( \uparrow \)R(%) \( \uparrow \)
RAZ [23]Map-based59.866.654.357.647.051.7
AutoScale [51]Map-based67.357.462.0---
GL [46]Map-based66.080.056.258.771.150.0
TinyFaces [10]Detection-based56.752.961.152.649.156.6
TopoCount [1]Detection-based63.765.162.4---
P2PNet [43]Point-based71.272.969.567.568.466.6
CLTR [20]Point-based68.569.467.659.159.958.3
PET [24]Point-based74.275.273.267.568.466.6
APGCCPoint-based76.479.273.668.971.566.5
+ +Table 5: Evaluation of crowd localization on SHHA [53] dataset. + +
MethodMannerσ = 4σ = 8
F(%) ↑P(%) ↑R(%) ↑F(%) ↑P(%) ↑R(%) ↑
LOBB [38]Map-based25.934.920.753.967.644.8
LCFCN [17]Detection-based32.543.326.056.375.145.1
LSC-CNN [39]Detection-based32.633.431.962.463.961.0
TopoCount [1]Detection-based41.141.740.673.674.672.7
P2PNet [43]Point-based40.641.539.874.676.273.1
CLTR [20]Point-based43.243.642.774.274.973.5
APGCCPoint-based48.749.248.378.479.177.7
+ +performs the competition, including the second-best method, HMoDE+REL [6], by achieving lower MAE and MSE. This success can be attributed mainly to our implementation of Auxiliary Points Guidance and the enhancement provided by the Implicit Feature Interpolation technique, which together significantly improve model reliability and adaptability to different scales and densities. + +# 6.2 Evaluation on Crowd Localization + +We benchmark our approach against a diverse array of methods, including map-based methods such as RAZ [23], AutoScale [51], LOBB [38], and GL [46]; detection-based methods like TinyFaces [10], TopoCount [1], LSC-CNN [39], and LCFCN [17]; as well as point-based methods including P2PNet [43], CLTR [20], and PET [24]. + +Table 4, focusing on the NWPU dataset [47], showcases APGCC's superior performance. Compared to detection-based methods that utilize box-level annotations and other point-based approaches, APGCC leverages IFI to acquire precise features and utilizes closer proposal predictions to achieve optimal precision. Conversely, in the SHHA dataset [53], as detailed in Table 5, APGCC secures comprehensive improvements: at a $\sigma = 4$ , the F1-measure increased by $5.5\%$ , and at $\sigma = 8$ , it rose by $3.8\%$ . + +# 6.3 Evaluation of Model Complexity + +In Table 6, we benchmark APGCC against other point-based methods, focusing on the number of parameters and inference time. The inference time evaluations are conducted on an NVIDIA 3090 GPU with an input resolution of $1024 \times 1024$ . The findings illustrate that APGCC maintains efficient computational complexity and delivers superior performance in crowd counting and localization tasks. Note that since our APG training mechanism is employed only during training, it does not incur additional computational overhead during inference. Compared to the original point-based method (i.e., P2PNet [43]) that utilizes traditional upsampling to process features, our use of IFI allows for more accurate representation learning with fewer parameters. This method enhances computational efficiency, as employing MLPs for feature interpolation is known to be efficient [35]. + +# 6.4 Ablation Study + +We evaluate the effectiveness of the proposed two modules, APG and IFI. We evaluate the performance on SHHA dataset [53]. + +Effectiveness of APG. We explore the impact of different optimization strategies, with several distinct settings as follows: (a) "Matcher" solely employs the matching strategy as described in Section 3 and [43], (b) "Nearest Point" directly selects the proposal closest to the ground truth as the positive proposal, with all others considered negative, (c) "APG", which exclusively utilizes the proposed APG for training, and (d) "Matcher + APG" (Ours). The experimental results, as shown in Table 7, indicate that while strategy (b) may seem intuitive and straightforward to design, it risks multiple ground truths mapping to the same proposal, severely underestimating the final counting. Consequently, using (a) can guide the model on how to allocate proposals for learning and introduce confidence information to enhance discrimination. Our proposed APG effectively addresses the shortcomings of the nearest point, providing an equivalent number of proposals for the model to learn to match the closest proposals. However, as auxiliary positive points cannot be provided during the inference phase, relying solely on APG can make the model overly dependent on reference values. Therefore, by combining the advantages of Matcher and APG (i.e., (d)), we not only teach the model how to allocate a fixed number of proposals but also guide it to make more elegant choices. + +Optimizing APG Setup. Our exploration into optimizing APG focuses on two key aspects: (i) determining the optimal number of potential positive and negative points ( $k_{\mathrm{pos}}$ and $k_{\mathrm{neg}}$ ), as defined in Section 4.1, and (ii) adjusting the randomness scale of APG ( $n_{\mathrm{neg}}$ and $n_{\mathrm{pos}}$ ), with findings detailed in Tables 8 and 9. + +Table 8 explores the impact of the number of auxiliary positive and negative points on performance, essential for validating the APG's effectiveness. The results indicate that while using only auxiliary positive points slightly favors the selection of nearest proposals, it's limited in preventing duplicate predictions. Introducing auxiliary negative points enhances differentiation and training stability by encouraging the model to reject distant proposals. Despite an increase in auxiliary point pairs leading to better stabilization (lower Avg. IR and Avg. $\Delta$ ), the effect on final performance (MAE) is minimal. Thus, we suggest utilizing a balanced (2, 2) ratio of positive to negative points to achieve better learning performance. This is because training with a (5, 5) setting requires roughly twice the training effort compared to (2, 2), without a significant improvement in performance. + +Additionally, the degree of randomness applied to auxiliary proposals plays a pivotal role in the configuration of the APG. Our experiments, executed with a stride of 8, have demonstrated that a precise range of randomness is crucial for attaining optimal results, as evidenced in Table 9. While a constrained randomness range may limit the diversity in proposal selection, an excessive range of randomness could jeopardize the model's confidence uniformity across different areas, impacting its effectiveness. + +Table 6: Comparison of model complexity with Point-based Approaches. + +
MethodP2PNet [43]CLTR [20]PET [24]APGCC
Parameters (M) ↓21.643.420.918.68
Inference Time (s) ↓0.0740.1070.0970.071
+ +Table 8: Evaluation of different number of auxiliary points + +
Num. of Auxiliary Points (kpos, kneg)(0, 0)(1, 0)(2, 0)(1, 1)(2, 2)(5, 5)
MAE ↓54.0451.5751.4749.2448.8448.81
Avg. IR ↓0.700.490.480.380.360.34
Avg. Δ ↓6.873.893.371.621.581.49
+ +Table 7: Analysis on alternatives of optimization strategies. + +
SettingStrategyMAE ↓MSE ↓
(a)Matcher54.0486.97
(b)Nearest Point76.91118.60
(c)APG58.4696.71
(d)Matcher + APG (Ours)48.8476.79
+ +Table 9: Comparison of different range of randomness for auxiliary points + +
Randomness Range (npos, nneg)(1, 4)(2, 8)(3, 12)(4, 16)
MAE ↓49.2548.8450.2351.23
+ +Table 10: Ablation study of Implicit Feature Interpolation. + +
SettingMethodMAE ↓MSE ↓F1@4 ↑F1@8 ↑
(a)Nearest Neighbor without MLP53.1683.3143.5976.27
(b)Bilinear Interpolation without MLP51.2579.9245.7877.67
(c)IFI with Single Reference Point49.7377.9747.4078.27
(d)IFI w/o Positional Encoding49.2478.2747.9778.38
(e)IFI48.8476.7948.7678.46
+ +Effectiveness of IFI. To accurately capture the correct features for proposals at arbitrary positions, we introduce IFI. Other feasible approaches include: (a) Nearest Neighbor without MLP, which directly utilizes the closest latent feature without any transformation; (b) Bilinear Interpolation without MLP, deriving features at each position through bilinear interpolation, implying no use of coordinate and continuous function transformation; (c) IFI solely employing a single reference point for continuous transformation (MLP with coordinate information); (d) IFI w/o Positional Encoding; and (e) IFI. + +The results, as displayed in Table 10, reveal several clear trends. First, the use of interpolation outperforms the nearest-neighbor approach by providing a richer feature context. Second, a comparison between (b) and (d) highlights the benefits of using distance information for continuous transformation. Third, incorporating Positional Encoding significantly aids the MLP in achieving better learning outcomes. By integrating all these methods, we can notably enhance the representation features obtained at any given position. + +# 7 Conclusion + +In this paper, we proposed Auxiliary Point Guidance and Implicit Feature Interpolation to address challenges in point-based crowd counting and localization. APGCC improved the stability of proposal-target matching and enabled accurate feature extraction at any position. Extensive experiments against state-of-the-art methods, our approach showed superior performance in various scenarios. + +# Acknowledgements + +We thank to National Center for High-performance Computing (NCHC) for providing computational and storage resources. This research was supported by the Research Center for Information Technology Innovation and Taiwan's National Science and Technology Council under Grant NSTC112-2634-F-001-001-MBK, NSTC 111-2221-E-002-136-MY3. + +# References + +1. Abousamra, S., Hoai, M., Samaras, D., Chen, C.: Localization in the crowd with topological constraints. In: AAAI (2021) 1, 2, 11, 12 +2. Bai, S., He, Z., Qiao, Y., Hu, H., Wu, W., Yan, J.: Adaptive dilated network with self-correction supervision for counting. In: CVPR (2020) 3 +3. Basri, R., Galun, M., Geifman, A., Jacobs, D., Kasten, Y., Kritchman, S.: Frequency bias in neural networks for input of non-uniform density. In: ICML (2020) 8 +4. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: CVPR (2021) 8 +5. Cheng, Z.Q., Dai, Q., Li, H., Song, J., Wu, X., Hauptmann, A.G.: Rethinking spatial invariance of convolutional networks for object counting. In: CVPR (2022) 11 +6. Du, Z., Shi, M., Deng, J., Zafeiriou, S.: Redesigning multi-scale neural network for crowd counting. TIP (2023) 11, 12 +7. Florian, L.C., Adam, S.H.: Rethinking atrous convolution for semantic image segmentation. In: CVPR (2017) 8, 9 +8. Gao, J., Han, T., Wang, Q., Yuan, Y.: Domain-adaptive crowd counting via inter-domain features segregation and gaussian-prior reconstruction. arXiv preprint arXiv:1912.03677 (2019) 1, 3, 4 +9. Gao, J., Han, T., Yuan, Y., Wang, Q.: Learning independent instance maps for crowd localization. arXiv preprint arXiv:2012.04164 (2020) 4 +10. Hu, P., Ramanan, D.: Finding tiny faces. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 951-959 (2017) 12 +11. Hu, Y., Jiang, X., Liu, X., Zhang, B., Han, J., Cao, X., Doermann, D.: Nas-count: Counting-by-density with neural architecture search. In: ECCV (2020) 2, 3, 11 +12. Idrees, H., Saleemi, I., Seibert, C., Shah, M.: Multi-source multi-scale counting in extremely dense crowd images. In: CVPR (2013) 9, 11 +13. Idrees, H., Tayyab, M., Athrey, K., Zhang, D., Al-Maadeed, S., Rajpoot, N., Shah, M.: Composition loss for counting, density map estimation and localization in dense crowds. In: ECCV (2018) 2, 3, 4, 9, 10, 11 +14. Jiang, X., Zhang, L., Xu, M., Zhang, T., Lv, P., Zhou, B., Yang, X., Pang, Y.: Attention scaling for crowd counting. In: CVPR (2020) 1, 2, 3 +15. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 10 +16. Kuhn, H.W.: The hungarian method for the assignment problem. NRL (1955) 2, 5 +17. Laradji, I.H., Rostamzadeh, N., Pinheiro, P.O., Vazquez, D., Schmidt, M.: Where are the blobs: Counting by localization with point supervision. In: ECCV (2018) 3, 12 + +18. Li, Y., Zhang, X., Chen, D.: Csrnet: Dilated convolutional neural networks for understanding the highly congested scenes. In: CVPR (2018) 1, 3 +19. Lian, D., Li, J., Zheng, J., Luo, W., Gao, S.: Density map regression guided detection network for rgb-d crowd counting and localization. In: CVPR (2019) 3 +20. Liang, D., Xu, W., Bai, X.: An end-to-end transformer model for crowd localization. In: ECCV (2022) 2, 4, 11, 12, 14 +21. Liang, D., Xu, W., Zhu, Y., Zhou, Y.: Focal inverse distance transform maps for crowd localization. TMM (2022) 1, 4 +22. Lin, H., Ma, Z., Ji, R., Wang, Y., Hong, X.: Boosting crowd counting via multifaceted attention. In: CVPR (2022) 1, 11 +23. Liu, C., Weng, X., Mu, Y.: Recurrent attentive zooming for joint crowd counting and precise localization. In: CVPR (2019) 3, 11, 12 +24. Liu, C., Lu, H., Cao, Z., Liu, T.: Point-query quadtree for crowd counting, localization, and more. In: ICCV. pp. 1676-1685 (2023) 2, 4, 11, 12, 14 +25. Liu, L., Lu, H., Xiong, H., Xian, K., Cao, Z., Shen, C.: Counting objects by blockwise classification. TCSVT (2019) 2, 3 +26. Liu, L., Lu, H., Zou, H., Xiong, H., Cao, Z., Shen, C.: Weighing counts: Sequential crowd counting by reinforcement learning. In: ECCV (2020) 2, 3 +27. Liu, W., Durasov, N., Fua, P.: Leveraging self-supervision for cross-domain crowd counting. In: CVPR (2022) 1 +28. Liu, X., Yang, J., Ding, W.: Adaptive mixture regression network with local counting map for crowd counting. In: ECCV (2020) 2, 3 +29. Liu, Y., Shi, M., Zhao, Q., Wang, X.: Point in, box out: Beyond counting persons in crowds. In: CVPR (2019) 2, 3, 4 +30. Ma, Z., Hong, X., Wei, X., Qiu, Y., Gong, Y.: Towards a universal model for cross-dataset crowd counting. In: ICCV (2021) 11 +31. Ma, Z., Wei, X., Hong, X., Gong, Y.: Bayesian loss for crowd count estimation with point supervision. In: ICCV (2019) 2, 3, 11 +32. Ma, Z., Wei, X., Hong, X., Lin, H., Qiu, Y., Gong, Y.: Learning to count via unbalanced optimal transport. In: AAAI (2021) 11 +33. Miao, Y., Lin, Z., Ding, G., Han, J.: Shallow feature based dense attention network for crowd counting. In: AAAI (2020) 3 +34. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. ACM (2021) 8 +35. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: CVPR (2019) 8, 12 +36. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: ICML. pp. 5301-5310. PMLR (2019) 8 +37. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. NeurIPS (2015) 4 +38. Ribera, J., Guera, D., Chen, Y., Delp, E.J.: Locating objects without bounding boxes. In: CVPR (2019) 12 +39. Sam, D.B., Peri, S.V., Sundararaman, M.N., Kamath, A., Babu, R.V.: Locate, size, and count: accurately resolving people in dense crowds via detection. TPAMI (2020) 2, 3, 4, 11, 12 +40. Shu, W., Wan, J., Tan, K.C., Kwong, S., Chan, A.B.: Crowd counting in the frequency domain. In: CVPR (2022) 11 + +41. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014) 8 +42. Sindagi, V.A., Yasarla, R., Patel, V.M.: Jhu-crowd++: Large-scale crowd counting dataset and a benchmark method. TPAMI (2020) 9, 11 +43. Song, Q., Wang, C., Jiang, Z., Wang, Y., Tai, Y., Wang, C., Li, J., Huang, F., Wu, Y.: Rethinking counting and localization in crowds: A purely point-based framework. In: ICCV (2021) 2, 4, 10, 11, 12, 13, 14 +44. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020) 8 +45. Wan, J., Chan, A.: Modeling noisy annotations for crowd counting. NeurIPS (2020) 11 +46. Wan, J., Liu, Z., Chan, A.B.: A generalized loss function for crowd counting and localization. In: CVPR (2021) 1, 2, 11, 12 +47. Wang, Q., Gao, J., Lin, W., Li, X.: Nwpu-crowd: A large-scale benchmark for crowd counting and localization. TPAMI (2020) 9, 10, 11, 12 +48. Wang, Y., Hou, J., Hou, X., Chau, L.P.: A self-training approach for point-supervised object detection and counting in crowds. TIP (2021) 1, 4 +49. Xiong, H., Lu, H., Liu, C., Liu, L., Cao, Z., Shen, C.: From open set to closed set: Counting objects by spatial divide-and-conquer. In: ICCV (2019) 3 +50. Xiong, H., Yao, A.: Discrete-constrained regression for local counting models. In: ECCV (2022) 11 +51. Xu, C., Liang, D., Xu, Y., Bai, S., Zhan, W., Bai, X., Tomizuka, M.: Autoscale: learning to scale for crowd counting. IJCV (2022) 4, 11, 12 +52. Xu, X., Wang, Z., Shi, H.: Ultrasr: Spatial encoding is a missing key for implicit image function-based arbitrary-scale super-resolution. arXiv preprint arXiv:2103.12716 (2021) 8 +53. Zhang, Y., Zhou, D., Chen, S., Gao, S., Ma, Y.: Single-image crowd counting via multi-column convolutional neural network. In: CVPR (2016) 2, 9, 11, 12, 13 \ No newline at end of file diff --git a/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/images.zip b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..f9e4f0d75c74f3d8d800eeaeade8204c6ede0e2f --- /dev/null +++ b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:35bed1df52c858a29156ebbee8a439e5864fa258f5402ef46b3130cca6f884f5 +size 443643 diff --git a/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/layout.json b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..97b68a05ea51abdf038cef7963f00f6de74f5668 --- /dev/null +++ b/2024/Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance/layout.json @@ -0,0 +1,10372 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 138, + 111, + 477, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 111, + 477, + 148 + ], + "spans": [ + { + "bbox": [ + 138, + 111, + 477, + 148 + ], + "type": "text", + "content": "Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "spans": [ + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "text", + "content": "I-Hsiang Chen" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "text", + "content": ", Wei-Ting Chen" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "text", + "content": ", Yu-Wei Liu" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "text", + "content": ", Ming-Hsuan Yang" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "inline_equation", + "content": "^{2,3}" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "text", + "content": ", and Sy-Yen Kuo" + }, + { + "bbox": [ + 140, + 167, + 474, + 194 + ], + "type": "inline_equation", + "content": "^{1,4}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 229, + 201, + 386, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 201, + 386, + 213 + ], + "spans": [ + { + "bbox": [ + 229, + 201, + 386, + 213 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 229, + 201, + 386, + 213 + ], + "type": "text", + "content": " National Taiwan University, Taiwan" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 220, + 213, + 393, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 213, + 393, + 224 + ], + "spans": [ + { + "bbox": [ + 220, + 213, + 393, + 224 + ], + "type": "text", + "content": "2 University of California at Merced, USA" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 252, + 224, + 361, + 235 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 224, + 361, + 235 + ], + "spans": [ + { + "bbox": [ + 252, + 224, + 361, + 235 + ], + "type": "text", + "content": "3 Google DeepMind, USA" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 237, + 235, + 376, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 237, + 235, + 376, + 246 + ], + "spans": [ + { + "bbox": [ + 237, + 235, + 376, + 246 + ], + "type": "text", + "content": "4 Chang Gung University, Taiwan" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 156, + 247, + 457, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 247, + 457, + 258 + ], + "spans": [ + { + "bbox": [ + 156, + 247, + 457, + 258 + ], + "type": "text", + "content": "{f09921058,f05943089,r12943109}@ntu.edu.tw, mhyang@ucmerced.edu," + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 268, + 258, + 346, + 267 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 268, + 258, + 346, + 267 + ], + "spans": [ + { + "bbox": [ + 268, + 258, + 346, + 267 + ], + "type": "text", + "content": "sykuo@ntu.edu.tw" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 159, + 300, + 455, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 300, + 455, + 475 + ], + "spans": [ + { + "bbox": [ + 159, + 300, + 455, + 475 + ], + "type": "text", + "content": "Abstract. Crowd counting and localization have become increasingly important in computer vision due to their wide-ranging applications. While point-based strategies have been widely used in crowd counting methods, they face a significant challenge, i.e., the lack of an effective learning strategy to guide the matching process. This deficiency leads to instability in matching point proposals to target points, adversely affecting overall performance. To address this issue, we introduce an effective approach to stabilize the proposal-target matching in point-based methods. We propose Auxiliary Point Guidance (APG) to provide clear and effective guidance for proposal selection and optimization, addressing the core issue of matching uncertainty. Additionally, we develop Implicit Feature Interpolation (IFI) to enable adaptive feature extraction in diverse crowd scenarios, further enhancing the model's robustness and accuracy. Extensive experiments demonstrate the effectiveness of our approach, showing significant improvements in crowd counting and localization performance, particularly under challenging conditions." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 159, + 486, + 453, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 486, + 453, + 509 + ], + "spans": [ + { + "bbox": [ + 159, + 486, + 453, + 509 + ], + "type": "text", + "content": "Keywords: Crowd Counting, Crowd Localization, Auxiliary Learning, Feature Interpolation" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 548, + 231, + 561 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 231, + 561 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 231, + 561 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 574, + 482, + 647 + ], + "type": "text", + "content": "Recent years have witnessed the advances and importance of crowd counting and localization in numerous tasks, including surveillance, event management, and urban planning [1,8,14,18,21,22,27,46,48]. The pursuit of accurately estimating crowd size and discerning individual locations is fraught with challenges, ranging from fluctuating crowd densities and occlusions to varying environmental settings." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 654, + 301, + 666 + ], + "type": "footer", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 654, + 301, + 666 + ], + "spans": [ + { + "bbox": [ + 141, + 654, + 301, + 666 + ], + "type": "text", + "content": "Project page: https://apgcc.github.io/" + } + ] + } + ], + "index": 12 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 159, + 117, + 304, + 248 + ], + "blocks": [ + { + "bbox": [ + 159, + 117, + 304, + 248 + ], + "lines": [ + { + "bbox": [ + 159, + 117, + 304, + 248 + ], + "spans": [ + { + "bbox": [ + 159, + 117, + 304, + 248 + ], + "type": "image", + "image_path": "0e3338a5cd9aaee42c69b2729dcce790390aa1a1a5ac90892ba31c619883740e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "lines": [ + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 260, + 482, + 360 + ], + "type": "text", + "content": "Fig. 1: (Left) Crowd Counting and Localization: Comparison with state-of-the-art methods (e.g., LSC-CNN [39], TopoCount [1], P2PNet [43] and CLTR [20]) demonstrating the proposed APGCC's effectiveness in accurately counting and localizing in crowded scenes. (Right) Matching Process Instability: Illustrates the instability in selecting point proposals during the matching process by existing point-based methods (e.g., Matcher [16]) across training epochs, indicated by the Instability Rate (IR), which measures the inconsistency rate of point proposal selection per epoch, leading to limited performance. Both evaluations are conducted on the ShanghaiTech A (SHHA) [53] dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 304, + 116, + 451, + 247 + ], + "blocks": [ + { + "bbox": [ + 304, + 116, + 451, + 247 + ], + "lines": [ + { + "bbox": [ + 304, + 116, + 451, + 247 + ], + "spans": [ + { + "bbox": [ + 304, + 116, + 451, + 247 + ], + "type": "image", + "image_path": "e9e399ff79d8c55d2f528361ef60b8d05ffa68e757d2fa8a6500396e48827228.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 387, + 482, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 387, + 482, + 506 + ], + "spans": [ + { + "bbox": [ + 130, + 387, + 482, + 506 + ], + "type": "text", + "content": "Within the domain of crowd analysis, two principal methodologies emerge: map-based and localization-based approaches. Map-based methods, employing Gaussian kernels to render density maps, effectively provide models with critical information for learning crowd densities. Renowned for their high accuracy in crowd counting, these methods have been validated across a series of studies, including [11,14,25,26,28,31]. Despite their capacity to achieve localization through additional designs [1,13,46], they still confront challenges such as the overlapping of maps in densely populated areas and the need for multi-scale representations. This leads to difficulties in precise localization with non-differentiable post-processing techniques like \"find-maxima\"." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 508, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 508, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 508, + 482, + 592 + ], + "type": "text", + "content": "Localization-based approaches encompass two divergent strategies: detection-based and point-based methods. Detection-based techniques [29, 39], characterized by the initiation of pseudo ground truth bounding boxes using nearest-neighbor distances, are tailored for specific scenarios but encounter accuracy limitations in highly congested and sparse areas. Despite their practicality, these methods often contend with the constraints of heuristic post-processing, such as non-maximum suppression, potentially leading to inaccuracies [20]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "In contrast, the elegance of point-based methods [20, 24, 43] lies in directly using point annotations as learning targets. These frameworks can direct the regression of individual coordinates, simplifying the localization process. These methods are celebrated for their simplicity, end-to-end trainability, and independence from complex pre-processing and multi-scale feature map fusion. However, a significant challenge in point-based methods for crowd analysis is the insta" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 224 + ], + "type": "text", + "content": "bility of proposal-target matching during training, as illustrated in Figure 1. In each epoch, a large proportion of target points are matched with different point proposals compared to the previous epoch. This issue arises due to the absence of an effective learning strategy to guide the network in consistently selecting the most appropriate proposals during optimization. Consequently, the constantly changing relationships between proposals and targets lead to vague and unclear learning objectives for each proposal. This uncertainty in the learning process often results in localized inaccuracies, manifesting as either underestimation or overestimation in specific areas of crowded scenes." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 224, + 482, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 224, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 482, + 307 + ], + "type": "text", + "content": "In this paper, we address the prevailing issue of uncertainty in proposal-target matching within point-based methods for crowd analysis. We introduce a novel learning paradigm, Auxiliary Point Guidance Crowd Counting (APGCC), designed to instruct the network on the precise selection and optimization of point proposals for matching with target points. APGCC provides a clear and effective directive, ensuring accurate and informed decisions in the proposal selection and optimization process." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 308, + 482, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 390 + ], + "type": "text", + "content": "To facilitate the application of APGCC, which necessitates feature extraction at arbitrary positions, we propose a method utilizing Implicit Feature Interpolation. This technique adeptly addresses the challenge of accessing features from diverse locations within the network, thereby ensuring the versatility and efficacy of our model in various crowd scenarios. By enhancing the robustness of the matching relationships between proposals and targets, our approach significantly improves the precision and reliability of crowd analysis models." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 391, + 482, + 462 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 391, + 482, + 462 + ], + "spans": [ + { + "bbox": [ + 130, + 391, + 482, + 462 + ], + "type": "text", + "content": "Extensive experimental results demonstrate that the proposed APG strategy effectively addresses the instability issues in proposal-target matching during the training process (orange curve in Figure 1). Moreover, it significantly enhances the performance of crowd counting. Our method performs robustly and favorably against state-of-the-art schemes in both crowd counting and localization tasks. We make the following contributions in this work:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 136, + 463, + 481, + 546 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 136, + 463, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 463, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 136, + 463, + 481, + 510 + ], + "type": "text", + "content": "- We introduce Auxiliary Point Guidance, a novel strategy to address the uncertainty in proposal-target matching within point-based crowd counting methods. APG guides the precise selection and optimization of proposals, enhancing model accuracy." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 510, + 481, + 546 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 481, + 546 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 481, + 546 + ], + "type": "text", + "content": "- We develop an Implicit Feature Interpolation method, enabling effective feature extraction at arbitrary positions. This technique improves the robustness and versatility of our model, particularly in various crowd scenarios." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 131, + 565, + 237, + 578 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 565, + 237, + 578 + ], + "spans": [ + { + "bbox": [ + 131, + 565, + 237, + 578 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 590, + 481, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 481, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 481, + 628 + ], + "type": "text", + "content": "In the realm of crowd counting, methodologies are broadly categorized into map-based [2, 2, 11, 14, 18, 25, 25, 26, 28, 31, 33, 49] and localization-based approaches [17, 19, 23, 29, 39], each with distinct strategies and challenges." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "Map-based Approaches use Gaussian kernel density maps to achieve localization and counting. Pioneered by researchers like Idrees et al. [13] and Gao et al. [8], these methods identify individual positions as peaks on density maps." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 247 + ], + "type": "text", + "content": "However, they encounter challenges with overlapping in dense crowds. Innovations such as the Distance Label Map [51], Focal Inverse Distance Transform Map (FIDTM) [21], and Independent Instance Map (IIM) [9] have been introduced to mitigate these issues, though they still require complex post-processing steps. Concurrently, these approaches also advance crowd counting accuracy by integrating density map values, with enhancements like composition loss [13] and inter-domain feature segregation [8]. These approaches successfully reduce overlaps in crowded areas, yet they require a post-processing step, such as \"find-maxima\", to pinpoint individual locations. Additionally, their reliance on multiscale feature maps adds to their complexity, detracting from their simplicity and elegance." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 250, + 482, + 393 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 250, + 482, + 393 + ], + "spans": [ + { + "bbox": [ + 130, + 250, + 482, + 393 + ], + "type": "text", + "content": "Localization-based Approaches: In crowd analysis, localization-based methods integrate both detection-based and point-based strategies. Detection-based approaches, utilizing frameworks like Faster RCNN [37], focus on generating pseudo bounding boxes using techniques such as nearest neighbor distance, as seen in [39], and a winner-take-all loss for refining box selection, especially beneficial for high-resolution images. Liu et al. [29] employs curriculum learning to enhance detection and bounding box prediction accuracy. However, these methods often contend with the challenge of pseudo-ground-truth boxes derived from weak point supervision, which can be particularly unreliable in densely populated areas, thus impeding model training and leading to imprecise box predictions. Additionally, they typically involve Non-Maximum Suppression (NMS) in their box filtering process, which is not designed for end-to-end training [48]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 394, + 482, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 394, + 482, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 394, + 482, + 489 + ], + "type": "text", + "content": "In contrast, point-based approaches like those proposed by Song et al. [43] (P2PNet), Liang et al. [20] (CLTR), and Liu et al. [24] (PET) emphasize directly estimating individual head positions, dynamically adjusting to various crowd densities. These methods significantly enhance the accuracy and process efficiency of localization tasks. Nevertheless, their performance can be limited by the instability of proposal-target matching during training, often leading to regional underestimation or overestimation due to unclear learning objectives for proposals." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 506, + 474, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 506, + 474, + 521 + ], + "spans": [ + { + "bbox": [ + 131, + 506, + 474, + 521 + ], + "type": "text", + "content": "3 Preliminary: Point-based Crowd Counting Framework" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 531, + 481, + 567 + ], + "type": "text", + "content": "This framework [43] comprises three main components essential for point-based crowd counting: Point Proposal Prediction, Proposal-Target Matching, and Loss Calculation." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": "Point Proposal Prediction involves generating point proposals from the deep feature map " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_s" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " outputted by the backbone network, where " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " is the downsampling stride, and " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_s" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " has a size of " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "H\\times W" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": ". The process includes two parallel branches: regression for predicting point coordinate offsets and classification for determining confidence scores. Each pixel on " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{F}_s" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " corresponds to a patch in the input image, with a predefined set of reference points " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{R} = R_k|k\\in \\{1,\\dots,K\\}" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " is the total number of reference points. The regression branch outputs " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "H\\times W\\times K" + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "text", + "content": " point proposals, with the coordinates of a proposal " + }, + { + "bbox": [ + 130, + 570, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{p}_j = (\\hat{x}_j,\\hat{y}_j)" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "content": "calculated as: " + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "inline_equation", + "content": "\\hat{x}_j = x_k + \\gamma \\Delta_{jx}^k" + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "inline_equation", + "content": "\\hat{y}_j = y_k + \\gamma \\Delta_{jy}^k" + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "content": " scales the predicted offsets, " + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "inline_equation", + "content": "\\Delta_{jx}^k" + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "inline_equation", + "content": "\\Delta_{jy}^k" + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "content": " present predicted offsets for its coordinates of a proposal " + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "inline_equation", + "content": "\\hat{p}_j = (\\hat{x}_j, \\hat{y}_j)" + }, + { + "bbox": [ + 130, + 115, + 479, + 154 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "spans": [ + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": "Proposal-Target Matching follows the Point Proposal Prediction, utilizing the Hungarian algorithm [16] as proposal-target matching " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\mathcal{O}(\\mathcal{P},\\hat{\\mathcal{P}},\\mathcal{D})" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": ". This strategy ensures a one-to-one correspondence where each ground truth target from " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " is matched with a point proposal in " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{P}}" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": ". The matching is based on the pair-wise cost matrix " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " of size " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "N\\times M" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " denote the number of ground truth points and point proposals. The matrix " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " combines the Euclidean distance between point pairs and the confidence score " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\hat{c}_j" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " of each proposal, defined as " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "D(P,\\hat{P}) = \\left(\\tau ||p_i - \\hat{p}_j||_2 - \\hat{c}_j\\right)_{i\\in N,j\\in M}" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " balances the pixel distance and " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\hat{c}_j" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": " is the confidence score of proposal " + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "inline_equation", + "content": "\\hat{p}_j" + }, + { + "bbox": [ + 130, + 156, + 480, + 266 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": "After the matching process, in the optimal matching results denoted as " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "\\Theta" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": ", each ground truth point " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "p_i" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": " is optimally matched to a point proposal " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "\\hat{p}_j" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": ", with the matching result represented by the permutation " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "\\psi = \\Theta(\\mathcal{P}, \\hat{\\mathcal{P}}, \\mathcal{D})" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": ". Thus, " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "\\hat{p}_{\\psi(i)}" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": " is the proposal matched to ground truth point " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "p_i" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": ". The set of matched proposals, " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{P}}\\mathrm{pos} = \\hat{p}_{\\psi(i)}|i \\in \\{1, \\dots, N\\}" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": ", are considered positives, while the unmatched ones, " + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "inline_equation", + "content": "\\hat{\\mathcal{P}}\\mathrm{neg} = \\hat{p}_{\\psi(i)}|i \\in \\{N + 1, \\dots, M\\}" + }, + { + "bbox": [ + 130, + 266, + 479, + 342 + ], + "type": "text", + "content": ", are negatives." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "text", + "content": "Loss Calculation integrates Euclidean loss " + }, + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{loc}" + }, + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "text", + "content": " for point regression and Cross Entropy loss " + }, + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}" + }, + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "text", + "content": " for proposal classification. The combined loss function " + }, + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{point}" + }, + { + "bbox": [ + 130, + 344, + 479, + 378 + ], + "type": "text", + "content": " is:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 192, + 379, + 479, + 410 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 192, + 379, + 479, + 410 + ], + "spans": [ + { + "bbox": [ + 192, + 379, + 479, + 410 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {c l s} = - \\frac {1}{M} \\left(\\sum_ {i = 1} ^ {N} \\log \\hat {c} _ {\\psi (i)} + \\lambda_ {1} \\sum_ {i = N + 1} ^ {M} \\log \\left(1 - \\hat {c} _ {\\psi (i)}\\right)\\right), \\tag {1}", + "image_path": "1307526101f0844be461901357025c8971dadd8f92023feeae1baa98203013ed.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 246, + 418, + 479, + 449 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 246, + 418, + 479, + 449 + ], + "spans": [ + { + "bbox": [ + 246, + 418, + 479, + 449 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {l o c} = \\frac {1}{N} \\sum_ {i = 1} ^ {N} \\left| \\left| p _ {i} - \\hat {p} _ {\\psi (i)} \\right| \\right| _ {2} ^ {2}, \\tag {2}", + "image_path": "87c76ea57dd3f5c2feae99b9214e4bb4925f5959a7a219278683a0758aca6a30.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 257, + 460, + 479, + 472 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 460, + 479, + 472 + ], + "spans": [ + { + "bbox": [ + 257, + 460, + 479, + 472 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {p o i n t}} = \\mathcal {L} _ {\\text {c l s}} + \\lambda_ {2} \\mathcal {L} _ {\\text {l o c}}, \\tag {3}", + "image_path": "0b998ec962bf4a1bbe7eae52af72ad901007955a1aa417b9fc8929ef1f2a921c.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "inline_equation", + "content": "\\hat{c}_{\\psi(i)}" + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "text", + "content": " is the confidence score of the matched proposal " + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "inline_equation", + "content": "\\hat{p}_{\\psi(i)}" + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "inline_equation", + "content": "\\lambda_1" + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "text", + "content": " adjusts the impact of negative proposals, and " + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "inline_equation", + "content": "\\lambda_2" + }, + { + "bbox": [ + 130, + 476, + 479, + 501 + ], + "type": "text", + "content": " balances the regression loss." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 518, + 261, + 533 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 518, + 261, + 533 + ], + "spans": [ + { + "bbox": [ + 131, + 518, + 261, + 533 + ], + "type": "text", + "content": "4 Proposed Method" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 544, + 479, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 479, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 479, + 604 + ], + "type": "text", + "content": "While current Point-based Approaches demonstrate promising results in crowd counting and localization, we identified instability in the optimization of the matching process, potentially limiting overall performance. We introduce several components designed to stabilize and enhance the matching mechanism to address this challenge." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 621, + 289, + 633 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 621, + 289, + 633 + ], + "spans": [ + { + "bbox": [ + 131, + 621, + 289, + 633 + ], + "type": "text", + "content": "4.1 Auxiliary Point Guidance" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": "We introduce an explicit guidance mechanism to enhance the optimization process's stability during the network's matching phase. As shown in Figure 2," + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 159, + 118, + 451, + 244 + ], + "blocks": [ + { + "bbox": [ + 159, + 118, + 451, + 244 + ], + "lines": [ + { + "bbox": [ + 159, + 118, + 451, + 244 + ], + "spans": [ + { + "bbox": [ + 159, + 118, + 451, + 244 + ], + "type": "image", + "image_path": "a61dec336c408d749859d71e5d1418ba2a0742f9047dec1bd8386ad14527c61c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 251, + 482, + 308 + ], + "lines": [ + { + "bbox": [ + 130, + 251, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 482, + 308 + ], + "type": "text", + "content": "Fig.2: Illustration of the Auxiliary Point Guidance framework. During the model's training, we additionally introduce auxiliary positive " + }, + { + "bbox": [ + 130, + 251, + 482, + 308 + ], + "type": "inline_equation", + "content": "(A_{\\mathrm{pos}})" + }, + { + "bbox": [ + 130, + 251, + 482, + 308 + ], + "type": "text", + "content": " and negative " + }, + { + "bbox": [ + 130, + 251, + 482, + 308 + ], + "type": "inline_equation", + "content": "(A_{\\mathrm{pos}})" + }, + { + "bbox": [ + 130, + 251, + 482, + 308 + ], + "type": "text", + "content": " points based on each ground truth position to guide the network's learning. This approach helps in directing the optimization process more effectively by distinguishing between potential positive and negative matches." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": "this involves the strategic designation of auxiliary positive " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "(A_{\\mathrm{pos}})" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and negative " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "(A_{\\mathrm{neg}})" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " points within the optimization framework, determined based on ground truth coordinates " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": ". The sets of positive and negative points are defined as " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "A_{\\mathrm{pos}}^i = \\{(x + R_{\\mathrm{pos}}^{i,x},y + R_{\\mathrm{pos}}^{i,y}) \\mid i = 1,2,\\ldots,k_{\\mathrm{pos}}\\}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "A_{\\mathrm{neg}}^j = \\{(x + R_{\\mathrm{neg}}^{j,x},y + R_{\\mathrm{neg}}^{j,y}) \\mid j = 1,2,\\ldots,k_{\\mathrm{neg}}\\}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "R_{\\mathrm{pos}}^{i,x}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "R_{\\mathrm{pos}}^{i,y}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " represent a series of randomness numbers used to generate the " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " coordinates of positive points, respectively, with each number uniformly distributed between " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "-n_{\\mathrm{pos}}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "n_{\\mathrm{pos}}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": ". Similarly, " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "R_{\\mathrm{neg}}^{j,x}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "R_{\\mathrm{neg}}^{j,y}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " denote series of randomness numbers for generating the " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " coordinates of negative points, each uniformly distributed between " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "[-n_{\\mathrm{neg}}, - n_{\\mathrm{pos}}]" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " or " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "[n_{\\mathrm{pos}},n_{\\mathrm{neg}}]" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": ". The variables " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "k_{\\mathrm{pos}}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "k_{\\mathrm{neg}}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " denote the total number of positive and negative points generated, respectively. Each set " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "R_{\\mathrm{pos}}^i" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "R_{\\mathrm{neg}}^j" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " is used to create a unique set of coordinates for " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "A_{\\mathrm{pos}}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "A_{\\mathrm{neg}}" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": ", thereby offsetting the ground truth position " + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 329, + 482, + 486 + ], + "type": "text", + "content": " by these randomness numbers." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "text", + "content": "Based on the auxiliary positive points " + }, + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "inline_equation", + "content": "A_{\\mathrm{pos}}" + }, + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "text", + "content": ", we extract their corresponding features. From these features, we then predict the confidence " + }, + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "inline_equation", + "content": "\\hat{c}_{\\mathrm{pos}}^{\\star}" + }, + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "text", + "content": " and offset and then calculate the position of the proposal " + }, + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "inline_equation", + "content": "\\hat{p}_{\\mathrm{pos}}^{\\star}" + }, + { + "bbox": [ + 130, + 487, + 482, + 571 + ], + "type": "text", + "content": " for each point. Our objective is to ensure that the confidence of auxiliary positive points is as close to one as possible and that their predicted offsets closely match the added randomness number. To achieve this, we formulate the loss function for the auxiliary positive point as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 174, + 578, + 481, + 612 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 174, + 578, + 481, + 612 + ], + "spans": [ + { + "bbox": [ + 174, + 578, + 481, + 612 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {A P G} ^ {p o s} = \\frac {1}{N} \\frac {1}{k _ {\\mathrm {p o s}}} \\sum_ {l = 1} ^ {N} \\sum_ {i = 1} ^ {k _ {\\mathrm {p o s}}} (\\log \\hat {c} _ {\\mathrm {p o s}} ^ {\\star} (l, i) + \\lambda_ {3} \\left| | p _ {l} - \\hat {p} _ {\\mathrm {p o s}} ^ {\\star} (l, i) | | _ {2} ^ {2}\\right), \\tag {4}", + "image_path": "4f53e1dbed1eb39244e15351b042b50e9cdd52c92f6a4ef375a603ccffe705c1.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 617, + 293, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 617, + 293, + 629 + ], + "spans": [ + { + "bbox": [ + 132, + 617, + 293, + 629 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 617, + 293, + 629 + ], + "type": "inline_equation", + "content": "\\lambda_3" + }, + { + "bbox": [ + 132, + 617, + 293, + 629 + ], + "type": "text", + "content": " represents a scaling factor." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "content": "For the auxiliary negative points " + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "inline_equation", + "content": "(A_{\\mathrm{neg}})" + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "content": ", our aim is for their confidence " + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\hat{c}_{\\mathrm{neg}}^{\\star}" + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "content": " to be as close to zero as possible. Similarly, we desire their offsets " + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\varDelta_{\\mathrm{neg}}^{\\star}" + }, + { + "bbox": [ + 130, + 630, + 482, + 667 + ], + "type": "text", + "content": " to approach zero, preventing negative points from using offsets to bring their proposal" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 164, + 116, + 449, + 244 + ], + "blocks": [ + { + "bbox": [ + 164, + 116, + 449, + 244 + ], + "lines": [ + { + "bbox": [ + 164, + 116, + 449, + 244 + ], + "spans": [ + { + "bbox": [ + 164, + 116, + 449, + 244 + ], + "type": "image", + "image_path": "e948333983eee293c817c614e2b90d44b809c44f4beb332bdf179cc9ae370f01.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "lines": [ + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "spans": [ + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "text", + "content": "Fig. 3: Illustration of Implicit Feature Interpolation. Given an arbitrary desired point position " + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "inline_equation", + "content": "(x, y)" + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "text", + "content": ", we concatenate the nearest four feature maps " + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "inline_equation", + "content": "(Z_1^{\\star} - Z_4^{\\star})" + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "text", + "content": " along with their distances " + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "inline_equation", + "content": "(\\delta_1^{\\star} - \\delta_4^{\\star})" + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "text", + "content": " to the " + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "inline_equation", + "content": "(x, y)" + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "text", + "content": " with positional encoding " + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "text", + "content": " and utilize a Multi-Layer Perceptron (MLP) " + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "inline_equation", + "content": "f_{\\theta}" + }, + { + "bbox": [ + 131, + 254, + 482, + 320 + ], + "type": "text", + "content": " to interpolate the latent feature for that specific location. This approach enables precise feature extraction at non-grid locations, facilitating more flexible and accurate feature representation." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 346, + 479, + 394 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 346, + 479, + 394 + ], + "spans": [ + { + "bbox": [ + 131, + 346, + 479, + 394 + ], + "type": "text", + "content": "coordinates close to the ground truth. This is crucial to mitigate the potential of these negative points being erroneously considered as matched proposals during the matching process. The loss function specifically formulated for auxiliary negative points is as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 168, + 404, + 480, + 439 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 168, + 404, + 480, + 439 + ], + "spans": [ + { + "bbox": [ + 168, + 404, + 480, + 439 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {A P G} ^ {n e g} = \\frac {1}{N} \\frac {1}{k _ {\\text {n e g}}} \\sum_ {l = 1} ^ {N} \\sum_ {j = 1} ^ {k _ {\\text {n e g}}} \\left(\\log \\left(1 - \\hat {c} _ {\\text {n e g}} ^ {\\star} (l, j)\\right) + \\lambda_ {4} \\left| | \\Delta_ {\\text {n e g}} ^ {\\star} (l, j) | | _ {2} ^ {2}\\right), \\right. \\tag {5}", + "image_path": "30139978cd6b06af5e6df6717396c896a922aed0928b62b3d7f6dd8d6da851c8.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 449, + 293, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 449, + 293, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 449, + 293, + 460 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 449, + 293, + 460 + ], + "type": "inline_equation", + "content": "\\lambda_4" + }, + { + "bbox": [ + 132, + 449, + 293, + 460 + ], + "type": "text", + "content": " represents a scaling factor." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 146, + 462, + 451, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 462, + 451, + 474 + ], + "spans": [ + { + "bbox": [ + 146, + 462, + 451, + 474 + ], + "type": "text", + "content": "The total loss of the Auxiliary Point Guidance can be formulated as:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 252, + 484, + 480, + 499 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 484, + 480, + 499 + ], + "spans": [ + { + "bbox": [ + 252, + 484, + 480, + 499 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {A P G} = \\mathcal {L} _ {A P G} ^ {\\text {p o s}} + \\mathcal {L} _ {A P G} ^ {\\text {n e g}}. \\tag {6}", + "image_path": "fdae095cbe727eb90c5b0e9a1c6d5e8fc7c0325ced8d84579462ea1ea3fea9b0.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 509, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 509, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 131, + 509, + 482, + 605 + ], + "type": "text", + "content": "Through this additional guidance, we can direct the network to train point proposals closest to the ground truth points as positive points, while treating those farther away as negative points. This guidance assists the network in consistently selecting the same positive point for each ground truth point during the matching process. Importantly, the chosen positive point is likely to be the correct match, being in close proximity to the ground truth point. By employing this guidance, we address the instability issue inherent in the matching process, thereby enhancing the network's performance." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 605, + 482, + 666 + ], + "type": "text", + "content": "However, since auxiliary points are randomly assigned based on ground truth coordinates, traditional bilinear interpolation is not suitable for extracting features at these arbitrary positions. Therefore, we propose the use of implicit feature interpolation to obtain these features. The details of this approach will be described in the following section." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 312, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 312, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 312, + 129 + ], + "type": "text", + "content": "4.2 Implicit Feature Interpolation" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "spans": [ + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "text", + "content": "Implicit functions have demonstrated their efficacy in providing robust and continuous feature representations, significantly benefiting various computer vision tasks as evidenced in previous studies [4, 34, 35]. In Auxiliary Point Guidance, we leverage implicit function-based interpolation to extract latent features that are both arbitrary and robust. As depicted in Figure 3, for a given point location " + }, + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "text", + "content": ", we first determine the four nearest latent features, denoted as " + }, + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "inline_equation", + "content": "Z_{i}^{*}|i\\in \\{1,\\dots,4\\}" + }, + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "text", + "content": ". We then calculate their respective spatial distances from the target latent feature, represented as " + }, + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "inline_equation", + "content": "\\delta_i^* |i\\in \\{1,\\dots,4\\}" + }, + { + "bbox": [ + 130, + 135, + 482, + 339 + ], + "type": "text", + "content": ". These four latent features, along with their calculated distances, are concatenated channel-wise. This concatenated information is then fed into a MLP to yield the target latent feature. However, it is known that MLPs tend to prioritize low-frequency information, often overlooking crucial high-frequency details, which can impact the performance of the MLP [3, 36, 44]. To counter this limitation, we employ positional encoding as suggested in [52], enhancing the dimensionality of the distance information. By integrating positional encoding with the distance data, we address this high-frequency detail loss. The entire implicit feature interpolation process is encapsulated in the following formulation:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 217, + 346, + 481, + 378 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 346, + 481, + 378 + ], + "spans": [ + { + "bbox": [ + 217, + 346, + 481, + 378 + ], + "type": "interline_equation", + "content": "F _ {\\text {p r o p o s a l}} (x, y) = \\sum_ {i = 1} ^ {4} \\frac {S _ {i}}{S} f _ {\\theta} \\left(Z _ {i} ^ {*}, \\delta_ {i} ^ {*}, \\phi \\left(\\delta_ {i} ^ {*}\\right)\\right), \\tag {7}", + "image_path": "67095c48c73b51c01015813f8f4ea09c442b7e80137e48e7b06804a87567ba35.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "inline_equation", + "content": "S_{i}" + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": " represents the area surrounding the diagonal point with the target point, and " + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": " is the sum of these areas, calculated as " + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "inline_equation", + "content": "S = \\sum_{i=1}^{4} S_{i}" + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "inline_equation", + "content": "f_{\\theta}(\\cdot)" + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": " symbolizes the MLP, " + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "inline_equation", + "content": "\\phi(\\cdot)" + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": " denotes positional encoding, and " + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "inline_equation", + "content": "F_{proposal}(x,y)" + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": " is the resultant interpolated feature for the point " + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 384, + 482, + 434 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 449, + 276, + 460 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 449, + 276, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 449, + 276, + 460 + ], + "type": "text", + "content": "4.3 Architecture Overview" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 468, + 482, + 624 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 624 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 624 + ], + "type": "text", + "content": "Our architecture, as illustrated in Figure 4, begins with the extraction of image features using a pre-trained backbone, specifically VGG-16 [41]. We focus on the feature maps from the final two layers (i.e., conv 3 and conv 4). These features are then enhanced for scale diversity through the application of Atrous Spatial Pyramid Pooling (ASPP) [7]. Following this, each set of features undergoes an implicit feature interpolation process, which results in the computation of the corresponding features " + }, + { + "bbox": [ + 130, + 468, + 482, + 624 + ], + "type": "inline_equation", + "content": "F_{proposal}(x,y)" + }, + { + "bbox": [ + 130, + 468, + 482, + 624 + ], + "type": "text", + "content": ". The interpolated features are subsequently concatenated and input into both the confidence and regression modules. These modules are responsible for predicting the confidence level and offset for each point in the image. The training of the network is accomplished using a combination of the original point-based constraint, as defined in (3), and the proposed Auxiliary Point Guidance, as stated in (6). The total loss function, denoted as " + }, + { + "bbox": [ + 130, + 468, + 482, + 624 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{overall}" + }, + { + "bbox": [ + 130, + 468, + 482, + 624 + ], + "type": "text", + "content": ", is formulated as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 243, + 632, + 481, + 647 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 243, + 632, + 481, + 647 + ], + "spans": [ + { + "bbox": [ + 243, + 632, + 481, + 647 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {o v e r a l l}} = \\mathcal {L} _ {\\text {p o i n t}} + \\lambda_ {5} \\mathcal {L} _ {\\text {A P G}}, \\tag {8}", + "image_path": "79d4759bc88f67dd434206daeaf00d2ac7708e18e6c7aea9e68ab8cae614abc0.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 653, + 294, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 653, + 294, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 653, + 294, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 653, + 294, + 666 + ], + "type": "inline_equation", + "content": "\\lambda_5" + }, + { + "bbox": [ + 132, + 653, + 294, + 666 + ], + "type": "text", + "content": " represents a scaling factor." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 118, + 465, + 293 + ], + "blocks": [ + { + "bbox": [ + 151, + 118, + 465, + 293 + ], + "lines": [ + { + "bbox": [ + 151, + 118, + 465, + 293 + ], + "spans": [ + { + "bbox": [ + 151, + 118, + 465, + 293 + ], + "type": "image", + "image_path": "44a15ff6054023f8f1a19230e91e492b8c92f5f207e6d5244efe2d153e726740.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 303, + 482, + 370 + ], + "lines": [ + { + "bbox": [ + 131, + 303, + 482, + 370 + ], + "spans": [ + { + "bbox": [ + 131, + 303, + 482, + 370 + ], + "type": "text", + "content": "Fig. 4: Illustration of the proposed APGCC for crowd counting and localization. A VGG encoder extracts image features, where features from conv3 and conv4 layers undergo refinement via Atrous Spatial Pyramid Pooling [7]. Subsequently, target latent features are interpolated using implicit feature interpolation. These latent features are then processed through a prediction head to obtain confidence score " + }, + { + "bbox": [ + 131, + 303, + 482, + 370 + ], + "type": "inline_equation", + "content": "\\hat{c}" + }, + { + "bbox": [ + 131, + 303, + 482, + 370 + ], + "type": "text", + "content": " and offsets " + }, + { + "bbox": [ + 131, + 303, + 482, + 370 + ], + "type": "inline_equation", + "content": "(\\Delta_x, \\Delta_y)" + }, + { + "bbox": [ + 131, + 303, + 482, + 370 + ], + "type": "text", + "content": ", facilitating precise crowd counting and localization." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 391, + 293, + 404 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 391, + 293, + 404 + ], + "spans": [ + { + "bbox": [ + 132, + 391, + 293, + 404 + ], + "type": "text", + "content": "5 Implementation Details" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 415, + 204, + 426 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 415, + 204, + 426 + ], + "spans": [ + { + "bbox": [ + 132, + 415, + 204, + 426 + ], + "type": "text", + "content": "5.1 Datasets" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 434, + 482, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 434, + 482, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 434, + 482, + 496 + ], + "type": "text", + "content": "We use the ShanghaiTechA [53], ShanghaiTechB [53], UCF_CC_50 [12], UCF-QNRF [13], JHU-Crowd++ [42], and NWPU-Crowd [47] datasets to evaluate the performance of the proposed method against the state-of-the-art approaches. ShanghaiTech A dataset [53] includes 482 images with 244,167 annotated points. The dataset is divided into 300 training images and 182 testing images." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 498, + 481, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 481, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 481, + 523 + ], + "type": "text", + "content": "ShanghaiTech B (SHHB) dataset [53] features 716 images and 88,488 annotated points, with a split of 400 training images and 316 testing images." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 525, + 481, + 550 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 525, + 481, + 550 + ], + "spans": [ + { + "bbox": [ + 131, + 525, + 481, + 550 + ], + "type": "text", + "content": "UCF_CC_50 dataset [12] encompasses 50 images, totaling 63,974 annotated points. We adhere to a five-fold cross-validation as outlined in [12]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 552, + 481, + 589 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 552, + 481, + 589 + ], + "spans": [ + { + "bbox": [ + 131, + 552, + 481, + 589 + ], + "type": "text", + "content": "UCF-QNRF dataset [13] contains 1,535 high-resolution web-collected images, with over 1.25 million annotated points. It splits into 1,201 training images and 334 testing images, featuring a broad people count range from 49 to 12,865." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 590, + 481, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 590, + 481, + 628 + ], + "spans": [ + { + "bbox": [ + 131, + 590, + 481, + 628 + ], + "type": "text", + "content": "JHU-Crowd++ dataset [42] comprises 4,372 images, totaling 1.51 million annotated points. It allocates 2,272 images for training, 500 for validation, and reserves 1,600 images for testing." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 629, + 481, + 666 + ], + "type": "text", + "content": "NWPU-Crowd dataset [47] includes 5,109 images with more than 2.13 million annotated points, distributed across 3,109 training images, 500 validation images, and 1,500 testing images." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 261, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 261, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 261, + 127 + ], + "type": "text", + "content": "5.2 Evaluation Protocol" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": "Counting Metrics. We employ Mean Absolute Error (MAE) and Mean Squared Error (MSE) as our primary performance metrics, in line with standard practices in the field, defined as " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "MAE = \\frac{1}{Q}\\sum_{i=1}^{Q}|GT_i - N_i|" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "MSE = \\sqrt{\\frac{1}{Q}\\sum_{i=1}^{Q}(GT_i - N_i)^2}" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "Q" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": " represents the total number of images in the dataset, with " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "GT_i" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "N_i" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": " indicating the actual and predicted crowd counts for the " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": "-th image, respectively. Localization Metrics. To assess localization accuracy, we utilize Precision (P), Recall (R), and F1-measure (F), following the methodologies in [13, 47]. A predicted point is considered a True Positive (TP) if its distance from the corresponding ground truth (GT) point is within a specified threshold " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": ". For the NWPU-Crowd dataset [47], which includes box-level annotations, " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": " is defined as " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "\\sqrt{(w^2 + h^2)/2}" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": " are the width and height of each head. In contrast, for the ShanghaiTech dataset, we apply fixed thresholds of " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "\\sigma = 4" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "inline_equation", + "content": "\\sigma = 8" + }, + { + "bbox": [ + 130, + 137, + 488, + 304 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 323, + 242, + 335 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 323, + 242, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 323, + 242, + 335 + ], + "type": "text", + "content": "5.3 Training Details" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "spans": [ + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": "We utilize Adam optimization [15] with a learning rate of " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "10^{-4}" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " for general model optimization. Given that the VGG-16 backbone network weights are pre-trained on ImageNet, a reduced learning rate of " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "10^{-5}" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " is applied for these components. We adopted a grid layout strategy [43] for mapping proposals. The initial point proposal stride is set at " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "s = 8" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": ". The number of reference points " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " varies depending on the dataset: 4 for most and 8 for the QNRF dataset, aligned with dataset statistics to ensure " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "M > N" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": ". The prediction head comprises four layers with hidden feature dimensions of [1024, 512, 256, 256], and a shared prediction head is used for our point proposals. For point regression, we set " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " at 100, and the matching weight term " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " at " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "5 \\times 10^{-2}" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": ". In auxiliary points learning, the number of positive and negative points " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "(k_{\\mathrm{pos}}, k_{\\mathrm{neg}})" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " are set to (2, 2). Randomness ranges " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "(n_{\\mathrm{pos}}, n_{\\mathrm{neg}})" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " are set to (2, 8). The loss coefficients are adjusted as " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "\\lambda_1 = 0.5" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "\\lambda_2 = 2 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "\\lambda_3 = 2 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "\\lambda_4 = 2 \\times 10^{-4}" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "inline_equation", + "content": "\\lambda_5 = 0.2" + }, + { + "bbox": [ + 130, + 343, + 482, + 511 + ], + "type": "text", + "content": " to balance different term contributions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 512, + 482, + 584 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 512, + 482, + 584 + ], + "spans": [ + { + "bbox": [ + 130, + 512, + 482, + 584 + ], + "type": "text", + "content": "Data augmentation involves initial random scaling (factor range: [0.7, 1.3]), ensuring the shorter side is at least 128 pixels. Images are then randomly cropped to " + }, + { + "bbox": [ + 130, + 512, + 482, + 584 + ], + "type": "inline_equation", + "content": "128 \\times 128" + }, + { + "bbox": [ + 130, + 512, + 482, + 584 + ], + "type": "text", + "content": " patches and subjected to random flipping with a 0.5 probability. The training batch size is 8. The longer side of each image is restricted to 1920 pixels for UCF-QNRF, JHU-Crowd++, and NWPU-Crowd, while maintaining the original aspect ratio." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 603, + 282, + 616 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 603, + 282, + 616 + ], + "spans": [ + { + "bbox": [ + 132, + 603, + 282, + 616 + ], + "type": "text", + "content": "6 Experimental Results" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 665 + ], + "type": "text", + "content": "In this section, we present the evaluation results of the proposed method for crowd counting and localization. More results are available in the supplementary material." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 169, + 146, + 447, + 254 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 479, + 137 + ], + "type": "text", + "content": "Table 1: Evaluation of crowd counting on SHHA [53], SHHB [53], UCF-QNRF [13], JHU-Crowd [42] datasets." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 169, + 146, + 447, + 254 + ], + "lines": [ + { + "bbox": [ + 169, + 146, + 447, + 254 + ], + "spans": [ + { + "bbox": [ + 169, + 146, + 447, + 254 + ], + "type": "table", + "html": "
MethodLocalizationMannerSHHASHHBUCF-QNRFJHU-Crowd+
MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓MAE ↓MSE ↓
AMSNet [11]XMap-based56.793.46.710.2101.8163.2--
SDA+DM [30]XMap-based55.092.7--80.7146.359.3248.9
GauNet+CSRNet [5]XMap-based61.297.87.612.784.2152.469.4262.4
DC [50]XMap-based61.696.77.111.191.4157.567.2288.2
ChfL [40]XMap-based57.594.36.911.080.3137.657.0235.7
HMoDE [6]XMap-based54.487.46.29.8--55.7214.6
LSC-CNN [39]✓Detection-based66.4117.08.112.7120.5218.2112.7454.4
TopoCount [1]✓Detection-based61.2104.67.813.789.0159.060.9267.4
GL [46]✓Map-based61.395.47.311.784.3147.559.9259.5
P2PNet [43]✓Point-based52.785.16.29.985.3154.5--
CLTR [20]✓Point-based56.995.26.510.685.8141.359.5240.6
PET [24]✓Point-based49.378.76.19.679.5144.358.5238.0
APGCC✓Point-based48.876.75.68.780.1136.654.3225.9
", + "image_path": "93c580fa23a32b42a35199c630b6e101b0d789b779d44496b591e5130c8a9bbe.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 140, + 296, + 293, + 357 + ], + "blocks": [ + { + "bbox": [ + 132, + 274, + 459, + 296 + ], + "lines": [ + { + "bbox": [ + 132, + 274, + 459, + 296 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 459, + 296 + ], + "type": "text", + "content": "Table 2: Evaluation of crowd count- Table 3: Evaluation of crowding on UCF CC 50 [12] dataset. counting on NWPU [47] dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 140, + 296, + 293, + 357 + ], + "lines": [ + { + "bbox": [ + 140, + 296, + 293, + 357 + ], + "spans": [ + { + "bbox": [ + 140, + 296, + 293, + 357 + ], + "type": "table", + "html": "
MethodLocalizationMannerMAE ↓MSE ↓
BL [31]XMap-based229.3308.2
AMSNet [11]XMap-based208.4297.3
GauNet+CSRNet [5]XMap-based215.4296.4
HMoDE [6]XMap-based159.6211.2
P2PNet [43]✓Point-based172.7256.1
PET [24]✓Point-based159.9223.7
APGCC✓Point-based154.8205.5
", + "image_path": "272e6524aa9c9d537d51101fdc3e1a4912ebeb426e4fb21b97d7e30f4fbdf7e7.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 315, + 297, + 446, + 380 + ], + "blocks": [ + { + "bbox": [ + 315, + 297, + 446, + 380 + ], + "lines": [ + { + "bbox": [ + 315, + 297, + 446, + 380 + ], + "spans": [ + { + "bbox": [ + 315, + 297, + 446, + 380 + ], + "type": "table", + "html": "
MethodLocalizationMannerMAE \\( \\downarrow \\)MSE \\( \\downarrow \\)
NoisyCC [45]✘Map-based96.9534.2
UOT [32]✘Map-based87.8387.5
MAN [22]✘Map-based76.5323.0
ChfL [40]✘Map-based76.8343.0
HMoDE+REL [6]✘Map-based73.4331.8
RAZ [23]✓Map-based151.4634.6
GL [46]✓Map-based79.3346.1
AutoScale [51]✓Map-based123.9515.5
TopoCount [1]✓Detection-based107.8438.5
P2PNet [43]✓Point-based77.4362.0
CLTR [20]✓Point-based74.3333.8
PET [24]✓Point-based74.4328.5
APGCC✓Point-based71.7284.4
", + "image_path": "bab5406693fd9456375a1e9ad54a072c42ed15ad89ca2a13aaffa97d40e7406e.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 403, + 317, + 415 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 403, + 317, + 415 + ], + "spans": [ + { + "bbox": [ + 131, + 403, + 317, + 415 + ], + "type": "text", + "content": "6.1 Evaluation on Crowd Counting" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 426, + 481, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 481, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 481, + 520 + ], + "type": "text", + "content": "This section outlines our comparative analysis of crowd counting methods, where our approach is benchmarked against an array of state-of-the-art techniques across diverse datasets. We evaluate our performance against both map-based [5, 6, 11, 22, 23, 30-32, 40, 45, 46, 50, 51], detection-based [1, 39] and point-based [20, 24, 43] methodologies. Our experiments, detailed in Tables 1, 2, and 3, highlight APGCC's leading performance, with the best results in bold and the second-best results underlined. These findings affirm the effectiveness and adaptability of our approach in various crowd counting scenarios." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 521, + 481, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 481, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 481, + 592 + ], + "type": "text", + "content": "Table 1 focuses on datasets such as SHHA [53], SHHB [53], UCF-QNRF [13] and JHU-Crowd [42], showcasing APGCC's significant improvements in accuracy metrics like MAE and MSE. For example, compared to P2PNet [43] on the SHHA [53] and SHHB [53] datasets, APGCC achieved substantial reductions in both MAE and MSE, demonstrating its effectiveness even in sparse and simple scene conditions." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 593, + 480, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 480, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 480, + 640 + ], + "type": "text", + "content": "In Table 2, we specifically examine the UCF_CC_50 dataset [12], a challenging set of 50 images with complex scenes. Our approach notably excels, achieving impressive results that underscore the efficiency and stability of our learning strategy, particularly beneficial for datasets with limited images." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 641, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 480, + 665 + ], + "type": "text", + "content": "Finally, Table 3 presents our performance on the NWPU-Crowd dataset [47], the most extensive congested dataset considered in our study. Our approach out-" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 448, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 140, + 148, + 302, + 215 + ], + "blocks": [ + { + "bbox": [ + 132, + 125, + 306, + 147 + ], + "lines": [ + { + "bbox": [ + 132, + 125, + 306, + 147 + ], + "spans": [ + { + "bbox": [ + 132, + 125, + 306, + 147 + ], + "type": "text", + "content": "Table 4: Evaluation of crowd localization on NWPU [47] dataset." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 140, + 148, + 302, + 215 + ], + "lines": [ + { + "bbox": [ + 140, + 148, + 302, + 215 + ], + "spans": [ + { + "bbox": [ + 140, + 148, + 302, + 215 + ], + "type": "table", + "html": "
MethodManner\\( {\\sigma }_{t} \\) (large threshold)\\( {\\sigma }_{s} \\) (small threshold)
F(%) \\( \\uparrow \\)P(%) \\( \\uparrow \\)R(%) \\( \\uparrow \\)F(%) \\( \\uparrow \\)P(%) \\( \\uparrow \\)R(%) \\( \\uparrow \\)
RAZ [23]Map-based59.866.654.357.647.051.7
AutoScale [51]Map-based67.357.462.0---
GL [46]Map-based66.080.056.258.771.150.0
TinyFaces [10]Detection-based56.752.961.152.649.156.6
TopoCount [1]Detection-based63.765.162.4---
P2PNet [43]Point-based71.272.969.567.568.466.6
CLTR [20]Point-based68.569.467.659.159.958.3
PET [24]Point-based74.275.273.267.568.466.6
APGCCPoint-based76.479.273.668.971.566.5
", + "image_path": "fcbd637dbbfe8ee23da64d92db506ea79461d40b3733f4de41b8528dc740cec2.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 313, + 148, + 476, + 203 + ], + "blocks": [ + { + "bbox": [ + 307, + 125, + 477, + 147 + ], + "lines": [ + { + "bbox": [ + 307, + 125, + 477, + 147 + ], + "spans": [ + { + "bbox": [ + 307, + 125, + 477, + 147 + ], + "type": "text", + "content": "Table 5: Evaluation of crowd localization on SHHA [53] dataset." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 313, + 148, + 476, + 203 + ], + "lines": [ + { + "bbox": [ + 313, + 148, + 476, + 203 + ], + "spans": [ + { + "bbox": [ + 313, + 148, + 476, + 203 + ], + "type": "table", + "html": "
MethodMannerσ = 4σ = 8
F(%) ↑P(%) ↑R(%) ↑F(%) ↑P(%) ↑R(%) ↑
LOBB [38]Map-based25.934.920.753.967.644.8
LCFCN [17]Detection-based32.543.326.056.375.145.1
LSC-CNN [39]Detection-based32.633.431.962.463.961.0
TopoCount [1]Detection-based41.141.740.673.674.672.7
P2PNet [43]Point-based40.641.539.874.676.273.1
CLTR [20]Point-based43.243.642.774.274.973.5
APGCCPoint-based48.749.248.378.479.177.7
", + "image_path": "3f311a885595e3d52add6a11480baf6fa8386970040f348d237406a4644fb3c9.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 238, + 479, + 299 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 238, + 479, + 299 + ], + "spans": [ + { + "bbox": [ + 130, + 238, + 479, + 299 + ], + "type": "text", + "content": "performs the competition, including the second-best method, HMoDE+REL [6], by achieving lower MAE and MSE. This success can be attributed mainly to our implementation of Auxiliary Points Guidance and the enhancement provided by the Implicit Feature Interpolation technique, which together significantly improve model reliability and adaptability to different scales and densities." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 319, + 331, + 331 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 319, + 331, + 331 + ], + "spans": [ + { + "bbox": [ + 131, + 319, + 331, + 331 + ], + "type": "text", + "content": "6.2 Evaluation on Crowd Localization" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 343, + 480, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 343, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 343, + 480, + 403 + ], + "type": "text", + "content": "We benchmark our approach against a diverse array of methods, including map-based methods such as RAZ [23], AutoScale [51], LOBB [38], and GL [46]; detection-based methods like TinyFaces [10], TopoCount [1], LSC-CNN [39], and LCFCN [17]; as well as point-based methods including P2PNet [43], CLTR [20], and PET [24]." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "spans": [ + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "text", + "content": "Table 4, focusing on the NWPU dataset [47], showcases APGCC's superior performance. Compared to detection-based methods that utilize box-level annotations and other point-based approaches, APGCC leverages IFI to acquire precise features and utilizes closer proposal predictions to achieve optimal precision. Conversely, in the SHHA dataset [53], as detailed in Table 5, APGCC secures comprehensive improvements: at a " + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "inline_equation", + "content": "\\sigma = 4" + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "text", + "content": ", the F1-measure increased by " + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "inline_equation", + "content": "5.5\\%" + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "text", + "content": ", and at " + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "inline_equation", + "content": "\\sigma = 8" + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "text", + "content": ", it rose by " + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "inline_equation", + "content": "3.8\\%" + }, + { + "bbox": [ + 130, + 404, + 481, + 487 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 510, + 326, + 523 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 510, + 326, + 523 + ], + "spans": [ + { + "bbox": [ + 131, + 510, + 326, + 523 + ], + "type": "text", + "content": "6.3 Evaluation of Model Complexity" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "In Table 6, we benchmark APGCC against other point-based methods, focusing on the number of parameters and inference time. The inference time evaluations are conducted on an NVIDIA 3090 GPU with an input resolution of " + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "inline_equation", + "content": "1024 \\times 1024" + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": ". The findings illustrate that APGCC maintains efficient computational complexity and delivers superior performance in crowd counting and localization tasks. Note that since our APG training mechanism is employed only during training, it does not incur additional computational overhead during inference. Compared to the original point-based method (i.e., P2PNet [43]) that utilizes traditional upsampling to process features, our use of IFI allows for more accurate representation learning with fewer parameters. This method enhances computational efficiency, as employing MLPs for feature interpolation is known to be efficient [35]." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 238, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 238, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 238, + 128 + ], + "type": "text", + "content": "6.4 Ablation Study" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 134, + 479, + 158 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 134, + 479, + 158 + ], + "spans": [ + { + "bbox": [ + 130, + 134, + 479, + 158 + ], + "type": "text", + "content": "We evaluate the effectiveness of the proposed two modules, APG and IFI. We evaluate the performance on SHHA dataset [53]." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 160, + 482, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 482, + 376 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 482, + 376 + ], + "type": "text", + "content": "Effectiveness of APG. We explore the impact of different optimization strategies, with several distinct settings as follows: (a) \"Matcher\" solely employs the matching strategy as described in Section 3 and [43], (b) \"Nearest Point\" directly selects the proposal closest to the ground truth as the positive proposal, with all others considered negative, (c) \"APG\", which exclusively utilizes the proposed APG for training, and (d) \"Matcher + APG\" (Ours). The experimental results, as shown in Table 7, indicate that while strategy (b) may seem intuitive and straightforward to design, it risks multiple ground truths mapping to the same proposal, severely underestimating the final counting. Consequently, using (a) can guide the model on how to allocate proposals for learning and introduce confidence information to enhance discrimination. Our proposed APG effectively addresses the shortcomings of the nearest point, providing an equivalent number of proposals for the model to learn to match the closest proposals. However, as auxiliary positive points cannot be provided during the inference phase, relying solely on APG can make the model overly dependent on reference values. Therefore, by combining the advantages of Matcher and APG (i.e., (d)), we not only teach the model how to allocate a fixed number of proposals but also guide it to make more elegant choices." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "text", + "content": "Optimizing APG Setup. Our exploration into optimizing APG focuses on two key aspects: (i) determining the optimal number of potential positive and negative points (" + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "inline_equation", + "content": "k_{\\mathrm{pos}}" + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "inline_equation", + "content": "k_{\\mathrm{neg}}" + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "text", + "content": "), as defined in Section 4.1, and (ii) adjusting the randomness scale of APG (" + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "inline_equation", + "content": "n_{\\mathrm{neg}}" + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "inline_equation", + "content": "n_{\\mathrm{pos}}" + }, + { + "bbox": [ + 130, + 378, + 482, + 437 + ], + "type": "text", + "content": "), with findings detailed in Tables 8 and 9." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 438, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 438, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 482, + 581 + ], + "type": "text", + "content": "Table 8 explores the impact of the number of auxiliary positive and negative points on performance, essential for validating the APG's effectiveness. The results indicate that while using only auxiliary positive points slightly favors the selection of nearest proposals, it's limited in preventing duplicate predictions. Introducing auxiliary negative points enhances differentiation and training stability by encouraging the model to reject distant proposals. Despite an increase in auxiliary point pairs leading to better stabilization (lower Avg. IR and Avg. " + }, + { + "bbox": [ + 130, + 438, + 482, + 581 + ], + "type": "inline_equation", + "content": "\\Delta" + }, + { + "bbox": [ + 130, + 438, + 482, + 581 + ], + "type": "text", + "content": "), the effect on final performance (MAE) is minimal. Thus, we suggest utilizing a balanced (2, 2) ratio of positive to negative points to achieve better learning performance. This is because training with a (5, 5) setting requires roughly twice the training effort compared to (2, 2), without a significant improvement in performance." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Additionally, the degree of randomness applied to auxiliary proposals plays a pivotal role in the configuration of the APG. Our experiments, executed with a stride of 8, have demonstrated that a precise range of randomness is crucial for attaining optimal results, as evidenced in Table 9. While a constrained randomness range may limit the diversity in proposal selection, an excessive range of randomness could jeopardize the model's confidence uniformity across different areas, impacting its effectiveness." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 159, + 305, + 186 + ], + "blocks": [ + { + "bbox": [ + 132, + 125, + 301, + 158 + ], + "lines": [ + { + "bbox": [ + 132, + 125, + 301, + 158 + ], + "spans": [ + { + "bbox": [ + 132, + 125, + 301, + 158 + ], + "type": "text", + "content": "Table 6: Comparison of model complexity with Point-based Approaches." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 159, + 305, + 186 + ], + "lines": [ + { + "bbox": [ + 134, + 159, + 305, + 186 + ], + "spans": [ + { + "bbox": [ + 134, + 159, + 305, + 186 + ], + "type": "table", + "html": "
MethodP2PNet [43]CLTR [20]PET [24]APGCC
Parameters (M) ↓21.643.420.918.68
Inference Time (s) ↓0.0740.1070.0970.071
", + "image_path": "dc3355987ac90d16b62c94d3c7184559de466f37d259a2c645e2d9026c063564.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 134, + 237, + 304, + 266 + ], + "blocks": [ + { + "bbox": [ + 132, + 213, + 301, + 236 + ], + "lines": [ + { + "bbox": [ + 132, + 213, + 301, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 213, + 301, + 236 + ], + "type": "text", + "content": "Table 8: Evaluation of different number of auxiliary points" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 237, + 304, + 266 + ], + "lines": [ + { + "bbox": [ + 134, + 237, + 304, + 266 + ], + "spans": [ + { + "bbox": [ + 134, + 237, + 304, + 266 + ], + "type": "table", + "html": "
Num. of Auxiliary Points (kpos, kneg)(0, 0)(1, 0)(2, 0)(1, 1)(2, 2)(5, 5)
MAE ↓54.0451.5751.4749.2448.8448.81
Avg. IR ↓0.700.490.480.380.360.34
Avg. Δ ↓6.873.893.371.621.581.49
", + "image_path": "fed33fdacae52afd330f4ce50f1b2fcb524e653b4ffc93e97440a086b5eed406.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 318, + 147, + 478, + 198 + ], + "blocks": [ + { + "bbox": [ + 311, + 125, + 481, + 146 + ], + "lines": [ + { + "bbox": [ + 311, + 125, + 481, + 146 + ], + "spans": [ + { + "bbox": [ + 311, + 125, + 481, + 146 + ], + "type": "text", + "content": "Table 7: Analysis on alternatives of optimization strategies." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 318, + 147, + 478, + 198 + ], + "lines": [ + { + "bbox": [ + 318, + 147, + 478, + 198 + ], + "spans": [ + { + "bbox": [ + 318, + 147, + 478, + 198 + ], + "type": "table", + "html": "
SettingStrategyMAE ↓MSE ↓
(a)Matcher54.0486.97
(b)Nearest Point76.91118.60
(c)APG58.4696.71
(d)Matcher + APG (Ours)48.8476.79
", + "image_path": "a758184b7e91e6b7224942590a89b8b0ecd066672c5b9d868a295cf9688ab978.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 318, + 242, + 478, + 261 + ], + "blocks": [ + { + "bbox": [ + 311, + 207, + 481, + 240 + ], + "lines": [ + { + "bbox": [ + 311, + 207, + 481, + 240 + ], + "spans": [ + { + "bbox": [ + 311, + 207, + 481, + 240 + ], + "type": "text", + "content": "Table 9: Comparison of different range of randomness for auxiliary points" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 318, + 242, + 478, + 261 + ], + "lines": [ + { + "bbox": [ + 318, + 242, + 478, + 261 + ], + "spans": [ + { + "bbox": [ + 318, + 242, + 478, + 261 + ], + "type": "table", + "html": "
Randomness Range (npos, nneg)(1, 4)(2, 8)(3, 12)(4, 16)
MAE ↓49.2548.8450.2351.23
", + "image_path": "c96bd01da7bb6c0226fefa0b6d687c38c2e1ef157a1131799261984323602800.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 214, + 298, + 402, + 344 + ], + "blocks": [ + { + "bbox": [ + 168, + 276, + 443, + 288 + ], + "lines": [ + { + "bbox": [ + 168, + 276, + 443, + 288 + ], + "spans": [ + { + "bbox": [ + 168, + 276, + 443, + 288 + ], + "type": "text", + "content": "Table 10: Ablation study of Implicit Feature Interpolation." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 214, + 298, + 402, + 344 + ], + "lines": [ + { + "bbox": [ + 214, + 298, + 402, + 344 + ], + "spans": [ + { + "bbox": [ + 214, + 298, + 402, + 344 + ], + "type": "table", + "html": "
SettingMethodMAE ↓MSE ↓F1@4 ↑F1@8 ↑
(a)Nearest Neighbor without MLP53.1683.3143.5976.27
(b)Bilinear Interpolation without MLP51.2579.9245.7877.67
(c)IFI with Single Reference Point49.7377.9747.4078.27
(d)IFI w/o Positional Encoding49.2478.2747.9778.38
(e)IFI48.8476.7948.7678.46
", + "image_path": "4121c9148e0d2dfae887e0f27cb2744b6aea9cc413c51e5765bf2e368dd0a36a.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "table_body" + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 366, + 480, + 461 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 480, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 480, + 461 + ], + "type": "text", + "content": "Effectiveness of IFI. To accurately capture the correct features for proposals at arbitrary positions, we introduce IFI. Other feasible approaches include: (a) Nearest Neighbor without MLP, which directly utilizes the closest latent feature without any transformation; (b) Bilinear Interpolation without MLP, deriving features at each position through bilinear interpolation, implying no use of coordinate and continuous function transformation; (c) IFI solely employing a single reference point for continuous transformation (MLP with coordinate information); (d) IFI w/o Positional Encoding; and (e) IFI." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 462, + 481, + 546 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 481, + 546 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 481, + 546 + ], + "type": "text", + "content": "The results, as displayed in Table 10, reveal several clear trends. First, the use of interpolation outperforms the nearest-neighbor approach by providing a richer feature context. Second, a comparison between (b) and (d) highlights the benefits of using distance information for continuous transformation. Third, incorporating Positional Encoding significantly aids the MLP in achieving better learning outcomes. By integrating all these methods, we can notably enhance the representation features obtained at any given position." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 563, + 220, + 576 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 563, + 220, + 576 + ], + "spans": [ + { + "bbox": [ + 132, + 563, + 220, + 576 + ], + "type": "text", + "content": "7 Conclusion" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 589, + 480, + 649 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 589, + 480, + 649 + ], + "spans": [ + { + "bbox": [ + 130, + 589, + 480, + 649 + ], + "type": "text", + "content": "In this paper, we proposed Auxiliary Point Guidance and Implicit Feature Interpolation to address challenges in point-based crowd counting and localization. APGCC improved the stability of proposal-target matching and enabled accurate feature extraction at any position. Extensive experiments against state-of-the-art methods, our approach showed superior performance in various scenarios." + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 101 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 199 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 199 + ], + "type": "text", + "content": "We thank to National Center for High-performance Computing (NCHC) for providing computational and storage resources. This research was supported by the Research Center for Information Technology Innovation and Taiwan's National Science and Technology Council under Grant NSTC112-2634-F-001-001-MBK, NSTC 111-2221-E-002-136-MY3." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 217, + 197, + 229 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 217, + 197, + 229 + ], + "spans": [ + { + "bbox": [ + 133, + 217, + 197, + 229 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 240, + 480, + 664 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "type": "text", + "content": "1. Abousamra, S., Hoai, M., Samaras, D., Chen, C.: Localization in the crowd with topological constraints. In: AAAI (2021) 1, 2, 11, 12" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 263, + 480, + 283 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 263, + 480, + 283 + ], + "spans": [ + { + "bbox": [ + 138, + 263, + 480, + 283 + ], + "type": "text", + "content": "2. Bai, S., He, Z., Qiao, Y., Hu, H., Wu, W., Yan, J.: Adaptive dilated network with self-correction supervision for counting. In: CVPR (2020) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 285, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 285, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 138, + 285, + 480, + 315 + ], + "type": "text", + "content": "3. Basri, R., Galun, M., Geifman, A., Jacobs, D., Kasten, Y., Kritchman, S.: Frequency bias in neural networks for input of non-uniform density. In: ICML (2020) 8" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 317, + 480, + 338 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 317, + 480, + 338 + ], + "spans": [ + { + "bbox": [ + 138, + 317, + 480, + 338 + ], + "type": "text", + "content": "4. Chen, Y., Liu, S., Wang, X.: Learning continuous image representation with local implicit image function. In: CVPR (2021) 8" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 339, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 339, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 138, + 339, + 480, + 369 + ], + "type": "text", + "content": "5. Cheng, Z.Q., Dai, Q., Li, H., Song, J., Wu, X., Hauptmann, A.G.: Rethinking spatial invariance of convolutional networks for object counting. In: CVPR (2022) 11" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 372, + 480, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 372, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 138, + 372, + 480, + 392 + ], + "type": "text", + "content": "6. Du, Z., Shi, M., Deng, J., Zafeiriou, S.: Redesigning multi-scale neural network for crowd counting. TIP (2023) 11, 12" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 394, + 480, + 415 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 394, + 480, + 415 + ], + "spans": [ + { + "bbox": [ + 138, + 394, + 480, + 415 + ], + "type": "text", + "content": "7. Florian, L.C., Adam, S.H.: Rethinking atrous convolution for semantic image segmentation. In: CVPR (2017) 8, 9" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 416, + 480, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 416, + 480, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 416, + 480, + 446 + ], + "type": "text", + "content": "8. Gao, J., Han, T., Wang, Q., Yuan, Y.: Domain-adaptive crowd counting via inter-domain features segregation and gaussian-prior reconstruction. arXiv preprint arXiv:1912.03677 (2019) 1, 3, 4" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 449, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 480, + 468 + ], + "type": "text", + "content": "9. Gao, J., Han, T., Yuan, Y., Wang, Q.: Learning independent instance maps for crowd localization. arXiv preprint arXiv:2012.04164 (2020) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 471, + 480, + 491 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 471, + 480, + 491 + ], + "spans": [ + { + "bbox": [ + 133, + 471, + 480, + 491 + ], + "type": "text", + "content": "10. Hu, P., Ramanan, D.: Finding tiny faces. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 951-959 (2017) 12" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 492, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 492, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 133, + 492, + 480, + 512 + ], + "type": "text", + "content": "11. Hu, Y., Jiang, X., Liu, X., Zhang, B., Han, J., Cao, X., Doermann, D.: Nas-count: Counting-by-density with neural architecture search. In: ECCV (2020) 2, 3, 11" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 514, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 514, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 133, + 514, + 480, + 533 + ], + "type": "text", + "content": "12. Idrees, H., Saleemi, I., Seibert, C., Shah, M.: Multi-source multi-scale counting in extremely dense crowd images. In: CVPR (2013) 9, 11" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 535, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 535, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 133, + 535, + 480, + 567 + ], + "type": "text", + "content": "13. Idrees, H., Tayyab, M., Athrey, K., Zhang, D., Al-Maadeed, S., Rajpoot, N., Shah, M.: Composition loss for counting, density map estimation and localization in dense crowds. In: ECCV (2018) 2, 3, 4, 9, 10, 11" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 133, + 568, + 480, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 568, + 480, + 589 + ], + "spans": [ + { + "bbox": [ + 133, + 568, + 480, + 589 + ], + "type": "text", + "content": "14. Jiang, X., Zhang, L., Xu, M., Zhang, T., Lv, P., Zhou, B., Yang, X., Pang, Y.: Attention scaling for crowd counting. In: CVPR (2020) 1, 2, 3" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 133, + 590, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 590, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 133, + 590, + 480, + 610 + ], + "type": "text", + "content": "15. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) 10" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 133, + 612, + 480, + 631 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 612, + 480, + 631 + ], + "spans": [ + { + "bbox": [ + 133, + 612, + 480, + 631 + ], + "type": "text", + "content": "16. Kuhn, H.W.: The hungarian method for the assignment problem. NRL (1955) 2, 5" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 133, + 633, + 480, + 664 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 633, + 480, + 664 + ], + "spans": [ + { + "bbox": [ + 133, + 633, + 480, + 664 + ], + "type": "text", + "content": "17. Laradji, I.H., Rostamzadeh, N., Pinheiro, P.O., Vazquez, D., Schmidt, M.: Where are the blobs: Counting by localization with point supervision. In: ECCV (2018) 3, 12" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 25, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 138 + ], + "type": "text", + "content": "18. Li, Y., Zhang, X., Chen, D.: Csrnet: Dilated convolutional neural networks for understanding the highly congested scenes. In: CVPR (2018) 1, 3" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 160 + ], + "type": "text", + "content": "19. Lian, D., Li, J., Zheng, J., Luo, W., Gao, S.: Density map regression guided detection network for rgb-d crowd counting and localization. In: CVPR (2019) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "text", + "content": "20. Liang, D., Xu, W., Bai, X.: An end-to-end transformer model for crowd localization. In: ECCV (2022) 2, 4, 11, 12, 14" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 480, + 205 + ], + "type": "text", + "content": "21. Liang, D., Xu, W., Zhu, Y., Zhou, Y.: Focal inverse distance transform maps for crowd localization. TMM (2022) 1, 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 205, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 480, + 226 + ], + "type": "text", + "content": "22. Lin, H., Ma, Z., Ji, R., Wang, Y., Hong, X.: Boosting crowd counting via multifaceted attention. In: CVPR (2022) 1, 11" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 228, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 480, + 248 + ], + "type": "text", + "content": "23. Liu, C., Weng, X., Mu, Y.: Recurrent attentive zooming for joint crowd counting and precise localization. In: CVPR (2019) 3, 11, 12" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 249, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 480, + 270 + ], + "type": "text", + "content": "24. Liu, C., Lu, H., Cao, Z., Liu, T.: Point-query quadtree for crowd counting, localization, and more. In: ICCV. pp. 1676-1685 (2023) 2, 4, 11, 12, 14" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 480, + 293 + ], + "type": "text", + "content": "25. Liu, L., Lu, H., Xiong, H., Xian, K., Cao, Z., Shen, C.: Counting objects by blockwise classification. TCSVT (2019) 2, 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 314 + ], + "type": "text", + "content": "26. Liu, L., Lu, H., Zou, H., Xiong, H., Cao, Z., Shen, C.: Weighing counts: Sequential crowd counting by reinforcement learning. In: ECCV (2020) 2, 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "text", + "content": "27. Liu, W., Durasov, N., Fua, P.: Leveraging self-supervision for cross-domain crowd counting. In: CVPR (2022) 1" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 357 + ], + "type": "text", + "content": "28. Liu, X., Yang, J., Ding, W.: Adaptive mixture regression network with local counting map for crowd counting. In: ECCV (2020) 2, 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 358, + 480, + 379 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 480, + 379 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 480, + 379 + ], + "type": "text", + "content": "29. Liu, Y., Shi, M., Zhao, Q., Wang, X.: Point in, box out: Beyond counting persons in crowds. In: CVPR (2019) 2, 3, 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 380, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 480, + 402 + ], + "type": "text", + "content": "30. Ma, Z., Hong, X., Wei, X., Qiu, Y., Gong, Y.: Towards a universal model for cross-dataset crowd counting. In: ICCV (2021) 11" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 403, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 480, + 424 + ], + "type": "text", + "content": "31. Ma, Z., Wei, X., Hong, X., Gong, Y.: Bayesian loss for crowd count estimation with point supervision. In: ICCV (2019) 2, 3, 11" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 425, + 480, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 425, + 480, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 425, + 480, + 445 + ], + "type": "text", + "content": "32. Ma, Z., Wei, X., Hong, X., Lin, H., Qiu, Y., Gong, Y.: Learning to count via unbalanced optimal transport. In: AAAI (2021) 11" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 447, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 480, + 468 + ], + "type": "text", + "content": "33. Miao, Y., Lin, Z., Ding, G., Han, J.: Shallow feature based dense attention network for crowd counting. In: AAAI (2020) 3" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 468, + 480, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 468, + 480, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 468, + 480, + 500 + ], + "type": "text", + "content": "34. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., Ng, R.: Nerf: Representing scenes as neural radiance fields for view synthesis. ACM (2021) 8" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 501, + 480, + 532 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 480, + 532 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 480, + 532 + ], + "type": "text", + "content": "35. Park, J.J., Florence, P., Straub, J., Newcombe, R., Lovegrove, S.: Deepsdf: Learning continuous signed distance functions for shape representation. In: CVPR (2019) 8, 12" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 533, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 533, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 533, + 480, + 566 + ], + "type": "text", + "content": "36. Rahaman, N., Baratin, A., Arpit, D., Draxler, F., Lin, M., Hamprecht, F., Bengio, Y., Courville, A.: On the spectral bias of neural networks. In: ICML. pp. 5301-5310. PMLR (2019) 8" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 567, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 480, + 588 + ], + "type": "text", + "content": "37. Ren, S., He, K., Girshick, R., Sun, J.: Faster r-cnn: Towards real-time object detection with region proposal networks. NeurIPS (2015) 4" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "type": "text", + "content": "38. Ribera, J., Guera, D., Chen, Y., Delp, E.J.: Locating objects without bounding boxes. In: CVPR (2019) 12" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "text", + "content": "39. Sam, D.B., Peri, S.V., Sundararaman, M.N., Kamath, A., Babu, R.V.: Locate, size, and count: accurately resolving people in dense crowds via detection. TPAMI (2020) 2, 3, 4, 11, 12" + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "text", + "content": "40. Shu, W., Wan, J., Tan, K.C., Kwong, S., Chan, A.B.: Crowd counting in the frequency domain. In: CVPR (2022) 11" + } + ] + } + ], + "index": 24 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 100 + ], + "type": "text", + "content": "Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 435 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "text", + "content": "41. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014) 8" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 482, + 160 + ], + "type": "text", + "content": "42. Sindagi, V.A., Yasarla, R., Patel, V.M.: Jhu-crowd++: Large-scale crowd counting dataset and a benchmark method. TPAMI (2020) 9, 11" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 160, + 482, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 160, + 482, + 194 + ], + "spans": [ + { + "bbox": [ + 130, + 160, + 482, + 194 + ], + "type": "text", + "content": "43. Song, Q., Wang, C., Jiang, Z., Wang, Y., Tai, Y., Wang, C., Li, J., Huang, F., Wu, Y.: Rethinking counting and localization in crowds: A purely point-based framework. In: ICCV (2021) 2, 4, 10, 11, 12, 13, 14" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 194, + 482, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 194, + 482, + 226 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 482, + 226 + ], + "type": "text", + "content": "44. Tancik, M., Srinivasan, P., Mildenhall, B., Fridovich-Keil, S., Raghavan, N., Singhal, U., Ramamoorthi, R., Barron, J., Ng, R.: Fourier features let networks learn high frequency functions in low dimensional domains. NeurIPS (2020) 8" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 226, + 482, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 247 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 247 + ], + "type": "text", + "content": "45. Wan, J., Chan, A.: Modeling noisy annotations for crowd counting. NeurIPS (2020) 11" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 248, + 482, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 270 + ], + "type": "text", + "content": "46. Wan, J., Liu, Z., Chan, A.B.: A generalized loss function for crowd counting and localization. In: CVPR (2021) 1, 2, 11, 12" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 293 + ], + "type": "text", + "content": "47. Wang, Q., Gao, J., Lin, W., Li, X.: Nwpu-crowd: A large-scale benchmark for crowd counting and localization. TPAMI (2020) 9, 10, 11, 12" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 293, + 482, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 314 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 314 + ], + "type": "text", + "content": "48. Wang, Y., Hou, J., Hou, X., Chau, L.P.: A self-training approach for point-supervised object detection and counting in crowds. TIP (2021) 1, 4" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 314, + 482, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 482, + 336 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 482, + 336 + ], + "type": "text", + "content": "49. Xiong, H., Lu, H., Liu, C., Liu, L., Cao, Z., Shen, C.: From open set to closed set: Counting objects by spatial divide-and-conquer. In: ICCV (2019) 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 336, + 482, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 336, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 130, + 336, + 482, + 357 + ], + "type": "text", + "content": "50. Xiong, H., Yao, A.: Discrete-constrained regression for local counting models. In: ECCV (2022) 11" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 357, + 482, + 379 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 357, + 482, + 379 + ], + "spans": [ + { + "bbox": [ + 130, + 357, + 482, + 379 + ], + "type": "text", + "content": "51. Xu, C., Liang, D., Xu, Y., Bai, S., Zhan, W., Bai, X., Tomizuka, M.: Autoscale: learning to scale for crowd counting. IJCV (2022) 4, 11, 12" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 380, + 482, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 413 + ], + "type": "text", + "content": "52. Xu, X., Wang, Z., Shi, H.: Ultrasr: Spatial encoding is a missing key for implicit image function-based arbitrary-scale super-resolution. arXiv preprint arXiv:2103.12716 (2021) 8" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "type": "text", + "content": "53. Zhang, Y., Zhou, D., Chen, S., Gao, S., Ma, Y.: Single-image crowd counting via multi-column convolutional neural network. In: CVPR (2016) 2, 9, 11, 12, 13" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 272, + 91, + 447, + 102 + ], + "type": "text", + "content": "Auxiliary Point Guidance Crowd Counting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_content_list.json b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..08599be54edc9de2f256a4c2d19b052762b00b9a --- /dev/null +++ b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_content_list.json @@ -0,0 +1,1646 @@ +[ + { + "type": "text", + "text": "Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures", + "text_level": 1, + "bbox": [ + 261, + 140, + 743, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Sayanton V. Dibbo $^{1,2}$ , Adam Breuer $^{1}$ , Justin Moore $^{2}$ , and Michael Teti $^{2}$", + "bbox": [ + 215, + 210, + 787, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Dartmouth College, Hanover, NH 03755, USA", + "bbox": [ + 338, + 238, + 661, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Los Alamos National Laboratory, Los Alamos, NM 87545, USA", + "bbox": [ + 281, + 253, + 720, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{f0048vh,adam.breuer}@dartmouth.edu", + "bbox": [ + 364, + 268, + 638, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{jmoore01,mteti}@lanl.gov", + "bbox": [ + 403, + 282, + 599, + 296 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Recent model inversion attack algorithms permit adversaries to reconstruct a neural network's private and potentially sensitive training data by repeatedly querying the network. In this work, we develop a novel network architecture that leverages sparse-coding layers to obtain superior robustness to this class of attacks. Three decades of computer science research has studied sparse coding in the context of image denoising, object recognition, and adversarial misclassification settings, but to the best of our knowledge, its connection to state-of-the-art privacy vulnerabilities remains unstudied. In this work, we hypothesize that sparse coding architectures suggest an advantageous means to defend against model inversion attacks because they allow us to control the amount of irrelevant private information encoded by a network in a manner that is known to have little effect on classification accuracy. Specifically, compared to networks trained with a variety of state-of-the-art defenses, our sparse-coding architectures maintain comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions by factors of 1.1 to 18.3 across a variety of reconstruction quality metrics (PSNR, SSIM, FID). This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug- $\\mathcal{E}$ -Play attacks. We provide a cluster-ready PyTorch codebase to promote research and standardize defense evaluations.", + "bbox": [ + 261, + 325, + 743, + 631 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Model Inversion Attack, Defense, Privacy Attacks, Sparse Coding.", + "bbox": [ + 215, + 652, + 785, + 669 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 689, + 375, + 705 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The popularization of machine learning has been accompanied by the widespread use of neural networks that were trained on private, sensitive, and proprietary datasets. This has given rise to a new generation of privacy attacks that seek to infer private information about the training dataset simply by inspecting the representation of the training data that remains encoded in the model's parameters [11, 15, 16, 20, 21, 31, 35, 41, 45, 58, 61, 68, 75, 76, 78].", + "bbox": [ + 212, + 718, + 787, + 809 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Of particular concern is a devastating stream of privacy attacks known as model inversion. Model inversion attacks leverage the network's parameters or", + "bbox": [ + 215, + 810, + 787, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "classifications in order to reconstruct entire images or data that were used to train the network. Early work on model inversion focused on a white-box setting where the attacker has unfettered access to the model or auxiliary information about the training data [20,30,69,71,77]. However, recent work has shown that standard network architectures are vulnerable to model inversion attacks even when attackers have no knowledge of the model's architecture or parameters, and only have access to the model's classifications or its intermediate outputs, such as leaked outputs from a single hidden network layer [5,22,45,46,56,74].", + "bbox": [ + 212, + 146, + 787, + 267 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Are different network architectures robust to model inversion attacks?", + "bbox": [ + 250, + 268, + 750, + 282 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Such attacks are feasible because each hidden layer of a standard network architecture captures a detailed representation of the training data. It is well-known that standard dense layers exhibit a tendency to memorize their inputs [10, 23, 54], so even a minimal leak of a network's class distribution output or a leak of its intermediate outputs from a single layer is often sufficient to train an inverse mapping for data reconstruction. More concretely, state-of-the-art inversion attacks work by submitting externally obtained images to the model, observing leaked outputs, then using this data to train a new 'inverted' neural network that reconstructs (predicts) an input image given a leaked output. This can be accomplished either directly via SGD, or by optimizing a GAN, and we consider both approaches here. Such attacks on standard network architectures can reconstruct private training images that are clearly recognizable by humans familiar with the training data [4, 18, 22, 26, 30, 33, 61, 71, 74].", + "bbox": [ + 212, + 287, + 787, + 484 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Recent work has pursued a diverse array of defense strategies to mitigate these attacks. For example, [22] augments the training dataset with GAN-generated fake samples designed to inject spurious features into the trained network that mislead the gradients computed during inversion attacks. In contrast, multiple recent defenses add regularization terms during training that attempt to penalize training data memorization [53, 66]. Other recent defenses noise the network weights to obfuscate memorized data [2,47,64], or noise and clip training gradients via DP-SGD [25]. All such approaches are costly: data augmentation-based defenses entail the computational burden of building a GAN and applying sophisticated parameter tuning techniques during training; regularization-based defenses explicitly trade away classification accuracy for less memorization, and noise-based defenses are also known to impose significant accuracy costs. Until very recently, there were no known provable guarantees for model inversion defenses, and the current best-known guarantees require a DP-SGD-based training algorithm that imposes a significant computational burden and accuracy loss to obtain privacy guarantees that are impractically weak for these attacks [25].", + "bbox": [ + 212, + 488, + 787, + 731 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Very little is known about how a network's architecture contributes to its robustness (or vulnerability). This is surprising since throughout three decades of research in other domains such as image denoising [3, 6, 9, 12, 19, 39, 50, 55], object recognition [24, 36, 51, 59], and adversarial misclassification [17, 37, 52, 62, 63], researchers seeking to control their model's representations of the data have heavily studied sparse coding-based architectures that prune unnecessary details and preserve only the information that is essential to the model objective.", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Specifically, sparse coding seeks to approximately represent an image (or layer) with only a small set of basis vectors selected from an overcomplete dictionary [9, 19, 50]. While it is well-known that computing a sparse representation using a standard objective function is NP-hard in general [14, 32, 49], we now benefit from fast approximation algorithms that efficiently compute high-quality sparse representations [8, 13, 32, 36, 39, 40, 48, 55]. Sparse coding architectures leverage this technique by inserting a sparse network layer after a dense layer, such that the sparse layer reduces the dense layer's outputs to a sparse representation.", + "bbox": [ + 212, + 146, + 787, + 268 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To our knowledge, sparse coding architectures have not been studied in the context of model inversion or privacy attacks. However, they suggest an advantageous means to prevent such attacks because they control the amount of irrelevant private information encoded in a model's intermediate representations in a manner that is known to have little effect on its accuracy, that can be computed efficiently during training, and that adds little to the trained model's overall parameter complexity. Put simply, sparsifying a network's representations is a natural means to preclude memorization of detailed information about its inputs that is unnecessary to obtain high accuracy, so even an idealized 'perfect attacker' could only hope to recover a sparsified, un-detailed training image.", + "bbox": [ + 212, + 277, + 789, + 430 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Main contribution. We begin by showing that an off-the-shelf sparse coding preprocessing step offers performance advantages compared to state-of-the-art data augmentation, regularization, and noise based defenses in terms of robustness to model inversion attacks. We then refine this idea into a network architecture that achieves superior performance. Our main result is a novel sparse-coding architecture, SCA, that is robust to state-of-the-art model inversion attacks.", + "bbox": [ + 212, + 440, + 789, + 532 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "SCA is defined by pairs of alternating sparse coded and dense layers that jettison unnecessary private information in the input image and ensure that downstream layers do not e.g., reconstruct this information. We show that SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than 8 state-of-the-art data augmentation, regularization, and noise-based defenses in terms of PSNR and FID metrics and 1.1 to 720 times more in terms of SSIM. This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug-ε Play attacks. SCA's defense performance is also more stable than baselines across multiple runs. We emphasize that, unlike recent state-of-the-art defenses that require sophisticated parameter tuning to perform well, SCA obtains these results absent parameter tuning (i.e., using default sparsity parameters) because sparse coding naturally precludes networks from memorizing detailed representations of the training data.", + "bbox": [ + 212, + 541, + 789, + 770 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "More broadly, our results show a deep connection between state-of-the-art ML privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. We provide a comprehensive cluster-ready PyTorch codebase to promote research and standardize defense evaluation.", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 732, + 130 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Threat models", + "text_level": 1, + "bbox": [ + 215, + 143, + 395, + 160 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We consider three threat models that span the diverse range of powerful and well-informed attackers considered in recent work. We emphasize that a defense that performs well in all three settings provides strong evidence of its privacy protections under weaker, more realistic threat models with real-world attackers.", + "bbox": [ + 212, + 172, + 785, + 231 + ], + "page_idx": 3 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. Plug- & Play threat model [61]. Plug- & Play attacks are considered the most performant recent attacks. These attacks optimize the intermediate representation of StyleGAN's input vectors so that generated images maximize the target network's class prediction probability, which the attacker can query.", + "Separately, recent theoretical work on model inversion emphasizes that a strong threat model should capture 'worst-case' attackers with direct access to the information-rich, high-dimensional intermediate outputs of the target model that store private information about the training data, as well as ideal training data examples for training an inverted model [1, 25]. We consider two variants:", + "2. End-to-end threat model. We consider an attacker with access to all of the last hidden layer's raw, high-dimensional outputs, as well as a large number of ideal training data examples drawn from the true training dataset [60, 67].", + "3. Split network threat model (Federated Learning). We also consider the split network threat model described by [64]. There has been much recent interest in Federated Learning architectures that split the network across multiple agents [7, 18, 26, 38, 44], particularly for privacy-fraught domains such as medicine where legal requirements limit data sharing [34, 65]. These architectures are known to be susceptible to model inversion attacks, [18, 26, 64], and defenses are urgently needed. This threat model also allows us to capture a different view of a 'worst-case' threat model: Model inversion attacks are known to be more effective when the attacker has access to outputs from earlier layers that may exhibit a more direct representation of the input images [26]. To capture this 'worst-case', we consider the setting where the attacker has access to raw intermediate outputs from the first linear network layer. As before, we also assume the attacker has access to ideal training data examples drawn from the actual training datasets. Appendix B provides additional details about the model inversion threat models." + ], + "bbox": [ + 212, + 232, + 785, + 643 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 SCA architecture", + "text_level": 1, + "bbox": [ + 215, + 662, + 426, + 679 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We now describe the SCA architecture, which is defined by alternating pairs of Sparse Coding Layers (SCL) and dense layers, followed by downstream linear and/or convolutional layers.", + "bbox": [ + 212, + 689, + 785, + 736 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Sparse Coding Layer (SCL). Sparse coding converts raw inputs to sparse representations where only a few neurons whose features are useful in reconstructing the inputs are active. Our Sparse Coding Layer (SCL) performs sparse coding to obtain a sparse representation of a previous dense layer's representation (if the SCL is not the first layer in the network) or of the inputs (if the SCL is the first layer in the network). Fig. 1 illustrates the working principle of SCL.", + "bbox": [ + 212, + 744, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Formally, each SCL performs a reconstruction minimization problem to compute the sparse representation of its inputs (either a previous layer's representation or of the inputs to the network). Suppose the input to a (2D convolutional) SCL is $\\mathcal{X} \\in \\mathbb{R}^{\\mathcal{C} \\times \\mathcal{H} \\times \\mathcal{W}}$ with $\\mathcal{H}$ height, $\\mathcal{W}$ width, and $\\mathcal{C}$ channels/features. The goal is to find the sparse representation $\\mathcal{R}_x \\in \\mathbb{R}^{\\mathcal{F} \\times [\\mathcal{H} / S_h] \\times [\\mathcal{W} / S_w]}$ , where $\\mathcal{R}_x$ has few active neurons and corresponds to a denoised version of the input $\\mathcal{X}$ , and $S_w$ and $S_h$ indicate convolutional strides across the width and height of", + "bbox": [ + 215, + 146, + 493, + 372 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "the input, respectively. $F$ is the number of convolutional features in the SCL layer's dictionary, $\\Omega \\in \\mathbb{R}^{\\mathcal{F}\\times \\mathcal{C}\\times \\mathcal{H}_f\\times \\mathcal{W}_f}$ , where $\\mathcal{H}_f$ and $\\mathcal{W}_f$ are the height and width of each convolutional feature, respectively. Per Figure 1, the sparse coding layer starts with its input, $\\mathcal{X}$ , and dictionary of features, $\\Omega$ , to produce $\\mathcal{R}_x$ by solving the following sparse reconstruction problem:", + "bbox": [ + 212, + 373, + 787, + 449 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\min _ {\\mathcal {R} _ {x}} \\frac {1}{2} | | \\mathcal {X} - \\mathcal {R} _ {x} * \\Omega | | _ {2} ^ {2} + \\lambda | | \\mathcal {R} _ {x} | | _ {1} \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 459, + 785, + 491 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where the first term represents how much information is preserved about $\\mathcal{X}$ by $\\mathcal{R}_x$ by measuring the difference between $\\mathcal{X}$ and its reconstruction, $\\mathcal{R}_x\\circledast \\varOmega$ , computed with a transpose convolution, $\\otimes$ . The second term measures how sparse $\\mathcal{R}_x$ is, and $\\lambda$ is a constant which determines the trade-off between reconstruction fidelity and sparsity. Equation 1 is convex in $\\mathcal{R}_x$ , meaning we will always find the optimal $\\mathcal{R}_x$ that solves Equation 1.", + "bbox": [ + 214, + 501, + 787, + 590 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Among different techniques to perform sparse coding, we leverage the commonly used Locally Competitive Algorithm (LCA) [55]. LCA implements a recurrent network of leaky integrate-and-fire neurons that incorporates the general principles of thresholding and feature-similarity-based competition between neurons to solve Equation 1. While Rozell introduced LCA in the non-convolutional setting, it can be readily adapted to the convolutional setting (see Appendix A.2 for details). Specifically, each LCA neuron has an internal membrane potential $\\mathcal{P}$ which evolves per the following differential equation:", + "bbox": [ + 214, + 592, + 789, + 715 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\dot {\\mathcal {P}} (t) = \\frac {1}{\\tau} [ \\varPsi (t) - \\mathcal {P} (t) - \\mathcal {R} _ {x} (t) * \\mathcal {G} ] \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 374, + 723, + 785, + 753 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\tau$ is a time constant, $\\varPsi(t) = \\mathcal{X}*\\varOmega$ is the neuron's bottom-up drive from the input computed by taking the convolution, *, between the input, $\\mathcal{X}$ , and the dictionary, $\\varOmega$ , and $-\\mathcal{P}(t)$ is the leak term [37, 63]. Lateral competition between neurons is performed via the term $-\\mathcal{R}_x(t)*\\mathcal{G}$ , where $\\mathcal{G} = \\varOmega*\\varOmega - I$ is the similarity between each feature and the other $\\mathcal{F}$ features $(-I$ prevents", + "bbox": [ + 214, + 763, + 787, + 842 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/9c5132ada9872d483f724063575af906102ea307e638abacd8c3f50ea6c4abd0.jpg", + "image_caption": [ + "Fig.1: Pipeline of neuron (membrane potential) dynamics in Sparse Coding Layer (SCL) with lateral competitions." + ], + "image_footnote": [], + "bbox": [ + 509, + 154, + 777, + 290 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "self interactions). $\\mathcal{R}_x$ is computed by applying soft threshold activation $T_{\\lambda}(x) = \\mathrm{relu}(x - \\lambda)$ to the neuron's membrane potential, which produces nonnegative, sparse representations. Overall, this means that in LCA neurons will compete to determine which ones best represent the input, and thus will have non-zero activations in $\\mathcal{R}_x$ , the output of the SCL that is passed to the next layer.", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "SCA architecture. The SCA architecture is defined by the use of multiple pairs of sparse coding and dense (batch norm) layers after the input image, which can then be followed by other (linear, convolutional) layers. Fig. 2 illustrates this design principle. The key intuition is that the first sparse layer jettisons unnecessary private informa", + "bbox": [ + 212, + 239, + 426, + 419 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/af45de9a91e29a556ffbc64b7015b1ecae77016bd82a9cfe4e6c55b6b7c51f5b.jpg", + "image_caption": [ + "Fig. 2: Architecture of SCA." + ], + "image_footnote": [], + "bbox": [ + 439, + 282, + 785, + 358 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "tion in the input image. Then, by alternating sparse-dense pairs of layers, we ensure that unnecessary information is also jettisoned from downstream layers. In this manner, downstream layers also do not convey unnecessary private information to the adversary, and they also do not e.g. learn to reconstruct private information jettisoned by the first sparse layer. In short, previous defenses work by trying to mislead attackers by pushing model features in a wrong direction, either randomly via noise or strategically via adversarial examples, or by disincentivizing memorization during training. In contrast, SCA directly removes the unnecessary private information. Training SCA is identical to training a standard network with one exception: after each backprop updates non-sparse layers, we perform a fast update on the sparse layers, except for the first sparse layer that sparse-codes the image input.3", + "bbox": [ + 212, + 420, + 787, + 602 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "SCA training complexity & large scale applications. While we focus on the neuron lateral competition approach to sparse coding as it is practically convenient and well-represented in recent work [63], we note that for large-scale machine learning applications, we now have practical parallel algorithms that learn the sparse coding dictionary near-optimally w.p. in parallel time (adaptivity) that is logarithmic in the size of the data [8, 13, 32]. Fast single-iteration heuristics are also available (see e.g. [72]). Thus, even for large-scale applications, computing sparse representations while training SCA adds little computational overhead compared to sophisticated optimization-based techniques necessary for recent defenses [22]. In practice, even our basic sparse coding research implementations (see Section 4 and Appendix A.3) are slightly faster than optimized Torch implementations of the best-performing recent defense [53].", + "bbox": [ + 212, + 618, + 787, + 801 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 5 + }, + { + "type": "page_footnote", + "text": "3 We can optionally also perform a backpropagation on sparse layers after updating them each iteration via sparse coding. We do this in our experiments.", + "bbox": [ + 217, + 810, + 785, + 839 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 143, + 375, + 162 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "xOur goal in this section is to show that SCA performs well compared to state-of-the-art defenses as well as practical defenses used in leading industry models in terms of both classification accuracy and various reconstruction quality metrics. To evaluate its performance comprehensively, we test all combinations of 5 diverse datasets, 3 threat models, 9 defense baselines, plus multiple runs-per-experiment and various sparsity parameters $\\lambda$ . See Appendix A.1-A.6.", + "bbox": [ + 212, + 174, + 787, + 267 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Five benchmark datasets. We test our performance on all 5 diverse datasets used to benchmark model inversion attacks across the recent literature: CelebA, hi-res RGB faces, Medical MNIST medical images, CIFAR-10 hi-res RGB objects, MNIST grayscale digits, and Fashion MNIST grayscale objects.", + "bbox": [ + 212, + 279, + 787, + 340 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Three attacks. For each dataset, we conduct three sets of experiments corresponding to our three threat models. First, we test SCA and baselines' defenses against a state-of-the-art Plug- $\\mathcal{E}$ -Play attack [61] that leverages StyleGAN3 to obtain high-quality reconstructions. Second, we compare SCA networks to a variety of baselines in terms of their robustness to a state-of-the-art end-to-end network attack that leverages leaked raw high-dimensional outputs from the networks' last hidden layer, as well as held-out training data drawn from the true training dataset. This allows us to assess SCA's defenses in a realistic setting with a well-informed adversary. Our third set of experiments tests performance in a split network setting of [64] where the attacker has access to leaked raw outputs from the first linear network layer. Robustness in this setting is desirable because model inversion attacks are known to be more effective on earlier hidden layers [26], and also because an algorithm that is robust to such attacks would be an effective defense under novel security paradigms such as Federated Learning, which is vulnerable to inversion [64] (see Appendix A.5).", + "bbox": [ + 212, + 353, + 787, + 580 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Nine defense baselines. We compare SCA to 9 baselines plus extra variants, including SOTA defenses and practical defenses used in leading industry models:", + "bbox": [ + 214, + 592, + 785, + 625 + ], + "page_idx": 6 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- No-Defense. The baseline target model with no added defenses.", + "- Hayes et al. [25]. We train a DP-SGD defense that noises and clips gradients during training. This is the only defense with provable guarantees.", + "- Gong et al. [22]. We train the very recent defense from [22] that uses sophisticated tuning and two types of GAN-generated images. We also try a ‘++’ version that adds extra Continual Learning accuracy optimizations.", + "- Peng et al. [53]. We train the Bilateral Dependency defense that adds a loss function for redundant input memorization during training.", + "- Wang et al. [66]. We train a Mutual Information Regularization defense that penalizes dependence between inputs and outputs during training.", + "- Titcombe et al. [64]. We train a state-of-the-art Laplace $\\mathcal{L}(\\mu = 0, b = 0.5)$ noise defense as in [64]. We also try more noise—see Appendix D.", + "- Sparse-Standard. We train an off-the-shelf sparse coding architecture [63] with 1 sparse layer after the input image via lateral competition as in SCA." + ], + "bbox": [ + 225, + 630, + 784, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- GAN [common industry defense]. We train a GAN for 25 epochs to generate fake samples, then train the target model with both original and GAN-generated samples. This defense is frequently used in industry.", + "- Gaussian-Noise [common industry defense]. We draw noises from $\\mathcal{N}(\\mu = 0, \\sigma = 0.5)$ and inject them into intermediate dense layers post-training." + ], + "bbox": [ + 223, + 145, + 785, + 220 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "SCA without parameter tuning. In all experiments, we consider the simplest case of SCA architecture that contains SCA's alternating sparse-and-dense layer pairs followed by only linear layers. We note that adding downstream convolutional layers or more sophisticated downstream architectures is certainly possible, though we avoid this here in order to compare the essence of the SCA approach to the baselines. Appendix A.4 describes SCA details. In the split network setting, we are careful to use slightly shallower SCA architectures with fewer linear layers to match the split network experiments of [64].", + "bbox": [ + 212, + 232, + 785, + 352 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Recent state-of-the-art defenses such as GAN-based defenses require sophisticated automatic parameter tuning techniques such as focal tuning and continual learning to obtain high performance [22]. To test whether SCA can be effective absent parameter tuning, we just run SCA with sparsity parameter $\\lambda$ set to 0.1, 0.25, or 0.5—the default values from various sparse coding contexts.", + "bbox": [ + 212, + 353, + 785, + 429 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Performance metrics. We evaluate attackers' reconstructions using multiple standard metrics. Let $X_{in}^{*}$ denote the reconstruction of training image $X_{in}$ . Then:", + "bbox": [ + 212, + 439, + 785, + 470 + ], + "page_idx": 7 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Peak signal-to-noise ratio (PSNR) [lower=better]. PSNR is the ratio of max squared pixel fluctuations from $X_{in}$ to $X_{*in}$ over mean squared error.", + "- Structural similarity (SSIM) [70] [lower=better]. SSIM measures the product of luminance distortion, contrast distortion, & correlation loss: $SSIM(X_{in},X_{in}^{*}) = l_{dis}(X_{in},X_{in}^{*})c_{dis}(X_{in},X_{in}^{*})c_{loss}(X_{in},X_{in}^{*})$ .", + "- Fréchet inception distance (FID) [28] [higher=better]. FID measures reconstruction quality as a distributional difference between $X_{in}$ and $X_{in}^{*}$ :" + ], + "bbox": [ + 225, + 474, + 785, + 579 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nF I D ^ {2} (X _ {i n}, X _ {i n} ^ {*}) = | | \\mu_ {X _ {i n}} - \\mu_ {X _ {i n} ^ {*}} | | ^ {2} + T r (\\mathrm {C o} _ {X _ {i n}} + \\mathrm {C o} _ {X _ {i n} ^ {*}} - 2 * \\sqrt {\\mathrm {C o} _ {X _ {i n}} \\cdot \\mathrm {C o} _ {X _ {i n} ^ {*}}})\n$$\n", + "text_format": "latex", + "bbox": [ + 243, + 580, + 785, + 603 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Target model. We focus on privacy attacks on linear networks because they capture the essence of the privacy attack vulnerability [20, 29], and because there is broad consensus that a principled understanding of their emerging privacy (and security) vulnerabilities4 is urgently needed [27, 42, 57, 73].", + "bbox": [ + 214, + 612, + 785, + 674 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "PyTorch codebase, replicability, and evaluation standardization. For all experiments, we consider the standard train test split of $70\\%$ and $30\\%$ . After training each defense model, we run attacks to reconstruct the entire training set and compare reconstruction performance. We run all the experiments on a standard industry production cluster with 4 nodes and DELL Tesla V100 GPUs with 40 cores. We provide a cluster-ready PyTorch codebase on our project page at: https://sayantondibbo.github.io/SCA.", + "bbox": [ + 214, + 684, + 785, + 790 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 7 + }, + { + "type": "page_footnote", + "text": "4 We also note that results on linear models may generalize better than results on more application-specific models, and linear models trained on private data remain ubiquitous among top industry products.", + "bbox": [ + 217, + 796, + 785, + 839 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Experimental results overview", + "text_level": 1, + "bbox": [ + 215, + 146, + 511, + 161 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Defense. Across the 3 attack settings and 5 datasets, SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than the 9 baselines in terms of PSNR & FID, and 1.1 to 720 times more in terms of SSIM. This performance gap exceeds the scale of improvements made by recent algorithms. SCA's defense is also more stable than baselines across multiple runs. This is because unlike for baselines, even an idealized 'perfect attacker' can only hope to recover a sparsified, un-detailed training image from SCA. We show results here for the 2 most privacy-sensitive datasets of medical images and CelebA in 3 threat models, and defer the 9 other {dataset, attack} combinations to Appendix C.", + "bbox": [ + 212, + 169, + 787, + 321 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Accuracy. Typically, obtaining greater defense means trading away accuracy. However, in 6 of the 15 experiments (MNIST + FashionMNIST) × (Plug & Play + end-to-end + split networks), SCA outperforms no-defense and all baselines' accuracy. SCA also outperforms all baselines' accuracy on CelebA in Plug & Play, and a sparse approach is within 0.003 of the best accuracy on an 8th experiment. No other single SOTA baseline wins on accuracy this consistently. We emphasize that unlike baselines that do accuracy hyperparameter tuning, we obtain this result absent any such tuning. SCA drops accuracy on MedMNIST (which is the most imbalanced & has fewest training examples). However, tuning of SCA (kernel size $5 \\rightarrow 7$ ) improves SCA's accuracy on MedMNIST in Table 3 from $94.6\\%$ to $97\\%$ —See Appendix G and Table 12.", + "bbox": [ + 212, + 324, + 787, + 491 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Results of experiments set 1: Plug- $\\mathcal{E}$ -Play attack.", + "text_level": 1, + "bbox": [ + 215, + 497, + 627, + 511 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Qualitative evaluations. Fig. 3 shows hi-res CelebA reconstructions generated by Plug- & Play under various defenses. To avoid cherry-picking, Fig. 3 shows the 3 images with the highest (top row), median (middle), and lowest (bottom) PSNR reconstructions under No-Defense. Note that reconstructions under SCA totally differ from actual images (different race, hair, gender, child/adult), while those of other defenses are closer to actual images, indicating privacy leakage.", + "bbox": [ + 212, + 512, + 787, + 602 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Metric evaluations. Table 1 reports reconstruction quality measures and accuracy for SCA and other baselines in the Plug- & Play attack [61] setting (lower rows = better defense performance). In terms of PSNR and SSIM, training data", + "bbox": [ + 212, + 603, + 787, + 648 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/3e99c4b68bfd36bc0fecfcb6f48b078f8ac657fe6145dad9b1479f237c8d35b0.jpg", + "image_caption": [ + "Fig. 3: Experiments set 1: Qualitative comparisons among actual and reconstructed images (Plug- & Play Attack [61]) under SCA & baselines on hi-res CelebA dataset." + ], + "image_footnote": [], + "bbox": [ + 243, + 672, + 761, + 795 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/861d1c7cadcd265075be9e5dcc7103200d712f1e074c40e2cc7c19f112f6ad5b.jpg", + "table_caption": [ + "Table 1: Experiments set 1: Performance comparison under Plug- &-Play attack [61] setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images." + ], + "table_footnote": [], + "table_body": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE11.350.718256.40.779
GAUSSIAN-NOISE10.390.604264.80.644
GAN10.150.613289.70.635
Titcombe et al. [64]10.180.636304.10.654
Gong et al. [22]++10.020.556381.50.672
Gong et al. [22]10.110.595350.50.614
Peng et al. [53]9.900.514402.80.728
Hayes et al. [25]9.920.556383.70.621
Wang et al. [66]9.850.527402.80.742
SPARSE-STANDARD9.840.539374.70.728
SCA0.19.790.451391.90.726
SCA0.259.450.442411.00.739
SCA0.59.400.440412.60.723
MedicalNo-DEFENSE22.040.396196.10.998
MNISTGAUSSIAN-NOISE21.830.382209.40.862
GAN21.770.427219.00.998
Gong et al. [22]++21.500.359273.10.894
Titcombe et al. [64]21.680.360286.30.899
Gong et al. [22]21.750.477249.10.770
Peng et al. [53]21.820.381268.30.927
Hayes et al. [25]21.720.337259.70.823
Wang et al. [66]21.710.322211.70.937
SPARSE-STANDARD20.970.086239.30.907
SCA0.121.190.057253.50.888
SCA0.2521.170.075280.10.882
SCA0.520.060.055288.80.881
", + "bbox": [ + 215, + 172, + 785, + 554 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "reconstructions under the least sparse version SCA0.1 are degraded by factors of 1.01 to 6.7 and 1.01 to 5.6 compared to the regularization defenses of Peng et al. [53] and Wang et al. [66], respectively. Increasing SCA's sparsity $\\lambda$ to 0.5 widens the performance gap, increasing these factors to 1.1 to 6.9 and 1.02 to 5.9, respectively, and making SCA outperform baselines' FID. SCA0.1 also outperforms the noise-based approaches of Hayes et al. [25] and Titcombe et al. [64] on all metric by factors of 1.01 to 5.9 and 1.02 to 6.3. Increasing SCA's sparsity $\\lambda$ to 0.5 increases these factors to 1.1 to 6.1 and 1.1 to 6.5. Finally, SCA0.1 outperforms the data augmentation defense of [22] by factors of 1.01 to 8.4, which widens to 1.1 to 8.7 for SCA0.5. All baselines also outperform common GAN and Noise-based industry defenses.", + "bbox": [ + 212, + 561, + 787, + 729 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Basic SPARSE-STANDARD outperforms SOTA baselines. Our basic SPARSE-STANDARD baseline outperforms the best baselines' PSNR on both CelebA and Medical MNIST, and also outperforms baselines' SSIM on the latter. SCA0.5 then outperforms SPARSE-STANDARD on all metrics, obtaining SSIM and FID that are better by factors of 1.2 to 1.6 and 1.1 to 1.2, respectively, and slightly better PSNR. Thus, while SPARSE-STANDARD offers an inferior defense vs. SCA, it still offers a fast practical defense for less privacy-critical domains.", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/f41bb87f1fc271c026759beeabb2087269fa4650f645a79d5a5360172bddcfe4.jpg", + "image_caption": [ + "Fig. 4: Experiments set 2: Qualitative comparisons among actual & reconstructed images (end-to-end setting) under SCA & baselines on the Medical MNIST dataset." + ], + "image_footnote": [], + "bbox": [ + 243, + 145, + 759, + 271 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/394b18d9e55abe3d6b4374c94fd646a86b86c02900d79884abae3bd9736d9fec.jpg", + "table_caption": [ + "Table 2: Experiments set 2: Performance comparison in end-to-end setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images." + ], + "table_footnote": [], + "table_body": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.260.262201.80.773
GAUSSIAN-NOISE16.080.262220.40.638
GAN13.550.133199.60.668
Titcombe et al. [64]15.130.191197.70.695
Gong et al. [22]++13.100.032204.80.704
Gong et al. [22]13.150.119199.60.682
Peng et al. [53]13.780.141218.80.716
Hayes et al. [25]14.100.004199.00.664
Wang et al. [66]13.630.0011203.20.744
SPARSE-STANDARD13.090.002222.10.749
SCA0.112.890.004228.50.748
SCA0.2512.730.004218.80.737
SCA0.512.420.001231.90.741
MedicalNo-DEFENSE31.480.93510.660.998
MNISTGAUSSIAN-NOISE30.460.92012.230.862
GAN27.340.48033.770.998
Gong et al. [22]++18.370.35381.520.894
Titcombe et al. [64]21.330.43130.600.899
Gong et al. [22]21.520.43664.880.770
Peng et al. [53]19.050.420107.90.908
Hayes et al. [25]18.480.007150.90.824
Wang et al. [66]20.480.54930.010.946
SPARSE-STANDARD14.790.119250.60.907
SCA0.113.430.004352.10.888
SCA0.2512.320.004375.90.882
SCA0.512.040.003369.90.881
", + "bbox": [ + 215, + 371, + 785, + 752 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Results of experiments set 2: End-to-end networks.", + "text_level": 1, + "bbox": [ + 215, + 779, + 638, + 792 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Qualitative evaluations. Fig. 4, shows Medical MNIST reconstructions in the end-to-end threat model. SCA's reconstructions are visually destroyed (esp. SCA0.5), whereas baselines admit noisy-but-recognizable reconstructions.", + "bbox": [ + 212, + 794, + 784, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Metric evaluations. Table 2 reports performance in the end-to-end network setting. In this setting, SCA's performance advantage widens. In terms of PSNR & FID, training data reconstructions under SCA0.1 are degraded by factors of 1.1 to 3.3 and 1.1 to 11.7 compared to Peng et al. [53] and Wang et al. [66], respectively (but slightly worse SSIM vs. Wang et al. on CelebA). On all metrics, SCA0.1 outperforms Hayes et al. [25] and Titcombe et al. [64] by factors of 1.1 to 2.4 and 1.1 to 107.7, respectively. SCA0.1 also outperforms Gong et al. [22] by factors of 1.01 to 109. Increasing SCA's $\\lambda$ to 0.5 causes it to outperform the same baselines on all metrics by factors of 1.2 to 141 [53], 1.2 to 183 [66], 1.2 to 4.0 [25], 1.2 to 191 [64], and 1.1 to 145.3 [22], respectively.", + "bbox": [ + 212, + 146, + 787, + 297 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Stability of SCA's defense vs. baselines. SCA's performance is also as stable or more stable than baselines' performance over multiple runs. For example, Fig. 5a plots the means & std. devs. of SCA & baselines' per-run FID (the standard metric for faces) over multiple runs for CelebA faces in the Plug-&Play setting, and Fig. 5b plots this for PSNR (the standard metric for grayscale images) on Medical MNIST in the end-to-end setting. SCA obtains better performance while also exhibiting stability of defense performance on par with the best baseline (and better stability than most baselines). See Appendix E.", + "bbox": [ + 212, + 320, + 787, + 443 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/73baedd6e5fade9e25c13bea6a92653847b1aff9700ec4078cff83d0bbdc6cbb.jpg", + "image_caption": [ + "(a) FID↑↑ for CelebA faces under Plug- &-Play" + ], + "image_footnote": [], + "bbox": [ + 232, + 470, + 485, + 578 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/95de7c01f440dadfef6ff2f9c540a44c1567ae447a145a95cd2e5539bfb34b3c.jpg", + "image_caption": [ + "(b) PSNR $\\downarrow \\downarrow$ for Med.MNIST, end-to-end setting", + "Fig. 5: Stability of SCA & baselines' defense performance (mean ± std. dev.) of PSNR and FID across multiple runs on CelebA and Medical MNIST." + ], + "image_footnote": [], + "bbox": [ + 513, + 470, + 769, + 578 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "SCA's sparsity vs. performance. We also try varying SCA's and SPARSE-STANDARD's sparsity parameters $\\lambda$ and recompute PSNR, SSIM, FID, and accuracy. Appendix A.6 shows that for each $\\lambda$ and defense metric, SCA significantly outperforms the off-the-shelf SPARSE-STANDARD architecture for a small accuracy cost. Thus, for a given $\\lambda$ with SPARSE-STANDARD, we can use a (smaller) $\\lambda$ with SCA to obtain better reconstruction and higher or equal (within 0.0017) accuracy. SCA is also amenable to more sophisticated tuning (and performance improvements) by tuning different $\\lambda$ per sparse layer (e.g., by having a sparser representation of inputs but less sparse reductions of downstream layers). We avoid such tuning here as it is unnecessary for good performance.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/07ac9110a05d15803067eef430bcf9088c6378d84a2883db1766c442e5ad20dc.jpg", + "table_caption": [ + "Table 3: Experiments set 3: Performance comparison in split network setting (lower rows=better defense) on hi-res CelebA faces and sensitive Medical MNIST images." + ], + "table_footnote": [], + "table_body": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.490.302185.80.766
GAUSSIAN-NOISE15.440.227191.10.753
GAN15.570.253176.70.646
Titcombe et al. [64]14.990.144194.20.725
Gong et al. [22]++15.060.038190.50.756
Gong et al. [22]15.650.044185.80.653
Peng et al. [53]16.230.211198.60.717
Hayes et al. [25]15.060.005178.80.672
Wang et al. [66]14.820.173189.60.652
SPARSE-STANDARD15.390.009187.00.746
SCA0.115.050.005178.70.745
SCA0.2514.760.003191.10.743
SCA0.514.710.003206.10.739
MedicalNo-DEFENSE23.470.77645.570.993
MNISTGAUSSIAN-NOISE21.930.72244.720.811
GAN21.670.71948.490.912
Gong et al. [22]++21.070.57367.530.931
Titcombe et al. [64]21.350.70448.820.961
Gong et al. [22]21.330.72041.740.925
Peng et al. [53]18.980.426124.80.914
Hayes et al. [25]21.460.442137.40.850
Wang et al. [66]20.030.53865.170.986
SPARSE-STANDARD15.330.149142.40.955
SCA0.113.950.008244.90.946
SCA0.2512.310.008255.30.928
SCA0.512.270.001285.30.909
", + "bbox": [ + 215, + 183, + 785, + 566 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Results of experiments set 3: Split networks. Table 3 reports performance in the split network setting. As expected, all baselines and SCA perform slightly worse in this threat model compared to the end-to-end model (aside from Guussian and GAN heuristics). On all metrics, SCA's performance advantage remains consistent: SCA0.5 outperforms all baselines by factors of 1.1 to 720.", + "bbox": [ + 212, + 592, + 787, + 669 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Empirical analysis of sparse coding robustness to attack", + "text_level": 1, + "bbox": [ + 215, + 688, + 785, + 707 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Sparse-coding layers' robustness to privacy attacks can be observed empirically. Consider that the attacker trains the attack to map leaked raw hidden layer outputs back to input images. Attacks are thus highly dependent on these outputs' distributions. Recall that UMAP projections compute a 2D visualization of the global structure of distances between different training images' features according to a particular layer [43]. Fig. 6 plots UMAP 2D projections of linear layer feature distributions of training inputs after either two linear layers (Figs. 6a & 6d), two convolutional layers (Figs. 6b & 6e), or two sparse coding layers (with", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/36de78561fc165c552b31f3ad0d1db2770c5f9606ab12f031ab0cdc2559a5385.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 241, + 145, + 385, + 231 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/432952cf9845c99024cda318deb34d95a20a8385a78f824c05ec59ac85c16fa8.jpg", + "image_caption": [ + "(a) Linear Layer", + "(d) Linear Layer", + "Fig. 6: UMap 2D projections of input images' features by class after 2 linear layers, 2 conv. layers, or 2 sparse-coded layers on MNIST (top) & Fashion MNIST (bottom)." + ], + "image_footnote": [], + "bbox": [ + 243, + 247, + 383, + 334 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/e1c2839ff13b4464bcd48ad24ad15df4d1d73227e8174f5283158820fbd72dbf.jpg", + "image_caption": [ + "(b) Convolution Layer" + ], + "image_footnote": [], + "bbox": [ + 428, + 143, + 571, + 232 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/ff994be2ab1f47a42bb3fb9a1523ae9f5cd98c26eb9a1a348d343d15ba6ce876.jpg", + "image_caption": [ + "(e) Convolution Layer" + ], + "image_footnote": [], + "bbox": [ + 429, + 247, + 570, + 334 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/f9e02e5cdbd86db0688faa3bac4351a8a6a61aba1102fe7c5170c91d318a3b3b.jpg", + "image_caption": [ + "(c) Sparse Coding Layer" + ], + "image_footnote": [], + "bbox": [ + 620, + 143, + 763, + 232 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/19f77c591b9aea094788fb133db4f5060e6be1c9729cfb891f1aabab79875f25.jpg", + "image_caption": [ + "(f) Sparse Coding Layer" + ], + "image_footnote": [], + "bbox": [ + 620, + 250, + 759, + 334 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "interspersed dense layers - Figs. 6c & 6f). Importantly, observe that after two linear or two convolutional layers, points are clustered by color, i.e., input images' features are highly clustered by label. This class-clustered property leaves such layers vulnerable to model inversion attacks, as an attacker can 'home in on' examples from a specific class. In contrast, the goal in sparse coding is not to optimize the classification objective by separating classes, but rather to jettison unnecessary information. Here, this means that unnecessary information is jettisoned both from the input image and also the downstream dense layer. Per Figs. 6c & 6f, this tends to 'uncluster' remaining non-sparsified features of training examples from the same class, making it much harder for an attacker to compute informative gradients to home in on a training example.", + "bbox": [ + 212, + 422, + 787, + 589 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Discussion & Conclusion", + "text_level": 1, + "bbox": [ + 215, + 619, + 491, + 635 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we have provided the first study of sparse coding-based neural network architectures that are robust to model inversion attacks. Specifically, we have shown that the natural properties of sparse coded layers can control the extraneous private information about the training data that is encoded in a network without resorting to complex and computationally intensive parameter tuning techniques. Our work reveals a deep connection between state-of-the-art privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. Currently, our basic research implementation of SCA achieves compute times that in the worst-case are no better than some SOTA baselines (see Appendix F). However, given the rich theoretic body of work on fast algorithms and provable guarantees for sparse coding, we believe these aspects are opportune areas for future improvements.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We are grateful for generous support from OpenAI, as well as the Dartmouth College Cybersecurity Cluster Research. This work was partially funded by the Center for Nonlinear Studies and the Information Science and Technology Institute's Cyber Security Summer School at Los Alamos National Laboratory, as well as an award from the Department of Energy's Advanced Scientific Computing Research program (#77902).", + "bbox": [ + 212, + 180, + 787, + 272 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 297, + 321, + 313 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security. pp. 308-318 (2016) 4", + "2. Abuadbba, S., Kim, K., Kim, M., Thapa, C., Camtepe, S.A., Gao, Y., Kim, H., Nepal, S.: Can we use split learning on 1d cnn models for privacy preserving training? In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security. pp. 305-318 (2020) 2", + "3. Ahmad, S., Scheinkman, L.: How can we be so dense? the benefits of using highly sparse representations. arXiv preprint arXiv:1903.11257 (2019) 2", + "4. Aïvodji, U., Gambs, S., Ther, T.: Gamin: An adversarial approach to black-box model inversion. arXiv preprint arXiv:1909.11835 (2019) 2", + "5. An, S., Tao, G., Xu, Q., Liu, Y., Shen, G., Yao, Y., Xu, J., Zhang, X.: Mirror: Model inversion for deep learning network with high fidelity. In: Proceedings of the 29th Network and Distributed System Security Symposium (2022) 2", + "6. Barlow, H.B.: The coding of sensory messages. Current problems in animal behavior (1961) 2", + "7. Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Konečny, J., Mazzocchi, S., McMahan, B., et al.: Towards federated learning at scale: System design. Proceedings of machine learning and systems 1, 374-388 (2019) 4", + "8. Breuer, A., Balkanski, E., Singer, Y.: The fast algorithm for submodular maximization. In: International Conference on Machine Learning. pp. 1134-1143. PMLR (2020) 3, 6", + "9. Candès, E.J., Donoho, D.L.: New tight frames of curvelets and optimal representations of objects with piecewise c2 singularities. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences 57(2), 219-266 (2004) 2, 3", + "0. Carlini, N., Jagielski, M., Zhang, C., Papernot, N., Terzis, A., Tramer, F.: The privacy onion effect: Memorization is relative. Advances in Neural Information Processing Systems 35, 13263-13276 (2022) 2", + "11. Carlini, N., Hayes, J., Nasr, M., Jagielski, M., Sehwag, V., Tramer, F., Balle, B., Ippolito, D., Wallace, E.: Extracting training data from diffusion models. In: 32nd USENIX Security Symposium (USENIX Security 23). pp. 5253-5270 (2023) 1", + "12. Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM review 43(1), 129-159 (2001) 2" + ], + "bbox": [ + 218, + 332, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "13. Chen, Y., Dey, T., Kuhnle, A.: Best of both worlds: Practical and theoretically optimal submodular maximization in parallel. Advances in Neural Information Processing Systems 34, 25528-25539 (2021) 3, 6", + "14. Davis, G., Mallat, S., Avellaneda, M.: Adaptive greedy approximations. Constructive approximation 13, 57-98 (1997) 3", + "15. Dibbo, S.V.: Sok: Model inversion attack landscape: Taxonomy, challenges, and future roadmap. In: IEEE 36th Computer Security Foundations Symposium. pp. 408-425. IEEE Computer Society (2023) 1", + "16. Dibbo, S.V., Chung, D.L., Mehnaz, S.: Model inversion attack with least information and an in-depth analysis of its disparate vulnerability. In: 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML). pp. 119-135. IEEE (2023) 1", + "17. Dibbo, S.V., Moore, J.S., Kenyon, G.T., Teti, M.A.: Lcanets++: Robust audio classification using multi-layer neural networks with lateral competition. arXiv preprint arXiv:2308.12882 (2023) 2", + "18. Fang, H., Chen, B., Wang, X., Wang, Z., Xia, S.T.: Gidf: A generative gradient inversion method with feature domain optimization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4967-4976 (2023) 2, 4", + "19. Field, D.J.: What is the goal of sensory coding? Neural computation 6(4), 559-601 (1994) 2, 3", + "20. Fredrikson, M., Jha, S., Ristenpart, T.: Model inversion attacks that exploit confidence information and basic countermeasures. In: Proceedings of the 22nd ACM SIGSAC conference on computer and communications security. pp. 1322-1333 (2015) 1, 2, 8", + "21. Gong, N.Z., Liu, B.: You are who you know and how you behave: Attribute inference attacks via users' social friends and behaviors. In: 25th USENIX Security Symposium (USENIX Security 16). pp. 979-995 (2016) 1", + "22. Gong, X., Wang, Z., Li, S., Chen, Y., Wang, Q.: A gan-based defense framework against model inversion attacks. IEEE Transactions on Information Forensics and Security (2023) 2, 6, 7, 8, 10, 11, 12, 13", + "23. Haim, N., Vardi, G., Yehudai, G., Shamir, O., Irani, M.: Reconstructing training data from trained neural networks. Advances in Neural Information Processing Systems 35, 22911-22924 (2022) 2", + "24. Hannan, D., Nesbit, S.C., Wen, X., Smith, G., Zhang, Q., Goffi, A., Chan, V., Morris, M.J., Hunninghake, J.C., Villalobos, N.E., et al.: Mobileptx: sparse coding for pneumothorax detection given limited training examples. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 15675-15681 (2023) 2", + "25. Hayes, J., Mahloujifar, S., Balle, B.: Bounding training data reconstruction in dpsgd. arXiv preprint arXiv:2302.07225 (2023) 2, 4, 7, 10, 11, 12, 13", + "26. He, Z., Zhang, T., Lee, R.B.: Model inversion attacks against collaborative inference. In: Proceedings of the 35th Annual Computer Security Applications Conference. pp. 148-162 (2019) 2, 4, 7", + "27. Heredia, L.G., Negrevergne, B., Chevaleyre, Y.: Adversarial attacks for mixtures of classifiers. arXiv preprint arXiv:2307.10788 (2023) 8", + "28. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 8", + "29. Hidano, S., Murakami, T., Katsumata, S., Kiyomoto, S., Hanaoka, G.: Model inversion attacks for prediction systems: Without knowledge of non-sensitive attributes." + ], + "bbox": [ + 217, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "In: 2017 15th Annual Conference on Privacy, Security and Trust (PST). pp. 115-11509. IEEE (2017) 8", + "30. Hitaj, B., Ateniese, G., Perez-Cruz, F.: Deep models under the gan: information leakage from collaborative deep learning. In: Proceedings of the 2017 ACM SIGSAC conference on computer and communications security. pp. 603-618 (2017) 2", + "31. Hu, H., Salcic, Z., Sun, L., Dobbie, G., Yu, P.S., Zhang, X.: Membership inference attacks on machine learning: A survey. ACM Computing Surveys (CSUR) 54(11s), 1-37 (2022) 1", + "32. Jiang, Z., Zhang, G., Davis, L.S.: Submodular dictionary learning for sparse coding. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition. pp. 3418-3425. IEEE (2012) 3, 6", + "33. Kahla, M., Chen, S., Just, H.A., Jia, R.: Label-only model inversion attacks via boundary repulsion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15045-15053 (2022) 2", + "34. Kaissis, G.A., Makowski, M.R., Rückert, D., Braren, R.F.: Secure, privacy-preserving and federated machine learning in medical imaging. Nature Machine Intelligence 2(6), 305-311 (2020) 4", + "35. Kariyappa, S., Prakash, A., Qureshi, M.K.: Maze: Data-free model stealing attack using zeroth-order gradient estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13814-13823 (2021) 1", + "36. Kavukcuoglu, K., Ranzato, M., LeCun, Y.: Fast inference in sparse coding algorithms with applications to object recognition. arXiv preprint arXiv:1010.3467 (2010) 2, 3", + "37. Kim, E., Rego, J., Watkins, Y., Kenyon, G.T.: Modeling biological immunity to adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4666-4675 (2020) 2, 5", + "38. Konečny, J., McMahan, H.B., Yu, F.X., Richtárik, P., Suresh, A.T., Bacon, D.: Federated learning: Strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492 (2016) 4", + "39. Krause, A., Cevher, V.: Submodular dictionary selection for sparse representation. In: International Conference on Machine Learning (ICML) (2010) 2, 3", + "40. Lee, H., Battle, A., Raina, R., Ng, A.: Efficient sparse coding algorithms. Advances in neural information processing systems 19 (2006) 3", + "41. Li, L., Xie, T., Li, B.: Sok: Certified robustness for deep neural networks. In: 2023 IEEE Symposium on Security and Privacy (SP). pp. 1289-1310. IEEE (2023) 1", + "42. Liu, G., Wang, C., Peng, K., Huang, H., Li, Y., Cheng, W.: Socinf: Membership inference attacks on social media health data with machine learning. IEEE Transactions on Computational Social Systems 6(5), 907-921 (2019) 8", + "43. McInnes, L., Healy, J., Melville, J.: Umap: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 13", + "44. McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. pp. 1273-1282. PMLR (2017) 4", + "45. Mehnaz, S., Dibbo, S.V., Kabir, E., Li, N., Bertino, E.: Are your sensitive attributes private? novel model inversion attribute inference attacks on classification models. In: 31st USENIX Security Symposium (USENIX Security 22). pp. 4579-4596. USENIX Association, Boston, MA (Aug 2022) 1, 2", + "46. Melis, L., Song, C., De Cristofaro, E., Shmatikov, V.: Exploiting unintended feature leakage in collaborative learning. In: 2019 IEEE symposium on security and privacy (SP). pp. 691-706. IEEE (2019) 2" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "47. Mireshghallah, F., Taram, M., Ramrakhyani, P., Jalali, A., Tullsen, D., Esmaeilzadeh, H.: Shredder: Learning noise distributions to protect inference privacy. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. pp. 3-18 (2020) 2", + "48. Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrak, J., Krause, A.: Lazier than lazy greedy. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 29 (2015) 3", + "49. Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM journal on computing 24(2), 227-234 (1995) 3", + "50. Olshausen, B.A., Field, D.J.: Sparse coding of sensory inputs. Current opinion in neurobiology 14(4), 481-487 (2004) 2, 3", + "51. Olshausen, B.A., Field, D.J., et al.: Sparse coding of natural images produces localized, oriented, bandpass receptive fields. Submitted to Nature. Available electronically as ftp://redwood.psych.cornell.edu/pub/papers/sparse-coding.ps (1995) 2", + "52. Paiton, D.M., Frye, C.G., Lundquist, S.Y., Bowen, J.D., Zarcone, R., Olshausen, B.A.: Selectivity and robustness of sparse coding networks. Journal of vision 20(12), 10-10 (2020) 2", + "53. Peng, X., Liu, F., Zhang, J., Lan, L., Ye, J., Liu, T., Han, B.: Bilateral dependency optimization: Defending against model-inversion attacks. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 1358-1367 (2022) 2, 6, 7, 10, 11, 12, 13", + "54. Rigaki, M., Garcia, S.: A survey of privacy attacks in machine learning. ACM Computing Surveys (2020) 2", + "55. Rozell, C.J., Johnson, D.H., Baraniuk, R.G., Olshausen, B.A.: Sparse coding via thresholding and local competition in neural circuits. Neural computation 20(10), 2526-2563 (2008) 2, 3, 5", + "56. Salem, A., Bhattacharya, A., Backes, M., Fritz, M., Zhang, Y.: {Updates-Leak}: Data set inference and reconstruction attacks in online learning. In: 29th USENIX security symposium (USENIX Security 20). pp. 1291-1308 (2020) 2", + "57. Sannai, A.: Reconstruction of training samples from loss functions. arXiv preprint arXiv:1805.07337 (2018) 8", + "58. Sanyal, S., Addepalli, S., Babu, R.V.: Towards data-free model stealing in a hard label setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15284-15293 (2022) 1", + "59. Schneiderman, H.: Feature-centric evaluation for efficient cascaded object detection. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. vol. 2, pp. II-II. IEEE (2004) 2", + "60. Song, L., Mittal, P.: Systematic evaluation of privacy risks of machine learning models. In: 30th USENIX Security Symposium (USENIX Security 21). pp. 2615-2632 (2021) 4", + "61. Struppek, L., Hintersdorf, D., Correira, A.D.A., Adler, A., Kersting, K.: Plug & play attacks: Towards robust and flexible model inversion attacks. In: International Conference on Machine Learning. pp. 20522-20545. PMLR (2022) 1, 2, 4, 7, 9, 10", + "62. Sun, B., Tsai, N.h., Liu, F., Yu, R., Su, H.: Adversarial defense by stratified convolutional sparse coding. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11447-11456 (2019) 2", + "63. Teti, M., Kenyon, G., Migliori, B., Moore, J.: Lcanets: Lateral competition improves robustness against corruption and attack. In: International Conference on Machine Learning. pp. 21232-21252. PMLR (2022) 2, 5, 6, 7" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "S. Dibbo et al.", + "bbox": [ + 271, + 114, + 370, + 127 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "64. Titcombe, T., Hall, A.J., Papadopoulos, P., Romanini, D.: Practical defences against model inversion attacks for split neural networks. arXiv preprint arXiv:2104.05743 (2021) 2, 4, 7, 8, 10, 11, 12, 13", + "65. Vepakomma, P., Gupta, O., Swedish, T., Raskar, R.: Split learning for health: Distributed deep learning without sharing raw patient data. arXiv preprint arXiv:1812.00564 (2018) 4", + "66. Wang, T., Zhang, Y., Jia, R.: Improving robustness to model inversion attacks via mutual information regularization. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 11666-11673 (2021) 2, 7, 10, 11, 12, 13", + "67. Wang, X., Wang, W.H.: Group property inference attacks against graph neural networks. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. pp. 2871-2884 (2022) 4", + "68. Wang, Y., Qian, H., Miao, C.: Dualcf: Efficient model extraction attack from counterfactual explanations. In: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency. pp. 1318-1329 (2022) 1", + "69. Wang, Z., Song, M., Zhang, Z., Song, Y., Wang, Q., Qi, H.: Beyond inferring class representatives: User-level privacy leakage from federated learning. In: IEEE INFOCOM 2019-IEEE conference on computer communications. pp. 2512-2520. IEEE (2019) 2", + "70. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 8", + "71. Wei, W., Liu, L., Loper, M., Chow, K.H., Gursoy, M.E., Truex, S., Wu, Y.: A framework for evaluating gradient leakage attacks in federated learning. arXiv preprint arXiv:2004.10397 (2020) 2", + "72. Wu, P., Liu, J., Li, M., Sun, Y., Shen, F.: Fast sparse coding networks for anomaly detection in videos. Pattern Recognition 107, 107515 (2020) 6", + "73. Wu, Y., Yu, N., Li, Z., Backes, M., Zhang, Y.: Membership inference attacks against text-to-image generation models. arXiv preprint arXiv:2210.00968 (2022) 8", + "74. Yang, Z., Zhang, J., Chang, E.C., Liang, Z.: Neural network inversion in adversarial setting via background knowledge alignment. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. pp. 225-240 (2019) 2", + "75. Yuan, X., Ding, L., Zhang, L., Li, X., Wu, D.O.: Es attack: Model stealing against deep neural networks without data hurdles. IEEE Transactions on Emerging Topics in Computational Intelligence 6(5), 1258-1270 (2022) 1", + "76. Zhang, J., Peng, S., Gao, Y., Zhang, Z., Hong, Q.: Apmsa: adversarial perturbation against model stealing attacks. IEEE Transactions on Information Forensics and Security 18, 1667-1679 (2023) 1", + "77. Zhang, Y., Jia, R., Pei, H., Wang, W., Li, B., Song, D.: The secret revealer: Generative model-inversion attacks against deep neural networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 253-261 (2020) 2", + "78. Zhong, D., Sun, H., Xu, J., Gong, N., Wang, W.H.: Understanding disparate effects of membership inference attacks and their countermeasures. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security. pp. 959-974 (2022) 1" + ], + "bbox": [ + 212, + 146, + 787, + 799 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Improving Robustness to MI Attacks via Sparse Coding Architectures", + "bbox": [ + 264, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_model.json b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_model.json new file mode 100644 index 0000000000000000000000000000000000000000..56984383270d2aa389141da6adb04bbd526fbd2e --- /dev/null +++ b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_model.json @@ -0,0 +1,2724 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.263, + 0.141, + 0.744, + 0.187 + ], + "angle": 0, + "content": "Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.212, + 0.789, + 0.229 + ], + "angle": 0, + "content": "Sayanton V. Dibbo\\(^{1,2}\\), Adam Breuer\\(^{1}\\), Justin Moore\\(^{2}\\), and Michael Teti\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.339, + 0.239, + 0.663, + 0.254 + ], + "angle": 0, + "content": "\\(^{1}\\) Dartmouth College, Hanover, NH 03755, USA" + }, + { + "type": "text", + "bbox": [ + 0.282, + 0.254, + 0.721, + 0.269 + ], + "angle": 0, + "content": "\\(^{2}\\) Los Alamos National Laboratory, Los Alamos, NM 87545, USA" + }, + { + "type": "text", + "bbox": [ + 0.365, + 0.269, + 0.639, + 0.282 + ], + "angle": 0, + "content": "{f0048vh,adam.breuer}@dartmouth.edu" + }, + { + "type": "text", + "bbox": [ + 0.405, + 0.283, + 0.6, + 0.297 + ], + "angle": 0, + "content": "{jmoore01,mteti}@lanl.gov" + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.327, + 0.744, + 0.632 + ], + "angle": 0, + "content": "Abstract. Recent model inversion attack algorithms permit adversaries to reconstruct a neural network's private and potentially sensitive training data by repeatedly querying the network. In this work, we develop a novel network architecture that leverages sparse-coding layers to obtain superior robustness to this class of attacks. Three decades of computer science research has studied sparse coding in the context of image denoising, object recognition, and adversarial misclassification settings, but to the best of our knowledge, its connection to state-of-the-art privacy vulnerabilities remains unstudied. In this work, we hypothesize that sparse coding architectures suggest an advantageous means to defend against model inversion attacks because they allow us to control the amount of irrelevant private information encoded by a network in a manner that is known to have little effect on classification accuracy. Specifically, compared to networks trained with a variety of state-of-the-art defenses, our sparse-coding architectures maintain comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions by factors of 1.1 to 18.3 across a variety of reconstruction quality metrics (PSNR, SSIM, FID). This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug- \\(\\mathcal{E}\\) -Play attacks. We provide a cluster-ready PyTorch codebase to promote research and standardize defense evaluations." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.654, + 0.786, + 0.67 + ], + "angle": 0, + "content": "Keywords: Model Inversion Attack, Defense, Privacy Attacks, Sparse Coding." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.69, + 0.377, + 0.707 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.81 + ], + "angle": 0, + "content": "The popularization of machine learning has been accompanied by the widespread use of neural networks that were trained on private, sensitive, and proprietary datasets. This has given rise to a new generation of privacy attacks that seek to infer private information about the training dataset simply by inspecting the representation of the training data that remains encoded in the model's parameters [11, 15, 16, 20, 21, 31, 35, 41, 45, 58, 61, 68, 75, 76, 78]." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.811, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Of particular concern is a devastating stream of privacy attacks known as model inversion. Model inversion attacks leverage the network's parameters or" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.268 + ], + "angle": 0, + "content": "classifications in order to reconstruct entire images or data that were used to train the network. Early work on model inversion focused on a white-box setting where the attacker has unfettered access to the model or auxiliary information about the training data [20,30,69,71,77]. However, recent work has shown that standard network architectures are vulnerable to model inversion attacks even when attackers have no knowledge of the model's architecture or parameters, and only have access to the model's classifications or its intermediate outputs, such as leaked outputs from a single hidden network layer [5,22,45,46,56,74]." + }, + { + "type": "text", + "bbox": [ + 0.25, + 0.269, + 0.751, + 0.283 + ], + "angle": 0, + "content": "Are different network architectures robust to model inversion attacks?" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.288, + 0.789, + 0.485 + ], + "angle": 0, + "content": "Such attacks are feasible because each hidden layer of a standard network architecture captures a detailed representation of the training data. It is well-known that standard dense layers exhibit a tendency to memorize their inputs [10, 23, 54], so even a minimal leak of a network's class distribution output or a leak of its intermediate outputs from a single layer is often sufficient to train an inverse mapping for data reconstruction. More concretely, state-of-the-art inversion attacks work by submitting externally obtained images to the model, observing leaked outputs, then using this data to train a new 'inverted' neural network that reconstructs (predicts) an input image given a leaked output. This can be accomplished either directly via SGD, or by optimizing a GAN, and we consider both approaches here. Such attacks on standard network architectures can reconstruct private training images that are clearly recognizable by humans familiar with the training data [4, 18, 22, 26, 30, 33, 61, 71, 74]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.489, + 0.789, + 0.732 + ], + "angle": 0, + "content": "Recent work has pursued a diverse array of defense strategies to mitigate these attacks. For example, [22] augments the training dataset with GAN-generated fake samples designed to inject spurious features into the trained network that mislead the gradients computed during inversion attacks. In contrast, multiple recent defenses add regularization terms during training that attempt to penalize training data memorization [53, 66]. Other recent defenses noise the network weights to obfuscate memorized data [2,47,64], or noise and clip training gradients via DP-SGD [25]. All such approaches are costly: data augmentation-based defenses entail the computational burden of building a GAN and applying sophisticated parameter tuning techniques during training; regularization-based defenses explicitly trade away classification accuracy for less memorization, and noise-based defenses are also known to impose significant accuracy costs. Until very recently, there were no known provable guarantees for model inversion defenses, and the current best-known guarantees require a DP-SGD-based training algorithm that imposes a significant computational burden and accuracy loss to obtain privacy guarantees that are impractically weak for these attacks [25]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Very little is known about how a network's architecture contributes to its robustness (or vulnerability). This is surprising since throughout three decades of research in other domains such as image denoising [3, 6, 9, 12, 19, 39, 50, 55], object recognition [24, 36, 51, 59], and adversarial misclassification [17, 37, 52, 62, 63], researchers seeking to control their model's representations of the data have heavily studied sparse coding-based architectures that prune unnecessary details and preserve only the information that is essential to the model objective." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.265, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.269 + ], + "angle": 0, + "content": "Specifically, sparse coding seeks to approximately represent an image (or layer) with only a small set of basis vectors selected from an overcomplete dictionary [9, 19, 50]. While it is well-known that computing a sparse representation using a standard objective function is NP-hard in general [14, 32, 49], we now benefit from fast approximation algorithms that efficiently compute high-quality sparse representations [8, 13, 32, 36, 39, 40, 48, 55]. Sparse coding architectures leverage this technique by inserting a sparse network layer after a dense layer, such that the sparse layer reduces the dense layer's outputs to a sparse representation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.279, + 0.79, + 0.431 + ], + "angle": 0, + "content": "To our knowledge, sparse coding architectures have not been studied in the context of model inversion or privacy attacks. However, they suggest an advantageous means to prevent such attacks because they control the amount of irrelevant private information encoded in a model's intermediate representations in a manner that is known to have little effect on its accuracy, that can be computed efficiently during training, and that adds little to the trained model's overall parameter complexity. Put simply, sparsifying a network's representations is a natural means to preclude memorization of detailed information about its inputs that is unnecessary to obtain high accuracy, so even an idealized 'perfect attacker' could only hope to recover a sparsified, un-detailed training image." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.79, + 0.534 + ], + "angle": 0, + "content": "Main contribution. We begin by showing that an off-the-shelf sparse coding preprocessing step offers performance advantages compared to state-of-the-art data augmentation, regularization, and noise based defenses in terms of robustness to model inversion attacks. We then refine this idea into a network architecture that achieves superior performance. Our main result is a novel sparse-coding architecture, SCA, that is robust to state-of-the-art model inversion attacks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.542, + 0.79, + 0.771 + ], + "angle": 0, + "content": "SCA is defined by pairs of alternating sparse coded and dense layers that jettison unnecessary private information in the input image and ensure that downstream layers do not e.g., reconstruct this information. We show that SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than 8 state-of-the-art data augmentation, regularization, and noise-based defenses in terms of PSNR and FID metrics and 1.1 to 720 times more in terms of SSIM. This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug-ε Play attacks. SCA's defense performance is also more stable than baselines across multiple runs. We emphasize that, unlike recent state-of-the-art defenses that require sophisticated parameter tuning to perform well, SCA obtains these results absent parameter tuning (i.e., using default sparsity parameters) because sparse coding naturally precludes networks from memorizing detailed representations of the training data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "More broadly, our results show a deep connection between state-of-the-art ML privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. We provide a comprehensive cluster-ready PyTorch codebase to promote research and standardize defense evaluation." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.396, + 0.161 + ], + "angle": 0, + "content": "2 Threat models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.173, + 0.786, + 0.232 + ], + "angle": 0, + "content": "We consider three threat models that span the diverse range of powerful and well-informed attackers considered in recent work. We emphasize that a defense that performs well in all three settings provides strong evidence of its privacy protections under weaker, more realistic threat models with real-world attackers." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.233, + 0.787, + 0.295 + ], + "angle": 0, + "content": "1. Plug- & Play threat model [61]. Plug- & Play attacks are considered the most performant recent attacks. These attacks optimize the intermediate representation of StyleGAN's input vectors so that generated images maximize the target network's class prediction probability, which the attacker can query." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.297, + 0.787, + 0.372 + ], + "angle": 0, + "content": "Separately, recent theoretical work on model inversion emphasizes that a strong threat model should capture 'worst-case' attackers with direct access to the information-rich, high-dimensional intermediate outputs of the target model that store private information about the training data, as well as ideal training data examples for training an inverted model [1, 25]. We consider two variants:" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.372, + 0.787, + 0.418 + ], + "angle": 0, + "content": "2. End-to-end threat model. We consider an attacker with access to all of the last hidden layer's raw, high-dimensional outputs, as well as a large number of ideal training data examples drawn from the true training dataset [60, 67]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.418, + 0.787, + 0.645 + ], + "angle": 0, + "content": "3. Split network threat model (Federated Learning). We also consider the split network threat model described by [64]. There has been much recent interest in Federated Learning architectures that split the network across multiple agents [7, 18, 26, 38, 44], particularly for privacy-fraught domains such as medicine where legal requirements limit data sharing [34, 65]. These architectures are known to be susceptible to model inversion attacks, [18, 26, 64], and defenses are urgently needed. This threat model also allows us to capture a different view of a 'worst-case' threat model: Model inversion attacks are known to be more effective when the attacker has access to outputs from earlier layers that may exhibit a more direct representation of the input images [26]. To capture this 'worst-case', we consider the setting where the attacker has access to raw intermediate outputs from the first linear network layer. As before, we also assume the attacker has access to ideal training data examples drawn from the actual training datasets. Appendix B provides additional details about the model inversion threat models." + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.233, + 0.787, + 0.645 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.663, + 0.427, + 0.68 + ], + "angle": 0, + "content": "3 SCA architecture" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.787, + 0.737 + ], + "angle": 0, + "content": "We now describe the SCA architecture, which is defined by alternating pairs of Sparse Coding Layers (SCL) and dense layers, followed by downstream linear and/or convolutional layers." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.746, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Sparse Coding Layer (SCL). Sparse coding converts raw inputs to sparse representations where only a few neurons whose features are useful in reconstructing the inputs are active. Our Sparse Coding Layer (SCL) performs sparse coding to obtain a sparse representation of a previous dense layer's representation (if the SCL is not the first layer in the network) or of the inputs (if the SCL is the first layer in the network). Fig. 1 illustrates the working principle of SCL." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.265, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.495, + 0.373 + ], + "angle": 0, + "content": "Formally, each SCL performs a reconstruction minimization problem to compute the sparse representation of its inputs (either a previous layer's representation or of the inputs to the network). Suppose the input to a (2D convolutional) SCL is \\(\\mathcal{X} \\in \\mathbb{R}^{\\mathcal{C} \\times \\mathcal{H} \\times \\mathcal{W}}\\) with \\(\\mathcal{H}\\) height, \\(\\mathcal{W}\\) width, and \\(\\mathcal{C}\\) channels/features. The goal is to find the sparse representation \\(\\mathcal{R}_x \\in \\mathbb{R}^{\\mathcal{F} \\times [\\mathcal{H} / S_h] \\times [\\mathcal{W} / S_w]}\\), where \\(\\mathcal{R}_x\\) has few active neurons and corresponds to a denoised version of the input \\(\\mathcal{X}\\), and \\(S_w\\) and \\(S_h\\) indicate convolutional strides across the width and height of" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.374, + 0.788, + 0.45 + ], + "angle": 0, + "content": "the input, respectively. \\(F\\) is the number of convolutional features in the SCL layer's dictionary, \\(\\Omega \\in \\mathbb{R}^{\\mathcal{F}\\times \\mathcal{C}\\times \\mathcal{H}_f\\times \\mathcal{W}_f}\\), where \\(\\mathcal{H}_f\\) and \\(\\mathcal{W}_f\\) are the height and width of each convolutional feature, respectively. Per Figure 1, the sparse coding layer starts with its input, \\(\\mathcal{X}\\), and dictionary of features, \\(\\Omega\\), to produce \\(\\mathcal{R}_x\\) by solving the following sparse reconstruction problem:" + }, + { + "type": "equation", + "bbox": [ + 0.381, + 0.46, + 0.787, + 0.492 + ], + "angle": 0, + "content": "\\[\n\\min _ {\\mathcal {R} _ {x}} \\frac {1}{2} | | \\mathcal {X} - \\mathcal {R} _ {x} * \\Omega | | _ {2} ^ {2} + \\lambda | | \\mathcal {R} _ {x} | | _ {1} \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.502, + 0.789, + 0.592 + ], + "angle": 0, + "content": "where the first term represents how much information is preserved about \\(\\mathcal{X}\\) by \\(\\mathcal{R}_x\\) by measuring the difference between \\(\\mathcal{X}\\) and its reconstruction, \\(\\mathcal{R}_x\\circledast \\varOmega\\), computed with a transpose convolution, \\(\\otimes\\). The second term measures how sparse \\(\\mathcal{R}_x\\) is, and \\(\\lambda\\) is a constant which determines the trade-off between reconstruction fidelity and sparsity. Equation 1 is convex in \\(\\mathcal{R}_x\\), meaning we will always find the optimal \\(\\mathcal{R}_x\\) that solves Equation 1." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.593, + 0.79, + 0.716 + ], + "angle": 0, + "content": "Among different techniques to perform sparse coding, we leverage the commonly used Locally Competitive Algorithm (LCA) [55]. LCA implements a recurrent network of leaky integrate-and-fire neurons that incorporates the general principles of thresholding and feature-similarity-based competition between neurons to solve Equation 1. While Rozell introduced LCA in the non-convolutional setting, it can be readily adapted to the convolutional setting (see Appendix A.2 for details). Specifically, each LCA neuron has an internal membrane potential \\(\\mathcal{P}\\) which evolves per the following differential equation:" + }, + { + "type": "equation", + "bbox": [ + 0.375, + 0.724, + 0.787, + 0.755 + ], + "angle": 0, + "content": "\\[\n\\dot {\\mathcal {P}} (t) = \\frac {1}{\\tau} [ \\varPsi (t) - \\mathcal {P} (t) - \\mathcal {R} _ {x} (t) * \\mathcal {G} ] \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.765, + 0.789, + 0.843 + ], + "angle": 0, + "content": "where \\(\\tau\\) is a time constant, \\(\\varPsi(t) = \\mathcal{X}*\\varOmega\\) is the neuron's bottom-up drive from the input computed by taking the convolution, *, between the input, \\(\\mathcal{X}\\), and the dictionary, \\(\\varOmega\\), and \\(-\\mathcal{P}(t)\\) is the leak term [37, 63]. Lateral competition between neurons is performed via the term \\(-\\mathcal{R}_x(t)*\\mathcal{G}\\), where \\(\\mathcal{G} = \\varOmega*\\varOmega - I\\) is the similarity between each feature and the other \\(\\mathcal{F}\\) features \\((-I\\) prevents" + }, + { + "type": "image", + "bbox": [ + 0.51, + 0.155, + 0.779, + 0.291 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.503, + 0.302, + 0.788, + 0.345 + ], + "angle": 0, + "content": "Fig.1: Pipeline of neuron (membrane potential) dynamics in Sparse Coding Layer (SCL) with lateral competitions." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "self interactions). \\(\\mathcal{R}_x\\) is computed by applying soft threshold activation \\(T_{\\lambda}(x) = \\mathrm{relu}(x - \\lambda)\\) to the neuron's membrane potential, which produces nonnegative, sparse representations. Overall, this means that in LCA neurons will compete to determine which ones best represent the input, and thus will have non-zero activations in \\(\\mathcal{R}_x\\), the output of the SCL that is passed to the next layer." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.24, + 0.428, + 0.42 + ], + "angle": 0, + "content": "SCA architecture. The SCA architecture is defined by the use of multiple pairs of sparse coding and dense (batch norm) layers after the input image, which can then be followed by other (linear, convolutional) layers. Fig. 2 illustrates this design principle. The key intuition is that the first sparse layer jettisons unnecessary private informa" + }, + { + "type": "image", + "bbox": [ + 0.44, + 0.283, + 0.787, + 0.359 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.513, + 0.373, + 0.713, + 0.387 + ], + "angle": 0, + "content": "Fig. 2: Architecture of SCA." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.421, + 0.788, + 0.603 + ], + "angle": 0, + "content": "tion in the input image. Then, by alternating sparse-dense pairs of layers, we ensure that unnecessary information is also jettisoned from downstream layers. In this manner, downstream layers also do not convey unnecessary private information to the adversary, and they also do not e.g. learn to reconstruct private information jettisoned by the first sparse layer. In short, previous defenses work by trying to mislead attackers by pushing model features in a wrong direction, either randomly via noise or strategically via adversarial examples, or by disincentivizing memorization during training. In contrast, SCA directly removes the unnecessary private information. Training SCA is identical to training a standard network with one exception: after each backprop updates non-sparse layers, we perform a fast update on the sparse layers, except for the first sparse layer that sparse-codes the image input.3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.619, + 0.788, + 0.802 + ], + "angle": 0, + "content": "SCA training complexity & large scale applications. While we focus on the neuron lateral competition approach to sparse coding as it is practically convenient and well-represented in recent work [63], we note that for large-scale machine learning applications, we now have practical parallel algorithms that learn the sparse coding dictionary near-optimally w.p. in parallel time (adaptivity) that is logarithmic in the size of the data [8, 13, 32]. Fast single-iteration heuristics are also available (see e.g. [72]). Thus, even for large-scale applications, computing sparse representations while training SCA adds little computational overhead compared to sophisticated optimization-based techniques necessary for recent defenses [22]. In practice, even our basic sparse coding research implementations (see Section 4 and Appendix A.3) are slightly faster than optimized Torch implementations of the best-performing recent defense [53]." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.787, + 0.84 + ], + "angle": 0, + "content": "3 We can optionally also perform a backpropagation on sparse layers after updating them each iteration via sparse coding. We do this in our experiments." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.265, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.377, + 0.163 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.175, + 0.788, + 0.268 + ], + "angle": 0, + "content": "xOur goal in this section is to show that SCA performs well compared to state-of-the-art defenses as well as practical defenses used in leading industry models in terms of both classification accuracy and various reconstruction quality metrics. To evaluate its performance comprehensively, we test all combinations of 5 diverse datasets, 3 threat models, 9 defense baselines, plus multiple runs-per-experiment and various sparsity parameters \\(\\lambda\\). See Appendix A.1-A.6." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.28, + 0.788, + 0.342 + ], + "angle": 0, + "content": "Five benchmark datasets. We test our performance on all 5 diverse datasets used to benchmark model inversion attacks across the recent literature: CelebA, hi-res RGB faces, Medical MNIST medical images, CIFAR-10 hi-res RGB objects, MNIST grayscale digits, and Fashion MNIST grayscale objects." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.354, + 0.788, + 0.581 + ], + "angle": 0, + "content": "Three attacks. For each dataset, we conduct three sets of experiments corresponding to our three threat models. First, we test SCA and baselines' defenses against a state-of-the-art Plug- \\(\\mathcal{E}\\) -Play attack [61] that leverages StyleGAN3 to obtain high-quality reconstructions. Second, we compare SCA networks to a variety of baselines in terms of their robustness to a state-of-the-art end-to-end network attack that leverages leaked raw high-dimensional outputs from the networks' last hidden layer, as well as held-out training data drawn from the true training dataset. This allows us to assess SCA's defenses in a realistic setting with a well-informed adversary. Our third set of experiments tests performance in a split network setting of [64] where the attacker has access to leaked raw outputs from the first linear network layer. Robustness in this setting is desirable because model inversion attacks are known to be more effective on earlier hidden layers [26], and also because an algorithm that is robust to such attacks would be an effective defense under novel security paradigms such as Federated Learning, which is vulnerable to inversion [64] (see Appendix A.5)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.593, + 0.787, + 0.625 + ], + "angle": 0, + "content": "Nine defense baselines. We compare SCA to 9 baselines plus extra variants, including SOTA defenses and practical defenses used in leading industry models:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.631, + 0.714, + 0.646 + ], + "angle": 0, + "content": "- No-Defense. The baseline target model with no added defenses." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.647, + 0.785, + 0.675 + ], + "angle": 0, + "content": "- Hayes et al. [25]. We train a DP-SGD defense that noises and clips gradients during training. This is the only defense with provable guarantees." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.677, + 0.785, + 0.72 + ], + "angle": 0, + "content": "- Gong et al. [22]. We train the very recent defense from [22] that uses sophisticated tuning and two types of GAN-generated images. We also try a ‘++’ version that adds extra Continual Learning accuracy optimizations." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.721, + 0.785, + 0.751 + ], + "angle": 0, + "content": "- Peng et al. [53]. We train the Bilateral Dependency defense that adds a loss function for redundant input memorization during training." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.751, + 0.785, + 0.781 + ], + "angle": 0, + "content": "- Wang et al. [66]. We train a Mutual Information Regularization defense that penalizes dependence between inputs and outputs during training." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.781, + 0.785, + 0.811 + ], + "angle": 0, + "content": "- Titcombe et al. [64]. We train a state-of-the-art Laplace \\(\\mathcal{L}(\\mu = 0, b = 0.5)\\) noise defense as in [64]. We also try more noise—see Appendix D." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.811, + 0.785, + 0.84 + ], + "angle": 0, + "content": "- Sparse-Standard. We train an off-the-shelf sparse coding architecture [63] with 1 sparse layer after the input image via lateral competition as in SCA." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.631, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "text", + "bbox": [ + 0.224, + 0.146, + 0.787, + 0.191 + ], + "angle": 0, + "content": "- GAN [common industry defense]. We train a GAN for 25 epochs to generate fake samples, then train the target model with both original and GAN-generated samples. This defense is frequently used in industry." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.192, + 0.787, + 0.222 + ], + "angle": 0, + "content": "- Gaussian-Noise [common industry defense]. We draw noises from \\(\\mathcal{N}(\\mu = 0, \\sigma = 0.5)\\) and inject them into intermediate dense layers post-training." + }, + { + "type": "list", + "bbox": [ + 0.224, + 0.146, + 0.787, + 0.222 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.233, + 0.786, + 0.353 + ], + "angle": 0, + "content": "SCA without parameter tuning. In all experiments, we consider the simplest case of SCA architecture that contains SCA's alternating sparse-and-dense layer pairs followed by only linear layers. We note that adding downstream convolutional layers or more sophisticated downstream architectures is certainly possible, though we avoid this here in order to compare the essence of the SCA approach to the baselines. Appendix A.4 describes SCA details. In the split network setting, we are careful to use slightly shallower SCA architectures with fewer linear layers to match the split network experiments of [64]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.354, + 0.787, + 0.43 + ], + "angle": 0, + "content": "Recent state-of-the-art defenses such as GAN-based defenses require sophisticated automatic parameter tuning techniques such as focal tuning and continual learning to obtain high performance [22]. To test whether SCA can be effective absent parameter tuning, we just run SCA with sparsity parameter \\(\\lambda\\) set to 0.1, 0.25, or 0.5—the default values from various sparse coding contexts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.44, + 0.787, + 0.471 + ], + "angle": 0, + "content": "Performance metrics. We evaluate attackers' reconstructions using multiple standard metrics. Let \\( X_{in}^{*} \\) denote the reconstruction of training image \\( X_{in} \\). Then:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.476, + 0.786, + 0.505 + ], + "angle": 0, + "content": "- Peak signal-to-noise ratio (PSNR) [lower=better]. PSNR is the ratio of max squared pixel fluctuations from \\( X_{in} \\) to \\( X_{*in} \\) over mean squared error." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.506, + 0.786, + 0.55 + ], + "angle": 0, + "content": "- Structural similarity (SSIM) [70] [lower=better]. SSIM measures the product of luminance distortion, contrast distortion, & correlation loss: \\( SSIM(X_{in},X_{in}^{*}) = l_{dis}(X_{in},X_{in}^{*})c_{dis}(X_{in},X_{in}^{*})c_{loss}(X_{in},X_{in}^{*}) \\)." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.55, + 0.786, + 0.58 + ], + "angle": 0, + "content": "- Fréchet inception distance (FID) [28] [higher=better]. FID measures reconstruction quality as a distributional difference between \\( X_{in} \\) and \\( X_{in}^{*} \\):" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.476, + 0.786, + 0.58 + ], + "angle": 0, + "content": null + }, + { + "type": "equation", + "bbox": [ + 0.245, + 0.581, + 0.786, + 0.604 + ], + "angle": 0, + "content": "\\[\nF I D ^ {2} (X _ {i n}, X _ {i n} ^ {*}) = | | \\mu_ {X _ {i n}} - \\mu_ {X _ {i n} ^ {*}} | | ^ {2} + T r (\\mathrm {C o} _ {X _ {i n}} + \\mathrm {C o} _ {X _ {i n} ^ {*}} - 2 * \\sqrt {\\mathrm {C o} _ {X _ {i n}} \\cdot \\mathrm {C o} _ {X _ {i n} ^ {*}}})\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.613, + 0.787, + 0.675 + ], + "angle": 0, + "content": "Target model. We focus on privacy attacks on linear networks because they capture the essence of the privacy attack vulnerability [20, 29], and because there is broad consensus that a principled understanding of their emerging privacy (and security) vulnerabilities4 is urgently needed [27, 42, 57, 73]." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.685, + 0.787, + 0.791 + ], + "angle": 0, + "content": "PyTorch codebase, replicability, and evaluation standardization. For all experiments, we consider the standard train test split of \\(70\\%\\) and \\(30\\%\\). After training each defense model, we run attacks to reconstruct the entire training set and compare reconstruction performance. We run all the experiments on a standard industry production cluster with 4 nodes and DELL Tesla V100 GPUs with 40 cores. We provide a cluster-ready PyTorch codebase on our project page at: https://sayantondibbo.github.io/SCA." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.797, + 0.787, + 0.84 + ], + "angle": 0, + "content": "4 We also note that results on linear models may generalize better than results on more application-specific models, and linear models trained on private data remain ubiquitous among top industry products." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.265, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.512, + 0.162 + ], + "angle": 0, + "content": "4.1 Experimental results overview" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.17, + 0.788, + 0.322 + ], + "angle": 0, + "content": "Defense. Across the 3 attack settings and 5 datasets, SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than the 9 baselines in terms of PSNR & FID, and 1.1 to 720 times more in terms of SSIM. This performance gap exceeds the scale of improvements made by recent algorithms. SCA's defense is also more stable than baselines across multiple runs. This is because unlike for baselines, even an idealized 'perfect attacker' can only hope to recover a sparsified, un-detailed training image from SCA. We show results here for the 2 most privacy-sensitive datasets of medical images and CelebA in 3 threat models, and defer the 9 other {dataset, attack} combinations to Appendix C." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.325, + 0.788, + 0.492 + ], + "angle": 0, + "content": "Accuracy. Typically, obtaining greater defense means trading away accuracy. However, in 6 of the 15 experiments (MNIST + FashionMNIST) × (Plug & Play + end-to-end + split networks), SCA outperforms no-defense and all baselines' accuracy. SCA also outperforms all baselines' accuracy on CelebA in Plug & Play, and a sparse approach is within 0.003 of the best accuracy on an 8th experiment. No other single SOTA baseline wins on accuracy this consistently. We emphasize that unlike baselines that do accuracy hyperparameter tuning, we obtain this result absent any such tuning. SCA drops accuracy on MedMNIST (which is the most imbalanced & has fewest training examples). However, tuning of SCA (kernel size \\(5 \\rightarrow 7\\)) improves SCA's accuracy on MedMNIST in Table 3 from \\(94.6\\%\\) to \\(97\\%\\)—See Appendix G and Table 12." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.498, + 0.628, + 0.512 + ], + "angle": 0, + "content": "Results of experiments set 1: Plug- \\(\\mathcal{E}\\) -Play attack." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.513, + 0.788, + 0.603 + ], + "angle": 0, + "content": "Qualitative evaluations. Fig. 3 shows hi-res CelebA reconstructions generated by Plug- & Play under various defenses. To avoid cherry-picking, Fig. 3 shows the 3 images with the highest (top row), median (middle), and lowest (bottom) PSNR reconstructions under No-Defense. Note that reconstructions under SCA totally differ from actual images (different race, hair, gender, child/adult), while those of other defenses are closer to actual images, indicating privacy leakage." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.604, + 0.788, + 0.649 + ], + "angle": 0, + "content": "Metric evaluations. Table 1 reports reconstruction quality measures and accuracy for SCA and other baselines in the Plug- & Play attack [61] setting (lower rows = better defense performance). In terms of PSNR and SSIM, training data" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.674, + 0.763, + 0.796 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.808, + 0.787, + 0.838 + ], + "angle": 0, + "content": "Fig. 3: Experiments set 1: Qualitative comparisons among actual and reconstructed images (Plug- & Play Attack [61]) under SCA & baselines on hi-res CelebA dataset." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.133, + 0.788, + 0.163 + ], + "angle": 0, + "content": "Table 1: Experiments set 1: Performance comparison under Plug- &-Play attack [61] setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.173, + 0.787, + 0.555 + ], + "angle": 0, + "content": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE11.350.718256.40.779
GAUSSIAN-NOISE10.390.604264.80.644
GAN10.150.613289.70.635
Titcombe et al. [64]10.180.636304.10.654
Gong et al. [22]++10.020.556381.50.672
Gong et al. [22]10.110.595350.50.614
Peng et al. [53]9.900.514402.80.728
Hayes et al. [25]9.920.556383.70.621
Wang et al. [66]9.850.527402.80.742
SPARSE-STANDARD9.840.539374.70.728
SCA0.19.790.451391.90.726
SCA0.259.450.442411.00.739
SCA0.59.400.440412.60.723
MedicalNo-DEFENSE22.040.396196.10.998
MNISTGAUSSIAN-NOISE21.830.382209.40.862
GAN21.770.427219.00.998
Gong et al. [22]++21.500.359273.10.894
Titcombe et al. [64]21.680.360286.30.899
Gong et al. [22]21.750.477249.10.770
Peng et al. [53]21.820.381268.30.927
Hayes et al. [25]21.720.337259.70.823
Wang et al. [66]21.710.322211.70.937
SPARSE-STANDARD20.970.086239.30.907
SCA0.121.190.057253.50.888
SCA0.2521.170.075280.10.882
SCA0.520.060.055288.80.881
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.563, + 0.789, + 0.73 + ], + "angle": 0, + "content": "reconstructions under the least sparse version SCA0.1 are degraded by factors of 1.01 to 6.7 and 1.01 to 5.6 compared to the regularization defenses of Peng et al. [53] and Wang et al. [66], respectively. Increasing SCA's sparsity \\(\\lambda\\) to 0.5 widens the performance gap, increasing these factors to 1.1 to 6.9 and 1.02 to 5.9, respectively, and making SCA outperform baselines' FID. SCA0.1 also outperforms the noise-based approaches of Hayes et al. [25] and Titcombe et al. [64] on all metric by factors of 1.01 to 5.9 and 1.02 to 6.3. Increasing SCA's sparsity \\(\\lambda\\) to 0.5 increases these factors to 1.1 to 6.1 and 1.1 to 6.5. Finally, SCA0.1 outperforms the data augmentation defense of [22] by factors of 1.01 to 8.4, which widens to 1.1 to 8.7 for SCA0.5. All baselines also outperform common GAN and Noise-based industry defenses." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Basic SPARSE-STANDARD outperforms SOTA baselines. Our basic SPARSE-STANDARD baseline outperforms the best baselines' PSNR on both CelebA and Medical MNIST, and also outperforms baselines' SSIM on the latter. SCA0.5 then outperforms SPARSE-STANDARD on all metrics, obtaining SSIM and FID that are better by factors of 1.2 to 1.6 and 1.1 to 1.2, respectively, and slightly better PSNR. Thus, while SPARSE-STANDARD offers an inferior defense vs. SCA, it still offers a fast practical defense for less privacy-critical domains." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.266, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.244, + 0.146, + 0.761, + 0.272 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.284, + 0.785, + 0.311 + ], + "angle": 0, + "content": "Fig. 4: Experiments set 2: Qualitative comparisons among actual & reconstructed images (end-to-end setting) under SCA & baselines on the Medical MNIST dataset." + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.332, + 0.787, + 0.361 + ], + "angle": 0, + "content": "Table 2: Experiments set 2: Performance comparison in end-to-end setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.372, + 0.787, + 0.753 + ], + "angle": 0, + "content": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.260.262201.80.773
GAUSSIAN-NOISE16.080.262220.40.638
GAN13.550.133199.60.668
Titcombe et al. [64]15.130.191197.70.695
Gong et al. [22]++13.100.032204.80.704
Gong et al. [22]13.150.119199.60.682
Peng et al. [53]13.780.141218.80.716
Hayes et al. [25]14.100.004199.00.664
Wang et al. [66]13.630.0011203.20.744
SPARSE-STANDARD13.090.002222.10.749
SCA0.112.890.004228.50.748
SCA0.2512.730.004218.80.737
SCA0.512.420.001231.90.741
MedicalNo-DEFENSE31.480.93510.660.998
MNISTGAUSSIAN-NOISE30.460.92012.230.862
GAN27.340.48033.770.998
Gong et al. [22]++18.370.35381.520.894
Titcombe et al. [64]21.330.43130.600.899
Gong et al. [22]21.520.43664.880.770
Peng et al. [53]19.050.420107.90.908
Hayes et al. [25]18.480.007150.90.824
Wang et al. [66]20.480.54930.010.946
SPARSE-STANDARD14.790.119250.60.907
SCA0.113.430.004352.10.888
SCA0.2512.320.004375.90.882
SCA0.512.040.003369.90.881
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.78, + 0.64, + 0.794 + ], + "angle": 0, + "content": "Results of experiments set 2: End-to-end networks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Qualitative evaluations. Fig. 4, shows Medical MNIST reconstructions in the end-to-end threat model. SCA's reconstructions are visually destroyed (esp. SCA0.5), whereas baselines admit noisy-but-recognizable reconstructions." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.299 + ], + "angle": 0, + "content": "Metric evaluations. Table 2 reports performance in the end-to-end network setting. In this setting, SCA's performance advantage widens. In terms of PSNR & FID, training data reconstructions under SCA0.1 are degraded by factors of 1.1 to 3.3 and 1.1 to 11.7 compared to Peng et al. [53] and Wang et al. [66], respectively (but slightly worse SSIM vs. Wang et al. on CelebA). On all metrics, SCA0.1 outperforms Hayes et al. [25] and Titcombe et al. [64] by factors of 1.1 to 2.4 and 1.1 to 107.7, respectively. SCA0.1 also outperforms Gong et al. [22] by factors of 1.01 to 109. Increasing SCA's \\(\\lambda\\) to 0.5 causes it to outperform the same baselines on all metrics by factors of 1.2 to 141 [53], 1.2 to 183 [66], 1.2 to 4.0 [25], 1.2 to 191 [64], and 1.1 to 145.3 [22], respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.321, + 0.788, + 0.444 + ], + "angle": 0, + "content": "Stability of SCA's defense vs. baselines. SCA's performance is also as stable or more stable than baselines' performance over multiple runs. For example, Fig. 5a plots the means & std. devs. of SCA & baselines' per-run FID (the standard metric for faces) over multiple runs for CelebA faces in the Plug-&Play setting, and Fig. 5b plots this for PSNR (the standard metric for grayscale images) on Medical MNIST in the end-to-end setting. SCA obtains better performance while also exhibiting stability of defense performance on par with the best baseline (and better stability than most baselines). See Appendix E." + }, + { + "type": "image", + "bbox": [ + 0.233, + 0.472, + 0.486, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.226, + 0.583, + 0.496, + 0.595 + ], + "angle": 0, + "content": "(a) FID↑↑ for CelebA faces under Plug- &-Play" + }, + { + "type": "image", + "bbox": [ + 0.514, + 0.472, + 0.771, + 0.579 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.508, + 0.583, + 0.788, + 0.595 + ], + "angle": 0, + "content": "(b) PSNR \\(\\downarrow \\downarrow\\) for Med.MNIST, end-to-end setting" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.606, + 0.788, + 0.636 + ], + "angle": 0, + "content": "Fig. 5: Stability of SCA & baselines' defense performance (mean ± std. dev.) of PSNR and FID across multiple runs on CelebA and Medical MNIST." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "SCA's sparsity vs. performance. We also try varying SCA's and SPARSE-STANDARD's sparsity parameters \\(\\lambda\\) and recompute PSNR, SSIM, FID, and accuracy. Appendix A.6 shows that for each \\(\\lambda\\) and defense metric, SCA significantly outperforms the off-the-shelf SPARSE-STANDARD architecture for a small accuracy cost. Thus, for a given \\(\\lambda\\) with SPARSE-STANDARD, we can use a (smaller) \\(\\lambda\\) with SCA to obtain better reconstruction and higher or equal (within 0.0017) accuracy. SCA is also amenable to more sophisticated tuning (and performance improvements) by tuning different \\(\\lambda\\) per sparse layer (e.g., by having a sparser representation of inputs but less sparse reductions of downstream layers). We avoid such tuning here as it is unnecessary for good performance." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.265, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.174 + ], + "angle": 0, + "content": "Table 3: Experiments set 3: Performance comparison in split network setting (lower rows=better defense) on hi-res CelebA faces and sensitive Medical MNIST images." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.184, + 0.787, + 0.567 + ], + "angle": 0, + "content": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.490.302185.80.766
GAUSSIAN-NOISE15.440.227191.10.753
GAN15.570.253176.70.646
Titcombe et al. [64]14.990.144194.20.725
Gong et al. [22]++15.060.038190.50.756
Gong et al. [22]15.650.044185.80.653
Peng et al. [53]16.230.211198.60.717
Hayes et al. [25]15.060.005178.80.672
Wang et al. [66]14.820.173189.60.652
SPARSE-STANDARD15.390.009187.00.746
SCA0.115.050.005178.70.745
SCA0.2514.760.003191.10.743
SCA0.514.710.003206.10.739
MedicalNo-DEFENSE23.470.77645.570.993
MNISTGAUSSIAN-NOISE21.930.72244.720.811
GAN21.670.71948.490.912
Gong et al. [22]++21.070.57367.530.931
Titcombe et al. [64]21.350.70448.820.961
Gong et al. [22]21.330.72041.740.925
Peng et al. [53]18.980.426124.80.914
Hayes et al. [25]21.460.442137.40.850
Wang et al. [66]20.030.53865.170.986
SPARSE-STANDARD15.330.149142.40.955
SCA0.113.950.008244.90.946
SCA0.2512.310.008255.30.928
SCA0.512.270.001285.30.909
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.593, + 0.788, + 0.67 + ], + "angle": 0, + "content": "Results of experiments set 3: Split networks. Table 3 reports performance in the split network setting. As expected, all baselines and SCA perform slightly worse in this threat model compared to the end-to-end model (aside from Guussian and GAN heuristics). On all metrics, SCA's performance advantage remains consistent: SCA0.5 outperforms all baselines by factors of 1.1 to 720." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.689, + 0.787, + 0.708 + ], + "angle": 0, + "content": "5 Empirical analysis of sparse coding robustness to attack" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Sparse-coding layers' robustness to privacy attacks can be observed empirically. Consider that the attacker trains the attack to map leaked raw hidden layer outputs back to input images. Attacks are thus highly dependent on these outputs' distributions. Recall that UMAP projections compute a 2D visualization of the global structure of distances between different training images' features according to a particular layer [43]. Fig. 6 plots UMAP 2D projections of linear layer feature distributions of training inputs after either two linear layers (Figs. 6a & 6d), two convolutional layers (Figs. 6b & 6e), or two sparse coding layers (with" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.127 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "image", + "bbox": [ + 0.242, + 0.146, + 0.387, + 0.232 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.265, + 0.235, + 0.362, + 0.247 + ], + "angle": 0, + "content": "(a) Linear Layer" + }, + { + "type": "image", + "bbox": [ + 0.244, + 0.248, + 0.384, + 0.335 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.264, + 0.338, + 0.362, + 0.35 + ], + "angle": 0, + "content": "(d) Linear Layer" + }, + { + "type": "image", + "bbox": [ + 0.429, + 0.145, + 0.572, + 0.233 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.434, + 0.235, + 0.566, + 0.247 + ], + "angle": 0, + "content": "(b) Convolution Layer" + }, + { + "type": "image", + "bbox": [ + 0.43, + 0.248, + 0.571, + 0.335 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.435, + 0.338, + 0.564, + 0.35 + ], + "angle": 0, + "content": "(e) Convolution Layer" + }, + { + "type": "image", + "bbox": [ + 0.621, + 0.145, + 0.764, + 0.233 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.621, + 0.235, + 0.764, + 0.248 + ], + "angle": 0, + "content": "(c) Sparse Coding Layer" + }, + { + "type": "image", + "bbox": [ + 0.622, + 0.25, + 0.761, + 0.335 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.621, + 0.337, + 0.762, + 0.35 + ], + "angle": 0, + "content": "(f) Sparse Coding Layer" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.361, + 0.788, + 0.39 + ], + "angle": 0, + "content": "Fig. 6: UMap 2D projections of input images' features by class after 2 linear layers, 2 conv. layers, or 2 sparse-coded layers on MNIST (top) & Fashion MNIST (bottom)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.423, + 0.789, + 0.59 + ], + "angle": 0, + "content": "interspersed dense layers - Figs. 6c & 6f). Importantly, observe that after two linear or two convolutional layers, points are clustered by color, i.e., input images' features are highly clustered by label. This class-clustered property leaves such layers vulnerable to model inversion attacks, as an attacker can 'home in on' examples from a specific class. In contrast, the goal in sparse coding is not to optimize the classification objective by separating classes, but rather to jettison unnecessary information. Here, this means that unnecessary information is jettisoned both from the input image and also the downstream dense layer. Per Figs. 6c & 6f, this tends to 'uncluster' remaining non-sparsified features of training examples from the same class, making it much harder for an attacker to compute informative gradients to home in on a training example." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.62, + 0.492, + 0.636 + ], + "angle": 0, + "content": "6 Discussion & Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In this paper, we have provided the first study of sparse coding-based neural network architectures that are robust to model inversion attacks. Specifically, we have shown that the natural properties of sparse coded layers can control the extraneous private information about the training data that is encoded in a network without resorting to complex and computationally intensive parameter tuning techniques. Our work reveals a deep connection between state-of-the-art privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. Currently, our basic research implementation of SCA achieves compute times that in the worst-case are no better than some SOTA baselines (see Appendix F). However, given the rich theoretic body of work on fast algorithms and provable guarantees for sparse coding, we believe these aspects are opportune areas for future improvements." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.265, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.181, + 0.788, + 0.273 + ], + "angle": 0, + "content": "We are grateful for generous support from OpenAI, as well as the Dartmouth College Cybersecurity Cluster Research. This work was partially funded by the Center for Nonlinear Studies and the Information Science and Technology Institute's Cyber Security Summer School at Los Alamos National Laboratory, as well as an award from the Department of Energy's Advanced Scientific Computing Research program (#77902)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.298, + 0.323, + 0.314 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.333, + 0.787, + 0.389 + ], + "angle": 0, + "content": "1. Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security. pp. 308-318 (2016) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.391, + 0.787, + 0.445 + ], + "angle": 0, + "content": "2. Abuadbba, S., Kim, K., Kim, M., Thapa, C., Camtepe, S.A., Gao, Y., Kim, H., Nepal, S.: Can we use split learning on 1d cnn models for privacy preserving training? In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security. pp. 305-318 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.447, + 0.787, + 0.473 + ], + "angle": 0, + "content": "3. Ahmad, S., Scheinkman, L.: How can we be so dense? the benefits of using highly sparse representations. arXiv preprint arXiv:1903.11257 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.476, + 0.787, + 0.502 + ], + "angle": 0, + "content": "4. Aïvodji, U., Gambs, S., Ther, T.: Gamin: An adversarial approach to black-box model inversion. arXiv preprint arXiv:1909.11835 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.504, + 0.787, + 0.544 + ], + "angle": 0, + "content": "5. An, S., Tao, G., Xu, Q., Liu, Y., Shen, G., Yao, Y., Xu, J., Zhang, X.: Mirror: Model inversion for deep learning network with high fidelity. In: Proceedings of the 29th Network and Distributed System Security Symposium (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.546, + 0.787, + 0.572 + ], + "angle": 0, + "content": "6. Barlow, H.B.: The coding of sensory messages. Current problems in animal behavior (1961) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.574, + 0.787, + 0.629 + ], + "angle": 0, + "content": "7. Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Konečny, J., Mazzocchi, S., McMahan, B., et al.: Towards federated learning at scale: System design. Proceedings of machine learning and systems 1, 374-388 (2019) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.631, + 0.787, + 0.671 + ], + "angle": 0, + "content": "8. Breuer, A., Balkanski, E., Singer, Y.: The fast algorithm for submodular maximization. In: International Conference on Machine Learning. pp. 1134-1143. PMLR (2020) 3, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.673, + 0.787, + 0.727 + ], + "angle": 0, + "content": "9. Candès, E.J., Donoho, D.L.: New tight frames of curvelets and optimal representations of objects with piecewise c2 singularities. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences 57(2), 219-266 (2004) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.787, + 0.769 + ], + "angle": 0, + "content": "0. Carlini, N., Jagielski, M., Zhang, C., Papernot, N., Terzis, A., Tramer, F.: The privacy onion effect: Memorization is relative. Advances in Neural Information Processing Systems 35, 13263-13276 (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.771, + 0.787, + 0.812 + ], + "angle": 0, + "content": "11. Carlini, N., Hayes, J., Nasr, M., Jagielski, M., Sehwag, V., Tramer, F., Balle, B., Ippolito, D., Wallace, E.: Extracting training data from diffusion models. In: 32nd USENIX Security Symposium (USENIX Security 23). pp. 5253-5270 (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.814, + 0.787, + 0.84 + ], + "angle": 0, + "content": "12. Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM review 43(1), 129-159 (2001) 2" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.333, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "13. Chen, Y., Dey, T., Kuhnle, A.: Best of both worlds: Practical and theoretically optimal submodular maximization in parallel. Advances in Neural Information Processing Systems 34, 25528-25539 (2021) 3, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.786, + 0.217 + ], + "angle": 0, + "content": "14. Davis, G., Mallat, S., Avellaneda, M.: Adaptive greedy approximations. Constructive approximation 13, 57-98 (1997) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.786, + 0.259 + ], + "angle": 0, + "content": "15. Dibbo, S.V.: Sok: Model inversion attack landscape: Taxonomy, challenges, and future roadmap. In: IEEE 36th Computer Security Foundations Symposium. pp. 408-425. IEEE Computer Society (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.26, + 0.787, + 0.313 + ], + "angle": 0, + "content": "16. Dibbo, S.V., Chung, D.L., Mehnaz, S.: Model inversion attack with least information and an in-depth analysis of its disparate vulnerability. In: 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML). pp. 119-135. IEEE (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.315, + 0.786, + 0.355 + ], + "angle": 0, + "content": "17. Dibbo, S.V., Moore, J.S., Kenyon, G.T., Teti, M.A.: Lcanets++: Robust audio classification using multi-layer neural networks with lateral competition. arXiv preprint arXiv:2308.12882 (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.357, + 0.787, + 0.41 + ], + "angle": 0, + "content": "18. Fang, H., Chen, B., Wang, X., Wang, Z., Xia, S.T.: Gidf: A generative gradient inversion method with feature domain optimization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4967-4976 (2023) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.412, + 0.786, + 0.438 + ], + "angle": 0, + "content": "19. Field, D.J.: What is the goal of sensory coding? Neural computation 6(4), 559-601 (1994) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.44, + 0.786, + 0.493 + ], + "angle": 0, + "content": "20. Fredrikson, M., Jha, S., Ristenpart, T.: Model inversion attacks that exploit confidence information and basic countermeasures. In: Proceedings of the 22nd ACM SIGSAC conference on computer and communications security. pp. 1322-1333 (2015) 1, 2, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.496, + 0.786, + 0.536 + ], + "angle": 0, + "content": "21. Gong, N.Z., Liu, B.: You are who you know and how you behave: Attribute inference attacks via users' social friends and behaviors. In: 25th USENIX Security Symposium (USENIX Security 16). pp. 979-995 (2016) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.537, + 0.786, + 0.577 + ], + "angle": 0, + "content": "22. Gong, X., Wang, Z., Li, S., Chen, Y., Wang, Q.: A gan-based defense framework against model inversion attacks. IEEE Transactions on Information Forensics and Security (2023) 2, 6, 7, 8, 10, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.578, + 0.786, + 0.619 + ], + "angle": 0, + "content": "23. Haim, N., Vardi, G., Yehudai, G., Shamir, O., Irani, M.: Reconstructing training data from trained neural networks. Advances in Neural Information Processing Systems 35, 22911-22924 (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.62, + 0.787, + 0.674 + ], + "angle": 0, + "content": "24. Hannan, D., Nesbit, S.C., Wen, X., Smith, G., Zhang, Q., Goffi, A., Chan, V., Morris, M.J., Hunninghake, J.C., Villalobos, N.E., et al.: Mobileptx: sparse coding for pneumothorax detection given limited training examples. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 15675-15681 (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.676, + 0.786, + 0.702 + ], + "angle": 0, + "content": "25. Hayes, J., Mahloujifar, S., Balle, B.: Bounding training data reconstruction in dpsgd. arXiv preprint arXiv:2302.07225 (2023) 2, 4, 7, 10, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.703, + 0.786, + 0.743 + ], + "angle": 0, + "content": "26. He, Z., Zhang, T., Lee, R.B.: Model inversion attacks against collaborative inference. In: Proceedings of the 35th Annual Computer Security Applications Conference. pp. 148-162 (2019) 2, 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.745, + 0.786, + 0.771 + ], + "angle": 0, + "content": "27. Heredia, L.G., Negrevergne, B., Chevaleyre, Y.: Adversarial attacks for mixtures of classifiers. arXiv preprint arXiv:2307.10788 (2023) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.772, + 0.786, + 0.813 + ], + "angle": 0, + "content": "28. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.814, + 0.786, + 0.84 + ], + "angle": 0, + "content": "29. Hidano, S., Murakami, T., Katsumata, S., Kiyomoto, S., Hanaoka, G.: Model inversion attacks for prediction systems: Without knowledge of non-sensitive attributes." + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.266, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.245, + 0.147, + 0.786, + 0.175 + ], + "angle": 0, + "content": "In: 2017 15th Annual Conference on Privacy, Security and Trust (PST). pp. 115-11509. IEEE (2017) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.177, + 0.787, + 0.217 + ], + "angle": 0, + "content": "30. Hitaj, B., Ateniese, G., Perez-Cruz, F.: Deep models under the gan: information leakage from collaborative deep learning. In: Proceedings of the 2017 ACM SIGSAC conference on computer and communications security. pp. 603-618 (2017) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.786, + 0.258 + ], + "angle": 0, + "content": "31. Hu, H., Salcic, Z., Sun, L., Dobbie, G., Yu, P.S., Zhang, X.: Membership inference attacks on machine learning: A survey. ACM Computing Surveys (CSUR) 54(11s), 1-37 (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.259, + 0.786, + 0.3 + ], + "angle": 0, + "content": "32. Jiang, Z., Zhang, G., Davis, L.S.: Submodular dictionary learning for sparse coding. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition. pp. 3418-3425. IEEE (2012) 3, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.786, + 0.342 + ], + "angle": 0, + "content": "33. Kahla, M., Chen, S., Just, H.A., Jia, R.: Label-only model inversion attacks via boundary repulsion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15045-15053 (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.342, + 0.786, + 0.383 + ], + "angle": 0, + "content": "34. Kaissis, G.A., Makowski, M.R., Rückert, D., Braren, R.F.: Secure, privacy-preserving and federated machine learning in medical imaging. Nature Machine Intelligence 2(6), 305-311 (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.383, + 0.786, + 0.425 + ], + "angle": 0, + "content": "35. Kariyappa, S., Prakash, A., Qureshi, M.K.: Maze: Data-free model stealing attack using zeroth-order gradient estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13814-13823 (2021) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.786, + 0.466 + ], + "angle": 0, + "content": "36. Kavukcuoglu, K., Ranzato, M., LeCun, Y.: Fast inference in sparse coding algorithms with applications to object recognition. arXiv preprint arXiv:1010.3467 (2010) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.466, + 0.786, + 0.508 + ], + "angle": 0, + "content": "37. Kim, E., Rego, J., Watkins, Y., Kenyon, G.T.: Modeling biological immunity to adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4666-4675 (2020) 2, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.508, + 0.786, + 0.55 + ], + "angle": 0, + "content": "38. Konečny, J., McMahan, H.B., Yu, F.X., Richtárik, P., Suresh, A.T., Bacon, D.: Federated learning: Strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492 (2016) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.55, + 0.786, + 0.577 + ], + "angle": 0, + "content": "39. Krause, A., Cevher, V.: Submodular dictionary selection for sparse representation. In: International Conference on Machine Learning (ICML) (2010) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.577, + 0.786, + 0.605 + ], + "angle": 0, + "content": "40. Lee, H., Battle, A., Raina, R., Ng, A.: Efficient sparse coding algorithms. Advances in neural information processing systems 19 (2006) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.605, + 0.786, + 0.633 + ], + "angle": 0, + "content": "41. Li, L., Xie, T., Li, B.: Sok: Certified robustness for deep neural networks. In: 2023 IEEE Symposium on Security and Privacy (SP). pp. 1289-1310. IEEE (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.786, + 0.674 + ], + "angle": 0, + "content": "42. Liu, G., Wang, C., Peng, K., Huang, H., Li, Y., Cheng, W.: Socinf: Membership inference attacks on social media health data with machine learning. IEEE Transactions on Computational Social Systems 6(5), 907-921 (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.674, + 0.786, + 0.702 + ], + "angle": 0, + "content": "43. McInnes, L., Healy, J., Melville, J.: Umap: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.786, + 0.743 + ], + "angle": 0, + "content": "44. McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. pp. 1273-1282. PMLR (2017) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.743, + 0.786, + 0.799 + ], + "angle": 0, + "content": "45. Mehnaz, S., Dibbo, S.V., Kabir, E., Li, N., Bertino, E.: Are your sensitive attributes private? novel model inversion attribute inference attacks on classification models. In: 31st USENIX Security Symposium (USENIX Security 22). pp. 4579-4596. USENIX Association, Boston, MA (Aug 2022) 1, 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.786, + 0.841 + ], + "angle": 0, + "content": "46. Melis, L., Song, C., De Cristofaro, E., Shmatikov, V.: Exploiting unintended feature leakage in collaborative learning. In: 2019 IEEE symposium on security and privacy (SP). pp. 691-706. IEEE (2019) 2" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.128 + ], + "angle": 0, + "content": "S. Dibbo et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.204 + ], + "angle": 0, + "content": "47. Mireshghallah, F., Taram, M., Ramrakhyani, P., Jalali, A., Tullsen, D., Esmaeilzadeh, H.: Shredder: Learning noise distributions to protect inference privacy. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. pp. 3-18 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.787, + 0.243 + ], + "angle": 0, + "content": "48. Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrak, J., Krause, A.: Lazier than lazy greedy. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 29 (2015) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.243, + 0.787, + 0.271 + ], + "angle": 0, + "content": "49. Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM journal on computing 24(2), 227-234 (1995) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.271, + 0.787, + 0.298 + ], + "angle": 0, + "content": "50. Olshausen, B.A., Field, D.J.: Sparse coding of sensory inputs. Current opinion in neurobiology 14(4), 481-487 (2004) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.298, + 0.787, + 0.351 + ], + "angle": 0, + "content": "51. Olshausen, B.A., Field, D.J., et al.: Sparse coding of natural images produces localized, oriented, bandpass receptive fields. Submitted to Nature. Available electronically as ftp://redwood.psych.cornell.edu/pub/papers/sparse-coding.ps (1995) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.351, + 0.787, + 0.393 + ], + "angle": 0, + "content": "52. Paiton, D.M., Frye, C.G., Lundquist, S.Y., Bowen, J.D., Zarcone, R., Olshausen, B.A.: Selectivity and robustness of sparse coding networks. Journal of vision 20(12), 10-10 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.393, + 0.787, + 0.447 + ], + "angle": 0, + "content": "53. Peng, X., Liu, F., Zhang, J., Lan, L., Ye, J., Liu, T., Han, B.: Bilateral dependency optimization: Defending against model-inversion attacks. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 1358-1367 (2022) 2, 6, 7, 10, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.447, + 0.787, + 0.473 + ], + "angle": 0, + "content": "54. Rigaki, M., Garcia, S.: A survey of privacy attacks in machine learning. ACM Computing Surveys (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.473, + 0.787, + 0.514 + ], + "angle": 0, + "content": "55. Rozell, C.J., Johnson, D.H., Baraniuk, R.G., Olshausen, B.A.: Sparse coding via thresholding and local competition in neural circuits. Neural computation 20(10), 2526-2563 (2008) 2, 3, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.514, + 0.787, + 0.556 + ], + "angle": 0, + "content": "56. Salem, A., Bhattacharya, A., Backes, M., Fritz, M., Zhang, Y.: {Updates-Leak}: Data set inference and reconstruction attacks in online learning. In: 29th USENIX security symposium (USENIX Security 20). pp. 1291-1308 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.556, + 0.787, + 0.582 + ], + "angle": 0, + "content": "57. Sannai, A.: Reconstruction of training samples from loss functions. arXiv preprint arXiv:1805.07337 (2018) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.582, + 0.787, + 0.623 + ], + "angle": 0, + "content": "58. Sanyal, S., Addepalli, S., Babu, R.V.: Towards data-free model stealing in a hard label setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15284-15293 (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.623, + 0.787, + 0.676 + ], + "angle": 0, + "content": "59. Schneiderman, H.: Feature-centric evaluation for efficient cascaded object detection. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. vol. 2, pp. II-II. IEEE (2004) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.677, + 0.787, + 0.717 + ], + "angle": 0, + "content": "60. Song, L., Mittal, P.: Systematic evaluation of privacy risks of machine learning models. In: 30th USENIX Security Symposium (USENIX Security 21). pp. 2615-2632 (2021) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.718, + 0.787, + 0.759 + ], + "angle": 0, + "content": "61. Struppek, L., Hintersdorf, D., Correira, A.D.A., Adler, A., Kersting, K.: Plug & play attacks: Towards robust and flexible model inversion attacks. In: International Conference on Machine Learning. pp. 20522-20545. PMLR (2022) 1, 2, 4, 7, 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.759, + 0.787, + 0.8 + ], + "angle": 0, + "content": "62. Sun, B., Tsai, N.h., Liu, F., Yu, R., Su, H.: Adversarial defense by stratified convolutional sparse coding. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11447-11456 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.787, + 0.84 + ], + "angle": 0, + "content": "63. Teti, M., Kenyon, G., Migliori, B., Moore, J.: Lcanets: Lateral competition improves robustness against corruption and attack. In: International Conference on Machine Learning. pp. 21232-21252. PMLR (2022) 2, 5, 6, 7" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.265, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "64. Titcombe, T., Hall, A.J., Papadopoulos, P., Romanini, D.: Practical defences against model inversion attacks for split neural networks. arXiv preprint arXiv:2104.05743 (2021) 2, 4, 7, 8, 10, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "65. Vepakomma, P., Gupta, O., Swedish, T., Raskar, R.: Split learning for health: Distributed deep learning without sharing raw patient data. arXiv preprint arXiv:1812.00564 (2018) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.232, + 0.788, + 0.273 + ], + "angle": 0, + "content": "66. Wang, T., Zhang, Y., Jia, R.: Improving robustness to model inversion attacks via mutual information regularization. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 11666-11673 (2021) 2, 7, 10, 11, 12, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.273, + 0.788, + 0.314 + ], + "angle": 0, + "content": "67. Wang, X., Wang, W.H.: Group property inference attacks against graph neural networks. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. pp. 2871-2884 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.315, + 0.788, + 0.357 + ], + "angle": 0, + "content": "68. Wang, Y., Qian, H., Miao, C.: Dualcf: Efficient model extraction attack from counterfactual explanations. In: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency. pp. 1318-1329 (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.357, + 0.788, + 0.41 + ], + "angle": 0, + "content": "69. Wang, Z., Song, M., Zhang, Z., Song, Y., Wang, Q., Qi, H.: Beyond inferring class representatives: User-level privacy leakage from federated learning. In: IEEE INFOCOM 2019-IEEE conference on computer communications. pp. 2512-2520. IEEE (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.411, + 0.788, + 0.453 + ], + "angle": 0, + "content": "70. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.495 + ], + "angle": 0, + "content": "71. Wei, W., Liu, L., Loper, M., Chow, K.H., Gursoy, M.E., Truex, S., Wu, Y.: A framework for evaluating gradient leakage attacks in federated learning. arXiv preprint arXiv:2004.10397 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.495, + 0.788, + 0.522 + ], + "angle": 0, + "content": "72. Wu, P., Liu, J., Li, M., Sun, Y., Shen, F.: Fast sparse coding networks for anomaly detection in videos. Pattern Recognition 107, 107515 (2020) 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.522, + 0.788, + 0.55 + ], + "angle": 0, + "content": "73. Wu, Y., Yu, N., Li, Z., Backes, M., Zhang, Y.: Membership inference attacks against text-to-image generation models. arXiv preprint arXiv:2210.00968 (2022) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.55, + 0.788, + 0.605 + ], + "angle": 0, + "content": "74. Yang, Z., Zhang, J., Chang, E.C., Liang, Z.: Neural network inversion in adversarial setting via background knowledge alignment. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. pp. 225-240 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.606, + 0.788, + 0.647 + ], + "angle": 0, + "content": "75. Yuan, X., Ding, L., Zhang, L., Li, X., Wu, D.O.: Es attack: Model stealing against deep neural networks without data hurdles. IEEE Transactions on Emerging Topics in Computational Intelligence 6(5), 1258-1270 (2022) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.647, + 0.788, + 0.688 + ], + "angle": 0, + "content": "76. Zhang, J., Peng, S., Gao, Y., Zhang, Z., Hong, Q.: Apmsa: adversarial perturbation against model stealing attacks. IEEE Transactions on Information Forensics and Security 18, 1667-1679 (2023) 1" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.743 + ], + "angle": 0, + "content": "77. Zhang, Y., Jia, R., Pei, H., Wang, W., Li, B., Song, D.: The secret revealer: Generative model-inversion attacks against deep neural networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 253-261 (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.744, + 0.788, + 0.8 + ], + "angle": 0, + "content": "78. Zhong, D., Sun, H., Xu, J., Gong, N., Wang, W.H.: Understanding disparate effects of membership inference attacks and their countermeasures. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security. pp. 959-974 (2022) 1" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.8 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_origin.pdf b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6c3140e549ba2664df3edb58064fa2c3d8cab84a --- /dev/null +++ b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/3f6a5614-7bc7-4942-afa1-026b6728b68d_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ffcc3dbd19bab7a174611ee8908c5b0235658f87796c1834d10c676279397aad +size 5798378 diff --git a/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/full.md b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/full.md new file mode 100644 index 0000000000000000000000000000000000000000..0d8c793b1ba5a5f9ebd600f05cdb454088faa544 --- /dev/null +++ b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/full.md @@ -0,0 +1,299 @@ +# Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures + +Sayanton V. Dibbo $^{1,2}$ , Adam Breuer $^{1}$ , Justin Moore $^{2}$ , and Michael Teti $^{2}$ + +$^{1}$ Dartmouth College, Hanover, NH 03755, USA + +$^{2}$ Los Alamos National Laboratory, Los Alamos, NM 87545, USA + +{f0048vh,adam.breuer}@dartmouth.edu + +{jmoore01,mteti}@lanl.gov + +Abstract. Recent model inversion attack algorithms permit adversaries to reconstruct a neural network's private and potentially sensitive training data by repeatedly querying the network. In this work, we develop a novel network architecture that leverages sparse-coding layers to obtain superior robustness to this class of attacks. Three decades of computer science research has studied sparse coding in the context of image denoising, object recognition, and adversarial misclassification settings, but to the best of our knowledge, its connection to state-of-the-art privacy vulnerabilities remains unstudied. In this work, we hypothesize that sparse coding architectures suggest an advantageous means to defend against model inversion attacks because they allow us to control the amount of irrelevant private information encoded by a network in a manner that is known to have little effect on classification accuracy. Specifically, compared to networks trained with a variety of state-of-the-art defenses, our sparse-coding architectures maintain comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions by factors of 1.1 to 18.3 across a variety of reconstruction quality metrics (PSNR, SSIM, FID). This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug- $\mathcal{E}$ -Play attacks. We provide a cluster-ready PyTorch codebase to promote research and standardize defense evaluations. + +Keywords: Model Inversion Attack, Defense, Privacy Attacks, Sparse Coding. + +# 1 Introduction + +The popularization of machine learning has been accompanied by the widespread use of neural networks that were trained on private, sensitive, and proprietary datasets. This has given rise to a new generation of privacy attacks that seek to infer private information about the training dataset simply by inspecting the representation of the training data that remains encoded in the model's parameters [11, 15, 16, 20, 21, 31, 35, 41, 45, 58, 61, 68, 75, 76, 78]. + +Of particular concern is a devastating stream of privacy attacks known as model inversion. Model inversion attacks leverage the network's parameters or + +classifications in order to reconstruct entire images or data that were used to train the network. Early work on model inversion focused on a white-box setting where the attacker has unfettered access to the model or auxiliary information about the training data [20,30,69,71,77]. However, recent work has shown that standard network architectures are vulnerable to model inversion attacks even when attackers have no knowledge of the model's architecture or parameters, and only have access to the model's classifications or its intermediate outputs, such as leaked outputs from a single hidden network layer [5,22,45,46,56,74]. + +Are different network architectures robust to model inversion attacks? + +Such attacks are feasible because each hidden layer of a standard network architecture captures a detailed representation of the training data. It is well-known that standard dense layers exhibit a tendency to memorize their inputs [10, 23, 54], so even a minimal leak of a network's class distribution output or a leak of its intermediate outputs from a single layer is often sufficient to train an inverse mapping for data reconstruction. More concretely, state-of-the-art inversion attacks work by submitting externally obtained images to the model, observing leaked outputs, then using this data to train a new 'inverted' neural network that reconstructs (predicts) an input image given a leaked output. This can be accomplished either directly via SGD, or by optimizing a GAN, and we consider both approaches here. Such attacks on standard network architectures can reconstruct private training images that are clearly recognizable by humans familiar with the training data [4, 18, 22, 26, 30, 33, 61, 71, 74]. + +Recent work has pursued a diverse array of defense strategies to mitigate these attacks. For example, [22] augments the training dataset with GAN-generated fake samples designed to inject spurious features into the trained network that mislead the gradients computed during inversion attacks. In contrast, multiple recent defenses add regularization terms during training that attempt to penalize training data memorization [53, 66]. Other recent defenses noise the network weights to obfuscate memorized data [2,47,64], or noise and clip training gradients via DP-SGD [25]. All such approaches are costly: data augmentation-based defenses entail the computational burden of building a GAN and applying sophisticated parameter tuning techniques during training; regularization-based defenses explicitly trade away classification accuracy for less memorization, and noise-based defenses are also known to impose significant accuracy costs. Until very recently, there were no known provable guarantees for model inversion defenses, and the current best-known guarantees require a DP-SGD-based training algorithm that imposes a significant computational burden and accuracy loss to obtain privacy guarantees that are impractically weak for these attacks [25]. + +Very little is known about how a network's architecture contributes to its robustness (or vulnerability). This is surprising since throughout three decades of research in other domains such as image denoising [3, 6, 9, 12, 19, 39, 50, 55], object recognition [24, 36, 51, 59], and adversarial misclassification [17, 37, 52, 62, 63], researchers seeking to control their model's representations of the data have heavily studied sparse coding-based architectures that prune unnecessary details and preserve only the information that is essential to the model objective. + +Specifically, sparse coding seeks to approximately represent an image (or layer) with only a small set of basis vectors selected from an overcomplete dictionary [9, 19, 50]. While it is well-known that computing a sparse representation using a standard objective function is NP-hard in general [14, 32, 49], we now benefit from fast approximation algorithms that efficiently compute high-quality sparse representations [8, 13, 32, 36, 39, 40, 48, 55]. Sparse coding architectures leverage this technique by inserting a sparse network layer after a dense layer, such that the sparse layer reduces the dense layer's outputs to a sparse representation. + +To our knowledge, sparse coding architectures have not been studied in the context of model inversion or privacy attacks. However, they suggest an advantageous means to prevent such attacks because they control the amount of irrelevant private information encoded in a model's intermediate representations in a manner that is known to have little effect on its accuracy, that can be computed efficiently during training, and that adds little to the trained model's overall parameter complexity. Put simply, sparsifying a network's representations is a natural means to preclude memorization of detailed information about its inputs that is unnecessary to obtain high accuracy, so even an idealized 'perfect attacker' could only hope to recover a sparsified, un-detailed training image. + +Main contribution. We begin by showing that an off-the-shelf sparse coding preprocessing step offers performance advantages compared to state-of-the-art data augmentation, regularization, and noise based defenses in terms of robustness to model inversion attacks. We then refine this idea into a network architecture that achieves superior performance. Our main result is a novel sparse-coding architecture, SCA, that is robust to state-of-the-art model inversion attacks. + +SCA is defined by pairs of alternating sparse coded and dense layers that jettison unnecessary private information in the input image and ensure that downstream layers do not e.g., reconstruct this information. We show that SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than 8 state-of-the-art data augmentation, regularization, and noise-based defenses in terms of PSNR and FID metrics and 1.1 to 720 times more in terms of SSIM. This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug-ε Play attacks. SCA's defense performance is also more stable than baselines across multiple runs. We emphasize that, unlike recent state-of-the-art defenses that require sophisticated parameter tuning to perform well, SCA obtains these results absent parameter tuning (i.e., using default sparsity parameters) because sparse coding naturally precludes networks from memorizing detailed representations of the training data. + +More broadly, our results show a deep connection between state-of-the-art ML privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. We provide a comprehensive cluster-ready PyTorch codebase to promote research and standardize defense evaluation. + +# 2 Threat models + +We consider three threat models that span the diverse range of powerful and well-informed attackers considered in recent work. We emphasize that a defense that performs well in all three settings provides strong evidence of its privacy protections under weaker, more realistic threat models with real-world attackers. + +1. Plug- & Play threat model [61]. Plug- & Play attacks are considered the most performant recent attacks. These attacks optimize the intermediate representation of StyleGAN's input vectors so that generated images maximize the target network's class prediction probability, which the attacker can query. +Separately, recent theoretical work on model inversion emphasizes that a strong threat model should capture 'worst-case' attackers with direct access to the information-rich, high-dimensional intermediate outputs of the target model that store private information about the training data, as well as ideal training data examples for training an inverted model [1, 25]. We consider two variants: +2. End-to-end threat model. We consider an attacker with access to all of the last hidden layer's raw, high-dimensional outputs, as well as a large number of ideal training data examples drawn from the true training dataset [60, 67]. +3. Split network threat model (Federated Learning). We also consider the split network threat model described by [64]. There has been much recent interest in Federated Learning architectures that split the network across multiple agents [7, 18, 26, 38, 44], particularly for privacy-fraught domains such as medicine where legal requirements limit data sharing [34, 65]. These architectures are known to be susceptible to model inversion attacks, [18, 26, 64], and defenses are urgently needed. This threat model also allows us to capture a different view of a 'worst-case' threat model: Model inversion attacks are known to be more effective when the attacker has access to outputs from earlier layers that may exhibit a more direct representation of the input images [26]. To capture this 'worst-case', we consider the setting where the attacker has access to raw intermediate outputs from the first linear network layer. As before, we also assume the attacker has access to ideal training data examples drawn from the actual training datasets. Appendix B provides additional details about the model inversion threat models. + +# 3 SCA architecture + +We now describe the SCA architecture, which is defined by alternating pairs of Sparse Coding Layers (SCL) and dense layers, followed by downstream linear and/or convolutional layers. + +Sparse Coding Layer (SCL). Sparse coding converts raw inputs to sparse representations where only a few neurons whose features are useful in reconstructing the inputs are active. Our Sparse Coding Layer (SCL) performs sparse coding to obtain a sparse representation of a previous dense layer's representation (if the SCL is not the first layer in the network) or of the inputs (if the SCL is the first layer in the network). Fig. 1 illustrates the working principle of SCL. + +Formally, each SCL performs a reconstruction minimization problem to compute the sparse representation of its inputs (either a previous layer's representation or of the inputs to the network). Suppose the input to a (2D convolutional) SCL is $\mathcal{X} \in \mathbb{R}^{\mathcal{C} \times \mathcal{H} \times \mathcal{W}}$ with $\mathcal{H}$ height, $\mathcal{W}$ width, and $\mathcal{C}$ channels/features. The goal is to find the sparse representation $\mathcal{R}_x \in \mathbb{R}^{\mathcal{F} \times [\mathcal{H} / S_h] \times [\mathcal{W} / S_w]}$ , where $\mathcal{R}_x$ has few active neurons and corresponds to a denoised version of the input $\mathcal{X}$ , and $S_w$ and $S_h$ indicate convolutional strides across the width and height of + +the input, respectively. $F$ is the number of convolutional features in the SCL layer's dictionary, $\Omega \in \mathbb{R}^{\mathcal{F}\times \mathcal{C}\times \mathcal{H}_f\times \mathcal{W}_f}$ , where $\mathcal{H}_f$ and $\mathcal{W}_f$ are the height and width of each convolutional feature, respectively. Per Figure 1, the sparse coding layer starts with its input, $\mathcal{X}$ , and dictionary of features, $\Omega$ , to produce $\mathcal{R}_x$ by solving the following sparse reconstruction problem: + +$$ +\min _ {\mathcal {R} _ {x}} \frac {1}{2} | | \mathcal {X} - \mathcal {R} _ {x} * \Omega | | _ {2} ^ {2} + \lambda | | \mathcal {R} _ {x} | | _ {1} \tag {1} +$$ + +where the first term represents how much information is preserved about $\mathcal{X}$ by $\mathcal{R}_x$ by measuring the difference between $\mathcal{X}$ and its reconstruction, $\mathcal{R}_x\circledast \varOmega$ , computed with a transpose convolution, $\otimes$ . The second term measures how sparse $\mathcal{R}_x$ is, and $\lambda$ is a constant which determines the trade-off between reconstruction fidelity and sparsity. Equation 1 is convex in $\mathcal{R}_x$ , meaning we will always find the optimal $\mathcal{R}_x$ that solves Equation 1. + +Among different techniques to perform sparse coding, we leverage the commonly used Locally Competitive Algorithm (LCA) [55]. LCA implements a recurrent network of leaky integrate-and-fire neurons that incorporates the general principles of thresholding and feature-similarity-based competition between neurons to solve Equation 1. While Rozell introduced LCA in the non-convolutional setting, it can be readily adapted to the convolutional setting (see Appendix A.2 for details). Specifically, each LCA neuron has an internal membrane potential $\mathcal{P}$ which evolves per the following differential equation: + +$$ +\dot {\mathcal {P}} (t) = \frac {1}{\tau} [ \varPsi (t) - \mathcal {P} (t) - \mathcal {R} _ {x} (t) * \mathcal {G} ] \tag {2} +$$ + +where $\tau$ is a time constant, $\varPsi(t) = \mathcal{X}*\varOmega$ is the neuron's bottom-up drive from the input computed by taking the convolution, *, between the input, $\mathcal{X}$ , and the dictionary, $\varOmega$ , and $-\mathcal{P}(t)$ is the leak term [37, 63]. Lateral competition between neurons is performed via the term $-\mathcal{R}_x(t)*\mathcal{G}$ , where $\mathcal{G} = \varOmega*\varOmega - I$ is the similarity between each feature and the other $\mathcal{F}$ features $(-I$ prevents + +![](images/9c5132ada9872d483f724063575af906102ea307e638abacd8c3f50ea6c4abd0.jpg) +Fig.1: Pipeline of neuron (membrane potential) dynamics in Sparse Coding Layer (SCL) with lateral competitions. + +self interactions). $\mathcal{R}_x$ is computed by applying soft threshold activation $T_{\lambda}(x) = \mathrm{relu}(x - \lambda)$ to the neuron's membrane potential, which produces nonnegative, sparse representations. Overall, this means that in LCA neurons will compete to determine which ones best represent the input, and thus will have non-zero activations in $\mathcal{R}_x$ , the output of the SCL that is passed to the next layer. + +SCA architecture. The SCA architecture is defined by the use of multiple pairs of sparse coding and dense (batch norm) layers after the input image, which can then be followed by other (linear, convolutional) layers. Fig. 2 illustrates this design principle. The key intuition is that the first sparse layer jettisons unnecessary private informa + +![](images/af45de9a91e29a556ffbc64b7015b1ecae77016bd82a9cfe4e6c55b6b7c51f5b.jpg) +Fig. 2: Architecture of SCA. + +tion in the input image. Then, by alternating sparse-dense pairs of layers, we ensure that unnecessary information is also jettisoned from downstream layers. In this manner, downstream layers also do not convey unnecessary private information to the adversary, and they also do not e.g. learn to reconstruct private information jettisoned by the first sparse layer. In short, previous defenses work by trying to mislead attackers by pushing model features in a wrong direction, either randomly via noise or strategically via adversarial examples, or by disincentivizing memorization during training. In contrast, SCA directly removes the unnecessary private information. Training SCA is identical to training a standard network with one exception: after each backprop updates non-sparse layers, we perform a fast update on the sparse layers, except for the first sparse layer that sparse-codes the image input.3 + +SCA training complexity & large scale applications. While we focus on the neuron lateral competition approach to sparse coding as it is practically convenient and well-represented in recent work [63], we note that for large-scale machine learning applications, we now have practical parallel algorithms that learn the sparse coding dictionary near-optimally w.p. in parallel time (adaptivity) that is logarithmic in the size of the data [8, 13, 32]. Fast single-iteration heuristics are also available (see e.g. [72]). Thus, even for large-scale applications, computing sparse representations while training SCA adds little computational overhead compared to sophisticated optimization-based techniques necessary for recent defenses [22]. In practice, even our basic sparse coding research implementations (see Section 4 and Appendix A.3) are slightly faster than optimized Torch implementations of the best-performing recent defense [53]. + +# 4 Experiments + +xOur goal in this section is to show that SCA performs well compared to state-of-the-art defenses as well as practical defenses used in leading industry models in terms of both classification accuracy and various reconstruction quality metrics. To evaluate its performance comprehensively, we test all combinations of 5 diverse datasets, 3 threat models, 9 defense baselines, plus multiple runs-per-experiment and various sparsity parameters $\lambda$ . See Appendix A.1-A.6. + +Five benchmark datasets. We test our performance on all 5 diverse datasets used to benchmark model inversion attacks across the recent literature: CelebA, hi-res RGB faces, Medical MNIST medical images, CIFAR-10 hi-res RGB objects, MNIST grayscale digits, and Fashion MNIST grayscale objects. + +Three attacks. For each dataset, we conduct three sets of experiments corresponding to our three threat models. First, we test SCA and baselines' defenses against a state-of-the-art Plug- $\mathcal{E}$ -Play attack [61] that leverages StyleGAN3 to obtain high-quality reconstructions. Second, we compare SCA networks to a variety of baselines in terms of their robustness to a state-of-the-art end-to-end network attack that leverages leaked raw high-dimensional outputs from the networks' last hidden layer, as well as held-out training data drawn from the true training dataset. This allows us to assess SCA's defenses in a realistic setting with a well-informed adversary. Our third set of experiments tests performance in a split network setting of [64] where the attacker has access to leaked raw outputs from the first linear network layer. Robustness in this setting is desirable because model inversion attacks are known to be more effective on earlier hidden layers [26], and also because an algorithm that is robust to such attacks would be an effective defense under novel security paradigms such as Federated Learning, which is vulnerable to inversion [64] (see Appendix A.5). + +Nine defense baselines. We compare SCA to 9 baselines plus extra variants, including SOTA defenses and practical defenses used in leading industry models: + +- No-Defense. The baseline target model with no added defenses. +- Hayes et al. [25]. We train a DP-SGD defense that noises and clips gradients during training. This is the only defense with provable guarantees. +- Gong et al. [22]. We train the very recent defense from [22] that uses sophisticated tuning and two types of GAN-generated images. We also try a ‘++’ version that adds extra Continual Learning accuracy optimizations. +- Peng et al. [53]. We train the Bilateral Dependency defense that adds a loss function for redundant input memorization during training. +- Wang et al. [66]. We train a Mutual Information Regularization defense that penalizes dependence between inputs and outputs during training. +- Titcombe et al. [64]. We train a state-of-the-art Laplace $\mathcal{L}(\mu = 0, b = 0.5)$ noise defense as in [64]. We also try more noise—see Appendix D. +- Sparse-Standard. We train an off-the-shelf sparse coding architecture [63] with 1 sparse layer after the input image via lateral competition as in SCA. + +- GAN [common industry defense]. We train a GAN for 25 epochs to generate fake samples, then train the target model with both original and GAN-generated samples. This defense is frequently used in industry. +- Gaussian-Noise [common industry defense]. We draw noises from $\mathcal{N}(\mu = 0, \sigma = 0.5)$ and inject them into intermediate dense layers post-training. + +SCA without parameter tuning. In all experiments, we consider the simplest case of SCA architecture that contains SCA's alternating sparse-and-dense layer pairs followed by only linear layers. We note that adding downstream convolutional layers or more sophisticated downstream architectures is certainly possible, though we avoid this here in order to compare the essence of the SCA approach to the baselines. Appendix A.4 describes SCA details. In the split network setting, we are careful to use slightly shallower SCA architectures with fewer linear layers to match the split network experiments of [64]. + +Recent state-of-the-art defenses such as GAN-based defenses require sophisticated automatic parameter tuning techniques such as focal tuning and continual learning to obtain high performance [22]. To test whether SCA can be effective absent parameter tuning, we just run SCA with sparsity parameter $\lambda$ set to 0.1, 0.25, or 0.5—the default values from various sparse coding contexts. + +Performance metrics. We evaluate attackers' reconstructions using multiple standard metrics. Let $X_{in}^{*}$ denote the reconstruction of training image $X_{in}$ . Then: + +- Peak signal-to-noise ratio (PSNR) [lower=better]. PSNR is the ratio of max squared pixel fluctuations from $X_{in}$ to $X_{*in}$ over mean squared error. +- Structural similarity (SSIM) [70] [lower=better]. SSIM measures the product of luminance distortion, contrast distortion, & correlation loss: $SSIM(X_{in},X_{in}^{*}) = l_{dis}(X_{in},X_{in}^{*})c_{dis}(X_{in},X_{in}^{*})c_{loss}(X_{in},X_{in}^{*})$ . +- Fréchet inception distance (FID) [28] [higher=better]. FID measures reconstruction quality as a distributional difference between $X_{in}$ and $X_{in}^{*}$ : + +$$ +F I D ^ {2} (X _ {i n}, X _ {i n} ^ {*}) = | | \mu_ {X _ {i n}} - \mu_ {X _ {i n} ^ {*}} | | ^ {2} + T r (\mathrm {C o} _ {X _ {i n}} + \mathrm {C o} _ {X _ {i n} ^ {*}} - 2 * \sqrt {\mathrm {C o} _ {X _ {i n}} \cdot \mathrm {C o} _ {X _ {i n} ^ {*}}}) +$$ + +Target model. We focus on privacy attacks on linear networks because they capture the essence of the privacy attack vulnerability [20, 29], and because there is broad consensus that a principled understanding of their emerging privacy (and security) vulnerabilities4 is urgently needed [27, 42, 57, 73]. + +PyTorch codebase, replicability, and evaluation standardization. For all experiments, we consider the standard train test split of $70\%$ and $30\%$ . After training each defense model, we run attacks to reconstruct the entire training set and compare reconstruction performance. We run all the experiments on a standard industry production cluster with 4 nodes and DELL Tesla V100 GPUs with 40 cores. We provide a cluster-ready PyTorch codebase on our project page at: https://sayantondibbo.github.io/SCA. + +# 4.1 Experimental results overview + +Defense. Across the 3 attack settings and 5 datasets, SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than the 9 baselines in terms of PSNR & FID, and 1.1 to 720 times more in terms of SSIM. This performance gap exceeds the scale of improvements made by recent algorithms. SCA's defense is also more stable than baselines across multiple runs. This is because unlike for baselines, even an idealized 'perfect attacker' can only hope to recover a sparsified, un-detailed training image from SCA. We show results here for the 2 most privacy-sensitive datasets of medical images and CelebA in 3 threat models, and defer the 9 other {dataset, attack} combinations to Appendix C. + +Accuracy. Typically, obtaining greater defense means trading away accuracy. However, in 6 of the 15 experiments (MNIST + FashionMNIST) × (Plug & Play + end-to-end + split networks), SCA outperforms no-defense and all baselines' accuracy. SCA also outperforms all baselines' accuracy on CelebA in Plug & Play, and a sparse approach is within 0.003 of the best accuracy on an 8th experiment. No other single SOTA baseline wins on accuracy this consistently. We emphasize that unlike baselines that do accuracy hyperparameter tuning, we obtain this result absent any such tuning. SCA drops accuracy on MedMNIST (which is the most imbalanced & has fewest training examples). However, tuning of SCA (kernel size $5 \rightarrow 7$ ) improves SCA's accuracy on MedMNIST in Table 3 from $94.6\%$ to $97\%$ —See Appendix G and Table 12. + +# Results of experiments set 1: Plug- $\mathcal{E}$ -Play attack. + +Qualitative evaluations. Fig. 3 shows hi-res CelebA reconstructions generated by Plug- & Play under various defenses. To avoid cherry-picking, Fig. 3 shows the 3 images with the highest (top row), median (middle), and lowest (bottom) PSNR reconstructions under No-Defense. Note that reconstructions under SCA totally differ from actual images (different race, hair, gender, child/adult), while those of other defenses are closer to actual images, indicating privacy leakage. + +Metric evaluations. Table 1 reports reconstruction quality measures and accuracy for SCA and other baselines in the Plug- & Play attack [61] setting (lower rows = better defense performance). In terms of PSNR and SSIM, training data + +![](images/3e99c4b68bfd36bc0fecfcb6f48b078f8ac657fe6145dad9b1479f237c8d35b0.jpg) +Fig. 3: Experiments set 1: Qualitative comparisons among actual and reconstructed images (Plug- & Play Attack [61]) under SCA & baselines on hi-res CelebA dataset. + +Table 1: Experiments set 1: Performance comparison under Plug- &-Play attack [61] setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images. + +
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE11.350.718256.40.779
GAUSSIAN-NOISE10.390.604264.80.644
GAN10.150.613289.70.635
Titcombe et al. [64]10.180.636304.10.654
Gong et al. [22]++10.020.556381.50.672
Gong et al. [22]10.110.595350.50.614
Peng et al. [53]9.900.514402.80.728
Hayes et al. [25]9.920.556383.70.621
Wang et al. [66]9.850.527402.80.742
SPARSE-STANDARD9.840.539374.70.728
SCA0.19.790.451391.90.726
SCA0.259.450.442411.00.739
SCA0.59.400.440412.60.723
MedicalNo-DEFENSE22.040.396196.10.998
MNISTGAUSSIAN-NOISE21.830.382209.40.862
GAN21.770.427219.00.998
Gong et al. [22]++21.500.359273.10.894
Titcombe et al. [64]21.680.360286.30.899
Gong et al. [22]21.750.477249.10.770
Peng et al. [53]21.820.381268.30.927
Hayes et al. [25]21.720.337259.70.823
Wang et al. [66]21.710.322211.70.937
SPARSE-STANDARD20.970.086239.30.907
SCA0.121.190.057253.50.888
SCA0.2521.170.075280.10.882
SCA0.520.060.055288.80.881
+ +reconstructions under the least sparse version SCA0.1 are degraded by factors of 1.01 to 6.7 and 1.01 to 5.6 compared to the regularization defenses of Peng et al. [53] and Wang et al. [66], respectively. Increasing SCA's sparsity $\lambda$ to 0.5 widens the performance gap, increasing these factors to 1.1 to 6.9 and 1.02 to 5.9, respectively, and making SCA outperform baselines' FID. SCA0.1 also outperforms the noise-based approaches of Hayes et al. [25] and Titcombe et al. [64] on all metric by factors of 1.01 to 5.9 and 1.02 to 6.3. Increasing SCA's sparsity $\lambda$ to 0.5 increases these factors to 1.1 to 6.1 and 1.1 to 6.5. Finally, SCA0.1 outperforms the data augmentation defense of [22] by factors of 1.01 to 8.4, which widens to 1.1 to 8.7 for SCA0.5. All baselines also outperform common GAN and Noise-based industry defenses. + +Basic SPARSE-STANDARD outperforms SOTA baselines. Our basic SPARSE-STANDARD baseline outperforms the best baselines' PSNR on both CelebA and Medical MNIST, and also outperforms baselines' SSIM on the latter. SCA0.5 then outperforms SPARSE-STANDARD on all metrics, obtaining SSIM and FID that are better by factors of 1.2 to 1.6 and 1.1 to 1.2, respectively, and slightly better PSNR. Thus, while SPARSE-STANDARD offers an inferior defense vs. SCA, it still offers a fast practical defense for less privacy-critical domains. + +![](images/f41bb87f1fc271c026759beeabb2087269fa4650f645a79d5a5360172bddcfe4.jpg) +Fig. 4: Experiments set 2: Qualitative comparisons among actual & reconstructed images (end-to-end setting) under SCA & baselines on the Medical MNIST dataset. + +Table 2: Experiments set 2: Performance comparison in end-to-end setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images. + +
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.260.262201.80.773
GAUSSIAN-NOISE16.080.262220.40.638
GAN13.550.133199.60.668
Titcombe et al. [64]15.130.191197.70.695
Gong et al. [22]++13.100.032204.80.704
Gong et al. [22]13.150.119199.60.682
Peng et al. [53]13.780.141218.80.716
Hayes et al. [25]14.100.004199.00.664
Wang et al. [66]13.630.0011203.20.744
SPARSE-STANDARD13.090.002222.10.749
SCA0.112.890.004228.50.748
SCA0.2512.730.004218.80.737
SCA0.512.420.001231.90.741
MedicalNo-DEFENSE31.480.93510.660.998
MNISTGAUSSIAN-NOISE30.460.92012.230.862
GAN27.340.48033.770.998
Gong et al. [22]++18.370.35381.520.894
Titcombe et al. [64]21.330.43130.600.899
Gong et al. [22]21.520.43664.880.770
Peng et al. [53]19.050.420107.90.908
Hayes et al. [25]18.480.007150.90.824
Wang et al. [66]20.480.54930.010.946
SPARSE-STANDARD14.790.119250.60.907
SCA0.113.430.004352.10.888
SCA0.2512.320.004375.90.882
SCA0.512.040.003369.90.881
+ +# Results of experiments set 2: End-to-end networks. + +Qualitative evaluations. Fig. 4, shows Medical MNIST reconstructions in the end-to-end threat model. SCA's reconstructions are visually destroyed (esp. SCA0.5), whereas baselines admit noisy-but-recognizable reconstructions. + +Metric evaluations. Table 2 reports performance in the end-to-end network setting. In this setting, SCA's performance advantage widens. In terms of PSNR & FID, training data reconstructions under SCA0.1 are degraded by factors of 1.1 to 3.3 and 1.1 to 11.7 compared to Peng et al. [53] and Wang et al. [66], respectively (but slightly worse SSIM vs. Wang et al. on CelebA). On all metrics, SCA0.1 outperforms Hayes et al. [25] and Titcombe et al. [64] by factors of 1.1 to 2.4 and 1.1 to 107.7, respectively. SCA0.1 also outperforms Gong et al. [22] by factors of 1.01 to 109. Increasing SCA's $\lambda$ to 0.5 causes it to outperform the same baselines on all metrics by factors of 1.2 to 141 [53], 1.2 to 183 [66], 1.2 to 4.0 [25], 1.2 to 191 [64], and 1.1 to 145.3 [22], respectively. + +Stability of SCA's defense vs. baselines. SCA's performance is also as stable or more stable than baselines' performance over multiple runs. For example, Fig. 5a plots the means & std. devs. of SCA & baselines' per-run FID (the standard metric for faces) over multiple runs for CelebA faces in the Plug-&Play setting, and Fig. 5b plots this for PSNR (the standard metric for grayscale images) on Medical MNIST in the end-to-end setting. SCA obtains better performance while also exhibiting stability of defense performance on par with the best baseline (and better stability than most baselines). See Appendix E. + +![](images/73baedd6e5fade9e25c13bea6a92653847b1aff9700ec4078cff83d0bbdc6cbb.jpg) +(a) FID↑↑ for CelebA faces under Plug- &-Play + +![](images/95de7c01f440dadfef6ff2f9c540a44c1567ae447a145a95cd2e5539bfb34b3c.jpg) +(b) PSNR $\downarrow \downarrow$ for Med.MNIST, end-to-end setting +Fig. 5: Stability of SCA & baselines' defense performance (mean ± std. dev.) of PSNR and FID across multiple runs on CelebA and Medical MNIST. + +SCA's sparsity vs. performance. We also try varying SCA's and SPARSE-STANDARD's sparsity parameters $\lambda$ and recompute PSNR, SSIM, FID, and accuracy. Appendix A.6 shows that for each $\lambda$ and defense metric, SCA significantly outperforms the off-the-shelf SPARSE-STANDARD architecture for a small accuracy cost. Thus, for a given $\lambda$ with SPARSE-STANDARD, we can use a (smaller) $\lambda$ with SCA to obtain better reconstruction and higher or equal (within 0.0017) accuracy. SCA is also amenable to more sophisticated tuning (and performance improvements) by tuning different $\lambda$ per sparse layer (e.g., by having a sparser representation of inputs but less sparse reductions of downstream layers). We avoid such tuning here as it is unnecessary for good performance. + +Table 3: Experiments set 3: Performance comparison in split network setting (lower rows=better defense) on hi-res CelebA faces and sensitive Medical MNIST images. + +
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.490.302185.80.766
GAUSSIAN-NOISE15.440.227191.10.753
GAN15.570.253176.70.646
Titcombe et al. [64]14.990.144194.20.725
Gong et al. [22]++15.060.038190.50.756
Gong et al. [22]15.650.044185.80.653
Peng et al. [53]16.230.211198.60.717
Hayes et al. [25]15.060.005178.80.672
Wang et al. [66]14.820.173189.60.652
SPARSE-STANDARD15.390.009187.00.746
SCA0.115.050.005178.70.745
SCA0.2514.760.003191.10.743
SCA0.514.710.003206.10.739
MedicalNo-DEFENSE23.470.77645.570.993
MNISTGAUSSIAN-NOISE21.930.72244.720.811
GAN21.670.71948.490.912
Gong et al. [22]++21.070.57367.530.931
Titcombe et al. [64]21.350.70448.820.961
Gong et al. [22]21.330.72041.740.925
Peng et al. [53]18.980.426124.80.914
Hayes et al. [25]21.460.442137.40.850
Wang et al. [66]20.030.53865.170.986
SPARSE-STANDARD15.330.149142.40.955
SCA0.113.950.008244.90.946
SCA0.2512.310.008255.30.928
SCA0.512.270.001285.30.909
+ +Results of experiments set 3: Split networks. Table 3 reports performance in the split network setting. As expected, all baselines and SCA perform slightly worse in this threat model compared to the end-to-end model (aside from Guussian and GAN heuristics). On all metrics, SCA's performance advantage remains consistent: SCA0.5 outperforms all baselines by factors of 1.1 to 720. + +# 5 Empirical analysis of sparse coding robustness to attack + +Sparse-coding layers' robustness to privacy attacks can be observed empirically. Consider that the attacker trains the attack to map leaked raw hidden layer outputs back to input images. Attacks are thus highly dependent on these outputs' distributions. Recall that UMAP projections compute a 2D visualization of the global structure of distances between different training images' features according to a particular layer [43]. Fig. 6 plots UMAP 2D projections of linear layer feature distributions of training inputs after either two linear layers (Figs. 6a & 6d), two convolutional layers (Figs. 6b & 6e), or two sparse coding layers (with + +![](images/36de78561fc165c552b31f3ad0d1db2770c5f9606ab12f031ab0cdc2559a5385.jpg) + +![](images/432952cf9845c99024cda318deb34d95a20a8385a78f824c05ec59ac85c16fa8.jpg) +(a) Linear Layer +(d) Linear Layer +Fig. 6: UMap 2D projections of input images' features by class after 2 linear layers, 2 conv. layers, or 2 sparse-coded layers on MNIST (top) & Fashion MNIST (bottom). + +![](images/e1c2839ff13b4464bcd48ad24ad15df4d1d73227e8174f5283158820fbd72dbf.jpg) +(b) Convolution Layer + +![](images/ff994be2ab1f47a42bb3fb9a1523ae9f5cd98c26eb9a1a348d343d15ba6ce876.jpg) +(e) Convolution Layer + +![](images/f9e02e5cdbd86db0688faa3bac4351a8a6a61aba1102fe7c5170c91d318a3b3b.jpg) +(c) Sparse Coding Layer + +![](images/19f77c591b9aea094788fb133db4f5060e6be1c9729cfb891f1aabab79875f25.jpg) +(f) Sparse Coding Layer + +interspersed dense layers - Figs. 6c & 6f). Importantly, observe that after two linear or two convolutional layers, points are clustered by color, i.e., input images' features are highly clustered by label. This class-clustered property leaves such layers vulnerable to model inversion attacks, as an attacker can 'home in on' examples from a specific class. In contrast, the goal in sparse coding is not to optimize the classification objective by separating classes, but rather to jettison unnecessary information. Here, this means that unnecessary information is jettisoned both from the input image and also the downstream dense layer. Per Figs. 6c & 6f, this tends to 'uncluster' remaining non-sparsified features of training examples from the same class, making it much harder for an attacker to compute informative gradients to home in on a training example. + +# 6 Discussion & Conclusion + +In this paper, we have provided the first study of sparse coding-based neural network architectures that are robust to model inversion attacks. Specifically, we have shown that the natural properties of sparse coded layers can control the extraneous private information about the training data that is encoded in a network without resorting to complex and computationally intensive parameter tuning techniques. Our work reveals a deep connection between state-of-the-art privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. Currently, our basic research implementation of SCA achieves compute times that in the worst-case are no better than some SOTA baselines (see Appendix F). However, given the rich theoretic body of work on fast algorithms and provable guarantees for sparse coding, we believe these aspects are opportune areas for future improvements. + +# Acknowledgements + +We are grateful for generous support from OpenAI, as well as the Dartmouth College Cybersecurity Cluster Research. This work was partially funded by the Center for Nonlinear Studies and the Information Science and Technology Institute's Cyber Security Summer School at Los Alamos National Laboratory, as well as an award from the Department of Energy's Advanced Scientific Computing Research program (#77902). + +# References + +1. Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security. pp. 308-318 (2016) 4 +2. Abuadbba, S., Kim, K., Kim, M., Thapa, C., Camtepe, S.A., Gao, Y., Kim, H., Nepal, S.: Can we use split learning on 1d cnn models for privacy preserving training? In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security. pp. 305-318 (2020) 2 +3. Ahmad, S., Scheinkman, L.: How can we be so dense? the benefits of using highly sparse representations. arXiv preprint arXiv:1903.11257 (2019) 2 +4. Aïvodji, U., Gambs, S., Ther, T.: Gamin: An adversarial approach to black-box model inversion. arXiv preprint arXiv:1909.11835 (2019) 2 +5. An, S., Tao, G., Xu, Q., Liu, Y., Shen, G., Yao, Y., Xu, J., Zhang, X.: Mirror: Model inversion for deep learning network with high fidelity. In: Proceedings of the 29th Network and Distributed System Security Symposium (2022) 2 +6. Barlow, H.B.: The coding of sensory messages. Current problems in animal behavior (1961) 2 +7. Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Konečny, J., Mazzocchi, S., McMahan, B., et al.: Towards federated learning at scale: System design. Proceedings of machine learning and systems 1, 374-388 (2019) 4 +8. Breuer, A., Balkanski, E., Singer, Y.: The fast algorithm for submodular maximization. In: International Conference on Machine Learning. pp. 1134-1143. PMLR (2020) 3, 6 +9. Candès, E.J., Donoho, D.L.: New tight frames of curvelets and optimal representations of objects with piecewise c2 singularities. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences 57(2), 219-266 (2004) 2, 3 +0. Carlini, N., Jagielski, M., Zhang, C., Papernot, N., Terzis, A., Tramer, F.: The privacy onion effect: Memorization is relative. Advances in Neural Information Processing Systems 35, 13263-13276 (2022) 2 +11. Carlini, N., Hayes, J., Nasr, M., Jagielski, M., Sehwag, V., Tramer, F., Balle, B., Ippolito, D., Wallace, E.: Extracting training data from diffusion models. In: 32nd USENIX Security Symposium (USENIX Security 23). pp. 5253-5270 (2023) 1 +12. Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM review 43(1), 129-159 (2001) 2 + +13. Chen, Y., Dey, T., Kuhnle, A.: Best of both worlds: Practical and theoretically optimal submodular maximization in parallel. Advances in Neural Information Processing Systems 34, 25528-25539 (2021) 3, 6 +14. Davis, G., Mallat, S., Avellaneda, M.: Adaptive greedy approximations. Constructive approximation 13, 57-98 (1997) 3 +15. Dibbo, S.V.: Sok: Model inversion attack landscape: Taxonomy, challenges, and future roadmap. In: IEEE 36th Computer Security Foundations Symposium. pp. 408-425. IEEE Computer Society (2023) 1 +16. Dibbo, S.V., Chung, D.L., Mehnaz, S.: Model inversion attack with least information and an in-depth analysis of its disparate vulnerability. In: 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML). pp. 119-135. IEEE (2023) 1 +17. Dibbo, S.V., Moore, J.S., Kenyon, G.T., Teti, M.A.: Lcanets++: Robust audio classification using multi-layer neural networks with lateral competition. arXiv preprint arXiv:2308.12882 (2023) 2 +18. Fang, H., Chen, B., Wang, X., Wang, Z., Xia, S.T.: Gidf: A generative gradient inversion method with feature domain optimization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4967-4976 (2023) 2, 4 +19. Field, D.J.: What is the goal of sensory coding? Neural computation 6(4), 559-601 (1994) 2, 3 +20. Fredrikson, M., Jha, S., Ristenpart, T.: Model inversion attacks that exploit confidence information and basic countermeasures. In: Proceedings of the 22nd ACM SIGSAC conference on computer and communications security. pp. 1322-1333 (2015) 1, 2, 8 +21. Gong, N.Z., Liu, B.: You are who you know and how you behave: Attribute inference attacks via users' social friends and behaviors. In: 25th USENIX Security Symposium (USENIX Security 16). pp. 979-995 (2016) 1 +22. Gong, X., Wang, Z., Li, S., Chen, Y., Wang, Q.: A gan-based defense framework against model inversion attacks. IEEE Transactions on Information Forensics and Security (2023) 2, 6, 7, 8, 10, 11, 12, 13 +23. Haim, N., Vardi, G., Yehudai, G., Shamir, O., Irani, M.: Reconstructing training data from trained neural networks. Advances in Neural Information Processing Systems 35, 22911-22924 (2022) 2 +24. Hannan, D., Nesbit, S.C., Wen, X., Smith, G., Zhang, Q., Goffi, A., Chan, V., Morris, M.J., Hunninghake, J.C., Villalobos, N.E., et al.: Mobileptx: sparse coding for pneumothorax detection given limited training examples. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 15675-15681 (2023) 2 +25. Hayes, J., Mahloujifar, S., Balle, B.: Bounding training data reconstruction in dpsgd. arXiv preprint arXiv:2302.07225 (2023) 2, 4, 7, 10, 11, 12, 13 +26. He, Z., Zhang, T., Lee, R.B.: Model inversion attacks against collaborative inference. In: Proceedings of the 35th Annual Computer Security Applications Conference. pp. 148-162 (2019) 2, 4, 7 +27. Heredia, L.G., Negrevergne, B., Chevaleyre, Y.: Adversarial attacks for mixtures of classifiers. arXiv preprint arXiv:2307.10788 (2023) 8 +28. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 8 +29. Hidano, S., Murakami, T., Katsumata, S., Kiyomoto, S., Hanaoka, G.: Model inversion attacks for prediction systems: Without knowledge of non-sensitive attributes. + +In: 2017 15th Annual Conference on Privacy, Security and Trust (PST). pp. 115-11509. IEEE (2017) 8 +30. Hitaj, B., Ateniese, G., Perez-Cruz, F.: Deep models under the gan: information leakage from collaborative deep learning. In: Proceedings of the 2017 ACM SIGSAC conference on computer and communications security. pp. 603-618 (2017) 2 +31. Hu, H., Salcic, Z., Sun, L., Dobbie, G., Yu, P.S., Zhang, X.: Membership inference attacks on machine learning: A survey. ACM Computing Surveys (CSUR) 54(11s), 1-37 (2022) 1 +32. Jiang, Z., Zhang, G., Davis, L.S.: Submodular dictionary learning for sparse coding. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition. pp. 3418-3425. IEEE (2012) 3, 6 +33. Kahla, M., Chen, S., Just, H.A., Jia, R.: Label-only model inversion attacks via boundary repulsion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15045-15053 (2022) 2 +34. Kaissis, G.A., Makowski, M.R., Rückert, D., Braren, R.F.: Secure, privacy-preserving and federated machine learning in medical imaging. Nature Machine Intelligence 2(6), 305-311 (2020) 4 +35. Kariyappa, S., Prakash, A., Qureshi, M.K.: Maze: Data-free model stealing attack using zeroth-order gradient estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13814-13823 (2021) 1 +36. Kavukcuoglu, K., Ranzato, M., LeCun, Y.: Fast inference in sparse coding algorithms with applications to object recognition. arXiv preprint arXiv:1010.3467 (2010) 2, 3 +37. Kim, E., Rego, J., Watkins, Y., Kenyon, G.T.: Modeling biological immunity to adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4666-4675 (2020) 2, 5 +38. Konečny, J., McMahan, H.B., Yu, F.X., Richtárik, P., Suresh, A.T., Bacon, D.: Federated learning: Strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492 (2016) 4 +39. Krause, A., Cevher, V.: Submodular dictionary selection for sparse representation. In: International Conference on Machine Learning (ICML) (2010) 2, 3 +40. Lee, H., Battle, A., Raina, R., Ng, A.: Efficient sparse coding algorithms. Advances in neural information processing systems 19 (2006) 3 +41. Li, L., Xie, T., Li, B.: Sok: Certified robustness for deep neural networks. In: 2023 IEEE Symposium on Security and Privacy (SP). pp. 1289-1310. IEEE (2023) 1 +42. Liu, G., Wang, C., Peng, K., Huang, H., Li, Y., Cheng, W.: Socinf: Membership inference attacks on social media health data with machine learning. IEEE Transactions on Computational Social Systems 6(5), 907-921 (2019) 8 +43. McInnes, L., Healy, J., Melville, J.: Umap: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 13 +44. McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. pp. 1273-1282. PMLR (2017) 4 +45. Mehnaz, S., Dibbo, S.V., Kabir, E., Li, N., Bertino, E.: Are your sensitive attributes private? novel model inversion attribute inference attacks on classification models. In: 31st USENIX Security Symposium (USENIX Security 22). pp. 4579-4596. USENIX Association, Boston, MA (Aug 2022) 1, 2 +46. Melis, L., Song, C., De Cristofaro, E., Shmatikov, V.: Exploiting unintended feature leakage in collaborative learning. In: 2019 IEEE symposium on security and privacy (SP). pp. 691-706. IEEE (2019) 2 + +47. Mireshghallah, F., Taram, M., Ramrakhyani, P., Jalali, A., Tullsen, D., Esmaeilzadeh, H.: Shredder: Learning noise distributions to protect inference privacy. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. pp. 3-18 (2020) 2 +48. Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrak, J., Krause, A.: Lazier than lazy greedy. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 29 (2015) 3 +49. Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM journal on computing 24(2), 227-234 (1995) 3 +50. Olshausen, B.A., Field, D.J.: Sparse coding of sensory inputs. Current opinion in neurobiology 14(4), 481-487 (2004) 2, 3 +51. Olshausen, B.A., Field, D.J., et al.: Sparse coding of natural images produces localized, oriented, bandpass receptive fields. Submitted to Nature. Available electronically as ftp://redwood.psych.cornell.edu/pub/papers/sparse-coding.ps (1995) 2 +52. Paiton, D.M., Frye, C.G., Lundquist, S.Y., Bowen, J.D., Zarcone, R., Olshausen, B.A.: Selectivity and robustness of sparse coding networks. Journal of vision 20(12), 10-10 (2020) 2 +53. Peng, X., Liu, F., Zhang, J., Lan, L., Ye, J., Liu, T., Han, B.: Bilateral dependency optimization: Defending against model-inversion attacks. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 1358-1367 (2022) 2, 6, 7, 10, 11, 12, 13 +54. Rigaki, M., Garcia, S.: A survey of privacy attacks in machine learning. ACM Computing Surveys (2020) 2 +55. Rozell, C.J., Johnson, D.H., Baraniuk, R.G., Olshausen, B.A.: Sparse coding via thresholding and local competition in neural circuits. Neural computation 20(10), 2526-2563 (2008) 2, 3, 5 +56. Salem, A., Bhattacharya, A., Backes, M., Fritz, M., Zhang, Y.: {Updates-Leak}: Data set inference and reconstruction attacks in online learning. In: 29th USENIX security symposium (USENIX Security 20). pp. 1291-1308 (2020) 2 +57. Sannai, A.: Reconstruction of training samples from loss functions. arXiv preprint arXiv:1805.07337 (2018) 8 +58. Sanyal, S., Addepalli, S., Babu, R.V.: Towards data-free model stealing in a hard label setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15284-15293 (2022) 1 +59. Schneiderman, H.: Feature-centric evaluation for efficient cascaded object detection. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. vol. 2, pp. II-II. IEEE (2004) 2 +60. Song, L., Mittal, P.: Systematic evaluation of privacy risks of machine learning models. In: 30th USENIX Security Symposium (USENIX Security 21). pp. 2615-2632 (2021) 4 +61. Struppek, L., Hintersdorf, D., Correira, A.D.A., Adler, A., Kersting, K.: Plug & play attacks: Towards robust and flexible model inversion attacks. In: International Conference on Machine Learning. pp. 20522-20545. PMLR (2022) 1, 2, 4, 7, 9, 10 +62. Sun, B., Tsai, N.h., Liu, F., Yu, R., Su, H.: Adversarial defense by stratified convolutional sparse coding. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11447-11456 (2019) 2 +63. Teti, M., Kenyon, G., Migliori, B., Moore, J.: Lcanets: Lateral competition improves robustness against corruption and attack. In: International Conference on Machine Learning. pp. 21232-21252. PMLR (2022) 2, 5, 6, 7 + +64. Titcombe, T., Hall, A.J., Papadopoulos, P., Romanini, D.: Practical defences against model inversion attacks for split neural networks. arXiv preprint arXiv:2104.05743 (2021) 2, 4, 7, 8, 10, 11, 12, 13 +65. Vepakomma, P., Gupta, O., Swedish, T., Raskar, R.: Split learning for health: Distributed deep learning without sharing raw patient data. arXiv preprint arXiv:1812.00564 (2018) 4 +66. Wang, T., Zhang, Y., Jia, R.: Improving robustness to model inversion attacks via mutual information regularization. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 11666-11673 (2021) 2, 7, 10, 11, 12, 13 +67. Wang, X., Wang, W.H.: Group property inference attacks against graph neural networks. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. pp. 2871-2884 (2022) 4 +68. Wang, Y., Qian, H., Miao, C.: Dualcf: Efficient model extraction attack from counterfactual explanations. In: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency. pp. 1318-1329 (2022) 1 +69. Wang, Z., Song, M., Zhang, Z., Song, Y., Wang, Q., Qi, H.: Beyond inferring class representatives: User-level privacy leakage from federated learning. In: IEEE INFOCOM 2019-IEEE conference on computer communications. pp. 2512-2520. IEEE (2019) 2 +70. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 8 +71. Wei, W., Liu, L., Loper, M., Chow, K.H., Gursoy, M.E., Truex, S., Wu, Y.: A framework for evaluating gradient leakage attacks in federated learning. arXiv preprint arXiv:2004.10397 (2020) 2 +72. Wu, P., Liu, J., Li, M., Sun, Y., Shen, F.: Fast sparse coding networks for anomaly detection in videos. Pattern Recognition 107, 107515 (2020) 6 +73. Wu, Y., Yu, N., Li, Z., Backes, M., Zhang, Y.: Membership inference attacks against text-to-image generation models. arXiv preprint arXiv:2210.00968 (2022) 8 +74. Yang, Z., Zhang, J., Chang, E.C., Liang, Z.: Neural network inversion in adversarial setting via background knowledge alignment. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. pp. 225-240 (2019) 2 +75. Yuan, X., Ding, L., Zhang, L., Li, X., Wu, D.O.: Es attack: Model stealing against deep neural networks without data hurdles. IEEE Transactions on Emerging Topics in Computational Intelligence 6(5), 1258-1270 (2022) 1 +76. Zhang, J., Peng, S., Gao, Y., Zhang, Z., Hong, Q.: Apmsa: adversarial perturbation against model stealing attacks. IEEE Transactions on Information Forensics and Security 18, 1667-1679 (2023) 1 +77. Zhang, Y., Jia, R., Pei, H., Wang, W., Li, B., Song, D.: The secret revealer: Generative model-inversion attacks against deep neural networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 253-261 (2020) 2 +78. Zhong, D., Sun, H., Xu, J., Gong, N., Wang, W.H.: Understanding disparate effects of membership inference attacks and their countermeasures. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security. pp. 959-974 (2022) 1 \ No newline at end of file diff --git a/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/images.zip b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..064b2d7178deefc70c6c1ae5cae42416f4fff3ce --- /dev/null +++ b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7942b97d231592f8b381edec968fa1cd84d608de2b99ec7510edad093daf3a89 +size 601739 diff --git a/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/layout.json b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..5dd3f74431a9161acd449dd926abb218e38ae23a --- /dev/null +++ b/2024/Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures/layout.json @@ -0,0 +1,9691 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 160, + 111, + 455, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 111, + 455, + 148 + ], + "spans": [ + { + "bbox": [ + 160, + 111, + 455, + 148 + ], + "type": "text", + "content": "Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "spans": [ + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "text", + "content": "Sayanton V. Dibbo" + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "text", + "content": ", Adam Breuer" + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "text", + "content": ", Justin Moore" + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "text", + "content": ", and Michael Teti" + }, + { + "bbox": [ + 132, + 167, + 482, + 181 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 207, + 189, + 405, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 207, + 189, + 405, + 201 + ], + "spans": [ + { + "bbox": [ + 207, + 189, + 405, + 201 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 207, + 189, + 405, + 201 + ], + "type": "text", + "content": " Dartmouth College, Hanover, NH 03755, USA" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 172, + 201, + 441, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 172, + 201, + 441, + 213 + ], + "spans": [ + { + "bbox": [ + 172, + 201, + 441, + 213 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 172, + 201, + 441, + 213 + ], + "type": "text", + "content": " Los Alamos National Laboratory, Los Alamos, NM 87545, USA" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 223, + 213, + 391, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 213, + 391, + 223 + ], + "spans": [ + { + "bbox": [ + 223, + 213, + 391, + 223 + ], + "type": "text", + "content": "{f0048vh,adam.breuer}@dartmouth.edu" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 247, + 224, + 367, + 235 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 247, + 224, + 367, + 235 + ], + "spans": [ + { + "bbox": [ + 247, + 224, + 367, + 235 + ], + "type": "text", + "content": "{jmoore01,mteti}@lanl.gov" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 258, + 455, + 500 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 258, + 455, + 500 + ], + "spans": [ + { + "bbox": [ + 160, + 258, + 455, + 500 + ], + "type": "text", + "content": "Abstract. Recent model inversion attack algorithms permit adversaries to reconstruct a neural network's private and potentially sensitive training data by repeatedly querying the network. In this work, we develop a novel network architecture that leverages sparse-coding layers to obtain superior robustness to this class of attacks. Three decades of computer science research has studied sparse coding in the context of image denoising, object recognition, and adversarial misclassification settings, but to the best of our knowledge, its connection to state-of-the-art privacy vulnerabilities remains unstudied. In this work, we hypothesize that sparse coding architectures suggest an advantageous means to defend against model inversion attacks because they allow us to control the amount of irrelevant private information encoded by a network in a manner that is known to have little effect on classification accuracy. Specifically, compared to networks trained with a variety of state-of-the-art defenses, our sparse-coding architectures maintain comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions by factors of 1.1 to 18.3 across a variety of reconstruction quality metrics (PSNR, SSIM, FID). This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug- " + }, + { + "bbox": [ + 160, + 258, + 455, + 500 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 160, + 258, + 455, + 500 + ], + "type": "text", + "content": " -Play attacks. We provide a cluster-ready PyTorch codebase to promote research and standardize defense evaluations." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 517, + 481, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 517, + 481, + 530 + ], + "spans": [ + { + "bbox": [ + 132, + 517, + 481, + 530 + ], + "type": "text", + "content": "Keywords: Model Inversion Attack, Defense, Privacy Attacks, Sparse Coding." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 546, + 230, + 559 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 546, + 230, + 559 + ], + "spans": [ + { + "bbox": [ + 132, + 546, + 230, + 559 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 569, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 641 + ], + "type": "text", + "content": "The popularization of machine learning has been accompanied by the widespread use of neural networks that were trained on private, sensitive, and proprietary datasets. This has given rise to a new generation of privacy attacks that seek to infer private information about the training dataset simply by inspecting the representation of the training data that remains encoded in the model's parameters [11, 15, 16, 20, 21, 31, 35, 41, 45, 58, 61, 68, 75, 76, 78]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 642, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 642, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 642, + 482, + 665 + ], + "type": "text", + "content": "Of particular concern is a devastating stream of privacy attacks known as model inversion. Model inversion attacks leverage the network's parameters or" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 212 + ], + "type": "text", + "content": "classifications in order to reconstruct entire images or data that were used to train the network. Early work on model inversion focused on a white-box setting where the attacker has unfettered access to the model or auxiliary information about the training data [20,30,69,71,77]. However, recent work has shown that standard network architectures are vulnerable to model inversion attacks even when attackers have no knowledge of the model's architecture or parameters, and only have access to the model's classifications or its intermediate outputs, such as leaked outputs from a single hidden network layer [5,22,45,46,56,74]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 153, + 213, + 459, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 213, + 459, + 224 + ], + "spans": [ + { + "bbox": [ + 153, + 213, + 459, + 224 + ], + "type": "text", + "content": "Are different network architectures robust to model inversion attacks?" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 228, + 482, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 228, + 482, + 384 + ], + "spans": [ + { + "bbox": [ + 130, + 228, + 482, + 384 + ], + "type": "text", + "content": "Such attacks are feasible because each hidden layer of a standard network architecture captures a detailed representation of the training data. It is well-known that standard dense layers exhibit a tendency to memorize their inputs [10, 23, 54], so even a minimal leak of a network's class distribution output or a leak of its intermediate outputs from a single layer is often sufficient to train an inverse mapping for data reconstruction. More concretely, state-of-the-art inversion attacks work by submitting externally obtained images to the model, observing leaked outputs, then using this data to train a new 'inverted' neural network that reconstructs (predicts) an input image given a leaked output. This can be accomplished either directly via SGD, or by optimizing a GAN, and we consider both approaches here. Such attacks on standard network architectures can reconstruct private training images that are clearly recognizable by humans familiar with the training data [4, 18, 22, 26, 30, 33, 61, 71, 74]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 387, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 387, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 387, + 482, + 579 + ], + "type": "text", + "content": "Recent work has pursued a diverse array of defense strategies to mitigate these attacks. For example, [22] augments the training dataset with GAN-generated fake samples designed to inject spurious features into the trained network that mislead the gradients computed during inversion attacks. In contrast, multiple recent defenses add regularization terms during training that attempt to penalize training data memorization [53, 66]. Other recent defenses noise the network weights to obfuscate memorized data [2,47,64], or noise and clip training gradients via DP-SGD [25]. All such approaches are costly: data augmentation-based defenses entail the computational burden of building a GAN and applying sophisticated parameter tuning techniques during training; regularization-based defenses explicitly trade away classification accuracy for less memorization, and noise-based defenses are also known to impose significant accuracy costs. Until very recently, there were no known provable guarantees for model inversion defenses, and the current best-known guarantees require a DP-SGD-based training algorithm that imposes a significant computational burden and accuracy loss to obtain privacy guarantees that are impractically weak for these attacks [25]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Very little is known about how a network's architecture contributes to its robustness (or vulnerability). This is surprising since throughout three decades of research in other domains such as image denoising [3, 6, 9, 12, 19, 39, 50, 55], object recognition [24, 36, 51, 59], and adversarial misclassification [17, 37, 52, 62, 63], researchers seeking to control their model's representations of the data have heavily studied sparse coding-based architectures that prune unnecessary details and preserve only the information that is essential to the model objective." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": "Specifically, sparse coding seeks to approximately represent an image (or layer) with only a small set of basis vectors selected from an overcomplete dictionary [9, 19, 50]. While it is well-known that computing a sparse representation using a standard objective function is NP-hard in general [14, 32, 49], we now benefit from fast approximation algorithms that efficiently compute high-quality sparse representations [8, 13, 32, 36, 39, 40, 48, 55]. Sparse coding architectures leverage this technique by inserting a sparse network layer after a dense layer, such that the sparse layer reduces the dense layer's outputs to a sparse representation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 220, + 483, + 341 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 220, + 483, + 341 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 483, + 341 + ], + "type": "text", + "content": "To our knowledge, sparse coding architectures have not been studied in the context of model inversion or privacy attacks. However, they suggest an advantageous means to prevent such attacks because they control the amount of irrelevant private information encoded in a model's intermediate representations in a manner that is known to have little effect on its accuracy, that can be computed efficiently during training, and that adds little to the trained model's overall parameter complexity. Put simply, sparsifying a network's representations is a natural means to preclude memorization of detailed information about its inputs that is unnecessary to obtain high accuracy, so even an idealized 'perfect attacker' could only hope to recover a sparsified, un-detailed training image." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 349, + 483, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 483, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 483, + 422 + ], + "type": "text", + "content": "Main contribution. We begin by showing that an off-the-shelf sparse coding preprocessing step offers performance advantages compared to state-of-the-art data augmentation, regularization, and noise based defenses in terms of robustness to model inversion attacks. We then refine this idea into a network architecture that achieves superior performance. Our main result is a novel sparse-coding architecture, SCA, that is robust to state-of-the-art model inversion attacks." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 429, + 483, + 610 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 429, + 483, + 610 + ], + "spans": [ + { + "bbox": [ + 130, + 429, + 483, + 610 + ], + "type": "text", + "content": "SCA is defined by pairs of alternating sparse coded and dense layers that jettison unnecessary private information in the input image and ensure that downstream layers do not e.g., reconstruct this information. We show that SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than 8 state-of-the-art data augmentation, regularization, and noise-based defenses in terms of PSNR and FID metrics and 1.1 to 720 times more in terms of SSIM. This performance advantage holds across 5 datasets ranging from CelebA faces to medical images and CIFAR-10, and across various state-of-the-art SGD-based and GAN-based inversion attacks, including Plug-ε Play attacks. SCA's defense performance is also more stable than baselines across multiple runs. We emphasize that, unlike recent state-of-the-art defenses that require sophisticated parameter tuning to perform well, SCA obtains these results absent parameter tuning (i.e., using default sparsity parameters) because sparse coding naturally precludes networks from memorizing detailed representations of the training data." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "More broadly, our results show a deep connection between state-of-the-art ML privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. We provide a comprehensive cluster-ready PyTorch codebase to promote research and standardize defense evaluation." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 242, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 242, + 127 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 242, + 127 + ], + "type": "text", + "content": "2 Threat models" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 137, + 481, + 183 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 137, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 137, + 481, + 183 + ], + "type": "text", + "content": "We consider three threat models that span the diverse range of powerful and well-informed attackers considered in recent work. We emphasize that a defense that performs well in all three settings provides strong evidence of its privacy protections under weaker, more realistic threat models with real-world attackers." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 184, + 481, + 510 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 130, + 184, + 481, + 233 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 184, + 481, + 233 + ], + "spans": [ + { + "bbox": [ + 130, + 184, + 481, + 233 + ], + "type": "text", + "content": "1. Plug- & Play threat model [61]. Plug- & Play attacks are considered the most performant recent attacks. These attacks optimize the intermediate representation of StyleGAN's input vectors so that generated images maximize the target network's class prediction probability, which the attacker can query." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 235, + 481, + 294 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 235, + 481, + 294 + ], + "spans": [ + { + "bbox": [ + 130, + 235, + 481, + 294 + ], + "type": "text", + "content": "Separately, recent theoretical work on model inversion emphasizes that a strong threat model should capture 'worst-case' attackers with direct access to the information-rich, high-dimensional intermediate outputs of the target model that store private information about the training data, as well as ideal training data examples for training an inverted model [1, 25]. We consider two variants:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 294, + 481, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 294, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 294, + 481, + 331 + ], + "type": "text", + "content": "2. End-to-end threat model. We consider an attacker with access to all of the last hidden layer's raw, high-dimensional outputs, as well as a large number of ideal training data examples drawn from the true training dataset [60, 67]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 331, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 331, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 331, + 481, + 510 + ], + "type": "text", + "content": "3. Split network threat model (Federated Learning). We also consider the split network threat model described by [64]. There has been much recent interest in Federated Learning architectures that split the network across multiple agents [7, 18, 26, 38, 44], particularly for privacy-fraught domains such as medicine where legal requirements limit data sharing [34, 65]. These architectures are known to be susceptible to model inversion attacks, [18, 26, 64], and defenses are urgently needed. This threat model also allows us to capture a different view of a 'worst-case' threat model: Model inversion attacks are known to be more effective when the attacker has access to outputs from earlier layers that may exhibit a more direct representation of the input images [26]. To capture this 'worst-case', we consider the setting where the attacker has access to raw intermediate outputs from the first linear network layer. As before, we also assume the attacker has access to ideal training data examples drawn from the actual training datasets. Appendix B provides additional details about the model inversion threat models." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 525, + 261, + 538 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 261, + 538 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 261, + 538 + ], + "type": "text", + "content": "3 SCA architecture" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 546, + 481, + 583 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 481, + 583 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 481, + 583 + ], + "type": "text", + "content": "We now describe the SCA architecture, which is defined by alternating pairs of Sparse Coding Layers (SCL) and dense layers, followed by downstream linear and/or convolutional layers." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 590, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 481, + 665 + ], + "type": "text", + "content": "Sparse Coding Layer (SCL). Sparse coding converts raw inputs to sparse representations where only a few neurons whose features are useful in reconstructing the inputs are active. Our Sparse Coding Layer (SCL) performs sparse coding to obtain a sparse representation of a previous dense layer's representation (if the SCL is not the first layer in the network) or of the inputs (if the SCL is the first layer in the network). Fig. 1 illustrates the working principle of SCL." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": "Formally, each SCL performs a reconstruction minimization problem to compute the sparse representation of its inputs (either a previous layer's representation or of the inputs to the network). Suppose the input to a (2D convolutional) SCL is " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "\\mathcal{X} \\in \\mathbb{R}^{\\mathcal{C} \\times \\mathcal{H} \\times \\mathcal{W}}" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "\\mathcal{H}" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": " height, " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "\\mathcal{W}" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": " width, and " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": " channels/features. The goal is to find the sparse representation " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x \\in \\mathbb{R}^{\\mathcal{F} \\times [\\mathcal{H} / S_h] \\times [\\mathcal{W} / S_w]}" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": " has few active neurons and corresponds to a denoised version of the input " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "\\mathcal{X}" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "S_w" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "inline_equation", + "content": "S_h" + }, + { + "bbox": [ + 132, + 116, + 302, + 295 + ], + "type": "text", + "content": " indicate convolutional strides across the width and height of" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "spans": [ + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": "the input, respectively. " + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": " is the number of convolutional features in the SCL layer's dictionary, " + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "inline_equation", + "content": "\\Omega \\in \\mathbb{R}^{\\mathcal{F}\\times \\mathcal{C}\\times \\mathcal{H}_f\\times \\mathcal{W}_f}" + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "inline_equation", + "content": "\\mathcal{H}_f" + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "inline_equation", + "content": "\\mathcal{W}_f" + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": " are the height and width of each convolutional feature, respectively. Per Figure 1, the sparse coding layer starts with its input, " + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "inline_equation", + "content": "\\mathcal{X}" + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": ", and dictionary of features, " + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "inline_equation", + "content": "\\Omega" + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": ", to produce " + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 130, + 296, + 482, + 356 + ], + "type": "text", + "content": " by solving the following sparse reconstruction problem:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 233, + 364, + 481, + 389 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 364, + 481, + 389 + ], + "spans": [ + { + "bbox": [ + 233, + 364, + 481, + 389 + ], + "type": "interline_equation", + "content": "\\min _ {\\mathcal {R} _ {x}} \\frac {1}{2} | | \\mathcal {X} - \\mathcal {R} _ {x} * \\Omega | | _ {2} ^ {2} + \\lambda | | \\mathcal {R} _ {x} | | _ {1} \\tag {1}", + "image_path": "273c19a6c96bf7eb74d8778ad2202e41371eeb83249823999a5f62fe4df7ec6d.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": "where the first term represents how much information is preserved about " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathcal{X}" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": " by " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": " by measuring the difference between " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathcal{X}" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": " and its reconstruction, " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x\\circledast \\varOmega" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": ", computed with a transpose convolution, " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\otimes" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": ". The second term measures how sparse " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": " is, and " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": " is a constant which determines the trade-off between reconstruction fidelity and sparsity. Equation 1 is convex in " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": ", meaning we will always find the optimal " + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 131, + 397, + 482, + 468 + ], + "type": "text", + "content": " that solves Equation 1." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 469, + 483, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 469, + 483, + 567 + ], + "spans": [ + { + "bbox": [ + 131, + 469, + 483, + 567 + ], + "type": "text", + "content": "Among different techniques to perform sparse coding, we leverage the commonly used Locally Competitive Algorithm (LCA) [55]. LCA implements a recurrent network of leaky integrate-and-fire neurons that incorporates the general principles of thresholding and feature-similarity-based competition between neurons to solve Equation 1. While Rozell introduced LCA in the non-convolutional setting, it can be readily adapted to the convolutional setting (see Appendix A.2 for details). Specifically, each LCA neuron has an internal membrane potential " + }, + { + "bbox": [ + 131, + 469, + 483, + 567 + ], + "type": "inline_equation", + "content": "\\mathcal{P}" + }, + { + "bbox": [ + 131, + 469, + 483, + 567 + ], + "type": "text", + "content": " which evolves per the following differential equation:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 229, + 573, + 481, + 597 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 229, + 573, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 229, + 573, + 481, + 597 + ], + "type": "interline_equation", + "content": "\\dot {\\mathcal {P}} (t) = \\frac {1}{\\tau} [ \\varPsi (t) - \\mathcal {P} (t) - \\mathcal {R} _ {x} (t) * \\mathcal {G} ] \\tag {2}", + "image_path": "dd41e1b19b5c90d6de44783346368ad35834ef330e197966134e02b346869b9b.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": " is a time constant, " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\varPsi(t) = \\mathcal{X}*\\varOmega" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": " is the neuron's bottom-up drive from the input computed by taking the convolution, *, between the input, " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{X}" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": ", and the dictionary, " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\varOmega" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "-\\mathcal{P}(t)" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": " is the leak term [37, 63]. Lateral competition between neurons is performed via the term " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "-\\mathcal{R}_x(t)*\\mathcal{G}" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{G} = \\varOmega*\\varOmega - I" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": " is the similarity between each feature and the other " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "\\mathcal{F}" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": " features " + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "inline_equation", + "content": "(-I" + }, + { + "bbox": [ + 131, + 605, + 482, + 667 + ], + "type": "text", + "content": " prevents" + } + ] + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 312, + 122, + 476, + 230 + ], + "blocks": [ + { + "bbox": [ + 312, + 122, + 476, + 230 + ], + "lines": [ + { + "bbox": [ + 312, + 122, + 476, + 230 + ], + "spans": [ + { + "bbox": [ + 312, + 122, + 476, + 230 + ], + "type": "image", + "image_path": "9c5132ada9872d483f724063575af906102ea307e638abacd8c3f50ea6c4abd0.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 307, + 239, + 482, + 273 + ], + "lines": [ + { + "bbox": [ + 307, + 239, + 482, + 273 + ], + "spans": [ + { + "bbox": [ + 307, + 239, + 482, + 273 + ], + "type": "text", + "content": "Fig.1: Pipeline of neuron (membrane potential) dynamics in Sparse Coding Layer (SCL) with lateral competitions." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "self interactions). " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": " is computed by applying soft threshold activation " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "T_{\\lambda}(x) = \\mathrm{relu}(x - \\lambda)" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": " to the neuron's membrane potential, which produces nonnegative, sparse representations. Overall, this means that in LCA neurons will compete to determine which ones best represent the input, and thus will have non-zero activations in " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "\\mathcal{R}_x" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": ", the output of the SCL that is passed to the next layer." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 190, + 261, + 332 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 190, + 261, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 190, + 261, + 332 + ], + "type": "text", + "content": "SCA architecture. The SCA architecture is defined by the use of multiple pairs of sparse coding and dense (batch norm) layers after the input image, which can then be followed by other (linear, convolutional) layers. Fig. 2 illustrates this design principle. The key intuition is that the first sparse layer jettisons unnecessary private informa" + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 269, + 224, + 481, + 284 + ], + "blocks": [ + { + "bbox": [ + 269, + 224, + 481, + 284 + ], + "lines": [ + { + "bbox": [ + 269, + 224, + 481, + 284 + ], + "spans": [ + { + "bbox": [ + 269, + 224, + 481, + 284 + ], + "type": "image", + "image_path": "af45de9a91e29a556ffbc64b7015b1ecae77016bd82a9cfe4e6c55b6b7c51f5b.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 313, + 295, + 436, + 306 + ], + "lines": [ + { + "bbox": [ + 313, + 295, + 436, + 306 + ], + "spans": [ + { + "bbox": [ + 313, + 295, + 436, + 306 + ], + "type": "text", + "content": "Fig. 2: Architecture of SCA." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 333, + 482, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 333, + 482, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 333, + 482, + 477 + ], + "type": "text", + "content": "tion in the input image. Then, by alternating sparse-dense pairs of layers, we ensure that unnecessary information is also jettisoned from downstream layers. In this manner, downstream layers also do not convey unnecessary private information to the adversary, and they also do not e.g. learn to reconstruct private information jettisoned by the first sparse layer. In short, previous defenses work by trying to mislead attackers by pushing model features in a wrong direction, either randomly via noise or strategically via adversarial examples, or by disincentivizing memorization during training. In contrast, SCA directly removes the unnecessary private information. Training SCA is identical to training a standard network with one exception: after each backprop updates non-sparse layers, we perform a fast update on the sparse layers, except for the first sparse layer that sparse-codes the image input.3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 490, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 490, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 490, + 482, + 635 + ], + "type": "text", + "content": "SCA training complexity & large scale applications. While we focus on the neuron lateral competition approach to sparse coding as it is practically convenient and well-represented in recent work [63], we note that for large-scale machine learning applications, we now have practical parallel algorithms that learn the sparse coding dictionary near-optimally w.p. in parallel time (adaptivity) that is logarithmic in the size of the data [8, 13, 32]. Fast single-iteration heuristics are also available (see e.g. [72]). Thus, even for large-scale applications, computing sparse representations while training SCA adds little computational overhead compared to sophisticated optimization-based techniques necessary for recent defenses [22]. In practice, even our basic sparse coding research implementations (see Section 4 and Appendix A.3) are slightly faster than optimized Torch implementations of the best-performing recent defense [53]." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "text", + "content": "3 We can optionally also perform a backpropagation on sparse layers after updating them each iteration via sparse coding. We do this in our experiments." + } + ] + } + ], + "index": 8 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "type": "text", + "content": "xOur goal in this section is to show that SCA performs well compared to state-of-the-art defenses as well as practical defenses used in leading industry models in terms of both classification accuracy and various reconstruction quality metrics. To evaluate its performance comprehensively, we test all combinations of 5 diverse datasets, 3 threat models, 9 defense baselines, plus multiple runs-per-experiment and various sparsity parameters " + }, + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 138, + 482, + 212 + ], + "type": "text", + "content": ". See Appendix A.1-A.6." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 221, + 482, + 270 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 221, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 221, + 482, + 270 + ], + "type": "text", + "content": "Five benchmark datasets. We test our performance on all 5 diverse datasets used to benchmark model inversion attacks across the recent literature: CelebA, hi-res RGB faces, Medical MNIST medical images, CIFAR-10 hi-res RGB objects, MNIST grayscale digits, and Fashion MNIST grayscale objects." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 280, + 482, + 460 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 280, + 482, + 460 + ], + "spans": [ + { + "bbox": [ + 130, + 280, + 482, + 460 + ], + "type": "text", + "content": "Three attacks. For each dataset, we conduct three sets of experiments corresponding to our three threat models. First, we test SCA and baselines' defenses against a state-of-the-art Plug- " + }, + { + "bbox": [ + 130, + 280, + 482, + 460 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 130, + 280, + 482, + 460 + ], + "type": "text", + "content": " -Play attack [61] that leverages StyleGAN3 to obtain high-quality reconstructions. Second, we compare SCA networks to a variety of baselines in terms of their robustness to a state-of-the-art end-to-end network attack that leverages leaked raw high-dimensional outputs from the networks' last hidden layer, as well as held-out training data drawn from the true training dataset. This allows us to assess SCA's defenses in a realistic setting with a well-informed adversary. Our third set of experiments tests performance in a split network setting of [64] where the attacker has access to leaked raw outputs from the first linear network layer. Robustness in this setting is desirable because model inversion attacks are known to be more effective on earlier hidden layers [26], and also because an algorithm that is robust to such attacks would be an effective defense under novel security paradigms such as Federated Learning, which is vulnerable to inversion [64] (see Appendix A.5)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 469, + 481, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 469, + 481, + 495 + ], + "spans": [ + { + "bbox": [ + 131, + 469, + 481, + 495 + ], + "type": "text", + "content": "Nine defense baselines. We compare SCA to 9 baselines plus extra variants, including SOTA defenses and practical defenses used in leading industry models:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 499, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 138, + 499, + 436, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 499, + 436, + 511 + ], + "spans": [ + { + "bbox": [ + 138, + 499, + 436, + 511 + ], + "type": "text", + "content": "- No-Defense. The baseline target model with no added defenses." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 512, + 480, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 512, + 480, + 534 + ], + "spans": [ + { + "bbox": [ + 138, + 512, + 480, + 534 + ], + "type": "text", + "content": "- Hayes et al. [25]. We train a DP-SGD defense that noises and clips gradients during training. This is the only defense with provable guarantees." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 536, + 480, + 570 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 536, + 480, + 570 + ], + "spans": [ + { + "bbox": [ + 138, + 536, + 480, + 570 + ], + "type": "text", + "content": "- Gong et al. [22]. We train the very recent defense from [22] that uses sophisticated tuning and two types of GAN-generated images. We also try a ‘++’ version that adds extra Continual Learning accuracy optimizations." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 571, + 480, + 594 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 571, + 480, + 594 + ], + "spans": [ + { + "bbox": [ + 138, + 571, + 480, + 594 + ], + "type": "text", + "content": "- Peng et al. [53]. We train the Bilateral Dependency defense that adds a loss function for redundant input memorization during training." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 594, + 480, + 618 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 594, + 480, + 618 + ], + "spans": [ + { + "bbox": [ + 138, + 594, + 480, + 618 + ], + "type": "text", + "content": "- Wang et al. [66]. We train a Mutual Information Regularization defense that penalizes dependence between inputs and outputs during training." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 618, + 480, + 642 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 618, + 480, + 642 + ], + "spans": [ + { + "bbox": [ + 138, + 618, + 480, + 642 + ], + "type": "text", + "content": "- Titcombe et al. [64]. We train a state-of-the-art Laplace " + }, + { + "bbox": [ + 138, + 618, + 480, + 642 + ], + "type": "inline_equation", + "content": "\\mathcal{L}(\\mu = 0, b = 0.5)" + }, + { + "bbox": [ + 138, + 618, + 480, + 642 + ], + "type": "text", + "content": " noise defense as in [64]. We also try more noise—see Appendix D." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 642, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 642, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 642, + 480, + 665 + ], + "type": "text", + "content": "- Sparse-Standard. We train an off-the-shelf sparse coding architecture [63] with 1 sparse layer after the input image via lateral competition as in SCA." + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 115, + 481, + 175 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 137, + 115, + 481, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 115, + 481, + 151 + ], + "spans": [ + { + "bbox": [ + 137, + 115, + 481, + 151 + ], + "type": "text", + "content": "- GAN [common industry defense]. We train a GAN for 25 epochs to generate fake samples, then train the target model with both original and GAN-generated samples. This defense is frequently used in industry." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 152, + 481, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 152, + 481, + 175 + ], + "spans": [ + { + "bbox": [ + 138, + 152, + 481, + 175 + ], + "type": "text", + "content": "- Gaussian-Noise [common industry defense]. We draw noises from " + }, + { + "bbox": [ + 138, + 152, + 481, + 175 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(\\mu = 0, \\sigma = 0.5)" + }, + { + "bbox": [ + 138, + 152, + 481, + 175 + ], + "type": "text", + "content": " and inject them into intermediate dense layers post-training." + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 184, + 481, + 279 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 184, + 481, + 279 + ], + "spans": [ + { + "bbox": [ + 130, + 184, + 481, + 279 + ], + "type": "text", + "content": "SCA without parameter tuning. In all experiments, we consider the simplest case of SCA architecture that contains SCA's alternating sparse-and-dense layer pairs followed by only linear layers. We note that adding downstream convolutional layers or more sophisticated downstream architectures is certainly possible, though we avoid this here in order to compare the essence of the SCA approach to the baselines. Appendix A.4 describes SCA details. In the split network setting, we are careful to use slightly shallower SCA architectures with fewer linear layers to match the split network experiments of [64]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 280, + 481, + 340 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 280, + 481, + 340 + ], + "spans": [ + { + "bbox": [ + 130, + 280, + 481, + 340 + ], + "type": "text", + "content": "Recent state-of-the-art defenses such as GAN-based defenses require sophisticated automatic parameter tuning techniques such as focal tuning and continual learning to obtain high performance [22]. To test whether SCA can be effective absent parameter tuning, we just run SCA with sparsity parameter " + }, + { + "bbox": [ + 130, + 280, + 481, + 340 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 280, + 481, + 340 + ], + "type": "text", + "content": " set to 0.1, 0.25, or 0.5—the default values from various sparse coding contexts." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 348, + 481, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 348, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 348, + 481, + 373 + ], + "type": "text", + "content": "Performance metrics. We evaluate attackers' reconstructions using multiple standard metrics. Let " + }, + { + "bbox": [ + 130, + 348, + 481, + 373 + ], + "type": "inline_equation", + "content": "X_{in}^{*}" + }, + { + "bbox": [ + 130, + 348, + 481, + 373 + ], + "type": "text", + "content": " denote the reconstruction of training image " + }, + { + "bbox": [ + 130, + 348, + 481, + 373 + ], + "type": "inline_equation", + "content": "X_{in}" + }, + { + "bbox": [ + 130, + 348, + 481, + 373 + ], + "type": "text", + "content": ". Then:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 376, + 481, + 459 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 138, + 376, + 481, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 376, + 481, + 399 + ], + "spans": [ + { + "bbox": [ + 138, + 376, + 481, + 399 + ], + "type": "text", + "content": "- Peak signal-to-noise ratio (PSNR) [lower=better]. PSNR is the ratio of max squared pixel fluctuations from " + }, + { + "bbox": [ + 138, + 376, + 481, + 399 + ], + "type": "inline_equation", + "content": "X_{in}" + }, + { + "bbox": [ + 138, + 376, + 481, + 399 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 138, + 376, + 481, + 399 + ], + "type": "inline_equation", + "content": "X_{*in}" + }, + { + "bbox": [ + 138, + 376, + 481, + 399 + ], + "type": "text", + "content": " over mean squared error." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 400, + 481, + 435 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 400, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 138, + 400, + 481, + 435 + ], + "type": "text", + "content": "- Structural similarity (SSIM) [70] [lower=better]. SSIM measures the product of luminance distortion, contrast distortion, & correlation loss: " + }, + { + "bbox": [ + 138, + 400, + 481, + 435 + ], + "type": "inline_equation", + "content": "SSIM(X_{in},X_{in}^{*}) = l_{dis}(X_{in},X_{in}^{*})c_{dis}(X_{in},X_{in}^{*})c_{loss}(X_{in},X_{in}^{*})" + }, + { + "bbox": [ + 138, + 400, + 481, + 435 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 435, + 481, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 435, + 481, + 459 + ], + "spans": [ + { + "bbox": [ + 138, + 435, + 481, + 459 + ], + "type": "text", + "content": "- Fréchet inception distance (FID) [28] [higher=better]. FID measures reconstruction quality as a distributional difference between " + }, + { + "bbox": [ + 138, + 435, + 481, + 459 + ], + "type": "inline_equation", + "content": "X_{in}" + }, + { + "bbox": [ + 138, + 435, + 481, + 459 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 138, + 435, + 481, + 459 + ], + "type": "inline_equation", + "content": "X_{in}^{*}" + }, + { + "bbox": [ + 138, + 435, + 481, + 459 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 149, + 460, + 481, + 478 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 460, + 481, + 478 + ], + "spans": [ + { + "bbox": [ + 149, + 460, + 481, + 478 + ], + "type": "interline_equation", + "content": "F I D ^ {2} (X _ {i n}, X _ {i n} ^ {*}) = | | \\mu_ {X _ {i n}} - \\mu_ {X _ {i n} ^ {*}} | | ^ {2} + T r (\\mathrm {C o} _ {X _ {i n}} + \\mathrm {C o} _ {X _ {i n} ^ {*}} - 2 * \\sqrt {\\mathrm {C o} _ {X _ {i n}} \\cdot \\mathrm {C o} _ {X _ {i n} ^ {*}}})", + "image_path": "bf32b35b7fc587a4c0f82bd7a5a8e9cc84c9d5ccd33e4872c3c5baabd6cd34d3.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 485, + 481, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 485, + 481, + 534 + ], + "spans": [ + { + "bbox": [ + 131, + 485, + 481, + 534 + ], + "type": "text", + "content": "Target model. We focus on privacy attacks on linear networks because they capture the essence of the privacy attack vulnerability [20, 29], and because there is broad consensus that a principled understanding of their emerging privacy (and security) vulnerabilities4 is urgently needed [27, 42, 57, 73]." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 542, + 481, + 626 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 542, + 481, + 626 + ], + "spans": [ + { + "bbox": [ + 131, + 542, + 481, + 626 + ], + "type": "text", + "content": "PyTorch codebase, replicability, and evaluation standardization. For all experiments, we consider the standard train test split of " + }, + { + "bbox": [ + 131, + 542, + 481, + 626 + ], + "type": "inline_equation", + "content": "70\\%" + }, + { + "bbox": [ + 131, + 542, + 481, + 626 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 542, + 481, + 626 + ], + "type": "inline_equation", + "content": "30\\%" + }, + { + "bbox": [ + 131, + 542, + 481, + 626 + ], + "type": "text", + "content": ". After training each defense model, we run attacks to reconstruct the entire training set and compare reconstruction performance. We run all the experiments on a standard industry production cluster with 4 nodes and DELL Tesla V100 GPUs with 40 cores. We provide a cluster-ready PyTorch codebase on our project page at: https://sayantondibbo.github.io/SCA." + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 631, + 481, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 631, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 631, + 481, + 665 + ], + "type": "text", + "content": "4 We also note that results on linear models may generalize better than results on more application-specific models, and linear models trained on private data remain ubiquitous among top industry products." + } + ] + } + ], + "index": 15 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 313, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 313, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 313, + 128 + ], + "type": "text", + "content": "4.1 Experimental results overview" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 134, + 482, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 134, + 482, + 255 + ], + "spans": [ + { + "bbox": [ + 130, + 134, + 482, + 255 + ], + "type": "text", + "content": "Defense. Across the 3 attack settings and 5 datasets, SCA maintains comparable or higher classification accuracy while degrading state-of-the-art training data reconstructions 1.1 to 11.7 times more than the 9 baselines in terms of PSNR & FID, and 1.1 to 720 times more in terms of SSIM. This performance gap exceeds the scale of improvements made by recent algorithms. SCA's defense is also more stable than baselines across multiple runs. This is because unlike for baselines, even an idealized 'perfect attacker' can only hope to recover a sparsified, un-detailed training image from SCA. We show results here for the 2 most privacy-sensitive datasets of medical images and CelebA in 3 threat models, and defer the 9 other {dataset, attack} combinations to Appendix C." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "text", + "content": "Accuracy. Typically, obtaining greater defense means trading away accuracy. However, in 6 of the 15 experiments (MNIST + FashionMNIST) × (Plug & Play + end-to-end + split networks), SCA outperforms no-defense and all baselines' accuracy. SCA also outperforms all baselines' accuracy on CelebA in Plug & Play, and a sparse approach is within 0.003 of the best accuracy on an 8th experiment. No other single SOTA baseline wins on accuracy this consistently. We emphasize that unlike baselines that do accuracy hyperparameter tuning, we obtain this result absent any such tuning. SCA drops accuracy on MedMNIST (which is the most imbalanced & has fewest training examples). However, tuning of SCA (kernel size " + }, + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "inline_equation", + "content": "5 \\rightarrow 7" + }, + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "text", + "content": ") improves SCA's accuracy on MedMNIST in Table 3 from " + }, + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "inline_equation", + "content": "94.6\\%" + }, + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "inline_equation", + "content": "97\\%" + }, + { + "bbox": [ + 130, + 257, + 482, + 389 + ], + "type": "text", + "content": "—See Appendix G and Table 12." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 394, + 384, + 405 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 394, + 384, + 405 + ], + "spans": [ + { + "bbox": [ + 132, + 394, + 384, + 405 + ], + "type": "text", + "content": "Results of experiments set 1: Plug- " + }, + { + "bbox": [ + 132, + 394, + 384, + 405 + ], + "type": "inline_equation", + "content": "\\mathcal{E}" + }, + { + "bbox": [ + 132, + 394, + 384, + 405 + ], + "type": "text", + "content": " -Play attack." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 406, + 482, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 482, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 482, + 477 + ], + "type": "text", + "content": "Qualitative evaluations. Fig. 3 shows hi-res CelebA reconstructions generated by Plug- & Play under various defenses. To avoid cherry-picking, Fig. 3 shows the 3 images with the highest (top row), median (middle), and lowest (bottom) PSNR reconstructions under No-Defense. Note that reconstructions under SCA totally differ from actual images (different race, hair, gender, child/adult), while those of other defenses are closer to actual images, indicating privacy leakage." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 478, + 482, + 514 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 478, + 482, + 514 + ], + "spans": [ + { + "bbox": [ + 130, + 478, + 482, + 514 + ], + "type": "text", + "content": "Metric evaluations. Table 1 reports reconstruction quality measures and accuracy for SCA and other baselines in the Plug- & Play attack [61] setting (lower rows = better defense performance). In terms of PSNR and SSIM, training data" + } + ] + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 149, + 533, + 466, + 630 + ], + "blocks": [ + { + "bbox": [ + 149, + 533, + 466, + 630 + ], + "lines": [ + { + "bbox": [ + 149, + 533, + 466, + 630 + ], + "spans": [ + { + "bbox": [ + 149, + 533, + 466, + 630 + ], + "type": "image", + "image_path": "3e99c4b68bfd36bc0fecfcb6f48b078f8ac657fe6145dad9b1479f237c8d35b0.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 639, + 481, + 663 + ], + "lines": [ + { + "bbox": [ + 131, + 639, + 481, + 663 + ], + "spans": [ + { + "bbox": [ + 131, + 639, + 481, + 663 + ], + "type": "text", + "content": "Fig. 3: Experiments set 1: Qualitative comparisons among actual and reconstructed images (Plug- & Play Attack [61]) under SCA & baselines on hi-res CelebA dataset." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 137, + 481, + 439 + ], + "blocks": [ + { + "bbox": [ + 132, + 105, + 482, + 129 + ], + "lines": [ + { + "bbox": [ + 132, + 105, + 482, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 105, + 482, + 129 + ], + "type": "text", + "content": "Table 1: Experiments set 1: Performance comparison under Plug- &-Play attack [61] setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 137, + 481, + 439 + ], + "lines": [ + { + "bbox": [ + 132, + 137, + 481, + 439 + ], + "spans": [ + { + "bbox": [ + 132, + 137, + 481, + 439 + ], + "type": "table", + "html": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE11.350.718256.40.779
GAUSSIAN-NOISE10.390.604264.80.644
GAN10.150.613289.70.635
Titcombe et al. [64]10.180.636304.10.654
Gong et al. [22]++10.020.556381.50.672
Gong et al. [22]10.110.595350.50.614
Peng et al. [53]9.900.514402.80.728
Hayes et al. [25]9.920.556383.70.621
Wang et al. [66]9.850.527402.80.742
SPARSE-STANDARD9.840.539374.70.728
SCA0.19.790.451391.90.726
SCA0.259.450.442411.00.739
SCA0.59.400.440412.60.723
MedicalNo-DEFENSE22.040.396196.10.998
MNISTGAUSSIAN-NOISE21.830.382209.40.862
GAN21.770.427219.00.998
Gong et al. [22]++21.500.359273.10.894
Titcombe et al. [64]21.680.360286.30.899
Gong et al. [22]21.750.477249.10.770
Peng et al. [53]21.820.381268.30.927
Hayes et al. [25]21.720.337259.70.823
Wang et al. [66]21.710.322211.70.937
SPARSE-STANDARD20.970.086239.30.907
SCA0.121.190.057253.50.888
SCA0.2521.170.075280.10.882
SCA0.520.060.055288.80.881
", + "image_path": "861d1c7cadcd265075be9e5dcc7103200d712f1e074c40e2cc7c19f112f6ad5b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 445, + 482, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 445, + 482, + 578 + ], + "spans": [ + { + "bbox": [ + 130, + 445, + 482, + 578 + ], + "type": "text", + "content": "reconstructions under the least sparse version SCA0.1 are degraded by factors of 1.01 to 6.7 and 1.01 to 5.6 compared to the regularization defenses of Peng et al. [53] and Wang et al. [66], respectively. Increasing SCA's sparsity " + }, + { + "bbox": [ + 130, + 445, + 482, + 578 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 445, + 482, + 578 + ], + "type": "text", + "content": " to 0.5 widens the performance gap, increasing these factors to 1.1 to 6.9 and 1.02 to 5.9, respectively, and making SCA outperform baselines' FID. SCA0.1 also outperforms the noise-based approaches of Hayes et al. [25] and Titcombe et al. [64] on all metric by factors of 1.01 to 5.9 and 1.02 to 6.3. Increasing SCA's sparsity " + }, + { + "bbox": [ + 130, + 445, + 482, + 578 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 445, + 482, + 578 + ], + "type": "text", + "content": " to 0.5 increases these factors to 1.1 to 6.1 and 1.1 to 6.5. Finally, SCA0.1 outperforms the data augmentation defense of [22] by factors of 1.01 to 8.4, which widens to 1.1 to 8.7 for SCA0.5. All baselines also outperform common GAN and Noise-based industry defenses." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Basic SPARSE-STANDARD outperforms SOTA baselines. Our basic SPARSE-STANDARD baseline outperforms the best baselines' PSNR on both CelebA and Medical MNIST, and also outperforms baselines' SSIM on the latter. SCA0.5 then outperforms SPARSE-STANDARD on all metrics, obtaining SSIM and FID that are better by factors of 1.2 to 1.6 and 1.1 to 1.2, respectively, and slightly better PSNR. Thus, while SPARSE-STANDARD offers an inferior defense vs. SCA, it still offers a fast practical defense for less privacy-critical domains." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 115, + 465, + 215 + ], + "blocks": [ + { + "bbox": [ + 149, + 115, + 465, + 215 + ], + "lines": [ + { + "bbox": [ + 149, + 115, + 465, + 215 + ], + "spans": [ + { + "bbox": [ + 149, + 115, + 465, + 215 + ], + "type": "image", + "image_path": "f41bb87f1fc271c026759beeabb2087269fa4650f645a79d5a5360172bddcfe4.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 224, + 480, + 246 + ], + "lines": [ + { + "bbox": [ + 131, + 224, + 480, + 246 + ], + "spans": [ + { + "bbox": [ + 131, + 224, + 480, + 246 + ], + "type": "text", + "content": "Fig. 4: Experiments set 2: Qualitative comparisons among actual & reconstructed images (end-to-end setting) under SCA & baselines on the Medical MNIST dataset." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 132, + 294, + 481, + 596 + ], + "blocks": [ + { + "bbox": [ + 131, + 262, + 481, + 285 + ], + "lines": [ + { + "bbox": [ + 131, + 262, + 481, + 285 + ], + "spans": [ + { + "bbox": [ + 131, + 262, + 481, + 285 + ], + "type": "text", + "content": "Table 2: Experiments set 2: Performance comparison in end-to-end setting (lower rows=better defense) on hi-res CelebA faces and Medical MNIST images." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 294, + 481, + 596 + ], + "lines": [ + { + "bbox": [ + 132, + 294, + 481, + 596 + ], + "spans": [ + { + "bbox": [ + 132, + 294, + 481, + 596 + ], + "type": "table", + "html": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.260.262201.80.773
GAUSSIAN-NOISE16.080.262220.40.638
GAN13.550.133199.60.668
Titcombe et al. [64]15.130.191197.70.695
Gong et al. [22]++13.100.032204.80.704
Gong et al. [22]13.150.119199.60.682
Peng et al. [53]13.780.141218.80.716
Hayes et al. [25]14.100.004199.00.664
Wang et al. [66]13.630.0011203.20.744
SPARSE-STANDARD13.090.002222.10.749
SCA0.112.890.004228.50.748
SCA0.2512.730.004218.80.737
SCA0.512.420.001231.90.741
MedicalNo-DEFENSE31.480.93510.660.998
MNISTGAUSSIAN-NOISE30.460.92012.230.862
GAN27.340.48033.770.998
Gong et al. [22]++18.370.35381.520.894
Titcombe et al. [64]21.330.43130.600.899
Gong et al. [22]21.520.43664.880.770
Peng et al. [53]19.050.420107.90.908
Hayes et al. [25]18.480.007150.90.824
Wang et al. [66]20.480.54930.010.946
SPARSE-STANDARD14.790.119250.60.907
SCA0.113.430.004352.10.888
SCA0.2512.320.004375.90.882
SCA0.512.040.003369.90.881
", + "image_path": "394b18d9e55abe3d6b4374c94fd646a86b86c02900d79884abae3bd9736d9fec.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 617, + 391, + 628 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 617, + 391, + 628 + ], + "spans": [ + { + "bbox": [ + 132, + 617, + 391, + 628 + ], + "type": "text", + "content": "Results of experiments set 2: End-to-end networks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 480, + 665 + ], + "type": "text", + "content": "Qualitative evaluations. Fig. 4, shows Medical MNIST reconstructions in the end-to-end threat model. SCA's reconstructions are visually destroyed (esp. SCA0.5), whereas baselines admit noisy-but-recognizable reconstructions." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": "Metric evaluations. Table 2 reports performance in the end-to-end network setting. In this setting, SCA's performance advantage widens. In terms of PSNR & FID, training data reconstructions under SCA0.1 are degraded by factors of 1.1 to 3.3 and 1.1 to 11.7 compared to Peng et al. [53] and Wang et al. [66], respectively (but slightly worse SSIM vs. Wang et al. on CelebA). On all metrics, SCA0.1 outperforms Hayes et al. [25] and Titcombe et al. [64] by factors of 1.1 to 2.4 and 1.1 to 107.7, respectively. SCA0.1 also outperforms Gong et al. [22] by factors of 1.01 to 109. Increasing SCA's " + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 116, + 482, + 236 + ], + "type": "text", + "content": " to 0.5 causes it to outperform the same baselines on all metrics by factors of 1.2 to 141 [53], 1.2 to 183 [66], 1.2 to 4.0 [25], 1.2 to 191 [64], and 1.1 to 145.3 [22], respectively." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 254, + 482, + 351 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 254, + 482, + 351 + ], + "spans": [ + { + "bbox": [ + 130, + 254, + 482, + 351 + ], + "type": "text", + "content": "Stability of SCA's defense vs. baselines. SCA's performance is also as stable or more stable than baselines' performance over multiple runs. For example, Fig. 5a plots the means & std. devs. of SCA & baselines' per-run FID (the standard metric for faces) over multiple runs for CelebA faces in the Plug-&Play setting, and Fig. 5b plots this for PSNR (the standard metric for grayscale images) on Medical MNIST in the end-to-end setting. SCA obtains better performance while also exhibiting stability of defense performance on par with the best baseline (and better stability than most baselines). See Appendix E." + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 142, + 373, + 297, + 458 + ], + "blocks": [ + { + "bbox": [ + 142, + 373, + 297, + 458 + ], + "lines": [ + { + "bbox": [ + 142, + 373, + 297, + 458 + ], + "spans": [ + { + "bbox": [ + 142, + 373, + 297, + 458 + ], + "type": "image", + "image_path": "73baedd6e5fade9e25c13bea6a92653847b1aff9700ec4078cff83d0bbdc6cbb.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 138, + 461, + 303, + 471 + ], + "lines": [ + { + "bbox": [ + 138, + 461, + 303, + 471 + ], + "spans": [ + { + "bbox": [ + 138, + 461, + 303, + 471 + ], + "type": "text", + "content": "(a) FID↑↑ for CelebA faces under Plug- &-Play" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 314, + 373, + 471, + 458 + ], + "blocks": [ + { + "bbox": [ + 314, + 373, + 471, + 458 + ], + "lines": [ + { + "bbox": [ + 314, + 373, + 471, + 458 + ], + "spans": [ + { + "bbox": [ + 314, + 373, + 471, + 458 + ], + "type": "image", + "image_path": "95de7c01f440dadfef6ff2f9c540a44c1567ae447a145a95cd2e5539bfb34b3c.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 310, + 461, + 482, + 471 + ], + "lines": [ + { + "bbox": [ + 310, + 461, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 310, + 461, + 482, + 471 + ], + "type": "text", + "content": "(b) PSNR " + }, + { + "bbox": [ + 310, + 461, + 482, + 471 + ], + "type": "inline_equation", + "content": "\\downarrow \\downarrow" + }, + { + "bbox": [ + 310, + 461, + 482, + 471 + ], + "type": "text", + "content": " for Med.MNIST, end-to-end setting" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 479, + 482, + 503 + ], + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 503 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 503 + ], + "type": "text", + "content": "Fig. 5: Stability of SCA & baselines' defense performance (mean ± std. dev.) of PSNR and FID across multiple runs on CelebA and Medical MNIST." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "SCA's sparsity vs. performance. We also try varying SCA's and SPARSE-STANDARD's sparsity parameters " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " and recompute PSNR, SSIM, FID, and accuracy. Appendix A.6 shows that for each " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " and defense metric, SCA significantly outperforms the off-the-shelf SPARSE-STANDARD architecture for a small accuracy cost. Thus, for a given " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " with SPARSE-STANDARD, we can use a (smaller) " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " with SCA to obtain better reconstruction and higher or equal (within 0.0017) accuracy. SCA is also amenable to more sophisticated tuning (and performance improvements) by tuning different " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " per sparse layer (e.g., by having a sparser representation of inputs but less sparse reductions of downstream layers). We avoid such tuning here as it is unnecessary for good performance." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 145, + 481, + 449 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "text", + "content": "Table 3: Experiments set 3: Performance comparison in split network setting (lower rows=better defense) on hi-res CelebA faces and sensitive Medical MNIST images." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 145, + 481, + 449 + ], + "lines": [ + { + "bbox": [ + 132, + 145, + 481, + 449 + ], + "spans": [ + { + "bbox": [ + 132, + 145, + 481, + 449 + ], + "type": "table", + "html": "
DatasetDefensePSNR ↓↓SSIM ↓↓FID ↑↑Accuracy
CelebANo-DEFENSE16.490.302185.80.766
GAUSSIAN-NOISE15.440.227191.10.753
GAN15.570.253176.70.646
Titcombe et al. [64]14.990.144194.20.725
Gong et al. [22]++15.060.038190.50.756
Gong et al. [22]15.650.044185.80.653
Peng et al. [53]16.230.211198.60.717
Hayes et al. [25]15.060.005178.80.672
Wang et al. [66]14.820.173189.60.652
SPARSE-STANDARD15.390.009187.00.746
SCA0.115.050.005178.70.745
SCA0.2514.760.003191.10.743
SCA0.514.710.003206.10.739
MedicalNo-DEFENSE23.470.77645.570.993
MNISTGAUSSIAN-NOISE21.930.72244.720.811
GAN21.670.71948.490.912
Gong et al. [22]++21.070.57367.530.931
Titcombe et al. [64]21.350.70448.820.961
Gong et al. [22]21.330.72041.740.925
Peng et al. [53]18.980.426124.80.914
Hayes et al. [25]21.460.442137.40.850
Wang et al. [66]20.030.53865.170.986
SPARSE-STANDARD15.330.149142.40.955
SCA0.113.950.008244.90.946
SCA0.2512.310.008255.30.928
SCA0.512.270.001285.30.909
", + "image_path": "07ac9110a05d15803067eef430bcf9088c6378d84a2883db1766c442e5ad20dc.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 469, + 482, + 530 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 469, + 482, + 530 + ], + "spans": [ + { + "bbox": [ + 130, + 469, + 482, + 530 + ], + "type": "text", + "content": "Results of experiments set 3: Split networks. Table 3 reports performance in the split network setting. As expected, all baselines and SCA perform slightly worse in this threat model compared to the end-to-end model (aside from Guussian and GAN heuristics). On all metrics, SCA's performance advantage remains consistent: SCA0.5 outperforms all baselines by factors of 1.1 to 720." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 545, + 481, + 560 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 481, + 560 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 481, + 560 + ], + "type": "text", + "content": "5 Empirical analysis of sparse coding robustness to attack" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "Sparse-coding layers' robustness to privacy attacks can be observed empirically. Consider that the attacker trains the attack to map leaked raw hidden layer outputs back to input images. Attacks are thus highly dependent on these outputs' distributions. Recall that UMAP projections compute a 2D visualization of the global structure of distances between different training images' features according to a particular layer [43]. Fig. 6 plots UMAP 2D projections of linear layer feature distributions of training inputs after either two linear layers (Figs. 6a & 6d), two convolutional layers (Figs. 6b & 6e), or two sparse coding layers (with" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 148, + 115, + 236, + 183 + ], + "blocks": [ + { + "bbox": [ + 148, + 115, + 236, + 183 + ], + "lines": [ + { + "bbox": [ + 148, + 115, + 236, + 183 + ], + "spans": [ + { + "bbox": [ + 148, + 115, + 236, + 183 + ], + "type": "image", + "image_path": "36de78561fc165c552b31f3ad0d1db2770c5f9606ab12f031ab0cdc2559a5385.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 149, + 196, + 235, + 265 + ], + "blocks": [ + { + "bbox": [ + 162, + 186, + 221, + 195 + ], + "lines": [ + { + "bbox": [ + 162, + 186, + 221, + 195 + ], + "spans": [ + { + "bbox": [ + 162, + 186, + 221, + 195 + ], + "type": "text", + "content": "(a) Linear Layer" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 149, + 196, + 235, + 265 + ], + "lines": [ + { + "bbox": [ + 149, + 196, + 235, + 265 + ], + "spans": [ + { + "bbox": [ + 149, + 196, + 235, + 265 + ], + "type": "image", + "image_path": "432952cf9845c99024cda318deb34d95a20a8385a78f824c05ec59ac85c16fa8.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 161, + 267, + 221, + 277 + ], + "lines": [ + { + "bbox": [ + 161, + 267, + 221, + 277 + ], + "spans": [ + { + "bbox": [ + 161, + 267, + 221, + 277 + ], + "type": "text", + "content": "(d) Linear Layer" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 285, + 482, + 308 + ], + "lines": [ + { + "bbox": [ + 131, + 285, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 131, + 285, + 482, + 308 + ], + "type": "text", + "content": "Fig. 6: UMap 2D projections of input images' features by class after 2 linear layers, 2 conv. layers, or 2 sparse-coded layers on MNIST (top) & Fashion MNIST (bottom)." + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 262, + 114, + 350, + 184 + ], + "blocks": [ + { + "bbox": [ + 262, + 114, + 350, + 184 + ], + "lines": [ + { + "bbox": [ + 262, + 114, + 350, + 184 + ], + "spans": [ + { + "bbox": [ + 262, + 114, + 350, + 184 + ], + "type": "image", + "image_path": "e1c2839ff13b4464bcd48ad24ad15df4d1d73227e8174f5283158820fbd72dbf.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 265, + 186, + 346, + 195 + ], + "lines": [ + { + "bbox": [ + 265, + 186, + 346, + 195 + ], + "spans": [ + { + "bbox": [ + 265, + 186, + 346, + 195 + ], + "type": "text", + "content": "(b) Convolution Layer" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 263, + 196, + 349, + 265 + ], + "blocks": [ + { + "bbox": [ + 263, + 196, + 349, + 265 + ], + "lines": [ + { + "bbox": [ + 263, + 196, + 349, + 265 + ], + "spans": [ + { + "bbox": [ + 263, + 196, + 349, + 265 + ], + "type": "image", + "image_path": "ff994be2ab1f47a42bb3fb9a1523ae9f5cd98c26eb9a1a348d343d15ba6ce876.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 266, + 267, + 345, + 277 + ], + "lines": [ + { + "bbox": [ + 266, + 267, + 345, + 277 + ], + "spans": [ + { + "bbox": [ + 266, + 267, + 345, + 277 + ], + "type": "text", + "content": "(e) Convolution Layer" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 380, + 114, + 467, + 184 + ], + "blocks": [ + { + "bbox": [ + 380, + 114, + 467, + 184 + ], + "lines": [ + { + "bbox": [ + 380, + 114, + 467, + 184 + ], + "spans": [ + { + "bbox": [ + 380, + 114, + 467, + 184 + ], + "type": "image", + "image_path": "f9e02e5cdbd86db0688faa3bac4351a8a6a61aba1102fe7c5170c91d318a3b3b.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 380, + 186, + 467, + 196 + ], + "lines": [ + { + "bbox": [ + 380, + 186, + 467, + 196 + ], + "spans": [ + { + "bbox": [ + 380, + 186, + 467, + 196 + ], + "type": "text", + "content": "(c) Sparse Coding Layer" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 380, + 198, + 465, + 265 + ], + "blocks": [ + { + "bbox": [ + 380, + 198, + 465, + 265 + ], + "lines": [ + { + "bbox": [ + 380, + 198, + 465, + 265 + ], + "spans": [ + { + "bbox": [ + 380, + 198, + 465, + 265 + ], + "type": "image", + "image_path": "19f77c591b9aea094788fb133db4f5060e6be1c9729cfb891f1aabab79875f25.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 380, + 266, + 466, + 277 + ], + "lines": [ + { + "bbox": [ + 380, + 266, + 466, + 277 + ], + "spans": [ + { + "bbox": [ + 380, + 266, + 466, + 277 + ], + "type": "text", + "content": "(f) Sparse Coding Layer" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 335, + 482, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 335, + 482, + 467 + ], + "spans": [ + { + "bbox": [ + 130, + 335, + 482, + 467 + ], + "type": "text", + "content": "interspersed dense layers - Figs. 6c & 6f). Importantly, observe that after two linear or two convolutional layers, points are clustered by color, i.e., input images' features are highly clustered by label. This class-clustered property leaves such layers vulnerable to model inversion attacks, as an attacker can 'home in on' examples from a specific class. In contrast, the goal in sparse coding is not to optimize the classification objective by separating classes, but rather to jettison unnecessary information. Here, this means that unnecessary information is jettisoned both from the input image and also the downstream dense layer. Per Figs. 6c & 6f, this tends to 'uncluster' remaining non-sparsified features of training examples from the same class, making it much harder for an attacker to compute informative gradients to home in on a training example." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 491, + 301, + 503 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 301, + 503 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 301, + 503 + ], + "type": "text", + "content": "6 Discussion & Conclusion" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "In this paper, we have provided the first study of sparse coding-based neural network architectures that are robust to model inversion attacks. Specifically, we have shown that the natural properties of sparse coded layers can control the extraneous private information about the training data that is encoded in a network without resorting to complex and computationally intensive parameter tuning techniques. Our work reveals a deep connection between state-of-the-art privacy vulnerabilities and three decades of computer science research on sparse coding for other application domains. Currently, our basic research implementation of SCA achieves compute times that in the worst-case are no better than some SOTA baselines (see Appendix F). However, given the rich theoretic body of work on fast algorithms and provable guarantees for sparse coding, we believe these aspects are opportune areas for future improvements." + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 100 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 143, + 482, + 216 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 143, + 482, + 216 + ], + "spans": [ + { + "bbox": [ + 130, + 143, + 482, + 216 + ], + "type": "text", + "content": "We are grateful for generous support from OpenAI, as well as the Dartmouth College Cybersecurity Cluster Research. This work was partially funded by the Center for Nonlinear Studies and the Information Science and Technology Institute's Cyber Security Summer School at Los Alamos National Laboratory, as well as an award from the Department of Energy's Advanced Scientific Computing Research program (#77902)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 236, + 197, + 248 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 197, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 197, + 248 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 263, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 263, + 481, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 263, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 138, + 263, + 481, + 308 + ], + "type": "text", + "content": "1. Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security. pp. 308-318 (2016) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 309, + 481, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 309, + 481, + 352 + ], + "spans": [ + { + "bbox": [ + 138, + 309, + 481, + 352 + ], + "type": "text", + "content": "2. Abuadbba, S., Kim, K., Kim, M., Thapa, C., Camtepe, S.A., Gao, Y., Kim, H., Nepal, S.: Can we use split learning on 1d cnn models for privacy preserving training? In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security. pp. 305-318 (2020) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 354, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 354, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 138, + 354, + 481, + 374 + ], + "type": "text", + "content": "3. Ahmad, S., Scheinkman, L.: How can we be so dense? the benefits of using highly sparse representations. arXiv preprint arXiv:1903.11257 (2019) 2" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 376, + 481, + 397 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 376, + 481, + 397 + ], + "spans": [ + { + "bbox": [ + 138, + 376, + 481, + 397 + ], + "type": "text", + "content": "4. Aïvodji, U., Gambs, S., Ther, T.: Gamin: An adversarial approach to black-box model inversion. arXiv preprint arXiv:1909.11835 (2019) 2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 399, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 399, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 138, + 399, + 481, + 430 + ], + "type": "text", + "content": "5. An, S., Tao, G., Xu, Q., Liu, Y., Shen, G., Yao, Y., Xu, J., Zhang, X.: Mirror: Model inversion for deep learning network with high fidelity. In: Proceedings of the 29th Network and Distributed System Security Symposium (2022) 2" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 432, + 481, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 432, + 481, + 453 + ], + "spans": [ + { + "bbox": [ + 138, + 432, + 481, + 453 + ], + "type": "text", + "content": "6. Barlow, H.B.: The coding of sensory messages. Current problems in animal behavior (1961) 2" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 454, + 481, + 498 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 454, + 481, + 498 + ], + "spans": [ + { + "bbox": [ + 138, + 454, + 481, + 498 + ], + "type": "text", + "content": "7. Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Konečny, J., Mazzocchi, S., McMahan, B., et al.: Towards federated learning at scale: System design. Proceedings of machine learning and systems 1, 374-388 (2019) 4" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 499, + 481, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 499, + 481, + 531 + ], + "spans": [ + { + "bbox": [ + 138, + 499, + 481, + 531 + ], + "type": "text", + "content": "8. Breuer, A., Balkanski, E., Singer, Y.: The fast algorithm for submodular maximization. In: International Conference on Machine Learning. pp. 1134-1143. PMLR (2020) 3, 6" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 533, + 481, + 575 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 533, + 481, + 575 + ], + "spans": [ + { + "bbox": [ + 138, + 533, + 481, + 575 + ], + "type": "text", + "content": "9. Candès, E.J., Donoho, D.L.: New tight frames of curvelets and optimal representations of objects with piecewise c2 singularities. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences 57(2), 219-266 (2004) 2, 3" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 577, + 481, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 481, + 609 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 481, + 609 + ], + "type": "text", + "content": "0. Carlini, N., Jagielski, M., Zhang, C., Papernot, N., Terzis, A., Tramer, F.: The privacy onion effect: Memorization is relative. Advances in Neural Information Processing Systems 35, 13263-13276 (2022) 2" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 610, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 610, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 134, + 610, + 481, + 643 + ], + "type": "text", + "content": "11. Carlini, N., Hayes, J., Nasr, M., Jagielski, M., Sehwag, V., Tramer, F., Balle, B., Ippolito, D., Wallace, E.: Extracting training data from diffusion models. In: 32nd USENIX Security Symposium (USENIX Security 23). pp. 5253-5270 (2023) 1" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 644, + 481, + 665 + ], + "type": "text", + "content": "12. Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM review 43(1), 129-159 (2001) 2" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "13. Chen, Y., Dey, T., Kuhnle, A.: Best of both worlds: Practical and theoretically optimal submodular maximization in parallel. Advances in Neural Information Processing Systems 34, 25528-25539 (2021) 3, 6" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 171 + ], + "type": "text", + "content": "14. Davis, G., Mallat, S., Avellaneda, M.: Adaptive greedy approximations. Constructive approximation 13, 57-98 (1997) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "text", + "content": "15. Dibbo, S.V.: Sok: Model inversion attack landscape: Taxonomy, challenges, and future roadmap. In: IEEE 36th Computer Security Foundations Symposium. pp. 408-425. IEEE Computer Society (2023) 1" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 205, + 481, + 247 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 205, + 481, + 247 + ], + "spans": [ + { + "bbox": [ + 134, + 205, + 481, + 247 + ], + "type": "text", + "content": "16. Dibbo, S.V., Chung, D.L., Mehnaz, S.: Model inversion attack with least information and an in-depth analysis of its disparate vulnerability. In: 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML). pp. 119-135. IEEE (2023) 1" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 249, + 481, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 249, + 481, + 281 + ], + "spans": [ + { + "bbox": [ + 133, + 249, + 481, + 281 + ], + "type": "text", + "content": "17. Dibbo, S.V., Moore, J.S., Kenyon, G.T., Teti, M.A.: Lcanets++: Robust audio classification using multi-layer neural networks with lateral competition. arXiv preprint arXiv:2308.12882 (2023) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 282, + 481, + 324 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 282, + 481, + 324 + ], + "spans": [ + { + "bbox": [ + 134, + 282, + 481, + 324 + ], + "type": "text", + "content": "18. Fang, H., Chen, B., Wang, X., Wang, Z., Xia, S.T.: Gidf: A generative gradient inversion method with feature domain optimization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4967-4976 (2023) 2, 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 326, + 481, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 326, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 133, + 326, + 481, + 346 + ], + "type": "text", + "content": "19. Field, D.J.: What is the goal of sensory coding? Neural computation 6(4), 559-601 (1994) 2, 3" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 348, + 481, + 390 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 348, + 481, + 390 + ], + "spans": [ + { + "bbox": [ + 133, + 348, + 481, + 390 + ], + "type": "text", + "content": "20. Fredrikson, M., Jha, S., Ristenpart, T.: Model inversion attacks that exploit confidence information and basic countermeasures. In: Proceedings of the 22nd ACM SIGSAC conference on computer and communications security. pp. 1322-1333 (2015) 1, 2, 8" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 392, + 481, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 392, + 481, + 424 + ], + "spans": [ + { + "bbox": [ + 133, + 392, + 481, + 424 + ], + "type": "text", + "content": "21. Gong, N.Z., Liu, B.: You are who you know and how you behave: Attribute inference attacks via users' social friends and behaviors. In: 25th USENIX Security Symposium (USENIX Security 16). pp. 979-995 (2016) 1" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 425, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 425, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 133, + 425, + 481, + 456 + ], + "type": "text", + "content": "22. Gong, X., Wang, Z., Li, S., Chen, Y., Wang, Q.: A gan-based defense framework against model inversion attacks. IEEE Transactions on Information Forensics and Security (2023) 2, 6, 7, 8, 10, 11, 12, 13" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 457, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 457, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 133, + 457, + 481, + 490 + ], + "type": "text", + "content": "23. Haim, N., Vardi, G., Yehudai, G., Shamir, O., Irani, M.: Reconstructing training data from trained neural networks. Advances in Neural Information Processing Systems 35, 22911-22924 (2022) 2" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 491, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 491, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 133, + 491, + 481, + 533 + ], + "type": "text", + "content": "24. Hannan, D., Nesbit, S.C., Wen, X., Smith, G., Zhang, Q., Goffi, A., Chan, V., Morris, M.J., Hunninghake, J.C., Villalobos, N.E., et al.: Mobileptx: sparse coding for pneumothorax detection given limited training examples. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 15675-15681 (2023) 2" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 535, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 535, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 133, + 535, + 481, + 555 + ], + "type": "text", + "content": "25. Hayes, J., Mahloujifar, S., Balle, B.: Bounding training data reconstruction in dpsgd. arXiv preprint arXiv:2302.07225 (2023) 2, 4, 7, 10, 11, 12, 13" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 556, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 556, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 133, + 556, + 481, + 588 + ], + "type": "text", + "content": "26. He, Z., Zhang, T., Lee, R.B.: Model inversion attacks against collaborative inference. In: Proceedings of the 35th Annual Computer Security Applications Conference. pp. 148-162 (2019) 2, 4, 7" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 590, + 481, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 590, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 133, + 590, + 481, + 610 + ], + "type": "text", + "content": "27. Heredia, L.G., Negrevergne, B., Chevaleyre, Y.: Adversarial attacks for mixtures of classifiers. arXiv preprint arXiv:2307.10788 (2023) 8" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 611, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 611, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 133, + 611, + 481, + 643 + ], + "type": "text", + "content": "28. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) 8" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "type": "text", + "content": "29. Hidano, S., Murakami, T., Katsumata, S., Kiyomoto, S., Hanaoka, G.: Model inversion attacks for prediction systems: Without knowledge of non-sensitive attributes." + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 20, + "blocks": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "type": "text", + "content": "In: 2017 15th Annual Conference on Privacy, Security and Trust (PST). pp. 115-11509. IEEE (2017) 8" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 481, + 171 + ], + "type": "text", + "content": "30. Hitaj, B., Ateniese, G., Perez-Cruz, F.: Deep models under the gan: information leakage from collaborative deep learning. In: Proceedings of the 2017 ACM SIGSAC conference on computer and communications security. pp. 603-618 (2017) 2" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 481, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 204 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 204 + ], + "type": "text", + "content": "31. Hu, H., Salcic, Z., Sun, L., Dobbie, G., Yu, P.S., Zhang, X.: Membership inference attacks on machine learning: A survey. ACM Computing Surveys (CSUR) 54(11s), 1-37 (2022) 1" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "text", + "content": "32. Jiang, Z., Zhang, G., Davis, L.S.: Submodular dictionary learning for sparse coding. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition. pp. 3418-3425. IEEE (2012) 3, 6" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "type": "text", + "content": "33. Kahla, M., Chen, S., Just, H.A., Jia, R.: Label-only model inversion attacks via boundary repulsion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15045-15053 (2022) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 481, + 303 + ], + "type": "text", + "content": "34. Kaissis, G.A., Makowski, M.R., Rückert, D., Braren, R.F.: Secure, privacy-preserving and federated machine learning in medical imaging. Nature Machine Intelligence 2(6), 305-311 (2020) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 303, + 481, + 336 + ], + "type": "text", + "content": "35. Kariyappa, S., Prakash, A., Qureshi, M.K.: Maze: Data-free model stealing attack using zeroth-order gradient estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 13814-13823 (2021) 1" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "36. Kavukcuoglu, K., Ranzato, M., LeCun, Y.: Fast inference in sparse coding algorithms with applications to object recognition. arXiv preprint arXiv:1010.3467 (2010) 2, 3" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 481, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 402 + ], + "type": "text", + "content": "37. Kim, E., Rego, J., Watkins, Y., Kenyon, G.T.: Modeling biological immunity to adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 4666-4675 (2020) 2, 5" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 402, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 481, + 435 + ], + "type": "text", + "content": "38. Konečny, J., McMahan, H.B., Yu, F.X., Richtárik, P., Suresh, A.T., Bacon, D.: Federated learning: Strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492 (2016) 4" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 435, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 435, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 435, + 481, + 456 + ], + "type": "text", + "content": "39. Krause, A., Cevher, V.: Submodular dictionary selection for sparse representation. In: International Conference on Machine Learning (ICML) (2010) 2, 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 456, + 481, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 481, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 481, + 479 + ], + "type": "text", + "content": "40. Lee, H., Battle, A., Raina, R., Ng, A.: Efficient sparse coding algorithms. Advances in neural information processing systems 19 (2006) 3" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 479, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 481, + 501 + ], + "type": "text", + "content": "41. Li, L., Xie, T., Li, B.: Sok: Certified robustness for deep neural networks. In: 2023 IEEE Symposium on Security and Privacy (SP). pp. 1289-1310. IEEE (2023) 1" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "text", + "content": "42. Liu, G., Wang, C., Peng, K., Huang, H., Li, Y., Cheng, W.: Socinf: Membership inference attacks on social media health data with machine learning. IEEE Transactions on Computational Social Systems 6(5), 907-921 (2019) 8" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 533, + 481, + 555 + ], + "type": "text", + "content": "43. McInnes, L., Healy, J., Melville, J.: Umap: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018) 13" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 481, + 588 + ], + "type": "text", + "content": "44. McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. pp. 1273-1282. PMLR (2017) 4" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 588, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 588, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 588, + 481, + 632 + ], + "type": "text", + "content": "45. Mehnaz, S., Dibbo, S.V., Kabir, E., Li, N., Bertino, E.: Are your sensitive attributes private? novel model inversion attribute inference attacks on classification models. In: 31st USENIX Security Symposium (USENIX Security 22). pp. 4579-4596. USENIX Association, Boston, MA (Aug 2022) 1, 2" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "46. Melis, L., Song, C., De Cristofaro, E., Shmatikov, V.: Exploiting unintended feature leakage in collaborative learning. In: 2019 IEEE symposium on security and privacy (SP). pp. 691-706. IEEE (2019) 2" + } + ] + } + ], + "index": 19 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 161 + ], + "type": "text", + "content": "47. Mireshghallah, F., Taram, M., Ramrakhyani, P., Jalali, A., Tullsen, D., Esmaeilzadeh, H.: Shredder: Learning noise distributions to protect inference privacy. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. pp. 3-18 (2020) 2" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 161, + 481, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 481, + 192 + ], + "type": "text", + "content": "48. Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrak, J., Krause, A.: Lazier than lazy greedy. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 29 (2015) 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 192, + 481, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 192, + 481, + 214 + ], + "spans": [ + { + "bbox": [ + 132, + 192, + 481, + 214 + ], + "type": "text", + "content": "49. Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM journal on computing 24(2), 227-234 (1995) 3" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 214, + 481, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 214, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 481, + 236 + ], + "type": "text", + "content": "50. Olshausen, B.A., Field, D.J.: Sparse coding of sensory inputs. Current opinion in neurobiology 14(4), 481-487 (2004) 2, 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 236, + 481, + 277 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 481, + 277 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 481, + 277 + ], + "type": "text", + "content": "51. Olshausen, B.A., Field, D.J., et al.: Sparse coding of natural images produces localized, oriented, bandpass receptive fields. Submitted to Nature. Available electronically as ftp://redwood.psych.cornell.edu/pub/papers/sparse-coding.ps (1995) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 277, + 481, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 277, + 481, + 311 + ], + "spans": [ + { + "bbox": [ + 132, + 277, + 481, + 311 + ], + "type": "text", + "content": "52. Paiton, D.M., Frye, C.G., Lundquist, S.Y., Bowen, J.D., Zarcone, R., Olshausen, B.A.: Selectivity and robustness of sparse coding networks. Journal of vision 20(12), 10-10 (2020) 2" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 311, + 481, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 311, + 481, + 354 + ], + "spans": [ + { + "bbox": [ + 132, + 311, + 481, + 354 + ], + "type": "text", + "content": "53. Peng, X., Liu, F., Zhang, J., Lan, L., Ye, J., Liu, T., Han, B.: Bilateral dependency optimization: Defending against model-inversion attacks. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 1358-1367 (2022) 2, 6, 7, 10, 11, 12, 13" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 354, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 481, + 374 + ], + "type": "text", + "content": "54. Rigaki, M., Garcia, S.: A survey of privacy attacks in machine learning. ACM Computing Surveys (2020) 2" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 374, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 374, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 374, + 481, + 407 + ], + "type": "text", + "content": "55. Rozell, C.J., Johnson, D.H., Baraniuk, R.G., Olshausen, B.A.: Sparse coding via thresholding and local competition in neural circuits. Neural computation 20(10), 2526-2563 (2008) 2, 3, 5" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 407, + 481, + 440 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 481, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 481, + 440 + ], + "type": "text", + "content": "56. Salem, A., Bhattacharya, A., Backes, M., Fritz, M., Zhang, Y.: {Updates-Leak}: Data set inference and reconstruction attacks in online learning. In: 29th USENIX security symposium (USENIX Security 20). pp. 1291-1308 (2020) 2" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 440, + 481, + 460 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 440, + 481, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 440, + 481, + 460 + ], + "type": "text", + "content": "57. Sannai, A.: Reconstruction of training samples from loss functions. arXiv preprint arXiv:1805.07337 (2018) 8" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 460, + 481, + 493 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 460, + 481, + 493 + ], + "spans": [ + { + "bbox": [ + 132, + 460, + 481, + 493 + ], + "type": "text", + "content": "58. Sanyal, S., Addepalli, S., Babu, R.V.: Towards data-free model stealing in a hard label setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15284-15293 (2022) 1" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 493, + 481, + 535 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 493, + 481, + 535 + ], + "spans": [ + { + "bbox": [ + 132, + 493, + 481, + 535 + ], + "type": "text", + "content": "59. Schneiderman, H.: Feature-centric evaluation for efficient cascaded object detection. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. vol. 2, pp. II-II. IEEE (2004) 2" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 536, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 536, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 536, + 481, + 567 + ], + "type": "text", + "content": "60. Song, L., Mittal, P.: Systematic evaluation of privacy risks of machine learning models. In: 30th USENIX Security Symposium (USENIX Security 21). pp. 2615-2632 (2021) 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 568, + 481, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 568, + 481, + 601 + ], + "spans": [ + { + "bbox": [ + 132, + 568, + 481, + 601 + ], + "type": "text", + "content": "61. Struppek, L., Hintersdorf, D., Correira, A.D.A., Adler, A., Kersting, K.: Plug & play attacks: Towards robust and flexible model inversion attacks. In: International Conference on Machine Learning. pp. 20522-20545. PMLR (2022) 1, 2, 4, 7, 9, 10" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 633 + ], + "type": "text", + "content": "62. Sun, B., Tsai, N.h., Liu, F., Yu, R., Su, H.: Adversarial defense by stratified convolutional sparse coding. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11447-11456 (2019) 2" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "text", + "content": "63. Teti, M., Kenyon, G., Migliori, B., Moore, J.: Lcanets: Lateral competition improves robustness against corruption and attack. In: International Conference on Machine Learning. pp. 21232-21252. PMLR (2022) 2, 5, 6, 7" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 101 + ], + "type": "text", + "content": "S. Dibbo et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 633 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "64. Titcombe, T., Hall, A.J., Papadopoulos, P., Romanini, D.: Practical defences against model inversion attacks for split neural networks. arXiv preprint arXiv:2104.05743 (2021) 2, 4, 7, 8, 10, 11, 12, 13" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "text", + "content": "65. Vepakomma, P., Gupta, O., Swedish, T., Raskar, R.: Split learning for health: Distributed deep learning without sharing raw patient data. arXiv preprint arXiv:1812.00564 (2018) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 183, + 482, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 482, + 216 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 482, + 216 + ], + "type": "text", + "content": "66. Wang, T., Zhang, Y., Jia, R.: Improving robustness to model inversion attacks via mutual information regularization. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 11666-11673 (2021) 2, 7, 10, 11, 12, 13" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 216, + 482, + 248 + ], + "type": "text", + "content": "67. Wang, X., Wang, W.H.: Group property inference attacks against graph neural networks. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. pp. 2871-2884 (2022) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 249, + 482, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 249, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 249, + 482, + 282 + ], + "type": "text", + "content": "68. Wang, Y., Qian, H., Miao, C.: Dualcf: Efficient model extraction attack from counterfactual explanations. In: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency. pp. 1318-1329 (2022) 1" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 282, + 482, + 324 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 282, + 482, + 324 + ], + "spans": [ + { + "bbox": [ + 130, + 282, + 482, + 324 + ], + "type": "text", + "content": "69. Wang, Z., Song, M., Zhang, Z., Song, Y., Wang, Q., Qi, H.: Beyond inferring class representatives: User-level privacy leakage from federated learning. In: IEEE INFOCOM 2019-IEEE conference on computer communications. pp. 2512-2520. IEEE (2019) 2" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 325, + 482, + 358 + ], + "type": "text", + "content": "70. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing 13(4), 600-612 (2004) 8" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 358, + 482, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 392 + ], + "type": "text", + "content": "71. Wei, W., Liu, L., Loper, M., Chow, K.H., Gursoy, M.E., Truex, S., Wu, Y.: A framework for evaluating gradient leakage attacks in federated learning. arXiv preprint arXiv:2004.10397 (2020) 2" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 392, + 482, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 392, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 482, + 413 + ], + "type": "text", + "content": "72. Wu, P., Liu, J., Li, M., Sun, Y., Shen, F.: Fast sparse coding networks for anomaly detection in videos. Pattern Recognition 107, 107515 (2020) 6" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 435 + ], + "type": "text", + "content": "73. Wu, Y., Yu, N., Li, Z., Backes, M., Zhang, Y.: Membership inference attacks against text-to-image generation models. arXiv preprint arXiv:2210.00968 (2022) 8" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 435, + 482, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 435, + 482, + 479 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 482, + 479 + ], + "type": "text", + "content": "74. Yang, Z., Zhang, J., Chang, E.C., Liang, Z.: Neural network inversion in adversarial setting via background knowledge alignment. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. pp. 225-240 (2019) 2" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 479, + 482, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 512 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 512 + ], + "type": "text", + "content": "75. Yuan, X., Ding, L., Zhang, L., Li, X., Wu, D.O.: Es attack: Model stealing against deep neural networks without data hurdles. IEEE Transactions on Emerging Topics in Computational Intelligence 6(5), 1258-1270 (2022) 1" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 512, + 482, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 512, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 512, + 482, + 544 + ], + "type": "text", + "content": "76. Zhang, J., Peng, S., Gao, Y., Zhang, Z., Hong, Q.: Apmsa: adversarial perturbation against model stealing attacks. IEEE Transactions on Information Forensics and Security 18, 1667-1679 (2023) 1" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 545, + 482, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 588 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 588 + ], + "type": "text", + "content": "77. Zhang, Y., Jia, R., Pei, H., Wang, W., Li, B., Song, D.: The secret revealer: Generative model-inversion attacks against deep neural networks. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 253-261 (2020) 2" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 589, + 482, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 589, + 482, + 633 + ], + "spans": [ + { + "bbox": [ + 130, + 589, + 482, + 633 + ], + "type": "text", + "content": "78. Zhong, D., Sun, H., Xu, J., Gong, N., Wang, W.H.: Understanding disparate effects of membership inference attacks and their countermeasures. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security. pp. 959-974 (2022) 1" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 162, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Robustness to MI Attacks via Sparse Coding Architectures" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_content_list.json b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..92e13efcc279f91954858cdad7d022605acff437 --- /dev/null +++ b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_content_list.json @@ -0,0 +1,1687 @@ +[ + { + "type": "text", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "text_level": 1, + "bbox": [ + 235, + 140, + 767, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yifu Chen $^{1,2}$ , Jingwen Chen $^{3}$ , Yingwei Pan $^{3}$ , Yehao Li $^{3}$ , Ting Yao $^{3}$ , Zhineng Chen $^{1,2\\dagger}$ , and Tao Mei $^{3}$", + "bbox": [ + 256, + 210, + 746, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ School of Computer Science, Fudan University", + "bbox": [ + 336, + 253, + 663, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 Shanghai Collaborative Innovation Center of Intelligent Visual Computing", + "bbox": [ + 243, + 268, + 754, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 HiDream.ai Inc.", + "bbox": [ + 439, + 282, + 560, + 295 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "22210240129@m.fudan.edu.cn, {chenjingwen, pandy, liyehao, tiyao}@hidream.ai zhinchen@fudan.edu.cn, tmei@hidream.ai", + "bbox": [ + 215, + 297, + 795, + 324 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Recent years have witnessed the success of large text-to-image diffusion models and their remarkable potential to generate high-quality images. The further pursuit of enhancing the editability of images has sparked significant interest in the downstream task of inpainting a novel object described by a text prompt within a designated region in the image. Nevertheless, the problem is not trivial from two aspects: 1) Solely relying on one single U-Net to align text prompt and visual object across all the denoising timesteps is insufficient to generate desired objects; 2) The controllability of object generation is not guaranteed in the intricate sampling space of diffusion model. In this paper, we propose to decompose the typical single-stage object inpainting into two cascaded processes: 1) semantic pre-inpainting that infers the semantic features of desired objects in a multi-modal feature space; 2) high-fieldity object generation in diffusion latent space that pivots on such inpainted semantic features. To achieve this, we cascade a Transformer-based semantic inpainter and an object inpainting diffusion model, leading to a novel CAscaded Transformer-Diffusion (CAT-Diffusion) framework for text-guided object inpainting. Technically, the semantic inpainter is trained to predict the semantic features of the target object conditioning on unmasked context and text prompt. The outputs of the semantic inpainter then act as the informative visual prompts to guide high-fieldity object generation through a reference adapter layer, leading to controllable object inpainting. Extensive evaluations on OpenImages-V6 and MSCOCO validate the superiority of CAT-Diffusion against the state-of-the-art methods. Code is available at https://github.com/Nnn-s/CATdiffusion.", + "bbox": [ + 259, + 352, + 743, + 698 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Text-guided Object Inpainting $\\cdot$ Diffusion Models", + "bbox": [ + 261, + 710, + 681, + 724 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 746, + 375, + 762 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Traditional image inpainting [3-5,9] focuses on restoring the corrupted area of an image without additional conditions, and is widely applied to object removal", + "bbox": [ + 212, + 773, + 787, + 805 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* This work was performed when Yifu Chen was visiting HiDream.ai as a research intern. † Zhineng Chen is the corresponding author.", + "bbox": [ + 228, + 811, + 785, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/b15a7edacd6593875e28bfbda6ef983829bef188542d286f74a0e7f5e7186eba.jpg", + "image_caption": [ + "Fig. 1: An illustration of conventional object inpainting framework and our proposed CAT-Diffusion. (a) Typical framework commonly feeds a masked image with the original object removed, a text prompt describing the target object (e.g., \"cat\") and a binary mask indicating the designated region to be inpainted into an individual diffusion model for object inpainting. (b) Our proposed CAT-Diffusion additionally pre-inpaint the semantic features of the target object via Transformer-based semantic inpainter, and the derived features are leveraged to steer the diffusion model through the reference adapter layer for controllable and high-fidelity object inpainting." + ], + "image_footnote": [], + "bbox": [ + 258, + 142, + 437, + 354 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/78b7f49da0e367f55059c4254972a00c233bb711b4182ae94288d96759e1574b.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 454, + 142, + 740, + 354 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "or damaged image repairing. Later works [54, 57] have explored leveraging text prompts to complete the missing parts of an image, and shown impressive performances. Recent advances of diffusion-based text-to-image models [17,35,37] have established a steady momentum to produce high-quality images conditioning on text prompts, and derived breakthroughs for image editing task of text-guided object inpainting [1,28,45]. Such inpainting task is to specifically restore a novel object within a masked region with the condition of a given text prompt.", + "bbox": [ + 212, + 527, + 787, + 636 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "One straightforward way for extending existing text-to-image diffusion models [17, 35] to text-guided object inpainting is to generate the new object from random noise and blend the object with background at every denoising step. Nevertheless, this method overlooks the inherent relations between new object and background, and might result in obvious artifacts around masked region and distorted object structure. The phenomenon motivates the subsequent efforts [28, 31] to finetune the text-to-image diffusion model via randomly erasing part of the input image and enforcing the model to recover the missing area based on the associated caption. Despite having promising results, these attempts severely suffer from misalignment between the inpainting object and the given caption, due to the fact that the caption describes the holistic image rather than the local masked region. To address this issue, SmartBrush [45] leverages the object label as prompt and the binary mask as the additional shape guidance", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "to steer the diffusion model for object inpainting. The conventional framework of this kind of object inpainting diffusion models is illustrated in Figure 1(a).", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In general, the difficulty of text-guided object inpainting in diffusion model originates from two perspectives: 1) Solely relying on a single U-Net without model ensembling [11, 46] is insufficient to generate text-aligned objects (i.e., align text prompt and image with varied noise ratios along diffusion process). 2) Precisely controlling the generation of visual objects without extra control signals remains challenging in the intricate sampling space of diffusion model. To mitigate the issues, we present a novel CAT-Diffusion to decompose the typical single-shot object inpainting into two cascaded stages: 1) first semantic pre-inpainting, i.e., inferring semantic feature of target object in a noise-free multi-modal feature space; 2) then object generation, i.e., leveraging the inferred semantic feature as visual prompt to steer diffusion model, thereby leading to high-fidelity object inpainting. Such design eases the learning of object-text alignment in diffusion model. Specifically, a Transformer-based semantic inpainter is first devised to predict the semantic features of the desired object conditioning on the unmasked image context and the text prompt. Note that an effective knowledge distillation objective in a multi-modal feature space (CLIP feature space) is leveraged to supervise the learning of semantic inpainter with ground-truth patch features. Furthermore, the outputs of the semantic inpainter, as the semantically-aligned and context-aware visual prompts, are fed into an object inpainting diffusion model through an additional reference adapter layer. This layer elegantly modulates the visual prompts to enhance the controllability of diffusion model for object inpainting. The overall framework of our proposed CAT-Diffusion is shown in Figure 1(b).", + "bbox": [ + 212, + 178, + 787, + 523 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, we have made the following contributions: 1) The proposed CAT-Diffusion is shown capable of high-fidelity object inpainting through two decomposed stages, i.e., first semantic pre-inpainting and then object generation; 2) The designed diffusion model equipped with a reference adapter layer is shown able to nicely control object inpainting by modulating the visual prompts (i.e., the inpainted semantic features); 3) CAT-Diffusion has been properly verified through extensive experiments over OpenImages-V6 and MSCOCO.", + "bbox": [ + 212, + 523, + 787, + 630 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 655, + 387, + 671 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Traditional Image Inpainting. Conventional image inpainting task aims to synthesize visually coherent and plausible content within the corrupted region of an image. Traditional methods [3-5,9] exploits the spatial redundancy of images to patch holes with image fragments sourced from elsewhere in the image, where the high-level semantics of the image are overlooked. To tackle this problem, recent inpainting techniques [25, 33, 51-53] leverage the semantic prior learned from large-scale image data and dynamically model the global-local interactions in the image with deep models (e.g., Generative Adversarial Networks [12, 29], Transformer-based architectures [23, 42, 48, 49]). However, the learning process will become increasingly challenging with higher image resolution. Thus, some", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 113, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "works [22, 40, 47, 50] are proposed to resolve high-resolution image inpainting and promising results are achieved. Variational Auto-Encoder (VAE) [20] based methods [26, 30, 58, 60] further improve the diversity of outputs by sampling diverse and high-quality structural information from a latent space, and incorporate the derived structure encoding into the image generator for hole filling.", + "bbox": [ + 212, + 146, + 782, + 220 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Text-Guided Image Inpainting. Despite their impressive performances, the aforementioned methods rely on the assumption that sufficient contextual information will be available within the source image. However, this assumption may not always hold. To minimize the loss of semantic information and facilitate greater control over the inpainting process, text prompts are employed as extra conditions in [54, 57], thereby introducing a new task of text-guided object inpainting. This newly introduced task differs fundamentally from conventional image inpainting in requiring visual and semantic consistency with the source image and the text prompt, respectively. The emergence of diffusion models [17, 35, 61] has propelled advancements in text-driven content creation with their powerful capability of high-fidelity image synthesis. Building upon this technology, recent studies [1, 2, 28, 45] showcase the ability to generate a novel object described by a text prompt within a region indicated by a binary mask. Furthermore, SmartBrush [45] uses the object mask as additional guidance during the inpainting process to boost the performances.", + "bbox": [ + 212, + 231, + 784, + 458 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Diffusion Models. Diffusion denoising probabilistic models (DDPM) [17] have reshaped the landscape of image synthesis. However, notable challenges such as high computational demands and low inference efficiency arise, and hinder the deployment of DDPMs in practices. Significant efforts [10, 18, 39] have been dedicated to improve DDPMs and further tap their potentials. Particularly, Latent Diffusion Models (LDMs) [35] train the DDPM in a low-dimensional latent space learned by Variational Auto-Encoder, resulting in faster training and inference while producing high-fidelity images. With these noteworthy improvements, LDMs have solidified the position in the realms of text-to-image synthesis [6, 7, 13, 37, 55], video generation [16, 44, 56], 3D generation [8, 32, 41].", + "bbox": [ + 212, + 467, + 784, + 619 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Summary. In this paper, we investigate the problem of text-guided object inpainting and propose a novel Cascaded Transformer-Diffusion (CAT-Diffusion) framework. In contrast to conventional methods that leaning on an individual diffusion model, our CAT-Diffusion decomposes the single-shot pipeline into two cascaded stages: first semantic pre-inpainting and then object generation. Technically, the semantic features of the target object are pre-inpainted in a noise-free multi-modal feature space (CLIP space). Different from existing methods [2,28] that optimizes the latent code to achieve higher CLIP score between regional/global image and object prompt during inference, our CAT-Diffusion predicts the semantic features of the desired object that naturally align with the prompt by exploiting the mask-unmask visual context and pre-trained multimodal priors in CLIP. Then, such inpainted semantic features are utilized to steer the diffusion model for controllable object generation, which eases the learning of object-text alignment in diffusion model across varied noise ratios.", + "bbox": [ + 212, + 628, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 126 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Approach", + "text_level": 1, + "bbox": [ + 215, + 143, + 346, + 162 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To begin with, it is worth recalling that, in text-guided object inpainting, a novel object described by a text prompt (usually the object label) needs to be generated within a designated region indicated by a binary mask of an input image. Both visual coherence and semantic relevance with the image and the text prompt, respectively, are required in this task. In this section, we will delve into the specifics of our proposed Cascaded Transformer-Diffusion (CAT-Diffusion) after a brief review of diffusion models, followed by the training details.", + "bbox": [ + 212, + 176, + 787, + 282 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Prelimiaries", + "text_level": 1, + "bbox": [ + 215, + 304, + 361, + 316 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Denoising Diffusion Probabilistic Model (DDPM) [17], a new type of generative model, can be regarded as a parameterized Markov chain able to produce images that closely match a desired data distribution within finite timesteps $T$ . Generally, a forward diffusion process and a reverse denoising process are involved in DDPM. Specifically, in the forward diffusion process, DDPM gradually applies noise to the image according to a pre-defined variance schedule $\\{\\beta_t\\}_1^T$ until the image is fully destroyed. Conversely, during the reverse denoising process, DDPM is trained to estimate the added noise to the noisy image and progressively remove it over a sequence of $T$ timesteps. The training objective of DDPM (usually implemented as a U-Net [36]) parameterized by $\\theta$ can be simply formulated as", + "bbox": [ + 212, + 328, + 787, + 479 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {d d p m} (\\theta , x) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} (x _ {t}, t, c) - \\epsilon \\| _ {2} ^ {2} ], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 321, + 492, + 784, + 510 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\epsilon$ is a random noise sampled from the normal distribution $\\mathcal{N}(0, I)$ , $c$ is some kind of condition (e.g., text prompt), and $x_{t}$ is the noisy image at timestep $t$ derived as follows:", + "bbox": [ + 212, + 520, + 787, + 563 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nx _ {t} = \\sqrt {\\bar {\\alpha} _ {t}} x _ {0} + \\sqrt {1 - \\bar {\\alpha} _ {t}} \\epsilon , \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 565, + 784, + 580 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\alpha_{t} = 1 - \\beta_{t}$ , $\\bar{\\alpha}_{t} = \\prod_{s=1}^{t} \\alpha_{s}$ . To address the challenge of training DDPM at higher resolutions with limited GPU resources, Latent Diffusion Model (LDM) [35] instead trains DDPM in latent space of lower dimensions than pixel space. In this paper, we follow the similar recipe, and the training objective Eq. 1 can be rewritten as:", + "bbox": [ + 212, + 587, + 787, + 662 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {l d m} (\\theta , z) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} (z _ {t}, t, c) - \\epsilon \\| _ {2} ^ {2} ], \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 674, + 784, + 691 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $z$ is the latent representation of $x$ and usually obtained from a pre-trained Variational Auto-Encoder (VAE).", + "bbox": [ + 212, + 702, + 785, + 733 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Cascaded Transformer-Diffusion Model", + "text_level": 1, + "bbox": [ + 215, + 753, + 584, + 768 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Let $x$ , $c$ and $m$ be an input image, a text prompt that describes the novel object, and a binary mask that indicates the region to be inpainted, respectively. Most of the existing text-guided object inpainting diffusion models [1, 28] are merely optimized to align the text prompt $c$ and the desired object $x \\odot m$ in", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 114, + 732, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/410f23ddc3591b3cc113d1ead7d273c73b722b5f856bd3c3f3c87c2dcbc619c5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 232, + 143, + 772, + 366 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/46ed5c786b1fc34cca9f9313fe325e1439b718901077d63210d0a4207de40d82.jpg", + "image_caption": [ + "Frozen Parameters" + ], + "image_footnote": [], + "bbox": [ + 230, + 368, + 250, + 382 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/fcab3b2749adac345ccd172078bb688e1f2206a97017ac9aae2597e009dad50e.jpg", + "image_caption": [ + "Trainable Parameters", + "Fig. 2: The framework of our CAT-Diffusion. Specifically, a pre-trained image encoder is first employed to extract the visual features of the masked image. Then, a novel semantic inpainter takes these visual features and a text prompt as inputs, and preinpaints the semantic features of the desired object in a multi-modal feature space, thereby aligning the prompt and the visual object in addition to the U-Net regardless of denoising timesteps. To achieve this goal, knowledge distillation is adopted to transfer the multi-modal knowledge from a teacher model to the semantic inpainter. Finally, an object inpainting diffusion model equipped with a reference adapter layer is steered by the aligned semantic features for controllable object inpainting in visual space." + ], + "image_footnote": [], + "bbox": [ + 336, + 368, + 354, + 381 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/5400f34a71c1c0929096a37e326f0d169b730caec9af9e1d0c6e00261c3048c9.jpg", + "image_caption": [ + "Text Feature" + ], + "image_footnote": [], + "bbox": [ + 454, + 369, + 470, + 381 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/67e9e93fb8879361bbdd08f2ca2119a8ee482403d78e872bc7c702223d6a5ffd.jpg", + "image_caption": [ + "Position Embedding" + ], + "image_footnote": [], + "bbox": [ + 537, + 369, + 553, + 381 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/9c75cbf7767932d80d74b5d5e7ea0d15bd65a6bc08fbea259069342d62fb7dad.jpg", + "image_caption": [ + "Mask Embedding" + ], + "image_footnote": [], + "bbox": [ + 650, + 369, + 678, + 381 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "the latent space, which leads to suboptimal results. As discussed previously in Section. 1, two primary issues need to be addressed for further improvements: 1) Relying on a standalone U-Net to achieve visual-semantic alignment across all denoising timesteps is insufficient [11,46] for text-guided object inpainting; 2) It is challenging to stably generate high-fidelity objects in the intricate sampling space without extra semantic information.", + "bbox": [ + 212, + 561, + 787, + 652 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To overcome these challenges, we propose to decompose the conventional single-stage pipeline into two cascaded stages: first semantic pre-inpainting and then object generation, leading to our CAT-Diffusion. Technically, our CAT-Diffusion pre-inpaints the object in an auxiliary multi-modal feature space (e.g., CLIP [34]) via a novel semantic inpainter. The semantic inpainter is trained through knowledge distillation [27] to predict the semantic features of the target object conditioning on the unmasked visual context and text prompt. This way, the derived outputs naturally align the text prompt and the visual object in addition to the U-Net regardless of the denoising timesteps. The outputs from the semantic inpainter is further integrated into an object inpainting diffusion model through a reference adapter layer for controllable object inpainting. The overall framework of CAT-Diffusion is shown in Figure 2.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 126 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Semantic Inpainter. To alleviate the deficiency in aligning text prompt and visual object solely depending on a standalone U-Net across the entire denoising process, we propose to enhance the visual-semantic correspondence in a well pre-trained auxiliary multi-modal feature space in addition to the U-Net by inpainting the semantic features of the desired object. The rationale behind is that the pre-trained multi-modal feature space is learned on large-scale cross-modal data for visual-semantic alignment regardless of the denoising timesteps. In this work, an effective knowledge distillation objective is devised to transfer this kind of multi-modal knowledge from a teacher model (CLIP) to the semantic inpainter in our CAT-Diffusion.", + "bbox": [ + 212, + 146, + 782, + 296 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Specifically, a Transformer-based semantic inpainter (SemInpainter) parameterized by $\\eta$ is cascaded with a object inpainting diffusion model in our CAT-Diffusion, as shown in the upper part of Figure 2. First, the visual features $\\{\\hat{\\mathbf{v}}_i\\}_{1}^{N}$ of the masked image $x\\odot (1 - m)$ are extracted by the image encoder of CLIP (ImageEnc), where $\\hat{\\mathbf{v}}_i\\in \\mathbb{R}^d$ is a feature vector of a local image patch. Given the corrupted features $\\{\\hat{\\mathbf{v}}_i\\}_{1}^{N}$ of the masked image and the textual feature $\\mathbf{c}\\in \\mathbb{R}^{d}$ of the text prompt $c$ , SemInpainter aims to predict semantic features $\\{\\bar{\\mathbf{v}}_i\\}_{1}^{N}$ that faithfully reconstruct the target object in CLIP space. This way, the visual-semantic alignment is naturally attained along the entire denoising process of diffusion model. This whole process can be expressed as", + "bbox": [ + 212, + 297, + 784, + 448 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\{\\bar {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} = S e m I n p a i n t e r ([ \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} + \\mathbf {P E} + \\mathbf {M E}, \\mathbf {c} ]),\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 460, + 678, + 479 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\left. \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} = \\operatorname {I m a g e E n c} (x \\odot (1 - m)), \\right. \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 326, + 473, + 784, + 500 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $[\\cdot ]$ denotes the concatenation operation, $\\mathbf{PE}\\in \\mathbb{R}^{N\\times d}$ is a learnable position embedding, and $\\mathbf{ME}\\in \\mathbb{R}^{N\\times d}$ is a learnable mask embedding that indicates whether the visual feature $\\hat{\\mathbf{v}}_i$ is masked in the image $x\\odot (1 - m)$ or not. Our SemInpainter is implemented as 24-layer Transformer structure (similar to the CLIP [34] image encoder). Finally, we derive the inpainted features $\\{\\tilde{\\mathbf{v}}_i\\}_{1}^N$ , which will be later incorporated into the object inpainting diffusion model, by blending $\\{\\hat{\\mathbf{v}}_i\\}_{1}^N$ and $\\{\\overline{\\mathbf{v}}_i\\}_{1}^N$ with the binary mask $m$ :", + "bbox": [ + 214, + 512, + 782, + 619 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\{\\tilde {\\mathbf {v}} _ {i} \\} _ {1} ^ {N / 4} = D o w n S a m p l e (\\{\\bar {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} \\odot m + \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} \\odot (1 - m)), \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 297, + 632, + 784, + 652 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $DownSample(\\cdot)$ is a parameter-free downsample layer to reduce the feature resolution for computation efficiency.", + "bbox": [ + 212, + 662, + 782, + 691 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To enforce the predicted object features aligning with the text prompt $c$ , we propose to transfer the multi-modal knowledge from a teacher model (CLIP is adopted as the teacher model in this paper) to the SemInpainter. Technically, the SemInpainter is trained with the task of Masked Feature Prediction [27,43] to recover the ground-truth semantic features of the masked object in CLIP space conditioned on the unmasked visual context and the text prompt $c$ .", + "bbox": [ + 212, + 694, + 782, + 784 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Reference Adapter Layer. Since controlling the diffusion model for high-fidelity text-to-image generation remains challenging, inspired by [55, 59], the", + "bbox": [ + 214, + 809, + 782, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "semantic features $\\{\\tilde{\\mathbf{v}}_i\\}_{1}^{N / 4}$ are utilized as additional conditions, referred as visual prompts, to steer the diffusion model for controllable inpainting in latent space.", + "bbox": [ + 212, + 145, + 782, + 176 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Specifically, we introduce a new reference adapter layer (RefAdapter) to the base object inpainting diffusion model, which is formulated as a multi-head cross-attention layer of Transformer style. The proposed RefAdapter is alternately plugged in between the original self-attention (SelfAttn) and cross-attention layers (CrossAttn) of the U-Net, as shown in the lower part of Figure 2. Let $\\mathbf{H} \\in \\mathbb{R}^{N_h \\times d_h}$ be the intermediate hidden states of the U-Net, where $N_h$ varies along with the resolution of different layers. $\\mathbf{C} \\in \\mathbb{R}^{N_c \\times d_c}$ is the textual features of the prompt $c$ extracted by the text encoder in the diffusion model. A shared module prototype for different types of attention layers is first defined as:", + "bbox": [ + 212, + 176, + 784, + 313 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\text {O u t p u t} = \\text {M o d u l e} (\\text {Q u e r y}, \\text {K e y}, \\text {V a l u e}). \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 357, + 321, + 784, + 338 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Therefore, a full block in the upgraded U-Net including SelfAttn, RefAdapter and CrossAttn operates as", + "bbox": [ + 214, + 345, + 782, + 376 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {H} _ {x} = \\operatorname {C r o s s A t t n} \\left(\\mathbf {H} _ {r}, \\mathbf {C}, \\mathbf {C}\\right) + \\mathbf {H} _ {r},\n$$\n", + "text_format": "latex", + "bbox": [ + 330, + 383, + 576, + 398 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {H} _ {r} = \\operatorname {R e f A d a p t e r} \\left(\\mathbf {H} _ {s}, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}\\right) + \\mathbf {H} _ {s}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 331, + 402, + 784, + 422 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {H} _ {s} = \\operatorname {S e l f A t t n} (\\mathbf {H}, \\mathbf {H}, \\mathbf {H}) + \\mathbf {H},\n$$\n", + "text_format": "latex", + "bbox": [ + 331, + 425, + 553, + 441 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathbf{H}_x$ will be the input to the next block.", + "bbox": [ + 214, + 448, + 545, + 463 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Object Inpainting Diffusion Model. By decomposing the object inpainting pipeline into the two cascaded processes, our CAT-Diffusion can generate high-fidelity objects that are semantically aligned with the text prompt. Moreover, the visual coherence between the filled-in object and the surrounding image context is further enhanced by steering the diffusion model with additional semantic guidance (i.e., the inpainted visual features $\\{\\tilde{\\mathbf{v}}_i\\}_{1}^{N/4}$ ).", + "bbox": [ + 212, + 483, + 784, + 575 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Generally, an inpainting diffusion model with U-Net parameterized as $\\epsilon_{\\theta}$ takes the noisy latent code $z_{t}$ , the mask $m$ indicating the region to be inpainted and the masked latent code $z \\odot (1 - m)$ as inputs, and estimates the noise to be removed from $z_{t}$ , leading to the denoised one $z_{t-1}$ . Mathematically, the overall procedure can be expressed as", + "bbox": [ + 212, + 575, + 784, + 650 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nz _ {t - 1} = \\frac {1}{\\sqrt {\\alpha_ {t}}} \\left(z _ {t} - \\frac {1 - \\alpha_ {t}}{\\sqrt {1 - \\bar {\\alpha} _ {t}}} \\cdot \\epsilon_ {\\theta} \\left(\\left[ z _ {t}, z \\odot (1 - m), m \\right], t, c, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}\\right)\\right) + \\sigma_ {t} \\epsilon . \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 238, + 657, + 784, + 689 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The readers can refer to [17,35] for more details.", + "bbox": [ + 215, + 696, + 566, + 712 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Training", + "text_level": 1, + "bbox": [ + 215, + 731, + 333, + 747 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Diffusion Loss. For the training of the object inpainting diffusion model equipped with the reference adapter layer, we employ the general practice in [35] following the objective function as", + "bbox": [ + 212, + 753, + 795, + 799 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {l d m} (\\theta , z, m) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} ([ z _ {t}, z \\odot (1 - m), m ], t, c, \\{\\tilde {\\mathbf {v}} _ {i} \\} _ {1} ^ {N / 4}) - \\epsilon \\| _ {2} ^ {2} ]. \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 223, + 806, + 784, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Knowledge Distillation Loss. Moreover, to enforce the semantic inpainter to pre-inpaint the object features that are semantically aligned with the prompt $c$ , we supervise the semantic inpainter with the ground-truth visual features $CLIP(x)$ in the task of Masked Feature Prediction. The optimization objective can be formulated as", + "bbox": [ + 212, + 146, + 782, + 220 + ], + "page_idx": 8 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} _ {\\text {d i s t i l l}} (\\eta , x, m) = \\mathbb {E} _ {(x, c) \\sim \\{\\mathcal {X}, \\mathcal {C} \\}} [ \\| S e m I n p a i n t e r _ {\\eta} (I m a g e E n c (x \\odot (1 - m)), c) \\\\ - C L I P (x) \\| _ {2} ^ {2} ], \\tag {10} \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 232, + 232, + 785, + 281 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "where $\\{\\mathcal{X},\\mathcal{C}\\}$ is the training dataset of paired image $x$ and text prompt $c$ , and $\\eta$ denotes the trainable parameters of the proposed SemInpainter in Section 3.2.", + "bbox": [ + 212, + 282, + 782, + 313 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 337, + 374, + 353 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We verify the merit of the proposed Cascaded Transformer-Diffusion approach (CAT-Diffusion) for the task of text-guided object inpainting and compare with state-of-the-art diffusion-based methods [1, 2, 28, 35, 45]. Extensive experiments validate the effectiveness of CAT-Diffusion in inpainting high-fidelity objects.", + "bbox": [ + 212, + 369, + 782, + 431 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Implementation Details", + "text_level": 1, + "bbox": [ + 214, + 453, + 455, + 468 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Following [45], we train CAT-Diffusion on the pairs of local mask and the corresponding object label from the training set of OpenImages-V6 [21]. CAT-Diffusion is optimized by Adam [19] with learning rate 0.00001 for about 40K iterations on 8 A100 GPUs. Batch size is set to 128 and the input image resolution is set as $512 \\times 512$ .", + "bbox": [ + 212, + 479, + 782, + 554 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Compared Methods and Evaluation Metrics", + "text_level": 1, + "bbox": [ + 214, + 579, + 624, + 594 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Compared Methods. We compare CAT-Diffusion with several state-of-the-art diffusion-based approaches including Blended Diffusion [2], Blended Latent Diffusion [1], GLIDE [28], SmartBrush [45], Stable Diffusion [35] and Stable Diffusion Inpainting. Specifically, Blended Diffusion, Blended Latent Diffusion and Stable Diffusion simply leverage a pre-trained base text-to-image model for text-guided object inpainting by blending the generated object and the background at each denoising step. The other methods train an inpainting diffusion model with the text prompt, binary mask and masked image as the inputs. Due to the same evaluation setup, the results of all methods are taken from [45], except for [1]. Please note that we have replaced the text-to-image stable diffusion 2.1 with 1.5 in Blended Latent Diffusion for fair comparisons.", + "bbox": [ + 212, + 604, + 784, + 771 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Evaluation Metrics. All the aforementioned methods are evaluated on the test sets of both OpenImages-V6 [21] and MSCOCO [24], leading to 13,400 and 9,311 test images, respectively. We adopt three widely-used metrics: Frechet", + "bbox": [ + 212, + 794, + 782, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 114, + 732, + 130 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Inception Distance (FID) [15, 38], Local FID and CLIP score [14]. It is worth mentioning that FID and Local FID measure the realism and visual coherence of the inpainted object in global image and local patch respectively, while CLIP score estimates the semantic relevance between the inpainted object and the text prompt. User study is additionally involved to evaluate both the visual coherence and text-object alignment. Since GLIDE only supports images of resolution 256 $\\times$ 256, we resize all the results to the similar size for fair comparisons. Moreover, both segmentation mask and bounding box mask are considered in evaluation.", + "bbox": [ + 212, + 146, + 787, + 268 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.3 Performance Comparisons", + "text_level": 1, + "bbox": [ + 215, + 289, + 478, + 304 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Quantitative Results on OpenImages-V6. Table 1 summarizes the results of all the methods on test set of OpenImages-V6. Overall, results across all the metrics consistently demonstrate the effectiveness of our proposed CAT-Diffusion with segmentation mask or bounding box mask. Specifically, blending-based approaches (i.e., Blended Latent Diffusion and Stable Diffusion) achieve comparable CLIP scores but much inferior FID and Local FID scores to our CAT-Diffusion. We speculate that this is because these methods merely focus on the visual-semantic alignment between the inpainted image and the object label, and simply blend the generated object and background in the latent space. As such, the semantic context of the surrounding unmasked regions is overlooked, resulting in poor visual coherence. SmartBrush, by incorporating the masked image into U-Net for context learning and further guiding the diffusion model with shape mask, exhibits better performances. However, the FID and Local FID scores of SmartBrush are still below those of our CAT-Diffusion. The results verify the impact of steering the diffusion model with the pre-inpainted object features from the semantic inpainter through the reference adapter layer.", + "bbox": [ + 212, + 313, + 787, + 555 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Quantitative Results on MSCOCO. Table 2 lists the results of all the approaches on the test set of MSCOCO. It is noteworthy that neither SmartBrush nor our CAT-Diffusion are trained on MSCOCO. Similar to the trends on OpenImages-V6, CAT-Diffusion outperforms the other methods across most of the metrics. Specifically, CAT-Diffusion leads to the relative improvements over the strong baselines Stable Diffusion Inpainting and SmartBrush by $42.1\\%$ and $20.7\\%$ on Local FID (with bounding box mask), respectively. The results again validate the merit of decomposing the single-shot inpainting pipeline into two cascaded processes (first semantic pre-inpainting and then object generation) in our CAT-Diffusion.", + "bbox": [ + 212, + 575, + 789, + 727 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Qualitative Comparisons. Then, we qualitatively test different methods through case study. Figure 3 showcases several examples. As depicted by the top four results, the generated images by our CAT-Diffusion show better semantic alignment with the input text prompt than the other approaches. Moreover, better visual coherence of the objects with the surrounding context in the images and more accurate object shapes are also observed in the inpainted results of our", + "bbox": [ + 212, + 750, + 805, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/26a58dcfbdd9c441d8654f981ac7b9db38046ef10deaeaf4aea43bed50300e79.jpg", + "table_caption": [ + "Table 1: Quantitative performance comparisons on the test set of OpenImages-V6." + ], + "table_footnote": [], + "table_body": "
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]9.7221.930.26111.0529.160.265
GLIDE [28]9.0321.090.2509.7022.450.252
Blended Latent Diffusion† [1]8.3015.280.26214.8625.460.262
Stable Diffusion [35]6.9012.270.2639.1015.280.265
Stable Inpainting [35]5.8410.980.2617.0712.570.264
SmartBrush [45]4.707.820.2636.009.710.266
CAT-Diffusion (ours)3.996.320.2635.027.760.265
", + "bbox": [ + 217, + 171, + 785, + 319 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/7f677a4cc99c90b9bf621b550c11adb7e51e33084b450a395a677a85329cf1ba.jpg", + "table_caption": [ + "Table 2: Quantitative performance comparisons on the test set of MSCOCO." + ], + "table_footnote": [], + "table_body": "
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]8.1626.250.24412.6841.430.251
Blended Latent Diffusion† [1]7.8819.840.24612.4029.530.248
Stable Diffusion [35]7.7817.160.24612.2925.610.250
GLIDE [28]6.9824.250.2359.3230.720.241
Stable Inpainting [35]6.5415.160.2438.5018.130.246
SmartBrush [45]5.769.800.2498.0513.220.252
CAT-Diffusion (ours)5.358.530.2496.8410.490.251
", + "bbox": [ + 217, + 358, + 785, + 505 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "CAT-Diffusion. The results prove the superiority of pre-inpainting the semantic features of the objects through the proposed semantic inpainter. For instance, compared to the images produced by other methods, the man generated by CAT-Diffusion at the first row is more structurally complete. This benefits from steering the diffusion model with the pre-inpainted semantic features of the target object through the reference adapter layer in our CAT-Diffusion. Though there is no shape mask provided, our CAT-Diffusion is able to generate high-fidelity objects given the text prompts and the bounding box masks (the middle two rows). Additionally, we evaluate object inpainting with more descriptive text prompts and the generated results of different methods are shown in the bottom two rows. Similarly, our CAT-Diffusion produces more visually pleasing images.", + "bbox": [ + 212, + 532, + 787, + 700 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "User Study. Next, we carry out a user study to examine whether the inpainting images conform to human preferences. In the experiments, we randomly sample 1K images from the test set of OpenImages-V6 for evaluation. Note that SmartBrush [45] is not released and excluded here. We invite 10 evaluators (5 males and 5 females) with diverse education backgrounds: art design (4), psychology (2), computer science (2), and business (2). We show all the evaluators the inpainted images and the associated prompts, and ask them to assign scores $(0\\sim$ 5) from two aspects: 1) Visual coherence with the surrounding context; 2) Align-", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 113, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/b0b04d597d72099ef97f33a94679fab05ed42fb2d90b6f76a41a53ae8dc4f44a.jpg", + "image_caption": [ + "Fig.3: Examples generated by Stable Diffusion, Stable Diffusion Inpainting, GLIDE, Blended Diffusion, Blended Latent Diffusion and our proposed CAT-Diffusion with segmentation mask or bounding box mask." + ], + "image_footnote": [], + "bbox": [ + 230, + 147, + 772, + 535 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "ment with the text prompt and the accurate object shape. Table 3 summarizes the averaged results of different approaches. As indicated by the results, CAT-Diffusion leads the competition by a large margin against the other baselines in terms of both text-object alignment and visual coherence.", + "bbox": [ + 212, + 622, + 787, + 684 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 Analysis and Discussions", + "text_level": 1, + "bbox": [ + 214, + 707, + 468, + 722 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation Study on CAT-Diffusion. Here, we study how each component in CAT-Diffusion influences the overall performance. We consider one or more component at each stage and Table 4 summarizes the results on the test set of OpenImages-V6 with segmentation mask. Note that the baseline at Row #1 is a Stable Inpainting model finetuned with object-text pairs from [21]. By incorporating the reference adapter layer that is trained with CLIP features of masked images $x \\odot (1 - m)$ only, the variant at Row #2 makes the absolute improvement", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/02dde80727ec7597c30243282adc75e534a288411221e27a19c82b321c5e3d19.jpg", + "table_caption": [ + "Table 3: User study on 1K images randomly sampled from the test set of OpenImages-V6. BLD, SD and SD-Inapint are short for Blended Latent Diffusion, Stable Diffusion and Stable Diffusion Inpainting, respectively." + ], + "table_footnote": [], + "table_body": "
GLIDEBLDSDSD-InpaintCAT-Diffusion
Text-Object Alignment1.11.11.02.23.5
Visual Coherence1.21.21.12.63.6
", + "bbox": [ + 238, + 198, + 764, + 258 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/f831c49d84fd42c10290c1526b9a31b39a3466c566f50ed4dce2b31ab007b3fe.jpg", + "table_caption": [ + "Table 4: Ablation study of the proposed CAT-Diffusion on the test set of OpenImages-V6 with segmentation mask." + ], + "table_footnote": [], + "table_body": "
#RefAdSemInptFID ↓Local FID ↓CLIP ↑
15.158.800.262
2✓4.247.330.262
3✓✓3.996.320.263
", + "bbox": [ + 310, + 311, + 692, + 388 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "over the base model at Row #1 by 0.91 and 1.47 on FID and Local FID scores, respectively. This is not surprising as the CLIP features of the unmasked region endow the base diffusion model with richer contextual semantics through the reference adapter layer, improving visual coherence and preserving the background. The outputs of semantic inpainter further boost the model with the semantics of the desired object, obtaining the best results at Row #3 across all the metrics.", + "bbox": [ + 212, + 415, + 787, + 506 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Predicted Features by Semantic Inpainter. We then analyze the extent to which the proposed semantic inpainter improves the semantic features of the desired objects. It is worth noting that the CLIP features of the masked region inherently encode the contextual semantics from the unmasked area due to self-attention mechanism in CLIP, resulting in non-trivial similarity with the ground-truth ones before passing through semantic inpainter. In particular, we compute the cosine similarity between the inputs/outputs of the semantic inpainter within the masked region and the corresponding ground-truth ones on 10K images. Figure 4(a) depicts the two distributions. The averaged cosine similarity is boosted from 0.47 to 0.65, demonstrating the effectiveness of the proposed semantic inpainter. Though the outputs from semantic inpainter are not $100\\%$ accurate, richer context is contributed by these semantic features to generate high-fidelity objects in CAT-Diffusion.", + "bbox": [ + 212, + 529, + 787, + 726 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Diversity of Inpainted Results. In order to test the diversity of the inpainted results by our CAT-Diffusion with the same semantic features derived from the semantic inpainter, we conduct a study on the results with different random seeds. Figure 4(b) shows two examples. It can be observed that our CAT-Diffusion is able to inpaint diverse objects with accurate shapes controlled by the reference adapter layer.", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 113, + 732, + 130 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/33355d1b4ae31a74842f81e75fd1ddfbdb204876513c6f474ae7455290a6fe02.jpg", + "image_caption": [ + "(a) Feature Similarity" + ], + "image_footnote": [], + "bbox": [ + 243, + 143, + 498, + 250 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/5f311d4756273b3bf5002ed73035e2ff4a90e24a75f901079e26eed3b02531e5.jpg", + "image_caption": [ + "(b) Diversity of Inpainted Results", + "Fig. 4: (a) The distributions of cosine similarity between the semantic features before/after the semantic inpinter within the masked region and the corresponding ground-truth ones. (b) Diverse inpainted images generated by our proposed CAT-Diffusion using different random seeds." + ], + "image_footnote": [], + "bbox": [ + 504, + 146, + 756, + 250 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Inference Complexity. During inference, we only require one-pass forward of the proposed semantic inpainter and the inpainted features can be reused in each denoising step, leading to minor computation overhead. The average time of our CAT-Diffusion (1.84 secs) for each image compared with SD-Inpaint (1.60 secs).", + "bbox": [ + 212, + 364, + 787, + 428 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 448, + 359, + 464 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, a novel Cascaded Transformer-Diffusion (CAT-Diffusion) model is proposed to enhance the visual-semantic alignment and controllability of diffusion model for text-guided object inpainting. Specifically, our CAT-Diffusion decomposes the conventional single-stage pipeline into two cascaded processes: first semantic pre-inpainting and then object generation. By pre-inpainting the semantic features of the desired objects in a multi-modal feature space and then guiding the diffusion model with these features for object generation, our CAT-Diffusion is able to generate high-fidelity objects semantically aligned with the prompt and visually coherent with the background. Technically, a Transformer-based semantic inpainter predicts the semantic features of the desired object given the unmasked context and the prompt. Then, the inpainted features from the semantic inpainter are further fed into the object inpainting diffusion model via a reference adapter layer for controlled generation. Extensive experiments on OpenImages-V6 and MSCOCO validate the effectiveness of our CAT-Diffusion.", + "bbox": [ + 212, + 479, + 787, + 691 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Broader Impact. Recent advancements in generative models (e.g., diffusion models) have unlocked new realms of creative media generation. However, these innovations also bear the potential to be misused for the generation of deceive content. Our approach may be exploited to inpaint harmful content into images for misinformation spread, and we strongly disapprove of such actions.", + "bbox": [ + 212, + 712, + 787, + 787 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgement. This work was supported by National Natural Science Foundation of China (No. 62172103, 32341012).", + "bbox": [ + 214, + 809, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Trans. Graph. 42(4), 1-11 (2023)", + "2. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: CVPR (2022)", + "3. Ballester, C., Bertalmio, M., Caselles, V., Sapiro, G., Verdera, J.: Filling-in by joint interpolation of vector fields and gray levels. IEEE transactions on image processing 10(8), 1200-1211 (2001)", + "4. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009)", + "5. Bertalmio, M., Sapiro, G., Caselles, V., Ballester, C.: Image inpainting. In: SIGGRAPH (2000)", + "6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: CVPR (2023)", + "7. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023)", + "8. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023)", + "9. Criminisi, A., Pérez, P., Toyama, K.: Region filling and object removal by exemplar-based image inpainting. IEEE Transactions on image processing 13(9), 1200-1212 (2004)", + "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021)", + "1. Feng, Z., Zhang, Z., Yu, X., Fang, Y., Li, L., Chen, X., Lu, Y., Liu, J., Yin, W., Feng, S., et al.: Ernie-vilg 2.0: Improving text-to-image diffusion model with knowledge-enhanced mixture-of-denoising-experts. In: CVPR (2023)", + "2. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)", + "3. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022)", + "4. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021)", + "5. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017)", + "6. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., et al.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022)", + "7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020)", + "8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)", + "9. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)", + "20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. arXiv preprint: arXiv:1312.6114 (2013)" + ], + "bbox": [ + 225, + 176, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "21. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision 128(7), 1956-1981 (2020)", + "22. Li, W., Lin, Z., Zhou, K., Qi, L., Wang, Y., Jia, J.: MAT: mask-aware transformer for large hole image inpainting. In: CVPR (2022)", + "23. Li, Y., Yao, T., Pan, Y., Mei, T.: Contextual transformer networks for visual recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(2), 1489-1500 (2022)", + "24. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV (2014)", + "25. Liu, G., Reda, F.A., Shih, K.J., Wang, T., Tao, A., Catanzaro, B.: Image inpainting for irregular holes using partial convolutions. In: ECCV (2018)", + "26. Liu, H., Wan, Z., Huang, W., Song, Y., Han, X., Liao, J.: PD-GAN: probabilistic diverse GAN for image inpainting. In: CVPR (2021)", + "27. Navaneet, K., Koohpayegani, S.A., Tejankar, A., Pirsiavash, H.: Simreg: Regression as a simple yet effective tool for self-supervised knowledge distillation. arXiv preprint arXiv:2201.05131 (2022)", + "28. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)", + "29. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: ACM MM (2017)", + "30. Peng, J., Liu, D., Xu, S., Li, H.: Generating diverse structure for image inpainting with hierarchical VQ-VAE. In: CVPR (2021)", + "31. von Platen, P., Patil, S., Lozhkov, A., Cuenca, P., Lambert, N., Rasul, K., Davaadorj, M., Wolf, T.: Diffusers: State-of-the-art diffusion models. https://github.com/huggingface/diffusers (2022)", + "32. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022)", + "33. Quan, W., Zhang, R., Zhang, Y., Li, Z., Wang, J., Yan, D.: Image inpainting with local and global refinement. IEEE Trans. Image Process. 31, 2405-2420 (2022)", + "34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021)", + "35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022)", + "36. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015)", + "37. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. NeurIPS 35, 36479-36494 (2022)", + "38. Seitzer, M.: pytorch-fid: FID Score for PyTorch. https://github.com/mseitzer/pytorch-fid (August 2020), version 0.3.0", + "39. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)", + "40. Song, Y., Yang, C., Lin, Z.L., Liu, X., Huang, Q., Li, H., Kuo, C.J.: Contextual-based image inpainting: Infer, match, and translate. In: ECCV (2018)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Yifu Chen et al.", + "bbox": [ + 271, + 114, + 380, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "41. Tang, J., Wang, T., Zhang, B., Zhang, T., Yi, R., Ma, L., Chen, D.: Make-it-3d: High-fidelity 3d creation from a single image with diffusion prior. arXiv preprint arXiv:2303.14184 (2023)", + "42. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. NeurIPS 30 (2017)", + "43. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: CVPR (2022)", + "44. Wu, J.Z., Ge, Y., Wang, X., Lei, S.W., Gu, Y., Shi, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. In: ICCV (2023)", + "45. Xie, S., Zhang, Z., Lin, Z., Hinz, T., Zhang, K.: Smartbrush: Text and shape guided object inpainting with diffusion model. In: CVPR (2023)", + "46. Xue, Z., Song, G., Guo, Q., Liu, B., Zong, Z., Liu, Y., Luo, P.: Raphael: Text-to-image generation via large mixture of diffusion paths. arXiv preprint arXiv:2305.18295 (2023)", + "47. Yang, C., Lu, X., Lin, Z., Shechtman, E., Wang, O., Li, H.: High-resolution image inpainting using multi-scale neural patch synthesis. In: CVPR (2017)", + "48. Yao, T., Li, Y., Pan, Y., Mei, T.: Hiri-vit: Scaling vision transformer with high resolution inputs. IEEE Transactions on Pattern Analysis and Machine Intelligence (2024)", + "49. Yao, T., Li, Y., Pan, Y., Wang, Y., Zhang, X.P., Mei, T.: Dual vision transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(9), 10870-10882 (2023)", + "50. Yi, Z., Tang, Q., Azizi, S., Jang, D., Xu, Z.: Contextual residual aggregation for ultra high-resolution image inpainting. In: CVPR (2020)", + "51. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Generative image inpainting with contextual attention. In: CVPR (2018)", + "52. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Free-form image inpainting with gated convolution. In: ICCV (2019)", + "53. Zeng, Y., Fu, J., Chao, H., Guo, B.: Learning pyramid-context encoder network for high-quality image inpainting. In: CVPR (2019)", + "54. Zhang, L., Chen, Q., Hu, B., Jiang, S.: Text-guided neural image inpainting. In: ACM MM (2020)", + "55. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV (2023)", + "56. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024)", + "57. Zhang, Z., Zhao, Z., Zhang, Z., Huai, B., Yuan, J.: Text-guided image inpainting. In: ACM MM (2020)", + "58. Zhao, L., Mo, Q., Lin, S., Wang, Z., Zuo, Z., Chen, H., Xing, W., Lu, D.: Uctgan: Diverse image inpainting based on unsupervised cross-space translation. In: CVPR (2020)", + "59. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unicontrolnet: All-in-one control to text-to-image diffusion models. arXiv preprint arXiv:2305.16322 (2023)", + "60. Zheng, C., Cham, T.J., Cai, J.: Pluralistic image completion. In: CVPR (2019)", + "61. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024)" + ], + "bbox": [ + 215, + 146, + 784, + 829 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting", + "bbox": [ + 254, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_model.json b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_model.json new file mode 100644 index 0000000000000000000000000000000000000000..a0aabb4b66979e451cbf4ab0ca9b3e5055e599be --- /dev/null +++ b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_model.json @@ -0,0 +1,2401 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.236, + 0.141, + 0.768, + 0.187 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "text", + "bbox": [ + 0.257, + 0.212, + 0.747, + 0.244 + ], + "angle": 0, + "content": "Yifu Chen\\(^{1,2}\\), Jingwen Chen\\(^{3}\\), Yingwei Pan\\(^{3}\\), Yehao Li\\(^{3}\\), Ting Yao\\(^{3}\\), Zhineng Chen\\(^{1,2\\dagger}\\), and Tao Mei\\(^{3}\\)" + }, + { + "type": "text", + "bbox": [ + 0.338, + 0.255, + 0.664, + 0.269 + ], + "angle": 0, + "content": "\\(^{1}\\) School of Computer Science, Fudan University" + }, + { + "type": "text", + "bbox": [ + 0.245, + 0.27, + 0.756, + 0.283 + ], + "angle": 0, + "content": "2 Shanghai Collaborative Innovation Center of Intelligent Visual Computing" + }, + { + "type": "text", + "bbox": [ + 0.44, + 0.283, + 0.562, + 0.296 + ], + "angle": 0, + "content": "3 HiDream.ai Inc." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.298, + 0.796, + 0.325 + ], + "angle": 0, + "content": "22210240129@m.fudan.edu.cn, {chenjingwen, pandy, liyehao, tiyao}@hidream.ai zhinchen@fudan.edu.cn, tmei@hidream.ai" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.353, + 0.744, + 0.699 + ], + "angle": 0, + "content": "Abstract. Recent years have witnessed the success of large text-to-image diffusion models and their remarkable potential to generate high-quality images. The further pursuit of enhancing the editability of images has sparked significant interest in the downstream task of inpainting a novel object described by a text prompt within a designated region in the image. Nevertheless, the problem is not trivial from two aspects: 1) Solely relying on one single U-Net to align text prompt and visual object across all the denoising timesteps is insufficient to generate desired objects; 2) The controllability of object generation is not guaranteed in the intricate sampling space of diffusion model. In this paper, we propose to decompose the typical single-stage object inpainting into two cascaded processes: 1) semantic pre-inpainting that infers the semantic features of desired objects in a multi-modal feature space; 2) high-fieldity object generation in diffusion latent space that pivots on such inpainted semantic features. To achieve this, we cascade a Transformer-based semantic inpainter and an object inpainting diffusion model, leading to a novel CAscaded Transformer-Diffusion (CAT-Diffusion) framework for text-guided object inpainting. Technically, the semantic inpainter is trained to predict the semantic features of the target object conditioning on unmasked context and text prompt. The outputs of the semantic inpainter then act as the informative visual prompts to guide high-fieldity object generation through a reference adapter layer, leading to controllable object inpainting. Extensive evaluations on OpenImages-V6 and MSCOCO validate the superiority of CAT-Diffusion against the state-of-the-art methods. Code is available at https://github.com/Nnn-s/CATdiffusion." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.711, + 0.682, + 0.725 + ], + "angle": 0, + "content": "Keywords: Text-guided Object Inpainting \\(\\cdot\\) Diffusion Models" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.747, + 0.377, + 0.763 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.775, + 0.788, + 0.806 + ], + "angle": 0, + "content": "Traditional image inpainting [3-5,9] focuses on restoring the corrupted area of an image without additional conditions, and is widely applied to object removal" + }, + { + "type": "page_footnote", + "bbox": [ + 0.23, + 0.812, + 0.787, + 0.841 + ], + "angle": 0, + "content": "* This work was performed when Yifu Chen was visiting HiDream.ai as a research intern. † Zhineng Chen is the corresponding author." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.127 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "image", + "bbox": [ + 0.259, + 0.143, + 0.439, + 0.356 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.455, + 0.143, + 0.741, + 0.356 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.369, + 0.788, + 0.482 + ], + "angle": 0, + "content": "Fig. 1: An illustration of conventional object inpainting framework and our proposed CAT-Diffusion. (a) Typical framework commonly feeds a masked image with the original object removed, a text prompt describing the target object (e.g., \"cat\") and a binary mask indicating the designated region to be inpainted into an individual diffusion model for object inpainting. (b) Our proposed CAT-Diffusion additionally pre-inpaint the semantic features of the target object via Transformer-based semantic inpainter, and the derived features are leveraged to steer the diffusion model through the reference adapter layer for controllable and high-fidelity object inpainting." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.529, + 0.788, + 0.637 + ], + "angle": 0, + "content": "or damaged image repairing. Later works [54, 57] have explored leveraging text prompts to complete the missing parts of an image, and shown impressive performances. Recent advances of diffusion-based text-to-image models [17,35,37] have established a steady momentum to produce high-quality images conditioning on text prompts, and derived breakthroughs for image editing task of text-guided object inpainting [1,28,45]. Such inpainting task is to specifically restore a novel object within a masked region with the condition of a given text prompt." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.789, + 0.842 + ], + "angle": 0, + "content": "One straightforward way for extending existing text-to-image diffusion models [17, 35] to text-guided object inpainting is to generate the new object from random noise and blend the object with background at every denoising step. Nevertheless, this method overlooks the inherent relations between new object and background, and might result in obvious artifacts around masked region and distorted object structure. The phenomenon motivates the subsequent efforts [28, 31] to finetune the text-to-image diffusion model via randomly erasing part of the input image and enforcing the model to recover the missing area based on the associated caption. Despite having promising results, these attempts severely suffer from misalignment between the inpainting object and the given caption, due to the fact that the caption describes the holistic image rather than the local masked region. To address this issue, SmartBrush [45] leverages the object label as prompt and the binary mask as the additional shape guidance" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.114, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "to steer the diffusion model for object inpainting. The conventional framework of this kind of object inpainting diffusion models is illustrated in Figure 1(a)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.788, + 0.525 + ], + "angle": 0, + "content": "In general, the difficulty of text-guided object inpainting in diffusion model originates from two perspectives: 1) Solely relying on a single U-Net without model ensembling [11, 46] is insufficient to generate text-aligned objects (i.e., align text prompt and image with varied noise ratios along diffusion process). 2) Precisely controlling the generation of visual objects without extra control signals remains challenging in the intricate sampling space of diffusion model. To mitigate the issues, we present a novel CAT-Diffusion to decompose the typical single-shot object inpainting into two cascaded stages: 1) first semantic pre-inpainting, i.e., inferring semantic feature of target object in a noise-free multi-modal feature space; 2) then object generation, i.e., leveraging the inferred semantic feature as visual prompt to steer diffusion model, thereby leading to high-fidelity object inpainting. Such design eases the learning of object-text alignment in diffusion model. Specifically, a Transformer-based semantic inpainter is first devised to predict the semantic features of the desired object conditioning on the unmasked image context and the text prompt. Note that an effective knowledge distillation objective in a multi-modal feature space (CLIP feature space) is leveraged to supervise the learning of semantic inpainter with ground-truth patch features. Furthermore, the outputs of the semantic inpainter, as the semantically-aligned and context-aware visual prompts, are fed into an object inpainting diffusion model through an additional reference adapter layer. This layer elegantly modulates the visual prompts to enhance the controllability of diffusion model for object inpainting. The overall framework of our proposed CAT-Diffusion is shown in Figure 1(b)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.525, + 0.788, + 0.631 + ], + "angle": 0, + "content": "In summary, we have made the following contributions: 1) The proposed CAT-Diffusion is shown capable of high-fidelity object inpainting through two decomposed stages, i.e., first semantic pre-inpainting and then object generation; 2) The designed diffusion model equipped with a reference adapter layer is shown able to nicely control object inpainting by modulating the visual prompts (i.e., the inpainted semantic features); 3) CAT-Diffusion has been properly verified through extensive experiments over OpenImages-V6 and MSCOCO." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.656, + 0.388, + 0.672 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Traditional Image Inpainting. Conventional image inpainting task aims to synthesize visually coherent and plausible content within the corrupted region of an image. Traditional methods [3-5,9] exploits the spatial redundancy of images to patch holes with image fragments sourced from elsewhere in the image, where the high-level semantics of the image are overlooked. To tackle this problem, recent inpainting techniques [25, 33, 51-53] leverage the semantic prior learned from large-scale image data and dynamically model the global-local interactions in the image with deep models (e.g., Generative Adversarial Networks [12, 29], Transformer-based architectures [23, 42, 48, 49]). However, the learning process will become increasingly challenging with higher image resolution. Thus, some" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.127 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.222 + ], + "angle": 0, + "content": "works [22, 40, 47, 50] are proposed to resolve high-resolution image inpainting and promising results are achieved. Variational Auto-Encoder (VAE) [20] based methods [26, 30, 58, 60] further improve the diversity of outputs by sampling diverse and high-quality structural information from a latent space, and incorporate the derived structure encoding into the image generator for hole filling." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.232, + 0.785, + 0.459 + ], + "angle": 0, + "content": "Text-Guided Image Inpainting. Despite their impressive performances, the aforementioned methods rely on the assumption that sufficient contextual information will be available within the source image. However, this assumption may not always hold. To minimize the loss of semantic information and facilitate greater control over the inpainting process, text prompts are employed as extra conditions in [54, 57], thereby introducing a new task of text-guided object inpainting. This newly introduced task differs fundamentally from conventional image inpainting in requiring visual and semantic consistency with the source image and the text prompt, respectively. The emergence of diffusion models [17, 35, 61] has propelled advancements in text-driven content creation with their powerful capability of high-fidelity image synthesis. Building upon this technology, recent studies [1, 2, 28, 45] showcase the ability to generate a novel object described by a text prompt within a region indicated by a binary mask. Furthermore, SmartBrush [45] uses the object mask as additional guidance during the inpainting process to boost the performances." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.468, + 0.785, + 0.62 + ], + "angle": 0, + "content": "Diffusion Models. Diffusion denoising probabilistic models (DDPM) [17] have reshaped the landscape of image synthesis. However, notable challenges such as high computational demands and low inference efficiency arise, and hinder the deployment of DDPMs in practices. Significant efforts [10, 18, 39] have been dedicated to improve DDPMs and further tap their potentials. Particularly, Latent Diffusion Models (LDMs) [35] train the DDPM in a low-dimensional latent space learned by Variational Auto-Encoder, resulting in faster training and inference while producing high-fidelity images. With these noteworthy improvements, LDMs have solidified the position in the realms of text-to-image synthesis [6, 7, 13, 37, 55], video generation [16, 44, 56], 3D generation [8, 32, 41]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Summary. In this paper, we investigate the problem of text-guided object inpainting and propose a novel Cascaded Transformer-Diffusion (CAT-Diffusion) framework. In contrast to conventional methods that leaning on an individual diffusion model, our CAT-Diffusion decomposes the single-shot pipeline into two cascaded stages: first semantic pre-inpainting and then object generation. Technically, the semantic features of the target object are pre-inpainted in a noise-free multi-modal feature space (CLIP space). Different from existing methods [2,28] that optimizes the latent code to achieve higher CLIP score between regional/global image and object prompt during inference, our CAT-Diffusion predicts the semantic features of the desired object that naturally align with the prompt by exploiting the mask-unmask visual context and pre-trained multimodal priors in CLIP. Then, such inpainted semantic features are utilized to steer the diffusion model for controllable object generation, which eases the learning of object-text alignment in diffusion model across varied noise ratios." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.145, + 0.348, + 0.163 + ], + "angle": 0, + "content": "3 Approach" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.177, + 0.788, + 0.283 + ], + "angle": 0, + "content": "To begin with, it is worth recalling that, in text-guided object inpainting, a novel object described by a text prompt (usually the object label) needs to be generated within a designated region indicated by a binary mask of an input image. Both visual coherence and semantic relevance with the image and the text prompt, respectively, are required in this task. In this section, we will delve into the specifics of our proposed Cascaded Transformer-Diffusion (CAT-Diffusion) after a brief review of diffusion models, followed by the training details." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.305, + 0.362, + 0.318 + ], + "angle": 0, + "content": "3.1 Prelimiaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.329, + 0.789, + 0.481 + ], + "angle": 0, + "content": "Denoising Diffusion Probabilistic Model (DDPM) [17], a new type of generative model, can be regarded as a parameterized Markov chain able to produce images that closely match a desired data distribution within finite timesteps \\( T \\). Generally, a forward diffusion process and a reverse denoising process are involved in DDPM. Specifically, in the forward diffusion process, DDPM gradually applies noise to the image according to a pre-defined variance schedule \\( \\{\\beta_t\\}_1^T \\) until the image is fully destroyed. Conversely, during the reverse denoising process, DDPM is trained to estimate the added noise to the noisy image and progressively remove it over a sequence of \\( T \\) timesteps. The training objective of DDPM (usually implemented as a U-Net [36]) parameterized by \\( \\theta \\) can be simply formulated as" + }, + { + "type": "equation", + "bbox": [ + 0.323, + 0.493, + 0.785, + 0.511 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {d d p m} (\\theta , x) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} (x _ {t}, t, c) - \\epsilon \\| _ {2} ^ {2} ], \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.521, + 0.788, + 0.564 + ], + "angle": 0, + "content": "where \\(\\epsilon\\) is a random noise sampled from the normal distribution \\(\\mathcal{N}(0, I)\\), \\(c\\) is some kind of condition (e.g., text prompt), and \\(x_{t}\\) is the noisy image at timestep \\(t\\) derived as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.417, + 0.566, + 0.785, + 0.582 + ], + "angle": 0, + "content": "\\[\nx _ {t} = \\sqrt {\\bar {\\alpha} _ {t}} x _ {0} + \\sqrt {1 - \\bar {\\alpha} _ {t}} \\epsilon , \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.588, + 0.788, + 0.663 + ], + "angle": 0, + "content": "where \\(\\alpha_{t} = 1 - \\beta_{t}\\), \\(\\bar{\\alpha}_{t} = \\prod_{s=1}^{t} \\alpha_{s}\\). To address the challenge of training DDPM at higher resolutions with limited GPU resources, Latent Diffusion Model (LDM) [35] instead trains DDPM in latent space of lower dimensions than pixel space. In this paper, we follow the similar recipe, and the training objective Eq. 1 can be rewritten as:" + }, + { + "type": "equation", + "bbox": [ + 0.328, + 0.675, + 0.785, + 0.693 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {l d m} (\\theta , z) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} (z _ {t}, t, c) - \\epsilon \\| _ {2} ^ {2} ], \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.703, + 0.787, + 0.734 + ], + "angle": 0, + "content": "where \\( z \\) is the latent representation of \\( x \\) and usually obtained from a pre-trained Variational Auto-Encoder (VAE)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.755, + 0.586, + 0.769 + ], + "angle": 0, + "content": "3.2 Cascaded Transformer-Diffusion Model" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Let \\( x \\), \\( c \\) and \\( m \\) be an input image, a text prompt that describes the novel object, and a binary mask that indicates the region to be inpainted, respectively. Most of the existing text-guided object inpainting diffusion models [1, 28] are merely optimized to align the text prompt \\( c \\) and the desired object \\( x \\odot m \\) in" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.127 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "image", + "bbox": [ + 0.233, + 0.145, + 0.773, + 0.367 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.369, + 0.25, + 0.383 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.251, + 0.371, + 0.333, + 0.38 + ], + "angle": 0, + "content": "Frozen Parameters" + }, + { + "type": "image", + "bbox": [ + 0.338, + 0.369, + 0.355, + 0.382 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.357, + 0.371, + 0.449, + 0.38 + ], + "angle": 0, + "content": "Trainable Parameters" + }, + { + "type": "image", + "bbox": [ + 0.455, + 0.37, + 0.472, + 0.382 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.475, + 0.371, + 0.53, + 0.38 + ], + "angle": 0, + "content": "Text Feature" + }, + { + "type": "image", + "bbox": [ + 0.538, + 0.37, + 0.555, + 0.382 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.557, + 0.371, + 0.643, + 0.38 + ], + "angle": 0, + "content": "Position Embedding" + }, + { + "type": "image", + "bbox": [ + 0.651, + 0.37, + 0.679, + 0.382 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.682, + 0.371, + 0.76, + 0.381 + ], + "angle": 0, + "content": "Mask Embedding" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.395, + 0.788, + 0.52 + ], + "angle": 0, + "content": "Fig. 2: The framework of our CAT-Diffusion. Specifically, a pre-trained image encoder is first employed to extract the visual features of the masked image. Then, a novel semantic inpainter takes these visual features and a text prompt as inputs, and preinpaints the semantic features of the desired object in a multi-modal feature space, thereby aligning the prompt and the visual object in addition to the U-Net regardless of denoising timesteps. To achieve this goal, knowledge distillation is adopted to transfer the multi-modal knowledge from a teacher model to the semantic inpainter. Finally, an object inpainting diffusion model equipped with a reference adapter layer is steered by the aligned semantic features for controllable object inpainting in visual space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.562, + 0.788, + 0.653 + ], + "angle": 0, + "content": "the latent space, which leads to suboptimal results. As discussed previously in Section. 1, two primary issues need to be addressed for further improvements: 1) Relying on a standalone U-Net to achieve visual-semantic alignment across all denoising timesteps is insufficient [11,46] for text-guided object inpainting; 2) It is challenging to stably generate high-fidelity objects in the intricate sampling space without extra semantic information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "To overcome these challenges, we propose to decompose the conventional single-stage pipeline into two cascaded stages: first semantic pre-inpainting and then object generation, leading to our CAT-Diffusion. Technically, our CAT-Diffusion pre-inpaints the object in an auxiliary multi-modal feature space (e.g., CLIP [34]) via a novel semantic inpainter. The semantic inpainter is trained through knowledge distillation [27] to predict the semantic features of the target object conditioning on the unmasked visual context and text prompt. This way, the derived outputs naturally align the text prompt and the visual object in addition to the U-Net regardless of the denoising timesteps. The outputs from the semantic inpainter is further integrated into an object inpainting diffusion model through a reference adapter layer for controllable object inpainting. The overall framework of CAT-Diffusion is shown in Figure 2." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.297 + ], + "angle": 0, + "content": "Semantic Inpainter. To alleviate the deficiency in aligning text prompt and visual object solely depending on a standalone U-Net across the entire denoising process, we propose to enhance the visual-semantic correspondence in a well pre-trained auxiliary multi-modal feature space in addition to the U-Net by inpainting the semantic features of the desired object. The rationale behind is that the pre-trained multi-modal feature space is learned on large-scale cross-modal data for visual-semantic alignment regardless of the denoising timesteps. In this work, an effective knowledge distillation objective is devised to transfer this kind of multi-modal knowledge from a teacher model (CLIP) to the semantic inpainter in our CAT-Diffusion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.785, + 0.449 + ], + "angle": 0, + "content": "Specifically, a Transformer-based semantic inpainter (SemInpainter) parameterized by \\(\\eta\\) is cascaded with a object inpainting diffusion model in our CAT-Diffusion, as shown in the upper part of Figure 2. First, the visual features \\(\\{\\hat{\\mathbf{v}}_i\\}_{1}^{N}\\) of the masked image \\(x\\odot (1 - m)\\) are extracted by the image encoder of CLIP (ImageEnc), where \\(\\hat{\\mathbf{v}}_i\\in \\mathbb{R}^d\\) is a feature vector of a local image patch. Given the corrupted features \\(\\{\\hat{\\mathbf{v}}_i\\}_{1}^{N}\\) of the masked image and the textual feature \\(\\mathbf{c}\\in \\mathbb{R}^{d}\\) of the text prompt \\(c\\), SemInpainter aims to predict semantic features \\(\\{\\bar{\\mathbf{v}}_i\\}_{1}^{N}\\) that faithfully reconstruct the target object in CLIP space. This way, the visual-semantic alignment is naturally attained along the entire denoising process of diffusion model. This whole process can be expressed as" + }, + { + "type": "equation", + "bbox": [ + 0.328, + 0.462, + 0.679, + 0.48 + ], + "angle": 0, + "content": "\\[\n\\{\\bar {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} = S e m I n p a i n t e r ([ \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} + \\mathbf {P E} + \\mathbf {M E}, \\mathbf {c} ]),\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.328, + 0.474, + 0.785, + 0.5 + ], + "angle": 0, + "content": "\\[\n\\left. \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} = \\operatorname {I m a g e E n c} (x \\odot (1 - m)), \\right. \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.513, + 0.784, + 0.62 + ], + "angle": 0, + "content": "where \\([\\cdot ]\\) denotes the concatenation operation, \\(\\mathbf{PE}\\in \\mathbb{R}^{N\\times d}\\) is a learnable position embedding, and \\(\\mathbf{ME}\\in \\mathbb{R}^{N\\times d}\\) is a learnable mask embedding that indicates whether the visual feature \\(\\hat{\\mathbf{v}}_i\\) is masked in the image \\(x\\odot (1 - m)\\) or not. Our SemInpainter is implemented as 24-layer Transformer structure (similar to the CLIP [34] image encoder). Finally, we derive the inpainted features \\(\\{\\tilde{\\mathbf{v}}_i\\}_{1}^N\\), which will be later incorporated into the object inpainting diffusion model, by blending \\(\\{\\hat{\\mathbf{v}}_i\\}_{1}^N\\) and \\(\\{\\overline{\\mathbf{v}}_i\\}_{1}^N\\) with the binary mask \\(m\\):" + }, + { + "type": "equation", + "bbox": [ + 0.299, + 0.633, + 0.785, + 0.653 + ], + "angle": 0, + "content": "\\[\n\\{\\tilde {\\mathbf {v}} _ {i} \\} _ {1} ^ {N / 4} = D o w n S a m p l e (\\{\\bar {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} \\odot m + \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} \\odot (1 - m)), \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.664, + 0.783, + 0.693 + ], + "angle": 0, + "content": "where \\(DownSample(\\cdot)\\) is a parameter-free downsample layer to reduce the feature resolution for computation efficiency." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.695, + 0.784, + 0.785 + ], + "angle": 0, + "content": "To enforce the predicted object features aligning with the text prompt \\( c \\), we propose to transfer the multi-modal knowledge from a teacher model (CLIP is adopted as the teacher model in this paper) to the SemInpainter. Technically, the SemInpainter is trained with the task of Masked Feature Prediction [27,43] to recover the ground-truth semantic features of the masked object in CLIP space conditioned on the unmasked visual context and the text prompt \\( c \\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Reference Adapter Layer. Since controlling the diffusion model for high-fidelity text-to-image generation remains challenging, inspired by [55, 59], the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.128 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.784, + 0.177 + ], + "angle": 0, + "content": "semantic features \\(\\{\\tilde{\\mathbf{v}}_i\\}_{1}^{N / 4}\\) are utilized as additional conditions, referred as visual prompts, to steer the diffusion model for controllable inpainting in latent space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.785, + 0.314 + ], + "angle": 0, + "content": "Specifically, we introduce a new reference adapter layer (RefAdapter) to the base object inpainting diffusion model, which is formulated as a multi-head cross-attention layer of Transformer style. The proposed RefAdapter is alternately plugged in between the original self-attention (SelfAttn) and cross-attention layers (CrossAttn) of the U-Net, as shown in the lower part of Figure 2. Let \\(\\mathbf{H} \\in \\mathbb{R}^{N_h \\times d_h}\\) be the intermediate hidden states of the U-Net, where \\(N_h\\) varies along with the resolution of different layers. \\(\\mathbf{C} \\in \\mathbb{R}^{N_c \\times d_c}\\) is the textual features of the prompt \\(c\\) extracted by the text encoder in the diffusion model. A shared module prototype for different types of attention layers is first defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.358, + 0.322, + 0.785, + 0.339 + ], + "angle": 0, + "content": "\\[\n\\text {O u t p u t} = \\text {M o d u l e} (\\text {Q u e r y}, \\text {K e y}, \\text {V a l u e}). \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.346, + 0.784, + 0.377 + ], + "angle": 0, + "content": "Therefore, a full block in the upgraded U-Net including SelfAttn, RefAdapter and CrossAttn operates as" + }, + { + "type": "equation", + "bbox": [ + 0.331, + 0.385, + 0.578, + 0.4 + ], + "angle": 0, + "content": "\\[\n\\mathbf {H} _ {x} = \\operatorname {C r o s s A t t n} \\left(\\mathbf {H} _ {r}, \\mathbf {C}, \\mathbf {C}\\right) + \\mathbf {H} _ {r},\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.333, + 0.404, + 0.785, + 0.423 + ], + "angle": 0, + "content": "\\[\n\\mathbf {H} _ {r} = \\operatorname {R e f A d a p t e r} \\left(\\mathbf {H} _ {s}, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}\\right) + \\mathbf {H} _ {s}, \\tag {7}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.333, + 0.426, + 0.555, + 0.442 + ], + "angle": 0, + "content": "\\[\n\\mathbf {H} _ {s} = \\operatorname {S e l f A t t n} (\\mathbf {H}, \\mathbf {H}, \\mathbf {H}) + \\mathbf {H},\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.449, + 0.547, + 0.464 + ], + "angle": 0, + "content": "where \\(\\mathbf{H}_x\\) will be the input to the next block." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.484, + 0.785, + 0.576 + ], + "angle": 0, + "content": "Object Inpainting Diffusion Model. By decomposing the object inpainting pipeline into the two cascaded processes, our CAT-Diffusion can generate high-fidelity objects that are semantically aligned with the text prompt. Moreover, the visual coherence between the filled-in object and the surrounding image context is further enhanced by steering the diffusion model with additional semantic guidance (i.e., the inpainted visual features \\(\\{\\tilde{\\mathbf{v}}_i\\}_{1}^{N/4}\\))." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.577, + 0.785, + 0.651 + ], + "angle": 0, + "content": "Generally, an inpainting diffusion model with U-Net parameterized as \\(\\epsilon_{\\theta}\\) takes the noisy latent code \\(z_{t}\\), the mask \\(m\\) indicating the region to be inpainted and the masked latent code \\(z \\odot (1 - m)\\) as inputs, and estimates the noise to be removed from \\(z_{t}\\), leading to the denoised one \\(z_{t-1}\\). Mathematically, the overall procedure can be expressed as" + }, + { + "type": "equation", + "bbox": [ + 0.24, + 0.658, + 0.785, + 0.69 + ], + "angle": 0, + "content": "\\[\nz _ {t - 1} = \\frac {1}{\\sqrt {\\alpha_ {t}}} \\left(z _ {t} - \\frac {1 - \\alpha_ {t}}{\\sqrt {1 - \\bar {\\alpha} _ {t}}} \\cdot \\epsilon_ {\\theta} \\left(\\left[ z _ {t}, z \\odot (1 - m), m \\right], t, c, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}\\right)\\right) + \\sigma_ {t} \\epsilon . \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.697, + 0.568, + 0.713 + ], + "angle": 0, + "content": "The readers can refer to [17,35] for more details." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.732, + 0.334, + 0.748 + ], + "angle": 0, + "content": "3.3 Training" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.754, + 0.796, + 0.8 + ], + "angle": 0, + "content": "Diffusion Loss. For the training of the object inpainting diffusion model equipped with the reference adapter layer, we employ the general practice in [35] following the objective function as" + }, + { + "type": "equation", + "bbox": [ + 0.225, + 0.808, + 0.785, + 0.841 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {l d m} (\\theta , z, m) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} ([ z _ {t}, z \\odot (1 - m), m ], t, c, \\{\\tilde {\\mathbf {v}} _ {i} \\} _ {1} ^ {N / 4}) - \\epsilon \\| _ {2} ^ {2} ]. \\tag {9}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.222 + ], + "angle": 0, + "content": "Knowledge Distillation Loss. Moreover, to enforce the semantic inpainter to pre-inpaint the object features that are semantically aligned with the prompt \\( c \\), we supervise the semantic inpainter with the ground-truth visual features \\( CLIP(x) \\) in the task of Masked Feature Prediction. The optimization objective can be formulated as" + }, + { + "type": "equation", + "bbox": [ + 0.233, + 0.233, + 0.786, + 0.282 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} _ {\\text {d i s t i l l}} (\\eta , x, m) = \\mathbb {E} _ {(x, c) \\sim \\{\\mathcal {X}, \\mathcal {C} \\}} [ \\| S e m I n p a i n t e r _ {\\eta} (I m a g e E n c (x \\odot (1 - m)), c) \\\\ - C L I P (x) \\| _ {2} ^ {2} ], \\tag {10} \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.283, + 0.784, + 0.314 + ], + "angle": 0, + "content": "where \\(\\{\\mathcal{X},\\mathcal{C}\\}\\) is the training dataset of paired image \\(x\\) and text prompt \\(c\\), and \\(\\eta\\) denotes the trainable parameters of the proposed SemInpainter in Section 3.2." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.338, + 0.375, + 0.354 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.371, + 0.784, + 0.432 + ], + "angle": 0, + "content": "We verify the merit of the proposed Cascaded Transformer-Diffusion approach (CAT-Diffusion) for the task of text-guided object inpainting and compare with state-of-the-art diffusion-based methods [1, 2, 28, 35, 45]. Extensive experiments validate the effectiveness of CAT-Diffusion in inpainting high-fidelity objects." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.454, + 0.457, + 0.469 + ], + "angle": 0, + "content": "4.1 Implementation Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.48, + 0.784, + 0.555 + ], + "angle": 0, + "content": "Following [45], we train CAT-Diffusion on the pairs of local mask and the corresponding object label from the training set of OpenImages-V6 [21]. CAT-Diffusion is optimized by Adam [19] with learning rate 0.00001 for about 40K iterations on 8 A100 GPUs. Batch size is set to 128 and the input image resolution is set as \\(512 \\times 512\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.58, + 0.625, + 0.595 + ], + "angle": 0, + "content": "4.2 Compared Methods and Evaluation Metrics" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.605, + 0.785, + 0.772 + ], + "angle": 0, + "content": "Compared Methods. We compare CAT-Diffusion with several state-of-the-art diffusion-based approaches including Blended Diffusion [2], Blended Latent Diffusion [1], GLIDE [28], SmartBrush [45], Stable Diffusion [35] and Stable Diffusion Inpainting. Specifically, Blended Diffusion, Blended Latent Diffusion and Stable Diffusion simply leverage a pre-trained base text-to-image model for text-guided object inpainting by blending the generated object and the background at each denoising step. The other methods train an inpainting diffusion model with the text prompt, binary mask and masked image as the inputs. Due to the same evaluation setup, the results of all methods are taken from [45], except for [1]. Please note that we have replaced the text-to-image stable diffusion 2.1 with 1.5 in Blended Latent Diffusion for fair comparisons." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.784, + 0.841 + ], + "angle": 0, + "content": "Evaluation Metrics. All the aforementioned methods are evaluated on the test sets of both OpenImages-V6 [21] and MSCOCO [24], leading to 13,400 and 9,311 test images, respectively. We adopt three widely-used metrics: Frechet" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.128 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.269 + ], + "angle": 0, + "content": "Inception Distance (FID) [15, 38], Local FID and CLIP score [14]. It is worth mentioning that FID and Local FID measure the realism and visual coherence of the inpainted object in global image and local patch respectively, while CLIP score estimates the semantic relevance between the inpainted object and the text prompt. User study is additionally involved to evaluate both the visual coherence and text-object alignment. Since GLIDE only supports images of resolution 256 \\(\\times\\) 256, we resize all the results to the similar size for fair comparisons. Moreover, both segmentation mask and bounding box mask are considered in evaluation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.29, + 0.48, + 0.305 + ], + "angle": 0, + "content": "4.3 Performance Comparisons" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.314, + 0.789, + 0.556 + ], + "angle": 0, + "content": "Quantitative Results on OpenImages-V6. Table 1 summarizes the results of all the methods on test set of OpenImages-V6. Overall, results across all the metrics consistently demonstrate the effectiveness of our proposed CAT-Diffusion with segmentation mask or bounding box mask. Specifically, blending-based approaches (i.e., Blended Latent Diffusion and Stable Diffusion) achieve comparable CLIP scores but much inferior FID and Local FID scores to our CAT-Diffusion. We speculate that this is because these methods merely focus on the visual-semantic alignment between the inpainted image and the object label, and simply blend the generated object and background in the latent space. As such, the semantic context of the surrounding unmasked regions is overlooked, resulting in poor visual coherence. SmartBrush, by incorporating the masked image into U-Net for context learning and further guiding the diffusion model with shape mask, exhibits better performances. However, the FID and Local FID scores of SmartBrush are still below those of our CAT-Diffusion. The results verify the impact of steering the diffusion model with the pre-inpainted object features from the semantic inpainter through the reference adapter layer." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.577, + 0.79, + 0.728 + ], + "angle": 0, + "content": "Quantitative Results on MSCOCO. Table 2 lists the results of all the approaches on the test set of MSCOCO. It is noteworthy that neither SmartBrush nor our CAT-Diffusion are trained on MSCOCO. Similar to the trends on OpenImages-V6, CAT-Diffusion outperforms the other methods across most of the metrics. Specifically, CAT-Diffusion leads to the relative improvements over the strong baselines Stable Diffusion Inpainting and SmartBrush by \\(42.1\\%\\) and \\(20.7\\%\\) on Local FID (with bounding box mask), respectively. The results again validate the merit of decomposing the single-shot inpainting pipeline into two cascaded processes (first semantic pre-inpainting and then object generation) in our CAT-Diffusion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.807, + 0.841 + ], + "angle": 0, + "content": "Qualitative Comparisons. Then, we qualitatively test different methods through case study. Figure 3 showcases several examples. As depicted by the top four results, the generated images by our CAT-Diffusion show better semantic alignment with the input text prompt than the other approaches. Moreover, better visual coherence of the objects with the surrounding context in the images and more accurate object shapes are also observed in the inpainted results of our" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.114, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.223, + 0.145, + 0.779, + 0.159 + ], + "angle": 0, + "content": "Table 1: Quantitative performance comparisons on the test set of OpenImages-V6." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.172, + 0.787, + 0.32 + ], + "angle": 0, + "content": "
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]9.7221.930.26111.0529.160.265
GLIDE [28]9.0321.090.2509.7022.450.252
Blended Latent Diffusion† [1]8.3015.280.26214.8625.460.262
Stable Diffusion [35]6.9012.270.2639.1015.280.265
Stable Inpainting [35]5.8410.980.2617.0712.570.264
SmartBrush [45]4.707.820.2636.009.710.266
CAT-Diffusion (ours)3.996.320.2635.027.760.265
" + }, + { + "type": "table_caption", + "bbox": [ + 0.241, + 0.332, + 0.761, + 0.346 + ], + "angle": 0, + "content": "Table 2: Quantitative performance comparisons on the test set of MSCOCO." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.359, + 0.787, + 0.506 + ], + "angle": 0, + "content": "
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]8.1626.250.24412.6841.430.251
Blended Latent Diffusion† [1]7.8819.840.24612.4029.530.248
Stable Diffusion [35]7.7817.160.24612.2925.610.250
GLIDE [28]6.9824.250.2359.3230.720.241
Stable Inpainting [35]6.5415.160.2438.5018.130.246
SmartBrush [45]5.769.800.2498.0513.220.252
CAT-Diffusion (ours)5.358.530.2496.8410.490.251
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.533, + 0.788, + 0.701 + ], + "angle": 0, + "content": "CAT-Diffusion. The results prove the superiority of pre-inpainting the semantic features of the objects through the proposed semantic inpainter. For instance, compared to the images produced by other methods, the man generated by CAT-Diffusion at the first row is more structurally complete. This benefits from steering the diffusion model with the pre-inpainted semantic features of the target object through the reference adapter layer in our CAT-Diffusion. Though there is no shape mask provided, our CAT-Diffusion is able to generate high-fidelity objects given the text prompts and the bounding box masks (the middle two rows). Additionally, we evaluate object inpainting with more descriptive text prompts and the generated results of different methods are shown in the bottom two rows. Similarly, our CAT-Diffusion produces more visually pleasing images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.841 + ], + "angle": 0, + "content": "User Study. Next, we carry out a user study to examine whether the inpainting images conform to human preferences. In the experiments, we randomly sample 1K images from the test set of OpenImages-V6 for evaluation. Note that SmartBrush [45] is not released and excluded here. We invite 10 evaluators (5 males and 5 females) with diverse education backgrounds: art design (4), psychology (2), computer science (2), and business (2). We show all the evaluators the inpainted images and the associated prompts, and ask them to assign scores \\((0\\sim\\) 5) from two aspects: 1) Visual coherence with the surrounding context; 2) Align-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.127 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "image", + "bbox": [ + 0.232, + 0.148, + 0.773, + 0.536 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.55, + 0.788, + 0.594 + ], + "angle": 0, + "content": "Fig.3: Examples generated by Stable Diffusion, Stable Diffusion Inpainting, GLIDE, Blended Diffusion, Blended Latent Diffusion and our proposed CAT-Diffusion with segmentation mask or bounding box mask." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.623, + 0.788, + 0.685 + ], + "angle": 0, + "content": "ment with the text prompt and the accurate object shape. Table 3 summarizes the averaged results of different approaches. As indicated by the results, CAT-Diffusion leads the competition by a large margin against the other baselines in terms of both text-object alignment and visual coherence." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.708, + 0.469, + 0.723 + ], + "angle": 0, + "content": "4.4 Analysis and Discussions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Ablation Study on CAT-Diffusion. Here, we study how each component in CAT-Diffusion influences the overall performance. We consider one or more component at each stage and Table 4 summarizes the results on the test set of OpenImages-V6 with segmentation mask. Note that the baseline at Row #1 is a Stable Inpainting model finetuned with object-text pairs from [21]. By incorporating the reference adapter layer that is trained with CLIP features of masked images \\( x \\odot (1 - m) \\) only, the variant at Row #2 makes the absolute improvement" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.114, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.788, + 0.189 + ], + "angle": 0, + "content": "Table 3: User study on 1K images randomly sampled from the test set of OpenImages-V6. BLD, SD and SD-Inapint are short for Blended Latent Diffusion, Stable Diffusion and Stable Diffusion Inpainting, respectively." + }, + { + "type": "table", + "bbox": [ + 0.24, + 0.199, + 0.766, + 0.259 + ], + "angle": 0, + "content": "
GLIDEBLDSDSD-InpaintCAT-Diffusion
Text-Object Alignment1.11.11.02.23.5
Visual Coherence1.21.21.12.63.6
" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.271, + 0.784, + 0.299 + ], + "angle": 0, + "content": "Table 4: Ablation study of the proposed CAT-Diffusion on the test set of OpenImages-V6 with segmentation mask." + }, + { + "type": "table", + "bbox": [ + 0.312, + 0.312, + 0.694, + 0.389 + ], + "angle": 0, + "content": "
#RefAdSemInptFID ↓Local FID ↓CLIP ↑
15.158.800.262
2✓4.247.330.262
3✓✓3.996.320.263
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.416, + 0.788, + 0.507 + ], + "angle": 0, + "content": "over the base model at Row #1 by 0.91 and 1.47 on FID and Local FID scores, respectively. This is not surprising as the CLIP features of the unmasked region endow the base diffusion model with richer contextual semantics through the reference adapter layer, improving visual coherence and preserving the background. The outputs of semantic inpainter further boost the model with the semantics of the desired object, obtaining the best results at Row #3 across all the metrics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.53, + 0.788, + 0.727 + ], + "angle": 0, + "content": "Predicted Features by Semantic Inpainter. We then analyze the extent to which the proposed semantic inpainter improves the semantic features of the desired objects. It is worth noting that the CLIP features of the masked region inherently encode the contextual semantics from the unmasked area due to self-attention mechanism in CLIP, resulting in non-trivial similarity with the ground-truth ones before passing through semantic inpainter. In particular, we compute the cosine similarity between the inputs/outputs of the semantic inpainter within the masked region and the corresponding ground-truth ones on 10K images. Figure 4(a) depicts the two distributions. The averaged cosine similarity is boosted from 0.47 to 0.65, demonstrating the effectiveness of the proposed semantic inpainter. Though the outputs from semantic inpainter are not \\(100\\%\\) accurate, richer context is contributed by these semantic features to generate high-fidelity objects in CAT-Diffusion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Diversity of Inpainted Results. In order to test the diversity of the inpainted results by our CAT-Diffusion with the same semantic features derived from the semantic inpainter, we conduct a study on the results with different random seeds. Figure 4(b) shows two examples. It can be observed that our CAT-Diffusion is able to inpaint diverse objects with accurate shapes controlled by the reference adapter layer." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.127 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.145, + 0.499, + 0.251 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.328, + 0.256, + 0.416, + 0.266 + ], + "angle": 0, + "content": "(a) Feature Similarity" + }, + { + "type": "image", + "bbox": [ + 0.506, + 0.147, + 0.758, + 0.25 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.565, + 0.256, + 0.702, + 0.266 + ], + "angle": 0, + "content": "(b) Diversity of Inpainted Results" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.281, + 0.788, + 0.337 + ], + "angle": 0, + "content": "Fig. 4: (a) The distributions of cosine similarity between the semantic features before/after the semantic inpinter within the masked region and the corresponding ground-truth ones. (b) Diverse inpainted images generated by our proposed CAT-Diffusion using different random seeds." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.366, + 0.789, + 0.429 + ], + "angle": 0, + "content": "Inference Complexity. During inference, we only require one-pass forward of the proposed semantic inpainter and the inpainted features can be reused in each denoising step, leading to minor computation overhead. The average time of our CAT-Diffusion (1.84 secs) for each image compared with SD-Inpaint (1.60 secs)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.449, + 0.36, + 0.465 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.48, + 0.789, + 0.693 + ], + "angle": 0, + "content": "In this paper, a novel Cascaded Transformer-Diffusion (CAT-Diffusion) model is proposed to enhance the visual-semantic alignment and controllability of diffusion model for text-guided object inpainting. Specifically, our CAT-Diffusion decomposes the conventional single-stage pipeline into two cascaded processes: first semantic pre-inpainting and then object generation. By pre-inpainting the semantic features of the desired objects in a multi-modal feature space and then guiding the diffusion model with these features for object generation, our CAT-Diffusion is able to generate high-fidelity objects semantically aligned with the prompt and visually coherent with the background. Technically, a Transformer-based semantic inpainter predicts the semantic features of the desired object given the unmasked context and the prompt. Then, the inpainted features from the semantic inpainter are further fed into the object inpainting diffusion model via a reference adapter layer for controlled generation. Extensive experiments on OpenImages-V6 and MSCOCO validate the effectiveness of our CAT-Diffusion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.713, + 0.789, + 0.789 + ], + "angle": 0, + "content": "Broader Impact. Recent advancements in generative models (e.g., diffusion models) have unlocked new realms of creative media generation. However, these innovations also bear the potential to be misused for the generation of deceive content. Our approach may be exploited to inpaint harmful content into images for misinformation spread, and we strongly disapprove of such actions." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Acknowledgement. This work was supported by National Natural Science Foundation of China (No. 62172103, 32341012)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.177, + 0.784, + 0.204 + ], + "angle": 0, + "content": "1. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Trans. Graph. 42(4), 1-11 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.205, + 0.785, + 0.232 + ], + "angle": 0, + "content": "2. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.233, + 0.785, + 0.273 + ], + "angle": 0, + "content": "3. Ballester, C., Bertalmio, M., Caselles, V., Sapiro, G., Verdera, J.: Filling-in by joint interpolation of vector fields and gray levels. IEEE transactions on image processing 10(8), 1200-1211 (2001)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.785, + 0.314 + ], + "angle": 0, + "content": "4. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.315, + 0.785, + 0.342 + ], + "angle": 0, + "content": "5. Bertalmio, M., Sapiro, G., Caselles, V., Ballester, C.: Image inpainting. In: SIGGRAPH (2000)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.343, + 0.785, + 0.37 + ], + "angle": 0, + "content": "6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.371, + 0.785, + 0.398 + ], + "angle": 0, + "content": "7. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.399, + 0.785, + 0.425 + ], + "angle": 0, + "content": "8. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.785, + 0.467 + ], + "angle": 0, + "content": "9. Criminisi, A., Pérez, P., Toyama, K.: Region filling and object removal by exemplar-based image inpainting. IEEE Transactions on image processing 13(9), 1200-1212 (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.785, + 0.494 + ], + "angle": 0, + "content": "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.495, + 0.785, + 0.536 + ], + "angle": 0, + "content": "1. Feng, Z., Zhang, Z., Yu, X., Fang, Y., Li, L., Chen, X., Lu, Y., Liu, J., Yin, W., Feng, S., et al.: Ernie-vilg 2.0: Improving text-to-image diffusion model with knowledge-enhanced mixture-of-denoising-experts. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.537, + 0.785, + 0.577 + ], + "angle": 0, + "content": "2. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.578, + 0.785, + 0.618 + ], + "angle": 0, + "content": "3. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.62, + 0.785, + 0.646 + ], + "angle": 0, + "content": "4. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.647, + 0.785, + 0.687 + ], + "angle": 0, + "content": "5. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.688, + 0.785, + 0.729 + ], + "angle": 0, + "content": "6. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., et al.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.73, + 0.785, + 0.756 + ], + "angle": 0, + "content": "7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.784 + ], + "angle": 0, + "content": "8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.785, + 0.812 + ], + "angle": 0, + "content": "9. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. arXiv preprint: arXiv:1312.6114 (2013)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.381, + 0.127 + ], + "angle": 0, + "content": "Yifu Chen et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.204 + ], + "angle": 0, + "content": "21. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision 128(7), 1956-1981 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.205, + 0.786, + 0.232 + ], + "angle": 0, + "content": "22. Li, W., Lin, Z., Zhou, K., Qi, L., Wang, Y., Jia, J.: MAT: mask-aware transformer for large hole image inpainting. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.233, + 0.786, + 0.273 + ], + "angle": 0, + "content": "23. Li, Y., Yao, T., Pan, Y., Mei, T.: Contextual transformer networks for visual recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(2), 1489-1500 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.274, + 0.786, + 0.302 + ], + "angle": 0, + "content": "24. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.303, + 0.786, + 0.33 + ], + "angle": 0, + "content": "25. Liu, G., Reda, F.A., Shih, K.J., Wang, T., Tao, A., Catanzaro, B.: Image inpainting for irregular holes using partial convolutions. In: ECCV (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.331, + 0.786, + 0.36 + ], + "angle": 0, + "content": "26. Liu, H., Wan, Z., Huang, W., Song, Y., Han, X., Liao, J.: PD-GAN: probabilistic diverse GAN for image inpainting. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.361, + 0.786, + 0.401 + ], + "angle": 0, + "content": "27. Navaneet, K., Koohpayegani, S.A., Tejankar, A., Pirsiavash, H.: Simreg: Regression as a simple yet effective tool for self-supervised knowledge distillation. arXiv preprint arXiv:2201.05131 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.402, + 0.786, + 0.444 + ], + "angle": 0, + "content": "28. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.445, + 0.786, + 0.472 + ], + "angle": 0, + "content": "29. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: ACM MM (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.473, + 0.786, + 0.501 + ], + "angle": 0, + "content": "30. Peng, J., Liu, D., Xu, S., Li, H.: Generating diverse structure for image inpainting with hierarchical VQ-VAE. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.786, + 0.543 + ], + "angle": 0, + "content": "31. von Platen, P., Patil, S., Lozhkov, A., Cuenca, P., Lambert, N., Rasul, K., Davaadorj, M., Wolf, T.: Diffusers: State-of-the-art diffusion models. https://github.com/huggingface/diffusers (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.544, + 0.786, + 0.571 + ], + "angle": 0, + "content": "32. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.572, + 0.786, + 0.6 + ], + "angle": 0, + "content": "33. Quan, W., Zhang, R., Zhang, Y., Li, Z., Wang, J., Yan, D.: Image inpainting with local and global refinement. IEEE Trans. Image Process. 31, 2405-2420 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.601, + 0.786, + 0.642 + ], + "angle": 0, + "content": "34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.643, + 0.786, + 0.671 + ], + "angle": 0, + "content": "35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.671, + 0.786, + 0.699 + ], + "angle": 0, + "content": "36. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.7, + 0.786, + 0.755 + ], + "angle": 0, + "content": "37. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. NeurIPS 35, 36479-36494 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.756, + 0.786, + 0.783 + ], + "angle": 0, + "content": "38. Seitzer, M.: pytorch-fid: FID Score for PyTorch. https://github.com/mseitzer/pytorch-fid (August 2020), version 0.3.0" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.784, + 0.786, + 0.811 + ], + "angle": 0, + "content": "39. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.812, + 0.786, + 0.84 + ], + "angle": 0, + "content": "40. Song, Y., Yang, C., Lin, Z.L., Liu, X., Huang, Q., Li, H., Kuo, C.J.: Contextual-based image inpainting: Infer, match, and translate. In: ECCV (2018)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.255, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.188 + ], + "angle": 0, + "content": "41. Tang, J., Wang, T., Zhang, B., Zhang, T., Yi, R., Ma, L., Chen, D.: Make-it-3d: High-fidelity 3d creation from a single image with diffusion prior. arXiv preprint arXiv:2303.14184 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.189, + 0.785, + 0.217 + ], + "angle": 0, + "content": "42. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. NeurIPS 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.217, + 0.785, + 0.243 + ], + "angle": 0, + "content": "43. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.243, + 0.785, + 0.284 + ], + "angle": 0, + "content": "44. Wu, J.Z., Ge, Y., Wang, X., Lei, S.W., Gu, Y., Shi, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.284, + 0.785, + 0.311 + ], + "angle": 0, + "content": "45. Xie, S., Zhang, Z., Lin, Z., Hinz, T., Zhang, K.: Smartbrush: Text and shape guided object inpainting with diffusion model. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.311, + 0.785, + 0.352 + ], + "angle": 0, + "content": "46. Xue, Z., Song, G., Guo, Q., Liu, B., Zong, Z., Liu, Y., Luo, P.: Raphael: Text-to-image generation via large mixture of diffusion paths. arXiv preprint arXiv:2305.18295 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.353, + 0.785, + 0.38 + ], + "angle": 0, + "content": "47. Yang, C., Lu, X., Lin, Z., Shechtman, E., Wang, O., Li, H.: High-resolution image inpainting using multi-scale neural patch synthesis. In: CVPR (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.38, + 0.785, + 0.42 + ], + "angle": 0, + "content": "48. Yao, T., Li, Y., Pan, Y., Mei, T.: Hiri-vit: Scaling vision transformer with high resolution inputs. IEEE Transactions on Pattern Analysis and Machine Intelligence (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.421, + 0.785, + 0.462 + ], + "angle": 0, + "content": "49. Yao, T., Li, Y., Pan, Y., Wang, Y., Zhang, X.P., Mei, T.: Dual vision transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(9), 10870-10882 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.462, + 0.785, + 0.49 + ], + "angle": 0, + "content": "50. Yi, Z., Tang, Q., Azizi, S., Jang, D., Xu, Z.: Contextual residual aggregation for ultra high-resolution image inpainting. In: CVPR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.49, + 0.785, + 0.516 + ], + "angle": 0, + "content": "51. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Generative image inpainting with contextual attention. In: CVPR (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.516, + 0.785, + 0.543 + ], + "angle": 0, + "content": "52. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Free-form image inpainting with gated convolution. In: ICCV (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.543, + 0.785, + 0.571 + ], + "angle": 0, + "content": "53. Zeng, Y., Fu, J., Chao, H., Guo, B.: Learning pyramid-context encoder network for high-quality image inpainting. In: CVPR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.571, + 0.785, + 0.598 + ], + "angle": 0, + "content": "54. Zhang, L., Chen, Q., Hu, B., Jiang, S.: Text-guided neural image inpainting. In: ACM MM (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.598, + 0.785, + 0.625 + ], + "angle": 0, + "content": "55. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.625, + 0.785, + 0.665 + ], + "angle": 0, + "content": "56. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.665, + 0.785, + 0.693 + ], + "angle": 0, + "content": "57. Zhang, Z., Zhao, Z., Zhang, Z., Huai, B., Yuan, J.: Text-guided image inpainting. In: ACM MM (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.693, + 0.785, + 0.734 + ], + "angle": 0, + "content": "58. Zhao, L., Mo, Q., Lin, S., Wang, Z., Zuo, Z., Chen, H., Xing, W., Lu, D.: Uctgan: Diverse image inpainting based on unsupervised cross-space translation. In: CVPR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.734, + 0.785, + 0.775 + ], + "angle": 0, + "content": "59. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unicontrolnet: All-in-one control to text-to-image diffusion models. arXiv preprint arXiv:2305.16322 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.776, + 0.785, + 0.789 + ], + "angle": 0, + "content": "60. Zheng, C., Cham, T.J., Cai, J.: Pluralistic image completion. In: CVPR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.789, + 0.785, + 0.83 + ], + "angle": 0, + "content": "61. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.83 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_origin.pdf b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..fa9a3e5a771c3869765964dd12a1b6b24c6121d0 --- /dev/null +++ b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/dd25a48b-4c85-4a80-a1ef-d0eb66c65a7d_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:856e712dc7620cabc9c61f6f5c572eef48d54ccdcce67f6ac33a8a19fb67044e +size 6248523 diff --git a/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/full.md b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/full.md new file mode 100644 index 0000000000000000000000000000000000000000..d04a6ab59ee21fff772eb2cf88afed51959809d1 --- /dev/null +++ b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/full.md @@ -0,0 +1,314 @@ +# Improving Text-guided Object Inpainting with Semantic Pre-inpainting + +Yifu Chen $^{1,2}$ , Jingwen Chen $^{3}$ , Yingwei Pan $^{3}$ , Yehao Li $^{3}$ , Ting Yao $^{3}$ , Zhineng Chen $^{1,2\dagger}$ , and Tao Mei $^{3}$ + +$^{1}$ School of Computer Science, Fudan University + +2 Shanghai Collaborative Innovation Center of Intelligent Visual Computing + +3 HiDream.ai Inc. + +22210240129@m.fudan.edu.cn, {chenjingwen, pandy, liyehao, tiyao}@hidream.ai zhinchen@fudan.edu.cn, tmei@hidream.ai + +Abstract. Recent years have witnessed the success of large text-to-image diffusion models and their remarkable potential to generate high-quality images. The further pursuit of enhancing the editability of images has sparked significant interest in the downstream task of inpainting a novel object described by a text prompt within a designated region in the image. Nevertheless, the problem is not trivial from two aspects: 1) Solely relying on one single U-Net to align text prompt and visual object across all the denoising timesteps is insufficient to generate desired objects; 2) The controllability of object generation is not guaranteed in the intricate sampling space of diffusion model. In this paper, we propose to decompose the typical single-stage object inpainting into two cascaded processes: 1) semantic pre-inpainting that infers the semantic features of desired objects in a multi-modal feature space; 2) high-fieldity object generation in diffusion latent space that pivots on such inpainted semantic features. To achieve this, we cascade a Transformer-based semantic inpainter and an object inpainting diffusion model, leading to a novel CAscaded Transformer-Diffusion (CAT-Diffusion) framework for text-guided object inpainting. Technically, the semantic inpainter is trained to predict the semantic features of the target object conditioning on unmasked context and text prompt. The outputs of the semantic inpainter then act as the informative visual prompts to guide high-fieldity object generation through a reference adapter layer, leading to controllable object inpainting. Extensive evaluations on OpenImages-V6 and MSCOCO validate the superiority of CAT-Diffusion against the state-of-the-art methods. Code is available at https://github.com/Nnn-s/CATdiffusion. + +Keywords: Text-guided Object Inpainting $\cdot$ Diffusion Models + +# 1 Introduction + +Traditional image inpainting [3-5,9] focuses on restoring the corrupted area of an image without additional conditions, and is widely applied to object removal + +![](images/b15a7edacd6593875e28bfbda6ef983829bef188542d286f74a0e7f5e7186eba.jpg) +Fig. 1: An illustration of conventional object inpainting framework and our proposed CAT-Diffusion. (a) Typical framework commonly feeds a masked image with the original object removed, a text prompt describing the target object (e.g., "cat") and a binary mask indicating the designated region to be inpainted into an individual diffusion model for object inpainting. (b) Our proposed CAT-Diffusion additionally pre-inpaint the semantic features of the target object via Transformer-based semantic inpainter, and the derived features are leveraged to steer the diffusion model through the reference adapter layer for controllable and high-fidelity object inpainting. + +![](images/78b7f49da0e367f55059c4254972a00c233bb711b4182ae94288d96759e1574b.jpg) + +or damaged image repairing. Later works [54, 57] have explored leveraging text prompts to complete the missing parts of an image, and shown impressive performances. Recent advances of diffusion-based text-to-image models [17,35,37] have established a steady momentum to produce high-quality images conditioning on text prompts, and derived breakthroughs for image editing task of text-guided object inpainting [1,28,45]. Such inpainting task is to specifically restore a novel object within a masked region with the condition of a given text prompt. + +One straightforward way for extending existing text-to-image diffusion models [17, 35] to text-guided object inpainting is to generate the new object from random noise and blend the object with background at every denoising step. Nevertheless, this method overlooks the inherent relations between new object and background, and might result in obvious artifacts around masked region and distorted object structure. The phenomenon motivates the subsequent efforts [28, 31] to finetune the text-to-image diffusion model via randomly erasing part of the input image and enforcing the model to recover the missing area based on the associated caption. Despite having promising results, these attempts severely suffer from misalignment between the inpainting object and the given caption, due to the fact that the caption describes the holistic image rather than the local masked region. To address this issue, SmartBrush [45] leverages the object label as prompt and the binary mask as the additional shape guidance + +to steer the diffusion model for object inpainting. The conventional framework of this kind of object inpainting diffusion models is illustrated in Figure 1(a). + +In general, the difficulty of text-guided object inpainting in diffusion model originates from two perspectives: 1) Solely relying on a single U-Net without model ensembling [11, 46] is insufficient to generate text-aligned objects (i.e., align text prompt and image with varied noise ratios along diffusion process). 2) Precisely controlling the generation of visual objects without extra control signals remains challenging in the intricate sampling space of diffusion model. To mitigate the issues, we present a novel CAT-Diffusion to decompose the typical single-shot object inpainting into two cascaded stages: 1) first semantic pre-inpainting, i.e., inferring semantic feature of target object in a noise-free multi-modal feature space; 2) then object generation, i.e., leveraging the inferred semantic feature as visual prompt to steer diffusion model, thereby leading to high-fidelity object inpainting. Such design eases the learning of object-text alignment in diffusion model. Specifically, a Transformer-based semantic inpainter is first devised to predict the semantic features of the desired object conditioning on the unmasked image context and the text prompt. Note that an effective knowledge distillation objective in a multi-modal feature space (CLIP feature space) is leveraged to supervise the learning of semantic inpainter with ground-truth patch features. Furthermore, the outputs of the semantic inpainter, as the semantically-aligned and context-aware visual prompts, are fed into an object inpainting diffusion model through an additional reference adapter layer. This layer elegantly modulates the visual prompts to enhance the controllability of diffusion model for object inpainting. The overall framework of our proposed CAT-Diffusion is shown in Figure 1(b). + +In summary, we have made the following contributions: 1) The proposed CAT-Diffusion is shown capable of high-fidelity object inpainting through two decomposed stages, i.e., first semantic pre-inpainting and then object generation; 2) The designed diffusion model equipped with a reference adapter layer is shown able to nicely control object inpainting by modulating the visual prompts (i.e., the inpainted semantic features); 3) CAT-Diffusion has been properly verified through extensive experiments over OpenImages-V6 and MSCOCO. + +# 2 Related Work + +Traditional Image Inpainting. Conventional image inpainting task aims to synthesize visually coherent and plausible content within the corrupted region of an image. Traditional methods [3-5,9] exploits the spatial redundancy of images to patch holes with image fragments sourced from elsewhere in the image, where the high-level semantics of the image are overlooked. To tackle this problem, recent inpainting techniques [25, 33, 51-53] leverage the semantic prior learned from large-scale image data and dynamically model the global-local interactions in the image with deep models (e.g., Generative Adversarial Networks [12, 29], Transformer-based architectures [23, 42, 48, 49]). However, the learning process will become increasingly challenging with higher image resolution. Thus, some + +works [22, 40, 47, 50] are proposed to resolve high-resolution image inpainting and promising results are achieved. Variational Auto-Encoder (VAE) [20] based methods [26, 30, 58, 60] further improve the diversity of outputs by sampling diverse and high-quality structural information from a latent space, and incorporate the derived structure encoding into the image generator for hole filling. + +Text-Guided Image Inpainting. Despite their impressive performances, the aforementioned methods rely on the assumption that sufficient contextual information will be available within the source image. However, this assumption may not always hold. To minimize the loss of semantic information and facilitate greater control over the inpainting process, text prompts are employed as extra conditions in [54, 57], thereby introducing a new task of text-guided object inpainting. This newly introduced task differs fundamentally from conventional image inpainting in requiring visual and semantic consistency with the source image and the text prompt, respectively. The emergence of diffusion models [17, 35, 61] has propelled advancements in text-driven content creation with their powerful capability of high-fidelity image synthesis. Building upon this technology, recent studies [1, 2, 28, 45] showcase the ability to generate a novel object described by a text prompt within a region indicated by a binary mask. Furthermore, SmartBrush [45] uses the object mask as additional guidance during the inpainting process to boost the performances. + +Diffusion Models. Diffusion denoising probabilistic models (DDPM) [17] have reshaped the landscape of image synthesis. However, notable challenges such as high computational demands and low inference efficiency arise, and hinder the deployment of DDPMs in practices. Significant efforts [10, 18, 39] have been dedicated to improve DDPMs and further tap their potentials. Particularly, Latent Diffusion Models (LDMs) [35] train the DDPM in a low-dimensional latent space learned by Variational Auto-Encoder, resulting in faster training and inference while producing high-fidelity images. With these noteworthy improvements, LDMs have solidified the position in the realms of text-to-image synthesis [6, 7, 13, 37, 55], video generation [16, 44, 56], 3D generation [8, 32, 41]. + +Summary. In this paper, we investigate the problem of text-guided object inpainting and propose a novel Cascaded Transformer-Diffusion (CAT-Diffusion) framework. In contrast to conventional methods that leaning on an individual diffusion model, our CAT-Diffusion decomposes the single-shot pipeline into two cascaded stages: first semantic pre-inpainting and then object generation. Technically, the semantic features of the target object are pre-inpainted in a noise-free multi-modal feature space (CLIP space). Different from existing methods [2,28] that optimizes the latent code to achieve higher CLIP score between regional/global image and object prompt during inference, our CAT-Diffusion predicts the semantic features of the desired object that naturally align with the prompt by exploiting the mask-unmask visual context and pre-trained multimodal priors in CLIP. Then, such inpainted semantic features are utilized to steer the diffusion model for controllable object generation, which eases the learning of object-text alignment in diffusion model across varied noise ratios. + +# 3 Approach + +To begin with, it is worth recalling that, in text-guided object inpainting, a novel object described by a text prompt (usually the object label) needs to be generated within a designated region indicated by a binary mask of an input image. Both visual coherence and semantic relevance with the image and the text prompt, respectively, are required in this task. In this section, we will delve into the specifics of our proposed Cascaded Transformer-Diffusion (CAT-Diffusion) after a brief review of diffusion models, followed by the training details. + +# 3.1 Prelimiaries + +Denoising Diffusion Probabilistic Model (DDPM) [17], a new type of generative model, can be regarded as a parameterized Markov chain able to produce images that closely match a desired data distribution within finite timesteps $T$ . Generally, a forward diffusion process and a reverse denoising process are involved in DDPM. Specifically, in the forward diffusion process, DDPM gradually applies noise to the image according to a pre-defined variance schedule $\{\beta_t\}_1^T$ until the image is fully destroyed. Conversely, during the reverse denoising process, DDPM is trained to estimate the added noise to the noisy image and progressively remove it over a sequence of $T$ timesteps. The training objective of DDPM (usually implemented as a U-Net [36]) parameterized by $\theta$ can be simply formulated as + +$$ +\mathcal {L} _ {d d p m} (\theta , x) = \mathbb {E} _ {t \sim \mathcal {U} (0, T), \epsilon \sim \mathcal {N} (0, I)} [ \| \epsilon_ {\theta} (x _ {t}, t, c) - \epsilon \| _ {2} ^ {2} ], \tag {1} +$$ + +where $\epsilon$ is a random noise sampled from the normal distribution $\mathcal{N}(0, I)$ , $c$ is some kind of condition (e.g., text prompt), and $x_{t}$ is the noisy image at timestep $t$ derived as follows: + +$$ +x _ {t} = \sqrt {\bar {\alpha} _ {t}} x _ {0} + \sqrt {1 - \bar {\alpha} _ {t}} \epsilon , \tag {2} +$$ + +where $\alpha_{t} = 1 - \beta_{t}$ , $\bar{\alpha}_{t} = \prod_{s=1}^{t} \alpha_{s}$ . To address the challenge of training DDPM at higher resolutions with limited GPU resources, Latent Diffusion Model (LDM) [35] instead trains DDPM in latent space of lower dimensions than pixel space. In this paper, we follow the similar recipe, and the training objective Eq. 1 can be rewritten as: + +$$ +\mathcal {L} _ {l d m} (\theta , z) = \mathbb {E} _ {t \sim \mathcal {U} (0, T), \epsilon \sim \mathcal {N} (0, I)} [ \| \epsilon_ {\theta} (z _ {t}, t, c) - \epsilon \| _ {2} ^ {2} ], \tag {3} +$$ + +where $z$ is the latent representation of $x$ and usually obtained from a pre-trained Variational Auto-Encoder (VAE). + +# 3.2 Cascaded Transformer-Diffusion Model + +Let $x$ , $c$ and $m$ be an input image, a text prompt that describes the novel object, and a binary mask that indicates the region to be inpainted, respectively. Most of the existing text-guided object inpainting diffusion models [1, 28] are merely optimized to align the text prompt $c$ and the desired object $x \odot m$ in + +![](images/410f23ddc3591b3cc113d1ead7d273c73b722b5f856bd3c3f3c87c2dcbc619c5.jpg) + +![](images/46ed5c786b1fc34cca9f9313fe325e1439b718901077d63210d0a4207de40d82.jpg) +Frozen Parameters + +![](images/fcab3b2749adac345ccd172078bb688e1f2206a97017ac9aae2597e009dad50e.jpg) +Trainable Parameters +Fig. 2: The framework of our CAT-Diffusion. Specifically, a pre-trained image encoder is first employed to extract the visual features of the masked image. Then, a novel semantic inpainter takes these visual features and a text prompt as inputs, and preinpaints the semantic features of the desired object in a multi-modal feature space, thereby aligning the prompt and the visual object in addition to the U-Net regardless of denoising timesteps. To achieve this goal, knowledge distillation is adopted to transfer the multi-modal knowledge from a teacher model to the semantic inpainter. Finally, an object inpainting diffusion model equipped with a reference adapter layer is steered by the aligned semantic features for controllable object inpainting in visual space. + +![](images/5400f34a71c1c0929096a37e326f0d169b730caec9af9e1d0c6e00261c3048c9.jpg) +Text Feature + +![](images/67e9e93fb8879361bbdd08f2ca2119a8ee482403d78e872bc7c702223d6a5ffd.jpg) +Position Embedding + +![](images/9c75cbf7767932d80d74b5d5e7ea0d15bd65a6bc08fbea259069342d62fb7dad.jpg) +Mask Embedding + +the latent space, which leads to suboptimal results. As discussed previously in Section. 1, two primary issues need to be addressed for further improvements: 1) Relying on a standalone U-Net to achieve visual-semantic alignment across all denoising timesteps is insufficient [11,46] for text-guided object inpainting; 2) It is challenging to stably generate high-fidelity objects in the intricate sampling space without extra semantic information. + +To overcome these challenges, we propose to decompose the conventional single-stage pipeline into two cascaded stages: first semantic pre-inpainting and then object generation, leading to our CAT-Diffusion. Technically, our CAT-Diffusion pre-inpaints the object in an auxiliary multi-modal feature space (e.g., CLIP [34]) via a novel semantic inpainter. The semantic inpainter is trained through knowledge distillation [27] to predict the semantic features of the target object conditioning on the unmasked visual context and text prompt. This way, the derived outputs naturally align the text prompt and the visual object in addition to the U-Net regardless of the denoising timesteps. The outputs from the semantic inpainter is further integrated into an object inpainting diffusion model through a reference adapter layer for controllable object inpainting. The overall framework of CAT-Diffusion is shown in Figure 2. + +Semantic Inpainter. To alleviate the deficiency in aligning text prompt and visual object solely depending on a standalone U-Net across the entire denoising process, we propose to enhance the visual-semantic correspondence in a well pre-trained auxiliary multi-modal feature space in addition to the U-Net by inpainting the semantic features of the desired object. The rationale behind is that the pre-trained multi-modal feature space is learned on large-scale cross-modal data for visual-semantic alignment regardless of the denoising timesteps. In this work, an effective knowledge distillation objective is devised to transfer this kind of multi-modal knowledge from a teacher model (CLIP) to the semantic inpainter in our CAT-Diffusion. + +Specifically, a Transformer-based semantic inpainter (SemInpainter) parameterized by $\eta$ is cascaded with a object inpainting diffusion model in our CAT-Diffusion, as shown in the upper part of Figure 2. First, the visual features $\{\hat{\mathbf{v}}_i\}_{1}^{N}$ of the masked image $x\odot (1 - m)$ are extracted by the image encoder of CLIP (ImageEnc), where $\hat{\mathbf{v}}_i\in \mathbb{R}^d$ is a feature vector of a local image patch. Given the corrupted features $\{\hat{\mathbf{v}}_i\}_{1}^{N}$ of the masked image and the textual feature $\mathbf{c}\in \mathbb{R}^{d}$ of the text prompt $c$ , SemInpainter aims to predict semantic features $\{\bar{\mathbf{v}}_i\}_{1}^{N}$ that faithfully reconstruct the target object in CLIP space. This way, the visual-semantic alignment is naturally attained along the entire denoising process of diffusion model. This whole process can be expressed as + +$$ +\{\bar {\mathbf {v}} _ {i} \} _ {1} ^ {N} = S e m I n p a i n t e r ([ \{\hat {\mathbf {v}} _ {i} \} _ {1} ^ {N} + \mathbf {P E} + \mathbf {M E}, \mathbf {c} ]), +$$ + +$$ +\left. \{\hat {\mathbf {v}} _ {i} \} _ {1} ^ {N} = \operatorname {I m a g e E n c} (x \odot (1 - m)), \right. \tag {4} +$$ + +where $[\cdot ]$ denotes the concatenation operation, $\mathbf{PE}\in \mathbb{R}^{N\times d}$ is a learnable position embedding, and $\mathbf{ME}\in \mathbb{R}^{N\times d}$ is a learnable mask embedding that indicates whether the visual feature $\hat{\mathbf{v}}_i$ is masked in the image $x\odot (1 - m)$ or not. Our SemInpainter is implemented as 24-layer Transformer structure (similar to the CLIP [34] image encoder). Finally, we derive the inpainted features $\{\tilde{\mathbf{v}}_i\}_{1}^N$ , which will be later incorporated into the object inpainting diffusion model, by blending $\{\hat{\mathbf{v}}_i\}_{1}^N$ and $\{\overline{\mathbf{v}}_i\}_{1}^N$ with the binary mask $m$ : + +$$ +\{\tilde {\mathbf {v}} _ {i} \} _ {1} ^ {N / 4} = D o w n S a m p l e (\{\bar {\mathbf {v}} _ {i} \} _ {1} ^ {N} \odot m + \{\hat {\mathbf {v}} _ {i} \} _ {1} ^ {N} \odot (1 - m)), \tag {5} +$$ + +where $DownSample(\cdot)$ is a parameter-free downsample layer to reduce the feature resolution for computation efficiency. + +To enforce the predicted object features aligning with the text prompt $c$ , we propose to transfer the multi-modal knowledge from a teacher model (CLIP is adopted as the teacher model in this paper) to the SemInpainter. Technically, the SemInpainter is trained with the task of Masked Feature Prediction [27,43] to recover the ground-truth semantic features of the masked object in CLIP space conditioned on the unmasked visual context and the text prompt $c$ . + +Reference Adapter Layer. Since controlling the diffusion model for high-fidelity text-to-image generation remains challenging, inspired by [55, 59], the + +semantic features $\{\tilde{\mathbf{v}}_i\}_{1}^{N / 4}$ are utilized as additional conditions, referred as visual prompts, to steer the diffusion model for controllable inpainting in latent space. + +Specifically, we introduce a new reference adapter layer (RefAdapter) to the base object inpainting diffusion model, which is formulated as a multi-head cross-attention layer of Transformer style. The proposed RefAdapter is alternately plugged in between the original self-attention (SelfAttn) and cross-attention layers (CrossAttn) of the U-Net, as shown in the lower part of Figure 2. Let $\mathbf{H} \in \mathbb{R}^{N_h \times d_h}$ be the intermediate hidden states of the U-Net, where $N_h$ varies along with the resolution of different layers. $\mathbf{C} \in \mathbb{R}^{N_c \times d_c}$ is the textual features of the prompt $c$ extracted by the text encoder in the diffusion model. A shared module prototype for different types of attention layers is first defined as: + +$$ +\text {O u t p u t} = \text {M o d u l e} (\text {Q u e r y}, \text {K e y}, \text {V a l u e}). \tag {6} +$$ + +Therefore, a full block in the upgraded U-Net including SelfAttn, RefAdapter and CrossAttn operates as + +$$ +\mathbf {H} _ {x} = \operatorname {C r o s s A t t n} \left(\mathbf {H} _ {r}, \mathbf {C}, \mathbf {C}\right) + \mathbf {H} _ {r}, +$$ + +$$ +\mathbf {H} _ {r} = \operatorname {R e f A d a p t e r} \left(\mathbf {H} _ {s}, \left\{\tilde {\mathbf {v}} _ {i} \right\} _ {1} ^ {N / 4}, \left\{\tilde {\mathbf {v}} _ {i} \right\} _ {1} ^ {N / 4}\right) + \mathbf {H} _ {s}, \tag {7} +$$ + +$$ +\mathbf {H} _ {s} = \operatorname {S e l f A t t n} (\mathbf {H}, \mathbf {H}, \mathbf {H}) + \mathbf {H}, +$$ + +where $\mathbf{H}_x$ will be the input to the next block. + +Object Inpainting Diffusion Model. By decomposing the object inpainting pipeline into the two cascaded processes, our CAT-Diffusion can generate high-fidelity objects that are semantically aligned with the text prompt. Moreover, the visual coherence between the filled-in object and the surrounding image context is further enhanced by steering the diffusion model with additional semantic guidance (i.e., the inpainted visual features $\{\tilde{\mathbf{v}}_i\}_{1}^{N/4}$ ). + +Generally, an inpainting diffusion model with U-Net parameterized as $\epsilon_{\theta}$ takes the noisy latent code $z_{t}$ , the mask $m$ indicating the region to be inpainted and the masked latent code $z \odot (1 - m)$ as inputs, and estimates the noise to be removed from $z_{t}$ , leading to the denoised one $z_{t-1}$ . Mathematically, the overall procedure can be expressed as + +$$ +z _ {t - 1} = \frac {1}{\sqrt {\alpha_ {t}}} \left(z _ {t} - \frac {1 - \alpha_ {t}}{\sqrt {1 - \bar {\alpha} _ {t}}} \cdot \epsilon_ {\theta} \left(\left[ z _ {t}, z \odot (1 - m), m \right], t, c, \left\{\tilde {\mathbf {v}} _ {i} \right\} _ {1} ^ {N / 4}\right)\right) + \sigma_ {t} \epsilon . \tag {8} +$$ + +The readers can refer to [17,35] for more details. + +# 3.3 Training + +Diffusion Loss. For the training of the object inpainting diffusion model equipped with the reference adapter layer, we employ the general practice in [35] following the objective function as + +$$ +\mathcal {L} _ {l d m} (\theta , z, m) = \mathbb {E} _ {t \sim \mathcal {U} (0, T), \epsilon \sim \mathcal {N} (0, I)} [ \| \epsilon_ {\theta} ([ z _ {t}, z \odot (1 - m), m ], t, c, \{\tilde {\mathbf {v}} _ {i} \} _ {1} ^ {N / 4}) - \epsilon \| _ {2} ^ {2} ]. \tag {9} +$$ + +Knowledge Distillation Loss. Moreover, to enforce the semantic inpainter to pre-inpaint the object features that are semantically aligned with the prompt $c$ , we supervise the semantic inpainter with the ground-truth visual features $CLIP(x)$ in the task of Masked Feature Prediction. The optimization objective can be formulated as + +$$ +\begin{array}{l} \mathcal {L} _ {\text {d i s t i l l}} (\eta , x, m) = \mathbb {E} _ {(x, c) \sim \{\mathcal {X}, \mathcal {C} \}} [ \| S e m I n p a i n t e r _ {\eta} (I m a g e E n c (x \odot (1 - m)), c) \\ - C L I P (x) \| _ {2} ^ {2} ], \tag {10} \\ \end{array} +$$ + +where $\{\mathcal{X},\mathcal{C}\}$ is the training dataset of paired image $x$ and text prompt $c$ , and $\eta$ denotes the trainable parameters of the proposed SemInpainter in Section 3.2. + +# 4 Experiments + +We verify the merit of the proposed Cascaded Transformer-Diffusion approach (CAT-Diffusion) for the task of text-guided object inpainting and compare with state-of-the-art diffusion-based methods [1, 2, 28, 35, 45]. Extensive experiments validate the effectiveness of CAT-Diffusion in inpainting high-fidelity objects. + +# 4.1 Implementation Details + +Following [45], we train CAT-Diffusion on the pairs of local mask and the corresponding object label from the training set of OpenImages-V6 [21]. CAT-Diffusion is optimized by Adam [19] with learning rate 0.00001 for about 40K iterations on 8 A100 GPUs. Batch size is set to 128 and the input image resolution is set as $512 \times 512$ . + +# 4.2 Compared Methods and Evaluation Metrics + +Compared Methods. We compare CAT-Diffusion with several state-of-the-art diffusion-based approaches including Blended Diffusion [2], Blended Latent Diffusion [1], GLIDE [28], SmartBrush [45], Stable Diffusion [35] and Stable Diffusion Inpainting. Specifically, Blended Diffusion, Blended Latent Diffusion and Stable Diffusion simply leverage a pre-trained base text-to-image model for text-guided object inpainting by blending the generated object and the background at each denoising step. The other methods train an inpainting diffusion model with the text prompt, binary mask and masked image as the inputs. Due to the same evaluation setup, the results of all methods are taken from [45], except for [1]. Please note that we have replaced the text-to-image stable diffusion 2.1 with 1.5 in Blended Latent Diffusion for fair comparisons. + +Evaluation Metrics. All the aforementioned methods are evaluated on the test sets of both OpenImages-V6 [21] and MSCOCO [24], leading to 13,400 and 9,311 test images, respectively. We adopt three widely-used metrics: Frechet + +Inception Distance (FID) [15, 38], Local FID and CLIP score [14]. It is worth mentioning that FID and Local FID measure the realism and visual coherence of the inpainted object in global image and local patch respectively, while CLIP score estimates the semantic relevance between the inpainted object and the text prompt. User study is additionally involved to evaluate both the visual coherence and text-object alignment. Since GLIDE only supports images of resolution 256 $\times$ 256, we resize all the results to the similar size for fair comparisons. Moreover, both segmentation mask and bounding box mask are considered in evaluation. + +# 4.3 Performance Comparisons + +Quantitative Results on OpenImages-V6. Table 1 summarizes the results of all the methods on test set of OpenImages-V6. Overall, results across all the metrics consistently demonstrate the effectiveness of our proposed CAT-Diffusion with segmentation mask or bounding box mask. Specifically, blending-based approaches (i.e., Blended Latent Diffusion and Stable Diffusion) achieve comparable CLIP scores but much inferior FID and Local FID scores to our CAT-Diffusion. We speculate that this is because these methods merely focus on the visual-semantic alignment between the inpainted image and the object label, and simply blend the generated object and background in the latent space. As such, the semantic context of the surrounding unmasked regions is overlooked, resulting in poor visual coherence. SmartBrush, by incorporating the masked image into U-Net for context learning and further guiding the diffusion model with shape mask, exhibits better performances. However, the FID and Local FID scores of SmartBrush are still below those of our CAT-Diffusion. The results verify the impact of steering the diffusion model with the pre-inpainted object features from the semantic inpainter through the reference adapter layer. + +Quantitative Results on MSCOCO. Table 2 lists the results of all the approaches on the test set of MSCOCO. It is noteworthy that neither SmartBrush nor our CAT-Diffusion are trained on MSCOCO. Similar to the trends on OpenImages-V6, CAT-Diffusion outperforms the other methods across most of the metrics. Specifically, CAT-Diffusion leads to the relative improvements over the strong baselines Stable Diffusion Inpainting and SmartBrush by $42.1\%$ and $20.7\%$ on Local FID (with bounding box mask), respectively. The results again validate the merit of decomposing the single-shot inpainting pipeline into two cascaded processes (first semantic pre-inpainting and then object generation) in our CAT-Diffusion. + +Qualitative Comparisons. Then, we qualitatively test different methods through case study. Figure 3 showcases several examples. As depicted by the top four results, the generated images by our CAT-Diffusion show better semantic alignment with the input text prompt than the other approaches. Moreover, better visual coherence of the objects with the surrounding context in the images and more accurate object shapes are also observed in the inpainted results of our + +Table 1: Quantitative performance comparisons on the test set of OpenImages-V6. + +
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]9.7221.930.26111.0529.160.265
GLIDE [28]9.0321.090.2509.7022.450.252
Blended Latent Diffusion† [1]8.3015.280.26214.8625.460.262
Stable Diffusion [35]6.9012.270.2639.1015.280.265
Stable Inpainting [35]5.8410.980.2617.0712.570.264
SmartBrush [45]4.707.820.2636.009.710.266
CAT-Diffusion (ours)3.996.320.2635.027.760.265
+ +Table 2: Quantitative performance comparisons on the test set of MSCOCO. + +
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]8.1626.250.24412.6841.430.251
Blended Latent Diffusion† [1]7.8819.840.24612.4029.530.248
Stable Diffusion [35]7.7817.160.24612.2925.610.250
GLIDE [28]6.9824.250.2359.3230.720.241
Stable Inpainting [35]6.5415.160.2438.5018.130.246
SmartBrush [45]5.769.800.2498.0513.220.252
CAT-Diffusion (ours)5.358.530.2496.8410.490.251
+ +CAT-Diffusion. The results prove the superiority of pre-inpainting the semantic features of the objects through the proposed semantic inpainter. For instance, compared to the images produced by other methods, the man generated by CAT-Diffusion at the first row is more structurally complete. This benefits from steering the diffusion model with the pre-inpainted semantic features of the target object through the reference adapter layer in our CAT-Diffusion. Though there is no shape mask provided, our CAT-Diffusion is able to generate high-fidelity objects given the text prompts and the bounding box masks (the middle two rows). Additionally, we evaluate object inpainting with more descriptive text prompts and the generated results of different methods are shown in the bottom two rows. Similarly, our CAT-Diffusion produces more visually pleasing images. + +User Study. Next, we carry out a user study to examine whether the inpainting images conform to human preferences. In the experiments, we randomly sample 1K images from the test set of OpenImages-V6 for evaluation. Note that SmartBrush [45] is not released and excluded here. We invite 10 evaluators (5 males and 5 females) with diverse education backgrounds: art design (4), psychology (2), computer science (2), and business (2). We show all the evaluators the inpainted images and the associated prompts, and ask them to assign scores $(0\sim$ 5) from two aspects: 1) Visual coherence with the surrounding context; 2) Align- + +![](images/b0b04d597d72099ef97f33a94679fab05ed42fb2d90b6f76a41a53ae8dc4f44a.jpg) +Fig.3: Examples generated by Stable Diffusion, Stable Diffusion Inpainting, GLIDE, Blended Diffusion, Blended Latent Diffusion and our proposed CAT-Diffusion with segmentation mask or bounding box mask. + +ment with the text prompt and the accurate object shape. Table 3 summarizes the averaged results of different approaches. As indicated by the results, CAT-Diffusion leads the competition by a large margin against the other baselines in terms of both text-object alignment and visual coherence. + +# 4.4 Analysis and Discussions + +Ablation Study on CAT-Diffusion. Here, we study how each component in CAT-Diffusion influences the overall performance. We consider one or more component at each stage and Table 4 summarizes the results on the test set of OpenImages-V6 with segmentation mask. Note that the baseline at Row #1 is a Stable Inpainting model finetuned with object-text pairs from [21]. By incorporating the reference adapter layer that is trained with CLIP features of masked images $x \odot (1 - m)$ only, the variant at Row #2 makes the absolute improvement + +Table 3: User study on 1K images randomly sampled from the test set of OpenImages-V6. BLD, SD and SD-Inapint are short for Blended Latent Diffusion, Stable Diffusion and Stable Diffusion Inpainting, respectively. + +
GLIDEBLDSDSD-InpaintCAT-Diffusion
Text-Object Alignment1.11.11.02.23.5
Visual Coherence1.21.21.12.63.6
+ +Table 4: Ablation study of the proposed CAT-Diffusion on the test set of OpenImages-V6 with segmentation mask. + +
#RefAdSemInptFID ↓Local FID ↓CLIP ↑
15.158.800.262
2✓4.247.330.262
3✓✓3.996.320.263
+ +over the base model at Row #1 by 0.91 and 1.47 on FID and Local FID scores, respectively. This is not surprising as the CLIP features of the unmasked region endow the base diffusion model with richer contextual semantics through the reference adapter layer, improving visual coherence and preserving the background. The outputs of semantic inpainter further boost the model with the semantics of the desired object, obtaining the best results at Row #3 across all the metrics. + +Predicted Features by Semantic Inpainter. We then analyze the extent to which the proposed semantic inpainter improves the semantic features of the desired objects. It is worth noting that the CLIP features of the masked region inherently encode the contextual semantics from the unmasked area due to self-attention mechanism in CLIP, resulting in non-trivial similarity with the ground-truth ones before passing through semantic inpainter. In particular, we compute the cosine similarity between the inputs/outputs of the semantic inpainter within the masked region and the corresponding ground-truth ones on 10K images. Figure 4(a) depicts the two distributions. The averaged cosine similarity is boosted from 0.47 to 0.65, demonstrating the effectiveness of the proposed semantic inpainter. Though the outputs from semantic inpainter are not $100\%$ accurate, richer context is contributed by these semantic features to generate high-fidelity objects in CAT-Diffusion. + +Diversity of Inpainted Results. In order to test the diversity of the inpainted results by our CAT-Diffusion with the same semantic features derived from the semantic inpainter, we conduct a study on the results with different random seeds. Figure 4(b) shows two examples. It can be observed that our CAT-Diffusion is able to inpaint diverse objects with accurate shapes controlled by the reference adapter layer. + +![](images/33355d1b4ae31a74842f81e75fd1ddfbdb204876513c6f474ae7455290a6fe02.jpg) +(a) Feature Similarity + +![](images/5f311d4756273b3bf5002ed73035e2ff4a90e24a75f901079e26eed3b02531e5.jpg) +(b) Diversity of Inpainted Results +Fig. 4: (a) The distributions of cosine similarity between the semantic features before/after the semantic inpinter within the masked region and the corresponding ground-truth ones. (b) Diverse inpainted images generated by our proposed CAT-Diffusion using different random seeds. + +Inference Complexity. During inference, we only require one-pass forward of the proposed semantic inpainter and the inpainted features can be reused in each denoising step, leading to minor computation overhead. The average time of our CAT-Diffusion (1.84 secs) for each image compared with SD-Inpaint (1.60 secs). + +# 5 Conclusion + +In this paper, a novel Cascaded Transformer-Diffusion (CAT-Diffusion) model is proposed to enhance the visual-semantic alignment and controllability of diffusion model for text-guided object inpainting. Specifically, our CAT-Diffusion decomposes the conventional single-stage pipeline into two cascaded processes: first semantic pre-inpainting and then object generation. By pre-inpainting the semantic features of the desired objects in a multi-modal feature space and then guiding the diffusion model with these features for object generation, our CAT-Diffusion is able to generate high-fidelity objects semantically aligned with the prompt and visually coherent with the background. Technically, a Transformer-based semantic inpainter predicts the semantic features of the desired object given the unmasked context and the prompt. Then, the inpainted features from the semantic inpainter are further fed into the object inpainting diffusion model via a reference adapter layer for controlled generation. Extensive experiments on OpenImages-V6 and MSCOCO validate the effectiveness of our CAT-Diffusion. + +Broader Impact. Recent advancements in generative models (e.g., diffusion models) have unlocked new realms of creative media generation. However, these innovations also bear the potential to be misused for the generation of deceive content. Our approach may be exploited to inpaint harmful content into images for misinformation spread, and we strongly disapprove of such actions. + +Acknowledgement. This work was supported by National Natural Science Foundation of China (No. 62172103, 32341012). + +# References + +1. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Trans. Graph. 42(4), 1-11 (2023) +2. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: CVPR (2022) +3. Ballester, C., Bertalmio, M., Caselles, V., Sapiro, G., Verdera, J.: Filling-in by joint interpolation of vector fields and gray levels. IEEE transactions on image processing 10(8), 1200-1211 (2001) +4. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009) +5. Bertalmio, M., Sapiro, G., Caselles, V., Ballester, C.: Image inpainting. In: SIGGRAPH (2000) +6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: CVPR (2023) +7. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023) +8. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023) +9. Criminisi, A., Pérez, P., Toyama, K.: Region filling and object removal by exemplar-based image inpainting. IEEE Transactions on image processing 13(9), 1200-1212 (2004) +0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021) +1. Feng, Z., Zhang, Z., Yu, X., Fang, Y., Li, L., Chen, X., Lu, Y., Liu, J., Yin, W., Feng, S., et al.: Ernie-vilg 2.0: Improving text-to-image diffusion model with knowledge-enhanced mixture-of-denoising-experts. In: CVPR (2023) +2. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020) +3. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022) +4. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021) +5. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017) +6. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., et al.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022) +7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020) +8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) +9. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014) +20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. arXiv preprint: arXiv:1312.6114 (2013) + +21. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision 128(7), 1956-1981 (2020) +22. Li, W., Lin, Z., Zhou, K., Qi, L., Wang, Y., Jia, J.: MAT: mask-aware transformer for large hole image inpainting. In: CVPR (2022) +23. Li, Y., Yao, T., Pan, Y., Mei, T.: Contextual transformer networks for visual recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(2), 1489-1500 (2022) +24. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV (2014) +25. Liu, G., Reda, F.A., Shih, K.J., Wang, T., Tao, A., Catanzaro, B.: Image inpainting for irregular holes using partial convolutions. In: ECCV (2018) +26. Liu, H., Wan, Z., Huang, W., Song, Y., Han, X., Liao, J.: PD-GAN: probabilistic diverse GAN for image inpainting. In: CVPR (2021) +27. Navaneet, K., Koohpayegani, S.A., Tejankar, A., Pirsiavash, H.: Simreg: Regression as a simple yet effective tool for self-supervised knowledge distillation. arXiv preprint arXiv:2201.05131 (2022) +28. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021) +29. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: ACM MM (2017) +30. Peng, J., Liu, D., Xu, S., Li, H.: Generating diverse structure for image inpainting with hierarchical VQ-VAE. In: CVPR (2021) +31. von Platen, P., Patil, S., Lozhkov, A., Cuenca, P., Lambert, N., Rasul, K., Davaadorj, M., Wolf, T.: Diffusers: State-of-the-art diffusion models. https://github.com/huggingface/diffusers (2022) +32. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022) +33. Quan, W., Zhang, R., Zhang, Y., Li, Z., Wang, J., Yan, D.: Image inpainting with local and global refinement. IEEE Trans. Image Process. 31, 2405-2420 (2022) +34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021) +35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022) +36. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015) +37. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. NeurIPS 35, 36479-36494 (2022) +38. Seitzer, M.: pytorch-fid: FID Score for PyTorch. https://github.com/mseitzer/pytorch-fid (August 2020), version 0.3.0 +39. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) +40. Song, Y., Yang, C., Lin, Z.L., Liu, X., Huang, Q., Li, H., Kuo, C.J.: Contextual-based image inpainting: Infer, match, and translate. In: ECCV (2018) + +41. Tang, J., Wang, T., Zhang, B., Zhang, T., Yi, R., Ma, L., Chen, D.: Make-it-3d: High-fidelity 3d creation from a single image with diffusion prior. arXiv preprint arXiv:2303.14184 (2023) +42. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. NeurIPS 30 (2017) +43. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: CVPR (2022) +44. Wu, J.Z., Ge, Y., Wang, X., Lei, S.W., Gu, Y., Shi, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. In: ICCV (2023) +45. Xie, S., Zhang, Z., Lin, Z., Hinz, T., Zhang, K.: Smartbrush: Text and shape guided object inpainting with diffusion model. In: CVPR (2023) +46. Xue, Z., Song, G., Guo, Q., Liu, B., Zong, Z., Liu, Y., Luo, P.: Raphael: Text-to-image generation via large mixture of diffusion paths. arXiv preprint arXiv:2305.18295 (2023) +47. Yang, C., Lu, X., Lin, Z., Shechtman, E., Wang, O., Li, H.: High-resolution image inpainting using multi-scale neural patch synthesis. In: CVPR (2017) +48. Yao, T., Li, Y., Pan, Y., Mei, T.: Hiri-vit: Scaling vision transformer with high resolution inputs. IEEE Transactions on Pattern Analysis and Machine Intelligence (2024) +49. Yao, T., Li, Y., Pan, Y., Wang, Y., Zhang, X.P., Mei, T.: Dual vision transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(9), 10870-10882 (2023) +50. Yi, Z., Tang, Q., Azizi, S., Jang, D., Xu, Z.: Contextual residual aggregation for ultra high-resolution image inpainting. In: CVPR (2020) +51. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Generative image inpainting with contextual attention. In: CVPR (2018) +52. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Free-form image inpainting with gated convolution. In: ICCV (2019) +53. Zeng, Y., Fu, J., Chao, H., Guo, B.: Learning pyramid-context encoder network for high-quality image inpainting. In: CVPR (2019) +54. Zhang, L., Chen, Q., Hu, B., Jiang, S.: Text-guided neural image inpainting. In: ACM MM (2020) +55. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV (2023) +56. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024) +57. Zhang, Z., Zhao, Z., Zhang, Z., Huai, B., Yuan, J.: Text-guided image inpainting. In: ACM MM (2020) +58. Zhao, L., Mo, Q., Lin, S., Wang, Z., Zuo, Z., Chen, H., Xing, W., Lu, D.: Uctgan: Diverse image inpainting based on unsupervised cross-space translation. In: CVPR (2020) +59. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unicontrolnet: All-in-one control to text-to-image diffusion models. arXiv preprint arXiv:2305.16322 (2023) +60. Zheng, C., Cham, T.J., Cai, J.: Pluralistic image completion. In: CVPR (2019) +61. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024) \ No newline at end of file diff --git a/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/images.zip b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..bc2057c5f4a3e36d1f050647faf54b964f4a7dee --- /dev/null +++ b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:743e7f96e929b4b348698542818c2e4afb7d495694930e60fa513c52aa2abcc9 +size 593247 diff --git a/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/layout.json b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..934712323911df458ae30d15a91f79f3da14ccb5 --- /dev/null +++ b/2024/Improving Text-guided Object Inpainting with Semantic Pre-inpainting/layout.json @@ -0,0 +1,8868 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 144, + 111, + 470, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 111, + 470, + 148 + ], + "spans": [ + { + "bbox": [ + 144, + 111, + 470, + 148 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "spans": [ + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "content": "Yifu Chen" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "content": ", Jingwen Chen" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "content": ", Yingwei Pan" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "content": ", Yehao Li" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "content": ", Ting Yao" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "inline_equation", + "content": "^{3}" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "content": ", Zhineng Chen" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "inline_equation", + "content": "^{1,2\\dagger}" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "text", + "content": ", and Tao Mei" + }, + { + "bbox": [ + 157, + 167, + 457, + 193 + ], + "type": "inline_equation", + "content": "^{3}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 206, + 201, + 406, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 206, + 201, + 406, + 213 + ], + "spans": [ + { + "bbox": [ + 206, + 201, + 406, + 213 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 206, + 201, + 406, + 213 + ], + "type": "text", + "content": " School of Computer Science, Fudan University" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 149, + 213, + 462, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 213, + 462, + 224 + ], + "spans": [ + { + "bbox": [ + 149, + 213, + 462, + 224 + ], + "type": "text", + "content": "2 Shanghai Collaborative Innovation Center of Intelligent Visual Computing" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 269, + 224, + 343, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 269, + 224, + 343, + 234 + ], + "spans": [ + { + "bbox": [ + 269, + 224, + 343, + 234 + ], + "type": "text", + "content": "3 HiDream.ai Inc." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 236, + 487, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 487, + 257 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 487, + 257 + ], + "type": "text", + "content": "22210240129@m.fudan.edu.cn, {chenjingwen, pandy, liyehao, tiyao}@hidream.ai zhinchen@fudan.edu.cn, tmei@hidream.ai" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 279, + 455, + 553 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 279, + 455, + 553 + ], + "spans": [ + { + "bbox": [ + 159, + 279, + 455, + 553 + ], + "type": "text", + "content": "Abstract. Recent years have witnessed the success of large text-to-image diffusion models and their remarkable potential to generate high-quality images. The further pursuit of enhancing the editability of images has sparked significant interest in the downstream task of inpainting a novel object described by a text prompt within a designated region in the image. Nevertheless, the problem is not trivial from two aspects: 1) Solely relying on one single U-Net to align text prompt and visual object across all the denoising timesteps is insufficient to generate desired objects; 2) The controllability of object generation is not guaranteed in the intricate sampling space of diffusion model. In this paper, we propose to decompose the typical single-stage object inpainting into two cascaded processes: 1) semantic pre-inpainting that infers the semantic features of desired objects in a multi-modal feature space; 2) high-fieldity object generation in diffusion latent space that pivots on such inpainted semantic features. To achieve this, we cascade a Transformer-based semantic inpainter and an object inpainting diffusion model, leading to a novel CAscaded Transformer-Diffusion (CAT-Diffusion) framework for text-guided object inpainting. Technically, the semantic inpainter is trained to predict the semantic features of the target object conditioning on unmasked context and text prompt. The outputs of the semantic inpainter then act as the informative visual prompts to guide high-fieldity object generation through a reference adapter layer, leading to controllable object inpainting. Extensive evaluations on OpenImages-V6 and MSCOCO validate the superiority of CAT-Diffusion against the state-of-the-art methods. Code is available at https://github.com/Nnn-s/CATdiffusion." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 160, + 563, + 417, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 563, + 417, + 574 + ], + "spans": [ + { + "bbox": [ + 160, + 563, + 417, + 574 + ], + "type": "text", + "content": "Keywords: Text-guided Object Inpainting " + }, + { + "bbox": [ + 160, + 563, + 417, + 574 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 563, + 417, + 574 + ], + "type": "text", + "content": " Diffusion Models" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 591, + 230, + 604 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 591, + 230, + 604 + ], + "spans": [ + { + "bbox": [ + 132, + 591, + 230, + 604 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 613, + 482, + 638 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 613, + 482, + 638 + ], + "spans": [ + { + "bbox": [ + 130, + 613, + 482, + 638 + ], + "type": "text", + "content": "Traditional image inpainting [3-5,9] focuses on restoring the corrupted area of an image without additional conditions, and is widely applied to object removal" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 140, + 643, + 481, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 643, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 140, + 643, + 481, + 666 + ], + "type": "text", + "content": "* This work was performed when Yifu Chen was visiting HiDream.ai as a research intern. † Zhineng Chen is the corresponding author." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 158, + 113, + 268, + 281 + ], + "blocks": [ + { + "bbox": [ + 158, + 113, + 268, + 281 + ], + "lines": [ + { + "bbox": [ + 158, + 113, + 268, + 281 + ], + "spans": [ + { + "bbox": [ + 158, + 113, + 268, + 281 + ], + "type": "image", + "image_path": "b15a7edacd6593875e28bfbda6ef983829bef188542d286f74a0e7f5e7186eba.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 292, + 482, + 381 + ], + "lines": [ + { + "bbox": [ + 130, + 292, + 482, + 381 + ], + "spans": [ + { + "bbox": [ + 130, + 292, + 482, + 381 + ], + "type": "text", + "content": "Fig. 1: An illustration of conventional object inpainting framework and our proposed CAT-Diffusion. (a) Typical framework commonly feeds a masked image with the original object removed, a text prompt describing the target object (e.g., \"cat\") and a binary mask indicating the designated region to be inpainted into an individual diffusion model for object inpainting. (b) Our proposed CAT-Diffusion additionally pre-inpaint the semantic features of the target object via Transformer-based semantic inpainter, and the derived features are leveraged to steer the diffusion model through the reference adapter layer for controllable and high-fidelity object inpainting." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 278, + 113, + 453, + 281 + ], + "blocks": [ + { + "bbox": [ + 278, + 113, + 453, + 281 + ], + "lines": [ + { + "bbox": [ + 278, + 113, + 453, + 281 + ], + "spans": [ + { + "bbox": [ + 278, + 113, + 453, + 281 + ], + "type": "image", + "image_path": "78b7f49da0e367f55059c4254972a00c233bb711b4182ae94288d96759e1574b.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 418, + 482, + 504 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 482, + 504 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 482, + 504 + ], + "type": "text", + "content": "or damaged image repairing. Later works [54, 57] have explored leveraging text prompts to complete the missing parts of an image, and shown impressive performances. Recent advances of diffusion-based text-to-image models [17,35,37] have established a steady momentum to produce high-quality images conditioning on text prompts, and derived breakthroughs for image editing task of text-guided object inpainting [1,28,45]. Such inpainting task is to specifically restore a novel object within a masked region with the condition of a given text prompt." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "One straightforward way for extending existing text-to-image diffusion models [17, 35] to text-guided object inpainting is to generate the new object from random noise and blend the object with background at every denoising step. Nevertheless, this method overlooks the inherent relations between new object and background, and might result in obvious artifacts around masked region and distorted object structure. The phenomenon motivates the subsequent efforts [28, 31] to finetune the text-to-image diffusion model via randomly erasing part of the input image and enforcing the model to recover the missing area based on the associated caption. Despite having promising results, these attempts severely suffer from misalignment between the inpainting object and the given caption, due to the fact that the caption describes the holistic image rather than the local masked region. To address this issue, SmartBrush [45] leverages the object label as prompt and the binary mask as the additional shape guidance" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "to steer the diffusion model for object inpainting. The conventional framework of this kind of object inpainting diffusion models is illustrated in Figure 1(a)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 482, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 482, + 415 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 482, + 415 + ], + "type": "text", + "content": "In general, the difficulty of text-guided object inpainting in diffusion model originates from two perspectives: 1) Solely relying on a single U-Net without model ensembling [11, 46] is insufficient to generate text-aligned objects (i.e., align text prompt and image with varied noise ratios along diffusion process). 2) Precisely controlling the generation of visual objects without extra control signals remains challenging in the intricate sampling space of diffusion model. To mitigate the issues, we present a novel CAT-Diffusion to decompose the typical single-shot object inpainting into two cascaded stages: 1) first semantic pre-inpainting, i.e., inferring semantic feature of target object in a noise-free multi-modal feature space; 2) then object generation, i.e., leveraging the inferred semantic feature as visual prompt to steer diffusion model, thereby leading to high-fidelity object inpainting. Such design eases the learning of object-text alignment in diffusion model. Specifically, a Transformer-based semantic inpainter is first devised to predict the semantic features of the desired object conditioning on the unmasked image context and the text prompt. Note that an effective knowledge distillation objective in a multi-modal feature space (CLIP feature space) is leveraged to supervise the learning of semantic inpainter with ground-truth patch features. Furthermore, the outputs of the semantic inpainter, as the semantically-aligned and context-aware visual prompts, are fed into an object inpainting diffusion model through an additional reference adapter layer. This layer elegantly modulates the visual prompts to enhance the controllability of diffusion model for object inpainting. The overall framework of our proposed CAT-Diffusion is shown in Figure 1(b)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 415, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 482, + 499 + ], + "type": "text", + "content": "In summary, we have made the following contributions: 1) The proposed CAT-Diffusion is shown capable of high-fidelity object inpainting through two decomposed stages, i.e., first semantic pre-inpainting and then object generation; 2) The designed diffusion model equipped with a reference adapter layer is shown able to nicely control object inpainting by modulating the visual prompts (i.e., the inpainted semantic features); 3) CAT-Diffusion has been properly verified through extensive experiments over OpenImages-V6 and MSCOCO." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 519, + 237, + 532 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 519, + 237, + 532 + ], + "spans": [ + { + "bbox": [ + 132, + 519, + 237, + 532 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Traditional Image Inpainting. Conventional image inpainting task aims to synthesize visually coherent and plausible content within the corrupted region of an image. Traditional methods [3-5,9] exploits the spatial redundancy of images to patch holes with image fragments sourced from elsewhere in the image, where the high-level semantics of the image are overlooked. To tackle this problem, recent inpainting techniques [25, 33, 51-53] leverage the semantic prior learned from large-scale image data and dynamically model the global-local interactions in the image with deep models (e.g., Generative Adversarial Networks [12, 29], Transformer-based architectures [23, 42, 48, 49]). However, the learning process will become increasingly challenging with higher image resolution. Thus, some" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 90, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 90, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 156, + 90, + 447, + 102 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": "works [22, 40, 47, 50] are proposed to resolve high-resolution image inpainting and promising results are achieved. Variational Auto-Encoder (VAE) [20] based methods [26, 30, 58, 60] further improve the diversity of outputs by sampling diverse and high-quality structural information from a latent space, and incorporate the derived structure encoding into the image generator for hole filling." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 183, + 480, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 480, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 480, + 363 + ], + "type": "text", + "content": "Text-Guided Image Inpainting. Despite their impressive performances, the aforementioned methods rely on the assumption that sufficient contextual information will be available within the source image. However, this assumption may not always hold. To minimize the loss of semantic information and facilitate greater control over the inpainting process, text prompts are employed as extra conditions in [54, 57], thereby introducing a new task of text-guided object inpainting. This newly introduced task differs fundamentally from conventional image inpainting in requiring visual and semantic consistency with the source image and the text prompt, respectively. The emergence of diffusion models [17, 35, 61] has propelled advancements in text-driven content creation with their powerful capability of high-fidelity image synthesis. Building upon this technology, recent studies [1, 2, 28, 45] showcase the ability to generate a novel object described by a text prompt within a region indicated by a binary mask. Furthermore, SmartBrush [45] uses the object mask as additional guidance during the inpainting process to boost the performances." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 370, + 480, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 370, + 480, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 370, + 480, + 491 + ], + "type": "text", + "content": "Diffusion Models. Diffusion denoising probabilistic models (DDPM) [17] have reshaped the landscape of image synthesis. However, notable challenges such as high computational demands and low inference efficiency arise, and hinder the deployment of DDPMs in practices. Significant efforts [10, 18, 39] have been dedicated to improve DDPMs and further tap their potentials. Particularly, Latent Diffusion Models (LDMs) [35] train the DDPM in a low-dimensional latent space learned by Variational Auto-Encoder, resulting in faster training and inference while producing high-fidelity images. With these noteworthy improvements, LDMs have solidified the position in the realms of text-to-image synthesis [6, 7, 13, 37, 55], video generation [16, 44, 56], 3D generation [8, 32, 41]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 498, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 481, + 665 + ], + "type": "text", + "content": "Summary. In this paper, we investigate the problem of text-guided object inpainting and propose a novel Cascaded Transformer-Diffusion (CAT-Diffusion) framework. In contrast to conventional methods that leaning on an individual diffusion model, our CAT-Diffusion decomposes the single-shot pipeline into two cascaded stages: first semantic pre-inpainting and then object generation. Technically, the semantic features of the target object are pre-inpainted in a noise-free multi-modal feature space (CLIP space). Different from existing methods [2,28] that optimizes the latent code to achieve higher CLIP score between regional/global image and object prompt during inference, our CAT-Diffusion predicts the semantic features of the desired object that naturally align with the prompt by exploiting the mask-unmask visual context and pre-trained multimodal priors in CLIP. Then, such inpainted semantic features are utilized to steer the diffusion model for controllable object generation, which eases the learning of object-text alignment in diffusion model across varied noise ratios." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 212, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 212, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 212, + 129 + ], + "type": "text", + "content": "3 Approach" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 224 + ], + "type": "text", + "content": "To begin with, it is worth recalling that, in text-guided object inpainting, a novel object described by a text prompt (usually the object label) needs to be generated within a designated region indicated by a binary mask of an input image. Both visual coherence and semantic relevance with the image and the text prompt, respectively, are required in this task. In this section, we will delve into the specifics of our proposed Cascaded Transformer-Diffusion (CAT-Diffusion) after a brief review of diffusion models, followed by the training details." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 241, + 221, + 251 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 241, + 221, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 241, + 221, + 251 + ], + "type": "text", + "content": "3.1 Prelimiaries" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "spans": [ + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "text", + "content": "Denoising Diffusion Probabilistic Model (DDPM) [17], a new type of generative model, can be regarded as a parameterized Markov chain able to produce images that closely match a desired data distribution within finite timesteps " + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "text", + "content": ". Generally, a forward diffusion process and a reverse denoising process are involved in DDPM. Specifically, in the forward diffusion process, DDPM gradually applies noise to the image according to a pre-defined variance schedule " + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "inline_equation", + "content": "\\{\\beta_t\\}_1^T" + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "text", + "content": " until the image is fully destroyed. Conversely, during the reverse denoising process, DDPM is trained to estimate the added noise to the noisy image and progressively remove it over a sequence of " + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "text", + "content": " timesteps. The training objective of DDPM (usually implemented as a U-Net [36]) parameterized by " + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 260, + 482, + 380 + ], + "type": "text", + "content": " can be simply formulated as" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 197, + 390, + 480, + 404 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 390, + 480, + 404 + ], + "spans": [ + { + "bbox": [ + 197, + 390, + 480, + 404 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {d d p m} (\\theta , x) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} (x _ {t}, t, c) - \\epsilon \\| _ {2} ^ {2} ], \\tag {1}", + "image_path": "fafe64e4668e85bcc5157399d9a571f943d6ea7ab90e1b4bc5776ea7f7c9f715.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "spans": [ + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "text", + "content": " is a random noise sampled from the normal distribution " + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "inline_equation", + "content": "\\mathcal{N}(0, I)" + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "text", + "content": " is some kind of condition (e.g., text prompt), and " + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "inline_equation", + "content": "x_{t}" + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "text", + "content": " is the noisy image at timestep " + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 412, + 482, + 446 + ], + "type": "text", + "content": " derived as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 255, + 448, + 480, + 460 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 448, + 480, + 460 + ], + "spans": [ + { + "bbox": [ + 255, + 448, + 480, + 460 + ], + "type": "interline_equation", + "content": "x _ {t} = \\sqrt {\\bar {\\alpha} _ {t}} x _ {0} + \\sqrt {1 - \\bar {\\alpha} _ {t}} \\epsilon , \\tag {2}", + "image_path": "487f43ac0e992659ff1757d645b4f0137ee4ff854ca1935b662cd2d59905408e.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 465, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 465, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 465, + 482, + 525 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 465, + 482, + 525 + ], + "type": "inline_equation", + "content": "\\alpha_{t} = 1 - \\beta_{t}" + }, + { + "bbox": [ + 130, + 465, + 482, + 525 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 465, + 482, + 525 + ], + "type": "inline_equation", + "content": "\\bar{\\alpha}_{t} = \\prod_{s=1}^{t} \\alpha_{s}" + }, + { + "bbox": [ + 130, + 465, + 482, + 525 + ], + "type": "text", + "content": ". To address the challenge of training DDPM at higher resolutions with limited GPU resources, Latent Diffusion Model (LDM) [35] instead trains DDPM in latent space of lower dimensions than pixel space. In this paper, we follow the similar recipe, and the training objective Eq. 1 can be rewritten as:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 200, + 534, + 480, + 548 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 534, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 200, + 534, + 480, + 548 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {l d m} (\\theta , z) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} (z _ {t}, t, c) - \\epsilon \\| _ {2} ^ {2} ], \\tag {3}", + "image_path": "f74f9734ce18b8afaaf743e29db637bbd0f9ffcf694c776be8471aae0c022d97.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 556, + 481, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 556, + 481, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 556, + 481, + 581 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 556, + 481, + 581 + ], + "type": "inline_equation", + "content": "z" + }, + { + "bbox": [ + 130, + 556, + 481, + 581 + ], + "type": "text", + "content": " is the latent representation of " + }, + { + "bbox": [ + 130, + 556, + 481, + 581 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 556, + 481, + 581 + ], + "type": "text", + "content": " and usually obtained from a pre-trained Variational Auto-Encoder (VAE)." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 597, + 358, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 597, + 358, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 597, + 358, + 609 + ], + "type": "text", + "content": "3.2 Cascaded Transformer-Diffusion Model" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Let " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " be an input image, a text prompt that describes the novel object, and a binary mask that indicates the region to be inpainted, respectively. Most of the existing text-guided object inpainting diffusion models [1, 28] are merely optimized to align the text prompt " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and the desired object " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "x \\odot m" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " in" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 142, + 114, + 473, + 290 + ], + "blocks": [ + { + "bbox": [ + 142, + 114, + 473, + 290 + ], + "lines": [ + { + "bbox": [ + 142, + 114, + 473, + 290 + ], + "spans": [ + { + "bbox": [ + 142, + 114, + 473, + 290 + ], + "type": "image", + "image_path": "410f23ddc3591b3cc113d1ead7d273c73b722b5f856bd3c3f3c87c2dcbc619c5.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 141, + 292, + 153, + 303 + ], + "blocks": [ + { + "bbox": [ + 141, + 292, + 153, + 303 + ], + "lines": [ + { + "bbox": [ + 141, + 292, + 153, + 303 + ], + "spans": [ + { + "bbox": [ + 141, + 292, + 153, + 303 + ], + "type": "image", + "image_path": "46ed5c786b1fc34cca9f9313fe325e1439b718901077d63210d0a4207de40d82.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 153, + 293, + 203, + 300 + ], + "lines": [ + { + "bbox": [ + 153, + 293, + 203, + 300 + ], + "spans": [ + { + "bbox": [ + 153, + 293, + 203, + 300 + ], + "type": "text", + "content": "Frozen Parameters" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 206, + 292, + 217, + 302 + ], + "blocks": [ + { + "bbox": [ + 206, + 292, + 217, + 302 + ], + "lines": [ + { + "bbox": [ + 206, + 292, + 217, + 302 + ], + "spans": [ + { + "bbox": [ + 206, + 292, + 217, + 302 + ], + "type": "image", + "image_path": "fcab3b2749adac345ccd172078bb688e1f2206a97017ac9aae2597e009dad50e.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 218, + 293, + 274, + 300 + ], + "lines": [ + { + "bbox": [ + 218, + 293, + 274, + 300 + ], + "spans": [ + { + "bbox": [ + 218, + 293, + 274, + 300 + ], + "type": "text", + "content": "Trainable Parameters" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 312, + 482, + 411 + ], + "lines": [ + { + "bbox": [ + 130, + 312, + 482, + 411 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 482, + 411 + ], + "type": "text", + "content": "Fig. 2: The framework of our CAT-Diffusion. Specifically, a pre-trained image encoder is first employed to extract the visual features of the masked image. Then, a novel semantic inpainter takes these visual features and a text prompt as inputs, and preinpaints the semantic features of the desired object in a multi-modal feature space, thereby aligning the prompt and the visual object in addition to the U-Net regardless of denoising timesteps. To achieve this goal, knowledge distillation is adopted to transfer the multi-modal knowledge from a teacher model to the semantic inpainter. Finally, an object inpainting diffusion model equipped with a reference adapter layer is steered by the aligned semantic features for controllable object inpainting in visual space." + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 278, + 293, + 288, + 302 + ], + "blocks": [ + { + "bbox": [ + 278, + 293, + 288, + 302 + ], + "lines": [ + { + "bbox": [ + 278, + 293, + 288, + 302 + ], + "spans": [ + { + "bbox": [ + 278, + 293, + 288, + 302 + ], + "type": "image", + "image_path": "5400f34a71c1c0929096a37e326f0d169b730caec9af9e1d0c6e00261c3048c9.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 290, + 293, + 324, + 300 + ], + "lines": [ + { + "bbox": [ + 290, + 293, + 324, + 300 + ], + "spans": [ + { + "bbox": [ + 290, + 293, + 324, + 300 + ], + "type": "text", + "content": "Text Feature" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 329, + 293, + 339, + 302 + ], + "blocks": [ + { + "bbox": [ + 329, + 293, + 339, + 302 + ], + "lines": [ + { + "bbox": [ + 329, + 293, + 339, + 302 + ], + "spans": [ + { + "bbox": [ + 329, + 293, + 339, + 302 + ], + "type": "image", + "image_path": "67e9e93fb8879361bbdd08f2ca2119a8ee482403d78e872bc7c702223d6a5ffd.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 340, + 293, + 393, + 300 + ], + "lines": [ + { + "bbox": [ + 340, + 293, + 393, + 300 + ], + "spans": [ + { + "bbox": [ + 340, + 293, + 393, + 300 + ], + "type": "text", + "content": "Position Embedding" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 398, + 293, + 415, + 302 + ], + "blocks": [ + { + "bbox": [ + 398, + 293, + 415, + 302 + ], + "lines": [ + { + "bbox": [ + 398, + 293, + 415, + 302 + ], + "spans": [ + { + "bbox": [ + 398, + 293, + 415, + 302 + ], + "type": "image", + "image_path": "9c75cbf7767932d80d74b5d5e7ea0d15bd65a6bc08fbea259069342d62fb7dad.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 417, + 293, + 465, + 301 + ], + "lines": [ + { + "bbox": [ + 417, + 293, + 465, + 301 + ], + "spans": [ + { + "bbox": [ + 417, + 293, + 465, + 301 + ], + "type": "text", + "content": "Mask Embedding" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_caption" + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 445, + 482, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 445, + 482, + 517 + ], + "spans": [ + { + "bbox": [ + 130, + 445, + 482, + 517 + ], + "type": "text", + "content": "the latent space, which leads to suboptimal results. As discussed previously in Section. 1, two primary issues need to be addressed for further improvements: 1) Relying on a standalone U-Net to achieve visual-semantic alignment across all denoising timesteps is insufficient [11,46] for text-guided object inpainting; 2) It is challenging to stably generate high-fidelity objects in the intricate sampling space without extra semantic information." + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "To overcome these challenges, we propose to decompose the conventional single-stage pipeline into two cascaded stages: first semantic pre-inpainting and then object generation, leading to our CAT-Diffusion. Technically, our CAT-Diffusion pre-inpaints the object in an auxiliary multi-modal feature space (e.g., CLIP [34]) via a novel semantic inpainter. The semantic inpainter is trained through knowledge distillation [27] to predict the semantic features of the target object conditioning on the unmasked visual context and text prompt. This way, the derived outputs naturally align the text prompt and the visual object in addition to the U-Net regardless of the denoising timesteps. The outputs from the semantic inpainter is further integrated into an object inpainting diffusion model through a reference adapter layer for controllable object inpainting. The overall framework of CAT-Diffusion is shown in Figure 2." + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": "Semantic Inpainter. To alleviate the deficiency in aligning text prompt and visual object solely depending on a standalone U-Net across the entire denoising process, we propose to enhance the visual-semantic correspondence in a well pre-trained auxiliary multi-modal feature space in addition to the U-Net by inpainting the semantic features of the desired object. The rationale behind is that the pre-trained multi-modal feature space is learned on large-scale cross-modal data for visual-semantic alignment regardless of the denoising timesteps. In this work, an effective knowledge distillation objective is devised to transfer this kind of multi-modal knowledge from a teacher model (CLIP) to the semantic inpainter in our CAT-Diffusion." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": "Specifically, a Transformer-based semantic inpainter (SemInpainter) parameterized by " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "\\eta" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": " is cascaded with a object inpainting diffusion model in our CAT-Diffusion, as shown in the upper part of Figure 2. First, the visual features " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "\\{\\hat{\\mathbf{v}}_i\\}_{1}^{N}" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": " of the masked image " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "x\\odot (1 - m)" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": " are extracted by the image encoder of CLIP (ImageEnc), where " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{v}}_i\\in \\mathbb{R}^d" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": " is a feature vector of a local image patch. Given the corrupted features " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "\\{\\hat{\\mathbf{v}}_i\\}_{1}^{N}" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": " of the masked image and the textual feature " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "\\mathbf{c}\\in \\mathbb{R}^{d}" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": " of the text prompt " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": ", SemInpainter aims to predict semantic features " + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "inline_equation", + "content": "\\{\\bar{\\mathbf{v}}_i\\}_{1}^{N}" + }, + { + "bbox": [ + 130, + 236, + 480, + 355 + ], + "type": "text", + "content": " that faithfully reconstruct the target object in CLIP space. This way, the visual-semantic alignment is naturally attained along the entire denoising process of diffusion model. This whole process can be expressed as" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 200, + 365, + 415, + 380 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 365, + 415, + 380 + ], + "spans": [ + { + "bbox": [ + 200, + 365, + 415, + 380 + ], + "type": "interline_equation", + "content": "\\{\\bar {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} = S e m I n p a i n t e r ([ \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} + \\mathbf {P E} + \\mathbf {M E}, \\mathbf {c} ]),", + "image_path": "a12814f0b8025060329b28a888fc9f622bd025a9079b6c2158eb6b382b750902.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 200, + 375, + 480, + 396 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 200, + 375, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 200, + 375, + 480, + 396 + ], + "type": "interline_equation", + "content": "\\left. \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} = \\operatorname {I m a g e E n c} (x \\odot (1 - m)), \\right. \\tag {4}", + "image_path": "18a37007f00b51ae5cd88ccb4118b44d3e7c5d2a06b61331f50e589707d6e57d.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "spans": [ + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "[\\cdot ]" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": " denotes the concatenation operation, " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\mathbf{PE}\\in \\mathbb{R}^{N\\times d}" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": " is a learnable position embedding, and " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\mathbf{ME}\\in \\mathbb{R}^{N\\times d}" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": " is a learnable mask embedding that indicates whether the visual feature " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{v}}_i" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": " is masked in the image " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "x\\odot (1 - m)" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": " or not. Our SemInpainter is implemented as 24-layer Transformer structure (similar to the CLIP [34] image encoder). Finally, we derive the inpainted features " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\{\\tilde{\\mathbf{v}}_i\\}_{1}^N" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": ", which will be later incorporated into the object inpainting diffusion model, by blending " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\{\\hat{\\mathbf{v}}_i\\}_{1}^N" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "\\{\\overline{\\mathbf{v}}_i\\}_{1}^N" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": " with the binary mask " + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 131, + 406, + 479, + 491 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 182, + 501, + 480, + 517 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 182, + 501, + 480, + 517 + ], + "spans": [ + { + "bbox": [ + 182, + 501, + 480, + 517 + ], + "type": "interline_equation", + "content": "\\{\\tilde {\\mathbf {v}} _ {i} \\} _ {1} ^ {N / 4} = D o w n S a m p l e (\\{\\bar {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} \\odot m + \\{\\hat {\\mathbf {v}} _ {i} \\} _ {1} ^ {N} \\odot (1 - m)), \\tag {5}", + "image_path": "168196e61d7a4b6811985b749137eba0af2f223a6690da69f4b1cd98ec328b8a.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 525, + 479, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 525, + 479, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 525, + 479, + 548 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 525, + 479, + 548 + ], + "type": "inline_equation", + "content": "DownSample(\\cdot)" + }, + { + "bbox": [ + 130, + 525, + 479, + 548 + ], + "type": "text", + "content": " is a parameter-free downsample layer to reduce the feature resolution for computation efficiency." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 550, + 479, + 621 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 550, + 479, + 621 + ], + "spans": [ + { + "bbox": [ + 130, + 550, + 479, + 621 + ], + "type": "text", + "content": "To enforce the predicted object features aligning with the text prompt " + }, + { + "bbox": [ + 130, + 550, + 479, + 621 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 550, + 479, + 621 + ], + "type": "text", + "content": ", we propose to transfer the multi-modal knowledge from a teacher model (CLIP is adopted as the teacher model in this paper) to the SemInpainter. Technically, the SemInpainter is trained with the task of Masked Feature Prediction [27,43] to recover the ground-truth semantic features of the masked object in CLIP space conditioned on the unmasked visual context and the text prompt " + }, + { + "bbox": [ + 130, + 550, + 479, + 621 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 550, + 479, + 621 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 479, + 665 + ], + "type": "text", + "content": "Reference Adapter Layer. Since controlling the diffusion model for high-fidelity text-to-image generation remains challenging, inspired by [55, 59], the" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "content": "semantic features " + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\{\\tilde{\\mathbf{v}}_i\\}_{1}^{N / 4}" + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "content": " are utilized as additional conditions, referred as visual prompts, to steer the diffusion model for controllable inpainting in latent space." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "text", + "content": "Specifically, we introduce a new reference adapter layer (RefAdapter) to the base object inpainting diffusion model, which is formulated as a multi-head cross-attention layer of Transformer style. The proposed RefAdapter is alternately plugged in between the original self-attention (SelfAttn) and cross-attention layers (CrossAttn) of the U-Net, as shown in the lower part of Figure 2. Let " + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{H} \\in \\mathbb{R}^{N_h \\times d_h}" + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "text", + "content": " be the intermediate hidden states of the U-Net, where " + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "inline_equation", + "content": "N_h" + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "text", + "content": " varies along with the resolution of different layers. " + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "inline_equation", + "content": "\\mathbf{C} \\in \\mathbb{R}^{N_c \\times d_c}" + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "text", + "content": " is the textual features of the prompt " + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 140, + 480, + 248 + ], + "type": "text", + "content": " extracted by the text encoder in the diffusion model. A shared module prototype for different types of attention layers is first defined as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 219, + 255, + 480, + 268 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 219, + 255, + 480, + 268 + ], + "spans": [ + { + "bbox": [ + 219, + 255, + 480, + 268 + ], + "type": "interline_equation", + "content": "\\text {O u t p u t} = \\text {M o d u l e} (\\text {Q u e r y}, \\text {K e y}, \\text {V a l u e}). \\tag {6}", + "image_path": "0a036454ce49e54eb03752741bd34b1f9ab4fb0d416460163c93bd12791bc831.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 274, + 479, + 298 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 274, + 479, + 298 + ], + "spans": [ + { + "bbox": [ + 131, + 274, + 479, + 298 + ], + "type": "text", + "content": "Therefore, a full block in the upgraded U-Net including SelfAttn, RefAdapter and CrossAttn operates as" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 202, + 304, + 353, + 316 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 202, + 304, + 353, + 316 + ], + "spans": [ + { + "bbox": [ + 202, + 304, + 353, + 316 + ], + "type": "interline_equation", + "content": "\\mathbf {H} _ {x} = \\operatorname {C r o s s A t t n} \\left(\\mathbf {H} _ {r}, \\mathbf {C}, \\mathbf {C}\\right) + \\mathbf {H} _ {r},", + "image_path": "291f7034afcc2e6eb16a7dd5a2c0f3dcec18f574581d2d871a858e4a74af5635.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 203, + 319, + 480, + 335 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 203, + 319, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 203, + 319, + 480, + 335 + ], + "type": "interline_equation", + "content": "\\mathbf {H} _ {r} = \\operatorname {R e f A d a p t e r} \\left(\\mathbf {H} _ {s}, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}\\right) + \\mathbf {H} _ {s}, \\tag {7}", + "image_path": "a44e5bf079f5930e7452fc6d2fac72e0a06c66660cd8917d668fa62d97139bc7.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 203, + 337, + 339, + 350 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 203, + 337, + 339, + 350 + ], + "spans": [ + { + "bbox": [ + 203, + 337, + 339, + 350 + ], + "type": "interline_equation", + "content": "\\mathbf {H} _ {s} = \\operatorname {S e l f A t t n} (\\mathbf {H}, \\mathbf {H}, \\mathbf {H}) + \\mathbf {H},", + "image_path": "614775d9fc7cebc73f85977074749a29409427352bf8ffb145077b052849aff3.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 355, + 334, + 367 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 355, + 334, + 367 + ], + "spans": [ + { + "bbox": [ + 131, + 355, + 334, + 367 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 355, + 334, + 367 + ], + "type": "inline_equation", + "content": "\\mathbf{H}_x" + }, + { + "bbox": [ + 131, + 355, + 334, + 367 + ], + "type": "text", + "content": " will be the input to the next block." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 383, + 480, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 383, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 383, + 480, + 456 + ], + "type": "text", + "content": "Object Inpainting Diffusion Model. By decomposing the object inpainting pipeline into the two cascaded processes, our CAT-Diffusion can generate high-fidelity objects that are semantically aligned with the text prompt. Moreover, the visual coherence between the filled-in object and the surrounding image context is further enhanced by steering the diffusion model with additional semantic guidance (i.e., the inpainted visual features " + }, + { + "bbox": [ + 130, + 383, + 480, + 456 + ], + "type": "inline_equation", + "content": "\\{\\tilde{\\mathbf{v}}_i\\}_{1}^{N/4}" + }, + { + "bbox": [ + 130, + 383, + 480, + 456 + ], + "type": "text", + "content": ")." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "spans": [ + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "content": "Generally, an inpainting diffusion model with U-Net parameterized as " + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "content": " takes the noisy latent code " + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "content": ", the mask " + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "inline_equation", + "content": "m" + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "content": " indicating the region to be inpainted and the masked latent code " + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "inline_equation", + "content": "z \\odot (1 - m)" + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "content": " as inputs, and estimates the noise to be removed from " + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "content": ", leading to the denoised one " + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "inline_equation", + "content": "z_{t-1}" + }, + { + "bbox": [ + 130, + 456, + 480, + 515 + ], + "type": "text", + "content": ". Mathematically, the overall procedure can be expressed as" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 146, + 521, + 480, + 546 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 521, + 480, + 546 + ], + "spans": [ + { + "bbox": [ + 146, + 521, + 480, + 546 + ], + "type": "interline_equation", + "content": "z _ {t - 1} = \\frac {1}{\\sqrt {\\alpha_ {t}}} \\left(z _ {t} - \\frac {1 - \\alpha_ {t}}{\\sqrt {1 - \\bar {\\alpha} _ {t}}} \\cdot \\epsilon_ {\\theta} \\left(\\left[ z _ {t}, z \\odot (1 - m), m \\right], t, c, \\left\\{\\tilde {\\mathbf {v}} _ {i} \\right\\} _ {1} ^ {N / 4}\\right)\\right) + \\sigma_ {t} \\epsilon . \\tag {8}", + "image_path": "e34c9f81df70e7b16749c18f5e50fc19657cec07da937ad20e1e9a80d2f6889a.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 552, + 347, + 564 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 552, + 347, + 564 + ], + "spans": [ + { + "bbox": [ + 132, + 552, + 347, + 564 + ], + "type": "text", + "content": "The readers can refer to [17,35] for more details." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 579, + 204, + 592 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 579, + 204, + 592 + ], + "spans": [ + { + "bbox": [ + 132, + 579, + 204, + 592 + ], + "type": "text", + "content": "3.3 Training" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 597, + 487, + 633 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 487, + 633 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 487, + 633 + ], + "type": "text", + "content": "Diffusion Loss. For the training of the object inpainting diffusion model equipped with the reference adapter layer, we employ the general practice in [35] following the objective function as" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 137, + 639, + 480, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 639, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 137, + 639, + 480, + 666 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {l d m} (\\theta , z, m) = \\mathbb {E} _ {t \\sim \\mathcal {U} (0, T), \\epsilon \\sim \\mathcal {N} (0, I)} [ \\| \\epsilon_ {\\theta} ([ z _ {t}, z \\odot (1 - m), m ], t, c, \\{\\tilde {\\mathbf {v}} _ {i} \\} _ {1} ^ {N / 4}) - \\epsilon \\| _ {2} ^ {2} ]. \\tag {9}", + "image_path": "d204dfc2a04896fab424cd8568cef90a1e56c77220472ce12ac163e53f6b5378.jpg" + } + ] + } + ], + "index": 16 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 101 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": "Knowledge Distillation Loss. Moreover, to enforce the semantic inpainter to pre-inpaint the object features that are semantically aligned with the prompt " + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": ", we supervise the semantic inpainter with the ground-truth visual features " + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "inline_equation", + "content": "CLIP(x)" + }, + { + "bbox": [ + 130, + 116, + 479, + 175 + ], + "type": "text", + "content": " in the task of Masked Feature Prediction. The optimization objective can be formulated as" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 142, + 184, + 481, + 223 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 184, + 481, + 223 + ], + "spans": [ + { + "bbox": [ + 142, + 184, + 481, + 223 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} _ {\\text {d i s t i l l}} (\\eta , x, m) = \\mathbb {E} _ {(x, c) \\sim \\{\\mathcal {X}, \\mathcal {C} \\}} [ \\| S e m I n p a i n t e r _ {\\eta} (I m a g e E n c (x \\odot (1 - m)), c) \\\\ - C L I P (x) \\| _ {2} ^ {2} ], \\tag {10} \\\\ \\end{array}", + "image_path": "720f08f4316b6b9ea3ae34a0eb0b4072b73e52829a8f2191312c5d06be516572.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "inline_equation", + "content": "\\{\\mathcal{X},\\mathcal{C}\\}" + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "text", + "content": " is the training dataset of paired image " + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "text", + "content": " and text prompt " + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "inline_equation", + "content": "c" + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "inline_equation", + "content": "\\eta" + }, + { + "bbox": [ + 130, + 224, + 479, + 248 + ], + "type": "text", + "content": " denotes the trainable parameters of the proposed SemInpainter in Section 3.2." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 267, + 229, + 280 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 267, + 229, + 280 + ], + "spans": [ + { + "bbox": [ + 131, + 267, + 229, + 280 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 293, + 479, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 293, + 479, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 479, + 342 + ], + "type": "text", + "content": "We verify the merit of the proposed Cascaded Transformer-Diffusion approach (CAT-Diffusion) for the task of text-guided object inpainting and compare with state-of-the-art diffusion-based methods [1, 2, 28, 35, 45]. Extensive experiments validate the effectiveness of CAT-Diffusion in inpainting high-fidelity objects." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 359, + 279, + 371 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 359, + 279, + 371 + ], + "spans": [ + { + "bbox": [ + 131, + 359, + 279, + 371 + ], + "type": "text", + "content": "4.1 Implementation Details" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 380, + 479, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 479, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 479, + 439 + ], + "type": "text", + "content": "Following [45], we train CAT-Diffusion on the pairs of local mask and the corresponding object label from the training set of OpenImages-V6 [21]. CAT-Diffusion is optimized by Adam [19] with learning rate 0.00001 for about 40K iterations on 8 A100 GPUs. Batch size is set to 128 and the input image resolution is set as " + }, + { + "bbox": [ + 130, + 380, + 479, + 439 + ], + "type": "inline_equation", + "content": "512 \\times 512" + }, + { + "bbox": [ + 130, + 380, + 479, + 439 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 459, + 382, + 471 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 459, + 382, + 471 + ], + "spans": [ + { + "bbox": [ + 131, + 459, + 382, + 471 + ], + "type": "text", + "content": "4.2 Compared Methods and Evaluation Metrics" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 479, + 480, + 611 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 480, + 611 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 480, + 611 + ], + "type": "text", + "content": "Compared Methods. We compare CAT-Diffusion with several state-of-the-art diffusion-based approaches including Blended Diffusion [2], Blended Latent Diffusion [1], GLIDE [28], SmartBrush [45], Stable Diffusion [35] and Stable Diffusion Inpainting. Specifically, Blended Diffusion, Blended Latent Diffusion and Stable Diffusion simply leverage a pre-trained base text-to-image model for text-guided object inpainting by blending the generated object and the background at each denoising step. The other methods train an inpainting diffusion model with the text prompt, binary mask and masked image as the inputs. Due to the same evaluation setup, the results of all methods are taken from [45], except for [1]. Please note that we have replaced the text-to-image stable diffusion 2.1 with 1.5 in Blended Latent Diffusion for fair comparisons." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "text", + "content": "Evaluation Metrics. All the aforementioned methods are evaluated on the test sets of both OpenImages-V6 [21] and MSCOCO [24], leading to 13,400 and 9,311 test images, respectively. We adopt three widely-used metrics: Frechet" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 156, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": "Inception Distance (FID) [15, 38], Local FID and CLIP score [14]. It is worth mentioning that FID and Local FID measure the realism and visual coherence of the inpainted object in global image and local patch respectively, while CLIP score estimates the semantic relevance between the inpainted object and the text prompt. User study is additionally involved to evaluate both the visual coherence and text-object alignment. Since GLIDE only supports images of resolution 256 " + }, + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "inline_equation", + "content": "\\times" + }, + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": " 256, we resize all the results to the similar size for fair comparisons. Moreover, both segmentation mask and bounding box mask are considered in evaluation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 229, + 293, + 241 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 229, + 293, + 241 + ], + "spans": [ + { + "bbox": [ + 132, + 229, + 293, + 241 + ], + "type": "text", + "content": "4.3 Performance Comparisons" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 248, + 482, + 440 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 248, + 482, + 440 + ], + "spans": [ + { + "bbox": [ + 130, + 248, + 482, + 440 + ], + "type": "text", + "content": "Quantitative Results on OpenImages-V6. Table 1 summarizes the results of all the methods on test set of OpenImages-V6. Overall, results across all the metrics consistently demonstrate the effectiveness of our proposed CAT-Diffusion with segmentation mask or bounding box mask. Specifically, blending-based approaches (i.e., Blended Latent Diffusion and Stable Diffusion) achieve comparable CLIP scores but much inferior FID and Local FID scores to our CAT-Diffusion. We speculate that this is because these methods merely focus on the visual-semantic alignment between the inpainted image and the object label, and simply blend the generated object and background in the latent space. As such, the semantic context of the surrounding unmasked regions is overlooked, resulting in poor visual coherence. SmartBrush, by incorporating the masked image into U-Net for context learning and further guiding the diffusion model with shape mask, exhibits better performances. However, the FID and Local FID scores of SmartBrush are still below those of our CAT-Diffusion. The results verify the impact of steering the diffusion model with the pre-inpainted object features from the semantic inpainter through the reference adapter layer." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 456, + 483, + 576 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 456, + 483, + 576 + ], + "spans": [ + { + "bbox": [ + 130, + 456, + 483, + 576 + ], + "type": "text", + "content": "Quantitative Results on MSCOCO. Table 2 lists the results of all the approaches on the test set of MSCOCO. It is noteworthy that neither SmartBrush nor our CAT-Diffusion are trained on MSCOCO. Similar to the trends on OpenImages-V6, CAT-Diffusion outperforms the other methods across most of the metrics. Specifically, CAT-Diffusion leads to the relative improvements over the strong baselines Stable Diffusion Inpainting and SmartBrush by " + }, + { + "bbox": [ + 130, + 456, + 483, + 576 + ], + "type": "inline_equation", + "content": "42.1\\%" + }, + { + "bbox": [ + 130, + 456, + 483, + 576 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 456, + 483, + 576 + ], + "type": "inline_equation", + "content": "20.7\\%" + }, + { + "bbox": [ + 130, + 456, + 483, + 576 + ], + "type": "text", + "content": " on Local FID (with bounding box mask), respectively. The results again validate the merit of decomposing the single-shot inpainting pipeline into two cascaded processes (first semantic pre-inpainting and then object generation) in our CAT-Diffusion." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 594, + 493, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 493, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 493, + 666 + ], + "type": "text", + "content": "Qualitative Comparisons. Then, we qualitatively test different methods through case study. Figure 3 showcases several examples. As depicted by the top four results, the generated images by our CAT-Diffusion show better semantic alignment with the input text prompt than the other approaches. Moreover, better visual coherence of the objects with the surrounding context in the images and more accurate object shapes are also observed in the inpainted results of our" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 101 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 136, + 481, + 253 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 476, + 125 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 476, + 125 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 476, + 125 + ], + "type": "text", + "content": "Table 1: Quantitative performance comparisons on the test set of OpenImages-V6." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 136, + 481, + 253 + ], + "lines": [ + { + "bbox": [ + 133, + 136, + 481, + 253 + ], + "spans": [ + { + "bbox": [ + 133, + 136, + 481, + 253 + ], + "type": "table", + "html": "
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]9.7221.930.26111.0529.160.265
GLIDE [28]9.0321.090.2509.7022.450.252
Blended Latent Diffusion† [1]8.3015.280.26214.8625.460.262
Stable Diffusion [35]6.9012.270.2639.1015.280.265
Stable Inpainting [35]5.8410.980.2617.0712.570.264
SmartBrush [45]4.707.820.2636.009.710.266
CAT-Diffusion (ours)3.996.320.2635.027.760.265
", + "image_path": "26a58dcfbdd9c441d8654f981ac7b9db38046ef10deaeaf4aea43bed50300e79.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 284, + 481, + 400 + ], + "blocks": [ + { + "bbox": [ + 147, + 262, + 465, + 274 + ], + "lines": [ + { + "bbox": [ + 147, + 262, + 465, + 274 + ], + "spans": [ + { + "bbox": [ + 147, + 262, + 465, + 274 + ], + "type": "text", + "content": "Table 2: Quantitative performance comparisons on the test set of MSCOCO." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 284, + 481, + 400 + ], + "lines": [ + { + "bbox": [ + 133, + 284, + 481, + 400 + ], + "spans": [ + { + "bbox": [ + 133, + 284, + 481, + 400 + ], + "type": "table", + "html": "
ModelWith Segmentation MaskWith Bounding Box Mask
FID ↓ Local FID ↓ CLIP ↑FID ↓ Local FID ↓ CLIP ↑
Blended Diffusion [2]8.1626.250.24412.6841.430.251
Blended Latent Diffusion† [1]7.8819.840.24612.4029.530.248
Stable Diffusion [35]7.7817.160.24612.2925.610.250
GLIDE [28]6.9824.250.2359.3230.720.241
Stable Inpainting [35]6.5415.160.2438.5018.130.246
SmartBrush [45]5.769.800.2498.0513.220.252
CAT-Diffusion (ours)5.358.530.2496.8410.490.251
", + "image_path": "7f677a4cc99c90b9bf621b550c11adb7e51e33084b450a395a677a85329cf1ba.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 422, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 422, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 422, + 482, + 555 + ], + "type": "text", + "content": "CAT-Diffusion. The results prove the superiority of pre-inpainting the semantic features of the objects through the proposed semantic inpainter. For instance, compared to the images produced by other methods, the man generated by CAT-Diffusion at the first row is more structurally complete. This benefits from steering the diffusion model with the pre-inpainted semantic features of the target object through the reference adapter layer in our CAT-Diffusion. Though there is no shape mask provided, our CAT-Diffusion is able to generate high-fidelity objects given the text prompts and the bounding box masks (the middle two rows). Additionally, we evaluate object inpainting with more descriptive text prompts and the generated results of different methods are shown in the bottom two rows. Similarly, our CAT-Diffusion produces more visually pleasing images." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "User Study. Next, we carry out a user study to examine whether the inpainting images conform to human preferences. In the experiments, we randomly sample 1K images from the test set of OpenImages-V6 for evaluation. Note that SmartBrush [45] is not released and excluded here. We invite 10 evaluators (5 males and 5 females) with diverse education backgrounds: art design (4), psychology (2), computer science (2), and business (2). We show all the evaluators the inpainted images and the associated prompts, and ask them to assign scores " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "(0\\sim" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " 5) from two aspects: 1) Visual coherence with the surrounding context; 2) Align-" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 90, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 90, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 156, + 90, + 447, + 102 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 117, + 473, + 424 + ], + "blocks": [ + { + "bbox": [ + 141, + 117, + 473, + 424 + ], + "lines": [ + { + "bbox": [ + 141, + 117, + 473, + 424 + ], + "spans": [ + { + "bbox": [ + 141, + 117, + 473, + 424 + ], + "type": "image", + "image_path": "b0b04d597d72099ef97f33a94679fab05ed42fb2d90b6f76a41a53ae8dc4f44a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 435, + 482, + 470 + ], + "lines": [ + { + "bbox": [ + 130, + 435, + 482, + 470 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 482, + 470 + ], + "type": "text", + "content": "Fig.3: Examples generated by Stable Diffusion, Stable Diffusion Inpainting, GLIDE, Blended Diffusion, Blended Latent Diffusion and our proposed CAT-Diffusion with segmentation mask or bounding box mask." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 493, + 482, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 493, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 493, + 482, + 542 + ], + "type": "text", + "content": "ment with the text prompt and the accurate object shape. Table 3 summarizes the averaged results of different approaches. As indicated by the results, CAT-Diffusion leads the competition by a large margin against the other baselines in terms of both text-object alignment and visual coherence." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 560, + 287, + 572 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 560, + 287, + 572 + ], + "spans": [ + { + "bbox": [ + 131, + 560, + 287, + 572 + ], + "type": "text", + "content": "4.4 Analysis and Discussions" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Ablation Study on CAT-Diffusion. Here, we study how each component in CAT-Diffusion influences the overall performance. We consider one or more component at each stage and Table 4 summarizes the results on the test set of OpenImages-V6 with segmentation mask. Note that the baseline at Row #1 is a Stable Inpainting model finetuned with object-text pairs from [21]. By incorporating the reference adapter layer that is trained with CLIP features of masked images " + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "x \\odot (1 - m)" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": " only, the variant at Row #2 makes the absolute improvement" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 146, + 157, + 468, + 205 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 482, + 149 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 482, + 149 + ], + "type": "text", + "content": "Table 3: User study on 1K images randomly sampled from the test set of OpenImages-V6. BLD, SD and SD-Inapint are short for Blended Latent Diffusion, Stable Diffusion and Stable Diffusion Inpainting, respectively." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 146, + 157, + 468, + 205 + ], + "lines": [ + { + "bbox": [ + 146, + 157, + 468, + 205 + ], + "spans": [ + { + "bbox": [ + 146, + 157, + 468, + 205 + ], + "type": "table", + "html": "
GLIDEBLDSDSD-InpaintCAT-Diffusion
Text-Object Alignment1.11.11.02.23.5
Visual Coherence1.21.21.12.63.6
", + "image_path": "02dde80727ec7597c30243282adc75e534a288411221e27a19c82b321c5e3d19.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 190, + 247, + 424, + 308 + ], + "blocks": [ + { + "bbox": [ + 131, + 214, + 479, + 236 + ], + "lines": [ + { + "bbox": [ + 131, + 214, + 479, + 236 + ], + "spans": [ + { + "bbox": [ + 131, + 214, + 479, + 236 + ], + "type": "text", + "content": "Table 4: Ablation study of the proposed CAT-Diffusion on the test set of OpenImages-V6 with segmentation mask." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 190, + 247, + 424, + 308 + ], + "lines": [ + { + "bbox": [ + 190, + 247, + 424, + 308 + ], + "spans": [ + { + "bbox": [ + 190, + 247, + 424, + 308 + ], + "type": "table", + "html": "
#RefAdSemInptFID ↓Local FID ↓CLIP ↑
15.158.800.262
2✓4.247.330.262
3✓✓3.996.320.263
", + "image_path": "f831c49d84fd42c10290c1526b9a31b39a3466c566f50ed4dce2b31ab007b3fe.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 329, + 482, + 401 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 482, + 401 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 482, + 401 + ], + "type": "text", + "content": "over the base model at Row #1 by 0.91 and 1.47 on FID and Local FID scores, respectively. This is not surprising as the CLIP features of the unmasked region endow the base diffusion model with richer contextual semantics through the reference adapter layer, improving visual coherence and preserving the background. The outputs of semantic inpainter further boost the model with the semantics of the desired object, obtaining the best results at Row #3 across all the metrics." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 419, + 482, + 575 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 419, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 130, + 419, + 482, + 575 + ], + "type": "text", + "content": "Predicted Features by Semantic Inpainter. We then analyze the extent to which the proposed semantic inpainter improves the semantic features of the desired objects. It is worth noting that the CLIP features of the masked region inherently encode the contextual semantics from the unmasked area due to self-attention mechanism in CLIP, resulting in non-trivial similarity with the ground-truth ones before passing through semantic inpainter. In particular, we compute the cosine similarity between the inputs/outputs of the semantic inpainter within the masked region and the corresponding ground-truth ones on 10K images. Figure 4(a) depicts the two distributions. The averaged cosine similarity is boosted from 0.47 to 0.65, demonstrating the effectiveness of the proposed semantic inpainter. Though the outputs from semantic inpainter are not " + }, + { + "bbox": [ + 130, + 419, + 482, + 575 + ], + "type": "inline_equation", + "content": "100\\%" + }, + { + "bbox": [ + 130, + 419, + 482, + 575 + ], + "type": "text", + "content": " accurate, richer context is contributed by these semantic features to generate high-fidelity objects in CAT-Diffusion." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Diversity of Inpainted Results. In order to test the diversity of the inpainted results by our CAT-Diffusion with the same semantic features derived from the semantic inpainter, we conduct a study on the results with different random seeds. Figure 4(b) shows two examples. It can be observed that our CAT-Diffusion is able to inpaint diverse objects with accurate shapes controlled by the reference adapter layer." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 90, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 90, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 156, + 90, + 448, + 103 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 114, + 305, + 198 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 305, + 198 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 305, + 198 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 305, + 198 + ], + "type": "image", + "image_path": "33355d1b4ae31a74842f81e75fd1ddfbdb204876513c6f474ae7455290a6fe02.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 200, + 202, + 254, + 210 + ], + "lines": [ + { + "bbox": [ + 200, + 202, + 254, + 210 + ], + "spans": [ + { + "bbox": [ + 200, + 202, + 254, + 210 + ], + "type": "text", + "content": "(a) Feature Similarity" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 309, + 116, + 463, + 198 + ], + "blocks": [ + { + "bbox": [ + 309, + 116, + 463, + 198 + ], + "lines": [ + { + "bbox": [ + 309, + 116, + 463, + 198 + ], + "spans": [ + { + "bbox": [ + 309, + 116, + 463, + 198 + ], + "type": "image", + "image_path": "5f311d4756273b3bf5002ed73035e2ff4a90e24a75f901079e26eed3b02531e5.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 345, + 202, + 429, + 210 + ], + "lines": [ + { + "bbox": [ + 345, + 202, + 429, + 210 + ], + "spans": [ + { + "bbox": [ + 345, + 202, + 429, + 210 + ], + "type": "text", + "content": "(b) Diversity of Inpainted Results" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 222, + 482, + 266 + ], + "lines": [ + { + "bbox": [ + 130, + 222, + 482, + 266 + ], + "spans": [ + { + "bbox": [ + 130, + 222, + 482, + 266 + ], + "type": "text", + "content": "Fig. 4: (a) The distributions of cosine similarity between the semantic features before/after the semantic inpinter within the masked region and the corresponding ground-truth ones. (b) Diverse inpainted images generated by our proposed CAT-Diffusion using different random seeds." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 289, + 482, + 339 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 482, + 339 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 482, + 339 + ], + "type": "text", + "content": "Inference Complexity. During inference, we only require one-pass forward of the proposed semantic inpainter and the inpainted features can be reused in each denoising step, leading to minor computation overhead. The average time of our CAT-Diffusion (1.84 secs) for each image compared with SD-Inpaint (1.60 secs)." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 355, + 220, + 368 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 355, + 220, + 368 + ], + "spans": [ + { + "bbox": [ + 132, + 355, + 220, + 368 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 548 + ], + "type": "text", + "content": "In this paper, a novel Cascaded Transformer-Diffusion (CAT-Diffusion) model is proposed to enhance the visual-semantic alignment and controllability of diffusion model for text-guided object inpainting. Specifically, our CAT-Diffusion decomposes the conventional single-stage pipeline into two cascaded processes: first semantic pre-inpainting and then object generation. By pre-inpainting the semantic features of the desired objects in a multi-modal feature space and then guiding the diffusion model with these features for object generation, our CAT-Diffusion is able to generate high-fidelity objects semantically aligned with the prompt and visually coherent with the background. Technically, a Transformer-based semantic inpainter predicts the semantic features of the desired object given the unmasked context and the prompt. Then, the inpainted features from the semantic inpainter are further fed into the object inpainting diffusion model via a reference adapter layer for controlled generation. Extensive experiments on OpenImages-V6 and MSCOCO validate the effectiveness of our CAT-Diffusion." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 564, + 482, + 624 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 564, + 482, + 624 + ], + "spans": [ + { + "bbox": [ + 130, + 564, + 482, + 624 + ], + "type": "text", + "content": "Broader Impact. Recent advancements in generative models (e.g., diffusion models) have unlocked new realms of creative media generation. However, these innovations also bear the potential to be misused for the generation of deceive content. Our approach may be exploited to inpaint harmful content into images for misinformation spread, and we strongly disapprove of such actions." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 482, + 666 + ], + "type": "text", + "content": "Acknowledgement. This work was supported by National Natural Science Foundation of China (No. 62172103, 32341012)." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 138, + 140, + 479, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 479, + 161 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 479, + 161 + ], + "type": "text", + "content": "1. Avrahami, O., Fried, O., Lischinski, D.: Blended latent diffusion. ACM Trans. Graph. 42(4), 1-11 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "text", + "content": "2. Avrahami, O., Lischinski, D., Fried, O.: Blended diffusion for text-driven editing of natural images. In: CVPR (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 184, + 480, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 480, + 216 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 480, + 216 + ], + "type": "text", + "content": "3. Ballester, C., Bertalmio, M., Caselles, V., Sapiro, G., Verdera, J.: Filling-in by joint interpolation of vector fields and gray levels. IEEE transactions on image processing 10(8), 1200-1211 (2001)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 217, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 480, + 248 + ], + "type": "text", + "content": "4. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: Patchmatch: A randomized correspondence algorithm for structural image editing. ACM Trans. Graph. 28(3), 24 (2009)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 249, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 249, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 138, + 249, + 480, + 270 + ], + "type": "text", + "content": "5. Bertalmio, M., Sapiro, G., Caselles, V., Ballester, C.: Image inpainting. In: SIGGRAPH (2000)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 271, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 271, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 271, + 480, + 293 + ], + "type": "text", + "content": "6. Brooks, T., Holynski, A., Efros, A.A.: Instructpix2pix: Learning to follow image editing instructions. In: CVPR (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 293, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 293, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 138, + 293, + 480, + 315 + ], + "type": "text", + "content": "7. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 316, + 480, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 480, + 336 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 480, + 336 + ], + "type": "text", + "content": "8. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 337, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 480, + 369 + ], + "type": "text", + "content": "9. Criminisi, A., Pérez, P., Toyama, K.: Region filling and object removal by exemplar-based image inpainting. IEEE Transactions on image processing 13(9), 1200-1212 (2004)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 370, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 480, + 391 + ], + "type": "text", + "content": "0. Dhariwal, P., Nichol, A.: Diffusion models beat gans on image synthesis. NeurIPS 34, 8780-8794 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "text", + "content": "1. Feng, Z., Zhang, Z., Yu, X., Fang, Y., Li, L., Chen, X., Lu, Y., Liu, J., Yin, W., Feng, S., et al.: Ernie-vilg 2.0: Improving text-to-image diffusion model with knowledge-enhanced mixture-of-denoising-experts. In: CVPR (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 425, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 425, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 138, + 425, + 480, + 456 + ], + "type": "text", + "content": "2. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Communications of the ACM 63(11), 139–144 (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 457, + 480, + 489 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 457, + 480, + 489 + ], + "spans": [ + { + "bbox": [ + 138, + 457, + 480, + 489 + ], + "type": "text", + "content": "3. Hertz, A., Mokady, R., Tenenbaum, J., Aberman, K., Pritch, Y., Cohen-Or, D.: Prompt-to-prompt image editing with cross attention control. arXiv preprint arXiv:2208.01626 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 491, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 480, + 511 + ], + "type": "text", + "content": "4. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning. arXiv preprint arXiv:2104.08718 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 512, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 512, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 512, + 480, + 544 + ], + "type": "text", + "content": "5. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 544, + 480, + 577 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 577 + ], + "type": "text", + "content": "6. Ho, J., Chan, W., Sahara, C., Whang, J., Gao, R., Gritsenko, A., Kingma, D.P., Poole, B., Norouzi, M., Fleet, D.J., et al.: Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303 (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 578, + 480, + 598 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 598 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 598 + ], + "type": "text", + "content": "7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 600, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 620 + ], + "type": "text", + "content": "8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "text", + "content": "9. Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. arXiv preprint: arXiv:1312.6114 (2013)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 156, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 161 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 161 + ], + "type": "text", + "content": "21. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision 128(7), 1956-1981 (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 162, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 162, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 132, + 162, + 481, + 183 + ], + "type": "text", + "content": "22. Li, W., Lin, Z., Zhou, K., Qi, L., Wang, Y., Jia, J.: MAT: mask-aware transformer for large hole image inpainting. In: CVPR (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 184, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 184, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 184, + 481, + 216 + ], + "type": "text", + "content": "23. Li, Y., Yao, T., Pan, Y., Mei, T.: Contextual transformer networks for visual recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(2), 1489-1500 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 217, + 481, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 217, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 132, + 217, + 481, + 239 + ], + "type": "text", + "content": "24. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: ECCV (2014)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 239, + 481, + 261 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 239, + 481, + 261 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 481, + 261 + ], + "type": "text", + "content": "25. Liu, G., Reda, F.A., Shih, K.J., Wang, T., Tao, A., Catanzaro, B.: Image inpainting for irregular holes using partial convolutions. In: ECCV (2018)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 262, + 481, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 262, + 481, + 285 + ], + "spans": [ + { + "bbox": [ + 132, + 262, + 481, + 285 + ], + "type": "text", + "content": "26. Liu, H., Wan, Z., Huang, W., Song, Y., Han, X., Liao, J.: PD-GAN: probabilistic diverse GAN for image inpainting. In: CVPR (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 285, + 481, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 481, + 317 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 481, + 317 + ], + "type": "text", + "content": "27. Navaneet, K., Koohpayegani, S.A., Tejankar, A., Pirsiavash, H.: Simreg: Regression as a simple yet effective tool for self-supervised knowledge distillation. arXiv preprint arXiv:2201.05131 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 318, + 481, + 351 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 318, + 481, + 351 + ], + "spans": [ + { + "bbox": [ + 132, + 318, + 481, + 351 + ], + "type": "text", + "content": "28. Nichol, A., Dhariwal, P., Ramesh, A., Shyam, P., Mishkin, P., McGrew, B., Sutskever, I., Chen, M.: Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741 (2021)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 352, + 481, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 352, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 132, + 352, + 481, + 373 + ], + "type": "text", + "content": "29. Pan, Y., Qiu, Z., Yao, T., Li, H., Mei, T.: To create what you tell: Generating videos from captions. In: ACM MM (2017)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 374, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 374, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 374, + 481, + 396 + ], + "type": "text", + "content": "30. Peng, J., Liu, D., Xu, S., Li, H.: Generating diverse structure for image inpainting with hierarchical VQ-VAE. In: CVPR (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 481, + 430 + ], + "type": "text", + "content": "31. von Platen, P., Patil, S., Lozhkov, A., Cuenca, P., Lambert, N., Rasul, K., Davaadorj, M., Wolf, T.: Diffusers: State-of-the-art diffusion models. https://github.com/huggingface/diffusers (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 430, + 481, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 481, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 481, + 452 + ], + "type": "text", + "content": "32. Poole, B., Jain, A., Barron, J.T., Mildenhall, B.: Dreamfusion: Text-to-3d using 2d diffusion. arXiv preprint arXiv:2209.14988 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 453, + 481, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 481, + 475 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 481, + 475 + ], + "type": "text", + "content": "33. Quan, W., Zhang, R., Zhang, Y., Li, Z., Wang, J., Yan, D.: Image inpainting with local and global refinement. IEEE Trans. Image Process. 31, 2405-2420 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "spans": [ + { + "bbox": [ + 132, + 475, + 481, + 508 + ], + "type": "text", + "content": "34. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 509, + 481, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 531 + ], + "type": "text", + "content": "35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: CVPR (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 531, + 481, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 531, + 481, + 553 + ], + "spans": [ + { + "bbox": [ + 132, + 531, + 481, + 553 + ], + "type": "text", + "content": "36. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 554, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 481, + 597 + ], + "type": "text", + "content": "37. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. NeurIPS 35, 36479-36494 (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 598, + 481, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 598, + 481, + 620 + ], + "spans": [ + { + "bbox": [ + 132, + 598, + 481, + 620 + ], + "type": "text", + "content": "38. Seitzer, M.: pytorch-fid: FID Score for PyTorch. https://github.com/mseitzer/pytorch-fid (August 2020), version 0.3.0" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 620, + 481, + 642 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 620, + 481, + 642 + ], + "spans": [ + { + "bbox": [ + 132, + 620, + 481, + 642 + ], + "type": "text", + "content": "39. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 481, + 665 + ], + "type": "text", + "content": "40. Song, Y., Yang, C., Lin, Z.L., Liu, X., Huang, Q., Li, H., Kuo, C.J.: Contextual-based image inpainting: Infer, match, and translate. In: ECCV (2018)" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 233, + 100 + ], + "type": "text", + "content": "Yifu Chen et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 657 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 148 + ], + "type": "text", + "content": "41. Tang, J., Wang, T., Zhang, B., Zhang, T., Yi, R., Ma, L., Chen, D.: Make-it-3d: High-fidelity 3d creation from a single image with diffusion prior. arXiv preprint arXiv:2303.14184 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 149, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 149, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 149, + 480, + 171 + ], + "type": "text", + "content": "42. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. NeurIPS 30 (2017)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 171, + 480, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 171, + 480, + 192 + ], + "spans": [ + { + "bbox": [ + 132, + 171, + 480, + 192 + ], + "type": "text", + "content": "43. Wei, C., Fan, H., Xie, S., Wu, C.Y., Yuille, A., Feichtenhofer, C.: Masked feature prediction for self-supervised visual pre-training. In: CVPR (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 192, + 480, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 192, + 480, + 224 + ], + "spans": [ + { + "bbox": [ + 132, + 192, + 480, + 224 + ], + "type": "text", + "content": "44. Wu, J.Z., Ge, Y., Wang, X., Lei, S.W., Gu, Y., Shi, Y., Hsu, W., Shan, Y., Qie, X., Shou, M.Z.: Tune-a-video: One-shot tuning of image diffusion models for text-to-video generation. In: ICCV (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 224, + 480, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 480, + 246 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 480, + 246 + ], + "type": "text", + "content": "45. Xie, S., Zhang, Z., Lin, Z., Hinz, T., Zhang, K.: Smartbrush: Text and shape guided object inpainting with diffusion model. In: CVPR (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 246, + 480, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 246, + 480, + 278 + ], + "spans": [ + { + "bbox": [ + 132, + 246, + 480, + 278 + ], + "type": "text", + "content": "46. Xue, Z., Song, G., Guo, Q., Liu, B., Zong, Z., Liu, Y., Luo, P.: Raphael: Text-to-image generation via large mixture of diffusion paths. arXiv preprint arXiv:2305.18295 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 279, + 480, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 279, + 480, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 279, + 480, + 300 + ], + "type": "text", + "content": "47. Yang, C., Lu, X., Lin, Z., Shechtman, E., Wang, O., Li, H.: High-resolution image inpainting using multi-scale neural patch synthesis. In: CVPR (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 300, + 480, + 332 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 480, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 480, + 332 + ], + "type": "text", + "content": "48. Yao, T., Li, Y., Pan, Y., Mei, T.: Hiri-vit: Scaling vision transformer with high resolution inputs. IEEE Transactions on Pattern Analysis and Machine Intelligence (2024)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 333, + 480, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 333, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 132, + 333, + 480, + 365 + ], + "type": "text", + "content": "49. Yao, T., Li, Y., Pan, Y., Wang, Y., Zhang, X.P., Mei, T.: Dual vision transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(9), 10870-10882 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 365, + 480, + 388 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 480, + 388 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 480, + 388 + ], + "type": "text", + "content": "50. Yi, Z., Tang, Q., Azizi, S., Jang, D., Xu, Z.: Contextual residual aggregation for ultra high-resolution image inpainting. In: CVPR (2020)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 388, + 480, + 408 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 388, + 480, + 408 + ], + "spans": [ + { + "bbox": [ + 132, + 388, + 480, + 408 + ], + "type": "text", + "content": "51. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Generative image inpainting with contextual attention. In: CVPR (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 408, + 480, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 408, + 480, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 408, + 480, + 430 + ], + "type": "text", + "content": "52. Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., Huang, T.S.: Free-form image inpainting with gated convolution. In: ICCV (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 430, + 480, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 480, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 480, + 452 + ], + "type": "text", + "content": "53. Zeng, Y., Fu, J., Chao, H., Guo, B.: Learning pyramid-context encoder network for high-quality image inpainting. In: CVPR (2019)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 452, + 480, + 473 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 452, + 480, + 473 + ], + "spans": [ + { + "bbox": [ + 132, + 452, + 480, + 473 + ], + "type": "text", + "content": "54. Zhang, L., Chen, Q., Hu, B., Jiang, S.: Text-guided neural image inpainting. In: ACM MM (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 473, + 480, + 495 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 473, + 480, + 495 + ], + "spans": [ + { + "bbox": [ + 132, + 473, + 480, + 495 + ], + "type": "text", + "content": "55. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: ICCV (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 495, + 480, + 526 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 495, + 480, + 526 + ], + "spans": [ + { + "bbox": [ + 132, + 495, + 480, + 526 + ], + "type": "text", + "content": "56. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 526, + 480, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 526, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 132, + 526, + 480, + 548 + ], + "type": "text", + "content": "57. Zhang, Z., Zhao, Z., Zhang, Z., Huai, B., Yuan, J.: Text-guided image inpainting. In: ACM MM (2020)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 548, + 480, + 581 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 548, + 480, + 581 + ], + "spans": [ + { + "bbox": [ + 132, + 548, + 480, + 581 + ], + "type": "text", + "content": "58. Zhao, L., Mo, Q., Lin, S., Wang, Z., Zuo, Z., Chen, H., Xing, W., Lu, D.: Uctgan: Diverse image inpainting based on unsupervised cross-space translation. In: CVPR (2020)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 581, + 480, + 613 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 581, + 480, + 613 + ], + "spans": [ + { + "bbox": [ + 132, + 581, + 480, + 613 + ], + "type": "text", + "content": "59. Zhao, S., Chen, D., Chen, Y.C., Bao, J., Hao, S., Yuan, L., Wong, K.Y.K.: Unicontrolnet: All-in-one control to text-to-image diffusion models. arXiv preprint arXiv:2305.16322 (2023)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 614, + 480, + 624 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 614, + 480, + 624 + ], + "spans": [ + { + "bbox": [ + 132, + 614, + 480, + 624 + ], + "type": "text", + "content": "60. Zheng, C., Cham, T.J., Cai, J.: Pluralistic image completion. In: CVPR (2019)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 132, + 624, + 480, + 657 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 624, + 480, + 657 + ], + "spans": [ + { + "bbox": [ + 132, + 624, + 480, + 657 + ], + "type": "text", + "content": "61. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 156, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 156, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Text-guided Object Inpainting with Semantic Pre-inpainting" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_content_list.json b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..8f3e5fa38959504190d25223f5457a1efa532f19 --- /dev/null +++ b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_content_list.json @@ -0,0 +1,1419 @@ +[ + { + "type": "text", + "text": "Improving Unsupervised Domain Adaptation: A Pseudo-Candidate Set Approach", + "text_level": 1, + "bbox": [ + 225, + 140, + 774, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Aveen Dayal $^{1}$ , Rishabh Lalla $^{1}$ , Linga Reddy Cenkeramaddi $^{2}$ , C Krishna Mohan $^{1}$ , Abhinav Kumar $^{1}$ , and Vineeth N Balasubramanian $^{1}$", + "bbox": [ + 225, + 210, + 774, + 242 + ], + "page_idx": 0 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "$^{1}$ Indian Institute of Technology Hyderabad, Hyderabad 502285, India {ai21resch11003@, rishabh.lalla@cse., ckm@cse., abhinavkumar@ee., vineethnb@cse.}iith.ac.in", + "2 University of Agder, Grimstad 4879, Norway linga.cenkeramaddi@uia.no" + ], + "bbox": [ + 250, + 253, + 750, + 324 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Unsupervised domain adaptation (UDA) is a critical challenge in machine learning, aiming to transfer knowledge from a labeled source domain to an unlabeled target domain. In this work, we aim to improve target set accuracy in any existing UDA method by introducing an approach that utilizes pseudo-candidate sets for labeling the target data. These pseudo-candidate sets serve as a proxy for the true labels in the absence of direct supervision. To enhance the accuracy of the target domain, we propose Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), a method which effectively learns to disambiguate among classes in the pseudo-candidate set. Our approach is characterized by two distinct loss functions: one that acts on the pseudo-candidate set to refine its predictions and another that operates on the labels outside the pseudo-candidate set. We use a threshold-based strategy to further guide the learning process toward accurate label disambiguation. We validate our novel yet simple approach through extensive experiments on three well-known benchmark datasets: Office-Home, VisDA, and DomainNet. Our experimental results demonstrate the efficacy of our method in achieving consistent gains on target accuracies across these datasets.", + "bbox": [ + 259, + 358, + 738, + 621 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Unsupervised Domain Adaptation $\\cdot$ Disambiguation $\\cdot$ Pseudo-Candidate Set", + "bbox": [ + 259, + 635, + 751, + 662 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 688, + 375, + 704 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In recent years, Deep Neural Networks (DNNs) have showcased remarkable achievements in multiple domains such as robotics [19], medical imaging [37], agriculture [17], and beyond. However, in the realm of deep learning, domain shift presents a significant challenge as it occurs when the training set and the test set exhibit different data distributions, leading to a degradation in model performance [1, 29]. Unsupervised Domain Adaptation (UDA) has emerged as a prominent setting to address such challenges. UDA aims to adapt a model trained on a labeled training set (source domain) to perform well on an unlabeled", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "test set (target domain) by minimizing the domain discrepancy and leveraging the intrinsic structure of the target domain [11, 41]. This adaptation is crucial for deploying deep learning models in dynamic environments where obtaining labeled data for every possible domain is impractical [6]. For instance, [16] explains how UDA techniques can be applied to bridge the gap between simulated and real-world domains, a common challenge in robotics.", + "bbox": [ + 212, + 146, + 787, + 238 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To address the UDA problem, two prominent categories of methods have emerged: adversarial and self-training approaches. Adversarial methods, such as Domain-Adversarial Neural Networks (DANN) [11], Maximum Classifier Discrepancy (MCD) [36], and Margin Disparity Discrepancy (MDD) [50], focus on minimizing the domain discrepancy by aligning the feature distributions of the source and target domains through adversarial training. On the other hand, self-training techniques, exemplified by works like Cycle Self-Training (CST) [22], and Minimum Class Confusion (MCC) [15], leverage the model's predictions on the target domain to iteratively refine the model, aiming to improve its generalization to the target domain. Apart from these, hybrid approaches that integrate both adversarial and self-training paradigms for effective adaptation across domains have also been proposed [3,24,43]. These approaches have shown promising results in addressing the challenges of domain shift in UDA.", + "bbox": [ + 212, + 241, + 787, + 439 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Despite these existing efforts in the field of UDA, we recognize an opportunity to further enhance performance in the target domain. Inspired by the use of candidate sets in partial-label learning [10, 40], we present a novel perspective to address the UDA problem by analyzing the patterns in the predictions of trained UDA models. As illustrated in Fig. 1, we observe that for multiple target samples, the trained UDA model's predictions are ambiguous, i.e., the model is not very confident about its predictions. Furthermore, we observe that this ambiguity is not uniformly distributed across all classes; instead, it is predominantly concentrated in a few closely related classes that exhibit the highest predicted probabilities, thereby leading to this ambiguity. To tackle this ambiguity, we introduce a novel technique, Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), which refines the predictions within the target domain. UDPCS starts by creating a pseudo-candidate set for each target sample, consisting of potential true labels based on the UDA model's predictions. Subsequently, inspired by [25], we propose a disambiguation process which is applied to these pseudo-candidate sets. Additionally, our method extends supervision beyond the pseudo-candidate set, penalizing predictions that stray into other classes. As illustrated in Fig. 1, the proposed UDPCS method effectively refines the UDA model's predictions by resolving ambiguity. It achieves this by identifying the potentially correct label and increasing its confidence. The efficacy of UDPCS is demonstrated through extensive experiments on various benchmark UDA datasets, showcasing its potential to enhance target accuracy in UDA models.", + "bbox": [ + 212, + 441, + 787, + 790 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The following are the main contributions of this work:(i) We introduce the concept of a pseudo-candidate set, which is generated from the predictions of the UDA model. To the best of our knowledge, this work is the first to use the idea", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "of pseudo-candidate set in the UDA setting; (ii) We propose a novel refinement technique for UDA, UDPCS, by leveraging the identified pseudo-candidate sets; and (iii) We study the proposed method by conducting extensive experiments on multiple UDA benchmark datasets, observing consistent performance gains across various datasets and UDA methods.", + "bbox": [ + 212, + 146, + 787, + 220 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/31926731aa098e734b1ece635bb48147c90007b8817abe675d770b478265d9d5.jpg", + "image_caption": [ + "Fig. 1: Comparison of predictions between the trained UDA model (MDD [50]) and the proposed UDPCS method after refining the trained UDA model on the VisDA dataset for five target samples." + ], + "image_footnote": [], + "bbox": [ + 217, + 244, + 784, + 483 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 595, + 387, + 612 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "This section discusses the earlier literature that was proposed specifically related to UDA and the disambiguation process inspired by partial-label learning.", + "bbox": [ + 212, + 628, + 785, + 657 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "UDA aims to perform well on the unlabeled target domain by leveraging the labeled source data. Inspired by the theoretical analysis [1], learning domain-invariant features has emerged as a pivotal approach. This concept has given rise to one of the most prevalent methodologies for addressing UDA challenges: adversarial methods. Inspired by GAN, the key principle behind adversarial methods is to minimize the domain shift through a minimax optimization strategy. [11] introduced DANN, a pioneering work that employs a deep learning-based adversarial approach for UDA using a generator and a domain discriminator. Bi-classifier approaches, as proposed by [36] and [20], propose an adversarial approach involving a single feature extractor and two classifiers. [50] introduced a novel disparity discrepancy method, Margin Disparity Discrepancy (MDD), to learn domain invariant features. Various other adversarial methods", + "bbox": [ + 212, + 659, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 674, + 113, + 730, + 126 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "include [9,12,14,23,35,44,45]. Another significant avenue in UDA is self-training, where the model iteratively enhances its predictions to perform effectively on the target domain. Minimum Class Confusion (MCC), as proposed by [15], introduces a novel loss function that minimizes class confusion, leading to improved transfer gains. Additionally, Cycle Self-Training (CST), presented in [22], advocates for a cyclic self-training approach that refines target pseudo-labels in two steps and by leveraging Tsallis entropy as a regularizer. Various other methodologies in this category include [5, 26, 38]. Beyond these techniques, alternative methods such as optimal transport [18, 28, 32], moment matching [2, 21], and self-supervised techniques [4, 48], have been proposed to address UDA challenges. Notably, recent years have witnessed the emergence of several hybrid approaches, which typically amalgamate different categories of techniques [3, 24, 27, 33, 43, 51]. In this work, we introduce a novel perspective for tackling the UDA problem by analyzing the predictions of any trained UDA model on the target domain. Our proposed method is designed to iteratively refine the UDA model's prediction on the target domain.", + "bbox": [ + 212, + 145, + 787, + 387 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Disambiguation is a key aspect of partial label learning (PLL). The PRODEN method [25] is a pivotal work in PLL that employs an iterative strategy for refining candidate sets, directly targeting label disambiguation. Following PRODEN, recent advancements have continued to refine the disambiguation process in PLL. LWC [46] introduces a weighted loss function that prioritizes probable labels within candidate sets, enhancing the disambiguation process. CR [47] introduces consistency regularization in PLL for disambiguating the labels. These developments highlight the importance of refining disambiguation processes for accurate learning outcomes. In this work, inspired from [25], we introduce the concept of pseudo-candidate set and propose a disambiguation process on these pseudo-candidate sets. Unlike [49], which introduces a hybrid setting between UDA and PLL, our work focuses on leveraging the concepts from PLL to refine the predictions on the target domain in UDA.", + "bbox": [ + 212, + 388, + 787, + 585 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 UDPCS: Methodology", + "text_level": 1, + "bbox": [ + 215, + 608, + 470, + 627 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Preliminaries. This section describes the basic assumptions and notations for classification problems in UDA. In a typical UDA framework, three key components are involved: a feature extractor $(\\mathcal{G})$ , a classifier $(f)$ , and a domain adaptive component. The source and target domains are denoted by $\\mathcal{D}_S$ and $\\mathcal{D}_T$ , respectively. The term $\\mathcal{D}$ refers to any of these domains when the index is irrelevant. Throughout this work, the terms 'domain' and 'distribution' are used interchangeably. Each such domain $\\mathcal{D} \\subseteq \\mathcal{X} \\times \\mathcal{Y}$ , where $\\mathcal{X}$ is an input space and $\\mathcal{Y}$ is the output (label) space, which is $\\{0,1\\}$ in binary classification and $\\{1,\\dots,k\\}$ in multi-class classification. The term $\\hat{D}$ is used to denote a set of samples drawn independently from $\\mathcal{D}$ , i.e. $\\hat{D} = \\{(x_i,y_i)\\}_{i=1}^n$ where $x_i \\in \\mathcal{X}$ and $y_i \\in \\mathcal{Y}$ , $\\forall i \\in \\{1,2,\\ldots,n\\}$ . We use $(x,y)$ to refer to a sample $(x_i,y_i)$ when the index is irrelevant. We define the model, $h(x) = f(\\mathcal{G}(x))$ , where $h: \\mathcal{X} \\to \\mathbb{R}^k$ , with each dimension of the output representing the class", + "bbox": [ + 212, + 641, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "probability for each class. We also use $Z$ to refer to the pseudo-candidate set where $Z \\subset \\mathcal{Y}$ .", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Methodology. We now present the methodology of our proposed approach, UDPCS, designed to enhance the accuracy of the target domain by leveraging pseudo-candidate sets. In the standard UDA setting, we assume that the training data consists of a labeled source domain, $\\mathcal{D}_S$ , and an unlabeled target domain, $\\mathcal{D}_T$ . The primary objective of a UDA method is to perform well on unlabeled target data. This is generally accomplished by employing a classification loss and an adaptation loss that minimizes the discrepancy between the source and target features. Over time, various adaptation loss functions have been proposed, depending on the specific UDA method employed [15,43,50]. Our proposed UDPCS method builds upon these standard techniques to further improve UDA performance with minimal overhead. We now describe our methodology and then illustrate it with a toy example.", + "bbox": [ + 212, + 176, + 787, + 356 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In order to serve as a refinement strategy over any UDA method, we first train the UDPCS model $h(.)$ using any off-the-shelf UDA algorithm. Once the UDA training is complete, we employ the trained model $h(.)$ to generate a pseudocandidate set for target data, as below.", + "bbox": [ + 212, + 357, + 787, + 417 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nZ = \\{j | h _ {j} (x) > \\tau , \\forall j \\in \\{1, \\dots , k \\} \\}, \\tau > 0 \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 352, + 428, + 785, + 445 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "For each input $x$ , $Z$ represents the pseudo-candidate set consisting of class indices $j$ for which the corresponding class prediction probability, $h_j(x)$ , exceeds a predefined threshold $\\tau$ . This approach allows us to include only those classes in the pseudo-candidate set that have a relatively higher likelihood of being the true label, as indicated by the model $h(.)$ . We further define a non-candidate set as the complement of the pseudo-candidate set, i.e., all class indices not in $Z$ .", + "bbox": [ + 212, + 452, + 787, + 542 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Subsequently, for the refinement of the model's predictions in the target domain, our method is trained by utilizing an objective that consists of two loss functions: candidate loss $L_{c}$ and non-candidate loss $L_{nc}$ . These loss functions are each described below.", + "bbox": [ + 212, + 542, + 787, + 602 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Candidate Loss. This loss guides the model $h(\\cdot)$ to align its predictions with the pseudo-candidate set. We introduce a label confidence vector $\\boldsymbol{w} \\in \\mathbb{R}^k$ , representing the confidence for all $k$ classes. Each element $w_j$ in this vector signifies the confidence assigned to class $j$ . We ensure that $\\sum_{j \\in Z} w_j = 1$ and $w_j = 0 \\forall j \\notin Z$ , meaning that the confidence values $w_j$ are assigned only to classes present in the pseudo-candidate set, and set to 0 otherwise. Consequently, $\\boldsymbol{w}$ serves as a distribution over the classes in the pseudo-candidate set. The candidate loss applied to the pseudo-candidate set is then defined as:", + "bbox": [ + 212, + 603, + 787, + 724 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nL _ {c} = \\left\\{ \\begin{array}{l l} K L (\\boldsymbol {w} | | h (\\mathcal {A} _ {1} (x)) & \\text {i f} \\max (h (\\mathcal {A} _ {1} (x))) < \\gamma \\\\ 0 & \\text {o t h e r w i s e} \\end{array} , \\gamma < 1 \\right. \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 294, + 733, + 785, + 772 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The candidate loss is applied to samples for which the model's maximum predicted class probability falls below a certain threshold $\\gamma$ . Rather than using the raw input $x$ , we utilize a strongly augmented version, $\\mathcal{A}_1(x)$ , as the input. Inspired by FixMatch [39], for strong augmentations, we leverage Cutout [8] and", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 674, + 113, + 730, + 127 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "RandAugment [7], which produce heavily distorted versions of the given input $x$ . The rationale behind employing strong augmentation and thresholding is to differentiate between samples based on the model's predictions. For samples where the model's prediction is just above the threshold $\\gamma$ , the strong augmentation is likely to lower the prediction values, thereby including these samples in the candidate loss $L_{c}$ . Conversely, for samples where the model's predictions are very high, even after strong augmentation, the predictions remain robust and above the threshold. Consequently, these samples are excluded from the candidate loss, ensuring that the loss is primarily applied to samples where the model's predictions are less certain. This loss is calculated as the Kullback-Leibler (KL) divergence between the label confidence vector $\\mathbf{w}$ and the model's predictions $h(\\mathcal{A}_1(x))$ . Thus, in this way, the candidate loss aligns the pseudo-candidate set distribution and the model's prediction distribution.", + "bbox": [ + 212, + 146, + 787, + 343 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Non-Candidate Loss. This loss is applied to the elements outside the pseudocandidate set as:", + "bbox": [ + 212, + 345, + 789, + 375 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nL _ {n c} = - \\sum_ {j \\notin Z} \\log \\left(1 - h _ {j} \\left(\\mathcal {A} _ {2} (x)\\right)\\right) \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 388, + 380, + 785, + 412 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The motivation for the non-candidate loss is that it penalizes the model for assigning high probabilities to classes that are not in the pseudo-candidate set $Z$ . It is computed as the negative log-likelihood of the complement probabilities for classes outside $Z$ , using the model's predictions $h(\\mathcal{A}_2(x))$ after applying a weak augmentation $\\mathcal{A}_2$ to the input $x$ . We use a standard flip-and-shift augmentation as our weak $\\mathcal{A}_2$ . This loss discourages the model from considering classes outside the pseudo-candidate set as potential true labels.", + "bbox": [ + 212, + 426, + 787, + 531 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Overall Objective. The overall objective function of the proposed UDPCS model is the sum of the candidate and non-candidate loss terms:", + "bbox": [ + 212, + 534, + 787, + 565 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nL o s s = L _ {c} + \\lambda L _ {n c} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 436, + 583, + 785, + 598 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\lambda$ is a hyperparameter that balances the contributions of the two loss functions.", + "bbox": [ + 212, + 614, + 785, + 643 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Updating $\\boldsymbol{w}$ . As in Eqn. (2), the vector $\\boldsymbol{w}$ plays a crucial role in guiding the model's predictions. Therefore, updating $\\boldsymbol{w}$ after each iteration is essential for disambiguation of the pseudo-candidate set. We set the label confidence $\\boldsymbol{w}$ initially to $\\frac{1}{|Z|}$ if the class $j$ is in the pseudo-candidate set $Z$ , where $|Z|$ denotes the cardinality of $Z$ . This ensures that each class in the pseudo-candidate set receives an equal initial confidence value. The rationale for assigning an equal initial confidence value to each class in the pseudo-candidate set is to enable the proposed UDPCS method to disambiguate the correct class from a set of classes without bias. This scheme is given below:", + "bbox": [ + 212, + 647, + 787, + 785 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nw _ {j} = \\left\\{ \\begin{array}{l l} \\frac {1}{| Z |} & \\text {i f} j \\in Z \\\\ 0 & \\text {o t h e r w i s e} \\end{array} , \\boldsymbol {w} \\in \\mathbb {R} ^ {k} \\right. \\text {a n d} \\sum_ {j \\in Z} w _ {k} = 1 \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 320, + 801, + 785, + 844 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 5 + }, + { + "type": "code", + "sub_type": "algorithm", + "code_caption": [ + "Algorithm 1 Unsupervised Domain Adaptation refinement using pseudo-candidate sets (UDPCS)" + ], + "code_body": "1: Input: Source domain data $D_S = \\{x_i^S, y_i^S\\}_{i=1}^{n_S}$ , target domain data $D_T = \\{x_j^T\\}_{j=1}^{n_T}$ , learning rate $\\eta$ , number of iterations $T$ , refinement iterations $T_{\\mathrm{refine}}$ , strong augmentation $\\mathcal{A}_1$ , weak augmentation $\\mathcal{A}_2$ . \n2: Output: Refined model $h$ \n3: Initialize model $h$ with random weights \n4: for $t = 1$ to $T$ do \n5: $(x^S, y^S) \\sim D_S$ and $(x^T) \\sim D_T$ \n6: Update the parameters of $h$ utilizing $(x^S, y^S)$ and $(x^T)$ in accordance with any standard unsupervised domain adaptation technique. \n7: end for \n8: Generate the pseudo-candidate set 'Z' for each sample in $D_T$ using Eqn. (1) \n9: Initialize the label confidence vector 'w' using Eqn. (5) \n10: for $t = 1$ to $T_{\\mathrm{refine}}$ do \n11: $(x^T) \\sim D_T$ , with augmentations $\\mathcal{A}_1(x^T)$ and $\\mathcal{A}_2(x^T)$ \n12: Compute the candidate loss $L_c$ using Eqn. (2) \n13: Compute the non-candidate loss $L_{nc}$ using Eqn. (3) \n14:Compute the final loss, $Loss = L_c + \\lambda L_{nc}$ \n15: Update the label confidence vector using Eqn. (6) \n16:Update model $h$ using gradient descent: $h \\gets h - \\eta \\nabla Loss$ \n17: end for \n18: return $h$", + "bbox": [ + 218, + 178, + 787, + 401 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "After each iteration, the vector $\\pmb{w}$ is dynamically updated based on the model's predictions $h(\\mathcal{A}_1(x))$ , as below:", + "bbox": [ + 215, + 431, + 784, + 462 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nw _ {j} = \\left\\{ \\begin{array}{l l} \\frac {h _ {j} \\left(\\mathcal {A} _ {1} (x)\\right)}{\\sum_ {m \\in Z} h _ {m} \\left(\\mathcal {A} _ {1} (x)\\right)} & \\text {i f} j \\in Z \\\\ 0 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 476, + 784, + 518 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As in Eqn. (6), the confidence $w_{j}$ for each class $j$ in the pseudo-candidate set $Z$ is updated to be proportional to the model's prediction probability for that class, normalized by the sum of prediction probabilities for all classes in $Z$ . This update ensures that $w_{j}$ reflects the model's current confidence in each class within the pseudo-candidate set, facilitating the disambiguation process.", + "bbox": [ + 212, + 534, + 784, + 609 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Therefore, by iteratively updating the model $h(.)$ using the aforementioned components, the proposed UDPCS improves the model's ability to disambiguate the correct class from the pseudo-candidate set, leading to more accurate and confident predictions on the target domain. Our overall method is summarized in Algorithm 1. We begin by training the proposed model $h(.)$ using a standard UDA technique. We then generate the pseudo-candidate set and initialize the label confidence vector. Subsequently, the method undergoes iterative training, incorporating both candidate and non-candidate loss in each iteration. We now illustrate our approach using a toy example.", + "bbox": [ + 212, + 611, + 785, + 747 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Toy Example. To illustrate the working of our method, the toy example in Fig. 2 shows how the proposed UDPCS technique refines a model's predictions. In particular, we demonstrate a single iteration after UDA training. As shown in the figure, we consider a 5-class classification problem with labeled source data, unlabeled target data consisting of 5 samples from $S1$ to $S5$ and a model $h_{UDA}(.)$ trained using any off-the-shelf UDA technique. The unseen true labels", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 674, + 113, + 730, + 126 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 125 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/796389c81a9d420af10b924cea25d3dc882f9e13c658a4cd29ee1c2c81dcd2a8.jpg", + "image_caption": [ + "Fig. 2: Illustration of the toy example for demonstrating our UDPCS method. The figure visualizes the process of refining the predictions of a base UDA model by leveraging pseudo-candidate sets." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 784, + 318 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "for these 5 target samples are assigned such that sample $j$ is labeled as class $j$ , $\\forall j \\in \\{1,2,\\ldots,5\\}$ .", + "bbox": [ + 212, + 424, + 787, + 458 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As mentioned earlier in this section, after UDA training, our UDPCS method generates the pseudo-candidate set $Z$ using model predictions $h_{UDA(\\cdot)}$ and with $\\tau = 0.1$ , according to Eqn. (1), for each target sample. The cardinality of these pseudo-candidate sets for this example ranges from 2 to 4 in Fig. 2. These sets are then utilized to generate the label confidence vector $\\pmb{w}$ , which, as previously discussed, is initialized with uniform confidence values according to Eqn. (5) (to avoid error bias from the base model). This $\\pmb{w}$ , along with the pseudo-candidate sets, is then used to refine the model's prediction by updating its parameters using Eqn. (4). In the next iteration, 'Step = 1' in the figure, this refined model generates predictions on the target set, which is then used to get the disambiguated vector $\\pmb{w}$ according to Eqn. (6).", + "bbox": [ + 212, + 465, + 789, + 633 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As in the figure, the refined model's predictions for each sample definitively impacts model accuracy. After initial UDA model training, the model correctly predicted $S1$ , $S2$ , and $S3$ , but incorrectly predicted $S4$ and $S5$ , resulting in $60\\%$ accuracy. Whereas after the refinement, $S4$ is correctly disambiguated, while the confidence in predictions for $S1$ , $S2$ , and $S3$ has increased. For sample $S5$ , the disambiguation could not identify the correct label in the first iteration. These changes in predictions increased the model's accuracy from $60\\%$ to $80\\%$ . It is also noticeable that the prediction probabilities of classes outside the candidate set have reduced, which can be attributed to the non-candidate set loss. Thus, the proposed method improves UDA performance by refining the model's predictions. We show later in our experiments that with this little overhead, we outperform the base UDA model across different baselines, even when the baseline is allowed the same additional training time.", + "bbox": [ + 212, + 643, + 789, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 143, + 375, + 162 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets: We conduct a comprehensive evaluation of our proposed UDPCS method on several benchmark UDA datasets, including VisDA [31], DomainNet [30], and OfficeHome [42]. Each dataset poses unique challenges for domain adaptation. The VisDA dataset, for instance, exhibits a significant domain gap between the source and target domains, encompassing 12 classes. The DomainNet dataset, on the other hand, offers a broader label space with 365 classes, presenting a different set of challenges. Lastly, the OfficeHome dataset, with its relatively limited number of samples across all domains, necessitates efficient adaptation strategies. Further details about these datasets are provided in the Appendix.", + "bbox": [ + 212, + 175, + 787, + 325 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation Details and Baselines: Consistent with recent benchmarks [24, 51], we employ the ResNet50 model as the feature extractor for the Office-Home dataset and the ResNet101 model for the VisDA and DomainNet datasets. Our method is trained using stochastic gradient descent with momentum [34]. Additional implementation details, such as hyperparameters including threshold values, learning rates, etc., are detailed in the Appendix. Our UDPCS method enhances off-the-shelf UDA techniques; hence, we evaluate its effectiveness against a range of UDA methods such as MDD [50], MCC [15], LeCo [43], SDAT [35], and NWD [3], which encompass diverse approaches like adversarial and self-training. We benchmark our model by comparing the performance of these UDA methods with and without the application of our UDPCS technique. Additionally, we contrast our method with other recent benchmarks in Appendix A1. In our result tables, (Tab. 1 to Tab. 3), the performance of our UDPCS method is denoted as 'UDA method+Ours,' where 'UDA method' indicates the base method upon which UDPCS is applied.", + "bbox": [ + 212, + 327, + 787, + 551 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Results on VisDA: The VisDA dataset presents a single adaptation scenario, from synthetic (source) to real-world (target) domains. Class-wise target accuracy results on the VisDA dataset are detailed in Tab. 1. As seen in Tab. 1, the UDPCS method enhances mean accuracy across five different UDA methods. Notably, the maximum improvement, a $2.4\\%$ gain, is observed when UDPCS is applied to both the MCC and NWD models. The VisDA dataset is known for its large domain gap between the source and target domains. Despite this challenge, UDPCS achieves an average gain of $2\\%$ in target accuracy, as demonstrated in Tab. 1, highlighting its efficacy in refining model predictions.", + "bbox": [ + 212, + 553, + 787, + 686 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Results on DomainNet: In line with the settings from [13, 43], we carry out experiments on 12 tasks involving clipart (c), painting (p), real (r), and sketch (s) domains from the original DomainNet dataset. The detailed results for all tasks are showcased in Tab. 2. As indicated in Tab. 2, the UDPCS method surpasses the performance of each underlying UDA method, with a maximum gain of $3.5\\%$ in average target accuracy. As seen from Tab. 2, our method, 'MDD+Ours,' achieves the best performance compared to all the other methods. Despite DomainNet's challenge of a vast label space with 365 classes, the UDPCS method achieves an average gain of $1.6\\%$ in target accuracy, showcasing the robustness and effectiveness of our approach.", + "bbox": [ + 212, + 688, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 676, + 113, + 730, + 127 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/d3e4d948508c6ffd3caee0e80c92b99d1ff9666575164a93a72245bba23ee6be.jpg", + "table_caption": [ + "Table 1: Accuracy(%) on VisDA dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. Mean denotes Mean Accuracy. Appendix A1 presents additional results." + ], + "table_footnote": [], + "table_body": "
ModelplanebcyblbuscarhorseknifemcyclepersnplantsktbtraintruckMeanGains
MDD(ICML'19)94.675.068.570.291.494.391.579.791.688.484.336.880.5
+Ours96.176.869.372.493.396.592.580.592.689.786.838.682.11.6
MCC(ECCV'20)94.585.974.571.693.994.985.982.391.491.782.457.483.8
+Ours96.288.477.673.795.197.789.583.794.593.485.259.186.22.4
LeCo(ACCV'22)96.187.585.889.695.696.290.882.794.491.184.441.986.3
+Ours97.588.685.589.997.397.193.384.896.493.787.245.288.01.7
SDAT(ICML'22)94.682.977.067.493.697.192.482.692.887.085.652.283.8
+Ours95.684.679.376.094.998.192.783.994.490.688.148.785.61.8
NWD (CVPR'22)93.983.976.673.293.191.085.780.991.890.082.051.282.8
+Ours96.087.478.677.294.593.889.183.293.894.383.651.585.22.4
Average Gains2
", + "bbox": [ + 215, + 200, + 787, + 361 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/6f086c3a96cfcb2840bc172b7f60714ad329af973fbe7d6769ad43be75ace803.jpg", + "table_caption": [ + "Table 2: Accuracy(%) on DomainNet dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results." + ], + "table_footnote": [], + "table_body": "
Modelc-pc-rc-sp-cp-rp-sr-cr-pr-ss-cs-ps-rAvg.Gains
CDAN (NeurIPS'18)40.456.846.145.158.440.555.653.643.057.246.455.749.9
+Ours43.759.147.745.959.24258.253.745.75948.257.851.71.8
MDD (ICML'19)42.859.248.349.259.643.658.854.146.659.146.757.852.2
+Ours46.763.551.451.162.346.363.157.750.763.450.361.955.73.5
MCC (ECCV'20)37.155.641.445.559.939.754.353.136.858.246.556.148.7
+Ours39.156.643.047.260.641.156.455.038.859.147.057.750.11.4
SDAT (ICML'22)41.957.247.247.860.242.356.553.942.760.448.057.551.3
+Ours43.758.147.948.159.443.056.053.143.858.747.657.751.40.1
Average Gains1.7
", + "bbox": [ + 215, + 430, + 787, + 580 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results on OfficeHome: The OfficeHome dataset encompasses 12 tasks across the Art (A), Clipart (C), Product (P), and Real World (R) domains. Target accuracy results for all tasks are presented in Tab. 3. As evident in Tab. 3, the UDPCS method surpasses the performance of the underlying UDA methods, with a maximum gain of $1.8\\%$ in average target accuracy. As seen from Tab. 3, our methods, 'MCC+Ours' and 'NWD+Ours,' achieves the best performance compared to all the other methods. Although OfficeHome presents a challenge with its relatively small sample size per domain, the UDPCS technique still manages to achieve an average gain of $0.9\\%$ , demonstrating its effectiveness.", + "bbox": [ + 212, + 607, + 787, + 743 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5 More Empirical Analysis and Ablation Studies", + "text_level": 1, + "bbox": [ + 212, + 763, + 705, + 782 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ablation Studies: To assess the impact of various components of the proposed UDPCS method, we conduct ablation studies and present the results in Tab. 4. The table outlines experiments on three key components: candidate loss $(L_{c})$", + "bbox": [ + 212, + 794, + 787, + 842 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/e91c96d9e8bb9bc65eff2c09862666bee2b6d3f8d899a23c3e458ae13c4c07d9.jpg", + "table_caption": [ + "Table 3: Accuracy(%) on OfficeHome dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results." + ], + "table_footnote": [], + "table_body": "
ModelA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.Gains
MDD (ICML'19)75.556.27963.172.572.663.155.179.773.360.183.669.5-
+Ours77.657.880.565.475.175.465.156.581.674.161.384.771.31.8
MCC(ECCV'20)79.858.183.268.676.678.667.855.582.274.460.885.872.6
+ Ours81.159.384.169.27879.669.156.482.874.762.186.473.61
Leco (ACCV'22)78.758.382.468.679.179.367.556.282.67560.98672.9
+Ours79.159.282.768.879.479.367.756.982.675.261.186.473.20.3
SDAT(ICML'22)77.258.981.266.675.876.863.95781.875.164.885.872.1
+Ours78.159.782.16776.37764.457.682.675.265.28672.60.5
NWD(CVPR'22)80.158.183.467.977.278.667.955.78274.160.785.772.6-
+Ours80.959.183.968.6798068.556.783.274.962.186.773.61
Average Gains0.9
", + "bbox": [ + 215, + 200, + 787, + 383 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "non-candidate loss $(L_{nc})$ , and a threshold $(\\gamma)$ , with a tick mark indicating the inclusion of a component in a particular experiment. The absence of all ticks denotes the use of the base UDA method without our refinement. We evaluate two base UDA methods, MDD and MCC, on the OfficeHome dataset, as detailed in Tab. 4. For the MDD+Ours model, introducing candidate loss $(L_{c})$ yields a $1.2\\%$ increase in average accuracy, while adding non-candidate loss $(L_{nc})$ brings a similar enhancement of $1.1\\%$ . The inclusion of thresholding $(\\gamma)$ , particularly with candidate loss, leads to a $1.6\\%$ improvement, emphasizing the value of focusing on ambiguous samples. The combination of both losses, without the threshold, results in a $1.4\\%$ uptick, and the full UDPCS model, integrating all components, achieves the highest gain of $1.8\\%$ over the base MDD model. In the MCC+Ours model, the addition of candidate loss and non-candidate loss individually contributes to improvements of $0.4\\%$ and $0.7\\%$ , respectively. The integration of thresholding, either alone or with other components, consistently enhances performance, with the full UDPCS model outperforming the base MCC model by $1\\%$ . These findings highlight the synergistic effect of combining candidate loss, non-candidate loss, and thresholding, underscoring the comprehensive effectiveness of the UDPCS method in boosting average accuracy.", + "bbox": [ + 212, + 412, + 787, + 685 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Complexity Analysis: The complexity analysis of the UDPCS method, as presented in Table A1 in the Appendix, illustrates its efficiency in terms of training time while achieving improvements in average accuracy. The UDPCS method achieves higher average accuracy without incurring any significant training time. Please see the Appendix for the complete discussion.", + "bbox": [ + 212, + 686, + 787, + 762 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Hyperparameter $\\lambda$ : The exploration of the hyperparameter $\\lambda$ , which balances the candidate loss $(L_{c})$ and the non-candidate loss $(L_{nc})$ in the total loss equation $(L_{c} + \\lambda L_{nc})$ , reveals its impact on the performance of the UDPCS method, as shown in Table 5. We run each of the experiment three times to report the average values. For the MDD+Ours model, setting $\\lambda = 0.5$ results in an aver", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 674, + 113, + 730, + 126 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/5a70c5d36c7788ab481ac49ed07949b981ddeea1d305100dced7c00e9fa11e5a.jpg", + "table_caption": [ + "Table 4: Ablation results (%) on OfficeHome dataset assessing the impact of UDPCS components." + ], + "table_footnote": [], + "table_body": "
Model\\(L_c\\)\\(L_{nc}\\)γA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours75.556.27963.172.572.663.155.179.773.360.183.669.5
✓76.95880.264.874.774.863.655.980.973.561.18470.7
✓76.857.379.765.474.575.164.555.780.273.460.583.970.6
✓✓77.458.180.664.475.274.66556.581.473.861.384.471.1
✓✓77.157.680.564.574.875.164.556.481.2746184.370.9
✓✓✓77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours79.858.183.268.676.678.667.855.582.274.460.885.872.6
✓80.45983.869.177.378.76856.58274.261.485.973
✓80.358.88469.277.279.768.555.882.975.161.586.273.3
✓✓80.758.783.56977.178.468.656.782.374.6628673.1
✓✓80.458.88468.877.578.96856.282.974.161.58673.1
✓✓✓81.159.384.169.27879.669.156.482.874.762.186.473.6
", + "bbox": [ + 215, + 185, + 787, + 359 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "age accuracy of $71.1\\%$ , which slightly improves to $71.2\\%$ when $\\lambda = 1$ . Further increasing $\\lambda$ to 2 maintains the average accuracy of $71.2\\%$ , suggesting a robust performance across different values of $\\lambda$ . Similarly, for the MCC+Ours model, the average accuracy is $73.6\\%$ for all the $\\lambda$ values with slight variations in the standard deviation values. These findings indicate that the UDPCS method is relatively stable across a range of $\\lambda$ values, with minor fluctuations in average accuracy. This stability underscores the method's robustness and the effectiveness of the balanced approach to handling candidate and non-candidate losses in refining predictions for domain adaptation tasks. Please see the Appendix for the complete results of this analysis.", + "bbox": [ + 212, + 386, + 787, + 539 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/d0b30ffe7322da405ecc77b5ea8d813c98dc75a325df16928a8b26c574d514bc.jpg", + "table_caption": [ + "Table 5: Accuracy(%) of UDPCS for different $\\lambda$ values on OfficeHome dataset." + ], + "table_footnote": [], + "table_body": "
λA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
λ = 0.577.258.280.664.875.374.965.156.581.073.961.484.571.1 ±0.1
λ = 177.558.080.665.375.275.165.056.581.674.161.484.571.2±0.02
λ = 277.357.980.865.175.075.365.156.681.574.061.384.471.2±0.01
MCC+Ours
λ = 0.580.959.183.869.677.879.668.956.683.274.862.186.673.6±0.05
λ = 181.059.184.369.377.979.668.956.683.274.762.086.573.6±0.06
λ = 280.959.284.269.278.079.668.956.782.974.862.486.673.6±0.1
", + "bbox": [ + 272, + 590, + 732, + 720 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Weak Augmentation: The exploration of weak augmentation $\\mathcal{A}_2$ in the candidate set loss for the UDPCS method, as compared to the main results obtained using strong augmentation $\\mathcal{A}_1$ , reveals interesting insights into the method's performance, as shown in Table 6. For the MDD+Ours model, employing weak augmentation results in an average accuracy of $69.6\\%$ , which is lower than the $71.3\\%$ achieved with strong augmentation. Similarly, the MCC+Ours model ex", + "bbox": [ + 212, + 748, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "hibits a decrease in average accuracy from $73.6\\%$ with strong augmentation to $72.8\\%$ with weak augmentation. These findings suggest that strong augmentation plays a crucial role in the effectiveness of the UDPCS method, particularly in refining predictions for domain adaptation tasks. Further augmentation related experiments are reported in the Appendix.", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/cc4873c1a5e4f20b5876b0741c39c0a86d4f565d31a598153bd82cbdb6f53cab.jpg", + "table_caption": [ + "Table 6: Accuracy(%) of UDPCS for different augmentation used on OfficeHome dataset. (Aug. = Augmentation)" + ], + "table_footnote": [], + "table_body": "
Aug.A-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
Weak76.356.47963.373.573.663.154.779.37359.783.169.6
Strong77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
Weak79.958.283.269.176.878.567.656.781.974.161.28672.8
Strong81.159.384.169.27879.669.156.482.874.762.186.473.6
", + "bbox": [ + 272, + 287, + 730, + 404 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Threshold $\\gamma$ : The examination of different threshold values $(\\gamma)$ used in the candidate loss, Eqn. (2), of the UDPCS method provides insights into the method's sensitivity to this hyperparameter, as shown in Table 7. For the MDD+Ours model, the average accuracy remains consistent at $71.1\\%$ for both $\\gamma = 0.8$ and $\\gamma = 0.9$ , with a slight increase to $71.3\\%$ when $\\gamma = 0.85$ . Similarly, for the MCC+Ours model, the average accuracy is stable at $73.5\\%$ for $\\gamma = 0.8$ and $\\gamma = 0.9$ , with a marginal increase to $73.6\\%$ at $\\gamma = 0.85$ . The slight variations in average accuracy suggest that while the choice of threshold can influence the method's performance, the UDPCS method is not overly sensitive to this hyperparameter.", + "bbox": [ + 212, + 430, + 787, + 582 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/fc12654099c38c9285c0eb065d5bb9a737938be488bd1da217c01b923c28149f.jpg", + "table_caption": [ + "Table 7: Accuracy(%) of UDPCS for different threshold ( $\\gamma$ ) values on OfficeHome dataset." + ], + "table_footnote": [], + "table_body": "
A-P A-C A-R C-A C-P C-R P-A P-C P-R R-A R-C R-P Avg.
MDD+ours
γ = 0.877.158.580.864.975.174.964.756.581.673.861.3
γ = 0.8577.657.880.565.475.175.465.156.581.674.161.3
γ = 0.977.358.181.164.9757564.556.681.47461.1
MCC+Ours
γ = 0.881.159.383.669.27879.669.156.482.874.761.9
γ = 0.8581.159.384.169.27879.669.156.482.874.762.1
γ = 0.980.759.383.869.477.579.368.956.582.974.762.4
", + "bbox": [ + 272, + 647, + 730, + 782 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Cross entropy: The investigation of using cross entropy as an alternative to KL divergence for the candidate loss, Eqn.(2) in the UDPCS method reveals", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 674, + 113, + 730, + 126 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "the method's adaptability and effectiveness across different loss functions, as demonstrated in Table 8. For the MDD+Ours model, employing cross entropy for the candidate loss yields an average accuracy of $71.3\\%$ , which is identical to the average accuracy achieved using KL divergence. Similarly, the MCC+Ours model maintains an average accuracy of $73.6\\%$ with both cross entropy and KL divergence. The consistency in average accuracy across different loss functions suggests that the method's ability to refine predictions for domain adaptation tasks is robust to the choice of loss function.", + "bbox": [ + 212, + 146, + 787, + 268 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/324146ac1c047d95fb0be3c9a4278dfcb6457bd420f69a99d762be16c46de77f.jpg", + "table_caption": [ + "Table 8: Accuracy(%) of UDPCS for different loss functions on OfficeHome dataset. (CE= Cross Entropy, KL=KL Divergence)" + ], + "table_footnote": [], + "table_body": "
LossA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
CE77.458.180.764.975.275.365.356.381.573.961.784.871.3
KL77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
CE81.159.384.169.27879.669.156.482.874.762.186.473.6
KL80.859.284.569.477.979.768.456.583.275.162.186.473.6
", + "bbox": [ + 287, + 330, + 718, + 445 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 214, + 497, + 359, + 513 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In conclusion, UDPCS presents a novel approach to UDA by leveraging the concept of disambiguation and introducing pseudo-candidate sets to approximate the true labels of the target set. Our method is distinguished by the use of two loss functions to refine predictions within the pseudo-candidate set and to penalize incorrect labels outside of it, combined with a threshold-based strategy to focus on ambiguous samples. Through comprehensive experiments on the benchmark datasets, our approach has demonstrated its effectiveness in consistently improving target set accuracy across diverse domains. We also conduct thorough analysis and ablation studies. The results highlight the potential of our method to serve as a robust solution for UDA challenges.", + "bbox": [ + 212, + 527, + 787, + 681 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 702, + 403, + 720 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The research of AD is supported in part by the Prime Minister Research Fellowship, Ministry of Education, Government of India. VNB would like to acknowledge the support through the Govt of India SERB IMPRINT and DST ICPS funding programs for this work. The research of CKM is supported by the LiDAR and Camera Sensors Data based Deep Learning Algorithms for Autonomous Driving System project, funded by Govt. of India SERB program. The research is also partly supported by the Indo-Norwegian Collaboration in", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Autonomous Cyber-Physical Systems (INCAPS) project: 287918 of the International Partnerships for Excellent Education, Research and Innovation (INTPART) program and the Low-Altitude UAV Communication and Tracking (LUCAT) project: 280835 of the IKTPLUSS program from the Research Council of Norway. We are grateful to the anonymous reviewers for the feedback that helped improved the presentation of this paper.", + "bbox": [ + 212, + 146, + 787, + 238 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 258, + 321, + 273 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., Vaughan, J.W.: A theory of learning from different domains. Machine Learning 79(1-2), 151-175 (2010)", + "2. Chen, C., Fu, Z., Chen, Z., Jin, S., Cheng, Z., Jin, X., Hua, X.S.: Homm: Higher-order moment matching for unsupervised domain adaptation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 3422-3429 (2020)", + "3. Chen, L., Chen, H., Wei, Z., Jin, X., Tan, X., Jin, Y., Chen, E.: Reusing the task-specific classifier as a discriminator: Discriminator-free adversarial domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7181-7190 (2022)", + "4. Chen, W., Lin, L., Yang, S., Xie, D., Pu, S., Zhuang, Y.: Self-supervised noisy label learning for source-free unsupervised domain adaptation. In: 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10185-10192. IEEE (2022)", + "5. Chen, Y., Wei, C., Kumar, A., Ma, T.: Self-training avoids using spurious features under domain shift. Advances in Neural Information Processing Systems 33, 21061-21071 (2020)", + "6. Csurka, G.: Domain adaptation for visual applications: A comprehensive survey, pp. 1-35. Springer (2017)", + "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space (2019)", + "8. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout (2017)", + "9. Du, Z., Li, J., Su, H., Zhu, L., Lu, K.: Cross-domain gradient discrepancy minimization for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3937-3946 (2021)", + "10. Feng, L., Lv, J., Han, B., Xu, M., Niu, G., Geng, X., An, B., Sugiyama, M.: Provably consistent partial-label learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 10948-10960. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/7bd28f15a49d5e5848d6ec70e584e625-Paper.pdf", + "11. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32nd International Conference on Machine Learning (ICML) (2015)", + "12. Gao, Z., Zhang, S., Huang, K., Wang, Q., Zhong, C.: Gradient distribution alignment certificates better adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8937-8946 (2021)", + "13. Jiang, J., Chen, B., Fu, B., Long, M.: Transfer-learning-library. https://github.com/thuml/Transfer-Learning-Library (2020)" + ], + "bbox": [ + 218, + 287, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 676, + 114, + 730, + 126 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "14. Jin, X., Lan, C., Zeng, W., Chen, Z.: Re-energizing domain discriminator with sample relabeling for adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9174-9183 (2021)", + "15. Jin, X., Lan, C., Zeng, W., Chen, Z.: Minimum class confusion for versatile domain adaptation. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)", + "16. Jing, X., Qian, K., Jianu, T., Luo, S.: Unsupervised adversarial domain adaptation for sim-to-real transfer of tactile images. IEEE Transactions on Instrumentation and Measurement 72, 1-11 (2023). https://doi.org/10.1109/TIM.2023.3268458", + "17. Kamilaris, A., Prenafeta-Boldú, F.X.: Deep learning in agriculture: A survey. Computers and Electronics in Agriculture 147, 70-90 (2018)", + "18. Le, T., Nguyen, T., Ho, N., Bui, H., Phung, D.: Lamda: Label matching deep domain adaptation. In: International Conference on Machine Learning. pp. 6043-6054. PMLR (2021)", + "19. LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436-444 (2015)", + "20. Lee, C.Y., Batra, T., Baig, M.H., Ulbricht, D.: Sliced wasserstein discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10285-10295 (2019)", + "21. Li, S., Liu, C., Lin, Q., Xie, B., Ding, Z., Huang, G., Tang, J.: Domain conditioned adaptation network. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 11386-11393 (2020)", + "22. Liu, H., Wang, J., Long, M.: Cycle self-training for domain adaptation. Advances in Neural Information Processing Systems 34, 22968-22981 (2021)", + "23. Liu, X., Guo, Z., Li, S., Xing, F., You, J., Kuo, C.C.J., El Fakhri, G., Woo, J.: Adversarial unsupervised domain adaptation with conditional and label shift: Infer, align and iterate. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 10367-10376 (2021)", + "24. Liu, Y., Zhou, Z., Sun, B.: Cot: Unsupervised domain adaptation with clustering and optimal transport. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19998-20007 (2023)", + "25. Lv, J., Xu, M., Feng, L., Niu, G., Geng, X., Sugiyama, M.: Progressive identification of true labels for partial-label learning. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 6500-6510. PMLR (13-18 Jul 2020), https://proceedings.mlr.press/v119/lv20a.html", + "26. Mei, K., Zhu, C., Zou, J., Zhang, S.: Instance adaptive self-training for unsupervised domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXVI 16. pp. 415-430. Springer (2020)", + "27. Na, J., Jung, H., Chang, H.J., Hwang, W.: Fixbi: Bridging domain spaces for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1094-1103 (2021)", + "28. Nguyen, T., Le, T., Dam, N., Tran, Q.H., Nguyen, T., Phung, D.Q.: Tidot: A teacher imitation learning approach for domain adaptation with optimal transport. In: IJCAI. pp. 2862-2868 (2021)", + "29. Patel, V.M., Gopalan, R., Li, R., Chellappa, R.: Visual domain adaptation: A survey of recent advances. IEEE Signal Processing Magazine 32(3), 53-69 (2015)", + "30. Peng, X., Bai, Q., Xia, X., Huang, Z., Saenko, K., Wang, B.: Moment matching for multi-source domain adaptation. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 1406-1415 (2019)" + ], + "bbox": [ + 217, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "31. Peng, X., Usman, B., Kaushik, N., Hoffman, J., Wang, D., Saenko, K.: Visda: The visual domain adaptation challenge (2017)", + "32. Phan, H., Le, T., Phung, T., Bui, A.T., Ho, N., Phung, D.: Global-local regularization via distributional robustness. In: International Conference on Artificial Intelligence and Statistics. pp. 7644-7664. PMLR (2023)", + "33. Prabhu, V., Khare, S., Kartik, D., Hoffman, J.: Sentry: Selective entropy optimization via committee consistency for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8558-8567 (2021)", + "34. Qian, N.: On the momentum term in gradient descent learning algorithms. Neural networks 12(1), 145-151 (1999)", + "35. Rangwani, H., Aithal, S.K., Mishra, M., Jain, A., Radhakrishnan, V.B.: A closer look at smoothness in domain adversarial training. In: International Conference on Machine Learning. pp. 18378-18399. PMLR (2022)", + "36. Saito, K., Watanabe, K., Ushiku, Y., Harada, T.: Maximum classifier discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018)", + "37. Shen, D., Wu, G., Suk, H.I.: Deep learning in medical image analysis. Annual Review of Biomedical Engineering 19, 221-248 (2017)", + "38. Shin, I., Woo, S., Pan, F., Kweon, I.S.: Two-phase pseudo label densification for self-training based domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 532-548. Springer (2020)", + "39. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 596-608. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/06964dce9adbb1c5cb5d6e3d9838f733-Paper.pdf", + "40. Tian, Y., Yu, X., Fu, S.: Partial label learning: Taxonomy, analysis and outlook. Neural Networks 161, 708-734 (2023). https://doi.org/https://doi.org/10.1016/j.neunet.2023.02.019, https://www.sciencedirect.com/science/article/pii/S0893608023000825", + "41. Tzeng, E., Hoffman, J., Saenko, K., Darrell, T.: Adversarial discriminative domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017)", + "42. Venkateswara, H., Eusebio, J., Chakraborty, S., Panchanathan, S.: Deep hashing network for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 5018-5027 (2017)", + "43. Wang, X., Zhuo, J., Zhang, M., Wang, S., Fang, Y.: Revisiting unsupervised domain adaptation models: A smoothness perspective. In: Proceedings of the Asian Conference on Computer Vision. pp. 1504-1521 (2022)", + "44. Wei, G., Lan, C., Zeng, W., Chen, Z.: Metaalign: Coordinating domain alignment and classification for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16643-16653 (2021)", + "45. Wei, G., Lan, C., Zeng, W., Zhang, Z., Chen, Z.: Toalign: task-oriented alignment for unsupervised domain adaptation. Advances in Neural Information Processing Systems 34, 13834-13846 (2021)" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "UDPCS", + "bbox": [ + 674, + 114, + 730, + 126 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. Wen, H., Cui, J., Hang, H., Liu, J., Wang, Y., Lin, Z.: Leveraged weighted loss for partial label learning. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 11091-11100. PMLR (18-24 Jul 2021), https://proceedings.mlr.press/v139/wen21a.html", + "47. Wu, D.D., Wang, D.B., Zhang, M.L.: Revisiting consistency regularization for deep partial label learning. In: Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., Sabato, S. (eds.) Proceedings of the 39th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 162, pp. 24212-24225. PMLR (17-23 Jul 2022), https://proceedings.mlr.press/v162/wu221.html", + "48. Xie, X., Chen, J., Li, Y., Shen, L., Ma, K., Zheng, Y.: Self-supervised cyclegan for object-preserving image-to-image domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 498-513. Springer (2020)", + "49. Yan, Y., Guo, Y.: Partial label unsupervised domain adaptation with class-prototype alignment. In: The Eleventh International Conference on Learning Representations (2022)", + "50. Zhang, Y., Liu, T., Long, M., Jordan, M.: Bridging theory and algorithm for domain adaptation. In: Proceedings of the 36th International Conference on Machine Learning (ICML) (2019)", + "51. Zhou, L., Ye, M., Zhu, X., Xiao, S., Fan, X.Q., Neri, F.: Homeomorphism alignment for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18699-18710 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 465 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "A. Dayal et al.", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_model.json b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_model.json new file mode 100644 index 0000000000000000000000000000000000000000..70aba37e4f577287eca51118132c7a1b931caf3c --- /dev/null +++ b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_model.json @@ -0,0 +1,2029 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.227, + 0.141, + 0.776, + 0.187 + ], + "angle": 0, + "content": "Improving Unsupervised Domain Adaptation: A Pseudo-Candidate Set Approach" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.212, + 0.776, + 0.243 + ], + "angle": 0, + "content": "Aveen Dayal\\(^{1}\\), Rishabh Lalla\\(^{1}\\), Linga Reddy Cenkeramaddi\\(^{2}\\), C Krishna Mohan\\(^{1}\\), Abhinav Kumar\\(^{1}\\), and Vineeth N Balasubramanian\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.25, + 0.255, + 0.751, + 0.296 + ], + "angle": 0, + "content": "\\(^{1}\\) Indian Institute of Technology Hyderabad, Hyderabad 502285, India {ai21resch11003@, rishabh.lalla@cse., ckm@cse., abhinavkumar@ee., vineethnb@cse.}iith.ac.in" + }, + { + "type": "text", + "bbox": [ + 0.344, + 0.297, + 0.658, + 0.325 + ], + "angle": 0, + "content": "2 University of Agder, Grimstad 4879, Norway linga.cenkeramaddi@uia.no" + }, + { + "type": "list", + "bbox": [ + 0.25, + 0.255, + 0.751, + 0.325 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.359, + 0.74, + 0.622 + ], + "angle": 0, + "content": "Abstract. Unsupervised domain adaptation (UDA) is a critical challenge in machine learning, aiming to transfer knowledge from a labeled source domain to an unlabeled target domain. In this work, we aim to improve target set accuracy in any existing UDA method by introducing an approach that utilizes pseudo-candidate sets for labeling the target data. These pseudo-candidate sets serve as a proxy for the true labels in the absence of direct supervision. To enhance the accuracy of the target domain, we propose Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), a method which effectively learns to disambiguate among classes in the pseudo-candidate set. Our approach is characterized by two distinct loss functions: one that acts on the pseudo-candidate set to refine its predictions and another that operates on the labels outside the pseudo-candidate set. We use a threshold-based strategy to further guide the learning process toward accurate label disambiguation. We validate our novel yet simple approach through extensive experiments on three well-known benchmark datasets: Office-Home, VisDA, and DomainNet. Our experimental results demonstrate the efficacy of our method in achieving consistent gains on target accuracies across these datasets." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.636, + 0.753, + 0.663 + ], + "angle": 0, + "content": "Keywords: Unsupervised Domain Adaptation \\(\\cdot\\) Disambiguation \\(\\cdot\\) Pseudo-Candidate Set" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.689, + 0.377, + 0.705 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In recent years, Deep Neural Networks (DNNs) have showcased remarkable achievements in multiple domains such as robotics [19], medical imaging [37], agriculture [17], and beyond. However, in the realm of deep learning, domain shift presents a significant challenge as it occurs when the training set and the test set exhibit different data distributions, leading to a degradation in model performance [1, 29]. Unsupervised Domain Adaptation (UDA) has emerged as a prominent setting to address such challenges. UDA aims to adapt a model trained on a labeled training set (source domain) to perform well on an unlabeled" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.239 + ], + "angle": 0, + "content": "test set (target domain) by minimizing the domain discrepancy and leveraging the intrinsic structure of the target domain [11, 41]. This adaptation is crucial for deploying deep learning models in dynamic environments where obtaining labeled data for every possible domain is impractical [6]. For instance, [16] explains how UDA techniques can be applied to bridge the gap between simulated and real-world domains, a common challenge in robotics." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.242, + 0.788, + 0.44 + ], + "angle": 0, + "content": "To address the UDA problem, two prominent categories of methods have emerged: adversarial and self-training approaches. Adversarial methods, such as Domain-Adversarial Neural Networks (DANN) [11], Maximum Classifier Discrepancy (MCD) [36], and Margin Disparity Discrepancy (MDD) [50], focus on minimizing the domain discrepancy by aligning the feature distributions of the source and target domains through adversarial training. On the other hand, self-training techniques, exemplified by works like Cycle Self-Training (CST) [22], and Minimum Class Confusion (MCC) [15], leverage the model's predictions on the target domain to iteratively refine the model, aiming to improve its generalization to the target domain. Apart from these, hybrid approaches that integrate both adversarial and self-training paradigms for effective adaptation across domains have also been proposed [3,24,43]. These approaches have shown promising results in addressing the challenges of domain shift in UDA." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.443, + 0.788, + 0.791 + ], + "angle": 0, + "content": "Despite these existing efforts in the field of UDA, we recognize an opportunity to further enhance performance in the target domain. Inspired by the use of candidate sets in partial-label learning [10, 40], we present a novel perspective to address the UDA problem by analyzing the patterns in the predictions of trained UDA models. As illustrated in Fig. 1, we observe that for multiple target samples, the trained UDA model's predictions are ambiguous, i.e., the model is not very confident about its predictions. Furthermore, we observe that this ambiguity is not uniformly distributed across all classes; instead, it is predominantly concentrated in a few closely related classes that exhibit the highest predicted probabilities, thereby leading to this ambiguity. To tackle this ambiguity, we introduce a novel technique, Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), which refines the predictions within the target domain. UDPCS starts by creating a pseudo-candidate set for each target sample, consisting of potential true labels based on the UDA model's predictions. Subsequently, inspired by [25], we propose a disambiguation process which is applied to these pseudo-candidate sets. Additionally, our method extends supervision beyond the pseudo-candidate set, penalizing predictions that stray into other classes. As illustrated in Fig. 1, the proposed UDPCS method effectively refines the UDA model's predictions by resolving ambiguity. It achieves this by identifying the potentially correct label and increasing its confidence. The efficacy of UDPCS is demonstrated through extensive experiments on various benchmark UDA datasets, showcasing its potential to enhance target accuracy in UDA models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "The following are the main contributions of this work:(i) We introduce the concept of a pseudo-candidate set, which is generated from the predictions of the UDA model. To the best of our knowledge, this work is the first to use the idea" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.676, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.222 + ], + "angle": 0, + "content": "of pseudo-candidate set in the UDA setting; (ii) We propose a novel refinement technique for UDA, UDPCS, by leveraging the identified pseudo-candidate sets; and (iii) We study the proposed method by conducting extensive experiments on multiple UDA benchmark datasets, observing consistent performance gains across various datasets and UDA methods." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.246, + 0.785, + 0.484 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.499, + 0.788, + 0.543 + ], + "angle": 0, + "content": "Fig. 1: Comparison of predictions between the trained UDA model (MDD [50]) and the proposed UDPCS method after refining the trained UDA model on the VisDA dataset for five target samples." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.597, + 0.388, + 0.613 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.787, + 0.659 + ], + "angle": 0, + "content": "This section discusses the earlier literature that was proposed specifically related to UDA and the disambiguation process inspired by partial-label learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.66, + 0.788, + 0.841 + ], + "angle": 0, + "content": "UDA aims to perform well on the unlabeled target domain by leveraging the labeled source data. Inspired by the theoretical analysis [1], learning domain-invariant features has emerged as a pivotal approach. This concept has given rise to one of the most prevalent methodologies for addressing UDA challenges: adversarial methods. Inspired by GAN, the key principle behind adversarial methods is to minimize the domain shift through a minimax optimization strategy. [11] introduced DANN, a pioneering work that employs a deep learning-based adversarial approach for UDA using a generator and a domain discriminator. Bi-classifier approaches, as proposed by [36] and [20], propose an adversarial approach involving a single feature extractor and two classifiers. [50] introduced a novel disparity discrepancy method, Margin Disparity Discrepancy (MDD), to learn domain invariant features. Various other adversarial methods" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.388 + ], + "angle": 0, + "content": "include [9,12,14,23,35,44,45]. Another significant avenue in UDA is self-training, where the model iteratively enhances its predictions to perform effectively on the target domain. Minimum Class Confusion (MCC), as proposed by [15], introduces a novel loss function that minimizes class confusion, leading to improved transfer gains. Additionally, Cycle Self-Training (CST), presented in [22], advocates for a cyclic self-training approach that refines target pseudo-labels in two steps and by leveraging Tsallis entropy as a regularizer. Various other methodologies in this category include [5, 26, 38]. Beyond these techniques, alternative methods such as optimal transport [18, 28, 32], moment matching [2, 21], and self-supervised techniques [4, 48], have been proposed to address UDA challenges. Notably, recent years have witnessed the emergence of several hybrid approaches, which typically amalgamate different categories of techniques [3, 24, 27, 33, 43, 51]. In this work, we introduce a novel perspective for tackling the UDA problem by analyzing the predictions of any trained UDA model on the target domain. Our proposed method is designed to iteratively refine the UDA model's prediction on the target domain." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.389, + 0.788, + 0.586 + ], + "angle": 0, + "content": "Disambiguation is a key aspect of partial label learning (PLL). The PRODEN method [25] is a pivotal work in PLL that employs an iterative strategy for refining candidate sets, directly targeting label disambiguation. Following PRODEN, recent advancements have continued to refine the disambiguation process in PLL. LWC [46] introduces a weighted loss function that prioritizes probable labels within candidate sets, enhancing the disambiguation process. CR [47] introduces consistency regularization in PLL for disambiguating the labels. These developments highlight the importance of refining disambiguation processes for accurate learning outcomes. In this work, inspired from [25], we introduce the concept of pseudo-candidate set and propose a disambiguation process on these pseudo-candidate sets. Unlike [49], which introduces a hybrid setting between UDA and PLL, our work focuses on leveraging the concepts from PLL to refine the predictions on the target domain in UDA." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.609, + 0.472, + 0.628 + ], + "angle": 0, + "content": "3 UDPCS: Methodology" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.642, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Preliminaries. This section describes the basic assumptions and notations for classification problems in UDA. In a typical UDA framework, three key components are involved: a feature extractor \\((\\mathcal{G})\\), a classifier \\((f)\\), and a domain adaptive component. The source and target domains are denoted by \\(\\mathcal{D}_S\\) and \\(\\mathcal{D}_T\\), respectively. The term \\(\\mathcal{D}\\) refers to any of these domains when the index is irrelevant. Throughout this work, the terms 'domain' and 'distribution' are used interchangeably. Each such domain \\(\\mathcal{D} \\subseteq \\mathcal{X} \\times \\mathcal{Y}\\), where \\(\\mathcal{X}\\) is an input space and \\(\\mathcal{Y}\\) is the output (label) space, which is \\(\\{0,1\\}\\) in binary classification and \\(\\{1,\\dots,k\\}\\) in multi-class classification. The term \\(\\hat{D}\\) is used to denote a set of samples drawn independently from \\(\\mathcal{D}\\), i.e. \\(\\hat{D} = \\{(x_i,y_i)\\}_{i=1}^n\\) where \\(x_i \\in \\mathcal{X}\\) and \\(y_i \\in \\mathcal{Y}\\), \\(\\forall i \\in \\{1,2,\\ldots,n\\}\\). We use \\((x,y)\\) to refer to a sample \\((x_i,y_i)\\) when the index is irrelevant. We define the model, \\(h(x) = f(\\mathcal{G}(x))\\), where \\(h: \\mathcal{X} \\to \\mathbb{R}^k\\), with each dimension of the output representing the class" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.676, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "probability for each class. We also use \\( Z \\) to refer to the pseudo-candidate set where \\( Z \\subset \\mathcal{Y} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.357 + ], + "angle": 0, + "content": "Methodology. We now present the methodology of our proposed approach, UDPCS, designed to enhance the accuracy of the target domain by leveraging pseudo-candidate sets. In the standard UDA setting, we assume that the training data consists of a labeled source domain, \\(\\mathcal{D}_S\\), and an unlabeled target domain, \\(\\mathcal{D}_T\\). The primary objective of a UDA method is to perform well on unlabeled target data. This is generally accomplished by employing a classification loss and an adaptation loss that minimizes the discrepancy between the source and target features. Over time, various adaptation loss functions have been proposed, depending on the specific UDA method employed [15,43,50]. Our proposed UDPCS method builds upon these standard techniques to further improve UDA performance with minimal overhead. We now describe our methodology and then illustrate it with a toy example." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.358, + 0.788, + 0.419 + ], + "angle": 0, + "content": "In order to serve as a refinement strategy over any UDA method, we first train the UDPCS model \\( h(.) \\) using any off-the-shelf UDA algorithm. Once the UDA training is complete, we employ the trained model \\( h(.) \\) to generate a pseudocandidate set for target data, as below." + }, + { + "type": "equation", + "bbox": [ + 0.354, + 0.429, + 0.786, + 0.446 + ], + "angle": 0, + "content": "\\[\nZ = \\{j | h _ {j} (x) > \\tau , \\forall j \\in \\{1, \\dots , k \\} \\}, \\tau > 0 \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.453, + 0.788, + 0.543 + ], + "angle": 0, + "content": "For each input \\( x \\), \\( Z \\) represents the pseudo-candidate set consisting of class indices \\( j \\) for which the corresponding class prediction probability, \\( h_j(x) \\), exceeds a predefined threshold \\( \\tau \\). This approach allows us to include only those classes in the pseudo-candidate set that have a relatively higher likelihood of being the true label, as indicated by the model \\( h(.) \\). We further define a non-candidate set as the complement of the pseudo-candidate set, i.e., all class indices not in \\( Z \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.544, + 0.788, + 0.603 + ], + "angle": 0, + "content": "Subsequently, for the refinement of the model's predictions in the target domain, our method is trained by utilizing an objective that consists of two loss functions: candidate loss \\( L_{c} \\) and non-candidate loss \\( L_{nc} \\). These loss functions are each described below." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.604, + 0.788, + 0.725 + ], + "angle": 0, + "content": "Candidate Loss. This loss guides the model \\( h(\\cdot) \\) to align its predictions with the pseudo-candidate set. We introduce a label confidence vector \\( \\boldsymbol{w} \\in \\mathbb{R}^k \\), representing the confidence for all \\( k \\) classes. Each element \\( w_j \\) in this vector signifies the confidence assigned to class \\( j \\). We ensure that \\( \\sum_{j \\in Z} w_j = 1 \\) and \\( w_j = 0 \\forall j \\notin Z \\), meaning that the confidence values \\( w_j \\) are assigned only to classes present in the pseudo-candidate set, and set to 0 otherwise. Consequently, \\( \\boldsymbol{w} \\) serves as a distribution over the classes in the pseudo-candidate set. The candidate loss applied to the pseudo-candidate set is then defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.295, + 0.734, + 0.787, + 0.773 + ], + "angle": 0, + "content": "\\[\nL _ {c} = \\left\\{ \\begin{array}{l l} K L (\\boldsymbol {w} | | h (\\mathcal {A} _ {1} (x)) & \\text {i f} \\max (h (\\mathcal {A} _ {1} (x))) < \\gamma \\\\ 0 & \\text {o t h e r w i s e} \\end{array} , \\gamma < 1 \\right. \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "The candidate loss is applied to samples for which the model's maximum predicted class probability falls below a certain threshold \\(\\gamma\\). Rather than using the raw input \\(x\\), we utilize a strongly augmented version, \\(\\mathcal{A}_1(x)\\), as the input. Inspired by FixMatch [39], for strong augmentations, we leverage Cutout [8] and" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.344 + ], + "angle": 0, + "content": "RandAugment [7], which produce heavily distorted versions of the given input \\( x \\). The rationale behind employing strong augmentation and thresholding is to differentiate between samples based on the model's predictions. For samples where the model's prediction is just above the threshold \\( \\gamma \\), the strong augmentation is likely to lower the prediction values, thereby including these samples in the candidate loss \\( L_{c} \\). Conversely, for samples where the model's predictions are very high, even after strong augmentation, the predictions remain robust and above the threshold. Consequently, these samples are excluded from the candidate loss, ensuring that the loss is primarily applied to samples where the model's predictions are less certain. This loss is calculated as the Kullback-Leibler (KL) divergence between the label confidence vector \\( \\mathbf{w} \\) and the model's predictions \\( h(\\mathcal{A}_1(x)) \\). Thus, in this way, the candidate loss aligns the pseudo-candidate set distribution and the model's prediction distribution." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.346, + 0.79, + 0.375 + ], + "angle": 0, + "content": "Non-Candidate Loss. This loss is applied to the elements outside the pseudocandidate set as:" + }, + { + "type": "equation", + "bbox": [ + 0.389, + 0.381, + 0.786, + 0.414 + ], + "angle": 0, + "content": "\\[\nL _ {n c} = - \\sum_ {j \\notin Z} \\log \\left(1 - h _ {j} \\left(\\mathcal {A} _ {2} (x)\\right)\\right) \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.788, + 0.532 + ], + "angle": 0, + "content": "The motivation for the non-candidate loss is that it penalizes the model for assigning high probabilities to classes that are not in the pseudo-candidate set \\( Z \\). It is computed as the negative log-likelihood of the complement probabilities for classes outside \\( Z \\), using the model's predictions \\( h(\\mathcal{A}_2(x)) \\) after applying a weak augmentation \\( \\mathcal{A}_2 \\) to the input \\( x \\). We use a standard flip-and-shift augmentation as our weak \\( \\mathcal{A}_2 \\). This loss discourages the model from considering classes outside the pseudo-candidate set as potential true labels." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.566 + ], + "angle": 0, + "content": "Overall Objective. The overall objective function of the proposed UDPCS model is the sum of the candidate and non-candidate loss terms:" + }, + { + "type": "equation", + "bbox": [ + 0.437, + 0.584, + 0.786, + 0.599 + ], + "angle": 0, + "content": "\\[\nL o s s = L _ {c} + \\lambda L _ {n c} \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.615, + 0.787, + 0.645 + ], + "angle": 0, + "content": "where \\(\\lambda\\) is a hyperparameter that balances the contributions of the two loss functions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.648, + 0.788, + 0.786 + ], + "angle": 0, + "content": "Updating \\( \\boldsymbol{w} \\). As in Eqn. (2), the vector \\( \\boldsymbol{w} \\) plays a crucial role in guiding the model's predictions. Therefore, updating \\( \\boldsymbol{w} \\) after each iteration is essential for disambiguation of the pseudo-candidate set. We set the label confidence \\( \\boldsymbol{w} \\) initially to \\( \\frac{1}{|Z|} \\) if the class \\( j \\) is in the pseudo-candidate set \\( Z \\), where \\( |Z| \\) denotes the cardinality of \\( Z \\). This ensures that each class in the pseudo-candidate set receives an equal initial confidence value. The rationale for assigning an equal initial confidence value to each class in the pseudo-candidate set is to enable the proposed UDPCS method to disambiguate the correct class from a set of classes without bias. This scheme is given below:" + }, + { + "type": "equation", + "bbox": [ + 0.321, + 0.802, + 0.787, + 0.845 + ], + "angle": 0, + "content": "\\[\nw _ {j} = \\left\\{ \\begin{array}{l l} \\frac {1}{| Z |} & \\text {i f} j \\in Z \\\\ 0 & \\text {o t h e r w i s e} \\end{array} , \\boldsymbol {w} \\in \\mathbb {R} ^ {k} \\right. \\text {a n d} \\sum_ {j \\in Z} w _ {k} = 1 \\tag {5}\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.676, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.126 + ], + "angle": 0, + "content": "7" + }, + { + "type": "code_caption", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "Algorithm 1 Unsupervised Domain Adaptation refinement using pseudo-candidate sets (UDPCS)" + }, + { + "type": "algorithm", + "bbox": [ + 0.219, + 0.179, + 0.788, + 0.402 + ], + "angle": 0, + "content": "1: Input: Source domain data \\(D_S = \\{x_i^S, y_i^S\\}_{i=1}^{n_S}\\), target domain data \\(D_T = \\{x_j^T\\}_{j=1}^{n_T}\\), learning rate \\(\\eta\\), number of iterations \\(T\\), refinement iterations \\(T_{\\mathrm{refine}}\\), strong augmentation \\(\\mathcal{A}_1\\), weak augmentation \\(\\mathcal{A}_2\\). \n2: Output: Refined model \\(h\\) \n3: Initialize model \\(h\\) with random weights \n4: for \\(t = 1\\) to \\(T\\) do \n5: \\((x^S, y^S) \\sim D_S\\) and \\((x^T) \\sim D_T\\) \n6: Update the parameters of \\(h\\) utilizing \\((x^S, y^S)\\) and \\((x^T)\\) in accordance with any standard unsupervised domain adaptation technique. \n7: end for \n8: Generate the pseudo-candidate set 'Z' for each sample in \\(D_T\\) using Eqn. (1) \n9: Initialize the label confidence vector 'w' using Eqn. (5) \n10: for \\(t = 1\\) to \\(T_{\\mathrm{refine}}\\) do \n11: \\((x^T) \\sim D_T\\), with augmentations \\(\\mathcal{A}_1(x^T)\\) and \\(\\mathcal{A}_2(x^T)\\) \n12: Compute the candidate loss \\(L_c\\) using Eqn. (2) \n13: Compute the non-candidate loss \\(L_{nc}\\) using Eqn. (3) \n14:Compute the final loss, \\(Loss = L_c + \\lambda L_{nc}\\) \n15: Update the label confidence vector using Eqn. (6) \n16:Update model \\(h\\) using gradient descent: \\(h \\gets h - \\eta \\nabla Loss\\) \n17: end for \n18: return \\(h\\)" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.433, + 0.785, + 0.463 + ], + "angle": 0, + "content": "After each iteration, the vector \\(\\pmb{w}\\) is dynamically updated based on the model's predictions \\(h(\\mathcal{A}_1(x))\\), as below:" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.477, + 0.785, + 0.519 + ], + "angle": 0, + "content": "\\[\nw _ {j} = \\left\\{ \\begin{array}{l l} \\frac {h _ {j} \\left(\\mathcal {A} _ {1} (x)\\right)}{\\sum_ {m \\in Z} h _ {m} \\left(\\mathcal {A} _ {1} (x)\\right)} & \\text {i f} j \\in Z \\\\ 0 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.785, + 0.61 + ], + "angle": 0, + "content": "As in Eqn. (6), the confidence \\( w_{j} \\) for each class \\( j \\) in the pseudo-candidate set \\( Z \\) is updated to be proportional to the model's prediction probability for that class, normalized by the sum of prediction probabilities for all classes in \\( Z \\). This update ensures that \\( w_{j} \\) reflects the model's current confidence in each class within the pseudo-candidate set, facilitating the disambiguation process." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.612, + 0.787, + 0.748 + ], + "angle": 0, + "content": "Therefore, by iteratively updating the model \\( h(.) \\) using the aforementioned components, the proposed UDPCS improves the model's ability to disambiguate the correct class from the pseudo-candidate set, leading to more accurate and confident predictions on the target domain. Our overall method is summarized in Algorithm 1. We begin by training the proposed model \\( h(.) \\) using a standard UDA technique. We then generate the pseudo-candidate set and initialize the label confidence vector. Subsequently, the method undergoes iterative training, incorporating both candidate and non-candidate loss in each iteration. We now illustrate our approach using a toy example." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Toy Example. To illustrate the working of our method, the toy example in Fig. 2 shows how the proposed UDPCS technique refines a model's predictions. In particular, we demonstrate a single iteration after UDA training. As shown in the figure, we consider a 5-class classification problem with labeled source data, unlabeled target data consisting of 5 samples from \\( S1 \\) to \\( S5 \\) and a model \\( h_{UDA}(.) \\) trained using any off-the-shelf UDA technique. The unseen true labels" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.145, + 0.785, + 0.319 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.33, + 0.788, + 0.375 + ], + "angle": 0, + "content": "Fig. 2: Illustration of the toy example for demonstrating our UDPCS method. The figure visualizes the process of refining the predictions of a base UDA model by leveraging pseudo-candidate sets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.425, + 0.789, + 0.459 + ], + "angle": 0, + "content": "for these 5 target samples are assigned such that sample \\( j \\) is labeled as class \\( j \\), \\( \\forall j \\in \\{1,2,\\ldots,5\\} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.467, + 0.79, + 0.634 + ], + "angle": 0, + "content": "As mentioned earlier in this section, after UDA training, our UDPCS method generates the pseudo-candidate set \\( Z \\) using model predictions \\( h_{UDA(\\cdot)} \\) and with \\( \\tau = 0.1 \\), according to Eqn. (1), for each target sample. The cardinality of these pseudo-candidate sets for this example ranges from 2 to 4 in Fig. 2. These sets are then utilized to generate the label confidence vector \\( \\pmb{w} \\), which, as previously discussed, is initialized with uniform confidence values according to Eqn. (5) (to avoid error bias from the base model). This \\( \\pmb{w} \\), along with the pseudo-candidate sets, is then used to refine the model's prediction by updating its parameters using Eqn. (4). In the next iteration, 'Step = 1' in the figure, this refined model generates predictions on the target set, which is then used to get the disambiguated vector \\( \\pmb{w} \\) according to Eqn. (6)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.79, + 0.842 + ], + "angle": 0, + "content": "As in the figure, the refined model's predictions for each sample definitively impacts model accuracy. After initial UDA model training, the model correctly predicted \\( S1 \\), \\( S2 \\), and \\( S3 \\), but incorrectly predicted \\( S4 \\) and \\( S5 \\), resulting in \\( 60\\% \\) accuracy. Whereas after the refinement, \\( S4 \\) is correctly disambiguated, while the confidence in predictions for \\( S1 \\), \\( S2 \\), and \\( S3 \\) has increased. For sample \\( S5 \\), the disambiguation could not identify the correct label in the first iteration. These changes in predictions increased the model's accuracy from \\( 60\\% \\) to \\( 80\\% \\). It is also noticeable that the prediction probabilities of classes outside the candidate set have reduced, which can be attributed to the non-candidate set loss. Thus, the proposed method improves UDA performance by refining the model's predictions. We show later in our experiments that with this little overhead, we outperform the base UDA model across different baselines, even when the baseline is allowed the same additional training time." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.677, + 0.114, + 0.732, + 0.128 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.377, + 0.163 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.326 + ], + "angle": 0, + "content": "Datasets: We conduct a comprehensive evaluation of our proposed UDPCS method on several benchmark UDA datasets, including VisDA [31], DomainNet [30], and OfficeHome [42]. Each dataset poses unique challenges for domain adaptation. The VisDA dataset, for instance, exhibits a significant domain gap between the source and target domains, encompassing 12 classes. The DomainNet dataset, on the other hand, offers a broader label space with 365 classes, presenting a different set of challenges. Lastly, the OfficeHome dataset, with its relatively limited number of samples across all domains, necessitates efficient adaptation strategies. Further details about these datasets are provided in the Appendix." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.328, + 0.788, + 0.552 + ], + "angle": 0, + "content": "Implementation Details and Baselines: Consistent with recent benchmarks [24, 51], we employ the ResNet50 model as the feature extractor for the Office-Home dataset and the ResNet101 model for the VisDA and DomainNet datasets. Our method is trained using stochastic gradient descent with momentum [34]. Additional implementation details, such as hyperparameters including threshold values, learning rates, etc., are detailed in the Appendix. Our UDPCS method enhances off-the-shelf UDA techniques; hence, we evaluate its effectiveness against a range of UDA methods such as MDD [50], MCC [15], LeCo [43], SDAT [35], and NWD [3], which encompass diverse approaches like adversarial and self-training. We benchmark our model by comparing the performance of these UDA methods with and without the application of our UDPCS technique. Additionally, we contrast our method with other recent benchmarks in Appendix A1. In our result tables, (Tab. 1 to Tab. 3), the performance of our UDPCS method is denoted as 'UDA method+Ours,' where 'UDA method' indicates the base method upon which UDPCS is applied." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.554, + 0.788, + 0.688 + ], + "angle": 0, + "content": "Results on VisDA: The VisDA dataset presents a single adaptation scenario, from synthetic (source) to real-world (target) domains. Class-wise target accuracy results on the VisDA dataset are detailed in Tab. 1. As seen in Tab. 1, the UDPCS method enhances mean accuracy across five different UDA methods. Notably, the maximum improvement, a \\(2.4\\%\\) gain, is observed when UDPCS is applied to both the MCC and NWD models. The VisDA dataset is known for its large domain gap between the source and target domains. Despite this challenge, UDPCS achieves an average gain of \\(2\\%\\) in target accuracy, as demonstrated in Tab. 1, highlighting its efficacy in refining model predictions." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Results on DomainNet: In line with the settings from [13, 43], we carry out experiments on 12 tasks involving clipart (c), painting (p), real (r), and sketch (s) domains from the original DomainNet dataset. The detailed results for all tasks are showcased in Tab. 2. As indicated in Tab. 2, the UDPCS method surpasses the performance of each underlying UDA method, with a maximum gain of \\(3.5\\%\\) in average target accuracy. As seen from Tab. 2, our method, 'MDD+Ours,' achieves the best performance compared to all the other methods. Despite DomainNet's challenge of a vast label space with 365 classes, the UDPCS method achieves an average gain of \\(1.6\\%\\) in target accuracy, showcasing the robustness and effectiveness of our approach." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.19 + ], + "angle": 0, + "content": "Table 1: Accuracy(%) on VisDA dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. Mean denotes Mean Accuracy. Appendix A1 presents additional results." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.201, + 0.789, + 0.362 + ], + "angle": 0, + "content": "
ModelplanebcyblbuscarhorseknifemcyclepersnplantsktbtraintruckMeanGains
MDD(ICML'19)94.675.068.570.291.494.391.579.791.688.484.336.880.5
+Ours96.176.869.372.493.396.592.580.592.689.786.838.682.11.6
MCC(ECCV'20)94.585.974.571.693.994.985.982.391.491.782.457.483.8
+Ours96.288.477.673.795.197.789.583.794.593.485.259.186.22.4
LeCo(ACCV'22)96.187.585.889.695.696.290.882.794.491.184.441.986.3
+Ours97.588.685.589.997.397.193.384.896.493.787.245.288.01.7
SDAT(ICML'22)94.682.977.067.493.697.192.482.692.887.085.652.283.8
+Ours95.684.679.376.094.998.192.783.994.490.688.148.785.61.8
NWD (CVPR'22)93.983.976.673.293.191.085.780.991.890.082.051.282.8
+Ours96.087.478.677.294.593.889.183.293.894.383.651.585.22.4
Average Gains2
" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.375, + 0.789, + 0.42 + ], + "angle": 0, + "content": "Table 2: Accuracy(%) on DomainNet dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.431, + 0.789, + 0.581 + ], + "angle": 0, + "content": "
Modelc-pc-rc-sp-cp-rp-sr-cr-pr-ss-cs-ps-rAvg.Gains
CDAN (NeurIPS'18)40.456.846.145.158.440.555.653.643.057.246.455.749.9
+Ours43.759.147.745.959.24258.253.745.75948.257.851.71.8
MDD (ICML'19)42.859.248.349.259.643.658.854.146.659.146.757.852.2
+Ours46.763.551.451.162.346.363.157.750.763.450.361.955.73.5
MCC (ECCV'20)37.155.641.445.559.939.754.353.136.858.246.556.148.7
+Ours39.156.643.047.260.641.156.455.038.859.147.057.750.11.4
SDAT (ICML'22)41.957.247.247.860.242.356.553.942.760.448.057.551.3
+Ours43.758.147.948.159.443.056.053.143.858.747.657.751.40.1
Average Gains1.7
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.608, + 0.789, + 0.744 + ], + "angle": 0, + "content": "Results on OfficeHome: The OfficeHome dataset encompasses 12 tasks across the Art (A), Clipart (C), Product (P), and Real World (R) domains. Target accuracy results for all tasks are presented in Tab. 3. As evident in Tab. 3, the UDPCS method surpasses the performance of the underlying UDA methods, with a maximum gain of \\(1.8\\%\\) in average target accuracy. As seen from Tab. 3, our methods, 'MCC+Ours' and 'NWD+Ours,' achieves the best performance compared to all the other methods. Although OfficeHome presents a challenge with its relatively small sample size per domain, the UDPCS technique still manages to achieve an average gain of \\(0.9\\%\\), demonstrating its effectiveness." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.765, + 0.707, + 0.784 + ], + "angle": 0, + "content": "5 More Empirical Analysis and Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.789, + 0.843 + ], + "angle": 0, + "content": "Ablation Studies: To assess the impact of various components of the proposed UDPCS method, we conduct ablation studies and present the results in Tab. 4. The table outlines experiments on three key components: candidate loss \\((L_{c})\\)" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.676, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.19 + ], + "angle": 0, + "content": "Table 3: Accuracy(%) on OfficeHome dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results." + }, + { + "type": "table", + "bbox": [ + 0.216, + 0.201, + 0.789, + 0.384 + ], + "angle": 0, + "content": "
ModelA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.Gains
MDD (ICML'19)75.556.27963.172.572.663.155.179.773.360.183.669.5-
+Ours77.657.880.565.475.175.465.156.581.674.161.384.771.31.8
MCC(ECCV'20)79.858.183.268.676.678.667.855.582.274.460.885.872.6
+ Ours81.159.384.169.27879.669.156.482.874.762.186.473.61
Leco (ACCV'22)78.758.382.468.679.179.367.556.282.67560.98672.9
+Ours79.159.282.768.879.479.367.756.982.675.261.186.473.20.3
SDAT(ICML'22)77.258.981.266.675.876.863.95781.875.164.885.872.1
+Ours78.159.782.16776.37764.457.682.675.265.28672.60.5
NWD(CVPR'22)80.158.183.467.977.278.667.955.78274.160.785.772.6-
+Ours80.959.183.968.6798068.556.783.274.962.186.773.61
Average Gains0.9
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.414, + 0.789, + 0.686 + ], + "angle": 0, + "content": "non-candidate loss \\((L_{nc})\\), and a threshold \\((\\gamma)\\), with a tick mark indicating the inclusion of a component in a particular experiment. The absence of all ticks denotes the use of the base UDA method without our refinement. We evaluate two base UDA methods, MDD and MCC, on the OfficeHome dataset, as detailed in Tab. 4. For the MDD+Ours model, introducing candidate loss \\((L_{c})\\) yields a \\(1.2\\%\\) increase in average accuracy, while adding non-candidate loss \\((L_{nc})\\) brings a similar enhancement of \\(1.1\\%\\). The inclusion of thresholding \\((\\gamma)\\), particularly with candidate loss, leads to a \\(1.6\\%\\) improvement, emphasizing the value of focusing on ambiguous samples. The combination of both losses, without the threshold, results in a \\(1.4\\%\\) uptick, and the full UDPCS model, integrating all components, achieves the highest gain of \\(1.8\\%\\) over the base MDD model. In the MCC+Ours model, the addition of candidate loss and non-candidate loss individually contributes to improvements of \\(0.4\\%\\) and \\(0.7\\%\\), respectively. The integration of thresholding, either alone or with other components, consistently enhances performance, with the full UDPCS model outperforming the base MCC model by \\(1\\%\\). These findings highlight the synergistic effect of combining candidate loss, non-candidate loss, and thresholding, underscoring the comprehensive effectiveness of the UDPCS method in boosting average accuracy." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.688, + 0.789, + 0.763 + ], + "angle": 0, + "content": "Complexity Analysis: The complexity analysis of the UDPCS method, as presented in Table A1 in the Appendix, illustrates its efficiency in terms of training time while achieving improvements in average accuracy. The UDPCS method achieves higher average accuracy without incurring any significant training time. Please see the Appendix for the complete discussion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Hyperparameter \\(\\lambda\\): The exploration of the hyperparameter \\(\\lambda\\), which balances the candidate loss \\((L_{c})\\) and the non-candidate loss \\((L_{nc})\\) in the total loss equation \\((L_{c} + \\lambda L_{nc})\\), reveals its impact on the performance of the UDPCS method, as shown in Table 5. We run each of the experiment three times to report the average values. For the MDD+Ours model, setting \\(\\lambda = 0.5\\) results in an aver" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.144, + 0.788, + 0.174 + ], + "angle": 0, + "content": "Table 4: Ablation results (%) on OfficeHome dataset assessing the impact of UDPCS components." + }, + { + "type": "table", + "bbox": [ + 0.217, + 0.186, + 0.789, + 0.361 + ], + "angle": 0, + "content": "
Model\\(L_c\\)\\(L_{nc}\\)γA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours75.556.27963.172.572.663.155.179.773.360.183.669.5
✓76.95880.264.874.774.863.655.980.973.561.18470.7
✓76.857.379.765.474.575.164.555.780.273.460.583.970.6
✓✓77.458.180.664.475.274.66556.581.473.861.384.471.1
✓✓77.157.680.564.574.875.164.556.481.2746184.370.9
✓✓✓77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours79.858.183.268.676.678.667.855.582.274.460.885.872.6
✓80.45983.869.177.378.76856.58274.261.485.973
✓80.358.88469.277.279.768.555.882.975.161.586.273.3
✓✓80.758.783.56977.178.468.656.782.374.6628673.1
✓✓80.458.88468.877.578.96856.282.974.161.58673.1
✓✓✓81.159.384.169.27879.669.156.482.874.762.186.473.6
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.387, + 0.789, + 0.54 + ], + "angle": 0, + "content": "age accuracy of \\(71.1\\%\\), which slightly improves to \\(71.2\\%\\) when \\(\\lambda = 1\\). Further increasing \\(\\lambda\\) to 2 maintains the average accuracy of \\(71.2\\%\\), suggesting a robust performance across different values of \\(\\lambda\\). Similarly, for the MCC+Ours model, the average accuracy is \\(73.6\\%\\) for all the \\(\\lambda\\) values with slight variations in the standard deviation values. These findings indicate that the UDPCS method is relatively stable across a range of \\(\\lambda\\) values, with minor fluctuations in average accuracy. This stability underscores the method's robustness and the effectiveness of the balanced approach to handling candidate and non-candidate losses in refining predictions for domain adaptation tasks. Please see the Appendix for the complete results of this analysis." + }, + { + "type": "table_caption", + "bbox": [ + 0.236, + 0.564, + 0.766, + 0.58 + ], + "angle": 0, + "content": "Table 5: Accuracy(%) of UDPCS for different \\( \\lambda \\) values on OfficeHome dataset." + }, + { + "type": "table", + "bbox": [ + 0.274, + 0.591, + 0.733, + 0.722 + ], + "angle": 0, + "content": "
λA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
λ = 0.577.258.280.664.875.374.965.156.581.073.961.484.571.1 ±0.1
λ = 177.558.080.665.375.275.165.056.581.674.161.484.571.2±0.02
λ = 277.357.980.865.175.075.365.156.681.574.061.384.471.2±0.01
MCC+Ours
λ = 0.580.959.183.869.677.879.668.956.683.274.862.186.673.6±0.05
λ = 181.059.184.369.377.979.668.956.683.274.762.086.573.6±0.06
λ = 280.959.284.269.278.079.668.956.782.974.862.486.673.6±0.1
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Weak Augmentation: The exploration of weak augmentation \\(\\mathcal{A}_2\\) in the candidate set loss for the UDPCS method, as compared to the main results obtained using strong augmentation \\(\\mathcal{A}_1\\), reveals interesting insights into the method's performance, as shown in Table 6. For the MDD+Ours model, employing weak augmentation results in an average accuracy of \\(69.6\\%\\), which is lower than the \\(71.3\\%\\) achieved with strong augmentation. Similarly, the MCC+Ours model ex" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.676, + 0.114, + 0.732, + 0.127 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "hibits a decrease in average accuracy from \\(73.6\\%\\) with strong augmentation to \\(72.8\\%\\) with weak augmentation. These findings suggest that strong augmentation plays a crucial role in the effectiveness of the UDPCS method, particularly in refining predictions for domain adaptation tasks. Further augmentation related experiments are reported in the Appendix." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.247, + 0.788, + 0.276 + ], + "angle": 0, + "content": "Table 6: Accuracy(%) of UDPCS for different augmentation used on OfficeHome dataset. (Aug. = Augmentation)" + }, + { + "type": "table", + "bbox": [ + 0.274, + 0.288, + 0.731, + 0.405 + ], + "angle": 0, + "content": "
Aug.A-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
Weak76.356.47963.373.573.663.154.779.37359.783.169.6
Strong77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
Weak79.958.283.269.176.878.567.656.781.974.161.28672.8
Strong81.159.384.169.27879.669.156.482.874.762.186.473.6
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.583 + ], + "angle": 0, + "content": "Threshold \\(\\gamma\\): The examination of different threshold values \\((\\gamma)\\) used in the candidate loss, Eqn. (2), of the UDPCS method provides insights into the method's sensitivity to this hyperparameter, as shown in Table 7. For the MDD+Ours model, the average accuracy remains consistent at \\(71.1\\%\\) for both \\(\\gamma = 0.8\\) and \\(\\gamma = 0.9\\), with a slight increase to \\(71.3\\%\\) when \\(\\gamma = 0.85\\). Similarly, for the MCC+Ours model, the average accuracy is stable at \\(73.5\\%\\) for \\(\\gamma = 0.8\\) and \\(\\gamma = 0.9\\), with a marginal increase to \\(73.6\\%\\) at \\(\\gamma = 0.85\\). The slight variations in average accuracy suggest that while the choice of threshold can influence the method's performance, the UDPCS method is not overly sensitive to this hyperparameter." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.607, + 0.788, + 0.634 + ], + "angle": 0, + "content": "Table 7: Accuracy(%) of UDPCS for different threshold (\\(\\gamma\\)) values on OfficeHome dataset." + }, + { + "type": "table", + "bbox": [ + 0.274, + 0.648, + 0.731, + 0.784 + ], + "angle": 0, + "content": "
A-P A-C A-R C-A C-P C-R P-A P-C P-R R-A R-C R-P Avg.
MDD+ours
γ = 0.877.158.580.864.975.174.964.756.581.673.861.3
γ = 0.8577.657.880.565.475.175.465.156.581.674.161.3
γ = 0.977.358.181.164.9757564.556.681.47461.1
MCC+Ours
γ = 0.881.159.383.669.27879.669.156.482.874.761.9
γ = 0.8581.159.384.169.27879.669.156.482.874.762.1
γ = 0.980.759.383.869.477.579.368.956.582.974.762.4
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Cross entropy: The investigation of using cross entropy as an alternative to KL divergence for the candidate loss, Eqn.(2) in the UDPCS method reveals" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.269 + ], + "angle": 0, + "content": "the method's adaptability and effectiveness across different loss functions, as demonstrated in Table 8. For the MDD+Ours model, employing cross entropy for the candidate loss yields an average accuracy of \\(71.3\\%\\), which is identical to the average accuracy achieved using KL divergence. Similarly, the MCC+Ours model maintains an average accuracy of \\(73.6\\%\\) with both cross entropy and KL divergence. The consistency in average accuracy across different loss functions suggests that the method's ability to refine predictions for domain adaptation tasks is robust to the choice of loss function." + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.291, + 0.787, + 0.321 + ], + "angle": 0, + "content": "Table 8: Accuracy(%) of UDPCS for different loss functions on OfficeHome dataset. (CE= Cross Entropy, KL=KL Divergence)" + }, + { + "type": "table", + "bbox": [ + 0.288, + 0.332, + 0.719, + 0.446 + ], + "angle": 0, + "content": "
LossA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
CE77.458.180.764.975.275.365.356.381.573.961.784.871.3
KL77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
CE81.159.384.169.27879.669.156.482.874.762.186.473.6
KL80.859.284.569.477.979.768.456.583.275.162.186.473.6
" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.498, + 0.36, + 0.515 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.529, + 0.788, + 0.683 + ], + "angle": 0, + "content": "In conclusion, UDPCS presents a novel approach to UDA by leveraging the concept of disambiguation and introducing pseudo-candidate sets to approximate the true labels of the target set. Our method is distinguished by the use of two loss functions to refine predictions within the pseudo-candidate set and to penalize incorrect labels outside of it, combined with a threshold-based strategy to focus on ambiguous samples. Through comprehensive experiments on the benchmark datasets, our approach has demonstrated its effectiveness in consistently improving target set accuracy across diverse domains. We also conduct thorough analysis and ablation studies. The results highlight the potential of our method to serve as a robust solution for UDA challenges." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.703, + 0.405, + 0.721 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "The research of AD is supported in part by the Prime Minister Research Fellowship, Ministry of Education, Government of India. VNB would like to acknowledge the support through the Govt of India SERB IMPRINT and DST ICPS funding programs for this work. The research of CKM is supported by the LiDAR and Camera Sensors Data based Deep Learning Algorithms for Autonomous Driving System project, funded by Govt. of India SERB program. The research is also partly supported by the Indo-Norwegian Collaboration in" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.677, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.239 + ], + "angle": 0, + "content": "Autonomous Cyber-Physical Systems (INCAPS) project: 287918 of the International Partnerships for Excellent Education, Research and Innovation (INTPART) program and the Low-Altitude UAV Communication and Tracking (LUCAT) project: 280835 of the IKTPLUSS program from the Research Council of Norway. We are grateful to the anonymous reviewers for the feedback that helped improved the presentation of this paper." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.26, + 0.323, + 0.275 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.289, + 0.785, + 0.331 + ], + "angle": 0, + "content": "1. Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., Vaughan, J.W.: A theory of learning from different domains. Machine Learning 79(1-2), 151-175 (2010)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.333, + 0.785, + 0.372 + ], + "angle": 0, + "content": "2. Chen, C., Fu, Z., Chen, Z., Jin, S., Cheng, Z., Jin, X., Hua, X.S.: Homm: Higher-order moment matching for unsupervised domain adaptation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 3422-3429 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.373, + 0.785, + 0.428 + ], + "angle": 0, + "content": "3. Chen, L., Chen, H., Wei, Z., Jin, X., Tan, X., Jin, Y., Chen, E.: Reusing the task-specific classifier as a discriminator: Discriminator-free adversarial domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7181-7190 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.429, + 0.785, + 0.482 + ], + "angle": 0, + "content": "4. Chen, W., Lin, L., Yang, S., Xie, D., Pu, S., Zhuang, Y.: Self-supervised noisy label learning for source-free unsupervised domain adaptation. In: 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10185-10192. IEEE (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.484, + 0.785, + 0.524 + ], + "angle": 0, + "content": "5. Chen, Y., Wei, C., Kumar, A., Ma, T.: Self-training avoids using spurious features under domain shift. Advances in Neural Information Processing Systems 33, 21061-21071 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.525, + 0.785, + 0.551 + ], + "angle": 0, + "content": "6. Csurka, G.: Domain adaptation for visual applications: A comprehensive survey, pp. 1-35. Springer (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.552, + 0.785, + 0.579 + ], + "angle": 0, + "content": "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.58, + 0.785, + 0.606 + ], + "angle": 0, + "content": "8. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.607, + 0.785, + 0.647 + ], + "angle": 0, + "content": "9. Du, Z., Li, J., Su, H., Zhu, L., Lu, K.: Cross-domain gradient discrepancy minimization for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3937-3946 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.649, + 0.785, + 0.73 + ], + "angle": 0, + "content": "10. Feng, L., Lv, J., Han, B., Xu, M., Niu, G., Geng, X., An, B., Sugiyama, M.: Provably consistent partial-label learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 10948-10960. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/7bd28f15a49d5e5848d6ec70e584e625-Paper.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.732, + 0.785, + 0.771 + ], + "angle": 0, + "content": "11. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32nd International Conference on Machine Learning (ICML) (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "12. Gao, Z., Zhang, S., Huang, K., Wang, Q., Zhong, C.: Gradient distribution alignment certificates better adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8937-8946 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "13. Jiang, J., Chen, B., Fu, B., Long, M.: Transfer-learning-library. https://github.com/thuml/Transfer-Learning-Library (2020)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.289, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "14. Jin, X., Lan, C., Zeng, W., Chen, Z.: Re-energizing domain discriminator with sample relabeling for adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9174-9183 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.785, + 0.23 + ], + "angle": 0, + "content": "15. Jin, X., Lan, C., Zeng, W., Chen, Z.: Minimum class confusion for versatile domain adaptation. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.23, + 0.785, + 0.271 + ], + "angle": 0, + "content": "16. Jing, X., Qian, K., Jianu, T., Luo, S.: Unsupervised adversarial domain adaptation for sim-to-real transfer of tactile images. IEEE Transactions on Instrumentation and Measurement 72, 1-11 (2023). https://doi.org/10.1109/TIM.2023.3268458" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.271, + 0.785, + 0.298 + ], + "angle": 0, + "content": "17. Kamilaris, A., Prenafeta-Boldú, F.X.: Deep learning in agriculture: A survey. Computers and Electronics in Agriculture 147, 70-90 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.298, + 0.785, + 0.338 + ], + "angle": 0, + "content": "18. Le, T., Nguyen, T., Ho, N., Bui, H., Phung, D.: Lamda: Label matching deep domain adaptation. In: International Conference on Machine Learning. pp. 6043-6054. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.338, + 0.785, + 0.366 + ], + "angle": 0, + "content": "19. LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436-444 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.366, + 0.785, + 0.406 + ], + "angle": 0, + "content": "20. Lee, C.Y., Batra, T., Baig, M.H., Ulbricht, D.: Sliced wasserstein discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10285-10295 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.406, + 0.785, + 0.447 + ], + "angle": 0, + "content": "21. Li, S., Liu, C., Lin, Q., Xie, B., Ding, Z., Huang, G., Tang, J.: Domain conditioned adaptation network. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 11386-11393 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.447, + 0.785, + 0.473 + ], + "angle": 0, + "content": "22. Liu, H., Wang, J., Long, M.: Cycle self-training for domain adaptation. Advances in Neural Information Processing Systems 34, 22968-22981 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.473, + 0.785, + 0.528 + ], + "angle": 0, + "content": "23. Liu, X., Guo, Z., Li, S., Xing, F., You, J., Kuo, C.C.J., El Fakhri, G., Woo, J.: Adversarial unsupervised domain adaptation with conditional and label shift: Infer, align and iterate. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 10367-10376 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.528, + 0.785, + 0.569 + ], + "angle": 0, + "content": "24. Liu, Y., Zhou, Z., Sun, B.: Cot: Unsupervised domain adaptation with clustering and optimal transport. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19998-20007 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.569, + 0.785, + 0.637 + ], + "angle": 0, + "content": "25. Lv, J., Xu, M., Feng, L., Niu, G., Geng, X., Sugiyama, M.: Progressive identification of true labels for partial-label learning. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 6500-6510. PMLR (13-18 Jul 2020), https://proceedings.mlr.press/v119/lv20a.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.637, + 0.785, + 0.692 + ], + "angle": 0, + "content": "26. Mei, K., Zhu, C., Zou, J., Zhang, S.: Instance adaptive self-training for unsupervised domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXVI 16. pp. 415-430. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.692, + 0.785, + 0.733 + ], + "angle": 0, + "content": "27. Na, J., Jung, H., Chang, H.J., Hwang, W.: Fixbi: Bridging domain spaces for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1094-1103 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.733, + 0.785, + 0.773 + ], + "angle": 0, + "content": "28. Nguyen, T., Le, T., Dam, N., Tran, Q.H., Nguyen, T., Phung, D.Q.: Tidot: A teacher imitation learning approach for domain adaptation with optimal transport. In: IJCAI. pp. 2862-2868 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.773, + 0.785, + 0.8 + ], + "angle": 0, + "content": "29. Patel, V.M., Gopalan, R., Li, R., Chellappa, R.: Visual domain adaptation: A survey of recent advances. IEEE Signal Processing Magazine 32(3), 53-69 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "30. Peng, X., Bai, Q., Xia, X., Huang, Z., Saenko, K., Wang, B.: Moment matching for multi-source domain adaptation. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 1406-1415 (2019)" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.676, + 0.115, + 0.732, + 0.127 + ], + "angle": 0, + "content": "UDPCS" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.175 + ], + "angle": 0, + "content": "31. Peng, X., Usman, B., Kaushik, N., Hoffman, J., Wang, D., Saenko, K.: Visda: The visual domain adaptation challenge (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.175, + 0.788, + 0.217 + ], + "angle": 0, + "content": "32. Phan, H., Le, T., Phung, T., Bui, A.T., Ho, N., Phung, D.: Global-local regularization via distributional robustness. In: International Conference on Artificial Intelligence and Statistics. pp. 7644-7664. PMLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.218, + 0.787, + 0.272 + ], + "angle": 0, + "content": "33. Prabhu, V., Khare, S., Kartik, D., Hoffman, J.: Sentry: Selective entropy optimization via committee consistency for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8558-8567 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.273, + 0.787, + 0.3 + ], + "angle": 0, + "content": "34. Qian, N.: On the momentum term in gradient descent learning algorithms. Neural networks 12(1), 145-151 (1999)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.3, + 0.787, + 0.342 + ], + "angle": 0, + "content": "35. Rangwani, H., Aithal, S.K., Mishra, M., Jain, A., Radhakrishnan, V.B.: A closer look at smoothness in domain adversarial training. In: International Conference on Machine Learning. pp. 18378-18399. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.342, + 0.787, + 0.384 + ], + "angle": 0, + "content": "36. Saito, K., Watanabe, K., Ushiku, Y., Harada, T.: Maximum classifier discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.384, + 0.787, + 0.411 + ], + "angle": 0, + "content": "37. Shen, D., Wu, G., Suk, H.I.: Deep learning in medical image analysis. Annual Review of Biomedical Engineering 19, 221-248 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.411, + 0.787, + 0.467 + ], + "angle": 0, + "content": "38. Shin, I., Woo, S., Pan, F., Kweon, I.S.: Two-phase pseudo label densification for self-training based domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 532-548. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.467, + 0.787, + 0.563 + ], + "angle": 0, + "content": "39. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 596-608. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/06964dce9adbb1c5cb5d6e3d9838f733-Paper.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.564, + 0.787, + 0.618 + ], + "angle": 0, + "content": "40. Tian, Y., Yu, X., Fu, S.: Partial label learning: Taxonomy, analysis and outlook. Neural Networks 161, 708-734 (2023). https://doi.org/https://doi.org/10.1016/j.neunet.2023.02.019, https://www.sciencedirect.com/science/article/pii/S0893608023000825" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.619, + 0.787, + 0.66 + ], + "angle": 0, + "content": "41. Tzeng, E., Hoffman, J., Saenko, K., Darrell, T.: Adversarial discriminative domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.66, + 0.787, + 0.702 + ], + "angle": 0, + "content": "42. Venkateswara, H., Eusebio, J., Chakraborty, S., Panchanathan, S.: Deep hashing network for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 5018-5027 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.702, + 0.787, + 0.742 + ], + "angle": 0, + "content": "43. Wang, X., Zhuo, J., Zhang, M., Wang, S., Fang, Y.: Revisiting unsupervised domain adaptation models: A smoothness perspective. In: Proceedings of the Asian Conference on Computer Vision. pp. 1504-1521 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.742, + 0.787, + 0.799 + ], + "angle": 0, + "content": "44. Wei, G., Lan, C., Zeng, W., Chen, Z.: Metaalign: Coordinating domain alignment and classification for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16643-16653 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.799, + 0.787, + 0.84 + ], + "angle": 0, + "content": "45. Wei, G., Lan, C., Zeng, W., Zhang, Z., Chen, Z.: Toalign: task-oriented alignment for unsupervised domain adaptation. Advances in Neural Information Processing Systems 34, 13834-13846 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "A. Dayal et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.217 + ], + "angle": 0, + "content": "46. Wen, H., Cui, J., Hang, H., Liu, J., Wang, Y., Lin, Z.: Leveraged weighted loss for partial label learning. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 11091-11100. PMLR (18-24 Jul 2021), https://proceedings.mlr.press/v139/wen21a.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.787, + 0.286 + ], + "angle": 0, + "content": "47. Wu, D.D., Wang, D.B., Zhang, M.L.: Revisiting consistency regularization for deep partial label learning. In: Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., Sabato, S. (eds.) Proceedings of the 39th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 162, pp. 24212-24225. PMLR (17-23 Jul 2022), https://proceedings.mlr.press/v162/wu221.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.287, + 0.787, + 0.342 + ], + "angle": 0, + "content": "48. Xie, X., Chen, J., Li, Y., Shen, L., Ma, K., Zheng, Y.: Self-supervised cyclegan for object-preserving image-to-image domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 498-513. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.343, + 0.787, + 0.383 + ], + "angle": 0, + "content": "49. Yan, Y., Guo, Y.: Partial label unsupervised domain adaptation with class-prototype alignment. In: The Eleventh International Conference on Learning Representations (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.787, + 0.425 + ], + "angle": 0, + "content": "50. Zhang, Y., Liu, T., Long, M., Jordan, M.: Bridging theory and algorithm for domain adaptation. In: Proceedings of the 36th International Conference on Machine Learning (ICML) (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.787, + 0.467 + ], + "angle": 0, + "content": "51. Zhou, L., Ye, M., Zhu, X., Xiao, S., Fan, X.Q., Neri, F.: Homeomorphism alignment for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18699-18710 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.467 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_origin.pdf b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e8c941437c38cb6a4de64427b78ffc3d098f036c --- /dev/null +++ b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/e7e2c6ed-a62d-4400-8f90-9a1cb70fa321_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e05b9b789fe2a4b2c09e54f7be76d56aa39afb0ec9631ccc579221e316763f98 +size 2665401 diff --git a/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/full.md b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/full.md new file mode 100644 index 0000000000000000000000000000000000000000..6bb9d27f548c9d8e345fe9f65d265bd5358e578a --- /dev/null +++ b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/full.md @@ -0,0 +1,261 @@ +# Improving Unsupervised Domain Adaptation: A Pseudo-Candidate Set Approach + +Aveen Dayal $^{1}$ , Rishabh Lalla $^{1}$ , Linga Reddy Cenkeramaddi $^{2}$ , C Krishna Mohan $^{1}$ , Abhinav Kumar $^{1}$ , and Vineeth N Balasubramanian $^{1}$ + +$^{1}$ Indian Institute of Technology Hyderabad, Hyderabad 502285, India {ai21resch11003@, rishabh.lalla@cse., ckm@cse., abhinavkumar@ee., vineethnb@cse.}iith.ac.in +2 University of Agder, Grimstad 4879, Norway linga.cenkeramaddi@uia.no + +Abstract. Unsupervised domain adaptation (UDA) is a critical challenge in machine learning, aiming to transfer knowledge from a labeled source domain to an unlabeled target domain. In this work, we aim to improve target set accuracy in any existing UDA method by introducing an approach that utilizes pseudo-candidate sets for labeling the target data. These pseudo-candidate sets serve as a proxy for the true labels in the absence of direct supervision. To enhance the accuracy of the target domain, we propose Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), a method which effectively learns to disambiguate among classes in the pseudo-candidate set. Our approach is characterized by two distinct loss functions: one that acts on the pseudo-candidate set to refine its predictions and another that operates on the labels outside the pseudo-candidate set. We use a threshold-based strategy to further guide the learning process toward accurate label disambiguation. We validate our novel yet simple approach through extensive experiments on three well-known benchmark datasets: Office-Home, VisDA, and DomainNet. Our experimental results demonstrate the efficacy of our method in achieving consistent gains on target accuracies across these datasets. + +Keywords: Unsupervised Domain Adaptation $\cdot$ Disambiguation $\cdot$ Pseudo-Candidate Set + +# 1 Introduction + +In recent years, Deep Neural Networks (DNNs) have showcased remarkable achievements in multiple domains such as robotics [19], medical imaging [37], agriculture [17], and beyond. However, in the realm of deep learning, domain shift presents a significant challenge as it occurs when the training set and the test set exhibit different data distributions, leading to a degradation in model performance [1, 29]. Unsupervised Domain Adaptation (UDA) has emerged as a prominent setting to address such challenges. UDA aims to adapt a model trained on a labeled training set (source domain) to perform well on an unlabeled + +test set (target domain) by minimizing the domain discrepancy and leveraging the intrinsic structure of the target domain [11, 41]. This adaptation is crucial for deploying deep learning models in dynamic environments where obtaining labeled data for every possible domain is impractical [6]. For instance, [16] explains how UDA techniques can be applied to bridge the gap between simulated and real-world domains, a common challenge in robotics. + +To address the UDA problem, two prominent categories of methods have emerged: adversarial and self-training approaches. Adversarial methods, such as Domain-Adversarial Neural Networks (DANN) [11], Maximum Classifier Discrepancy (MCD) [36], and Margin Disparity Discrepancy (MDD) [50], focus on minimizing the domain discrepancy by aligning the feature distributions of the source and target domains through adversarial training. On the other hand, self-training techniques, exemplified by works like Cycle Self-Training (CST) [22], and Minimum Class Confusion (MCC) [15], leverage the model's predictions on the target domain to iteratively refine the model, aiming to improve its generalization to the target domain. Apart from these, hybrid approaches that integrate both adversarial and self-training paradigms for effective adaptation across domains have also been proposed [3,24,43]. These approaches have shown promising results in addressing the challenges of domain shift in UDA. + +Despite these existing efforts in the field of UDA, we recognize an opportunity to further enhance performance in the target domain. Inspired by the use of candidate sets in partial-label learning [10, 40], we present a novel perspective to address the UDA problem by analyzing the patterns in the predictions of trained UDA models. As illustrated in Fig. 1, we observe that for multiple target samples, the trained UDA model's predictions are ambiguous, i.e., the model is not very confident about its predictions. Furthermore, we observe that this ambiguity is not uniformly distributed across all classes; instead, it is predominantly concentrated in a few closely related classes that exhibit the highest predicted probabilities, thereby leading to this ambiguity. To tackle this ambiguity, we introduce a novel technique, Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), which refines the predictions within the target domain. UDPCS starts by creating a pseudo-candidate set for each target sample, consisting of potential true labels based on the UDA model's predictions. Subsequently, inspired by [25], we propose a disambiguation process which is applied to these pseudo-candidate sets. Additionally, our method extends supervision beyond the pseudo-candidate set, penalizing predictions that stray into other classes. As illustrated in Fig. 1, the proposed UDPCS method effectively refines the UDA model's predictions by resolving ambiguity. It achieves this by identifying the potentially correct label and increasing its confidence. The efficacy of UDPCS is demonstrated through extensive experiments on various benchmark UDA datasets, showcasing its potential to enhance target accuracy in UDA models. + +The following are the main contributions of this work:(i) We introduce the concept of a pseudo-candidate set, which is generated from the predictions of the UDA model. To the best of our knowledge, this work is the first to use the idea + +of pseudo-candidate set in the UDA setting; (ii) We propose a novel refinement technique for UDA, UDPCS, by leveraging the identified pseudo-candidate sets; and (iii) We study the proposed method by conducting extensive experiments on multiple UDA benchmark datasets, observing consistent performance gains across various datasets and UDA methods. + +![](images/31926731aa098e734b1ece635bb48147c90007b8817abe675d770b478265d9d5.jpg) +Fig. 1: Comparison of predictions between the trained UDA model (MDD [50]) and the proposed UDPCS method after refining the trained UDA model on the VisDA dataset for five target samples. + +# 2 Related Work + +This section discusses the earlier literature that was proposed specifically related to UDA and the disambiguation process inspired by partial-label learning. + +UDA aims to perform well on the unlabeled target domain by leveraging the labeled source data. Inspired by the theoretical analysis [1], learning domain-invariant features has emerged as a pivotal approach. This concept has given rise to one of the most prevalent methodologies for addressing UDA challenges: adversarial methods. Inspired by GAN, the key principle behind adversarial methods is to minimize the domain shift through a minimax optimization strategy. [11] introduced DANN, a pioneering work that employs a deep learning-based adversarial approach for UDA using a generator and a domain discriminator. Bi-classifier approaches, as proposed by [36] and [20], propose an adversarial approach involving a single feature extractor and two classifiers. [50] introduced a novel disparity discrepancy method, Margin Disparity Discrepancy (MDD), to learn domain invariant features. Various other adversarial methods + +include [9,12,14,23,35,44,45]. Another significant avenue in UDA is self-training, where the model iteratively enhances its predictions to perform effectively on the target domain. Minimum Class Confusion (MCC), as proposed by [15], introduces a novel loss function that minimizes class confusion, leading to improved transfer gains. Additionally, Cycle Self-Training (CST), presented in [22], advocates for a cyclic self-training approach that refines target pseudo-labels in two steps and by leveraging Tsallis entropy as a regularizer. Various other methodologies in this category include [5, 26, 38]. Beyond these techniques, alternative methods such as optimal transport [18, 28, 32], moment matching [2, 21], and self-supervised techniques [4, 48], have been proposed to address UDA challenges. Notably, recent years have witnessed the emergence of several hybrid approaches, which typically amalgamate different categories of techniques [3, 24, 27, 33, 43, 51]. In this work, we introduce a novel perspective for tackling the UDA problem by analyzing the predictions of any trained UDA model on the target domain. Our proposed method is designed to iteratively refine the UDA model's prediction on the target domain. + +Disambiguation is a key aspect of partial label learning (PLL). The PRODEN method [25] is a pivotal work in PLL that employs an iterative strategy for refining candidate sets, directly targeting label disambiguation. Following PRODEN, recent advancements have continued to refine the disambiguation process in PLL. LWC [46] introduces a weighted loss function that prioritizes probable labels within candidate sets, enhancing the disambiguation process. CR [47] introduces consistency regularization in PLL for disambiguating the labels. These developments highlight the importance of refining disambiguation processes for accurate learning outcomes. In this work, inspired from [25], we introduce the concept of pseudo-candidate set and propose a disambiguation process on these pseudo-candidate sets. Unlike [49], which introduces a hybrid setting between UDA and PLL, our work focuses on leveraging the concepts from PLL to refine the predictions on the target domain in UDA. + +# 3 UDPCS: Methodology + +Preliminaries. This section describes the basic assumptions and notations for classification problems in UDA. In a typical UDA framework, three key components are involved: a feature extractor $(\mathcal{G})$ , a classifier $(f)$ , and a domain adaptive component. The source and target domains are denoted by $\mathcal{D}_S$ and $\mathcal{D}_T$ , respectively. The term $\mathcal{D}$ refers to any of these domains when the index is irrelevant. Throughout this work, the terms 'domain' and 'distribution' are used interchangeably. Each such domain $\mathcal{D} \subseteq \mathcal{X} \times \mathcal{Y}$ , where $\mathcal{X}$ is an input space and $\mathcal{Y}$ is the output (label) space, which is $\{0,1\}$ in binary classification and $\{1,\dots,k\}$ in multi-class classification. The term $\hat{D}$ is used to denote a set of samples drawn independently from $\mathcal{D}$ , i.e. $\hat{D} = \{(x_i,y_i)\}_{i=1}^n$ where $x_i \in \mathcal{X}$ and $y_i \in \mathcal{Y}$ , $\forall i \in \{1,2,\ldots,n\}$ . We use $(x,y)$ to refer to a sample $(x_i,y_i)$ when the index is irrelevant. We define the model, $h(x) = f(\mathcal{G}(x))$ , where $h: \mathcal{X} \to \mathbb{R}^k$ , with each dimension of the output representing the class + +probability for each class. We also use $Z$ to refer to the pseudo-candidate set where $Z \subset \mathcal{Y}$ . + +Methodology. We now present the methodology of our proposed approach, UDPCS, designed to enhance the accuracy of the target domain by leveraging pseudo-candidate sets. In the standard UDA setting, we assume that the training data consists of a labeled source domain, $\mathcal{D}_S$ , and an unlabeled target domain, $\mathcal{D}_T$ . The primary objective of a UDA method is to perform well on unlabeled target data. This is generally accomplished by employing a classification loss and an adaptation loss that minimizes the discrepancy between the source and target features. Over time, various adaptation loss functions have been proposed, depending on the specific UDA method employed [15,43,50]. Our proposed UDPCS method builds upon these standard techniques to further improve UDA performance with minimal overhead. We now describe our methodology and then illustrate it with a toy example. + +In order to serve as a refinement strategy over any UDA method, we first train the UDPCS model $h(.)$ using any off-the-shelf UDA algorithm. Once the UDA training is complete, we employ the trained model $h(.)$ to generate a pseudocandidate set for target data, as below. + +$$ +Z = \{j | h _ {j} (x) > \tau , \forall j \in \{1, \dots , k \} \}, \tau > 0 \tag {1} +$$ + +For each input $x$ , $Z$ represents the pseudo-candidate set consisting of class indices $j$ for which the corresponding class prediction probability, $h_j(x)$ , exceeds a predefined threshold $\tau$ . This approach allows us to include only those classes in the pseudo-candidate set that have a relatively higher likelihood of being the true label, as indicated by the model $h(.)$ . We further define a non-candidate set as the complement of the pseudo-candidate set, i.e., all class indices not in $Z$ . + +Subsequently, for the refinement of the model's predictions in the target domain, our method is trained by utilizing an objective that consists of two loss functions: candidate loss $L_{c}$ and non-candidate loss $L_{nc}$ . These loss functions are each described below. + +Candidate Loss. This loss guides the model $h(\cdot)$ to align its predictions with the pseudo-candidate set. We introduce a label confidence vector $\boldsymbol{w} \in \mathbb{R}^k$ , representing the confidence for all $k$ classes. Each element $w_j$ in this vector signifies the confidence assigned to class $j$ . We ensure that $\sum_{j \in Z} w_j = 1$ and $w_j = 0 \forall j \notin Z$ , meaning that the confidence values $w_j$ are assigned only to classes present in the pseudo-candidate set, and set to 0 otherwise. Consequently, $\boldsymbol{w}$ serves as a distribution over the classes in the pseudo-candidate set. The candidate loss applied to the pseudo-candidate set is then defined as: + +$$ +L _ {c} = \left\{ \begin{array}{l l} K L (\boldsymbol {w} | | h (\mathcal {A} _ {1} (x)) & \text {i f} \max (h (\mathcal {A} _ {1} (x))) < \gamma \\ 0 & \text {o t h e r w i s e} \end{array} , \gamma < 1 \right. \tag {2} +$$ + +The candidate loss is applied to samples for which the model's maximum predicted class probability falls below a certain threshold $\gamma$ . Rather than using the raw input $x$ , we utilize a strongly augmented version, $\mathcal{A}_1(x)$ , as the input. Inspired by FixMatch [39], for strong augmentations, we leverage Cutout [8] and + +RandAugment [7], which produce heavily distorted versions of the given input $x$ . The rationale behind employing strong augmentation and thresholding is to differentiate between samples based on the model's predictions. For samples where the model's prediction is just above the threshold $\gamma$ , the strong augmentation is likely to lower the prediction values, thereby including these samples in the candidate loss $L_{c}$ . Conversely, for samples where the model's predictions are very high, even after strong augmentation, the predictions remain robust and above the threshold. Consequently, these samples are excluded from the candidate loss, ensuring that the loss is primarily applied to samples where the model's predictions are less certain. This loss is calculated as the Kullback-Leibler (KL) divergence between the label confidence vector $\mathbf{w}$ and the model's predictions $h(\mathcal{A}_1(x))$ . Thus, in this way, the candidate loss aligns the pseudo-candidate set distribution and the model's prediction distribution. + +Non-Candidate Loss. This loss is applied to the elements outside the pseudocandidate set as: + +$$ +L _ {n c} = - \sum_ {j \notin Z} \log \left(1 - h _ {j} \left(\mathcal {A} _ {2} (x)\right)\right) \tag {3} +$$ + +The motivation for the non-candidate loss is that it penalizes the model for assigning high probabilities to classes that are not in the pseudo-candidate set $Z$ . It is computed as the negative log-likelihood of the complement probabilities for classes outside $Z$ , using the model's predictions $h(\mathcal{A}_2(x))$ after applying a weak augmentation $\mathcal{A}_2$ to the input $x$ . We use a standard flip-and-shift augmentation as our weak $\mathcal{A}_2$ . This loss discourages the model from considering classes outside the pseudo-candidate set as potential true labels. + +Overall Objective. The overall objective function of the proposed UDPCS model is the sum of the candidate and non-candidate loss terms: + +$$ +L o s s = L _ {c} + \lambda L _ {n c} \tag {4} +$$ + +where $\lambda$ is a hyperparameter that balances the contributions of the two loss functions. + +Updating $\boldsymbol{w}$ . As in Eqn. (2), the vector $\boldsymbol{w}$ plays a crucial role in guiding the model's predictions. Therefore, updating $\boldsymbol{w}$ after each iteration is essential for disambiguation of the pseudo-candidate set. We set the label confidence $\boldsymbol{w}$ initially to $\frac{1}{|Z|}$ if the class $j$ is in the pseudo-candidate set $Z$ , where $|Z|$ denotes the cardinality of $Z$ . This ensures that each class in the pseudo-candidate set receives an equal initial confidence value. The rationale for assigning an equal initial confidence value to each class in the pseudo-candidate set is to enable the proposed UDPCS method to disambiguate the correct class from a set of classes without bias. This scheme is given below: + +$$ +w _ {j} = \left\{ \begin{array}{l l} \frac {1}{| Z |} & \text {i f} j \in Z \\ 0 & \text {o t h e r w i s e} \end{array} , \boldsymbol {w} \in \mathbb {R} ^ {k} \right. \text {a n d} \sum_ {j \in Z} w _ {k} = 1 \tag {5} +$$ + +Algorithm 1 Unsupervised Domain Adaptation refinement using pseudo-candidate sets (UDPCS) +1: Input: Source domain data $D_S = \{x_i^S, y_i^S\}_{i=1}^{n_S}$ , target domain data $D_T = \{x_j^T\}_{j=1}^{n_T}$ , learning rate $\eta$ , number of iterations $T$ , refinement iterations $T_{\mathrm{refine}}$ , strong augmentation $\mathcal{A}_1$ , weak augmentation $\mathcal{A}_2$ . +2: Output: Refined model $h$ +3: Initialize model $h$ with random weights +4: for $t = 1$ to $T$ do +5: $(x^S, y^S) \sim D_S$ and $(x^T) \sim D_T$ +6: Update the parameters of $h$ utilizing $(x^S, y^S)$ and $(x^T)$ in accordance with any standard unsupervised domain adaptation technique. +7: end for +8: Generate the pseudo-candidate set 'Z' for each sample in $D_T$ using Eqn. (1) +9: Initialize the label confidence vector 'w' using Eqn. (5) +10: for $t = 1$ to $T_{\mathrm{refine}}$ do +11: $(x^T) \sim D_T$ , with augmentations $\mathcal{A}_1(x^T)$ and $\mathcal{A}_2(x^T)$ +12: Compute the candidate loss $L_c$ using Eqn. (2) +13: Compute the non-candidate loss $L_{nc}$ using Eqn. (3) +14:Compute the final loss, $Loss = L_c + \lambda L_{nc}$ +15: Update the label confidence vector using Eqn. (6) +16:Update model $h$ using gradient descent: $h \gets h - \eta \nabla Loss$ +17: end for +18: return $h$ + +After each iteration, the vector $\pmb{w}$ is dynamically updated based on the model's predictions $h(\mathcal{A}_1(x))$ , as below: + +$$ +w _ {j} = \left\{ \begin{array}{l l} \frac {h _ {j} \left(\mathcal {A} _ {1} (x)\right)}{\sum_ {m \in Z} h _ {m} \left(\mathcal {A} _ {1} (x)\right)} & \text {i f} j \in Z \\ 0 & \text {o t h e r w i s e} \end{array} \right. \tag {6} +$$ + +As in Eqn. (6), the confidence $w_{j}$ for each class $j$ in the pseudo-candidate set $Z$ is updated to be proportional to the model's prediction probability for that class, normalized by the sum of prediction probabilities for all classes in $Z$ . This update ensures that $w_{j}$ reflects the model's current confidence in each class within the pseudo-candidate set, facilitating the disambiguation process. + +Therefore, by iteratively updating the model $h(.)$ using the aforementioned components, the proposed UDPCS improves the model's ability to disambiguate the correct class from the pseudo-candidate set, leading to more accurate and confident predictions on the target domain. Our overall method is summarized in Algorithm 1. We begin by training the proposed model $h(.)$ using a standard UDA technique. We then generate the pseudo-candidate set and initialize the label confidence vector. Subsequently, the method undergoes iterative training, incorporating both candidate and non-candidate loss in each iteration. We now illustrate our approach using a toy example. + +Toy Example. To illustrate the working of our method, the toy example in Fig. 2 shows how the proposed UDPCS technique refines a model's predictions. In particular, we demonstrate a single iteration after UDA training. As shown in the figure, we consider a 5-class classification problem with labeled source data, unlabeled target data consisting of 5 samples from $S1$ to $S5$ and a model $h_{UDA}(.)$ trained using any off-the-shelf UDA technique. The unseen true labels + +![](images/796389c81a9d420af10b924cea25d3dc882f9e13c658a4cd29ee1c2c81dcd2a8.jpg) +Fig. 2: Illustration of the toy example for demonstrating our UDPCS method. The figure visualizes the process of refining the predictions of a base UDA model by leveraging pseudo-candidate sets. + +for these 5 target samples are assigned such that sample $j$ is labeled as class $j$ , $\forall j \in \{1,2,\ldots,5\}$ . + +As mentioned earlier in this section, after UDA training, our UDPCS method generates the pseudo-candidate set $Z$ using model predictions $h_{UDA(\cdot)}$ and with $\tau = 0.1$ , according to Eqn. (1), for each target sample. The cardinality of these pseudo-candidate sets for this example ranges from 2 to 4 in Fig. 2. These sets are then utilized to generate the label confidence vector $\pmb{w}$ , which, as previously discussed, is initialized with uniform confidence values according to Eqn. (5) (to avoid error bias from the base model). This $\pmb{w}$ , along with the pseudo-candidate sets, is then used to refine the model's prediction by updating its parameters using Eqn. (4). In the next iteration, 'Step = 1' in the figure, this refined model generates predictions on the target set, which is then used to get the disambiguated vector $\pmb{w}$ according to Eqn. (6). + +As in the figure, the refined model's predictions for each sample definitively impacts model accuracy. After initial UDA model training, the model correctly predicted $S1$ , $S2$ , and $S3$ , but incorrectly predicted $S4$ and $S5$ , resulting in $60\%$ accuracy. Whereas after the refinement, $S4$ is correctly disambiguated, while the confidence in predictions for $S1$ , $S2$ , and $S3$ has increased. For sample $S5$ , the disambiguation could not identify the correct label in the first iteration. These changes in predictions increased the model's accuracy from $60\%$ to $80\%$ . It is also noticeable that the prediction probabilities of classes outside the candidate set have reduced, which can be attributed to the non-candidate set loss. Thus, the proposed method improves UDA performance by refining the model's predictions. We show later in our experiments that with this little overhead, we outperform the base UDA model across different baselines, even when the baseline is allowed the same additional training time. + +# 4 Experiments + +Datasets: We conduct a comprehensive evaluation of our proposed UDPCS method on several benchmark UDA datasets, including VisDA [31], DomainNet [30], and OfficeHome [42]. Each dataset poses unique challenges for domain adaptation. The VisDA dataset, for instance, exhibits a significant domain gap between the source and target domains, encompassing 12 classes. The DomainNet dataset, on the other hand, offers a broader label space with 365 classes, presenting a different set of challenges. Lastly, the OfficeHome dataset, with its relatively limited number of samples across all domains, necessitates efficient adaptation strategies. Further details about these datasets are provided in the Appendix. + +Implementation Details and Baselines: Consistent with recent benchmarks [24, 51], we employ the ResNet50 model as the feature extractor for the Office-Home dataset and the ResNet101 model for the VisDA and DomainNet datasets. Our method is trained using stochastic gradient descent with momentum [34]. Additional implementation details, such as hyperparameters including threshold values, learning rates, etc., are detailed in the Appendix. Our UDPCS method enhances off-the-shelf UDA techniques; hence, we evaluate its effectiveness against a range of UDA methods such as MDD [50], MCC [15], LeCo [43], SDAT [35], and NWD [3], which encompass diverse approaches like adversarial and self-training. We benchmark our model by comparing the performance of these UDA methods with and without the application of our UDPCS technique. Additionally, we contrast our method with other recent benchmarks in Appendix A1. In our result tables, (Tab. 1 to Tab. 3), the performance of our UDPCS method is denoted as 'UDA method+Ours,' where 'UDA method' indicates the base method upon which UDPCS is applied. + +Results on VisDA: The VisDA dataset presents a single adaptation scenario, from synthetic (source) to real-world (target) domains. Class-wise target accuracy results on the VisDA dataset are detailed in Tab. 1. As seen in Tab. 1, the UDPCS method enhances mean accuracy across five different UDA methods. Notably, the maximum improvement, a $2.4\%$ gain, is observed when UDPCS is applied to both the MCC and NWD models. The VisDA dataset is known for its large domain gap between the source and target domains. Despite this challenge, UDPCS achieves an average gain of $2\%$ in target accuracy, as demonstrated in Tab. 1, highlighting its efficacy in refining model predictions. + +Results on DomainNet: In line with the settings from [13, 43], we carry out experiments on 12 tasks involving clipart (c), painting (p), real (r), and sketch (s) domains from the original DomainNet dataset. The detailed results for all tasks are showcased in Tab. 2. As indicated in Tab. 2, the UDPCS method surpasses the performance of each underlying UDA method, with a maximum gain of $3.5\%$ in average target accuracy. As seen from Tab. 2, our method, 'MDD+Ours,' achieves the best performance compared to all the other methods. Despite DomainNet's challenge of a vast label space with 365 classes, the UDPCS method achieves an average gain of $1.6\%$ in target accuracy, showcasing the robustness and effectiveness of our approach. + +Table 1: Accuracy(%) on VisDA dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. Mean denotes Mean Accuracy. Appendix A1 presents additional results. + +
ModelplanebcyblbuscarhorseknifemcyclepersnplantsktbtraintruckMeanGains
MDD(ICML'19)94.675.068.570.291.494.391.579.791.688.484.336.880.5
+Ours96.176.869.372.493.396.592.580.592.689.786.838.682.11.6
MCC(ECCV'20)94.585.974.571.693.994.985.982.391.491.782.457.483.8
+Ours96.288.477.673.795.197.789.583.794.593.485.259.186.22.4
LeCo(ACCV'22)96.187.585.889.695.696.290.882.794.491.184.441.986.3
+Ours97.588.685.589.997.397.193.384.896.493.787.245.288.01.7
SDAT(ICML'22)94.682.977.067.493.697.192.482.692.887.085.652.283.8
+Ours95.684.679.376.094.998.192.783.994.490.688.148.785.61.8
NWD (CVPR'22)93.983.976.673.293.191.085.780.991.890.082.051.282.8
+Ours96.087.478.677.294.593.889.183.293.894.383.651.585.22.4
Average Gains2
+ +Table 2: Accuracy(%) on DomainNet dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results. + +
Modelc-pc-rc-sp-cp-rp-sr-cr-pr-ss-cs-ps-rAvg.Gains
CDAN (NeurIPS'18)40.456.846.145.158.440.555.653.643.057.246.455.749.9
+Ours43.759.147.745.959.24258.253.745.75948.257.851.71.8
MDD (ICML'19)42.859.248.349.259.643.658.854.146.659.146.757.852.2
+Ours46.763.551.451.162.346.363.157.750.763.450.361.955.73.5
MCC (ECCV'20)37.155.641.445.559.939.754.353.136.858.246.556.148.7
+Ours39.156.643.047.260.641.156.455.038.859.147.057.750.11.4
SDAT (ICML'22)41.957.247.247.860.242.356.553.942.760.448.057.551.3
+Ours43.758.147.948.159.443.056.053.143.858.747.657.751.40.1
Average Gains1.7
+ +Results on OfficeHome: The OfficeHome dataset encompasses 12 tasks across the Art (A), Clipart (C), Product (P), and Real World (R) domains. Target accuracy results for all tasks are presented in Tab. 3. As evident in Tab. 3, the UDPCS method surpasses the performance of the underlying UDA methods, with a maximum gain of $1.8\%$ in average target accuracy. As seen from Tab. 3, our methods, 'MCC+Ours' and 'NWD+Ours,' achieves the best performance compared to all the other methods. Although OfficeHome presents a challenge with its relatively small sample size per domain, the UDPCS technique still manages to achieve an average gain of $0.9\%$ , demonstrating its effectiveness. + +# 5 More Empirical Analysis and Ablation Studies + +Ablation Studies: To assess the impact of various components of the proposed UDPCS method, we conduct ablation studies and present the results in Tab. 4. The table outlines experiments on three key components: candidate loss $(L_{c})$ + +Table 3: Accuracy(%) on OfficeHome dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results. + +
ModelA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.Gains
MDD (ICML'19)75.556.27963.172.572.663.155.179.773.360.183.669.5-
+Ours77.657.880.565.475.175.465.156.581.674.161.384.771.31.8
MCC(ECCV'20)79.858.183.268.676.678.667.855.582.274.460.885.872.6
+ Ours81.159.384.169.27879.669.156.482.874.762.186.473.61
Leco (ACCV'22)78.758.382.468.679.179.367.556.282.67560.98672.9
+Ours79.159.282.768.879.479.367.756.982.675.261.186.473.20.3
SDAT(ICML'22)77.258.981.266.675.876.863.95781.875.164.885.872.1
+Ours78.159.782.16776.37764.457.682.675.265.28672.60.5
NWD(CVPR'22)80.158.183.467.977.278.667.955.78274.160.785.772.6-
+Ours80.959.183.968.6798068.556.783.274.962.186.773.61
Average Gains0.9
+ +non-candidate loss $(L_{nc})$ , and a threshold $(\gamma)$ , with a tick mark indicating the inclusion of a component in a particular experiment. The absence of all ticks denotes the use of the base UDA method without our refinement. We evaluate two base UDA methods, MDD and MCC, on the OfficeHome dataset, as detailed in Tab. 4. For the MDD+Ours model, introducing candidate loss $(L_{c})$ yields a $1.2\%$ increase in average accuracy, while adding non-candidate loss $(L_{nc})$ brings a similar enhancement of $1.1\%$ . The inclusion of thresholding $(\gamma)$ , particularly with candidate loss, leads to a $1.6\%$ improvement, emphasizing the value of focusing on ambiguous samples. The combination of both losses, without the threshold, results in a $1.4\%$ uptick, and the full UDPCS model, integrating all components, achieves the highest gain of $1.8\%$ over the base MDD model. In the MCC+Ours model, the addition of candidate loss and non-candidate loss individually contributes to improvements of $0.4\%$ and $0.7\%$ , respectively. The integration of thresholding, either alone or with other components, consistently enhances performance, with the full UDPCS model outperforming the base MCC model by $1\%$ . These findings highlight the synergistic effect of combining candidate loss, non-candidate loss, and thresholding, underscoring the comprehensive effectiveness of the UDPCS method in boosting average accuracy. + +Complexity Analysis: The complexity analysis of the UDPCS method, as presented in Table A1 in the Appendix, illustrates its efficiency in terms of training time while achieving improvements in average accuracy. The UDPCS method achieves higher average accuracy without incurring any significant training time. Please see the Appendix for the complete discussion. + +Hyperparameter $\lambda$ : The exploration of the hyperparameter $\lambda$ , which balances the candidate loss $(L_{c})$ and the non-candidate loss $(L_{nc})$ in the total loss equation $(L_{c} + \lambda L_{nc})$ , reveals its impact on the performance of the UDPCS method, as shown in Table 5. We run each of the experiment three times to report the average values. For the MDD+Ours model, setting $\lambda = 0.5$ results in an aver + +Table 4: Ablation results (%) on OfficeHome dataset assessing the impact of UDPCS components. + +
Model\(L_c\)\(L_{nc}\)γA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours75.556.27963.172.572.663.155.179.773.360.183.669.5
✓76.95880.264.874.774.863.655.980.973.561.18470.7
✓76.857.379.765.474.575.164.555.780.273.460.583.970.6
✓✓77.458.180.664.475.274.66556.581.473.861.384.471.1
✓✓77.157.680.564.574.875.164.556.481.2746184.370.9
✓✓✓77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours79.858.183.268.676.678.667.855.582.274.460.885.872.6
✓80.45983.869.177.378.76856.58274.261.485.973
✓80.358.88469.277.279.768.555.882.975.161.586.273.3
✓✓80.758.783.56977.178.468.656.782.374.6628673.1
✓✓80.458.88468.877.578.96856.282.974.161.58673.1
✓✓✓81.159.384.169.27879.669.156.482.874.762.186.473.6
+ +age accuracy of $71.1\%$ , which slightly improves to $71.2\%$ when $\lambda = 1$ . Further increasing $\lambda$ to 2 maintains the average accuracy of $71.2\%$ , suggesting a robust performance across different values of $\lambda$ . Similarly, for the MCC+Ours model, the average accuracy is $73.6\%$ for all the $\lambda$ values with slight variations in the standard deviation values. These findings indicate that the UDPCS method is relatively stable across a range of $\lambda$ values, with minor fluctuations in average accuracy. This stability underscores the method's robustness and the effectiveness of the balanced approach to handling candidate and non-candidate losses in refining predictions for domain adaptation tasks. Please see the Appendix for the complete results of this analysis. + +Table 5: Accuracy(%) of UDPCS for different $\lambda$ values on OfficeHome dataset. + +
λA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
λ = 0.577.258.280.664.875.374.965.156.581.073.961.484.571.1 ±0.1
λ = 177.558.080.665.375.275.165.056.581.674.161.484.571.2±0.02
λ = 277.357.980.865.175.075.365.156.681.574.061.384.471.2±0.01
MCC+Ours
λ = 0.580.959.183.869.677.879.668.956.683.274.862.186.673.6±0.05
λ = 181.059.184.369.377.979.668.956.683.274.762.086.573.6±0.06
λ = 280.959.284.269.278.079.668.956.782.974.862.486.673.6±0.1
+ +Weak Augmentation: The exploration of weak augmentation $\mathcal{A}_2$ in the candidate set loss for the UDPCS method, as compared to the main results obtained using strong augmentation $\mathcal{A}_1$ , reveals interesting insights into the method's performance, as shown in Table 6. For the MDD+Ours model, employing weak augmentation results in an average accuracy of $69.6\%$ , which is lower than the $71.3\%$ achieved with strong augmentation. Similarly, the MCC+Ours model ex + +hibits a decrease in average accuracy from $73.6\%$ with strong augmentation to $72.8\%$ with weak augmentation. These findings suggest that strong augmentation plays a crucial role in the effectiveness of the UDPCS method, particularly in refining predictions for domain adaptation tasks. Further augmentation related experiments are reported in the Appendix. + +Table 6: Accuracy(%) of UDPCS for different augmentation used on OfficeHome dataset. (Aug. = Augmentation) + +
Aug.A-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
Weak76.356.47963.373.573.663.154.779.37359.783.169.6
Strong77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
Weak79.958.283.269.176.878.567.656.781.974.161.28672.8
Strong81.159.384.169.27879.669.156.482.874.762.186.473.6
+ +Threshold $\gamma$ : The examination of different threshold values $(\gamma)$ used in the candidate loss, Eqn. (2), of the UDPCS method provides insights into the method's sensitivity to this hyperparameter, as shown in Table 7. For the MDD+Ours model, the average accuracy remains consistent at $71.1\%$ for both $\gamma = 0.8$ and $\gamma = 0.9$ , with a slight increase to $71.3\%$ when $\gamma = 0.85$ . Similarly, for the MCC+Ours model, the average accuracy is stable at $73.5\%$ for $\gamma = 0.8$ and $\gamma = 0.9$ , with a marginal increase to $73.6\%$ at $\gamma = 0.85$ . The slight variations in average accuracy suggest that while the choice of threshold can influence the method's performance, the UDPCS method is not overly sensitive to this hyperparameter. + +Table 7: Accuracy(%) of UDPCS for different threshold ( $\gamma$ ) values on OfficeHome dataset. + +
A-P A-C A-R C-A C-P C-R P-A P-C P-R R-A R-C R-P Avg.
MDD+ours
γ = 0.877.158.580.864.975.174.964.756.581.673.861.3
γ = 0.8577.657.880.565.475.175.465.156.581.674.161.3
γ = 0.977.358.181.164.9757564.556.681.47461.1
MCC+Ours
γ = 0.881.159.383.669.27879.669.156.482.874.761.9
γ = 0.8581.159.384.169.27879.669.156.482.874.762.1
γ = 0.980.759.383.869.477.579.368.956.582.974.762.4
+ +Cross entropy: The investigation of using cross entropy as an alternative to KL divergence for the candidate loss, Eqn.(2) in the UDPCS method reveals + +the method's adaptability and effectiveness across different loss functions, as demonstrated in Table 8. For the MDD+Ours model, employing cross entropy for the candidate loss yields an average accuracy of $71.3\%$ , which is identical to the average accuracy achieved using KL divergence. Similarly, the MCC+Ours model maintains an average accuracy of $73.6\%$ with both cross entropy and KL divergence. The consistency in average accuracy across different loss functions suggests that the method's ability to refine predictions for domain adaptation tasks is robust to the choice of loss function. + +Table 8: Accuracy(%) of UDPCS for different loss functions on OfficeHome dataset. (CE= Cross Entropy, KL=KL Divergence) + +
LossA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
CE77.458.180.764.975.275.365.356.381.573.961.784.871.3
KL77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
CE81.159.384.169.27879.669.156.482.874.762.186.473.6
KL80.859.284.569.477.979.768.456.583.275.162.186.473.6
+ +# 6 Conclusion + +In conclusion, UDPCS presents a novel approach to UDA by leveraging the concept of disambiguation and introducing pseudo-candidate sets to approximate the true labels of the target set. Our method is distinguished by the use of two loss functions to refine predictions within the pseudo-candidate set and to penalize incorrect labels outside of it, combined with a threshold-based strategy to focus on ambiguous samples. Through comprehensive experiments on the benchmark datasets, our approach has demonstrated its effectiveness in consistently improving target set accuracy across diverse domains. We also conduct thorough analysis and ablation studies. The results highlight the potential of our method to serve as a robust solution for UDA challenges. + +# Acknowledgements + +The research of AD is supported in part by the Prime Minister Research Fellowship, Ministry of Education, Government of India. VNB would like to acknowledge the support through the Govt of India SERB IMPRINT and DST ICPS funding programs for this work. The research of CKM is supported by the LiDAR and Camera Sensors Data based Deep Learning Algorithms for Autonomous Driving System project, funded by Govt. of India SERB program. The research is also partly supported by the Indo-Norwegian Collaboration in + +Autonomous Cyber-Physical Systems (INCAPS) project: 287918 of the International Partnerships for Excellent Education, Research and Innovation (INTPART) program and the Low-Altitude UAV Communication and Tracking (LUCAT) project: 280835 of the IKTPLUSS program from the Research Council of Norway. We are grateful to the anonymous reviewers for the feedback that helped improved the presentation of this paper. + +# References + +1. Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., Vaughan, J.W.: A theory of learning from different domains. Machine Learning 79(1-2), 151-175 (2010) +2. Chen, C., Fu, Z., Chen, Z., Jin, S., Cheng, Z., Jin, X., Hua, X.S.: Homm: Higher-order moment matching for unsupervised domain adaptation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 3422-3429 (2020) +3. Chen, L., Chen, H., Wei, Z., Jin, X., Tan, X., Jin, Y., Chen, E.: Reusing the task-specific classifier as a discriminator: Discriminator-free adversarial domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7181-7190 (2022) +4. Chen, W., Lin, L., Yang, S., Xie, D., Pu, S., Zhuang, Y.: Self-supervised noisy label learning for source-free unsupervised domain adaptation. In: 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10185-10192. IEEE (2022) +5. Chen, Y., Wei, C., Kumar, A., Ma, T.: Self-training avoids using spurious features under domain shift. Advances in Neural Information Processing Systems 33, 21061-21071 (2020) +6. Csurka, G.: Domain adaptation for visual applications: A comprehensive survey, pp. 1-35. Springer (2017) +7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space (2019) +8. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout (2017) +9. Du, Z., Li, J., Su, H., Zhu, L., Lu, K.: Cross-domain gradient discrepancy minimization for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3937-3946 (2021) +10. Feng, L., Lv, J., Han, B., Xu, M., Niu, G., Geng, X., An, B., Sugiyama, M.: Provably consistent partial-label learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 10948-10960. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/7bd28f15a49d5e5848d6ec70e584e625-Paper.pdf +11. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32nd International Conference on Machine Learning (ICML) (2015) +12. Gao, Z., Zhang, S., Huang, K., Wang, Q., Zhong, C.: Gradient distribution alignment certificates better adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8937-8946 (2021) +13. Jiang, J., Chen, B., Fu, B., Long, M.: Transfer-learning-library. https://github.com/thuml/Transfer-Learning-Library (2020) + +14. Jin, X., Lan, C., Zeng, W., Chen, Z.: Re-energizing domain discriminator with sample relabeling for adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9174-9183 (2021) +15. Jin, X., Lan, C., Zeng, W., Chen, Z.: Minimum class confusion for versatile domain adaptation. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020) +16. Jing, X., Qian, K., Jianu, T., Luo, S.: Unsupervised adversarial domain adaptation for sim-to-real transfer of tactile images. IEEE Transactions on Instrumentation and Measurement 72, 1-11 (2023). https://doi.org/10.1109/TIM.2023.3268458 +17. Kamilaris, A., Prenafeta-Boldú, F.X.: Deep learning in agriculture: A survey. Computers and Electronics in Agriculture 147, 70-90 (2018) +18. Le, T., Nguyen, T., Ho, N., Bui, H., Phung, D.: Lamda: Label matching deep domain adaptation. In: International Conference on Machine Learning. pp. 6043-6054. PMLR (2021) +19. LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436-444 (2015) +20. Lee, C.Y., Batra, T., Baig, M.H., Ulbricht, D.: Sliced wasserstein discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10285-10295 (2019) +21. Li, S., Liu, C., Lin, Q., Xie, B., Ding, Z., Huang, G., Tang, J.: Domain conditioned adaptation network. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 11386-11393 (2020) +22. Liu, H., Wang, J., Long, M.: Cycle self-training for domain adaptation. Advances in Neural Information Processing Systems 34, 22968-22981 (2021) +23. Liu, X., Guo, Z., Li, S., Xing, F., You, J., Kuo, C.C.J., El Fakhri, G., Woo, J.: Adversarial unsupervised domain adaptation with conditional and label shift: Infer, align and iterate. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 10367-10376 (2021) +24. Liu, Y., Zhou, Z., Sun, B.: Cot: Unsupervised domain adaptation with clustering and optimal transport. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19998-20007 (2023) +25. Lv, J., Xu, M., Feng, L., Niu, G., Geng, X., Sugiyama, M.: Progressive identification of true labels for partial-label learning. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 6500-6510. PMLR (13-18 Jul 2020), https://proceedings.mlr.press/v119/lv20a.html +26. Mei, K., Zhu, C., Zou, J., Zhang, S.: Instance adaptive self-training for unsupervised domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXVI 16. pp. 415-430. Springer (2020) +27. Na, J., Jung, H., Chang, H.J., Hwang, W.: Fixbi: Bridging domain spaces for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1094-1103 (2021) +28. Nguyen, T., Le, T., Dam, N., Tran, Q.H., Nguyen, T., Phung, D.Q.: Tidot: A teacher imitation learning approach for domain adaptation with optimal transport. In: IJCAI. pp. 2862-2868 (2021) +29. Patel, V.M., Gopalan, R., Li, R., Chellappa, R.: Visual domain adaptation: A survey of recent advances. IEEE Signal Processing Magazine 32(3), 53-69 (2015) +30. Peng, X., Bai, Q., Xia, X., Huang, Z., Saenko, K., Wang, B.: Moment matching for multi-source domain adaptation. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 1406-1415 (2019) + +31. Peng, X., Usman, B., Kaushik, N., Hoffman, J., Wang, D., Saenko, K.: Visda: The visual domain adaptation challenge (2017) +32. Phan, H., Le, T., Phung, T., Bui, A.T., Ho, N., Phung, D.: Global-local regularization via distributional robustness. In: International Conference on Artificial Intelligence and Statistics. pp. 7644-7664. PMLR (2023) +33. Prabhu, V., Khare, S., Kartik, D., Hoffman, J.: Sentry: Selective entropy optimization via committee consistency for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8558-8567 (2021) +34. Qian, N.: On the momentum term in gradient descent learning algorithms. Neural networks 12(1), 145-151 (1999) +35. Rangwani, H., Aithal, S.K., Mishra, M., Jain, A., Radhakrishnan, V.B.: A closer look at smoothness in domain adversarial training. In: International Conference on Machine Learning. pp. 18378-18399. PMLR (2022) +36. Saito, K., Watanabe, K., Ushiku, Y., Harada, T.: Maximum classifier discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018) +37. Shen, D., Wu, G., Suk, H.I.: Deep learning in medical image analysis. Annual Review of Biomedical Engineering 19, 221-248 (2017) +38. Shin, I., Woo, S., Pan, F., Kweon, I.S.: Two-phase pseudo label densification for self-training based domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 532-548. Springer (2020) +39. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 596-608. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/06964dce9adbb1c5cb5d6e3d9838f733-Paper.pdf +40. Tian, Y., Yu, X., Fu, S.: Partial label learning: Taxonomy, analysis and outlook. Neural Networks 161, 708-734 (2023). https://doi.org/https://doi.org/10.1016/j.neunet.2023.02.019, https://www.sciencedirect.com/science/article/pii/S0893608023000825 +41. Tzeng, E., Hoffman, J., Saenko, K., Darrell, T.: Adversarial discriminative domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017) +42. Venkateswara, H., Eusebio, J., Chakraborty, S., Panchanathan, S.: Deep hashing network for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 5018-5027 (2017) +43. Wang, X., Zhuo, J., Zhang, M., Wang, S., Fang, Y.: Revisiting unsupervised domain adaptation models: A smoothness perspective. In: Proceedings of the Asian Conference on Computer Vision. pp. 1504-1521 (2022) +44. Wei, G., Lan, C., Zeng, W., Chen, Z.: Metaalign: Coordinating domain alignment and classification for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16643-16653 (2021) +45. Wei, G., Lan, C., Zeng, W., Zhang, Z., Chen, Z.: Toalign: task-oriented alignment for unsupervised domain adaptation. Advances in Neural Information Processing Systems 34, 13834-13846 (2021) + +46. Wen, H., Cui, J., Hang, H., Liu, J., Wang, Y., Lin, Z.: Leveraged weighted loss for partial label learning. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 11091-11100. PMLR (18-24 Jul 2021), https://proceedings.mlr.press/v139/wen21a.html +47. Wu, D.D., Wang, D.B., Zhang, M.L.: Revisiting consistency regularization for deep partial label learning. In: Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., Sabato, S. (eds.) Proceedings of the 39th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 162, pp. 24212-24225. PMLR (17-23 Jul 2022), https://proceedings.mlr.press/v162/wu221.html +48. Xie, X., Chen, J., Li, Y., Shen, L., Ma, K., Zheng, Y.: Self-supervised cyclegan for object-preserving image-to-image domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 498-513. Springer (2020) +49. Yan, Y., Guo, Y.: Partial label unsupervised domain adaptation with class-prototype alignment. In: The Eleventh International Conference on Learning Representations (2022) +50. Zhang, Y., Liu, T., Long, M., Jordan, M.: Bridging theory and algorithm for domain adaptation. In: Proceedings of the 36th International Conference on Machine Learning (ICML) (2019) +51. Zhou, L., Ye, M., Zhu, X., Xiao, S., Fan, X.Q., Neri, F.: Homeomorphism alignment for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18699-18710 (2023) \ No newline at end of file diff --git a/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/images.zip b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..9b3cf0eec870ef11e04444c92a8e93da8b8ef0a0 --- /dev/null +++ b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fbe46e38cfbcaa65c53204fe8dc717c40e371cd90f49f8bd35f0fb092785fac9 +size 639086 diff --git a/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/layout.json b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..b577dc1bdf9413d2ec4e0b84df50a999d426f87c --- /dev/null +++ b/2024/Improving Unsupervised Domain Adaptation_ A Pseudo-Candidate Set Approach/layout.json @@ -0,0 +1,10108 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 138, + 111, + 474, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 111, + 474, + 148 + ], + "spans": [ + { + "bbox": [ + 138, + 111, + 474, + 148 + ], + "type": "text", + "content": "Improving Unsupervised Domain Adaptation: A Pseudo-Candidate Set Approach" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "spans": [ + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "text", + "content": "Aveen Dayal" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "text", + "content": ", Rishabh Lalla" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "text", + "content": ", Linga Reddy Cenkeramaddi" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "text", + "content": ", C Krishna Mohan" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "text", + "content": ", Abhinav Kumar" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "text", + "content": ", and Vineeth N Balasubramanian" + }, + { + "bbox": [ + 138, + 167, + 474, + 192 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 153, + 201, + 459, + 257 + ], + "type": "list", + "angle": 0, + "index": 4, + "blocks": [ + { + "bbox": [ + 153, + 201, + 459, + 234 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 201, + 459, + 234 + ], + "spans": [ + { + "bbox": [ + 153, + 201, + 459, + 234 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 153, + 201, + 459, + 234 + ], + "type": "text", + "content": " Indian Institute of Technology Hyderabad, Hyderabad 502285, India {ai21resch11003@, rishabh.lalla@cse., ckm@cse., abhinavkumar@ee., vineethnb@cse.}iith.ac.in" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 210, + 235, + 402, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 235, + 402, + 257 + ], + "spans": [ + { + "bbox": [ + 210, + 235, + 402, + 257 + ], + "type": "text", + "content": "2 University of Agder, Grimstad 4879, Norway linga.cenkeramaddi@uia.no" + } + ] + } + ], + "index": 3 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 159, + 284, + 452, + 492 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 284, + 452, + 492 + ], + "spans": [ + { + "bbox": [ + 159, + 284, + 452, + 492 + ], + "type": "text", + "content": "Abstract. Unsupervised domain adaptation (UDA) is a critical challenge in machine learning, aiming to transfer knowledge from a labeled source domain to an unlabeled target domain. In this work, we aim to improve target set accuracy in any existing UDA method by introducing an approach that utilizes pseudo-candidate sets for labeling the target data. These pseudo-candidate sets serve as a proxy for the true labels in the absence of direct supervision. To enhance the accuracy of the target domain, we propose Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), a method which effectively learns to disambiguate among classes in the pseudo-candidate set. Our approach is characterized by two distinct loss functions: one that acts on the pseudo-candidate set to refine its predictions and another that operates on the labels outside the pseudo-candidate set. We use a threshold-based strategy to further guide the learning process toward accurate label disambiguation. We validate our novel yet simple approach through extensive experiments on three well-known benchmark datasets: Office-Home, VisDA, and DomainNet. Our experimental results demonstrate the efficacy of our method in achieving consistent gains on target accuracies across these datasets." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 503, + 460, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 503, + 460, + 525 + ], + "spans": [ + { + "bbox": [ + 159, + 503, + 460, + 525 + ], + "type": "text", + "content": "Keywords: Unsupervised Domain Adaptation " + }, + { + "bbox": [ + 159, + 503, + 460, + 525 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 503, + 460, + 525 + ], + "type": "text", + "content": " Disambiguation " + }, + { + "bbox": [ + 159, + 503, + 460, + 525 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 503, + 460, + 525 + ], + "type": "text", + "content": " Pseudo-Candidate Set" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 545, + 230, + 558 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 230, + 558 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 230, + 558 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "In recent years, Deep Neural Networks (DNNs) have showcased remarkable achievements in multiple domains such as robotics [19], medical imaging [37], agriculture [17], and beyond. However, in the realm of deep learning, domain shift presents a significant challenge as it occurs when the training set and the test set exhibit different data distributions, leading to a degradation in model performance [1, 29]. Unsupervised Domain Adaptation (UDA) has emerged as a prominent setting to address such challenges. UDA aims to adapt a model trained on a labeled training set (source domain) to perform well on an unlabeled" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": "test set (target domain) by minimizing the domain discrepancy and leveraging the intrinsic structure of the target domain [11, 41]. This adaptation is crucial for deploying deep learning models in dynamic environments where obtaining labeled data for every possible domain is impractical [6]. For instance, [16] explains how UDA techniques can be applied to bridge the gap between simulated and real-world domains, a common challenge in robotics." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 191, + 482, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 191, + 482, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 191, + 482, + 348 + ], + "type": "text", + "content": "To address the UDA problem, two prominent categories of methods have emerged: adversarial and self-training approaches. Adversarial methods, such as Domain-Adversarial Neural Networks (DANN) [11], Maximum Classifier Discrepancy (MCD) [36], and Margin Disparity Discrepancy (MDD) [50], focus on minimizing the domain discrepancy by aligning the feature distributions of the source and target domains through adversarial training. On the other hand, self-training techniques, exemplified by works like Cycle Self-Training (CST) [22], and Minimum Class Confusion (MCC) [15], leverage the model's predictions on the target domain to iteratively refine the model, aiming to improve its generalization to the target domain. Apart from these, hybrid approaches that integrate both adversarial and self-training paradigms for effective adaptation across domains have also been proposed [3,24,43]. These approaches have shown promising results in addressing the challenges of domain shift in UDA." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 350, + 482, + 626 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 626 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 626 + ], + "type": "text", + "content": "Despite these existing efforts in the field of UDA, we recognize an opportunity to further enhance performance in the target domain. Inspired by the use of candidate sets in partial-label learning [10, 40], we present a novel perspective to address the UDA problem by analyzing the patterns in the predictions of trained UDA models. As illustrated in Fig. 1, we observe that for multiple target samples, the trained UDA model's predictions are ambiguous, i.e., the model is not very confident about its predictions. Furthermore, we observe that this ambiguity is not uniformly distributed across all classes; instead, it is predominantly concentrated in a few closely related classes that exhibit the highest predicted probabilities, thereby leading to this ambiguity. To tackle this ambiguity, we introduce a novel technique, Unsupervised Domain Adaptation refinement using Pseudo-Candidate Sets (UDPCS), which refines the predictions within the target domain. UDPCS starts by creating a pseudo-candidate set for each target sample, consisting of potential true labels based on the UDA model's predictions. Subsequently, inspired by [25], we propose a disambiguation process which is applied to these pseudo-candidate sets. Additionally, our method extends supervision beyond the pseudo-candidate set, penalizing predictions that stray into other classes. As illustrated in Fig. 1, the proposed UDPCS method effectively refines the UDA model's predictions by resolving ambiguity. It achieves this by identifying the potentially correct label and increasing its confidence. The efficacy of UDPCS is demonstrated through extensive experiments on various benchmark UDA datasets, showcasing its potential to enhance target accuracy in UDA models." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "The following are the main contributions of this work:(i) We introduce the concept of a pseudo-candidate set, which is generated from the predictions of the UDA model. To the best of our knowledge, this work is the first to use the idea" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 175 + ], + "type": "text", + "content": "of pseudo-candidate set in the UDA setting; (ii) We propose a novel refinement technique for UDA, UDPCS, by leveraging the identified pseudo-candidate sets; and (iii) We study the proposed method by conducting extensive experiments on multiple UDA benchmark datasets, observing consistent performance gains across various datasets and UDA methods." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 194, + 480, + 383 + ], + "blocks": [ + { + "bbox": [ + 133, + 194, + 480, + 383 + ], + "lines": [ + { + "bbox": [ + 133, + 194, + 480, + 383 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 480, + 383 + ], + "type": "image", + "image_path": "31926731aa098e734b1ece635bb48147c90007b8817abe675d770b478265d9d5.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 395, + 482, + 430 + ], + "lines": [ + { + "bbox": [ + 130, + 395, + 482, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 395, + 482, + 430 + ], + "type": "text", + "content": "Fig. 1: Comparison of predictions between the trained UDA model (MDD [50]) and the proposed UDPCS method after refining the trained UDA model on the VisDA dataset for five target samples." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 472, + 237, + 485 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 472, + 237, + 485 + ], + "spans": [ + { + "bbox": [ + 132, + 472, + 237, + 485 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 498, + 481, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 481, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 481, + 521 + ], + "type": "text", + "content": "This section discusses the earlier literature that was proposed specifically related to UDA and the disambiguation process inspired by partial-label learning." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 522, + 482, + 666 + ], + "type": "text", + "content": "UDA aims to perform well on the unlabeled target domain by leveraging the labeled source data. Inspired by the theoretical analysis [1], learning domain-invariant features has emerged as a pivotal approach. This concept has given rise to one of the most prevalent methodologies for addressing UDA challenges: adversarial methods. Inspired by GAN, the key principle behind adversarial methods is to minimize the domain shift through a minimax optimization strategy. [11] introduced DANN, a pioneering work that employs a deep learning-based adversarial approach for UDA using a generator and a domain discriminator. Bi-classifier approaches, as proposed by [36] and [20], propose an adversarial approach involving a single feature extractor and two classifiers. [50] introduced a novel disparity discrepancy method, Margin Disparity Discrepancy (MDD), to learn domain invariant features. Various other adversarial methods" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 307 + ], + "type": "text", + "content": "include [9,12,14,23,35,44,45]. Another significant avenue in UDA is self-training, where the model iteratively enhances its predictions to perform effectively on the target domain. Minimum Class Confusion (MCC), as proposed by [15], introduces a novel loss function that minimizes class confusion, leading to improved transfer gains. Additionally, Cycle Self-Training (CST), presented in [22], advocates for a cyclic self-training approach that refines target pseudo-labels in two steps and by leveraging Tsallis entropy as a regularizer. Various other methodologies in this category include [5, 26, 38]. Beyond these techniques, alternative methods such as optimal transport [18, 28, 32], moment matching [2, 21], and self-supervised techniques [4, 48], have been proposed to address UDA challenges. Notably, recent years have witnessed the emergence of several hybrid approaches, which typically amalgamate different categories of techniques [3, 24, 27, 33, 43, 51]. In this work, we introduce a novel perspective for tackling the UDA problem by analyzing the predictions of any trained UDA model on the target domain. Our proposed method is designed to iteratively refine the UDA model's prediction on the target domain." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 308, + 482, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 464 + ], + "type": "text", + "content": "Disambiguation is a key aspect of partial label learning (PLL). The PRODEN method [25] is a pivotal work in PLL that employs an iterative strategy for refining candidate sets, directly targeting label disambiguation. Following PRODEN, recent advancements have continued to refine the disambiguation process in PLL. LWC [46] introduces a weighted loss function that prioritizes probable labels within candidate sets, enhancing the disambiguation process. CR [47] introduces consistency regularization in PLL for disambiguating the labels. These developments highlight the importance of refining disambiguation processes for accurate learning outcomes. In this work, inspired from [25], we introduce the concept of pseudo-candidate set and propose a disambiguation process on these pseudo-candidate sets. Unlike [49], which introduces a hybrid setting between UDA and PLL, our work focuses on leveraging the concepts from PLL to refine the predictions on the target domain in UDA." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 482, + 288, + 497 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 482, + 288, + 497 + ], + "spans": [ + { + "bbox": [ + 132, + 482, + 288, + 497 + ], + "type": "text", + "content": "3 UDPCS: Methodology" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": "Preliminaries. This section describes the basic assumptions and notations for classification problems in UDA. In a typical UDA framework, three key components are involved: a feature extractor " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "(\\mathcal{G})" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", a classifier " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "(f)" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", and a domain adaptive component. The source and target domains are denoted by " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_S" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_T" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", respectively. The term " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " refers to any of these domains when the index is irrelevant. Throughout this work, the terms 'domain' and 'distribution' are used interchangeably. Each such domain " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{D} \\subseteq \\mathcal{X} \\times \\mathcal{Y}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{X}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " is an input space and " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{Y}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " is the output (label) space, which is " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\{0,1\\}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " in binary classification and " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\{1,\\dots,k\\}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " in multi-class classification. The term " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\hat{D}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " is used to denote a set of samples drawn independently from " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", i.e. " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\hat{D} = \\{(x_i,y_i)\\}_{i=1}^n" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "x_i \\in \\mathcal{X}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "y_i \\in \\mathcal{Y}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\forall i \\in \\{1,2,\\ldots,n\\}" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ". We use " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " to refer to a sample " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "(x_i,y_i)" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": " when the index is irrelevant. We define the model, " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "h(x) = f(\\mathcal{G}(x))" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "inline_equation", + "content": "h: \\mathcal{X} \\to \\mathbb{R}^k" + }, + { + "bbox": [ + 130, + 508, + 482, + 666 + ], + "type": "text", + "content": ", with each dimension of the output representing the class" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "probability for each class. We also use " + }, + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": " to refer to the pseudo-candidate set where " + }, + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "inline_equation", + "content": "Z \\subset \\mathcal{Y}" + }, + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 282 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 282 + ], + "type": "text", + "content": "Methodology. We now present the methodology of our proposed approach, UDPCS, designed to enhance the accuracy of the target domain by leveraging pseudo-candidate sets. In the standard UDA setting, we assume that the training data consists of a labeled source domain, " + }, + { + "bbox": [ + 130, + 140, + 482, + 282 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_S" + }, + { + "bbox": [ + 130, + 140, + 482, + 282 + ], + "type": "text", + "content": ", and an unlabeled target domain, " + }, + { + "bbox": [ + 130, + 140, + 482, + 282 + ], + "type": "inline_equation", + "content": "\\mathcal{D}_T" + }, + { + "bbox": [ + 130, + 140, + 482, + 282 + ], + "type": "text", + "content": ". The primary objective of a UDA method is to perform well on unlabeled target data. This is generally accomplished by employing a classification loss and an adaptation loss that minimizes the discrepancy between the source and target features. Over time, various adaptation loss functions have been proposed, depending on the specific UDA method employed [15,43,50]. Our proposed UDPCS method builds upon these standard techniques to further improve UDA performance with minimal overhead. We now describe our methodology and then illustrate it with a toy example." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 283, + 482, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 283, + 482, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 283, + 482, + 331 + ], + "type": "text", + "content": "In order to serve as a refinement strategy over any UDA method, we first train the UDPCS model " + }, + { + "bbox": [ + 130, + 283, + 482, + 331 + ], + "type": "inline_equation", + "content": "h(.)" + }, + { + "bbox": [ + 130, + 283, + 482, + 331 + ], + "type": "text", + "content": " using any off-the-shelf UDA algorithm. Once the UDA training is complete, we employ the trained model " + }, + { + "bbox": [ + 130, + 283, + 482, + 331 + ], + "type": "inline_equation", + "content": "h(.)" + }, + { + "bbox": [ + 130, + 283, + 482, + 331 + ], + "type": "text", + "content": " to generate a pseudocandidate set for target data, as below." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 216, + 339, + 481, + 353 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 216, + 339, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 216, + 339, + 481, + 353 + ], + "type": "interline_equation", + "content": "Z = \\{j | h _ {j} (x) > \\tau , \\forall j \\in \\{1, \\dots , k \\} \\}, \\tau > 0 \\tag {1}", + "image_path": "352c3733a981ddd5280e1d4ff58feaad86bae813e410ca18ade64d824ba8f46b.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": "For each input " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " represents the pseudo-candidate set consisting of class indices " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": " for which the corresponding class prediction probability, " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "h_j(x)" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": ", exceeds a predefined threshold " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": ". This approach allows us to include only those classes in the pseudo-candidate set that have a relatively higher likelihood of being the true label, as indicated by the model " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "h(.)" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": ". We further define a non-candidate set as the complement of the pseudo-candidate set, i.e., all class indices not in " + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 358, + 482, + 430 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 430, + 482, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 430, + 482, + 477 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 482, + 477 + ], + "type": "text", + "content": "Subsequently, for the refinement of the model's predictions in the target domain, our method is trained by utilizing an objective that consists of two loss functions: candidate loss " + }, + { + "bbox": [ + 130, + 430, + 482, + 477 + ], + "type": "inline_equation", + "content": "L_{c}" + }, + { + "bbox": [ + 130, + 430, + 482, + 477 + ], + "type": "text", + "content": " and non-candidate loss " + }, + { + "bbox": [ + 130, + 430, + 482, + 477 + ], + "type": "inline_equation", + "content": "L_{nc}" + }, + { + "bbox": [ + 130, + 430, + 482, + 477 + ], + "type": "text", + "content": ". These loss functions are each described below." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": "Candidate Loss. This loss guides the model " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "h(\\cdot)" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": " to align its predictions with the pseudo-candidate set. We introduce a label confidence vector " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "\\boldsymbol{w} \\in \\mathbb{R}^k" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": ", representing the confidence for all " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": " classes. Each element " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "w_j" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": " in this vector signifies the confidence assigned to class " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": ". We ensure that " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "\\sum_{j \\in Z} w_j = 1" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "w_j = 0 \\forall j \\notin Z" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": ", meaning that the confidence values " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "w_j" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": " are assigned only to classes present in the pseudo-candidate set, and set to 0 otherwise. Consequently, " + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "inline_equation", + "content": "\\boldsymbol{w}" + }, + { + "bbox": [ + 130, + 478, + 482, + 574 + ], + "type": "text", + "content": " serves as a distribution over the classes in the pseudo-candidate set. The candidate loss applied to the pseudo-candidate set is then defined as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 180, + 581, + 481, + 612 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 180, + 581, + 481, + 612 + ], + "spans": [ + { + "bbox": [ + 180, + 581, + 481, + 612 + ], + "type": "interline_equation", + "content": "L _ {c} = \\left\\{ \\begin{array}{l l} K L (\\boldsymbol {w} | | h (\\mathcal {A} _ {1} (x)) & \\text {i f} \\max (h (\\mathcal {A} _ {1} (x))) < \\gamma \\\\ 0 & \\text {o t h e r w i s e} \\end{array} , \\gamma < 1 \\right. \\tag {2}", + "image_path": "ca516548dbc5e94296060a94879f9df25d97a5859b7fac11384456e634652ffa.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "The candidate loss is applied to samples for which the model's maximum predicted class probability falls below a certain threshold " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ". Rather than using the raw input " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ", we utilize a strongly augmented version, " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_1(x)" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ", as the input. Inspired by FixMatch [39], for strong augmentations, we leverage Cutout [8] and" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 413, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 413, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 413, + 90, + 447, + 101 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": "RandAugment [7], which produce heavily distorted versions of the given input " + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": ". The rationale behind employing strong augmentation and thresholding is to differentiate between samples based on the model's predictions. For samples where the model's prediction is just above the threshold " + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": ", the strong augmentation is likely to lower the prediction values, thereby including these samples in the candidate loss " + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "inline_equation", + "content": "L_{c}" + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": ". Conversely, for samples where the model's predictions are very high, even after strong augmentation, the predictions remain robust and above the threshold. Consequently, these samples are excluded from the candidate loss, ensuring that the loss is primarily applied to samples where the model's predictions are less certain. This loss is calculated as the Kullback-Leibler (KL) divergence between the label confidence vector " + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "inline_equation", + "content": "\\mathbf{w}" + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": " and the model's predictions " + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "inline_equation", + "content": "h(\\mathcal{A}_1(x))" + }, + { + "bbox": [ + 130, + 116, + 482, + 272 + ], + "type": "text", + "content": ". Thus, in this way, the candidate loss aligns the pseudo-candidate set distribution and the model's prediction distribution." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 274, + 483, + 297 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 274, + 483, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 274, + 483, + 297 + ], + "type": "text", + "content": "Non-Candidate Loss. This loss is applied to the elements outside the pseudocandidate set as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 238, + 301, + 481, + 327 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 301, + 481, + 327 + ], + "spans": [ + { + "bbox": [ + 238, + 301, + 481, + 327 + ], + "type": "interline_equation", + "content": "L _ {n c} = - \\sum_ {j \\notin Z} \\log \\left(1 - h _ {j} \\left(\\mathcal {A} _ {2} (x)\\right)\\right) \\tag {3}", + "image_path": "437f037d7a82df7b6bc38b7068f9690239b0d4768fe598295894d8adeb6c247c.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "content": "The motivation for the non-candidate loss is that it penalizes the model for assigning high probabilities to classes that are not in the pseudo-candidate set " + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "content": ". It is computed as the negative log-likelihood of the complement probabilities for classes outside " + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "content": ", using the model's predictions " + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "inline_equation", + "content": "h(\\mathcal{A}_2(x))" + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "content": " after applying a weak augmentation " + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_2" + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "content": " to the input " + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "content": ". We use a standard flip-and-shift augmentation as our weak " + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_2" + }, + { + "bbox": [ + 130, + 338, + 482, + 421 + ], + "type": "text", + "content": ". This loss discourages the model from considering classes outside the pseudo-candidate set as potential true labels." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 423, + 482, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 448 + ], + "type": "text", + "content": "Overall Objective. The overall objective function of the proposed UDPCS model is the sum of the candidate and non-candidate loss terms:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 267, + 462, + 481, + 474 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 267, + 462, + 481, + 474 + ], + "spans": [ + { + "bbox": [ + 267, + 462, + 481, + 474 + ], + "type": "interline_equation", + "content": "L o s s = L _ {c} + \\lambda L _ {n c} \\tag {4}", + "image_path": "869b67ddcb4b4e55a421933fa2fe3e04f203f208fa07330c4967254bf1fe61a4.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 487, + 481, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 481, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 481, + 510 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 487, + 481, + 510 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 487, + 481, + 510 + ], + "type": "text", + "content": " is a hyperparameter that balances the contributions of the two loss functions." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "spans": [ + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": "Updating " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\boldsymbol{w}" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": ". As in Eqn. (2), the vector " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\boldsymbol{w}" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": " plays a crucial role in guiding the model's predictions. Therefore, updating " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\boldsymbol{w}" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": " after each iteration is essential for disambiguation of the pseudo-candidate set. We set the label confidence " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\boldsymbol{w}" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": " initially to " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "\\frac{1}{|Z|}" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": " if the class " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": " is in the pseudo-candidate set " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "|Z|" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": " denotes the cardinality of " + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 513, + 482, + 622 + ], + "type": "text", + "content": ". This ensures that each class in the pseudo-candidate set receives an equal initial confidence value. The rationale for assigning an equal initial confidence value to each class in the pseudo-candidate set is to enable the proposed UDPCS method to disambiguate the correct class from a set of classes without bias. This scheme is given below:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 196, + 635, + 481, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 196, + 635, + 481, + 669 + ], + "spans": [ + { + "bbox": [ + 196, + 635, + 481, + 669 + ], + "type": "interline_equation", + "content": "w _ {j} = \\left\\{ \\begin{array}{l l} \\frac {1}{| Z |} & \\text {i f} j \\in Z \\\\ 0 & \\text {o t h e r w i s e} \\end{array} , \\boldsymbol {w} \\in \\mathbb {R} ^ {k} \\right. \\text {a n d} \\sum_ {j \\in Z} w _ {k} = 1 \\tag {5}", + "image_path": "9c0ab1188168068ab700424b0524736077aabd355e1dabeabef2c30a8860eccd.jpg" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "code", + "bbox": [ + 134, + 141, + 482, + 318 + ], + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "text", + "content": "Algorithm 1 Unsupervised Domain Adaptation refinement using pseudo-candidate sets (UDPCS)" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "code_caption" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "lines": [ + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "spans": [ + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": "1: Input: Source domain data " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "D_S = \\{x_i^S, y_i^S\\}_{i=1}^{n_S}" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ", target domain data " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "D_T = \\{x_j^T\\}_{j=1}^{n_T}" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ", learning rate " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "\\eta" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ", number of iterations " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ", refinement iterations " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{refine}}" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ", strong augmentation " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_1" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ", weak augmentation " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_2" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ". \n2: Output: Refined model " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " \n3: Initialize model " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " with random weights \n4: for " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "t = 1" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " do \n5: " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "(x^S, y^S) \\sim D_S" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "(x^T) \\sim D_T" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " \n6: Update the parameters of " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " utilizing " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "(x^S, y^S)" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "(x^T)" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " in accordance with any standard unsupervised domain adaptation technique. \n7: end for \n8: Generate the pseudo-candidate set 'Z' for each sample in " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "D_T" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " using Eqn. (1) \n9: Initialize the label confidence vector 'w' using Eqn. (5) \n10: for " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "t = 1" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "T_{\\mathrm{refine}}" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " do \n11: " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "(x^T) \\sim D_T" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": ", with augmentations " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_1(x^T)" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_2(x^T)" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " \n12: Compute the candidate loss " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "L_c" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " using Eqn. (2) \n13: Compute the non-candidate loss " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "L_{nc}" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " using Eqn. (3) \n14:Compute the final loss, " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "Loss = L_c + \\lambda L_{nc}" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " \n15: Update the label confidence vector using Eqn. (6) \n16:Update model " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " using gradient descent: " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "h \\gets h - \\eta \\nabla Loss" + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "text", + "content": " \n17: end for \n18: return " + }, + { + "bbox": [ + 134, + 141, + 482, + 318 + ], + "type": "inline_equation", + "content": "h" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "code_body" + } + ], + "index": 3, + "sub_type": "algorithm" + }, + { + "bbox": [ + 132, + 342, + 480, + 366 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 342, + 480, + 366 + ], + "spans": [ + { + "bbox": [ + 132, + 342, + 480, + 366 + ], + "type": "text", + "content": "After each iteration, the vector " + }, + { + "bbox": [ + 132, + 342, + 480, + 366 + ], + "type": "inline_equation", + "content": "\\pmb{w}" + }, + { + "bbox": [ + 132, + 342, + 480, + 366 + ], + "type": "text", + "content": " is dynamically updated based on the model's predictions " + }, + { + "bbox": [ + 132, + 342, + 480, + 366 + ], + "type": "inline_equation", + "content": "h(\\mathcal{A}_1(x))" + }, + { + "bbox": [ + 132, + 342, + 480, + 366 + ], + "type": "text", + "content": ", as below:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 228, + 377, + 480, + 411 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 377, + 480, + 411 + ], + "spans": [ + { + "bbox": [ + 228, + 377, + 480, + 411 + ], + "type": "interline_equation", + "content": "w _ {j} = \\left\\{ \\begin{array}{l l} \\frac {h _ {j} \\left(\\mathcal {A} _ {1} (x)\\right)}{\\sum_ {m \\in Z} h _ {m} \\left(\\mathcal {A} _ {1} (x)\\right)} & \\text {i f} j \\in Z \\\\ 0 & \\text {o t h e r w i s e} \\end{array} \\right. \\tag {6}", + "image_path": "237a911272ccd99b0e36e06b032c7ce8c0383e13ada121ad631bab2b5d7e249e.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "text", + "content": "As in Eqn. (6), the confidence " + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "inline_equation", + "content": "w_{j}" + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "text", + "content": " for each class " + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "text", + "content": " in the pseudo-candidate set " + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "text", + "content": " is updated to be proportional to the model's prediction probability for that class, normalized by the sum of prediction probabilities for all classes in " + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "text", + "content": ". This update ensures that " + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "inline_equation", + "content": "w_{j}" + }, + { + "bbox": [ + 130, + 423, + 480, + 483 + ], + "type": "text", + "content": " reflects the model's current confidence in each class within the pseudo-candidate set, facilitating the disambiguation process." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 484, + 481, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 484, + 481, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 484, + 481, + 592 + ], + "type": "text", + "content": "Therefore, by iteratively updating the model " + }, + { + "bbox": [ + 130, + 484, + 481, + 592 + ], + "type": "inline_equation", + "content": "h(.)" + }, + { + "bbox": [ + 130, + 484, + 481, + 592 + ], + "type": "text", + "content": " using the aforementioned components, the proposed UDPCS improves the model's ability to disambiguate the correct class from the pseudo-candidate set, leading to more accurate and confident predictions on the target domain. Our overall method is summarized in Algorithm 1. We begin by training the proposed model " + }, + { + "bbox": [ + 130, + 484, + 481, + 592 + ], + "type": "inline_equation", + "content": "h(.)" + }, + { + "bbox": [ + 130, + 484, + 481, + 592 + ], + "type": "text", + "content": " using a standard UDA technique. We then generate the pseudo-candidate set and initialize the label confidence vector. Subsequently, the method undergoes iterative training, incorporating both candidate and non-candidate loss in each iteration. We now illustrate our approach using a toy example." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "Toy Example. To illustrate the working of our method, the toy example in Fig. 2 shows how the proposed UDPCS technique refines a model's predictions. In particular, we demonstrate a single iteration after UDA training. As shown in the figure, we consider a 5-class classification problem with labeled source data, unlabeled target data consisting of 5 samples from " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "S1" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "S5" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " and a model " + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "inline_equation", + "content": "h_{UDA}(.)" + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": " trained using any off-the-shelf UDA technique. The unseen true labels" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 480, + 252 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 480, + 252 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 480, + 252 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 480, + 252 + ], + "type": "image", + "image_path": "796389c81a9d420af10b924cea25d3dc882f9e13c658a4cd29ee1c2c81dcd2a8.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 261, + 482, + 297 + ], + "lines": [ + { + "bbox": [ + 130, + 261, + 482, + 297 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 482, + 297 + ], + "type": "text", + "content": "Fig. 2: Illustration of the toy example for demonstrating our UDPCS method. The figure visualizes the process of refining the predictions of a base UDA model by leveraging pseudo-candidate sets." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "text", + "content": "for these 5 target samples are assigned such that sample " + }, + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "text", + "content": " is labeled as class " + }, + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "inline_equation", + "content": "\\forall j \\in \\{1,2,\\ldots,5\\}" + }, + { + "bbox": [ + 130, + 336, + 482, + 363 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "content": "As mentioned earlier in this section, after UDA training, our UDPCS method generates the pseudo-candidate set " + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "inline_equation", + "content": "Z" + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "content": " using model predictions " + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "inline_equation", + "content": "h_{UDA(\\cdot)}" + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "content": " and with " + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "inline_equation", + "content": "\\tau = 0.1" + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "content": ", according to Eqn. (1), for each target sample. The cardinality of these pseudo-candidate sets for this example ranges from 2 to 4 in Fig. 2. These sets are then utilized to generate the label confidence vector " + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "inline_equation", + "content": "\\pmb{w}" + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "content": ", which, as previously discussed, is initialized with uniform confidence values according to Eqn. (5) (to avoid error bias from the base model). This " + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "inline_equation", + "content": "\\pmb{w}" + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "content": ", along with the pseudo-candidate sets, is then used to refine the model's prediction by updating its parameters using Eqn. (4). In the next iteration, 'Step = 1' in the figure, this refined model generates predictions on the target set, which is then used to get the disambiguated vector " + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "inline_equation", + "content": "\\pmb{w}" + }, + { + "bbox": [ + 130, + 369, + 483, + 502 + ], + "type": "text", + "content": " according to Eqn. (6)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": "As in the figure, the refined model's predictions for each sample definitively impacts model accuracy. After initial UDA model training, the model correctly predicted " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S1" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S2" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S3" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ", but incorrectly predicted " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S4" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S5" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ", resulting in " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "60\\%" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": " accuracy. Whereas after the refinement, " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S4" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": " is correctly disambiguated, while the confidence in predictions for " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S1" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S2" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S3" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": " has increased. For sample " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "S5" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ", the disambiguation could not identify the correct label in the first iteration. These changes in predictions increased the model's accuracy from " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "60\\%" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "inline_equation", + "content": "80\\%" + }, + { + "bbox": [ + 130, + 510, + 483, + 666 + ], + "type": "text", + "content": ". It is also noticeable that the prediction probabilities of classes outside the candidate set have reduced, which can be attributed to the non-candidate set loss. Thus, the proposed method improves UDA performance by refining the model's predictions. We show later in our experiments that with this little overhead, we outperform the base UDA model across different baselines, even when the baseline is allowed the same additional training time." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 258 + ], + "type": "text", + "content": "Datasets: We conduct a comprehensive evaluation of our proposed UDPCS method on several benchmark UDA datasets, including VisDA [31], DomainNet [30], and OfficeHome [42]. Each dataset poses unique challenges for domain adaptation. The VisDA dataset, for instance, exhibits a significant domain gap between the source and target domains, encompassing 12 classes. The DomainNet dataset, on the other hand, offers a broader label space with 365 classes, presenting a different set of challenges. Lastly, the OfficeHome dataset, with its relatively limited number of samples across all domains, necessitates efficient adaptation strategies. Further details about these datasets are provided in the Appendix." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 259, + 482, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 259, + 482, + 437 + ], + "spans": [ + { + "bbox": [ + 130, + 259, + 482, + 437 + ], + "type": "text", + "content": "Implementation Details and Baselines: Consistent with recent benchmarks [24, 51], we employ the ResNet50 model as the feature extractor for the Office-Home dataset and the ResNet101 model for the VisDA and DomainNet datasets. Our method is trained using stochastic gradient descent with momentum [34]. Additional implementation details, such as hyperparameters including threshold values, learning rates, etc., are detailed in the Appendix. Our UDPCS method enhances off-the-shelf UDA techniques; hence, we evaluate its effectiveness against a range of UDA methods such as MDD [50], MCC [15], LeCo [43], SDAT [35], and NWD [3], which encompass diverse approaches like adversarial and self-training. We benchmark our model by comparing the performance of these UDA methods with and without the application of our UDPCS technique. Additionally, we contrast our method with other recent benchmarks in Appendix A1. In our result tables, (Tab. 1 to Tab. 3), the performance of our UDPCS method is denoted as 'UDA method+Ours,' where 'UDA method' indicates the base method upon which UDPCS is applied." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "text", + "content": "Results on VisDA: The VisDA dataset presents a single adaptation scenario, from synthetic (source) to real-world (target) domains. Class-wise target accuracy results on the VisDA dataset are detailed in Tab. 1. As seen in Tab. 1, the UDPCS method enhances mean accuracy across five different UDA methods. Notably, the maximum improvement, a " + }, + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "inline_equation", + "content": "2.4\\%" + }, + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "text", + "content": " gain, is observed when UDPCS is applied to both the MCC and NWD models. The VisDA dataset is known for its large domain gap between the source and target domains. Despite this challenge, UDPCS achieves an average gain of " + }, + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 438, + 482, + 544 + ], + "type": "text", + "content": " in target accuracy, as demonstrated in Tab. 1, highlighting its efficacy in refining model predictions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "content": "Results on DomainNet: In line with the settings from [13, 43], we carry out experiments on 12 tasks involving clipart (c), painting (p), real (r), and sketch (s) domains from the original DomainNet dataset. The detailed results for all tasks are showcased in Tab. 2. As indicated in Tab. 2, the UDPCS method surpasses the performance of each underlying UDA method, with a maximum gain of " + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "inline_equation", + "content": "3.5\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "content": " in average target accuracy. As seen from Tab. 2, our method, 'MDD+Ours,' achieves the best performance compared to all the other methods. Despite DomainNet's challenge of a vast label space with 365 classes, the UDPCS method achieves an average gain of " + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "inline_equation", + "content": "1.6\\%" + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "content": " in target accuracy, showcasing the robustness and effectiveness of our approach." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 414, + 90, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 90, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 414, + 90, + 447, + 101 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 159, + 482, + 286 + ], + "blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 150 + ], + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 150 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 150 + ], + "type": "text", + "content": "Table 1: Accuracy(%) on VisDA dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. Mean denotes Mean Accuracy. Appendix A1 presents additional results." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 159, + 482, + 286 + ], + "lines": [ + { + "bbox": [ + 132, + 159, + 482, + 286 + ], + "spans": [ + { + "bbox": [ + 132, + 159, + 482, + 286 + ], + "type": "table", + "html": "
ModelplanebcyblbuscarhorseknifemcyclepersnplantsktbtraintruckMeanGains
MDD(ICML'19)94.675.068.570.291.494.391.579.791.688.484.336.880.5
+Ours96.176.869.372.493.396.592.580.592.689.786.838.682.11.6
MCC(ECCV'20)94.585.974.571.693.994.985.982.391.491.782.457.483.8
+Ours96.288.477.673.795.197.789.583.794.593.485.259.186.22.4
LeCo(ACCV'22)96.187.585.889.695.696.290.882.794.491.184.441.986.3
+Ours97.588.685.589.997.397.193.384.896.493.787.245.288.01.7
SDAT(ICML'22)94.682.977.067.493.697.192.482.692.887.085.652.283.8
+Ours95.684.679.376.094.998.192.783.994.490.688.148.785.61.8
NWD (CVPR'22)93.983.976.673.293.191.085.780.991.890.082.051.282.8
+Ours96.087.478.677.294.593.889.183.293.894.383.651.585.22.4
Average Gains2
", + "image_path": "d3e4d948508c6ffd3caee0e80c92b99d1ff9666575164a93a72245bba23ee6be.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 132, + 341, + 482, + 460 + ], + "blocks": [ + { + "bbox": [ + 130, + 297, + 482, + 332 + ], + "lines": [ + { + "bbox": [ + 130, + 297, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 297, + 482, + 332 + ], + "type": "text", + "content": "Table 2: Accuracy(%) on DomainNet dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 341, + 482, + 460 + ], + "lines": [ + { + "bbox": [ + 132, + 341, + 482, + 460 + ], + "spans": [ + { + "bbox": [ + 132, + 341, + 482, + 460 + ], + "type": "table", + "html": "
Modelc-pc-rc-sp-cp-rp-sr-cr-pr-ss-cs-ps-rAvg.Gains
CDAN (NeurIPS'18)40.456.846.145.158.440.555.653.643.057.246.455.749.9
+Ours43.759.147.745.959.24258.253.745.75948.257.851.71.8
MDD (ICML'19)42.859.248.349.259.643.658.854.146.659.146.757.852.2
+Ours46.763.551.451.162.346.363.157.750.763.450.361.955.73.5
MCC (ECCV'20)37.155.641.445.559.939.754.353.136.858.246.556.148.7
+Ours39.156.643.047.260.641.156.455.038.859.147.057.750.11.4
SDAT (ICML'22)41.957.247.247.860.242.356.553.942.760.448.057.551.3
+Ours43.758.147.948.159.443.056.053.143.858.747.657.751.40.1
Average Gains1.7
", + "image_path": "6f086c3a96cfcb2840bc172b7f60714ad329af973fbe7d6769ad43be75ace803.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 481, + 482, + 589 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 481, + 482, + 589 + ], + "spans": [ + { + "bbox": [ + 130, + 481, + 482, + 589 + ], + "type": "text", + "content": "Results on OfficeHome: The OfficeHome dataset encompasses 12 tasks across the Art (A), Clipart (C), Product (P), and Real World (R) domains. Target accuracy results for all tasks are presented in Tab. 3. As evident in Tab. 3, the UDPCS method surpasses the performance of the underlying UDA methods, with a maximum gain of " + }, + { + "bbox": [ + 130, + 481, + 482, + 589 + ], + "type": "inline_equation", + "content": "1.8\\%" + }, + { + "bbox": [ + 130, + 481, + 482, + 589 + ], + "type": "text", + "content": " in average target accuracy. As seen from Tab. 3, our methods, 'MCC+Ours' and 'NWD+Ours,' achieves the best performance compared to all the other methods. Although OfficeHome presents a challenge with its relatively small sample size per domain, the UDPCS technique still manages to achieve an average gain of " + }, + { + "bbox": [ + 130, + 481, + 482, + 589 + ], + "type": "inline_equation", + "content": "0.9\\%" + }, + { + "bbox": [ + 130, + 481, + 482, + 589 + ], + "type": "text", + "content": ", demonstrating its effectiveness." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 605, + 432, + 620 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 432, + 620 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 432, + 620 + ], + "type": "text", + "content": "5 More Empirical Analysis and Ablation Studies" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "text", + "content": "Ablation Studies: To assess the impact of various components of the proposed UDPCS method, we conduct ablation studies and present the results in Tab. 4. The table outlines experiments on three key components: candidate loss " + }, + { + "bbox": [ + 130, + 629, + 482, + 667 + ], + "type": "inline_equation", + "content": "(L_{c})" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 159, + 482, + 304 + ], + "blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 150 + ], + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 150 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 150 + ], + "type": "text", + "content": "Table 3: Accuracy(%) on OfficeHome dataset. Values in red are the gains achieved by the proposed UDPCS method. Values underlined are the best-performing models in a column. (Avg. = Average Accuracy). Appendix A1 presents additional results." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 159, + 482, + 304 + ], + "lines": [ + { + "bbox": [ + 132, + 159, + 482, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 159, + 482, + 304 + ], + "type": "table", + "html": "
ModelA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.Gains
MDD (ICML'19)75.556.27963.172.572.663.155.179.773.360.183.669.5-
+Ours77.657.880.565.475.175.465.156.581.674.161.384.771.31.8
MCC(ECCV'20)79.858.183.268.676.678.667.855.582.274.460.885.872.6
+ Ours81.159.384.169.27879.669.156.482.874.762.186.473.61
Leco (ACCV'22)78.758.382.468.679.179.367.556.282.67560.98672.9
+Ours79.159.282.768.879.479.367.756.982.675.261.186.473.20.3
SDAT(ICML'22)77.258.981.266.675.876.863.95781.875.164.885.872.1
+Ours78.159.782.16776.37764.457.682.675.265.28672.60.5
NWD(CVPR'22)80.158.183.467.977.278.667.955.78274.160.785.772.6-
+Ours80.959.183.968.6798068.556.783.274.962.186.773.61
Average Gains0.9
", + "image_path": "e91c96d9e8bb9bc65eff2c09862666bee2b6d3f8d899a23c3e458ae13c4c07d9.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "spans": [ + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": "non-candidate loss " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "(L_{nc})" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": ", and a threshold " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "(\\gamma)" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": ", with a tick mark indicating the inclusion of a component in a particular experiment. The absence of all ticks denotes the use of the base UDA method without our refinement. We evaluate two base UDA methods, MDD and MCC, on the OfficeHome dataset, as detailed in Tab. 4. For the MDD+Ours model, introducing candidate loss " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "(L_{c})" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": " yields a " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "1.2\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": " increase in average accuracy, while adding non-candidate loss " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "(L_{nc})" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": " brings a similar enhancement of " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "1.1\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": ". The inclusion of thresholding " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "(\\gamma)" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": ", particularly with candidate loss, leads to a " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "1.6\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": " improvement, emphasizing the value of focusing on ambiguous samples. The combination of both losses, without the threshold, results in a " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "1.4\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": " uptick, and the full UDPCS model, integrating all components, achieves the highest gain of " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "1.8\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": " over the base MDD model. In the MCC+Ours model, the addition of candidate loss and non-candidate loss individually contributes to improvements of " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "0.4\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "0.7\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": ", respectively. The integration of thresholding, either alone or with other components, consistently enhances performance, with the full UDPCS model outperforming the base MCC model by " + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 327, + 482, + 543 + ], + "type": "text", + "content": ". These findings highlight the synergistic effect of combining candidate loss, non-candidate loss, and thresholding, underscoring the comprehensive effectiveness of the UDPCS method in boosting average accuracy." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "content": "Complexity Analysis: The complexity analysis of the UDPCS method, as presented in Table A1 in the Appendix, illustrates its efficiency in terms of training time while achieving improvements in average accuracy. The UDPCS method achieves higher average accuracy without incurring any significant training time. Please see the Appendix for the complete discussion." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "Hyperparameter " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": ": The exploration of the hyperparameter " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": ", which balances the candidate loss " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "(L_{c})" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " and the non-candidate loss " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "(L_{nc})" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " in the total loss equation " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "(L_{c} + \\lambda L_{nc})" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": ", reveals its impact on the performance of the UDPCS method, as shown in Table 5. We run each of the experiment three times to report the average values. For the MDD+Ours model, setting " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\lambda = 0.5" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " results in an aver" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 132, + 147, + 482, + 285 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "text", + "content": "Table 4: Ablation results (%) on OfficeHome dataset assessing the impact of UDPCS components." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 132, + 147, + 482, + 285 + ], + "lines": [ + { + "bbox": [ + 132, + 147, + 482, + 285 + ], + "spans": [ + { + "bbox": [ + 132, + 147, + 482, + 285 + ], + "type": "table", + "html": "
Model\\(L_c\\)\\(L_{nc}\\)γA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours75.556.27963.172.572.663.155.179.773.360.183.669.5
✓76.95880.264.874.774.863.655.980.973.561.18470.7
✓76.857.379.765.474.575.164.555.780.273.460.583.970.6
✓✓77.458.180.664.475.274.66556.581.473.861.384.471.1
✓✓77.157.680.564.574.875.164.556.481.2746184.370.9
✓✓✓77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours79.858.183.268.676.678.667.855.582.274.460.885.872.6
✓80.45983.869.177.378.76856.58274.261.485.973
✓80.358.88469.277.279.768.555.882.975.161.586.273.3
✓✓80.758.783.56977.178.468.656.782.374.6628673.1
✓✓80.458.88468.877.578.96856.282.974.161.58673.1
✓✓✓81.159.384.169.27879.669.156.482.874.762.186.473.6
", + "image_path": "5a70c5d36c7788ab481ac49ed07949b981ddeea1d305100dced7c00e9fa11e5a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "spans": [ + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": "age accuracy of " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "71.1\\%" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": ", which slightly improves to " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "71.2\\%" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": " when " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "\\lambda = 1" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": ". Further increasing " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": " to 2 maintains the average accuracy of " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "71.2\\%" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": ", suggesting a robust performance across different values of " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": ". Similarly, for the MCC+Ours model, the average accuracy is " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "73.6\\%" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": " for all the " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": " values with slight variations in the standard deviation values. These findings indicate that the UDPCS method is relatively stable across a range of " + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 306, + 482, + 427 + ], + "type": "text", + "content": " values, with minor fluctuations in average accuracy. This stability underscores the method's robustness and the effectiveness of the balanced approach to handling candidate and non-candidate losses in refining predictions for domain adaptation tasks. Please see the Appendix for the complete results of this analysis." + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 167, + 468, + 448, + 571 + ], + "blocks": [ + { + "bbox": [ + 144, + 446, + 468, + 459 + ], + "lines": [ + { + "bbox": [ + 144, + 446, + 468, + 459 + ], + "spans": [ + { + "bbox": [ + 144, + 446, + 468, + 459 + ], + "type": "text", + "content": "Table 5: Accuracy(%) of UDPCS for different " + }, + { + "bbox": [ + 144, + 446, + 468, + 459 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 144, + 446, + 468, + 459 + ], + "type": "text", + "content": " values on OfficeHome dataset." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 167, + 468, + 448, + 571 + ], + "lines": [ + { + "bbox": [ + 167, + 468, + 448, + 571 + ], + "spans": [ + { + "bbox": [ + 167, + 468, + 448, + 571 + ], + "type": "table", + "html": "
λA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
λ = 0.577.258.280.664.875.374.965.156.581.073.961.484.571.1 ±0.1
λ = 177.558.080.665.375.275.165.056.581.674.161.484.571.2±0.02
λ = 277.357.980.865.175.075.365.156.681.574.061.384.471.2±0.01
MCC+Ours
λ = 0.580.959.183.869.677.879.668.956.683.274.862.186.673.6±0.05
λ = 181.059.184.369.377.979.668.956.683.274.762.086.573.6±0.06
λ = 280.959.284.269.278.079.668.956.782.974.862.486.673.6±0.1
", + "image_path": "d0b30ffe7322da405ecc77b5ea8d813c98dc75a325df16928a8b26c574d514bc.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": "Weak Augmentation: The exploration of weak augmentation " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_2" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": " in the candidate set loss for the UDPCS method, as compared to the main results obtained using strong augmentation " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{A}_1" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": ", reveals interesting insights into the method's performance, as shown in Table 6. For the MDD+Ours model, employing weak augmentation results in an average accuracy of " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "69.6\\%" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": ", which is lower than the " + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "inline_equation", + "content": "71.3\\%" + }, + { + "bbox": [ + 130, + 593, + 482, + 666 + ], + "type": "text", + "content": " achieved with strong augmentation. Similarly, the MCC+Ours model ex" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "hibits a decrease in average accuracy from " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "73.6\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": " with strong augmentation to " + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "inline_equation", + "content": "72.8\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": " with weak augmentation. These findings suggest that strong augmentation plays a crucial role in the effectiveness of the UDPCS method, particularly in refining predictions for domain adaptation tasks. Further augmentation related experiments are reported in the Appendix." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 167, + 228, + 447, + 320 + ], + "blocks": [ + { + "bbox": [ + 130, + 195, + 482, + 218 + ], + "lines": [ + { + "bbox": [ + 130, + 195, + 482, + 218 + ], + "spans": [ + { + "bbox": [ + 130, + 195, + 482, + 218 + ], + "type": "text", + "content": "Table 6: Accuracy(%) of UDPCS for different augmentation used on OfficeHome dataset. (Aug. = Augmentation)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 167, + 228, + 447, + 320 + ], + "lines": [ + { + "bbox": [ + 167, + 228, + 447, + 320 + ], + "spans": [ + { + "bbox": [ + 167, + 228, + 447, + 320 + ], + "type": "table", + "html": "
Aug.A-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
Weak76.356.47963.373.573.663.154.779.37359.783.169.6
Strong77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
Weak79.958.283.269.176.878.567.656.781.974.161.28672.8
Strong81.159.384.169.27879.669.156.482.874.762.186.473.6
", + "image_path": "cc4873c1a5e4f20b5876b0741c39c0a86d4f565d31a598153bd82cbdb6f53cab.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": "Threshold " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": ": The examination of different threshold values " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "(\\gamma)" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": " used in the candidate loss, Eqn. (2), of the UDPCS method provides insights into the method's sensitivity to this hyperparameter, as shown in Table 7. For the MDD+Ours model, the average accuracy remains consistent at " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "71.1\\%" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": " for both " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "\\gamma = 0.8" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "\\gamma = 0.9" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": ", with a slight increase to " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "71.3\\%" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": " when " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "\\gamma = 0.85" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": ". Similarly, for the MCC+Ours model, the average accuracy is stable at " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "73.5\\%" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": " for " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "\\gamma = 0.8" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "\\gamma = 0.9" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": ", with a marginal increase to " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "73.6\\%" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": " at " + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "inline_equation", + "content": "\\gamma = 0.85" + }, + { + "bbox": [ + 130, + 341, + 482, + 461 + ], + "type": "text", + "content": ". The slight variations in average accuracy suggest that while the choice of threshold can influence the method's performance, the UDPCS method is not overly sensitive to this hyperparameter." + } + ] + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 167, + 513, + 447, + 620 + ], + "blocks": [ + { + "bbox": [ + 130, + 480, + 482, + 502 + ], + "lines": [ + { + "bbox": [ + 130, + 480, + 482, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 480, + 482, + 502 + ], + "type": "text", + "content": "Table 7: Accuracy(%) of UDPCS for different threshold (" + }, + { + "bbox": [ + 130, + 480, + 482, + 502 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 480, + 482, + 502 + ], + "type": "text", + "content": ") values on OfficeHome dataset." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 167, + 513, + 447, + 620 + ], + "lines": [ + { + "bbox": [ + 167, + 513, + 447, + 620 + ], + "spans": [ + { + "bbox": [ + 167, + 513, + 447, + 620 + ], + "type": "table", + "html": "
A-P A-C A-R C-A C-P C-R P-A P-C P-R R-A R-C R-P Avg.
MDD+ours
γ = 0.877.158.580.864.975.174.964.756.581.673.861.3
γ = 0.8577.657.880.565.475.175.465.156.581.674.161.3
γ = 0.977.358.181.164.9757564.556.681.47461.1
MCC+Ours
γ = 0.881.159.383.669.27879.669.156.482.874.761.9
γ = 0.8581.159.384.169.27879.669.156.482.874.762.1
γ = 0.980.759.383.869.477.579.368.956.582.974.762.4
", + "image_path": "fc12654099c38c9285c0eb065d5bb9a737938be488bd1da217c01b923c28149f.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "Cross entropy: The investigation of using cross entropy as an alternative to KL divergence for the candidate loss, Eqn.(2) in the UDPCS method reveals" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 413, + 90, + 447, + 100 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": "the method's adaptability and effectiveness across different loss functions, as demonstrated in Table 8. For the MDD+Ours model, employing cross entropy for the candidate loss yields an average accuracy of " + }, + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "inline_equation", + "content": "71.3\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": ", which is identical to the average accuracy achieved using KL divergence. Similarly, the MCC+Ours model maintains an average accuracy of " + }, + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "inline_equation", + "content": "73.6\\%" + }, + { + "bbox": [ + 130, + 116, + 482, + 213 + ], + "type": "text", + "content": " with both cross entropy and KL divergence. The consistency in average accuracy across different loss functions suggests that the method's ability to refine predictions for domain adaptation tasks is robust to the choice of loss function." + } + ] + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 176, + 262, + 440, + 353 + ], + "blocks": [ + { + "bbox": [ + 131, + 230, + 481, + 254 + ], + "lines": [ + { + "bbox": [ + 131, + 230, + 481, + 254 + ], + "spans": [ + { + "bbox": [ + 131, + 230, + 481, + 254 + ], + "type": "text", + "content": "Table 8: Accuracy(%) of UDPCS for different loss functions on OfficeHome dataset. (CE= Cross Entropy, KL=KL Divergence)" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 176, + 262, + 440, + 353 + ], + "lines": [ + { + "bbox": [ + 176, + 262, + 440, + 353 + ], + "spans": [ + { + "bbox": [ + 176, + 262, + 440, + 353 + ], + "type": "table", + "html": "
LossA-PA-CA-RC-AC-PC-RP-AP-CP-RR-AR-CR-PAvg.
MDD+Ours
CE77.458.180.764.975.275.365.356.381.573.961.784.871.3
KL77.657.880.565.475.175.465.156.581.674.161.384.771.3
MCC+Ours
CE81.159.384.169.27879.669.156.482.874.762.186.473.6
KL80.859.284.569.477.979.768.456.583.275.162.186.473.6
", + "image_path": "324146ac1c047d95fb0be3c9a4278dfcb6457bd420f69a99d762be16c46de77f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 394, + 220, + 407 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 394, + 220, + 407 + ], + "spans": [ + { + "bbox": [ + 131, + 394, + 220, + 407 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 418, + 482, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 418, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 418, + 482, + 540 + ], + "type": "text", + "content": "In conclusion, UDPCS presents a novel approach to UDA by leveraging the concept of disambiguation and introducing pseudo-candidate sets to approximate the true labels of the target set. Our method is distinguished by the use of two loss functions to refine predictions within the pseudo-candidate set and to penalize incorrect labels outside of it, combined with a threshold-based strategy to focus on ambiguous samples. Through comprehensive experiments on the benchmark datasets, our approach has demonstrated its effectiveness in consistently improving target set accuracy across diverse domains. We also conduct thorough analysis and ablation studies. The results highlight the potential of our method to serve as a robust solution for UDA challenges." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 556, + 247, + 571 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 556, + 247, + 571 + ], + "spans": [ + { + "bbox": [ + 132, + 556, + 247, + 571 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "The research of AD is supported in part by the Prime Minister Research Fellowship, Ministry of Education, Government of India. VNB would like to acknowledge the support through the Govt of India SERB IMPRINT and DST ICPS funding programs for this work. The research of CKM is supported by the LiDAR and Camera Sensors Data based Deep Learning Algorithms for Autonomous Driving System project, funded by Govt. of India SERB program. The research is also partly supported by the Indo-Norwegian Collaboration in" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 189 + ], + "type": "text", + "content": "Autonomous Cyber-Physical Systems (INCAPS) project: 287918 of the International Partnerships for Excellent Education, Research and Innovation (INTPART) program and the Low-Altitude UAV Communication and Tracking (LUCAT) project: 280835 of the IKTPLUSS program from the Research Council of Norway. We are grateful to the anonymous reviewers for the feedback that helped improved the presentation of this paper." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 205, + 197, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 197, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 197, + 217 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 134, + 228, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 262 + ], + "type": "text", + "content": "1. Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., Vaughan, J.W.: A theory of learning from different domains. Machine Learning 79(1-2), 151-175 (2010)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 263, + 480, + 294 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 263, + 480, + 294 + ], + "spans": [ + { + "bbox": [ + 138, + 263, + 480, + 294 + ], + "type": "text", + "content": "2. Chen, C., Fu, Z., Chen, Z., Jin, S., Cheng, Z., Jin, X., Hua, X.S.: Homm: Higher-order moment matching for unsupervised domain adaptation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 3422-3429 (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 295, + 480, + 338 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 295, + 480, + 338 + ], + "spans": [ + { + "bbox": [ + 138, + 295, + 480, + 338 + ], + "type": "text", + "content": "3. Chen, L., Chen, H., Wei, Z., Jin, X., Tan, X., Jin, Y., Chen, E.: Reusing the task-specific classifier as a discriminator: Discriminator-free adversarial domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7181-7190 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 339, + 480, + 381 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 339, + 480, + 381 + ], + "spans": [ + { + "bbox": [ + 138, + 339, + 480, + 381 + ], + "type": "text", + "content": "4. Chen, W., Lin, L., Yang, S., Xie, D., Pu, S., Zhuang, Y.: Self-supervised noisy label learning for source-free unsupervised domain adaptation. In: 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 10185-10192. IEEE (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 383, + 480, + 415 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 383, + 480, + 415 + ], + "spans": [ + { + "bbox": [ + 138, + 383, + 480, + 415 + ], + "type": "text", + "content": "5. Chen, Y., Wei, C., Kumar, A., Ma, T.: Self-training avoids using spurious features under domain shift. Advances in Neural Information Processing Systems 33, 21061-21071 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 415, + 480, + 436 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 415, + 480, + 436 + ], + "spans": [ + { + "bbox": [ + 138, + 415, + 480, + 436 + ], + "type": "text", + "content": "6. Csurka, G.: Domain adaptation for visual applications: A comprehensive survey, pp. 1-35. Springer (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 437, + 480, + 458 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 437, + 480, + 458 + ], + "spans": [ + { + "bbox": [ + 138, + 437, + 480, + 458 + ], + "type": "text", + "content": "7. Cubuk, E.D., Zoph, B., Shlens, J., Le, Q.V.: Randaugment: Practical automated data augmentation with a reduced search space (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 459, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 459, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 138, + 459, + 480, + 479 + ], + "type": "text", + "content": "8. DeVries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout (2017)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 480, + 480, + 512 + ], + "type": "text", + "content": "9. Du, Z., Li, J., Su, H., Zhu, L., Lu, K.: Cross-domain gradient discrepancy minimization for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 3937-3946 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 134, + 514, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 514, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 134, + 514, + 480, + 578 + ], + "type": "text", + "content": "10. Feng, L., Lv, J., Han, B., Xu, M., Niu, G., Geng, X., An, B., Sugiyama, M.: Provably consistent partial-label learning. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 10948-10960. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/7bd28f15a49d5e5848d6ec70e584e625-Paper.pdf" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 579, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 579, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 134, + 579, + 480, + 610 + ], + "type": "text", + "content": "11. Ganin, Y., Lempitsky, V.: Unsupervised domain adaptation by backpropagation. In: Proceedings of the 32nd International Conference on Machine Learning (ICML) (2015)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 134, + 611, + 480, + 643 + ], + "type": "text", + "content": "12. Gao, Z., Zhang, S., Huang, K., Wang, Q., Zhong, C.: Gradient distribution alignment certificates better adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8937-8946 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 643, + 480, + 665 + ], + "type": "text", + "content": "13. Jiang, J., Chen, B., Fu, B., Long, M.: Transfer-learning-library. https://github.com/thuml/Transfer-Learning-Library (2020)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 414, + 91, + 447, + 100 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "text", + "content": "14. Jin, X., Lan, C., Zeng, W., Chen, Z.: Re-energizing domain discriminator with sample relabeling for adversarial domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 9174-9183 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 480, + 182 + ], + "type": "text", + "content": "15. Jin, X., Lan, C., Zeng, W., Chen, Z.: Minimum class confusion for versatile domain adaptation. In: Proceedings of the European Conference on Computer Vision (ECCV) (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 480, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 480, + 214 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 480, + 214 + ], + "type": "text", + "content": "16. Jing, X., Qian, K., Jianu, T., Luo, S.: Unsupervised adversarial domain adaptation for sim-to-real transfer of tactile images. IEEE Transactions on Instrumentation and Measurement 72, 1-11 (2023). https://doi.org/10.1109/TIM.2023.3268458" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 214, + 480, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 214, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 133, + 214, + 480, + 236 + ], + "type": "text", + "content": "17. Kamilaris, A., Prenafeta-Boldú, F.X.: Deep learning in agriculture: A survey. Computers and Electronics in Agriculture 147, 70-90 (2018)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 236, + 480, + 267 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 236, + 480, + 267 + ], + "spans": [ + { + "bbox": [ + 133, + 236, + 480, + 267 + ], + "type": "text", + "content": "18. Le, T., Nguyen, T., Ho, N., Bui, H., Phung, D.: Lamda: Label matching deep domain adaptation. In: International Conference on Machine Learning. pp. 6043-6054. PMLR (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 267, + 480, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 267, + 480, + 289 + ], + "spans": [ + { + "bbox": [ + 133, + 267, + 480, + 289 + ], + "type": "text", + "content": "19. LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436-444 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 289, + 480, + 321 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 289, + 480, + 321 + ], + "spans": [ + { + "bbox": [ + 133, + 289, + 480, + 321 + ], + "type": "text", + "content": "20. Lee, C.Y., Batra, T., Baig, M.H., Ulbricht, D.: Sliced wasserstein discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10285-10295 (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 321, + 480, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 321, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 133, + 321, + 480, + 354 + ], + "type": "text", + "content": "21. Li, S., Liu, C., Lin, Q., Xie, B., Ding, Z., Huang, G., Tang, J.: Domain conditioned adaptation network. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 11386-11393 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 354, + 480, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 354, + 480, + 374 + ], + "spans": [ + { + "bbox": [ + 133, + 354, + 480, + 374 + ], + "type": "text", + "content": "22. Liu, H., Wang, J., Long, M.: Cycle self-training for domain adaptation. Advances in Neural Information Processing Systems 34, 22968-22981 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 374, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 374, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 133, + 374, + 480, + 418 + ], + "type": "text", + "content": "23. Liu, X., Guo, Z., Li, S., Xing, F., You, J., Kuo, C.C.J., El Fakhri, G., Woo, J.: Adversarial unsupervised domain adaptation with conditional and label shift: Infer, align and iterate. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 10367-10376 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 418, + 480, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 418, + 480, + 450 + ], + "spans": [ + { + "bbox": [ + 133, + 418, + 480, + 450 + ], + "type": "text", + "content": "24. Liu, Y., Zhou, Z., Sun, B.: Cot: Unsupervised domain adaptation with clustering and optimal transport. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19998-20007 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 450, + 480, + 504 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 450, + 480, + 504 + ], + "spans": [ + { + "bbox": [ + 133, + 450, + 480, + 504 + ], + "type": "text", + "content": "25. Lv, J., Xu, M., Feng, L., Niu, G., Geng, X., Sugiyama, M.: Progressive identification of true labels for partial-label learning. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 6500-6510. PMLR (13-18 Jul 2020), https://proceedings.mlr.press/v119/lv20a.html" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 504, + 480, + 548 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 504, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 133, + 504, + 480, + 548 + ], + "type": "text", + "content": "26. Mei, K., Zhu, C., Zou, J., Zhang, S.: Instance adaptive self-training for unsupervised domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXVI 16. pp. 415-430. Springer (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 548, + 480, + 580 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 548, + 480, + 580 + ], + "spans": [ + { + "bbox": [ + 133, + 548, + 480, + 580 + ], + "type": "text", + "content": "27. Na, J., Jung, H., Chang, H.J., Hwang, W.: Fixbi: Bridging domain spaces for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1094-1103 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 580, + 480, + 612 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 580, + 480, + 612 + ], + "spans": [ + { + "bbox": [ + 133, + 580, + 480, + 612 + ], + "type": "text", + "content": "28. Nguyen, T., Le, T., Dam, N., Tran, Q.H., Nguyen, T., Phung, D.Q.: Tidot: A teacher imitation learning approach for domain adaptation with optimal transport. In: IJCAI. pp. 2862-2868 (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 612, + 480, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 612, + 480, + 633 + ], + "spans": [ + { + "bbox": [ + 133, + 612, + 480, + 633 + ], + "type": "text", + "content": "29. Patel, V.M., Gopalan, R., Li, R., Chellappa, R.: Visual domain adaptation: A survey of recent advances. IEEE Signal Processing Magazine 32(3), 53-69 (2015)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 133, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 633, + 480, + 665 + ], + "type": "text", + "content": "30. Peng, X., Bai, Q., Xia, X., Huang, Z., Saenko, K., Wang, B.: Moment matching for multi-source domain adaptation. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 1406-1415 (2019)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 138 + ], + "type": "text", + "content": "31. Peng, X., Usman, B., Kaushik, N., Hoffman, J., Wang, D., Saenko, K.: Visda: The visual domain adaptation challenge (2017)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 138, + 482, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 138, + 482, + 171 + ], + "spans": [ + { + "bbox": [ + 130, + 138, + 482, + 171 + ], + "type": "text", + "content": "32. Phan, H., Le, T., Phung, T., Bui, A.T., Ho, N., Phung, D.: Global-local regularization via distributional robustness. In: International Conference on Artificial Intelligence and Statistics. pp. 7644-7664. PMLR (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 215 + ], + "type": "text", + "content": "33. Prabhu, V., Khare, S., Kartik, D., Hoffman, J.: Sentry: Selective entropy optimization via committee consistency for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8558-8567 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 237 + ], + "type": "text", + "content": "34. Qian, N.: On the momentum term in gradient descent learning algorithms. Neural networks 12(1), 145-151 (1999)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 481, + 270 + ], + "type": "text", + "content": "35. Rangwani, H., Aithal, S.K., Mishra, M., Jain, A., Radhakrishnan, V.B.: A closer look at smoothness in domain adversarial training. In: International Conference on Machine Learning. pp. 18378-18399. PMLR (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 270, + 481, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 270, + 481, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 270, + 481, + 304 + ], + "type": "text", + "content": "36. Saito, K., Watanabe, K., Ushiku, Y., Harada, T.: Maximum classifier discrepancy for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 304, + 481, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 481, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 481, + 325 + ], + "type": "text", + "content": "37. Shen, D., Wu, G., Suk, H.I.: Deep learning in medical image analysis. Annual Review of Biomedical Engineering 19, 221-248 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 325, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 325, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 325, + 481, + 369 + ], + "type": "text", + "content": "38. Shin, I., Woo, S., Pan, F., Kweon, I.S.: Two-phase pseudo label densification for self-training based domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIII 16. pp. 532-548. Springer (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 481, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 481, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 481, + 445 + ], + "type": "text", + "content": "39. Sohn, K., Berthelot, D., Carlini, N., Zhang, Z., Zhang, H., Raffel, C.A., Cubuk, E.D., Kurakin, A., Li, C.L.: Fixmatch: Simplifying semi-supervised learning with consistency and confidence. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 596-608. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/06964dce9adbb1c5cb5d6e3d9838f733-Paper.pdf" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 446, + 481, + 489 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 481, + 489 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 481, + 489 + ], + "type": "text", + "content": "40. Tian, Y., Yu, X., Fu, S.: Partial label learning: Taxonomy, analysis and outlook. Neural Networks 161, 708-734 (2023). https://doi.org/https://doi.org/10.1016/j.neunet.2023.02.019, https://www.sciencedirect.com/science/article/pii/S0893608023000825" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 490, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 490, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 132, + 490, + 481, + 522 + ], + "type": "text", + "content": "41. Tzeng, E., Hoffman, J., Saenko, K., Darrell, T.: Adversarial discriminative domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 522, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 522, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 522, + 481, + 555 + ], + "type": "text", + "content": "42. Venkateswara, H., Eusebio, J., Chakraborty, S., Panchanathan, S.: Deep hashing network for unsupervised domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 5018-5027 (2017)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 555, + 481, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 481, + 587 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 481, + 587 + ], + "type": "text", + "content": "43. Wang, X., Zhuo, J., Zhang, M., Wang, S., Fang, Y.: Revisiting unsupervised domain adaptation models: A smoothness perspective. In: Proceedings of the Asian Conference on Computer Vision. pp. 1504-1521 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "type": "text", + "content": "44. Wei, G., Lan, C., Zeng, W., Chen, Z.: Metaalign: Coordinating domain alignment and classification for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16643-16653 (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 665 + ], + "type": "text", + "content": "45. Wei, G., Lan, C., Zeng, W., Zhang, Z., Chen, Z.: Toalign: task-oriented alignment for unsupervised domain adaptation. Advances in Neural Information Processing Systems 34, 13834-13846 (2021)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 413, + 91, + 447, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 413, + 91, + 447, + 100 + ], + "spans": [ + { + "bbox": [ + 413, + 91, + 447, + 100 + ], + "type": "text", + "content": "UDPCS" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 369 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 171 + ], + "type": "text", + "content": "46. Wen, H., Cui, J., Hang, H., Liu, J., Wang, Y., Lin, Z.: Leveraged weighted loss for partial label learning. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 11091-11100. PMLR (18-24 Jul 2021), https://proceedings.mlr.press/v139/wen21a.html" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 172, + 481, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 226 + ], + "type": "text", + "content": "47. Wu, D.D., Wang, D.B., Zhang, M.L.: Revisiting consistency regularization for deep partial label learning. In: Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., Sabato, S. (eds.) Proceedings of the 39th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 162, pp. 24212-24225. PMLR (17-23 Jul 2022), https://proceedings.mlr.press/v162/wu221.html" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 227, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 227, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 133, + 227, + 481, + 270 + ], + "type": "text", + "content": "48. Xie, X., Chen, J., Li, Y., Shen, L., Ma, K., Zheng, Y.: Self-supervised cyclegan for object-preserving image-to-image domain adaptation. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XX 16. pp. 498-513. Springer (2020)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 271, + 481, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 271, + 481, + 303 + ], + "spans": [ + { + "bbox": [ + 133, + 271, + 481, + 303 + ], + "type": "text", + "content": "49. Yan, Y., Guo, Y.: Partial label unsupervised domain adaptation with class-prototype alignment. In: The Eleventh International Conference on Learning Representations (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 304, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 481, + 336 + ], + "type": "text", + "content": "50. Zhang, Y., Liu, T., Long, M., Jordan, M.: Bridging theory and algorithm for domain adaptation. In: Proceedings of the 36th International Conference on Machine Learning (ICML) (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 369 + ], + "type": "text", + "content": "51. Zhou, L., Ye, M., Zhu, X., Xiao, S., Fan, X.Q., Neri, F.: Homeomorphism alignment for unsupervised domain adaptation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 18699-18710 (2023)" + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "A. Dayal et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_content_list.json b/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..e3bda60b7dca8ca225fedace4a7f336d637bd9e9 --- /dev/null +++ b/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_content_list.json @@ -0,0 +1,1822 @@ +[ + { + "type": "text", + "text": "Improving Video Segmentation via Dynamic Anchor Queries", + "text_level": 1, + "bbox": [ + 248, + 140, + 754, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yikang Zhou $^{1}$ , Tao Zhang $^{1,2}$ , Shumping Ji $^{1}$ , Shuicheng Yan $^{2}$ , and Xiangtai Li $^{2}$", + "bbox": [ + 315, + 212, + 687, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Wuhan University", + "bbox": [ + 433, + 255, + 570, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 Skywork AI", + "bbox": [ + 452, + 268, + 547, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "zhang_tao@whu.edu.cn, zhouyik@whu.edu.cn, xiangtai94@gmail.com", + "bbox": [ + 259, + 284, + 741, + 297 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Project page: https://zhang-tao-whu.github.io/projects/DVIS_DAQ", + "bbox": [ + 264, + 297, + 738, + 311 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Modern video segmentation methods adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects. However, the emergence and disappearance of objects interrupt the smooth feature transition, and even widen this feature transition gap between anchor and target queries, which causes these methods to all underperform on newly emerging and disappearing objects that are common in the real world. We introduce Dynamic Anchor Queries (DAQ) to shorten the transition gap by dynamically generating anchor queries based on the features of potential newly emerging and disappearing candidates. Furthermore, we introduce a query-level object Emergence and Disappearance Simulation (EDS) strategy, which unleashes DAQ's potential without any additional cost. Finally, we combine our proposed DAQ and EDS with the previous method, DVIS, to obtain DVIS-DAQ. Extensive experiments demonstrate that DVIS-DAQ achieves a new state-of-the-art (SOTA) performance on five mainstream video segmentation benchmarks.", + "bbox": [ + 259, + 354, + 743, + 603 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Video segmentation $\\cdot$ Dynamic anchor design $\\cdot$ Universal segmentation", + "bbox": [ + 259, + 617, + 740, + 645 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 674, + 375, + 690 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Video segmentation aims at simultaneously identifying, segmenting, and tracking all objects of interest within a video [24, 47, 67, 68], which has many applications, including autonomous driving, video editing, content analysis, and video understanding [5, 45]. Modern video segmentation methods [18, 21, 23, 28, 33, 61, 70, 73, 74] adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor", + "bbox": [ + 212, + 709, + 787, + 801 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* The first two authors contribute equally. This work was performed when Tao Zhang was an Intern at Skywork AI. Corresponding authors: Shunping Ji and Xiangtai Li.", + "bbox": [ + 217, + 811, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/3267843f58267bec669762b378d9bad1e9ba9f6fd458f74a24f2350a2a7f492e.jpg", + "image_caption": [ + "Fig. 1: The preliminary experiments and our results. We analyze current query-based video segmentation methods' capabilities in handling objects' emergence and disappearance within videos. The scatter plot on the left illustrates the recall ratios for newly emerging and disappearing video objects on a subset of the BDD [71] dataset. The visual comparison is presented in the middle. The top two rows output from DVIS [73] and GenVIS [21], respectively. And the bottom row output from our method. The poor performance of previous methods on new emergence detection and disappearance filtering is highlighted by a red circle. On the right side, our method outperforms the current SOTA on mainstream video segmentation datasets." + ], + "image_footnote": [], + "bbox": [ + 223, + 143, + 418, + 270 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/77e09471c7b28231bf3f73b1ad94b0048deafcfe253f4cf4bcc7fcbf25f1965e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 426, + 143, + 581, + 267 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/6ddd6e1a3f54573033103a600761a35de81e594de222fb729ac4bdb5962c0472.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 581, + 143, + 779, + 268 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects.", + "bbox": [ + 212, + 440, + 784, + 470 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, these query-based methods exhibit a notable limitation: they tend to underperform when dealing with newly emerging or disappearing objects, even with recent state-of-the-art (SOTA) methods [21, 73]. As shown in the left part of Fig. 1, these methods only achieve less than $45\\%$ recall ratio on emerging and disappearing objects. As illustrated in the middle part of Fig. 1, they often fail to detect newly emerging objects. And they may incorrectly track a different, similar object when the original object disappears.", + "bbox": [ + 212, + 473, + 787, + 579 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A natural question arises: \"What causes the huge performance gap between continuously appearing objects and emerging/disappearing objects?\" We argue the answer lies in the unreasonable anchor queries for newly emerged and disappeared objects used in current methods. As shown in Fig. 2, in the SOTA query-based methods [21, 23, 73, 74], the anchor query for a newly emerged object is a background query, and the target is the feature representation of the object. In contrast, the anchor query for a disappeared object is the feature representation of the object before it disappeared, and the target is a background feature. A significant feature transition gap between background and foreground queries poses considerable challenges for retaining the smooth feature transition between anchor and target queries.", + "bbox": [ + 212, + 580, + 787, + 747 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we address this challenge by introducing Dynamic Anchor Queries (DAQ) mechanism to detect the emergence and disappearance of objects. As illustrated on the right side of Fig. 2, we regard all objects segmented in the current frame as potential candidates for newly emerging objects. We dynamically generate emergence anchor queries based on the features of these candidates to reduce the transition gap significantly. On the other hand, we des", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/c11ab16cb7e92e388239eaced80848f59b22347eef4e5cf76fe245051b44ff23.jpg", + "image_caption": [ + "Fig.2: The process of handling newly emerging and disappearing objects in different methods. Unlike previous approaches that treat appearing, disappearing, and tracked objects equally, our method dynamically generates anchor queries for emergence and disappearance based on candidate objects' features to effectively shorten the transition gap." + ], + "image_footnote": [], + "bbox": [ + 222, + 142, + 781, + 286 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "ignate all tracked objects as candidates for disappearing objects and generate disappearance anchor queries dynamically using their features. These emergence and disappearance anchor queries and the representations of tracked objects are collectively inputted into the tracker to identify the objects of interest in the current frame. Objects identified by the emergence anchor queries are classified as newly appeared, while those pinpointed by the disappearance anchor queries are recognized as having disappeared, prompting their removal. The remaining queries are responsible for tracking objects present across both past and current frames.", + "bbox": [ + 212, + 393, + 784, + 527 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The proposed DAQ mechanism enhances the network's ability to handle the emergence and disappearance of objects. To further leverage the capabilities of DAQ, we propose a training time simulation strategy for the emergence and disappearance of objects, termed Emergence and Disappearance Simulation (EDS). This strategy simulates emergence and disappearance events by removing high-level object queries. We mimic object emergence by randomly eliminating some object queries propagated from the previous frame. Likewise, we simulate object disappearance by removing some of the current frame's object queries. Our simple yet effective simulation strategy generates numerous instances of object emergence and disappearance during training, thereby enabling comprehensive training of the DAQ mechanism and maximizing its potential.", + "bbox": [ + 212, + 530, + 785, + 696 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To verify the effectiveness of our proposed DAQ mechanism and EDS strategy, we integrate them into the current SOTA method, DVIS [73], to construct the DVIS-DAQ. As shown in the right part of Fig. 1, the DVIS-DAQ achieves new SOTA performance on five mainstream video segmentation benchmarks.", + "bbox": [ + 212, + 696, + 785, + 757 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, our main contributions are as follows:", + "bbox": [ + 238, + 758, + 607, + 771 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "1. We have found that current query-based methods fall short in managing objects' emergence and disappearance due to the considerable transition gap between foreground and background queries. We propose a Dynamic Anchor Queries (DAQ) mechanism to address this challenge. The DAQ mechanism", + "bbox": [ + 222, + 779, + 785, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 653, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "dynamically generates anchor queries for objects' emergence and disappearance, thereby shortening the gap and effectively overcoming the challenge.", + "bbox": [ + 241, + 146, + 784, + 176 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2. To further unleash the potential of the DAQ mechanism, we introduce the Emergence and Disappearance Simulation (EDS) strategy. This straightforward and efficient approach amplifies the number of emergence and disappearance cases, thereby ensuring comprehensive training of the DAQ.", + "bbox": [ + 222, + 176, + 782, + 236 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3. We enhance the SOTA video segmentation method DVIS by integrating our proposed DAQ mechanism and EDS strategy, resulting in DVIS-DAQ. With extensive experiments on five video segmentation benchmarks, DVIS-DAQ achieves new SOTA performance on all benchmarks. We further present detailed ablation studies to verify the effectiveness of each component.", + "bbox": [ + 222, + 238, + 784, + 311 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 217, + 338, + 387, + 353 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Video Instance Segmentation (VIS). Earlier works [35, 68, 69] extend image instance segmentation methods by adding tracking heads and learning the feature association. With the rise of vision transformer [8, 16, 55], current SOTA video instance methods [10, 18, 22, 23, 28, 33, 37, 55, 60, 61, 70] adopt query-based designs. In particular, Video K-Net [34] and IDOL [61] directly learn the query association embeddings via contrastive learning. After that, association-based methods [23, 33, 37, 61, 68, 70], accomplish the tracking of video targets between adjacent frames or adjacent video clips through object matching. Meanwhile, several models [10, 22, 60] directly predict 3D volumes of video instances across times in a semi-online manner. On the other hand, propagation-based methods [18, 21, 28, 73] delegate the tracking problem to the transformer decoder. They take the object queries outputted from the previous frame or video clip as input and iteratively optimize them to segment the objects in the current frame. Inspired by the design of the dual encoder in the low-level area [53] and multi-task learning [31, 63], several works have also decoupled the tracking decoder and segmentation decoder. Note that these methods can also be applied for video panoptic segmentation (VPS) and video semantic segmentation (VSS) tasks [24, 39, 40, 48, 56, 80] by adding queries for segmenting the stuff. However, both poorly handle challenges such as new-emerging objects and target disappearance. Our approach improves the model's ability to address these challenges by employing dynamic anchor queries to manage the emergence and disappearance of objects.", + "bbox": [ + 217, + 371, + 785, + 702 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Universal Video Segmentation. Current efforts in the field of video segmentation directly draw upon the design of universal image segmentation models [10, 12, 13, 54, 57, 66, 75] to develop universal video segmentation models [1, 26, 30, 33, 34, 59, 73], achieving comparable or even superior performance to specialized video segmentation methods. Video K-Net [34] and TubeFormer [26] are the first to unify all three video segmentation tasks. TarVIS [1] extends the concept of mask classification from image segmentation to video segmentation, accomplishing universal video segmentation via one shared model. DVIS [73] receives frame object query outputs from Mask2Former [10] for universal video", + "bbox": [ + 217, + 704, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "segmentation. Recently, several works [32, 64] unified both image and video segmentation in one model. However, these methods are still unaware of object emergence and disappearance problems, which are significant for long videos.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Video Object Tracking. Object tracking [3,7,14,17,42,43,50,51,65,72,76,77] is a crucial task in VIS and VPS [4, 19, 24, 25, 29, 78], and many works adopt the tracking-by-detection paradigm [6, 27, 38, 46, 52, 58, 62, 79]. These methods divide the task into two sub-tasks, where an object detector first detects objects and then associates them using a tracking algorithm. Recent works [2, 15, 44, 49] also perform clip-wise segmentation and tracking. However, the former [15, 44] only focuses on single-object mask tracking, while the latter [49] considers global tracking via clip-level matching. Our work belongs to mask-based tracking, which is orthogonal to these existing tracking methods.", + "bbox": [ + 212, + 191, + 787, + 328 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 351, + 330, + 367 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Preliminary", + "text_level": 1, + "bbox": [ + 215, + 383, + 361, + 398 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Query-based Video Segmentation Formulations. Modern mainstream video segmentation methods [21,33,61,73,74] rely on queries to represent objects and achieve cross-frame association of objects. Here, we summarize current query-based video segmentation methods with the following formulation:", + "bbox": [ + 212, + 407, + 792, + 469 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nQ _ {S e g} ^ {T} = \\mathcal {S} (\\mathcal {I} ^ {T}), \\quad Q ^ {T} = \\mathcal {A} (Q ^ {T - 1}, Q _ {S e g} ^ {T}), \\quad \\mathcal {M} ^ {T}, \\mathcal {C} ^ {T} = \\mathcal {D} (Q ^ {T}). \\qquad (1)\n$$\n", + "text_format": "latex", + "bbox": [ + 285, + 479, + 785, + 500 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "First, a segmenter $\\mathcal{S}$ extracts query representations of objects $Q_{Seg}^{T}$ from a single-frame image. Then, an association component $\\mathcal{A}$ establishes connections between the current frame's object representations $Q_{Seg}^{T}$ and $Q^{T-1}$ to obtain associated object representations $Q^{T}$ . Finally, the object representations $Q^{T}$ are decoded to obtain predictions of object categories $\\mathcal{C}^{T}$ and segmentation masks $\\mathcal{M}^{T}$ for the current frame. In this pipeline, the association component $\\mathcal{A}$ is the most critical and challenging part. Most video segmentation methods focus on designing more efficient association modules.", + "bbox": [ + 212, + 510, + 787, + 632 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The current mainstream association modules $\\mathcal{A}$ can be divided into association-based [23,33,61,70] and propagation-based [21,73,74] pipelines. They both model object emergence as a transition from background queries to foreground queries and model disappearance as a transition from foreground queries to background queries. Specifically, we can split $Q$ into $Q_{Fg}$ and $Q_{Bg}$ , and the tracking of continuously appearing objects, newly emerging objects, and disappearing objects can be described as follows:", + "bbox": [ + 212, + 633, + 795, + 739 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nC o n t: Q _ {F g} ^ {T - 1} \\rightarrow Q _ {F g} ^ {T}, E m g: Q _ {B g} ^ {T - 1} \\rightarrow Q _ {F g} ^ {T}, D i s: Q _ {F g} ^ {T - 1} \\rightarrow Q _ {B g} ^ {T} (2)\n$$\n", + "text_format": "latex", + "bbox": [ + 264, + 750, + 785, + 770 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Limitations of the Query-based Methods. We find that current query-based methods [21, 23, 73] perform poorly on objects that emerge and disappear in the middle of a video, as shown in Fig. 1. For emerging objects, SOTA methods often miss detecting them. For disappearing objects, SOTA methods frequently", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 651, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "fail to recognize that the object has disappeared and may incorrectly segment another object. We quantitatively analyzed the recall ratios of emerging and disappearing objects in preliminary experiments using several SOTA methods. We found that the recall ratios of emerging and disappearing objects are very low (below $45\\%$ ) for these methods, as shown in Fig. 1.", + "bbox": [ + 212, + 146, + 782, + 219 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Thorough Analysis and Our Motivation. The same process for handling continuously appearing, emerging, and disappearing objects results in the performance difference of modern query based methods: they have demonstrated satisfactory performance on consistently appearing objects (exceeding 60 AP on the YouTube-VIS [68]), but they exhibit poor performance on newly emerging and disappearing objects. As depicted in Fig. 2 and Eq. 2, in current query-based methods, there should be a significant disparity in the modeling formulation between newly emerging or disappearing objects and consistently appearing objects. The former poses more challenges because of the significant feature gap in the transition between foreground and background queries. In this work, we generate dynamic anchor queries for newly emerging and disappearing objects, resulting in a lower feature transition gap than using the background or foreground query. We term the background or foreground query used in previous methods as Static Anchor Query (SAQ), the query of continuously appearing objects as Continuously Tracked Query (CTQ), and our proposed dynamically generated anchor query as Dynamic Anchor Query (DAQ). We use our proposed DAQ to replace the SAQ to address the challenge above. The details of the DAQ will be introduced in Sec. 3.2.", + "bbox": [ + 212, + 220, + 784, + 492 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Furthermore, we observed that only less than $20\\%$ of samples contain object emergence and disappearance in the existing datasets [39, 47, 68], including the most challenging OVIS [47] dataset. Therefore, to fully unleash the potential of our proposed DAQ, we introduce a simple yet effective query-level object emergence and disappearance simulation strategy, which will be detailed in Sec. 3.3.", + "bbox": [ + 212, + 493, + 784, + 569 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Dynamic Anchor Queries", + "text_level": 1, + "bbox": [ + 214, + 590, + 470, + 606 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The key idea of DAQ is to dynamically generate anchor queries using the features of candidate objects that may emerge or disappear, thereby reducing the gap between anchor queries and the target queries for possible newly emerging or disappearing objects. DAQ allows the network to easily transform anchor queries to target queries and effectively handle object emergence and disappearance.", + "bbox": [ + 212, + 613, + 782, + 686 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this subsection, we introduce how to design and utilize Dynamic Anchor Queries (DAQ) to address the challenges mentioned above. First, we explain how the DAQ for newly emerging and disappearing objects are generated. Then, we explore how to make minor adjustments to the current query-based tracker to accommodate our proposed DAQ.", + "bbox": [ + 212, + 689, + 782, + 762 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Dynamic Anchor Queries for Emergence. When processing the $\\mathrm{T}^{th}$ frame of a video, we consider all objects appearing in the current frame as candidates for newly emerging objects. The dynamic anchor queries for emergence $\\mathrm{DAQ}_{Emg}$ are naturally generated based on the features of these candidates. As shown in Fig. 3 (a), $\\mathrm{DAQ}_{Emg}$ consists of two parts: query feature $\\mathrm{DAQ}_{Emg}^{feat}$ and query", + "bbox": [ + 212, + 763, + 782, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/caffc65a8c6341c092eb5af8300ea5191057755a40c7787d864f3d1db5dd8fc0.jpg", + "image_caption": [ + "Fig. 3: Generation of dynamic anchor queries. $F^T$ represents the image feature of the $\\mathrm{T}^{th}$ frame. Symbols $Emg$ and $Dis$ denote emergence and disappearance. Symbols $feat$ and $pos$ indicate feature and positional embedding, respectively." + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 557, + 277 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/a950a62622817c45162a8f555a8b86a75807c95e7065df0384244d9b77cfe791.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 558, + 143, + 779, + 277 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "positional embedding $\\mathrm{DAQ}_{Emg}^{pos}$ . The query feature $\\mathrm{DAQ}_{Emg}^{feat}$ is a learnable embedding shared by all dynamic anchor queries. The query positional embedding $\\mathrm{DAQ}_{Emg}^{pos}$ is obtained using the appearance features $F_{mask}^{T}$ of the candidates through simple Mask-Pooling:", + "bbox": [ + 214, + 357, + 782, + 417 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nF _ {m a s k} ^ {T} = \\operatorname {M L P} \\left(\\operatorname {M a s k P o o l i n g} \\left(F ^ {T}, \\mathcal {M} ^ {T}\\right)\\right), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 354, + 426, + 784, + 445 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $F^T$ represents the image feature of the $\\mathrm{T}^{th}$ frame, and $\\mathcal{M}^T$ represents the segmentation masks of the candidates outputted by the segmenter.", + "bbox": [ + 212, + 453, + 784, + 483 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Dynamic Anchor Queries for Disappearance. When processing the $\\mathrm{T}^{th}$ frame, we consider all currently tracked objects as candidates for disappearing objects. Similar to the dynamic anchor queries for emergence, the DAQ $_{Dis}$ for disappearing objects are naturally generated based on the features of these candidates. As shown in Fig. 3 (b), the DAQ $_{Dis}$ also consists of query feature DAQ $_{Dis}^{feat}$ and query positional embedding DAQ $_{Dis}^{pos}$ . We use the candidates' momentum-weighted appearance features $\\overline{F}_{mask}^T$ as the query positional embedding DAQ $_{Dis}^{pos}$ . The momentum-weighted function follows CTVIS [70]:", + "bbox": [ + 212, + 484, + 784, + 609 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\bar {F} _ {\\text {m a s k}} ^ {T} = (1 - \\beta) \\bar {F} _ {\\text {m a s k}} ^ {T - 1} + \\beta F _ {\\text {m a s k}} ^ {T} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 617, + 784, + 638 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\beta = \\max \\left(0, \\frac {1}{T} \\sum_ {t = 1} ^ {T - 1} \\operatorname {c o s i n e} \\left(F _ {\\text {m a s k}} ^ {t}, F _ {\\text {m a s k}} ^ {T}\\right)\\right) \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 343, + 659, + 784, + 700 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Since the disappearance of an object needs to be modeled as a transition from an anchor query to a background query, to reduce the transition gap, we use the initial queries of segmenter as the query feature $\\mathrm{DAQ}_{Dis}^{feat}$ . Specifically, for each query feature, we match the closest one from the initial queries of the segmenter based on cosine similarity.", + "bbox": [ + 212, + 704, + 782, + 777 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Continuously Tracked Queries. We also assign query positional embedding $\\mathrm{CTQ}^{pos}$ for continuously tracked queries (CTQ) to maintain the format consistency with dynamic anchor queries. We use the momentum-weighted appearance feature of the tracked objects as $\\mathrm{CTQ}^{pos}$ , the same process as Eq. 3, 4, and 5.", + "bbox": [ + 212, + 779, + 784, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 651, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/c665a55a8c4df5c5ac98f2e658e5f5caafdd3b324d2497f23ea48c571861adea.jpg", + "image_caption": [ + "Fig. 4: Tracker with dynamic anchor queries. $Q_{seg}$ represents the query output of segmenter. CTQ and DAQ stand for continuously tracked and dynamic anchor queries, respectively. Symbols $Emg$ and $Dis$ denote emergence and disappearance." + ], + "image_footnote": [], + "bbox": [ + 225, + 143, + 777, + 260 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Incorporating Dynamic Anchor Queries into a Tracker. As depicted in Fig. 4, we can seamlessly integrate DAQ into mainstream propagation-based trackers [21,73], requiring no alterations to the tracker's network architecture. We instantiate two trackers: Tracker 1, which takes CTQ and $\\mathrm{DAQ}_{Emg}$ as inputs and is responsible for tracking continuously appearing and newly emerging objects, and Tracker 2, which receives $\\mathrm{DAQ}_{Dis}$ along with several learnable background embeddings as inputs and identifies disappearing objects in the current frame. It's important to note that the SoftMax function in Tracker 2 operates along the Q-dimension to prevent multiple dynamic anchor queries from segmenting the same object. Through this pipeline, we can effectively and reasonably manage and model the emergence and disappearance of objects. Despite introducing an additional tracker, it's worth highlighting that the computational overhead is minimal, constituting less than $2\\%$ of the overall computational cost [73], as processing occurs solely at the query level rather than on dense image features.", + "bbox": [ + 212, + 342, + 787, + 554 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Emergence and Disappearance Simulation", + "text_level": 1, + "bbox": [ + 212, + 574, + 607, + 590 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As shown in Fig. 5, when using DAQ, it is possible to simulate object emergence and disappearance separately by removing parts of CTQ and $Q_{Seg}$ , respectively. We term this simple yet efficient simulation strategy as Emergence and Disappearance Simulation (EDS), which includes Emergence Simulation (ES) and Disappearance Simulation (DS). EDS can simulate numerous object emergence and disappearance cases during training without introducing additional costs, allowing the network to be fully trained and unleashing the potential of DAQ.", + "bbox": [ + 212, + 598, + 787, + 703 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "New Emergence Simulation. As shown in Fig. 5 (a), taking the green object as an example, we can simulate it as an emerging object by removing its corresponding query from CTQ. At this point, this green object is not present in CTQ but exists in the current frame, consistent with the state of a real newly emerged object colored in gray. Then, the Tracker needs to transition the corresponding anchor query from $\\mathrm{DAQ}_{Emg}$ to a foreground query and predict this green object's segmentation mask and class.", + "bbox": [ + 212, + 704, + 787, + 808 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Disappearance Simulation. As shown in Fig. 5 (b), taking the yellow object as an example, by removing its corresponding query from $Q_{Seg}$ , we can simulate", + "bbox": [ + 212, + 809, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/e1890ed6e53fb9ce793d9a8493c6f54e7971b99f686d754dd6119e48c2a638ea.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 222, + 143, + 375, + 256 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/ff95b780ec06b6eb6ab57fc9a83d67c7dc6212750e328a9f72b43e93a213e0b8.jpg", + "image_caption": [ + "(a) Emergence Simulation" + ], + "image_footnote": [], + "bbox": [ + 383, + 143, + 524, + 258 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/bab02cf7b60fd149b4c9d6f27d37c4bd2b3ad66234dbf09f44f2ea8ef3d8c183.jpg", + "image_caption": [ + "(b) Disappearance Simulation" + ], + "image_footnote": [], + "bbox": [ + 527, + 143, + 643, + 257 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/b0832627bfae775c8914eca17ae978a5200415c1a41c506d6c085ec4366e87e8.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 645, + 143, + 779, + 257 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/f25cccc0626990fb1d6888c0e3b8d0831456a4c7f3935b6de122cb067fba348e.jpg", + "image_caption": [ + "Fig.5: The pipelines of emergence and disappearance simulation. CTQ, $\\mathrm{DAQ}_{Emg}$ , $\\mathrm{DAQ}_{Dis}$ , and $Q_{Seg}$ are represented by rectangles, circles, diamonds, and heptagons, respectively. White indicates the background query transformed from the anchor query. The red rectangles highlight the difference between with and without simulation.", + "Fig. 6: The architecture of DVIS-DAQ tracker." + ], + "image_footnote": [], + "bbox": [ + 225, + 369, + 779, + 434 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "this object as a disappearing object because the Tracker only detects features from $Q_{Seg}$ through cross-attention to obtain image information. At this point, this blue object is not present in the current frame but exists in the set of tracked objects, consistent with the state of a real disappearing blue object. The Tracker needs to transition the corresponding anchor query to a background query and determine the disappearance of this object.", + "bbox": [ + 212, + 489, + 787, + 582 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.4 Overall Architecture", + "text_level": 1, + "bbox": [ + 214, + 603, + 433, + 617 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Architecture. Sec. 3.2 details how DAQ is integrated into the current query-based tracker without any requirement for architecture modification. We apply the SOTA video segmentation method DVIS [73] as our baseline and replace the Referring Cross-Attention [73,74] in its tracker with standard Cross-Attention to achieve a more straightforward and generalizable structure shown in Fig. 6. We then integrated DAQ into this simplified tracker, resulting in our architecture, DVIS-DAQ.", + "bbox": [ + 212, + 628, + 787, + 733 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Objective Function. Our objective function differs from DVIS [73]. We maintain the historical matching relationship between the predictions of CTQ and ground truth for continuously tracked objects and remove the matched items from the ground truth. For newly emerging and disappearing objects, since DAQ is dynamically generated based on the features of candidates (refer to Sec. 3.2), we assign the remaining ground truth to DAQ based on the matching relationship between candidates and the remaining ground truth. Following this process,", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 651, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 785, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/cb7e4290d1995d5cf369537f9464e6ff3b98aad7f3b78a6b68aa333ba007b8d2.jpg", + "table_caption": [ + "Table 1: Results on the val set of OVIS and YouTube-VIS 2019 & 2021. † denotes with the offline refiner proposed by [73]. The VIT-L [16] is pre-trained by DINOV2 [41] and uses VIT-Adapter [9] to obtain multiscale features." + ], + "table_footnote": [], + "table_body": "
MethodBackboneOVISYT-VIS 2019YT-VIS 2021
AP\\( AP_{75} \\)\\( AR_{10} \\)AP\\( AP_{75} \\)\\( AR_{10} \\)AP\\( AP_{75} \\)\\( AR_{10} \\)
MinVIS [23]R5025.024.029.747.452.155.744.248.151.7
CTVIS [70]R5035.534.941.955.159.163.250.154.759.5
GenVIS [21]R5035.836.239.650.054.659.747.151.554.7
DVIS [73]R5030.230.537.351.257.159.346.449.653.5
DVIST† [73]R5033.833.539.552.358.260.447.451.655.2
DVIS++ [74]R5037.237.342.955.560.162.650.054.558.4
DVIST++† [74]R5041.240.947.3------
DVIS-DAQR5038.737.645.255.261.963.750.455.057.6
DVIS-DAQ†R5043.543.849.1------
MinVIS [23]Swin-L39.441.343.361.668.666.655.362.060.8
CTVIS [70]Swin-L46.947.552.165.672.270.461.268.865.8
GenVIS [21]Swin-L45.248.448.664.068.369.459.665.865.0
DVIS [73]Swin-L45.948.351.563.970.469.058.766.664.6
DVIST† [73]Swin-L48.650.553.864.972.770.360.168.465.7
DVIS++ [74]VIT-L49.655.054.667.775.373.762.370.268.0
DVIST++† [74]VIT-L53.458.558.768.376.173.463.971.569.5
DVIS-DAQSwin-L49.551.754.965.773.670.761.168.266.6
DVIS-DAQVIT-L53.758.259.568.376.173.562.470.868.0
DVIS-DAQ†VIT-L57.162.962.369.276.875.564.572.470.7
", + "bbox": [ + 241, + 199, + 759, + 508 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "we obtain the matching relationship $\\{(i,\\sigma (i))|i\\in [1,M]\\}$ between ground truth and predictions, M is the number of ground truth. The not-matched predictions are assigned with the background class and an empty segmentation mask. Then, the loss between matched prediction-label pairs $(\\mathcal{P},\\mathcal{G})$ can be calculated following the Mask2Former [11]:", + "bbox": [ + 212, + 523, + 787, + 599 + ], + "page_idx": 9 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} (\\mathcal {P}, \\mathcal {G}) = \\lambda_ {c l s} \\mathcal {L} _ {c l s} (\\mathcal {P}, \\mathcal {G}) + \\lambda_ {d i c e} \\mathcal {L} _ {d i c e} (\\mathcal {P}, \\mathcal {G}) + \\lambda_ {b c e} \\mathcal {L} _ {b c e} (\\mathcal {P}, \\mathcal {G}) \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 282, + 608, + 785, + 625 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Here, $\\mathcal{L}_{cls}$ represents the classification loss term, implemented using Cross Entropy Loss. $\\mathcal{L}_{dice}$ and $\\mathcal{L}_{bce}$ denote the segmentation loss terms, implemented respectively using Dice loss and Binary Cross Entropy loss.", + "bbox": [ + 212, + 632, + 787, + 678 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4 Experiment", + "text_level": 1, + "bbox": [ + 215, + 698, + 366, + 715 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.1 Datasets and Metrics", + "text_level": 1, + "bbox": [ + 215, + 727, + 439, + 739 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We conduct experiments on five mainstream video segmentation benchmarks, including OVIS [47], Youtube-VIS 2019 & 2021 & 2022 [68], and VIPSeg [39]. We employ AP and AR as evaluation metrics for the VIS datasets following [68]. We utilize Video Panoptic Quality (VPQ) and Segmentation and Tracking Quality (STQ) for the VPS datasets as evaluation metrics following [24,39]. More detailed settings can be found in the supplementary file.", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/4912e191b5a05ab6a2acc732af1857d6afc8f51fd56db5e8389c7ff26d29d133.jpg", + "table_caption": [ + "Table 2: Results on the validation sets of YouTube-VIS 2022 and VIPSeg. $\\mathrm{AP^L}$ refers to the AP on the long video set. $\\mathrm{VPQ^{Th}}$ and $\\mathrm{VPQ^{St}}$ refer to the VPQ on the \"thing\" objects and the \"stuff\" objects, respectively." + ], + "table_footnote": [], + "table_body": "
MethodBackboneYT-VIS 2022VIPSeg
APLAP75AR10VPQVPQThVPQSSTQ
MinVIS [23]R5023.319.328.0----
TarVIS [1]R50---33.539.228.543.1
DVIS [73]R5031.637.036.339.438.640.136.3
DVIS++ [74]R5037.240.744.641.941.042.738.5
DVIS-DAQR5034.635.541.142.141.742.539.3
MinVIS [23]Swin-L33.133.736.6----
TarVIS [1]Swin-L---48.058.239.052.9
DVIS [73]Swin-L39.942.644.954.754.854.647.7
DVIS++ [74]VIT-L37.539.443.556.058.054.349.8
DVIS-DAQVIT-L42.043.048.457.460.454.752.0
", + "bbox": [ + 233, + 199, + 769, + 386 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.2 Main Experiments", + "text_level": 1, + "bbox": [ + 215, + 407, + 415, + 422 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Performance on OVIS dataset. The OVIS dataset presents more challenging cases, such as occlusion, fast motion, and complex motion trajectories. We present the quantitative evaluation results in Tab. 1. When using ResNet-50 [20] as the backbone, our method achieves an AP of 38.7 and 43.5 with the offline refiner, surpassing all existing methods. Compared to the current SOTA DVIS++ [74], our method shows an improvement of 1.5 AP (38.7 vs. 37.2) and 2.3 AP (43.5 vs. 41.2) with the offline refiner. When employing a larger backbone, our method achieves even more significant improvements. With Swin-L [36] as the backbone, our method outperforms DVIS [73] by 3.6 AP (49.5 vs. 45.9). When using VIT-L [16] as the backbone, our method surpasses DVIS++ by 4.1 AP (53.7 vs. 49.6). Notably, our DVIS-DAQ even outperforms DVIS++ with the offline refiner (53.7 vs. 53.4), while DVIS-DAQ with the offline refiner has reached 57.1 AP. These quantitative results demonstrate that our DAQ design significantly enhances the capability of query-based video segmentation methods in processing complex scenes with many object emergence and disappearances.", + "bbox": [ + 212, + 441, + 787, + 671 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Performance on Youtube-VIS 2019 & 2021 datasets. The videos in these two datasets are relatively short and feature simple scenes. As shown in Tab. 1, when using ResNet-50 as the backbone, our method achieves a 4.0 AP improvement compared to the baseline DVIS on the YTVIS 2019 and 2021 datasets. When using VIT-L as the backbone, we achieve comparable performance with DVIS++. When using the offline refiner, we outperform DVIS++ by 0.9 AP and 0.6 AP on the YTVIS 2019 and 2021 datasets.", + "bbox": [ + 212, + 671, + 787, + 776 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Performance on Youtube-VIS 2022 dataset. Youtube-VIS 2022 has been expanded with 71 long videos based on the 2021 version. Therefore, we only report the $\\mathrm{AP^L}$ for the long videos in Tab. 2. When using ResNet-50 as the backbone, DVIS-DAQ outperforms the baseline DVIS with $3.0\\mathrm{AP}^{\\mathrm{L}}$ . Our method", + "bbox": [ + 212, + 779, + 787, + 839 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 651, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "(a) The main ablation study of the proposed DAQ and EDS. The baseline is the extension of DVIS [73]. EDAQ/DDAQ denotes emergence/disappearance DAQ. ES/DS denotes emergence/disappearance simulation.", + "bbox": [ + 215, + 167, + 390, + 260 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "(b) Candidates selection for emergence DAQ. K denotes the number of top-scoring candidates. N denotes the number of learnable embeddings.", + "bbox": [ + 398, + 167, + 517, + 261 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "(c) Threshold selection for new emergence simulation.", + "bbox": [ + 524, + 167, + 630, + 209 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "(d) Disappearance simulation. One, Continuous, and Random represent simulating disappearance for an object in a solitary frame, all frames, and randomly selected frames within a video clip, respectively.", + "bbox": [ + 638, + 167, + 787, + 261 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/caaeeda8934df084055cc2291a5ab1fcf5a19a91a91e948d8ea2f71031c9fa23.jpg", + "table_caption": [ + "Table 3: Ablation studies on our proposed DAQ and other network details." + ], + "table_footnote": [], + "table_body": "
EDAQ ES DDAQ DS | AP
35.4
✓33.3
✓32.3
✓✓36.4
✓✓✓36.6
✓✓✓37.1
", + "bbox": [ + 217, + 266, + 390, + 356 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/d568822be76a7d36945bfa8d006e184315b87b93836ddd685e0d743adb44e784.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
KNAP
100136.4
50135.9
50236.5
25435.6
", + "bbox": [ + 408, + 266, + 506, + 354 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/6623f3f28d4e82c239ce1338d558e78318c6dbed101b6878c8f729b93bb41422.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
ThresholdAP
0.0134.2
0.0534.7
0.1035.6
0.2034.5
0.5033.2
", + "bbox": [ + 527, + 266, + 629, + 354 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/87a921d364adf3429244901eb05de45c77ab1b7b1a25a9e768465b1f75471e90.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
TypeAP
One36.3
Continuous35.8
Random37.1
", + "bbox": [ + 651, + 267, + 772, + 354 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "(e) Generation of emergence DAQ. $SegQ / SegP / AppF$ denotes the query feature/positional embedding/appearance feature of the segmenter's frame object output. Add/Cat denotes adding/concatenating the selected features to the query feature of emergence DAQ. Pos denotes using the selected feature as the positional embedding of emergence DAQ.", + "bbox": [ + 215, + 358, + 491, + 441 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "(f) Generation of disappearance DAQ. Learn and Initial SegQ represent initializing the query feature of disappearance DAQ by using a new learnable embedding and the initial queries of segmenter, respectively. $CTQF / CTQP$ represent using the query feature/momentum-weighted appearance feature of tracked objects as the positional embeddings of disappearance DAQ.", + "bbox": [ + 508, + 358, + 787, + 450 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/2cf859cbafa8c59c8d47795ea60d75d520b2f9f6ad6e5863a648c2f6da0a6ed2.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MetricFeature selectionFeature usage
SegQSegPAppFAdd Cat Pos
AP34.836.036.436.0 36.2 36.4
", + "bbox": [ + 233, + 455, + 473, + 506 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/708d431e76fb57d3b3f52feba6d287b5b402e418ea3fd2eb427a91efceb08bdb.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MetricQuery feature Learn Initial SegQPositional CTQFembedding CTQP
AP36.537.136.837.1
", + "bbox": [ + 509, + 455, + 799, + 506 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "outperforms DVIS++ with 4.5 AP $^{\\text{L}}$ (42.0 vs. 37.5) when using VIT-L as the backbone.", + "bbox": [ + 212, + 536, + 784, + 565 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Performance on VIPSeg dataset. VIPSeg is a large-scale video panoptic segmentation dataset containing various real-world scenes and more categories. Tab. 2 presents the performance comparison with SOTA methods. Our method achieves new SOTA performance with both ResNet-50 and VIT-L backbone settings. Our method achieves a VPQ of 42.1 when using ResNet-50 as the backbone, surpassing the baseline DVIS by 2.7 VPQ. With VIT-L as the backbone, our method achieves a VPQ of 57.4, demonstrating a 2.4 VPQ improvement over the previous SOTA DVIS++ in \"thing\" objects.", + "bbox": [ + 212, + 568, + 787, + 690 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Ablation Studies and Analysis", + "text_level": 1, + "bbox": [ + 215, + 717, + 511, + 734 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We perform ablation experiments on the OVIS dataset using the ResNet-50 backbone and 40K training iterations. We use DVIS [73] as the baseline. When aligning the training and testing settings with DVIS++ [74], the baseline achieves an AP of 35.4. More detailed settings are provided in the supplementary materials. Moreover, we also refer the readers for more different architectures using our DAQ in supplementary part.", + "bbox": [ + 212, + 750, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Effectiveness of DAQ and EDS. Tab. 3a presents the ablation studies about our proposed components. Using emergence dynamic anchor queries alone leads to a performance degradation of 2.1 AP, attributed to insufficient examples of emergence objects for training. When the emergence simulation strategy is used alone, performance drops by 3.1 AP, indicating that the unreasonable anchor design in the previous method [73] makes it difficult for the network to learn to handle object emergence, even with sufficient training cases. When emergence dynamic anchor queries and emergence simulation are used together, the reasonable mechanism and sufficient training cases result in a 1.0 AP improvement compared to the baseline. Disappearing dynamic anchor queries contribute to a performance improvement of 0.2 AP. Introducing the Disappearing Simulation strategy to provide sufficient cases of disappearing objects further increases model performance by 0.5 AP.", + "bbox": [ + 218, + 145, + 785, + 342 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Emergence dynamic anchor queries. DAQ comprises query feature embedding and positional embedding. Firstly, we explore different strategies for selecting emergency candidates, and the results are presented in Tab. 3b. When choosing the top 100 object predictions of the segmenter as candidates, with only one shared learnable embedding, we obtain 36.4 AP. Setting the number of candidates to the top 50 and the number of learnable embeddings to 2 brings a performance gain of 0.1 AP. To explore potential new objects fully, we choose the top 100 scheme.", + "bbox": [ + 218, + 345, + 785, + 465 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In Tab. 3e, we investigate how to generate corresponding dynamic anchor queries based on the features of emerging candidates. We find that utilizing candidates' appearance features yields the best results, surpassing the use of positional features and object queries with a hybrid of positional and appearance information by 1.6 AP and 0.4 AP, respectively. Furthermore, leveraging the features of candidates in the form of query positional embedding results in the best performance, outperforming addition and concatenation operations by 0.4 AP and 0.2 AP, respectively.", + "bbox": [ + 218, + 470, + 785, + 590 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Disappearance dynamic anchor queries. In Tab. 3f, we explore how to initialize the query feature embedding and positional embedding of disappearance DAQ. We find that initializing query feature of disappearance DAQ from the initial queries in the segmenter (as shown in Fig. 3) yields better AP than using a new shared learnable embedding for all disappearance DAQ (37.1 vs. 36.5). For generation of positional embedding of disappearance DAQ, we find utilizing the momentum-weighted appearance feature of tracked objects yield better AP than utilizing the query feature of tracked objects (37.1 vs. 36.8).", + "bbox": [ + 218, + 595, + 785, + 715 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Emergence and disappearance simulation. We employ a threshold to filter out low-scoring tracked objects in emergence simulation. Tab. 3c illustrates the results when using different thresholds. A minimal threshold (0.01) results in insufficient new emergence cases, whereas a larger threshold (0.5) disrupts the model's ability to learn continuous tracking. Both result in poor performance (34.2 AP and 33.2 AP). A similar phenomenon is observed in the disappearance simulation, as shown in Tab. 3d. The simulation of an object's disappearance in a solitary frame within a video clip fails to generate sufficient disappearance", + "bbox": [ + 218, + 719, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 653, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/ca742f8a59d6331bf8e255f49fd42edfe3a85728e6fdc3e54eeb91587d60099c.jpg", + "image_caption": [ + "Fig. 7: Qualitative results comparison for emergence detection and disappearance filtering. The performance enhancements are highlighted by rectangles in various colors, each color representing an individual video object. It's better to view with zooming in $8 \\times$ ." + ], + "image_footnote": [], + "bbox": [ + 261, + 145, + 743, + 349 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "cases. Conversely, simulating the disappearance across all frames compromises the model's capability to learn continuous tracking. Consequently, we have determined that a threshold of 0.1 strikes an optimal balance for simulating emergence, and we opt for a stochastic selection of frames in a video clip to simulate disappearance. This strategy ensures ample emergence and disappearance cases while preserving the model's tracking capability for continually appearing objects.", + "bbox": [ + 212, + 430, + 787, + 535 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Qualitative results comparison. In Fig. 7, we present the visual comparison with our baseline. In this challenging scene, there are new-emerging, disappearing, and reappearing video objects. Our method accurately addresses all these scenarios, whereas DVIS suffers from issues including missed new-emerging objects and ID switches.", + "bbox": [ + 212, + 536, + 787, + 612 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 638, + 359, + 655 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We observed that current SOTA query-based video segmentation methods perform poorly on newly emerging and disappearing objects. We have analyzed and identified the significant transition gap hindering the network's learning. We address this challenge by proposing dynamic anchor queries for shortening the transition gap. We also introduce a query-level simulation strategy for simulating object disappearance and emergence without additional costs. By integrating our proposed dynamic anchor queries and simulation strategy into DVIS, we obtained DVIS-DAQ, which achieved SOTA performance on mainstream video segmentation benchmarks. Our research will inspire the video community to bridge the gap between current advancements in the standard benchmarks and real-world application requirements.", + "bbox": [ + 212, + 672, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Athar, A., Hermans, A., Luiten, J., Ramanan, D., Leibe, B.: Tarvis: A unified approach for target-based video segmentation. In: CVPR (2023)", + "2. Athar, A., Mahadevan, S., Osep, A., Leal-Taixe, L., Leibe, B.: Stem-seg: Spatiotemporal embeddings for instance segmentation in videos. In: ECCV (2020)", + "3. Bekuzarov, M., Bermudez, A., Lee, J.Y., Li, H.: Xmem++: Production-level video segmentation from few annotated frames (2023)", + "4. Bertasius, G., Torresani, L.: Classifying, segmenting, and tracking object instances in video with mask propagation (2022)", + "5. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021)", + "6. Bewley, A., Ge, Z., Ott, L., Ramos, F., Upcroft, B.: Simple online and realtime tracking. In: ICIP (2016)", + "7. Caelles, S., Maninis, K., Pont-Tuset, J., Leal-Taixe, L., Cremers, D., Van Gool, L.: One-shot video object segmentation. In: CVPR (2017)", + "8. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV (2020)", + "9. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. arXiv preprint arXiv:2205.08534 (2022)", + "0. Cheng, B., Choudhuri, A., Misra, I., Kirillov, A., Girdhar, R., Schwing, A.G.: Mask2former for video instance segmentation. arXiv preprint arXiv:2112.10764 (2021)", + "1. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: CVPR (2022)", + "2. Cheng, B., Schwing, A., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation. NeurIPS (2021)", + "3. Cheng, H.K., Oh, S.W., Price, B., Schwing, A., Lee, J.Y.: Tracking anything with decoupled video segmentation. In: ICCV (2023)", + "4. Cheng, H.K., Tai, Y.W., Tang, C.K.: Rethinking space-time networks with improved memory coverage for efficient video object segmentation. In: NeurIPS (2021)", + "5. Ding, H., Liu, C., He, S., Jiang, X., Torr, P.H., Bai, S.: MOSE: A new dataset for video object segmentation in complex scenes. In: ICCV (2023)", + "6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. ICLR (2021)", + "7. Gao, R., Wang, L.: MeMOTR: Long-term memory-augmented transformer for multi-object tracking. In: ICCV (2023)", + "8. Hannan, T., Koner, R., Bernhard, M., Shit, S., Menze, B., Tresp, V., Schubert, M., Seidl, T.: Gratt-vis: Gated residual attention for auto rectifying video instance segmentation. arXiv preprint arXiv:2305.17096 (2023)", + "9. He, J., Yu, Q., Shin, I., Deng, X., Shen, X., Yuille, A., Chen, L.C.: Maxtron: Mask transformer with trajectory attention for video panoptic segmentation (2023)", + "20. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR (2016)", + "21. Heo, M., Hwang, S., Hyun, J., Kim, H., Oh, S.W., Lee, J.Y., Kim, S.J.: A generalized framework for video instance segmentation. In: CVPR (2023)", + "22. Heo, M., Hwang, S., Oh, S.W., Lee, J.Y., Kim, S.J.: Vita: Video instance segmentation via object token association. NIPS (2022)" + ], + "bbox": [ + 225, + 176, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 651, + 114, + 730, + 127 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "23. Huang, D.A., Yu, Z., Anandkumar, A.: Minvis: A minimal video instance segmentation framework without video-based training. NeurIPS (2022)", + "24. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020)", + "25. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020)", + "26. Kim, D., Xie, J., Wang, H., Qiao, S., Yu, Q., Kim, H.S., Adam, H., Kweon, I.S., Chen, L.C.: Tubeformer-deeplab: Video mask transformer. In: CVPR (2022)", + "27. Leal-Taixe, L., Canton-Ferrer, C., Schindler, K.: Learning by tracking: Siamese cnn for robust target association. In: CVPR Workshops (2016)", + "28. Li, J., Yu, B., Rao, Y., Zhou, J., Lu, J.: Tcovis: Temporally consistent online video instance segmentation. In: ICCV (2023)", + "29. Li, M., Li, S., Zhang, X., Zhang, L.: Univs: Unified and universal video segmentation with prompts as queries (2024)", + "30. Li, X., Ding, H., Zhang, W., Yuan, H., Cheng, G., Jiangmiao, P., Chen, K., Liu, Z., Loy, C.C.: Transformer-based visual segmentation: A survey. arXiv pre-print (2023)", + "31. Li, X., Xu, S., Cheng, Y.Y., Tong, Y., Tao, D., et al.: Panoptic-partformer: Learning a unified model for panoptic part segmentation. ECCV (2022)", + "32. Li, X., Yuan, H., Li, W., Ding, H., Wu, S., Zhang, W., Li, Y., Chen, K., Loy, C.C.: Omg-seg: Is one model good enough for all segmentation? CVPR (2024)", + "33. Li, X., Yuan, H., Zhang, W., Cheng, G., Pang, J., Loy, C.C.: Tube-link: A flexible cross tube framework for universal video segmentation. In: ICCV (2023)", + "34. Li, X., Zhang, W., Pang, J., Chen, K., Cheng, G., Tong, Y., Loy, C.C.: Video k-net: A simple, strong, and unified baseline for video segmentation. In: CVPR (2022)", + "35. Lin, C.C., Hung, Y., Feris, R., He, L.: Video instance segmentation tracking with a modified vae architecture. In: CVPR (2020)", + "36. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV (2021)", + "37. Meinhardt, T., Feiszli, M., Fan, Y., Leal-Taixe, L., Ranjan, R.: Novis: A case for end-to-end near-online video instance segmentation. arXiv preprint arXiv:2308.15266 (2023)", + "38. Meinhardt, T., Kirillov, A., Leal-Taixe, L., Feichtenhofer, C.: Trackformer: Multi-object tracking with transformers. In: CVPR (2022)", + "39. Miao, J., Wang, X., Wu, Y., Li, W., Zhang, X., Wei, Y., Yang, Y.: Large-scale video panoptic segmentation in the wild: A benchmark. In: CVPR (2022)", + "40. Miao, J., Wei, Y., Wu, Y., Liang, C., Li, G., Yang, Y.: Vspw: A large-scale dataset for video scene parsing in the wild. In: CVPR (2021)", + "41. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023)", + "42. Pang, J., Qiu, L., Li, X., Chen, H., Li, Q., Darrell, T., Yu, F.: Quasi-dense similarity learning for multiple object tracking. In: CVPR (2021)", + "43. Pang, Z., Li, Z., Wang, N.: Simpletrack: Understanding and rethinking 3d multi-object tracking. arXiv preprint arXiv:2111.09621 (2021)", + "44. Park, K., Woo, S., Oh, S.W., Kweon, I.S., Lee, J.Y.: Per-clip video object segmentation. In: CVPR (2022)", + "45. Patrick, M., Campbell, D., Asano, Y.M., Metze, I.M.F., Feichtenhofer, C., Vedaldi, A., Henriques, J.F.: Keeping your eye on the ball: Trajectory attention in video transformers. In: NeurIPS (2021)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. Porzi, L., Hofinger, M., Ruiz, I., Serrat, J., Bulo, S.R., Kontschieder, P.: Learning multi-object tracking and segmentation from automatic annotations. In: CVPR (2020)", + "47. Qi, J., Gao, Y., Hu, Y., Wang, X., Liu, X., Bai, X., Belongie, S., Yuille, A., Torr, P.H., Bai, S.: Occluded video instance segmentation: A benchmark. IJCV (2022)", + "48. Qiao, S., Zhu, Y., Adam, H., Yuille, A., Chen, L.C.: Vip-deeplab: Learning visual perception with depth-aware video panoptic segmentation. In: CVPR (2021)", + "49. Sanghyun, W., Kwanyong, P., Seoung, W.O., In, S.K., Joon-Young, L.: Tracking by associating clips. In: ECCV (2022)", + "50. Seong, H., Oh, S.W., Lee, J.Y., Lee, S., Lee, S., Kim, E.: Hierarchical memory matching network for video object segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021)", + "51. Sun, P., Cao, J., Jiang, Y., Yuan, Z., Bai, S., Kitani, K., Luo, P.: Dancetrack: Multi-object tracking in uniform appearance and diverse motion. arXiv preprint arXiv:2111.14690 (2021)", + "52. Sun, P., Cao, J., Jiang, Y., Zhang, R., Xie, E., Yuan, Z., Wang, C., Luo, P.: Transtrack: Multiple-object tracking with transformer. arXiv preprint arXiv: 2012.15460 (2020)", + "53. Tsai, Y.J., Liu, Y.L., Qi, L., Chan, K.C., Yang, M.H.: Dual associated encoder for face restoration. arXiv preprint arXiv:2308.07314 (2023)", + "54. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: CVPR (2023)", + "55. Wang, Y., Xu, Z., Wang, X., Shen, C., Cheng, B., Shen, H., Xia, H.: End-to-end video instance segmentation with transformers. In: CVPR (2021)", + "56. Weber, M., Xie, J., Collins, M., Zhu, Y., Voigtlaender, P., Adam, H., Green, B., Geiger, A., Leibe, B., Cremers, D., et al.: Step: Segmenting and tracking every pixel. arXiv preprint arXiv:2102.11859 (2021)", + "57. Weng, Y., Han, M., He, H., Li, M., Yao, L., Chang, X., Zhuang, B.: Mask propagation for efficient video semantic segmentation. arXiv preprint arXiv:2310.18954 (2023)", + "58. Wu, J., Cao, J., Song, L., Wang, Y., Yang, M., Yuan, J.: Track to detect and segment: An online multi-object tracker. In: CVPR (2021)", + "59. Wu, J., Li, X., Xu, S., Yuan, H., Ding, H., Yang, Y., Li, X., Zhang, J., Tong, Y., Jiang, X., Ghanem, B., Tao, D.: Towards open vocabulary learning: A survey. T-PAMI (2024)", + "60. Wu, J., Jiang, Y., Bai, S., Zhang, W., Bai, X.: Seqformer: Sequential transformer for video instance segmentation. In: ECCV (2022)", + "61. Wu, J., Liu, Q., Jiang, Y., Bai, S., Yuille, A., Bai, X.: In defense of online models for video instance segmentation. In: ECCV (2022)", + "62. Xu, J., Cao, Y., Zhang, Z., Hu, H.: Spatial-temporal relation networks for multi-object tracking. In: ICCV (2019)", + "63. Xu, S., Li, X., Wang, J., Cheng, G., Tong, Y., Tao, D.: Fashionformer: A simple, effective and unified baseline for human fashion segmentation and recognition. In: ECCV (2022)", + "64. Xu, S., Yuan, H., Shi, Q., Qi, L., Wang, J., Yang, Y., Li, Y., Chen, K., Tong, Y., Ghanem, B., Li, X., Yang, M.H.: Rap-sam:towards real-time all-purpose segment anything. arXiv preprint (2024)", + "65. Yan, B., Jiang, Y., Sun, P., Wang, D., Yuan, Z., Luo, P., Lu, H.: Towards grand unification of object tracking. In: ECCV (2022)", + "66. Yan, B., Jiang, Y., Wu, J., Wang, D., Luo, P., Yuan, Z., Lu, H.: Universal instance perception as object discovery and retrieval. In: CVPR (2023)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "DVIS-DAQ", + "bbox": [ + 653, + 114, + 730, + 127 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "67. Yang, J., Peng, W., Li, X., Guo, Z., Chen, L., Li, B., Ma, Z., Zhou, K., Zhang, W., Loy, C.C., et al.: Panoptic video scene graph generation. In: CVPR (2023)", + "68. Yang, L., Fan, Y., Xu, N.: Video instance segmentation. In: ICCV (2019)", + "69. Yang, S., Fang, Y., Wang, X., Li, Y., Fang, C., Shan, Y., Feng, B., Liu, W.: Crossover learning for fast online video instance segmentation. In: ICCV (2021)", + "70. Ying, K., Zhong, Q., Mao, W., Wang, Z., Chen, H., Wu, L.Y., Liu, Y., Fan, C., Zhuge, Y., Shen, C.: C'tvis: Consistent training for online video instance segmentation. In: ICCV (2023)", + "71. Yu, F., Chen, H., Wang, X., Xian, W., Chen, Y., Liu, F., Madhavan, V., Darrell, T.: Bdd100k: A diverse driving dataset for heterogeneous multitask learning. In: CVPR (2020)", + "72. Zeng, F., Dong, B., Zhang, Y., Wang, T., Zhang, X., Wei, Y.: Motr: End-to-end multiple-object tracking with transformer. In: ECCV (2022)", + "73. Zhang, T., Tian, X., Wu, Y., Ji, S., Wang, X., Zhang, Y., Wan, P.: Dvis: Decoupled video instance segmentation framework. In: ICCV (2023)", + "74. Zhang, T., Tian, X., Zhou, Y., Ji, S., Wang, X., Tao, X., Zhang, Y., Wan, P., Wang, Z., Wu, Y.: Dvis++: Improved decoupled framework for universal video segmentation. arXiv preprint arXiv:2312.13305 (2023)", + "75. Zhang, W., Pang, J., Chen, K., Loy, C.C.: K-net: Towards unified image segmentation. NIPS (2021)", + "76. Zhang, Y., Sun, P., Jiang, Y., Yu, D., Weng, F., Yuan, Z., Luo, P., Liu, W., Wang, X.: Bytetrack: Multi-object tracking by associating every detection box. ECCV (2022)", + "77. Zhou, Q., Li, X., He, L., Yang, Y., Cheng, G., Tong, Y., Ma, L., Tao, D.: Transvod: end-to-end video object detection with spatial-temporal transformers. T-PAMI (2022)", + "78. Zhou, Y., Zhang, H., Lee, H., Sun, S., Li, P., Zhu, Y., Yoo, B., Qi, X., Han, J.J.: Slot-vps: Object-centric representation learning for video panoptic segmentation. In: CVPR (2022)", + "79. Zhu, J., Yang, H., Liu, N., Kim, M., Zhang, W., Yang, M.H.: Online multi-object tracking with dual matching attention networks. In: ECCV (2018)", + "80. Zhu, X., Xiong, Y., Dai, J., Yuan, L., Wei, Y.: Deep feature flow for video recognition. CVPR (2016)" + ], + "bbox": [ + 215, + 146, + 784, + 604 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Y. Zhou and T. Zhang et al.", + "bbox": [ + 271, + 114, + 460, + 128 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_model.json b/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_model.json new file mode 100644 index 0000000000000000000000000000000000000000..595baa945e211a5a69b1df84f85802a3f342849c --- /dev/null +++ b/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_model.json @@ -0,0 +1,2689 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.249, + 0.141, + 0.756, + 0.187 + ], + "angle": 0, + "content": "Improving Video Segmentation via Dynamic Anchor Queries" + }, + { + "type": "text", + "bbox": [ + 0.316, + 0.213, + 0.689, + 0.245 + ], + "angle": 0, + "content": "Yikang Zhou\\(^{1}\\), Tao Zhang\\(^{1,2}\\), Shumping Ji\\(^{1}\\), Shuicheng Yan\\(^{2}\\), and Xiangtai Li\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.434, + 0.256, + 0.571, + 0.269 + ], + "angle": 0, + "content": "1 Wuhan University" + }, + { + "type": "text", + "bbox": [ + 0.454, + 0.27, + 0.549, + 0.284 + ], + "angle": 0, + "content": "2 Skywork AI" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.285, + 0.742, + 0.298 + ], + "angle": 0, + "content": "zhang_tao@whu.edu.cn, zhouyik@whu.edu.cn, xiangtai94@gmail.com" + }, + { + "type": "text", + "bbox": [ + 0.265, + 0.299, + 0.739, + 0.312 + ], + "angle": 0, + "content": "Project page: https://zhang-tao-whu.github.io/projects/DVIS_DAQ" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.355, + 0.744, + 0.604 + ], + "angle": 0, + "content": "Abstract. Modern video segmentation methods adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects. However, the emergence and disappearance of objects interrupt the smooth feature transition, and even widen this feature transition gap between anchor and target queries, which causes these methods to all underperform on newly emerging and disappearing objects that are common in the real world. We introduce Dynamic Anchor Queries (DAQ) to shorten the transition gap by dynamically generating anchor queries based on the features of potential newly emerging and disappearing candidates. Furthermore, we introduce a query-level object Emergence and Disappearance Simulation (EDS) strategy, which unleashes DAQ's potential without any additional cost. Finally, we combine our proposed DAQ and EDS with the previous method, DVIS, to obtain DVIS-DAQ. Extensive experiments demonstrate that DVIS-DAQ achieves a new state-of-the-art (SOTA) performance on five mainstream video segmentation benchmarks." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.618, + 0.741, + 0.646 + ], + "angle": 0, + "content": "Keywords: Video segmentation \\(\\cdot\\) Dynamic anchor design \\(\\cdot\\) Universal segmentation" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.675, + 0.377, + 0.691 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.71, + 0.788, + 0.802 + ], + "angle": 0, + "content": "Video segmentation aims at simultaneously identifying, segmenting, and tracking all objects of interest within a video [24, 47, 67, 68], which has many applications, including autonomous driving, video editing, content analysis, and video understanding [5, 45]. Modern video segmentation methods [18, 21, 23, 28, 33, 61, 70, 73, 74] adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.812, + 0.788, + 0.842 + ], + "angle": 0, + "content": "* The first two authors contribute equally. This work was performed when Tao Zhang was an Intern at Skywork AI. Corresponding authors: Shunping Ji and Xiangtai Li." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.144, + 0.419, + 0.271 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.427, + 0.145, + 0.582, + 0.268 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.582, + 0.145, + 0.78, + 0.269 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.282, + 0.788, + 0.407 + ], + "angle": 0, + "content": "Fig. 1: The preliminary experiments and our results. We analyze current query-based video segmentation methods' capabilities in handling objects' emergence and disappearance within videos. The scatter plot on the left illustrates the recall ratios for newly emerging and disappearing video objects on a subset of the BDD [71] dataset. The visual comparison is presented in the middle. The top two rows output from DVIS [73] and GenVIS [21], respectively. And the bottom row output from our method. The poor performance of previous methods on new emergence detection and disappearance filtering is highlighted by a red circle. On the right side, our method outperforms the current SOTA on mainstream video segmentation datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.441, + 0.785, + 0.472 + ], + "angle": 0, + "content": "and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.474, + 0.788, + 0.58 + ], + "angle": 0, + "content": "However, these query-based methods exhibit a notable limitation: they tend to underperform when dealing with newly emerging or disappearing objects, even with recent state-of-the-art (SOTA) methods [21, 73]. As shown in the left part of Fig. 1, these methods only achieve less than \\(45\\%\\) recall ratio on emerging and disappearing objects. As illustrated in the middle part of Fig. 1, they often fail to detect newly emerging objects. And they may incorrectly track a different, similar object when the original object disappears." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.582, + 0.788, + 0.748 + ], + "angle": 0, + "content": "A natural question arises: \"What causes the huge performance gap between continuously appearing objects and emerging/disappearing objects?\" We argue the answer lies in the unreasonable anchor queries for newly emerged and disappeared objects used in current methods. As shown in Fig. 2, in the SOTA query-based methods [21, 23, 73, 74], the anchor query for a newly emerged object is a background query, and the target is the feature representation of the object. In contrast, the anchor query for a disappeared object is the feature representation of the object before it disappeared, and the target is a background feature. A significant feature transition gap between background and foreground queries poses considerable challenges for retaining the smooth feature transition between anchor and target queries." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In this paper, we address this challenge by introducing Dynamic Anchor Queries (DAQ) mechanism to detect the emergence and disappearance of objects. As illustrated on the right side of Fig. 2, we regard all objects segmented in the current frame as potential candidates for newly emerging objects. We dynamically generate emergence anchor queries based on the features of these candidates to reduce the transition gap significantly. On the other hand, we des" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.654, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.143, + 0.782, + 0.287 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.298, + 0.785, + 0.368 + ], + "angle": 0, + "content": "Fig.2: The process of handling newly emerging and disappearing objects in different methods. Unlike previous approaches that treat appearing, disappearing, and tracked objects equally, our method dynamically generates anchor queries for emergence and disappearance based on candidate objects' features to effectively shorten the transition gap." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.395, + 0.785, + 0.529 + ], + "angle": 0, + "content": "ignate all tracked objects as candidates for disappearing objects and generate disappearance anchor queries dynamically using their features. These emergence and disappearance anchor queries and the representations of tracked objects are collectively inputted into the tracker to identify the objects of interest in the current frame. Objects identified by the emergence anchor queries are classified as newly appeared, while those pinpointed by the disappearance anchor queries are recognized as having disappeared, prompting their removal. The remaining queries are responsible for tracking objects present across both past and current frames." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.531, + 0.786, + 0.697 + ], + "angle": 0, + "content": "The proposed DAQ mechanism enhances the network's ability to handle the emergence and disappearance of objects. To further leverage the capabilities of DAQ, we propose a training time simulation strategy for the emergence and disappearance of objects, termed Emergence and Disappearance Simulation (EDS). This strategy simulates emergence and disappearance events by removing high-level object queries. We mimic object emergence by randomly eliminating some object queries propagated from the previous frame. Likewise, we simulate object disappearance by removing some of the current frame's object queries. Our simple yet effective simulation strategy generates numerous instances of object emergence and disappearance during training, thereby enabling comprehensive training of the DAQ mechanism and maximizing its potential." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.697, + 0.786, + 0.758 + ], + "angle": 0, + "content": "To verify the effectiveness of our proposed DAQ mechanism and EDS strategy, we integrate them into the current SOTA method, DVIS [73], to construct the DVIS-DAQ. As shown in the right part of Fig. 1, the DVIS-DAQ achieves new SOTA performance on five mainstream video segmentation benchmarks." + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.759, + 0.608, + 0.772 + ], + "angle": 0, + "content": "In summary, our main contributions are as follows:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.78, + 0.787, + 0.84 + ], + "angle": 0, + "content": "1. We have found that current query-based methods fall short in managing objects' emergence and disappearance due to the considerable transition gap between foreground and background queries. We propose a Dynamic Anchor Queries (DAQ) mechanism to address this challenge. The DAQ mechanism" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.242, + 0.147, + 0.785, + 0.177 + ], + "angle": 0, + "content": "dynamically generates anchor queries for objects' emergence and disappearance, thereby shortening the gap and effectively overcoming the challenge." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.178, + 0.784, + 0.237 + ], + "angle": 0, + "content": "2. To further unleash the potential of the DAQ mechanism, we introduce the Emergence and Disappearance Simulation (EDS) strategy. This straightforward and efficient approach amplifies the number of emergence and disappearance cases, thereby ensuring comprehensive training of the DAQ." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.239, + 0.785, + 0.313 + ], + "angle": 0, + "content": "3. We enhance the SOTA video segmentation method DVIS by integrating our proposed DAQ mechanism and EDS strategy, resulting in DVIS-DAQ. With extensive experiments on five video segmentation benchmarks, DVIS-DAQ achieves new SOTA performance on all benchmarks. We further present detailed ablation studies to verify the effectiveness of each component." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.339, + 0.388, + 0.354 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.372, + 0.786, + 0.703 + ], + "angle": 0, + "content": "Video Instance Segmentation (VIS). Earlier works [35, 68, 69] extend image instance segmentation methods by adding tracking heads and learning the feature association. With the rise of vision transformer [8, 16, 55], current SOTA video instance methods [10, 18, 22, 23, 28, 33, 37, 55, 60, 61, 70] adopt query-based designs. In particular, Video K-Net [34] and IDOL [61] directly learn the query association embeddings via contrastive learning. After that, association-based methods [23, 33, 37, 61, 68, 70], accomplish the tracking of video targets between adjacent frames or adjacent video clips through object matching. Meanwhile, several models [10, 22, 60] directly predict 3D volumes of video instances across times in a semi-online manner. On the other hand, propagation-based methods [18, 21, 28, 73] delegate the tracking problem to the transformer decoder. They take the object queries outputted from the previous frame or video clip as input and iteratively optimize them to segment the objects in the current frame. Inspired by the design of the dual encoder in the low-level area [53] and multi-task learning [31, 63], several works have also decoupled the tracking decoder and segmentation decoder. Note that these methods can also be applied for video panoptic segmentation (VPS) and video semantic segmentation (VSS) tasks [24, 39, 40, 48, 56, 80] by adding queries for segmenting the stuff. However, both poorly handle challenges such as new-emerging objects and target disappearance. Our approach improves the model's ability to address these challenges by employing dynamic anchor queries to manage the emergence and disappearance of objects." + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.705, + 0.786, + 0.84 + ], + "angle": 0, + "content": "Universal Video Segmentation. Current efforts in the field of video segmentation directly draw upon the design of universal image segmentation models [10, 12, 13, 54, 57, 66, 75] to develop universal video segmentation models [1, 26, 30, 33, 34, 59, 73], achieving comparable or even superior performance to specialized video segmentation methods. Video K-Net [34] and TubeFormer [26] are the first to unify all three video segmentation tasks. TarVIS [1] extends the concept of mask classification from image segmentation to video segmentation, accomplishing universal video segmentation via one shared model. DVIS [73] receives frame object query outputs from Mask2Former [10] for universal video" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.653, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "segmentation. Recently, several works [32, 64] unified both image and video segmentation in one model. However, these methods are still unaware of object emergence and disappearance problems, which are significant for long videos." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.788, + 0.329 + ], + "angle": 0, + "content": "Video Object Tracking. Object tracking [3,7,14,17,42,43,50,51,65,72,76,77] is a crucial task in VIS and VPS [4, 19, 24, 25, 29, 78], and many works adopt the tracking-by-detection paradigm [6, 27, 38, 46, 52, 58, 62, 79]. These methods divide the task into two sub-tasks, where an object detector first detects objects and then associates them using a tracking algorithm. Recent works [2, 15, 44, 49] also perform clip-wise segmentation and tracking. However, the former [15, 44] only focuses on single-object mask tracking, while the latter [49] considers global tracking via clip-level matching. Our work belongs to mask-based tracking, which is orthogonal to these existing tracking methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.352, + 0.331, + 0.368 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.384, + 0.362, + 0.399 + ], + "angle": 0, + "content": "3.1 Preliminary" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.409, + 0.794, + 0.47 + ], + "angle": 0, + "content": "Query-based Video Segmentation Formulations. Modern mainstream video segmentation methods [21,33,61,73,74] rely on queries to represent objects and achieve cross-frame association of objects. Here, we summarize current query-based video segmentation methods with the following formulation:" + }, + { + "type": "equation", + "bbox": [ + 0.286, + 0.481, + 0.786, + 0.5 + ], + "angle": 0, + "content": "\\[\nQ _ {S e g} ^ {T} = \\mathcal {S} (\\mathcal {I} ^ {T}), \\quad Q ^ {T} = \\mathcal {A} (Q ^ {T - 1}, Q _ {S e g} ^ {T}), \\quad \\mathcal {M} ^ {T}, \\mathcal {C} ^ {T} = \\mathcal {D} (Q ^ {T}). \\qquad (1)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.511, + 0.788, + 0.633 + ], + "angle": 0, + "content": "First, a segmenter \\(\\mathcal{S}\\) extracts query representations of objects \\(Q_{Seg}^{T}\\) from a single-frame image. Then, an association component \\(\\mathcal{A}\\) establishes connections between the current frame's object representations \\(Q_{Seg}^{T}\\) and \\(Q^{T-1}\\) to obtain associated object representations \\(Q^{T}\\). Finally, the object representations \\(Q^{T}\\) are decoded to obtain predictions of object categories \\(\\mathcal{C}^{T}\\) and segmentation masks \\(\\mathcal{M}^{T}\\) for the current frame. In this pipeline, the association component \\(\\mathcal{A}\\) is the most critical and challenging part. Most video segmentation methods focus on designing more efficient association modules." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.634, + 0.796, + 0.74 + ], + "angle": 0, + "content": "The current mainstream association modules \\(\\mathcal{A}\\) can be divided into association-based [23,33,61,70] and propagation-based [21,73,74] pipelines. They both model object emergence as a transition from background queries to foreground queries and model disappearance as a transition from foreground queries to background queries. Specifically, we can split \\(Q\\) into \\(Q_{Fg}\\) and \\(Q_{Bg}\\), and the tracking of continuously appearing objects, newly emerging objects, and disappearing objects can be described as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.266, + 0.751, + 0.786, + 0.771 + ], + "angle": 0, + "content": "\\[\nC o n t: Q _ {F g} ^ {T - 1} \\rightarrow Q _ {F g} ^ {T}, E m g: Q _ {B g} ^ {T - 1} \\rightarrow Q _ {F g} ^ {T}, D i s: Q _ {F g} ^ {T - 1} \\rightarrow Q _ {B g} ^ {T} (2)\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Limitations of the Query-based Methods. We find that current query-based methods [21, 23, 73] perform poorly on objects that emerge and disappear in the middle of a video, as shown in Fig. 1. For emerging objects, SOTA methods often miss detecting them. For disappearing objects, SOTA methods frequently" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.22 + ], + "angle": 0, + "content": "fail to recognize that the object has disappeared and may incorrectly segment another object. We quantitatively analyzed the recall ratios of emerging and disappearing objects in preliminary experiments using several SOTA methods. We found that the recall ratios of emerging and disappearing objects are very low (below \\(45\\%\\)) for these methods, as shown in Fig. 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.222, + 0.785, + 0.493 + ], + "angle": 0, + "content": "Thorough Analysis and Our Motivation. The same process for handling continuously appearing, emerging, and disappearing objects results in the performance difference of modern query based methods: they have demonstrated satisfactory performance on consistently appearing objects (exceeding 60 AP on the YouTube-VIS [68]), but they exhibit poor performance on newly emerging and disappearing objects. As depicted in Fig. 2 and Eq. 2, in current query-based methods, there should be a significant disparity in the modeling formulation between newly emerging or disappearing objects and consistently appearing objects. The former poses more challenges because of the significant feature gap in the transition between foreground and background queries. In this work, we generate dynamic anchor queries for newly emerging and disappearing objects, resulting in a lower feature transition gap than using the background or foreground query. We term the background or foreground query used in previous methods as Static Anchor Query (SAQ), the query of continuously appearing objects as Continuously Tracked Query (CTQ), and our proposed dynamically generated anchor query as Dynamic Anchor Query (DAQ). We use our proposed DAQ to replace the SAQ to address the challenge above. The details of the DAQ will be introduced in Sec. 3.2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.494, + 0.785, + 0.57 + ], + "angle": 0, + "content": "Furthermore, we observed that only less than \\(20\\%\\) of samples contain object emergence and disappearance in the existing datasets [39, 47, 68], including the most challenging OVIS [47] dataset. Therefore, to fully unleash the potential of our proposed DAQ, we introduce a simple yet effective query-level object emergence and disappearance simulation strategy, which will be detailed in Sec. 3.3." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.591, + 0.472, + 0.607 + ], + "angle": 0, + "content": "3.2 Dynamic Anchor Queries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.784, + 0.688 + ], + "angle": 0, + "content": "The key idea of DAQ is to dynamically generate anchor queries using the features of candidate objects that may emerge or disappear, thereby reducing the gap between anchor queries and the target queries for possible newly emerging or disappearing objects. DAQ allows the network to easily transform anchor queries to target queries and effectively handle object emergence and disappearance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.784, + 0.763 + ], + "angle": 0, + "content": "In this subsection, we introduce how to design and utilize Dynamic Anchor Queries (DAQ) to address the challenges mentioned above. First, we explain how the DAQ for newly emerging and disappearing objects are generated. Then, we explore how to make minor adjustments to the current query-based tracker to accommodate our proposed DAQ." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.784, + 0.843 + ], + "angle": 0, + "content": "Dynamic Anchor Queries for Emergence. When processing the \\( \\mathrm{T}^{th} \\) frame of a video, we consider all objects appearing in the current frame as candidates for newly emerging objects. The dynamic anchor queries for emergence \\( \\mathrm{DAQ}_{Emg} \\) are naturally generated based on the features of these candidates. As shown in Fig. 3 (a), \\( \\mathrm{DAQ}_{Emg} \\) consists of two parts: query feature \\( \\mathrm{DAQ}_{Emg}^{feat} \\) and query" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.653, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.144, + 0.558, + 0.278 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.144, + 0.781, + 0.278 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.288, + 0.785, + 0.331 + ], + "angle": 0, + "content": "Fig. 3: Generation of dynamic anchor queries. \\( F^T \\) represents the image feature of the \\( \\mathrm{T}^{th} \\) frame. Symbols \\( Emg \\) and \\( Dis \\) denote emergence and disappearance. Symbols \\( feat \\) and \\( pos \\) indicate feature and positional embedding, respectively." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.358, + 0.784, + 0.419 + ], + "angle": 0, + "content": "positional embedding \\(\\mathrm{DAQ}_{Emg}^{pos}\\). The query feature \\(\\mathrm{DAQ}_{Emg}^{feat}\\) is a learnable embedding shared by all dynamic anchor queries. The query positional embedding \\(\\mathrm{DAQ}_{Emg}^{pos}\\) is obtained using the appearance features \\(F_{mask}^{T}\\) of the candidates through simple Mask-Pooling:" + }, + { + "type": "equation", + "bbox": [ + 0.355, + 0.427, + 0.785, + 0.446 + ], + "angle": 0, + "content": "\\[\nF _ {m a s k} ^ {T} = \\operatorname {M L P} \\left(\\operatorname {M a s k P o o l i n g} \\left(F ^ {T}, \\mathcal {M} ^ {T}\\right)\\right), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.454, + 0.785, + 0.484 + ], + "angle": 0, + "content": "where \\(F^T\\) represents the image feature of the \\(\\mathrm{T}^{th}\\) frame, and \\(\\mathcal{M}^T\\) represents the segmentation masks of the candidates outputted by the segmenter." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.485, + 0.785, + 0.61 + ], + "angle": 0, + "content": "Dynamic Anchor Queries for Disappearance. When processing the \\( \\mathrm{T}^{th} \\) frame, we consider all currently tracked objects as candidates for disappearing objects. Similar to the dynamic anchor queries for emergence, the DAQ\\( _{Dis} \\) for disappearing objects are naturally generated based on the features of these candidates. As shown in Fig. 3 (b), the DAQ\\( _{Dis} \\) also consists of query feature DAQ\\( _{Dis}^{feat} \\) and query positional embedding DAQ\\( _{Dis}^{pos} \\). We use the candidates' momentum-weighted appearance features \\( \\overline{F}_{mask}^T \\) as the query positional embedding DAQ\\( _{Dis}^{pos} \\). The momentum-weighted function follows CTVIS [70]:" + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.618, + 0.785, + 0.64 + ], + "angle": 0, + "content": "\\[\n\\bar {F} _ {\\text {m a s k}} ^ {T} = (1 - \\beta) \\bar {F} _ {\\text {m a s k}} ^ {T - 1} + \\beta F _ {\\text {m a s k}} ^ {T} \\tag {4}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.344, + 0.66, + 0.785, + 0.701 + ], + "angle": 0, + "content": "\\[\n\\beta = \\max \\left(0, \\frac {1}{T} \\sum_ {t = 1} ^ {T - 1} \\operatorname {c o s i n e} \\left(F _ {\\text {m a s k}} ^ {t}, F _ {\\text {m a s k}} ^ {T}\\right)\\right) \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.784, + 0.779 + ], + "angle": 0, + "content": "Since the disappearance of an object needs to be modeled as a transition from an anchor query to a background query, to reduce the transition gap, we use the initial queries of segmenter as the query feature \\(\\mathrm{DAQ}_{Dis}^{feat}\\). Specifically, for each query feature, we match the closest one from the initial queries of the segmenter based on cosine similarity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Continuously Tracked Queries. We also assign query positional embedding \\(\\mathrm{CTQ}^{pos}\\) for continuously tracked queries (CTQ) to maintain the format consistency with dynamic anchor queries. We use the momentum-weighted appearance feature of the tracked objects as \\(\\mathrm{CTQ}^{pos}\\), the same process as Eq. 3, 4, and 5." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.145, + 0.778, + 0.261 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.273, + 0.788, + 0.318 + ], + "angle": 0, + "content": "Fig. 4: Tracker with dynamic anchor queries. \\( Q_{seg} \\) represents the query output of segmenter. CTQ and DAQ stand for continuously tracked and dynamic anchor queries, respectively. Symbols \\( Emg \\) and \\( Dis \\) denote emergence and disappearance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.343, + 0.789, + 0.555 + ], + "angle": 0, + "content": "Incorporating Dynamic Anchor Queries into a Tracker. As depicted in Fig. 4, we can seamlessly integrate DAQ into mainstream propagation-based trackers [21,73], requiring no alterations to the tracker's network architecture. We instantiate two trackers: Tracker 1, which takes CTQ and \\(\\mathrm{DAQ}_{Emg}\\) as inputs and is responsible for tracking continuously appearing and newly emerging objects, and Tracker 2, which receives \\(\\mathrm{DAQ}_{Dis}\\) along with several learnable background embeddings as inputs and identifies disappearing objects in the current frame. It's important to note that the SoftMax function in Tracker 2 operates along the Q-dimension to prevent multiple dynamic anchor queries from segmenting the same object. Through this pipeline, we can effectively and reasonably manage and model the emergence and disappearance of objects. Despite introducing an additional tracker, it's worth highlighting that the computational overhead is minimal, constituting less than \\(2\\%\\) of the overall computational cost [73], as processing occurs solely at the query level rather than on dense image features." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.575, + 0.609, + 0.592 + ], + "angle": 0, + "content": "3.3 Emergence and Disappearance Simulation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.789, + 0.704 + ], + "angle": 0, + "content": "As shown in Fig. 5, when using DAQ, it is possible to simulate object emergence and disappearance separately by removing parts of CTQ and \\( Q_{Seg} \\), respectively. We term this simple yet efficient simulation strategy as Emergence and Disappearance Simulation (EDS), which includes Emergence Simulation (ES) and Disappearance Simulation (DS). EDS can simulate numerous object emergence and disappearance cases during training without introducing additional costs, allowing the network to be fully trained and unleashing the potential of DAQ." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.789, + 0.809 + ], + "angle": 0, + "content": "New Emergence Simulation. As shown in Fig. 5 (a), taking the green object as an example, we can simulate it as an emerging object by removing its corresponding query from CTQ. At this point, this green object is not present in CTQ but exists in the current frame, consistent with the state of a real newly emerged object colored in gray. Then, the Tracker needs to transition the corresponding anchor query from \\(\\mathrm{DAQ}_{Emg}\\) to a foreground query and predict this green object's segmentation mask and class." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Disappearance Simulation. As shown in Fig. 5 (b), taking the yellow object as an example, by removing its corresponding query from \\( Q_{Seg} \\), we can simulate" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.653, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.776, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.144, + 0.377, + 0.257 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.384, + 0.144, + 0.526, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.308, + 0.261, + 0.444, + 0.272 + ], + "angle": 0, + "content": "(a) Emergence Simulation" + }, + { + "type": "image", + "bbox": [ + 0.528, + 0.144, + 0.644, + 0.258 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.647, + 0.144, + 0.781, + 0.258 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.574, + 0.261, + 0.729, + 0.273 + ], + "angle": 0, + "content": "(b) Disappearance Simulation" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.283, + 0.788, + 0.352 + ], + "angle": 0, + "content": "Fig.5: The pipelines of emergence and disappearance simulation. CTQ, \\(\\mathrm{DAQ}_{Emg}\\), \\(\\mathrm{DAQ}_{Dis}\\), and \\(Q_{Seg}\\) are represented by rectangles, circles, diamonds, and heptagons, respectively. White indicates the background query transformed from the anchor query. The red rectangles highlight the difference between with and without simulation." + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.37, + 0.78, + 0.435 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.321, + 0.446, + 0.68, + 0.461 + ], + "angle": 0, + "content": "Fig. 6: The architecture of DVIS-DAQ tracker." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.491, + 0.788, + 0.583 + ], + "angle": 0, + "content": "this object as a disappearing object because the Tracker only detects features from \\( Q_{Seg} \\) through cross-attention to obtain image information. At this point, this blue object is not present in the current frame but exists in the set of tracked objects, consistent with the state of a real disappearing blue object. The Tracker needs to transition the corresponding anchor query to a background query and determine the disappearance of this object." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.604, + 0.434, + 0.618 + ], + "angle": 0, + "content": "3.4 Overall Architecture" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.788, + 0.734 + ], + "angle": 0, + "content": "Architecture. Sec. 3.2 details how DAQ is integrated into the current query-based tracker without any requirement for architecture modification. We apply the SOTA video segmentation method DVIS [73] as our baseline and replace the Referring Cross-Attention [73,74] in its tracker with standard Cross-Attention to achieve a more straightforward and generalizable structure shown in Fig. 6. We then integrated DAQ into this simplified tracker, resulting in our architecture, DVIS-DAQ." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Objective Function. Our objective function differs from DVIS [73]. We maintain the historical matching relationship between the predictions of CTQ and ground truth for continuously tracked objects and remove the matched items from the ground truth. For newly emerging and disappearing objects, since DAQ is dynamically generated based on the features of candidates (refer to Sec. 3.2), we assign the remaining ground truth to DAQ based on the matching relationship between candidates and the remaining ground truth. Following this process," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Table 1: Results on the val set of OVIS and YouTube-VIS 2019 & 2021. † denotes with the offline refiner proposed by [73]. The VIT-L [16] is pre-trained by DINOV2 [41] and uses VIT-Adapter [9] to obtain multiscale features." + }, + { + "type": "table", + "bbox": [ + 0.243, + 0.2, + 0.761, + 0.509 + ], + "angle": 0, + "content": "
MethodBackboneOVISYT-VIS 2019YT-VIS 2021
AP\\( AP_{75} \\)\\( AR_{10} \\)AP\\( AP_{75} \\)\\( AR_{10} \\)AP\\( AP_{75} \\)\\( AR_{10} \\)
MinVIS [23]R5025.024.029.747.452.155.744.248.151.7
CTVIS [70]R5035.534.941.955.159.163.250.154.759.5
GenVIS [21]R5035.836.239.650.054.659.747.151.554.7
DVIS [73]R5030.230.537.351.257.159.346.449.653.5
DVIST† [73]R5033.833.539.552.358.260.447.451.655.2
DVIS++ [74]R5037.237.342.955.560.162.650.054.558.4
DVIST++† [74]R5041.240.947.3------
DVIS-DAQR5038.737.645.255.261.963.750.455.057.6
DVIS-DAQ†R5043.543.849.1------
MinVIS [23]Swin-L39.441.343.361.668.666.655.362.060.8
CTVIS [70]Swin-L46.947.552.165.672.270.461.268.865.8
GenVIS [21]Swin-L45.248.448.664.068.369.459.665.865.0
DVIS [73]Swin-L45.948.351.563.970.469.058.766.664.6
DVIST† [73]Swin-L48.650.553.864.972.770.360.168.465.7
DVIS++ [74]VIT-L49.655.054.667.775.373.762.370.268.0
DVIST++† [74]VIT-L53.458.558.768.376.173.463.971.569.5
DVIS-DAQSwin-L49.551.754.965.773.670.761.168.266.6
DVIS-DAQVIT-L53.758.259.568.376.173.562.470.868.0
DVIS-DAQ†VIT-L57.162.962.369.276.875.564.572.470.7
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.524, + 0.788, + 0.601 + ], + "angle": 0, + "content": "we obtain the matching relationship \\(\\{(i,\\sigma (i))|i\\in [1,M]\\}\\) between ground truth and predictions, M is the number of ground truth. The not-matched predictions are assigned with the background class and an empty segmentation mask. Then, the loss between matched prediction-label pairs \\((\\mathcal{P},\\mathcal{G})\\) can be calculated following the Mask2Former [11]:" + }, + { + "type": "equation", + "bbox": [ + 0.284, + 0.609, + 0.786, + 0.626 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} (\\mathcal {P}, \\mathcal {G}) = \\lambda_ {c l s} \\mathcal {L} _ {c l s} (\\mathcal {P}, \\mathcal {G}) + \\lambda_ {d i c e} \\mathcal {L} _ {d i c e} (\\mathcal {P}, \\mathcal {G}) + \\lambda_ {b c e} \\mathcal {L} _ {b c e} (\\mathcal {P}, \\mathcal {G}) \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.679 + ], + "angle": 0, + "content": "Here, \\(\\mathcal{L}_{cls}\\) represents the classification loss term, implemented using Cross Entropy Loss. \\(\\mathcal{L}_{dice}\\) and \\(\\mathcal{L}_{bce}\\) denote the segmentation loss terms, implemented respectively using Dice loss and Binary Cross Entropy loss." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.699, + 0.367, + 0.716 + ], + "angle": 0, + "content": "4 Experiment" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.728, + 0.44, + 0.741 + ], + "angle": 0, + "content": "4.1 Datasets and Metrics" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We conduct experiments on five mainstream video segmentation benchmarks, including OVIS [47], Youtube-VIS 2019 & 2021 & 2022 [68], and VIPSeg [39]. We employ AP and AR as evaluation metrics for the VIS datasets following [68]. We utilize Video Panoptic Quality (VPQ) and Segmentation and Tracking Quality (STQ) for the VPS datasets as evaluation metrics following [24,39]. More detailed settings can be found in the supplementary file." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.653, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.188 + ], + "angle": 0, + "content": "Table 2: Results on the validation sets of YouTube-VIS 2022 and VIPSeg. \\(\\mathrm{AP^L}\\) refers to the AP on the long video set. \\(\\mathrm{VPQ^{Th}}\\) and \\(\\mathrm{VPQ^{St}}\\) refer to the VPQ on the \"thing\" objects and the \"stuff\" objects, respectively." + }, + { + "type": "table", + "bbox": [ + 0.235, + 0.2, + 0.77, + 0.387 + ], + "angle": 0, + "content": "
MethodBackboneYT-VIS 2022VIPSeg
APLAP75AR10VPQVPQThVPQSSTQ
MinVIS [23]R5023.319.328.0----
TarVIS [1]R50---33.539.228.543.1
DVIS [73]R5031.637.036.339.438.640.136.3
DVIS++ [74]R5037.240.744.641.941.042.738.5
DVIS-DAQR5034.635.541.142.141.742.539.3
MinVIS [23]Swin-L33.133.736.6----
TarVIS [1]Swin-L---48.058.239.052.9
DVIS [73]Swin-L39.942.644.954.754.854.647.7
DVIS++ [74]VIT-L37.539.443.556.058.054.349.8
DVIS-DAQVIT-L42.043.048.457.460.454.752.0
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.408, + 0.416, + 0.423 + ], + "angle": 0, + "content": "4.2 Main Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.443, + 0.788, + 0.672 + ], + "angle": 0, + "content": "Performance on OVIS dataset. The OVIS dataset presents more challenging cases, such as occlusion, fast motion, and complex motion trajectories. We present the quantitative evaluation results in Tab. 1. When using ResNet-50 [20] as the backbone, our method achieves an AP of 38.7 and 43.5 with the offline refiner, surpassing all existing methods. Compared to the current SOTA DVIS++ [74], our method shows an improvement of 1.5 AP (38.7 vs. 37.2) and 2.3 AP (43.5 vs. 41.2) with the offline refiner. When employing a larger backbone, our method achieves even more significant improvements. With Swin-L [36] as the backbone, our method outperforms DVIS [73] by 3.6 AP (49.5 vs. 45.9). When using VIT-L [16] as the backbone, our method surpasses DVIS++ by 4.1 AP (53.7 vs. 49.6). Notably, our DVIS-DAQ even outperforms DVIS++ with the offline refiner (53.7 vs. 53.4), while DVIS-DAQ with the offline refiner has reached 57.1 AP. These quantitative results demonstrate that our DAQ design significantly enhances the capability of query-based video segmentation methods in processing complex scenes with many object emergence and disappearances." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.672, + 0.788, + 0.777 + ], + "angle": 0, + "content": "Performance on Youtube-VIS 2019 & 2021 datasets. The videos in these two datasets are relatively short and feature simple scenes. As shown in Tab. 1, when using ResNet-50 as the backbone, our method achieves a 4.0 AP improvement compared to the baseline DVIS on the YTVIS 2019 and 2021 datasets. When using VIT-L as the backbone, we achieve comparable performance with DVIS++. When using the offline refiner, we outperform DVIS++ by 0.9 AP and 0.6 AP on the YTVIS 2019 and 2021 datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Performance on Youtube-VIS 2022 dataset. Youtube-VIS 2022 has been expanded with 71 long videos based on the 2021 version. Therefore, we only report the \\(\\mathrm{AP^L}\\) for the long videos in Tab. 2. When using ResNet-50 as the backbone, DVIS-DAQ outperforms the baseline DVIS with \\(3.0\\mathrm{AP}^{\\mathrm{L}}\\). Our method" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.247, + 0.145, + 0.754, + 0.16 + ], + "angle": 0, + "content": "Table 3: Ablation studies on our proposed DAQ and other network details." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.169, + 0.391, + 0.261 + ], + "angle": 0, + "content": "(a) The main ablation study of the proposed DAQ and EDS. The baseline is the extension of DVIS [73]. EDAQ/DDAQ denotes emergence/disappearance DAQ. ES/DS denotes emergence/disappearance simulation." + }, + { + "type": "text", + "bbox": [ + 0.4, + 0.169, + 0.518, + 0.262 + ], + "angle": 0, + "content": "(b) Candidates selection for emergence DAQ. K denotes the number of top-scoring candidates. N denotes the number of learnable embeddings." + }, + { + "type": "text", + "bbox": [ + 0.526, + 0.169, + 0.632, + 0.21 + ], + "angle": 0, + "content": "(c) Threshold selection for new emergence simulation." + }, + { + "type": "text", + "bbox": [ + 0.64, + 0.169, + 0.788, + 0.262 + ], + "angle": 0, + "content": "(d) Disappearance simulation. One, Continuous, and Random represent simulating disappearance for an object in a solitary frame, all frames, and randomly selected frames within a video clip, respectively." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.267, + 0.391, + 0.357 + ], + "angle": 0, + "content": "
EDAQ ES DDAQ DS | AP
35.4
✓33.3
✓32.3
✓✓36.4
✓✓✓36.6
✓✓✓37.1
" + }, + { + "type": "table", + "bbox": [ + 0.409, + 0.267, + 0.508, + 0.356 + ], + "angle": 0, + "content": "
KNAP
100136.4
50135.9
50236.5
25435.6
" + }, + { + "type": "table", + "bbox": [ + 0.529, + 0.267, + 0.63, + 0.356 + ], + "angle": 0, + "content": "
ThresholdAP
0.0134.2
0.0534.7
0.1035.6
0.2034.5
0.5033.2
" + }, + { + "type": "table", + "bbox": [ + 0.653, + 0.268, + 0.774, + 0.355 + ], + "angle": 0, + "content": "
TypeAP
One36.3
Continuous35.8
Random37.1
" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.359, + 0.493, + 0.442 + ], + "angle": 0, + "content": "(e) Generation of emergence DAQ. \\(SegQ / SegP / AppF\\) denotes the query feature/positional embedding/appearance feature of the segmenter's frame object output. Add/Cat denotes adding/concatenating the selected features to the query feature of emergence DAQ. Pos denotes using the selected feature as the positional embedding of emergence DAQ." + }, + { + "type": "text", + "bbox": [ + 0.509, + 0.359, + 0.788, + 0.452 + ], + "angle": 0, + "content": "(f) Generation of disappearance DAQ. Learn and Initial SegQ represent initializing the query feature of disappearance DAQ by using a new learnable embedding and the initial queries of segmenter, respectively. \\(CTQF / CTQP\\) represent using the query feature/momentum-weighted appearance feature of tracked objects as the positional embeddings of disappearance DAQ." + }, + { + "type": "table", + "bbox": [ + 0.235, + 0.457, + 0.475, + 0.507 + ], + "angle": 0, + "content": "
MetricFeature selectionFeature usage
SegQSegPAppFAdd Cat Pos
AP34.836.036.436.0 36.2 36.4
" + }, + { + "type": "table", + "bbox": [ + 0.511, + 0.457, + 0.8, + 0.507 + ], + "angle": 0, + "content": "
MetricQuery feature Learn Initial SegQPositional CTQFembedding CTQP
AP36.537.136.837.1
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.537, + 0.785, + 0.566 + ], + "angle": 0, + "content": "outperforms DVIS++ with 4.5 AP\\(^{\\text{L}}\\) (42.0 vs. 37.5) when using VIT-L as the backbone." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.691 + ], + "angle": 0, + "content": "Performance on VIPSeg dataset. VIPSeg is a large-scale video panoptic segmentation dataset containing various real-world scenes and more categories. Tab. 2 presents the performance comparison with SOTA methods. Our method achieves new SOTA performance with both ResNet-50 and VIT-L backbone settings. Our method achieves a VPQ of 42.1 when using ResNet-50 as the backbone, surpassing the baseline DVIS by 2.7 VPQ. With VIT-L as the backbone, our method achieves a VPQ of 57.4, demonstrating a 2.4 VPQ improvement over the previous SOTA DVIS++ in \"thing\" objects." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.718, + 0.512, + 0.735 + ], + "angle": 0, + "content": "4.3 Ablation Studies and Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We perform ablation experiments on the OVIS dataset using the ResNet-50 backbone and 40K training iterations. We use DVIS [73] as the baseline. When aligning the training and testing settings with DVIS++ [74], the baseline achieves an AP of 35.4. More detailed settings are provided in the supplementary materials. Moreover, we also refer the readers for more different architectures using our DAQ in supplementary part." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.654, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.146, + 0.786, + 0.343 + ], + "angle": 0, + "content": "Effectiveness of DAQ and EDS. Tab. 3a presents the ablation studies about our proposed components. Using emergence dynamic anchor queries alone leads to a performance degradation of 2.1 AP, attributed to insufficient examples of emergence objects for training. When the emergence simulation strategy is used alone, performance drops by 3.1 AP, indicating that the unreasonable anchor design in the previous method [73] makes it difficult for the network to learn to handle object emergence, even with sufficient training cases. When emergence dynamic anchor queries and emergence simulation are used together, the reasonable mechanism and sufficient training cases result in a 1.0 AP improvement compared to the baseline. Disappearing dynamic anchor queries contribute to a performance improvement of 0.2 AP. Introducing the Disappearing Simulation strategy to provide sufficient cases of disappearing objects further increases model performance by 0.5 AP." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.347, + 0.787, + 0.466 + ], + "angle": 0, + "content": "Emergence dynamic anchor queries. DAQ comprises query feature embedding and positional embedding. Firstly, we explore different strategies for selecting emergency candidates, and the results are presented in Tab. 3b. When choosing the top 100 object predictions of the segmenter as candidates, with only one shared learnable embedding, we obtain 36.4 AP. Setting the number of candidates to the top 50 and the number of learnable embeddings to 2 brings a performance gain of 0.1 AP. To explore potential new objects fully, we choose the top 100 scheme." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.471, + 0.786, + 0.592 + ], + "angle": 0, + "content": "In Tab. 3e, we investigate how to generate corresponding dynamic anchor queries based on the features of emerging candidates. We find that utilizing candidates' appearance features yields the best results, surpassing the use of positional features and object queries with a hybrid of positional and appearance information by 1.6 AP and 0.4 AP, respectively. Furthermore, leveraging the features of candidates in the form of query positional embedding results in the best performance, outperforming addition and concatenation operations by 0.4 AP and 0.2 AP, respectively." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.596, + 0.786, + 0.716 + ], + "angle": 0, + "content": "Disappearance dynamic anchor queries. In Tab. 3f, we explore how to initialize the query feature embedding and positional embedding of disappearance DAQ. We find that initializing query feature of disappearance DAQ from the initial queries in the segmenter (as shown in Fig. 3) yields better AP than using a new shared learnable embedding for all disappearance DAQ (37.1 vs. 36.5). For generation of positional embedding of disappearance DAQ, we find utilizing the momentum-weighted appearance feature of tracked objects yield better AP than utilizing the query feature of tracked objects (37.1 vs. 36.8)." + }, + { + "type": "text", + "bbox": [ + 0.219, + 0.72, + 0.786, + 0.84 + ], + "angle": 0, + "content": "Emergence and disappearance simulation. We employ a threshold to filter out low-scoring tracked objects in emergence simulation. Tab. 3c illustrates the results when using different thresholds. A minimal threshold (0.01) results in insufficient new emergence cases, whereas a larger threshold (0.5) disrupts the model's ability to learn continuous tracking. Both result in poor performance (34.2 AP and 33.2 AP). A similar phenomenon is observed in the disappearance simulation, as shown in Tab. 3d. The simulation of an object's disappearance in a solitary frame within a video clip fails to generate sufficient disappearance" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "image", + "bbox": [ + 0.263, + 0.146, + 0.744, + 0.351 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.361, + 0.788, + 0.416 + ], + "angle": 0, + "content": "Fig. 7: Qualitative results comparison for emergence detection and disappearance filtering. The performance enhancements are highlighted by rectangles in various colors, each color representing an individual video object. It's better to view with zooming in \\(8 \\times\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.431, + 0.788, + 0.536 + ], + "angle": 0, + "content": "cases. Conversely, simulating the disappearance across all frames compromises the model's capability to learn continuous tracking. Consequently, we have determined that a threshold of 0.1 strikes an optimal balance for simulating emergence, and we opt for a stochastic selection of frames in a video clip to simulate disappearance. This strategy ensures ample emergence and disappearance cases while preserving the model's tracking capability for continually appearing objects." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.537, + 0.788, + 0.613 + ], + "angle": 0, + "content": "Qualitative results comparison. In Fig. 7, we present the visual comparison with our baseline. In this challenging scene, there are new-emerging, disappearing, and reappearing video objects. Our method accurately addresses all these scenarios, whereas DVIS suffers from issues including missed new-emerging objects and ID switches." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.639, + 0.36, + 0.656 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.674, + 0.789, + 0.841 + ], + "angle": 0, + "content": "We observed that current SOTA query-based video segmentation methods perform poorly on newly emerging and disappearing objects. We have analyzed and identified the significant transition gap hindering the network's learning. We address this challenge by proposing dynamic anchor queries for shortening the transition gap. We also introduce a query-level simulation strategy for simulating object disappearance and emergence without additional costs. By integrating our proposed dynamic anchor queries and simulation strategy into DVIS, we obtained DVIS-DAQ, which achieved SOTA performance on mainstream video segmentation benchmarks. Our research will inspire the video community to bridge the gap between current advancements in the standard benchmarks and real-world application requirements." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.653, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.178, + 0.785, + 0.208 + ], + "angle": 0, + "content": "1. Athar, A., Hermans, A., Luiten, J., Ramanan, D., Leibe, B.: Tarvis: A unified approach for target-based video segmentation. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.209, + 0.785, + 0.236 + ], + "angle": 0, + "content": "2. Athar, A., Mahadevan, S., Osep, A., Leal-Taixe, L., Leibe, B.: Stem-seg: Spatiotemporal embeddings for instance segmentation in videos. In: ECCV (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.237, + 0.785, + 0.263 + ], + "angle": 0, + "content": "3. Bekuzarov, M., Bermudez, A., Lee, J.Y., Li, H.: Xmem++: Production-level video segmentation from few annotated frames (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.264, + 0.785, + 0.292 + ], + "angle": 0, + "content": "4. Bertasius, G., Torresani, L.: Classifying, segmenting, and tracking object instances in video with mask propagation (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.293, + 0.785, + 0.32 + ], + "angle": 0, + "content": "5. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.321, + 0.785, + 0.348 + ], + "angle": 0, + "content": "6. Bewley, A., Ge, Z., Ott, L., Ramos, F., Upcroft, B.: Simple online and realtime tracking. In: ICIP (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.349, + 0.785, + 0.376 + ], + "angle": 0, + "content": "7. Caelles, S., Maninis, K., Pont-Tuset, J., Leal-Taixe, L., Cremers, D., Van Gool, L.: One-shot video object segmentation. In: CVPR (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.377, + 0.785, + 0.404 + ], + "angle": 0, + "content": "8. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.406, + 0.785, + 0.433 + ], + "angle": 0, + "content": "9. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. arXiv preprint arXiv:2205.08534 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.434, + 0.785, + 0.474 + ], + "angle": 0, + "content": "0. Cheng, B., Choudhuri, A., Misra, I., Kirillov, A., Girdhar, R., Schwing, A.G.: Mask2former for video instance segmentation. arXiv preprint arXiv:2112.10764 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.476, + 0.785, + 0.503 + ], + "angle": 0, + "content": "1. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.504, + 0.785, + 0.531 + ], + "angle": 0, + "content": "2. Cheng, B., Schwing, A., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation. NeurIPS (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.532, + 0.785, + 0.559 + ], + "angle": 0, + "content": "3. Cheng, H.K., Oh, S.W., Price, B., Schwing, A., Lee, J.Y.: Tracking anything with decoupled video segmentation. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.56, + 0.785, + 0.587 + ], + "angle": 0, + "content": "4. Cheng, H.K., Tai, Y.W., Tang, C.K.: Rethinking space-time networks with improved memory coverage for efficient video object segmentation. In: NeurIPS (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.588, + 0.785, + 0.616 + ], + "angle": 0, + "content": "5. Ding, H., Liu, C., He, S., Jiang, X., Torr, P.H., Bai, S.: MOSE: A new dataset for video object segmentation in complex scenes. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.617, + 0.785, + 0.657 + ], + "angle": 0, + "content": "6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. ICLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.659, + 0.785, + 0.685 + ], + "angle": 0, + "content": "7. Gao, R., Wang, L.: MeMOTR: Long-term memory-augmented transformer for multi-object tracking. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.687, + 0.785, + 0.728 + ], + "angle": 0, + "content": "8. Hannan, T., Koner, R., Bernhard, M., Shit, S., Menze, B., Tresp, V., Schubert, M., Seidl, T.: Gratt-vis: Gated residual attention for auto rectifying video instance segmentation. arXiv preprint arXiv:2305.17096 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.729, + 0.785, + 0.756 + ], + "angle": 0, + "content": "9. He, J., Yu, Q., Shin, I., Deng, X., Shen, X., Yuille, A., Chen, L.C.: Maxtron: Mask transformer with trajectory attention for video panoptic segmentation (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.757, + 0.785, + 0.784 + ], + "angle": 0, + "content": "20. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.785, + 0.812 + ], + "angle": 0, + "content": "21. Heo, M., Hwang, S., Hyun, J., Kim, H., Oh, S.W., Lee, J.Y., Kim, S.J.: A generalized framework for video instance segmentation. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "22. Heo, M., Hwang, S., Oh, S.W., Lee, J.Y., Kim, S.J.: Vita: Video instance segmentation via object token association. NIPS (2022)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.178, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "23. Huang, D.A., Yu, Z., Anandkumar, A.: Minvis: A minimal video instance segmentation framework without video-based training. NeurIPS (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.203 + ], + "angle": 0, + "content": "24. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.204, + 0.785, + 0.231 + ], + "angle": 0, + "content": "25. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.232, + 0.785, + 0.259 + ], + "angle": 0, + "content": "26. Kim, D., Xie, J., Wang, H., Qiao, S., Yu, Q., Kim, H.S., Adam, H., Kweon, I.S., Chen, L.C.: Tubeformer-deeplab: Video mask transformer. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.26, + 0.785, + 0.286 + ], + "angle": 0, + "content": "27. Leal-Taixe, L., Canton-Ferrer, C., Schindler, K.: Learning by tracking: Siamese cnn for robust target association. In: CVPR Workshops (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.287, + 0.785, + 0.314 + ], + "angle": 0, + "content": "28. Li, J., Yu, B., Rao, Y., Zhou, J., Lu, J.: Tcovis: Temporally consistent online video instance segmentation. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.315, + 0.785, + 0.342 + ], + "angle": 0, + "content": "29. Li, M., Li, S., Zhang, X., Zhang, L.: Univs: Unified and universal video segmentation with prompts as queries (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.343, + 0.785, + 0.383 + ], + "angle": 0, + "content": "30. Li, X., Ding, H., Zhang, W., Yuan, H., Cheng, G., Jiangmiao, P., Chen, K., Liu, Z., Loy, C.C.: Transformer-based visual segmentation: A survey. arXiv pre-print (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.384, + 0.785, + 0.411 + ], + "angle": 0, + "content": "31. Li, X., Xu, S., Cheng, Y.Y., Tong, Y., Tao, D., et al.: Panoptic-partformer: Learning a unified model for panoptic part segmentation. ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.412, + 0.785, + 0.438 + ], + "angle": 0, + "content": "32. Li, X., Yuan, H., Li, W., Ding, H., Wu, S., Zhang, W., Li, Y., Chen, K., Loy, C.C.: Omg-seg: Is one model good enough for all segmentation? CVPR (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.439, + 0.785, + 0.466 + ], + "angle": 0, + "content": "33. Li, X., Yuan, H., Zhang, W., Cheng, G., Pang, J., Loy, C.C.: Tube-link: A flexible cross tube framework for universal video segmentation. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.467, + 0.785, + 0.494 + ], + "angle": 0, + "content": "34. Li, X., Zhang, W., Pang, J., Chen, K., Cheng, G., Tong, Y., Loy, C.C.: Video k-net: A simple, strong, and unified baseline for video segmentation. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.495, + 0.785, + 0.522 + ], + "angle": 0, + "content": "35. Lin, C.C., Hung, Y., Feris, R., He, L.: Video instance segmentation tracking with a modified vae architecture. In: CVPR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.523, + 0.785, + 0.549 + ], + "angle": 0, + "content": "36. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.55, + 0.785, + 0.591 + ], + "angle": 0, + "content": "37. Meinhardt, T., Feiszli, M., Fan, Y., Leal-Taixe, L., Ranjan, R.: Novis: A case for end-to-end near-online video instance segmentation. arXiv preprint arXiv:2308.15266 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.592, + 0.785, + 0.619 + ], + "angle": 0, + "content": "38. Meinhardt, T., Kirillov, A., Leal-Taixe, L., Feichtenhofer, C.: Trackformer: Multi-object tracking with transformers. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.62, + 0.785, + 0.646 + ], + "angle": 0, + "content": "39. Miao, J., Wang, X., Wu, Y., Li, W., Zhang, X., Wei, Y., Yang, Y.: Large-scale video panoptic segmentation in the wild: A benchmark. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.647, + 0.785, + 0.674 + ], + "angle": 0, + "content": "40. Miao, J., Wei, Y., Wu, Y., Liang, C., Li, G., Yang, Y.: Vspw: A large-scale dataset for video scene parsing in the wild. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.675, + 0.785, + 0.715 + ], + "angle": 0, + "content": "41. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.716, + 0.785, + 0.743 + ], + "angle": 0, + "content": "42. Pang, J., Qiu, L., Li, X., Chen, H., Li, Q., Darrell, T., Yu, F.: Quasi-dense similarity learning for multiple object tracking. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.744, + 0.785, + 0.771 + ], + "angle": 0, + "content": "43. Pang, Z., Li, Z., Wang, N.: Simpletrack: Understanding and rethinking 3d multi-object tracking. arXiv preprint arXiv:2111.09621 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.772, + 0.785, + 0.799 + ], + "angle": 0, + "content": "44. Park, K., Woo, S., Oh, S.W., Kweon, I.S., Lee, J.Y.: Per-clip video object segmentation. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.8, + 0.785, + 0.84 + ], + "angle": 0, + "content": "45. Patrick, M., Campbell, D., Asano, Y.M., Metze, I.M.F., Feichtenhofer, C., Vedaldi, A., Henriques, J.F.: Keeping your eye on the ball: Trajectory attention in video transformers. In: NeurIPS (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.654, + 0.115, + 0.732, + 0.128 + ], + "angle": 0, + "content": "DVIS-DAQ" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "46. Porzi, L., Hofinger, M., Ruiz, I., Serrat, J., Bulo, S.R., Kontschieder, P.: Learning multi-object tracking and segmentation from automatic annotations. In: CVPR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.189, + 0.788, + 0.217 + ], + "angle": 0, + "content": "47. Qi, J., Gao, Y., Hu, Y., Wang, X., Liu, X., Bai, X., Belongie, S., Yuille, A., Torr, P.H., Bai, S.: Occluded video instance segmentation: A benchmark. IJCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.217, + 0.788, + 0.243 + ], + "angle": 0, + "content": "48. Qiao, S., Zhu, Y., Adam, H., Yuille, A., Chen, L.C.: Vip-deeplab: Learning visual perception with depth-aware video panoptic segmentation. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.243, + 0.788, + 0.27 + ], + "angle": 0, + "content": "49. Sanghyun, W., Kwanyong, P., Seoung, W.O., In, S.K., Joon-Young, L.: Tracking by associating clips. In: ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.27, + 0.788, + 0.311 + ], + "angle": 0, + "content": "50. Seong, H., Oh, S.W., Lee, J.Y., Lee, S., Lee, S., Kim, E.: Hierarchical memory matching network for video object segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.311, + 0.788, + 0.352 + ], + "angle": 0, + "content": "51. Sun, P., Cao, J., Jiang, Y., Yuan, Z., Bai, S., Kitani, K., Luo, P.: Dancetrack: Multi-object tracking in uniform appearance and diverse motion. arXiv preprint arXiv:2111.14690 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.352, + 0.788, + 0.393 + ], + "angle": 0, + "content": "52. Sun, P., Cao, J., Jiang, Y., Zhang, R., Xie, E., Yuan, Z., Wang, C., Luo, P.: Transtrack: Multiple-object tracking with transformer. arXiv preprint arXiv: 2012.15460 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.393, + 0.788, + 0.42 + ], + "angle": 0, + "content": "53. Tsai, Y.J., Liu, Y.L., Qi, L., Chan, K.C., Yang, M.H.: Dual associated encoder for face restoration. arXiv preprint arXiv:2308.07314 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.42, + 0.788, + 0.447 + ], + "angle": 0, + "content": "54. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.447, + 0.788, + 0.473 + ], + "angle": 0, + "content": "55. Wang, Y., Xu, Z., Wang, X., Shen, C., Cheng, B., Shen, H., Xia, H.: End-to-end video instance segmentation with transformers. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.473, + 0.788, + 0.515 + ], + "angle": 0, + "content": "56. Weber, M., Xie, J., Collins, M., Zhu, Y., Voigtlaender, P., Adam, H., Green, B., Geiger, A., Leibe, B., Cremers, D., et al.: Step: Segmenting and tracking every pixel. arXiv preprint arXiv:2102.11859 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.515, + 0.788, + 0.556 + ], + "angle": 0, + "content": "57. Weng, Y., Han, M., He, H., Li, M., Yao, L., Chang, X., Zhuang, B.: Mask propagation for efficient video semantic segmentation. arXiv preprint arXiv:2310.18954 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.556, + 0.788, + 0.582 + ], + "angle": 0, + "content": "58. Wu, J., Cao, J., Song, L., Wang, Y., Yang, M., Yuan, J.: Track to detect and segment: An online multi-object tracker. In: CVPR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.582, + 0.788, + 0.623 + ], + "angle": 0, + "content": "59. Wu, J., Li, X., Xu, S., Yuan, H., Ding, H., Yang, Y., Li, X., Zhang, J., Tong, Y., Jiang, X., Ghanem, B., Tao, D.: Towards open vocabulary learning: A survey. T-PAMI (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.623, + 0.788, + 0.65 + ], + "angle": 0, + "content": "60. Wu, J., Jiang, Y., Bai, S., Zhang, W., Bai, X.: Seqformer: Sequential transformer for video instance segmentation. In: ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.65, + 0.788, + 0.677 + ], + "angle": 0, + "content": "61. Wu, J., Liu, Q., Jiang, Y., Bai, S., Yuille, A., Bai, X.: In defense of online models for video instance segmentation. In: ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.677, + 0.788, + 0.704 + ], + "angle": 0, + "content": "62. Xu, J., Cao, Y., Zhang, Z., Hu, H.: Spatial-temporal relation networks for multi-object tracking. In: ICCV (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.704, + 0.788, + 0.745 + ], + "angle": 0, + "content": "63. Xu, S., Li, X., Wang, J., Cheng, G., Tong, Y., Tao, D.: Fashionformer: A simple, effective and unified baseline for human fashion segmentation and recognition. In: ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.745, + 0.788, + 0.787 + ], + "angle": 0, + "content": "64. Xu, S., Yuan, H., Shi, Q., Qi, L., Wang, J., Yang, Y., Li, Y., Chen, K., Tong, Y., Ghanem, B., Li, X., Yang, M.H.: Rap-sam:towards real-time all-purpose segment anything. arXiv preprint (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.787, + 0.788, + 0.814 + ], + "angle": 0, + "content": "65. Yan, B., Jiang, Y., Sun, P., Wang, D., Yuan, Z., Luo, P., Lu, H.: Towards grand unification of object tracking. In: ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.814, + 0.788, + 0.841 + ], + "angle": 0, + "content": "66. Yan, B., Jiang, Y., Wu, J., Wang, D., Luo, P., Yuan, Z., Lu, H.: Universal instance perception as object discovery and retrieval. In: CVPR (2023)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.462, + 0.129 + ], + "angle": 0, + "content": "Y. Zhou and T. Zhang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "67. Yang, J., Peng, W., Li, X., Guo, Z., Chen, L., Li, B., Ma, Z., Zhou, K., Zhang, W., Loy, C.C., et al.: Panoptic video scene graph generation. In: CVPR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.176, + 0.733, + 0.189 + ], + "angle": 0, + "content": "68. Yang, L., Fan, Y., Xu, N.: Video instance segmentation. In: ICCV (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.785, + 0.217 + ], + "angle": 0, + "content": "69. Yang, S., Fang, Y., Wang, X., Li, Y., Fang, C., Shan, Y., Feng, B., Liu, W.: Crossover learning for fast online video instance segmentation. In: ICCV (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.785, + 0.258 + ], + "angle": 0, + "content": "70. Ying, K., Zhong, Q., Mao, W., Wang, Z., Chen, H., Wu, L.Y., Liu, Y., Fan, C., Zhuge, Y., Shen, C.: C'tvis: Consistent training for online video instance segmentation. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.259, + 0.785, + 0.299 + ], + "angle": 0, + "content": "71. Yu, F., Chen, H., Wang, X., Xian, W., Chen, Y., Liu, F., Madhavan, V., Darrell, T.: Bdd100k: A diverse driving dataset for heterogeneous multitask learning. In: CVPR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.785, + 0.327 + ], + "angle": 0, + "content": "72. Zeng, F., Dong, B., Zhang, Y., Wang, T., Zhang, X., Wei, Y.: Motr: End-to-end multiple-object tracking with transformer. In: ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.355 + ], + "angle": 0, + "content": "73. Zhang, T., Tian, X., Wu, Y., Ji, S., Wang, X., Zhang, Y., Wan, P.: Dvis: Decoupled video instance segmentation framework. In: ICCV (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.356, + 0.785, + 0.397 + ], + "angle": 0, + "content": "74. Zhang, T., Tian, X., Zhou, Y., Ji, S., Wang, X., Tao, X., Zhang, Y., Wan, P., Wang, Z., Wu, Y.: Dvis++: Improved decoupled framework for universal video segmentation. arXiv preprint arXiv:2312.13305 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.424 + ], + "angle": 0, + "content": "75. Zhang, W., Pang, J., Chen, K., Loy, C.C.: K-net: Towards unified image segmentation. NIPS (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.466 + ], + "angle": 0, + "content": "76. Zhang, Y., Sun, P., Jiang, Y., Yu, D., Weng, F., Yuan, Z., Luo, P., Liu, W., Wang, X.: Bytetrack: Multi-object tracking by associating every detection box. ECCV (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.508 + ], + "angle": 0, + "content": "77. Zhou, Q., Li, X., He, L., Yang, Y., Cheng, G., Tong, Y., Ma, L., Tao, D.: Transvod: end-to-end video object detection with spatial-temporal transformers. T-PAMI (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.508, + 0.785, + 0.549 + ], + "angle": 0, + "content": "78. Zhou, Y., Zhang, H., Lee, H., Sun, S., Li, P., Zhu, Y., Yoo, B., Qi, X., Han, J.J.: Slot-vps: Object-centric representation learning for video panoptic segmentation. In: CVPR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.549, + 0.785, + 0.577 + ], + "angle": 0, + "content": "79. Zhu, J., Yang, H., Liu, N., Kim, M., Zhang, W., Yang, M.H.: Online multi-object tracking with dual matching attention networks. In: ECCV (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.577, + 0.785, + 0.605 + ], + "angle": 0, + "content": "80. Zhu, X., Xiong, Y., Dai, J., Yuan, L., Wei, Y.: Deep feature flow for video recognition. CVPR (2016)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.605 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_origin.pdf b/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..973562f9a4b38615f782ff9cd6de977a354e63bf --- /dev/null +++ b/2024/Improving Video Segmentation via Dynamic Anchor Queries/81dcee9e-1ea9-48fa-b4d8-416512fcd8be_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:71374e836bcbf0bd8697fcde39ffa48e079b72d1ade213800081a8a3dc810640 +size 7444217 diff --git a/2024/Improving Video Segmentation via Dynamic Anchor Queries/full.md b/2024/Improving Video Segmentation via Dynamic Anchor Queries/full.md new file mode 100644 index 0000000000000000000000000000000000000000..850f6749fe894ad964f1fd439742a05369f1db77 --- /dev/null +++ b/2024/Improving Video Segmentation via Dynamic Anchor Queries/full.md @@ -0,0 +1,330 @@ +# Improving Video Segmentation via Dynamic Anchor Queries + +Yikang Zhou $^{1}$ , Tao Zhang $^{1,2}$ , Shumping Ji $^{1}$ , Shuicheng Yan $^{2}$ , and Xiangtai Li $^{2}$ + +1 Wuhan University + +2 Skywork AI + +zhang_tao@whu.edu.cn, zhouyik@whu.edu.cn, xiangtai94@gmail.com + +Project page: https://zhang-tao-whu.github.io/projects/DVIS_DAQ + +Abstract. Modern video segmentation methods adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects. However, the emergence and disappearance of objects interrupt the smooth feature transition, and even widen this feature transition gap between anchor and target queries, which causes these methods to all underperform on newly emerging and disappearing objects that are common in the real world. We introduce Dynamic Anchor Queries (DAQ) to shorten the transition gap by dynamically generating anchor queries based on the features of potential newly emerging and disappearing candidates. Furthermore, we introduce a query-level object Emergence and Disappearance Simulation (EDS) strategy, which unleashes DAQ's potential without any additional cost. Finally, we combine our proposed DAQ and EDS with the previous method, DVIS, to obtain DVIS-DAQ. Extensive experiments demonstrate that DVIS-DAQ achieves a new state-of-the-art (SOTA) performance on five mainstream video segmentation benchmarks. + +Keywords: Video segmentation $\cdot$ Dynamic anchor design $\cdot$ Universal segmentation + +# 1 Introduction + +Video segmentation aims at simultaneously identifying, segmenting, and tracking all objects of interest within a video [24, 47, 67, 68], which has many applications, including autonomous driving, video editing, content analysis, and video understanding [5, 45]. Modern video segmentation methods [18, 21, 23, 28, 33, 61, 70, 73, 74] adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor + +![](images/3267843f58267bec669762b378d9bad1e9ba9f6fd458f74a24f2350a2a7f492e.jpg) +Fig. 1: The preliminary experiments and our results. We analyze current query-based video segmentation methods' capabilities in handling objects' emergence and disappearance within videos. The scatter plot on the left illustrates the recall ratios for newly emerging and disappearing video objects on a subset of the BDD [71] dataset. The visual comparison is presented in the middle. The top two rows output from DVIS [73] and GenVIS [21], respectively. And the bottom row output from our method. The poor performance of previous methods on new emergence detection and disappearance filtering is highlighted by a red circle. On the right side, our method outperforms the current SOTA on mainstream video segmentation datasets. + +![](images/77e09471c7b28231bf3f73b1ad94b0048deafcfe253f4cf4bcc7fcbf25f1965e.jpg) + +![](images/6ddd6e1a3f54573033103a600761a35de81e594de222fb729ac4bdb5962c0472.jpg) + +and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects. + +However, these query-based methods exhibit a notable limitation: they tend to underperform when dealing with newly emerging or disappearing objects, even with recent state-of-the-art (SOTA) methods [21, 73]. As shown in the left part of Fig. 1, these methods only achieve less than $45\%$ recall ratio on emerging and disappearing objects. As illustrated in the middle part of Fig. 1, they often fail to detect newly emerging objects. And they may incorrectly track a different, similar object when the original object disappears. + +A natural question arises: "What causes the huge performance gap between continuously appearing objects and emerging/disappearing objects?" We argue the answer lies in the unreasonable anchor queries for newly emerged and disappeared objects used in current methods. As shown in Fig. 2, in the SOTA query-based methods [21, 23, 73, 74], the anchor query for a newly emerged object is a background query, and the target is the feature representation of the object. In contrast, the anchor query for a disappeared object is the feature representation of the object before it disappeared, and the target is a background feature. A significant feature transition gap between background and foreground queries poses considerable challenges for retaining the smooth feature transition between anchor and target queries. + +In this paper, we address this challenge by introducing Dynamic Anchor Queries (DAQ) mechanism to detect the emergence and disappearance of objects. As illustrated on the right side of Fig. 2, we regard all objects segmented in the current frame as potential candidates for newly emerging objects. We dynamically generate emergence anchor queries based on the features of these candidates to reduce the transition gap significantly. On the other hand, we des + +![](images/c11ab16cb7e92e388239eaced80848f59b22347eef4e5cf76fe245051b44ff23.jpg) +Fig.2: The process of handling newly emerging and disappearing objects in different methods. Unlike previous approaches that treat appearing, disappearing, and tracked objects equally, our method dynamically generates anchor queries for emergence and disappearance based on candidate objects' features to effectively shorten the transition gap. + +ignate all tracked objects as candidates for disappearing objects and generate disappearance anchor queries dynamically using their features. These emergence and disappearance anchor queries and the representations of tracked objects are collectively inputted into the tracker to identify the objects of interest in the current frame. Objects identified by the emergence anchor queries are classified as newly appeared, while those pinpointed by the disappearance anchor queries are recognized as having disappeared, prompting their removal. The remaining queries are responsible for tracking objects present across both past and current frames. + +The proposed DAQ mechanism enhances the network's ability to handle the emergence and disappearance of objects. To further leverage the capabilities of DAQ, we propose a training time simulation strategy for the emergence and disappearance of objects, termed Emergence and Disappearance Simulation (EDS). This strategy simulates emergence and disappearance events by removing high-level object queries. We mimic object emergence by randomly eliminating some object queries propagated from the previous frame. Likewise, we simulate object disappearance by removing some of the current frame's object queries. Our simple yet effective simulation strategy generates numerous instances of object emergence and disappearance during training, thereby enabling comprehensive training of the DAQ mechanism and maximizing its potential. + +To verify the effectiveness of our proposed DAQ mechanism and EDS strategy, we integrate them into the current SOTA method, DVIS [73], to construct the DVIS-DAQ. As shown in the right part of Fig. 1, the DVIS-DAQ achieves new SOTA performance on five mainstream video segmentation benchmarks. + +In summary, our main contributions are as follows: + +1. We have found that current query-based methods fall short in managing objects' emergence and disappearance due to the considerable transition gap between foreground and background queries. We propose a Dynamic Anchor Queries (DAQ) mechanism to address this challenge. The DAQ mechanism + +dynamically generates anchor queries for objects' emergence and disappearance, thereby shortening the gap and effectively overcoming the challenge. + +2. To further unleash the potential of the DAQ mechanism, we introduce the Emergence and Disappearance Simulation (EDS) strategy. This straightforward and efficient approach amplifies the number of emergence and disappearance cases, thereby ensuring comprehensive training of the DAQ. + +3. We enhance the SOTA video segmentation method DVIS by integrating our proposed DAQ mechanism and EDS strategy, resulting in DVIS-DAQ. With extensive experiments on five video segmentation benchmarks, DVIS-DAQ achieves new SOTA performance on all benchmarks. We further present detailed ablation studies to verify the effectiveness of each component. + +# 2 Related Work + +Video Instance Segmentation (VIS). Earlier works [35, 68, 69] extend image instance segmentation methods by adding tracking heads and learning the feature association. With the rise of vision transformer [8, 16, 55], current SOTA video instance methods [10, 18, 22, 23, 28, 33, 37, 55, 60, 61, 70] adopt query-based designs. In particular, Video K-Net [34] and IDOL [61] directly learn the query association embeddings via contrastive learning. After that, association-based methods [23, 33, 37, 61, 68, 70], accomplish the tracking of video targets between adjacent frames or adjacent video clips through object matching. Meanwhile, several models [10, 22, 60] directly predict 3D volumes of video instances across times in a semi-online manner. On the other hand, propagation-based methods [18, 21, 28, 73] delegate the tracking problem to the transformer decoder. They take the object queries outputted from the previous frame or video clip as input and iteratively optimize them to segment the objects in the current frame. Inspired by the design of the dual encoder in the low-level area [53] and multi-task learning [31, 63], several works have also decoupled the tracking decoder and segmentation decoder. Note that these methods can also be applied for video panoptic segmentation (VPS) and video semantic segmentation (VSS) tasks [24, 39, 40, 48, 56, 80] by adding queries for segmenting the stuff. However, both poorly handle challenges such as new-emerging objects and target disappearance. Our approach improves the model's ability to address these challenges by employing dynamic anchor queries to manage the emergence and disappearance of objects. + +Universal Video Segmentation. Current efforts in the field of video segmentation directly draw upon the design of universal image segmentation models [10, 12, 13, 54, 57, 66, 75] to develop universal video segmentation models [1, 26, 30, 33, 34, 59, 73], achieving comparable or even superior performance to specialized video segmentation methods. Video K-Net [34] and TubeFormer [26] are the first to unify all three video segmentation tasks. TarVIS [1] extends the concept of mask classification from image segmentation to video segmentation, accomplishing universal video segmentation via one shared model. DVIS [73] receives frame object query outputs from Mask2Former [10] for universal video + +segmentation. Recently, several works [32, 64] unified both image and video segmentation in one model. However, these methods are still unaware of object emergence and disappearance problems, which are significant for long videos. + +Video Object Tracking. Object tracking [3,7,14,17,42,43,50,51,65,72,76,77] is a crucial task in VIS and VPS [4, 19, 24, 25, 29, 78], and many works adopt the tracking-by-detection paradigm [6, 27, 38, 46, 52, 58, 62, 79]. These methods divide the task into two sub-tasks, where an object detector first detects objects and then associates them using a tracking algorithm. Recent works [2, 15, 44, 49] also perform clip-wise segmentation and tracking. However, the former [15, 44] only focuses on single-object mask tracking, while the latter [49] considers global tracking via clip-level matching. Our work belongs to mask-based tracking, which is orthogonal to these existing tracking methods. + +# 3 Method + +# 3.1 Preliminary + +Query-based Video Segmentation Formulations. Modern mainstream video segmentation methods [21,33,61,73,74] rely on queries to represent objects and achieve cross-frame association of objects. Here, we summarize current query-based video segmentation methods with the following formulation: + +$$ +Q _ {S e g} ^ {T} = \mathcal {S} (\mathcal {I} ^ {T}), \quad Q ^ {T} = \mathcal {A} (Q ^ {T - 1}, Q _ {S e g} ^ {T}), \quad \mathcal {M} ^ {T}, \mathcal {C} ^ {T} = \mathcal {D} (Q ^ {T}). \qquad (1) +$$ + +First, a segmenter $\mathcal{S}$ extracts query representations of objects $Q_{Seg}^{T}$ from a single-frame image. Then, an association component $\mathcal{A}$ establishes connections between the current frame's object representations $Q_{Seg}^{T}$ and $Q^{T-1}$ to obtain associated object representations $Q^{T}$ . Finally, the object representations $Q^{T}$ are decoded to obtain predictions of object categories $\mathcal{C}^{T}$ and segmentation masks $\mathcal{M}^{T}$ for the current frame. In this pipeline, the association component $\mathcal{A}$ is the most critical and challenging part. Most video segmentation methods focus on designing more efficient association modules. + +The current mainstream association modules $\mathcal{A}$ can be divided into association-based [23,33,61,70] and propagation-based [21,73,74] pipelines. They both model object emergence as a transition from background queries to foreground queries and model disappearance as a transition from foreground queries to background queries. Specifically, we can split $Q$ into $Q_{Fg}$ and $Q_{Bg}$ , and the tracking of continuously appearing objects, newly emerging objects, and disappearing objects can be described as follows: + +$$ +C o n t: Q _ {F g} ^ {T - 1} \rightarrow Q _ {F g} ^ {T}, E m g: Q _ {B g} ^ {T - 1} \rightarrow Q _ {F g} ^ {T}, D i s: Q _ {F g} ^ {T - 1} \rightarrow Q _ {B g} ^ {T} (2) +$$ + +Limitations of the Query-based Methods. We find that current query-based methods [21, 23, 73] perform poorly on objects that emerge and disappear in the middle of a video, as shown in Fig. 1. For emerging objects, SOTA methods often miss detecting them. For disappearing objects, SOTA methods frequently + +fail to recognize that the object has disappeared and may incorrectly segment another object. We quantitatively analyzed the recall ratios of emerging and disappearing objects in preliminary experiments using several SOTA methods. We found that the recall ratios of emerging and disappearing objects are very low (below $45\%$ ) for these methods, as shown in Fig. 1. + +Thorough Analysis and Our Motivation. The same process for handling continuously appearing, emerging, and disappearing objects results in the performance difference of modern query based methods: they have demonstrated satisfactory performance on consistently appearing objects (exceeding 60 AP on the YouTube-VIS [68]), but they exhibit poor performance on newly emerging and disappearing objects. As depicted in Fig. 2 and Eq. 2, in current query-based methods, there should be a significant disparity in the modeling formulation between newly emerging or disappearing objects and consistently appearing objects. The former poses more challenges because of the significant feature gap in the transition between foreground and background queries. In this work, we generate dynamic anchor queries for newly emerging and disappearing objects, resulting in a lower feature transition gap than using the background or foreground query. We term the background or foreground query used in previous methods as Static Anchor Query (SAQ), the query of continuously appearing objects as Continuously Tracked Query (CTQ), and our proposed dynamically generated anchor query as Dynamic Anchor Query (DAQ). We use our proposed DAQ to replace the SAQ to address the challenge above. The details of the DAQ will be introduced in Sec. 3.2. + +Furthermore, we observed that only less than $20\%$ of samples contain object emergence and disappearance in the existing datasets [39, 47, 68], including the most challenging OVIS [47] dataset. Therefore, to fully unleash the potential of our proposed DAQ, we introduce a simple yet effective query-level object emergence and disappearance simulation strategy, which will be detailed in Sec. 3.3. + +# 3.2 Dynamic Anchor Queries + +The key idea of DAQ is to dynamically generate anchor queries using the features of candidate objects that may emerge or disappear, thereby reducing the gap between anchor queries and the target queries for possible newly emerging or disappearing objects. DAQ allows the network to easily transform anchor queries to target queries and effectively handle object emergence and disappearance. + +In this subsection, we introduce how to design and utilize Dynamic Anchor Queries (DAQ) to address the challenges mentioned above. First, we explain how the DAQ for newly emerging and disappearing objects are generated. Then, we explore how to make minor adjustments to the current query-based tracker to accommodate our proposed DAQ. + +Dynamic Anchor Queries for Emergence. When processing the $\mathrm{T}^{th}$ frame of a video, we consider all objects appearing in the current frame as candidates for newly emerging objects. The dynamic anchor queries for emergence $\mathrm{DAQ}_{Emg}$ are naturally generated based on the features of these candidates. As shown in Fig. 3 (a), $\mathrm{DAQ}_{Emg}$ consists of two parts: query feature $\mathrm{DAQ}_{Emg}^{feat}$ and query + +![](images/caffc65a8c6341c092eb5af8300ea5191057755a40c7787d864f3d1db5dd8fc0.jpg) +Fig. 3: Generation of dynamic anchor queries. $F^T$ represents the image feature of the $\mathrm{T}^{th}$ frame. Symbols $Emg$ and $Dis$ denote emergence and disappearance. Symbols $feat$ and $pos$ indicate feature and positional embedding, respectively. + +![](images/a950a62622817c45162a8f555a8b86a75807c95e7065df0384244d9b77cfe791.jpg) + +positional embedding $\mathrm{DAQ}_{Emg}^{pos}$ . The query feature $\mathrm{DAQ}_{Emg}^{feat}$ is a learnable embedding shared by all dynamic anchor queries. The query positional embedding $\mathrm{DAQ}_{Emg}^{pos}$ is obtained using the appearance features $F_{mask}^{T}$ of the candidates through simple Mask-Pooling: + +$$ +F _ {m a s k} ^ {T} = \operatorname {M L P} \left(\operatorname {M a s k P o o l i n g} \left(F ^ {T}, \mathcal {M} ^ {T}\right)\right), \tag {3} +$$ + +where $F^T$ represents the image feature of the $\mathrm{T}^{th}$ frame, and $\mathcal{M}^T$ represents the segmentation masks of the candidates outputted by the segmenter. + +Dynamic Anchor Queries for Disappearance. When processing the $\mathrm{T}^{th}$ frame, we consider all currently tracked objects as candidates for disappearing objects. Similar to the dynamic anchor queries for emergence, the DAQ $_{Dis}$ for disappearing objects are naturally generated based on the features of these candidates. As shown in Fig. 3 (b), the DAQ $_{Dis}$ also consists of query feature DAQ $_{Dis}^{feat}$ and query positional embedding DAQ $_{Dis}^{pos}$ . We use the candidates' momentum-weighted appearance features $\overline{F}_{mask}^T$ as the query positional embedding DAQ $_{Dis}^{pos}$ . The momentum-weighted function follows CTVIS [70]: + +$$ +\bar {F} _ {\text {m a s k}} ^ {T} = (1 - \beta) \bar {F} _ {\text {m a s k}} ^ {T - 1} + \beta F _ {\text {m a s k}} ^ {T} \tag {4} +$$ + +$$ +\beta = \max \left(0, \frac {1}{T} \sum_ {t = 1} ^ {T - 1} \operatorname {c o s i n e} \left(F _ {\text {m a s k}} ^ {t}, F _ {\text {m a s k}} ^ {T}\right)\right) \tag {5} +$$ + +Since the disappearance of an object needs to be modeled as a transition from an anchor query to a background query, to reduce the transition gap, we use the initial queries of segmenter as the query feature $\mathrm{DAQ}_{Dis}^{feat}$ . Specifically, for each query feature, we match the closest one from the initial queries of the segmenter based on cosine similarity. + +Continuously Tracked Queries. We also assign query positional embedding $\mathrm{CTQ}^{pos}$ for continuously tracked queries (CTQ) to maintain the format consistency with dynamic anchor queries. We use the momentum-weighted appearance feature of the tracked objects as $\mathrm{CTQ}^{pos}$ , the same process as Eq. 3, 4, and 5. + +![](images/c665a55a8c4df5c5ac98f2e658e5f5caafdd3b324d2497f23ea48c571861adea.jpg) +Fig. 4: Tracker with dynamic anchor queries. $Q_{seg}$ represents the query output of segmenter. CTQ and DAQ stand for continuously tracked and dynamic anchor queries, respectively. Symbols $Emg$ and $Dis$ denote emergence and disappearance. + +Incorporating Dynamic Anchor Queries into a Tracker. As depicted in Fig. 4, we can seamlessly integrate DAQ into mainstream propagation-based trackers [21,73], requiring no alterations to the tracker's network architecture. We instantiate two trackers: Tracker 1, which takes CTQ and $\mathrm{DAQ}_{Emg}$ as inputs and is responsible for tracking continuously appearing and newly emerging objects, and Tracker 2, which receives $\mathrm{DAQ}_{Dis}$ along with several learnable background embeddings as inputs and identifies disappearing objects in the current frame. It's important to note that the SoftMax function in Tracker 2 operates along the Q-dimension to prevent multiple dynamic anchor queries from segmenting the same object. Through this pipeline, we can effectively and reasonably manage and model the emergence and disappearance of objects. Despite introducing an additional tracker, it's worth highlighting that the computational overhead is minimal, constituting less than $2\%$ of the overall computational cost [73], as processing occurs solely at the query level rather than on dense image features. + +# 3.3 Emergence and Disappearance Simulation + +As shown in Fig. 5, when using DAQ, it is possible to simulate object emergence and disappearance separately by removing parts of CTQ and $Q_{Seg}$ , respectively. We term this simple yet efficient simulation strategy as Emergence and Disappearance Simulation (EDS), which includes Emergence Simulation (ES) and Disappearance Simulation (DS). EDS can simulate numerous object emergence and disappearance cases during training without introducing additional costs, allowing the network to be fully trained and unleashing the potential of DAQ. + +New Emergence Simulation. As shown in Fig. 5 (a), taking the green object as an example, we can simulate it as an emerging object by removing its corresponding query from CTQ. At this point, this green object is not present in CTQ but exists in the current frame, consistent with the state of a real newly emerged object colored in gray. Then, the Tracker needs to transition the corresponding anchor query from $\mathrm{DAQ}_{Emg}$ to a foreground query and predict this green object's segmentation mask and class. + +Disappearance Simulation. As shown in Fig. 5 (b), taking the yellow object as an example, by removing its corresponding query from $Q_{Seg}$ , we can simulate + +![](images/e1890ed6e53fb9ce793d9a8493c6f54e7971b99f686d754dd6119e48c2a638ea.jpg) + +![](images/ff95b780ec06b6eb6ab57fc9a83d67c7dc6212750e328a9f72b43e93a213e0b8.jpg) +(a) Emergence Simulation + +![](images/bab02cf7b60fd149b4c9d6f27d37c4bd2b3ad66234dbf09f44f2ea8ef3d8c183.jpg) +(b) Disappearance Simulation + +![](images/b0832627bfae775c8914eca17ae978a5200415c1a41c506d6c085ec4366e87e8.jpg) + +![](images/f25cccc0626990fb1d6888c0e3b8d0831456a4c7f3935b6de122cb067fba348e.jpg) +Fig.5: The pipelines of emergence and disappearance simulation. CTQ, $\mathrm{DAQ}_{Emg}$ , $\mathrm{DAQ}_{Dis}$ , and $Q_{Seg}$ are represented by rectangles, circles, diamonds, and heptagons, respectively. White indicates the background query transformed from the anchor query. The red rectangles highlight the difference between with and without simulation. +Fig. 6: The architecture of DVIS-DAQ tracker. + +this object as a disappearing object because the Tracker only detects features from $Q_{Seg}$ through cross-attention to obtain image information. At this point, this blue object is not present in the current frame but exists in the set of tracked objects, consistent with the state of a real disappearing blue object. The Tracker needs to transition the corresponding anchor query to a background query and determine the disappearance of this object. + +# 3.4 Overall Architecture + +Architecture. Sec. 3.2 details how DAQ is integrated into the current query-based tracker without any requirement for architecture modification. We apply the SOTA video segmentation method DVIS [73] as our baseline and replace the Referring Cross-Attention [73,74] in its tracker with standard Cross-Attention to achieve a more straightforward and generalizable structure shown in Fig. 6. We then integrated DAQ into this simplified tracker, resulting in our architecture, DVIS-DAQ. + +Objective Function. Our objective function differs from DVIS [73]. We maintain the historical matching relationship between the predictions of CTQ and ground truth for continuously tracked objects and remove the matched items from the ground truth. For newly emerging and disappearing objects, since DAQ is dynamically generated based on the features of candidates (refer to Sec. 3.2), we assign the remaining ground truth to DAQ based on the matching relationship between candidates and the remaining ground truth. Following this process, + +Table 1: Results on the val set of OVIS and YouTube-VIS 2019 & 2021. † denotes with the offline refiner proposed by [73]. The VIT-L [16] is pre-trained by DINOV2 [41] and uses VIT-Adapter [9] to obtain multiscale features. + +
MethodBackboneOVISYT-VIS 2019YT-VIS 2021
AP\( AP_{75} \)\( AR_{10} \)AP\( AP_{75} \)\( AR_{10} \)AP\( AP_{75} \)\( AR_{10} \)
MinVIS [23]R5025.024.029.747.452.155.744.248.151.7
CTVIS [70]R5035.534.941.955.159.163.250.154.759.5
GenVIS [21]R5035.836.239.650.054.659.747.151.554.7
DVIS [73]R5030.230.537.351.257.159.346.449.653.5
DVIST† [73]R5033.833.539.552.358.260.447.451.655.2
DVIS++ [74]R5037.237.342.955.560.162.650.054.558.4
DVIST++† [74]R5041.240.947.3------
DVIS-DAQR5038.737.645.255.261.963.750.455.057.6
DVIS-DAQ†R5043.543.849.1------
MinVIS [23]Swin-L39.441.343.361.668.666.655.362.060.8
CTVIS [70]Swin-L46.947.552.165.672.270.461.268.865.8
GenVIS [21]Swin-L45.248.448.664.068.369.459.665.865.0
DVIS [73]Swin-L45.948.351.563.970.469.058.766.664.6
DVIST† [73]Swin-L48.650.553.864.972.770.360.168.465.7
DVIS++ [74]VIT-L49.655.054.667.775.373.762.370.268.0
DVIST++† [74]VIT-L53.458.558.768.376.173.463.971.569.5
DVIS-DAQSwin-L49.551.754.965.773.670.761.168.266.6
DVIS-DAQVIT-L53.758.259.568.376.173.562.470.868.0
DVIS-DAQ†VIT-L57.162.962.369.276.875.564.572.470.7
+ +we obtain the matching relationship $\{(i,\sigma (i))|i\in [1,M]\}$ between ground truth and predictions, M is the number of ground truth. The not-matched predictions are assigned with the background class and an empty segmentation mask. Then, the loss between matched prediction-label pairs $(\mathcal{P},\mathcal{G})$ can be calculated following the Mask2Former [11]: + +$$ +\mathcal {L} (\mathcal {P}, \mathcal {G}) = \lambda_ {c l s} \mathcal {L} _ {c l s} (\mathcal {P}, \mathcal {G}) + \lambda_ {d i c e} \mathcal {L} _ {d i c e} (\mathcal {P}, \mathcal {G}) + \lambda_ {b c e} \mathcal {L} _ {b c e} (\mathcal {P}, \mathcal {G}) \tag {6} +$$ + +Here, $\mathcal{L}_{cls}$ represents the classification loss term, implemented using Cross Entropy Loss. $\mathcal{L}_{dice}$ and $\mathcal{L}_{bce}$ denote the segmentation loss terms, implemented respectively using Dice loss and Binary Cross Entropy loss. + +# 4 Experiment + +# 4.1 Datasets and Metrics + +We conduct experiments on five mainstream video segmentation benchmarks, including OVIS [47], Youtube-VIS 2019 & 2021 & 2022 [68], and VIPSeg [39]. We employ AP and AR as evaluation metrics for the VIS datasets following [68]. We utilize Video Panoptic Quality (VPQ) and Segmentation and Tracking Quality (STQ) for the VPS datasets as evaluation metrics following [24,39]. More detailed settings can be found in the supplementary file. + +Table 2: Results on the validation sets of YouTube-VIS 2022 and VIPSeg. $\mathrm{AP^L}$ refers to the AP on the long video set. $\mathrm{VPQ^{Th}}$ and $\mathrm{VPQ^{St}}$ refer to the VPQ on the "thing" objects and the "stuff" objects, respectively. + +
MethodBackboneYT-VIS 2022VIPSeg
APLAP75AR10VPQVPQThVPQSSTQ
MinVIS [23]R5023.319.328.0----
TarVIS [1]R50---33.539.228.543.1
DVIS [73]R5031.637.036.339.438.640.136.3
DVIS++ [74]R5037.240.744.641.941.042.738.5
DVIS-DAQR5034.635.541.142.141.742.539.3
MinVIS [23]Swin-L33.133.736.6----
TarVIS [1]Swin-L---48.058.239.052.9
DVIS [73]Swin-L39.942.644.954.754.854.647.7
DVIS++ [74]VIT-L37.539.443.556.058.054.349.8
DVIS-DAQVIT-L42.043.048.457.460.454.752.0
+ +# 4.2 Main Experiments + +Performance on OVIS dataset. The OVIS dataset presents more challenging cases, such as occlusion, fast motion, and complex motion trajectories. We present the quantitative evaluation results in Tab. 1. When using ResNet-50 [20] as the backbone, our method achieves an AP of 38.7 and 43.5 with the offline refiner, surpassing all existing methods. Compared to the current SOTA DVIS++ [74], our method shows an improvement of 1.5 AP (38.7 vs. 37.2) and 2.3 AP (43.5 vs. 41.2) with the offline refiner. When employing a larger backbone, our method achieves even more significant improvements. With Swin-L [36] as the backbone, our method outperforms DVIS [73] by 3.6 AP (49.5 vs. 45.9). When using VIT-L [16] as the backbone, our method surpasses DVIS++ by 4.1 AP (53.7 vs. 49.6). Notably, our DVIS-DAQ even outperforms DVIS++ with the offline refiner (53.7 vs. 53.4), while DVIS-DAQ with the offline refiner has reached 57.1 AP. These quantitative results demonstrate that our DAQ design significantly enhances the capability of query-based video segmentation methods in processing complex scenes with many object emergence and disappearances. + +Performance on Youtube-VIS 2019 & 2021 datasets. The videos in these two datasets are relatively short and feature simple scenes. As shown in Tab. 1, when using ResNet-50 as the backbone, our method achieves a 4.0 AP improvement compared to the baseline DVIS on the YTVIS 2019 and 2021 datasets. When using VIT-L as the backbone, we achieve comparable performance with DVIS++. When using the offline refiner, we outperform DVIS++ by 0.9 AP and 0.6 AP on the YTVIS 2019 and 2021 datasets. + +Performance on Youtube-VIS 2022 dataset. Youtube-VIS 2022 has been expanded with 71 long videos based on the 2021 version. Therefore, we only report the $\mathrm{AP^L}$ for the long videos in Tab. 2. When using ResNet-50 as the backbone, DVIS-DAQ outperforms the baseline DVIS with $3.0\mathrm{AP}^{\mathrm{L}}$ . Our method + +(a) The main ablation study of the proposed DAQ and EDS. The baseline is the extension of DVIS [73]. EDAQ/DDAQ denotes emergence/disappearance DAQ. ES/DS denotes emergence/disappearance simulation. + +(b) Candidates selection for emergence DAQ. K denotes the number of top-scoring candidates. N denotes the number of learnable embeddings. + +(c) Threshold selection for new emergence simulation. + +(d) Disappearance simulation. One, Continuous, and Random represent simulating disappearance for an object in a solitary frame, all frames, and randomly selected frames within a video clip, respectively. + +Table 3: Ablation studies on our proposed DAQ and other network details. + +
EDAQ ES DDAQ DS | AP
35.4
✓33.3
✓32.3
✓✓36.4
✓✓✓36.6
✓✓✓37.1
+ +
KNAP
100136.4
50135.9
50236.5
25435.6
+ +
ThresholdAP
0.0134.2
0.0534.7
0.1035.6
0.2034.5
0.5033.2
+ +
TypeAP
One36.3
Continuous35.8
Random37.1
+ +(e) Generation of emergence DAQ. $SegQ / SegP / AppF$ denotes the query feature/positional embedding/appearance feature of the segmenter's frame object output. Add/Cat denotes adding/concatenating the selected features to the query feature of emergence DAQ. Pos denotes using the selected feature as the positional embedding of emergence DAQ. + +(f) Generation of disappearance DAQ. Learn and Initial SegQ represent initializing the query feature of disappearance DAQ by using a new learnable embedding and the initial queries of segmenter, respectively. $CTQF / CTQP$ represent using the query feature/momentum-weighted appearance feature of tracked objects as the positional embeddings of disappearance DAQ. + +
MetricFeature selectionFeature usage
SegQSegPAppFAdd Cat Pos
AP34.836.036.436.0 36.2 36.4
+ +
MetricQuery feature Learn Initial SegQPositional CTQFembedding CTQP
AP36.537.136.837.1
+ +outperforms DVIS++ with 4.5 AP $^{\text{L}}$ (42.0 vs. 37.5) when using VIT-L as the backbone. + +Performance on VIPSeg dataset. VIPSeg is a large-scale video panoptic segmentation dataset containing various real-world scenes and more categories. Tab. 2 presents the performance comparison with SOTA methods. Our method achieves new SOTA performance with both ResNet-50 and VIT-L backbone settings. Our method achieves a VPQ of 42.1 when using ResNet-50 as the backbone, surpassing the baseline DVIS by 2.7 VPQ. With VIT-L as the backbone, our method achieves a VPQ of 57.4, demonstrating a 2.4 VPQ improvement over the previous SOTA DVIS++ in "thing" objects. + +# 4.3 Ablation Studies and Analysis + +We perform ablation experiments on the OVIS dataset using the ResNet-50 backbone and 40K training iterations. We use DVIS [73] as the baseline. When aligning the training and testing settings with DVIS++ [74], the baseline achieves an AP of 35.4. More detailed settings are provided in the supplementary materials. Moreover, we also refer the readers for more different architectures using our DAQ in supplementary part. + +Effectiveness of DAQ and EDS. Tab. 3a presents the ablation studies about our proposed components. Using emergence dynamic anchor queries alone leads to a performance degradation of 2.1 AP, attributed to insufficient examples of emergence objects for training. When the emergence simulation strategy is used alone, performance drops by 3.1 AP, indicating that the unreasonable anchor design in the previous method [73] makes it difficult for the network to learn to handle object emergence, even with sufficient training cases. When emergence dynamic anchor queries and emergence simulation are used together, the reasonable mechanism and sufficient training cases result in a 1.0 AP improvement compared to the baseline. Disappearing dynamic anchor queries contribute to a performance improvement of 0.2 AP. Introducing the Disappearing Simulation strategy to provide sufficient cases of disappearing objects further increases model performance by 0.5 AP. + +Emergence dynamic anchor queries. DAQ comprises query feature embedding and positional embedding. Firstly, we explore different strategies for selecting emergency candidates, and the results are presented in Tab. 3b. When choosing the top 100 object predictions of the segmenter as candidates, with only one shared learnable embedding, we obtain 36.4 AP. Setting the number of candidates to the top 50 and the number of learnable embeddings to 2 brings a performance gain of 0.1 AP. To explore potential new objects fully, we choose the top 100 scheme. + +In Tab. 3e, we investigate how to generate corresponding dynamic anchor queries based on the features of emerging candidates. We find that utilizing candidates' appearance features yields the best results, surpassing the use of positional features and object queries with a hybrid of positional and appearance information by 1.6 AP and 0.4 AP, respectively. Furthermore, leveraging the features of candidates in the form of query positional embedding results in the best performance, outperforming addition and concatenation operations by 0.4 AP and 0.2 AP, respectively. + +Disappearance dynamic anchor queries. In Tab. 3f, we explore how to initialize the query feature embedding and positional embedding of disappearance DAQ. We find that initializing query feature of disappearance DAQ from the initial queries in the segmenter (as shown in Fig. 3) yields better AP than using a new shared learnable embedding for all disappearance DAQ (37.1 vs. 36.5). For generation of positional embedding of disappearance DAQ, we find utilizing the momentum-weighted appearance feature of tracked objects yield better AP than utilizing the query feature of tracked objects (37.1 vs. 36.8). + +Emergence and disappearance simulation. We employ a threshold to filter out low-scoring tracked objects in emergence simulation. Tab. 3c illustrates the results when using different thresholds. A minimal threshold (0.01) results in insufficient new emergence cases, whereas a larger threshold (0.5) disrupts the model's ability to learn continuous tracking. Both result in poor performance (34.2 AP and 33.2 AP). A similar phenomenon is observed in the disappearance simulation, as shown in Tab. 3d. The simulation of an object's disappearance in a solitary frame within a video clip fails to generate sufficient disappearance + +![](images/ca742f8a59d6331bf8e255f49fd42edfe3a85728e6fdc3e54eeb91587d60099c.jpg) +Fig. 7: Qualitative results comparison for emergence detection and disappearance filtering. The performance enhancements are highlighted by rectangles in various colors, each color representing an individual video object. It's better to view with zooming in $8 \times$ . + +cases. Conversely, simulating the disappearance across all frames compromises the model's capability to learn continuous tracking. Consequently, we have determined that a threshold of 0.1 strikes an optimal balance for simulating emergence, and we opt for a stochastic selection of frames in a video clip to simulate disappearance. This strategy ensures ample emergence and disappearance cases while preserving the model's tracking capability for continually appearing objects. + +Qualitative results comparison. In Fig. 7, we present the visual comparison with our baseline. In this challenging scene, there are new-emerging, disappearing, and reappearing video objects. Our method accurately addresses all these scenarios, whereas DVIS suffers from issues including missed new-emerging objects and ID switches. + +# 5 Conclusion + +We observed that current SOTA query-based video segmentation methods perform poorly on newly emerging and disappearing objects. We have analyzed and identified the significant transition gap hindering the network's learning. We address this challenge by proposing dynamic anchor queries for shortening the transition gap. We also introduce a query-level simulation strategy for simulating object disappearance and emergence without additional costs. By integrating our proposed dynamic anchor queries and simulation strategy into DVIS, we obtained DVIS-DAQ, which achieved SOTA performance on mainstream video segmentation benchmarks. Our research will inspire the video community to bridge the gap between current advancements in the standard benchmarks and real-world application requirements. + +# References + +1. Athar, A., Hermans, A., Luiten, J., Ramanan, D., Leibe, B.: Tarvis: A unified approach for target-based video segmentation. In: CVPR (2023) +2. Athar, A., Mahadevan, S., Osep, A., Leal-Taixe, L., Leibe, B.: Stem-seg: Spatiotemporal embeddings for instance segmentation in videos. In: ECCV (2020) +3. Bekuzarov, M., Bermudez, A., Lee, J.Y., Li, H.: Xmem++: Production-level video segmentation from few annotated frames (2023) +4. Bertasius, G., Torresani, L.: Classifying, segmenting, and tracking object instances in video with mask propagation (2022) +5. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021) +6. Bewley, A., Ge, Z., Ott, L., Ramos, F., Upcroft, B.: Simple online and realtime tracking. In: ICIP (2016) +7. Caelles, S., Maninis, K., Pont-Tuset, J., Leal-Taixe, L., Cremers, D., Van Gool, L.: One-shot video object segmentation. In: CVPR (2017) +8. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV (2020) +9. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. arXiv preprint arXiv:2205.08534 (2022) +0. Cheng, B., Choudhuri, A., Misra, I., Kirillov, A., Girdhar, R., Schwing, A.G.: Mask2former for video instance segmentation. arXiv preprint arXiv:2112.10764 (2021) +1. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: CVPR (2022) +2. Cheng, B., Schwing, A., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation. NeurIPS (2021) +3. Cheng, H.K., Oh, S.W., Price, B., Schwing, A., Lee, J.Y.: Tracking anything with decoupled video segmentation. In: ICCV (2023) +4. Cheng, H.K., Tai, Y.W., Tang, C.K.: Rethinking space-time networks with improved memory coverage for efficient video object segmentation. In: NeurIPS (2021) +5. Ding, H., Liu, C., He, S., Jiang, X., Torr, P.H., Bai, S.: MOSE: A new dataset for video object segmentation in complex scenes. In: ICCV (2023) +6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. ICLR (2021) +7. Gao, R., Wang, L.: MeMOTR: Long-term memory-augmented transformer for multi-object tracking. In: ICCV (2023) +8. Hannan, T., Koner, R., Bernhard, M., Shit, S., Menze, B., Tresp, V., Schubert, M., Seidl, T.: Gratt-vis: Gated residual attention for auto rectifying video instance segmentation. arXiv preprint arXiv:2305.17096 (2023) +9. He, J., Yu, Q., Shin, I., Deng, X., Shen, X., Yuille, A., Chen, L.C.: Maxtron: Mask transformer with trajectory attention for video panoptic segmentation (2023) +20. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR (2016) +21. Heo, M., Hwang, S., Hyun, J., Kim, H., Oh, S.W., Lee, J.Y., Kim, S.J.: A generalized framework for video instance segmentation. In: CVPR (2023) +22. Heo, M., Hwang, S., Oh, S.W., Lee, J.Y., Kim, S.J.: Vita: Video instance segmentation via object token association. NIPS (2022) + +23. Huang, D.A., Yu, Z., Anandkumar, A.: Minvis: A minimal video instance segmentation framework without video-based training. NeurIPS (2022) +24. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020) +25. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020) +26. Kim, D., Xie, J., Wang, H., Qiao, S., Yu, Q., Kim, H.S., Adam, H., Kweon, I.S., Chen, L.C.: Tubeformer-deeplab: Video mask transformer. In: CVPR (2022) +27. Leal-Taixe, L., Canton-Ferrer, C., Schindler, K.: Learning by tracking: Siamese cnn for robust target association. In: CVPR Workshops (2016) +28. Li, J., Yu, B., Rao, Y., Zhou, J., Lu, J.: Tcovis: Temporally consistent online video instance segmentation. In: ICCV (2023) +29. Li, M., Li, S., Zhang, X., Zhang, L.: Univs: Unified and universal video segmentation with prompts as queries (2024) +30. Li, X., Ding, H., Zhang, W., Yuan, H., Cheng, G., Jiangmiao, P., Chen, K., Liu, Z., Loy, C.C.: Transformer-based visual segmentation: A survey. arXiv pre-print (2023) +31. Li, X., Xu, S., Cheng, Y.Y., Tong, Y., Tao, D., et al.: Panoptic-partformer: Learning a unified model for panoptic part segmentation. ECCV (2022) +32. Li, X., Yuan, H., Li, W., Ding, H., Wu, S., Zhang, W., Li, Y., Chen, K., Loy, C.C.: Omg-seg: Is one model good enough for all segmentation? CVPR (2024) +33. Li, X., Yuan, H., Zhang, W., Cheng, G., Pang, J., Loy, C.C.: Tube-link: A flexible cross tube framework for universal video segmentation. In: ICCV (2023) +34. Li, X., Zhang, W., Pang, J., Chen, K., Cheng, G., Tong, Y., Loy, C.C.: Video k-net: A simple, strong, and unified baseline for video segmentation. In: CVPR (2022) +35. Lin, C.C., Hung, Y., Feris, R., He, L.: Video instance segmentation tracking with a modified vae architecture. In: CVPR (2020) +36. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV (2021) +37. Meinhardt, T., Feiszli, M., Fan, Y., Leal-Taixe, L., Ranjan, R.: Novis: A case for end-to-end near-online video instance segmentation. arXiv preprint arXiv:2308.15266 (2023) +38. Meinhardt, T., Kirillov, A., Leal-Taixe, L., Feichtenhofer, C.: Trackformer: Multi-object tracking with transformers. In: CVPR (2022) +39. Miao, J., Wang, X., Wu, Y., Li, W., Zhang, X., Wei, Y., Yang, Y.: Large-scale video panoptic segmentation in the wild: A benchmark. In: CVPR (2022) +40. Miao, J., Wei, Y., Wu, Y., Liang, C., Li, G., Yang, Y.: Vspw: A large-scale dataset for video scene parsing in the wild. In: CVPR (2021) +41. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023) +42. Pang, J., Qiu, L., Li, X., Chen, H., Li, Q., Darrell, T., Yu, F.: Quasi-dense similarity learning for multiple object tracking. In: CVPR (2021) +43. Pang, Z., Li, Z., Wang, N.: Simpletrack: Understanding and rethinking 3d multi-object tracking. arXiv preprint arXiv:2111.09621 (2021) +44. Park, K., Woo, S., Oh, S.W., Kweon, I.S., Lee, J.Y.: Per-clip video object segmentation. In: CVPR (2022) +45. Patrick, M., Campbell, D., Asano, Y.M., Metze, I.M.F., Feichtenhofer, C., Vedaldi, A., Henriques, J.F.: Keeping your eye on the ball: Trajectory attention in video transformers. In: NeurIPS (2021) + +46. Porzi, L., Hofinger, M., Ruiz, I., Serrat, J., Bulo, S.R., Kontschieder, P.: Learning multi-object tracking and segmentation from automatic annotations. In: CVPR (2020) +47. Qi, J., Gao, Y., Hu, Y., Wang, X., Liu, X., Bai, X., Belongie, S., Yuille, A., Torr, P.H., Bai, S.: Occluded video instance segmentation: A benchmark. IJCV (2022) +48. Qiao, S., Zhu, Y., Adam, H., Yuille, A., Chen, L.C.: Vip-deeplab: Learning visual perception with depth-aware video panoptic segmentation. In: CVPR (2021) +49. Sanghyun, W., Kwanyong, P., Seoung, W.O., In, S.K., Joon-Young, L.: Tracking by associating clips. In: ECCV (2022) +50. Seong, H., Oh, S.W., Lee, J.Y., Lee, S., Lee, S., Kim, E.: Hierarchical memory matching network for video object segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021) +51. Sun, P., Cao, J., Jiang, Y., Yuan, Z., Bai, S., Kitani, K., Luo, P.: Dancetrack: Multi-object tracking in uniform appearance and diverse motion. arXiv preprint arXiv:2111.14690 (2021) +52. Sun, P., Cao, J., Jiang, Y., Zhang, R., Xie, E., Yuan, Z., Wang, C., Luo, P.: Transtrack: Multiple-object tracking with transformer. arXiv preprint arXiv: 2012.15460 (2020) +53. Tsai, Y.J., Liu, Y.L., Qi, L., Chan, K.C., Yang, M.H.: Dual associated encoder for face restoration. arXiv preprint arXiv:2308.07314 (2023) +54. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: CVPR (2023) +55. Wang, Y., Xu, Z., Wang, X., Shen, C., Cheng, B., Shen, H., Xia, H.: End-to-end video instance segmentation with transformers. In: CVPR (2021) +56. Weber, M., Xie, J., Collins, M., Zhu, Y., Voigtlaender, P., Adam, H., Green, B., Geiger, A., Leibe, B., Cremers, D., et al.: Step: Segmenting and tracking every pixel. arXiv preprint arXiv:2102.11859 (2021) +57. Weng, Y., Han, M., He, H., Li, M., Yao, L., Chang, X., Zhuang, B.: Mask propagation for efficient video semantic segmentation. arXiv preprint arXiv:2310.18954 (2023) +58. Wu, J., Cao, J., Song, L., Wang, Y., Yang, M., Yuan, J.: Track to detect and segment: An online multi-object tracker. In: CVPR (2021) +59. Wu, J., Li, X., Xu, S., Yuan, H., Ding, H., Yang, Y., Li, X., Zhang, J., Tong, Y., Jiang, X., Ghanem, B., Tao, D.: Towards open vocabulary learning: A survey. T-PAMI (2024) +60. Wu, J., Jiang, Y., Bai, S., Zhang, W., Bai, X.: Seqformer: Sequential transformer for video instance segmentation. In: ECCV (2022) +61. Wu, J., Liu, Q., Jiang, Y., Bai, S., Yuille, A., Bai, X.: In defense of online models for video instance segmentation. In: ECCV (2022) +62. Xu, J., Cao, Y., Zhang, Z., Hu, H.: Spatial-temporal relation networks for multi-object tracking. In: ICCV (2019) +63. Xu, S., Li, X., Wang, J., Cheng, G., Tong, Y., Tao, D.: Fashionformer: A simple, effective and unified baseline for human fashion segmentation and recognition. In: ECCV (2022) +64. Xu, S., Yuan, H., Shi, Q., Qi, L., Wang, J., Yang, Y., Li, Y., Chen, K., Tong, Y., Ghanem, B., Li, X., Yang, M.H.: Rap-sam:towards real-time all-purpose segment anything. arXiv preprint (2024) +65. Yan, B., Jiang, Y., Sun, P., Wang, D., Yuan, Z., Luo, P., Lu, H.: Towards grand unification of object tracking. In: ECCV (2022) +66. Yan, B., Jiang, Y., Wu, J., Wang, D., Luo, P., Yuan, Z., Lu, H.: Universal instance perception as object discovery and retrieval. In: CVPR (2023) + +67. Yang, J., Peng, W., Li, X., Guo, Z., Chen, L., Li, B., Ma, Z., Zhou, K., Zhang, W., Loy, C.C., et al.: Panoptic video scene graph generation. In: CVPR (2023) +68. Yang, L., Fan, Y., Xu, N.: Video instance segmentation. In: ICCV (2019) +69. Yang, S., Fang, Y., Wang, X., Li, Y., Fang, C., Shan, Y., Feng, B., Liu, W.: Crossover learning for fast online video instance segmentation. In: ICCV (2021) +70. Ying, K., Zhong, Q., Mao, W., Wang, Z., Chen, H., Wu, L.Y., Liu, Y., Fan, C., Zhuge, Y., Shen, C.: C'tvis: Consistent training for online video instance segmentation. In: ICCV (2023) +71. Yu, F., Chen, H., Wang, X., Xian, W., Chen, Y., Liu, F., Madhavan, V., Darrell, T.: Bdd100k: A diverse driving dataset for heterogeneous multitask learning. In: CVPR (2020) +72. Zeng, F., Dong, B., Zhang, Y., Wang, T., Zhang, X., Wei, Y.: Motr: End-to-end multiple-object tracking with transformer. In: ECCV (2022) +73. Zhang, T., Tian, X., Wu, Y., Ji, S., Wang, X., Zhang, Y., Wan, P.: Dvis: Decoupled video instance segmentation framework. In: ICCV (2023) +74. Zhang, T., Tian, X., Zhou, Y., Ji, S., Wang, X., Tao, X., Zhang, Y., Wan, P., Wang, Z., Wu, Y.: Dvis++: Improved decoupled framework for universal video segmentation. arXiv preprint arXiv:2312.13305 (2023) +75. Zhang, W., Pang, J., Chen, K., Loy, C.C.: K-net: Towards unified image segmentation. NIPS (2021) +76. Zhang, Y., Sun, P., Jiang, Y., Yu, D., Weng, F., Yuan, Z., Luo, P., Liu, W., Wang, X.: Bytetrack: Multi-object tracking by associating every detection box. ECCV (2022) +77. Zhou, Q., Li, X., He, L., Yang, Y., Cheng, G., Tong, Y., Ma, L., Tao, D.: Transvod: end-to-end video object detection with spatial-temporal transformers. T-PAMI (2022) +78. Zhou, Y., Zhang, H., Lee, H., Sun, S., Li, P., Zhu, Y., Yoo, B., Qi, X., Han, J.J.: Slot-vps: Object-centric representation learning for video panoptic segmentation. In: CVPR (2022) +79. Zhu, J., Yang, H., Liu, N., Kim, M., Zhang, W., Yang, M.H.: Online multi-object tracking with dual matching attention networks. In: ECCV (2018) +80. Zhu, X., Xiong, Y., Dai, J., Yuan, L., Wei, Y.: Deep feature flow for video recognition. CVPR (2016) \ No newline at end of file diff --git a/2024/Improving Video Segmentation via Dynamic Anchor Queries/images.zip b/2024/Improving Video Segmentation via Dynamic Anchor Queries/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..6416ba9e3bac21f1e122b371e66860d4ce43a7a3 --- /dev/null +++ b/2024/Improving Video Segmentation via Dynamic Anchor Queries/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ed53d8aa3ce60743e3b96865d271e4728b533aa02352a89ce06457123b5abdbf +size 608142 diff --git a/2024/Improving Video Segmentation via Dynamic Anchor Queries/layout.json b/2024/Improving Video Segmentation via Dynamic Anchor Queries/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..2d1a16c9eb7e5d3df1872ab2da56bab5f36d779a --- /dev/null +++ b/2024/Improving Video Segmentation via Dynamic Anchor Queries/layout.json @@ -0,0 +1,9897 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "spans": [ + { + "bbox": [ + 152, + 111, + 462, + 148 + ], + "type": "text", + "content": "Improving Video Segmentation via Dynamic Anchor Queries" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "spans": [ + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "text", + "content": "Yikang Zhou" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "text", + "content": ", Tao Zhang" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "inline_equation", + "content": "^{1,2}" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "text", + "content": ", Shumping Ji" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "text", + "content": ", Shuicheng Yan" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "text", + "content": ", and Xiangtai Li" + }, + { + "bbox": [ + 193, + 168, + 421, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 265, + 202, + 349, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 265, + 202, + 349, + 213 + ], + "spans": [ + { + "bbox": [ + 265, + 202, + 349, + 213 + ], + "type": "text", + "content": "1 Wuhan University" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 277, + 213, + 335, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 277, + 213, + 335, + 224 + ], + "spans": [ + { + "bbox": [ + 277, + 213, + 335, + 224 + ], + "type": "text", + "content": "2 Skywork AI" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 225, + 454, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 225, + 454, + 236 + ], + "spans": [ + { + "bbox": [ + 159, + 225, + 454, + 236 + ], + "type": "text", + "content": "zhang_tao@whu.edu.cn, zhouyik@whu.edu.cn, xiangtai94@gmail.com" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 162, + 236, + 452, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 236, + 452, + 247 + ], + "spans": [ + { + "bbox": [ + 162, + 236, + 452, + 247 + ], + "type": "text", + "content": "Project page: https://zhang-tao-whu.github.io/projects/DVIS_DAQ" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 281, + 455, + 478 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 281, + 455, + 478 + ], + "spans": [ + { + "bbox": [ + 159, + 281, + 455, + 478 + ], + "type": "text", + "content": "Abstract. Modern video segmentation methods adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects. However, the emergence and disappearance of objects interrupt the smooth feature transition, and even widen this feature transition gap between anchor and target queries, which causes these methods to all underperform on newly emerging and disappearing objects that are common in the real world. We introduce Dynamic Anchor Queries (DAQ) to shorten the transition gap by dynamically generating anchor queries based on the features of potential newly emerging and disappearing candidates. Furthermore, we introduce a query-level object Emergence and Disappearance Simulation (EDS) strategy, which unleashes DAQ's potential without any additional cost. Finally, we combine our proposed DAQ and EDS with the previous method, DVIS, to obtain DVIS-DAQ. Extensive experiments demonstrate that DVIS-DAQ achieves a new state-of-the-art (SOTA) performance on five mainstream video segmentation benchmarks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 489, + 453, + 511 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 489, + 453, + 511 + ], + "spans": [ + { + "bbox": [ + 159, + 489, + 453, + 511 + ], + "type": "text", + "content": "Keywords: Video segmentation " + }, + { + "bbox": [ + 159, + 489, + 453, + 511 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 489, + 453, + 511 + ], + "type": "text", + "content": " Dynamic anchor design " + }, + { + "bbox": [ + 159, + 489, + 453, + 511 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 489, + 453, + 511 + ], + "type": "text", + "content": " Universal segmentation" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 534, + 230, + 547 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 230, + 547 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 230, + 547 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 562, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 562, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 562, + 482, + 635 + ], + "type": "text", + "content": "Video segmentation aims at simultaneously identifying, segmenting, and tracking all objects of interest within a video [24, 47, 67, 68], which has many applications, including autonomous driving, video editing, content analysis, and video understanding [5, 45]. Modern video segmentation methods [18, 21, 23, 28, 33, 61, 70, 73, 74] adopt feature transitions between anchor and target queries to perform cross-frame object association. The smooth feature transitions between anchor" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 643, + 482, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 643, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 643, + 482, + 666 + ], + "type": "text", + "content": "* The first two authors contribute equally. This work was performed when Tao Zhang was an Intern at Skywork AI. Corresponding authors: Shunping Ji and Xiangtai Li." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 114, + 256, + 214 + ], + "blocks": [ + { + "bbox": [ + 137, + 114, + 256, + 214 + ], + "lines": [ + { + "bbox": [ + 137, + 114, + 256, + 214 + ], + "spans": [ + { + "bbox": [ + 137, + 114, + 256, + 214 + ], + "type": "image", + "image_path": "3267843f58267bec669762b378d9bad1e9ba9f6fd458f74a24f2350a2a7f492e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 223, + 482, + 322 + ], + "lines": [ + { + "bbox": [ + 130, + 223, + 482, + 322 + ], + "spans": [ + { + "bbox": [ + 130, + 223, + 482, + 322 + ], + "type": "text", + "content": "Fig. 1: The preliminary experiments and our results. We analyze current query-based video segmentation methods' capabilities in handling objects' emergence and disappearance within videos. The scatter plot on the left illustrates the recall ratios for newly emerging and disappearing video objects on a subset of the BDD [71] dataset. The visual comparison is presented in the middle. The top two rows output from DVIS [73] and GenVIS [21], respectively. And the bottom row output from our method. The poor performance of previous methods on new emergence detection and disappearance filtering is highlighted by a red circle. On the right side, our method outperforms the current SOTA on mainstream video segmentation datasets." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 261, + 114, + 356, + 212 + ], + "blocks": [ + { + "bbox": [ + 261, + 114, + 356, + 212 + ], + "lines": [ + { + "bbox": [ + 261, + 114, + 356, + 212 + ], + "spans": [ + { + "bbox": [ + 261, + 114, + 356, + 212 + ], + "type": "image", + "image_path": "77e09471c7b28231bf3f73b1ad94b0048deafcfe253f4cf4bcc7fcbf25f1965e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 356, + 114, + 477, + 213 + ], + "blocks": [ + { + "bbox": [ + 356, + 114, + 477, + 213 + ], + "lines": [ + { + "bbox": [ + 356, + 114, + 477, + 213 + ], + "spans": [ + { + "bbox": [ + 356, + 114, + 477, + 213 + ], + "type": "image", + "image_path": "6ddd6e1a3f54573033103a600761a35de81e594de222fb729ac4bdb5962c0472.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 349, + 480, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 349, + 480, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 349, + 480, + 373 + ], + "type": "text", + "content": "and target queries enable these methods to achieve satisfactory performance when tracking continuously appearing objects." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 375, + 482, + 459 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 375, + 482, + 459 + ], + "spans": [ + { + "bbox": [ + 130, + 375, + 482, + 459 + ], + "type": "text", + "content": "However, these query-based methods exhibit a notable limitation: they tend to underperform when dealing with newly emerging or disappearing objects, even with recent state-of-the-art (SOTA) methods [21, 73]. As shown in the left part of Fig. 1, these methods only achieve less than " + }, + { + "bbox": [ + 130, + 375, + 482, + 459 + ], + "type": "inline_equation", + "content": "45\\%" + }, + { + "bbox": [ + 130, + 375, + 482, + 459 + ], + "type": "text", + "content": " recall ratio on emerging and disappearing objects. As illustrated in the middle part of Fig. 1, they often fail to detect newly emerging objects. And they may incorrectly track a different, similar object when the original object disappears." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 460, + 482, + 592 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 592 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 592 + ], + "type": "text", + "content": "A natural question arises: \"What causes the huge performance gap between continuously appearing objects and emerging/disappearing objects?\" We argue the answer lies in the unreasonable anchor queries for newly emerged and disappeared objects used in current methods. As shown in Fig. 2, in the SOTA query-based methods [21, 23, 73, 74], the anchor query for a newly emerged object is a background query, and the target is the feature representation of the object. In contrast, the anchor query for a disappeared object is the feature representation of the object before it disappeared, and the target is a background feature. A significant feature transition gap between background and foreground queries poses considerable challenges for retaining the smooth feature transition between anchor and target queries." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "In this paper, we address this challenge by introducing Dynamic Anchor Queries (DAQ) mechanism to detect the emergence and disappearance of objects. As illustrated on the right side of Fig. 2, we regard all objects segmented in the current frame as potential candidates for newly emerging objects. We dynamically generate emergence anchor queries based on the features of these candidates to reduce the transition gap significantly. On the other hand, we des" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 113, + 478, + 227 + ], + "blocks": [ + { + "bbox": [ + 136, + 113, + 478, + 227 + ], + "lines": [ + { + "bbox": [ + 136, + 113, + 478, + 227 + ], + "spans": [ + { + "bbox": [ + 136, + 113, + 478, + 227 + ], + "type": "image", + "image_path": "c11ab16cb7e92e388239eaced80848f59b22347eef4e5cf76fe245051b44ff23.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 236, + 480, + 291 + ], + "lines": [ + { + "bbox": [ + 130, + 236, + 480, + 291 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 480, + 291 + ], + "type": "text", + "content": "Fig.2: The process of handling newly emerging and disappearing objects in different methods. Unlike previous approaches that treat appearing, disappearing, and tracked objects equally, our method dynamically generates anchor queries for emergence and disappearance based on candidate objects' features to effectively shorten the transition gap." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 312, + 480, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 312, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 480, + 418 + ], + "type": "text", + "content": "ignate all tracked objects as candidates for disappearing objects and generate disappearance anchor queries dynamically using their features. These emergence and disappearance anchor queries and the representations of tracked objects are collectively inputted into the tracker to identify the objects of interest in the current frame. Objects identified by the emergence anchor queries are classified as newly appeared, while those pinpointed by the disappearance anchor queries are recognized as having disappeared, prompting their removal. The remaining queries are responsible for tracking objects present across both past and current frames." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 420, + 481, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 420, + 481, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 420, + 481, + 552 + ], + "type": "text", + "content": "The proposed DAQ mechanism enhances the network's ability to handle the emergence and disappearance of objects. To further leverage the capabilities of DAQ, we propose a training time simulation strategy for the emergence and disappearance of objects, termed Emergence and Disappearance Simulation (EDS). This strategy simulates emergence and disappearance events by removing high-level object queries. We mimic object emergence by randomly eliminating some object queries propagated from the previous frame. Likewise, we simulate object disappearance by removing some of the current frame's object queries. Our simple yet effective simulation strategy generates numerous instances of object emergence and disappearance during training, thereby enabling comprehensive training of the DAQ mechanism and maximizing its potential." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 552, + 481, + 600 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 552, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 130, + 552, + 481, + 600 + ], + "type": "text", + "content": "To verify the effectiveness of our proposed DAQ mechanism and EDS strategy, we integrate them into the current SOTA method, DVIS [73], to construct the DVIS-DAQ. As shown in the right part of Fig. 1, the DVIS-DAQ achieves new SOTA performance on five mainstream video segmentation benchmarks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 146, + 601, + 372, + 611 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 601, + 372, + 611 + ], + "spans": [ + { + "bbox": [ + 146, + 601, + 372, + 611 + ], + "type": "text", + "content": "In summary, our main contributions are as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 136, + 617, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 617, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 136, + 617, + 481, + 665 + ], + "type": "text", + "content": "1. We have found that current query-based methods fall short in managing objects' emergence and disappearance due to the considerable transition gap between foreground and background queries. We propose a Dynamic Anchor Queries (DAQ) mechanism to address this challenge. The DAQ mechanism" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 400, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 400, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 400, + 91, + 447, + 102 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 148, + 116, + 480, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 148, + 116, + 480, + 140 + ], + "spans": [ + { + "bbox": [ + 148, + 116, + 480, + 140 + ], + "type": "text", + "content": "dynamically generates anchor queries for objects' emergence and disappearance, thereby shortening the gap and effectively overcoming the challenge." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 136, + 140, + 479, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 140, + 479, + 187 + ], + "spans": [ + { + "bbox": [ + 136, + 140, + 479, + 187 + ], + "type": "text", + "content": "2. To further unleash the potential of the DAQ mechanism, we introduce the Emergence and Disappearance Simulation (EDS) strategy. This straightforward and efficient approach amplifies the number of emergence and disappearance cases, thereby ensuring comprehensive training of the DAQ." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 136, + 189, + 480, + 247 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 189, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 136, + 189, + 480, + 247 + ], + "type": "text", + "content": "3. We enhance the SOTA video segmentation method DVIS by integrating our proposed DAQ mechanism and EDS strategy, resulting in DVIS-DAQ. With extensive experiments on five video segmentation benchmarks, DVIS-DAQ achieves new SOTA performance on all benchmarks. We further present detailed ablation studies to verify the effectiveness of each component." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 268, + 237, + 280 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 268, + 237, + 280 + ], + "spans": [ + { + "bbox": [ + 133, + 268, + 237, + 280 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 294, + 481, + 556 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 294, + 481, + 556 + ], + "spans": [ + { + "bbox": [ + 133, + 294, + 481, + 556 + ], + "type": "text", + "content": "Video Instance Segmentation (VIS). Earlier works [35, 68, 69] extend image instance segmentation methods by adding tracking heads and learning the feature association. With the rise of vision transformer [8, 16, 55], current SOTA video instance methods [10, 18, 22, 23, 28, 33, 37, 55, 60, 61, 70] adopt query-based designs. In particular, Video K-Net [34] and IDOL [61] directly learn the query association embeddings via contrastive learning. After that, association-based methods [23, 33, 37, 61, 68, 70], accomplish the tracking of video targets between adjacent frames or adjacent video clips through object matching. Meanwhile, several models [10, 22, 60] directly predict 3D volumes of video instances across times in a semi-online manner. On the other hand, propagation-based methods [18, 21, 28, 73] delegate the tracking problem to the transformer decoder. They take the object queries outputted from the previous frame or video clip as input and iteratively optimize them to segment the objects in the current frame. Inspired by the design of the dual encoder in the low-level area [53] and multi-task learning [31, 63], several works have also decoupled the tracking decoder and segmentation decoder. Note that these methods can also be applied for video panoptic segmentation (VPS) and video semantic segmentation (VSS) tasks [24, 39, 40, 48, 56, 80] by adding queries for segmenting the stuff. However, both poorly handle challenges such as new-emerging objects and target disappearance. Our approach improves the model's ability to address these challenges by employing dynamic anchor queries to manage the emergence and disappearance of objects." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 558, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 558, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 558, + 481, + 665 + ], + "type": "text", + "content": "Universal Video Segmentation. Current efforts in the field of video segmentation directly draw upon the design of universal image segmentation models [10, 12, 13, 54, 57, 66, 75] to develop universal video segmentation models [1, 26, 30, 33, 34, 59, 73], achieving comparable or even superior performance to specialized video segmentation methods. Video K-Net [34] and TubeFormer [26] are the first to unify all three video segmentation tasks. TarVIS [1] extends the concept of mask classification from image segmentation to video segmentation, accomplishing universal video segmentation via one shared model. DVIS [73] receives frame object query outputs from Mask2Former [10] for universal video" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "segmentation. Recently, several works [32, 64] unified both image and video segmentation in one model. However, these methods are still unaware of object emergence and disappearance problems, which are significant for long videos." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 482, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 482, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 482, + 260 + ], + "type": "text", + "content": "Video Object Tracking. Object tracking [3,7,14,17,42,43,50,51,65,72,76,77] is a crucial task in VIS and VPS [4, 19, 24, 25, 29, 78], and many works adopt the tracking-by-detection paradigm [6, 27, 38, 46, 52, 58, 62, 79]. These methods divide the task into two sub-tasks, where an object detector first detects objects and then associates them using a tracking algorithm. Recent works [2, 15, 44, 49] also perform clip-wise segmentation and tracking. However, the former [15, 44] only focuses on single-object mask tracking, while the latter [49] considers global tracking via clip-level matching. Our work belongs to mask-based tracking, which is orthogonal to these existing tracking methods." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 278, + 202, + 291 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 278, + 202, + 291 + ], + "spans": [ + { + "bbox": [ + 132, + 278, + 202, + 291 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 304, + 221, + 316 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 221, + 316 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 221, + 316 + ], + "type": "text", + "content": "3.1 Preliminary" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 323, + 485, + 372 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 485, + 372 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 485, + 372 + ], + "type": "text", + "content": "Query-based Video Segmentation Formulations. Modern mainstream video segmentation methods [21,33,61,73,74] rely on queries to represent objects and achieve cross-frame association of objects. Here, we summarize current query-based video segmentation methods with the following formulation:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 175, + 380, + 481, + 396 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 380, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 175, + 380, + 481, + 396 + ], + "type": "interline_equation", + "content": "Q _ {S e g} ^ {T} = \\mathcal {S} (\\mathcal {I} ^ {T}), \\quad Q ^ {T} = \\mathcal {A} (Q ^ {T - 1}, Q _ {S e g} ^ {T}), \\quad \\mathcal {M} ^ {T}, \\mathcal {C} ^ {T} = \\mathcal {D} (Q ^ {T}). \\qquad (1)", + "image_path": "836da58df925de3b5cfc310d0ad994db0f03bba942aa2fbbf5c2583fbf8b3677.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": "First, a segmenter " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{S}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " extracts query representations of objects " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "Q_{Seg}^{T}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " from a single-frame image. Then, an association component " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " establishes connections between the current frame's object representations " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "Q_{Seg}^{T}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "Q^{T-1}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " to obtain associated object representations " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "Q^{T}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": ". Finally, the object representations " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "Q^{T}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " are decoded to obtain predictions of object categories " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{C}^{T}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " and segmentation masks " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{M}^{T}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " for the current frame. In this pipeline, the association component " + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 404, + 482, + 501 + ], + "type": "text", + "content": " is the most critical and challenging part. Most video segmentation methods focus on designing more efficient association modules." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "spans": [ + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "text", + "content": "The current mainstream association modules " + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "text", + "content": " can be divided into association-based [23,33,61,70] and propagation-based [21,73,74] pipelines. They both model object emergence as a transition from background queries to foreground queries and model disappearance as a transition from foreground queries to background queries. Specifically, we can split " + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "inline_equation", + "content": "Q" + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "text", + "content": " into " + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "inline_equation", + "content": "Q_{Fg}" + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "inline_equation", + "content": "Q_{Bg}" + }, + { + "bbox": [ + 130, + 502, + 487, + 586 + ], + "type": "text", + "content": ", and the tracking of continuously appearing objects, newly emerging objects, and disappearing objects can be described as follows:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 162, + 594, + 481, + 610 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 594, + 481, + 610 + ], + "spans": [ + { + "bbox": [ + 162, + 594, + 481, + 610 + ], + "type": "interline_equation", + "content": "C o n t: Q _ {F g} ^ {T - 1} \\rightarrow Q _ {F g} ^ {T}, E m g: Q _ {B g} ^ {T - 1} \\rightarrow Q _ {F g} ^ {T}, D i s: Q _ {F g} ^ {T - 1} \\rightarrow Q _ {B g} ^ {T} (2)", + "image_path": "69ea512cba2009033593d1a41aff4562d2a497b9918a816484d3943feaf6634f.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Limitations of the Query-based Methods. We find that current query-based methods [21, 23, 73] perform poorly on objects that emerge and disappear in the middle of a video, as shown in Fig. 1. For emerging objects, SOTA methods often miss detecting them. For disappearing objects, SOTA methods frequently" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "text", + "content": "fail to recognize that the object has disappeared and may incorrectly segment another object. We quantitatively analyzed the recall ratios of emerging and disappearing objects in preliminary experiments using several SOTA methods. We found that the recall ratios of emerging and disappearing objects are very low (below " + }, + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "inline_equation", + "content": "45\\%" + }, + { + "bbox": [ + 130, + 116, + 479, + 174 + ], + "type": "text", + "content": ") for these methods, as shown in Fig. 1." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 175, + 480, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 175, + 480, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 175, + 480, + 390 + ], + "type": "text", + "content": "Thorough Analysis and Our Motivation. The same process for handling continuously appearing, emerging, and disappearing objects results in the performance difference of modern query based methods: they have demonstrated satisfactory performance on consistently appearing objects (exceeding 60 AP on the YouTube-VIS [68]), but they exhibit poor performance on newly emerging and disappearing objects. As depicted in Fig. 2 and Eq. 2, in current query-based methods, there should be a significant disparity in the modeling formulation between newly emerging or disappearing objects and consistently appearing objects. The former poses more challenges because of the significant feature gap in the transition between foreground and background queries. In this work, we generate dynamic anchor queries for newly emerging and disappearing objects, resulting in a lower feature transition gap than using the background or foreground query. We term the background or foreground query used in previous methods as Static Anchor Query (SAQ), the query of continuously appearing objects as Continuously Tracked Query (CTQ), and our proposed dynamically generated anchor query as Dynamic Anchor Query (DAQ). We use our proposed DAQ to replace the SAQ to address the challenge above. The details of the DAQ will be introduced in Sec. 3.2." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 391, + 480, + 451 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 391, + 480, + 451 + ], + "spans": [ + { + "bbox": [ + 130, + 391, + 480, + 451 + ], + "type": "text", + "content": "Furthermore, we observed that only less than " + }, + { + "bbox": [ + 130, + 391, + 480, + 451 + ], + "type": "inline_equation", + "content": "20\\%" + }, + { + "bbox": [ + 130, + 391, + 480, + 451 + ], + "type": "text", + "content": " of samples contain object emergence and disappearance in the existing datasets [39, 47, 68], including the most challenging OVIS [47] dataset. Therefore, to fully unleash the potential of our proposed DAQ, we introduce a simple yet effective query-level object emergence and disappearance simulation strategy, which will be detailed in Sec. 3.3." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 468, + 288, + 480 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 468, + 288, + 480 + ], + "spans": [ + { + "bbox": [ + 131, + 468, + 288, + 480 + ], + "type": "text", + "content": "3.2 Dynamic Anchor Queries" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 486, + 479, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 479, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 479, + 544 + ], + "type": "text", + "content": "The key idea of DAQ is to dynamically generate anchor queries using the features of candidate objects that may emerge or disappear, thereby reducing the gap between anchor queries and the target queries for possible newly emerging or disappearing objects. DAQ allows the network to easily transform anchor queries to target queries and effectively handle object emergence and disappearance." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 546, + 479, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 479, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 479, + 604 + ], + "type": "text", + "content": "In this subsection, we introduce how to design and utilize Dynamic Anchor Queries (DAQ) to address the challenges mentioned above. First, we explain how the DAQ for newly emerging and disappearing objects are generated. Then, we explore how to make minor adjustments to the current query-based tracker to accommodate our proposed DAQ." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "text", + "content": "Dynamic Anchor Queries for Emergence. When processing the " + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "inline_equation", + "content": "\\mathrm{T}^{th}" + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "text", + "content": " frame of a video, we consider all objects appearing in the current frame as candidates for newly emerging objects. The dynamic anchor queries for emergence " + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}" + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "text", + "content": " are naturally generated based on the features of these candidates. As shown in Fig. 3 (a), " + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}" + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "text", + "content": " consists of two parts: query feature " + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}^{feat}" + }, + { + "bbox": [ + 130, + 605, + 479, + 667 + ], + "type": "text", + "content": " and query" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 341, + 220 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 341, + 220 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 341, + 220 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 341, + 220 + ], + "type": "image", + "image_path": "caffc65a8c6341c092eb5af8300ea5191057755a40c7787d864f3d1db5dd8fc0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "lines": [ + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "text", + "content": "Fig. 3: Generation of dynamic anchor queries. " + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "inline_equation", + "content": "F^T" + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "text", + "content": " represents the image feature of the " + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "inline_equation", + "content": "\\mathrm{T}^{th}" + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "text", + "content": " frame. Symbols " + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "inline_equation", + "content": "Emg" + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "inline_equation", + "content": "Dis" + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "text", + "content": " denote emergence and disappearance. Symbols " + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "inline_equation", + "content": "feat" + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "inline_equation", + "content": "pos" + }, + { + "bbox": [ + 130, + 228, + 480, + 262 + ], + "type": "text", + "content": " indicate feature and positional embedding, respectively." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 342, + 114, + 477, + 220 + ], + "blocks": [ + { + "bbox": [ + 342, + 114, + 477, + 220 + ], + "lines": [ + { + "bbox": [ + 342, + 114, + 477, + 220 + ], + "spans": [ + { + "bbox": [ + 342, + 114, + 477, + 220 + ], + "type": "image", + "image_path": "a950a62622817c45162a8f555a8b86a75807c95e7065df0384244d9b77cfe791.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "spans": [ + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "text", + "content": "positional embedding " + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}^{pos}" + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "text", + "content": ". The query feature " + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}^{feat}" + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "text", + "content": " is a learnable embedding shared by all dynamic anchor queries. The query positional embedding " + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}^{pos}" + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "text", + "content": " is obtained using the appearance features " + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "inline_equation", + "content": "F_{mask}^{T}" + }, + { + "bbox": [ + 131, + 283, + 479, + 331 + ], + "type": "text", + "content": " of the candidates through simple Mask-Pooling:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 217, + 338, + 480, + 353 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 338, + 480, + 353 + ], + "spans": [ + { + "bbox": [ + 217, + 338, + 480, + 353 + ], + "type": "interline_equation", + "content": "F _ {m a s k} ^ {T} = \\operatorname {M L P} \\left(\\operatorname {M a s k P o o l i n g} \\left(F ^ {T}, \\mathcal {M} ^ {T}\\right)\\right), \\tag {3}", + "image_path": "b0336621732085be170b65df378aa37afd5bcb062489b3972dd426283a43cddb.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "spans": [ + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "inline_equation", + "content": "F^T" + }, + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "text", + "content": " represents the image feature of the " + }, + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "inline_equation", + "content": "\\mathrm{T}^{th}" + }, + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "text", + "content": " frame, and " + }, + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "inline_equation", + "content": "\\mathcal{M}^T" + }, + { + "bbox": [ + 130, + 359, + 480, + 383 + ], + "type": "text", + "content": " represents the segmentation masks of the candidates outputted by the segmenter." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "spans": [ + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": "Dynamic Anchor Queries for Disappearance. When processing the " + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "inline_equation", + "content": "\\mathrm{T}^{th}" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": " frame, we consider all currently tracked objects as candidates for disappearing objects. Similar to the dynamic anchor queries for emergence, the DAQ" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "inline_equation", + "content": "_{Dis}" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": " for disappearing objects are naturally generated based on the features of these candidates. As shown in Fig. 3 (b), the DAQ" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "inline_equation", + "content": "_{Dis}" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": " also consists of query feature DAQ" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "inline_equation", + "content": "_{Dis}^{feat}" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": " and query positional embedding DAQ" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "inline_equation", + "content": "_{Dis}^{pos}" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": ". We use the candidates' momentum-weighted appearance features " + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "inline_equation", + "content": "\\overline{F}_{mask}^T" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": " as the query positional embedding DAQ" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "inline_equation", + "content": "_{Dis}^{pos}" + }, + { + "bbox": [ + 130, + 384, + 480, + 483 + ], + "type": "text", + "content": ". The momentum-weighted function follows CTVIS [70]:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 231, + 489, + 480, + 506 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 489, + 480, + 506 + ], + "spans": [ + { + "bbox": [ + 231, + 489, + 480, + 506 + ], + "type": "interline_equation", + "content": "\\bar {F} _ {\\text {m a s k}} ^ {T} = (1 - \\beta) \\bar {F} _ {\\text {m a s k}} ^ {T - 1} + \\beta F _ {\\text {m a s k}} ^ {T} \\tag {4}", + "image_path": "be5ef74d457ea8d0dd6a120b6fdeb3a0634f9960cbc3750f9eaac730da7c9c07.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 210, + 522, + 480, + 555 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 522, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 210, + 522, + 480, + 555 + ], + "type": "interline_equation", + "content": "\\beta = \\max \\left(0, \\frac {1}{T} \\sum_ {t = 1} ^ {T - 1} \\operatorname {c o s i n e} \\left(F _ {\\text {m a s k}} ^ {t}, F _ {\\text {m a s k}} ^ {T}\\right)\\right) \\tag {5}", + "image_path": "40f5094861550b45294c8e3fe7b52f3395493d649bfd8b206945919b21b3174c.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 558, + 479, + 616 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 479, + 616 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 479, + 616 + ], + "type": "text", + "content": "Since the disappearance of an object needs to be modeled as a transition from an anchor query to a background query, to reduce the transition gap, we use the initial queries of segmenter as the query feature " + }, + { + "bbox": [ + 130, + 558, + 479, + 616 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Dis}^{feat}" + }, + { + "bbox": [ + 130, + 558, + 479, + 616 + ], + "type": "text", + "content": ". Specifically, for each query feature, we match the closest one from the initial queries of the segmenter based on cosine similarity." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "content": "Continuously Tracked Queries. We also assign query positional embedding " + }, + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "inline_equation", + "content": "\\mathrm{CTQ}^{pos}" + }, + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "content": " for continuously tracked queries (CTQ) to maintain the format consistency with dynamic anchor queries. We use the momentum-weighted appearance feature of the tracked objects as " + }, + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "inline_equation", + "content": "\\mathrm{CTQ}^{pos}" + }, + { + "bbox": [ + 130, + 617, + 480, + 665 + ], + "type": "text", + "content": ", the same process as Eq. 3, 4, and 5." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 114, + 476, + 206 + ], + "blocks": [ + { + "bbox": [ + 138, + 114, + 476, + 206 + ], + "lines": [ + { + "bbox": [ + 138, + 114, + 476, + 206 + ], + "spans": [ + { + "bbox": [ + 138, + 114, + 476, + 206 + ], + "type": "image", + "image_path": "c665a55a8c4df5c5ac98f2e658e5f5caafdd3b324d2497f23ea48c571861adea.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "lines": [ + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "spans": [ + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "type": "text", + "content": "Fig. 4: Tracker with dynamic anchor queries. " + }, + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "type": "inline_equation", + "content": "Q_{seg}" + }, + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "type": "text", + "content": " represents the query output of segmenter. CTQ and DAQ stand for continuously tracked and dynamic anchor queries, respectively. Symbols " + }, + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "type": "inline_equation", + "content": "Emg" + }, + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "type": "inline_equation", + "content": "Dis" + }, + { + "bbox": [ + 130, + 216, + 482, + 251 + ], + "type": "text", + "content": " denote emergence and disappearance." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "text", + "content": "Incorporating Dynamic Anchor Queries into a Tracker. As depicted in Fig. 4, we can seamlessly integrate DAQ into mainstream propagation-based trackers [21,73], requiring no alterations to the tracker's network architecture. We instantiate two trackers: Tracker 1, which takes CTQ and " + }, + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}" + }, + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "text", + "content": " as inputs and is responsible for tracking continuously appearing and newly emerging objects, and Tracker 2, which receives " + }, + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Dis}" + }, + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "text", + "content": " along with several learnable background embeddings as inputs and identifies disappearing objects in the current frame. It's important to note that the SoftMax function in Tracker 2 operates along the Q-dimension to prevent multiple dynamic anchor queries from segmenting the same object. Through this pipeline, we can effectively and reasonably manage and model the emergence and disappearance of objects. Despite introducing an additional tracker, it's worth highlighting that the computational overhead is minimal, constituting less than " + }, + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "inline_equation", + "content": "2\\%" + }, + { + "bbox": [ + 130, + 271, + 482, + 439 + ], + "type": "text", + "content": " of the overall computational cost [73], as processing occurs solely at the query level rather than on dense image features." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 455, + 372, + 468 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 455, + 372, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 455, + 372, + 468 + ], + "type": "text", + "content": "3.3 Emergence and Disappearance Simulation" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 474, + 482, + 557 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 557 + ], + "type": "text", + "content": "As shown in Fig. 5, when using DAQ, it is possible to simulate object emergence and disappearance separately by removing parts of CTQ and " + }, + { + "bbox": [ + 130, + 474, + 482, + 557 + ], + "type": "inline_equation", + "content": "Q_{Seg}" + }, + { + "bbox": [ + 130, + 474, + 482, + 557 + ], + "type": "text", + "content": ", respectively. We term this simple yet efficient simulation strategy as Emergence and Disappearance Simulation (EDS), which includes Emergence Simulation (ES) and Disappearance Simulation (DS). EDS can simulate numerous object emergence and disappearance cases during training without introducing additional costs, allowing the network to be fully trained and unleashing the potential of DAQ." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 558, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 640 + ], + "type": "text", + "content": "New Emergence Simulation. As shown in Fig. 5 (a), taking the green object as an example, we can simulate it as an emerging object by removing its corresponding query from CTQ. At this point, this green object is not present in CTQ but exists in the current frame, consistent with the state of a real newly emerged object colored in gray. Then, the Tracker needs to transition the corresponding anchor query from " + }, + { + "bbox": [ + 130, + 558, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}" + }, + { + "bbox": [ + 130, + 558, + 482, + 640 + ], + "type": "text", + "content": " to a foreground query and predict this green object's segmentation mask and class." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": "Disappearance Simulation. As shown in Fig. 5 (b), taking the yellow object as an example, by removing its corresponding query from " + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "inline_equation", + "content": "Q_{Seg}" + }, + { + "bbox": [ + 130, + 641, + 482, + 666 + ], + "type": "text", + "content": ", we can simulate" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 230, + 203 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 230, + 203 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 230, + 203 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 230, + 203 + ], + "type": "image", + "image_path": "e1890ed6e53fb9ce793d9a8493c6f54e7971b99f686d754dd6119e48c2a638ea.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 235, + 114, + 321, + 205 + ], + "blocks": [ + { + "bbox": [ + 235, + 114, + 321, + 205 + ], + "lines": [ + { + "bbox": [ + 235, + 114, + 321, + 205 + ], + "spans": [ + { + "bbox": [ + 235, + 114, + 321, + 205 + ], + "type": "image", + "image_path": "ff95b780ec06b6eb6ab57fc9a83d67c7dc6212750e328a9f72b43e93a213e0b8.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 188, + 206, + 271, + 215 + ], + "lines": [ + { + "bbox": [ + 188, + 206, + 271, + 215 + ], + "spans": [ + { + "bbox": [ + 188, + 206, + 271, + 215 + ], + "type": "text", + "content": "(a) Emergence Simulation" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 323, + 114, + 394, + 204 + ], + "blocks": [ + { + "bbox": [ + 323, + 114, + 394, + 204 + ], + "lines": [ + { + "bbox": [ + 323, + 114, + 394, + 204 + ], + "spans": [ + { + "bbox": [ + 323, + 114, + 394, + 204 + ], + "type": "image", + "image_path": "bab02cf7b60fd149b4c9d6f27d37c4bd2b3ad66234dbf09f44f2ea8ef3d8c183.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 351, + 206, + 446, + 216 + ], + "lines": [ + { + "bbox": [ + 351, + 206, + 446, + 216 + ], + "spans": [ + { + "bbox": [ + 351, + 206, + 446, + 216 + ], + "type": "text", + "content": "(b) Disappearance Simulation" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 395, + 114, + 477, + 204 + ], + "blocks": [ + { + "bbox": [ + 395, + 114, + 477, + 204 + ], + "lines": [ + { + "bbox": [ + 395, + 114, + 477, + 204 + ], + "spans": [ + { + "bbox": [ + 395, + 114, + 477, + 204 + ], + "type": "image", + "image_path": "b0832627bfae775c8914eca17ae978a5200415c1a41c506d6c085ec4366e87e8.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 138, + 293, + 477, + 344 + ], + "blocks": [ + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "lines": [ + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "type": "text", + "content": "Fig.5: The pipelines of emergence and disappearance simulation. CTQ, " + }, + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Emg}" + }, + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "type": "inline_equation", + "content": "\\mathrm{DAQ}_{Dis}" + }, + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "type": "inline_equation", + "content": "Q_{Seg}" + }, + { + "bbox": [ + 130, + 224, + 482, + 278 + ], + "type": "text", + "content": " are represented by rectangles, circles, diamonds, and heptagons, respectively. White indicates the background query transformed from the anchor query. The red rectangles highlight the difference between with and without simulation." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 138, + 293, + 477, + 344 + ], + "lines": [ + { + "bbox": [ + 138, + 293, + 477, + 344 + ], + "spans": [ + { + "bbox": [ + 138, + 293, + 477, + 344 + ], + "type": "image", + "image_path": "f25cccc0626990fb1d6888c0e3b8d0831456a4c7f3935b6de122cb067fba348e.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 196, + 353, + 416, + 365 + ], + "lines": [ + { + "bbox": [ + 196, + 353, + 416, + 365 + ], + "spans": [ + { + "bbox": [ + 196, + 353, + 416, + 365 + ], + "type": "text", + "content": "Fig. 6: The architecture of DVIS-DAQ tracker." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 388, + 482, + 461 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 388, + 482, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 388, + 482, + 461 + ], + "type": "text", + "content": "this object as a disappearing object because the Tracker only detects features from " + }, + { + "bbox": [ + 130, + 388, + 482, + 461 + ], + "type": "inline_equation", + "content": "Q_{Seg}" + }, + { + "bbox": [ + 130, + 388, + 482, + 461 + ], + "type": "text", + "content": " through cross-attention to obtain image information. At this point, this blue object is not present in the current frame but exists in the set of tracked objects, consistent with the state of a real disappearing blue object. The Tracker needs to transition the corresponding anchor query to a background query and determine the disappearance of this object." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 478, + 265, + 489 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 478, + 265, + 489 + ], + "spans": [ + { + "bbox": [ + 131, + 478, + 265, + 489 + ], + "type": "text", + "content": "3.4 Overall Architecture" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 498, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 581 + ], + "type": "text", + "content": "Architecture. Sec. 3.2 details how DAQ is integrated into the current query-based tracker without any requirement for architecture modification. We apply the SOTA video segmentation method DVIS [73] as our baseline and replace the Referring Cross-Attention [73,74] in its tracker with standard Cross-Attention to achieve a more straightforward and generalizable structure shown in Fig. 6. We then integrated DAQ into this simplified tracker, resulting in our architecture, DVIS-DAQ." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Objective Function. Our objective function differs from DVIS [73]. We maintain the historical matching relationship between the predictions of CTQ and ground truth for continuously tracked objects and remove the matched items from the ground truth. For newly emerging and disappearing objects, since DAQ is dynamically generated based on the features of candidates (refer to Sec. 3.2), we assign the remaining ground truth to DAQ based on the matching relationship between candidates and the remaining ground truth. Following this process," + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 481, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 158, + 465, + 403 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 1: Results on the val set of OVIS and YouTube-VIS 2019 & 2021. † denotes with the offline refiner proposed by [73]. The VIT-L [16] is pre-trained by DINOV2 [41] and uses VIT-Adapter [9] to obtain multiscale features." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 158, + 465, + 403 + ], + "lines": [ + { + "bbox": [ + 148, + 158, + 465, + 403 + ], + "spans": [ + { + "bbox": [ + 148, + 158, + 465, + 403 + ], + "type": "table", + "html": "
MethodBackboneOVISYT-VIS 2019YT-VIS 2021
AP\\( AP_{75} \\)\\( AR_{10} \\)AP\\( AP_{75} \\)\\( AR_{10} \\)AP\\( AP_{75} \\)\\( AR_{10} \\)
MinVIS [23]R5025.024.029.747.452.155.744.248.151.7
CTVIS [70]R5035.534.941.955.159.163.250.154.759.5
GenVIS [21]R5035.836.239.650.054.659.747.151.554.7
DVIS [73]R5030.230.537.351.257.159.346.449.653.5
DVIST† [73]R5033.833.539.552.358.260.447.451.655.2
DVIS++ [74]R5037.237.342.955.560.162.650.054.558.4
DVIST++† [74]R5041.240.947.3------
DVIS-DAQR5038.737.645.255.261.963.750.455.057.6
DVIS-DAQ†R5043.543.849.1------
MinVIS [23]Swin-L39.441.343.361.668.666.655.362.060.8
CTVIS [70]Swin-L46.947.552.165.672.270.461.268.865.8
GenVIS [21]Swin-L45.248.448.664.068.369.459.665.865.0
DVIS [73]Swin-L45.948.351.563.970.469.058.766.664.6
DVIST† [73]Swin-L48.650.553.864.972.770.360.168.465.7
DVIS++ [74]VIT-L49.655.054.667.775.373.762.370.268.0
DVIST++† [74]VIT-L53.458.558.768.376.173.463.971.569.5
DVIS-DAQSwin-L49.551.754.965.773.670.761.168.266.6
DVIS-DAQVIT-L53.758.259.568.376.173.562.470.868.0
DVIS-DAQ†VIT-L57.162.962.369.276.875.564.572.470.7
", + "image_path": "cb7e4290d1995d5cf369537f9464e6ff3b98aad7f3b78a6b68aa333ba007b8d2.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 415, + 482, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 415, + 482, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 415, + 482, + 475 + ], + "type": "text", + "content": "we obtain the matching relationship " + }, + { + "bbox": [ + 130, + 415, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\{(i,\\sigma (i))|i\\in [1,M]\\}" + }, + { + "bbox": [ + 130, + 415, + 482, + 475 + ], + "type": "text", + "content": " between ground truth and predictions, M is the number of ground truth. The not-matched predictions are assigned with the background class and an empty segmentation mask. Then, the loss between matched prediction-label pairs " + }, + { + "bbox": [ + 130, + 415, + 482, + 475 + ], + "type": "inline_equation", + "content": "(\\mathcal{P},\\mathcal{G})" + }, + { + "bbox": [ + 130, + 415, + 482, + 475 + ], + "type": "text", + "content": " can be calculated following the Mask2Former [11]:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 173, + 482, + 481, + 495 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 482, + 481, + 495 + ], + "spans": [ + { + "bbox": [ + 173, + 482, + 481, + 495 + ], + "type": "interline_equation", + "content": "\\mathcal {L} (\\mathcal {P}, \\mathcal {G}) = \\lambda_ {c l s} \\mathcal {L} _ {c l s} (\\mathcal {P}, \\mathcal {G}) + \\lambda_ {d i c e} \\mathcal {L} _ {d i c e} (\\mathcal {P}, \\mathcal {G}) + \\lambda_ {b c e} \\mathcal {L} _ {b c e} (\\mathcal {P}, \\mathcal {G}) \\tag {6}", + "image_path": "3d0ddd1ef5dce97abb6a37f8cbbf7488a5ee11acd97d16fd0d6e0d451cb9a10d.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "text", + "content": "Here, " + }, + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}" + }, + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "text", + "content": " represents the classification loss term, implemented using Cross Entropy Loss. " + }, + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dice}" + }, + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{bce}" + }, + { + "bbox": [ + 130, + 501, + 482, + 537 + ], + "type": "text", + "content": " denote the segmentation loss terms, implemented respectively using Dice loss and Binary Cross Entropy loss." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 553, + 224, + 567 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 553, + 224, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 553, + 224, + 567 + ], + "type": "text", + "content": "4 Experiment" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 576, + 269, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 576, + 269, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 576, + 269, + 586 + ], + "type": "text", + "content": "4.1 Datasets and Metrics" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "We conduct experiments on five mainstream video segmentation benchmarks, including OVIS [47], Youtube-VIS 2019 & 2021 & 2022 [68], and VIPSeg [39]. We employ AP and AR as evaluation metrics for the VIS datasets following [68]. We utilize Video Panoptic Quality (VPQ) and Segmentation and Tracking Quality (STQ) for the VPS datasets as evaluation metrics following [24,39]. More detailed settings can be found in the supplementary file." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 143, + 158, + 471, + 306 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 2: Results on the validation sets of YouTube-VIS 2022 and VIPSeg. " + }, + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "inline_equation", + "content": "\\mathrm{AP^L}" + }, + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "text", + "content": " refers to the AP on the long video set. " + }, + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "inline_equation", + "content": "\\mathrm{VPQ^{Th}}" + }, + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "inline_equation", + "content": "\\mathrm{VPQ^{St}}" + }, + { + "bbox": [ + 130, + 114, + 482, + 148 + ], + "type": "text", + "content": " refer to the VPQ on the \"thing\" objects and the \"stuff\" objects, respectively." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 143, + 158, + 471, + 306 + ], + "lines": [ + { + "bbox": [ + 143, + 158, + 471, + 306 + ], + "spans": [ + { + "bbox": [ + 143, + 158, + 471, + 306 + ], + "type": "table", + "html": "
MethodBackboneYT-VIS 2022VIPSeg
APLAP75AR10VPQVPQThVPQSSTQ
MinVIS [23]R5023.319.328.0----
TarVIS [1]R50---33.539.228.543.1
DVIS [73]R5031.637.036.339.438.640.136.3
DVIS++ [74]R5037.240.744.641.941.042.738.5
DVIS-DAQR5034.635.541.142.141.742.539.3
MinVIS [23]Swin-L33.133.736.6----
TarVIS [1]Swin-L---48.058.239.052.9
DVIS [73]Swin-L39.942.644.954.754.854.647.7
DVIS++ [74]VIT-L37.539.443.556.058.054.349.8
DVIS-DAQVIT-L42.043.048.457.460.454.752.0
", + "image_path": "4912e191b5a05ab6a2acc732af1857d6afc8f51fd56db5e8389c7ff26d29d133.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 323, + 254, + 335 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 323, + 254, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 323, + 254, + 335 + ], + "type": "text", + "content": "4.2 Main Experiments" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 350, + 482, + 532 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 350, + 482, + 532 + ], + "spans": [ + { + "bbox": [ + 130, + 350, + 482, + 532 + ], + "type": "text", + "content": "Performance on OVIS dataset. The OVIS dataset presents more challenging cases, such as occlusion, fast motion, and complex motion trajectories. We present the quantitative evaluation results in Tab. 1. When using ResNet-50 [20] as the backbone, our method achieves an AP of 38.7 and 43.5 with the offline refiner, surpassing all existing methods. Compared to the current SOTA DVIS++ [74], our method shows an improvement of 1.5 AP (38.7 vs. 37.2) and 2.3 AP (43.5 vs. 41.2) with the offline refiner. When employing a larger backbone, our method achieves even more significant improvements. With Swin-L [36] as the backbone, our method outperforms DVIS [73] by 3.6 AP (49.5 vs. 45.9). When using VIT-L [16] as the backbone, our method surpasses DVIS++ by 4.1 AP (53.7 vs. 49.6). Notably, our DVIS-DAQ even outperforms DVIS++ with the offline refiner (53.7 vs. 53.4), while DVIS-DAQ with the offline refiner has reached 57.1 AP. These quantitative results demonstrate that our DAQ design significantly enhances the capability of query-based video segmentation methods in processing complex scenes with many object emergence and disappearances." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 532, + 482, + 615 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 532, + 482, + 615 + ], + "spans": [ + { + "bbox": [ + 130, + 532, + 482, + 615 + ], + "type": "text", + "content": "Performance on Youtube-VIS 2019 & 2021 datasets. The videos in these two datasets are relatively short and feature simple scenes. As shown in Tab. 1, when using ResNet-50 as the backbone, our method achieves a 4.0 AP improvement compared to the baseline DVIS on the YTVIS 2019 and 2021 datasets. When using VIT-L as the backbone, we achieve comparable performance with DVIS++. When using the offline refiner, we outperform DVIS++ by 0.9 AP and 0.6 AP on the YTVIS 2019 and 2021 datasets." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": "Performance on Youtube-VIS 2022 dataset. Youtube-VIS 2022 has been expanded with 71 long videos based on the 2021 version. Therefore, we only report the " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathrm{AP^L}" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": " for the long videos in Tab. 2. When using ResNet-50 as the backbone, DVIS-DAQ outperforms the baseline DVIS with " + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "inline_equation", + "content": "3.0\\mathrm{AP}^{\\mathrm{L}}" + }, + { + "bbox": [ + 130, + 617, + 482, + 665 + ], + "type": "text", + "content": ". Our method" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 399, + 91, + 447, + 102 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 133, + 239, + 206 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 133, + 239, + 206 + ], + "spans": [ + { + "bbox": [ + 132, + 133, + 239, + 206 + ], + "type": "text", + "content": "(a) The main ablation study of the proposed DAQ and EDS. The baseline is the extension of DVIS [73]. EDAQ/DDAQ denotes emergence/disappearance DAQ. ES/DS denotes emergence/disappearance simulation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 244, + 133, + 317, + 207 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 133, + 317, + 207 + ], + "spans": [ + { + "bbox": [ + 244, + 133, + 317, + 207 + ], + "type": "text", + "content": "(b) Candidates selection for emergence DAQ. K denotes the number of top-scoring candidates. N denotes the number of learnable embeddings." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 321, + 133, + 386, + 166 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 321, + 133, + 386, + 166 + ], + "spans": [ + { + "bbox": [ + 321, + 133, + 386, + 166 + ], + "type": "text", + "content": "(c) Threshold selection for new emergence simulation." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 391, + 133, + 482, + 207 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 391, + 133, + 482, + 207 + ], + "spans": [ + { + "bbox": [ + 391, + 133, + 482, + 207 + ], + "type": "text", + "content": "(d) Disappearance simulation. One, Continuous, and Random represent simulating disappearance for an object in a solitary frame, all frames, and randomly selected frames within a video clip, respectively." + } + ] + } + ], + "index": 6 + }, + { + "type": "table", + "bbox": [ + 133, + 211, + 239, + 282 + ], + "blocks": [ + { + "bbox": [ + 151, + 114, + 461, + 126 + ], + "lines": [ + { + "bbox": [ + 151, + 114, + 461, + 126 + ], + "spans": [ + { + "bbox": [ + 151, + 114, + 461, + 126 + ], + "type": "text", + "content": "Table 3: Ablation studies on our proposed DAQ and other network details." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 211, + 239, + 282 + ], + "lines": [ + { + "bbox": [ + 133, + 211, + 239, + 282 + ], + "spans": [ + { + "bbox": [ + 133, + 211, + 239, + 282 + ], + "type": "table", + "html": "
EDAQ ES DDAQ DS | AP
35.4
✓33.3
✓32.3
✓✓36.4
✓✓✓36.6
✓✓✓37.1
", + "image_path": "caaeeda8934df084055cc2291a5ab1fcf5a19a91a91e948d8ea2f71031c9fa23.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 250, + 211, + 310, + 281 + ], + "blocks": [ + { + "bbox": [ + 250, + 211, + 310, + 281 + ], + "lines": [ + { + "bbox": [ + 250, + 211, + 310, + 281 + ], + "spans": [ + { + "bbox": [ + 250, + 211, + 310, + 281 + ], + "type": "table", + "html": "
KNAP
100136.4
50135.9
50236.5
25435.6
", + "image_path": "d568822be76a7d36945bfa8d006e184315b87b93836ddd685e0d743adb44e784.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "type": "table", + "bbox": [ + 323, + 211, + 385, + 281 + ], + "blocks": [ + { + "bbox": [ + 323, + 211, + 385, + 281 + ], + "lines": [ + { + "bbox": [ + 323, + 211, + 385, + 281 + ], + "spans": [ + { + "bbox": [ + 323, + 211, + 385, + 281 + ], + "type": "table", + "html": "
ThresholdAP
0.0134.2
0.0534.7
0.1035.6
0.2034.5
0.5033.2
", + "image_path": "6623f3f28d4e82c239ce1338d558e78318c6dbed101b6878c8f729b93bb41422.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 399, + 212, + 473, + 281 + ], + "blocks": [ + { + "bbox": [ + 399, + 212, + 473, + 281 + ], + "lines": [ + { + "bbox": [ + 399, + 212, + 473, + 281 + ], + "spans": [ + { + "bbox": [ + 399, + 212, + 473, + 281 + ], + "type": "table", + "html": "
TypeAP
One36.3
Continuous35.8
Random37.1
", + "image_path": "87a921d364adf3429244901eb05de45c77ab1b7b1a25a9e768465b1f75471e90.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "table_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 284, + 301, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 284, + 301, + 350 + ], + "spans": [ + { + "bbox": [ + 132, + 284, + 301, + 350 + ], + "type": "text", + "content": "(e) Generation of emergence DAQ. " + }, + { + "bbox": [ + 132, + 284, + 301, + 350 + ], + "type": "inline_equation", + "content": "SegQ / SegP / AppF" + }, + { + "bbox": [ + 132, + 284, + 301, + 350 + ], + "type": "text", + "content": " denotes the query feature/positional embedding/appearance feature of the segmenter's frame object output. Add/Cat denotes adding/concatenating the selected features to the query feature of emergence DAQ. Pos denotes using the selected feature as the positional embedding of emergence DAQ." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 311, + 284, + 482, + 357 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 311, + 284, + 482, + 357 + ], + "spans": [ + { + "bbox": [ + 311, + 284, + 482, + 357 + ], + "type": "text", + "content": "(f) Generation of disappearance DAQ. Learn and Initial SegQ represent initializing the query feature of disappearance DAQ by using a new learnable embedding and the initial queries of segmenter, respectively. " + }, + { + "bbox": [ + 311, + 284, + 482, + 357 + ], + "type": "inline_equation", + "content": "CTQF / CTQP" + }, + { + "bbox": [ + 311, + 284, + 482, + 357 + ], + "type": "text", + "content": " represent using the query feature/momentum-weighted appearance feature of tracked objects as the positional embeddings of disappearance DAQ." + } + ] + } + ], + "index": 12 + }, + { + "type": "table", + "bbox": [ + 143, + 361, + 290, + 401 + ], + "blocks": [ + { + "bbox": [ + 143, + 361, + 290, + 401 + ], + "lines": [ + { + "bbox": [ + 143, + 361, + 290, + 401 + ], + "spans": [ + { + "bbox": [ + 143, + 361, + 290, + 401 + ], + "type": "table", + "html": "
MetricFeature selectionFeature usage
SegQSegPAppFAdd Cat Pos
AP34.836.036.436.0 36.2 36.4
", + "image_path": "2cf859cbafa8c59c8d47795ea60d75d520b2f9f6ad6e5863a648c2f6da0a6ed2.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "table_body" + } + ], + "index": 13 + }, + { + "type": "table", + "bbox": [ + 312, + 361, + 489, + 401 + ], + "blocks": [ + { + "bbox": [ + 312, + 361, + 489, + 401 + ], + "lines": [ + { + "bbox": [ + 312, + 361, + 489, + 401 + ], + "spans": [ + { + "bbox": [ + 312, + 361, + 489, + 401 + ], + "type": "table", + "html": "
MetricQuery feature Learn Initial SegQPositional CTQFembedding CTQP
AP36.537.136.837.1
", + "image_path": "708d431e76fb57d3b3f52feba6d287b5b402e418ea3fd2eb427a91efceb08bdb.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "table_body" + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 425, + 480, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 425, + 480, + 448 + ], + "spans": [ + { + "bbox": [ + 130, + 425, + 480, + 448 + ], + "type": "text", + "content": "outperforms DVIS++ with 4.5 AP" + }, + { + "bbox": [ + 130, + 425, + 480, + 448 + ], + "type": "inline_equation", + "content": "^{\\text{L}}" + }, + { + "bbox": [ + 130, + 425, + 480, + 448 + ], + "type": "text", + "content": " (42.0 vs. 37.5) when using VIT-L as the backbone." + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 450, + 482, + 547 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 547 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 547 + ], + "type": "text", + "content": "Performance on VIPSeg dataset. VIPSeg is a large-scale video panoptic segmentation dataset containing various real-world scenes and more categories. Tab. 2 presents the performance comparison with SOTA methods. Our method achieves new SOTA performance with both ResNet-50 and VIT-L backbone settings. Our method achieves a VPQ of 42.1 when using ResNet-50 as the backbone, surpassing the baseline DVIS by 2.7 VPQ. With VIT-L as the backbone, our method achieves a VPQ of 57.4, demonstrating a 2.4 VPQ improvement over the previous SOTA DVIS++ in \"thing\" objects." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 568, + 313, + 582 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 568, + 313, + 582 + ], + "spans": [ + { + "bbox": [ + 132, + 568, + 313, + 582 + ], + "type": "text", + "content": "4.3 Ablation Studies and Analysis" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 666 + ], + "type": "text", + "content": "We perform ablation experiments on the OVIS dataset using the ResNet-50 backbone and 40K training iterations. We use DVIS [73] as the baseline. When aligning the training and testing settings with DVIS++ [74], the baseline achieves an AP of 35.4. More detailed settings are provided in the supplementary materials. Moreover, we also refer the readers for more different architectures using our DAQ in supplementary part." + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 134, + 115, + 481, + 271 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 115, + 481, + 271 + ], + "spans": [ + { + "bbox": [ + 134, + 115, + 481, + 271 + ], + "type": "text", + "content": "Effectiveness of DAQ and EDS. Tab. 3a presents the ablation studies about our proposed components. Using emergence dynamic anchor queries alone leads to a performance degradation of 2.1 AP, attributed to insufficient examples of emergence objects for training. When the emergence simulation strategy is used alone, performance drops by 3.1 AP, indicating that the unreasonable anchor design in the previous method [73] makes it difficult for the network to learn to handle object emergence, even with sufficient training cases. When emergence dynamic anchor queries and emergence simulation are used together, the reasonable mechanism and sufficient training cases result in a 1.0 AP improvement compared to the baseline. Disappearing dynamic anchor queries contribute to a performance improvement of 0.2 AP. Introducing the Disappearing Simulation strategy to provide sufficient cases of disappearing objects further increases model performance by 0.5 AP." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 134, + 274, + 481, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 274, + 481, + 369 + ], + "spans": [ + { + "bbox": [ + 134, + 274, + 481, + 369 + ], + "type": "text", + "content": "Emergence dynamic anchor queries. DAQ comprises query feature embedding and positional embedding. Firstly, we explore different strategies for selecting emergency candidates, and the results are presented in Tab. 3b. When choosing the top 100 object predictions of the segmenter as candidates, with only one shared learnable embedding, we obtain 36.4 AP. Setting the number of candidates to the top 50 and the number of learnable embeddings to 2 brings a performance gain of 0.1 AP. To explore potential new objects fully, we choose the top 100 scheme." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 134, + 373, + 481, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 373, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 134, + 373, + 481, + 468 + ], + "type": "text", + "content": "In Tab. 3e, we investigate how to generate corresponding dynamic anchor queries based on the features of emerging candidates. We find that utilizing candidates' appearance features yields the best results, surpassing the use of positional features and object queries with a hybrid of positional and appearance information by 1.6 AP and 0.4 AP, respectively. Furthermore, leveraging the features of candidates in the form of query positional embedding results in the best performance, outperforming addition and concatenation operations by 0.4 AP and 0.2 AP, respectively." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 472, + 481, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 472, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 134, + 472, + 481, + 567 + ], + "type": "text", + "content": "Disappearance dynamic anchor queries. In Tab. 3f, we explore how to initialize the query feature embedding and positional embedding of disappearance DAQ. We find that initializing query feature of disappearance DAQ from the initial queries in the segmenter (as shown in Fig. 3) yields better AP than using a new shared learnable embedding for all disappearance DAQ (37.1 vs. 36.5). For generation of positional embedding of disappearance DAQ, we find utilizing the momentum-weighted appearance feature of tracked objects yield better AP than utilizing the query feature of tracked objects (37.1 vs. 36.8)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 134, + 570, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 570, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 570, + 481, + 665 + ], + "type": "text", + "content": "Emergence and disappearance simulation. We employ a threshold to filter out low-scoring tracked objects in emergence simulation. Tab. 3c illustrates the results when using different thresholds. A minimal threshold (0.01) results in insufficient new emergence cases, whereas a larger threshold (0.5) disrupts the model's ability to learn continuous tracking. Both result in poor performance (34.2 AP and 33.2 AP). A similar phenomenon is observed in the disappearance simulation, as shown in Tab. 3d. The simulation of an object's disappearance in a solitary frame within a video clip fails to generate sufficient disappearance" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 400, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 400, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 400, + 91, + 447, + 102 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 160, + 115, + 455, + 277 + ], + "blocks": [ + { + "bbox": [ + 160, + 115, + 455, + 277 + ], + "lines": [ + { + "bbox": [ + 160, + 115, + 455, + 277 + ], + "spans": [ + { + "bbox": [ + 160, + 115, + 455, + 277 + ], + "type": "image", + "image_path": "ca742f8a59d6331bf8e255f49fd42edfe3a85728e6fdc3e54eeb91587d60099c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 285, + 482, + 329 + ], + "lines": [ + { + "bbox": [ + 130, + 285, + 482, + 329 + ], + "spans": [ + { + "bbox": [ + 130, + 285, + 482, + 329 + ], + "type": "text", + "content": "Fig. 7: Qualitative results comparison for emergence detection and disappearance filtering. The performance enhancements are highlighted by rectangles in various colors, each color representing an individual video object. It's better to view with zooming in " + }, + { + "bbox": [ + 130, + 285, + 482, + 329 + ], + "type": "inline_equation", + "content": "8 \\times" + }, + { + "bbox": [ + 130, + 285, + 482, + 329 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 341, + 482, + 424 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 341, + 482, + 424 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 482, + 424 + ], + "type": "text", + "content": "cases. Conversely, simulating the disappearance across all frames compromises the model's capability to learn continuous tracking. Consequently, we have determined that a threshold of 0.1 strikes an optimal balance for simulating emergence, and we opt for a stochastic selection of frames in a video clip to simulate disappearance. This strategy ensures ample emergence and disappearance cases while preserving the model's tracking capability for continually appearing objects." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 425, + 482, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 425, + 482, + 485 + ], + "spans": [ + { + "bbox": [ + 130, + 425, + 482, + 485 + ], + "type": "text", + "content": "Qualitative results comparison. In Fig. 7, we present the visual comparison with our baseline. In this challenging scene, there are new-emerging, disappearing, and reappearing video objects. Our method accurately addresses all these scenarios, whereas DVIS suffers from issues including missed new-emerging objects and ID switches." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 506, + 220, + 519 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 506, + 220, + 519 + ], + "spans": [ + { + "bbox": [ + 132, + 506, + 220, + 519 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 482, + 666 + ], + "type": "text", + "content": "We observed that current SOTA query-based video segmentation methods perform poorly on newly emerging and disappearing objects. We have analyzed and identified the significant transition gap hindering the network's learning. We address this challenge by proposing dynamic anchor queries for shortening the transition gap. We also introduce a query-level simulation strategy for simulating object disappearance and emergence without additional costs. By integrating our proposed dynamic anchor queries and simulation strategy into DVIS, we obtained DVIS-DAQ, which achieved SOTA performance on mainstream video segmentation benchmarks. Our research will inspire the video community to bridge the gap between current advancements in the standard benchmarks and real-world application requirements." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 25, + "blocks": [ + { + "bbox": [ + 138, + 140, + 480, + 164 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 480, + 164 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 480, + 164 + ], + "type": "text", + "content": "1. Athar, A., Hermans, A., Luiten, J., Ramanan, D., Leibe, B.: Tarvis: A unified approach for target-based video segmentation. In: CVPR (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 165, + 480, + 186 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 165, + 480, + 186 + ], + "spans": [ + { + "bbox": [ + 138, + 165, + 480, + 186 + ], + "type": "text", + "content": "2. Athar, A., Mahadevan, S., Osep, A., Leal-Taixe, L., Leibe, B.: Stem-seg: Spatiotemporal embeddings for instance segmentation in videos. In: ECCV (2020)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 187, + 480, + 208 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 187, + 480, + 208 + ], + "spans": [ + { + "bbox": [ + 138, + 187, + 480, + 208 + ], + "type": "text", + "content": "3. Bekuzarov, M., Bermudez, A., Lee, J.Y., Li, H.: Xmem++: Production-level video segmentation from few annotated frames (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 209, + 480, + 231 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 209, + 480, + 231 + ], + "spans": [ + { + "bbox": [ + 138, + 209, + 480, + 231 + ], + "type": "text", + "content": "4. Bertasius, G., Torresani, L.: Classifying, segmenting, and tracking object instances in video with mask propagation (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 232, + 480, + 253 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 232, + 480, + 253 + ], + "spans": [ + { + "bbox": [ + 138, + 232, + 480, + 253 + ], + "type": "text", + "content": "5. Bertasius, G., Wang, H., Torresani, L.: Is space-time attention all you need for video understanding? In: ICML (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 254, + 480, + 275 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 254, + 480, + 275 + ], + "spans": [ + { + "bbox": [ + 138, + 254, + 480, + 275 + ], + "type": "text", + "content": "6. Bewley, A., Ge, Z., Ott, L., Ramos, F., Upcroft, B.: Simple online and realtime tracking. In: ICIP (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 276, + 480, + 297 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 276, + 480, + 297 + ], + "spans": [ + { + "bbox": [ + 138, + 276, + 480, + 297 + ], + "type": "text", + "content": "7. Caelles, S., Maninis, K., Pont-Tuset, J., Leal-Taixe, L., Cremers, D., Van Gool, L.: One-shot video object segmentation. In: CVPR (2017)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 298, + 480, + 319 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 298, + 480, + 319 + ], + "spans": [ + { + "bbox": [ + 138, + 298, + 480, + 319 + ], + "type": "text", + "content": "8. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: ECCV (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 321, + 480, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 321, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 138, + 321, + 480, + 342 + ], + "type": "text", + "content": "9. Chen, Z., Duan, Y., Wang, W., He, J., Lu, T., Dai, J., Qiao, Y.: Vision transformer adapter for dense predictions. arXiv preprint arXiv:2205.08534 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 343, + 480, + 375 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 343, + 480, + 375 + ], + "spans": [ + { + "bbox": [ + 138, + 343, + 480, + 375 + ], + "type": "text", + "content": "0. Cheng, B., Choudhuri, A., Misra, I., Kirillov, A., Girdhar, R., Schwing, A.G.: Mask2former for video instance segmentation. arXiv preprint arXiv:2112.10764 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 376, + 480, + 398 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 376, + 480, + 398 + ], + "spans": [ + { + "bbox": [ + 138, + 376, + 480, + 398 + ], + "type": "text", + "content": "1. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: CVPR (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 399, + 480, + 420 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 399, + 480, + 420 + ], + "spans": [ + { + "bbox": [ + 138, + 399, + 480, + 420 + ], + "type": "text", + "content": "2. Cheng, B., Schwing, A., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation. NeurIPS (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 421, + 480, + 442 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 421, + 480, + 442 + ], + "spans": [ + { + "bbox": [ + 138, + 421, + 480, + 442 + ], + "type": "text", + "content": "3. Cheng, H.K., Oh, S.W., Price, B., Schwing, A., Lee, J.Y.: Tracking anything with decoupled video segmentation. In: ICCV (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 443, + 480, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 443, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 138, + 443, + 480, + 464 + ], + "type": "text", + "content": "4. Cheng, H.K., Tai, Y.W., Tang, C.K.: Rethinking space-time networks with improved memory coverage for efficient video object segmentation. In: NeurIPS (2021)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 465, + 480, + 487 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 465, + 480, + 487 + ], + "spans": [ + { + "bbox": [ + 138, + 465, + 480, + 487 + ], + "type": "text", + "content": "5. Ding, H., Liu, C., He, S., Jiang, X., Torr, P.H., Bai, S.: MOSE: A new dataset for video object segmentation in complex scenes. In: ICCV (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 488, + 480, + 520 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 488, + 480, + 520 + ], + "spans": [ + { + "bbox": [ + 138, + 488, + 480, + 520 + ], + "type": "text", + "content": "6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. ICLR (2021)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 521, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 521, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 521, + 480, + 542 + ], + "type": "text", + "content": "7. Gao, R., Wang, L.: MeMOTR: Long-term memory-augmented transformer for multi-object tracking. In: ICCV (2023)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 544, + 480, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 576 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 576 + ], + "type": "text", + "content": "8. Hannan, T., Koner, R., Bernhard, M., Shit, S., Menze, B., Tresp, V., Schubert, M., Seidl, T.: Gratt-vis: Gated residual attention for auto rectifying video instance segmentation. arXiv preprint arXiv:2305.17096 (2023)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 138, + 577, + 480, + 598 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 577, + 480, + 598 + ], + "spans": [ + { + "bbox": [ + 138, + 577, + 480, + 598 + ], + "type": "text", + "content": "9. He, J., Yu, Q., Shin, I., Deng, X., Shen, X., Yuille, A., Chen, L.C.: Maxtron: Mask transformer with trajectory attention for video panoptic segmentation (2023)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 138, + 599, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 599, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 138, + 599, + 480, + 620 + ], + "type": "text", + "content": "20. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR (2016)" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 480, + 643 + ], + "type": "text", + "content": "21. Heo, M., Hwang, S., Hyun, J., Kim, H., Oh, S.W., Lee, J.Y., Kim, S.J.: A generalized framework for video instance segmentation. In: CVPR (2023)" + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 480, + 665 + ], + "type": "text", + "content": "22. Heo, M., Hwang, S., Oh, S.W., Lee, J.Y., Kim, S.J.: Vita: Video instance segmentation via object token association. NIPS (2022)" + } + ] + } + ], + "index": 24 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 399, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 399, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 399, + 91, + 447, + 101 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 25, + "blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 117, + 480, + 138 + ], + "type": "text", + "content": "23. Huang, D.A., Yu, Z., Anandkumar, A.: Minvis: A minimal video instance segmentation framework without video-based training. NeurIPS (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 160 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 160 + ], + "type": "text", + "content": "24. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 161, + 480, + 182 + ], + "type": "text", + "content": "25. Kim, D., Woo, S., Lee, J.Y., Kweon, I.S.: Video panoptic segmentation. In: CVPR (2020)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 183, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 183, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 183, + 480, + 205 + ], + "type": "text", + "content": "26. Kim, D., Xie, J., Wang, H., Qiao, S., Yu, Q., Kim, H.S., Adam, H., Kweon, I.S., Chen, L.C.: Tubeformer-deeplab: Video mask transformer. In: CVPR (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 205, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 205, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 133, + 205, + 480, + 226 + ], + "type": "text", + "content": "27. Leal-Taixe, L., Canton-Ferrer, C., Schindler, K.: Learning by tracking: Siamese cnn for robust target association. In: CVPR Workshops (2016)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 227, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 227, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 227, + 480, + 248 + ], + "type": "text", + "content": "28. Li, J., Yu, B., Rao, Y., Zhou, J., Lu, J.: Tcovis: Temporally consistent online video instance segmentation. In: ICCV (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 249, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 249, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 133, + 249, + 480, + 270 + ], + "type": "text", + "content": "29. Li, M., Li, S., Zhang, X., Zhang, L.: Univs: Unified and universal video segmentation with prompts as queries (2024)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 271, + 480, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 271, + 480, + 303 + ], + "spans": [ + { + "bbox": [ + 134, + 271, + 480, + 303 + ], + "type": "text", + "content": "30. Li, X., Ding, H., Zhang, W., Yuan, H., Cheng, G., Jiangmiao, P., Chen, K., Liu, Z., Loy, C.C.: Transformer-based visual segmentation: A survey. arXiv pre-print (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 134, + 304, + 480, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 304, + 480, + 325 + ], + "spans": [ + { + "bbox": [ + 134, + 304, + 480, + 325 + ], + "type": "text", + "content": "31. Li, X., Xu, S., Cheng, Y.Y., Tong, Y., Tao, D., et al.: Panoptic-partformer: Learning a unified model for panoptic part segmentation. ECCV (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 134, + 326, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 326, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 134, + 326, + 480, + 346 + ], + "type": "text", + "content": "32. Li, X., Yuan, H., Li, W., Ding, H., Wu, S., Zhang, W., Li, Y., Chen, K., Loy, C.C.: Omg-seg: Is one model good enough for all segmentation? CVPR (2024)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 134, + 347, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 347, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 134, + 347, + 480, + 369 + ], + "type": "text", + "content": "33. Li, X., Yuan, H., Zhang, W., Cheng, G., Pang, J., Loy, C.C.: Tube-link: A flexible cross tube framework for universal video segmentation. In: ICCV (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 134, + 369, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 369, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 134, + 369, + 480, + 391 + ], + "type": "text", + "content": "34. Li, X., Zhang, W., Pang, J., Chen, K., Cheng, G., Tong, Y., Loy, C.C.: Video k-net: A simple, strong, and unified baseline for video segmentation. In: CVPR (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 392, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 392, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 134, + 392, + 480, + 413 + ], + "type": "text", + "content": "35. Lin, C.C., Hung, Y., Feris, R., He, L.: Video instance segmentation tracking with a modified vae architecture. In: CVPR (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 414, + 480, + 434 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 414, + 480, + 434 + ], + "spans": [ + { + "bbox": [ + 134, + 414, + 480, + 434 + ], + "type": "text", + "content": "36. Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., Lin, S., Guo, B.: Swin transformer: Hierarchical vision transformer using shifted windows. In: ICCV (2021)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 435, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 435, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 134, + 435, + 480, + 468 + ], + "type": "text", + "content": "37. Meinhardt, T., Feiszli, M., Fan, Y., Leal-Taixe, L., Ranjan, R.: Novis: A case for end-to-end near-online video instance segmentation. arXiv preprint arXiv:2308.15266 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 134, + 468, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 468, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 134, + 468, + 480, + 490 + ], + "type": "text", + "content": "38. Meinhardt, T., Kirillov, A., Leal-Taixe, L., Feichtenhofer, C.: Trackformer: Multi-object tracking with transformers. In: CVPR (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 134, + 491, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 491, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 134, + 491, + 480, + 511 + ], + "type": "text", + "content": "39. Miao, J., Wang, X., Wu, Y., Li, W., Zhang, X., Wei, Y., Yang, Y.: Large-scale video panoptic segmentation in the wild: A benchmark. In: CVPR (2022)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 134, + 512, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 512, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 134, + 512, + 480, + 533 + ], + "type": "text", + "content": "40. Miao, J., Wei, Y., Wu, Y., Liang, C., Li, G., Yang, Y.: Vspw: A large-scale dataset for video scene parsing in the wild. In: CVPR (2021)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 134, + 534, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 534, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 134, + 534, + 480, + 566 + ], + "type": "text", + "content": "41. Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al.: Dinov2: Learning robust visual features without supervision. arXiv preprint arXiv:2304.07193 (2023)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 134, + 567, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 567, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 134, + 567, + 480, + 588 + ], + "type": "text", + "content": "42. Pang, J., Qiu, L., Li, X., Chen, H., Li, Q., Darrell, T., Yu, F.: Quasi-dense similarity learning for multiple object tracking. In: CVPR (2021)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 134, + 589, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 589, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 134, + 589, + 480, + 610 + ], + "type": "text", + "content": "43. Pang, Z., Li, Z., Wang, N.: Simpletrack: Understanding and rethinking 3d multi-object tracking. arXiv preprint arXiv:2111.09621 (2021)" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 134, + 611, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 611, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 611, + 480, + 632 + ], + "type": "text", + "content": "44. Park, K., Woo, S., Oh, S.W., Kweon, I.S., Lee, J.Y.: Per-clip video object segmentation. In: CVPR (2022)" + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 633, + 480, + 665 + ], + "type": "text", + "content": "45. Patrick, M., Campbell, D., Asano, Y.M., Metze, I.M.F., Feichtenhofer, C., Vedaldi, A., Henriques, J.F.: Keeping your eye on the ball: Trajectory attention in video transformers. In: NeurIPS (2021)" + } + ] + } + ], + "index": 24 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 23, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "46. Porzi, L., Hofinger, M., Ruiz, I., Serrat, J., Bulo, S.R., Kontschieder, P.: Learning multi-object tracking and segmentation from automatic annotations. In: CVPR (2020)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 149, + 482, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 149, + 482, + 171 + ], + "spans": [ + { + "bbox": [ + 130, + 149, + 482, + 171 + ], + "type": "text", + "content": "47. Qi, J., Gao, Y., Hu, Y., Wang, X., Liu, X., Bai, X., Belongie, S., Yuille, A., Torr, P.H., Bai, S.: Occluded video instance segmentation: A benchmark. IJCV (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 171, + 482, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 171, + 482, + 192 + ], + "spans": [ + { + "bbox": [ + 130, + 171, + 482, + 192 + ], + "type": "text", + "content": "48. Qiao, S., Zhu, Y., Adam, H., Yuille, A., Chen, L.C.: Vip-deeplab: Learning visual perception with depth-aware video panoptic segmentation. In: CVPR (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 192, + 482, + 213 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 192, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 192, + 482, + 213 + ], + "type": "text", + "content": "49. Sanghyun, W., Kwanyong, P., Seoung, W.O., In, S.K., Joon-Young, L.: Tracking by associating clips. In: ECCV (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 213, + 482, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 213, + 482, + 246 + ], + "spans": [ + { + "bbox": [ + 130, + 213, + 482, + 246 + ], + "type": "text", + "content": "50. Seong, H., Oh, S.W., Lee, J.Y., Lee, S., Lee, S., Kim, E.: Hierarchical memory matching network for video object segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 246, + 482, + 278 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 246, + 482, + 278 + ], + "spans": [ + { + "bbox": [ + 130, + 246, + 482, + 278 + ], + "type": "text", + "content": "51. Sun, P., Cao, J., Jiang, Y., Yuan, Z., Bai, S., Kitani, K., Luo, P.: Dancetrack: Multi-object tracking in uniform appearance and diverse motion. arXiv preprint arXiv:2111.14690 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 278, + 482, + 311 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 278, + 482, + 311 + ], + "spans": [ + { + "bbox": [ + 130, + 278, + 482, + 311 + ], + "type": "text", + "content": "52. Sun, P., Cao, J., Jiang, Y., Zhang, R., Xie, E., Yuan, Z., Wang, C., Luo, P.: Transtrack: Multiple-object tracking with transformer. arXiv preprint arXiv: 2012.15460 (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 311, + 482, + 332 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 311, + 482, + 332 + ], + "spans": [ + { + "bbox": [ + 130, + 311, + 482, + 332 + ], + "type": "text", + "content": "53. Tsai, Y.J., Liu, Y.L., Qi, L., Chan, K.C., Yang, M.H.: Dual associated encoder for face restoration. arXiv preprint arXiv:2308.07314 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 332, + 482, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 332, + 482, + 354 + ], + "spans": [ + { + "bbox": [ + 130, + 332, + 482, + 354 + ], + "type": "text", + "content": "54. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: CVPR (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 354, + 482, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 374 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 374 + ], + "type": "text", + "content": "55. Wang, Y., Xu, Z., Wang, X., Shen, C., Cheng, B., Shen, H., Xia, H.: End-to-end video instance segmentation with transformers. In: CVPR (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "type": "text", + "content": "56. Weber, M., Xie, J., Collins, M., Zhu, Y., Voigtlaender, P., Adam, H., Green, B., Geiger, A., Leibe, B., Cremers, D., et al.: Step: Segmenting and tracking every pixel. arXiv preprint arXiv:2102.11859 (2021)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 407, + 482, + 440 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 440 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 440 + ], + "type": "text", + "content": "57. Weng, Y., Han, M., He, H., Li, M., Yao, L., Chang, X., Zhuang, B.: Mask propagation for efficient video semantic segmentation. arXiv preprint arXiv:2310.18954 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 440, + 482, + 460 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 440, + 482, + 460 + ], + "spans": [ + { + "bbox": [ + 130, + 440, + 482, + 460 + ], + "type": "text", + "content": "58. Wu, J., Cao, J., Song, L., Wang, Y., Yang, M., Yuan, J.: Track to detect and segment: An online multi-object tracker. In: CVPR (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 460, + 482, + 493 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 493 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 493 + ], + "type": "text", + "content": "59. Wu, J., Li, X., Xu, S., Yuan, H., Ding, H., Yang, Y., Li, X., Zhang, J., Tong, Y., Jiang, X., Ghanem, B., Tao, D.: Towards open vocabulary learning: A survey. T-PAMI (2024)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 493, + 482, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 493, + 482, + 514 + ], + "spans": [ + { + "bbox": [ + 130, + 493, + 482, + 514 + ], + "type": "text", + "content": "60. Wu, J., Jiang, Y., Bai, S., Zhang, W., Bai, X.: Seqformer: Sequential transformer for video instance segmentation. In: ECCV (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 514, + 482, + 536 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 514, + 482, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 514, + 482, + 536 + ], + "type": "text", + "content": "61. Wu, J., Liu, Q., Jiang, Y., Bai, S., Yuille, A., Bai, X.: In defense of online models for video instance segmentation. In: ECCV (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 536, + 482, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 536, + 482, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 536, + 482, + 557 + ], + "type": "text", + "content": "62. Xu, J., Cao, Y., Zhang, Z., Hu, H.: Spatial-temporal relation networks for multi-object tracking. In: ICCV (2019)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 557, + 482, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 482, + 590 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 482, + 590 + ], + "type": "text", + "content": "63. Xu, S., Li, X., Wang, J., Cheng, G., Tong, Y., Tao, D.: Fashionformer: A simple, effective and unified baseline for human fashion segmentation and recognition. In: ECCV (2022)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 590, + 482, + 623 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 590, + 482, + 623 + ], + "spans": [ + { + "bbox": [ + 130, + 590, + 482, + 623 + ], + "type": "text", + "content": "64. Xu, S., Yuan, H., Shi, Q., Qi, L., Wang, J., Yang, Y., Li, Y., Chen, K., Tong, Y., Ghanem, B., Li, X., Yang, M.H.: Rap-sam:towards real-time all-purpose segment anything. arXiv preprint (2024)" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 130, + 623, + 482, + 644 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 623, + 482, + 644 + ], + "spans": [ + { + "bbox": [ + 130, + 623, + 482, + 644 + ], + "type": "text", + "content": "65. Yan, B., Jiang, Y., Sun, P., Wang, D., Yuan, Z., Luo, P., Lu, H.: Towards grand unification of object tracking. In: ECCV (2022)" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 130, + 644, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 644, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 644, + 482, + 666 + ], + "type": "text", + "content": "66. Yan, B., Jiang, Y., Wu, J., Wang, D., Luo, P., Yuan, Z., Lu, H.: Universal instance perception as object discovery and retrieval. In: CVPR (2023)" + } + ] + } + ], + "index": 22 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 400, + 91, + 447, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 400, + 91, + 447, + 101 + ], + "spans": [ + { + "bbox": [ + 400, + 91, + 447, + 101 + ], + "type": "text", + "content": "DVIS-DAQ" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 479 + ], + "type": "list", + "angle": 0, + "index": 16, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "text", + "content": "67. Yang, J., Peng, W., Li, X., Guo, Z., Chen, L., Li, B., Ma, Z., Zhou, K., Zhang, W., Loy, C.C., et al.: Panoptic video scene graph generation. In: CVPR (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 139, + 448, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 139, + 448, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 448, + 149 + ], + "type": "text", + "content": "68. Yang, L., Fan, Y., Xu, N.: Video instance segmentation. In: ICCV (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 150, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 480, + 171 + ], + "type": "text", + "content": "69. Yang, S., Fang, Y., Wang, X., Li, Y., Fang, C., Shan, Y., Feng, B., Liu, W.: Crossover learning for fast online video instance segmentation. In: ICCV (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 172, + 480, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 480, + 204 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 480, + 204 + ], + "type": "text", + "content": "70. Ying, K., Zhong, Q., Mao, W., Wang, Z., Chen, H., Wu, L.Y., Liu, Y., Fan, C., Zhuge, Y., Shen, C.: C'tvis: Consistent training for online video instance segmentation. In: ICCV (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 205, + 480, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 480, + 236 + ], + "type": "text", + "content": "71. Yu, F., Chen, H., Wang, X., Xian, W., Chen, Y., Liu, F., Madhavan, V., Darrell, T.: Bdd100k: A diverse driving dataset for heterogeneous multitask learning. In: CVPR (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 237, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 480, + 258 + ], + "type": "text", + "content": "72. Zeng, F., Dong, B., Zhang, Y., Wang, T., Zhang, X., Wei, Y.: Motr: End-to-end multiple-object tracking with transformer. In: ECCV (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 259, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 281 + ], + "type": "text", + "content": "73. Zhang, T., Tian, X., Wu, Y., Ji, S., Wang, X., Zhang, Y., Wan, P.: Dvis: Decoupled video instance segmentation framework. In: ICCV (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 281, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 480, + 314 + ], + "type": "text", + "content": "74. Zhang, T., Tian, X., Zhou, Y., Ji, S., Wang, X., Tao, X., Zhang, Y., Wan, P., Wang, Z., Wu, Y.: Dvis++: Improved decoupled framework for universal video segmentation. arXiv preprint arXiv:2312.13305 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 335 + ], + "type": "text", + "content": "75. Zhang, W., Pang, J., Chen, K., Loy, C.C.: K-net: Towards unified image segmentation. NIPS (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 369 + ], + "type": "text", + "content": "76. Zhang, Y., Sun, P., Jiang, Y., Yu, D., Weng, F., Yuan, Z., Luo, P., Liu, W., Wang, X.: Bytetrack: Multi-object tracking by associating every detection box. ECCV (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 402 + ], + "type": "text", + "content": "77. Zhou, Q., Li, X., He, L., Yang, Y., Cheng, G., Tong, Y., Ma, L., Tao, D.: Transvod: end-to-end video object detection with spatial-temporal transformers. T-PAMI (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 402, + 480, + 434 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 402, + 480, + 434 + ], + "spans": [ + { + "bbox": [ + 132, + 402, + 480, + 434 + ], + "type": "text", + "content": "78. Zhou, Y., Zhang, H., Lee, H., Sun, S., Li, P., Zhu, Y., Yoo, B., Qi, X., Han, J.J.: Slot-vps: Object-centric representation learning for video panoptic segmentation. In: CVPR (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 434, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 434, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 434, + 480, + 456 + ], + "type": "text", + "content": "79. Zhu, J., Yang, H., Liu, N., Kim, M., Zhang, W., Yang, M.H.: Online multi-object tracking with dual matching attention networks. In: ECCV (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 456, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 456, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 456, + 480, + 479 + ], + "type": "text", + "content": "80. Zhu, X., Xiong, Y., Dai, J., Yuan, L., Wei, Y.: Deep feature flow for video recognition. CVPR (2016)" + } + ] + } + ], + "index": 15 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 282, + 102 + ], + "type": "text", + "content": "Y. Zhou and T. Zhang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_content_list.json b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..2e2e05861de953d6c2291b7821172f7548335d25 --- /dev/null +++ b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_content_list.json @@ -0,0 +1,1483 @@ +[ + { + "type": "text", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "text_level": 1, + "bbox": [ + 220, + 140, + 782, + 184 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Siqi Wan $^{1*}$ , Yehao Li $^{2}$ , Jingwen Chen $^{2}$ , Yingwei Pan $^{2}$ , Ting Yao $^{2}$ , Yang Cao $^{1}$ , and Tao Mei $^{2}$", + "bbox": [ + 292, + 210, + 709, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 University of Science and Technology of China", + "bbox": [ + 336, + 253, + 663, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 HiDream.ai Inc.", + "bbox": [ + 439, + 268, + 560, + 281 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "wansiqi4789@mail.ustc.edu.cn, {liyehao, chenjingwen, pandy, tiyao}@hidream.ai forrest@ustc.edu.cn, tmei@hidream.ai", + "bbox": [ + 215, + 282, + 810, + 309 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Diffusion models have led to the revolutionizing of generative modeling in numerous image synthesis tasks. Nevertheless, it is not trivial to directly apply diffusion models for synthesizing an image of a target person wearing a given in-shop garment, i.e., image-based virtual try-on (VTON) task. The difficulty originates from the aspect that the diffusion process should not only produce holistically high-fidelity photorealistic image of the target person, but also locally preserve every appearance and texture detail of the given garment. To address this, we shape a new Diffusion model, namely GarDiff, which triggers the garment-focused diffusion process with amplified guidance of both basic visual appearance and detailed textures (i.e., high-frequency details) derived from the given garment. GarDiff first remoulds a pre-trained latent diffusion model with additional appearance priors derived from the CLIP and VAE encodings of the reference garment. Meanwhile, a novel garment-focused adapter is integrated into the UNet of diffusion model, pursuing local fine-grained alignment with the visual appearance of reference garment and human pose. We specifically design an appearance loss over the synthesized garment to enhance the crucial, high-frequency details. Extensive experiments on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff when compared to state-of-the-art VTON approaches. Code is publicly available at: https://github.com/siqi0905/GarDiff/tree/master.", + "bbox": [ + 259, + 340, + 743, + 648 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Virtual Try-on $\\cdot$ Diffusion Model $\\cdot$ Appearance Prior", + "bbox": [ + 261, + 659, + 700, + 674 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 696, + 375, + 713 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Image-based Virtual Try-ON (VTON), a prominent research topic in computer vision field, aims to synthesize an image of a specific person wearing a desired in-shop garment. Such automatic generation of person images sidesteps the requirement of physical fitting and thus has ushered in a new era of creativity for e-commerce and metaverse. Practical VTON systems have a tremendous potential impact on real-world applications, e.g., online shopping, fashion catalog", + "bbox": [ + 212, + 726, + 787, + 818 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* This work was performed at HiDream.ai.", + "bbox": [ + 230, + 825, + 519, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "creation, etc. The objective of VTON task is three-fold: 1) human body alignment: the synthesized person image should conform to the human body/pose of given specific person; 2) garment fidelity: the synthesized person image should preserve every appearance and texture detail of the in-shop garment; 3) quality: the synthesized person image should be of high-quality with few artifacts.", + "bbox": [ + 212, + 146, + 787, + 223 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/8c02f9c8dd21129337301e43dde4a6d9a6050b5bed292f3b681ac08ac6867989.jpg", + "image_caption": [ + "Fig. 1: Existing GAN-based VTON methods (e.g., VITON-HD [6], HR-VTON [21] and GP-VTON [36]) and Diffusion-based VTON techniques (e.g., LaDI-VTON [25] and DCI-VTON [12]) often fail to perfectly retain every appearance/texture detail of the given garment (e.g., the complex patterns or texts). Instead, our GarDiff exploits garment-focused diffusion process to preserve most of fine-grained details of the given garment, pursuing more controllable person image generation." + ], + "image_footnote": [], + "bbox": [ + 240, + 241, + 756, + 393 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To tackle VTON task, prior works [1,6,8,9,14,24,34,34,38,39] commonly hinge on an explicit warping process to directly deform the appearance of in-shop garment conditioned on the pose of target person. However, this way is often prone to suffer from distortions and artifacts over warped garments, due to the misalignment between warped garment and target person's body. To alleviate this misalignment issue, several subsequent works [10, 15, 21, 22, 36] further upgrade warping process with an additional generative process. They capitalize on the typical Generative Adversarial Networks [11] to synthesize the final person image based on conditions like warped garment and human body. While effective, the synthesized person images still tend to be unsatisfactory in challenging cases (see the unrealistic artifacts in Figure 1 (a), (b) and (c)). This might be attributed to the limited capacity of the underlying generative model (GAN) to synthesize person image with complex patterned garment and variable human pose.", + "bbox": [ + 212, + 507, + 787, + 703 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Recently, Diffusion models [4,5,17,27,29,31,33,41,43] emerge as a new trend of generative modeling in numerous image synthesis tasks, demonstrating better scalability and easier/stable training than GAN-based solutions. Motivated by this, recent advances [12, 25] have been dedicated to remould pre-trained Latent Diffusion Model [29] of text-to-image synthesis by leveraging warped garment as additional condition during diffusion process. Although promising results are attained, these diffusion-based VTON approaches (e.g., LaDI-VTON [25] and DCI-VTON [12]) still fail to completely retain every detail of in-shop garment, especially for high-frequency texture details of complex patterns/texts (see Fig-", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "ure 1 (d) and (e)). We speculate that degenerated results might be caused by holistic diffusion process over latent space where compressed latent code is not capable of memorizing every intricate garment detail and providing sufficient guidance for VTON task.", + "bbox": [ + 212, + 145, + 782, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In an effort to mitigate this problem, our work shapes a new way to upgrade the latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. Technically, we propose a novel Garment-focused Diffusion model (GarDiff) to progressively excavate more prior knowledge about fine-grained garment details. Such prior knowledge acts as amplified garment-focused guidance to improve virtual try-on results. Specifically, CLIP [28] and Variational Auto-encoder (VAE) [20] are employed to encode the reference garment into appearance priors, which is regarded as additional conditions to guide diffusion process. To effectively leverage these priors, a new garment-focused adapter is introduced to the UNet of latent diffusion model. This design triggers the local fine-grained appearance alignment between the synthetic person image and reference garment & human pose. Moreover, a novel appearance loss is defined on the warped reference garment to achieve the guidance of high-frequency prior, which is utilized to supervise the synthesis of high-frequency details in synthesized garment, pursuing better preservation of high-frequency texture details in VTON. Eventually, our GarDiff faithfully produces person images with better-aligned garment details (see Figure 1 (f)).", + "bbox": [ + 212, + 207, + 785, + 464 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The main contribution of this work is the proposal of garment-focused diffusion model that facilitates virtual try-on tasks. This also leads to the elegant view of how a diffusion model should be designed for excavating the garment-focused prior knowledge (e.g., visual appearance and high-frequency texture details) tailored to VTON, and how to improve diffusion process with these amplified garment-focused guidance. Through an extensive set of experiments on VITON-HD and DressCode datasets, our GarDiff consistently achieves competitive performances against state-of-the-art VTON methods.", + "bbox": [ + 212, + 464, + 785, + 585 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 609, + 387, + 625 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "GAN-based Virtual Try-on. To tackle VTON task, prior works [1,6,8-10,14, 15,21,22,24,34,34,36,39] capitalize on the GAN to synthesize the final person image based on the conditions like warped garment and human body. VITON [14] is a pioneering work that employs a refinement network to composite warped garments generated through TPS [3] with the target person. CP-VTON [24] introduces an upgraded learnable TPS transformation for achieving more robust alignment between the target person and the garment. VITON-HD [6] designed an alignment-aware segment generator to fill the misaligned regions with the garment texture through multi-scale refinement. HR-VTON [21] proposes a novel try-on condition generator that unifies the warping and segmentation generation modules for handling the misalignment and occlusion. GP-VTON [36] presents an advanced LFGP warping module for creating deformed garments, which is optimized with a new DGT training strategy.", + "bbox": [ + 212, + 642, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "bbox": [ + 287, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/68252240a77bdbbf947cfd40f6ce45e50497704bd804d9ce054d8ee6461e2e40.jpg", + "image_caption": [ + "Fig. 2: An overview of our GarDiff. The cross-attention layer is substituted with the garment-focused vision adapter in each Transformer block. First, we extract the CLIP visual embeddings $\\mathbf{f}_{clip}$ and VAE embeddings $\\mathbf{f}_{vae}$ of the target garment $\\mathbf{I}_c$ and warped garment $\\mathbf{I}_w$ , respectively. Then the two embeddings are fed into the garment-focused adapter as keys and values via a decoupled cross-attention to guide the diffusion process for pursuing local fine-grained alignment with the appearance of target garment. Meanwhile, we employ a novel appearance loss $\\mathcal{L}_{appearance}$ comprised of spatial perceptual loss $\\mathcal{L}_{spatial}$ and high-frequency promoted loss $\\mathcal{L}_{high-freq}$ over the generated garment to enhance the proficiency of GarDiff in generating high-frequency details." + ], + "image_footnote": [], + "bbox": [ + 246, + 157, + 754, + 390 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Diffusion-based Virtual Try-on. Recently, diffusion models [13, 17, 31] start to dominate in natural image generation due to its superior ability in generating high-fidelity realistic images compared to GAN-based models. Inspired by this, a series of diffusion-based virtual try-on models begin to emerge. TryOnDiffusion [42] unifies two UNets to preserve garment details and warp the garment in a single network. LaDI-VTON [25] introduces the textual inversion component that maps visual features of reference garment to CLIP token embedding space as condition of diffusion model. DCI-VTON [12] further use warping network to warp reference garment, which is fed into diffusion model as an additional guidance. Although promising results are attained, these diffusion-based VTON approaches still fail to completely retain every detail of the reference garment.", + "bbox": [ + 212, + 571, + 787, + 739 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 METHOD", + "text_level": 1, + "bbox": [ + 215, + 762, + 354, + 777 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this work, we propose a Garment-focused Diffusion model (GarDiff), an upgraded latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. In this section, we will first", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/636a3b7e6fd6319e778c919a409d2ef6f3d90fa2b27a2b0c06b1fce73b86aa82.jpg", + "image_caption": [ + "Fig. 3: Implementation details of our garment-focused adapter. For the given target garment $\\mathbf{I}_c$ and warped garment $\\mathbf{I}_w$ , the CLIP visual embeddings $\\mathbf{f}_{clip}$ and VAE embeddings $\\mathbf{f}_{vae}$ are extracted and fed into the garment-focused adapter as the keys and values through a decoupled cross-attention. $\\mathbf{M}_{attn}$ is used to suppress the weights unrelated to garment area in the attention map for generating garment-focused features." + ], + "image_footnote": [], + "bbox": [ + 251, + 165, + 751, + 287 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "provide a concise overview of our GarDiff, followed by the details of the proposed garment-focused vision adapter and appearance loss.", + "bbox": [ + 214, + 424, + 782, + 455 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Overview", + "text_level": 1, + "bbox": [ + 215, + 476, + 339, + 489 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Generally, given a person image $\\mathbf{I}_p\\in \\mathbb{R}^{H\\times W\\times 3}$ and in-shop garment $\\mathbf{I}_c\\in$ $\\mathbb{R}^{H^{\\prime}\\times W^{\\prime}\\times 3}$ , our GarDiff is optimized to synthesize a high-quality realistic image $\\mathbf{I}\\in \\mathbb{R}^{H\\times W\\times 3}$ , where the person wears the in-shop garment $\\mathbf{I}_c$ . To effectively leverage the appearance guidance of the given garment for high-fidelity person image generation, the original cross-attention layers in the UNet of diffusion model are substituted with our proposed garment-focused vision adapter modules. An overview of our GarDiff is illustrated in Figure 2.", + "bbox": [ + 214, + 498, + 784, + 606 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In the forward diffusion process, similar to vanilla diffusion model, we gradually add noise to the target image $\\mathbf{I}$ according to the Markov chain. Specifically, we first utilize the VAE encoder $\\mathcal{E}(\\cdot)$ to map the target image $\\mathbf{I}$ to the latent space: $\\mathbf{x}_0 = \\mathcal{E}(\\mathbf{I})$ . Then we add noise $\\epsilon$ to $\\mathbf{x}_0$ at an arbitrary timestep $t \\in [1, 1000]$ as follows:", + "bbox": [ + 214, + 607, + 784, + 680 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {x} _ {t} = \\sqrt {\\alpha_ {t}} \\mathbf {x} _ {0} + \\sqrt {1 - \\alpha_ {t}} \\epsilon , \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 408, + 681, + 785, + 699 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\alpha_{t} = \\prod_{s=1}^{t}(1 - \\beta_{s}), \\epsilon \\sim \\mathcal{N}(0,1)$ , and $\\beta_{s}$ is the pre-defined variance schedule at timestep $s$ .", + "bbox": [ + 214, + 703, + 782, + 733 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In the reverse diffusion process, we first warp the in-shop garment $\\mathbf{I}_c$ similar to [36] to achieve the maximum conformity of the target garment with the body's posture, obtaining the warped garment $\\mathbf{I}_w \\in \\mathbb{R}^{H' \\times W' \\times 3}$ and warped mask $\\mathbf{m}_w \\in \\{0,1\\}^{H \\times W}$ . The warped mask $\\mathbf{m}_w$ indicates the area of the warped garment. To preserve the area unrelated to the garment, a garment-agnostic image $\\mathbf{I}_a$ with the region intended for garment placement fully masked from the person image $\\mathbf{I}_p$ is also extracted. Then, the noisy image latent $\\mathbf{x}_t$ , the latent warped garment", + "bbox": [ + 214, + 734, + 785, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "bbox": [ + 287, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "map $\\mathbf{x}_w = \\mathcal{E}(\\mathbf{I}_w)$ and the latent agnostic map $\\mathbf{x}_a = \\mathcal{E}(\\mathbf{I}_a)$ are concatenated along the channel dimension, leading to the input of the UNet $\\epsilon_{\\theta}$ [30] of the diffusion model:", + "bbox": [ + 212, + 146, + 782, + 190 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\gamma = \\operatorname {C o n c a t} \\left(\\mathbf {x} _ {w}, \\mathbf {x} _ {a}, \\mathbf {x} _ {t}\\right). \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 193, + 785, + 209 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "During denoising, the UNet is trained to predict the added noise $\\epsilon$ conditioned on the target garment $\\mathbf{I}_c$ and warped garment $\\mathbf{I}_w$ . The objective function is formed as the mean-squared loss:", + "bbox": [ + 214, + 217, + 782, + 262 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {m s e} = \\left\\| \\epsilon - \\epsilon_ {\\theta} (\\gamma , \\mathbf {I} _ {c}, \\mathbf {I} _ {w}, t) \\right\\| _ {2} ^ {2}. \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 276, + 785, + 292 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Garment-Focused Adapter", + "text_level": 1, + "bbox": [ + 215, + 316, + 480, + 333 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To retain the appearance details of the given garment, previous works [12,25,42] merely steer the diffusion process with the garment appearance captured by CLIP vision encoder. However, it is difficult for CLIP vision encoder to perceive the fine-grained details in the target garment, since CLIP is optimized for image-text alignment at a coarse level. In our experiments, we found that VAE, serving as the reconstruction module for stable diffusion, exhibits much stronger capabilities in preserving texture details in images than CLIP. Therefore, it would be beneficial to involve VAE as additional appearance prior into stable diffusion.", + "bbox": [ + 212, + 344, + 784, + 464 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Technically, we replace the cross-attention layer with a vision adapter in each Transformer block. The vision adapter takes two appearance priors as inputs: 1) the VAE embeddings of the warped rendition $\\mathbf{I}_w$ of the target garment $\\mathbf{I}_c$ for recovering the complex patterns in the synthesized image, 2) the CLIP visual embeddings of $\\mathbf{I}_c$ for generating the holistic structure regardless of the imperfection of the warped result $\\mathbf{I}_w$ . Specifically, given the target garment $\\mathbf{I}_c$ and the warped garment $\\mathbf{I}_w$ , the CLIP visual embeddings $\\mathbf{f}_{clip}$ and VAE embeddings $\\mathbf{f}_{vae}$ are calculated as:", + "bbox": [ + 214, + 465, + 787, + 587 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathbf {f} _ {\\text {c l i p}} = \\mathbf {M L P} ^ {\\text {c l i p}} \\left(\\mathbf {C L I P} _ {v} \\left(\\mathbf {I} _ {c}\\right)\\right), \\\\ \\mathbf {f} _ {\\text {c l i p}} = \\mathbf {M L P} ^ {\\text {v a e}} \\left(\\mathbf {S} \\left(\\mathbf {I} _ {c}\\right)\\right) \\end{array} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 599, + 785, + 625 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {f} _ {v a e} = \\mathbf {M L P} ^ {v a e} (\\mathcal {E} (\\mathbf {I} _ {w})),\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 619, + 566, + 633 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{CLIP}_v$ , $\\mathbf{MLP}^{clip}$ , $\\mathbf{MLP}^{vae}$ are the CLIP vision encoder, multi-layer perceptrons for CLIP visual embeddings and VAE embeddings, respectively. Considering the two embeddings focus on different granularity levels of the target garment, a decoupled cross-attention mechanism is devised in the vision adapter to separate the cross-attention layers for the CLIP visual embeddings and VAE embeddings. Given the features $\\mathbf{f}_q$ from the last self-attention layer, the vision adapter operates as follows:", + "bbox": [ + 212, + 648, + 782, + 755 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {Z} _ {a t t n} = S o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {c l i p}) ^ {\\top}}{\\sqrt {d}}) \\mathbf {V} _ {c l i p} + S o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {v a e}) ^ {\\top}}{\\sqrt {d}}) \\mathbf {V} _ {v a e},\n$$\n", + "text_format": "latex", + "bbox": [ + 266, + 768, + 736, + 800 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {Q} = \\mathbf {f} _ {q} \\mathbf {W} ^ {q}, \\mathbf {K} _ {c l i p} = \\mathbf {f} _ {c l i p} \\mathbf {W} _ {c l i p} ^ {k}, \\mathbf {V} _ {c l i p} = \\mathbf {f} _ {c l i p} \\mathbf {W} _ {c l i p} ^ {v}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 290, + 797, + 784, + 821 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {K} _ {v a e} = \\mathbf {f} _ {v a e} \\mathbf {W} _ {v a e} ^ {k}, \\mathbf {V} _ {v a e} = \\mathbf {f} _ {v a e} \\mathbf {W} _ {v a e} ^ {v},\n$$\n", + "text_format": "latex", + "bbox": [ + 382, + 825, + 648, + 842 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\mathbf{W}^q$ , $\\mathbf{W}_*^k$ , $\\mathbf{W}_*^v$ are the trainable projection matrices in the decoupled cross-attention of the vision adapter for queries, keys and values, respectively.", + "bbox": [ + 212, + 145, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "It is relatively easier for the model to achieve favorable results on the regions devoid of garments, such as the torso skin, since those regions usually exhibit simpler patterns or textures. Therefore, improving virtual try-on results hinges critically upon the restoration of the fine-grained details in the given garment. In light of this, we propose to amplify the garment-focused guidance in the diffusion process. Specifically, the vision adapter is further upgraded with a novel garment-focused attention, leading to a garment-focused (GF) adapter that aims to pursue local fine-grained alignment with the visual appearance of the reference garment and human pose. As illustrated in Figure 3, the warped mask $\\mathbf{m}_w$ is downsampled to an attention mask $\\mathbf{M}_{attn}$ that matches the resolution of the corresponding attention layer in the GF adapter, which is leveraged to suppress the attention weights unrelated to garment area in the attention map. Hence, Equation (5) can be reformulated for the garment-focused adapter as follows:", + "bbox": [ + 212, + 176, + 787, + 373 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathbf {Z} _ {\\text {a t t n}} ^ {\\text {m a s k}} = \\left[ \\operatorname {s o f t m a x} \\left(\\frac {\\mathbf {Q} \\left(\\mathbf {K} _ {\\text {c l i p}}\\right) ^ {\\top}}{\\sqrt {d}}\\right) \\odot \\mathbf {M} _ {\\text {a t t n}} \\right] \\times \\mathbf {V} _ {\\text {c l i p}} + \\tag {6} \\\\ [ s o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {v a e}) ^ {\\top}}{\\sqrt {d}}) \\odot \\mathbf {M} _ {a t t n} ] \\times \\mathbf {V} _ {v a e}. \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 321, + 382, + 784, + 450 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.3 Appearance Loss", + "text_level": 1, + "bbox": [ + 214, + 469, + 401, + 484 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Generally, diffusion model is merely optimized with the mean-squared loss defined in Equation (3), which treats all the regions of the synthesized image equally without emphasizing the texture details in the garment area, failing to generate the accurate garment patterns. As complicated details in the in-shop garment typically manifest as high-frequency components (i.e., edges), a novel appearance loss is proposed to enforce the synthesized garment to be geometrically consistent with the high-frequency details of the reference garment, achieving improved fidelity and fine-grained textures. The appearance loss, as a composite adaptation loss, can be decomposed into two components: a spatial perceptual loss $\\mathcal{L}_{\\text{spatial}}$ and a high-frequency promoted loss $\\mathcal{L}_{\\text{high-freq}}$ .", + "bbox": [ + 212, + 491, + 787, + 643 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Specifically, we estimate the latent $\\hat{\\mathbf{x}}_0$ given the noisy one $\\mathbf{x}_t$ and the predicted noise $\\epsilon_t$ from the UNet at timestep $t$ by reversing the process in Equation (1):", + "bbox": [ + 212, + 643, + 785, + 674 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\mathbf {x}} _ {0} = \\frac {\\mathbf {x} _ {t} - \\sqrt {1 - \\alpha_ {t}} \\epsilon_ {t}}{\\sqrt {\\alpha_ {t}}}. \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 424, + 683, + 784, + 718 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The latent $\\hat{\\mathbf{x}}_0$ is further converted back to the pixel space by the VAE decoder $\\mathcal{D}$ , leading to the predicted image $\\hat{\\mathbf{l}}$ .", + "bbox": [ + 214, + 723, + 782, + 753 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Spatial Perceptual Loss. Inspired by the Deep Image Structure and Texture Similarity (DISTS) metric [7], the spatial perceptual loss is designed to capture both the structural and textural disparities between the predicted and ground-truth images in a perceptual feature space beyond pixels:", + "bbox": [ + 212, + 753, + 785, + 816 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {s p a t i a l}} = \\mathcal {L} _ {\\text {D I S T S}} (\\mathbf {I} \\odot \\mathbf {m} _ {w}, \\mathbf {I} \\odot \\mathbf {m} _ {w}). \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 825, + 784, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "bbox": [ + 285, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Note that we use the warped mask $\\mathbf{m}_w$ to emphasize the garment area.", + "bbox": [ + 215, + 146, + 730, + 161 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "High-Frequency Promoted Loss. To substantively enhance the model's proficiency in generating high-frequency details, we employ edge detection to extract high-frequency information. Technically, the horizontal and vertical Sobel kernels are adopted as the high-pass filters to extract the edge maps $\\hat{\\mathbf{I}}_h / \\mathbf{I}_h$ from the predicted/target image, respectively. Formally, the high-frequency promoted loss is defined as:", + "bbox": [ + 212, + 162, + 787, + 252 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {h i g h - f r e q}} = \\left\\| \\tilde {\\mathbf {I}} _ {h} \\odot \\mathbf {m} _ {w} - \\mathbf {I} _ {h} \\odot \\mathbf {m} _ {w} \\right\\| ^ {2}. \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 367, + 263, + 785, + 282 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Finally, the UNet is optimized by the following improved objective function:", + "bbox": [ + 215, + 292, + 764, + 308 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} = \\mathcal {L} _ {m s e} + \\lambda \\mathcal {L} _ {\\text {a p p e a r a n c e}}, \\tag {10} \\\\ \\mathcal {L} _ {\\text {a p p e a r a n c e}} = \\mathcal {L} _ {\\text {s p a t i a l}} + \\mathcal {L} _ {\\text {h i g h - f r e q}}, \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 375, + 320, + 784, + 354 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\lambda$ is the hyper-parameter used to balance the mean-squared loss and the proposed appearance loss.", + "bbox": [ + 214, + 366, + 785, + 396 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 420, + 375, + 436 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Experimental Settings", + "text_level": 1, + "bbox": [ + 215, + 450, + 446, + 467 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Dadatasets. We empirically verify and analyze the effectiveness of our GarDiff on two popular virtual try-on datasets, VITON-HD [6] and DressCode [26]. The VITON-HD dataset [6] comprises 13,679 frontal-view woman and upper garment image pairs. In line with the general practices of the previous works [12,25], the dataset is divided into two disjoint subsets: a training set with 11,647 pairs and a test set with 2,032 pairs. The DressCode dataset consists of 53,795 image pairs, which are categorized into three macro-categories: 15,366 for upper-body clothes, 8,951 pairs lower-body clothes and 29,478 for dresses. Following the original splits, 1,800 image pairs from each category are reserved for test while the remaining image pairs are utilized for training. The experiments on DressCode and VITON-HD are conducted at the resolution of $512 \\times 384$ .", + "bbox": [ + 212, + 477, + 787, + 642 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Evaluation Metrics. We evaluate our GarDiff in both paired and unpaired settings following the virtual try-on literature. In the paired setting, the input garment corresponds to the one originally depicted in the person image. Following the standard evaluation setup, Structural Similarity (SSIM) [35] and Learned Perceptual Image Patch Similarity (LPIPS) [40] are adopted to measure the similarity between the generated image and the ground-truth one. Additionally, the Fréchet Inception Distance(FID) [16] and Kernel Inception Distance(KID) [2] are employed to measure the quality and realism of the generated images. In the unpaired setting, where the garment of the person image is changed to a different one and the ground truth is unavailable, we report the performances of GarDiff in terms of FID and KID.", + "bbox": [ + 212, + 643, + 787, + 808 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Implementation Details. Our GarDiff is initialized from the pre-trained Stable Diffusion 2.1 and finetuned on the virtual try-on datasets. AdamW [23]", + "bbox": [ + 214, + 809, + 785, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/4042e4df8ba9fb429950099c326af3f84f6f5ad6fd805624631b4df546e2a296.jpg", + "table_caption": [ + "Table 1: Quantitative performance comparisons on VITON-HD dataset. $\\mathbf{FID_p} / \\mathbf{KID_p}$ stands for the FID/KID score in paired setting, while $\\mathbf{FID_u} / \\mathbf{KID_u}$ stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100." + ], + "table_footnote": [], + "table_body": "
ModelSSIM ↑LPIPS↓FIDp ↓KIDp ↓FIDu ↓KIDu ↓
VITON-HD [6]0.8430.076--11.640.300
PF-AFN [10]0.8580.082--11.300.283
HR-VTON [21]0.8780.061--9.900.188
GP-VTON [36]0.8940.080--9.20-
Paint-by-Example [37]0.8430.087--10.150.204
LaDI-VTON [25]0.8790.0596.660.1089.410.167
DCI-VTON [12]0.8960.043--8.090.028
GarDiff0.9120.0366.020.0197.890.027
", + "bbox": [ + 282, + 198, + 715, + 313 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "$(\\beta_{1} = 0.9, \\beta_{2} = 0.999)$ is employed to optimize the model for $200\\mathrm{k}$ steps. The learning rate is set to 0.00005 with linear warmup of 500 iterations. The hyperparameter $\\lambda$ in Equation (10) and the weight decay are set to 0.001 and 0.01, respectively. OpenCLIP ViT-H/14 [19] is utilized to extract the CLIP visual embeddings of the target garment. To enable classifier-free guidance [18], the embeddings of the garment are randomly dropped with a probability of 0.05. We train GarDiff on 4 NVidia RTX4090 GPUs for about four days and the model size is 5.15 GB. During inference, the image is progressively generated over 100 steps with a DDIM [32] sampler, and the scale of classifier-free guidance is set to 7.5 by default.", + "bbox": [ + 212, + 340, + 787, + 491 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Quantitative Results", + "text_level": 1, + "bbox": [ + 215, + 513, + 431, + 527 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "VITON-HD. We compare our GarDiff with a series of state-of-the-art virtual try-on methods including GAN-based methods (VITON-HD [6], PF-AFN [10], HR-VTON [21], GP-VTON [36]) and Diffusion-based methods (DCI-VTON [12], Paint-by-Example [37] and LaDI-VTON [25]). Table 1 summarizes the performance comparisons on the VITON-HD dataset. It can be easily observed that our proposed GarDiff consistently demonstrates superior performances compared to the other methods across all the evaluation metrics. In particular, GP-VITON improves VITON-HD by introducing the try-on condition generator that serves as a unified module in warping and segmentation generation stages. Paint-by-Example further boosts the performances by framing the VTON task as exemplar-based image inpainting and filling the target region of source image with the garment in the reference image. By exploiting the textual inversion to maintain the details of the in-shop garment, LaDI-VTON exhibits better performance than Paint-by-Example. Moreover, DCI-VTON leverages a warping network to guide the image generation of diffusion model, leading to clear performance boosts. However, these existing approaches merely steer the generation process at a coarse level, and thus fail to perfectly retain the details of the given garment. On the contrary, our GarDiff facilitates the preservation of the garment's appearance by excavating the garment-focused prior knowledge and strengthening diffusion process with these amplified garment-focused guidance,", + "bbox": [ + 212, + 537, + 787, + 843 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "bbox": [ + 287, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/074c8ec396f237a0511a07e2539b90a4694117dc2824f0d24cdf1ebaa5172578.jpg", + "table_caption": [ + "Table 2: Quantitative performance comparisons on DressCode dataset. $\\mathbf{{FID}}_{\\mathbf{p}}/{\\mathbf{{KID}}}_{\\mathbf{p}}$ stands for the FID/KID score in paired setting, while ${\\mathbf{{FID}}}_{\\mathbf{u}}/{\\mathbf{{KID}}}_{\\mathbf{u}}$ stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100 ." + ], + "table_footnote": [], + "table_body": "
DatasetDC_upper-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9180.07819.701.1622.1812.09
PF-AFN [10]0.918---14.32-
PSAD [26]0.9380.04913.870.64017.517.15
GP-VTON [36]0.9470.036--11.98-
LaDI-VTON [25]0.9280.0499.530.19813.262.67
DCI-VTON [12]-0.030--10.82-
GarDiff0.9520.0308.690.14411.322.34
DatasetDC_lower-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9130.083--18.8510.24
PF-AFN [10]0.907---18.32-
PSAD [26]0.9320.05113.140.55919.688.90
GP-VTON [36]0.9410.042--16.07-
LaDI-VTON [25]0.9220.0518.520.10414.803.13
DCI-VTON [12]-0.035--12.34-
GarDiff0.9390.0358.010.09012.292.88
DatasetDC_dresses
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.8630.12318.751.1121.8312.31
PF-AFN [10]0.869---13.59-
PSAD [26]0.8850.07412.380.46817.076.66
GP-VTON [36]0.8860.072--12.26-
LaDI-VTON [25]0.8680.0899.070.11213.402.50
DCI-VTON [12]-0.068--12.25-
GarDiff0.8910.0658.770.09612.052.09
", + "bbox": [ + 299, + 198, + 704, + 556 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "achieving much better results in VTON task. Specifically, our GarDiff achieves 0.912 on SSIM score and makes a relative improvement of $1.78\\%$ against the best competitor DCI-VTON.", + "bbox": [ + 212, + 583, + 784, + 627 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "DressCode. Table 2 summarizes the performance comparisons on the Dress-Code dataset. Similar to the observations on VITON-HD, our proposed GarDiff surpasses the performances of the other competing methods across all the three macro-categories, which again evinces the pivotal merit of the garment-focused appearance guidance for preserving fine-grained garment attributes in the generated images. Particularly, our GarDiff leads to the relative improvements over LaDI-VTON by $2.58\\%$ on SSIM for upper-body settings.", + "bbox": [ + 212, + 628, + 787, + 734 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.3 Qualitative Results", + "text_level": 1, + "bbox": [ + 215, + 755, + 419, + 768 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Figure 4 showcases several virtual try-on results of different methods, coupled with the input person image and in-shop garment. As evidenced by the presented exemplar results, all the approaches demonstrate a certain degree of proficiency in resembling the appearance and texture details of the input in-shop", + "bbox": [ + 212, + 779, + 785, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/011d3f6b1fe72f6b79b21cfe19675ffe4051f24f4991ac955902138e8d326b60.jpg", + "image_caption": [ + "Fig. 4: Examples generated by VITON-HD, HR-VTON, GP-VTON, LaDI-VTON, DCI-VTON and our GarDiff." + ], + "image_footnote": [], + "bbox": [ + 225, + 152, + 777, + 513 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "garments. Specifically, Diffusion-based methods (LaDI-VTON, DCI-VTON and our GarDiff) consistently outperform the GAN-based approaches (VITON-HD, HR-VTON and GP-VTON) by leveraging the strong capability of diffusion models in generating high-fidelity images. Despite both DCI-VTON and our GarDiff capitalizing on diffusion models, the former approach achieves inferior results to the latter. The underlying rationale lies in the fact that DCI-VTON guides the diffusion process with CLIP visual embeddings of the garment only, while our GarDiff additionally leverages the appearance prior from the VAE encoder through a vision adapter to better preserve the fine-grained details. Moreover, GarDiff is further upgraded with garment-focused attention mechanism and optimized with a new appearance loss to steer the diffusion process with amplified garment-focused guidance, yielding images with enhanced local alignment to the appearance of the garment. For example, our GarDiff better restores the text \"wrangler\" on the garment than DCI-VTON in the fourth row.", + "bbox": [ + 212, + 594, + 787, + 806 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Furthermore, we conduct human study to compare our GarDiff against five strong baselines (HR-VTON, VITON-HD, GP-VTON, Ladi-VTON, DCI-VTON)", + "bbox": [ + 212, + 809, + 792, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "bbox": [ + 287, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/62078bf291cf64b276edf2cd270bd9cbed9cb05f3b0bcbf8e54db2faadb07940.jpg", + "image_caption": [ + "Fig. 5: User study on 100 garment-person pairs randomly sampled from VITON-HD." + ], + "image_footnote": [], + "bbox": [ + 285, + 152, + 718, + 239 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/bac95d87d5da514878071e981f81bfa87235e35a12d59203859bd8d8ff448489.jpg", + "table_caption": [ + "Table 3: Ablation study of our proposed GarDiff on VITON-HD dataset. Base: based model; GFA: garment-focused adapter; AL: appearance loss." + ], + "table_footnote": [], + "table_body": "
ModelSSIM ↑LPIPS↓FIDp↓KIDp↓FIDu↓KIDu
Base0.8090.11710.030.19010.960.473
Base+AL0.8290.0908.720.10310.220.300
Base+GFA0.8980.0526.610.0478.210.069
Base+GFA+AL0.9120.0366.020.0197.890.027
", + "bbox": [ + 294, + 330, + 704, + 398 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "over 100 randomly sampled garment-person pairs in VITON-HD (unpaired setting). 10 evaluators from diverse education background are invited to rank the best VTON result between our GarDiff and the five competing methods based on two criteria: (1) garment detail preservation, (2) human pose alignment. Figure 5 shows the percentages of top-1 ranking for each method, and our GarDiff achieves the best results in both evaluated dimensions.", + "bbox": [ + 212, + 429, + 787, + 521 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 Analysis and Discussions", + "text_level": 1, + "bbox": [ + 215, + 550, + 468, + 565 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation Study on GarDiff. We conduct an ablation study to investigate how each design in our GarDiff influences the overall performances on the VITON-HD dataset. Table 3 details the performance comparisons among different ablated runs of our GarDiff. We start from the stable diffusion inpainting as our base model (Base), which replaces the original CLIP text encoder with the CLIP vision encoder. Base + GFA further boosts Base) by concurrently leveraging the CLIP visual embeddings and VAE embeddings to guide the diffusion process, which verifies the merit of applying the appearance prior from VAE. It is not surprising that Base + AL outperforms Base by supervising the training with the novel appearance loss that facilitates the preservation of garment detail. Finally, our full GarDiff (Base + GFA + AL) achieves the best performances through the synergetic integration of the two proposed components.", + "bbox": [ + 212, + 580, + 787, + 763 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "To illustrate the impact of these components more intuitively, we visualize these ablated runs in Figure 6. Compared with other ablated runs, our final model $\\mathbf{Base} + \\mathbf{GFA} + \\mathbf{AL}$ (i.e., GarDiff) can preserve most of the fine-grained details of the given garments. Take the first case as an example, compared to the base model Base, $\\mathbf{Base} + \\mathbf{GFA}$ effectively retains texture details of the letters.", + "bbox": [ + 212, + 763, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/0ecc8c111f14031d3e2fb99d3cda796e7486b2308a5aadfccbe76ab2f594d129.jpg", + "image_caption": [ + "Fig. 6: Ablation study on the pivotal components of GarDiff." + ], + "image_footnote": [], + "bbox": [ + 233, + 160, + 759, + 349 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Similarly, when the garment-focused vision adapter is additionally integrated into the Base model, the generated results are further improved by $\\mathbf{Base} + \\mathbf{A}\\mathbf{L}$ .", + "bbox": [ + 212, + 426, + 787, + 458 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Effect of Unwarpped Garment. In contrast to the Diffusion-based DCIVTON that merely capitalizes on the warped garment derived from an warping networks for VTON, our GarDiff additionally incorporates the unwarpped garment to faithfully retain the appearance and shape details of the reference garment. In this way, high-quality VTON results can be achieved even when the warped garments predicted from the warping networks are defective. Some examples are shown in Figure 7(a). Regarding the long-sleeve T-shirt on th first row, the warped garment fails to accurately restore the shape of the input garment with one of the sleeves missing. As a result, less favorable outcomes are obtained by solely leveraging the erroneously warped garment. Our GarDiff, employing both the appearance priors over the warped and unwarpped garments, generates high-fidelity images.", + "bbox": [ + 212, + 496, + 787, + 679 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Preservation of Fine-grained Details. With the assistance of the proposed garment-focused attention mechanism and appearance loss, our GarDiff is capable of accurately aligning the visual appearance of the garment in the generated samples with the reference one. Figure 7(b) showcases the images synthesized by Diffusion-based competing methods (LaDI-VTON and DCI-VTON) and our proposed GarDiff, involving the cases with fine-grained details. Compared to LaDIVTON and DCI-VTON which fail to achieve satisfactory results, our GarDiff successfully restores the small letters in the garment on the first row.", + "bbox": [ + 212, + 719, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "bbox": [ + 287, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/9eaaaaa91a643e004ceeacde24515822028a14da93471405e40531cdff7646d2.jpg", + "image_caption": [ + "Fig. 7: (a) Examples generated by our GarDiff with or without unwarpped garment. (b) Comparisons between Diffusion-based baselines (LaDI-VTON and DCI-VTON) and our GarDiff regarding the preservation of fine-grained details." + ], + "image_footnote": [], + "bbox": [ + 228, + 152, + 781, + 366 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 450, + 359, + 465 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we have presented the Garment-focused Diffusion model (GarDiff) that is capable of preserving the fine-grained details of the target garment in the virtual try-on task. Specifically, GarDiff remoulds the pre-trained latent diffusion model with appearance priors from the CLIP vision encoder and the VAE encoder for the reference garment and then integrates these priors into UNet through a garment-focused vision adapter. In this way, the diffusion process is effectively strengthened with the amplified appearance guidance from the given garment. A novel appearance loss is further devised to enforce the synthesized garment to be consistent with the high-frequency details and the geometric shape of target garment. Extensive experiments conducted on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff. More remarkably, we achieve new state-of-the-art performances on the two virtual try-on datasets.", + "bbox": [ + 212, + 481, + 787, + 662 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Broader Impact. Recent advances in generative modeling offer new possibilities for creating and manipulating digital media but also pose risks of generating deceptive content. Our proposed GarDiff might be nefariously used to \"undress\" individuals by substituting their original attire with undergarments for pornographic applications, and we emphatically denounce any such activities.", + "bbox": [ + 212, + 686, + 787, + 762 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Bai, S., Zhou, H., Li, Z., Zhou, C., Yang, H.: Single stage virtual try-on via deformable attention flows. In: ECCV (2022) 2, 3", + "2. Binkowski, M., Sutherland, D.J., Arbel, M., Gretton, A.: Demystifying mmd gans. In: ICLR (2018) 8", + "3. Bookstein, F.L.: Principal warps: Thin-plate splines and the decomposition of deformations. IEEE TPAMI 11(6), 567-585 (1989) 3", + "4. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023) 2", + "5. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023) 2", + "6. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: CVPR (2021) 2, 3, 8, 9", + "7. Ding, K., Ma, K., Wang, S., Simoncelli, E.P.: Image quality assessment: Unifying structure and texture similarity. IEEE TPAMI 44(5), 2567-2581 (2020) 7", + "8. Dong, H., Liang, X., Shen, X., Wu, B., Chen, B.C., Yin, J.: Fw-gan: Flow-navigated warping gan for video virtual try-on. In: ICCV (2019) 2, 3", + "9. Fenocchi, E., Morelli, D., Cornia, M., Baraldi, L., Cesari, F., Cucchiara, R.: Dual-branch collaborative transformer for virtual try-on. In: CVPR Workshops (2022) 2, 3", + "10. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: CVPR (2021) 2, 3, 9, 10", + "1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS (2014) 2", + "2. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: ACM MM (2023) 2, 4, 6, 8, 9, 10", + "3. Gu, S., Chen, D., Bao, J., Wen, F., Zhang, B., Chen, D., Yuan, L., Guo, B.: Vector quantized diffusion model for text-to-image synthesis. In: CVPR (2022) 4", + "4. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: CVPR (2018) 2, 3", + "5. He, S., Song, Y.Z., Xiang, T.: Style-based global appearance flow for virtual try-on. In: CVPR (2022) 2, 3", + "6. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017) 8", + "7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020) 2, 4", + "8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 9", + "9. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., et al.: Openclip. Zenodo 4, 5 (2021) 9", + "20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3", + "21. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: ECCV (2022) 2, 3, 9", + "22. Li, K., Chong, M.J., Zhang, J., Liu, J.: Toward accurate and realistic outfits visualization with attention to details. In: CVPR (2021) 2, 3", + "23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2019) 8" + ], + "bbox": [ + 225, + 176, + 784, + 837 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Virtual Try-On with Garment-focused Diffusion Models", + "bbox": [ + 287, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "24. Minar, M.R., Tuan, T.T., Ahn, H., Rosin, P., Lai, Y.K.: Cp-vton+: Clothing shape and texture preserving image-based virtual try-on. In: CVPR Workshops (2020) 2, 3, 10", + "25. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladi-vton: Latent diffusion textual-inversion enhanced virtual try-on. In: ACM MM (2023) 2, 4, 6, 8, 9, 10", + "26. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: CVPR Workshops (2022) 8, 10", + "27. Qian, Y., Cai, Q., Pan, Y., Li, Y., Yao, T., Sun, Q., Mei, T.: Boosting diffusion models with moving average sampling in frequency domain. In: CVPR (2024) 2", + "28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021) 3", + "29. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer: High-resolution image synthesis with latent diffusion models. In: CVPR (2022) 2", + "30. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015) 6", + "31. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015) 2, 4", + "32. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. In: ICLR (2021) 9", + "33. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: NeurIPS (2019) 2", + "34. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: ECCV (2018) 2, 3", + "35. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE TIP (2004) 8", + "36. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: CVPR (2023) 2, 3, 5, 9, 10", + "37. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: CVPR (2023) 9", + "38. Yang, H., Zhang, R., Guo, X., Liu, W., Zuo, W., Luo, P.: Towards photo-realistic virtual try-on by adaptively generating-preserving image content. In: CVPR (2020) 2", + "39. Yu, R., Wang, X., Xie, X.: Vtnfp: An image-based virtual try-on network with body and clothing feature preservation. In: ICCV (2019) 2, 3", + "40. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018) 8", + "41. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024) 2", + "42. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: CVPR (2023) 4, 6", + "43. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024) 2" + ], + "bbox": [ + 215, + 146, + 785, + 829 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Siqi Wan et al.", + "bbox": [ + 271, + 114, + 372, + 128 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_model.json b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_model.json new file mode 100644 index 0000000000000000000000000000000000000000..69608551251ea8a0b2cdc930e6db4945c259c2cd --- /dev/null +++ b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_model.json @@ -0,0 +1,1981 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.221, + 0.141, + 0.783, + 0.185 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "text", + "bbox": [ + 0.293, + 0.212, + 0.71, + 0.245 + ], + "angle": 0, + "content": "Siqi Wan\\(^{1*}\\), Yehao Li\\(^{2}\\), Jingwen Chen\\(^{2}\\), Yingwei Pan\\(^{2}\\), Ting Yao\\(^{2}\\), Yang Cao\\(^{1}\\), and Tao Mei\\(^{2}\\)" + }, + { + "type": "text", + "bbox": [ + 0.338, + 0.254, + 0.665, + 0.269 + ], + "angle": 0, + "content": "1 University of Science and Technology of China" + }, + { + "type": "text", + "bbox": [ + 0.44, + 0.269, + 0.562, + 0.282 + ], + "angle": 0, + "content": "2 HiDream.ai Inc." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.284, + 0.812, + 0.31 + ], + "angle": 0, + "content": "wansiqi4789@mail.ustc.edu.cn, {liyehao, chenjingwen, pandy, tiyao}@hidream.ai forrest@ustc.edu.cn, tmei@hidream.ai" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.342, + 0.744, + 0.649 + ], + "angle": 0, + "content": "Abstract. Diffusion models have led to the revolutionizing of generative modeling in numerous image synthesis tasks. Nevertheless, it is not trivial to directly apply diffusion models for synthesizing an image of a target person wearing a given in-shop garment, i.e., image-based virtual try-on (VTON) task. The difficulty originates from the aspect that the diffusion process should not only produce holistically high-fidelity photorealistic image of the target person, but also locally preserve every appearance and texture detail of the given garment. To address this, we shape a new Diffusion model, namely GarDiff, which triggers the garment-focused diffusion process with amplified guidance of both basic visual appearance and detailed textures (i.e., high-frequency details) derived from the given garment. GarDiff first remoulds a pre-trained latent diffusion model with additional appearance priors derived from the CLIP and VAE encodings of the reference garment. Meanwhile, a novel garment-focused adapter is integrated into the UNet of diffusion model, pursuing local fine-grained alignment with the visual appearance of reference garment and human pose. We specifically design an appearance loss over the synthesized garment to enhance the crucial, high-frequency details. Extensive experiments on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff when compared to state-of-the-art VTON approaches. Code is publicly available at: https://github.com/siqi0905/GarDiff/tree/master." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.66, + 0.702, + 0.675 + ], + "angle": 0, + "content": "Keywords: Virtual Try-on \\(\\cdot\\) Diffusion Model \\(\\cdot\\) Appearance Prior" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.698, + 0.377, + 0.714 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.727, + 0.788, + 0.819 + ], + "angle": 0, + "content": "Image-based Virtual Try-ON (VTON), a prominent research topic in computer vision field, aims to synthesize an image of a specific person wearing a desired in-shop garment. Such automatic generation of person images sidesteps the requirement of physical fitting and thus has ushered in a new era of creativity for e-commerce and metaverse. Practical VTON systems have a tremendous potential impact on real-world applications, e.g., online shopping, fashion catalog" + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.826, + 0.521, + 0.84 + ], + "angle": 0, + "content": "* This work was performed at HiDream.ai." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.224 + ], + "angle": 0, + "content": "creation, etc. The objective of VTON task is three-fold: 1) human body alignment: the synthesized person image should conform to the human body/pose of given specific person; 2) garment fidelity: the synthesized person image should preserve every appearance and texture detail of the in-shop garment; 3) quality: the synthesized person image should be of high-quality with few artifacts." + }, + { + "type": "image", + "bbox": [ + 0.241, + 0.242, + 0.758, + 0.395 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.412, + 0.788, + 0.497 + ], + "angle": 0, + "content": "Fig. 1: Existing GAN-based VTON methods (e.g., VITON-HD [6], HR-VTON [21] and GP-VTON [36]) and Diffusion-based VTON techniques (e.g., LaDI-VTON [25] and DCI-VTON [12]) often fail to perfectly retain every appearance/texture detail of the given garment (e.g., the complex patterns or texts). Instead, our GarDiff exploits garment-focused diffusion process to preserve most of fine-grained details of the given garment, pursuing more controllable person image generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.704 + ], + "angle": 0, + "content": "To tackle VTON task, prior works [1,6,8,9,14,24,34,34,38,39] commonly hinge on an explicit warping process to directly deform the appearance of in-shop garment conditioned on the pose of target person. However, this way is often prone to suffer from distortions and artifacts over warped garments, due to the misalignment between warped garment and target person's body. To alleviate this misalignment issue, several subsequent works [10, 15, 21, 22, 36] further upgrade warping process with an additional generative process. They capitalize on the typical Generative Adversarial Networks [11] to synthesize the final person image based on conditions like warped garment and human body. While effective, the synthesized person images still tend to be unsatisfactory in challenging cases (see the unrealistic artifacts in Figure 1 (a), (b) and (c)). This might be attributed to the limited capacity of the underlying generative model (GAN) to synthesize person image with complex patterned garment and variable human pose." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Recently, Diffusion models [4,5,17,27,29,31,33,41,43] emerge as a new trend of generative modeling in numerous image synthesis tasks, demonstrating better scalability and easier/stable training than GAN-based solutions. Motivated by this, recent advances [12, 25] have been dedicated to remould pre-trained Latent Diffusion Model [29] of text-to-image synthesis by leveraging warped garment as additional condition during diffusion process. Although promising results are attained, these diffusion-based VTON approaches (e.g., LaDI-VTON [25] and DCI-VTON [12]) still fail to completely retain every detail of in-shop garment, especially for high-frequency texture details of complex patterns/texts (see Fig-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.288, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.784, + 0.207 + ], + "angle": 0, + "content": "ure 1 (d) and (e)). We speculate that degenerated results might be caused by holistic diffusion process over latent space where compressed latent code is not capable of memorizing every intricate garment detail and providing sufficient guidance for VTON task." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.208, + 0.786, + 0.465 + ], + "angle": 0, + "content": "In an effort to mitigate this problem, our work shapes a new way to upgrade the latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. Technically, we propose a novel Garment-focused Diffusion model (GarDiff) to progressively excavate more prior knowledge about fine-grained garment details. Such prior knowledge acts as amplified garment-focused guidance to improve virtual try-on results. Specifically, CLIP [28] and Variational Auto-encoder (VAE) [20] are employed to encode the reference garment into appearance priors, which is regarded as additional conditions to guide diffusion process. To effectively leverage these priors, a new garment-focused adapter is introduced to the UNet of latent diffusion model. This design triggers the local fine-grained appearance alignment between the synthetic person image and reference garment & human pose. Moreover, a novel appearance loss is defined on the warped reference garment to achieve the guidance of high-frequency prior, which is utilized to supervise the synthesis of high-frequency details in synthesized garment, pursuing better preservation of high-frequency texture details in VTON. Eventually, our GarDiff faithfully produces person images with better-aligned garment details (see Figure 1 (f))." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.465, + 0.787, + 0.586 + ], + "angle": 0, + "content": "The main contribution of this work is the proposal of garment-focused diffusion model that facilitates virtual try-on tasks. This also leads to the elegant view of how a diffusion model should be designed for excavating the garment-focused prior knowledge (e.g., visual appearance and high-frequency texture details) tailored to VTON, and how to improve diffusion process with these amplified garment-focused guidance. Through an extensive set of experiments on VITON-HD and DressCode datasets, our GarDiff consistently achieves competitive performances against state-of-the-art VTON methods." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.61, + 0.388, + 0.626 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.643, + 0.788, + 0.841 + ], + "angle": 0, + "content": "GAN-based Virtual Try-on. To tackle VTON task, prior works [1,6,8-10,14, 15,21,22,24,34,34,36,39] capitalize on the GAN to synthesize the final person image based on the conditions like warped garment and human body. VITON [14] is a pioneering work that employs a refinement network to composite warped garments generated through TPS [3] with the target person. CP-VTON [24] introduces an upgraded learnable TPS transformation for achieving more robust alignment between the target person and the garment. VITON-HD [6] designed an alignment-aware segment generator to fill the misaligned regions with the garment texture through multi-scale refinement. HR-VTON [21] proposes a novel try-on condition generator that unifies the warping and segmentation generation modules for handling the misalignment and occlusion. GP-VTON [36] presents an advanced LFGP warping module for creating deformed garments, which is optimized with a new DGT training strategy." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "image", + "bbox": [ + 0.248, + 0.159, + 0.756, + 0.391 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.417, + 0.788, + 0.543 + ], + "angle": 0, + "content": "Fig. 2: An overview of our GarDiff. The cross-attention layer is substituted with the garment-focused vision adapter in each Transformer block. First, we extract the CLIP visual embeddings \\(\\mathbf{f}_{clip}\\) and VAE embeddings \\(\\mathbf{f}_{vae}\\) of the target garment \\(\\mathbf{I}_c\\) and warped garment \\(\\mathbf{I}_w\\), respectively. Then the two embeddings are fed into the garment-focused adapter as keys and values via a decoupled cross-attention to guide the diffusion process for pursuing local fine-grained alignment with the appearance of target garment. Meanwhile, we employ a novel appearance loss \\(\\mathcal{L}_{appearance}\\) comprised of spatial perceptual loss \\(\\mathcal{L}_{spatial}\\) and high-frequency promoted loss \\(\\mathcal{L}_{high-freq}\\) over the generated garment to enhance the proficiency of GarDiff in generating high-frequency details." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.572, + 0.788, + 0.74 + ], + "angle": 0, + "content": "Diffusion-based Virtual Try-on. Recently, diffusion models [13, 17, 31] start to dominate in natural image generation due to its superior ability in generating high-fidelity realistic images compared to GAN-based models. Inspired by this, a series of diffusion-based virtual try-on models begin to emerge. TryOnDiffusion [42] unifies two UNets to preserve garment details and warp the garment in a single network. LaDI-VTON [25] introduces the textual inversion component that maps visual features of reference garment to CLIP token embedding space as condition of diffusion model. DCI-VTON [12] further use warping network to warp reference garment, which is fed into diffusion model as an additional guidance. Although promising results are attained, these diffusion-based VTON approaches still fail to completely retain every detail of the reference garment." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.763, + 0.355, + 0.779 + ], + "angle": 0, + "content": "3 METHOD" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "In this work, we propose a Garment-focused Diffusion model (GarDiff), an upgraded latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. In this section, we will first" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.288, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.253, + 0.166, + 0.753, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.327, + 0.785, + 0.397 + ], + "angle": 0, + "content": "Fig. 3: Implementation details of our garment-focused adapter. For the given target garment \\(\\mathbf{I}_c\\) and warped garment \\(\\mathbf{I}_w\\), the CLIP visual embeddings \\(\\mathbf{f}_{clip}\\) and VAE embeddings \\(\\mathbf{f}_{vae}\\) are extracted and fed into the garment-focused adapter as the keys and values through a decoupled cross-attention. \\(\\mathbf{M}_{attn}\\) is used to suppress the weights unrelated to garment area in the attention map for generating garment-focused features." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.425, + 0.784, + 0.456 + ], + "angle": 0, + "content": "provide a concise overview of our GarDiff, followed by the details of the proposed garment-focused vision adapter and appearance loss." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.477, + 0.341, + 0.49 + ], + "angle": 0, + "content": "3.1 Overview" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.499, + 0.785, + 0.607 + ], + "angle": 0, + "content": "Generally, given a person image \\(\\mathbf{I}_p\\in \\mathbb{R}^{H\\times W\\times 3}\\) and in-shop garment \\(\\mathbf{I}_c\\in\\) \\(\\mathbb{R}^{H^{\\prime}\\times W^{\\prime}\\times 3}\\), our GarDiff is optimized to synthesize a high-quality realistic image \\(\\mathbf{I}\\in \\mathbb{R}^{H\\times W\\times 3}\\), where the person wears the in-shop garment \\(\\mathbf{I}_c\\). To effectively leverage the appearance guidance of the given garment for high-fidelity person image generation, the original cross-attention layers in the UNet of diffusion model are substituted with our proposed garment-focused vision adapter modules. An overview of our GarDiff is illustrated in Figure 2." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.608, + 0.785, + 0.681 + ], + "angle": 0, + "content": "In the forward diffusion process, similar to vanilla diffusion model, we gradually add noise to the target image \\(\\mathbf{I}\\) according to the Markov chain. Specifically, we first utilize the VAE encoder \\(\\mathcal{E}(\\cdot)\\) to map the target image \\(\\mathbf{I}\\) to the latent space: \\(\\mathbf{x}_0 = \\mathcal{E}(\\mathbf{I})\\). Then we add noise \\(\\epsilon\\) to \\(\\mathbf{x}_0\\) at an arbitrary timestep \\(t \\in [1, 1000]\\) as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.41, + 0.682, + 0.786, + 0.7 + ], + "angle": 0, + "content": "\\[\n\\mathbf {x} _ {t} = \\sqrt {\\alpha_ {t}} \\mathbf {x} _ {0} + \\sqrt {1 - \\alpha_ {t}} \\epsilon , \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.704, + 0.784, + 0.734 + ], + "angle": 0, + "content": "where \\(\\alpha_{t} = \\prod_{s=1}^{t}(1 - \\beta_{s}), \\epsilon \\sim \\mathcal{N}(0,1)\\), and \\(\\beta_{s}\\) is the pre-defined variance schedule at timestep \\(s\\)." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.735, + 0.786, + 0.842 + ], + "angle": 0, + "content": "In the reverse diffusion process, we first warp the in-shop garment \\(\\mathbf{I}_c\\) similar to [36] to achieve the maximum conformity of the target garment with the body's posture, obtaining the warped garment \\(\\mathbf{I}_w \\in \\mathbb{R}^{H' \\times W' \\times 3}\\) and warped mask \\(\\mathbf{m}_w \\in \\{0,1\\}^{H \\times W}\\). The warped mask \\(\\mathbf{m}_w\\) indicates the area of the warped garment. To preserve the area unrelated to the garment, a garment-agnostic image \\(\\mathbf{I}_a\\) with the region intended for garment placement fully masked from the person image \\(\\mathbf{I}_p\\) is also extracted. Then, the noisy image latent \\(\\mathbf{x}_t\\), the latent warped garment" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.191 + ], + "angle": 0, + "content": "map \\(\\mathbf{x}_w = \\mathcal{E}(\\mathbf{I}_w)\\) and the latent agnostic map \\(\\mathbf{x}_a = \\mathcal{E}(\\mathbf{I}_a)\\) are concatenated along the channel dimension, leading to the input of the UNet \\(\\epsilon_{\\theta}\\) [30] of the diffusion model:" + }, + { + "type": "equation", + "bbox": [ + 0.417, + 0.194, + 0.786, + 0.21 + ], + "angle": 0, + "content": "\\[\n\\gamma = \\operatorname {C o n c a t} \\left(\\mathbf {x} _ {w}, \\mathbf {x} _ {a}, \\mathbf {x} _ {t}\\right). \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.218, + 0.784, + 0.263 + ], + "angle": 0, + "content": "During denoising, the UNet is trained to predict the added noise \\(\\epsilon\\) conditioned on the target garment \\(\\mathbf{I}_c\\) and warped garment \\(\\mathbf{I}_w\\). The objective function is formed as the mean-squared loss:" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.277, + 0.786, + 0.294 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {m s e} = \\left\\| \\epsilon - \\epsilon_ {\\theta} (\\gamma , \\mathbf {I} _ {c}, \\mathbf {I} _ {w}, t) \\right\\| _ {2} ^ {2}. \\tag {3}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.317, + 0.482, + 0.334 + ], + "angle": 0, + "content": "3.2 Garment-Focused Adapter" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.345, + 0.785, + 0.465 + ], + "angle": 0, + "content": "To retain the appearance details of the given garment, previous works [12,25,42] merely steer the diffusion process with the garment appearance captured by CLIP vision encoder. However, it is difficult for CLIP vision encoder to perceive the fine-grained details in the target garment, since CLIP is optimized for image-text alignment at a coarse level. In our experiments, we found that VAE, serving as the reconstruction module for stable diffusion, exhibits much stronger capabilities in preserving texture details in images than CLIP. Therefore, it would be beneficial to involve VAE as additional appearance prior into stable diffusion." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.467, + 0.788, + 0.588 + ], + "angle": 0, + "content": "Technically, we replace the cross-attention layer with a vision adapter in each Transformer block. The vision adapter takes two appearance priors as inputs: 1) the VAE embeddings of the warped rendition \\(\\mathbf{I}_w\\) of the target garment \\(\\mathbf{I}_c\\) for recovering the complex patterns in the synthesized image, 2) the CLIP visual embeddings of \\(\\mathbf{I}_c\\) for generating the holistic structure regardless of the imperfection of the warped result \\(\\mathbf{I}_w\\). Specifically, given the target garment \\(\\mathbf{I}_c\\) and the warped garment \\(\\mathbf{I}_w\\), the CLIP visual embeddings \\(\\mathbf{f}_{clip}\\) and VAE embeddings \\(\\mathbf{f}_{vae}\\) are calculated as:" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.6, + 0.786, + 0.626 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathbf {f} _ {\\text {c l i p}} = \\mathbf {M L P} ^ {\\text {c l i p}} \\left(\\mathbf {C L I P} _ {v} \\left(\\mathbf {I} _ {c}\\right)\\right), \\\\ \\mathbf {f} _ {\\text {c l i p}} = \\mathbf {M L P} ^ {\\text {v a e}} \\left(\\mathbf {S} \\left(\\mathbf {I} _ {c}\\right)\\right) \\end{array} \\tag {4}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.621, + 0.567, + 0.635 + ], + "angle": 0, + "content": "\\[\n\\mathbf {f} _ {v a e} = \\mathbf {M L P} ^ {v a e} (\\mathcal {E} (\\mathbf {I} _ {w})),\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.65, + 0.784, + 0.756 + ], + "angle": 0, + "content": "where \\(\\mathbf{CLIP}_v\\), \\(\\mathbf{MLP}^{clip}\\), \\(\\mathbf{MLP}^{vae}\\) are the CLIP vision encoder, multi-layer perceptrons for CLIP visual embeddings and VAE embeddings, respectively. Considering the two embeddings focus on different granularity levels of the target garment, a decoupled cross-attention mechanism is devised in the vision adapter to separate the cross-attention layers for the CLIP visual embeddings and VAE embeddings. Given the features \\(\\mathbf{f}_q\\) from the last self-attention layer, the vision adapter operates as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.267, + 0.769, + 0.737, + 0.801 + ], + "angle": 0, + "content": "\\[\n\\mathbf {Z} _ {a t t n} = S o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {c l i p}) ^ {\\top}}{\\sqrt {d}}) \\mathbf {V} _ {c l i p} + S o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {v a e}) ^ {\\top}}{\\sqrt {d}}) \\mathbf {V} _ {v a e},\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.292, + 0.799, + 0.785, + 0.823 + ], + "angle": 0, + "content": "\\[\n\\mathbf {Q} = \\mathbf {f} _ {q} \\mathbf {W} ^ {q}, \\mathbf {K} _ {c l i p} = \\mathbf {f} _ {c l i p} \\mathbf {W} _ {c l i p} ^ {k}, \\mathbf {V} _ {c l i p} = \\mathbf {f} _ {c l i p} \\mathbf {W} _ {c l i p} ^ {v}, \\tag {5}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.383, + 0.827, + 0.649, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\mathbf {K} _ {v a e} = \\mathbf {f} _ {v a e} \\mathbf {W} _ {v a e} ^ {k}, \\mathbf {V} _ {v a e} = \\mathbf {f} _ {v a e} \\mathbf {W} _ {v a e} ^ {v},\n\\]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.287, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.784, + 0.177 + ], + "angle": 0, + "content": "where \\(\\mathbf{W}^q\\), \\(\\mathbf{W}_*^k\\), \\(\\mathbf{W}_*^v\\) are the trainable projection matrices in the decoupled cross-attention of the vision adapter for queries, keys and values, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.374 + ], + "angle": 0, + "content": "It is relatively easier for the model to achieve favorable results on the regions devoid of garments, such as the torso skin, since those regions usually exhibit simpler patterns or textures. Therefore, improving virtual try-on results hinges critically upon the restoration of the fine-grained details in the given garment. In light of this, we propose to amplify the garment-focused guidance in the diffusion process. Specifically, the vision adapter is further upgraded with a novel garment-focused attention, leading to a garment-focused (GF) adapter that aims to pursue local fine-grained alignment with the visual appearance of the reference garment and human pose. As illustrated in Figure 3, the warped mask \\(\\mathbf{m}_w\\) is downsampled to an attention mask \\(\\mathbf{M}_{attn}\\) that matches the resolution of the corresponding attention layer in the GF adapter, which is leveraged to suppress the attention weights unrelated to garment area in the attention map. Hence, Equation (5) can be reformulated for the garment-focused adapter as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.323, + 0.383, + 0.785, + 0.452 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathbf {Z} _ {\\text {a t t n}} ^ {\\text {m a s k}} = \\left[ \\operatorname {s o f t m a x} \\left(\\frac {\\mathbf {Q} \\left(\\mathbf {K} _ {\\text {c l i p}}\\right) ^ {\\top}}{\\sqrt {d}}\\right) \\odot \\mathbf {M} _ {\\text {a t t n}} \\right] \\times \\mathbf {V} _ {\\text {c l i p}} + \\tag {6} \\\\ [ s o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {v a e}) ^ {\\top}}{\\sqrt {d}}) \\odot \\mathbf {M} _ {a t t n} ] \\times \\mathbf {V} _ {v a e}. \\\\ \\end{array}\n\\]" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.47, + 0.403, + 0.485 + ], + "angle": 0, + "content": "3.3 Appearance Loss" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.788, + 0.644 + ], + "angle": 0, + "content": "Generally, diffusion model is merely optimized with the mean-squared loss defined in Equation (3), which treats all the regions of the synthesized image equally without emphasizing the texture details in the garment area, failing to generate the accurate garment patterns. As complicated details in the in-shop garment typically manifest as high-frequency components (i.e., edges), a novel appearance loss is proposed to enforce the synthesized garment to be geometrically consistent with the high-frequency details of the reference garment, achieving improved fidelity and fine-grained textures. The appearance loss, as a composite adaptation loss, can be decomposed into two components: a spatial perceptual loss \\(\\mathcal{L}_{\\text{spatial}}\\) and a high-frequency promoted loss \\(\\mathcal{L}_{\\text{high-freq}}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.786, + 0.675 + ], + "angle": 0, + "content": "Specifically, we estimate the latent \\(\\hat{\\mathbf{x}}_0\\) given the noisy one \\(\\mathbf{x}_t\\) and the predicted noise \\(\\epsilon_t\\) from the UNet at timestep \\(t\\) by reversing the process in Equation (1):" + }, + { + "type": "equation", + "bbox": [ + 0.425, + 0.684, + 0.785, + 0.719 + ], + "angle": 0, + "content": "\\[\n\\hat {\\mathbf {x}} _ {0} = \\frac {\\mathbf {x} _ {t} - \\sqrt {1 - \\alpha_ {t}} \\epsilon_ {t}}{\\sqrt {\\alpha_ {t}}}. \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.724, + 0.784, + 0.754 + ], + "angle": 0, + "content": "The latent \\(\\hat{\\mathbf{x}}_0\\) is further converted back to the pixel space by the VAE decoder \\(\\mathcal{D}\\), leading to the predicted image \\(\\hat{\\mathbf{l}}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.786, + 0.817 + ], + "angle": 0, + "content": "Spatial Perceptual Loss. Inspired by the Deep Image Structure and Texture Similarity (DISTS) metric [7], the spatial perceptual loss is designed to capture both the structural and textural disparities between the predicted and ground-truth images in a perceptual feature space beyond pixels:" + }, + { + "type": "equation", + "bbox": [ + 0.371, + 0.826, + 0.785, + 0.842 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {s p a t i a l}} = \\mathcal {L} _ {\\text {D I S T S}} (\\mathbf {I} \\odot \\mathbf {m} _ {w}, \\mathbf {I} \\odot \\mathbf {m} _ {w}). \\tag {8}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.731, + 0.162 + ], + "angle": 0, + "content": "Note that we use the warped mask \\(\\mathbf{m}_w\\) to emphasize the garment area." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.163, + 0.788, + 0.253 + ], + "angle": 0, + "content": "High-Frequency Promoted Loss. To substantively enhance the model's proficiency in generating high-frequency details, we employ edge detection to extract high-frequency information. Technically, the horizontal and vertical Sobel kernels are adopted as the high-pass filters to extract the edge maps \\(\\hat{\\mathbf{I}}_h / \\mathbf{I}_h\\) from the predicted/target image, respectively. Formally, the high-frequency promoted loss is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.368, + 0.265, + 0.786, + 0.283 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {h i g h - f r e q}} = \\left\\| \\tilde {\\mathbf {I}} _ {h} \\odot \\mathbf {m} _ {w} - \\mathbf {I} _ {h} \\odot \\mathbf {m} _ {w} \\right\\| ^ {2}. \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.293, + 0.766, + 0.309 + ], + "angle": 0, + "content": "Finally, the UNet is optimized by the following improved objective function:" + }, + { + "type": "equation", + "bbox": [ + 0.376, + 0.321, + 0.785, + 0.356 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} = \\mathcal {L} _ {m s e} + \\lambda \\mathcal {L} _ {\\text {a p p e a r a n c e}}, \\tag {10} \\\\ \\mathcal {L} _ {\\text {a p p e a r a n c e}} = \\mathcal {L} _ {\\text {s p a t i a l}} + \\mathcal {L} _ {\\text {h i g h - f r e q}}, \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.367, + 0.786, + 0.397 + ], + "angle": 0, + "content": "where \\(\\lambda\\) is the hyper-parameter used to balance the mean-squared loss and the proposed appearance loss." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.421, + 0.377, + 0.438 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.452, + 0.447, + 0.468 + ], + "angle": 0, + "content": "4.1 Experimental Settings" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.788, + 0.643 + ], + "angle": 0, + "content": "Dadatasets. We empirically verify and analyze the effectiveness of our GarDiff on two popular virtual try-on datasets, VITON-HD [6] and DressCode [26]. The VITON-HD dataset [6] comprises 13,679 frontal-view woman and upper garment image pairs. In line with the general practices of the previous works [12,25], the dataset is divided into two disjoint subsets: a training set with 11,647 pairs and a test set with 2,032 pairs. The DressCode dataset consists of 53,795 image pairs, which are categorized into three macro-categories: 15,366 for upper-body clothes, 8,951 pairs lower-body clothes and 29,478 for dresses. Following the original splits, 1,800 image pairs from each category are reserved for test while the remaining image pairs are utilized for training. The experiments on DressCode and VITON-HD are conducted at the resolution of \\(512 \\times 384\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.809 + ], + "angle": 0, + "content": "Evaluation Metrics. We evaluate our GarDiff in both paired and unpaired settings following the virtual try-on literature. In the paired setting, the input garment corresponds to the one originally depicted in the person image. Following the standard evaluation setup, Structural Similarity (SSIM) [35] and Learned Perceptual Image Patch Similarity (LPIPS) [40] are adopted to measure the similarity between the generated image and the ground-truth one. Additionally, the Fréchet Inception Distance(FID) [16] and Kernel Inception Distance(KID) [2] are employed to measure the quality and realism of the generated images. In the unpaired setting, where the garment of the person image is changed to a different one and the ground truth is unavailable, we report the performances of GarDiff in terms of FID and KID." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Implementation Details. Our GarDiff is initialized from the pre-trained Stable Diffusion 2.1 and finetuned on the virtual try-on datasets. AdamW [23]" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.288, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Table 1: Quantitative performance comparisons on VITON-HD dataset. \\( \\mathbf{FID_p} / \\mathbf{KID_p} \\) stands for the FID/KID score in paired setting, while \\( \\mathbf{FID_u} / \\mathbf{KID_u} \\) stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100." + }, + { + "type": "table", + "bbox": [ + 0.284, + 0.199, + 0.716, + 0.314 + ], + "angle": 0, + "content": "
ModelSSIM ↑LPIPS↓FIDp ↓KIDp ↓FIDu ↓KIDu ↓
VITON-HD [6]0.8430.076--11.640.300
PF-AFN [10]0.8580.082--11.300.283
HR-VTON [21]0.8780.061--9.900.188
GP-VTON [36]0.8940.080--9.20-
Paint-by-Example [37]0.8430.087--10.150.204
LaDI-VTON [25]0.8790.0596.660.1089.410.167
DCI-VTON [12]0.8960.043--8.090.028
GarDiff0.9120.0366.020.0197.890.027
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.341, + 0.788, + 0.492 + ], + "angle": 0, + "content": "\\((\\beta_{1} = 0.9, \\beta_{2} = 0.999)\\) is employed to optimize the model for \\(200\\mathrm{k}\\) steps. The learning rate is set to 0.00005 with linear warmup of 500 iterations. The hyperparameter \\(\\lambda\\) in Equation (10) and the weight decay are set to 0.001 and 0.01, respectively. OpenCLIP ViT-H/14 [19] is utilized to extract the CLIP visual embeddings of the target garment. To enable classifier-free guidance [18], the embeddings of the garment are randomly dropped with a probability of 0.05. We train GarDiff on 4 NVidia RTX4090 GPUs for about four days and the model size is 5.15 GB. During inference, the image is progressively generated over 100 steps with a DDIM [32] sampler, and the scale of classifier-free guidance is set to 7.5 by default." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.514, + 0.433, + 0.529 + ], + "angle": 0, + "content": "4.2 Quantitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.538, + 0.789, + 0.844 + ], + "angle": 0, + "content": "VITON-HD. We compare our GarDiff with a series of state-of-the-art virtual try-on methods including GAN-based methods (VITON-HD [6], PF-AFN [10], HR-VTON [21], GP-VTON [36]) and Diffusion-based methods (DCI-VTON [12], Paint-by-Example [37] and LaDI-VTON [25]). Table 1 summarizes the performance comparisons on the VITON-HD dataset. It can be easily observed that our proposed GarDiff consistently demonstrates superior performances compared to the other methods across all the evaluation metrics. In particular, GP-VITON improves VITON-HD by introducing the try-on condition generator that serves as a unified module in warping and segmentation generation stages. Paint-by-Example further boosts the performances by framing the VTON task as exemplar-based image inpainting and filling the target region of source image with the garment in the reference image. By exploiting the textual inversion to maintain the details of the in-shop garment, LaDI-VTON exhibits better performance than Paint-by-Example. Moreover, DCI-VTON leverages a warping network to guide the image generation of diffusion model, leading to clear performance boosts. However, these existing approaches merely steer the generation process at a coarse level, and thus fail to perfectly retain the details of the given garment. On the contrary, our GarDiff facilitates the preservation of the garment's appearance by excavating the garment-focused prior knowledge and strengthening diffusion process with these amplified garment-focused guidance," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Table 2: Quantitative performance comparisons on DressCode dataset. \\( \\mathbf{{FID}}_{\\mathbf{p}}/{\\mathbf{{KID}}}_{\\mathbf{p}} \\) stands for the FID/KID score in paired setting, while \\( {\\mathbf{{FID}}}_{\\mathbf{u}}/{\\mathbf{{KID}}}_{\\mathbf{u}} \\) stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100 ." + }, + { + "type": "table", + "bbox": [ + 0.3, + 0.199, + 0.705, + 0.558 + ], + "angle": 0, + "content": "
DatasetDC_upper-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9180.07819.701.1622.1812.09
PF-AFN [10]0.918---14.32-
PSAD [26]0.9380.04913.870.64017.517.15
GP-VTON [36]0.9470.036--11.98-
LaDI-VTON [25]0.9280.0499.530.19813.262.67
DCI-VTON [12]-0.030--10.82-
GarDiff0.9520.0308.690.14411.322.34
DatasetDC_lower-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9130.083--18.8510.24
PF-AFN [10]0.907---18.32-
PSAD [26]0.9320.05113.140.55919.688.90
GP-VTON [36]0.9410.042--16.07-
LaDI-VTON [25]0.9220.0518.520.10414.803.13
DCI-VTON [12]-0.035--12.34-
GarDiff0.9390.0358.010.09012.292.88
DatasetDC_dresses
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.8630.12318.751.1121.8312.31
PF-AFN [10]0.869---13.59-
PSAD [26]0.8850.07412.380.46817.076.66
GP-VTON [36]0.8860.072--12.26-
LaDI-VTON [25]0.8680.0899.070.11213.402.50
DCI-VTON [12]-0.068--12.25-
GarDiff0.8910.0658.770.09612.052.09
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.584, + 0.785, + 0.628 + ], + "angle": 0, + "content": "achieving much better results in VTON task. Specifically, our GarDiff achieves 0.912 on SSIM score and makes a relative improvement of \\(1.78\\%\\) against the best competitor DCI-VTON." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.63, + 0.788, + 0.735 + ], + "angle": 0, + "content": "DressCode. Table 2 summarizes the performance comparisons on the Dress-Code dataset. Similar to the observations on VITON-HD, our proposed GarDiff surpasses the performances of the other competing methods across all the three macro-categories, which again evinces the pivotal merit of the garment-focused appearance guidance for preserving fine-grained garment attributes in the generated images. Particularly, our GarDiff leads to the relative improvements over LaDI-VTON by \\(2.58\\%\\) on SSIM for upper-body settings." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.756, + 0.421, + 0.77 + ], + "angle": 0, + "content": "4.3 Qualitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.841 + ], + "angle": 0, + "content": "Figure 4 showcases several virtual try-on results of different methods, coupled with the input person image and in-shop garment. As evidenced by the presented exemplar results, all the approaches demonstrate a certain degree of proficiency in resembling the appearance and texture details of the input in-shop" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.288, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.226, + 0.153, + 0.778, + 0.515 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.531, + 0.788, + 0.561 + ], + "angle": 0, + "content": "Fig. 4: Examples generated by VITON-HD, HR-VTON, GP-VTON, LaDI-VTON, DCI-VTON and our GarDiff." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.595, + 0.788, + 0.807 + ], + "angle": 0, + "content": "garments. Specifically, Diffusion-based methods (LaDI-VTON, DCI-VTON and our GarDiff) consistently outperform the GAN-based approaches (VITON-HD, HR-VTON and GP-VTON) by leveraging the strong capability of diffusion models in generating high-fidelity images. Despite both DCI-VTON and our GarDiff capitalizing on diffusion models, the former approach achieves inferior results to the latter. The underlying rationale lies in the fact that DCI-VTON guides the diffusion process with CLIP visual embeddings of the garment only, while our GarDiff additionally leverages the appearance prior from the VAE encoder through a vision adapter to better preserve the fine-grained details. Moreover, GarDiff is further upgraded with garment-focused attention mechanism and optimized with a new appearance loss to steer the diffusion process with amplified garment-focused guidance, yielding images with enhanced local alignment to the appearance of the garment. For example, our GarDiff better restores the text \"wrangler\" on the garment than DCI-VTON in the fourth row." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.793, + 0.842 + ], + "angle": 0, + "content": "Furthermore, we conduct human study to compare our GarDiff against five strong baselines (HR-VTON, VITON-HD, GP-VTON, Ladi-VTON, DCI-VTON)" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.374, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "image", + "bbox": [ + 0.286, + 0.153, + 0.72, + 0.24 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.26, + 0.785, + 0.275 + ], + "angle": 0, + "content": "Fig. 5: User study on 100 garment-person pairs randomly sampled from VITON-HD." + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.291, + 0.788, + 0.32 + ], + "angle": 0, + "content": "Table 3: Ablation study of our proposed GarDiff on VITON-HD dataset. Base: based model; GFA: garment-focused adapter; AL: appearance loss." + }, + { + "type": "table", + "bbox": [ + 0.295, + 0.332, + 0.705, + 0.4 + ], + "angle": 0, + "content": "
ModelSSIM ↑LPIPS↓FIDp↓KIDp↓FIDu↓KIDu
Base0.8090.11710.030.19010.960.473
Base+AL0.8290.0908.720.10310.220.300
Base+GFA0.8980.0526.610.0478.210.069
Base+GFA+AL0.9120.0366.020.0197.890.027
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.43, + 0.788, + 0.522 + ], + "angle": 0, + "content": "over 100 randomly sampled garment-person pairs in VITON-HD (unpaired setting). 10 evaluators from diverse education background are invited to rank the best VTON result between our GarDiff and the five competing methods based on two criteria: (1) garment detail preservation, (2) human pose alignment. Figure 5 shows the percentages of top-1 ranking for each method, and our GarDiff achieves the best results in both evaluated dimensions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.551, + 0.469, + 0.566 + ], + "angle": 0, + "content": "4.4 Analysis and Discussions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.582, + 0.788, + 0.764 + ], + "angle": 0, + "content": "Ablation Study on GarDiff. We conduct an ablation study to investigate how each design in our GarDiff influences the overall performances on the VITON-HD dataset. Table 3 details the performance comparisons among different ablated runs of our GarDiff. We start from the stable diffusion inpainting as our base model (Base), which replaces the original CLIP text encoder with the CLIP vision encoder. Base + GFA further boosts Base) by concurrently leveraging the CLIP visual embeddings and VAE embeddings to guide the diffusion process, which verifies the merit of applying the appearance prior from VAE. It is not surprising that Base + AL outperforms Base by supervising the training with the novel appearance loss that facilitates the preservation of garment detail. Finally, our full GarDiff (Base + GFA + AL) achieves the best performances through the synergetic integration of the two proposed components." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.84 + ], + "angle": 0, + "content": "To illustrate the impact of these components more intuitively, we visualize these ablated runs in Figure 6. Compared with other ablated runs, our final model \\(\\mathbf{Base} + \\mathbf{GFA} + \\mathbf{AL}\\) (i.e., GarDiff) can preserve most of the fine-grained details of the given garments. Take the first case as an example, compared to the base model Base, \\(\\mathbf{Base} + \\mathbf{GFA}\\) effectively retains texture details of the letters." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.288, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.234, + 0.161, + 0.761, + 0.351 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.295, + 0.375, + 0.707, + 0.39 + ], + "angle": 0, + "content": "Fig. 6: Ablation study on the pivotal components of GarDiff." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.427, + 0.788, + 0.459 + ], + "angle": 0, + "content": "Similarly, when the garment-focused vision adapter is additionally integrated into the Base model, the generated results are further improved by \\(\\mathbf{Base} + \\mathbf{A}\\mathbf{L}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.497, + 0.788, + 0.68 + ], + "angle": 0, + "content": "Effect of Unwarpped Garment. In contrast to the Diffusion-based DCIVTON that merely capitalizes on the warped garment derived from an warping networks for VTON, our GarDiff additionally incorporates the unwarpped garment to faithfully retain the appearance and shape details of the reference garment. In this way, high-quality VTON results can be achieved even when the warped garments predicted from the warping networks are defective. Some examples are shown in Figure 7(a). Regarding the long-sleeve T-shirt on th first row, the warped garment fails to accurately restore the shape of the input garment with one of the sleeves missing. As a result, less favorable outcomes are obtained by solely leveraging the erroneously warped garment. Our GarDiff, employing both the appearance priors over the warped and unwarpped garments, generates high-fidelity images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Preservation of Fine-grained Details. With the assistance of the proposed garment-focused attention mechanism and appearance loss, our GarDiff is capable of accurately aligning the visual appearance of the garment in the generated samples with the reference one. Figure 7(b) showcases the images synthesized by Diffusion-based competing methods (LaDI-VTON and DCI-VTON) and our proposed GarDiff, involving the cases with fine-grained details. Compared to LaDIVTON and DCI-VTON which fail to achieve satisfactory results, our GarDiff successfully restores the small letters in the garment on the first row." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "image", + "bbox": [ + 0.23, + 0.153, + 0.782, + 0.367 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.38, + 0.785, + 0.424 + ], + "angle": 0, + "content": "Fig. 7: (a) Examples generated by our GarDiff with or without unwarpped garment. (b) Comparisons between Diffusion-based baselines (LaDI-VTON and DCI-VTON) and our GarDiff regarding the preservation of fine-grained details." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.451, + 0.36, + 0.467 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.482, + 0.788, + 0.664 + ], + "angle": 0, + "content": "In this work, we have presented the Garment-focused Diffusion model (GarDiff) that is capable of preserving the fine-grained details of the target garment in the virtual try-on task. Specifically, GarDiff remoulds the pre-trained latent diffusion model with appearance priors from the CLIP vision encoder and the VAE encoder for the reference garment and then integrates these priors into UNet through a garment-focused vision adapter. In this way, the diffusion process is effectively strengthened with the amplified appearance guidance from the given garment. A novel appearance loss is further devised to enforce the synthesized garment to be consistent with the high-frequency details and the geometric shape of target garment. Extensive experiments conducted on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff. More remarkably, we achieve new state-of-the-art performances on the two virtual try-on datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.687, + 0.788, + 0.763 + ], + "angle": 0, + "content": "Broader Impact. Recent advances in generative modeling offer new possibilities for creating and manipulating digital media but also pose risks of generating deceptive content. Our proposed GarDiff might be nefariously used to \"undress\" individuals by substituting their original attire with undergarments for pornographic applications, and we emphatically denounce any such activities." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.288, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.204 + ], + "angle": 0, + "content": "1. Bai, S., Zhou, H., Li, Z., Zhou, C., Yang, H.: Single stage virtual try-on via deformable attention flows. In: ECCV (2022) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.205, + 0.785, + 0.232 + ], + "angle": 0, + "content": "2. Binkowski, M., Sutherland, D.J., Arbel, M., Gretton, A.: Demystifying mmd gans. In: ICLR (2018) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.233, + 0.785, + 0.26 + ], + "angle": 0, + "content": "3. Bookstein, F.L.: Principal warps: Thin-plate splines and the decomposition of deformations. IEEE TPAMI 11(6), 567-585 (1989) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.261, + 0.785, + 0.287 + ], + "angle": 0, + "content": "4. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.288, + 0.785, + 0.315 + ], + "angle": 0, + "content": "5. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.316, + 0.785, + 0.343 + ], + "angle": 0, + "content": "6. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: CVPR (2021) 2, 3, 8, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.344, + 0.785, + 0.371 + ], + "angle": 0, + "content": "7. Ding, K., Ma, K., Wang, S., Simoncelli, E.P.: Image quality assessment: Unifying structure and texture similarity. IEEE TPAMI 44(5), 2567-2581 (2020) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.372, + 0.785, + 0.398 + ], + "angle": 0, + "content": "8. Dong, H., Liang, X., Shen, X., Wu, B., Chen, B.C., Yin, J.: Fw-gan: Flow-navigated warping gan for video virtual try-on. In: ICCV (2019) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.399, + 0.785, + 0.438 + ], + "angle": 0, + "content": "9. Fenocchi, E., Morelli, D., Cornia, M., Baraldi, L., Cesari, F., Cucchiara, R.: Dual-branch collaborative transformer for virtual try-on. In: CVPR Workshops (2022) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.44, + 0.785, + 0.467 + ], + "angle": 0, + "content": "10. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: CVPR (2021) 2, 3, 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.785, + 0.495 + ], + "angle": 0, + "content": "1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS (2014) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.496, + 0.785, + 0.536 + ], + "angle": 0, + "content": "2. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: ACM MM (2023) 2, 4, 6, 8, 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.537, + 0.785, + 0.564 + ], + "angle": 0, + "content": "3. Gu, S., Chen, D., Bao, J., Wen, F., Zhang, B., Chen, D., Yuan, L., Guo, B.: Vector quantized diffusion model for text-to-image synthesis. In: CVPR (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.565, + 0.785, + 0.592 + ], + "angle": 0, + "content": "4. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: CVPR (2018) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.593, + 0.785, + 0.619 + ], + "angle": 0, + "content": "5. He, S., Song, Y.Z., Xiang, T.: Style-based global appearance flow for virtual try-on. In: CVPR (2022) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.62, + 0.785, + 0.66 + ], + "angle": 0, + "content": "6. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.785, + 0.688 + ], + "angle": 0, + "content": "7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.785, + 0.716 + ], + "angle": 0, + "content": "8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.717, + 0.785, + 0.744 + ], + "angle": 0, + "content": "9. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., et al.: Openclip. Zenodo 4, 5 (2021) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.745, + 0.774, + 0.757 + ], + "angle": 0, + "content": "20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.785 + ], + "angle": 0, + "content": "21. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: ECCV (2022) 2, 3, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.786, + 0.785, + 0.813 + ], + "angle": 0, + "content": "22. Li, K., Chong, M.J., Zhang, J., Liu, J.: Toward accurate and realistic outfits visualization with attention to details. In: CVPR (2021) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.785, + 0.838 + ], + "angle": 0, + "content": "23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2019) 8" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.177, + 0.785, + 0.838 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.373, + 0.129 + ], + "angle": 0, + "content": "Siqi Wan et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.786, + 0.188 + ], + "angle": 0, + "content": "24. Minar, M.R., Tuan, T.T., Ahn, H., Rosin, P., Lai, Y.K.: Cp-vton+: Clothing shape and texture preserving image-based virtual try-on. In: CVPR Workshops (2020) 2, 3, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.189, + 0.787, + 0.23 + ], + "angle": 0, + "content": "25. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladi-vton: Latent diffusion textual-inversion enhanced virtual try-on. In: ACM MM (2023) 2, 4, 6, 8, 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.23, + 0.786, + 0.271 + ], + "angle": 0, + "content": "26. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: CVPR Workshops (2022) 8, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.271, + 0.786, + 0.298 + ], + "angle": 0, + "content": "27. Qian, Y., Cai, Q., Pan, Y., Li, Y., Yao, T., Sun, Q., Mei, T.: Boosting diffusion models with moving average sampling in frequency domain. In: CVPR (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.299, + 0.786, + 0.34 + ], + "angle": 0, + "content": "28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.34, + 0.786, + 0.367 + ], + "angle": 0, + "content": "29. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer: High-resolution image synthesis with latent diffusion models. In: CVPR (2022) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.367, + 0.786, + 0.394 + ], + "angle": 0, + "content": "30. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015) 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.394, + 0.786, + 0.422 + ], + "angle": 0, + "content": "31. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.422, + 0.786, + 0.447 + ], + "angle": 0, + "content": "32. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. In: ICLR (2021) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.448, + 0.786, + 0.475 + ], + "angle": 0, + "content": "33. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: NeurIPS (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.476, + 0.786, + 0.503 + ], + "angle": 0, + "content": "34. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: ECCV (2018) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.503, + 0.786, + 0.53 + ], + "angle": 0, + "content": "35. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE TIP (2004) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.53, + 0.786, + 0.571 + ], + "angle": 0, + "content": "36. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: CVPR (2023) 2, 3, 5, 9, 10" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.571, + 0.786, + 0.611 + ], + "angle": 0, + "content": "37. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: CVPR (2023) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.611, + 0.786, + 0.651 + ], + "angle": 0, + "content": "38. Yang, H., Zhang, R., Guo, X., Liu, W., Zuo, W., Luo, P.: Towards photo-realistic virtual try-on by adaptively generating-preserving image content. In: CVPR (2020) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.652, + 0.786, + 0.68 + ], + "angle": 0, + "content": "39. Yu, R., Wang, X., Xie, X.: Vtnfp: An image-based virtual try-on network with body and clothing feature preservation. In: ICCV (2019) 2, 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.68, + 0.786, + 0.707 + ], + "angle": 0, + "content": "40. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.707, + 0.786, + 0.747 + ], + "angle": 0, + "content": "41. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.747, + 0.786, + 0.788 + ], + "angle": 0, + "content": "42. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: CVPR (2023) 4, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.789, + 0.786, + 0.83 + ], + "angle": 0, + "content": "43. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024) 2" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.83 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_origin.pdf b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..98ecc920d17d2deb0d66114dd2fbd3c67fe394fc --- /dev/null +++ b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/763136ac-f113-4838-b176-ba0b1b53b539_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1d4e3b8d2ba8afdcbb3687a0044856b370ae0a4292e898c2960e71ee7a76e536 +size 2563875 diff --git a/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/full.md b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/full.md new file mode 100644 index 0000000000000000000000000000000000000000..9c06f5a1ab21051c2f1d8e6d11646ab77d28db4d --- /dev/null +++ b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/full.md @@ -0,0 +1,265 @@ +# Improving Virtual Try-On with Garment-focused Diffusion Models + +Siqi Wan $^{1*}$ , Yehao Li $^{2}$ , Jingwen Chen $^{2}$ , Yingwei Pan $^{2}$ , Ting Yao $^{2}$ , Yang Cao $^{1}$ , and Tao Mei $^{2}$ + +1 University of Science and Technology of China + +2 HiDream.ai Inc. + +wansiqi4789@mail.ustc.edu.cn, {liyehao, chenjingwen, pandy, tiyao}@hidream.ai forrest@ustc.edu.cn, tmei@hidream.ai + +Abstract. Diffusion models have led to the revolutionizing of generative modeling in numerous image synthesis tasks. Nevertheless, it is not trivial to directly apply diffusion models for synthesizing an image of a target person wearing a given in-shop garment, i.e., image-based virtual try-on (VTON) task. The difficulty originates from the aspect that the diffusion process should not only produce holistically high-fidelity photorealistic image of the target person, but also locally preserve every appearance and texture detail of the given garment. To address this, we shape a new Diffusion model, namely GarDiff, which triggers the garment-focused diffusion process with amplified guidance of both basic visual appearance and detailed textures (i.e., high-frequency details) derived from the given garment. GarDiff first remoulds a pre-trained latent diffusion model with additional appearance priors derived from the CLIP and VAE encodings of the reference garment. Meanwhile, a novel garment-focused adapter is integrated into the UNet of diffusion model, pursuing local fine-grained alignment with the visual appearance of reference garment and human pose. We specifically design an appearance loss over the synthesized garment to enhance the crucial, high-frequency details. Extensive experiments on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff when compared to state-of-the-art VTON approaches. Code is publicly available at: https://github.com/siqi0905/GarDiff/tree/master. + +Keywords: Virtual Try-on $\cdot$ Diffusion Model $\cdot$ Appearance Prior + +# 1 Introduction + +Image-based Virtual Try-ON (VTON), a prominent research topic in computer vision field, aims to synthesize an image of a specific person wearing a desired in-shop garment. Such automatic generation of person images sidesteps the requirement of physical fitting and thus has ushered in a new era of creativity for e-commerce and metaverse. Practical VTON systems have a tremendous potential impact on real-world applications, e.g., online shopping, fashion catalog + +creation, etc. The objective of VTON task is three-fold: 1) human body alignment: the synthesized person image should conform to the human body/pose of given specific person; 2) garment fidelity: the synthesized person image should preserve every appearance and texture detail of the in-shop garment; 3) quality: the synthesized person image should be of high-quality with few artifacts. + +![](images/8c02f9c8dd21129337301e43dde4a6d9a6050b5bed292f3b681ac08ac6867989.jpg) +Fig. 1: Existing GAN-based VTON methods (e.g., VITON-HD [6], HR-VTON [21] and GP-VTON [36]) and Diffusion-based VTON techniques (e.g., LaDI-VTON [25] and DCI-VTON [12]) often fail to perfectly retain every appearance/texture detail of the given garment (e.g., the complex patterns or texts). Instead, our GarDiff exploits garment-focused diffusion process to preserve most of fine-grained details of the given garment, pursuing more controllable person image generation. + +To tackle VTON task, prior works [1,6,8,9,14,24,34,34,38,39] commonly hinge on an explicit warping process to directly deform the appearance of in-shop garment conditioned on the pose of target person. However, this way is often prone to suffer from distortions and artifacts over warped garments, due to the misalignment between warped garment and target person's body. To alleviate this misalignment issue, several subsequent works [10, 15, 21, 22, 36] further upgrade warping process with an additional generative process. They capitalize on the typical Generative Adversarial Networks [11] to synthesize the final person image based on conditions like warped garment and human body. While effective, the synthesized person images still tend to be unsatisfactory in challenging cases (see the unrealistic artifacts in Figure 1 (a), (b) and (c)). This might be attributed to the limited capacity of the underlying generative model (GAN) to synthesize person image with complex patterned garment and variable human pose. + +Recently, Diffusion models [4,5,17,27,29,31,33,41,43] emerge as a new trend of generative modeling in numerous image synthesis tasks, demonstrating better scalability and easier/stable training than GAN-based solutions. Motivated by this, recent advances [12, 25] have been dedicated to remould pre-trained Latent Diffusion Model [29] of text-to-image synthesis by leveraging warped garment as additional condition during diffusion process. Although promising results are attained, these diffusion-based VTON approaches (e.g., LaDI-VTON [25] and DCI-VTON [12]) still fail to completely retain every detail of in-shop garment, especially for high-frequency texture details of complex patterns/texts (see Fig- + +ure 1 (d) and (e)). We speculate that degenerated results might be caused by holistic diffusion process over latent space where compressed latent code is not capable of memorizing every intricate garment detail and providing sufficient guidance for VTON task. + +In an effort to mitigate this problem, our work shapes a new way to upgrade the latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. Technically, we propose a novel Garment-focused Diffusion model (GarDiff) to progressively excavate more prior knowledge about fine-grained garment details. Such prior knowledge acts as amplified garment-focused guidance to improve virtual try-on results. Specifically, CLIP [28] and Variational Auto-encoder (VAE) [20] are employed to encode the reference garment into appearance priors, which is regarded as additional conditions to guide diffusion process. To effectively leverage these priors, a new garment-focused adapter is introduced to the UNet of latent diffusion model. This design triggers the local fine-grained appearance alignment between the synthetic person image and reference garment & human pose. Moreover, a novel appearance loss is defined on the warped reference garment to achieve the guidance of high-frequency prior, which is utilized to supervise the synthesis of high-frequency details in synthesized garment, pursuing better preservation of high-frequency texture details in VTON. Eventually, our GarDiff faithfully produces person images with better-aligned garment details (see Figure 1 (f)). + +The main contribution of this work is the proposal of garment-focused diffusion model that facilitates virtual try-on tasks. This also leads to the elegant view of how a diffusion model should be designed for excavating the garment-focused prior knowledge (e.g., visual appearance and high-frequency texture details) tailored to VTON, and how to improve diffusion process with these amplified garment-focused guidance. Through an extensive set of experiments on VITON-HD and DressCode datasets, our GarDiff consistently achieves competitive performances against state-of-the-art VTON methods. + +# 2 Related Work + +GAN-based Virtual Try-on. To tackle VTON task, prior works [1,6,8-10,14, 15,21,22,24,34,34,36,39] capitalize on the GAN to synthesize the final person image based on the conditions like warped garment and human body. VITON [14] is a pioneering work that employs a refinement network to composite warped garments generated through TPS [3] with the target person. CP-VTON [24] introduces an upgraded learnable TPS transformation for achieving more robust alignment between the target person and the garment. VITON-HD [6] designed an alignment-aware segment generator to fill the misaligned regions with the garment texture through multi-scale refinement. HR-VTON [21] proposes a novel try-on condition generator that unifies the warping and segmentation generation modules for handling the misalignment and occlusion. GP-VTON [36] presents an advanced LFGP warping module for creating deformed garments, which is optimized with a new DGT training strategy. + +![](images/68252240a77bdbbf947cfd40f6ce45e50497704bd804d9ce054d8ee6461e2e40.jpg) +Fig. 2: An overview of our GarDiff. The cross-attention layer is substituted with the garment-focused vision adapter in each Transformer block. First, we extract the CLIP visual embeddings $\mathbf{f}_{clip}$ and VAE embeddings $\mathbf{f}_{vae}$ of the target garment $\mathbf{I}_c$ and warped garment $\mathbf{I}_w$ , respectively. Then the two embeddings are fed into the garment-focused adapter as keys and values via a decoupled cross-attention to guide the diffusion process for pursuing local fine-grained alignment with the appearance of target garment. Meanwhile, we employ a novel appearance loss $\mathcal{L}_{appearance}$ comprised of spatial perceptual loss $\mathcal{L}_{spatial}$ and high-frequency promoted loss $\mathcal{L}_{high-freq}$ over the generated garment to enhance the proficiency of GarDiff in generating high-frequency details. + +Diffusion-based Virtual Try-on. Recently, diffusion models [13, 17, 31] start to dominate in natural image generation due to its superior ability in generating high-fidelity realistic images compared to GAN-based models. Inspired by this, a series of diffusion-based virtual try-on models begin to emerge. TryOnDiffusion [42] unifies two UNets to preserve garment details and warp the garment in a single network. LaDI-VTON [25] introduces the textual inversion component that maps visual features of reference garment to CLIP token embedding space as condition of diffusion model. DCI-VTON [12] further use warping network to warp reference garment, which is fed into diffusion model as an additional guidance. Although promising results are attained, these diffusion-based VTON approaches still fail to completely retain every detail of the reference garment. + +# 3 METHOD + +In this work, we propose a Garment-focused Diffusion model (GarDiff), an upgraded latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. In this section, we will first + +![](images/636a3b7e6fd6319e778c919a409d2ef6f3d90fa2b27a2b0c06b1fce73b86aa82.jpg) +Fig. 3: Implementation details of our garment-focused adapter. For the given target garment $\mathbf{I}_c$ and warped garment $\mathbf{I}_w$ , the CLIP visual embeddings $\mathbf{f}_{clip}$ and VAE embeddings $\mathbf{f}_{vae}$ are extracted and fed into the garment-focused adapter as the keys and values through a decoupled cross-attention. $\mathbf{M}_{attn}$ is used to suppress the weights unrelated to garment area in the attention map for generating garment-focused features. + +provide a concise overview of our GarDiff, followed by the details of the proposed garment-focused vision adapter and appearance loss. + +# 3.1 Overview + +Generally, given a person image $\mathbf{I}_p\in \mathbb{R}^{H\times W\times 3}$ and in-shop garment $\mathbf{I}_c\in$ $\mathbb{R}^{H^{\prime}\times W^{\prime}\times 3}$ , our GarDiff is optimized to synthesize a high-quality realistic image $\mathbf{I}\in \mathbb{R}^{H\times W\times 3}$ , where the person wears the in-shop garment $\mathbf{I}_c$ . To effectively leverage the appearance guidance of the given garment for high-fidelity person image generation, the original cross-attention layers in the UNet of diffusion model are substituted with our proposed garment-focused vision adapter modules. An overview of our GarDiff is illustrated in Figure 2. + +In the forward diffusion process, similar to vanilla diffusion model, we gradually add noise to the target image $\mathbf{I}$ according to the Markov chain. Specifically, we first utilize the VAE encoder $\mathcal{E}(\cdot)$ to map the target image $\mathbf{I}$ to the latent space: $\mathbf{x}_0 = \mathcal{E}(\mathbf{I})$ . Then we add noise $\epsilon$ to $\mathbf{x}_0$ at an arbitrary timestep $t \in [1, 1000]$ as follows: + +$$ +\mathbf {x} _ {t} = \sqrt {\alpha_ {t}} \mathbf {x} _ {0} + \sqrt {1 - \alpha_ {t}} \epsilon , \tag {1} +$$ + +where $\alpha_{t} = \prod_{s=1}^{t}(1 - \beta_{s}), \epsilon \sim \mathcal{N}(0,1)$ , and $\beta_{s}$ is the pre-defined variance schedule at timestep $s$ . + +In the reverse diffusion process, we first warp the in-shop garment $\mathbf{I}_c$ similar to [36] to achieve the maximum conformity of the target garment with the body's posture, obtaining the warped garment $\mathbf{I}_w \in \mathbb{R}^{H' \times W' \times 3}$ and warped mask $\mathbf{m}_w \in \{0,1\}^{H \times W}$ . The warped mask $\mathbf{m}_w$ indicates the area of the warped garment. To preserve the area unrelated to the garment, a garment-agnostic image $\mathbf{I}_a$ with the region intended for garment placement fully masked from the person image $\mathbf{I}_p$ is also extracted. Then, the noisy image latent $\mathbf{x}_t$ , the latent warped garment + +map $\mathbf{x}_w = \mathcal{E}(\mathbf{I}_w)$ and the latent agnostic map $\mathbf{x}_a = \mathcal{E}(\mathbf{I}_a)$ are concatenated along the channel dimension, leading to the input of the UNet $\epsilon_{\theta}$ [30] of the diffusion model: + +$$ +\gamma = \operatorname {C o n c a t} \left(\mathbf {x} _ {w}, \mathbf {x} _ {a}, \mathbf {x} _ {t}\right). \tag {2} +$$ + +During denoising, the UNet is trained to predict the added noise $\epsilon$ conditioned on the target garment $\mathbf{I}_c$ and warped garment $\mathbf{I}_w$ . The objective function is formed as the mean-squared loss: + +$$ +\mathcal {L} _ {m s e} = \left\| \epsilon - \epsilon_ {\theta} (\gamma , \mathbf {I} _ {c}, \mathbf {I} _ {w}, t) \right\| _ {2} ^ {2}. \tag {3} +$$ + +# 3.2 Garment-Focused Adapter + +To retain the appearance details of the given garment, previous works [12,25,42] merely steer the diffusion process with the garment appearance captured by CLIP vision encoder. However, it is difficult for CLIP vision encoder to perceive the fine-grained details in the target garment, since CLIP is optimized for image-text alignment at a coarse level. In our experiments, we found that VAE, serving as the reconstruction module for stable diffusion, exhibits much stronger capabilities in preserving texture details in images than CLIP. Therefore, it would be beneficial to involve VAE as additional appearance prior into stable diffusion. + +Technically, we replace the cross-attention layer with a vision adapter in each Transformer block. The vision adapter takes two appearance priors as inputs: 1) the VAE embeddings of the warped rendition $\mathbf{I}_w$ of the target garment $\mathbf{I}_c$ for recovering the complex patterns in the synthesized image, 2) the CLIP visual embeddings of $\mathbf{I}_c$ for generating the holistic structure regardless of the imperfection of the warped result $\mathbf{I}_w$ . Specifically, given the target garment $\mathbf{I}_c$ and the warped garment $\mathbf{I}_w$ , the CLIP visual embeddings $\mathbf{f}_{clip}$ and VAE embeddings $\mathbf{f}_{vae}$ are calculated as: + +$$ +\begin{array}{l} \mathbf {f} _ {\text {c l i p}} = \mathbf {M L P} ^ {\text {c l i p}} \left(\mathbf {C L I P} _ {v} \left(\mathbf {I} _ {c}\right)\right), \\ \mathbf {f} _ {\text {c l i p}} = \mathbf {M L P} ^ {\text {v a e}} \left(\mathbf {S} \left(\mathbf {I} _ {c}\right)\right) \end{array} \tag {4} +$$ + +$$ +\mathbf {f} _ {v a e} = \mathbf {M L P} ^ {v a e} (\mathcal {E} (\mathbf {I} _ {w})), +$$ + +where $\mathbf{CLIP}_v$ , $\mathbf{MLP}^{clip}$ , $\mathbf{MLP}^{vae}$ are the CLIP vision encoder, multi-layer perceptrons for CLIP visual embeddings and VAE embeddings, respectively. Considering the two embeddings focus on different granularity levels of the target garment, a decoupled cross-attention mechanism is devised in the vision adapter to separate the cross-attention layers for the CLIP visual embeddings and VAE embeddings. Given the features $\mathbf{f}_q$ from the last self-attention layer, the vision adapter operates as follows: + +$$ +\mathbf {Z} _ {a t t n} = S o f t m a x (\frac {\mathbf {Q} (\mathbf {K} _ {c l i p}) ^ {\top}}{\sqrt {d}}) \mathbf {V} _ {c l i p} + S o f t m a x (\frac {\mathbf {Q} (\mathbf {K} _ {v a e}) ^ {\top}}{\sqrt {d}}) \mathbf {V} _ {v a e}, +$$ + +$$ +\mathbf {Q} = \mathbf {f} _ {q} \mathbf {W} ^ {q}, \mathbf {K} _ {c l i p} = \mathbf {f} _ {c l i p} \mathbf {W} _ {c l i p} ^ {k}, \mathbf {V} _ {c l i p} = \mathbf {f} _ {c l i p} \mathbf {W} _ {c l i p} ^ {v}, \tag {5} +$$ + +$$ +\mathbf {K} _ {v a e} = \mathbf {f} _ {v a e} \mathbf {W} _ {v a e} ^ {k}, \mathbf {V} _ {v a e} = \mathbf {f} _ {v a e} \mathbf {W} _ {v a e} ^ {v}, +$$ + +where $\mathbf{W}^q$ , $\mathbf{W}_*^k$ , $\mathbf{W}_*^v$ are the trainable projection matrices in the decoupled cross-attention of the vision adapter for queries, keys and values, respectively. + +It is relatively easier for the model to achieve favorable results on the regions devoid of garments, such as the torso skin, since those regions usually exhibit simpler patterns or textures. Therefore, improving virtual try-on results hinges critically upon the restoration of the fine-grained details in the given garment. In light of this, we propose to amplify the garment-focused guidance in the diffusion process. Specifically, the vision adapter is further upgraded with a novel garment-focused attention, leading to a garment-focused (GF) adapter that aims to pursue local fine-grained alignment with the visual appearance of the reference garment and human pose. As illustrated in Figure 3, the warped mask $\mathbf{m}_w$ is downsampled to an attention mask $\mathbf{M}_{attn}$ that matches the resolution of the corresponding attention layer in the GF adapter, which is leveraged to suppress the attention weights unrelated to garment area in the attention map. Hence, Equation (5) can be reformulated for the garment-focused adapter as follows: + +$$ +\begin{array}{l} \mathbf {Z} _ {\text {a t t n}} ^ {\text {m a s k}} = \left[ \operatorname {s o f t m a x} \left(\frac {\mathbf {Q} \left(\mathbf {K} _ {\text {c l i p}}\right) ^ {\top}}{\sqrt {d}}\right) \odot \mathbf {M} _ {\text {a t t n}} \right] \times \mathbf {V} _ {\text {c l i p}} + \tag {6} \\ [ s o f t m a x (\frac {\mathbf {Q} (\mathbf {K} _ {v a e}) ^ {\top}}{\sqrt {d}}) \odot \mathbf {M} _ {a t t n} ] \times \mathbf {V} _ {v a e}. \\ \end{array} +$$ + +# 3.3 Appearance Loss + +Generally, diffusion model is merely optimized with the mean-squared loss defined in Equation (3), which treats all the regions of the synthesized image equally without emphasizing the texture details in the garment area, failing to generate the accurate garment patterns. As complicated details in the in-shop garment typically manifest as high-frequency components (i.e., edges), a novel appearance loss is proposed to enforce the synthesized garment to be geometrically consistent with the high-frequency details of the reference garment, achieving improved fidelity and fine-grained textures. The appearance loss, as a composite adaptation loss, can be decomposed into two components: a spatial perceptual loss $\mathcal{L}_{\text{spatial}}$ and a high-frequency promoted loss $\mathcal{L}_{\text{high-freq}}$ . + +Specifically, we estimate the latent $\hat{\mathbf{x}}_0$ given the noisy one $\mathbf{x}_t$ and the predicted noise $\epsilon_t$ from the UNet at timestep $t$ by reversing the process in Equation (1): + +$$ +\hat {\mathbf {x}} _ {0} = \frac {\mathbf {x} _ {t} - \sqrt {1 - \alpha_ {t}} \epsilon_ {t}}{\sqrt {\alpha_ {t}}}. \tag {7} +$$ + +The latent $\hat{\mathbf{x}}_0$ is further converted back to the pixel space by the VAE decoder $\mathcal{D}$ , leading to the predicted image $\hat{\mathbf{l}}$ . + +Spatial Perceptual Loss. Inspired by the Deep Image Structure and Texture Similarity (DISTS) metric [7], the spatial perceptual loss is designed to capture both the structural and textural disparities between the predicted and ground-truth images in a perceptual feature space beyond pixels: + +$$ +\mathcal {L} _ {\text {s p a t i a l}} = \mathcal {L} _ {\text {D I S T S}} (\mathbf {I} \odot \mathbf {m} _ {w}, \mathbf {I} \odot \mathbf {m} _ {w}). \tag {8} +$$ + +Note that we use the warped mask $\mathbf{m}_w$ to emphasize the garment area. + +High-Frequency Promoted Loss. To substantively enhance the model's proficiency in generating high-frequency details, we employ edge detection to extract high-frequency information. Technically, the horizontal and vertical Sobel kernels are adopted as the high-pass filters to extract the edge maps $\hat{\mathbf{I}}_h / \mathbf{I}_h$ from the predicted/target image, respectively. Formally, the high-frequency promoted loss is defined as: + +$$ +\mathcal {L} _ {\text {h i g h - f r e q}} = \left\| \tilde {\mathbf {I}} _ {h} \odot \mathbf {m} _ {w} - \mathbf {I} _ {h} \odot \mathbf {m} _ {w} \right\| ^ {2}. \tag {9} +$$ + +Finally, the UNet is optimized by the following improved objective function: + +$$ +\begin{array}{l} \mathcal {L} = \mathcal {L} _ {m s e} + \lambda \mathcal {L} _ {\text {a p p e a r a n c e}}, \tag {10} \\ \mathcal {L} _ {\text {a p p e a r a n c e}} = \mathcal {L} _ {\text {s p a t i a l}} + \mathcal {L} _ {\text {h i g h - f r e q}}, \\ \end{array} +$$ + +where $\lambda$ is the hyper-parameter used to balance the mean-squared loss and the proposed appearance loss. + +# 4 Experiments + +# 4.1 Experimental Settings + +Dadatasets. We empirically verify and analyze the effectiveness of our GarDiff on two popular virtual try-on datasets, VITON-HD [6] and DressCode [26]. The VITON-HD dataset [6] comprises 13,679 frontal-view woman and upper garment image pairs. In line with the general practices of the previous works [12,25], the dataset is divided into two disjoint subsets: a training set with 11,647 pairs and a test set with 2,032 pairs. The DressCode dataset consists of 53,795 image pairs, which are categorized into three macro-categories: 15,366 for upper-body clothes, 8,951 pairs lower-body clothes and 29,478 for dresses. Following the original splits, 1,800 image pairs from each category are reserved for test while the remaining image pairs are utilized for training. The experiments on DressCode and VITON-HD are conducted at the resolution of $512 \times 384$ . + +Evaluation Metrics. We evaluate our GarDiff in both paired and unpaired settings following the virtual try-on literature. In the paired setting, the input garment corresponds to the one originally depicted in the person image. Following the standard evaluation setup, Structural Similarity (SSIM) [35] and Learned Perceptual Image Patch Similarity (LPIPS) [40] are adopted to measure the similarity between the generated image and the ground-truth one. Additionally, the Fréchet Inception Distance(FID) [16] and Kernel Inception Distance(KID) [2] are employed to measure the quality and realism of the generated images. In the unpaired setting, where the garment of the person image is changed to a different one and the ground truth is unavailable, we report the performances of GarDiff in terms of FID and KID. + +Implementation Details. Our GarDiff is initialized from the pre-trained Stable Diffusion 2.1 and finetuned on the virtual try-on datasets. AdamW [23] + +Table 1: Quantitative performance comparisons on VITON-HD dataset. $\mathbf{FID_p} / \mathbf{KID_p}$ stands for the FID/KID score in paired setting, while $\mathbf{FID_u} / \mathbf{KID_u}$ stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100. + +
ModelSSIM ↑LPIPS↓FIDp ↓KIDp ↓FIDu ↓KIDu ↓
VITON-HD [6]0.8430.076--11.640.300
PF-AFN [10]0.8580.082--11.300.283
HR-VTON [21]0.8780.061--9.900.188
GP-VTON [36]0.8940.080--9.20-
Paint-by-Example [37]0.8430.087--10.150.204
LaDI-VTON [25]0.8790.0596.660.1089.410.167
DCI-VTON [12]0.8960.043--8.090.028
GarDiff0.9120.0366.020.0197.890.027
+ +$(\beta_{1} = 0.9, \beta_{2} = 0.999)$ is employed to optimize the model for $200\mathrm{k}$ steps. The learning rate is set to 0.00005 with linear warmup of 500 iterations. The hyperparameter $\lambda$ in Equation (10) and the weight decay are set to 0.001 and 0.01, respectively. OpenCLIP ViT-H/14 [19] is utilized to extract the CLIP visual embeddings of the target garment. To enable classifier-free guidance [18], the embeddings of the garment are randomly dropped with a probability of 0.05. We train GarDiff on 4 NVidia RTX4090 GPUs for about four days and the model size is 5.15 GB. During inference, the image is progressively generated over 100 steps with a DDIM [32] sampler, and the scale of classifier-free guidance is set to 7.5 by default. + +# 4.2 Quantitative Results + +VITON-HD. We compare our GarDiff with a series of state-of-the-art virtual try-on methods including GAN-based methods (VITON-HD [6], PF-AFN [10], HR-VTON [21], GP-VTON [36]) and Diffusion-based methods (DCI-VTON [12], Paint-by-Example [37] and LaDI-VTON [25]). Table 1 summarizes the performance comparisons on the VITON-HD dataset. It can be easily observed that our proposed GarDiff consistently demonstrates superior performances compared to the other methods across all the evaluation metrics. In particular, GP-VITON improves VITON-HD by introducing the try-on condition generator that serves as a unified module in warping and segmentation generation stages. Paint-by-Example further boosts the performances by framing the VTON task as exemplar-based image inpainting and filling the target region of source image with the garment in the reference image. By exploiting the textual inversion to maintain the details of the in-shop garment, LaDI-VTON exhibits better performance than Paint-by-Example. Moreover, DCI-VTON leverages a warping network to guide the image generation of diffusion model, leading to clear performance boosts. However, these existing approaches merely steer the generation process at a coarse level, and thus fail to perfectly retain the details of the given garment. On the contrary, our GarDiff facilitates the preservation of the garment's appearance by excavating the garment-focused prior knowledge and strengthening diffusion process with these amplified garment-focused guidance, + +Table 2: Quantitative performance comparisons on DressCode dataset. $\mathbf{{FID}}_{\mathbf{p}}/{\mathbf{{KID}}}_{\mathbf{p}}$ stands for the FID/KID score in paired setting, while ${\mathbf{{FID}}}_{\mathbf{u}}/{\mathbf{{KID}}}_{\mathbf{u}}$ stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100 . + +
DatasetDC_upper-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9180.07819.701.1622.1812.09
PF-AFN [10]0.918---14.32-
PSAD [26]0.9380.04913.870.64017.517.15
GP-VTON [36]0.9470.036--11.98-
LaDI-VTON [25]0.9280.0499.530.19813.262.67
DCI-VTON [12]-0.030--10.82-
GarDiff0.9520.0308.690.14411.322.34
DatasetDC_lower-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9130.083--18.8510.24
PF-AFN [10]0.907---18.32-
PSAD [26]0.9320.05113.140.55919.688.90
GP-VTON [36]0.9410.042--16.07-
LaDI-VTON [25]0.9220.0518.520.10414.803.13
DCI-VTON [12]-0.035--12.34-
GarDiff0.9390.0358.010.09012.292.88
DatasetDC_dresses
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.8630.12318.751.1121.8312.31
PF-AFN [10]0.869---13.59-
PSAD [26]0.8850.07412.380.46817.076.66
GP-VTON [36]0.8860.072--12.26-
LaDI-VTON [25]0.8680.0899.070.11213.402.50
DCI-VTON [12]-0.068--12.25-
GarDiff0.8910.0658.770.09612.052.09
+ +achieving much better results in VTON task. Specifically, our GarDiff achieves 0.912 on SSIM score and makes a relative improvement of $1.78\%$ against the best competitor DCI-VTON. + +DressCode. Table 2 summarizes the performance comparisons on the Dress-Code dataset. Similar to the observations on VITON-HD, our proposed GarDiff surpasses the performances of the other competing methods across all the three macro-categories, which again evinces the pivotal merit of the garment-focused appearance guidance for preserving fine-grained garment attributes in the generated images. Particularly, our GarDiff leads to the relative improvements over LaDI-VTON by $2.58\%$ on SSIM for upper-body settings. + +# 4.3 Qualitative Results + +Figure 4 showcases several virtual try-on results of different methods, coupled with the input person image and in-shop garment. As evidenced by the presented exemplar results, all the approaches demonstrate a certain degree of proficiency in resembling the appearance and texture details of the input in-shop + +![](images/011d3f6b1fe72f6b79b21cfe19675ffe4051f24f4991ac955902138e8d326b60.jpg) +Fig. 4: Examples generated by VITON-HD, HR-VTON, GP-VTON, LaDI-VTON, DCI-VTON and our GarDiff. + +garments. Specifically, Diffusion-based methods (LaDI-VTON, DCI-VTON and our GarDiff) consistently outperform the GAN-based approaches (VITON-HD, HR-VTON and GP-VTON) by leveraging the strong capability of diffusion models in generating high-fidelity images. Despite both DCI-VTON and our GarDiff capitalizing on diffusion models, the former approach achieves inferior results to the latter. The underlying rationale lies in the fact that DCI-VTON guides the diffusion process with CLIP visual embeddings of the garment only, while our GarDiff additionally leverages the appearance prior from the VAE encoder through a vision adapter to better preserve the fine-grained details. Moreover, GarDiff is further upgraded with garment-focused attention mechanism and optimized with a new appearance loss to steer the diffusion process with amplified garment-focused guidance, yielding images with enhanced local alignment to the appearance of the garment. For example, our GarDiff better restores the text "wrangler" on the garment than DCI-VTON in the fourth row. + +Furthermore, we conduct human study to compare our GarDiff against five strong baselines (HR-VTON, VITON-HD, GP-VTON, Ladi-VTON, DCI-VTON) + +![](images/62078bf291cf64b276edf2cd270bd9cbed9cb05f3b0bcbf8e54db2faadb07940.jpg) +Fig. 5: User study on 100 garment-person pairs randomly sampled from VITON-HD. + +Table 3: Ablation study of our proposed GarDiff on VITON-HD dataset. Base: based model; GFA: garment-focused adapter; AL: appearance loss. + +
ModelSSIM ↑LPIPS↓FIDp↓KIDp↓FIDu↓KIDu
Base0.8090.11710.030.19010.960.473
Base+AL0.8290.0908.720.10310.220.300
Base+GFA0.8980.0526.610.0478.210.069
Base+GFA+AL0.9120.0366.020.0197.890.027
+ +over 100 randomly sampled garment-person pairs in VITON-HD (unpaired setting). 10 evaluators from diverse education background are invited to rank the best VTON result between our GarDiff and the five competing methods based on two criteria: (1) garment detail preservation, (2) human pose alignment. Figure 5 shows the percentages of top-1 ranking for each method, and our GarDiff achieves the best results in both evaluated dimensions. + +# 4.4 Analysis and Discussions + +Ablation Study on GarDiff. We conduct an ablation study to investigate how each design in our GarDiff influences the overall performances on the VITON-HD dataset. Table 3 details the performance comparisons among different ablated runs of our GarDiff. We start from the stable diffusion inpainting as our base model (Base), which replaces the original CLIP text encoder with the CLIP vision encoder. Base + GFA further boosts Base) by concurrently leveraging the CLIP visual embeddings and VAE embeddings to guide the diffusion process, which verifies the merit of applying the appearance prior from VAE. It is not surprising that Base + AL outperforms Base by supervising the training with the novel appearance loss that facilitates the preservation of garment detail. Finally, our full GarDiff (Base + GFA + AL) achieves the best performances through the synergetic integration of the two proposed components. + +To illustrate the impact of these components more intuitively, we visualize these ablated runs in Figure 6. Compared with other ablated runs, our final model $\mathbf{Base} + \mathbf{GFA} + \mathbf{AL}$ (i.e., GarDiff) can preserve most of the fine-grained details of the given garments. Take the first case as an example, compared to the base model Base, $\mathbf{Base} + \mathbf{GFA}$ effectively retains texture details of the letters. + +![](images/0ecc8c111f14031d3e2fb99d3cda796e7486b2308a5aadfccbe76ab2f594d129.jpg) +Fig. 6: Ablation study on the pivotal components of GarDiff. + +Similarly, when the garment-focused vision adapter is additionally integrated into the Base model, the generated results are further improved by $\mathbf{Base} + \mathbf{A}\mathbf{L}$ . + +Effect of Unwarpped Garment. In contrast to the Diffusion-based DCIVTON that merely capitalizes on the warped garment derived from an warping networks for VTON, our GarDiff additionally incorporates the unwarpped garment to faithfully retain the appearance and shape details of the reference garment. In this way, high-quality VTON results can be achieved even when the warped garments predicted from the warping networks are defective. Some examples are shown in Figure 7(a). Regarding the long-sleeve T-shirt on th first row, the warped garment fails to accurately restore the shape of the input garment with one of the sleeves missing. As a result, less favorable outcomes are obtained by solely leveraging the erroneously warped garment. Our GarDiff, employing both the appearance priors over the warped and unwarpped garments, generates high-fidelity images. + +Preservation of Fine-grained Details. With the assistance of the proposed garment-focused attention mechanism and appearance loss, our GarDiff is capable of accurately aligning the visual appearance of the garment in the generated samples with the reference one. Figure 7(b) showcases the images synthesized by Diffusion-based competing methods (LaDI-VTON and DCI-VTON) and our proposed GarDiff, involving the cases with fine-grained details. Compared to LaDIVTON and DCI-VTON which fail to achieve satisfactory results, our GarDiff successfully restores the small letters in the garment on the first row. + +![](images/9eaaaaa91a643e004ceeacde24515822028a14da93471405e40531cdff7646d2.jpg) +Fig. 7: (a) Examples generated by our GarDiff with or without unwarpped garment. (b) Comparisons between Diffusion-based baselines (LaDI-VTON and DCI-VTON) and our GarDiff regarding the preservation of fine-grained details. + +# 5 Conclusion + +In this work, we have presented the Garment-focused Diffusion model (GarDiff) that is capable of preserving the fine-grained details of the target garment in the virtual try-on task. Specifically, GarDiff remoulds the pre-trained latent diffusion model with appearance priors from the CLIP vision encoder and the VAE encoder for the reference garment and then integrates these priors into UNet through a garment-focused vision adapter. In this way, the diffusion process is effectively strengthened with the amplified appearance guidance from the given garment. A novel appearance loss is further devised to enforce the synthesized garment to be consistent with the high-frequency details and the geometric shape of target garment. Extensive experiments conducted on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff. More remarkably, we achieve new state-of-the-art performances on the two virtual try-on datasets. + +Broader Impact. Recent advances in generative modeling offer new possibilities for creating and manipulating digital media but also pose risks of generating deceptive content. Our proposed GarDiff might be nefariously used to "undress" individuals by substituting their original attire with undergarments for pornographic applications, and we emphatically denounce any such activities. + +# References + +1. Bai, S., Zhou, H., Li, Z., Zhou, C., Yang, H.: Single stage virtual try-on via deformable attention flows. In: ECCV (2022) 2, 3 +2. Binkowski, M., Sutherland, D.J., Arbel, M., Gretton, A.: Demystifying mmd gans. In: ICLR (2018) 8 +3. Bookstein, F.L.: Principal warps: Thin-plate splines and the decomposition of deformations. IEEE TPAMI 11(6), 567-585 (1989) 3 +4. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023) 2 +5. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023) 2 +6. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: CVPR (2021) 2, 3, 8, 9 +7. Ding, K., Ma, K., Wang, S., Simoncelli, E.P.: Image quality assessment: Unifying structure and texture similarity. IEEE TPAMI 44(5), 2567-2581 (2020) 7 +8. Dong, H., Liang, X., Shen, X., Wu, B., Chen, B.C., Yin, J.: Fw-gan: Flow-navigated warping gan for video virtual try-on. In: ICCV (2019) 2, 3 +9. Fenocchi, E., Morelli, D., Cornia, M., Baraldi, L., Cesari, F., Cucchiara, R.: Dual-branch collaborative transformer for virtual try-on. In: CVPR Workshops (2022) 2, 3 +10. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: CVPR (2021) 2, 3, 9, 10 +1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS (2014) 2 +2. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: ACM MM (2023) 2, 4, 6, 8, 9, 10 +3. Gu, S., Chen, D., Bao, J., Wen, F., Zhang, B., Chen, D., Yuan, L., Guo, B.: Vector quantized diffusion model for text-to-image synthesis. In: CVPR (2022) 4 +4. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: CVPR (2018) 2, 3 +5. He, S., Song, Y.Z., Xiang, T.: Style-based global appearance flow for virtual try-on. In: CVPR (2022) 2, 3 +6. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017) 8 +7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020) 2, 4 +8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 9 +9. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., et al.: Openclip. Zenodo 4, 5 (2021) 9 +20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3 +21. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: ECCV (2022) 2, 3, 9 +22. Li, K., Chong, M.J., Zhang, J., Liu, J.: Toward accurate and realistic outfits visualization with attention to details. In: CVPR (2021) 2, 3 +23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2019) 8 + +24. Minar, M.R., Tuan, T.T., Ahn, H., Rosin, P., Lai, Y.K.: Cp-vton+: Clothing shape and texture preserving image-based virtual try-on. In: CVPR Workshops (2020) 2, 3, 10 +25. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladi-vton: Latent diffusion textual-inversion enhanced virtual try-on. In: ACM MM (2023) 2, 4, 6, 8, 9, 10 +26. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: CVPR Workshops (2022) 8, 10 +27. Qian, Y., Cai, Q., Pan, Y., Li, Y., Yao, T., Sun, Q., Mei, T.: Boosting diffusion models with moving average sampling in frequency domain. In: CVPR (2024) 2 +28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021) 3 +29. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer: High-resolution image synthesis with latent diffusion models. In: CVPR (2022) 2 +30. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015) 6 +31. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015) 2, 4 +32. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. In: ICLR (2021) 9 +33. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: NeurIPS (2019) 2 +34. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: ECCV (2018) 2, 3 +35. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE TIP (2004) 8 +36. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: CVPR (2023) 2, 3, 5, 9, 10 +37. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: CVPR (2023) 9 +38. Yang, H., Zhang, R., Guo, X., Liu, W., Zuo, W., Luo, P.: Towards photo-realistic virtual try-on by adaptively generating-preserving image content. In: CVPR (2020) 2 +39. Yu, R., Wang, X., Xie, X.: Vtnfp: An image-based virtual try-on network with body and clothing feature preservation. In: ICCV (2019) 2, 3 +40. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018) 8 +41. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024) 2 +42. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: CVPR (2023) 4, 6 +43. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024) 2 \ No newline at end of file diff --git a/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/images.zip b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..7d3dfbcc7ba5ae72b3e3d486c3f3cb93308d0932 --- /dev/null +++ b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bd8183178d6e339c62e49c6506da031a0ada4cd1287633bb7add05701b6e6b61 +size 621682 diff --git a/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/layout.json b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..5131595ea895fafc8aa91dce7a2400a7703e52b6 --- /dev/null +++ b/2024/Improving Virtual Try-On with Garment-focused Diffusion Models/layout.json @@ -0,0 +1,7911 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 135, + 111, + 479, + 146 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 111, + 479, + 146 + ], + "spans": [ + { + "bbox": [ + 135, + 111, + 479, + 146 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "spans": [ + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "content": "Siqi Wan" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "inline_equation", + "content": "^{1*}" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "content": ", Yehao Li" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "content": ", Jingwen Chen" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "content": ", Yingwei Pan" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "content": ", Ting Yao" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "content": ", Yang Cao" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "text", + "content": ", and Tao Mei" + }, + { + "bbox": [ + 179, + 167, + 434, + 194 + ], + "type": "inline_equation", + "content": "^{2}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 206, + 201, + 406, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 206, + 201, + 406, + 213 + ], + "spans": [ + { + "bbox": [ + 206, + 201, + 406, + 213 + ], + "type": "text", + "content": "1 University of Science and Technology of China" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 269, + 213, + 343, + 223 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 269, + 213, + 343, + 223 + ], + "spans": [ + { + "bbox": [ + 269, + 213, + 343, + 223 + ], + "type": "text", + "content": "2 HiDream.ai Inc." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 224, + 496, + 245 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 496, + 245 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 496, + 245 + ], + "type": "text", + "content": "wansiqi4789@mail.ustc.edu.cn, {liyehao, chenjingwen, pandy, tiyao}@hidream.ai forrest@ustc.edu.cn, tmei@hidream.ai" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 159, + 270, + 455, + 514 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 270, + 455, + 514 + ], + "spans": [ + { + "bbox": [ + 159, + 270, + 455, + 514 + ], + "type": "text", + "content": "Abstract. Diffusion models have led to the revolutionizing of generative modeling in numerous image synthesis tasks. Nevertheless, it is not trivial to directly apply diffusion models for synthesizing an image of a target person wearing a given in-shop garment, i.e., image-based virtual try-on (VTON) task. The difficulty originates from the aspect that the diffusion process should not only produce holistically high-fidelity photorealistic image of the target person, but also locally preserve every appearance and texture detail of the given garment. To address this, we shape a new Diffusion model, namely GarDiff, which triggers the garment-focused diffusion process with amplified guidance of both basic visual appearance and detailed textures (i.e., high-frequency details) derived from the given garment. GarDiff first remoulds a pre-trained latent diffusion model with additional appearance priors derived from the CLIP and VAE encodings of the reference garment. Meanwhile, a novel garment-focused adapter is integrated into the UNet of diffusion model, pursuing local fine-grained alignment with the visual appearance of reference garment and human pose. We specifically design an appearance loss over the synthesized garment to enhance the crucial, high-frequency details. Extensive experiments on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff when compared to state-of-the-art VTON approaches. Code is publicly available at: https://github.com/siqi0905/GarDiff/tree/master." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 160, + 522, + 429, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 522, + 429, + 534 + ], + "spans": [ + { + "bbox": [ + 160, + 522, + 429, + 534 + ], + "type": "text", + "content": "Keywords: Virtual Try-on " + }, + { + "bbox": [ + 160, + 522, + 429, + 534 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 522, + 429, + 534 + ], + "type": "text", + "content": " Diffusion Model " + }, + { + "bbox": [ + 160, + 522, + 429, + 534 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 522, + 429, + 534 + ], + "type": "text", + "content": " Appearance Prior" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 552, + 230, + 565 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 552, + 230, + 565 + ], + "spans": [ + { + "bbox": [ + 132, + 552, + 230, + 565 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 575, + 482, + 648 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 575, + 482, + 648 + ], + "spans": [ + { + "bbox": [ + 130, + 575, + 482, + 648 + ], + "type": "text", + "content": "Image-based Virtual Try-ON (VTON), a prominent research topic in computer vision field, aims to synthesize an image of a specific person wearing a desired in-shop garment. Such automatic generation of person images sidesteps the requirement of physical fitting and thus has ushered in a new era of creativity for e-commerce and metaverse. Practical VTON systems have a tremendous potential impact on real-world applications, e.g., online shopping, fashion catalog" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 654, + 318, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 654, + 318, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 654, + 318, + 665 + ], + "type": "text", + "content": "* This work was performed at HiDream.ai." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 177 + ], + "type": "text", + "content": "creation, etc. The objective of VTON task is three-fold: 1) human body alignment: the synthesized person image should conform to the human body/pose of given specific person; 2) garment fidelity: the synthesized person image should preserve every appearance and texture detail of the in-shop garment; 3) quality: the synthesized person image should be of high-quality with few artifacts." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 147, + 191, + 463, + 312 + ], + "blocks": [ + { + "bbox": [ + 147, + 191, + 463, + 312 + ], + "lines": [ + { + "bbox": [ + 147, + 191, + 463, + 312 + ], + "spans": [ + { + "bbox": [ + 147, + 191, + 463, + 312 + ], + "type": "image", + "image_path": "8c02f9c8dd21129337301e43dde4a6d9a6050b5bed292f3b681ac08ac6867989.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 326, + 482, + 393 + ], + "lines": [ + { + "bbox": [ + 130, + 326, + 482, + 393 + ], + "spans": [ + { + "bbox": [ + 130, + 326, + 482, + 393 + ], + "type": "text", + "content": "Fig. 1: Existing GAN-based VTON methods (e.g., VITON-HD [6], HR-VTON [21] and GP-VTON [36]) and Diffusion-based VTON techniques (e.g., LaDI-VTON [25] and DCI-VTON [12]) often fail to perfectly retain every appearance/texture detail of the given garment (e.g., the complex patterns or texts). Instead, our GarDiff exploits garment-focused diffusion process to preserve most of fine-grained details of the given garment, pursuing more controllable person image generation." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 402, + 482, + 557 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 557 + ], + "type": "text", + "content": "To tackle VTON task, prior works [1,6,8,9,14,24,34,34,38,39] commonly hinge on an explicit warping process to directly deform the appearance of in-shop garment conditioned on the pose of target person. However, this way is often prone to suffer from distortions and artifacts over warped garments, due to the misalignment between warped garment and target person's body. To alleviate this misalignment issue, several subsequent works [10, 15, 21, 22, 36] further upgrade warping process with an additional generative process. They capitalize on the typical Generative Adversarial Networks [11] to synthesize the final person image based on conditions like warped garment and human body. While effective, the synthesized person images still tend to be unsatisfactory in challenging cases (see the unrealistic artifacts in Figure 1 (a), (b) and (c)). This might be attributed to the limited capacity of the underlying generative model (GAN) to synthesize person image with complex patterned garment and variable human pose." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "Recently, Diffusion models [4,5,17,27,29,31,33,41,43] emerge as a new trend of generative modeling in numerous image synthesis tasks, demonstrating better scalability and easier/stable training than GAN-based solutions. Motivated by this, recent advances [12, 25] have been dedicated to remould pre-trained Latent Diffusion Model [29] of text-to-image synthesis by leveraging warped garment as additional condition during diffusion process. Although promising results are attained, these diffusion-based VTON approaches (e.g., LaDI-VTON [25] and DCI-VTON [12]) still fail to completely retain every detail of in-shop garment, especially for high-frequency texture details of complex patterns/texts (see Fig-" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 479, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 479, + 163 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 479, + 163 + ], + "type": "text", + "content": "ure 1 (d) and (e)). We speculate that degenerated results might be caused by holistic diffusion process over latent space where compressed latent code is not capable of memorizing every intricate garment detail and providing sufficient guidance for VTON task." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 164, + 481, + 368 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 164, + 481, + 368 + ], + "spans": [ + { + "bbox": [ + 130, + 164, + 481, + 368 + ], + "type": "text", + "content": "In an effort to mitigate this problem, our work shapes a new way to upgrade the latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. Technically, we propose a novel Garment-focused Diffusion model (GarDiff) to progressively excavate more prior knowledge about fine-grained garment details. Such prior knowledge acts as amplified garment-focused guidance to improve virtual try-on results. Specifically, CLIP [28] and Variational Auto-encoder (VAE) [20] are employed to encode the reference garment into appearance priors, which is regarded as additional conditions to guide diffusion process. To effectively leverage these priors, a new garment-focused adapter is introduced to the UNet of latent diffusion model. This design triggers the local fine-grained appearance alignment between the synthetic person image and reference garment & human pose. Moreover, a novel appearance loss is defined on the warped reference garment to achieve the guidance of high-frequency prior, which is utilized to supervise the synthesis of high-frequency details in synthesized garment, pursuing better preservation of high-frequency texture details in VTON. Eventually, our GarDiff faithfully produces person images with better-aligned garment details (see Figure 1 (f))." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 368, + 481, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 368, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 368, + 481, + 464 + ], + "type": "text", + "content": "The main contribution of this work is the proposal of garment-focused diffusion model that facilitates virtual try-on tasks. This also leads to the elegant view of how a diffusion model should be designed for excavating the garment-focused prior knowledge (e.g., visual appearance and high-frequency texture details) tailored to VTON, and how to improve diffusion process with these amplified garment-focused guidance. Through an extensive set of experiments on VITON-HD and DressCode datasets, our GarDiff consistently achieves competitive performances against state-of-the-art VTON methods." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 483, + 237, + 495 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 483, + 237, + 495 + ], + "spans": [ + { + "bbox": [ + 132, + 483, + 237, + 495 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 509, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 509, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 509, + 482, + 666 + ], + "type": "text", + "content": "GAN-based Virtual Try-on. To tackle VTON task, prior works [1,6,8-10,14, 15,21,22,24,34,34,36,39] capitalize on the GAN to synthesize the final person image based on the conditions like warped garment and human body. VITON [14] is a pioneering work that employs a refinement network to composite warped garments generated through TPS [3] with the target person. CP-VTON [24] introduces an upgraded learnable TPS transformation for achieving more robust alignment between the target person and the garment. VITON-HD [6] designed an alignment-aware segment generator to fill the misaligned regions with the garment texture through multi-scale refinement. HR-VTON [21] proposes a novel try-on condition generator that unifies the warping and segmentation generation modules for handling the misalignment and occlusion. GP-VTON [36] presents an advanced LFGP warping module for creating deformed garments, which is optimized with a new DGT training strategy." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 151, + 125, + 462, + 309 + ], + "blocks": [ + { + "bbox": [ + 151, + 125, + 462, + 309 + ], + "lines": [ + { + "bbox": [ + 151, + 125, + 462, + 309 + ], + "spans": [ + { + "bbox": [ + 151, + 125, + 462, + 309 + ], + "type": "image", + "image_path": "68252240a77bdbbf947cfd40f6ce45e50497704bd804d9ce054d8ee6461e2e40.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "lines": [ + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "spans": [ + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": "Fig. 2: An overview of our GarDiff. The cross-attention layer is substituted with the garment-focused vision adapter in each Transformer block. First, we extract the CLIP visual embeddings " + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{clip}" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": " and VAE embeddings " + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{vae}" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": " of the target garment " + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": " and warped garment " + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_w" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": ", respectively. Then the two embeddings are fed into the garment-focused adapter as keys and values via a decoupled cross-attention to guide the diffusion process for pursuing local fine-grained alignment with the appearance of target garment. Meanwhile, we employ a novel appearance loss " + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{appearance}" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": " comprised of spatial perceptual loss " + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{spatial}" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": " and high-frequency promoted loss " + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{high-freq}" + }, + { + "bbox": [ + 130, + 330, + 482, + 430 + ], + "type": "text", + "content": " over the generated garment to enhance the proficiency of GarDiff in generating high-frequency details." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 453, + 482, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 482, + 586 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 482, + 586 + ], + "type": "text", + "content": "Diffusion-based Virtual Try-on. Recently, diffusion models [13, 17, 31] start to dominate in natural image generation due to its superior ability in generating high-fidelity realistic images compared to GAN-based models. Inspired by this, a series of diffusion-based virtual try-on models begin to emerge. TryOnDiffusion [42] unifies two UNets to preserve garment details and warp the garment in a single network. LaDI-VTON [25] introduces the textual inversion component that maps visual features of reference garment to CLIP token embedding space as condition of diffusion model. DCI-VTON [12] further use warping network to warp reference garment, which is fed into diffusion model as an additional guidance. Although promising results are attained, these diffusion-based VTON approaches still fail to completely retain every detail of the reference garment." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 604, + 217, + 616 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 604, + 217, + 616 + ], + "spans": [ + { + "bbox": [ + 132, + 604, + 217, + 616 + ], + "type": "text", + "content": "3 METHOD" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "In this work, we propose a Garment-focused Diffusion model (GarDiff), an upgraded latent diffusion model with amplified guidance of both visual appearance and high-frequency texture details for VTON task. In this section, we will first" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 154, + 131, + 460, + 228 + ], + "blocks": [ + { + "bbox": [ + 154, + 131, + 460, + 228 + ], + "lines": [ + { + "bbox": [ + 154, + 131, + 460, + 228 + ], + "spans": [ + { + "bbox": [ + 154, + 131, + 460, + 228 + ], + "type": "image", + "image_path": "636a3b7e6fd6319e778c919a409d2ef6f3d90fa2b27a2b0c06b1fce73b86aa82.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "lines": [ + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "text", + "content": "Fig. 3: Implementation details of our garment-focused adapter. For the given target garment " + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "text", + "content": " and warped garment " + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_w" + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "text", + "content": ", the CLIP visual embeddings " + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{clip}" + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "text", + "content": " and VAE embeddings " + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{vae}" + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "text", + "content": " are extracted and fed into the garment-focused adapter as the keys and values through a decoupled cross-attention. " + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "inline_equation", + "content": "\\mathbf{M}_{attn}" + }, + { + "bbox": [ + 131, + 258, + 480, + 314 + ], + "type": "text", + "content": " is used to suppress the weights unrelated to garment area in the attention map for generating garment-focused features." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 336, + 479, + 361 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 336, + 479, + 361 + ], + "spans": [ + { + "bbox": [ + 131, + 336, + 479, + 361 + ], + "type": "text", + "content": "provide a concise overview of our GarDiff, followed by the details of the proposed garment-focused vision adapter and appearance loss." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 377, + 208, + 388 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 377, + 208, + 388 + ], + "spans": [ + { + "bbox": [ + 132, + 377, + 208, + 388 + ], + "type": "text", + "content": "3.1 Overview" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "spans": [ + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "text", + "content": "Generally, given a person image " + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_p\\in \\mathbb{R}^{H\\times W\\times 3}" + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "text", + "content": " and in-shop garment " + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c\\in" + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "inline_equation", + "content": "\\mathbb{R}^{H^{\\prime}\\times W^{\\prime}\\times 3}" + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "text", + "content": ", our GarDiff is optimized to synthesize a high-quality realistic image " + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "inline_equation", + "content": "\\mathbf{I}\\in \\mathbb{R}^{H\\times W\\times 3}" + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "text", + "content": ", where the person wears the in-shop garment " + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 131, + 395, + 480, + 480 + ], + "type": "text", + "content": ". To effectively leverage the appearance guidance of the given garment for high-fidelity person image generation, the original cross-attention layers in the UNet of diffusion model are substituted with our proposed garment-focused vision adapter modules. An overview of our GarDiff is illustrated in Figure 2." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "spans": [ + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": "In the forward diffusion process, similar to vanilla diffusion model, we gradually add noise to the target image " + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "inline_equation", + "content": "\\mathbf{I}" + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": " according to the Markov chain. Specifically, we first utilize the VAE encoder " + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "inline_equation", + "content": "\\mathcal{E}(\\cdot)" + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": " to map the target image " + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "inline_equation", + "content": "\\mathbf{I}" + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": " to the latent space: " + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0 = \\mathcal{E}(\\mathbf{I})" + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": ". Then we add noise " + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_0" + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": " at an arbitrary timestep " + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "inline_equation", + "content": "t \\in [1, 1000]" + }, + { + "bbox": [ + 131, + 481, + 480, + 539 + ], + "type": "text", + "content": " as follows:" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 250, + 540, + 481, + 554 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 250, + 540, + 481, + 554 + ], + "spans": [ + { + "bbox": [ + 250, + 540, + 481, + 554 + ], + "type": "interline_equation", + "content": "\\mathbf {x} _ {t} = \\sqrt {\\alpha_ {t}} \\mathbf {x} _ {0} + \\sqrt {1 - \\alpha_ {t}} \\epsilon , \\tag {1}", + "image_path": "0fcaa7fb212abc92e865e9d51f374d8ca60969e8687a52e98243fbec15566868.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "spans": [ + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "inline_equation", + "content": "\\alpha_{t} = \\prod_{s=1}^{t}(1 - \\beta_{s}), \\epsilon \\sim \\mathcal{N}(0,1)" + }, + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "inline_equation", + "content": "\\beta_{s}" + }, + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "text", + "content": " is the pre-defined variance schedule at timestep " + }, + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 131, + 557, + 479, + 581 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": "In the reverse diffusion process, we first warp the in-shop garment " + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": " similar to [36] to achieve the maximum conformity of the target garment with the body's posture, obtaining the warped garment " + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_w \\in \\mathbb{R}^{H' \\times W' \\times 3}" + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": " and warped mask " + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{m}_w \\in \\{0,1\\}^{H \\times W}" + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": ". The warped mask " + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{m}_w" + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": " indicates the area of the warped garment. To preserve the area unrelated to the garment, a garment-agnostic image " + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_a" + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": " with the region intended for garment placement fully masked from the person image " + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_p" + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": " is also extracted. Then, the noisy image latent " + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t" + }, + { + "bbox": [ + 131, + 582, + 481, + 666 + ], + "type": "text", + "content": ", the latent warped garment" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "content": "map " + }, + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_w = \\mathcal{E}(\\mathbf{I}_w)" + }, + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "content": " and the latent agnostic map " + }, + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_a = \\mathcal{E}(\\mathbf{I}_a)" + }, + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "content": " are concatenated along the channel dimension, leading to the input of the UNet " + }, + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 130, + 116, + 479, + 151 + ], + "type": "text", + "content": " [30] of the diffusion model:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 255, + 153, + 481, + 166 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 153, + 481, + 166 + ], + "spans": [ + { + "bbox": [ + 255, + 153, + 481, + 166 + ], + "type": "interline_equation", + "content": "\\gamma = \\operatorname {C o n c a t} \\left(\\mathbf {x} _ {w}, \\mathbf {x} _ {a}, \\mathbf {x} _ {t}\\right). \\tag {2}", + "image_path": "713c5ae4b5d4da3c3d7c70ba2360807c9448973e0d272ab5898617cd93696da8.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "spans": [ + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "text", + "content": "During denoising, the UNet is trained to predict the added noise " + }, + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "text", + "content": " conditioned on the target garment " + }, + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "text", + "content": " and warped garment " + }, + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_w" + }, + { + "bbox": [ + 131, + 172, + 479, + 208 + ], + "type": "text", + "content": ". The objective function is formed as the mean-squared loss:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 242, + 219, + 481, + 232 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 219, + 481, + 232 + ], + "spans": [ + { + "bbox": [ + 242, + 219, + 481, + 232 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {m s e} = \\left\\| \\epsilon - \\epsilon_ {\\theta} (\\gamma , \\mathbf {I} _ {c}, \\mathbf {I} _ {w}, t) \\right\\| _ {2} ^ {2}. \\tag {3}", + "image_path": "1c5f534f4159bba02bdce61a3358554807af1adf898493e4a854772fda1de201.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 251, + 294, + 264 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 294, + 264 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 294, + 264 + ], + "type": "text", + "content": "3.2 Garment-Focused Adapter" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 273, + 480, + 368 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 273, + 480, + 368 + ], + "spans": [ + { + "bbox": [ + 130, + 273, + 480, + 368 + ], + "type": "text", + "content": "To retain the appearance details of the given garment, previous works [12,25,42] merely steer the diffusion process with the garment appearance captured by CLIP vision encoder. However, it is difficult for CLIP vision encoder to perceive the fine-grained details in the target garment, since CLIP is optimized for image-text alignment at a coarse level. In our experiments, we found that VAE, serving as the reconstruction module for stable diffusion, exhibits much stronger capabilities in preserving texture details in images than CLIP. Therefore, it would be beneficial to involve VAE as additional appearance prior into stable diffusion." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "spans": [ + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": "Technically, we replace the cross-attention layer with a vision adapter in each Transformer block. The vision adapter takes two appearance priors as inputs: 1) the VAE embeddings of the warped rendition " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_w" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": " of the target garment " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": " for recovering the complex patterns in the synthesized image, 2) the CLIP visual embeddings of " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": " for generating the holistic structure regardless of the imperfection of the warped result " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_w" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": ". Specifically, given the target garment " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_c" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": " and the warped garment " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{I}_w" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": ", the CLIP visual embeddings " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{clip}" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": " and VAE embeddings " + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_{vae}" + }, + { + "bbox": [ + 131, + 369, + 482, + 465 + ], + "type": "text", + "content": " are calculated as:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 242, + 475, + 481, + 495 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 475, + 481, + 495 + ], + "spans": [ + { + "bbox": [ + 242, + 475, + 481, + 495 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathbf {f} _ {\\text {c l i p}} = \\mathbf {M L P} ^ {\\text {c l i p}} \\left(\\mathbf {C L I P} _ {v} \\left(\\mathbf {I} _ {c}\\right)\\right), \\\\ \\mathbf {f} _ {\\text {c l i p}} = \\mathbf {M L P} ^ {\\text {v a e}} \\left(\\mathbf {S} \\left(\\mathbf {I} _ {c}\\right)\\right) \\end{array} \\tag {4}", + "image_path": "579f65ec71e11582852983dc0fa40d03b6673b9254ac3869b5e16b69dc81595a.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 242, + 491, + 347, + 502 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 491, + 347, + 502 + ], + "spans": [ + { + "bbox": [ + 242, + 491, + 347, + 502 + ], + "type": "interline_equation", + "content": "\\mathbf {f} _ {v a e} = \\mathbf {M L P} ^ {v a e} (\\mathcal {E} (\\mathbf {I} _ {w})),", + "image_path": "f190fc4d5a7df68022db5041f588f0e263033282c64522b324e5affb7edab34d.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "spans": [ + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "inline_equation", + "content": "\\mathbf{CLIP}_v" + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "inline_equation", + "content": "\\mathbf{MLP}^{clip}" + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "inline_equation", + "content": "\\mathbf{MLP}^{vae}" + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "text", + "content": " are the CLIP vision encoder, multi-layer perceptrons for CLIP visual embeddings and VAE embeddings, respectively. Considering the two embeddings focus on different granularity levels of the target garment, a decoupled cross-attention mechanism is devised in the vision adapter to separate the cross-attention layers for the CLIP visual embeddings and VAE embeddings. Given the features " + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "inline_equation", + "content": "\\mathbf{f}_q" + }, + { + "bbox": [ + 130, + 514, + 479, + 598 + ], + "type": "text", + "content": " from the last self-attention layer, the vision adapter operates as follows:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 163, + 609, + 451, + 634 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 163, + 609, + 451, + 634 + ], + "spans": [ + { + "bbox": [ + 163, + 609, + 451, + 634 + ], + "type": "interline_equation", + "content": "\\mathbf {Z} _ {a t t n} = S o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {c l i p}) ^ {\\top}}{\\sqrt {d}}) \\mathbf {V} _ {c l i p} + S o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {v a e}) ^ {\\top}}{\\sqrt {d}}) \\mathbf {V} _ {v a e},", + "image_path": "bfd6e8b1788a79cff53368e73ac08a4fb5359e39e76fac63fd726107980e36e9.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 178, + 632, + 480, + 651 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 178, + 632, + 480, + 651 + ], + "spans": [ + { + "bbox": [ + 178, + 632, + 480, + 651 + ], + "type": "interline_equation", + "content": "\\mathbf {Q} = \\mathbf {f} _ {q} \\mathbf {W} ^ {q}, \\mathbf {K} _ {c l i p} = \\mathbf {f} _ {c l i p} \\mathbf {W} _ {c l i p} ^ {k}, \\mathbf {V} _ {c l i p} = \\mathbf {f} _ {c l i p} \\mathbf {W} _ {c l i p} ^ {v}, \\tag {5}", + "image_path": "ddc34b5daab97f17b650621950fa33a71a087a58d3730230b16155bf4fc02a9f.jpg" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 234, + 654, + 397, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 234, + 654, + 397, + 667 + ], + "spans": [ + { + "bbox": [ + 234, + 654, + 397, + 667 + ], + "type": "interline_equation", + "content": "\\mathbf {K} _ {v a e} = \\mathbf {f} _ {v a e} \\mathbf {W} _ {v a e} ^ {k}, \\mathbf {V} _ {v a e} = \\mathbf {f} _ {v a e} \\mathbf {W} _ {v a e} ^ {v},", + "image_path": "93b23b8ecce0cde816cdbe63cd7e749ceb8072605bb4d754f36af57a1316ac90.jpg" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\mathbf{W}^q" + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_*^k" + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "inline_equation", + "content": "\\mathbf{W}_*^v" + }, + { + "bbox": [ + 130, + 115, + 479, + 140 + ], + "type": "text", + "content": " are the trainable projection matrices in the decoupled cross-attention of the vision adapter for queries, keys and values, respectively." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 296 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 296 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 296 + ], + "type": "text", + "content": "It is relatively easier for the model to achieve favorable results on the regions devoid of garments, such as the torso skin, since those regions usually exhibit simpler patterns or textures. Therefore, improving virtual try-on results hinges critically upon the restoration of the fine-grained details in the given garment. In light of this, we propose to amplify the garment-focused guidance in the diffusion process. Specifically, the vision adapter is further upgraded with a novel garment-focused attention, leading to a garment-focused (GF) adapter that aims to pursue local fine-grained alignment with the visual appearance of the reference garment and human pose. As illustrated in Figure 3, the warped mask " + }, + { + "bbox": [ + 130, + 140, + 482, + 296 + ], + "type": "inline_equation", + "content": "\\mathbf{m}_w" + }, + { + "bbox": [ + 130, + 140, + 482, + 296 + ], + "type": "text", + "content": " is downsampled to an attention mask " + }, + { + "bbox": [ + 130, + 140, + 482, + 296 + ], + "type": "inline_equation", + "content": "\\mathbf{M}_{attn}" + }, + { + "bbox": [ + 130, + 140, + 482, + 296 + ], + "type": "text", + "content": " that matches the resolution of the corresponding attention layer in the GF adapter, which is leveraged to suppress the attention weights unrelated to garment area in the attention map. Hence, Equation (5) can be reformulated for the garment-focused adapter as follows:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 197, + 303, + 480, + 357 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 303, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 197, + 303, + 480, + 357 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathbf {Z} _ {\\text {a t t n}} ^ {\\text {m a s k}} = \\left[ \\operatorname {s o f t m a x} \\left(\\frac {\\mathbf {Q} \\left(\\mathbf {K} _ {\\text {c l i p}}\\right) ^ {\\top}}{\\sqrt {d}}\\right) \\odot \\mathbf {M} _ {\\text {a t t n}} \\right] \\times \\mathbf {V} _ {\\text {c l i p}} + \\tag {6} \\\\ [ s o f t m a x (\\frac {\\mathbf {Q} (\\mathbf {K} _ {v a e}) ^ {\\top}}{\\sqrt {d}}) \\odot \\mathbf {M} _ {a t t n} ] \\times \\mathbf {V} _ {v a e}. \\\\ \\end{array}", + "image_path": "8c84e66e30c20fb8ecbe9139975c8205d7864ae884718eb9a1fca8b94939cf46.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 372, + 246, + 384 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 372, + 246, + 384 + ], + "spans": [ + { + "bbox": [ + 131, + 372, + 246, + 384 + ], + "type": "text", + "content": "3.3 Appearance Loss" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 389, + 482, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 482, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 482, + 510 + ], + "type": "text", + "content": "Generally, diffusion model is merely optimized with the mean-squared loss defined in Equation (3), which treats all the regions of the synthesized image equally without emphasizing the texture details in the garment area, failing to generate the accurate garment patterns. As complicated details in the in-shop garment typically manifest as high-frequency components (i.e., edges), a novel appearance loss is proposed to enforce the synthesized garment to be geometrically consistent with the high-frequency details of the reference garment, achieving improved fidelity and fine-grained textures. The appearance loss, as a composite adaptation loss, can be decomposed into two components: a spatial perceptual loss " + }, + { + "bbox": [ + 130, + 389, + 482, + 510 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text{spatial}}" + }, + { + "bbox": [ + 130, + 389, + 482, + 510 + ], + "type": "text", + "content": " and a high-frequency promoted loss " + }, + { + "bbox": [ + 130, + 389, + 482, + 510 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{\\text{high-freq}}" + }, + { + "bbox": [ + 130, + 389, + 482, + 510 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "text", + "content": "Specifically, we estimate the latent " + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{x}}_0" + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "text", + "content": " given the noisy one " + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "inline_equation", + "content": "\\mathbf{x}_t" + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "text", + "content": " and the predicted noise " + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "inline_equation", + "content": "\\epsilon_t" + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "text", + "content": " from the UNet at timestep " + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 510, + 481, + 534 + ], + "type": "text", + "content": " by reversing the process in Equation (1):" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 260, + 541, + 480, + 569 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 260, + 541, + 480, + 569 + ], + "spans": [ + { + "bbox": [ + 260, + 541, + 480, + 569 + ], + "type": "interline_equation", + "content": "\\hat {\\mathbf {x}} _ {0} = \\frac {\\mathbf {x} _ {t} - \\sqrt {1 - \\alpha_ {t}} \\epsilon_ {t}}{\\sqrt {\\alpha_ {t}}}. \\tag {7}", + "image_path": "72a63e2959caf454b22d2be053d8508dbc93219f2d8a81c5b44bfec8c6b058e3.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "spans": [ + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "text", + "content": "The latent " + }, + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{x}}_0" + }, + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "text", + "content": " is further converted back to the pixel space by the VAE decoder " + }, + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "inline_equation", + "content": "\\mathcal{D}" + }, + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "text", + "content": ", leading to the predicted image " + }, + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{l}}" + }, + { + "bbox": [ + 131, + 573, + 479, + 597 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 597, + 481, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 481, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 481, + 647 + ], + "type": "text", + "content": "Spatial Perceptual Loss. Inspired by the Deep Image Structure and Texture Similarity (DISTS) metric [7], the spatial perceptual loss is designed to capture both the structural and textural disparities between the predicted and ground-truth images in a perceptual feature space beyond pixels:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 227, + 654, + 480, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 654, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 227, + 654, + 480, + 666 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {s p a t i a l}} = \\mathcal {L} _ {\\text {D I S T S}} (\\mathbf {I} \\odot \\mathbf {m} _ {w}, \\mathbf {I} \\odot \\mathbf {m} _ {w}). \\tag {8}", + "image_path": "312d5d436ce6b4393600de0d7da38a3db4f00a525f0453568373db78bb0974ac.jpg" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 175, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 175, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 447, + 128 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 447, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 447, + 128 + ], + "type": "text", + "content": "Note that we use the warped mask " + }, + { + "bbox": [ + 132, + 116, + 447, + 128 + ], + "type": "inline_equation", + "content": "\\mathbf{m}_w" + }, + { + "bbox": [ + 132, + 116, + 447, + 128 + ], + "type": "text", + "content": " to emphasize the garment area." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 129, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 129, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 129, + 482, + 200 + ], + "type": "text", + "content": "High-Frequency Promoted Loss. To substantively enhance the model's proficiency in generating high-frequency details, we employ edge detection to extract high-frequency information. Technically, the horizontal and vertical Sobel kernels are adopted as the high-pass filters to extract the edge maps " + }, + { + "bbox": [ + 130, + 129, + 482, + 200 + ], + "type": "inline_equation", + "content": "\\hat{\\mathbf{I}}_h / \\mathbf{I}_h" + }, + { + "bbox": [ + 130, + 129, + 482, + 200 + ], + "type": "text", + "content": " from the predicted/target image, respectively. Formally, the high-frequency promoted loss is defined as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 225, + 209, + 481, + 224 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 225, + 209, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 225, + 209, + 481, + 224 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {h i g h - f r e q}} = \\left\\| \\tilde {\\mathbf {I}} _ {h} \\odot \\mathbf {m} _ {w} - \\mathbf {I} _ {h} \\odot \\mathbf {m} _ {w} \\right\\| ^ {2}. \\tag {9}", + "image_path": "057e3423266744e7906b39d119c5ffd8ad774ce1175e9c59bccc90bd77ca3c60.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 232, + 468, + 244 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 232, + 468, + 244 + ], + "spans": [ + { + "bbox": [ + 132, + 232, + 468, + 244 + ], + "type": "text", + "content": "Finally, the UNet is optimized by the following improved objective function:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 230, + 254, + 480, + 281 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 230, + 254, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 230, + 254, + 480, + 281 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} = \\mathcal {L} _ {m s e} + \\lambda \\mathcal {L} _ {\\text {a p p e a r a n c e}}, \\tag {10} \\\\ \\mathcal {L} _ {\\text {a p p e a r a n c e}} = \\mathcal {L} _ {\\text {s p a t i a l}} + \\mathcal {L} _ {\\text {h i g h - f r e q}}, \\\\ \\end{array}", + "image_path": "bfca603703c000f5b75649381d96c196cc898629750f7b5affab00c16ee450d0.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 290, + 481, + 314 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 290, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 131, + 290, + 481, + 314 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 290, + 481, + 314 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 131, + 290, + 481, + 314 + ], + "type": "text", + "content": " is the hyper-parameter used to balance the mean-squared loss and the proposed appearance loss." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 333, + 230, + 346 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 333, + 230, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 333, + 230, + 346 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 357, + 273, + 370 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 357, + 273, + 370 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 273, + 370 + ], + "type": "text", + "content": "4.1 Experimental Settings" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 378, + 482, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 509 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 509 + ], + "type": "text", + "content": "Dadatasets. We empirically verify and analyze the effectiveness of our GarDiff on two popular virtual try-on datasets, VITON-HD [6] and DressCode [26]. The VITON-HD dataset [6] comprises 13,679 frontal-view woman and upper garment image pairs. In line with the general practices of the previous works [12,25], the dataset is divided into two disjoint subsets: a training set with 11,647 pairs and a test set with 2,032 pairs. The DressCode dataset consists of 53,795 image pairs, which are categorized into three macro-categories: 15,366 for upper-body clothes, 8,951 pairs lower-body clothes and 29,478 for dresses. Following the original splits, 1,800 image pairs from each category are reserved for test while the remaining image pairs are utilized for training. The experiments on DressCode and VITON-HD are conducted at the resolution of " + }, + { + "bbox": [ + 130, + 378, + 482, + 509 + ], + "type": "inline_equation", + "content": "512 \\times 384" + }, + { + "bbox": [ + 130, + 378, + 482, + 509 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 510, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 640 + ], + "type": "text", + "content": "Evaluation Metrics. We evaluate our GarDiff in both paired and unpaired settings following the virtual try-on literature. In the paired setting, the input garment corresponds to the one originally depicted in the person image. Following the standard evaluation setup, Structural Similarity (SSIM) [35] and Learned Perceptual Image Patch Similarity (LPIPS) [40] are adopted to measure the similarity between the generated image and the ground-truth one. Additionally, the Fréchet Inception Distance(FID) [16] and Kernel Inception Distance(KID) [2] are employed to measure the quality and realism of the generated images. In the unpaired setting, where the garment of the person image is changed to a different one and the ground truth is unavailable, we report the performances of GarDiff in terms of FID and KID." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 666 + ], + "type": "text", + "content": "Implementation Details. Our GarDiff is initialized from the pre-trained Stable Diffusion 2.1 and finetuned on the virtual try-on datasets. AdamW [23]" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 173, + 157, + 438, + 248 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 1: Quantitative performance comparisons on VITON-HD dataset. " + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "inline_equation", + "content": "\\mathbf{FID_p} / \\mathbf{KID_p}" + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": " stands for the FID/KID score in paired setting, while " + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "inline_equation", + "content": "\\mathbf{FID_u} / \\mathbf{KID_u}" + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": " stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 173, + 157, + 438, + 248 + ], + "lines": [ + { + "bbox": [ + 173, + 157, + 438, + 248 + ], + "spans": [ + { + "bbox": [ + 173, + 157, + 438, + 248 + ], + "type": "table", + "html": "
ModelSSIM ↑LPIPS↓FIDp ↓KIDp ↓FIDu ↓KIDu ↓
VITON-HD [6]0.8430.076--11.640.300
PF-AFN [10]0.8580.082--11.300.283
HR-VTON [21]0.8780.061--9.900.188
GP-VTON [36]0.8940.080--9.20-
Paint-by-Example [37]0.8430.087--10.150.204
LaDI-VTON [25]0.8790.0596.660.1089.410.167
DCI-VTON [12]0.8960.043--8.090.028
GarDiff0.9120.0366.020.0197.890.027
", + "image_path": "4042e4df8ba9fb429950099c326af3f84f6f5ad6fd805624631b4df546e2a296.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "type": "inline_equation", + "content": "(\\beta_{1} = 0.9, \\beta_{2} = 0.999)" + }, + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "type": "text", + "content": " is employed to optimize the model for " + }, + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "type": "inline_equation", + "content": "200\\mathrm{k}" + }, + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "type": "text", + "content": " steps. The learning rate is set to 0.00005 with linear warmup of 500 iterations. The hyperparameter " + }, + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "type": "inline_equation", + "content": "\\lambda" + }, + { + "bbox": [ + 130, + 270, + 482, + 389 + ], + "type": "text", + "content": " in Equation (10) and the weight decay are set to 0.001 and 0.01, respectively. OpenCLIP ViT-H/14 [19] is utilized to extract the CLIP visual embeddings of the target garment. To enable classifier-free guidance [18], the embeddings of the garment are randomly dropped with a probability of 0.05. We train GarDiff on 4 NVidia RTX4090 GPUs for about four days and the model size is 5.15 GB. During inference, the image is progressively generated over 100 steps with a DDIM [32] sampler, and the scale of classifier-free guidance is set to 7.5 by default." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 407, + 264, + 418 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 407, + 264, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 407, + 264, + 418 + ], + "type": "text", + "content": "4.2 Quantitative Results" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 426, + 482, + 668 + ], + "type": "text", + "content": "VITON-HD. We compare our GarDiff with a series of state-of-the-art virtual try-on methods including GAN-based methods (VITON-HD [6], PF-AFN [10], HR-VTON [21], GP-VTON [36]) and Diffusion-based methods (DCI-VTON [12], Paint-by-Example [37] and LaDI-VTON [25]). Table 1 summarizes the performance comparisons on the VITON-HD dataset. It can be easily observed that our proposed GarDiff consistently demonstrates superior performances compared to the other methods across all the evaluation metrics. In particular, GP-VITON improves VITON-HD by introducing the try-on condition generator that serves as a unified module in warping and segmentation generation stages. Paint-by-Example further boosts the performances by framing the VTON task as exemplar-based image inpainting and filling the target region of source image with the garment in the reference image. By exploiting the textual inversion to maintain the details of the in-shop garment, LaDI-VTON exhibits better performance than Paint-by-Example. Moreover, DCI-VTON leverages a warping network to guide the image generation of diffusion model, leading to clear performance boosts. However, these existing approaches merely steer the generation process at a coarse level, and thus fail to perfectly retain the details of the given garment. On the contrary, our GarDiff facilitates the preservation of the garment's appearance by excavating the garment-focused prior knowledge and strengthening diffusion process with these amplified garment-focused guidance," + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 183, + 157, + 431, + 441 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 2: Quantitative performance comparisons on DressCode dataset. " + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "inline_equation", + "content": "\\mathbf{{FID}}_{\\mathbf{p}}/{\\mathbf{{KID}}}_{\\mathbf{p}}" + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": " stands for the FID/KID score in paired setting, while " + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "inline_equation", + "content": "{\\mathbf{{FID}}}_{\\mathbf{u}}/{\\mathbf{{KID}}}_{\\mathbf{u}}" + }, + { + "bbox": [ + 132, + 114, + 482, + 148 + ], + "type": "text", + "content": " stands for the FID/KID score in unpaired setting. Note that the KID score is multiplied by 100 ." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 183, + 157, + 431, + 441 + ], + "lines": [ + { + "bbox": [ + 183, + 157, + 431, + 441 + ], + "spans": [ + { + "bbox": [ + 183, + 157, + 431, + 441 + ], + "type": "table", + "html": "
DatasetDC_upper-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9180.07819.701.1622.1812.09
PF-AFN [10]0.918---14.32-
PSAD [26]0.9380.04913.870.64017.517.15
GP-VTON [36]0.9470.036--11.98-
LaDI-VTON [25]0.9280.0499.530.19813.262.67
DCI-VTON [12]-0.030--10.82-
GarDiff0.9520.0308.690.14411.322.34
DatasetDC_lower-body
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.9130.083--18.8510.24
PF-AFN [10]0.907---18.32-
PSAD [26]0.9320.05113.140.55919.688.90
GP-VTON [36]0.9410.042--16.07-
LaDI-VTON [25]0.9220.0518.520.10414.803.13
DCI-VTON [12]-0.035--12.34-
GarDiff0.9390.0358.010.09012.292.88
DatasetDC_dresses
ModelSSIM ↑ LPIPS ↓ FIDp ↓ KIDp ↓ FIDu ↓ KIDu ↓
CP-VTON+ [24]0.8630.12318.751.1121.8312.31
PF-AFN [10]0.869---13.59-
PSAD [26]0.8850.07412.380.46817.076.66
GP-VTON [36]0.8860.072--12.26-
LaDI-VTON [25]0.8680.0899.070.11213.402.50
DCI-VTON [12]-0.068--12.25-
GarDiff0.8910.0658.770.09612.052.09
", + "image_path": "074c8ec396f237a0511a07e2539b90a4694117dc2824f0d24cdf1ebaa5172578.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 462, + 480, + 497 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 462, + 480, + 497 + ], + "spans": [ + { + "bbox": [ + 130, + 462, + 480, + 497 + ], + "type": "text", + "content": "achieving much better results in VTON task. Specifically, our GarDiff achieves 0.912 on SSIM score and makes a relative improvement of " + }, + { + "bbox": [ + 130, + 462, + 480, + 497 + ], + "type": "inline_equation", + "content": "1.78\\%" + }, + { + "bbox": [ + 130, + 462, + 480, + 497 + ], + "type": "text", + "content": " against the best competitor DCI-VTON." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "text", + "content": "DressCode. Table 2 summarizes the performance comparisons on the Dress-Code dataset. Similar to the observations on VITON-HD, our proposed GarDiff surpasses the performances of the other competing methods across all the three macro-categories, which again evinces the pivotal merit of the garment-focused appearance guidance for preserving fine-grained garment attributes in the generated images. Particularly, our GarDiff leads to the relative improvements over LaDI-VTON by " + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "inline_equation", + "content": "2.58\\%" + }, + { + "bbox": [ + 130, + 498, + 482, + 582 + ], + "type": "text", + "content": " on SSIM for upper-body settings." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 598, + 257, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 598, + 257, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 598, + 257, + 609 + ], + "type": "text", + "content": "4.3 Qualitative Results" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": "Figure 4 showcases several virtual try-on results of different methods, coupled with the input person image and in-shop garment. As evidenced by the presented exemplar results, all the approaches demonstrate a certain degree of proficiency in resembling the appearance and texture details of the input in-shop" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 138, + 121, + 476, + 407 + ], + "blocks": [ + { + "bbox": [ + 138, + 121, + 476, + 407 + ], + "lines": [ + { + "bbox": [ + 138, + 121, + 476, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 121, + 476, + 407 + ], + "type": "image", + "image_path": "011d3f6b1fe72f6b79b21cfe19675ffe4051f24f4991ac955902138e8d326b60.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 420, + 482, + 444 + ], + "lines": [ + { + "bbox": [ + 130, + 420, + 482, + 444 + ], + "spans": [ + { + "bbox": [ + 130, + 420, + 482, + 444 + ], + "type": "text", + "content": "Fig. 4: Examples generated by VITON-HD, HR-VTON, GP-VTON, LaDI-VTON, DCI-VTON and our GarDiff." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 471, + 482, + 639 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 471, + 482, + 639 + ], + "spans": [ + { + "bbox": [ + 130, + 471, + 482, + 639 + ], + "type": "text", + "content": "garments. Specifically, Diffusion-based methods (LaDI-VTON, DCI-VTON and our GarDiff) consistently outperform the GAN-based approaches (VITON-HD, HR-VTON and GP-VTON) by leveraging the strong capability of diffusion models in generating high-fidelity images. Despite both DCI-VTON and our GarDiff capitalizing on diffusion models, the former approach achieves inferior results to the latter. The underlying rationale lies in the fact that DCI-VTON guides the diffusion process with CLIP visual embeddings of the garment only, while our GarDiff additionally leverages the appearance prior from the VAE encoder through a vision adapter to better preserve the fine-grained details. Moreover, GarDiff is further upgraded with garment-focused attention mechanism and optimized with a new appearance loss to steer the diffusion process with amplified garment-focused guidance, yielding images with enhanced local alignment to the appearance of the garment. For example, our GarDiff better restores the text \"wrangler\" on the garment than DCI-VTON in the fourth row." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 641, + 485, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 485, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 485, + 666 + ], + "type": "text", + "content": "Furthermore, we conduct human study to compare our GarDiff against five strong baselines (HR-VTON, VITON-HD, GP-VTON, Ladi-VTON, DCI-VTON)" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 175, + 121, + 440, + 190 + ], + "blocks": [ + { + "bbox": [ + 175, + 121, + 440, + 190 + ], + "lines": [ + { + "bbox": [ + 175, + 121, + 440, + 190 + ], + "spans": [ + { + "bbox": [ + 175, + 121, + 440, + 190 + ], + "type": "image", + "image_path": "62078bf291cf64b276edf2cd270bd9cbed9cb05f3b0bcbf8e54db2faadb07940.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 205, + 480, + 217 + ], + "lines": [ + { + "bbox": [ + 132, + 205, + 480, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 480, + 217 + ], + "type": "text", + "content": "Fig. 5: User study on 100 garment-person pairs randomly sampled from VITON-HD." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 180, + 262, + 431, + 316 + ], + "blocks": [ + { + "bbox": [ + 131, + 230, + 482, + 253 + ], + "lines": [ + { + "bbox": [ + 131, + 230, + 482, + 253 + ], + "spans": [ + { + "bbox": [ + 131, + 230, + 482, + 253 + ], + "type": "text", + "content": "Table 3: Ablation study of our proposed GarDiff on VITON-HD dataset. Base: based model; GFA: garment-focused adapter; AL: appearance loss." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 180, + 262, + 431, + 316 + ], + "lines": [ + { + "bbox": [ + 180, + 262, + 431, + 316 + ], + "spans": [ + { + "bbox": [ + 180, + 262, + 431, + 316 + ], + "type": "table", + "html": "
ModelSSIM ↑LPIPS↓FIDp↓KIDp↓FIDu↓KIDu
Base0.8090.11710.030.19010.960.473
Base+AL0.8290.0908.720.10310.220.300
Base+GFA0.8980.0526.610.0478.210.069
Base+GFA+AL0.9120.0366.020.0197.890.027
", + "image_path": "bac95d87d5da514878071e981f81bfa87235e35a12d59203859bd8d8ff448489.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 340, + 482, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 340, + 482, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 340, + 482, + 413 + ], + "type": "text", + "content": "over 100 randomly sampled garment-person pairs in VITON-HD (unpaired setting). 10 evaluators from diverse education background are invited to rank the best VTON result between our GarDiff and the five competing methods based on two criteria: (1) garment detail preservation, (2) human pose alignment. Figure 5 shows the percentages of top-1 ranking for each method, and our GarDiff achieves the best results in both evaluated dimensions." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 436, + 287, + 448 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 436, + 287, + 448 + ], + "spans": [ + { + "bbox": [ + 132, + 436, + 287, + 448 + ], + "type": "text", + "content": "4.4 Analysis and Discussions" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 460, + 482, + 605 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 460, + 482, + 605 + ], + "spans": [ + { + "bbox": [ + 130, + 460, + 482, + 605 + ], + "type": "text", + "content": "Ablation Study on GarDiff. We conduct an ablation study to investigate how each design in our GarDiff influences the overall performances on the VITON-HD dataset. Table 3 details the performance comparisons among different ablated runs of our GarDiff. We start from the stable diffusion inpainting as our base model (Base), which replaces the original CLIP text encoder with the CLIP vision encoder. Base + GFA further boosts Base) by concurrently leveraging the CLIP visual embeddings and VAE embeddings to guide the diffusion process, which verifies the merit of applying the appearance prior from VAE. It is not surprising that Base + AL outperforms Base by supervising the training with the novel appearance loss that facilitates the preservation of garment detail. Finally, our full GarDiff (Base + GFA + AL) achieves the best performances through the synergetic integration of the two proposed components." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": "To illustrate the impact of these components more intuitively, we visualize these ablated runs in Figure 6. Compared with other ablated runs, our final model " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{Base} + \\mathbf{GFA} + \\mathbf{AL}" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " (i.e., GarDiff) can preserve most of the fine-grained details of the given garments. Take the first case as an example, compared to the base model Base, " + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{Base} + \\mathbf{GFA}" + }, + { + "bbox": [ + 130, + 605, + 482, + 665 + ], + "type": "text", + "content": " effectively retains texture details of the letters." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 127, + 465, + 277 + ], + "blocks": [ + { + "bbox": [ + 143, + 127, + 465, + 277 + ], + "lines": [ + { + "bbox": [ + 143, + 127, + 465, + 277 + ], + "spans": [ + { + "bbox": [ + 143, + 127, + 465, + 277 + ], + "type": "image", + "image_path": "0ecc8c111f14031d3e2fb99d3cda796e7486b2308a5aadfccbe76ab2f594d129.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 180, + 297, + 432, + 308 + ], + "lines": [ + { + "bbox": [ + 180, + 297, + 432, + 308 + ], + "spans": [ + { + "bbox": [ + 180, + 297, + 432, + 308 + ], + "type": "text", + "content": "Fig. 6: Ablation study on the pivotal components of GarDiff." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 338, + 482, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 363 + ], + "type": "text", + "content": "Similarly, when the garment-focused vision adapter is additionally integrated into the Base model, the generated results are further improved by " + }, + { + "bbox": [ + 130, + 338, + 482, + 363 + ], + "type": "inline_equation", + "content": "\\mathbf{Base} + \\mathbf{A}\\mathbf{L}" + }, + { + "bbox": [ + 130, + 338, + 482, + 363 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 393, + 482, + 538 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 393, + 482, + 538 + ], + "spans": [ + { + "bbox": [ + 130, + 393, + 482, + 538 + ], + "type": "text", + "content": "Effect of Unwarpped Garment. In contrast to the Diffusion-based DCIVTON that merely capitalizes on the warped garment derived from an warping networks for VTON, our GarDiff additionally incorporates the unwarpped garment to faithfully retain the appearance and shape details of the reference garment. In this way, high-quality VTON results can be achieved even when the warped garments predicted from the warping networks are defective. Some examples are shown in Figure 7(a). Regarding the long-sleeve T-shirt on th first row, the warped garment fails to accurately restore the shape of the input garment with one of the sleeves missing. As a result, less favorable outcomes are obtained by solely leveraging the erroneously warped garment. Our GarDiff, employing both the appearance priors over the warped and unwarpped garments, generates high-fidelity images." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 665 + ], + "type": "text", + "content": "Preservation of Fine-grained Details. With the assistance of the proposed garment-focused attention mechanism and appearance loss, our GarDiff is capable of accurately aligning the visual appearance of the garment in the generated samples with the reference one. Figure 7(b) showcases the images synthesized by Diffusion-based competing methods (LaDI-VTON and DCI-VTON) and our proposed GarDiff, involving the cases with fine-grained details. Compared to LaDIVTON and DCI-VTON which fail to achieve satisfactory results, our GarDiff successfully restores the small letters in the garment on the first row." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 176, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 121, + 478, + 290 + ], + "blocks": [ + { + "bbox": [ + 140, + 121, + 478, + 290 + ], + "lines": [ + { + "bbox": [ + 140, + 121, + 478, + 290 + ], + "spans": [ + { + "bbox": [ + 140, + 121, + 478, + 290 + ], + "type": "image", + "image_path": "9eaaaaa91a643e004ceeacde24515822028a14da93471405e40531cdff7646d2.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 300, + 480, + 335 + ], + "lines": [ + { + "bbox": [ + 132, + 300, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 480, + 335 + ], + "type": "text", + "content": "Fig. 7: (a) Examples generated by our GarDiff with or without unwarpped garment. (b) Comparisons between Diffusion-based baselines (LaDI-VTON and DCI-VTON) and our GarDiff regarding the preservation of fine-grained details." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 357, + 220, + 369 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 357, + 220, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 220, + 369 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 381, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 381, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 381, + 482, + 525 + ], + "type": "text", + "content": "In this work, we have presented the Garment-focused Diffusion model (GarDiff) that is capable of preserving the fine-grained details of the target garment in the virtual try-on task. Specifically, GarDiff remoulds the pre-trained latent diffusion model with appearance priors from the CLIP vision encoder and the VAE encoder for the reference garment and then integrates these priors into UNet through a garment-focused vision adapter. In this way, the diffusion process is effectively strengthened with the amplified appearance guidance from the given garment. A novel appearance loss is further devised to enforce the synthesized garment to be consistent with the high-frequency details and the geometric shape of target garment. Extensive experiments conducted on VITON-HD and DressCode datasets demonstrate the superiority of our GarDiff. More remarkably, we achieve new state-of-the-art performances on the two virtual try-on datasets." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "spans": [ + { + "bbox": [ + 130, + 544, + 482, + 604 + ], + "type": "text", + "content": "Broader Impact. Recent advances in generative modeling offer new possibilities for creating and manipulating digital media but also pose risks of generating deceptive content. Our proposed GarDiff might be nefariously used to \"undress\" individuals by substituting their original attire with undergarments for pornographic applications, and we emphatically denounce any such activities." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 140, + 480, + 663 + ], + "type": "list", + "angle": 0, + "index": 26, + "blocks": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "spans": [ + { + "bbox": [ + 138, + 140, + 480, + 161 + ], + "type": "text", + "content": "1. Bai, S., Zhou, H., Li, Z., Zhou, C., Yang, H.: Single stage virtual try-on via deformable attention flows. In: ECCV (2022) 2, 3" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "spans": [ + { + "bbox": [ + 138, + 162, + 480, + 183 + ], + "type": "text", + "content": "2. Binkowski, M., Sutherland, D.J., Arbel, M., Gretton, A.: Demystifying mmd gans. In: ICLR (2018) 8" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 184, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 184, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 138, + 184, + 480, + 205 + ], + "type": "text", + "content": "3. Bookstein, F.L.: Principal warps: Thin-plate splines and the decomposition of deformations. IEEE TPAMI 11(6), 567-585 (1989) 3" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 206, + 480, + 227 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 206, + 480, + 227 + ], + "spans": [ + { + "bbox": [ + 138, + 206, + 480, + 227 + ], + "type": "text", + "content": "4. Chen, J., Pan, Y., Yao, T., Mei, T.: Controlstyle: Text-driven stylized image generation using diffusion priors. In: ACM MM (2023) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 228, + 480, + 249 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 228, + 480, + 249 + ], + "spans": [ + { + "bbox": [ + 138, + 228, + 480, + 249 + ], + "type": "text", + "content": "5. Chen, Y., Pan, Y., Li, Y., Yao, T., Mei, T.: Control3d: Towards controllable text-to-3d generation. In: ACM MM (2023) 2" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 250, + 480, + 271 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 250, + 480, + 271 + ], + "spans": [ + { + "bbox": [ + 138, + 250, + 480, + 271 + ], + "type": "text", + "content": "6. Choi, S., Park, S., Lee, M., Choo, J.: Viton-hd: High-resolution virtual try-on via misalignment-aware normalization. In: CVPR (2021) 2, 3, 8, 9" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 272, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 272, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 272, + 480, + 293 + ], + "type": "text", + "content": "7. Ding, K., Ma, K., Wang, S., Simoncelli, E.P.: Image quality assessment: Unifying structure and texture similarity. IEEE TPAMI 44(5), 2567-2581 (2020) 7" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 294, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 294, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 138, + 294, + 480, + 315 + ], + "type": "text", + "content": "8. Dong, H., Liang, X., Shen, X., Wu, B., Chen, B.C., Yin, J.: Fw-gan: Flow-navigated warping gan for video virtual try-on. In: ICCV (2019) 2, 3" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 316, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 480, + 346 + ], + "type": "text", + "content": "9. Fenocchi, E., Morelli, D., Cornia, M., Baraldi, L., Cesari, F., Cucchiara, R.: Dual-branch collaborative transformer for virtual try-on. In: CVPR Workshops (2022) 2, 3" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 348, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 348, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 138, + 348, + 480, + 369 + ], + "type": "text", + "content": "10. Ge, Y., Song, Y., Zhang, R., Ge, C., Liu, W., Luo, P.: Parser-free virtual try-on via distilling appearance flows. In: CVPR (2021) 2, 3, 9, 10" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 480, + 392 + ], + "type": "text", + "content": "1. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: NeurIPS (2014) 2" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 480, + 424 + ], + "type": "text", + "content": "2. Gou, J., Sun, S., Zhang, J., Si, J., Qian, C., Zhang, L.: Taming the power of diffusion models for high-quality virtual try-on with appearance flow. In: ACM MM (2023) 2, 4, 6, 8, 9, 10" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 425, + 480, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 425, + 480, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 425, + 480, + 446 + ], + "type": "text", + "content": "3. Gu, S., Chen, D., Bao, J., Wen, F., Zhang, B., Chen, D., Yuan, L., Guo, B.: Vector quantized diffusion model for text-to-image synthesis. In: CVPR (2022) 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 447, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 447, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 447, + 480, + 468 + ], + "type": "text", + "content": "4. Han, X., Wu, Z., Wu, Z., Yu, R., Davis, L.S.: Viton: An image-based virtual try-on network. In: CVPR (2018) 2, 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 469, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 469, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 138, + 469, + 480, + 490 + ], + "type": "text", + "content": "5. He, S., Song, Y.Z., Xiang, T.: Style-based global appearance flow for virtual try-on. In: CVPR (2022) 2, 3" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 491, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 480, + 522 + ], + "type": "text", + "content": "6. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In: NeurIPS (2017) 8" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 523, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 480, + 544 + ], + "type": "text", + "content": "7. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: NeurIPS (2020) 2, 4" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 545, + 480, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 480, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 480, + 567 + ], + "type": "text", + "content": "8. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) 9" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 138, + 567, + 480, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 480, + 589 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 480, + 589 + ], + "type": "text", + "content": "9. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., et al.: Openclip. Zenodo 4, 5 (2021) 9" + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 138, + 590, + 473, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 590, + 473, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 590, + 473, + 599 + ], + "type": "text", + "content": "20. Kingma, D.P., Welling, M.: Auto-encoding variational bayes. In: ICLR (2014) 3" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 621 + ], + "type": "text", + "content": "21. Lee, S., Gu, G., Park, S., Choi, S., Choo, J.: High-resolution virtual try-on with misalignment and occlusion-handled conditions. In: ECCV (2022) 2, 3, 9" + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 622, + 480, + 643 + ], + "type": "text", + "content": "22. Li, K., Chong, M.J., Zhang, J., Liu, J.: Toward accurate and realistic outfits visualization with attention to details. In: CVPR (2021) 2, 3" + } + ] + } + ], + "index": 24 + }, + { + "bbox": [ + 138, + 644, + 480, + 663 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 480, + 663 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 480, + 663 + ], + "type": "text", + "content": "23. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: ICLR (2019) 8" + } + ] + } + ], + "index": 25 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 176, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Virtual Try-On with Garment-focused Diffusion Models" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 657 + ], + "type": "list", + "angle": 0, + "index": 22, + "blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 481, + 148 + ], + "type": "text", + "content": "24. Minar, M.R., Tuan, T.T., Ahn, H., Rosin, P., Lai, Y.K.: Cp-vton+: Clothing shape and texture preserving image-based virtual try-on. In: CVPR Workshops (2020) 2, 3, 10" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 149, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 149, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 132, + 149, + 481, + 182 + ], + "type": "text", + "content": "25. Morelli, D., Baldrati, A., Cartella, G., Cornia, M., Bertini, M., Cucchiara, R.: Ladi-vton: Latent diffusion textual-inversion enhanced virtual try-on. In: ACM MM (2023) 2, 4, 6, 8, 9, 10" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 182, + 481, + 214 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 182, + 481, + 214 + ], + "spans": [ + { + "bbox": [ + 132, + 182, + 481, + 214 + ], + "type": "text", + "content": "26. Morelli, D., Fincato, M., Cornia, M., Landi, F., Cesari, F., Cucchiara, R.: Dress code: High-resolution multi-category virtual try-on. In: CVPR Workshops (2022) 8, 10" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 214, + 481, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 214, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 481, + 236 + ], + "type": "text", + "content": "27. Qian, Y., Cai, Q., Pan, Y., Li, Y., Yao, T., Sun, Q., Mei, T.: Boosting diffusion models with moving average sampling in frequency domain. In: CVPR (2024) 2" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 236, + 481, + 269 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 236, + 481, + 269 + ], + "spans": [ + { + "bbox": [ + 132, + 236, + 481, + 269 + ], + "type": "text", + "content": "28. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: ICML (2021) 3" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 269, + 481, + 290 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 269, + 481, + 290 + ], + "spans": [ + { + "bbox": [ + 132, + 269, + 481, + 290 + ], + "type": "text", + "content": "29. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer: High-resolution image synthesis with latent diffusion models. In: CVPR (2022) 2" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 290, + 481, + 312 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 290, + 481, + 312 + ], + "spans": [ + { + "bbox": [ + 132, + 290, + 481, + 312 + ], + "type": "text", + "content": "30. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: MICCAI (2015) 6" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 312, + 481, + 334 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 312, + 481, + 334 + ], + "spans": [ + { + "bbox": [ + 132, + 312, + 481, + 334 + ], + "type": "text", + "content": "31. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: ICML (2015) 2, 4" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 334, + 481, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 334, + 481, + 354 + ], + "spans": [ + { + "bbox": [ + 132, + 334, + 481, + 354 + ], + "type": "text", + "content": "32. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. In: ICLR (2021) 9" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 354, + 481, + 376 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 481, + 376 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 481, + 376 + ], + "type": "text", + "content": "33. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. In: NeurIPS (2019) 2" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 376, + 481, + 398 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 376, + 481, + 398 + ], + "spans": [ + { + "bbox": [ + 132, + 376, + 481, + 398 + ], + "type": "text", + "content": "34. Wang, B., Zheng, H., Liang, X., Chen, Y., Lin, L., Yang, M.: Toward characteristic-preserving image-based virtual try-on network. In: ECCV (2018) 2, 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 398, + 481, + 419 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 398, + 481, + 419 + ], + "spans": [ + { + "bbox": [ + 132, + 398, + 481, + 419 + ], + "type": "text", + "content": "35. Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE TIP (2004) 8" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 419, + 481, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 419, + 481, + 452 + ], + "spans": [ + { + "bbox": [ + 132, + 419, + 481, + 452 + ], + "type": "text", + "content": "36. Xie, Z., Huang, Z., Dong, X., Zhao, F., Dong, H., Zhang, X., Zhu, F., Liang, X.: Gp-vton: Towards general purpose virtual try-on via collaborative local-flow global-parsing learning. In: CVPR (2023) 2, 3, 5, 9, 10" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 452, + 481, + 483 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 452, + 481, + 483 + ], + "spans": [ + { + "bbox": [ + 132, + 452, + 481, + 483 + ], + "type": "text", + "content": "37. Yang, B., Gu, S., Zhang, B., Zhang, T., Chen, X., Sun, X., Chen, D., Wen, F.: Paint by example: Exemplar-based image editing with diffusion models. In: CVPR (2023) 9" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 483, + 481, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 483, + 481, + 515 + ], + "spans": [ + { + "bbox": [ + 132, + 483, + 481, + 515 + ], + "type": "text", + "content": "38. Yang, H., Zhang, R., Guo, X., Liu, W., Zuo, W., Luo, P.: Towards photo-realistic virtual try-on by adaptively generating-preserving image content. In: CVPR (2020) 2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 516, + 481, + 538 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 516, + 481, + 538 + ], + "spans": [ + { + "bbox": [ + 132, + 516, + 481, + 538 + ], + "type": "text", + "content": "39. Yu, R., Wang, X., Xie, X.: Vtnfp: An image-based virtual try-on network with body and clothing feature preservation. In: ICCV (2019) 2, 3" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 538, + 481, + 559 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 538, + 481, + 559 + ], + "spans": [ + { + "bbox": [ + 132, + 538, + 481, + 559 + ], + "type": "text", + "content": "40. Zhang, R., Isola, P., Efros, A.A., Shechtman, E., Wang, O.: The unreasonable effectiveness of deep features as a perceptual metric. In: CVPR (2018) 8" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 132, + 559, + 481, + 591 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 559, + 481, + 591 + ], + "spans": [ + { + "bbox": [ + 132, + 559, + 481, + 591 + ], + "type": "text", + "content": "41. Zhang, Z., Long, F., Pan, Y., Qiu, Z., Yao, T., Cao, Y., Mei, T.: Trip: Temporal residual learning with image noise prior for image-to-video diffusion models. In: CVPR (2024) 2" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 132, + 591, + 481, + 624 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 591, + 481, + 624 + ], + "spans": [ + { + "bbox": [ + 132, + 591, + 481, + 624 + ], + "type": "text", + "content": "42. Zhu, L., Yang, D., Zhu, T., Reda, F., Chan, W., Sahara, C., Norouzi, M., Kemelmacher-Shlizerman, I.: Tryondiffusion: A tale of two unets. In: CVPR (2023) 4, 6" + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 132, + 624, + 481, + 657 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 624, + 481, + 657 + ], + "spans": [ + { + "bbox": [ + 132, + 624, + 481, + 657 + ], + "type": "text", + "content": "43. Zhu, R., Pan, Y., Li, Y., Yao, T., Sun, Z., Mei, T., Chen, C.W.: Sd-dit: Unleashing the power of self-supervised discrimination in diffusion transformer. In: CVPR (2024) 2" + } + ] + } + ], + "index": 21 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 228, + 102 + ], + "type": "text", + "content": "Siqi Wan et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_content_list.json b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..2464748b3756f7184a463acc7b96feaa2292cffa --- /dev/null +++ b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_content_list.json @@ -0,0 +1,1694 @@ +[ + { + "type": "text", + "text": "Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples", + "text_level": 1, + "bbox": [ + 228, + 140, + 774, + 208 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Chengen Lai, Shengli Song*, Sitong Yan, and Guangneng Hu", + "bbox": [ + 279, + 234, + 720, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "School of Computer Science and Technology, Xidian University, Xi'an, China {laice, styan}@stu.xidian.edu.cn, shlsong@xidian.edu.cn, njuhgn@gmail.com", + "bbox": [ + 243, + 262, + 756, + 292 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Vision and Language (VL) models have achieved remarkable performance in a variety of multimodal learning tasks. The success of these models is attributed to learning a joint and aligned representation space of visual and text. However, recent popular VL models still struggle with concepts understanding beyond bag-of-objects in images & texts, suffering from compositional reasoning about relationship between objects & attributes and word order. To address the above issues, we create a synthetic multimodal counterfactual dataset (COCO-CF) and propose a novel contrastive learning framework (COMO). We contribute the COCO-CF dataset which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and diffusion models to reduce the bias of bag-of-objects. We contribute the COMO framework for effectively leveraging COCO-CF to treat the counterfactual samples as hard negatives and reweight their importance during contrastive learning. Extensive experiments and ablations show COMO achieved a significant improvement of VL concept understanding on the two VL-Checklist and Winoground benchmarks over five strong VL baselines in their zero-shot setting evaluations. Dataset is available at https://github.com/laichengen/COMO.", + "bbox": [ + 261, + 321, + 738, + 585 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Concepts Understanding $\\cdot$ Contrastive learning $\\cdot$ Multimodal Counterfactual Samples", + "bbox": [ + 261, + 598, + 746, + 627 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 651, + 375, + 667 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Vision and Language (VL) models have recently achieved impressive performance in various challenging multimodal learning tasks, including image-text retrieval [6, 45, 58], visual question answering [1, 2, 55], and captioning [22, 53], thanks to the availability of large paired image-text corpora [25, 37]. These cross-modal tasks are heavily dependent on joint representations of multi-modalities which are typically learned by building interactions between vision and language features [10, 32, 33, 59]. The goal is to learn an effective aligning representation spaces of images and text, typically under a contrastive learning framework [4, 5, 52].", + "bbox": [ + 212, + 680, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author", + "bbox": [ + 218, + 824, + 382, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/c7a1caffe80459c295d0a7c6be09ffb3b57c0716136f43b98a6c62dbe3335477.jpg", + "image_caption": [ + "Fig. 1: Overview of our proposed multimodal counterfactual generation. (a) Standard contrastive text-to-image loss (e.g. CLIP [33]) is easy to solve \"bag-of-objects\"; (b) Contrastive learning with textual counterfactuals (e.g. SVLC [11])) teaches VL models by contrasting between counterfactual texts and original image. (c) Our proposed contrastive learning with multimodal counterfactuals (COMO) generate both textual and visual counterfactuals to improve the VL models' concept understanding by contrasting between counterfactual image (and text) and original text (and image), and matching the counterfactual image with counterfactual text." + ], + "image_footnote": [], + "bbox": [ + 243, + 143, + 733, + 296 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Despite these great advances on various vision and language tasks, they often exploit spurious correlations in datasets as shortcuts during training to fit the dataset [11, 12, 40]. Recent works have found popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks: the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54, 57]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects (see Figure 1(a)).", + "bbox": [ + 212, + 448, + 787, + 630 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we propose a novel COntrastive learning framework with Multimodal cCounterfactuals (COMO) to improve the VL model's concepts understanding and compositional reasoning. We propose a way of leveraging the existing VL pre-training source to improve concepts understanding without any expensive and time-consuming human annotations on object attributes, relations, and states. The idea is to automatically generate a synthetic dataset by injecting counterfactual concepts from powerful pre-trained language and text-to-image stable diffusion [35]. On top of the recently proposed text augmentation [3, 11, 44] (see Figure 1(b)), we go deeper to study the effects of multimodal augmentation—i.e., generating both text counterfactual and image counterfactual examples—on the compositional reasoning performance of VL models trained on such synthetic multimodal counterfactual dataset (see Figure 1(c)).", + "bbox": [ + 212, + 630, + 787, + 811 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 333, + 126 + ], + "page_idx": 1 + }, + { + "type": "page_footnote", + "text": "0 https://huggingface.co/CompVis/stable-diffusion-v1-4", + "bbox": [ + 217, + 824, + 594, + 839 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We empirically find that both text counterfactual and image counterfactual contribute to the improved concepts understanding, demonstrating the necessity of multimodal augmentation.", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our multimodal counterfactual generation not only substitutes the concept in the text by exploiting pretrained masked language models, but also synthesizes the corresponding image by exploiting text-to-image stable diffusion. Compared to textual counterfactual generation, our multimodal counterfactual samples match the counterfactual text and image together, to learn out-of-domain concepts and alleviate the data scarcity in multimodal learning task. The generated multimodal counterfactual dataset improves the quality of image-caption alignment and reduces the bias of bag-of-objects. To effectively enforce the VL model to distinguish between original concepts and substituted concepts, we treat the counterfactual samples as hard negatives by modifying the traditional contrastive loss to dynamically reweigh their importance. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples).", + "bbox": [ + 212, + 191, + 784, + 402 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our main contributions can be summarized as:", + "bbox": [ + 238, + 404, + 580, + 417 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We contribute a multimodal counterfactual dataset (COCO-CF) which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and stable diffusion to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning.", + "- We propose a novel contrastive framework (COMO) for effectively leveraging COCO-CF to treat the multimodal counterfactual samples as hard negatives and reweight their importance during contrastive learning to enforce the VL model differentiating the original concepts from substituted ones.", + "- We demonstrate the compositional reasoning performance of COMO on the two VL-Checklist and Winoground benchmarks with $3.17\\%$ (on VL-Checklist's attribute) and $4.35\\%$ (on Winoground's image) improvement over the current SOTA models, respectively. We also perform detailed ablation on the importance of counterfactual text, counterfactual image, and the new contrastive loss." + ], + "bbox": [ + 225, + 431, + 784, + 643 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 670, + 387, + 686 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Vision and Language Models Pretrained VL models [16, 23, 32] have made impressive performance in various zero-shot downstream tasks, such as image-text retrieval [58]. However, recent research [3, 11, 57] show that existing VL models often exploit spurious correlations between non-causal features as shortcuts during training to fit the dataset [12, 54] and still struggle with vision and language concepts understanding. Popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks:", + "bbox": [ + 212, + 703, + 782, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 321, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects. In this paper, we propose a data-driven technique to improve concepts understanding for typical VL models.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Counterfactual Samples Generation Counterfactual samples are widely used in various computer vision and natural language processing tasks [46, 60]. Counterfactual texts have been shown to improve the robustness of models through random word substitution [36, 47] and swap [54, 56]. Counterfactual captions are generated by rule-based [11, 36, 39] or pretrained language models [11, 44, 51] to enhance semantic coherence and ground the mismatched words [50]. Diffusion models [15] are exploited to generate text-image pairs [38, 43, 48]. Synthetic videos and corresponding text captions are generated by using 3D graphic engines [3]. A counterfactual dataset created by substituting nouns only, ignoring the \"beyond nouns\" concepts [20]. In contrast, we create a multimodal counterfactual dataset (COCO-CF) which is automatically generated from existing VL pre-training source (i.e., MS-COCO) by injecting concepts from off-the-shelf language models and stable diffusion. COCO-CF can be used to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning without any expensive and time-consuming human annotations on object attributes, relations, and states.", + "bbox": [ + 212, + 253, + 787, + 494 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Hard-Negative Contrastive Learning (CL) [14] is exploited to learn aligned representations of text and image in most VL models [9, 18, 42]. Recently, some studies have investigated the selection of hard negative examples [17, 44] and accounted for the importance of different negative samples [7, 32, 34]. We extend the hard negative loss to vision-language concepts understanding by treating the counterfactual samples as hard negatives by modifying the traditional contrastive loss. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples, so as to improve the compositional reasoning about object relation, attributes, state, and word order in texts.", + "bbox": [ + 212, + 496, + 787, + 662 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 215, + 694, + 328, + 709 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, our COntrastive framework with Multimodal cCounterfactual examples (COMO) are presented for improving the VL model's understanding of concepts and enhancing robustness of VL models. As shown in Figure 2, COMO consists of an effective way of generating the multimodal counterfactual text and image samples (see Figure 2(a-b)), and a novel loss of counterfactual guided and weighted contrastive learning (see Figure 2(c)). In the following, we firstly describe the counterfactual text and image samples generation in Section 3.1.", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/3ffea7e6f2ffab9c7fadab034aac63960c6c41f7ec21f8cad9f67c0d25636140.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 264, + 161, + 733, + 224 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/69e51accfcae2108caddbee4c5f19d409afc40fb2231f906bccff69c65043218.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 267, + 224, + 733, + 287 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/7f342fd48658e785b2fb9524bfed9e3a6ed7f6edb3e99773cf7ca341c056f5e2.jpg", + "image_caption": [ + "Fig. 2: The proposed contrastive learning framework with multimodal counterfactual samples (COMO). (a) Generating counterfactual text uses masked language models such as BERT1. (b) Generating counterfactual image uses text-to-image diffusion models2. (c) Counterfactual guided and weighted hard negative contrastive learning. This module feeds the generated counterfactual text and image into the same mini-batch and exploits a hard negative loss to improve the VL models' concept understanding. The longer the red arrow, the further it pushes away." + ], + "image_footnote": [], + "bbox": [ + 267, + 287, + 733, + 407 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Then, we introduce the counterfactual guided and weighted contrastive loss in Section 3.2, respectively.", + "bbox": [ + 212, + 563, + 787, + 594 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Generation of Multimodal Counterfactual", + "text_level": 1, + "bbox": [ + 214, + 619, + 606, + 633 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Recent works [11, 49] have shown the effectiveness of injecting concepts to VL models by textual-modality augmentation. Compared to these works, we improve the VL models' concepts understanding by automatically constructing both textual and visual counterfactual examples in a way of multimodal augmentation. Counterfactual Text Generation To improve the clear understanding of VL models on concepts beyond bag-of-objects and rather than spurious correlated features, we manipulate the original caption $T^o$ to construct its corresponding counterfactual caption $T^c$ with subtle but completely different semantics. Counterfactual text $T^c$ is generated by replacing a concept in $T^o$ , while most of its original details remain the same. In this way, the generated counterfactual caption represents the changed causal concept while remaining preserved", + "bbox": [ + 212, + 647, + 787, + 815 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 321, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "page_footnote", + "text": "1 https://huggingface.co/bert-base-uncased", + "bbox": [ + 217, + 824, + 511, + 839 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "details from the original caption can be viewed as potentially spurious correlated features.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Large or pre-trained language models [8] are capable of suggesting multiple words that fit the context given a sentence with one missing word. We can automatically create a plausible negative sentence which is difficult for VL models to distinguish from its corresponding actual caption by randomly selecting a masked word. Such masked word should be useful for compositional reasoning about objects relation, attributes, and states. This can be achieved by NLP parsing technique to identify all objects (nouns), relations (verbs and adverb), and attributes (adjectives) in the original caption sentence. In specific, we randomly choose a word among these concepts, replace the selected concept in $T^o$ with the [MASK] token, and then retrieve the most probable replacements by the language models unmasking as our generated counterfactual caption $T^c$ (see Figure 2(a)). These counterfactual/negative examples enforce the VL model focusing on the important details that affect the concepts understanding and compositional reasoning.", + "bbox": [ + 212, + 176, + 787, + 387 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Counterfactual Image Generation After creating a counterfactual caption $T^c$ , the VL models can understand the original text-image pair $(T^o, V^o)$ but have no idea of what the corresponding image of counterfactual caption $T^c$ looks like. Therefore, we explicitly generate a corresponding counterfactual image $V^c$ by feeding the counterfactual caption $T^c$ into stable diffusion models (see Figure 2(b)). To control the quality of generated images and enable the changed concept (causal concept) to be learned in the presence of unchanged concepts (spurious concepts) between $T^c$ and $T^o$ , we firstly generate multiple images $\\{V_{ij}\\}_{i=1}^{n}$ . Then we choose the counterfactual image $V^c$ which has the highest similarity score with both the counterfactual caption $T^c$ and the original image $V^o$ by:", + "bbox": [ + 212, + 388, + 787, + 554 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {s c o r e} _ {i} = \\varepsilon_ {T} \\left(T ^ {c}\\right) \\cdot \\varepsilon_ {V} \\left(V _ {i}\\right) + \\varepsilon_ {V} \\left(V ^ {o}\\right) \\cdot \\varepsilon_ {V} \\left(V _ {i}\\right) \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 341, + 569, + 784, + 585 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\varepsilon_T(\\cdot)$ and $\\varepsilon_V(\\cdot)$ are text and image encoders in $\\mathrm{CLIP}^3$ , respectively. The first part of the score measures the consistency between the generated image and counterfactual caption $T^c$ , and the second part measures the similarity between the generated image and the original image $V^o$ .", + "bbox": [ + 212, + 589, + 787, + 650 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Counterfactual Guided and Weighted Contrastive Learning", + "text_level": 1, + "bbox": [ + 212, + 669, + 750, + 686 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Contrastive learning [29] is an effective approach for multimodal alignment, which pulls the positive pairs to anchor nearby locations, while pushes negative pairs further away. A dual-encoder VL model like CLIP [33] admits text-image pair $(T,V)$ and computes their similarity score by:", + "bbox": [ + 212, + 691, + 787, + 753 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nS (T, V) = \\exp (\\boldsymbol {t} ^ {\\top} \\boldsymbol {v} / \\tau) \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 421, + 766, + 784, + 785 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\pmb{t} = \\varepsilon_T(T)$ and $\\pmb{v} = \\varepsilon_V(V)$ are the encoded features of the image-text pair respectively. Temperature $\\tau > 0$ is learnable.", + "bbox": [ + 212, + 787, + 785, + 818 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 5 + }, + { + "type": "page_footnote", + "text": "3 https://openaipublic.azureedge.net/clip/ViT-B-32", + "bbox": [ + 217, + 823, + 570, + 840 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Counterfactual Guided Contrastive Learning The naive contrastive learning with uniform sampling from large-scale datasets can often provide negative samples that are not necessarily discriminative. In our counterfactual guided contrastive learning, we feed the original example with its corresponding counterfactual example into the same mini-batch so as to enforce the VL model differentiates the original concept from substituted concept (see Figure 2(c)).", + "bbox": [ + 212, + 146, + 782, + 236 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Given a mini-batch $\\mathcal{B} = \\{(T_i,V_i)\\}_{i = 1}^n$ of containing the factual and its counterfactual image-caption pairs, the contrastive CLIP-loss [29] is defined as:", + "bbox": [ + 212, + 237, + 782, + 267 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\mathrm {H N}} = - \\sum_ {i = 1} ^ {n} \\left[ \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{\\sum_ {j} S \\left(T _ {i} , V _ {j}\\right)} + \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{\\sum_ {j} S \\left(T _ {j} , V _ {i}\\right)} \\right] \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 297, + 279, + 785, + 314 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The hard negative for factual image-caption $(T^o, V^o)$ (causal concept) is its corresponding counterfactual image-caption $(T^c, V^c)$ (spurious concept), which needs to be pushed far away (see Figure 2(c)).", + "bbox": [ + 212, + 316, + 782, + 363 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Counterfactual Weighted Contrastive Learning To emphasize hard negative pairs (i.e., between the factual example and its corresponding counterfactual example) and push the embedding of counterfactual sample (which is close to the factual example) far away from the anchor, we modify the un-weighted contrastive loss in Eq.3 as the weighted version in the following:", + "bbox": [ + 212, + 364, + 784, + 439 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\begin{array}{l} \\mathcal {L} _ {\\mathrm {H N W}} = - \\sum_ {i = 1} ^ {n} \\left[ \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{S \\left(T _ {i} , V _ {i}\\right) + \\sum_ {j \\neq i} \\boldsymbol {\\alpha} _ {i j} \\cdot S \\left(T _ {i} , V _ {j}\\right)} \\right. \\tag {4} \\\\ \\left. + \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{S \\left(T _ {i} , V _ {i}\\right) + \\sum_ {j \\neq i} \\boldsymbol {\\beta} _ {j i} \\cdot S \\left(T _ {j} , V _ {i}\\right)} \\right] \\\\ \\end{array}\n$$\n", + "text_format": "latex", + "bbox": [ + 303, + 450, + 784, + 522 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where the weights are computed by:", + "bbox": [ + 238, + 526, + 501, + 541 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {\\alpha} _ {i j} = \\frac {(n - 1) \\cdot S \\left(T _ {i} , V _ {j}\\right)}{\\sum_ {k \\neq i} S \\left(T _ {i} , V _ {k}\\right)} \\quad \\beta_ {j i} = \\frac {(n - 1) \\cdot S \\left(T _ {j} , V _ {i}\\right)}{\\sum_ {k \\neq i} S \\left(T _ {k} , V _ {i}\\right)} \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 321, + 551, + 784, + 585 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Weights $\\alpha_{ij}$ and $\\beta_{ij}$ are designed that difficult negative pairs (e.g., between original examples and corresponding counterfactual examples) are emphasized, and easier pairs (e.g., between original examples and other \"bag-of-objects\" examples) are ignored. So, the VL model can more easily understand the concepts beyond objects and improve the compositional reasoning about relation, attribute, and word order. Observe that we get contrastive objective of Eq.3 when setting weights to be all ones. The form of weights is an unnormalized von Mises-Fisher distribution [32].", + "bbox": [ + 212, + 595, + 782, + 715 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 739, + 375, + 757 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 Datasets", + "text_level": 1, + "bbox": [ + 215, + 770, + 333, + 784 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To test the effectiveness of our proposed COMO for improving VL models' vision language concepts understanding, we train the model using our counterfactual image-text pairs generated from MS-COCO [25]. We evaluate on the", + "bbox": [ + 212, + 794, + 782, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 320, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/33b7f601f78f84bf261ce56a256f9bea9153071a488fc357cabcd5cca0cc95d0.jpg", + "table_caption": [ + "Table 1: The statistics of factual and counterfactual examples in the generated COCO-CF dataset." + ], + "table_footnote": [], + "table_body": "
Factual\n# images # textCounterfactual\n# images # textTotal\n# images # text
COCO-CF113K 567K567K 567K680K 1,134K
", + "bbox": [ + 326, + 185, + 669, + 232 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "VL-Checklist [57], Winoground [41] and Zero-Shot Classification [21] datasets over strong VL models. We introduce the training and testing datasets in detail below.", + "bbox": [ + 212, + 273, + 782, + 320 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Training datasets. We start from MS-COCO [25] dataset as our factual samples, where an image has multiple corresponding captions. We automatically generate the counterfactual image-text pairs from COCO with our multimodal counterfactual generation pipeline (see Figure 2(a-b)). The augmented dataset is named as COCO-CF, meaning COCO counterfactual examples. As shown in Table 1, we obtain additional 567K counterfactual images and captions based on the original 113K images and 567K text. Finally, COCO-CF has total 680K images and 1,134K captions.", + "bbox": [ + 212, + 328, + 784, + 448 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Evaluation datasets. We evaluate our models on VL-Checklist, Winoground and Zero-Shot classification datasets.", + "bbox": [ + 214, + 455, + 782, + 484 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "VL-Checklist [57] is a large-scale dataset comprised of Visual Genome [19], SwiG [31], VAW [30], and HAKE [24]. Each image is associated with two captions, a positive and a negative. The positive caption corresponds to the image and is taken from the source dataset. The negative caption is generated from the positive caption by changing one word only, so the resulting sentence no longer corresponds to the image. Depending on the word that was changed, VL-Checklist evaluates seven types of VL concepts divided into three categories: (i) Attributes (color, material, size, state, and action); (ii) Relations (spatial or action relation between two objects and/or humans); and (iii) Objects (spatial location and size).", + "bbox": [ + 212, + 492, + 784, + 643 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Winoground [41] is a dataset that evaluates the ability of VL models for compositional reasoning, specifically understanding the meaning of the sentence after changing the order of its words. An example comprises of two images and two texts. The texts have the same set of words but in a different order, each text corresponding to one image in the paired sample. The Winoground evaluation divide into three metrics: (i) image score - percent of samples where the model picks the correct image for each text; (ii) text score - percent of samples where the model picks the correct text for each image; (iii) group score - percent of samples where both text and image score conditions are satisfied jointly.", + "bbox": [ + 212, + 651, + 784, + 787 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Zero-Shot Classification [21] is a dataset that includes 21 different classification datasets, we evaluate our model and report the average result over the dataset.", + "bbox": [ + 212, + 794, + 782, + 838 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/a884d9ebb2e47913b0c65b3acd0e344e2fc74ab60a1d06f0f68df5799a52ca6f.jpg", + "table_caption": [ + "Table 2: Performance comparison with strong VL baselines on the VL-Checklist, Winoground and 21 classification task datasets in zero-shot setting evaluation." + ], + "table_footnote": [], + "table_body": "
ModelsFine-tuned Dataset SizeVL-ChecklistWinoground21-Zero-Shot Task
RelationAttributeObjectTextImageGroup
CLIP (Radford et al, 2021)None61.8067.3282.9130.5011.008.7556.37
CyCLIP (Goel et al, 2022)None61.1566.9680.8730.5010.759.0055.99
NegCLIP (Yuksekgonul et al, 2023)None63.5272.2381.3529.5010.508.00-
SyVic (Cascante-Bonilla et al, 2023)767K69.3970.3784.6230.0011.509.5054.77
SVLC (Doveh et al, 2023)3M69.6871.1884.7529.7511.009.0055.27
COMO (ours)1.1M71.1673.4486.2031.0012.009.7555.87
Improvement over best baseline-2.12%3.17%1.70%1.60%4.35%2.63%-0.89%
", + "bbox": [ + 218, + 184, + 777, + 323 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Implementation details", + "text_level": 1, + "bbox": [ + 215, + 352, + 450, + 366 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For the multimodal counterfactual samples generation(Sec. 3.1), we use NLP spacy4 to parse the sentence into its components including nouns, verbs, adjectives, adverbs, etc. Then we utilize the popular BERT5 as the masked LMs to generate the counterfactual text. To ensure the words sampled from the LM are true negatives, we obtain the synonyms set of the original word from the WordNet [26], and generate n candidates from the language model. Then we filter out the candidates that belong in the original word's synonyms set and variants (i.e., plural and tense). Finally, we choose the one which has the highest score among the remaining candidates as our counterfactual text. After we generate the counterfactual captions, we use the text-to-image stable diffusion model6 to synthesize multiple images (size set to 10). For the model architecture, following [3,11], we utilize the original CLIP implementation that initialized with the checkpoints of VIT-B/327 released by the OpenAI. We modify the naive contrastive loss in their codebase to our counterfactual guided-and-weighted hard negative contrastive loss (see Eq.4). For the model training, we use Adam optimizer with a 1e-6 initial learning rate and a 1e-7 weight decay for finetuning, where the batch size is set to 16 and the training epochs to 5. We conduct all experiments on one NVIDIA GTX A100-PCIE-40GB GPUs with PyTorch 1.9.0. Our code and model checkpoints will be released upon acceptance together with the generated counterfactual examples COCO-CF dataset.", + "bbox": [ + 217, + 378, + 787, + 680 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 Main Results", + "text_level": 1, + "bbox": [ + 215, + 703, + 370, + 715 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We compare our COMO method with five state-of-the-art methods on three benchmark datasets and the results are shown in Table 2, where the best results are in boldface. We have following observations.", + "bbox": [ + 215, + 729, + 784, + 773 + ], + "page_idx": 8 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "4 https://github.com/explosion/spacy-models/en_core_web_trf-3.7.2", + "5 https://huggingface.co/bert-base-uncased", + "6 https://huggingface.co/CompVis/stable-diffusion-v1-4", + "7 https://openaipublic.azureedge.net/clip/ViT-B-32" + ], + "bbox": [ + 220, + 782, + 687, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 321, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/0a0171666629b6262f56fbdccc3bde5445ec811a89d634b6c6b82d9a01b8c37e.jpg", + "table_caption": [ + "Table 3: Ablated performance of COMO trained on combinations of factuals and counterfactuals. For training on full factuals and counterfactuals (i.e. COCO-CF), COMO has two learning strategies, Random and In-Batch. The In-Batch strategy enforces the factual and its corresponding counterfactual feeded into the same mini-batch (see Figure 2(c)), while the Random strategy does not." + ], + "table_footnote": [], + "table_body": "
Fine-turned DatasetsVL-ChecklistWinoground
RelationAttributeObjectAverageTextImage GroupAverage
None (pre-trained CLIP)61.8067.3282.9170.6730.5011.008.7516.75
Factuals Only (i.e. COCO)62.1267.4382.9870.8430.2510.508.7516.50
Factuals + Counterfactuals (Random)61.9567.7983.1270.9530.2511.009.0016.75
Factuals + Counterfactuals (In-Batch)71.1673.4486.2076.9331.0012.009.7517.58
", + "bbox": [ + 241, + 226, + 756, + 314 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We observe that our COMO achieves the new state-of-the-art performance on both concepts understanding datasets. Specifically, our COMO outperforms the best baseline with $3.17\\%$ relative improvement in terms of VL-Checklist's attribute metric, and with $4.35\\%$ relative improvement in terms of image score on Winoground. This shows that our COMO can better understand the concepts beyond bag-of-objects and conduct compositional reasoning about relation, attribute, and word order.", + "bbox": [ + 212, + 340, + 787, + 445 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Furthermore, our COMO gets the best result over all six settings on both datasets. It shows our model can distinguish the differences between causal and spurious concepts. The improvement of COMO over baselines could be attributed to reasons below: i) COMO admits multimodal counterfactual examples by injecting concepts from pretrained masked language models and text-to-image diffusion model, which explicitly improve the clear understanding of VL models on semantic concepts; ii) COMO adopts a modified contrastive loss to reweight the importance of counterfactual samples in the mini-batch, which enforces the model to differentiate the original concepts in factuals from substitute concepts in counterfactuals.", + "bbox": [ + 212, + 446, + 787, + 595 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We display relative gains on fine-grained \"Attribute\" and \"Relation\" tests of VL-Checklist as shown in Figure 3a. It is clear that COMO gets gains across over all tests (Attribute: size, material, color, state, action; Relation: spatial, action). These improvements can be contributed to the multimodal counterfactual samples that enforce the model to attend to the small concepts changes in the vision and text, and hard negative contrastive loss that push the embedding of counterfactual samples close to the anchor to be far away by reweighting the importance of counterfactual examples.", + "bbox": [ + 212, + 598, + 787, + 718 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.4 Ablation Studies", + "text_level": 1, + "bbox": [ + 214, + 739, + 401, + 753 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ablation on Mixing Factuals and Counterfactuals We have demonstrated that augmenting factual datasets (e.g. MS COCO) could improve the concept understanding and compositional reasoning of VL models with the help of multimodal counterfactual examples. We now conduct study on ablated contribution from factual, counterfactual, and their learning strategies. As shown in Table 3,", + "bbox": [ + 212, + 763, + 787, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 9 + }, + { + "type": "image", + "img_path": "images/62717773491d200163186d4f4f8b750c2bfc82407a6e9cfacd4044562fd1d7f9.jpg", + "image_caption": [ + "(a) Detailed results" + ], + "image_footnote": [], + "bbox": [ + 223, + 146, + 346, + 228 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/5f26fa9348fa9e37b15e48bd2f4d8b481f238aaf58180b25f47e4574ba0c13ff.jpg", + "image_caption": [ + "(b) Contrastive loss" + ], + "image_footnote": [], + "bbox": [ + 352, + 147, + 491, + 227 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/2b064737b94bda08fa0711881b57c21dd273ddb914437cff77aff4f64c8a1d3b.jpg", + "image_caption": [ + "Fig. 3: (a) Detailed results of baselines (CLIP, SVLC, SyVic) and our COMO on VL-Checklist. A: Attribute, R: Relation. (b) Impact of guided-and-weighted contrastive loss; (c) Influence of the number of generated images; (d) Performance varying with the training percent. (all evaluated on VL-Checklist)" + ], + "image_footnote": [], + "bbox": [ + 495, + 143, + 637, + 229 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/dfbc32978f37b3415873d3c3c73783c52e1310c29927319242b943298eadfab7.jpg", + "image_caption": [ + "(c) #Synthetic images", + "(d) Percent of training" + ], + "image_footnote": [], + "bbox": [ + 638, + 143, + 782, + 229 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/0aca558bc1b3196298f38000aad63f615be4a23acbbbfecb06f972b7f98e54f6.jpg", + "table_caption": [ + "Table 4: Ablated contribution from counterfactual images and counterfactual texts in COMO." + ], + "table_footnote": [], + "table_body": "
Counterfactual\nImage TextVL-ChecklistWinoground\nAverage
RelationAttributeObjectAverage
CLIP61.8067.3282.9170.6716.75
XX62.1267.4382.9870.8416.50
X✓69.5671.1184.5575.0716.13
✓X69.3470.8584.2274.8016.58
✓✓71.1673.4486.2076.9317.58
", + "bbox": [ + 330, + 369, + 668, + 473 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "we have the following findings. Firstly, compared to the pretrained CLIP, finetuning COMO on the factual only dataset (i.e., MS-COCO) has a negligible impact on Winoground dataset. It shows that the COMO that finetuning on only factual dataset still has the difficulty in concepts understanding beyond \"bag-of-objects\". Secondly, there is almost no improvement of performance when finetuning the COMO on the factual and counterfactual dataset with a random sampling strategies. It shows the necessity of enforcing the contrastive learning between counterfactuals and the factuals explicitly to reduce the VL model from the bias that taking spurious correlations between captions and images as shortcuts during training. Thirdly, compared to the random sampling strategy, sampling the factual and counterfactuals together (i.e. in a mini-batch) could improve VL models' robustness and the ability of concepts understanding and compositional reasoning.", + "bbox": [ + 212, + 505, + 787, + 700 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ablation on Multimodal Counterfactuals Text and Image We have ablated the contributions from multimodal counterfactuals, and now we investigate the impact of individual counterfactual text and individual counterfactual image. As shown in Table 4, removing either of them degrades the performance while removing both of them degrades a lot, demonstrating the usefulness of both counterfactual texts and counterfactual images to improve VL models' concepts understanding. On the one hand, for the effectiveness of counterfactual text, COMO trained with counterfactual text performs much better than that trained with factual samples only. For examples, the relative improvement is", + "bbox": [ + 212, + 704, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 321, + 114, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/51dd24036e4db8df6186ab6a29b73979eb75c9581f75a16bd5bd959dfe83fdeb.jpg", + "table_caption": [ + "Table 5: Ablated Guided-and-Weighted Contrastive Loss on training from scratch and pretrained setting." + ], + "table_footnote": [], + "table_body": "
Pretrained Weighted lossVL-Checklist
RelationAttributeObjectAverage
✓✓71.1673.4486.2076.93
X✓64.4264.7575.0468.07
✓X70.0272.8685.3776.08
XX62.1362.4873.8166.14
", + "bbox": [ + 331, + 184, + 666, + 268 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "11.9% in terms of VL-Checklist's relation metric. It shows that it is necessary to force the VL model to attend to the small changes in the text, which could improve the VL model's understanding on concepts. On the other hand, for the effectiveness of counterfactual image, COMO trained with counterfactual image performs much better than that trained with factual samples only. For example, the relative improvement is 11.6% in terms of VL-Checklist's relation metric. As for the relative importance of counterfactual texts and counterfactual images, COMO trained with counterfactual texts is better than that trained with counterfactual images when testing on the VL-Checklist, while it is on the contrary when testing on Winoground.", + "bbox": [ + 212, + 295, + 784, + 445 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ablation on Guided-and-Weighted Contrastive Loss As shown in Table 5, on pretrained setting, the performance of COMO w/o the weighted loss consistently degrades on all of VL-Checklist metrics (relation, attribute, object). Although the performance of COMO in training from scratch drops by a large margin, to explore the effectiveness of weighted loss in training from scratch, we compare the COMO with naive loss and weighted loss in training from scratch settings. The table shows that our weighted loss still performs better than the naive contrastive loss in training from scratch settings, which shows the design of weighted loss is robust. These ablation results show that the full guided-and-weighted contrastive loss is beneficial compared to the standard (i.e. CLIP-loss) and unweighted (i.e. Eq.3) ones.", + "bbox": [ + 212, + 446, + 787, + 612 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Hyper-parameter Analysis", + "text_level": 1, + "bbox": [ + 215, + 633, + 480, + 648 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Influence of the number of generated images To improve the quality of generated images by text-to-diffusion models, and to reduce the inconsistencies in generated images and texts, we synthesize multiple images for a single caption at different time-step. In Figure 3c, we show the impact of the number of generated images on the three VL-Checklist evaluation settings (i.e. relation, attribute, object). We can see that, the performance increases as the number of generate images increases on all three evaluation settings, until getting saturated at around 8. This shows that filtering among the multiple generated images as the most satisfactory counterfactual image can improve the overall quality of our generated counterfactuals.", + "bbox": [ + 212, + 657, + 787, + 808 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Low-resource scenario We conduct experiments in low-resource setting by randomly sampling part of the full training set to simulate a low-resource sce-", + "bbox": [ + 215, + 810, + 785, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/aabb51e46b2b58a07c4e401d3cbf3267db60b182ad1a5a45390b32d7163ec1f6.jpg", + "image_caption": [ + "(a) Attention visualizations", + "Fig. 4: (a) Attention visualizations on COMO and CLIP. (b) Qualitative analysis on COMO and its three variants. Note, CLIP i.e. COMO w/o both of counterfactual images and texts." + ], + "image_footnote": [], + "bbox": [ + 279, + 145, + 486, + 297 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/011a05b1a00ac71fe6011f9bb3506700cbbe892847c3ec379258ec6e21155b01.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
GroupType of ConceptImageCaptionCLIPCOMO w/o CF-ImageCOMO w/o CF-TestCOMO
Objectlocation[POS]: log on bus [NEG]: log on grassPOS:0.99 NEG:0.01POS:1.00 NEG:0.00POS:1.00 NEG:0.00POS:1.00 NEG:0.00
Relationspatial[POS]: beer in glass [NEG]: beer out of glassPOS:0.31 NEG:0.69POS:0.42 NEG:0.58POS:0.77 NEG:0.23POS:0.84 NEG:0.16
action[POS]: necklace on cooking man [NEG]: necklace on sleeping manPOS:0.44 NEG:0.56POS:0.99 NEG:0.01POS:0.98 NEG:0.02POS:0.99 NEG:0.01
color[POS]: water next to green scenery [NEG]: water next to dark brown sceneryPOS:0.35 NEG:0.65POS:0.66 NEG:0.34POS:0.45 NEG:0.55POS:0.89 NEG:0.11
material[POS]: handle on wooden cabinet [NEG]: handle on denim cabinetPOS:0.23 NEG:0.77POS:0.30 NEG:0.70POS:0.42 NEG:0.58POS:0.66 NEG:0.34
state[POS]: closed cabinet [NEG]: open cabinetPOS:0.01 NEG:0.99POS:0.11 NEG:0.89POS:0.18 NEG:0.82POS:0.37 NEG:0.63
", + "bbox": [ + 493, + 143, + 720, + 297 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "(b) Qualitative analysis", + "bbox": [ + 539, + 299, + 678, + 310 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "nario. The results are shown in Figure 3d where the CLIP and COMO are both trained on the corresponding low-resource training set. We can see that both CLIP and COMO get better performance with the increasing of more training examples. Moreover, our COMO achieves much advantage under the extreme low-resource scenario. In detail, relative improvements of COMO over CLIP are $2.24\\%$ at training percent $10\\%$ . It shows that our COMO is effective in improving the VL concepts' understanding under data scarcity scenario.", + "bbox": [ + 212, + 393, + 784, + 500 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.6 Case study", + "text_level": 1, + "bbox": [ + 215, + 525, + 352, + 540 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Attention visualizations We conduct attention visualizations on COMO and CLIP to observe the ability of visual and language concept understanding. As shown in Figure 4a, our COMO can capture object \"knife\" and attribute \"big\" while CLIP wrongly attends to \"plates\" and \"small\" cat. It shows that our COMO improve the clear understanding of VL models on semantic concepts and learn the difference between VL concepts.", + "bbox": [ + 212, + 551, + 784, + 642 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Qualitative analysis We conduct qualitative experiments to understand the working of COMO and its three variants, i) COMO without counterfactual images (COMO w/o CF-image), ii) COMO without counterfactual texts (COMO w/o CF-text), and iii) COMO without both of them (i.e. CLIP). The results are shown in Figure 4b. Firstly, for frequently occurring VL \"bag-of-objects\" concepts, such as bus and grass in Figure 4b (Object-location), all VL models including CLIP, two variants of COMO, and COMO predict the caption correctly. However, CLIP can not identify the difference between \"cooking\" and \"sleeping\" in Figure 4b (Attribute-action), while all other VL models with counterfactuals match the image to the ground-truth caption correctly. It shows that the counterfactuals can help the model to learn the differences between concepts.", + "bbox": [ + 212, + 643, + 785, + 808 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Secondly, as for the importance of counterfactual texts (i.e. by observing the variant COMO w/o CF-text), as shown in Figure 4b (Attribute-color), removing", + "bbox": [ + 214, + 809, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 321, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "counterfactual texts leads to the COMO wrongly matching the image to the ground-truth caption. It is shown that the counterfactual text can help the model to learn the general concepts, especially when the factual description is coarse.", + "bbox": [ + 212, + 146, + 784, + 191 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Thirdly, as for the importance of counterfactual images (i.e. by observing the variant COMO w/o CF-image), as shown in Figure 4b (Relation-spatial), removing counterfactual images leads to the COMO wrongly predict the caption when the image has lots of visual concepts unrelated to the text. It shows that VL models with counterfactual images can reduce the influence of spurious concepts in image.", + "bbox": [ + 212, + 191, + 785, + 282 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Fourthly, as for the importance of multimodal counterfactuals, as shown in Figure 4b (Attribute-material), removing multimodal counterfactuals leads the COMO can not identify the material of cabinet from the image. The improvement of the VL model's concept understanding could be attributed to enforcing the model to attend to the small concept changes in the counterfactual image and text, and to match the counterfactual image and counterfactual text together to learn out of domain concepts.", + "bbox": [ + 212, + 282, + 785, + 387 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We observe that, as shown in Figure 4b (Attribute-state), all VL models fail in matching the image to its ground-truth caption \"closed cabinet\". The failing reason could be that an \"open door\" appears in the image, which guides the model to trust that \"open\" is matching to the image. Though multimodal counterfactual samples improve the model's understanding of concepts, VL models still suffer from the problems of \"bags of objects\" in images and texts. It is worthy of investigating in improving concepts understanding and compositional reasoning of VL models.", + "bbox": [ + 212, + 388, + 785, + 508 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusions", + "text_level": 1, + "bbox": [ + 215, + 530, + 369, + 546 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We have presented a data-and-algorithm driven technique for enhancing the performance of VL models to understand beyond \"bag-of-objects\" and reason about compositional concepts including attributes, relations, and word order. Our proposed contrastive learning framework with multimodal counterfactuals attains significant gains over five strong VL models on two benchmark datasets. It builds upon the modeling strength and knowledge of nowadays language models and diffusion models by injecting concepts to VL models, suggesting generalizations to future VL models. We demonstrated the necessity of both counterfactual texts and counterfactual images. We also show the necessity of effective learning with guided-and-weighted contrastive loss. Extensive ablation and case study help understand the working of the proposed approach as well its limitations, suggesting the future work of investigating other factors on improving compositional reasoning.", + "bbox": [ + 212, + 560, + 787, + 758 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 215, + 779, + 403, + 796 + ], + "page_idx": 13 + }, + { + "type": "ref_text", + "text": "This work is supported by National Natural Science Foundation of China (No. 62306220).", + "bbox": [ + 212, + 809, + 784, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Antol, S., Agrawal, A., Lu, J., Mitchell, M., Batra, D., Zitnick, C.L., Parikh, D.: Vqa: Visual question answering. In: Proceedings of the IEEE international conference on computer vision. pp. 2425-2433 (2015)", + "2. Basu, A., Addepalli, S., Babu, R.V.: Rmlvqa: A margin loss approach for visual question answering with language biases. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11671-11680 (June 2023)", + "3. Cascante-Bonilla, P., Shehada, K., Smith, J.S., Doveh, S., Kim, D., Panda, R., Varol, G., Oliva, A., Ordonez, V., Feris, R., et al.: Going beyond nouns with vision & language models using synthetic data. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 20155-20165 (2023)", + "4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020)", + "5. Chen, Y., Yuan, J., Tian, Y., Geng, S., Li, X., Zhou, D., Metaxas, D.N., Yang, H.: Revisiting multimodal representation in contrastive learning: from patch and token embeddings to finite discrete tokens. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15095-15104 (2023)", + "6. Chen, Y., Ma, Z., Zhang, Z., Qi, Z., Yuan, C., Shan, Y., Li, B., Hu, W., Qie, X., Wu, J.: Vilem: Visual-language error modeling for image-text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11018-11027 (June 2023)", + "7. Chuang, C.Y., Robinson, J., Lin, Y.C., Torralba, A., Jegelka, S.: Debiased contrastive learning. Advances in neural information processing systems 33, 8765-8775 (2020)", + "8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics. pp. 4171-4186 (2019)", + "9. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative unsupervised feature learning with convolutional neural networks. Advances in neural information processing systems 27 (2014)", + "10. Doveh, S., Arbelle, A., Harary, S., Alfassy, A., Herzig, R., Kim, D., Giryes, R., Feris, R., Panda, R., Ullman, S., et al.: Dense and aligned captions (dac) promote compositional reasoning in vl models. NeurIPS (2023)", + "1. Doveh, S., Arbelle, A., Harary, S., Schwartz, E., Herzig, R., Giryes, R., Feris, R., Panda, R., Ullman, S., Karlinsky, L.: Teaching structured vision & language concepts to vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2657-2668 (2023)", + "2. Geirhos, R., Jacobsen, J.H., Michaelis, C., Zemel, R., Brendel, W., Bethge, M., Wichmann, F.A.: Shortcut learning in deep neural networks. Nature Machine Intelligence 2(11), 665-673 (2020)", + "3. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022)", + "4. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality reduction by learning an invariant mapping. In: 2006 IEEE computer society conference on computer vision and pattern recognition (CVPR'06). vol. 2, pp. 1735-1742. IEEE (2006)" + ], + "bbox": [ + 225, + 175, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 321, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "15. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., QI, X.: Is synthetic data from generative models ready for image recognition? In: The Eleventh International Conference on Learning Representations (2022)", + "16. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021)", + "17. Kalantidis, Y., Sariyildiz, M.B., Pion, N., Weinzaepfel, P., Larlus, D.: Hard negative mixing for contrastive learning. Advances in Neural Information Processing Systems 33, 21798-21809 (2020)", + "18. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. Advances in neural information processing systems 33, 18661-18673 (2020)", + "19. Krishna, R., Zhu, Y., Groth, O., Johnson, J., Hata, K., Kravitz, J., Chen, S., Kalantidis, Y., Li, L.J., Shamma, D.A., et al.: Visual genome: Connecting language and vision using crowdsourced dense image annotations. International journal of computer vision 123, 32-73 (2017)", + "20. Le, T., Lal, V., Howard, P.: Coco-counterfactuals: Automatically constructed counterfactual examples for image-text pairs. arXiv preprint arXiv:2309.14356 (2023)", + "21. Li, C., Liu, H., Li, L., Zhang, P., Aneja, J., Yang, J., Jin, P., Hu, H., Liu, Z., Lee, Y.J., et al.: Elevater: A benchmark and toolkit for evaluating language-augmented visual models. Advances in Neural Information Processing Systems 35, 9287-9301 (2022)", + "22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. ICML (2023)", + "23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022)", + "24. Li, Y.L., Xu, L., Liu, X., Huang, X., Xu, Y., Chen, M., Ma, Z., Wang, S., Fang, H.S., Lu, C.: Hake: Human activity knowledge engine. arXiv preprint arXiv:1904.06539 (2019)", + "25. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)", + "26. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM 38(11), 39-41 (1995)", + "27. Moltisanti, D., Keller, F., Bilen, H., Sevilla-Lara, L.: Learning action changes by measuring verb-adverb textual relationships. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 23110-23118 (June 2023)", + "28. Momeni, L., Caron, M., Nagrani, A., Zisserman, A., Schmid, C.: Verbs in action: Improving verb understanding in video-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15579-15591 (2023)", + "29. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)", + "30. Pham, K., Kafle, K., Lin, Z., Ding, Z., Cohen, S., Tran, Q., Shrivastava, A.: Learning to predict visual attributes in the wild. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13018-13028 (2021)", + "31. Pratt, S., Yatskar, M., Weihs, L., Farhadi, A., Kembhavi, A.: Grounded situation recognition. In: European Conference on Computer Vision. pp. 314-332 (2020)" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "32. Radenovic, F., Dubey, A., Kadian, A., Mihaylov, T., Vandenhende, S., Patel, Y., Wen, Y., Ramanathan, V., Mahajan, D.: Filtering, distillation, and hard negatives for vision-language pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6967-6977 (2023)", + "33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (18-24 Jul 2021)", + "34. Robinson, J.D., Chuang, C.Y., Sra, S., Jegelka, S.: Contrastive learning with hard negative samples. In: International Conference on Learning Representations (2020)", + "35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)", + "36. Roth, K., Kim, J.M., Koepke, A.S., Vinyals, O., Schmid, C., Akata, Z.: Waffling around for performance: Visual classification with random words and broad concepts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15746-15757 (October 2023)", + "37. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)", + "38. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023)", + "39. Shi, H., Mao, J., Xiao, T., Jiang, Y., Sun, J.: Learning visually-grounded semantics from contrastive adversarial samples. In: Proceedings of the 27th International Conference on Computational Linguistics. pp. 3715-3727 (2018)", + "40. Smith, J.S., Cascante-Bonilla, P., Arbelle, A., Kim, D., Panda, R., Cox, D., Yang, D., Kira, Z., Feris, R., Karlinsky, L.: Construct-vl: Data-free continual structured vl concepts learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14994-15004 (2023)", + "41. Thrush, T., Jiang, R., Bartolo, M., Singh, A., Williams, A., Kiela, D., Ross, C.: Winoground: Probing vision and language models for visio-linguistic compositionality. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5238-5248 (2022)", + "42. Tian, Y., Sun, C., Poole, B., Krishnan, D., Schmid, C., Isola, P.: What makes for good views for contrastive learning? Advances in neural information processing systems 33, 6827-6839 (2020)", + "43. Trabucco, B., Doherty, K., Gurinas, M., Salakhutdinov, R.: Effective data augmentation with diffusion models. In: ICLR 2023 Workshop on Mathematical and Empirical Understanding of Foundation Models (2023)", + "44. Wang, W., Yang, Z., Xu, B., Li, J., Sun, Y.: Vilt: Enhancing vision-language pre-training through textual augmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3158-3169 (2023)", + "45. Wang, Z., Gao, Z., Guo, K., Yang, Y., Wang, X., Shen, H.T.: Multilateral semantic relations modeling for image text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 2830-2839 (June 2023)", + "46. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical" + ], + "bbox": [ + 212, + 146, + 787, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving VLC Understanding with Multimodal CF Samples", + "bbox": [ + 321, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019)", + "47. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019)", + "48. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15943-15953 (October 2023)", + "49. Wu, H., Mao, J., Zhang, Y., Jiang, Y., Li, L., Sun, W., Ma, W.Y.: Unified visual-semantic embeddings: Bridging vision and language with structured meaning representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6609-6618 (2019)", + "50. Wu, Y., Wei, Y., Wang, H., Liu, Y., Yang, S., He, X.: Grounded image text matching with mismatched relation reasoning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2976-2987 (2023)", + "51. Xie, C.W., Sun, S., Xiong, X., Zheng, Y., Zhao, D., Zhou, J.: Ra-clip: Retrieval augmented contrastive language-image pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19265-19274 (June 2023)", + "52. Yang, J., Duan, J., Tran, S., Xu, Y., Chanda, S., Chen, L., Zeng, B., Chilimbi, T., Huang, J.: Vision-language pre-training with triple contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15671-15680 (2022)", + "53. Yang, K., Deng, J., An, X., Li, J., Feng, Z., Guo, J., Yang, J., Liu, T.: Alip: Adaptive language-image pre-training with synthetic caption. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2922-2931 (October 2023)", + "54. Yuksekgonul, M., Bianchi, F., Kalluri, P., Jurafsky, D., Zou, J.: When and why vision-language models behave like bags-of-words, and what to do about it? In: The Eleventh International Conference on Learning Representations (2022)", + "55. Zhang, X., Zhang, F., Xu, C.: Vqacl: A novel visual question answering continual learning setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19102-19112 (June 2023)", + "56. Zhang, X., Zhao, J., LeCun, Y.: Character-level convolutional networks for text classification. Advances in neural information processing systems 28 (2015)", + "57. Zhao, T., Zhang, T., Zhu, M., Shen, H., Lee, K., Lu, X., Yin, J.: Vl-checklist: Evaluating pre-trained vision-language models with objects, attributes and relations. arXiv preprint arXiv:2207.00221 (2022)", + "58. Zhen, L., Hu, P., Wang, X., Peng, D.: Deep supervised cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10394-10403 (2019)", + "59. Zhong, Y., Yang, J., Zhang, P., Li, C., Codella, N., Li, L.H., Zhou, L., Dai, X., Yuan, L., Li, Y., et al.: Regionclip: Region-based language-image pretraining. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16793-16803 (2022)", + "60. Zhong, Z., Zheng, L., Kang, G., Li, S., Yang, Y.: Random erasing data augmentation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 13001-13008 (2020)" + ], + "bbox": [ + 215, + 146, + 785, + 830 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Lai et al.", + "bbox": [ + 271, + 114, + 331, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_model.json b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_model.json new file mode 100644 index 0000000000000000000000000000000000000000..796b5ec5f6a546416e0585b06de52eb11438890a --- /dev/null +++ b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_model.json @@ -0,0 +1,2469 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.23, + 0.141, + 0.776, + 0.209 + ], + "angle": 0, + "content": "Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples" + }, + { + "type": "text", + "bbox": [ + 0.281, + 0.235, + 0.722, + 0.252 + ], + "angle": 0, + "content": "Chengen Lai, Shengli Song*, Sitong Yan, and Guangneng Hu" + }, + { + "type": "text", + "bbox": [ + 0.244, + 0.263, + 0.758, + 0.293 + ], + "angle": 0, + "content": "School of Computer Science and Technology, Xidian University, Xi'an, China {laice, styan}@stu.xidian.edu.cn, shlsong@xidian.edu.cn, njuhgn@gmail.com" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.323, + 0.74, + 0.587 + ], + "angle": 0, + "content": "Abstract. Vision and Language (VL) models have achieved remarkable performance in a variety of multimodal learning tasks. The success of these models is attributed to learning a joint and aligned representation space of visual and text. However, recent popular VL models still struggle with concepts understanding beyond bag-of-objects in images & texts, suffering from compositional reasoning about relationship between objects & attributes and word order. To address the above issues, we create a synthetic multimodal counterfactual dataset (COCO-CF) and propose a novel contrastive learning framework (COMO). We contribute the COCO-CF dataset which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and diffusion models to reduce the bias of bag-of-objects. We contribute the COMO framework for effectively leveraging COCO-CF to treat the counterfactual samples as hard negatives and reweight their importance during contrastive learning. Extensive experiments and ablations show COMO achieved a significant improvement of VL concept understanding on the two VL-Checklist and Winoground benchmarks over five strong VL baselines in their zero-shot setting evaluations. Dataset is available at https://github.com/laichengen/COMO." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.599, + 0.747, + 0.628 + ], + "angle": 0, + "content": "Keywords: Concepts Understanding \\(\\cdot\\) Contrastive learning \\(\\cdot\\) Multimodal Counterfactual Samples" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.652, + 0.377, + 0.668 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.681, + 0.788, + 0.818 + ], + "angle": 0, + "content": "Vision and Language (VL) models have recently achieved impressive performance in various challenging multimodal learning tasks, including image-text retrieval [6, 45, 58], visual question answering [1, 2, 55], and captioning [22, 53], thanks to the availability of large paired image-text corpora [25, 37]. These cross-modal tasks are heavily dependent on joint representations of multi-modalities which are typically learned by building interactions between vision and language features [10, 32, 33, 59]. The goal is to learn an effective aligning representation spaces of images and text, typically under a contrastive learning framework [4, 5, 52]." + }, + { + "type": "page_footnote", + "bbox": [ + 0.22, + 0.825, + 0.383, + 0.84 + ], + "angle": 0, + "content": "* Corresponding author" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.334, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.144, + 0.734, + 0.297 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.305, + 0.789, + 0.417 + ], + "angle": 0, + "content": "Fig. 1: Overview of our proposed multimodal counterfactual generation. (a) Standard contrastive text-to-image loss (e.g. CLIP [33]) is easy to solve \"bag-of-objects\"; (b) Contrastive learning with textual counterfactuals (e.g. SVLC [11])) teaches VL models by contrasting between counterfactual texts and original image. (c) Our proposed contrastive learning with multimodal counterfactuals (COMO) generate both textual and visual counterfactuals to improve the VL models' concept understanding by contrasting between counterfactual image (and text) and original text (and image), and matching the counterfactual image with counterfactual text." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.449, + 0.789, + 0.631 + ], + "angle": 0, + "content": "Despite these great advances on various vision and language tasks, they often exploit spurious correlations in datasets as shortcuts during training to fit the dataset [11, 12, 40]. Recent works have found popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks: the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54, 57]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects (see Figure 1(a))." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.631, + 0.789, + 0.813 + ], + "angle": 0, + "content": "In this paper, we propose a novel COntrastive learning framework with Multimodal cCounterfactuals (COMO) to improve the VL model's concepts understanding and compositional reasoning. We propose a way of leveraging the existing VL pre-training source to improve concepts understanding without any expensive and time-consuming human annotations on object attributes, relations, and states. The idea is to automatically generate a synthetic dataset by injecting counterfactual concepts from powerful pre-trained language and text-to-image stable diffusion [35]. On top of the recently proposed text augmentation [3, 11, 44] (see Figure 1(b)), we go deeper to study the effects of multimodal augmentation—i.e., generating both text counterfactual and image counterfactual examples—on the compositional reasoning performance of VL models trained on such synthetic multimodal counterfactual dataset (see Figure 1(c))." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.595, + 0.84 + ], + "angle": 0, + "content": "0 https://huggingface.co/CompVis/stable-diffusion-v1-4" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.322, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.192 + ], + "angle": 0, + "content": "We empirically find that both text counterfactual and image counterfactual contribute to the improved concepts understanding, demonstrating the necessity of multimodal augmentation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.193, + 0.785, + 0.403 + ], + "angle": 0, + "content": "Our multimodal counterfactual generation not only substitutes the concept in the text by exploiting pretrained masked language models, but also synthesizes the corresponding image by exploiting text-to-image stable diffusion. Compared to textual counterfactual generation, our multimodal counterfactual samples match the counterfactual text and image together, to learn out-of-domain concepts and alleviate the data scarcity in multimodal learning task. The generated multimodal counterfactual dataset improves the quality of image-caption alignment and reduces the bias of bag-of-objects. To effectively enforce the VL model to distinguish between original concepts and substituted concepts, we treat the counterfactual samples as hard negatives by modifying the traditional contrastive loss to dynamically reweigh their importance. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples)." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.405, + 0.581, + 0.419 + ], + "angle": 0, + "content": "Our main contributions can be summarized as:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.433, + 0.784, + 0.493 + ], + "angle": 0, + "content": "- We contribute a multimodal counterfactual dataset (COCO-CF) which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and stable diffusion to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.495, + 0.785, + 0.554 + ], + "angle": 0, + "content": "- We propose a novel contrastive framework (COMO) for effectively leveraging COCO-CF to treat the multimodal counterfactual samples as hard negatives and reweight their importance during contrastive learning to enforce the VL model differentiating the original concepts from substituted ones." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.556, + 0.785, + 0.645 + ], + "angle": 0, + "content": "- We demonstrate the compositional reasoning performance of COMO on the two VL-Checklist and Winoground benchmarks with \\(3.17\\%\\) (on VL-Checklist's attribute) and \\(4.35\\%\\) (on Winoground's image) improvement over the current SOTA models, respectively. We also perform detailed ablation on the importance of counterfactual text, counterfactual image, and the new contrastive loss." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.433, + 0.785, + 0.645 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.671, + 0.388, + 0.687 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.704, + 0.784, + 0.84 + ], + "angle": 0, + "content": "Vision and Language Models Pretrained VL models [16, 23, 32] have made impressive performance in various zero-shot downstream tasks, such as image-text retrieval [58]. However, recent research [3, 11, 57] show that existing VL models often exploit spurious correlations between non-causal features as shortcuts during training to fit the dataset [12, 54] and still struggle with vision and language concepts understanding. Popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks:" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.116, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects. In this paper, we propose a data-driven technique to improve concepts understanding for typical VL models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.254, + 0.788, + 0.496 + ], + "angle": 0, + "content": "Counterfactual Samples Generation Counterfactual samples are widely used in various computer vision and natural language processing tasks [46, 60]. Counterfactual texts have been shown to improve the robustness of models through random word substitution [36, 47] and swap [54, 56]. Counterfactual captions are generated by rule-based [11, 36, 39] or pretrained language models [11, 44, 51] to enhance semantic coherence and ground the mismatched words [50]. Diffusion models [15] are exploited to generate text-image pairs [38, 43, 48]. Synthetic videos and corresponding text captions are generated by using 3D graphic engines [3]. A counterfactual dataset created by substituting nouns only, ignoring the \"beyond nouns\" concepts [20]. In contrast, we create a multimodal counterfactual dataset (COCO-CF) which is automatically generated from existing VL pre-training source (i.e., MS-COCO) by injecting concepts from off-the-shelf language models and stable diffusion. COCO-CF can be used to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning without any expensive and time-consuming human annotations on object attributes, relations, and states." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.497, + 0.788, + 0.664 + ], + "angle": 0, + "content": "Hard-Negative Contrastive Learning (CL) [14] is exploited to learn aligned representations of text and image in most VL models [9, 18, 42]. Recently, some studies have investigated the selection of hard negative examples [17, 44] and accounted for the importance of different negative samples [7, 32, 34]. We extend the hard negative loss to vision-language concepts understanding by treating the counterfactual samples as hard negatives by modifying the traditional contrastive loss. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples, so as to improve the compositional reasoning about object relation, attributes, state, and word order in texts." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.695, + 0.33, + 0.71 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In this section, our COntrastive framework with Multimodal cCounterfactual examples (COMO) are presented for improving the VL model's understanding of concepts and enhancing robustness of VL models. As shown in Figure 2, COMO consists of an effective way of generating the multimodal counterfactual text and image samples (see Figure 2(a-b)), and a novel loss of counterfactual guided and weighted contrastive learning (see Figure 2(c)). In the following, we firstly describe the counterfactual text and image samples generation in Section 3.1." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.322, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.266, + 0.162, + 0.734, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.268, + 0.226, + 0.734, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.268, + 0.289, + 0.734, + 0.409 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.435, + 0.788, + 0.533 + ], + "angle": 0, + "content": "Fig. 2: The proposed contrastive learning framework with multimodal counterfactual samples (COMO). (a) Generating counterfactual text uses masked language models such as BERT1. (b) Generating counterfactual image uses text-to-image diffusion models2. (c) Counterfactual guided and weighted hard negative contrastive learning. This module feeds the generated counterfactual text and image into the same mini-batch and exploits a hard negative loss to improve the VL models' concept understanding. The longer the red arrow, the further it pushes away." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.564, + 0.788, + 0.595 + ], + "angle": 0, + "content": "Then, we introduce the counterfactual guided and weighted contrastive loss in Section 3.2, respectively." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.62, + 0.607, + 0.635 + ], + "angle": 0, + "content": "3.1 Generation of Multimodal Counterfactual" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.648, + 0.788, + 0.816 + ], + "angle": 0, + "content": "Recent works [11, 49] have shown the effectiveness of injecting concepts to VL models by textual-modality augmentation. Compared to these works, we improve the VL models' concepts understanding by automatically constructing both textual and visual counterfactual examples in a way of multimodal augmentation. Counterfactual Text Generation To improve the clear understanding of VL models on concepts beyond bag-of-objects and rather than spurious correlated features, we manipulate the original caption \\( T^o \\) to construct its corresponding counterfactual caption \\( T^c \\) with subtle but completely different semantics. Counterfactual text \\( T^c \\) is generated by replacing a concept in \\( T^o \\), while most of its original details remain the same. In this way, the generated counterfactual caption represents the changed causal concept while remaining preserved" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.513, + 0.84 + ], + "angle": 0, + "content": "1 https://huggingface.co/bert-base-uncased" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "details from the original caption can be viewed as potentially spurious correlated features." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.388 + ], + "angle": 0, + "content": "Large or pre-trained language models [8] are capable of suggesting multiple words that fit the context given a sentence with one missing word. We can automatically create a plausible negative sentence which is difficult for VL models to distinguish from its corresponding actual caption by randomly selecting a masked word. Such masked word should be useful for compositional reasoning about objects relation, attributes, and states. This can be achieved by NLP parsing technique to identify all objects (nouns), relations (verbs and adverb), and attributes (adjectives) in the original caption sentence. In specific, we randomly choose a word among these concepts, replace the selected concept in \\( T^o \\) with the [MASK] token, and then retrieve the most probable replacements by the language models unmasking as our generated counterfactual caption \\( T^c \\) (see Figure 2(a)). These counterfactual/negative examples enforce the VL model focusing on the important details that affect the concepts understanding and compositional reasoning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.389, + 0.788, + 0.555 + ], + "angle": 0, + "content": "Counterfactual Image Generation After creating a counterfactual caption \\( T^c \\), the VL models can understand the original text-image pair \\( (T^o, V^o) \\) but have no idea of what the corresponding image of counterfactual caption \\( T^c \\) looks like. Therefore, we explicitly generate a corresponding counterfactual image \\( V^c \\) by feeding the counterfactual caption \\( T^c \\) into stable diffusion models (see Figure 2(b)). To control the quality of generated images and enable the changed concept (causal concept) to be learned in the presence of unchanged concepts (spurious concepts) between \\( T^c \\) and \\( T^o \\), we firstly generate multiple images \\( \\{V_{ij}\\}_{i=1}^{n} \\). Then we choose the counterfactual image \\( V^c \\) which has the highest similarity score with both the counterfactual caption \\( T^c \\) and the original image \\( V^o \\) by:" + }, + { + "type": "equation", + "bbox": [ + 0.342, + 0.57, + 0.785, + 0.587 + ], + "angle": 0, + "content": "\\[\n\\operatorname {s c o r e} _ {i} = \\varepsilon_ {T} \\left(T ^ {c}\\right) \\cdot \\varepsilon_ {V} \\left(V _ {i}\\right) + \\varepsilon_ {V} \\left(V ^ {o}\\right) \\cdot \\varepsilon_ {V} \\left(V _ {i}\\right) \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.59, + 0.788, + 0.651 + ], + "angle": 0, + "content": "where \\(\\varepsilon_T(\\cdot)\\) and \\(\\varepsilon_V(\\cdot)\\) are text and image encoders in \\(\\mathrm{CLIP}^3\\), respectively. The first part of the score measures the consistency between the generated image and counterfactual caption \\(T^c\\), and the second part measures the similarity between the generated image and the original image \\(V^o\\)." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.67, + 0.75, + 0.687 + ], + "angle": 0, + "content": "3.2 Counterfactual Guided and Weighted Contrastive Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.692, + 0.788, + 0.755 + ], + "angle": 0, + "content": "Contrastive learning [29] is an effective approach for multimodal alignment, which pulls the positive pairs to anchor nearby locations, while pushes negative pairs further away. A dual-encoder VL model like CLIP [33] admits text-image pair \\((T,V)\\) and computes their similarity score by:" + }, + { + "type": "equation", + "bbox": [ + 0.423, + 0.767, + 0.785, + 0.786 + ], + "angle": 0, + "content": "\\[\nS (T, V) = \\exp (\\boldsymbol {t} ^ {\\top} \\boldsymbol {v} / \\tau) \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.788, + 0.787, + 0.819 + ], + "angle": 0, + "content": "where \\(\\pmb{t} = \\varepsilon_T(T)\\) and \\(\\pmb{v} = \\varepsilon_V(V)\\) are the encoded features of the image-text pair respectively. Temperature \\(\\tau > 0\\) is learnable." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.824, + 0.571, + 0.841 + ], + "angle": 0, + "content": "3 https://openaipublic.azureedge.net/clip/ViT-B-32" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.321, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.237 + ], + "angle": 0, + "content": "Counterfactual Guided Contrastive Learning The naive contrastive learning with uniform sampling from large-scale datasets can often provide negative samples that are not necessarily discriminative. In our counterfactual guided contrastive learning, we feed the original example with its corresponding counterfactual example into the same mini-batch so as to enforce the VL model differentiates the original concept from substituted concept (see Figure 2(c))." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.238, + 0.784, + 0.268 + ], + "angle": 0, + "content": "Given a mini-batch \\(\\mathcal{B} = \\{(T_i,V_i)\\}_{i = 1}^n\\) of containing the factual and its counterfactual image-caption pairs, the contrastive CLIP-loss [29] is defined as:" + }, + { + "type": "equation", + "bbox": [ + 0.299, + 0.28, + 0.786, + 0.315 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\mathrm {H N}} = - \\sum_ {i = 1} ^ {n} \\left[ \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{\\sum_ {j} S \\left(T _ {i} , V _ {j}\\right)} + \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{\\sum_ {j} S \\left(T _ {j} , V _ {i}\\right)} \\right] \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.318, + 0.784, + 0.364 + ], + "angle": 0, + "content": "The hard negative for factual image-caption \\((T^o, V^o)\\) (causal concept) is its corresponding counterfactual image-caption \\((T^c, V^c)\\) (spurious concept), which needs to be pushed far away (see Figure 2(c))." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.365, + 0.785, + 0.44 + ], + "angle": 0, + "content": "Counterfactual Weighted Contrastive Learning To emphasize hard negative pairs (i.e., between the factual example and its corresponding counterfactual example) and push the embedding of counterfactual sample (which is close to the factual example) far away from the anchor, we modify the un-weighted contrastive loss in Eq.3 as the weighted version in the following:" + }, + { + "type": "equation", + "bbox": [ + 0.305, + 0.452, + 0.785, + 0.523 + ], + "angle": 0, + "content": "\\[\n\\begin{array}{l} \\mathcal {L} _ {\\mathrm {H N W}} = - \\sum_ {i = 1} ^ {n} \\left[ \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{S \\left(T _ {i} , V _ {i}\\right) + \\sum_ {j \\neq i} \\boldsymbol {\\alpha} _ {i j} \\cdot S \\left(T _ {i} , V _ {j}\\right)} \\right. \\tag {4} \\\\ \\left. + \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{S \\left(T _ {i} , V _ {i}\\right) + \\sum_ {j \\neq i} \\boldsymbol {\\beta} _ {j i} \\cdot S \\left(T _ {j} , V _ {i}\\right)} \\right] \\\\ \\end{array}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.527, + 0.502, + 0.542 + ], + "angle": 0, + "content": "where the weights are computed by:" + }, + { + "type": "equation", + "bbox": [ + 0.322, + 0.552, + 0.785, + 0.587 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {\\alpha} _ {i j} = \\frac {(n - 1) \\cdot S \\left(T _ {i} , V _ {j}\\right)}{\\sum_ {k \\neq i} S \\left(T _ {i} , V _ {k}\\right)} \\quad \\beta_ {j i} = \\frac {(n - 1) \\cdot S \\left(T _ {j} , V _ {i}\\right)}{\\sum_ {k \\neq i} S \\left(T _ {k} , V _ {i}\\right)} \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.784, + 0.717 + ], + "angle": 0, + "content": "Weights \\(\\alpha_{ij}\\) and \\(\\beta_{ij}\\) are designed that difficult negative pairs (e.g., between original examples and corresponding counterfactual examples) are emphasized, and easier pairs (e.g., between original examples and other \"bag-of-objects\" examples) are ignored. So, the VL model can more easily understand the concepts beyond objects and improve the compositional reasoning about relation, attribute, and word order. Observe that we get contrastive objective of Eq.3 when setting weights to be all ones. The form of weights is an unnormalized von Mises-Fisher distribution [32]." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.74, + 0.376, + 0.758 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.771, + 0.334, + 0.785 + ], + "angle": 0, + "content": "4.1 Datasets" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.784, + 0.841 + ], + "angle": 0, + "content": "To test the effectiveness of our proposed COMO for improving VL models' vision language concepts understanding, we train the model using our counterfactual image-text pairs generated from MS-COCO [25]. We evaluate on the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.784, + 0.172 + ], + "angle": 0, + "content": "Table 1: The statistics of factual and counterfactual examples in the generated COCO-CF dataset." + }, + { + "type": "table", + "bbox": [ + 0.328, + 0.186, + 0.671, + 0.233 + ], + "angle": 0, + "content": "
Factual\n# images # textCounterfactual\n# images # textTotal\n# images # text
COCO-CF113K 567K567K 567K680K 1,134K
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.275, + 0.784, + 0.321 + ], + "angle": 0, + "content": "VL-Checklist [57], Winoground [41] and Zero-Shot Classification [21] datasets over strong VL models. We introduce the training and testing datasets in detail below." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.329, + 0.785, + 0.449 + ], + "angle": 0, + "content": "Training datasets. We start from MS-COCO [25] dataset as our factual samples, where an image has multiple corresponding captions. We automatically generate the counterfactual image-text pairs from COCO with our multimodal counterfactual generation pipeline (see Figure 2(a-b)). The augmented dataset is named as COCO-CF, meaning COCO counterfactual examples. As shown in Table 1, we obtain additional 567K counterfactual images and captions based on the original 113K images and 567K text. Finally, COCO-CF has total 680K images and 1,134K captions." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.456, + 0.784, + 0.486 + ], + "angle": 0, + "content": "Evaluation datasets. We evaluate our models on VL-Checklist, Winoground and Zero-Shot classification datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.493, + 0.785, + 0.644 + ], + "angle": 0, + "content": "VL-Checklist [57] is a large-scale dataset comprised of Visual Genome [19], SwiG [31], VAW [30], and HAKE [24]. Each image is associated with two captions, a positive and a negative. The positive caption corresponds to the image and is taken from the source dataset. The negative caption is generated from the positive caption by changing one word only, so the resulting sentence no longer corresponds to the image. Depending on the word that was changed, VL-Checklist evaluates seven types of VL concepts divided into three categories: (i) Attributes (color, material, size, state, and action); (ii) Relations (spatial or action relation between two objects and/or humans); and (iii) Objects (spatial location and size)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.652, + 0.785, + 0.788 + ], + "angle": 0, + "content": "Winoground [41] is a dataset that evaluates the ability of VL models for compositional reasoning, specifically understanding the meaning of the sentence after changing the order of its words. An example comprises of two images and two texts. The texts have the same set of words but in a different order, each text corresponding to one image in the paired sample. The Winoground evaluation divide into three metrics: (i) image score - percent of samples where the model picks the correct image for each text; (ii) text score - percent of samples where the model picks the correct text for each image; (iii) group score - percent of samples where both text and image score conditions are satisfied jointly." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.784, + 0.839 + ], + "angle": 0, + "content": "Zero-Shot Classification [21] is a dataset that includes 21 different classification datasets, we evaluate our model and report the average result over the dataset." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.322, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.784, + 0.173 + ], + "angle": 0, + "content": "Table 2: Performance comparison with strong VL baselines on the VL-Checklist, Winoground and 21 classification task datasets in zero-shot setting evaluation." + }, + { + "type": "table", + "bbox": [ + 0.22, + 0.185, + 0.779, + 0.324 + ], + "angle": 0, + "content": "
ModelsFine-tuned Dataset SizeVL-ChecklistWinoground21-Zero-Shot Task
RelationAttributeObjectTextImageGroup
CLIP (Radford et al, 2021)None61.8067.3282.9130.5011.008.7556.37
CyCLIP (Goel et al, 2022)None61.1566.9680.8730.5010.759.0055.99
NegCLIP (Yuksekgonul et al, 2023)None63.5272.2381.3529.5010.508.00-
SyVic (Cascante-Bonilla et al, 2023)767K69.3970.3784.6230.0011.509.5054.77
SVLC (Doveh et al, 2023)3M69.6871.1884.7529.7511.009.0055.27
COMO (ours)1.1M71.1673.4486.2031.0012.009.7555.87
Improvement over best baseline-2.12%3.17%1.70%1.60%4.35%2.63%-0.89%
" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.353, + 0.452, + 0.367 + ], + "angle": 0, + "content": "4.2 Implementation details" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.379, + 0.788, + 0.681 + ], + "angle": 0, + "content": "For the multimodal counterfactual samples generation(Sec. 3.1), we use NLP spacy4 to parse the sentence into its components including nouns, verbs, adjectives, adverbs, etc. Then we utilize the popular BERT5 as the masked LMs to generate the counterfactual text. To ensure the words sampled from the LM are true negatives, we obtain the synonyms set of the original word from the WordNet [26], and generate n candidates from the language model. Then we filter out the candidates that belong in the original word's synonyms set and variants (i.e., plural and tense). Finally, we choose the one which has the highest score among the remaining candidates as our counterfactual text. After we generate the counterfactual captions, we use the text-to-image stable diffusion model6 to synthesize multiple images (size set to 10). For the model architecture, following [3,11], we utilize the original CLIP implementation that initialized with the checkpoints of VIT-B/327 released by the OpenAI. We modify the naive contrastive loss in their codebase to our counterfactual guided-and-weighted hard negative contrastive loss (see Eq.4). For the model training, we use Adam optimizer with a 1e-6 initial learning rate and a 1e-7 weight decay for finetuning, where the batch size is set to 16 and the training epochs to 5. We conduct all experiments on one NVIDIA GTX A100-PCIE-40GB GPUs with PyTorch 1.9.0. Our code and model checkpoints will be released upon acceptance together with the generated counterfactual examples COCO-CF dataset." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.704, + 0.371, + 0.717 + ], + "angle": 0, + "content": "4.3 Main Results" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.73, + 0.785, + 0.774 + ], + "angle": 0, + "content": "We compare our COMO method with five state-of-the-art methods on three benchmark datasets and the results are shown in Table 2, where the best results are in boldface. We have following observations." + }, + { + "type": "ref_text", + "bbox": [ + 0.221, + 0.783, + 0.689, + 0.799 + ], + "angle": 0, + "content": "4 https://github.com/explosion/spacy-models/en_core_web_trf-3.7.2" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.799, + 0.51, + 0.812 + ], + "angle": 0, + "content": "5 https://huggingface.co/bert-base-uncased" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.813, + 0.593, + 0.826 + ], + "angle": 0, + "content": "6 https://huggingface.co/CompVis/stable-diffusion-v1-4" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.826, + 0.568, + 0.84 + ], + "angle": 0, + "content": "7 https://openaipublic.azureedge.net/clip/ViT-B-32" + }, + { + "type": "list", + "bbox": [ + 0.221, + 0.783, + 0.689, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 3: Ablated performance of COMO trained on combinations of factuals and counterfactuals. For training on full factuals and counterfactuals (i.e. COCO-CF), COMO has two learning strategies, Random and In-Batch. The In-Batch strategy enforces the factual and its corresponding counterfactual feeded into the same mini-batch (see Figure 2(c)), while the Random strategy does not." + }, + { + "type": "table", + "bbox": [ + 0.243, + 0.227, + 0.758, + 0.315 + ], + "angle": 0, + "content": "
Fine-turned DatasetsVL-ChecklistWinoground
RelationAttributeObjectAverageTextImage GroupAverage
None (pre-trained CLIP)61.8067.3282.9170.6730.5011.008.7516.75
Factuals Only (i.e. COCO)62.1267.4382.9870.8430.2510.508.7516.50
Factuals + Counterfactuals (Random)61.9567.7983.1270.9530.2511.009.0016.75
Factuals + Counterfactuals (In-Batch)71.1673.4486.2076.9331.0012.009.7517.58
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.342, + 0.788, + 0.446 + ], + "angle": 0, + "content": "We observe that our COMO achieves the new state-of-the-art performance on both concepts understanding datasets. Specifically, our COMO outperforms the best baseline with \\(3.17\\%\\) relative improvement in terms of VL-Checklist's attribute metric, and with \\(4.35\\%\\) relative improvement in terms of image score on Winoground. This shows that our COMO can better understand the concepts beyond bag-of-objects and conduct compositional reasoning about relation, attribute, and word order." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.448, + 0.788, + 0.597 + ], + "angle": 0, + "content": "Furthermore, our COMO gets the best result over all six settings on both datasets. It shows our model can distinguish the differences between causal and spurious concepts. The improvement of COMO over baselines could be attributed to reasons below: i) COMO admits multimodal counterfactual examples by injecting concepts from pretrained masked language models and text-to-image diffusion model, which explicitly improve the clear understanding of VL models on semantic concepts; ii) COMO adopts a modified contrastive loss to reweight the importance of counterfactual samples in the mini-batch, which enforces the model to differentiate the original concepts in factuals from substitute concepts in counterfactuals." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.788, + 0.719 + ], + "angle": 0, + "content": "We display relative gains on fine-grained \"Attribute\" and \"Relation\" tests of VL-Checklist as shown in Figure 3a. It is clear that COMO gets gains across over all tests (Attribute: size, material, color, state, action; Relation: spatial, action). These improvements can be contributed to the multimodal counterfactual samples that enforce the model to attend to the small concepts changes in the vision and text, and hard negative contrastive loss that push the embedding of counterfactual samples close to the anchor to be far away by reweighting the importance of counterfactual examples." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.741, + 0.403, + 0.755 + ], + "angle": 0, + "content": "4.4 Ablation Studies" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Ablation on Mixing Factuals and Counterfactuals We have demonstrated that augmenting factual datasets (e.g. MS COCO) could improve the concept understanding and compositional reasoning of VL models with the help of multimodal counterfactual examples. We now conduct study on ablated contribution from factual, counterfactual, and their learning strategies. As shown in Table 3," + } + ], + [ + { + "type": "header", + "bbox": [ + 0.322, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "image", + "bbox": [ + 0.225, + 0.147, + 0.348, + 0.229 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.229, + 0.232, + 0.343, + 0.244 + ], + "angle": 0, + "content": "(a) Detailed results" + }, + { + "type": "image", + "bbox": [ + 0.354, + 0.148, + 0.493, + 0.228 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.365, + 0.232, + 0.482, + 0.244 + ], + "angle": 0, + "content": "(b) Contrastive loss" + }, + { + "type": "image", + "bbox": [ + 0.496, + 0.145, + 0.638, + 0.231 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.502, + 0.233, + 0.633, + 0.244 + ], + "angle": 0, + "content": "(c) #Synthetic images" + }, + { + "type": "image", + "bbox": [ + 0.64, + 0.145, + 0.784, + 0.231 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.647, + 0.232, + 0.78, + 0.244 + ], + "angle": 0, + "content": "(d) Percent of training" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.255, + 0.785, + 0.311 + ], + "angle": 0, + "content": "Fig. 3: (a) Detailed results of baselines (CLIP, SVLC, SyVic) and our COMO on VL-Checklist. A: Attribute, R: Relation. (b) Impact of guided-and-weighted contrastive loss; (c) Influence of the number of generated images; (d) Performance varying with the training percent. (all evaluated on VL-Checklist)" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.33, + 0.784, + 0.357 + ], + "angle": 0, + "content": "Table 4: Ablated contribution from counterfactual images and counterfactual texts in COMO." + }, + { + "type": "table", + "bbox": [ + 0.331, + 0.371, + 0.669, + 0.474 + ], + "angle": 0, + "content": "
Counterfactual\nImage TextVL-ChecklistWinoground\nAverage
RelationAttributeObjectAverage
CLIP61.8067.3282.9170.6716.75
XX62.1267.4382.9870.8416.50
X✓69.5671.1184.5575.0716.13
✓X69.3470.8584.2274.8016.58
✓✓71.1673.4486.2076.9317.58
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.506, + 0.788, + 0.702 + ], + "angle": 0, + "content": "we have the following findings. Firstly, compared to the pretrained CLIP, finetuning COMO on the factual only dataset (i.e., MS-COCO) has a negligible impact on Winoground dataset. It shows that the COMO that finetuning on only factual dataset still has the difficulty in concepts understanding beyond \"bag-of-objects\". Secondly, there is almost no improvement of performance when finetuning the COMO on the factual and counterfactual dataset with a random sampling strategies. It shows the necessity of enforcing the contrastive learning between counterfactuals and the factuals explicitly to reduce the VL model from the bias that taking spurious correlations between captions and images as shortcuts during training. Thirdly, compared to the random sampling strategy, sampling the factual and counterfactuals together (i.e. in a mini-batch) could improve VL models' robustness and the ability of concepts understanding and compositional reasoning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.705, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Ablation on Multimodal Counterfactuals Text and Image We have ablated the contributions from multimodal counterfactuals, and now we investigate the impact of individual counterfactual text and individual counterfactual image. As shown in Table 4, removing either of them degrades the performance while removing both of them degrades a lot, demonstrating the usefulness of both counterfactual texts and counterfactual images to improve VL models' concepts understanding. On the one hand, for the effectiveness of counterfactual text, COMO trained with counterfactual text performs much better than that trained with factual samples only. For examples, the relative improvement is" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.785, + 0.174 + ], + "angle": 0, + "content": "Table 5: Ablated Guided-and-Weighted Contrastive Loss on training from scratch and pretrained setting." + }, + { + "type": "table", + "bbox": [ + 0.333, + 0.185, + 0.668, + 0.269 + ], + "angle": 0, + "content": "
Pretrained Weighted lossVL-Checklist
RelationAttributeObjectAverage
✓✓71.1673.4486.2076.93
X✓64.4264.7575.0468.07
✓X70.0272.8685.3776.08
XX62.1362.4873.8166.14
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.296, + 0.785, + 0.446 + ], + "angle": 0, + "content": "11.9% in terms of VL-Checklist's relation metric. It shows that it is necessary to force the VL model to attend to the small changes in the text, which could improve the VL model's understanding on concepts. On the other hand, for the effectiveness of counterfactual image, COMO trained with counterfactual image performs much better than that trained with factual samples only. For example, the relative improvement is 11.6% in terms of VL-Checklist's relation metric. As for the relative importance of counterfactual texts and counterfactual images, COMO trained with counterfactual texts is better than that trained with counterfactual images when testing on the VL-Checklist, while it is on the contrary when testing on Winoground." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.448, + 0.788, + 0.613 + ], + "angle": 0, + "content": "Ablation on Guided-and-Weighted Contrastive Loss As shown in Table 5, on pretrained setting, the performance of COMO w/o the weighted loss consistently degrades on all of VL-Checklist metrics (relation, attribute, object). Although the performance of COMO in training from scratch drops by a large margin, to explore the effectiveness of weighted loss in training from scratch, we compare the COMO with naive loss and weighted loss in training from scratch settings. The table shows that our weighted loss still performs better than the naive contrastive loss in training from scratch settings, which shows the design of weighted loss is robust. These ablation results show that the full guided-and-weighted contrastive loss is beneficial compared to the standard (i.e. CLIP-loss) and unweighted (i.e. Eq.3) ones." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.635, + 0.482, + 0.65 + ], + "angle": 0, + "content": "4.5 Hyper-parameter Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.809 + ], + "angle": 0, + "content": "Influence of the number of generated images To improve the quality of generated images by text-to-diffusion models, and to reduce the inconsistencies in generated images and texts, we synthesize multiple images for a single caption at different time-step. In Figure 3c, we show the impact of the number of generated images on the three VL-Checklist evaluation settings (i.e. relation, attribute, object). We can see that, the performance increases as the number of generate images increases on all three evaluation settings, until getting saturated at around 8. This shows that filtering among the multiple generated images as the most satisfactory counterfactual image can improve the overall quality of our generated counterfactuals." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.811, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Low-resource scenario We conduct experiments in low-resource setting by randomly sampling part of the full training set to simulate a low-resource sce-" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.322, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.281, + 0.146, + 0.487, + 0.298 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.306, + 0.3, + 0.467, + 0.31 + ], + "angle": 0, + "content": "(a) Attention visualizations" + }, + { + "type": "table", + "bbox": [ + 0.494, + 0.144, + 0.721, + 0.298 + ], + "angle": 0, + "content": "
GroupType of ConceptImageCaptionCLIPCOMO w/o CF-ImageCOMO w/o CF-TestCOMO
Objectlocation[POS]: log on bus [NEG]: log on grassPOS:0.99 NEG:0.01POS:1.00 NEG:0.00POS:1.00 NEG:0.00POS:1.00 NEG:0.00
Relationspatial[POS]: beer in glass [NEG]: beer out of glassPOS:0.31 NEG:0.69POS:0.42 NEG:0.58POS:0.77 NEG:0.23POS:0.84 NEG:0.16
action[POS]: necklace on cooking man [NEG]: necklace on sleeping manPOS:0.44 NEG:0.56POS:0.99 NEG:0.01POS:0.98 NEG:0.02POS:0.99 NEG:0.01
color[POS]: water next to green scenery [NEG]: water next to dark brown sceneryPOS:0.35 NEG:0.65POS:0.66 NEG:0.34POS:0.45 NEG:0.55POS:0.89 NEG:0.11
material[POS]: handle on wooden cabinet [NEG]: handle on denim cabinetPOS:0.23 NEG:0.77POS:0.30 NEG:0.70POS:0.42 NEG:0.58POS:0.66 NEG:0.34
state[POS]: closed cabinet [NEG]: open cabinetPOS:0.01 NEG:0.99POS:0.11 NEG:0.89POS:0.18 NEG:0.82POS:0.37 NEG:0.63
" + }, + { + "type": "table_caption", + "bbox": [ + 0.54, + 0.3, + 0.679, + 0.311 + ], + "angle": 0, + "content": "(b) Qualitative analysis" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.323, + 0.784, + 0.364 + ], + "angle": 0, + "content": "Fig. 4: (a) Attention visualizations on COMO and CLIP. (b) Qualitative analysis on COMO and its three variants. Note, CLIP i.e. COMO w/o both of counterfactual images and texts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.395, + 0.785, + 0.501 + ], + "angle": 0, + "content": "nario. The results are shown in Figure 3d where the CLIP and COMO are both trained on the corresponding low-resource training set. We can see that both CLIP and COMO get better performance with the increasing of more training examples. Moreover, our COMO achieves much advantage under the extreme low-resource scenario. In detail, relative improvements of COMO over CLIP are \\(2.24\\%\\) at training percent \\(10\\%\\). It shows that our COMO is effective in improving the VL concepts' understanding under data scarcity scenario." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.526, + 0.353, + 0.541 + ], + "angle": 0, + "content": "4.6 Case study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.553, + 0.785, + 0.643 + ], + "angle": 0, + "content": "Attention visualizations We conduct attention visualizations on COMO and CLIP to observe the ability of visual and language concept understanding. As shown in Figure 4a, our COMO can capture object \"knife\" and attribute \"big\" while CLIP wrongly attends to \"plates\" and \"small\" cat. It shows that our COMO improve the clear understanding of VL models on semantic concepts and learn the difference between VL concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.786, + 0.809 + ], + "angle": 0, + "content": "Qualitative analysis We conduct qualitative experiments to understand the working of COMO and its three variants, i) COMO without counterfactual images (COMO w/o CF-image), ii) COMO without counterfactual texts (COMO w/o CF-text), and iii) COMO without both of them (i.e. CLIP). The results are shown in Figure 4b. Firstly, for frequently occurring VL \"bag-of-objects\" concepts, such as bus and grass in Figure 4b (Object-location), all VL models including CLIP, two variants of COMO, and COMO predict the caption correctly. However, CLIP can not identify the difference between \"cooking\" and \"sleeping\" in Figure 4b (Attribute-action), while all other VL models with counterfactuals match the image to the ground-truth caption correctly. It shows that the counterfactuals can help the model to learn the differences between concepts." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.786, + 0.84 + ], + "angle": 0, + "content": "Secondly, as for the importance of counterfactual texts (i.e. by observing the variant COMO w/o CF-text), as shown in Figure 4b (Attribute-color), removing" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.785, + 0.192 + ], + "angle": 0, + "content": "counterfactual texts leads to the COMO wrongly matching the image to the ground-truth caption. It is shown that the counterfactual text can help the model to learn the general concepts, especially when the factual description is coarse." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.192, + 0.787, + 0.283 + ], + "angle": 0, + "content": "Thirdly, as for the importance of counterfactual images (i.e. by observing the variant COMO w/o CF-image), as shown in Figure 4b (Relation-spatial), removing counterfactual images leads to the COMO wrongly predict the caption when the image has lots of visual concepts unrelated to the text. It shows that VL models with counterfactual images can reduce the influence of spurious concepts in image." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.283, + 0.787, + 0.388 + ], + "angle": 0, + "content": "Fourthly, as for the importance of multimodal counterfactuals, as shown in Figure 4b (Attribute-material), removing multimodal counterfactuals leads the COMO can not identify the material of cabinet from the image. The improvement of the VL model's concept understanding could be attributed to enforcing the model to attend to the small concept changes in the counterfactual image and text, and to match the counterfactual image and counterfactual text together to learn out of domain concepts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.389, + 0.787, + 0.509 + ], + "angle": 0, + "content": "We observe that, as shown in Figure 4b (Attribute-state), all VL models fail in matching the image to its ground-truth caption \"closed cabinet\". The failing reason could be that an \"open door\" appears in the image, which guides the model to trust that \"open\" is matching to the image. Though multimodal counterfactual samples improve the model's understanding of concepts, VL models still suffer from the problems of \"bags of objects\" in images and texts. It is worthy of investigating in improving concepts understanding and compositional reasoning of VL models." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.531, + 0.37, + 0.547 + ], + "angle": 0, + "content": "5 Conclusions" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.561, + 0.788, + 0.759 + ], + "angle": 0, + "content": "We have presented a data-and-algorithm driven technique for enhancing the performance of VL models to understand beyond \"bag-of-objects\" and reason about compositional concepts including attributes, relations, and word order. Our proposed contrastive learning framework with multimodal counterfactuals attains significant gains over five strong VL models on two benchmark datasets. It builds upon the modeling strength and knowledge of nowadays language models and diffusion models by injecting concepts to VL models, suggesting generalizations to future VL models. We demonstrated the necessity of both counterfactual texts and counterfactual images. We also show the necessity of effective learning with guided-and-weighted contrastive loss. Extensive ablation and case study help understand the working of the proposed approach as well its limitations, suggesting the future work of investigating other factors on improving compositional reasoning." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.78, + 0.405, + 0.797 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.81, + 0.785, + 0.84 + ], + "angle": 0, + "content": "This work is supported by National Natural Science Foundation of China (No. 62306220)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.322, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.176, + 0.785, + 0.218 + ], + "angle": 0, + "content": "1. Antol, S., Agrawal, A., Lu, J., Mitchell, M., Batra, D., Zitnick, C.L., Parikh, D.: Vqa: Visual question answering. In: Proceedings of the IEEE international conference on computer vision. pp. 2425-2433 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.219, + 0.785, + 0.272 + ], + "angle": 0, + "content": "2. Basu, A., Addepalli, S., Babu, R.V.: Rmlvqa: A margin loss approach for visual question answering with language biases. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11671-11680 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.273, + 0.785, + 0.328 + ], + "angle": 0, + "content": "3. Cascante-Bonilla, P., Shehada, K., Smith, J.S., Doveh, S., Kim, D., Panda, R., Varol, G., Oliva, A., Ordonez, V., Feris, R., et al.: Going beyond nouns with vision & language models using synthetic data. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 20155-20165 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.329, + 0.785, + 0.37 + ], + "angle": 0, + "content": "4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.371, + 0.785, + 0.425 + ], + "angle": 0, + "content": "5. Chen, Y., Yuan, J., Tian, Y., Geng, S., Li, X., Zhou, D., Metaxas, D.N., Yang, H.: Revisiting multimodal representation in contrastive learning: from patch and token embeddings to finite discrete tokens. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15095-15104 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.426, + 0.785, + 0.48 + ], + "angle": 0, + "content": "6. Chen, Y., Ma, Z., Zhang, Z., Qi, Z., Yuan, C., Shan, Y., Li, B., Hu, W., Qie, X., Wu, J.: Vilem: Visual-language error modeling for image-text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11018-11027 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.481, + 0.785, + 0.522 + ], + "angle": 0, + "content": "7. Chuang, C.Y., Robinson, J., Lin, Y.C., Torralba, A., Jegelka, S.: Debiased contrastive learning. Advances in neural information processing systems 33, 8765-8775 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.523, + 0.785, + 0.577 + ], + "angle": 0, + "content": "8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics. pp. 4171-4186 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.578, + 0.785, + 0.619 + ], + "angle": 0, + "content": "9. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative unsupervised feature learning with convolutional neural networks. Advances in neural information processing systems 27 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.62, + 0.785, + 0.66 + ], + "angle": 0, + "content": "10. Doveh, S., Arbelle, A., Harary, S., Alfassy, A., Herzig, R., Kim, D., Giryes, R., Feris, R., Panda, R., Ullman, S., et al.: Dense and aligned captions (dac) promote compositional reasoning in vl models. NeurIPS (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.785, + 0.715 + ], + "angle": 0, + "content": "1. Doveh, S., Arbelle, A., Harary, S., Schwartz, E., Herzig, R., Giryes, R., Feris, R., Panda, R., Ullman, S., Karlinsky, L.: Teaching structured vision & language concepts to vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2657-2668 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.716, + 0.785, + 0.757 + ], + "angle": 0, + "content": "2. Geirhos, R., Jacobsen, J.H., Michaelis, C., Zemel, R., Brendel, W., Bethge, M., Wichmann, F.A.: Shortcut learning in deep neural networks. Nature Machine Intelligence 2(11), 665-673 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.785, + 0.798 + ], + "angle": 0, + "content": "3. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "4. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality reduction by learning an invariant mapping. In: 2006 IEEE computer society conference on computer vision and pattern recognition (CVPR'06). vol. 2, pp. 1735-1742. IEEE (2006)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.176, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "15. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., QI, X.: Is synthetic data from generative models ready for image recognition? In: The Eleventh International Conference on Learning Representations (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.787, + 0.243 + ], + "angle": 0, + "content": "16. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.243, + 0.785, + 0.284 + ], + "angle": 0, + "content": "17. Kalantidis, Y., Sariyildiz, M.B., Pion, N., Weinzaepfel, P., Larlus, D.: Hard negative mixing for contrastive learning. Advances in Neural Information Processing Systems 33, 21798-21809 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.284, + 0.785, + 0.325 + ], + "angle": 0, + "content": "18. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. Advances in neural information processing systems 33, 18661-18673 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.325, + 0.787, + 0.379 + ], + "angle": 0, + "content": "19. Krishna, R., Zhu, Y., Groth, O., Johnson, J., Hata, K., Kravitz, J., Chen, S., Kalantidis, Y., Li, L.J., Shamma, D.A., et al.: Visual genome: Connecting language and vision using crowdsourced dense image annotations. International journal of computer vision 123, 32-73 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.379, + 0.785, + 0.406 + ], + "angle": 0, + "content": "20. Le, T., Lal, V., Howard, P.: Coco-counterfactuals: Automatically constructed counterfactual examples for image-text pairs. arXiv preprint arXiv:2309.14356 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.406, + 0.785, + 0.461 + ], + "angle": 0, + "content": "21. Li, C., Liu, H., Li, L., Zhang, P., Aneja, J., Yang, J., Jin, P., Hu, H., Liu, Z., Lee, Y.J., et al.: Elevater: A benchmark and toolkit for evaluating language-augmented visual models. Advances in Neural Information Processing Systems 35, 9287-9301 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.461, + 0.785, + 0.488 + ], + "angle": 0, + "content": "22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. ICML (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.488, + 0.785, + 0.528 + ], + "angle": 0, + "content": "23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.528, + 0.785, + 0.569 + ], + "angle": 0, + "content": "24. Li, Y.L., Xu, L., Liu, X., Huang, X., Xu, Y., Chen, M., Ma, Z., Wang, S., Fang, H.S., Lu, C.: Hake: Human activity knowledge engine. arXiv preprint arXiv:1904.06539 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.569, + 0.785, + 0.624 + ], + "angle": 0, + "content": "25. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.624, + 0.785, + 0.651 + ], + "angle": 0, + "content": "26. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM 38(11), 39-41 (1995)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.651, + 0.785, + 0.704 + ], + "angle": 0, + "content": "27. Moltisanti, D., Keller, F., Bilen, H., Sevilla-Lara, L.: Learning action changes by measuring verb-adverb textual relationships. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 23110-23118 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.705, + 0.785, + 0.746 + ], + "angle": 0, + "content": "28. Momeni, L., Caron, M., Nagrani, A., Zisserman, A., Schmid, C.: Verbs in action: Improving verb understanding in video-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15579-15591 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.746, + 0.785, + 0.772 + ], + "angle": 0, + "content": "29. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.785, + 0.813 + ], + "angle": 0, + "content": "30. Pham, K., Kafle, K., Lin, Z., Ding, Z., Cohen, S., Tran, Q., Shrivastava, A.: Learning to predict visual attributes in the wild. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13018-13028 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.785, + 0.841 + ], + "angle": 0, + "content": "31. Pratt, S., Yatskar, M., Weihs, L., Farhadi, A., Kembhavi, A.: Grounded situation recognition. In: European Conference on Computer Vision. pp. 314-332 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.322, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving VLC Understanding with Multimodal CF Samples" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.204 + ], + "angle": 0, + "content": "32. Radenovic, F., Dubey, A., Kadian, A., Mihaylov, T., Vandenhende, S., Patel, Y., Wen, Y., Ramanathan, V., Mahajan, D.: Filtering, distillation, and hard negatives for vision-language pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6967-6977 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.205, + 0.788, + 0.272 + ], + "angle": 0, + "content": "33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (18-24 Jul 2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.273, + 0.787, + 0.3 + ], + "angle": 0, + "content": "34. Robinson, J.D., Chuang, C.Y., Sra, S., Jegelka, S.: Contrastive learning with hard negative samples. In: International Conference on Learning Representations (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.301, + 0.787, + 0.342 + ], + "angle": 0, + "content": "35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.343, + 0.787, + 0.397 + ], + "angle": 0, + "content": "36. Roth, K., Kim, J.M., Koepke, A.S., Vinyals, O., Schmid, C., Akata, Z.: Waffling around for performance: Visual classification with random words and broad concepts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15746-15757 (October 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.398, + 0.787, + 0.438 + ], + "angle": 0, + "content": "37. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.439, + 0.787, + 0.481 + ], + "angle": 0, + "content": "38. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.481, + 0.787, + 0.522 + ], + "angle": 0, + "content": "39. Shi, H., Mao, J., Xiao, T., Jiang, Y., Sun, J.: Learning visually-grounded semantics from contrastive adversarial samples. In: Proceedings of the 27th International Conference on Computational Linguistics. pp. 3715-3727 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.523, + 0.787, + 0.577 + ], + "angle": 0, + "content": "40. Smith, J.S., Cascante-Bonilla, P., Arbelle, A., Kim, D., Panda, R., Cox, D., Yang, D., Kira, Z., Feris, R., Karlinsky, L.: Construct-vl: Data-free continual structured vl concepts learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14994-15004 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.578, + 0.787, + 0.632 + ], + "angle": 0, + "content": "41. Thrush, T., Jiang, R., Bartolo, M., Singh, A., Williams, A., Kiela, D., Ross, C.: Winoground: Probing vision and language models for visio-linguistic compositionality. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5238-5248 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.633, + 0.787, + 0.674 + ], + "angle": 0, + "content": "42. Tian, Y., Sun, C., Poole, B., Krishnan, D., Schmid, C., Isola, P.: What makes for good views for contrastive learning? Advances in neural information processing systems 33, 6827-6839 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.675, + 0.787, + 0.715 + ], + "angle": 0, + "content": "43. Trabucco, B., Doherty, K., Gurinas, M., Salakhutdinov, R.: Effective data augmentation with diffusion models. In: ICLR 2023 Workshop on Mathematical and Empirical Understanding of Foundation Models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.716, + 0.787, + 0.758 + ], + "angle": 0, + "content": "44. Wang, W., Yang, Z., Xu, B., Li, J., Sun, Y.: Vilt: Enhancing vision-language pre-training through textual augmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3158-3169 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.759, + 0.787, + 0.813 + ], + "angle": 0, + "content": "45. Wang, Z., Gao, Z., Guo, K., Yang, Y., Wang, X., Shen, H.T.: Multilateral semantic relations modeling for image text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 2830-2839 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.216, + 0.814, + 0.787, + 0.84 + ], + "angle": 0, + "content": "46. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.333, + 0.127 + ], + "angle": 0, + "content": "Lai et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.241, + 0.147, + 0.786, + 0.175 + ], + "angle": 0, + "content": "Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.787, + 0.23 + ], + "angle": 0, + "content": "47. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.23, + 0.787, + 0.285 + ], + "angle": 0, + "content": "48. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15943-15953 (October 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.285, + 0.787, + 0.34 + ], + "angle": 0, + "content": "49. Wu, H., Mao, J., Zhang, Y., Jiang, Y., Li, L., Sun, W., Ma, W.Y.: Unified visual-semantic embeddings: Bridging vision and language with structured meaning representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6609-6618 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.34, + 0.787, + 0.381 + ], + "angle": 0, + "content": "50. Wu, Y., Wei, Y., Wang, H., Liu, Y., Yang, S., He, X.: Grounded image text matching with mismatched relation reasoning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2976-2987 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.381, + 0.787, + 0.435 + ], + "angle": 0, + "content": "51. Xie, C.W., Sun, S., Xiong, X., Zheng, Y., Zhao, D., Zhou, J.: Ra-clip: Retrieval augmented contrastive language-image pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19265-19274 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.435, + 0.787, + 0.49 + ], + "angle": 0, + "content": "52. Yang, J., Duan, J., Tran, S., Xu, Y., Chanda, S., Chen, L., Zeng, B., Chilimbi, T., Huang, J.: Vision-language pre-training with triple contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15671-15680 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.49, + 0.787, + 0.544 + ], + "angle": 0, + "content": "53. Yang, K., Deng, J., An, X., Li, J., Feng, Z., Guo, J., Yang, J., Liu, T.: Alip: Adaptive language-image pre-training with synthetic caption. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2922-2931 (October 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.545, + 0.787, + 0.586 + ], + "angle": 0, + "content": "54. Yuksekgonul, M., Bianchi, F., Kalluri, P., Jurafsky, D., Zou, J.: When and why vision-language models behave like bags-of-words, and what to do about it? In: The Eleventh International Conference on Learning Representations (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.586, + 0.787, + 0.627 + ], + "angle": 0, + "content": "55. Zhang, X., Zhang, F., Xu, C.: Vqacl: A novel visual question answering continual learning setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19102-19112 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.627, + 0.787, + 0.654 + ], + "angle": 0, + "content": "56. Zhang, X., Zhao, J., LeCun, Y.: Character-level convolutional networks for text classification. Advances in neural information processing systems 28 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.654, + 0.787, + 0.694 + ], + "angle": 0, + "content": "57. Zhao, T., Zhang, T., Zhu, M., Shen, H., Lee, K., Lu, X., Yin, J.: Vl-checklist: Evaluating pre-trained vision-language models with objects, attributes and relations. arXiv preprint arXiv:2207.00221 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.694, + 0.787, + 0.735 + ], + "angle": 0, + "content": "58. Zhen, L., Hu, P., Wang, X., Peng, D.: Deep supervised cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10394-10403 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.735, + 0.787, + 0.79 + ], + "angle": 0, + "content": "59. Zhong, Y., Yang, J., Zhang, P., Li, C., Codella, N., Li, L.H., Zhou, L., Dai, X., Yuan, L., Li, Y., et al.: Regionclip: Region-based language-image pretraining. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16793-16803 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.79, + 0.787, + 0.832 + ], + "angle": 0, + "content": "60. Zhong, Z., Zheng, L., Kang, G., Li, S., Yang, Y.: Random erasing data augmentation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 13001-13008 (2020)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.832 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_origin.pdf b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5bc92f85ee65d1937550141795710e909cc7d117 --- /dev/null +++ b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/cda4bedb-226c-4d39-a511-0aa7500b49ee_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:becb146aaff844c0ec6bc0602d9530e517a411175f4f8a7ac71a3326ddf5b976 +size 762082 diff --git a/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/full.md b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/full.md new file mode 100644 index 0000000000000000000000000000000000000000..663df4527aed3e982150d5c92920c7b215ef3618 --- /dev/null +++ b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/full.md @@ -0,0 +1,297 @@ +# Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples + +Chengen Lai, Shengli Song*, Sitong Yan, and Guangneng Hu + +School of Computer Science and Technology, Xidian University, Xi'an, China {laice, styan}@stu.xidian.edu.cn, shlsong@xidian.edu.cn, njuhgn@gmail.com + +Abstract. Vision and Language (VL) models have achieved remarkable performance in a variety of multimodal learning tasks. The success of these models is attributed to learning a joint and aligned representation space of visual and text. However, recent popular VL models still struggle with concepts understanding beyond bag-of-objects in images & texts, suffering from compositional reasoning about relationship between objects & attributes and word order. To address the above issues, we create a synthetic multimodal counterfactual dataset (COCO-CF) and propose a novel contrastive learning framework (COMO). We contribute the COCO-CF dataset which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and diffusion models to reduce the bias of bag-of-objects. We contribute the COMO framework for effectively leveraging COCO-CF to treat the counterfactual samples as hard negatives and reweight their importance during contrastive learning. Extensive experiments and ablations show COMO achieved a significant improvement of VL concept understanding on the two VL-Checklist and Winoground benchmarks over five strong VL baselines in their zero-shot setting evaluations. Dataset is available at https://github.com/laichengen/COMO. + +Keywords: Concepts Understanding $\cdot$ Contrastive learning $\cdot$ Multimodal Counterfactual Samples + +# 1 Introduction + +Vision and Language (VL) models have recently achieved impressive performance in various challenging multimodal learning tasks, including image-text retrieval [6, 45, 58], visual question answering [1, 2, 55], and captioning [22, 53], thanks to the availability of large paired image-text corpora [25, 37]. These cross-modal tasks are heavily dependent on joint representations of multi-modalities which are typically learned by building interactions between vision and language features [10, 32, 33, 59]. The goal is to learn an effective aligning representation spaces of images and text, typically under a contrastive learning framework [4, 5, 52]. + +![](images/c7a1caffe80459c295d0a7c6be09ffb3b57c0716136f43b98a6c62dbe3335477.jpg) +Fig. 1: Overview of our proposed multimodal counterfactual generation. (a) Standard contrastive text-to-image loss (e.g. CLIP [33]) is easy to solve "bag-of-objects"; (b) Contrastive learning with textual counterfactuals (e.g. SVLC [11])) teaches VL models by contrasting between counterfactual texts and original image. (c) Our proposed contrastive learning with multimodal counterfactuals (COMO) generate both textual and visual counterfactuals to improve the VL models' concept understanding by contrasting between counterfactual image (and text) and original text (and image), and matching the counterfactual image with counterfactual text. + +Despite these great advances on various vision and language tasks, they often exploit spurious correlations in datasets as shortcuts during training to fit the dataset [11, 12, 40]. Recent works have found popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks: the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54, 57]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects (see Figure 1(a)). + +In this paper, we propose a novel COntrastive learning framework with Multimodal cCounterfactuals (COMO) to improve the VL model's concepts understanding and compositional reasoning. We propose a way of leveraging the existing VL pre-training source to improve concepts understanding without any expensive and time-consuming human annotations on object attributes, relations, and states. The idea is to automatically generate a synthetic dataset by injecting counterfactual concepts from powerful pre-trained language and text-to-image stable diffusion [35]. On top of the recently proposed text augmentation [3, 11, 44] (see Figure 1(b)), we go deeper to study the effects of multimodal augmentation—i.e., generating both text counterfactual and image counterfactual examples—on the compositional reasoning performance of VL models trained on such synthetic multimodal counterfactual dataset (see Figure 1(c)). + +We empirically find that both text counterfactual and image counterfactual contribute to the improved concepts understanding, demonstrating the necessity of multimodal augmentation. + +Our multimodal counterfactual generation not only substitutes the concept in the text by exploiting pretrained masked language models, but also synthesizes the corresponding image by exploiting text-to-image stable diffusion. Compared to textual counterfactual generation, our multimodal counterfactual samples match the counterfactual text and image together, to learn out-of-domain concepts and alleviate the data scarcity in multimodal learning task. The generated multimodal counterfactual dataset improves the quality of image-caption alignment and reduces the bias of bag-of-objects. To effectively enforce the VL model to distinguish between original concepts and substituted concepts, we treat the counterfactual samples as hard negatives by modifying the traditional contrastive loss to dynamically reweigh their importance. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples). + +Our main contributions can be summarized as: + +- We contribute a multimodal counterfactual dataset (COCO-CF) which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and stable diffusion to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning. +- We propose a novel contrastive framework (COMO) for effectively leveraging COCO-CF to treat the multimodal counterfactual samples as hard negatives and reweight their importance during contrastive learning to enforce the VL model differentiating the original concepts from substituted ones. +- We demonstrate the compositional reasoning performance of COMO on the two VL-Checklist and Winoground benchmarks with $3.17\%$ (on VL-Checklist's attribute) and $4.35\%$ (on Winoground's image) improvement over the current SOTA models, respectively. We also perform detailed ablation on the importance of counterfactual text, counterfactual image, and the new contrastive loss. + +# 2 Related Work + +Vision and Language Models Pretrained VL models [16, 23, 32] have made impressive performance in various zero-shot downstream tasks, such as image-text retrieval [58]. However, recent research [3, 11, 57] show that existing VL models often exploit spurious correlations between non-causal features as shortcuts during training to fit the dataset [12, 54] and still struggle with vision and language concepts understanding. Popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks: + +the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects. In this paper, we propose a data-driven technique to improve concepts understanding for typical VL models. + +Counterfactual Samples Generation Counterfactual samples are widely used in various computer vision and natural language processing tasks [46, 60]. Counterfactual texts have been shown to improve the robustness of models through random word substitution [36, 47] and swap [54, 56]. Counterfactual captions are generated by rule-based [11, 36, 39] or pretrained language models [11, 44, 51] to enhance semantic coherence and ground the mismatched words [50]. Diffusion models [15] are exploited to generate text-image pairs [38, 43, 48]. Synthetic videos and corresponding text captions are generated by using 3D graphic engines [3]. A counterfactual dataset created by substituting nouns only, ignoring the "beyond nouns" concepts [20]. In contrast, we create a multimodal counterfactual dataset (COCO-CF) which is automatically generated from existing VL pre-training source (i.e., MS-COCO) by injecting concepts from off-the-shelf language models and stable diffusion. COCO-CF can be used to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning without any expensive and time-consuming human annotations on object attributes, relations, and states. + +Hard-Negative Contrastive Learning (CL) [14] is exploited to learn aligned representations of text and image in most VL models [9, 18, 42]. Recently, some studies have investigated the selection of hard negative examples [17, 44] and accounted for the importance of different negative samples [7, 32, 34]. We extend the hard negative loss to vision-language concepts understanding by treating the counterfactual samples as hard negatives by modifying the traditional contrastive loss. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples, so as to improve the compositional reasoning about object relation, attributes, state, and word order in texts. + +# 3 Method + +In this section, our COntrastive framework with Multimodal cCounterfactual examples (COMO) are presented for improving the VL model's understanding of concepts and enhancing robustness of VL models. As shown in Figure 2, COMO consists of an effective way of generating the multimodal counterfactual text and image samples (see Figure 2(a-b)), and a novel loss of counterfactual guided and weighted contrastive learning (see Figure 2(c)). In the following, we firstly describe the counterfactual text and image samples generation in Section 3.1. + +![](images/3ffea7e6f2ffab9c7fadab034aac63960c6c41f7ec21f8cad9f67c0d25636140.jpg) + +![](images/69e51accfcae2108caddbee4c5f19d409afc40fb2231f906bccff69c65043218.jpg) + +![](images/7f342fd48658e785b2fb9524bfed9e3a6ed7f6edb3e99773cf7ca341c056f5e2.jpg) +Fig. 2: The proposed contrastive learning framework with multimodal counterfactual samples (COMO). (a) Generating counterfactual text uses masked language models such as BERT1. (b) Generating counterfactual image uses text-to-image diffusion models2. (c) Counterfactual guided and weighted hard negative contrastive learning. This module feeds the generated counterfactual text and image into the same mini-batch and exploits a hard negative loss to improve the VL models' concept understanding. The longer the red arrow, the further it pushes away. + +Then, we introduce the counterfactual guided and weighted contrastive loss in Section 3.2, respectively. + +# 3.1 Generation of Multimodal Counterfactual + +Recent works [11, 49] have shown the effectiveness of injecting concepts to VL models by textual-modality augmentation. Compared to these works, we improve the VL models' concepts understanding by automatically constructing both textual and visual counterfactual examples in a way of multimodal augmentation. Counterfactual Text Generation To improve the clear understanding of VL models on concepts beyond bag-of-objects and rather than spurious correlated features, we manipulate the original caption $T^o$ to construct its corresponding counterfactual caption $T^c$ with subtle but completely different semantics. Counterfactual text $T^c$ is generated by replacing a concept in $T^o$ , while most of its original details remain the same. In this way, the generated counterfactual caption represents the changed causal concept while remaining preserved + +details from the original caption can be viewed as potentially spurious correlated features. + +Large or pre-trained language models [8] are capable of suggesting multiple words that fit the context given a sentence with one missing word. We can automatically create a plausible negative sentence which is difficult for VL models to distinguish from its corresponding actual caption by randomly selecting a masked word. Such masked word should be useful for compositional reasoning about objects relation, attributes, and states. This can be achieved by NLP parsing technique to identify all objects (nouns), relations (verbs and adverb), and attributes (adjectives) in the original caption sentence. In specific, we randomly choose a word among these concepts, replace the selected concept in $T^o$ with the [MASK] token, and then retrieve the most probable replacements by the language models unmasking as our generated counterfactual caption $T^c$ (see Figure 2(a)). These counterfactual/negative examples enforce the VL model focusing on the important details that affect the concepts understanding and compositional reasoning. + +Counterfactual Image Generation After creating a counterfactual caption $T^c$ , the VL models can understand the original text-image pair $(T^o, V^o)$ but have no idea of what the corresponding image of counterfactual caption $T^c$ looks like. Therefore, we explicitly generate a corresponding counterfactual image $V^c$ by feeding the counterfactual caption $T^c$ into stable diffusion models (see Figure 2(b)). To control the quality of generated images and enable the changed concept (causal concept) to be learned in the presence of unchanged concepts (spurious concepts) between $T^c$ and $T^o$ , we firstly generate multiple images $\{V_{ij}\}_{i=1}^{n}$ . Then we choose the counterfactual image $V^c$ which has the highest similarity score with both the counterfactual caption $T^c$ and the original image $V^o$ by: + +$$ +\operatorname {s c o r e} _ {i} = \varepsilon_ {T} \left(T ^ {c}\right) \cdot \varepsilon_ {V} \left(V _ {i}\right) + \varepsilon_ {V} \left(V ^ {o}\right) \cdot \varepsilon_ {V} \left(V _ {i}\right) \tag {1} +$$ + +where $\varepsilon_T(\cdot)$ and $\varepsilon_V(\cdot)$ are text and image encoders in $\mathrm{CLIP}^3$ , respectively. The first part of the score measures the consistency between the generated image and counterfactual caption $T^c$ , and the second part measures the similarity between the generated image and the original image $V^o$ . + +# 3.2 Counterfactual Guided and Weighted Contrastive Learning + +Contrastive learning [29] is an effective approach for multimodal alignment, which pulls the positive pairs to anchor nearby locations, while pushes negative pairs further away. A dual-encoder VL model like CLIP [33] admits text-image pair $(T,V)$ and computes their similarity score by: + +$$ +S (T, V) = \exp (\boldsymbol {t} ^ {\top} \boldsymbol {v} / \tau) \tag {2} +$$ + +where $\pmb{t} = \varepsilon_T(T)$ and $\pmb{v} = \varepsilon_V(V)$ are the encoded features of the image-text pair respectively. Temperature $\tau > 0$ is learnable. + +Counterfactual Guided Contrastive Learning The naive contrastive learning with uniform sampling from large-scale datasets can often provide negative samples that are not necessarily discriminative. In our counterfactual guided contrastive learning, we feed the original example with its corresponding counterfactual example into the same mini-batch so as to enforce the VL model differentiates the original concept from substituted concept (see Figure 2(c)). + +Given a mini-batch $\mathcal{B} = \{(T_i,V_i)\}_{i = 1}^n$ of containing the factual and its counterfactual image-caption pairs, the contrastive CLIP-loss [29] is defined as: + +$$ +\mathcal {L} _ {\mathrm {H N}} = - \sum_ {i = 1} ^ {n} \left[ \log \frac {S \left(T _ {i} , V _ {i}\right)}{\sum_ {j} S \left(T _ {i} , V _ {j}\right)} + \log \frac {S \left(T _ {i} , V _ {i}\right)}{\sum_ {j} S \left(T _ {j} , V _ {i}\right)} \right] \tag {3} +$$ + +The hard negative for factual image-caption $(T^o, V^o)$ (causal concept) is its corresponding counterfactual image-caption $(T^c, V^c)$ (spurious concept), which needs to be pushed far away (see Figure 2(c)). + +Counterfactual Weighted Contrastive Learning To emphasize hard negative pairs (i.e., between the factual example and its corresponding counterfactual example) and push the embedding of counterfactual sample (which is close to the factual example) far away from the anchor, we modify the un-weighted contrastive loss in Eq.3 as the weighted version in the following: + +$$ +\begin{array}{l} \mathcal {L} _ {\mathrm {H N W}} = - \sum_ {i = 1} ^ {n} \left[ \log \frac {S \left(T _ {i} , V _ {i}\right)}{S \left(T _ {i} , V _ {i}\right) + \sum_ {j \neq i} \boldsymbol {\alpha} _ {i j} \cdot S \left(T _ {i} , V _ {j}\right)} \right. \tag {4} \\ \left. + \log \frac {S \left(T _ {i} , V _ {i}\right)}{S \left(T _ {i} , V _ {i}\right) + \sum_ {j \neq i} \boldsymbol {\beta} _ {j i} \cdot S \left(T _ {j} , V _ {i}\right)} \right] \\ \end{array} +$$ + +where the weights are computed by: + +$$ +\boldsymbol {\alpha} _ {i j} = \frac {(n - 1) \cdot S \left(T _ {i} , V _ {j}\right)}{\sum_ {k \neq i} S \left(T _ {i} , V _ {k}\right)} \quad \beta_ {j i} = \frac {(n - 1) \cdot S \left(T _ {j} , V _ {i}\right)}{\sum_ {k \neq i} S \left(T _ {k} , V _ {i}\right)} \tag {5} +$$ + +Weights $\alpha_{ij}$ and $\beta_{ij}$ are designed that difficult negative pairs (e.g., between original examples and corresponding counterfactual examples) are emphasized, and easier pairs (e.g., between original examples and other "bag-of-objects" examples) are ignored. So, the VL model can more easily understand the concepts beyond objects and improve the compositional reasoning about relation, attribute, and word order. Observe that we get contrastive objective of Eq.3 when setting weights to be all ones. The form of weights is an unnormalized von Mises-Fisher distribution [32]. + +# 4 Experiments + +# 4.1 Datasets + +To test the effectiveness of our proposed COMO for improving VL models' vision language concepts understanding, we train the model using our counterfactual image-text pairs generated from MS-COCO [25]. We evaluate on the + +Table 1: The statistics of factual and counterfactual examples in the generated COCO-CF dataset. + +
Factual +# images # textCounterfactual +# images # textTotal +# images # text
COCO-CF113K 567K567K 567K680K 1,134K
+ +VL-Checklist [57], Winoground [41] and Zero-Shot Classification [21] datasets over strong VL models. We introduce the training and testing datasets in detail below. + +Training datasets. We start from MS-COCO [25] dataset as our factual samples, where an image has multiple corresponding captions. We automatically generate the counterfactual image-text pairs from COCO with our multimodal counterfactual generation pipeline (see Figure 2(a-b)). The augmented dataset is named as COCO-CF, meaning COCO counterfactual examples. As shown in Table 1, we obtain additional 567K counterfactual images and captions based on the original 113K images and 567K text. Finally, COCO-CF has total 680K images and 1,134K captions. + +Evaluation datasets. We evaluate our models on VL-Checklist, Winoground and Zero-Shot classification datasets. + +VL-Checklist [57] is a large-scale dataset comprised of Visual Genome [19], SwiG [31], VAW [30], and HAKE [24]. Each image is associated with two captions, a positive and a negative. The positive caption corresponds to the image and is taken from the source dataset. The negative caption is generated from the positive caption by changing one word only, so the resulting sentence no longer corresponds to the image. Depending on the word that was changed, VL-Checklist evaluates seven types of VL concepts divided into three categories: (i) Attributes (color, material, size, state, and action); (ii) Relations (spatial or action relation between two objects and/or humans); and (iii) Objects (spatial location and size). + +Winoground [41] is a dataset that evaluates the ability of VL models for compositional reasoning, specifically understanding the meaning of the sentence after changing the order of its words. An example comprises of two images and two texts. The texts have the same set of words but in a different order, each text corresponding to one image in the paired sample. The Winoground evaluation divide into three metrics: (i) image score - percent of samples where the model picks the correct image for each text; (ii) text score - percent of samples where the model picks the correct text for each image; (iii) group score - percent of samples where both text and image score conditions are satisfied jointly. + +Zero-Shot Classification [21] is a dataset that includes 21 different classification datasets, we evaluate our model and report the average result over the dataset. + +Table 2: Performance comparison with strong VL baselines on the VL-Checklist, Winoground and 21 classification task datasets in zero-shot setting evaluation. + +
ModelsFine-tuned Dataset SizeVL-ChecklistWinoground21-Zero-Shot Task
RelationAttributeObjectTextImageGroup
CLIP (Radford et al, 2021)None61.8067.3282.9130.5011.008.7556.37
CyCLIP (Goel et al, 2022)None61.1566.9680.8730.5010.759.0055.99
NegCLIP (Yuksekgonul et al, 2023)None63.5272.2381.3529.5010.508.00-
SyVic (Cascante-Bonilla et al, 2023)767K69.3970.3784.6230.0011.509.5054.77
SVLC (Doveh et al, 2023)3M69.6871.1884.7529.7511.009.0055.27
COMO (ours)1.1M71.1673.4486.2031.0012.009.7555.87
Improvement over best baseline-2.12%3.17%1.70%1.60%4.35%2.63%-0.89%
+ +# 4.2 Implementation details + +For the multimodal counterfactual samples generation(Sec. 3.1), we use NLP spacy4 to parse the sentence into its components including nouns, verbs, adjectives, adverbs, etc. Then we utilize the popular BERT5 as the masked LMs to generate the counterfactual text. To ensure the words sampled from the LM are true negatives, we obtain the synonyms set of the original word from the WordNet [26], and generate n candidates from the language model. Then we filter out the candidates that belong in the original word's synonyms set and variants (i.e., plural and tense). Finally, we choose the one which has the highest score among the remaining candidates as our counterfactual text. After we generate the counterfactual captions, we use the text-to-image stable diffusion model6 to synthesize multiple images (size set to 10). For the model architecture, following [3,11], we utilize the original CLIP implementation that initialized with the checkpoints of VIT-B/327 released by the OpenAI. We modify the naive contrastive loss in their codebase to our counterfactual guided-and-weighted hard negative contrastive loss (see Eq.4). For the model training, we use Adam optimizer with a 1e-6 initial learning rate and a 1e-7 weight decay for finetuning, where the batch size is set to 16 and the training epochs to 5. We conduct all experiments on one NVIDIA GTX A100-PCIE-40GB GPUs with PyTorch 1.9.0. Our code and model checkpoints will be released upon acceptance together with the generated counterfactual examples COCO-CF dataset. + +# 4.3 Main Results + +We compare our COMO method with five state-of-the-art methods on three benchmark datasets and the results are shown in Table 2, where the best results are in boldface. We have following observations. + +4 https://github.com/explosion/spacy-models/en_core_web_trf-3.7.2 +5 https://huggingface.co/bert-base-uncased +6 https://huggingface.co/CompVis/stable-diffusion-v1-4 +7 https://openaipublic.azureedge.net/clip/ViT-B-32 + +Table 3: Ablated performance of COMO trained on combinations of factuals and counterfactuals. For training on full factuals and counterfactuals (i.e. COCO-CF), COMO has two learning strategies, Random and In-Batch. The In-Batch strategy enforces the factual and its corresponding counterfactual feeded into the same mini-batch (see Figure 2(c)), while the Random strategy does not. + +
Fine-turned DatasetsVL-ChecklistWinoground
RelationAttributeObjectAverageTextImage GroupAverage
None (pre-trained CLIP)61.8067.3282.9170.6730.5011.008.7516.75
Factuals Only (i.e. COCO)62.1267.4382.9870.8430.2510.508.7516.50
Factuals + Counterfactuals (Random)61.9567.7983.1270.9530.2511.009.0016.75
Factuals + Counterfactuals (In-Batch)71.1673.4486.2076.9331.0012.009.7517.58
+ +We observe that our COMO achieves the new state-of-the-art performance on both concepts understanding datasets. Specifically, our COMO outperforms the best baseline with $3.17\%$ relative improvement in terms of VL-Checklist's attribute metric, and with $4.35\%$ relative improvement in terms of image score on Winoground. This shows that our COMO can better understand the concepts beyond bag-of-objects and conduct compositional reasoning about relation, attribute, and word order. + +Furthermore, our COMO gets the best result over all six settings on both datasets. It shows our model can distinguish the differences between causal and spurious concepts. The improvement of COMO over baselines could be attributed to reasons below: i) COMO admits multimodal counterfactual examples by injecting concepts from pretrained masked language models and text-to-image diffusion model, which explicitly improve the clear understanding of VL models on semantic concepts; ii) COMO adopts a modified contrastive loss to reweight the importance of counterfactual samples in the mini-batch, which enforces the model to differentiate the original concepts in factuals from substitute concepts in counterfactuals. + +We display relative gains on fine-grained "Attribute" and "Relation" tests of VL-Checklist as shown in Figure 3a. It is clear that COMO gets gains across over all tests (Attribute: size, material, color, state, action; Relation: spatial, action). These improvements can be contributed to the multimodal counterfactual samples that enforce the model to attend to the small concepts changes in the vision and text, and hard negative contrastive loss that push the embedding of counterfactual samples close to the anchor to be far away by reweighting the importance of counterfactual examples. + +# 4.4 Ablation Studies + +Ablation on Mixing Factuals and Counterfactuals We have demonstrated that augmenting factual datasets (e.g. MS COCO) could improve the concept understanding and compositional reasoning of VL models with the help of multimodal counterfactual examples. We now conduct study on ablated contribution from factual, counterfactual, and their learning strategies. As shown in Table 3, + +![](images/62717773491d200163186d4f4f8b750c2bfc82407a6e9cfacd4044562fd1d7f9.jpg) +(a) Detailed results + +![](images/5f26fa9348fa9e37b15e48bd2f4d8b481f238aaf58180b25f47e4574ba0c13ff.jpg) +(b) Contrastive loss + +![](images/2b064737b94bda08fa0711881b57c21dd273ddb914437cff77aff4f64c8a1d3b.jpg) +Fig. 3: (a) Detailed results of baselines (CLIP, SVLC, SyVic) and our COMO on VL-Checklist. A: Attribute, R: Relation. (b) Impact of guided-and-weighted contrastive loss; (c) Influence of the number of generated images; (d) Performance varying with the training percent. (all evaluated on VL-Checklist) + +![](images/dfbc32978f37b3415873d3c3c73783c52e1310c29927319242b943298eadfab7.jpg) +(c) #Synthetic images +(d) Percent of training + +Table 4: Ablated contribution from counterfactual images and counterfactual texts in COMO. + +
Counterfactual +Image TextVL-ChecklistWinoground +Average
RelationAttributeObjectAverage
CLIP61.8067.3282.9170.6716.75
XX62.1267.4382.9870.8416.50
X✓69.5671.1184.5575.0716.13
✓X69.3470.8584.2274.8016.58
✓✓71.1673.4486.2076.9317.58
+ +we have the following findings. Firstly, compared to the pretrained CLIP, finetuning COMO on the factual only dataset (i.e., MS-COCO) has a negligible impact on Winoground dataset. It shows that the COMO that finetuning on only factual dataset still has the difficulty in concepts understanding beyond "bag-of-objects". Secondly, there is almost no improvement of performance when finetuning the COMO on the factual and counterfactual dataset with a random sampling strategies. It shows the necessity of enforcing the contrastive learning between counterfactuals and the factuals explicitly to reduce the VL model from the bias that taking spurious correlations between captions and images as shortcuts during training. Thirdly, compared to the random sampling strategy, sampling the factual and counterfactuals together (i.e. in a mini-batch) could improve VL models' robustness and the ability of concepts understanding and compositional reasoning. + +Ablation on Multimodal Counterfactuals Text and Image We have ablated the contributions from multimodal counterfactuals, and now we investigate the impact of individual counterfactual text and individual counterfactual image. As shown in Table 4, removing either of them degrades the performance while removing both of them degrades a lot, demonstrating the usefulness of both counterfactual texts and counterfactual images to improve VL models' concepts understanding. On the one hand, for the effectiveness of counterfactual text, COMO trained with counterfactual text performs much better than that trained with factual samples only. For examples, the relative improvement is + +Table 5: Ablated Guided-and-Weighted Contrastive Loss on training from scratch and pretrained setting. + +
Pretrained Weighted lossVL-Checklist
RelationAttributeObjectAverage
✓✓71.1673.4486.2076.93
X✓64.4264.7575.0468.07
✓X70.0272.8685.3776.08
XX62.1362.4873.8166.14
+ +11.9% in terms of VL-Checklist's relation metric. It shows that it is necessary to force the VL model to attend to the small changes in the text, which could improve the VL model's understanding on concepts. On the other hand, for the effectiveness of counterfactual image, COMO trained with counterfactual image performs much better than that trained with factual samples only. For example, the relative improvement is 11.6% in terms of VL-Checklist's relation metric. As for the relative importance of counterfactual texts and counterfactual images, COMO trained with counterfactual texts is better than that trained with counterfactual images when testing on the VL-Checklist, while it is on the contrary when testing on Winoground. + +Ablation on Guided-and-Weighted Contrastive Loss As shown in Table 5, on pretrained setting, the performance of COMO w/o the weighted loss consistently degrades on all of VL-Checklist metrics (relation, attribute, object). Although the performance of COMO in training from scratch drops by a large margin, to explore the effectiveness of weighted loss in training from scratch, we compare the COMO with naive loss and weighted loss in training from scratch settings. The table shows that our weighted loss still performs better than the naive contrastive loss in training from scratch settings, which shows the design of weighted loss is robust. These ablation results show that the full guided-and-weighted contrastive loss is beneficial compared to the standard (i.e. CLIP-loss) and unweighted (i.e. Eq.3) ones. + +# 4.5 Hyper-parameter Analysis + +Influence of the number of generated images To improve the quality of generated images by text-to-diffusion models, and to reduce the inconsistencies in generated images and texts, we synthesize multiple images for a single caption at different time-step. In Figure 3c, we show the impact of the number of generated images on the three VL-Checklist evaluation settings (i.e. relation, attribute, object). We can see that, the performance increases as the number of generate images increases on all three evaluation settings, until getting saturated at around 8. This shows that filtering among the multiple generated images as the most satisfactory counterfactual image can improve the overall quality of our generated counterfactuals. + +Low-resource scenario We conduct experiments in low-resource setting by randomly sampling part of the full training set to simulate a low-resource sce- + +![](images/aabb51e46b2b58a07c4e401d3cbf3267db60b182ad1a5a45390b32d7163ec1f6.jpg) +(a) Attention visualizations +Fig. 4: (a) Attention visualizations on COMO and CLIP. (b) Qualitative analysis on COMO and its three variants. Note, CLIP i.e. COMO w/o both of counterfactual images and texts. + +
GroupType of ConceptImageCaptionCLIPCOMO w/o CF-ImageCOMO w/o CF-TestCOMO
Objectlocation[POS]: log on bus [NEG]: log on grassPOS:0.99 NEG:0.01POS:1.00 NEG:0.00POS:1.00 NEG:0.00POS:1.00 NEG:0.00
Relationspatial[POS]: beer in glass [NEG]: beer out of glassPOS:0.31 NEG:0.69POS:0.42 NEG:0.58POS:0.77 NEG:0.23POS:0.84 NEG:0.16
action[POS]: necklace on cooking man [NEG]: necklace on sleeping manPOS:0.44 NEG:0.56POS:0.99 NEG:0.01POS:0.98 NEG:0.02POS:0.99 NEG:0.01
color[POS]: water next to green scenery [NEG]: water next to dark brown sceneryPOS:0.35 NEG:0.65POS:0.66 NEG:0.34POS:0.45 NEG:0.55POS:0.89 NEG:0.11
material[POS]: handle on wooden cabinet [NEG]: handle on denim cabinetPOS:0.23 NEG:0.77POS:0.30 NEG:0.70POS:0.42 NEG:0.58POS:0.66 NEG:0.34
state[POS]: closed cabinet [NEG]: open cabinetPOS:0.01 NEG:0.99POS:0.11 NEG:0.89POS:0.18 NEG:0.82POS:0.37 NEG:0.63
+ +(b) Qualitative analysis + +nario. The results are shown in Figure 3d where the CLIP and COMO are both trained on the corresponding low-resource training set. We can see that both CLIP and COMO get better performance with the increasing of more training examples. Moreover, our COMO achieves much advantage under the extreme low-resource scenario. In detail, relative improvements of COMO over CLIP are $2.24\%$ at training percent $10\%$ . It shows that our COMO is effective in improving the VL concepts' understanding under data scarcity scenario. + +# 4.6 Case study + +Attention visualizations We conduct attention visualizations on COMO and CLIP to observe the ability of visual and language concept understanding. As shown in Figure 4a, our COMO can capture object "knife" and attribute "big" while CLIP wrongly attends to "plates" and "small" cat. It shows that our COMO improve the clear understanding of VL models on semantic concepts and learn the difference between VL concepts. + +Qualitative analysis We conduct qualitative experiments to understand the working of COMO and its three variants, i) COMO without counterfactual images (COMO w/o CF-image), ii) COMO without counterfactual texts (COMO w/o CF-text), and iii) COMO without both of them (i.e. CLIP). The results are shown in Figure 4b. Firstly, for frequently occurring VL "bag-of-objects" concepts, such as bus and grass in Figure 4b (Object-location), all VL models including CLIP, two variants of COMO, and COMO predict the caption correctly. However, CLIP can not identify the difference between "cooking" and "sleeping" in Figure 4b (Attribute-action), while all other VL models with counterfactuals match the image to the ground-truth caption correctly. It shows that the counterfactuals can help the model to learn the differences between concepts. + +Secondly, as for the importance of counterfactual texts (i.e. by observing the variant COMO w/o CF-text), as shown in Figure 4b (Attribute-color), removing + +counterfactual texts leads to the COMO wrongly matching the image to the ground-truth caption. It is shown that the counterfactual text can help the model to learn the general concepts, especially when the factual description is coarse. + +Thirdly, as for the importance of counterfactual images (i.e. by observing the variant COMO w/o CF-image), as shown in Figure 4b (Relation-spatial), removing counterfactual images leads to the COMO wrongly predict the caption when the image has lots of visual concepts unrelated to the text. It shows that VL models with counterfactual images can reduce the influence of spurious concepts in image. + +Fourthly, as for the importance of multimodal counterfactuals, as shown in Figure 4b (Attribute-material), removing multimodal counterfactuals leads the COMO can not identify the material of cabinet from the image. The improvement of the VL model's concept understanding could be attributed to enforcing the model to attend to the small concept changes in the counterfactual image and text, and to match the counterfactual image and counterfactual text together to learn out of domain concepts. + +We observe that, as shown in Figure 4b (Attribute-state), all VL models fail in matching the image to its ground-truth caption "closed cabinet". The failing reason could be that an "open door" appears in the image, which guides the model to trust that "open" is matching to the image. Though multimodal counterfactual samples improve the model's understanding of concepts, VL models still suffer from the problems of "bags of objects" in images and texts. It is worthy of investigating in improving concepts understanding and compositional reasoning of VL models. + +# 5 Conclusions + +We have presented a data-and-algorithm driven technique for enhancing the performance of VL models to understand beyond "bag-of-objects" and reason about compositional concepts including attributes, relations, and word order. Our proposed contrastive learning framework with multimodal counterfactuals attains significant gains over five strong VL models on two benchmark datasets. It builds upon the modeling strength and knowledge of nowadays language models and diffusion models by injecting concepts to VL models, suggesting generalizations to future VL models. We demonstrated the necessity of both counterfactual texts and counterfactual images. We also show the necessity of effective learning with guided-and-weighted contrastive loss. Extensive ablation and case study help understand the working of the proposed approach as well its limitations, suggesting the future work of investigating other factors on improving compositional reasoning. + +# Acknowledgements + +This work is supported by National Natural Science Foundation of China (No. 62306220). + +# References + +1. Antol, S., Agrawal, A., Lu, J., Mitchell, M., Batra, D., Zitnick, C.L., Parikh, D.: Vqa: Visual question answering. In: Proceedings of the IEEE international conference on computer vision. pp. 2425-2433 (2015) +2. Basu, A., Addepalli, S., Babu, R.V.: Rmlvqa: A margin loss approach for visual question answering with language biases. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11671-11680 (June 2023) +3. Cascante-Bonilla, P., Shehada, K., Smith, J.S., Doveh, S., Kim, D., Panda, R., Varol, G., Oliva, A., Ordonez, V., Feris, R., et al.: Going beyond nouns with vision & language models using synthetic data. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 20155-20165 (2023) +4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020) +5. Chen, Y., Yuan, J., Tian, Y., Geng, S., Li, X., Zhou, D., Metaxas, D.N., Yang, H.: Revisiting multimodal representation in contrastive learning: from patch and token embeddings to finite discrete tokens. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15095-15104 (2023) +6. Chen, Y., Ma, Z., Zhang, Z., Qi, Z., Yuan, C., Shan, Y., Li, B., Hu, W., Qie, X., Wu, J.: Vilem: Visual-language error modeling for image-text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11018-11027 (June 2023) +7. Chuang, C.Y., Robinson, J., Lin, Y.C., Torralba, A., Jegelka, S.: Debiased contrastive learning. Advances in neural information processing systems 33, 8765-8775 (2020) +8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics. pp. 4171-4186 (2019) +9. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative unsupervised feature learning with convolutional neural networks. Advances in neural information processing systems 27 (2014) +10. Doveh, S., Arbelle, A., Harary, S., Alfassy, A., Herzig, R., Kim, D., Giryes, R., Feris, R., Panda, R., Ullman, S., et al.: Dense and aligned captions (dac) promote compositional reasoning in vl models. NeurIPS (2023) +1. Doveh, S., Arbelle, A., Harary, S., Schwartz, E., Herzig, R., Giryes, R., Feris, R., Panda, R., Ullman, S., Karlinsky, L.: Teaching structured vision & language concepts to vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2657-2668 (2023) +2. Geirhos, R., Jacobsen, J.H., Michaelis, C., Zemel, R., Brendel, W., Bethge, M., Wichmann, F.A.: Shortcut learning in deep neural networks. Nature Machine Intelligence 2(11), 665-673 (2020) +3. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022) +4. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality reduction by learning an invariant mapping. In: 2006 IEEE computer society conference on computer vision and pattern recognition (CVPR'06). vol. 2, pp. 1735-1742. IEEE (2006) + +15. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., QI, X.: Is synthetic data from generative models ready for image recognition? In: The Eleventh International Conference on Learning Representations (2022) +16. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021) +17. Kalantidis, Y., Sariyildiz, M.B., Pion, N., Weinzaepfel, P., Larlus, D.: Hard negative mixing for contrastive learning. Advances in Neural Information Processing Systems 33, 21798-21809 (2020) +18. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. Advances in neural information processing systems 33, 18661-18673 (2020) +19. Krishna, R., Zhu, Y., Groth, O., Johnson, J., Hata, K., Kravitz, J., Chen, S., Kalantidis, Y., Li, L.J., Shamma, D.A., et al.: Visual genome: Connecting language and vision using crowdsourced dense image annotations. International journal of computer vision 123, 32-73 (2017) +20. Le, T., Lal, V., Howard, P.: Coco-counterfactuals: Automatically constructed counterfactual examples for image-text pairs. arXiv preprint arXiv:2309.14356 (2023) +21. Li, C., Liu, H., Li, L., Zhang, P., Aneja, J., Yang, J., Jin, P., Hu, H., Liu, Z., Lee, Y.J., et al.: Elevater: A benchmark and toolkit for evaluating language-augmented visual models. Advances in Neural Information Processing Systems 35, 9287-9301 (2022) +22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. ICML (2023) +23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022) +24. Li, Y.L., Xu, L., Liu, X., Huang, X., Xu, Y., Chen, M., Ma, Z., Wang, S., Fang, H.S., Lu, C.: Hake: Human activity knowledge engine. arXiv preprint arXiv:1904.06539 (2019) +25. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014) +26. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM 38(11), 39-41 (1995) +27. Moltisanti, D., Keller, F., Bilen, H., Sevilla-Lara, L.: Learning action changes by measuring verb-adverb textual relationships. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 23110-23118 (June 2023) +28. Momeni, L., Caron, M., Nagrani, A., Zisserman, A., Schmid, C.: Verbs in action: Improving verb understanding in video-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15579-15591 (2023) +29. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018) +30. Pham, K., Kafle, K., Lin, Z., Ding, Z., Cohen, S., Tran, Q., Shrivastava, A.: Learning to predict visual attributes in the wild. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13018-13028 (2021) +31. Pratt, S., Yatskar, M., Weihs, L., Farhadi, A., Kembhavi, A.: Grounded situation recognition. In: European Conference on Computer Vision. pp. 314-332 (2020) + +32. Radenovic, F., Dubey, A., Kadian, A., Mihaylov, T., Vandenhende, S., Patel, Y., Wen, Y., Ramanathan, V., Mahajan, D.: Filtering, distillation, and hard negatives for vision-language pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6967-6977 (2023) +33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (18-24 Jul 2021) +34. Robinson, J.D., Chuang, C.Y., Sra, S., Jegelka, S.: Contrastive learning with hard negative samples. In: International Conference on Learning Representations (2020) +35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) +36. Roth, K., Kim, J.M., Koepke, A.S., Vinyals, O., Schmid, C., Akata, Z.: Waffling around for performance: Visual classification with random words and broad concepts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15746-15757 (October 2023) +37. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021) +38. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023) +39. Shi, H., Mao, J., Xiao, T., Jiang, Y., Sun, J.: Learning visually-grounded semantics from contrastive adversarial samples. In: Proceedings of the 27th International Conference on Computational Linguistics. pp. 3715-3727 (2018) +40. Smith, J.S., Cascante-Bonilla, P., Arbelle, A., Kim, D., Panda, R., Cox, D., Yang, D., Kira, Z., Feris, R., Karlinsky, L.: Construct-vl: Data-free continual structured vl concepts learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14994-15004 (2023) +41. Thrush, T., Jiang, R., Bartolo, M., Singh, A., Williams, A., Kiela, D., Ross, C.: Winoground: Probing vision and language models for visio-linguistic compositionality. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5238-5248 (2022) +42. Tian, Y., Sun, C., Poole, B., Krishnan, D., Schmid, C., Isola, P.: What makes for good views for contrastive learning? Advances in neural information processing systems 33, 6827-6839 (2020) +43. Trabucco, B., Doherty, K., Gurinas, M., Salakhutdinov, R.: Effective data augmentation with diffusion models. In: ICLR 2023 Workshop on Mathematical and Empirical Understanding of Foundation Models (2023) +44. Wang, W., Yang, Z., Xu, B., Li, J., Sun, Y.: Vilt: Enhancing vision-language pre-training through textual augmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3158-3169 (2023) +45. Wang, Z., Gao, Z., Guo, K., Yang, Y., Wang, X., Shen, H.T.: Multilateral semantic relations modeling for image text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 2830-2839 (June 2023) +46. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical + +Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019) +47. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019) +48. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15943-15953 (October 2023) +49. Wu, H., Mao, J., Zhang, Y., Jiang, Y., Li, L., Sun, W., Ma, W.Y.: Unified visual-semantic embeddings: Bridging vision and language with structured meaning representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6609-6618 (2019) +50. Wu, Y., Wei, Y., Wang, H., Liu, Y., Yang, S., He, X.: Grounded image text matching with mismatched relation reasoning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2976-2987 (2023) +51. Xie, C.W., Sun, S., Xiong, X., Zheng, Y., Zhao, D., Zhou, J.: Ra-clip: Retrieval augmented contrastive language-image pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19265-19274 (June 2023) +52. Yang, J., Duan, J., Tran, S., Xu, Y., Chanda, S., Chen, L., Zeng, B., Chilimbi, T., Huang, J.: Vision-language pre-training with triple contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15671-15680 (2022) +53. Yang, K., Deng, J., An, X., Li, J., Feng, Z., Guo, J., Yang, J., Liu, T.: Alip: Adaptive language-image pre-training with synthetic caption. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2922-2931 (October 2023) +54. Yuksekgonul, M., Bianchi, F., Kalluri, P., Jurafsky, D., Zou, J.: When and why vision-language models behave like bags-of-words, and what to do about it? In: The Eleventh International Conference on Learning Representations (2022) +55. Zhang, X., Zhang, F., Xu, C.: Vqacl: A novel visual question answering continual learning setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19102-19112 (June 2023) +56. Zhang, X., Zhao, J., LeCun, Y.: Character-level convolutional networks for text classification. Advances in neural information processing systems 28 (2015) +57. Zhao, T., Zhang, T., Zhu, M., Shen, H., Lee, K., Lu, X., Yin, J.: Vl-checklist: Evaluating pre-trained vision-language models with objects, attributes and relations. arXiv preprint arXiv:2207.00221 (2022) +58. Zhen, L., Hu, P., Wang, X., Peng, D.: Deep supervised cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10394-10403 (2019) +59. Zhong, Y., Yang, J., Zhang, P., Li, C., Codella, N., Li, L.H., Zhou, L., Dai, X., Yuan, L., Li, Y., et al.: Regionclip: Region-based language-image pretraining. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16793-16803 (2022) +60. Zhong, Z., Zheng, L., Kang, G., Li, S., Yang, Y.: Random erasing data augmentation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 13001-13008 (2020) \ No newline at end of file diff --git a/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/images.zip b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..ada8a0c7344570a45cb2299a3beb7207e8b610be --- /dev/null +++ b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d81035f94b907f182ca5cf12ae97e1db2df815b77e676f47fe7e8212b76ba17e +size 388008 diff --git a/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/layout.json b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..92b25cf45222c386d35374ea5ee09c41aa3ccd50 --- /dev/null +++ b/2024/Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples/layout.json @@ -0,0 +1,8354 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 140, + 111, + 474, + 165 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 111, + 474, + 165 + ], + "spans": [ + { + "bbox": [ + 140, + 111, + 474, + 165 + ], + "type": "text", + "content": "Improving Vision and Language Concepts Understanding with Multimodal Counterfactual Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 171, + 186, + 441, + 199 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 171, + 186, + 441, + 199 + ], + "spans": [ + { + "bbox": [ + 171, + 186, + 441, + 199 + ], + "type": "text", + "content": "Chengen Lai, Shengli Song*, Sitong Yan, and Guangneng Hu" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 149, + 208, + 463, + 232 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 208, + 463, + 232 + ], + "spans": [ + { + "bbox": [ + 149, + 208, + 463, + 232 + ], + "type": "text", + "content": "School of Computer Science and Technology, Xidian University, Xi'an, China {laice, styan}@stu.xidian.edu.cn, shlsong@xidian.edu.cn, njuhgn@gmail.com" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 255, + 452, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 255, + 452, + 464 + ], + "spans": [ + { + "bbox": [ + 160, + 255, + 452, + 464 + ], + "type": "text", + "content": "Abstract. Vision and Language (VL) models have achieved remarkable performance in a variety of multimodal learning tasks. The success of these models is attributed to learning a joint and aligned representation space of visual and text. However, recent popular VL models still struggle with concepts understanding beyond bag-of-objects in images & texts, suffering from compositional reasoning about relationship between objects & attributes and word order. To address the above issues, we create a synthetic multimodal counterfactual dataset (COCO-CF) and propose a novel contrastive learning framework (COMO). We contribute the COCO-CF dataset which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and diffusion models to reduce the bias of bag-of-objects. We contribute the COMO framework for effectively leveraging COCO-CF to treat the counterfactual samples as hard negatives and reweight their importance during contrastive learning. Extensive experiments and ablations show COMO achieved a significant improvement of VL concept understanding on the two VL-Checklist and Winoground benchmarks over five strong VL baselines in their zero-shot setting evaluations. Dataset is available at https://github.com/laichengen/COMO." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 474, + 457, + 497 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 474, + 457, + 497 + ], + "spans": [ + { + "bbox": [ + 160, + 474, + 457, + 497 + ], + "type": "text", + "content": "Keywords: Concepts Understanding " + }, + { + "bbox": [ + 160, + 474, + 457, + 497 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 474, + 457, + 497 + ], + "type": "text", + "content": " Contrastive learning " + }, + { + "bbox": [ + 160, + 474, + 457, + 497 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 474, + 457, + 497 + ], + "type": "text", + "content": " Multimodal Counterfactual Samples" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 516, + 230, + 529 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 516, + 230, + 529 + ], + "spans": [ + { + "bbox": [ + 133, + 516, + 230, + 529 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 539, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 539, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 539, + 482, + 647 + ], + "type": "text", + "content": "Vision and Language (VL) models have recently achieved impressive performance in various challenging multimodal learning tasks, including image-text retrieval [6, 45, 58], visual question answering [1, 2, 55], and captioning [22, 53], thanks to the availability of large paired image-text corpora [25, 37]. These cross-modal tasks are heavily dependent on joint representations of multi-modalities which are typically learned by building interactions between vision and language features [10, 32, 33, 59]. The goal is to learn an effective aligning representation spaces of images and text, typically under a contrastive learning framework [4, 5, 52]." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 134, + 653, + 234, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 653, + 234, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 653, + 234, + 665 + ], + "type": "text", + "content": "* Corresponding author" + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 114, + 449, + 235 + ], + "blocks": [ + { + "bbox": [ + 149, + 114, + 449, + 235 + ], + "lines": [ + { + "bbox": [ + 149, + 114, + 449, + 235 + ], + "spans": [ + { + "bbox": [ + 149, + 114, + 449, + 235 + ], + "type": "image", + "image_path": "c7a1caffe80459c295d0a7c6be09ffb3b57c0716136f43b98a6c62dbe3335477.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 241, + 482, + 330 + ], + "lines": [ + { + "bbox": [ + 130, + 241, + 482, + 330 + ], + "spans": [ + { + "bbox": [ + 130, + 241, + 482, + 330 + ], + "type": "text", + "content": "Fig. 1: Overview of our proposed multimodal counterfactual generation. (a) Standard contrastive text-to-image loss (e.g. CLIP [33]) is easy to solve \"bag-of-objects\"; (b) Contrastive learning with textual counterfactuals (e.g. SVLC [11])) teaches VL models by contrasting between counterfactual texts and original image. (c) Our proposed contrastive learning with multimodal counterfactuals (COMO) generate both textual and visual counterfactuals to improve the VL models' concept understanding by contrasting between counterfactual image (and text) and original text (and image), and matching the counterfactual image with counterfactual text." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 355, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 355, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 355, + 482, + 499 + ], + "type": "text", + "content": "Despite these great advances on various vision and language tasks, they often exploit spurious correlations in datasets as shortcuts during training to fit the dataset [11, 12, 40]. Recent works have found popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks: the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54, 57]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects (see Figure 1(a))." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 499, + 482, + 643 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 499, + 482, + 643 + ], + "spans": [ + { + "bbox": [ + 130, + 499, + 482, + 643 + ], + "type": "text", + "content": "In this paper, we propose a novel COntrastive learning framework with Multimodal cCounterfactuals (COMO) to improve the VL model's concepts understanding and compositional reasoning. We propose a way of leveraging the existing VL pre-training source to improve concepts understanding without any expensive and time-consuming human annotations on object attributes, relations, and states. The idea is to automatically generate a synthetic dataset by injecting counterfactual concepts from powerful pre-trained language and text-to-image stable diffusion [35]. On top of the recently proposed text augmentation [3, 11, 44] (see Figure 1(b)), we go deeper to study the effects of multimodal augmentation—i.e., generating both text counterfactual and image counterfactual examples—on the compositional reasoning performance of VL models trained on such synthetic multimodal counterfactual dataset (see Figure 1(c))." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 204, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 204, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 204, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 364, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 364, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 364, + 665 + ], + "type": "text", + "content": "0 https://huggingface.co/CompVis/stable-diffusion-v1-4" + } + ] + } + ], + "index": 6 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "We empirically find that both text counterfactual and image counterfactual contribute to the improved concepts understanding, demonstrating the necessity of multimodal augmentation." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 480, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 480, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 480, + 319 + ], + "type": "text", + "content": "Our multimodal counterfactual generation not only substitutes the concept in the text by exploiting pretrained masked language models, but also synthesizes the corresponding image by exploiting text-to-image stable diffusion. Compared to textual counterfactual generation, our multimodal counterfactual samples match the counterfactual text and image together, to learn out-of-domain concepts and alleviate the data scarcity in multimodal learning task. The generated multimodal counterfactual dataset improves the quality of image-caption alignment and reduces the bias of bag-of-objects. To effectively enforce the VL model to distinguish between original concepts and substituted concepts, we treat the counterfactual samples as hard negatives by modifying the traditional contrastive loss to dynamically reweigh their importance. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 320, + 355, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 320, + 355, + 331 + ], + "spans": [ + { + "bbox": [ + 146, + 320, + 355, + 331 + ], + "type": "text", + "content": "Our main contributions can be summarized as:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 342, + 480, + 510 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 342, + 479, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 342, + 479, + 390 + ], + "spans": [ + { + "bbox": [ + 138, + 342, + 479, + 390 + ], + "type": "text", + "content": "- We contribute a multimodal counterfactual dataset (COCO-CF) which is automatically generated from MS-COCO by injecting concepts from off-the-shelf language models and stable diffusion to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 392, + 480, + 438 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 392, + 480, + 438 + ], + "spans": [ + { + "bbox": [ + 138, + 392, + 480, + 438 + ], + "type": "text", + "content": "- We propose a novel contrastive framework (COMO) for effectively leveraging COCO-CF to treat the multimodal counterfactual samples as hard negatives and reweight their importance during contrastive learning to enforce the VL model differentiating the original concepts from substituted ones." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 440, + 480, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 440, + 480, + 510 + ], + "spans": [ + { + "bbox": [ + 138, + 440, + 480, + 510 + ], + "type": "text", + "content": "- We demonstrate the compositional reasoning performance of COMO on the two VL-Checklist and Winoground benchmarks with " + }, + { + "bbox": [ + 138, + 440, + 480, + 510 + ], + "type": "inline_equation", + "content": "3.17\\%" + }, + { + "bbox": [ + 138, + 440, + 480, + 510 + ], + "type": "text", + "content": " (on VL-Checklist's attribute) and " + }, + { + "bbox": [ + 138, + 440, + 480, + 510 + ], + "type": "inline_equation", + "content": "4.35\\%" + }, + { + "bbox": [ + 138, + 440, + 480, + 510 + ], + "type": "text", + "content": " (on Winoground's image) improvement over the current SOTA models, respectively. We also perform detailed ablation on the importance of counterfactual text, counterfactual image, and the new contrastive loss." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 531, + 237, + 544 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 557, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 557, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 557, + 479, + 665 + ], + "type": "text", + "content": "Vision and Language Models Pretrained VL models [16, 23, 32] have made impressive performance in various zero-shot downstream tasks, such as image-text retrieval [58]. However, recent research [3, 11, 57] show that existing VL models often exploit spurious correlations between non-causal features as shortcuts during training to fit the dataset [12, 54] and still struggle with vision and language concepts understanding. Popular VL models have difficulty in understanding structured concepts beyond bag-of-objects such as object attributes, inter-object relations, and word order in the sentence [27, 28, 49]. As a result, these models are vulnerable to text-domain or image-domain adversarial attacks:" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "the model can be easily deceived by counterfactual captions constructed from original captions by adding small perturbations [41, 54]. For example, large VL models such as CLIP [33] and CyCLIP [13] get confused by these counterfactual captions and fail to distinguish the difference between factual and counterfactual concepts, suffering from compositional reasoning beyond bag-of-objects. In this paper, we propose a data-driven technique to improve concepts understanding for typical VL models." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 201, + 482, + 392 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 201, + 482, + 392 + ], + "spans": [ + { + "bbox": [ + 130, + 201, + 482, + 392 + ], + "type": "text", + "content": "Counterfactual Samples Generation Counterfactual samples are widely used in various computer vision and natural language processing tasks [46, 60]. Counterfactual texts have been shown to improve the robustness of models through random word substitution [36, 47] and swap [54, 56]. Counterfactual captions are generated by rule-based [11, 36, 39] or pretrained language models [11, 44, 51] to enhance semantic coherence and ground the mismatched words [50]. Diffusion models [15] are exploited to generate text-image pairs [38, 43, 48]. Synthetic videos and corresponding text captions are generated by using 3D graphic engines [3]. A counterfactual dataset created by substituting nouns only, ignoring the \"beyond nouns\" concepts [20]. In contrast, we create a multimodal counterfactual dataset (COCO-CF) which is automatically generated from existing VL pre-training source (i.e., MS-COCO) by injecting concepts from off-the-shelf language models and stable diffusion. COCO-CF can be used to improve the VL model's concept understanding beyond bag-of-objects and compositional reasoning without any expensive and time-consuming human annotations on object attributes, relations, and states." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 393, + 482, + 525 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 393, + 482, + 525 + ], + "spans": [ + { + "bbox": [ + 130, + 393, + 482, + 525 + ], + "type": "text", + "content": "Hard-Negative Contrastive Learning (CL) [14] is exploited to learn aligned representations of text and image in most VL models [9, 18, 42]. Recently, some studies have investigated the selection of hard negative examples [17, 44] and accounted for the importance of different negative samples [7, 32, 34]. We extend the hard negative loss to vision-language concepts understanding by treating the counterfactual samples as hard negatives by modifying the traditional contrastive loss. This new contrastive loss pushes the concept representation of counterfactual samples (which are very similar to the factual samples) far away from their corresponding factual samples, so as to improve the compositional reasoning about object relation, attributes, state, and word order in texts." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 550, + 201, + 562 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 550, + 201, + 562 + ], + "spans": [ + { + "bbox": [ + 132, + 550, + 201, + 562 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "In this section, our COntrastive framework with Multimodal cCounterfactual examples (COMO) are presented for improving the VL model's understanding of concepts and enhancing robustness of VL models. As shown in Figure 2, COMO consists of an effective way of generating the multimodal counterfactual text and image samples (see Figure 2(a-b)), and a novel loss of counterfactual guided and weighted contrastive learning (see Figure 2(c)). In the following, we firstly describe the counterfactual text and image samples generation in Section 3.1." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 162, + 128, + 449, + 178 + ], + "blocks": [ + { + "bbox": [ + 162, + 128, + 449, + 178 + ], + "lines": [ + { + "bbox": [ + 162, + 128, + 449, + 178 + ], + "spans": [ + { + "bbox": [ + 162, + 128, + 449, + 178 + ], + "type": "image", + "image_path": "3ffea7e6f2ffab9c7fadab034aac63960c6c41f7ec21f8cad9f67c0d25636140.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 164, + 178, + 449, + 228 + ], + "blocks": [ + { + "bbox": [ + 164, + 178, + 449, + 228 + ], + "lines": [ + { + "bbox": [ + 164, + 178, + 449, + 228 + ], + "spans": [ + { + "bbox": [ + 164, + 178, + 449, + 228 + ], + "type": "image", + "image_path": "69e51accfcae2108caddbee4c5f19d409afc40fb2231f906bccff69c65043218.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 164, + 228, + 449, + 323 + ], + "blocks": [ + { + "bbox": [ + 164, + 228, + 449, + 323 + ], + "lines": [ + { + "bbox": [ + 164, + 228, + 449, + 323 + ], + "spans": [ + { + "bbox": [ + 164, + 228, + 449, + 323 + ], + "type": "image", + "image_path": "7f342fd48658e785b2fb9524bfed9e3a6ed7f6edb3e99773cf7ca341c056f5e2.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 344, + 482, + 422 + ], + "lines": [ + { + "bbox": [ + 130, + 344, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 482, + 422 + ], + "type": "text", + "content": "Fig. 2: The proposed contrastive learning framework with multimodal counterfactual samples (COMO). (a) Generating counterfactual text uses masked language models such as BERT1. (b) Generating counterfactual image uses text-to-image diffusion models2. (c) Counterfactual guided and weighted hard negative contrastive learning. This module feeds the generated counterfactual text and image into the same mini-batch and exploits a hard negative loss to improve the VL models' concept understanding. The longer the red arrow, the further it pushes away." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 446, + 482, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 446, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 130, + 446, + 482, + 471 + ], + "type": "text", + "content": "Then, we introduce the counterfactual guided and weighted contrastive loss in Section 3.2, respectively." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 491, + 371, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 491, + 371, + 502 + ], + "spans": [ + { + "bbox": [ + 131, + 491, + 371, + 502 + ], + "type": "text", + "content": "3.1 Generation of Multimodal Counterfactual" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "spans": [ + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "text", + "content": "Recent works [11, 49] have shown the effectiveness of injecting concepts to VL models by textual-modality augmentation. Compared to these works, we improve the VL models' concepts understanding by automatically constructing both textual and visual counterfactual examples in a way of multimodal augmentation. Counterfactual Text Generation To improve the clear understanding of VL models on concepts beyond bag-of-objects and rather than spurious correlated features, we manipulate the original caption " + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "inline_equation", + "content": "T^o" + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "text", + "content": " to construct its corresponding counterfactual caption " + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "text", + "content": " with subtle but completely different semantics. Counterfactual text " + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "text", + "content": " is generated by replacing a concept in " + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "inline_equation", + "content": "T^o" + }, + { + "bbox": [ + 130, + 513, + 482, + 646 + ], + "type": "text", + "content": ", while most of its original details remain the same. In this way, the generated counterfactual caption represents the changed causal concept while remaining preserved" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 313, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 313, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 313, + 665 + ], + "type": "text", + "content": "1 https://huggingface.co/bert-base-uncased" + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "details from the original caption can be viewed as potentially spurious correlated features." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 307 + ], + "type": "text", + "content": "Large or pre-trained language models [8] are capable of suggesting multiple words that fit the context given a sentence with one missing word. We can automatically create a plausible negative sentence which is difficult for VL models to distinguish from its corresponding actual caption by randomly selecting a masked word. Such masked word should be useful for compositional reasoning about objects relation, attributes, and states. This can be achieved by NLP parsing technique to identify all objects (nouns), relations (verbs and adverb), and attributes (adjectives) in the original caption sentence. In specific, we randomly choose a word among these concepts, replace the selected concept in " + }, + { + "bbox": [ + 130, + 140, + 482, + 307 + ], + "type": "inline_equation", + "content": "T^o" + }, + { + "bbox": [ + 130, + 140, + 482, + 307 + ], + "type": "text", + "content": " with the [MASK] token, and then retrieve the most probable replacements by the language models unmasking as our generated counterfactual caption " + }, + { + "bbox": [ + 130, + 140, + 482, + 307 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 140, + 482, + 307 + ], + "type": "text", + "content": " (see Figure 2(a)). These counterfactual/negative examples enforce the VL model focusing on the important details that affect the concepts understanding and compositional reasoning." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": "Counterfactual Image Generation After creating a counterfactual caption " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": ", the VL models can understand the original text-image pair " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "(T^o, V^o)" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " but have no idea of what the corresponding image of counterfactual caption " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " looks like. Therefore, we explicitly generate a corresponding counterfactual image " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "V^c" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " by feeding the counterfactual caption " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " into stable diffusion models (see Figure 2(b)). To control the quality of generated images and enable the changed concept (causal concept) to be learned in the presence of unchanged concepts (spurious concepts) between " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "T^o" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": ", we firstly generate multiple images " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "\\{V_{ij}\\}_{i=1}^{n}" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": ". Then we choose the counterfactual image " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "V^c" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " which has the highest similarity score with both the counterfactual caption " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " and the original image " + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "inline_equation", + "content": "V^o" + }, + { + "bbox": [ + 130, + 308, + 482, + 439 + ], + "type": "text", + "content": " by:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 209, + 451, + 480, + 464 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 209, + 451, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 209, + 451, + 480, + 464 + ], + "type": "interline_equation", + "content": "\\operatorname {s c o r e} _ {i} = \\varepsilon_ {T} \\left(T ^ {c}\\right) \\cdot \\varepsilon_ {V} \\left(V _ {i}\\right) + \\varepsilon_ {V} \\left(V ^ {o}\\right) \\cdot \\varepsilon_ {V} \\left(V _ {i}\\right) \\tag {1}", + "image_path": "7a2a7f4759c0862201bf296a4e7c19bc729115f07ce9b3c0674fde039f98923e.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "spans": [ + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "inline_equation", + "content": "\\varepsilon_T(\\cdot)" + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "inline_equation", + "content": "\\varepsilon_V(\\cdot)" + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "text", + "content": " are text and image encoders in " + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "inline_equation", + "content": "\\mathrm{CLIP}^3" + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "text", + "content": ", respectively. The first part of the score measures the consistency between the generated image and counterfactual caption " + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "inline_equation", + "content": "T^c" + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "text", + "content": ", and the second part measures the similarity between the generated image and the original image " + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "inline_equation", + "content": "V^o" + }, + { + "bbox": [ + 130, + 467, + 482, + 515 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 530, + 459, + 544 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 530, + 459, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 530, + 459, + 544 + ], + "type": "text", + "content": "3.2 Counterfactual Guided and Weighted Contrastive Learning" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "spans": [ + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "type": "text", + "content": "Contrastive learning [29] is an effective approach for multimodal alignment, which pulls the positive pairs to anchor nearby locations, while pushes negative pairs further away. A dual-encoder VL model like CLIP [33] admits text-image pair " + }, + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "type": "inline_equation", + "content": "(T,V)" + }, + { + "bbox": [ + 130, + 548, + 482, + 597 + ], + "type": "text", + "content": " and computes their similarity score by:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 258, + 607, + 480, + 622 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 607, + 480, + 622 + ], + "spans": [ + { + "bbox": [ + 258, + 607, + 480, + 622 + ], + "type": "interline_equation", + "content": "S (T, V) = \\exp (\\boldsymbol {t} ^ {\\top} \\boldsymbol {v} / \\tau) \\tag {2}", + "image_path": "e9b9fa3c0f5e4f3647821796421ad6d20d9ec3e39de67187688159cf1fcd6b8a.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "spans": [ + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "inline_equation", + "content": "\\pmb{t} = \\varepsilon_T(T)" + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "inline_equation", + "content": "\\pmb{v} = \\varepsilon_V(V)" + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "text", + "content": " are the encoded features of the image-text pair respectively. Temperature " + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "inline_equation", + "content": "\\tau > 0" + }, + { + "bbox": [ + 130, + 624, + 481, + 648 + ], + "type": "text", + "content": " is learnable." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 652, + 349, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 652, + 349, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 652, + 349, + 666 + ], + "type": "text", + "content": "3 https://openaipublic.azureedge.net/clip/ViT-B-32" + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 187 + ], + "type": "text", + "content": "Counterfactual Guided Contrastive Learning The naive contrastive learning with uniform sampling from large-scale datasets can often provide negative samples that are not necessarily discriminative. In our counterfactual guided contrastive learning, we feed the original example with its corresponding counterfactual example into the same mini-batch so as to enforce the VL model differentiates the original concept from substituted concept (see Figure 2(c))." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 188, + 479, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 188, + 479, + 212 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 479, + 212 + ], + "type": "text", + "content": "Given a mini-batch " + }, + { + "bbox": [ + 130, + 188, + 479, + 212 + ], + "type": "inline_equation", + "content": "\\mathcal{B} = \\{(T_i,V_i)\\}_{i = 1}^n" + }, + { + "bbox": [ + 130, + 188, + 479, + 212 + ], + "type": "text", + "content": " of containing the factual and its counterfactual image-caption pairs, the contrastive CLIP-loss [29] is defined as:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 182, + 221, + 481, + 249 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 182, + 221, + 481, + 249 + ], + "spans": [ + { + "bbox": [ + 182, + 221, + 481, + 249 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\mathrm {H N}} = - \\sum_ {i = 1} ^ {n} \\left[ \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{\\sum_ {j} S \\left(T _ {i} , V _ {j}\\right)} + \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{\\sum_ {j} S \\left(T _ {j} , V _ {i}\\right)} \\right] \\tag {3}", + "image_path": "8da6640f7cae5bfd3791f0991a2ea7c5a98a3001b7b0f33d37812b82d4bdafbe.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 251, + 479, + 288 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 479, + 288 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 479, + 288 + ], + "type": "text", + "content": "The hard negative for factual image-caption " + }, + { + "bbox": [ + 130, + 251, + 479, + 288 + ], + "type": "inline_equation", + "content": "(T^o, V^o)" + }, + { + "bbox": [ + 130, + 251, + 479, + 288 + ], + "type": "text", + "content": " (causal concept) is its corresponding counterfactual image-caption " + }, + { + "bbox": [ + 130, + 251, + 479, + 288 + ], + "type": "inline_equation", + "content": "(T^c, V^c)" + }, + { + "bbox": [ + 130, + 251, + 479, + 288 + ], + "type": "text", + "content": " (spurious concept), which needs to be pushed far away (see Figure 2(c))." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 289, + 480, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 289, + 480, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 289, + 480, + 348 + ], + "type": "text", + "content": "Counterfactual Weighted Contrastive Learning To emphasize hard negative pairs (i.e., between the factual example and its corresponding counterfactual example) and push the embedding of counterfactual sample (which is close to the factual example) far away from the anchor, we modify the un-weighted contrastive loss in Eq.3 as the weighted version in the following:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 186, + 357, + 480, + 414 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 186, + 357, + 480, + 414 + ], + "spans": [ + { + "bbox": [ + 186, + 357, + 480, + 414 + ], + "type": "interline_equation", + "content": "\\begin{array}{l} \\mathcal {L} _ {\\mathrm {H N W}} = - \\sum_ {i = 1} ^ {n} \\left[ \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{S \\left(T _ {i} , V _ {i}\\right) + \\sum_ {j \\neq i} \\boldsymbol {\\alpha} _ {i j} \\cdot S \\left(T _ {i} , V _ {j}\\right)} \\right. \\tag {4} \\\\ \\left. + \\log \\frac {S \\left(T _ {i} , V _ {i}\\right)}{S \\left(T _ {i} , V _ {i}\\right) + \\sum_ {j \\neq i} \\boldsymbol {\\beta} _ {j i} \\cdot S \\left(T _ {j} , V _ {i}\\right)} \\right] \\\\ \\end{array}", + "image_path": "7c6b234263917a79a0b85f1947e733cc6711ee736d804aaa957d0ecd1ef7c195.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 146, + 417, + 307, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 417, + 307, + 429 + ], + "spans": [ + { + "bbox": [ + 146, + 417, + 307, + 429 + ], + "type": "text", + "content": "where the weights are computed by:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 197, + 437, + 480, + 464 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 437, + 480, + 464 + ], + "spans": [ + { + "bbox": [ + 197, + 437, + 480, + 464 + ], + "type": "interline_equation", + "content": "\\boldsymbol {\\alpha} _ {i j} = \\frac {(n - 1) \\cdot S \\left(T _ {i} , V _ {j}\\right)}{\\sum_ {k \\neq i} S \\left(T _ {i} , V _ {k}\\right)} \\quad \\beta_ {j i} = \\frac {(n - 1) \\cdot S \\left(T _ {j} , V _ {i}\\right)}{\\sum_ {k \\neq i} S \\left(T _ {k} , V _ {i}\\right)} \\tag {5}", + "image_path": "e892ccc42d3926d2c6923d810f72f9d822b7687b24edb90063b2eb752c2892c8.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 472, + 479, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 479, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 479, + 567 + ], + "type": "text", + "content": "Weights " + }, + { + "bbox": [ + 130, + 472, + 479, + 567 + ], + "type": "inline_equation", + "content": "\\alpha_{ij}" + }, + { + "bbox": [ + 130, + 472, + 479, + 567 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 472, + 479, + 567 + ], + "type": "inline_equation", + "content": "\\beta_{ij}" + }, + { + "bbox": [ + 130, + 472, + 479, + 567 + ], + "type": "text", + "content": " are designed that difficult negative pairs (e.g., between original examples and corresponding counterfactual examples) are emphasized, and easier pairs (e.g., between original examples and other \"bag-of-objects\" examples) are ignored. So, the VL model can more easily understand the concepts beyond objects and improve the compositional reasoning about relation, attribute, and word order. Observe that we get contrastive objective of Eq.3 when setting weights to be all ones. The form of weights is an unnormalized von Mises-Fisher distribution [32]." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 586, + 230, + 600 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 586, + 230, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 586, + 230, + 600 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 610, + 204, + 621 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 204, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 204, + 621 + ], + "type": "text", + "content": "4.1 Datasets" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 479, + 666 + ], + "type": "text", + "content": "To test the effectiveness of our proposed COMO for improving VL models' vision language concepts understanding, we train the model using our counterfactual image-text pairs generated from MS-COCO [25]. We evaluate on the" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 196, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 196, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 196, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 200, + 147, + 410, + 184 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 479, + 136 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 479, + 136 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 479, + 136 + ], + "type": "text", + "content": "Table 1: The statistics of factual and counterfactual examples in the generated COCO-CF dataset." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 200, + 147, + 410, + 184 + ], + "lines": [ + { + "bbox": [ + 200, + 147, + 410, + 184 + ], + "spans": [ + { + "bbox": [ + 200, + 147, + 410, + 184 + ], + "type": "table", + "html": "
Factual\n# images # textCounterfactual\n# images # textTotal\n# images # text
COCO-CF113K 567K567K 567K680K 1,134K
", + "image_path": "33b7f601f78f84bf261ce56a256f9bea9153071a488fc357cabcd5cca0cc95d0.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 217, + 479, + 254 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 217, + 479, + 254 + ], + "spans": [ + { + "bbox": [ + 130, + 217, + 479, + 254 + ], + "type": "text", + "content": "VL-Checklist [57], Winoground [41] and Zero-Shot Classification [21] datasets over strong VL models. We introduce the training and testing datasets in detail below." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 260, + 480, + 355 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 260, + 480, + 355 + ], + "spans": [ + { + "bbox": [ + 130, + 260, + 480, + 355 + ], + "type": "text", + "content": "Training datasets. We start from MS-COCO [25] dataset as our factual samples, where an image has multiple corresponding captions. We automatically generate the counterfactual image-text pairs from COCO with our multimodal counterfactual generation pipeline (see Figure 2(a-b)). The augmented dataset is named as COCO-CF, meaning COCO counterfactual examples. As shown in Table 1, we obtain additional 567K counterfactual images and captions based on the original 113K images and 567K text. Finally, COCO-CF has total 680K images and 1,134K captions." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 361, + 479, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 361, + 479, + 384 + ], + "spans": [ + { + "bbox": [ + 131, + 361, + 479, + 384 + ], + "type": "text", + "content": "Evaluation datasets. We evaluate our models on VL-Checklist, Winoground and Zero-Shot classification datasets." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 390, + 480, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 480, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 480, + 510 + ], + "type": "text", + "content": "VL-Checklist [57] is a large-scale dataset comprised of Visual Genome [19], SwiG [31], VAW [30], and HAKE [24]. Each image is associated with two captions, a positive and a negative. The positive caption corresponds to the image and is taken from the source dataset. The negative caption is generated from the positive caption by changing one word only, so the resulting sentence no longer corresponds to the image. Depending on the word that was changed, VL-Checklist evaluates seven types of VL concepts divided into three categories: (i) Attributes (color, material, size, state, and action); (ii) Relations (spatial or action relation between two objects and/or humans); and (iii) Objects (spatial location and size)." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 516, + 480, + 624 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 516, + 480, + 624 + ], + "spans": [ + { + "bbox": [ + 130, + 516, + 480, + 624 + ], + "type": "text", + "content": "Winoground [41] is a dataset that evaluates the ability of VL models for compositional reasoning, specifically understanding the meaning of the sentence after changing the order of its words. An example comprises of two images and two texts. The texts have the same set of words but in a different order, each text corresponding to one image in the paired sample. The Winoground evaluation divide into three metrics: (i) image score - percent of samples where the model picks the correct image for each text; (ii) text score - percent of samples where the model picks the correct text for each image; (iii) group score - percent of samples where both text and image score conditions are satisfied jointly." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 629, + 479, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 479, + 664 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 479, + 664 + ], + "type": "text", + "content": "Zero-Shot Classification [21] is a dataset that includes 21 different classification datasets, we evaluate our model and report the average result over the dataset." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 134, + 146, + 476, + 256 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "type": "text", + "content": "Table 2: Performance comparison with strong VL baselines on the VL-Checklist, Winoground and 21 classification task datasets in zero-shot setting evaluation." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 134, + 146, + 476, + 256 + ], + "lines": [ + { + "bbox": [ + 134, + 146, + 476, + 256 + ], + "spans": [ + { + "bbox": [ + 134, + 146, + 476, + 256 + ], + "type": "table", + "html": "
ModelsFine-tuned Dataset SizeVL-ChecklistWinoground21-Zero-Shot Task
RelationAttributeObjectTextImageGroup
CLIP (Radford et al, 2021)None61.8067.3282.9130.5011.008.7556.37
CyCLIP (Goel et al, 2022)None61.1566.9680.8730.5010.759.0055.99
NegCLIP (Yuksekgonul et al, 2023)None63.5272.2381.3529.5010.508.00-
SyVic (Cascante-Bonilla et al, 2023)767K69.3970.3784.6230.0011.509.5054.77
SVLC (Doveh et al, 2023)3M69.6871.1884.7529.7511.009.0055.27
COMO (ours)1.1M71.1673.4486.2031.0012.009.7555.87
Improvement over best baseline-2.12%3.17%1.70%1.60%4.35%2.63%-0.89%
", + "image_path": "a884d9ebb2e47913b0c65b3acd0e344e2fc74ab60a1d06f0f68df5799a52ca6f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 279, + 276, + 290 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 279, + 276, + 290 + ], + "spans": [ + { + "bbox": [ + 132, + 279, + 276, + 290 + ], + "type": "text", + "content": "4.2 Implementation details" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 300, + 482, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 300, + 482, + 539 + ], + "spans": [ + { + "bbox": [ + 133, + 300, + 482, + 539 + ], + "type": "text", + "content": "For the multimodal counterfactual samples generation(Sec. 3.1), we use NLP spacy4 to parse the sentence into its components including nouns, verbs, adjectives, adverbs, etc. Then we utilize the popular BERT5 as the masked LMs to generate the counterfactual text. To ensure the words sampled from the LM are true negatives, we obtain the synonyms set of the original word from the WordNet [26], and generate n candidates from the language model. Then we filter out the candidates that belong in the original word's synonyms set and variants (i.e., plural and tense). Finally, we choose the one which has the highest score among the remaining candidates as our counterfactual text. After we generate the counterfactual captions, we use the text-to-image stable diffusion model6 to synthesize multiple images (size set to 10). For the model architecture, following [3,11], we utilize the original CLIP implementation that initialized with the checkpoints of VIT-B/327 released by the OpenAI. We modify the naive contrastive loss in their codebase to our counterfactual guided-and-weighted hard negative contrastive loss (see Eq.4). For the model training, we use Adam optimizer with a 1e-6 initial learning rate and a 1e-7 weight decay for finetuning, where the batch size is set to 16 and the training epochs to 5. We conduct all experiments on one NVIDIA GTX A100-PCIE-40GB GPUs with PyTorch 1.9.0. Our code and model checkpoints will be released upon acceptance together with the generated counterfactual examples COCO-CF dataset." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 557, + 227, + 567 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 557, + 227, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 557, + 227, + 567 + ], + "type": "text", + "content": "4.3 Main Results" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 578, + 480, + 613 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 480, + 613 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 480, + 613 + ], + "type": "text", + "content": "We compare our COMO method with five state-of-the-art methods on three benchmark datasets and the results are shown in Table 2, where the best results are in boldface. We have following observations." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 135, + 620, + 421, + 665 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 135, + 620, + 421, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 620, + 421, + 632 + ], + "spans": [ + { + "bbox": [ + 135, + 620, + 421, + 632 + ], + "type": "text", + "content": "4 https://github.com/explosion/spacy-models/en_core_web_trf-3.7.2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 136, + 632, + 312, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 632, + 312, + 643 + ], + "spans": [ + { + "bbox": [ + 136, + 632, + 312, + 643 + ], + "type": "text", + "content": "5 https://huggingface.co/bert-base-uncased" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 136, + 643, + 362, + 654 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 643, + 362, + 654 + ], + "spans": [ + { + "bbox": [ + 136, + 643, + 362, + 654 + ], + "type": "text", + "content": "6 https://huggingface.co/CompVis/stable-diffusion-v1-4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 136, + 654, + 347, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 654, + 347, + 665 + ], + "spans": [ + { + "bbox": [ + 136, + 654, + 347, + 665 + ], + "type": "text", + "content": "7 https://openaipublic.azureedge.net/clip/ViT-B-32" + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 148, + 179, + 463, + 249 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 3: Ablated performance of COMO trained on combinations of factuals and counterfactuals. For training on full factuals and counterfactuals (i.e. COCO-CF), COMO has two learning strategies, Random and In-Batch. The In-Batch strategy enforces the factual and its corresponding counterfactual feeded into the same mini-batch (see Figure 2(c)), while the Random strategy does not." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 148, + 179, + 463, + 249 + ], + "lines": [ + { + "bbox": [ + 148, + 179, + 463, + 249 + ], + "spans": [ + { + "bbox": [ + 148, + 179, + 463, + 249 + ], + "type": "table", + "html": "
Fine-turned DatasetsVL-ChecklistWinoground
RelationAttributeObjectAverageTextImage GroupAverage
None (pre-trained CLIP)61.8067.3282.9170.6730.5011.008.7516.75
Factuals Only (i.e. COCO)62.1267.4382.9870.8430.2510.508.7516.50
Factuals + Counterfactuals (Random)61.9567.7983.1270.9530.2511.009.0016.75
Factuals + Counterfactuals (In-Batch)71.1673.4486.2076.9331.0012.009.7517.58
", + "image_path": "0a0171666629b6262f56fbdccc3bde5445ec811a89d634b6c6b82d9a01b8c37e.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 270, + 482, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 353 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 353 + ], + "type": "text", + "content": "We observe that our COMO achieves the new state-of-the-art performance on both concepts understanding datasets. Specifically, our COMO outperforms the best baseline with " + }, + { + "bbox": [ + 130, + 270, + 482, + 353 + ], + "type": "inline_equation", + "content": "3.17\\%" + }, + { + "bbox": [ + 130, + 270, + 482, + 353 + ], + "type": "text", + "content": " relative improvement in terms of VL-Checklist's attribute metric, and with " + }, + { + "bbox": [ + 130, + 270, + 482, + 353 + ], + "type": "inline_equation", + "content": "4.35\\%" + }, + { + "bbox": [ + 130, + 270, + 482, + 353 + ], + "type": "text", + "content": " relative improvement in terms of image score on Winoground. This shows that our COMO can better understand the concepts beyond bag-of-objects and conduct compositional reasoning about relation, attribute, and word order." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 354, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 472 + ], + "type": "text", + "content": "Furthermore, our COMO gets the best result over all six settings on both datasets. It shows our model can distinguish the differences between causal and spurious concepts. The improvement of COMO over baselines could be attributed to reasons below: i) COMO admits multimodal counterfactual examples by injecting concepts from pretrained masked language models and text-to-image diffusion model, which explicitly improve the clear understanding of VL models on semantic concepts; ii) COMO adopts a modified contrastive loss to reweight the importance of counterfactual samples in the mini-batch, which enforces the model to differentiate the original concepts in factuals from substitute concepts in counterfactuals." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 569 + ], + "type": "text", + "content": "We display relative gains on fine-grained \"Attribute\" and \"Relation\" tests of VL-Checklist as shown in Figure 3a. It is clear that COMO gets gains across over all tests (Attribute: size, material, color, state, action; Relation: spatial, action). These improvements can be contributed to the multimodal counterfactual samples that enforce the model to attend to the small concepts changes in the vision and text, and hard negative contrastive loss that push the embedding of counterfactual samples close to the anchor to be far away by reweighting the importance of counterfactual examples." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 586, + 246, + 597 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 586, + 246, + 597 + ], + "spans": [ + { + "bbox": [ + 131, + 586, + 246, + 597 + ], + "type": "text", + "content": "4.4 Ablation Studies" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 482, + 666 + ], + "type": "text", + "content": "Ablation on Mixing Factuals and Counterfactuals We have demonstrated that augmenting factual datasets (e.g. MS COCO) could improve the concept understanding and compositional reasoning of VL models with the help of multimodal counterfactual examples. We now conduct study on ablated contribution from factual, counterfactual, and their learning strategies. As shown in Table 3," + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 116, + 212, + 181 + ], + "blocks": [ + { + "bbox": [ + 137, + 116, + 212, + 181 + ], + "lines": [ + { + "bbox": [ + 137, + 116, + 212, + 181 + ], + "spans": [ + { + "bbox": [ + 137, + 116, + 212, + 181 + ], + "type": "image", + "image_path": "62717773491d200163186d4f4f8b750c2bfc82407a6e9cfacd4044562fd1d7f9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 140, + 183, + 209, + 193 + ], + "lines": [ + { + "bbox": [ + 140, + 183, + 209, + 193 + ], + "spans": [ + { + "bbox": [ + 140, + 183, + 209, + 193 + ], + "type": "text", + "content": "(a) Detailed results" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 216, + 117, + 301, + 180 + ], + "blocks": [ + { + "bbox": [ + 216, + 117, + 301, + 180 + ], + "lines": [ + { + "bbox": [ + 216, + 117, + 301, + 180 + ], + "spans": [ + { + "bbox": [ + 216, + 117, + 301, + 180 + ], + "type": "image", + "image_path": "5f26fa9348fa9e37b15e48bd2f4d8b481f238aaf58180b25f47e4574ba0c13ff.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 223, + 183, + 294, + 193 + ], + "lines": [ + { + "bbox": [ + 223, + 183, + 294, + 193 + ], + "spans": [ + { + "bbox": [ + 223, + 183, + 294, + 193 + ], + "type": "text", + "content": "(b) Contrastive loss" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 303, + 114, + 390, + 182 + ], + "blocks": [ + { + "bbox": [ + 303, + 114, + 390, + 182 + ], + "lines": [ + { + "bbox": [ + 303, + 114, + 390, + 182 + ], + "spans": [ + { + "bbox": [ + 303, + 114, + 390, + 182 + ], + "type": "image", + "image_path": "2b064737b94bda08fa0711881b57c21dd273ddb914437cff77aff4f64c8a1d3b.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 201, + 480, + 246 + ], + "lines": [ + { + "bbox": [ + 130, + 201, + 480, + 246 + ], + "spans": [ + { + "bbox": [ + 130, + 201, + 480, + 246 + ], + "type": "text", + "content": "Fig. 3: (a) Detailed results of baselines (CLIP, SVLC, SyVic) and our COMO on VL-Checklist. A: Attribute, R: Relation. (b) Impact of guided-and-weighted contrastive loss; (c) Influence of the number of generated images; (d) Performance varying with the training percent. (all evaluated on VL-Checklist)" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 391, + 114, + 479, + 182 + ], + "blocks": [ + { + "bbox": [ + 307, + 184, + 387, + 193 + ], + "lines": [ + { + "bbox": [ + 307, + 184, + 387, + 193 + ], + "spans": [ + { + "bbox": [ + 307, + 184, + 387, + 193 + ], + "type": "text", + "content": "(c) #Synthetic images" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 391, + 114, + 479, + 182 + ], + "lines": [ + { + "bbox": [ + 391, + 114, + 479, + 182 + ], + "spans": [ + { + "bbox": [ + 391, + 114, + 479, + 182 + ], + "type": "image", + "image_path": "dfbc32978f37b3415873d3c3c73783c52e1310c29927319242b943298eadfab7.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 395, + 183, + 477, + 193 + ], + "lines": [ + { + "bbox": [ + 395, + 183, + 477, + 193 + ], + "spans": [ + { + "bbox": [ + 395, + 183, + 477, + 193 + ], + "type": "text", + "content": "(d) Percent of training" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "table", + "bbox": [ + 202, + 293, + 409, + 375 + ], + "blocks": [ + { + "bbox": [ + 130, + 261, + 479, + 282 + ], + "lines": [ + { + "bbox": [ + 130, + 261, + 479, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 261, + 479, + 282 + ], + "type": "text", + "content": "Table 4: Ablated contribution from counterfactual images and counterfactual texts in COMO." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 202, + 293, + 409, + 375 + ], + "lines": [ + { + "bbox": [ + 202, + 293, + 409, + 375 + ], + "spans": [ + { + "bbox": [ + 202, + 293, + 409, + 375 + ], + "type": "table", + "html": "
Counterfactual\nImage TextVL-ChecklistWinoground\nAverage
RelationAttributeObjectAverage
CLIP61.8067.3282.9170.6716.75
XX62.1267.4382.9870.8416.50
X✓69.5671.1184.5575.0716.13
✓X69.3470.8584.2274.8016.58
✓✓71.1673.4486.2076.9317.58
", + "image_path": "0aca558bc1b3196298f38000aad63f615be4a23acbbbfecb06f972b7f98e54f6.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "table_body" + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 400, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 400, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 400, + 482, + 555 + ], + "type": "text", + "content": "we have the following findings. Firstly, compared to the pretrained CLIP, finetuning COMO on the factual only dataset (i.e., MS-COCO) has a negligible impact on Winoground dataset. It shows that the COMO that finetuning on only factual dataset still has the difficulty in concepts understanding beyond \"bag-of-objects\". Secondly, there is almost no improvement of performance when finetuning the COMO on the factual and counterfactual dataset with a random sampling strategies. It shows the necessity of enforcing the contrastive learning between counterfactuals and the factuals explicitly to reduce the VL model from the bias that taking spurious correlations between captions and images as shortcuts during training. Thirdly, compared to the random sampling strategy, sampling the factual and counterfactuals together (i.e. in a mini-batch) could improve VL models' robustness and the ability of concepts understanding and compositional reasoning." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 558, + 482, + 666 + ], + "type": "text", + "content": "Ablation on Multimodal Counterfactuals Text and Image We have ablated the contributions from multimodal counterfactuals, and now we investigate the impact of individual counterfactual text and individual counterfactual image. As shown in Table 4, removing either of them degrades the performance while removing both of them degrades a lot, demonstrating the usefulness of both counterfactual texts and counterfactual images to improve VL models' concepts understanding. On the one hand, for the effectiveness of counterfactual text, COMO trained with counterfactual text performs much better than that trained with factual samples only. For examples, the relative improvement is" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 203, + 146, + 408, + 213 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 5: Ablated Guided-and-Weighted Contrastive Loss on training from scratch and pretrained setting." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 203, + 146, + 408, + 213 + ], + "lines": [ + { + "bbox": [ + 203, + 146, + 408, + 213 + ], + "spans": [ + { + "bbox": [ + 203, + 146, + 408, + 213 + ], + "type": "table", + "html": "
Pretrained Weighted lossVL-Checklist
RelationAttributeObjectAverage
✓✓71.1673.4486.2076.93
X✓64.4264.7575.0468.07
✓X70.0272.8685.3776.08
XX62.1362.4873.8166.14
", + "image_path": "51dd24036e4db8df6186ab6a29b73979eb75c9581f75a16bd5bd959dfe83fdeb.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 234, + 480, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 234, + 480, + 353 + ], + "spans": [ + { + "bbox": [ + 130, + 234, + 480, + 353 + ], + "type": "text", + "content": "11.9% in terms of VL-Checklist's relation metric. It shows that it is necessary to force the VL model to attend to the small changes in the text, which could improve the VL model's understanding on concepts. On the other hand, for the effectiveness of counterfactual image, COMO trained with counterfactual image performs much better than that trained with factual samples only. For example, the relative improvement is 11.6% in terms of VL-Checklist's relation metric. As for the relative importance of counterfactual texts and counterfactual images, COMO trained with counterfactual texts is better than that trained with counterfactual images when testing on the VL-Checklist, while it is on the contrary when testing on Winoground." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 354, + 482, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 482, + 485 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 482, + 485 + ], + "type": "text", + "content": "Ablation on Guided-and-Weighted Contrastive Loss As shown in Table 5, on pretrained setting, the performance of COMO w/o the weighted loss consistently degrades on all of VL-Checklist metrics (relation, attribute, object). Although the performance of COMO in training from scratch drops by a large margin, to explore the effectiveness of weighted loss in training from scratch, we compare the COMO with naive loss and weighted loss in training from scratch settings. The table shows that our weighted loss still performs better than the naive contrastive loss in training from scratch settings, which shows the design of weighted loss is robust. These ablation results show that the full guided-and-weighted contrastive loss is beneficial compared to the standard (i.e. CLIP-loss) and unweighted (i.e. Eq.3) ones." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 502, + 294, + 514 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 502, + 294, + 514 + ], + "spans": [ + { + "bbox": [ + 132, + 502, + 294, + 514 + ], + "type": "text", + "content": "4.5 Hyper-parameter Analysis" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 521, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 640 + ], + "type": "text", + "content": "Influence of the number of generated images To improve the quality of generated images by text-to-diffusion models, and to reduce the inconsistencies in generated images and texts, we synthesize multiple images for a single caption at different time-step. In Figure 3c, we show the impact of the number of generated images on the three VL-Checklist evaluation settings (i.e. relation, attribute, object). We can see that, the performance increases as the number of generate images increases on all three evaluation settings, until getting saturated at around 8. This shows that filtering among the multiple generated images as the most satisfactory counterfactual image can improve the overall quality of our generated counterfactuals." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 642, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 642, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 642, + 481, + 665 + ], + "type": "text", + "content": "Low-resource scenario We conduct experiments in low-resource setting by randomly sampling part of the full training set to simulate a low-resource sce-" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 171, + 115, + 298, + 236 + ], + "blocks": [ + { + "bbox": [ + 171, + 115, + 298, + 236 + ], + "lines": [ + { + "bbox": [ + 171, + 115, + 298, + 236 + ], + "spans": [ + { + "bbox": [ + 171, + 115, + 298, + 236 + ], + "type": "image", + "image_path": "aabb51e46b2b58a07c4e401d3cbf3267db60b182ad1a5a45390b32d7163ec1f6.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 187, + 237, + 285, + 245 + ], + "lines": [ + { + "bbox": [ + 187, + 237, + 285, + 245 + ], + "spans": [ + { + "bbox": [ + 187, + 237, + 285, + 245 + ], + "type": "text", + "content": "(a) Attention visualizations" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 255, + 479, + 288 + ], + "lines": [ + { + "bbox": [ + 131, + 255, + 479, + 288 + ], + "spans": [ + { + "bbox": [ + 131, + 255, + 479, + 288 + ], + "type": "text", + "content": "Fig. 4: (a) Attention visualizations on COMO and CLIP. (b) Qualitative analysis on COMO and its three variants. Note, CLIP i.e. COMO w/o both of counterfactual images and texts." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 302, + 114, + 441, + 236 + ], + "blocks": [ + { + "bbox": [ + 302, + 114, + 441, + 236 + ], + "lines": [ + { + "bbox": [ + 302, + 114, + 441, + 236 + ], + "spans": [ + { + "bbox": [ + 302, + 114, + 441, + 236 + ], + "type": "table", + "html": "
GroupType of ConceptImageCaptionCLIPCOMO w/o CF-ImageCOMO w/o CF-TestCOMO
Objectlocation[POS]: log on bus [NEG]: log on grassPOS:0.99 NEG:0.01POS:1.00 NEG:0.00POS:1.00 NEG:0.00POS:1.00 NEG:0.00
Relationspatial[POS]: beer in glass [NEG]: beer out of glassPOS:0.31 NEG:0.69POS:0.42 NEG:0.58POS:0.77 NEG:0.23POS:0.84 NEG:0.16
action[POS]: necklace on cooking man [NEG]: necklace on sleeping manPOS:0.44 NEG:0.56POS:0.99 NEG:0.01POS:0.98 NEG:0.02POS:0.99 NEG:0.01
color[POS]: water next to green scenery [NEG]: water next to dark brown sceneryPOS:0.35 NEG:0.65POS:0.66 NEG:0.34POS:0.45 NEG:0.55POS:0.89 NEG:0.11
material[POS]: handle on wooden cabinet [NEG]: handle on denim cabinetPOS:0.23 NEG:0.77POS:0.30 NEG:0.70POS:0.42 NEG:0.58POS:0.66 NEG:0.34
state[POS]: closed cabinet [NEG]: open cabinetPOS:0.01 NEG:0.99POS:0.11 NEG:0.89POS:0.18 NEG:0.82POS:0.37 NEG:0.63
", + "image_path": "011a05b1a00ac71fe6011f9bb3506700cbbe892847c3ec379258ec6e21155b01.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 330, + 237, + 415, + 246 + ], + "lines": [ + { + "bbox": [ + 330, + 237, + 415, + 246 + ], + "spans": [ + { + "bbox": [ + 330, + 237, + 415, + 246 + ], + "type": "text", + "content": "(b) Qualitative analysis" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 312, + 480, + 396 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 312, + 480, + 396 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 480, + 396 + ], + "type": "text", + "content": "nario. The results are shown in Figure 3d where the CLIP and COMO are both trained on the corresponding low-resource training set. We can see that both CLIP and COMO get better performance with the increasing of more training examples. Moreover, our COMO achieves much advantage under the extreme low-resource scenario. In detail, relative improvements of COMO over CLIP are " + }, + { + "bbox": [ + 130, + 312, + 480, + 396 + ], + "type": "inline_equation", + "content": "2.24\\%" + }, + { + "bbox": [ + 130, + 312, + 480, + 396 + ], + "type": "text", + "content": " at training percent " + }, + { + "bbox": [ + 130, + 312, + 480, + 396 + ], + "type": "inline_equation", + "content": "10\\%" + }, + { + "bbox": [ + 130, + 312, + 480, + 396 + ], + "type": "text", + "content": ". It shows that our COMO is effective in improving the VL concepts' understanding under data scarcity scenario." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 416, + 216, + 428 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 416, + 216, + 428 + ], + "spans": [ + { + "bbox": [ + 132, + 416, + 216, + 428 + ], + "type": "text", + "content": "4.6 Case study" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 437, + 480, + 509 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 480, + 509 + ], + "type": "text", + "content": "Attention visualizations We conduct attention visualizations on COMO and CLIP to observe the ability of visual and language concept understanding. As shown in Figure 4a, our COMO can capture object \"knife\" and attribute \"big\" while CLIP wrongly attends to \"plates\" and \"small\" cat. It shows that our COMO improve the clear understanding of VL models on semantic concepts and learn the difference between VL concepts." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 510, + 481, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 481, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 481, + 640 + ], + "type": "text", + "content": "Qualitative analysis We conduct qualitative experiments to understand the working of COMO and its three variants, i) COMO without counterfactual images (COMO w/o CF-image), ii) COMO without counterfactual texts (COMO w/o CF-text), and iii) COMO without both of them (i.e. CLIP). The results are shown in Figure 4b. Firstly, for frequently occurring VL \"bag-of-objects\" concepts, such as bus and grass in Figure 4b (Object-location), all VL models including CLIP, two variants of COMO, and COMO predict the caption correctly. However, CLIP can not identify the difference between \"cooking\" and \"sleeping\" in Figure 4b (Attribute-action), while all other VL models with counterfactuals match the image to the ground-truth caption correctly. It shows that the counterfactuals can help the model to learn the differences between concepts." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 481, + 665 + ], + "type": "text", + "content": "Secondly, as for the importance of counterfactual texts (i.e. by observing the variant COMO w/o CF-text), as shown in Figure 4b (Attribute-color), removing" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 197, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "content": "counterfactual texts leads to the COMO wrongly matching the image to the ground-truth caption. It is shown that the counterfactual text can help the model to learn the general concepts, especially when the factual description is coarse." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 481, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 481, + 224 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 481, + 224 + ], + "type": "text", + "content": "Thirdly, as for the importance of counterfactual images (i.e. by observing the variant COMO w/o CF-image), as shown in Figure 4b (Relation-spatial), removing counterfactual images leads to the COMO wrongly predict the caption when the image has lots of visual concepts unrelated to the text. It shows that VL models with counterfactual images can reduce the influence of spurious concepts in image." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 224, + 481, + 307 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 224, + 481, + 307 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 481, + 307 + ], + "type": "text", + "content": "Fourthly, as for the importance of multimodal counterfactuals, as shown in Figure 4b (Attribute-material), removing multimodal counterfactuals leads the COMO can not identify the material of cabinet from the image. The improvement of the VL model's concept understanding could be attributed to enforcing the model to attend to the small concept changes in the counterfactual image and text, and to match the counterfactual image and counterfactual text together to learn out of domain concepts." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 308, + 481, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 308, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 481, + 403 + ], + "type": "text", + "content": "We observe that, as shown in Figure 4b (Attribute-state), all VL models fail in matching the image to its ground-truth caption \"closed cabinet\". The failing reason could be that an \"open door\" appears in the image, which guides the model to trust that \"open\" is matching to the image. Though multimodal counterfactual samples improve the model's understanding of concepts, VL models still suffer from the problems of \"bags of objects\" in images and texts. It is worthy of investigating in improving concepts understanding and compositional reasoning of VL models." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 420, + 226, + 433 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 420, + 226, + 433 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 226, + 433 + ], + "type": "text", + "content": "5 Conclusions" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 444, + 482, + 601 + ], + "type": "text", + "content": "We have presented a data-and-algorithm driven technique for enhancing the performance of VL models to understand beyond \"bag-of-objects\" and reason about compositional concepts including attributes, relations, and word order. Our proposed contrastive learning framework with multimodal counterfactuals attains significant gains over five strong VL models on two benchmark datasets. It builds upon the modeling strength and knowledge of nowadays language models and diffusion models by injecting concepts to VL models, suggesting generalizations to future VL models. We demonstrated the necessity of both counterfactual texts and counterfactual images. We also show the necessity of effective learning with guided-and-weighted contrastive loss. Extensive ablation and case study help understand the working of the proposed approach as well its limitations, suggesting the future work of investigating other factors on improving compositional reasoning." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 617, + 247, + 631 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 617, + 247, + 631 + ], + "spans": [ + { + "bbox": [ + 132, + 617, + 247, + 631 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "type": "text", + "content": "This work is supported by National Natural Science Foundation of China (No. 62306220)." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 139, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 139, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 139, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 138, + 139, + 480, + 172 + ], + "type": "text", + "content": "1. Antol, S., Agrawal, A., Lu, J., Mitchell, M., Batra, D., Zitnick, C.L., Parikh, D.: Vqa: Visual question answering. In: Proceedings of the IEEE international conference on computer vision. pp. 2425-2433 (2015)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 173, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 173, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 138, + 173, + 480, + 215 + ], + "type": "text", + "content": "2. Basu, A., Addepalli, S., Babu, R.V.: Rmlvqa: A margin loss approach for visual question answering with language biases. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11671-11680 (June 2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 216, + 480, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 216, + 480, + 259 + ], + "spans": [ + { + "bbox": [ + 138, + 216, + 480, + 259 + ], + "type": "text", + "content": "3. Cascante-Bonilla, P., Shehada, K., Smith, J.S., Doveh, S., Kim, D., Panda, R., Varol, G., Oliva, A., Ordonez, V., Feris, R., et al.: Going beyond nouns with vision & language models using synthetic data. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 20155-20165 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 260, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 260, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 260, + 480, + 293 + ], + "type": "text", + "content": "4. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 293, + 480, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 293, + 480, + 336 + ], + "spans": [ + { + "bbox": [ + 138, + 293, + 480, + 336 + ], + "type": "text", + "content": "5. Chen, Y., Yuan, J., Tian, Y., Geng, S., Li, X., Zhou, D., Metaxas, D.N., Yang, H.: Revisiting multimodal representation in contrastive learning: from patch and token embeddings to finite discrete tokens. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15095-15104 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 337, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 337, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 138, + 337, + 480, + 380 + ], + "type": "text", + "content": "6. Chen, Y., Ma, Z., Zhang, Z., Qi, Z., Yuan, C., Shan, Y., Li, B., Hu, W., Qie, X., Wu, J.: Vilem: Visual-language error modeling for image-text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 11018-11027 (June 2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 380, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 380, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 138, + 380, + 480, + 413 + ], + "type": "text", + "content": "7. Chuang, C.Y., Robinson, J., Lin, Y.C., Torralba, A., Jegelka, S.: Debiased contrastive learning. Advances in neural information processing systems 33, 8765-8775 (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 414, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 414, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 138, + 414, + 480, + 456 + ], + "type": "text", + "content": "8. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics. pp. 4171-4186 (2019)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 457, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 457, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 138, + 457, + 480, + 490 + ], + "type": "text", + "content": "9. Dosovitskiy, A., Springenberg, J.T., Riedmiller, M., Brox, T.: Discriminative unsupervised feature learning with convolutional neural networks. Advances in neural information processing systems 27 (2014)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 491, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 491, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 138, + 491, + 480, + 522 + ], + "type": "text", + "content": "10. Doveh, S., Arbelle, A., Harary, S., Alfassy, A., Herzig, R., Kim, D., Giryes, R., Feris, R., Panda, R., Ullman, S., et al.: Dense and aligned captions (dac) promote compositional reasoning in vl models. NeurIPS (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 523, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 480, + 566 + ], + "type": "text", + "content": "1. Doveh, S., Arbelle, A., Harary, S., Schwartz, E., Herzig, R., Giryes, R., Feris, R., Panda, R., Ullman, S., Karlinsky, L.: Teaching structured vision & language concepts to vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2657-2668 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 567, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 480, + 599 + ], + "type": "text", + "content": "2. Geirhos, R., Jacobsen, J.H., Michaelis, C., Zemel, R., Brendel, W., Bethge, M., Wichmann, F.A.: Shortcut learning in deep neural networks. Nature Machine Intelligence 2(11), 665-673 (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 480, + 632 + ], + "type": "text", + "content": "3. Goel, S., Bansal, H., Bhatia, S., Rossi, R., Vinay, V., Grover, A.: Cyclic contrastive language-image pretraining. Advances in Neural Information Processing Systems 35, 6704-6719 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "4. Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality reduction by learning an invariant mapping. In: 2006 IEEE computer society conference on computer vision and pattern recognition (CVPR'06). vol. 2, pp. 1735-1742. IEEE (2006)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "15. He, R., Sun, S., Yu, X., Xue, C., Zhang, W., Torr, P., Bai, S., QI, X.: Is synthetic data from generative models ready for image recognition? In: The Eleventh International Conference on Learning Representations (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 481, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 481, + 192 + ], + "type": "text", + "content": "16. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 192, + 480, + 224 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 192, + 480, + 224 + ], + "spans": [ + { + "bbox": [ + 133, + 192, + 480, + 224 + ], + "type": "text", + "content": "17. Kalantidis, Y., Sariyildiz, M.B., Pion, N., Weinzaepfel, P., Larlus, D.: Hard negative mixing for contrastive learning. Advances in Neural Information Processing Systems 33, 21798-21809 (2020)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 224, + 480, + 257 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 480, + 257 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 480, + 257 + ], + "type": "text", + "content": "18. Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., Krishnan, D.: Supervised contrastive learning. Advances in neural information processing systems 33, 18661-18673 (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 257, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 257, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 132, + 257, + 481, + 300 + ], + "type": "text", + "content": "19. Krishna, R., Zhu, Y., Groth, O., Johnson, J., Hata, K., Kravitz, J., Chen, S., Kalantidis, Y., Li, L.J., Shamma, D.A., et al.: Visual genome: Connecting language and vision using crowdsourced dense image annotations. International journal of computer vision 123, 32-73 (2017)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 300, + 480, + 321 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 300, + 480, + 321 + ], + "spans": [ + { + "bbox": [ + 132, + 300, + 480, + 321 + ], + "type": "text", + "content": "20. Le, T., Lal, V., Howard, P.: Coco-counterfactuals: Automatically constructed counterfactual examples for image-text pairs. arXiv preprint arXiv:2309.14356 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 321, + 480, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 321, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 132, + 321, + 480, + 365 + ], + "type": "text", + "content": "21. Li, C., Liu, H., Li, L., Zhang, P., Aneja, J., Yang, J., Jin, P., Hu, H., Liu, Z., Lee, Y.J., et al.: Elevater: A benchmark and toolkit for evaluating language-augmented visual models. Advances in Neural Information Processing Systems 35, 9287-9301 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 365, + 480, + 386 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 365, + 480, + 386 + ], + "spans": [ + { + "bbox": [ + 132, + 365, + 480, + 386 + ], + "type": "text", + "content": "22. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models. ICML (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 386, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 386, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 386, + 480, + 418 + ], + "type": "text", + "content": "23. Li, J., Li, D., Xiong, C., Hoi, S.: Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation. In: International Conference on Machine Learning. pp. 12888-12900. PMLR (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 418, + 480, + 450 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 480, + 450 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 480, + 450 + ], + "type": "text", + "content": "24. Li, Y.L., Xu, L., Liu, X., Huang, X., Xu, Y., Chen, M., Ma, Z., Wang, S., Fang, H.S., Lu, C.: Hake: Human activity knowledge engine. arXiv preprint arXiv:1904.06539 (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 450, + 480, + 494 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 450, + 480, + 494 + ], + "spans": [ + { + "bbox": [ + 132, + 450, + 480, + 494 + ], + "type": "text", + "content": "25. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dólar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13. pp. 740-755. Springer (2014)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 494, + 480, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 494, + 480, + 515 + ], + "spans": [ + { + "bbox": [ + 132, + 494, + 480, + 515 + ], + "type": "text", + "content": "26. Miller, G.A.: Wordnet: a lexical database for english. Communications of the ACM 38(11), 39-41 (1995)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 515, + 480, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 515, + 480, + 557 + ], + "spans": [ + { + "bbox": [ + 132, + 515, + 480, + 557 + ], + "type": "text", + "content": "27. Moltisanti, D., Keller, F., Bilen, H., Sevilla-Lara, L.: Learning action changes by measuring verb-adverb textual relationships. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 23110-23118 (June 2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 558, + 480, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 480, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 480, + 590 + ], + "type": "text", + "content": "28. Momeni, L., Caron, M., Nagrani, A., Zisserman, A., Schmid, C.: Verbs in action: Improving verb understanding in video-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15579-15591 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 590, + 480, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 590, + 480, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 590, + 480, + 611 + ], + "type": "text", + "content": "29. Oord, A.v.d., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "text", + "content": "30. Pham, K., Kafle, K., Lin, Z., Ding, Z., Cohen, S., Tran, Q., Shrivastava, A.: Learning to predict visual attributes in the wild. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13018-13028 (2021)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 132, + 643, + 480, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 480, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 480, + 666 + ], + "type": "text", + "content": "31. Pratt, S., Yatskar, M., Weihs, L., Farhadi, A., Kembhavi, A.: Grounded situation recognition. In: European Conference on Computer Vision. pp. 314-332 (2020)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 161 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 161 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 161 + ], + "type": "text", + "content": "32. Radenovic, F., Dubey, A., Kadian, A., Mihaylov, T., Vandenhende, S., Patel, Y., Wen, Y., Ramanathan, V., Mahajan, D.: Filtering, distillation, and hard negatives for vision-language pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6967-6977 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 162, + 482, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 162, + 482, + 215 + ], + "spans": [ + { + "bbox": [ + 130, + 162, + 482, + 215 + ], + "type": "text", + "content": "33. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 8748-8763. PMLR (18-24 Jul 2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 216, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 237 + ], + "type": "text", + "content": "34. Robinson, J.D., Chuang, C.Y., Sra, S., Jegelka, S.: Contrastive learning with hard negative samples. In: International Conference on Learning Representations (2020)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 238, + 481, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 238, + 481, + 270 + ], + "spans": [ + { + "bbox": [ + 132, + 238, + 481, + 270 + ], + "type": "text", + "content": "35. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 271, + 481, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 271, + 481, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 271, + 481, + 314 + ], + "type": "text", + "content": "36. Roth, K., Kim, J.M., Koepke, A.S., Vinyals, O., Schmid, C., Akata, Z.: Waffling around for performance: Visual classification with random words and broad concepts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15746-15757 (October 2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 481, + 346 + ], + "type": "text", + "content": "37. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 347, + 481, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 481, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 481, + 380 + ], + "type": "text", + "content": "38. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 481, + 413 + ], + "type": "text", + "content": "39. Shi, H., Mao, J., Xiao, T., Jiang, Y., Sun, J.: Learning visually-grounded semantics from contrastive adversarial samples. In: Proceedings of the 27th International Conference on Computational Linguistics. pp. 3715-3727 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 414, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 414, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 481, + 456 + ], + "type": "text", + "content": "40. Smith, J.S., Cascante-Bonilla, P., Arbelle, A., Kim, D., Panda, R., Cox, D., Yang, D., Kira, Z., Feris, R., Karlinsky, L.: Construct-vl: Data-free continual structured vl concepts learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14994-15004 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 481, + 500 + ], + "type": "text", + "content": "41. Thrush, T., Jiang, R., Bartolo, M., Singh, A., Williams, A., Kiela, D., Ross, C.: Winoground: Probing vision and language models for visio-linguistic compositionality. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5238-5248 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 481, + 533 + ], + "type": "text", + "content": "42. Tian, Y., Sun, C., Poole, B., Krishnan, D., Schmid, C., Isola, P.: What makes for good views for contrastive learning? Advances in neural information processing systems 33, 6827-6839 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 481, + 566 + ], + "type": "text", + "content": "43. Trabucco, B., Doherty, K., Gurinas, M., Salakhutdinov, R.: Effective data augmentation with diffusion models. In: ICLR 2023 Workshop on Mathematical and Empirical Understanding of Foundation Models (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 481, + 600 + ], + "type": "text", + "content": "44. Wang, W., Yang, Z., Xu, B., Li, J., Sun, Y.: Vilt: Enhancing vision-language pre-training through textual augmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3158-3169 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 601, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 601, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 601, + 481, + 643 + ], + "type": "text", + "content": "45. Wang, Z., Gao, Z., Guo, K., Yang, Y., Wang, X., Shen, H.T.: Multilateral semantic relations modeling for image text retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 2830-2839 (June 2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 644, + 481, + 665 + ], + "type": "text", + "content": "46. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 197, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving VLC Understanding with Multimodal CF Samples" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 658 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 147, + 116, + 481, + 138 + ], + "type": "text", + "content": "Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 481, + 182 + ], + "type": "text", + "content": "47. Wei, J., Zou, K.: Eda: Easy data augmentation techniques for boosting performance on text classification tasks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 6382-6388 (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 481, + 225 + ], + "type": "text", + "content": "48. Wei, Y., Zhang, Y., Ji, Z., Bai, J., Zhang, L., Zuo, W.: Elite: Encoding visual concepts into textual embeddings for customized text-to-image generation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15943-15953 (October 2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 225, + 481, + 269 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 225, + 481, + 269 + ], + "spans": [ + { + "bbox": [ + 132, + 225, + 481, + 269 + ], + "type": "text", + "content": "49. Wu, H., Mao, J., Zhang, Y., Jiang, Y., Li, L., Sun, W., Ma, W.Y.: Unified visual-semantic embeddings: Bridging vision and language with structured meaning representations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6609-6618 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 269, + 481, + 301 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 269, + 481, + 301 + ], + "spans": [ + { + "bbox": [ + 132, + 269, + 481, + 301 + ], + "type": "text", + "content": "50. Wu, Y., Wei, Y., Wang, H., Liu, Y., Yang, S., He, X.: Grounded image text matching with mismatched relation reasoning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2976-2987 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 301, + 481, + 344 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 301, + 481, + 344 + ], + "spans": [ + { + "bbox": [ + 132, + 301, + 481, + 344 + ], + "type": "text", + "content": "51. Xie, C.W., Sun, S., Xiong, X., Zheng, Y., Zhao, D., Zhou, J.: Ra-clip: Retrieval augmented contrastive language-image pre-training. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19265-19274 (June 2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 344, + 481, + 388 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 344, + 481, + 388 + ], + "spans": [ + { + "bbox": [ + 132, + 344, + 481, + 388 + ], + "type": "text", + "content": "52. Yang, J., Duan, J., Tran, S., Xu, Y., Chanda, S., Chen, L., Zeng, B., Chilimbi, T., Huang, J.: Vision-language pre-training with triple contrastive learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15671-15680 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 388, + 481, + 430 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 388, + 481, + 430 + ], + "spans": [ + { + "bbox": [ + 132, + 388, + 481, + 430 + ], + "type": "text", + "content": "53. Yang, K., Deng, J., An, X., Li, J., Feng, Z., Guo, J., Yang, J., Liu, T.: Alip: Adaptive language-image pre-training with synthetic caption. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 2922-2931 (October 2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 431, + 481, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 431, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 431, + 481, + 464 + ], + "type": "text", + "content": "54. Yuksekgonul, M., Bianchi, F., Kalluri, P., Jurafsky, D., Zou, J.: When and why vision-language models behave like bags-of-words, and what to do about it? In: The Eleventh International Conference on Learning Representations (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 464, + 481, + 496 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 481, + 496 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 481, + 496 + ], + "type": "text", + "content": "55. Zhang, X., Zhang, F., Xu, C.: Vqacl: A novel visual question answering continual learning setting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 19102-19112 (June 2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 496, + 481, + 517 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 496, + 481, + 517 + ], + "spans": [ + { + "bbox": [ + 132, + 496, + 481, + 517 + ], + "type": "text", + "content": "56. Zhang, X., Zhao, J., LeCun, Y.: Character-level convolutional networks for text classification. Advances in neural information processing systems 28 (2015)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 517, + 481, + 549 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 517, + 481, + 549 + ], + "spans": [ + { + "bbox": [ + 132, + 517, + 481, + 549 + ], + "type": "text", + "content": "57. Zhao, T., Zhang, T., Zhu, M., Shen, H., Lee, K., Lu, X., Yin, J.: Vl-checklist: Evaluating pre-trained vision-language models with objects, attributes and relations. arXiv preprint arXiv:2207.00221 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 549, + 481, + 582 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 549, + 481, + 582 + ], + "spans": [ + { + "bbox": [ + 132, + 549, + 481, + 582 + ], + "type": "text", + "content": "58. Zhen, L., Hu, P., Wang, X., Peng, D.: Deep supervised cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10394-10403 (2019)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 582, + 481, + 625 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 582, + 481, + 625 + ], + "spans": [ + { + "bbox": [ + 132, + 582, + 481, + 625 + ], + "type": "text", + "content": "59. Zhong, Y., Yang, J., Zhang, P., Li, C., Codella, N., Li, L.H., Zhou, L., Dai, X., Yuan, L., Li, Y., et al.: Regionclip: Region-based language-image pretraining. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16793-16803 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 625, + 481, + 658 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 625, + 481, + 658 + ], + "spans": [ + { + "bbox": [ + 132, + 625, + 481, + 658 + ], + "type": "text", + "content": "60. Zhong, Z., Zheng, L., Kang, G., Li, S., Yang, Y.: Random erasing data augmentation. In: Proceedings of the AAAI conference on artificial intelligence. vol. 34, pp. 13001-13008 (2020)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 203, + 100 + ], + "type": "text", + "content": "Lai et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_content_list.json b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..63b436f3fe5ab5da3800b20a6eac4a65311bb6fa --- /dev/null +++ b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_content_list.json @@ -0,0 +1,1934 @@ +[ + { + "type": "text", + "text": "Improving Zero-Shot Generalization for CLIP with Variational Adapter", + "text_level": 1, + "bbox": [ + 240, + 140, + 759, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ziqian Lu $^{1}$ , Fengli Shen $^{2}$ , Mushui Liu $^{1}$ , Yunlong Yu $^{1}$ *, and Xi Li $^{1}$", + "bbox": [ + 245, + 210, + 754, + 228 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Zhejiang University, Hangzhou 310007, China", + "bbox": [ + 339, + 239, + 661, + 253 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ Yangtze Delta Region Institute (Huzhou) University of Electronic Science and Technology of China, Huzhou 313001, China", + "bbox": [ + 233, + 253, + 767, + 280 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{ziqianlu,1ms,yuyunlong,xilizju}@zju.edu.cn", + "bbox": [ + 334, + 282, + 666, + 296 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "fenglishen@csj.uestc.edu.cn", + "bbox": [ + 393, + 297, + 606, + 309 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. The excellent generalization capability of pre-trained Vision-Language Models (VLMs) makes fine-tuning VLMs for downstream zero-shot tasks a popular choice. Despite achieving promising performance in the professionality of base classes, most existing fine-tuned methods suffer from feature confusion of novel classes, resulting in unsatisfactory transferability. To address this problem, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that explicitly reduces the prediction bias by separating base and novel samples. Specifically, we design two variational adapters with learnable textual tokens to align latent representations for each modality in a shared latent space. Once trained, we can separate novel samples from entangled space using the similarity metric of latent features, i.e., converting confusion task into two independent ones (One for base classes and the other for novel classes). Moreover, to improve the transferability for novel classes, we further refine the output features of the learned adapters with the global features via a residual connection. We conduct extensive experiments on Generalized Zero-Shot Learning and Cross-Dataset Transfer Learning to demonstrate the superiority of our approach and establish a new state-of-the-art on four popular benchmarks.", + "bbox": [ + 259, + 347, + 743, + 612 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Visual-Language Models $\\cdot$ Zero-Shot Generalization $\\cdot$ Variational Adapter", + "bbox": [ + 259, + 623, + 740, + 652 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 678, + 375, + 694 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recently, pre-trained Vision-Language Models (VLMs) such as CLIP [31] and ALIGN [18] have demonstrated remarkable applicability across various downstream tasks such as Zero-Shot Learning (ZSL) [1, 38]. To further boost the performance on downstream tasks, recent studies have proposed several fine-tuning methods based on the VLMs structure. In general, existing fine-tuning methods can be grouped into two lines: (1) Prompt Learning (PL) [19, 44, 45] is a paradigm that leverages a minimal set of learnable parameters, known as", + "bbox": [ + 212, + 709, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding author", + "bbox": [ + 217, + 824, + 382, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/a2630156beb8ce170f33e4adef823e465e6545a01929edb148fe7b94516b2d54.jpg", + "image_caption": [ + "(a) Distribution of all the classes." + ], + "image_footnote": [], + "bbox": [ + 339, + 143, + 635, + 268 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/e2b837fad366eb618182490e19ad195a4b1763099cd7cd993ab1a5a078fd3f99.jpg", + "image_caption": [ + "(b) Distribution of base classes.", + "(c) Distribution of novel classes.", + "Fig. 1: t-SNE visualization of AWA2 dataset with CoOP [45]. The color and grey pentagrams represent novel and base samples, respectively. (a) There is obvious overlap and confusion in the distribution of bobcat, tiger, and leopard. (b-c) The confusion issue could be efficiently addressed if the two class sets were meticulously segregated." + ], + "image_footnote": [], + "bbox": [ + 336, + 282, + 666, + 404 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "prompts, to efficiently adapt pre-trained models to the downstream tasks in a data-efficient manner while maintaining competitive performance. (2) Adapter-style Tuning (AT) [13, 43] involves introducing adapter layers or modules into the pre-trained models, allowing only these adapter layers to be updated during fine-tuning while the rest of the models' parameters remain frozen.", + "bbox": [ + 212, + 518, + 787, + 594 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, both PL and AT paradigms only fine-tune VLMs on base classes, resulting in extreme prediction bias towards base classes. This bias is exacerbated in challenging open-world vision tasks (e.g., Generalized Zero-Shot Learning, GZSL [5,22,39]) due to the feature confusion. As shown in Fig. 1(a), the novel samples (color pentagrams) are located around the base samples (grey pentagrams) owing to the lack of prior knowledge of the former. These fine-tuning methods trained on unbalanced base data may tend to classify all samples into base classes and struggle to generalize to novel classes, reducing their transferability.", + "bbox": [ + 212, + 595, + 787, + 731 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To this end, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that improves both the professionality and transferability of the VLMs model. Inspired by previous PL work, we learn task-specific textual tokens instead of subjective hand-crafted attributes. Compared to the static attributes, these learnable prompts can not only capture more discriminative information but also provide better diversity for subsequent adaptation learning. Then, two variational adapters are constructed to generate latent repre", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "sentations in a shared latent space, in which we adopt class-wise and distributionwise vision-language constraints to ensure alignment and interaction properties for each branch. With the help of variational structures, adapters carefully align multi-modal features in redundancy-free latent space, providing accurate visual-semantic interactions. After that, we can search for a threshold to distinguish the base and novel domains by measuring the similarity between the latent representations of the two domains. Based on the similarity, GZSL can thus be converted into a base class classification and a zero-shot task of novel classes, as shown in Fig. 1(b-c). Once base and novel samples are distinguished, the prediction bias problem will naturally be addressed.", + "bbox": [ + 212, + 146, + 782, + 296 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In addition, even if the test spaces are accurately distinguished, how to classify novel samples remains a challenging task. Thus, we further refine the output feature of the learned adapters with the global features (extracted from the original CLIP encoder) via a residual connection to improve the transferability. Benefiting from residual connection, variational adapters can fully exploit the transferable general knowledge stored in the original CLIP and freshly learned knowledge originated from training samples. In fact, different from existing methods that train an extra binary classifier to distinguish domains, we efficiently model the entire process (i.e., data separation and classification) in a unified Prompt-Adapter hybrid framework to simultaneously preserve the professionalism and transferability of the VLMs model.", + "bbox": [ + 212, + 297, + 784, + 462 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In summary, our main contributions are:", + "bbox": [ + 238, + 464, + 532, + 478 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We introduce a novel approach, the Prompt-based Variational Adapter (PVA), specifically designed to address the challenges of GZSL. To the best of our knowledge, our method marks the inaugural exploration of the synergy between PL and AT in the context of fine-tuning CLIP models, offering a novel and effective solution to this complex task.", + "- We propose to utilize the latent representations of the adapter, which are tightly governed by the vision-language distribution, to distinguish novel classes from base classes. By segmenting the entire test space into two distinct and independent subspaces, the prediction bias that typically favors base classes is explicitly mitigated, thereby enhancing the accuracy and fairness of the classification process.", + "- Our experimental results demonstrate that the proposed PVA achieves state-of-the-art performance across a wide range of downstream tasks, including GZSL and Cross-Dataset transfer learning. Notably, PVA exhibits significant improvements in recognizing novel classes, showcasing its effectiveness in addressing the inherent challenges of these tasks." + ], + "bbox": [ + 225, + 488, + 790, + 728 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 752, + 387, + 768 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Generalized Zero-Shot Learning", + "text_level": 1, + "bbox": [ + 215, + 784, + 524, + 800 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "How to recognize objects in an open-world visual environment has attracted increasing interest in recent years. GZSL [5,22,23,39] is one of the relevant research", + "bbox": [ + 212, + 809, + 782, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "fields focusing on open-world visual tasks. Specifically, GZSL aims to recognize both base and novel objects, relying solely on labeled samples from the base classes. To achieve this goal, existing methods can be grouped into two folds: (1) Embedding-based methods [4, 23, 42], which focus on learning a visual-semantic mapping in visual, semantic or latent space for cross-modal interactions. However, a major drawback of Embedding-based methods is the prediction bias toward base classes for the lack of novel labeled data. Therefore, some researchers tend to explore feature-generation methods to reduce prediction bias. (2) Generative methods [7, 39, 41] aim to generate the visual features or prototype of the novel classes by various generative networks, such as generative adversarial networks (GANs) [14] and variational autoencoders (VAEs) [32]. Despite the promising results, these methods still require massive annotated data and semantic descriptions (e.g., sentences, hand-crafted attributes). In addition, since the generated features come from noise inputs, they usually suffer from extreme domain shift problems.", + "bbox": [ + 212, + 146, + 787, + 372 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Different from these existing methods, we explicitly aim to tackle the prediction bias problem by converting the GZSL into a ZSL classification task and a supervised task. One of the related methods is calibration, which has been explored in several recent works [2, 3, 8, 33]. ESZSL [3] calibrates the prediction by directly reducing the probability of base classes. COSMO [2] proposes a soft combination method without any training samples. OOD [8] and DUS [33] attempt to learn the boundary from base samples to separate novel classes from entangled space. Different from the aforementioned methods, we adopt adapter-style tuning equipped with learnable prompts based on VLMs to improve the transferability, not simply learn a domain detector.", + "bbox": [ + 212, + 373, + 787, + 523 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Vision-Language Models for Zero-Shot Generalization", + "text_level": 1, + "bbox": [ + 214, + 544, + 705, + 559 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Pre-trained vision-language models (VLMs) explore the relationship between two different modalities by contrastive learning with massive noisy data. With the help of reasonable structures, these models, such as CLIP [31] and ALIGN [18] can provide excellent representations for both visual and text branches. Based on the remarkable transferability of VLMs, the researchers adopt improved methods to address downstream zero-shot generalization problems. [19,44,45] apply an efficient fine-tuning paradigm by learning representation for the specific task. [13,43] learn extra MLPs to adapt the downstream knowledge. However, these methods only consider knowledge transfer, ignoring the feature confusion that occurs in hybrid open-world spaces.", + "bbox": [ + 212, + 568, + 787, + 720 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 Method", + "text_level": 1, + "bbox": [ + 214, + 739, + 331, + 757 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 Overall idea", + "text_level": 1, + "bbox": [ + 214, + 770, + 362, + 785 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Our method introduces a prompt-based variational adapter to address the prediction bias problem without sacrificing task-specific discrimination and transferability. Fig. 2 shows the overall architecture of the proposed PVA. Different", + "bbox": [ + 212, + 794, + 785, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "\\* : Frozen", + "bbox": [ + 228, + 154, + 272, + 162 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": ": Learnable", + "bbox": [ + 230, + 169, + 282, + 176 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Training Image", + "bbox": [ + 305, + 147, + 362, + 154 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/e14089928f68ff080f1ad67d03f6ab951dd888d70bd48eb7994c7b9e9a927801.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 313, + 155, + 351, + 181 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Test Image", + "bbox": [ + 388, + 147, + 429, + 155 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/fe27a81931f057c6d1f006f12c7c5ed26284c02f6b524598d1e8c44d2b33ff63.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 390, + 155, + 429, + 181 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Base Classes Prompts", + "bbox": [ + 459, + 148, + 535, + 156 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/d2aa75bce5bd9a3ee1e531940ae95a48e9637d3bcbf192defbbc25d9aee16a15.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 460, + 160, + 529, + 181 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Novel Classes Prompts", + "bbox": [ + 555, + 148, + 637, + 156 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/3857159483504e5a4ed9bb802d1286fe8a5662cd650d508d701536ce51c42856.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 566, + 157, + 633, + 181 + ], + "page_idx": 4 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "Visual Latent Feature", + ":Base Text Latent Feature", + "Novel Text Latent Feature" + ], + "bbox": [ + 666, + 148, + 772, + 180 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/f8e34a843da8b4c98e94e50c8d3d4018cbe358a690827fa8e7109cccd084f81a.jpg", + "image_caption": [ + "Training Stage" + ], + "image_footnote": [], + "bbox": [ + 225, + 231, + 522, + 359 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/42fa33e5eb40ef463a3774785b03efc491194fefb5a06d6ce30845e9ee0df4d1.jpg", + "image_caption": [ + "Test Stage", + "Fig. 2: Overview of the proposed Prompt-based Variational Adapter (PVA). Left: The training framework of PVA with detailed implementations. $E_{i}$ , $D_{i}$ , $E_{t}$ and $D_{t}$ refer to visual encoder, visual decoder, text encoder, and text decoder, respectively. $z_{i}$ and $z_{t}$ represent latent features for image and text aspects, where the adapter inputs are $x$ and $t$ , respectively. $\\tilde{x}$ and $\\tilde{t}$ denote the reconstructed features. Right: Test samples are grouped into base domain or novel domain by the cosine similarity between $z_{i}$ and $z_{t}$ (including both base and novel classes), and then classified by two experts." + ], + "image_footnote": [], + "bbox": [ + 540, + 220, + 777, + 378 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "from existing methods, we explicitly reduce the prediction bias by converting the GZSL problem into a ZSL and a supervised classification task. To separate novel (or base) samples from entangled space, we learn two variational adapters to align visual and semantic features, where the text features are equipped with learnable prompts. Then, we further refine the output features of adapters to balance task-specific and general knowledge.", + "bbox": [ + 212, + 516, + 787, + 608 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 Revisiting CLIP", + "text_level": 1, + "bbox": [ + 214, + 628, + 397, + 643 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "CLIP [31] consists of two core encoders: a text encoder $\\mathcal{T}$ and a visual encoder $\\mathcal{I}$ , which are jointly trained by massive noisy image-text pairs with contrastive loss. Each encoder is implemented by either repetitive Transformer [34] or ResNet [16] blocks. Once trained, we can build a zero-shot classifier with arbitrary object names and the corresponding visual features. For example, a $N$ -way classification can be built by the similarity metric between visual features and text prompts for these classes, such as 'A photo of a [CLASS]'. Formally, the output probability of the model is:", + "bbox": [ + 212, + 652, + 787, + 772 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\np (y | x) = \\frac {\\exp (\\cos (\\mathcal {I} (x) , \\mathcal {T} (t _ {y})) / \\sigma)}{\\sum_ {n = 1} ^ {N} \\exp (\\cos (\\mathcal {I} (x) , \\mathcal {T} (t _ {n})) / \\sigma)}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 349, + 779, + 785, + 816 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\sigma$ is the temperature parameter and $y$ represents the target class.", + "bbox": [ + 214, + 824, + 733, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.3 Prompt-based Variational Adapter", + "text_level": 1, + "bbox": [ + 215, + 146, + 547, + 162 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Problem Setting. GZSL attempts to recognize novel categories by the prior knowledge transferred from the base domain (i.e., seen domain) to the novel domain (i.e., unseen domain). Here, base domain represented by $\\mathcal{D}^s = \\{(x,y,t_y)|x\\in$ $\\mathcal{X}^s,y\\in \\mathcal{Y}^s,t_y\\in \\mathcal{A}^s\\}$ , where $y$ is the class label, and $x$ and $t_y$ refer to features extracted by the visual and text encoder of CLIP, respectively. Similarly, novel domain is given by $\\mathcal{D}^u = \\{(x^u,u,t_u)|x^u\\in \\mathcal{X}^u,u\\in \\mathcal{Y}^u,t_u\\in \\mathcal{A}^u\\}$ , where $u$ refers the label of novel classes. The overall goal of GZSL is to learn $f_{GZSL}:\\mathcal{X}\\to \\mathcal{Y}^s\\cup \\mathcal{Y}^u$ , where $\\mathcal{Y}^s\\cap \\mathcal{Y}^u = \\emptyset$ .", + "bbox": [ + 212, + 171, + 789, + 292 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Learn the Prompt-based Variational Adapter. Inspired by the effectiveness of prompt learning, we also learn textual tokens instead of hand-crafted attributes. Formally, the prompts are given in the following form:", + "bbox": [ + 212, + 315, + 787, + 361 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nt = [ \\mathrm {T} ] _ {1} [ \\mathrm {T} ] _ {2} \\dots [ \\mathrm {T} ] _ {M} [ \\text {C L A S S} ], \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 375, + 785, + 388 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where each $[T]_M$ is a vector with the same dimension (e.g., 512 in CoOP [45]) and $M$ is the length of the learned prompts. Subsequently, prompts $t$ and corresponding images are fed into the frozen text and image encoders for adaption learning.", + "bbox": [ + 212, + 400, + 787, + 460 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "By forwarding the original training samples and learnable prompts from base classes, we can then build two variational adapters. Inspired by the excellent representations of Spherical Variational Autoencoder (SVAE) [10,32] on low dimensional data, we employ two SVAE as the adapters to align different modalities, while preserving the transferability of classes knowledge. To achieve this goal, we model visual and semantic distributions by vMF and treat each distribution obtained from the visual and semantic branch as prior knowledge for another to align these modalities in spherical space.", + "bbox": [ + 212, + 462, + 787, + 582 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Specifically, as shown in the left side of Fig 2, each adapter (e.g., SVAE) consists of an encoder and a decoder with inherent and cross-modal constraints. For the visual branch, we can formulate the variational optimization by:", + "bbox": [ + 212, + 582, + 787, + 628 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {v i s u a l}} ^ {s v a e} = \\mathbb {E} _ {q _ {\\delta_ {1}} (z _ {i} | x)} [ \\log p _ {\\omega_ {1}} (x \\mid z _ {i}) ] - \\mathrm {K L} \\left(q _ {\\delta_ {1}} (z _ {i} \\mid x) \\| p _ {\\omega_ {1}} (z _ {i})\\right), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 279, + 643, + 784, + 660 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where the first term refers to the reconstruction loss for visual features $x$ over latent features $z_{i}$ , and the second part denotes the distance metric between different distributions. Here $q_{\\delta_1}(z_i|x)$ represents the features encoded by the visual encoder $E_{i}$ , while $p_{\\omega_1}(x|z_i)$ comes from $D_{i}$ .", + "bbox": [ + 212, + 666, + 787, + 726 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Similarly, the text adapter can be optimized by another SVAE loss:", + "bbox": [ + 238, + 726, + 725, + 741 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {\\text {t e x t}} ^ {s v a e} = \\mathbb {E} _ {q _ {\\delta_ {2}} (z _ {t} | t)} \\left[ \\log p _ {\\omega_ {2}} (t \\mid z _ {t}) \\right] - \\mathrm {K L} \\left(q _ {\\delta_ {2}} (z _ {t} \\mid t) \\| p _ {\\omega_ {2}} (z _ {t})\\right), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 289, + 757, + 784, + 773 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $q_{\\delta_2}(z_t|t)$ and $p_{\\omega_2}(t \\mid z_t)$ denote the distribution represented by text encoder and decoder, respectively. By formulating the adapter into an SVAE style, the latent features can only depict each distribution independently. Therefore, to align the latent features of different modalities, we propose to minimize the", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "distance between them. Formally, we adopt optimal transport (Earth Mover's Distance) [35] to match visual latent distribution to text distribution by:", + "bbox": [ + 214, + 146, + 782, + 176 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {d i s} = \\inf _ {\\theta \\in \\Pi \\left(P _ {z _ {i}}, P _ {z _ {t}}\\right)} \\mathbb {E} _ {(z _ {i}, z _ {t}) \\sim \\theta} [ \\| z _ {i} - z _ {t} \\| ], \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 362, + 191, + 784, + 219 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\Pi(P_{z_i}, P_{z_t})$ denotes the joint distribution of two latent features $z_i$ and $z_t$ . With the help of $\\mathcal{L}_{dis}$ , the corresponding categories of visual and semantic features will be aligned in the latent space.", + "bbox": [ + 214, + 223, + 782, + 268 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To further ensure visual-semantic alignment, we introduce cross-domain constraints for both visual and semantic adapters. Specifically, given the latent representation $z_{i}$ and $z_{t}$ , we reconstruct the representation by another decoders:", + "bbox": [ + 214, + 270, + 782, + 315 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {c r} = \\mathbb {E} \\left[ | | t - D _ {t} \\left(z _ {i}\\right) | | _ {2} \\right] + \\mathbb {E} \\left[ | | x - D _ {i} \\left(z _ {t}\\right) | | _ {2} \\right], \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 344, + 330, + 784, + 347 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $D_{t}(z_{i})$ and $D_{i}(z_{t})$ are regarded as cross-domain representations.", + "bbox": [ + 214, + 349, + 720, + 364 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Although Eqs. (3) (4) (5) (6) align latent representations in a shared space by SVAE and cross-domain constraints, they still suffer from the lack of any class-wise knowledge, which could lead to feature confusion. To reduce the feature confusion, we propose to adopt dual classification loss (DCL):", + "bbox": [ + 214, + 366, + 782, + 426 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {c l s} = \\underbrace {\\mathbb {E} _ {t} \\left[ \\log p _ {\\phi_ {c l s} ^ {p l}} (y | x) \\right]} _ {\\mathcal {L} _ {c l s} ^ {p l}} + \\underbrace {\\mathbb {E} \\left[ \\log p _ {\\phi_ {c l s} ^ {l a}} (y | z _ {t}) \\right] + \\mathbb {E} \\left[ \\log p _ {\\phi_ {c l s} ^ {l a}} (y | z _ {i}) \\right]} _ {\\mathcal {L} _ {c l s} ^ {l a}}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 282, + 441, + 784, + 484 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathcal{L}_{cls}^{pl}$ and $\\mathcal{L}_{cls}^{la}$ tend to perform classification constraints in instance-level and latent-level, respectively. For the instance-level, the proposed PVA learns task-specific knowledge with training samples $p_{\\phi_{cls}^{pl}}(y|\\boldsymbol{x}) = \\frac{\\exp(\\cos(\\mathcal{I}(\\boldsymbol{x}),\\mathcal{T}(t_y)) / \\sigma)}{\\sum\\exp(\\cos(\\mathcal{I}(\\boldsymbol{x}),\\mathcal{T}(t_n)) / \\sigma)}$ where $y$ and $\\mathcal{T}(t_y)$ represent the class labels and semantic features mentioned in Eq. (2). Based on the end-to-end training paradigm, the discrimination of text features can be preserved. For the latent level, the softmax classifier $\\phi_{cls}^{la}$ is trained using latent features and corresponding labels to ensure the decision boundary is clear enough for the final classification task.", + "bbox": [ + 214, + 491, + 787, + 616 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As previously illustrated, we develop the overall training process with SVAE, cross-domain, and DCL classification loss:", + "bbox": [ + 214, + 617, + 782, + 646 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {L} _ {S V A E} + \\alpha \\mathcal {L} _ {d i s} + \\beta \\mathcal {L} _ {c r} + \\gamma \\mathcal {L} _ {c l s}, \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 664, + 784, + 678 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\mathcal{L}_{SVAE} = \\mathcal{L}_{visual}^{svae} + \\mathcal{L}_{text}^{svae}$ and $\\alpha, \\beta, \\gamma$ are hyper parameters.", + "bbox": [ + 214, + 683, + 692, + 699 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Separate Novel Classes from Base Classes. Following the training stage, both the visual and semantic latent features are well represented. Thus, novel samples entangled with base samples can be easily separated from the test space using distance comparisons. Specifically, as shown on the right side of Fig. 2, we measure the distance between test samples and learned prompts equipped with the [CLASS] token by:", + "bbox": [ + 214, + 719, + 782, + 809 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\nd i s t a n c e = \\cos \\left(z _ {i} ^ {t e}, z _ {t}\\right), \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 419, + 825, + 782, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 418, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\cos(,)$ denotes the cosine similarity. $z_i^{te} = E_i(x^{te})$ denotes the latent features encoded from test visual features, which may come from base or novel domains. $z_t = [z_t^b, z_t^n]$ contain the latent text features of all the classes (i.e., base and novel), where [,] denotes concatenate operation for the latent prompts of base and novel domains. Intuitively, if the test sample belongs to a novel domain, the distance $\\cos(z_i^{te}, z_t^n)$ would be closer than $\\cos(z_i^{te}, z_t^b)$ .", + "bbox": [ + 212, + 146, + 787, + 237 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "By leveraging the distance metric, we can assign domain labels by:", + "bbox": [ + 238, + 238, + 720, + 252 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nL = \\left\\{ \\begin{array}{l} B a s e, \\max \\left\\{c o s \\left(z _ {i} ^ {t e}, z _ {t} ^ {b}\\right) \\mid \\forall t \\in \\mathcal {A} _ {s} \\right\\} \\geq t h r e s h o l d \\\\ N o v e l, \\max \\left\\{c o s \\left(z _ {i} ^ {t e}, z _ {t} ^ {b}\\right) \\mid \\forall t \\in \\mathcal {A} _ {s} \\right\\} < t h r e s h o l d \\end{array} \\right\\}. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 289, + 266, + 785, + 301 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Here, we alternate the hand-crafted threshold with the base knowledge to fit different datasets and reduce complexity. In practice, we propose to automatically calculate the threshold by $\\tau$ , where $\\tau = \\frac{\\text{count}(d^j > \\text{threshold})}{N}$ . $d^j$ is the maximum distance between $j$ -th training samples and learned prompts, and $N$ is the number of all training samples. The larger the value $\\tau$ is, the smaller the threshold becomes, meaning that more samples are divided into base classes. Then we only need to choose a suitable $\\tau \\in [0,1]$ to balance the data separation.", + "bbox": [ + 212, + 306, + 787, + 417 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/e09fff83c686f97bbaf92d0f4dc14968e7854c02694848f50e08403c391d2e4b.jpg", + "image_caption": [ + "Fig. 3: The architecture of the Visual and Semantic Refinement modules." + ], + "image_footnote": [], + "bbox": [ + 401, + 445, + 602, + 606 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Fine-tuning for GZSL Classification. When detecting based on the proposed distance, the domain for these test samples is accurately assigned. Although the challenging GZSL task can be converted into a traditional ZSL and a supervised task, how to recognize novel classes is also a tricky problem. To improve the transfer of general knowledge for novel classes, we further refine the output feature of the learned adapters with the original zero-shot features via a residual connection. As shown in the Fig. 2 and Fig. 3, we refine the final output of adapters by $t^{*} = \\epsilon \\cdot \\tilde{t} + (1 - \\epsilon) \\cdot t$ and $x^{*} = \\epsilon \\cdot \\tilde{x} + (1 - \\epsilon) \\cdot x$ . Since CLIP is obtained by massive image-text pairs that are not limited to the current samples, the features of the original encoder are easier to transfer. Based on the", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "complement of stored knowledge from CLIP and task-specific knowledge from adapters, we can thus improve the transferability of the PVA.", + "bbox": [ + 215, + 146, + 784, + 176 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 202, + 374, + 219 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Setup", + "text_level": 1, + "bbox": [ + 215, + 236, + 310, + 252 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets and Setting. For the GZSC and CDT tasks, the datasets include two coarse-grained datasets, i.e., AwA2 [12] and SUN [30], and two fine-grained datasets i.e., CUB [36] and FLO [29], containing 50, 717, 200, and 102 categories, respectively. It is worth noting that due to space limitations, we only report the results for popular AwA2, CUB, and SUN in Table 1. The performance is evaluated by the harmonic mean of the average per class Top-1 accuracy: $\\mathbf{H} = 2*\\mathbf{B}*\\mathbf{N} / (\\mathbf{B} + \\mathbf{N})$ , where $\\mathbf{B}$ and $\\mathbf{N}$ represent the performance of base and novel classes, respectively. To further explore the knowledge transferability of the proposed method, we follow CoCoOP [44] to test the generalization performance of the trained model for other datasets. Specifically, we first train the PVA on AwA2, which is regarded as a source dataset. Then we compare the performance which is tested on the remaining three datasets without fine-tuning.", + "bbox": [ + 215, + 263, + 785, + 445 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Implementation details. The proposed PVA is comprised of two sub-models: a visual adapter and a text adapter. Each adapter consists of an encoder and a decoder implemented by two-layer FC networks with 256 hidden units and ReLU. The input of the adapters comes from the frozen CLIP (ViT-B/16 [11,23]) encoder with 512 dimensions. The latent feature dimension is set to 16 for all these datasets. For the prompts, the learnable parameters length $M = 4$ . We train our proposed PVA by Adam optimizer with a 1e-4 learning rate. We select $\\alpha = 0.1$ , $\\beta = 1$ , and $\\gamma = 1$ as hyperparameters, while $\\tau$ and $\\epsilon$ are discussed in the following section.", + "bbox": [ + 215, + 470, + 785, + 606 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Comparisons with SOTA", + "text_level": 1, + "bbox": [ + 215, + 631, + 465, + 645 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Generalized Zero-Shot Classification. We partition existing methods into three paradigms to compare the GZSL performance in Table. 1. Specifically, our method achieves the best harmonic mean of $90.7\\%$ and $65.8\\%$ on AwA2 and SUN, respectively. Although we observe a slightly lower result on CUB than PSVMA [23], our method still achieves competitive results without requiring manually designed attributes. Compared to the popular VLMs-based method CoOP [45], our method achieves a $15.3\\%$ improvement on the $\\mathbf{N}$ metric of AwA2, indicating the effectiveness of the proposed PVA for reducing prediction bias. CoOP achieves worse $\\mathbf{N}$ than the original CLIP, which indicates that existing fine-tuned methods indeed suffer from feature confusion of novel classes, resulting in worse transferability. Notably, the proposed PVA not only improves the performance of novel classes but also ensures the discriminative property of base classes by", + "bbox": [ + 215, + 657, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/d657533c75a1ae44d788d2d2ee7afc063a8bdd90ec858a0b92771ddaade371eb.jpg", + "table_caption": [ + "Table 1: GZSC performance (\\%) comparisons on three popular benchmarks. E, G and C represent Embedding, Generative, and Calibration methods, respectively. The best results and second best results are marked by bold and underline. PVA+R denotes the proposed method equipped with refinement modules. “†” denotes that the methods are implemented by ViT [11] networks." + ], + "table_footnote": [], + "table_body": "
MethodsParadigmAwA2CUBSUN
BNHBNHBNH
DVBE [26]70.863.667.060.253.256.537.245.040.7
GEM [24]77.564.870.677.164.870.435.738.136.9
TransZero [4]82.361.370.268.369.368.833.452.640.8
MSDN [5]74.562.067.767.568.768.134.252.241.3
I2MVFomer [27]79.675.777.659.942.549.7---
DUET [9]†E84.763.772.772.862.967.545.845.745.8
PSVMA [23]†77.373.675.477.870.173.845.361.752.3
CLIP [31]†92.986.689.655.154.955.040.249.444.3
CoOP [45]†95.372.782.563.849.255.649.353.551.3
SHIP [37]†94.484.189.058.955.357.1---
f-VAEGAN [40]70.657.663.560.148.453.638.045.141.3
TF-VAEGAN [28]75.159.866.664.752.858.140.745.643.0
CEZSL [15]78.663.170.066.863.965.338.648.843.1
FREE [6]G75.460.467.159.955.757.737.247.441.7
HSVA [7]76.659.366.858.352.755.339.048.643.3
ICCE [20]82.365.372.865.567.366.4---
CS [3]77.85.911.063.812.621.0---
COSMO [2]---60.541.048.940.235.337.6
OOD [8]75.955.664.250.249.549.833.941.737.0
GatingAE [21]C81.360.369.358.155.456.738.145.341.4
PVA (Ours)92.788.090.378.562.569.663.466.364.8
PVA+R (Ours)93.688.090.779.665.772.062.569.565.8
", + "bbox": [ + 225, + 226, + 785, + 527 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "separating novel and base domains. For instance, our method achieves the best B of $79.6\\%$ and $63.4\\%$ on the CUB and SUN datasets, respectively.", + "bbox": [ + 215, + 558, + 784, + 588 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In addition, the calibration-based method, i.e., GatingAE [21] focuses on data separation while ignoring the model's transferability. In contrast, we model the entire process in an adapter-style tuning fashion to consider knowledge transfer. Intuitively, it can be seen from the last two rows that the proposed refinement networks further improve the $\\mathbf{N}$ results of $3.2\\%$ on both CUB and SUN. This indicates that general knowledge should indeed be introduced by refinement networks to enhance the transferability of the model.", + "bbox": [ + 215, + 589, + 785, + 693 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Cross-dataset Transfer Learning. To further evaluate the generalization ability of the model in an open-world setting, we report cross-dataset transfer learning performance in Table 2. Specifically, we train the model on AwA2 base classes and then test the performance on three target datasets. Since all target samples are test-only, we rename the original splits for base and novel classes to Subset1 (Sub1) and Subset2 (Sub2), respectively. As shown in the table, CoOP [45] is even worse than CLIP as it suffers from an overfitting problem for base classes. In contrast, by combining the prompt learning and adapter", + "bbox": [ + 215, + 718, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/08d4ee9f470f1335617365eff3800a4abb8fb1ded99fa6b39a18e7655e1f689c.jpg", + "table_caption": [ + "Table 2: Cross-dataset transfer performance (%) comparisons on three popular benchmarks. The model is trained on AwA2 and then applied to target datasets. Sub1 and Sub2 represent data splits with different classes. $\\triangle$ denotes PVA's gain over CoOP." + ], + "table_footnote": [], + "table_body": "
MethodsAwA2 → CUBAwA2 → SUNAwA2 → FLO
Sub1Sub2HSub1Sub2HSub1Sub2H
CLIP [31]54.855.255.040.241.440.867.965.666.7
CoOP [45]50.853.552.144.637.540.768.166.367.2
PVA+R (Ours)56.855.556.144.938.041.171.268.669.8
△+6.0+2.0+4.0+0.3+0.5+0.4+3.1+2.3+2.6
", + "bbox": [ + 223, + 198, + 785, + 285 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/5730b980e35fcab4e1764306ed7524d4c4ea7ef5842327927b3e0ad80bba324c.jpg", + "table_caption": [ + "Table 3: Ablation study of the proposed PVA. We highlight the $\\mathrm{PVA + R}$ variants of our methods with a light blue background." + ], + "table_footnote": [], + "table_body": "
LdisLclsLcrεAwA2CUB
BNHBNH
✓89.252.966.467.713.522.5
✓✓90.183.486.672.161.066.1
✓✓✓92.788.090.378.562.569.6
✓✓✓0.191.788.990.373.765.069.0
✓✓✓0.592.488.990.672.265.968.9
✓✓✓0.993.688.090.779.664.771.4
", + "bbox": [ + 225, + 367, + 504, + 454 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/cd805d02e30f71291c85f389bb1084aebda46ec01a3bed937581093e7acc967c.jpg", + "table_caption": [ + "Table 4: Ablation study of the domain detection. FPR denotes the False Positive Rate (in %) on the threshold that yields $95\\%$ TPR." + ], + "table_footnote": [], + "table_body": "
LdisLclsLcrCUBSUN
FPR ↓AUC ↑FPR ↓AUC ↑
✓77.176.289.062.6
✓✓10.598.066.387.2
✓✓✓2.699.211.397.8
MAX-3 [17]79.673.492.361.0
OOD [8]85.071.288.863.1
COSMO [2]72.082.077.577.7
", + "bbox": [ + 527, + 366, + 779, + 454 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "tuning, PVA+R outperforms CoOP by $4.0\\%$ , $0.4\\%$ , and $2.6\\%$ on CUB, SUN, and FLO, respectively. Additionally, it is more interesting to look backward to Table. 1, the performance on CUB observed by traditional generative methods, such as F-VAEGAN [40] and HSVA [7] is even inferior to PVA+R transferred from AwA2. This also demonstrates that our prompt-adapter hybrid framework can be extended to a variety of downstream tasks.", + "bbox": [ + 212, + 482, + 787, + 575 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.3 Ablation Study", + "text_level": 1, + "bbox": [ + 214, + 595, + 388, + 611 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Different Constraints. To give a clear insight into each constraint, we conduct a series of ablation experiments. As shown in Table. 3, the performance gradually improves as we incorporate $\\mathcal{L}_{dis}$ , $\\mathcal{L}_{cls}$ and $\\mathcal{L}_{cr}$ into the original baseline. It is worth noting that we observe significant improvements when $\\mathcal{L}_{cls}$ is added. This is because classification constraints can help models learn discriminative and reasonable prompts while ensuring class-wise alignments for visual and semantic branches. Unlike the changing trend of the above constraints, PVA+R achieves more stable yet high results across various $\\epsilon$ , indicating that refinement processes balance general and task-specific knowledge to improve overall performance.", + "bbox": [ + 212, + 619, + 787, + 758 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Data Separation. To further explore the results of feature separation, we report the binary classification results. As shown in Table. 4, we observe that the AUC raises with the help of $\\mathcal{L}_{cls}$ and $\\mathcal{L}_{cr}$ , maintaining the same trend as $\\mathbf{H}$ shown in Table. 3. In addition, PVA exhibits much stronger domain detection", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/f8074b305c8e71acb0c5ac0bfd6e622246f38f872aca8a5c1684fb429ca63cb3.jpg", + "image_caption": [ + "Fig. 4: (a) ROC curves on four benchmarks. (b) GZSL performance (N and H) on AwA2 with different $\\tau$ . (c) Comparisons between different feature extractors on AwA2. We replace original Res101 [16] based TF-VAE [28] with CLIP features, termed TF-VAE+CLIP." + ], + "image_footnote": [], + "bbox": [ + 230, + 143, + 405, + 287 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/c6f53fa1798d8b46927d60dac426bf81cc6e9449ac4f53ec481453078547b067.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 411, + 143, + 586, + 287 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/a2986ccec49925b9e9db6545ff447725be47f30254a6a1c83f488183fb1b6755.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 594, + 143, + 771, + 279 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/0ccd847c6b658f6146b493818bd85b07f8b263f9b962deac88617857b48e55e1.jpg", + "table_caption": [ + "Table 5: Effectiveness analysis of variational adapter and alternatives. w/ and w/o represent with and without respectively. DS is the abbreviation of Data Separation. $\\triangle$ represents the gain over the second-best results." + ], + "table_footnote": [], + "table_body": "
MethodsAwA2CUBSUNFLO
BNHBNHBNHBNH
MLP w/o DS95.376.885.060.354.157.051.252.751.971.868.970.3
MLP w/ DS92.869.079.170.362.166.653.166.859.188.272.879.8
VAE w/ DS93.688.090.779.665.772.062.569.565.892.172.180.9
△-1.7+11.2+5.7+9.3+3.6+5.4+9.4+2.7+6.7+3.9-0.7+1.1
", + "bbox": [ + 222, + 425, + 787, + 497 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "ability than other related methods, leading to pleasing performance. We draw the ROC curves in Fig. 4(a) to report detection results for these datasets, where all AUCs are greater than $96\\%$ . This also indicates that novel samples can be effectively separated from entangled base samples by well-trained latent features of adapters. In addition, we believe that the performance of data separation is important because if the domain cannot be accurately distinguished, it will directly affect the classification results and even have negative effects.", + "bbox": [ + 212, + 526, + 787, + 632 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Furthermore, we report quantitative analysis between other related methods and the proposed PVA in the lower half of Table. 4. It can be seen that these methods fail to accurately classify entangled features at the domain level, which is consistent with the results in Table. 1.", + "bbox": [ + 212, + 632, + 787, + 693 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Analysis of Variational Adapter. We evaluate the effects of different adapter structures. As shown in Table. 5, we first adopt MLPs as the adapter to fine-tune on four datasets. It can be seen that the performance of the novel class decreases significantly in MLPs w/o DS. This is because MLPs fail to learn transferable knowledge due to the simple structures. Although MLP w/ DS shows considerable improvements of H on CUB(9.6%), SUN(7.2%), and FLO (9.5%) with domain detection, it still suffers from unstable performance. For example, the harmonic mean drops from 85.0% to 79.1% on AwA2 after domain detection.", + "bbox": [ + 212, + 718, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/2dd4024e09bb6639c29d8f4833796477d7a48f9ca5f5b30a98bd26f6ddd3f44a.jpg", + "image_caption": [ + "Fig. 5: t-SNE visualizations [25] of learnable prompts and visual features with (w/) Visual and Semantic adapters. Grey and black triangles denote the base and novel prototype, respectively. Color stars denote novel visual features. (Best viewed in color)" + ], + "image_footnote": [], + "bbox": [ + 223, + 143, + 359, + 270 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/27bdfd60be8ed1e72a2424aba310226974f48b0c79bf800a75c0c2c7ac145941.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 362, + 145, + 500, + 270 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/ee7405e2b9fd123408a0562fc85b4e91063053f10e53e58e742e54e1b1b0e3f1.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 501, + 145, + 637, + 270 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/405bcbc115dbc6788259d3c5885e3c6ee6965cc72272b937d5c463d2a72d6602.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 640, + 145, + 776, + 270 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/8c0edaaad42356e5875d3461e7858ec10d03b67e9a341b92cd37fe28453a13f2.jpg", + "image_caption": [ + "Fig. 6: t-SNE visualizations of latent features for AwA2, CUB and FLO. Grey dots represent base features and blue dots represent novel ones." + ], + "image_footnote": [], + "bbox": [ + 282, + 338, + 406, + 453 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/a2d633cdda08f2fdd33b78c69344479f6afd66d4e4ce96d81698f14cb4ba0d10.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 436, + 338, + 571, + 453 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/8e8a8a21b1241ed9d1dc55f91fe134575761950df08e9db59f8120da61073308.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 593, + 338, + 720, + 453 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/a208282314239fe127dba415060a86eda02fbee46a1d52bedaadd27a95fc243c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 431, + 462, + 571, + 474 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We speculate that plain MLPs can not sufficiently align vision-language modality in latent space, resulting in poor domain classification. However, the proposed variational adapters capture discriminative yet transferable information for both latent and output features to ensure the performance of domain detection and classification.", + "bbox": [ + 212, + 545, + 784, + 619 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Sensitivity and Backbones. Fig. 4(b) shows the sensitivity of $\\tau$ . The performance of $\\mathbf{N}$ maintains stable at first and then decreases sharply when $\\tau \\geq 0.99$ . The reason for this observation is that the larger $\\tau$ tends to classify more samples into base classes, resulting in lower $\\mathbf{N}$ . The descent speed of $\\mathbf{H}$ is less than $\\mathbf{N}$ , for the performance of $\\mathbf{B}$ improves as $\\tau$ increases. In our experiments, we set $\\tau = 0.95$ for all the datasets.", + "bbox": [ + 212, + 643, + 784, + 733 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We evaluate the influence of different backbones for fair comparisons. As shown in Fig. 4(c), when we applied CLIP features to existing generative methods such as TF-VAE [28], we did not observe improvements, which are brought by high-quality representations. We speculate that the features extracted from VLMs are discriminative enough for classification, while they do not require additional complex optimization. Different from simple combinations between off-the-shelf methods and CLIP features, we fine-tune the VLMs in a prompt-", + "bbox": [ + 212, + 734, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "adapter hybrid fashion to guide feature optimization, leading to superior performance.", + "bbox": [ + 215, + 146, + 784, + 175 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "4.4 Visualization", + "text_level": 1, + "bbox": [ + 215, + 199, + 370, + 213 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Visualizations for Visual and Semantic Features. To show the distribution, we visualize them by t-SNE [25] in Fig. 5. By comparing Fig. 5(a) and Fig. 5(b), we can find that the learnable prompts exhibit a higher degree of dispersion. These learnable prompts capture task-specific knowledge from training samples to improve classification performance. Further, we explore the visual and semantic embedding fine-tuned by the proposed variational adapter. From Fig. 5(c) to Fig. 5(d), we can see that visual adapters tend to learn a more intensive distribution for each class to preserve intra-class information, while semantic adapter refines the corresponding relationship between vision and semantic modalities. By incorporating prompt learning and adapter-style tuning into a unified framework, PVA gives a reasonable solution for downstream task generalization.", + "bbox": [ + 215, + 224, + 785, + 404 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Visualizations for latent Features. We visualize the latent features of both base and novel classes in Fig. 6. It can be seen that blue dots are located in gaps of gray dots with clear boundaries. Thus, we can separate these novel samples by cosine similarity. Although most of the novel samples can be accurately separated, some samples are also misclassified due to feature confusion. This is coincident with the results of Fig. 4(a).", + "bbox": [ + 215, + 428, + 785, + 518 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 542, + 359, + 556 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we provide a Prompt-Adapter hybrid method PVA to handle the feature confusion problem caused by unbalanced fine-tuning. In general, we fine-tune the corresponding variational adapters for visual and language branches by aligning latent representations of them, where the input of the language adapter is the learnable textual tokens. In addition, we refine adapter output features with global features stored in the original CLIP to improve knowledge transfer. Once trained, we can build two independent classification tasks by similarity metrics. We show that the proposed PVA can achieve state-of-the-art performance on GZSC and challenging CDT tasks. Considering limitations, although PVA achieves remarkable results, it requires additional training costs, which we aim to alleviate in the future.", + "bbox": [ + 215, + 573, + 785, + 739 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgment", + "text_level": 1, + "bbox": [ + 217, + 143, + 382, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This research was supported in part by NSFC (12326608, U19B2043, 62441602), National Science Foundation for Distinguished Young Scholars under Grant 62225605, Zhejiang Provincial Natural Science Foundation of China under Grant LD24F020016, the Key R&D Program of Zhejiang Province, China 2023C01043, Science and Technology Innovation of Ningbo (2023Z236, 2024Z294), and the Fundamental Research Funds for the Central Universities.", + "bbox": [ + 212, + 179, + 787, + 270 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 297, + 321, + 313 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Akata, Z., Perronnin, F., Harchaoui, Z., Schmid, C.: Label-embedding for attribute-based classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 819-826 (2013)", + "2. Atzmon, Y., Chechik, G.: Adaptive confidence smoothing for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11671-11680 (2019)", + "3. Chao, W.L., Changpinyo, S., Gong, B., Sha, F.: An empirical study and analysis of generalized zero-shot learning for object recognition in the wild. In: Proceedings of the European Conference on Computer Vision. pp. 52-68. Springer (2016)", + "4. Chen, S., Hong, Z., Liu, Y., Xie, G.S., Sun, B., Li, H., Peng, Q., Lu, K., You, X.: Transzero: Attribute-guided transformer for zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 330-338 (2022)", + "5. Chen, S., Hong, Z., Xie, G.S., Yang, W., Peng, Q., Wang, K., Zhao, J., You, X.: Msdn: Mutually semantic distillation network for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7612-7621 (2022)", + "6. Chen, S., Wang, W., Xia, B., Peng, Q., You, X., Zheng, F., Shao, L.: Free: Feature refinement for generalized zero-shot learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 122-131 (2021)", + "7. Chen, S., Xie, G., Liu, Y., Peng, Q., Sun, B., Li, H., You, X., Shao, L.: Hsva: Hierarchical semantic-visual adaptation for zero-shot learning. Proceedings of the Advances in Neural Information Processing Systems 34, 16622-16634 (2021)", + "8. Chen, X., Lan, X., Sun, F., Zheng, N.: A boundary based out-of-distribution classifier for generalized zero-shot learning. arXiv preprint arXiv:2008.04872 (2020)", + "9. Chen, Z., Huang, Y., Chen, J., Geng, Y., Zhang, W., Fang, Y., Pan, J.Z., Chen, H.: Duet: Cross-modal semantic grounding for contrastive zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 405-413 (2023)", + "10. Davidson, T.R., Falorsi, L., De Cao, N., Kipf, T., Tomczak, J.M.: Hyperspherical variational auto-encoders. arXiv preprint arXiv:1804.00891 (2018)", + "11. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)", + "12. Farhadi, A., Endres, I., Hoiem, D., Forsyth, D.: Describing objects by their attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1778-1785 (2009)" + ], + "bbox": [ + 218, + 332, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "13. Gao, P., Geng, S., Zhang, R., Ma, T., Fang, R., Zhang, Y., Li, H., Qiao, Y.: Clip-adapter: Better vision-language models with feature adapters. International Journal of Computer Vision pp. 1-15 (2023)", + "14. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Proceedings of the Advances in Neural Information Processing Systems. pp. 2672-2680 (2014)", + "15. Han, Z., Fu, Z., Chen, S., Yang, J.: Contrastive embedding for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2371-2381 (2021)", + "16. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016)", + "17. Hendrycks, D., Gimpel, K.: A baseline for detecting misclassified and out-of-distribution examples in neural networks. arXiv preprint arXiv:1610.02136 (2016)", + "18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: Proceedings of the International Conference on Machine Learning. pp. 4904-4916 (2021)", + "19. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023)", + "20. Kong, X., Gao, Z., Li, X., Hong, M., Liu, J., Wang, C., Xie, Y., Qu, Y.: Encompactness: Self-distillation embedding & contrastive generation for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9306-9315 (2022)", + "21. Kwon, G., Al Regib, G.: A gating model for bias calibration in generalized zero-shot learning. IEEE Transactions on Image Processing (2022)", + "22. Li, X., Xu, Z., Wei, K., Deng, C.: Generalized zero-shot learning via disentangled representation. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 1966-1974 (2021)", + "23. Liu, M., Li, F., Zhang, C., Wei, Y., Bai, H., Zhao, Y.: Progressive semantic-visual mutual adaption for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15337-15346 (2023)", + "24. Liu, Y., Zhou, L., Bai, X., Huang, Y., Gu, L., Zhou, J., Harada, T.: Goal-oriented gaze estimation for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3794-3803 (2021)", + "25. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(11) (2008)", + "26. Min, S., Yao, H., Xie, H., Wang, C., Zha, Z.J., Zhang, Y.: Domain-aware visual bias eliminating for generalized zero-shot learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 12664-12673 (2020)", + "27. Naeem, M.F., Khan, M.G.Z.A., Xian, Y., Afzal, M.Z., Stricker, D., Van Gool, L., Tombari, F.: I2mvformer: Large language model generated multi-view document supervision for zero-shot image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15169-15179 (2023)", + "28. Narayan, S., Gupta, A., Khan, F.S., Snoek, C.G., Shao, L.: Latent embedding feedback and discriminative features for zero-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 479-495. Springer (2020)" + ], + "bbox": [ + 215, + 146, + 785, + 840 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Z. Lu et al.", + "bbox": [ + 271, + 114, + 349, + 127 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "29. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: Indian Conference on Computer Vision, Graphics & Image Processing. pp. 722-729 (2008)", + "30. Patterson, G., Hays, J.: Sun attribute database: Discovering, annotating, and recognizing scene attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2751-2758 (2012)", + "31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763 (2021)", + "32. Schonfeld, E., Ebrahimi, S., Sinha, S., Darrell, T., Akata, Z.: Generalized zero-and few-shot learning via aligned variational autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8247-8255 (2019)", + "33. Su, H., Li, J., Chen, Z., Zhu, L., Lu, K.: Distinguishing unseen from seen for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7885-7894 (2022)", + "34. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. proceedings of the Advances in Neural Information Processing Systems (2017)", + "35. Villani, C., et al.: Optimal transport: old and new, vol. 338. Springer (2009)", + "36. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)", + "37. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023)", + "38. Xian, Y., Akata, Z., Sharma, G., Nguyen, Q., Hein, M., Schiele, B.: Latent embeddings for zero-shot classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 69-77 (2016)", + "39. Xian, Y., Lorenz, T., Schiele, B., Akata, Z.: Feature generating networks for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5542-5551 (2018)", + "40. Xian, Y., Sharma, S., Schiele, B., Akata, Z.: f-vaegan-d2: A feature generating framework for any-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10275-10284 (2019)", + "41. Xu, B., Zeng, Z., Lian, C., Ding, Z.: Generative mixup networks for zero-shot learning. IEEE Transactions on Neural Networks and Learning Systems (2022)", + "42. Zhang, L., Xiang, T., Gong, S.: Learning a deep embedding model for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2021-2030 (2017)", + "43. Zhang, R., Zhang, W., Fang, R., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free adaption of clip for few-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 493-510. Springer (2022)", + "44. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022)", + "45. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022)" + ], + "bbox": [ + 212, + 146, + 787, + 813 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Zero-Shot Generalization with PVA", + "bbox": [ + 419, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_model.json b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_model.json new file mode 100644 index 0000000000000000000000000000000000000000..9aa5ea3e2a4aaf2728252634e1ebe43622a5f7bc --- /dev/null +++ b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_model.json @@ -0,0 +1,2533 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.241, + 0.141, + 0.761, + 0.187 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization for CLIP with Variational Adapter" + }, + { + "type": "text", + "bbox": [ + 0.246, + 0.212, + 0.756, + 0.229 + ], + "angle": 0, + "content": "Ziqian Lu\\(^{1}\\), Fengli Shen\\(^{2}\\), Mushui Liu\\(^{1}\\), Yunlong Yu\\(^{1}\\)*, and Xi Li\\(^{1}\\)" + }, + { + "type": "text", + "bbox": [ + 0.341, + 0.24, + 0.662, + 0.254 + ], + "angle": 0, + "content": "1 Zhejiang University, Hangzhou 310007, China" + }, + { + "type": "text", + "bbox": [ + 0.234, + 0.254, + 0.768, + 0.281 + ], + "angle": 0, + "content": "\\(^{2}\\) Yangtze Delta Region Institute (Huzhou) University of Electronic Science and Technology of China, Huzhou 313001, China" + }, + { + "type": "text", + "bbox": [ + 0.335, + 0.283, + 0.668, + 0.297 + ], + "angle": 0, + "content": "{ziqianlu,1ms,yuyunlong,xilizju}@zju.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.395, + 0.298, + 0.607, + 0.31 + ], + "angle": 0, + "content": "fenglishen@csj.uestc.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.348, + 0.744, + 0.613 + ], + "angle": 0, + "content": "Abstract. The excellent generalization capability of pre-trained Vision-Language Models (VLMs) makes fine-tuning VLMs for downstream zero-shot tasks a popular choice. Despite achieving promising performance in the professionality of base classes, most existing fine-tuned methods suffer from feature confusion of novel classes, resulting in unsatisfactory transferability. To address this problem, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that explicitly reduces the prediction bias by separating base and novel samples. Specifically, we design two variational adapters with learnable textual tokens to align latent representations for each modality in a shared latent space. Once trained, we can separate novel samples from entangled space using the similarity metric of latent features, i.e., converting confusion task into two independent ones (One for base classes and the other for novel classes). Moreover, to improve the transferability for novel classes, we further refine the output features of the learned adapters with the global features via a residual connection. We conduct extensive experiments on Generalized Zero-Shot Learning and Cross-Dataset Transfer Learning to demonstrate the superiority of our approach and establish a new state-of-the-art on four popular benchmarks." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.624, + 0.741, + 0.654 + ], + "angle": 0, + "content": "Keywords: Visual-Language Models \\(\\cdot\\) Zero-Shot Generalization \\(\\cdot\\) Variational Adapter" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.679, + 0.377, + 0.695 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.71, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Recently, pre-trained Vision-Language Models (VLMs) such as CLIP [31] and ALIGN [18] have demonstrated remarkable applicability across various downstream tasks such as Zero-Shot Learning (ZSL) [1, 38]. To further boost the performance on downstream tasks, recent studies have proposed several fine-tuning methods based on the VLMs structure. In general, existing fine-tuning methods can be grouped into two lines: (1) Prompt Learning (PL) [19, 44, 45] is a paradigm that leverages a minimal set of learnable parameters, known as" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.383, + 0.841 + ], + "angle": 0, + "content": "* Corresponding author" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.127 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "image", + "bbox": [ + 0.341, + 0.145, + 0.637, + 0.27 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.402, + 0.27, + 0.624, + 0.282 + ], + "angle": 0, + "content": "(a) Distribution of all the classes." + }, + { + "type": "image", + "bbox": [ + 0.338, + 0.283, + 0.668, + 0.405 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.278, + 0.406, + 0.489, + 0.419 + ], + "angle": 0, + "content": "(b) Distribution of base classes." + }, + { + "type": "image_caption", + "bbox": [ + 0.508, + 0.406, + 0.722, + 0.42 + ], + "angle": 0, + "content": "(c) Distribution of novel classes." + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.43, + 0.788, + 0.487 + ], + "angle": 0, + "content": "Fig. 1: t-SNE visualization of AWA2 dataset with CoOP [45]. The color and grey pentagrams represent novel and base samples, respectively. (a) There is obvious overlap and confusion in the distribution of bobcat, tiger, and leopard. (b-c) The confusion issue could be efficiently addressed if the two class sets were meticulously segregated." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.52, + 0.788, + 0.595 + ], + "angle": 0, + "content": "prompts, to efficiently adapt pre-trained models to the downstream tasks in a data-efficient manner while maintaining competitive performance. (2) Adapter-style Tuning (AT) [13, 43] involves introducing adapter layers or modules into the pre-trained models, allowing only these adapter layers to be updated during fine-tuning while the rest of the models' parameters remain frozen." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.788, + 0.732 + ], + "angle": 0, + "content": "However, both PL and AT paradigms only fine-tune VLMs on base classes, resulting in extreme prediction bias towards base classes. This bias is exacerbated in challenging open-world vision tasks (e.g., Generalized Zero-Shot Learning, GZSL [5,22,39]) due to the feature confusion. As shown in Fig. 1(a), the novel samples (color pentagrams) are located around the base samples (grey pentagrams) owing to the lack of prior knowledge of the former. These fine-tuning methods trained on unbalanced base data may tend to classify all samples into base classes and struggle to generalize to novel classes, reducing their transferability." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.842 + ], + "angle": 0, + "content": "To this end, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that improves both the professionality and transferability of the VLMs model. Inspired by previous PL work, we learn task-specific textual tokens instead of subjective hand-crafted attributes. Compared to the static attributes, these learnable prompts can not only capture more discriminative information but also provide better diversity for subsequent adaptation learning. Then, two variational adapters are constructed to generate latent repre" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.297 + ], + "angle": 0, + "content": "sentations in a shared latent space, in which we adopt class-wise and distributionwise vision-language constraints to ensure alignment and interaction properties for each branch. With the help of variational structures, adapters carefully align multi-modal features in redundancy-free latent space, providing accurate visual-semantic interactions. After that, we can search for a threshold to distinguish the base and novel domains by measuring the similarity between the latent representations of the two domains. Based on the similarity, GZSL can thus be converted into a base class classification and a zero-shot task of novel classes, as shown in Fig. 1(b-c). Once base and novel samples are distinguished, the prediction bias problem will naturally be addressed." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.785, + 0.463 + ], + "angle": 0, + "content": "In addition, even if the test spaces are accurately distinguished, how to classify novel samples remains a challenging task. Thus, we further refine the output feature of the learned adapters with the global features (extracted from the original CLIP encoder) via a residual connection to improve the transferability. Benefiting from residual connection, variational adapters can fully exploit the transferable general knowledge stored in the original CLIP and freshly learned knowledge originated from training samples. In fact, different from existing methods that train an extra binary classifier to distinguish domains, we efficiently model the entire process (i.e., data separation and classification) in a unified Prompt-Adapter hybrid framework to simultaneously preserve the professionalism and transferability of the VLMs model." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.465, + 0.534, + 0.479 + ], + "angle": 0, + "content": "In summary, our main contributions are:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.489, + 0.791, + 0.564 + ], + "angle": 0, + "content": "- We introduce a novel approach, the Prompt-based Variational Adapter (PVA), specifically designed to address the challenges of GZSL. To the best of our knowledge, our method marks the inaugural exploration of the synergy between PL and AT in the context of fine-tuning CLIP models, offering a novel and effective solution to this complex task." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.565, + 0.785, + 0.653 + ], + "angle": 0, + "content": "- We propose to utilize the latent representations of the adapter, which are tightly governed by the vision-language distribution, to distinguish novel classes from base classes. By segmenting the entire test space into two distinct and independent subspaces, the prediction bias that typically favors base classes is explicitly mitigated, thereby enhancing the accuracy and fairness of the classification process." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.655, + 0.785, + 0.729 + ], + "angle": 0, + "content": "- Our experimental results demonstrate that the proposed PVA achieves state-of-the-art performance across a wide range of downstream tasks, including GZSL and Cross-Dataset transfer learning. Notably, PVA exhibits significant improvements in recognizing novel classes, showcasing its effectiveness in addressing the inherent challenges of these tasks." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.489, + 0.791, + 0.729 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.753, + 0.388, + 0.769 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.785, + 0.525, + 0.801 + ], + "angle": 0, + "content": "2.1 Generalized Zero-Shot Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.784, + 0.84 + ], + "angle": 0, + "content": "How to recognize objects in an open-world visual environment has attracted increasing interest in recent years. GZSL [5,22,23,39] is one of the relevant research" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.128 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.373 + ], + "angle": 0, + "content": "fields focusing on open-world visual tasks. Specifically, GZSL aims to recognize both base and novel objects, relying solely on labeled samples from the base classes. To achieve this goal, existing methods can be grouped into two folds: (1) Embedding-based methods [4, 23, 42], which focus on learning a visual-semantic mapping in visual, semantic or latent space for cross-modal interactions. However, a major drawback of Embedding-based methods is the prediction bias toward base classes for the lack of novel labeled data. Therefore, some researchers tend to explore feature-generation methods to reduce prediction bias. (2) Generative methods [7, 39, 41] aim to generate the visual features or prototype of the novel classes by various generative networks, such as generative adversarial networks (GANs) [14] and variational autoencoders (VAEs) [32]. Despite the promising results, these methods still require massive annotated data and semantic descriptions (e.g., sentences, hand-crafted attributes). In addition, since the generated features come from noise inputs, they usually suffer from extreme domain shift problems." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.374, + 0.788, + 0.525 + ], + "angle": 0, + "content": "Different from these existing methods, we explicitly aim to tackle the prediction bias problem by converting the GZSL into a ZSL classification task and a supervised task. One of the related methods is calibration, which has been explored in several recent works [2, 3, 8, 33]. ESZSL [3] calibrates the prediction by directly reducing the probability of base classes. COSMO [2] proposes a soft combination method without any training samples. OOD [8] and DUS [33] attempt to learn the boundary from base samples to separate novel classes from entangled space. Different from the aforementioned methods, we adopt adapter-style tuning equipped with learnable prompts based on VLMs to improve the transferability, not simply learn a domain detector." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.545, + 0.707, + 0.56 + ], + "angle": 0, + "content": "2.2 Vision-Language Models for Zero-Shot Generalization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.721 + ], + "angle": 0, + "content": "Pre-trained vision-language models (VLMs) explore the relationship between two different modalities by contrastive learning with massive noisy data. With the help of reasonable structures, these models, such as CLIP [31] and ALIGN [18] can provide excellent representations for both visual and text branches. Based on the remarkable transferability of VLMs, the researchers adopt improved methods to address downstream zero-shot generalization problems. [19,44,45] apply an efficient fine-tuning paradigm by learning representation for the specific task. [13,43] learn extra MLPs to adapt the downstream knowledge. However, these methods only consider knowledge transfer, ignoring the feature confusion that occurs in hybrid open-world spaces." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.741, + 0.332, + 0.758 + ], + "angle": 0, + "content": "3 Method" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.771, + 0.363, + 0.786 + ], + "angle": 0, + "content": "3.1 Overall idea" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Our method introduces a prompt-based variational adapter to address the prediction bias problem without sacrificing task-specific discrimination and transferability. Fig. 2 shows the overall architecture of the proposed PVA. Different" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.229, + 0.155, + 0.273, + 0.164 + ], + "angle": 0, + "content": "\\* : Frozen" + }, + { + "type": "text", + "bbox": [ + 0.232, + 0.17, + 0.283, + 0.177 + ], + "angle": 0, + "content": ": Learnable" + }, + { + "type": "text", + "bbox": [ + 0.307, + 0.148, + 0.364, + 0.155 + ], + "angle": 0, + "content": "Training Image" + }, + { + "type": "image", + "bbox": [ + 0.314, + 0.156, + 0.352, + 0.182 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.39, + 0.148, + 0.43, + 0.156 + ], + "angle": 0, + "content": "Test Image" + }, + { + "type": "image", + "bbox": [ + 0.391, + 0.156, + 0.43, + 0.182 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.46, + 0.149, + 0.537, + 0.157 + ], + "angle": 0, + "content": "Base Classes Prompts" + }, + { + "type": "image", + "bbox": [ + 0.462, + 0.161, + 0.531, + 0.182 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.556, + 0.149, + 0.638, + 0.157 + ], + "angle": 0, + "content": "Novel Classes Prompts" + }, + { + "type": "image", + "bbox": [ + 0.567, + 0.158, + 0.634, + 0.182 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.667, + 0.15, + 0.762, + 0.159 + ], + "angle": 0, + "content": "Visual Latent Feature" + }, + { + "type": "text", + "bbox": [ + 0.667, + 0.162, + 0.77, + 0.17 + ], + "angle": 0, + "content": ":Base Text Latent Feature" + }, + { + "type": "text", + "bbox": [ + 0.667, + 0.174, + 0.773, + 0.181 + ], + "angle": 0, + "content": "Novel Text Latent Feature" + }, + { + "type": "list", + "bbox": [ + 0.667, + 0.15, + 0.773, + 0.181 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.346, + 0.206, + 0.406, + 0.216 + ], + "angle": 0, + "content": "Training Stage" + }, + { + "type": "image", + "bbox": [ + 0.227, + 0.232, + 0.523, + 0.36 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.639, + 0.205, + 0.682, + 0.216 + ], + "angle": 0, + "content": "Test Stage" + }, + { + "type": "image", + "bbox": [ + 0.541, + 0.221, + 0.779, + 0.38 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.39, + 0.788, + 0.489 + ], + "angle": 0, + "content": "Fig. 2: Overview of the proposed Prompt-based Variational Adapter (PVA). Left: The training framework of PVA with detailed implementations. \\( E_{i} \\), \\( D_{i} \\), \\( E_{t} \\) and \\( D_{t} \\) refer to visual encoder, visual decoder, text encoder, and text decoder, respectively. \\( z_{i} \\) and \\( z_{t} \\) represent latent features for image and text aspects, where the adapter inputs are \\( x \\) and \\( t \\), respectively. \\( \\tilde{x} \\) and \\( \\tilde{t} \\) denote the reconstructed features. Right: Test samples are grouped into base domain or novel domain by the cosine similarity between \\( z_{i} \\) and \\( z_{t} \\) (including both base and novel classes), and then classified by two experts." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.517, + 0.788, + 0.609 + ], + "angle": 0, + "content": "from existing methods, we explicitly reduce the prediction bias by converting the GZSL problem into a ZSL and a supervised classification task. To separate novel (or base) samples from entangled space, we learn two variational adapters to align visual and semantic features, where the text features are equipped with learnable prompts. Then, we further refine the output features of adapters to balance task-specific and general knowledge." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.629, + 0.398, + 0.644 + ], + "angle": 0, + "content": "3.2 Revisiting CLIP" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.653, + 0.788, + 0.773 + ], + "angle": 0, + "content": "CLIP [31] consists of two core encoders: a text encoder \\(\\mathcal{T}\\) and a visual encoder \\(\\mathcal{I}\\), which are jointly trained by massive noisy image-text pairs with contrastive loss. Each encoder is implemented by either repetitive Transformer [34] or ResNet [16] blocks. Once trained, we can build a zero-shot classifier with arbitrary object names and the corresponding visual features. For example, a \\(N\\)-way classification can be built by the similarity metric between visual features and text prompts for these classes, such as 'A photo of a [CLASS]'. Formally, the output probability of the model is:" + }, + { + "type": "equation", + "bbox": [ + 0.351, + 0.78, + 0.786, + 0.817 + ], + "angle": 0, + "content": "\\[\np (y | x) = \\frac {\\exp (\\cos (\\mathcal {I} (x) , \\mathcal {T} (t _ {y})) / \\sigma)}{\\sum_ {n = 1} ^ {N} \\exp (\\cos (\\mathcal {I} (x) , \\mathcal {T} (t _ {n})) / \\sigma)}, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.825, + 0.735, + 0.841 + ], + "angle": 0, + "content": "where \\(\\sigma\\) is the temperature parameter and \\(y\\) represents the target class." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.128 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.549, + 0.163 + ], + "angle": 0, + "content": "3.3 Prompt-based Variational Adapter" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.172, + 0.79, + 0.294 + ], + "angle": 0, + "content": "Problem Setting. GZSL attempts to recognize novel categories by the prior knowledge transferred from the base domain (i.e., seen domain) to the novel domain (i.e., unseen domain). Here, base domain represented by \\(\\mathcal{D}^s = \\{(x,y,t_y)|x\\in\\) \\(\\mathcal{X}^s,y\\in \\mathcal{Y}^s,t_y\\in \\mathcal{A}^s\\}\\), where \\(y\\) is the class label, and \\(x\\) and \\(t_y\\) refer to features extracted by the visual and text encoder of CLIP, respectively. Similarly, novel domain is given by \\(\\mathcal{D}^u = \\{(x^u,u,t_u)|x^u\\in \\mathcal{X}^u,u\\in \\mathcal{Y}^u,t_u\\in \\mathcal{A}^u\\}\\), where \\(u\\) refers the label of novel classes. The overall goal of GZSL is to learn \\(f_{GZSL}:\\mathcal{X}\\to \\mathcal{Y}^s\\cup \\mathcal{Y}^u\\), where \\(\\mathcal{Y}^s\\cap \\mathcal{Y}^u = \\emptyset\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.316, + 0.789, + 0.362 + ], + "angle": 0, + "content": "Learn the Prompt-based Variational Adapter. Inspired by the effectiveness of prompt learning, we also learn textual tokens instead of hand-crafted attributes. Formally, the prompts are given in the following form:" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.375, + 0.786, + 0.39 + ], + "angle": 0, + "content": "\\[\nt = [ \\mathrm {T} ] _ {1} [ \\mathrm {T} ] _ {2} \\dots [ \\mathrm {T} ] _ {M} [ \\text {C L A S S} ], \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.401, + 0.789, + 0.461 + ], + "angle": 0, + "content": "where each \\([T]_M\\) is a vector with the same dimension (e.g., 512 in CoOP [45]) and \\(M\\) is the length of the learned prompts. Subsequently, prompts \\(t\\) and corresponding images are fed into the frozen text and image encoders for adaption learning." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.463, + 0.789, + 0.583 + ], + "angle": 0, + "content": "By forwarding the original training samples and learnable prompts from base classes, we can then build two variational adapters. Inspired by the excellent representations of Spherical Variational Autoencoder (SVAE) [10,32] on low dimensional data, we employ two SVAE as the adapters to align different modalities, while preserving the transferability of classes knowledge. To achieve this goal, we model visual and semantic distributions by vMF and treat each distribution obtained from the visual and semantic branch as prior knowledge for another to align these modalities in spherical space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.583, + 0.789, + 0.63 + ], + "angle": 0, + "content": "Specifically, as shown in the left side of Fig 2, each adapter (e.g., SVAE) consists of an encoder and a decoder with inherent and cross-modal constraints. For the visual branch, we can formulate the variational optimization by:" + }, + { + "type": "equation", + "bbox": [ + 0.281, + 0.644, + 0.785, + 0.661 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {v i s u a l}} ^ {s v a e} = \\mathbb {E} _ {q _ {\\delta_ {1}} (z _ {i} | x)} [ \\log p _ {\\omega_ {1}} (x \\mid z _ {i}) ] - \\mathrm {K L} \\left(q _ {\\delta_ {1}} (z _ {i} \\mid x) \\| p _ {\\omega_ {1}} (z _ {i})\\right), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.667, + 0.789, + 0.727 + ], + "angle": 0, + "content": "where the first term refers to the reconstruction loss for visual features \\( x \\) over latent features \\( z_{i} \\), and the second part denotes the distance metric between different distributions. Here \\( q_{\\delta_1}(z_i|x) \\) represents the features encoded by the visual encoder \\( E_{i} \\), while \\( p_{\\omega_1}(x|z_i) \\) comes from \\( D_{i} \\)." + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.727, + 0.727, + 0.742 + ], + "angle": 0, + "content": "Similarly, the text adapter can be optimized by another SVAE loss:" + }, + { + "type": "equation", + "bbox": [ + 0.29, + 0.758, + 0.785, + 0.774 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {\\text {t e x t}} ^ {s v a e} = \\mathbb {E} _ {q _ {\\delta_ {2}} (z _ {t} | t)} \\left[ \\log p _ {\\omega_ {2}} (t \\mid z _ {t}) \\right] - \\mathrm {K L} \\left(q _ {\\delta_ {2}} (z _ {t} \\mid t) \\| p _ {\\omega_ {2}} (z _ {t})\\right), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.789, + 0.841 + ], + "angle": 0, + "content": "where \\( q_{\\delta_2}(z_t|t) \\) and \\( p_{\\omega_2}(t \\mid z_t) \\) denote the distribution represented by text encoder and decoder, respectively. By formulating the adapter into an SVAE style, the latent features can only depict each distribution independently. Therefore, to align the latent features of different modalities, we propose to minimize the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.419, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "distance between them. Formally, we adopt optimal transport (Earth Mover's Distance) [35] to match visual latent distribution to text distribution by:" + }, + { + "type": "equation", + "bbox": [ + 0.364, + 0.193, + 0.785, + 0.22 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {d i s} = \\inf _ {\\theta \\in \\Pi \\left(P _ {z _ {i}}, P _ {z _ {t}}\\right)} \\mathbb {E} _ {(z _ {i}, z _ {t}) \\sim \\theta} [ \\| z _ {i} - z _ {t} \\| ], \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.224, + 0.784, + 0.269 + ], + "angle": 0, + "content": "where \\(\\Pi(P_{z_i}, P_{z_t})\\) denotes the joint distribution of two latent features \\(z_i\\) and \\(z_t\\). With the help of \\(\\mathcal{L}_{dis}\\), the corresponding categories of visual and semantic features will be aligned in the latent space." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.271, + 0.784, + 0.316 + ], + "angle": 0, + "content": "To further ensure visual-semantic alignment, we introduce cross-domain constraints for both visual and semantic adapters. Specifically, given the latent representation \\( z_{i} \\) and \\( z_{t} \\), we reconstruct the representation by another decoders:" + }, + { + "type": "equation", + "bbox": [ + 0.345, + 0.331, + 0.785, + 0.348 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {c r} = \\mathbb {E} \\left[ | | t - D _ {t} \\left(z _ {i}\\right) | | _ {2} \\right] + \\mathbb {E} \\left[ | | x - D _ {i} \\left(z _ {t}\\right) | | _ {2} \\right], \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.351, + 0.722, + 0.366 + ], + "angle": 0, + "content": "where \\(D_{t}(z_{i})\\) and \\(D_{i}(z_{t})\\) are regarded as cross-domain representations." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.367, + 0.784, + 0.427 + ], + "angle": 0, + "content": "Although Eqs. (3) (4) (5) (6) align latent representations in a shared space by SVAE and cross-domain constraints, they still suffer from the lack of any class-wise knowledge, which could lead to feature confusion. To reduce the feature confusion, we propose to adopt dual classification loss (DCL):" + }, + { + "type": "equation", + "bbox": [ + 0.284, + 0.443, + 0.785, + 0.486 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {c l s} = \\underbrace {\\mathbb {E} _ {t} \\left[ \\log p _ {\\phi_ {c l s} ^ {p l}} (y | x) \\right]} _ {\\mathcal {L} _ {c l s} ^ {p l}} + \\underbrace {\\mathbb {E} \\left[ \\log p _ {\\phi_ {c l s} ^ {l a}} (y | z _ {t}) \\right] + \\mathbb {E} \\left[ \\log p _ {\\phi_ {c l s} ^ {l a}} (y | z _ {i}) \\right]} _ {\\mathcal {L} _ {c l s} ^ {l a}}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.492, + 0.788, + 0.617 + ], + "angle": 0, + "content": "where \\(\\mathcal{L}_{cls}^{pl}\\) and \\(\\mathcal{L}_{cls}^{la}\\) tend to perform classification constraints in instance-level and latent-level, respectively. For the instance-level, the proposed PVA learns task-specific knowledge with training samples \\(p_{\\phi_{cls}^{pl}}(y|\\boldsymbol{x}) = \\frac{\\exp(\\cos(\\mathcal{I}(\\boldsymbol{x}),\\mathcal{T}(t_y)) / \\sigma)}{\\sum\\exp(\\cos(\\mathcal{I}(\\boldsymbol{x}),\\mathcal{T}(t_n)) / \\sigma)}\\) where \\(y\\) and \\(\\mathcal{T}(t_y)\\) represent the class labels and semantic features mentioned in Eq. (2). Based on the end-to-end training paradigm, the discrimination of text features can be preserved. For the latent level, the softmax classifier \\(\\phi_{cls}^{la}\\) is trained using latent features and corresponding labels to ensure the decision boundary is clear enough for the final classification task." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.618, + 0.784, + 0.647 + ], + "angle": 0, + "content": "As previously illustrated, we develop the overall training process with SVAE, cross-domain, and DCL classification loss:" + }, + { + "type": "equation", + "bbox": [ + 0.373, + 0.665, + 0.785, + 0.679 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {L} _ {S V A E} + \\alpha \\mathcal {L} _ {d i s} + \\beta \\mathcal {L} _ {c r} + \\gamma \\mathcal {L} _ {c l s}, \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.684, + 0.694, + 0.7 + ], + "angle": 0, + "content": "where \\(\\mathcal{L}_{SVAE} = \\mathcal{L}_{visual}^{svae} + \\mathcal{L}_{text}^{svae}\\) and \\(\\alpha, \\beta, \\gamma\\) are hyper parameters." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.72, + 0.784, + 0.81 + ], + "angle": 0, + "content": "Separate Novel Classes from Base Classes. Following the training stage, both the visual and semantic latent features are well represented. Thus, novel samples entangled with base samples can be easily separated from the test space using distance comparisons. Specifically, as shown on the right side of Fig. 2, we measure the distance between test samples and learned prompts equipped with the [CLASS] token by:" + }, + { + "type": "equation", + "bbox": [ + 0.421, + 0.826, + 0.784, + 0.841 + ], + "angle": 0, + "content": "\\[\nd i s t a n c e = \\cos \\left(z _ {i} ^ {t e}, z _ {t}\\right), \\tag {9}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.128 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.238 + ], + "angle": 0, + "content": "where \\( \\cos(,) \\) denotes the cosine similarity. \\( z_i^{te} = E_i(x^{te}) \\) denotes the latent features encoded from test visual features, which may come from base or novel domains. \\( z_t = [z_t^b, z_t^n] \\) contain the latent text features of all the classes (i.e., base and novel), where [,] denotes concatenate operation for the latent prompts of base and novel domains. Intuitively, if the test sample belongs to a novel domain, the distance \\( \\cos(z_i^{te}, z_t^n) \\) would be closer than \\( \\cos(z_i^{te}, z_t^b) \\)." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.239, + 0.722, + 0.253 + ], + "angle": 0, + "content": "By leveraging the distance metric, we can assign domain labels by:" + }, + { + "type": "equation", + "bbox": [ + 0.29, + 0.267, + 0.786, + 0.302 + ], + "angle": 0, + "content": "\\[\nL = \\left\\{ \\begin{array}{l} B a s e, \\max \\left\\{c o s \\left(z _ {i} ^ {t e}, z _ {t} ^ {b}\\right) \\mid \\forall t \\in \\mathcal {A} _ {s} \\right\\} \\geq t h r e s h o l d \\\\ N o v e l, \\max \\left\\{c o s \\left(z _ {i} ^ {t e}, z _ {t} ^ {b}\\right) \\mid \\forall t \\in \\mathcal {A} _ {s} \\right\\} < t h r e s h o l d \\end{array} \\right\\}. \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.308, + 0.789, + 0.419 + ], + "angle": 0, + "content": "Here, we alternate the hand-crafted threshold with the base knowledge to fit different datasets and reduce complexity. In practice, we propose to automatically calculate the threshold by \\(\\tau\\), where \\(\\tau = \\frac{\\text{count}(d^j > \\text{threshold})}{N}\\). \\(d^j\\) is the maximum distance between \\(j\\)-th training samples and learned prompts, and \\(N\\) is the number of all training samples. The larger the value \\(\\tau\\) is, the smaller the threshold becomes, meaning that more samples are divided into base classes. Then we only need to choose a suitable \\(\\tau \\in [0,1]\\) to balance the data separation." + }, + { + "type": "image", + "bbox": [ + 0.402, + 0.446, + 0.603, + 0.607 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.254, + 0.619, + 0.747, + 0.634 + ], + "angle": 0, + "content": "Fig. 3: The architecture of the Visual and Semantic Refinement modules." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Fine-tuning for GZSL Classification. When detecting based on the proposed distance, the domain for these test samples is accurately assigned. Although the challenging GZSL task can be converted into a traditional ZSL and a supervised task, how to recognize novel classes is also a tricky problem. To improve the transfer of general knowledge for novel classes, we further refine the output feature of the learned adapters with the original zero-shot features via a residual connection. As shown in the Fig. 2 and Fig. 3, we refine the final output of adapters by \\( t^{*} = \\epsilon \\cdot \\tilde{t} + (1 - \\epsilon) \\cdot t \\) and \\( x^{*} = \\epsilon \\cdot \\tilde{x} + (1 - \\epsilon) \\cdot x \\). Since CLIP is obtained by massive image-text pairs that are not limited to the current samples, the features of the original encoder are easier to transfer. Based on the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.177 + ], + "angle": 0, + "content": "complement of stored knowledge from CLIP and task-specific knowledge from adapters, we can thus improve the transferability of the PVA." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.203, + 0.375, + 0.22 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.237, + 0.311, + 0.253 + ], + "angle": 0, + "content": "4.1 Setup" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.264, + 0.787, + 0.446 + ], + "angle": 0, + "content": "Datasets and Setting. For the GZSC and CDT tasks, the datasets include two coarse-grained datasets, i.e., AwA2 [12] and SUN [30], and two fine-grained datasets i.e., CUB [36] and FLO [29], containing 50, 717, 200, and 102 categories, respectively. It is worth noting that due to space limitations, we only report the results for popular AwA2, CUB, and SUN in Table 1. The performance is evaluated by the harmonic mean of the average per class Top-1 accuracy: \\(\\mathbf{H} = 2*\\mathbf{B}*\\mathbf{N} / (\\mathbf{B} + \\mathbf{N})\\), where \\(\\mathbf{B}\\) and \\(\\mathbf{N}\\) represent the performance of base and novel classes, respectively. To further explore the knowledge transferability of the proposed method, we follow CoCoOP [44] to test the generalization performance of the trained model for other datasets. Specifically, we first train the PVA on AwA2, which is regarded as a source dataset. Then we compare the performance which is tested on the remaining three datasets without fine-tuning." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.471, + 0.787, + 0.607 + ], + "angle": 0, + "content": "Implementation details. The proposed PVA is comprised of two sub-models: a visual adapter and a text adapter. Each adapter consists of an encoder and a decoder implemented by two-layer FC networks with 256 hidden units and ReLU. The input of the adapters comes from the frozen CLIP (ViT-B/16 [11,23]) encoder with 512 dimensions. The latent feature dimension is set to 16 for all these datasets. For the prompts, the learnable parameters length \\( M = 4 \\). We train our proposed PVA by Adam optimizer with a 1e-4 learning rate. We select \\( \\alpha = 0.1 \\), \\( \\beta = 1 \\), and \\( \\gamma = 1 \\) as hyperparameters, while \\( \\tau \\) and \\( \\epsilon \\) are discussed in the following section." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.632, + 0.467, + 0.646 + ], + "angle": 0, + "content": "4.2 Comparisons with SOTA" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.659, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Generalized Zero-Shot Classification. We partition existing methods into three paradigms to compare the GZSL performance in Table. 1. Specifically, our method achieves the best harmonic mean of \\(90.7\\%\\) and \\(65.8\\%\\) on AwA2 and SUN, respectively. Although we observe a slightly lower result on CUB than PSVMA [23], our method still achieves competitive results without requiring manually designed attributes. Compared to the popular VLMs-based method CoOP [45], our method achieves a \\(15.3\\%\\) improvement on the \\(\\mathbf{N}\\) metric of AwA2, indicating the effectiveness of the proposed PVA for reducing prediction bias. CoOP achieves worse \\(\\mathbf{N}\\) than the original CLIP, which indicates that existing fine-tuned methods indeed suffer from feature confusion of novel classes, resulting in worse transferability. Notably, the proposed PVA not only improves the performance of novel classes but also ensures the discriminative property of base classes by" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.128 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: GZSC performance (\\%) comparisons on three popular benchmarks. E, G and C represent Embedding, Generative, and Calibration methods, respectively. The best results and second best results are marked by bold and underline. PVA+R denotes the proposed method equipped with refinement modules. “†” denotes that the methods are implemented by ViT [11] networks." + }, + { + "type": "table", + "bbox": [ + 0.226, + 0.227, + 0.787, + 0.528 + ], + "angle": 0, + "content": "
MethodsParadigmAwA2CUBSUN
BNHBNHBNH
DVBE [26]70.863.667.060.253.256.537.245.040.7
GEM [24]77.564.870.677.164.870.435.738.136.9
TransZero [4]82.361.370.268.369.368.833.452.640.8
MSDN [5]74.562.067.767.568.768.134.252.241.3
I2MVFomer [27]79.675.777.659.942.549.7---
DUET [9]†E84.763.772.772.862.967.545.845.745.8
PSVMA [23]†77.373.675.477.870.173.845.361.752.3
CLIP [31]†92.986.689.655.154.955.040.249.444.3
CoOP [45]†95.372.782.563.849.255.649.353.551.3
SHIP [37]†94.484.189.058.955.357.1---
f-VAEGAN [40]70.657.663.560.148.453.638.045.141.3
TF-VAEGAN [28]75.159.866.664.752.858.140.745.643.0
CEZSL [15]78.663.170.066.863.965.338.648.843.1
FREE [6]G75.460.467.159.955.757.737.247.441.7
HSVA [7]76.659.366.858.352.755.339.048.643.3
ICCE [20]82.365.372.865.567.366.4---
CS [3]77.85.911.063.812.621.0---
COSMO [2]---60.541.048.940.235.337.6
OOD [8]75.955.664.250.249.549.833.941.737.0
GatingAE [21]C81.360.369.358.155.456.738.145.341.4
PVA (Ours)92.788.090.378.562.569.663.466.364.8
PVA+R (Ours)93.688.090.779.665.772.062.569.565.8
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.559, + 0.785, + 0.589 + ], + "angle": 0, + "content": "separating novel and base domains. For instance, our method achieves the best B of \\(79.6\\%\\) and \\(63.4\\%\\) on the CUB and SUN datasets, respectively." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.59, + 0.787, + 0.694 + ], + "angle": 0, + "content": "In addition, the calibration-based method, i.e., GatingAE [21] focuses on data separation while ignoring the model's transferability. In contrast, we model the entire process in an adapter-style tuning fashion to consider knowledge transfer. Intuitively, it can be seen from the last two rows that the proposed refinement networks further improve the \\(\\mathbf{N}\\) results of \\(3.2\\%\\) on both CUB and SUN. This indicates that general knowledge should indeed be introduced by refinement networks to enhance the transferability of the model." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.719, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Cross-dataset Transfer Learning. To further evaluate the generalization ability of the model in an open-world setting, we report cross-dataset transfer learning performance in Table 2. Specifically, we train the model on AwA2 base classes and then test the performance on three target datasets. Since all target samples are test-only, we rename the original splits for base and novel classes to Subset1 (Sub1) and Subset2 (Sub2), respectively. As shown in the table, CoOP [45] is even worse than CLIP as it suffers from an overfitting problem for base classes. In contrast, by combining the prompt learning and adapter" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.145, + 0.788, + 0.189 + ], + "angle": 0, + "content": "Table 2: Cross-dataset transfer performance (%) comparisons on three popular benchmarks. The model is trained on AwA2 and then applied to target datasets. Sub1 and Sub2 represent data splits with different classes. \\(\\triangle\\) denotes PVA's gain over CoOP." + }, + { + "type": "table", + "bbox": [ + 0.224, + 0.199, + 0.787, + 0.286 + ], + "angle": 0, + "content": "
MethodsAwA2 → CUBAwA2 → SUNAwA2 → FLO
Sub1Sub2HSub1Sub2HSub1Sub2H
CLIP [31]54.855.255.040.241.440.867.965.666.7
CoOP [45]50.853.552.144.637.540.768.166.367.2
PVA+R (Ours)56.855.556.144.938.041.171.268.669.8
△+6.0+2.0+4.0+0.3+0.5+0.4+3.1+2.3+2.6
" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.299, + 0.505, + 0.342 + ], + "angle": 0, + "content": "Table 3: Ablation study of the proposed PVA. We highlight the \\(\\mathrm{PVA + R}\\) variants of our methods with a light blue background." + }, + { + "type": "table", + "bbox": [ + 0.226, + 0.368, + 0.505, + 0.455 + ], + "angle": 0, + "content": "
LdisLclsLcrεAwA2CUB
BNHBNH
✓89.252.966.467.713.522.5
✓✓90.183.486.672.161.066.1
✓✓✓92.788.090.378.562.569.6
✓✓✓0.191.788.990.373.765.069.0
✓✓✓0.592.488.990.672.265.968.9
✓✓✓0.993.688.090.779.664.771.4
" + }, + { + "type": "table_caption", + "bbox": [ + 0.518, + 0.298, + 0.78, + 0.354 + ], + "angle": 0, + "content": "Table 4: Ablation study of the domain detection. FPR denotes the False Positive Rate (in %) on the threshold that yields \\(95\\%\\) TPR." + }, + { + "type": "table", + "bbox": [ + 0.528, + 0.367, + 0.78, + 0.455 + ], + "angle": 0, + "content": "
LdisLclsLcrCUBSUN
FPR ↓AUC ↑FPR ↓AUC ↑
✓77.176.289.062.6
✓✓10.598.066.387.2
✓✓✓2.699.211.397.8
MAX-3 [17]79.673.492.361.0
OOD [8]85.071.288.863.1
COSMO [2]72.082.077.577.7
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.483, + 0.788, + 0.577 + ], + "angle": 0, + "content": "tuning, PVA+R outperforms CoOP by \\(4.0\\%\\), \\(0.4\\%\\), and \\(2.6\\%\\) on CUB, SUN, and FLO, respectively. Additionally, it is more interesting to look backward to Table. 1, the performance on CUB observed by traditional generative methods, such as F-VAEGAN [40] and HSVA [7] is even inferior to PVA+R transferred from AwA2. This also demonstrates that our prompt-adapter hybrid framework can be extended to a variety of downstream tasks." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.596, + 0.39, + 0.612 + ], + "angle": 0, + "content": "4.3 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.621, + 0.788, + 0.759 + ], + "angle": 0, + "content": "Different Constraints. To give a clear insight into each constraint, we conduct a series of ablation experiments. As shown in Table. 3, the performance gradually improves as we incorporate \\(\\mathcal{L}_{dis}\\), \\(\\mathcal{L}_{cls}\\) and \\(\\mathcal{L}_{cr}\\) into the original baseline. It is worth noting that we observe significant improvements when \\(\\mathcal{L}_{cls}\\) is added. This is because classification constraints can help models learn discriminative and reasonable prompts while ensuring class-wise alignments for visual and semantic branches. Unlike the changing trend of the above constraints, PVA+R achieves more stable yet high results across various \\(\\epsilon\\), indicating that refinement processes balance general and task-specific knowledge to improve overall performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Data Separation. To further explore the results of feature separation, we report the binary classification results. As shown in Table. 4, we observe that the AUC raises with the help of \\(\\mathcal{L}_{cls}\\) and \\(\\mathcal{L}_{cr}\\), maintaining the same trend as \\(\\mathbf{H}\\) shown in Table. 3. In addition, PVA exhibits much stronger domain detection" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.127 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "image", + "bbox": [ + 0.231, + 0.145, + 0.406, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.412, + 0.144, + 0.588, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.595, + 0.145, + 0.772, + 0.28 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.3, + 0.788, + 0.356 + ], + "angle": 0, + "content": "Fig. 4: (a) ROC curves on four benchmarks. (b) GZSL performance (N and H) on AwA2 with different \\(\\tau\\). (c) Comparisons between different feature extractors on AwA2. We replace original Res101 [16] based TF-VAE [28] with CLIP features, termed TF-VAE+CLIP." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.372, + 0.79, + 0.414 + ], + "angle": 0, + "content": "Table 5: Effectiveness analysis of variational adapter and alternatives. w/ and w/o represent with and without respectively. DS is the abbreviation of Data Separation. \\(\\triangle\\) represents the gain over the second-best results." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.426, + 0.789, + 0.498 + ], + "angle": 0, + "content": "
MethodsAwA2CUBSUNFLO
BNHBNHBNHBNH
MLP w/o DS95.376.885.060.354.157.051.252.751.971.868.970.3
MLP w/ DS92.869.079.170.362.166.653.166.859.188.272.879.8
VAE w/ DS93.688.090.779.665.772.062.569.565.892.172.180.9
△-1.7+11.2+5.7+9.3+3.6+5.4+9.4+2.7+6.7+3.9-0.7+1.1
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.527, + 0.788, + 0.633 + ], + "angle": 0, + "content": "ability than other related methods, leading to pleasing performance. We draw the ROC curves in Fig. 4(a) to report detection results for these datasets, where all AUCs are greater than \\(96\\%\\). This also indicates that novel samples can be effectively separated from entangled base samples by well-trained latent features of adapters. In addition, we believe that the performance of data separation is important because if the domain cannot be accurately distinguished, it will directly affect the classification results and even have negative effects." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.694 + ], + "angle": 0, + "content": "Furthermore, we report quantitative analysis between other related methods and the proposed PVA in the lower half of Table. 4. It can be seen that these methods fail to accurately classify entangled features at the domain level, which is consistent with the results in Table. 1." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Analysis of Variational Adapter. We evaluate the effects of different adapter structures. As shown in Table. 5, we first adopt MLPs as the adapter to fine-tune on four datasets. It can be seen that the performance of the novel class decreases significantly in MLPs w/o DS. This is because MLPs fail to learn transferable knowledge due to the simple structures. Although MLP w/ DS shows considerable improvements of H on CUB(9.6%), SUN(7.2%), and FLO (9.5%) with domain detection, it still suffers from unstable performance. For example, the harmonic mean drops from 85.0% to 79.1% on AwA2 after domain detection." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.224, + 0.145, + 0.36, + 0.271 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.364, + 0.146, + 0.501, + 0.271 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.146, + 0.638, + 0.271 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.642, + 0.146, + 0.777, + 0.271 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.283, + 0.785, + 0.326 + ], + "angle": 0, + "content": "Fig. 5: t-SNE visualizations [25] of learnable prompts and visual features with (w/) Visual and Semantic adapters. Grey and black triangles denote the base and novel prototype, respectively. Color stars denote novel visual features. (Best viewed in color)" + }, + { + "type": "image", + "bbox": [ + 0.284, + 0.339, + 0.408, + 0.454 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.437, + 0.339, + 0.572, + 0.454 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.594, + 0.339, + 0.721, + 0.454 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.432, + 0.463, + 0.573, + 0.475 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.488, + 0.785, + 0.516 + ], + "angle": 0, + "content": "Fig. 6: t-SNE visualizations of latent features for AwA2, CUB and FLO. Grey dots represent base features and blue dots represent novel ones." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.546, + 0.785, + 0.62 + ], + "angle": 0, + "content": "We speculate that plain MLPs can not sufficiently align vision-language modality in latent space, resulting in poor domain classification. However, the proposed variational adapters capture discriminative yet transferable information for both latent and output features to ensure the performance of domain detection and classification." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.785, + 0.734 + ], + "angle": 0, + "content": "Sensitivity and Backbones. Fig. 4(b) shows the sensitivity of \\(\\tau\\). The performance of \\(\\mathbf{N}\\) maintains stable at first and then decreases sharply when \\(\\tau \\geq 0.99\\). The reason for this observation is that the larger \\(\\tau\\) tends to classify more samples into base classes, resulting in lower \\(\\mathbf{N}\\). The descent speed of \\(\\mathbf{H}\\) is less than \\(\\mathbf{N}\\), for the performance of \\(\\mathbf{B}\\) improves as \\(\\tau\\) increases. In our experiments, we set \\(\\tau = 0.95\\) for all the datasets." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.787, + 0.84 + ], + "angle": 0, + "content": "We evaluate the influence of different backbones for fair comparisons. As shown in Fig. 4(c), when we applied CLIP features to existing generative methods such as TF-VAE [28], we did not observe improvements, which are brought by high-quality representations. We speculate that the features extracted from VLMs are discriminative enough for classification, while they do not require additional complex optimization. Different from simple combinations between off-the-shelf methods and CLIP features, we fine-tune the VLMs in a prompt-" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.128 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.176 + ], + "angle": 0, + "content": "adapter hybrid fashion to guide feature optimization, leading to superior performance." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.2, + 0.371, + 0.214 + ], + "angle": 0, + "content": "4.4 Visualization" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.225, + 0.787, + 0.405 + ], + "angle": 0, + "content": "Visualizations for Visual and Semantic Features. To show the distribution, we visualize them by t-SNE [25] in Fig. 5. By comparing Fig. 5(a) and Fig. 5(b), we can find that the learnable prompts exhibit a higher degree of dispersion. These learnable prompts capture task-specific knowledge from training samples to improve classification performance. Further, we explore the visual and semantic embedding fine-tuned by the proposed variational adapter. From Fig. 5(c) to Fig. 5(d), we can see that visual adapters tend to learn a more intensive distribution for each class to preserve intra-class information, while semantic adapter refines the corresponding relationship between vision and semantic modalities. By incorporating prompt learning and adapter-style tuning into a unified framework, PVA gives a reasonable solution for downstream task generalization." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.429, + 0.787, + 0.519 + ], + "angle": 0, + "content": "Visualizations for latent Features. We visualize the latent features of both base and novel classes in Fig. 6. It can be seen that blue dots are located in gaps of gray dots with clear boundaries. Thus, we can separate these novel samples by cosine similarity. Although most of the novel samples can be accurately separated, some samples are also misclassified due to feature confusion. This is coincident with the results of Fig. 4(a)." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.543, + 0.36, + 0.558 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.574, + 0.787, + 0.74 + ], + "angle": 0, + "content": "In this paper, we provide a Prompt-Adapter hybrid method PVA to handle the feature confusion problem caused by unbalanced fine-tuning. In general, we fine-tune the corresponding variational adapters for visual and language branches by aligning latent representations of them, where the input of the language adapter is the learnable textual tokens. In addition, we refine adapter output features with global features stored in the original CLIP to improve knowledge transfer. Once trained, we can build two independent classification tasks by similarity metrics. We show that the proposed PVA can achieve state-of-the-art performance on GZSC and challenging CDT tasks. Considering limitations, although PVA achieves remarkable results, it requires additional training costs, which we aim to alleviate in the future." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.383, + 0.163 + ], + "angle": 0, + "content": "Acknowledgment" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.18, + 0.788, + 0.271 + ], + "angle": 0, + "content": "This research was supported in part by NSFC (12326608, U19B2043, 62441602), National Science Foundation for Distinguished Young Scholars under Grant 62225605, Zhejiang Provincial Natural Science Foundation of China under Grant LD24F020016, the Key R&D Program of Zhejiang Province, China 2023C01043, Science and Technology Innovation of Ningbo (2023Z236, 2024Z294), and the Fundamental Research Funds for the Central Universities." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.298, + 0.323, + 0.314 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.333, + 0.785, + 0.375 + ], + "angle": 0, + "content": "1. Akata, Z., Perronnin, F., Harchaoui, Z., Schmid, C.: Label-embedding for attribute-based classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 819-826 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.377, + 0.785, + 0.417 + ], + "angle": 0, + "content": "2. Atzmon, Y., Chechik, G.: Adaptive confidence smoothing for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11671-11680 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.419, + 0.785, + 0.46 + ], + "angle": 0, + "content": "3. Chao, W.L., Changpinyo, S., Gong, B., Sha, F.: An empirical study and analysis of generalized zero-shot learning for object recognition in the wild. In: Proceedings of the European Conference on Computer Vision. pp. 52-68. Springer (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.461, + 0.785, + 0.502 + ], + "angle": 0, + "content": "4. Chen, S., Hong, Z., Liu, Y., Xie, G.S., Sun, B., Li, H., Peng, Q., Lu, K., You, X.: Transzero: Attribute-guided transformer for zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 330-338 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.504, + 0.785, + 0.558 + ], + "angle": 0, + "content": "5. Chen, S., Hong, Z., Xie, G.S., Yang, W., Peng, Q., Wang, K., Zhao, J., You, X.: Msdn: Mutually semantic distillation network for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7612-7621 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.56, + 0.785, + 0.6 + ], + "angle": 0, + "content": "6. Chen, S., Wang, W., Xia, B., Peng, Q., You, X., Zheng, F., Shao, L.: Free: Feature refinement for generalized zero-shot learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 122-131 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.601, + 0.785, + 0.643 + ], + "angle": 0, + "content": "7. Chen, S., Xie, G., Liu, Y., Peng, Q., Sun, B., Li, H., You, X., Shao, L.: Hsva: Hierarchical semantic-visual adaptation for zero-shot learning. Proceedings of the Advances in Neural Information Processing Systems 34, 16622-16634 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.644, + 0.785, + 0.672 + ], + "angle": 0, + "content": "8. Chen, X., Lan, X., Sun, F., Zheng, N.: A boundary based out-of-distribution classifier for generalized zero-shot learning. arXiv preprint arXiv:2008.04872 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.673, + 0.785, + 0.713 + ], + "angle": 0, + "content": "9. Chen, Z., Huang, Y., Chen, J., Geng, Y., Zhang, W., Fang, Y., Pan, J.Z., Chen, H.: Duet: Cross-modal semantic grounding for contrastive zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 405-413 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.715, + 0.785, + 0.742 + ], + "angle": 0, + "content": "10. Davidson, T.R., Falorsi, L., De Cao, N., Kipf, T., Tomczak, J.M.: Hyperspherical variational auto-encoders. arXiv preprint arXiv:1804.00891 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.743, + 0.785, + 0.798 + ], + "angle": 0, + "content": "11. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "12. Farhadi, A., Endres, I., Hoiem, D., Forsyth, D.: Describing objects by their attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1778-1785 (2009)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.333, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.35, + 0.128 + ], + "angle": 0, + "content": "Z. Lu et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "13. Gao, P., Geng, S., Zhang, R., Ma, T., Fang, R., Zhang, Y., Li, H., Qiao, Y.: Clip-adapter: Better vision-language models with feature adapters. International Journal of Computer Vision pp. 1-15 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.787, + 0.233 + ], + "angle": 0, + "content": "14. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Proceedings of the Advances in Neural Information Processing Systems. pp. 2672-2680 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.234, + 0.787, + 0.275 + ], + "angle": 0, + "content": "15. Han, Z., Fu, Z., Chen, S., Yang, J.: Contrastive embedding for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2371-2381 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.276, + 0.787, + 0.317 + ], + "angle": 0, + "content": "16. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.318, + 0.787, + 0.346 + ], + "angle": 0, + "content": "17. Hendrycks, D., Gimpel, K.: A baseline for detecting misclassified and out-of-distribution examples in neural networks. arXiv preprint arXiv:1610.02136 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.347, + 0.787, + 0.401 + ], + "angle": 0, + "content": "18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: Proceedings of the International Conference on Machine Learning. pp. 4904-4916 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.403, + 0.787, + 0.445 + ], + "angle": 0, + "content": "19. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.445, + 0.787, + 0.5 + ], + "angle": 0, + "content": "20. Kong, X., Gao, Z., Li, X., Hong, M., Liu, J., Wang, C., Xie, Y., Qu, Y.: Encompactness: Self-distillation embedding & contrastive generation for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9306-9315 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.501, + 0.787, + 0.529 + ], + "angle": 0, + "content": "21. Kwon, G., Al Regib, G.: A gating model for bias calibration in generalized zero-shot learning. IEEE Transactions on Image Processing (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.53, + 0.787, + 0.572 + ], + "angle": 0, + "content": "22. Li, X., Xu, Z., Wei, K., Deng, C.: Generalized zero-shot learning via disentangled representation. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 1966-1974 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.573, + 0.787, + 0.628 + ], + "angle": 0, + "content": "23. Liu, M., Li, F., Zhang, C., Wei, Y., Bai, H., Zhao, Y.: Progressive semantic-visual mutual adaption for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15337-15346 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.629, + 0.787, + 0.671 + ], + "angle": 0, + "content": "24. Liu, Y., Zhou, L., Bai, X., Huang, Y., Gu, L., Zhou, J., Harada, T.: Goal-oriented gaze estimation for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3794-3803 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.671, + 0.787, + 0.699 + ], + "angle": 0, + "content": "25. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(11) (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.7, + 0.787, + 0.742 + ], + "angle": 0, + "content": "26. Min, S., Yao, H., Xie, H., Wang, C., Zha, Z.J., Zhang, Y.: Domain-aware visual bias eliminating for generalized zero-shot learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 12664-12673 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.742, + 0.787, + 0.798 + ], + "angle": 0, + "content": "27. Naeem, M.F., Khan, M.G.Z.A., Xian, Y., Afzal, M.Z., Stricker, D., Van Gool, L., Tombari, F.: I2mvformer: Large language model generated multi-view document supervision for zero-shot image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15169-15179 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.799, + 0.787, + 0.841 + ], + "angle": 0, + "content": "28. Narayan, S., Gupta, A., Khan, F.S., Snoek, C.G., Shao, L.: Latent embedding feedback and discriminative features for zero-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 479-495. Springer (2020)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.841 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.42, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Zero-Shot Generalization with PVA" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "29. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: Indian Conference on Computer Vision, Graphics & Image Processing. pp. 722-729 (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "30. Patterson, G., Hays, J.: Sun attribute database: Discovering, annotating, and recognizing scene attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2751-2758 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.232, + 0.788, + 0.286 + ], + "angle": 0, + "content": "31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.286, + 0.788, + 0.342 + ], + "angle": 0, + "content": "32. Schonfeld, E., Ebrahimi, S., Sinha, S., Darrell, T., Akata, Z.: Generalized zero-and few-shot learning via aligned variational autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8247-8255 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.342, + 0.788, + 0.384 + ], + "angle": 0, + "content": "33. Su, H., Li, J., Chen, Z., Zhu, L., Lu, K.: Distinguishing unseen from seen for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7885-7894 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.384, + 0.788, + 0.425 + ], + "angle": 0, + "content": "34. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. proceedings of the Advances in Neural Information Processing Systems (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.425, + 0.751, + 0.439 + ], + "angle": 0, + "content": "35. Villani, C., et al.: Optimal transport: old and new, vol. 338. Springer (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.439, + 0.788, + 0.467 + ], + "angle": 0, + "content": "36. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.467, + 0.788, + 0.509 + ], + "angle": 0, + "content": "37. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.509, + 0.788, + 0.55 + ], + "angle": 0, + "content": "38. Xian, Y., Akata, Z., Sharma, G., Nguyen, Q., Hein, M., Schiele, B.: Latent embeddings for zero-shot classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 69-77 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.55, + 0.788, + 0.592 + ], + "angle": 0, + "content": "39. Xian, Y., Lorenz, T., Schiele, B., Akata, Z.: Feature generating networks for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5542-5551 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.592, + 0.788, + 0.633 + ], + "angle": 0, + "content": "40. Xian, Y., Sharma, S., Schiele, B., Akata, Z.: f-vaegan-d2: A feature generating framework for any-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10275-10284 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.633, + 0.788, + 0.661 + ], + "angle": 0, + "content": "41. Xu, B., Zeng, Z., Lian, C., Ding, Z.: Generative mixup networks for zero-shot learning. IEEE Transactions on Neural Networks and Learning Systems (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.661, + 0.788, + 0.702 + ], + "angle": 0, + "content": "42. Zhang, L., Xiang, T., Gong, S.: Learning a deep embedding model for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2021-2030 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.702, + 0.788, + 0.744 + ], + "angle": 0, + "content": "43. Zhang, R., Zhang, W., Fang, R., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free adaption of clip for few-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 493-510. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.744, + 0.788, + 0.785 + ], + "angle": 0, + "content": "44. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.785, + 0.788, + 0.814 + ], + "angle": 0, + "content": "45. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.814 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_origin.pdf b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a10304b60d01d6e2cf5ef5d900b29117a4be0030 --- /dev/null +++ b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/ccf141f3-ccb6-4862-80da-6db6acdbf929_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9c93266d17a0e3686a60492c5b839c5e4a224f8359306e3363549bc45cd8ef74 +size 2496499 diff --git a/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/full.md b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/full.md new file mode 100644 index 0000000000000000000000000000000000000000..ec472fe29c152307d3e53e6e49fba42665a590e7 --- /dev/null +++ b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/full.md @@ -0,0 +1,340 @@ +# Improving Zero-Shot Generalization for CLIP with Variational Adapter + +Ziqian Lu $^{1}$ , Fengli Shen $^{2}$ , Mushui Liu $^{1}$ , Yunlong Yu $^{1}$ *, and Xi Li $^{1}$ + +1 Zhejiang University, Hangzhou 310007, China + +$^{2}$ Yangtze Delta Region Institute (Huzhou) University of Electronic Science and Technology of China, Huzhou 313001, China + +{ziqianlu,1ms,yuyunlong,xilizju}@zju.edu.cn + +fenglishen@csj.uestc.edu.cn + +Abstract. The excellent generalization capability of pre-trained Vision-Language Models (VLMs) makes fine-tuning VLMs for downstream zero-shot tasks a popular choice. Despite achieving promising performance in the professionality of base classes, most existing fine-tuned methods suffer from feature confusion of novel classes, resulting in unsatisfactory transferability. To address this problem, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that explicitly reduces the prediction bias by separating base and novel samples. Specifically, we design two variational adapters with learnable textual tokens to align latent representations for each modality in a shared latent space. Once trained, we can separate novel samples from entangled space using the similarity metric of latent features, i.e., converting confusion task into two independent ones (One for base classes and the other for novel classes). Moreover, to improve the transferability for novel classes, we further refine the output features of the learned adapters with the global features via a residual connection. We conduct extensive experiments on Generalized Zero-Shot Learning and Cross-Dataset Transfer Learning to demonstrate the superiority of our approach and establish a new state-of-the-art on four popular benchmarks. + +Keywords: Visual-Language Models $\cdot$ Zero-Shot Generalization $\cdot$ Variational Adapter + +# 1 Introduction + +Recently, pre-trained Vision-Language Models (VLMs) such as CLIP [31] and ALIGN [18] have demonstrated remarkable applicability across various downstream tasks such as Zero-Shot Learning (ZSL) [1, 38]. To further boost the performance on downstream tasks, recent studies have proposed several fine-tuning methods based on the VLMs structure. In general, existing fine-tuning methods can be grouped into two lines: (1) Prompt Learning (PL) [19, 44, 45] is a paradigm that leverages a minimal set of learnable parameters, known as + +![](images/a2630156beb8ce170f33e4adef823e465e6545a01929edb148fe7b94516b2d54.jpg) +(a) Distribution of all the classes. + +![](images/e2b837fad366eb618182490e19ad195a4b1763099cd7cd993ab1a5a078fd3f99.jpg) +(b) Distribution of base classes. +(c) Distribution of novel classes. +Fig. 1: t-SNE visualization of AWA2 dataset with CoOP [45]. The color and grey pentagrams represent novel and base samples, respectively. (a) There is obvious overlap and confusion in the distribution of bobcat, tiger, and leopard. (b-c) The confusion issue could be efficiently addressed if the two class sets were meticulously segregated. + +prompts, to efficiently adapt pre-trained models to the downstream tasks in a data-efficient manner while maintaining competitive performance. (2) Adapter-style Tuning (AT) [13, 43] involves introducing adapter layers or modules into the pre-trained models, allowing only these adapter layers to be updated during fine-tuning while the rest of the models' parameters remain frozen. + +However, both PL and AT paradigms only fine-tune VLMs on base classes, resulting in extreme prediction bias towards base classes. This bias is exacerbated in challenging open-world vision tasks (e.g., Generalized Zero-Shot Learning, GZSL [5,22,39]) due to the feature confusion. As shown in Fig. 1(a), the novel samples (color pentagrams) are located around the base samples (grey pentagrams) owing to the lack of prior knowledge of the former. These fine-tuning methods trained on unbalanced base data may tend to classify all samples into base classes and struggle to generalize to novel classes, reducing their transferability. + +To this end, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that improves both the professionality and transferability of the VLMs model. Inspired by previous PL work, we learn task-specific textual tokens instead of subjective hand-crafted attributes. Compared to the static attributes, these learnable prompts can not only capture more discriminative information but also provide better diversity for subsequent adaptation learning. Then, two variational adapters are constructed to generate latent repre + +sentations in a shared latent space, in which we adopt class-wise and distributionwise vision-language constraints to ensure alignment and interaction properties for each branch. With the help of variational structures, adapters carefully align multi-modal features in redundancy-free latent space, providing accurate visual-semantic interactions. After that, we can search for a threshold to distinguish the base and novel domains by measuring the similarity between the latent representations of the two domains. Based on the similarity, GZSL can thus be converted into a base class classification and a zero-shot task of novel classes, as shown in Fig. 1(b-c). Once base and novel samples are distinguished, the prediction bias problem will naturally be addressed. + +In addition, even if the test spaces are accurately distinguished, how to classify novel samples remains a challenging task. Thus, we further refine the output feature of the learned adapters with the global features (extracted from the original CLIP encoder) via a residual connection to improve the transferability. Benefiting from residual connection, variational adapters can fully exploit the transferable general knowledge stored in the original CLIP and freshly learned knowledge originated from training samples. In fact, different from existing methods that train an extra binary classifier to distinguish domains, we efficiently model the entire process (i.e., data separation and classification) in a unified Prompt-Adapter hybrid framework to simultaneously preserve the professionalism and transferability of the VLMs model. + +In summary, our main contributions are: + +- We introduce a novel approach, the Prompt-based Variational Adapter (PVA), specifically designed to address the challenges of GZSL. To the best of our knowledge, our method marks the inaugural exploration of the synergy between PL and AT in the context of fine-tuning CLIP models, offering a novel and effective solution to this complex task. +- We propose to utilize the latent representations of the adapter, which are tightly governed by the vision-language distribution, to distinguish novel classes from base classes. By segmenting the entire test space into two distinct and independent subspaces, the prediction bias that typically favors base classes is explicitly mitigated, thereby enhancing the accuracy and fairness of the classification process. +- Our experimental results demonstrate that the proposed PVA achieves state-of-the-art performance across a wide range of downstream tasks, including GZSL and Cross-Dataset transfer learning. Notably, PVA exhibits significant improvements in recognizing novel classes, showcasing its effectiveness in addressing the inherent challenges of these tasks. + +# 2 Related Work + +# 2.1 Generalized Zero-Shot Learning + +How to recognize objects in an open-world visual environment has attracted increasing interest in recent years. GZSL [5,22,23,39] is one of the relevant research + +fields focusing on open-world visual tasks. Specifically, GZSL aims to recognize both base and novel objects, relying solely on labeled samples from the base classes. To achieve this goal, existing methods can be grouped into two folds: (1) Embedding-based methods [4, 23, 42], which focus on learning a visual-semantic mapping in visual, semantic or latent space for cross-modal interactions. However, a major drawback of Embedding-based methods is the prediction bias toward base classes for the lack of novel labeled data. Therefore, some researchers tend to explore feature-generation methods to reduce prediction bias. (2) Generative methods [7, 39, 41] aim to generate the visual features or prototype of the novel classes by various generative networks, such as generative adversarial networks (GANs) [14] and variational autoencoders (VAEs) [32]. Despite the promising results, these methods still require massive annotated data and semantic descriptions (e.g., sentences, hand-crafted attributes). In addition, since the generated features come from noise inputs, they usually suffer from extreme domain shift problems. + +Different from these existing methods, we explicitly aim to tackle the prediction bias problem by converting the GZSL into a ZSL classification task and a supervised task. One of the related methods is calibration, which has been explored in several recent works [2, 3, 8, 33]. ESZSL [3] calibrates the prediction by directly reducing the probability of base classes. COSMO [2] proposes a soft combination method without any training samples. OOD [8] and DUS [33] attempt to learn the boundary from base samples to separate novel classes from entangled space. Different from the aforementioned methods, we adopt adapter-style tuning equipped with learnable prompts based on VLMs to improve the transferability, not simply learn a domain detector. + +# 2.2 Vision-Language Models for Zero-Shot Generalization + +Pre-trained vision-language models (VLMs) explore the relationship between two different modalities by contrastive learning with massive noisy data. With the help of reasonable structures, these models, such as CLIP [31] and ALIGN [18] can provide excellent representations for both visual and text branches. Based on the remarkable transferability of VLMs, the researchers adopt improved methods to address downstream zero-shot generalization problems. [19,44,45] apply an efficient fine-tuning paradigm by learning representation for the specific task. [13,43] learn extra MLPs to adapt the downstream knowledge. However, these methods only consider knowledge transfer, ignoring the feature confusion that occurs in hybrid open-world spaces. + +# 3 Method + +# 3.1 Overall idea + +Our method introduces a prompt-based variational adapter to address the prediction bias problem without sacrificing task-specific discrimination and transferability. Fig. 2 shows the overall architecture of the proposed PVA. Different + +\* : Frozen + +: Learnable + +Training Image + +![](images/e14089928f68ff080f1ad67d03f6ab951dd888d70bd48eb7994c7b9e9a927801.jpg) + +Test Image + +![](images/fe27a81931f057c6d1f006f12c7c5ed26284c02f6b524598d1e8c44d2b33ff63.jpg) + +Base Classes Prompts + +![](images/d2aa75bce5bd9a3ee1e531940ae95a48e9637d3bcbf192defbbc25d9aee16a15.jpg) + +Novel Classes Prompts + +![](images/3857159483504e5a4ed9bb802d1286fe8a5662cd650d508d701536ce51c42856.jpg) + +Visual Latent Feature +:Base Text Latent Feature +Novel Text Latent Feature + +![](images/f8e34a843da8b4c98e94e50c8d3d4018cbe358a690827fa8e7109cccd084f81a.jpg) +Training Stage + +![](images/42fa33e5eb40ef463a3774785b03efc491194fefb5a06d6ce30845e9ee0df4d1.jpg) +Test Stage +Fig. 2: Overview of the proposed Prompt-based Variational Adapter (PVA). Left: The training framework of PVA with detailed implementations. $E_{i}$ , $D_{i}$ , $E_{t}$ and $D_{t}$ refer to visual encoder, visual decoder, text encoder, and text decoder, respectively. $z_{i}$ and $z_{t}$ represent latent features for image and text aspects, where the adapter inputs are $x$ and $t$ , respectively. $\tilde{x}$ and $\tilde{t}$ denote the reconstructed features. Right: Test samples are grouped into base domain or novel domain by the cosine similarity between $z_{i}$ and $z_{t}$ (including both base and novel classes), and then classified by two experts. + +from existing methods, we explicitly reduce the prediction bias by converting the GZSL problem into a ZSL and a supervised classification task. To separate novel (or base) samples from entangled space, we learn two variational adapters to align visual and semantic features, where the text features are equipped with learnable prompts. Then, we further refine the output features of adapters to balance task-specific and general knowledge. + +# 3.2 Revisiting CLIP + +CLIP [31] consists of two core encoders: a text encoder $\mathcal{T}$ and a visual encoder $\mathcal{I}$ , which are jointly trained by massive noisy image-text pairs with contrastive loss. Each encoder is implemented by either repetitive Transformer [34] or ResNet [16] blocks. Once trained, we can build a zero-shot classifier with arbitrary object names and the corresponding visual features. For example, a $N$ -way classification can be built by the similarity metric between visual features and text prompts for these classes, such as 'A photo of a [CLASS]'. Formally, the output probability of the model is: + +$$ +p (y | x) = \frac {\exp (\cos (\mathcal {I} (x) , \mathcal {T} (t _ {y})) / \sigma)}{\sum_ {n = 1} ^ {N} \exp (\cos (\mathcal {I} (x) , \mathcal {T} (t _ {n})) / \sigma)}, \tag {1} +$$ + +where $\sigma$ is the temperature parameter and $y$ represents the target class. + +# 3.3 Prompt-based Variational Adapter + +Problem Setting. GZSL attempts to recognize novel categories by the prior knowledge transferred from the base domain (i.e., seen domain) to the novel domain (i.e., unseen domain). Here, base domain represented by $\mathcal{D}^s = \{(x,y,t_y)|x\in$ $\mathcal{X}^s,y\in \mathcal{Y}^s,t_y\in \mathcal{A}^s\}$ , where $y$ is the class label, and $x$ and $t_y$ refer to features extracted by the visual and text encoder of CLIP, respectively. Similarly, novel domain is given by $\mathcal{D}^u = \{(x^u,u,t_u)|x^u\in \mathcal{X}^u,u\in \mathcal{Y}^u,t_u\in \mathcal{A}^u\}$ , where $u$ refers the label of novel classes. The overall goal of GZSL is to learn $f_{GZSL}:\mathcal{X}\to \mathcal{Y}^s\cup \mathcal{Y}^u$ , where $\mathcal{Y}^s\cap \mathcal{Y}^u = \emptyset$ . + +Learn the Prompt-based Variational Adapter. Inspired by the effectiveness of prompt learning, we also learn textual tokens instead of hand-crafted attributes. Formally, the prompts are given in the following form: + +$$ +t = [ \mathrm {T} ] _ {1} [ \mathrm {T} ] _ {2} \dots [ \mathrm {T} ] _ {M} [ \text {C L A S S} ], \tag {2} +$$ + +where each $[T]_M$ is a vector with the same dimension (e.g., 512 in CoOP [45]) and $M$ is the length of the learned prompts. Subsequently, prompts $t$ and corresponding images are fed into the frozen text and image encoders for adaption learning. + +By forwarding the original training samples and learnable prompts from base classes, we can then build two variational adapters. Inspired by the excellent representations of Spherical Variational Autoencoder (SVAE) [10,32] on low dimensional data, we employ two SVAE as the adapters to align different modalities, while preserving the transferability of classes knowledge. To achieve this goal, we model visual and semantic distributions by vMF and treat each distribution obtained from the visual and semantic branch as prior knowledge for another to align these modalities in spherical space. + +Specifically, as shown in the left side of Fig 2, each adapter (e.g., SVAE) consists of an encoder and a decoder with inherent and cross-modal constraints. For the visual branch, we can formulate the variational optimization by: + +$$ +\mathcal {L} _ {\text {v i s u a l}} ^ {s v a e} = \mathbb {E} _ {q _ {\delta_ {1}} (z _ {i} | x)} [ \log p _ {\omega_ {1}} (x \mid z _ {i}) ] - \mathrm {K L} \left(q _ {\delta_ {1}} (z _ {i} \mid x) \| p _ {\omega_ {1}} (z _ {i})\right), \tag {3} +$$ + +where the first term refers to the reconstruction loss for visual features $x$ over latent features $z_{i}$ , and the second part denotes the distance metric between different distributions. Here $q_{\delta_1}(z_i|x)$ represents the features encoded by the visual encoder $E_{i}$ , while $p_{\omega_1}(x|z_i)$ comes from $D_{i}$ . + +Similarly, the text adapter can be optimized by another SVAE loss: + +$$ +\mathcal {L} _ {\text {t e x t}} ^ {s v a e} = \mathbb {E} _ {q _ {\delta_ {2}} (z _ {t} | t)} \left[ \log p _ {\omega_ {2}} (t \mid z _ {t}) \right] - \mathrm {K L} \left(q _ {\delta_ {2}} (z _ {t} \mid t) \| p _ {\omega_ {2}} (z _ {t})\right), \tag {4} +$$ + +where $q_{\delta_2}(z_t|t)$ and $p_{\omega_2}(t \mid z_t)$ denote the distribution represented by text encoder and decoder, respectively. By formulating the adapter into an SVAE style, the latent features can only depict each distribution independently. Therefore, to align the latent features of different modalities, we propose to minimize the + +distance between them. Formally, we adopt optimal transport (Earth Mover's Distance) [35] to match visual latent distribution to text distribution by: + +$$ +\mathcal {L} _ {d i s} = \inf _ {\theta \in \Pi \left(P _ {z _ {i}}, P _ {z _ {t}}\right)} \mathbb {E} _ {(z _ {i}, z _ {t}) \sim \theta} [ \| z _ {i} - z _ {t} \| ], \tag {5} +$$ + +where $\Pi(P_{z_i}, P_{z_t})$ denotes the joint distribution of two latent features $z_i$ and $z_t$ . With the help of $\mathcal{L}_{dis}$ , the corresponding categories of visual and semantic features will be aligned in the latent space. + +To further ensure visual-semantic alignment, we introduce cross-domain constraints for both visual and semantic adapters. Specifically, given the latent representation $z_{i}$ and $z_{t}$ , we reconstruct the representation by another decoders: + +$$ +\mathcal {L} _ {c r} = \mathbb {E} \left[ | | t - D _ {t} \left(z _ {i}\right) | | _ {2} \right] + \mathbb {E} \left[ | | x - D _ {i} \left(z _ {t}\right) | | _ {2} \right], \tag {6} +$$ + +where $D_{t}(z_{i})$ and $D_{i}(z_{t})$ are regarded as cross-domain representations. + +Although Eqs. (3) (4) (5) (6) align latent representations in a shared space by SVAE and cross-domain constraints, they still suffer from the lack of any class-wise knowledge, which could lead to feature confusion. To reduce the feature confusion, we propose to adopt dual classification loss (DCL): + +$$ +\mathcal {L} _ {c l s} = \underbrace {\mathbb {E} _ {t} \left[ \log p _ {\phi_ {c l s} ^ {p l}} (y | x) \right]} _ {\mathcal {L} _ {c l s} ^ {p l}} + \underbrace {\mathbb {E} \left[ \log p _ {\phi_ {c l s} ^ {l a}} (y | z _ {t}) \right] + \mathbb {E} \left[ \log p _ {\phi_ {c l s} ^ {l a}} (y | z _ {i}) \right]} _ {\mathcal {L} _ {c l s} ^ {l a}}, \tag {7} +$$ + +where $\mathcal{L}_{cls}^{pl}$ and $\mathcal{L}_{cls}^{la}$ tend to perform classification constraints in instance-level and latent-level, respectively. For the instance-level, the proposed PVA learns task-specific knowledge with training samples $p_{\phi_{cls}^{pl}}(y|\boldsymbol{x}) = \frac{\exp(\cos(\mathcal{I}(\boldsymbol{x}),\mathcal{T}(t_y)) / \sigma)}{\sum\exp(\cos(\mathcal{I}(\boldsymbol{x}),\mathcal{T}(t_n)) / \sigma)}$ where $y$ and $\mathcal{T}(t_y)$ represent the class labels and semantic features mentioned in Eq. (2). Based on the end-to-end training paradigm, the discrimination of text features can be preserved. For the latent level, the softmax classifier $\phi_{cls}^{la}$ is trained using latent features and corresponding labels to ensure the decision boundary is clear enough for the final classification task. + +As previously illustrated, we develop the overall training process with SVAE, cross-domain, and DCL classification loss: + +$$ +\mathcal {L} = \mathcal {L} _ {S V A E} + \alpha \mathcal {L} _ {d i s} + \beta \mathcal {L} _ {c r} + \gamma \mathcal {L} _ {c l s}, \tag {8} +$$ + +where $\mathcal{L}_{SVAE} = \mathcal{L}_{visual}^{svae} + \mathcal{L}_{text}^{svae}$ and $\alpha, \beta, \gamma$ are hyper parameters. + +Separate Novel Classes from Base Classes. Following the training stage, both the visual and semantic latent features are well represented. Thus, novel samples entangled with base samples can be easily separated from the test space using distance comparisons. Specifically, as shown on the right side of Fig. 2, we measure the distance between test samples and learned prompts equipped with the [CLASS] token by: + +$$ +d i s t a n c e = \cos \left(z _ {i} ^ {t e}, z _ {t}\right), \tag {9} +$$ + +where $\cos(,)$ denotes the cosine similarity. $z_i^{te} = E_i(x^{te})$ denotes the latent features encoded from test visual features, which may come from base or novel domains. $z_t = [z_t^b, z_t^n]$ contain the latent text features of all the classes (i.e., base and novel), where [,] denotes concatenate operation for the latent prompts of base and novel domains. Intuitively, if the test sample belongs to a novel domain, the distance $\cos(z_i^{te}, z_t^n)$ would be closer than $\cos(z_i^{te}, z_t^b)$ . + +By leveraging the distance metric, we can assign domain labels by: + +$$ +L = \left\{ \begin{array}{l} B a s e, \max \left\{c o s \left(z _ {i} ^ {t e}, z _ {t} ^ {b}\right) \mid \forall t \in \mathcal {A} _ {s} \right\} \geq t h r e s h o l d \\ N o v e l, \max \left\{c o s \left(z _ {i} ^ {t e}, z _ {t} ^ {b}\right) \mid \forall t \in \mathcal {A} _ {s} \right\} < t h r e s h o l d \end{array} \right\}. \tag {10} +$$ + +Here, we alternate the hand-crafted threshold with the base knowledge to fit different datasets and reduce complexity. In practice, we propose to automatically calculate the threshold by $\tau$ , where $\tau = \frac{\text{count}(d^j > \text{threshold})}{N}$ . $d^j$ is the maximum distance between $j$ -th training samples and learned prompts, and $N$ is the number of all training samples. The larger the value $\tau$ is, the smaller the threshold becomes, meaning that more samples are divided into base classes. Then we only need to choose a suitable $\tau \in [0,1]$ to balance the data separation. + +![](images/e09fff83c686f97bbaf92d0f4dc14968e7854c02694848f50e08403c391d2e4b.jpg) +Fig. 3: The architecture of the Visual and Semantic Refinement modules. + +Fine-tuning for GZSL Classification. When detecting based on the proposed distance, the domain for these test samples is accurately assigned. Although the challenging GZSL task can be converted into a traditional ZSL and a supervised task, how to recognize novel classes is also a tricky problem. To improve the transfer of general knowledge for novel classes, we further refine the output feature of the learned adapters with the original zero-shot features via a residual connection. As shown in the Fig. 2 and Fig. 3, we refine the final output of adapters by $t^{*} = \epsilon \cdot \tilde{t} + (1 - \epsilon) \cdot t$ and $x^{*} = \epsilon \cdot \tilde{x} + (1 - \epsilon) \cdot x$ . Since CLIP is obtained by massive image-text pairs that are not limited to the current samples, the features of the original encoder are easier to transfer. Based on the + +complement of stored knowledge from CLIP and task-specific knowledge from adapters, we can thus improve the transferability of the PVA. + +# 4 Experiments + +# 4.1 Setup + +Datasets and Setting. For the GZSC and CDT tasks, the datasets include two coarse-grained datasets, i.e., AwA2 [12] and SUN [30], and two fine-grained datasets i.e., CUB [36] and FLO [29], containing 50, 717, 200, and 102 categories, respectively. It is worth noting that due to space limitations, we only report the results for popular AwA2, CUB, and SUN in Table 1. The performance is evaluated by the harmonic mean of the average per class Top-1 accuracy: $\mathbf{H} = 2*\mathbf{B}*\mathbf{N} / (\mathbf{B} + \mathbf{N})$ , where $\mathbf{B}$ and $\mathbf{N}$ represent the performance of base and novel classes, respectively. To further explore the knowledge transferability of the proposed method, we follow CoCoOP [44] to test the generalization performance of the trained model for other datasets. Specifically, we first train the PVA on AwA2, which is regarded as a source dataset. Then we compare the performance which is tested on the remaining three datasets without fine-tuning. + +Implementation details. The proposed PVA is comprised of two sub-models: a visual adapter and a text adapter. Each adapter consists of an encoder and a decoder implemented by two-layer FC networks with 256 hidden units and ReLU. The input of the adapters comes from the frozen CLIP (ViT-B/16 [11,23]) encoder with 512 dimensions. The latent feature dimension is set to 16 for all these datasets. For the prompts, the learnable parameters length $M = 4$ . We train our proposed PVA by Adam optimizer with a 1e-4 learning rate. We select $\alpha = 0.1$ , $\beta = 1$ , and $\gamma = 1$ as hyperparameters, while $\tau$ and $\epsilon$ are discussed in the following section. + +# 4.2 Comparisons with SOTA + +Generalized Zero-Shot Classification. We partition existing methods into three paradigms to compare the GZSL performance in Table. 1. Specifically, our method achieves the best harmonic mean of $90.7\%$ and $65.8\%$ on AwA2 and SUN, respectively. Although we observe a slightly lower result on CUB than PSVMA [23], our method still achieves competitive results without requiring manually designed attributes. Compared to the popular VLMs-based method CoOP [45], our method achieves a $15.3\%$ improvement on the $\mathbf{N}$ metric of AwA2, indicating the effectiveness of the proposed PVA for reducing prediction bias. CoOP achieves worse $\mathbf{N}$ than the original CLIP, which indicates that existing fine-tuned methods indeed suffer from feature confusion of novel classes, resulting in worse transferability. Notably, the proposed PVA not only improves the performance of novel classes but also ensures the discriminative property of base classes by + +Table 1: GZSC performance (\%) comparisons on three popular benchmarks. E, G and C represent Embedding, Generative, and Calibration methods, respectively. The best results and second best results are marked by bold and underline. PVA+R denotes the proposed method equipped with refinement modules. “†” denotes that the methods are implemented by ViT [11] networks. + +
MethodsParadigmAwA2CUBSUN
BNHBNHBNH
DVBE [26]70.863.667.060.253.256.537.245.040.7
GEM [24]77.564.870.677.164.870.435.738.136.9
TransZero [4]82.361.370.268.369.368.833.452.640.8
MSDN [5]74.562.067.767.568.768.134.252.241.3
I2MVFomer [27]79.675.777.659.942.549.7---
DUET [9]†E84.763.772.772.862.967.545.845.745.8
PSVMA [23]†77.373.675.477.870.173.845.361.752.3
CLIP [31]†92.986.689.655.154.955.040.249.444.3
CoOP [45]†95.372.782.563.849.255.649.353.551.3
SHIP [37]†94.484.189.058.955.357.1---
f-VAEGAN [40]70.657.663.560.148.453.638.045.141.3
TF-VAEGAN [28]75.159.866.664.752.858.140.745.643.0
CEZSL [15]78.663.170.066.863.965.338.648.843.1
FREE [6]G75.460.467.159.955.757.737.247.441.7
HSVA [7]76.659.366.858.352.755.339.048.643.3
ICCE [20]82.365.372.865.567.366.4---
CS [3]77.85.911.063.812.621.0---
COSMO [2]---60.541.048.940.235.337.6
OOD [8]75.955.664.250.249.549.833.941.737.0
GatingAE [21]C81.360.369.358.155.456.738.145.341.4
PVA (Ours)92.788.090.378.562.569.663.466.364.8
PVA+R (Ours)93.688.090.779.665.772.062.569.565.8
+ +separating novel and base domains. For instance, our method achieves the best B of $79.6\%$ and $63.4\%$ on the CUB and SUN datasets, respectively. + +In addition, the calibration-based method, i.e., GatingAE [21] focuses on data separation while ignoring the model's transferability. In contrast, we model the entire process in an adapter-style tuning fashion to consider knowledge transfer. Intuitively, it can be seen from the last two rows that the proposed refinement networks further improve the $\mathbf{N}$ results of $3.2\%$ on both CUB and SUN. This indicates that general knowledge should indeed be introduced by refinement networks to enhance the transferability of the model. + +Cross-dataset Transfer Learning. To further evaluate the generalization ability of the model in an open-world setting, we report cross-dataset transfer learning performance in Table 2. Specifically, we train the model on AwA2 base classes and then test the performance on three target datasets. Since all target samples are test-only, we rename the original splits for base and novel classes to Subset1 (Sub1) and Subset2 (Sub2), respectively. As shown in the table, CoOP [45] is even worse than CLIP as it suffers from an overfitting problem for base classes. In contrast, by combining the prompt learning and adapter + +Table 2: Cross-dataset transfer performance (%) comparisons on three popular benchmarks. The model is trained on AwA2 and then applied to target datasets. Sub1 and Sub2 represent data splits with different classes. $\triangle$ denotes PVA's gain over CoOP. + +
MethodsAwA2 → CUBAwA2 → SUNAwA2 → FLO
Sub1Sub2HSub1Sub2HSub1Sub2H
CLIP [31]54.855.255.040.241.440.867.965.666.7
CoOP [45]50.853.552.144.637.540.768.166.367.2
PVA+R (Ours)56.855.556.144.938.041.171.268.669.8
△+6.0+2.0+4.0+0.3+0.5+0.4+3.1+2.3+2.6
+ +Table 3: Ablation study of the proposed PVA. We highlight the $\mathrm{PVA + R}$ variants of our methods with a light blue background. + +
LdisLclsLcrεAwA2CUB
BNHBNH
✓89.252.966.467.713.522.5
✓✓90.183.486.672.161.066.1
✓✓✓92.788.090.378.562.569.6
✓✓✓0.191.788.990.373.765.069.0
✓✓✓0.592.488.990.672.265.968.9
✓✓✓0.993.688.090.779.664.771.4
+ +Table 4: Ablation study of the domain detection. FPR denotes the False Positive Rate (in %) on the threshold that yields $95\%$ TPR. + +
LdisLclsLcrCUBSUN
FPR ↓AUC ↑FPR ↓AUC ↑
✓77.176.289.062.6
✓✓10.598.066.387.2
✓✓✓2.699.211.397.8
MAX-3 [17]79.673.492.361.0
OOD [8]85.071.288.863.1
COSMO [2]72.082.077.577.7
+ +tuning, PVA+R outperforms CoOP by $4.0\%$ , $0.4\%$ , and $2.6\%$ on CUB, SUN, and FLO, respectively. Additionally, it is more interesting to look backward to Table. 1, the performance on CUB observed by traditional generative methods, such as F-VAEGAN [40] and HSVA [7] is even inferior to PVA+R transferred from AwA2. This also demonstrates that our prompt-adapter hybrid framework can be extended to a variety of downstream tasks. + +# 4.3 Ablation Study + +Different Constraints. To give a clear insight into each constraint, we conduct a series of ablation experiments. As shown in Table. 3, the performance gradually improves as we incorporate $\mathcal{L}_{dis}$ , $\mathcal{L}_{cls}$ and $\mathcal{L}_{cr}$ into the original baseline. It is worth noting that we observe significant improvements when $\mathcal{L}_{cls}$ is added. This is because classification constraints can help models learn discriminative and reasonable prompts while ensuring class-wise alignments for visual and semantic branches. Unlike the changing trend of the above constraints, PVA+R achieves more stable yet high results across various $\epsilon$ , indicating that refinement processes balance general and task-specific knowledge to improve overall performance. + +Data Separation. To further explore the results of feature separation, we report the binary classification results. As shown in Table. 4, we observe that the AUC raises with the help of $\mathcal{L}_{cls}$ and $\mathcal{L}_{cr}$ , maintaining the same trend as $\mathbf{H}$ shown in Table. 3. In addition, PVA exhibits much stronger domain detection + +![](images/f8074b305c8e71acb0c5ac0bfd6e622246f38f872aca8a5c1684fb429ca63cb3.jpg) +Fig. 4: (a) ROC curves on four benchmarks. (b) GZSL performance (N and H) on AwA2 with different $\tau$ . (c) Comparisons between different feature extractors on AwA2. We replace original Res101 [16] based TF-VAE [28] with CLIP features, termed TF-VAE+CLIP. + +![](images/c6f53fa1798d8b46927d60dac426bf81cc6e9449ac4f53ec481453078547b067.jpg) + +![](images/a2986ccec49925b9e9db6545ff447725be47f30254a6a1c83f488183fb1b6755.jpg) + +Table 5: Effectiveness analysis of variational adapter and alternatives. w/ and w/o represent with and without respectively. DS is the abbreviation of Data Separation. $\triangle$ represents the gain over the second-best results. + +
MethodsAwA2CUBSUNFLO
BNHBNHBNHBNH
MLP w/o DS95.376.885.060.354.157.051.252.751.971.868.970.3
MLP w/ DS92.869.079.170.362.166.653.166.859.188.272.879.8
VAE w/ DS93.688.090.779.665.772.062.569.565.892.172.180.9
△-1.7+11.2+5.7+9.3+3.6+5.4+9.4+2.7+6.7+3.9-0.7+1.1
+ +ability than other related methods, leading to pleasing performance. We draw the ROC curves in Fig. 4(a) to report detection results for these datasets, where all AUCs are greater than $96\%$ . This also indicates that novel samples can be effectively separated from entangled base samples by well-trained latent features of adapters. In addition, we believe that the performance of data separation is important because if the domain cannot be accurately distinguished, it will directly affect the classification results and even have negative effects. + +Furthermore, we report quantitative analysis between other related methods and the proposed PVA in the lower half of Table. 4. It can be seen that these methods fail to accurately classify entangled features at the domain level, which is consistent with the results in Table. 1. + +Analysis of Variational Adapter. We evaluate the effects of different adapter structures. As shown in Table. 5, we first adopt MLPs as the adapter to fine-tune on four datasets. It can be seen that the performance of the novel class decreases significantly in MLPs w/o DS. This is because MLPs fail to learn transferable knowledge due to the simple structures. Although MLP w/ DS shows considerable improvements of H on CUB(9.6%), SUN(7.2%), and FLO (9.5%) with domain detection, it still suffers from unstable performance. For example, the harmonic mean drops from 85.0% to 79.1% on AwA2 after domain detection. + +![](images/2dd4024e09bb6639c29d8f4833796477d7a48f9ca5f5b30a98bd26f6ddd3f44a.jpg) +Fig. 5: t-SNE visualizations [25] of learnable prompts and visual features with (w/) Visual and Semantic adapters. Grey and black triangles denote the base and novel prototype, respectively. Color stars denote novel visual features. (Best viewed in color) + +![](images/27bdfd60be8ed1e72a2424aba310226974f48b0c79bf800a75c0c2c7ac145941.jpg) + +![](images/ee7405e2b9fd123408a0562fc85b4e91063053f10e53e58e742e54e1b1b0e3f1.jpg) + +![](images/405bcbc115dbc6788259d3c5885e3c6ee6965cc72272b937d5c463d2a72d6602.jpg) + +![](images/8c0edaaad42356e5875d3461e7858ec10d03b67e9a341b92cd37fe28453a13f2.jpg) +Fig. 6: t-SNE visualizations of latent features for AwA2, CUB and FLO. Grey dots represent base features and blue dots represent novel ones. + +![](images/a2d633cdda08f2fdd33b78c69344479f6afd66d4e4ce96d81698f14cb4ba0d10.jpg) + +![](images/8e8a8a21b1241ed9d1dc55f91fe134575761950df08e9db59f8120da61073308.jpg) + +![](images/a208282314239fe127dba415060a86eda02fbee46a1d52bedaadd27a95fc243c.jpg) + +We speculate that plain MLPs can not sufficiently align vision-language modality in latent space, resulting in poor domain classification. However, the proposed variational adapters capture discriminative yet transferable information for both latent and output features to ensure the performance of domain detection and classification. + +Sensitivity and Backbones. Fig. 4(b) shows the sensitivity of $\tau$ . The performance of $\mathbf{N}$ maintains stable at first and then decreases sharply when $\tau \geq 0.99$ . The reason for this observation is that the larger $\tau$ tends to classify more samples into base classes, resulting in lower $\mathbf{N}$ . The descent speed of $\mathbf{H}$ is less than $\mathbf{N}$ , for the performance of $\mathbf{B}$ improves as $\tau$ increases. In our experiments, we set $\tau = 0.95$ for all the datasets. + +We evaluate the influence of different backbones for fair comparisons. As shown in Fig. 4(c), when we applied CLIP features to existing generative methods such as TF-VAE [28], we did not observe improvements, which are brought by high-quality representations. We speculate that the features extracted from VLMs are discriminative enough for classification, while they do not require additional complex optimization. Different from simple combinations between off-the-shelf methods and CLIP features, we fine-tune the VLMs in a prompt- + +adapter hybrid fashion to guide feature optimization, leading to superior performance. + +# 4.4 Visualization + +Visualizations for Visual and Semantic Features. To show the distribution, we visualize them by t-SNE [25] in Fig. 5. By comparing Fig. 5(a) and Fig. 5(b), we can find that the learnable prompts exhibit a higher degree of dispersion. These learnable prompts capture task-specific knowledge from training samples to improve classification performance. Further, we explore the visual and semantic embedding fine-tuned by the proposed variational adapter. From Fig. 5(c) to Fig. 5(d), we can see that visual adapters tend to learn a more intensive distribution for each class to preserve intra-class information, while semantic adapter refines the corresponding relationship between vision and semantic modalities. By incorporating prompt learning and adapter-style tuning into a unified framework, PVA gives a reasonable solution for downstream task generalization. + +Visualizations for latent Features. We visualize the latent features of both base and novel classes in Fig. 6. It can be seen that blue dots are located in gaps of gray dots with clear boundaries. Thus, we can separate these novel samples by cosine similarity. Although most of the novel samples can be accurately separated, some samples are also misclassified due to feature confusion. This is coincident with the results of Fig. 4(a). + +# 5 Conclusion + +In this paper, we provide a Prompt-Adapter hybrid method PVA to handle the feature confusion problem caused by unbalanced fine-tuning. In general, we fine-tune the corresponding variational adapters for visual and language branches by aligning latent representations of them, where the input of the language adapter is the learnable textual tokens. In addition, we refine adapter output features with global features stored in the original CLIP to improve knowledge transfer. Once trained, we can build two independent classification tasks by similarity metrics. We show that the proposed PVA can achieve state-of-the-art performance on GZSC and challenging CDT tasks. Considering limitations, although PVA achieves remarkable results, it requires additional training costs, which we aim to alleviate in the future. + +# Acknowledgment + +This research was supported in part by NSFC (12326608, U19B2043, 62441602), National Science Foundation for Distinguished Young Scholars under Grant 62225605, Zhejiang Provincial Natural Science Foundation of China under Grant LD24F020016, the Key R&D Program of Zhejiang Province, China 2023C01043, Science and Technology Innovation of Ningbo (2023Z236, 2024Z294), and the Fundamental Research Funds for the Central Universities. + +# References + +1. Akata, Z., Perronnin, F., Harchaoui, Z., Schmid, C.: Label-embedding for attribute-based classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 819-826 (2013) +2. Atzmon, Y., Chechik, G.: Adaptive confidence smoothing for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11671-11680 (2019) +3. Chao, W.L., Changpinyo, S., Gong, B., Sha, F.: An empirical study and analysis of generalized zero-shot learning for object recognition in the wild. In: Proceedings of the European Conference on Computer Vision. pp. 52-68. Springer (2016) +4. Chen, S., Hong, Z., Liu, Y., Xie, G.S., Sun, B., Li, H., Peng, Q., Lu, K., You, X.: Transzero: Attribute-guided transformer for zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 330-338 (2022) +5. Chen, S., Hong, Z., Xie, G.S., Yang, W., Peng, Q., Wang, K., Zhao, J., You, X.: Msdn: Mutually semantic distillation network for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7612-7621 (2022) +6. Chen, S., Wang, W., Xia, B., Peng, Q., You, X., Zheng, F., Shao, L.: Free: Feature refinement for generalized zero-shot learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 122-131 (2021) +7. Chen, S., Xie, G., Liu, Y., Peng, Q., Sun, B., Li, H., You, X., Shao, L.: Hsva: Hierarchical semantic-visual adaptation for zero-shot learning. Proceedings of the Advances in Neural Information Processing Systems 34, 16622-16634 (2021) +8. Chen, X., Lan, X., Sun, F., Zheng, N.: A boundary based out-of-distribution classifier for generalized zero-shot learning. arXiv preprint arXiv:2008.04872 (2020) +9. Chen, Z., Huang, Y., Chen, J., Geng, Y., Zhang, W., Fang, Y., Pan, J.Z., Chen, H.: Duet: Cross-modal semantic grounding for contrastive zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 405-413 (2023) +10. Davidson, T.R., Falorsi, L., De Cao, N., Kipf, T., Tomczak, J.M.: Hyperspherical variational auto-encoders. arXiv preprint arXiv:1804.00891 (2018) +11. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020) +12. Farhadi, A., Endres, I., Hoiem, D., Forsyth, D.: Describing objects by their attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1778-1785 (2009) + +13. Gao, P., Geng, S., Zhang, R., Ma, T., Fang, R., Zhang, Y., Li, H., Qiao, Y.: Clip-adapter: Better vision-language models with feature adapters. International Journal of Computer Vision pp. 1-15 (2023) +14. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Proceedings of the Advances in Neural Information Processing Systems. pp. 2672-2680 (2014) +15. Han, Z., Fu, Z., Chen, S., Yang, J.: Contrastive embedding for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2371-2381 (2021) +16. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016) +17. Hendrycks, D., Gimpel, K.: A baseline for detecting misclassified and out-of-distribution examples in neural networks. arXiv preprint arXiv:1610.02136 (2016) +18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: Proceedings of the International Conference on Machine Learning. pp. 4904-4916 (2021) +19. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023) +20. Kong, X., Gao, Z., Li, X., Hong, M., Liu, J., Wang, C., Xie, Y., Qu, Y.: Encompactness: Self-distillation embedding & contrastive generation for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9306-9315 (2022) +21. Kwon, G., Al Regib, G.: A gating model for bias calibration in generalized zero-shot learning. IEEE Transactions on Image Processing (2022) +22. Li, X., Xu, Z., Wei, K., Deng, C.: Generalized zero-shot learning via disentangled representation. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 1966-1974 (2021) +23. Liu, M., Li, F., Zhang, C., Wei, Y., Bai, H., Zhao, Y.: Progressive semantic-visual mutual adaption for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15337-15346 (2023) +24. Liu, Y., Zhou, L., Bai, X., Huang, Y., Gu, L., Zhou, J., Harada, T.: Goal-oriented gaze estimation for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3794-3803 (2021) +25. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(11) (2008) +26. Min, S., Yao, H., Xie, H., Wang, C., Zha, Z.J., Zhang, Y.: Domain-aware visual bias eliminating for generalized zero-shot learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 12664-12673 (2020) +27. Naeem, M.F., Khan, M.G.Z.A., Xian, Y., Afzal, M.Z., Stricker, D., Van Gool, L., Tombari, F.: I2mvformer: Large language model generated multi-view document supervision for zero-shot image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15169-15179 (2023) +28. Narayan, S., Gupta, A., Khan, F.S., Snoek, C.G., Shao, L.: Latent embedding feedback and discriminative features for zero-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 479-495. Springer (2020) + +29. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: Indian Conference on Computer Vision, Graphics & Image Processing. pp. 722-729 (2008) +30. Patterson, G., Hays, J.: Sun attribute database: Discovering, annotating, and recognizing scene attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2751-2758 (2012) +31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763 (2021) +32. Schonfeld, E., Ebrahimi, S., Sinha, S., Darrell, T., Akata, Z.: Generalized zero-and few-shot learning via aligned variational autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8247-8255 (2019) +33. Su, H., Li, J., Chen, Z., Zhu, L., Lu, K.: Distinguishing unseen from seen for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7885-7894 (2022) +34. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. proceedings of the Advances in Neural Information Processing Systems (2017) +35. Villani, C., et al.: Optimal transport: old and new, vol. 338. Springer (2009) +36. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011) +37. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023) +38. Xian, Y., Akata, Z., Sharma, G., Nguyen, Q., Hein, M., Schiele, B.: Latent embeddings for zero-shot classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 69-77 (2016) +39. Xian, Y., Lorenz, T., Schiele, B., Akata, Z.: Feature generating networks for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5542-5551 (2018) +40. Xian, Y., Sharma, S., Schiele, B., Akata, Z.: f-vaegan-d2: A feature generating framework for any-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10275-10284 (2019) +41. Xu, B., Zeng, Z., Lian, C., Ding, Z.: Generative mixup networks for zero-shot learning. IEEE Transactions on Neural Networks and Learning Systems (2022) +42. Zhang, L., Xiang, T., Gong, S.: Learning a deep embedding model for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2021-2030 (2017) +43. Zhang, R., Zhang, W., Fang, R., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free adaption of clip for few-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 493-510. Springer (2022) +44. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022) +45. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022) \ No newline at end of file diff --git a/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/images.zip b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..71b48594984705f76693797dbab121f8ecd03169 --- /dev/null +++ b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:be7e824df51042e9af540071c2d00ec180db1dd3ca44e7a25744ac1033578054 +size 490127 diff --git a/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/layout.json b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..1df9f793b0eab2d1f66f263152f951fcbc7b1670 --- /dev/null +++ b/2024/Improving Zero-Shot Generalization for CLIP with Variational Adapter/layout.json @@ -0,0 +1,10274 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 147, + 111, + 465, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 111, + 465, + 148 + ], + "spans": [ + { + "bbox": [ + 147, + 111, + 465, + 148 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization for CLIP with Variational Adapter" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "spans": [ + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "text", + "content": "Ziqian Lu" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "text", + "content": ", Fengli Shen" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "text", + "content": ", Mushui Liu" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "text", + "content": ", Yunlong Yu" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "text", + "content": "*, and Xi Li" + }, + { + "bbox": [ + 150, + 167, + 462, + 181 + ], + "type": "inline_equation", + "content": "^{1}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 208, + 190, + 405, + 201 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 208, + 190, + 405, + 201 + ], + "spans": [ + { + "bbox": [ + 208, + 190, + 405, + 201 + ], + "type": "text", + "content": "1 Zhejiang University, Hangzhou 310007, China" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 143, + 201, + 470, + 222 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 143, + 201, + 470, + 222 + ], + "spans": [ + { + "bbox": [ + 143, + 201, + 470, + 222 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 143, + 201, + 470, + 222 + ], + "type": "text", + "content": " Yangtze Delta Region Institute (Huzhou) University of Electronic Science and Technology of China, Huzhou 313001, China" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 205, + 224, + 408, + 235 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 224, + 408, + 235 + ], + "spans": [ + { + "bbox": [ + 205, + 224, + 408, + 235 + ], + "type": "text", + "content": "{ziqianlu,1ms,yuyunlong,xilizju}@zju.edu.cn" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 241, + 236, + 371, + 245 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 236, + 371, + 245 + ], + "spans": [ + { + "bbox": [ + 241, + 236, + 371, + 245 + ], + "type": "text", + "content": "fenglishen@csj.uestc.edu.cn" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 275, + 455, + 485 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 275, + 455, + 485 + ], + "spans": [ + { + "bbox": [ + 159, + 275, + 455, + 485 + ], + "type": "text", + "content": "Abstract. The excellent generalization capability of pre-trained Vision-Language Models (VLMs) makes fine-tuning VLMs for downstream zero-shot tasks a popular choice. Despite achieving promising performance in the professionality of base classes, most existing fine-tuned methods suffer from feature confusion of novel classes, resulting in unsatisfactory transferability. To address this problem, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that explicitly reduces the prediction bias by separating base and novel samples. Specifically, we design two variational adapters with learnable textual tokens to align latent representations for each modality in a shared latent space. Once trained, we can separate novel samples from entangled space using the similarity metric of latent features, i.e., converting confusion task into two independent ones (One for base classes and the other for novel classes). Moreover, to improve the transferability for novel classes, we further refine the output features of the learned adapters with the global features via a residual connection. We conduct extensive experiments on Generalized Zero-Shot Learning and Cross-Dataset Transfer Learning to demonstrate the superiority of our approach and establish a new state-of-the-art on four popular benchmarks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 494, + 453, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 494, + 453, + 517 + ], + "spans": [ + { + "bbox": [ + 159, + 494, + 453, + 517 + ], + "type": "text", + "content": "Keywords: Visual-Language Models " + }, + { + "bbox": [ + 159, + 494, + 453, + 517 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 494, + 453, + 517 + ], + "type": "text", + "content": " Zero-Shot Generalization " + }, + { + "bbox": [ + 159, + 494, + 453, + 517 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 494, + 453, + 517 + ], + "type": "text", + "content": " Variational Adapter" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 537, + 230, + 550 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 537, + 230, + 550 + ], + "spans": [ + { + "bbox": [ + 132, + 537, + 230, + 550 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 562, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 562, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 562, + 482, + 647 + ], + "type": "text", + "content": "Recently, pre-trained Vision-Language Models (VLMs) such as CLIP [31] and ALIGN [18] have demonstrated remarkable applicability across various downstream tasks such as Zero-Shot Learning (ZSL) [1, 38]. To further boost the performance on downstream tasks, recent studies have proposed several fine-tuning methods based on the VLMs structure. In general, existing fine-tuning methods can be grouped into two lines: (1) Prompt Learning (PL) [19, 44, 45] is a paradigm that leverages a minimal set of learnable parameters, known as" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 234, + 666 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 234, + 666 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 234, + 666 + ], + "type": "text", + "content": "* Corresponding author" + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 208, + 114, + 389, + 213 + ], + "blocks": [ + { + "bbox": [ + 208, + 114, + 389, + 213 + ], + "lines": [ + { + "bbox": [ + 208, + 114, + 389, + 213 + ], + "spans": [ + { + "bbox": [ + 208, + 114, + 389, + 213 + ], + "type": "image", + "image_path": "a2630156beb8ce170f33e4adef823e465e6545a01929edb148fe7b94516b2d54.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 246, + 213, + 381, + 223 + ], + "lines": [ + { + "bbox": [ + 246, + 213, + 381, + 223 + ], + "spans": [ + { + "bbox": [ + 246, + 213, + 381, + 223 + ], + "type": "text", + "content": "(a) Distribution of all the classes." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 206, + 224, + 408, + 320 + ], + "blocks": [ + { + "bbox": [ + 206, + 224, + 408, + 320 + ], + "lines": [ + { + "bbox": [ + 206, + 224, + 408, + 320 + ], + "spans": [ + { + "bbox": [ + 206, + 224, + 408, + 320 + ], + "type": "image", + "image_path": "e2b837fad366eb618182490e19ad195a4b1763099cd7cd993ab1a5a078fd3f99.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 170, + 321, + 299, + 331 + ], + "lines": [ + { + "bbox": [ + 170, + 321, + 299, + 331 + ], + "spans": [ + { + "bbox": [ + 170, + 321, + 299, + 331 + ], + "type": "text", + "content": "(b) Distribution of base classes." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 310, + 321, + 441, + 332 + ], + "lines": [ + { + "bbox": [ + 310, + 321, + 441, + 332 + ], + "spans": [ + { + "bbox": [ + 310, + 321, + 441, + 332 + ], + "type": "text", + "content": "(c) Distribution of novel classes." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 340, + 482, + 385 + ], + "lines": [ + { + "bbox": [ + 130, + 340, + 482, + 385 + ], + "spans": [ + { + "bbox": [ + 130, + 340, + 482, + 385 + ], + "type": "text", + "content": "Fig. 1: t-SNE visualization of AWA2 dataset with CoOP [45]. The color and grey pentagrams represent novel and base samples, respectively. (a) There is obvious overlap and confusion in the distribution of bobcat, tiger, and leopard. (b-c) The confusion issue could be efficiently addressed if the two class sets were meticulously segregated." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 411, + 482, + 471 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 471 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 471 + ], + "type": "text", + "content": "prompts, to efficiently adapt pre-trained models to the downstream tasks in a data-efficient manner while maintaining competitive performance. (2) Adapter-style Tuning (AT) [13, 43] involves introducing adapter layers or modules into the pre-trained models, allowing only these adapter layers to be updated during fine-tuning while the rest of the models' parameters remain frozen." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 472, + 482, + 579 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 579 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 579 + ], + "type": "text", + "content": "However, both PL and AT paradigms only fine-tune VLMs on base classes, resulting in extreme prediction bias towards base classes. This bias is exacerbated in challenging open-world vision tasks (e.g., Generalized Zero-Shot Learning, GZSL [5,22,39]) due to the feature confusion. As shown in Fig. 1(a), the novel samples (color pentagrams) are located around the base samples (grey pentagrams) owing to the lack of prior knowledge of the former. These fine-tuning methods trained on unbalanced base data may tend to classify all samples into base classes and struggle to generalize to novel classes, reducing their transferability." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "To this end, we propose a divide-and-conquer approach called Prompt-based Variational Adapter (PVA) that improves both the professionality and transferability of the VLMs model. Inspired by previous PL work, we learn task-specific textual tokens instead of subjective hand-crafted attributes. Compared to the static attributes, these learnable prompts can not only capture more discriminative information but also provide better diversity for subsequent adaptation learning. Then, two variational adapters are constructed to generate latent repre" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 100 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 235 + ], + "type": "text", + "content": "sentations in a shared latent space, in which we adopt class-wise and distributionwise vision-language constraints to ensure alignment and interaction properties for each branch. With the help of variational structures, adapters carefully align multi-modal features in redundancy-free latent space, providing accurate visual-semantic interactions. After that, we can search for a threshold to distinguish the base and novel domains by measuring the similarity between the latent representations of the two domains. Based on the similarity, GZSL can thus be converted into a base class classification and a zero-shot task of novel classes, as shown in Fig. 1(b-c). Once base and novel samples are distinguished, the prediction bias problem will naturally be addressed." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 236, + 480, + 366 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 480, + 366 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 480, + 366 + ], + "type": "text", + "content": "In addition, even if the test spaces are accurately distinguished, how to classify novel samples remains a challenging task. Thus, we further refine the output feature of the learned adapters with the global features (extracted from the original CLIP encoder) via a residual connection to improve the transferability. Benefiting from residual connection, variational adapters can fully exploit the transferable general knowledge stored in the original CLIP and freshly learned knowledge originated from training samples. In fact, different from existing methods that train an extra binary classifier to distinguish domains, we efficiently model the entire process (i.e., data separation and classification) in a unified Prompt-Adapter hybrid framework to simultaneously preserve the professionalism and transferability of the VLMs model." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 146, + 368, + 326, + 379 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 368, + 326, + 379 + ], + "spans": [ + { + "bbox": [ + 146, + 368, + 326, + 379 + ], + "type": "text", + "content": "In summary, our main contributions are:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 387, + 484, + 577 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 387, + 484, + 446 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 387, + 484, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 387, + 484, + 446 + ], + "type": "text", + "content": "- We introduce a novel approach, the Prompt-based Variational Adapter (PVA), specifically designed to address the challenges of GZSL. To the best of our knowledge, our method marks the inaugural exploration of the synergy between PL and AT in the context of fine-tuning CLIP models, offering a novel and effective solution to this complex task." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 447, + 480, + 517 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 447, + 480, + 517 + ], + "spans": [ + { + "bbox": [ + 138, + 447, + 480, + 517 + ], + "type": "text", + "content": "- We propose to utilize the latent representations of the adapter, which are tightly governed by the vision-language distribution, to distinguish novel classes from base classes. By segmenting the entire test space into two distinct and independent subspaces, the prediction bias that typically favors base classes is explicitly mitigated, thereby enhancing the accuracy and fairness of the classification process." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 518, + 480, + 577 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 518, + 480, + 577 + ], + "spans": [ + { + "bbox": [ + 138, + 518, + 480, + 577 + ], + "type": "text", + "content": "- Our experimental results demonstrate that the proposed PVA achieves state-of-the-art performance across a wide range of downstream tasks, including GZSL and Cross-Dataset transfer learning. Notably, PVA exhibits significant improvements in recognizing novel classes, showcasing its effectiveness in addressing the inherent challenges of these tasks." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 596, + 237, + 609 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 596, + 237, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 596, + 237, + 609 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 621, + 321, + 634 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 621, + 321, + 634 + ], + "spans": [ + { + "bbox": [ + 132, + 621, + 321, + 634 + ], + "type": "text", + "content": "2.1 Generalized Zero-Shot Learning" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 479, + 665 + ], + "type": "text", + "content": "How to recognize objects in an open-world visual environment has attracted increasing interest in recent years. GZSL [5,22,23,39] is one of the relevant research" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 295 + ], + "type": "text", + "content": "fields focusing on open-world visual tasks. Specifically, GZSL aims to recognize both base and novel objects, relying solely on labeled samples from the base classes. To achieve this goal, existing methods can be grouped into two folds: (1) Embedding-based methods [4, 23, 42], which focus on learning a visual-semantic mapping in visual, semantic or latent space for cross-modal interactions. However, a major drawback of Embedding-based methods is the prediction bias toward base classes for the lack of novel labeled data. Therefore, some researchers tend to explore feature-generation methods to reduce prediction bias. (2) Generative methods [7, 39, 41] aim to generate the visual features or prototype of the novel classes by various generative networks, such as generative adversarial networks (GANs) [14] and variational autoencoders (VAEs) [32]. Despite the promising results, these methods still require massive annotated data and semantic descriptions (e.g., sentences, hand-crafted attributes). In addition, since the generated features come from noise inputs, they usually suffer from extreme domain shift problems." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 296, + 482, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 296, + 482, + 415 + ], + "spans": [ + { + "bbox": [ + 130, + 296, + 482, + 415 + ], + "type": "text", + "content": "Different from these existing methods, we explicitly aim to tackle the prediction bias problem by converting the GZSL into a ZSL classification task and a supervised task. One of the related methods is calibration, which has been explored in several recent works [2, 3, 8, 33]. ESZSL [3] calibrates the prediction by directly reducing the probability of base classes. COSMO [2] proposes a soft combination method without any training samples. OOD [8] and DUS [33] attempt to learn the boundary from base samples to separate novel classes from entangled space. Different from the aforementioned methods, we adopt adapter-style tuning equipped with learnable prompts based on VLMs to improve the transferability, not simply learn a domain detector." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 431, + 432, + 443 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 431, + 432, + 443 + ], + "spans": [ + { + "bbox": [ + 131, + 431, + 432, + 443 + ], + "type": "text", + "content": "2.2 Vision-Language Models for Zero-Shot Generalization" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 450, + 482, + 571 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 571 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 571 + ], + "type": "text", + "content": "Pre-trained vision-language models (VLMs) explore the relationship between two different modalities by contrastive learning with massive noisy data. With the help of reasonable structures, these models, such as CLIP [31] and ALIGN [18] can provide excellent representations for both visual and text branches. Based on the remarkable transferability of VLMs, the researchers adopt improved methods to address downstream zero-shot generalization problems. [19,44,45] apply an efficient fine-tuning paradigm by learning representation for the specific task. [13,43] learn extra MLPs to adapt the downstream knowledge. However, these methods only consider knowledge transfer, ignoring the feature confusion that occurs in hybrid open-world spaces." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 586, + 203, + 600 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 586, + 203, + 600 + ], + "spans": [ + { + "bbox": [ + 131, + 586, + 203, + 600 + ], + "type": "text", + "content": "3 Method" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 610, + 222, + 622 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 610, + 222, + 622 + ], + "spans": [ + { + "bbox": [ + 131, + 610, + 222, + 622 + ], + "type": "text", + "content": "3.1 Overall idea" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 481, + 666 + ], + "type": "text", + "content": "Our method introduces a prompt-based variational adapter to address the prediction bias problem without sacrificing task-specific discrimination and transferability. Fig. 2 shows the overall architecture of the proposed PVA. Different" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 140, + 122, + 167, + 129 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 122, + 167, + 129 + ], + "spans": [ + { + "bbox": [ + 140, + 122, + 167, + 129 + ], + "type": "text", + "content": "\\* : Frozen" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 141, + 134, + 173, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 134, + 173, + 140 + ], + "spans": [ + { + "bbox": [ + 141, + 134, + 173, + 140 + ], + "type": "text", + "content": ": Learnable" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 187, + 117, + 222, + 122 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 187, + 117, + 222, + 122 + ], + "spans": [ + { + "bbox": [ + 187, + 117, + 222, + 122 + ], + "type": "text", + "content": "Training Image" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 192, + 123, + 215, + 144 + ], + "blocks": [ + { + "bbox": [ + 192, + 123, + 215, + 144 + ], + "lines": [ + { + "bbox": [ + 192, + 123, + 215, + 144 + ], + "spans": [ + { + "bbox": [ + 192, + 123, + 215, + 144 + ], + "type": "image", + "image_path": "e14089928f68ff080f1ad67d03f6ab951dd888d70bd48eb7994c7b9e9a927801.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 238, + 117, + 263, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 238, + 117, + 263, + 123 + ], + "spans": [ + { + "bbox": [ + 238, + 117, + 263, + 123 + ], + "type": "text", + "content": "Test Image" + } + ] + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 239, + 123, + 263, + 144 + ], + "blocks": [ + { + "bbox": [ + 239, + 123, + 263, + 144 + ], + "lines": [ + { + "bbox": [ + 239, + 123, + 263, + 144 + ], + "spans": [ + { + "bbox": [ + 239, + 123, + 263, + 144 + ], + "type": "image", + "image_path": "fe27a81931f057c6d1f006f12c7c5ed26284c02f6b524598d1e8c44d2b33ff63.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 281, + 118, + 328, + 124 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 281, + 118, + 328, + 124 + ], + "spans": [ + { + "bbox": [ + 281, + 118, + 328, + 124 + ], + "type": "text", + "content": "Base Classes Prompts" + } + ] + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 282, + 127, + 324, + 144 + ], + "blocks": [ + { + "bbox": [ + 282, + 127, + 324, + 144 + ], + "lines": [ + { + "bbox": [ + 282, + 127, + 324, + 144 + ], + "spans": [ + { + "bbox": [ + 282, + 127, + 324, + 144 + ], + "type": "image", + "image_path": "d2aa75bce5bd9a3ee1e531940ae95a48e9637d3bcbf192defbbc25d9aee16a15.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 340, + 118, + 390, + 124 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 340, + 118, + 390, + 124 + ], + "spans": [ + { + "bbox": [ + 340, + 118, + 390, + 124 + ], + "type": "text", + "content": "Novel Classes Prompts" + } + ] + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 347, + 125, + 388, + 144 + ], + "blocks": [ + { + "bbox": [ + 347, + 125, + 388, + 144 + ], + "lines": [ + { + "bbox": [ + 347, + 125, + 388, + 144 + ], + "spans": [ + { + "bbox": [ + 347, + 125, + 388, + 144 + ], + "type": "image", + "image_path": "3857159483504e5a4ed9bb802d1286fe8a5662cd650d508d701536ce51c42856.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "bbox": [ + 408, + 118, + 473, + 143 + ], + "type": "list", + "angle": 0, + "index": 15, + "blocks": [ + { + "bbox": [ + 408, + 118, + 466, + 125 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 408, + 118, + 466, + 125 + ], + "spans": [ + { + "bbox": [ + 408, + 118, + 466, + 125 + ], + "type": "text", + "content": "Visual Latent Feature" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 408, + 128, + 471, + 134 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 408, + 128, + 471, + 134 + ], + "spans": [ + { + "bbox": [ + 408, + 128, + 471, + 134 + ], + "type": "text", + "content": ":Base Text Latent Feature" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 408, + 137, + 473, + 143 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 408, + 137, + 473, + 143 + ], + "spans": [ + { + "bbox": [ + 408, + 137, + 473, + 143 + ], + "type": "text", + "content": "Novel Text Latent Feature" + } + ] + } + ], + "index": 14 + } + ], + "sub_type": "text" + }, + { + "type": "image", + "bbox": [ + 138, + 183, + 320, + 285 + ], + "blocks": [ + { + "bbox": [ + 211, + 163, + 248, + 171 + ], + "lines": [ + { + "bbox": [ + 211, + 163, + 248, + 171 + ], + "spans": [ + { + "bbox": [ + 211, + 163, + 248, + 171 + ], + "type": "text", + "content": "Training Stage" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 138, + 183, + 320, + 285 + ], + "lines": [ + { + "bbox": [ + 138, + 183, + 320, + 285 + ], + "spans": [ + { + "bbox": [ + 138, + 183, + 320, + 285 + ], + "type": "image", + "image_path": "f8e34a843da8b4c98e94e50c8d3d4018cbe358a690827fa8e7109cccd084f81a.jpg" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_body" + } + ], + "index": 17 + }, + { + "type": "image", + "bbox": [ + 331, + 175, + 476, + 300 + ], + "blocks": [ + { + "bbox": [ + 391, + 162, + 417, + 171 + ], + "lines": [ + { + "bbox": [ + 391, + 162, + 417, + 171 + ], + "spans": [ + { + "bbox": [ + 391, + 162, + 417, + 171 + ], + "type": "text", + "content": "Test Stage" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 331, + 175, + 476, + 300 + ], + "lines": [ + { + "bbox": [ + 331, + 175, + 476, + 300 + ], + "spans": [ + { + "bbox": [ + 331, + 175, + 476, + 300 + ], + "type": "image", + "image_path": "42fa33e5eb40ef463a3774785b03efc491194fefb5a06d6ce30845e9ee0df4d1.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "lines": [ + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": "Fig. 2: Overview of the proposed Prompt-based Variational Adapter (PVA). Left: The training framework of PVA with detailed implementations. " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "E_{i}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "D_{i}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "E_{t}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "D_{t}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " refer to visual encoder, visual decoder, text encoder, and text decoder, respectively. " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "z_{i}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " represent latent features for image and text aspects, where the adapter inputs are " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": ", respectively. " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "\\tilde{x}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "\\tilde{t}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " denote the reconstructed features. Right: Test samples are grouped into base domain or novel domain by the cosine similarity between " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "z_{i}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 308, + 482, + 387 + ], + "type": "text", + "content": " (including both base and novel classes), and then classified by two experts." + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 409, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 409, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 409, + 482, + 482 + ], + "type": "text", + "content": "from existing methods, we explicitly reduce the prediction bias by converting the GZSL problem into a ZSL and a supervised classification task. To separate novel (or base) samples from entangled space, we learn two variational adapters to align visual and semantic features, where the text features are equipped with learnable prompts. Then, we further refine the output features of adapters to balance task-specific and general knowledge." + } + ] + } + ], + "index": 21 + }, + { + "bbox": [ + 131, + 498, + 243, + 510 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 498, + 243, + 510 + ], + "spans": [ + { + "bbox": [ + 131, + 498, + 243, + 510 + ], + "type": "text", + "content": "3.2 Revisiting CLIP" + } + ] + } + ], + "index": 22 + }, + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "spans": [ + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "text", + "content": "CLIP [31] consists of two core encoders: a text encoder " + }, + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "inline_equation", + "content": "\\mathcal{T}" + }, + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "text", + "content": " and a visual encoder " + }, + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "inline_equation", + "content": "\\mathcal{I}" + }, + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "text", + "content": ", which are jointly trained by massive noisy image-text pairs with contrastive loss. Each encoder is implemented by either repetitive Transformer [34] or ResNet [16] blocks. Once trained, we can build a zero-shot classifier with arbitrary object names and the corresponding visual features. For example, a " + }, + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 517, + 482, + 612 + ], + "type": "text", + "content": "-way classification can be built by the similarity metric between visual features and text prompts for these classes, such as 'A photo of a [CLASS]'. Formally, the output probability of the model is:" + } + ] + } + ], + "index": 23 + }, + { + "bbox": [ + 214, + 617, + 481, + 647 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 214, + 617, + 481, + 647 + ], + "spans": [ + { + "bbox": [ + 214, + 617, + 481, + 647 + ], + "type": "interline_equation", + "content": "p (y | x) = \\frac {\\exp (\\cos (\\mathcal {I} (x) , \\mathcal {T} (t _ {y})) / \\sigma)}{\\sum_ {n = 1} ^ {N} \\exp (\\cos (\\mathcal {I} (x) , \\mathcal {T} (t _ {n})) / \\sigma)}, \\tag {1}", + "image_path": "27551789382743da0df4ef530aeaeff2c840c15276514f683ba97cd0e0c2855b.jpg" + } + ] + } + ], + "index": 24 + }, + { + "bbox": [ + 131, + 653, + 449, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 653, + 449, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 653, + 449, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 653, + 449, + 666 + ], + "type": "inline_equation", + "content": "\\sigma" + }, + { + "bbox": [ + 131, + 653, + 449, + 666 + ], + "type": "text", + "content": " is the temperature parameter and " + }, + { + "bbox": [ + 131, + 653, + 449, + 666 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 131, + 653, + 449, + 666 + ], + "type": "text", + "content": " represents the target class." + } + ] + } + ], + "index": 25 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 335, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 335, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 335, + 129 + ], + "type": "text", + "content": "3.3 Prompt-based Variational Adapter" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "spans": [ + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": "Problem Setting. GZSL attempts to recognize novel categories by the prior knowledge transferred from the base domain (i.e., seen domain) to the novel domain (i.e., unseen domain). Here, base domain represented by " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{D}^s = \\{(x,y,t_y)|x\\in" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{X}^s,y\\in \\mathcal{Y}^s,t_y\\in \\mathcal{A}^s\\}" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": " is the class label, and " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "t_y" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": " refer to features extracted by the visual and text encoder of CLIP, respectively. Similarly, novel domain is given by " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{D}^u = \\{(x^u,u,t_u)|x^u\\in \\mathcal{X}^u,u\\in \\mathcal{Y}^u,t_u\\in \\mathcal{A}^u\\}" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "u" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": " refers the label of novel classes. The overall goal of GZSL is to learn " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "f_{GZSL}:\\mathcal{X}\\to \\mathcal{Y}^s\\cup \\mathcal{Y}^u" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "inline_equation", + "content": "\\mathcal{Y}^s\\cap \\mathcal{Y}^u = \\emptyset" + }, + { + "bbox": [ + 130, + 136, + 483, + 232 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 250, + 482, + 286 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 250, + 482, + 286 + ], + "spans": [ + { + "bbox": [ + 130, + 250, + 482, + 286 + ], + "type": "text", + "content": "Learn the Prompt-based Variational Adapter. Inspired by the effectiveness of prompt learning, we also learn textual tokens instead of hand-crafted attributes. Formally, the prompts are given in the following form:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 242, + 297, + 481, + 308 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 297, + 481, + 308 + ], + "spans": [ + { + "bbox": [ + 242, + 297, + 481, + 308 + ], + "type": "interline_equation", + "content": "t = [ \\mathrm {T} ] _ {1} [ \\mathrm {T} ] _ {2} \\dots [ \\mathrm {T} ] _ {M} [ \\text {C L A S S} ], \\tag {2}", + "image_path": "a571c795b44f47bd1aca323841af083e4b54cab183b6e41829693cb52f4668af.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "text", + "content": "where each " + }, + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "inline_equation", + "content": "[T]_M" + }, + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "text", + "content": " is a vector with the same dimension (e.g., 512 in CoOP [45]) and " + }, + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "text", + "content": " is the length of the learned prompts. Subsequently, prompts " + }, + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 317, + 482, + 365 + ], + "type": "text", + "content": " and corresponding images are fed into the frozen text and image encoders for adaption learning." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 366, + 482, + 461 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 366, + 482, + 461 + ], + "spans": [ + { + "bbox": [ + 130, + 366, + 482, + 461 + ], + "type": "text", + "content": "By forwarding the original training samples and learnable prompts from base classes, we can then build two variational adapters. Inspired by the excellent representations of Spherical Variational Autoencoder (SVAE) [10,32] on low dimensional data, we employ two SVAE as the adapters to align different modalities, while preserving the transferability of classes knowledge. To achieve this goal, we model visual and semantic distributions by vMF and treat each distribution obtained from the visual and semantic branch as prior knowledge for another to align these modalities in spherical space." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 461, + 482, + 498 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 461, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 461, + 482, + 498 + ], + "type": "text", + "content": "Specifically, as shown in the left side of Fig 2, each adapter (e.g., SVAE) consists of an encoder and a decoder with inherent and cross-modal constraints. For the visual branch, we can formulate the variational optimization by:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 171, + 510, + 480, + 523 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 171, + 510, + 480, + 523 + ], + "spans": [ + { + "bbox": [ + 171, + 510, + 480, + 523 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {v i s u a l}} ^ {s v a e} = \\mathbb {E} _ {q _ {\\delta_ {1}} (z _ {i} | x)} [ \\log p _ {\\omega_ {1}} (x \\mid z _ {i}) ] - \\mathrm {K L} \\left(q _ {\\delta_ {1}} (z _ {i} \\mid x) \\| p _ {\\omega_ {1}} (z _ {i})\\right), \\tag {3}", + "image_path": "6a6808c71b3bf8b1b7e8624697542c3b8c96749da6f77dd88306c532d3da1a66.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "spans": [ + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "content": "where the first term refers to the reconstruction loss for visual features " + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "content": " over latent features " + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "inline_equation", + "content": "z_{i}" + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "content": ", and the second part denotes the distance metric between different distributions. Here " + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "inline_equation", + "content": "q_{\\delta_1}(z_i|x)" + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "content": " represents the features encoded by the visual encoder " + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "inline_equation", + "content": "E_{i}" + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "content": ", while " + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "inline_equation", + "content": "p_{\\omega_1}(x|z_i)" + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "content": " comes from " + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "inline_equation", + "content": "D_{i}" + }, + { + "bbox": [ + 130, + 528, + 482, + 575 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 146, + 575, + 444, + 587 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 575, + 444, + 587 + ], + "spans": [ + { + "bbox": [ + 146, + 575, + 444, + 587 + ], + "type": "text", + "content": "Similarly, the text adapter can be optimized by another SVAE loss:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 177, + 600, + 480, + 613 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 177, + 600, + 480, + 613 + ], + "spans": [ + { + "bbox": [ + 177, + 600, + 480, + 613 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {\\text {t e x t}} ^ {s v a e} = \\mathbb {E} _ {q _ {\\delta_ {2}} (z _ {t} | t)} \\left[ \\log p _ {\\omega_ {2}} (t \\mid z _ {t}) \\right] - \\mathrm {K L} \\left(q _ {\\delta_ {2}} (z _ {t} \\mid t) \\| p _ {\\omega_ {2}} (z _ {t})\\right), \\tag {4}", + "image_path": "ade8bf27c574b9fbed91cb3c1955ea08f4e30e2f5fe2d212cb5700ee6e8a1dc4.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "q_{\\delta_2}(z_t|t)" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_{\\omega_2}(t \\mid z_t)" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " denote the distribution represented by text encoder and decoder, respectively. By formulating the adapter into an SVAE style, the latent features can only depict each distribution independently. Therefore, to align the latent features of different modalities, we propose to minimize the" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 131, + 116, + 479, + 140 + ], + "type": "text", + "content": "distance between them. Formally, we adopt optimal transport (Earth Mover's Distance) [35] to match visual latent distribution to text distribution by:" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 222, + 152, + 480, + 174 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 222, + 152, + 480, + 174 + ], + "spans": [ + { + "bbox": [ + 222, + 152, + 480, + 174 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {d i s} = \\inf _ {\\theta \\in \\Pi \\left(P _ {z _ {i}}, P _ {z _ {t}}\\right)} \\mathbb {E} _ {(z _ {i}, z _ {t}) \\sim \\theta} [ \\| z _ {i} - z _ {t} \\| ], \\tag {5}", + "image_path": "310e827cf3db014f0e424ac4528654e34d9c0d864f1dcf9ff1bd25add74cfeab.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "spans": [ + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "inline_equation", + "content": "\\Pi(P_{z_i}, P_{z_t})" + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "text", + "content": " denotes the joint distribution of two latent features " + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "inline_equation", + "content": "z_i" + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "inline_equation", + "content": "z_t" + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "text", + "content": ". With the help of " + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dis}" + }, + { + "bbox": [ + 131, + 177, + 479, + 213 + ], + "type": "text", + "content": ", the corresponding categories of visual and semantic features will be aligned in the latent space." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 214, + 479, + 250 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 214, + 479, + 250 + ], + "spans": [ + { + "bbox": [ + 131, + 214, + 479, + 250 + ], + "type": "text", + "content": "To further ensure visual-semantic alignment, we introduce cross-domain constraints for both visual and semantic adapters. Specifically, given the latent representation " + }, + { + "bbox": [ + 131, + 214, + 479, + 250 + ], + "type": "inline_equation", + "content": "z_{i}" + }, + { + "bbox": [ + 131, + 214, + 479, + 250 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 214, + 479, + 250 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 131, + 214, + 479, + 250 + ], + "type": "text", + "content": ", we reconstruct the representation by another decoders:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 211, + 262, + 480, + 275 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 211, + 262, + 480, + 275 + ], + "spans": [ + { + "bbox": [ + 211, + 262, + 480, + 275 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {c r} = \\mathbb {E} \\left[ | | t - D _ {t} \\left(z _ {i}\\right) | | _ {2} \\right] + \\mathbb {E} \\left[ | | x - D _ {i} \\left(z _ {t}\\right) | | _ {2} \\right], \\tag {6}", + "image_path": "ecf578fdbc88ecd6283e974c33799d7dd7a256f86c83e161dee24d1a298582ac.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 277, + 441, + 289 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 277, + 441, + 289 + ], + "spans": [ + { + "bbox": [ + 131, + 277, + 441, + 289 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 277, + 441, + 289 + ], + "type": "inline_equation", + "content": "D_{t}(z_{i})" + }, + { + "bbox": [ + 131, + 277, + 441, + 289 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 277, + 441, + 289 + ], + "type": "inline_equation", + "content": "D_{i}(z_{t})" + }, + { + "bbox": [ + 131, + 277, + 441, + 289 + ], + "type": "text", + "content": " are regarded as cross-domain representations." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 290, + 479, + 338 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 290, + 479, + 338 + ], + "spans": [ + { + "bbox": [ + 131, + 290, + 479, + 338 + ], + "type": "text", + "content": "Although Eqs. (3) (4) (5) (6) align latent representations in a shared space by SVAE and cross-domain constraints, they still suffer from the lack of any class-wise knowledge, which could lead to feature confusion. To reduce the feature confusion, we propose to adopt dual classification loss (DCL):" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 173, + 350, + 480, + 384 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 173, + 350, + 480, + 384 + ], + "spans": [ + { + "bbox": [ + 173, + 350, + 480, + 384 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {c l s} = \\underbrace {\\mathbb {E} _ {t} \\left[ \\log p _ {\\phi_ {c l s} ^ {p l}} (y | x) \\right]} _ {\\mathcal {L} _ {c l s} ^ {p l}} + \\underbrace {\\mathbb {E} \\left[ \\log p _ {\\phi_ {c l s} ^ {l a}} (y | z _ {t}) \\right] + \\mathbb {E} \\left[ \\log p _ {\\phi_ {c l s} ^ {l a}} (y | z _ {i}) \\right]} _ {\\mathcal {L} _ {c l s} ^ {l a}}, \\tag {7}", + "image_path": "433473cb88abd78e45baed6342af0fbd23690365ed15afbbad26240900d8262c.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "spans": [ + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}^{pl}" + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}^{la}" + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "content": " tend to perform classification constraints in instance-level and latent-level, respectively. For the instance-level, the proposed PVA learns task-specific knowledge with training samples " + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "inline_equation", + "content": "p_{\\phi_{cls}^{pl}}(y|\\boldsymbol{x}) = \\frac{\\exp(\\cos(\\mathcal{I}(\\boldsymbol{x}),\\mathcal{T}(t_y)) / \\sigma)}{\\sum\\exp(\\cos(\\mathcal{I}(\\boldsymbol{x}),\\mathcal{T}(t_n)) / \\sigma)}" + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "content": " where " + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "inline_equation", + "content": "\\mathcal{T}(t_y)" + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "content": " represent the class labels and semantic features mentioned in Eq. (2). Based on the end-to-end training paradigm, the discrimination of text features can be preserved. For the latent level, the softmax classifier " + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "inline_equation", + "content": "\\phi_{cls}^{la}" + }, + { + "bbox": [ + 131, + 389, + 482, + 488 + ], + "type": "text", + "content": " is trained using latent features and corresponding labels to ensure the decision boundary is clear enough for the final classification task." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 489, + 479, + 512 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 489, + 479, + 512 + ], + "spans": [ + { + "bbox": [ + 131, + 489, + 479, + 512 + ], + "type": "text", + "content": "As previously illustrated, we develop the overall training process with SVAE, cross-domain, and DCL classification loss:" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 228, + 526, + 480, + 537 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 526, + 480, + 537 + ], + "spans": [ + { + "bbox": [ + 228, + 526, + 480, + 537 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {L} _ {S V A E} + \\alpha \\mathcal {L} _ {d i s} + \\beta \\mathcal {L} _ {c r} + \\gamma \\mathcal {L} _ {c l s}, \\tag {8}", + "image_path": "10e2bbe79159cda7955b2e891b648753ddd648d513ad612baba83b4e92723743.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 541, + 424, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 541, + 424, + 554 + ], + "spans": [ + { + "bbox": [ + 131, + 541, + 424, + 554 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 541, + 424, + 554 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{SVAE} = \\mathcal{L}_{visual}^{svae} + \\mathcal{L}_{text}^{svae}" + }, + { + "bbox": [ + 131, + 541, + 424, + 554 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 541, + 424, + 554 + ], + "type": "inline_equation", + "content": "\\alpha, \\beta, \\gamma" + }, + { + "bbox": [ + 131, + 541, + 424, + 554 + ], + "type": "text", + "content": " are hyper parameters." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 570, + 479, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 570, + 479, + 641 + ], + "spans": [ + { + "bbox": [ + 131, + 570, + 479, + 641 + ], + "type": "text", + "content": "Separate Novel Classes from Base Classes. Following the training stage, both the visual and semantic latent features are well represented. Thus, novel samples entangled with base samples can be easily separated from the test space using distance comparisons. Specifically, as shown on the right side of Fig. 2, we measure the distance between test samples and learned prompts equipped with the [CLASS] token by:" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 257, + 654, + 479, + 666 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 654, + 479, + 666 + ], + "spans": [ + { + "bbox": [ + 257, + 654, + 479, + 666 + ], + "type": "interline_equation", + "content": "d i s t a n c e = \\cos \\left(z _ {i} ^ {t e}, z _ {t}\\right), \\tag {9}", + "image_path": "55af69b68ff636860b2ef3b0a092387429fbdeabbe767bad7482a07c79821954.jpg" + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 256, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 256, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 256, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "\\cos(,)" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": " denotes the cosine similarity. " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "z_i^{te} = E_i(x^{te})" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": " denotes the latent features encoded from test visual features, which may come from base or novel domains. " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "z_t = [z_t^b, z_t^n]" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": " contain the latent text features of all the classes (i.e., base and novel), where [,] denotes concatenate operation for the latent prompts of base and novel domains. Intuitively, if the test sample belongs to a novel domain, the distance " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "\\cos(z_i^{te}, z_t^n)" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": " would be closer than " + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "inline_equation", + "content": "\\cos(z_i^{te}, z_t^b)" + }, + { + "bbox": [ + 130, + 116, + 482, + 188 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 189, + 441, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 189, + 441, + 200 + ], + "spans": [ + { + "bbox": [ + 146, + 189, + 441, + 200 + ], + "type": "text", + "content": "By leveraging the distance metric, we can assign domain labels by:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 177, + 211, + 481, + 239 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 177, + 211, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 177, + 211, + 481, + 239 + ], + "type": "interline_equation", + "content": "L = \\left\\{ \\begin{array}{l} B a s e, \\max \\left\\{c o s \\left(z _ {i} ^ {t e}, z _ {t} ^ {b}\\right) \\mid \\forall t \\in \\mathcal {A} _ {s} \\right\\} \\geq t h r e s h o l d \\\\ N o v e l, \\max \\left\\{c o s \\left(z _ {i} ^ {t e}, z _ {t} ^ {b}\\right) \\mid \\forall t \\in \\mathcal {A} _ {s} \\right\\} < t h r e s h o l d \\end{array} \\right\\}. \\tag {10}", + "image_path": "cbacc577e2d7b35bf686e021acde52a4b259bc831f262e9c605ffbff6199b292.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "spans": [ + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": "Here, we alternate the hand-crafted threshold with the base knowledge to fit different datasets and reduce complexity. In practice, we propose to automatically calculate the threshold by " + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "inline_equation", + "content": "\\tau = \\frac{\\text{count}(d^j > \\text{threshold})}{N}" + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": ". " + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "inline_equation", + "content": "d^j" + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": " is the maximum distance between " + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": "-th training samples and learned prompts, and " + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": " is the number of all training samples. The larger the value " + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": " is, the smaller the threshold becomes, meaning that more samples are divided into base classes. Then we only need to choose a suitable " + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "inline_equation", + "content": "\\tau \\in [0,1]" + }, + { + "bbox": [ + 130, + 243, + 482, + 331 + ], + "type": "text", + "content": " to balance the data separation." + } + ] + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 246, + 353, + 369, + 480 + ], + "blocks": [ + { + "bbox": [ + 246, + 353, + 369, + 480 + ], + "lines": [ + { + "bbox": [ + 246, + 353, + 369, + 480 + ], + "spans": [ + { + "bbox": [ + 246, + 353, + 369, + 480 + ], + "type": "image", + "image_path": "e09fff83c686f97bbaf92d0f4dc14968e7854c02694848f50e08403c391d2e4b.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 155, + 490, + 457, + 502 + ], + "lines": [ + { + "bbox": [ + 155, + 490, + 457, + 502 + ], + "spans": [ + { + "bbox": [ + 155, + 490, + 457, + 502 + ], + "type": "text", + "content": "Fig. 3: The architecture of the Visual and Semantic Refinement modules." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Fine-tuning for GZSL Classification. When detecting based on the proposed distance, the domain for these test samples is accurately assigned. Although the challenging GZSL task can be converted into a traditional ZSL and a supervised task, how to recognize novel classes is also a tricky problem. To improve the transfer of general knowledge for novel classes, we further refine the output feature of the learned adapters with the original zero-shot features via a residual connection. As shown in the Fig. 2 and Fig. 3, we refine the final output of adapters by " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "t^{*} = \\epsilon \\cdot \\tilde{t} + (1 - \\epsilon) \\cdot t" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "x^{*} = \\epsilon \\cdot \\tilde{x} + (1 - \\epsilon) \\cdot x" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": ". Since CLIP is obtained by massive image-text pairs that are not limited to the current samples, the features of the original encoder are easier to transfer. Based on the" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 140 + ], + "type": "text", + "content": "complement of stored knowledge from CLIP and task-specific knowledge from adapters, we can thus improve the transferability of the PVA." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 160, + 229, + 174 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 160, + 229, + 174 + ], + "spans": [ + { + "bbox": [ + 132, + 160, + 229, + 174 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 187, + 190, + 200 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 187, + 190, + 200 + ], + "spans": [ + { + "bbox": [ + 132, + 187, + 190, + 200 + ], + "type": "text", + "content": "4.1 Setup" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "spans": [ + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "text", + "content": "Datasets and Setting. For the GZSC and CDT tasks, the datasets include two coarse-grained datasets, i.e., AwA2 [12] and SUN [30], and two fine-grained datasets i.e., CUB [36] and FLO [29], containing 50, 717, 200, and 102 categories, respectively. It is worth noting that due to space limitations, we only report the results for popular AwA2, CUB, and SUN in Table 1. The performance is evaluated by the harmonic mean of the average per class Top-1 accuracy: " + }, + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "inline_equation", + "content": "\\mathbf{H} = 2*\\mathbf{B}*\\mathbf{N} / (\\mathbf{B} + \\mathbf{N})" + }, + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "inline_equation", + "content": "\\mathbf{B}" + }, + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "inline_equation", + "content": "\\mathbf{N}" + }, + { + "bbox": [ + 132, + 209, + 481, + 353 + ], + "type": "text", + "content": " represent the performance of base and novel classes, respectively. To further explore the knowledge transferability of the proposed method, we follow CoCoOP [44] to test the generalization performance of the trained model for other datasets. Specifically, we first train the PVA on AwA2, which is regarded as a source dataset. Then we compare the performance which is tested on the remaining three datasets without fine-tuning." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "spans": [ + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "content": "Implementation details. The proposed PVA is comprised of two sub-models: a visual adapter and a text adapter. Each adapter consists of an encoder and a decoder implemented by two-layer FC networks with 256 hidden units and ReLU. The input of the adapters comes from the frozen CLIP (ViT-B/16 [11,23]) encoder with 512 dimensions. The latent feature dimension is set to 16 for all these datasets. For the prompts, the learnable parameters length " + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "inline_equation", + "content": "M = 4" + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "content": ". We train our proposed PVA by Adam optimizer with a 1e-4 learning rate. We select " + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "inline_equation", + "content": "\\alpha = 0.1" + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "inline_equation", + "content": "\\beta = 1" + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "inline_equation", + "content": "\\gamma = 1" + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "content": " as hyperparameters, while " + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 132, + 373, + 481, + 480 + ], + "type": "text", + "content": " are discussed in the following section." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 500, + 285, + 511 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 500, + 285, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 500, + 285, + 511 + ], + "type": "text", + "content": "4.2 Comparisons with SOTA" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "text", + "content": "Generalized Zero-Shot Classification. We partition existing methods into three paradigms to compare the GZSL performance in Table. 1. Specifically, our method achieves the best harmonic mean of " + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "inline_equation", + "content": "90.7\\%" + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "inline_equation", + "content": "65.8\\%" + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "text", + "content": " on AwA2 and SUN, respectively. Although we observe a slightly lower result on CUB than PSVMA [23], our method still achieves competitive results without requiring manually designed attributes. Compared to the popular VLMs-based method CoOP [45], our method achieves a " + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "inline_equation", + "content": "15.3\\%" + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "text", + "content": " improvement on the " + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{N}" + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "text", + "content": " metric of AwA2, indicating the effectiveness of the proposed PVA for reducing prediction bias. CoOP achieves worse " + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\mathbf{N}" + }, + { + "bbox": [ + 132, + 521, + 481, + 665 + ], + "type": "text", + "content": " than the original CLIP, which indicates that existing fine-tuned methods indeed suffer from feature confusion of novel classes, resulting in worse transferability. Notably, the proposed PVA not only improves the performance of novel classes but also ensures the discriminative property of base classes by" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 138, + 179, + 481, + 418 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: GZSC performance (\\%) comparisons on three popular benchmarks. E, G and C represent Embedding, Generative, and Calibration methods, respectively. The best results and second best results are marked by bold and underline. PVA+R denotes the proposed method equipped with refinement modules. “†” denotes that the methods are implemented by ViT [11] networks." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 138, + 179, + 481, + 418 + ], + "lines": [ + { + "bbox": [ + 138, + 179, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 179, + 481, + 418 + ], + "type": "table", + "html": "
MethodsParadigmAwA2CUBSUN
BNHBNHBNH
DVBE [26]70.863.667.060.253.256.537.245.040.7
GEM [24]77.564.870.677.164.870.435.738.136.9
TransZero [4]82.361.370.268.369.368.833.452.640.8
MSDN [5]74.562.067.767.568.768.134.252.241.3
I2MVFomer [27]79.675.777.659.942.549.7---
DUET [9]†E84.763.772.772.862.967.545.845.745.8
PSVMA [23]†77.373.675.477.870.173.845.361.752.3
CLIP [31]†92.986.689.655.154.955.040.249.444.3
CoOP [45]†95.372.782.563.849.255.649.353.551.3
SHIP [37]†94.484.189.058.955.357.1---
f-VAEGAN [40]70.657.663.560.148.453.638.045.141.3
TF-VAEGAN [28]75.159.866.664.752.858.140.745.643.0
CEZSL [15]78.663.170.066.863.965.338.648.843.1
FREE [6]G75.460.467.159.955.757.737.247.441.7
HSVA [7]76.659.366.858.352.755.339.048.643.3
ICCE [20]82.365.372.865.567.366.4---
CS [3]77.85.911.063.812.621.0---
COSMO [2]---60.541.048.940.235.337.6
OOD [8]75.955.664.250.249.549.833.941.737.0
GatingAE [21]C81.360.369.358.155.456.738.145.341.4
PVA (Ours)92.788.090.378.562.569.663.466.364.8
PVA+R (Ours)93.688.090.779.665.772.062.569.565.8
", + "image_path": "d657533c75a1ae44d788d2d2ee7afc063a8bdd90ec858a0b92771ddaade371eb.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 442, + 480, + 466 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 442, + 480, + 466 + ], + "spans": [ + { + "bbox": [ + 132, + 442, + 480, + 466 + ], + "type": "text", + "content": "separating novel and base domains. For instance, our method achieves the best B of " + }, + { + "bbox": [ + 132, + 442, + 480, + 466 + ], + "type": "inline_equation", + "content": "79.6\\%" + }, + { + "bbox": [ + 132, + 442, + 480, + 466 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 442, + 480, + 466 + ], + "type": "inline_equation", + "content": "63.4\\%" + }, + { + "bbox": [ + 132, + 442, + 480, + 466 + ], + "type": "text", + "content": " on the CUB and SUN datasets, respectively." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 467, + 481, + 549 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 467, + 481, + 549 + ], + "spans": [ + { + "bbox": [ + 132, + 467, + 481, + 549 + ], + "type": "text", + "content": "In addition, the calibration-based method, i.e., GatingAE [21] focuses on data separation while ignoring the model's transferability. In contrast, we model the entire process in an adapter-style tuning fashion to consider knowledge transfer. Intuitively, it can be seen from the last two rows that the proposed refinement networks further improve the " + }, + { + "bbox": [ + 132, + 467, + 481, + 549 + ], + "type": "inline_equation", + "content": "\\mathbf{N}" + }, + { + "bbox": [ + 132, + 467, + 481, + 549 + ], + "type": "text", + "content": " results of " + }, + { + "bbox": [ + 132, + 467, + 481, + 549 + ], + "type": "inline_equation", + "content": "3.2\\%" + }, + { + "bbox": [ + 132, + 467, + 481, + 549 + ], + "type": "text", + "content": " on both CUB and SUN. This indicates that general knowledge should indeed be introduced by refinement networks to enhance the transferability of the model." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 569, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 569, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 569, + 481, + 665 + ], + "type": "text", + "content": "Cross-dataset Transfer Learning. To further evaluate the generalization ability of the model in an open-world setting, we report cross-dataset transfer learning performance in Table 2. Specifically, we train the model on AwA2 base classes and then test the performance on three target datasets. Since all target samples are test-only, we rename the original splits for base and novel classes to Subset1 (Sub1) and Subset2 (Sub2), respectively. As shown in the table, CoOP [45] is even worse than CLIP as it suffers from an overfitting problem for base classes. In contrast, by combining the prompt learning and adapter" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 137, + 157, + 481, + 226 + ], + "blocks": [ + { + "bbox": [ + 130, + 114, + 482, + 149 + ], + "lines": [ + { + "bbox": [ + 130, + 114, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 114, + 482, + 149 + ], + "type": "text", + "content": "Table 2: Cross-dataset transfer performance (%) comparisons on three popular benchmarks. The model is trained on AwA2 and then applied to target datasets. Sub1 and Sub2 represent data splits with different classes. " + }, + { + "bbox": [ + 130, + 114, + 482, + 149 + ], + "type": "inline_equation", + "content": "\\triangle" + }, + { + "bbox": [ + 130, + 114, + 482, + 149 + ], + "type": "text", + "content": " denotes PVA's gain over CoOP." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 137, + 157, + 481, + 226 + ], + "lines": [ + { + "bbox": [ + 137, + 157, + 481, + 226 + ], + "spans": [ + { + "bbox": [ + 137, + 157, + 481, + 226 + ], + "type": "table", + "html": "
MethodsAwA2 → CUBAwA2 → SUNAwA2 → FLO
Sub1Sub2HSub1Sub2HSub1Sub2H
CLIP [31]54.855.255.040.241.440.867.965.666.7
CoOP [45]50.853.552.144.637.540.768.166.367.2
PVA+R (Ours)56.855.556.144.938.041.171.268.669.8
△+6.0+2.0+4.0+0.3+0.5+0.4+3.1+2.3+2.6
", + "image_path": "08d4ee9f470f1335617365eff3800a4abb8fb1ded99fa6b39a18e7655e1f689c.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 138, + 291, + 309, + 360 + ], + "blocks": [ + { + "bbox": [ + 131, + 236, + 309, + 270 + ], + "lines": [ + { + "bbox": [ + 131, + 236, + 309, + 270 + ], + "spans": [ + { + "bbox": [ + 131, + 236, + 309, + 270 + ], + "type": "text", + "content": "Table 3: Ablation study of the proposed PVA. We highlight the " + }, + { + "bbox": [ + 131, + 236, + 309, + 270 + ], + "type": "inline_equation", + "content": "\\mathrm{PVA + R}" + }, + { + "bbox": [ + 131, + 236, + 309, + 270 + ], + "type": "text", + "content": " variants of our methods with a light blue background." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 138, + 291, + 309, + 360 + ], + "lines": [ + { + "bbox": [ + 138, + 291, + 309, + 360 + ], + "spans": [ + { + "bbox": [ + 138, + 291, + 309, + 360 + ], + "type": "table", + "html": "
LdisLclsLcrεAwA2CUB
BNHBNH
✓89.252.966.467.713.522.5
✓✓90.183.486.672.161.066.1
✓✓✓92.788.090.378.562.569.6
✓✓✓0.191.788.990.373.765.069.0
✓✓✓0.592.488.990.672.265.968.9
✓✓✓0.993.688.090.779.664.771.4
", + "image_path": "5730b980e35fcab4e1764306ed7524d4c4ea7ef5842327927b3e0ad80bba324c.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "type": "table", + "bbox": [ + 323, + 290, + 477, + 360 + ], + "blocks": [ + { + "bbox": [ + 317, + 236, + 477, + 280 + ], + "lines": [ + { + "bbox": [ + 317, + 236, + 477, + 280 + ], + "spans": [ + { + "bbox": [ + 317, + 236, + 477, + 280 + ], + "type": "text", + "content": "Table 4: Ablation study of the domain detection. FPR denotes the False Positive Rate (in %) on the threshold that yields " + }, + { + "bbox": [ + 317, + 236, + 477, + 280 + ], + "type": "inline_equation", + "content": "95\\%" + }, + { + "bbox": [ + 317, + 236, + 477, + 280 + ], + "type": "text", + "content": " TPR." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 323, + 290, + 477, + 360 + ], + "lines": [ + { + "bbox": [ + 323, + 290, + 477, + 360 + ], + "spans": [ + { + "bbox": [ + 323, + 290, + 477, + 360 + ], + "type": "table", + "html": "
LdisLclsLcrCUBSUN
FPR ↓AUC ↑FPR ↓AUC ↑
✓77.176.289.062.6
✓✓10.598.066.387.2
✓✓✓2.699.211.397.8
MAX-3 [17]79.673.492.361.0
OOD [8]85.071.288.863.1
COSMO [2]72.082.077.577.7
", + "image_path": "cd805d02e30f71291c85f389bb1084aebda46ec01a3bed937581093e7acc967c.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "text", + "content": "tuning, PVA+R outperforms CoOP by " + }, + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "inline_equation", + "content": "4.0\\%" + }, + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "inline_equation", + "content": "0.4\\%" + }, + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "inline_equation", + "content": "2.6\\%" + }, + { + "bbox": [ + 130, + 382, + 482, + 456 + ], + "type": "text", + "content": " on CUB, SUN, and FLO, respectively. Additionally, it is more interesting to look backward to Table. 1, the performance on CUB observed by traditional generative methods, such as F-VAEGAN [40] and HSVA [7] is even inferior to PVA+R transferred from AwA2. This also demonstrates that our prompt-adapter hybrid framework can be extended to a variety of downstream tasks." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 472, + 238, + 484 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 472, + 238, + 484 + ], + "spans": [ + { + "bbox": [ + 131, + 472, + 238, + 484 + ], + "type": "text", + "content": "4.3 Ablation Study" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "text", + "content": "Different Constraints. To give a clear insight into each constraint, we conduct a series of ablation experiments. As shown in Table. 3, the performance gradually improves as we incorporate " + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{dis}" + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}" + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cr}" + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "text", + "content": " into the original baseline. It is worth noting that we observe significant improvements when " + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}" + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "text", + "content": " is added. This is because classification constraints can help models learn discriminative and reasonable prompts while ensuring class-wise alignments for visual and semantic branches. Unlike the changing trend of the above constraints, PVA+R achieves more stable yet high results across various " + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\epsilon" + }, + { + "bbox": [ + 130, + 491, + 482, + 601 + ], + "type": "text", + "content": ", indicating that refinement processes balance general and task-specific knowledge to improve overall performance." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "Data Separation. To further explore the results of feature separation, we report the binary classification results. As shown in Table. 4, we observe that the AUC raises with the help of " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cls}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathcal{L}_{cr}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": ", maintaining the same trend as " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{H}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " shown in Table. 3. In addition, PVA exhibits much stronger domain detection" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 141, + 114, + 248, + 228 + ], + "blocks": [ + { + "bbox": [ + 141, + 114, + 248, + 228 + ], + "lines": [ + { + "bbox": [ + 141, + 114, + 248, + 228 + ], + "spans": [ + { + "bbox": [ + 141, + 114, + 248, + 228 + ], + "type": "image", + "image_path": "f8074b305c8e71acb0c5ac0bfd6e622246f38f872aca8a5c1684fb429ca63cb3.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 237, + 482, + 281 + ], + "lines": [ + { + "bbox": [ + 130, + 237, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 482, + 281 + ], + "type": "text", + "content": "Fig. 4: (a) ROC curves on four benchmarks. (b) GZSL performance (N and H) on AwA2 with different " + }, + { + "bbox": [ + 130, + 237, + 482, + 281 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 237, + 482, + 281 + ], + "type": "text", + "content": ". (c) Comparisons between different feature extractors on AwA2. We replace original Res101 [16] based TF-VAE [28] with CLIP features, termed TF-VAE+CLIP." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 252, + 114, + 359, + 228 + ], + "blocks": [ + { + "bbox": [ + 252, + 114, + 359, + 228 + ], + "lines": [ + { + "bbox": [ + 252, + 114, + 359, + 228 + ], + "spans": [ + { + "bbox": [ + 252, + 114, + 359, + 228 + ], + "type": "image", + "image_path": "c6f53fa1798d8b46927d60dac426bf81cc6e9449ac4f53ec481453078547b067.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 364, + 114, + 472, + 221 + ], + "blocks": [ + { + "bbox": [ + 364, + 114, + 472, + 221 + ], + "lines": [ + { + "bbox": [ + 364, + 114, + 472, + 221 + ], + "spans": [ + { + "bbox": [ + 364, + 114, + 472, + 221 + ], + "type": "image", + "image_path": "a2986ccec49925b9e9db6545ff447725be47f30254a6a1c83f488183fb1b6755.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 136, + 337, + 482, + 394 + ], + "blocks": [ + { + "bbox": [ + 130, + 294, + 483, + 327 + ], + "lines": [ + { + "bbox": [ + 130, + 294, + 483, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 294, + 483, + 327 + ], + "type": "text", + "content": "Table 5: Effectiveness analysis of variational adapter and alternatives. w/ and w/o represent with and without respectively. DS is the abbreviation of Data Separation. " + }, + { + "bbox": [ + 130, + 294, + 483, + 327 + ], + "type": "inline_equation", + "content": "\\triangle" + }, + { + "bbox": [ + 130, + 294, + 483, + 327 + ], + "type": "text", + "content": " represents the gain over the second-best results." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 337, + 482, + 394 + ], + "lines": [ + { + "bbox": [ + 136, + 337, + 482, + 394 + ], + "spans": [ + { + "bbox": [ + 136, + 337, + 482, + 394 + ], + "type": "table", + "html": "
MethodsAwA2CUBSUNFLO
BNHBNHBNHBNH
MLP w/o DS95.376.885.060.354.157.051.252.751.971.868.970.3
MLP w/ DS92.869.079.170.362.166.653.166.859.188.272.879.8
VAE w/ DS93.688.090.779.665.772.062.569.565.892.172.180.9
△-1.7+11.2+5.7+9.3+3.6+5.4+9.4+2.7+6.7+3.9-0.7+1.1
", + "image_path": "0ccd847c6b658f6146b493818bd85b07f8b263f9b962deac88617857b48e55e1.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_body" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 417, + 482, + 501 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 417, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 417, + 482, + 501 + ], + "type": "text", + "content": "ability than other related methods, leading to pleasing performance. We draw the ROC curves in Fig. 4(a) to report detection results for these datasets, where all AUCs are greater than " + }, + { + "bbox": [ + 130, + 417, + 482, + 501 + ], + "type": "inline_equation", + "content": "96\\%" + }, + { + "bbox": [ + 130, + 417, + 482, + 501 + ], + "type": "text", + "content": ". This also indicates that novel samples can be effectively separated from entangled base samples by well-trained latent features of adapters. In addition, we believe that the performance of data separation is important because if the domain cannot be accurately distinguished, it will directly affect the classification results and even have negative effects." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 501, + 482, + 549 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 549 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 549 + ], + "type": "text", + "content": "Furthermore, we report quantitative analysis between other related methods and the proposed PVA in the lower half of Table. 4. It can be seen that these methods fail to accurately classify entangled features at the domain level, which is consistent with the results in Table. 1." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 569, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 665 + ], + "type": "text", + "content": "Analysis of Variational Adapter. We evaluate the effects of different adapter structures. As shown in Table. 5, we first adopt MLPs as the adapter to fine-tune on four datasets. It can be seen that the performance of the novel class decreases significantly in MLPs w/o DS. This is because MLPs fail to learn transferable knowledge due to the simple structures. Although MLP w/ DS shows considerable improvements of H on CUB(9.6%), SUN(7.2%), and FLO (9.5%) with domain detection, it still suffers from unstable performance. For example, the harmonic mean drops from 85.0% to 79.1% on AwA2 after domain detection." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 100 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 137, + 114, + 220, + 214 + ], + "blocks": [ + { + "bbox": [ + 137, + 114, + 220, + 214 + ], + "lines": [ + { + "bbox": [ + 137, + 114, + 220, + 214 + ], + "spans": [ + { + "bbox": [ + 137, + 114, + 220, + 214 + ], + "type": "image", + "image_path": "2dd4024e09bb6639c29d8f4833796477d7a48f9ca5f5b30a98bd26f6ddd3f44a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 224, + 480, + 258 + ], + "lines": [ + { + "bbox": [ + 131, + 224, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 131, + 224, + 480, + 258 + ], + "type": "text", + "content": "Fig. 5: t-SNE visualizations [25] of learnable prompts and visual features with (w/) Visual and Semantic adapters. Grey and black triangles denote the base and novel prototype, respectively. Color stars denote novel visual features. (Best viewed in color)" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 222, + 115, + 306, + 214 + ], + "blocks": [ + { + "bbox": [ + 222, + 115, + 306, + 214 + ], + "lines": [ + { + "bbox": [ + 222, + 115, + 306, + 214 + ], + "spans": [ + { + "bbox": [ + 222, + 115, + 306, + 214 + ], + "type": "image", + "image_path": "27bdfd60be8ed1e72a2424aba310226974f48b0c79bf800a75c0c2c7ac145941.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 307, + 115, + 390, + 214 + ], + "blocks": [ + { + "bbox": [ + 307, + 115, + 390, + 214 + ], + "lines": [ + { + "bbox": [ + 307, + 115, + 390, + 214 + ], + "spans": [ + { + "bbox": [ + 307, + 115, + 390, + 214 + ], + "type": "image", + "image_path": "ee7405e2b9fd123408a0562fc85b4e91063053f10e53e58e742e54e1b1b0e3f1.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 392, + 115, + 475, + 214 + ], + "blocks": [ + { + "bbox": [ + 392, + 115, + 475, + 214 + ], + "lines": [ + { + "bbox": [ + 392, + 115, + 475, + 214 + ], + "spans": [ + { + "bbox": [ + 392, + 115, + 475, + 214 + ], + "type": "image", + "image_path": "405bcbc115dbc6788259d3c5885e3c6ee6965cc72272b937d5c463d2a72d6602.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 173, + 268, + 249, + 359 + ], + "blocks": [ + { + "bbox": [ + 173, + 268, + 249, + 359 + ], + "lines": [ + { + "bbox": [ + 173, + 268, + 249, + 359 + ], + "spans": [ + { + "bbox": [ + 173, + 268, + 249, + 359 + ], + "type": "image", + "image_path": "8c0edaaad42356e5875d3461e7858ec10d03b67e9a341b92cd37fe28453a13f2.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 386, + 480, + 408 + ], + "lines": [ + { + "bbox": [ + 131, + 386, + 480, + 408 + ], + "spans": [ + { + "bbox": [ + 131, + 386, + 480, + 408 + ], + "type": "text", + "content": "Fig. 6: t-SNE visualizations of latent features for AwA2, CUB and FLO. Grey dots represent base features and blue dots represent novel ones." + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 267, + 268, + 350, + 359 + ], + "blocks": [ + { + "bbox": [ + 267, + 268, + 350, + 359 + ], + "lines": [ + { + "bbox": [ + 267, + 268, + 350, + 359 + ], + "spans": [ + { + "bbox": [ + 267, + 268, + 350, + 359 + ], + "type": "image", + "image_path": "a2d633cdda08f2fdd33b78c69344479f6afd66d4e4ce96d81698f14cb4ba0d10.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 363, + 268, + 441, + 359 + ], + "blocks": [ + { + "bbox": [ + 363, + 268, + 441, + 359 + ], + "lines": [ + { + "bbox": [ + 363, + 268, + 441, + 359 + ], + "spans": [ + { + "bbox": [ + 363, + 268, + 441, + 359 + ], + "type": "image", + "image_path": "8e8a8a21b1241ed9d1dc55f91fe134575761950df08e9db59f8120da61073308.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 264, + 366, + 350, + 376 + ], + "blocks": [ + { + "bbox": [ + 264, + 366, + 350, + 376 + ], + "lines": [ + { + "bbox": [ + 264, + 366, + 350, + 376 + ], + "spans": [ + { + "bbox": [ + 264, + 366, + 350, + 376 + ], + "type": "image", + "image_path": "a208282314239fe127dba415060a86eda02fbee46a1d52bedaadd27a95fc243c.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 432, + 480, + 491 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 432, + 480, + 491 + ], + "spans": [ + { + "bbox": [ + 130, + 432, + 480, + 491 + ], + "type": "text", + "content": "We speculate that plain MLPs can not sufficiently align vision-language modality in latent space, resulting in poor domain classification. However, the proposed variational adapters capture discriminative yet transferable information for both latent and output features to ensure the performance of domain detection and classification." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": "Sensitivity and Backbones. Fig. 4(b) shows the sensitivity of " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": ". The performance of " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\mathbf{N}" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": " maintains stable at first and then decreases sharply when " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\tau \\geq 0.99" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": ". The reason for this observation is that the larger " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": " tends to classify more samples into base classes, resulting in lower " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\mathbf{N}" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": ". The descent speed of " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\mathbf{H}" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": " is less than " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\mathbf{N}" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": ", for the performance of " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\mathbf{B}" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": " improves as " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": " increases. In our experiments, we set " + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "inline_equation", + "content": "\\tau = 0.95" + }, + { + "bbox": [ + 130, + 510, + 480, + 581 + ], + "type": "text", + "content": " for all the datasets." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 582, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 481, + 665 + ], + "type": "text", + "content": "We evaluate the influence of different backbones for fair comparisons. As shown in Fig. 4(c), when we applied CLIP features to existing generative methods such as TF-VAE [28], we did not observe improvements, which are brought by high-quality representations. We speculate that the features extracted from VLMs are discriminative enough for classification, while they do not require additional complex optimization. Different from simple combinations between off-the-shelf methods and CLIP features, we fine-tune the VLMs in a prompt-" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 139 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 139 + ], + "type": "text", + "content": "adapter hybrid fashion to guide feature optimization, leading to superior performance." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 158, + 227, + 169 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 158, + 227, + 169 + ], + "spans": [ + { + "bbox": [ + 132, + 158, + 227, + 169 + ], + "type": "text", + "content": "4.4 Visualization" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 178, + 481, + 320 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 178, + 481, + 320 + ], + "spans": [ + { + "bbox": [ + 132, + 178, + 481, + 320 + ], + "type": "text", + "content": "Visualizations for Visual and Semantic Features. To show the distribution, we visualize them by t-SNE [25] in Fig. 5. By comparing Fig. 5(a) and Fig. 5(b), we can find that the learnable prompts exhibit a higher degree of dispersion. These learnable prompts capture task-specific knowledge from training samples to improve classification performance. Further, we explore the visual and semantic embedding fine-tuned by the proposed variational adapter. From Fig. 5(c) to Fig. 5(d), we can see that visual adapters tend to learn a more intensive distribution for each class to preserve intra-class information, while semantic adapter refines the corresponding relationship between vision and semantic modalities. By incorporating prompt learning and adapter-style tuning into a unified framework, PVA gives a reasonable solution for downstream task generalization." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 339, + 481, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 339, + 481, + 411 + ], + "spans": [ + { + "bbox": [ + 132, + 339, + 481, + 411 + ], + "type": "text", + "content": "Visualizations for latent Features. We visualize the latent features of both base and novel classes in Fig. 6. It can be seen that blue dots are located in gaps of gray dots with clear boundaries. Thus, we can separate these novel samples by cosine similarity. Although most of the novel samples can be accurately separated, some samples are also misclassified due to feature confusion. This is coincident with the results of Fig. 4(a)." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 430, + 220, + 441 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 430, + 220, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 430, + 220, + 441 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 454, + 481, + 586 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 454, + 481, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 454, + 481, + 586 + ], + "type": "text", + "content": "In this paper, we provide a Prompt-Adapter hybrid method PVA to handle the feature confusion problem caused by unbalanced fine-tuning. In general, we fine-tune the corresponding variational adapters for visual and language branches by aligning latent representations of them, where the input of the language adapter is the learnable textual tokens. In addition, we refine adapter output features with global features stored in the original CLIP to improve knowledge transfer. Once trained, we can build two independent classification tasks by similarity metrics. We show that the proposed PVA can achieve state-of-the-art performance on GZSC and challenging CDT tasks. Considering limitations, although PVA achieves remarkable results, it requires additional training costs, which we aim to alleviate in the future." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 234, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 234, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 234, + 129 + ], + "type": "text", + "content": "Acknowledgment" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 142, + 482, + 214 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 142, + 482, + 214 + ], + "spans": [ + { + "bbox": [ + 130, + 142, + 482, + 214 + ], + "type": "text", + "content": "This research was supported in part by NSFC (12326608, U19B2043, 62441602), National Science Foundation for Distinguished Young Scholars under Grant 62225605, Zhejiang Provincial Natural Science Foundation of China under Grant LD24F020016, the Key R&D Program of Zhejiang Province, China 2023C01043, Science and Technology Innovation of Ningbo (2023Z236, 2024Z294), and the Fundamental Research Funds for the Central Universities." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 236, + 197, + 248 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 236, + 197, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 236, + 197, + 248 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 263, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 263, + 480, + 297 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 263, + 480, + 297 + ], + "spans": [ + { + "bbox": [ + 138, + 263, + 480, + 297 + ], + "type": "text", + "content": "1. Akata, Z., Perronnin, F., Harchaoui, Z., Schmid, C.: Label-embedding for attribute-based classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 819-826 (2013)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 298, + 480, + 330 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 298, + 480, + 330 + ], + "spans": [ + { + "bbox": [ + 138, + 298, + 480, + 330 + ], + "type": "text", + "content": "2. Atzmon, Y., Chechik, G.: Adaptive confidence smoothing for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 11671-11680 (2019)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 331, + 480, + 364 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 331, + 480, + 364 + ], + "spans": [ + { + "bbox": [ + 138, + 331, + 480, + 364 + ], + "type": "text", + "content": "3. Chao, W.L., Changpinyo, S., Gong, B., Sha, F.: An empirical study and analysis of generalized zero-shot learning for object recognition in the wild. In: Proceedings of the European Conference on Computer Vision. pp. 52-68. Springer (2016)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 365, + 480, + 397 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 365, + 480, + 397 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 480, + 397 + ], + "type": "text", + "content": "4. Chen, S., Hong, Z., Liu, Y., Xie, G.S., Sun, B., Li, H., Peng, Q., Lu, K., You, X.: Transzero: Attribute-guided transformer for zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 330-338 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 399, + 480, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 399, + 480, + 441 + ], + "spans": [ + { + "bbox": [ + 138, + 399, + 480, + 441 + ], + "type": "text", + "content": "5. Chen, S., Hong, Z., Xie, G.S., Yang, W., Peng, Q., Wang, K., Zhao, J., You, X.: Msdn: Mutually semantic distillation network for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7612-7621 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 443, + 480, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 443, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 138, + 443, + 480, + 475 + ], + "type": "text", + "content": "6. Chen, S., Wang, W., Xia, B., Peng, Q., You, X., Zheng, F., Shao, L.: Free: Feature refinement for generalized zero-shot learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 122-131 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 475, + 480, + 509 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 475, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 138, + 475, + 480, + 509 + ], + "type": "text", + "content": "7. Chen, S., Xie, G., Liu, Y., Peng, Q., Sun, B., Li, H., You, X., Shao, L.: Hsva: Hierarchical semantic-visual adaptation for zero-shot learning. Proceedings of the Advances in Neural Information Processing Systems 34, 16622-16634 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 510, + 480, + 532 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 480, + 532 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 480, + 532 + ], + "type": "text", + "content": "8. Chen, X., Lan, X., Sun, F., Zheng, N.: A boundary based out-of-distribution classifier for generalized zero-shot learning. arXiv preprint arXiv:2008.04872 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 533, + 480, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 533, + 480, + 564 + ], + "spans": [ + { + "bbox": [ + 138, + 533, + 480, + 564 + ], + "type": "text", + "content": "9. Chen, Z., Huang, Y., Chen, J., Geng, Y., Zhang, W., Fang, Y., Pan, J.Z., Chen, H.: Duet: Cross-modal semantic grounding for contrastive zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 405-413 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 566, + 480, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 566, + 480, + 587 + ], + "spans": [ + { + "bbox": [ + 138, + 566, + 480, + 587 + ], + "type": "text", + "content": "10. Davidson, T.R., Falorsi, L., De Cao, N., Kipf, T., Tomczak, J.M.: Hyperspherical variational auto-encoders. arXiv preprint arXiv:1804.00891 (2018)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 588, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 588, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 134, + 588, + 480, + 632 + ], + "type": "text", + "content": "11. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 632, + 480, + 665 + ], + "type": "text", + "content": "12. Farhadi, A., Endres, I., Hoiem, D., Forsyth, D.: Describing objects by their attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1778-1785 (2009)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "13. Gao, P., Geng, S., Zhang, R., Ma, T., Fang, R., Zhang, Y., Li, H., Qiao, Y.: Clip-adapter: Better vision-language models with feature adapters. International Journal of Computer Vision pp. 1-15 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 481, + 184 + ], + "type": "text", + "content": "14. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Proceedings of the Advances in Neural Information Processing Systems. pp. 2672-2680 (2014)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 185, + 481, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 185, + 481, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 185, + 481, + 217 + ], + "type": "text", + "content": "15. Han, Z., Fu, Z., Chen, S., Yang, J.: Contrastive embedding for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2371-2381 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 218, + 481, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 218, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 132, + 218, + 481, + 251 + ], + "type": "text", + "content": "16. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 770-778 (2016)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 251, + 481, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 251, + 481, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 251, + 481, + 274 + ], + "type": "text", + "content": "17. Hendrycks, D., Gimpel, K.: A baseline for detecting misclassified and out-of-distribution examples in neural networks. arXiv preprint arXiv:1610.02136 (2016)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 274, + 481, + 317 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 274, + 481, + 317 + ], + "spans": [ + { + "bbox": [ + 132, + 274, + 481, + 317 + ], + "type": "text", + "content": "18. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: Proceedings of the International Conference on Machine Learning. pp. 4904-4916 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 319, + 481, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 319, + 481, + 352 + ], + "spans": [ + { + "bbox": [ + 132, + 319, + 481, + 352 + ], + "type": "text", + "content": "19. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 352, + 481, + 396 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 352, + 481, + 396 + ], + "spans": [ + { + "bbox": [ + 132, + 352, + 481, + 396 + ], + "type": "text", + "content": "20. Kong, X., Gao, Z., Li, X., Hong, M., Liu, J., Wang, C., Xie, Y., Qu, Y.: Encompactness: Self-distillation embedding & contrastive generation for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9306-9315 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 396, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 418 + ], + "type": "text", + "content": "21. Kwon, G., Al Regib, G.: A gating model for bias calibration in generalized zero-shot learning. IEEE Transactions on Image Processing (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 419, + 481, + 453 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 419, + 481, + 453 + ], + "spans": [ + { + "bbox": [ + 132, + 419, + 481, + 453 + ], + "type": "text", + "content": "22. Li, X., Xu, Z., Wei, K., Deng, C.: Generalized zero-shot learning via disentangled representation. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 1966-1974 (2021)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 453, + 481, + 497 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 481, + 497 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 481, + 497 + ], + "type": "text", + "content": "23. Liu, M., Li, F., Zhang, C., Wei, Y., Bai, H., Zhao, Y.: Progressive semantic-visual mutual adaption for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15337-15346 (2023)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 498, + 481, + 531 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 498, + 481, + 531 + ], + "spans": [ + { + "bbox": [ + 132, + 498, + 481, + 531 + ], + "type": "text", + "content": "24. Liu, Y., Zhou, L., Bai, X., Huang, Y., Gu, L., Zhou, J., Harada, T.: Goal-oriented gaze estimation for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3794-3803 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 531, + 481, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 531, + 481, + 553 + ], + "spans": [ + { + "bbox": [ + 132, + 531, + 481, + 553 + ], + "type": "text", + "content": "25. Van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9(11) (2008)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 554, + 481, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 554, + 481, + 587 + ], + "spans": [ + { + "bbox": [ + 132, + 554, + 481, + 587 + ], + "type": "text", + "content": "26. Min, S., Yao, H., Xie, H., Wang, C., Zha, Z.J., Zhang, Y.: Domain-aware visual bias eliminating for generalized zero-shot learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 12664-12673 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "spans": [ + { + "bbox": [ + 132, + 587, + 481, + 632 + ], + "type": "text", + "content": "27. Naeem, M.F., Khan, M.G.Z.A., Xian, Y., Afzal, M.Z., Stricker, D., Van Gool, L., Tombari, F.: I2mvformer: Large language model generated multi-view document supervision for zero-shot image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15169-15179 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 632, + 481, + 666 + ], + "type": "text", + "content": "28. Narayan, S., Gupta, A., Khan, F.S., Snoek, C.G., Shao, L.: Latent embedding feedback and discriminative features for zero-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 479-495. Springer (2020)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 214, + 101 + ], + "type": "text", + "content": "Z. Lu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 644 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 149 + ], + "type": "text", + "content": "29. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: Indian Conference on Computer Vision, Graphics & Image Processing. pp. 722-729 (2008)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "text", + "content": "30. Patterson, G., Hays, J.: Sun attribute database: Discovering, annotating, and recognizing scene attributes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2751-2758 (2012)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 183, + 482, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 183, + 482, + 226 + ], + "spans": [ + { + "bbox": [ + 130, + 183, + 482, + 226 + ], + "type": "text", + "content": "31. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning. pp. 8748-8763 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 226, + 482, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 270 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 270 + ], + "type": "text", + "content": "32. Schonfeld, E., Ebrahimi, S., Sinha, S., Darrell, T., Akata, Z.: Generalized zero-and few-shot learning via aligned variational autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8247-8255 (2019)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 270, + 482, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 270, + 482, + 304 + ], + "spans": [ + { + "bbox": [ + 130, + 270, + 482, + 304 + ], + "type": "text", + "content": "33. Su, H., Li, J., Chen, Z., Zhu, L., Lu, K.: Distinguishing unseen from seen for generalized zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7885-7894 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 304, + 482, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 304, + 482, + 336 + ], + "spans": [ + { + "bbox": [ + 130, + 304, + 482, + 336 + ], + "type": "text", + "content": "34. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. proceedings of the Advances in Neural Information Processing Systems (2017)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 336, + 459, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 336, + 459, + 347 + ], + "spans": [ + { + "bbox": [ + 130, + 336, + 459, + 347 + ], + "type": "text", + "content": "35. Villani, C., et al.: Optimal transport: old and new, vol. 338. Springer (2009)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 347, + 482, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 347, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 347, + 482, + 369 + ], + "type": "text", + "content": "36. Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 369, + 482, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 482, + 403 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 482, + 403 + ], + "type": "text", + "content": "37. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 403, + 482, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 403, + 482, + 435 + ], + "spans": [ + { + "bbox": [ + 130, + 403, + 482, + 435 + ], + "type": "text", + "content": "38. Xian, Y., Akata, Z., Sharma, G., Nguyen, Q., Hein, M., Schiele, B.: Latent embeddings for zero-shot classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 69-77 (2016)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 435, + 482, + 468 + ], + "type": "text", + "content": "39. Xian, Y., Lorenz, T., Schiele, B., Akata, Z.: Feature generating networks for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5542-5551 (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "spans": [ + { + "bbox": [ + 130, + 468, + 482, + 501 + ], + "type": "text", + "content": "40. Xian, Y., Sharma, S., Schiele, B., Akata, Z.: f-vaegan-d2: A feature generating framework for any-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 10275-10284 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 501, + 482, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 482, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 482, + 523 + ], + "type": "text", + "content": "41. Xu, B., Zeng, Z., Lian, C., Ding, Z.: Generative mixup networks for zero-shot learning. IEEE Transactions on Neural Networks and Learning Systems (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 523, + 482, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 523, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 130, + 523, + 482, + 555 + ], + "type": "text", + "content": "42. Zhang, L., Xiang, T., Gong, S.: Learning a deep embedding model for zero-shot learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2021-2030 (2017)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 555, + 482, + 589 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 589 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 589 + ], + "type": "text", + "content": "43. Zhang, R., Zhang, W., Fang, R., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free adaption of clip for few-shot classification. In: Proceedings of the European Conference on Computer Vision. pp. 493-510. Springer (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 589, + 482, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 589, + 482, + 621 + ], + "spans": [ + { + "bbox": [ + 130, + 589, + 482, + 621 + ], + "type": "text", + "content": "44. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 130, + 621, + 482, + 644 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 621, + 482, + 644 + ], + "spans": [ + { + "bbox": [ + 130, + 621, + 482, + 644 + ], + "type": "text", + "content": "45. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 257, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Zero-Shot Generalization with PVA" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_content_list.json b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..41e1fedbf6ef254ed8652d5218ee25a4ffa21f60 --- /dev/null +++ b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_content_list.json @@ -0,0 +1,1702 @@ +[ + { + "type": "text", + "text": "Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation", + "text_level": 1, + "bbox": [ + 217, + 140, + 785, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "*Marco Mistretta1, *Alberto Baldrati1,2, Marco Bertini1, and Andrew D. Bagdanov1", + "bbox": [ + 331, + 212, + 669, + 244 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 University of Florence - Media Integration and Communication Center (MICC)", + "bbox": [ + 228, + 253, + 772, + 268 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "2 University of Pisa", + "bbox": [ + 434, + 268, + 570, + 282 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Florence, Italy - Pisa, Italy", + "bbox": [ + 410, + 284, + 591, + 297 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "{name.surname}@unifi.it", + "bbox": [ + 411, + 297, + 589, + 310 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Vision-Language Models (VLMs) demonstrate remarkable zero-shot generalization to unseen tasks, but fall short of the performance of supervised methods in generalizing to downstream tasks with limited data. Prompt learning is emerging as a parameter-efficient method for adapting VLMs, but state-of-the-art approaches require annotated samples. In this paper we propose a novel approach to prompt learning based on unsupervised knowledge distillation from more powerful models. Our approach, which we call Knowledge Distillation Prompt Learning (KDPL), can be integrated into existing prompt learning techniques and eliminates the need for labeled examples during adaptation. Our experiments on more than ten standard benchmark datasets demonstrate that KDPL is very effective at improving generalization of learned prompts for zero-shot domain generalization, zero-shot cross-dataset generalization, and zero-shot base-to-novel class generalization problems. KDPL requires no ground-truth labels for adaptation, and moreover we show that even in the absence of any knowledge of training class names (CA-KDPL) can be used to effectively transfer knowledge. The code is publicly available at https://github.com/miccunifi/KDPL.", + "bbox": [ + 259, + 353, + 743, + 603 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Prompt Learning $\\cdot$ Unsupervised Knowledge Distillation $\\cdot$ Vision-Language Models $\\cdot$ Few-Shot Learning $\\cdot$ Zero-shot Transfer.", + "bbox": [ + 259, + 616, + 740, + 643 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 672, + 375, + 690 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Vision-Language Models (VLMs) like Contrastive Language-Image Pre-training (CLIP) are remarkably effective at zero-shot generalization to downstream tasks [3,42,44,65]. These models leverage a dual encoder architecture and are trained to align image and text features in a shared embedding space. CLIP and similar models are able to perform zero-shot classification by predicting the output class based on the similarity between the test image embedding and text embeddings of words from a fixed vocabulary.", + "bbox": [ + 212, + 707, + 787, + 813 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* These authors contributed equally to this work.", + "bbox": [ + 217, + 824, + 550, + 839 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/a2e6a564cca2a1ba0a22df9d60e4b5b08049a84ae5442e4a002e8db7fe4ce7ba.jpg", + "image_caption": [ + "Fig. 1: Motivation and overview. (Top left) Lightweight VLMs like CLIP achieve impressive zero-shot performance but lag behind supervised approaches; large VLMs incur a high computational burden. (Bottom left) Parameter-efficient prompt learning offers a non-destructive approach to adapting VLMs to downstream tasks; however, existing methods require annotated samples and struggle to generalize to unseen classes. (Right) Our approach does not require labeled samples and learns by distilling knowledge from a more powerful VLM. It can be seamlessly integrated into existing prompt learning techniques and generalizes better to unseen classes on downstream tasks." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 524, + 339 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/3a244238893de675128bf7a03f118399fc7b12e421686c530bf3392bdca78ec7.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 532, + 143, + 787, + 333 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "While CLIP exhibits remarkable zero-shot performance, it can fall short of supervised adaptation. Narrowing this gap through fine-tuning is challenging when large training datasets are not available for downstream tasks. Moreover, fine-tuning can also lead to overfitting and is destructive in that it can cause the model to forget knowledge acquired during large-scale pre-training [14,67].", + "bbox": [ + 212, + 491, + 787, + 566 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "An intuitive way to achieve better performance is to use larger and more powerful VLMs [10] with better zero-shot generalization. However, though performance improves with increasing size, their practical applicability in real-world scenarios decreases. Lightweight CLIP models based on ResNet-50 and ViT-B/32 require about 18 and 14 GFLOPs for inference, respectively. In contrast, more powerful models based on ViT-H/14 [10,18] require nearly $30 \\times$ the computation at 381 GFLOPs [18] for inference.", + "bbox": [ + 212, + 568, + 787, + 672 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To address these challenges, parameter-efficient prompt learning is emerging as a promising and non-destructive approach to adapting VLMs to downstream tasks [34,35,64]. Zhou et al. [67] proposed a text-only prompt learning approach called CoOp to overcome the limitations of manually crafted prompts. Subsequently, Jia et al. [29] extended prompt learning to the visual domain with Visual Prompt Tuning (VPT), and Khattak et al. [30,31] proposed a multi-modal prompt learning approach called MaPLe [30] and a self-regulated approach called PromptSRC [31]. Although significantly improving over carefully tuned, handcrafted prompts, these state-of-the-art techniques all require annotated samples from the dataset and have problems generalizing to other datasets or classes unseen during training [30,66].", + "bbox": [ + 212, + 674, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 397, + 126 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To eliminate the need for labeled training examples and improve the generalization of learned prompts, we propose a novel approach to prompt learning which we call Knowledge Distillation Prompt Learning (KDPL). KDPL adapts lightweight VLMs and improves performance on downstream tasks by distilling knowledge from a more powerful VLM without the need for annotated examples. KDPL is a flexible method that can be seamlessly integrated into existing prompt learning framework such as CoOp [67], CoCoOp [66], VPT [29], MaPLe [30], and PromptSRC [31]. Figure 1 summarizes the motivations and illustrates the workflow of the proposed approach. We validate KDPL on two increasingly challenging scenarios: in the first, we assume knowledge of training class names, while in the second we assume no knowledge of training classes. Importantly, in both scenarios no annotated training samples are used.", + "bbox": [ + 212, + 146, + 787, + 325 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The contributions of this work are:", + "bbox": [ + 240, + 328, + 491, + 340 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- we propose a novel parameter-efficient prompt-learning approach that eliminates the need for labeled training examples by distilling knowledge from a large Vision-Language Model;", + "- we show that our approach can be integrated into existing prompt learning techniques to learn visual, textual, and multimodal prompts which generalize significantly better than state-of-the-art baselines to unseen classes in downstream tasks:", + "- we demonstrate the effectiveness of our approach through extensive experiments on more than ten standard benchmark datasets covering a broad range of downstream problems, including domain generalization, cross-dataset adaptation, and base-to-novel generalization; and", + "- we introduce a new, class agnostic evaluation setting in which training class names are unknown and show the superiority of our approach in this scenario." + ], + "bbox": [ + 225, + 351, + 789, + 544 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To the best of our knowledge ours is the first approach to parameter-efficient VLM adaptation which is applicable in scenarios that are label agnostic (i.e. no label supervision is required during adaptation) and also in scenarios that are additionally class agnostic (i.e. no knowledge of training class names is assumed).", + "bbox": [ + 212, + 556, + 787, + 617 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 638, + 387, + 652 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this section we review the recent literature most relevant to our contribution.", + "bbox": [ + 212, + 669, + 782, + 683 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Vision-Language Models. Vision-Language Models (VLMs) learn robust visual representations thanks to their extensive pre-training on image-caption datasets [47, 48]. These representations are very effective at generalizing to a variety of downstream tasks [13, 28, 44]. In contrast to vision models trained only with image supervision, vision-language models can interpret both visual and textual data, showing improvement in tasks requiring cross-model understanding [3, 4, 52]. We focus on contrastively-trained VLMs such as CLIP [44], ALIGN [28], and LiT [60]. These models use a dual encoder architecture and contrastive learning to align images and text in a common embedding space. Thanks to this shared embedding space and massive pre-training datasets these", + "bbox": [ + 212, + 688, + 787, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "models achieve remarkable performance. However, there is still a gap between the zero-shot capabilities of these VLMs and the performance of tailored state-of-the-art models [15,44], and thus there is active research on efficient and effective methods to adapt VLMs to downstream tasks [21,38,55,61].", + "bbox": [ + 215, + 146, + 784, + 207 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Prompt Learning. The performance of VLMs is highly dependent on textual prompts used to characterize downstream tasks. Given the significant impact of small changes in wording on performance, the manual generation of optimal textual prompts is a challenging task. Inspired by developments in NLP [34,35, 64], CoOp [67] proposes to learn continuous vectors in the word embedding space instead of using tailored hand-crafted prompts.", + "bbox": [ + 215, + 215, + 784, + 306 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The promising results of CoOp have attracted considerable interest in prompt learning for VLMs [1, 2, 7, 8, 30, 31, 37, 49, 50, 57, 68]. CoCoOp, in particular, highlights the poor performance of CoOp on unseen classes and uses image-conditional dynamic prompts to improve generalization [66]. PLOT [8] instead is based on learning multiple prompts by exploiting local visual features. Kg-CoOp [57] adds a regularization loss to minimize the discrepancy between learned and hand-crafted prompts, while VPT [29] adapts prompt learning to the visual domain by learning continuous vectors in the input space of a ViT [16]. Finally, MaPLe [30] introduces a multimodal prompt learning strategy for VLMs. PromptSRC [31] introduces a self-regularization framework for prompting, addressing overfitting through agreement with a frozen model, a self-ensemble of prompts, and textual diversity.", + "bbox": [ + 215, + 311, + 785, + 493 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Similar to the approach we propose in this paper, UPL [27] performs prompt learning without relying on annotated samples. It leverages pseudolabels derived from a larger CLIP model and selects the top-K most confident samples per class to construct a balanced set of pseudo-labels. UPL requires a substantial collection of unlabeled images and is not directly applicable when only a few unlabeled samples are available, like in the few-shot adaptation scenarios considered here. In contrast to UPL, KDPL does not use pseudolabeling; instead, we directly learn from the logits of a CLIP teacher model via knowledge distillation, thus eliminating the need for any selection strategy of the training samples.", + "bbox": [ + 215, + 498, + 784, + 633 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Knowledge Distillation. Knowledge distillation (KD) is a machine learning technique in which a simple model (student) is trained to mimic the behavior of a larger model (teacher) by learning from its output or intermediate activation [26]. This technique has found success in many contexts, including image classification [5,9,26], self-supervised learning [19,56], and image/video segmentation [17, 22, 40, 51], leading to improvements in model compression, computational efficiency, and performance. DML [62] introduces a mutual learning approach to train students and teachers simultaneously. DKD [63] reformulates the classical KD loss into a term related to the target class and a term related to the non-target classes. In contrast to the majority of knowledge distillation approaches [58, 59, 62, 63], we do not utilize any labels during training. Instead, we solely employ the distillation loss. In our work, we apply knowledge distillation in a parameter-efficient prompt learning scenario. Specifically, we distill", + "bbox": [ + 215, + 643, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 395, + 126 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "knowledge from a large and powerful VLM (teacher) into a lightweight VLM (student) by updating only a reduced number of parameters (the prompt).", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Techniques Using Teacher-Student Distillation. Recently Li et al. [36] introduced PromptKD which also uses teacher-student distillation in prompt learning. Although it too leverages a larger teacher to guide a smaller student, it differs from our contribution in several key aspects. PromptKD uses PromptSRC [31] to pre-train the teacher model with labeled examples, whereas KDPL does not pre-train the teacher and requires no labeled examples. PromptKD uses an MLP to project the student image encoder output, which adds extra parameters. KDPL is instead a general framework with no additional parameters, adaptable to any prompt-tuning technique to render them completely unsupervised. Moreover, PromptKD uses the entire training set, including both base and novel images, for distillation. In contrast, KDPL follows the standard 16-shot setting.", + "bbox": [ + 212, + 181, + 787, + 363 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Knowledge Distillation Prompt Learning (KDPL)", + "text_level": 1, + "bbox": [ + 214, + 387, + 732, + 406 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We first introduce preliminary concepts related to prompt learning and then describe our approach to applying knowledge distillation to the problem.", + "bbox": [ + 212, + 421, + 782, + 452 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Preliminaries", + "text_level": 1, + "bbox": [ + 214, + 474, + 372, + 489 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our approach is based on knowledge distillation applied to prompt learning. Here we discuss the base teacher and student models (CLIPs) and five state-of-the-art prompt learning approaches into which we will incorporate KDPL.", + "bbox": [ + 212, + 502, + 784, + 547 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "CLIP. Contrastive Language-Image Pre-training (CLIP) is a vision-language model trained to align images and textual captions in shared semantic space [44]. CLIP consists of an image encoder $f_{\\theta}$ and a text encoder $g_{\\phi}$ . Given an image $I$ , the image encoder computes its feature representation $f_{\\theta}(I) \\in \\mathbb{R}^d$ , where $d$ is the size of the semantic embedding space. Similarly, for a given textual caption $Y$ , a word embedding layer $E_L$ maps each tokenized word to the token embedding space $\\mathcal{W}$ . Then, the text encoder $g_{\\phi}$ generates the textual feature representation $g_{\\phi}(E_L(Y)) \\in \\mathbb{R}^d$ . The main goal of CLIP training is to learn $\\theta$ and $\\phi$ such that $f_{\\theta}(I) \\approx g_{\\phi}(E_L(Y))$ for associated image/text pairs $(I,Y)$ .", + "bbox": [ + 212, + 551, + 787, + 686 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "When using a Vision Transformer (ViT) [16] as the visual encoder $f_{\\theta}$ , the encoding process begins by splitting the image into $U$ fixed-size patches. These patches are then projected into patch embeddings $\\{w_1, w_2, \\ldots, w_U\\}$ , where each $w_i$ belongs to the patch embedding space $\\mathcal{V}$ . A learnable class (CLS) token $c_i$ is concatenated with the patch embeddings, resulting in the input to the vision transformer being $\\{c_i, w_1, w_2, \\ldots, w_U\\}$ . Finally, the CLS token of the final transformer layer is projected to the shared embedding space via a linear projection to obtain the final representation.", + "bbox": [ + 212, + 688, + 787, + 808 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To perform zero-shot classification using CLIP, we start with an image $I$ and build a set of textual prompts $\\{Y_{i}\\}_{i = 1}^{C}$ , where $C$ denotes the number of classes.", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Each handcrafted text prompt $Y_{i}$ takes the format \"a photo of a $[CLASS_{i}]$ \", where $CLASS_{i}$ represents a specific class name, such as airplane, bird, etc.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Then the feature representations $\\psi_I = f_\\theta(I)$ and $\\psi_T^i = g_\\phi(E_L(Y_i))$ are extracted using the CLIP encoders. The predicted probability for each class is:", + "bbox": [ + 212, + 176, + 782, + 207 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\np (y = i \\mid I) = \\frac {\\exp \\left(\\cos \\left(\\psi_ {T} ^ {i} , \\psi_ {I}\\right) / \\tau\\right)}{\\sum_ {j = 1} ^ {C} \\exp \\left(\\cos \\left(\\psi_ {T} ^ {j} , \\psi_ {I}\\right) / \\tau\\right)}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 359, + 219, + 784, + 255 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\cos (\\cdot ,\\cdot)$ is the cosine similarity and $\\tau$ is a temperature hyperparameter.", + "bbox": [ + 212, + 258, + 772, + 273 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Prompt-Learning Techniques. Here we summarize how the state-of-the-art techniques for textual, visual, and multimodal prompt learning work.", + "bbox": [ + 212, + 277, + 782, + 309 + ], + "page_idx": 5 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- CoOp [67] is a textual prompt learning technique that learns continuous context tokens (i.e. the learnable prompt) in the CLIP token embedding space. Specifically, CoOp introduces $M$ learnable vectors, $\\{v_{1}, v_{2}, \\ldots, v_{M}\\}$ where each context vector $v_{i} \\in \\mathcal{W}$ . For each of the $k$ classes of a dataset, the input to the text encoder is $\\{v_{1}, v_{2}, \\ldots, v_{M}, c_{k}\\}$ , where $c_{k} = E_{L}([CLSAS_{k}])$ .", + "- CoCoOp [66] extends CoOp by incorporating a lightweight network $h_\\theta$ . Each context token is obtained as $v_i(I) = v_i + \\pi$ , where $\\pi = h_\\theta(I)$ . This method ensures that the textual prompts are conditioned on the input image.", + "- VPT [29] is a visual prompt learning method that can be viewed as the counterpart of CoOp in the visual domain. Unlike CoOp, which operates entirely in the textual token embedding space $\\mathcal{W}$ , VPT performs prompt learning in the visual patch embedding space $\\mathcal{V}$ . Specifically, VPT learns $P$ visual tokens, leading to the input to the ViT being $\\{z_{1},\\ldots ,z_{P},c_{i},w_{1},w_{2},\\ldots ,w_{U}\\}$ . VPT offers two prompting variants: deep and shallow. The deep variant learns a distinct prompt for each ViT layer, while the shallow variant incorporates the prompt parameters only into the input of the first layer.", + "- MaPLe [30] is a deep multi-modal prompt learning technique that promotes strong coupling between vision and language prompts. In practice, MaPLe learns different textual context tokens for each layer in $g_{\\phi}$ . The visual prompts, on the other hand, are not directly learned but are obtained through a linear mapping from the textual ones.", + "- PromptSRC [31] is another multi-modal prompt learning technique that optimizes prompts through mutual agreement maximization between prompted and frozen model features using self-distillation, Gaussian-weighted prompt aggregation over the training session, and promoting textual diversity to address sample diversity imbalance." + ], + "bbox": [ + 225, + 313, + 797, + 700 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Note that methods involving visual prompt learnable tokens like VPT [29], MaPLe [30], and PromptSRC [31] can only be applied to VLMs equipped with a ViT-based image encoder.", + "bbox": [ + 212, + 708, + 782, + 753 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Label Agnostic Prompt Learning", + "text_level": 1, + "bbox": [ + 214, + 772, + 534, + 787 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The methods described above all rely on ground-truth labels during adaptation. Here we show how unsupervised knowledge distillation can be used instead to replace the need for annotated training examples.", + "bbox": [ + 212, + 794, + 782, + 839 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 397, + 127 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/e117afe262e4488118d77e09c2f91aa876dd0017e84a1a02c806300b0b8442d9.jpg", + "image_caption": [ + "Fig. 2: Knowledge Distillation Prompt Learning (KDPL) overview. Given a lightweight VLM student and a larger, more powerful VLM teacher, KDPL updates the student prompt parameters by distilling knowledge from the teacher. KDPL first performs zero-shot classification with the teacher to obtain teacher probabilities $p_T$ . It then computes the student probabilities $p_S$ and performs knowledge distillation to update the student prompt parameters $\\gamma$ ." + ], + "image_footnote": [], + "bbox": [ + 222, + 143, + 776, + 272 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Overview. Our proposed approach, which we call Knowledge Distillation Prompt Learning (KDPL), is a general method designed to enhance the performance of the CLIP model on downstream tasks through parameter-efficient prompt learning. Unlike previous approaches [30,66,67], which rely on labeled examples for training, KDPL eliminates the need for manually-labeled samples by learning only through knowledge distillation from a larger and more powerful VLM. Note that KDPL is a method that can be seamlessly integrated with any existing prompt learning approach in scenarios where no information about class names or labels is available.", + "bbox": [ + 212, + 393, + 787, + 527 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We validate KDPL in two progressively challenging supervision regimes. In the label agnostic scenario we do not use ground-truth labels, but we assume knowledge of the class names in the training dataset. In the class agnostic scenario (see Section 3.3) we go one step further and assume that even the training class names are unknown. For this class agnostic scenario we propose an effective and efficient online strategy for automatically filtering the classes from a large dictionary of approximately 20K class names [33].", + "bbox": [ + 212, + 529, + 787, + 636 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Prompt Learning via Unsupervised Knowledge Distillation (KDPL). Given a lightweight CLIP model (the student) and a larger, more powerful CLIP model (the teacher), we aim to improve the downstream performance of the student model by distilling knowledge from teacher to student. For an image $I$ and a set of classes $\\mathcal{C} = \\{\\mathrm{CLASS}_i\\}_{i=1}^C$ , we start by performing zero-shot classification using the frozen teacher model. Specifically, we use the teacher image encoder $f_{\\theta}^{B}$ and text encoder $g_{\\phi}^{B}$ to compute the teacher image features $\\psi_{I,B} = f_{\\theta}^{B}(I)$ and text features $\\psi_{T,B}^{i} = g_{\\phi}^{S}(E_L([\\mathrm{CLASS}_i]))$ . For the teacher model we use the fixed text prompt \"a photo of [CLASS]\". We then apply Eq. (1) to produce the probabilities $p_T(I,\\mathcal{C})$ predicted by the teacher on image $I$ for classes $\\mathcal{C}$ .", + "bbox": [ + 212, + 640, + 787, + 792 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The teacher model does not rely on a learnable prompt and its predictions remain fixed during training. Our aim is to learn text and image prompts for the student model that enhance its generalization to downstream tasks.", + "bbox": [ + 212, + 792, + 787, + 838 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We denote with $f_{\\theta}^{S}$ and $g_{\\phi}^{S}$ the student image and text encoders, respectively, and with $\\gamma$ the parameters associated with the learnable student prompts (see Fig. 2). Given the same image $I$ processed by the teacher and the same set of classes $\\mathcal{C}$ , the student extracts image features $\\psi_{I,S} = f_{\\theta,\\gamma}^{S}(I)$ and text features $\\psi_{T,S}^{i} = g_{\\phi,\\gamma}^{S}(E_{L}([\\mathrm{CLASS}_{i}]))$ . Note that the text and image encoders can both depend on the prompt parameters $\\gamma$ . According to the prompt learning technique used, the $\\gamma$ parameters can be used only by the text encoder (CoOp, CoCoOp), the visual encoder (VPT), or both (MaPLe, PromptSRC). Finally, using Eq. (1) we produce student class probabilities $p_{S}(I,\\mathcal{C})$ predicted on image $I$ for classes $\\mathcal{C}$ . Note that all encoder parameters except for the learnable prompt $\\gamma$ are frozen.", + "bbox": [ + 212, + 145, + 787, + 299 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We use the symmetric KL-divergence between the teacher $(p_T(I,\\mathcal{C}))$ and the student $(p_S(I,\\mathcal{C}))$ probabilities in a distillation loss:", + "bbox": [ + 212, + 300, + 787, + 333 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} (\\mathcal {I}, \\mathcal {C}) = \\left[ D _ {\\mathrm {K L}} \\left(p _ {T} (I, \\mathcal {C}) \\mid \\mid p _ {S} (I, \\mathcal {C})\\right) + D _ {\\mathrm {K L}} \\left(p _ {S} (I, \\mathcal {C}) \\mid \\mid p _ {T} (I, \\mathcal {C})\\right) \\right], \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 276, + 344, + 785, + 362 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $D(q\\parallel p)$ is the asymmetric KL-divergence between the discrete probability distributions $p$ and $q$ :", + "bbox": [ + 212, + 373, + 785, + 405 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\nD _ {\\mathrm {K L}} (p \\mid | q) = \\sum_ {i \\in \\mathcal {C}} p _ {i} \\log \\left(\\frac {p _ {i}}{q _ {i}}\\right) \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 398, + 417, + 785, + 454 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "This distillation loss depends only on the fixed predictions of the teacher, the prompt-conditioned predictions of the students, and the set of classes $\\mathcal{C}$ .", + "bbox": [ + 212, + 465, + 785, + 496 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Importantly, our distillation loss does not assume any knowledge of class labels for image $I$ . Nor does it require that $\\mathcal{C}$ be the classes of the downstream task – that is, KDPL can be used for Label Agnostic and Class Agnostic adaptation scenarios. We found in early experiments that the symmetric KL-divergence works slightly better than either asymmetric option (see Section B.3 in the Supplementary Material for an ablation study on this choice).", + "bbox": [ + 212, + 497, + 787, + 588 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.3 Class Agnostic Prompt Learning", + "text_level": 1, + "bbox": [ + 214, + 613, + 532, + 630 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To further evaluate the generalization capabilities of KDPL, we introduce a scenario where not only do we not know the labels of training images (label agnostic, Section 3.2) but where we also do not even know the class names associated with the dataset (class agnostic). This scenario is considerably more challenging as we make no assumptions about the few-shot training data.", + "bbox": [ + 212, + 642, + 787, + 718 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To address the unavailability of class names, we propose a strategy for automatically selecting a set of class names for each batch. We start with a large vocabulary of class names from which to select. Specifically, we use the Open Images V7 dataset [33], which contains $\\sim 20\\mathrm{K}$ classes. The most straightforward method would simply use all 20K classes during training. However, this is impractical as the memory required by prompt learning methods increases linearly with the number of classes. According to Ren et al. [46], CoOp requires nearly 15MB of VRAM per class, resulting in approximately 300GB of memory when", + "bbox": [ + 212, + 719, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 395, + 126 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "multiplied by 20K classes. Therefore, we propose a method to automatically select which classes to use for each batch by retaining only the ones most relevant to the calculation of the loss in Eq. (2).", + "bbox": [ + 212, + 146, + 782, + 191 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Given a batch of images $X = \\{I_i\\}_{i=1}^N$ and all the class names in the vocabulary $\\mathcal{C} = \\{\\mathrm{CLASS}_i\\}_{i=1}^C$ , where $N$ represents the number of images in a batch and $C$ the size of the dictionary, we let the teacher model select the most relevant classes. Our objective is to identify the most useful $K$ classes in each batch for student prompt learning. After extracting the teacher image and text features, for each image $I_i \\in X$ , we apply Eq. (1) to obtain the teacher probabilities $p_T(I_i, \\mathcal{C})$ . By stacking the probabilities along the batch dimension, we obtain the matrix $P_T = [p_T(I_1, \\mathcal{C}); \\dots; p_T(I_N, \\mathcal{C})]^T \\in \\mathbb{R}^{N \\times C}$ , where the $i$ -th row corresponds to the probabilities associated with image $I_i$ . We then compute the average probabilities along the batch axis, resulting in $\\overline{P_T} \\in \\mathbb{R}^C$ . Finally, we select the classes corresponding to the $K$ highest values in $\\overline{P_T}$ .", + "bbox": [ + 212, + 191, + 784, + 359 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Using the teacher model to perform this class filtering for each batch is feasible and does not incur excessive memory costs since the teacher requires no gradient computation. Therefore, the memory consumption does not depend on the number of classes in $\\mathcal{C}$ . Conversely, although the student model remains frozen, gradients must still be propagated to update the prompt parameters $\\gamma$ . Once the classes are selected, the training strategy remains the same as described above, with the only difference being that the class names observed by the student vary in each batch based on teacher predictions.", + "bbox": [ + 212, + 361, + 785, + 481 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4 Experimental Results", + "text_level": 1, + "bbox": [ + 215, + 508, + 460, + 525 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section we report on experiments validating our proposed approach.", + "bbox": [ + 214, + 544, + 754, + 559 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Evaluated Scenarios and Implementation Details", + "text_level": 1, + "bbox": [ + 214, + 585, + 663, + 599 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Following previous works [30,66,67], we validate KDPL in three distinct settings: 1) domain generalization; 2) cross-dataset transfer; 3) generalization to unseen classes. Additionally, to evaluate the scenario where class names are also unknown, we introduce a new evaluation setting we call class agnostic adaptation. We use the train/val/test splits and seeds provided by Zhou et al. [67] for all datasets. All reported results are averages over three independent runs.", + "bbox": [ + 212, + 613, + 782, + 703 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Evaluated Scenarios. We evaluate KDPL on the following scenarios:", + "bbox": [ + 214, + 709, + 723, + 724 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "- Domain Generalization. To assess the ability of the learned prompts to generalize to out-of-distribution datasets, we apply the prompt learned from ImageNet [12] to four different versions of ImageNet datasets exhibiting various types of domain shift. The target datasets are ImageNetV2 [45], ImageNet-Sketch [54], ImageNet-A [25], and ImageNet-R [24].", + "bbox": [ + 225, + 737, + 785, + 813 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "page_footnote", + "text": "3 https://github.com/KaiyangZhou/CoOp/blob/main/DATASETS.md", + "bbox": [ + 217, + 824, + 676, + 839 + ], + "page_idx": 8 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- Cross-dataset Transfer. To evaluate the ability of learned prompts to generalize to unseen classes, we evaluate the same prompt trained on ImageNet on a broad range of downstream recognition tasks. We validate on ten datasets with varying characteristics: Caltech101 [20] for general object classification; OxfordPets [43], StanfordCars [32], Flowers102 [41], Food101 [6], and FGVCAircraft [39] for fine-grained classification; the Describable Textures Dataset (DTD) [11] for texture classification; EuroSAT [23] for satellite-image recognition; and UCF101 [53] for action recognition.", + "- Generalization to Unseen Classes. To evaluate how learned prompts generalize to unseen classes from the same dataset, we divide classes into two subsets: base and novel classes. The prompt is trained exclusively on the base classes and then tested on the novel ones. We evaluate on ImageNet as well as the ten benchmark datasets used for cross-dataset evaluation.", + "- Class Agnostic Adaptation. In addition we introduce a novel evaluation setting in which the training class names are unknown. The prompt is trained on ImageNet and tested on all the benchmark datasets used in the domain generalization and cross-dataset evaluations." + ], + "bbox": [ + 225, + 146, + 787, + 404 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Implementation Details. We use a CLIP model with a ViT-H-14 visual backbone as the teacher model. For student models, we evaluate both on a CLIP model based on ResNet-50 and a model based on ViT-B/32. By experimenting with both ResNet-based and ViT-based CLIP models we show the architecture independence of our approach. To assess how KDPL performs when integrated into different prompt learning techniques, we selected five distinct textual, visual, and multimodal approaches. With the ResNet-50 student model, we experiment with CoOp [67] and CoCoOp [66]. For the ViT-B/32 student, since it supports both visual and textual prompting, we experiment with CoOp [67], VPT [29], MaPLe [30] and PromptSRC [31].", + "bbox": [ + 212, + 420, + 787, + 571 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We denote the integration of our unsupervised knowledge distillation strategy with a specific prompt learning technique by adding the suffix $+\\mathrm{KDPL}$ to the name of the corresponding technique. For example, CoOp+KDPL refers to the application of KDPL to CoOp. For class agnostic settings we instead use the suffix $+\\mathrm{CA}$ -KDPL to indicate that no training class names are used.", + "bbox": [ + 212, + 571, + 787, + 647 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Unless otherwise stated, all experiments are conducted in the few-shot setting with 16 examples per class randomly sampled from the training set. We set the temperature hyperparameter $\\tau$ in Eq. (1) to 0.01. In the class agnostic experiments in which we assume no knowledge of class names in the training set, we set the number of class names selected in each iteration to $K = 1000$ .", + "bbox": [ + 212, + 648, + 787, + 722 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "For each prompt learning method we use the original implementation and hyperparameters reported in the respective papers. Since we use the compact ResNet-50 and ViT-B/32 backbones, we cannot directly compare to the originally published results. Thus, all numbers we report here were computed by us and are averages over three independent runs. See Section A in the Supplementary Material for additional implementation details.", + "bbox": [ + 212, + 723, + 787, + 814 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 397, + 126 + ], + "page_idx": 9 + }, + { + "type": "page_footnote", + "text": "4 https://huggingface.co/apple/DFN5B-CLIP-ViT-H-14", + "bbox": [ + 217, + 824, + 609, + 839 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/a58ed2445976951d8f991ca5b01f89b60f3d947979f784b61fdbac531d19cf48.jpg", + "table_caption": [ + "Table 1: Domain Generalization. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting, the prompt is trained on ImageNet (source) and then tested on four different versions of ImageNet (targets) that exhibit some kind of domain shift. Average performance improvements over the baselines are shown in green, and average performance deterioration in red." + ], + "table_footnote": [], + "table_body": "
BackboneMethodSourceTarget
ImageNet-V2-S-A-RAverage
RN50CLIP (student)58.2051.5033.3021.7056.0040.63
CoOp62.4055.1733.7023.1356.2042.05
CoOp + KDPL62.7355.3735.2023.2757.7742.90
CoCoOp63.0755.5334.7723.7359.4743.38
CoCoOp + KDPL62.7055.6035.3023.4357.9043.06
ViT-B/32CLIP (student)62.0054.7040.8029.6066.0047.78
CoOp66.3358.3041.4031.4765.8749.26
CoOp + KDPL65.9758.1042.5031.6367.3749.90
VPT64.9756.7341.2727.0066.5047.88
VPT + KDPL65.1057.3741.6727.7767.4748.57
MaPLe66.8058.5342.2330.1366.4049.32
MaPLe + KDPL66.5058.4742.7729.8767.7049.70
PromptSRC66.3358.7042.9732.0768.9350.67
PromptSRC + KDPL66.2758.6043.0731.7068.8350.55
ViT-H/14CLIP (teacher)82.8076.6071.1071.1091.3077.53
", + "bbox": [ + 222, + 226, + 782, + 551 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "4.2 Results on Domain Generalization", + "text_level": 1, + "bbox": [ + 215, + 580, + 545, + 595 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Table 1 outlines the performance in the domain generalization setting. We report the performance of each baseline method alongside their unsupervised KDPL variants. Additionally, the performance of the zero-shot CLIP student and teacher models using a handcrafted prompt is included for comparison. We observe that applying our unsupervised approach to each baseline does not result in a significant decrease in performance on the source dataset. Notably, when transferring the learned prompts to a different domain, incorporating KDPL in each baseline can lead to a slight improvement. This suggests that our unsupervised teacher-student distillation learns prompts that generalize better than those trained using ground-truth labels. The only exceptions where we observe an average decrease compared to the baseline are when using CoCoOp or PromptSRC. CoCoOp-KDPL achieves an average accuracy significantly lower than CoCoOp only on the ImageNet-R dataset. Finally, note that all our unsupervised KDPL variants significantly improve the performance over the zero-shot CLIP student model in both the source and the target datasets.", + "bbox": [ + 212, + 613, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/182d704428b67782eb467b159bc62468c5adc898e3ae91ca410dc1ecb8897deb.jpg", + "table_caption": [ + "Table 2: Cross-dataset Transfer. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). The prompt is learned on ImageNet and then tested on the ten different target datasets. Average performance improvements over the baselines are indicated in green." + ], + "table_footnote": [], + "table_body": "
BackboneMethodTarget
OxfordPetsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)83.7061.0015.6040.0024.2055.6075.2058.5086.0058.3055.81
CoOp84.6061.6313.7736.8322.3354.2075.0359.0087.6757.7355.28
CoOp + KDPL87.3362.8314.9739.2730.1756.6077.2760.3088.5758.6357.59
CoCoOp86.9363.4716.2740.5327.2055.4777.7361.4088.0760.4357.75
CoCoOp + KDPL87.3364.9715.9741.2729.1756.8378.0061.5088.5059.5358.31
ViT-B/32CLIP (student)85.0064.3018.2042.8038.1060.4079.1062.0091.1060.7060.17
CoOp87.1362.2012.1340.5736.9757.8380.1362.8391.1361.8059.27
CoOp + KDPL87.1362.2315.5740.4040.9358.8380.5764.2392.7761.6360.43
VPT87.4364.7719.5344.2028.4757.6078.2763.7391.4062.5059.79
VPT + KDPL87.4364.4317.7742.9330.8057.9778.4763.6392.0062.7759.82
MaPLe88.3766.4318.4742.0337.7760.0080.1064.4391.3362.5061.14
MaPLe + KDPL88.2764.7717.3343.1337.1359.9380.4765.4393.4362.7061.26
PromptSRC88.1365.3317.1743.9040.5060.1781.2365.4092.3763.6361.78
PromptSRC + KDPL88.1765.1018.2343.2744.3060.4380.9065.6793.6363.4062.31
ViT-H/14CLIP (teacher)94.8089.4063.2066.8063.3095.6093.6076.4097.9076.4081.74
", + "bbox": [ + 220, + 212, + 782, + 506 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Results on Cross-dataset Transfer", + "text_level": 1, + "bbox": [ + 215, + 534, + 539, + 549 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Table 2 we present the results of the cross-dataset evaluation setting in which the prompt is trained on ImageNet and tested on ten different target datasets. For all datasets our KDPL-based variants consistently outperform the corresponding baselines and demonstrate superior generalization performance. The greater generalization capabilities of KDPL are evident even for fine-grained datasets like EuroSAT, on which the CoOp+KDPL achieves an $8\\%$ improvement over the baseline CoOp when using ResNet-50 as the backbone. Although adding KDPL yields only minor improvement to the VPT and MaPLe prompt learning techniques, we emphasize that our VPT+KDPL and MaPLe+KDPL do not have access to ground-truth labels. Notably, PromptSRC+KDPL achieves the highest average performance.", + "bbox": [ + 212, + 561, + 787, + 728 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.4 Results on Generalization to Unseen Classes", + "text_level": 1, + "bbox": [ + 215, + 752, + 629, + 766 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In Table 3 we give results for the unseen class generalization task. In these experiments each dataset is split into $50\\%$ of the classes as a base for training few-shot adaptation, and the remaining $50\\%$ as new classes on which zero-shot performance is evaluated. KDPL consistently outperforms the corresponding baseline", + "bbox": [ + 212, + 779, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 395, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/776f1ae9188baf5a7d1da74b72bae7e1610a171371101a0a6f81fd671c349be5.jpg", + "table_caption": [ + "Table 3: Generalization to Unseen Classes. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting the prompt is tested on classes never observed during training. Average performance improvements over the baselines are indicated in green." + ], + "table_footnote": [], + "table_body": "
BackboneMethodUnseen Classes
ImageNetOxfordPntsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)60.1093.7071.3024.8053.9043.7066.6082.2070.1090.5067.8065.88
CoOp60.0091.6358.3022.1740.9342.1359.8782.0366.7787.5357.6360.82
CoOp + KDPL60.5394.9763.4021.2738.7062.0756.6383.0769.8388.7562.6363.80
CoCoOp63.0794.9367.4724.8745.4035.1064.7384.5072.8790.7364.6764.39
CoCoOp + KDPL62.4395.1069.1724.5748.0055.9363.7085.6773.3390.5366.4066.80
ViT-B/32CLIP (student)64.0096.3072.3028.3053.9061.5069.8085.7073.1094.0071.6070.05
CoOp64.5393.3759.7723.0345.5749.1361.7385.5069.3792.1365.6064.52
CoOp + KDPL64.9094.0056.1722.0047.3362.0762.3787.2374.1793.4366.2066.35
VPT64.6094.8366.0329.7050.1750.0369.9085.8375.1392.5769.4768.02
VPT + KDPL65.2095.2067.8730.4047.5354.9769.8086.3375.1792.8071.0768.76
MaPLe66.7096.8769.7720.4353.5066.7068.0387.4776.5792.2769.4069.79
MaPLe + KDPL66.7396.8768.2327.3750.3375.7068.4087.8376.8393.6773.5371.41
PromptSRC65.9396.3071.3723.6754.4361.9770.0087.1376.7794.7072.6370.45
PromptSRC + KDPL66.3396.4768.8328.4350.8774.1768.5087.6377.3394.4774.7371.61
ViT-H/14CLIP (teacher)84.1099.2085.6064.3075.0082.6098.2096.3085.1097.3085.2086.63
", + "bbox": [ + 220, + 212, + 782, + 488 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "methods for both backbones, demonstrating improvement in all scenarios for the majority of the datasets. On average, the performance improvement over the supervised baseline methods ranges from about $1\\%$ for VPT to about $3\\%$ for CoOp with the ResNet-50 backbone. See Section C.1 in the Supplementary Material for further analysis of base and unseen performance.", + "bbox": [ + 212, + 521, + 787, + 597 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.5 Results on Class Agnostic Adaptation", + "text_level": 1, + "bbox": [ + 214, + 626, + 576, + 642 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Figure 3(a-b) summarizes the main results in the proposed Class Agnostic (CA) scenario in which even the training class names are unknown at training time. We report the accuracy on the ImageNet dataset (source), as well as the average accuracy in domain generalization and cross-dataset settings. Note that, even without knowing the class names, the performance on the source dataset steadily improves compared to the zero-shot CLIP model. Moreover, the prompts learned via the proposed unsupervised class agnostic knowledge distillation also exhibit improved average domain generalization $(\\mathrm{AVG}^1)$ and cross-dataset capabilities $(\\mathrm{AVG}^2)$ . Figure 3(b) visually depicts how the ResNet-50-based CoOp + CA-KDPL compares with supervised CoOp and zero-shot CLIP student performance in the cross-dataset transfer setting. Notably, CA-KDPL outperforms both baselines despite being unsupervised and class agnostic during training.", + "bbox": [ + 212, + 657, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/21428817f1366b38e973a1e7b11b0619502d78a230ec2161d5dfe542c68313a5.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodSourceAVG1AVG2
ResNet-50 (student)58.2040.6355.81
CoOp + CA-KDPL61.8343.0257.69
CoCoOp + CA-KDPL61.4343.1858.03
ViT-B/32 (student)62.0047.7860.17
CoOp + CA-KDPL64.7349.6360.74
VPT + CA-KDPL63.7347.8959.80
MaPLe + CA-KDPL65.2349.2861.23
PromptSRC + CA-KDPL65.0050.3761.93
", + "bbox": [ + 222, + 184, + 491, + 308 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "(a) Average class agnostic adaptation", + "bbox": [ + 228, + 320, + 482, + 335 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/e07599925f4edd60a56da9c47d87cade6e2a0486c249cbfc761ed6cf11ec5067.jpg", + "image_caption": [ + "Fig. 3: Class agnostic adaptation. (a) Comparison between the zero-shot baselines and our class agnostic CA-KDPL variants (highlighted in cyan). The prompt is learned in an unsupervised and class agnostic setting on ImageNet and evaluated on the benchmark datasets for domain generalization $(\\mathrm{AVG}^1)$ and cross-dataset $(\\mathrm{AVG}^2)$ evaluations. Average performance improvements are indicated in green, and deterioration in red. (b) Per-dataset accuracy comparison between our unsupervised and class agnostic method $(\\mathrm{CoOp + CA - KDPL})$ , the supervised baseline CoOp, and the zero-shot student on the cross-dataset benchmark datasets." + ], + "image_footnote": [], + "bbox": [ + 496, + 142, + 764, + 306 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "(b) Per-dataset class agnostic adaptation", + "bbox": [ + 495, + 320, + 771, + 335 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 486, + 359, + 502 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper we proposed an approach to Knowledge Distillation Prompt Learning (KDPL) which is easily integrated into existing supervised prompt learning methods. Our experiments show that for CoOp, CoCoOp, VPT, MaPLe and PromptSRC adding KDPL: (1) renders them label agnostic by eliminating the need for ground-truth labels for few-shot adaptation; (2) can also render them class agnostic in cases where no knowledge of training class labels is available; and (3) remarkably improves generalization to downstream tasks.", + "bbox": [ + 212, + 518, + 787, + 625 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The additional computation cost incurred by distilling from a large VLM is a limitation of KDPL, though all encoder parameters are fixed and the predictions of the teacher can be precomputed, which helps mitigate the extra cost. This extra computation only amounts to about a $15\\%$ increase for MaPLe.", + "bbox": [ + 212, + 625, + 787, + 684 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Note that we did not tune any hyperparameters when training the KDPL variants. We use the same settings as in the original papers, which are likely suboptimal for distillation-based adaptation. With careful tuning, there is potential for improvement. Our experiments indicate that distillation-learned prompts are more transferable, and we think it would be interesting to see if this idea can generalize to very different downstream tasks and scale to even bigger teacher models or - more interestingly - to even smaller student models.", + "bbox": [ + 212, + 685, + 787, + 790 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 397, + 126 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was supported by funding from the European Commission Horizon 2020 grant #951911 (AI4Media).", + "bbox": [ + 215, + 172, + 784, + 204 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 224, + 321, + 239 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Abdul Samadh, J., Gani, M.H., Hussein, N., Khattak, M.U., Naseer, M.M., Shahbaz Khan, F., Khan, S.H.: Align your prompts: Test-time prompting with distribution alignment for zero-shot generalization. Advances in Neural Information Processing Systems 36 (2024)", + "2. Agnolucci, L., Baldrati, A., Todino, F., Becattini, F., Bertini, M., Del Bimbo, A.: Eco: Ensembling context optimization for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2811-2815 (2023)", + "3. Baldrati, A., Agnolucci, L., Bertini, M., Del Bimbo, A.: Zero-shot composed image retrieval with textual inversion. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15338-15347 (October 2023)", + "4. Barraco, M., Cornia, M., Cascianelli, S., Baraldi, L., Cucchiara, R.: The unreason-able effectiveness of clip features for image captioning: an experimental analysis. In: proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4662-4670 (2022)", + "5. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10925-10934 (2022)", + "6. Bossard, L., Guillaume, M., Van Gool, L.: Food-101-mining discriminative components with random forests. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part VI 13. pp. 446-461. Springer (2014)", + "7. Bulat, A., Tzimiropoulos, G.: Lasp: Text-to-text optimization for language-aware soft prompting of vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23232-23241 (2023)", + "8. Chen, G., Yao, W., Song, X., Li, X., Rao, Y., Zhang, K.: Plot: Prompt learning with optimal transport for vision-language models. In: The Eleventh International Conference on Learning Representations (2022)", + "9. Chen, W.C., Chang, C.C., Lee, C.R.: Knowledge distillation with feature maps for image classification. In: Computer Vision-ACCV 2018: 14th Asian Conference on Computer Vision, Perth, Australia, December 2-6, 2018, Revised Selected Papers, Part III 14. pp. 200-215. Springer (2019)", + "10. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023)", + "11. Cimpoi, M., Maji, S., Kokkinos, I., Mohamed, S., Vedaldi, A.: Describing textures in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3606-3613 (2014)", + "12. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + ], + "bbox": [ + 218, + 251, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "13. Desai, K., Johnson, J.: Virtex: Learning visual representations from textual annotations. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11162-11173 (2021)", + "14. Ding, Y., Liu, L., Tian, C., Yang, J., Ding, H.: Don't stop learning: Towards continual learning for the clip model. arXiv preprint arXiv:2207.09248 (2022)", + "15. Dong, X., Bao, J., Zhang, T., Chen, D., Gu, S., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N.: Clip itself is a strong fine-tuner: Achieving 85.7% and 88.0% top-1 accuracy with vit-b and vit-l on imagenet. arXiv preprint arXiv:2212.06138 (2022)", + "16. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020)", + "17. Dou, Q., Liu, Q., Heng, P.A., Glocker, B.: Unpaired multi-modal segmentation via knowledge distillation. IEEE transactions on medical imaging 39(7), 2415-2425 (2020)", + "18. Fang, A., Jose, A.M., Jain, A., Schmidt, L., Toshev, A.T., Shankar, V.: Data filtering networks. In: The Twelfth International Conference on Learning Representations (2023)", + "19. Fang, Z., Wang, J., Wang, L., Zhang, L., Yang, Y., Liu, Z.: Seed: Self-supervised distillation for visual representation. In: International Conference on Learning Representations (2020)", + "20. Fei-Fei, L., Fergus, R., Perona, P.: Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories. In: 2004 conference on computer vision and pattern recognition workshop. pp. 178-178. IEEE (2004)", + "21. Gu, X., Lin, T.Y., Kuo, W., Cui, Y.: Open-vocabulary object detection via vision and language knowledge distillation. In: International Conference on Learning Representations (2021)", + "22. He, T., Shen, C., Tian, Z., Gong, D., Sun, C., Yan, Y.: Knowledge adaptation for efficient semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 578-587 (2019)", + "23. Helber, P., Bischke, B., Dengel, A., Borth, D.: Eurosat: A novel dataset and deep learning benchmark for land use and land cover classification. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 12(7), 2217-2226 (2019)", + "24. Hendrycks, D., Basart, S., Mu, N., Kadavath, S., Wang, F., Dorundo, E., Desai, R., Zhu, T., Parajuli, S., Guo, M., et al.: The many faces of robustness: A critical analysis of out-of-distribution generalization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8340-8349 (2021)", + "25. Hendrycks, D., Zhao, K., Basart, S., Steinhardt, J., Song, D.: Natural adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15262-15271 (2021)", + "26. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. stat 1050, 9 (2015)", + "27. Huang, T., Chu, J., Wei, F.: Unsupervised prompt learning for vision-language models. arXiv preprint arXiv:2204.03649 (2022)", + "28. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021)" + ], + "bbox": [ + 215, + 147, + 784, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 395, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "29. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: European Conference on Computer Vision (2022)", + "30. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023)", + "31. Khattak, M.U., Wasim, S.T., Naseer, M., Khan, S., Yang, M.H., Khan, F.S.: Self-regulating prompts: Foundational model adaptation without forgetting. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15190-15200 (2023)", + "32. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013)", + "33. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision (IJCV) 128(7), 1956-1981 (2020)", + "34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. pp. 3045-3059 (2021)", + "35. Li, X.L., Liang, P.: Prefix-tuning: Optimizing continuous prompts for generation. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 4582-4597 (2021)", + "36. Li, Z., Li, X., Fu, X., Zhang, X., Wang, W., Chen, S., Yang, J.: Promptkd: Unsupervised prompt distillation for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 26617-26626 (2024)", + "37. Lu, Y., Liu, J., Zhang, Y., Liu, Y., Tian, X.: Prompt distribution learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5206-5215 (2022)", + "38. Lüddecke, T., Ecker, A.: Image segmentation using text and image prompts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7086-7096 (2022)", + "39. Maji, S., Rahtu, E., Kannala, J., Blaschko, M., Vedaldi, A.: Fine-grained visual classification of aircraft. arXiv preprint arXiv:1306.5151 (2013)", + "40. Mullapudi, R.T., Chen, S., Zhang, K., Ramanan, D., Fatahalian, K.: Online model distillation for efficient video inference. In: Proceedings of the IEEE/CVF International conference on computer vision. pp. 3573-3582 (2019)", + "41. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: 2008 Sixth Indian conference on computer vision, graphics & image processing. pp. 722-729. IEEE (2008)", + "42. Parelli, M., Delitzas, A., Hars, N., Vlassis, G., Anagnostidis, S., Bachmann, G., Hofmann, T.: Clip-guided vision-language pre-training for question answering in 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5606-5611 (2023)", + "43. Parkhi, O.M., Vedaldi, A., Zisserman, A., Jawahar, C.: Cats and dogs. In: 2012 IEEE conference on computer vision and pattern recognition. pp. 3498-3505. IEEE (2012)", + "44. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from" + ], + "bbox": [ + 215, + 146, + 784, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)", + "45. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: DoImagenet classifiers generalize toImagenet? In: International conference on machine learning. pp. 5389-5400. PMLR (2019)", + "46. Ren, S., Zhang, A., Zhu, Y., Zhang, S., Zheng, S., Li, M., Smola, A.J., Sun, X.: Prompt pre-training with twenty-thousand classes for open-vocabulary visual recognition. Advances in Neural Information Processing Systems 36 (2024)", + "47. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortzman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278–25294 (2022)", + "48. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)", + "49. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023)", + "50. Shi, Z., Lipani, A.: DePT: Decomposed prompt tuning for parameter-efficient fin-tuning. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=KjegfPGRde", + "51. Siam, M., Jiang, C., Lu, S., Petrich, L., Gamal, M., Elhoseiny, M., Jagersand, M.: Video object segmentation using teacher-student adaptation in a human robot interaction (hri) setting. In: 2019 International Conference on Robotics and Automation (ICRA). pp. 50-56. IEEE (2019)", + "52. Song, H., Dong, L., Zhang, W., Liu, T., Wei, F.: Clip models are few-shot learners: Empirical studies on vqa and visual entailment. In: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). pp. 6088-6100 (2022)", + "53. Soomro, K., Zamir, A.R., Shah, M.: Ucf101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012)", + "54. Wang, H., Ge, S., Lipton, Z., Xing, E.P.: Learning robust global representations by penalizing local predictive power. Advances in Neural Information Processing Systems 32 (2019)", + "55. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023)", + "56. Xu, G., Liu, Z., Li, X., Loy, C.C.: Knowledge distillation meets self-supervision. In: European Conference on Computer Vision. pp. 588-604. Springer (2020)", + "57. Yao, H., Zhang, R., Xu, C.: Visual-language prompt tuning with knowledge-guided context optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6757-6767 (2023)", + "58. Yuan, L., Tay, F.E., Li, G., Wang, T., Feng, J.: Revisiting knowledge distillation via label smoothing regularization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3903-3911 (2020)", + "59. Yun, S., Park, J., Lee, K., Shin, J.: Regularizing class-wise predictions via self-knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13876-13885 (2020)", + "60. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proceedings of the" + ], + "bbox": [ + 217, + 147, + 785, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "M. Mistretta et al.", + "bbox": [ + 271, + 114, + 395, + 126 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18123-18133 (2022)", + "61. Zhang, R., Fang, R., Zhang, W., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free clip-adapter for better vision-language modeling. arXiv preprint arXiv:2111.03930 (2021)", + "62. Zhang, Y., Xiang, T., Hospedales, T.M., Lu, H.: Deep mutual learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4320-4328 (2018)", + "63. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 11953-11962 (2022)", + "64. Zhong, Z., Friedman, D., Chen, D.: Factual probing is [mask]: Learning vs. learning to recall. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5017-5033 (2021)", + "65. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022)", + "66. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022)", + "67. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022)", + "68. Zhu, B., Niu, Y., Han, Y., Wu, Y., Zhang, H.: Prompt-aligned gradient for prompt tuning. In: 2023 IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15613-15623. IEEE Computer Society (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 494 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Improving Learned Prompts via Unsupervised Knowledge Distillation", + "bbox": [ + 267, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_model.json b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_model.json new file mode 100644 index 0000000000000000000000000000000000000000..598fcef5b5dbc89a89d455dadd4e3ba70ed672f9 --- /dev/null +++ b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_model.json @@ -0,0 +1,2559 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.218, + 0.141, + 0.787, + 0.187 + ], + "angle": 0, + "content": "Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "text", + "bbox": [ + 0.333, + 0.213, + 0.671, + 0.245 + ], + "angle": 0, + "content": "*Marco Mistretta1, *Alberto Baldrati1,2, Marco Bertini1, and Andrew D. Bagdanov1" + }, + { + "type": "text", + "bbox": [ + 0.23, + 0.255, + 0.773, + 0.269 + ], + "angle": 0, + "content": "1 University of Florence - Media Integration and Communication Center (MICC)" + }, + { + "type": "text", + "bbox": [ + 0.435, + 0.27, + 0.571, + 0.283 + ], + "angle": 0, + "content": "2 University of Pisa" + }, + { + "type": "text", + "bbox": [ + 0.411, + 0.285, + 0.593, + 0.298 + ], + "angle": 0, + "content": "Florence, Italy - Pisa, Italy" + }, + { + "type": "text", + "bbox": [ + 0.413, + 0.299, + 0.591, + 0.311 + ], + "angle": 0, + "content": "{name.surname}@unifi.it" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.354, + 0.744, + 0.604 + ], + "angle": 0, + "content": "Abstract. Vision-Language Models (VLMs) demonstrate remarkable zero-shot generalization to unseen tasks, but fall short of the performance of supervised methods in generalizing to downstream tasks with limited data. Prompt learning is emerging as a parameter-efficient method for adapting VLMs, but state-of-the-art approaches require annotated samples. In this paper we propose a novel approach to prompt learning based on unsupervised knowledge distillation from more powerful models. Our approach, which we call Knowledge Distillation Prompt Learning (KDPL), can be integrated into existing prompt learning techniques and eliminates the need for labeled examples during adaptation. Our experiments on more than ten standard benchmark datasets demonstrate that KDPL is very effective at improving generalization of learned prompts for zero-shot domain generalization, zero-shot cross-dataset generalization, and zero-shot base-to-novel class generalization problems. KDPL requires no ground-truth labels for adaptation, and moreover we show that even in the absence of any knowledge of training class names (CA-KDPL) can be used to effectively transfer knowledge. The code is publicly available at https://github.com/miccunifi/KDPL." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.617, + 0.741, + 0.645 + ], + "angle": 0, + "content": "Keywords: Prompt Learning \\(\\cdot\\) Unsupervised Knowledge Distillation \\(\\cdot\\) Vision-Language Models \\(\\cdot\\) Few-Shot Learning \\(\\cdot\\) Zero-shot Transfer." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.673, + 0.377, + 0.691 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.708, + 0.788, + 0.814 + ], + "angle": 0, + "content": "Vision-Language Models (VLMs) like Contrastive Language-Image Pre-training (CLIP) are remarkably effective at zero-shot generalization to downstream tasks [3,42,44,65]. These models leverage a dual encoder architecture and are trained to align image and text features in a shared embedding space. CLIP and similar models are able to perform zero-shot classification by predicting the output class based on the similarity between the test image embedding and text embeddings of words from a fixed vocabulary." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.551, + 0.84 + ], + "angle": 0, + "content": "* These authors contributed equally to this work." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.398, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.526, + 0.34 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.534, + 0.144, + 0.788, + 0.334 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.35, + 0.788, + 0.462 + ], + "angle": 0, + "content": "Fig. 1: Motivation and overview. (Top left) Lightweight VLMs like CLIP achieve impressive zero-shot performance but lag behind supervised approaches; large VLMs incur a high computational burden. (Bottom left) Parameter-efficient prompt learning offers a non-destructive approach to adapting VLMs to downstream tasks; however, existing methods require annotated samples and struggle to generalize to unseen classes. (Right) Our approach does not require labeled samples and learns by distilling knowledge from a more powerful VLM. It can be seamlessly integrated into existing prompt learning techniques and generalizes better to unseen classes on downstream tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.788, + 0.568 + ], + "angle": 0, + "content": "While CLIP exhibits remarkable zero-shot performance, it can fall short of supervised adaptation. Narrowing this gap through fine-tuning is challenging when large training datasets are not available for downstream tasks. Moreover, fine-tuning can also lead to overfitting and is destructive in that it can cause the model to forget knowledge acquired during large-scale pre-training [14,67]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.569, + 0.788, + 0.674 + ], + "angle": 0, + "content": "An intuitive way to achieve better performance is to use larger and more powerful VLMs [10] with better zero-shot generalization. However, though performance improves with increasing size, their practical applicability in real-world scenarios decreases. Lightweight CLIP models based on ResNet-50 and ViT-B/32 require about 18 and 14 GFLOPs for inference, respectively. In contrast, more powerful models based on ViT-H/14 [10,18] require nearly \\(30 \\times\\) the computation at 381 GFLOPs [18] for inference." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.788, + 0.842 + ], + "angle": 0, + "content": "To address these challenges, parameter-efficient prompt learning is emerging as a promising and non-destructive approach to adapting VLMs to downstream tasks [34,35,64]. Zhou et al. [67] proposed a text-only prompt learning approach called CoOp to overcome the limitations of manually crafted prompts. Subsequently, Jia et al. [29] extended prompt learning to the visual domain with Visual Prompt Tuning (VPT), and Khattak et al. [30,31] proposed a multi-modal prompt learning approach called MaPLe [30] and a self-regulated approach called PromptSRC [31]. Although significantly improving over carefully tuned, handcrafted prompts, these state-of-the-art techniques all require annotated samples from the dataset and have problems generalizing to other datasets or classes unseen during training [30,66]." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.327 + ], + "angle": 0, + "content": "To eliminate the need for labeled training examples and improve the generalization of learned prompts, we propose a novel approach to prompt learning which we call Knowledge Distillation Prompt Learning (KDPL). KDPL adapts lightweight VLMs and improves performance on downstream tasks by distilling knowledge from a more powerful VLM without the need for annotated examples. KDPL is a flexible method that can be seamlessly integrated into existing prompt learning framework such as CoOp [67], CoCoOp [66], VPT [29], MaPLe [30], and PromptSRC [31]. Figure 1 summarizes the motivations and illustrates the workflow of the proposed approach. We validate KDPL on two increasingly challenging scenarios: in the first, we assume knowledge of training class names, while in the second we assume no knowledge of training classes. Importantly, in both scenarios no annotated training samples are used." + }, + { + "type": "text", + "bbox": [ + 0.241, + 0.329, + 0.493, + 0.342 + ], + "angle": 0, + "content": "The contributions of this work are:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.352, + 0.784, + 0.395 + ], + "angle": 0, + "content": "- we propose a novel parameter-efficient prompt-learning approach that eliminates the need for labeled training examples by distilling knowledge from a large Vision-Language Model;" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.398, + 0.785, + 0.454 + ], + "angle": 0, + "content": "- we show that our approach can be integrated into existing prompt learning techniques to learn visual, textual, and multimodal prompts which generalize significantly better than state-of-the-art baselines to unseen classes in downstream tasks:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.457, + 0.79, + 0.514 + ], + "angle": 0, + "content": "- we demonstrate the effectiveness of our approach through extensive experiments on more than ten standard benchmark datasets covering a broad range of downstream problems, including domain generalization, cross-dataset adaptation, and base-to-novel generalization; and" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.518, + 0.784, + 0.545 + ], + "angle": 0, + "content": "- we introduce a new, class agnostic evaluation setting in which training class names are unknown and show the superiority of our approach in this scenario." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.352, + 0.79, + 0.545 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.557, + 0.788, + 0.618 + ], + "angle": 0, + "content": "To the best of our knowledge ours is the first approach to parameter-efficient VLM adaptation which is applicable in scenarios that are label agnostic (i.e. no label supervision is required during adaptation) and also in scenarios that are additionally class agnostic (i.e. no knowledge of training class names is assumed)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.639, + 0.388, + 0.654 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.67, + 0.784, + 0.684 + ], + "angle": 0, + "content": "In this section we review the recent literature most relevant to our contribution." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Vision-Language Models. Vision-Language Models (VLMs) learn robust visual representations thanks to their extensive pre-training on image-caption datasets [47, 48]. These representations are very effective at generalizing to a variety of downstream tasks [13, 28, 44]. In contrast to vision models trained only with image supervision, vision-language models can interpret both visual and textual data, showing improvement in tasks requiring cross-model understanding [3, 4, 52]. We focus on contrastively-trained VLMs such as CLIP [44], ALIGN [28], and LiT [60]. These models use a dual encoder architecture and contrastive learning to align images and text in a common embedding space. Thanks to this shared embedding space and massive pre-training datasets these" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.397, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.208 + ], + "angle": 0, + "content": "models achieve remarkable performance. However, there is still a gap between the zero-shot capabilities of these VLMs and the performance of tailored state-of-the-art models [15,44], and thus there is active research on efficient and effective methods to adapt VLMs to downstream tasks [21,38,55,61]." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.217, + 0.785, + 0.308 + ], + "angle": 0, + "content": "Prompt Learning. The performance of VLMs is highly dependent on textual prompts used to characterize downstream tasks. Given the significant impact of small changes in wording on performance, the manual generation of optimal textual prompts is a challenging task. Inspired by developments in NLP [34,35, 64], CoOp [67] proposes to learn continuous vectors in the word embedding space instead of using tailored hand-crafted prompts." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.313, + 0.787, + 0.494 + ], + "angle": 0, + "content": "The promising results of CoOp have attracted considerable interest in prompt learning for VLMs [1, 2, 7, 8, 30, 31, 37, 49, 50, 57, 68]. CoCoOp, in particular, highlights the poor performance of CoOp on unseen classes and uses image-conditional dynamic prompts to improve generalization [66]. PLOT [8] instead is based on learning multiple prompts by exploiting local visual features. Kg-CoOp [57] adds a regularization loss to minimize the discrepancy between learned and hand-crafted prompts, while VPT [29] adapts prompt learning to the visual domain by learning continuous vectors in the input space of a ViT [16]. Finally, MaPLe [30] introduces a multimodal prompt learning strategy for VLMs. PromptSRC [31] introduces a self-regularization framework for prompting, addressing overfitting through agreement with a frozen model, a self-ensemble of prompts, and textual diversity." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.499, + 0.785, + 0.634 + ], + "angle": 0, + "content": "Similar to the approach we propose in this paper, UPL [27] performs prompt learning without relying on annotated samples. It leverages pseudolabels derived from a larger CLIP model and selects the top-K most confident samples per class to construct a balanced set of pseudo-labels. UPL requires a substantial collection of unlabeled images and is not directly applicable when only a few unlabeled samples are available, like in the few-shot adaptation scenarios considered here. In contrast to UPL, KDPL does not use pseudolabeling; instead, we directly learn from the logits of a CLIP teacher model via knowledge distillation, thus eliminating the need for any selection strategy of the training samples." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.644, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Knowledge Distillation. Knowledge distillation (KD) is a machine learning technique in which a simple model (student) is trained to mimic the behavior of a larger model (teacher) by learning from its output or intermediate activation [26]. This technique has found success in many contexts, including image classification [5,9,26], self-supervised learning [19,56], and image/video segmentation [17, 22, 40, 51], leading to improvements in model compression, computational efficiency, and performance. DML [62] introduces a mutual learning approach to train students and teachers simultaneously. DKD [63] reformulates the classical KD loss into a term related to the target class and a term related to the non-target classes. In contrast to the majority of knowledge distillation approaches [58, 59, 62, 63], we do not utilize any labels during training. Instead, we solely employ the distillation loss. In our work, we apply knowledge distillation in a parameter-efficient prompt learning scenario. Specifically, we distill" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "knowledge from a large and powerful VLM (teacher) into a lightweight VLM (student) by updating only a reduced number of parameters (the prompt)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.182, + 0.788, + 0.364 + ], + "angle": 0, + "content": "Techniques Using Teacher-Student Distillation. Recently Li et al. [36] introduced PromptKD which also uses teacher-student distillation in prompt learning. Although it too leverages a larger teacher to guide a smaller student, it differs from our contribution in several key aspects. PromptKD uses PromptSRC [31] to pre-train the teacher model with labeled examples, whereas KDPL does not pre-train the teacher and requires no labeled examples. PromptKD uses an MLP to project the student image encoder output, which adds extra parameters. KDPL is instead a general framework with no additional parameters, adaptable to any prompt-tuning technique to render them completely unsupervised. Moreover, PromptKD uses the entire training set, including both base and novel images, for distillation. In contrast, KDPL follows the standard 16-shot setting." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.388, + 0.733, + 0.407 + ], + "angle": 0, + "content": "3 Knowledge Distillation Prompt Learning (KDPL)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.422, + 0.784, + 0.453 + ], + "angle": 0, + "content": "We first introduce preliminary concepts related to prompt learning and then describe our approach to applying knowledge distillation to the problem." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.476, + 0.373, + 0.49 + ], + "angle": 0, + "content": "3.1 Preliminaries" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.503, + 0.785, + 0.548 + ], + "angle": 0, + "content": "Our approach is based on knowledge distillation applied to prompt learning. Here we discuss the base teacher and student models (CLIPs) and five state-of-the-art prompt learning approaches into which we will incorporate KDPL." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.552, + 0.788, + 0.688 + ], + "angle": 0, + "content": "CLIP. Contrastive Language-Image Pre-training (CLIP) is a vision-language model trained to align images and textual captions in shared semantic space [44]. CLIP consists of an image encoder \\( f_{\\theta} \\) and a text encoder \\( g_{\\phi} \\). Given an image \\( I \\), the image encoder computes its feature representation \\( f_{\\theta}(I) \\in \\mathbb{R}^d \\), where \\( d \\) is the size of the semantic embedding space. Similarly, for a given textual caption \\( Y \\), a word embedding layer \\( E_L \\) maps each tokenized word to the token embedding space \\( \\mathcal{W} \\). Then, the text encoder \\( g_{\\phi} \\) generates the textual feature representation \\( g_{\\phi}(E_L(Y)) \\in \\mathbb{R}^d \\). The main goal of CLIP training is to learn \\( \\theta \\) and \\( \\phi \\) such that \\( f_{\\theta}(I) \\approx g_{\\phi}(E_L(Y)) \\) for associated image/text pairs \\( (I,Y) \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.809 + ], + "angle": 0, + "content": "When using a Vision Transformer (ViT) [16] as the visual encoder \\( f_{\\theta} \\), the encoding process begins by splitting the image into \\( U \\) fixed-size patches. These patches are then projected into patch embeddings \\( \\{w_1, w_2, \\ldots, w_U\\} \\), where each \\( w_i \\) belongs to the patch embedding space \\( \\mathcal{V} \\). A learnable class (CLS) token \\( c_i \\) is concatenated with the patch embeddings, resulting in the input to the vision transformer being \\( \\{c_i, w_1, w_2, \\ldots, w_U\\} \\). Finally, the CLS token of the final transformer layer is projected to the shared embedding space via a linear projection to obtain the final representation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "To perform zero-shot classification using CLIP, we start with an image \\(I\\) and build a set of textual prompts \\(\\{Y_{i}\\}_{i = 1}^{C}\\), where \\(C\\) denotes the number of classes." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.398, + 0.128 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "Each handcrafted text prompt \\( Y_{i} \\) takes the format \"a photo of a \\( [CLASS_{i}] \\)\", where \\( CLASS_{i} \\) represents a specific class name, such as airplane, bird, etc." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.784, + 0.208 + ], + "angle": 0, + "content": "Then the feature representations \\(\\psi_I = f_\\theta(I)\\) and \\(\\psi_T^i = g_\\phi(E_L(Y_i))\\) are extracted using the CLIP encoders. The predicted probability for each class is:" + }, + { + "type": "equation", + "bbox": [ + 0.361, + 0.22, + 0.785, + 0.256 + ], + "angle": 0, + "content": "\\[\np (y = i \\mid I) = \\frac {\\exp \\left(\\cos \\left(\\psi_ {T} ^ {i} , \\psi_ {I}\\right) / \\tau\\right)}{\\sum_ {j = 1} ^ {C} \\exp \\left(\\cos \\left(\\psi_ {T} ^ {j} , \\psi_ {I}\\right) / \\tau\\right)}, \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.26, + 0.774, + 0.275 + ], + "angle": 0, + "content": "where \\(\\cos (\\cdot ,\\cdot)\\) is the cosine similarity and \\(\\tau\\) is a temperature hyperparameter." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.279, + 0.784, + 0.31 + ], + "angle": 0, + "content": "Prompt-Learning Techniques. Here we summarize how the state-of-the-art techniques for textual, visual, and multimodal prompt learning work." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.314, + 0.785, + 0.389 + ], + "angle": 0, + "content": "- CoOp [67] is a textual prompt learning technique that learns continuous context tokens (i.e. the learnable prompt) in the CLIP token embedding space. Specifically, CoOp introduces \\( M \\) learnable vectors, \\( \\{v_{1}, v_{2}, \\ldots, v_{M}\\} \\) where each context vector \\( v_{i} \\in \\mathcal{W} \\). For each of the \\( k \\) classes of a dataset, the input to the text encoder is \\( \\{v_{1}, v_{2}, \\ldots, v_{M}, c_{k}\\} \\), where \\( c_{k} = E_{L}([CLSAS_{k}]) \\)." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.39, + 0.785, + 0.433 + ], + "angle": 0, + "content": "- CoCoOp [66] extends CoOp by incorporating a lightweight network \\( h_\\theta \\). Each context token is obtained as \\( v_i(I) = v_i + \\pi \\), where \\( \\pi = h_\\theta(I) \\). This method ensures that the textual prompts are conditioned on the input image." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.434, + 0.785, + 0.553 + ], + "angle": 0, + "content": "- VPT [29] is a visual prompt learning method that can be viewed as the counterpart of CoOp in the visual domain. Unlike CoOp, which operates entirely in the textual token embedding space \\(\\mathcal{W}\\), VPT performs prompt learning in the visual patch embedding space \\(\\mathcal{V}\\). Specifically, VPT learns \\(P\\) visual tokens, leading to the input to the ViT being \\(\\{z_{1},\\ldots ,z_{P},c_{i},w_{1},w_{2},\\ldots ,w_{U}\\}\\). VPT offers two prompting variants: deep and shallow. The deep variant learns a distinct prompt for each ViT layer, while the shallow variant incorporates the prompt parameters only into the input of the first layer." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.554, + 0.785, + 0.627 + ], + "angle": 0, + "content": "- MaPLe [30] is a deep multi-modal prompt learning technique that promotes strong coupling between vision and language prompts. In practice, MaPLe learns different textual context tokens for each layer in \\( g_{\\phi} \\). The visual prompts, on the other hand, are not directly learned but are obtained through a linear mapping from the textual ones." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.628, + 0.798, + 0.702 + ], + "angle": 0, + "content": "- PromptSRC [31] is another multi-modal prompt learning technique that optimizes prompts through mutual agreement maximization between prompted and frozen model features using self-distillation, Gaussian-weighted prompt aggregation over the training session, and promoting textual diversity to address sample diversity imbalance." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.314, + 0.798, + 0.702 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.709, + 0.784, + 0.755 + ], + "angle": 0, + "content": "Note that methods involving visual prompt learnable tokens like VPT [29], MaPLe [30], and PromptSRC [31] can only be applied to VLMs equipped with a ViT-based image encoder." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.773, + 0.535, + 0.789 + ], + "angle": 0, + "content": "3.2 Label Agnostic Prompt Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.784, + 0.84 + ], + "angle": 0, + "content": "The methods described above all rely on ground-truth labels during adaptation. Here we show how unsupervised knowledge distillation can be used instead to replace the need for annotated training examples." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.144, + 0.777, + 0.273 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.281, + 0.788, + 0.364 + ], + "angle": 0, + "content": "Fig. 2: Knowledge Distillation Prompt Learning (KDPL) overview. Given a lightweight VLM student and a larger, more powerful VLM teacher, KDPL updates the student prompt parameters by distilling knowledge from the teacher. KDPL first performs zero-shot classification with the teacher to obtain teacher probabilities \\( p_T \\). It then computes the student probabilities \\( p_S \\) and performs knowledge distillation to update the student prompt parameters \\( \\gamma \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.394, + 0.789, + 0.528 + ], + "angle": 0, + "content": "Overview. Our proposed approach, which we call Knowledge Distillation Prompt Learning (KDPL), is a general method designed to enhance the performance of the CLIP model on downstream tasks through parameter-efficient prompt learning. Unlike previous approaches [30,66,67], which rely on labeled examples for training, KDPL eliminates the need for manually-labeled samples by learning only through knowledge distillation from a larger and more powerful VLM. Note that KDPL is a method that can be seamlessly integrated with any existing prompt learning approach in scenarios where no information about class names or labels is available." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.53, + 0.788, + 0.637 + ], + "angle": 0, + "content": "We validate KDPL in two progressively challenging supervision regimes. In the label agnostic scenario we do not use ground-truth labels, but we assume knowledge of the class names in the training dataset. In the class agnostic scenario (see Section 3.3) we go one step further and assume that even the training class names are unknown. For this class agnostic scenario we propose an effective and efficient online strategy for automatically filtering the classes from a large dictionary of approximately 20K class names [33]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.641, + 0.788, + 0.793 + ], + "angle": 0, + "content": "Prompt Learning via Unsupervised Knowledge Distillation (KDPL). Given a lightweight CLIP model (the student) and a larger, more powerful CLIP model (the teacher), we aim to improve the downstream performance of the student model by distilling knowledge from teacher to student. For an image \\( I \\) and a set of classes \\( \\mathcal{C} = \\{\\mathrm{CLASS}_i\\}_{i=1}^C \\), we start by performing zero-shot classification using the frozen teacher model. Specifically, we use the teacher image encoder \\( f_{\\theta}^{B} \\) and text encoder \\( g_{\\phi}^{B} \\) to compute the teacher image features \\( \\psi_{I,B} = f_{\\theta}^{B}(I) \\) and text features \\( \\psi_{T,B}^{i} = g_{\\phi}^{S}(E_L([\\mathrm{CLASS}_i])) \\). For the teacher model we use the fixed text prompt \"a photo of [CLASS]\". We then apply Eq. (1) to produce the probabilities \\( p_T(I,\\mathcal{C}) \\) predicted by the teacher on image \\( I \\) for classes \\( \\mathcal{C} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.794, + 0.788, + 0.839 + ], + "angle": 0, + "content": "The teacher model does not rely on a learnable prompt and its predictions remain fixed during training. Our aim is to learn text and image prompts for the student model that enhance its generalization to downstream tasks." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.397, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.3 + ], + "angle": 0, + "content": "We denote with \\( f_{\\theta}^{S} \\) and \\( g_{\\phi}^{S} \\) the student image and text encoders, respectively, and with \\( \\gamma \\) the parameters associated with the learnable student prompts (see Fig. 2). Given the same image \\( I \\) processed by the teacher and the same set of classes \\( \\mathcal{C} \\), the student extracts image features \\( \\psi_{I,S} = f_{\\theta,\\gamma}^{S}(I) \\) and text features \\( \\psi_{T,S}^{i} = g_{\\phi,\\gamma}^{S}(E_{L}([\\mathrm{CLASS}_{i}])) \\). Note that the text and image encoders can both depend on the prompt parameters \\( \\gamma \\). According to the prompt learning technique used, the \\( \\gamma \\) parameters can be used only by the text encoder (CoOp, CoCoOp), the visual encoder (VPT), or both (MaPLe, PromptSRC). Finally, using Eq. (1) we produce student class probabilities \\( p_{S}(I,\\mathcal{C}) \\) predicted on image \\( I \\) for classes \\( \\mathcal{C} \\). Note that all encoder parameters except for the learnable prompt \\( \\gamma \\) are frozen." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.301, + 0.788, + 0.334 + ], + "angle": 0, + "content": "We use the symmetric KL-divergence between the teacher \\((p_T(I,\\mathcal{C}))\\) and the student \\((p_S(I,\\mathcal{C}))\\) probabilities in a distillation loss:" + }, + { + "type": "equation", + "bbox": [ + 0.277, + 0.345, + 0.786, + 0.363 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} (\\mathcal {I}, \\mathcal {C}) = \\left[ D _ {\\mathrm {K L}} \\left(p _ {T} (I, \\mathcal {C}) \\mid \\mid p _ {S} (I, \\mathcal {C})\\right) + D _ {\\mathrm {K L}} \\left(p _ {S} (I, \\mathcal {C}) \\mid \\mid p _ {T} (I, \\mathcal {C})\\right) \\right], \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.374, + 0.787, + 0.406 + ], + "angle": 0, + "content": "where \\( D(q\\parallel p) \\) is the asymmetric KL-divergence between the discrete probability distributions \\( p \\) and \\( q \\):" + }, + { + "type": "equation", + "bbox": [ + 0.4, + 0.418, + 0.786, + 0.455 + ], + "angle": 0, + "content": "\\[\nD _ {\\mathrm {K L}} (p \\mid | q) = \\sum_ {i \\in \\mathcal {C}} p _ {i} \\log \\left(\\frac {p _ {i}}{q _ {i}}\\right) \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.466, + 0.787, + 0.497 + ], + "angle": 0, + "content": "This distillation loss depends only on the fixed predictions of the teacher, the prompt-conditioned predictions of the students, and the set of classes \\(\\mathcal{C}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.498, + 0.788, + 0.589 + ], + "angle": 0, + "content": "Importantly, our distillation loss does not assume any knowledge of class labels for image \\( I \\). Nor does it require that \\( \\mathcal{C} \\) be the classes of the downstream task – that is, KDPL can be used for Label Agnostic and Class Agnostic adaptation scenarios. We found in early experiments that the symmetric KL-divergence works slightly better than either asymmetric option (see Section B.3 in the Supplementary Material for an ablation study on this choice)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.614, + 0.533, + 0.631 + ], + "angle": 0, + "content": "3.3 Class Agnostic Prompt Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.643, + 0.788, + 0.719 + ], + "angle": 0, + "content": "To further evaluate the generalization capabilities of KDPL, we introduce a scenario where not only do we not know the labels of training images (label agnostic, Section 3.2) but where we also do not even know the class names associated with the dataset (class agnostic). This scenario is considerably more challenging as we make no assumptions about the few-shot training data." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.72, + 0.788, + 0.842 + ], + "angle": 0, + "content": "To address the unavailability of class names, we propose a strategy for automatically selecting a set of class names for each batch. We start with a large vocabulary of class names from which to select. Specifically, we use the Open Images V7 dataset [33], which contains \\(\\sim 20\\mathrm{K}\\) classes. The most straightforward method would simply use all 20K classes during training. However, this is impractical as the memory required by prompt learning methods increases linearly with the number of classes. According to Ren et al. [46], CoOp requires nearly 15MB of VRAM per class, resulting in approximately 300GB of memory when" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.193 + ], + "angle": 0, + "content": "multiplied by 20K classes. Therefore, we propose a method to automatically select which classes to use for each batch by retaining only the ones most relevant to the calculation of the loss in Eq. (2)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.193, + 0.785, + 0.36 + ], + "angle": 0, + "content": "Given a batch of images \\( X = \\{I_i\\}_{i=1}^N \\) and all the class names in the vocabulary \\( \\mathcal{C} = \\{\\mathrm{CLASS}_i\\}_{i=1}^C \\), where \\( N \\) represents the number of images in a batch and \\( C \\) the size of the dictionary, we let the teacher model select the most relevant classes. Our objective is to identify the most useful \\( K \\) classes in each batch for student prompt learning. After extracting the teacher image and text features, for each image \\( I_i \\in X \\), we apply Eq. (1) to obtain the teacher probabilities \\( p_T(I_i, \\mathcal{C}) \\). By stacking the probabilities along the batch dimension, we obtain the matrix \\( P_T = [p_T(I_1, \\mathcal{C}); \\dots; p_T(I_N, \\mathcal{C})]^T \\in \\mathbb{R}^{N \\times C} \\), where the \\( i \\)-th row corresponds to the probabilities associated with image \\( I_i \\). We then compute the average probabilities along the batch axis, resulting in \\( \\overline{P_T} \\in \\mathbb{R}^C \\). Finally, we select the classes corresponding to the \\( K \\) highest values in \\( \\overline{P_T} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.362, + 0.787, + 0.482 + ], + "angle": 0, + "content": "Using the teacher model to perform this class filtering for each batch is feasible and does not incur excessive memory costs since the teacher requires no gradient computation. Therefore, the memory consumption does not depend on the number of classes in \\(\\mathcal{C}\\). Conversely, although the student model remains frozen, gradients must still be propagated to update the prompt parameters \\(\\gamma\\). Once the classes are selected, the training strategy remains the same as described above, with the only difference being that the class names observed by the student vary in each batch based on teacher predictions." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.51, + 0.462, + 0.526 + ], + "angle": 0, + "content": "4 Experimental Results" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.545, + 0.756, + 0.56 + ], + "angle": 0, + "content": "In this section we report on experiments validating our proposed approach." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.586, + 0.664, + 0.601 + ], + "angle": 0, + "content": "4.1 Evaluated Scenarios and Implementation Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.784, + 0.704 + ], + "angle": 0, + "content": "Following previous works [30,66,67], we validate KDPL in three distinct settings: 1) domain generalization; 2) cross-dataset transfer; 3) generalization to unseen classes. Additionally, to evaluate the scenario where class names are also unknown, we introduce a new evaluation setting we call class agnostic adaptation. We use the train/val/test splits and seeds provided by Zhou et al. [67] for all datasets. All reported results are averages over three independent runs." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.71, + 0.725, + 0.726 + ], + "angle": 0, + "content": "Evaluated Scenarios. We evaluate KDPL on the following scenarios:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.738, + 0.787, + 0.814 + ], + "angle": 0, + "content": "- Domain Generalization. To assess the ability of the learned prompts to generalize to out-of-distribution datasets, we apply the prompt learned from ImageNet [12] to four different versions of ImageNet datasets exhibiting various types of domain shift. The target datasets are ImageNetV2 [45], ImageNet-Sketch [54], ImageNet-A [25], and ImageNet-R [24]." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.677, + 0.84 + ], + "angle": 0, + "content": "3 https://github.com/KaiyangZhou/CoOp/blob/main/DATASETS.md" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.398, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.147, + 0.788, + 0.268 + ], + "angle": 0, + "content": "- Cross-dataset Transfer. To evaluate the ability of learned prompts to generalize to unseen classes, we evaluate the same prompt trained on ImageNet on a broad range of downstream recognition tasks. We validate on ten datasets with varying characteristics: Caltech101 [20] for general object classification; OxfordPets [43], StanfordCars [32], Flowers102 [41], Food101 [6], and FGVCAircraft [39] for fine-grained classification; the Describable Textures Dataset (DTD) [11] for texture classification; EuroSAT [23] for satellite-image recognition; and UCF101 [53] for action recognition." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.269, + 0.788, + 0.344 + ], + "angle": 0, + "content": "- Generalization to Unseen Classes. To evaluate how learned prompts generalize to unseen classes from the same dataset, we divide classes into two subsets: base and novel classes. The prompt is trained exclusively on the base classes and then tested on the novel ones. We evaluate on ImageNet as well as the ten benchmark datasets used for cross-dataset evaluation." + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.345, + 0.788, + 0.405 + ], + "angle": 0, + "content": "- Class Agnostic Adaptation. In addition we introduce a novel evaluation setting in which the training class names are unknown. The prompt is trained on ImageNet and tested on all the benchmark datasets used in the domain generalization and cross-dataset evaluations." + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.788, + 0.405 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.421, + 0.788, + 0.572 + ], + "angle": 0, + "content": "Implementation Details. We use a CLIP model with a ViT-H-14 visual backbone as the teacher model. For student models, we evaluate both on a CLIP model based on ResNet-50 and a model based on ViT-B/32. By experimenting with both ResNet-based and ViT-based CLIP models we show the architecture independence of our approach. To assess how KDPL performs when integrated into different prompt learning techniques, we selected five distinct textual, visual, and multimodal approaches. With the ResNet-50 student model, we experiment with CoOp [67] and CoCoOp [66]. For the ViT-B/32 student, since it supports both visual and textual prompting, we experiment with CoOp [67], VPT [29], MaPLe [30] and PromptSRC [31]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.573, + 0.788, + 0.648 + ], + "angle": 0, + "content": "We denote the integration of our unsupervised knowledge distillation strategy with a specific prompt learning technique by adding the suffix \\(+\\mathrm{KDPL}\\) to the name of the corresponding technique. For example, CoOp+KDPL refers to the application of KDPL to CoOp. For class agnostic settings we instead use the suffix \\(+\\mathrm{CA}\\)-KDPL to indicate that no training class names are used." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.649, + 0.788, + 0.723 + ], + "angle": 0, + "content": "Unless otherwise stated, all experiments are conducted in the few-shot setting with 16 examples per class randomly sampled from the training set. We set the temperature hyperparameter \\(\\tau\\) in Eq. (1) to 0.01. In the class agnostic experiments in which we assume no knowledge of class names in the training set, we set the number of class names selected in each iteration to \\(K = 1000\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.724, + 0.788, + 0.815 + ], + "angle": 0, + "content": "For each prompt learning method we use the original implementation and hyperparameters reported in the respective papers. Since we use the compact ResNet-50 and ViT-B/32 backbones, we cannot directly compare to the originally published results. Thus, all numbers we report here were computed by us and are averages over three independent runs. See Section A in the Supplementary Material for additional implementation details." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.825, + 0.61, + 0.84 + ], + "angle": 0, + "content": "4 https://huggingface.co/apple/DFN5B-CLIP-ViT-H-14" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.788, + 0.215 + ], + "angle": 0, + "content": "Table 1: Domain Generalization. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting, the prompt is trained on ImageNet (source) and then tested on four different versions of ImageNet (targets) that exhibit some kind of domain shift. Average performance improvements over the baselines are shown in green, and average performance deterioration in red." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.227, + 0.784, + 0.552 + ], + "angle": 0, + "content": "
BackboneMethodSourceTarget
ImageNet-V2-S-A-RAverage
RN50CLIP (student)58.2051.5033.3021.7056.0040.63
CoOp62.4055.1733.7023.1356.2042.05
CoOp + KDPL62.7355.3735.2023.2757.7742.90
CoCoOp63.0755.5334.7723.7359.4743.38
CoCoOp + KDPL62.7055.6035.3023.4357.9043.06
ViT-B/32CLIP (student)62.0054.7040.8029.6066.0047.78
CoOp66.3358.3041.4031.4765.8749.26
CoOp + KDPL65.9758.1042.5031.6367.3749.90
VPT64.9756.7341.2727.0066.5047.88
VPT + KDPL65.1057.3741.6727.7767.4748.57
MaPLe66.8058.5342.2330.1366.4049.32
MaPLe + KDPL66.5058.4742.7729.8767.7049.70
PromptSRC66.3358.7042.9732.0768.9350.67
PromptSRC + KDPL66.2758.6043.0731.7068.8350.55
ViT-H/14CLIP (teacher)82.8076.6071.1071.1091.3077.53
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.582, + 0.546, + 0.596 + ], + "angle": 0, + "content": "4.2 Results on Domain Generalization" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Table 1 outlines the performance in the domain generalization setting. We report the performance of each baseline method alongside their unsupervised KDPL variants. Additionally, the performance of the zero-shot CLIP student and teacher models using a handcrafted prompt is included for comparison. We observe that applying our unsupervised approach to each baseline does not result in a significant decrease in performance on the source dataset. Notably, when transferring the learned prompts to a different domain, incorporating KDPL in each baseline can lead to a slight improvement. This suggests that our unsupervised teacher-student distillation learns prompts that generalize better than those trained using ground-truth labels. The only exceptions where we observe an average decrease compared to the baseline are when using CoCoOp or PromptSRC. CoCoOp-KDPL achieves an average accuracy significantly lower than CoCoOp only on the ImageNet-R dataset. Finally, note that all our unsupervised KDPL variants significantly improve the performance over the zero-shot CLIP student model in both the source and the target datasets." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.397, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 2: Cross-dataset Transfer. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). The prompt is learned on ImageNet and then tested on the ten different target datasets. Average performance improvements over the baselines are indicated in green." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.213, + 0.784, + 0.507 + ], + "angle": 0, + "content": "
BackboneMethodTarget
OxfordPetsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)83.7061.0015.6040.0024.2055.6075.2058.5086.0058.3055.81
CoOp84.6061.6313.7736.8322.3354.2075.0359.0087.6757.7355.28
CoOp + KDPL87.3362.8314.9739.2730.1756.6077.2760.3088.5758.6357.59
CoCoOp86.9363.4716.2740.5327.2055.4777.7361.4088.0760.4357.75
CoCoOp + KDPL87.3364.9715.9741.2729.1756.8378.0061.5088.5059.5358.31
ViT-B/32CLIP (student)85.0064.3018.2042.8038.1060.4079.1062.0091.1060.7060.17
CoOp87.1362.2012.1340.5736.9757.8380.1362.8391.1361.8059.27
CoOp + KDPL87.1362.2315.5740.4040.9358.8380.5764.2392.7761.6360.43
VPT87.4364.7719.5344.2028.4757.6078.2763.7391.4062.5059.79
VPT + KDPL87.4364.4317.7742.9330.8057.9778.4763.6392.0062.7759.82
MaPLe88.3766.4318.4742.0337.7760.0080.1064.4391.3362.5061.14
MaPLe + KDPL88.2764.7717.3343.1337.1359.9380.4765.4393.4362.7061.26
PromptSRC88.1365.3317.1743.9040.5060.1781.2365.4092.3763.6361.78
PromptSRC + KDPL88.1765.1018.2343.2744.3060.4380.9065.6793.6363.4062.31
ViT-H/14CLIP (teacher)94.8089.4063.2066.8063.3095.6093.6076.4097.9076.4081.74
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.535, + 0.54, + 0.55 + ], + "angle": 0, + "content": "4.3 Results on Cross-dataset Transfer" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.562, + 0.788, + 0.729 + ], + "angle": 0, + "content": "In Table 2 we present the results of the cross-dataset evaluation setting in which the prompt is trained on ImageNet and tested on ten different target datasets. For all datasets our KDPL-based variants consistently outperform the corresponding baselines and demonstrate superior generalization performance. The greater generalization capabilities of KDPL are evident even for fine-grained datasets like EuroSAT, on which the CoOp+KDPL achieves an \\(8\\%\\) improvement over the baseline CoOp when using ResNet-50 as the backbone. Although adding KDPL yields only minor improvement to the VPT and MaPLe prompt learning techniques, we emphasize that our VPT+KDPL and MaPLe+KDPL do not have access to ground-truth labels. Notably, PromptSRC+KDPL achieves the highest average performance." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.753, + 0.63, + 0.767 + ], + "angle": 0, + "content": "4.4 Results on Generalization to Unseen Classes" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.787, + 0.841 + ], + "angle": 0, + "content": "In Table 3 we give results for the unseen class generalization task. In these experiments each dataset is split into \\(50\\%\\) of the classes as a base for training few-shot adaptation, and the remaining \\(50\\%\\) as new classes on which zero-shot performance is evaluated. KDPL consistently outperforms the corresponding baseline" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.788, + 0.201 + ], + "angle": 0, + "content": "Table 3: Generalization to Unseen Classes. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting the prompt is tested on classes never observed during training. Average performance improvements over the baselines are indicated in green." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.213, + 0.784, + 0.489 + ], + "angle": 0, + "content": "
BackboneMethodUnseen Classes
ImageNetOxfordPntsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)60.1093.7071.3024.8053.9043.7066.6082.2070.1090.5067.8065.88
CoOp60.0091.6358.3022.1740.9342.1359.8782.0366.7787.5357.6360.82
CoOp + KDPL60.5394.9763.4021.2738.7062.0756.6383.0769.8388.7562.6363.80
CoCoOp63.0794.9367.4724.8745.4035.1064.7384.5072.8790.7364.6764.39
CoCoOp + KDPL62.4395.1069.1724.5748.0055.9363.7085.6773.3390.5366.4066.80
ViT-B/32CLIP (student)64.0096.3072.3028.3053.9061.5069.8085.7073.1094.0071.6070.05
CoOp64.5393.3759.7723.0345.5749.1361.7385.5069.3792.1365.6064.52
CoOp + KDPL64.9094.0056.1722.0047.3362.0762.3787.2374.1793.4366.2066.35
VPT64.6094.8366.0329.7050.1750.0369.9085.8375.1392.5769.4768.02
VPT + KDPL65.2095.2067.8730.4047.5354.9769.8086.3375.1792.8071.0768.76
MaPLe66.7096.8769.7720.4353.5066.7068.0387.4776.5792.2769.4069.79
MaPLe + KDPL66.7396.8768.2327.3750.3375.7068.4087.8376.8393.6773.5371.41
PromptSRC65.9396.3071.3723.6754.4361.9770.0087.1376.7794.7072.6370.45
PromptSRC + KDPL66.3396.4768.8328.4350.8774.1768.5087.6377.3394.4774.7371.61
ViT-H/14CLIP (teacher)84.1099.2085.6064.3075.0082.6098.2096.3085.1097.3085.2086.63
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.522, + 0.788, + 0.598 + ], + "angle": 0, + "content": "methods for both backbones, demonstrating improvement in all scenarios for the majority of the datasets. On average, the performance improvement over the supervised baseline methods ranges from about \\(1\\%\\) for VPT to about \\(3\\%\\) for CoOp with the ResNet-50 backbone. See Section C.1 in the Supplementary Material for further analysis of base and unseen performance." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.627, + 0.577, + 0.643 + ], + "angle": 0, + "content": "4.5 Results on Class Agnostic Adaptation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Figure 3(a-b) summarizes the main results in the proposed Class Agnostic (CA) scenario in which even the training class names are unknown at training time. We report the accuracy on the ImageNet dataset (source), as well as the average accuracy in domain generalization and cross-dataset settings. Note that, even without knowing the class names, the performance on the source dataset steadily improves compared to the zero-shot CLIP model. Moreover, the prompts learned via the proposed unsupervised class agnostic knowledge distillation also exhibit improved average domain generalization \\((\\mathrm{AVG}^1)\\) and cross-dataset capabilities \\((\\mathrm{AVG}^2)\\). Figure 3(b) visually depicts how the ResNet-50-based CoOp + CA-KDPL compares with supervised CoOp and zero-shot CLIP student performance in the cross-dataset transfer setting. Notably, CA-KDPL outperforms both baselines despite being unsupervised and class agnostic during training." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.398, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "table", + "bbox": [ + 0.223, + 0.185, + 0.492, + 0.309 + ], + "angle": 0, + "content": "
MethodSourceAVG1AVG2
ResNet-50 (student)58.2040.6355.81
CoOp + CA-KDPL61.8343.0257.69
CoCoOp + CA-KDPL61.4343.1858.03
ViT-B/32 (student)62.0047.7860.17
CoOp + CA-KDPL64.7349.6360.74
VPT + CA-KDPL63.7347.8959.80
MaPLe + CA-KDPL65.2349.2861.23
PromptSRC + CA-KDPL65.0050.3761.93
" + }, + { + "type": "text", + "bbox": [ + 0.23, + 0.321, + 0.483, + 0.336 + ], + "angle": 0, + "content": "(a) Average class agnostic adaptation" + }, + { + "type": "image", + "bbox": [ + 0.498, + 0.143, + 0.765, + 0.308 + ], + "angle": 0, + "content": null + }, + { + "type": "text", + "bbox": [ + 0.496, + 0.321, + 0.772, + 0.337 + ], + "angle": 0, + "content": "(b) Per-dataset class agnostic adaptation" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.348, + 0.788, + 0.458 + ], + "angle": 0, + "content": "Fig. 3: Class agnostic adaptation. (a) Comparison between the zero-shot baselines and our class agnostic CA-KDPL variants (highlighted in cyan). The prompt is learned in an unsupervised and class agnostic setting on ImageNet and evaluated on the benchmark datasets for domain generalization \\((\\mathrm{AVG}^1)\\) and cross-dataset \\((\\mathrm{AVG}^2)\\) evaluations. Average performance improvements are indicated in green, and deterioration in red. (b) Per-dataset accuracy comparison between our unsupervised and class agnostic method \\((\\mathrm{CoOp + CA - KDPL})\\), the supervised baseline CoOp, and the zero-shot student on the cross-dataset benchmark datasets." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.487, + 0.36, + 0.503 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.52, + 0.788, + 0.625 + ], + "angle": 0, + "content": "In this paper we proposed an approach to Knowledge Distillation Prompt Learning (KDPL) which is easily integrated into existing supervised prompt learning methods. Our experiments show that for CoOp, CoCoOp, VPT, MaPLe and PromptSRC adding KDPL: (1) renders them label agnostic by eliminating the need for ground-truth labels for few-shot adaptation; (2) can also render them class agnostic in cases where no knowledge of training class labels is available; and (3) remarkably improves generalization to downstream tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.625, + 0.788, + 0.685 + ], + "angle": 0, + "content": "The additional computation cost incurred by distilling from a large VLM is a limitation of KDPL, though all encoder parameters are fixed and the predictions of the teacher can be precomputed, which helps mitigate the extra cost. This extra computation only amounts to about a \\(15\\%\\) increase for MaPLe." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.686, + 0.788, + 0.791 + ], + "angle": 0, + "content": "Note that we did not tune any hyperparameters when training the KDPL variants. We use the same settings as in the original papers, which are likely suboptimal for distillation-based adaptation. With careful tuning, there is potential for improvement. Our experiments indicate that distillation-learned prompts are more transferable, and we think it would be interesting to see if this idea can generalize to very different downstream tasks and scale to even bigger teacher models or - more interestingly - to even smaller student models." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.174, + 0.785, + 0.205 + ], + "angle": 0, + "content": "This work was supported by funding from the European Commission Horizon 2020 grant #951911 (AI4Media)." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.225, + 0.323, + 0.241 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.252, + 0.786, + 0.308 + ], + "angle": 0, + "content": "1. Abdul Samadh, J., Gani, M.H., Hussein, N., Khattak, M.U., Naseer, M.M., Shahbaz Khan, F., Khan, S.H.: Align your prompts: Test-time prompting with distribution alignment for zero-shot generalization. Advances in Neural Information Processing Systems 36 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.309, + 0.787, + 0.363 + ], + "angle": 0, + "content": "2. Agnolucci, L., Baldrati, A., Todino, F., Becattini, F., Bertini, M., Del Bimbo, A.: Eco: Ensembling context optimization for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2811-2815 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.364, + 0.787, + 0.404 + ], + "angle": 0, + "content": "3. Baldrati, A., Agnolucci, L., Bertini, M., Del Bimbo, A.: Zero-shot composed image retrieval with textual inversion. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15338-15347 (October 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.405, + 0.787, + 0.459 + ], + "angle": 0, + "content": "4. Barraco, M., Cornia, M., Cascianelli, S., Baraldi, L., Cucchiara, R.: The unreason-able effectiveness of clip features for image captioning: an experimental analysis. In: proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4662-4670 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.459, + 0.787, + 0.513 + ], + "angle": 0, + "content": "5. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10925-10934 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.513, + 0.787, + 0.568 + ], + "angle": 0, + "content": "6. Bossard, L., Guillaume, M., Van Gool, L.: Food-101-mining discriminative components with random forests. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part VI 13. pp. 446-461. Springer (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.568, + 0.787, + 0.609 + ], + "angle": 0, + "content": "7. Bulat, A., Tzimiropoulos, G.: Lasp: Text-to-text optimization for language-aware soft prompting of vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23232-23241 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.609, + 0.787, + 0.65 + ], + "angle": 0, + "content": "8. Chen, G., Yao, W., Song, X., Li, X., Rao, Y., Zhang, K.: Plot: Prompt learning with optimal transport for vision-language models. In: The Eleventh International Conference on Learning Representations (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.65, + 0.787, + 0.704 + ], + "angle": 0, + "content": "9. Chen, W.C., Chang, C.C., Lee, C.R.: Knowledge distillation with feature maps for image classification. In: Computer Vision-ACCV 2018: 14th Asian Conference on Computer Vision, Perth, Australia, December 2-6, 2018, Revised Selected Papers, Part III 14. pp. 200-215. Springer (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.705, + 0.787, + 0.759 + ], + "angle": 0, + "content": "10. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.759, + 0.787, + 0.8 + ], + "angle": 0, + "content": "11. Cimpoi, M., Maji, S., Kokkinos, I., Mohamed, S., Vedaldi, A.: Describing textures in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3606-3613 (2014)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.8, + 0.787, + 0.84 + ], + "angle": 0, + "content": "12. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.252, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.397, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.189 + ], + "angle": 0, + "content": "13. Desai, K., Johnson, J.: Virtex: Learning visual representations from textual annotations. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11162-11173 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.785, + 0.218 + ], + "angle": 0, + "content": "14. Ding, Y., Liu, L., Tian, C., Yang, J., Ding, H.: Don't stop learning: Towards continual learning for the clip model. arXiv preprint arXiv:2207.09248 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.785, + 0.259 + ], + "angle": 0, + "content": "15. Dong, X., Bao, J., Zhang, T., Chen, D., Gu, S., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N.: Clip itself is a strong fine-tuner: Achieving 85.7% and 88.0% top-1 accuracy with vit-b and vit-l on imagenet. arXiv preprint arXiv:2212.06138 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.259, + 0.785, + 0.314 + ], + "angle": 0, + "content": "16. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.785, + 0.355 + ], + "angle": 0, + "content": "17. Dou, Q., Liu, Q., Heng, P.A., Glocker, B.: Unpaired multi-modal segmentation via knowledge distillation. IEEE transactions on medical imaging 39(7), 2415-2425 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.356, + 0.785, + 0.397 + ], + "angle": 0, + "content": "18. Fang, A., Jose, A.M., Jain, A., Schmidt, L., Toshev, A.T., Shankar, V.: Data filtering networks. In: The Twelfth International Conference on Learning Representations (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.398, + 0.785, + 0.438 + ], + "angle": 0, + "content": "19. Fang, Z., Wang, J., Wang, L., Zhang, L., Yang, Y., Liu, Z.: Seed: Self-supervised distillation for visual representation. In: International Conference on Learning Representations (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.439, + 0.785, + 0.494 + ], + "angle": 0, + "content": "20. Fei-Fei, L., Fergus, R., Perona, P.: Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories. In: 2004 conference on computer vision and pattern recognition workshop. pp. 178-178. IEEE (2004)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.495, + 0.785, + 0.535 + ], + "angle": 0, + "content": "21. Gu, X., Lin, T.Y., Kuo, W., Cui, Y.: Open-vocabulary object detection via vision and language knowledge distillation. In: International Conference on Learning Representations (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.536, + 0.785, + 0.577 + ], + "angle": 0, + "content": "22. He, T., Shen, C., Tian, Z., Gong, D., Sun, C., Yan, Y.: Knowledge adaptation for efficient semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 578-587 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.578, + 0.785, + 0.632 + ], + "angle": 0, + "content": "23. Helber, P., Bischke, B., Dengel, A., Borth, D.: Eurosat: A novel dataset and deep learning benchmark for land use and land cover classification. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 12(7), 2217-2226 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.633, + 0.785, + 0.688 + ], + "angle": 0, + "content": "24. Hendrycks, D., Basart, S., Mu, N., Kadavath, S., Wang, F., Dorundo, E., Desai, R., Zhu, T., Parajuli, S., Guo, M., et al.: The many faces of robustness: A critical analysis of out-of-distribution generalization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8340-8349 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.785, + 0.73 + ], + "angle": 0, + "content": "25. Hendrycks, D., Zhao, K., Basart, S., Steinhardt, J., Song, D.: Natural adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15262-15271 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.785, + 0.757 + ], + "angle": 0, + "content": "26. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. stat 1050, 9 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.758, + 0.785, + 0.785 + ], + "angle": 0, + "content": "27. Huang, T., Chu, J., Wei, F.: Unsupervised prompt learning for vision-language models. arXiv preprint arXiv:2204.03649 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.785, + 0.785, + 0.84 + ], + "angle": 0, + "content": "28. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.175 + ], + "angle": 0, + "content": "29. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: European Conference on Computer Vision (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.217 + ], + "angle": 0, + "content": "30. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.785, + 0.272 + ], + "angle": 0, + "content": "31. Khattak, M.U., Wasim, S.T., Naseer, M., Khan, S., Yang, M.H., Khan, F.S.: Self-regulating prompts: Foundational model adaptation without forgetting. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15190-15200 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.785, + 0.314 + ], + "angle": 0, + "content": "32. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.315, + 0.785, + 0.37 + ], + "angle": 0, + "content": "33. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision (IJCV) 128(7), 1956-1981 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.412 + ], + "angle": 0, + "content": "34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. pp. 3045-3059 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.412, + 0.785, + 0.466 + ], + "angle": 0, + "content": "35. Li, X.L., Liang, P.: Prefix-tuning: Optimizing continuous prompts for generation. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 4582-4597 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.522 + ], + "angle": 0, + "content": "36. Li, Z., Li, X., Fu, X., Zhang, X., Wang, W., Chen, S., Yang, J.: Promptkd: Unsupervised prompt distillation for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 26617-26626 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.523, + 0.785, + 0.563 + ], + "angle": 0, + "content": "37. Lu, Y., Liu, J., Zhang, Y., Liu, Y., Tian, X.: Prompt distribution learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5206-5215 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.565, + 0.785, + 0.605 + ], + "angle": 0, + "content": "38. Lüddecke, T., Ecker, A.: Image segmentation using text and image prompts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7086-7096 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.785, + 0.633 + ], + "angle": 0, + "content": "39. Maji, S., Rahtu, E., Kannala, J., Blaschko, M., Vedaldi, A.: Fine-grained visual classification of aircraft. arXiv preprint arXiv:1306.5151 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.634, + 0.785, + 0.674 + ], + "angle": 0, + "content": "40. Mullapudi, R.T., Chen, S., Zhang, K., Ramanan, D., Fatahalian, K.: Online model distillation for efficient video inference. In: Proceedings of the IEEE/CVF International conference on computer vision. pp. 3573-3582 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.785, + 0.715 + ], + "angle": 0, + "content": "41. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: 2008 Sixth Indian conference on computer vision, graphics & image processing. pp. 722-729. IEEE (2008)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.716, + 0.785, + 0.77 + ], + "angle": 0, + "content": "42. Parelli, M., Delitzas, A., Hars, N., Vlassis, G., Anagnostidis, S., Bachmann, G., Hofmann, T.: Clip-guided vision-language pre-training for question answering in 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5606-5611 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.772, + 0.785, + 0.812 + ], + "angle": 0, + "content": "43. Parkhi, O.M., Vedaldi, A., Zisserman, A., Jawahar, C.: Cats and dogs. In: 2012 IEEE conference on computer vision and pattern recognition. pp. 3498-3505. IEEE (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.813, + 0.785, + 0.84 + ], + "angle": 0, + "content": "44. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.397, + 0.127 + ], + "angle": 0, + "content": "M. Mistretta et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.241, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.177, + 0.786, + 0.217 + ], + "angle": 0, + "content": "45. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: DoImagenet classifiers generalize toImagenet? In: International conference on machine learning. pp. 5389-5400. PMLR (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.786, + 0.259 + ], + "angle": 0, + "content": "46. Ren, S., Zhang, A., Zhu, Y., Zhang, S., Zheng, S., Li, M., Smola, A.J., Sun, X.: Prompt pre-training with twenty-thousand classes for open-vocabulary visual recognition. Advances in Neural Information Processing Systems 36 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.26, + 0.787, + 0.314 + ], + "angle": 0, + "content": "47. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortzman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278–25294 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.315, + 0.786, + 0.357 + ], + "angle": 0, + "content": "48. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.357, + 0.786, + 0.398 + ], + "angle": 0, + "content": "49. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.399, + 0.786, + 0.439 + ], + "angle": 0, + "content": "50. Shi, Z., Lipani, A.: DePT: Decomposed prompt tuning for parameter-efficient fin-tuning. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=KjegfPGRde" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.44, + 0.786, + 0.495 + ], + "angle": 0, + "content": "51. Siam, M., Jiang, C., Lu, S., Petrich, L., Gamal, M., Elhoseiny, M., Jagersand, M.: Video object segmentation using teacher-student adaptation in a human robot interaction (hri) setting. In: 2019 International Conference on Robotics and Automation (ICRA). pp. 50-56. IEEE (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.495, + 0.786, + 0.55 + ], + "angle": 0, + "content": "52. Song, H., Dong, L., Zhang, W., Liu, T., Wei, F.: Clip models are few-shot learners: Empirical studies on vqa and visual entailment. In: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). pp. 6088-6100 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.55, + 0.786, + 0.577 + ], + "angle": 0, + "content": "53. Soomro, K., Zamir, A.R., Shah, M.: Ucf101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.578, + 0.786, + 0.619 + ], + "angle": 0, + "content": "54. Wang, H., Ge, S., Lipton, Z., Xing, E.P.: Learning robust global representations by penalizing local predictive power. Advances in Neural Information Processing Systems 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.62, + 0.786, + 0.661 + ], + "angle": 0, + "content": "55. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.661, + 0.786, + 0.688 + ], + "angle": 0, + "content": "56. Xu, G., Liu, Z., Li, X., Loy, C.C.: Knowledge distillation meets self-supervision. In: European Conference on Computer Vision. pp. 588-604. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.689, + 0.786, + 0.73 + ], + "angle": 0, + "content": "57. Yao, H., Zhang, R., Xu, C.: Visual-language prompt tuning with knowledge-guided context optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6757-6767 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.73, + 0.786, + 0.772 + ], + "angle": 0, + "content": "58. Yuan, L., Tay, F.E., Li, G., Wang, T., Feng, J.: Revisiting knowledge distillation via label smoothing regularization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3903-3911 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.772, + 0.786, + 0.813 + ], + "angle": 0, + "content": "59. Yun, S., Park, J., Lee, K., Shin, J.: Regularizing class-wise predictions via self-knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13876-13885 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.814, + 0.786, + 0.84 + ], + "angle": 0, + "content": "60. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proceedings of the" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.148, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.268, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.245, + 0.147, + 0.786, + 0.175 + ], + "angle": 0, + "content": "IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18123-18133 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.787, + 0.217 + ], + "angle": 0, + "content": "61. Zhang, R., Fang, R., Zhang, W., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free clip-adapter for better vision-language modeling. arXiv preprint arXiv:2111.03930 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.218, + 0.786, + 0.258 + ], + "angle": 0, + "content": "62. Zhang, Y., Xiang, T., Hospedales, T.M., Lu, H.: Deep mutual learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4320-4328 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.259, + 0.786, + 0.3 + ], + "angle": 0, + "content": "63. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 11953-11962 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.3, + 0.786, + 0.357 + ], + "angle": 0, + "content": "64. Zhong, Z., Friedman, D., Chen, D.: Factual probing is [mask]: Learning vs. learning to recall. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5017-5033 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.357, + 0.786, + 0.384 + ], + "angle": 0, + "content": "65. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.786, + 0.425 + ], + "angle": 0, + "content": "66. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.786, + 0.452 + ], + "angle": 0, + "content": "67. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.786, + 0.495 + ], + "angle": 0, + "content": "68. Zhu, B., Niu, Y., Han, Y., Wu, Y., Zhang, H.: Prompt-aligned gradient for prompt tuning. In: 2023 IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15613-15623. IEEE Computer Society (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.495 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_origin.pdf b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0b9d95476d4d342de5eae6862e8fbecc7fc74f83 --- /dev/null +++ b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/9f1c72dd-d414-4ca2-82bf-f12a70653976_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f64185bfd592f0316a755a3ae752d0111b81c4b6100799b41d6a1aa59e2c0e48 +size 3087933 diff --git a/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/full.md b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..a5041258b787f523a164bad3fb16da8398e77216 --- /dev/null +++ b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/full.md @@ -0,0 +1,292 @@ +# Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation + +*Marco Mistretta1, *Alberto Baldrati1,2, Marco Bertini1, and Andrew D. Bagdanov1 + +1 University of Florence - Media Integration and Communication Center (MICC) + +2 University of Pisa + +Florence, Italy - Pisa, Italy + +{name.surname}@unifi.it + +Abstract. Vision-Language Models (VLMs) demonstrate remarkable zero-shot generalization to unseen tasks, but fall short of the performance of supervised methods in generalizing to downstream tasks with limited data. Prompt learning is emerging as a parameter-efficient method for adapting VLMs, but state-of-the-art approaches require annotated samples. In this paper we propose a novel approach to prompt learning based on unsupervised knowledge distillation from more powerful models. Our approach, which we call Knowledge Distillation Prompt Learning (KDPL), can be integrated into existing prompt learning techniques and eliminates the need for labeled examples during adaptation. Our experiments on more than ten standard benchmark datasets demonstrate that KDPL is very effective at improving generalization of learned prompts for zero-shot domain generalization, zero-shot cross-dataset generalization, and zero-shot base-to-novel class generalization problems. KDPL requires no ground-truth labels for adaptation, and moreover we show that even in the absence of any knowledge of training class names (CA-KDPL) can be used to effectively transfer knowledge. The code is publicly available at https://github.com/miccunifi/KDPL. + +Keywords: Prompt Learning $\cdot$ Unsupervised Knowledge Distillation $\cdot$ Vision-Language Models $\cdot$ Few-Shot Learning $\cdot$ Zero-shot Transfer. + +# 1 Introduction + +Vision-Language Models (VLMs) like Contrastive Language-Image Pre-training (CLIP) are remarkably effective at zero-shot generalization to downstream tasks [3,42,44,65]. These models leverage a dual encoder architecture and are trained to align image and text features in a shared embedding space. CLIP and similar models are able to perform zero-shot classification by predicting the output class based on the similarity between the test image embedding and text embeddings of words from a fixed vocabulary. + +![](images/a2e6a564cca2a1ba0a22df9d60e4b5b08049a84ae5442e4a002e8db7fe4ce7ba.jpg) +Fig. 1: Motivation and overview. (Top left) Lightweight VLMs like CLIP achieve impressive zero-shot performance but lag behind supervised approaches; large VLMs incur a high computational burden. (Bottom left) Parameter-efficient prompt learning offers a non-destructive approach to adapting VLMs to downstream tasks; however, existing methods require annotated samples and struggle to generalize to unseen classes. (Right) Our approach does not require labeled samples and learns by distilling knowledge from a more powerful VLM. It can be seamlessly integrated into existing prompt learning techniques and generalizes better to unseen classes on downstream tasks. + +![](images/3a244238893de675128bf7a03f118399fc7b12e421686c530bf3392bdca78ec7.jpg) + +While CLIP exhibits remarkable zero-shot performance, it can fall short of supervised adaptation. Narrowing this gap through fine-tuning is challenging when large training datasets are not available for downstream tasks. Moreover, fine-tuning can also lead to overfitting and is destructive in that it can cause the model to forget knowledge acquired during large-scale pre-training [14,67]. + +An intuitive way to achieve better performance is to use larger and more powerful VLMs [10] with better zero-shot generalization. However, though performance improves with increasing size, their practical applicability in real-world scenarios decreases. Lightweight CLIP models based on ResNet-50 and ViT-B/32 require about 18 and 14 GFLOPs for inference, respectively. In contrast, more powerful models based on ViT-H/14 [10,18] require nearly $30 \times$ the computation at 381 GFLOPs [18] for inference. + +To address these challenges, parameter-efficient prompt learning is emerging as a promising and non-destructive approach to adapting VLMs to downstream tasks [34,35,64]. Zhou et al. [67] proposed a text-only prompt learning approach called CoOp to overcome the limitations of manually crafted prompts. Subsequently, Jia et al. [29] extended prompt learning to the visual domain with Visual Prompt Tuning (VPT), and Khattak et al. [30,31] proposed a multi-modal prompt learning approach called MaPLe [30] and a self-regulated approach called PromptSRC [31]. Although significantly improving over carefully tuned, handcrafted prompts, these state-of-the-art techniques all require annotated samples from the dataset and have problems generalizing to other datasets or classes unseen during training [30,66]. + +To eliminate the need for labeled training examples and improve the generalization of learned prompts, we propose a novel approach to prompt learning which we call Knowledge Distillation Prompt Learning (KDPL). KDPL adapts lightweight VLMs and improves performance on downstream tasks by distilling knowledge from a more powerful VLM without the need for annotated examples. KDPL is a flexible method that can be seamlessly integrated into existing prompt learning framework such as CoOp [67], CoCoOp [66], VPT [29], MaPLe [30], and PromptSRC [31]. Figure 1 summarizes the motivations and illustrates the workflow of the proposed approach. We validate KDPL on two increasingly challenging scenarios: in the first, we assume knowledge of training class names, while in the second we assume no knowledge of training classes. Importantly, in both scenarios no annotated training samples are used. + +The contributions of this work are: + +- we propose a novel parameter-efficient prompt-learning approach that eliminates the need for labeled training examples by distilling knowledge from a large Vision-Language Model; +- we show that our approach can be integrated into existing prompt learning techniques to learn visual, textual, and multimodal prompts which generalize significantly better than state-of-the-art baselines to unseen classes in downstream tasks: +- we demonstrate the effectiveness of our approach through extensive experiments on more than ten standard benchmark datasets covering a broad range of downstream problems, including domain generalization, cross-dataset adaptation, and base-to-novel generalization; and +- we introduce a new, class agnostic evaluation setting in which training class names are unknown and show the superiority of our approach in this scenario. + +To the best of our knowledge ours is the first approach to parameter-efficient VLM adaptation which is applicable in scenarios that are label agnostic (i.e. no label supervision is required during adaptation) and also in scenarios that are additionally class agnostic (i.e. no knowledge of training class names is assumed). + +# 2 Related Work + +In this section we review the recent literature most relevant to our contribution. + +Vision-Language Models. Vision-Language Models (VLMs) learn robust visual representations thanks to their extensive pre-training on image-caption datasets [47, 48]. These representations are very effective at generalizing to a variety of downstream tasks [13, 28, 44]. In contrast to vision models trained only with image supervision, vision-language models can interpret both visual and textual data, showing improvement in tasks requiring cross-model understanding [3, 4, 52]. We focus on contrastively-trained VLMs such as CLIP [44], ALIGN [28], and LiT [60]. These models use a dual encoder architecture and contrastive learning to align images and text in a common embedding space. Thanks to this shared embedding space and massive pre-training datasets these + +models achieve remarkable performance. However, there is still a gap between the zero-shot capabilities of these VLMs and the performance of tailored state-of-the-art models [15,44], and thus there is active research on efficient and effective methods to adapt VLMs to downstream tasks [21,38,55,61]. + +Prompt Learning. The performance of VLMs is highly dependent on textual prompts used to characterize downstream tasks. Given the significant impact of small changes in wording on performance, the manual generation of optimal textual prompts is a challenging task. Inspired by developments in NLP [34,35, 64], CoOp [67] proposes to learn continuous vectors in the word embedding space instead of using tailored hand-crafted prompts. + +The promising results of CoOp have attracted considerable interest in prompt learning for VLMs [1, 2, 7, 8, 30, 31, 37, 49, 50, 57, 68]. CoCoOp, in particular, highlights the poor performance of CoOp on unseen classes and uses image-conditional dynamic prompts to improve generalization [66]. PLOT [8] instead is based on learning multiple prompts by exploiting local visual features. Kg-CoOp [57] adds a regularization loss to minimize the discrepancy between learned and hand-crafted prompts, while VPT [29] adapts prompt learning to the visual domain by learning continuous vectors in the input space of a ViT [16]. Finally, MaPLe [30] introduces a multimodal prompt learning strategy for VLMs. PromptSRC [31] introduces a self-regularization framework for prompting, addressing overfitting through agreement with a frozen model, a self-ensemble of prompts, and textual diversity. + +Similar to the approach we propose in this paper, UPL [27] performs prompt learning without relying on annotated samples. It leverages pseudolabels derived from a larger CLIP model and selects the top-K most confident samples per class to construct a balanced set of pseudo-labels. UPL requires a substantial collection of unlabeled images and is not directly applicable when only a few unlabeled samples are available, like in the few-shot adaptation scenarios considered here. In contrast to UPL, KDPL does not use pseudolabeling; instead, we directly learn from the logits of a CLIP teacher model via knowledge distillation, thus eliminating the need for any selection strategy of the training samples. + +Knowledge Distillation. Knowledge distillation (KD) is a machine learning technique in which a simple model (student) is trained to mimic the behavior of a larger model (teacher) by learning from its output or intermediate activation [26]. This technique has found success in many contexts, including image classification [5,9,26], self-supervised learning [19,56], and image/video segmentation [17, 22, 40, 51], leading to improvements in model compression, computational efficiency, and performance. DML [62] introduces a mutual learning approach to train students and teachers simultaneously. DKD [63] reformulates the classical KD loss into a term related to the target class and a term related to the non-target classes. In contrast to the majority of knowledge distillation approaches [58, 59, 62, 63], we do not utilize any labels during training. Instead, we solely employ the distillation loss. In our work, we apply knowledge distillation in a parameter-efficient prompt learning scenario. Specifically, we distill + +knowledge from a large and powerful VLM (teacher) into a lightweight VLM (student) by updating only a reduced number of parameters (the prompt). + +Techniques Using Teacher-Student Distillation. Recently Li et al. [36] introduced PromptKD which also uses teacher-student distillation in prompt learning. Although it too leverages a larger teacher to guide a smaller student, it differs from our contribution in several key aspects. PromptKD uses PromptSRC [31] to pre-train the teacher model with labeled examples, whereas KDPL does not pre-train the teacher and requires no labeled examples. PromptKD uses an MLP to project the student image encoder output, which adds extra parameters. KDPL is instead a general framework with no additional parameters, adaptable to any prompt-tuning technique to render them completely unsupervised. Moreover, PromptKD uses the entire training set, including both base and novel images, for distillation. In contrast, KDPL follows the standard 16-shot setting. + +# 3 Knowledge Distillation Prompt Learning (KDPL) + +We first introduce preliminary concepts related to prompt learning and then describe our approach to applying knowledge distillation to the problem. + +# 3.1 Preliminaries + +Our approach is based on knowledge distillation applied to prompt learning. Here we discuss the base teacher and student models (CLIPs) and five state-of-the-art prompt learning approaches into which we will incorporate KDPL. + +CLIP. Contrastive Language-Image Pre-training (CLIP) is a vision-language model trained to align images and textual captions in shared semantic space [44]. CLIP consists of an image encoder $f_{\theta}$ and a text encoder $g_{\phi}$ . Given an image $I$ , the image encoder computes its feature representation $f_{\theta}(I) \in \mathbb{R}^d$ , where $d$ is the size of the semantic embedding space. Similarly, for a given textual caption $Y$ , a word embedding layer $E_L$ maps each tokenized word to the token embedding space $\mathcal{W}$ . Then, the text encoder $g_{\phi}$ generates the textual feature representation $g_{\phi}(E_L(Y)) \in \mathbb{R}^d$ . The main goal of CLIP training is to learn $\theta$ and $\phi$ such that $f_{\theta}(I) \approx g_{\phi}(E_L(Y))$ for associated image/text pairs $(I,Y)$ . + +When using a Vision Transformer (ViT) [16] as the visual encoder $f_{\theta}$ , the encoding process begins by splitting the image into $U$ fixed-size patches. These patches are then projected into patch embeddings $\{w_1, w_2, \ldots, w_U\}$ , where each $w_i$ belongs to the patch embedding space $\mathcal{V}$ . A learnable class (CLS) token $c_i$ is concatenated with the patch embeddings, resulting in the input to the vision transformer being $\{c_i, w_1, w_2, \ldots, w_U\}$ . Finally, the CLS token of the final transformer layer is projected to the shared embedding space via a linear projection to obtain the final representation. + +To perform zero-shot classification using CLIP, we start with an image $I$ and build a set of textual prompts $\{Y_{i}\}_{i = 1}^{C}$ , where $C$ denotes the number of classes. + +Each handcrafted text prompt $Y_{i}$ takes the format "a photo of a $[CLASS_{i}]$ ", where $CLASS_{i}$ represents a specific class name, such as airplane, bird, etc. + +Then the feature representations $\psi_I = f_\theta(I)$ and $\psi_T^i = g_\phi(E_L(Y_i))$ are extracted using the CLIP encoders. The predicted probability for each class is: + +$$ +p (y = i \mid I) = \frac {\exp \left(\cos \left(\psi_ {T} ^ {i} , \psi_ {I}\right) / \tau\right)}{\sum_ {j = 1} ^ {C} \exp \left(\cos \left(\psi_ {T} ^ {j} , \psi_ {I}\right) / \tau\right)}, \tag {1} +$$ + +where $\cos (\cdot ,\cdot)$ is the cosine similarity and $\tau$ is a temperature hyperparameter. + +Prompt-Learning Techniques. Here we summarize how the state-of-the-art techniques for textual, visual, and multimodal prompt learning work. + +- CoOp [67] is a textual prompt learning technique that learns continuous context tokens (i.e. the learnable prompt) in the CLIP token embedding space. Specifically, CoOp introduces $M$ learnable vectors, $\{v_{1}, v_{2}, \ldots, v_{M}\}$ where each context vector $v_{i} \in \mathcal{W}$ . For each of the $k$ classes of a dataset, the input to the text encoder is $\{v_{1}, v_{2}, \ldots, v_{M}, c_{k}\}$ , where $c_{k} = E_{L}([CLSAS_{k}])$ . +- CoCoOp [66] extends CoOp by incorporating a lightweight network $h_\theta$ . Each context token is obtained as $v_i(I) = v_i + \pi$ , where $\pi = h_\theta(I)$ . This method ensures that the textual prompts are conditioned on the input image. +- VPT [29] is a visual prompt learning method that can be viewed as the counterpart of CoOp in the visual domain. Unlike CoOp, which operates entirely in the textual token embedding space $\mathcal{W}$ , VPT performs prompt learning in the visual patch embedding space $\mathcal{V}$ . Specifically, VPT learns $P$ visual tokens, leading to the input to the ViT being $\{z_{1},\ldots ,z_{P},c_{i},w_{1},w_{2},\ldots ,w_{U}\}$ . VPT offers two prompting variants: deep and shallow. The deep variant learns a distinct prompt for each ViT layer, while the shallow variant incorporates the prompt parameters only into the input of the first layer. +- MaPLe [30] is a deep multi-modal prompt learning technique that promotes strong coupling between vision and language prompts. In practice, MaPLe learns different textual context tokens for each layer in $g_{\phi}$ . The visual prompts, on the other hand, are not directly learned but are obtained through a linear mapping from the textual ones. +- PromptSRC [31] is another multi-modal prompt learning technique that optimizes prompts through mutual agreement maximization between prompted and frozen model features using self-distillation, Gaussian-weighted prompt aggregation over the training session, and promoting textual diversity to address sample diversity imbalance. + +Note that methods involving visual prompt learnable tokens like VPT [29], MaPLe [30], and PromptSRC [31] can only be applied to VLMs equipped with a ViT-based image encoder. + +# 3.2 Label Agnostic Prompt Learning + +The methods described above all rely on ground-truth labels during adaptation. Here we show how unsupervised knowledge distillation can be used instead to replace the need for annotated training examples. + +![](images/e117afe262e4488118d77e09c2f91aa876dd0017e84a1a02c806300b0b8442d9.jpg) +Fig. 2: Knowledge Distillation Prompt Learning (KDPL) overview. Given a lightweight VLM student and a larger, more powerful VLM teacher, KDPL updates the student prompt parameters by distilling knowledge from the teacher. KDPL first performs zero-shot classification with the teacher to obtain teacher probabilities $p_T$ . It then computes the student probabilities $p_S$ and performs knowledge distillation to update the student prompt parameters $\gamma$ . + +Overview. Our proposed approach, which we call Knowledge Distillation Prompt Learning (KDPL), is a general method designed to enhance the performance of the CLIP model on downstream tasks through parameter-efficient prompt learning. Unlike previous approaches [30,66,67], which rely on labeled examples for training, KDPL eliminates the need for manually-labeled samples by learning only through knowledge distillation from a larger and more powerful VLM. Note that KDPL is a method that can be seamlessly integrated with any existing prompt learning approach in scenarios where no information about class names or labels is available. + +We validate KDPL in two progressively challenging supervision regimes. In the label agnostic scenario we do not use ground-truth labels, but we assume knowledge of the class names in the training dataset. In the class agnostic scenario (see Section 3.3) we go one step further and assume that even the training class names are unknown. For this class agnostic scenario we propose an effective and efficient online strategy for automatically filtering the classes from a large dictionary of approximately 20K class names [33]. + +Prompt Learning via Unsupervised Knowledge Distillation (KDPL). Given a lightweight CLIP model (the student) and a larger, more powerful CLIP model (the teacher), we aim to improve the downstream performance of the student model by distilling knowledge from teacher to student. For an image $I$ and a set of classes $\mathcal{C} = \{\mathrm{CLASS}_i\}_{i=1}^C$ , we start by performing zero-shot classification using the frozen teacher model. Specifically, we use the teacher image encoder $f_{\theta}^{B}$ and text encoder $g_{\phi}^{B}$ to compute the teacher image features $\psi_{I,B} = f_{\theta}^{B}(I)$ and text features $\psi_{T,B}^{i} = g_{\phi}^{S}(E_L([\mathrm{CLASS}_i]))$ . For the teacher model we use the fixed text prompt "a photo of [CLASS]". We then apply Eq. (1) to produce the probabilities $p_T(I,\mathcal{C})$ predicted by the teacher on image $I$ for classes $\mathcal{C}$ . + +The teacher model does not rely on a learnable prompt and its predictions remain fixed during training. Our aim is to learn text and image prompts for the student model that enhance its generalization to downstream tasks. + +We denote with $f_{\theta}^{S}$ and $g_{\phi}^{S}$ the student image and text encoders, respectively, and with $\gamma$ the parameters associated with the learnable student prompts (see Fig. 2). Given the same image $I$ processed by the teacher and the same set of classes $\mathcal{C}$ , the student extracts image features $\psi_{I,S} = f_{\theta,\gamma}^{S}(I)$ and text features $\psi_{T,S}^{i} = g_{\phi,\gamma}^{S}(E_{L}([\mathrm{CLASS}_{i}]))$ . Note that the text and image encoders can both depend on the prompt parameters $\gamma$ . According to the prompt learning technique used, the $\gamma$ parameters can be used only by the text encoder (CoOp, CoCoOp), the visual encoder (VPT), or both (MaPLe, PromptSRC). Finally, using Eq. (1) we produce student class probabilities $p_{S}(I,\mathcal{C})$ predicted on image $I$ for classes $\mathcal{C}$ . Note that all encoder parameters except for the learnable prompt $\gamma$ are frozen. + +We use the symmetric KL-divergence between the teacher $(p_T(I,\mathcal{C}))$ and the student $(p_S(I,\mathcal{C}))$ probabilities in a distillation loss: + +$$ +\mathcal {L} (\mathcal {I}, \mathcal {C}) = \left[ D _ {\mathrm {K L}} \left(p _ {T} (I, \mathcal {C}) \mid \mid p _ {S} (I, \mathcal {C})\right) + D _ {\mathrm {K L}} \left(p _ {S} (I, \mathcal {C}) \mid \mid p _ {T} (I, \mathcal {C})\right) \right], \tag {2} +$$ + +where $D(q\parallel p)$ is the asymmetric KL-divergence between the discrete probability distributions $p$ and $q$ : + +$$ +D _ {\mathrm {K L}} (p \mid | q) = \sum_ {i \in \mathcal {C}} p _ {i} \log \left(\frac {p _ {i}}{q _ {i}}\right) \tag {3} +$$ + +This distillation loss depends only on the fixed predictions of the teacher, the prompt-conditioned predictions of the students, and the set of classes $\mathcal{C}$ . + +Importantly, our distillation loss does not assume any knowledge of class labels for image $I$ . Nor does it require that $\mathcal{C}$ be the classes of the downstream task – that is, KDPL can be used for Label Agnostic and Class Agnostic adaptation scenarios. We found in early experiments that the symmetric KL-divergence works slightly better than either asymmetric option (see Section B.3 in the Supplementary Material for an ablation study on this choice). + +# 3.3 Class Agnostic Prompt Learning + +To further evaluate the generalization capabilities of KDPL, we introduce a scenario where not only do we not know the labels of training images (label agnostic, Section 3.2) but where we also do not even know the class names associated with the dataset (class agnostic). This scenario is considerably more challenging as we make no assumptions about the few-shot training data. + +To address the unavailability of class names, we propose a strategy for automatically selecting a set of class names for each batch. We start with a large vocabulary of class names from which to select. Specifically, we use the Open Images V7 dataset [33], which contains $\sim 20\mathrm{K}$ classes. The most straightforward method would simply use all 20K classes during training. However, this is impractical as the memory required by prompt learning methods increases linearly with the number of classes. According to Ren et al. [46], CoOp requires nearly 15MB of VRAM per class, resulting in approximately 300GB of memory when + +multiplied by 20K classes. Therefore, we propose a method to automatically select which classes to use for each batch by retaining only the ones most relevant to the calculation of the loss in Eq. (2). + +Given a batch of images $X = \{I_i\}_{i=1}^N$ and all the class names in the vocabulary $\mathcal{C} = \{\mathrm{CLASS}_i\}_{i=1}^C$ , where $N$ represents the number of images in a batch and $C$ the size of the dictionary, we let the teacher model select the most relevant classes. Our objective is to identify the most useful $K$ classes in each batch for student prompt learning. After extracting the teacher image and text features, for each image $I_i \in X$ , we apply Eq. (1) to obtain the teacher probabilities $p_T(I_i, \mathcal{C})$ . By stacking the probabilities along the batch dimension, we obtain the matrix $P_T = [p_T(I_1, \mathcal{C}); \dots; p_T(I_N, \mathcal{C})]^T \in \mathbb{R}^{N \times C}$ , where the $i$ -th row corresponds to the probabilities associated with image $I_i$ . We then compute the average probabilities along the batch axis, resulting in $\overline{P_T} \in \mathbb{R}^C$ . Finally, we select the classes corresponding to the $K$ highest values in $\overline{P_T}$ . + +Using the teacher model to perform this class filtering for each batch is feasible and does not incur excessive memory costs since the teacher requires no gradient computation. Therefore, the memory consumption does not depend on the number of classes in $\mathcal{C}$ . Conversely, although the student model remains frozen, gradients must still be propagated to update the prompt parameters $\gamma$ . Once the classes are selected, the training strategy remains the same as described above, with the only difference being that the class names observed by the student vary in each batch based on teacher predictions. + +# 4 Experimental Results + +In this section we report on experiments validating our proposed approach. + +# 4.1 Evaluated Scenarios and Implementation Details + +Following previous works [30,66,67], we validate KDPL in three distinct settings: 1) domain generalization; 2) cross-dataset transfer; 3) generalization to unseen classes. Additionally, to evaluate the scenario where class names are also unknown, we introduce a new evaluation setting we call class agnostic adaptation. We use the train/val/test splits and seeds provided by Zhou et al. [67] for all datasets. All reported results are averages over three independent runs. + +Evaluated Scenarios. We evaluate KDPL on the following scenarios: + +- Domain Generalization. To assess the ability of the learned prompts to generalize to out-of-distribution datasets, we apply the prompt learned from ImageNet [12] to four different versions of ImageNet datasets exhibiting various types of domain shift. The target datasets are ImageNetV2 [45], ImageNet-Sketch [54], ImageNet-A [25], and ImageNet-R [24]. + +- Cross-dataset Transfer. To evaluate the ability of learned prompts to generalize to unseen classes, we evaluate the same prompt trained on ImageNet on a broad range of downstream recognition tasks. We validate on ten datasets with varying characteristics: Caltech101 [20] for general object classification; OxfordPets [43], StanfordCars [32], Flowers102 [41], Food101 [6], and FGVCAircraft [39] for fine-grained classification; the Describable Textures Dataset (DTD) [11] for texture classification; EuroSAT [23] for satellite-image recognition; and UCF101 [53] for action recognition. +- Generalization to Unseen Classes. To evaluate how learned prompts generalize to unseen classes from the same dataset, we divide classes into two subsets: base and novel classes. The prompt is trained exclusively on the base classes and then tested on the novel ones. We evaluate on ImageNet as well as the ten benchmark datasets used for cross-dataset evaluation. +- Class Agnostic Adaptation. In addition we introduce a novel evaluation setting in which the training class names are unknown. The prompt is trained on ImageNet and tested on all the benchmark datasets used in the domain generalization and cross-dataset evaluations. + +Implementation Details. We use a CLIP model with a ViT-H-14 visual backbone as the teacher model. For student models, we evaluate both on a CLIP model based on ResNet-50 and a model based on ViT-B/32. By experimenting with both ResNet-based and ViT-based CLIP models we show the architecture independence of our approach. To assess how KDPL performs when integrated into different prompt learning techniques, we selected five distinct textual, visual, and multimodal approaches. With the ResNet-50 student model, we experiment with CoOp [67] and CoCoOp [66]. For the ViT-B/32 student, since it supports both visual and textual prompting, we experiment with CoOp [67], VPT [29], MaPLe [30] and PromptSRC [31]. + +We denote the integration of our unsupervised knowledge distillation strategy with a specific prompt learning technique by adding the suffix $+\mathrm{KDPL}$ to the name of the corresponding technique. For example, CoOp+KDPL refers to the application of KDPL to CoOp. For class agnostic settings we instead use the suffix $+\mathrm{CA}$ -KDPL to indicate that no training class names are used. + +Unless otherwise stated, all experiments are conducted in the few-shot setting with 16 examples per class randomly sampled from the training set. We set the temperature hyperparameter $\tau$ in Eq. (1) to 0.01. In the class agnostic experiments in which we assume no knowledge of class names in the training set, we set the number of class names selected in each iteration to $K = 1000$ . + +For each prompt learning method we use the original implementation and hyperparameters reported in the respective papers. Since we use the compact ResNet-50 and ViT-B/32 backbones, we cannot directly compare to the originally published results. Thus, all numbers we report here were computed by us and are averages over three independent runs. See Section A in the Supplementary Material for additional implementation details. + +Table 1: Domain Generalization. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting, the prompt is trained on ImageNet (source) and then tested on four different versions of ImageNet (targets) that exhibit some kind of domain shift. Average performance improvements over the baselines are shown in green, and average performance deterioration in red. + +
BackboneMethodSourceTarget
ImageNet-V2-S-A-RAverage
RN50CLIP (student)58.2051.5033.3021.7056.0040.63
CoOp62.4055.1733.7023.1356.2042.05
CoOp + KDPL62.7355.3735.2023.2757.7742.90
CoCoOp63.0755.5334.7723.7359.4743.38
CoCoOp + KDPL62.7055.6035.3023.4357.9043.06
ViT-B/32CLIP (student)62.0054.7040.8029.6066.0047.78
CoOp66.3358.3041.4031.4765.8749.26
CoOp + KDPL65.9758.1042.5031.6367.3749.90
VPT64.9756.7341.2727.0066.5047.88
VPT + KDPL65.1057.3741.6727.7767.4748.57
MaPLe66.8058.5342.2330.1366.4049.32
MaPLe + KDPL66.5058.4742.7729.8767.7049.70
PromptSRC66.3358.7042.9732.0768.9350.67
PromptSRC + KDPL66.2758.6043.0731.7068.8350.55
ViT-H/14CLIP (teacher)82.8076.6071.1071.1091.3077.53
+ +# 4.2 Results on Domain Generalization + +Table 1 outlines the performance in the domain generalization setting. We report the performance of each baseline method alongside their unsupervised KDPL variants. Additionally, the performance of the zero-shot CLIP student and teacher models using a handcrafted prompt is included for comparison. We observe that applying our unsupervised approach to each baseline does not result in a significant decrease in performance on the source dataset. Notably, when transferring the learned prompts to a different domain, incorporating KDPL in each baseline can lead to a slight improvement. This suggests that our unsupervised teacher-student distillation learns prompts that generalize better than those trained using ground-truth labels. The only exceptions where we observe an average decrease compared to the baseline are when using CoCoOp or PromptSRC. CoCoOp-KDPL achieves an average accuracy significantly lower than CoCoOp only on the ImageNet-R dataset. Finally, note that all our unsupervised KDPL variants significantly improve the performance over the zero-shot CLIP student model in both the source and the target datasets. + +Table 2: Cross-dataset Transfer. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). The prompt is learned on ImageNet and then tested on the ten different target datasets. Average performance improvements over the baselines are indicated in green. + +
BackboneMethodTarget
OxfordPetsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)83.7061.0015.6040.0024.2055.6075.2058.5086.0058.3055.81
CoOp84.6061.6313.7736.8322.3354.2075.0359.0087.6757.7355.28
CoOp + KDPL87.3362.8314.9739.2730.1756.6077.2760.3088.5758.6357.59
CoCoOp86.9363.4716.2740.5327.2055.4777.7361.4088.0760.4357.75
CoCoOp + KDPL87.3364.9715.9741.2729.1756.8378.0061.5088.5059.5358.31
ViT-B/32CLIP (student)85.0064.3018.2042.8038.1060.4079.1062.0091.1060.7060.17
CoOp87.1362.2012.1340.5736.9757.8380.1362.8391.1361.8059.27
CoOp + KDPL87.1362.2315.5740.4040.9358.8380.5764.2392.7761.6360.43
VPT87.4364.7719.5344.2028.4757.6078.2763.7391.4062.5059.79
VPT + KDPL87.4364.4317.7742.9330.8057.9778.4763.6392.0062.7759.82
MaPLe88.3766.4318.4742.0337.7760.0080.1064.4391.3362.5061.14
MaPLe + KDPL88.2764.7717.3343.1337.1359.9380.4765.4393.4362.7061.26
PromptSRC88.1365.3317.1743.9040.5060.1781.2365.4092.3763.6361.78
PromptSRC + KDPL88.1765.1018.2343.2744.3060.4380.9065.6793.6363.4062.31
ViT-H/14CLIP (teacher)94.8089.4063.2066.8063.3095.6093.6076.4097.9076.4081.74
+ +# 4.3 Results on Cross-dataset Transfer + +In Table 2 we present the results of the cross-dataset evaluation setting in which the prompt is trained on ImageNet and tested on ten different target datasets. For all datasets our KDPL-based variants consistently outperform the corresponding baselines and demonstrate superior generalization performance. The greater generalization capabilities of KDPL are evident even for fine-grained datasets like EuroSAT, on which the CoOp+KDPL achieves an $8\%$ improvement over the baseline CoOp when using ResNet-50 as the backbone. Although adding KDPL yields only minor improvement to the VPT and MaPLe prompt learning techniques, we emphasize that our VPT+KDPL and MaPLe+KDPL do not have access to ground-truth labels. Notably, PromptSRC+KDPL achieves the highest average performance. + +# 4.4 Results on Generalization to Unseen Classes + +In Table 3 we give results for the unseen class generalization task. In these experiments each dataset is split into $50\%$ of the classes as a base for training few-shot adaptation, and the remaining $50\%$ as new classes on which zero-shot performance is evaluated. KDPL consistently outperforms the corresponding baseline + +Table 3: Generalization to Unseen Classes. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting the prompt is tested on classes never observed during training. Average performance improvements over the baselines are indicated in green. + +
BackboneMethodUnseen Classes
ImageNetOxfordPntsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)60.1093.7071.3024.8053.9043.7066.6082.2070.1090.5067.8065.88
CoOp60.0091.6358.3022.1740.9342.1359.8782.0366.7787.5357.6360.82
CoOp + KDPL60.5394.9763.4021.2738.7062.0756.6383.0769.8388.7562.6363.80
CoCoOp63.0794.9367.4724.8745.4035.1064.7384.5072.8790.7364.6764.39
CoCoOp + KDPL62.4395.1069.1724.5748.0055.9363.7085.6773.3390.5366.4066.80
ViT-B/32CLIP (student)64.0096.3072.3028.3053.9061.5069.8085.7073.1094.0071.6070.05
CoOp64.5393.3759.7723.0345.5749.1361.7385.5069.3792.1365.6064.52
CoOp + KDPL64.9094.0056.1722.0047.3362.0762.3787.2374.1793.4366.2066.35
VPT64.6094.8366.0329.7050.1750.0369.9085.8375.1392.5769.4768.02
VPT + KDPL65.2095.2067.8730.4047.5354.9769.8086.3375.1792.8071.0768.76
MaPLe66.7096.8769.7720.4353.5066.7068.0387.4776.5792.2769.4069.79
MaPLe + KDPL66.7396.8768.2327.3750.3375.7068.4087.8376.8393.6773.5371.41
PromptSRC65.9396.3071.3723.6754.4361.9770.0087.1376.7794.7072.6370.45
PromptSRC + KDPL66.3396.4768.8328.4350.8774.1768.5087.6377.3394.4774.7371.61
ViT-H/14CLIP (teacher)84.1099.2085.6064.3075.0082.6098.2096.3085.1097.3085.2086.63
+ +methods for both backbones, demonstrating improvement in all scenarios for the majority of the datasets. On average, the performance improvement over the supervised baseline methods ranges from about $1\%$ for VPT to about $3\%$ for CoOp with the ResNet-50 backbone. See Section C.1 in the Supplementary Material for further analysis of base and unseen performance. + +# 4.5 Results on Class Agnostic Adaptation + +Figure 3(a-b) summarizes the main results in the proposed Class Agnostic (CA) scenario in which even the training class names are unknown at training time. We report the accuracy on the ImageNet dataset (source), as well as the average accuracy in domain generalization and cross-dataset settings. Note that, even without knowing the class names, the performance on the source dataset steadily improves compared to the zero-shot CLIP model. Moreover, the prompts learned via the proposed unsupervised class agnostic knowledge distillation also exhibit improved average domain generalization $(\mathrm{AVG}^1)$ and cross-dataset capabilities $(\mathrm{AVG}^2)$ . Figure 3(b) visually depicts how the ResNet-50-based CoOp + CA-KDPL compares with supervised CoOp and zero-shot CLIP student performance in the cross-dataset transfer setting. Notably, CA-KDPL outperforms both baselines despite being unsupervised and class agnostic during training. + +
MethodSourceAVG1AVG2
ResNet-50 (student)58.2040.6355.81
CoOp + CA-KDPL61.8343.0257.69
CoCoOp + CA-KDPL61.4343.1858.03
ViT-B/32 (student)62.0047.7860.17
CoOp + CA-KDPL64.7349.6360.74
VPT + CA-KDPL63.7347.8959.80
MaPLe + CA-KDPL65.2349.2861.23
PromptSRC + CA-KDPL65.0050.3761.93
+ +(a) Average class agnostic adaptation + +![](images/e07599925f4edd60a56da9c47d87cade6e2a0486c249cbfc761ed6cf11ec5067.jpg) +Fig. 3: Class agnostic adaptation. (a) Comparison between the zero-shot baselines and our class agnostic CA-KDPL variants (highlighted in cyan). The prompt is learned in an unsupervised and class agnostic setting on ImageNet and evaluated on the benchmark datasets for domain generalization $(\mathrm{AVG}^1)$ and cross-dataset $(\mathrm{AVG}^2)$ evaluations. Average performance improvements are indicated in green, and deterioration in red. (b) Per-dataset accuracy comparison between our unsupervised and class agnostic method $(\mathrm{CoOp + CA - KDPL})$ , the supervised baseline CoOp, and the zero-shot student on the cross-dataset benchmark datasets. + +(b) Per-dataset class agnostic adaptation + +# 5 Conclusion + +In this paper we proposed an approach to Knowledge Distillation Prompt Learning (KDPL) which is easily integrated into existing supervised prompt learning methods. Our experiments show that for CoOp, CoCoOp, VPT, MaPLe and PromptSRC adding KDPL: (1) renders them label agnostic by eliminating the need for ground-truth labels for few-shot adaptation; (2) can also render them class agnostic in cases where no knowledge of training class labels is available; and (3) remarkably improves generalization to downstream tasks. + +The additional computation cost incurred by distilling from a large VLM is a limitation of KDPL, though all encoder parameters are fixed and the predictions of the teacher can be precomputed, which helps mitigate the extra cost. This extra computation only amounts to about a $15\%$ increase for MaPLe. + +Note that we did not tune any hyperparameters when training the KDPL variants. We use the same settings as in the original papers, which are likely suboptimal for distillation-based adaptation. With careful tuning, there is potential for improvement. Our experiments indicate that distillation-learned prompts are more transferable, and we think it would be interesting to see if this idea can generalize to very different downstream tasks and scale to even bigger teacher models or - more interestingly - to even smaller student models. + +# Acknowledgements + +This work was supported by funding from the European Commission Horizon 2020 grant #951911 (AI4Media). + +# References + +1. Abdul Samadh, J., Gani, M.H., Hussein, N., Khattak, M.U., Naseer, M.M., Shahbaz Khan, F., Khan, S.H.: Align your prompts: Test-time prompting with distribution alignment for zero-shot generalization. Advances in Neural Information Processing Systems 36 (2024) +2. Agnolucci, L., Baldrati, A., Todino, F., Becattini, F., Bertini, M., Del Bimbo, A.: Eco: Ensembling context optimization for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2811-2815 (2023) +3. Baldrati, A., Agnolucci, L., Bertini, M., Del Bimbo, A.: Zero-shot composed image retrieval with textual inversion. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15338-15347 (October 2023) +4. Barraco, M., Cornia, M., Cascianelli, S., Baraldi, L., Cucchiara, R.: The unreason-able effectiveness of clip features for image captioning: an experimental analysis. In: proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4662-4670 (2022) +5. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10925-10934 (2022) +6. Bossard, L., Guillaume, M., Van Gool, L.: Food-101-mining discriminative components with random forests. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part VI 13. pp. 446-461. Springer (2014) +7. Bulat, A., Tzimiropoulos, G.: Lasp: Text-to-text optimization for language-aware soft prompting of vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23232-23241 (2023) +8. Chen, G., Yao, W., Song, X., Li, X., Rao, Y., Zhang, K.: Plot: Prompt learning with optimal transport for vision-language models. In: The Eleventh International Conference on Learning Representations (2022) +9. Chen, W.C., Chang, C.C., Lee, C.R.: Knowledge distillation with feature maps for image classification. In: Computer Vision-ACCV 2018: 14th Asian Conference on Computer Vision, Perth, Australia, December 2-6, 2018, Revised Selected Papers, Part III 14. pp. 200-215. Springer (2019) +10. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023) +11. Cimpoi, M., Maji, S., Kokkinos, I., Mohamed, S., Vedaldi, A.: Describing textures in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3606-3613 (2014) +12. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009) + +13. Desai, K., Johnson, J.: Virtex: Learning visual representations from textual annotations. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11162-11173 (2021) +14. Ding, Y., Liu, L., Tian, C., Yang, J., Ding, H.: Don't stop learning: Towards continual learning for the clip model. arXiv preprint arXiv:2207.09248 (2022) +15. Dong, X., Bao, J., Zhang, T., Chen, D., Gu, S., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N.: Clip itself is a strong fine-tuner: Achieving 85.7% and 88.0% top-1 accuracy with vit-b and vit-l on imagenet. arXiv preprint arXiv:2212.06138 (2022) +16. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020) +17. Dou, Q., Liu, Q., Heng, P.A., Glocker, B.: Unpaired multi-modal segmentation via knowledge distillation. IEEE transactions on medical imaging 39(7), 2415-2425 (2020) +18. Fang, A., Jose, A.M., Jain, A., Schmidt, L., Toshev, A.T., Shankar, V.: Data filtering networks. In: The Twelfth International Conference on Learning Representations (2023) +19. Fang, Z., Wang, J., Wang, L., Zhang, L., Yang, Y., Liu, Z.: Seed: Self-supervised distillation for visual representation. In: International Conference on Learning Representations (2020) +20. Fei-Fei, L., Fergus, R., Perona, P.: Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories. In: 2004 conference on computer vision and pattern recognition workshop. pp. 178-178. IEEE (2004) +21. Gu, X., Lin, T.Y., Kuo, W., Cui, Y.: Open-vocabulary object detection via vision and language knowledge distillation. In: International Conference on Learning Representations (2021) +22. He, T., Shen, C., Tian, Z., Gong, D., Sun, C., Yan, Y.: Knowledge adaptation for efficient semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 578-587 (2019) +23. Helber, P., Bischke, B., Dengel, A., Borth, D.: Eurosat: A novel dataset and deep learning benchmark for land use and land cover classification. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 12(7), 2217-2226 (2019) +24. Hendrycks, D., Basart, S., Mu, N., Kadavath, S., Wang, F., Dorundo, E., Desai, R., Zhu, T., Parajuli, S., Guo, M., et al.: The many faces of robustness: A critical analysis of out-of-distribution generalization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8340-8349 (2021) +25. Hendrycks, D., Zhao, K., Basart, S., Steinhardt, J., Song, D.: Natural adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15262-15271 (2021) +26. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. stat 1050, 9 (2015) +27. Huang, T., Chu, J., Wei, F.: Unsupervised prompt learning for vision-language models. arXiv preprint arXiv:2204.03649 (2022) +28. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021) + +29. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: European Conference on Computer Vision (2022) +30. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023) +31. Khattak, M.U., Wasim, S.T., Naseer, M., Khan, S., Yang, M.H., Khan, F.S.: Self-regulating prompts: Foundational model adaptation without forgetting. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15190-15200 (2023) +32. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013) +33. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision (IJCV) 128(7), 1956-1981 (2020) +34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. pp. 3045-3059 (2021) +35. Li, X.L., Liang, P.: Prefix-tuning: Optimizing continuous prompts for generation. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 4582-4597 (2021) +36. Li, Z., Li, X., Fu, X., Zhang, X., Wang, W., Chen, S., Yang, J.: Promptkd: Unsupervised prompt distillation for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 26617-26626 (2024) +37. Lu, Y., Liu, J., Zhang, Y., Liu, Y., Tian, X.: Prompt distribution learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5206-5215 (2022) +38. Lüddecke, T., Ecker, A.: Image segmentation using text and image prompts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7086-7096 (2022) +39. Maji, S., Rahtu, E., Kannala, J., Blaschko, M., Vedaldi, A.: Fine-grained visual classification of aircraft. arXiv preprint arXiv:1306.5151 (2013) +40. Mullapudi, R.T., Chen, S., Zhang, K., Ramanan, D., Fatahalian, K.: Online model distillation for efficient video inference. In: Proceedings of the IEEE/CVF International conference on computer vision. pp. 3573-3582 (2019) +41. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: 2008 Sixth Indian conference on computer vision, graphics & image processing. pp. 722-729. IEEE (2008) +42. Parelli, M., Delitzas, A., Hars, N., Vlassis, G., Anagnostidis, S., Bachmann, G., Hofmann, T.: Clip-guided vision-language pre-training for question answering in 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5606-5611 (2023) +43. Parkhi, O.M., Vedaldi, A., Zisserman, A., Jawahar, C.: Cats and dogs. In: 2012 IEEE conference on computer vision and pattern recognition. pp. 3498-3505. IEEE (2012) +44. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from + +natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) +45. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: DoImagenet classifiers generalize toImagenet? In: International conference on machine learning. pp. 5389-5400. PMLR (2019) +46. Ren, S., Zhang, A., Zhu, Y., Zhang, S., Zheng, S., Li, M., Smola, A.J., Sun, X.: Prompt pre-training with twenty-thousand classes for open-vocabulary visual recognition. Advances in Neural Information Processing Systems 36 (2024) +47. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortzman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278–25294 (2022) +48. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021) +49. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023) +50. Shi, Z., Lipani, A.: DePT: Decomposed prompt tuning for parameter-efficient fin-tuning. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=KjegfPGRde +51. Siam, M., Jiang, C., Lu, S., Petrich, L., Gamal, M., Elhoseiny, M., Jagersand, M.: Video object segmentation using teacher-student adaptation in a human robot interaction (hri) setting. In: 2019 International Conference on Robotics and Automation (ICRA). pp. 50-56. IEEE (2019) +52. Song, H., Dong, L., Zhang, W., Liu, T., Wei, F.: Clip models are few-shot learners: Empirical studies on vqa and visual entailment. In: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). pp. 6088-6100 (2022) +53. Soomro, K., Zamir, A.R., Shah, M.: Ucf101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012) +54. Wang, H., Ge, S., Lipton, Z., Xing, E.P.: Learning robust global representations by penalizing local predictive power. Advances in Neural Information Processing Systems 32 (2019) +55. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023) +56. Xu, G., Liu, Z., Li, X., Loy, C.C.: Knowledge distillation meets self-supervision. In: European Conference on Computer Vision. pp. 588-604. Springer (2020) +57. Yao, H., Zhang, R., Xu, C.: Visual-language prompt tuning with knowledge-guided context optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6757-6767 (2023) +58. Yuan, L., Tay, F.E., Li, G., Wang, T., Feng, J.: Revisiting knowledge distillation via label smoothing regularization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3903-3911 (2020) +59. Yun, S., Park, J., Lee, K., Shin, J.: Regularizing class-wise predictions via self-knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13876-13885 (2020) +60. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proceedings of the + +IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18123-18133 (2022) +61. Zhang, R., Fang, R., Zhang, W., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free clip-adapter for better vision-language modeling. arXiv preprint arXiv:2111.03930 (2021) +62. Zhang, Y., Xiang, T., Hospedales, T.M., Lu, H.: Deep mutual learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4320-4328 (2018) +63. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 11953-11962 (2022) +64. Zhong, Z., Friedman, D., Chen, D.: Factual probing is [mask]: Learning vs. learning to recall. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5017-5033 (2021) +65. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022) +66. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022) +67. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022) +68. Zhu, B., Niu, Y., Han, Y., Wu, Y., Zhang, H.: Prompt-aligned gradient for prompt tuning. In: 2023 IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15613-15623. IEEE Computer Society (2023) \ No newline at end of file diff --git a/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/images.zip b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..6c4149a1d61fade43cd47607955307ac1e2f8883 --- /dev/null +++ b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cd3f064a68e6ca1b921ae2ba0b24ad0d3d9cbd0efc40a731c4b8204fa33c1ce9 +size 491513 diff --git a/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/layout.json b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..dfcbb58b58ddc386cf3f806b8dadc4519ba98b86 --- /dev/null +++ b/2024/Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation/layout.json @@ -0,0 +1,10003 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "text", + "content": "Improving Zero-shot Generalization of Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 203, + 168, + 410, + 194 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 203, + 168, + 410, + 194 + ], + "spans": [ + { + "bbox": [ + 203, + 168, + 410, + 194 + ], + "type": "text", + "content": "*Marco Mistretta1, *Alberto Baldrati1,2, Marco Bertini1, and Andrew D. Bagdanov1" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 140, + 201, + 473, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 201, + 473, + 213 + ], + "spans": [ + { + "bbox": [ + 140, + 201, + 473, + 213 + ], + "type": "text", + "content": "1 University of Florence - Media Integration and Communication Center (MICC)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 266, + 213, + 349, + 224 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 266, + 213, + 349, + 224 + ], + "spans": [ + { + "bbox": [ + 266, + 213, + 349, + 224 + ], + "type": "text", + "content": "2 University of Pisa" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 251, + 225, + 362, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 251, + 225, + 362, + 236 + ], + "spans": [ + { + "bbox": [ + 251, + 225, + 362, + 236 + ], + "type": "text", + "content": "Florence, Italy - Pisa, Italy" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 252, + 236, + 361, + 246 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 236, + 361, + 246 + ], + "spans": [ + { + "bbox": [ + 252, + 236, + 361, + 246 + ], + "type": "text", + "content": "{name.surname}@unifi.it" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 280, + 455, + 478 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 280, + 455, + 478 + ], + "spans": [ + { + "bbox": [ + 159, + 280, + 455, + 478 + ], + "type": "text", + "content": "Abstract. Vision-Language Models (VLMs) demonstrate remarkable zero-shot generalization to unseen tasks, but fall short of the performance of supervised methods in generalizing to downstream tasks with limited data. Prompt learning is emerging as a parameter-efficient method for adapting VLMs, but state-of-the-art approaches require annotated samples. In this paper we propose a novel approach to prompt learning based on unsupervised knowledge distillation from more powerful models. Our approach, which we call Knowledge Distillation Prompt Learning (KDPL), can be integrated into existing prompt learning techniques and eliminates the need for labeled examples during adaptation. Our experiments on more than ten standard benchmark datasets demonstrate that KDPL is very effective at improving generalization of learned prompts for zero-shot domain generalization, zero-shot cross-dataset generalization, and zero-shot base-to-novel class generalization problems. KDPL requires no ground-truth labels for adaptation, and moreover we show that even in the absence of any knowledge of training class names (CA-KDPL) can be used to effectively transfer knowledge. The code is publicly available at https://github.com/miccunifi/KDPL." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "spans": [ + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "text", + "content": "Keywords: Prompt Learning " + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "text", + "content": " Unsupervised Knowledge Distillation " + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "text", + "content": " Vision-Language Models " + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "text", + "content": " Few-Shot Learning " + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 488, + 453, + 510 + ], + "type": "text", + "content": " Zero-shot Transfer." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 533, + 230, + 547 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 533, + 230, + 547 + ], + "spans": [ + { + "bbox": [ + 132, + 533, + 230, + 547 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 560, + 482, + 644 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 560, + 482, + 644 + ], + "spans": [ + { + "bbox": [ + 130, + 560, + 482, + 644 + ], + "type": "text", + "content": "Vision-Language Models (VLMs) like Contrastive Language-Image Pre-training (CLIP) are remarkably effective at zero-shot generalization to downstream tasks [3,42,44,65]. These models leverage a dual encoder architecture and are trained to align image and text features in a shared embedding space. CLIP and similar models are able to perform zero-shot classification by predicting the output class based on the similarity between the test image embedding and text embeddings of words from a fixed vocabulary." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 653, + 337, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 337, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 337, + 665 + ], + "type": "text", + "content": "* These authors contributed equally to this work." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 321, + 269 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 321, + 269 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 321, + 269 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 321, + 269 + ], + "type": "image", + "image_path": "a2e6a564cca2a1ba0a22df9d60e4b5b08049a84ae5442e4a002e8db7fe4ce7ba.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 277, + 482, + 365 + ], + "lines": [ + { + "bbox": [ + 130, + 277, + 482, + 365 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 482, + 365 + ], + "type": "text", + "content": "Fig. 1: Motivation and overview. (Top left) Lightweight VLMs like CLIP achieve impressive zero-shot performance but lag behind supervised approaches; large VLMs incur a high computational burden. (Bottom left) Parameter-efficient prompt learning offers a non-destructive approach to adapting VLMs to downstream tasks; however, existing methods require annotated samples and struggle to generalize to unseen classes. (Right) Our approach does not require labeled samples and learns by distilling knowledge from a more powerful VLM. It can be seamlessly integrated into existing prompt learning techniques and generalizes better to unseen classes on downstream tasks." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 326, + 114, + 482, + 264 + ], + "blocks": [ + { + "bbox": [ + 326, + 114, + 482, + 264 + ], + "lines": [ + { + "bbox": [ + 326, + 114, + 482, + 264 + ], + "spans": [ + { + "bbox": [ + 326, + 114, + 482, + 264 + ], + "type": "image", + "image_path": "3a244238893de675128bf7a03f118399fc7b12e421686c530bf3392bdca78ec7.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 389, + 482, + 449 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 482, + 449 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 482, + 449 + ], + "type": "text", + "content": "While CLIP exhibits remarkable zero-shot performance, it can fall short of supervised adaptation. Narrowing this gap through fine-tuning is challenging when large training datasets are not available for downstream tasks. Moreover, fine-tuning can also lead to overfitting and is destructive in that it can cause the model to forget knowledge acquired during large-scale pre-training [14,67]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 450, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 450, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 450, + 482, + 533 + ], + "type": "text", + "content": "An intuitive way to achieve better performance is to use larger and more powerful VLMs [10] with better zero-shot generalization. However, though performance improves with increasing size, their practical applicability in real-world scenarios decreases. Lightweight CLIP models based on ResNet-50 and ViT-B/32 require about 18 and 14 GFLOPs for inference, respectively. In contrast, more powerful models based on ViT-H/14 [10,18] require nearly " + }, + { + "bbox": [ + 130, + 450, + 482, + 533 + ], + "type": "inline_equation", + "content": "30 \\times" + }, + { + "bbox": [ + 130, + 450, + 482, + 533 + ], + "type": "text", + "content": " the computation at 381 GFLOPs [18] for inference." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": "To address these challenges, parameter-efficient prompt learning is emerging as a promising and non-destructive approach to adapting VLMs to downstream tasks [34,35,64]. Zhou et al. [67] proposed a text-only prompt learning approach called CoOp to overcome the limitations of manually crafted prompts. Subsequently, Jia et al. [29] extended prompt learning to the visual domain with Visual Prompt Tuning (VPT), and Khattak et al. [30,31] proposed a multi-modal prompt learning approach called MaPLe [30] and a self-regulated approach called PromptSRC [31]. Although significantly improving over carefully tuned, handcrafted prompts, these state-of-the-art techniques all require annotated samples from the dataset and have problems generalizing to other datasets or classes unseen during training [30,66]." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 258 + ], + "type": "text", + "content": "To eliminate the need for labeled training examples and improve the generalization of learned prompts, we propose a novel approach to prompt learning which we call Knowledge Distillation Prompt Learning (KDPL). KDPL adapts lightweight VLMs and improves performance on downstream tasks by distilling knowledge from a more powerful VLM without the need for annotated examples. KDPL is a flexible method that can be seamlessly integrated into existing prompt learning framework such as CoOp [67], CoCoOp [66], VPT [29], MaPLe [30], and PromptSRC [31]. Figure 1 summarizes the motivations and illustrates the workflow of the proposed approach. We validate KDPL on two increasingly challenging scenarios: in the first, we assume knowledge of training class names, while in the second we assume no knowledge of training classes. Importantly, in both scenarios no annotated training samples are used." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 147, + 260, + 301, + 270 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 260, + 301, + 270 + ], + "spans": [ + { + "bbox": [ + 147, + 260, + 301, + 270 + ], + "type": "text", + "content": "The contributions of this work are:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 278, + 483, + 431 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 278, + 479, + 312 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 278, + 479, + 312 + ], + "spans": [ + { + "bbox": [ + 138, + 278, + 479, + 312 + ], + "type": "text", + "content": "- we propose a novel parameter-efficient prompt-learning approach that eliminates the need for labeled training examples by distilling knowledge from a large Vision-Language Model;" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 315, + 480, + 359 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 315, + 480, + 359 + ], + "spans": [ + { + "bbox": [ + 138, + 315, + 480, + 359 + ], + "type": "text", + "content": "- we show that our approach can be integrated into existing prompt learning techniques to learn visual, textual, and multimodal prompts which generalize significantly better than state-of-the-art baselines to unseen classes in downstream tasks:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 361, + 483, + 407 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 361, + 483, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 361, + 483, + 407 + ], + "type": "text", + "content": "- we demonstrate the effectiveness of our approach through extensive experiments on more than ten standard benchmark datasets covering a broad range of downstream problems, including domain generalization, cross-dataset adaptation, and base-to-novel generalization; and" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 410, + 479, + 431 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 410, + 479, + 431 + ], + "spans": [ + { + "bbox": [ + 138, + 410, + 479, + 431 + ], + "type": "text", + "content": "- we introduce a new, class agnostic evaluation setting in which training class names are unknown and show the superiority of our approach in this scenario." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 441, + 482, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 482, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 482, + 489 + ], + "type": "text", + "content": "To the best of our knowledge ours is the first approach to parameter-efficient VLM adaptation which is applicable in scenarios that are label agnostic (i.e. no label supervision is required during adaptation) and also in scenarios that are additionally class agnostic (i.e. no knowledge of training class names is assumed)." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 506, + 237, + 517 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 506, + 237, + 517 + ], + "spans": [ + { + "bbox": [ + 132, + 506, + 237, + 517 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 530, + 479, + 541 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 530, + 479, + 541 + ], + "spans": [ + { + "bbox": [ + 130, + 530, + 479, + 541 + ], + "type": "text", + "content": "In this section we review the recent literature most relevant to our contribution." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "content": "Vision-Language Models. Vision-Language Models (VLMs) learn robust visual representations thanks to their extensive pre-training on image-caption datasets [47, 48]. These representations are very effective at generalizing to a variety of downstream tasks [13, 28, 44]. In contrast to vision models trained only with image supervision, vision-language models can interpret both visual and textual data, showing improvement in tasks requiring cross-model understanding [3, 4, 52]. We focus on contrastively-trained VLMs such as CLIP [44], ALIGN [28], and LiT [60]. These models use a dual encoder architecture and contrastive learning to align images and text in a common embedding space. Thanks to this shared embedding space and massive pre-training datasets these" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 164 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 164 + ], + "type": "text", + "content": "models achieve remarkable performance. However, there is still a gap between the zero-shot capabilities of these VLMs and the performance of tailored state-of-the-art models [15,44], and thus there is active research on efficient and effective methods to adapt VLMs to downstream tasks [21,38,55,61]." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 171, + 480, + 243 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 171, + 480, + 243 + ], + "spans": [ + { + "bbox": [ + 132, + 171, + 480, + 243 + ], + "type": "text", + "content": "Prompt Learning. The performance of VLMs is highly dependent on textual prompts used to characterize downstream tasks. Given the significant impact of small changes in wording on performance, the manual generation of optimal textual prompts is a challenging task. Inspired by developments in NLP [34,35, 64], CoOp [67] proposes to learn continuous vectors in the word embedding space instead of using tailored hand-crafted prompts." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 247, + 481, + 391 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 247, + 481, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 247, + 481, + 391 + ], + "type": "text", + "content": "The promising results of CoOp have attracted considerable interest in prompt learning for VLMs [1, 2, 7, 8, 30, 31, 37, 49, 50, 57, 68]. CoCoOp, in particular, highlights the poor performance of CoOp on unseen classes and uses image-conditional dynamic prompts to improve generalization [66]. PLOT [8] instead is based on learning multiple prompts by exploiting local visual features. Kg-CoOp [57] adds a regularization loss to minimize the discrepancy between learned and hand-crafted prompts, while VPT [29] adapts prompt learning to the visual domain by learning continuous vectors in the input space of a ViT [16]. Finally, MaPLe [30] introduces a multimodal prompt learning strategy for VLMs. PromptSRC [31] introduces a self-regularization framework for prompting, addressing overfitting through agreement with a frozen model, a self-ensemble of prompts, and textual diversity." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 395, + 480, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 395, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 395, + 480, + 502 + ], + "type": "text", + "content": "Similar to the approach we propose in this paper, UPL [27] performs prompt learning without relying on annotated samples. It leverages pseudolabels derived from a larger CLIP model and selects the top-K most confident samples per class to construct a balanced set of pseudo-labels. UPL requires a substantial collection of unlabeled images and is not directly applicable when only a few unlabeled samples are available, like in the few-shot adaptation scenarios considered here. In contrast to UPL, KDPL does not use pseudolabeling; instead, we directly learn from the logits of a CLIP teacher model via knowledge distillation, thus eliminating the need for any selection strategy of the training samples." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 510, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 481, + 665 + ], + "type": "text", + "content": "Knowledge Distillation. Knowledge distillation (KD) is a machine learning technique in which a simple model (student) is trained to mimic the behavior of a larger model (teacher) by learning from its output or intermediate activation [26]. This technique has found success in many contexts, including image classification [5,9,26], self-supervised learning [19,56], and image/video segmentation [17, 22, 40, 51], leading to improvements in model compression, computational efficiency, and performance. DML [62] introduces a mutual learning approach to train students and teachers simultaneously. DKD [63] reformulates the classical KD loss into a term related to the target class and a term related to the non-target classes. In contrast to the majority of knowledge distillation approaches [58, 59, 62, 63], we do not utilize any labels during training. Instead, we solely employ the distillation loss. In our work, we apply knowledge distillation in a parameter-efficient prompt learning scenario. Specifically, we distill" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "knowledge from a large and powerful VLM (teacher) into a lightweight VLM (student) by updating only a reduced number of parameters (the prompt)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 144, + 482, + 288 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 144, + 482, + 288 + ], + "spans": [ + { + "bbox": [ + 130, + 144, + 482, + 288 + ], + "type": "text", + "content": "Techniques Using Teacher-Student Distillation. Recently Li et al. [36] introduced PromptKD which also uses teacher-student distillation in prompt learning. Although it too leverages a larger teacher to guide a smaller student, it differs from our contribution in several key aspects. PromptKD uses PromptSRC [31] to pre-train the teacher model with labeled examples, whereas KDPL does not pre-train the teacher and requires no labeled examples. PromptKD uses an MLP to project the student image encoder output, which adds extra parameters. KDPL is instead a general framework with no additional parameters, adaptable to any prompt-tuning technique to render them completely unsupervised. Moreover, PromptKD uses the entire training set, including both base and novel images, for distillation. In contrast, KDPL follows the standard 16-shot setting." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 307, + 448, + 322 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 307, + 448, + 322 + ], + "spans": [ + { + "bbox": [ + 131, + 307, + 448, + 322 + ], + "type": "text", + "content": "3 Knowledge Distillation Prompt Learning (KDPL)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 334, + 479, + 358 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 334, + 479, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 479, + 358 + ], + "type": "text", + "content": "We first introduce preliminary concepts related to prompt learning and then describe our approach to applying knowledge distillation to the problem." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 376, + 228, + 388 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 376, + 228, + 388 + ], + "spans": [ + { + "bbox": [ + 131, + 376, + 228, + 388 + ], + "type": "text", + "content": "3.1 Preliminaries" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 398, + 480, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 398, + 480, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 398, + 480, + 434 + ], + "type": "text", + "content": "Our approach is based on knowledge distillation applied to prompt learning. Here we discuss the base teacher and student models (CLIPs) and five state-of-the-art prompt learning approaches into which we will incorporate KDPL." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "spans": [ + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": "CLIP. Contrastive Language-Image Pre-training (CLIP) is a vision-language model trained to align images and textual captions in shared semantic space [44]. CLIP consists of an image encoder " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "f_{\\theta}" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": " and a text encoder " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "g_{\\phi}" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": ". Given an image " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": ", the image encoder computes its feature representation " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "f_{\\theta}(I) \\in \\mathbb{R}^d" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "d" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": " is the size of the semantic embedding space. Similarly, for a given textual caption " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "Y" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": ", a word embedding layer " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "E_L" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": " maps each tokenized word to the token embedding space " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\mathcal{W}" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": ". Then, the text encoder " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "g_{\\phi}" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": " generates the textual feature representation " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "g_{\\phi}(E_L(Y)) \\in \\mathbb{R}^d" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": ". The main goal of CLIP training is to learn " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": " such that " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "f_{\\theta}(I) \\approx g_{\\phi}(E_L(Y))" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": " for associated image/text pairs " + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "inline_equation", + "content": "(I,Y)" + }, + { + "bbox": [ + 130, + 437, + 482, + 544 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": "When using a Vision Transformer (ViT) [16] as the visual encoder " + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "inline_equation", + "content": "f_{\\theta}" + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": ", the encoding process begins by splitting the image into " + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "inline_equation", + "content": "U" + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": " fixed-size patches. These patches are then projected into patch embeddings " + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\{w_1, w_2, \\ldots, w_U\\}" + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": ", where each " + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "inline_equation", + "content": "w_i" + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": " belongs to the patch embedding space " + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\mathcal{V}" + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": ". A learnable class (CLS) token " + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "inline_equation", + "content": "c_i" + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": " is concatenated with the patch embeddings, resulting in the input to the vision transformer being " + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "inline_equation", + "content": "\\{c_i, w_1, w_2, \\ldots, w_U\\}" + }, + { + "bbox": [ + 130, + 545, + 482, + 640 + ], + "type": "text", + "content": ". Finally, the CLS token of the final transformer layer is projected to the shared embedding space via a linear projection to obtain the final representation." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "To perform zero-shot classification using CLIP, we start with an image " + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": " and build a set of textual prompts " + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "\\{Y_{i}\\}_{i = 1}^{C}" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": " denotes the number of classes." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "Each handcrafted text prompt " + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "Y_{i}" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": " takes the format \"a photo of a " + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "[CLASS_{i}]" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "\", where " + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "CLASS_{i}" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": " represents a specific class name, such as airplane, bird, etc." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 479, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 479, + 164 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 479, + 164 + ], + "type": "text", + "content": "Then the feature representations " + }, + { + "bbox": [ + 130, + 140, + 479, + 164 + ], + "type": "inline_equation", + "content": "\\psi_I = f_\\theta(I)" + }, + { + "bbox": [ + 130, + 140, + 479, + 164 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 140, + 479, + 164 + ], + "type": "inline_equation", + "content": "\\psi_T^i = g_\\phi(E_L(Y_i))" + }, + { + "bbox": [ + 130, + 140, + 479, + 164 + ], + "type": "text", + "content": " are extracted using the CLIP encoders. The predicted probability for each class is:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 220, + 174, + 480, + 202 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 220, + 174, + 480, + 202 + ], + "spans": [ + { + "bbox": [ + 220, + 174, + 480, + 202 + ], + "type": "interline_equation", + "content": "p (y = i \\mid I) = \\frac {\\exp \\left(\\cos \\left(\\psi_ {T} ^ {i} , \\psi_ {I}\\right) / \\tau\\right)}{\\sum_ {j = 1} ^ {C} \\exp \\left(\\cos \\left(\\psi_ {T} ^ {j} , \\psi_ {I}\\right) / \\tau\\right)}, \\tag {1}", + "image_path": "b959959f6edf7af4fa030f2cf39da3416e13ca2175fb5bb419dc923ded25e382.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 205, + 473, + 217 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 205, + 473, + 217 + ], + "spans": [ + { + "bbox": [ + 130, + 205, + 473, + 217 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 205, + 473, + 217 + ], + "type": "inline_equation", + "content": "\\cos (\\cdot ,\\cdot)" + }, + { + "bbox": [ + 130, + 205, + 473, + 217 + ], + "type": "text", + "content": " is the cosine similarity and " + }, + { + "bbox": [ + 130, + 205, + 473, + 217 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 205, + 473, + 217 + ], + "type": "text", + "content": " is a temperature hyperparameter." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 220, + 479, + 245 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 220, + 479, + 245 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 479, + 245 + ], + "type": "text", + "content": "Prompt-Learning Techniques. Here we summarize how the state-of-the-art techniques for textual, visual, and multimodal prompt learning work." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 248, + 488, + 555 + ], + "type": "list", + "angle": 0, + "index": 12, + "blocks": [ + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "content": "- CoOp [67] is a textual prompt learning technique that learns continuous context tokens (i.e. the learnable prompt) in the CLIP token embedding space. Specifically, CoOp introduces " + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "content": " learnable vectors, " + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "inline_equation", + "content": "\\{v_{1}, v_{2}, \\ldots, v_{M}\\}" + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "content": " where each context vector " + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "inline_equation", + "content": "v_{i} \\in \\mathcal{W}" + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "content": ". For each of the " + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "inline_equation", + "content": "k" + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "content": " classes of a dataset, the input to the text encoder is " + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "inline_equation", + "content": "\\{v_{1}, v_{2}, \\ldots, v_{M}, c_{k}\\}" + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "inline_equation", + "content": "c_{k} = E_{L}([CLSAS_{k}])" + }, + { + "bbox": [ + 138, + 248, + 480, + 308 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "text", + "content": "- CoCoOp [66] extends CoOp by incorporating a lightweight network " + }, + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "inline_equation", + "content": "h_\\theta" + }, + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "text", + "content": ". Each context token is obtained as " + }, + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "inline_equation", + "content": "v_i(I) = v_i + \\pi" + }, + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "inline_equation", + "content": "\\pi = h_\\theta(I)" + }, + { + "bbox": [ + 138, + 308, + 480, + 342 + ], + "type": "text", + "content": ". This method ensures that the textual prompts are conditioned on the input image." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "spans": [ + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "text", + "content": "- VPT [29] is a visual prompt learning method that can be viewed as the counterpart of CoOp in the visual domain. Unlike CoOp, which operates entirely in the textual token embedding space " + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{W}" + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "text", + "content": ", VPT performs prompt learning in the visual patch embedding space " + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\mathcal{V}" + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "text", + "content": ". Specifically, VPT learns " + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "inline_equation", + "content": "P" + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "text", + "content": " visual tokens, leading to the input to the ViT being " + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "inline_equation", + "content": "\\{z_{1},\\ldots ,z_{P},c_{i},w_{1},w_{2},\\ldots ,w_{U}\\}" + }, + { + "bbox": [ + 138, + 343, + 480, + 437 + ], + "type": "text", + "content": ". VPT offers two prompting variants: deep and shallow. The deep variant learns a distinct prompt for each ViT layer, while the shallow variant incorporates the prompt parameters only into the input of the first layer." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 438, + 480, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 438, + 480, + 496 + ], + "spans": [ + { + "bbox": [ + 138, + 438, + 480, + 496 + ], + "type": "text", + "content": "- MaPLe [30] is a deep multi-modal prompt learning technique that promotes strong coupling between vision and language prompts. In practice, MaPLe learns different textual context tokens for each layer in " + }, + { + "bbox": [ + 138, + 438, + 480, + 496 + ], + "type": "inline_equation", + "content": "g_{\\phi}" + }, + { + "bbox": [ + 138, + 438, + 480, + 496 + ], + "type": "text", + "content": ". The visual prompts, on the other hand, are not directly learned but are obtained through a linear mapping from the textual ones." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 497, + 488, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 497, + 488, + 555 + ], + "spans": [ + { + "bbox": [ + 138, + 497, + 488, + 555 + ], + "type": "text", + "content": "- PromptSRC [31] is another multi-modal prompt learning technique that optimizes prompts through mutual agreement maximization between prompted and frozen model features using self-distillation, Gaussian-weighted prompt aggregation over the training session, and promoting textual diversity to address sample diversity imbalance." + } + ] + } + ], + "index": 11 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 561, + 479, + 597 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 561, + 479, + 597 + ], + "spans": [ + { + "bbox": [ + 130, + 561, + 479, + 597 + ], + "type": "text", + "content": "Note that methods involving visual prompt learnable tokens like VPT [29], MaPLe [30], and PromptSRC [31] can only be applied to VLMs equipped with a ViT-based image encoder." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 131, + 612, + 327, + 624 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 612, + 327, + 624 + ], + "spans": [ + { + "bbox": [ + 131, + 612, + 327, + 624 + ], + "type": "text", + "content": "3.2 Label Agnostic Prompt Learning" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 479, + 665 + ], + "type": "text", + "content": "The methods described above all rely on ground-truth labels during adaptation. Here we show how unsupervised knowledge distillation can be used instead to replace the need for annotated training examples." + } + ] + } + ], + "index": 15 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 243, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 243, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 243, + 101 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 114, + 475, + 216 + ], + "blocks": [ + { + "bbox": [ + 136, + 114, + 475, + 216 + ], + "lines": [ + { + "bbox": [ + 136, + 114, + 475, + 216 + ], + "spans": [ + { + "bbox": [ + 136, + 114, + 475, + 216 + ], + "type": "image", + "image_path": "e117afe262e4488118d77e09c2f91aa876dd0017e84a1a02c806300b0b8442d9.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "lines": [ + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "spans": [ + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "type": "text", + "content": "Fig. 2: Knowledge Distillation Prompt Learning (KDPL) overview. Given a lightweight VLM student and a larger, more powerful VLM teacher, KDPL updates the student prompt parameters by distilling knowledge from the teacher. KDPL first performs zero-shot classification with the teacher to obtain teacher probabilities " + }, + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "type": "inline_equation", + "content": "p_T" + }, + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "type": "text", + "content": ". It then computes the student probabilities " + }, + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "type": "inline_equation", + "content": "p_S" + }, + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "type": "text", + "content": " and performs knowledge distillation to update the student prompt parameters " + }, + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 222, + 482, + 288 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 312, + 482, + 418 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 312, + 482, + 418 + ], + "spans": [ + { + "bbox": [ + 130, + 312, + 482, + 418 + ], + "type": "text", + "content": "Overview. Our proposed approach, which we call Knowledge Distillation Prompt Learning (KDPL), is a general method designed to enhance the performance of the CLIP model on downstream tasks through parameter-efficient prompt learning. Unlike previous approaches [30,66,67], which rely on labeled examples for training, KDPL eliminates the need for manually-labeled samples by learning only through knowledge distillation from a larger and more powerful VLM. Note that KDPL is a method that can be seamlessly integrated with any existing prompt learning approach in scenarios where no information about class names or labels is available." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 419, + 482, + 504 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 419, + 482, + 504 + ], + "spans": [ + { + "bbox": [ + 130, + 419, + 482, + 504 + ], + "type": "text", + "content": "We validate KDPL in two progressively challenging supervision regimes. In the label agnostic scenario we do not use ground-truth labels, but we assume knowledge of the class names in the training dataset. In the class agnostic scenario (see Section 3.3) we go one step further and assume that even the training class names are unknown. For this class agnostic scenario we propose an effective and efficient online strategy for automatically filtering the classes from a large dictionary of approximately 20K class names [33]." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": "Prompt Learning via Unsupervised Knowledge Distillation (KDPL). Given a lightweight CLIP model (the student) and a larger, more powerful CLIP model (the teacher), we aim to improve the downstream performance of the student model by distilling knowledge from teacher to student. For an image " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": " and a set of classes " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "\\mathcal{C} = \\{\\mathrm{CLASS}_i\\}_{i=1}^C" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": ", we start by performing zero-shot classification using the frozen teacher model. Specifically, we use the teacher image encoder " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "f_{\\theta}^{B}" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": " and text encoder " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "g_{\\phi}^{B}" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": " to compute the teacher image features " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "\\psi_{I,B} = f_{\\theta}^{B}(I)" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": " and text features " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "\\psi_{T,B}^{i} = g_{\\phi}^{S}(E_L([\\mathrm{CLASS}_i]))" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": ". For the teacher model we use the fixed text prompt \"a photo of [CLASS]\". We then apply Eq. (1) to produce the probabilities " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "p_T(I,\\mathcal{C})" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": " predicted by the teacher on image " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": " for classes " + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 507, + 482, + 628 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 628, + 482, + 664 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 628, + 482, + 664 + ], + "spans": [ + { + "bbox": [ + 130, + 628, + 482, + 664 + ], + "type": "text", + "content": "The teacher model does not rely on a learnable prompt and its predictions remain fixed during training. Our aim is to learn text and image prompts for the student model that enhance its generalization to downstream tasks." + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": "We denote with " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "f_{\\theta}^{S}" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "g_{\\phi}^{S}" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " the student image and text encoders, respectively, and with " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " the parameters associated with the learnable student prompts (see Fig. 2). Given the same image " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " processed by the teacher and the same set of classes " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": ", the student extracts image features " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\psi_{I,S} = f_{\\theta,\\gamma}^{S}(I)" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " and text features " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\psi_{T,S}^{i} = g_{\\phi,\\gamma}^{S}(E_{L}([\\mathrm{CLASS}_{i}]))" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": ". Note that the text and image encoders can both depend on the prompt parameters " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": ". According to the prompt learning technique used, the " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " parameters can be used only by the text encoder (CoOp, CoCoOp), the visual encoder (VPT), or both (MaPLe, PromptSRC). Finally, using Eq. (1) we produce student class probabilities " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "p_{S}(I,\\mathcal{C})" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " predicted on image " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " for classes " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": ". Note that all encoder parameters except for the learnable prompt " + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 115, + 482, + 237 + ], + "type": "text", + "content": " are frozen." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 238, + 482, + 264 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 238, + 482, + 264 + ], + "spans": [ + { + "bbox": [ + 130, + 238, + 482, + 264 + ], + "type": "text", + "content": "We use the symmetric KL-divergence between the teacher " + }, + { + "bbox": [ + 130, + 238, + 482, + 264 + ], + "type": "inline_equation", + "content": "(p_T(I,\\mathcal{C}))" + }, + { + "bbox": [ + 130, + 238, + 482, + 264 + ], + "type": "text", + "content": " and the student " + }, + { + "bbox": [ + 130, + 238, + 482, + 264 + ], + "type": "inline_equation", + "content": "(p_S(I,\\mathcal{C}))" + }, + { + "bbox": [ + 130, + 238, + 482, + 264 + ], + "type": "text", + "content": " probabilities in a distillation loss:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 169, + 273, + 481, + 287 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 169, + 273, + 481, + 287 + ], + "spans": [ + { + "bbox": [ + 169, + 273, + 481, + 287 + ], + "type": "interline_equation", + "content": "\\mathcal {L} (\\mathcal {I}, \\mathcal {C}) = \\left[ D _ {\\mathrm {K L}} \\left(p _ {T} (I, \\mathcal {C}) \\mid \\mid p _ {S} (I, \\mathcal {C})\\right) + D _ {\\mathrm {K L}} \\left(p _ {S} (I, \\mathcal {C}) \\mid \\mid p _ {T} (I, \\mathcal {C})\\right) \\right], \\tag {2}", + "image_path": "c808e18b460b7ef33519a700ab72c2f292913b3e0f5b9ce4a84b1bf604452351.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "spans": [ + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "inline_equation", + "content": "D(q\\parallel p)" + }, + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "text", + "content": " is the asymmetric KL-divergence between the discrete probability distributions " + }, + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "inline_equation", + "content": "p" + }, + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "inline_equation", + "content": "q" + }, + { + "bbox": [ + 130, + 296, + 481, + 321 + ], + "type": "text", + "content": ":" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 244, + 331, + 481, + 360 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 331, + 481, + 360 + ], + "spans": [ + { + "bbox": [ + 244, + 331, + 481, + 360 + ], + "type": "interline_equation", + "content": "D _ {\\mathrm {K L}} (p \\mid | q) = \\sum_ {i \\in \\mathcal {C}} p _ {i} \\log \\left(\\frac {p _ {i}}{q _ {i}}\\right) \\tag {3}", + "image_path": "0a25cd641296599c7d135611311212fb4c69c18a3f940ae2e2905a7c9851cbea.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 369, + 481, + 393 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 369, + 481, + 393 + ], + "spans": [ + { + "bbox": [ + 130, + 369, + 481, + 393 + ], + "type": "text", + "content": "This distillation loss depends only on the fixed predictions of the teacher, the prompt-conditioned predictions of the students, and the set of classes " + }, + { + "bbox": [ + 130, + 369, + 481, + 393 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 369, + 481, + 393 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 394, + 482, + 466 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 394, + 482, + 466 + ], + "spans": [ + { + "bbox": [ + 130, + 394, + 482, + 466 + ], + "type": "text", + "content": "Importantly, our distillation loss does not assume any knowledge of class labels for image " + }, + { + "bbox": [ + 130, + 394, + 482, + 466 + ], + "type": "inline_equation", + "content": "I" + }, + { + "bbox": [ + 130, + 394, + 482, + 466 + ], + "type": "text", + "content": ". Nor does it require that " + }, + { + "bbox": [ + 130, + 394, + 482, + 466 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 394, + 482, + 466 + ], + "type": "text", + "content": " be the classes of the downstream task – that is, KDPL can be used for Label Agnostic and Class Agnostic adaptation scenarios. We found in early experiments that the symmetric KL-divergence works slightly better than either asymmetric option (see Section B.3 in the Supplementary Material for an ablation study on this choice)." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 486, + 326, + 499 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 486, + 326, + 499 + ], + "spans": [ + { + "bbox": [ + 131, + 486, + 326, + 499 + ], + "type": "text", + "content": "3.3 Class Agnostic Prompt Learning" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 509, + 482, + 569 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 509, + 482, + 569 + ], + "spans": [ + { + "bbox": [ + 130, + 509, + 482, + 569 + ], + "type": "text", + "content": "To further evaluate the generalization capabilities of KDPL, we introduce a scenario where not only do we not know the labels of training images (label agnostic, Section 3.2) but where we also do not even know the class names associated with the dataset (class agnostic). This scenario is considerably more challenging as we make no assumptions about the few-shot training data." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": "To address the unavailability of class names, we propose a strategy for automatically selecting a set of class names for each batch. We start with a large vocabulary of class names from which to select. Specifically, we use the Open Images V7 dataset [33], which contains " + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\sim 20\\mathrm{K}" + }, + { + "bbox": [ + 130, + 570, + 482, + 666 + ], + "type": "text", + "content": " classes. The most straightforward method would simply use all 20K classes during training. However, this is impractical as the memory required by prompt learning methods increases linearly with the number of classes. According to Ren et al. [46], CoOp requires nearly 15MB of VRAM per class, resulting in approximately 300GB of memory when" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 152 + ], + "type": "text", + "content": "multiplied by 20K classes. Therefore, we propose a method to automatically select which classes to use for each batch by retaining only the ones most relevant to the calculation of the loss in Eq. (2)." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": "Given a batch of images " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "X = \\{I_i\\}_{i=1}^N" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": " and all the class names in the vocabulary " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "\\mathcal{C} = \\{\\mathrm{CLASS}_i\\}_{i=1}^C" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": " represents the number of images in a batch and " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": " the size of the dictionary, we let the teacher model select the most relevant classes. Our objective is to identify the most useful " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": " classes in each batch for student prompt learning. After extracting the teacher image and text features, for each image " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "I_i \\in X" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": ", we apply Eq. (1) to obtain the teacher probabilities " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "p_T(I_i, \\mathcal{C})" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": ". By stacking the probabilities along the batch dimension, we obtain the matrix " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "P_T = [p_T(I_1, \\mathcal{C}); \\dots; p_T(I_N, \\mathcal{C})]^T \\in \\mathbb{R}^{N \\times C}" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": ", where the " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": "-th row corresponds to the probabilities associated with image " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "I_i" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": ". We then compute the average probabilities along the batch axis, resulting in " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "\\overline{P_T} \\in \\mathbb{R}^C" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": ". Finally, we select the classes corresponding to the " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": " highest values in " + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "inline_equation", + "content": "\\overline{P_T}" + }, + { + "bbox": [ + 130, + 152, + 480, + 285 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 286, + 481, + 381 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 286, + 481, + 381 + ], + "spans": [ + { + "bbox": [ + 130, + 286, + 481, + 381 + ], + "type": "text", + "content": "Using the teacher model to perform this class filtering for each batch is feasible and does not incur excessive memory costs since the teacher requires no gradient computation. Therefore, the memory consumption does not depend on the number of classes in " + }, + { + "bbox": [ + 130, + 286, + 481, + 381 + ], + "type": "inline_equation", + "content": "\\mathcal{C}" + }, + { + "bbox": [ + 130, + 286, + 481, + 381 + ], + "type": "text", + "content": ". Conversely, although the student model remains frozen, gradients must still be propagated to update the prompt parameters " + }, + { + "bbox": [ + 130, + 286, + 481, + 381 + ], + "type": "inline_equation", + "content": "\\gamma" + }, + { + "bbox": [ + 130, + 286, + 481, + 381 + ], + "type": "text", + "content": ". Once the classes are selected, the training strategy remains the same as described above, with the only difference being that the class names observed by the student vary in each batch based on teacher predictions." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 403, + 282, + 416 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 282, + 416 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 282, + 416 + ], + "type": "text", + "content": "4 Experimental Results" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 131, + 431, + 462, + 443 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 431, + 462, + 443 + ], + "spans": [ + { + "bbox": [ + 131, + 431, + 462, + 443 + ], + "type": "text", + "content": "In this section we report on experiments validating our proposed approach." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 464, + 406, + 475 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 464, + 406, + 475 + ], + "spans": [ + { + "bbox": [ + 131, + 464, + 406, + 475 + ], + "type": "text", + "content": "4.1 Evaluated Scenarios and Implementation Details" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 486, + 479, + 557 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 479, + 557 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 479, + 557 + ], + "type": "text", + "content": "Following previous works [30,66,67], we validate KDPL in three distinct settings: 1) domain generalization; 2) cross-dataset transfer; 3) generalization to unseen classes. Additionally, to evaluate the scenario where class names are also unknown, we introduce a new evaluation setting we call class agnostic adaptation. We use the train/val/test splits and seeds provided by Zhou et al. [67] for all datasets. All reported results are averages over three independent runs." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 562, + 443, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 562, + 443, + 574 + ], + "spans": [ + { + "bbox": [ + 131, + 562, + 443, + 574 + ], + "type": "text", + "content": "Evaluated Scenarios. We evaluate KDPL on the following scenarios:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 584, + 481, + 644 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 584, + 481, + 644 + ], + "spans": [ + { + "bbox": [ + 138, + 584, + 481, + 644 + ], + "type": "text", + "content": "- Domain Generalization. To assess the ability of the learned prompts to generalize to out-of-distribution datasets, we apply the prompt learned from ImageNet [12] to four different versions of ImageNet datasets exhibiting various types of domain shift. The target datasets are ImageNetV2 [45], ImageNet-Sketch [54], ImageNet-A [25], and ImageNet-R [24]." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 414, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 414, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 414, + 665 + ], + "type": "text", + "content": "3 https://github.com/KaiyangZhou/CoOp/blob/main/DATASETS.md" + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 482, + 320 + ], + "type": "list", + "angle": 0, + "index": 5, + "blocks": [ + { + "bbox": [ + 138, + 116, + 482, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 482, + 212 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 482, + 212 + ], + "type": "text", + "content": "- Cross-dataset Transfer. To evaluate the ability of learned prompts to generalize to unseen classes, we evaluate the same prompt trained on ImageNet on a broad range of downstream recognition tasks. We validate on ten datasets with varying characteristics: Caltech101 [20] for general object classification; OxfordPets [43], StanfordCars [32], Flowers102 [41], Food101 [6], and FGVCAircraft [39] for fine-grained classification; the Describable Textures Dataset (DTD) [11] for texture classification; EuroSAT [23] for satellite-image recognition; and UCF101 [53] for action recognition." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 213, + 482, + 272 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 213, + 482, + 272 + ], + "spans": [ + { + "bbox": [ + 138, + 213, + 482, + 272 + ], + "type": "text", + "content": "- Generalization to Unseen Classes. To evaluate how learned prompts generalize to unseen classes from the same dataset, we divide classes into two subsets: base and novel classes. The prompt is trained exclusively on the base classes and then tested on the novel ones. We evaluate on ImageNet as well as the ten benchmark datasets used for cross-dataset evaluation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 273, + 482, + 320 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 273, + 482, + 320 + ], + "spans": [ + { + "bbox": [ + 138, + 273, + 482, + 320 + ], + "type": "text", + "content": "- Class Agnostic Adaptation. In addition we introduce a novel evaluation setting in which the training class names are unknown. The prompt is trained on ImageNet and tested on all the benchmark datasets used in the domain generalization and cross-dataset evaluations." + } + ] + } + ], + "index": 4 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 130, + 333, + 482, + 453 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 333, + 482, + 453 + ], + "spans": [ + { + "bbox": [ + 130, + 333, + 482, + 453 + ], + "type": "text", + "content": "Implementation Details. We use a CLIP model with a ViT-H-14 visual backbone as the teacher model. For student models, we evaluate both on a CLIP model based on ResNet-50 and a model based on ViT-B/32. By experimenting with both ResNet-based and ViT-based CLIP models we show the architecture independence of our approach. To assess how KDPL performs when integrated into different prompt learning techniques, we selected five distinct textual, visual, and multimodal approaches. With the ResNet-50 student model, we experiment with CoOp [67] and CoCoOp [66]. For the ViT-B/32 student, since it supports both visual and textual prompting, we experiment with CoOp [67], VPT [29], MaPLe [30] and PromptSRC [31]." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 453, + 482, + 513 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 453, + 482, + 513 + ], + "spans": [ + { + "bbox": [ + 130, + 453, + 482, + 513 + ], + "type": "text", + "content": "We denote the integration of our unsupervised knowledge distillation strategy with a specific prompt learning technique by adding the suffix " + }, + { + "bbox": [ + 130, + 453, + 482, + 513 + ], + "type": "inline_equation", + "content": "+\\mathrm{KDPL}" + }, + { + "bbox": [ + 130, + 453, + 482, + 513 + ], + "type": "text", + "content": " to the name of the corresponding technique. For example, CoOp+KDPL refers to the application of KDPL to CoOp. For class agnostic settings we instead use the suffix " + }, + { + "bbox": [ + 130, + 453, + 482, + 513 + ], + "type": "inline_equation", + "content": "+\\mathrm{CA}" + }, + { + "bbox": [ + 130, + 453, + 482, + 513 + ], + "type": "text", + "content": "-KDPL to indicate that no training class names are used." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 514, + 482, + 572 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 514, + 482, + 572 + ], + "spans": [ + { + "bbox": [ + 130, + 514, + 482, + 572 + ], + "type": "text", + "content": "Unless otherwise stated, all experiments are conducted in the few-shot setting with 16 examples per class randomly sampled from the training set. We set the temperature hyperparameter " + }, + { + "bbox": [ + 130, + 514, + 482, + 572 + ], + "type": "inline_equation", + "content": "\\tau" + }, + { + "bbox": [ + 130, + 514, + 482, + 572 + ], + "type": "text", + "content": " in Eq. (1) to 0.01. In the class agnostic experiments in which we assume no knowledge of class names in the training set, we set the number of class names selected in each iteration to " + }, + { + "bbox": [ + 130, + 514, + 482, + 572 + ], + "type": "inline_equation", + "content": "K = 1000" + }, + { + "bbox": [ + 130, + 514, + 482, + 572 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 573, + 482, + 645 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 573, + 482, + 645 + ], + "spans": [ + { + "bbox": [ + 130, + 573, + 482, + 645 + ], + "type": "text", + "content": "For each prompt learning method we use the original implementation and hyperparameters reported in the respective papers. Since we use the compact ResNet-50 and ViT-B/32 backbones, we cannot directly compare to the originally published results. Thus, all numbers we report here were computed by us and are averages over three independent runs. See Section A in the Supplementary Material for additional implementation details." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 653, + 373, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 653, + 373, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 653, + 373, + 665 + ], + "type": "text", + "content": "4 https://huggingface.co/apple/DFN5B-CLIP-ViT-H-14" + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 179, + 479, + 437 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 482, + 170 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 482, + 170 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 482, + 170 + ], + "type": "text", + "content": "Table 1: Domain Generalization. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting, the prompt is trained on ImageNet (source) and then tested on four different versions of ImageNet (targets) that exhibit some kind of domain shift. Average performance improvements over the baselines are shown in green, and average performance deterioration in red." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 136, + 179, + 479, + 437 + ], + "lines": [ + { + "bbox": [ + 136, + 179, + 479, + 437 + ], + "spans": [ + { + "bbox": [ + 136, + 179, + 479, + 437 + ], + "type": "table", + "html": "
BackboneMethodSourceTarget
ImageNet-V2-S-A-RAverage
RN50CLIP (student)58.2051.5033.3021.7056.0040.63
CoOp62.4055.1733.7023.1356.2042.05
CoOp + KDPL62.7355.3735.2023.2757.7742.90
CoCoOp63.0755.5334.7723.7359.4743.38
CoCoOp + KDPL62.7055.6035.3023.4357.9043.06
ViT-B/32CLIP (student)62.0054.7040.8029.6066.0047.78
CoOp66.3358.3041.4031.4765.8749.26
CoOp + KDPL65.9758.1042.5031.6367.3749.90
VPT64.9756.7341.2727.0066.5047.88
VPT + KDPL65.1057.3741.6727.7767.4748.57
MaPLe66.8058.5342.2330.1366.4049.32
MaPLe + KDPL66.5058.4742.7729.8767.7049.70
PromptSRC66.3358.7042.9732.0768.9350.67
PromptSRC + KDPL66.2758.6043.0731.7068.8350.55
ViT-H/14CLIP (teacher)82.8076.6071.1071.1091.3077.53
", + "image_path": "a58ed2445976951d8f991ca5b01f89b60f3d947979f784b61fdbac531d19cf48.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 460, + 334, + 472 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 460, + 334, + 472 + ], + "spans": [ + { + "bbox": [ + 132, + 460, + 334, + 472 + ], + "type": "text", + "content": "4.2 Results on Domain Generalization" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": "Table 1 outlines the performance in the domain generalization setting. We report the performance of each baseline method alongside their unsupervised KDPL variants. Additionally, the performance of the zero-shot CLIP student and teacher models using a handcrafted prompt is included for comparison. We observe that applying our unsupervised approach to each baseline does not result in a significant decrease in performance on the source dataset. Notably, when transferring the learned prompts to a different domain, incorporating KDPL in each baseline can lead to a slight improvement. This suggests that our unsupervised teacher-student distillation learns prompts that generalize better than those trained using ground-truth labels. The only exceptions where we observe an average decrease compared to the baseline are when using CoCoOp or PromptSRC. CoCoOp-KDPL achieves an average accuracy significantly lower than CoCoOp only on the ImageNet-R dataset. Finally, note that all our unsupervised KDPL variants significantly improve the performance over the zero-shot CLIP student model in both the source and the target datasets." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 168, + 479, + 401 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 2: Cross-dataset Transfer. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). The prompt is learned on ImageNet and then tested on the ten different target datasets. Average performance improvements over the baselines are indicated in green." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 168, + 479, + 401 + ], + "lines": [ + { + "bbox": [ + 135, + 168, + 479, + 401 + ], + "spans": [ + { + "bbox": [ + 135, + 168, + 479, + 401 + ], + "type": "table", + "html": "
BackboneMethodTarget
OxfordPetsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)83.7061.0015.6040.0024.2055.6075.2058.5086.0058.3055.81
CoOp84.6061.6313.7736.8322.3354.2075.0359.0087.6757.7355.28
CoOp + KDPL87.3362.8314.9739.2730.1756.6077.2760.3088.5758.6357.59
CoCoOp86.9363.4716.2740.5327.2055.4777.7361.4088.0760.4357.75
CoCoOp + KDPL87.3364.9715.9741.2729.1756.8378.0061.5088.5059.5358.31
ViT-B/32CLIP (student)85.0064.3018.2042.8038.1060.4079.1062.0091.1060.7060.17
CoOp87.1362.2012.1340.5736.9757.8380.1362.8391.1361.8059.27
CoOp + KDPL87.1362.2315.5740.4040.9358.8380.5764.2392.7761.6360.43
VPT87.4364.7719.5344.2028.4757.6078.2763.7391.4062.5059.79
VPT + KDPL87.4364.4317.7742.9330.8057.9778.4763.6392.0062.7759.82
MaPLe88.3766.4318.4742.0337.7760.0080.1064.4391.3362.5061.14
MaPLe + KDPL88.2764.7717.3343.1337.1359.9380.4765.4393.4362.7061.26
PromptSRC88.1365.3317.1743.9040.5060.1781.2365.4092.3763.6361.78
PromptSRC + KDPL88.1765.1018.2343.2744.3060.4380.9065.6793.6363.4062.31
ViT-H/14CLIP (teacher)94.8089.4063.2066.8063.3095.6093.6076.4097.9076.4081.74
", + "image_path": "182d704428b67782eb467b159bc62468c5adc898e3ae91ca410dc1ecb8897deb.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 423, + 330, + 435 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 423, + 330, + 435 + ], + "spans": [ + { + "bbox": [ + 132, + 423, + 330, + 435 + ], + "type": "text", + "content": "4.3 Results on Cross-dataset Transfer" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 445, + 482, + 577 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 445, + 482, + 577 + ], + "spans": [ + { + "bbox": [ + 130, + 445, + 482, + 577 + ], + "type": "text", + "content": "In Table 2 we present the results of the cross-dataset evaluation setting in which the prompt is trained on ImageNet and tested on ten different target datasets. For all datasets our KDPL-based variants consistently outperform the corresponding baselines and demonstrate superior generalization performance. The greater generalization capabilities of KDPL are evident even for fine-grained datasets like EuroSAT, on which the CoOp+KDPL achieves an " + }, + { + "bbox": [ + 130, + 445, + 482, + 577 + ], + "type": "inline_equation", + "content": "8\\%" + }, + { + "bbox": [ + 130, + 445, + 482, + 577 + ], + "type": "text", + "content": " improvement over the baseline CoOp when using ResNet-50 as the backbone. Although adding KDPL yields only minor improvement to the VPT and MaPLe prompt learning techniques, we emphasize that our VPT+KDPL and MaPLe+KDPL do not have access to ground-truth labels. Notably, PromptSRC+KDPL achieves the highest average performance." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 596, + 385, + 607 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 596, + 385, + 607 + ], + "spans": [ + { + "bbox": [ + 132, + 596, + 385, + 607 + ], + "type": "text", + "content": "4.4 Results on Generalization to Unseen Classes" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": "In Table 3 we give results for the unseen class generalization task. In these experiments each dataset is split into " + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": " of the classes as a base for training few-shot adaptation, and the remaining " + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "inline_equation", + "content": "50\\%" + }, + { + "bbox": [ + 130, + 617, + 481, + 666 + ], + "type": "text", + "content": " as new classes on which zero-shot performance is evaluated. KDPL consistently outperforms the corresponding baseline" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 168, + 479, + 387 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 482, + 159 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 482, + 159 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 482, + 159 + ], + "type": "text", + "content": "Table 3: Generalization to Unseen Classes. Comparison between the baselines and the proposed unsupervised KDPL variants (highlighted in cyan). In this setting the prompt is tested on classes never observed during training. Average performance improvements over the baselines are indicated in green." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 168, + 479, + 387 + ], + "lines": [ + { + "bbox": [ + 135, + 168, + 479, + 387 + ], + "spans": [ + { + "bbox": [ + 135, + 168, + 479, + 387 + ], + "type": "table", + "html": "
BackboneMethodUnseen Classes
ImageNetOxfordPntsFlowers102FGVCAircraftDTDEuroSATStanfordCarsFood101SUN397Caltech101UCF101Average
RN50CLIP (student)60.1093.7071.3024.8053.9043.7066.6082.2070.1090.5067.8065.88
CoOp60.0091.6358.3022.1740.9342.1359.8782.0366.7787.5357.6360.82
CoOp + KDPL60.5394.9763.4021.2738.7062.0756.6383.0769.8388.7562.6363.80
CoCoOp63.0794.9367.4724.8745.4035.1064.7384.5072.8790.7364.6764.39
CoCoOp + KDPL62.4395.1069.1724.5748.0055.9363.7085.6773.3390.5366.4066.80
ViT-B/32CLIP (student)64.0096.3072.3028.3053.9061.5069.8085.7073.1094.0071.6070.05
CoOp64.5393.3759.7723.0345.5749.1361.7385.5069.3792.1365.6064.52
CoOp + KDPL64.9094.0056.1722.0047.3362.0762.3787.2374.1793.4366.2066.35
VPT64.6094.8366.0329.7050.1750.0369.9085.8375.1392.5769.4768.02
VPT + KDPL65.2095.2067.8730.4047.5354.9769.8086.3375.1792.8071.0768.76
MaPLe66.7096.8769.7720.4353.5066.7068.0387.4776.5792.2769.4069.79
MaPLe + KDPL66.7396.8768.2327.3750.3375.7068.4087.8376.8393.6773.5371.41
PromptSRC65.9396.3071.3723.6754.4361.9770.0087.1376.7794.7072.6370.45
PromptSRC + KDPL66.3396.4768.8328.4350.8774.1768.5087.6377.3394.4774.7371.61
ViT-H/14CLIP (teacher)84.1099.2085.6064.3075.0082.6098.2096.3085.1097.3085.2086.63
", + "image_path": "776f1ae9188baf5a7d1da74b72bae7e1610a171371101a0a6f81fd671c349be5.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 413, + 482, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 413, + 482, + 473 + ], + "spans": [ + { + "bbox": [ + 130, + 413, + 482, + 473 + ], + "type": "text", + "content": "methods for both backbones, demonstrating improvement in all scenarios for the majority of the datasets. On average, the performance improvement over the supervised baseline methods ranges from about " + }, + { + "bbox": [ + 130, + 413, + 482, + 473 + ], + "type": "inline_equation", + "content": "1\\%" + }, + { + "bbox": [ + 130, + 413, + 482, + 473 + ], + "type": "text", + "content": " for VPT to about " + }, + { + "bbox": [ + 130, + 413, + 482, + 473 + ], + "type": "inline_equation", + "content": "3\\%" + }, + { + "bbox": [ + 130, + 413, + 482, + 473 + ], + "type": "text", + "content": " for CoOp with the ResNet-50 backbone. See Section C.1 in the Supplementary Material for further analysis of base and unseen performance." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 496, + 353, + 509 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 496, + 353, + 509 + ], + "spans": [ + { + "bbox": [ + 131, + 496, + 353, + 509 + ], + "type": "text", + "content": "4.5 Results on Class Agnostic Adaptation" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": "Figure 3(a-b) summarizes the main results in the proposed Class Agnostic (CA) scenario in which even the training class names are unknown at training time. We report the accuracy on the ImageNet dataset (source), as well as the average accuracy in domain generalization and cross-dataset settings. Note that, even without knowing the class names, the performance on the source dataset steadily improves compared to the zero-shot CLIP model. Moreover, the prompts learned via the proposed unsupervised class agnostic knowledge distillation also exhibit improved average domain generalization " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "(\\mathrm{AVG}^1)" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": " and cross-dataset capabilities " + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "inline_equation", + "content": "(\\mathrm{AVG}^2)" + }, + { + "bbox": [ + 130, + 521, + 482, + 666 + ], + "type": "text", + "content": ". Figure 3(b) visually depicts how the ResNet-50-based CoOp + CA-KDPL compares with supervised CoOp and zero-shot CLIP student performance in the cross-dataset transfer setting. Notably, CA-KDPL outperforms both baselines despite being unsupervised and class agnostic during training." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 136, + 146, + 301, + 244 + ], + "blocks": [ + { + "bbox": [ + 136, + 146, + 301, + 244 + ], + "lines": [ + { + "bbox": [ + 136, + 146, + 301, + 244 + ], + "spans": [ + { + "bbox": [ + 136, + 146, + 301, + 244 + ], + "type": "table", + "html": "
MethodSourceAVG1AVG2
ResNet-50 (student)58.2040.6355.81
CoOp + CA-KDPL61.8343.0257.69
CoCoOp + CA-KDPL61.4343.1858.03
ViT-B/32 (student)62.0047.7860.17
CoOp + CA-KDPL64.7349.6360.74
VPT + CA-KDPL63.7347.8959.80
MaPLe + CA-KDPL65.2349.2861.23
PromptSRC + CA-KDPL65.0050.3761.93
", + "image_path": "21428817f1366b38e973a1e7b11b0619502d78a230ec2161d5dfe542c68313a5.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 140, + 254, + 295, + 266 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 254, + 295, + 266 + ], + "spans": [ + { + "bbox": [ + 140, + 254, + 295, + 266 + ], + "type": "text", + "content": "(a) Average class agnostic adaptation" + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 304, + 113, + 468, + 243 + ], + "blocks": [ + { + "bbox": [ + 304, + 113, + 468, + 243 + ], + "lines": [ + { + "bbox": [ + 304, + 113, + 468, + 243 + ], + "spans": [ + { + "bbox": [ + 304, + 113, + 468, + 243 + ], + "type": "image", + "image_path": "e07599925f4edd60a56da9c47d87cade6e2a0486c249cbfc761ed6cf11ec5067.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "lines": [ + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "spans": [ + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "type": "text", + "content": "Fig. 3: Class agnostic adaptation. (a) Comparison between the zero-shot baselines and our class agnostic CA-KDPL variants (highlighted in cyan). The prompt is learned in an unsupervised and class agnostic setting on ImageNet and evaluated on the benchmark datasets for domain generalization " + }, + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "type": "inline_equation", + "content": "(\\mathrm{AVG}^1)" + }, + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "type": "text", + "content": " and cross-dataset " + }, + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "type": "inline_equation", + "content": "(\\mathrm{AVG}^2)" + }, + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "type": "text", + "content": " evaluations. Average performance improvements are indicated in green, and deterioration in red. (b) Per-dataset accuracy comparison between our unsupervised and class agnostic method " + }, + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "type": "inline_equation", + "content": "(\\mathrm{CoOp + CA - KDPL})" + }, + { + "bbox": [ + 130, + 275, + 482, + 362 + ], + "type": "text", + "content": ", the supervised baseline CoOp, and the zero-shot student on the cross-dataset benchmark datasets." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "bbox": [ + 303, + 254, + 472, + 266 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 303, + 254, + 472, + 266 + ], + "spans": [ + { + "bbox": [ + 303, + 254, + 472, + 266 + ], + "type": "text", + "content": "(b) Per-dataset class agnostic adaptation" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 385, + 220, + 398 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 385, + 220, + 398 + ], + "spans": [ + { + "bbox": [ + 132, + 385, + 220, + 398 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 411, + 482, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 495 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 495 + ], + "type": "text", + "content": "In this paper we proposed an approach to Knowledge Distillation Prompt Learning (KDPL) which is easily integrated into existing supervised prompt learning methods. Our experiments show that for CoOp, CoCoOp, VPT, MaPLe and PromptSRC adding KDPL: (1) renders them label agnostic by eliminating the need for ground-truth labels for few-shot adaptation; (2) can also render them class agnostic in cases where no knowledge of training class labels is available; and (3) remarkably improves generalization to downstream tasks." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 495, + 482, + 542 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 495, + 482, + 542 + ], + "spans": [ + { + "bbox": [ + 130, + 495, + 482, + 542 + ], + "type": "text", + "content": "The additional computation cost incurred by distilling from a large VLM is a limitation of KDPL, though all encoder parameters are fixed and the predictions of the teacher can be precomputed, which helps mitigate the extra cost. This extra computation only amounts to about a " + }, + { + "bbox": [ + 130, + 495, + 482, + 542 + ], + "type": "inline_equation", + "content": "15\\%" + }, + { + "bbox": [ + 130, + 495, + 482, + 542 + ], + "type": "text", + "content": " increase for MaPLe." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 543, + 482, + 626 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 543, + 482, + 626 + ], + "spans": [ + { + "bbox": [ + 130, + 543, + 482, + 626 + ], + "type": "text", + "content": "Note that we did not tune any hyperparameters when training the KDPL variants. We use the same settings as in the original papers, which are likely suboptimal for distillation-based adaptation. With careful tuning, there is potential for improvement. Our experiments indicate that distillation-learned prompts are more transferable, and we think it would be interesting to see if this idea can generalize to very different downstream tasks and scale to even bigger teacher models or - more interestingly - to even smaller student models." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 243, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 137, + 480, + 162 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 137, + 480, + 162 + ], + "spans": [ + { + "bbox": [ + 132, + 137, + 480, + 162 + ], + "type": "text", + "content": "This work was supported by funding from the European Commission Horizon 2020 grant #951911 (AI4Media)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 178, + 197, + 190 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 178, + 197, + 190 + ], + "spans": [ + { + "bbox": [ + 133, + 178, + 197, + 190 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 199, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 199, + 481, + 243 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 199, + 481, + 243 + ], + "spans": [ + { + "bbox": [ + 138, + 199, + 481, + 243 + ], + "type": "text", + "content": "1. Abdul Samadh, J., Gani, M.H., Hussein, N., Khattak, M.U., Naseer, M.M., Shahbaz Khan, F., Khan, S.H.: Align your prompts: Test-time prompting with distribution alignment for zero-shot generalization. Advances in Neural Information Processing Systems 36 (2024)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 244, + 481, + 287 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 244, + 481, + 287 + ], + "spans": [ + { + "bbox": [ + 138, + 244, + 481, + 287 + ], + "type": "text", + "content": "2. Agnolucci, L., Baldrati, A., Todino, F., Becattini, F., Bertini, M., Del Bimbo, A.: Eco: Ensembling context optimization for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2811-2815 (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 288, + 481, + 319 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 288, + 481, + 319 + ], + "spans": [ + { + "bbox": [ + 138, + 288, + 481, + 319 + ], + "type": "text", + "content": "3. Baldrati, A., Agnolucci, L., Bertini, M., Del Bimbo, A.: Zero-shot composed image retrieval with textual inversion. In: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15338-15347 (October 2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 320, + 481, + 363 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 320, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 138, + 320, + 481, + 363 + ], + "type": "text", + "content": "4. Barraco, M., Cornia, M., Cascianelli, S., Baraldi, L., Cucchiara, R.: The unreason-able effectiveness of clip features for image captioning: an experimental analysis. In: proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 4662-4670 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 363, + 481, + 406 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 363, + 481, + 406 + ], + "spans": [ + { + "bbox": [ + 138, + 363, + 481, + 406 + ], + "type": "text", + "content": "5. Beyer, L., Zhai, X., Royer, A., Markeeva, L., Anil, R., Kolesnikov, A.: Knowledge distillation: A good teacher is patient and consistent. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10925-10934 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 406, + 481, + 449 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 406, + 481, + 449 + ], + "spans": [ + { + "bbox": [ + 138, + 406, + 481, + 449 + ], + "type": "text", + "content": "6. Bossard, L., Guillaume, M., Van Gool, L.: Food-101-mining discriminative components with random forests. In: Computer Vision-ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part VI 13. pp. 446-461. Springer (2014)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 449, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 449, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 138, + 449, + 481, + 482 + ], + "type": "text", + "content": "7. Bulat, A., Tzimiropoulos, G.: Lasp: Text-to-text optimization for language-aware soft prompting of vision & language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 23232-23241 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 482, + 481, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 482, + 481, + 514 + ], + "spans": [ + { + "bbox": [ + 138, + 482, + 481, + 514 + ], + "type": "text", + "content": "8. Chen, G., Yao, W., Song, X., Li, X., Rao, Y., Zhang, K.: Plot: Prompt learning with optimal transport for vision-language models. In: The Eleventh International Conference on Learning Representations (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 514, + 481, + 557 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 514, + 481, + 557 + ], + "spans": [ + { + "bbox": [ + 138, + 514, + 481, + 557 + ], + "type": "text", + "content": "9. Chen, W.C., Chang, C.C., Lee, C.R.: Knowledge distillation with feature maps for image classification. In: Computer Vision-ACCV 2018: 14th Asian Conference on Computer Vision, Perth, Australia, December 2-6, 2018, Revised Selected Papers, Part III 14. pp. 200-215. Springer (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 134, + 558, + 481, + 601 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 558, + 481, + 601 + ], + "spans": [ + { + "bbox": [ + 134, + 558, + 481, + 601 + ], + "type": "text", + "content": "10. Cherti, M., Beaumont, R., Wightman, R., Wortzman, M., Ilharco, G., Gordon, C., Schuhmann, C., Schmidt, L., Jitsev, J.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2818-2829 (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 601, + 481, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 601, + 481, + 633 + ], + "spans": [ + { + "bbox": [ + 134, + 601, + 481, + 633 + ], + "type": "text", + "content": "11. Cimpoi, M., Maji, S., Kokkinos, I., Mohamed, S., Vedaldi, A.: Describing textures in the wild. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3606-3613 (2014)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 633, + 481, + 665 + ], + "type": "text", + "content": "12. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 149 + ], + "type": "text", + "content": "13. Desai, K., Johnson, J.: Virtex: Learning visual representations from textual annotations. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11162-11173 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 480, + 172 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 480, + 172 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 480, + 172 + ], + "type": "text", + "content": "14. Ding, Y., Liu, L., Tian, C., Yang, J., Ding, H.: Don't stop learning: Towards continual learning for the clip model. arXiv preprint arXiv:2207.09248 (2022)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 480, + 205 + ], + "type": "text", + "content": "15. Dong, X., Bao, J., Zhang, T., Chen, D., Gu, S., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N.: Clip itself is a strong fine-tuner: Achieving 85.7% and 88.0% top-1 accuracy with vit-b and vit-l on imagenet. arXiv preprint arXiv:2212.06138 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 205, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 205, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 133, + 205, + 480, + 248 + ], + "type": "text", + "content": "16. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 480, + 281 + ], + "type": "text", + "content": "17. Dou, Q., Liu, Q., Heng, P.A., Glocker, B.: Unpaired multi-modal segmentation via knowledge distillation. IEEE transactions on medical imaging 39(7), 2415-2425 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 281, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 281, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 480, + 314 + ], + "type": "text", + "content": "18. Fang, A., Jose, A.M., Jain, A., Schmidt, L., Toshev, A.T., Shankar, V.: Data filtering networks. In: The Twelfth International Conference on Learning Representations (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 480, + 346 + ], + "type": "text", + "content": "19. Fang, Z., Wang, J., Wang, L., Zhang, L., Yang, Y., Liu, Z.: Seed: Self-supervised distillation for visual representation. In: International Conference on Learning Representations (2020)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 347, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 347, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 132, + 347, + 480, + 391 + ], + "type": "text", + "content": "20. Fei-Fei, L., Fergus, R., Perona, P.: Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories. In: 2004 conference on computer vision and pattern recognition workshop. pp. 178-178. IEEE (2004)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 480, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 480, + 423 + ], + "type": "text", + "content": "21. Gu, X., Lin, T.Y., Kuo, W., Cui, Y.: Open-vocabulary object detection via vision and language knowledge distillation. In: International Conference on Learning Representations (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 132, + 424, + 480, + 456 + ], + "type": "text", + "content": "22. He, T., Shen, C., Tian, Z., Gong, D., Sun, C., Yan, Y.: Knowledge adaptation for efficient semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 578-587 (2019)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 457, + 480, + 500 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 457, + 480, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 457, + 480, + 500 + ], + "type": "text", + "content": "23. Helber, P., Bischke, B., Dengel, A., Borth, D.: Eurosat: A novel dataset and deep learning benchmark for land use and land cover classification. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 12(7), 2217-2226 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 501, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 501, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 501, + 480, + 544 + ], + "type": "text", + "content": "24. Hendrycks, D., Basart, S., Mu, N., Kadavath, S., Wang, F., Dorundo, E., Desai, R., Zhu, T., Parajuli, S., Guo, M., et al.: The many faces of robustness: A critical analysis of out-of-distribution generalization. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 8340-8349 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "type": "text", + "content": "25. Hendrycks, D., Zhao, K., Basart, S., Steinhardt, J., Song, D.: Natural adversarial examples. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15262-15271 (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 578, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 480, + 599 + ], + "type": "text", + "content": "26. Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. stat 1050, 9 (2015)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 600, + 480, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 600, + 480, + 621 + ], + "spans": [ + { + "bbox": [ + 132, + 600, + 480, + 621 + ], + "type": "text", + "content": "27. Huang, T., Chu, J., Wei, F.: Unsupervised prompt learning for vision-language models. arXiv preprint arXiv:2204.03649 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 621, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 621, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 621, + 480, + 665 + ], + "type": "text", + "content": "28. Jia, C., Yang, Y., Xia, Y., Chen, Y.T., Parekh, Z., Pham, H., Le, Q., Sung, Y.H., Li, Z., Duerig, T.: Scaling up visual and vision-language representation learning with noisy text supervision. In: International conference on machine learning. pp. 4904-4916. PMLR (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 480, + 138 + ], + "type": "text", + "content": "29. Jia, M., Tang, L., Chen, B.C., Cardie, C., Belongie, S., Hariharan, B., Lim, S.N.: Visual prompt tuning. In: European Conference on Computer Vision (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 171 + ], + "type": "text", + "content": "30. Khattak, M.U., Rasheed, H., Maaz, M., Khan, S., Khan, F.S.: Maple: Multi-modal prompt learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19113-19122 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 480, + 215 + ], + "type": "text", + "content": "31. Khattak, M.U., Wasim, S.T., Naseer, M., Khan, S., Yang, M.H., Khan, F.S.: Self-regulating prompts: Foundational model adaptation without forgetting. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 15190-15200 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 480, + 248 + ], + "type": "text", + "content": "32. Krause, J., Stark, M., Deng, J., Fei-Fei, L.: 3d object representations for fine-grained categorization. In: Proceedings of the IEEE international conference on computer vision workshops. pp. 554-561 (2013)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 249, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 480, + 293 + ], + "type": "text", + "content": "33. Kuznetsova, A., Rom, H., Alldrin, N., Uijlings, J., Krasin, I., Pont-Tuset, J., Kamali, S., Popov, S., Malloci, M., Kolesnikov, A., et al.: The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. International Journal of Computer Vision (IJCV) 128(7), 1956-1981 (2020)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 480, + 326 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 326 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 326 + ], + "type": "text", + "content": "34. Lester, B., Al-Rfou, R., Constant, N.: The power of scale for parameter-efficient prompt tuning. In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. pp. 3045-3059 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 326, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 326, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 326, + 480, + 369 + ], + "type": "text", + "content": "35. Li, X.L., Liang, P.: Prefix-tuning: Optimizing continuous prompts for generation. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). pp. 4582-4597 (2021)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 369, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 413 + ], + "type": "text", + "content": "36. Li, Z., Li, X., Fu, X., Zhang, X., Wang, W., Chen, S., Yang, J.: Promptkd: Unsupervised prompt distillation for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 26617-26626 (2024)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 414, + 480, + 445 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 414, + 480, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 414, + 480, + 445 + ], + "type": "text", + "content": "37. Lu, Y., Liu, J., Zhang, Y., Liu, Y., Tian, X.: Prompt distribution learning. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5206-5215 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 447, + 480, + 479 + ], + "type": "text", + "content": "38. Lüddecke, T., Ecker, A.: Image segmentation using text and image prompts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 7086-7096 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 479, + 480, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 480, + 501 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 480, + 501 + ], + "type": "text", + "content": "39. Maji, S., Rahtu, E., Kannala, J., Blaschko, M., Vedaldi, A.: Fine-grained visual classification of aircraft. arXiv preprint arXiv:1306.5151 (2013)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 502, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 502, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 502, + 480, + 533 + ], + "type": "text", + "content": "40. Mullapudi, R.T., Chen, S., Zhang, K., Ramanan, D., Fatahalian, K.: Online model distillation for efficient video inference. In: Proceedings of the IEEE/CVF International conference on computer vision. pp. 3573-3582 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 534, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 480, + 566 + ], + "type": "text", + "content": "41. Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: 2008 Sixth Indian conference on computer vision, graphics & image processing. pp. 722-729. IEEE (2008)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 567, + 480, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 567, + 480, + 609 + ], + "spans": [ + { + "bbox": [ + 132, + 567, + 480, + 609 + ], + "type": "text", + "content": "42. Parelli, M., Delitzas, A., Hars, N., Vlassis, G., Anagnostidis, S., Bachmann, G., Hofmann, T.: Clip-guided vision-language pre-training for question answering in 3d scenes. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5606-5611 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 611, + 480, + 643 + ], + "type": "text", + "content": "43. Parkhi, O.M., Vedaldi, A., Zisserman, A., Jawahar, C.: Cats and dogs. In: 2012 IEEE conference on computer vision and pattern recognition. pp. 3498-3505. IEEE (2012)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 480, + 665 + ], + "type": "text", + "content": "44. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 117, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 147, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 147, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 147, + 117, + 480, + 138 + ], + "type": "text", + "content": "natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 481, + 171 + ], + "type": "text", + "content": "45. Recht, B., Roelofs, R., Schmidt, L., Shankar, V.: DoImagenet classifiers generalize toImagenet? In: International conference on machine learning. pp. 5389-5400. PMLR (2019)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 481, + 205 + ], + "type": "text", + "content": "46. Ren, S., Zhang, A., Zhu, Y., Zhang, S., Zheng, S., Li, M., Smola, A.J., Sun, X.: Prompt pre-training with twenty-thousand classes for open-vocabulary visual recognition. Advances in Neural Information Processing Systems 36 (2024)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 205, + 481, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 205, + 481, + 248 + ], + "spans": [ + { + "bbox": [ + 134, + 205, + 481, + 248 + ], + "type": "text", + "content": "47. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortzman, M., et al.: Laion-5b: An open large-scale dataset for training next generation image-text models. Advances in Neural Information Processing Systems 35, 25278–25294 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 249, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 249, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 133, + 249, + 481, + 282 + ], + "type": "text", + "content": "48. Schuhmann, C., Vencu, R., Beaumont, R., Kaczmarczyk, R., Mullis, C., Katta, A., Coombes, T., Jitsev, J., Komatsuzaki, A.: Laion-400m: Open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 282, + 481, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 282, + 481, + 315 + ], + "spans": [ + { + "bbox": [ + 133, + 282, + 481, + 315 + ], + "type": "text", + "content": "49. Shi, C., Yang, S.: Logoprompt: Synthetic text images can be good visual prompts for vision-language models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 2932-2941 (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 316, + 481, + 347 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 316, + 481, + 347 + ], + "spans": [ + { + "bbox": [ + 133, + 316, + 481, + 347 + ], + "type": "text", + "content": "50. Shi, Z., Lipani, A.: DePT: Decomposed prompt tuning for parameter-efficient fin-tuning. In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=KjegfPGRde" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 348, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 348, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 133, + 348, + 481, + 392 + ], + "type": "text", + "content": "51. Siam, M., Jiang, C., Lu, S., Petrich, L., Gamal, M., Elhoseiny, M., Jagersand, M.: Video object segmentation using teacher-student adaptation in a human robot interaction (hri) setting. In: 2019 International Conference on Robotics and Automation (ICRA). pp. 50-56. IEEE (2019)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 392, + 481, + 435 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 392, + 481, + 435 + ], + "spans": [ + { + "bbox": [ + 133, + 392, + 481, + 435 + ], + "type": "text", + "content": "52. Song, H., Dong, L., Zhang, W., Liu, T., Wei, F.: Clip models are few-shot learners: Empirical studies on vqa and visual entailment. In: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). pp. 6088-6100 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 435, + 481, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 435, + 481, + 456 + ], + "spans": [ + { + "bbox": [ + 133, + 435, + 481, + 456 + ], + "type": "text", + "content": "53. Soomro, K., Zamir, A.R., Shah, M.: Ucf101: A dataset of 101 human actions classes from videos in the wild. arXiv preprint arXiv:1212.0402 (2012)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 457, + 481, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 457, + 481, + 490 + ], + "spans": [ + { + "bbox": [ + 133, + 457, + 481, + 490 + ], + "type": "text", + "content": "54. Wang, H., Ge, S., Lipton, Z., Xing, E.P.: Learning robust global representations by penalizing local predictive power. Advances in Neural Information Processing Systems 32 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 491, + 481, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 491, + 481, + 523 + ], + "spans": [ + { + "bbox": [ + 133, + 491, + 481, + 523 + ], + "type": "text", + "content": "55. Wang, Z., Liang, J., He, R., Xu, N., Wang, Z., Tan, T.: Improving zero-shot generalization for clip with synthesized prompts. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3032-3042 (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 523, + 481, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 523, + 481, + 544 + ], + "spans": [ + { + "bbox": [ + 133, + 523, + 481, + 544 + ], + "type": "text", + "content": "56. Xu, G., Liu, Z., Li, X., Loy, C.C.: Knowledge distillation meets self-supervision. In: European Conference on Computer Vision. pp. 588-604. Springer (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 545, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 545, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 133, + 545, + 481, + 578 + ], + "type": "text", + "content": "57. Yao, H., Zhang, R., Xu, C.: Visual-language prompt tuning with knowledge-guided context optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 6757-6767 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 578, + 481, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 578, + 481, + 611 + ], + "spans": [ + { + "bbox": [ + 133, + 578, + 481, + 611 + ], + "type": "text", + "content": "58. Yuan, L., Tay, F.E., Li, G., Wang, T., Feng, J.: Revisiting knowledge distillation via label smoothing regularization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3903-3911 (2020)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 611, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 611, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 133, + 611, + 481, + 643 + ], + "type": "text", + "content": "59. Yun, S., Park, J., Lee, K., Shin, J.: Regularizing class-wise predictions via self-knowledge distillation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 13876-13885 (2020)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "type": "text", + "content": "60. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proceedings of the" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 242, + 100 + ], + "type": "text", + "content": "M. Mistretta et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 392 + ], + "type": "list", + "angle": 0, + "index": 11, + "blocks": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "spans": [ + { + "bbox": [ + 149, + 116, + 481, + 138 + ], + "type": "text", + "content": "IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18123-18133 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 481, + 171 + ], + "type": "text", + "content": "61. Zhang, R., Fang, R., Zhang, W., Gao, P., Li, K., Dai, J., Qiao, Y., Li, H.: Tip-adapter: Training-free clip-adapter for better vision-language modeling. arXiv preprint arXiv:2111.03930 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 172, + 481, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 172, + 481, + 204 + ], + "spans": [ + { + "bbox": [ + 132, + 172, + 481, + 204 + ], + "type": "text", + "content": "62. Zhang, Y., Xiang, T., Hospedales, T.M., Lu, H.: Deep mutual learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 4320-4328 (2018)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 481, + 237 + ], + "type": "text", + "content": "63. Zhao, B., Cui, Q., Song, R., Qiu, Y., Liang, J.: Decoupled knowledge distillation. In: Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition. pp. 11953-11962 (2022)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 237, + 481, + 282 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 237, + 481, + 282 + ], + "spans": [ + { + "bbox": [ + 132, + 237, + 481, + 282 + ], + "type": "text", + "content": "64. Zhong, Z., Friedman, D., Chen, D.: Factual probing is [mask]: Learning vs. learning to recall. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. pp. 5017-5033 (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 282, + 481, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 282, + 481, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 282, + 481, + 304 + ], + "type": "text", + "content": "65. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: European Conference on Computer Vision. pp. 696-712. Springer (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 304, + 481, + 336 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 481, + 336 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 481, + 336 + ], + "type": "text", + "content": "66. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Conditional prompt learning for vision-language models. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16816-16825 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 481, + 357 + ], + "type": "text", + "content": "67. Zhou, K., Yang, J., Loy, C.C., Liu, Z.: Learning to prompt for vision-language models. International Journal of Computer Vision 130(9), 2337-2348 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "text", + "content": "68. Zhu, B., Niu, Y., Han, Y., Wu, Y., Zhang, H.: Prompt-aligned gradient for prompt tuning. In: 2023 IEEE/CVF International Conference on Computer Vision (ICCV). pp. 15613-15623. IEEE Computer Society (2023)" + } + ] + } + ], + "index": 10 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 164, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving Learned Prompts via Unsupervised Knowledge Distillation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_content_list.json b/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..c29ebcb198c8633dfd8d1beb5be85bd96d201b0a --- /dev/null +++ b/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_content_list.json @@ -0,0 +1,2081 @@ +[ + { + "type": "text", + "text": "Improving image synthesis with diffusion-negative sampling", + "text_level": 1, + "bbox": [ + 217, + 140, + 785, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Alakh Desai1 and Nuno Vasconcelos1", + "bbox": [ + 354, + 210, + 648, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "University of California San Diego, USA {ahdesai,nuno}@ucsd.edu", + "bbox": [ + 364, + 239, + 635, + 267 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. For image generation with diffusion models (DMs), a negative prompt $\\mathbf{n}$ can be used to complement the text prompt $\\mathbf{p}$ , helping define properties not desired in the synthesized image. While this improves prompt adherence and image quality, finding good negative prompts is challenging. We argue that this is due to a semantic gap between humans and DMs, which makes good negative prompts for DMs appear unintuitive to humans. To bridge this gap, we propose a new diffusion-negative prompting (DNP) strategy. DNP is based on a new procedure to sample images that are least compliant with $\\mathbf{p}$ under the distribution of the DM, denoted as diffusion-negative sampling (DNS). Given $\\mathbf{p}$ , one such image is sampled, which is then translated into natural language by the user or a captioning model, to produce the negative prompt $\\mathbf{n}^*$ . The pair $(\\mathbf{p}, \\mathbf{n}^*)$ is finally used to prompt the DM. DNS is straightforward to implement and requires no training. Experiments and human evaluations show that DNP performs well both quantitatively and qualitatively and can be easily combined with several DM variants.", + "bbox": [ + 261, + 297, + 738, + 518 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Image generation $\\cdot$ Diffusion Models $\\cdot$ Negative prompting", + "bbox": [ + 261, + 532, + 738, + 547 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 569, + 375, + 585 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Diffusion models (DMs) [19, 22, 24] have shown exquisite capacity to synthesize visually appealing images guided by textual prompts. However, they are not easy to control. While the synthesized images are usually impressive, various classes of prompts are known to be difficult, e.g. prompts involving humans [12], hands [17], or multiple objects and their interactions [3]. The synthesized image quality can often be unsatisfactory for such prompts, and prompt adherence is usually weak. This is illustrated in Figure 1, which shows an image synthesized by Stable Diffusion (SD) for a complex prompt $\\mathbf{p}$ . The problem can be mitigated by adding alternative conditioning inputs to the diffusion model, such as visual conditioning with sketches or layouts [31, 32]. This, however, usually requires skilled users and can be labor-intensive. Ideally, it should be possible to improve consistency with text prompts alone. In this work, we explore negative prompting [16], which has been quite effective but is difficult to use. We argue that this difficulty stems from a semantic gap between the concept representations of a human user and the DM. We then introduce a new prompting technique, denoted as diffusion-negative prompting (DNP), to bridge this gap, as illustrated in Figure 1.", + "bbox": [ + 215, + 597, + 787, + 840 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/eb12003f50b2369b6e7714e53cc19f97a4f3ee175bf64cd185f9bd31619eec3a.jpg", + "image_caption": [ + "Fig. 1: DNP improves quality of synthesis for prompts $\\mathbf{p}$ (green) of SD's images (top-right). A diffusion-negative image, $\\bar{\\mathcal{I}}$ , is sampled using DNS, enabling the user to visualize the negation of $\\mathbf{p}$ under DM's distribution. The user translates the $\\bar{\\mathcal{I}}$ into a negative prompt $\\mathbf{n}^*$ (red), by a process denoted as DNP, and the DM is prompted with the pair $(\\mathbf{p},\\mathbf{n}^{*})$ . This increases compliance and quality of the synthesized image (bottom-right). Replacing the user with a captioning model is denoted as auto-DNP." + ], + "image_footnote": [], + "bbox": [ + 218, + 143, + 784, + 265 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Negative prompting complements the text prompt $\\mathbf{p}$ , e.g. \"an airplane standing on the runway\", with negative prompts $\\mathbf{n}$ , e.g. \"flying\" or \"soaring\". As illustrated in the top row of Figure 2a, this greatly improves compliance of the synthesized image with prompt $\\mathbf{p}$ and can improve image quality. However, negative prompts are difficult to use, for two reasons. First, there are many prompts, e.g. see $\\mathbf{p} =$ \"a cat and a dog\" in Figure 2b, without a clear negative. Second, even when an intuitive negative exists, e.g. \"flying\" vs. \"standing\", it is not necessarily a successful negative for DMs across seeds, as seen in the bottom row of Figure 2a. This raises the question: what is a good negative prompt for a DM? In general, $\\mathbf{n}$ is a good negative prompt if the images synthesized by prompt-pair $(\\mathbf{p},\\mathbf{n})$ adhere more to $\\mathbf{p}$ than those synthesized by $\\mathbf{p}$ alone. This, however, is a DM-centric definition of negative prompt. The problem is that the semantic representation of the DM is only a weak approximation to that used by a human. In general, DMs cannot replicate the human definition of concept negation. We refer to this problem as the semantic gap between DMs and humans. As a result, good negative prompts for a DM are frequently not intuitive for humans, i.e. what a human would consider a negative for $\\mathbf{p}$ . This makes it difficult for users to produce good negative prompts for DMs.", + "bbox": [ + 212, + 407, + 787, + 681 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this work, we address this problem by devising a strategy that enables humans to visualize the concepts that DMs consider negatives for prompt $\\mathbf{p}$ . This procedure is inspired by classifier-free guidance (CFG) [11]. While CFG uses a sampling guidance factor that increases the probability of images compliant with $\\mathbf{p}$ , we introduce a diffusion-negative sampling (DNS) guidance factor that encourages the sampling of the diffusion-negative images, $\\bar{\\mathcal{I}}$ , least compliant with $\\mathbf{p}$ , under the DM's image distribution. This $\\bar{\\mathcal{I}}$ usually does not comply with the human understanding of the negation of concepts in $\\mathbf{p}$ . However, because it represents the DM's understanding of this negation, it can be shown to the user to overcome the semantic gap between them. The user can then produce a negative", + "bbox": [ + 212, + 689, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 462, + 126 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/5f39133d84d974e588b6703746867eeca6915c1f4a100e15d1708afcfd944d50.jpg", + "image_caption": [ + "p: an airplane standing on the runway" + ], + "image_footnote": [], + "bbox": [ + 220, + 145, + 462, + 222 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/3a6627481b5f8aec862e34d924bc939b6467b8c02a7f2d4c92fa109b004e254c.jpg", + "image_caption": [ + "(a) Semantic negatives: While effective, they do not guarantee compliance across seeds. Success (top), failure (bottom)." + ], + "image_footnote": [], + "bbox": [ + 220, + 234, + 462, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/a6549f6fd4761c020f0ae4d4250259739a7231e90bc95e903806cb74a71dd010.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 467, + 143, + 785, + 222 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/b99f818cf8a4700d4865a365aab7eccd3a6fb04b8f1a3b68dcd17fdb1e1ddb5c.jpg", + "image_caption": [ + "(b) Non-semantic negatives: A good negative prompt needs multiple iterations for every seed as they can be highly unintuitive.", + "Fig. 2: Example of negative prompting for both semantic and non-semantic scenarios. The positive prompt, $\\mathbf{p}$ and negative prompts, $\\mathbf{n}$ are on top of each image." + ], + "image_footnote": [], + "bbox": [ + 467, + 224, + 785, + 301 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "prompt $\\mathbf{n}^*$ in the language of the DM by simply captioning $\\bar{\\mathcal{L}}$ . Prompting the DM with the pair $(\\mathbf{p},\\mathbf{n}^{*})$ usually produces better images than with $\\mathbf{p}$ alone.", + "bbox": [ + 212, + 411, + 784, + 441 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Figure 1 shows how DNP can help when DMs produce poor-quality images. In response to the user prompt $\\mathbf{p} =$ \"woman in black dress on the red carpet wearing a ring on the finger\", SD generates the top image, with distorted hands and rings. The rest of the figure illustrates DNP. Given the prompt $\\mathbf{p}$ , the DM samples a negative image $\\bar{\\mathcal{I}} (\\mathbf{p})$ using DNS. In the figure, $\\bar{\\mathcal{I}}$ contains the house with a garden. The user inspects the image and produces a diffusion-negative prompt $\\mathbf{n}^{*}(\\bar{\\mathcal{I}}) =$ \"a white home with a garage and grass in the front yard\" that reflects the content of this image. This is similar to captioning the image, and can also be done automatically by an image captioning model, resulting in what we denote as auto-DNP. Finally, the DM is prompted with the pair $(\\mathbf{p},\\mathbf{n}^{*})$ to produce an image that has much better compliance with $\\mathbf{p}$ than the original.", + "bbox": [ + 212, + 444, + 787, + 611 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our experiments show that DNP improves prompt adherence and image quality, both in terms of quantitative metrics, like CLIP scores of image-prompt similarity, and subjective ratings by human evaluators. This is shown to hold both for vanilla DMs, like SD, and DMs optimized for solving specific problems, e.g. the $A\\& E$ [3] model tailored to synthesize images containing multiple objects. Various ablations also show that DNP outperforms negative prompting solutions commonly used by practitioners, e.g. using a dictionary of universal negative prompts, random prompts, etc. It also provides much-needed transparency to the negation process. auto-DNP provides a fully automated implementation of DNP. While not as effective as DNP, it maintains all the benefits discussed above, avoids user captioning effort, and allows automatic comparisons to other negative prompting procedures. Finally, our experiments consistently demonstrate the existence of a semantic gap between DMs and humans. Although the negative images generated by DNS are frequently very unintuitive for humans, they help the DM significantly when translated into negative prompts.", + "bbox": [ + 212, + 613, + 787, + 840 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Improving image synthesis with diffusion-negative sampling", + "bbox": [ + 334, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Overall, this paper makes the following contributions. First, we hypothesize that DM image synthesis can be substantially enhanced by using negative prompts. However, these prompts are difficult for humans to generate, due to the semantic gap between humans and DMs, which leads to a different understanding of concept negation. Second, we introduce the DNS procedure to overcome this semantic gap, allowing humans to visualize the negative concept as understood by the DM. This enables negative prompting with DNP, as shown in Figure 1. Third, we present extensive experiments on various datasets, showing that DNP complements any existing DM or its variant. Fourth, we show that the process can be automated by using a pre-trained image captioner, leading to auto-DNP. Finally, we show that DNP is trivial to implement and requires no training.", + "bbox": [ + 212, + 146, + 787, + 313 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Diffusion Models", + "text_level": 1, + "bbox": [ + 215, + 337, + 415, + 353 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Latent Diffusion: DMs combine a forward and a backward process for generative modeling. In the forward process, a sample is gradually corrupted by sequential application of small amounts of Gaussian noise. The backward process then sequentially denoises the sample using a learned neural network $\\epsilon_{\\theta}$ . Latent DMs (LDMs) increase the efficiency of the diffusion process by operating on the low dimensional latent space $\\mathcal{Z}$ of an autoencoder, implemented with a pretrained encoder/decoder pair $(\\mathcal{E}(.)$ , $\\mathcal{D}(.)$ ). This transforms image $x \\in \\mathcal{X}$ into latent representation $z = \\mathcal{E}(x) \\in \\mathcal{Z}$ and reconstructs the image with $x = \\mathcal{D}(\\mathcal{E}(z))$ .", + "bbox": [ + 212, + 371, + 787, + 492 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Training: In the forward process, a noisy version of the latent representation is obtained at each time step $t$ with $z_{t} = \\sqrt{\\bar{\\alpha}_{t}} z + \\sqrt{1 - \\bar{\\alpha}_{t}}\\epsilon$ . Here, $\\bar{\\alpha}_t = \\prod_{s=1}^t (1 - \\beta_s)$ , where $\\{\\beta_1, \\dots, \\beta_T\\}$ is fixed according to the variance schedule and $\\epsilon \\sim \\mathcal{N}(0, I)$ . In the backward process, the denoising model $\\epsilon_{\\theta}$ estimates the noise $\\epsilon_t$ added to the noisy latent representation at each time step $t$ . The denoising is conditioned by the embedding $\\tau(\\mathbf{p})$ , of text prompt $\\mathbf{p}$ , where $\\tau(.)$ is a text encoder. The denoising network parameters are learned by minimizing the loss", + "bbox": [ + 212, + 492, + 787, + 599 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} = \\mathcal {E} _ {t \\sim \\mathcal {U} (1, T), \\epsilon_ {t} \\sim \\mathcal {N} (0, I)} \\left[ \\| \\epsilon_ {t} - \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right) \\| ^ {2} \\right], \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 336, + 611, + 784, + 636 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\mathcal{U}$ and $\\mathcal{N}$ are the uniform and Gaussian distributions, respectively.", + "bbox": [ + 212, + 646, + 740, + 660 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Inference: Given prompt $\\mathbf{p}$ , images are sampled by iteratively alternating between denoising and sampling, with", + "bbox": [ + 212, + 661, + 784, + 691 + ], + "page_idx": 3 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} _ {p} = \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right), \\quad z _ {t - 1} = \\text {s a m p l e} \\left(z _ {t}, \\hat {\\epsilon} _ {p}, t\\right). \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 343, + 705, + 784, + 722 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The sampling method, sample, varies with the DM. Popular approaches are DDPM [9] and DDIM [27]. This process is initialized with a noise seed $z_{T} \\sim \\mathcal{N}(0,I)$ and produces a latent image code $z_{0}$ , which is finally passed to the decoder to obtain image $x_{0} = \\mathcal{D}(z_{0})$ .", + "bbox": [ + 212, + 733, + 787, + 794 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Classifier-free Guidance: CFG [11] is a method to trade off prompt compliance and image diversity. It consists of training the DM with and without prompt $\\mathbf{p}$ , randomly setting $\\mathbf{p}$ to the empty prompt $\\phi = \"$ \", with probability", + "bbox": [ + 212, + 794, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 462, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "$P_{\\text{uncond}} = 0.1$ . At inference, each denoising step uses a linear combination of the prompt-conditional $(\\hat{\\epsilon}_p)$ and unconditional $(\\hat{\\epsilon}_{\\phi})$ noise estimates", + "bbox": [ + 215, + 146, + 782, + 176 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {\\phi}), \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 431, + 189, + 784, + 204 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\hat{\\epsilon}_p = \\epsilon_\\theta (z_t;t,\\tau (\\mathbf{p}))$ , $\\hat{\\epsilon}_{\\phi} = \\epsilon_{\\theta}(z_{t};t,\\tau (\\phi))$ , and $s$ is an hyper-parameter that controls the conditioning strength, known as the guidance-scale. The modified noise $\\hat{\\epsilon}$ is then utilized to update the latent representation.", + "bbox": [ + 212, + 215, + 782, + 260 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Negative Prompting: Despite conditioning on text prompt $\\mathbf{p}$ , prompt adherence of CFG can be weak when $\\mathbf{p}$ refers to complex scenes, such as that in Figure 1. Negative prompting [16] is useful as an extra conditioning input. Given negative prompt $\\mathbf{n}$ , the inference denoising steps are implemented with", + "bbox": [ + 214, + 261, + 784, + 321 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n}) \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 434, + 334, + 784, + 349 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where", + "bbox": [ + 215, + 359, + 261, + 372 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {c} _ {n} = \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {n})\\right). \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 434, + 375, + 784, + 390 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Practitioners have shown that simply replacing the empty prompt $\\phi$ of CFG with the negative prompt $\\mathbf{n}$ , i.e. using $\\hat{\\epsilon} = \\hat{\\epsilon}_n + s(\\hat{\\epsilon}_p - \\hat{\\epsilon}_n)$ , yields similar results, albeit for a slightly different guidance scale $s$ [1]. This has the benefit of computational efficiency, as it only requires the calculation of two noise vectors instead of three. Hence, this method has gained popularity and has become the default implementation of negative prompting in many T2I generation models. However, in what follows, we use the theoretically more grounded (4) to derive a procedure to sample diffusion-negative images $(\\bar{\\mathcal{I}})$ .", + "bbox": [ + 212, + 396, + 784, + 517 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Creating Good Negative Prompts", + "text_level": 1, + "bbox": [ + 215, + 540, + 578, + 558 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we introduce DNP.", + "bbox": [ + 215, + 571, + 455, + 585 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Energy-based model interpretation", + "text_level": 1, + "bbox": [ + 215, + 608, + 549, + 625 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Sampling with a DM of network $\\epsilon_{\\theta}(z_t; t, \\tau(\\mathbf{p}))$ can be interpreted as sampling from probability distribution $p_{\\theta}(z_t | \\mathbf{p}) \\propto e^{-E_{\\theta}(z_t; t, \\tau(\\mathbf{p}))}$ , where $E_{\\theta}$ is an energy function, using the score function $\\nabla_z \\log P(z | \\mathbf{p})$ and Longevin dynamics [28,30]. The DM network is trained to learn the score function, i.e.", + "bbox": [ + 212, + 632, + 782, + 691 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right) = - \\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} \\mid \\tau (\\mathbf {p})\\right). \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 370, + 705, + 784, + 720 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "This motivates the CFG denoising step of (3), which corresponds to sampling from the distribution", + "bbox": [ + 214, + 731, + 782, + 760 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\np _ {c f g} \\left(z _ {t}, \\mathbf {p}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {c f g} ^ {s} \\left(z _ {t}, \\mathbf {p}\\right) \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 398, + 773, + 784, + 789 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where", + "bbox": [ + 215, + 800, + 261, + 813 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\gamma_ {c f g} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)}{p _ {\\theta} \\left(z _ {t}\\right)} \\propto p _ {\\theta} (\\mathbf {p} \\mid z _ {t}) \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 811, + 782, + 842 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Improving image synthesis with diffusion-negative sampling", + "bbox": [ + 334, + 114, + 732, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "is a guidance factor that increases the probability of codes $z_{t}$ corresponding to images compliant with prompt $\\mathbf{p}$ . Similarly, the negative prompt denoising step of (4) corresponds to sampling from", + "bbox": [ + 212, + 146, + 784, + 191 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\np _ {n p} \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {n p} ^ {s} \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) \\tag {9}\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 205, + 785, + 223 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "with guidance factor", + "bbox": [ + 215, + 234, + 367, + 250 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\gamma_ {n p} (z _ {t}, \\mathbf {p}, \\mathbf {n}) = \\frac {p _ {\\theta} (z _ {t} | \\mathbf {p})}{p _ {\\theta} (z _ {t} | \\mathbf {n})} \\propto \\frac {p _ {\\theta} (\\mathbf {p} | z _ {t})}{p _ {\\theta} (\\mathbf {n} | z _ {t})}. \\tag {10}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 262, + 785, + 296 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This increases the probability of sampling latent codes $z_{t}$ of large odds ratio", + "bbox": [ + 215, + 305, + 764, + 321 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\no \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) = \\frac {p _ {\\theta} (\\mathbf {p} \\mid z _ {t})}{p _ {\\theta} (\\mathbf {n} \\mid z _ {t})}. \\tag {11}\n$$\n", + "text_format": "latex", + "bbox": [ + 421, + 334, + 785, + 367 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Since the Bayes decision rule for deciding between $\\mathbf{p}$ and $\\mathbf{n}$ is to choose $\\mathbf{p}$ when $o(z_{t},\\mathbf{p},\\mathbf{n})\\geq 1$ and $\\mathbf{n}$ otherwise, it increases the probability that sampled codes comply with prompt $\\mathbf{p}$ and not with prompt $\\mathbf{n}$ .", + "bbox": [ + 214, + 377, + 785, + 422 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Limitations of Negative Prompting", + "text_level": 1, + "bbox": [ + 215, + 446, + 552, + 465 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Besides being theoretically well-motivated, negative prompting frequently improves image quality, as illustrated in the top row of Figure 2a. However, negative prompts are difficult to specify, because a natural negative frequently does not exist or does not produce the intended results. Figure 2b shows an example for prompt $\\mathbf{p} =$ \"a cat and a dog\". Here, the user may need to attempt several negative prompts $\\mathbf{n}$ , requiring multiple iterations of image synthesis, as illustrated in the figure. Eventually, the user notices the insistence of the DM in brown objects and uses $\\mathbf{n} =$ \"brown\". This is complemented with \"ugly\", which practitioners have identified as a good general-use negative prompt. To compound the problem, a negative prompt successful for one random seed can be unsuccessful for another seed, i.e. good negative prompts depend on both prompt $\\mathbf{p}$ and seed $z_{T}$ , as illustrated in Figure 2a. In summary, negative prompting is an art form and can be quite cumbersome, even when successful.", + "bbox": [ + 212, + 476, + 787, + 672 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In practice, the human-provided negative prompt frequently fails to improve the quality of the image generated by the DM. We hypothesize that this is because the semantic representation of the DM is only a weak approximation to that of humans. Hence, there is no guarantee that, under the probability distribution modeled by the DM, there will be a large classification margin between $\\mathbf{p}$ and the human-provided $\\mathbf{n}$ . In this case, negative prompting fails to produce samples of large odds ratio $o(z_{t},\\mathbf{p},\\mathbf{n})$ and the prompt pair $(\\mathbf{p},\\mathbf{n})$ fails to induce the model to produce more prompt compliant images than those generated with CFG, i.e. the posterior probability $p_{\\theta}(\\mathbf{p}|z_t)$ of (8). In the extreme case where $p_{\\theta}(\\mathbf{p}|z_t)\\approx p_{\\theta}(\\mathbf{n}|z_t)$ for the samples of high $p_{\\theta}(\\mathbf{p}|z_t)$ , $o(z_{t},\\mathbf{p},\\mathbf{n})\\approx 1$ for those samples and (9) looses all sensitivity to prompt $\\mathbf{p}$ .", + "bbox": [ + 212, + 674, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 462, + 127 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 Diffusion-Negative Guidance", + "text_level": 1, + "bbox": [ + 215, + 146, + 498, + 161 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The discussion above suggests that a good negative prompt for the DM \"grounds\" the odds-ratio of (11), providing a reference for the prompt $\\mathbf{p}$ , which is defined in terms of the margin to negative $\\mathbf{n}$ . However, this grounding must happen under the internal representation of the DM, which is not necessarily that of humans. The goal is to encourage samples more likely to comply with given prompt $\\mathbf{p}$ than the negative prompt, under the conceptual representation of the model. We formalize this goal by defining the optimal negative prompt $\\mathbf{n}^*$ for the DM as the one that maximizes the steepness of the odds ratio with $\\mathbf{p}$ , i.e.", + "bbox": [ + 212, + 169, + 787, + 291 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\mathbf {n} ^ {*} (\\mathbf {p}) = \\arg \\max _ {\\mathbf {n}} \\nabla_ {z _ {t}} \\log o (z _ {t}, \\mathbf {p}, \\mathbf {n}). \\tag {12}\n$$\n", + "text_format": "latex", + "bbox": [ + 377, + 300, + 785, + 321 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "This is denoted as the diffusion-negative prompt for $\\mathbf{p}$ . Using (2), (5), and (11),", + "bbox": [ + 215, + 328, + 784, + 344 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\nabla_ {z _ {t}} \\log o (z _ {t}, \\mathbf {p}, \\mathbf {n}) = \\nabla_ {z _ {t}} \\log \\frac {p _ {\\theta} (\\mathbf {p} | z _ {t})}{p _ {\\theta} (\\mathbf {n} | z _ {t})} = \\nabla_ {z _ {t}} \\log \\frac {p _ {\\theta} (z _ {t} | \\mathbf {p})}{p _ {\\theta} (z _ {t} | \\mathbf {n})} = \\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n}. \\tag {13}\n$$\n", + "text_format": "latex", + "bbox": [ + 254, + 364, + 785, + 397 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Hence, for a given $z_{t}$ , a natural alternative definition of the diffusion-negative prompt is that which induces the noise vector maximally distant from $\\hat{\\epsilon}_{p}$ , i.e.", + "bbox": [ + 214, + 402, + 785, + 435 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\epsilon_ {n ^ {*}} = \\underset {n \\mid \\| \\hat {\\epsilon} _ {n} \\| ^ {2} = K} {\\arg \\max } \\left\\| \\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n} \\right\\| ^ {2} \\tag {14}\n$$\n", + "text_format": "latex", + "bbox": [ + 406, + 443, + 785, + 472 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $K$ prevents the noise magnitude from becoming infinitely large. This is the prompt that induces the steeper log odds surface at $z_{t}$ , encouraging the largest margin between the probabilities $p_{\\theta}(z_t|\\mathbf{p})$ and $p_{\\theta}(z_t|\\mathbf{n}^*)$ in the neighborhood of $z_{t}$ . In Supplementary Section 1, we show that (14) has a solution", + "bbox": [ + 214, + 479, + 787, + 541 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} _ {n ^ {*}} = - \\sqrt {K} \\frac {\\hat {\\epsilon} _ {p}}{\\| \\hat {\\epsilon} _ {p} \\|} \\propto - \\hat {\\epsilon} _ {p}. \\tag {15}\n$$\n", + "text_format": "latex", + "bbox": [ + 415, + 550, + 785, + 580 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Choosing $K = \\| \\hat{\\epsilon}_p\\|^2$ , i.e. equal noise strength under the positive and negative conditions, results in $\\hat{\\epsilon}_{n^*} = -\\hat{\\epsilon}_p$ .", + "bbox": [ + 214, + 590, + 785, + 625 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.4 Diffusion-Negative Sampling (DNS)", + "text_level": 1, + "bbox": [ + 215, + 642, + 542, + 657 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "It follows from (6) that", + "bbox": [ + 215, + 664, + 387, + 680 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} | \\mathbf {n} ^ {*}\\right) = - \\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} | \\mathbf {p}\\right) \\Longrightarrow p _ {\\theta} \\left(z _ {t} | \\mathbf {n} ^ {*}\\right) \\propto \\frac {1}{p _ {\\theta} \\left(z _ {t} | \\mathbf {p}\\right)}. \\tag {16}\n$$\n", + "text_format": "latex", + "bbox": [ + 259, + 689, + 785, + 720 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "However, for most $p_{\\theta}(z_t|\\mathbf{n})$ , (16) is an improper distribution [4]. This stems from the fact that a negative condition must be specified in context [5]. A general contextual constraint for DM-based sampling is that the negatively conditioned DM should still sample images from the image distribution $p_{\\theta}(z_t)$ . To account for this, we define the diffusion-negative guidance factor as", + "bbox": [ + 212, + 727, + 787, + 804 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\gamma_ {d n} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t}\\right)}{p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)} \\propto \\frac {1}{p _ {\\theta} \\left(\\mathbf {p} \\mid z _ {t}\\right)}, \\tag {17}\n$$\n", + "text_format": "latex", + "bbox": [ + 383, + 811, + 785, + 844 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Improving image synthesis with diffusion-negative sampling", + "bbox": [ + 334, + 114, + 732, + 130 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "which leads to the diffusion-negative distribution", + "bbox": [ + 215, + 146, + 571, + 162 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\np _ {d n} \\left(z _ {t}, \\mathbf {p}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {d n} ^ {s} \\left(z _ {t}, \\mathbf {p}\\right) \\tag {18}\n$$\n", + "text_format": "latex", + "bbox": [ + 393, + 176, + 785, + 191 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "and inference denoising equation", + "bbox": [ + 215, + 204, + 455, + 219 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {\\phi} - \\hat {\\epsilon} _ {p}). \\tag {19}\n$$\n", + "text_format": "latex", + "bbox": [ + 431, + 233, + 785, + 250 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Sampling with this equation is denoted as diffusion-negative sampling (DNS). When compared to (10), the diffusion-negative guidance factor of (17) has two main differences. First, it does not require the semantic negative prompt $\\mathbf{n}$ , reflecting the fact that the definition of negative is fully based on the internal representation of the DM. Second, it replaces the odds ratio of (11) by the ratio between the image distribution $p_{\\theta}(z_t)$ and the image distribution under the positive condition $\\mathbf{p}$ . This emphasizes sampling images from the DM probability distribution with the lowest prompt conditional probability $p_{\\theta}(z_t|\\mathbf{p})$ . When compared to the guidance factor (8) of CFG, (17) simply flips the role of the image distributions $p_{\\theta}(z_t)$ and $p_{\\theta}(z_t|\\mathbf{p})$ . This provides a simple interpretation of diffusion-negative guidance as the \"opposite\" of CFG. Rather than sampling natural images that align best with the condition $\\mathbf{p}$ , it emphasizes sampling natural images that least comply with it.", + "bbox": [ + 215, + 261, + 787, + 458 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The relation between the guidance factors of (17) and (10)", + "bbox": [ + 238, + 458, + 663, + 474 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\gamma_ {d n} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t}\\right)}{p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)} = \\gamma_ {n p} \\left(z _ {t}, \\phi , \\mathbf {p}\\right) \\tag {20}\n$$\n", + "text_format": "latex", + "bbox": [ + 372, + 488, + 785, + 520 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "makes the implementation of DNS trivial for any model that supports negative prompting. It suffices to prompt the latter with empty positive prompt $\\phi$ and negative prompt $\\mathbf{p}$ . Hence, DNS requires no retraining of the $DM$ , nor any optimizations at inference.", + "bbox": [ + 215, + 530, + 787, + 590 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.5 Diffusion-Negative Prompting (DNP)", + "text_level": 1, + "bbox": [ + 215, + 614, + 555, + 633 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "DNP relies on DNS to implement the procedure of Figure 1. Given prompt $\\mathbf{p}$ , DNS is used to sample a diffusion-negative image, $\\bar{\\mathcal{I}}$ , as discussed above. This image is then captioned by the user, to produce the DNP $\\mathbf{n}^*$ . The DM is finally prompted with the prompt pair $(\\mathbf{p}, \\mathbf{n}^*)$ to produce the final image. As illustrated in Figure 1, the captioning step can be performed by either the user or any captioning model. In the latter case, the process is denoted auto-DNP. auto-DNP has the advantage of fully automating DNP, making the entire process transparent to the user and reducing user effort. The price is a small increase in the failure rate due to captioning errors. In this paper, we use BLIP2 [14] as the captioning model to implement auto-DNP. However, auto-DNP can be used with any other captioner. We show results obtained with GPTv4 (gpt-4-vision-preview) in Supplementary Section 4. Figure 3 and the final column of Figure 4 illustrate how DNP produces images that either have higher quality or comply better with the prompt $\\mathbf{p}$ .", + "bbox": [ + 215, + 643, + 787, + 843 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 464, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 215, + 143, + 375, + 162 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section, we discuss the experimental evaluation of DNP.", + "bbox": [ + 215, + 175, + 663, + 191 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.1 Datasets", + "text_level": 1, + "bbox": [ + 215, + 210, + 333, + 226 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For a comprehensive dataset description see Supplementary Section 2.2", + "bbox": [ + 215, + 234, + 730, + 250 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Existence and Attribute Binding (A&E) Dataset: This is the benchmark dataset introduced by [3]. This dataset is focused on entity neglect, which occurs when one or more entities are completely ignored by the generative model, and attribute assignment, which evaluates whether an attribute is associated with the correct object in the image. To evaluate these, each prompt in the dataset comprises two entities and their associated attributes. There are three categories of prompts: (1) \"an animal and an animal\"; (2) \"a color in-animate object and an animal\"; (3) \"a color in-animate object and a color in-animate object\". We sample 50 prompts from each category for 32 random seeds.", + "bbox": [ + 215, + 251, + 785, + 386 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Human and Hand Generation (H&H) Dataset: Humans and hands occur in various shapes and forms, including gender, race, activity, and individual differences. Despite the size of the training datasets, this variation has posed a major challenge to DMs, which are known to synthesize images with extra or merged limbs and fingers. We curated a challenging benchmark dataset to test the effect of DNP on human and hand generation. The dataset consists of 45 human-based prompts such as \"a man wearing a sombrero\" and 25 hand-based prompts such as \"hand with a ring on it\". We run all prompts for 32 seeds.", + "bbox": [ + 215, + 387, + 785, + 508 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.2 Evaluation Metrics", + "text_level": 1, + "bbox": [ + 215, + 527, + 419, + 544 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Text-Image CLIP Score: [8] is a widely used metric of the similarity between a generated image and its text prompt. For the H&H dataset, we calculate the CLIP Score between each generated image and its corresponding prompt. For the A&E dataset, we follow the evaluation protocols established by [3], which measure CLIP Score at full prompt and entity level. For evaluating the Full Prompt CLIP Score, we calculate the score between the generated image and the full prompt. For the Minimum Object CLIP Score, we take the minimum score between the entities in the prompt, as the entity with the minimum CLIP Score represents the neglected entity for the given prompt. This allows us to measure the CLIP Score at two levels, thereby providing better insight into the presence of both entities in the A&E dataset prompts.", + "bbox": [ + 215, + 551, + 785, + 719 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Inception Score (IS): [25] is a popular metric for assessing the quality and realism of images. It is the exponential of the average of the entropy of the label distribution predicted by the Inception v3 classifier model. In particular, we choose IS over FID as it does not require a dataset with real images.", + "bbox": [ + 215, + 719, + 785, + 779 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Human Evaluation: While CLIP Score and IS provide an objective measure of correctness and quality, they are known for not being fully aligned with human aesthetics and preferences. To evaluate DNP in terms of human preferences, we used Amazon Mechanical Turk (AMT) to evaluate a subset of each dataset. We", + "bbox": [ + 215, + 779, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Improving image synthesis with diffusion-negative sampling", + "bbox": [ + 334, + 114, + 730, + 130 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/33c300141bcf85d9c9596096fbc161a9a015802a1b276440002aa447c9ee6258.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodCLIP Score
HumanHandA&E
Min. ObjectFull Prompt
SD+auto-DNP0.3300.3230.2500.344
SD+DP0.3310.3240.2530.345
", + "bbox": [ + 305, + 143, + 702, + 210 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Table 1: Benchmarking DNP to auto-DNP with CLIP Score.", + "bbox": [ + 303, + 212, + 697, + 223 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "performed human evaluation on 100 prompt-seed pairs for the human dataset, 100 pairs for the Hands dataset, and 150 (50 per category) pairs for the A&E dataset. The evaluators were asked to compare the images using two criteria. 1) Adherence to the prompt, and 2) Quality (natural or realistic nature) of the image. MTurkers were tasked with choosing one image based the two criteria. They could also choose no clear winner if they did not prefer one over the other. More details can be found in the Supplementary Section 2.3.", + "bbox": [ + 212, + 267, + 787, + 373 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.3 Benchmarking DNP vs auto-DNP", + "text_level": 1, + "bbox": [ + 214, + 396, + 511, + 411 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The evaluation of DNP requires human users. PhD students, with no experience in visual language research, were shown an image and asked to produce a caption shorter than 60 words. Due to the prohibitive resources required to caption the image $\\bar{\\mathcal{I}}$ for all prompt-seed pairs of all the datasets, we restricted the evaluation of DNP to the prompt-seed pairs used for human evaluation. We compared the performance of DNP and auto-DNP on this set and used auto-DNP in the remaining experiments. Besides being cost-effective, this enables the replication of our experiments for comparison to other negative prompting methods. Table 1 compares the performance of DNP and auto-DNP, on the prompt-seed pairs used for the human evaluation1. For the rest of the paper, we use the notation DM+X, where DM is the diffusion model and X the negative prompting method.", + "bbox": [ + 212, + 421, + 787, + 587 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "While DNP achieves the best performance, auto-DNP provides almost identical results. This suggests that the BLIP2 model is quite effective at captioning the diffusion-negative negative images $\\bar{\\mathcal{I}}$ .", + "bbox": [ + 212, + 587, + 787, + 633 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.4 Quantitative Results", + "text_level": 1, + "bbox": [ + 214, + 656, + 433, + 671 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We next discuss the results of quantitative experiments on image quality using auto-DNP. Various ablations are also presented in Supplementary Section 4.", + "bbox": [ + 212, + 681, + 785, + 710 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "A&E dataset: We first compare SD to $\\mathrm{SD + }$ auto-DNP, on the A&E dataset in Table 2a. $\\mathrm{SD + }$ auto-DNP achieves a Min. Object CLIP Score of 0.258, which is $6.6\\%$ higher than that of SD, illustrating that $\\mathrm{SD + }$ auto-DNP generates images that align better with the prompts. Since CLIP scores practically range from [0, 0.4] [8], the full prompt CLIP Score of 0.346 of $\\mathrm{SD + }$ auto-DNP suggests good alignment between prompt and image. Human evaluation underscores the true", + "bbox": [ + 212, + 710, + 787, + 801 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 462, + 126 + ], + "page_idx": 9 + }, + { + "type": "page_footnote", + "text": "1 IS score cannot be computed in this case as the number of seeds per prompt is not large enough for IS to provide reliable results.", + "bbox": [ + 217, + 810, + 785, + 839 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/2f543eb94bd0c2a32cf0b369aa31881ea76301b95f8178c1fd38eef5ad2e6577.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
MethodCLIP ScoreISHuman Evaluation
Min. ObjectFull PromptCorrectnessQuality
No Clear Winner---16.88%10.46%
Stable Diffusion (SD)0.2420.33513.1718.90%25.73%
SD+auto-DNP0.258 (+6.61%)0.346 (+3.28%)13.35 (+1.37%)64.22%63.81%
No Clear Winner---16.95%7.35%
Attend & Excite (A&E)0.2640.34911.8630.06%33.12%
A&E+auto-DNP0.276 (+4.54%)0.362 (+3.72%)13.12 (+10.62%)52.99%59.53%
", + "bbox": [ + 276, + 143, + 733, + 224 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/4197a34ffcb1fb203bc0592fc7bdb269030b6fc0f65a172c15c1c8c06ea687e5.jpg", + "table_caption": [ + "(a) Quantitative Results on the A&E dataset." + ], + "table_footnote": [], + "table_body": "
DatasetMethodCLIP ScoreISHuman Evaluation
CorrectnessQuality
Human PromptsNo Clear Winner--14.42%5.10%
Stable Diffusion (SD)0.3229.9527.60%29.0%
SD+auto-DNP0.331 (+2.80%)10.13 (+1.80%)57.98%65.80%
Hand PromptsNo Clear Winner--19.89%8.18%
Stable Diffusion (SD)0.30912.0420.45%22.47%
SD+auto-DNP0.321 (+3.88%)12.39 (+2.94%)59.66%69.35%
", + "bbox": [ + 277, + 251, + 733, + 333 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "(b) Quantitative Results on the H&H dataset.", + "bbox": [ + 348, + 334, + 653, + 345 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Table 2: Quantitative Results: comparing prompt adherence and image quality by CLIP Score, IS and Human Evaluation. The percentage gains are shown in (brackets)", + "bbox": [ + 215, + 358, + 784, + 388 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "strength of DNP, as human evaluators prefer images generated by $\\mathrm{SD} + \\mathrm{auto}$ -DNP $3.4\\times$ more in terms of correctness and $2.5\\times$ more in terms of quality than those generated by SD. Note that $\\mathrm{SD} + \\mathrm{auto}$ -DNP even outperforms the $A\\& E$ model in IS and matches its CLIP Score for both full prompt and minimum object, despite not being specifically designed for multiple object generation.", + "bbox": [ + 212, + 446, + 784, + 523 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To demonstrate the flexibility of the DNP approach, we also applied it to the $A\\& E$ model, comparing $A\\& E + \\text{auto-DNP}$ to $A\\& E$ . We observe a moderate increase in the CLIP Score since $A\\& E$ is already quite efficient at generating multiple objects. $A\\& E + \\text{auto-DNP}$ achieves a Min. Object CLIP Score of 0.276, which is very close to the theoretical upper bound for Min. Object CLIP Score of 0.29 as defined by [3]. The $10.62\\%$ improvement in IS shows that $A\\& E$ is more inclined to generate unrealistic images and the addition of DNP improves its realism. The human evaluation also reflects this, as around $53\\%$ of the evaluators prefer $A\\& E + \\text{auto-DNP}$ over the $A\\& E$ images for correctness and $60\\%$ for quality, which is close to $1.8\\times$ the preference for $A\\& E$ .", + "bbox": [ + 212, + 530, + 787, + 681 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "H&H dataset: Table 2b summarizes the ability of DNP to address the specific SD weaknesses of synthesizing humans and hands. Since both CLIP and IS may ignore distorted or maligned results when considering correctness or realism, they fail to give substantial insight into image quality (despite improvement). The human evaluation is much more important for this task. SD+auto-DNP outperforms SD by a substantial margin, as evaluators prefer SD+auto-DNP $3 \\times$ more for correctness and $2 \\times$ more for quality, for both human and hand prompts. Since evaluators were specifically tasked with checking the number and pose of limbs and fingers and the quality of the faces, their preference for images generated with DNP shows that the latter improves SD performance substantially.", + "bbox": [ + 212, + 689, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Improving image synthesis with diffusion-negative sampling", + "bbox": [ + 334, + 114, + 730, + 130 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/dbacb51d43429b029e7caf8996361a829e3593c9206c564f4eb7f1f8854b1390.jpg", + "image_caption": [ + "Prompts with Humans", + "p: a boy in the moonlight n*: a living room with a fireplace and wooden beams" + ], + "image_footnote": [], + "bbox": [ + 222, + 156, + 408, + 229 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/789f5ff4fb08412c62ddbe2cc264a469a101aa0e7e328798935e9877330a7e24.jpg", + "image_caption": [ + "Prompts with Multiple Nouns", + "p: a cat and a dog $\\mathbf{n}^*$ : an aerial view of a resort with a swimming pool" + ], + "image_footnote": [], + "bbox": [ + 408, + 156, + 596, + 229 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/75c83b9675a1467925efbd6b7b9b5715eaaddaea9da0eef94cf76f37e5156877.jpg", + "image_caption": [ + "Prompts with Hands", + "p: a hand with a ring on it" + ], + "image_footnote": [], + "bbox": [ + 596, + 156, + 784, + 229 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/fcf30f4aab035b8289249a5876a8df1278416f75d09ca9f9bbed1646be2eede5.jpg", + "image_caption": [ + "p: a man in a sombrero \nn*: a modern three story townhouse with two garages" + ], + "image_footnote": [], + "bbox": [ + 220, + 244, + 408, + 319 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/4e8bf7651c4258dfec08a6df5a82d996b9a75d44d14c834a12e8b57880489006.jpg", + "image_caption": [ + "p: a boy playing with his dog n*: three bowls of stew with vegetables and herbs" + ], + "image_footnote": [], + "bbox": [ + 408, + 244, + 596, + 319 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/65cf8144a32e5429450941ee89db357bc3144a3bdda417ec15ca42903a404646.jpg", + "image_caption": [ + "$\\mathbf{n}^{*}$ : a woman in a black dress on the red carpet", + "p: a closeup of a handshake" + ], + "image_footnote": [], + "bbox": [ + 596, + 244, + 784, + 319 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/ef513672a64542ddddf6b6c9763114dd59b8bae5b39ea087244ec5d5de275d56.jpg", + "image_caption": [ + "p. a child on the couch n*: men and women in suits and ties in front of a crowd", + "Fig. 3: Images synthesized by SD (left) for prompt p vs. $\\mathrm{SD + }$ auto-DNP (right) for prompt pair $(\\mathbf{p},\\mathbf{n}^{*})$ , where $\\mathbf{n}^*$ is the DNP estimated from the DNS image. DNP produces negative prompts that are not intuitive for humans but improve quality and adherence." + ], + "image_footnote": [], + "bbox": [ + 220, + 334, + 408, + 407 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/7bfd6aebdab7ecc6ef6487f8defc96db17651790879e8faf333a726366b12783.jpg", + "image_caption": [ + "p: a bear with a brown crown \nn*: a rendering of the plans for a home" + ], + "image_footnote": [], + "bbox": [ + 408, + 334, + 596, + 407 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/37825c15ee54050697eda67484b53f438bfab170168628c476d0ce6ed9e05d92.jpg", + "image_caption": [ + "$\\mathbf{n}^{*}$ : an aerial view of a large home in the woods", + "p: a tattooed hand", + "n*: four pictures of a house, a car and a tree" + ], + "image_footnote": [], + "bbox": [ + 598, + 334, + 784, + 407 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.5 Qualitative Results", + "text_level": 1, + "bbox": [ + 215, + 508, + 419, + 523 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Figure 3 shows qualitative examples from the three datasets, comparing SD with SD+auto-DNP. There are more visual examples in Supplementary Section 5.", + "bbox": [ + 212, + 545, + 784, + 575 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The H&H dataset results, e.g. the images synthesized for prompt \"hand with a ring on it\", illustrate how auto-DNP improves the quality of humans and hands in terms of the number of limbs, fingers, poses, etc. It also induces the model to create realistic images, rather than drawings or sketches. See, for example, the \"man in a sombrero\" and \"boy in the moonlight\" examples. We observe a major improvement in the quality of the humans generated by auto-DNP wherein the faces do not exhibit the uncanny, robotic, or distorted features that SD is inclined to create, instead having a natural warmth.", + "bbox": [ + 212, + 578, + 787, + 699 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The results on the A&E dataset show that auto-DNP can correct for entity neglect while ensuring superior image quality. This is especially visible when we compare $A\\& E$ with $A\\& E + \\text{auto-DNP}$ (see Figures 5,6,7 in Supplementary Section 5), which produces more realistic images. We posit that auto-DNP's inclination towards generating more realistic images is due to setting the diffusion process onto a better Markov chain without disrupting it at each step, unlike $A\\& E$ .", + "bbox": [ + 212, + 700, + 787, + 792 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Finally, note that none of the negative prompts produced by auto-DNP in Figure 3 is intuitive for humans. This illustrates the semantic gap between humans and SD and the difficulty of producing good negative prompts manually.", + "bbox": [ + 212, + 795, + 787, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 462, + 126 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/b2b9a837519080e6dab3e0670fb4bb9281a0e5c7f4ea05fdfa58bacdc88761bb.jpg", + "image_caption": [ + "Fig. 4: Exploring Semantic Gap: From left to right: 1) images generated for prompt p, 2) DNS images generated by the DM and resulting caption $\\mathbf{n}^*$ by DNP, 3) images synthesized with $\\mathbf{n}^*$ as the negative prompt alone, and 4) with prompt pair $(\\mathbf{p},\\mathbf{n}^{*})$" + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 290, + 233 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/8597c17d18fec48a5d9160ffb6406bee982ceadd20967e6e1015ef79ee01d629.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 292, + 143, + 364, + 233 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/e8bad81d8b6055a3b0b5cba7e264d30f3779897dd6ccc0b909e905c4d881e1db.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 364, + 143, + 431, + 233 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/3a19ae7db6e0f76e8180db4ccf850362c49daf8b0cd4ba99ab1f840c29064ed8.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 431, + 143, + 500, + 234 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/06a8b7c9f7aa63e36a9c93ea23e394ebaf6154e2e7c4e42e06697a11a27f259f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 501, + 143, + 573, + 234 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/325fe574ed53e9c18d889d261a5c2ae523b73836e2acade4d3c7208d13c987b5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 573, + 143, + 643, + 234 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/7188aae081dc96767b091d9d99bfde0c68b0d44d4b03be4cbd72091f2018a195.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 643, + 143, + 784, + 234 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.6 Semantic Gap", + "text_level": 1, + "bbox": [ + 215, + 314, + 377, + 330 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Figure 4 explores the semantic gap between humans and DMs in more detail. From left to right, the first column shows images synthesized by SD with prompt $\\mathbf{p}$ . The second column shows examples of images sampled with DNS, i.e. (19). These can be seen as images that the model hallucinates as \"negatives\" of the prompt $\\mathbf{p}$ since they usually do not have this interpretation for humans. The caption $\\mathbf{n}^*$ is obtained the user. To confirm that the prompt mirrors the DM internal representation of the \"negative\" for the image in the left column, we prompted the model with an empty positive prompt $\\mathbf{p} = \\phi$ and $\\mathbf{n}^*$ as a negative prompt, which produces the images in the third column of the figure. Note how these images comply with $\\mathbf{p}$ even though $\\mathbf{n}^*$ is non-intuitive for a human. Finally, the last column shows the result of prompting with the pair $(\\mathbf{p}, \\mathbf{n}^*)$ . In all cases, the synthesized image is at least as good as that on the first column, and usually better, e.g. a greener forest or a more realistic bird.", + "bbox": [ + 212, + 337, + 787, + 532 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Two aspects are worth noting. First, these examples purposefully use prompts $\\mathbf{p}$ for which SD works well. This proves that the \"DM knows what it's doing,\" at least to the point of generating a sensible image (first column). However, its notion of negative is totally different from that of humans, demonstrating the semantic gap between the two. The practical result is that a totally unintuitive negative prompt is needed to produce good images. Figure 3 shows that auto-DNP can improve the quality and correctness of the synthesised image even when the DM fails. Second, because all derivations above are functions of $z_{t}$ , the DNS procedure is valid for any seed $z_{T}$ . This is an additional advantage over the human-centric negative prompting of Figure 2a, whose success is seed-dependent.", + "bbox": [ + 212, + 534, + 787, + 685 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "5 Related Work", + "text_level": 1, + "bbox": [ + 215, + 704, + 387, + 720 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Text-to-Image Diffusion: High-resolution T2I generation has advanced dramatically with the introduction of large-scale diffusion models, due to: (1) availability of large-scale text-image datasets [2, 26], (2) advances in various training and inference techniques [9-11, 27], and, (3) development of scalable model architectures [19, 20, 22, 24]. The most popular T2I models employ classifier-free guidance [11] to balance prompt compliance and image diversity using a guidance scale hyper-parameter, $s$ . While prompt adherence improves by increasing", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Improving image synthesis with diffusion-negative sampling", + "bbox": [ + 334, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "$s$ , image quality deteriorates beyond a certain value. DNP helps ensure prompt adherence even for lower values of $s$ , thereby maintaining image quality.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Structured Image Conditioning: Various image generation and editing improvements have been introduced since the advent of DMs. They range from finetuning the models for certain tasks to editing the noise at each iteration. Many methods require users to provide structured conditioned inputs like layouts [15, 18, 32], example images [13, 23, 29], and depth maps [31]. These can be hard to produce and require considerable user skill or additional computer vision modules. DNP allows us to control T2I with text alone while allowing it to be combined with most structured conditioning techniques as well.", + "bbox": [ + 212, + 176, + 785, + 297 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Attention-based Methods: These methods attempt to tackle DM errors by editing attention maps at each diffusion step, changing the cross-attention between prompt tokens. [3] updates the noise latent with a loss that maximizes attention to each noun, while [21] first creates a linguistic binding between prompt attributes and nouns and then maximizes (minimizes) attention IOUs for mapped (non-mapped) tokens. [7] uses text formatting such as font style, size, color, and footnotes to allow for creative human input and uses region-specific guidance to combine the noise corresponding to each token. These methods require careful fine-tuning of a loss guidance hyper-parameter and can heavily alter the DM Markov chain, which can create highly saturated and low-quality images. While the proposed method also forces the DM to use a different Markov chain, it does not interfere with its intermediate steps through any loss updates.", + "bbox": [ + 212, + 297, + 787, + 478 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Text based Methods: These methods try to explore and correct the semantic failures of the DM text encoder. [16] tries to decouple the text and combine noise latent later and [6] introduces consistency trees to split the prompt into noun phrases, for better cross-attention in the text-encoder. These methods fail to correct those errors which arise not from the text but from the DM itself.", + "bbox": [ + 212, + 479, + 787, + 554 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Negative Prompts: Negative prompts [16], are quite effective at removing unwanted concepts from the synthesized image and have been incorporated into most T2I models. However, finding a good negative prompt requires trial and error. Also, the effect of negative prompts varies significantly with prompt and seed. The proposed method, DNP provides a solution to this.", + "bbox": [ + 212, + 555, + 787, + 630 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 214, + 655, + 359, + 671 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Do diffusion models truly understand negation? In this work, we have hypothesized that the semantic gap between DMs and humans is responsible for the poor performance of negative prompting. We proposed DNP as a simple yet effective method for bridging this gap. This consists of sampling a negative diffusion image $\\bar{\\mathcal{I}}$ , using a novel DNS procedure, and asking the user to translate it into a natural language negative prompt. This greatly improves the prompt adherence and quality of the generated images. DNP is universally applicable across diffusion models and can be combined with other methods. It highlights the difference between semantic and diffusion negation and leverages this difference to improve the performance of these models without additional training.", + "bbox": [ + 212, + 688, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 462, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work was partially funded by NSF award IIS-2303153 a gift from Qualcomm, and NVIDIA GPU donations. We also acknowledge and thank the use of the Nautilus platform for the experiments discussed above.", + "bbox": [ + 212, + 175, + 787, + 220 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 243, + 321, + 258 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. AUTOMATIC1111: Negative prompt: Stable diffusion webui, https://github.com/AUTOMATIC1111/stable-diffusion-webui/wiki/Negative-prompt", + "2. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022)", + "3. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models (2023)", + "4. Dawid, A.P., Stone, M., Zidek, J.V.: Marginalization paradoxes in bayesian and structural inference. Journal of the Royal Statistical Society Series B: Statistical Methodology 35(2), 189-213 (1973)", + "5. Du, Y., Li, S., Mordatch, I.: Compositional visual generation with energy based models. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 6637-6647. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/49856ed476ad01fcff881d57e161d73f-Paper.pdf", + "6. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis (2023)", + "7. Ge, S., Park, T., Zhu, J.Y., Huang, J.B.: Expressive text-to-image generation with rich text. In: IEEE International Conference on Computer Vision (ICCV) (2023)", + "8. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning (2022)", + "9. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)", + "0. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022)", + "1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)", + "2. Jiang, Y., Yang, S., Qiu, H., Wu, W., Loy, C.C., Liu, Z.: Text2human: Text-driven controllable human image generation (2022)", + "3. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023)", + "4. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models (2023)", + "5. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)", + "6. Liu, N., Li, S., Du, Y., Torralba, A., Tenenbaum, J.B.: Compositional visual generation with composable diffusion models. In: European Conference on Computer Vision. pp. 423-439. Springer (2022)" + ], + "bbox": [ + 225, + 273, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Improving image synthesis with diffusion-negative sampling", + "bbox": [ + 334, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "17. Lu, W., Xu, Y., Zhang, J., Wang, C., Tao, D.: Handrefiner: Refining malformed hands in generated images by diffusion-based conditional inpainting (2023)", + "18. Phung, Q., Ge, S., Huang, J.B.: Grounded text-to-image synthesis with attention refocusing. arXiv preprint arXiv:2306.05427 (2023)", + "19. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)", + "20. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)", + "21. Rassin, R., Hirsch, E., Glickman, D., Ravfogel, S., Goldberg, Y., Chechik, G.: Linguistic binding in diffusion models: Enhancing attribute correspondence through attention map alignment (2023)", + "22. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)", + "23. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22500-22510 (June 2023)", + "24. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)", + "25. Salimans, T., Goodfellow, I., Zaremba, W., Cheung, V., Radford, A., Chen, X.: Improved techniques for training gans (2016)", + "26. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: Laion-5b: An open large-scale dataset for training next generation image-text models. In: Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., Oh, A. (eds.) Advances in Neural Information Processing Systems. vol. 35, pp. 25278-25294. Curran Associates, Inc. (2022), https://proceedings.neurips.cc/paper_files/paper/2022/file/a1859debfb3b59d094f3504d5ebbb6c25-Paper-Datasets_and_Benchmarks.pdf", + "27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)", + "28. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. Advances in neural information processing systems 32 (2019)", + "29. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: P+: Extended textual conditioning in text-to-image generation (2023)", + "30. Welling, M., Teh, Y.W.: Bayesian learning via stochastic gradient Langevin dynamics. In: Proceedings of the 28th international conference on machine learning (ICML-11). pp. 681-688 (2011)", + "31. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023)", + "32. Zheng, G., Zhou, X., Li, X., Qi, Z., Shan, Y., Li, X.: Layoutdiffusion: Controllable diffusion model for layout-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22490-22499 (2023)" + ], + "bbox": [ + 215, + 147, + 784, + 811 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "A. Desai and N. Vasconcelos", + "bbox": [ + 271, + 114, + 462, + 126 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_model.json b/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_model.json new file mode 100644 index 0000000000000000000000000000000000000000..cab7f6e507cb5fbad293ec1a50305754c1765b63 --- /dev/null +++ b/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_model.json @@ -0,0 +1,2553 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.218, + 0.141, + 0.787, + 0.187 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "text", + "bbox": [ + 0.356, + 0.212, + 0.649, + 0.228 + ], + "angle": 0, + "content": "Alakh Desai1 and Nuno Vasconcelos1" + }, + { + "type": "text", + "bbox": [ + 0.366, + 0.24, + 0.637, + 0.268 + ], + "angle": 0, + "content": "University of California San Diego, USA {ahdesai,nuno}@ucsd.edu" + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.298, + 0.74, + 0.519 + ], + "angle": 0, + "content": "Abstract. For image generation with diffusion models (DMs), a negative prompt \\(\\mathbf{n}\\) can be used to complement the text prompt \\(\\mathbf{p}\\), helping define properties not desired in the synthesized image. While this improves prompt adherence and image quality, finding good negative prompts is challenging. We argue that this is due to a semantic gap between humans and DMs, which makes good negative prompts for DMs appear unintuitive to humans. To bridge this gap, we propose a new diffusion-negative prompting (DNP) strategy. DNP is based on a new procedure to sample images that are least compliant with \\(\\mathbf{p}\\) under the distribution of the DM, denoted as diffusion-negative sampling (DNS). Given \\(\\mathbf{p}\\), one such image is sampled, which is then translated into natural language by the user or a captioning model, to produce the negative prompt \\(\\mathbf{n}^*\\). The pair \\((\\mathbf{p}, \\mathbf{n}^*)\\) is finally used to prompt the DM. DNS is straightforward to implement and requires no training. Experiments and human evaluations show that DNP performs well both quantitatively and qualitatively and can be easily combined with several DM variants." + }, + { + "type": "text", + "bbox": [ + 0.263, + 0.533, + 0.739, + 0.548 + ], + "angle": 0, + "content": "Keywords: Image generation \\(\\cdot\\) Diffusion Models \\(\\cdot\\) Negative prompting" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.57, + 0.377, + 0.586 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.598, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Diffusion models (DMs) [19, 22, 24] have shown exquisite capacity to synthesize visually appealing images guided by textual prompts. However, they are not easy to control. While the synthesized images are usually impressive, various classes of prompts are known to be difficult, e.g. prompts involving humans [12], hands [17], or multiple objects and their interactions [3]. The synthesized image quality can often be unsatisfactory for such prompts, and prompt adherence is usually weak. This is illustrated in Figure 1, which shows an image synthesized by Stable Diffusion (SD) for a complex prompt \\(\\mathbf{p}\\). The problem can be mitigated by adding alternative conditioning inputs to the diffusion model, such as visual conditioning with sketches or layouts [31, 32]. This, however, usually requires skilled users and can be labor-intensive. Ideally, it should be possible to improve consistency with text prompts alone. In this work, we explore negative prompting [16], which has been quite effective but is difficult to use. We argue that this difficulty stems from a semantic gap between the concept representations of a human user and the DM. We then introduce a new prompting technique, denoted as diffusion-negative prompting (DNP), to bridge this gap, as illustrated in Figure 1." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.463, + 0.127 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.144, + 0.785, + 0.266 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.278, + 0.788, + 0.364 + ], + "angle": 0, + "content": "Fig. 1: DNP improves quality of synthesis for prompts \\(\\mathbf{p}\\) (green) of SD's images (top-right). A diffusion-negative image, \\(\\bar{\\mathcal{I}}\\), is sampled using DNS, enabling the user to visualize the negation of \\(\\mathbf{p}\\) under DM's distribution. The user translates the \\(\\bar{\\mathcal{I}}\\) into a negative prompt \\(\\mathbf{n}^*\\) (red), by a process denoted as DNP, and the DM is prompted with the pair \\((\\mathbf{p},\\mathbf{n}^{*})\\). This increases compliance and quality of the synthesized image (bottom-right). Replacing the user with a captioning model is denoted as auto-DNP." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.409, + 0.789, + 0.683 + ], + "angle": 0, + "content": "Negative prompting complements the text prompt \\(\\mathbf{p}\\), e.g. \"an airplane standing on the runway\", with negative prompts \\(\\mathbf{n}\\), e.g. \"flying\" or \"soaring\". As illustrated in the top row of Figure 2a, this greatly improves compliance of the synthesized image with prompt \\(\\mathbf{p}\\) and can improve image quality. However, negative prompts are difficult to use, for two reasons. First, there are many prompts, e.g. see \\(\\mathbf{p} =\\) \"a cat and a dog\" in Figure 2b, without a clear negative. Second, even when an intuitive negative exists, e.g. \"flying\" vs. \"standing\", it is not necessarily a successful negative for DMs across seeds, as seen in the bottom row of Figure 2a. This raises the question: what is a good negative prompt for a DM? In general, \\(\\mathbf{n}\\) is a good negative prompt if the images synthesized by prompt-pair \\((\\mathbf{p},\\mathbf{n})\\) adhere more to \\(\\mathbf{p}\\) than those synthesized by \\(\\mathbf{p}\\) alone. This, however, is a DM-centric definition of negative prompt. The problem is that the semantic representation of the DM is only a weak approximation to that used by a human. In general, DMs cannot replicate the human definition of concept negation. We refer to this problem as the semantic gap between DMs and humans. As a result, good negative prompts for a DM are frequently not intuitive for humans, i.e. what a human would consider a negative for \\(\\mathbf{p}\\). This makes it difficult for users to produce good negative prompts for DMs." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.789, + 0.842 + ], + "angle": 0, + "content": "In this work, we address this problem by devising a strategy that enables humans to visualize the concepts that DMs consider negatives for prompt \\(\\mathbf{p}\\). This procedure is inspired by classifier-free guidance (CFG) [11]. While CFG uses a sampling guidance factor that increases the probability of images compliant with \\(\\mathbf{p}\\), we introduce a diffusion-negative sampling (DNS) guidance factor that encourages the sampling of the diffusion-negative images, \\(\\bar{\\mathcal{I}}\\), least compliant with \\(\\mathbf{p}\\), under the DM's image distribution. This \\(\\bar{\\mathcal{I}}\\) usually does not comply with the human understanding of the negation of concepts in \\(\\mathbf{p}\\). However, because it represents the DM's understanding of this negation, it can be shown to the user to overcome the semantic gap between them. The user can then produce a negative" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.146, + 0.464, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.246, + 0.225, + 0.411, + 0.232 + ], + "angle": 0, + "content": "p: an airplane standing on the runway" + }, + { + "type": "image", + "bbox": [ + 0.222, + 0.236, + 0.464, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.303, + 0.462, + 0.335 + ], + "angle": 0, + "content": "(a) Semantic negatives: While effective, they do not guarantee compliance across seeds. Success (top), failure (bottom)." + }, + { + "type": "image", + "bbox": [ + 0.468, + 0.145, + 0.787, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.468, + 0.225, + 0.787, + 0.302 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.467, + 0.304, + 0.786, + 0.336 + ], + "angle": 0, + "content": "(b) Non-semantic negatives: A good negative prompt needs multiple iterations for every seed as they can be highly unintuitive." + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.348, + 0.785, + 0.377 + ], + "angle": 0, + "content": "Fig. 2: Example of negative prompting for both semantic and non-semantic scenarios. The positive prompt, \\(\\mathbf{p}\\) and negative prompts, \\(\\mathbf{n}\\) are on top of each image." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.412, + 0.785, + 0.443 + ], + "angle": 0, + "content": "prompt \\(\\mathbf{n}^*\\) in the language of the DM by simply captioning \\(\\bar{\\mathcal{L}}\\). Prompting the DM with the pair \\((\\mathbf{p},\\mathbf{n}^{*})\\) usually produces better images than with \\(\\mathbf{p}\\) alone." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.445, + 0.788, + 0.612 + ], + "angle": 0, + "content": "Figure 1 shows how DNP can help when DMs produce poor-quality images. In response to the user prompt \\(\\mathbf{p} =\\) \"woman in black dress on the red carpet wearing a ring on the finger\", SD generates the top image, with distorted hands and rings. The rest of the figure illustrates DNP. Given the prompt \\(\\mathbf{p}\\), the DM samples a negative image \\(\\bar{\\mathcal{I}} (\\mathbf{p})\\) using DNS. In the figure, \\(\\bar{\\mathcal{I}}\\) contains the house with a garden. The user inspects the image and produces a diffusion-negative prompt \\(\\mathbf{n}^{*}(\\bar{\\mathcal{I}}) =\\) \"a white home with a garage and grass in the front yard\" that reflects the content of this image. This is similar to captioning the image, and can also be done automatically by an image captioning model, resulting in what we denote as auto-DNP. Finally, the DM is prompted with the pair \\((\\mathbf{p},\\mathbf{n}^{*})\\) to produce an image that has much better compliance with \\(\\mathbf{p}\\) than the original." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.789, + 0.841 + ], + "angle": 0, + "content": "Our experiments show that DNP improves prompt adherence and image quality, both in terms of quantitative metrics, like CLIP scores of image-prompt similarity, and subjective ratings by human evaluators. This is shown to hold both for vanilla DMs, like SD, and DMs optimized for solving specific problems, e.g. the \\(A\\& E\\) [3] model tailored to synthesize images containing multiple objects. Various ablations also show that DNP outperforms negative prompting solutions commonly used by practitioners, e.g. using a dictionary of universal negative prompts, random prompts, etc. It also provides much-needed transparency to the negation process. auto-DNP provides a fully automated implementation of DNP. While not as effective as DNP, it maintains all the benefits discussed above, avoids user captioning effort, and allows automatic comparisons to other negative prompting procedures. Finally, our experiments consistently demonstrate the existence of a semantic gap between DMs and humans. Although the negative images generated by DNS are frequently very unintuitive for humans, they help the DM significantly when translated into negative prompts." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.463, + 0.128 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.314 + ], + "angle": 0, + "content": "Overall, this paper makes the following contributions. First, we hypothesize that DM image synthesis can be substantially enhanced by using negative prompts. However, these prompts are difficult for humans to generate, due to the semantic gap between humans and DMs, which leads to a different understanding of concept negation. Second, we introduce the DNS procedure to overcome this semantic gap, allowing humans to visualize the negative concept as understood by the DM. This enables negative prompting with DNP, as shown in Figure 1. Third, we present extensive experiments on various datasets, showing that DNP complements any existing DM or its variant. Fourth, we show that the process can be automated by using a pre-trained image captioner, leading to auto-DNP. Finally, we show that DNP is trivial to implement and requires no training." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.338, + 0.416, + 0.354 + ], + "angle": 0, + "content": "2 Diffusion Models" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.372, + 0.789, + 0.493 + ], + "angle": 0, + "content": "Latent Diffusion: DMs combine a forward and a backward process for generative modeling. In the forward process, a sample is gradually corrupted by sequential application of small amounts of Gaussian noise. The backward process then sequentially denoises the sample using a learned neural network \\(\\epsilon_{\\theta}\\). Latent DMs (LDMs) increase the efficiency of the diffusion process by operating on the low dimensional latent space \\(\\mathcal{Z}\\) of an autoencoder, implemented with a pretrained encoder/decoder pair \\((\\mathcal{E}(.)\\), \\(\\mathcal{D}(.)\\)). This transforms image \\(x \\in \\mathcal{X}\\) into latent representation \\(z = \\mathcal{E}(x) \\in \\mathcal{Z}\\) and reconstructs the image with \\(x = \\mathcal{D}(\\mathcal{E}(z))\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.493, + 0.789, + 0.6 + ], + "angle": 0, + "content": "Training: In the forward process, a noisy version of the latent representation is obtained at each time step \\( t \\) with \\( z_{t} = \\sqrt{\\bar{\\alpha}_{t}} z + \\sqrt{1 - \\bar{\\alpha}_{t}}\\epsilon \\). Here, \\( \\bar{\\alpha}_t = \\prod_{s=1}^t (1 - \\beta_s) \\), where \\( \\{\\beta_1, \\dots, \\beta_T\\} \\) is fixed according to the variance schedule and \\( \\epsilon \\sim \\mathcal{N}(0, I) \\). In the backward process, the denoising model \\( \\epsilon_{\\theta} \\) estimates the noise \\( \\epsilon_t \\) added to the noisy latent representation at each time step \\( t \\). The denoising is conditioned by the embedding \\( \\tau(\\mathbf{p}) \\), of text prompt \\( \\mathbf{p} \\), where \\( \\tau(.) \\) is a text encoder. The denoising network parameters are learned by minimizing the loss" + }, + { + "type": "equation", + "bbox": [ + 0.338, + 0.612, + 0.785, + 0.637 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} = \\mathcal {E} _ {t \\sim \\mathcal {U} (1, T), \\epsilon_ {t} \\sim \\mathcal {N} (0, I)} \\left[ \\| \\epsilon_ {t} - \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right) \\| ^ {2} \\right], \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.647, + 0.741, + 0.661 + ], + "angle": 0, + "content": "where \\(\\mathcal{U}\\) and \\(\\mathcal{N}\\) are the uniform and Gaussian distributions, respectively." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.662, + 0.785, + 0.692 + ], + "angle": 0, + "content": "Inference: Given prompt \\(\\mathbf{p}\\), images are sampled by iteratively alternating between denoising and sampling, with" + }, + { + "type": "equation", + "bbox": [ + 0.344, + 0.707, + 0.785, + 0.723 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} _ {p} = \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right), \\quad z _ {t - 1} = \\text {s a m p l e} \\left(z _ {t}, \\hat {\\epsilon} _ {p}, t\\right). \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.795 + ], + "angle": 0, + "content": "The sampling method, sample, varies with the DM. Popular approaches are DDPM [9] and DDIM [27]. This process is initialized with a noise seed \\( z_{T} \\sim \\mathcal{N}(0,I) \\) and produces a latent image code \\( z_{0} \\), which is finally passed to the decoder to obtain image \\( x_{0} = \\mathcal{D}(z_{0}) \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Classifier-free Guidance: CFG [11] is a method to trade off prompt compliance and image diversity. It consists of training the DM with and without prompt \\(\\mathbf{p}\\), randomly setting \\(\\mathbf{p}\\) to the empty prompt \\(\\phi = \"\\)\", with probability" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.784, + 0.178 + ], + "angle": 0, + "content": "\\(P_{\\text{uncond}} = 0.1\\). At inference, each denoising step uses a linear combination of the prompt-conditional \\((\\hat{\\epsilon}_p)\\) and unconditional \\((\\hat{\\epsilon}_{\\phi})\\) noise estimates" + }, + { + "type": "equation", + "bbox": [ + 0.433, + 0.19, + 0.785, + 0.205 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {\\phi}), \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.216, + 0.784, + 0.261 + ], + "angle": 0, + "content": "where \\(\\hat{\\epsilon}_p = \\epsilon_\\theta (z_t;t,\\tau (\\mathbf{p}))\\), \\(\\hat{\\epsilon}_{\\phi} = \\epsilon_{\\theta}(z_{t};t,\\tau (\\phi))\\), and \\(s\\) is an hyper-parameter that controls the conditioning strength, known as the guidance-scale. The modified noise \\(\\hat{\\epsilon}\\) is then utilized to update the latent representation." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.262, + 0.785, + 0.322 + ], + "angle": 0, + "content": "Negative Prompting: Despite conditioning on text prompt \\(\\mathbf{p}\\), prompt adherence of CFG can be weak when \\(\\mathbf{p}\\) refers to complex scenes, such as that in Figure 1. Negative prompting [16] is useful as an extra conditioning input. Given negative prompt \\(\\mathbf{n}\\), the inference denoising steps are implemented with" + }, + { + "type": "equation", + "bbox": [ + 0.436, + 0.335, + 0.785, + 0.35 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n}) \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.36, + 0.263, + 0.373 + ], + "angle": 0, + "content": "where" + }, + { + "type": "equation", + "bbox": [ + 0.436, + 0.376, + 0.785, + 0.391 + ], + "angle": 0, + "content": "\\[\n\\hat {c} _ {n} = \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {n})\\right). \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.397, + 0.785, + 0.518 + ], + "angle": 0, + "content": "Practitioners have shown that simply replacing the empty prompt \\(\\phi\\) of CFG with the negative prompt \\(\\mathbf{n}\\), i.e. using \\(\\hat{\\epsilon} = \\hat{\\epsilon}_n + s(\\hat{\\epsilon}_p - \\hat{\\epsilon}_n)\\), yields similar results, albeit for a slightly different guidance scale \\(s\\) [1]. This has the benefit of computational efficiency, as it only requires the calculation of two noise vectors instead of three. Hence, this method has gained popularity and has become the default implementation of negative prompting in many T2I generation models. However, in what follows, we use the theoretically more grounded (4) to derive a procedure to sample diffusion-negative images \\((\\bar{\\mathcal{I}})\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.541, + 0.579, + 0.559 + ], + "angle": 0, + "content": "3 Creating Good Negative Prompts" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.572, + 0.457, + 0.586 + ], + "angle": 0, + "content": "In this section, we introduce DNP." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.609, + 0.55, + 0.625 + ], + "angle": 0, + "content": "3.1 Energy-based model interpretation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.633, + 0.784, + 0.693 + ], + "angle": 0, + "content": "Sampling with a DM of network \\(\\epsilon_{\\theta}(z_t; t, \\tau(\\mathbf{p}))\\) can be interpreted as sampling from probability distribution \\(p_{\\theta}(z_t | \\mathbf{p}) \\propto e^{-E_{\\theta}(z_t; t, \\tau(\\mathbf{p}))}\\), where \\(E_{\\theta}\\) is an energy function, using the score function \\(\\nabla_z \\log P(z | \\mathbf{p})\\) and Longevin dynamics [28,30]. The DM network is trained to learn the score function, i.e." + }, + { + "type": "equation", + "bbox": [ + 0.372, + 0.706, + 0.785, + 0.721 + ], + "angle": 0, + "content": "\\[\n\\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right) = - \\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} \\mid \\tau (\\mathbf {p})\\right). \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.732, + 0.784, + 0.761 + ], + "angle": 0, + "content": "This motivates the CFG denoising step of (3), which corresponds to sampling from the distribution" + }, + { + "type": "equation", + "bbox": [ + 0.399, + 0.775, + 0.785, + 0.79 + ], + "angle": 0, + "content": "\\[\np _ {c f g} \\left(z _ {t}, \\mathbf {p}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {c f g} ^ {s} \\left(z _ {t}, \\mathbf {p}\\right) \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.801, + 0.263, + 0.814 + ], + "angle": 0, + "content": "where" + }, + { + "type": "equation", + "bbox": [ + 0.385, + 0.813, + 0.784, + 0.843 + ], + "angle": 0, + "content": "\\[\n\\gamma_ {c f g} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)}{p _ {\\theta} \\left(z _ {t}\\right)} \\propto p _ {\\theta} (\\mathbf {p} \\mid z _ {t}) \\tag {8}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.463, + 0.128 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.785, + 0.193 + ], + "angle": 0, + "content": "is a guidance factor that increases the probability of codes \\( z_{t} \\) corresponding to images compliant with prompt \\( \\mathbf{p} \\). Similarly, the negative prompt denoising step of (4) corresponds to sampling from" + }, + { + "type": "equation", + "bbox": [ + 0.384, + 0.207, + 0.786, + 0.224 + ], + "angle": 0, + "content": "\\[\np _ {n p} \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {n p} ^ {s} \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) \\tag {9}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.235, + 0.369, + 0.25 + ], + "angle": 0, + "content": "with guidance factor" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.263, + 0.786, + 0.297 + ], + "angle": 0, + "content": "\\[\n\\gamma_ {n p} (z _ {t}, \\mathbf {p}, \\mathbf {n}) = \\frac {p _ {\\theta} (z _ {t} | \\mathbf {p})}{p _ {\\theta} (z _ {t} | \\mathbf {n})} \\propto \\frac {p _ {\\theta} (\\mathbf {p} | z _ {t})}{p _ {\\theta} (\\mathbf {n} | z _ {t})}. \\tag {10}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.306, + 0.766, + 0.322 + ], + "angle": 0, + "content": "This increases the probability of sampling latent codes \\( z_{t} \\) of large odds ratio" + }, + { + "type": "equation", + "bbox": [ + 0.423, + 0.335, + 0.786, + 0.368 + ], + "angle": 0, + "content": "\\[\no \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) = \\frac {p _ {\\theta} (\\mathbf {p} \\mid z _ {t})}{p _ {\\theta} (\\mathbf {n} \\mid z _ {t})}. \\tag {11}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.378, + 0.787, + 0.424 + ], + "angle": 0, + "content": "Since the Bayes decision rule for deciding between \\(\\mathbf{p}\\) and \\(\\mathbf{n}\\) is to choose \\(\\mathbf{p}\\) when \\(o(z_{t},\\mathbf{p},\\mathbf{n})\\geq 1\\) and \\(\\mathbf{n}\\) otherwise, it increases the probability that sampled codes comply with prompt \\(\\mathbf{p}\\) and not with prompt \\(\\mathbf{n}\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.448, + 0.553, + 0.466 + ], + "angle": 0, + "content": "3.2 Limitations of Negative Prompting" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.477, + 0.788, + 0.674 + ], + "angle": 0, + "content": "Besides being theoretically well-motivated, negative prompting frequently improves image quality, as illustrated in the top row of Figure 2a. However, negative prompts are difficult to specify, because a natural negative frequently does not exist or does not produce the intended results. Figure 2b shows an example for prompt \\(\\mathbf{p} =\\) \"a cat and a dog\". Here, the user may need to attempt several negative prompts \\(\\mathbf{n}\\), requiring multiple iterations of image synthesis, as illustrated in the figure. Eventually, the user notices the insistence of the DM in brown objects and uses \\(\\mathbf{n} =\\) \"brown\". This is complemented with \"ugly\", which practitioners have identified as a good general-use negative prompt. To compound the problem, a negative prompt successful for one random seed can be unsuccessful for another seed, i.e. good negative prompts depend on both prompt \\(\\mathbf{p}\\) and seed \\(z_{T}\\), as illustrated in Figure 2a. In summary, negative prompting is an art form and can be quite cumbersome, even when successful." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.675, + 0.789, + 0.842 + ], + "angle": 0, + "content": "In practice, the human-provided negative prompt frequently fails to improve the quality of the image generated by the DM. We hypothesize that this is because the semantic representation of the DM is only a weak approximation to that of humans. Hence, there is no guarantee that, under the probability distribution modeled by the DM, there will be a large classification margin between \\(\\mathbf{p}\\) and the human-provided \\(\\mathbf{n}\\). In this case, negative prompting fails to produce samples of large odds ratio \\(o(z_{t},\\mathbf{p},\\mathbf{n})\\) and the prompt pair \\((\\mathbf{p},\\mathbf{n})\\) fails to induce the model to produce more prompt compliant images than those generated with CFG, i.e. the posterior probability \\(p_{\\theta}(\\mathbf{p}|z_t)\\) of (8). In the extreme case where \\(p_{\\theta}(\\mathbf{p}|z_t)\\approx p_{\\theta}(\\mathbf{n}|z_t)\\) for the samples of high \\(p_{\\theta}(\\mathbf{p}|z_t)\\), \\(o(z_{t},\\mathbf{p},\\mathbf{n})\\approx 1\\) for those samples and (9) looses all sensitivity to prompt \\(\\mathbf{p}\\)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.499, + 0.162 + ], + "angle": 0, + "content": "3.3 Diffusion-Negative Guidance" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.17, + 0.788, + 0.292 + ], + "angle": 0, + "content": "The discussion above suggests that a good negative prompt for the DM \"grounds\" the odds-ratio of (11), providing a reference for the prompt \\(\\mathbf{p}\\), which is defined in terms of the margin to negative \\(\\mathbf{n}\\). However, this grounding must happen under the internal representation of the DM, which is not necessarily that of humans. The goal is to encourage samples more likely to comply with given prompt \\(\\mathbf{p}\\) than the negative prompt, under the conceptual representation of the model. We formalize this goal by defining the optimal negative prompt \\(\\mathbf{n}^*\\) for the DM as the one that maximizes the steepness of the odds ratio with \\(\\mathbf{p}\\), i.e." + }, + { + "type": "equation", + "bbox": [ + 0.379, + 0.301, + 0.786, + 0.322 + ], + "angle": 0, + "content": "\\[\n\\mathbf {n} ^ {*} (\\mathbf {p}) = \\arg \\max _ {\\mathbf {n}} \\nabla_ {z _ {t}} \\log o (z _ {t}, \\mathbf {p}, \\mathbf {n}). \\tag {12}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.329, + 0.785, + 0.345 + ], + "angle": 0, + "content": "This is denoted as the diffusion-negative prompt for \\(\\mathbf{p}\\). Using (2), (5), and (11)," + }, + { + "type": "equation", + "bbox": [ + 0.256, + 0.366, + 0.786, + 0.398 + ], + "angle": 0, + "content": "\\[\n\\nabla_ {z _ {t}} \\log o (z _ {t}, \\mathbf {p}, \\mathbf {n}) = \\nabla_ {z _ {t}} \\log \\frac {p _ {\\theta} (\\mathbf {p} | z _ {t})}{p _ {\\theta} (\\mathbf {n} | z _ {t})} = \\nabla_ {z _ {t}} \\log \\frac {p _ {\\theta} (z _ {t} | \\mathbf {p})}{p _ {\\theta} (z _ {t} | \\mathbf {n})} = \\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n}. \\tag {13}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.404, + 0.787, + 0.436 + ], + "angle": 0, + "content": "Hence, for a given \\( z_{t} \\), a natural alternative definition of the diffusion-negative prompt is that which induces the noise vector maximally distant from \\( \\hat{\\epsilon}_{p} \\), i.e." + }, + { + "type": "equation", + "bbox": [ + 0.408, + 0.444, + 0.786, + 0.473 + ], + "angle": 0, + "content": "\\[\n\\epsilon_ {n ^ {*}} = \\underset {n \\mid \\| \\hat {\\epsilon} _ {n} \\| ^ {2} = K} {\\arg \\max } \\left\\| \\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n} \\right\\| ^ {2} \\tag {14}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.481, + 0.788, + 0.542 + ], + "angle": 0, + "content": "where \\(K\\) prevents the noise magnitude from becoming infinitely large. This is the prompt that induces the steeper log odds surface at \\(z_{t}\\), encouraging the largest margin between the probabilities \\(p_{\\theta}(z_t|\\mathbf{p})\\) and \\(p_{\\theta}(z_t|\\mathbf{n}^*)\\) in the neighborhood of \\(z_{t}\\). In Supplementary Section 1, we show that (14) has a solution" + }, + { + "type": "equation", + "bbox": [ + 0.416, + 0.551, + 0.786, + 0.582 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} _ {n ^ {*}} = - \\sqrt {K} \\frac {\\hat {\\epsilon} _ {p}}{\\| \\hat {\\epsilon} _ {p} \\|} \\propto - \\hat {\\epsilon} _ {p}. \\tag {15}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.591, + 0.787, + 0.625 + ], + "angle": 0, + "content": "Choosing \\(K = \\| \\hat{\\epsilon}_p\\|^2\\), i.e. equal noise strength under the positive and negative conditions, results in \\(\\hat{\\epsilon}_{n^*} = -\\hat{\\epsilon}_p\\)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.643, + 0.544, + 0.659 + ], + "angle": 0, + "content": "3.4 Diffusion-Negative Sampling (DNS)" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.665, + 0.388, + 0.681 + ], + "angle": 0, + "content": "It follows from (6) that" + }, + { + "type": "equation", + "bbox": [ + 0.26, + 0.69, + 0.786, + 0.721 + ], + "angle": 0, + "content": "\\[\n\\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} | \\mathbf {n} ^ {*}\\right) = - \\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} | \\mathbf {p}\\right) \\Longrightarrow p _ {\\theta} \\left(z _ {t} | \\mathbf {n} ^ {*}\\right) \\propto \\frac {1}{p _ {\\theta} \\left(z _ {t} | \\mathbf {p}\\right)}. \\tag {16}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.728, + 0.788, + 0.805 + ], + "angle": 0, + "content": "However, for most \\( p_{\\theta}(z_t|\\mathbf{n}) \\), (16) is an improper distribution [4]. This stems from the fact that a negative condition must be specified in context [5]. A general contextual constraint for DM-based sampling is that the negatively conditioned DM should still sample images from the image distribution \\( p_{\\theta}(z_t) \\). To account for this, we define the diffusion-negative guidance factor as" + }, + { + "type": "equation", + "bbox": [ + 0.384, + 0.813, + 0.786, + 0.845 + ], + "angle": 0, + "content": "\\[\n\\gamma_ {d n} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t}\\right)}{p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)} \\propto \\frac {1}{p _ {\\theta} \\left(\\mathbf {p} \\mid z _ {t}\\right)}, \\tag {17}\n\\]" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.465, + 0.128 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.573, + 0.163 + ], + "angle": 0, + "content": "which leads to the diffusion-negative distribution" + }, + { + "type": "equation", + "bbox": [ + 0.394, + 0.177, + 0.786, + 0.192 + ], + "angle": 0, + "content": "\\[\np _ {d n} \\left(z _ {t}, \\mathbf {p}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {d n} ^ {s} \\left(z _ {t}, \\mathbf {p}\\right) \\tag {18}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.205, + 0.457, + 0.22 + ], + "angle": 0, + "content": "and inference denoising equation" + }, + { + "type": "equation", + "bbox": [ + 0.433, + 0.234, + 0.786, + 0.25 + ], + "angle": 0, + "content": "\\[\n\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {\\phi} - \\hat {\\epsilon} _ {p}). \\tag {19}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.262, + 0.789, + 0.459 + ], + "angle": 0, + "content": "Sampling with this equation is denoted as diffusion-negative sampling (DNS). When compared to (10), the diffusion-negative guidance factor of (17) has two main differences. First, it does not require the semantic negative prompt \\(\\mathbf{n}\\), reflecting the fact that the definition of negative is fully based on the internal representation of the DM. Second, it replaces the odds ratio of (11) by the ratio between the image distribution \\(p_{\\theta}(z_t)\\) and the image distribution under the positive condition \\(\\mathbf{p}\\). This emphasizes sampling images from the DM probability distribution with the lowest prompt conditional probability \\(p_{\\theta}(z_t|\\mathbf{p})\\). When compared to the guidance factor (8) of CFG, (17) simply flips the role of the image distributions \\(p_{\\theta}(z_t)\\) and \\(p_{\\theta}(z_t|\\mathbf{p})\\). This provides a simple interpretation of diffusion-negative guidance as the \"opposite\" of CFG. Rather than sampling natural images that align best with the condition \\(\\mathbf{p}\\), it emphasizes sampling natural images that least comply with it." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.459, + 0.665, + 0.475 + ], + "angle": 0, + "content": "The relation between the guidance factors of (17) and (10)" + }, + { + "type": "equation", + "bbox": [ + 0.374, + 0.489, + 0.786, + 0.521 + ], + "angle": 0, + "content": "\\[\n\\gamma_ {d n} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t}\\right)}{p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)} = \\gamma_ {n p} \\left(z _ {t}, \\phi , \\mathbf {p}\\right) \\tag {20}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.531, + 0.788, + 0.592 + ], + "angle": 0, + "content": "makes the implementation of DNS trivial for any model that supports negative prompting. It suffices to prompt the latter with empty positive prompt \\(\\phi\\) and negative prompt \\(\\mathbf{p}\\). Hence, DNS requires no retraining of the \\(DM\\), nor any optimizations at inference." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.616, + 0.557, + 0.634 + ], + "angle": 0, + "content": "3.5 Diffusion-Negative Prompting (DNP)" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.644, + 0.789, + 0.844 + ], + "angle": 0, + "content": "DNP relies on DNS to implement the procedure of Figure 1. Given prompt \\(\\mathbf{p}\\), DNS is used to sample a diffusion-negative image, \\(\\bar{\\mathcal{I}}\\), as discussed above. This image is then captioned by the user, to produce the DNP \\(\\mathbf{n}^*\\). The DM is finally prompted with the prompt pair \\((\\mathbf{p}, \\mathbf{n}^*)\\) to produce the final image. As illustrated in Figure 1, the captioning step can be performed by either the user or any captioning model. In the latter case, the process is denoted auto-DNP. auto-DNP has the advantage of fully automating DNP, making the entire process transparent to the user and reducing user effort. The price is a small increase in the failure rate due to captioning errors. In this paper, we use BLIP2 [14] as the captioning model to implement auto-DNP. However, auto-DNP can be used with any other captioner. We show results obtained with GPTv4 (gpt-4-vision-preview) in Supplementary Section 4. Figure 3 and the final column of Figure 4 illustrate how DNP produces images that either have higher quality or comply better with the prompt \\(\\mathbf{p}\\)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.377, + 0.163 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.176, + 0.664, + 0.192 + ], + "angle": 0, + "content": "In this section, we discuss the experimental evaluation of DNP." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.212, + 0.334, + 0.227 + ], + "angle": 0, + "content": "4.1 Datasets" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.236, + 0.731, + 0.251 + ], + "angle": 0, + "content": "For a comprehensive dataset description see Supplementary Section 2.2" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.252, + 0.787, + 0.387 + ], + "angle": 0, + "content": "Existence and Attribute Binding (A&E) Dataset: This is the benchmark dataset introduced by [3]. This dataset is focused on entity neglect, which occurs when one or more entities are completely ignored by the generative model, and attribute assignment, which evaluates whether an attribute is associated with the correct object in the image. To evaluate these, each prompt in the dataset comprises two entities and their associated attributes. There are three categories of prompts: (1) \"an animal and an animal\"; (2) \"a color in-animate object and an animal\"; (3) \"a color in-animate object and a color in-animate object\". We sample 50 prompts from each category for 32 random seeds." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.388, + 0.787, + 0.509 + ], + "angle": 0, + "content": "Human and Hand Generation (H&H) Dataset: Humans and hands occur in various shapes and forms, including gender, race, activity, and individual differences. Despite the size of the training datasets, this variation has posed a major challenge to DMs, which are known to synthesize images with extra or merged limbs and fingers. We curated a challenging benchmark dataset to test the effect of DNP on human and hand generation. The dataset consists of 45 human-based prompts such as \"a man wearing a sombrero\" and 25 hand-based prompts such as \"hand with a ring on it\". We run all prompts for 32 seeds." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.529, + 0.42, + 0.545 + ], + "angle": 0, + "content": "4.2 Evaluation Metrics" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.553, + 0.787, + 0.72 + ], + "angle": 0, + "content": "Text-Image CLIP Score: [8] is a widely used metric of the similarity between a generated image and its text prompt. For the H&H dataset, we calculate the CLIP Score between each generated image and its corresponding prompt. For the A&E dataset, we follow the evaluation protocols established by [3], which measure CLIP Score at full prompt and entity level. For evaluating the Full Prompt CLIP Score, we calculate the score between the generated image and the full prompt. For the Minimum Object CLIP Score, we take the minimum score between the entities in the prompt, as the entity with the minimum CLIP Score represents the neglected entity for the given prompt. This allows us to measure the CLIP Score at two levels, thereby providing better insight into the presence of both entities in the A&E dataset prompts." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.72, + 0.787, + 0.78 + ], + "angle": 0, + "content": "Inception Score (IS): [25] is a popular metric for assessing the quality and realism of images. It is the exponential of the average of the entropy of the label distribution predicted by the Inception v3 classifier model. In particular, we choose IS over FID as it does not require a dataset with real images." + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.78, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Human Evaluation: While CLIP Score and IS provide an objective measure of correctness and quality, they are known for not being fully aligned with human aesthetics and preferences. To evaluate DNP in terms of human preferences, we used Amazon Mechanical Turk (AMT) to evaluate a subset of each dataset. We" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.463, + 0.127 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "table", + "bbox": [ + 0.306, + 0.144, + 0.703, + 0.212 + ], + "angle": 0, + "content": "
MethodCLIP Score
HumanHandA&E
Min. ObjectFull Prompt
SD+auto-DNP0.3300.3230.2500.344
SD+DP0.3310.3240.2530.345
" + }, + { + "type": "table_caption", + "bbox": [ + 0.305, + 0.213, + 0.699, + 0.224 + ], + "angle": 0, + "content": "Table 1: Benchmarking DNP to auto-DNP with CLIP Score." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.268, + 0.788, + 0.374 + ], + "angle": 0, + "content": "performed human evaluation on 100 prompt-seed pairs for the human dataset, 100 pairs for the Hands dataset, and 150 (50 per category) pairs for the A&E dataset. The evaluators were asked to compare the images using two criteria. 1) Adherence to the prompt, and 2) Quality (natural or realistic nature) of the image. MTurkers were tasked with choosing one image based the two criteria. They could also choose no clear winner if they did not prefer one over the other. More details can be found in the Supplementary Section 2.3." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.397, + 0.513, + 0.412 + ], + "angle": 0, + "content": "4.3 Benchmarking DNP vs auto-DNP" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.422, + 0.788, + 0.588 + ], + "angle": 0, + "content": "The evaluation of DNP requires human users. PhD students, with no experience in visual language research, were shown an image and asked to produce a caption shorter than 60 words. Due to the prohibitive resources required to caption the image \\(\\bar{\\mathcal{I}}\\) for all prompt-seed pairs of all the datasets, we restricted the evaluation of DNP to the prompt-seed pairs used for human evaluation. We compared the performance of DNP and auto-DNP on this set and used auto-DNP in the remaining experiments. Besides being cost-effective, this enables the replication of our experiments for comparison to other negative prompting methods. Table 1 compares the performance of DNP and auto-DNP, on the prompt-seed pairs used for the human evaluation1. For the rest of the paper, we use the notation DM+X, where DM is the diffusion model and X the negative prompting method." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.588, + 0.788, + 0.634 + ], + "angle": 0, + "content": "While DNP achieves the best performance, auto-DNP provides almost identical results. This suggests that the BLIP2 model is quite effective at captioning the diffusion-negative negative images \\(\\bar{\\mathcal{I}}\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.657, + 0.434, + 0.672 + ], + "angle": 0, + "content": "4.4 Quantitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.682, + 0.787, + 0.711 + ], + "angle": 0, + "content": "We next discuss the results of quantitative experiments on image quality using auto-DNP. Various ablations are also presented in Supplementary Section 4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.712, + 0.788, + 0.803 + ], + "angle": 0, + "content": "A&E dataset: We first compare SD to \\(\\mathrm{SD + }\\) auto-DNP, on the A&E dataset in Table 2a. \\(\\mathrm{SD + }\\) auto-DNP achieves a Min. Object CLIP Score of 0.258, which is \\(6.6\\%\\) higher than that of SD, illustrating that \\(\\mathrm{SD + }\\) auto-DNP generates images that align better with the prompts. Since CLIP scores practically range from [0, 0.4] [8], the full prompt CLIP Score of 0.346 of \\(\\mathrm{SD + }\\) auto-DNP suggests good alignment between prompt and image. Human evaluation underscores the true" + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.811, + 0.787, + 0.84 + ], + "angle": 0, + "content": "1 IS score cannot be computed in this case as the number of seeds per prompt is not large enough for IS to provide reliable results." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.131 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table", + "bbox": [ + 0.277, + 0.144, + 0.734, + 0.226 + ], + "angle": 0, + "content": "
MethodCLIP ScoreISHuman Evaluation
Min. ObjectFull PromptCorrectnessQuality
No Clear Winner---16.88%10.46%
Stable Diffusion (SD)0.2420.33513.1718.90%25.73%
SD+auto-DNP0.258 (+6.61%)0.346 (+3.28%)13.35 (+1.37%)64.22%63.81%
No Clear Winner---16.95%7.35%
Attend & Excite (A&E)0.2640.34911.8630.06%33.12%
A&E+auto-DNP0.276 (+4.54%)0.362 (+3.72%)13.12 (+10.62%)52.99%59.53%
" + }, + { + "type": "table_caption", + "bbox": [ + 0.35, + 0.227, + 0.653, + 0.24 + ], + "angle": 0, + "content": "(a) Quantitative Results on the A&E dataset." + }, + { + "type": "table", + "bbox": [ + 0.278, + 0.252, + 0.734, + 0.334 + ], + "angle": 0, + "content": "
DatasetMethodCLIP ScoreISHuman Evaluation
CorrectnessQuality
Human PromptsNo Clear Winner--14.42%5.10%
Stable Diffusion (SD)0.3229.9527.60%29.0%
SD+auto-DNP0.331 (+2.80%)10.13 (+1.80%)57.98%65.80%
Hand PromptsNo Clear Winner--19.89%8.18%
Stable Diffusion (SD)0.30912.0420.45%22.47%
SD+auto-DNP0.321 (+3.88%)12.39 (+2.94%)59.66%69.35%
" + }, + { + "type": "table_caption", + "bbox": [ + 0.349, + 0.335, + 0.654, + 0.347 + ], + "angle": 0, + "content": "(b) Quantitative Results on the H&H dataset." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.359, + 0.785, + 0.389 + ], + "angle": 0, + "content": "Table 2: Quantitative Results: comparing prompt adherence and image quality by CLIP Score, IS and Human Evaluation. The percentage gains are shown in (brackets)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.447, + 0.785, + 0.524 + ], + "angle": 0, + "content": "strength of DNP, as human evaluators prefer images generated by \\(\\mathrm{SD} + \\mathrm{auto}\\)-DNP \\(3.4\\times\\) more in terms of correctness and \\(2.5\\times\\) more in terms of quality than those generated by SD. Note that \\(\\mathrm{SD} + \\mathrm{auto}\\)-DNP even outperforms the \\(A\\& E\\) model in IS and matches its CLIP Score for both full prompt and minimum object, despite not being specifically designed for multiple object generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.531, + 0.788, + 0.682 + ], + "angle": 0, + "content": "To demonstrate the flexibility of the DNP approach, we also applied it to the \\( A\\& E \\) model, comparing \\( A\\& E + \\text{auto-DNP} \\) to \\( A\\& E \\). We observe a moderate increase in the CLIP Score since \\( A\\& E \\) is already quite efficient at generating multiple objects. \\( A\\& E + \\text{auto-DNP} \\) achieves a Min. Object CLIP Score of 0.276, which is very close to the theoretical upper bound for Min. Object CLIP Score of 0.29 as defined by [3]. The \\( 10.62\\% \\) improvement in IS shows that \\( A\\& E \\) is more inclined to generate unrealistic images and the addition of DNP improves its realism. The human evaluation also reflects this, as around \\( 53\\% \\) of the evaluators prefer \\( A\\& E + \\text{auto-DNP} \\) over the \\( A\\& E \\) images for correctness and \\( 60\\% \\) for quality, which is close to \\( 1.8\\times \\) the preference for \\( A\\& E \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.69, + 0.788, + 0.841 + ], + "angle": 0, + "content": "H&H dataset: Table 2b summarizes the ability of DNP to address the specific SD weaknesses of synthesizing humans and hands. Since both CLIP and IS may ignore distorted or maligned results when considering correctness or realism, they fail to give substantial insight into image quality (despite improvement). The human evaluation is much more important for this task. SD+auto-DNP outperforms SD by a substantial margin, as evaluators prefer SD+auto-DNP \\(3 \\times\\) more for correctness and \\(2 \\times\\) more for quality, for both human and hand prompts. Since evaluators were specifically tasked with checking the number and pose of limbs and fingers and the quality of the faces, their preference for images generated with DNP shows that the latter improves SD performance substantially." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.463, + 0.127 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "image_caption", + "bbox": [ + 0.252, + 0.144, + 0.38, + 0.154 + ], + "angle": 0, + "content": "Prompts with Humans" + }, + { + "type": "image", + "bbox": [ + 0.223, + 0.157, + 0.409, + 0.23 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.229, + 0.232, + 0.402, + 0.242 + ], + "angle": 0, + "content": "p: a boy in the moonlight n*: a living room with a fireplace and wooden beams" + }, + { + "type": "image_caption", + "bbox": [ + 0.419, + 0.144, + 0.587, + 0.155 + ], + "angle": 0, + "content": "Prompts with Multiple Nouns" + }, + { + "type": "image", + "bbox": [ + 0.41, + 0.157, + 0.597, + 0.23 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.419, + 0.231, + 0.588, + 0.243 + ], + "angle": 0, + "content": "p: a cat and a dog \\(\\mathbf{n}^*\\) : an aerial view of a resort with a swimming pool" + }, + { + "type": "image_caption", + "bbox": [ + 0.632, + 0.144, + 0.748, + 0.155 + ], + "angle": 0, + "content": "Prompts with Hands" + }, + { + "type": "image", + "bbox": [ + 0.598, + 0.157, + 0.785, + 0.23 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.645, + 0.231, + 0.736, + 0.236 + ], + "angle": 0, + "content": "p: a hand with a ring on it" + }, + { + "type": "image_caption", + "bbox": [ + 0.615, + 0.237, + 0.766, + 0.243 + ], + "angle": 0, + "content": "\\(\\mathbf{n}^{*}\\) : a woman in a black dress on the red carpet" + }, + { + "type": "image", + "bbox": [ + 0.222, + 0.246, + 0.41, + 0.32 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.229, + 0.321, + 0.402, + 0.332 + ], + "angle": 0, + "content": "p: a man in a sombrero \nn*: a modern three story townhouse with two garages" + }, + { + "type": "image", + "bbox": [ + 0.41, + 0.246, + 0.598, + 0.32 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.423, + 0.321, + 0.584, + 0.332 + ], + "angle": 0, + "content": "p: a boy playing with his dog n*: three bowls of stew with vegetables and herbs" + }, + { + "type": "image", + "bbox": [ + 0.598, + 0.246, + 0.785, + 0.32 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.645, + 0.321, + 0.738, + 0.326 + ], + "angle": 0, + "content": "p: a closeup of a handshake" + }, + { + "type": "image_caption", + "bbox": [ + 0.615, + 0.327, + 0.767, + 0.332 + ], + "angle": 0, + "content": "\\(\\mathbf{n}^{*}\\) : an aerial view of a large home in the woods" + }, + { + "type": "image", + "bbox": [ + 0.222, + 0.335, + 0.41, + 0.409 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.225, + 0.412, + 0.406, + 0.421 + ], + "angle": 0, + "content": "p. a child on the couch n*: men and women in suits and ties in front of a crowd" + }, + { + "type": "image", + "bbox": [ + 0.41, + 0.335, + 0.598, + 0.409 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.429, + 0.41, + 0.566, + 0.421 + ], + "angle": 0, + "content": "p: a bear with a brown crown \nn*: a rendering of the plans for a home" + }, + { + "type": "image", + "bbox": [ + 0.599, + 0.335, + 0.785, + 0.409 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.659, + 0.41, + 0.722, + 0.415 + ], + "angle": 0, + "content": "p: a tattooed hand" + }, + { + "type": "image_caption", + "bbox": [ + 0.618, + 0.416, + 0.762, + 0.422 + ], + "angle": 0, + "content": "n*: four pictures of a house, a car and a tree" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.433, + 0.788, + 0.476 + ], + "angle": 0, + "content": "Fig. 3: Images synthesized by SD (left) for prompt p vs. \\(\\mathrm{SD + }\\) auto-DNP (right) for prompt pair \\((\\mathbf{p},\\mathbf{n}^{*})\\) , where \\(\\mathbf{n}^*\\) is the DNP estimated from the DNS image. DNP produces negative prompts that are not intuitive for humans but improve quality and adherence." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.51, + 0.421, + 0.525 + ], + "angle": 0, + "content": "4.5 Qualitative Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.546, + 0.785, + 0.577 + ], + "angle": 0, + "content": "Figure 3 shows qualitative examples from the three datasets, comparing SD with SD+auto-DNP. There are more visual examples in Supplementary Section 5." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.579, + 0.788, + 0.7 + ], + "angle": 0, + "content": "The H&H dataset results, e.g. the images synthesized for prompt \"hand with a ring on it\", illustrate how auto-DNP improves the quality of humans and hands in terms of the number of limbs, fingers, poses, etc. It also induces the model to create realistic images, rather than drawings or sketches. See, for example, the \"man in a sombrero\" and \"boy in the moonlight\" examples. We observe a major improvement in the quality of the humans generated by auto-DNP wherein the faces do not exhibit the uncanny, robotic, or distorted features that SD is inclined to create, instead having a natural warmth." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.702, + 0.788, + 0.793 + ], + "angle": 0, + "content": "The results on the A&E dataset show that auto-DNP can correct for entity neglect while ensuring superior image quality. This is especially visible when we compare \\(A\\& E\\) with \\(A\\& E + \\text{auto-DNP}\\) (see Figures 5,6,7 in Supplementary Section 5), which produces more realistic images. We posit that auto-DNP's inclination towards generating more realistic images is due to setting the diffusion process onto a better Markov chain without disrupting it at each step, unlike \\(A\\& E\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Finally, note that none of the negative prompts produced by auto-DNP in Figure 3 is intuitive for humans. This illustrates the semantic gap between humans and SD and the difficulty of producing good negative prompts manually." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.144, + 0.292, + 0.234 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.293, + 0.144, + 0.365, + 0.234 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.366, + 0.144, + 0.432, + 0.234 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.433, + 0.144, + 0.501, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.144, + 0.574, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.575, + 0.144, + 0.644, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.645, + 0.144, + 0.785, + 0.235 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.246, + 0.785, + 0.289 + ], + "angle": 0, + "content": "Fig. 4: Exploring Semantic Gap: From left to right: 1) images generated for prompt p, 2) DNS images generated by the DM and resulting caption \\(\\mathbf{n}^*\\) by DNP, 3) images synthesized with \\(\\mathbf{n}^*\\) as the negative prompt alone, and 4) with prompt pair \\((\\mathbf{p},\\mathbf{n}^{*})\\)" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.315, + 0.379, + 0.331 + ], + "angle": 0, + "content": "4.6 Semantic Gap" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.338, + 0.788, + 0.534 + ], + "angle": 0, + "content": "Figure 4 explores the semantic gap between humans and DMs in more detail. From left to right, the first column shows images synthesized by SD with prompt \\(\\mathbf{p}\\). The second column shows examples of images sampled with DNS, i.e. (19). These can be seen as images that the model hallucinates as \"negatives\" of the prompt \\(\\mathbf{p}\\) since they usually do not have this interpretation for humans. The caption \\(\\mathbf{n}^*\\) is obtained the user. To confirm that the prompt mirrors the DM internal representation of the \"negative\" for the image in the left column, we prompted the model with an empty positive prompt \\(\\mathbf{p} = \\phi\\) and \\(\\mathbf{n}^*\\) as a negative prompt, which produces the images in the third column of the figure. Note how these images comply with \\(\\mathbf{p}\\) even though \\(\\mathbf{n}^*\\) is non-intuitive for a human. Finally, the last column shows the result of prompting with the pair \\((\\mathbf{p}, \\mathbf{n}^*)\\). In all cases, the synthesized image is at least as good as that on the first column, and usually better, e.g. a greener forest or a more realistic bird." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.535, + 0.788, + 0.686 + ], + "angle": 0, + "content": "Two aspects are worth noting. First, these examples purposefully use prompts \\(\\mathbf{p}\\) for which SD works well. This proves that the \"DM knows what it's doing,\" at least to the point of generating a sensible image (first column). However, its notion of negative is totally different from that of humans, demonstrating the semantic gap between the two. The practical result is that a totally unintuitive negative prompt is needed to produce good images. Figure 3 shows that auto-DNP can improve the quality and correctness of the synthesised image even when the DM fails. Second, because all derivations above are functions of \\(z_{t}\\), the DNS procedure is valid for any seed \\(z_{T}\\). This is an additional advantage over the human-centric negative prompting of Figure 2a, whose success is seed-dependent." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.705, + 0.388, + 0.721 + ], + "angle": 0, + "content": "5 Related Work" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Text-to-Image Diffusion: High-resolution T2I generation has advanced dramatically with the introduction of large-scale diffusion models, due to: (1) availability of large-scale text-image datasets [2, 26], (2) advances in various training and inference techniques [9-11, 27], and, (3) development of scalable model architectures [19, 20, 22, 24]. The most popular T2I models employ classifier-free guidance [11] to balance prompt compliance and image diversity using a guidance scale hyper-parameter, \\( s \\). While prompt adherence improves by increasing" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.463, + 0.128 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "\\(s\\), image quality deteriorates beyond a certain value. DNP helps ensure prompt adherence even for lower values of \\(s\\), thereby maintaining image quality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.787, + 0.298 + ], + "angle": 0, + "content": "Structured Image Conditioning: Various image generation and editing improvements have been introduced since the advent of DMs. They range from finetuning the models for certain tasks to editing the noise at each iteration. Many methods require users to provide structured conditioned inputs like layouts [15, 18, 32], example images [13, 23, 29], and depth maps [31]. These can be hard to produce and require considerable user skill or additional computer vision modules. DNP allows us to control T2I with text alone while allowing it to be combined with most structured conditioning techniques as well." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.299, + 0.788, + 0.479 + ], + "angle": 0, + "content": "Attention-based Methods: These methods attempt to tackle DM errors by editing attention maps at each diffusion step, changing the cross-attention between prompt tokens. [3] updates the noise latent with a loss that maximizes attention to each noun, while [21] first creates a linguistic binding between prompt attributes and nouns and then maximizes (minimizes) attention IOUs for mapped (non-mapped) tokens. [7] uses text formatting such as font style, size, color, and footnotes to allow for creative human input and uses region-specific guidance to combine the noise corresponding to each token. These methods require careful fine-tuning of a loss guidance hyper-parameter and can heavily alter the DM Markov chain, which can create highly saturated and low-quality images. While the proposed method also forces the DM to use a different Markov chain, it does not interfere with its intermediate steps through any loss updates." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.48, + 0.788, + 0.555 + ], + "angle": 0, + "content": "Text based Methods: These methods try to explore and correct the semantic failures of the DM text encoder. [16] tries to decouple the text and combine noise latent later and [6] introduces consistency trees to split the prompt into noun phrases, for better cross-attention in the text-encoder. These methods fail to correct those errors which arise not from the text but from the DM itself." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.556, + 0.788, + 0.631 + ], + "angle": 0, + "content": "Negative Prompts: Negative prompts [16], are quite effective at removing unwanted concepts from the synthesized image and have been incorporated into most T2I models. However, finding a good negative prompt requires trial and error. Also, the effect of negative prompts varies significantly with prompt and seed. The proposed method, DNP provides a solution to this." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.656, + 0.36, + 0.672 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Do diffusion models truly understand negation? In this work, we have hypothesized that the semantic gap between DMs and humans is responsible for the poor performance of negative prompting. We proposed DNP as a simple yet effective method for bridging this gap. This consists of sampling a negative diffusion image \\(\\bar{\\mathcal{I}}\\), using a novel DNS procedure, and asking the user to translate it into a natural language negative prompt. This greatly improves the prompt adherence and quality of the generated images. DNP is universally applicable across diffusion models and can be combined with other methods. It highlights the difference between semantic and diffusion negation and leverages this difference to improve the performance of these models without additional training." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.335, + 0.115, + 0.732, + 0.13 + ], + "angle": 0, + "content": "Improving image synthesis with diffusion-negative sampling" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.222 + ], + "angle": 0, + "content": "This work was partially funded by NSF award IIS-2303153 a gift from Qualcomm, and NVIDIA GPU donations. We also acknowledge and thank the use of the Nautilus platform for the experiments discussed above." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.244, + 0.323, + 0.26 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.274, + 0.784, + 0.304 + ], + "angle": 0, + "content": "1. AUTOMATIC1111: Negative prompt: Stable diffusion webui, https://github.com/AUTOMATIC1111/stable-diffusion-webui/wiki/Negative-prompt" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.304, + 0.785, + 0.331 + ], + "angle": 0, + "content": "2. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.331, + 0.785, + 0.358 + ], + "angle": 0, + "content": "3. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.359, + 0.785, + 0.399 + ], + "angle": 0, + "content": "4. Dawid, A.P., Stone, M., Zidek, J.V.: Marginalization paradoxes in bayesian and structural inference. Journal of the Royal Statistical Society Series B: Statistical Methodology 35(2), 189-213 (1973)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.4, + 0.785, + 0.469 + ], + "angle": 0, + "content": "5. Du, Y., Li, S., Mordatch, I.: Compositional visual generation with energy based models. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 6637-6647. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/49856ed476ad01fcff881d57e161d73f-Paper.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.469, + 0.785, + 0.51 + ], + "angle": 0, + "content": "6. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.51, + 0.785, + 0.538 + ], + "angle": 0, + "content": "7. Ge, S., Park, T., Zhu, J.Y., Huang, J.B.: Expressive text-to-image generation with rich text. In: IEEE International Conference on Computer Vision (ICCV) (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.538, + 0.785, + 0.565 + ], + "angle": 0, + "content": "8. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.566, + 0.785, + 0.592 + ], + "angle": 0, + "content": "9. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.592, + 0.785, + 0.634 + ], + "angle": 0, + "content": "0. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.634, + 0.785, + 0.661 + ], + "angle": 0, + "content": "1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.661, + 0.785, + 0.689 + ], + "angle": 0, + "content": "2. Jiang, Y., Yang, S., Qiu, H., Wu, W., Loy, C.C., Liu, Z.: Text2human: Text-driven controllable human image generation (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.785, + 0.731 + ], + "angle": 0, + "content": "3. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.785, + 0.758 + ], + "angle": 0, + "content": "4. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.759, + 0.785, + 0.799 + ], + "angle": 0, + "content": "5. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "6. Liu, N., Li, S., Du, Y., Torralba, A., Tenenbaum, J.B.: Compositional visual generation with composable diffusion models. In: European Conference on Computer Vision. pp. 423-439. Springer (2022)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.274, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.463, + 0.127 + ], + "angle": 0, + "content": "A. Desai and N. Vasconcelos" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.148, + 0.785, + 0.175 + ], + "angle": 0, + "content": "17. Lu, W., Xu, Y., Zhang, J., Wang, C., Tao, D.: Handrefiner: Refining malformed hands in generated images by diffusion-based conditional inpainting (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.177, + 0.785, + 0.203 + ], + "angle": 0, + "content": "18. Phung, Q., Ge, S., Huang, J.B.: Grounded text-to-image synthesis with attention refocusing. arXiv preprint arXiv:2306.05427 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.204, + 0.785, + 0.245 + ], + "angle": 0, + "content": "19. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.246, + 0.785, + 0.286 + ], + "angle": 0, + "content": "20. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.785, + 0.327 + ], + "angle": 0, + "content": "21. Rassin, R., Hirsch, E., Glickman, D., Ravfogel, S., Goldberg, Y., Chechik, G.: Linguistic binding in diffusion models: Enhancing attribute correspondence through attention map alignment (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.37 + ], + "angle": 0, + "content": "22. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.785, + 0.424 + ], + "angle": 0, + "content": "23. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22500-22510 (June 2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.425, + 0.785, + 0.48 + ], + "angle": 0, + "content": "24. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.481, + 0.785, + 0.508 + ], + "angle": 0, + "content": "25. Salimans, T., Goodfellow, I., Zaremba, W., Cheung, V., Radford, A., Chen, X.: Improved techniques for training gans (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.509, + 0.785, + 0.619 + ], + "angle": 0, + "content": "26. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: Laion-5b: An open large-scale dataset for training next generation image-text models. In: Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., Oh, A. (eds.) Advances in Neural Information Processing Systems. vol. 35, pp. 25278-25294. Curran Associates, Inc. (2022), https://proceedings.neurips.cc/paper_files/paper/2022/file/a1859debfb3b59d094f3504d5ebbb6c25-Paper-Datasets_and_Benchmarks.pdf" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.62, + 0.785, + 0.646 + ], + "angle": 0, + "content": "27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.785, + 0.674 + ], + "angle": 0, + "content": "28. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. Advances in neural information processing systems 32 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.675, + 0.785, + 0.702 + ], + "angle": 0, + "content": "29. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: P+: Extended textual conditioning in text-to-image generation (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.702, + 0.785, + 0.743 + ], + "angle": 0, + "content": "30. Welling, M., Teh, Y.W.: Bayesian learning via stochastic gradient Langevin dynamics. In: Proceedings of the 28th international conference on machine learning (ICML-11). pp. 681-688 (2011)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.744, + 0.785, + 0.771 + ], + "angle": 0, + "content": "31. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.771, + 0.785, + 0.813 + ], + "angle": 0, + "content": "32. Zheng, G., Zhou, X., Li, X., Qi, Z., Shan, Y., Li, X.: Layoutdiffusion: Controllable diffusion model for layout-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22490-22499 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.148, + 0.785, + 0.813 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_origin.pdf b/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b886aef48e9de4ae4eb64c9050d42e63134a35c5 --- /dev/null +++ b/2024/Improving image synthesis with diffusion-negative sampling/24b033a2-9e69-4234-8695-37f0a0c724bb_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f7288b3cab42e808024cf34f0968352ba9626a8ca50c2a591ba64d29ce356979 +size 13258203 diff --git a/2024/Improving image synthesis with diffusion-negative sampling/full.md b/2024/Improving image synthesis with diffusion-negative sampling/full.md new file mode 100644 index 0000000000000000000000000000000000000000..7ce1de7d5b5ed7729791ed197faa4e8ea277888b --- /dev/null +++ b/2024/Improving image synthesis with diffusion-negative sampling/full.md @@ -0,0 +1,381 @@ +# Improving image synthesis with diffusion-negative sampling + +Alakh Desai1 and Nuno Vasconcelos1 + +University of California San Diego, USA {ahdesai,nuno}@ucsd.edu + +Abstract. For image generation with diffusion models (DMs), a negative prompt $\mathbf{n}$ can be used to complement the text prompt $\mathbf{p}$ , helping define properties not desired in the synthesized image. While this improves prompt adherence and image quality, finding good negative prompts is challenging. We argue that this is due to a semantic gap between humans and DMs, which makes good negative prompts for DMs appear unintuitive to humans. To bridge this gap, we propose a new diffusion-negative prompting (DNP) strategy. DNP is based on a new procedure to sample images that are least compliant with $\mathbf{p}$ under the distribution of the DM, denoted as diffusion-negative sampling (DNS). Given $\mathbf{p}$ , one such image is sampled, which is then translated into natural language by the user or a captioning model, to produce the negative prompt $\mathbf{n}^*$ . The pair $(\mathbf{p}, \mathbf{n}^*)$ is finally used to prompt the DM. DNS is straightforward to implement and requires no training. Experiments and human evaluations show that DNP performs well both quantitatively and qualitatively and can be easily combined with several DM variants. + +Keywords: Image generation $\cdot$ Diffusion Models $\cdot$ Negative prompting + +# 1 Introduction + +Diffusion models (DMs) [19, 22, 24] have shown exquisite capacity to synthesize visually appealing images guided by textual prompts. However, they are not easy to control. While the synthesized images are usually impressive, various classes of prompts are known to be difficult, e.g. prompts involving humans [12], hands [17], or multiple objects and their interactions [3]. The synthesized image quality can often be unsatisfactory for such prompts, and prompt adherence is usually weak. This is illustrated in Figure 1, which shows an image synthesized by Stable Diffusion (SD) for a complex prompt $\mathbf{p}$ . The problem can be mitigated by adding alternative conditioning inputs to the diffusion model, such as visual conditioning with sketches or layouts [31, 32]. This, however, usually requires skilled users and can be labor-intensive. Ideally, it should be possible to improve consistency with text prompts alone. In this work, we explore negative prompting [16], which has been quite effective but is difficult to use. We argue that this difficulty stems from a semantic gap between the concept representations of a human user and the DM. We then introduce a new prompting technique, denoted as diffusion-negative prompting (DNP), to bridge this gap, as illustrated in Figure 1. + +![](images/eb12003f50b2369b6e7714e53cc19f97a4f3ee175bf64cd185f9bd31619eec3a.jpg) +Fig. 1: DNP improves quality of synthesis for prompts $\mathbf{p}$ (green) of SD's images (top-right). A diffusion-negative image, $\bar{\mathcal{I}}$ , is sampled using DNS, enabling the user to visualize the negation of $\mathbf{p}$ under DM's distribution. The user translates the $\bar{\mathcal{I}}$ into a negative prompt $\mathbf{n}^*$ (red), by a process denoted as DNP, and the DM is prompted with the pair $(\mathbf{p},\mathbf{n}^{*})$ . This increases compliance and quality of the synthesized image (bottom-right). Replacing the user with a captioning model is denoted as auto-DNP. + +Negative prompting complements the text prompt $\mathbf{p}$ , e.g. "an airplane standing on the runway", with negative prompts $\mathbf{n}$ , e.g. "flying" or "soaring". As illustrated in the top row of Figure 2a, this greatly improves compliance of the synthesized image with prompt $\mathbf{p}$ and can improve image quality. However, negative prompts are difficult to use, for two reasons. First, there are many prompts, e.g. see $\mathbf{p} =$ "a cat and a dog" in Figure 2b, without a clear negative. Second, even when an intuitive negative exists, e.g. "flying" vs. "standing", it is not necessarily a successful negative for DMs across seeds, as seen in the bottom row of Figure 2a. This raises the question: what is a good negative prompt for a DM? In general, $\mathbf{n}$ is a good negative prompt if the images synthesized by prompt-pair $(\mathbf{p},\mathbf{n})$ adhere more to $\mathbf{p}$ than those synthesized by $\mathbf{p}$ alone. This, however, is a DM-centric definition of negative prompt. The problem is that the semantic representation of the DM is only a weak approximation to that used by a human. In general, DMs cannot replicate the human definition of concept negation. We refer to this problem as the semantic gap between DMs and humans. As a result, good negative prompts for a DM are frequently not intuitive for humans, i.e. what a human would consider a negative for $\mathbf{p}$ . This makes it difficult for users to produce good negative prompts for DMs. + +In this work, we address this problem by devising a strategy that enables humans to visualize the concepts that DMs consider negatives for prompt $\mathbf{p}$ . This procedure is inspired by classifier-free guidance (CFG) [11]. While CFG uses a sampling guidance factor that increases the probability of images compliant with $\mathbf{p}$ , we introduce a diffusion-negative sampling (DNS) guidance factor that encourages the sampling of the diffusion-negative images, $\bar{\mathcal{I}}$ , least compliant with $\mathbf{p}$ , under the DM's image distribution. This $\bar{\mathcal{I}}$ usually does not comply with the human understanding of the negation of concepts in $\mathbf{p}$ . However, because it represents the DM's understanding of this negation, it can be shown to the user to overcome the semantic gap between them. The user can then produce a negative + +![](images/5f39133d84d974e588b6703746867eeca6915c1f4a100e15d1708afcfd944d50.jpg) +p: an airplane standing on the runway + +![](images/3a6627481b5f8aec862e34d924bc939b6467b8c02a7f2d4c92fa109b004e254c.jpg) +(a) Semantic negatives: While effective, they do not guarantee compliance across seeds. Success (top), failure (bottom). + +![](images/a6549f6fd4761c020f0ae4d4250259739a7231e90bc95e903806cb74a71dd010.jpg) + +![](images/b99f818cf8a4700d4865a365aab7eccd3a6fb04b8f1a3b68dcd17fdb1e1ddb5c.jpg) +(b) Non-semantic negatives: A good negative prompt needs multiple iterations for every seed as they can be highly unintuitive. +Fig. 2: Example of negative prompting for both semantic and non-semantic scenarios. The positive prompt, $\mathbf{p}$ and negative prompts, $\mathbf{n}$ are on top of each image. + +prompt $\mathbf{n}^*$ in the language of the DM by simply captioning $\bar{\mathcal{L}}$ . Prompting the DM with the pair $(\mathbf{p},\mathbf{n}^{*})$ usually produces better images than with $\mathbf{p}$ alone. + +Figure 1 shows how DNP can help when DMs produce poor-quality images. In response to the user prompt $\mathbf{p} =$ "woman in black dress on the red carpet wearing a ring on the finger", SD generates the top image, with distorted hands and rings. The rest of the figure illustrates DNP. Given the prompt $\mathbf{p}$ , the DM samples a negative image $\bar{\mathcal{I}} (\mathbf{p})$ using DNS. In the figure, $\bar{\mathcal{I}}$ contains the house with a garden. The user inspects the image and produces a diffusion-negative prompt $\mathbf{n}^{*}(\bar{\mathcal{I}}) =$ "a white home with a garage and grass in the front yard" that reflects the content of this image. This is similar to captioning the image, and can also be done automatically by an image captioning model, resulting in what we denote as auto-DNP. Finally, the DM is prompted with the pair $(\mathbf{p},\mathbf{n}^{*})$ to produce an image that has much better compliance with $\mathbf{p}$ than the original. + +Our experiments show that DNP improves prompt adherence and image quality, both in terms of quantitative metrics, like CLIP scores of image-prompt similarity, and subjective ratings by human evaluators. This is shown to hold both for vanilla DMs, like SD, and DMs optimized for solving specific problems, e.g. the $A\& E$ [3] model tailored to synthesize images containing multiple objects. Various ablations also show that DNP outperforms negative prompting solutions commonly used by practitioners, e.g. using a dictionary of universal negative prompts, random prompts, etc. It also provides much-needed transparency to the negation process. auto-DNP provides a fully automated implementation of DNP. While not as effective as DNP, it maintains all the benefits discussed above, avoids user captioning effort, and allows automatic comparisons to other negative prompting procedures. Finally, our experiments consistently demonstrate the existence of a semantic gap between DMs and humans. Although the negative images generated by DNS are frequently very unintuitive for humans, they help the DM significantly when translated into negative prompts. + +Overall, this paper makes the following contributions. First, we hypothesize that DM image synthesis can be substantially enhanced by using negative prompts. However, these prompts are difficult for humans to generate, due to the semantic gap between humans and DMs, which leads to a different understanding of concept negation. Second, we introduce the DNS procedure to overcome this semantic gap, allowing humans to visualize the negative concept as understood by the DM. This enables negative prompting with DNP, as shown in Figure 1. Third, we present extensive experiments on various datasets, showing that DNP complements any existing DM or its variant. Fourth, we show that the process can be automated by using a pre-trained image captioner, leading to auto-DNP. Finally, we show that DNP is trivial to implement and requires no training. + +# 2 Diffusion Models + +Latent Diffusion: DMs combine a forward and a backward process for generative modeling. In the forward process, a sample is gradually corrupted by sequential application of small amounts of Gaussian noise. The backward process then sequentially denoises the sample using a learned neural network $\epsilon_{\theta}$ . Latent DMs (LDMs) increase the efficiency of the diffusion process by operating on the low dimensional latent space $\mathcal{Z}$ of an autoencoder, implemented with a pretrained encoder/decoder pair $(\mathcal{E}(.)$ , $\mathcal{D}(.)$ ). This transforms image $x \in \mathcal{X}$ into latent representation $z = \mathcal{E}(x) \in \mathcal{Z}$ and reconstructs the image with $x = \mathcal{D}(\mathcal{E}(z))$ . + +Training: In the forward process, a noisy version of the latent representation is obtained at each time step $t$ with $z_{t} = \sqrt{\bar{\alpha}_{t}} z + \sqrt{1 - \bar{\alpha}_{t}}\epsilon$ . Here, $\bar{\alpha}_t = \prod_{s=1}^t (1 - \beta_s)$ , where $\{\beta_1, \dots, \beta_T\}$ is fixed according to the variance schedule and $\epsilon \sim \mathcal{N}(0, I)$ . In the backward process, the denoising model $\epsilon_{\theta}$ estimates the noise $\epsilon_t$ added to the noisy latent representation at each time step $t$ . The denoising is conditioned by the embedding $\tau(\mathbf{p})$ , of text prompt $\mathbf{p}$ , where $\tau(.)$ is a text encoder. The denoising network parameters are learned by minimizing the loss + +$$ +\mathcal {L} = \mathcal {E} _ {t \sim \mathcal {U} (1, T), \epsilon_ {t} \sim \mathcal {N} (0, I)} \left[ \| \epsilon_ {t} - \epsilon_ {\theta} \left(z _ {t}; t, \tau (\mathbf {p})\right) \| ^ {2} \right], \tag {1} +$$ + +where $\mathcal{U}$ and $\mathcal{N}$ are the uniform and Gaussian distributions, respectively. + +Inference: Given prompt $\mathbf{p}$ , images are sampled by iteratively alternating between denoising and sampling, with + +$$ +\hat {\epsilon} _ {p} = \epsilon_ {\theta} \left(z _ {t}; t, \tau (\mathbf {p})\right), \quad z _ {t - 1} = \text {s a m p l e} \left(z _ {t}, \hat {\epsilon} _ {p}, t\right). \tag {2} +$$ + +The sampling method, sample, varies with the DM. Popular approaches are DDPM [9] and DDIM [27]. This process is initialized with a noise seed $z_{T} \sim \mathcal{N}(0,I)$ and produces a latent image code $z_{0}$ , which is finally passed to the decoder to obtain image $x_{0} = \mathcal{D}(z_{0})$ . + +Classifier-free Guidance: CFG [11] is a method to trade off prompt compliance and image diversity. It consists of training the DM with and without prompt $\mathbf{p}$ , randomly setting $\mathbf{p}$ to the empty prompt $\phi = "$ ", with probability + +$P_{\text{uncond}} = 0.1$ . At inference, each denoising step uses a linear combination of the prompt-conditional $(\hat{\epsilon}_p)$ and unconditional $(\hat{\epsilon}_{\phi})$ noise estimates + +$$ +\hat {\epsilon} = \hat {\epsilon} _ {\phi} + s (\hat {\epsilon} _ {p} - \hat {\epsilon} _ {\phi}), \tag {3} +$$ + +where $\hat{\epsilon}_p = \epsilon_\theta (z_t;t,\tau (\mathbf{p}))$ , $\hat{\epsilon}_{\phi} = \epsilon_{\theta}(z_{t};t,\tau (\phi))$ , and $s$ is an hyper-parameter that controls the conditioning strength, known as the guidance-scale. The modified noise $\hat{\epsilon}$ is then utilized to update the latent representation. + +Negative Prompting: Despite conditioning on text prompt $\mathbf{p}$ , prompt adherence of CFG can be weak when $\mathbf{p}$ refers to complex scenes, such as that in Figure 1. Negative prompting [16] is useful as an extra conditioning input. Given negative prompt $\mathbf{n}$ , the inference denoising steps are implemented with + +$$ +\hat {\epsilon} = \hat {\epsilon} _ {\phi} + s (\hat {\epsilon} _ {p} - \hat {\epsilon} _ {n}) \tag {4} +$$ + +where + +$$ +\hat {c} _ {n} = \epsilon_ {\theta} \left(z _ {t}; t, \tau (\mathbf {n})\right). \tag {5} +$$ + +Practitioners have shown that simply replacing the empty prompt $\phi$ of CFG with the negative prompt $\mathbf{n}$ , i.e. using $\hat{\epsilon} = \hat{\epsilon}_n + s(\hat{\epsilon}_p - \hat{\epsilon}_n)$ , yields similar results, albeit for a slightly different guidance scale $s$ [1]. This has the benefit of computational efficiency, as it only requires the calculation of two noise vectors instead of three. Hence, this method has gained popularity and has become the default implementation of negative prompting in many T2I generation models. However, in what follows, we use the theoretically more grounded (4) to derive a procedure to sample diffusion-negative images $(\bar{\mathcal{I}})$ . + +# 3 Creating Good Negative Prompts + +In this section, we introduce DNP. + +# 3.1 Energy-based model interpretation + +Sampling with a DM of network $\epsilon_{\theta}(z_t; t, \tau(\mathbf{p}))$ can be interpreted as sampling from probability distribution $p_{\theta}(z_t | \mathbf{p}) \propto e^{-E_{\theta}(z_t; t, \tau(\mathbf{p}))}$ , where $E_{\theta}$ is an energy function, using the score function $\nabla_z \log P(z | \mathbf{p})$ and Longevin dynamics [28,30]. The DM network is trained to learn the score function, i.e. + +$$ +\epsilon_ {\theta} \left(z _ {t}; t, \tau (\mathbf {p})\right) = - \nabla_ {z _ {t}} \log p _ {\theta} \left(z _ {t} \mid \tau (\mathbf {p})\right). \tag {6} +$$ + +This motivates the CFG denoising step of (3), which corresponds to sampling from the distribution + +$$ +p _ {c f g} \left(z _ {t}, \mathbf {p}\right) \propto p _ {\theta} \left(z _ {t}\right) \gamma_ {c f g} ^ {s} \left(z _ {t}, \mathbf {p}\right) \tag {7} +$$ + +where + +$$ +\gamma_ {c f g} \left(z _ {t}, \mathbf {p}\right) = \frac {p _ {\theta} \left(z _ {t} \mid \mathbf {p}\right)}{p _ {\theta} \left(z _ {t}\right)} \propto p _ {\theta} (\mathbf {p} \mid z _ {t}) \tag {8} +$$ + +is a guidance factor that increases the probability of codes $z_{t}$ corresponding to images compliant with prompt $\mathbf{p}$ . Similarly, the negative prompt denoising step of (4) corresponds to sampling from + +$$ +p _ {n p} \left(z _ {t}, \mathbf {p}, \mathbf {n}\right) \propto p _ {\theta} \left(z _ {t}\right) \gamma_ {n p} ^ {s} \left(z _ {t}, \mathbf {p}, \mathbf {n}\right) \tag {9} +$$ + +with guidance factor + +$$ +\gamma_ {n p} (z _ {t}, \mathbf {p}, \mathbf {n}) = \frac {p _ {\theta} (z _ {t} | \mathbf {p})}{p _ {\theta} (z _ {t} | \mathbf {n})} \propto \frac {p _ {\theta} (\mathbf {p} | z _ {t})}{p _ {\theta} (\mathbf {n} | z _ {t})}. \tag {10} +$$ + +This increases the probability of sampling latent codes $z_{t}$ of large odds ratio + +$$ +o \left(z _ {t}, \mathbf {p}, \mathbf {n}\right) = \frac {p _ {\theta} (\mathbf {p} \mid z _ {t})}{p _ {\theta} (\mathbf {n} \mid z _ {t})}. \tag {11} +$$ + +Since the Bayes decision rule for deciding between $\mathbf{p}$ and $\mathbf{n}$ is to choose $\mathbf{p}$ when $o(z_{t},\mathbf{p},\mathbf{n})\geq 1$ and $\mathbf{n}$ otherwise, it increases the probability that sampled codes comply with prompt $\mathbf{p}$ and not with prompt $\mathbf{n}$ . + +# 3.2 Limitations of Negative Prompting + +Besides being theoretically well-motivated, negative prompting frequently improves image quality, as illustrated in the top row of Figure 2a. However, negative prompts are difficult to specify, because a natural negative frequently does not exist or does not produce the intended results. Figure 2b shows an example for prompt $\mathbf{p} =$ "a cat and a dog". Here, the user may need to attempt several negative prompts $\mathbf{n}$ , requiring multiple iterations of image synthesis, as illustrated in the figure. Eventually, the user notices the insistence of the DM in brown objects and uses $\mathbf{n} =$ "brown". This is complemented with "ugly", which practitioners have identified as a good general-use negative prompt. To compound the problem, a negative prompt successful for one random seed can be unsuccessful for another seed, i.e. good negative prompts depend on both prompt $\mathbf{p}$ and seed $z_{T}$ , as illustrated in Figure 2a. In summary, negative prompting is an art form and can be quite cumbersome, even when successful. + +In practice, the human-provided negative prompt frequently fails to improve the quality of the image generated by the DM. We hypothesize that this is because the semantic representation of the DM is only a weak approximation to that of humans. Hence, there is no guarantee that, under the probability distribution modeled by the DM, there will be a large classification margin between $\mathbf{p}$ and the human-provided $\mathbf{n}$ . In this case, negative prompting fails to produce samples of large odds ratio $o(z_{t},\mathbf{p},\mathbf{n})$ and the prompt pair $(\mathbf{p},\mathbf{n})$ fails to induce the model to produce more prompt compliant images than those generated with CFG, i.e. the posterior probability $p_{\theta}(\mathbf{p}|z_t)$ of (8). In the extreme case where $p_{\theta}(\mathbf{p}|z_t)\approx p_{\theta}(\mathbf{n}|z_t)$ for the samples of high $p_{\theta}(\mathbf{p}|z_t)$ , $o(z_{t},\mathbf{p},\mathbf{n})\approx 1$ for those samples and (9) looses all sensitivity to prompt $\mathbf{p}$ . + +# 3.3 Diffusion-Negative Guidance + +The discussion above suggests that a good negative prompt for the DM "grounds" the odds-ratio of (11), providing a reference for the prompt $\mathbf{p}$ , which is defined in terms of the margin to negative $\mathbf{n}$ . However, this grounding must happen under the internal representation of the DM, which is not necessarily that of humans. The goal is to encourage samples more likely to comply with given prompt $\mathbf{p}$ than the negative prompt, under the conceptual representation of the model. We formalize this goal by defining the optimal negative prompt $\mathbf{n}^*$ for the DM as the one that maximizes the steepness of the odds ratio with $\mathbf{p}$ , i.e. + +$$ +\mathbf {n} ^ {*} (\mathbf {p}) = \arg \max _ {\mathbf {n}} \nabla_ {z _ {t}} \log o (z _ {t}, \mathbf {p}, \mathbf {n}). \tag {12} +$$ + +This is denoted as the diffusion-negative prompt for $\mathbf{p}$ . Using (2), (5), and (11), + +$$ +\nabla_ {z _ {t}} \log o (z _ {t}, \mathbf {p}, \mathbf {n}) = \nabla_ {z _ {t}} \log \frac {p _ {\theta} (\mathbf {p} | z _ {t})}{p _ {\theta} (\mathbf {n} | z _ {t})} = \nabla_ {z _ {t}} \log \frac {p _ {\theta} (z _ {t} | \mathbf {p})}{p _ {\theta} (z _ {t} | \mathbf {n})} = \hat {\epsilon} _ {p} - \hat {\epsilon} _ {n}. \tag {13} +$$ + +Hence, for a given $z_{t}$ , a natural alternative definition of the diffusion-negative prompt is that which induces the noise vector maximally distant from $\hat{\epsilon}_{p}$ , i.e. + +$$ +\epsilon_ {n ^ {*}} = \underset {n \mid \| \hat {\epsilon} _ {n} \| ^ {2} = K} {\arg \max } \left\| \hat {\epsilon} _ {p} - \hat {\epsilon} _ {n} \right\| ^ {2} \tag {14} +$$ + +where $K$ prevents the noise magnitude from becoming infinitely large. This is the prompt that induces the steeper log odds surface at $z_{t}$ , encouraging the largest margin between the probabilities $p_{\theta}(z_t|\mathbf{p})$ and $p_{\theta}(z_t|\mathbf{n}^*)$ in the neighborhood of $z_{t}$ . In Supplementary Section 1, we show that (14) has a solution + +$$ +\hat {\epsilon} _ {n ^ {*}} = - \sqrt {K} \frac {\hat {\epsilon} _ {p}}{\| \hat {\epsilon} _ {p} \|} \propto - \hat {\epsilon} _ {p}. \tag {15} +$$ + +Choosing $K = \| \hat{\epsilon}_p\|^2$ , i.e. equal noise strength under the positive and negative conditions, results in $\hat{\epsilon}_{n^*} = -\hat{\epsilon}_p$ . + +# 3.4 Diffusion-Negative Sampling (DNS) + +It follows from (6) that + +$$ +\nabla_ {z _ {t}} \log p _ {\theta} \left(z _ {t} | \mathbf {n} ^ {*}\right) = - \nabla_ {z _ {t}} \log p _ {\theta} \left(z _ {t} | \mathbf {p}\right) \Longrightarrow p _ {\theta} \left(z _ {t} | \mathbf {n} ^ {*}\right) \propto \frac {1}{p _ {\theta} \left(z _ {t} | \mathbf {p}\right)}. \tag {16} +$$ + +However, for most $p_{\theta}(z_t|\mathbf{n})$ , (16) is an improper distribution [4]. This stems from the fact that a negative condition must be specified in context [5]. A general contextual constraint for DM-based sampling is that the negatively conditioned DM should still sample images from the image distribution $p_{\theta}(z_t)$ . To account for this, we define the diffusion-negative guidance factor as + +$$ +\gamma_ {d n} \left(z _ {t}, \mathbf {p}\right) = \frac {p _ {\theta} \left(z _ {t}\right)}{p _ {\theta} \left(z _ {t} \mid \mathbf {p}\right)} \propto \frac {1}{p _ {\theta} \left(\mathbf {p} \mid z _ {t}\right)}, \tag {17} +$$ + +which leads to the diffusion-negative distribution + +$$ +p _ {d n} \left(z _ {t}, \mathbf {p}\right) \propto p _ {\theta} \left(z _ {t}\right) \gamma_ {d n} ^ {s} \left(z _ {t}, \mathbf {p}\right) \tag {18} +$$ + +and inference denoising equation + +$$ +\hat {\epsilon} = \hat {\epsilon} _ {\phi} + s (\hat {\epsilon} _ {\phi} - \hat {\epsilon} _ {p}). \tag {19} +$$ + +Sampling with this equation is denoted as diffusion-negative sampling (DNS). When compared to (10), the diffusion-negative guidance factor of (17) has two main differences. First, it does not require the semantic negative prompt $\mathbf{n}$ , reflecting the fact that the definition of negative is fully based on the internal representation of the DM. Second, it replaces the odds ratio of (11) by the ratio between the image distribution $p_{\theta}(z_t)$ and the image distribution under the positive condition $\mathbf{p}$ . This emphasizes sampling images from the DM probability distribution with the lowest prompt conditional probability $p_{\theta}(z_t|\mathbf{p})$ . When compared to the guidance factor (8) of CFG, (17) simply flips the role of the image distributions $p_{\theta}(z_t)$ and $p_{\theta}(z_t|\mathbf{p})$ . This provides a simple interpretation of diffusion-negative guidance as the "opposite" of CFG. Rather than sampling natural images that align best with the condition $\mathbf{p}$ , it emphasizes sampling natural images that least comply with it. + +The relation between the guidance factors of (17) and (10) + +$$ +\gamma_ {d n} \left(z _ {t}, \mathbf {p}\right) = \frac {p _ {\theta} \left(z _ {t}\right)}{p _ {\theta} \left(z _ {t} \mid \mathbf {p}\right)} = \gamma_ {n p} \left(z _ {t}, \phi , \mathbf {p}\right) \tag {20} +$$ + +makes the implementation of DNS trivial for any model that supports negative prompting. It suffices to prompt the latter with empty positive prompt $\phi$ and negative prompt $\mathbf{p}$ . Hence, DNS requires no retraining of the $DM$ , nor any optimizations at inference. + +# 3.5 Diffusion-Negative Prompting (DNP) + +DNP relies on DNS to implement the procedure of Figure 1. Given prompt $\mathbf{p}$ , DNS is used to sample a diffusion-negative image, $\bar{\mathcal{I}}$ , as discussed above. This image is then captioned by the user, to produce the DNP $\mathbf{n}^*$ . The DM is finally prompted with the prompt pair $(\mathbf{p}, \mathbf{n}^*)$ to produce the final image. As illustrated in Figure 1, the captioning step can be performed by either the user or any captioning model. In the latter case, the process is denoted auto-DNP. auto-DNP has the advantage of fully automating DNP, making the entire process transparent to the user and reducing user effort. The price is a small increase in the failure rate due to captioning errors. In this paper, we use BLIP2 [14] as the captioning model to implement auto-DNP. However, auto-DNP can be used with any other captioner. We show results obtained with GPTv4 (gpt-4-vision-preview) in Supplementary Section 4. Figure 3 and the final column of Figure 4 illustrate how DNP produces images that either have higher quality or comply better with the prompt $\mathbf{p}$ . + +# 4 Experiments + +In this section, we discuss the experimental evaluation of DNP. + +# 4.1 Datasets + +For a comprehensive dataset description see Supplementary Section 2.2 + +Existence and Attribute Binding (A&E) Dataset: This is the benchmark dataset introduced by [3]. This dataset is focused on entity neglect, which occurs when one or more entities are completely ignored by the generative model, and attribute assignment, which evaluates whether an attribute is associated with the correct object in the image. To evaluate these, each prompt in the dataset comprises two entities and their associated attributes. There are three categories of prompts: (1) "an animal and an animal"; (2) "a color in-animate object and an animal"; (3) "a color in-animate object and a color in-animate object". We sample 50 prompts from each category for 32 random seeds. + +Human and Hand Generation (H&H) Dataset: Humans and hands occur in various shapes and forms, including gender, race, activity, and individual differences. Despite the size of the training datasets, this variation has posed a major challenge to DMs, which are known to synthesize images with extra or merged limbs and fingers. We curated a challenging benchmark dataset to test the effect of DNP on human and hand generation. The dataset consists of 45 human-based prompts such as "a man wearing a sombrero" and 25 hand-based prompts such as "hand with a ring on it". We run all prompts for 32 seeds. + +# 4.2 Evaluation Metrics + +Text-Image CLIP Score: [8] is a widely used metric of the similarity between a generated image and its text prompt. For the H&H dataset, we calculate the CLIP Score between each generated image and its corresponding prompt. For the A&E dataset, we follow the evaluation protocols established by [3], which measure CLIP Score at full prompt and entity level. For evaluating the Full Prompt CLIP Score, we calculate the score between the generated image and the full prompt. For the Minimum Object CLIP Score, we take the minimum score between the entities in the prompt, as the entity with the minimum CLIP Score represents the neglected entity for the given prompt. This allows us to measure the CLIP Score at two levels, thereby providing better insight into the presence of both entities in the A&E dataset prompts. + +Inception Score (IS): [25] is a popular metric for assessing the quality and realism of images. It is the exponential of the average of the entropy of the label distribution predicted by the Inception v3 classifier model. In particular, we choose IS over FID as it does not require a dataset with real images. + +Human Evaluation: While CLIP Score and IS provide an objective measure of correctness and quality, they are known for not being fully aligned with human aesthetics and preferences. To evaluate DNP in terms of human preferences, we used Amazon Mechanical Turk (AMT) to evaluate a subset of each dataset. We + +
MethodCLIP Score
HumanHandA&E
Min. ObjectFull Prompt
SD+auto-DNP0.3300.3230.2500.344
SD+DP0.3310.3240.2530.345
+ +Table 1: Benchmarking DNP to auto-DNP with CLIP Score. + +performed human evaluation on 100 prompt-seed pairs for the human dataset, 100 pairs for the Hands dataset, and 150 (50 per category) pairs for the A&E dataset. The evaluators were asked to compare the images using two criteria. 1) Adherence to the prompt, and 2) Quality (natural or realistic nature) of the image. MTurkers were tasked with choosing one image based the two criteria. They could also choose no clear winner if they did not prefer one over the other. More details can be found in the Supplementary Section 2.3. + +# 4.3 Benchmarking DNP vs auto-DNP + +The evaluation of DNP requires human users. PhD students, with no experience in visual language research, were shown an image and asked to produce a caption shorter than 60 words. Due to the prohibitive resources required to caption the image $\bar{\mathcal{I}}$ for all prompt-seed pairs of all the datasets, we restricted the evaluation of DNP to the prompt-seed pairs used for human evaluation. We compared the performance of DNP and auto-DNP on this set and used auto-DNP in the remaining experiments. Besides being cost-effective, this enables the replication of our experiments for comparison to other negative prompting methods. Table 1 compares the performance of DNP and auto-DNP, on the prompt-seed pairs used for the human evaluation1. For the rest of the paper, we use the notation DM+X, where DM is the diffusion model and X the negative prompting method. + +While DNP achieves the best performance, auto-DNP provides almost identical results. This suggests that the BLIP2 model is quite effective at captioning the diffusion-negative negative images $\bar{\mathcal{I}}$ . + +# 4.4 Quantitative Results + +We next discuss the results of quantitative experiments on image quality using auto-DNP. Various ablations are also presented in Supplementary Section 4. + +A&E dataset: We first compare SD to $\mathrm{SD + }$ auto-DNP, on the A&E dataset in Table 2a. $\mathrm{SD + }$ auto-DNP achieves a Min. Object CLIP Score of 0.258, which is $6.6\%$ higher than that of SD, illustrating that $\mathrm{SD + }$ auto-DNP generates images that align better with the prompts. Since CLIP scores practically range from [0, 0.4] [8], the full prompt CLIP Score of 0.346 of $\mathrm{SD + }$ auto-DNP suggests good alignment between prompt and image. Human evaluation underscores the true + +
MethodCLIP ScoreISHuman Evaluation
Min. ObjectFull PromptCorrectnessQuality
No Clear Winner---16.88%10.46%
Stable Diffusion (SD)0.2420.33513.1718.90%25.73%
SD+auto-DNP0.258 (+6.61%)0.346 (+3.28%)13.35 (+1.37%)64.22%63.81%
No Clear Winner---16.95%7.35%
Attend & Excite (A&E)0.2640.34911.8630.06%33.12%
A&E+auto-DNP0.276 (+4.54%)0.362 (+3.72%)13.12 (+10.62%)52.99%59.53%
+ +(a) Quantitative Results on the A&E dataset. + +
DatasetMethodCLIP ScoreISHuman Evaluation
CorrectnessQuality
Human PromptsNo Clear Winner--14.42%5.10%
Stable Diffusion (SD)0.3229.9527.60%29.0%
SD+auto-DNP0.331 (+2.80%)10.13 (+1.80%)57.98%65.80%
Hand PromptsNo Clear Winner--19.89%8.18%
Stable Diffusion (SD)0.30912.0420.45%22.47%
SD+auto-DNP0.321 (+3.88%)12.39 (+2.94%)59.66%69.35%
+ +(b) Quantitative Results on the H&H dataset. + +Table 2: Quantitative Results: comparing prompt adherence and image quality by CLIP Score, IS and Human Evaluation. The percentage gains are shown in (brackets) + +strength of DNP, as human evaluators prefer images generated by $\mathrm{SD} + \mathrm{auto}$ -DNP $3.4\times$ more in terms of correctness and $2.5\times$ more in terms of quality than those generated by SD. Note that $\mathrm{SD} + \mathrm{auto}$ -DNP even outperforms the $A\& E$ model in IS and matches its CLIP Score for both full prompt and minimum object, despite not being specifically designed for multiple object generation. + +To demonstrate the flexibility of the DNP approach, we also applied it to the $A\& E$ model, comparing $A\& E + \text{auto-DNP}$ to $A\& E$ . We observe a moderate increase in the CLIP Score since $A\& E$ is already quite efficient at generating multiple objects. $A\& E + \text{auto-DNP}$ achieves a Min. Object CLIP Score of 0.276, which is very close to the theoretical upper bound for Min. Object CLIP Score of 0.29 as defined by [3]. The $10.62\%$ improvement in IS shows that $A\& E$ is more inclined to generate unrealistic images and the addition of DNP improves its realism. The human evaluation also reflects this, as around $53\%$ of the evaluators prefer $A\& E + \text{auto-DNP}$ over the $A\& E$ images for correctness and $60\%$ for quality, which is close to $1.8\times$ the preference for $A\& E$ . + +H&H dataset: Table 2b summarizes the ability of DNP to address the specific SD weaknesses of synthesizing humans and hands. Since both CLIP and IS may ignore distorted or maligned results when considering correctness or realism, they fail to give substantial insight into image quality (despite improvement). The human evaluation is much more important for this task. SD+auto-DNP outperforms SD by a substantial margin, as evaluators prefer SD+auto-DNP $3 \times$ more for correctness and $2 \times$ more for quality, for both human and hand prompts. Since evaluators were specifically tasked with checking the number and pose of limbs and fingers and the quality of the faces, their preference for images generated with DNP shows that the latter improves SD performance substantially. + +![](images/dbacb51d43429b029e7caf8996361a829e3593c9206c564f4eb7f1f8854b1390.jpg) +Prompts with Humans +p: a boy in the moonlight n*: a living room with a fireplace and wooden beams + +![](images/789f5ff4fb08412c62ddbe2cc264a469a101aa0e7e328798935e9877330a7e24.jpg) +Prompts with Multiple Nouns +p: a cat and a dog $\mathbf{n}^*$ : an aerial view of a resort with a swimming pool + +![](images/75c83b9675a1467925efbd6b7b9b5715eaaddaea9da0eef94cf76f37e5156877.jpg) +Prompts with Hands +p: a hand with a ring on it + +![](images/fcf30f4aab035b8289249a5876a8df1278416f75d09ca9f9bbed1646be2eede5.jpg) +p: a man in a sombrero +n*: a modern three story townhouse with two garages + +![](images/4e8bf7651c4258dfec08a6df5a82d996b9a75d44d14c834a12e8b57880489006.jpg) +p: a boy playing with his dog n*: three bowls of stew with vegetables and herbs + +![](images/65cf8144a32e5429450941ee89db357bc3144a3bdda417ec15ca42903a404646.jpg) +$\mathbf{n}^{*}$ : a woman in a black dress on the red carpet +p: a closeup of a handshake + +![](images/ef513672a64542ddddf6b6c9763114dd59b8bae5b39ea087244ec5d5de275d56.jpg) +p. a child on the couch n*: men and women in suits and ties in front of a crowd +Fig. 3: Images synthesized by SD (left) for prompt p vs. $\mathrm{SD + }$ auto-DNP (right) for prompt pair $(\mathbf{p},\mathbf{n}^{*})$ , where $\mathbf{n}^*$ is the DNP estimated from the DNS image. DNP produces negative prompts that are not intuitive for humans but improve quality and adherence. + +![](images/7bfd6aebdab7ecc6ef6487f8defc96db17651790879e8faf333a726366b12783.jpg) +p: a bear with a brown crown +n*: a rendering of the plans for a home + +![](images/37825c15ee54050697eda67484b53f438bfab170168628c476d0ce6ed9e05d92.jpg) +$\mathbf{n}^{*}$ : an aerial view of a large home in the woods +p: a tattooed hand +n*: four pictures of a house, a car and a tree + +# 4.5 Qualitative Results + +Figure 3 shows qualitative examples from the three datasets, comparing SD with SD+auto-DNP. There are more visual examples in Supplementary Section 5. + +The H&H dataset results, e.g. the images synthesized for prompt "hand with a ring on it", illustrate how auto-DNP improves the quality of humans and hands in terms of the number of limbs, fingers, poses, etc. It also induces the model to create realistic images, rather than drawings or sketches. See, for example, the "man in a sombrero" and "boy in the moonlight" examples. We observe a major improvement in the quality of the humans generated by auto-DNP wherein the faces do not exhibit the uncanny, robotic, or distorted features that SD is inclined to create, instead having a natural warmth. + +The results on the A&E dataset show that auto-DNP can correct for entity neglect while ensuring superior image quality. This is especially visible when we compare $A\& E$ with $A\& E + \text{auto-DNP}$ (see Figures 5,6,7 in Supplementary Section 5), which produces more realistic images. We posit that auto-DNP's inclination towards generating more realistic images is due to setting the diffusion process onto a better Markov chain without disrupting it at each step, unlike $A\& E$ . + +Finally, note that none of the negative prompts produced by auto-DNP in Figure 3 is intuitive for humans. This illustrates the semantic gap between humans and SD and the difficulty of producing good negative prompts manually. + +![](images/b2b9a837519080e6dab3e0670fb4bb9281a0e5c7f4ea05fdfa58bacdc88761bb.jpg) +Fig. 4: Exploring Semantic Gap: From left to right: 1) images generated for prompt p, 2) DNS images generated by the DM and resulting caption $\mathbf{n}^*$ by DNP, 3) images synthesized with $\mathbf{n}^*$ as the negative prompt alone, and 4) with prompt pair $(\mathbf{p},\mathbf{n}^{*})$ + +![](images/8597c17d18fec48a5d9160ffb6406bee982ceadd20967e6e1015ef79ee01d629.jpg) + +![](images/e8bad81d8b6055a3b0b5cba7e264d30f3779897dd6ccc0b909e905c4d881e1db.jpg) + +![](images/3a19ae7db6e0f76e8180db4ccf850362c49daf8b0cd4ba99ab1f840c29064ed8.jpg) + +![](images/06a8b7c9f7aa63e36a9c93ea23e394ebaf6154e2e7c4e42e06697a11a27f259f.jpg) + +![](images/325fe574ed53e9c18d889d261a5c2ae523b73836e2acade4d3c7208d13c987b5.jpg) + +![](images/7188aae081dc96767b091d9d99bfde0c68b0d44d4b03be4cbd72091f2018a195.jpg) + +# 4.6 Semantic Gap + +Figure 4 explores the semantic gap between humans and DMs in more detail. From left to right, the first column shows images synthesized by SD with prompt $\mathbf{p}$ . The second column shows examples of images sampled with DNS, i.e. (19). These can be seen as images that the model hallucinates as "negatives" of the prompt $\mathbf{p}$ since they usually do not have this interpretation for humans. The caption $\mathbf{n}^*$ is obtained the user. To confirm that the prompt mirrors the DM internal representation of the "negative" for the image in the left column, we prompted the model with an empty positive prompt $\mathbf{p} = \phi$ and $\mathbf{n}^*$ as a negative prompt, which produces the images in the third column of the figure. Note how these images comply with $\mathbf{p}$ even though $\mathbf{n}^*$ is non-intuitive for a human. Finally, the last column shows the result of prompting with the pair $(\mathbf{p}, \mathbf{n}^*)$ . In all cases, the synthesized image is at least as good as that on the first column, and usually better, e.g. a greener forest or a more realistic bird. + +Two aspects are worth noting. First, these examples purposefully use prompts $\mathbf{p}$ for which SD works well. This proves that the "DM knows what it's doing," at least to the point of generating a sensible image (first column). However, its notion of negative is totally different from that of humans, demonstrating the semantic gap between the two. The practical result is that a totally unintuitive negative prompt is needed to produce good images. Figure 3 shows that auto-DNP can improve the quality and correctness of the synthesised image even when the DM fails. Second, because all derivations above are functions of $z_{t}$ , the DNS procedure is valid for any seed $z_{T}$ . This is an additional advantage over the human-centric negative prompting of Figure 2a, whose success is seed-dependent. + +# 5 Related Work + +Text-to-Image Diffusion: High-resolution T2I generation has advanced dramatically with the introduction of large-scale diffusion models, due to: (1) availability of large-scale text-image datasets [2, 26], (2) advances in various training and inference techniques [9-11, 27], and, (3) development of scalable model architectures [19, 20, 22, 24]. The most popular T2I models employ classifier-free guidance [11] to balance prompt compliance and image diversity using a guidance scale hyper-parameter, $s$ . While prompt adherence improves by increasing + +$s$ , image quality deteriorates beyond a certain value. DNP helps ensure prompt adherence even for lower values of $s$ , thereby maintaining image quality. + +Structured Image Conditioning: Various image generation and editing improvements have been introduced since the advent of DMs. They range from finetuning the models for certain tasks to editing the noise at each iteration. Many methods require users to provide structured conditioned inputs like layouts [15, 18, 32], example images [13, 23, 29], and depth maps [31]. These can be hard to produce and require considerable user skill or additional computer vision modules. DNP allows us to control T2I with text alone while allowing it to be combined with most structured conditioning techniques as well. + +Attention-based Methods: These methods attempt to tackle DM errors by editing attention maps at each diffusion step, changing the cross-attention between prompt tokens. [3] updates the noise latent with a loss that maximizes attention to each noun, while [21] first creates a linguistic binding between prompt attributes and nouns and then maximizes (minimizes) attention IOUs for mapped (non-mapped) tokens. [7] uses text formatting such as font style, size, color, and footnotes to allow for creative human input and uses region-specific guidance to combine the noise corresponding to each token. These methods require careful fine-tuning of a loss guidance hyper-parameter and can heavily alter the DM Markov chain, which can create highly saturated and low-quality images. While the proposed method also forces the DM to use a different Markov chain, it does not interfere with its intermediate steps through any loss updates. + +Text based Methods: These methods try to explore and correct the semantic failures of the DM text encoder. [16] tries to decouple the text and combine noise latent later and [6] introduces consistency trees to split the prompt into noun phrases, for better cross-attention in the text-encoder. These methods fail to correct those errors which arise not from the text but from the DM itself. + +Negative Prompts: Negative prompts [16], are quite effective at removing unwanted concepts from the synthesized image and have been incorporated into most T2I models. However, finding a good negative prompt requires trial and error. Also, the effect of negative prompts varies significantly with prompt and seed. The proposed method, DNP provides a solution to this. + +# 6 Conclusion + +Do diffusion models truly understand negation? In this work, we have hypothesized that the semantic gap between DMs and humans is responsible for the poor performance of negative prompting. We proposed DNP as a simple yet effective method for bridging this gap. This consists of sampling a negative diffusion image $\bar{\mathcal{I}}$ , using a novel DNS procedure, and asking the user to translate it into a natural language negative prompt. This greatly improves the prompt adherence and quality of the generated images. DNP is universally applicable across diffusion models and can be combined with other methods. It highlights the difference between semantic and diffusion negation and leverages this difference to improve the performance of these models without additional training. + +# Acknowledgements + +This work was partially funded by NSF award IIS-2303153 a gift from Qualcomm, and NVIDIA GPU donations. We also acknowledge and thank the use of the Nautilus platform for the experiments discussed above. + +# References + +1. AUTOMATIC1111: Negative prompt: Stable diffusion webui, https://github.com/AUTOMATIC1111/stable-diffusion-webui/wiki/Negative-prompt +2. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022) +3. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models (2023) +4. Dawid, A.P., Stone, M., Zidek, J.V.: Marginalization paradoxes in bayesian and structural inference. Journal of the Royal Statistical Society Series B: Statistical Methodology 35(2), 189-213 (1973) +5. Du, Y., Li, S., Mordatch, I.: Compositional visual generation with energy based models. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 6637-6647. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/49856ed476ad01fcff881d57e161d73f-Paper.pdf +6. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis (2023) +7. Ge, S., Park, T., Zhu, J.Y., Huang, J.B.: Expressive text-to-image generation with rich text. In: IEEE International Conference on Computer Vision (ICCV) (2023) +8. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning (2022) +9. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020) +0. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022) +1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022) +2. Jiang, Y., Yang, S., Qiu, H., Wu, W., Loy, C.C., Liu, Z.: Text2human: Text-driven controllable human image generation (2022) +3. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023) +4. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models (2023) +5. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023) +6. Liu, N., Li, S., Du, Y., Torralba, A., Tenenbaum, J.B.: Compositional visual generation with composable diffusion models. In: European Conference on Computer Vision. pp. 423-439. Springer (2022) + +17. Lu, W., Xu, Y., Zhang, J., Wang, C., Tao, D.: Handrefiner: Refining malformed hands in generated images by diffusion-based conditional inpainting (2023) +18. Phung, Q., Ge, S., Huang, J.B.: Grounded text-to-image synthesis with attention refocusing. arXiv preprint arXiv:2306.05427 (2023) +19. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) +20. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021) +21. Rassin, R., Hirsch, E., Glickman, D., Ravfogel, S., Goldberg, Y., Chechik, G.: Linguistic binding in diffusion models: Enhancing attribute correspondence through attention map alignment (2023) +22. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) +23. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22500-22510 (June 2023) +24. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) +25. Salimans, T., Goodfellow, I., Zaremba, W., Cheung, V., Radford, A., Chen, X.: Improved techniques for training gans (2016) +26. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: Laion-5b: An open large-scale dataset for training next generation image-text models. In: Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., Oh, A. (eds.) Advances in Neural Information Processing Systems. vol. 35, pp. 25278-25294. Curran Associates, Inc. (2022), https://proceedings.neurips.cc/paper_files/paper/2022/file/a1859debfb3b59d094f3504d5ebbb6c25-Paper-Datasets_and_Benchmarks.pdf +27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) +28. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. Advances in neural information processing systems 32 (2019) +29. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: P+: Extended textual conditioning in text-to-image generation (2023) +30. Welling, M., Teh, Y.W.: Bayesian learning via stochastic gradient Langevin dynamics. In: Proceedings of the 28th international conference on machine learning (ICML-11). pp. 681-688 (2011) +31. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023) +32. Zheng, G., Zhou, X., Li, X., Qi, Z., Shan, Y., Li, X.: Layoutdiffusion: Controllable diffusion model for layout-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22490-22499 (2023) \ No newline at end of file diff --git a/2024/Improving image synthesis with diffusion-negative sampling/images.zip b/2024/Improving image synthesis with diffusion-negative sampling/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..4807e55e620be6202e2f8253aed066ce11f22fd2 --- /dev/null +++ b/2024/Improving image synthesis with diffusion-negative sampling/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d30b8542236d7dce2eef2b7d4bbb18d8ec5ccd406f2e9eda0e3b48846eb71ee1 +size 433543 diff --git a/2024/Improving image synthesis with diffusion-negative sampling/layout.json b/2024/Improving image synthesis with diffusion-negative sampling/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..8158a95595a6f4ec621140cdc6d5d88caa9d278d --- /dev/null +++ b/2024/Improving image synthesis with diffusion-negative sampling/layout.json @@ -0,0 +1,11961 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 111, + 481, + 148 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 217, + 167, + 397, + 180 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 217, + 167, + 397, + 180 + ], + "spans": [ + { + "bbox": [ + 217, + 167, + 397, + 180 + ], + "type": "text", + "content": "Alakh Desai1 and Nuno Vasconcelos1" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 223, + 190, + 389, + 212 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 223, + 190, + 389, + 212 + ], + "spans": [ + { + "bbox": [ + 223, + 190, + 389, + 212 + ], + "type": "text", + "content": "University of California San Diego, USA {ahdesai,nuno}@ucsd.edu" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "spans": [ + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "content": "Abstract. For image generation with diffusion models (DMs), a negative prompt " + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "content": " can be used to complement the text prompt " + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "content": ", helping define properties not desired in the synthesized image. While this improves prompt adherence and image quality, finding good negative prompts is challenging. We argue that this is due to a semantic gap between humans and DMs, which makes good negative prompts for DMs appear unintuitive to humans. To bridge this gap, we propose a new diffusion-negative prompting (DNP) strategy. DNP is based on a new procedure to sample images that are least compliant with " + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "content": " under the distribution of the DM, denoted as diffusion-negative sampling (DNS). Given " + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "content": ", one such image is sampled, which is then translated into natural language by the user or a captioning model, to produce the negative prompt " + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "content": ". The pair " + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "inline_equation", + "content": "(\\mathbf{p}, \\mathbf{n}^*)" + }, + { + "bbox": [ + 160, + 236, + 452, + 411 + ], + "type": "text", + "content": " is finally used to prompt the DM. DNS is straightforward to implement and requires no training. Experiments and human evaluations show that DNP performs well both quantitatively and qualitatively and can be easily combined with several DM variants." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 422, + 452, + 434 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 422, + 452, + 434 + ], + "spans": [ + { + "bbox": [ + 160, + 422, + 452, + 434 + ], + "type": "text", + "content": "Keywords: Image generation " + }, + { + "bbox": [ + 160, + 422, + 452, + 434 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 422, + 452, + 434 + ], + "type": "text", + "content": " Diffusion Models " + }, + { + "bbox": [ + 160, + 422, + 452, + 434 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 422, + 452, + 434 + ], + "type": "text", + "content": " Negative prompting" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 451, + 230, + 464 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 451, + 230, + 464 + ], + "spans": [ + { + "bbox": [ + 133, + 451, + 230, + 464 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 473, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 473, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 132, + 473, + 482, + 666 + ], + "type": "text", + "content": "Diffusion models (DMs) [19, 22, 24] have shown exquisite capacity to synthesize visually appealing images guided by textual prompts. However, they are not easy to control. While the synthesized images are usually impressive, various classes of prompts are known to be difficult, e.g. prompts involving humans [12], hands [17], or multiple objects and their interactions [3]. The synthesized image quality can often be unsatisfactory for such prompts, and prompt adherence is usually weak. This is illustrated in Figure 1, which shows an image synthesized by Stable Diffusion (SD) for a complex prompt " + }, + { + "bbox": [ + 132, + 473, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 473, + 482, + 666 + ], + "type": "text", + "content": ". The problem can be mitigated by adding alternative conditioning inputs to the diffusion model, such as visual conditioning with sketches or layouts [31, 32]. This, however, usually requires skilled users and can be labor-intensive. Ideally, it should be possible to improve consistency with text prompts alone. In this work, we explore negative prompting [16], which has been quite effective but is difficult to use. We argue that this difficulty stems from a semantic gap between the concept representations of a human user and the DM. We then introduce a new prompting technique, denoted as diffusion-negative prompting (DNP), to bridge this gap, as illustrated in Figure 1." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 114, + 480, + 210 + ], + "blocks": [ + { + "bbox": [ + 134, + 114, + 480, + 210 + ], + "lines": [ + { + "bbox": [ + 134, + 114, + 480, + 210 + ], + "spans": [ + { + "bbox": [ + 134, + 114, + 480, + 210 + ], + "type": "image", + "image_path": "eb12003f50b2369b6e7714e53cc19f97a4f3ee175bf64cd185f9bd31619eec3a.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "lines": [ + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "spans": [ + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "text", + "content": "Fig. 1: DNP improves quality of synthesis for prompts " + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "text", + "content": " (green) of SD's images (top-right). A diffusion-negative image, " + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "text", + "content": ", is sampled using DNS, enabling the user to visualize the negation of " + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "text", + "content": " under DM's distribution. The user translates the " + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "text", + "content": " into a negative prompt " + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "text", + "content": " (red), by a process denoted as DNP, and the DM is prompted with the pair " + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "inline_equation", + "content": "(\\mathbf{p},\\mathbf{n}^{*})" + }, + { + "bbox": [ + 130, + 220, + 482, + 288 + ], + "type": "text", + "content": ". This increases compliance and quality of the synthesized image (bottom-right). Replacing the user with a captioning model is denoted as auto-DNP." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": "Negative prompting complements the text prompt " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": ", e.g. \"an airplane standing on the runway\", with negative prompts " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": ", e.g. \"flying\" or \"soaring\". As illustrated in the top row of Figure 2a, this greatly improves compliance of the synthesized image with prompt " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": " and can improve image quality. However, negative prompts are difficult to use, for two reasons. First, there are many prompts, e.g. see " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{p} =" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": " \"a cat and a dog\" in Figure 2b, without a clear negative. Second, even when an intuitive negative exists, e.g. \"flying\" vs. \"standing\", it is not necessarily a successful negative for DMs across seeds, as seen in the bottom row of Figure 2a. This raises the question: what is a good negative prompt for a DM? In general, " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": " is a good negative prompt if the images synthesized by prompt-pair " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "(\\mathbf{p},\\mathbf{n})" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": " adhere more to " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": " than those synthesized by " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": " alone. This, however, is a DM-centric definition of negative prompt. The problem is that the semantic representation of the DM is only a weak approximation to that used by a human. In general, DMs cannot replicate the human definition of concept negation. We refer to this problem as the semantic gap between DMs and humans. As a result, good negative prompts for a DM are frequently not intuitive for humans, i.e. what a human would consider a negative for " + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 323, + 482, + 540 + ], + "type": "text", + "content": ". This makes it difficult for users to produce good negative prompts for DMs." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": "In this work, we address this problem by devising a strategy that enables humans to visualize the concepts that DMs consider negatives for prompt " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": ". This procedure is inspired by classifier-free guidance (CFG) [11]. While CFG uses a sampling guidance factor that increases the probability of images compliant with " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": ", we introduce a diffusion-negative sampling (DNS) guidance factor that encourages the sampling of the diffusion-negative images, " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": ", least compliant with " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": ", under the DM's image distribution. This " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": " usually does not comply with the human understanding of the negation of concepts in " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": ". However, because it represents the DM's understanding of this negation, it can be shown to the user to overcome the semantic gap between them. The user can then produce a negative" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 115, + 283, + 176 + ], + "blocks": [ + { + "bbox": [ + 135, + 115, + 283, + 176 + ], + "lines": [ + { + "bbox": [ + 135, + 115, + 283, + 176 + ], + "spans": [ + { + "bbox": [ + 135, + 115, + 283, + 176 + ], + "type": "image", + "image_path": "5f39133d84d974e588b6703746867eeca6915c1f4a100e15d1708afcfd944d50.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 150, + 178, + 251, + 183 + ], + "lines": [ + { + "bbox": [ + 150, + 178, + 251, + 183 + ], + "spans": [ + { + "bbox": [ + 150, + 178, + 251, + 183 + ], + "type": "text", + "content": "p: an airplane standing on the runway" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 135, + 186, + 283, + 237 + ], + "blocks": [ + { + "bbox": [ + 135, + 186, + 283, + 237 + ], + "lines": [ + { + "bbox": [ + 135, + 186, + 283, + 237 + ], + "spans": [ + { + "bbox": [ + 135, + 186, + 283, + 237 + ], + "type": "image", + "image_path": "3a6627481b5f8aec862e34d924bc939b6467b8c02a7f2d4c92fa109b004e254c.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 239, + 282, + 265 + ], + "lines": [ + { + "bbox": [ + 132, + 239, + 282, + 265 + ], + "spans": [ + { + "bbox": [ + 132, + 239, + 282, + 265 + ], + "type": "text", + "content": "(a) Semantic negatives: While effective, they do not guarantee compliance across seeds. Success (top), failure (bottom)." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 286, + 114, + 481, + 176 + ], + "blocks": [ + { + "bbox": [ + 286, + 114, + 481, + 176 + ], + "lines": [ + { + "bbox": [ + 286, + 114, + 481, + 176 + ], + "spans": [ + { + "bbox": [ + 286, + 114, + 481, + 176 + ], + "type": "image", + "image_path": "a6549f6fd4761c020f0ae4d4250259739a7231e90bc95e903806cb74a71dd010.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 286, + 178, + 481, + 239 + ], + "blocks": [ + { + "bbox": [ + 286, + 178, + 481, + 239 + ], + "lines": [ + { + "bbox": [ + 286, + 178, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 286, + 178, + 481, + 239 + ], + "type": "image", + "image_path": "b99f818cf8a4700d4865a365aab7eccd3a6fb04b8f1a3b68dcd17fdb1e1ddb5c.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 285, + 240, + 481, + 266 + ], + "lines": [ + { + "bbox": [ + 285, + 240, + 481, + 266 + ], + "spans": [ + { + "bbox": [ + 285, + 240, + 481, + 266 + ], + "type": "text", + "content": "(b) Non-semantic negatives: A good negative prompt needs multiple iterations for every seed as they can be highly unintuitive." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 132, + 275, + 480, + 298 + ], + "lines": [ + { + "bbox": [ + 132, + 275, + 480, + 298 + ], + "spans": [ + { + "bbox": [ + 132, + 275, + 480, + 298 + ], + "type": "text", + "content": "Fig. 2: Example of negative prompting for both semantic and non-semantic scenarios. The positive prompt, " + }, + { + "bbox": [ + 132, + 275, + 480, + 298 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 275, + 480, + 298 + ], + "type": "text", + "content": " and negative prompts, " + }, + { + "bbox": [ + 132, + 275, + 480, + 298 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 132, + 275, + 480, + 298 + ], + "type": "text", + "content": " are on top of each image." + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "spans": [ + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "text", + "content": "prompt " + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "text", + "content": " in the language of the DM by simply captioning " + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{L}}" + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "text", + "content": ". Prompting the DM with the pair " + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "inline_equation", + "content": "(\\mathbf{p},\\mathbf{n}^{*})" + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "text", + "content": " usually produces better images than with " + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 326, + 480, + 350 + ], + "type": "text", + "content": " alone." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "spans": [ + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": "Figure 1 shows how DNP can help when DMs produce poor-quality images. In response to the user prompt " + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "inline_equation", + "content": "\\mathbf{p} =" + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": " \"woman in black dress on the red carpet wearing a ring on the finger\", SD generates the top image, with distorted hands and rings. The rest of the figure illustrates DNP. Given the prompt " + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": ", the DM samples a negative image " + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}} (\\mathbf{p})" + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": " using DNS. In the figure, " + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": " contains the house with a garden. The user inspects the image and produces a diffusion-negative prompt " + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^{*}(\\bar{\\mathcal{I}}) =" + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": " \"a white home with a garage and grass in the front yard\" that reflects the content of this image. This is similar to captioning the image, and can also be done automatically by an image captioning model, resulting in what we denote as auto-DNP. Finally, the DM is prompted with the pair " + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "inline_equation", + "content": "(\\mathbf{p},\\mathbf{n}^{*})" + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": " to produce an image that has much better compliance with " + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 352, + 482, + 484 + ], + "type": "text", + "content": " than the original." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": "Our experiments show that DNP improves prompt adherence and image quality, both in terms of quantitative metrics, like CLIP scores of image-prompt similarity, and subjective ratings by human evaluators. This is shown to hold both for vanilla DMs, like SD, and DMs optimized for solving specific problems, e.g. the " + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": " [3] model tailored to synthesize images containing multiple objects. Various ablations also show that DNP outperforms negative prompting solutions commonly used by practitioners, e.g. using a dictionary of universal negative prompts, random prompts, etc. It also provides much-needed transparency to the negation process. auto-DNP provides a fully automated implementation of DNP. While not as effective as DNP, it maintains all the benefits discussed above, avoids user captioning effort, and allows automatic comparisons to other negative prompting procedures. Finally, our experiments consistently demonstrate the existence of a semantic gap between DMs and humans. Although the negative images generated by DNS are frequently very unintuitive for humans, they help the DM significantly when translated into negative prompts." + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 248 + ], + "type": "text", + "content": "Overall, this paper makes the following contributions. First, we hypothesize that DM image synthesis can be substantially enhanced by using negative prompts. However, these prompts are difficult for humans to generate, due to the semantic gap between humans and DMs, which leads to a different understanding of concept negation. Second, we introduce the DNS procedure to overcome this semantic gap, allowing humans to visualize the negative concept as understood by the DM. This enables negative prompting with DNP, as shown in Figure 1. Third, we present extensive experiments on various datasets, showing that DNP complements any existing DM or its variant. Fourth, we show that the process can be automated by using a pre-trained image captioner, leading to auto-DNP. Finally, we show that DNP is trivial to implement and requires no training." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 267, + 254, + 280 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 267, + 254, + 280 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 254, + 280 + ], + "type": "text", + "content": "2 Diffusion Models" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "spans": [ + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": "Latent Diffusion: DMs combine a forward and a backward process for generative modeling. In the forward process, a sample is gradually corrupted by sequential application of small amounts of Gaussian noise. The backward process then sequentially denoises the sample using a learned neural network " + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": ". Latent DMs (LDMs) increase the efficiency of the diffusion process by operating on the low dimensional latent space " + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "inline_equation", + "content": "\\mathcal{Z}" + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": " of an autoencoder, implemented with a pretrained encoder/decoder pair " + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "inline_equation", + "content": "(\\mathcal{E}(.)" + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "inline_equation", + "content": "\\mathcal{D}(.)" + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": "). This transforms image " + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "inline_equation", + "content": "x \\in \\mathcal{X}" + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": " into latent representation " + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "inline_equation", + "content": "z = \\mathcal{E}(x) \\in \\mathcal{Z}" + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": " and reconstructs the image with " + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "inline_equation", + "content": "x = \\mathcal{D}(\\mathcal{E}(z))" + }, + { + "bbox": [ + 130, + 294, + 482, + 390 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": "Training: In the forward process, a noisy version of the latent representation is obtained at each time step " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "z_{t} = \\sqrt{\\bar{\\alpha}_{t}} z + \\sqrt{1 - \\bar{\\alpha}_{t}}\\epsilon" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": ". Here, " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\bar{\\alpha}_t = \\prod_{s=1}^t (1 - \\beta_s)" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\{\\beta_1, \\dots, \\beta_T\\}" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": " is fixed according to the variance schedule and " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\epsilon \\sim \\mathcal{N}(0, I)" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": ". In the backward process, the denoising model " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": " estimates the noise " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\epsilon_t" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": " added to the noisy latent representation at each time step " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "t" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": ". The denoising is conditioned by the embedding " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\tau(\\mathbf{p})" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": ", of text prompt " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "inline_equation", + "content": "\\tau(.)" + }, + { + "bbox": [ + 130, + 390, + 482, + 475 + ], + "type": "text", + "content": " is a text encoder. The denoising network parameters are learned by minimizing the loss" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 206, + 484, + 480, + 504 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 206, + 484, + 480, + 504 + ], + "spans": [ + { + "bbox": [ + 206, + 484, + 480, + 504 + ], + "type": "interline_equation", + "content": "\\mathcal {L} = \\mathcal {E} _ {t \\sim \\mathcal {U} (1, T), \\epsilon_ {t} \\sim \\mathcal {N} (0, I)} \\left[ \\| \\epsilon_ {t} - \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right) \\| ^ {2} \\right], \\tag {1}", + "image_path": "1d5f1226ebf65587b248efd174a96fc3bee42201b9312de6c4853a3eee5acb5d.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 512, + 453, + 523 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 512, + 453, + 523 + ], + "spans": [ + { + "bbox": [ + 130, + 512, + 453, + 523 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 512, + 453, + 523 + ], + "type": "inline_equation", + "content": "\\mathcal{U}" + }, + { + "bbox": [ + 130, + 512, + 453, + 523 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 512, + 453, + 523 + ], + "type": "inline_equation", + "content": "\\mathcal{N}" + }, + { + "bbox": [ + 130, + 512, + 453, + 523 + ], + "type": "text", + "content": " are the uniform and Gaussian distributions, respectively." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 524, + 480, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 524, + 480, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 524, + 480, + 548 + ], + "type": "text", + "content": "Inference: Given prompt " + }, + { + "bbox": [ + 130, + 524, + 480, + 548 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 524, + 480, + 548 + ], + "type": "text", + "content": ", images are sampled by iteratively alternating between denoising and sampling, with" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 210, + 559, + 480, + 572 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 210, + 559, + 480, + 572 + ], + "spans": [ + { + "bbox": [ + 210, + 559, + 480, + 572 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} _ {p} = \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right), \\quad z _ {t - 1} = \\text {s a m p l e} \\left(z _ {t}, \\hat {\\epsilon} _ {p}, t\\right). \\tag {2}", + "image_path": "285b3c823a51645a8949082e58eb5495a0bf9c6fdb70870c585cad62f13cfafa.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "text", + "content": "The sampling method, sample, varies with the DM. Popular approaches are DDPM [9] and DDIM [27]. This process is initialized with a noise seed " + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "inline_equation", + "content": "z_{T} \\sim \\mathcal{N}(0,I)" + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "text", + "content": " and produces a latent image code " + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "inline_equation", + "content": "z_{0}" + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "text", + "content": ", which is finally passed to the decoder to obtain image " + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "inline_equation", + "content": "x_{0} = \\mathcal{D}(z_{0})" + }, + { + "bbox": [ + 130, + 581, + 482, + 629 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "Classifier-free Guidance: CFG [11] is a method to trade off prompt compliance and image diversity. It consists of training the DM with and without prompt " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": ", randomly setting " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": " to the empty prompt " + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\phi = \"" + }, + { + "bbox": [ + 130, + 629, + 482, + 666 + ], + "type": "text", + "content": "\", with probability" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "P_{\\text{uncond}} = 0.1" + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "content": ". At inference, each denoising step uses a linear combination of the prompt-conditional " + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "(\\hat{\\epsilon}_p)" + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "content": " and unconditional " + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "(\\hat{\\epsilon}_{\\phi})" + }, + { + "bbox": [ + 132, + 116, + 479, + 140 + ], + "type": "text", + "content": " noise estimates" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 264, + 150, + 480, + 162 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 264, + 150, + 480, + 162 + ], + "spans": [ + { + "bbox": [ + 264, + 150, + 480, + 162 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {\\phi}), \\tag {3}", + "image_path": "5206a210dae8168f20eb7484ae2f5d9ba9e182a56de59594aa280fac84a8a23c.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "spans": [ + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\hat{\\epsilon}_p = \\epsilon_\\theta (z_t;t,\\tau (\\mathbf{p}))" + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\hat{\\epsilon}_{\\phi} = \\epsilon_{\\theta}(z_{t};t,\\tau (\\phi))" + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "text", + "content": " is an hyper-parameter that controls the conditioning strength, known as the guidance-scale. The modified noise " + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "inline_equation", + "content": "\\hat{\\epsilon}" + }, + { + "bbox": [ + 130, + 171, + 479, + 206 + ], + "type": "text", + "content": " is then utilized to update the latent representation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "spans": [ + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "text", + "content": "Negative Prompting: Despite conditioning on text prompt " + }, + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "text", + "content": ", prompt adherence of CFG can be weak when " + }, + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "text", + "content": " refers to complex scenes, such as that in Figure 1. Negative prompting [16] is useful as an extra conditioning input. Given negative prompt " + }, + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 131, + 207, + 480, + 255 + ], + "type": "text", + "content": ", the inference denoising steps are implemented with" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 266, + 265, + 480, + 277 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 266, + 265, + 480, + 277 + ], + "spans": [ + { + "bbox": [ + 266, + 265, + 480, + 277 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n}) \\tag {4}", + "image_path": "44b19d951b73b941fa6e2e4338a0ca5339c84b6cd408d4c379d1648919d2af54.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 285, + 160, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 285, + 160, + 295 + ], + "spans": [ + { + "bbox": [ + 132, + 285, + 160, + 295 + ], + "type": "text", + "content": "where" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 266, + 297, + 480, + 309 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 266, + 297, + 480, + 309 + ], + "spans": [ + { + "bbox": [ + 266, + 297, + 480, + 309 + ], + "type": "interline_equation", + "content": "\\hat {c} _ {n} = \\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {n})\\right). \\tag {5}", + "image_path": "b5ce13756c03a03c78fff227f4940071d8e2a4886494aeb1adf89f84dc409564.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "text", + "content": "Practitioners have shown that simply replacing the empty prompt " + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "text", + "content": " of CFG with the negative prompt " + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "text", + "content": ", i.e. using " + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "inline_equation", + "content": "\\hat{\\epsilon} = \\hat{\\epsilon}_n + s(\\hat{\\epsilon}_p - \\hat{\\epsilon}_n)" + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "text", + "content": ", yields similar results, albeit for a slightly different guidance scale " + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "text", + "content": " [1]. This has the benefit of computational efficiency, as it only requires the calculation of two noise vectors instead of three. Hence, this method has gained popularity and has become the default implementation of negative prompting in many T2I generation models. However, in what follows, we use the theoretically more grounded (4) to derive a procedure to sample diffusion-negative images " + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "inline_equation", + "content": "(\\bar{\\mathcal{I}})" + }, + { + "bbox": [ + 130, + 314, + 480, + 410 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 428, + 354, + 442 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 428, + 354, + 442 + ], + "spans": [ + { + "bbox": [ + 132, + 428, + 354, + 442 + ], + "type": "text", + "content": "3 Creating Good Negative Prompts" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 453, + 279, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 453, + 279, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 453, + 279, + 464 + ], + "type": "text", + "content": "In this section, we introduce DNP." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 482, + 336, + 495 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 482, + 336, + 495 + ], + "spans": [ + { + "bbox": [ + 132, + 482, + 336, + 495 + ], + "type": "text", + "content": "3.1 Energy-based model interpretation" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "text", + "content": "Sampling with a DM of network " + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "inline_equation", + "content": "\\epsilon_{\\theta}(z_t; t, \\tau(\\mathbf{p}))" + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "text", + "content": " can be interpreted as sampling from probability distribution " + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t | \\mathbf{p}) \\propto e^{-E_{\\theta}(z_t; t, \\tau(\\mathbf{p}))}" + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "inline_equation", + "content": "E_{\\theta}" + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "text", + "content": " is an energy function, using the score function " + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "inline_equation", + "content": "\\nabla_z \\log P(z | \\mathbf{p})" + }, + { + "bbox": [ + 130, + 501, + 479, + 548 + ], + "type": "text", + "content": " and Longevin dynamics [28,30]. The DM network is trained to learn the score function, i.e." + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 227, + 559, + 480, + 571 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 227, + 559, + 480, + 571 + ], + "spans": [ + { + "bbox": [ + 227, + 559, + 480, + 571 + ], + "type": "interline_equation", + "content": "\\epsilon_ {\\theta} \\left(z _ {t}; t, \\tau (\\mathbf {p})\\right) = - \\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} \\mid \\tau (\\mathbf {p})\\right). \\tag {6}", + "image_path": "24f5ca11e599d2dfa165895a2abdde2469698649a909cdaa20193ea8926c1515.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 131, + 579, + 479, + 602 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 579, + 479, + 602 + ], + "spans": [ + { + "bbox": [ + 131, + 579, + 479, + 602 + ], + "type": "text", + "content": "This motivates the CFG denoising step of (3), which corresponds to sampling from the distribution" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 244, + 613, + 480, + 625 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 613, + 480, + 625 + ], + "spans": [ + { + "bbox": [ + 244, + 613, + 480, + 625 + ], + "type": "interline_equation", + "content": "p _ {c f g} \\left(z _ {t}, \\mathbf {p}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {c f g} ^ {s} \\left(z _ {t}, \\mathbf {p}\\right) \\tag {7}", + "image_path": "b1f640928d6733a8b4cdf36a5a6c2340319b771ec62a4e5e26b828aebf7870cd.jpg" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 634, + 160, + 644 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 634, + 160, + 644 + ], + "spans": [ + { + "bbox": [ + 132, + 634, + 160, + 644 + ], + "type": "text", + "content": "where" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 235, + 643, + 479, + 667 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 643, + 479, + 667 + ], + "spans": [ + { + "bbox": [ + 235, + 643, + 479, + 667 + ], + "type": "interline_equation", + "content": "\\gamma_ {c f g} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)}{p _ {\\theta} \\left(z _ {t}\\right)} \\propto p _ {\\theta} (\\mathbf {p} \\mid z _ {t}) \\tag {8}", + "image_path": "d999fb21c3e931d9fcbd7b9a5b3f287ac229af513c6270dad377ef555249eebc.jpg" + } + ] + } + ], + "index": 18 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "content": "is a guidance factor that increases the probability of codes " + }, + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "content": " corresponding to images compliant with prompt " + }, + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 116, + 480, + 152 + ], + "type": "text", + "content": ". Similarly, the negative prompt denoising step of (4) corresponds to sampling from" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 235, + 163, + 481, + 177 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 163, + 481, + 177 + ], + "spans": [ + { + "bbox": [ + 235, + 163, + 481, + 177 + ], + "type": "interline_equation", + "content": "p _ {n p} \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {n p} ^ {s} \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) \\tag {9}", + "image_path": "67ec30b663b039a119d5083c60fdae609ddefbc6568aca1e231a7ee7d1f793e4.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 186, + 225, + 198 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 186, + 225, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 186, + 225, + 198 + ], + "type": "text", + "content": "with guidance factor" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 228, + 208, + 481, + 235 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 208, + 481, + 235 + ], + "spans": [ + { + "bbox": [ + 228, + 208, + 481, + 235 + ], + "type": "interline_equation", + "content": "\\gamma_ {n p} (z _ {t}, \\mathbf {p}, \\mathbf {n}) = \\frac {p _ {\\theta} (z _ {t} | \\mathbf {p})}{p _ {\\theta} (z _ {t} | \\mathbf {n})} \\propto \\frac {p _ {\\theta} (\\mathbf {p} | z _ {t})}{p _ {\\theta} (\\mathbf {n} | z _ {t})}. \\tag {10}", + "image_path": "52efeb76a0bc43080310cedb6ce17a0920638934266bff9833f1fb701df693c9.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 242, + 468, + 255 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 242, + 468, + 255 + ], + "spans": [ + { + "bbox": [ + 132, + 242, + 468, + 255 + ], + "type": "text", + "content": "This increases the probability of sampling latent codes " + }, + { + "bbox": [ + 132, + 242, + 468, + 255 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 132, + 242, + 468, + 255 + ], + "type": "text", + "content": " of large odds ratio" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 258, + 265, + 481, + 291 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 258, + 265, + 481, + 291 + ], + "spans": [ + { + "bbox": [ + 258, + 265, + 481, + 291 + ], + "type": "interline_equation", + "content": "o \\left(z _ {t}, \\mathbf {p}, \\mathbf {n}\\right) = \\frac {p _ {\\theta} (\\mathbf {p} \\mid z _ {t})}{p _ {\\theta} (\\mathbf {n} \\mid z _ {t})}. \\tag {11}", + "image_path": "e6b28fb519e89126d4860f4a92a7d5e13c49a4ead93d85e5d41d75e0e0cf56d2.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "spans": [ + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": "Since the Bayes decision rule for deciding between " + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": " is to choose " + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": " when " + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "inline_equation", + "content": "o(z_{t},\\mathbf{p},\\mathbf{n})\\geq 1" + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": " otherwise, it increases the probability that sampled codes comply with prompt " + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": " and not with prompt " + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 131, + 299, + 481, + 335 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 354, + 338, + 369 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 338, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 338, + 369 + ], + "type": "text", + "content": "3.2 Limitations of Negative Prompting" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "spans": [ + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "text", + "content": "Besides being theoretically well-motivated, negative prompting frequently improves image quality, as illustrated in the top row of Figure 2a. However, negative prompts are difficult to specify, because a natural negative frequently does not exist or does not produce the intended results. Figure 2b shows an example for prompt " + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathbf{p} =" + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "text", + "content": " \"a cat and a dog\". Here, the user may need to attempt several negative prompts " + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "text", + "content": ", requiring multiple iterations of image synthesis, as illustrated in the figure. Eventually, the user notices the insistence of the DM in brown objects and uses " + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathbf{n} =" + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "text", + "content": " \"brown\". This is complemented with \"ugly\", which practitioners have identified as a good general-use negative prompt. To compound the problem, a negative prompt successful for one random seed can be unsuccessful for another seed, i.e. good negative prompts depend on both prompt " + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "text", + "content": " and seed " + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "inline_equation", + "content": "z_{T}" + }, + { + "bbox": [ + 130, + 377, + 482, + 533 + ], + "type": "text", + "content": ", as illustrated in Figure 2a. In summary, negative prompting is an art form and can be quite cumbersome, even when successful." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": "In practice, the human-provided negative prompt frequently fails to improve the quality of the image generated by the DM. We hypothesize that this is because the semantic representation of the DM is only a weak approximation to that of humans. Hence, there is no guarantee that, under the probability distribution modeled by the DM, there will be a large classification margin between " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": " and the human-provided " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": ". In this case, negative prompting fails to produce samples of large odds ratio " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "o(z_{t},\\mathbf{p},\\mathbf{n})" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": " and the prompt pair " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "(\\mathbf{p},\\mathbf{n})" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": " fails to induce the model to produce more prompt compliant images than those generated with CFG, i.e. the posterior probability " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_{\\theta}(\\mathbf{p}|z_t)" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": " of (8). In the extreme case where " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_{\\theta}(\\mathbf{p}|z_t)\\approx p_{\\theta}(\\mathbf{n}|z_t)" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": " for the samples of high " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "p_{\\theta}(\\mathbf{p}|z_t)" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "o(z_{t},\\mathbf{p},\\mathbf{n})\\approx 1" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": " for those samples and (9) looses all sensitivity to prompt " + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 534, + 482, + 666 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 305, + 128 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 305, + 128 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 305, + 128 + ], + "type": "text", + "content": "3.3 Diffusion-Negative Guidance" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "spans": [ + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "text", + "content": "The discussion above suggests that a good negative prompt for the DM \"grounds\" the odds-ratio of (11), providing a reference for the prompt " + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "text", + "content": ", which is defined in terms of the margin to negative " + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "text", + "content": ". However, this grounding must happen under the internal representation of the DM, which is not necessarily that of humans. The goal is to encourage samples more likely to comply with given prompt " + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "text", + "content": " than the negative prompt, under the conceptual representation of the model. We formalize this goal by defining the optimal negative prompt " + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "text", + "content": " for the DM as the one that maximizes the steepness of the odds ratio with " + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 134, + 482, + 231 + ], + "type": "text", + "content": ", i.e." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 231, + 238, + 481, + 255 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 231, + 238, + 481, + 255 + ], + "spans": [ + { + "bbox": [ + 231, + 238, + 481, + 255 + ], + "type": "interline_equation", + "content": "\\mathbf {n} ^ {*} (\\mathbf {p}) = \\arg \\max _ {\\mathbf {n}} \\nabla_ {z _ {t}} \\log o (z _ {t}, \\mathbf {p}, \\mathbf {n}). \\tag {12}", + "image_path": "43c5f628ed38332eb1b3a3b3f0119f7af820c241738194c463f3fea1f751f9ce.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 260, + 480, + 273 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 260, + 480, + 273 + ], + "spans": [ + { + "bbox": [ + 132, + 260, + 480, + 273 + ], + "type": "text", + "content": "This is denoted as the diffusion-negative prompt for " + }, + { + "bbox": [ + 132, + 260, + 480, + 273 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 260, + 480, + 273 + ], + "type": "text", + "content": ". Using (2), (5), and (11)," + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 156, + 289, + 481, + 315 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 156, + 289, + 481, + 315 + ], + "spans": [ + { + "bbox": [ + 156, + 289, + 481, + 315 + ], + "type": "interline_equation", + "content": "\\nabla_ {z _ {t}} \\log o (z _ {t}, \\mathbf {p}, \\mathbf {n}) = \\nabla_ {z _ {t}} \\log \\frac {p _ {\\theta} (\\mathbf {p} | z _ {t})}{p _ {\\theta} (\\mathbf {n} | z _ {t})} = \\nabla_ {z _ {t}} \\log \\frac {p _ {\\theta} (z _ {t} | \\mathbf {p})}{p _ {\\theta} (z _ {t} | \\mathbf {n})} = \\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n}. \\tag {13}", + "image_path": "ebfe47759bd28a24ceb95cc3eaa7a6299e0d1819d71316dd6f496b0aa6fc9de4.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 319, + 481, + 345 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 319, + 481, + 345 + ], + "spans": [ + { + "bbox": [ + 131, + 319, + 481, + 345 + ], + "type": "text", + "content": "Hence, for a given " + }, + { + "bbox": [ + 131, + 319, + 481, + 345 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 131, + 319, + 481, + 345 + ], + "type": "text", + "content": ", a natural alternative definition of the diffusion-negative prompt is that which induces the noise vector maximally distant from " + }, + { + "bbox": [ + 131, + 319, + 481, + 345 + ], + "type": "inline_equation", + "content": "\\hat{\\epsilon}_{p}" + }, + { + "bbox": [ + 131, + 319, + 481, + 345 + ], + "type": "text", + "content": ", i.e." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 249, + 351, + 481, + 374 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 249, + 351, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 249, + 351, + 481, + 374 + ], + "type": "interline_equation", + "content": "\\epsilon_ {n ^ {*}} = \\underset {n \\mid \\| \\hat {\\epsilon} _ {n} \\| ^ {2} = K} {\\arg \\max } \\left\\| \\hat {\\epsilon} _ {p} - \\hat {\\epsilon} _ {n} \\right\\| ^ {2} \\tag {14}", + "image_path": "59575ed0b031de9f7d61647d1a3e5fce34f74d6854700ecb6811374961ea52ac.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "spans": [ + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "inline_equation", + "content": "K" + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "text", + "content": " prevents the noise magnitude from becoming infinitely large. This is the prompt that induces the steeper log odds surface at " + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "text", + "content": ", encouraging the largest margin between the probabilities " + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t|\\mathbf{p})" + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t|\\mathbf{n}^*)" + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "text", + "content": " in the neighborhood of " + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 131, + 380, + 482, + 429 + ], + "type": "text", + "content": ". In Supplementary Section 1, we show that (14) has a solution" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 254, + 436, + 481, + 460 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 254, + 436, + 481, + 460 + ], + "spans": [ + { + "bbox": [ + 254, + 436, + 481, + 460 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} _ {n ^ {*}} = - \\sqrt {K} \\frac {\\hat {\\epsilon} _ {p}}{\\| \\hat {\\epsilon} _ {p} \\|} \\propto - \\hat {\\epsilon} _ {p}. \\tag {15}", + "image_path": "4678ecc52524ceb56725f82aad51b7038c0695677907afcfc4990b2fb28baa82.jpg" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 468, + 481, + 495 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 468, + 481, + 495 + ], + "spans": [ + { + "bbox": [ + 131, + 468, + 481, + 495 + ], + "type": "text", + "content": "Choosing " + }, + { + "bbox": [ + 131, + 468, + 481, + 495 + ], + "type": "inline_equation", + "content": "K = \\| \\hat{\\epsilon}_p\\|^2" + }, + { + "bbox": [ + 131, + 468, + 481, + 495 + ], + "type": "text", + "content": ", i.e. equal noise strength under the positive and negative conditions, results in " + }, + { + "bbox": [ + 131, + 468, + 481, + 495 + ], + "type": "inline_equation", + "content": "\\hat{\\epsilon}_{n^*} = -\\hat{\\epsilon}_p" + }, + { + "bbox": [ + 131, + 468, + 481, + 495 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 509, + 332, + 521 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 332, + 521 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 332, + 521 + ], + "type": "text", + "content": "3.4 Diffusion-Negative Sampling (DNS)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 526, + 237, + 539 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 526, + 237, + 539 + ], + "spans": [ + { + "bbox": [ + 132, + 526, + 237, + 539 + ], + "type": "text", + "content": "It follows from (6) that" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 159, + 546, + 481, + 571 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 546, + 481, + 571 + ], + "spans": [ + { + "bbox": [ + 159, + 546, + 481, + 571 + ], + "type": "interline_equation", + "content": "\\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} | \\mathbf {n} ^ {*}\\right) = - \\nabla_ {z _ {t}} \\log p _ {\\theta} \\left(z _ {t} | \\mathbf {p}\\right) \\Longrightarrow p _ {\\theta} \\left(z _ {t} | \\mathbf {n} ^ {*}\\right) \\propto \\frac {1}{p _ {\\theta} \\left(z _ {t} | \\mathbf {p}\\right)}. \\tag {16}", + "image_path": "611899f212882af0b32782cb1670fa7992d331825b6265920c78b92b169cbc25.jpg" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 576, + 482, + 637 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 576, + 482, + 637 + ], + "spans": [ + { + "bbox": [ + 130, + 576, + 482, + 637 + ], + "type": "text", + "content": "However, for most " + }, + { + "bbox": [ + 130, + 576, + 482, + 637 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t|\\mathbf{n})" + }, + { + "bbox": [ + 130, + 576, + 482, + 637 + ], + "type": "text", + "content": ", (16) is an improper distribution [4]. This stems from the fact that a negative condition must be specified in context [5]. A general contextual constraint for DM-based sampling is that the negatively conditioned DM should still sample images from the image distribution " + }, + { + "bbox": [ + 130, + 576, + 482, + 637 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t)" + }, + { + "bbox": [ + 130, + 576, + 482, + 637 + ], + "type": "text", + "content": ". To account for this, we define the diffusion-negative guidance factor as" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 235, + 643, + 481, + 669 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 235, + 643, + 481, + 669 + ], + "spans": [ + { + "bbox": [ + 235, + 643, + 481, + 669 + ], + "type": "interline_equation", + "content": "\\gamma_ {d n} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t}\\right)}{p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)} \\propto \\frac {1}{p _ {\\theta} \\left(\\mathbf {p} \\mid z _ {t}\\right)}, \\tag {17}", + "image_path": "fbcf6f61d5671d76d523ba668f339d8adec0e61420faa45c0a6e7532d9fbae7c.jpg" + } + ] + } + ], + "index": 16 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 448, + 103 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 350, + 129 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 350, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 350, + 129 + ], + "type": "text", + "content": "which leads to the diffusion-negative distribution" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 241, + 140, + 481, + 152 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 241, + 140, + 481, + 152 + ], + "spans": [ + { + "bbox": [ + 241, + 140, + 481, + 152 + ], + "type": "interline_equation", + "content": "p _ {d n} \\left(z _ {t}, \\mathbf {p}\\right) \\propto p _ {\\theta} \\left(z _ {t}\\right) \\gamma_ {d n} ^ {s} \\left(z _ {t}, \\mathbf {p}\\right) \\tag {18}", + "image_path": "fc43087c5a65db56dae5695a91d87e51853a10da8775d628d7f15ab92fac69f8.jpg" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 162, + 279, + 174 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 162, + 279, + 174 + ], + "spans": [ + { + "bbox": [ + 132, + 162, + 279, + 174 + ], + "type": "text", + "content": "and inference denoising equation" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 264, + 185, + 481, + 198 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 264, + 185, + 481, + 198 + ], + "spans": [ + { + "bbox": [ + 264, + 185, + 481, + 198 + ], + "type": "interline_equation", + "content": "\\hat {\\epsilon} = \\hat {\\epsilon} _ {\\phi} + s (\\hat {\\epsilon} _ {\\phi} - \\hat {\\epsilon} _ {p}). \\tag {19}", + "image_path": "5e4ca3236e32639223027b9be58b6d8fc0df55fb95775d95ae1e92973c0a2aab.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": "Sampling with this equation is denoted as diffusion-negative sampling (DNS). When compared to (10), the diffusion-negative guidance factor of (17) has two main differences. First, it does not require the semantic negative prompt " + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "inline_equation", + "content": "\\mathbf{n}" + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": ", reflecting the fact that the definition of negative is fully based on the internal representation of the DM. Second, it replaces the odds ratio of (11) by the ratio between the image distribution " + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t)" + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": " and the image distribution under the positive condition " + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": ". This emphasizes sampling images from the DM probability distribution with the lowest prompt conditional probability " + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t|\\mathbf{p})" + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": ". When compared to the guidance factor (8) of CFG, (17) simply flips the role of the image distributions " + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t)" + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "inline_equation", + "content": "p_{\\theta}(z_t|\\mathbf{p})" + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": ". This provides a simple interpretation of diffusion-negative guidance as the \"opposite\" of CFG. Rather than sampling natural images that align best with the condition " + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 207, + 482, + 363 + ], + "type": "text", + "content": ", it emphasizes sampling natural images that least comply with it." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 146, + 363, + 406, + 376 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 363, + 406, + 376 + ], + "spans": [ + { + "bbox": [ + 146, + 363, + 406, + 376 + ], + "type": "text", + "content": "The relation between the guidance factors of (17) and (10)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 228, + 387, + 481, + 412 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 228, + 387, + 481, + 412 + ], + "spans": [ + { + "bbox": [ + 228, + 387, + 481, + 412 + ], + "type": "interline_equation", + "content": "\\gamma_ {d n} \\left(z _ {t}, \\mathbf {p}\\right) = \\frac {p _ {\\theta} \\left(z _ {t}\\right)}{p _ {\\theta} \\left(z _ {t} \\mid \\mathbf {p}\\right)} = \\gamma_ {n p} \\left(z _ {t}, \\phi , \\mathbf {p}\\right) \\tag {20}", + "image_path": "8951a6080304a4c8cd56a27694c6eccb155d80e96f982ca31d379fdb42dc81a0.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "text", + "content": "makes the implementation of DNS trivial for any model that supports negative prompting. It suffices to prompt the latter with empty positive prompt " + }, + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\phi" + }, + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "text", + "content": " and negative prompt " + }, + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "text", + "content": ". Hence, DNS requires no retraining of the " + }, + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "inline_equation", + "content": "DM" + }, + { + "bbox": [ + 132, + 420, + 482, + 468 + ], + "type": "text", + "content": ", nor any optimizations at inference." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 487, + 340, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 340, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 340, + 502 + ], + "type": "text", + "content": "3.5 Diffusion-Negative Prompting (DNP)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "text", + "content": "DNP relies on DNS to implement the procedure of Figure 1. Given prompt " + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "text", + "content": ", DNS is used to sample a diffusion-negative image, " + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "text", + "content": ", as discussed above. This image is then captioned by the user, to produce the DNP " + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "text", + "content": ". The DM is finally prompted with the prompt pair " + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "inline_equation", + "content": "(\\mathbf{p}, \\mathbf{n}^*)" + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "text", + "content": " to produce the final image. As illustrated in Figure 1, the captioning step can be performed by either the user or any captioning model. In the latter case, the process is denoted auto-DNP. auto-DNP has the advantage of fully automating DNP, making the entire process transparent to the user and reducing user effort. The price is a small increase in the failure rate due to captioning errors. In this paper, we use BLIP2 [14] as the captioning model to implement auto-DNP. However, auto-DNP can be used with any other captioner. We show results obtained with GPTv4 (gpt-4-vision-preview) in Supplementary Section 4. Figure 3 and the final column of Figure 4 illustrate how DNP produces images that either have higher quality or comply better with the prompt " + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 132, + 510, + 482, + 668 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 284, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 284, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 284, + 101 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 230, + 129 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 139, + 406, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 139, + 406, + 152 + ], + "spans": [ + { + "bbox": [ + 132, + 139, + 406, + 152 + ], + "type": "text", + "content": "In this section, we discuss the experimental evaluation of DNP." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 167, + 204, + 179 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 167, + 204, + 179 + ], + "spans": [ + { + "bbox": [ + 132, + 167, + 204, + 179 + ], + "type": "text", + "content": "4.1 Datasets" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 186, + 447, + 198 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 186, + 447, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 186, + 447, + 198 + ], + "type": "text", + "content": "For a comprehensive dataset description see Supplementary Section 2.2" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 199, + 481, + 306 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 199, + 481, + 306 + ], + "spans": [ + { + "bbox": [ + 132, + 199, + 481, + 306 + ], + "type": "text", + "content": "Existence and Attribute Binding (A&E) Dataset: This is the benchmark dataset introduced by [3]. This dataset is focused on entity neglect, which occurs when one or more entities are completely ignored by the generative model, and attribute assignment, which evaluates whether an attribute is associated with the correct object in the image. To evaluate these, each prompt in the dataset comprises two entities and their associated attributes. There are three categories of prompts: (1) \"an animal and an animal\"; (2) \"a color in-animate object and an animal\"; (3) \"a color in-animate object and a color in-animate object\". We sample 50 prompts from each category for 32 random seeds." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 307, + 481, + 403 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 307, + 481, + 403 + ], + "spans": [ + { + "bbox": [ + 132, + 307, + 481, + 403 + ], + "type": "text", + "content": "Human and Hand Generation (H&H) Dataset: Humans and hands occur in various shapes and forms, including gender, race, activity, and individual differences. Despite the size of the training datasets, this variation has posed a major challenge to DMs, which are known to synthesize images with extra or merged limbs and fingers. We curated a challenging benchmark dataset to test the effect of DNP on human and hand generation. The dataset consists of 45 human-based prompts such as \"a man wearing a sombrero\" and 25 hand-based prompts such as \"hand with a ring on it\". We run all prompts for 32 seeds." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 418, + 257, + 431 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 418, + 257, + 431 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 257, + 431 + ], + "type": "text", + "content": "4.2 Evaluation Metrics" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 437, + 481, + 570 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 437, + 481, + 570 + ], + "spans": [ + { + "bbox": [ + 132, + 437, + 481, + 570 + ], + "type": "text", + "content": "Text-Image CLIP Score: [8] is a widely used metric of the similarity between a generated image and its text prompt. For the H&H dataset, we calculate the CLIP Score between each generated image and its corresponding prompt. For the A&E dataset, we follow the evaluation protocols established by [3], which measure CLIP Score at full prompt and entity level. For evaluating the Full Prompt CLIP Score, we calculate the score between the generated image and the full prompt. For the Minimum Object CLIP Score, we take the minimum score between the entities in the prompt, as the entity with the minimum CLIP Score represents the neglected entity for the given prompt. This allows us to measure the CLIP Score at two levels, thereby providing better insight into the presence of both entities in the A&E dataset prompts." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 570, + 481, + 617 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 570, + 481, + 617 + ], + "spans": [ + { + "bbox": [ + 132, + 570, + 481, + 617 + ], + "type": "text", + "content": "Inception Score (IS): [25] is a popular metric for assessing the quality and realism of images. It is the exponential of the average of the entropy of the label distribution predicted by the Inception v3 classifier model. In particular, we choose IS over FID as it does not require a dataset with real images." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 617, + 481, + 665 + ], + "type": "text", + "content": "Human Evaluation: While CLIP Score and IS provide an objective measure of correctness and quality, they are known for not being fully aligned with human aesthetics and preferences. To evaluate DNP in terms of human preferences, we used Amazon Mechanical Turk (AMT) to evaluate a subset of each dataset. We" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 103 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 187, + 114, + 430, + 167 + ], + "blocks": [ + { + "bbox": [ + 187, + 114, + 430, + 167 + ], + "lines": [ + { + "bbox": [ + 187, + 114, + 430, + 167 + ], + "spans": [ + { + "bbox": [ + 187, + 114, + 430, + 167 + ], + "type": "table", + "html": "
MethodCLIP Score
HumanHandA&E
Min. ObjectFull Prompt
SD+auto-DNP0.3300.3230.2500.344
SD+DP0.3310.3240.2530.345
", + "image_path": "33c300141bcf85d9c9596096fbc161a9a015802a1b276440002aa447c9ee6258.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "bbox": [ + 186, + 168, + 427, + 177 + ], + "lines": [ + { + "bbox": [ + 186, + 168, + 427, + 177 + ], + "spans": [ + { + "bbox": [ + 186, + 168, + 427, + 177 + ], + "type": "text", + "content": "Table 1: Benchmarking DNP to auto-DNP with CLIP Score." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 212, + 482, + 296 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 212, + 482, + 296 + ], + "spans": [ + { + "bbox": [ + 130, + 212, + 482, + 296 + ], + "type": "text", + "content": "performed human evaluation on 100 prompt-seed pairs for the human dataset, 100 pairs for the Hands dataset, and 150 (50 per category) pairs for the A&E dataset. The evaluators were asked to compare the images using two criteria. 1) Adherence to the prompt, and 2) Quality (natural or realistic nature) of the image. MTurkers were tasked with choosing one image based the two criteria. They could also choose no clear winner if they did not prefer one over the other. More details can be found in the Supplementary Section 2.3." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 314, + 313, + 326 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 314, + 313, + 326 + ], + "spans": [ + { + "bbox": [ + 131, + 314, + 313, + 326 + ], + "type": "text", + "content": "4.3 Benchmarking DNP vs auto-DNP" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 334, + 482, + 465 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 334, + 482, + 465 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 482, + 465 + ], + "type": "text", + "content": "The evaluation of DNP requires human users. PhD students, with no experience in visual language research, were shown an image and asked to produce a caption shorter than 60 words. Due to the prohibitive resources required to caption the image " + }, + { + "bbox": [ + 130, + 334, + 482, + 465 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 334, + 482, + 465 + ], + "type": "text", + "content": " for all prompt-seed pairs of all the datasets, we restricted the evaluation of DNP to the prompt-seed pairs used for human evaluation. We compared the performance of DNP and auto-DNP on this set and used auto-DNP in the remaining experiments. Besides being cost-effective, this enables the replication of our experiments for comparison to other negative prompting methods. Table 1 compares the performance of DNP and auto-DNP, on the prompt-seed pairs used for the human evaluation1. For the rest of the paper, we use the notation DM+X, where DM is the diffusion model and X the negative prompting method." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 465, + 482, + 502 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 465, + 482, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 465, + 482, + 502 + ], + "type": "text", + "content": "While DNP achieves the best performance, auto-DNP provides almost identical results. This suggests that the BLIP2 model is quite effective at captioning the diffusion-negative negative images " + }, + { + "bbox": [ + 130, + 465, + 482, + 502 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 465, + 482, + 502 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 520, + 265, + 532 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 520, + 265, + 532 + ], + "spans": [ + { + "bbox": [ + 131, + 520, + 265, + 532 + ], + "type": "text", + "content": "4.4 Quantitative Results" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 540, + 481, + 563 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 540, + 481, + 563 + ], + "spans": [ + { + "bbox": [ + 130, + 540, + 481, + 563 + ], + "type": "text", + "content": "We next discuss the results of quantitative experiments on image quality using auto-DNP. Various ablations are also presented in Supplementary Section 4." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "text", + "content": "A&E dataset: We first compare SD to " + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\mathrm{SD + }" + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "text", + "content": " auto-DNP, on the A&E dataset in Table 2a. " + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\mathrm{SD + }" + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "text", + "content": " auto-DNP achieves a Min. Object CLIP Score of 0.258, which is " + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "inline_equation", + "content": "6.6\\%" + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "text", + "content": " higher than that of SD, illustrating that " + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\mathrm{SD + }" + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "text", + "content": " auto-DNP generates images that align better with the prompts. Since CLIP scores practically range from [0, 0.4] [8], the full prompt CLIP Score of 0.346 of " + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "inline_equation", + "content": "\\mathrm{SD + }" + }, + { + "bbox": [ + 130, + 563, + 482, + 635 + ], + "type": "text", + "content": " auto-DNP suggests good alignment between prompt and image. Human evaluation underscores the true" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 642, + 481, + 665 + ], + "type": "text", + "content": "1 IS score cannot be computed in this case as the number of seeds per prompt is not large enough for IS to provide reliable results." + } + ] + } + ], + "index": 11 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 169, + 114, + 449, + 178 + ], + "blocks": [ + { + "bbox": [ + 169, + 114, + 449, + 178 + ], + "lines": [ + { + "bbox": [ + 169, + 114, + 449, + 178 + ], + "spans": [ + { + "bbox": [ + 169, + 114, + 449, + 178 + ], + "type": "table", + "html": "
MethodCLIP ScoreISHuman Evaluation
Min. ObjectFull PromptCorrectnessQuality
No Clear Winner---16.88%10.46%
Stable Diffusion (SD)0.2420.33513.1718.90%25.73%
SD+auto-DNP0.258 (+6.61%)0.346 (+3.28%)13.35 (+1.37%)64.22%63.81%
No Clear Winner---16.95%7.35%
Attend & Excite (A&E)0.2640.34911.8630.06%33.12%
A&E+auto-DNP0.276 (+4.54%)0.362 (+3.72%)13.12 (+10.62%)52.99%59.53%
", + "image_path": "2f543eb94bd0c2a32cf0b369aa31881ea76301b95f8178c1fd38eef5ad2e6577.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_body" + } + ], + "index": 2 + }, + { + "type": "table", + "bbox": [ + 170, + 199, + 449, + 264 + ], + "blocks": [ + { + "bbox": [ + 214, + 179, + 399, + 190 + ], + "lines": [ + { + "bbox": [ + 214, + 179, + 399, + 190 + ], + "spans": [ + { + "bbox": [ + 214, + 179, + 399, + 190 + ], + "type": "text", + "content": "(a) Quantitative Results on the A&E dataset." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 170, + 199, + 449, + 264 + ], + "lines": [ + { + "bbox": [ + 170, + 199, + 449, + 264 + ], + "spans": [ + { + "bbox": [ + 170, + 199, + 449, + 264 + ], + "type": "table", + "html": "
DatasetMethodCLIP ScoreISHuman Evaluation
CorrectnessQuality
Human PromptsNo Clear Winner--14.42%5.10%
Stable Diffusion (SD)0.3229.9527.60%29.0%
SD+auto-DNP0.331 (+2.80%)10.13 (+1.80%)57.98%65.80%
Hand PromptsNo Clear Winner--19.89%8.18%
Stable Diffusion (SD)0.30912.0420.45%22.47%
SD+auto-DNP0.321 (+3.88%)12.39 (+2.94%)59.66%69.35%
", + "image_path": "4197a34ffcb1fb203bc0592fc7bdb269030b6fc0f65a172c15c1c8c06ea687e5.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 213, + 265, + 400, + 274 + ], + "lines": [ + { + "bbox": [ + 213, + 265, + 400, + 274 + ], + "spans": [ + { + "bbox": [ + 213, + 265, + 400, + 274 + ], + "type": "text", + "content": "(b) Quantitative Results on the H&H dataset." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 132, + 284, + 480, + 308 + ], + "lines": [ + { + "bbox": [ + 132, + 284, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 132, + 284, + 480, + 308 + ], + "type": "text", + "content": "Table 2: Quantitative Results: comparing prompt adherence and image quality by CLIP Score, IS and Human Evaluation. The percentage gains are shown in (brackets)" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "text" + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "spans": [ + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "text", + "content": "strength of DNP, as human evaluators prefer images generated by " + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "inline_equation", + "content": "\\mathrm{SD} + \\mathrm{auto}" + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "text", + "content": "-DNP " + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "inline_equation", + "content": "3.4\\times" + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "text", + "content": " more in terms of correctness and " + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "inline_equation", + "content": "2.5\\times" + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "text", + "content": " more in terms of quality than those generated by SD. Note that " + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "inline_equation", + "content": "\\mathrm{SD} + \\mathrm{auto}" + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "text", + "content": "-DNP even outperforms the " + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 354, + 480, + 415 + ], + "type": "text", + "content": " model in IS and matches its CLIP Score for both full prompt and minimum object, despite not being specifically designed for multiple object generation." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "spans": [ + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": "To demonstrate the flexibility of the DNP approach, we also applied it to the " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " model, comparing " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E + \\text{auto-DNP}" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": ". We observe a moderate increase in the CLIP Score since " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " is already quite efficient at generating multiple objects. " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E + \\text{auto-DNP}" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " achieves a Min. Object CLIP Score of 0.276, which is very close to the theoretical upper bound for Min. Object CLIP Score of 0.29 as defined by [3]. The " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "10.62\\%" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " improvement in IS shows that " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " is more inclined to generate unrealistic images and the addition of DNP improves its realism. The human evaluation also reflects this, as around " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "53\\%" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " of the evaluators prefer " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E + \\text{auto-DNP}" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " over the " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " images for correctness and " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "60\\%" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " for quality, which is close to " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "1.8\\times" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": " the preference for " + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 420, + 482, + 540 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": "H&H dataset: Table 2b summarizes the ability of DNP to address the specific SD weaknesses of synthesizing humans and hands. Since both CLIP and IS may ignore distorted or maligned results when considering correctness or realism, they fail to give substantial insight into image quality (despite improvement). The human evaluation is much more important for this task. SD+auto-DNP outperforms SD by a substantial margin, as evaluators prefer SD+auto-DNP " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "3 \\times" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": " more for correctness and " + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "inline_equation", + "content": "2 \\times" + }, + { + "bbox": [ + 130, + 546, + 482, + 666 + ], + "type": "text", + "content": " more for quality, for both human and hand prompts. Since evaluators were specifically tasked with checking the number and pose of limbs and fingers and the quality of the faces, their preference for images generated with DNP shows that the latter improves SD performance substantially." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 103 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 103 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 136, + 124, + 250, + 182 + ], + "blocks": [ + { + "bbox": [ + 154, + 114, + 232, + 121 + ], + "lines": [ + { + "bbox": [ + 154, + 114, + 232, + 121 + ], + "spans": [ + { + "bbox": [ + 154, + 114, + 232, + 121 + ], + "type": "text", + "content": "Prompts with Humans" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 136, + 124, + 250, + 182 + ], + "lines": [ + { + "bbox": [ + 136, + 124, + 250, + 182 + ], + "spans": [ + { + "bbox": [ + 136, + 124, + 250, + 182 + ], + "type": "image", + "image_path": "dbacb51d43429b029e7caf8996361a829e3593c9206c564f4eb7f1f8854b1390.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 140, + 183, + 246, + 191 + ], + "lines": [ + { + "bbox": [ + 140, + 183, + 246, + 191 + ], + "spans": [ + { + "bbox": [ + 140, + 183, + 246, + 191 + ], + "type": "text", + "content": "p: a boy in the moonlight n*: a living room with a fireplace and wooden beams" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 250, + 124, + 365, + 182 + ], + "blocks": [ + { + "bbox": [ + 256, + 114, + 359, + 122 + ], + "lines": [ + { + "bbox": [ + 256, + 114, + 359, + 122 + ], + "spans": [ + { + "bbox": [ + 256, + 114, + 359, + 122 + ], + "type": "text", + "content": "Prompts with Multiple Nouns" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 250, + 124, + 365, + 182 + ], + "lines": [ + { + "bbox": [ + 250, + 124, + 365, + 182 + ], + "spans": [ + { + "bbox": [ + 250, + 124, + 365, + 182 + ], + "type": "image", + "image_path": "789f5ff4fb08412c62ddbe2cc264a469a101aa0e7e328798935e9877330a7e24.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 256, + 182, + 359, + 192 + ], + "lines": [ + { + "bbox": [ + 256, + 182, + 359, + 192 + ], + "spans": [ + { + "bbox": [ + 256, + 182, + 359, + 192 + ], + "type": "text", + "content": "p: a cat and a dog " + }, + { + "bbox": [ + 256, + 182, + 359, + 192 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 256, + 182, + 359, + 192 + ], + "type": "text", + "content": " : an aerial view of a resort with a swimming pool" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 365, + 124, + 480, + 182 + ], + "blocks": [ + { + "bbox": [ + 386, + 114, + 457, + 122 + ], + "lines": [ + { + "bbox": [ + 386, + 114, + 457, + 122 + ], + "spans": [ + { + "bbox": [ + 386, + 114, + 457, + 122 + ], + "type": "text", + "content": "Prompts with Hands" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 365, + 124, + 480, + 182 + ], + "lines": [ + { + "bbox": [ + 365, + 124, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 365, + 124, + 480, + 182 + ], + "type": "image", + "image_path": "75c83b9675a1467925efbd6b7b9b5715eaaddaea9da0eef94cf76f37e5156877.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 394, + 182, + 450, + 186 + ], + "lines": [ + { + "bbox": [ + 394, + 182, + 450, + 186 + ], + "spans": [ + { + "bbox": [ + 394, + 182, + 450, + 186 + ], + "type": "text", + "content": "p: a hand with a ring on it" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 135, + 194, + 250, + 253 + ], + "blocks": [ + { + "bbox": [ + 135, + 194, + 250, + 253 + ], + "lines": [ + { + "bbox": [ + 135, + 194, + 250, + 253 + ], + "spans": [ + { + "bbox": [ + 135, + 194, + 250, + 253 + ], + "type": "image", + "image_path": "fcf30f4aab035b8289249a5876a8df1278416f75d09ca9f9bbed1646be2eede5.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 140, + 254, + 246, + 262 + ], + "lines": [ + { + "bbox": [ + 140, + 254, + 246, + 262 + ], + "spans": [ + { + "bbox": [ + 140, + 254, + 246, + 262 + ], + "type": "text", + "content": "p: a man in a sombrero \nn*: a modern three story townhouse with two garages" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 250, + 194, + 365, + 253 + ], + "blocks": [ + { + "bbox": [ + 250, + 194, + 365, + 253 + ], + "lines": [ + { + "bbox": [ + 250, + 194, + 365, + 253 + ], + "spans": [ + { + "bbox": [ + 250, + 194, + 365, + 253 + ], + "type": "image", + "image_path": "4e8bf7651c4258dfec08a6df5a82d996b9a75d44d14c834a12e8b57880489006.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 258, + 254, + 357, + 262 + ], + "lines": [ + { + "bbox": [ + 258, + 254, + 357, + 262 + ], + "spans": [ + { + "bbox": [ + 258, + 254, + 357, + 262 + ], + "type": "text", + "content": "p: a boy playing with his dog n*: three bowls of stew with vegetables and herbs" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 365, + 194, + 480, + 253 + ], + "blocks": [ + { + "bbox": [ + 376, + 187, + 468, + 192 + ], + "lines": [ + { + "bbox": [ + 376, + 187, + 468, + 192 + ], + "spans": [ + { + "bbox": [ + 376, + 187, + 468, + 192 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^{*}" + }, + { + "bbox": [ + 376, + 187, + 468, + 192 + ], + "type": "text", + "content": " : a woman in a black dress on the red carpet" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 365, + 194, + 480, + 253 + ], + "lines": [ + { + "bbox": [ + 365, + 194, + 480, + 253 + ], + "spans": [ + { + "bbox": [ + 365, + 194, + 480, + 253 + ], + "type": "image", + "image_path": "65cf8144a32e5429450941ee89db357bc3144a3bdda417ec15ca42903a404646.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 394, + 254, + 451, + 258 + ], + "lines": [ + { + "bbox": [ + 394, + 254, + 451, + 258 + ], + "spans": [ + { + "bbox": [ + 394, + 254, + 451, + 258 + ], + "type": "text", + "content": "p: a closeup of a handshake" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 135, + 265, + 250, + 323 + ], + "blocks": [ + { + "bbox": [ + 135, + 265, + 250, + 323 + ], + "lines": [ + { + "bbox": [ + 135, + 265, + 250, + 323 + ], + "spans": [ + { + "bbox": [ + 135, + 265, + 250, + 323 + ], + "type": "image", + "image_path": "ef513672a64542ddddf6b6c9763114dd59b8bae5b39ea087244ec5d5de275d56.jpg" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 137, + 326, + 248, + 333 + ], + "lines": [ + { + "bbox": [ + 137, + 326, + 248, + 333 + ], + "spans": [ + { + "bbox": [ + 137, + 326, + 248, + 333 + ], + "type": "text", + "content": "p. a child on the couch n*: men and women in suits and ties in front of a crowd" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "lines": [ + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "spans": [ + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "type": "text", + "content": "Fig. 3: Images synthesized by SD (left) for prompt p vs. " + }, + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "type": "inline_equation", + "content": "\\mathrm{SD + }" + }, + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "type": "text", + "content": " auto-DNP (right) for prompt pair " + }, + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "type": "inline_equation", + "content": "(\\mathbf{p},\\mathbf{n}^{*})" + }, + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "type": "text", + "content": " , where " + }, + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 131, + 342, + 482, + 376 + ], + "type": "text", + "content": " is the DNP estimated from the DNS image. DNP produces negative prompts that are not intuitive for humans but improve quality and adherence." + } + ] + } + ], + "index": 26, + "angle": 0, + "type": "image_caption" + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 250, + 265, + 365, + 323 + ], + "blocks": [ + { + "bbox": [ + 250, + 265, + 365, + 323 + ], + "lines": [ + { + "bbox": [ + 250, + 265, + 365, + 323 + ], + "spans": [ + { + "bbox": [ + 250, + 265, + 365, + 323 + ], + "type": "image", + "image_path": "7bfd6aebdab7ecc6ef6487f8defc96db17651790879e8faf333a726366b12783.jpg" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 262, + 324, + 346, + 333 + ], + "lines": [ + { + "bbox": [ + 262, + 324, + 346, + 333 + ], + "spans": [ + { + "bbox": [ + 262, + 324, + 346, + 333 + ], + "type": "text", + "content": "p: a bear with a brown crown \nn*: a rendering of the plans for a home" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_caption" + } + ], + "index": 21 + }, + { + "type": "image", + "bbox": [ + 366, + 265, + 480, + 323 + ], + "blocks": [ + { + "bbox": [ + 376, + 258, + 469, + 262 + ], + "lines": [ + { + "bbox": [ + 376, + 258, + 469, + 262 + ], + "spans": [ + { + "bbox": [ + 376, + 258, + 469, + 262 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^{*}" + }, + { + "bbox": [ + 376, + 258, + 469, + 262 + ], + "type": "text", + "content": " : an aerial view of a large home in the woods" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 366, + 265, + 480, + 323 + ], + "lines": [ + { + "bbox": [ + 366, + 265, + 480, + 323 + ], + "spans": [ + { + "bbox": [ + 366, + 265, + 480, + 323 + ], + "type": "image", + "image_path": "37825c15ee54050697eda67484b53f438bfab170168628c476d0ce6ed9e05d92.jpg" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 403, + 324, + 441, + 328 + ], + "lines": [ + { + "bbox": [ + 403, + 324, + 441, + 328 + ], + "spans": [ + { + "bbox": [ + 403, + 324, + 441, + 328 + ], + "type": "text", + "content": "p: a tattooed hand" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 378, + 329, + 466, + 334 + ], + "lines": [ + { + "bbox": [ + 378, + 329, + 466, + 334 + ], + "spans": [ + { + "bbox": [ + 378, + 329, + 466, + 334 + ], + "type": "text", + "content": "n*: four pictures of a house, a car and a tree" + } + ] + } + ], + "index": 25, + "angle": 0, + "type": "image_caption" + } + ], + "index": 23 + }, + { + "bbox": [ + 132, + 403, + 257, + 415 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 257, + 415 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 257, + 415 + ], + "type": "text", + "content": "4.5 Qualitative Results" + } + ] + } + ], + "index": 27 + }, + { + "bbox": [ + 130, + 432, + 480, + 456 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 432, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 130, + 432, + 480, + 456 + ], + "type": "text", + "content": "Figure 3 shows qualitative examples from the three datasets, comparing SD with SD+auto-DNP. There are more visual examples in Supplementary Section 5." + } + ] + } + ], + "index": 28 + }, + { + "bbox": [ + 130, + 458, + 482, + 554 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 458, + 482, + 554 + ], + "spans": [ + { + "bbox": [ + 130, + 458, + 482, + 554 + ], + "type": "text", + "content": "The H&H dataset results, e.g. the images synthesized for prompt \"hand with a ring on it\", illustrate how auto-DNP improves the quality of humans and hands in terms of the number of limbs, fingers, poses, etc. It also induces the model to create realistic images, rather than drawings or sketches. See, for example, the \"man in a sombrero\" and \"boy in the moonlight\" examples. We observe a major improvement in the quality of the humans generated by auto-DNP wherein the faces do not exhibit the uncanny, robotic, or distorted features that SD is inclined to create, instead having a natural warmth." + } + ] + } + ], + "index": 29 + }, + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "spans": [ + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "text", + "content": "The results on the A&E dataset show that auto-DNP can correct for entity neglect while ensuring superior image quality. This is especially visible when we compare " + }, + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "inline_equation", + "content": "A\\& E + \\text{auto-DNP}" + }, + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "text", + "content": " (see Figures 5,6,7 in Supplementary Section 5), which produces more realistic images. We posit that auto-DNP's inclination towards generating more realistic images is due to setting the diffusion process onto a better Markov chain without disrupting it at each step, unlike " + }, + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "inline_equation", + "content": "A\\& E" + }, + { + "bbox": [ + 130, + 555, + 482, + 628 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 30 + }, + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 666 + ], + "type": "text", + "content": "Finally, note that none of the negative prompts produced by auto-DNP in Figure 3 is intuitive for humans. This illustrates the semantic gap between humans and SD and the difficulty of producing good negative prompts manually." + } + ] + } + ], + "index": 31 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 178, + 185 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 178, + 185 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 178, + 185 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 178, + 185 + ], + "type": "image", + "image_path": "b2b9a837519080e6dab3e0670fb4bb9281a0e5c7f4ea05fdfa58bacdc88761bb.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "lines": [ + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "spans": [ + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "type": "text", + "content": "Fig. 4: Exploring Semantic Gap: From left to right: 1) images generated for prompt p, 2) DNS images generated by the DM and resulting caption " + }, + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "type": "text", + "content": " by DNP, 3) images synthesized with " + }, + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "type": "text", + "content": " as the negative prompt alone, and 4) with prompt pair " + }, + { + "bbox": [ + 130, + 194, + 480, + 228 + ], + "type": "inline_equation", + "content": "(\\mathbf{p},\\mathbf{n}^{*})" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 179, + 114, + 223, + 185 + ], + "blocks": [ + { + "bbox": [ + 179, + 114, + 223, + 185 + ], + "lines": [ + { + "bbox": [ + 179, + 114, + 223, + 185 + ], + "spans": [ + { + "bbox": [ + 179, + 114, + 223, + 185 + ], + "type": "image", + "image_path": "8597c17d18fec48a5d9160ffb6406bee982ceadd20967e6e1015ef79ee01d629.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 223, + 114, + 264, + 185 + ], + "blocks": [ + { + "bbox": [ + 223, + 114, + 264, + 185 + ], + "lines": [ + { + "bbox": [ + 223, + 114, + 264, + 185 + ], + "spans": [ + { + "bbox": [ + 223, + 114, + 264, + 185 + ], + "type": "image", + "image_path": "e8bad81d8b6055a3b0b5cba7e264d30f3779897dd6ccc0b909e905c4d881e1db.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 264, + 114, + 306, + 186 + ], + "blocks": [ + { + "bbox": [ + 264, + 114, + 306, + 186 + ], + "lines": [ + { + "bbox": [ + 264, + 114, + 306, + 186 + ], + "spans": [ + { + "bbox": [ + 264, + 114, + 306, + 186 + ], + "type": "image", + "image_path": "3a19ae7db6e0f76e8180db4ccf850362c49daf8b0cd4ba99ab1f840c29064ed8.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 307, + 114, + 351, + 186 + ], + "blocks": [ + { + "bbox": [ + 307, + 114, + 351, + 186 + ], + "lines": [ + { + "bbox": [ + 307, + 114, + 351, + 186 + ], + "spans": [ + { + "bbox": [ + 307, + 114, + 351, + 186 + ], + "type": "image", + "image_path": "06a8b7c9f7aa63e36a9c93ea23e394ebaf6154e2e7c4e42e06697a11a27f259f.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 351, + 114, + 394, + 186 + ], + "blocks": [ + { + "bbox": [ + 351, + 114, + 394, + 186 + ], + "lines": [ + { + "bbox": [ + 351, + 114, + 394, + 186 + ], + "spans": [ + { + "bbox": [ + 351, + 114, + 394, + 186 + ], + "type": "image", + "image_path": "325fe574ed53e9c18d889d261a5c2ae523b73836e2acade4d3c7208d13c987b5.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 394, + 114, + 480, + 186 + ], + "blocks": [ + { + "bbox": [ + 394, + 114, + 480, + 186 + ], + "lines": [ + { + "bbox": [ + 394, + 114, + 480, + 186 + ], + "spans": [ + { + "bbox": [ + 394, + 114, + 480, + 186 + ], + "type": "image", + "image_path": "7188aae081dc96767b091d9d99bfde0c68b0d44d4b03be4cbd72091f2018a195.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 249, + 231, + 262 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 249, + 231, + 262 + ], + "spans": [ + { + "bbox": [ + 132, + 249, + 231, + 262 + ], + "type": "text", + "content": "4.6 Semantic Gap" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": "Figure 4 explores the semantic gap between humans and DMs in more detail. From left to right, the first column shows images synthesized by SD with prompt " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": ". The second column shows examples of images sampled with DNS, i.e. (19). These can be seen as images that the model hallucinates as \"negatives\" of the prompt " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": " since they usually do not have this interpretation for humans. The caption " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": " is obtained the user. To confirm that the prompt mirrors the DM internal representation of the \"negative\" for the image in the left column, we prompted the model with an empty positive prompt " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{p} = \\phi" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": " as a negative prompt, which produces the images in the third column of the figure. Note how these images comply with " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": " even though " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathbf{n}^*" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": " is non-intuitive for a human. Finally, the last column shows the result of prompting with the pair " + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "inline_equation", + "content": "(\\mathbf{p}, \\mathbf{n}^*)" + }, + { + "bbox": [ + 130, + 267, + 482, + 422 + ], + "type": "text", + "content": ". In all cases, the synthesized image is at least as good as that on the first column, and usually better, e.g. a greener forest or a more realistic bird." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "spans": [ + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "text", + "content": "Two aspects are worth noting. First, these examples purposefully use prompts " + }, + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "inline_equation", + "content": "\\mathbf{p}" + }, + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "text", + "content": " for which SD works well. This proves that the \"DM knows what it's doing,\" at least to the point of generating a sensible image (first column). However, its notion of negative is totally different from that of humans, demonstrating the semantic gap between the two. The practical result is that a totally unintuitive negative prompt is needed to produce good images. Figure 3 shows that auto-DNP can improve the quality and correctness of the synthesised image even when the DM fails. Second, because all derivations above are functions of " + }, + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "inline_equation", + "content": "z_{t}" + }, + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "text", + "content": ", the DNS procedure is valid for any seed " + }, + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "inline_equation", + "content": "z_{T}" + }, + { + "bbox": [ + 130, + 423, + 482, + 543 + ], + "type": "text", + "content": ". This is an additional advantage over the human-centric negative prompting of Figure 2a, whose success is seed-dependent." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 558, + 237, + 571 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 237, + 571 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 237, + 571 + ], + "type": "text", + "content": "5 Related Work" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "Text-to-Image Diffusion: High-resolution T2I generation has advanced dramatically with the introduction of large-scale diffusion models, due to: (1) availability of large-scale text-image datasets [2, 26], (2) advances in various training and inference techniques [9-11, 27], and, (3) development of scalable model architectures [19, 20, 22, 24]. The most popular T2I models employ classifier-free guidance [11] to balance prompt compliance and image diversity using a guidance scale hyper-parameter, " + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": ". While prompt adherence improves by increasing" + } + ] + } + ], + "index": 14 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 448, + 102 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": ", image quality deteriorates beyond a certain value. DNP helps ensure prompt adherence even for lower values of " + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": ", thereby maintaining image quality." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 481, + 236 + ], + "type": "text", + "content": "Structured Image Conditioning: Various image generation and editing improvements have been introduced since the advent of DMs. They range from finetuning the models for certain tasks to editing the noise at each iteration. Many methods require users to provide structured conditioned inputs like layouts [15, 18, 32], example images [13, 23, 29], and depth maps [31]. These can be hard to produce and require considerable user skill or additional computer vision modules. DNP allows us to control T2I with text alone while allowing it to be combined with most structured conditioning techniques as well." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 236, + 482, + 379 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 236, + 482, + 379 + ], + "spans": [ + { + "bbox": [ + 130, + 236, + 482, + 379 + ], + "type": "text", + "content": "Attention-based Methods: These methods attempt to tackle DM errors by editing attention maps at each diffusion step, changing the cross-attention between prompt tokens. [3] updates the noise latent with a loss that maximizes attention to each noun, while [21] first creates a linguistic binding between prompt attributes and nouns and then maximizes (minimizes) attention IOUs for mapped (non-mapped) tokens. [7] uses text formatting such as font style, size, color, and footnotes to allow for creative human input and uses region-specific guidance to combine the noise corresponding to each token. These methods require careful fine-tuning of a loss guidance hyper-parameter and can heavily alter the DM Markov chain, which can create highly saturated and low-quality images. While the proposed method also forces the DM to use a different Markov chain, it does not interfere with its intermediate steps through any loss updates." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 380, + 482, + 439 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 380, + 482, + 439 + ], + "spans": [ + { + "bbox": [ + 130, + 380, + 482, + 439 + ], + "type": "text", + "content": "Text based Methods: These methods try to explore and correct the semantic failures of the DM text encoder. [16] tries to decouple the text and combine noise latent later and [6] introduces consistency trees to split the prompt into noun phrases, for better cross-attention in the text-encoder. These methods fail to correct those errors which arise not from the text but from the DM itself." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 440, + 482, + 499 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 440, + 482, + 499 + ], + "spans": [ + { + "bbox": [ + 130, + 440, + 482, + 499 + ], + "type": "text", + "content": "Negative Prompts: Negative prompts [16], are quite effective at removing unwanted concepts from the synthesized image and have been incorporated into most T2I models. However, finding a good negative prompt requires trial and error. Also, the effect of negative prompts varies significantly with prompt and seed. The proposed method, DNP provides a solution to this." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 519, + 220, + 532 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 519, + 220, + 532 + ], + "spans": [ + { + "bbox": [ + 131, + 519, + 220, + 532 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "content": "Do diffusion models truly understand negation? In this work, we have hypothesized that the semantic gap between DMs and humans is responsible for the poor performance of negative prompting. We proposed DNP as a simple yet effective method for bridging this gap. This consists of sampling a negative diffusion image " + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "inline_equation", + "content": "\\bar{\\mathcal{I}}" + }, + { + "bbox": [ + 130, + 545, + 482, + 665 + ], + "type": "text", + "content": ", using a novel DNS procedure, and asking the user to translate it into a natural language negative prompt. This greatly improves the prompt adherence and quality of the generated images. DNP is universally applicable across diffusion models and can be combined with other methods. It highlights the difference between semantic and diffusion negation and leverages this difference to improve the performance of these models without additional training." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 283, + 101 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 175 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 175 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 175 + ], + "type": "text", + "content": "This work was partially funded by NSF award IIS-2303153 a gift from Qualcomm, and NVIDIA GPU donations. We also acknowledge and thank the use of the Nautilus platform for the experiments discussed above." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 193, + 197, + 205 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 193, + 197, + 205 + ], + "spans": [ + { + "bbox": [ + 133, + 193, + 197, + 205 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 217, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 21, + "blocks": [ + { + "bbox": [ + 138, + 217, + 479, + 240 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 217, + 479, + 240 + ], + "spans": [ + { + "bbox": [ + 138, + 217, + 479, + 240 + ], + "type": "text", + "content": "1. AUTOMATIC1111: Negative prompt: Stable diffusion webui, https://github.com/AUTOMATIC1111/stable-diffusion-webui/wiki/Negative-prompt" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "spans": [ + { + "bbox": [ + 138, + 240, + 480, + 262 + ], + "type": "text", + "content": "2. Byeon, M., Park, B., Kim, H., Lee, S., Baek, W., Kim, S.: Coyo-700m: Image-text pair dataset. https://github.com/kakaobrain/coyo-dataset (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 262, + 480, + 283 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 262, + 480, + 283 + ], + "spans": [ + { + "bbox": [ + 138, + 262, + 480, + 283 + ], + "type": "text", + "content": "3. Chefer, H., Alaluf, Y., Vinker, Y., Wolf, L., Cohen-Or, D.: Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models (2023)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 284, + 480, + 316 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 284, + 480, + 316 + ], + "spans": [ + { + "bbox": [ + 138, + 284, + 480, + 316 + ], + "type": "text", + "content": "4. Dawid, A.P., Stone, M., Zidek, J.V.: Marginalization paradoxes in bayesian and structural inference. Journal of the Royal Statistical Society Series B: Statistical Methodology 35(2), 189-213 (1973)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 316, + 480, + 371 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 316, + 480, + 371 + ], + "spans": [ + { + "bbox": [ + 138, + 316, + 480, + 371 + ], + "type": "text", + "content": "5. Du, Y., Li, S., Mordatch, I.: Compositional visual generation with energy based models. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems. vol. 33, pp. 6637-6647. Curran Associates, Inc. (2020), https://proceedings.neurips.cc/paper_files/paper/2020/file/49856ed476ad01fcff881d57e161d73f-Paper.pdf" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 371, + 480, + 403 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 371, + 480, + 403 + ], + "spans": [ + { + "bbox": [ + 138, + 371, + 480, + 403 + ], + "type": "text", + "content": "6. Feng, W., He, X., Fu, T.J., Jampani, V., Akula, A., Narayana, P., Basu, S., Wang, X.E., Wang, W.Y.: Training-free structured diffusion guidance for compositional text-to-image synthesis (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 403, + 480, + 426 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 403, + 480, + 426 + ], + "spans": [ + { + "bbox": [ + 138, + 403, + 480, + 426 + ], + "type": "text", + "content": "7. Ge, S., Park, T., Zhu, J.Y., Huang, J.B.: Expressive text-to-image generation with rich text. In: IEEE International Conference on Computer Vision (ICCV) (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 426, + 480, + 447 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 426, + 480, + 447 + ], + "spans": [ + { + "bbox": [ + 138, + 426, + 480, + 447 + ], + "type": "text", + "content": "8. Hessel, J., Holtzman, A., Forbes, M., Bras, R.L., Choi, Y.: Clipscore: A reference-free evaluation metric for image captioning (2022)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 448, + 480, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 448, + 480, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 448, + 480, + 468 + ], + "type": "text", + "content": "9. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 468, + 480, + 502 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 480, + 502 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 480, + 502 + ], + "type": "text", + "content": "0. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 502, + 480, + 523 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 502, + 480, + 523 + ], + "spans": [ + { + "bbox": [ + 138, + 502, + 480, + 523 + ], + "type": "text", + "content": "1. Ho, J., Salimans, T.: Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 523, + 480, + 545 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 523, + 480, + 545 + ], + "spans": [ + { + "bbox": [ + 138, + 523, + 480, + 545 + ], + "type": "text", + "content": "2. Jiang, Y., Yang, S., Qiu, H., Wu, W., Loy, C.C., Liu, Z.: Text2human: Text-driven controllable human image generation (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 480, + 578 + ], + "type": "text", + "content": "3. Kumari, N., Zhang, B., Zhang, R., Shechtman, E., Zhu, J.Y.: Multi-concept customization of text-to-image diffusion. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 1931-1941 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 578, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 480, + 600 + ], + "type": "text", + "content": "4. Li, J., Li, D., Savarese, S., Hoi, S.: Blip-2: Bootstrapping language-image pretraining with frozen image encoders and large language models (2023)" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 601, + 480, + 632 + ], + "type": "text", + "content": "5. Li, Y., Liu, H., Wu, Q., Mu, F., Yang, J., Gao, J., Li, C., Lee, Y.J.: Gligen: Open-set grounded text-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22511-22521 (2023)" + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "6. Liu, N., Li, S., Du, Y., Torralba, A., Tenenbaum, J.B.: Compositional visual generation with composable diffusion models. In: European Conference on Computer Vision. pp. 423-439. Springer (2022)" + } + ] + } + ], + "index": 20 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 205, + 91, + 447, + 102 + ], + "type": "text", + "content": "Improving image synthesis with diffusion-negative sampling" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 117, + 480, + 643 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "spans": [ + { + "bbox": [ + 133, + 117, + 480, + 138 + ], + "type": "text", + "content": "17. Lu, W., Xu, Y., Zhang, J., Wang, C., Tao, D.: Handrefiner: Refining malformed hands in generated images by diffusion-based conditional inpainting (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 140, + 480, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 140, + 480, + 160 + ], + "spans": [ + { + "bbox": [ + 133, + 140, + 480, + 160 + ], + "type": "text", + "content": "18. Phung, Q., Ge, S., Huang, J.B.: Grounded text-to-image synthesis with attention refocusing. arXiv preprint arXiv:2306.05427 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 134, + 161, + 480, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 161, + 480, + 194 + ], + "spans": [ + { + "bbox": [ + 134, + 161, + 480, + 194 + ], + "type": "text", + "content": "19. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 194, + 480, + 226 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 194, + 480, + 226 + ], + "spans": [ + { + "bbox": [ + 133, + 194, + 480, + 226 + ], + "type": "text", + "content": "20. Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., Sutskever, I.: Zero-shot text-to-image generation. In: International Conference on Machine Learning. pp. 8821-8831. PMLR (2021)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 480, + 258 + ], + "type": "text", + "content": "21. Rassin, R., Hirsch, E., Glickman, D., Ravfogel, S., Goldberg, Y., Chechik, G.: Linguistic binding in diffusion models: Enhancing attribute correspondence through attention map alignment (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "text", + "content": "22. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 293, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 480, + 335 + ], + "type": "text", + "content": "23. Ruiz, N., Li, Y., Jampani, V., Pritch, Y., Rubinstein, M., Aberman, K.: Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 22500-22510 (June 2023)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 336, + 480, + 380 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 336, + 480, + 380 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 480, + 380 + ], + "type": "text", + "content": "24. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 380, + 480, + 402 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 380, + 480, + 402 + ], + "spans": [ + { + "bbox": [ + 132, + 380, + 480, + 402 + ], + "type": "text", + "content": "25. Salimans, T., Goodfellow, I., Zaremba, W., Cheung, V., Radford, A., Chen, X.: Improved techniques for training gans (2016)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 403, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 403, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 132, + 403, + 480, + 490 + ], + "type": "text", + "content": "26. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: Laion-5b: An open large-scale dataset for training next generation image-text models. In: Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., Oh, A. (eds.) Advances in Neural Information Processing Systems. vol. 35, pp. 25278-25294. Curran Associates, Inc. (2022), https://proceedings.neurips.cc/paper_files/paper/2022/file/a1859debfb3b59d094f3504d5ebbb6c25-Paper-Datasets_and_Benchmarks.pdf" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 491, + 480, + 511 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 491, + 480, + 511 + ], + "spans": [ + { + "bbox": [ + 132, + 491, + 480, + 511 + ], + "type": "text", + "content": "27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 512, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 480, + 533 + ], + "type": "text", + "content": "28. Song, Y., Ermon, S.: Generative modeling by estimating gradients of the data distribution. Advances in neural information processing systems 32 (2019)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 534, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 534, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 534, + 480, + 555 + ], + "type": "text", + "content": "29. Voynov, A., Chu, Q., Cohen-Or, D., Aberman, K.: P+: Extended textual conditioning in text-to-image generation (2023)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 555, + 480, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 480, + 588 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 480, + 588 + ], + "type": "text", + "content": "30. Welling, M., Teh, Y.W.: Bayesian learning via stochastic gradient Langevin dynamics. In: Proceedings of the 28th international conference on machine learning (ICML-11). pp. 681-688 (2011)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "spans": [ + { + "bbox": [ + 132, + 589, + 480, + 610 + ], + "type": "text", + "content": "31. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 610, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 610, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 132, + 610, + 480, + 643 + ], + "type": "text", + "content": "32. Zheng, G., Zhou, X., Li, X., Qi, Z., Shan, Y., Li, X.: Layoutdiffusion: Controllable diffusion model for layout-to-image generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 22490-22499 (2023)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 283, + 100 + ], + "type": "text", + "content": "A. Desai and N. Vasconcelos" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_content_list.json b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..4199b103debeee7715b9cff251ef40c091812ec3 --- /dev/null +++ b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_content_list.json @@ -0,0 +1,2148 @@ +[ + { + "type": "text", + "text": "In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation", + "text_level": 1, + "bbox": [ + 243, + 141, + 759, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Dahyun Kang Minsu Cho", + "bbox": [ + 398, + 214, + 604, + 229 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Pohang University of Science and Technology (POSTECH), South Korea https://cvlab.postech.ac.kr/research/azygrounding", + "bbox": [ + 256, + 246, + 745, + 276 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. We present Lazy Visual Grounding for open-vocabulary semantic segmentation, which decouples unsupervised object mask discovery from object grounding. Plenty of the previous art casts this task as pixel-to-text classification without object-level comprehension, leveraging the image-to-text classification capability of pretrained vision-and-language models. We argue that visual objects are distinguishable without the prior text information as segmentation is essentially a visual understanding task. Lazy visual grounding first discovers object masks covering an image with iterative Normalized cuts and then later assigns text on the discovered objects in a late interaction manner. Our model requires no additional training yet shows great performance on five public datasets: Pascal VOC, Pascal Context, COCO-object, COCO-stuff, and ADE 20K. Especially, the visually appealing segmentation results demonstrate the model capability to localize objects precisely.", + "bbox": [ + 259, + 327, + 743, + 521 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Unsupervised object discovery $\\cdot$ Training-free $\\cdot$ Open-vocabulary semantic segmentation $\\cdot$ CLIP", + "bbox": [ + 261, + 537, + 740, + 565 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/6905edbdc5349072fd1057c928abfd988eef7ff6b63c494019724ea14759a73b.jpg", + "image_caption": [ + "Fig. 1: Comparison of a pixel-grounding method and our object-grounding one. A pixel-grounding method (SCLIP [95]) often produces spurious correlations with imprecise edges. Instead of casting open-vocabulary semantic segmentation as pixel-to-text classification, we solve this task with lazy visual grounding: a two-step approach of object mask discovery followed by object grounding in a late interaction manner." + ], + "image_footnote": [], + "bbox": [ + 217, + 593, + 787, + 742 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 217, + 143, + 375, + 160 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Image segmentation is a fundamental task in computer vision, aiming to partition an image into multiple segments with coherent characteristics [51, 88]. The classic approach to the problem is to collect nearby image pixels with shared characteristics using graph partitioning [3, 4, 78], feature clustering [14, 104], histogram equalization [68], edge detection [2, 43]. Deep neural networks for image segmentation [16, 19, 60, 66, 74] have relied on segmentation datasets of pixel-level class supervision [24, 27, 34, 48, 56, 118] via fully-supervised training with the annotated classes. However, such models are trained with the fixed set of classes hence unable to recognize unseen classes beyond the predefined set of seen classes.", + "bbox": [ + 212, + 175, + 787, + 325 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The task of open-vocabulary semantic segmentation (OVSeg) [6,28,52,107, 108] is an image segmentation task of which classes are grounded with text. OVSeg aims to align image segments with potentially unseen classes described in text, spanning the modality of image segmentation to multi-modal. To solve this task, image-text encoders such as CLIP [69] are often used to recognize the text descriptions. A line of work [12,15,95,119] leverages its alignment of image patch and text embeddings to solve OVSeg by pixel-to-text similarity matching. However, this pixel-level classification approach lacks object comprehension, thus this approach often fails to distinguish objects (cf. Figure 1). This is probably because CLIP is trained to represent the holistic image through a separate CLS token embedding, and the patch embeddings are not explicitly trained to represent the corresponding image patch. The imprecise segmentation visuals of these modern multi-modal segmentation models encourage us to revisit the classic computer vision techniques - regarding an image with a bag of segmentable visual units. Imagine a four-legged animal on grass that we want to segment out. Do we need to know its name before segmentation? Having been approached since decades ago, image segmentation is primarily a vision task, and we argue that the objects can be distinguished as visual units given the vision input only without knowing their names in text.", + "bbox": [ + 212, + 325, + 787, + 613 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our approach, dubbed Lazy Visual Grounding (LaVG), first partitions an image into image segments with a classical image segmentation method, which is based on the vision input and no textual priors on the target classes. The text entity is later assigned to the partitioned segments. For image segmentation, we revisit the related task of unsupervised object discovery [20,82,93,94] which aims to identify visual units. The unsupervised object discovery methods aim to distinguish visual units in bounding boxes or object masks without semantic priors such as classes. Following the recent unsupervised object discovery methods [70, 99, 100], we retrocede the Normalized Cut [78] algorithm. Normalized cut bipartitions a weighted graph into two subgraphs such that the affinity between the two balanced parted groups is minimal. Following the recent object discovery approach [47,53,99,100], we apply Normalized cut on the outputs of a self-supervised vision transformer, DINO [11], which present an empirical property that attends to the salient object region. We iteratively apply Normalized cut until the identified segments cover all image pixels for semantic segmenta", + "bbox": [ + 212, + 613, + 787, + 840 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/d3c6d7488899e5131ef0783a7ba3b8f2866291f082d7c578c920584339afd95e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 217, + 143, + 392, + 222 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/cf00ad9a8ec9f85cf6915de81f39d61ad3ff49776e5f85193bc4a96169214584.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 392, + 143, + 506, + 213 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/69d6241296bd333703f48f05705067240c56e35a4be1f59e7b1444d913ffef5f.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 506, + 143, + 617, + 213 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/2954c55eea96dd56f902772ba064da25c03134a792adc82c70d1a128bee971b5.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 617, + 143, + 784, + 214 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/59b0c8bb23882cd31e41d99a94ae1a6131f05e5c6cc2a8d24c53965c709c27bf.jpg", + "image_caption": [ + "#" + ], + "image_footnote": [], + "bbox": [ + 217, + 222, + 392, + 287 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/8b2034ecb602f4c0f7a90ddf571b146da02b2c2563d045c51c4b2d43d2623b5c.jpg", + "image_caption": [ + "${19}/{19}$" + ], + "image_footnote": [], + "bbox": [ + 392, + 213, + 506, + 287 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/13991ec40e313516ea47853af85c69429656d3fff1ff37601a781a7d0c15dd96.jpg", + "image_caption": [ + "a p" + ], + "image_footnote": [], + "bbox": [ + 506, + 213, + 617, + 287 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/3a9c4b6e98ba1b238e7997d5bb3e7a61cebe2bf17f0736c79808721f2d3a30ff.jpg", + "image_caption": [ + "#", + "[\\frac{1}{4}\\left( {x - 2}\\right) \\left( {x + 5}\\right) = 0]", + "${13}/{14}$", + "#" + ], + "image_footnote": [], + "bbox": [ + 617, + 213, + 784, + 287 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/9bd6502e0d1dc548352633adb05bac4c3dd95d662cef20475db0d7cf7ba2730d.jpg", + "image_caption": [ + "Fig. 2: Segmentation results of LaVG given the text description set. These precise object masks and visual grounding results are produced in a training-free fashion." + ], + "image_footnote": [], + "bbox": [ + 217, + 290, + 303, + 308 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/fc4e20ebbfb8cd638358efc5ab15f4ccfd8811ab47e47498bff92925b2ba262e.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 303, + 290, + 307, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/567e145d91f7f25ede6188f539a073ffc6c4f67fd500bb81f9df51ddcca05574.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 308, + 290, + 313, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/27cb8d888248fa2a7beb05af5a21d2b1d87dae6ed1274c3818e06f2ee27fec1a.jpg", + "image_caption": [ + "$\\therefore m = \\frac{3}{11}$" + ], + "image_footnote": [], + "bbox": [ + 331, + 290, + 334, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/5ac4776e0fca74eff027f0737f1ed73c7be8ac028b00b859dffd2a038868bdbe.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 352, + 290, + 364, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/8ac722bfaf5a01764353a1e7ad8b53bdd919a945ac3dca69d2f15ba218e96b90.jpg", + "image_caption": [ + "#" + ], + "image_footnote": [], + "bbox": [ + 380, + 290, + 385, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/b630ea6eeee6e65c34fb06842778f5d61c6c00e773ccf8b24407c6abcbfff4d3.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 403, + 290, + 406, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/17343d40d73ff1119978d0864f03361a857b27ecfb2f0f0a6dff10c1a4b6dc9a.jpg", + "image_caption": [ + "$\\frac{1}{2} =$", + "$\\therefore m = \\frac{3}{11}$" + ], + "image_footnote": [], + "bbox": [ + 424, + 290, + 429, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/4a2c05e34209f8b861c2f43afa6495f6b47e47fdc6a654e64e6ad8703a54d8ae.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 446, + 290, + 450, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/38a65cc23395953048f13004c7bc44629650a99b1bdc7b644d191a387c25e188.jpg", + "image_caption": [ + "$\\therefore m = \\frac{3}{11}$" + ], + "image_footnote": [], + "bbox": [ + 465, + 290, + 470, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/c7af479d9ae5c8397b5f29031d6f5e7a9c3375e14e9132de41718cb2598d1709.jpg", + "image_caption": [ + "1" + ], + "image_footnote": [], + "bbox": [ + 485, + 290, + 488, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/9e53e0b73a6a216592e04b7c9a600eabff30fba74f119228d007e7b2df362a28.jpg", + "image_caption": [ + "…" + ], + "image_footnote": [], + "bbox": [ + 506, + 290, + 511, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/b8dfa11c86a64089e1a27dd5834b18d0678d2ce336daf0e71c4e6e2a262546e6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 535, + 290, + 540, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/3a810a1c6e7fc404315fddc91eb8e8d79fbb45c187ae7f706c6cc1cf85838ddc.jpg", + "image_caption": [ + "on wi" + ], + "image_footnote": [], + "bbox": [ + 558, + 290, + 563, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/b1cd9c412b83ec030f0048428fe8edd36c6d3fab7eddd2c8a86387e384baa25f.jpg", + "image_caption": [ + "${a}_{4}^{3} = {7}^{3} \\cdot {2}^{4}$" + ], + "image_footnote": [], + "bbox": [ + 584, + 290, + 589, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/d1e507f07930322a74b38957b6c71fa92d749463bf1148fc4782c374b4b4fc47.jpg", + "image_caption": [ + "…" + ], + "image_footnote": [], + "bbox": [ + 607, + 290, + 612, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/9eb6297642b3b4ac7f766bbb76908bea529c26f4d00e9c06e9dedc432bf6563d.jpg", + "image_caption": [ + "…" + ], + "image_footnote": [], + "bbox": [ + 635, + 290, + 640, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/9702093d28ec942408233172ebf712f25ca8ff3a3a5c3558186b0ed287d1ee78.jpg", + "image_caption": [ + "$\\therefore m = \\frac{3}{11}$" + ], + "image_footnote": [], + "bbox": [ + 660, + 290, + 663, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/9ccf55dc7f2faa0d8bf354ca82bfdfd3050319229ecbfe47471eaaac53a73613.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 686, + 290, + 689, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/b66e32dc28bb151602447da450e49dda1d780d622459c98eb94c52c9bfdc6f61.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 715, + 290, + 720, + 299 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/22d3ba47d6b1de4c1279409c10d2a3feb46226ad6bc239373f73ea01a1eee50d.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 741, + 290, + 750, + 299 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "tion, i.e., panoptic segmentation [46], and name this approach as Panoptic cut. Once Panoptic cut is finished, then the objects are grounded with text. Each discovered segment is aggregated to form an object prototype embedding and finally matched with given text embedding from a free-form text (Figure 2). Note that the this two-step process requires no additional training hence significantly benefits computational efficiency. LaVG is simple and training-free yet has shown its superiority over not only the learning-free counterpart models [15,38,71,95,119] but also the trained models [7,12,59,61,72,108,110] that used image-text paired datasets [13,56,89]. It is noteworthy that our model localizes objects qualitatively more precisely than the pixel-to-text classification methods (Figure 1).", + "bbox": [ + 212, + 376, + 784, + 541 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Our contributions can be summarized as follows:", + "bbox": [ + 238, + 542, + 591, + 555 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We present Lazy Visual Grounding (LaVG) which discovers objects first and then later assigns text on the objects in a late interaction manner for open-vocabulary semantic segmentation.", + "- We revisit Normalized cut to present Panoptic cut that iteratively discovers the object masks that cover all the image pixels.", + "- Our model is training-free and runs on top of a pretrained vision and language model, reducing training computation burden significantly.", + "- Our simple method based on graph partitioning quantitatively surpasses the state-of-the-art open-vocabulary segmentation models with segmentation masks with remarkably more precise object boundaries." + ], + "bbox": [ + 223, + 571, + 785, + 724 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 750, + 387, + 763 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Unsupervised Object Discovery", + "text_level": 1, + "bbox": [ + 214, + 782, + 521, + 797 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Object discovery [91] has been a fundamental computer vision task. In 2000s, unsupervised object discovery started with discovering the image groups containing", + "bbox": [ + 212, + 809, + 784, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "objects of the same class with analytic techniques [30, 76, 86, 102]. Later, it advances to identify the location of the objects [50, 117, 120], which is viewed as the seminal work of the object discovery task with object localization. Object discovery has been formulated with an input of an image collection [20, 93, 94], where objects are discovered among the image collection via an image pair matching. A recent self-supervised vision transformer named DINO [11] has shown the emerging property of precisely attending the foreground objects within the transformer [92] attention layer. As it inherently provides a strong clue for foreground object saliency, DINO completely revamps the paradigm of unsupervised object discovery [77, 79, 84, 98]. Pioneered by LOST [82], the recently predominating object discovery approach is to distinguish existing objects based on the DINO activation map. One approach is seed-finding [82, 83], which explores foreground/background region from a highly confident seed pixel on the attention map. The other popular approach leverages the graph-partitioning segmentation, e.g., Normalized cut [78], on the DINO attention map to segregate the foreground objects from the background [70, 85, 99, 100], often followed by self-training of instance segmentation models [8, 35] by the obtained masks [70, 85, 99]. Our work is motivated by the second graph-partitioning approach, which robustly identifies foreground objects.", + "bbox": [ + 212, + 145, + 787, + 434 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Self-Supervised Vision Transformers", + "text_level": 1, + "bbox": [ + 215, + 454, + 562, + 469 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Deep self-supervised learning models [33,39] are trained with the self-supervision arisen from the input data rather than external human-annotated labels. The self-supervised learning paradigm has shown effective in terms of task performance as well as generalization ability across multiple downstream tasks [9-11, 17,22,105,121] without task-specific annotations. One popular approach [11,31] trains a model to map an image and its another view to nearby points on the feature space. This class-agnostic objective encourages the image encoder to capture visual invariance. Unlike class-supervised models that often attend on the specific part that represents an object, a representative self-supervised model named DINO [11] shows the emerged localization ability capturing foreground objects on the attention [92]. This property has benefited several dense prediction tasks such as weakly-supervised few-shot segmentation [41] and unsupervised image/video segmentation [112,115,122]. In this work, we leverage these foreground-attended representations as an input source to Normalized cut.", + "bbox": [ + 212, + 478, + 787, + 690 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.3 Vision-and-Language Representation Learning", + "text_level": 1, + "bbox": [ + 215, + 710, + 643, + 726 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Recent advances in efficient and modern hardware accelerate training huge foundation models at scale [5, 57, 113, 114, 116]. Among them, a representative vision and language model named CLIP [69] is trained using 400 million web-crawled image and text pairs to learn cross-modal similarity. CLIP trains two-tower image-text transformer encoders such that embedding similarity between a positive image-text pair is larger than other pairs in a training batch. The open-sourced CLIP models are leveraged to a number of vision and language work", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/f16e4d249853b454862dc63f32b097de650d79a5b85e6a89080e1ff34b8c209e.jpg", + "image_caption": [ + "Fig. 3: Two stages of Lazy Visual Grounding (LaVG). Given an image, LaVG first discovers existing object masks without the text information (panoptic cut) and then later assigns the class in text descriptions to each object with cross-modal similarity (object grounding)." + ], + "image_footnote": [], + "bbox": [ + 220, + 145, + 782, + 258 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "including zero-shot classification [58, 103], long-tailed recognition [63, 64, 90], referring segmentation [45, 101], cross-modal retrieval [37, 62] as well as OVSeg.", + "bbox": [ + 212, + 342, + 782, + 373 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.4 Open-Vocabulary Semantic Segmentation (OVSeg)", + "text_level": 1, + "bbox": [ + 212, + 396, + 679, + 412 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Open-vocabulary segmentation is a pixel-level image classification task with categories described in text. Compared to the classic definition of semantic segmentation [16, 60] of which target classes are a predefined closed set, the target class set of OVSeg consists of open-vocabulary text and not necessarily predefined. Given the different levels of training supervision, OVSeg methods are categorized as mask-supervised [21, 28, 52, 54, 61, 109], image-text pair supervised [7, 12, 59, 61, 72, 108, 110] (hence weakly-supervised), or training-free [15, 38, 42, 95, 96]. Among them, this work corresponds to the last one: OVSeg with no additional training on pretrained models. For example, one of the training-free methods, SCLIP [95], replaces the attention layer of the query and the key cross-similarity into the self-similarity of each embeddings such that it attends on the homogeneous contexts in local regions. Our work is distinguished from the existing work [95, 106, 119] which directly classifies each image pixel with pixel-text similarity without comprehending the objects. On the other hand, our method first identifies the multiple objects in the absence of the text information and later integrates with the text entities with object-wise text assignment in a lazy visual grounding manner. Our training-free method is also distinguished from the trainable OVSeg methods [25, 29, 55, 111] that train MaskFormer segmentation models [18, 19] to obtain class-agnostic masks followed by grounding.", + "bbox": [ + 212, + 421, + 787, + 709 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Lazy Visual Grounding", + "text_level": 1, + "bbox": [ + 215, + 732, + 478, + 750 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We introduce **Lazy Visual Grounding (LaVG)**. LaVG consists of the two consecutive stages: panoptic object mask discovery (Section 3.1) and object grounding with text (Section 3.2). The key theme is late text interaction; the visual object discovery stage is a vision-only process and does not involve text interaction. Figure 3 briefly visualizes the process.", + "bbox": [ + 212, + 763, + 784, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Panoptic Object Mask Discovery with Normalized Cut", + "text_level": 1, + "bbox": [ + 215, + 146, + 714, + 162 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Preliminary: Normalized cut. Normalized cut [78] tackles the image segmentation problem with graph partitioning. Given an undirected weighted graph of $(\\mathcal{V},\\mathcal{E})$ with $N$ nodes, Normalized cut finds the optimal partition of the graph nodes into two disjoint sets of nodes $\\mathcal{A}$ and $\\mathcal{B}$ such that the removed weights of the edges between $\\mathcal{A}$ and $\\mathcal{B}$ be the minimum [104]. The sum of the lost weights between the bipartitioned subgraphs is defined as cut:", + "bbox": [ + 214, + 171, + 787, + 261 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {c u t} (\\mathcal {A}, \\mathcal {B}) = \\sum_ {u \\in \\mathcal {A}, v \\in \\mathcal {B}} w (u, v). \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 395, + 272, + 785, + 305 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In the image segmentation perspective, the subgraphs $\\mathcal{A}$ and $\\mathcal{B}$ correspond to two image segments that cover an image. The bipartition should avoid bad partitioning such as a tiny fraction and the rest of the mass, which still satisfies the definition of the minimum cut. Thus, a more preferable cut is a bipartition that balances the sizes of subgraphs, where each subgraph is properly associated with the entire graph. Formally,", + "bbox": [ + 214, + 315, + 782, + 406 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {N c u t} (\\mathcal {A}, \\mathcal {B}) = \\frac {\\operatorname {c u t} (\\mathcal {A} , \\mathcal {B})}{\\operatorname {a s s o c} (\\mathcal {A} , \\mathcal {V})} + \\frac {\\operatorname {c u t} (\\mathcal {A} , \\mathcal {B})}{\\operatorname {a s s o c} (\\mathcal {B} , \\mathcal {V})}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 375, + 416, + 785, + 449 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\operatorname {w h e r e} \\operatorname {a s s o c} (\\mathcal {A}, \\mathcal {V}) = \\sum_ {u \\in \\mathcal {A}, t \\in \\mathcal {V}} w (u, t). \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 325, + 450, + 785, + 484 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The association factor normalizes the cuts by the connected proportion to the entire graph. Through the systematic derivation, the work of Normalized cut [78] shows that minimizing Equation 2 is equivalent to solving an eigenvector system. Let us denote that $\\mathbf{W} \\in \\mathbb{R}^{N \\times N}$ is a symmetric matrix of the non-negative edge weights, and $\\mathbf{D}$ is a diagonal matrix of which diagonal elements correspond to the row-wise sum of $\\mathbf{W}$ . Then the solution of Normalized cut is obtained by solving the following generalized eigenvalue system:", + "bbox": [ + 214, + 494, + 787, + 601 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\n\\left(\\boldsymbol {D} - \\boldsymbol {W}\\right) \\boldsymbol {x} = \\lambda \\boldsymbol {D} \\boldsymbol {x} \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 429, + 612, + 785, + 628 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "and obtaining the eigenvector corresponding to the second-smallest eigenvalue1. Let us denote the eigenvector corresponding to the second-smallest eigenvalue as $\\pmb{z} \\in \\mathbb{R}^N$ . The set of nodes $\\mathcal{V} = \\{v_1, \\dots, v_N\\}$ is divided into $\\mathcal{A}$ and $\\mathcal{B}$ by the following bipartition rule:", + "bbox": [ + 214, + 638, + 787, + 700 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nv _ {n} \\in \\mathcal {A} \\quad \\text {i f} z _ {n} > \\bar {z}, \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 429, + 712, + 785, + 728 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nv _ {n} \\in \\mathcal {B} \\quad \\text {o t h e r w i s e}, \\tag {6}\n$$\n", + "text_format": "latex", + "bbox": [ + 431, + 731, + 785, + 746 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\bar{z}$ means the average of the vector elements of $z$ . For the detailed derivation, please refer to the original paper [78].", + "bbox": [ + 214, + 758, + 782, + 789 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 5 + }, + { + "type": "page_footnote", + "text": "1 The smallest eigenvalue of $D - W$ , i.e., a Laplacian matrix, is always zero. The second-smallest eigenvalue is known as the algebraic connectivity, or Fiedler eigenvalue, and reflects how well connected the graph is.", + "bbox": [ + 217, + 796, + 787, + 839 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/f08b558da06293bdc9496905ccbcbf302656a4eb5ceb48977e96e856a93fcfe7.jpg", + "image_caption": [ + "Fig. 4: The result of Normalized cut [78] before and after refinement." + ], + "image_footnote": [], + "bbox": [ + 243, + 148, + 759, + 238 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Panoptic cut. The unsupervised object mask discovery step inherits the idea of the recent object discovery work [85, 99, 100] based on Normalized cut and is adapted to semantic segmentation. Specifically, the recent work [85, 99, 100] presents to leverage the DINO ViT [11, 26] feature map as an input feature to Normalized cut. As the task of interest is to identify objects and also assign a semantic class for all image pixels, i.e., panoptic segmentation, we call this unsupervised object mask discovery step as Panoptic cut.", + "bbox": [ + 212, + 273, + 785, + 380 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Given an input image, the image is fed to a pre-trained self-supervised DINO ViT to obtain the visual feature map. Following the existing work [1,41,122], we use the intermediate byproduct during the feature feed-forward process as the dense feature map as it is empirically shown to highlight the salient foreground objects. In the last layer of the ViT, the patch token similarity between the key embedding produces an affinity map:", + "bbox": [ + 212, + 380, + 785, + 470 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {W} _ {x x ^ {\\prime}} = \\frac {\\boldsymbol {K} _ {x} ^ {\\top} \\boldsymbol {K} _ {x ^ {\\prime}}}{\\| \\boldsymbol {K} _ {x} \\| _ {2} \\| \\boldsymbol {K} _ {x ^ {\\prime}} \\| _ {2}}, \\tag {7}\n$$\n", + "text_format": "latex", + "bbox": [ + 416, + 477, + 785, + 512 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $x, x'$ indicates feature map index. In the graph partitioning perspective, the set of patch key embeddings correspond to nodes and their cosine similarity values correspond to the edge weights. Such definition of graph is applied to the Normalized cut system in Equation 4.", + "bbox": [ + 212, + 518, + 785, + 577 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The solved system yields two sets of nodes, $\\mathcal{A}$ and $\\mathcal{B}$ . We determine the foreground between them by following the few heuristics from MaskCut [99]. $\\mathcal{A}$ is foreground if a) $\\mathcal{A}$ contains the maximum absolute value in the second smallest eigenvector $z$ and b) $\\mathcal{A}$ is covering less than the two corners of the matrix. Once we determine the foreground between $\\mathcal{A}$ and $\\mathcal{B}$ , then $\\mathcal{A}$ is discovered as an object, and we iterate bipartitioning the rest of the background node set until i) there are less than five nodes left or ii) the iteration count reaches the preset maximum2. After the iteration halts, the undiscovered region is marked as background. We often observe noisy object boundaries or the salt and pepper artifacts such as in Figure 4. We thus fill the holes and refine the output bipartition masks with DenseCRF [49], before the masks are resized to the original image size. We note that the process introduced so far uses neither human annotation nor text entity.", + "bbox": [ + 212, + 578, + 787, + 758 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Panoptic cut distinguishes from the unsupervised object discovery models [85, 99, 100] in that the background region is also semantically segmented.", + "bbox": [ + 212, + 758, + 785, + 790 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 784, + 125 + ], + "page_idx": 6 + }, + { + "type": "page_footnote", + "text": "2 In implementation, the condition i) is rarely met. We empirically observe that DINO features exhibit small activation values on non-salient regions. Consequently, Panoptic cut returns bad bipartitions, which is ignored during the mask refinement process.", + "bbox": [ + 217, + 796, + 785, + 839 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/6f9b4aefc1c34230b20402ff204e73da9db0fa15afea959261f1363aa8e36e5f.jpg", + "table_caption": [ + "Table 1: Benchmarks for open-vocabulary semantic segmentation" + ], + "table_footnote": [], + "table_body": "
With a background categoryWithout background category
VOC21Context60COCO-ObjectVOC20Context59ADE20KCOCO-Stuff
number of classes2160812059150171
", + "bbox": [ + 220, + 170, + 784, + 229 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For example, the sky and ceiling are not often perceived as objects but can be semantically grouped.", + "bbox": [ + 212, + 242, + 782, + 272 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.2 Object Grounding with Class Descriptions in Text", + "text_level": 1, + "bbox": [ + 214, + 295, + 678, + 311 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Object mask grounding with cross-modal similarity. We adopt an image-text multi-modal encoder backbone to assign a text entity to each discovered mask by cross-modal similarity matching. We use the patch embedding of the SCLIP [95] backbone which roughly aligns the local image context with each patch embedding. Given a set of $Y$ text classes, the text class descriptions are fed to the CLIP text encoder to obtain the set of text embeddings: $\\{c_y\\}_{y=1}^Y$ . Note that some benchmarks contain the background class. In these cases, following [95], we feed the background query text descriptions, e.g., wall, sky, etc., to avoid the ambiguous semantic of the text \"background\". The input image is fed to the SCLIP image encoder which returns the feature map: $\\{f_x | x \\in [1, H] \\times [1, W]\\}$ , where $x$ indicates a position. The image features that fall into an object mask region $\\mathcal{M}$ are averaged to construct the object prototype [87, 97]. The class distribution is obtained by the cosine similarity of the object prototype and the text embedding:", + "bbox": [ + 212, + 321, + 787, + 532 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\np \\left(\\boldsymbol {f} _ {x \\in \\mathcal {M}} | y\\right) \\propto \\frac {1}{| \\mathcal {M} |} \\sum_ {x ^ {\\prime} \\in \\mathcal {M}} \\boldsymbol {f} _ {x ^ {\\prime}} ^ {\\top} \\boldsymbol {c} _ {y} \\tag {8}\n$$\n", + "text_format": "latex", + "bbox": [ + 390, + 532, + 785, + 568 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "to assign the text class on the object, i.e., object-wise grounding.", + "bbox": [ + 214, + 574, + 686, + 589 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Segmentation prediction. The class logit map is resized to the input image size by bilinear interpolation. When the background query set is used, the corresponding logits are merged as background. Each object mask is predicted with the highest cross-modal similarity class index.", + "bbox": [ + 212, + 604, + 787, + 666 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4 Experiments", + "text_level": 1, + "bbox": [ + 214, + 690, + 375, + 707 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.1 Experimental Setup", + "text_level": 1, + "bbox": [ + 214, + 723, + 428, + 739 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Implementation details. For the Panoptic cut input source, we use the feature map from DINO ViT-B/8 [11,26] trained on ImageNet1K [75] without labels. To solve the generalized eigenvector system in Equation 4, we use the PyTorch [67] built-in function 1obpcg which is compatible with GPUs. The maximum iteration for Panoptic cut is set to 16. We also use the pre-trained CLIP ViT-B/16 [69] for the image/text feature extractor. For object grounding with CLIP, we adopt", + "bbox": [ + 212, + 750, + 787, + 842 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/a6745357458824444328cd1900cb69beefc8d345254bd490d7145f8d0a98ebe7.jpg", + "image_caption": [ + "Fig. 5: Qualitative comparison of our method and baselines on COCO-stuff 164K. The * mark on the text set denotes the false positive class prediction of our model." + ], + "image_footnote": [], + "bbox": [ + 215, + 147, + 785, + 516 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "the sliding-window segmentation prediction scheme on high-resolution images, which is shown effective from the previous work [12, 95, 108]. We upsample the image as well as the Panoptic cut object masks such that the shorter size of the image becomes 336. The sliding window and the stride are set to $224 \\times 224$ and $112 \\times 112$ , respectively. Then each crop is fed to the image encoder which returns the pixel-level logit map on each cropped window, followed by averaging the logits. The codebase is adopted from SCLIP [95] which is based on mmseg [23]. An Nvidia RTX 3090 GPU is used for all experiments.", + "bbox": [ + 212, + 589, + 787, + 710 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Datasets and benchmarks. We evaluate our method on five publicly available open-vocabulary semantic segmentation datasets: Pascal VOC 2012 [27], Pascal Context [65], ADE20K [118], COCO-Stuff and COCO-Object [56] plus two variants with the background queries. Background queries such as wall, sky, etc. are added on Pascal VOC and Pascal Context, which are indicated as VOC21 and Context60, respectively. We use the background query set from SCLIP [95] and do not engineer it further. Table 1 shows the configuration of the dataset classes.", + "bbox": [ + 212, + 733, + 787, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/a1bb5f8793f30cd0d00da87acb5cf8734366486c6ea483cfd3b245f32456b46c.jpg", + "image_caption": [ + "Fig. 6: Qualitative comparison of our method and others. The first three columns are directly copied from the paper in the third columns [6,7,32,108,110]." + ], + "image_footnote": [], + "bbox": [ + 217, + 143, + 787, + 396 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "For evaluation, we use the standard mean IoU metric: $\\mathrm{mIoU} = \\frac{1}{Y}\\sum_{y}\\mathrm{IoU}_{y}$ , where $\\mathrm{IoU}_y$ denotes an IoU value of $y$ -th class.", + "bbox": [ + 212, + 454, + 787, + 488 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Baseline methods. Vanilla CLIP is the most naive baseline. The set of image patch embeddings and the set of text embeddings are obtained from the pre-trained CLIP image and text encoder backbone, respectively. Cosine similarity between the two sets of embeddings is computed to obtain the cross-modal pixel-wise text similarity, which is directly translated as semantic segmentation prediction. SCLIP [95] is the primary baseline. SCLIP modifies the intermediate function of the attention layers in the pre-trained CLIP ViTs such that the final image patch embedding better represents the corresponding image patch semantics.", + "bbox": [ + 212, + 501, + 787, + 638 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "4.2 Experimental Results", + "text_level": 1, + "bbox": [ + 215, + 662, + 441, + 678 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Qualitative results. We demonstrate the qualitative examples of the model outputs in Figure 5. Our model demonstrates advanced segmentation visuals compared to our baselines. Note that CLIP and SCLIP [95] are pixel-wise dense prediction methods. When segmentation prediction operates at pixel level, it does not necessarily comprehend the object shapes, resulting in noisy segmentation masks of objects. Ours, however, proceeds object mask discovery stage and returns object-level masks. As seen, our model predicts sharper and cleaner delineations that accurately capture semantic object boundaries, e.g., our model segments out the clear shape of the kites in the sky (first image). Other nice properties that our model often exhibits include capturing tiny kites (first im", + "bbox": [ + 212, + 688, + 787, + 843 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/0abf1cf9f7ed31d5f88a99a01d9622930276348824cd04602eebd76c481f72f3.jpg", + "table_caption": [ + "Table 2: Performance (mIoU, %) comparison of the state-of-the-art open-vocabulary segmentation methods on seven public benchmarks. The models with $\\dagger$ do not use CLIP. The models with $\\checkmark$ involve additional training on top of the pretrained backbone. The numerical results [12,61,69,80,110,119] are adopted from SCLIP [95]." + ], + "table_footnote": [], + "table_body": "
MethodtrainWith a background categoryWithout background category
VOC21Context60COCO-Obj.VOC20Context59ADECOCO-Stf.
CLIP [69]18.89.98.149.411.13.15.7
ZeroSeg [15]40.820.420.2----
MaskCLIP [119]43.423.220.674.926.411.916.7
ReCo [80]25.119.915.757.722.311.214.8
CLIPpy [71]52.2-32.0--13.5-
DiffSegmenter† [96]60.127.537.9----
SCLIP [95]59.130.430.580.434.216.122.4
ViL-Seg [59]✓34.416.316.4--11.9-
ViewCo [72]✓52.423.023.5----
MixReorg [7]✓47.923.9-----
GroupViT† [108]✓52.318.727.579.723.410.415.3
TCL [12]✓51.224.330.477.530.314.919.6
OVSegmentor† [110]✓53.820.425.1--5.6-
SegCLIP [61]✓52.624.726.5---
LaVG (ours)62.131.634.282.534.715.823.2
", + "bbox": [ + 220, + 212, + 787, + 449 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "age), segmentation with little spurious correlation (second image), and repeated chairs (third image).", + "bbox": [ + 212, + 486, + 782, + 516 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We also compare various other OVSeg models [6,7,32,108,110] in Figure 6. We copy and paste the visualization on their original papers and present our model's prediction. Thus the results are not much cherry-picked as the choice of visualized images is taken from the other work. Most previous work often presents visualized prediction favorably on Pascal VOC, most of which contain the objects that stand out. Unlike the examples of the other work with incorrect class predictions (the dog in the first image), holes in predicted masks (the second image), and misaligned contour (third example), our model presents much cleaner mask prediction and better class prediction.", + "bbox": [ + 212, + 518, + 787, + 656 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Quantitative comparison with state-of-the-art models. Table 2 compares the existing OVSeg methods on seven public benchmarks. The performance values of MaskCLIP [119], ReCo [38], and TCL [12] are brought from the reimplementation of SCLIP, which are either higher or the same values as the ones in the original papers. The performance values of the rest of work [7,15,59,61,71,72,96, 108,110] are from their original performance reports. Our model outperforms the previous state-of-the-art models. Note that our model outperforms not only the learning-free models [15,38,71,95,119] but also the weakly-supervised learning models [7,12,59,61,72,108,110] that exploits image-text paired datasets, e.g., CC3M [13], YFCC [89], or COCO [56] from the $3.4\\mathrm{M}$ to $26\\mathrm{M}$ dataset scale.", + "bbox": [ + 212, + 688, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/36c73365204f1426e380aa623428b654fcd5a4a7554b237efc2e7e7ed703b36f.jpg", + "table_caption": [ + "Table 3: Comparison with different object mask discovery models" + ], + "table_footnote": [], + "table_body": "
VOC21Context60COCO-Obj.VOC20Context59COCO-Stf.
Normalized cut [78]47.626.328.278.129.320.0
CutLER-CascadedRCNN [99]57.329.333.279.632.222.3
Panoptic cut (4 iterations)61.130.333.781.333.422.6
Panoptic cut (16 iterations)62.131.634.282.534.723.2
Panoptic cut (32 iterations)61.431.734.282.634.823.3
Ground-truth object masks68.337.144.187.740.227.6
", + "bbox": [ + 220, + 170, + 784, + 276 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/53389534d54a72fd95fc96960cc3442996de1f1c062c5ea71c935aa5e46fa821.jpg", + "table_caption": [ + "Table 4: Comparison with different grounding schemes. $\\mathcal{O}$ denotes object mask region." + ], + "table_footnote": [], + "table_body": "
VOC21Context60COCO-ObjectVOC20Context59COCO-Stuff
O-masked attention54.626.927.661.728.218.3
Gaussian blur on non-O59.830.931.571.633.421.5
O-averaged prototype62.131.634.282.534.723.2
", + "bbox": [ + 220, + 320, + 789, + 388 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "4.3 Experimental Analyses", + "text_level": 1, + "bbox": [ + 215, + 422, + 452, + 436 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We ablate the components in our method and see their effectiveness. In tables, our method is colored in gray.", + "bbox": [ + 212, + 454, + 784, + 484 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Comparison with other object mask discovery models. To verify the strength of Panoptic cut in segmentation, we compare Panoptic cut with other object discovery models and compare them in Table 3. Among the modern object discovery neural networks, CutLER [99] is compared. CutLER first produces object mask proposals with a derivative of Normalized cut (MaskCut) and uses the proposals as self-supervision to train an unsupervised instance segmentation & object detection architecture, e.g., Cascaded-RCNN [8]. To adapt CutLER to semantic segmentation, the undetected pixels are considered as a single region and averaged at the feature level as background. The naïve adoption of the state-of-the-art object discovery method does not directly translate to high open-vocabulary segmentation performance. We observe that CutLER tends to detect fine-grained parts of foreground objects while leaving the background under-segmented, e.g., undetected sky and sea grouped together, probably because the training objective is to detect foreground objects. Although this model achieves promising performance that beats most of the methods in Table 2 but is lower than Panoptic cut. Panoptic cut produces proper semantic segmentation of background, plus, it requires no additional training. We believe that Panoptic cut is a more suitable choice than instance detection or salient detection methods [36] for semantic segmentation, where all the present pixels should be classified for segmentation. Panoptic cut iterates the preset number of iterations, where we gain from $0.5\\%$ to $1.3\\%$ point mIoU gain from maximum of 4 to 16 iterations.", + "bbox": [ + 212, + 507, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/be14fa0c2741dcfd4256b4b785429483e4affd557f3e5fe8afe9f551b2e06696.jpg", + "table_caption": [ + "Table 5: Comparison of computational cost measured with an Nvidia RTX 3090. The columns with $\\dagger$ are taken from [21]." + ], + "table_footnote": [], + "table_body": "
methodsZSSeg [111]†CATseg [21]†DiffSegmenter [96]LaVG
# learnable params. (M)102.870.300
# total params. (M)530.8433.71453198
training time (min)958.5875.500
inference time (s)2.730.540.5912.59
", + "bbox": [ + 245, + 184, + 756, + 271 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Comparison with different grounding schemes. We explore different grounding schemes and compare them on Table 4. Specifically, three object embedding methods are compared, all based on the SCLIP feature. First, object-masked $\\mathcal{O}$ -masked attention [18, 40, 44] forces the forward path of ViTs to attend only to the designated region. We zero out the non-object region on the input image and set a large negative value on the non-object pixel patch embedding before the softmax in the attention in the ViT backbone. Recent work [81] explores a way to explicitly draw attention on the input image level in a human-friendly manner. We adopt their idea of applying Gaussian blur on the non-object regions on the input image and taking the global image representation as the local feature. Note that these two schemes require multiple feed-forward passes with the same image with different attention masks and different Gaussian blurred regions. Our method (the last line) is the simplest: averaging the region patch embedding (Eq. 8). The object-averaged prototype shows superior performance in terms of both end-task accuracy and complexity.", + "bbox": [ + 212, + 299, + 799, + 526 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Computational complexity. Table 5 compares the computational cost of LaVG with a training-free model [96] and trained models [21, 111]. The outstanding advantage of training-free models is the computational efficiency from the absence of time, data, and computation burden in additional training. Compared to another training-free ovseg method [96] based on diffusion models [73] which leverages image/caption generation models with heavy parameters, we use much more lightweight feature embedding models. However, our iterative process of panoptic cut introduces a longer inference time.", + "bbox": [ + 212, + 544, + 787, + 666 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.4 Limitations of our approach", + "text_level": 1, + "bbox": [ + 215, + 690, + 493, + 707 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We outline four characteristic limitations of our method. The intrinsic problem of our method is the extensive computation time and memory consumption induced by leveraging the graph-based partitioning algorithm. Normalized cut generally consumes the excessive use of memory due to the use of $N \\times N$ size affinity matrix. For example, running Normalized cut on a $512 \\times 512$ RGB image directly leads to the out-of-memory error. However, using a well-abstracted downsampled feature map of the DINO attention greatly reduces the memory consumption and smoothly executes on a single regular GPU device, e.g., Nvidia RTX 3090. Also,", + "bbox": [ + 212, + 718, + 787, + 840 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "our approach is inference-only thus includes no training time, which is still more computationally efficient than training models.", + "bbox": [ + 212, + 146, + 785, + 176 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In terms of the end-task performance, we witness the remarkable qualitative improvement as seen in Figures 5-6, but it does not directly enhance mIoU values substantially. This is because the evaluation metric is pixel-level classification rather than favoring aligned edges or clean shapes of objects. In addition, the proposed method occasionally misclassifies objects which also negatively affects the mIoU performance.", + "bbox": [ + 212, + 178, + 787, + 268 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Another limitation is qualitatively observed in the last example of Figure 5. Due to the sliding-window segmentation inference technique, the cropped region suffers the part-whole ambiguity issue and sometimes predicts a wrong class on the region. This side effect is often observed on textureless regions, e.g., the model confuses the sky and cloud in the last example of Figure 5. However, the recognition of the image as a whole might remedy the part-whole ambiguity, but the accuracy of the small-resolution images drops at the same time.", + "bbox": [ + 212, + 270, + 787, + 377 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lastly, out method implemented with CLIP is potentially inappropriate for closed-vocabulary segmentation on specialized domains such as medical or industrial vision. For such problems on specific domains, however, the concept of lazy grounding can be used with domain-specific encoders.", + "bbox": [ + 212, + 378, + 787, + 439 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 470, + 357, + 488 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We have proposed Lazy Visual Grounding, a late-interaction semantic segmentation approach, for open-vocabulary semantic segmentation. Our method first proceeds unsupervised object mask discovery by graph partitioning and the lazy grounding on the discovered object masks. This simple and training-free method exceeds the performance of the caption-based weakly-supervised learning models. Given the observation that the classic graph partitioning method surpasses such trendy deep-learning models, we claim that semantic pixel-grouping is crucial for semantic segmentation and should be prioritized especially when segmentation supervision is not available. Last but not least, given the output format of our method is object-level and hence identifiable, LaVG provides more accurate and crisp object boundaries, which makes it particularly suitable for grounding tasks that require object-level recognition with precise boundaries. This work may open the door for training-free open-vocabulary instance segmentation, which has not been actively studied, yet.", + "bbox": [ + 212, + 512, + 787, + 724 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements. This work was supported by Samsung Electronics (IO20 1208-07822-01), the NRF grant (NRF-2021R1A2C3012728 $(45\\%)$ ), and the IITP grants (RS-2022-II220959: Few-Shot Learning of Causal Inference in Vision and Language for Decision Making $(50\\%)$ , RS-2019-II191906: AI Graduate School Program at POSTECH $(5\\%)$ ) funded by Ministry of Science and ICT, Korea. We also thank Sua Choi for her helpful discussion.", + "bbox": [ + 212, + 748, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 143, + 321, + 159 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv preprint arXiv:2112.05814 2(3), 4 (2021) 7", + "2. Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: From contours to regions: An empirical evaluation. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2294-2301. IEEE (2009) 2", + "3. Blake, A., Kohli, P., Rother, C.: Markov random fields for vision and image processing. MIT press (2011) 2", + "4. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on pattern analysis and machine intelligence 23(11), 1222-1239 (2001) 2", + "5. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4", + "6. Bucher, M., Vu, T.H., Cord, M., Pérez, P.: Zero-shot semantic segmentation. Advances in Neural Information Processing Systems 32 (2019) 2, 10, 11", + "7. Cai, K., Ren, P., Zhu, Y., Xu, H., Liu, J., Li, C., Wang, G., Liang, X.: Mixreorg: Cross-modal mixed patch reorganization is a good mask learner for open-world semantic segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1196-1205 (2023) 3, 5, 10, 11", + "8. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018) 4, 12", + "9. Caron, M., Bojanowski, P., Joulin, A., Douze, M.: Deep clustering for unsupervised learning of visual features. In: Proc. European Conference on Computer Vision (ECCV) (2018) 4", + "10. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4", + "11. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2021) 2, 4, 7, 8", + "12. Cha, J., Mun, J., Roh, B.: Learning to generate text-grounded mask for open-world semantic segmentation from only image-text pairs. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2, 3, 5, 9, 11", + "13. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12m: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3558-3568 (2021) 3, 11", + "14. Chen, C.W., Luo, J., Parker, K.J.: Image segmentation via adaptive k-mean clustering and knowledge-based morphological operations with biomedical applications. IEEE transactions on image processing 7(12), 1673-1683 (1998) 2", + "15. Chen, J., Zhu, D., Qian, G., Ghanem, B., Yan, Z., Zhu, C., Xiao, F., Elhoseiny, M., Culatana, S.C.: Exploring open-vocabulary semantic segmentation from clip vision encoder distillation only. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 3, 5, 11" + ], + "bbox": [ + 225, + 178, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "16. Chen, L.C., Papandreou, G., Kokkinos, I., Murphy, K., Yuille, A.L.: Deeplab: Semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected crfs. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2017) 2, 5", + "17. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020) 4", + "18. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1290-1299 (2022) 5, 13", + "19. Cheng, B., Schwing, A.G., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation (2021) 2, 5", + "20. Cho, M., Kwak, S., Schmid, C., Ponce, J.: Unsupervised object discovery and localization in the wild: Part-based matching with bottom-up region proposals. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1201-1210 (2015) 2, 4", + "21. Cho, S., Shin, H., Hong, S., An, S., Lee, S., Arnab, A., Seo, P.H., Kim, S.: Cat-seg: Cost aggregation for open-vocabulary semantic segmentation (2023) 5, 13", + "22. Choi, S., Kang, D., Cho, M.: Contrastive mean-shift learning for generalized category discovery. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4", + "23. Contributors, M.: MMSegmentation: Openmmlab semantic segmentation toolbox and benchmark. https://github.com/open-mmlab/mmsegmentation (2020) 9", + "24. Cordts, M., Omran, M., Ramos, S., Rehfeld, T., Enzweiler, M., Benenson, R., Franke, U., Roth, S., Schiele, B.: The cityscapes dataset for semantic urban scene understanding. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 2", + "25. Ding, Z., Wang, J., Tu, Z.: Open-vocabulary universal image segmentation with maskclip. Proc. International Conference on Machine Learning (ICML) (2023) 5", + "26. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: Proc. International Conference on Learning Representations (ICLR) (2021) 7, 8", + "27. Everingham, M., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes (voc) challenge. International Journal of Computer Vision (IJCV) (2010) 2, 9", + "28. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 5", + "29. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5", + "30. Grauman, K., Darrell, T.: Unsupervised learning of categories from sets of partially matching image features. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 1, pp. 19-25. IEEE (2006) 4", + "31. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap your own latent-a new approach to self-supervised learning. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4" + ], + "bbox": [ + 225, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "32. Gu, Z., Zhou, S., Niu, L., Zhao, Z., Zhang, L.: Context-aware feature generation for zero-shot semantic segmentation. In: Proceedings of the 28th ACM International Conference on Multimedia. pp. 1921-1929 (2020) 10, 11", + "33. Gui, J., Chen, T., Cao, Q., Sun, Z., Luo, H., Tao, D.: A survey of self-supervised learning from multiple perspectives: Algorithms, theory, applications and future trends. arXiv preprint arXiv:2301.05712 (2023) 4", + "34. Gupta, A., Dollar, P., Girshick, R.: Lvis: A dataset for large vocabulary instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5356-5364 (2019) 2", + "35. He, K., Gkioxari, G., Dollár, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017) 4", + "36. Hsu, K.J., Tsai, C.C., Lin, Y.Y., Qian, X., Chuang, Y.Y.: Unsupervised cnn-based co-saliency detection with graphical optimization. In: Proceedings of the European conference on computer vision (ECCV). pp. 485-501 (2018) 12", + "37. Huang, S., Gong, B., Pan, Y., Jiang, J., Lv, Y., Li, Y., Wang, D.: Vop: Text-video co-operative prompt tuning for cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6565-6574 (June 2023) 5", + "38. Iscen, A., Caron, M., Fathi, A., Schmid, C.: Retrieval-enhanced contrastive vision-text models. Advances in Neural Information Processing Systems (NeurIPS) (2023) 3, 5, 11", + "39. Jing, L., Tian, Y.: Self-supervised visual feature learning with deep neural networks: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2020) 4", + "40. Kang, D., Cho, M.: Integrative few-shot learning for classification and segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9979-9990 (2022) 13", + "41. Kang, D., Koniusz, P., Cho, M., Murray, N.: Distilling self-supervised vision transformers for weakly-supervised few-shot classification & segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4, 7", + "42. Karazija, L., Laina, I., Vedaldi, A., Rupprecht, C.: Diffusion models for zero-shot open-vocabulary segmentation. arXiv preprint arXiv:2306.09316 (2023) 5", + "43. Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International journal of computer vision 1(4), 321-331 (1988) 2", + "44. Kenton, J.D.M.W.C., Toutanova, L.K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of NAACL-HLT (2019) 13", + "45. Kim, S., Kang, M., Park, J.: Risclip: Referring image segmentation framework using clip. arXiv preprint arXiv:2306.08498 (2023) 5", + "46. Kirillov, A., He, K., Girshick, R., Rother, C., Dollar, P.: Panoptic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9404-9413 (2019) 3", + "47. Kirillov, A., Levinkov, E., Andres, B., Savchynskyy, B., Rother, C.: Instancecut: from edges to instances with multicut. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5008-5017 (2017) 2", + "48. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) 2" + ], + "bbox": [ + 225, + 146, + 784, + 839 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "49. Krahenbuhl, P., Koltun, V.: Efficient inference in fully connected crfs with gaussian edge potentials. Advances in neural information processing systems 24 (2011) 7", + "50. Lee, Y.J., Grauman, K.: Shape discovery from unlabeled image collections. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2254-2261. IEEE (2009) 4", + "51. Li, B., Shi, Y., Qi, Z., Chen, Z.: A survey on semantic segmentation. In: 2018 IEEE International Conference on Data Mining Workshops (ICDMW). pp. 1233-1240. IEEE (2018) 2", + "52. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: International Conference on Learning Representations (2022), https://openreview.net/forum?id=RriDjddCLN 2, 5", + "53. Li, Z., Chen, J.: Superpixel segmentation using linear spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1356-1363 (2015) 2", + "54. Li, Z., Zhou, Q., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Open-vocabulary object segmentation with diffusion models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 5", + "55. Liang, F., Wu, B., Dai, X., Li, K., Zhao, Y., Zhang, H., Zhang, P., Vajda, P., Marculescu, D.: Open-vocabulary semantic segmentation with mask-adapted clip. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5", + "56. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Proc. European Conference on Computer Vision (ECCV) (2014) 2, 3, 9, 11", + "57. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. In: NeurIPS (2023) 4", + "58. Liu, H., Son, K., Yang, J., Liu, C., Gao, J., Lee, Y.J., Li, C.: Learning customized visual models with retrieval-augmented knowledge. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15148-15158 (2023) 5", + "59. Liu, Q., Wen, Y., Han, J., Xu, C., Xu, H., Liang, X.: Open-world semantic segmentation via contrasting and clustering vision-language embedding. In: Proc. European Conference on Computer Vision (ECCV) (2022) 3, 5, 11", + "60. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2015) 2, 5", + "61. Luo, H., Bao, J., Wu, Y., He, X., Li, T.: Segclip: Patch aggregation with learnable centers for open-vocabulary semantic segmentation. In: Proc. International Conference on Machine Learning (ICML) (2023) 3, 5, 11", + "62. Ma, H., Zhao, H., Lin, Z., Kale, A., Wang, Z., Yu, T., Gu, J., Choudhary, S., Xie, X.: Ei-clip: Entity-aware interventional contrastive learning for e-commerce cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18051–18061 (2022) 5", + "63. Ma, T., Geng, S., Wang, M., Shao, J., Lu, J., Li, H., Gao, P., Qiao, Y.: A simple long-tailed recognition baseline via vision-language model. arXiv preprint arXiv:2111.14745 (2021) 5", + "64. Ma, T., Geng, S., Wang, M., Xu, S., Li, H., Zhang, B., Gao, P., Qiao, Y.: Unleashing the potential of vision-language models for long-tailed visual recognition (2022) 5" + ], + "bbox": [ + 223, + 146, + 784, + 839 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 17 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "65. Mottaghi, R., Chen, X., Liu, X., Cho, N.G., Lee, S.W., Fidler, S., Urtasun, R., Yuille, A.: The role of context for object detection and semantic segmentation in the wild. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2014) 9", + "66. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2015) 2", + "67. Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A.: Automatic differentiation in pytorch. In: Advances in Neural Information Processing Systems (NeurIPS) Workshop Autodiff (2017) 8", + "68. Pizer, S.M., Amburn, E.P., Austin, J.D., Cromartie, R., Geselowitz, A., Greer, T., ter Haar Romeny, B., Zimmerman, J.B., Zuiderveld, K.: Adaptive histogram equalization and its variations. Computer vision, graphics, and image processing 39(3), 355-368 (1987) 2", + "69. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Proc. International Conference on Machine Learning (ICML) (2021) 2, 4, 8, 11", + "70. Rambhatla, S.S., Misra, I., Chellappa, R., Shrivastava, A.: Most: Multiple object localization with self-supervised transformers for object discovery. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 4", + "71. Ranasinghe, K., McKinzie, B., Ravi, S., Yang, Y., Toshev, A., Shlens, J.: Perceptual grouping in contrastive vision-language models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 3, 11", + "72. Ren, P., Li, C., Xu, H., Zhu, Y., Wang, G., Liu, J., Chang, X., Liang, X.: Viewco: Discovering text-supervised segmentation masks via multi-view semantic consistency. arXiv preprint arXiv:2302.10307 (2023) 3, 5, 11", + "73. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models (2021) 13", + "74. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: International Conference on Medical image computing and computer-assisted intervention (2015) 2", + "75. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International Journal of Computer Vision (IJCV) 115(3), 211-252 (2015) 8", + "76. Russell, B.C., Freeman, W.T., Efros, A.A., Sivic, J., Zisserman, A.: Using multiple segmentations to discover objects and their extent in image collections. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 2, pp. 1605-1614. IEEE (2006) 4", + "77. Seitzer, M., Horn, M., Zadaianchuk, A., Zietlow, D., Xiao, T., Simon-Gabriel, C.J., He, T., Zhang, Z., Scholkopf, B., Brox, T., et al.: Bridging the gap to real-world object-centric learning. arXiv preprint arXiv:2209.14860 (2022) 4", + "78. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence 22(8), 888-905 (2000) 2, 4, 6, 7, 12", + "79. Shin, G., Albanie, S., Xie, W.: Unsupervised salient object detection with spectral cluster voting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3971-3980 (2022) 4", + "80. Shin, G., Xie, W., Albanie, S.: Reco: Retrieve and co-segment for zero-shot transfer. Advances in Neural Information Processing Systems (NeurIPS) (2022) 11" + ], + "bbox": [ + 225, + 146, + 784, + 839 + ], + "page_idx": 18 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 18 + }, + { + "type": "page_number", + "text": "19", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 18 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "81. Shtedritski, A., Rupprecht, C., Vedaldi, A.: What does clip know about a red circle? visual prompt engineering for vlms. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 13", + "82. Simeoni, O., Puy, G., Vo, H.V., Roburin, S., Gidaris, S., Bursuc, A., Pérez, P., Marlet, R., Ponce, J.: Localizing objects with self-supervised transformers and no labels. In: Proc. British Machine Vision Conference (BMVC) (2021) 2, 4", + "83. Simeoni, O., Sekkat, C., Puy, G., Vobecky, A., Zablocki, E., Pérez, P.: Unsupervised object localization: Observing the background to discover objects. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3176-3186 (2023) 4", + "84. Simeoni, O., Zablocki, E., Gidaris, S., Puy, G., Pérez, P.: Unsupervised object localization in the era of self-supervised vits: A survey. arXiv preprint arXiv:2310.12904 (2023) 4", + "85. Singh, S., Deshmukh, S., Sarkar, M., Krishnamurthy, B.: Locate: Self-supervised object discovery via flow-guided graph-cut and bootstrapped self-training. Proc. British Machine Vision Conference (BMVC) (2023) 4, 7", + "86. Sivic, J., Russell, B.C., Efros, A.A., Zisserman, A., Freeman, W.T.: Discovering objects and their location in images. In: Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1. vol. 1, pp. 370-377. IEEE (2005) 4", + "87. Snell, J., Swersky, K., Zemel, R.: Prototypical networks for few-shot learning. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 8", + "88. Thoma, M.: A survey of semantic segmentation. arXiv preprint arXiv:1602.06541 (2016) 2", + "89. Thomee, B., Shamma, D.A., Friedland, G., Elizalde, B., Ni, K., Poland, D., Borth, D., Li, L.J.: Yfcc100m: The new data in multimedia research. Communications of the ACM 59(2), 64-73 (2016) 3, 11", + "90. Tian, C., Wang, W., Zhu, X., Dai, J., Qiao, Y.: Vl-ltr: Learning class-wise visual-linguistic representation for long-tailed visual recognition. In: European Conference on Computer Vision. Springer (2022) 5", + "91. Tuytelaars, T., Lampert, C.H., Blaschko, M.B., Buntine, W.: Unsupervised object discovery: A comparison. International Journal of Computer Vision (IJCV) (2010) 3", + "92. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 4", + "93. Vo, H.V., Bach, F., Cho, M., Han, K., LeCun, Y., Pérez, P., Ponce, J.: Unsupervised image matching and object discovery as optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8287-8296 (2019) 2, 4", + "94. Vo, H.V., Pérez, P., Ponce, J.: Toward unsupervised, multi-object discovery in large-scale image collections. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIII 16. pp. 779-795. Springer (2020) 2, 4", + "95. Wang, F., Mei, J., Yuille, A.: Sclip: Rethinking self-attention for dense vision-language inference. arXiv preprint arXiv:2312.01597 (2023) 1, 2, 3, 5, 8, 9, 10, 11", + "96. Wang, J., Li, X., Zhang, J., Xu, Q., Zhou, Q., Yu, Q., Sheng, L., Xu, D.: Diffusion model is secretly a training-free open vocabulary semantic segmenter. arXiv preprint arXiv:2309.02773 (2023) 5, 11, 13" + ], + "bbox": [ + 223, + 146, + 785, + 839 + ], + "page_idx": 19 + }, + { + "type": "page_number", + "text": "20", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 19 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 19 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "97. Wang, K., Liew, J.H., Zou, Y., Zhou, D., Feng, J.: Panet: Few-shot image semantic segmentation with prototype alignment. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 8", + "98. Wang, X., Yu, Z., De Mello, S., Kautz, J., Anandkumar, A., Shen, C., Alvarez, J.M.: Freesolo: Learning to segment objects without annotations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14176-14186 (2022) 4", + "99. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3124-3134 (2023) 2, 4, 7, 12", + "100. Wang, Y., Shen, X., Hu, S.X., Yuan, Y., Crowley, J.L., Vaufreydaz, D.: Self-supervised transformers for unsupervised object discovery using normalized cut. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14543-14553 (2022) 2, 4, 7", + "101. Wang, Z., Lu, Y., Li, Q., Tao, X., Guo, Y., Gong, M., Liu, T.: Cris: Clip-driven referring image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11686-11695 (2022) 5", + "102. Weber, M., Welling, M., Perona, P.: Towards automatic discovery of object categories. In: Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No. PR00662). vol. 2, pp. 101-108. IEEE (2000) 4", + "103. Wei, Y., Cao, Y., Zhang, Z., Peng, H., Yao, Z., Xie, Z., Hu, H., Guo, B.: iclip: Bridging image classification and contrastive language-image pre-training for visual recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5", + "104. Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE transactions on pattern analysis and machine intelligence 15(11), 1101-1113 (1993) 2, 6", + "105. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018) 4", + "106. Wysoczanska, M., Siméoni, O., Ramamonjisoa, M., Bursuc, A., Trzciński, T., Pérez, P.: Clip-dinoiser: Teaching clip a few dino tricks. arXiv preprint arXiv:2312.12359 (2023) 5", + "107. Xian, Y., Choudhury, S., He, Y., Schiele, B., Akata, Z.: Semantic projection network for zero-and few-label semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8256-8265 (2019) 2", + "108. Xu, J., De Mello, S., Liu, S., Byeon, W., Breuel, T., Kautz, J., Wang, X.: Groupvit: Semantic segmentation emerges from text supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 5, 9, 10, 11", + "109. Xu, J., Liu, S., Vahdat, A., Byeon, W., Wang, X., De Mello, S.: Open-vocabulary panoptic segmentation with text-to-image diffusion models. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5", + "110. Xu, J., Hou, J., Zhang, Y., Feng, R., Wang, Y., Qiao, Y., Xie, W.: Learning open-vocabulary semantic segmentation models from natural language supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 3, 5, 10, 11", + "111. Xu, M., Zhang, Z., Wei, F., Lin, Y., Cao, Y., Hu, H., Bai, X.: A simple baseline for open-vocabulary semantic segmentation with pre-trained vision-language model." + ], + "bbox": [ + 217, + 146, + 784, + 839 + ], + "page_idx": 20 + }, + { + "type": "header", + "text": "Lazy Visual Grounding", + "bbox": [ + 573, + 114, + 730, + 128 + ], + "page_idx": 20 + }, + { + "type": "page_number", + "text": "21", + "bbox": [ + 767, + 114, + 782, + 126 + ], + "page_idx": 20 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5, 13", + "112. Yin, Z., Wang, P., Wang, F., Xu, X., Zhang, H., Li, H., Jin, R.: Transfgu: a top-down approach to fine-grained unsupervised semantic segmentation. In: Proc. European Conference on Computer Vision (ECCV) (2022) 4", + "113. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022) 4", + "114. Yuan, L., Chen, D., Chen, Y.L., Codella, N., Dai, X., Gao, J., Hu, H., Huang, X., Li, B., Li, C., et al.: Florence: A new foundation model for computer vision. arXiv preprint arXiv:2111.11432 (2021) 4", + "115. Zadaianchuk, A., Kleindessner, M., Zhu, Y., Locatello, F., Brox, T.: Unsupervised semantic segmentation with self-supervised object-centric representations. Proc. International Conference on Learning Representations (ICLR) (2023) 4", + "116. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4", + "117. Zhang, Q., Wu, Y.N., Zhu, S.C.: Mining and-or graphs for graph matching and object discovery. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 55-63 (2015) 4", + "118. Zhou, B., Zhao, H., Puig, X., Xiao, T., Fidler, S., Barriuso, A., Torralba, A.: Semantic understanding of scenes through the ade20k dataset. International Journal of Computer Vision (IJCV) (2019) 2, 9", + "119. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 3, 5, 11", + "120. Zhu, J.Y., Wu, J., Xu, Y., Chang, E., Tu, Z.: Unsupervised object class discovery via saliency-guided multiple class learning. IEEE transactions on pattern analysis and machine intelligence 37(4), 862-875 (2014) 4", + "121. Zhuang, C., Zhai, A.L., Yamins, D.: Local aggregation for unsupervised learning of visual embeddings. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 4", + "122. Ziegler, A., Asano, Y.M.: Self-supervised learning of object parts for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4, 7" + ], + "bbox": [ + 217, + 146, + 784, + 618 + ], + "page_idx": 21 + }, + { + "type": "page_number", + "text": "22", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 21 + }, + { + "type": "header", + "text": "Kang and Cho", + "bbox": [ + 271, + 114, + 370, + 128 + ], + "page_idx": 21 + } +] \ No newline at end of file diff --git a/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_model.json b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_model.json new file mode 100644 index 0000000000000000000000000000000000000000..9ba6ff8fe3b25b21836797b6bd297d708e4ae890 --- /dev/null +++ b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_model.json @@ -0,0 +1,3610 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.245, + 0.142, + 0.761, + 0.187 + ], + "angle": 0, + "content": "In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation" + }, + { + "type": "text", + "bbox": [ + 0.399, + 0.215, + 0.605, + 0.23 + ], + "angle": 0, + "content": "Dahyun Kang Minsu Cho" + }, + { + "type": "text", + "bbox": [ + 0.258, + 0.247, + 0.746, + 0.277 + ], + "angle": 0, + "content": "Pohang University of Science and Technology (POSTECH), South Korea https://cvlab.postech.ac.kr/research/azygrounding" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.328, + 0.744, + 0.522 + ], + "angle": 0, + "content": "Abstract. We present Lazy Visual Grounding for open-vocabulary semantic segmentation, which decouples unsupervised object mask discovery from object grounding. Plenty of the previous art casts this task as pixel-to-text classification without object-level comprehension, leveraging the image-to-text classification capability of pretrained vision-and-language models. We argue that visual objects are distinguishable without the prior text information as segmentation is essentially a visual understanding task. Lazy visual grounding first discovers object masks covering an image with iterative Normalized cuts and then later assigns text on the discovered objects in a late interaction manner. Our model requires no additional training yet shows great performance on five public datasets: Pascal VOC, Pascal Context, COCO-object, COCO-stuff, and ADE 20K. Especially, the visually appealing segmentation results demonstrate the model capability to localize objects precisely." + }, + { + "type": "text", + "bbox": [ + 0.262, + 0.538, + 0.741, + 0.566 + ], + "angle": 0, + "content": "Keywords: Unsupervised object discovery \\(\\cdot\\) Training-free \\(\\cdot\\) Open-vocabulary semantic segmentation \\(\\cdot\\) CLIP" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.594, + 0.789, + 0.743 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.754, + 0.789, + 0.825 + ], + "angle": 0, + "content": "Fig. 1: Comparison of a pixel-grounding method and our object-grounding one. A pixel-grounding method (SCLIP [95]) often produces spurious correlations with imprecise edges. Instead of casting open-vocabulary semantic segmentation as pixel-to-text classification, we solve this task with lazy visual grounding: a two-step approach of object mask discovery followed by object grounding in a late interaction manner." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.377, + 0.161 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.176, + 0.788, + 0.326 + ], + "angle": 0, + "content": "Image segmentation is a fundamental task in computer vision, aiming to partition an image into multiple segments with coherent characteristics [51, 88]. The classic approach to the problem is to collect nearby image pixels with shared characteristics using graph partitioning [3, 4, 78], feature clustering [14, 104], histogram equalization [68], edge detection [2, 43]. Deep neural networks for image segmentation [16, 19, 60, 66, 74] have relied on segmentation datasets of pixel-level class supervision [24, 27, 34, 48, 56, 118] via fully-supervised training with the annotated classes. However, such models are trained with the fixed set of classes hence unable to recognize unseen classes beyond the predefined set of seen classes." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.327, + 0.788, + 0.614 + ], + "angle": 0, + "content": "The task of open-vocabulary semantic segmentation (OVSeg) [6,28,52,107, 108] is an image segmentation task of which classes are grounded with text. OVSeg aims to align image segments with potentially unseen classes described in text, spanning the modality of image segmentation to multi-modal. To solve this task, image-text encoders such as CLIP [69] are often used to recognize the text descriptions. A line of work [12,15,95,119] leverages its alignment of image patch and text embeddings to solve OVSeg by pixel-to-text similarity matching. However, this pixel-level classification approach lacks object comprehension, thus this approach often fails to distinguish objects (cf. Figure 1). This is probably because CLIP is trained to represent the holistic image through a separate CLS token embedding, and the patch embeddings are not explicitly trained to represent the corresponding image patch. The imprecise segmentation visuals of these modern multi-modal segmentation models encourage us to revisit the classic computer vision techniques - regarding an image with a bag of segmentable visual units. Imagine a four-legged animal on grass that we want to segment out. Do we need to know its name before segmentation? Having been approached since decades ago, image segmentation is primarily a vision task, and we argue that the objects can be distinguished as visual units given the vision input only without knowing their names in text." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.614, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Our approach, dubbed Lazy Visual Grounding (LaVG), first partitions an image into image segments with a classical image segmentation method, which is based on the vision input and no textual priors on the target classes. The text entity is later assigned to the partitioned segments. For image segmentation, we revisit the related task of unsupervised object discovery [20,82,93,94] which aims to identify visual units. The unsupervised object discovery methods aim to distinguish visual units in bounding boxes or object masks without semantic priors such as classes. Following the recent unsupervised object discovery methods [70, 99, 100], we retrocede the Normalized Cut [78] algorithm. Normalized cut bipartitions a weighted graph into two subgraphs such that the affinity between the two balanced parted groups is minimal. Following the recent object discovery approach [47,53,99,100], we apply Normalized cut on the outputs of a self-supervised vision transformer, DINO [11], which present an empirical property that attends to the salient object region. We iteratively apply Normalized cut until the identified segments cover all image pixels for semantic segmenta" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.393, + 0.223 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.393, + 0.144, + 0.508, + 0.214 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.144, + 0.619, + 0.214 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.144, + 0.785, + 0.215 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.223, + 0.393, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.393, + 0.214, + 0.508, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.214, + 0.619, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.619, + 0.214, + 0.785, + 0.289 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.291, + 0.305, + 0.309 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.305, + 0.291, + 0.308, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.31, + 0.291, + 0.314, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.316, + 0.291, + 0.331, + 0.3 + ], + "angle": 0, + "content": "#" + }, + { + "type": "image", + "bbox": [ + 0.332, + 0.291, + 0.336, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.338, + 0.291, + 0.352, + 0.3 + ], + "angle": 0, + "content": "\\( \\therefore m = \\frac{3}{11} \\)" + }, + { + "type": "image", + "bbox": [ + 0.353, + 0.291, + 0.365, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.367, + 0.291, + 0.381, + 0.3 + ], + "angle": 0, + "content": "#" + }, + { + "type": "image", + "bbox": [ + 0.382, + 0.291, + 0.386, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.39, + 0.291, + 0.403, + 0.3 + ], + "angle": 0, + "content": "\\( {19}/{19} \\)" + }, + { + "type": "image", + "bbox": [ + 0.404, + 0.291, + 0.408, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.411, + 0.291, + 0.424, + 0.3 + ], + "angle": 0, + "content": "\\( \\frac{1}{2} = \\)" + }, + { + "type": "image", + "bbox": [ + 0.425, + 0.291, + 0.43, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.433, + 0.291, + 0.446, + 0.3 + ], + "angle": 0, + "content": "\\( \\therefore m = \\frac{3}{11} \\)" + }, + { + "type": "image", + "bbox": [ + 0.447, + 0.291, + 0.452, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.46, + 0.291, + 0.465, + 0.3 + ], + "angle": 0, + "content": "\\( \\therefore m = \\frac{3}{11} \\)" + }, + { + "type": "image", + "bbox": [ + 0.467, + 0.291, + 0.472, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.48, + 0.291, + 0.484, + 0.3 + ], + "angle": 0, + "content": "1" + }, + { + "type": "image", + "bbox": [ + 0.486, + 0.291, + 0.49, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.494, + 0.291, + 0.507, + 0.3 + ], + "angle": 0, + "content": "…" + }, + { + "type": "image", + "bbox": [ + 0.508, + 0.291, + 0.513, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.52, + 0.291, + 0.534, + 0.3 + ], + "angle": 0, + "content": "a p" + }, + { + "type": "image", + "bbox": [ + 0.536, + 0.291, + 0.541, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.545, + 0.291, + 0.559, + 0.3 + ], + "angle": 0, + "content": "on wi" + }, + { + "type": "image", + "bbox": [ + 0.56, + 0.291, + 0.565, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.57, + 0.291, + 0.584, + 0.3 + ], + "angle": 0, + "content": "\\( {a}_{4}^{3} = {7}^{3} \\cdot {2}^{4} \\)" + }, + { + "type": "image", + "bbox": [ + 0.586, + 0.291, + 0.59, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.594, + 0.291, + 0.608, + 0.3 + ], + "angle": 0, + "content": "…" + }, + { + "type": "image", + "bbox": [ + 0.609, + 0.291, + 0.613, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.62, + 0.291, + 0.634, + 0.3 + ], + "angle": 0, + "content": "…" + }, + { + "type": "image", + "bbox": [ + 0.636, + 0.291, + 0.641, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.645, + 0.291, + 0.659, + 0.3 + ], + "angle": 0, + "content": "\\( \\therefore m = \\frac{3}{11} \\)" + }, + { + "type": "image", + "bbox": [ + 0.661, + 0.291, + 0.665, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.67, + 0.291, + 0.684, + 0.3 + ], + "angle": 0, + "content": "#" + }, + { + "type": "image", + "bbox": [ + 0.687, + 0.291, + 0.691, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.7, + 0.291, + 0.714, + 0.3 + ], + "angle": 0, + "content": "\\[\\frac{1}{4}\\left( {x - 2}\\right) \\left( {x + 5}\\right) = 0\\]" + }, + { + "type": "image", + "bbox": [ + 0.717, + 0.291, + 0.722, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.726, + 0.291, + 0.739, + 0.3 + ], + "angle": 0, + "content": "\\( {13}/{14} \\)" + }, + { + "type": "image", + "bbox": [ + 0.743, + 0.291, + 0.75, + 0.3 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.754, + 0.291, + 0.768, + 0.3 + ], + "angle": 0, + "content": "#" + }, + { + "type": "image_caption", + "bbox": [ + 0.215, + 0.322, + 0.785, + 0.35 + ], + "angle": 0, + "content": "Fig. 2: Segmentation results of LaVG given the text description set. These precise object masks and visual grounding results are produced in a training-free fashion." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.377, + 0.785, + 0.542 + ], + "angle": 0, + "content": "tion, i.e., panoptic segmentation [46], and name this approach as Panoptic cut. Once Panoptic cut is finished, then the objects are grounded with text. Each discovered segment is aggregated to form an object prototype embedding and finally matched with given text embedding from a free-form text (Figure 2). Note that the this two-step process requires no additional training hence significantly benefits computational efficiency. LaVG is simple and training-free yet has shown its superiority over not only the learning-free counterpart models [15,38,71,95,119] but also the trained models [7,12,59,61,72,108,110] that used image-text paired datasets [13,56,89]. It is noteworthy that our model localizes objects qualitatively more precisely than the pixel-to-text classification methods (Figure 1)." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.544, + 0.592, + 0.556 + ], + "angle": 0, + "content": "Our contributions can be summarized as follows:" + }, + { + "type": "text", + "bbox": [ + 0.226, + 0.572, + 0.787, + 0.617 + ], + "angle": 0, + "content": "- We present Lazy Visual Grounding (LaVG) which discovers objects first and then later assigns text on the objects in a late interaction manner for open-vocabulary semantic segmentation." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.618, + 0.785, + 0.648 + ], + "angle": 0, + "content": "- We revisit Normalized cut to present Panoptic cut that iteratively discovers the object masks that cover all the image pixels." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.649, + 0.785, + 0.679 + ], + "angle": 0, + "content": "- Our model is training-free and runs on top of a pretrained vision and language model, reducing training computation burden significantly." + }, + { + "type": "text", + "bbox": [ + 0.225, + 0.68, + 0.785, + 0.725 + ], + "angle": 0, + "content": "- Our simple method based on graph partitioning quantitatively surpasses the state-of-the-art open-vocabulary segmentation models with segmentation masks with remarkably more precise object boundaries." + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.572, + 0.787, + 0.725 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.75, + 0.388, + 0.765 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.783, + 0.522, + 0.799 + ], + "angle": 0, + "content": "2.1 Unsupervised Object Discovery" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.785, + 0.84 + ], + "angle": 0, + "content": "Object discovery [91] has been a fundamental computer vision task. In 2000s, unsupervised object discovery started with discovering the image groups containing" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.435 + ], + "angle": 0, + "content": "objects of the same class with analytic techniques [30, 76, 86, 102]. Later, it advances to identify the location of the objects [50, 117, 120], which is viewed as the seminal work of the object discovery task with object localization. Object discovery has been formulated with an input of an image collection [20, 93, 94], where objects are discovered among the image collection via an image pair matching. A recent self-supervised vision transformer named DINO [11] has shown the emerging property of precisely attending the foreground objects within the transformer [92] attention layer. As it inherently provides a strong clue for foreground object saliency, DINO completely revamps the paradigm of unsupervised object discovery [77, 79, 84, 98]. Pioneered by LOST [82], the recently predominating object discovery approach is to distinguish existing objects based on the DINO activation map. One approach is seed-finding [82, 83], which explores foreground/background region from a highly confident seed pixel on the attention map. The other popular approach leverages the graph-partitioning segmentation, e.g., Normalized cut [78], on the DINO attention map to segregate the foreground objects from the background [70, 85, 99, 100], often followed by self-training of instance segmentation models [8, 35] by the obtained masks [70, 85, 99]. Our work is motivated by the second graph-partitioning approach, which robustly identifies foreground objects." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.455, + 0.563, + 0.47 + ], + "angle": 0, + "content": "2.2 Self-Supervised Vision Transformers" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.479, + 0.789, + 0.691 + ], + "angle": 0, + "content": "Deep self-supervised learning models [33,39] are trained with the self-supervision arisen from the input data rather than external human-annotated labels. The self-supervised learning paradigm has shown effective in terms of task performance as well as generalization ability across multiple downstream tasks [9-11, 17,22,105,121] without task-specific annotations. One popular approach [11,31] trains a model to map an image and its another view to nearby points on the feature space. This class-agnostic objective encourages the image encoder to capture visual invariance. Unlike class-supervised models that often attend on the specific part that represents an object, a representative self-supervised model named DINO [11] shows the emerged localization ability capturing foreground objects on the attention [92]. This property has benefited several dense prediction tasks such as weakly-supervised few-shot segmentation [41] and unsupervised image/video segmentation [112,115,122]. In this work, we leverage these foreground-attended representations as an input source to Normalized cut." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.711, + 0.644, + 0.727 + ], + "angle": 0, + "content": "2.3 Vision-and-Language Representation Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.841 + ], + "angle": 0, + "content": "Recent advances in efficient and modern hardware accelerate training huge foundation models at scale [5, 57, 113, 114, 116]. Among them, a representative vision and language model named CLIP [69] is trained using 400 million web-crawled image and text pairs to learn cross-modal similarity. CLIP trains two-tower image-text transformer encoders such that embedding similarity between a positive image-text pair is larger than other pairs in a training batch. The open-sourced CLIP models are leveraged to a number of vision and language work" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "image", + "bbox": [ + 0.222, + 0.146, + 0.784, + 0.259 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.268, + 0.785, + 0.325 + ], + "angle": 0, + "content": "Fig. 3: Two stages of Lazy Visual Grounding (LaVG). Given an image, LaVG first discovers existing object masks without the text information (panoptic cut) and then later assigns the class in text descriptions to each object with cross-modal similarity (object grounding)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.343, + 0.784, + 0.374 + ], + "angle": 0, + "content": "including zero-shot classification [58, 103], long-tailed recognition [63, 64, 90], referring segmentation [45, 101], cross-modal retrieval [37, 62] as well as OVSeg." + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.397, + 0.68, + 0.413 + ], + "angle": 0, + "content": "2.4 Open-Vocabulary Semantic Segmentation (OVSeg)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.422, + 0.788, + 0.71 + ], + "angle": 0, + "content": "Open-vocabulary segmentation is a pixel-level image classification task with categories described in text. Compared to the classic definition of semantic segmentation [16, 60] of which target classes are a predefined closed set, the target class set of OVSeg consists of open-vocabulary text and not necessarily predefined. Given the different levels of training supervision, OVSeg methods are categorized as mask-supervised [21, 28, 52, 54, 61, 109], image-text pair supervised [7, 12, 59, 61, 72, 108, 110] (hence weakly-supervised), or training-free [15, 38, 42, 95, 96]. Among them, this work corresponds to the last one: OVSeg with no additional training on pretrained models. For example, one of the training-free methods, SCLIP [95], replaces the attention layer of the query and the key cross-similarity into the self-similarity of each embeddings such that it attends on the homogeneous contexts in local regions. Our work is distinguished from the existing work [95, 106, 119] which directly classifies each image pixel with pixel-text similarity without comprehending the objects. On the other hand, our method first identifies the multiple objects in the absence of the text information and later integrates with the text entities with object-wise text assignment in a lazy visual grounding manner. Our training-free method is also distinguished from the trainable OVSeg methods [25, 29, 55, 111] that train MaskFormer segmentation models [18, 19] to obtain class-agnostic masks followed by grounding." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.733, + 0.479, + 0.751 + ], + "angle": 0, + "content": "3 Lazy Visual Grounding" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.765, + 0.785, + 0.84 + ], + "angle": 0, + "content": "We introduce **Lazy Visual Grounding (LaVG)**. LaVG consists of the two consecutive stages: panoptic object mask discovery (Section 3.1) and object grounding with text (Section 3.2). The key theme is late text interaction; the visual object discovery stage is a vision-only process and does not involve text interaction. Figure 3 briefly visualizes the process." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.147, + 0.715, + 0.163 + ], + "angle": 0, + "content": "3.1 Panoptic Object Mask Discovery with Normalized Cut" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.172, + 0.788, + 0.262 + ], + "angle": 0, + "content": "Preliminary: Normalized cut. Normalized cut [78] tackles the image segmentation problem with graph partitioning. Given an undirected weighted graph of \\((\\mathcal{V},\\mathcal{E})\\) with \\(N\\) nodes, Normalized cut finds the optimal partition of the graph nodes into two disjoint sets of nodes \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\) such that the removed weights of the edges between \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\) be the minimum [104]. The sum of the lost weights between the bipartitioned subgraphs is defined as cut:" + }, + { + "type": "equation", + "bbox": [ + 0.397, + 0.273, + 0.786, + 0.306 + ], + "angle": 0, + "content": "\\[\n\\operatorname {c u t} (\\mathcal {A}, \\mathcal {B}) = \\sum_ {u \\in \\mathcal {A}, v \\in \\mathcal {B}} w (u, v). \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.316, + 0.784, + 0.407 + ], + "angle": 0, + "content": "In the image segmentation perspective, the subgraphs \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\) correspond to two image segments that cover an image. The bipartition should avoid bad partitioning such as a tiny fraction and the rest of the mass, which still satisfies the definition of the minimum cut. Thus, a more preferable cut is a bipartition that balances the sizes of subgraphs, where each subgraph is properly associated with the entire graph. Formally," + }, + { + "type": "equation", + "bbox": [ + 0.377, + 0.417, + 0.786, + 0.45 + ], + "angle": 0, + "content": "\\[\n\\operatorname {N c u t} (\\mathcal {A}, \\mathcal {B}) = \\frac {\\operatorname {c u t} (\\mathcal {A} , \\mathcal {B})}{\\operatorname {a s s o c} (\\mathcal {A} , \\mathcal {V})} + \\frac {\\operatorname {c u t} (\\mathcal {A} , \\mathcal {B})}{\\operatorname {a s s o c} (\\mathcal {B} , \\mathcal {V})}, \\tag {2}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.326, + 0.452, + 0.786, + 0.485 + ], + "angle": 0, + "content": "\\[\n\\operatorname {w h e r e} \\operatorname {a s s o c} (\\mathcal {A}, \\mathcal {V}) = \\sum_ {u \\in \\mathcal {A}, t \\in \\mathcal {V}} w (u, t). \\tag {3}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.495, + 0.788, + 0.602 + ], + "angle": 0, + "content": "The association factor normalizes the cuts by the connected proportion to the entire graph. Through the systematic derivation, the work of Normalized cut [78] shows that minimizing Equation 2 is equivalent to solving an eigenvector system. Let us denote that \\( \\mathbf{W} \\in \\mathbb{R}^{N \\times N} \\) is a symmetric matrix of the non-negative edge weights, and \\( \\mathbf{D} \\) is a diagonal matrix of which diagonal elements correspond to the row-wise sum of \\( \\mathbf{W} \\). Then the solution of Normalized cut is obtained by solving the following generalized eigenvalue system:" + }, + { + "type": "equation", + "bbox": [ + 0.43, + 0.613, + 0.786, + 0.63 + ], + "angle": 0, + "content": "\\[\n\\left(\\boldsymbol {D} - \\boldsymbol {W}\\right) \\boldsymbol {x} = \\lambda \\boldsymbol {D} \\boldsymbol {x} \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.64, + 0.788, + 0.701 + ], + "angle": 0, + "content": "and obtaining the eigenvector corresponding to the second-smallest eigenvalue1. Let us denote the eigenvector corresponding to the second-smallest eigenvalue as \\( \\pmb{z} \\in \\mathbb{R}^N \\). The set of nodes \\( \\mathcal{V} = \\{v_1, \\dots, v_N\\} \\) is divided into \\( \\mathcal{A} \\) and \\( \\mathcal{B} \\) by the following bipartition rule:" + }, + { + "type": "equation", + "bbox": [ + 0.43, + 0.713, + 0.786, + 0.729 + ], + "angle": 0, + "content": "\\[\nv _ {n} \\in \\mathcal {A} \\quad \\text {i f} z _ {n} > \\bar {z}, \\tag {5}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.432, + 0.732, + 0.786, + 0.747 + ], + "angle": 0, + "content": "\\[\nv _ {n} \\in \\mathcal {B} \\quad \\text {o t h e r w i s e}, \\tag {6}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.759, + 0.784, + 0.79 + ], + "angle": 0, + "content": "where \\(\\bar{z}\\) means the average of the vector elements of \\(z\\). For the detailed derivation, please refer to the original paper [78]." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.797, + 0.788, + 0.84 + ], + "angle": 0, + "content": "1 The smallest eigenvalue of \\( D - W \\), i.e., a Laplacian matrix, is always zero. The second-smallest eigenvalue is known as the algebraic connectivity, or Fiedler eigenvalue, and reflects how well connected the graph is." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.785, + 0.126 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.245, + 0.149, + 0.761, + 0.239 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.269, + 0.248, + 0.733, + 0.262 + ], + "angle": 0, + "content": "Fig. 4: The result of Normalized cut [78] before and after refinement." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.275, + 0.787, + 0.381 + ], + "angle": 0, + "content": "Panoptic cut. The unsupervised object mask discovery step inherits the idea of the recent object discovery work [85, 99, 100] based on Normalized cut and is adapted to semantic segmentation. Specifically, the recent work [85, 99, 100] presents to leverage the DINO ViT [11, 26] feature map as an input feature to Normalized cut. As the task of interest is to identify objects and also assign a semantic class for all image pixels, i.e., panoptic segmentation, we call this unsupervised object mask discovery step as Panoptic cut." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.381, + 0.787, + 0.472 + ], + "angle": 0, + "content": "Given an input image, the image is fed to a pre-trained self-supervised DINO ViT to obtain the visual feature map. Following the existing work [1,41,122], we use the intermediate byproduct during the feature feed-forward process as the dense feature map as it is empirically shown to highlight the salient foreground objects. In the last layer of the ViT, the patch token similarity between the key embedding produces an affinity map:" + }, + { + "type": "equation", + "bbox": [ + 0.418, + 0.478, + 0.786, + 0.513 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {W} _ {x x ^ {\\prime}} = \\frac {\\boldsymbol {K} _ {x} ^ {\\top} \\boldsymbol {K} _ {x ^ {\\prime}}}{\\| \\boldsymbol {K} _ {x} \\| _ {2} \\| \\boldsymbol {K} _ {x ^ {\\prime}} \\| _ {2}}, \\tag {7}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.519, + 0.787, + 0.578 + ], + "angle": 0, + "content": "where \\( x, x' \\) indicates feature map index. In the graph partitioning perspective, the set of patch key embeddings correspond to nodes and their cosine similarity values correspond to the edge weights. Such definition of graph is applied to the Normalized cut system in Equation 4." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.579, + 0.788, + 0.759 + ], + "angle": 0, + "content": "The solved system yields two sets of nodes, \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\). We determine the foreground between them by following the few heuristics from MaskCut [99]. \\(\\mathcal{A}\\) is foreground if a) \\(\\mathcal{A}\\) contains the maximum absolute value in the second smallest eigenvector \\(z\\) and b) \\(\\mathcal{A}\\) is covering less than the two corners of the matrix. Once we determine the foreground between \\(\\mathcal{A}\\) and \\(\\mathcal{B}\\), then \\(\\mathcal{A}\\) is discovered as an object, and we iterate bipartitioning the rest of the background node set until i) there are less than five nodes left or ii) the iteration count reaches the preset maximum2. After the iteration halts, the undiscovered region is marked as background. We often observe noisy object boundaries or the salt and pepper artifacts such as in Figure 4. We thus fill the holes and refine the output bipartition masks with DenseCRF [49], before the masks are resized to the original image size. We note that the process introduced so far uses neither human annotation nor text entity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.76, + 0.787, + 0.791 + ], + "angle": 0, + "content": "Panoptic cut distinguishes from the unsupervised object discovery models [85, 99, 100] in that the background region is also semantically segmented." + }, + { + "type": "page_footnote", + "bbox": [ + 0.218, + 0.797, + 0.787, + 0.84 + ], + "angle": 0, + "content": "2 In implementation, the condition i) is rarely met. We empirically observe that DINO features exhibit small activation values on non-salient regions. Consequently, Panoptic cut returns bad bipartitions, which is ignored during the mask refinement process." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "table_caption", + "bbox": [ + 0.28, + 0.145, + 0.723, + 0.16 + ], + "angle": 0, + "content": "Table 1: Benchmarks for open-vocabulary semantic segmentation" + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.171, + 0.785, + 0.23 + ], + "angle": 0, + "content": "
With a background categoryWithout background category
VOC21Context60COCO-ObjectVOC20Context59ADE20KCOCO-Stuff
number of classes2160812059150171
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.243, + 0.784, + 0.273 + ], + "angle": 0, + "content": "For example, the sky and ceiling are not often perceived as objects but can be semantically grouped." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.296, + 0.679, + 0.312 + ], + "angle": 0, + "content": "3.2 Object Grounding with Class Descriptions in Text" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.322, + 0.788, + 0.534 + ], + "angle": 0, + "content": "Object mask grounding with cross-modal similarity. We adopt an image-text multi-modal encoder backbone to assign a text entity to each discovered mask by cross-modal similarity matching. We use the patch embedding of the SCLIP [95] backbone which roughly aligns the local image context with each patch embedding. Given a set of \\( Y \\) text classes, the text class descriptions are fed to the CLIP text encoder to obtain the set of text embeddings: \\( \\{c_y\\}_{y=1}^Y \\). Note that some benchmarks contain the background class. In these cases, following [95], we feed the background query text descriptions, e.g., wall, sky, etc., to avoid the ambiguous semantic of the text \"background\". The input image is fed to the SCLIP image encoder which returns the feature map: \\( \\{f_x | x \\in [1, H] \\times [1, W]\\} \\), where \\( x \\) indicates a position. The image features that fall into an object mask region \\( \\mathcal{M} \\) are averaged to construct the object prototype [87, 97]. The class distribution is obtained by the cosine similarity of the object prototype and the text embedding:" + }, + { + "type": "equation", + "bbox": [ + 0.392, + 0.533, + 0.787, + 0.569 + ], + "angle": 0, + "content": "\\[\np \\left(\\boldsymbol {f} _ {x \\in \\mathcal {M}} | y\\right) \\propto \\frac {1}{| \\mathcal {M} |} \\sum_ {x ^ {\\prime} \\in \\mathcal {M}} \\boldsymbol {f} _ {x ^ {\\prime}} ^ {\\top} \\boldsymbol {c} _ {y} \\tag {8}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.575, + 0.687, + 0.59 + ], + "angle": 0, + "content": "to assign the text class on the object, i.e., object-wise grounding." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.606, + 0.788, + 0.667 + ], + "angle": 0, + "content": "Segmentation prediction. The class logit map is resized to the input image size by bilinear interpolation. When the background query set is used, the corresponding logits are merged as background. Each object mask is predicted with the highest cross-modal similarity class index." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.691, + 0.377, + 0.708 + ], + "angle": 0, + "content": "4 Experiments" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.724, + 0.429, + 0.74 + ], + "angle": 0, + "content": "4.1 Experimental Setup" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.843 + ], + "angle": 0, + "content": "Implementation details. For the Panoptic cut input source, we use the feature map from DINO ViT-B/8 [11,26] trained on ImageNet1K [75] without labels. To solve the generalized eigenvector system in Equation 4, we use the PyTorch [67] built-in function 1obpcg which is compatible with GPUs. The maximum iteration for Panoptic cut is set to 16. We also use the pre-trained CLIP ViT-B/16 [69] for the image/text feature extractor. For object grounding with CLIP, we adopt" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.575, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "image", + "bbox": [ + 0.217, + 0.148, + 0.787, + 0.517 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.528, + 0.785, + 0.556 + ], + "angle": 0, + "content": "Fig. 5: Qualitative comparison of our method and baselines on COCO-stuff 164K. The * mark on the text set denotes the false positive class prediction of our model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.59, + 0.788, + 0.711 + ], + "angle": 0, + "content": "the sliding-window segmentation prediction scheme on high-resolution images, which is shown effective from the previous work [12, 95, 108]. We upsample the image as well as the Panoptic cut object masks such that the shorter size of the image becomes 336. The sliding window and the stride are set to \\(224 \\times 224\\) and \\(112 \\times 112\\), respectively. Then each crop is fed to the image encoder which returns the pixel-level logit map on each cropped window, followed by averaging the logits. The codebase is adopted from SCLIP [95] which is based on mmseg [23]. An Nvidia RTX 3090 GPU is used for all experiments." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Datasets and benchmarks. We evaluate our method on five publicly available open-vocabulary semantic segmentation datasets: Pascal VOC 2012 [27], Pascal Context [65], ADE20K [118], COCO-Stuff and COCO-Object [56] plus two variants with the background queries. Background queries such as wall, sky, etc. are added on Pascal VOC and Pascal Context, which are indicated as VOC21 and Context60, respectively. We use the background query set from SCLIP [95] and do not engineer it further. Table 1 shows the configuration of the dataset classes." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.144, + 0.788, + 0.397 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.408, + 0.785, + 0.438 + ], + "angle": 0, + "content": "Fig. 6: Qualitative comparison of our method and others. The first three columns are directly copied from the paper in the third columns [6,7,32,108,110]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.455, + 0.788, + 0.489 + ], + "angle": 0, + "content": "For evaluation, we use the standard mean IoU metric: \\( \\mathrm{mIoU} = \\frac{1}{Y}\\sum_{y}\\mathrm{IoU}_{y} \\), where \\( \\mathrm{IoU}_y \\) denotes an IoU value of \\( y \\)-th class." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.502, + 0.788, + 0.639 + ], + "angle": 0, + "content": "Baseline methods. Vanilla CLIP is the most naive baseline. The set of image patch embeddings and the set of text embeddings are obtained from the pre-trained CLIP image and text encoder backbone, respectively. Cosine similarity between the two sets of embeddings is computed to obtain the cross-modal pixel-wise text similarity, which is directly translated as semantic segmentation prediction. SCLIP [95] is the primary baseline. SCLIP modifies the intermediate function of the attention layers in the pre-trained CLIP ViTs such that the final image patch embedding better represents the corresponding image patch semantics." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.663, + 0.442, + 0.679 + ], + "angle": 0, + "content": "4.2 Experimental Results" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.789, + 0.844 + ], + "angle": 0, + "content": "Qualitative results. We demonstrate the qualitative examples of the model outputs in Figure 5. Our model demonstrates advanced segmentation visuals compared to our baselines. Note that CLIP and SCLIP [95] are pixel-wise dense prediction methods. When segmentation prediction operates at pixel level, it does not necessarily comprehend the object shapes, resulting in noisy segmentation masks of objects. Ours, however, proceeds object mask discovery stage and returns object-level masks. As seen, our model predicts sharper and cleaner delineations that accurately capture semantic object boundaries, e.g., our model segments out the clear shape of the kites in the sky (first image). Other nice properties that our model often exhibits include capturing tiny kites (first im" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.788, + 0.203 + ], + "angle": 0, + "content": "Table 2: Performance (mIoU, %) comparison of the state-of-the-art open-vocabulary segmentation methods on seven public benchmarks. The models with \\(\\dagger\\) do not use CLIP. The models with \\(\\checkmark\\) involve additional training on top of the pretrained backbone. The numerical results [12,61,69,80,110,119] are adopted from SCLIP [95]." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.213, + 0.789, + 0.45 + ], + "angle": 0, + "content": "
MethodtrainWith a background categoryWithout background category
VOC21Context60COCO-Obj.VOC20Context59ADECOCO-Stf.
CLIP [69]18.89.98.149.411.13.15.7
ZeroSeg [15]40.820.420.2----
MaskCLIP [119]43.423.220.674.926.411.916.7
ReCo [80]25.119.915.757.722.311.214.8
CLIPpy [71]52.2-32.0--13.5-
DiffSegmenter† [96]60.127.537.9----
SCLIP [95]59.130.430.580.434.216.122.4
ViL-Seg [59]✓34.416.316.4--11.9-
ViewCo [72]✓52.423.023.5----
MixReorg [7]✓47.923.9-----
GroupViT† [108]✓52.318.727.579.723.410.415.3
TCL [12]✓51.224.330.477.530.314.919.6
OVSegmentor† [110]✓53.820.425.1--5.6-
SegCLIP [61]✓52.624.726.5---
LaVG (ours)62.131.634.282.534.715.823.2
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.487, + 0.784, + 0.517 + ], + "angle": 0, + "content": "age), segmentation with little spurious correlation (second image), and repeated chairs (third image)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.52, + 0.788, + 0.657 + ], + "angle": 0, + "content": "We also compare various other OVSeg models [6,7,32,108,110] in Figure 6. We copy and paste the visualization on their original papers and present our model's prediction. Thus the results are not much cherry-picked as the choice of visualized images is taken from the other work. Most previous work often presents visualized prediction favorably on Pascal VOC, most of which contain the objects that stand out. Unlike the examples of the other work with incorrect class predictions (the dog in the first image), holes in predicted masks (the second image), and misaligned contour (third example), our model presents much cleaner mask prediction and better class prediction." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.689, + 0.788, + 0.842 + ], + "angle": 0, + "content": "Quantitative comparison with state-of-the-art models. Table 2 compares the existing OVSeg methods on seven public benchmarks. The performance values of MaskCLIP [119], ReCo [38], and TCL [12] are brought from the reimplementation of SCLIP, which are either higher or the same values as the ones in the original papers. The performance values of the rest of work [7,15,59,61,71,72,96, 108,110] are from their original performance reports. Our model outperforms the previous state-of-the-art models. Note that our model outperforms not only the learning-free models [15,38,71,95,119] but also the weakly-supervised learning models [7,12,59,61,72,108,110] that exploits image-text paired datasets, e.g., CC3M [13], YFCC [89], or COCO [56] from the \\(3.4\\mathrm{M}\\) to \\(26\\mathrm{M}\\) dataset scale." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "table_caption", + "bbox": [ + 0.279, + 0.145, + 0.724, + 0.16 + ], + "angle": 0, + "content": "Table 3: Comparison with different object mask discovery models" + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.171, + 0.785, + 0.277 + ], + "angle": 0, + "content": "
VOC21Context60COCO-Obj.VOC20Context59COCO-Stf.
Normalized cut [78]47.626.328.278.129.320.0
CutLER-CascadedRCNN [99]57.329.333.279.632.222.3
Panoptic cut (4 iterations)61.130.333.781.333.422.6
Panoptic cut (16 iterations)62.131.634.282.534.723.2
Panoptic cut (32 iterations)61.431.734.282.634.823.3
Ground-truth object masks68.337.144.187.740.227.6
" + }, + { + "type": "table_caption", + "bbox": [ + 0.218, + 0.294, + 0.785, + 0.309 + ], + "angle": 0, + "content": "Table 4: Comparison with different grounding schemes. \\( \\mathcal{O} \\) denotes object mask region." + }, + { + "type": "table", + "bbox": [ + 0.221, + 0.321, + 0.79, + 0.39 + ], + "angle": 0, + "content": "
VOC21Context60COCO-ObjectVOC20Context59COCO-Stuff
O-masked attention54.626.927.661.728.218.3
Gaussian blur on non-O59.830.931.571.633.421.5
O-averaged prototype62.131.634.282.534.723.2
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.423, + 0.453, + 0.438 + ], + "angle": 0, + "content": "4.3 Experimental Analyses" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.455, + 0.785, + 0.486 + ], + "angle": 0, + "content": "We ablate the components in our method and see their effectiveness. In tables, our method is colored in gray." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.508, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Comparison with other object mask discovery models. To verify the strength of Panoptic cut in segmentation, we compare Panoptic cut with other object discovery models and compare them in Table 3. Among the modern object discovery neural networks, CutLER [99] is compared. CutLER first produces object mask proposals with a derivative of Normalized cut (MaskCut) and uses the proposals as self-supervision to train an unsupervised instance segmentation & object detection architecture, e.g., Cascaded-RCNN [8]. To adapt CutLER to semantic segmentation, the undetected pixels are considered as a single region and averaged at the feature level as background. The naïve adoption of the state-of-the-art object discovery method does not directly translate to high open-vocabulary segmentation performance. We observe that CutLER tends to detect fine-grained parts of foreground objects while leaving the background under-segmented, e.g., undetected sky and sea grouped together, probably because the training objective is to detect foreground objects. Although this model achieves promising performance that beats most of the methods in Table 2 but is lower than Panoptic cut. Panoptic cut produces proper semantic segmentation of background, plus, it requires no additional training. We believe that Panoptic cut is a more suitable choice than instance detection or salient detection methods [36] for semantic segmentation, where all the present pixels should be classified for segmentation. Panoptic cut iterates the preset number of iterations, where we gain from \\(0.5\\%\\) to \\(1.3\\%\\) point mIoU gain from maximum of 4 to 16 iterations." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.788, + 0.174 + ], + "angle": 0, + "content": "Table 5: Comparison of computational cost measured with an Nvidia RTX 3090. The columns with \\(\\dagger\\) are taken from [21]." + }, + { + "type": "table", + "bbox": [ + 0.246, + 0.185, + 0.758, + 0.272 + ], + "angle": 0, + "content": "
methodsZSSeg [111]†CATseg [21]†DiffSegmenter [96]LaVG
# learnable params. (M)102.870.300
# total params. (M)530.8433.71453198
training time (min)958.5875.500
inference time (s)2.730.540.5912.59
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.3, + 0.8, + 0.527 + ], + "angle": 0, + "content": "Comparison with different grounding schemes. We explore different grounding schemes and compare them on Table 4. Specifically, three object embedding methods are compared, all based on the SCLIP feature. First, object-masked \\(\\mathcal{O}\\)-masked attention [18, 40, 44] forces the forward path of ViTs to attend only to the designated region. We zero out the non-object region on the input image and set a large negative value on the non-object pixel patch embedding before the softmax in the attention in the ViT backbone. Recent work [81] explores a way to explicitly draw attention on the input image level in a human-friendly manner. We adopt their idea of applying Gaussian blur on the non-object regions on the input image and taking the global image representation as the local feature. Note that these two schemes require multiple feed-forward passes with the same image with different attention masks and different Gaussian blurred regions. Our method (the last line) is the simplest: averaging the region patch embedding (Eq. 8). The object-averaged prototype shows superior performance in terms of both end-task accuracy and complexity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.545, + 0.788, + 0.667 + ], + "angle": 0, + "content": "Computational complexity. Table 5 compares the computational cost of LaVG with a training-free model [96] and trained models [21, 111]. The outstanding advantage of training-free models is the computational efficiency from the absence of time, data, and computation burden in additional training. Compared to another training-free ovseg method [96] based on diffusion models [73] which leverages image/caption generation models with heavy parameters, we use much more lightweight feature embedding models. However, our iterative process of panoptic cut introduces a longer inference time." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.691, + 0.494, + 0.708 + ], + "angle": 0, + "content": "4.4 Limitations of our approach" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.719, + 0.788, + 0.841 + ], + "angle": 0, + "content": "We outline four characteristic limitations of our method. The intrinsic problem of our method is the extensive computation time and memory consumption induced by leveraging the graph-based partitioning algorithm. Normalized cut generally consumes the excessive use of memory due to the use of \\( N \\times N \\) size affinity matrix. For example, running Normalized cut on a \\( 512 \\times 512 \\) RGB image directly leads to the out-of-memory error. However, using a well-abstracted downsampled feature map of the DINO attention greatly reduces the memory consumption and smoothly executes on a single regular GPU device, e.g., Nvidia RTX 3090. Also," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.786, + 0.178 + ], + "angle": 0, + "content": "our approach is inference-only thus includes no training time, which is still more computationally efficient than training models." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.179, + 0.788, + 0.269 + ], + "angle": 0, + "content": "In terms of the end-task performance, we witness the remarkable qualitative improvement as seen in Figures 5-6, but it does not directly enhance mIoU values substantially. This is because the evaluation metric is pixel-level classification rather than favoring aligned edges or clean shapes of objects. In addition, the proposed method occasionally misclassifies objects which also negatively affects the mIoU performance." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.271, + 0.788, + 0.378 + ], + "angle": 0, + "content": "Another limitation is qualitatively observed in the last example of Figure 5. Due to the sliding-window segmentation inference technique, the cropped region suffers the part-whole ambiguity issue and sometimes predicts a wrong class on the region. This side effect is often observed on textureless regions, e.g., the model confuses the sky and cloud in the last example of Figure 5. However, the recognition of the image as a whole might remedy the part-whole ambiguity, but the accuracy of the small-resolution images drops at the same time." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.379, + 0.788, + 0.44 + ], + "angle": 0, + "content": "Lastly, out method implemented with CLIP is potentially inappropriate for closed-vocabulary segmentation on specialized domains such as medical or industrial vision. For such problems on specific domains, however, the concept of lazy grounding can be used with domain-specific encoders." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.472, + 0.359, + 0.489 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.513, + 0.788, + 0.726 + ], + "angle": 0, + "content": "We have proposed Lazy Visual Grounding, a late-interaction semantic segmentation approach, for open-vocabulary semantic segmentation. Our method first proceeds unsupervised object mask discovery by graph partitioning and the lazy grounding on the discovered object masks. This simple and training-free method exceeds the performance of the caption-based weakly-supervised learning models. Given the observation that the classic graph partitioning method surpasses such trendy deep-learning models, we claim that semantic pixel-grouping is crucial for semantic segmentation and should be prioritized especially when segmentation supervision is not available. Last but not least, given the output format of our method is object-level and hence identifiable, LaVG provides more accurate and crisp object boundaries, which makes it particularly suitable for grounding tasks that require object-level recognition with precise boundaries. This work may open the door for training-free open-vocabulary instance segmentation, which has not been actively studied, yet." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.749, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Acknowledgements. This work was supported by Samsung Electronics (IO20 1208-07822-01), the NRF grant (NRF-2021R1A2C3012728 \\((45\\%)\\)), and the IITP grants (RS-2022-II220959: Few-Shot Learning of Causal Inference in Vision and Language for Decision Making \\((50\\%)\\), RS-2019-II191906: AI Graduate School Program at POSTECH \\((5\\%)\\)) funded by Ministry of Science and ICT, Korea. We also thank Sua Choi for her helpful discussion." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.145, + 0.323, + 0.16 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.179, + 0.785, + 0.208 + ], + "angle": 0, + "content": "1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv preprint arXiv:2112.05814 2(3), 4 (2021) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.209, + 0.785, + 0.25 + ], + "angle": 0, + "content": "2. Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: From contours to regions: An empirical evaluation. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2294-2301. IEEE (2009) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.251, + 0.785, + 0.279 + ], + "angle": 0, + "content": "3. Blake, A., Kohli, P., Rother, C.: Markov random fields for vision and image processing. MIT press (2011) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.28, + 0.785, + 0.321 + ], + "angle": 0, + "content": "4. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on pattern analysis and machine intelligence 23(11), 1222-1239 (2001) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.322, + 0.785, + 0.376 + ], + "angle": 0, + "content": "5. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.378, + 0.785, + 0.405 + ], + "angle": 0, + "content": "6. Bucher, M., Vu, T.H., Cord, M., Pérez, P.: Zero-shot semantic segmentation. Advances in Neural Information Processing Systems 32 (2019) 2, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.406, + 0.785, + 0.462 + ], + "angle": 0, + "content": "7. Cai, K., Ren, P., Zhu, Y., Xu, H., Liu, J., Li, C., Wang, G., Liang, X.: Mixreorg: Cross-modal mixed patch reorganization is a good mask learner for open-world semantic segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1196-1205 (2023) 3, 5, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.463, + 0.785, + 0.504 + ], + "angle": 0, + "content": "8. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018) 4, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.233, + 0.505, + 0.785, + 0.545 + ], + "angle": 0, + "content": "9. Caron, M., Bojanowski, P., Joulin, A., Douze, M.: Deep clustering for unsupervised learning of visual features. In: Proc. European Conference on Computer Vision (ECCV) (2018) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.546, + 0.785, + 0.588 + ], + "angle": 0, + "content": "10. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.589, + 0.785, + 0.63 + ], + "angle": 0, + "content": "11. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2021) 2, 4, 7, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.631, + 0.785, + 0.685 + ], + "angle": 0, + "content": "12. Cha, J., Mun, J., Roh, B.: Learning to generate text-grounded mask for open-world semantic segmentation from only image-text pairs. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2, 3, 5, 9, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.687, + 0.785, + 0.742 + ], + "angle": 0, + "content": "13. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12m: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3558-3568 (2021) 3, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.743, + 0.785, + 0.784 + ], + "angle": 0, + "content": "14. Chen, C.W., Luo, J., Parker, K.J.: Image segmentation via adaptive k-mean clustering and knowledge-based morphological operations with biomedical applications. IEEE transactions on image processing 7(12), 1673-1683 (1998) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.227, + 0.785, + 0.785, + 0.84 + ], + "angle": 0, + "content": "15. Chen, J., Zhu, D., Qian, G., Ghanem, B., Yan, Z., Zhu, C., Xiao, F., Elhoseiny, M., Culatana, S.C.: Exploring open-vocabulary semantic segmentation from clip vision encoder distillation only. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 3, 5, 11" + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.179, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.787, + 0.203 + ], + "angle": 0, + "content": "16. Chen, L.C., Papandreou, G., Kokkinos, I., Murphy, K., Yuille, A.L.: Deeplab: Semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected crfs. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2017) 2, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.203, + 0.787, + 0.243 + ], + "angle": 0, + "content": "17. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.243, + 0.787, + 0.298 + ], + "angle": 0, + "content": "18. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1290-1299 (2022) 5, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.298, + 0.787, + 0.325 + ], + "angle": 0, + "content": "19. Cheng, B., Schwing, A.G., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation (2021) 2, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.325, + 0.787, + 0.379 + ], + "angle": 0, + "content": "20. Cho, M., Kwak, S., Schmid, C., Ponce, J.: Unsupervised object discovery and localization in the wild: Part-based matching with bottom-up region proposals. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1201-1210 (2015) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.379, + 0.787, + 0.406 + ], + "angle": 0, + "content": "21. Cho, S., Shin, H., Hong, S., An, S., Lee, S., Arnab, A., Seo, P.H., Kim, S.: Cat-seg: Cost aggregation for open-vocabulary semantic segmentation (2023) 5, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.406, + 0.787, + 0.447 + ], + "angle": 0, + "content": "22. Choi, S., Kang, D., Cho, M.: Contrastive mean-shift learning for generalized category discovery. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.447, + 0.787, + 0.473 + ], + "angle": 0, + "content": "23. Contributors, M.: MMSegmentation: Openmmlab semantic segmentation toolbox and benchmark. https://github.com/open-mmlab/mmsegmentation (2020) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.473, + 0.787, + 0.528 + ], + "angle": 0, + "content": "24. Cordts, M., Omran, M., Ramos, S., Rehfeld, T., Enzweiler, M., Benenson, R., Franke, U., Roth, S., Schiele, B.: The cityscapes dataset for semantic urban scene understanding. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.528, + 0.787, + 0.555 + ], + "angle": 0, + "content": "25. Ding, Z., Wang, J., Tu, Z.: Open-vocabulary universal image segmentation with maskclip. Proc. International Conference on Machine Learning (ICML) (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.555, + 0.787, + 0.609 + ], + "angle": 0, + "content": "26. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: Proc. International Conference on Learning Representations (ICLR) (2021) 7, 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.609, + 0.787, + 0.65 + ], + "angle": 0, + "content": "27. Everingham, M., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes (voc) challenge. International Journal of Computer Vision (IJCV) (2010) 2, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.65, + 0.787, + 0.691 + ], + "angle": 0, + "content": "28. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.691, + 0.787, + 0.731 + ], + "angle": 0, + "content": "29. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.731, + 0.787, + 0.785 + ], + "angle": 0, + "content": "30. Grauman, K., Darrell, T.: Unsupervised learning of categories from sets of partially matching image features. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 1, pp. 19-25. IEEE (2006) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.785, + 0.787, + 0.84 + ], + "angle": 0, + "content": "31. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap your own latent-a new approach to self-supervised learning. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "32. Gu, Z., Zhou, S., Niu, L., Zhao, Z., Zhang, L.: Context-aware feature generation for zero-shot semantic segmentation. In: Proceedings of the 28th ACM International Conference on Multimedia. pp. 1921-1929 (2020) 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.191, + 0.785, + 0.233 + ], + "angle": 0, + "content": "33. Gui, J., Chen, T., Cao, Q., Sun, Z., Luo, H., Tao, D.: A survey of self-supervised learning from multiple perspectives: Algorithms, theory, applications and future trends. arXiv preprint arXiv:2301.05712 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.234, + 0.785, + 0.275 + ], + "angle": 0, + "content": "34. Gupta, A., Dollar, P., Girshick, R.: Lvis: A dataset for large vocabulary instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5356-5364 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.276, + 0.785, + 0.303 + ], + "angle": 0, + "content": "35. He, K., Gkioxari, G., Dollár, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.304, + 0.785, + 0.346 + ], + "angle": 0, + "content": "36. Hsu, K.J., Tsai, C.C., Lin, Y.Y., Qian, X., Chuang, Y.Y.: Unsupervised cnn-based co-saliency detection with graphical optimization. In: Proceedings of the European conference on computer vision (ECCV). pp. 485-501 (2018) 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.346, + 0.785, + 0.403 + ], + "angle": 0, + "content": "37. Huang, S., Gong, B., Pan, Y., Jiang, J., Lv, Y., Li, Y., Wang, D.: Vop: Text-video co-operative prompt tuning for cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6565-6574 (June 2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.403, + 0.785, + 0.444 + ], + "angle": 0, + "content": "38. Iscen, A., Caron, M., Fathi, A., Schmid, C.: Retrieval-enhanced contrastive vision-text models. Advances in Neural Information Processing Systems (NeurIPS) (2023) 3, 5, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.445, + 0.785, + 0.487 + ], + "angle": 0, + "content": "39. Jing, L., Tian, Y.: Self-supervised visual feature learning with deep neural networks: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2020) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.488, + 0.785, + 0.529 + ], + "angle": 0, + "content": "40. Kang, D., Cho, M.: Integrative few-shot learning for classification and segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9979-9990 (2022) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.53, + 0.785, + 0.584 + ], + "angle": 0, + "content": "41. Kang, D., Koniusz, P., Cho, M., Murray, N.: Distilling self-supervised vision transformers for weakly-supervised few-shot classification & segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.586, + 0.785, + 0.613 + ], + "angle": 0, + "content": "42. Karazija, L., Laina, I., Vedaldi, A., Rupprecht, C.: Diffusion models for zero-shot open-vocabulary segmentation. arXiv preprint arXiv:2306.09316 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.614, + 0.785, + 0.643 + ], + "angle": 0, + "content": "43. Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International journal of computer vision 1(4), 321-331 (1988) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.643, + 0.785, + 0.683 + ], + "angle": 0, + "content": "44. Kenton, J.D.M.W.C., Toutanova, L.K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of NAACL-HLT (2019) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.685, + 0.785, + 0.713 + ], + "angle": 0, + "content": "45. Kim, S., Kang, M., Park, J.: Risclip: Referring image segmentation framework using clip. arXiv preprint arXiv:2306.08498 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.714, + 0.785, + 0.755 + ], + "angle": 0, + "content": "46. Kirillov, A., He, K., Girshick, R., Rother, C., Dollar, P.: Panoptic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9404-9413 (2019) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.757, + 0.785, + 0.798 + ], + "angle": 0, + "content": "47. Kirillov, A., Levinkov, E., Andres, B., Savchynskyy, B., Rother, C.: Instancecut: from edges to instances with multicut. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5008-5017 (2017) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "48. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) 2" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.147, + 0.784, + 0.188 + ], + "angle": 0, + "content": "49. Krahenbuhl, P., Koltun, V.: Efficient inference in fully connected crfs with gaussian edge potentials. Advances in neural information processing systems 24 (2011) 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.189, + 0.785, + 0.231 + ], + "angle": 0, + "content": "50. Lee, Y.J., Grauman, K.: Shape discovery from unlabeled image collections. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2254-2261. IEEE (2009) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.231, + 0.785, + 0.272 + ], + "angle": 0, + "content": "51. Li, B., Shi, Y., Qi, Z., Chen, Z.: A survey on semantic segmentation. In: 2018 IEEE International Conference on Data Mining Workshops (ICDMW). pp. 1233-1240. IEEE (2018) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.273, + 0.785, + 0.314 + ], + "angle": 0, + "content": "52. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: International Conference on Learning Representations (2022), https://openreview.net/forum?id=RriDjddCLN 2, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.315, + 0.785, + 0.355 + ], + "angle": 0, + "content": "53. Li, Z., Chen, J.: Superpixel segmentation using linear spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1356-1363 (2015) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.356, + 0.785, + 0.397 + ], + "angle": 0, + "content": "54. Li, Z., Zhou, Q., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Open-vocabulary object segmentation with diffusion models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.398, + 0.785, + 0.452 + ], + "angle": 0, + "content": "55. Liang, F., Wu, B., Dai, X., Li, K., Zhao, Y., Zhang, H., Zhang, P., Vajda, P., Marculescu, D.: Open-vocabulary semantic segmentation with mask-adapted clip. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.453, + 0.785, + 0.494 + ], + "angle": 0, + "content": "56. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Proc. European Conference on Computer Vision (ECCV) (2014) 2, 3, 9, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.495, + 0.785, + 0.52 + ], + "angle": 0, + "content": "57. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. In: NeurIPS (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.522, + 0.785, + 0.577 + ], + "angle": 0, + "content": "58. Liu, H., Son, K., Yang, J., Liu, C., Gao, J., Lee, Y.J., Li, C.: Learning customized visual models with retrieval-augmented knowledge. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15148-15158 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.578, + 0.785, + 0.619 + ], + "angle": 0, + "content": "59. Liu, Q., Wen, Y., Han, J., Xu, C., Xu, H., Liang, X.: Open-world semantic segmentation via contrasting and clustering vision-language embedding. In: Proc. European Conference on Computer Vision (ECCV) (2022) 3, 5, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.62, + 0.785, + 0.66 + ], + "angle": 0, + "content": "60. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2015) 2, 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.661, + 0.785, + 0.702 + ], + "angle": 0, + "content": "61. Luo, H., Bao, J., Wu, Y., He, X., Li, T.: Segclip: Patch aggregation with learnable centers for open-vocabulary semantic segmentation. In: Proc. International Conference on Machine Learning (ICML) (2023) 3, 5, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.702, + 0.785, + 0.757 + ], + "angle": 0, + "content": "62. Ma, H., Zhao, H., Lin, Z., Kale, A., Wang, Z., Yu, T., Gu, J., Choudhary, S., Xie, X.: Ei-clip: Entity-aware interventional contrastive learning for e-commerce cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18051–18061 (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.758, + 0.785, + 0.799 + ], + "angle": 0, + "content": "63. Ma, T., Geng, S., Wang, M., Shao, J., Lu, J., Li, H., Gao, P., Qiao, Y.: A simple long-tailed recognition baseline via vision-language model. arXiv preprint arXiv:2111.14745 (2021) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.799, + 0.785, + 0.84 + ], + "angle": 0, + "content": "64. Ma, T., Geng, S., Wang, M., Xu, S., Li, H., Zhang, B., Gao, P., Qiao, Y.: Unleashing the potential of vision-language models for long-tailed visual recognition (2022) 5" + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "19" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.203 + ], + "angle": 0, + "content": "65. Mottaghi, R., Chen, X., Liu, X., Cho, N.G., Lee, S.W., Fidler, S., Urtasun, R., Yuille, A.: The role of context for object detection and semantic segmentation in the wild. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2014) 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.203, + 0.785, + 0.243 + ], + "angle": 0, + "content": "66. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2015) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.243, + 0.785, + 0.298 + ], + "angle": 0, + "content": "67. Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A.: Automatic differentiation in pytorch. In: Advances in Neural Information Processing Systems (NeurIPS) Workshop Autodiff (2017) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.298, + 0.785, + 0.354 + ], + "angle": 0, + "content": "68. Pizer, S.M., Amburn, E.P., Austin, J.D., Cromartie, R., Geselowitz, A., Greer, T., ter Haar Romeny, B., Zimmerman, J.B., Zuiderveld, K.: Adaptive histogram equalization and its variations. Computer vision, graphics, and image processing 39(3), 355-368 (1987) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.354, + 0.785, + 0.407 + ], + "angle": 0, + "content": "69. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Proc. International Conference on Machine Learning (ICML) (2021) 2, 4, 8, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.407, + 0.785, + 0.448 + ], + "angle": 0, + "content": "70. Rambhatla, S.S., Misra, I., Chellappa, R., Shrivastava, A.: Most: Multiple object localization with self-supervised transformers for object discovery. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.448, + 0.785, + 0.489 + ], + "angle": 0, + "content": "71. Ranasinghe, K., McKinzie, B., Ravi, S., Yang, Y., Toshev, A., Shlens, J.: Perceptual grouping in contrastive vision-language models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 3, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.489, + 0.785, + 0.529 + ], + "angle": 0, + "content": "72. Ren, P., Li, C., Xu, H., Zhu, Y., Wang, G., Liu, J., Chang, X., Liang, X.: Viewco: Discovering text-supervised segmentation masks via multi-view semantic consistency. arXiv preprint arXiv:2302.10307 (2023) 3, 5, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.529, + 0.785, + 0.556 + ], + "angle": 0, + "content": "73. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models (2021) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.556, + 0.785, + 0.597 + ], + "angle": 0, + "content": "74. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: International Conference on Medical image computing and computer-assisted intervention (2015) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.597, + 0.785, + 0.651 + ], + "angle": 0, + "content": "75. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International Journal of Computer Vision (IJCV) 115(3), 211-252 (2015) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.651, + 0.785, + 0.705 + ], + "angle": 0, + "content": "76. Russell, B.C., Freeman, W.T., Efros, A.A., Sivic, J., Zisserman, A.: Using multiple segmentations to discover objects and their extent in image collections. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 2, pp. 1605-1614. IEEE (2006) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.705, + 0.785, + 0.746 + ], + "angle": 0, + "content": "77. Seitzer, M., Horn, M., Zadaianchuk, A., Zietlow, D., Xiao, T., Simon-Gabriel, C.J., He, T., Zhang, Z., Scholkopf, B., Brox, T., et al.: Bridging the gap to real-world object-centric learning. arXiv preprint arXiv:2209.14860 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.746, + 0.785, + 0.773 + ], + "angle": 0, + "content": "78. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence 22(8), 888-905 (2000) 2, 4, 6, 7, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.773, + 0.785, + 0.814 + ], + "angle": 0, + "content": "79. Shin, G., Albanie, S., Xie, W.: Unsupervised salient object detection with spectral cluster voting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3971-3980 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "80. Shin, G., Xie, W., Albanie, S.: Reco: Retrieve and co-segment for zero-shot transfer. Advances in Neural Information Processing Systems (NeurIPS) (2022) 11" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "20" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.372, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "81. Shtedritski, A., Rupprecht, C., Vedaldi, A.: What does clip know about a red circle? visual prompt engineering for vlms. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.191, + 0.787, + 0.233 + ], + "angle": 0, + "content": "82. Simeoni, O., Puy, G., Vo, H.V., Roburin, S., Gidaris, S., Bursuc, A., Pérez, P., Marlet, R., Ponce, J.: Localizing objects with self-supervised transformers and no labels. In: Proc. British Machine Vision Conference (BMVC) (2021) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.234, + 0.787, + 0.288 + ], + "angle": 0, + "content": "83. Simeoni, O., Sekkat, C., Puy, G., Vobecky, A., Zablocki, E., Pérez, P.: Unsupervised object localization: Observing the background to discover objects. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3176-3186 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.29, + 0.787, + 0.33 + ], + "angle": 0, + "content": "84. Simeoni, O., Zablocki, E., Gidaris, S., Puy, G., Pérez, P.: Unsupervised object localization in the era of self-supervised vits: A survey. arXiv preprint arXiv:2310.12904 (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.332, + 0.787, + 0.374 + ], + "angle": 0, + "content": "85. Singh, S., Deshmukh, S., Sarkar, M., Krishnamurthy, B.: Locate: Self-supervised object discovery via flow-guided graph-cut and bootstrapped self-training. Proc. British Machine Vision Conference (BMVC) (2023) 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.375, + 0.787, + 0.416 + ], + "angle": 0, + "content": "86. Sivic, J., Russell, B.C., Efros, A.A., Zisserman, A., Freeman, W.T.: Discovering objects and their location in images. In: Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1. vol. 1, pp. 370-377. IEEE (2005) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.417, + 0.787, + 0.445 + ], + "angle": 0, + "content": "87. Snell, J., Swersky, K., Zemel, R.: Prototypical networks for few-shot learning. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.446, + 0.787, + 0.472 + ], + "angle": 0, + "content": "88. Thoma, M.: A survey of semantic segmentation. arXiv preprint arXiv:1602.06541 (2016) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.474, + 0.787, + 0.515 + ], + "angle": 0, + "content": "89. Thomee, B., Shamma, D.A., Friedland, G., Elizalde, B., Ni, K., Poland, D., Borth, D., Li, L.J.: Yfcc100m: The new data in multimedia research. Communications of the ACM 59(2), 64-73 (2016) 3, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.517, + 0.787, + 0.558 + ], + "angle": 0, + "content": "90. Tian, C., Wang, W., Zhu, X., Dai, J., Qiao, Y.: Vl-ltr: Learning class-wise visual-linguistic representation for long-tailed visual recognition. In: European Conference on Computer Vision. Springer (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.559, + 0.787, + 0.599 + ], + "angle": 0, + "content": "91. Tuytelaars, T., Lampert, C.H., Blaschko, M.B., Buntine, W.: Unsupervised object discovery: A comparison. International Journal of Computer Vision (IJCV) (2010) 3" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.601, + 0.787, + 0.642 + ], + "angle": 0, + "content": "92. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.643, + 0.787, + 0.699 + ], + "angle": 0, + "content": "93. Vo, H.V., Bach, F., Cho, M., Han, K., LeCun, Y., Pérez, P., Ponce, J.: Unsupervised image matching and object discovery as optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8287-8296 (2019) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.7, + 0.787, + 0.755 + ], + "angle": 0, + "content": "94. Vo, H.V., Pérez, P., Ponce, J.: Toward unsupervised, multi-object discovery in large-scale image collections. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIII 16. pp. 779-795. Springer (2020) 2, 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.757, + 0.787, + 0.796 + ], + "angle": 0, + "content": "95. Wang, F., Mei, J., Yuille, A.: Sclip: Rethinking self-attention for dense vision-language inference. arXiv preprint arXiv:2312.01597 (2023) 1, 2, 3, 5, 8, 9, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.225, + 0.798, + 0.787, + 0.84 + ], + "angle": 0, + "content": "96. Wang, J., Li, X., Zhang, J., Xu, Q., Zhou, Q., Yu, Q., Sheng, L., Xu, D.: Diffusion model is secretly a training-free open vocabulary semantic segmenter. arXiv preprint arXiv:2309.02773 (2023) 5, 11, 13" + }, + { + "type": "list", + "bbox": [ + 0.225, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.574, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Lazy Visual Grounding" + }, + { + "type": "page_number", + "bbox": [ + 0.768, + 0.116, + 0.784, + 0.127 + ], + "angle": 0, + "content": "21" + }, + { + "type": "ref_text", + "bbox": [ + 0.223, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "97. Wang, K., Liew, J.H., Zou, Y., Zhou, D., Feng, J.: Panet: Few-shot image semantic segmentation with prototype alignment. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 8" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.19, + 0.785, + 0.245 + ], + "angle": 0, + "content": "98. Wang, X., Yu, Z., De Mello, S., Kautz, J., Anandkumar, A., Shen, C., Alvarez, J.M.: Freesolo: Learning to segment objects without annotations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14176-14186 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.246, + 0.785, + 0.299 + ], + "angle": 0, + "content": "99. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3124-3134 (2023) 2, 4, 7, 12" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.3, + 0.785, + 0.356 + ], + "angle": 0, + "content": "100. Wang, Y., Shen, X., Hu, S.X., Yuan, Y., Crowley, J.L., Vaufreydaz, D.: Self-supervised transformers for unsupervised object discovery using normalized cut. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14543-14553 (2022) 2, 4, 7" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.357, + 0.785, + 0.398 + ], + "angle": 0, + "content": "101. Wang, Z., Lu, Y., Li, Q., Tao, X., Guo, Y., Gong, M., Liu, T.: Cris: Clip-driven referring image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11686-11695 (2022) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.399, + 0.785, + 0.438 + ], + "angle": 0, + "content": "102. Weber, M., Welling, M., Perona, P.: Towards automatic discovery of object categories. In: Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No. PR00662). vol. 2, pp. 101-108. IEEE (2000) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.439, + 0.785, + 0.494 + ], + "angle": 0, + "content": "103. Wei, Y., Cao, Y., Zhang, Z., Peng, H., Yao, Z., Xie, Z., Hu, H., Guo, B.: iclip: Bridging image classification and contrastive language-image pre-training for visual recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.495, + 0.785, + 0.536 + ], + "angle": 0, + "content": "104. Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE transactions on pattern analysis and machine intelligence 15(11), 1101-1113 (1993) 2, 6" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.537, + 0.785, + 0.577 + ], + "angle": 0, + "content": "105. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.578, + 0.785, + 0.618 + ], + "angle": 0, + "content": "106. Wysoczanska, M., Siméoni, O., Ramamonjisoa, M., Bursuc, A., Trzciński, T., Pérez, P.: Clip-dinoiser: Teaching clip a few dino tricks. arXiv preprint arXiv:2312.12359 (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.619, + 0.785, + 0.674 + ], + "angle": 0, + "content": "107. Xian, Y., Choudhury, S., He, Y., Schiele, B., Akata, Z.: Semantic projection network for zero-and few-label semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8256-8265 (2019) 2" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.675, + 0.785, + 0.715 + ], + "angle": 0, + "content": "108. Xu, J., De Mello, S., Liu, S., Byeon, W., Breuel, T., Kautz, J., Wang, X.: Groupvit: Semantic segmentation emerges from text supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 5, 9, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.716, + 0.785, + 0.758 + ], + "angle": 0, + "content": "109. Xu, J., Liu, S., Vahdat, A., Byeon, W., Wang, X., De Mello, S.: Open-vocabulary panoptic segmentation with text-to-image diffusion models. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.759, + 0.785, + 0.813 + ], + "angle": 0, + "content": "110. Xu, J., Hou, J., Zhang, Y., Feng, R., Wang, Y., Qiao, Y., Xie, W.: Learning open-vocabulary semantic segmentation models from natural language supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 3, 5, 10, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.814, + 0.785, + 0.84 + ], + "angle": 0, + "content": "111. Xu, M., Zhang, Z., Wei, F., Lin, Y., Cao, Y., Hu, H., Bai, X.: A simple baseline for open-vocabulary semantic segmentation with pre-trained vision-language model." + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "22" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.371, + 0.129 + ], + "angle": 0, + "content": "Kang and Cho" + }, + { + "type": "ref_text", + "bbox": [ + 0.251, + 0.147, + 0.785, + 0.174 + ], + "angle": 0, + "content": "In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5, 13" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.176, + 0.785, + 0.217 + ], + "angle": 0, + "content": "112. Yin, Z., Wang, P., Wang, F., Xu, X., Zhang, H., Li, H., Jin, R.: Transfgu: a top-down approach to fine-grained unsupervised semantic segmentation. In: Proc. European Conference on Computer Vision (ECCV) (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.218, + 0.785, + 0.258 + ], + "angle": 0, + "content": "113. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.259, + 0.785, + 0.3 + ], + "angle": 0, + "content": "114. Yuan, L., Chen, D., Chen, Y.L., Codella, N., Dai, X., Gao, J., Hu, H., Huang, X., Li, B., Li, C., et al.: Florence: A new foundation model for computer vision. arXiv preprint arXiv:2111.11432 (2021) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.3, + 0.785, + 0.342 + ], + "angle": 0, + "content": "115. Zadaianchuk, A., Kleindessner, M., Zhu, Y., Locatello, F., Brox, T.: Unsupervised semantic segmentation with self-supervised object-centric representations. Proc. International Conference on Learning Representations (ICLR) (2023) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.342, + 0.785, + 0.383 + ], + "angle": 0, + "content": "116. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.383, + 0.785, + 0.424 + ], + "angle": 0, + "content": "117. Zhang, Q., Wu, Y.N., Zhu, S.C.: Mining and-or graphs for graph matching and object discovery. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 55-63 (2015) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.424, + 0.785, + 0.467 + ], + "angle": 0, + "content": "118. Zhou, B., Zhao, H., Puig, X., Xiao, T., Fidler, S., Barriuso, A., Torralba, A.: Semantic understanding of scenes through the ade20k dataset. International Journal of Computer Vision (IJCV) (2019) 2, 9" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.467, + 0.785, + 0.494 + ], + "angle": 0, + "content": "119. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 3, 5, 11" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.494, + 0.785, + 0.535 + ], + "angle": 0, + "content": "120. Zhu, J.Y., Wu, J., Xu, Y., Chang, E., Tu, Z.: Unsupervised object class discovery via saliency-guided multiple class learning. IEEE transactions on pattern analysis and machine intelligence 37(4), 862-875 (2014) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.535, + 0.785, + 0.577 + ], + "angle": 0, + "content": "121. Zhuang, C., Zhai, A.L., Yamins, D.: Local aggregation for unsupervised learning of visual embeddings. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 4" + }, + { + "type": "ref_text", + "bbox": [ + 0.219, + 0.577, + 0.785, + 0.619 + ], + "angle": 0, + "content": "122. Ziegler, A., Asano, Y.M.: Self-supervised learning of object parts for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4, 7" + }, + { + "type": "list", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.619 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_origin.pdf b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5899e01d5b0d95ad3785cfd7c57a576e2067ea6f --- /dev/null +++ b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/cdf9d4c4-1527-4261-89bb-f885a518daa3_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e046e8f66b06aa0c0a225f05a177e6df2996a13d7cc764034d6a445f5127fde8 +size 7018357 diff --git a/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/full.md b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/full.md new file mode 100644 index 0000000000000000000000000000000000000000..e4ee199f4a9d8a9b99cd5a12c124fa0489692812 --- /dev/null +++ b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/full.md @@ -0,0 +1,414 @@ +# In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation + +Dahyun Kang Minsu Cho + +Pohang University of Science and Technology (POSTECH), South Korea https://cvlab.postech.ac.kr/research/azygrounding + +Abstract. We present Lazy Visual Grounding for open-vocabulary semantic segmentation, which decouples unsupervised object mask discovery from object grounding. Plenty of the previous art casts this task as pixel-to-text classification without object-level comprehension, leveraging the image-to-text classification capability of pretrained vision-and-language models. We argue that visual objects are distinguishable without the prior text information as segmentation is essentially a visual understanding task. Lazy visual grounding first discovers object masks covering an image with iterative Normalized cuts and then later assigns text on the discovered objects in a late interaction manner. Our model requires no additional training yet shows great performance on five public datasets: Pascal VOC, Pascal Context, COCO-object, COCO-stuff, and ADE 20K. Especially, the visually appealing segmentation results demonstrate the model capability to localize objects precisely. + +Keywords: Unsupervised object discovery $\cdot$ Training-free $\cdot$ Open-vocabulary semantic segmentation $\cdot$ CLIP + +![](images/6905edbdc5349072fd1057c928abfd988eef7ff6b63c494019724ea14759a73b.jpg) +Fig. 1: Comparison of a pixel-grounding method and our object-grounding one. A pixel-grounding method (SCLIP [95]) often produces spurious correlations with imprecise edges. Instead of casting open-vocabulary semantic segmentation as pixel-to-text classification, we solve this task with lazy visual grounding: a two-step approach of object mask discovery followed by object grounding in a late interaction manner. + +# 1 Introduction + +Image segmentation is a fundamental task in computer vision, aiming to partition an image into multiple segments with coherent characteristics [51, 88]. The classic approach to the problem is to collect nearby image pixels with shared characteristics using graph partitioning [3, 4, 78], feature clustering [14, 104], histogram equalization [68], edge detection [2, 43]. Deep neural networks for image segmentation [16, 19, 60, 66, 74] have relied on segmentation datasets of pixel-level class supervision [24, 27, 34, 48, 56, 118] via fully-supervised training with the annotated classes. However, such models are trained with the fixed set of classes hence unable to recognize unseen classes beyond the predefined set of seen classes. + +The task of open-vocabulary semantic segmentation (OVSeg) [6,28,52,107, 108] is an image segmentation task of which classes are grounded with text. OVSeg aims to align image segments with potentially unseen classes described in text, spanning the modality of image segmentation to multi-modal. To solve this task, image-text encoders such as CLIP [69] are often used to recognize the text descriptions. A line of work [12,15,95,119] leverages its alignment of image patch and text embeddings to solve OVSeg by pixel-to-text similarity matching. However, this pixel-level classification approach lacks object comprehension, thus this approach often fails to distinguish objects (cf. Figure 1). This is probably because CLIP is trained to represent the holistic image through a separate CLS token embedding, and the patch embeddings are not explicitly trained to represent the corresponding image patch. The imprecise segmentation visuals of these modern multi-modal segmentation models encourage us to revisit the classic computer vision techniques - regarding an image with a bag of segmentable visual units. Imagine a four-legged animal on grass that we want to segment out. Do we need to know its name before segmentation? Having been approached since decades ago, image segmentation is primarily a vision task, and we argue that the objects can be distinguished as visual units given the vision input only without knowing their names in text. + +Our approach, dubbed Lazy Visual Grounding (LaVG), first partitions an image into image segments with a classical image segmentation method, which is based on the vision input and no textual priors on the target classes. The text entity is later assigned to the partitioned segments. For image segmentation, we revisit the related task of unsupervised object discovery [20,82,93,94] which aims to identify visual units. The unsupervised object discovery methods aim to distinguish visual units in bounding boxes or object masks without semantic priors such as classes. Following the recent unsupervised object discovery methods [70, 99, 100], we retrocede the Normalized Cut [78] algorithm. Normalized cut bipartitions a weighted graph into two subgraphs such that the affinity between the two balanced parted groups is minimal. Following the recent object discovery approach [47,53,99,100], we apply Normalized cut on the outputs of a self-supervised vision transformer, DINO [11], which present an empirical property that attends to the salient object region. We iteratively apply Normalized cut until the identified segments cover all image pixels for semantic segmenta + +![](images/d3c6d7488899e5131ef0783a7ba3b8f2866291f082d7c578c920584339afd95e.jpg) + +![](images/cf00ad9a8ec9f85cf6915de81f39d61ad3ff49776e5f85193bc4a96169214584.jpg) + +![](images/69d6241296bd333703f48f05705067240c56e35a4be1f59e7b1444d913ffef5f.jpg) + +![](images/2954c55eea96dd56f902772ba064da25c03134a792adc82c70d1a128bee971b5.jpg) + +![](images/59b0c8bb23882cd31e41d99a94ae1a6131f05e5c6cc2a8d24c53965c709c27bf.jpg) +# + +![](images/8b2034ecb602f4c0f7a90ddf571b146da02b2c2563d045c51c4b2d43d2623b5c.jpg) +${19}/{19}$ + +![](images/13991ec40e313516ea47853af85c69429656d3fff1ff37601a781a7d0c15dd96.jpg) +a p + +![](images/3a9c4b6e98ba1b238e7997d5bb3e7a61cebe2bf17f0736c79808721f2d3a30ff.jpg) +# +[\frac{1}{4}\left( {x - 2}\right) \left( {x + 5}\right) = 0] +${13}/{14}$ +# + +![](images/9bd6502e0d1dc548352633adb05bac4c3dd95d662cef20475db0d7cf7ba2730d.jpg) +Fig. 2: Segmentation results of LaVG given the text description set. These precise object masks and visual grounding results are produced in a training-free fashion. + +![](images/fc4e20ebbfb8cd638358efc5ab15f4ccfd8811ab47e47498bff92925b2ba262e.jpg) + +![](images/567e145d91f7f25ede6188f539a073ffc6c4f67fd500bb81f9df51ddcca05574.jpg) + +![](images/27cb8d888248fa2a7beb05af5a21d2b1d87dae6ed1274c3818e06f2ee27fec1a.jpg) +$\therefore m = \frac{3}{11}$ + +![](images/5ac4776e0fca74eff027f0737f1ed73c7be8ac028b00b859dffd2a038868bdbe.jpg) + +![](images/8ac722bfaf5a01764353a1e7ad8b53bdd919a945ac3dca69d2f15ba218e96b90.jpg) +# + +![](images/b630ea6eeee6e65c34fb06842778f5d61c6c00e773ccf8b24407c6abcbfff4d3.jpg) + +![](images/17343d40d73ff1119978d0864f03361a857b27ecfb2f0f0a6dff10c1a4b6dc9a.jpg) +$\frac{1}{2} =$ +$\therefore m = \frac{3}{11}$ + +![](images/4a2c05e34209f8b861c2f43afa6495f6b47e47fdc6a654e64e6ad8703a54d8ae.jpg) + +![](images/38a65cc23395953048f13004c7bc44629650a99b1bdc7b644d191a387c25e188.jpg) +$\therefore m = \frac{3}{11}$ + +![](images/c7af479d9ae5c8397b5f29031d6f5e7a9c3375e14e9132de41718cb2598d1709.jpg) +1 + +![](images/9e53e0b73a6a216592e04b7c9a600eabff30fba74f119228d007e7b2df362a28.jpg) +… + +![](images/b8dfa11c86a64089e1a27dd5834b18d0678d2ce336daf0e71c4e6e2a262546e6.jpg) + +![](images/3a810a1c6e7fc404315fddc91eb8e8d79fbb45c187ae7f706c6cc1cf85838ddc.jpg) +on wi + +![](images/b1cd9c412b83ec030f0048428fe8edd36c6d3fab7eddd2c8a86387e384baa25f.jpg) +${a}_{4}^{3} = {7}^{3} \cdot {2}^{4}$ + +![](images/d1e507f07930322a74b38957b6c71fa92d749463bf1148fc4782c374b4b4fc47.jpg) +… + +![](images/9eb6297642b3b4ac7f766bbb76908bea529c26f4d00e9c06e9dedc432bf6563d.jpg) +… + +![](images/9702093d28ec942408233172ebf712f25ca8ff3a3a5c3558186b0ed287d1ee78.jpg) +$\therefore m = \frac{3}{11}$ + +![](images/9ccf55dc7f2faa0d8bf354ca82bfdfd3050319229ecbfe47471eaaac53a73613.jpg) + +![](images/b66e32dc28bb151602447da450e49dda1d780d622459c98eb94c52c9bfdc6f61.jpg) + +![](images/22d3ba47d6b1de4c1279409c10d2a3feb46226ad6bc239373f73ea01a1eee50d.jpg) + +tion, i.e., panoptic segmentation [46], and name this approach as Panoptic cut. Once Panoptic cut is finished, then the objects are grounded with text. Each discovered segment is aggregated to form an object prototype embedding and finally matched with given text embedding from a free-form text (Figure 2). Note that the this two-step process requires no additional training hence significantly benefits computational efficiency. LaVG is simple and training-free yet has shown its superiority over not only the learning-free counterpart models [15,38,71,95,119] but also the trained models [7,12,59,61,72,108,110] that used image-text paired datasets [13,56,89]. It is noteworthy that our model localizes objects qualitatively more precisely than the pixel-to-text classification methods (Figure 1). + +Our contributions can be summarized as follows: + +- We present Lazy Visual Grounding (LaVG) which discovers objects first and then later assigns text on the objects in a late interaction manner for open-vocabulary semantic segmentation. +- We revisit Normalized cut to present Panoptic cut that iteratively discovers the object masks that cover all the image pixels. +- Our model is training-free and runs on top of a pretrained vision and language model, reducing training computation burden significantly. +- Our simple method based on graph partitioning quantitatively surpasses the state-of-the-art open-vocabulary segmentation models with segmentation masks with remarkably more precise object boundaries. + +# 2 Related Work + +# 2.1 Unsupervised Object Discovery + +Object discovery [91] has been a fundamental computer vision task. In 2000s, unsupervised object discovery started with discovering the image groups containing + +objects of the same class with analytic techniques [30, 76, 86, 102]. Later, it advances to identify the location of the objects [50, 117, 120], which is viewed as the seminal work of the object discovery task with object localization. Object discovery has been formulated with an input of an image collection [20, 93, 94], where objects are discovered among the image collection via an image pair matching. A recent self-supervised vision transformer named DINO [11] has shown the emerging property of precisely attending the foreground objects within the transformer [92] attention layer. As it inherently provides a strong clue for foreground object saliency, DINO completely revamps the paradigm of unsupervised object discovery [77, 79, 84, 98]. Pioneered by LOST [82], the recently predominating object discovery approach is to distinguish existing objects based on the DINO activation map. One approach is seed-finding [82, 83], which explores foreground/background region from a highly confident seed pixel on the attention map. The other popular approach leverages the graph-partitioning segmentation, e.g., Normalized cut [78], on the DINO attention map to segregate the foreground objects from the background [70, 85, 99, 100], often followed by self-training of instance segmentation models [8, 35] by the obtained masks [70, 85, 99]. Our work is motivated by the second graph-partitioning approach, which robustly identifies foreground objects. + +# 2.2 Self-Supervised Vision Transformers + +Deep self-supervised learning models [33,39] are trained with the self-supervision arisen from the input data rather than external human-annotated labels. The self-supervised learning paradigm has shown effective in terms of task performance as well as generalization ability across multiple downstream tasks [9-11, 17,22,105,121] without task-specific annotations. One popular approach [11,31] trains a model to map an image and its another view to nearby points on the feature space. This class-agnostic objective encourages the image encoder to capture visual invariance. Unlike class-supervised models that often attend on the specific part that represents an object, a representative self-supervised model named DINO [11] shows the emerged localization ability capturing foreground objects on the attention [92]. This property has benefited several dense prediction tasks such as weakly-supervised few-shot segmentation [41] and unsupervised image/video segmentation [112,115,122]. In this work, we leverage these foreground-attended representations as an input source to Normalized cut. + +# 2.3 Vision-and-Language Representation Learning + +Recent advances in efficient and modern hardware accelerate training huge foundation models at scale [5, 57, 113, 114, 116]. Among them, a representative vision and language model named CLIP [69] is trained using 400 million web-crawled image and text pairs to learn cross-modal similarity. CLIP trains two-tower image-text transformer encoders such that embedding similarity between a positive image-text pair is larger than other pairs in a training batch. The open-sourced CLIP models are leveraged to a number of vision and language work + +![](images/f16e4d249853b454862dc63f32b097de650d79a5b85e6a89080e1ff34b8c209e.jpg) +Fig. 3: Two stages of Lazy Visual Grounding (LaVG). Given an image, LaVG first discovers existing object masks without the text information (panoptic cut) and then later assigns the class in text descriptions to each object with cross-modal similarity (object grounding). + +including zero-shot classification [58, 103], long-tailed recognition [63, 64, 90], referring segmentation [45, 101], cross-modal retrieval [37, 62] as well as OVSeg. + +# 2.4 Open-Vocabulary Semantic Segmentation (OVSeg) + +Open-vocabulary segmentation is a pixel-level image classification task with categories described in text. Compared to the classic definition of semantic segmentation [16, 60] of which target classes are a predefined closed set, the target class set of OVSeg consists of open-vocabulary text and not necessarily predefined. Given the different levels of training supervision, OVSeg methods are categorized as mask-supervised [21, 28, 52, 54, 61, 109], image-text pair supervised [7, 12, 59, 61, 72, 108, 110] (hence weakly-supervised), or training-free [15, 38, 42, 95, 96]. Among them, this work corresponds to the last one: OVSeg with no additional training on pretrained models. For example, one of the training-free methods, SCLIP [95], replaces the attention layer of the query and the key cross-similarity into the self-similarity of each embeddings such that it attends on the homogeneous contexts in local regions. Our work is distinguished from the existing work [95, 106, 119] which directly classifies each image pixel with pixel-text similarity without comprehending the objects. On the other hand, our method first identifies the multiple objects in the absence of the text information and later integrates with the text entities with object-wise text assignment in a lazy visual grounding manner. Our training-free method is also distinguished from the trainable OVSeg methods [25, 29, 55, 111] that train MaskFormer segmentation models [18, 19] to obtain class-agnostic masks followed by grounding. + +# 3 Lazy Visual Grounding + +We introduce **Lazy Visual Grounding (LaVG)**. LaVG consists of the two consecutive stages: panoptic object mask discovery (Section 3.1) and object grounding with text (Section 3.2). The key theme is late text interaction; the visual object discovery stage is a vision-only process and does not involve text interaction. Figure 3 briefly visualizes the process. + +# 3.1 Panoptic Object Mask Discovery with Normalized Cut + +Preliminary: Normalized cut. Normalized cut [78] tackles the image segmentation problem with graph partitioning. Given an undirected weighted graph of $(\mathcal{V},\mathcal{E})$ with $N$ nodes, Normalized cut finds the optimal partition of the graph nodes into two disjoint sets of nodes $\mathcal{A}$ and $\mathcal{B}$ such that the removed weights of the edges between $\mathcal{A}$ and $\mathcal{B}$ be the minimum [104]. The sum of the lost weights between the bipartitioned subgraphs is defined as cut: + +$$ +\operatorname {c u t} (\mathcal {A}, \mathcal {B}) = \sum_ {u \in \mathcal {A}, v \in \mathcal {B}} w (u, v). \tag {1} +$$ + +In the image segmentation perspective, the subgraphs $\mathcal{A}$ and $\mathcal{B}$ correspond to two image segments that cover an image. The bipartition should avoid bad partitioning such as a tiny fraction and the rest of the mass, which still satisfies the definition of the minimum cut. Thus, a more preferable cut is a bipartition that balances the sizes of subgraphs, where each subgraph is properly associated with the entire graph. Formally, + +$$ +\operatorname {N c u t} (\mathcal {A}, \mathcal {B}) = \frac {\operatorname {c u t} (\mathcal {A} , \mathcal {B})}{\operatorname {a s s o c} (\mathcal {A} , \mathcal {V})} + \frac {\operatorname {c u t} (\mathcal {A} , \mathcal {B})}{\operatorname {a s s o c} (\mathcal {B} , \mathcal {V})}, \tag {2} +$$ + +$$ +\operatorname {w h e r e} \operatorname {a s s o c} (\mathcal {A}, \mathcal {V}) = \sum_ {u \in \mathcal {A}, t \in \mathcal {V}} w (u, t). \tag {3} +$$ + +The association factor normalizes the cuts by the connected proportion to the entire graph. Through the systematic derivation, the work of Normalized cut [78] shows that minimizing Equation 2 is equivalent to solving an eigenvector system. Let us denote that $\mathbf{W} \in \mathbb{R}^{N \times N}$ is a symmetric matrix of the non-negative edge weights, and $\mathbf{D}$ is a diagonal matrix of which diagonal elements correspond to the row-wise sum of $\mathbf{W}$ . Then the solution of Normalized cut is obtained by solving the following generalized eigenvalue system: + +$$ +\left(\boldsymbol {D} - \boldsymbol {W}\right) \boldsymbol {x} = \lambda \boldsymbol {D} \boldsymbol {x} \tag {4} +$$ + +and obtaining the eigenvector corresponding to the second-smallest eigenvalue1. Let us denote the eigenvector corresponding to the second-smallest eigenvalue as $\pmb{z} \in \mathbb{R}^N$ . The set of nodes $\mathcal{V} = \{v_1, \dots, v_N\}$ is divided into $\mathcal{A}$ and $\mathcal{B}$ by the following bipartition rule: + +$$ +v _ {n} \in \mathcal {A} \quad \text {i f} z _ {n} > \bar {z}, \tag {5} +$$ + +$$ +v _ {n} \in \mathcal {B} \quad \text {o t h e r w i s e}, \tag {6} +$$ + +where $\bar{z}$ means the average of the vector elements of $z$ . For the detailed derivation, please refer to the original paper [78]. + +![](images/f08b558da06293bdc9496905ccbcbf302656a4eb5ceb48977e96e856a93fcfe7.jpg) +Fig. 4: The result of Normalized cut [78] before and after refinement. + +Panoptic cut. The unsupervised object mask discovery step inherits the idea of the recent object discovery work [85, 99, 100] based on Normalized cut and is adapted to semantic segmentation. Specifically, the recent work [85, 99, 100] presents to leverage the DINO ViT [11, 26] feature map as an input feature to Normalized cut. As the task of interest is to identify objects and also assign a semantic class for all image pixels, i.e., panoptic segmentation, we call this unsupervised object mask discovery step as Panoptic cut. + +Given an input image, the image is fed to a pre-trained self-supervised DINO ViT to obtain the visual feature map. Following the existing work [1,41,122], we use the intermediate byproduct during the feature feed-forward process as the dense feature map as it is empirically shown to highlight the salient foreground objects. In the last layer of the ViT, the patch token similarity between the key embedding produces an affinity map: + +$$ +\boldsymbol {W} _ {x x ^ {\prime}} = \frac {\boldsymbol {K} _ {x} ^ {\top} \boldsymbol {K} _ {x ^ {\prime}}}{\| \boldsymbol {K} _ {x} \| _ {2} \| \boldsymbol {K} _ {x ^ {\prime}} \| _ {2}}, \tag {7} +$$ + +where $x, x'$ indicates feature map index. In the graph partitioning perspective, the set of patch key embeddings correspond to nodes and their cosine similarity values correspond to the edge weights. Such definition of graph is applied to the Normalized cut system in Equation 4. + +The solved system yields two sets of nodes, $\mathcal{A}$ and $\mathcal{B}$ . We determine the foreground between them by following the few heuristics from MaskCut [99]. $\mathcal{A}$ is foreground if a) $\mathcal{A}$ contains the maximum absolute value in the second smallest eigenvector $z$ and b) $\mathcal{A}$ is covering less than the two corners of the matrix. Once we determine the foreground between $\mathcal{A}$ and $\mathcal{B}$ , then $\mathcal{A}$ is discovered as an object, and we iterate bipartitioning the rest of the background node set until i) there are less than five nodes left or ii) the iteration count reaches the preset maximum2. After the iteration halts, the undiscovered region is marked as background. We often observe noisy object boundaries or the salt and pepper artifacts such as in Figure 4. We thus fill the holes and refine the output bipartition masks with DenseCRF [49], before the masks are resized to the original image size. We note that the process introduced so far uses neither human annotation nor text entity. + +Panoptic cut distinguishes from the unsupervised object discovery models [85, 99, 100] in that the background region is also semantically segmented. + +Table 1: Benchmarks for open-vocabulary semantic segmentation + +
With a background categoryWithout background category
VOC21Context60COCO-ObjectVOC20Context59ADE20KCOCO-Stuff
number of classes2160812059150171
+ +For example, the sky and ceiling are not often perceived as objects but can be semantically grouped. + +# 3.2 Object Grounding with Class Descriptions in Text + +Object mask grounding with cross-modal similarity. We adopt an image-text multi-modal encoder backbone to assign a text entity to each discovered mask by cross-modal similarity matching. We use the patch embedding of the SCLIP [95] backbone which roughly aligns the local image context with each patch embedding. Given a set of $Y$ text classes, the text class descriptions are fed to the CLIP text encoder to obtain the set of text embeddings: $\{c_y\}_{y=1}^Y$ . Note that some benchmarks contain the background class. In these cases, following [95], we feed the background query text descriptions, e.g., wall, sky, etc., to avoid the ambiguous semantic of the text "background". The input image is fed to the SCLIP image encoder which returns the feature map: $\{f_x | x \in [1, H] \times [1, W]\}$ , where $x$ indicates a position. The image features that fall into an object mask region $\mathcal{M}$ are averaged to construct the object prototype [87, 97]. The class distribution is obtained by the cosine similarity of the object prototype and the text embedding: + +$$ +p \left(\boldsymbol {f} _ {x \in \mathcal {M}} | y\right) \propto \frac {1}{| \mathcal {M} |} \sum_ {x ^ {\prime} \in \mathcal {M}} \boldsymbol {f} _ {x ^ {\prime}} ^ {\top} \boldsymbol {c} _ {y} \tag {8} +$$ + +to assign the text class on the object, i.e., object-wise grounding. + +Segmentation prediction. The class logit map is resized to the input image size by bilinear interpolation. When the background query set is used, the corresponding logits are merged as background. Each object mask is predicted with the highest cross-modal similarity class index. + +# 4 Experiments + +# 4.1 Experimental Setup + +Implementation details. For the Panoptic cut input source, we use the feature map from DINO ViT-B/8 [11,26] trained on ImageNet1K [75] without labels. To solve the generalized eigenvector system in Equation 4, we use the PyTorch [67] built-in function 1obpcg which is compatible with GPUs. The maximum iteration for Panoptic cut is set to 16. We also use the pre-trained CLIP ViT-B/16 [69] for the image/text feature extractor. For object grounding with CLIP, we adopt + +![](images/a6745357458824444328cd1900cb69beefc8d345254bd490d7145f8d0a98ebe7.jpg) +Fig. 5: Qualitative comparison of our method and baselines on COCO-stuff 164K. The * mark on the text set denotes the false positive class prediction of our model. + +the sliding-window segmentation prediction scheme on high-resolution images, which is shown effective from the previous work [12, 95, 108]. We upsample the image as well as the Panoptic cut object masks such that the shorter size of the image becomes 336. The sliding window and the stride are set to $224 \times 224$ and $112 \times 112$ , respectively. Then each crop is fed to the image encoder which returns the pixel-level logit map on each cropped window, followed by averaging the logits. The codebase is adopted from SCLIP [95] which is based on mmseg [23]. An Nvidia RTX 3090 GPU is used for all experiments. + +Datasets and benchmarks. We evaluate our method on five publicly available open-vocabulary semantic segmentation datasets: Pascal VOC 2012 [27], Pascal Context [65], ADE20K [118], COCO-Stuff and COCO-Object [56] plus two variants with the background queries. Background queries such as wall, sky, etc. are added on Pascal VOC and Pascal Context, which are indicated as VOC21 and Context60, respectively. We use the background query set from SCLIP [95] and do not engineer it further. Table 1 shows the configuration of the dataset classes. + +![](images/a1bb5f8793f30cd0d00da87acb5cf8734366486c6ea483cfd3b245f32456b46c.jpg) +Fig. 6: Qualitative comparison of our method and others. The first three columns are directly copied from the paper in the third columns [6,7,32,108,110]. + +For evaluation, we use the standard mean IoU metric: $\mathrm{mIoU} = \frac{1}{Y}\sum_{y}\mathrm{IoU}_{y}$ , where $\mathrm{IoU}_y$ denotes an IoU value of $y$ -th class. + +Baseline methods. Vanilla CLIP is the most naive baseline. The set of image patch embeddings and the set of text embeddings are obtained from the pre-trained CLIP image and text encoder backbone, respectively. Cosine similarity between the two sets of embeddings is computed to obtain the cross-modal pixel-wise text similarity, which is directly translated as semantic segmentation prediction. SCLIP [95] is the primary baseline. SCLIP modifies the intermediate function of the attention layers in the pre-trained CLIP ViTs such that the final image patch embedding better represents the corresponding image patch semantics. + +# 4.2 Experimental Results + +Qualitative results. We demonstrate the qualitative examples of the model outputs in Figure 5. Our model demonstrates advanced segmentation visuals compared to our baselines. Note that CLIP and SCLIP [95] are pixel-wise dense prediction methods. When segmentation prediction operates at pixel level, it does not necessarily comprehend the object shapes, resulting in noisy segmentation masks of objects. Ours, however, proceeds object mask discovery stage and returns object-level masks. As seen, our model predicts sharper and cleaner delineations that accurately capture semantic object boundaries, e.g., our model segments out the clear shape of the kites in the sky (first image). Other nice properties that our model often exhibits include capturing tiny kites (first im + +Table 2: Performance (mIoU, %) comparison of the state-of-the-art open-vocabulary segmentation methods on seven public benchmarks. The models with $\dagger$ do not use CLIP. The models with $\checkmark$ involve additional training on top of the pretrained backbone. The numerical results [12,61,69,80,110,119] are adopted from SCLIP [95]. + +
MethodtrainWith a background categoryWithout background category
VOC21Context60COCO-Obj.VOC20Context59ADECOCO-Stf.
CLIP [69]18.89.98.149.411.13.15.7
ZeroSeg [15]40.820.420.2----
MaskCLIP [119]43.423.220.674.926.411.916.7
ReCo [80]25.119.915.757.722.311.214.8
CLIPpy [71]52.2-32.0--13.5-
DiffSegmenter† [96]60.127.537.9----
SCLIP [95]59.130.430.580.434.216.122.4
ViL-Seg [59]✓34.416.316.4--11.9-
ViewCo [72]✓52.423.023.5----
MixReorg [7]✓47.923.9-----
GroupViT† [108]✓52.318.727.579.723.410.415.3
TCL [12]✓51.224.330.477.530.314.919.6
OVSegmentor† [110]✓53.820.425.1--5.6-
SegCLIP [61]✓52.624.726.5---
LaVG (ours)62.131.634.282.534.715.823.2
+ +age), segmentation with little spurious correlation (second image), and repeated chairs (third image). + +We also compare various other OVSeg models [6,7,32,108,110] in Figure 6. We copy and paste the visualization on their original papers and present our model's prediction. Thus the results are not much cherry-picked as the choice of visualized images is taken from the other work. Most previous work often presents visualized prediction favorably on Pascal VOC, most of which contain the objects that stand out. Unlike the examples of the other work with incorrect class predictions (the dog in the first image), holes in predicted masks (the second image), and misaligned contour (third example), our model presents much cleaner mask prediction and better class prediction. + +Quantitative comparison with state-of-the-art models. Table 2 compares the existing OVSeg methods on seven public benchmarks. The performance values of MaskCLIP [119], ReCo [38], and TCL [12] are brought from the reimplementation of SCLIP, which are either higher or the same values as the ones in the original papers. The performance values of the rest of work [7,15,59,61,71,72,96, 108,110] are from their original performance reports. Our model outperforms the previous state-of-the-art models. Note that our model outperforms not only the learning-free models [15,38,71,95,119] but also the weakly-supervised learning models [7,12,59,61,72,108,110] that exploits image-text paired datasets, e.g., CC3M [13], YFCC [89], or COCO [56] from the $3.4\mathrm{M}$ to $26\mathrm{M}$ dataset scale. + +Table 3: Comparison with different object mask discovery models + +
VOC21Context60COCO-Obj.VOC20Context59COCO-Stf.
Normalized cut [78]47.626.328.278.129.320.0
CutLER-CascadedRCNN [99]57.329.333.279.632.222.3
Panoptic cut (4 iterations)61.130.333.781.333.422.6
Panoptic cut (16 iterations)62.131.634.282.534.723.2
Panoptic cut (32 iterations)61.431.734.282.634.823.3
Ground-truth object masks68.337.144.187.740.227.6
+ +Table 4: Comparison with different grounding schemes. $\mathcal{O}$ denotes object mask region. + +
VOC21Context60COCO-ObjectVOC20Context59COCO-Stuff
O-masked attention54.626.927.661.728.218.3
Gaussian blur on non-O59.830.931.571.633.421.5
O-averaged prototype62.131.634.282.534.723.2
+ +# 4.3 Experimental Analyses + +We ablate the components in our method and see their effectiveness. In tables, our method is colored in gray. + +Comparison with other object mask discovery models. To verify the strength of Panoptic cut in segmentation, we compare Panoptic cut with other object discovery models and compare them in Table 3. Among the modern object discovery neural networks, CutLER [99] is compared. CutLER first produces object mask proposals with a derivative of Normalized cut (MaskCut) and uses the proposals as self-supervision to train an unsupervised instance segmentation & object detection architecture, e.g., Cascaded-RCNN [8]. To adapt CutLER to semantic segmentation, the undetected pixels are considered as a single region and averaged at the feature level as background. The naïve adoption of the state-of-the-art object discovery method does not directly translate to high open-vocabulary segmentation performance. We observe that CutLER tends to detect fine-grained parts of foreground objects while leaving the background under-segmented, e.g., undetected sky and sea grouped together, probably because the training objective is to detect foreground objects. Although this model achieves promising performance that beats most of the methods in Table 2 but is lower than Panoptic cut. Panoptic cut produces proper semantic segmentation of background, plus, it requires no additional training. We believe that Panoptic cut is a more suitable choice than instance detection or salient detection methods [36] for semantic segmentation, where all the present pixels should be classified for segmentation. Panoptic cut iterates the preset number of iterations, where we gain from $0.5\%$ to $1.3\%$ point mIoU gain from maximum of 4 to 16 iterations. + +Table 5: Comparison of computational cost measured with an Nvidia RTX 3090. The columns with $\dagger$ are taken from [21]. + +
methodsZSSeg [111]†CATseg [21]†DiffSegmenter [96]LaVG
# learnable params. (M)102.870.300
# total params. (M)530.8433.71453198
training time (min)958.5875.500
inference time (s)2.730.540.5912.59
+ +Comparison with different grounding schemes. We explore different grounding schemes and compare them on Table 4. Specifically, three object embedding methods are compared, all based on the SCLIP feature. First, object-masked $\mathcal{O}$ -masked attention [18, 40, 44] forces the forward path of ViTs to attend only to the designated region. We zero out the non-object region on the input image and set a large negative value on the non-object pixel patch embedding before the softmax in the attention in the ViT backbone. Recent work [81] explores a way to explicitly draw attention on the input image level in a human-friendly manner. We adopt their idea of applying Gaussian blur on the non-object regions on the input image and taking the global image representation as the local feature. Note that these two schemes require multiple feed-forward passes with the same image with different attention masks and different Gaussian blurred regions. Our method (the last line) is the simplest: averaging the region patch embedding (Eq. 8). The object-averaged prototype shows superior performance in terms of both end-task accuracy and complexity. + +Computational complexity. Table 5 compares the computational cost of LaVG with a training-free model [96] and trained models [21, 111]. The outstanding advantage of training-free models is the computational efficiency from the absence of time, data, and computation burden in additional training. Compared to another training-free ovseg method [96] based on diffusion models [73] which leverages image/caption generation models with heavy parameters, we use much more lightweight feature embedding models. However, our iterative process of panoptic cut introduces a longer inference time. + +# 4.4 Limitations of our approach + +We outline four characteristic limitations of our method. The intrinsic problem of our method is the extensive computation time and memory consumption induced by leveraging the graph-based partitioning algorithm. Normalized cut generally consumes the excessive use of memory due to the use of $N \times N$ size affinity matrix. For example, running Normalized cut on a $512 \times 512$ RGB image directly leads to the out-of-memory error. However, using a well-abstracted downsampled feature map of the DINO attention greatly reduces the memory consumption and smoothly executes on a single regular GPU device, e.g., Nvidia RTX 3090. Also, + +our approach is inference-only thus includes no training time, which is still more computationally efficient than training models. + +In terms of the end-task performance, we witness the remarkable qualitative improvement as seen in Figures 5-6, but it does not directly enhance mIoU values substantially. This is because the evaluation metric is pixel-level classification rather than favoring aligned edges or clean shapes of objects. In addition, the proposed method occasionally misclassifies objects which also negatively affects the mIoU performance. + +Another limitation is qualitatively observed in the last example of Figure 5. Due to the sliding-window segmentation inference technique, the cropped region suffers the part-whole ambiguity issue and sometimes predicts a wrong class on the region. This side effect is often observed on textureless regions, e.g., the model confuses the sky and cloud in the last example of Figure 5. However, the recognition of the image as a whole might remedy the part-whole ambiguity, but the accuracy of the small-resolution images drops at the same time. + +Lastly, out method implemented with CLIP is potentially inappropriate for closed-vocabulary segmentation on specialized domains such as medical or industrial vision. For such problems on specific domains, however, the concept of lazy grounding can be used with domain-specific encoders. + +# 5 Conclusion + +We have proposed Lazy Visual Grounding, a late-interaction semantic segmentation approach, for open-vocabulary semantic segmentation. Our method first proceeds unsupervised object mask discovery by graph partitioning and the lazy grounding on the discovered object masks. This simple and training-free method exceeds the performance of the caption-based weakly-supervised learning models. Given the observation that the classic graph partitioning method surpasses such trendy deep-learning models, we claim that semantic pixel-grouping is crucial for semantic segmentation and should be prioritized especially when segmentation supervision is not available. Last but not least, given the output format of our method is object-level and hence identifiable, LaVG provides more accurate and crisp object boundaries, which makes it particularly suitable for grounding tasks that require object-level recognition with precise boundaries. This work may open the door for training-free open-vocabulary instance segmentation, which has not been actively studied, yet. + +Acknowledgements. This work was supported by Samsung Electronics (IO20 1208-07822-01), the NRF grant (NRF-2021R1A2C3012728 $(45\%)$ ), and the IITP grants (RS-2022-II220959: Few-Shot Learning of Causal Inference in Vision and Language for Decision Making $(50\%)$ , RS-2019-II191906: AI Graduate School Program at POSTECH $(5\%)$ ) funded by Ministry of Science and ICT, Korea. We also thank Sua Choi for her helpful discussion. + +# References + +1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv preprint arXiv:2112.05814 2(3), 4 (2021) 7 +2. Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: From contours to regions: An empirical evaluation. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2294-2301. IEEE (2009) 2 +3. Blake, A., Kohli, P., Rother, C.: Markov random fields for vision and image processing. MIT press (2011) 2 +4. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on pattern analysis and machine intelligence 23(11), 1222-1239 (2001) 2 +5. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4 +6. Bucher, M., Vu, T.H., Cord, M., Pérez, P.: Zero-shot semantic segmentation. Advances in Neural Information Processing Systems 32 (2019) 2, 10, 11 +7. Cai, K., Ren, P., Zhu, Y., Xu, H., Liu, J., Li, C., Wang, G., Liang, X.: Mixreorg: Cross-modal mixed patch reorganization is a good mask learner for open-world semantic segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1196-1205 (2023) 3, 5, 10, 11 +8. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018) 4, 12 +9. Caron, M., Bojanowski, P., Joulin, A., Douze, M.: Deep clustering for unsupervised learning of visual features. In: Proc. European Conference on Computer Vision (ECCV) (2018) 4 +10. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4 +11. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2021) 2, 4, 7, 8 +12. Cha, J., Mun, J., Roh, B.: Learning to generate text-grounded mask for open-world semantic segmentation from only image-text pairs. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2, 3, 5, 9, 11 +13. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12m: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3558-3568 (2021) 3, 11 +14. Chen, C.W., Luo, J., Parker, K.J.: Image segmentation via adaptive k-mean clustering and knowledge-based morphological operations with biomedical applications. IEEE transactions on image processing 7(12), 1673-1683 (1998) 2 +15. Chen, J., Zhu, D., Qian, G., Ghanem, B., Yan, Z., Zhu, C., Xiao, F., Elhoseiny, M., Culatana, S.C.: Exploring open-vocabulary semantic segmentation from clip vision encoder distillation only. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 3, 5, 11 + +16. Chen, L.C., Papandreou, G., Kokkinos, I., Murphy, K., Yuille, A.L.: Deeplab: Semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected crfs. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2017) 2, 5 +17. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020) 4 +18. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1290-1299 (2022) 5, 13 +19. Cheng, B., Schwing, A.G., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation (2021) 2, 5 +20. Cho, M., Kwak, S., Schmid, C., Ponce, J.: Unsupervised object discovery and localization in the wild: Part-based matching with bottom-up region proposals. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1201-1210 (2015) 2, 4 +21. Cho, S., Shin, H., Hong, S., An, S., Lee, S., Arnab, A., Seo, P.H., Kim, S.: Cat-seg: Cost aggregation for open-vocabulary semantic segmentation (2023) 5, 13 +22. Choi, S., Kang, D., Cho, M.: Contrastive mean-shift learning for generalized category discovery. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4 +23. Contributors, M.: MMSegmentation: Openmmlab semantic segmentation toolbox and benchmark. https://github.com/open-mmlab/mmsegmentation (2020) 9 +24. Cordts, M., Omran, M., Ramos, S., Rehfeld, T., Enzweiler, M., Benenson, R., Franke, U., Roth, S., Schiele, B.: The cityscapes dataset for semantic urban scene understanding. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 2 +25. Ding, Z., Wang, J., Tu, Z.: Open-vocabulary universal image segmentation with maskclip. Proc. International Conference on Machine Learning (ICML) (2023) 5 +26. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: Proc. International Conference on Learning Representations (ICLR) (2021) 7, 8 +27. Everingham, M., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes (voc) challenge. International Journal of Computer Vision (IJCV) (2010) 2, 9 +28. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 5 +29. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5 +30. Grauman, K., Darrell, T.: Unsupervised learning of categories from sets of partially matching image features. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 1, pp. 19-25. IEEE (2006) 4 +31. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap your own latent-a new approach to self-supervised learning. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4 + +32. Gu, Z., Zhou, S., Niu, L., Zhao, Z., Zhang, L.: Context-aware feature generation for zero-shot semantic segmentation. In: Proceedings of the 28th ACM International Conference on Multimedia. pp. 1921-1929 (2020) 10, 11 +33. Gui, J., Chen, T., Cao, Q., Sun, Z., Luo, H., Tao, D.: A survey of self-supervised learning from multiple perspectives: Algorithms, theory, applications and future trends. arXiv preprint arXiv:2301.05712 (2023) 4 +34. Gupta, A., Dollar, P., Girshick, R.: Lvis: A dataset for large vocabulary instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5356-5364 (2019) 2 +35. He, K., Gkioxari, G., Dollár, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017) 4 +36. Hsu, K.J., Tsai, C.C., Lin, Y.Y., Qian, X., Chuang, Y.Y.: Unsupervised cnn-based co-saliency detection with graphical optimization. In: Proceedings of the European conference on computer vision (ECCV). pp. 485-501 (2018) 12 +37. Huang, S., Gong, B., Pan, Y., Jiang, J., Lv, Y., Li, Y., Wang, D.: Vop: Text-video co-operative prompt tuning for cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6565-6574 (June 2023) 5 +38. Iscen, A., Caron, M., Fathi, A., Schmid, C.: Retrieval-enhanced contrastive vision-text models. Advances in Neural Information Processing Systems (NeurIPS) (2023) 3, 5, 11 +39. Jing, L., Tian, Y.: Self-supervised visual feature learning with deep neural networks: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2020) 4 +40. Kang, D., Cho, M.: Integrative few-shot learning for classification and segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9979-9990 (2022) 13 +41. Kang, D., Koniusz, P., Cho, M., Murray, N.: Distilling self-supervised vision transformers for weakly-supervised few-shot classification & segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4, 7 +42. Karazija, L., Laina, I., Vedaldi, A., Rupprecht, C.: Diffusion models for zero-shot open-vocabulary segmentation. arXiv preprint arXiv:2306.09316 (2023) 5 +43. Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International journal of computer vision 1(4), 321-331 (1988) 2 +44. Kenton, J.D.M.W.C., Toutanova, L.K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of NAACL-HLT (2019) 13 +45. Kim, S., Kang, M., Park, J.: Risclip: Referring image segmentation framework using clip. arXiv preprint arXiv:2306.08498 (2023) 5 +46. Kirillov, A., He, K., Girshick, R., Rother, C., Dollar, P.: Panoptic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9404-9413 (2019) 3 +47. Kirillov, A., Levinkov, E., Andres, B., Savchynskyy, B., Rother, C.: Instancecut: from edges to instances with multicut. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5008-5017 (2017) 2 +48. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) 2 + +49. Krahenbuhl, P., Koltun, V.: Efficient inference in fully connected crfs with gaussian edge potentials. Advances in neural information processing systems 24 (2011) 7 +50. Lee, Y.J., Grauman, K.: Shape discovery from unlabeled image collections. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2254-2261. IEEE (2009) 4 +51. Li, B., Shi, Y., Qi, Z., Chen, Z.: A survey on semantic segmentation. In: 2018 IEEE International Conference on Data Mining Workshops (ICDMW). pp. 1233-1240. IEEE (2018) 2 +52. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: International Conference on Learning Representations (2022), https://openreview.net/forum?id=RriDjddCLN 2, 5 +53. Li, Z., Chen, J.: Superpixel segmentation using linear spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1356-1363 (2015) 2 +54. Li, Z., Zhou, Q., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Open-vocabulary object segmentation with diffusion models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 5 +55. Liang, F., Wu, B., Dai, X., Li, K., Zhao, Y., Zhang, H., Zhang, P., Vajda, P., Marculescu, D.: Open-vocabulary semantic segmentation with mask-adapted clip. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5 +56. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Proc. European Conference on Computer Vision (ECCV) (2014) 2, 3, 9, 11 +57. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. In: NeurIPS (2023) 4 +58. Liu, H., Son, K., Yang, J., Liu, C., Gao, J., Lee, Y.J., Li, C.: Learning customized visual models with retrieval-augmented knowledge. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15148-15158 (2023) 5 +59. Liu, Q., Wen, Y., Han, J., Xu, C., Xu, H., Liang, X.: Open-world semantic segmentation via contrasting and clustering vision-language embedding. In: Proc. European Conference on Computer Vision (ECCV) (2022) 3, 5, 11 +60. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2015) 2, 5 +61. Luo, H., Bao, J., Wu, Y., He, X., Li, T.: Segclip: Patch aggregation with learnable centers for open-vocabulary semantic segmentation. In: Proc. International Conference on Machine Learning (ICML) (2023) 3, 5, 11 +62. Ma, H., Zhao, H., Lin, Z., Kale, A., Wang, Z., Yu, T., Gu, J., Choudhary, S., Xie, X.: Ei-clip: Entity-aware interventional contrastive learning for e-commerce cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18051–18061 (2022) 5 +63. Ma, T., Geng, S., Wang, M., Shao, J., Lu, J., Li, H., Gao, P., Qiao, Y.: A simple long-tailed recognition baseline via vision-language model. arXiv preprint arXiv:2111.14745 (2021) 5 +64. Ma, T., Geng, S., Wang, M., Xu, S., Li, H., Zhang, B., Gao, P., Qiao, Y.: Unleashing the potential of vision-language models for long-tailed visual recognition (2022) 5 + +65. Mottaghi, R., Chen, X., Liu, X., Cho, N.G., Lee, S.W., Fidler, S., Urtasun, R., Yuille, A.: The role of context for object detection and semantic segmentation in the wild. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2014) 9 +66. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2015) 2 +67. Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A.: Automatic differentiation in pytorch. In: Advances in Neural Information Processing Systems (NeurIPS) Workshop Autodiff (2017) 8 +68. Pizer, S.M., Amburn, E.P., Austin, J.D., Cromartie, R., Geselowitz, A., Greer, T., ter Haar Romeny, B., Zimmerman, J.B., Zuiderveld, K.: Adaptive histogram equalization and its variations. Computer vision, graphics, and image processing 39(3), 355-368 (1987) 2 +69. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Proc. International Conference on Machine Learning (ICML) (2021) 2, 4, 8, 11 +70. Rambhatla, S.S., Misra, I., Chellappa, R., Shrivastava, A.: Most: Multiple object localization with self-supervised transformers for object discovery. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 4 +71. Ranasinghe, K., McKinzie, B., Ravi, S., Yang, Y., Toshev, A., Shlens, J.: Perceptual grouping in contrastive vision-language models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 3, 11 +72. Ren, P., Li, C., Xu, H., Zhu, Y., Wang, G., Liu, J., Chang, X., Liang, X.: Viewco: Discovering text-supervised segmentation masks via multi-view semantic consistency. arXiv preprint arXiv:2302.10307 (2023) 3, 5, 11 +73. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models (2021) 13 +74. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: International Conference on Medical image computing and computer-assisted intervention (2015) 2 +75. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International Journal of Computer Vision (IJCV) 115(3), 211-252 (2015) 8 +76. Russell, B.C., Freeman, W.T., Efros, A.A., Sivic, J., Zisserman, A.: Using multiple segmentations to discover objects and their extent in image collections. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 2, pp. 1605-1614. IEEE (2006) 4 +77. Seitzer, M., Horn, M., Zadaianchuk, A., Zietlow, D., Xiao, T., Simon-Gabriel, C.J., He, T., Zhang, Z., Scholkopf, B., Brox, T., et al.: Bridging the gap to real-world object-centric learning. arXiv preprint arXiv:2209.14860 (2022) 4 +78. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence 22(8), 888-905 (2000) 2, 4, 6, 7, 12 +79. Shin, G., Albanie, S., Xie, W.: Unsupervised salient object detection with spectral cluster voting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3971-3980 (2022) 4 +80. Shin, G., Xie, W., Albanie, S.: Reco: Retrieve and co-segment for zero-shot transfer. Advances in Neural Information Processing Systems (NeurIPS) (2022) 11 + +81. Shtedritski, A., Rupprecht, C., Vedaldi, A.: What does clip know about a red circle? visual prompt engineering for vlms. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 13 +82. Simeoni, O., Puy, G., Vo, H.V., Roburin, S., Gidaris, S., Bursuc, A., Pérez, P., Marlet, R., Ponce, J.: Localizing objects with self-supervised transformers and no labels. In: Proc. British Machine Vision Conference (BMVC) (2021) 2, 4 +83. Simeoni, O., Sekkat, C., Puy, G., Vobecky, A., Zablocki, E., Pérez, P.: Unsupervised object localization: Observing the background to discover objects. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3176-3186 (2023) 4 +84. Simeoni, O., Zablocki, E., Gidaris, S., Puy, G., Pérez, P.: Unsupervised object localization in the era of self-supervised vits: A survey. arXiv preprint arXiv:2310.12904 (2023) 4 +85. Singh, S., Deshmukh, S., Sarkar, M., Krishnamurthy, B.: Locate: Self-supervised object discovery via flow-guided graph-cut and bootstrapped self-training. Proc. British Machine Vision Conference (BMVC) (2023) 4, 7 +86. Sivic, J., Russell, B.C., Efros, A.A., Zisserman, A., Freeman, W.T.: Discovering objects and their location in images. In: Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1. vol. 1, pp. 370-377. IEEE (2005) 4 +87. Snell, J., Swersky, K., Zemel, R.: Prototypical networks for few-shot learning. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 8 +88. Thoma, M.: A survey of semantic segmentation. arXiv preprint arXiv:1602.06541 (2016) 2 +89. Thomee, B., Shamma, D.A., Friedland, G., Elizalde, B., Ni, K., Poland, D., Borth, D., Li, L.J.: Yfcc100m: The new data in multimedia research. Communications of the ACM 59(2), 64-73 (2016) 3, 11 +90. Tian, C., Wang, W., Zhu, X., Dai, J., Qiao, Y.: Vl-ltr: Learning class-wise visual-linguistic representation for long-tailed visual recognition. In: European Conference on Computer Vision. Springer (2022) 5 +91. Tuytelaars, T., Lampert, C.H., Blaschko, M.B., Buntine, W.: Unsupervised object discovery: A comparison. International Journal of Computer Vision (IJCV) (2010) 3 +92. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 4 +93. Vo, H.V., Bach, F., Cho, M., Han, K., LeCun, Y., Pérez, P., Ponce, J.: Unsupervised image matching and object discovery as optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8287-8296 (2019) 2, 4 +94. Vo, H.V., Pérez, P., Ponce, J.: Toward unsupervised, multi-object discovery in large-scale image collections. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIII 16. pp. 779-795. Springer (2020) 2, 4 +95. Wang, F., Mei, J., Yuille, A.: Sclip: Rethinking self-attention for dense vision-language inference. arXiv preprint arXiv:2312.01597 (2023) 1, 2, 3, 5, 8, 9, 10, 11 +96. Wang, J., Li, X., Zhang, J., Xu, Q., Zhou, Q., Yu, Q., Sheng, L., Xu, D.: Diffusion model is secretly a training-free open vocabulary semantic segmenter. arXiv preprint arXiv:2309.02773 (2023) 5, 11, 13 + +97. Wang, K., Liew, J.H., Zou, Y., Zhou, D., Feng, J.: Panet: Few-shot image semantic segmentation with prototype alignment. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 8 +98. Wang, X., Yu, Z., De Mello, S., Kautz, J., Anandkumar, A., Shen, C., Alvarez, J.M.: Freesolo: Learning to segment objects without annotations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14176-14186 (2022) 4 +99. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3124-3134 (2023) 2, 4, 7, 12 +100. Wang, Y., Shen, X., Hu, S.X., Yuan, Y., Crowley, J.L., Vaufreydaz, D.: Self-supervised transformers for unsupervised object discovery using normalized cut. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14543-14553 (2022) 2, 4, 7 +101. Wang, Z., Lu, Y., Li, Q., Tao, X., Guo, Y., Gong, M., Liu, T.: Cris: Clip-driven referring image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11686-11695 (2022) 5 +102. Weber, M., Welling, M., Perona, P.: Towards automatic discovery of object categories. In: Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No. PR00662). vol. 2, pp. 101-108. IEEE (2000) 4 +103. Wei, Y., Cao, Y., Zhang, Z., Peng, H., Yao, Z., Xie, Z., Hu, H., Guo, B.: iclip: Bridging image classification and contrastive language-image pre-training for visual recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5 +104. Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE transactions on pattern analysis and machine intelligence 15(11), 1101-1113 (1993) 2, 6 +105. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018) 4 +106. Wysoczanska, M., Siméoni, O., Ramamonjisoa, M., Bursuc, A., Trzciński, T., Pérez, P.: Clip-dinoiser: Teaching clip a few dino tricks. arXiv preprint arXiv:2312.12359 (2023) 5 +107. Xian, Y., Choudhury, S., He, Y., Schiele, B., Akata, Z.: Semantic projection network for zero-and few-label semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8256-8265 (2019) 2 +108. Xu, J., De Mello, S., Liu, S., Byeon, W., Breuel, T., Kautz, J., Wang, X.: Groupvit: Semantic segmentation emerges from text supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 5, 9, 10, 11 +109. Xu, J., Liu, S., Vahdat, A., Byeon, W., Wang, X., De Mello, S.: Open-vocabulary panoptic segmentation with text-to-image diffusion models. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5 +110. Xu, J., Hou, J., Zhang, Y., Feng, R., Wang, Y., Qiao, Y., Xie, W.: Learning open-vocabulary semantic segmentation models from natural language supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 3, 5, 10, 11 +111. Xu, M., Zhang, Z., Wei, F., Lin, Y., Cao, Y., Hu, H., Bai, X.: A simple baseline for open-vocabulary semantic segmentation with pre-trained vision-language model. + +In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5, 13 +112. Yin, Z., Wang, P., Wang, F., Xu, X., Zhang, H., Li, H., Jin, R.: Transfgu: a top-down approach to fine-grained unsupervised semantic segmentation. In: Proc. European Conference on Computer Vision (ECCV) (2022) 4 +113. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022) 4 +114. Yuan, L., Chen, D., Chen, Y.L., Codella, N., Dai, X., Gao, J., Hu, H., Huang, X., Li, B., Li, C., et al.: Florence: A new foundation model for computer vision. arXiv preprint arXiv:2111.11432 (2021) 4 +115. Zadaianchuk, A., Kleindessner, M., Zhu, Y., Locatello, F., Brox, T.: Unsupervised semantic segmentation with self-supervised object-centric representations. Proc. International Conference on Learning Representations (ICLR) (2023) 4 +116. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4 +117. Zhang, Q., Wu, Y.N., Zhu, S.C.: Mining and-or graphs for graph matching and object discovery. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 55-63 (2015) 4 +118. Zhou, B., Zhao, H., Puig, X., Xiao, T., Fidler, S., Barriuso, A., Torralba, A.: Semantic understanding of scenes through the ade20k dataset. International Journal of Computer Vision (IJCV) (2019) 2, 9 +119. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 3, 5, 11 +120. Zhu, J.Y., Wu, J., Xu, Y., Chang, E., Tu, Z.: Unsupervised object class discovery via saliency-guided multiple class learning. IEEE transactions on pattern analysis and machine intelligence 37(4), 862-875 (2014) 4 +121. Zhuang, C., Zhai, A.L., Yamins, D.: Local aggregation for unsupervised learning of visual embeddings. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 4 +122. Ziegler, A., Asano, Y.M.: Self-supervised learning of object parts for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4, 7 \ No newline at end of file diff --git a/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/images.zip b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..857033a0aa98a793b872c4975b76522cca272d67 --- /dev/null +++ b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d14bb41b0a034226e89b2c4fcf6314ca49fa01c9421e7951e17730c699beaa1c +size 626118 diff --git a/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/layout.json b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..bf841926d9154a642e59449940442676e85594a4 --- /dev/null +++ b/2024/In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation/layout.json @@ -0,0 +1,12349 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 149, + 112, + 465, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 149, + 112, + 465, + 148 + ], + "spans": [ + { + "bbox": [ + 149, + 112, + 465, + 148 + ], + "type": "text", + "content": "In Defense of Lazy Visual Grounding for Open-Vocabulary Semantic Segmentation" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 244, + 170, + 370, + 182 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 244, + 170, + 370, + 182 + ], + "spans": [ + { + "bbox": [ + 244, + 170, + 370, + 182 + ], + "type": "text", + "content": "Dahyun Kang Minsu Cho" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 157, + 195, + 456, + 219 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 157, + 195, + 456, + 219 + ], + "spans": [ + { + "bbox": [ + 157, + 195, + 456, + 219 + ], + "type": "text", + "content": "Pohang University of Science and Technology (POSTECH), South Korea https://cvlab.postech.ac.kr/research/azygrounding" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 159, + 259, + 455, + 413 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 259, + 455, + 413 + ], + "spans": [ + { + "bbox": [ + 159, + 259, + 455, + 413 + ], + "type": "text", + "content": "Abstract. We present Lazy Visual Grounding for open-vocabulary semantic segmentation, which decouples unsupervised object mask discovery from object grounding. Plenty of the previous art casts this task as pixel-to-text classification without object-level comprehension, leveraging the image-to-text classification capability of pretrained vision-and-language models. We argue that visual objects are distinguishable without the prior text information as segmentation is essentially a visual understanding task. Lazy visual grounding first discovers object masks covering an image with iterative Normalized cuts and then later assigns text on the discovered objects in a late interaction manner. Our model requires no additional training yet shows great performance on five public datasets: Pascal VOC, Pascal Context, COCO-object, COCO-stuff, and ADE 20K. Especially, the visually appealing segmentation results demonstrate the model capability to localize objects precisely." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "spans": [ + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "text", + "content": "Keywords: Unsupervised object discovery " + }, + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "text", + "content": " Training-free " + }, + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "text", + "content": " Open-vocabulary semantic segmentation " + }, + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 160, + 426, + 453, + 448 + ], + "type": "text", + "content": " CLIP" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 133, + 470, + 482, + 588 + ], + "blocks": [ + { + "bbox": [ + 133, + 470, + 482, + 588 + ], + "lines": [ + { + "bbox": [ + 133, + 470, + 482, + 588 + ], + "spans": [ + { + "bbox": [ + 133, + 470, + 482, + 588 + ], + "type": "image", + "image_path": "6905edbdc5349072fd1057c928abfd988eef7ff6b63c494019724ea14759a73b.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 597, + 482, + 653 + ], + "lines": [ + { + "bbox": [ + 130, + 597, + 482, + 653 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 482, + 653 + ], + "type": "text", + "content": "Fig. 1: Comparison of a pixel-grounding method and our object-grounding one. A pixel-grounding method (SCLIP [95]) often produces spurious correlations with imprecise edges. Instead of casting open-vocabulary semantic segmentation as pixel-to-text classification, we solve this task with lazy visual grounding: a two-step approach of object mask discovery followed by object grounding in a late interaction manner." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + } + ], + "discarded_blocks": [], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 230, + 127 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 230, + 127 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 230, + 127 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 139, + 482, + 258 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 139, + 482, + 258 + ], + "spans": [ + { + "bbox": [ + 130, + 139, + 482, + 258 + ], + "type": "text", + "content": "Image segmentation is a fundamental task in computer vision, aiming to partition an image into multiple segments with coherent characteristics [51, 88]. The classic approach to the problem is to collect nearby image pixels with shared characteristics using graph partitioning [3, 4, 78], feature clustering [14, 104], histogram equalization [68], edge detection [2, 43]. Deep neural networks for image segmentation [16, 19, 60, 66, 74] have relied on segmentation datasets of pixel-level class supervision [24, 27, 34, 48, 56, 118] via fully-supervised training with the annotated classes. However, such models are trained with the fixed set of classes hence unable to recognize unseen classes beyond the predefined set of seen classes." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 258, + 482, + 486 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 258, + 482, + 486 + ], + "spans": [ + { + "bbox": [ + 130, + 258, + 482, + 486 + ], + "type": "text", + "content": "The task of open-vocabulary semantic segmentation (OVSeg) [6,28,52,107, 108] is an image segmentation task of which classes are grounded with text. OVSeg aims to align image segments with potentially unseen classes described in text, spanning the modality of image segmentation to multi-modal. To solve this task, image-text encoders such as CLIP [69] are often used to recognize the text descriptions. A line of work [12,15,95,119] leverages its alignment of image patch and text embeddings to solve OVSeg by pixel-to-text similarity matching. However, this pixel-level classification approach lacks object comprehension, thus this approach often fails to distinguish objects (cf. Figure 1). This is probably because CLIP is trained to represent the holistic image through a separate CLS token embedding, and the patch embeddings are not explicitly trained to represent the corresponding image patch. The imprecise segmentation visuals of these modern multi-modal segmentation models encourage us to revisit the classic computer vision techniques - regarding an image with a bag of segmentable visual units. Imagine a four-legged animal on grass that we want to segment out. Do we need to know its name before segmentation? Having been approached since decades ago, image segmentation is primarily a vision task, and we argue that the objects can be distinguished as visual units given the vision input only without knowing their names in text." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 486, + 482, + 666 + ], + "type": "text", + "content": "Our approach, dubbed Lazy Visual Grounding (LaVG), first partitions an image into image segments with a classical image segmentation method, which is based on the vision input and no textual priors on the target classes. The text entity is later assigned to the partitioned segments. For image segmentation, we revisit the related task of unsupervised object discovery [20,82,93,94] which aims to identify visual units. The unsupervised object discovery methods aim to distinguish visual units in bounding boxes or object masks without semantic priors such as classes. Following the recent unsupervised object discovery methods [70, 99, 100], we retrocede the Normalized Cut [78] algorithm. Normalized cut bipartitions a weighted graph into two subgraphs such that the affinity between the two balanced parted groups is minimal. Following the recent object discovery approach [47,53,99,100], we apply Normalized cut on the outputs of a self-supervised vision transformer, DINO [11], which present an empirical property that attends to the salient object region. We iteratively apply Normalized cut until the identified segments cover all image pixels for semantic segmenta" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 240, + 176 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 240, + 176 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 240, + 176 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 240, + 176 + ], + "type": "image", + "image_path": "d3c6d7488899e5131ef0783a7ba3b8f2866291f082d7c578c920584339afd95e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 240, + 114, + 310, + 169 + ], + "blocks": [ + { + "bbox": [ + 240, + 114, + 310, + 169 + ], + "lines": [ + { + "bbox": [ + 240, + 114, + 310, + 169 + ], + "spans": [ + { + "bbox": [ + 240, + 114, + 310, + 169 + ], + "type": "image", + "image_path": "cf00ad9a8ec9f85cf6915de81f39d61ad3ff49776e5f85193bc4a96169214584.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 310, + 114, + 378, + 169 + ], + "blocks": [ + { + "bbox": [ + 310, + 114, + 378, + 169 + ], + "lines": [ + { + "bbox": [ + 310, + 114, + 378, + 169 + ], + "spans": [ + { + "bbox": [ + 310, + 114, + 378, + 169 + ], + "type": "image", + "image_path": "69d6241296bd333703f48f05705067240c56e35a4be1f59e7b1444d913ffef5f.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 378, + 114, + 480, + 170 + ], + "blocks": [ + { + "bbox": [ + 378, + 114, + 480, + 170 + ], + "lines": [ + { + "bbox": [ + 378, + 114, + 480, + 170 + ], + "spans": [ + { + "bbox": [ + 378, + 114, + 480, + 170 + ], + "type": "image", + "image_path": "2954c55eea96dd56f902772ba064da25c03134a792adc82c70d1a128bee971b5.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 133, + 176, + 240, + 228 + ], + "blocks": [ + { + "bbox": [ + 133, + 176, + 240, + 228 + ], + "lines": [ + { + "bbox": [ + 133, + 176, + 240, + 228 + ], + "spans": [ + { + "bbox": [ + 133, + 176, + 240, + 228 + ], + "type": "image", + "image_path": "59b0c8bb23882cd31e41d99a94ae1a6131f05e5c6cc2a8d24c53965c709c27bf.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 193, + 230, + 202, + 237 + ], + "lines": [ + { + "bbox": [ + 193, + 230, + 202, + 237 + ], + "spans": [ + { + "bbox": [ + 193, + 230, + 202, + 237 + ], + "type": "text", + "content": "#" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_caption" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 240, + 169, + 310, + 228 + ], + "blocks": [ + { + "bbox": [ + 240, + 169, + 310, + 228 + ], + "lines": [ + { + "bbox": [ + 240, + 169, + 310, + 228 + ], + "spans": [ + { + "bbox": [ + 240, + 169, + 310, + 228 + ], + "type": "image", + "image_path": "8b2034ecb602f4c0f7a90ddf571b146da02b2c2563d045c51c4b2d43d2623b5c.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 238, + 230, + 246, + 237 + ], + "lines": [ + { + "bbox": [ + 238, + 230, + 246, + 237 + ], + "spans": [ + { + "bbox": [ + 238, + 230, + 246, + 237 + ], + "type": "inline_equation", + "content": "{19}/{19}" + } + ] + } + ], + "index": 19, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 310, + 169, + 378, + 228 + ], + "blocks": [ + { + "bbox": [ + 310, + 169, + 378, + 228 + ], + "lines": [ + { + "bbox": [ + 310, + 169, + 378, + 228 + ], + "spans": [ + { + "bbox": [ + 310, + 169, + 378, + 228 + ], + "type": "image", + "image_path": "13991ec40e313516ea47853af85c69429656d3fff1ff37601a781a7d0c15dd96.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 318, + 230, + 326, + 237 + ], + "lines": [ + { + "bbox": [ + 318, + 230, + 326, + 237 + ], + "spans": [ + { + "bbox": [ + 318, + 230, + 326, + 237 + ], + "type": "text", + "content": "a p" + } + ] + } + ], + "index": 31, + "angle": 0, + "type": "image_caption" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 378, + 169, + 480, + 228 + ], + "blocks": [ + { + "bbox": [ + 378, + 169, + 480, + 228 + ], + "lines": [ + { + "bbox": [ + 378, + 169, + 480, + 228 + ], + "spans": [ + { + "bbox": [ + 378, + 169, + 480, + 228 + ], + "type": "image", + "image_path": "3a9c4b6e98ba1b238e7997d5bb3e7a61cebe2bf17f0736c79808721f2d3a30ff.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 410, + 230, + 418, + 237 + ], + "lines": [ + { + "bbox": [ + 410, + 230, + 418, + 237 + ], + "spans": [ + { + "bbox": [ + 410, + 230, + 418, + 237 + ], + "type": "text", + "content": "#" + } + ] + } + ], + "index": 43, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 428, + 230, + 436, + 237 + ], + "lines": [ + { + "bbox": [ + 428, + 230, + 436, + 237 + ], + "spans": [ + { + "bbox": [ + 428, + 230, + 436, + 237 + ], + "type": "text", + "content": "[\\frac{1}{4}\\left( {x - 2}\\right) \\left( {x + 5}\\right) = 0]" + } + ] + } + ], + "index": 45, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 444, + 230, + 452, + 237 + ], + "lines": [ + { + "bbox": [ + 444, + 230, + 452, + 237 + ], + "spans": [ + { + "bbox": [ + 444, + 230, + 452, + 237 + ], + "type": "inline_equation", + "content": "{13}/{14}" + } + ] + } + ], + "index": 47, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 461, + 230, + 470, + 237 + ], + "lines": [ + { + "bbox": [ + 461, + 230, + 470, + 237 + ], + "spans": [ + { + "bbox": [ + 461, + 230, + 470, + 237 + ], + "type": "text", + "content": "#" + } + ] + } + ], + "index": 49, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 133, + 230, + 186, + 244 + ], + "blocks": [ + { + "bbox": [ + 133, + 230, + 186, + 244 + ], + "lines": [ + { + "bbox": [ + 133, + 230, + 186, + 244 + ], + "spans": [ + { + "bbox": [ + 133, + 230, + 186, + 244 + ], + "type": "image", + "image_path": "9bd6502e0d1dc548352633adb05bac4c3dd95d662cef20475db0d7cf7ba2730d.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 131, + 255, + 480, + 277 + ], + "lines": [ + { + "bbox": [ + 131, + 255, + 480, + 277 + ], + "spans": [ + { + "bbox": [ + 131, + 255, + 480, + 277 + ], + "type": "text", + "content": "Fig. 2: Segmentation results of LaVG given the text description set. These precise object masks and visual grounding results are produced in a training-free fashion." + } + ] + } + ], + "index": 50, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 186, + 230, + 188, + 237 + ], + "blocks": [ + { + "bbox": [ + 186, + 230, + 188, + 237 + ], + "lines": [ + { + "bbox": [ + 186, + 230, + 188, + 237 + ], + "spans": [ + { + "bbox": [ + 186, + 230, + 188, + 237 + ], + "type": "image", + "image_path": "fc4e20ebbfb8cd638358efc5ab15f4ccfd8811ab47e47498bff92925b2ba262e.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 189, + 230, + 192, + 237 + ], + "blocks": [ + { + "bbox": [ + 189, + 230, + 192, + 237 + ], + "lines": [ + { + "bbox": [ + 189, + 230, + 192, + 237 + ], + "spans": [ + { + "bbox": [ + 189, + 230, + 192, + 237 + ], + "type": "image", + "image_path": "567e145d91f7f25ede6188f539a073ffc6c4f67fd500bb81f9df51ddcca05574.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 203, + 230, + 205, + 237 + ], + "blocks": [ + { + "bbox": [ + 203, + 230, + 205, + 237 + ], + "lines": [ + { + "bbox": [ + 203, + 230, + 205, + 237 + ], + "spans": [ + { + "bbox": [ + 203, + 230, + 205, + 237 + ], + "type": "image", + "image_path": "27cb8d888248fa2a7beb05af5a21d2b1d87dae6ed1274c3818e06f2ee27fec1a.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 206, + 230, + 215, + 237 + ], + "lines": [ + { + "bbox": [ + 206, + 230, + 215, + 237 + ], + "spans": [ + { + "bbox": [ + 206, + 230, + 215, + 237 + ], + "type": "inline_equation", + "content": "\\therefore m = \\frac{3}{11}" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 216, + 230, + 223, + 237 + ], + "blocks": [ + { + "bbox": [ + 216, + 230, + 223, + 237 + ], + "lines": [ + { + "bbox": [ + 216, + 230, + 223, + 237 + ], + "spans": [ + { + "bbox": [ + 216, + 230, + 223, + 237 + ], + "type": "image", + "image_path": "5ac4776e0fca74eff027f0737f1ed73c7be8ac028b00b859dffd2a038868bdbe.jpg" + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_body" + } + ], + "index": 16 + }, + { + "type": "image", + "bbox": [ + 233, + 230, + 236, + 237 + ], + "blocks": [ + { + "bbox": [ + 224, + 230, + 233, + 237 + ], + "lines": [ + { + "bbox": [ + 224, + 230, + 233, + 237 + ], + "spans": [ + { + "bbox": [ + 224, + 230, + 233, + 237 + ], + "type": "text", + "content": "#" + } + ] + } + ], + "index": 17, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 233, + 230, + 236, + 237 + ], + "lines": [ + { + "bbox": [ + 233, + 230, + 236, + 237 + ], + "spans": [ + { + "bbox": [ + 233, + 230, + 236, + 237 + ], + "type": "image", + "image_path": "8ac722bfaf5a01764353a1e7ad8b53bdd919a945ac3dca69d2f15ba218e96b90.jpg" + } + ] + } + ], + "index": 18, + "angle": 0, + "type": "image_body" + } + ], + "index": 18 + }, + { + "type": "image", + "bbox": [ + 247, + 230, + 249, + 237 + ], + "blocks": [ + { + "bbox": [ + 247, + 230, + 249, + 237 + ], + "lines": [ + { + "bbox": [ + 247, + 230, + 249, + 237 + ], + "spans": [ + { + "bbox": [ + 247, + 230, + 249, + 237 + ], + "type": "image", + "image_path": "b630ea6eeee6e65c34fb06842778f5d61c6c00e773ccf8b24407c6abcbfff4d3.jpg" + } + ] + } + ], + "index": 20, + "angle": 0, + "type": "image_body" + } + ], + "index": 20 + }, + { + "type": "image", + "bbox": [ + 260, + 230, + 263, + 237 + ], + "blocks": [ + { + "bbox": [ + 251, + 230, + 259, + 237 + ], + "lines": [ + { + "bbox": [ + 251, + 230, + 259, + 237 + ], + "spans": [ + { + "bbox": [ + 251, + 230, + 259, + 237 + ], + "type": "inline_equation", + "content": "\\frac{1}{2} =" + } + ] + } + ], + "index": 21, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 260, + 230, + 263, + 237 + ], + "lines": [ + { + "bbox": [ + 260, + 230, + 263, + 237 + ], + "spans": [ + { + "bbox": [ + 260, + 230, + 263, + 237 + ], + "type": "image", + "image_path": "17343d40d73ff1119978d0864f03361a857b27ecfb2f0f0a6dff10c1a4b6dc9a.jpg" + } + ] + } + ], + "index": 22, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 264, + 230, + 272, + 237 + ], + "lines": [ + { + "bbox": [ + 264, + 230, + 272, + 237 + ], + "spans": [ + { + "bbox": [ + 264, + 230, + 272, + 237 + ], + "type": "inline_equation", + "content": "\\therefore m = \\frac{3}{11}" + } + ] + } + ], + "index": 23, + "angle": 0, + "type": "image_caption" + } + ], + "index": 22 + }, + { + "type": "image", + "bbox": [ + 273, + 230, + 276, + 237 + ], + "blocks": [ + { + "bbox": [ + 273, + 230, + 276, + 237 + ], + "lines": [ + { + "bbox": [ + 273, + 230, + 276, + 237 + ], + "spans": [ + { + "bbox": [ + 273, + 230, + 276, + 237 + ], + "type": "image", + "image_path": "4a2c05e34209f8b861c2f43afa6495f6b47e47fdc6a654e64e6ad8703a54d8ae.jpg" + } + ] + } + ], + "index": 24, + "angle": 0, + "type": "image_body" + } + ], + "index": 24 + }, + { + "type": "image", + "bbox": [ + 285, + 230, + 288, + 237 + ], + "blocks": [ + { + "bbox": [ + 281, + 230, + 284, + 237 + ], + "lines": [ + { + "bbox": [ + 281, + 230, + 284, + 237 + ], + "spans": [ + { + "bbox": [ + 281, + 230, + 284, + 237 + ], + "type": "inline_equation", + "content": "\\therefore m = \\frac{3}{11}" + } + ] + } + ], + "index": 25, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 285, + 230, + 288, + 237 + ], + "lines": [ + { + "bbox": [ + 285, + 230, + 288, + 237 + ], + "spans": [ + { + "bbox": [ + 285, + 230, + 288, + 237 + ], + "type": "image", + "image_path": "38a65cc23395953048f13004c7bc44629650a99b1bdc7b644d191a387c25e188.jpg" + } + ] + } + ], + "index": 26, + "angle": 0, + "type": "image_body" + } + ], + "index": 26 + }, + { + "type": "image", + "bbox": [ + 297, + 230, + 299, + 237 + ], + "blocks": [ + { + "bbox": [ + 293, + 230, + 296, + 237 + ], + "lines": [ + { + "bbox": [ + 293, + 230, + 296, + 237 + ], + "spans": [ + { + "bbox": [ + 293, + 230, + 296, + 237 + ], + "type": "text", + "content": "1" + } + ] + } + ], + "index": 27, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 297, + 230, + 299, + 237 + ], + "lines": [ + { + "bbox": [ + 297, + 230, + 299, + 237 + ], + "spans": [ + { + "bbox": [ + 297, + 230, + 299, + 237 + ], + "type": "image", + "image_path": "c7af479d9ae5c8397b5f29031d6f5e7a9c3375e14e9132de41718cb2598d1709.jpg" + } + ] + } + ], + "index": 28, + "angle": 0, + "type": "image_body" + } + ], + "index": 28 + }, + { + "type": "image", + "bbox": [ + 310, + 230, + 313, + 237 + ], + "blocks": [ + { + "bbox": [ + 302, + 230, + 310, + 237 + ], + "lines": [ + { + "bbox": [ + 302, + 230, + 310, + 237 + ], + "spans": [ + { + "bbox": [ + 302, + 230, + 310, + 237 + ], + "type": "text", + "content": "…" + } + ] + } + ], + "index": 29, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 310, + 230, + 313, + 237 + ], + "lines": [ + { + "bbox": [ + 310, + 230, + 313, + 237 + ], + "spans": [ + { + "bbox": [ + 310, + 230, + 313, + 237 + ], + "type": "image", + "image_path": "9e53e0b73a6a216592e04b7c9a600eabff30fba74f119228d007e7b2df362a28.jpg" + } + ] + } + ], + "index": 30, + "angle": 0, + "type": "image_body" + } + ], + "index": 30 + }, + { + "type": "image", + "bbox": [ + 328, + 230, + 331, + 237 + ], + "blocks": [ + { + "bbox": [ + 328, + 230, + 331, + 237 + ], + "lines": [ + { + "bbox": [ + 328, + 230, + 331, + 237 + ], + "spans": [ + { + "bbox": [ + 328, + 230, + 331, + 237 + ], + "type": "image", + "image_path": "b8dfa11c86a64089e1a27dd5834b18d0678d2ce336daf0e71c4e6e2a262546e6.jpg" + } + ] + } + ], + "index": 32, + "angle": 0, + "type": "image_body" + } + ], + "index": 32 + }, + { + "type": "image", + "bbox": [ + 342, + 230, + 345, + 237 + ], + "blocks": [ + { + "bbox": [ + 333, + 230, + 342, + 237 + ], + "lines": [ + { + "bbox": [ + 333, + 230, + 342, + 237 + ], + "spans": [ + { + "bbox": [ + 333, + 230, + 342, + 237 + ], + "type": "text", + "content": "on wi" + } + ] + } + ], + "index": 33, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 342, + 230, + 345, + 237 + ], + "lines": [ + { + "bbox": [ + 342, + 230, + 345, + 237 + ], + "spans": [ + { + "bbox": [ + 342, + 230, + 345, + 237 + ], + "type": "image", + "image_path": "3a810a1c6e7fc404315fddc91eb8e8d79fbb45c187ae7f706c6cc1cf85838ddc.jpg" + } + ] + } + ], + "index": 34, + "angle": 0, + "type": "image_body" + } + ], + "index": 34 + }, + { + "type": "image", + "bbox": [ + 358, + 230, + 361, + 237 + ], + "blocks": [ + { + "bbox": [ + 348, + 230, + 357, + 237 + ], + "lines": [ + { + "bbox": [ + 348, + 230, + 357, + 237 + ], + "spans": [ + { + "bbox": [ + 348, + 230, + 357, + 237 + ], + "type": "inline_equation", + "content": "{a}_{4}^{3} = {7}^{3} \\cdot {2}^{4}" + } + ] + } + ], + "index": 35, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 358, + 230, + 361, + 237 + ], + "lines": [ + { + "bbox": [ + 358, + 230, + 361, + 237 + ], + "spans": [ + { + "bbox": [ + 358, + 230, + 361, + 237 + ], + "type": "image", + "image_path": "b1cd9c412b83ec030f0048428fe8edd36c6d3fab7eddd2c8a86387e384baa25f.jpg" + } + ] + } + ], + "index": 36, + "angle": 0, + "type": "image_body" + } + ], + "index": 36 + }, + { + "type": "image", + "bbox": [ + 372, + 230, + 375, + 237 + ], + "blocks": [ + { + "bbox": [ + 363, + 230, + 372, + 237 + ], + "lines": [ + { + "bbox": [ + 363, + 230, + 372, + 237 + ], + "spans": [ + { + "bbox": [ + 363, + 230, + 372, + 237 + ], + "type": "text", + "content": "…" + } + ] + } + ], + "index": 37, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 372, + 230, + 375, + 237 + ], + "lines": [ + { + "bbox": [ + 372, + 230, + 375, + 237 + ], + "spans": [ + { + "bbox": [ + 372, + 230, + 375, + 237 + ], + "type": "image", + "image_path": "d1e507f07930322a74b38957b6c71fa92d749463bf1148fc4782c374b4b4fc47.jpg" + } + ] + } + ], + "index": 38, + "angle": 0, + "type": "image_body" + } + ], + "index": 38 + }, + { + "type": "image", + "bbox": [ + 389, + 230, + 392, + 237 + ], + "blocks": [ + { + "bbox": [ + 379, + 230, + 388, + 237 + ], + "lines": [ + { + "bbox": [ + 379, + 230, + 388, + 237 + ], + "spans": [ + { + "bbox": [ + 379, + 230, + 388, + 237 + ], + "type": "text", + "content": "…" + } + ] + } + ], + "index": 39, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 389, + 230, + 392, + 237 + ], + "lines": [ + { + "bbox": [ + 389, + 230, + 392, + 237 + ], + "spans": [ + { + "bbox": [ + 389, + 230, + 392, + 237 + ], + "type": "image", + "image_path": "9eb6297642b3b4ac7f766bbb76908bea529c26f4d00e9c06e9dedc432bf6563d.jpg" + } + ] + } + ], + "index": 40, + "angle": 0, + "type": "image_body" + } + ], + "index": 40 + }, + { + "type": "image", + "bbox": [ + 404, + 230, + 406, + 237 + ], + "blocks": [ + { + "bbox": [ + 394, + 230, + 403, + 237 + ], + "lines": [ + { + "bbox": [ + 394, + 230, + 403, + 237 + ], + "spans": [ + { + "bbox": [ + 394, + 230, + 403, + 237 + ], + "type": "inline_equation", + "content": "\\therefore m = \\frac{3}{11}" + } + ] + } + ], + "index": 41, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 404, + 230, + 406, + 237 + ], + "lines": [ + { + "bbox": [ + 404, + 230, + 406, + 237 + ], + "spans": [ + { + "bbox": [ + 404, + 230, + 406, + 237 + ], + "type": "image", + "image_path": "9702093d28ec942408233172ebf712f25ca8ff3a3a5c3558186b0ed287d1ee78.jpg" + } + ] + } + ], + "index": 42, + "angle": 0, + "type": "image_body" + } + ], + "index": 42 + }, + { + "type": "image", + "bbox": [ + 420, + 230, + 422, + 237 + ], + "blocks": [ + { + "bbox": [ + 420, + 230, + 422, + 237 + ], + "lines": [ + { + "bbox": [ + 420, + 230, + 422, + 237 + ], + "spans": [ + { + "bbox": [ + 420, + 230, + 422, + 237 + ], + "type": "image", + "image_path": "9ccf55dc7f2faa0d8bf354ca82bfdfd3050319229ecbfe47471eaaac53a73613.jpg" + } + ] + } + ], + "index": 44, + "angle": 0, + "type": "image_body" + } + ], + "index": 44 + }, + { + "type": "image", + "bbox": [ + 438, + 230, + 441, + 237 + ], + "blocks": [ + { + "bbox": [ + 438, + 230, + 441, + 237 + ], + "lines": [ + { + "bbox": [ + 438, + 230, + 441, + 237 + ], + "spans": [ + { + "bbox": [ + 438, + 230, + 441, + 237 + ], + "type": "image", + "image_path": "b66e32dc28bb151602447da450e49dda1d780d622459c98eb94c52c9bfdc6f61.jpg" + } + ] + } + ], + "index": 46, + "angle": 0, + "type": "image_body" + } + ], + "index": 46 + }, + { + "type": "image", + "bbox": [ + 454, + 230, + 459, + 237 + ], + "blocks": [ + { + "bbox": [ + 454, + 230, + 459, + 237 + ], + "lines": [ + { + "bbox": [ + 454, + 230, + 459, + 237 + ], + "spans": [ + { + "bbox": [ + 454, + 230, + 459, + 237 + ], + "type": "image", + "image_path": "22d3ba47d6b1de4c1279409c10d2a3feb46226ad6bc239373f73ea01a1eee50d.jpg" + } + ] + } + ], + "index": 48, + "angle": 0, + "type": "image_body" + } + ], + "index": 48 + }, + { + "bbox": [ + 130, + 298, + 480, + 429 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 298, + 480, + 429 + ], + "spans": [ + { + "bbox": [ + 130, + 298, + 480, + 429 + ], + "type": "text", + "content": "tion, i.e., panoptic segmentation [46], and name this approach as Panoptic cut. Once Panoptic cut is finished, then the objects are grounded with text. Each discovered segment is aggregated to form an object prototype embedding and finally matched with given text embedding from a free-form text (Figure 2). Note that the this two-step process requires no additional training hence significantly benefits computational efficiency. LaVG is simple and training-free yet has shown its superiority over not only the learning-free counterpart models [15,38,71,95,119] but also the trained models [7,12,59,61,72,108,110] that used image-text paired datasets [13,56,89]. It is noteworthy that our model localizes objects qualitatively more precisely than the pixel-to-text classification methods (Figure 1)." + } + ] + } + ], + "index": 51 + }, + { + "bbox": [ + 146, + 430, + 362, + 440 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 430, + 362, + 440 + ], + "spans": [ + { + "bbox": [ + 146, + 430, + 362, + 440 + ], + "type": "text", + "content": "Our contributions can be summarized as follows:" + } + ] + } + ], + "index": 52 + }, + { + "bbox": [ + 137, + 453, + 481, + 574 + ], + "type": "list", + "angle": 0, + "index": 57, + "blocks": [ + { + "bbox": [ + 138, + 453, + 481, + 488 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 453, + 481, + 488 + ], + "spans": [ + { + "bbox": [ + 138, + 453, + 481, + 488 + ], + "type": "text", + "content": "- We present Lazy Visual Grounding (LaVG) which discovers objects first and then later assigns text on the objects in a late interaction manner for open-vocabulary semantic segmentation." + } + ] + } + ], + "index": 53 + }, + { + "bbox": [ + 137, + 489, + 480, + 513 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 489, + 480, + 513 + ], + "spans": [ + { + "bbox": [ + 137, + 489, + 480, + 513 + ], + "type": "text", + "content": "- We revisit Normalized cut to present Panoptic cut that iteratively discovers the object masks that cover all the image pixels." + } + ] + } + ], + "index": 54 + }, + { + "bbox": [ + 137, + 514, + 480, + 537 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 514, + 480, + 537 + ], + "spans": [ + { + "bbox": [ + 137, + 514, + 480, + 537 + ], + "type": "text", + "content": "- Our model is training-free and runs on top of a pretrained vision and language model, reducing training computation burden significantly." + } + ] + } + ], + "index": 55 + }, + { + "bbox": [ + 137, + 538, + 480, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 538, + 480, + 574 + ], + "spans": [ + { + "bbox": [ + 137, + 538, + 480, + 574 + ], + "type": "text", + "content": "- Our simple method based on graph partitioning quantitatively surpasses the state-of-the-art open-vocabulary segmentation models with segmentation masks with remarkably more precise object boundaries." + } + ] + } + ], + "index": 56 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 594, + 237, + 605 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 594, + 237, + 605 + ], + "spans": [ + { + "bbox": [ + 132, + 594, + 237, + 605 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 58 + }, + { + "bbox": [ + 131, + 620, + 319, + 632 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 620, + 319, + 632 + ], + "spans": [ + { + "bbox": [ + 131, + 620, + 319, + 632 + ], + "type": "text", + "content": "2.1 Unsupervised Object Discovery" + } + ] + } + ], + "index": 59 + }, + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 480, + 665 + ], + "type": "text", + "content": "Object discovery [91] has been a fundamental computer vision task. In 2000s, unsupervised object discovery started with discovering the image groups containing" + } + ] + } + ], + "index": 60 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 448, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 344 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 344 + ], + "type": "text", + "content": "objects of the same class with analytic techniques [30, 76, 86, 102]. Later, it advances to identify the location of the objects [50, 117, 120], which is viewed as the seminal work of the object discovery task with object localization. Object discovery has been formulated with an input of an image collection [20, 93, 94], where objects are discovered among the image collection via an image pair matching. A recent self-supervised vision transformer named DINO [11] has shown the emerging property of precisely attending the foreground objects within the transformer [92] attention layer. As it inherently provides a strong clue for foreground object saliency, DINO completely revamps the paradigm of unsupervised object discovery [77, 79, 84, 98]. Pioneered by LOST [82], the recently predominating object discovery approach is to distinguish existing objects based on the DINO activation map. One approach is seed-finding [82, 83], which explores foreground/background region from a highly confident seed pixel on the attention map. The other popular approach leverages the graph-partitioning segmentation, e.g., Normalized cut [78], on the DINO attention map to segregate the foreground objects from the background [70, 85, 99, 100], often followed by self-training of instance segmentation models [8, 35] by the obtained masks [70, 85, 99]. Our work is motivated by the second graph-partitioning approach, which robustly identifies foreground objects." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 360, + 344, + 372 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 360, + 344, + 372 + ], + "spans": [ + { + "bbox": [ + 132, + 360, + 344, + 372 + ], + "type": "text", + "content": "2.2 Self-Supervised Vision Transformers" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 379, + 482, + 547 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 379, + 482, + 547 + ], + "spans": [ + { + "bbox": [ + 130, + 379, + 482, + 547 + ], + "type": "text", + "content": "Deep self-supervised learning models [33,39] are trained with the self-supervision arisen from the input data rather than external human-annotated labels. The self-supervised learning paradigm has shown effective in terms of task performance as well as generalization ability across multiple downstream tasks [9-11, 17,22,105,121] without task-specific annotations. One popular approach [11,31] trains a model to map an image and its another view to nearby points on the feature space. This class-agnostic objective encourages the image encoder to capture visual invariance. Unlike class-supervised models that often attend on the specific part that represents an object, a representative self-supervised model named DINO [11] shows the emerged localization ability capturing foreground objects on the attention [92]. This property has benefited several dense prediction tasks such as weakly-supervised few-shot segmentation [41] and unsupervised image/video segmentation [112,115,122]. In this work, we leverage these foreground-attended representations as an input source to Normalized cut." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 563, + 394, + 575 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 563, + 394, + 575 + ], + "spans": [ + { + "bbox": [ + 132, + 563, + 394, + 575 + ], + "type": "text", + "content": "2.3 Vision-and-Language Representation Learning" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Recent advances in efficient and modern hardware accelerate training huge foundation models at scale [5, 57, 113, 114, 116]. Among them, a representative vision and language model named CLIP [69] is trained using 400 million web-crawled image and text pairs to learn cross-modal similarity. CLIP trains two-tower image-text transformer encoders such that embedding similarity between a positive image-text pair is larger than other pairs in a training batch. The open-sourced CLIP models are leveraged to a number of vision and language work" + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 115, + 479, + 205 + ], + "blocks": [ + { + "bbox": [ + 135, + 115, + 479, + 205 + ], + "lines": [ + { + "bbox": [ + 135, + 115, + 479, + 205 + ], + "spans": [ + { + "bbox": [ + 135, + 115, + 479, + 205 + ], + "type": "image", + "image_path": "f16e4d249853b454862dc63f32b097de650d79a5b85e6a89080e1ff34b8c209e.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 212, + 480, + 257 + ], + "lines": [ + { + "bbox": [ + 130, + 212, + 480, + 257 + ], + "spans": [ + { + "bbox": [ + 130, + 212, + 480, + 257 + ], + "type": "text", + "content": "Fig. 3: Two stages of Lazy Visual Grounding (LaVG). Given an image, LaVG first discovers existing object masks without the text information (panoptic cut) and then later assigns the class in text descriptions to each object with cross-modal similarity (object grounding)." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 271, + 479, + 296 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 271, + 479, + 296 + ], + "spans": [ + { + "bbox": [ + 130, + 271, + 479, + 296 + ], + "type": "text", + "content": "including zero-shot classification [58, 103], long-tailed recognition [63, 64, 90], referring segmentation [45, 101], cross-modal retrieval [37, 62] as well as OVSeg." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 314, + 416, + 327 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 314, + 416, + 327 + ], + "spans": [ + { + "bbox": [ + 130, + 314, + 416, + 327 + ], + "type": "text", + "content": "2.4 Open-Vocabulary Semantic Segmentation (OVSeg)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 334, + 482, + 562 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 334, + 482, + 562 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 482, + 562 + ], + "type": "text", + "content": "Open-vocabulary segmentation is a pixel-level image classification task with categories described in text. Compared to the classic definition of semantic segmentation [16, 60] of which target classes are a predefined closed set, the target class set of OVSeg consists of open-vocabulary text and not necessarily predefined. Given the different levels of training supervision, OVSeg methods are categorized as mask-supervised [21, 28, 52, 54, 61, 109], image-text pair supervised [7, 12, 59, 61, 72, 108, 110] (hence weakly-supervised), or training-free [15, 38, 42, 95, 96]. Among them, this work corresponds to the last one: OVSeg with no additional training on pretrained models. For example, one of the training-free methods, SCLIP [95], replaces the attention layer of the query and the key cross-similarity into the self-similarity of each embeddings such that it attends on the homogeneous contexts in local regions. Our work is distinguished from the existing work [95, 106, 119] which directly classifies each image pixel with pixel-text similarity without comprehending the objects. On the other hand, our method first identifies the multiple objects in the absence of the text information and later integrates with the text entities with object-wise text assignment in a lazy visual grounding manner. Our training-free method is also distinguished from the trainable OVSeg methods [25, 29, 55, 111] that train MaskFormer segmentation models [18, 19] to obtain class-agnostic masks followed by grounding." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 580, + 293, + 594 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 580, + 293, + 594 + ], + "spans": [ + { + "bbox": [ + 132, + 580, + 293, + 594 + ], + "type": "text", + "content": "3 Lazy Visual Grounding" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 605, + 480, + 665 + ], + "type": "text", + "content": "We introduce **Lazy Visual Grounding (LaVG)**. LaVG consists of the two consecutive stages: panoptic object mask discovery (Section 3.1) and object grounding with text (Section 3.2). The key theme is late text interaction; the visual object discovery stage is a vision-only process and does not involve text interaction. Figure 3 briefly visualizes the process." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 437, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 437, + 129 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 437, + 129 + ], + "type": "text", + "content": "3.1 Panoptic Object Mask Discovery with Normalized Cut" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "spans": [ + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "content": "Preliminary: Normalized cut. Normalized cut [78] tackles the image segmentation problem with graph partitioning. Given an undirected weighted graph of " + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "inline_equation", + "content": "(\\mathcal{V},\\mathcal{E})" + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "content": " with " + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "content": " nodes, Normalized cut finds the optimal partition of the graph nodes into two disjoint sets of nodes " + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "content": " such that the removed weights of the edges between " + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 131, + 136, + 482, + 207 + ], + "type": "text", + "content": " be the minimum [104]. The sum of the lost weights between the bipartitioned subgraphs is defined as cut:" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 242, + 216, + 481, + 242 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 242, + 216, + 481, + 242 + ], + "spans": [ + { + "bbox": [ + 242, + 216, + 481, + 242 + ], + "type": "interline_equation", + "content": "\\operatorname {c u t} (\\mathcal {A}, \\mathcal {B}) = \\sum_ {u \\in \\mathcal {A}, v \\in \\mathcal {B}} w (u, v). \\tag {1}", + "image_path": "92a7f96cb6cdbd74886e06629af31b61221b6fae495b5145d704fc7a43aa462c.jpg" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 250, + 479, + 322 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 250, + 479, + 322 + ], + "spans": [ + { + "bbox": [ + 131, + 250, + 479, + 322 + ], + "type": "text", + "content": "In the image segmentation perspective, the subgraphs " + }, + { + "bbox": [ + 131, + 250, + 479, + 322 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 250, + 479, + 322 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 250, + 479, + 322 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 131, + 250, + 479, + 322 + ], + "type": "text", + "content": " correspond to two image segments that cover an image. The bipartition should avoid bad partitioning such as a tiny fraction and the rest of the mass, which still satisfies the definition of the minimum cut. Thus, a more preferable cut is a bipartition that balances the sizes of subgraphs, where each subgraph is properly associated with the entire graph. Formally," + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 230, + 330, + 481, + 356 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 230, + 330, + 481, + 356 + ], + "spans": [ + { + "bbox": [ + 230, + 330, + 481, + 356 + ], + "type": "interline_equation", + "content": "\\operatorname {N c u t} (\\mathcal {A}, \\mathcal {B}) = \\frac {\\operatorname {c u t} (\\mathcal {A} , \\mathcal {B})}{\\operatorname {a s s o c} (\\mathcal {A} , \\mathcal {V})} + \\frac {\\operatorname {c u t} (\\mathcal {A} , \\mathcal {B})}{\\operatorname {a s s o c} (\\mathcal {B} , \\mathcal {V})}, \\tag {2}", + "image_path": "7cf92a4473ef8ae96bdb7143fcd39fbda20fb1ccb895ba4a4876463cd05a1a2c.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 199, + 357, + 481, + 384 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 199, + 357, + 481, + 384 + ], + "spans": [ + { + "bbox": [ + 199, + 357, + 481, + 384 + ], + "type": "interline_equation", + "content": "\\operatorname {w h e r e} \\operatorname {a s s o c} (\\mathcal {A}, \\mathcal {V}) = \\sum_ {u \\in \\mathcal {A}, t \\in \\mathcal {V}} w (u, t). \\tag {3}", + "image_path": "c384c308cae4e7f088d91b8c25f6529dc7c113140ccefb29414f6ffa331714a3.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "spans": [ + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "text", + "content": "The association factor normalizes the cuts by the connected proportion to the entire graph. Through the systematic derivation, the work of Normalized cut [78] shows that minimizing Equation 2 is equivalent to solving an eigenvector system. Let us denote that " + }, + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "inline_equation", + "content": "\\mathbf{W} \\in \\mathbb{R}^{N \\times N}" + }, + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "text", + "content": " is a symmetric matrix of the non-negative edge weights, and " + }, + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "inline_equation", + "content": "\\mathbf{D}" + }, + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "text", + "content": " is a diagonal matrix of which diagonal elements correspond to the row-wise sum of " + }, + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "inline_equation", + "content": "\\mathbf{W}" + }, + { + "bbox": [ + 131, + 392, + 482, + 476 + ], + "type": "text", + "content": ". Then the solution of Normalized cut is obtained by solving the following generalized eigenvalue system:" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 263, + 485, + 481, + 498 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 263, + 485, + 481, + 498 + ], + "spans": [ + { + "bbox": [ + 263, + 485, + 481, + 498 + ], + "type": "interline_equation", + "content": "\\left(\\boldsymbol {D} - \\boldsymbol {W}\\right) \\boldsymbol {x} = \\lambda \\boldsymbol {D} \\boldsymbol {x} \\tag {4}", + "image_path": "8bb3f0828a27a653ce6ad9a9b372e14903202f1f23a9a2cdfd16c7d7556b91dd.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "spans": [ + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "text", + "content": "and obtaining the eigenvector corresponding to the second-smallest eigenvalue1. Let us denote the eigenvector corresponding to the second-smallest eigenvalue as " + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\pmb{z} \\in \\mathbb{R}^N" + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "text", + "content": ". The set of nodes " + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\mathcal{V} = \\{v_1, \\dots, v_N\\}" + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "text", + "content": " is divided into " + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 131, + 506, + 482, + 555 + ], + "type": "text", + "content": " by the following bipartition rule:" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 263, + 564, + 481, + 577 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 263, + 564, + 481, + 577 + ], + "spans": [ + { + "bbox": [ + 263, + 564, + 481, + 577 + ], + "type": "interline_equation", + "content": "v _ {n} \\in \\mathcal {A} \\quad \\text {i f} z _ {n} > \\bar {z}, \\tag {5}", + "image_path": "e33b52a8f6838c168845c7bfa287d115cb9ff0994a8c22295f93d7b157cd1ae2.jpg" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 264, + 579, + 481, + 591 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 264, + 579, + 481, + 591 + ], + "spans": [ + { + "bbox": [ + 264, + 579, + 481, + 591 + ], + "type": "interline_equation", + "content": "v _ {n} \\in \\mathcal {B} \\quad \\text {o t h e r w i s e}, \\tag {6}", + "image_path": "4bfb0de90144838babfe5a37d1638a5db795a666817b1005dc9ecc284a6027a2.jpg" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 601, + 479, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 601, + 479, + 625 + ], + "spans": [ + { + "bbox": [ + 131, + 601, + 479, + 625 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 131, + 601, + 479, + 625 + ], + "type": "inline_equation", + "content": "\\bar{z}" + }, + { + "bbox": [ + 131, + 601, + 479, + 625 + ], + "type": "text", + "content": " means the average of the vector elements of " + }, + { + "bbox": [ + 131, + 601, + 479, + 625 + ], + "type": "inline_equation", + "content": "z" + }, + { + "bbox": [ + 131, + 601, + 479, + 625 + ], + "type": "text", + "content": ". For the detailed derivation, please refer to the original paper [78]." + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "type": "text", + "content": "1 The smallest eigenvalue of " + }, + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "type": "inline_equation", + "content": "D - W" + }, + { + "bbox": [ + 133, + 631, + 482, + 665 + ], + "type": "text", + "content": ", i.e., a Laplacian matrix, is always zero. The second-smallest eigenvalue is known as the algebraic connectivity, or Fiedler eigenvalue, and reflects how well connected the graph is." + } + ] + } + ], + "index": 14 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 149, + 118, + 465, + 189 + ], + "blocks": [ + { + "bbox": [ + 149, + 118, + 465, + 189 + ], + "lines": [ + { + "bbox": [ + 149, + 118, + 465, + 189 + ], + "spans": [ + { + "bbox": [ + 149, + 118, + 465, + 189 + ], + "type": "image", + "image_path": "f08b558da06293bdc9496905ccbcbf302656a4eb5ceb48977e96e856a93fcfe7.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 164, + 196, + 448, + 207 + ], + "lines": [ + { + "bbox": [ + 164, + 196, + 448, + 207 + ], + "spans": [ + { + "bbox": [ + 164, + 196, + 448, + 207 + ], + "type": "text", + "content": "Fig. 4: The result of Normalized cut [78] before and after refinement." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 217, + 481, + 301 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 217, + 481, + 301 + ], + "spans": [ + { + "bbox": [ + 130, + 217, + 481, + 301 + ], + "type": "text", + "content": "Panoptic cut. The unsupervised object mask discovery step inherits the idea of the recent object discovery work [85, 99, 100] based on Normalized cut and is adapted to semantic segmentation. Specifically, the recent work [85, 99, 100] presents to leverage the DINO ViT [11, 26] feature map as an input feature to Normalized cut. As the task of interest is to identify objects and also assign a semantic class for all image pixels, i.e., panoptic segmentation, we call this unsupervised object mask discovery step as Panoptic cut." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 301, + 481, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 301, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 301, + 481, + 373 + ], + "type": "text", + "content": "Given an input image, the image is fed to a pre-trained self-supervised DINO ViT to obtain the visual feature map. Following the existing work [1,41,122], we use the intermediate byproduct during the feature feed-forward process as the dense feature map as it is empirically shown to highlight the salient foreground objects. In the last layer of the ViT, the patch token similarity between the key embedding produces an affinity map:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 255, + 378, + 481, + 406 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 255, + 378, + 481, + 406 + ], + "spans": [ + { + "bbox": [ + 255, + 378, + 481, + 406 + ], + "type": "interline_equation", + "content": "\\boldsymbol {W} _ {x x ^ {\\prime}} = \\frac {\\boldsymbol {K} _ {x} ^ {\\top} \\boldsymbol {K} _ {x ^ {\\prime}}}{\\| \\boldsymbol {K} _ {x} \\| _ {2} \\| \\boldsymbol {K} _ {x ^ {\\prime}} \\| _ {2}}, \\tag {7}", + "image_path": "9ff55501d0f50379871ceacbdca0235b060488a60e02c380d8531b5d4b3f1380.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 411, + 481, + 457 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 481, + 457 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 481, + 457 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 411, + 481, + 457 + ], + "type": "inline_equation", + "content": "x, x'" + }, + { + "bbox": [ + 130, + 411, + 481, + 457 + ], + "type": "text", + "content": " indicates feature map index. In the graph partitioning perspective, the set of patch key embeddings correspond to nodes and their cosine similarity values correspond to the edge weights. Such definition of graph is applied to the Normalized cut system in Equation 4." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "spans": [ + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": "The solved system yields two sets of nodes, " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": ". We determine the foreground between them by following the few heuristics from MaskCut [99]. " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": " is foreground if a) " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": " contains the maximum absolute value in the second smallest eigenvector " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "z" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": " and b) " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": " is covering less than the two corners of the matrix. Once we determine the foreground between " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{B}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": ", then " + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "inline_equation", + "content": "\\mathcal{A}" + }, + { + "bbox": [ + 130, + 458, + 482, + 601 + ], + "type": "text", + "content": " is discovered as an object, and we iterate bipartitioning the rest of the background node set until i) there are less than five nodes left or ii) the iteration count reaches the preset maximum2. After the iteration halts, the undiscovered region is marked as background. We often observe noisy object boundaries or the salt and pepper artifacts such as in Figure 4. We thus fill the holes and refine the output bipartition masks with DenseCRF [49], before the masks are resized to the original image size. We note that the process introduced so far uses neither human annotation nor text entity." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 601, + 481, + 626 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 601, + 481, + 626 + ], + "spans": [ + { + "bbox": [ + 130, + 601, + 481, + 626 + ], + "type": "text", + "content": "Panoptic cut distinguishes from the unsupervised object discovery models [85, 99, 100] in that the background region is also semantically segmented." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 448, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 480, + 99 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 133, + 631, + 481, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 631, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 631, + 481, + 665 + ], + "type": "text", + "content": "2 In implementation, the condition i) is rarely met. We empirically observe that DINO features exhibit small activation values on non-salient regions. Consequently, Panoptic cut returns bad bipartitions, which is ignored during the mask refinement process." + } + ] + } + ], + "index": 10 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 135, + 480, + 182 + ], + "blocks": [ + { + "bbox": [ + 171, + 114, + 442, + 126 + ], + "lines": [ + { + "bbox": [ + 171, + 114, + 442, + 126 + ], + "spans": [ + { + "bbox": [ + 171, + 114, + 442, + 126 + ], + "type": "text", + "content": "Table 1: Benchmarks for open-vocabulary semantic segmentation" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 135, + 480, + 182 + ], + "lines": [ + { + "bbox": [ + 135, + 135, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 135, + 135, + 480, + 182 + ], + "type": "table", + "html": "
With a background categoryWithout background category
VOC21Context60COCO-ObjectVOC20Context59ADE20KCOCO-Stuff
number of classes2160812059150171
", + "image_path": "6f9b4aefc1c34230b20402ff204e73da9db0fa15afea959261f1363aa8e36e5f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 192, + 479, + 216 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 192, + 479, + 216 + ], + "spans": [ + { + "bbox": [ + 130, + 192, + 479, + 216 + ], + "type": "text", + "content": "For example, the sky and ceiling are not often perceived as objects but can be semantically grouped." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 234, + 415, + 247 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 234, + 415, + 247 + ], + "spans": [ + { + "bbox": [ + 131, + 234, + 415, + 247 + ], + "type": "text", + "content": "3.2 Object Grounding with Class Descriptions in Text" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "spans": [ + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "text", + "content": "Object mask grounding with cross-modal similarity. We adopt an image-text multi-modal encoder backbone to assign a text entity to each discovered mask by cross-modal similarity matching. We use the patch embedding of the SCLIP [95] backbone which roughly aligns the local image context with each patch embedding. Given a set of " + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "inline_equation", + "content": "Y" + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "text", + "content": " text classes, the text class descriptions are fed to the CLIP text encoder to obtain the set of text embeddings: " + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\{c_y\\}_{y=1}^Y" + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "text", + "content": ". Note that some benchmarks contain the background class. In these cases, following [95], we feed the background query text descriptions, e.g., wall, sky, etc., to avoid the ambiguous semantic of the text \"background\". The input image is fed to the SCLIP image encoder which returns the feature map: " + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\{f_x | x \\in [1, H] \\times [1, W]\\}" + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "text", + "content": " indicates a position. The image features that fall into an object mask region " + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "inline_equation", + "content": "\\mathcal{M}" + }, + { + "bbox": [ + 130, + 255, + 482, + 422 + ], + "type": "text", + "content": " are averaged to construct the object prototype [87, 97]. The class distribution is obtained by the cosine similarity of the object prototype and the text embedding:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 239, + 422, + 481, + 450 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 239, + 422, + 481, + 450 + ], + "spans": [ + { + "bbox": [ + 239, + 422, + 481, + 450 + ], + "type": "interline_equation", + "content": "p \\left(\\boldsymbol {f} _ {x \\in \\mathcal {M}} | y\\right) \\propto \\frac {1}{| \\mathcal {M} |} \\sum_ {x ^ {\\prime} \\in \\mathcal {M}} \\boldsymbol {f} _ {x ^ {\\prime}} ^ {\\top} \\boldsymbol {c} _ {y} \\tag {8}", + "image_path": "848e85ce046c8ea0a1ba737b5b3b47b8ebf0682cdb0cafa91ea58ec9c1c97bc3.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 455, + 420, + 467 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 455, + 420, + 467 + ], + "spans": [ + { + "bbox": [ + 131, + 455, + 420, + 467 + ], + "type": "text", + "content": "to assign the text class on the object, i.e., object-wise grounding." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 479, + 482, + 528 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 528 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 528 + ], + "type": "text", + "content": "Segmentation prediction. The class logit map is resized to the input image size by bilinear interpolation. When the background query set is used, the corresponding logits are merged as background. Each object mask is predicted with the highest cross-modal similarity class index." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 131, + 547, + 230, + 560 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 547, + 230, + 560 + ], + "spans": [ + { + "bbox": [ + 131, + 547, + 230, + 560 + ], + "type": "text", + "content": "4 Experiments" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 573, + 262, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 573, + 262, + 586 + ], + "spans": [ + { + "bbox": [ + 131, + 573, + 262, + 586 + ], + "type": "text", + "content": "4.1 Experimental Setup" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 667 + ], + "type": "text", + "content": "Implementation details. For the Panoptic cut input source, we use the feature map from DINO ViT-B/8 [11,26] trained on ImageNet1K [75] without labels. To solve the generalized eigenvector system in Equation 4, we use the PyTorch [67] built-in function 1obpcg which is compatible with GPUs. The maximum iteration for Panoptic cut is set to 16. We also use the pre-trained CLIP ViT-B/16 [69] for the image/text feature extractor. For object grounding with CLIP, we adopt" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 132, + 117, + 481, + 409 + ], + "blocks": [ + { + "bbox": [ + 132, + 117, + 481, + 409 + ], + "lines": [ + { + "bbox": [ + 132, + 117, + 481, + 409 + ], + "spans": [ + { + "bbox": [ + 132, + 117, + 481, + 409 + ], + "type": "image", + "image_path": "a6745357458824444328cd1900cb69beefc8d345254bd490d7145f8d0a98ebe7.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 418, + 480, + 440 + ], + "lines": [ + { + "bbox": [ + 132, + 418, + 480, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 418, + 480, + 440 + ], + "type": "text", + "content": "Fig. 5: Qualitative comparison of our method and baselines on COCO-stuff 164K. The * mark on the text set denotes the false positive class prediction of our model." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 467, + 482, + 563 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 467, + 482, + 563 + ], + "spans": [ + { + "bbox": [ + 130, + 467, + 482, + 563 + ], + "type": "text", + "content": "the sliding-window segmentation prediction scheme on high-resolution images, which is shown effective from the previous work [12, 95, 108]. We upsample the image as well as the Panoptic cut object masks such that the shorter size of the image becomes 336. The sliding window and the stride are set to " + }, + { + "bbox": [ + 130, + 467, + 482, + 563 + ], + "type": "inline_equation", + "content": "224 \\times 224" + }, + { + "bbox": [ + 130, + 467, + 482, + 563 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 467, + 482, + 563 + ], + "type": "inline_equation", + "content": "112 \\times 112" + }, + { + "bbox": [ + 130, + 467, + 482, + 563 + ], + "type": "text", + "content": ", respectively. Then each crop is fed to the image encoder which returns the pixel-level logit map on each cropped window, followed by averaging the logits. The codebase is adopted from SCLIP [95] which is based on mmseg [23]. An Nvidia RTX 3090 GPU is used for all experiments." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 581, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 665 + ], + "type": "text", + "content": "Datasets and benchmarks. We evaluate our method on five publicly available open-vocabulary semantic segmentation datasets: Pascal VOC 2012 [27], Pascal Context [65], ADE20K [118], COCO-Stuff and COCO-Object [56] plus two variants with the background queries. Background queries such as wall, sky, etc. are added on Pascal VOC and Pascal Context, which are indicated as VOC21 and Context60, respectively. We use the background query set from SCLIP [95] and do not engineer it further. Table 1 shows the configuration of the dataset classes." + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 133, + 114, + 482, + 314 + ], + "blocks": [ + { + "bbox": [ + 133, + 114, + 482, + 314 + ], + "lines": [ + { + "bbox": [ + 133, + 114, + 482, + 314 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 482, + 314 + ], + "type": "image", + "image_path": "a1bb5f8793f30cd0d00da87acb5cf8734366486c6ea483cfd3b245f32456b46c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 323, + 480, + 346 + ], + "lines": [ + { + "bbox": [ + 130, + 323, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 130, + 323, + 480, + 346 + ], + "type": "text", + "content": "Fig. 6: Qualitative comparison of our method and others. The first three columns are directly copied from the paper in the third columns [6,7,32,108,110]." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "spans": [ + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "text", + "content": "For evaluation, we use the standard mean IoU metric: " + }, + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "inline_equation", + "content": "\\mathrm{mIoU} = \\frac{1}{Y}\\sum_{y}\\mathrm{IoU}_{y}" + }, + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "inline_equation", + "content": "\\mathrm{IoU}_y" + }, + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "text", + "content": " denotes an IoU value of " + }, + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 360, + 482, + 387 + ], + "type": "text", + "content": "-th class." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 397, + 482, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 397, + 482, + 506 + ], + "spans": [ + { + "bbox": [ + 130, + 397, + 482, + 506 + ], + "type": "text", + "content": "Baseline methods. Vanilla CLIP is the most naive baseline. The set of image patch embeddings and the set of text embeddings are obtained from the pre-trained CLIP image and text encoder backbone, respectively. Cosine similarity between the two sets of embeddings is computed to obtain the cross-modal pixel-wise text similarity, which is directly translated as semantic segmentation prediction. SCLIP [95] is the primary baseline. SCLIP modifies the intermediate function of the attention layers in the pre-trained CLIP ViTs such that the final image patch embedding better represents the corresponding image patch semantics." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 525, + 270, + 537 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 525, + 270, + 537 + ], + "spans": [ + { + "bbox": [ + 132, + 525, + 270, + 537 + ], + "type": "text", + "content": "4.2 Experimental Results" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 545, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 668 + ], + "type": "text", + "content": "Qualitative results. We demonstrate the qualitative examples of the model outputs in Figure 5. Our model demonstrates advanced segmentation visuals compared to our baselines. Note that CLIP and SCLIP [95] are pixel-wise dense prediction methods. When segmentation prediction operates at pixel level, it does not necessarily comprehend the object shapes, resulting in noisy segmentation masks of objects. Ours, however, proceeds object mask discovery stage and returns object-level masks. As seen, our model predicts sharper and cleaner delineations that accurately capture semantic object boundaries, e.g., our model segments out the clear shape of the kites in the sky (first image). Other nice properties that our model often exhibits include capturing tiny kites (first im" + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 168, + 482, + 356 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 482, + 160 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 482, + 160 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 482, + 160 + ], + "type": "text", + "content": "Table 2: Performance (mIoU, %) comparison of the state-of-the-art open-vocabulary segmentation methods on seven public benchmarks. The models with " + }, + { + "bbox": [ + 131, + 114, + 482, + 160 + ], + "type": "inline_equation", + "content": "\\dagger" + }, + { + "bbox": [ + 131, + 114, + 482, + 160 + ], + "type": "text", + "content": " do not use CLIP. The models with " + }, + { + "bbox": [ + 131, + 114, + 482, + 160 + ], + "type": "inline_equation", + "content": "\\checkmark" + }, + { + "bbox": [ + 131, + 114, + 482, + 160 + ], + "type": "text", + "content": " involve additional training on top of the pretrained backbone. The numerical results [12,61,69,80,110,119] are adopted from SCLIP [95]." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 168, + 482, + 356 + ], + "lines": [ + { + "bbox": [ + 135, + 168, + 482, + 356 + ], + "spans": [ + { + "bbox": [ + 135, + 168, + 482, + 356 + ], + "type": "table", + "html": "
MethodtrainWith a background categoryWithout background category
VOC21Context60COCO-Obj.VOC20Context59ADECOCO-Stf.
CLIP [69]18.89.98.149.411.13.15.7
ZeroSeg [15]40.820.420.2----
MaskCLIP [119]43.423.220.674.926.411.916.7
ReCo [80]25.119.915.757.722.311.214.8
CLIPpy [71]52.2-32.0--13.5-
DiffSegmenter† [96]60.127.537.9----
SCLIP [95]59.130.430.580.434.216.122.4
ViL-Seg [59]✓34.416.316.4--11.9-
ViewCo [72]✓52.423.023.5----
MixReorg [7]✓47.923.9-----
GroupViT† [108]✓52.318.727.579.723.410.415.3
TCL [12]✓51.224.330.477.530.314.919.6
OVSegmentor† [110]✓53.820.425.1--5.6-
SegCLIP [61]✓52.624.726.5---
LaVG (ours)62.131.634.282.534.715.823.2
", + "image_path": "0abf1cf9f7ed31d5f88a99a01d9622930276348824cd04602eebd76c481f72f3.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 385, + 479, + 409 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 385, + 479, + 409 + ], + "spans": [ + { + "bbox": [ + 130, + 385, + 479, + 409 + ], + "type": "text", + "content": "age), segmentation with little spurious correlation (second image), and repeated chairs (third image)." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 411, + 482, + 520 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 411, + 482, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 411, + 482, + 520 + ], + "type": "text", + "content": "We also compare various other OVSeg models [6,7,32,108,110] in Figure 6. We copy and paste the visualization on their original papers and present our model's prediction. Thus the results are not much cherry-picked as the choice of visualized images is taken from the other work. Most previous work often presents visualized prediction favorably on Pascal VOC, most of which contain the objects that stand out. Unlike the examples of the other work with incorrect class predictions (the dog in the first image), holes in predicted masks (the second image), and misaligned contour (third example), our model presents much cleaner mask prediction and better class prediction." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": "Quantitative comparison with state-of-the-art models. Table 2 compares the existing OVSeg methods on seven public benchmarks. The performance values of MaskCLIP [119], ReCo [38], and TCL [12] are brought from the reimplementation of SCLIP, which are either higher or the same values as the ones in the original papers. The performance values of the rest of work [7,15,59,61,71,72,96, 108,110] are from their original performance reports. Our model outperforms the previous state-of-the-art models. Note that our model outperforms not only the learning-free models [15,38,71,95,119] but also the weakly-supervised learning models [7,12,59,61,72,108,110] that exploits image-text paired datasets, e.g., CC3M [13], YFCC [89], or COCO [56] from the " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "3.4\\mathrm{M}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "inline_equation", + "content": "26\\mathrm{M}" + }, + { + "bbox": [ + 130, + 545, + 482, + 666 + ], + "type": "text", + "content": " dataset scale." + } + ] + } + ], + "index": 6 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 135, + 480, + 219 + ], + "blocks": [ + { + "bbox": [ + 170, + 114, + 443, + 126 + ], + "lines": [ + { + "bbox": [ + 170, + 114, + 443, + 126 + ], + "spans": [ + { + "bbox": [ + 170, + 114, + 443, + 126 + ], + "type": "text", + "content": "Table 3: Comparison with different object mask discovery models" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 135, + 480, + 219 + ], + "lines": [ + { + "bbox": [ + 135, + 135, + 480, + 219 + ], + "spans": [ + { + "bbox": [ + 135, + 135, + 480, + 219 + ], + "type": "table", + "html": "
VOC21Context60COCO-Obj.VOC20Context59COCO-Stf.
Normalized cut [78]47.626.328.278.129.320.0
CutLER-CascadedRCNN [99]57.329.333.279.632.222.3
Panoptic cut (4 iterations)61.130.333.781.333.422.6
Panoptic cut (16 iterations)62.131.634.282.534.723.2
Panoptic cut (32 iterations)61.431.734.282.634.823.3
Ground-truth object masks68.337.144.187.740.227.6
", + "image_path": "36c73365204f1426e380aa623428b654fcd5a4a7554b237efc2e7e7ed703b36f.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 135, + 254, + 483, + 308 + ], + "blocks": [ + { + "bbox": [ + 133, + 232, + 480, + 244 + ], + "lines": [ + { + "bbox": [ + 133, + 232, + 480, + 244 + ], + "spans": [ + { + "bbox": [ + 133, + 232, + 480, + 244 + ], + "type": "text", + "content": "Table 4: Comparison with different grounding schemes. " + }, + { + "bbox": [ + 133, + 232, + 480, + 244 + ], + "type": "inline_equation", + "content": "\\mathcal{O}" + }, + { + "bbox": [ + 133, + 232, + 480, + 244 + ], + "type": "text", + "content": " denotes object mask region." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 254, + 483, + 308 + ], + "lines": [ + { + "bbox": [ + 135, + 254, + 483, + 308 + ], + "spans": [ + { + "bbox": [ + 135, + 254, + 483, + 308 + ], + "type": "table", + "html": "
VOC21Context60COCO-ObjectVOC20Context59COCO-Stuff
O-masked attention54.626.927.661.728.218.3
Gaussian blur on non-O59.830.931.571.633.421.5
O-averaged prototype62.131.634.282.534.723.2
", + "image_path": "53389534d54a72fd95fc96960cc3442996de1f1c062c5ea71c935aa5e46fa821.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 335, + 277, + 346 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 335, + 277, + 346 + ], + "spans": [ + { + "bbox": [ + 132, + 335, + 277, + 346 + ], + "type": "text", + "content": "4.3 Experimental Analyses" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 360, + 480, + 384 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 360, + 480, + 384 + ], + "spans": [ + { + "bbox": [ + 130, + 360, + 480, + 384 + ], + "type": "text", + "content": "We ablate the components in our method and see their effectiveness. In tables, our method is colored in gray." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 402, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 402, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 402, + 482, + 665 + ], + "type": "text", + "content": "Comparison with other object mask discovery models. To verify the strength of Panoptic cut in segmentation, we compare Panoptic cut with other object discovery models and compare them in Table 3. Among the modern object discovery neural networks, CutLER [99] is compared. CutLER first produces object mask proposals with a derivative of Normalized cut (MaskCut) and uses the proposals as self-supervision to train an unsupervised instance segmentation & object detection architecture, e.g., Cascaded-RCNN [8]. To adapt CutLER to semantic segmentation, the undetected pixels are considered as a single region and averaged at the feature level as background. The naïve adoption of the state-of-the-art object discovery method does not directly translate to high open-vocabulary segmentation performance. We observe that CutLER tends to detect fine-grained parts of foreground objects while leaving the background under-segmented, e.g., undetected sky and sea grouped together, probably because the training objective is to detect foreground objects. Although this model achieves promising performance that beats most of the methods in Table 2 but is lower than Panoptic cut. Panoptic cut produces proper semantic segmentation of background, plus, it requires no additional training. We believe that Panoptic cut is a more suitable choice than instance detection or salient detection methods [36] for semantic segmentation, where all the present pixels should be classified for segmentation. Panoptic cut iterates the preset number of iterations, where we gain from " + }, + { + "bbox": [ + 130, + 402, + 482, + 665 + ], + "type": "inline_equation", + "content": "0.5\\%" + }, + { + "bbox": [ + 130, + 402, + 482, + 665 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 402, + 482, + 665 + ], + "type": "inline_equation", + "content": "1.3\\%" + }, + { + "bbox": [ + 130, + 402, + 482, + 665 + ], + "type": "text", + "content": " point mIoU gain from maximum of 4 to 16 iterations." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 150, + 146, + 463, + 215 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "text", + "content": "Table 5: Comparison of computational cost measured with an Nvidia RTX 3090. The columns with " + }, + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "inline_equation", + "content": "\\dagger" + }, + { + "bbox": [ + 132, + 114, + 482, + 137 + ], + "type": "text", + "content": " are taken from [21]." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 150, + 146, + 463, + 215 + ], + "lines": [ + { + "bbox": [ + 150, + 146, + 463, + 215 + ], + "spans": [ + { + "bbox": [ + 150, + 146, + 463, + 215 + ], + "type": "table", + "html": "
methodsZSSeg [111]†CATseg [21]†DiffSegmenter [96]LaVG
# learnable params. (M)102.870.300
# total params. (M)530.8433.71453198
training time (min)958.5875.500
inference time (s)2.730.540.5912.59
", + "image_path": "be14fa0c2741dcfd4256b4b785429483e4affd557f3e5fe8afe9f551b2e06696.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 237, + 489, + 417 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 237, + 489, + 417 + ], + "spans": [ + { + "bbox": [ + 130, + 237, + 489, + 417 + ], + "type": "text", + "content": "Comparison with different grounding schemes. We explore different grounding schemes and compare them on Table 4. Specifically, three object embedding methods are compared, all based on the SCLIP feature. First, object-masked " + }, + { + "bbox": [ + 130, + 237, + 489, + 417 + ], + "type": "inline_equation", + "content": "\\mathcal{O}" + }, + { + "bbox": [ + 130, + 237, + 489, + 417 + ], + "type": "text", + "content": "-masked attention [18, 40, 44] forces the forward path of ViTs to attend only to the designated region. We zero out the non-object region on the input image and set a large negative value on the non-object pixel patch embedding before the softmax in the attention in the ViT backbone. Recent work [81] explores a way to explicitly draw attention on the input image level in a human-friendly manner. We adopt their idea of applying Gaussian blur on the non-object regions on the input image and taking the global image representation as the local feature. Note that these two schemes require multiple feed-forward passes with the same image with different attention masks and different Gaussian blurred regions. Our method (the last line) is the simplest: averaging the region patch embedding (Eq. 8). The object-averaged prototype shows superior performance in terms of both end-task accuracy and complexity." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 431, + 482, + 528 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 431, + 482, + 528 + ], + "spans": [ + { + "bbox": [ + 130, + 431, + 482, + 528 + ], + "type": "text", + "content": "Computational complexity. Table 5 compares the computational cost of LaVG with a training-free model [96] and trained models [21, 111]. The outstanding advantage of training-free models is the computational efficiency from the absence of time, data, and computation burden in additional training. Compared to another training-free ovseg method [96] based on diffusion models [73] which leverages image/caption generation models with heavy parameters, we use much more lightweight feature embedding models. However, our iterative process of panoptic cut introduces a longer inference time." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 547, + 302, + 560 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 547, + 302, + 560 + ], + "spans": [ + { + "bbox": [ + 132, + 547, + 302, + 560 + ], + "type": "text", + "content": "4.4 Limitations of our approach" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": "We outline four characteristic limitations of our method. The intrinsic problem of our method is the extensive computation time and memory consumption induced by leveraging the graph-based partitioning algorithm. Normalized cut generally consumes the excessive use of memory due to the use of " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "N \\times N" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " size affinity matrix. For example, running Normalized cut on a " + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "inline_equation", + "content": "512 \\times 512" + }, + { + "bbox": [ + 130, + 569, + 482, + 666 + ], + "type": "text", + "content": " RGB image directly leads to the out-of-memory error. However, using a well-abstracted downsampled feature map of the DINO attention greatly reduces the memory consumption and smoothly executes on a single regular GPU device, e.g., Nvidia RTX 3090. Also," + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 481, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 481, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 481, + 140 + ], + "type": "text", + "content": "our approach is inference-only thus includes no training time, which is still more computationally efficient than training models." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 141, + 482, + 213 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 141, + 482, + 213 + ], + "spans": [ + { + "bbox": [ + 130, + 141, + 482, + 213 + ], + "type": "text", + "content": "In terms of the end-task performance, we witness the remarkable qualitative improvement as seen in Figures 5-6, but it does not directly enhance mIoU values substantially. This is because the evaluation metric is pixel-level classification rather than favoring aligned edges or clean shapes of objects. In addition, the proposed method occasionally misclassifies objects which also negatively affects the mIoU performance." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 214, + 482, + 299 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 214, + 482, + 299 + ], + "spans": [ + { + "bbox": [ + 130, + 214, + 482, + 299 + ], + "type": "text", + "content": "Another limitation is qualitatively observed in the last example of Figure 5. Due to the sliding-window segmentation inference technique, the cropped region suffers the part-whole ambiguity issue and sometimes predicts a wrong class on the region. This side effect is often observed on textureless regions, e.g., the model confuses the sky and cloud in the last example of Figure 5. However, the recognition of the image as a whole might remedy the part-whole ambiguity, but the accuracy of the small-resolution images drops at the same time." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 300, + 482, + 348 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 482, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 482, + 348 + ], + "type": "text", + "content": "Lastly, out method implemented with CLIP is potentially inappropriate for closed-vocabulary segmentation on specialized domains such as medical or industrial vision. For such problems on specific domains, however, the concept of lazy grounding can be used with domain-specific encoders." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 373, + 219, + 387 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 373, + 219, + 387 + ], + "spans": [ + { + "bbox": [ + 132, + 373, + 219, + 387 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 406, + 482, + 574 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 406, + 482, + 574 + ], + "spans": [ + { + "bbox": [ + 130, + 406, + 482, + 574 + ], + "type": "text", + "content": "We have proposed Lazy Visual Grounding, a late-interaction semantic segmentation approach, for open-vocabulary semantic segmentation. Our method first proceeds unsupervised object mask discovery by graph partitioning and the lazy grounding on the discovered object masks. This simple and training-free method exceeds the performance of the caption-based weakly-supervised learning models. Given the observation that the classic graph partitioning method surpasses such trendy deep-learning models, we claim that semantic pixel-grouping is crucial for semantic segmentation and should be prioritized especially when segmentation supervision is not available. Last but not least, given the output format of our method is object-level and hence identifiable, LaVG provides more accurate and crisp object boundaries, which makes it particularly suitable for grounding tasks that require object-level recognition with precise boundaries. This work may open the door for training-free open-vocabulary instance segmentation, which has not been actively studied, yet." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "content": "Acknowledgements. This work was supported by Samsung Electronics (IO20 1208-07822-01), the NRF grant (NRF-2021R1A2C3012728 " + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "inline_equation", + "content": "(45\\%)" + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "content": "), and the IITP grants (RS-2022-II220959: Few-Shot Learning of Causal Inference in Vision and Language for Decision Making " + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "inline_equation", + "content": "(50\\%)" + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "content": ", RS-2019-II191906: AI Graduate School Program at POSTECH " + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "inline_equation", + "content": "(5\\%)" + }, + { + "bbox": [ + 130, + 593, + 482, + 665 + ], + "type": "text", + "content": ") funded by Ministry of Science and ICT, Korea. We also thank Sua Choi for her helpful discussion." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 197, + 126 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 141, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 142, + 141, + 480, + 164 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 141, + 480, + 164 + ], + "spans": [ + { + "bbox": [ + 142, + 141, + 480, + 164 + ], + "type": "text", + "content": "1. Amir, S., Gandelsman, Y., Bagon, S., Dekel, T.: Deep vit features as dense visual descriptors. arXiv preprint arXiv:2112.05814 2(3), 4 (2021) 7" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 142, + 165, + 480, + 198 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 165, + 480, + 198 + ], + "spans": [ + { + "bbox": [ + 142, + 165, + 480, + 198 + ], + "type": "text", + "content": "2. Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: From contours to regions: An empirical evaluation. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2294-2301. IEEE (2009) 2" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 142, + 198, + 480, + 220 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 198, + 480, + 220 + ], + "spans": [ + { + "bbox": [ + 142, + 198, + 480, + 220 + ], + "type": "text", + "content": "3. Blake, A., Kohli, P., Rother, C.: Markov random fields for vision and image processing. MIT press (2011) 2" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 142, + 221, + 480, + 254 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 221, + 480, + 254 + ], + "spans": [ + { + "bbox": [ + 142, + 221, + 480, + 254 + ], + "type": "text", + "content": "4. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on pattern analysis and machine intelligence 23(11), 1222-1239 (2001) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 142, + 255, + 480, + 297 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 255, + 480, + 297 + ], + "spans": [ + { + "bbox": [ + 142, + 255, + 480, + 297 + ], + "type": "text", + "content": "5. Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 299, + 480, + 320 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 299, + 480, + 320 + ], + "spans": [ + { + "bbox": [ + 142, + 299, + 480, + 320 + ], + "type": "text", + "content": "6. Bucher, M., Vu, T.H., Cord, M., Pérez, P.: Zero-shot semantic segmentation. Advances in Neural Information Processing Systems 32 (2019) 2, 10, 11" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 142, + 321, + 480, + 365 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 321, + 480, + 365 + ], + "spans": [ + { + "bbox": [ + 142, + 321, + 480, + 365 + ], + "type": "text", + "content": "7. Cai, K., Ren, P., Zhu, Y., Xu, H., Liu, J., Li, C., Wang, G., Liang, X.: Mixreorg: Cross-modal mixed patch reorganization is a good mask learner for open-world semantic segmentation. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 1196-1205 (2023) 3, 5, 10, 11" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 142, + 366, + 480, + 399 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 366, + 480, + 399 + ], + "spans": [ + { + "bbox": [ + 142, + 366, + 480, + 399 + ], + "type": "text", + "content": "8. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018) 4, 12" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 399, + 480, + 431 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 142, + 399, + 480, + 431 + ], + "spans": [ + { + "bbox": [ + 142, + 399, + 480, + 431 + ], + "type": "text", + "content": "9. Caron, M., Bojanowski, P., Joulin, A., Douze, M.: Deep clustering for unsupervised learning of visual features. In: Proc. European Conference on Computer Vision (ECCV) (2018) 4" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 432, + 480, + 465 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 432, + 480, + 465 + ], + "spans": [ + { + "bbox": [ + 138, + 432, + 480, + 465 + ], + "type": "text", + "content": "10. Caron, M., Misra, I., Mairal, J., Goyal, P., Bojanowski, P., Joulin, A.: Unsupervised learning of visual features by contrasting cluster assignments. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 466, + 480, + 498 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 466, + 480, + 498 + ], + "spans": [ + { + "bbox": [ + 138, + 466, + 480, + 498 + ], + "type": "text", + "content": "11. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2021) 2, 4, 7, 8" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 499, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 499, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 499, + 480, + 542 + ], + "type": "text", + "content": "12. Cha, J., Mun, J., Roh, B.: Learning to generate text-grounded mask for open-world semantic segmentation from only image-text pairs. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 2, 3, 5, 9, 11" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 544, + 480, + 587 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 587 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 587 + ], + "type": "text", + "content": "13. Changpinyo, S., Sharma, P., Ding, N., Soricut, R.: Conceptual 12m: Pushing web-scale image-text pre-training to recognize long-tail visual concepts. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3558-3568 (2021) 3, 11" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 588, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 588, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 138, + 588, + 480, + 620 + ], + "type": "text", + "content": "14. Chen, C.W., Luo, J., Parker, K.J.: Image segmentation via adaptive k-mean clustering and knowledge-based morphological operations with biomedical applications. IEEE transactions on image processing 7(12), 1673-1683 (1998) 2" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 621, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 480, + 665 + ], + "type": "text", + "content": "15. Chen, J., Zhu, D., Qian, G., Ghanem, B., Yan, Z., Zhu, C., Xiao, F., Elhoseiny, M., Culatana, S.C.: Exploring open-vocabulary semantic segmentation from clip vision encoder distillation only. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 3, 5, 11" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 481, + 160 + ], + "type": "text", + "content": "16. Chen, L.C., Papandreou, G., Kokkinos, I., Murphy, K., Yuille, A.L.: Deeplab: Semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected crfs. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2017) 2, 5" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 160, + 481, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 160, + 481, + 192 + ], + "spans": [ + { + "bbox": [ + 138, + 160, + 481, + 192 + ], + "type": "text", + "content": "17. Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International conference on machine learning. pp. 1597-1607. PMLR (2020) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 192, + 481, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 192, + 481, + 236 + ], + "spans": [ + { + "bbox": [ + 138, + 192, + 481, + 236 + ], + "type": "text", + "content": "18. Cheng, B., Misra, I., Schwing, A.G., Kirillov, A., Girdhar, R.: Masked-attention mask transformer for universal image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 1290-1299 (2022) 5, 13" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 236, + 481, + 257 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 236, + 481, + 257 + ], + "spans": [ + { + "bbox": [ + 138, + 236, + 481, + 257 + ], + "type": "text", + "content": "19. Cheng, B., Schwing, A.G., Kirillov, A.: Per-pixel classification is not all you need for semantic segmentation (2021) 2, 5" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 257, + 481, + 300 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 257, + 481, + 300 + ], + "spans": [ + { + "bbox": [ + 138, + 257, + 481, + 300 + ], + "type": "text", + "content": "20. Cho, M., Kwak, S., Schmid, C., Ponce, J.: Unsupervised object discovery and localization in the wild: Part-based matching with bottom-up region proposals. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1201-1210 (2015) 2, 4" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 300, + 481, + 321 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 300, + 481, + 321 + ], + "spans": [ + { + "bbox": [ + 138, + 300, + 481, + 321 + ], + "type": "text", + "content": "21. Cho, S., Shin, H., Hong, S., An, S., Lee, S., Arnab, A., Seo, P.H., Kim, S.: Cat-seg: Cost aggregation for open-vocabulary semantic segmentation (2023) 5, 13" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 321, + 481, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 321, + 481, + 354 + ], + "spans": [ + { + "bbox": [ + 138, + 321, + 481, + 354 + ], + "type": "text", + "content": "22. Choi, S., Kang, D., Cho, M.: Contrastive mean-shift learning for generalized category discovery. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2024) 4" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 354, + 481, + 374 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 354, + 481, + 374 + ], + "spans": [ + { + "bbox": [ + 138, + 354, + 481, + 374 + ], + "type": "text", + "content": "23. Contributors, M.: MMSegmentation: Openmmlab semantic segmentation toolbox and benchmark. https://github.com/open-mmlab/mmsegmentation (2020) 9" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 374, + 481, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 374, + 481, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 374, + 481, + 418 + ], + "type": "text", + "content": "24. Cordts, M., Omran, M., Ramos, S., Rehfeld, T., Enzweiler, M., Benenson, R., Franke, U., Roth, S., Schiele, B.: The cityscapes dataset for semantic urban scene understanding. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2016) 2" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 418, + 481, + 439 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 418, + 481, + 439 + ], + "spans": [ + { + "bbox": [ + 138, + 418, + 481, + 439 + ], + "type": "text", + "content": "25. Ding, Z., Wang, J., Tu, Z.: Open-vocabulary universal image segmentation with maskclip. Proc. International Conference on Machine Learning (ICML) (2023) 5" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 439, + 481, + 482 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 439, + 481, + 482 + ], + "spans": [ + { + "bbox": [ + 138, + 439, + 481, + 482 + ], + "type": "text", + "content": "26. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., Uszkoreit, J., Houlsby, N.: An image is worth 16x16 words: Transformers for image recognition at scale. In: Proc. International Conference on Learning Representations (ICLR) (2021) 7, 8" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 482, + 481, + 514 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 482, + 481, + 514 + ], + "spans": [ + { + "bbox": [ + 138, + 482, + 481, + 514 + ], + "type": "text", + "content": "27. Everingham, M., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The Pascal visual object classes (voc) challenge. International Journal of Computer Vision (IJCV) (2010) 2, 9" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 514, + 481, + 547 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 514, + 481, + 547 + ], + "spans": [ + { + "bbox": [ + 138, + 514, + 481, + 547 + ], + "type": "text", + "content": "28. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 5" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 547, + 481, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 547, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 138, + 547, + 481, + 578 + ], + "type": "text", + "content": "29. Ghiasi, G., Gu, X., Cui, Y., Lin, T.Y.: Scaling open-vocabulary image segmentation with image-level labels. In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 578, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 578, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 138, + 578, + 481, + 621 + ], + "type": "text", + "content": "30. Grauman, K., Darrell, T.: Unsupervised learning of categories from sets of partially matching image features. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 1, pp. 19-25. IEEE (2006) 4" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 621, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 621, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 621, + 481, + 665 + ], + "type": "text", + "content": "31. Grill, J.B., Strub, F., Altché, F., Tallec, C., Richemond, P., Buchatskaya, E., Doersch, C., Avila Pires, B., Guo, Z., Gheshlaghi Azar, M., et al.: Bootstrap your own latent-a new approach to self-supervised learning. Advances in Neural Information Processing Systems (NeurIPS) (2020) 4" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 480, + 149 + ], + "type": "text", + "content": "32. Gu, Z., Zhou, S., Niu, L., Zhao, Z., Zhang, L.: Context-aware feature generation for zero-shot semantic segmentation. In: Proceedings of the 28th ACM International Conference on Multimedia. pp. 1921-1929 (2020) 10, 11" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 151, + 480, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 151, + 480, + 184 + ], + "spans": [ + { + "bbox": [ + 138, + 151, + 480, + 184 + ], + "type": "text", + "content": "33. Gui, J., Chen, T., Cao, Q., Sun, Z., Luo, H., Tao, D.: A survey of self-supervised learning from multiple perspectives: Algorithms, theory, applications and future trends. arXiv preprint arXiv:2301.05712 (2023) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "spans": [ + { + "bbox": [ + 138, + 185, + 480, + 217 + ], + "type": "text", + "content": "34. Gupta, A., Dollar, P., Girshick, R.: Lvis: A dataset for large vocabulary instance segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 5356-5364 (2019) 2" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 218, + 480, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 218, + 480, + 239 + ], + "spans": [ + { + "bbox": [ + 138, + 218, + 480, + 239 + ], + "type": "text", + "content": "35. He, K., Gkioxari, G., Dollár, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 240, + 480, + 274 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 240, + 480, + 274 + ], + "spans": [ + { + "bbox": [ + 138, + 240, + 480, + 274 + ], + "type": "text", + "content": "36. Hsu, K.J., Tsai, C.C., Lin, Y.Y., Qian, X., Chuang, Y.Y.: Unsupervised cnn-based co-saliency detection with graphical optimization. In: Proceedings of the European conference on computer vision (ECCV). pp. 485-501 (2018) 12" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 274, + 480, + 319 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 274, + 480, + 319 + ], + "spans": [ + { + "bbox": [ + 138, + 274, + 480, + 319 + ], + "type": "text", + "content": "37. Huang, S., Gong, B., Pan, Y., Jiang, J., Lv, Y., Li, Y., Wang, D.: Vop: Text-video co-operative prompt tuning for cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). pp. 6565-6574 (June 2023) 5" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 319, + 480, + 351 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 319, + 480, + 351 + ], + "spans": [ + { + "bbox": [ + 138, + 319, + 480, + 351 + ], + "type": "text", + "content": "38. Iscen, A., Caron, M., Fathi, A., Schmid, C.: Retrieval-enhanced contrastive vision-text models. Advances in Neural Information Processing Systems (NeurIPS) (2023) 3, 5, 11" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 352, + 480, + 385 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 352, + 480, + 385 + ], + "spans": [ + { + "bbox": [ + 138, + 352, + 480, + 385 + ], + "type": "text", + "content": "39. Jing, L., Tian, Y.: Self-supervised visual feature learning with deep neural networks: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2020) 4" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 386, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 386, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 386, + 480, + 418 + ], + "type": "text", + "content": "40. Kang, D., Cho, M.: Integrative few-shot learning for classification and segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 9979-9990 (2022) 13" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 419, + 480, + 462 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 419, + 480, + 462 + ], + "spans": [ + { + "bbox": [ + 138, + 419, + 480, + 462 + ], + "type": "text", + "content": "41. Kang, D., Koniusz, P., Cho, M., Murray, N.: Distilling self-supervised vision transformers for weakly-supervised few-shot classification & segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 4, 7" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 464, + 480, + 485 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 464, + 480, + 485 + ], + "spans": [ + { + "bbox": [ + 138, + 464, + 480, + 485 + ], + "type": "text", + "content": "42. Karazija, L., Laina, I., Vedaldi, A., Rupprecht, C.: Diffusion models for zero-shot open-vocabulary segmentation. arXiv preprint arXiv:2306.09316 (2023) 5" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 486, + 480, + 509 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 486, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 138, + 486, + 480, + 509 + ], + "type": "text", + "content": "43. Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International journal of computer vision 1(4), 321-331 (1988) 2" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 509, + 480, + 540 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 509, + 480, + 540 + ], + "spans": [ + { + "bbox": [ + 138, + 509, + 480, + 540 + ], + "type": "text", + "content": "44. Kenton, J.D.M.W.C., Toutanova, L.K.: Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of NAACL-HLT (2019) 13" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 542, + 480, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 542, + 480, + 564 + ], + "spans": [ + { + "bbox": [ + 138, + 542, + 480, + 564 + ], + "type": "text", + "content": "45. Kim, S., Kang, M., Park, J.: Risclip: Referring image segmentation framework using clip. arXiv preprint arXiv:2306.08498 (2023) 5" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 565, + 480, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 565, + 480, + 597 + ], + "spans": [ + { + "bbox": [ + 138, + 565, + 480, + 597 + ], + "type": "text", + "content": "46. Kirillov, A., He, K., Girshick, R., Rother, C., Dollar, P.: Panoptic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 9404-9413 (2019) 3" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 599, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 599, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 138, + 599, + 480, + 632 + ], + "type": "text", + "content": "47. Kirillov, A., Levinkov, E., Andres, B., Savchynskyy, B., Rother, C.: Instancecut: from edges to instances with multicut. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 5008-5017 (2017) 2" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 632, + 480, + 665 + ], + "type": "text", + "content": "48. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W.Y., et al.: Segment anything. arXiv preprint arXiv:2304.02643 (2023) 2" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 137, + 116, + 479, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 116, + 479, + 148 + ], + "spans": [ + { + "bbox": [ + 137, + 116, + 479, + 148 + ], + "type": "text", + "content": "49. Krahenbuhl, P., Koltun, V.: Efficient inference in fully connected crfs with gaussian edge potentials. Advances in neural information processing systems 24 (2011) 7" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 137, + 149, + 480, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 149, + 480, + 182 + ], + "spans": [ + { + "bbox": [ + 137, + 149, + 480, + 182 + ], + "type": "text", + "content": "50. Lee, Y.J., Grauman, K.: Shape discovery from unlabeled image collections. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. pp. 2254-2261. IEEE (2009) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 137, + 182, + 480, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 182, + 480, + 215 + ], + "spans": [ + { + "bbox": [ + 137, + 182, + 480, + 215 + ], + "type": "text", + "content": "51. Li, B., Shi, Y., Qi, Z., Chen, Z.: A survey on semantic segmentation. In: 2018 IEEE International Conference on Data Mining Workshops (ICDMW). pp. 1233-1240. IEEE (2018) 2" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 216, + 480, + 248 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 216, + 480, + 248 + ], + "spans": [ + { + "bbox": [ + 137, + 216, + 480, + 248 + ], + "type": "text", + "content": "52. Li, B., Weinberger, K.Q., Belongie, S., Koltun, V., Ranftl, R.: Language-driven semantic segmentation. In: International Conference on Learning Representations (2022), https://openreview.net/forum?id=RriDjddCLN 2, 5" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 137, + 249, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 249, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 137, + 249, + 480, + 281 + ], + "type": "text", + "content": "53. Li, Z., Chen, J.: Superpixel segmentation using linear spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 1356-1363 (2015) 2" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 137, + 281, + 480, + 314 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 281, + 480, + 314 + ], + "spans": [ + { + "bbox": [ + 137, + 281, + 480, + 314 + ], + "type": "text", + "content": "54. Li, Z., Zhou, Q., Zhang, X., Zhang, Y., Wang, Y., Xie, W.: Open-vocabulary object segmentation with diffusion models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 5" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 137, + 315, + 480, + 357 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 315, + 480, + 357 + ], + "spans": [ + { + "bbox": [ + 137, + 315, + 480, + 357 + ], + "type": "text", + "content": "55. Liang, F., Wu, B., Dai, X., Li, K., Zhao, Y., Zhang, H., Zhang, P., Vajda, P., Marculescu, D.: Open-vocabulary semantic segmentation with mask-adapted clip. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 137, + 358, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 358, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 137, + 358, + 480, + 391 + ], + "type": "text", + "content": "56. Lin, T.Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollar, P., Zitnick, C.L.: Microsoft coco: Common objects in context. In: Proc. European Conference on Computer Vision (ECCV) (2014) 2, 3, 9, 11" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 137, + 392, + 480, + 411 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 392, + 480, + 411 + ], + "spans": [ + { + "bbox": [ + 137, + 392, + 480, + 411 + ], + "type": "text", + "content": "57. Liu, H., Li, C., Wu, Q., Lee, Y.J.: Visual instruction tuning. In: NeurIPS (2023) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 137, + 413, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 413, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 137, + 413, + 480, + 456 + ], + "type": "text", + "content": "58. Liu, H., Son, K., Yang, J., Liu, C., Gao, J., Lee, Y.J., Li, C.: Learning customized visual models with retrieval-augmented knowledge. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 15148-15158 (2023) 5" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 137, + 457, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 457, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 137, + 457, + 480, + 490 + ], + "type": "text", + "content": "59. Liu, Q., Wen, Y., Han, J., Xu, C., Xu, H., Liang, X.: Open-world semantic segmentation via contrasting and clustering vision-language embedding. In: Proc. European Conference on Computer Vision (ECCV) (2022) 3, 5, 11" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 137, + 491, + 480, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 491, + 480, + 522 + ], + "spans": [ + { + "bbox": [ + 137, + 491, + 480, + 522 + ], + "type": "text", + "content": "60. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2015) 2, 5" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 137, + 523, + 480, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 523, + 480, + 555 + ], + "spans": [ + { + "bbox": [ + 137, + 523, + 480, + 555 + ], + "type": "text", + "content": "61. Luo, H., Bao, J., Wu, Y., He, X., Li, T.: Segclip: Patch aggregation with learnable centers for open-vocabulary semantic segmentation. In: Proc. International Conference on Machine Learning (ICML) (2023) 3, 5, 11" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 137, + 555, + 480, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 555, + 480, + 599 + ], + "spans": [ + { + "bbox": [ + 137, + 555, + 480, + 599 + ], + "type": "text", + "content": "62. Ma, H., Zhao, H., Lin, Z., Kale, A., Wang, Z., Yu, T., Gu, J., Choudhary, S., Xie, X.: Ei-clip: Entity-aware interventional contrastive learning for e-commerce cross-modal retrieval. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 18051–18061 (2022) 5" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 137, + 600, + 480, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 600, + 480, + 632 + ], + "spans": [ + { + "bbox": [ + 137, + 600, + 480, + 632 + ], + "type": "text", + "content": "63. Ma, T., Geng, S., Wang, M., Shao, J., Lu, J., Li, H., Gao, P., Qiao, Y.: A simple long-tailed recognition baseline via vision-language model. arXiv preprint arXiv:2111.14745 (2021) 5" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 137, + 632, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 632, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 137, + 632, + 480, + 665 + ], + "type": "text", + "content": "64. Ma, T., Geng, S., Wang, M., Xu, S., Li, H., Zhang, B., Gao, P., Qiao, Y.: Unleashing the potential of vision-language models for long-tailed visual recognition (2022) 5" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 160 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 480, + 160 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 480, + 160 + ], + "type": "text", + "content": "65. Mottaghi, R., Chen, X., Liu, X., Cho, N.G., Lee, S.W., Fidler, S., Urtasun, R., Yuille, A.: The role of context for object detection and semantic segmentation in the wild. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2014) 9" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 160, + 480, + 192 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 160, + 480, + 192 + ], + "spans": [ + { + "bbox": [ + 138, + 160, + 480, + 192 + ], + "type": "text", + "content": "66. Noh, H., Hong, S., Han, B.: Learning deconvolution network for semantic segmentation. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2015) 2" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 192, + 480, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 192, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 138, + 192, + 480, + 236 + ], + "type": "text", + "content": "67. Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A.: Automatic differentiation in pytorch. In: Advances in Neural Information Processing Systems (NeurIPS) Workshop Autodiff (2017) 8" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 236, + 480, + 280 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 236, + 480, + 280 + ], + "spans": [ + { + "bbox": [ + 138, + 236, + 480, + 280 + ], + "type": "text", + "content": "68. Pizer, S.M., Amburn, E.P., Austin, J.D., Cromartie, R., Geselowitz, A., Greer, T., ter Haar Romeny, B., Zimmerman, J.B., Zuiderveld, K.: Adaptive histogram equalization and its variations. Computer vision, graphics, and image processing 39(3), 355-368 (1987) 2" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 280, + 480, + 322 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 280, + 480, + 322 + ], + "spans": [ + { + "bbox": [ + 138, + 280, + 480, + 322 + ], + "type": "text", + "content": "69. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: Proc. International Conference on Machine Learning (ICML) (2021) 2, 4, 8, 11" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 322, + 480, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 322, + 480, + 354 + ], + "spans": [ + { + "bbox": [ + 138, + 322, + 480, + 354 + ], + "type": "text", + "content": "70. Rambhatla, S.S., Misra, I., Chellappa, R., Shrivastava, A.: Most: Multiple object localization with self-supervised transformers for object discovery. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 2, 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 354, + 480, + 387 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 354, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 138, + 354, + 480, + 387 + ], + "type": "text", + "content": "71. Ranasinghe, K., McKinzie, B., Ravi, S., Yang, Y., Toshev, A., Shlens, J.: Perceptual grouping in contrastive vision-language models. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 3, 11" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 387, + 480, + 418 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 387, + 480, + 418 + ], + "spans": [ + { + "bbox": [ + 138, + 387, + 480, + 418 + ], + "type": "text", + "content": "72. Ren, P., Li, C., Xu, H., Zhu, Y., Wang, G., Liu, J., Chang, X., Liang, X.: Viewco: Discovering text-supervised segmentation masks via multi-view semantic consistency. arXiv preprint arXiv:2302.10307 (2023) 3, 5, 11" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 418, + 480, + 440 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 418, + 480, + 440 + ], + "spans": [ + { + "bbox": [ + 138, + 418, + 480, + 440 + ], + "type": "text", + "content": "73. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models (2021) 13" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 440, + 480, + 472 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 440, + 480, + 472 + ], + "spans": [ + { + "bbox": [ + 138, + 440, + 480, + 472 + ], + "type": "text", + "content": "74. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: International Conference on Medical image computing and computer-assisted intervention (2015) 2" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 472, + 480, + 515 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 472, + 480, + 515 + ], + "spans": [ + { + "bbox": [ + 138, + 472, + 480, + 515 + ], + "type": "text", + "content": "75. Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al.: Imagenet large scale visual recognition challenge. International Journal of Computer Vision (IJCV) 115(3), 211-252 (2015) 8" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 515, + 480, + 558 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 515, + 480, + 558 + ], + "spans": [ + { + "bbox": [ + 138, + 515, + 480, + 558 + ], + "type": "text", + "content": "76. Russell, B.C., Freeman, W.T., Efros, A.A., Sivic, J., Zisserman, A.: Using multiple segmentations to discover objects and their extent in image collections. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06). vol. 2, pp. 1605-1614. IEEE (2006) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 558, + 480, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 558, + 480, + 590 + ], + "spans": [ + { + "bbox": [ + 138, + 558, + 480, + 590 + ], + "type": "text", + "content": "77. Seitzer, M., Horn, M., Zadaianchuk, A., Zietlow, D., Xiao, T., Simon-Gabriel, C.J., He, T., Zhang, Z., Scholkopf, B., Brox, T., et al.: Bridging the gap to real-world object-centric learning. arXiv preprint arXiv:2209.14860 (2022) 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 590, + 480, + 612 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 590, + 480, + 612 + ], + "spans": [ + { + "bbox": [ + 138, + 590, + 480, + 612 + ], + "type": "text", + "content": "78. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence 22(8), 888-905 (2000) 2, 4, 6, 7, 12" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 612, + 480, + 644 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 612, + 480, + 644 + ], + "spans": [ + { + "bbox": [ + 138, + 612, + 480, + 644 + ], + "type": "text", + "content": "79. Shin, G., Albanie, S., Xie, W.: Unsupervised salient object detection with spectral cluster voting. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3971-3980 (2022) 4" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 644, + 480, + 665 + ], + "type": "text", + "content": "80. Shin, G., Xie, W., Albanie, S.: Reco: Retrieve and co-segment for zero-shot transfer. Advances in Neural Information Processing Systems (NeurIPS) (2022) 11" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "19" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 18 + }, + { + "para_blocks": [ + { + "bbox": [ + 137, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 137, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 137, + 116, + 481, + 149 + ], + "type": "text", + "content": "81. Shtedritski, A., Rupprecht, C., Vedaldi, A.: What does clip know about a red circle? visual prompt engineering for vlms. Proc. IEEE International Conference on Computer Vision (ICCV) (2023) 13" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 137, + 151, + 481, + 184 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 151, + 481, + 184 + ], + "spans": [ + { + "bbox": [ + 137, + 151, + 481, + 184 + ], + "type": "text", + "content": "82. Simeoni, O., Puy, G., Vo, H.V., Roburin, S., Gidaris, S., Bursuc, A., Pérez, P., Marlet, R., Ponce, J.: Localizing objects with self-supervised transformers and no labels. In: Proc. British Machine Vision Conference (BMVC) (2021) 2, 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 137, + 185, + 481, + 228 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 185, + 481, + 228 + ], + "spans": [ + { + "bbox": [ + 137, + 185, + 481, + 228 + ], + "type": "text", + "content": "83. Simeoni, O., Sekkat, C., Puy, G., Vobecky, A., Zablocki, E., Pérez, P.: Unsupervised object localization: Observing the background to discover objects. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3176-3186 (2023) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 229, + 481, + 261 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 229, + 481, + 261 + ], + "spans": [ + { + "bbox": [ + 137, + 229, + 481, + 261 + ], + "type": "text", + "content": "84. Simeoni, O., Zablocki, E., Gidaris, S., Puy, G., Pérez, P.: Unsupervised object localization in the era of self-supervised vits: A survey. arXiv preprint arXiv:2310.12904 (2023) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 137, + 262, + 481, + 296 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 262, + 481, + 296 + ], + "spans": [ + { + "bbox": [ + 137, + 262, + 481, + 296 + ], + "type": "text", + "content": "85. Singh, S., Deshmukh, S., Sarkar, M., Krishnamurthy, B.: Locate: Self-supervised object discovery via flow-guided graph-cut and bootstrapped self-training. Proc. British Machine Vision Conference (BMVC) (2023) 4, 7" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 137, + 297, + 481, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 297, + 481, + 329 + ], + "spans": [ + { + "bbox": [ + 137, + 297, + 481, + 329 + ], + "type": "text", + "content": "86. Sivic, J., Russell, B.C., Efros, A.A., Zisserman, A., Freeman, W.T.: Discovering objects and their location in images. In: Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1. vol. 1, pp. 370-377. IEEE (2005) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 137, + 330, + 481, + 352 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 330, + 481, + 352 + ], + "spans": [ + { + "bbox": [ + 137, + 330, + 481, + 352 + ], + "type": "text", + "content": "87. Snell, J., Swersky, K., Zemel, R.: Prototypical networks for few-shot learning. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 8" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 137, + 353, + 481, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 353, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 137, + 353, + 481, + 373 + ], + "type": "text", + "content": "88. Thoma, M.: A survey of semantic segmentation. arXiv preprint arXiv:1602.06541 (2016) 2" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 137, + 375, + 481, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 375, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 137, + 375, + 481, + 407 + ], + "type": "text", + "content": "89. Thomee, B., Shamma, D.A., Friedland, G., Elizalde, B., Ni, K., Poland, D., Borth, D., Li, L.J.: Yfcc100m: The new data in multimedia research. Communications of the ACM 59(2), 64-73 (2016) 3, 11" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 137, + 409, + 481, + 441 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 409, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 137, + 409, + 481, + 441 + ], + "type": "text", + "content": "90. Tian, C., Wang, W., Zhu, X., Dai, J., Qiao, Y.: Vl-ltr: Learning class-wise visual-linguistic representation for long-tailed visual recognition. In: European Conference on Computer Vision. Springer (2022) 5" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 137, + 442, + 481, + 474 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 442, + 481, + 474 + ], + "spans": [ + { + "bbox": [ + 137, + 442, + 481, + 474 + ], + "type": "text", + "content": "91. Tuytelaars, T., Lampert, C.H., Blaschko, M.B., Buntine, W.: Unsupervised object discovery: A comparison. International Journal of Computer Vision (IJCV) (2010) 3" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 137, + 475, + 481, + 508 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 475, + 481, + 508 + ], + "spans": [ + { + "bbox": [ + 137, + 475, + 481, + 508 + ], + "type": "text", + "content": "92. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems (NeurIPS) (2017) 4" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 137, + 509, + 481, + 553 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 509, + 481, + 553 + ], + "spans": [ + { + "bbox": [ + 137, + 509, + 481, + 553 + ], + "type": "text", + "content": "93. Vo, H.V., Bach, F., Cho, M., Han, K., LeCun, Y., Pérez, P., Ponce, J.: Unsupervised image matching and object discovery as optimization. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8287-8296 (2019) 2, 4" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 137, + 554, + 481, + 597 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 554, + 481, + 597 + ], + "spans": [ + { + "bbox": [ + 137, + 554, + 481, + 597 + ], + "type": "text", + "content": "94. Vo, H.V., Pérez, P., Ponce, J.: Toward unsupervised, multi-object discovery in large-scale image collections. In: Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XXIII 16. pp. 779-795. Springer (2020) 2, 4" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 137, + 599, + 481, + 630 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 599, + 481, + 630 + ], + "spans": [ + { + "bbox": [ + 137, + 599, + 481, + 630 + ], + "type": "text", + "content": "95. Wang, F., Mei, J., Yuille, A.: Sclip: Rethinking self-attention for dense vision-language inference. arXiv preprint arXiv:2312.01597 (2023) 1, 2, 3, 5, 8, 9, 10, 11" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 137, + 632, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 137, + 632, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 137, + 632, + 481, + 665 + ], + "type": "text", + "content": "96. Wang, J., Li, X., Zhang, J., Xu, Q., Zhou, Q., Yu, Q., Sheng, L., Xu, D.: Diffusion model is secretly a training-free open vocabulary semantic segmenter. arXiv preprint arXiv:2309.02773 (2023) 5, 11, 13" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "20" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 19 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 136, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 136, + 116, + 480, + 149 + ], + "type": "text", + "content": "97. Wang, K., Liew, J.H., Zou, Y., Zhou, D., Feng, J.: Panet: Few-shot image semantic segmentation with prototype alignment. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 8" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 138, + 150, + 480, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 150, + 480, + 194 + ], + "spans": [ + { + "bbox": [ + 138, + 150, + 480, + 194 + ], + "type": "text", + "content": "98. Wang, X., Yu, Z., De Mello, S., Kautz, J., Anandkumar, A., Shen, C., Alvarez, J.M.: Freesolo: Learning to segment objects without annotations. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14176-14186 (2022) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 138, + 194, + 480, + 236 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 194, + 480, + 236 + ], + "spans": [ + { + "bbox": [ + 138, + 194, + 480, + 236 + ], + "type": "text", + "content": "99. Wang, X., Girdhar, R., Yu, S.X., Misra, I.: Cut and learn for unsupervised object detection and instance segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 3124-3134 (2023) 2, 4, 7, 12" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 237, + 480, + 281 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 237, + 480, + 281 + ], + "spans": [ + { + "bbox": [ + 133, + 237, + 480, + 281 + ], + "type": "text", + "content": "100. Wang, Y., Shen, X., Hu, S.X., Yuan, Y., Crowley, J.L., Vaufreydaz, D.: Self-supervised transformers for unsupervised object discovery using normalized cut. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14543-14553 (2022) 2, 4, 7" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 282, + 480, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 282, + 480, + 315 + ], + "spans": [ + { + "bbox": [ + 133, + 282, + 480, + 315 + ], + "type": "text", + "content": "101. Wang, Z., Lu, Y., Li, Q., Tao, X., Guo, Y., Gong, M., Liu, T.: Cris: Clip-driven referring image segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 11686-11695 (2022) 5" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 133, + 316, + 480, + 346 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 316, + 480, + 346 + ], + "spans": [ + { + "bbox": [ + 133, + 316, + 480, + 346 + ], + "type": "text", + "content": "102. Weber, M., Welling, M., Perona, P.: Towards automatic discovery of object categories. In: Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No. PR00662). vol. 2, pp. 101-108. IEEE (2000) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 347, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 347, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 133, + 347, + 480, + 391 + ], + "type": "text", + "content": "103. Wei, Y., Cao, Y., Zhang, Z., Peng, H., Yao, Z., Xie, Z., Hu, H., Guo, B.: iclip: Bridging image classification and contrastive language-image pre-training for visual recognition. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 133, + 392, + 480, + 424 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 392, + 480, + 424 + ], + "spans": [ + { + "bbox": [ + 133, + 392, + 480, + 424 + ], + "type": "text", + "content": "104. Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE transactions on pattern analysis and machine intelligence 15(11), 1101-1113 (1993) 2, 6" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 425, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 425, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 133, + 425, + 480, + 456 + ], + "type": "text", + "content": "105. Wu, Z., Xiong, Y., Yu, S.X., Lin, D.: Unsupervised feature learning via nonparametric instance discrimination. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018) 4" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 457, + 480, + 489 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 457, + 480, + 489 + ], + "spans": [ + { + "bbox": [ + 133, + 457, + 480, + 489 + ], + "type": "text", + "content": "106. Wysoczanska, M., Siméoni, O., Ramamonjisoa, M., Bursuc, A., Trzciński, T., Pérez, P.: Clip-dinoiser: Teaching clip a few dino tricks. arXiv preprint arXiv:2312.12359 (2023) 5" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 490, + 480, + 533 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 490, + 480, + 533 + ], + "spans": [ + { + "bbox": [ + 133, + 490, + 480, + 533 + ], + "type": "text", + "content": "107. Xian, Y., Choudhury, S., He, Y., Schiele, B., Akata, Z.: Semantic projection network for zero-and few-label semantic segmentation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 8256-8265 (2019) 2" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 534, + 480, + 566 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 534, + 480, + 566 + ], + "spans": [ + { + "bbox": [ + 133, + 534, + 480, + 566 + ], + "type": "text", + "content": "108. Xu, J., De Mello, S., Liu, S., Byeon, W., Breuel, T., Kautz, J., Wang, X.: Groupvit: Semantic segmentation emerges from text supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 2, 3, 5, 9, 10, 11" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 567, + 480, + 600 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 567, + 480, + 600 + ], + "spans": [ + { + "bbox": [ + 133, + 567, + 480, + 600 + ], + "type": "text", + "content": "109. Xu, J., Liu, S., Vahdat, A., Byeon, W., Wang, X., De Mello, S.: Open-vocabulary panoptic segmentation with text-to-image diffusion models. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 5" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 601, + 480, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 601, + 480, + 643 + ], + "spans": [ + { + "bbox": [ + 133, + 601, + 480, + 643 + ], + "type": "text", + "content": "110. Xu, J., Hou, J., Zhang, Y., Feng, R., Wang, Y., Qiao, Y., Xie, W.: Learning open-vocabulary semantic segmentation models from natural language supervision. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2023) 3, 5, 10, 11" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 644, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 644, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 644, + 480, + 665 + ], + "type": "text", + "content": "111. Xu, M., Zhang, Z., Wei, F., Lin, Y., Cao, Y., Hu, H., Bai, X.: A simple baseline for open-vocabulary semantic segmentation with pre-trained vision-language model." + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 351, + 91, + 447, + 102 + ], + "type": "text", + "content": "Lazy Visual Grounding" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 479, + 100 + ], + "type": "text", + "content": "21" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 20 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 490 + ], + "type": "list", + "angle": 0, + "index": 14, + "blocks": [ + { + "bbox": [ + 153, + 116, + 480, + 137 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 153, + 116, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 153, + 116, + 480, + 137 + ], + "type": "text", + "content": "In: Proc. European Conference on Computer Vision (ECCV). Springer (2022) 5, 13" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 139, + 480, + 171 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 139, + 480, + 171 + ], + "spans": [ + { + "bbox": [ + 133, + 139, + 480, + 171 + ], + "type": "text", + "content": "112. Yin, Z., Wang, P., Wang, F., Xu, X., Zhang, H., Li, H., Jin, R.: Transfgu: a top-down approach to fine-grained unsupervised semantic segmentation. In: Proc. European Conference on Computer Vision (ECCV) (2022) 4" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 172, + 480, + 204 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 172, + 480, + 204 + ], + "spans": [ + { + "bbox": [ + 133, + 172, + 480, + 204 + ], + "type": "text", + "content": "113. Yu, J., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., Wu, Y.: Coca: Contrastive captioners are image-text foundation models. arXiv preprint arXiv:2205.01917 (2022) 4" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 205, + 480, + 237 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 205, + 480, + 237 + ], + "spans": [ + { + "bbox": [ + 134, + 205, + 480, + 237 + ], + "type": "text", + "content": "114. Yuan, L., Chen, D., Chen, Y.L., Codella, N., Dai, X., Gao, J., Hu, H., Huang, X., Li, B., Li, C., et al.: Florence: A new foundation model for computer vision. arXiv preprint arXiv:2111.11432 (2021) 4" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 134, + 237, + 480, + 270 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 237, + 480, + 270 + ], + "spans": [ + { + "bbox": [ + 134, + 237, + 480, + 270 + ], + "type": "text", + "content": "115. Zadaianchuk, A., Kleindessner, M., Zhu, Y., Locatello, F., Brox, T.: Unsupervised semantic segmentation with self-supervised object-centric representations. Proc. International Conference on Learning Representations (ICLR) (2023) 4" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 134, + 270, + 480, + 303 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 270, + 480, + 303 + ], + "spans": [ + { + "bbox": [ + 134, + 270, + 480, + 303 + ], + "type": "text", + "content": "116. Zhai, X., Wang, X., Mustafa, B., Steiner, A., Keysers, D., Kolesnikov, A., Beyer, L.: Lit: Zero-shot transfer with locked-image text tuning. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 134, + 303, + 480, + 335 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 303, + 480, + 335 + ], + "spans": [ + { + "bbox": [ + 134, + 303, + 480, + 335 + ], + "type": "text", + "content": "117. Zhang, Q., Wu, Y.N., Zhu, S.C.: Mining and-or graphs for graph matching and object discovery. In: Proceedings of the IEEE International Conference on Computer Vision. pp. 55-63 (2015) 4" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 134, + 335, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 335, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 134, + 335, + 480, + 369 + ], + "type": "text", + "content": "118. Zhou, B., Zhao, H., Puig, X., Xiao, T., Fidler, S., Barriuso, A., Torralba, A.: Semantic understanding of scenes through the ade20k dataset. International Journal of Computer Vision (IJCV) (2019) 2, 9" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 134, + 369, + 480, + 391 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 369, + 480, + 391 + ], + "spans": [ + { + "bbox": [ + 134, + 369, + 480, + 391 + ], + "type": "text", + "content": "119. Zhou, C., Loy, C.C., Dai, B.: Extract free dense labels from clip. In: Proc. European Conference on Computer Vision (ECCV) (2022) 2, 3, 5, 11" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 134, + 391, + 480, + 423 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 391, + 480, + 423 + ], + "spans": [ + { + "bbox": [ + 134, + 391, + 480, + 423 + ], + "type": "text", + "content": "120. Zhu, J.Y., Wu, J., Xu, Y., Chang, E., Tu, Z.: Unsupervised object class discovery via saliency-guided multiple class learning. IEEE transactions on pattern analysis and machine intelligence 37(4), 862-875 (2014) 4" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 134, + 423, + 480, + 456 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 423, + 480, + 456 + ], + "spans": [ + { + "bbox": [ + 134, + 423, + 480, + 456 + ], + "type": "text", + "content": "121. Zhuang, C., Zhai, A.L., Yamins, D.: Local aggregation for unsupervised learning of visual embeddings. In: Proc. IEEE International Conference on Computer Vision (ICCV) (2019) 4" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 134, + 456, + 480, + 490 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 456, + 480, + 490 + ], + "spans": [ + { + "bbox": [ + 134, + 456, + 480, + 490 + ], + "type": "text", + "content": "122. Ziegler, A., Asano, Y.M.: Self-supervised learning of object parts for semantic segmentation. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2022) 4, 7" + } + ] + } + ], + "index": 13 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "22" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 227, + 102 + ], + "type": "text", + "content": "Kang and Cho" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 21 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_content_list.json b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..79c761ba84cdddbabbab536449fbd0e9381467e5 --- /dev/null +++ b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_content_list.json @@ -0,0 +1,1668 @@ +[ + { + "type": "text", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient Diffusion Transformer", + "text_level": 1, + "bbox": [ + 220, + 140, + 781, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Zhuoyi Yang $^{1,\\star}$ , Heyang Jiang $^{1}$ , Wenyi Hong $^{1}$ , Jiayan Teng $^{1}$ , Wendi Zheng $^{1}$ , Yuxiao Dong $^{1}$ , Ming Ding $^{2}$ , and Jie Tang $^{1,\\star\\star}$", + "bbox": [ + 281, + 218, + 717, + 258 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{1}$ Tsinghua University $^{2}$ Zhipu.AI", + "bbox": [ + 385, + 268, + 614, + 284 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/b58341a639221084995c7019aa52b18851bfe1e779ef1ece88dd9c57ee46b952.jpg", + "image_caption": [ + "Fig. 1: Selected ultra-high-resolution upsampling examples of Inf-DiT, based on SDXL, DALL-E 3, and real images." + ], + "image_footnote": [], + "bbox": [ + 217, + 324, + 785, + 589 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. Diffusion models have shown remarkable performance in image generation in recent years. However, due to a quadratic increase in memory during generating ultra-high-resolution images (e.g. $4096 \\times 4096$ ), the resolution of generated images is often limited to $1024 \\times 1024$ . In this work, we propose a unidirectional block attention mechanism that can adaptively adjust the memory overhead during the inference process and handle global dependencies. Building on this module, we adopt the DiT structure for upsampling and develop an infinite super-resolution model capable of upsampling images of various shapes and resolutions. Comprehensive experiments show that our model achieves SOTA performance in generating ultra-high-resolution images in both machine and", + "bbox": [ + 259, + 648, + 743, + 801 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Done as intern at Zhipu AI, yangzy22@mails.tsinghua.edu.cn", + "bbox": [ + 215, + 811, + 661, + 825 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "\\*\\* Corresponding author jietang@tsinghua.edu.cn", + "bbox": [ + 215, + 825, + 563, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "human evaluation. Compared to commonly used UNet structures, our model can save more than $5 \\times$ memory when generating $4096 \\times 4096$ images. The project URL is https://github.com/THUDM/Inf-DiT.", + "bbox": [ + 259, + 147, + 743, + 191 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Keywords: diffusion model $\\cdot$ ultra-high-resolution generation $\\cdot$ super-resolution", + "bbox": [ + 259, + 203, + 743, + 231 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 260, + 375, + 276 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Recent years have witnessed rapid advancements in diffusion models, which significantly propelling the field of image generation and editing forward. Despite the advancements, a critical limitation persists: the resolution of images produced by existing image diffusion models is generally confined to $1024 \\times 1024$ pixels or lower, posing a significant challenge for generating ultra-high-resolution images, which are indispensable in various real-world applications including intricate design projects, advertising, and the creation of posters and wallpapers, etc.", + "bbox": [ + 212, + 294, + 545, + 491 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A commonly used approach for generating high resolution is cascaded generation [12], which first produces a low-resolution image, then applies multiple upsampling models to increase the image's resolution step by step. This approach breaks down the generation of high-resolution images into multiple tasks.", + "bbox": [ + 212, + 492, + 545, + 597 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Based on the results generated in the previous stage, the models in the later stages only need to perform local generation. Building upon the cascaded structure, both DALL-E2 [21] and Imagen [23] can effectively generate images with 1024 resolution.", + "bbox": [ + 212, + 597, + 787, + 657 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The biggest challenge for upsampling to much higher resolution images is the significant GPU memory demands. For example, if utilizing the widely-adopted U-Net architecture such as SDXL [18] for image inference (see Figure 2), we observe a dramatic escalation in memory consumption with increasing resolution. Specifically, generating a $4096 \\times 4096$ resolution image, which comprises over 16 million pixels requires more than 80GB of memory, exceeding the capacities of standard RTX 4090 or A100 graphics cards. Furthermore, the process of training models for high-resolution image generation exacerbates these demands, as it necessitates additional memory for storing gradients, optimizer states, etc. LDM [21] reduces the memory consumption by utilizing Variational Autoencoder(VAE) to compress images and generating images in a smaller latent space. However, it is also emphasized that an excessively high compression ratio can", + "bbox": [ + 212, + 657, + 789, + 840 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/c0509925ec2f889469d5f205d56ca6f9c0fc87d8f19b4e83f5ed2b15fce2fcad.jpg", + "image_caption": [ + "Fig. 2: Comparison of memory usage during inference at different resolutions between our model and the SDXL architecture." + ], + "image_footnote": [], + "bbox": [ + 558, + 338, + 767, + 500 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 346, + 128 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "substantially deteriorate the quality of generation, imposing severe limitations on the reduction of memory consumption.", + "bbox": [ + 212, + 146, + 782, + 176 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We observe that one common and critical problem among the aforementioned models is the necessity to input the entire image to the model, which requires keeping $O(N^2)$ hidden states in memory, where $N$ is the width (height) of the image. Based on this observation, we propose a Unidirectional Block Attention (UniBA) algorithm that can dramatically reduce the space complexity of generation from $O(N^2)$ to $O(N)$ , increasing the highest available resolution for a large margin (Fig. ②). Specifically, in every diffusion step, we split the image into blocks and perform a sequential batch generation order among them, where each batch simultaneously produces a subset of the blocks, and any amount of blocks can be generated in parallel as long as the memory restriction allows. It is worth noting that, though the model only inputs part of image into the model at the same time, UniBA successfully preserves the ability to interact with hidden states of faraway blocks and maintain high-level semantic consistency. This is different from other block-based generation methods such as [2,14,29] that only interact with blocks in pixel space or compressed latent space.", + "bbox": [ + 212, + 176, + 787, + 402 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Based on this algorithm, we optimize diffusion transformer (DiT) and train a model named Inf-DiT, which is capable of upsampling images of varying resolution and shape. Furthermore, we design several techniques including providing global image embedding to enhance the global semantic consistency and offer zero-shot text control ability, and provision of all neighboring low-resolution(LR) blocks through cross-attention mechanisms to further enhance the local consistency. Evaluation results show that Inf-DiT achieved significantly superior results compared to other high-resolution generative models in both machine and human evaluation.", + "bbox": [ + 212, + 402, + 787, + 537 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To summarize, our main contributions are as follows:", + "bbox": [ + 238, + 539, + 624, + 553 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "1. We propose Unidirectional Block Attention (UniBA) algorithm, which reduces the minimum memory consumption from $O(N^2)$ to $O(N)$ during inference, where $N$ represents the edge length. This mechanism is also capable of adapting to various memory restrictions by adjusting the number of blocks generated in parallel, trading off between memory and time overhead.", + "2. Based on these methods, we train an image upsampling diffusion model, Inf-DiT, a 700M model capable of upsampling images of varying resolutions and shapes. Inf-DiT achieves state-of-the-art performance in both machine (HPDv2 and DIV2K datasets) and human evaluation.", + "3. We design multiple techniques to further enhance local and global consistency, and offer a zero-shot ability for flexible text control." + ], + "bbox": [ + 220, + 563, + 785, + 729 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 Methodology", + "text_level": 1, + "bbox": [ + 215, + 752, + 380, + 771 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 Unidirectional Block Attention (UniBA)", + "text_level": 1, + "bbox": [ + 214, + 784, + 594, + 800 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We observe that the critical obstacle for generating ultra-high resolution images is memory limitation. As the resolution of the image increases, the corresponding", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 253, + 113, + 732, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/ed01a9034763f6c5c49e227eabdc43edbf244491e811b04ed9f7199832d1fb48.jpg", + "image_caption": [ + "Fig. 3: Left: Unidirectional block attention. In our implementation, each block directly depends on the three blocks in each layer: the blocks in the upper left corner, on the left, and on the top. Right: The inference process of Inf-DiT. Inf-DiT generates $n \\times n$ block each time, based on the memory size. During this process, only the KV-cache of the blocks that subsequent blocks depend on are stored in memory." + ], + "image_footnote": [], + "bbox": [ + 233, + 141, + 460, + 276 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/094d53558cea53806d215b695134efd39dbe2bd76c6609ccb734a39cb2279432.jpg", + "image_caption": [ + "Parallel Size: $\\mathrm{n} = 2$" + ], + "image_footnote": [], + "bbox": [ + 508, + 143, + 674, + 276 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/40de5338aca2ed4e2d8d67bcf10d2a5ce2595fd9e8603c4fb06a1c580fea95d9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 687, + 148, + 767, + 224 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "hidden state's size within the network expands quadratically. For example, a single hidden state with the shape of $2048 \\times 2048 \\times 1280$ in only one layer requires 20GB of memory, making it formidable to generate very large images. How to avoid storing the entire image's hidden state in memory becomes the key issue.", + "bbox": [ + 212, + 390, + 787, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Our main idea is to divide an image $\\pmb{x} \\in \\mathbb{R}^{H \\times W \\times C}$ into blocks $\\pmb{x}_b \\in \\mathbb{R}^{h \\times w \\times B^2 \\times C}$ , where $B$ is block size and $h = \\frac{H}{B}, w = \\frac{W}{B}$ . When the image is fed into the network, the channel size and resolution of a block may change, but the layout and the relative positional relationships between blocks will remain unchanged. If there is a way to apply sequential batch generation of blocks where each batch simultaneously produces a subset of the blocks, only a small number of block hidden states have to be kept in memory simultaneously, making it possible to generate ultra-high-resolution images.", + "bbox": [ + 212, + 467, + 795, + 590 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Here we define that $\\mathrm{block}_{\\mathrm{A}}$ is dependent on $\\mathrm{block}_{\\mathrm{B}}$ if the generation of $\\mathrm{block}_{\\mathrm{A}}$ involves the hidden state of $\\mathrm{block}_{\\mathrm{B}}$ in computation. It can be observed that the dependencies between blocks are bidirectional in most previous structures (UNet, DiT, etc.), in which case all blocks in the image must be generated simultaneously. Take UNet as an example: two adjacent elements in neighboring blocks use each other's hidden state in the convolution operation, therefore all pairs of neighboring blocks must be generated simultaneously. Given the aim to save the memory of blocks' hidden states, we hope to devise an algorithm that allows the blocks in the same image to be divided into several batches for generation, with each batch only needing to generate a portion of the blocks at the same time, and the batches are generated in sequence. Generally, an image generation algorithm can perform such a sequential batch generation among blocks if it meets the following conditions:", + "bbox": [ + 212, + 592, + 789, + 789 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "1. The generative dependency between blocks are unidirectional, and can form a directed acyclic graph (DAG).", + "bbox": [ + 222, + 809, + 787, + 840 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 346, + 128 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2. Each block has only a few direct (1st-order) dependencies on other blocks, since the hidden states of the block and its direct dependencies should simultaneously be kept in the memory.", + "bbox": [ + 220, + 146, + 787, + 191 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Furthermore, to ensure consistency across the whole image, it also required that the blocks have a large enough receptive field to manage long-range dependencies.", + "bbox": [ + 215, + 203, + 785, + 233 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "According to the conditions and analysis above, we choose an efficient implementation illustrated in Fig. 3. Unidirectional Block Attention(UniBA). For each layer, every block directly depends on three 1st-order neighboring blocks: the block on the top, on the left, and in the upper left corner. For example, if we adopt Diffusion Transformer (DiT) architecture which is the base architecture of Inf-DiT, the dependency between blocks is attention operation, where the query vectors of each block interact with the key, value vectors of 4 blocks: 3 blocks located to its upper left and itself, illustrated in Fig. 3.", + "bbox": [ + 212, + 234, + 787, + 354 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Formally, the UniBA process in the transformer can be formulated as", + "bbox": [ + 238, + 356, + 741, + 371 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\nQ = z _ {(i, j)} ^ {n} W ^ {Q}, \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 267, + 398, + 785, + 417 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {K} = \\left[ \\boldsymbol {z} _ {(i, j)} ^ {n} + \\boldsymbol {P} _ {1}; \\boldsymbol {z} _ {(i - 1, j)} ^ {n} + \\boldsymbol {P} _ {2}; \\boldsymbol {z} _ {(i, j - 1)} ^ {n} + \\boldsymbol {P} _ {3}; \\boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} + \\boldsymbol {P} _ {4} \\right] \\boldsymbol {W} ^ {K}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 264, + 421, + 785, + 440 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {V} = \\left[ \\boldsymbol {z} _ {(i, j)} ^ {n}; \\boldsymbol {z} _ {(i - 1, j)} ^ {n}; \\boldsymbol {z} _ {(i, j - 1)} ^ {n}; \\boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} \\right] \\boldsymbol {W} ^ {V}, \\tag {3}\n$$\n", + "text_format": "latex", + "bbox": [ + 267, + 443, + 784, + 462 + ], + "page_idx": 4 + }, + { + "type": "equation", + "text": "\n$$\n\\boldsymbol {z} _ {(i, j)} ^ {n + 1} = \\operatorname {F F N} (\\operatorname {A t t e n t i o n} (\\boldsymbol {Q}, \\boldsymbol {K}, \\boldsymbol {V})), \\tag {4}\n$$\n", + "text_format": "latex", + "bbox": [ + 246, + 464, + 785, + 484 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\mathbf{z}_{(i,j)}^n$ is the hidden states of the block at row $i$ , column $j$ in layer $n$ , and $P_i$ is the block-level relative position encoding. We also implement an efficient approach to apply UniBA for full image in pytorch style, which is attached in the Appendix [A].", + "bbox": [ + 215, + 494, + 785, + 556 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Note that, though each block only attends to a few number of neighboring blocks in each layer, as features propagate layer by layer, blocks can indirectly interact with faraway blocks, thereby capturing both long- and short-range relationships. Our design shares a similar spirit with the natural language model Transformer-XL [4], which can be viewed as a special form of ours in one dimension case.", + "bbox": [ + 212, + 556, + 787, + 646 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Inference process with O(N) Memory Consumption Although our method can generate each block sequentially, it differs from auto-regressive generative models, in which the next block depends on the final output of the previous block. Any number of blocks can also be generated in parallel in our model, as long as the union of their dependent blocks has been generated. Based on this property, we implement a simple but effective inference process. As illustrated in Fig. 3, we generate $n \\times n$ blocks at once, from the top-left to bottom-right. After generating a set of blocks, we discard hidden states i.e. KV-cache that are no longer used and append newly generated KV-cache to the memory.", + "bbox": [ + 212, + 672, + 789, + 808 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "It can be easily proved that the number of block KV-cache retained in memory during the process is always $\\leq w + n$ . Assume the space needed by the", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 251, + 113, + 732, + 130 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 114, + 785, + 127 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "model when generating a single block is $M_{1}$ , the space for one block's KV-cache is $M_{2}$ , and other essential space consumption (such as storing the raw input image) is $C$ , then the maximum space usage of the inference process is $n^{2}M_{1} + (w + n)M_{2} + C$ . When $n$ is much smaller than $w$ , the memory consumption is directly proportional to $w$ . If $w$ is bigger than $h$ , we can easily change the trajectory of generation to column-major.", + "bbox": [ + 212, + 146, + 787, + 236 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In practical terms, despite the total FLOPs of generation remaining constant for various values of $n$ , due to the overhead such as operator initialization time and memory allocation time, the generation time decreases when $n$ increases. Therefore, it's optimal to choose the largest $n$ allowed by the memory limitation.", + "bbox": [ + 212, + 237, + 787, + 299 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "2.2 Basic Model Architecture", + "text_level": 1, + "bbox": [ + 215, + 321, + 475, + 335 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/a8281b6a4f2c616be054ef390f8767278784c29a08229d431d5c38bd0948277b.jpg", + "image_caption": [ + "Fig. 4: (Left) Overall architecture of Inf-DiT. (Right) The inner structure of Inf-DiT block. We do not depict the Layernorm that originally existed in the DiT for simplicity." + ], + "image_footnote": [], + "bbox": [ + 218, + 369, + 787, + 534 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 4 provides an overview of our model, Inf-DiT's architecture. The model uses a similar backbone as DiT [17], which applies Vision Transformer (ViT) [6] to diffusion models and proves its efficacy and scalability. In addition to its superior performance, compared to convolution-based architectures such as UNet [22], DiT solely utilizes attention as the mechanism of interaction among patches, which can conveniently implement unidirectional block attention. To adapt to unidirectional block attention and enhance the performance of upsampling, we make several modifications and optimizations detailed as follows.", + "bbox": [ + 212, + 604, + 787, + 727 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Model input Inf-DiT first partitions input images into multiple non-overlapping blocks, which are further divided into patches with a side length equal to the patch size. Unlike DiT, considering the compression loss such as color shifting and detail loss, the patchifying of Inf-DiT is conducted in RGB pixel space instead of latent space. In the case of super-resolution by $f$ times, Inf-DiT first upsamples the low-resolution RGB image condition by a factor of $f$ , then concatenates it", + "bbox": [ + 212, + 750, + 789, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 346, + 128 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "with the diffusion's noised input on the feature dimension before feeding it to the model.", + "bbox": [ + 212, + 146, + 782, + 175 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Position Encoding Unlike UNet-based diffusion models [21] that can perceive positional relationships through convolution operations, all operations including self-attention, FFN in transformers are permutation invariant functions. Therefore, transformer-based models require auxiliary input of explicit positional information. We refer to the design of Rotary Positional Encoding (RoPE) [28], which performs well in the long context generation, and adapt it into two-dimensional form for image generation. Specifically, we divide channels of hidden states in half, one for encoding the x-coordinate and the other for the y-coordinate, and apply RoPE in both halves. We create a sufficiently large rope positional encoding table to ensure it meets the requirements during generation. To ensure all parts of the positional encoding table can be seen by the model during training, we employ the Random Starting Point: For each training image, we randomly assign a position $(x,y)$ for the top-left corner of the image, instead of the default $(0,0)$ . In addition, considering the difference in interactions within the same block and between different blocks, we additionally introduce block-level relative position encoding $P_{1\\sim 4}$ , which assigns a distinct learnable embedding based on the relative position before attention.", + "bbox": [ + 212, + 195, + 787, + 454 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "2.3 Global and Local Consistency", + "text_level": 1, + "bbox": [ + 214, + 472, + 508, + 488 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Global Consistency with CLIP Image Embedding The global semantic information within low-resolution (LR) images, such as artistic style and object material, plays a crucial role during upsampling. However, compared to text-to-image generation models, the upsampling model has an additional task: understanding and analyzing the semantic information of LR images, which significantly increases the model's burden. This is particularly challenging when training without text data, as high-resolution images rarely have high-quality paired texts, making these aspects difficult for the model. We utilize the image encoder from pre-trained CLIP [19] to extract image embedding $I_{LR}$ from low-resolution images, which we refer to as Semantic Input. Since CLIP is trained on massive image-text pairs from the Internet, its image encoder can effectively extract global information. We add the global semantic embedding to the time embedding of the diffusion transformer and input it into each layer, enabling the model to learn directly from high-level semantic information.", + "bbox": [ + 212, + 494, + 787, + 705 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Another interesting advantage of global semantic embedding is that, using the aligned image-text latent space in CLIP, we can use text to guide the direction of generation, even if our model has not been trained on any image-text pairs. Given a positive prompt $C_{pos}$ and a negative prompt $C_{neg}$ , we can update our image embedding:", + "bbox": [ + 212, + 705, + 787, + 782 + ], + "page_idx": 6 + }, + { + "type": "equation", + "text": "\n$$\n\\tilde {\\boldsymbol {I}} _ {L R} = \\operatorname {n o r m} \\left(\\boldsymbol {I} _ {L R} + \\alpha (\\text {T e x t E n c} \\left(C _ {p o s}\\right) - \\text {T e x t E n c} \\left(C _ {n e g}\\right))\\right), \\tag {5}\n$$\n", + "text_format": "latex", + "bbox": [ + 297, + 787, + 785, + 805 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where $\\alpha$ can control the intensity of the guidance. During inference, we can simply use $\\tilde{I}_{LR}$ in place of $I_{LR}$ as the global semantic embedding to conduct", + "bbox": [ + 212, + 809, + 785, + 839 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 253, + 113, + 732, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 114, + 785, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "the control. For example, to get a more clear result set, $C_{pos} =$ \"clear\" and $C_{neg} =$ \"blur\" sometimes help.", + "bbox": [ + 215, + 146, + 787, + 178 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Local Consistency with Nearby LR Cross Attention Although concatenating the LR image with noised input already provides a good inductive bias for models to learn the local correspondence between LR and HR images, there can still be continuity issues. The reason is that, there are several possibilities of upsampling for a given LR block, which require analysis in conjunction with several nearby LR blocks to select one solution, but the LR block to the right and below is unseen. To handle this problem, we introduce Nearby LR Cross Attention. In the first layer of the transformer, each block conducts cross-attention on the surrounding $3 \\times 3$ LR blocks to capture nearby LR information. This approach significantly reduces the probability of generating discontinuous images. It is worth noting that this operation will not change our inference process since the entire LR image is known before generation.", + "bbox": [ + 212, + 199, + 787, + 380 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We further devise techniques including continuity class-free guidance, LR-based noise initialization, QK Normalization, etc., which are elaborated in detail in the Appendix A.", + "bbox": [ + 212, + 380, + 787, + 428 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3 Experiments", + "text_level": 1, + "bbox": [ + 215, + 450, + 375, + 467 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this section, we first introduce the detailed training process of Inf-DiT, then comprehensively evaluate Inf-DiT by both machine and human evaluation. The results show that Inf-DiT surpasses all baselines, excelling in both ultra-high-resolution image generation and upsampling tasks. Finally, we conduct ablation studies to validate the effectiveness of our design.", + "bbox": [ + 212, + 481, + 787, + 558 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.1 Training Details", + "text_level": 1, + "bbox": [ + 215, + 580, + 397, + 595 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Datasets Our dataset comprises a subset of LAION-5B [25] with a resolution higher than $1024 \\times 1024$ and aesthetic score higher than 5, and 100 thousand high-resolution wallpapers from the Internet. Following the previous works [20,23,30], we use fixed-size image crops of $512 \\times 512$ resolution during training. Since upsampling can be conducted with local information only, it can be directly employed at higher resolution during inference, which is not easy for most generation models. The data processing details are illustrated in Appendix A.2", + "bbox": [ + 212, + 604, + 787, + 713 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Training settings During training, We set block size $= 128$ and patch size $= 4$ , which means every training image is divided into $4 \\times 4$ blocks and every block has $32 \\times 32$ patches. We employ the framework of EDM [15] for training, and set the upsampling factor to $4 \\times$ . Because the upsampling task is more concerned with the high-frequency details of images, we adjusted the mean and std of training noise distribution to $-1.0$ and $1.4$ . To address overflow problem during training, we employed BF16 format due to its broader numerical range. Our", + "bbox": [ + 212, + 734, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 346, + 128 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "CLIP model is a ViT-L/16 pre-trained on Datacomp dataset [13]. Since the CLIP can only process images with $224 \\times 224$ resolution, we first resize LR images to $224 \\times 224$ and then input them to CLIP. Other hyperparameters are listed in the Appendix A.", + "bbox": [ + 212, + 145, + 787, + 209 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/451031df1a544b67af8de388f0cbc6263d4aaeb6c478cb56a9cd24f77d4162d3.jpg", + "image_caption": [ + "Direct Patch Scalecrafter BSRGAN Demofusion Inf-DiT", + "Fig. 5: Qualitative comparison of different methods in detail at $2048 \\times 2048$ resolution" + ], + "image_footnote": [], + "bbox": [ + 261, + 233, + 743, + 486 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.2 Machine Evaluation", + "text_level": 1, + "bbox": [ + 215, + 568, + 426, + 583 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this part, we conduct quantitative comparisons of Inf-DiT against state-of-the-art methodologies on ultra-high-resolution image generation tasks. The baselines encompass two main categories of high-resolution generation: 1. Direct", + "bbox": [ + 212, + 595, + 787, + 643 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/d11798ffcbc9e5ae533434529c6247af647691f4b709c2274af4faf526b1c24e.jpg", + "table_caption": [ + "Table 1: Quantitative comparison results with state-of-the-art methods of super resolution on DIV2K dataset. The best results are marked in bold." + ], + "table_footnote": [], + "table_body": "
SettingMethodFID ↓FIDcrop ↓PSNR ↑SSIM ↑
Variable resolutionBSRGAN35.0143.225.90.73
Real-ESRGAN35.5127.625.20.72
Inf-DiT(Ours)20.276.526.30.74
Fix resolution (512x512)StableSR74.8112.622.00.60
Inf-DiT(Ours)38.683.324.60.67
Fix resolution (256x256)LDM152.6-23.90.66
Inf-DiT(Ours)86.8-24.60.67
", + "bbox": [ + 220, + 709, + 787, + 837 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 253, + 114, + 732, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/35dd8180f8fb13cf861a890ec221cbbf52dff5644ae4c39b63995f3d53d81aa0.jpg", + "image_caption": [ + "Fig. 6: Qualitative comparison of different methods in detail at $4096 \\times 4096$ resolution" + ], + "image_footnote": [], + "bbox": [ + 272, + 143, + 730, + 443 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "high-resolution image generation, including Direct Inference of SDXL [18], MultiDiffusion [2], ScaleCrafter [9], and 2. High-resolution image generation based on super-resolution techniques, including BSRGAN [33], DemoFusion [7]. We employ the FID (Fréchet Inception Distance) [10] to evaluate the quality of ultra-high-resolution generation, which is widely used to evaluate the perceptual quality of images in image generation tasks [17,21,23]. To further validate the super-resolution ability of our model, we additionally benchmark it against renowned super-resolution models over classic super-resolution tasks.", + "bbox": [ + 212, + 486, + 787, + 608 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ultra-High-Resolution Generation We use the test set of HPDv2 [31] for evaluation, which allows for a comprehensive evaluation of the model's generative capabilities (3200 prompts) across various domains and styles (\"Animation\", \"Concept-art\", \"Painting\", and \"Photo\"). We test on two resolutions: $2048^2$ and $4096^2$ . For super-resolution-based models, we first use SDXL to generate a $1024^2$ resolution image and upsample it without text. Although Inf-DiT was trained in a setting with $4 \\times$ upsample, we find that it can generalize well to upsampling ratios lower than training. Therefore, for $2048^2$ generation, we directly resize the LR image from $1024^2$ to $2048^2$ and concatenate it with the noise input. As for the metrics, we use FID to assess how closely generated images mimic real image distributions, and the real images are randomly sampled from LAION-5B. However, the original implementation of FID downsamples the input image to $299 \\times 299$ before the feature extraction, which ignores critical high-resolution details. Therefore, inspired by [37], we additionally adopted the idea of $\\mathrm{FID}_{\\mathrm{crop}}$", + "bbox": [ + 212, + 628, + 787, + 843 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 346, + 128 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/01d9780228acb034492f1e26eac59f21e8f30f49be9ce718e4c388d8f8e97ef0.jpg", + "table_caption": [ + "Table 2: Quantitative comparison results with state-of-the-art methods of ultra-high-resolution generation on HPDV2 dataset. The best results are marked in bold, and the second best results are marked by underline." + ], + "table_footnote": [], + "table_body": "
Method2048 × 20484096 × 4096Mean ↓
FID ↓FIDcrop ↓FID ↓FIDcrop ↓
Direct Inference92.292.3OOMOOM92.3
MultiDiffusion99.7109.3OOMOOM104.5
SDXL+BSRGAN66.381.766.085.074.8
ScaleCrafter79.995.5115.1153.3111.0
DemoFusion67.572.070.882.673.2
SDXL+Inf-DiT(Ours)66.071.967.076.270.3
", + "bbox": [ + 220, + 198, + 785, + 316 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "and randomly cropped $299 \\times 299$ patches from high-resolution images for FID evaluation.", + "bbox": [ + 212, + 349, + 784, + 378 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "The results in Tab. 2 demonstrate that our model achieves state-of-the-art (SOTA) in three out of four metrics. This showcases our model's exceptional ability to generate high-resolution details and harmonious global information. Note that our model is capable of being applied to all generative models. Examples from other models are listed in the Appendix D. We have also evaluated the model' time-space consumption in Appendix A.", + "bbox": [ + 212, + 378, + 785, + 470 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Super-Resolution In addition to its ability to generate high-resolution images, Inf-DiT can also be used as a classic super-resolution model. We conduct the evaluation on DIV2k valid dataset [1] which contains multiple real-world high-resolution images in different scenarios. Following [21, 24], we fix image degradation to bicubic interpolation with $4 \\times$ downsampling. Before comparing with fix-resolution models LDM [21] and StableSR [29], we center-crop specific-sized patches from the high-resolution image as ground truth. Throughout this process, we utilize both perceptual (FID, $\\mathrm{FID}_{\\mathrm{crop}}$ ) and fidelity (PSNR, SSIM) metrics to ensure a detailed and comprehensive assessment.", + "bbox": [ + 212, + 491, + 785, + 626 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "As demonstrated in Tab. [1], our model achieves state-of-the-art across all metrics. This shows that, as a super-resolution model, ours not only excels in performing super-resolution at arbitrary scales but also preserves global and detailed information while restoring results that closely resemble the LR images.", + "bbox": [ + 212, + 627, + 785, + 688 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "3.3 Human Evaluation", + "text_level": 1, + "bbox": [ + 214, + 709, + 416, + 724 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "To further evaluate Inf-DiT and more accurately reflect its generative quality from a human perspective, we conduct a human evaluation. The whole evaluation process is detailed in Appendix C. We ultimately collected 3,600 comparisons. As depicted in Fig. 7, our model outperforms the other 3 methods in all the 3 criteria. It is particularly noteworthy that each of the other three models ranks relatively lower on at least one of the three evaluation criteria, while Inf-DiT achieves the highest score on all three criteria: detail authenticity, global", + "bbox": [ + 212, + 733, + 787, + 840 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 253, + 113, + 732, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 114, + 784, + 126 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/47dcb02ae09065c79cf3226de5f5aa298643596eedb7618895e358bea4f1502c.jpg", + "image_caption": [ + "Fig. 7: Human evaluation results. After participants rank the images from different models, We assign scores from 4 to 1 to models in order and finally calculate the average of all the results. Inf-DiT gets the highest scores in all three categories." + ], + "image_footnote": [], + "bbox": [ + 218, + 145, + 782, + 289 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "coherence, and consistency with low-resolution input. This indicates that our model is the only one capable of excelling in both high-resolution generation and super-resolution tasks simultaneously.", + "bbox": [ + 212, + 362, + 787, + 407 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "3.4 Iterative Upsampling", + "text_level": 1, + "bbox": [ + 214, + 426, + 439, + 445 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Since our model can upsample images of arbitrary resolution, it's a natural idea to test if the model can iteratively upsample images generated by itself. In this study, we experiment on generating a $2048^{2}$ resolution image from a $32^{2}$ resolution image, $64 \\times$ upscale, through three times of iterative upsampling. Figure 8 illustrates two cases of this process. In the first case, the model successfully produces a high-resolution image after three stages of upsampling. It generates details of different frequencies in different resolution upsampling: the contour of the face, the shape of the eyeball, and individual eyelashes. However, it is hard for the model to correct inaccuracies generated in earlier stages, leading to the accumulation of errors. An example of this issue is demonstrated in the second sample. We leave this problem for our future work.", + "bbox": [ + 212, + 450, + 789, + 617 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/0109f20845e9bf70529cb0230b0b68cea25f129e8d24b5b611e3b1be35e050ff.jpg", + "table_caption": [ + "Table 3: Ablation study on ${2048} \\times {2048}$ resolution." + ], + "table_footnote": [], + "table_body": "
MethodFIDFIDcrop
Ours66.071.9
w/o Nearby LR Attention66.773.6
w/o Semantic Input66.272.8
Inner Block Attention66.383.7
", + "bbox": [ + 220, + 667, + 444, + 739 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/3fe090f95cf28181384483d4ce8d4730849184bf354742238547fd755c25e479.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Block Size3264128256512
Memory Usage (GB)23.323.323.323.523.7
FID276271268265246
Inference Time (s)576169112269
", + "bbox": [ + 462, + 669, + 782, + 739 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "3.5 Ablation Study", + "text_level": 1, + "bbox": [ + 215, + 786, + 390, + 801 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We conduct all ablation studies with $2048^{2}$ resolution on HPDV2 dataset, with results in Tab. 3. To verify our method, we separately 1. remove the Global", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 346, + 128 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Iterative Upsampling: Good Case", + "bbox": [ + 217, + 145, + 359, + 155 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/0c7f26ac8648a63ed5f60e074487f8d875633fbe04ce1456bd9c56a461488fd4.jpg", + "image_caption": [ + "Fig. 8: Generated samples of iterative upsampling. Top: Inf-DiT can upsample an image generated by itself several times, and generate details of different frequencies at corresponding resolution. Bottom: After failing to generate a pupil at the $128^{2}$ resolution, it is difficult for subsequent upsampling stages to correct this error." + ], + "image_footnote": [], + "bbox": [ + 217, + 155, + 787, + 361 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Input, 2. remove Nearby LR attention and 3. remove the attention between blocks (Inner Block Attention setting). As a result, both the FID and $\\mathrm{FID}_{\\mathrm{crop}}$ of the model get worse to varying degrees. We also conduct an ablation study to decide the optimal block size. The results show that as block size increases, the performance improves, but the time also increases. To trade-off, we chose 128 as the default setting. Further case studies and analysis are listed in the Appendix B.", + "bbox": [ + 212, + 457, + 787, + 563 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4 Related Work", + "text_level": 1, + "bbox": [ + 215, + 585, + 387, + 602 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "4.1 Diffusion Image Generation", + "text_level": 1, + "bbox": [ + 215, + 618, + 488, + 633 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Diffusion models have emerged as a spotlight in the realm of image generation, boasting an array of groundbreaking advancements in recent years. Initially introduced in 2015 [26], and further developed through works such as DDPM [11] and DDIM [27], these models leverage a stochastic diffusion process, conceptualized as a Markov chain, to convert a simple prior distribution, like Gaussian noise, into a complex data distribution. This methodology yield impressive outcomes in terms of the quality and diversity of generated images.", + "bbox": [ + 212, + 643, + 787, + 748 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Recent enhancements have markedly elevated the generation capabilities of diffusion models. CDM [12] creates a cascade generation pipeline with multistage super-resolution models, which can be applied to large pretrained models [20, 23].", + "bbox": [ + 212, + 750, + 787, + 795 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The introduction of Latent Diffusion Models (LDMs) [18,21] represents a pivotal extension, incorporating a latent space to boost both efficiency and scalability. Alongside these advancements, there has been significant progress in", + "bbox": [ + 212, + 795, + 787, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 253, + 114, + 732, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 114, + 785, + 126 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "the optimization of network architectures. The advent of Diffusion Transformers (DiT) [17] Replaces U-Net with ViT [6] for noise prediction.", + "bbox": [ + 215, + 146, + 787, + 180 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "4.2 Image Super-Resolution", + "text_level": 1, + "bbox": [ + 215, + 200, + 460, + 217 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Given a low-resolution (LR) image $I_{LR}$ degraded from high-resolution (HR) observation $I_{HR}$ , image super-resolution (SR) aims to reconstruct a HR one $\\hat{I}_{HR}$ : $I_{LR} = D(I_{HR};\\delta)$ , $\\hat{I}_{HR} = F(I_{LR};\\theta)$ . Here $D$ and $F$ refer to degradation process and the super-resolution model. $\\delta$ and $\\theta$ represent the parameters. In recent years, Blind SR has been a major focus, in which the degradation process is unknown and learnable. The representative methods are BSRGAN [33] and Real-ESRGAN [30]. Recently, diffusion-based SR methods have yielded exciting results. These works focus on finetuning pre-trained text-to-image diffusion models to take advantage of their excellent generative ability. Specifically, DiffBir [16] employs ControlNet [34] on pre-trained stable-diffusion models, whereas PASD [32] enhances it by executing pixel-aware cross-attention. Both approaches have garnered considerable success in fixed resolution super-resolution but cannot be directly used for higher resolution.", + "bbox": [ + 212, + 228, + 787, + 426 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "4.3 Ultra-High-Resolution Image Upsampler", + "text_level": 1, + "bbox": [ + 215, + 449, + 598, + 465 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Currently, image generation methods fall short in generating ultra-high-resolution images owing to the constraints of memory and issues with training efficiency. Under these circumstances, MultiDiffusion [2] and Mixture of Diffusers [14] bind together multiple diffusion generation processes by dividing images into overlapping blocks, processing each separately, and then stitching them together, aiming to maintain continuity between blocks. However, because they only used the local weighted averaging for aggregation, it leads to a low interaction efficiency and makes it difficult to ensure the global consistency of the images.", + "bbox": [ + 212, + 477, + 787, + 598 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Given this concern, DemoFusion [7] and ScaleCrafter [9] adapt dilated policies including dilated sampling and dilated convolution kernels, aiming at acquiring more global information. These methods indeed achieve improvement on a global semantic level without additional training. However, the huge difference between training and generation leads these methods to easily produce illogical images.", + "bbox": [ + 212, + 598, + 787, + 676 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 700, + 359, + 715 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this work, we observe that the major obstacle to generating ultra-high-resolution images is the substantial memory occupied by model hidden states. Based on this, We propose Unidirectional Block Attention mechanism (UniBA) which can lower the space complexity by performing batch generation among blocks. With UniBA, we train Inf-DiT, a $4\\times$ memory-efficient image upsampler which achieves state-of-the-art performance in both generation and superresolution tasks.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 344, + 128 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The authors would like to thank Zhipu.AI for their GPU and human evaluation support, and the reviewers of ECCV for their valuable suggestions.", + "bbox": [ + 215, + 176, + 784, + 205 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 217, + 229, + 321, + 244 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Agustsson, E., Timofte, R.: Ntire 2017 challenge on single image super-resolution: Dataset and study. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 126-135 (2017)", + "2. Bar-Tal, O., Yariv, L., Lipman, Y., Dekel, T.: Multidiffusion: Fusing diffusion paths for controlled image generation (2023)", + "3. Chai, L., Gharbi, M., Shechtman, E., Isola, P., Zhang, R.: Any-resolution training for high-resolution image synthesis. In: European Conference on Computer Vision. pp. 170-188. Springer (2022)", + "4. Dai, Z., Yang, Z., Yang, Y., Carbonell, J., Le, Q.V., Salakhutdinov, R.: Transformer-xl: Attentive language models beyond a fixed-length context. arXiv preprint arXiv:1901.02860 (2019)", + "5. Dehghani, M., Djolonga, J., Mustafa, B., Padlewski, P., Heek, J., Gilmer, J., Steiner, A.P., Caron, M., Geirhos, R., Alabdulmohsin, I., et al.: Scaling vision transformers to 22 billion parameters. In: International Conference on Machine Learning. pp. 7480-7512. PMLR (2023)", + "6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)", + " 7. Du, R., Chang, D., Hospedales, T., Song, Y.Z., Ma, Z.: Demofusion: Democratising high-resolution image generation with no $$$. arXiv preprint arXiv:2311.16973 (2023)", + "8. Guttenberg, N.: Diffusion with offset noise (2023), https://www.crosslabs.org/blog/diffusion-with-offset-noise", + "9. He, Y., Yang, S., Chen, H., Cun, X., Xia, M., Zhang, Y., Wang, X., He, R., Chen, Q., Shan, Y.: Scalecrafter: Tuning-free higher-resolution visual generation with diffusion models. In: The Twelfth International Conference on Learning Representations (2023)", + "0. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017)", + "1. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)", + "2. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022)", + "3. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below.", + "4. Jiménez, Á.B.: Mixture of diffusers for scene composition and high resolution image generation. arXiv preprint arXiv:2302.02412 (2023)" + ], + "bbox": [ + 225, + 258, + 785, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 253, + 114, + 732, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "15. Karras, T., Aittala, M., Aila, T., Laine, S.: Elucidating the design space of diffusion-based generative models. Advances in Neural Information Processing Systems 35, 26565-26577 (2022)", + "16. Lin, X., He, J., Chen, Z., Lyu, Z., Fei, B., Dai, B., Ouyang, W., Qiao, Y., Dong, C.: Diffbir: Towards blind image restoration with generative diffusion prior. arXiv preprint arXiv:2308.15070 (2023)", + "17. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023)", + "18. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)", + "19. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)", + "20. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)", + "21. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)", + "22. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)", + "23. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)", + "24. Sahara, C., Ho, J., Chan, W., Salimans, T., Fleet, D.J., Norouzi, M.: Image superresolution via iterative refinement. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(4), 4713-4726 (2022)", + "25. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5b: An open large-scale dataset for training next generation image-text models. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022), https://openreview.net/forum?id=M3Y74vmsMcY", + "26. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015)", + "27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)", + "28. Su, J., Ahmed, M., Lu, Y., Pan, S., Bo, W., Liu, Y.: Roformer: Enhanced transformer with rotary position embedding. Neurocomputing 568, 127063 (2024)", + "29. Wang, J., Yue, Z., Zhou, S., Chan, K.C., Loy, C.C.: Exploiting diffusion prior for real-world image super-resolution. arXiv preprint arXiv:2305.07015 (2023)", + "30. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind super-resolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "Yang et al.", + "bbox": [ + 271, + 114, + 346, + 128 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "31. Wu, X., Hao, Y., Sun, K., Chen, Y., Zhu, F., Zhao, R., Li, H.: Human preference score v2: A solid benchmark for evaluating human preferences of text-to-image synthesis. arXiv preprint arXiv:2306.09341 (2023)", + "32. Yang, T., Ren, P., Xie, X., Zhang, L.: Pixel-aware stable diffusion for realistic image super-resolution and personalized stylization. arXiv preprint arXiv:2308.14469 (2023)", + "33. Zhang, K., Liang, J., Van Gool, L., Timofte, R.: Designing a practical degradation model for deep blind image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4791-4800 (2021)", + "34. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023)" + ], + "bbox": [ + 215, + 146, + 787, + 314 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT", + "bbox": [ + 253, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 785, + 126 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_model.json b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_model.json new file mode 100644 index 0000000000000000000000000000000000000000..828b6c58a4690039f33d030ff05007aecfd5ad48 --- /dev/null +++ b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_model.json @@ -0,0 +1,2137 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.222, + 0.141, + 0.782, + 0.187 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient Diffusion Transformer" + }, + { + "type": "text", + "bbox": [ + 0.282, + 0.219, + 0.718, + 0.26 + ], + "angle": 0, + "content": "Zhuoyi Yang\\(^{1,\\star}\\), Heyang Jiang\\(^{1}\\), Wenyi Hong\\(^{1}\\), Jiayan Teng\\(^{1}\\), Wendi Zheng\\(^{1}\\), Yuxiao Dong\\(^{1}\\), Ming Ding\\(^{2}\\), and Jie Tang\\(^{1,\\star\\star}\\)" + }, + { + "type": "text", + "bbox": [ + 0.386, + 0.269, + 0.616, + 0.285 + ], + "angle": 0, + "content": "\\(^{1}\\) Tsinghua University \\(^{2}\\) Zhipu.AI" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.325, + 0.787, + 0.59 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.6, + 0.788, + 0.63 + ], + "angle": 0, + "content": "Fig. 1: Selected ultra-high-resolution upsampling examples of Inf-DiT, based on SDXL, DALL-E 3, and real images." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.649, + 0.744, + 0.803 + ], + "angle": 0, + "content": "Abstract. Diffusion models have shown remarkable performance in image generation in recent years. However, due to a quadratic increase in memory during generating ultra-high-resolution images (e.g. \\(4096 \\times 4096\\)), the resolution of generated images is often limited to \\(1024 \\times 1024\\). In this work, we propose a unidirectional block attention mechanism that can adaptively adjust the memory overhead during the inference process and handle global dependencies. Building on this module, we adopt the DiT structure for upsampling and develop an infinite super-resolution model capable of upsampling images of various shapes and resolutions. Comprehensive experiments show that our model achieves SOTA performance in generating ultra-high-resolution images in both machine and" + }, + { + "type": "page_footnote", + "bbox": [ + 0.216, + 0.812, + 0.663, + 0.826 + ], + "angle": 0, + "content": "* Done as intern at Zhipu AI, yangzy22@mails.tsinghua.edu.cn" + }, + { + "type": "page_footnote", + "bbox": [ + 0.216, + 0.827, + 0.565, + 0.84 + ], + "angle": 0, + "content": "\\*\\* Corresponding author jietang@tsinghua.edu.cn" + }, + { + "type": "list", + "bbox": [ + 0.216, + 0.812, + 0.663, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.148, + 0.744, + 0.193 + ], + "angle": 0, + "content": "human evaluation. Compared to commonly used UNet structures, our model can save more than \\(5 \\times\\) memory when generating \\(4096 \\times 4096\\) images. The project URL is https://github.com/THUDM/Inf-DiT." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.204, + 0.744, + 0.232 + ], + "angle": 0, + "content": "Keywords: diffusion model \\(\\cdot\\) ultra-high-resolution generation \\(\\cdot\\) super-resolution" + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.261, + 0.377, + 0.277 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.295, + 0.546, + 0.492 + ], + "angle": 0, + "content": "Recent years have witnessed rapid advancements in diffusion models, which significantly propelling the field of image generation and editing forward. Despite the advancements, a critical limitation persists: the resolution of images produced by existing image diffusion models is generally confined to \\(1024 \\times 1024\\) pixels or lower, posing a significant challenge for generating ultra-high-resolution images, which are indispensable in various real-world applications including intricate design projects, advertising, and the creation of posters and wallpapers, etc." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.493, + 0.546, + 0.598 + ], + "angle": 0, + "content": "A commonly used approach for generating high resolution is cascaded generation [12], which first produces a low-resolution image, then applies multiple upsampling models to increase the image's resolution step by step. This approach breaks down the generation of high-resolution images into multiple tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.598, + 0.788, + 0.658 + ], + "angle": 0, + "content": "Based on the results generated in the previous stage, the models in the later stages only need to perform local generation. Building upon the cascaded structure, both DALL-E2 [21] and Imagen [23] can effectively generate images with 1024 resolution." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.659, + 0.79, + 0.841 + ], + "angle": 0, + "content": "The biggest challenge for upsampling to much higher resolution images is the significant GPU memory demands. For example, if utilizing the widely-adopted U-Net architecture such as SDXL [18] for image inference (see Figure 2), we observe a dramatic escalation in memory consumption with increasing resolution. Specifically, generating a \\(4096 \\times 4096\\) resolution image, which comprises over 16 million pixels requires more than 80GB of memory, exceeding the capacities of standard RTX 4090 or A100 graphics cards. Furthermore, the process of training models for high-resolution image generation exacerbates these demands, as it necessitates additional memory for storing gradients, optimizer states, etc. LDM [21] reduces the memory consumption by utilizing Variational Autoencoder(VAE) to compress images and generating images in a smaller latent space. However, it is also emphasized that an excessively high compression ratio can" + }, + { + "type": "image", + "bbox": [ + 0.559, + 0.339, + 0.768, + 0.5 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.554, + 0.514, + 0.788, + 0.57 + ], + "angle": 0, + "content": "Fig. 2: Comparison of memory usage during inference at different resolutions between our model and the SDXL architecture." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.254, + 0.114, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.177 + ], + "angle": 0, + "content": "substantially deteriorate the quality of generation, imposing severe limitations on the reduction of memory consumption." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.178, + 0.788, + 0.403 + ], + "angle": 0, + "content": "We observe that one common and critical problem among the aforementioned models is the necessity to input the entire image to the model, which requires keeping \\( O(N^2) \\) hidden states in memory, where \\( N \\) is the width (height) of the image. Based on this observation, we propose a Unidirectional Block Attention (UniBA) algorithm that can dramatically reduce the space complexity of generation from \\( O(N^2) \\) to \\( O(N) \\), increasing the highest available resolution for a large margin (Fig. ②). Specifically, in every diffusion step, we split the image into blocks and perform a sequential batch generation order among them, where each batch simultaneously produces a subset of the blocks, and any amount of blocks can be generated in parallel as long as the memory restriction allows. It is worth noting that, though the model only inputs part of image into the model at the same time, UniBA successfully preserves the ability to interact with hidden states of faraway blocks and maintain high-level semantic consistency. This is different from other block-based generation methods such as [2,14,29] that only interact with blocks in pixel space or compressed latent space." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.404, + 0.788, + 0.538 + ], + "angle": 0, + "content": "Based on this algorithm, we optimize diffusion transformer (DiT) and train a model named Inf-DiT, which is capable of upsampling images of varying resolution and shape. Furthermore, we design several techniques including providing global image embedding to enhance the global semantic consistency and offer zero-shot text control ability, and provision of all neighboring low-resolution(LR) blocks through cross-attention mechanisms to further enhance the local consistency. Evaluation results show that Inf-DiT achieved significantly superior results compared to other high-resolution generative models in both machine and human evaluation." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.54, + 0.625, + 0.554 + ], + "angle": 0, + "content": "To summarize, our main contributions are as follows:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.564, + 0.787, + 0.639 + ], + "angle": 0, + "content": "1. We propose Unidirectional Block Attention (UniBA) algorithm, which reduces the minimum memory consumption from \\( O(N^2) \\) to \\( O(N) \\) during inference, where \\( N \\) represents the edge length. This mechanism is also capable of adapting to various memory restrictions by adjusting the number of blocks generated in parallel, trading off between memory and time overhead." + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.64, + 0.787, + 0.699 + ], + "angle": 0, + "content": "2. Based on these methods, we train an image upsampling diffusion model, Inf-DiT, a 700M model capable of upsampling images of varying resolutions and shapes. Inf-DiT achieves state-of-the-art performance in both machine (HPDv2 and DIV2K datasets) and human evaluation." + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.7, + 0.787, + 0.73 + ], + "angle": 0, + "content": "3. We design multiple techniques to further enhance local and global consistency, and offer a zero-shot ability for flexible text control." + }, + { + "type": "list", + "bbox": [ + 0.222, + 0.564, + 0.787, + 0.73 + ], + "angle": 0, + "content": null + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.753, + 0.381, + 0.772 + ], + "angle": 0, + "content": "2 Methodology" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.785, + 0.596, + 0.801 + ], + "angle": 0, + "content": "2.1 Unidirectional Block Attention (UniBA)" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "We observe that the critical obstacle for generating ultra-high resolution images is memory limitation. As the resolution of the image increases, the corresponding" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.235, + 0.142, + 0.462, + 0.277 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.509, + 0.144, + 0.676, + 0.277 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.688, + 0.149, + 0.768, + 0.226 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.688, + 0.251, + 0.76, + 0.261 + ], + "angle": 0, + "content": "Parallel Size: \\( \\mathrm{n} = 2 \\)" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.286, + 0.789, + 0.357 + ], + "angle": 0, + "content": "Fig. 3: Left: Unidirectional block attention. In our implementation, each block directly depends on the three blocks in each layer: the blocks in the upper left corner, on the left, and on the top. Right: The inference process of Inf-DiT. Inf-DiT generates \\( n \\times n \\) block each time, based on the memory size. During this process, only the KV-cache of the blocks that subsequent blocks depend on are stored in memory." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.391, + 0.789, + 0.466 + ], + "angle": 0, + "content": "hidden state's size within the network expands quadratically. For example, a single hidden state with the shape of \\(2048 \\times 2048 \\times 1280\\) in only one layer requires 20GB of memory, making it formidable to generate very large images. How to avoid storing the entire image's hidden state in memory becomes the key issue." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.468, + 0.797, + 0.592 + ], + "angle": 0, + "content": "Our main idea is to divide an image \\( \\pmb{x} \\in \\mathbb{R}^{H \\times W \\times C} \\) into blocks \\( \\pmb{x}_b \\in \\mathbb{R}^{h \\times w \\times B^2 \\times C} \\), where \\( B \\) is block size and \\( h = \\frac{H}{B}, w = \\frac{W}{B} \\). When the image is fed into the network, the channel size and resolution of a block may change, but the layout and the relative positional relationships between blocks will remain unchanged. If there is a way to apply sequential batch generation of blocks where each batch simultaneously produces a subset of the blocks, only a small number of block hidden states have to be kept in memory simultaneously, making it possible to generate ultra-high-resolution images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.593, + 0.79, + 0.79 + ], + "angle": 0, + "content": "Here we define that \\(\\mathrm{block}_{\\mathrm{A}}\\) is dependent on \\(\\mathrm{block}_{\\mathrm{B}}\\) if the generation of \\(\\mathrm{block}_{\\mathrm{A}}\\) involves the hidden state of \\(\\mathrm{block}_{\\mathrm{B}}\\) in computation. It can be observed that the dependencies between blocks are bidirectional in most previous structures (UNet, DiT, etc.), in which case all blocks in the image must be generated simultaneously. Take UNet as an example: two adjacent elements in neighboring blocks use each other's hidden state in the convolution operation, therefore all pairs of neighboring blocks must be generated simultaneously. Given the aim to save the memory of blocks' hidden states, we hope to devise an algorithm that allows the blocks in the same image to be divided into several batches for generation, with each batch only needing to generate a portion of the blocks at the same time, and the batches are generated in sequence. Generally, an image generation algorithm can perform such a sequential batch generation among blocks if it meets the following conditions:" + }, + { + "type": "text", + "bbox": [ + 0.223, + 0.81, + 0.789, + 0.842 + ], + "angle": 0, + "content": "1. The generative dependency between blocks are unidirectional, and can form a directed acyclic graph (DAG)." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.253, + 0.114, + 0.733, + 0.131 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.128 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.147, + 0.788, + 0.193 + ], + "angle": 0, + "content": "2. Each block has only a few direct (1st-order) dependencies on other blocks, since the hidden states of the block and its direct dependencies should simultaneously be kept in the memory." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.204, + 0.786, + 0.234 + ], + "angle": 0, + "content": "Furthermore, to ensure consistency across the whole image, it also required that the blocks have a large enough receptive field to manage long-range dependencies." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.236, + 0.788, + 0.356 + ], + "angle": 0, + "content": "According to the conditions and analysis above, we choose an efficient implementation illustrated in Fig. 3. Unidirectional Block Attention(UniBA). For each layer, every block directly depends on three 1st-order neighboring blocks: the block on the top, on the left, and in the upper left corner. For example, if we adopt Diffusion Transformer (DiT) architecture which is the base architecture of Inf-DiT, the dependency between blocks is attention operation, where the query vectors of each block interact with the key, value vectors of 4 blocks: 3 blocks located to its upper left and itself, illustrated in Fig. 3." + }, + { + "type": "text", + "bbox": [ + 0.239, + 0.357, + 0.743, + 0.372 + ], + "angle": 0, + "content": "Formally, the UniBA process in the transformer can be formulated as" + }, + { + "type": "equation", + "bbox": [ + 0.269, + 0.399, + 0.786, + 0.419 + ], + "angle": 0, + "content": "\\[\nQ = z _ {(i, j)} ^ {n} W ^ {Q}, \\tag {1}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.266, + 0.422, + 0.786, + 0.441 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {K} = \\left[ \\boldsymbol {z} _ {(i, j)} ^ {n} + \\boldsymbol {P} _ {1}; \\boldsymbol {z} _ {(i - 1, j)} ^ {n} + \\boldsymbol {P} _ {2}; \\boldsymbol {z} _ {(i, j - 1)} ^ {n} + \\boldsymbol {P} _ {3}; \\boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} + \\boldsymbol {P} _ {4} \\right] \\boldsymbol {W} ^ {K}, \\tag {2}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.268, + 0.444, + 0.785, + 0.463 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {V} = \\left[ \\boldsymbol {z} _ {(i, j)} ^ {n}; \\boldsymbol {z} _ {(i - 1, j)} ^ {n}; \\boldsymbol {z} _ {(i, j - 1)} ^ {n}; \\boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} \\right] \\boldsymbol {W} ^ {V}, \\tag {3}\n\\]" + }, + { + "type": "equation", + "bbox": [ + 0.248, + 0.465, + 0.786, + 0.485 + ], + "angle": 0, + "content": "\\[\n\\boldsymbol {z} _ {(i, j)} ^ {n + 1} = \\operatorname {F F N} (\\operatorname {A t t e n t i o n} (\\boldsymbol {Q}, \\boldsymbol {K}, \\boldsymbol {V})), \\tag {4}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.496, + 0.787, + 0.557 + ], + "angle": 0, + "content": "where \\( \\mathbf{z}_{(i,j)}^n \\) is the hidden states of the block at row \\( i \\), column \\( j \\) in layer \\( n \\), and \\( P_i \\) is the block-level relative position encoding. We also implement an efficient approach to apply UniBA for full image in pytorch style, which is attached in the Appendix [A]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.558, + 0.788, + 0.647 + ], + "angle": 0, + "content": "Note that, though each block only attends to a few number of neighboring blocks in each layer, as features propagate layer by layer, blocks can indirectly interact with faraway blocks, thereby capturing both long- and short-range relationships. Our design shares a similar spirit with the natural language model Transformer-XL [4], which can be viewed as a special form of ours in one dimension case." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.673, + 0.79, + 0.809 + ], + "angle": 0, + "content": "Inference process with O(N) Memory Consumption Although our method can generate each block sequentially, it differs from auto-regressive generative models, in which the next block depends on the final output of the previous block. Any number of blocks can also be generated in parallel in our model, as long as the union of their dependent blocks has been generated. Based on this property, we implement a simple but effective inference process. As illustrated in Fig. 3, we generate \\( n \\times n \\) blocks at once, from the top-left to bottom-right. After generating a set of blocks, we discard hidden states i.e. KV-cache that are no longer used and append newly generated KV-cache to the memory." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "It can be easily proved that the number of block KV-cache retained in memory during the process is always \\(\\leq w + n\\). Assume the space needed by the" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.237 + ], + "angle": 0, + "content": "model when generating a single block is \\( M_{1} \\), the space for one block's KV-cache is \\( M_{2} \\), and other essential space consumption (such as storing the raw input image) is \\( C \\), then the maximum space usage of the inference process is \\( n^{2}M_{1} + (w + n)M_{2} + C \\). When \\( n \\) is much smaller than \\( w \\), the memory consumption is directly proportional to \\( w \\). If \\( w \\) is bigger than \\( h \\), we can easily change the trajectory of generation to column-major." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.238, + 0.788, + 0.3 + ], + "angle": 0, + "content": "In practical terms, despite the total FLOPs of generation remaining constant for various values of \\( n \\), due to the overhead such as operator initialization time and memory allocation time, the generation time decreases when \\( n \\) increases. Therefore, it's optimal to choose the largest \\( n \\) allowed by the memory limitation." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.322, + 0.476, + 0.336 + ], + "angle": 0, + "content": "2.2 Basic Model Architecture" + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.37, + 0.789, + 0.535 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.544, + 0.79, + 0.575 + ], + "angle": 0, + "content": "Fig. 4: (Left) Overall architecture of Inf-DiT. (Right) The inner structure of Inf-DiT block. We do not depict the Layernorm that originally existed in the DiT for simplicity." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.605, + 0.789, + 0.728 + ], + "angle": 0, + "content": "Figure 4 provides an overview of our model, Inf-DiT's architecture. The model uses a similar backbone as DiT [17], which applies Vision Transformer (ViT) [6] to diffusion models and proves its efficacy and scalability. In addition to its superior performance, compared to convolution-based architectures such as UNet [22], DiT solely utilizes attention as the mechanism of interaction among patches, which can conveniently implement unidirectional block attention. To adapt to unidirectional block attention and enhance the performance of upsampling, we make several modifications and optimizations detailed as follows." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.79, + 0.841 + ], + "angle": 0, + "content": "Model input Inf-DiT first partitions input images into multiple non-overlapping blocks, which are further divided into patches with a side length equal to the patch size. Unlike DiT, considering the compression loss such as color shifting and detail loss, the patchifying of Inf-DiT is conducted in RGB pixel space instead of latent space. In the case of super-resolution by \\( f \\) times, Inf-DiT first upsamples the low-resolution RGB image condition by a factor of \\( f \\), then concatenates it" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.254, + 0.114, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.116, + 0.787, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.784, + 0.176 + ], + "angle": 0, + "content": "with the diffusion's noised input on the feature dimension before feeding it to the model." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.196, + 0.788, + 0.455 + ], + "angle": 0, + "content": "Position Encoding Unlike UNet-based diffusion models [21] that can perceive positional relationships through convolution operations, all operations including self-attention, FFN in transformers are permutation invariant functions. Therefore, transformer-based models require auxiliary input of explicit positional information. We refer to the design of Rotary Positional Encoding (RoPE) [28], which performs well in the long context generation, and adapt it into two-dimensional form for image generation. Specifically, we divide channels of hidden states in half, one for encoding the x-coordinate and the other for the y-coordinate, and apply RoPE in both halves. We create a sufficiently large rope positional encoding table to ensure it meets the requirements during generation. To ensure all parts of the positional encoding table can be seen by the model during training, we employ the Random Starting Point: For each training image, we randomly assign a position \\((x,y)\\) for the top-left corner of the image, instead of the default \\((0,0)\\). In addition, considering the difference in interactions within the same block and between different blocks, we additionally introduce block-level relative position encoding \\(P_{1\\sim 4}\\), which assigns a distinct learnable embedding based on the relative position before attention." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.473, + 0.509, + 0.489 + ], + "angle": 0, + "content": "2.3 Global and Local Consistency" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.495, + 0.788, + 0.706 + ], + "angle": 0, + "content": "Global Consistency with CLIP Image Embedding The global semantic information within low-resolution (LR) images, such as artistic style and object material, plays a crucial role during upsampling. However, compared to text-to-image generation models, the upsampling model has an additional task: understanding and analyzing the semantic information of LR images, which significantly increases the model's burden. This is particularly challenging when training without text data, as high-resolution images rarely have high-quality paired texts, making these aspects difficult for the model. We utilize the image encoder from pre-trained CLIP [19] to extract image embedding \\( I_{LR} \\) from low-resolution images, which we refer to as Semantic Input. Since CLIP is trained on massive image-text pairs from the Internet, its image encoder can effectively extract global information. We add the global semantic embedding to the time embedding of the diffusion transformer and input it into each layer, enabling the model to learn directly from high-level semantic information." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.707, + 0.788, + 0.783 + ], + "angle": 0, + "content": "Another interesting advantage of global semantic embedding is that, using the aligned image-text latent space in CLIP, we can use text to guide the direction of generation, even if our model has not been trained on any image-text pairs. Given a positive prompt \\( C_{pos} \\) and a negative prompt \\( C_{neg} \\), we can update our image embedding:" + }, + { + "type": "equation", + "bbox": [ + 0.299, + 0.788, + 0.787, + 0.806 + ], + "angle": 0, + "content": "\\[\n\\tilde {\\boldsymbol {I}} _ {L R} = \\operatorname {n o r m} \\left(\\boldsymbol {I} _ {L R} + \\alpha (\\text {T e x t E n c} \\left(C _ {p o s}\\right) - \\text {T e x t E n c} \\left(C _ {n e g}\\right))\\right), \\tag {5}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "where \\(\\alpha\\) can control the intensity of the guidance. During inference, we can simply use \\(\\tilde{I}_{LR}\\) in place of \\(I_{LR}\\) as the global semantic embedding to conduct" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.788, + 0.179 + ], + "angle": 0, + "content": "the control. For example, to get a more clear result set, \\( C_{pos} = \\) \"clear\" and \\( C_{neg} = \\) \"blur\" sometimes help." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.2, + 0.789, + 0.381 + ], + "angle": 0, + "content": "Local Consistency with Nearby LR Cross Attention Although concatenating the LR image with noised input already provides a good inductive bias for models to learn the local correspondence between LR and HR images, there can still be continuity issues. The reason is that, there are several possibilities of upsampling for a given LR block, which require analysis in conjunction with several nearby LR blocks to select one solution, but the LR block to the right and below is unseen. To handle this problem, we introduce Nearby LR Cross Attention. In the first layer of the transformer, each block conducts cross-attention on the surrounding \\(3 \\times 3\\) LR blocks to capture nearby LR information. This approach significantly reduces the probability of generating discontinuous images. It is worth noting that this operation will not change our inference process since the entire LR image is known before generation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.381, + 0.789, + 0.429 + ], + "angle": 0, + "content": "We further devise techniques including continuity class-free guidance, LR-based noise initialization, QK Normalization, etc., which are elaborated in detail in the Appendix A." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.451, + 0.377, + 0.468 + ], + "angle": 0, + "content": "3 Experiments" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.482, + 0.789, + 0.559 + ], + "angle": 0, + "content": "In this section, we first introduce the detailed training process of Inf-DiT, then comprehensively evaluate Inf-DiT by both machine and human evaluation. The results show that Inf-DiT surpasses all baselines, excelling in both ultra-high-resolution image generation and upsampling tasks. Finally, we conduct ablation studies to validate the effectiveness of our design." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.581, + 0.398, + 0.596 + ], + "angle": 0, + "content": "3.1 Training Details" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.606, + 0.789, + 0.714 + ], + "angle": 0, + "content": "Datasets Our dataset comprises a subset of LAION-5B [25] with a resolution higher than \\(1024 \\times 1024\\) and aesthetic score higher than 5, and 100 thousand high-resolution wallpapers from the Internet. Following the previous works [20,23,30], we use fixed-size image crops of \\(512 \\times 512\\) resolution during training. Since upsampling can be conducted with local information only, it can be directly employed at higher resolution during inference, which is not easy for most generation models. The data processing details are illustrated in Appendix A.2" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.789, + 0.842 + ], + "angle": 0, + "content": "Training settings During training, We set block size \\(= 128\\) and patch size \\(= 4\\), which means every training image is divided into \\(4 \\times 4\\) blocks and every block has \\(32 \\times 32\\) patches. We employ the framework of EDM [15] for training, and set the upsampling factor to \\(4 \\times\\). Because the upsampling task is more concerned with the high-frequency details of images, we adjusted the mean and std of training noise distribution to \\(-1.0\\) and \\(1.4\\). To address overflow problem during training, we employed BF16 format due to its broader numerical range. Our" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.254, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.21 + ], + "angle": 0, + "content": "CLIP model is a ViT-L/16 pre-trained on Datacomp dataset [13]. Since the CLIP can only process images with \\(224 \\times 224\\) resolution, we first resize LR images to \\(224 \\times 224\\) and then input them to CLIP. Other hyperparameters are listed in the Appendix A." + }, + { + "type": "image", + "bbox": [ + 0.263, + 0.234, + 0.744, + 0.487 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.28, + 0.489, + 0.726, + 0.5 + ], + "angle": 0, + "content": "Direct Patch Scalecrafter BSRGAN Demofusion Inf-DiT" + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.5, + 0.786, + 0.514 + ], + "angle": 0, + "content": "Fig. 5: Qualitative comparison of different methods in detail at \\(2048 \\times 2048\\) resolution" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.569, + 0.427, + 0.584 + ], + "angle": 0, + "content": "3.2 Machine Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.597, + 0.788, + 0.645 + ], + "angle": 0, + "content": "In this part, we conduct quantitative comparisons of Inf-DiT against state-of-the-art methodologies on ultra-high-resolution image generation tasks. The baselines encompass two main categories of high-resolution generation: 1. Direct" + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.669, + 0.788, + 0.698 + ], + "angle": 0, + "content": "Table 1: Quantitative comparison results with state-of-the-art methods of super resolution on DIV2K dataset. The best results are marked in bold." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.71, + 0.788, + 0.838 + ], + "angle": 0, + "content": "
SettingMethodFID ↓FIDcrop ↓PSNR ↑SSIM ↑
Variable resolutionBSRGAN35.0143.225.90.73
Real-ESRGAN35.5127.625.20.72
Inf-DiT(Ours)20.276.526.30.74
Fix resolution (512x512)StableSR74.8112.622.00.60
Inf-DiT(Ours)38.683.324.60.67
Fix resolution (256x256)LDM152.6-23.90.66
Inf-DiT(Ours)86.8-24.60.67
" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.274, + 0.144, + 0.731, + 0.444 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.216, + 0.445, + 0.787, + 0.459 + ], + "angle": 0, + "content": "Fig. 6: Qualitative comparison of different methods in detail at \\(4096 \\times 4096\\) resolution" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.487, + 0.789, + 0.609 + ], + "angle": 0, + "content": "high-resolution image generation, including Direct Inference of SDXL [18], MultiDiffusion [2], ScaleCrafter [9], and 2. High-resolution image generation based on super-resolution techniques, including BSRGAN [33], DemoFusion [7]. We employ the FID (Fréchet Inception Distance) [10] to evaluate the quality of ultra-high-resolution generation, which is widely used to evaluate the perceptual quality of images in image generation tasks [17,21,23]. To further validate the super-resolution ability of our model, we additionally benchmark it against renowned super-resolution models over classic super-resolution tasks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.629, + 0.789, + 0.844 + ], + "angle": 0, + "content": "Ultra-High-Resolution Generation We use the test set of HPDv2 [31] for evaluation, which allows for a comprehensive evaluation of the model's generative capabilities (3200 prompts) across various domains and styles (\"Animation\", \"Concept-art\", \"Painting\", and \"Photo\"). We test on two resolutions: \\( 2048^2 \\) and \\( 4096^2 \\). For super-resolution-based models, we first use SDXL to generate a \\( 1024^2 \\) resolution image and upsample it without text. Although Inf-DiT was trained in a setting with \\( 4 \\times \\) upsample, we find that it can generalize well to upsampling ratios lower than training. Therefore, for \\( 2048^2 \\) generation, we directly resize the LR image from \\( 1024^2 \\) to \\( 2048^2 \\) and concatenate it with the noise input. As for the metrics, we use FID to assess how closely generated images mimic real image distributions, and the real images are randomly sampled from LAION-5B. However, the original implementation of FID downsamples the input image to \\( 299 \\times 299 \\) before the feature extraction, which ignores critical high-resolution details. Therefore, inspired by [37], we additionally adopted the idea of \\( \\mathrm{FID}_{\\mathrm{crop}} \\)" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.254, + 0.114, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.785, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.215, + 0.145, + 0.788, + 0.187 + ], + "angle": 0, + "content": "Table 2: Quantitative comparison results with state-of-the-art methods of ultra-high-resolution generation on HPDV2 dataset. The best results are marked in bold, and the second best results are marked by underline." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.199, + 0.787, + 0.318 + ], + "angle": 0, + "content": "
Method2048 × 20484096 × 4096Mean ↓
FID ↓FIDcrop ↓FID ↓FIDcrop ↓
Direct Inference92.292.3OOMOOM92.3
MultiDiffusion99.7109.3OOMOOM104.5
SDXL+BSRGAN66.381.766.085.074.8
ScaleCrafter79.995.5115.1153.3111.0
DemoFusion67.572.070.882.673.2
SDXL+Inf-DiT(Ours)66.071.967.076.270.3
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.35, + 0.785, + 0.379 + ], + "angle": 0, + "content": "and randomly cropped \\(299 \\times 299\\) patches from high-resolution images for FID evaluation." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.38, + 0.787, + 0.472 + ], + "angle": 0, + "content": "The results in Tab. 2 demonstrate that our model achieves state-of-the-art (SOTA) in three out of four metrics. This showcases our model's exceptional ability to generate high-resolution details and harmonious global information. Note that our model is capable of being applied to all generative models. Examples from other models are listed in the Appendix D. We have also evaluated the model' time-space consumption in Appendix A." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.492, + 0.787, + 0.627 + ], + "angle": 0, + "content": "Super-Resolution In addition to its ability to generate high-resolution images, Inf-DiT can also be used as a classic super-resolution model. We conduct the evaluation on DIV2k valid dataset [1] which contains multiple real-world high-resolution images in different scenarios. Following [21, 24], we fix image degradation to bicubic interpolation with \\(4 \\times\\) downsampling. Before comparing with fix-resolution models LDM [21] and StableSR [29], we center-crop specific-sized patches from the high-resolution image as ground truth. Throughout this process, we utilize both perceptual (FID, \\(\\mathrm{FID}_{\\mathrm{crop}}\\)) and fidelity (PSNR, SSIM) metrics to ensure a detailed and comprehensive assessment." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.628, + 0.787, + 0.689 + ], + "angle": 0, + "content": "As demonstrated in Tab. [1], our model achieves state-of-the-art across all metrics. This shows that, as a super-resolution model, ours not only excels in performing super-resolution at arbitrary scales but also preserves global and detailed information while restoring results that closely resemble the LR images." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.71, + 0.418, + 0.725 + ], + "angle": 0, + "content": "3.3 Human Evaluation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.734, + 0.788, + 0.841 + ], + "angle": 0, + "content": "To further evaluate Inf-DiT and more accurately reflect its generative quality from a human perspective, we conduct a human evaluation. The whole evaluation process is detailed in Appendix C. We ultimately collected 3,600 comparisons. As depicted in Fig. 7, our model outperforms the other 3 methods in all the 3 criteria. It is particularly noteworthy that each of the other three models ranks relatively lower on at least one of the three evaluation criteria, while Inf-DiT achieves the highest score on all three criteria: detail authenticity, global" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "image", + "bbox": [ + 0.219, + 0.146, + 0.784, + 0.29 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.293, + 0.788, + 0.337 + ], + "angle": 0, + "content": "Fig. 7: Human evaluation results. After participants rank the images from different models, We assign scores from 4 to 1 to models in order and finally calculate the average of all the results. Inf-DiT gets the highest scores in all three categories." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.363, + 0.788, + 0.409 + ], + "angle": 0, + "content": "coherence, and consistency with low-resolution input. This indicates that our model is the only one capable of excelling in both high-resolution generation and super-resolution tasks simultaneously." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.428, + 0.44, + 0.446 + ], + "angle": 0, + "content": "3.4 Iterative Upsampling" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.451, + 0.79, + 0.618 + ], + "angle": 0, + "content": "Since our model can upsample images of arbitrary resolution, it's a natural idea to test if the model can iteratively upsample images generated by itself. In this study, we experiment on generating a \\(2048^{2}\\) resolution image from a \\(32^{2}\\) resolution image, \\(64 \\times\\) upscale, through three times of iterative upsampling. Figure 8 illustrates two cases of this process. In the first case, the model successfully produces a high-resolution image after three stages of upsampling. It generates details of different frequencies in different resolution upsampling: the contour of the face, the shape of the eyeball, and individual eyelashes. However, it is hard for the model to correct inaccuracies generated in earlier stages, leading to the accumulation of errors. An example of this issue is demonstrated in the second sample. We leave this problem for our future work." + }, + { + "type": "table_caption", + "bbox": [ + 0.327, + 0.642, + 0.677, + 0.657 + ], + "angle": 0, + "content": "Table 3: Ablation study on \\( {2048} \\times {2048} \\) resolution." + }, + { + "type": "table", + "bbox": [ + 0.222, + 0.668, + 0.445, + 0.741 + ], + "angle": 0, + "content": "
MethodFIDFIDcrop
Ours66.071.9
w/o Nearby LR Attention66.773.6
w/o Semantic Input66.272.8
Inner Block Attention66.383.7
" + }, + { + "type": "table", + "bbox": [ + 0.464, + 0.67, + 0.783, + 0.74 + ], + "angle": 0, + "content": "
Block Size3264128256512
Memory Usage (GB)23.323.323.323.523.7
FID276271268265246
Inference Time (s)576169112269
" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.787, + 0.391, + 0.803 + ], + "angle": 0, + "content": "3.5 Ablation Study" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "We conduct all ablation studies with \\(2048^{2}\\) resolution on HPDV2 dataset, with results in Tab. 3. To verify our method, we separately 1. remove the Global" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.254, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.116, + 0.786, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.146, + 0.36, + 0.156 + ], + "angle": 0, + "content": "Iterative Upsampling: Good Case" + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.156, + 0.788, + 0.362 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.371, + 0.788, + 0.428 + ], + "angle": 0, + "content": "Fig. 8: Generated samples of iterative upsampling. Top: Inf-DiT can upsample an image generated by itself several times, and generate details of different frequencies at corresponding resolution. Bottom: After failing to generate a pupil at the \\(128^{2}\\) resolution, it is difficult for subsequent upsampling stages to correct this error." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.458, + 0.788, + 0.564 + ], + "angle": 0, + "content": "Input, 2. remove Nearby LR attention and 3. remove the attention between blocks (Inner Block Attention setting). As a result, both the FID and \\(\\mathrm{FID}_{\\mathrm{crop}}\\) of the model get worse to varying degrees. We also conduct an ablation study to decide the optimal block size. The results show that as block size increases, the performance improves, but the time also increases. To trade-off, we chose 128 as the default setting. Further case studies and analysis are listed in the Appendix B." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.587, + 0.388, + 0.603 + ], + "angle": 0, + "content": "4 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.619, + 0.49, + 0.634 + ], + "angle": 0, + "content": "4.1 Diffusion Image Generation" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.749 + ], + "angle": 0, + "content": "Diffusion models have emerged as a spotlight in the realm of image generation, boasting an array of groundbreaking advancements in recent years. Initially introduced in 2015 [26], and further developed through works such as DDPM [11] and DDIM [27], these models leverage a stochastic diffusion process, conceptualized as a Markov chain, to convert a simple prior distribution, like Gaussian noise, into a complex data distribution. This methodology yield impressive outcomes in terms of the quality and diversity of generated images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.75, + 0.788, + 0.796 + ], + "angle": 0, + "content": "Recent enhancements have markedly elevated the generation capabilities of diffusion models. CDM [12] creates a cascade generation pipeline with multistage super-resolution models, which can be applied to large pretrained models [20, 23]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.796, + 0.788, + 0.84 + ], + "angle": 0, + "content": "The introduction of Latent Diffusion Models (LDMs) [18,21] represents a pivotal extension, incorporating a latent space to boost both efficiency and scalability. Alongside these advancements, there has been significant progress in" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.346, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.147, + 0.788, + 0.181 + ], + "angle": 0, + "content": "the optimization of network architectures. The advent of Diffusion Transformers (DiT) [17] Replaces U-Net with ViT [6] for noise prediction." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.202, + 0.461, + 0.218 + ], + "angle": 0, + "content": "4.2 Image Super-Resolution" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.229, + 0.789, + 0.427 + ], + "angle": 0, + "content": "Given a low-resolution (LR) image \\( I_{LR} \\) degraded from high-resolution (HR) observation \\( I_{HR} \\), image super-resolution (SR) aims to reconstruct a HR one \\( \\hat{I}_{HR} \\): \\( I_{LR} = D(I_{HR};\\delta) \\), \\( \\hat{I}_{HR} = F(I_{LR};\\theta) \\). Here \\( D \\) and \\( F \\) refer to degradation process and the super-resolution model. \\( \\delta \\) and \\( \\theta \\) represent the parameters. In recent years, Blind SR has been a major focus, in which the degradation process is unknown and learnable. The representative methods are BSRGAN [33] and Real-ESRGAN [30]. Recently, diffusion-based SR methods have yielded exciting results. These works focus on finetuning pre-trained text-to-image diffusion models to take advantage of their excellent generative ability. Specifically, DiffBir [16] employs ControlNet [34] on pre-trained stable-diffusion models, whereas PASD [32] enhances it by executing pixel-aware cross-attention. Both approaches have garnered considerable success in fixed resolution super-resolution but cannot be directly used for higher resolution." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.45, + 0.599, + 0.466 + ], + "angle": 0, + "content": "4.3 Ultra-High-Resolution Image Upsampler" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.478, + 0.789, + 0.599 + ], + "angle": 0, + "content": "Currently, image generation methods fall short in generating ultra-high-resolution images owing to the constraints of memory and issues with training efficiency. Under these circumstances, MultiDiffusion [2] and Mixture of Diffusers [14] bind together multiple diffusion generation processes by dividing images into overlapping blocks, processing each separately, and then stitching them together, aiming to maintain continuity between blocks. However, because they only used the local weighted averaging for aggregation, it leads to a low interaction efficiency and makes it difficult to ensure the global consistency of the images." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.599, + 0.789, + 0.677 + ], + "angle": 0, + "content": "Given this concern, DemoFusion [7] and ScaleCrafter [9] adapt dilated policies including dilated sampling and dilated convolution kernels, aiming at acquiring more global information. These methods indeed achieve improvement on a global semantic level without additional training. However, the huge difference between training and generation leads these methods to easily produce illogical images." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.701, + 0.36, + 0.716 + ], + "angle": 0, + "content": "5 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.789, + 0.84 + ], + "angle": 0, + "content": "In this work, we observe that the major obstacle to generating ultra-high-resolution images is the substantial memory occupied by model hidden states. Based on this, We propose Unidirectional Block Attention mechanism (UniBA) which can lower the space complexity by performing batch generation among blocks. With UniBA, we train Inf-DiT, a \\(4\\times\\) memory-efficient image upsampler which achieves state-of-the-art performance in both generation and superresolution tasks." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.254, + 0.115, + 0.733, + 0.129 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.177, + 0.785, + 0.207 + ], + "angle": 0, + "content": "The authors would like to thank Zhipu.AI for their GPU and human evaluation support, and the reviewers of ECCV for their valuable suggestions." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.23, + 0.323, + 0.245 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.26, + 0.786, + 0.302 + ], + "angle": 0, + "content": "1. Agustsson, E., Timofte, R.: Ntire 2017 challenge on single image super-resolution: Dataset and study. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 126-135 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.302, + 0.786, + 0.33 + ], + "angle": 0, + "content": "2. Bar-Tal, O., Yariv, L., Lipman, Y., Dekel, T.: Multidiffusion: Fusing diffusion paths for controlled image generation (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.33, + 0.786, + 0.371 + ], + "angle": 0, + "content": "3. Chai, L., Gharbi, M., Shechtman, E., Isola, P., Zhang, R.: Any-resolution training for high-resolution image synthesis. In: European Conference on Computer Vision. pp. 170-188. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.371, + 0.786, + 0.413 + ], + "angle": 0, + "content": "4. Dai, Z., Yang, Z., Yang, Y., Carbonell, J., Le, Q.V., Salakhutdinov, R.: Transformer-xl: Attentive language models beyond a fixed-length context. arXiv preprint arXiv:1901.02860 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.413, + 0.786, + 0.468 + ], + "angle": 0, + "content": "5. Dehghani, M., Djolonga, J., Mustafa, B., Padlewski, P., Heek, J., Gilmer, J., Steiner, A.P., Caron, M., Geirhos, R., Alabdulmohsin, I., et al.: Scaling vision transformers to 22 billion parameters. In: International Conference on Machine Learning. pp. 7480-7512. PMLR (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.468, + 0.786, + 0.523 + ], + "angle": 0, + "content": "6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.523, + 0.786, + 0.564 + ], + "angle": 0, + "content": " 7. Du, R., Chang, D., Hospedales, T., Song, Y.Z., Ma, Z.: Demofusion: Democratising high-resolution image generation with no $$$. arXiv preprint arXiv:2311.16973 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.565, + 0.786, + 0.592 + ], + "angle": 0, + "content": "8. Guttenberg, N.: Diffusion with offset noise (2023), https://www.crosslabs.org/blog/diffusion-with-offset-noise" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.592, + 0.786, + 0.647 + ], + "angle": 0, + "content": "9. He, Y., Yang, S., Chen, H., Cun, X., Xia, M., Zhang, Y., Wang, X., He, R., Chen, Q., Shan, Y.: Scalecrafter: Tuning-free higher-resolution visual generation with diffusion models. In: The Twelfth International Conference on Learning Representations (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.647, + 0.786, + 0.689 + ], + "angle": 0, + "content": "0. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.689, + 0.786, + 0.716 + ], + "angle": 0, + "content": "1. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.716, + 0.786, + 0.757 + ], + "angle": 0, + "content": "2. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.758, + 0.786, + 0.813 + ], + "angle": 0, + "content": "3. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below." + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.813, + 0.786, + 0.84 + ], + "angle": 0, + "content": "4. Jiménez, Á.B.: Mixture of diffusers for scene composition and high resolution image generation. arXiv preprint arXiv:2302.02412 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.226, + 0.26, + 0.786, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.347, + 0.129 + ], + "angle": 0, + "content": "Yang et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.188 + ], + "angle": 0, + "content": "15. Karras, T., Aittala, M., Aila, T., Laine, S.: Elucidating the design space of diffusion-based generative models. Advances in Neural Information Processing Systems 35, 26565-26577 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.189, + 0.787, + 0.23 + ], + "angle": 0, + "content": "16. Lin, X., He, J., Chen, Z., Lyu, Z., Fei, B., Dai, B., Ouyang, W., Qiao, Y., Dong, C.: Diffbir: Towards blind image restoration with generative diffusion prior. arXiv preprint arXiv:2308.15070 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.23, + 0.787, + 0.27 + ], + "angle": 0, + "content": "17. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.27, + 0.787, + 0.311 + ], + "angle": 0, + "content": "18. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.311, + 0.787, + 0.365 + ], + "angle": 0, + "content": "19. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.365, + 0.787, + 0.405 + ], + "angle": 0, + "content": "20. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.405, + 0.787, + 0.447 + ], + "angle": 0, + "content": "21. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.447, + 0.787, + 0.502 + ], + "angle": 0, + "content": "22. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.502, + 0.787, + 0.556 + ], + "angle": 0, + "content": "23. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.556, + 0.787, + 0.597 + ], + "angle": 0, + "content": "24. Sahara, C., Ho, J., Chan, W., Salimans, T., Fleet, D.J., Norouzi, M.: Image superresolution via iterative refinement. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(4), 4713-4726 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.597, + 0.787, + 0.679 + ], + "angle": 0, + "content": "25. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5b: An open large-scale dataset for training next generation image-text models. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022), https://openreview.net/forum?id=M3Y74vmsMcY" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.679, + 0.787, + 0.719 + ], + "angle": 0, + "content": "26. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.719, + 0.787, + 0.746 + ], + "angle": 0, + "content": "27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.746, + 0.787, + 0.773 + ], + "angle": 0, + "content": "28. Su, J., Ahmed, M., Lu, Y., Pan, S., Bo, W., Liu, Y.: Roformer: Enhanced transformer with rotary position embedding. Neurocomputing 568, 127063 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.773, + 0.787, + 0.8 + ], + "angle": 0, + "content": "29. Wang, J., Yue, Z., Zhou, S., Chan, K.C., Loy, C.C.: Exploiting diffusion prior for real-world image super-resolution. arXiv preprint arXiv:2305.07015 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.8, + 0.787, + 0.84 + ], + "angle": 0, + "content": "30. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind super-resolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.254, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.786, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.189 + ], + "angle": 0, + "content": "31. Wu, X., Hao, Y., Sun, K., Chen, Y., Zhu, F., Zhao, R., Li, H.: Human preference score v2: A solid benchmark for evaluating human preferences of text-to-image synthesis. arXiv preprint arXiv:2306.09341 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.19, + 0.788, + 0.231 + ], + "angle": 0, + "content": "32. Yang, T., Ren, P., Xie, X., Zhang, L.: Pixel-aware stable diffusion for realistic image super-resolution and personalized stylization. arXiv preprint arXiv:2308.14469 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.232, + 0.787, + 0.273 + ], + "angle": 0, + "content": "33. Zhang, K., Liang, J., Van Gool, L., Timofte, R.: Designing a practical degradation model for deep blind image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4791-4800 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.273, + 0.787, + 0.315 + ], + "angle": 0, + "content": "34. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.788, + 0.315 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_origin.pdf b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ff8359809249c9a70e55a589eb31181f6ca98e9f --- /dev/null +++ b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./f3002cff-588f-4f87-ae99-26bf23b35c9e_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3cdd703b752991bbae4eefb78df5c84a2d45603dc28717059e43f6d27aef4a45 +size 8858733 diff --git a/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./full.md b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./full.md new file mode 100644 index 0000000000000000000000000000000000000000..28d1e709e6e770a5b1b1463705ad445cfe65623c --- /dev/null +++ b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./full.md @@ -0,0 +1,270 @@ +# Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient Diffusion Transformer + +Zhuoyi Yang $^{1,\star}$ , Heyang Jiang $^{1}$ , Wenyi Hong $^{1}$ , Jiayan Teng $^{1}$ , Wendi Zheng $^{1}$ , Yuxiao Dong $^{1}$ , Ming Ding $^{2}$ , and Jie Tang $^{1,\star\star}$ + +$^{1}$ Tsinghua University $^{2}$ Zhipu.AI + +![](images/b58341a639221084995c7019aa52b18851bfe1e779ef1ece88dd9c57ee46b952.jpg) +Fig. 1: Selected ultra-high-resolution upsampling examples of Inf-DiT, based on SDXL, DALL-E 3, and real images. + +Abstract. Diffusion models have shown remarkable performance in image generation in recent years. However, due to a quadratic increase in memory during generating ultra-high-resolution images (e.g. $4096 \times 4096$ ), the resolution of generated images is often limited to $1024 \times 1024$ . In this work, we propose a unidirectional block attention mechanism that can adaptively adjust the memory overhead during the inference process and handle global dependencies. Building on this module, we adopt the DiT structure for upsampling and develop an infinite super-resolution model capable of upsampling images of various shapes and resolutions. Comprehensive experiments show that our model achieves SOTA performance in generating ultra-high-resolution images in both machine and + +human evaluation. Compared to commonly used UNet structures, our model can save more than $5 \times$ memory when generating $4096 \times 4096$ images. The project URL is https://github.com/THUDM/Inf-DiT. + +Keywords: diffusion model $\cdot$ ultra-high-resolution generation $\cdot$ super-resolution + +# 1 Introduction + +Recent years have witnessed rapid advancements in diffusion models, which significantly propelling the field of image generation and editing forward. Despite the advancements, a critical limitation persists: the resolution of images produced by existing image diffusion models is generally confined to $1024 \times 1024$ pixels or lower, posing a significant challenge for generating ultra-high-resolution images, which are indispensable in various real-world applications including intricate design projects, advertising, and the creation of posters and wallpapers, etc. + +A commonly used approach for generating high resolution is cascaded generation [12], which first produces a low-resolution image, then applies multiple upsampling models to increase the image's resolution step by step. This approach breaks down the generation of high-resolution images into multiple tasks. + +Based on the results generated in the previous stage, the models in the later stages only need to perform local generation. Building upon the cascaded structure, both DALL-E2 [21] and Imagen [23] can effectively generate images with 1024 resolution. + +The biggest challenge for upsampling to much higher resolution images is the significant GPU memory demands. For example, if utilizing the widely-adopted U-Net architecture such as SDXL [18] for image inference (see Figure 2), we observe a dramatic escalation in memory consumption with increasing resolution. Specifically, generating a $4096 \times 4096$ resolution image, which comprises over 16 million pixels requires more than 80GB of memory, exceeding the capacities of standard RTX 4090 or A100 graphics cards. Furthermore, the process of training models for high-resolution image generation exacerbates these demands, as it necessitates additional memory for storing gradients, optimizer states, etc. LDM [21] reduces the memory consumption by utilizing Variational Autoencoder(VAE) to compress images and generating images in a smaller latent space. However, it is also emphasized that an excessively high compression ratio can + +![](images/c0509925ec2f889469d5f205d56ca6f9c0fc87d8f19b4e83f5ed2b15fce2fcad.jpg) +Fig. 2: Comparison of memory usage during inference at different resolutions between our model and the SDXL architecture. + +substantially deteriorate the quality of generation, imposing severe limitations on the reduction of memory consumption. + +We observe that one common and critical problem among the aforementioned models is the necessity to input the entire image to the model, which requires keeping $O(N^2)$ hidden states in memory, where $N$ is the width (height) of the image. Based on this observation, we propose a Unidirectional Block Attention (UniBA) algorithm that can dramatically reduce the space complexity of generation from $O(N^2)$ to $O(N)$ , increasing the highest available resolution for a large margin (Fig. ②). Specifically, in every diffusion step, we split the image into blocks and perform a sequential batch generation order among them, where each batch simultaneously produces a subset of the blocks, and any amount of blocks can be generated in parallel as long as the memory restriction allows. It is worth noting that, though the model only inputs part of image into the model at the same time, UniBA successfully preserves the ability to interact with hidden states of faraway blocks and maintain high-level semantic consistency. This is different from other block-based generation methods such as [2,14,29] that only interact with blocks in pixel space or compressed latent space. + +Based on this algorithm, we optimize diffusion transformer (DiT) and train a model named Inf-DiT, which is capable of upsampling images of varying resolution and shape. Furthermore, we design several techniques including providing global image embedding to enhance the global semantic consistency and offer zero-shot text control ability, and provision of all neighboring low-resolution(LR) blocks through cross-attention mechanisms to further enhance the local consistency. Evaluation results show that Inf-DiT achieved significantly superior results compared to other high-resolution generative models in both machine and human evaluation. + +To summarize, our main contributions are as follows: + +1. We propose Unidirectional Block Attention (UniBA) algorithm, which reduces the minimum memory consumption from $O(N^2)$ to $O(N)$ during inference, where $N$ represents the edge length. This mechanism is also capable of adapting to various memory restrictions by adjusting the number of blocks generated in parallel, trading off between memory and time overhead. +2. Based on these methods, we train an image upsampling diffusion model, Inf-DiT, a 700M model capable of upsampling images of varying resolutions and shapes. Inf-DiT achieves state-of-the-art performance in both machine (HPDv2 and DIV2K datasets) and human evaluation. +3. We design multiple techniques to further enhance local and global consistency, and offer a zero-shot ability for flexible text control. + +# 2 Methodology + +# 2.1 Unidirectional Block Attention (UniBA) + +We observe that the critical obstacle for generating ultra-high resolution images is memory limitation. As the resolution of the image increases, the corresponding + +![](images/ed01a9034763f6c5c49e227eabdc43edbf244491e811b04ed9f7199832d1fb48.jpg) +Fig. 3: Left: Unidirectional block attention. In our implementation, each block directly depends on the three blocks in each layer: the blocks in the upper left corner, on the left, and on the top. Right: The inference process of Inf-DiT. Inf-DiT generates $n \times n$ block each time, based on the memory size. During this process, only the KV-cache of the blocks that subsequent blocks depend on are stored in memory. + +![](images/094d53558cea53806d215b695134efd39dbe2bd76c6609ccb734a39cb2279432.jpg) +Parallel Size: $\mathrm{n} = 2$ + +![](images/40de5338aca2ed4e2d8d67bcf10d2a5ce2595fd9e8603c4fb06a1c580fea95d9.jpg) + +hidden state's size within the network expands quadratically. For example, a single hidden state with the shape of $2048 \times 2048 \times 1280$ in only one layer requires 20GB of memory, making it formidable to generate very large images. How to avoid storing the entire image's hidden state in memory becomes the key issue. + +Our main idea is to divide an image $\pmb{x} \in \mathbb{R}^{H \times W \times C}$ into blocks $\pmb{x}_b \in \mathbb{R}^{h \times w \times B^2 \times C}$ , where $B$ is block size and $h = \frac{H}{B}, w = \frac{W}{B}$ . When the image is fed into the network, the channel size and resolution of a block may change, but the layout and the relative positional relationships between blocks will remain unchanged. If there is a way to apply sequential batch generation of blocks where each batch simultaneously produces a subset of the blocks, only a small number of block hidden states have to be kept in memory simultaneously, making it possible to generate ultra-high-resolution images. + +Here we define that $\mathrm{block}_{\mathrm{A}}$ is dependent on $\mathrm{block}_{\mathrm{B}}$ if the generation of $\mathrm{block}_{\mathrm{A}}$ involves the hidden state of $\mathrm{block}_{\mathrm{B}}$ in computation. It can be observed that the dependencies between blocks are bidirectional in most previous structures (UNet, DiT, etc.), in which case all blocks in the image must be generated simultaneously. Take UNet as an example: two adjacent elements in neighboring blocks use each other's hidden state in the convolution operation, therefore all pairs of neighboring blocks must be generated simultaneously. Given the aim to save the memory of blocks' hidden states, we hope to devise an algorithm that allows the blocks in the same image to be divided into several batches for generation, with each batch only needing to generate a portion of the blocks at the same time, and the batches are generated in sequence. Generally, an image generation algorithm can perform such a sequential batch generation among blocks if it meets the following conditions: + +1. The generative dependency between blocks are unidirectional, and can form a directed acyclic graph (DAG). + +2. Each block has only a few direct (1st-order) dependencies on other blocks, since the hidden states of the block and its direct dependencies should simultaneously be kept in the memory. + +Furthermore, to ensure consistency across the whole image, it also required that the blocks have a large enough receptive field to manage long-range dependencies. + +According to the conditions and analysis above, we choose an efficient implementation illustrated in Fig. 3. Unidirectional Block Attention(UniBA). For each layer, every block directly depends on three 1st-order neighboring blocks: the block on the top, on the left, and in the upper left corner. For example, if we adopt Diffusion Transformer (DiT) architecture which is the base architecture of Inf-DiT, the dependency between blocks is attention operation, where the query vectors of each block interact with the key, value vectors of 4 blocks: 3 blocks located to its upper left and itself, illustrated in Fig. 3. + +Formally, the UniBA process in the transformer can be formulated as + +$$ +Q = z _ {(i, j)} ^ {n} W ^ {Q}, \tag {1} +$$ + +$$ +\boldsymbol {K} = \left[ \boldsymbol {z} _ {(i, j)} ^ {n} + \boldsymbol {P} _ {1}; \boldsymbol {z} _ {(i - 1, j)} ^ {n} + \boldsymbol {P} _ {2}; \boldsymbol {z} _ {(i, j - 1)} ^ {n} + \boldsymbol {P} _ {3}; \boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} + \boldsymbol {P} _ {4} \right] \boldsymbol {W} ^ {K}, \tag {2} +$$ + +$$ +\boldsymbol {V} = \left[ \boldsymbol {z} _ {(i, j)} ^ {n}; \boldsymbol {z} _ {(i - 1, j)} ^ {n}; \boldsymbol {z} _ {(i, j - 1)} ^ {n}; \boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} \right] \boldsymbol {W} ^ {V}, \tag {3} +$$ + +$$ +\boldsymbol {z} _ {(i, j)} ^ {n + 1} = \operatorname {F F N} (\operatorname {A t t e n t i o n} (\boldsymbol {Q}, \boldsymbol {K}, \boldsymbol {V})), \tag {4} +$$ + +where $\mathbf{z}_{(i,j)}^n$ is the hidden states of the block at row $i$ , column $j$ in layer $n$ , and $P_i$ is the block-level relative position encoding. We also implement an efficient approach to apply UniBA for full image in pytorch style, which is attached in the Appendix [A]. + +Note that, though each block only attends to a few number of neighboring blocks in each layer, as features propagate layer by layer, blocks can indirectly interact with faraway blocks, thereby capturing both long- and short-range relationships. Our design shares a similar spirit with the natural language model Transformer-XL [4], which can be viewed as a special form of ours in one dimension case. + +Inference process with O(N) Memory Consumption Although our method can generate each block sequentially, it differs from auto-regressive generative models, in which the next block depends on the final output of the previous block. Any number of blocks can also be generated in parallel in our model, as long as the union of their dependent blocks has been generated. Based on this property, we implement a simple but effective inference process. As illustrated in Fig. 3, we generate $n \times n$ blocks at once, from the top-left to bottom-right. After generating a set of blocks, we discard hidden states i.e. KV-cache that are no longer used and append newly generated KV-cache to the memory. + +It can be easily proved that the number of block KV-cache retained in memory during the process is always $\leq w + n$ . Assume the space needed by the + +model when generating a single block is $M_{1}$ , the space for one block's KV-cache is $M_{2}$ , and other essential space consumption (such as storing the raw input image) is $C$ , then the maximum space usage of the inference process is $n^{2}M_{1} + (w + n)M_{2} + C$ . When $n$ is much smaller than $w$ , the memory consumption is directly proportional to $w$ . If $w$ is bigger than $h$ , we can easily change the trajectory of generation to column-major. + +In practical terms, despite the total FLOPs of generation remaining constant for various values of $n$ , due to the overhead such as operator initialization time and memory allocation time, the generation time decreases when $n$ increases. Therefore, it's optimal to choose the largest $n$ allowed by the memory limitation. + +# 2.2 Basic Model Architecture + +![](images/a8281b6a4f2c616be054ef390f8767278784c29a08229d431d5c38bd0948277b.jpg) +Fig. 4: (Left) Overall architecture of Inf-DiT. (Right) The inner structure of Inf-DiT block. We do not depict the Layernorm that originally existed in the DiT for simplicity. + +Figure 4 provides an overview of our model, Inf-DiT's architecture. The model uses a similar backbone as DiT [17], which applies Vision Transformer (ViT) [6] to diffusion models and proves its efficacy and scalability. In addition to its superior performance, compared to convolution-based architectures such as UNet [22], DiT solely utilizes attention as the mechanism of interaction among patches, which can conveniently implement unidirectional block attention. To adapt to unidirectional block attention and enhance the performance of upsampling, we make several modifications and optimizations detailed as follows. + +Model input Inf-DiT first partitions input images into multiple non-overlapping blocks, which are further divided into patches with a side length equal to the patch size. Unlike DiT, considering the compression loss such as color shifting and detail loss, the patchifying of Inf-DiT is conducted in RGB pixel space instead of latent space. In the case of super-resolution by $f$ times, Inf-DiT first upsamples the low-resolution RGB image condition by a factor of $f$ , then concatenates it + +with the diffusion's noised input on the feature dimension before feeding it to the model. + +Position Encoding Unlike UNet-based diffusion models [21] that can perceive positional relationships through convolution operations, all operations including self-attention, FFN in transformers are permutation invariant functions. Therefore, transformer-based models require auxiliary input of explicit positional information. We refer to the design of Rotary Positional Encoding (RoPE) [28], which performs well in the long context generation, and adapt it into two-dimensional form for image generation. Specifically, we divide channels of hidden states in half, one for encoding the x-coordinate and the other for the y-coordinate, and apply RoPE in both halves. We create a sufficiently large rope positional encoding table to ensure it meets the requirements during generation. To ensure all parts of the positional encoding table can be seen by the model during training, we employ the Random Starting Point: For each training image, we randomly assign a position $(x,y)$ for the top-left corner of the image, instead of the default $(0,0)$ . In addition, considering the difference in interactions within the same block and between different blocks, we additionally introduce block-level relative position encoding $P_{1\sim 4}$ , which assigns a distinct learnable embedding based on the relative position before attention. + +# 2.3 Global and Local Consistency + +Global Consistency with CLIP Image Embedding The global semantic information within low-resolution (LR) images, such as artistic style and object material, plays a crucial role during upsampling. However, compared to text-to-image generation models, the upsampling model has an additional task: understanding and analyzing the semantic information of LR images, which significantly increases the model's burden. This is particularly challenging when training without text data, as high-resolution images rarely have high-quality paired texts, making these aspects difficult for the model. We utilize the image encoder from pre-trained CLIP [19] to extract image embedding $I_{LR}$ from low-resolution images, which we refer to as Semantic Input. Since CLIP is trained on massive image-text pairs from the Internet, its image encoder can effectively extract global information. We add the global semantic embedding to the time embedding of the diffusion transformer and input it into each layer, enabling the model to learn directly from high-level semantic information. + +Another interesting advantage of global semantic embedding is that, using the aligned image-text latent space in CLIP, we can use text to guide the direction of generation, even if our model has not been trained on any image-text pairs. Given a positive prompt $C_{pos}$ and a negative prompt $C_{neg}$ , we can update our image embedding: + +$$ +\tilde {\boldsymbol {I}} _ {L R} = \operatorname {n o r m} \left(\boldsymbol {I} _ {L R} + \alpha (\text {T e x t E n c} \left(C _ {p o s}\right) - \text {T e x t E n c} \left(C _ {n e g}\right))\right), \tag {5} +$$ + +where $\alpha$ can control the intensity of the guidance. During inference, we can simply use $\tilde{I}_{LR}$ in place of $I_{LR}$ as the global semantic embedding to conduct + +the control. For example, to get a more clear result set, $C_{pos} =$ "clear" and $C_{neg} =$ "blur" sometimes help. + +Local Consistency with Nearby LR Cross Attention Although concatenating the LR image with noised input already provides a good inductive bias for models to learn the local correspondence between LR and HR images, there can still be continuity issues. The reason is that, there are several possibilities of upsampling for a given LR block, which require analysis in conjunction with several nearby LR blocks to select one solution, but the LR block to the right and below is unseen. To handle this problem, we introduce Nearby LR Cross Attention. In the first layer of the transformer, each block conducts cross-attention on the surrounding $3 \times 3$ LR blocks to capture nearby LR information. This approach significantly reduces the probability of generating discontinuous images. It is worth noting that this operation will not change our inference process since the entire LR image is known before generation. + +We further devise techniques including continuity class-free guidance, LR-based noise initialization, QK Normalization, etc., which are elaborated in detail in the Appendix A. + +# 3 Experiments + +In this section, we first introduce the detailed training process of Inf-DiT, then comprehensively evaluate Inf-DiT by both machine and human evaluation. The results show that Inf-DiT surpasses all baselines, excelling in both ultra-high-resolution image generation and upsampling tasks. Finally, we conduct ablation studies to validate the effectiveness of our design. + +# 3.1 Training Details + +Datasets Our dataset comprises a subset of LAION-5B [25] with a resolution higher than $1024 \times 1024$ and aesthetic score higher than 5, and 100 thousand high-resolution wallpapers from the Internet. Following the previous works [20,23,30], we use fixed-size image crops of $512 \times 512$ resolution during training. Since upsampling can be conducted with local information only, it can be directly employed at higher resolution during inference, which is not easy for most generation models. The data processing details are illustrated in Appendix A.2 + +Training settings During training, We set block size $= 128$ and patch size $= 4$ , which means every training image is divided into $4 \times 4$ blocks and every block has $32 \times 32$ patches. We employ the framework of EDM [15] for training, and set the upsampling factor to $4 \times$ . Because the upsampling task is more concerned with the high-frequency details of images, we adjusted the mean and std of training noise distribution to $-1.0$ and $1.4$ . To address overflow problem during training, we employed BF16 format due to its broader numerical range. Our + +CLIP model is a ViT-L/16 pre-trained on Datacomp dataset [13]. Since the CLIP can only process images with $224 \times 224$ resolution, we first resize LR images to $224 \times 224$ and then input them to CLIP. Other hyperparameters are listed in the Appendix A. + +![](images/451031df1a544b67af8de388f0cbc6263d4aaeb6c478cb56a9cd24f77d4162d3.jpg) +Direct Patch Scalecrafter BSRGAN Demofusion Inf-DiT +Fig. 5: Qualitative comparison of different methods in detail at $2048 \times 2048$ resolution + +# 3.2 Machine Evaluation + +In this part, we conduct quantitative comparisons of Inf-DiT against state-of-the-art methodologies on ultra-high-resolution image generation tasks. The baselines encompass two main categories of high-resolution generation: 1. Direct + +Table 1: Quantitative comparison results with state-of-the-art methods of super resolution on DIV2K dataset. The best results are marked in bold. + +
SettingMethodFID ↓FIDcrop ↓PSNR ↑SSIM ↑
Variable resolutionBSRGAN35.0143.225.90.73
Real-ESRGAN35.5127.625.20.72
Inf-DiT(Ours)20.276.526.30.74
Fix resolution (512x512)StableSR74.8112.622.00.60
Inf-DiT(Ours)38.683.324.60.67
Fix resolution (256x256)LDM152.6-23.90.66
Inf-DiT(Ours)86.8-24.60.67
+ +![](images/35dd8180f8fb13cf861a890ec221cbbf52dff5644ae4c39b63995f3d53d81aa0.jpg) +Fig. 6: Qualitative comparison of different methods in detail at $4096 \times 4096$ resolution + +high-resolution image generation, including Direct Inference of SDXL [18], MultiDiffusion [2], ScaleCrafter [9], and 2. High-resolution image generation based on super-resolution techniques, including BSRGAN [33], DemoFusion [7]. We employ the FID (Fréchet Inception Distance) [10] to evaluate the quality of ultra-high-resolution generation, which is widely used to evaluate the perceptual quality of images in image generation tasks [17,21,23]. To further validate the super-resolution ability of our model, we additionally benchmark it against renowned super-resolution models over classic super-resolution tasks. + +Ultra-High-Resolution Generation We use the test set of HPDv2 [31] for evaluation, which allows for a comprehensive evaluation of the model's generative capabilities (3200 prompts) across various domains and styles ("Animation", "Concept-art", "Painting", and "Photo"). We test on two resolutions: $2048^2$ and $4096^2$ . For super-resolution-based models, we first use SDXL to generate a $1024^2$ resolution image and upsample it without text. Although Inf-DiT was trained in a setting with $4 \times$ upsample, we find that it can generalize well to upsampling ratios lower than training. Therefore, for $2048^2$ generation, we directly resize the LR image from $1024^2$ to $2048^2$ and concatenate it with the noise input. As for the metrics, we use FID to assess how closely generated images mimic real image distributions, and the real images are randomly sampled from LAION-5B. However, the original implementation of FID downsamples the input image to $299 \times 299$ before the feature extraction, which ignores critical high-resolution details. Therefore, inspired by [37], we additionally adopted the idea of $\mathrm{FID}_{\mathrm{crop}}$ + +Table 2: Quantitative comparison results with state-of-the-art methods of ultra-high-resolution generation on HPDV2 dataset. The best results are marked in bold, and the second best results are marked by underline. + +
Method2048 × 20484096 × 4096Mean ↓
FID ↓FIDcrop ↓FID ↓FIDcrop ↓
Direct Inference92.292.3OOMOOM92.3
MultiDiffusion99.7109.3OOMOOM104.5
SDXL+BSRGAN66.381.766.085.074.8
ScaleCrafter79.995.5115.1153.3111.0
DemoFusion67.572.070.882.673.2
SDXL+Inf-DiT(Ours)66.071.967.076.270.3
+ +and randomly cropped $299 \times 299$ patches from high-resolution images for FID evaluation. + +The results in Tab. 2 demonstrate that our model achieves state-of-the-art (SOTA) in three out of four metrics. This showcases our model's exceptional ability to generate high-resolution details and harmonious global information. Note that our model is capable of being applied to all generative models. Examples from other models are listed in the Appendix D. We have also evaluated the model' time-space consumption in Appendix A. + +Super-Resolution In addition to its ability to generate high-resolution images, Inf-DiT can also be used as a classic super-resolution model. We conduct the evaluation on DIV2k valid dataset [1] which contains multiple real-world high-resolution images in different scenarios. Following [21, 24], we fix image degradation to bicubic interpolation with $4 \times$ downsampling. Before comparing with fix-resolution models LDM [21] and StableSR [29], we center-crop specific-sized patches from the high-resolution image as ground truth. Throughout this process, we utilize both perceptual (FID, $\mathrm{FID}_{\mathrm{crop}}$ ) and fidelity (PSNR, SSIM) metrics to ensure a detailed and comprehensive assessment. + +As demonstrated in Tab. [1], our model achieves state-of-the-art across all metrics. This shows that, as a super-resolution model, ours not only excels in performing super-resolution at arbitrary scales but also preserves global and detailed information while restoring results that closely resemble the LR images. + +# 3.3 Human Evaluation + +To further evaluate Inf-DiT and more accurately reflect its generative quality from a human perspective, we conduct a human evaluation. The whole evaluation process is detailed in Appendix C. We ultimately collected 3,600 comparisons. As depicted in Fig. 7, our model outperforms the other 3 methods in all the 3 criteria. It is particularly noteworthy that each of the other three models ranks relatively lower on at least one of the three evaluation criteria, while Inf-DiT achieves the highest score on all three criteria: detail authenticity, global + +![](images/47dcb02ae09065c79cf3226de5f5aa298643596eedb7618895e358bea4f1502c.jpg) +Fig. 7: Human evaluation results. After participants rank the images from different models, We assign scores from 4 to 1 to models in order and finally calculate the average of all the results. Inf-DiT gets the highest scores in all three categories. + +coherence, and consistency with low-resolution input. This indicates that our model is the only one capable of excelling in both high-resolution generation and super-resolution tasks simultaneously. + +# 3.4 Iterative Upsampling + +Since our model can upsample images of arbitrary resolution, it's a natural idea to test if the model can iteratively upsample images generated by itself. In this study, we experiment on generating a $2048^{2}$ resolution image from a $32^{2}$ resolution image, $64 \times$ upscale, through three times of iterative upsampling. Figure 8 illustrates two cases of this process. In the first case, the model successfully produces a high-resolution image after three stages of upsampling. It generates details of different frequencies in different resolution upsampling: the contour of the face, the shape of the eyeball, and individual eyelashes. However, it is hard for the model to correct inaccuracies generated in earlier stages, leading to the accumulation of errors. An example of this issue is demonstrated in the second sample. We leave this problem for our future work. + +Table 3: Ablation study on ${2048} \times {2048}$ resolution. + +
MethodFIDFIDcrop
Ours66.071.9
w/o Nearby LR Attention66.773.6
w/o Semantic Input66.272.8
Inner Block Attention66.383.7
+ +
Block Size3264128256512
Memory Usage (GB)23.323.323.323.523.7
FID276271268265246
Inference Time (s)576169112269
+ +# 3.5 Ablation Study + +We conduct all ablation studies with $2048^{2}$ resolution on HPDV2 dataset, with results in Tab. 3. To verify our method, we separately 1. remove the Global + +Iterative Upsampling: Good Case + +![](images/0c7f26ac8648a63ed5f60e074487f8d875633fbe04ce1456bd9c56a461488fd4.jpg) +Fig. 8: Generated samples of iterative upsampling. Top: Inf-DiT can upsample an image generated by itself several times, and generate details of different frequencies at corresponding resolution. Bottom: After failing to generate a pupil at the $128^{2}$ resolution, it is difficult for subsequent upsampling stages to correct this error. + +Input, 2. remove Nearby LR attention and 3. remove the attention between blocks (Inner Block Attention setting). As a result, both the FID and $\mathrm{FID}_{\mathrm{crop}}$ of the model get worse to varying degrees. We also conduct an ablation study to decide the optimal block size. The results show that as block size increases, the performance improves, but the time also increases. To trade-off, we chose 128 as the default setting. Further case studies and analysis are listed in the Appendix B. + +# 4 Related Work + +# 4.1 Diffusion Image Generation + +Diffusion models have emerged as a spotlight in the realm of image generation, boasting an array of groundbreaking advancements in recent years. Initially introduced in 2015 [26], and further developed through works such as DDPM [11] and DDIM [27], these models leverage a stochastic diffusion process, conceptualized as a Markov chain, to convert a simple prior distribution, like Gaussian noise, into a complex data distribution. This methodology yield impressive outcomes in terms of the quality and diversity of generated images. + +Recent enhancements have markedly elevated the generation capabilities of diffusion models. CDM [12] creates a cascade generation pipeline with multistage super-resolution models, which can be applied to large pretrained models [20, 23]. + +The introduction of Latent Diffusion Models (LDMs) [18,21] represents a pivotal extension, incorporating a latent space to boost both efficiency and scalability. Alongside these advancements, there has been significant progress in + +the optimization of network architectures. The advent of Diffusion Transformers (DiT) [17] Replaces U-Net with ViT [6] for noise prediction. + +# 4.2 Image Super-Resolution + +Given a low-resolution (LR) image $I_{LR}$ degraded from high-resolution (HR) observation $I_{HR}$ , image super-resolution (SR) aims to reconstruct a HR one $\hat{I}_{HR}$ : $I_{LR} = D(I_{HR};\delta)$ , $\hat{I}_{HR} = F(I_{LR};\theta)$ . Here $D$ and $F$ refer to degradation process and the super-resolution model. $\delta$ and $\theta$ represent the parameters. In recent years, Blind SR has been a major focus, in which the degradation process is unknown and learnable. The representative methods are BSRGAN [33] and Real-ESRGAN [30]. Recently, diffusion-based SR methods have yielded exciting results. These works focus on finetuning pre-trained text-to-image diffusion models to take advantage of their excellent generative ability. Specifically, DiffBir [16] employs ControlNet [34] on pre-trained stable-diffusion models, whereas PASD [32] enhances it by executing pixel-aware cross-attention. Both approaches have garnered considerable success in fixed resolution super-resolution but cannot be directly used for higher resolution. + +# 4.3 Ultra-High-Resolution Image Upsampler + +Currently, image generation methods fall short in generating ultra-high-resolution images owing to the constraints of memory and issues with training efficiency. Under these circumstances, MultiDiffusion [2] and Mixture of Diffusers [14] bind together multiple diffusion generation processes by dividing images into overlapping blocks, processing each separately, and then stitching them together, aiming to maintain continuity between blocks. However, because they only used the local weighted averaging for aggregation, it leads to a low interaction efficiency and makes it difficult to ensure the global consistency of the images. + +Given this concern, DemoFusion [7] and ScaleCrafter [9] adapt dilated policies including dilated sampling and dilated convolution kernels, aiming at acquiring more global information. These methods indeed achieve improvement on a global semantic level without additional training. However, the huge difference between training and generation leads these methods to easily produce illogical images. + +# 5 Conclusion + +In this work, we observe that the major obstacle to generating ultra-high-resolution images is the substantial memory occupied by model hidden states. Based on this, We propose Unidirectional Block Attention mechanism (UniBA) which can lower the space complexity by performing batch generation among blocks. With UniBA, we train Inf-DiT, a $4\times$ memory-efficient image upsampler which achieves state-of-the-art performance in both generation and superresolution tasks. + +# Acknowledgements + +The authors would like to thank Zhipu.AI for their GPU and human evaluation support, and the reviewers of ECCV for their valuable suggestions. + +# References + +1. Agustsson, E., Timofte, R.: Ntire 2017 challenge on single image super-resolution: Dataset and study. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 126-135 (2017) +2. Bar-Tal, O., Yariv, L., Lipman, Y., Dekel, T.: Multidiffusion: Fusing diffusion paths for controlled image generation (2023) +3. Chai, L., Gharbi, M., Shechtman, E., Isola, P., Zhang, R.: Any-resolution training for high-resolution image synthesis. In: European Conference on Computer Vision. pp. 170-188. Springer (2022) +4. Dai, Z., Yang, Z., Yang, Y., Carbonell, J., Le, Q.V., Salakhutdinov, R.: Transformer-xl: Attentive language models beyond a fixed-length context. arXiv preprint arXiv:1901.02860 (2019) +5. Dehghani, M., Djolonga, J., Mustafa, B., Padlewski, P., Heek, J., Gilmer, J., Steiner, A.P., Caron, M., Geirhos, R., Alabdulmohsin, I., et al.: Scaling vision transformers to 22 billion parameters. In: International Conference on Machine Learning. pp. 7480-7512. PMLR (2023) +6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020) + 7. Du, R., Chang, D., Hospedales, T., Song, Y.Z., Ma, Z.: Demofusion: Democratising high-resolution image generation with no $$$. arXiv preprint arXiv:2311.16973 (2023) +8. Guttenberg, N.: Diffusion with offset noise (2023), https://www.crosslabs.org/blog/diffusion-with-offset-noise +9. He, Y., Yang, S., Chen, H., Cun, X., Xia, M., Zhang, Y., Wang, X., He, R., Chen, Q., Shan, Y.: Scalecrafter: Tuning-free higher-resolution visual generation with diffusion models. In: The Twelfth International Conference on Learning Representations (2023) +0. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017) +1. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020) +2. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022) +3. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below. +4. Jiménez, Á.B.: Mixture of diffusers for scene composition and high resolution image generation. arXiv preprint arXiv:2302.02412 (2023) + +15. Karras, T., Aittala, M., Aila, T., Laine, S.: Elucidating the design space of diffusion-based generative models. Advances in Neural Information Processing Systems 35, 26565-26577 (2022) +16. Lin, X., He, J., Chen, Z., Lyu, Z., Fei, B., Dai, B., Ouyang, W., Qiao, Y., Dong, C.: Diffbir: Towards blind image restoration with generative diffusion prior. arXiv preprint arXiv:2308.15070 (2023) +17. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023) +18. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023) +19. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) +20. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022) +21. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022) +22. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015) +23. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022) +24. Sahara, C., Ho, J., Chan, W., Salimans, T., Fleet, D.J., Norouzi, M.: Image superresolution via iterative refinement. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(4), 4713-4726 (2022) +25. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5b: An open large-scale dataset for training next generation image-text models. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022), https://openreview.net/forum?id=M3Y74vmsMcY +26. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015) +27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020) +28. Su, J., Ahmed, M., Lu, Y., Pan, S., Bo, W., Liu, Y.: Roformer: Enhanced transformer with rotary position embedding. Neurocomputing 568, 127063 (2024) +29. Wang, J., Yue, Z., Zhou, S., Chan, K.C., Loy, C.C.: Exploiting diffusion prior for real-world image super-resolution. arXiv preprint arXiv:2305.07015 (2023) +30. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind super-resolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021) + +31. Wu, X., Hao, Y., Sun, K., Chen, Y., Zhu, F., Zhao, R., Li, H.: Human preference score v2: A solid benchmark for evaluating human preferences of text-to-image synthesis. arXiv preprint arXiv:2306.09341 (2023) +32. Yang, T., Ren, P., Xie, X., Zhang, L.: Pixel-aware stable diffusion for realistic image super-resolution and personalized stylization. arXiv preprint arXiv:2308.14469 (2023) +33. Zhang, K., Liang, J., Van Gool, L., Timofte, R.: Designing a practical degradation model for deep blind image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4791-4800 (2021) +34. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023) \ No newline at end of file diff --git a/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./images.zip b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./images.zip new file mode 100644 index 0000000000000000000000000000000000000000..4bcc88b6afc03444bf2d5df273ccb1ebf5f2d4d1 --- /dev/null +++ b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d6eb743735295405b5b16b59d8951427c5424065a8091fff84dd951f65ffba43 +size 620709 diff --git a/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./layout.json b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./layout.json new file mode 100644 index 0000000000000000000000000000000000000000..0a8cc002b08c02d8d06185636e00fdc6839e1226 --- /dev/null +++ b/2024/Inf-DiT_ Upsampling any-resolution image with memory-efficient diffusion transformer./layout.json @@ -0,0 +1,8744 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 135, + 111, + 478, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 111, + 478, + 148 + ], + "spans": [ + { + "bbox": [ + 135, + 111, + 478, + 148 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient Diffusion Transformer" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "spans": [ + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": "Zhuoyi Yang" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{1,\\star}" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": ", Heyang Jiang" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": ", Wenyi Hong" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": ", Jiayan Teng" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": ", Wendi Zheng" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": ", Yuxiao Dong" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": ", Ming Ding" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "text", + "content": ", and Jie Tang" + }, + { + "bbox": [ + 172, + 173, + 439, + 205 + ], + "type": "inline_equation", + "content": "^{1,\\star\\star}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 236, + 213, + 376, + 225 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 236, + 213, + 376, + 225 + ], + "spans": [ + { + "bbox": [ + 236, + 213, + 376, + 225 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 236, + 213, + 376, + 225 + ], + "type": "text", + "content": " Tsinghua University " + }, + { + "bbox": [ + 236, + 213, + 376, + 225 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 236, + 213, + 376, + 225 + ], + "type": "text", + "content": " Zhipu.AI" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 257, + 481, + 467 + ], + "blocks": [ + { + "bbox": [ + 133, + 257, + 481, + 467 + ], + "lines": [ + { + "bbox": [ + 133, + 257, + 481, + 467 + ], + "spans": [ + { + "bbox": [ + 133, + 257, + 481, + 467 + ], + "type": "image", + "image_path": "b58341a639221084995c7019aa52b18851bfe1e779ef1ece88dd9c57ee46b952.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 475, + 482, + 498 + ], + "lines": [ + { + "bbox": [ + 130, + 475, + 482, + 498 + ], + "spans": [ + { + "bbox": [ + 130, + 475, + 482, + 498 + ], + "type": "text", + "content": "Fig. 1: Selected ultra-high-resolution upsampling examples of Inf-DiT, based on SDXL, DALL-E 3, and real images." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 159, + 514, + 455, + 635 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 514, + 455, + 635 + ], + "spans": [ + { + "bbox": [ + 159, + 514, + 455, + 635 + ], + "type": "text", + "content": "Abstract. Diffusion models have shown remarkable performance in image generation in recent years. However, due to a quadratic increase in memory during generating ultra-high-resolution images (e.g. " + }, + { + "bbox": [ + 159, + 514, + 455, + 635 + ], + "type": "inline_equation", + "content": "4096 \\times 4096" + }, + { + "bbox": [ + 159, + 514, + 455, + 635 + ], + "type": "text", + "content": "), the resolution of generated images is often limited to " + }, + { + "bbox": [ + 159, + 514, + 455, + 635 + ], + "type": "inline_equation", + "content": "1024 \\times 1024" + }, + { + "bbox": [ + 159, + 514, + 455, + 635 + ], + "type": "text", + "content": ". In this work, we propose a unidirectional block attention mechanism that can adaptively adjust the memory overhead during the inference process and handle global dependencies. Building on this module, we adopt the DiT structure for upsampling and develop an infinite super-resolution model capable of upsampling images of various shapes and resolutions. Comprehensive experiments show that our model achieves SOTA performance in generating ultra-high-resolution images in both machine and" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 132, + 643, + 405, + 654 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 643, + 405, + 654 + ], + "spans": [ + { + "bbox": [ + 132, + 643, + 405, + 654 + ], + "type": "text", + "content": "* Done as intern at Zhipu AI, yangzy22@mails.tsinghua.edu.cn" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 654, + 345, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 654, + 345, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 654, + 345, + 665 + ], + "type": "text", + "content": "\\*\\* Corresponding author jietang@tsinghua.edu.cn" + } + ] + } + ], + "index": 7 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 159, + 117, + 455, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 117, + 455, + 152 + ], + "spans": [ + { + "bbox": [ + 159, + 117, + 455, + 152 + ], + "type": "text", + "content": "human evaluation. Compared to commonly used UNet structures, our model can save more than " + }, + { + "bbox": [ + 159, + 117, + 455, + 152 + ], + "type": "inline_equation", + "content": "5 \\times" + }, + { + "bbox": [ + 159, + 117, + 455, + 152 + ], + "type": "text", + "content": " memory when generating " + }, + { + "bbox": [ + 159, + 117, + 455, + 152 + ], + "type": "inline_equation", + "content": "4096 \\times 4096" + }, + { + "bbox": [ + 159, + 117, + 455, + 152 + ], + "type": "text", + "content": " images. The project URL is https://github.com/THUDM/Inf-DiT." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 159, + 161, + 455, + 183 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 161, + 455, + 183 + ], + "spans": [ + { + "bbox": [ + 159, + 161, + 455, + 183 + ], + "type": "text", + "content": "Keywords: diffusion model " + }, + { + "bbox": [ + 159, + 161, + 455, + 183 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 161, + 455, + 183 + ], + "type": "text", + "content": " ultra-high-resolution generation " + }, + { + "bbox": [ + 159, + 161, + 455, + 183 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 161, + 455, + 183 + ], + "type": "text", + "content": " super-resolution" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 206, + 230, + 219 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 206, + 230, + 219 + ], + "spans": [ + { + "bbox": [ + 132, + 206, + 230, + 219 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 233, + 334, + 389 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 233, + 334, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 233, + 334, + 389 + ], + "type": "text", + "content": "Recent years have witnessed rapid advancements in diffusion models, which significantly propelling the field of image generation and editing forward. Despite the advancements, a critical limitation persists: the resolution of images produced by existing image diffusion models is generally confined to " + }, + { + "bbox": [ + 130, + 233, + 334, + 389 + ], + "type": "inline_equation", + "content": "1024 \\times 1024" + }, + { + "bbox": [ + 130, + 233, + 334, + 389 + ], + "type": "text", + "content": " pixels or lower, posing a significant challenge for generating ultra-high-resolution images, which are indispensable in various real-world applications including intricate design projects, advertising, and the creation of posters and wallpapers, etc." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 390, + 334, + 473 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 390, + 334, + 473 + ], + "spans": [ + { + "bbox": [ + 130, + 390, + 334, + 473 + ], + "type": "text", + "content": "A commonly used approach for generating high resolution is cascaded generation [12], which first produces a low-resolution image, then applies multiple upsampling models to increase the image's resolution step by step. This approach breaks down the generation of high-resolution images into multiple tasks." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "spans": [ + { + "bbox": [ + 130, + 473, + 482, + 521 + ], + "type": "text", + "content": "Based on the results generated in the previous stage, the models in the later stages only need to perform local generation. Building upon the cascaded structure, both DALL-E2 [21] and Imagen [23] can effectively generate images with 1024 resolution." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 521, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 521, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 521, + 483, + 666 + ], + "type": "text", + "content": "The biggest challenge for upsampling to much higher resolution images is the significant GPU memory demands. For example, if utilizing the widely-adopted U-Net architecture such as SDXL [18] for image inference (see Figure 2), we observe a dramatic escalation in memory consumption with increasing resolution. Specifically, generating a " + }, + { + "bbox": [ + 130, + 521, + 483, + 666 + ], + "type": "inline_equation", + "content": "4096 \\times 4096" + }, + { + "bbox": [ + 130, + 521, + 483, + 666 + ], + "type": "text", + "content": " resolution image, which comprises over 16 million pixels requires more than 80GB of memory, exceeding the capacities of standard RTX 4090 or A100 graphics cards. Furthermore, the process of training models for high-resolution image generation exacerbates these demands, as it necessitates additional memory for storing gradients, optimizer states, etc. LDM [21] reduces the memory consumption by utilizing Variational Autoencoder(VAE) to compress images and generating images in a smaller latent space. However, it is also emphasized that an excessively high compression ratio can" + } + ] + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 342, + 268, + 470, + 396 + ], + "blocks": [ + { + "bbox": [ + 342, + 268, + 470, + 396 + ], + "lines": [ + { + "bbox": [ + 342, + 268, + 470, + 396 + ], + "spans": [ + { + "bbox": [ + 342, + 268, + 470, + 396 + ], + "type": "image", + "image_path": "c0509925ec2f889469d5f205d56ca6f9c0fc87d8f19b4e83f5ed2b15fce2fcad.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 339, + 407, + 482, + 451 + ], + "lines": [ + { + "bbox": [ + 339, + 407, + 482, + 451 + ], + "spans": [ + { + "bbox": [ + 339, + 407, + 482, + 451 + ], + "type": "text", + "content": "Fig. 2: Comparison of memory usage during inference at different resolutions between our model and the SDXL architecture." + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_caption" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 140 + ], + "type": "text", + "content": "substantially deteriorate the quality of generation, imposing severe limitations on the reduction of memory consumption." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "spans": [ + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "text", + "content": "We observe that one common and critical problem among the aforementioned models is the necessity to input the entire image to the model, which requires keeping " + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "inline_equation", + "content": "O(N^2)" + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "text", + "content": " hidden states in memory, where " + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "text", + "content": " is the width (height) of the image. Based on this observation, we propose a Unidirectional Block Attention (UniBA) algorithm that can dramatically reduce the space complexity of generation from " + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "inline_equation", + "content": "O(N^2)" + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "inline_equation", + "content": "O(N)" + }, + { + "bbox": [ + 130, + 140, + 482, + 319 + ], + "type": "text", + "content": ", increasing the highest available resolution for a large margin (Fig. ②). Specifically, in every diffusion step, we split the image into blocks and perform a sequential batch generation order among them, where each batch simultaneously produces a subset of the blocks, and any amount of blocks can be generated in parallel as long as the memory restriction allows. It is worth noting that, though the model only inputs part of image into the model at the same time, UniBA successfully preserves the ability to interact with hidden states of faraway blocks and maintain high-level semantic consistency. This is different from other block-based generation methods such as [2,14,29] that only interact with blocks in pixel space or compressed latent space." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 319, + 482, + 426 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 319, + 482, + 426 + ], + "spans": [ + { + "bbox": [ + 130, + 319, + 482, + 426 + ], + "type": "text", + "content": "Based on this algorithm, we optimize diffusion transformer (DiT) and train a model named Inf-DiT, which is capable of upsampling images of varying resolution and shape. Furthermore, we design several techniques including providing global image embedding to enhance the global semantic consistency and offer zero-shot text control ability, and provision of all neighboring low-resolution(LR) blocks through cross-attention mechanisms to further enhance the local consistency. Evaluation results show that Inf-DiT achieved significantly superior results compared to other high-resolution generative models in both machine and human evaluation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 146, + 427, + 382, + 438 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 427, + 382, + 438 + ], + "spans": [ + { + "bbox": [ + 146, + 427, + 382, + 438 + ], + "type": "text", + "content": "To summarize, our main contributions are as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 135, + 446, + 481, + 578 + ], + "type": "list", + "angle": 0, + "index": 9, + "blocks": [ + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "spans": [ + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "text", + "content": "1. We propose Unidirectional Block Attention (UniBA) algorithm, which reduces the minimum memory consumption from " + }, + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "inline_equation", + "content": "O(N^2)" + }, + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "inline_equation", + "content": "O(N)" + }, + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "text", + "content": " during inference, where " + }, + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 136, + 446, + 481, + 506 + ], + "type": "text", + "content": " represents the edge length. This mechanism is also capable of adapting to various memory restrictions by adjusting the number of blocks generated in parallel, trading off between memory and time overhead." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 136, + 506, + 481, + 553 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 506, + 481, + 553 + ], + "spans": [ + { + "bbox": [ + 136, + 506, + 481, + 553 + ], + "type": "text", + "content": "2. Based on these methods, we train an image upsampling diffusion model, Inf-DiT, a 700M model capable of upsampling images of varying resolutions and shapes. Inf-DiT achieves state-of-the-art performance in both machine (HPDv2 and DIV2K datasets) and human evaluation." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 135, + 554, + 481, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 554, + 481, + 578 + ], + "spans": [ + { + "bbox": [ + 135, + 554, + 481, + 578 + ], + "type": "text", + "content": "3. We design multiple techniques to further enhance local and global consistency, and offer a zero-shot ability for flexible text control." + } + ] + } + ], + "index": 8 + } + ], + "sub_type": "text" + }, + { + "bbox": [ + 132, + 596, + 233, + 611 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 596, + 233, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 596, + 233, + 611 + ], + "type": "text", + "content": "2 Methodology" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 621, + 364, + 634 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 621, + 364, + 634 + ], + "spans": [ + { + "bbox": [ + 131, + 621, + 364, + 634 + ], + "type": "text", + "content": "2.1 Unidirectional Block Attention (UniBA)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "We observe that the critical obstacle for generating ultra-high resolution images is memory limitation. As the resolution of the image increases, the corresponding" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 143, + 112, + 282, + 219 + ], + "blocks": [ + { + "bbox": [ + 143, + 112, + 282, + 219 + ], + "lines": [ + { + "bbox": [ + 143, + 112, + 282, + 219 + ], + "spans": [ + { + "bbox": [ + 143, + 112, + 282, + 219 + ], + "type": "image", + "image_path": "ed01a9034763f6c5c49e227eabdc43edbf244491e811b04ed9f7199832d1fb48.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 226, + 482, + 282 + ], + "lines": [ + { + "bbox": [ + 130, + 226, + 482, + 282 + ], + "spans": [ + { + "bbox": [ + 130, + 226, + 482, + 282 + ], + "type": "text", + "content": "Fig. 3: Left: Unidirectional block attention. In our implementation, each block directly depends on the three blocks in each layer: the blocks in the upper left corner, on the left, and on the top. Right: The inference process of Inf-DiT. Inf-DiT generates " + }, + { + "bbox": [ + 130, + 226, + 482, + 282 + ], + "type": "inline_equation", + "content": "n \\times n" + }, + { + "bbox": [ + 130, + 226, + 482, + 282 + ], + "type": "text", + "content": " block each time, based on the memory size. During this process, only the KV-cache of the blocks that subsequent blocks depend on are stored in memory." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 311, + 114, + 413, + 219 + ], + "blocks": [ + { + "bbox": [ + 311, + 114, + 413, + 219 + ], + "lines": [ + { + "bbox": [ + 311, + 114, + 413, + 219 + ], + "spans": [ + { + "bbox": [ + 311, + 114, + 413, + 219 + ], + "type": "image", + "image_path": "094d53558cea53806d215b695134efd39dbe2bd76c6609ccb734a39cb2279432.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 421, + 198, + 465, + 206 + ], + "lines": [ + { + "bbox": [ + 421, + 198, + 465, + 206 + ], + "spans": [ + { + "bbox": [ + 421, + 198, + 465, + 206 + ], + "type": "text", + "content": "Parallel Size: " + }, + { + "bbox": [ + 421, + 198, + 465, + 206 + ], + "type": "inline_equation", + "content": "\\mathrm{n} = 2" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 421, + 118, + 470, + 178 + ], + "blocks": [ + { + "bbox": [ + 421, + 118, + 470, + 178 + ], + "lines": [ + { + "bbox": [ + 421, + 118, + 470, + 178 + ], + "spans": [ + { + "bbox": [ + 421, + 118, + 470, + 178 + ], + "type": "image", + "image_path": "40de5338aca2ed4e2d8d67bcf10d2a5ce2595fd9e8603c4fb06a1c580fea95d9.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "spans": [ + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "text", + "content": "hidden state's size within the network expands quadratically. For example, a single hidden state with the shape of " + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "inline_equation", + "content": "2048 \\times 2048 \\times 1280" + }, + { + "bbox": [ + 130, + 309, + 482, + 369 + ], + "type": "text", + "content": " in only one layer requires 20GB of memory, making it formidable to generate very large images. How to avoid storing the entire image's hidden state in memory becomes the key issue." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "spans": [ + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "text", + "content": "Our main idea is to divide an image " + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "inline_equation", + "content": "\\pmb{x} \\in \\mathbb{R}^{H \\times W \\times C}" + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "text", + "content": " into blocks " + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "inline_equation", + "content": "\\pmb{x}_b \\in \\mathbb{R}^{h \\times w \\times B^2 \\times C}" + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "inline_equation", + "content": "B" + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "text", + "content": " is block size and " + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "inline_equation", + "content": "h = \\frac{H}{B}, w = \\frac{W}{B}" + }, + { + "bbox": [ + 130, + 370, + 487, + 468 + ], + "type": "text", + "content": ". When the image is fed into the network, the channel size and resolution of a block may change, but the layout and the relative positional relationships between blocks will remain unchanged. If there is a way to apply sequential batch generation of blocks where each batch simultaneously produces a subset of the blocks, only a small number of block hidden states have to be kept in memory simultaneously, making it possible to generate ultra-high-resolution images." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "spans": [ + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "text", + "content": "Here we define that " + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "inline_equation", + "content": "\\mathrm{block}_{\\mathrm{A}}" + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "text", + "content": " is dependent on " + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "inline_equation", + "content": "\\mathrm{block}_{\\mathrm{B}}" + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "text", + "content": " if the generation of " + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "inline_equation", + "content": "\\mathrm{block}_{\\mathrm{A}}" + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "text", + "content": " involves the hidden state of " + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "inline_equation", + "content": "\\mathrm{block}_{\\mathrm{B}}" + }, + { + "bbox": [ + 130, + 469, + 483, + 625 + ], + "type": "text", + "content": " in computation. It can be observed that the dependencies between blocks are bidirectional in most previous structures (UNet, DiT, etc.), in which case all blocks in the image must be generated simultaneously. Take UNet as an example: two adjacent elements in neighboring blocks use each other's hidden state in the convolution operation, therefore all pairs of neighboring blocks must be generated simultaneously. Given the aim to save the memory of blocks' hidden states, we hope to devise an algorithm that allows the blocks in the same image to be divided into several batches for generation, with each batch only needing to generate a portion of the blocks at the same time, and the batches are generated in sequence. Generally, an image generation algorithm can perform such a sequential batch generation among blocks if it meets the following conditions:" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 136, + 641, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 136, + 641, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 136, + 641, + 482, + 666 + ], + "type": "text", + "content": "1. The generative dependency between blocks are unidirectional, and can form a directed acyclic graph (DAG)." + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 135, + 116, + 482, + 152 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 116, + 482, + 152 + ], + "spans": [ + { + "bbox": [ + 135, + 116, + 482, + 152 + ], + "type": "text", + "content": "2. Each block has only a few direct (1st-order) dependencies on other blocks, since the hidden states of the block and its direct dependencies should simultaneously be kept in the memory." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 161, + 481, + 185 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 161, + 481, + 185 + ], + "spans": [ + { + "bbox": [ + 132, + 161, + 481, + 185 + ], + "type": "text", + "content": "Furthermore, to ensure consistency across the whole image, it also required that the blocks have a large enough receptive field to manage long-range dependencies." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 186, + 482, + 281 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 186, + 482, + 281 + ], + "spans": [ + { + "bbox": [ + 130, + 186, + 482, + 281 + ], + "type": "text", + "content": "According to the conditions and analysis above, we choose an efficient implementation illustrated in Fig. 3. Unidirectional Block Attention(UniBA). For each layer, every block directly depends on three 1st-order neighboring blocks: the block on the top, on the left, and in the upper left corner. For example, if we adopt Diffusion Transformer (DiT) architecture which is the base architecture of Inf-DiT, the dependency between blocks is attention operation, where the query vectors of each block interact with the key, value vectors of 4 blocks: 3 blocks located to its upper left and itself, illustrated in Fig. 3." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 146, + 282, + 454, + 294 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 282, + 454, + 294 + ], + "spans": [ + { + "bbox": [ + 146, + 282, + 454, + 294 + ], + "type": "text", + "content": "Formally, the UniBA process in the transformer can be formulated as" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 164, + 316, + 481, + 331 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 316, + 481, + 331 + ], + "spans": [ + { + "bbox": [ + 164, + 316, + 481, + 331 + ], + "type": "interline_equation", + "content": "Q = z _ {(i, j)} ^ {n} W ^ {Q}, \\tag {1}", + "image_path": "1756c8116cef8213d6f449bb52cb6882b9f2c5f0577c4af70270b5cf6e49a8ec.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 162, + 334, + 481, + 349 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 162, + 334, + 481, + 349 + ], + "spans": [ + { + "bbox": [ + 162, + 334, + 481, + 349 + ], + "type": "interline_equation", + "content": "\\boldsymbol {K} = \\left[ \\boldsymbol {z} _ {(i, j)} ^ {n} + \\boldsymbol {P} _ {1}; \\boldsymbol {z} _ {(i - 1, j)} ^ {n} + \\boldsymbol {P} _ {2}; \\boldsymbol {z} _ {(i, j - 1)} ^ {n} + \\boldsymbol {P} _ {3}; \\boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} + \\boldsymbol {P} _ {4} \\right] \\boldsymbol {W} ^ {K}, \\tag {2}", + "image_path": "cc2b5390f774c7fd44407ed6d4443ebf29ab472c26fee8e8071aee5a9d947dbf.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 164, + 351, + 480, + 366 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 164, + 351, + 480, + 366 + ], + "spans": [ + { + "bbox": [ + 164, + 351, + 480, + 366 + ], + "type": "interline_equation", + "content": "\\boldsymbol {V} = \\left[ \\boldsymbol {z} _ {(i, j)} ^ {n}; \\boldsymbol {z} _ {(i - 1, j)} ^ {n}; \\boldsymbol {z} _ {(i, j - 1)} ^ {n}; \\boldsymbol {z} _ {(i - 1, j - 1)} ^ {n} \\right] \\boldsymbol {W} ^ {V}, \\tag {3}", + "image_path": "509f68722747ff73ac57e3fa8378f2d50bf16c0a94b75a7ed6858d5a4eeef1c1.jpg" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 151, + 368, + 481, + 384 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 151, + 368, + 481, + 384 + ], + "spans": [ + { + "bbox": [ + 151, + 368, + 481, + 384 + ], + "type": "interline_equation", + "content": "\\boldsymbol {z} _ {(i, j)} ^ {n + 1} = \\operatorname {F F N} (\\operatorname {A t t e n t i o n} (\\boldsymbol {Q}, \\boldsymbol {K}, \\boldsymbol {V})), \\tag {4}", + "image_path": "da4ebff70f79ab48be7d32505685f39944eccd2adb3c800ceb0a93ebd5a7801d.jpg" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "spans": [ + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "inline_equation", + "content": "\\mathbf{z}_{(i,j)}^n" + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "text", + "content": " is the hidden states of the block at row " + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "inline_equation", + "content": "i" + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "text", + "content": ", column " + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "inline_equation", + "content": "j" + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "text", + "content": " in layer " + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "inline_equation", + "content": "P_i" + }, + { + "bbox": [ + 132, + 392, + 481, + 441 + ], + "type": "text", + "content": " is the block-level relative position encoding. We also implement an efficient approach to apply UniBA for full image in pytorch style, which is attached in the Appendix [A]." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 441, + 482, + 512 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 441, + 482, + 512 + ], + "spans": [ + { + "bbox": [ + 130, + 441, + 482, + 512 + ], + "type": "text", + "content": "Note that, though each block only attends to a few number of neighboring blocks in each layer, as features propagate layer by layer, blocks can indirectly interact with faraway blocks, thereby capturing both long- and short-range relationships. Our design shares a similar spirit with the natural language model Transformer-XL [4], which can be viewed as a special form of ours in one dimension case." + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 533, + 483, + 640 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 533, + 483, + 640 + ], + "spans": [ + { + "bbox": [ + 130, + 533, + 483, + 640 + ], + "type": "text", + "content": "Inference process with O(N) Memory Consumption Although our method can generate each block sequentially, it differs from auto-regressive generative models, in which the next block depends on the final output of the previous block. Any number of blocks can also be generated in parallel in our model, as long as the union of their dependent blocks has been generated. Based on this property, we implement a simple but effective inference process. As illustrated in Fig. 3, we generate " + }, + { + "bbox": [ + 130, + 533, + 483, + 640 + ], + "type": "inline_equation", + "content": "n \\times n" + }, + { + "bbox": [ + 130, + 533, + 483, + 640 + ], + "type": "text", + "content": " blocks at once, from the top-left to bottom-right. After generating a set of blocks, we discard hidden states i.e. KV-cache that are no longer used and append newly generated KV-cache to the memory." + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "It can be easily proved that the number of block KV-cache retained in memory during the process is always " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\leq w + n" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": ". Assume the space needed by the" + } + ] + } + ], + "index": 13 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 154, + 90, + 448, + 103 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 154, + 90, + 448, + 103 + ], + "spans": [ + { + "bbox": [ + 154, + 90, + 448, + 103 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 101 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": "model when generating a single block is " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "M_{1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ", the space for one block's KV-cache is " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "M_{2}" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ", and other essential space consumption (such as storing the raw input image) is " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "C" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ", then the maximum space usage of the inference process is " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "n^{2}M_{1} + (w + n)M_{2} + C" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ". When " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": " is much smaller than " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ", the memory consumption is directly proportional to " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ". If " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "w" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": " is bigger than " + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "inline_equation", + "content": "h" + }, + { + "bbox": [ + 130, + 116, + 482, + 187 + ], + "type": "text", + "content": ", we can easily change the trajectory of generation to column-major." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "text", + "content": "In practical terms, despite the total FLOPs of generation remaining constant for various values of " + }, + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "text", + "content": ", due to the overhead such as operator initialization time and memory allocation time, the generation time decreases when " + }, + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "text", + "content": " increases. Therefore, it's optimal to choose the largest " + }, + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 188, + 482, + 237 + ], + "type": "text", + "content": " allowed by the memory limitation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 255, + 291, + 266 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 255, + 291, + 266 + ], + "spans": [ + { + "bbox": [ + 132, + 255, + 291, + 266 + ], + "type": "text", + "content": "2.2 Basic Model Architecture" + } + ] + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 134, + 293, + 482, + 423 + ], + "blocks": [ + { + "bbox": [ + 134, + 293, + 482, + 423 + ], + "lines": [ + { + "bbox": [ + 134, + 293, + 482, + 423 + ], + "spans": [ + { + "bbox": [ + 134, + 293, + 482, + 423 + ], + "type": "image", + "image_path": "a8281b6a4f2c616be054ef390f8767278784c29a08229d431d5c38bd0948277b.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 430, + 483, + 455 + ], + "lines": [ + { + "bbox": [ + 130, + 430, + 483, + 455 + ], + "spans": [ + { + "bbox": [ + 130, + 430, + 483, + 455 + ], + "type": "text", + "content": "Fig. 4: (Left) Overall architecture of Inf-DiT. (Right) The inner structure of Inf-DiT block. We do not depict the Layernorm that originally existed in the DiT for simplicity." + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 479, + 482, + 576 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 576 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 576 + ], + "type": "text", + "content": "Figure 4 provides an overview of our model, Inf-DiT's architecture. The model uses a similar backbone as DiT [17], which applies Vision Transformer (ViT) [6] to diffusion models and proves its efficacy and scalability. In addition to its superior performance, compared to convolution-based architectures such as UNet [22], DiT solely utilizes attention as the mechanism of interaction among patches, which can conveniently implement unidirectional block attention. To adapt to unidirectional block attention and enhance the performance of upsampling, we make several modifications and optimizations detailed as follows." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": "Model input Inf-DiT first partitions input images into multiple non-overlapping blocks, which are further divided into patches with a side length equal to the patch size. Unlike DiT, considering the compression loss such as color shifting and detail loss, the patchifying of Inf-DiT is conducted in RGB pixel space instead of latent space. In the case of super-resolution by " + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": " times, Inf-DiT first upsamples the low-resolution RGB image condition by a factor of " + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "inline_equation", + "content": "f" + }, + { + "bbox": [ + 130, + 594, + 483, + 666 + ], + "type": "text", + "content": ", then concatenates it" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 139 + ], + "type": "text", + "content": "with the diffusion's noised input on the feature dimension before feeding it to the model." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "text", + "content": "Position Encoding Unlike UNet-based diffusion models [21] that can perceive positional relationships through convolution operations, all operations including self-attention, FFN in transformers are permutation invariant functions. Therefore, transformer-based models require auxiliary input of explicit positional information. We refer to the design of Rotary Positional Encoding (RoPE) [28], which performs well in the long context generation, and adapt it into two-dimensional form for image generation. Specifically, we divide channels of hidden states in half, one for encoding the x-coordinate and the other for the y-coordinate, and apply RoPE in both halves. We create a sufficiently large rope positional encoding table to ensure it meets the requirements during generation. To ensure all parts of the positional encoding table can be seen by the model during training, we employ the Random Starting Point: For each training image, we randomly assign a position " + }, + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "inline_equation", + "content": "(x,y)" + }, + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "text", + "content": " for the top-left corner of the image, instead of the default " + }, + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "inline_equation", + "content": "(0,0)" + }, + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "text", + "content": ". In addition, considering the difference in interactions within the same block and between different blocks, we additionally introduce block-level relative position encoding " + }, + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "inline_equation", + "content": "P_{1\\sim 4}" + }, + { + "bbox": [ + 130, + 155, + 482, + 360 + ], + "type": "text", + "content": ", which assigns a distinct learnable embedding based on the relative position before attention." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 374, + 311, + 387 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 374, + 311, + 387 + ], + "spans": [ + { + "bbox": [ + 131, + 374, + 311, + 387 + ], + "type": "text", + "content": "2.3 Global and Local Consistency" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 392, + 482, + 559 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 392, + 482, + 559 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 482, + 559 + ], + "type": "text", + "content": "Global Consistency with CLIP Image Embedding The global semantic information within low-resolution (LR) images, such as artistic style and object material, plays a crucial role during upsampling. However, compared to text-to-image generation models, the upsampling model has an additional task: understanding and analyzing the semantic information of LR images, which significantly increases the model's burden. This is particularly challenging when training without text data, as high-resolution images rarely have high-quality paired texts, making these aspects difficult for the model. We utilize the image encoder from pre-trained CLIP [19] to extract image embedding " + }, + { + "bbox": [ + 130, + 392, + 482, + 559 + ], + "type": "inline_equation", + "content": "I_{LR}" + }, + { + "bbox": [ + 130, + 392, + 482, + 559 + ], + "type": "text", + "content": " from low-resolution images, which we refer to as Semantic Input. Since CLIP is trained on massive image-text pairs from the Internet, its image encoder can effectively extract global information. We add the global semantic embedding to the time embedding of the diffusion transformer and input it into each layer, enabling the model to learn directly from high-level semantic information." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "spans": [ + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "text", + "content": "Another interesting advantage of global semantic embedding is that, using the aligned image-text latent space in CLIP, we can use text to guide the direction of generation, even if our model has not been trained on any image-text pairs. Given a positive prompt " + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "inline_equation", + "content": "C_{pos}" + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "text", + "content": " and a negative prompt " + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "inline_equation", + "content": "C_{neg}" + }, + { + "bbox": [ + 130, + 559, + 482, + 620 + ], + "type": "text", + "content": ", we can update our image embedding:" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 182, + 624, + 481, + 638 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 182, + 624, + 481, + 638 + ], + "spans": [ + { + "bbox": [ + 182, + 624, + 481, + 638 + ], + "type": "interline_equation", + "content": "\\tilde {\\boldsymbol {I}} _ {L R} = \\operatorname {n o r m} \\left(\\boldsymbol {I} _ {L R} + \\alpha (\\text {T e x t E n c} \\left(C _ {p o s}\\right) - \\text {T e x t E n c} \\left(C _ {n e g}\\right))\\right), \\tag {5}", + "image_path": "9ca74ecdba6a190baa63a0124eb16444fc9eb0b7d68b9ca33ea676aef325dd05.jpg" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\alpha" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": " can control the intensity of the guidance. During inference, we can simply use " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "\\tilde{I}_{LR}" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": " in place of " + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "inline_equation", + "content": "I_{LR}" + }, + { + "bbox": [ + 130, + 641, + 481, + 665 + ], + "type": "text", + "content": " as the global semantic embedding to conduct" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 91, + 481, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 141 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 141 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 141 + ], + "type": "text", + "content": "the control. For example, to get a more clear result set, " + }, + { + "bbox": [ + 132, + 116, + 482, + 141 + ], + "type": "inline_equation", + "content": "C_{pos} =" + }, + { + "bbox": [ + 132, + 116, + 482, + 141 + ], + "type": "text", + "content": " \"clear\" and " + }, + { + "bbox": [ + 132, + 116, + 482, + 141 + ], + "type": "inline_equation", + "content": "C_{neg} =" + }, + { + "bbox": [ + 132, + 116, + 482, + 141 + ], + "type": "text", + "content": " \"blur\" sometimes help." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 158, + 482, + 301 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 158, + 482, + 301 + ], + "spans": [ + { + "bbox": [ + 130, + 158, + 482, + 301 + ], + "type": "text", + "content": "Local Consistency with Nearby LR Cross Attention Although concatenating the LR image with noised input already provides a good inductive bias for models to learn the local correspondence between LR and HR images, there can still be continuity issues. The reason is that, there are several possibilities of upsampling for a given LR block, which require analysis in conjunction with several nearby LR blocks to select one solution, but the LR block to the right and below is unseen. To handle this problem, we introduce Nearby LR Cross Attention. In the first layer of the transformer, each block conducts cross-attention on the surrounding " + }, + { + "bbox": [ + 130, + 158, + 482, + 301 + ], + "type": "inline_equation", + "content": "3 \\times 3" + }, + { + "bbox": [ + 130, + 158, + 482, + 301 + ], + "type": "text", + "content": " LR blocks to capture nearby LR information. This approach significantly reduces the probability of generating discontinuous images. It is worth noting that this operation will not change our inference process since the entire LR image is known before generation." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 301, + 482, + 339 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 301, + 482, + 339 + ], + "spans": [ + { + "bbox": [ + 130, + 301, + 482, + 339 + ], + "type": "text", + "content": "We further devise techniques including continuity class-free guidance, LR-based noise initialization, QK Normalization, etc., which are elaborated in detail in the Appendix A." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 357, + 230, + 370 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 357, + 230, + 370 + ], + "spans": [ + { + "bbox": [ + 132, + 357, + 230, + 370 + ], + "type": "text", + "content": "3 Experiments" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 381, + 482, + 442 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 381, + 482, + 442 + ], + "spans": [ + { + "bbox": [ + 130, + 381, + 482, + 442 + ], + "type": "text", + "content": "In this section, we first introduce the detailed training process of Inf-DiT, then comprehensively evaluate Inf-DiT by both machine and human evaluation. The results show that Inf-DiT surpasses all baselines, excelling in both ultra-high-resolution image generation and upsampling tasks. Finally, we conduct ablation studies to validate the effectiveness of our design." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 460, + 243, + 472 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 460, + 243, + 472 + ], + "spans": [ + { + "bbox": [ + 132, + 460, + 243, + 472 + ], + "type": "text", + "content": "3.1 Training Details" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 479, + 482, + 565 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 479, + 482, + 565 + ], + "spans": [ + { + "bbox": [ + 130, + 479, + 482, + 565 + ], + "type": "text", + "content": "Datasets Our dataset comprises a subset of LAION-5B [25] with a resolution higher than " + }, + { + "bbox": [ + 130, + 479, + 482, + 565 + ], + "type": "inline_equation", + "content": "1024 \\times 1024" + }, + { + "bbox": [ + 130, + 479, + 482, + 565 + ], + "type": "text", + "content": " and aesthetic score higher than 5, and 100 thousand high-resolution wallpapers from the Internet. Following the previous works [20,23,30], we use fixed-size image crops of " + }, + { + "bbox": [ + 130, + 479, + 482, + 565 + ], + "type": "inline_equation", + "content": "512 \\times 512" + }, + { + "bbox": [ + 130, + 479, + 482, + 565 + ], + "type": "text", + "content": " resolution during training. Since upsampling can be conducted with local information only, it can be directly employed at higher resolution during inference, which is not easy for most generation models. The data processing details are illustrated in Appendix A.2" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": "Training settings During training, We set block size " + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "= 128" + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": " and patch size " + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "= 4" + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": ", which means every training image is divided into " + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "4 \\times 4" + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": " blocks and every block has " + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "32 \\times 32" + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": " patches. We employ the framework of EDM [15] for training, and set the upsampling factor to " + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "4 \\times" + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": ". Because the upsampling task is more concerned with the high-frequency details of images, we adjusted the mean and std of training noise distribution to " + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "-1.0" + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "inline_equation", + "content": "1.4" + }, + { + "bbox": [ + 130, + 582, + 482, + 666 + ], + "type": "text", + "content": ". To address overflow problem during training, we employed BF16 format due to its broader numerical range. Our" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 166 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 166 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 166 + ], + "type": "text", + "content": "CLIP model is a ViT-L/16 pre-trained on Datacomp dataset [13]. Since the CLIP can only process images with " + }, + { + "bbox": [ + 130, + 115, + 482, + 166 + ], + "type": "inline_equation", + "content": "224 \\times 224" + }, + { + "bbox": [ + 130, + 115, + 482, + 166 + ], + "type": "text", + "content": " resolution, we first resize LR images to " + }, + { + "bbox": [ + 130, + 115, + 482, + 166 + ], + "type": "inline_equation", + "content": "224 \\times 224" + }, + { + "bbox": [ + 130, + 115, + 482, + 166 + ], + "type": "text", + "content": " and then input them to CLIP. Other hyperparameters are listed in the Appendix A." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 160, + 185, + 455, + 385 + ], + "blocks": [ + { + "bbox": [ + 160, + 185, + 455, + 385 + ], + "lines": [ + { + "bbox": [ + 160, + 185, + 455, + 385 + ], + "spans": [ + { + "bbox": [ + 160, + 185, + 455, + 385 + ], + "type": "image", + "image_path": "451031df1a544b67af8de388f0cbc6263d4aaeb6c478cb56a9cd24f77d4162d3.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 171, + 387, + 444, + 396 + ], + "lines": [ + { + "bbox": [ + 171, + 387, + 444, + 396 + ], + "spans": [ + { + "bbox": [ + 171, + 387, + 444, + 396 + ], + "type": "text", + "content": "Direct Patch Scalecrafter BSRGAN Demofusion Inf-DiT" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 132, + 396, + 481, + 407 + ], + "lines": [ + { + "bbox": [ + 132, + 396, + 481, + 407 + ], + "spans": [ + { + "bbox": [ + 132, + 396, + 481, + 407 + ], + "type": "text", + "content": "Fig. 5: Qualitative comparison of different methods in detail at " + }, + { + "bbox": [ + 132, + 396, + 481, + 407 + ], + "type": "inline_equation", + "content": "2048 \\times 2048" + }, + { + "bbox": [ + 132, + 396, + 481, + 407 + ], + "type": "text", + "content": " resolution" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 450, + 261, + 462 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 450, + 261, + 462 + ], + "spans": [ + { + "bbox": [ + 132, + 450, + 261, + 462 + ], + "type": "text", + "content": "3.2 Machine Evaluation" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 472, + 482, + 510 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 472, + 482, + 510 + ], + "spans": [ + { + "bbox": [ + 130, + 472, + 482, + 510 + ], + "type": "text", + "content": "In this part, we conduct quantitative comparisons of Inf-DiT against state-of-the-art methodologies on ultra-high-resolution image generation tasks. The baselines encompass two main categories of high-resolution generation: 1. Direct" + } + ] + } + ], + "index": 7 + }, + { + "type": "table", + "bbox": [ + 135, + 562, + 482, + 663 + ], + "blocks": [ + { + "bbox": [ + 130, + 529, + 482, + 552 + ], + "lines": [ + { + "bbox": [ + 130, + 529, + 482, + 552 + ], + "spans": [ + { + "bbox": [ + 130, + 529, + 482, + 552 + ], + "type": "text", + "content": "Table 1: Quantitative comparison results with state-of-the-art methods of super resolution on DIV2K dataset. The best results are marked in bold." + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 562, + 482, + 663 + ], + "lines": [ + { + "bbox": [ + 135, + 562, + 482, + 663 + ], + "spans": [ + { + "bbox": [ + 135, + 562, + 482, + 663 + ], + "type": "table", + "html": "
SettingMethodFID ↓FIDcrop ↓PSNR ↑SSIM ↑
Variable resolutionBSRGAN35.0143.225.90.73
Real-ESRGAN35.5127.625.20.72
Inf-DiT(Ours)20.276.526.30.74
Fix resolution (512x512)StableSR74.8112.622.00.60
Inf-DiT(Ours)38.683.324.60.67
Fix resolution (256x256)LDM152.6-23.90.66
Inf-DiT(Ours)86.8-24.60.67
", + "image_path": "d11798ffcbc9e5ae533434529c6247af647691f4b709c2274af4faf526b1c24e.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 167, + 114, + 447, + 351 + ], + "blocks": [ + { + "bbox": [ + 167, + 114, + 447, + 351 + ], + "lines": [ + { + "bbox": [ + 167, + 114, + 447, + 351 + ], + "spans": [ + { + "bbox": [ + 167, + 114, + 447, + 351 + ], + "type": "image", + "image_path": "35dd8180f8fb13cf861a890ec221cbbf52dff5644ae4c39b63995f3d53d81aa0.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 132, + 352, + 481, + 363 + ], + "lines": [ + { + "bbox": [ + 132, + 352, + 481, + 363 + ], + "spans": [ + { + "bbox": [ + 132, + 352, + 481, + 363 + ], + "type": "text", + "content": "Fig. 6: Qualitative comparison of different methods in detail at " + }, + { + "bbox": [ + 132, + 352, + 481, + 363 + ], + "type": "inline_equation", + "content": "4096 \\times 4096" + }, + { + "bbox": [ + 132, + 352, + 481, + 363 + ], + "type": "text", + "content": " resolution" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 385, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 385, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 385, + 482, + 482 + ], + "type": "text", + "content": "high-resolution image generation, including Direct Inference of SDXL [18], MultiDiffusion [2], ScaleCrafter [9], and 2. High-resolution image generation based on super-resolution techniques, including BSRGAN [33], DemoFusion [7]. We employ the FID (Fréchet Inception Distance) [10] to evaluate the quality of ultra-high-resolution generation, which is widely used to evaluate the perceptual quality of images in image generation tasks [17,21,23]. To further validate the super-resolution ability of our model, we additionally benchmark it against renowned super-resolution models over classic super-resolution tasks." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "spans": [ + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": "Ultra-High-Resolution Generation We use the test set of HPDv2 [31] for evaluation, which allows for a comprehensive evaluation of the model's generative capabilities (3200 prompts) across various domains and styles (\"Animation\", \"Concept-art\", \"Painting\", and \"Photo\"). We test on two resolutions: " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "2048^2" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "4096^2" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": ". For super-resolution-based models, we first use SDXL to generate a " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "1024^2" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " resolution image and upsample it without text. Although Inf-DiT was trained in a setting with " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "4 \\times" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " upsample, we find that it can generalize well to upsampling ratios lower than training. Therefore, for " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "2048^2" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " generation, we directly resize the LR image from " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "1024^2" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "2048^2" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " and concatenate it with the noise input. As for the metrics, we use FID to assess how closely generated images mimic real image distributions, and the real images are randomly sampled from LAION-5B. However, the original implementation of FID downsamples the input image to " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "299 \\times 299" + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "text", + "content": " before the feature extraction, which ignores critical high-resolution details. Therefore, inspired by [37], we additionally adopted the idea of " + }, + { + "bbox": [ + 130, + 498, + 482, + 668 + ], + "type": "inline_equation", + "content": "\\mathrm{FID}_{\\mathrm{crop}}" + } + ] + } + ], + "index": 5 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 135, + 157, + 481, + 251 + ], + "blocks": [ + { + "bbox": [ + 131, + 114, + 482, + 148 + ], + "lines": [ + { + "bbox": [ + 131, + 114, + 482, + 148 + ], + "spans": [ + { + "bbox": [ + 131, + 114, + 482, + 148 + ], + "type": "text", + "content": "Table 2: Quantitative comparison results with state-of-the-art methods of ultra-high-resolution generation on HPDV2 dataset. The best results are marked in bold, and the second best results are marked by underline." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 157, + 481, + 251 + ], + "lines": [ + { + "bbox": [ + 135, + 157, + 481, + 251 + ], + "spans": [ + { + "bbox": [ + 135, + 157, + 481, + 251 + ], + "type": "table", + "html": "
Method2048 × 20484096 × 4096Mean ↓
FID ↓FIDcrop ↓FID ↓FIDcrop ↓
Direct Inference92.292.3OOMOOM92.3
MultiDiffusion99.7109.3OOMOOM104.5
SDXL+BSRGAN66.381.766.085.074.8
ScaleCrafter79.995.5115.1153.3111.0
DemoFusion67.572.070.882.673.2
SDXL+Inf-DiT(Ours)66.071.967.076.270.3
", + "image_path": "01d9780228acb034492f1e26eac59f21e8f30f49be9ce718e4c388d8f8e97ef0.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 277, + 480, + 300 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 277, + 480, + 300 + ], + "spans": [ + { + "bbox": [ + 130, + 277, + 480, + 300 + ], + "type": "text", + "content": "and randomly cropped " + }, + { + "bbox": [ + 130, + 277, + 480, + 300 + ], + "type": "inline_equation", + "content": "299 \\times 299" + }, + { + "bbox": [ + 130, + 277, + 480, + 300 + ], + "type": "text", + "content": " patches from high-resolution images for FID evaluation." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 300, + 481, + 373 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 300, + 481, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 300, + 481, + 373 + ], + "type": "text", + "content": "The results in Tab. 2 demonstrate that our model achieves state-of-the-art (SOTA) in three out of four metrics. This showcases our model's exceptional ability to generate high-resolution details and harmonious global information. Note that our model is capable of being applied to all generative models. Examples from other models are listed in the Appendix D. We have also evaluated the model' time-space consumption in Appendix A." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 389, + 481, + 496 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 389, + 481, + 496 + ], + "spans": [ + { + "bbox": [ + 130, + 389, + 481, + 496 + ], + "type": "text", + "content": "Super-Resolution In addition to its ability to generate high-resolution images, Inf-DiT can also be used as a classic super-resolution model. We conduct the evaluation on DIV2k valid dataset [1] which contains multiple real-world high-resolution images in different scenarios. Following [21, 24], we fix image degradation to bicubic interpolation with " + }, + { + "bbox": [ + 130, + 389, + 481, + 496 + ], + "type": "inline_equation", + "content": "4 \\times" + }, + { + "bbox": [ + 130, + 389, + 481, + 496 + ], + "type": "text", + "content": " downsampling. Before comparing with fix-resolution models LDM [21] and StableSR [29], we center-crop specific-sized patches from the high-resolution image as ground truth. Throughout this process, we utilize both perceptual (FID, " + }, + { + "bbox": [ + 130, + 389, + 481, + 496 + ], + "type": "inline_equation", + "content": "\\mathrm{FID}_{\\mathrm{crop}}" + }, + { + "bbox": [ + 130, + 389, + 481, + 496 + ], + "type": "text", + "content": ") and fidelity (PSNR, SSIM) metrics to ensure a detailed and comprehensive assessment." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 497, + 481, + 545 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 497, + 481, + 545 + ], + "spans": [ + { + "bbox": [ + 130, + 497, + 481, + 545 + ], + "type": "text", + "content": "As demonstrated in Tab. [1], our model achieves state-of-the-art across all metrics. This shows that, as a super-resolution model, ours not only excels in performing super-resolution at arbitrary scales but also preserves global and detailed information while restoring results that closely resemble the LR images." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 562, + 255, + 574 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 562, + 255, + 574 + ], + "spans": [ + { + "bbox": [ + 131, + 562, + 255, + 574 + ], + "type": "text", + "content": "3.3 Human Evaluation" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 581, + 482, + 666 + ], + "type": "text", + "content": "To further evaluate Inf-DiT and more accurately reflect its generative quality from a human perspective, we conduct a human evaluation. The whole evaluation process is detailed in Appendix C. We ultimately collected 3,600 comparisons. As depicted in Fig. 7, our model outperforms the other 3 methods in all the 3 criteria. It is particularly noteworthy that each of the other three models ranks relatively lower on at least one of the three evaluation criteria, while Inf-DiT achieves the highest score on all three criteria: detail authenticity, global" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 155, + 90, + 448, + 102 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 480, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 134, + 115, + 479, + 229 + ], + "blocks": [ + { + "bbox": [ + 134, + 115, + 479, + 229 + ], + "lines": [ + { + "bbox": [ + 134, + 115, + 479, + 229 + ], + "spans": [ + { + "bbox": [ + 134, + 115, + 479, + 229 + ], + "type": "image", + "image_path": "47dcb02ae09065c79cf3226de5f5aa298643596eedb7618895e358bea4f1502c.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 232, + 482, + 266 + ], + "lines": [ + { + "bbox": [ + 130, + 232, + 482, + 266 + ], + "spans": [ + { + "bbox": [ + 130, + 232, + 482, + 266 + ], + "type": "text", + "content": "Fig. 7: Human evaluation results. After participants rank the images from different models, We assign scores from 4 to 1 to models in order and finally calculate the average of all the results. Inf-DiT gets the highest scores in all three categories." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 287, + 482, + 323 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 287, + 482, + 323 + ], + "spans": [ + { + "bbox": [ + 130, + 287, + 482, + 323 + ], + "type": "text", + "content": "coherence, and consistency with low-resolution input. This indicates that our model is the only one capable of excelling in both high-resolution generation and super-resolution tasks simultaneously." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 131, + 338, + 269, + 353 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 338, + 269, + 353 + ], + "spans": [ + { + "bbox": [ + 131, + 338, + 269, + 353 + ], + "type": "text", + "content": "3.4 Iterative Upsampling" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "text", + "content": "Since our model can upsample images of arbitrary resolution, it's a natural idea to test if the model can iteratively upsample images generated by itself. In this study, we experiment on generating a " + }, + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "inline_equation", + "content": "2048^{2}" + }, + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "text", + "content": " resolution image from a " + }, + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "inline_equation", + "content": "32^{2}" + }, + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "text", + "content": " resolution image, " + }, + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "inline_equation", + "content": "64 \\times" + }, + { + "bbox": [ + 130, + 357, + 483, + 489 + ], + "type": "text", + "content": " upscale, through three times of iterative upsampling. Figure 8 illustrates two cases of this process. In the first case, the model successfully produces a high-resolution image after three stages of upsampling. It generates details of different frequencies in different resolution upsampling: the contour of the face, the shape of the eyeball, and individual eyelashes. However, it is hard for the model to correct inaccuracies generated in earlier stages, leading to the accumulation of errors. An example of this issue is demonstrated in the second sample. We leave this problem for our future work." + } + ] + } + ], + "index": 6 + }, + { + "type": "table", + "bbox": [ + 135, + 529, + 272, + 586 + ], + "blocks": [ + { + "bbox": [ + 200, + 508, + 414, + 520 + ], + "lines": [ + { + "bbox": [ + 200, + 508, + 414, + 520 + ], + "spans": [ + { + "bbox": [ + 200, + 508, + 414, + 520 + ], + "type": "text", + "content": "Table 3: Ablation study on " + }, + { + "bbox": [ + 200, + 508, + 414, + 520 + ], + "type": "inline_equation", + "content": "{2048} \\times {2048}" + }, + { + "bbox": [ + 200, + 508, + 414, + 520 + ], + "type": "text", + "content": " resolution." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 135, + 529, + 272, + 586 + ], + "lines": [ + { + "bbox": [ + 135, + 529, + 272, + 586 + ], + "spans": [ + { + "bbox": [ + 135, + 529, + 272, + 586 + ], + "type": "table", + "html": "
MethodFIDFIDcrop
Ours66.071.9
w/o Nearby LR Attention66.773.6
w/o Semantic Input66.272.8
Inner Block Attention66.383.7
", + "image_path": "0109f20845e9bf70529cb0230b0b68cea25f129e8d24b5b611e3b1be35e050ff.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "type": "table", + "bbox": [ + 283, + 530, + 479, + 586 + ], + "blocks": [ + { + "bbox": [ + 283, + 530, + 479, + 586 + ], + "lines": [ + { + "bbox": [ + 283, + 530, + 479, + 586 + ], + "spans": [ + { + "bbox": [ + 283, + 530, + 479, + 586 + ], + "type": "table", + "html": "
Block Size3264128256512
Memory Usage (GB)23.323.323.323.523.7
FID276271268265246
Inference Time (s)576169112269
", + "image_path": "3fe090f95cf28181384483d4ce8d4730849184bf354742238547fd755c25e479.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "table_body" + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 623, + 239, + 635 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 623, + 239, + 635 + ], + "spans": [ + { + "bbox": [ + 132, + 623, + 239, + 635 + ], + "type": "text", + "content": "3.5 Ablation Study" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "We conduct all ablation studies with " + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "inline_equation", + "content": "2048^{2}" + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": " resolution on HPDV2 dataset, with results in Tab. 3. To verify our method, we separately 1. remove the Global" + } + ] + } + ], + "index": 11 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 115, + 220, + 123 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 115, + 220, + 123 + ], + "spans": [ + { + "bbox": [ + 133, + 115, + 220, + 123 + ], + "type": "text", + "content": "Iterative Upsampling: Good Case" + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 133, + 123, + 482, + 286 + ], + "blocks": [ + { + "bbox": [ + 133, + 123, + 482, + 286 + ], + "lines": [ + { + "bbox": [ + 133, + 123, + 482, + 286 + ], + "spans": [ + { + "bbox": [ + 133, + 123, + 482, + 286 + ], + "type": "image", + "image_path": "0c7f26ac8648a63ed5f60e074487f8d875633fbe04ce1456bd9c56a461488fd4.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 293, + 482, + 338 + ], + "lines": [ + { + "bbox": [ + 130, + 293, + 482, + 338 + ], + "spans": [ + { + "bbox": [ + 130, + 293, + 482, + 338 + ], + "type": "text", + "content": "Fig. 8: Generated samples of iterative upsampling. Top: Inf-DiT can upsample an image generated by itself several times, and generate details of different frequencies at corresponding resolution. Bottom: After failing to generate a pupil at the " + }, + { + "bbox": [ + 130, + 293, + 482, + 338 + ], + "type": "inline_equation", + "content": "128^{2}" + }, + { + "bbox": [ + 130, + 293, + 482, + 338 + ], + "type": "text", + "content": " resolution, it is difficult for subsequent upsampling stages to correct this error." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_caption" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 362, + 482, + 446 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 362, + 482, + 446 + ], + "spans": [ + { + "bbox": [ + 130, + 362, + 482, + 446 + ], + "type": "text", + "content": "Input, 2. remove Nearby LR attention and 3. remove the attention between blocks (Inner Block Attention setting). As a result, both the FID and " + }, + { + "bbox": [ + 130, + 362, + 482, + 446 + ], + "type": "inline_equation", + "content": "\\mathrm{FID}_{\\mathrm{crop}}" + }, + { + "bbox": [ + 130, + 362, + 482, + 446 + ], + "type": "text", + "content": " of the model get worse to varying degrees. We also conduct an ablation study to decide the optimal block size. The results show that as block size increases, the performance improves, but the time also increases. To trade-off, we chose 128 as the default setting. Further case studies and analysis are listed in the Appendix B." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 464, + 237, + 477 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 464, + 237, + 477 + ], + "spans": [ + { + "bbox": [ + 132, + 464, + 237, + 477 + ], + "type": "text", + "content": "4 Related Work" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 490, + 299, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 490, + 299, + 502 + ], + "spans": [ + { + "bbox": [ + 132, + 490, + 299, + 502 + ], + "type": "text", + "content": "4.1 Diffusion Image Generation" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 593 + ], + "type": "text", + "content": "Diffusion models have emerged as a spotlight in the realm of image generation, boasting an array of groundbreaking advancements in recent years. Initially introduced in 2015 [26], and further developed through works such as DDPM [11] and DDIM [27], these models leverage a stochastic diffusion process, conceptualized as a Markov chain, to convert a simple prior distribution, like Gaussian noise, into a complex data distribution. This methodology yield impressive outcomes in terms of the quality and diversity of generated images." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 594, + 482, + 630 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 594, + 482, + 630 + ], + "spans": [ + { + "bbox": [ + 130, + 594, + 482, + 630 + ], + "type": "text", + "content": "Recent enhancements have markedly elevated the generation capabilities of diffusion models. CDM [12] creates a cascade generation pipeline with multistage super-resolution models, which can be applied to large pretrained models [20, 23]." + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 630, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 630, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 630, + 482, + 665 + ], + "type": "text", + "content": "The introduction of Latent Diffusion Models (LDMs) [18,21] represents a pivotal extension, incorporating a latent space to boost both efficiency and scalability. Alongside these advancements, there has been significant progress in" + } + ] + } + ], + "index": 10 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 91, + 481, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 143 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 143 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 143 + ], + "type": "text", + "content": "the optimization of network architectures. The advent of Diffusion Transformers (DiT) [17] Replaces U-Net with ViT [6] for noise prediction." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 159, + 282, + 172 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 159, + 282, + 172 + ], + "spans": [ + { + "bbox": [ + 132, + 159, + 282, + 172 + ], + "type": "text", + "content": "4.2 Image Super-Resolution" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "spans": [ + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": "Given a low-resolution (LR) image " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "I_{LR}" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": " degraded from high-resolution (HR) observation " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "I_{HR}" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": ", image super-resolution (SR) aims to reconstruct a HR one " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "\\hat{I}_{HR}" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": ": " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "I_{LR} = D(I_{HR};\\delta)" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "\\hat{I}_{HR} = F(I_{LR};\\theta)" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": ". Here " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "D" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "F" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": " refer to degradation process and the super-resolution model. " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "\\delta" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "inline_equation", + "content": "\\theta" + }, + { + "bbox": [ + 130, + 181, + 482, + 338 + ], + "type": "text", + "content": " represent the parameters. In recent years, Blind SR has been a major focus, in which the degradation process is unknown and learnable. The representative methods are BSRGAN [33] and Real-ESRGAN [30]. Recently, diffusion-based SR methods have yielded exciting results. These works focus on finetuning pre-trained text-to-image diffusion models to take advantage of their excellent generative ability. Specifically, DiffBir [16] employs ControlNet [34] on pre-trained stable-diffusion models, whereas PASD [32] enhances it by executing pixel-aware cross-attention. Both approaches have garnered considerable success in fixed resolution super-resolution but cannot be directly used for higher resolution." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 356, + 366, + 369 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 356, + 366, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 356, + 366, + 369 + ], + "type": "text", + "content": "4.3 Ultra-High-Resolution Image Upsampler" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 378, + 482, + 474 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 378, + 482, + 474 + ], + "spans": [ + { + "bbox": [ + 130, + 378, + 482, + 474 + ], + "type": "text", + "content": "Currently, image generation methods fall short in generating ultra-high-resolution images owing to the constraints of memory and issues with training efficiency. Under these circumstances, MultiDiffusion [2] and Mixture of Diffusers [14] bind together multiple diffusion generation processes by dividing images into overlapping blocks, processing each separately, and then stitching them together, aiming to maintain continuity between blocks. However, because they only used the local weighted averaging for aggregation, it leads to a low interaction efficiency and makes it difficult to ensure the global consistency of the images." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 474, + 482, + 536 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 474, + 482, + 536 + ], + "spans": [ + { + "bbox": [ + 130, + 474, + 482, + 536 + ], + "type": "text", + "content": "Given this concern, DemoFusion [7] and ScaleCrafter [9] adapt dilated policies including dilated sampling and dilated convolution kernels, aiming at acquiring more global information. These methods indeed achieve improvement on a global semantic level without additional training. However, the huge difference between training and generation leads these methods to easily produce illogical images." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 555, + 220, + 567 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 555, + 220, + 567 + ], + "spans": [ + { + "bbox": [ + 132, + 555, + 220, + 567 + ], + "type": "text", + "content": "5 Conclusion" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "In this work, we observe that the major obstacle to generating ultra-high-resolution images is the substantial memory occupied by model hidden states. Based on this, We propose Unidirectional Block Attention mechanism (UniBA) which can lower the space complexity by performing batch generation among blocks. With UniBA, we train Inf-DiT, a " + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "inline_equation", + "content": "4\\times" + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": " memory-efficient image upsampler which achieves state-of-the-art performance in both generation and superresolution tasks." + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 211, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 211, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 211, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 140, + 480, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 140, + 480, + 163 + ], + "spans": [ + { + "bbox": [ + 132, + 140, + 480, + 163 + ], + "type": "text", + "content": "The authors would like to thank Zhipu.AI for their GPU and human evaluation support, and the reviewers of ECCV for their valuable suggestions." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 197, + 194 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 138, + 205, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 138, + 205, + 481, + 239 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 205, + 481, + 239 + ], + "spans": [ + { + "bbox": [ + 138, + 205, + 481, + 239 + ], + "type": "text", + "content": "1. Agustsson, E., Timofte, R.: Ntire 2017 challenge on single image super-resolution: Dataset and study. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops. pp. 126-135 (2017)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 239, + 481, + 261 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 239, + 481, + 261 + ], + "spans": [ + { + "bbox": [ + 138, + 239, + 481, + 261 + ], + "type": "text", + "content": "2. Bar-Tal, O., Yariv, L., Lipman, Y., Dekel, T.: Multidiffusion: Fusing diffusion paths for controlled image generation (2023)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 261, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 261, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 261, + 481, + 293 + ], + "type": "text", + "content": "3. Chai, L., Gharbi, M., Shechtman, E., Isola, P., Zhang, R.: Any-resolution training for high-resolution image synthesis. In: European Conference on Computer Vision. pp. 170-188. Springer (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 293, + 481, + 327 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 293, + 481, + 327 + ], + "spans": [ + { + "bbox": [ + 138, + 293, + 481, + 327 + ], + "type": "text", + "content": "4. Dai, Z., Yang, Z., Yang, Y., Carbonell, J., Le, Q.V., Salakhutdinov, R.: Transformer-xl: Attentive language models beyond a fixed-length context. arXiv preprint arXiv:1901.02860 (2019)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 327, + 481, + 370 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 327, + 481, + 370 + ], + "spans": [ + { + "bbox": [ + 138, + 327, + 481, + 370 + ], + "type": "text", + "content": "5. Dehghani, M., Djolonga, J., Mustafa, B., Padlewski, P., Heek, J., Gilmer, J., Steiner, A.P., Caron, M., Geirhos, R., Alabdulmohsin, I., et al.: Scaling vision transformers to 22 billion parameters. In: International Conference on Machine Learning. pp. 7480-7512. PMLR (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 370, + 481, + 414 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 370, + 481, + 414 + ], + "spans": [ + { + "bbox": [ + 138, + 370, + 481, + 414 + ], + "type": "text", + "content": "6. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2020)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 414, + 481, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 414, + 481, + 446 + ], + "spans": [ + { + "bbox": [ + 138, + 414, + 481, + 446 + ], + "type": "text", + "content": " 7. Du, R., Chang, D., Hospedales, T., Song, Y.Z., Ma, Z.: Demofusion: Democratising high-resolution image generation with no $$$. arXiv preprint arXiv:2311.16973 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 447, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 447, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 138, + 447, + 481, + 468 + ], + "type": "text", + "content": "8. Guttenberg, N.: Diffusion with offset noise (2023), https://www.crosslabs.org/blog/diffusion-with-offset-noise" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 468, + 481, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 468, + 481, + 512 + ], + "spans": [ + { + "bbox": [ + 138, + 468, + 481, + 512 + ], + "type": "text", + "content": "9. He, Y., Yang, S., Chen, H., Cun, X., Xia, M., Zhang, Y., Wang, X., He, R., Chen, Q., Shan, Y.: Scalecrafter: Tuning-free higher-resolution visual generation with diffusion models. In: The Twelfth International Conference on Learning Representations (2023)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 512, + 481, + 545 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 512, + 481, + 545 + ], + "spans": [ + { + "bbox": [ + 138, + 512, + 481, + 545 + ], + "type": "text", + "content": "0. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 138, + 545, + 481, + 567 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 545, + 481, + 567 + ], + "spans": [ + { + "bbox": [ + 138, + 545, + 481, + 567 + ], + "type": "text", + "content": "1. Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. Advances in neural information processing systems 33, 6840-6851 (2020)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 567, + 481, + 599 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 567, + 481, + 599 + ], + "spans": [ + { + "bbox": [ + 138, + 567, + 481, + 599 + ], + "type": "text", + "content": "2. Ho, J., Sahara, C., Chan, W., Fleet, D.J., Norouzi, M., Salimans, T.: Cascaded diffusion models for high fidelity image generation. The Journal of Machine Learning Research 23(1), 2249-2281 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 600, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 600, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 138, + 600, + 481, + 643 + ], + "type": "text", + "content": "3. Ilharco, G., Wortsman, M., Wightman, R., Gordon, C., Carlini, N., Taori, R., Dave, A., Shankar, V., Namkoong, H., Miller, J., Hajishirzi, H., Farhadi, A., Schmidt, L.: Openclip (Jul 2021). https://doi.org/10.5281/zenodo.5143773, https://doi.org/10.5281/zenodo.5143773, if you use this software, please cite it as below." + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 138, + 643, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 643, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 138, + 643, + 481, + 665 + ], + "type": "text", + "content": "4. Jiménez, Á.B.: Mixture of diffusers for scene composition and high resolution image generation. arXiv preprint arXiv:2302.02412 (2023)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 155, + 91, + 448, + 102 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 148 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 148 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 148 + ], + "type": "text", + "content": "15. Karras, T., Aittala, M., Aila, T., Laine, S.: Elucidating the design space of diffusion-based generative models. Advances in Neural Information Processing Systems 35, 26565-26577 (2022)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "spans": [ + { + "bbox": [ + 133, + 149, + 481, + 182 + ], + "type": "text", + "content": "16. Lin, X., He, J., Chen, Z., Lyu, Z., Fei, B., Dai, B., Ouyang, W., Qiao, Y., Dong, C.: Diffbir: Towards blind image restoration with generative diffusion prior. arXiv preprint arXiv:2308.15070 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 182, + 481, + 213 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 182, + 481, + 213 + ], + "spans": [ + { + "bbox": [ + 133, + 182, + 481, + 213 + ], + "type": "text", + "content": "17. Peebles, W., Xie, S.: Scalable diffusion models with transformers. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4195-4205 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 213, + 481, + 246 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 213, + 481, + 246 + ], + "spans": [ + { + "bbox": [ + 133, + 213, + 481, + 246 + ], + "type": "text", + "content": "18. Podell, D., English, Z., Lacey, K., Blattmann, A., Dockhorn, T., Müller, J., Penna, J., Rombach, R.: Sdxl: Improving latent diffusion models for high-resolution image synthesis. arXiv preprint arXiv:2307.01952 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 246, + 481, + 289 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 246, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 133, + 246, + 481, + 289 + ], + "type": "text", + "content": "19. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 289, + 481, + 320 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 289, + 481, + 320 + ], + "spans": [ + { + "bbox": [ + 132, + 289, + 481, + 320 + ], + "type": "text", + "content": "20. Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125 1(2), 3 (2022)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 320, + 481, + 354 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 320, + 481, + 354 + ], + "spans": [ + { + "bbox": [ + 132, + 320, + 481, + 354 + ], + "type": "text", + "content": "21. Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 10684-10695 (2022)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 354, + 481, + 397 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 354, + 481, + 397 + ], + "spans": [ + { + "bbox": [ + 132, + 354, + 481, + 397 + ], + "type": "text", + "content": "22. Ronneberger, O., Fischer, P., Brox, T.: U-net: Convolutional networks for biomedical image segmentation. In: Medical Image Computing and Computer-Assisted Intervention-MICCAI 2015: 18th International Conference, Munich, Germany, October 5-9, 2015, Proceedings, Part III 18. pp. 234-241. Springer (2015)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 397, + 481, + 440 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 397, + 481, + 440 + ], + "spans": [ + { + "bbox": [ + 132, + 397, + 481, + 440 + ], + "type": "text", + "content": "23. Sahara, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E.L., Ghasemipour, K., Gontijo Lopes, R., Karagol Ayan, B., Salimans, T., et al.: Photorealistic text-to-image diffusion models with deep language understanding. Advances in Neural Information Processing Systems 35, 36479-36494 (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 440, + 481, + 472 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 440, + 481, + 472 + ], + "spans": [ + { + "bbox": [ + 132, + 440, + 481, + 472 + ], + "type": "text", + "content": "24. Sahara, C., Ho, J., Chan, W., Salimans, T., Fleet, D.J., Norouzi, M.: Image superresolution via iterative refinement. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(4), 4713-4726 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 472, + 481, + 537 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 472, + 481, + 537 + ], + "spans": [ + { + "bbox": [ + 132, + 472, + 481, + 537 + ], + "type": "text", + "content": "25. Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C.W., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S.R., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: LAION-5b: An open large-scale dataset for training next generation image-text models. In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022), https://openreview.net/forum?id=M3Y74vmsMcY" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 537, + 481, + 569 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 537, + 481, + 569 + ], + "spans": [ + { + "bbox": [ + 132, + 537, + 481, + 569 + ], + "type": "text", + "content": "26. Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics. In: International conference on machine learning. pp. 2256-2265. PMLR (2015)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 569, + 481, + 590 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 569, + 481, + 590 + ], + "spans": [ + { + "bbox": [ + 132, + 569, + 481, + 590 + ], + "type": "text", + "content": "27. Song, J., Meng, C., Ermon, S.: Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502 (2020)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 590, + 481, + 612 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 590, + 481, + 612 + ], + "spans": [ + { + "bbox": [ + 132, + 590, + 481, + 612 + ], + "type": "text", + "content": "28. Su, J., Ahmed, M., Lu, Y., Pan, S., Bo, W., Liu, Y.: Roformer: Enhanced transformer with rotary position embedding. Neurocomputing 568, 127063 (2024)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 612, + 481, + 633 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 612, + 481, + 633 + ], + "spans": [ + { + "bbox": [ + 132, + 612, + 481, + 633 + ], + "type": "text", + "content": "29. Wang, J., Yue, Z., Zhou, S., Chan, K.C., Loy, C.C.: Exploiting diffusion prior for real-world image super-resolution. arXiv preprint arXiv:2305.07015 (2023)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 633, + 481, + 665 + ], + "type": "text", + "content": "30. Wang, X., Xie, L., Dong, C., Shan, Y.: Real-esrgan: Training real-world blind super-resolution with pure synthetic data. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 1905-1914 (2021)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 212, + 102 + ], + "type": "text", + "content": "Yang et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 249 + ], + "type": "list", + "angle": 0, + "index": 6, + "blocks": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "spans": [ + { + "bbox": [ + 132, + 116, + 482, + 149 + ], + "type": "text", + "content": "31. Wu, X., Hao, Y., Sun, K., Chen, Y., Zhu, F., Zhao, R., Li, H.: Human preference score v2: A solid benchmark for evaluating human preferences of text-to-image synthesis. arXiv preprint arXiv:2306.09341 (2023)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 150, + 482, + 182 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 150, + 482, + 182 + ], + "spans": [ + { + "bbox": [ + 132, + 150, + 482, + 182 + ], + "type": "text", + "content": "32. Yang, T., Ren, P., Xie, X., Zhang, L.: Pixel-aware stable diffusion for realistic image super-resolution and personalized stylization. arXiv preprint arXiv:2308.14469 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 183, + 481, + 216 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 183, + 481, + 216 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 481, + 216 + ], + "type": "text", + "content": "33. Zhang, K., Liang, J., Van Gool, L., Timofte, R.: Designing a practical degradation model for deep blind image super-resolution. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4791-4800 (2021)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 216, + 481, + 249 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 216, + 481, + 249 + ], + "spans": [ + { + "bbox": [ + 132, + 216, + 481, + 249 + ], + "type": "text", + "content": "34. Zhang, L., Rao, A., Agrawala, M.: Adding conditional control to text-to-image diffusion models. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 3836-3847 (2023)" + } + ] + } + ], + "index": 5 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 155, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 155, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 155, + 91, + 447, + 102 + ], + "type": "text", + "content": "Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient DiT" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 481, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file diff --git a/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_content_list.json b/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..6ef7bb8e572784201fb32826f7520e7a813fe577 --- /dev/null +++ b/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_content_list.json @@ -0,0 +1,1876 @@ +[ + { + "type": "text", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "text_level": 1, + "bbox": [ + 285, + 140, + 718, + 186 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Fangcen Liu $^{1}$ , Chenqiang Gao $^{2*}$ , Yaming Zhang $^{1}$ , Junjie Guo $^{1}$ , Jinghao Wang $^{2}$ , and Deyu Meng $^{3}$", + "bbox": [ + 272, + 210, + 727, + 243 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China. {liufc67, YummyZhang1989, gjj893866738} @ gmail.com", + "bbox": [ + 220, + 253, + 779, + 296 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "$^{2}$ School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen, Guangdong 518107, China. {gaochq6, wangjh298}@mail.sysu.edu.cn", + "bbox": [ + 235, + 296, + 763, + 324 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "3 School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, Shanxi, 710049, China, and School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China. dymeng@mail.xjtu.edu.cn", + "bbox": [ + 228, + 324, + 771, + 367 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract. In recent years, foundation models have swept the computer vision field, facilitating the advancement of various tasks within different modalities. However, effectively designing an infrared foundation model remains an open question. In this paper, we introduce InfMAE, a foundation model tailored specifically for the infrared modality. Initially, we present Inf30, an infrared dataset developed to mitigate the scarcity of large-scale data for self-supervised learning within the infrared vision community. Moreover, considering the intrinsic characteristics of infrared images, we design an information-aware masking strategy. It allows for a greater emphasis on the regions with richer information in infrared images during the self-supervised learning process, which is conducive to learning strong representations. Additionally, to enhance generalization capabilities in downstream tasks, we employ a multi-scale encoder for latent representation learning. Finally, we develop an infrared decoder to reconstruct images. Extensive experiments show that our proposed method InfMAE outperforms other supervised and self-supervised learning methods in three key downstream tasks: infrared image semantic segmentation, object detection, and small target detection.", + "bbox": [ + 259, + 404, + 743, + 654 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Keywords: Infrared Foundation Model $\\cdot$ Infrared Image Segmentation $\\cdot$ Infrared Object Detection $\\cdot$ Infrared Small Target Detection.", + "bbox": [ + 259, + 667, + 740, + 696 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Introduction", + "text_level": 1, + "bbox": [ + 215, + 722, + 375, + 739 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Infrared imaging plays a crucial role and finds extensive applications in low-light even dark and smoky conditions [9,25,60] since they utilize the thermal radiation of objects for imaging, which can effectively alleviate adverse effects caused by challenging environmental conditions. Currently, computer vision tasks in the", + "bbox": [ + 212, + 753, + 787, + 816 + ], + "page_idx": 0 + }, + { + "type": "page_footnote", + "text": "* Corresponding authors.", + "bbox": [ + 230, + 825, + 403, + 839 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "infrared vision community, such as object detection [32, 33], and semantic segmentation [28, 49], are explored by task-specific designed models. While these models can yield superior performance on individual tasks, they are often challenged by their limited generalizability.", + "bbox": [ + 212, + 146, + 787, + 207 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/8a534d0279e13261e6a3abc295b64660b24f473f65b4550bd126a0c3e0e9eab8.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 218, + 234, + 356, + 316 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/cb167c7f0f1ebec8d44cbd76c7aa1ddd353f95d984c3bba8e813cc3d17c963b8.jpg", + "image_caption": [ + "Visible Images", + "Fig. 1: Visual comparison of infrared and visible images. Compared to visible images, infrared images display diminished informational content due to their inherent lack of rich texture and color details. For example, objects such as zebra crossings, telephone poles, and road signs in the red box are often submerged in their surroundings due to their similar temperature to the surrounding environment." + ], + "image_footnote": [], + "bbox": [ + 220, + 320, + 354, + 398 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/7069e319b93afc0dbe0242cd6d34a687d542965864b8383484a1c37a0b5ed126.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 357, + 234, + 493, + 316 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/accb13b02f9d9135c834c63c18ed7dfd20e851b55fcab78cbde24b95d3225ccf.jpg", + "image_caption": [ + "Infrared Images" + ], + "image_footnote": [], + "bbox": [ + 357, + 320, + 493, + 398 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/2243030154816e792a53ad8469e050bafa922180e69c81dfc74e379c483e4d6a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 504, + 234, + 635, + 316 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/3cc80aefdccec70a28e56c63bcdbfc320c203c30da573b648035dfaefadd8765.jpg", + "image_caption": [ + "Visible Images" + ], + "image_footnote": [], + "bbox": [ + 504, + 319, + 635, + 398 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/1273077aef3256489b905d2721046212ad3f150933bd7d11a6feb22da00ab51c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 638, + 234, + 769, + 316 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/b0cf640024cd303c41724f236013f7f22039c5d262233d8f41ece268287654fa.jpg", + "image_caption": [ + "Infrared Images" + ], + "image_footnote": [], + "bbox": [ + 638, + 319, + 769, + 398 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The foundation model refers to a large, general deep learning model that learns extensive knowledge through pre-training on a large-scale dataset and can be adapted to various downstream tasks by fine-tuning or prompting [1, 3, 42]. The Transformer-based model like ViT [12] is one of the representative vision foundation models, which are trained on a large-scale dataset and outperforms the ResNet-based method [23] on the downstream tasks. To better learn the powerful representation of a foundation model from a large number of unlabeled data, self-supervised learning is the primary choice [31]. The self-supervised learning frameworks, such as BEiT [2], DINO [6], and Mask Autoencoders (MAE) [17], achieve impressive performance across various downstream vision tasks [29, 45]. Notably, the MAE [17] has verified superior representation learning ability and scalability. This model is pre-trained on the ImageNet-1K dataset [10]. Then, the pre-trained encoder of the MAE [17] serves as a sufficient feature extraction backbone, achieving excellent performance on classification, detection, and segmentation tasks. Following the self-supervised learning frameworks, pre-trained foundation models have emerged in various modalities, e.g., VideoMAE [50, 53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a comparable foundation model has not yet emerged in the infrared modality.", + "bbox": [ + 212, + 522, + 787, + 809 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Intuitively, a feasible solution is to directly employ the pre-trained visible MAE on infrared downstream tasks. However, as delineated in Section 5.6, our", + "bbox": [ + 212, + 809, + 787, + 839 + ], + "page_idx": 1 + }, + { + "type": "page_number", + "text": "2", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 1 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "experimental findings suggest this is suboptimal, primarily due to significant disparities in imaging characteristics between infrared and visible modalities. Fig. 1 illustrates these differences. We can observe that infrared images exhibit less information compared to visible images, which lack rich texture and color details. For instance, objects like zebra crossings and power lines in Fig. 1 lack color and texture information in infrared images, making them indistinguishable from the surrounding environment. These differences cause a noticeable gap between the infrared and visible modalities. The most straightforward strategy to mitigate this disparity is to train the MAE model on an extensive infrared dataset. However, there appears to be a limited availability of a large-scale dataset in the infrared modality. Consequently, it becomes important to build a large-scale infrared dataset to facilitate the training of an infrared foundation model. In this paper, we begin by gathering a large number of infrared images. Through image preprocessing like reducing redundancy, we finally obtain an infrared dataset named Inf30, which addresses the existing data scarcity within the infrared modality.", + "bbox": [ + 212, + 146, + 787, + 388 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Due to the less information on infrared images, directly applying the vanilla MAE [17] architecture to the infrared modality is also a feasible but not the optimal choice, as the experiment shows in Sections 5.2, 5.3 and 5.4. The vanilla MAE adopts the random mask strategy. Directly applying this strategy to infrared images may cause the masking tokens to focus more on the information-poor part which is less conducive to representation learning. Previous researches [21, 26] argued that masking tokens with rich semantic information could improve the representation learning ability of the self-supervised method, and introduced the semantic-guided masking strategy. However, these methods do not account for the unique characteristics of the infrared modality and require the addition of new semantic-aware branches in the frameworks.", + "bbox": [ + 212, + 390, + 787, + 555 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this paper, we propose a simple yet effective foundation model in the infrared modality named InfMAE that can be extensively generalized to downstream tasks, such as infrared semantic segmentation, object detection, and small target detection. To enhance the representation capabilities for infrared images, we design an information-aware masking strategy, which facilitates the selective masking of regions with richer information without designing an additional complex semantic awareness branch. In addition, we employ a multi-scale strategy to enhance generalization capabilities in downstream tasks. Finally, based on the characteristics of infrared images, we adopt a new infrared decoder module for image reconstruction.", + "bbox": [ + 212, + 559, + 787, + 708 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We summarize the main contributions of this paper as follows:", + "bbox": [ + 238, + 712, + 691, + 727 + ], + "page_idx": 2 + }, + { + "type": "list", + "sub_type": "text", + "list_items": [ + "- We collect and preprocess a large number of infrared images, and finally release an infrared dataset Inf30 for self-supervised learning, which consists of 305241 infrared images.", + "- We propose the InfMAE, a simple yet effective foundation model in the infrared modality. To the best of our knowledge, this is the first attempt to build a foundation model within the infrared modality." + ], + "bbox": [ + 225, + 746, + 782, + 835 + ], + "page_idx": 2 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 2 + }, + { + "type": "page_number", + "text": "3", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "- Considering the characteristics of infrared imaging, we design an information-aware masking strategy and an infrared decoder. These designs enhance the model's ability to learn strong representations.", + "bbox": [ + 225, + 146, + 784, + 190 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "- The experimental results show that the method proposed in this paper outperforms state-of-the-art methods, achieving the best performance in downstream tasks.", + "bbox": [ + 227, + 191, + 784, + 234 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 Related Work", + "text_level": 1, + "bbox": [ + 215, + 258, + 387, + 273 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.1 The Foundation Model", + "text_level": 1, + "bbox": [ + 215, + 287, + 452, + 303 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The foundation models are trained on a large-scale dataset in a self-supervised manner, making them adaptable for various downstream tasks [3]. The foundation model can be categorized into four categories based on different inputs: traditional models, textually prompted models, visually prompted models, and heterogeneous modalities-based models [1]. Traditional foundational models usually take only images as input, such as ResNet [19] based on convolutional neural networks, as well as ViT [12] based on the Transformer architecture. The textually prompted models like CLIP [42] and GPT-4 [39] took the textual prompt and the image as the inputs, and the textual prompt established correlations between text and images, contributing to achieving zero-shot transfer. The visually prompted models [22,37] could be prompted by various prompt types, e.g., text, bounding boxes, or a semantical mask to get the target segmentation. The heterogeneous modalities-based models usually combine the various prompt types and the aligned multiple paired modalities, e.g., image-audio, image-video, etc., to learn meaningful representations. The ImageBind [16] is the representative work. In this study, we attempt to explore the traditional foundation model in the infrared modality.", + "bbox": [ + 212, + 311, + 787, + 568 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 The Masked Image Modeling and Representation Learning", + "text_level": 1, + "bbox": [ + 215, + 589, + 748, + 606 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The Masked Image Modeling (MIM) [2,15,17,38] is an emerging self-supervised learning approach, i.e., by randomly masking a part of the input image and then reconstructing it. This learning method is simple yet effective in learning representations with high generality from a large-scale of data for downstream takes. BEiT [2] and MAE [17] are pioneering works. BEiT [2] used a bidirectional encoder representation to recover the original visual token based on the corrupted image patches. MAE [17] pre-trained the ViT encoder by randomly masking the image tokens, feeding the visible tokens into the encoder, and then reconstructing the masked tokens through the decoder. Based on MAE, pre-trained foundation models based on MIM learning have emerged in various modalities, e.g., VideoMAE [50,53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a MIM-based foundation model is not yet available in the infrared modality.", + "bbox": [ + 212, + 612, + 787, + 809 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In addition to extending MIM methods to other modalities, methods also focus on designing mask strategies and how to reconstruct images. Regarding the", + "bbox": [ + 215, + 809, + 785, + 839 + ], + "page_idx": 3 + }, + { + "type": "page_number", + "text": "4", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 3 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "masking strategy, methods like MST [30] and ATTMask [21] utilized attention maps to guide the masking strategy. SemMAE [26] used semantic information in images to select mask regions. UM-PVT [27] adopted a unified mask approach for masking learning. Regarding image reconstruction, some works [2, 11] adopted tokens produced by VQ-VAE [52] or its variants.", + "bbox": [ + 212, + 146, + 782, + 222 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this study, we explore a new masking strategy and decoder structure for infrared image reconstruction, according to the characteristics of infrared images.", + "bbox": [ + 212, + 222, + 782, + 252 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/e73bf355602b55c2366e96d44e8acf9385a7de81237fc8bf7fd822ad0ea9bfc1.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 217, + 279, + 308, + 345 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/777aa3966fb2a3f9da7d838cb7b7dbd1e292ff1ce8dceca608352b52ec272741.jpg", + "image_caption": [ + "Fig. 2: Some samples of the Inf30. The environments in the collected dataset encompass skies, seascapes, forests, urban areas, suburban areas, lawns, and so on. The objects include ships, vehicles, pedestrians, public facilities, residential buildings, and so on." + ], + "image_footnote": [], + "bbox": [ + 217, + 345, + 307, + 412 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/48c32df72a0d74728fd153588f64a84bb3bda584f3e680f19937ad91a43dc6f8.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 310, + 279, + 401, + 345 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/c3e260e6eb45467c206f6cf057bc4a1cca725a25274eefa8987dc31d5fb08aa2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 310, + 345, + 401, + 412 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/734bed7e205841562ec9f601d325905ffd6308f2c87b2e59efb1376a8f97dea1.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 403, + 279, + 500, + 345 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/b9aeef05d261f98793788829670e50421b1af207ce68199f4ae48acb9ce4aa64.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 403, + 345, + 500, + 412 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/17086b19529e712ea6e0e9ab33e78e6ed891078d19e3b4319d4ae9694b3a5b86.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 501, + 279, + 591, + 345 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/452c7ff5ec0d24bdf42e62f9eca18c0ddd01130a89220ca55e6c3f763e9f318c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 501, + 345, + 591, + 412 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/ba07ad74ac0a1c16c53556c73f8fb68bc35769d65a769e546c05f7652a6f290a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 594, + 279, + 689, + 345 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/2e9df8e1c36f024f8a7dd5b2e7334f4d6000739fa2f98f5b646501af506434a6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 594, + 345, + 689, + 412 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/5882c696047e05caff17625507909b1c1af1e229e932366c59e8e7585e7063f9.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 694, + 279, + 782, + 345 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/f11ac7e701e9c90689d8a669fa06eec361b809220cb791f99cc0f273db04ca6c.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 694, + 345, + 782, + 412 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 Pre-training Dataset Preparation: Inf30", + "text_level": 1, + "bbox": [ + 214, + 522, + 635, + 540 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 Collection and Preprocessing", + "text_level": 1, + "bbox": [ + 214, + 556, + 503, + 571 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A large-scale dataset is essential for training the foundation model. Hence, this study has constructed a dataset named Inf30. The diversity of the images is important for learning the generalized representation. Hence, we extensively collect about 500K of infrared images from various websites [13, 20, 24, 40, 44, 46, 56]. However, the quality of these images is uneven. For example, the images extracted from the same video exhibit significant similarity, leading to a reduction in image diversity. Additionally, some infrared images obtained from the internet pose challenges due to their extremely low resolution. Consequently, we initiate preprocessing all of the collected images to improve the quality of the infrared dataset.", + "bbox": [ + 212, + 582, + 787, + 733 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "As for the issue of high similarity in infrared images, we initially selected one image as the anchor. Subsequently, we eliminated those images that have a closely resembling scene with the anchor image and retained images that exhibit substantial dissimilarity. As for the issue of low resolution, we conducted data cleaning by removing images with both width and height of less than 20 pixels.", + "bbox": [ + 212, + 734, + 787, + 809 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "After collecting and preprocessing the infrared images, we finally obtained 305,241 images. As illustrated in Fig. 2, the scene in our dataset encompasses", + "bbox": [ + 214, + 809, + 787, + 839 + ], + "page_idx": 4 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 732, + 128 + ], + "page_idx": 4 + }, + { + "type": "page_number", + "text": "5", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "skies, seascapes, forests, urban areas, suburban areas, lawns, and schools, while the objects include various types of ships, vehicles, pedestrians, public facilities, and residential buildings. The minimum resolution of images is $40 \\times 23$ , and the maximum resolution of images is $6912 \\times 1024$ .", + "bbox": [ + 212, + 146, + 787, + 207 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 Detail Information Analysis", + "text_level": 1, + "bbox": [ + 214, + 228, + 493, + 244 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we analyze the detail richness of our Inf30 and the well-established ImageNet-1K [10]. We employ the information entropy to measure the information of an image, which can reflect the detail richness. The information entropy is defined as follows:", + "bbox": [ + 212, + 253, + 787, + 313 + ], + "page_idx": 5 + }, + { + "type": "equation", + "text": "\n$$\nH (X) = - \\sum_ {i = 1} ^ {n} P \\left(x _ {i}\\right) \\cdot \\log_ {2} \\left(P \\left(x _ {i}\\right)\\right), \\tag {1}\n$$\n", + "text_format": "latex", + "bbox": [ + 380, + 325, + 785, + 364 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $n$ is the number of brightness levels in the image, $x_{i}$ represents each brightness level, and $P(x_{i})$ is the probability of the brightness level in the image. We calculate the information entropy of images in the Inf30 and ImageNet-1K datasets. The average information entropy of Inf30 is 6.44, while the average information entropy of ImageNet-1K is 7.19. This reveals that the visible dataset exhibits richer information compared to the infrared image dataset.", + "bbox": [ + 212, + 368, + 787, + 458 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Recognizing the low information richness of infrared images, this study introduces an information-aware masking strategy to enhance the generalized representation learning ability of the foundation model.", + "bbox": [ + 212, + 459, + 785, + 503 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 Method", + "text_level": 1, + "bbox": [ + 214, + 526, + 331, + 542 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 Overview", + "text_level": 1, + "bbox": [ + 214, + 558, + 341, + 571 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As depicted in Fig. 3, the proposed InfMAE architecture consists of three principal modules: 1) the mask block generation module, 2) the multi-scale encoder module, and 3) the infrared decoder module. In the mask block generation module, we adopt an information-aware masking strategy on input tokens to get visible token IDs, mask_block1, and mask_block2, which are used in the multiscale encoder module. In the multi-scale encoder module, inspired by the MCMAE [15], we combine convolution and self-attention mechanisms to conduct multi-scale representation learning for the visible tokens. In the infrared decoder module, we integrate the multi-scale representation with the learned visible tokens for image reconstruction.", + "bbox": [ + 212, + 582, + 787, + 733 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.2 The Structure of the Proposed InfMAE", + "text_level": 1, + "bbox": [ + 214, + 753, + 591, + 771 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The Mask Block Generation Module Since infrared images lack color and texture details, employing a random masking strategy, as done by the vanilla MAE [17], would result in excessive masking of information-poor regions. This could undermine the network's capacity to develop robust representations from", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 5 + }, + { + "type": "page_number", + "text": "6", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 5 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/1a27b3dbe4b83c9a2df19f43175e9b09bad68621fb4e9488e97cc65ddbb399fe.jpg", + "image_caption": [ + "Fig. 3: The framework of the proposed InfMAE. It contains three modules: the mask block generation module, the multi-scale encoder module, and the infrared decoder module. The features connected by the red dashed lines in the multi-scale encoder module are fed into the infrared decoder module." + ], + "image_footnote": [], + "bbox": [ + 220, + 143, + 781, + 303 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "infrared images. Hence, this study proposes an information-aware masking strategy that can dynamically adjust mask tokens according to the image context.", + "bbox": [ + 212, + 402, + 782, + 431 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Given an input image $x \\in \\mathbb{R}^{H \\times W \\times C}$ , where $C, H,$ and $W$ denote the number of channels, height, and width respectively. $x$ is first input into the information analysis part to get the intensity-wise feature map. The information analysis part is a convolution with both the kernel size and stride set to 16. Then we calculate the mean value of the intensity-wise feature map along the channel dimension and obtain the gray value map $I \\in \\mathbb{R}^{\\frac{H}{16} \\times \\frac{W}{16}}$ . After that, the gray value map is flattened to $N$ tokens, $N = \\frac{H}{16} \\times \\frac{W}{16}$ . Meanwhile, these tokens are arranged in descending order of their gray values, where a higher value means that the information is richer. As depicted in the lower left corner of Fig. 3, each box represents a token, and the number within the box is the sorted token ID. After that, we perform the information-aware masking strategy on the sorted tokens, with a sampling stride $S$ . Specifically, we sample the sorted tokens at an interval of $S$ . The sampled tokens are the visible tokens and the rest are masked tokens. Meanwhile, we record the orders of the visible tokens' IDs and the masked tokens' IDs. These IDs are used as a reference for generating mask blocks.", + "bbox": [ + 212, + 433, + 787, + 674 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For mask block generation, we first obtain a binary value mask template through the ID mapping according to the sorted tokens IDs. In the mask template in Fig. 3, the white area is the visible token while the black area is the masked token. Then we up-sample the mask template two and four times to get the mask_block2 and mask_block1 for the following multi-scale learning in the multi-scale encoder module.", + "bbox": [ + 212, + 676, + 787, + 767 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The Multi-scale Encoder Module Inspired by previous works like MCMAE [15] and ConvNeXt [54], we introduce a multi-scale encoder for visible token learning. This multi-scale encoder module mainly contains three encoder layers,", + "bbox": [ + 214, + 794, + 787, + 840 + ], + "page_idx": 6 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 6 + }, + { + "type": "page_number", + "text": "7", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "which are two CNN-based encoders, named encoder layer 1 and encoder layer 2, and one Transorfmer-based encoder, named encoder layer 3. Such three encoder layers can output feature maps with multi-scale spatial resolution, which are $F_{1} \\in \\mathbb{R}^{\\frac{H}{4} \\times \\frac{W}{4} \\times C_{1}}$ , $F_{2} \\in \\mathbb{R}^{\\frac{H}{8} \\times \\frac{W}{8} \\times C_{2}}$ , and $T_{s} \\in N_{v} \\times C_{3}$ , respectively. The $N_{v}$ is the number of the visible tokens. Specifically, we first input the image $x$ into the patch embedding 1 and encoder layer 1 to obtain the feature map $F_{1}$ . It should be noted that after the patch embedding 1 and token-wise convolution, we obtain the feature map $E_{1} \\in \\mathbb{R}^{\\frac{H}{4} \\times \\frac{W}{4} \\times C_{1}}$ , and then we dot $E_{1}$ and mask_block1 which are obtained in mask block generation module to mask the original feature. Finally, we follow [15] and adopt the convolutional attention (Conv Attention) and FFN. Same as encoder layer 1, the $F_{1}$ is inputted into patch embedding 2 and encoder layer 2 to obtain the feature maps $F_{2} \\in \\mathbb{R}^{\\frac{H}{8} \\times \\frac{W}{8} \\times C_{2}}$ .", + "bbox": [ + 212, + 146, + 787, + 327 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "After the patch embedding 3 and a linear operation, the $F_{2}$ is flattened into $N$ tokens $T\\in N\\times C_3$ . Then, we select the visible tokens from the $N$ tokens according to the visible token IDs obtained by the mask block generation module. Finally, we use the encoder layer 3 whose structure is the same as the ViT [12] encoder layer, and obtain the learned visible tokens $T_{s}\\in N_{v}\\times C_{3}$ .", + "bbox": [ + 212, + 328, + 787, + 405 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The Infrared Decoder Module In this study, we combine the multi-scale visible tokens and mask tokens and take them into the decoder for image reconstruction. Specifically, we normalize the multi-scale features $F_{1}$ and $F_{2}$ to the same size and then flatten them into the same shape with $T$ . After that, we obtain the visible tokens $T_{1}$ and $T_{2}$ according to the visible token IDs. Then, we add all the values of visible tokens $T_{1}, T_{2}$ , and $T_{s}$ and concat both masked tokens and visible tokens along the first dimension. Meanwhile, we restore the order of these tokens based on the ID number in the mask block generation module. We feed the restored tokens into the decoder for image reconstruction. It is worth noting that infrared images lack many details and color information, so in this study, we set the infrared decoder depth to 2 for image reconstruction, whose structure is the same as the decoder of MAE [17].", + "bbox": [ + 212, + 426, + 787, + 608 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The loss function measures the Mean Square Error (MSE) between the masked patches of reconstructed image $y$ and the original image $x$ . The MSE loss is defined as follows:", + "bbox": [ + 212, + 609, + 787, + 654 + ], + "page_idx": 7 + }, + { + "type": "equation", + "text": "\n$$\n\\mathcal {L} _ {m s e} = \\frac {1}{M} \\sum_ {i = 1} ^ {M} \\left(y _ {i} - x _ {i}\\right) ^ {2}, \\tag {2}\n$$\n", + "text_format": "latex", + "bbox": [ + 411, + 667, + 785, + 709 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where the $M$ means the number of images.", + "bbox": [ + 214, + 713, + 529, + 729 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 InfMAE for Downstream Tasks", + "text_level": 1, + "bbox": [ + 214, + 752, + 522, + 767 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "After the self-supervised pre-training, InfMAE learns multi-scale feature maps, which can be employed for existing infrared semantic segmentation, object detection, and small target detection methods. To finetune InfMAE for these downstream tasks, we extract the $F_{1}$ and $F_{2}$ obtained by the encoder layer 1 and", + "bbox": [ + 212, + 779, + 787, + 840 + ], + "page_idx": 7 + }, + { + "type": "page_number", + "text": "8", + "bbox": [ + 217, + 114, + 228, + 126 + ], + "page_idx": 7 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 359, + 127 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "encoder layer 2. Meanwhile, we reshape $T_{s}$ to the feature $F_{3} \\in \\mathbb{R}^{\\frac{H}{16} \\times \\frac{W}{16} \\times C_{3}}$ and downsample the $F_{3}$ to $F_{4} \\in \\mathbb{R}^{\\frac{H}{32} \\times \\frac{W}{32} \\times C_{4}}$ by a convolution layer. It should be noted that when finetuning InfMAE for these downstream tasks, the shape of $T_{s}$ is $N \\times C_{3}$ . Finally, $F_{1}, F_{2}, F_{3}$ , and $F_{4}$ are input into the downstream methods.", + "bbox": [ + 215, + 143, + 784, + 205 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 Experiment", + "text_level": 1, + "bbox": [ + 215, + 234, + 364, + 253 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Initially, the proposed InfMAE is subjected to self-supervised pre-training using the released Inf30 dataset. Then, to assess the generalizability and robustness of InfMAE, it is applied to a series of downstream tasks. Finally, a series of ablation studies are conducted to confirm the efficacy and validity of the InfMAE framework.", + "bbox": [ + 215, + 271, + 785, + 345 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.1 Pre-training Setup", + "text_level": 1, + "bbox": [ + 215, + 375, + 415, + 391 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The framework of the proposed InfMAE is implemented using pytorch 1.12.0 and accelerated by CUDA 11.6 on 4 A100 GPUs. The sampling stride $s$ of the information-aware masking strategy is set by default to 4. The number of the encoder layer 1, encoder layer 2, and encoder layer 3 are set to 2, 2, and 11, respectively. Meanwhile, the Transformer-based encoder layer 3 with 768 feature dimensions and 12 attention heads. The infrared decoder is configured with two transformer layers, each having 512 feature dimensions and 12 attention heads. For training optimization, we adopt a 400-epoch cosine learning rate schedule, incorporating a 40-epoch warm-up phase. Optimization is achieved through the AdamW [36] optimizer, which is set to a base learning rate of $1.5 \\times 10^{-4}$ , a weight decay of 0.05, and a batch size of 256. Additionally, random cropping is employed as a data augmentation strategy during pre-training.", + "bbox": [ + 215, + 404, + 785, + 585 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5.2 InfMAE on The Infrared Semantic Segmentation Task", + "text_level": 1, + "bbox": [ + 215, + 612, + 709, + 628 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Experimental Setup The MSRS [48] dataset is a semantic segmentation dataset of 1444 paired infrared and visible images. The training set contains 1083 pairs of infrared and visible images and the testing set consists of 361 image pairs. The images are categorized into eight major urban driving-related classes (Cars, People, Bicycles, Curves, Car Stops, Guardrails, Color Cones, and Bumps), providing a robust basis for urban scene analysis. In our experiments, we use the infrared component of the MSRS dataset, referred to as MARS-inf in the following description, to validate the performance of our method. We adopt UperNet [55] and FCN [35], the hierarchical segmentation network headers, to compare the effectiveness of pre-trained InfMAE with other SOTA methods. We use a 24k iteration polynomial learning rate scheme with the first 1500 iterations warmed up. The AdamW [36] optimizer is used, with an initial learning rate of 10e-4, weight decay of 0.05, and a batch size of 2.", + "bbox": [ + 215, + 642, + 785, + 839 + ], + "page_idx": 8 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 8 + }, + { + "type": "page_number", + "text": "9", + "bbox": [ + 774, + 116, + 784, + 126 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Results on The MSRS-inf In our comparative analysis, the performance of the proposed method is evaluated against both supervised methods UperNet [55], DeeplabV3 + [8], DNLNet [57], DDRNet [41], and self-supervised methods vanilla MAE [17], MCMAE [15], UM-PVT [27]. We evaluate these methods using metrics such as the Intersection over Union (IoU) for each class, the mean Intersection over Union (mIoU) across all classes, and the mean accuracy (mAcc) for all classes. The experimental results are shown in Table 1. We first combine the encoder of the proposed InfMAE and the segmentation head of the Upernet [55] and train the method from scratch in a supervised manner. Compared with this method, leveraging the pre-trained weights of this encoder significantly enhances performance, as shown in Table 1. Meanwhile, compared with other supervised and self-supervised methods, the proposed method outperforms them a lot.", + "bbox": [ + 212, + 145, + 787, + 327 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "To evaluate the generalisability of the proposed InfMAE to other segmentation methods, we also use the FCN [35] head for semantic segmentation. As can be seen in Table 1, the proposed method outperforms all the SOTA methods.", + "bbox": [ + 212, + 327, + 785, + 372 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/ded5a8689edaaf34374c03632379b9d1c34345712026b59a4c2ffebcd87a87b5.jpg", + "table_caption": [ + "Table 1: Comparison with different semantic segmentation methods on the MSRSinf [48] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + ], + "table_footnote": [], + "table_body": "
MethodsBackboneModelCar(%)Person(%)Bike(%)Curve(%)Car_Stop(%)Guardrail(%)Color_Cone(%)Bumb(%)mIoU(%)mAcc(%)
UperNet [55]Resnet50-82.667.264.247.355.156.653.965.965.674.7
DeeplabV3+ [8]Resnet50-84.269.563.745.154.768.844.558.865.273.8
DNLNet [57]Resnet101-86.766.568.050.557.756.750.369.667.075.7
DDRRNet [41]--87.069.666.847.061.051.356.268.867.373.3
Sup.(Scratch)ViT-BFCN75.463.755.936.449.146.928.655.756.563.4
Vanila MAE [17]ViT-BFCN83.267.362.644.558.157.745.060.564.171.6
UM-VPT [27]VPT-SFCN80.367.361.441.154.259.138.761.962.470.1
MCMAE [15]ViT-BFCN86.568.866.855.068.367.052.372.770.678.7
InfMAE(Ours)ViT-BFCN88.270.168.256.170.067.554.574.972.080.0
Sup.(Scratch)ViT-BUperNet74.050.741.249.735.640.544.055.961.161.1
Vanilla MAE [17]ViT-BUperNet86.672.366.056.269.770.254.968.171.478.2
UM-VPT [27]VPT-SUperNet87.272.166.654.063.856.452.169.068.876.3
MCMAE [15]ViT-BUperNet87.573.266.557.169.767.257.073.072.179.8
InfMAE(Ours)ViT-BUperNet89.372.868.859.172.176.757.174.274.382.5
", + "bbox": [ + 217, + 450, + 782, + 573 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5.3 InfMAE on The Infrared Object Detection Task", + "text_level": 1, + "bbox": [ + 212, + 618, + 660, + 633 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Experimental Setup The M3FD [34] dataset is an infrared and visible target detection dataset that contains 4200 images. The dataset labels six targets (People, Cars, Bus, Motor, Trucks, Lamps) during driving. We use the infrared images from it for experimental performance validation. In the following description, we call this used dataset M3FD-inf. We follow the most common setting to use the detection heads in Mask R-CNN [18] and Cascade R-CNN [4] and fine-tune the pre-trained InfMAE model. We follow most of the settings of the benchmark ViT [12]. We report the performance of the target detection model under 25 epoch cosine scheduling with a base learning rate of 10e-4 and a weight decay of 0.1. The batch size is set to 2.", + "bbox": [ + 212, + 638, + 787, + 791 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Results on The M3FD-inf We compare the proposed method with the supervised methods DETR [5], Sparse R-CNN [47], DINO [6], YoloV8 [51] and", + "bbox": [ + 212, + 809, + 785, + 840 + ], + "page_idx": 9 + }, + { + "type": "page_number", + "text": "10", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 9 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/89d00eb03b133943dee006188585c0e69edaa5a0dc2e48a14f9c22eb52511850.jpg", + "table_caption": [ + "Table 2: Performances of different object detection methods on the M3FD-inf [34] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + ], + "table_footnote": [], + "table_body": "
MethodsBackboneModelPeople(%)Car(%)Bus(%)Motor(%)Lamp(%)Truck(%)mAP(%)AP50(%)
DETR [5]ResNet101-78.588.187.875.865.978.146.779.0
Sparse R-CNN [47]ResNet50-84.288.788.075.366.274.048.379.4
DINO [6]Swin-L-83.287.585.661.560.473.545.375.3
YoloV8 [51]CSPDarkNet-42.854.358.232.516.240.740.863.0
Sup.(Scratch)ViT-BMask R-CNN83.388.690.172.466.479.148.780.0
Vanilla MAE [17]ViT-BMask R-CNN84.889.693.176.076.580.551.483.4
MCMAE [15]ViT-BMask R-CNN87.890.893.187.785.984.955.788.4
InfMAE(Ours)ViT-BMask R-CNN87.990.794.687.185.283.256.288.1
Sup.(Scratch)ViT-BCascade R-CNN83.788.691.168.263.979.050.979.1
Vanilla MAE [17]ViT-BCascade R-CNN85.288.994.372.272.679.652.882.1
MCMAE [15]ViT-BCascade R-CNN85.690.493.176.880.983.754.785.1
InfMAE(Ours)ViT-BCascade R-CNN85.790.494.981.981.483.455.886.3
", + "bbox": [ + 217, + 198, + 782, + 323 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "with the self-supervised methods vanilla MAE [17], MCMAE [15]. We report the AP50 of each class, the mAP and AP50 of all classes' performance of all methods, and the experiment results are shown in Table 2. As shown in this table, when combining the encoder of the proposed InfMAE and the detection head of the Cascade R-CNN [4] method, the proposed method outperforms all supervised methods. As for the self-supervised methods, the proposed method outperforms most of the SOTA methods. We can observe a similar experiment performance when using the head of Mask R-CNN method.", + "bbox": [ + 217, + 349, + 785, + 469 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "5.4 InfMAE on The Infrared Small Target Detection Task", + "text_level": 1, + "bbox": [ + 217, + 489, + 707, + 505 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Experimental Setup The IRSTD-1k [58] is a well-established infrared small target detection dataset that contains 1000 infrared modal images with pixel-level annotations. We replace the encoder in [33] with the multi-scale encoder module in InfMAE. During the training phase, we adopt the AdamW [36] optimizer with an initial learning rate of 0.001, a weight decay of 0.05, and a batch size of 2.", + "bbox": [ + 217, + 513, + 785, + 602 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/83b5d5b8d6787eaacfea5c9a9a87ce42f3273f94cc75b6d26fb5ce470a6a7d01.jpg", + "table_caption": [ + "Table 3: Performances of different infrared small target detection methods on the IRSTD-1k dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + ], + "table_footnote": [], + "table_body": "
MethodsBackbonePd(%)AUC(%)F1(%)IoU(%)
LPNetGA [7]-77.160.650.834.1
DNANet [25]-89.687.876.461.8
ISTR [33]ViT-B85.886.169.453.1
Sup.(Scratch)ViT-B86.186.172.657.0
Vanilla MAE [17]ViT-B86.886.872.857.2
MCMAE [15]ViT-B74.290.878.464.5
UM-VPT [27]VPT-S99.688.973.558.1
InfMAE(Ours)ViT-B96.691.279.566.0
", + "bbox": [ + 300, + 679, + 702, + 810 + ], + "page_idx": 10 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 10 + }, + { + "type": "page_number", + "text": "11", + "bbox": [ + 767, + 116, + 782, + 126 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Results on The IRSTD We compare the proposed method with the supervised methods LPNetGA [7], DNANet [25], ISTR [33], and with the self-supervised methods Vanilla MAE [17], MCMAE [15], UM-PVT [27]. According to the [14, 33], we report four main performance metrics: positive detection $P_{d}$ , AUC, pixel-level F1 score $F_{1}$ , and IoU in the table 3. From this table, we can see that the proposed foundation model outperforms all the SOTA methods in metrics of AUC, $F_{1}$ , and IoU.", + "bbox": [ + 212, + 146, + 787, + 252 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "5.5 Ablation Study of The InfMAE", + "text_level": 1, + "bbox": [ + 214, + 270, + 522, + 285 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Module Ablation In this section, we validate the effect of the information-aware masking strategy and multi-scale strategy. We adopt the UperNet [55] as the segmentation head and the Mask R-CNN [18] as the object detection head. The results are shown in Table 4. From this Table, we can see that combining the proposed information-aware masking strategy and the introduced multi-scale strategy can achieve better performance in downstream tasks.", + "bbox": [ + 212, + 291, + 785, + 381 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/fd7e2e30d0af838c41bcd2d960563c21d55daa41332100ab2092b6ac56732c61.jpg", + "table_caption": [ + "Table 4: Ablation study on the influence of the masking strategy and multi-scale strategy. The IAM means the information-aware masking strategy." + ], + "table_footnote": [], + "table_body": "
IAM Multi-scaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
-71.478.281.549.1
✓72.079.478.950.1
-72.179.886.355.0
✓74.382.588.156.2
", + "bbox": [ + 243, + 445, + 759, + 520 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Decoder Depth In this section, we analyze the effects of different decoder depths on the experimental performance of downstream tasks. We set the decoder depth to 2, 4, 8, and 12 respectively, and we also adopt the UperNet [55] and the Mask R-CNN [18] as the segmentation and object detection heads. The experimental performance is shown in the table 5. From the table, we can see that segmentation and detection gain the best result when the decoder depth is 2. From the experimental results, we can find that the infrared image does not need a deep decoder because of its lack of texture, detail, and color information. Meanwhile, we can observe from this table that the semantic performance is more sensitive to the decoder depth.", + "bbox": [ + 212, + 564, + 787, + 715 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Masking Strides In this section, we analyze the experimental performance under different masking strides. For the mask strides, we select 2, 4, and 7, and the experimental results are shown in the table 6. From the table, we can see that when the masking stride is set to 4, the semantic segmentation metrics mIoU and mAcc are the best, while the detection metric AP50 is suboptimal. Considering that setting the sampling stride to 2 leads to an increase in the model's parameter count, we select a masking stride of 4.", + "bbox": [ + 212, + 734, + 787, + 839 + ], + "page_idx": 11 + }, + { + "type": "page_number", + "text": "12", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 11 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/0091d7b73df8923c7644c2804890750064bc9ad380f9aeb1a4ea0782a272a4c1.jpg", + "table_caption": [ + "Table 5: The influence of increasing decoder depths on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + ], + "table_footnote": [], + "table_body": "
DecoderDepthSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.382.588.156.2
472.980.487.955.6
873.280.787.653.8
1274.081.987.254.1
", + "bbox": [ + 246, + 184, + 754, + 258 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/3cec5a1b8b605d8cb9581298a04af0bf57bab60d0c236b969a9db86813bad289.jpg", + "table_caption": [ + "Table 6: The influence of different masking strides of the information-aware masking strategy on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + ], + "table_footnote": [], + "table_body": "
StridesSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.282.089.356.1
474.382.588.156.2
771.879.988.054.9
1470.4--54.3
", + "bbox": [ + 274, + 324, + 728, + 398 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Pre-training Epochs For MAE, 1600 pre-training epochs can significantly improve the quality of the learned representations. To explore this effect of pretraining time, we train InfMAE with 200, 400, 800, and 1600 epochs and finetune the pre-trained models on downstream tasks. The experimental results can be seen in Table 7. From this table, we observe improved performances across most downstream tasks with an increase in pre-training epochs.", + "bbox": [ + 215, + 425, + 784, + 515 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/bb05acc62e08bde18849235bced922f0fec5dd81eadb52ebbfde83edc92cefba.jpg", + "table_caption": [ + "Table 7: The influence of increasing pre-training epochs on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + ], + "table_footnote": [], + "table_body": "
Pre-train EpochsSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
20071.378.987.455.4
40074.382.588.156.2
80074.983.188.355.9
160074.983.288.256.0
", + "bbox": [ + 240, + 580, + 761, + 656 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Pre-training Dataset Size Analysis In this section, we present the impact of varying pre-training dataset sizes on downstream task performance, as documented in Table 8. The Inf10 and Inf15 contain 100K and 150K images which are sampled from Inf30 and the Inf50 contains 500K unprocessed images. The table indicates a progressive enhancement in performance with the increase in dataset size from 100K to 300K while from 300K to 500K does not yield a proportional increase. This phenomenon is likely due to the increasing similarity of images within the larger dataset, which results in a limited representation learning ability of the foundational model. The lack of diversity in the dataset restricts", + "bbox": [ + 215, + 704, + 785, + 839 + ], + "page_idx": 12 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 12 + }, + { + "type": "page_number", + "text": "13", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/0e3c1c26bd22bd725b071fc94ec895f9875836e0924e2f3f2f27fc0dea14a06a.jpg", + "table_caption": [ + "Table 8: The influence of different pre-train data scales on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + ], + "table_footnote": [], + "table_body": "
Dataset ScaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
Inf1069.177.686.955.0
Inf1573.0--55.6
Inf3074.382.588.156.2
Inf5073.080.587.355.8
", + "bbox": [ + 253, + 184, + 750, + 258 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "the model's generalization ability to various downstream tasks. Thus, the findings highlight the significance of dataset quality and diversity in pre-training for optimal model performance.", + "bbox": [ + 212, + 282, + 782, + 328 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5.6 Pre-trained on Inf30 and ImageNet-1K", + "text_level": 1, + "bbox": [ + 215, + 347, + 583, + 363 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this section, we discuss the importance of the large-scale infrared dataset in developing an infrared foundation model. To this end, the architecture of the vanilla MAE [17] is utilized for pre-training by 400 epochs on both the Inf30 dataset and the IN1K-30 dataset, the latter comprising 300k visible images randomly sampled from the ImageNet-1K [10] for fair comparison. To assess the generalization capabilities of the pre-trained models, we engage in infrared semantic segmentation using the MSRS-inf [48] dataset with UperNet [55], and infrared object detection on the M3FD-inf [34] dataset utilizing Mask R-CNN [18]. This experimental setting is consistent with the MAE [17]. The mIoUs and AP50 of vanilla MAE pre-trained with IN1K-30 are $66.7\\%$ and $78.2\\%$ , while pre-trained with Inf30 are $71.6\\%$ and $83.4\\%$ . These results show that the MAE [17] pre-trains on Inf30 exhibit stronger generalization capabilities in infrared downstream tasks. This observation underscores that the distribution variances indeed contribute to performance disparities. Hence, the release of a large-scale infrared dataset is crucial for the development of the foundation model.", + "bbox": [ + 212, + 368, + 787, + 595 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "6 Conclusion", + "text_level": 1, + "bbox": [ + 215, + 614, + 359, + 631 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this paper, we propose a foundation model in the infrared modality, named InfMAE. We collect a dataset containing 305,241 infrared images for self-supervised learning. Meanwhile, to enhance the model's capacity to learn the generalized representation, an information-aware masking strategy is proposed, which can make the network pay more attention to the reconstruction of the information-rich part of the image. Besides, based on the characteristics of infrared images, we design a new decoder structure. Finally, we validate the effectiveness of the proposed method InfMAE in infrared semantic segmentation, object detection, and small target detection tasks. The experimental results show that our InfMAE can obtain better experimental results than other supervised and self-supervised methods. In addition, we discuss some parameters in the InfMAE. We hope that the proposed foundation model InfMAE can promote the development of the infrared vision community.", + "bbox": [ + 212, + 643, + 787, + 840 + ], + "page_idx": 13 + }, + { + "type": "page_number", + "text": "14", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 13 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 357, + 127 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Acknowledgements", + "text_level": 1, + "bbox": [ + 217, + 143, + 401, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This work is supported in part by the National Key R&D Program of China (2022YFA1004100), and in part by the National Natural Science Foundation of China (No. 62176035, 62201111, 12226004, 62272375), the Science and Technology Research Program of Chongqing Municipal Education Commission under Grant (No.KJZD-K202100606).", + "bbox": [ + 212, + 180, + 787, + 256 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "References", + "text_level": 1, + "bbox": [ + 215, + 282, + 321, + 299 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "1. Awais, M., Naseer, M., Khan, S., Anwer, R.M., Cholakkal, H., Shah, M., Yang, M.H., Khan, F.S.: Foundational models defining a new era in vision: A survey and outlook (2023)", + "2. Bao, H., Dong, L., Piao, S., Wei, F.: Beit: Bert pre-training of image transformers. In: International Conference on Learning Representations (2021)", + "3. Bommasani, R., Hudson, D.A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M.S., Bohg, J., Bosselut, A., Brunskill, E., et al.: On the opportunities and risks of foundation models. arXiv preprint arXiv:2108.07258 (2021)", + "4. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018)", + "5. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: Proceedings of the European conference on computer vision (ECCV). pp. 213-229. Springer (2020)", + "6. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 9650-9660 (2021)", + "7. Chen, F., Gao, C., Liu, F., Zhao, Y., Zhou, Y., Meng, D., Zuo, W.: Local patch network with global attention for infrared small target detection. IEEE Transactions on Aerospace and Electronic Systems 58(5), 3979-3991 (2022)", + "8. Chen, L.C., Zhu, Y., Papandreou, G., Schroff, F., Adam, H.: Encoder-decoder with atrous separable convolution for semantic image segmentation. In: Proceedings of the European conference on computer vision (ECCV). pp. 801-818 (2018)", + "9. Chen, X., Gao, C., Li, C., Yang, Y., Meng, D.: Infrared action detection in the dark via cross-stream attention mechanism. IEEE Transactions on Multimedia 24, 288-300 (2021)", + "0. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)", + "11. Dong, X., Bao, J., Zhang, T., Chen, D., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N., Guo, B.: Peco: Perceptual codebook for bert pre-training of vision transformers. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 552-560 (2023)", + "12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020)" + ], + "bbox": [ + 218, + 316, + 784, + 839 + ], + "page_idx": 14 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 14 + }, + { + "type": "page_number", + "text": "15", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 14 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "13. Gao, C., Du, Y., Liu, J., Lv, J., Yang, L., Meng, D., Hauptmann, A.G.: Infar dataset: Infrared action recognition at different times. Neurocomputing 212, 36-47 (2016)", + "14. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE transactions on image processing 22(12), 4996-5009 (2013)", + "15. Gao, P., Ma, T., Li, H., Lin, Z., Dai, J., Qiao, Y.: Mcmae: Masked convolution meets masked autoencoders. Advances in Neural Information Processing Systems 35, 35632-35644 (2022)", + "16. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind one embedding space to bind them all. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 15180-15190. IEEE (2023)", + "17. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022)", + "18. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017)", + "19. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016. pp. 770-778. IEEE Computer Society (2016)", + "20. He, Z., Cao, Y., Dong, Y., Yang, J., Cao, Y., Tisse, C.L.: Single-image-based nonuniformity correction of uncooled long-wave infrared detectors: A deep-learning approach. Applied optics 57(18), D155-D164 (2018)", + "21. Kakogeorgiou, I., Gidaris, S., Psomas, B., Avrithis, Y., Bursuc, A., Karantzalos, K., Komodakis, N.: What to hide from your students: Attention-guided masked image modeling. In: European Conference on Computer Vision. pp. 300-318. Springer (2022)", + "22. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W., Dollár, P., Girshick, R.B.: Segment anything. CoRR abs/2304.02643 (2023)", + "23. Kolesnikov, A., Beyer, L., Zhai, X., Puigcerver, J., Yung, J., Gelly, S., Houlsby, N.: Big transfer (bit): General visual representation learning. In: Proceedings of the European conference on computer vision (ECCV). pp. 491-507. Springer (2020)", + "24. Lab, A.S.: Thermal infrared dataset. https://projects.asl.ethz.ch/datasets/doku.php?id=ir:iricra2014", + "25. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022)", + "26. Li, G., Zheng, H., Liu, D., Wang, C., Su, B., Zheng, C.: Semmae: Semantic-guided masking for learning masked autoencoders. Advances in Neural Information Processing Systems 35, 14290-14302 (2022)", + "27. Li, X., Wang, W., Yang, L., Yang, J.: Uniform masking: Enabling mae pretraining for pyramid-based vision transformers with locality. arXiv preprint arXiv:2205.10063 (2022)", + "28. Li, Y., Liu, H., Tian, Z., Geng, W.: Near-infrared vascular image segmentation using improved level set method. Infrared Physics & Technology 131, 104678 (2023)", + "29. Li, Y., Xie, S., Chen, X., Dollar, P., He, K., Girshick, R.: Benchmarking detection transfer learning with vision transformers. arXiv preprint arXiv:2111.11429 (2021)" + ], + "bbox": [ + 215, + 146, + 785, + 839 + ], + "page_idx": 15 + }, + { + "type": "page_number", + "text": "16", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 15 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 15 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "30. Li, Z., Chen, Z., Yang, F., Li, W., Zhu, Y., Zhao, C., Deng, R., Wu, L., Zhao, R., Tang, M., et al.: Mst: Masked self-supervised transformer for visual representation. Advances in Neural Information Processing Systems 34, 13165-13176 (2021)", + "31. Li, Z.Y., Gao, S., Cheng, M.M.: Sere: Exploring feature self-relation for self-supervised transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(12), 15619-15631 (2023)", + "32. Lin, F., Ge, S., Bao, K., Yan, C., Zeng, D.: Learning shape-biased representations for infrared small target detection. IEEE Transactions on Multimedia pp. 1-12 (2023)", + "33. Liu, F., Gao, C., Chen, F., Meng, D., Zuo, W., Gao, X.: Infrared small and dim target detection with transformer under complex backgrounds. IEEE Transactions on Image Processing 32, 5921-5932 (2023)", + "34. Liu, J., Fan, X., Huang, Z., Wu, G., Liu, R., Zhong, W., Luo, Z.: Target-aware dual adversarial learning and a multi-scenario multi-modality benchmark to fuse infrared and visible for object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5802-5811 (2022)", + "35. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015)", + "36. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net (2019), https://openreview.net/forum?id=Bkg6RiCqY7", + "37. Lüddecke, T., Ecker, A.S.: Image segmentation using text and image prompts. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA, June 18-24, 2022. pp. 7076-7086. IEEE (2022)", + "38. Madan, N., Ristea, N.C., Ionescu, R.T., Nasrollahi, K., Khan, F.S., Moeslund, T.B., Shah, M.: Self-supervised masked convolutional transformer block for anomaly detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 46(1), 525-542 (2024)", + "39. OpenAI: Gpt-4 technical report. PREPRINT (2023)", + "40. OTCBVS: Otcbvs benchmark dataset collection. https://vcipl-okstate.org/pbvs/bench/index.html", + "41. Pan, H., Hong, Y., Sun, W., Jia, Y.: Deep dual-resolution networks for real-time and accurate semantic segmentation of traffic scenes. IEEE Transactions on Intelligent Transportation Systems 24(3), 3448-3460 (2022)", + "42. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)", + "43. Reed, C.J., Gupta, R., Li, S., Brockman, S., Funk, C., Clipp, B., Keutzer, K., Candido, S., Uytendaele, M., Darrell, T.: Scale-mae: A scale-aware masked autoencoder for multiscale geospatial representation learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4088-4099 (2023)", + "44. Reporter, T.M.: Infrared camera finds 6-year-old lost in deep woods. https://www.youtube.com/watch?v=-FajSFRlKIo", + "45. Scheibenreif, L., Mommert, M., Borth, D.: Masked vision transformers for hyperspectral image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2165-2175 (2023)" + ], + "bbox": [ + 212, + 146, + 787, + 840 + ], + "page_idx": 16 + }, + { + "type": "header", + "text": "InfMAE: A Foundation Model in The Infrared Modality", + "bbox": [ + 356, + 114, + 730, + 128 + ], + "page_idx": 16 + }, + { + "type": "page_number", + "text": "17", + "bbox": [ + 767, + 116, + 784, + 126 + ], + "page_idx": 16 + }, + { + "type": "list", + "sub_type": "ref_text", + "list_items": [ + "46. St-Charles, P.L., Bilodeau, G.A., Bergevin, R.: Mutual foreground segmentation with multispectral stereo pairs. In: Proceedings of the IEEE International Conference on Computer Vision Workshops. pp. 375-384 (2017)", + "47. Sun, P., Zhang, R., Jiang, Y., Kong, T., Xu, C., Zhan, W., Tomizuka, M., Li, L., Yuan, Z., Wang, C., et al.: Sparse r-cnn: End-to-end object detection with learnable proposals. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14454-14463 (2021)", + "48. Tang, L., Yuan, J., Zhang, H., Jiang, X., Ma, J.: Piafusion: A progressive infrared and visible image fusion network based on illumination aware. Information Fusion 83-84, 79-92 (2022)", + "49. Tian, Z., Liu, H., Li, Q.: Vu-net: A symmetric network-based method for near-infrared blood vessel image segmentation. In: International Conference on Man-Machine-Environment System Engineering. pp. 275–280. Springer (2023)", + "50. Tong, Z., Song, Y., Wang, J., Wang, L.: Videomae: Masked autoencoders are data-efficient learners for self-supervised video pre-training. Advances in neural information processing systems 35, 10078-10093 (2022)", + "51. ultralytics: ultralytics, 2023. https://github.com/ultralytics/ultralytics", + "52. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017)", + "53. Wang, L., Huang, B., Zhao, Z., Tong, Z., He, Y., Wang, Y., Wang, Y., Qiao, Y.: Videomae v2: Scaling video masked autoencoders with dual masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14549-14560 (2023)", + "54. Woo, S., Debnath, S., Hu, R., Chen, X., Liu, Z., Kweon, I.S., Xie, S.: Convnext v2: Co-designing and scaling convnets with masked autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16133-16142 (2023)", + "55. Xiao, T., Liu, Y., Zhou, B., Jiang, Y., Sun, J.: Unified perceptual parsing for scene understanding. In: Proceedings of the European conference on computer vision (ECCV). pp. 418-434 (2018)", + "56. Xu, Z., Zhuang, J., Liu, Q., Zhou, J., Peng, S.: Benchmarking a large-scale fir dataset for on-road pedestrian detection. Infrared Physics & Technology 96, 199-208 (2019)", + "57. Yin, M., Yao, Z., Cao, Y., Li, X., Zhang, Z., Lin, S., Hu, H.: Disentangled non-local neural networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 191-207. Springer (2020)", + "58. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022)", + "59. Zhang, R., Guo, Z., Gao, P., Fang, R., Zhao, B., Wang, D., Qiao, Y., Li, H.: Point-m2ae: multi-scale masked autoencoders for hierarchical point cloud pre-training. Advances in neural information processing systems 35, 27061-27074 (2022)", + "60. Zhang, X., Demiris, Y.: Visible and infrared image fusion using deep learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(8), 10535-10554 (2023)" + ], + "bbox": [ + 215, + 146, + 785, + 771 + ], + "page_idx": 17 + }, + { + "type": "page_number", + "text": "18", + "bbox": [ + 217, + 114, + 235, + 126 + ], + "page_idx": 17 + }, + { + "type": "header", + "text": "F. Liu et al.", + "bbox": [ + 271, + 114, + 357, + 126 + ], + "page_idx": 17 + } +] \ No newline at end of file diff --git a/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_model.json b/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_model.json new file mode 100644 index 0000000000000000000000000000000000000000..1c0bba1549815142a8d80c70485a56a6f1ca3579 --- /dev/null +++ b/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_model.json @@ -0,0 +1,2568 @@ +[ + [ + { + "type": "title", + "bbox": [ + 0.286, + 0.141, + 0.72, + 0.187 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "text", + "bbox": [ + 0.273, + 0.212, + 0.728, + 0.244 + ], + "angle": 0, + "content": "Fangcen Liu\\(^{1}\\), Chenqiang Gao\\(^{2*}\\), Yaming Zhang\\(^{1}\\), Junjie Guo\\(^{1}\\), Jinghao Wang\\(^{2}\\), and Deyu Meng\\(^{3}\\)" + }, + { + "type": "text", + "bbox": [ + 0.222, + 0.255, + 0.78, + 0.297 + ], + "angle": 0, + "content": "1 School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China. {liufc67, YummyZhang1989, gjj893866738} @ gmail.com" + }, + { + "type": "text", + "bbox": [ + 0.236, + 0.297, + 0.764, + 0.325 + ], + "angle": 0, + "content": "\\(^{2}\\) School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen, Guangdong 518107, China. {gaochq6, wangjh298}@mail.sysu.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.23, + 0.325, + 0.772, + 0.368 + ], + "angle": 0, + "content": "3 School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, Shanxi, 710049, China, and School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China. dymeng@mail.xjtu.edu.cn" + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.405, + 0.744, + 0.655 + ], + "angle": 0, + "content": "Abstract. In recent years, foundation models have swept the computer vision field, facilitating the advancement of various tasks within different modalities. However, effectively designing an infrared foundation model remains an open question. In this paper, we introduce InfMAE, a foundation model tailored specifically for the infrared modality. Initially, we present Inf30, an infrared dataset developed to mitigate the scarcity of large-scale data for self-supervised learning within the infrared vision community. Moreover, considering the intrinsic characteristics of infrared images, we design an information-aware masking strategy. It allows for a greater emphasis on the regions with richer information in infrared images during the self-supervised learning process, which is conducive to learning strong representations. Additionally, to enhance generalization capabilities in downstream tasks, we employ a multi-scale encoder for latent representation learning. Finally, we develop an infrared decoder to reconstruct images. Extensive experiments show that our proposed method InfMAE outperforms other supervised and self-supervised learning methods in three key downstream tasks: infrared image semantic segmentation, object detection, and small target detection." + }, + { + "type": "text", + "bbox": [ + 0.261, + 0.668, + 0.741, + 0.697 + ], + "angle": 0, + "content": "Keywords: Infrared Foundation Model \\(\\cdot\\) Infrared Image Segmentation \\(\\cdot\\) Infrared Object Detection \\(\\cdot\\) Infrared Small Target Detection." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.723, + 0.377, + 0.74 + ], + "angle": 0, + "content": "1 Introduction" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.755, + 0.788, + 0.817 + ], + "angle": 0, + "content": "Infrared imaging plays a crucial role and finds extensive applications in low-light even dark and smoky conditions [9,25,60] since they utilize the thermal radiation of objects for imaging, which can effectively alleviate adverse effects caused by challenging environmental conditions. Currently, computer vision tasks in the" + }, + { + "type": "page_footnote", + "bbox": [ + 0.232, + 0.826, + 0.405, + 0.84 + ], + "angle": 0, + "content": "* Corresponding authors." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "2" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.208 + ], + "angle": 0, + "content": "infrared vision community, such as object detection [32, 33], and semantic segmentation [28, 49], are explored by task-specific designed models. While these models can yield superior performance on individual tasks, they are often challenged by their limited generalizability." + }, + { + "type": "image", + "bbox": [ + 0.22, + 0.235, + 0.357, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.321, + 0.356, + 0.399 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.261, + 0.4, + 0.332, + 0.41 + ], + "angle": 0, + "content": "Visible Images" + }, + { + "type": "image", + "bbox": [ + 0.358, + 0.236, + 0.495, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.358, + 0.321, + 0.495, + 0.399 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.393, + 0.4, + 0.468, + 0.41 + ], + "angle": 0, + "content": "Infrared Images" + }, + { + "type": "image", + "bbox": [ + 0.505, + 0.236, + 0.637, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.505, + 0.32, + 0.636, + 0.399 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.536, + 0.4, + 0.606, + 0.41 + ], + "angle": 0, + "content": "Visible Images" + }, + { + "type": "image", + "bbox": [ + 0.64, + 0.236, + 0.771, + 0.317 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.64, + 0.32, + 0.771, + 0.399 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.666, + 0.4, + 0.741, + 0.41 + ], + "angle": 0, + "content": "Infrared Images" + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.422, + 0.789, + 0.492 + ], + "angle": 0, + "content": "Fig. 1: Visual comparison of infrared and visible images. Compared to visible images, infrared images display diminished informational content due to their inherent lack of rich texture and color details. For example, objects such as zebra crossings, telephone poles, and road signs in the red box are often submerged in their surroundings due to their similar temperature to the surrounding environment." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.523, + 0.789, + 0.81 + ], + "angle": 0, + "content": "The foundation model refers to a large, general deep learning model that learns extensive knowledge through pre-training on a large-scale dataset and can be adapted to various downstream tasks by fine-tuning or prompting [1, 3, 42]. The Transformer-based model like ViT [12] is one of the representative vision foundation models, which are trained on a large-scale dataset and outperforms the ResNet-based method [23] on the downstream tasks. To better learn the powerful representation of a foundation model from a large number of unlabeled data, self-supervised learning is the primary choice [31]. The self-supervised learning frameworks, such as BEiT [2], DINO [6], and Mask Autoencoders (MAE) [17], achieve impressive performance across various downstream vision tasks [29, 45]. Notably, the MAE [17] has verified superior representation learning ability and scalability. This model is pre-trained on the ImageNet-1K dataset [10]. Then, the pre-trained encoder of the MAE [17] serves as a sufficient feature extraction backbone, achieving excellent performance on classification, detection, and segmentation tasks. Following the self-supervised learning frameworks, pre-trained foundation models have emerged in various modalities, e.g., VideoMAE [50, 53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a comparable foundation model has not yet emerged in the infrared modality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.789, + 0.84 + ], + "angle": 0, + "content": "Intuitively, a feasible solution is to directly employ the pre-trained visible MAE on infrared downstream tasks. However, as delineated in Section 5.6, our" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "3" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.389 + ], + "angle": 0, + "content": "experimental findings suggest this is suboptimal, primarily due to significant disparities in imaging characteristics between infrared and visible modalities. Fig. 1 illustrates these differences. We can observe that infrared images exhibit less information compared to visible images, which lack rich texture and color details. For instance, objects like zebra crossings and power lines in Fig. 1 lack color and texture information in infrared images, making them indistinguishable from the surrounding environment. These differences cause a noticeable gap between the infrared and visible modalities. The most straightforward strategy to mitigate this disparity is to train the MAE model on an extensive infrared dataset. However, there appears to be a limited availability of a large-scale dataset in the infrared modality. Consequently, it becomes important to build a large-scale infrared dataset to facilitate the training of an infrared foundation model. In this paper, we begin by gathering a large number of infrared images. Through image preprocessing like reducing redundancy, we finally obtain an infrared dataset named Inf30, which addresses the existing data scarcity within the infrared modality." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.391, + 0.788, + 0.556 + ], + "angle": 0, + "content": "Due to the less information on infrared images, directly applying the vanilla MAE [17] architecture to the infrared modality is also a feasible but not the optimal choice, as the experiment shows in Sections 5.2, 5.3 and 5.4. The vanilla MAE adopts the random mask strategy. Directly applying this strategy to infrared images may cause the masking tokens to focus more on the information-poor part which is less conducive to representation learning. Previous researches [21, 26] argued that masking tokens with rich semantic information could improve the representation learning ability of the self-supervised method, and introduced the semantic-guided masking strategy. However, these methods do not account for the unique characteristics of the infrared modality and require the addition of new semantic-aware branches in the frameworks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.56, + 0.788, + 0.709 + ], + "angle": 0, + "content": "In this paper, we propose a simple yet effective foundation model in the infrared modality named InfMAE that can be extensively generalized to downstream tasks, such as infrared semantic segmentation, object detection, and small target detection. To enhance the representation capabilities for infrared images, we design an information-aware masking strategy, which facilitates the selective masking of regions with richer information without designing an additional complex semantic awareness branch. In addition, we employ a multi-scale strategy to enhance generalization capabilities in downstream tasks. Finally, based on the characteristics of infrared images, we adopt a new infrared decoder module for image reconstruction." + }, + { + "type": "text", + "bbox": [ + 0.24, + 0.713, + 0.692, + 0.728 + ], + "angle": 0, + "content": "We summarize the main contributions of this paper as follows:" + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.747, + 0.784, + 0.79 + ], + "angle": 0, + "content": "- We collect and preprocess a large number of infrared images, and finally release an infrared dataset Inf30 for self-supervised learning, which consists of 305241 infrared images." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.795, + 0.784, + 0.837 + ], + "angle": 0, + "content": "- We propose the InfMAE, a simple yet effective foundation model in the infrared modality. To the best of our knowledge, this is the first attempt to build a foundation model within the infrared modality." + }, + { + "type": "list", + "bbox": [ + 0.227, + 0.747, + 0.784, + 0.837 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "4" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.227, + 0.147, + 0.785, + 0.191 + ], + "angle": 0, + "content": "- Considering the characteristics of infrared imaging, we design an information-aware masking strategy and an infrared decoder. These designs enhance the model's ability to learn strong representations." + }, + { + "type": "text", + "bbox": [ + 0.228, + 0.192, + 0.785, + 0.236 + ], + "angle": 0, + "content": "- The experimental results show that the method proposed in this paper outperforms state-of-the-art methods, achieving the best performance in downstream tasks." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.259, + 0.388, + 0.275 + ], + "angle": 0, + "content": "2 Related Work" + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.289, + 0.453, + 0.304 + ], + "angle": 0, + "content": "2.1 The Foundation Model" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.313, + 0.788, + 0.569 + ], + "angle": 0, + "content": "The foundation models are trained on a large-scale dataset in a self-supervised manner, making them adaptable for various downstream tasks [3]. The foundation model can be categorized into four categories based on different inputs: traditional models, textually prompted models, visually prompted models, and heterogeneous modalities-based models [1]. Traditional foundational models usually take only images as input, such as ResNet [19] based on convolutional neural networks, as well as ViT [12] based on the Transformer architecture. The textually prompted models like CLIP [42] and GPT-4 [39] took the textual prompt and the image as the inputs, and the textual prompt established correlations between text and images, contributing to achieving zero-shot transfer. The visually prompted models [22,37] could be prompted by various prompt types, e.g., text, bounding boxes, or a semantical mask to get the target segmentation. The heterogeneous modalities-based models usually combine the various prompt types and the aligned multiple paired modalities, e.g., image-audio, image-video, etc., to learn meaningful representations. The ImageBind [16] is the representative work. In this study, we attempt to explore the traditional foundation model in the infrared modality." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.59, + 0.749, + 0.607 + ], + "angle": 0, + "content": "2.2 The Masked Image Modeling and Representation Learning" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.613, + 0.788, + 0.81 + ], + "angle": 0, + "content": "The Masked Image Modeling (MIM) [2,15,17,38] is an emerging self-supervised learning approach, i.e., by randomly masking a part of the input image and then reconstructing it. This learning method is simple yet effective in learning representations with high generality from a large-scale of data for downstream takes. BEiT [2] and MAE [17] are pioneering works. BEiT [2] used a bidirectional encoder representation to recover the original visual token based on the corrupted image patches. MAE [17] pre-trained the ViT encoder by randomly masking the image tokens, feeding the visible tokens into the encoder, and then reconstructing the masked tokens through the decoder. Based on MAE, pre-trained foundation models based on MIM learning have emerged in various modalities, e.g., VideoMAE [50,53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a MIM-based foundation model is not yet available in the infrared modality." + }, + { + "type": "text", + "bbox": [ + 0.216, + 0.81, + 0.787, + 0.84 + ], + "angle": 0, + "content": "In addition to extending MIM methods to other modalities, methods also focus on designing mask strategies and how to reconstruct images. Regarding the" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.733, + 0.13 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "5" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.783, + 0.223 + ], + "angle": 0, + "content": "masking strategy, methods like MST [30] and ATTMask [21] utilized attention maps to guide the masking strategy. SemMAE [26] used semantic information in images to select mask regions. UM-PVT [27] adopted a unified mask approach for masking learning. Regarding image reconstruction, some works [2, 11] adopted tokens produced by VQ-VAE [52] or its variants." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.223, + 0.784, + 0.253 + ], + "angle": 0, + "content": "In this study, we explore a new masking strategy and decoder structure for infrared image reconstruction, according to the characteristics of infrared images." + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.28, + 0.31, + 0.346 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.218, + 0.347, + 0.308, + 0.413 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.312, + 0.28, + 0.402, + 0.346 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.312, + 0.347, + 0.402, + 0.413 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.404, + 0.28, + 0.501, + 0.346 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.404, + 0.347, + 0.501, + 0.413 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.28, + 0.592, + 0.346 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.503, + 0.347, + 0.592, + 0.413 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.595, + 0.28, + 0.691, + 0.346 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.595, + 0.347, + 0.691, + 0.413 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.695, + 0.28, + 0.784, + 0.346 + ], + "angle": 0, + "content": null + }, + { + "type": "image", + "bbox": [ + 0.695, + 0.347, + 0.784, + 0.413 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.426, + 0.788, + 0.469 + ], + "angle": 0, + "content": "Fig. 2: Some samples of the Inf30. The environments in the collected dataset encompass skies, seascapes, forests, urban areas, suburban areas, lawns, and so on. The objects include ships, vehicles, pedestrians, public facilities, residential buildings, and so on." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.523, + 0.637, + 0.541 + ], + "angle": 0, + "content": "3 Pre-training Dataset Preparation: Inf30" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.557, + 0.504, + 0.573 + ], + "angle": 0, + "content": "3.1 Collection and Preprocessing" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.583, + 0.788, + 0.734 + ], + "angle": 0, + "content": "A large-scale dataset is essential for training the foundation model. Hence, this study has constructed a dataset named Inf30. The diversity of the images is important for learning the generalized representation. Hence, we extensively collect about 500K of infrared images from various websites [13, 20, 24, 40, 44, 46, 56]. However, the quality of these images is uneven. For example, the images extracted from the same video exhibit significant similarity, leading to a reduction in image diversity. Additionally, some infrared images obtained from the internet pose challenges due to their extremely low resolution. Consequently, we initiate preprocessing all of the collected images to improve the quality of the infrared dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.81 + ], + "angle": 0, + "content": "As for the issue of high similarity in infrared images, we initially selected one image as the anchor. Subsequently, we eliminated those images that have a closely resembling scene with the anchor image and retained images that exhibit substantial dissimilarity. As for the issue of low resolution, we conducted data cleaning by removing images with both width and height of less than 20 pixels." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.81, + 0.788, + 0.84 + ], + "angle": 0, + "content": "After collecting and preprocessing the infrared images, we finally obtained 305,241 images. As illustrated in Fig. 2, the scene in our dataset encompasses" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "6" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.208 + ], + "angle": 0, + "content": "skies, seascapes, forests, urban areas, suburban areas, lawns, and schools, while the objects include various types of ships, vehicles, pedestrians, public facilities, and residential buildings. The minimum resolution of images is \\(40 \\times 23\\), and the maximum resolution of images is \\(6912 \\times 1024\\)." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.229, + 0.494, + 0.246 + ], + "angle": 0, + "content": "3.2 Detail Information Analysis" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.254, + 0.788, + 0.314 + ], + "angle": 0, + "content": "In this section, we analyze the detail richness of our Inf30 and the well-established ImageNet-1K [10]. We employ the information entropy to measure the information of an image, which can reflect the detail richness. The information entropy is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.381, + 0.326, + 0.786, + 0.365 + ], + "angle": 0, + "content": "\\[\nH (X) = - \\sum_ {i = 1} ^ {n} P \\left(x _ {i}\\right) \\cdot \\log_ {2} \\left(P \\left(x _ {i}\\right)\\right), \\tag {1}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.369, + 0.788, + 0.459 + ], + "angle": 0, + "content": "where \\( n \\) is the number of brightness levels in the image, \\( x_{i} \\) represents each brightness level, and \\( P(x_{i}) \\) is the probability of the brightness level in the image. We calculate the information entropy of images in the Inf30 and ImageNet-1K datasets. The average information entropy of Inf30 is 6.44, while the average information entropy of ImageNet-1K is 7.19. This reveals that the visible dataset exhibits richer information compared to the infrared image dataset." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.46, + 0.787, + 0.505 + ], + "angle": 0, + "content": "Recognizing the low information richness of infrared images, this study introduces an information-aware masking strategy to enhance the generalized representation learning ability of the foundation model." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.527, + 0.332, + 0.543 + ], + "angle": 0, + "content": "4 Method" + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.559, + 0.342, + 0.573 + ], + "angle": 0, + "content": "4.1 Overview" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.583, + 0.788, + 0.734 + ], + "angle": 0, + "content": "As depicted in Fig. 3, the proposed InfMAE architecture consists of three principal modules: 1) the mask block generation module, 2) the multi-scale encoder module, and 3) the infrared decoder module. In the mask block generation module, we adopt an information-aware masking strategy on input tokens to get visible token IDs, mask_block1, and mask_block2, which are used in the multiscale encoder module. In the multi-scale encoder module, inspired by the MCMAE [15], we combine convolution and self-attention mechanisms to conduct multi-scale representation learning for the visible tokens. In the infrared decoder module, we integrate the multi-scale representation with the learned visible tokens for image reconstruction." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.755, + 0.592, + 0.772 + ], + "angle": 0, + "content": "4.2 The Structure of the Proposed InfMAE" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "The Mask Block Generation Module Since infrared images lack color and texture details, employing a random masking strategy, as done by the vanilla MAE [17], would result in excessive masking of information-poor regions. This could undermine the network's capacity to develop robust representations from" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.731, + 0.129 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "7" + }, + { + "type": "image", + "bbox": [ + 0.221, + 0.145, + 0.782, + 0.304 + ], + "angle": 0, + "content": null + }, + { + "type": "image_caption", + "bbox": [ + 0.214, + 0.316, + 0.785, + 0.371 + ], + "angle": 0, + "content": "Fig. 3: The framework of the proposed InfMAE. It contains three modules: the mask block generation module, the multi-scale encoder module, and the infrared decoder module. The features connected by the red dashed lines in the multi-scale encoder module are fed into the infrared decoder module." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.404, + 0.784, + 0.433 + ], + "angle": 0, + "content": "infrared images. Hence, this study proposes an information-aware masking strategy that can dynamically adjust mask tokens according to the image context." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.434, + 0.788, + 0.675 + ], + "angle": 0, + "content": "Given an input image \\( x \\in \\mathbb{R}^{H \\times W \\times C} \\), where \\( C, H, \\) and \\( W \\) denote the number of channels, height, and width respectively. \\( x \\) is first input into the information analysis part to get the intensity-wise feature map. The information analysis part is a convolution with both the kernel size and stride set to 16. Then we calculate the mean value of the intensity-wise feature map along the channel dimension and obtain the gray value map \\( I \\in \\mathbb{R}^{\\frac{H}{16} \\times \\frac{W}{16}} \\). After that, the gray value map is flattened to \\( N \\) tokens, \\( N = \\frac{H}{16} \\times \\frac{W}{16} \\). Meanwhile, these tokens are arranged in descending order of their gray values, where a higher value means that the information is richer. As depicted in the lower left corner of Fig. 3, each box represents a token, and the number within the box is the sorted token ID. After that, we perform the information-aware masking strategy on the sorted tokens, with a sampling stride \\( S \\). Specifically, we sample the sorted tokens at an interval of \\( S \\). The sampled tokens are the visible tokens and the rest are masked tokens. Meanwhile, we record the orders of the visible tokens' IDs and the masked tokens' IDs. These IDs are used as a reference for generating mask blocks." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.678, + 0.788, + 0.768 + ], + "angle": 0, + "content": "For mask block generation, we first obtain a binary value mask template through the ID mapping according to the sorted tokens IDs. In the mask template in Fig. 3, the white area is the visible token while the black area is the masked token. Then we up-sample the mask template two and four times to get the mask_block2 and mask_block1 for the following multi-scale learning in the multi-scale encoder module." + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.795, + 0.788, + 0.842 + ], + "angle": 0, + "content": "The Multi-scale Encoder Module Inspired by previous works like MCMAE [15] and ConvNeXt [54], we introduce a multi-scale encoder for visible token learning. This multi-scale encoder module mainly contains three encoder layers," + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.23, + 0.127 + ], + "angle": 0, + "content": "8" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.361, + 0.128 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.328 + ], + "angle": 0, + "content": "which are two CNN-based encoders, named encoder layer 1 and encoder layer 2, and one Transorfmer-based encoder, named encoder layer 3. Such three encoder layers can output feature maps with multi-scale spatial resolution, which are \\( F_{1} \\in \\mathbb{R}^{\\frac{H}{4} \\times \\frac{W}{4} \\times C_{1}} \\), \\( F_{2} \\in \\mathbb{R}^{\\frac{H}{8} \\times \\frac{W}{8} \\times C_{2}} \\), and \\( T_{s} \\in N_{v} \\times C_{3} \\), respectively. The \\( N_{v} \\) is the number of the visible tokens. Specifically, we first input the image \\( x \\) into the patch embedding 1 and encoder layer 1 to obtain the feature map \\( F_{1} \\). It should be noted that after the patch embedding 1 and token-wise convolution, we obtain the feature map \\( E_{1} \\in \\mathbb{R}^{\\frac{H}{4} \\times \\frac{W}{4} \\times C_{1}} \\), and then we dot \\( E_{1} \\) and mask_block1 which are obtained in mask block generation module to mask the original feature. Finally, we follow [15] and adopt the convolutional attention (Conv Attention) and FFN. Same as encoder layer 1, the \\( F_{1} \\) is inputted into patch embedding 2 and encoder layer 2 to obtain the feature maps \\( F_{2} \\in \\mathbb{R}^{\\frac{H}{8} \\times \\frac{W}{8} \\times C_{2}} \\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.329, + 0.788, + 0.406 + ], + "angle": 0, + "content": "After the patch embedding 3 and a linear operation, the \\(F_{2}\\) is flattened into \\(N\\) tokens \\(T\\in N\\times C_3\\). Then, we select the visible tokens from the \\(N\\) tokens according to the visible token IDs obtained by the mask block generation module. Finally, we use the encoder layer 3 whose structure is the same as the ViT [12] encoder layer, and obtain the learned visible tokens \\(T_{s}\\in N_{v}\\times C_{3}\\)." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.428, + 0.788, + 0.609 + ], + "angle": 0, + "content": "The Infrared Decoder Module In this study, we combine the multi-scale visible tokens and mask tokens and take them into the decoder for image reconstruction. Specifically, we normalize the multi-scale features \\( F_{1} \\) and \\( F_{2} \\) to the same size and then flatten them into the same shape with \\( T \\). After that, we obtain the visible tokens \\( T_{1} \\) and \\( T_{2} \\) according to the visible token IDs. Then, we add all the values of visible tokens \\( T_{1}, T_{2} \\), and \\( T_{s} \\) and concat both masked tokens and visible tokens along the first dimension. Meanwhile, we restore the order of these tokens based on the ID number in the mask block generation module. We feed the restored tokens into the decoder for image reconstruction. It is worth noting that infrared images lack many details and color information, so in this study, we set the infrared decoder depth to 2 for image reconstruction, whose structure is the same as the decoder of MAE [17]." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.61, + 0.788, + 0.655 + ], + "angle": 0, + "content": "The loss function measures the Mean Square Error (MSE) between the masked patches of reconstructed image \\( y \\) and the original image \\( x \\). The MSE loss is defined as follows:" + }, + { + "type": "equation", + "bbox": [ + 0.413, + 0.668, + 0.787, + 0.71 + ], + "angle": 0, + "content": "\\[\n\\mathcal {L} _ {m s e} = \\frac {1}{M} \\sum_ {i = 1} ^ {M} \\left(y _ {i} - x _ {i}\\right) ^ {2}, \\tag {2}\n\\]" + }, + { + "type": "text", + "bbox": [ + 0.215, + 0.714, + 0.531, + 0.73 + ], + "angle": 0, + "content": "where the \\(M\\) means the number of images." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.753, + 0.524, + 0.768 + ], + "angle": 0, + "content": "4.3 InfMAE for Downstream Tasks" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.78, + 0.788, + 0.842 + ], + "angle": 0, + "content": "After the self-supervised pre-training, InfMAE learns multi-scale feature maps, which can be employed for existing infrared semantic segmentation, object detection, and small target detection methods. To finetune InfMAE for these downstream tasks, we extract the \\( F_{1} \\) and \\( F_{2} \\) obtained by the encoder layer 1 and" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.775, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "9" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.207 + ], + "angle": 0, + "content": "encoder layer 2. Meanwhile, we reshape \\( T_{s} \\) to the feature \\( F_{3} \\in \\mathbb{R}^{\\frac{H}{16} \\times \\frac{W}{16} \\times C_{3}} \\) and downsample the \\( F_{3} \\) to \\( F_{4} \\in \\mathbb{R}^{\\frac{H}{32} \\times \\frac{W}{32} \\times C_{4}} \\) by a convolution layer. It should be noted that when finetuning InfMAE for these downstream tasks, the shape of \\( T_{s} \\) is \\( N \\times C_{3} \\). Finally, \\( F_{1}, F_{2}, F_{3} \\), and \\( F_{4} \\) are input into the downstream methods." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.235, + 0.365, + 0.254 + ], + "angle": 0, + "content": "5 Experiment" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.272, + 0.787, + 0.346 + ], + "angle": 0, + "content": "Initially, the proposed InfMAE is subjected to self-supervised pre-training using the released Inf30 dataset. Then, to assess the generalizability and robustness of InfMAE, it is applied to a series of downstream tasks. Finally, a series of ablation studies are conducted to confirm the efficacy and validity of the InfMAE framework." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.375, + 0.416, + 0.392 + ], + "angle": 0, + "content": "5.1 Pre-training Setup" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.405, + 0.787, + 0.587 + ], + "angle": 0, + "content": "The framework of the proposed InfMAE is implemented using pytorch 1.12.0 and accelerated by CUDA 11.6 on 4 A100 GPUs. The sampling stride \\(s\\) of the information-aware masking strategy is set by default to 4. The number of the encoder layer 1, encoder layer 2, and encoder layer 3 are set to 2, 2, and 11, respectively. Meanwhile, the Transformer-based encoder layer 3 with 768 feature dimensions and 12 attention heads. The infrared decoder is configured with two transformer layers, each having 512 feature dimensions and 12 attention heads. For training optimization, we adopt a 400-epoch cosine learning rate schedule, incorporating a 40-epoch warm-up phase. Optimization is achieved through the AdamW [36] optimizer, which is set to a base learning rate of \\(1.5 \\times 10^{-4}\\), a weight decay of 0.05, and a batch size of 256. Additionally, random cropping is employed as a data augmentation strategy during pre-training." + }, + { + "type": "title", + "bbox": [ + 0.217, + 0.613, + 0.71, + 0.63 + ], + "angle": 0, + "content": "5.2 InfMAE on The Infrared Semantic Segmentation Task" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.643, + 0.787, + 0.84 + ], + "angle": 0, + "content": "Experimental Setup The MSRS [48] dataset is a semantic segmentation dataset of 1444 paired infrared and visible images. The training set contains 1083 pairs of infrared and visible images and the testing set consists of 361 image pairs. The images are categorized into eight major urban driving-related classes (Cars, People, Bicycles, Curves, Car Stops, Guardrails, Color Cones, and Bumps), providing a robust basis for urban scene analysis. In our experiments, we use the infrared component of the MSRS dataset, referred to as MARS-inf in the following description, to validate the performance of our method. We adopt UperNet [55] and FCN [35], the hierarchical segmentation network headers, to compare the effectiveness of pre-trained InfMAE with other SOTA methods. We use a 24k iteration polynomial learning rate scheme with the first 1500 iterations warmed up. The AdamW [36] optimizer is used, with an initial learning rate of 10e-4, weight decay of 0.05, and a batch size of 2." + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "10" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.359, + 0.127 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.146, + 0.788, + 0.328 + ], + "angle": 0, + "content": "Results on The MSRS-inf In our comparative analysis, the performance of the proposed method is evaluated against both supervised methods UperNet [55], DeeplabV3 + [8], DNLNet [57], DDRNet [41], and self-supervised methods vanilla MAE [17], MCMAE [15], UM-PVT [27]. We evaluate these methods using metrics such as the Intersection over Union (IoU) for each class, the mean Intersection over Union (mIoU) across all classes, and the mean accuracy (mAcc) for all classes. The experimental results are shown in Table 1. We first combine the encoder of the proposed InfMAE and the segmentation head of the Upernet [55] and train the method from scratch in a supervised manner. Compared with this method, leveraging the pre-trained weights of this encoder significantly enhances performance, as shown in Table 1. Meanwhile, compared with other supervised and self-supervised methods, the proposed method outperforms them a lot." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.328, + 0.787, + 0.373 + ], + "angle": 0, + "content": "To evaluate the generalisability of the proposed InfMAE to other segmentation methods, we also use the FCN [35] head for semantic segmentation. As can be seen in Table 1, the proposed method outperforms all the SOTA methods." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.398, + 0.787, + 0.44 + ], + "angle": 0, + "content": "Table 1: Comparison with different semantic segmentation methods on the MSRSinf [48] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.452, + 0.784, + 0.574 + ], + "angle": 0, + "content": "
MethodsBackboneModelCar(%)Person(%)Bike(%)Curve(%)Car_Stop(%)Guardrail(%)Color_Cone(%)Bumb(%)mIoU(%)mAcc(%)
UperNet [55]Resnet50-82.667.264.247.355.156.653.965.965.674.7
DeeplabV3+ [8]Resnet50-84.269.563.745.154.768.844.558.865.273.8
DNLNet [57]Resnet101-86.766.568.050.557.756.750.369.667.075.7
DDRRNet [41]--87.069.666.847.061.051.356.268.867.373.3
Sup.(Scratch)ViT-BFCN75.463.755.936.449.146.928.655.756.563.4
Vanila MAE [17]ViT-BFCN83.267.362.644.558.157.745.060.564.171.6
UM-VPT [27]VPT-SFCN80.367.361.441.154.259.138.761.962.470.1
MCMAE [15]ViT-BFCN86.568.866.855.068.367.052.372.770.678.7
InfMAE(Ours)ViT-BFCN88.270.168.256.170.067.554.574.972.080.0
Sup.(Scratch)ViT-BUperNet74.050.741.249.735.640.544.055.961.161.1
Vanilla MAE [17]ViT-BUperNet86.672.366.056.269.770.254.968.171.478.2
UM-VPT [27]VPT-SUperNet87.272.166.654.063.856.452.169.068.876.3
MCMAE [15]ViT-BUperNet87.573.266.557.169.767.257.073.072.179.8
InfMAE(Ours)ViT-BUperNet89.372.868.859.172.176.757.174.274.382.5
" + }, + { + "type": "title", + "bbox": [ + 0.214, + 0.619, + 0.661, + 0.635 + ], + "angle": 0, + "content": "5.3 InfMAE on The Infrared Object Detection Task" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.64, + 0.788, + 0.792 + ], + "angle": 0, + "content": "Experimental Setup The M3FD [34] dataset is an infrared and visible target detection dataset that contains 4200 images. The dataset labels six targets (People, Cars, Bus, Motor, Trucks, Lamps) during driving. We use the infrared images from it for experimental performance validation. In the following description, we call this used dataset M3FD-inf. We follow the most common setting to use the detection heads in Mask R-CNN [18] and Cascade R-CNN [4] and fine-tune the pre-trained InfMAE model. We follow most of the settings of the benchmark ViT [12]. We report the performance of the target detection model under 25 epoch cosine scheduling with a base learning rate of 10e-4 and a weight decay of 0.1. The batch size is set to 2." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.81, + 0.787, + 0.842 + ], + "angle": 0, + "content": "Results on The M3FD-inf We compare the proposed method with the supervised methods DETR [5], Sparse R-CNN [47], DINO [6], YoloV8 [51] and" + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.784, + 0.127 + ], + "angle": 0, + "content": "11" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.785, + 0.187 + ], + "angle": 0, + "content": "Table 2: Performances of different object detection methods on the M3FD-inf [34] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + }, + { + "type": "table", + "bbox": [ + 0.218, + 0.199, + 0.784, + 0.324 + ], + "angle": 0, + "content": "
MethodsBackboneModelPeople(%)Car(%)Bus(%)Motor(%)Lamp(%)Truck(%)mAP(%)AP50(%)
DETR [5]ResNet101-78.588.187.875.865.978.146.779.0
Sparse R-CNN [47]ResNet50-84.288.788.075.366.274.048.379.4
DINO [6]Swin-L-83.287.585.661.560.473.545.375.3
YoloV8 [51]CSPDarkNet-42.854.358.232.516.240.740.863.0
Sup.(Scratch)ViT-BMask R-CNN83.388.690.172.466.479.148.780.0
Vanilla MAE [17]ViT-BMask R-CNN84.889.693.176.076.580.551.483.4
MCMAE [15]ViT-BMask R-CNN87.890.893.187.785.984.955.788.4
InfMAE(Ours)ViT-BMask R-CNN87.990.794.687.185.283.256.288.1
Sup.(Scratch)ViT-BCascade R-CNN83.788.691.168.263.979.050.979.1
Vanilla MAE [17]ViT-BCascade R-CNN85.288.994.372.272.679.652.882.1
MCMAE [15]ViT-BCascade R-CNN85.690.493.176.880.983.754.785.1
InfMAE(Ours)ViT-BCascade R-CNN85.790.494.981.981.483.455.886.3
" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.35, + 0.786, + 0.47 + ], + "angle": 0, + "content": "with the self-supervised methods vanilla MAE [17], MCMAE [15]. We report the AP50 of each class, the mAP and AP50 of all classes' performance of all methods, and the experiment results are shown in Table 2. As shown in this table, when combining the encoder of the proposed InfMAE and the detection head of the Cascade R-CNN [4] method, the proposed method outperforms all supervised methods. As for the self-supervised methods, the proposed method outperforms most of the SOTA methods. We can observe a similar experiment performance when using the head of Mask R-CNN method." + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.491, + 0.708, + 0.506 + ], + "angle": 0, + "content": "5.4 InfMAE on The Infrared Small Target Detection Task" + }, + { + "type": "text", + "bbox": [ + 0.218, + 0.514, + 0.786, + 0.603 + ], + "angle": 0, + "content": "Experimental Setup The IRSTD-1k [58] is a well-established infrared small target detection dataset that contains 1000 infrared modal images with pixel-level annotations. We replace the encoder in [33] with the multi-scale encoder module in InfMAE. During the training phase, we adopt the AdamW [36] optimizer with an initial learning rate of 0.001, a weight decay of 0.05, and a batch size of 2." + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.627, + 0.785, + 0.668 + ], + "angle": 0, + "content": "Table 3: Performances of different infrared small target detection methods on the IRSTD-1k dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + }, + { + "type": "table", + "bbox": [ + 0.302, + 0.68, + 0.703, + 0.811 + ], + "angle": 0, + "content": "
MethodsBackbonePd(%)AUC(%)F1(%)IoU(%)
LPNetGA [7]-77.160.650.834.1
DNANet [25]-89.687.876.461.8
ISTR [33]ViT-B85.886.169.453.1
Sup.(Scratch)ViT-B86.186.172.657.0
Vanilla MAE [17]ViT-B86.886.872.857.2
MCMAE [15]ViT-B74.290.878.464.5
UM-VPT [27]VPT-S99.688.973.558.1
InfMAE(Ours)ViT-B96.691.279.566.0
" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "12" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.359, + 0.127 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.253 + ], + "angle": 0, + "content": "Results on The IRSTD We compare the proposed method with the supervised methods LPNetGA [7], DNANet [25], ISTR [33], and with the self-supervised methods Vanilla MAE [17], MCMAE [15], UM-PVT [27]. According to the [14, 33], we report four main performance metrics: positive detection \\( P_{d} \\), AUC, pixel-level F1 score \\( F_{1} \\), and IoU in the table 3. From this table, we can see that the proposed foundation model outperforms all the SOTA methods in metrics of AUC, \\( F_{1} \\), and IoU." + }, + { + "type": "title", + "bbox": [ + 0.215, + 0.271, + 0.523, + 0.286 + ], + "angle": 0, + "content": "5.5 Ablation Study of The InfMAE" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.292, + 0.787, + 0.382 + ], + "angle": 0, + "content": "Module Ablation In this section, we validate the effect of the information-aware masking strategy and multi-scale strategy. We adopt the UperNet [55] as the segmentation head and the Mask R-CNN [18] as the object detection head. The results are shown in Table 4. From this Table, we can see that combining the proposed information-aware masking strategy and the introduced multi-scale strategy can achieve better performance in downstream tasks." + }, + { + "type": "table_caption", + "bbox": [ + 0.214, + 0.406, + 0.787, + 0.435 + ], + "angle": 0, + "content": "Table 4: Ablation study on the influence of the masking strategy and multi-scale strategy. The IAM means the information-aware masking strategy." + }, + { + "type": "table", + "bbox": [ + 0.244, + 0.446, + 0.761, + 0.521 + ], + "angle": 0, + "content": "
IAM Multi-scaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
-71.478.281.549.1
✓72.079.478.950.1
-72.179.886.355.0
✓74.382.588.156.2
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.565, + 0.788, + 0.716 + ], + "angle": 0, + "content": "Decoder Depth In this section, we analyze the effects of different decoder depths on the experimental performance of downstream tasks. We set the decoder depth to 2, 4, 8, and 12 respectively, and we also adopt the UperNet [55] and the Mask R-CNN [18] as the segmentation and object detection heads. The experimental performance is shown in the table 5. From the table, we can see that segmentation and detection gain the best result when the decoder depth is 2. From the experimental results, we can find that the infrared image does not need a deep decoder because of its lack of texture, detail, and color information. Meanwhile, we can observe from this table that the semantic performance is more sensitive to the decoder depth." + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.735, + 0.788, + 0.84 + ], + "angle": 0, + "content": "Masking Strides In this section, we analyze the experimental performance under different masking strides. For the mask strides, we select 2, 4, and 7, and the experimental results are shown in the table 6. From the table, we can see that when the masking stride is set to 4, the semantic segmentation metrics mIoU and mAcc are the best, while the detection metric AP50 is suboptimal. Considering that setting the sampling stride to 2 leads to an increase in the model's parameter count, we select a masking stride of 4." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "13" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.145, + 0.784, + 0.174 + ], + "angle": 0, + "content": "Table 5: The influence of increasing decoder depths on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + }, + { + "type": "table", + "bbox": [ + 0.248, + 0.185, + 0.756, + 0.259 + ], + "angle": 0, + "content": "
DecoderDepthSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.382.588.156.2
472.980.487.955.6
873.280.787.653.8
1274.081.987.254.1
" + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.271, + 0.785, + 0.313 + ], + "angle": 0, + "content": "Table 6: The influence of different masking strides of the information-aware masking strategy on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + }, + { + "type": "table", + "bbox": [ + 0.275, + 0.325, + 0.73, + 0.4 + ], + "angle": 0, + "content": "
StridesSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.282.089.356.1
474.382.588.156.2
771.879.988.054.9
1470.4--54.3
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.426, + 0.785, + 0.516 + ], + "angle": 0, + "content": "Pre-training Epochs For MAE, 1600 pre-training epochs can significantly improve the quality of the learned representations. To explore this effect of pretraining time, we train InfMAE with 200, 400, 800, and 1600 epochs and finetune the pre-trained models on downstream tasks. The experimental results can be seen in Table 7. From this table, we observe improved performances across most downstream tasks with an increase in pre-training epochs." + }, + { + "type": "table_caption", + "bbox": [ + 0.217, + 0.542, + 0.785, + 0.57 + ], + "angle": 0, + "content": "Table 7: The influence of increasing pre-training epochs on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + }, + { + "type": "table", + "bbox": [ + 0.241, + 0.582, + 0.763, + 0.657 + ], + "angle": 0, + "content": "
Pre-train EpochsSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
20071.378.987.455.4
40074.382.588.156.2
80074.983.188.355.9
160074.983.288.256.0
" + }, + { + "type": "text", + "bbox": [ + 0.217, + 0.705, + 0.786, + 0.84 + ], + "angle": 0, + "content": "Pre-training Dataset Size Analysis In this section, we present the impact of varying pre-training dataset sizes on downstream task performance, as documented in Table 8. The Inf10 and Inf15 contain 100K and 150K images which are sampled from Inf30 and the Inf50 contains 500K unprocessed images. The table indicates a progressive enhancement in performance with the increase in dataset size from 100K to 300K while from 300K to 500K does not yield a proportional increase. This phenomenon is likely due to the increasing similarity of images within the larger dataset, which results in a limited representation learning ability of the foundational model. The lack of diversity in the dataset restricts" + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "14" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.359, + 0.128 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "table_caption", + "bbox": [ + 0.216, + 0.145, + 0.785, + 0.174 + ], + "angle": 0, + "content": "Table 8: The influence of different pre-train data scales on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + }, + { + "type": "table", + "bbox": [ + 0.254, + 0.185, + 0.751, + 0.259 + ], + "angle": 0, + "content": "
Dataset ScaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
Inf1069.177.686.955.0
Inf1573.0--55.6
Inf3074.382.588.156.2
Inf5073.080.587.355.8
" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.284, + 0.784, + 0.329 + ], + "angle": 0, + "content": "the model's generalization ability to various downstream tasks. Thus, the findings highlight the significance of dataset quality and diversity in pre-training for optimal model performance." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.348, + 0.584, + 0.364 + ], + "angle": 0, + "content": "5.6 Pre-trained on Inf30 and ImageNet-1K" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.369, + 0.788, + 0.596 + ], + "angle": 0, + "content": "In this section, we discuss the importance of the large-scale infrared dataset in developing an infrared foundation model. To this end, the architecture of the vanilla MAE [17] is utilized for pre-training by 400 epochs on both the Inf30 dataset and the IN1K-30 dataset, the latter comprising 300k visible images randomly sampled from the ImageNet-1K [10] for fair comparison. To assess the generalization capabilities of the pre-trained models, we engage in infrared semantic segmentation using the MSRS-inf [48] dataset with UperNet [55], and infrared object detection on the M3FD-inf [34] dataset utilizing Mask R-CNN [18]. This experimental setting is consistent with the MAE [17]. The mIoUs and AP50 of vanilla MAE pre-trained with IN1K-30 are \\(66.7\\%\\) and \\(78.2\\%\\), while pre-trained with Inf30 are \\(71.6\\%\\) and \\(83.4\\%\\). These results show that the MAE [17] pre-trains on Inf30 exhibit stronger generalization capabilities in infrared downstream tasks. This observation underscores that the distribution variances indeed contribute to performance disparities. Hence, the release of a large-scale infrared dataset is crucial for the development of the foundation model." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.616, + 0.36, + 0.632 + ], + "angle": 0, + "content": "6 Conclusion" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.644, + 0.788, + 0.841 + ], + "angle": 0, + "content": "In this paper, we propose a foundation model in the infrared modality, named InfMAE. We collect a dataset containing 305,241 infrared images for self-supervised learning. Meanwhile, to enhance the model's capacity to learn the generalized representation, an information-aware masking strategy is proposed, which can make the network pay more attention to the reconstruction of the information-rich part of the image. Besides, based on the characteristics of infrared images, we design a new decoder structure. Finally, we validate the effectiveness of the proposed method InfMAE in infrared semantic segmentation, object detection, and small target detection tasks. The experimental results show that our InfMAE can obtain better experimental results than other supervised and self-supervised methods. In addition, we discuss some parameters in the InfMAE. We hope that the proposed foundation model InfMAE can promote the development of the infrared vision community." + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "15" + }, + { + "type": "title", + "bbox": [ + 0.218, + 0.145, + 0.403, + 0.163 + ], + "angle": 0, + "content": "Acknowledgements" + }, + { + "type": "text", + "bbox": [ + 0.214, + 0.181, + 0.788, + 0.257 + ], + "angle": 0, + "content": "This work is supported in part by the National Key R&D Program of China (2022YFA1004100), and in part by the National Natural Science Foundation of China (No. 62176035, 62201111, 12226004, 62272375), the Science and Technology Research Program of Chongqing Municipal Education Commission under Grant (No.KJZD-K202100606)." + }, + { + "type": "title", + "bbox": [ + 0.216, + 0.284, + 0.323, + 0.3 + ], + "angle": 0, + "content": "References" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.318, + 0.785, + 0.361 + ], + "angle": 0, + "content": "1. Awais, M., Naseer, M., Khan, S., Anwer, R.M., Cholakkal, H., Shah, M., Yang, M.H., Khan, F.S.: Foundational models defining a new era in vision: A survey and outlook (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.362, + 0.785, + 0.39 + ], + "angle": 0, + "content": "2. Bao, H., Dong, L., Piao, S., Wei, F.: Beit: Bert pre-training of image transformers. In: International Conference on Learning Representations (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.391, + 0.785, + 0.432 + ], + "angle": 0, + "content": "3. Bommasani, R., Hudson, D.A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M.S., Bohg, J., Bosselut, A., Brunskill, E., et al.: On the opportunities and risks of foundation models. arXiv preprint arXiv:2108.07258 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.433, + 0.785, + 0.474 + ], + "angle": 0, + "content": "4. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.476, + 0.785, + 0.517 + ], + "angle": 0, + "content": "5. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: Proceedings of the European conference on computer vision (ECCV). pp. 213-229. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.518, + 0.785, + 0.559 + ], + "angle": 0, + "content": "6. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 9650-9660 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.56, + 0.785, + 0.601 + ], + "angle": 0, + "content": "7. Chen, F., Gao, C., Liu, F., Zhao, Y., Zhou, Y., Meng, D., Zuo, W.: Local patch network with global attention for infrared small target detection. IEEE Transactions on Aerospace and Electronic Systems 58(5), 3979-3991 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.602, + 0.785, + 0.643 + ], + "angle": 0, + "content": "8. Chen, L.C., Zhu, Y., Papandreou, G., Schroff, F., Adam, H.: Encoder-decoder with atrous separable convolution for semantic image segmentation. In: Proceedings of the European conference on computer vision (ECCV). pp. 801-818 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.645, + 0.785, + 0.685 + ], + "angle": 0, + "content": "9. Chen, X., Gao, C., Li, C., Yang, Y., Meng, D.: Infrared action detection in the dark via cross-stream attention mechanism. IEEE Transactions on Multimedia 24, 288-300 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.226, + 0.687, + 0.785, + 0.728 + ], + "angle": 0, + "content": "0. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.729, + 0.785, + 0.784 + ], + "angle": 0, + "content": "11. Dong, X., Bao, J., Zhang, T., Chen, D., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N., Guo, B.: Peco: Perceptual codebook for bert pre-training of vision transformers. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 552-560 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.22, + 0.785, + 0.785, + 0.84 + ], + "angle": 0, + "content": "12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020)" + }, + { + "type": "list", + "bbox": [ + 0.22, + 0.318, + 0.785, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "16" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.359, + 0.127 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.787, + 0.189 + ], + "angle": 0, + "content": "13. Gao, C., Du, Y., Liu, J., Lv, J., Yang, L., Meng, D., Hauptmann, A.G.: Infar dataset: Infrared action recognition at different times. Neurocomputing 212, 36-47 (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.232 + ], + "angle": 0, + "content": "14. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE transactions on image processing 22(12), 4996-5009 (2013)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.232, + 0.787, + 0.272 + ], + "angle": 0, + "content": "15. Gao, P., Ma, T., Li, H., Lin, Z., Dai, J., Qiao, Y.: Mcmae: Masked convolution meets masked autoencoders. Advances in Neural Information Processing Systems 35, 35632-35644 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.273, + 0.787, + 0.327 + ], + "angle": 0, + "content": "16. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind one embedding space to bind them all. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 15180-15190. IEEE (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.328, + 0.787, + 0.37 + ], + "angle": 0, + "content": "17. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.787, + 0.398 + ], + "angle": 0, + "content": "18. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.399, + 0.787, + 0.453 + ], + "angle": 0, + "content": "19. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016. pp. 770-778. IEEE Computer Society (2016)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.453, + 0.787, + 0.495 + ], + "angle": 0, + "content": "20. He, Z., Cao, Y., Dong, Y., Yang, J., Cao, Y., Tisse, C.L.: Single-image-based nonuniformity correction of uncooled long-wave infrared detectors: A deep-learning approach. Applied optics 57(18), D155-D164 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.495, + 0.787, + 0.549 + ], + "angle": 0, + "content": "21. Kakogeorgiou, I., Gidaris, S., Psomas, B., Avrithis, Y., Bursuc, A., Karantzalos, K., Komodakis, N.: What to hide from your students: Attention-guided masked image modeling. In: European Conference on Computer Vision. pp. 300-318. Springer (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.55, + 0.787, + 0.591 + ], + "angle": 0, + "content": "22. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W., Dollár, P., Girshick, R.B.: Segment anything. CoRR abs/2304.02643 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.592, + 0.787, + 0.633 + ], + "angle": 0, + "content": "23. Kolesnikov, A., Beyer, L., Zhai, X., Puigcerver, J., Yung, J., Gelly, S., Houlsby, N.: Big transfer (bit): General visual representation learning. In: Proceedings of the European conference on computer vision (ECCV). pp. 491-507. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.634, + 0.787, + 0.66 + ], + "angle": 0, + "content": "24. Lab, A.S.: Thermal infrared dataset. https://projects.asl.ethz.ch/datasets/doku.php?id=ir:iricra2014" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.661, + 0.787, + 0.702 + ], + "angle": 0, + "content": "25. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.702, + 0.787, + 0.743 + ], + "angle": 0, + "content": "26. Li, G., Zheng, H., Liu, D., Wang, C., Su, B., Zheng, C.: Semmae: Semantic-guided masking for learning masked autoencoders. Advances in Neural Information Processing Systems 35, 14290-14302 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.744, + 0.787, + 0.785 + ], + "angle": 0, + "content": "27. Li, X., Wang, W., Yang, L., Yang, J.: Uniform masking: Enabling mae pretraining for pyramid-based vision transformers with locality. arXiv preprint arXiv:2205.10063 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.786, + 0.787, + 0.813 + ], + "angle": 0, + "content": "28. Li, Y., Liu, H., Tian, Z., Geng, W.: Near-infrared vascular image segmentation using improved level set method. Infrared Physics & Technology 131, 104678 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.814, + 0.787, + 0.84 + ], + "angle": 0, + "content": "29. Li, Y., Xie, S., Chen, X., Dollar, P., He, K., Girshick, R.: Benchmarking detection transfer learning with vision transformers. arXiv preprint arXiv:2111.11429 (2021)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.84 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "header", + "bbox": [ + 0.357, + 0.115, + 0.732, + 0.129 + ], + "angle": 0, + "content": "InfMAE: A Foundation Model in The Infrared Modality" + }, + { + "type": "page_number", + "bbox": [ + 0.769, + 0.117, + 0.785, + 0.127 + ], + "angle": 0, + "content": "17" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.19 + ], + "angle": 0, + "content": "30. Li, Z., Chen, Z., Yang, F., Li, W., Zhu, Y., Zhao, C., Deng, R., Wu, L., Zhao, R., Tang, M., et al.: Mst: Masked self-supervised transformer for visual representation. Advances in Neural Information Processing Systems 34, 13165-13176 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.19, + 0.788, + 0.232 + ], + "angle": 0, + "content": "31. Li, Z.Y., Gao, S., Cheng, M.M.: Sere: Exploring feature self-relation for self-supervised transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(12), 15619-15631 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.233, + 0.788, + 0.274 + ], + "angle": 0, + "content": "32. Lin, F., Ge, S., Bao, K., Yan, C., Zeng, D.: Learning shape-biased representations for infrared small target detection. IEEE Transactions on Multimedia pp. 1-12 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.276, + 0.788, + 0.317 + ], + "angle": 0, + "content": "33. Liu, F., Gao, C., Chen, F., Meng, D., Zuo, W., Gao, X.: Infrared small and dim target detection with transformer under complex backgrounds. IEEE Transactions on Image Processing 32, 5921-5932 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.318, + 0.788, + 0.374 + ], + "angle": 0, + "content": "34. Liu, J., Fan, X., Huang, Z., Wu, G., Liu, R., Zhong, W., Luo, Z.: Target-aware dual adversarial learning and a multi-scenario multi-modality benchmark to fuse infrared and visible for object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5802-5811 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.374, + 0.788, + 0.416 + ], + "angle": 0, + "content": "35. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.416, + 0.788, + 0.472 + ], + "angle": 0, + "content": "36. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net (2019), https://openreview.net/forum?id=Bkg6RiCqY7" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.473, + 0.788, + 0.514 + ], + "angle": 0, + "content": "37. Lüddecke, T., Ecker, A.S.: Image segmentation using text and image prompts. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA, June 18-24, 2022. pp. 7076-7086. IEEE (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.515, + 0.788, + 0.571 + ], + "angle": 0, + "content": "38. Madan, N., Ristea, N.C., Ionescu, R.T., Nasrollahi, K., Khan, F.S., Moeslund, T.B., Shah, M.: Self-supervised masked convolutional transformer block for anomaly detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 46(1), 525-542 (2024)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.571, + 0.594, + 0.586 + ], + "angle": 0, + "content": "39. OpenAI: Gpt-4 technical report. PREPRINT (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.587, + 0.788, + 0.614 + ], + "angle": 0, + "content": "40. OTCBVS: Otcbvs benchmark dataset collection. https://vcipl-okstate.org/pbvs/bench/index.html" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.615, + 0.788, + 0.657 + ], + "angle": 0, + "content": "41. Pan, H., Hong, Y., Sun, W., Jia, Y.: Deep dual-resolution networks for real-time and accurate semantic segmentation of traffic scenes. IEEE Transactions on Intelligent Transportation Systems 24(3), 3448-3460 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.657, + 0.788, + 0.713 + ], + "angle": 0, + "content": "42. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.713, + 0.788, + 0.77 + ], + "angle": 0, + "content": "43. Reed, C.J., Gupta, R., Li, S., Brockman, S., Funk, C., Clipp, B., Keutzer, K., Candido, S., Uytendaele, M., Darrell, T.: Scale-mae: A scale-aware masked autoencoder for multiscale geospatial representation learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4088-4099 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.77, + 0.788, + 0.798 + ], + "angle": 0, + "content": "44. Reporter, T.M.: Infrared camera finds 6-year-old lost in deep woods. https://www.youtube.com/watch?v=-FajSFRlKIo" + }, + { + "type": "ref_text", + "bbox": [ + 0.214, + 0.799, + 0.788, + 0.842 + ], + "angle": 0, + "content": "45. Scheibenreif, L., Mommert, M., Borth, D.: Masked vision transformers for hyperspectral image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2165-2175 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.214, + 0.147, + 0.788, + 0.842 + ], + "angle": 0, + "content": null + } + ], + [ + { + "type": "page_number", + "bbox": [ + 0.218, + 0.116, + 0.236, + 0.127 + ], + "angle": 0, + "content": "18" + }, + { + "type": "header", + "bbox": [ + 0.272, + 0.115, + 0.359, + 0.127 + ], + "angle": 0, + "content": "F. Liu et al." + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.147, + 0.785, + 0.189 + ], + "angle": 0, + "content": "46. St-Charles, P.L., Bilodeau, G.A., Bergevin, R.: Mutual foreground segmentation with multispectral stereo pairs. In: Proceedings of the IEEE International Conference on Computer Vision Workshops. pp. 375-384 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.218, + 0.19, + 0.787, + 0.245 + ], + "angle": 0, + "content": "47. Sun, P., Zhang, R., Jiang, Y., Kong, T., Xu, C., Zhan, W., Tomizuka, M., Li, L., Yuan, Z., Wang, C., et al.: Sparse r-cnn: End-to-end object detection with learnable proposals. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14454-14463 (2021)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.246, + 0.785, + 0.285 + ], + "angle": 0, + "content": "48. Tang, L., Yuan, J., Zhang, H., Jiang, X., Ma, J.: Piafusion: A progressive infrared and visible image fusion network based on illumination aware. Information Fusion 83-84, 79-92 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.287, + 0.785, + 0.328 + ], + "angle": 0, + "content": "49. Tian, Z., Liu, H., Li, Q.: Vu-net: A symmetric network-based method for near-infrared blood vessel image segmentation. In: International Conference on Man-Machine-Environment System Engineering. pp. 275–280. Springer (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.328, + 0.785, + 0.37 + ], + "angle": 0, + "content": "50. Tong, Z., Song, Y., Wang, J., Wang, L.: Videomae: Masked autoencoders are data-efficient learners for self-supervised video pre-training. Advances in neural information processing systems 35, 10078-10093 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.371, + 0.765, + 0.384 + ], + "angle": 0, + "content": "51. ultralytics: ultralytics, 2023. https://github.com/ultralytics/ultralytics" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.384, + 0.785, + 0.411 + ], + "angle": 0, + "content": "52. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.411, + 0.785, + 0.467 + ], + "angle": 0, + "content": "53. Wang, L., Huang, B., Zhao, Z., Tong, Z., He, Y., Wang, Y., Wang, Y., Qiao, Y.: Videomae v2: Scaling video masked autoencoders with dual masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14549-14560 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.467, + 0.785, + 0.522 + ], + "angle": 0, + "content": "54. Woo, S., Debnath, S., Hu, R., Chen, X., Liu, Z., Kweon, I.S., Xie, S.: Convnext v2: Co-designing and scaling convnets with masked autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16133-16142 (2023)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.522, + 0.785, + 0.564 + ], + "angle": 0, + "content": "55. Xiao, T., Liu, Y., Zhou, B., Jiang, Y., Sun, J.: Unified perceptual parsing for scene understanding. In: Proceedings of the European conference on computer vision (ECCV). pp. 418-434 (2018)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.564, + 0.785, + 0.605 + ], + "angle": 0, + "content": "56. Xu, Z., Zhuang, J., Liu, Q., Zhou, J., Peng, S.: Benchmarking a large-scale fir dataset for on-road pedestrian detection. Infrared Physics & Technology 96, 199-208 (2019)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.606, + 0.785, + 0.647 + ], + "angle": 0, + "content": "57. Yin, M., Yao, Z., Cao, Y., Li, X., Zhang, Z., Lin, S., Hu, H.: Disentangled non-local neural networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 191-207. Springer (2020)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.647, + 0.785, + 0.688 + ], + "angle": 0, + "content": "58. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.689, + 0.785, + 0.73 + ], + "angle": 0, + "content": "59. Zhang, R., Guo, Z., Gao, P., Fang, R., Zhao, B., Wang, D., Qiao, Y., Li, H.: Point-m2ae: multi-scale masked autoencoders for hierarchical point cloud pre-training. Advances in neural information processing systems 35, 27061-27074 (2022)" + }, + { + "type": "ref_text", + "bbox": [ + 0.217, + 0.73, + 0.785, + 0.772 + ], + "angle": 0, + "content": "60. Zhang, X., Demiris, Y.: Visible and infrared image fusion using deep learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(8), 10535-10554 (2023)" + }, + { + "type": "list", + "bbox": [ + 0.217, + 0.147, + 0.787, + 0.772 + ], + "angle": 0, + "content": null + } + ] +] \ No newline at end of file diff --git a/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_origin.pdf b/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5f272032881eebf82aa35fd21f0ce36a171b6eb0 --- /dev/null +++ b/2024/InfMAE_ A Foundation Model in The Infrared Modality/27243eca-1887-4c8e-8b92-89b601b015c1_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6559be94a91502b3e6dab1ff8283e453d4b824f30f60edaa062329828d6f7625 +size 782867 diff --git a/2024/InfMAE_ A Foundation Model in The Infrared Modality/full.md b/2024/InfMAE_ A Foundation Model in The Infrared Modality/full.md new file mode 100644 index 0000000000000000000000000000000000000000..3892b23fd05aaa798894f35c13d84ecab81fc74d --- /dev/null +++ b/2024/InfMAE_ A Foundation Model in The Infrared Modality/full.md @@ -0,0 +1,319 @@ +# InfMAE: A Foundation Model in The Infrared Modality + +Fangcen Liu $^{1}$ , Chenqiang Gao $^{2*}$ , Yaming Zhang $^{1}$ , Junjie Guo $^{1}$ , Jinghao Wang $^{2}$ , and Deyu Meng $^{3}$ + +1 School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China. {liufc67, YummyZhang1989, gjj893866738} @ gmail.com + +$^{2}$ School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen, Guangdong 518107, China. {gaochq6, wangjh298}@mail.sysu.edu.cn + +3 School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, Shanxi, 710049, China, and School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China. dymeng@mail.xjtu.edu.cn + +Abstract. In recent years, foundation models have swept the computer vision field, facilitating the advancement of various tasks within different modalities. However, effectively designing an infrared foundation model remains an open question. In this paper, we introduce InfMAE, a foundation model tailored specifically for the infrared modality. Initially, we present Inf30, an infrared dataset developed to mitigate the scarcity of large-scale data for self-supervised learning within the infrared vision community. Moreover, considering the intrinsic characteristics of infrared images, we design an information-aware masking strategy. It allows for a greater emphasis on the regions with richer information in infrared images during the self-supervised learning process, which is conducive to learning strong representations. Additionally, to enhance generalization capabilities in downstream tasks, we employ a multi-scale encoder for latent representation learning. Finally, we develop an infrared decoder to reconstruct images. Extensive experiments show that our proposed method InfMAE outperforms other supervised and self-supervised learning methods in three key downstream tasks: infrared image semantic segmentation, object detection, and small target detection. + +Keywords: Infrared Foundation Model $\cdot$ Infrared Image Segmentation $\cdot$ Infrared Object Detection $\cdot$ Infrared Small Target Detection. + +# 1 Introduction + +Infrared imaging plays a crucial role and finds extensive applications in low-light even dark and smoky conditions [9,25,60] since they utilize the thermal radiation of objects for imaging, which can effectively alleviate adverse effects caused by challenging environmental conditions. Currently, computer vision tasks in the + +infrared vision community, such as object detection [32, 33], and semantic segmentation [28, 49], are explored by task-specific designed models. While these models can yield superior performance on individual tasks, they are often challenged by their limited generalizability. + +![](images/8a534d0279e13261e6a3abc295b64660b24f473f65b4550bd126a0c3e0e9eab8.jpg) + +![](images/cb167c7f0f1ebec8d44cbd76c7aa1ddd353f95d984c3bba8e813cc3d17c963b8.jpg) +Visible Images +Fig. 1: Visual comparison of infrared and visible images. Compared to visible images, infrared images display diminished informational content due to their inherent lack of rich texture and color details. For example, objects such as zebra crossings, telephone poles, and road signs in the red box are often submerged in their surroundings due to their similar temperature to the surrounding environment. + +![](images/7069e319b93afc0dbe0242cd6d34a687d542965864b8383484a1c37a0b5ed126.jpg) + +![](images/accb13b02f9d9135c834c63c18ed7dfd20e851b55fcab78cbde24b95d3225ccf.jpg) +Infrared Images + +![](images/2243030154816e792a53ad8469e050bafa922180e69c81dfc74e379c483e4d6a.jpg) + +![](images/3cc80aefdccec70a28e56c63bcdbfc320c203c30da573b648035dfaefadd8765.jpg) +Visible Images + +![](images/1273077aef3256489b905d2721046212ad3f150933bd7d11a6feb22da00ab51c.jpg) + +![](images/b0cf640024cd303c41724f236013f7f22039c5d262233d8f41ece268287654fa.jpg) +Infrared Images + +The foundation model refers to a large, general deep learning model that learns extensive knowledge through pre-training on a large-scale dataset and can be adapted to various downstream tasks by fine-tuning or prompting [1, 3, 42]. The Transformer-based model like ViT [12] is one of the representative vision foundation models, which are trained on a large-scale dataset and outperforms the ResNet-based method [23] on the downstream tasks. To better learn the powerful representation of a foundation model from a large number of unlabeled data, self-supervised learning is the primary choice [31]. The self-supervised learning frameworks, such as BEiT [2], DINO [6], and Mask Autoencoders (MAE) [17], achieve impressive performance across various downstream vision tasks [29, 45]. Notably, the MAE [17] has verified superior representation learning ability and scalability. This model is pre-trained on the ImageNet-1K dataset [10]. Then, the pre-trained encoder of the MAE [17] serves as a sufficient feature extraction backbone, achieving excellent performance on classification, detection, and segmentation tasks. Following the self-supervised learning frameworks, pre-trained foundation models have emerged in various modalities, e.g., VideoMAE [50, 53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a comparable foundation model has not yet emerged in the infrared modality. + +Intuitively, a feasible solution is to directly employ the pre-trained visible MAE on infrared downstream tasks. However, as delineated in Section 5.6, our + +experimental findings suggest this is suboptimal, primarily due to significant disparities in imaging characteristics between infrared and visible modalities. Fig. 1 illustrates these differences. We can observe that infrared images exhibit less information compared to visible images, which lack rich texture and color details. For instance, objects like zebra crossings and power lines in Fig. 1 lack color and texture information in infrared images, making them indistinguishable from the surrounding environment. These differences cause a noticeable gap between the infrared and visible modalities. The most straightforward strategy to mitigate this disparity is to train the MAE model on an extensive infrared dataset. However, there appears to be a limited availability of a large-scale dataset in the infrared modality. Consequently, it becomes important to build a large-scale infrared dataset to facilitate the training of an infrared foundation model. In this paper, we begin by gathering a large number of infrared images. Through image preprocessing like reducing redundancy, we finally obtain an infrared dataset named Inf30, which addresses the existing data scarcity within the infrared modality. + +Due to the less information on infrared images, directly applying the vanilla MAE [17] architecture to the infrared modality is also a feasible but not the optimal choice, as the experiment shows in Sections 5.2, 5.3 and 5.4. The vanilla MAE adopts the random mask strategy. Directly applying this strategy to infrared images may cause the masking tokens to focus more on the information-poor part which is less conducive to representation learning. Previous researches [21, 26] argued that masking tokens with rich semantic information could improve the representation learning ability of the self-supervised method, and introduced the semantic-guided masking strategy. However, these methods do not account for the unique characteristics of the infrared modality and require the addition of new semantic-aware branches in the frameworks. + +In this paper, we propose a simple yet effective foundation model in the infrared modality named InfMAE that can be extensively generalized to downstream tasks, such as infrared semantic segmentation, object detection, and small target detection. To enhance the representation capabilities for infrared images, we design an information-aware masking strategy, which facilitates the selective masking of regions with richer information without designing an additional complex semantic awareness branch. In addition, we employ a multi-scale strategy to enhance generalization capabilities in downstream tasks. Finally, based on the characteristics of infrared images, we adopt a new infrared decoder module for image reconstruction. + +We summarize the main contributions of this paper as follows: + +- We collect and preprocess a large number of infrared images, and finally release an infrared dataset Inf30 for self-supervised learning, which consists of 305241 infrared images. +- We propose the InfMAE, a simple yet effective foundation model in the infrared modality. To the best of our knowledge, this is the first attempt to build a foundation model within the infrared modality. + +- Considering the characteristics of infrared imaging, we design an information-aware masking strategy and an infrared decoder. These designs enhance the model's ability to learn strong representations. + +- The experimental results show that the method proposed in this paper outperforms state-of-the-art methods, achieving the best performance in downstream tasks. + +# 2 Related Work + +# 2.1 The Foundation Model + +The foundation models are trained on a large-scale dataset in a self-supervised manner, making them adaptable for various downstream tasks [3]. The foundation model can be categorized into four categories based on different inputs: traditional models, textually prompted models, visually prompted models, and heterogeneous modalities-based models [1]. Traditional foundational models usually take only images as input, such as ResNet [19] based on convolutional neural networks, as well as ViT [12] based on the Transformer architecture. The textually prompted models like CLIP [42] and GPT-4 [39] took the textual prompt and the image as the inputs, and the textual prompt established correlations between text and images, contributing to achieving zero-shot transfer. The visually prompted models [22,37] could be prompted by various prompt types, e.g., text, bounding boxes, or a semantical mask to get the target segmentation. The heterogeneous modalities-based models usually combine the various prompt types and the aligned multiple paired modalities, e.g., image-audio, image-video, etc., to learn meaningful representations. The ImageBind [16] is the representative work. In this study, we attempt to explore the traditional foundation model in the infrared modality. + +# 2.2 The Masked Image Modeling and Representation Learning + +The Masked Image Modeling (MIM) [2,15,17,38] is an emerging self-supervised learning approach, i.e., by randomly masking a part of the input image and then reconstructing it. This learning method is simple yet effective in learning representations with high generality from a large-scale of data for downstream takes. BEiT [2] and MAE [17] are pioneering works. BEiT [2] used a bidirectional encoder representation to recover the original visual token based on the corrupted image patches. MAE [17] pre-trained the ViT encoder by randomly masking the image tokens, feeding the visible tokens into the encoder, and then reconstructing the masked tokens through the decoder. Based on MAE, pre-trained foundation models based on MIM learning have emerged in various modalities, e.g., VideoMAE [50,53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a MIM-based foundation model is not yet available in the infrared modality. + +In addition to extending MIM methods to other modalities, methods also focus on designing mask strategies and how to reconstruct images. Regarding the + +masking strategy, methods like MST [30] and ATTMask [21] utilized attention maps to guide the masking strategy. SemMAE [26] used semantic information in images to select mask regions. UM-PVT [27] adopted a unified mask approach for masking learning. Regarding image reconstruction, some works [2, 11] adopted tokens produced by VQ-VAE [52] or its variants. + +In this study, we explore a new masking strategy and decoder structure for infrared image reconstruction, according to the characteristics of infrared images. + +![](images/e73bf355602b55c2366e96d44e8acf9385a7de81237fc8bf7fd822ad0ea9bfc1.jpg) + +![](images/777aa3966fb2a3f9da7d838cb7b7dbd1e292ff1ce8dceca608352b52ec272741.jpg) +Fig. 2: Some samples of the Inf30. The environments in the collected dataset encompass skies, seascapes, forests, urban areas, suburban areas, lawns, and so on. The objects include ships, vehicles, pedestrians, public facilities, residential buildings, and so on. + +![](images/48c32df72a0d74728fd153588f64a84bb3bda584f3e680f19937ad91a43dc6f8.jpg) + +![](images/c3e260e6eb45467c206f6cf057bc4a1cca725a25274eefa8987dc31d5fb08aa2.jpg) + +![](images/734bed7e205841562ec9f601d325905ffd6308f2c87b2e59efb1376a8f97dea1.jpg) + +![](images/b9aeef05d261f98793788829670e50421b1af207ce68199f4ae48acb9ce4aa64.jpg) + +![](images/17086b19529e712ea6e0e9ab33e78e6ed891078d19e3b4319d4ae9694b3a5b86.jpg) + +![](images/452c7ff5ec0d24bdf42e62f9eca18c0ddd01130a89220ca55e6c3f763e9f318c.jpg) + +![](images/ba07ad74ac0a1c16c53556c73f8fb68bc35769d65a769e546c05f7652a6f290a.jpg) + +![](images/2e9df8e1c36f024f8a7dd5b2e7334f4d6000739fa2f98f5b646501af506434a6.jpg) + +![](images/5882c696047e05caff17625507909b1c1af1e229e932366c59e8e7585e7063f9.jpg) + +![](images/f11ac7e701e9c90689d8a669fa06eec361b809220cb791f99cc0f273db04ca6c.jpg) + +# 3 Pre-training Dataset Preparation: Inf30 + +# 3.1 Collection and Preprocessing + +A large-scale dataset is essential for training the foundation model. Hence, this study has constructed a dataset named Inf30. The diversity of the images is important for learning the generalized representation. Hence, we extensively collect about 500K of infrared images from various websites [13, 20, 24, 40, 44, 46, 56]. However, the quality of these images is uneven. For example, the images extracted from the same video exhibit significant similarity, leading to a reduction in image diversity. Additionally, some infrared images obtained from the internet pose challenges due to their extremely low resolution. Consequently, we initiate preprocessing all of the collected images to improve the quality of the infrared dataset. + +As for the issue of high similarity in infrared images, we initially selected one image as the anchor. Subsequently, we eliminated those images that have a closely resembling scene with the anchor image and retained images that exhibit substantial dissimilarity. As for the issue of low resolution, we conducted data cleaning by removing images with both width and height of less than 20 pixels. + +After collecting and preprocessing the infrared images, we finally obtained 305,241 images. As illustrated in Fig. 2, the scene in our dataset encompasses + +skies, seascapes, forests, urban areas, suburban areas, lawns, and schools, while the objects include various types of ships, vehicles, pedestrians, public facilities, and residential buildings. The minimum resolution of images is $40 \times 23$ , and the maximum resolution of images is $6912 \times 1024$ . + +# 3.2 Detail Information Analysis + +In this section, we analyze the detail richness of our Inf30 and the well-established ImageNet-1K [10]. We employ the information entropy to measure the information of an image, which can reflect the detail richness. The information entropy is defined as follows: + +$$ +H (X) = - \sum_ {i = 1} ^ {n} P \left(x _ {i}\right) \cdot \log_ {2} \left(P \left(x _ {i}\right)\right), \tag {1} +$$ + +where $n$ is the number of brightness levels in the image, $x_{i}$ represents each brightness level, and $P(x_{i})$ is the probability of the brightness level in the image. We calculate the information entropy of images in the Inf30 and ImageNet-1K datasets. The average information entropy of Inf30 is 6.44, while the average information entropy of ImageNet-1K is 7.19. This reveals that the visible dataset exhibits richer information compared to the infrared image dataset. + +Recognizing the low information richness of infrared images, this study introduces an information-aware masking strategy to enhance the generalized representation learning ability of the foundation model. + +# 4 Method + +# 4.1 Overview + +As depicted in Fig. 3, the proposed InfMAE architecture consists of three principal modules: 1) the mask block generation module, 2) the multi-scale encoder module, and 3) the infrared decoder module. In the mask block generation module, we adopt an information-aware masking strategy on input tokens to get visible token IDs, mask_block1, and mask_block2, which are used in the multiscale encoder module. In the multi-scale encoder module, inspired by the MCMAE [15], we combine convolution and self-attention mechanisms to conduct multi-scale representation learning for the visible tokens. In the infrared decoder module, we integrate the multi-scale representation with the learned visible tokens for image reconstruction. + +# 4.2 The Structure of the Proposed InfMAE + +The Mask Block Generation Module Since infrared images lack color and texture details, employing a random masking strategy, as done by the vanilla MAE [17], would result in excessive masking of information-poor regions. This could undermine the network's capacity to develop robust representations from + +![](images/1a27b3dbe4b83c9a2df19f43175e9b09bad68621fb4e9488e97cc65ddbb399fe.jpg) +Fig. 3: The framework of the proposed InfMAE. It contains three modules: the mask block generation module, the multi-scale encoder module, and the infrared decoder module. The features connected by the red dashed lines in the multi-scale encoder module are fed into the infrared decoder module. + +infrared images. Hence, this study proposes an information-aware masking strategy that can dynamically adjust mask tokens according to the image context. + +Given an input image $x \in \mathbb{R}^{H \times W \times C}$ , where $C, H,$ and $W$ denote the number of channels, height, and width respectively. $x$ is first input into the information analysis part to get the intensity-wise feature map. The information analysis part is a convolution with both the kernel size and stride set to 16. Then we calculate the mean value of the intensity-wise feature map along the channel dimension and obtain the gray value map $I \in \mathbb{R}^{\frac{H}{16} \times \frac{W}{16}}$ . After that, the gray value map is flattened to $N$ tokens, $N = \frac{H}{16} \times \frac{W}{16}$ . Meanwhile, these tokens are arranged in descending order of their gray values, where a higher value means that the information is richer. As depicted in the lower left corner of Fig. 3, each box represents a token, and the number within the box is the sorted token ID. After that, we perform the information-aware masking strategy on the sorted tokens, with a sampling stride $S$ . Specifically, we sample the sorted tokens at an interval of $S$ . The sampled tokens are the visible tokens and the rest are masked tokens. Meanwhile, we record the orders of the visible tokens' IDs and the masked tokens' IDs. These IDs are used as a reference for generating mask blocks. + +For mask block generation, we first obtain a binary value mask template through the ID mapping according to the sorted tokens IDs. In the mask template in Fig. 3, the white area is the visible token while the black area is the masked token. Then we up-sample the mask template two and four times to get the mask_block2 and mask_block1 for the following multi-scale learning in the multi-scale encoder module. + +The Multi-scale Encoder Module Inspired by previous works like MCMAE [15] and ConvNeXt [54], we introduce a multi-scale encoder for visible token learning. This multi-scale encoder module mainly contains three encoder layers, + +which are two CNN-based encoders, named encoder layer 1 and encoder layer 2, and one Transorfmer-based encoder, named encoder layer 3. Such three encoder layers can output feature maps with multi-scale spatial resolution, which are $F_{1} \in \mathbb{R}^{\frac{H}{4} \times \frac{W}{4} \times C_{1}}$ , $F_{2} \in \mathbb{R}^{\frac{H}{8} \times \frac{W}{8} \times C_{2}}$ , and $T_{s} \in N_{v} \times C_{3}$ , respectively. The $N_{v}$ is the number of the visible tokens. Specifically, we first input the image $x$ into the patch embedding 1 and encoder layer 1 to obtain the feature map $F_{1}$ . It should be noted that after the patch embedding 1 and token-wise convolution, we obtain the feature map $E_{1} \in \mathbb{R}^{\frac{H}{4} \times \frac{W}{4} \times C_{1}}$ , and then we dot $E_{1}$ and mask_block1 which are obtained in mask block generation module to mask the original feature. Finally, we follow [15] and adopt the convolutional attention (Conv Attention) and FFN. Same as encoder layer 1, the $F_{1}$ is inputted into patch embedding 2 and encoder layer 2 to obtain the feature maps $F_{2} \in \mathbb{R}^{\frac{H}{8} \times \frac{W}{8} \times C_{2}}$ . + +After the patch embedding 3 and a linear operation, the $F_{2}$ is flattened into $N$ tokens $T\in N\times C_3$ . Then, we select the visible tokens from the $N$ tokens according to the visible token IDs obtained by the mask block generation module. Finally, we use the encoder layer 3 whose structure is the same as the ViT [12] encoder layer, and obtain the learned visible tokens $T_{s}\in N_{v}\times C_{3}$ . + +The Infrared Decoder Module In this study, we combine the multi-scale visible tokens and mask tokens and take them into the decoder for image reconstruction. Specifically, we normalize the multi-scale features $F_{1}$ and $F_{2}$ to the same size and then flatten them into the same shape with $T$ . After that, we obtain the visible tokens $T_{1}$ and $T_{2}$ according to the visible token IDs. Then, we add all the values of visible tokens $T_{1}, T_{2}$ , and $T_{s}$ and concat both masked tokens and visible tokens along the first dimension. Meanwhile, we restore the order of these tokens based on the ID number in the mask block generation module. We feed the restored tokens into the decoder for image reconstruction. It is worth noting that infrared images lack many details and color information, so in this study, we set the infrared decoder depth to 2 for image reconstruction, whose structure is the same as the decoder of MAE [17]. + +The loss function measures the Mean Square Error (MSE) between the masked patches of reconstructed image $y$ and the original image $x$ . The MSE loss is defined as follows: + +$$ +\mathcal {L} _ {m s e} = \frac {1}{M} \sum_ {i = 1} ^ {M} \left(y _ {i} - x _ {i}\right) ^ {2}, \tag {2} +$$ + +where the $M$ means the number of images. + +# 4.3 InfMAE for Downstream Tasks + +After the self-supervised pre-training, InfMAE learns multi-scale feature maps, which can be employed for existing infrared semantic segmentation, object detection, and small target detection methods. To finetune InfMAE for these downstream tasks, we extract the $F_{1}$ and $F_{2}$ obtained by the encoder layer 1 and + +encoder layer 2. Meanwhile, we reshape $T_{s}$ to the feature $F_{3} \in \mathbb{R}^{\frac{H}{16} \times \frac{W}{16} \times C_{3}}$ and downsample the $F_{3}$ to $F_{4} \in \mathbb{R}^{\frac{H}{32} \times \frac{W}{32} \times C_{4}}$ by a convolution layer. It should be noted that when finetuning InfMAE for these downstream tasks, the shape of $T_{s}$ is $N \times C_{3}$ . Finally, $F_{1}, F_{2}, F_{3}$ , and $F_{4}$ are input into the downstream methods. + +# 5 Experiment + +Initially, the proposed InfMAE is subjected to self-supervised pre-training using the released Inf30 dataset. Then, to assess the generalizability and robustness of InfMAE, it is applied to a series of downstream tasks. Finally, a series of ablation studies are conducted to confirm the efficacy and validity of the InfMAE framework. + +# 5.1 Pre-training Setup + +The framework of the proposed InfMAE is implemented using pytorch 1.12.0 and accelerated by CUDA 11.6 on 4 A100 GPUs. The sampling stride $s$ of the information-aware masking strategy is set by default to 4. The number of the encoder layer 1, encoder layer 2, and encoder layer 3 are set to 2, 2, and 11, respectively. Meanwhile, the Transformer-based encoder layer 3 with 768 feature dimensions and 12 attention heads. The infrared decoder is configured with two transformer layers, each having 512 feature dimensions and 12 attention heads. For training optimization, we adopt a 400-epoch cosine learning rate schedule, incorporating a 40-epoch warm-up phase. Optimization is achieved through the AdamW [36] optimizer, which is set to a base learning rate of $1.5 \times 10^{-4}$ , a weight decay of 0.05, and a batch size of 256. Additionally, random cropping is employed as a data augmentation strategy during pre-training. + +# 5.2 InfMAE on The Infrared Semantic Segmentation Task + +Experimental Setup The MSRS [48] dataset is a semantic segmentation dataset of 1444 paired infrared and visible images. The training set contains 1083 pairs of infrared and visible images and the testing set consists of 361 image pairs. The images are categorized into eight major urban driving-related classes (Cars, People, Bicycles, Curves, Car Stops, Guardrails, Color Cones, and Bumps), providing a robust basis for urban scene analysis. In our experiments, we use the infrared component of the MSRS dataset, referred to as MARS-inf in the following description, to validate the performance of our method. We adopt UperNet [55] and FCN [35], the hierarchical segmentation network headers, to compare the effectiveness of pre-trained InfMAE with other SOTA methods. We use a 24k iteration polynomial learning rate scheme with the first 1500 iterations warmed up. The AdamW [36] optimizer is used, with an initial learning rate of 10e-4, weight decay of 0.05, and a batch size of 2. + +Results on The MSRS-inf In our comparative analysis, the performance of the proposed method is evaluated against both supervised methods UperNet [55], DeeplabV3 + [8], DNLNet [57], DDRNet [41], and self-supervised methods vanilla MAE [17], MCMAE [15], UM-PVT [27]. We evaluate these methods using metrics such as the Intersection over Union (IoU) for each class, the mean Intersection over Union (mIoU) across all classes, and the mean accuracy (mAcc) for all classes. The experimental results are shown in Table 1. We first combine the encoder of the proposed InfMAE and the segmentation head of the Upernet [55] and train the method from scratch in a supervised manner. Compared with this method, leveraging the pre-trained weights of this encoder significantly enhances performance, as shown in Table 1. Meanwhile, compared with other supervised and self-supervised methods, the proposed method outperforms them a lot. + +To evaluate the generalisability of the proposed InfMAE to other segmentation methods, we also use the FCN [35] head for semantic segmentation. As can be seen in Table 1, the proposed method outperforms all the SOTA methods. + +Table 1: Comparison with different semantic segmentation methods on the MSRSinf [48] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively. + +
MethodsBackboneModelCar(%)Person(%)Bike(%)Curve(%)Car_Stop(%)Guardrail(%)Color_Cone(%)Bumb(%)mIoU(%)mAcc(%)
UperNet [55]Resnet50-82.667.264.247.355.156.653.965.965.674.7
DeeplabV3+ [8]Resnet50-84.269.563.745.154.768.844.558.865.273.8
DNLNet [57]Resnet101-86.766.568.050.557.756.750.369.667.075.7
DDRRNet [41]--87.069.666.847.061.051.356.268.867.373.3
Sup.(Scratch)ViT-BFCN75.463.755.936.449.146.928.655.756.563.4
Vanila MAE [17]ViT-BFCN83.267.362.644.558.157.745.060.564.171.6
UM-VPT [27]VPT-SFCN80.367.361.441.154.259.138.761.962.470.1
MCMAE [15]ViT-BFCN86.568.866.855.068.367.052.372.770.678.7
InfMAE(Ours)ViT-BFCN88.270.168.256.170.067.554.574.972.080.0
Sup.(Scratch)ViT-BUperNet74.050.741.249.735.640.544.055.961.161.1
Vanilla MAE [17]ViT-BUperNet86.672.366.056.269.770.254.968.171.478.2
UM-VPT [27]VPT-SUperNet87.272.166.654.063.856.452.169.068.876.3
MCMAE [15]ViT-BUperNet87.573.266.557.169.767.257.073.072.179.8
InfMAE(Ours)ViT-BUperNet89.372.868.859.172.176.757.174.274.382.5
+ +# 5.3 InfMAE on The Infrared Object Detection Task + +Experimental Setup The M3FD [34] dataset is an infrared and visible target detection dataset that contains 4200 images. The dataset labels six targets (People, Cars, Bus, Motor, Trucks, Lamps) during driving. We use the infrared images from it for experimental performance validation. In the following description, we call this used dataset M3FD-inf. We follow the most common setting to use the detection heads in Mask R-CNN [18] and Cascade R-CNN [4] and fine-tune the pre-trained InfMAE model. We follow most of the settings of the benchmark ViT [12]. We report the performance of the target detection model under 25 epoch cosine scheduling with a base learning rate of 10e-4 and a weight decay of 0.1. The batch size is set to 2. + +Results on The M3FD-inf We compare the proposed method with the supervised methods DETR [5], Sparse R-CNN [47], DINO [6], YoloV8 [51] and + +Table 2: Performances of different object detection methods on the M3FD-inf [34] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively. + +
MethodsBackboneModelPeople(%)Car(%)Bus(%)Motor(%)Lamp(%)Truck(%)mAP(%)AP50(%)
DETR [5]ResNet101-78.588.187.875.865.978.146.779.0
Sparse R-CNN [47]ResNet50-84.288.788.075.366.274.048.379.4
DINO [6]Swin-L-83.287.585.661.560.473.545.375.3
YoloV8 [51]CSPDarkNet-42.854.358.232.516.240.740.863.0
Sup.(Scratch)ViT-BMask R-CNN83.388.690.172.466.479.148.780.0
Vanilla MAE [17]ViT-BMask R-CNN84.889.693.176.076.580.551.483.4
MCMAE [15]ViT-BMask R-CNN87.890.893.187.785.984.955.788.4
InfMAE(Ours)ViT-BMask R-CNN87.990.794.687.185.283.256.288.1
Sup.(Scratch)ViT-BCascade R-CNN83.788.691.168.263.979.050.979.1
Vanilla MAE [17]ViT-BCascade R-CNN85.288.994.372.272.679.652.882.1
MCMAE [15]ViT-BCascade R-CNN85.690.493.176.880.983.754.785.1
InfMAE(Ours)ViT-BCascade R-CNN85.790.494.981.981.483.455.886.3
+ +with the self-supervised methods vanilla MAE [17], MCMAE [15]. We report the AP50 of each class, the mAP and AP50 of all classes' performance of all methods, and the experiment results are shown in Table 2. As shown in this table, when combining the encoder of the proposed InfMAE and the detection head of the Cascade R-CNN [4] method, the proposed method outperforms all supervised methods. As for the self-supervised methods, the proposed method outperforms most of the SOTA methods. We can observe a similar experiment performance when using the head of Mask R-CNN method. + +# 5.4 InfMAE on The Infrared Small Target Detection Task + +Experimental Setup The IRSTD-1k [58] is a well-established infrared small target detection dataset that contains 1000 infrared modal images with pixel-level annotations. We replace the encoder in [33] with the multi-scale encoder module in InfMAE. During the training phase, we adopt the AdamW [36] optimizer with an initial learning rate of 0.001, a weight decay of 0.05, and a batch size of 2. + +Table 3: Performances of different infrared small target detection methods on the IRSTD-1k dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively. + +
MethodsBackbonePd(%)AUC(%)F1(%)IoU(%)
LPNetGA [7]-77.160.650.834.1
DNANet [25]-89.687.876.461.8
ISTR [33]ViT-B85.886.169.453.1
Sup.(Scratch)ViT-B86.186.172.657.0
Vanilla MAE [17]ViT-B86.886.872.857.2
MCMAE [15]ViT-B74.290.878.464.5
UM-VPT [27]VPT-S99.688.973.558.1
InfMAE(Ours)ViT-B96.691.279.566.0
+ +Results on The IRSTD We compare the proposed method with the supervised methods LPNetGA [7], DNANet [25], ISTR [33], and with the self-supervised methods Vanilla MAE [17], MCMAE [15], UM-PVT [27]. According to the [14, 33], we report four main performance metrics: positive detection $P_{d}$ , AUC, pixel-level F1 score $F_{1}$ , and IoU in the table 3. From this table, we can see that the proposed foundation model outperforms all the SOTA methods in metrics of AUC, $F_{1}$ , and IoU. + +# 5.5 Ablation Study of The InfMAE + +Module Ablation In this section, we validate the effect of the information-aware masking strategy and multi-scale strategy. We adopt the UperNet [55] as the segmentation head and the Mask R-CNN [18] as the object detection head. The results are shown in Table 4. From this Table, we can see that combining the proposed information-aware masking strategy and the introduced multi-scale strategy can achieve better performance in downstream tasks. + +Table 4: Ablation study on the influence of the masking strategy and multi-scale strategy. The IAM means the information-aware masking strategy. + +
IAM Multi-scaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
-71.478.281.549.1
✓72.079.478.950.1
-72.179.886.355.0
✓74.382.588.156.2
+ +Decoder Depth In this section, we analyze the effects of different decoder depths on the experimental performance of downstream tasks. We set the decoder depth to 2, 4, 8, and 12 respectively, and we also adopt the UperNet [55] and the Mask R-CNN [18] as the segmentation and object detection heads. The experimental performance is shown in the table 5. From the table, we can see that segmentation and detection gain the best result when the decoder depth is 2. From the experimental results, we can find that the infrared image does not need a deep decoder because of its lack of texture, detail, and color information. Meanwhile, we can observe from this table that the semantic performance is more sensitive to the decoder depth. + +Masking Strides In this section, we analyze the experimental performance under different masking strides. For the mask strides, we select 2, 4, and 7, and the experimental results are shown in the table 6. From the table, we can see that when the masking stride is set to 4, the semantic segmentation metrics mIoU and mAcc are the best, while the detection metric AP50 is suboptimal. Considering that setting the sampling stride to 2 leads to an increase in the model's parameter count, we select a masking stride of 4. + +Table 5: The influence of increasing decoder depths on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task. + +
DecoderDepthSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.382.588.156.2
472.980.487.955.6
873.280.787.653.8
1274.081.987.254.1
+ +Table 6: The influence of different masking strides of the information-aware masking strategy on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task. + +
StridesSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.282.089.356.1
474.382.588.156.2
771.879.988.054.9
1470.4--54.3
+ +Pre-training Epochs For MAE, 1600 pre-training epochs can significantly improve the quality of the learned representations. To explore this effect of pretraining time, we train InfMAE with 200, 400, 800, and 1600 epochs and finetune the pre-trained models on downstream tasks. The experimental results can be seen in Table 7. From this table, we observe improved performances across most downstream tasks with an increase in pre-training epochs. + +Table 7: The influence of increasing pre-training epochs on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task. + +
Pre-train EpochsSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
20071.378.987.455.4
40074.382.588.156.2
80074.983.188.355.9
160074.983.288.256.0
+ +Pre-training Dataset Size Analysis In this section, we present the impact of varying pre-training dataset sizes on downstream task performance, as documented in Table 8. The Inf10 and Inf15 contain 100K and 150K images which are sampled from Inf30 and the Inf50 contains 500K unprocessed images. The table indicates a progressive enhancement in performance with the increase in dataset size from 100K to 300K while from 300K to 500K does not yield a proportional increase. This phenomenon is likely due to the increasing similarity of images within the larger dataset, which results in a limited representation learning ability of the foundational model. The lack of diversity in the dataset restricts + +Table 8: The influence of different pre-train data scales on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task. + +
Dataset ScaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
Inf1069.177.686.955.0
Inf1573.0--55.6
Inf3074.382.588.156.2
Inf5073.080.587.355.8
+ +the model's generalization ability to various downstream tasks. Thus, the findings highlight the significance of dataset quality and diversity in pre-training for optimal model performance. + +# 5.6 Pre-trained on Inf30 and ImageNet-1K + +In this section, we discuss the importance of the large-scale infrared dataset in developing an infrared foundation model. To this end, the architecture of the vanilla MAE [17] is utilized for pre-training by 400 epochs on both the Inf30 dataset and the IN1K-30 dataset, the latter comprising 300k visible images randomly sampled from the ImageNet-1K [10] for fair comparison. To assess the generalization capabilities of the pre-trained models, we engage in infrared semantic segmentation using the MSRS-inf [48] dataset with UperNet [55], and infrared object detection on the M3FD-inf [34] dataset utilizing Mask R-CNN [18]. This experimental setting is consistent with the MAE [17]. The mIoUs and AP50 of vanilla MAE pre-trained with IN1K-30 are $66.7\%$ and $78.2\%$ , while pre-trained with Inf30 are $71.6\%$ and $83.4\%$ . These results show that the MAE [17] pre-trains on Inf30 exhibit stronger generalization capabilities in infrared downstream tasks. This observation underscores that the distribution variances indeed contribute to performance disparities. Hence, the release of a large-scale infrared dataset is crucial for the development of the foundation model. + +# 6 Conclusion + +In this paper, we propose a foundation model in the infrared modality, named InfMAE. We collect a dataset containing 305,241 infrared images for self-supervised learning. Meanwhile, to enhance the model's capacity to learn the generalized representation, an information-aware masking strategy is proposed, which can make the network pay more attention to the reconstruction of the information-rich part of the image. Besides, based on the characteristics of infrared images, we design a new decoder structure. Finally, we validate the effectiveness of the proposed method InfMAE in infrared semantic segmentation, object detection, and small target detection tasks. The experimental results show that our InfMAE can obtain better experimental results than other supervised and self-supervised methods. In addition, we discuss some parameters in the InfMAE. We hope that the proposed foundation model InfMAE can promote the development of the infrared vision community. + +# Acknowledgements + +This work is supported in part by the National Key R&D Program of China (2022YFA1004100), and in part by the National Natural Science Foundation of China (No. 62176035, 62201111, 12226004, 62272375), the Science and Technology Research Program of Chongqing Municipal Education Commission under Grant (No.KJZD-K202100606). + +# References + +1. Awais, M., Naseer, M., Khan, S., Anwer, R.M., Cholakkal, H., Shah, M., Yang, M.H., Khan, F.S.: Foundational models defining a new era in vision: A survey and outlook (2023) +2. Bao, H., Dong, L., Piao, S., Wei, F.: Beit: Bert pre-training of image transformers. In: International Conference on Learning Representations (2021) +3. Bommasani, R., Hudson, D.A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M.S., Bohg, J., Bosselut, A., Brunskill, E., et al.: On the opportunities and risks of foundation models. arXiv preprint arXiv:2108.07258 (2021) +4. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018) +5. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: Proceedings of the European conference on computer vision (ECCV). pp. 213-229. Springer (2020) +6. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 9650-9660 (2021) +7. Chen, F., Gao, C., Liu, F., Zhao, Y., Zhou, Y., Meng, D., Zuo, W.: Local patch network with global attention for infrared small target detection. IEEE Transactions on Aerospace and Electronic Systems 58(5), 3979-3991 (2022) +8. Chen, L.C., Zhu, Y., Papandreou, G., Schroff, F., Adam, H.: Encoder-decoder with atrous separable convolution for semantic image segmentation. In: Proceedings of the European conference on computer vision (ECCV). pp. 801-818 (2018) +9. Chen, X., Gao, C., Li, C., Yang, Y., Meng, D.: Infrared action detection in the dark via cross-stream attention mechanism. IEEE Transactions on Multimedia 24, 288-300 (2021) +0. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009) +11. Dong, X., Bao, J., Zhang, T., Chen, D., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N., Guo, B.: Peco: Perceptual codebook for bert pre-training of vision transformers. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 552-560 (2023) +12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020) + +13. Gao, C., Du, Y., Liu, J., Lv, J., Yang, L., Meng, D., Hauptmann, A.G.: Infar dataset: Infrared action recognition at different times. Neurocomputing 212, 36-47 (2016) +14. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE transactions on image processing 22(12), 4996-5009 (2013) +15. Gao, P., Ma, T., Li, H., Lin, Z., Dai, J., Qiao, Y.: Mcmae: Masked convolution meets masked autoencoders. Advances in Neural Information Processing Systems 35, 35632-35644 (2022) +16. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind one embedding space to bind them all. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 15180-15190. IEEE (2023) +17. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022) +18. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017) +19. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016. pp. 770-778. IEEE Computer Society (2016) +20. He, Z., Cao, Y., Dong, Y., Yang, J., Cao, Y., Tisse, C.L.: Single-image-based nonuniformity correction of uncooled long-wave infrared detectors: A deep-learning approach. Applied optics 57(18), D155-D164 (2018) +21. Kakogeorgiou, I., Gidaris, S., Psomas, B., Avrithis, Y., Bursuc, A., Karantzalos, K., Komodakis, N.: What to hide from your students: Attention-guided masked image modeling. In: European Conference on Computer Vision. pp. 300-318. Springer (2022) +22. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W., Dollár, P., Girshick, R.B.: Segment anything. CoRR abs/2304.02643 (2023) +23. Kolesnikov, A., Beyer, L., Zhai, X., Puigcerver, J., Yung, J., Gelly, S., Houlsby, N.: Big transfer (bit): General visual representation learning. In: Proceedings of the European conference on computer vision (ECCV). pp. 491-507. Springer (2020) +24. Lab, A.S.: Thermal infrared dataset. https://projects.asl.ethz.ch/datasets/doku.php?id=ir:iricra2014 +25. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022) +26. Li, G., Zheng, H., Liu, D., Wang, C., Su, B., Zheng, C.: Semmae: Semantic-guided masking for learning masked autoencoders. Advances in Neural Information Processing Systems 35, 14290-14302 (2022) +27. Li, X., Wang, W., Yang, L., Yang, J.: Uniform masking: Enabling mae pretraining for pyramid-based vision transformers with locality. arXiv preprint arXiv:2205.10063 (2022) +28. Li, Y., Liu, H., Tian, Z., Geng, W.: Near-infrared vascular image segmentation using improved level set method. Infrared Physics & Technology 131, 104678 (2023) +29. Li, Y., Xie, S., Chen, X., Dollar, P., He, K., Girshick, R.: Benchmarking detection transfer learning with vision transformers. arXiv preprint arXiv:2111.11429 (2021) + +30. Li, Z., Chen, Z., Yang, F., Li, W., Zhu, Y., Zhao, C., Deng, R., Wu, L., Zhao, R., Tang, M., et al.: Mst: Masked self-supervised transformer for visual representation. Advances in Neural Information Processing Systems 34, 13165-13176 (2021) +31. Li, Z.Y., Gao, S., Cheng, M.M.: Sere: Exploring feature self-relation for self-supervised transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(12), 15619-15631 (2023) +32. Lin, F., Ge, S., Bao, K., Yan, C., Zeng, D.: Learning shape-biased representations for infrared small target detection. IEEE Transactions on Multimedia pp. 1-12 (2023) +33. Liu, F., Gao, C., Chen, F., Meng, D., Zuo, W., Gao, X.: Infrared small and dim target detection with transformer under complex backgrounds. IEEE Transactions on Image Processing 32, 5921-5932 (2023) +34. Liu, J., Fan, X., Huang, Z., Wu, G., Liu, R., Zhong, W., Luo, Z.: Target-aware dual adversarial learning and a multi-scenario multi-modality benchmark to fuse infrared and visible for object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5802-5811 (2022) +35. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015) +36. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net (2019), https://openreview.net/forum?id=Bkg6RiCqY7 +37. Lüddecke, T., Ecker, A.S.: Image segmentation using text and image prompts. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA, June 18-24, 2022. pp. 7076-7086. IEEE (2022) +38. Madan, N., Ristea, N.C., Ionescu, R.T., Nasrollahi, K., Khan, F.S., Moeslund, T.B., Shah, M.: Self-supervised masked convolutional transformer block for anomaly detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 46(1), 525-542 (2024) +39. OpenAI: Gpt-4 technical report. PREPRINT (2023) +40. OTCBVS: Otcbvs benchmark dataset collection. https://vcipl-okstate.org/pbvs/bench/index.html +41. Pan, H., Hong, Y., Sun, W., Jia, Y.: Deep dual-resolution networks for real-time and accurate semantic segmentation of traffic scenes. IEEE Transactions on Intelligent Transportation Systems 24(3), 3448-3460 (2022) +42. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021) +43. Reed, C.J., Gupta, R., Li, S., Brockman, S., Funk, C., Clipp, B., Keutzer, K., Candido, S., Uytendaele, M., Darrell, T.: Scale-mae: A scale-aware masked autoencoder for multiscale geospatial representation learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4088-4099 (2023) +44. Reporter, T.M.: Infrared camera finds 6-year-old lost in deep woods. https://www.youtube.com/watch?v=-FajSFRlKIo +45. Scheibenreif, L., Mommert, M., Borth, D.: Masked vision transformers for hyperspectral image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2165-2175 (2023) + +46. St-Charles, P.L., Bilodeau, G.A., Bergevin, R.: Mutual foreground segmentation with multispectral stereo pairs. In: Proceedings of the IEEE International Conference on Computer Vision Workshops. pp. 375-384 (2017) +47. Sun, P., Zhang, R., Jiang, Y., Kong, T., Xu, C., Zhan, W., Tomizuka, M., Li, L., Yuan, Z., Wang, C., et al.: Sparse r-cnn: End-to-end object detection with learnable proposals. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14454-14463 (2021) +48. Tang, L., Yuan, J., Zhang, H., Jiang, X., Ma, J.: Piafusion: A progressive infrared and visible image fusion network based on illumination aware. Information Fusion 83-84, 79-92 (2022) +49. Tian, Z., Liu, H., Li, Q.: Vu-net: A symmetric network-based method for near-infrared blood vessel image segmentation. In: International Conference on Man-Machine-Environment System Engineering. pp. 275–280. Springer (2023) +50. Tong, Z., Song, Y., Wang, J., Wang, L.: Videomae: Masked autoencoders are data-efficient learners for self-supervised video pre-training. Advances in neural information processing systems 35, 10078-10093 (2022) +51. ultralytics: ultralytics, 2023. https://github.com/ultralytics/ultralytics +52. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017) +53. Wang, L., Huang, B., Zhao, Z., Tong, Z., He, Y., Wang, Y., Wang, Y., Qiao, Y.: Videomae v2: Scaling video masked autoencoders with dual masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14549-14560 (2023) +54. Woo, S., Debnath, S., Hu, R., Chen, X., Liu, Z., Kweon, I.S., Xie, S.: Convnext v2: Co-designing and scaling convnets with masked autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16133-16142 (2023) +55. Xiao, T., Liu, Y., Zhou, B., Jiang, Y., Sun, J.: Unified perceptual parsing for scene understanding. In: Proceedings of the European conference on computer vision (ECCV). pp. 418-434 (2018) +56. Xu, Z., Zhuang, J., Liu, Q., Zhou, J., Peng, S.: Benchmarking a large-scale fir dataset for on-road pedestrian detection. Infrared Physics & Technology 96, 199-208 (2019) +57. Yin, M., Yao, Z., Cao, Y., Li, X., Zhang, Z., Lin, S., Hu, H.: Disentangled non-local neural networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 191-207. Springer (2020) +58. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022) +59. Zhang, R., Guo, Z., Gao, P., Fang, R., Zhao, B., Wang, D., Qiao, Y., Li, H.: Point-m2ae: multi-scale masked autoencoders for hierarchical point cloud pre-training. Advances in neural information processing systems 35, 27061-27074 (2022) +60. Zhang, X., Demiris, Y.: Visible and infrared image fusion using deep learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(8), 10535-10554 (2023) \ No newline at end of file diff --git a/2024/InfMAE_ A Foundation Model in The Infrared Modality/images.zip b/2024/InfMAE_ A Foundation Model in The Infrared Modality/images.zip new file mode 100644 index 0000000000000000000000000000000000000000..208a07f17c8d59cc4c8b9e0211120e66ac09c9eb --- /dev/null +++ b/2024/InfMAE_ A Foundation Model in The Infrared Modality/images.zip @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3c7182fae86c93d2335aca673b2f538c60cbb67b39a475e9dbd14fbb31b39774 +size 450591 diff --git a/2024/InfMAE_ A Foundation Model in The Infrared Modality/layout.json b/2024/InfMAE_ A Foundation Model in The Infrared Modality/layout.json new file mode 100644 index 0000000000000000000000000000000000000000..c7ed00f0af73dc0b072bac3407556d63efa53b4d --- /dev/null +++ b/2024/InfMAE_ A Foundation Model in The Infrared Modality/layout.json @@ -0,0 +1,9397 @@ +{ + "pdf_info": [ + { + "para_blocks": [ + { + "bbox": [ + 175, + 111, + 440, + 148 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 175, + 111, + 440, + 148 + ], + "spans": [ + { + "bbox": [ + 175, + 111, + 440, + 148 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "spans": [ + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "text", + "content": "Fangcen Liu" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "text", + "content": ", Chenqiang Gao" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "inline_equation", + "content": "^{2*}" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "text", + "content": ", Yaming Zhang" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "text", + "content": ", Junjie Guo" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "inline_equation", + "content": "^{1}" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "text", + "content": ", Jinghao Wang" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "text", + "content": ", and Deyu Meng" + }, + { + "bbox": [ + 167, + 167, + 445, + 193 + ], + "type": "inline_equation", + "content": "^{3}" + } + ] + } + ], + "index": 1 + }, + { + "bbox": [ + 135, + 201, + 477, + 235 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 135, + 201, + 477, + 235 + ], + "spans": [ + { + "bbox": [ + 135, + 201, + 477, + 235 + ], + "type": "text", + "content": "1 School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China. {liufc67, YummyZhang1989, gjj893866738} @ gmail.com" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 144, + 235, + 467, + 257 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 144, + 235, + 467, + 257 + ], + "spans": [ + { + "bbox": [ + 144, + 235, + 467, + 257 + ], + "type": "inline_equation", + "content": "^{2}" + }, + { + "bbox": [ + 144, + 235, + 467, + 257 + ], + "type": "text", + "content": " School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen, Guangdong 518107, China. {gaochq6, wangjh298}@mail.sysu.edu.cn" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 140, + 257, + 472, + 291 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 140, + 257, + 472, + 291 + ], + "spans": [ + { + "bbox": [ + 140, + 257, + 472, + 291 + ], + "type": "text", + "content": "3 School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an, Shanxi, 710049, China, and School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China. dymeng@mail.xjtu.edu.cn" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 159, + 320, + 455, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 320, + 455, + 518 + ], + "spans": [ + { + "bbox": [ + 159, + 320, + 455, + 518 + ], + "type": "text", + "content": "Abstract. In recent years, foundation models have swept the computer vision field, facilitating the advancement of various tasks within different modalities. However, effectively designing an infrared foundation model remains an open question. In this paper, we introduce InfMAE, a foundation model tailored specifically for the infrared modality. Initially, we present Inf30, an infrared dataset developed to mitigate the scarcity of large-scale data for self-supervised learning within the infrared vision community. Moreover, considering the intrinsic characteristics of infrared images, we design an information-aware masking strategy. It allows for a greater emphasis on the regions with richer information in infrared images during the self-supervised learning process, which is conducive to learning strong representations. Additionally, to enhance generalization capabilities in downstream tasks, we employ a multi-scale encoder for latent representation learning. Finally, we develop an infrared decoder to reconstruct images. Extensive experiments show that our proposed method InfMAE outperforms other supervised and self-supervised learning methods in three key downstream tasks: infrared image semantic segmentation, object detection, and small target detection." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "spans": [ + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "text", + "content": "Keywords: Infrared Foundation Model " + }, + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "text", + "content": " Infrared Image Segmentation " + }, + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "text", + "content": " Infrared Object Detection " + }, + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "inline_equation", + "content": "\\cdot" + }, + { + "bbox": [ + 159, + 529, + 453, + 552 + ], + "type": "text", + "content": " Infrared Small Target Detection." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 572, + 230, + 586 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 572, + 230, + 586 + ], + "spans": [ + { + "bbox": [ + 132, + 572, + 230, + 586 + ], + "type": "text", + "content": "1 Introduction" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "spans": [ + { + "bbox": [ + 130, + 597, + 482, + 647 + ], + "type": "text", + "content": "Infrared imaging plays a crucial role and finds extensive applications in low-light even dark and smoky conditions [9,25,60] since they utilize the thermal radiation of objects for imaging, which can effectively alleviate adverse effects caused by challenging environmental conditions. Currently, computer vision tasks in the" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 141, + 654, + 247, + 665 + ], + "type": "page_footnote", + "angle": 0, + "lines": [ + { + "bbox": [ + 141, + 654, + 247, + 665 + ], + "spans": [ + { + "bbox": [ + 141, + 654, + 247, + 665 + ], + "type": "text", + "content": "* Corresponding authors." + } + ] + } + ], + "index": 9 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 0 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "content": "infrared vision community, such as object detection [32, 33], and semantic segmentation [28, 49], are explored by task-specific designed models. While these models can yield superior performance on individual tasks, they are often challenged by their limited generalizability." + } + ] + } + ], + "index": 2 + }, + { + "type": "image", + "bbox": [ + 134, + 186, + 218, + 251 + ], + "blocks": [ + { + "bbox": [ + 134, + 186, + 218, + 251 + ], + "lines": [ + { + "bbox": [ + 134, + 186, + 218, + 251 + ], + "spans": [ + { + "bbox": [ + 134, + 186, + 218, + 251 + ], + "type": "image", + "image_path": "8a534d0279e13261e6a3abc295b64660b24f473f65b4550bd126a0c3e0e9eab8.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_body" + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 135, + 254, + 217, + 316 + ], + "blocks": [ + { + "bbox": [ + 135, + 254, + 217, + 316 + ], + "lines": [ + { + "bbox": [ + 135, + 254, + 217, + 316 + ], + "spans": [ + { + "bbox": [ + 135, + 254, + 217, + 316 + ], + "type": "image", + "image_path": "cb167c7f0f1ebec8d44cbd76c7aa1ddd353f95d984c3bba8e813cc3d17c963b8.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 159, + 316, + 203, + 324 + ], + "lines": [ + { + "bbox": [ + 159, + 316, + 203, + 324 + ], + "spans": [ + { + "bbox": [ + 159, + 316, + 203, + 324 + ], + "type": "text", + "content": "Visible Images" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_caption" + }, + { + "bbox": [ + 130, + 334, + 482, + 389 + ], + "lines": [ + { + "bbox": [ + 130, + 334, + 482, + 389 + ], + "spans": [ + { + "bbox": [ + 130, + 334, + 482, + 389 + ], + "type": "text", + "content": "Fig. 1: Visual comparison of infrared and visible images. Compared to visible images, infrared images display diminished informational content due to their inherent lack of rich texture and color details. For example, objects such as zebra crossings, telephone poles, and road signs in the red box are often submerged in their surroundings due to their similar temperature to the surrounding environment." + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_caption" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 219, + 186, + 302, + 251 + ], + "blocks": [ + { + "bbox": [ + 219, + 186, + 302, + 251 + ], + "lines": [ + { + "bbox": [ + 219, + 186, + 302, + 251 + ], + "spans": [ + { + "bbox": [ + 219, + 186, + 302, + 251 + ], + "type": "image", + "image_path": "7069e319b93afc0dbe0242cd6d34a687d542965864b8383484a1c37a0b5ed126.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 219, + 254, + 302, + 316 + ], + "blocks": [ + { + "bbox": [ + 219, + 254, + 302, + 316 + ], + "lines": [ + { + "bbox": [ + 219, + 254, + 302, + 316 + ], + "spans": [ + { + "bbox": [ + 219, + 254, + 302, + 316 + ], + "type": "image", + "image_path": "accb13b02f9d9135c834c63c18ed7dfd20e851b55fcab78cbde24b95d3225ccf.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 240, + 316, + 286, + 324 + ], + "lines": [ + { + "bbox": [ + 240, + 316, + 286, + 324 + ], + "spans": [ + { + "bbox": [ + 240, + 316, + 286, + 324 + ], + "type": "text", + "content": "Infrared Images" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_caption" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 309, + 186, + 389, + 251 + ], + "blocks": [ + { + "bbox": [ + 309, + 186, + 389, + 251 + ], + "lines": [ + { + "bbox": [ + 309, + 186, + 389, + 251 + ], + "spans": [ + { + "bbox": [ + 309, + 186, + 389, + 251 + ], + "type": "image", + "image_path": "2243030154816e792a53ad8469e050bafa922180e69c81dfc74e379c483e4d6a.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 309, + 253, + 389, + 316 + ], + "blocks": [ + { + "bbox": [ + 309, + 253, + 389, + 316 + ], + "lines": [ + { + "bbox": [ + 309, + 253, + 389, + 316 + ], + "spans": [ + { + "bbox": [ + 309, + 253, + 389, + 316 + ], + "type": "image", + "image_path": "3cc80aefdccec70a28e56c63bcdbfc320c203c30da573b648035dfaefadd8765.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 328, + 316, + 370, + 324 + ], + "lines": [ + { + "bbox": [ + 328, + 316, + 370, + 324 + ], + "spans": [ + { + "bbox": [ + 328, + 316, + 370, + 324 + ], + "type": "text", + "content": "Visible Images" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_caption" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 391, + 186, + 471, + 251 + ], + "blocks": [ + { + "bbox": [ + 391, + 186, + 471, + 251 + ], + "lines": [ + { + "bbox": [ + 391, + 186, + 471, + 251 + ], + "spans": [ + { + "bbox": [ + 391, + 186, + 471, + 251 + ], + "type": "image", + "image_path": "1273077aef3256489b905d2721046212ad3f150933bd7d11a6feb22da00ab51c.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 391, + 253, + 471, + 316 + ], + "blocks": [ + { + "bbox": [ + 391, + 253, + 471, + 316 + ], + "lines": [ + { + "bbox": [ + 391, + 253, + 471, + 316 + ], + "spans": [ + { + "bbox": [ + 391, + 253, + 471, + 316 + ], + "type": "image", + "image_path": "b0cf640024cd303c41724f236013f7f22039c5d262233d8f41ece268287654fa.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 407, + 316, + 453, + 324 + ], + "lines": [ + { + "bbox": [ + 407, + 316, + 453, + 324 + ], + "spans": [ + { + "bbox": [ + 407, + 316, + 453, + 324 + ], + "type": "text", + "content": "Infrared Images" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_caption" + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 414, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 414, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 414, + 482, + 641 + ], + "type": "text", + "content": "The foundation model refers to a large, general deep learning model that learns extensive knowledge through pre-training on a large-scale dataset and can be adapted to various downstream tasks by fine-tuning or prompting [1, 3, 42]. The Transformer-based model like ViT [12] is one of the representative vision foundation models, which are trained on a large-scale dataset and outperforms the ResNet-based method [23] on the downstream tasks. To better learn the powerful representation of a foundation model from a large number of unlabeled data, self-supervised learning is the primary choice [31]. The self-supervised learning frameworks, such as BEiT [2], DINO [6], and Mask Autoencoders (MAE) [17], achieve impressive performance across various downstream vision tasks [29, 45]. Notably, the MAE [17] has verified superior representation learning ability and scalability. This model is pre-trained on the ImageNet-1K dataset [10]. Then, the pre-trained encoder of the MAE [17] serves as a sufficient feature extraction backbone, achieving excellent performance on classification, detection, and segmentation tasks. Following the self-supervised learning frameworks, pre-trained foundation models have emerged in various modalities, e.g., VideoMAE [50, 53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a comparable foundation model has not yet emerged in the infrared modality." + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 482, + 665 + ], + "type": "text", + "content": "Intuitively, a feasible solution is to directly employ the pre-trained visible MAE on infrared downstream tasks. However, as delineated in Section 5.6, our" + } + ] + } + ], + "index": 17 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "2" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 1 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 308 + ], + "type": "text", + "content": "experimental findings suggest this is suboptimal, primarily due to significant disparities in imaging characteristics between infrared and visible modalities. Fig. 1 illustrates these differences. We can observe that infrared images exhibit less information compared to visible images, which lack rich texture and color details. For instance, objects like zebra crossings and power lines in Fig. 1 lack color and texture information in infrared images, making them indistinguishable from the surrounding environment. These differences cause a noticeable gap between the infrared and visible modalities. The most straightforward strategy to mitigate this disparity is to train the MAE model on an extensive infrared dataset. However, there appears to be a limited availability of a large-scale dataset in the infrared modality. Consequently, it becomes important to build a large-scale infrared dataset to facilitate the training of an infrared foundation model. In this paper, we begin by gathering a large number of infrared images. Through image preprocessing like reducing redundancy, we finally obtain an infrared dataset named Inf30, which addresses the existing data scarcity within the infrared modality." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 309, + 482, + 440 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 309, + 482, + 440 + ], + "spans": [ + { + "bbox": [ + 130, + 309, + 482, + 440 + ], + "type": "text", + "content": "Due to the less information on infrared images, directly applying the vanilla MAE [17] architecture to the infrared modality is also a feasible but not the optimal choice, as the experiment shows in Sections 5.2, 5.3 and 5.4. The vanilla MAE adopts the random mask strategy. Directly applying this strategy to infrared images may cause the masking tokens to focus more on the information-poor part which is less conducive to representation learning. Previous researches [21, 26] argued that masking tokens with rich semantic information could improve the representation learning ability of the self-supervised method, and introduced the semantic-guided masking strategy. However, these methods do not account for the unique characteristics of the infrared modality and require the addition of new semantic-aware branches in the frameworks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 443, + 482, + 561 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 443, + 482, + 561 + ], + "spans": [ + { + "bbox": [ + 130, + 443, + 482, + 561 + ], + "type": "text", + "content": "In this paper, we propose a simple yet effective foundation model in the infrared modality named InfMAE that can be extensively generalized to downstream tasks, such as infrared semantic segmentation, object detection, and small target detection. To enhance the representation capabilities for infrared images, we design an information-aware masking strategy, which facilitates the selective masking of regions with richer information without designing an additional complex semantic awareness branch. In addition, we employ a multi-scale strategy to enhance generalization capabilities in downstream tasks. Finally, based on the characteristics of infrared images, we adopt a new infrared decoder module for image reconstruction." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 146, + 564, + 423, + 576 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 146, + 564, + 423, + 576 + ], + "spans": [ + { + "bbox": [ + 146, + 564, + 423, + 576 + ], + "type": "text", + "content": "We summarize the main contributions of this paper as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 591, + 479, + 662 + ], + "type": "list", + "angle": 0, + "index": 8, + "blocks": [ + { + "bbox": [ + 138, + 591, + 479, + 625 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 591, + 479, + 625 + ], + "spans": [ + { + "bbox": [ + 138, + 591, + 479, + 625 + ], + "type": "text", + "content": "- We collect and preprocess a large number of infrared images, and finally release an infrared dataset Inf30 for self-supervised learning, which consists of 305241 infrared images." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 629, + 479, + 662 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 629, + 479, + 662 + ], + "spans": [ + { + "bbox": [ + 138, + 629, + 479, + 662 + ], + "type": "text", + "content": "- We propose the InfMAE, a simple yet effective foundation model in the infrared modality. To the best of our knowledge, this is the first attempt to build a foundation model within the infrared modality." + } + ] + } + ], + "index": 7 + } + ], + "sub_type": "text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "3" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 2 + }, + { + "para_blocks": [ + { + "bbox": [ + 138, + 116, + 480, + 151 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 116, + 480, + 151 + ], + "spans": [ + { + "bbox": [ + 138, + 116, + 480, + 151 + ], + "type": "text", + "content": "- Considering the characteristics of infrared imaging, we design an information-aware masking strategy and an infrared decoder. These designs enhance the model's ability to learn strong representations." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 139, + 152, + 480, + 186 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 139, + 152, + 480, + 186 + ], + "spans": [ + { + "bbox": [ + 139, + 152, + 480, + 186 + ], + "type": "text", + "content": "- The experimental results show that the method proposed in this paper outperforms state-of-the-art methods, achieving the best performance in downstream tasks." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 205, + 237, + 217 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 205, + 237, + 217 + ], + "spans": [ + { + "bbox": [ + 132, + 205, + 237, + 217 + ], + "type": "text", + "content": "2 Related Work" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 228, + 277, + 240 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 228, + 277, + 240 + ], + "spans": [ + { + "bbox": [ + 132, + 228, + 277, + 240 + ], + "type": "text", + "content": "2.1 The Foundation Model" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 247, + 482, + 450 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 247, + 482, + 450 + ], + "spans": [ + { + "bbox": [ + 130, + 247, + 482, + 450 + ], + "type": "text", + "content": "The foundation models are trained on a large-scale dataset in a self-supervised manner, making them adaptable for various downstream tasks [3]. The foundation model can be categorized into four categories based on different inputs: traditional models, textually prompted models, visually prompted models, and heterogeneous modalities-based models [1]. Traditional foundational models usually take only images as input, such as ResNet [19] based on convolutional neural networks, as well as ViT [12] based on the Transformer architecture. The textually prompted models like CLIP [42] and GPT-4 [39] took the textual prompt and the image as the inputs, and the textual prompt established correlations between text and images, contributing to achieving zero-shot transfer. The visually prompted models [22,37] could be prompted by various prompt types, e.g., text, bounding boxes, or a semantical mask to get the target segmentation. The heterogeneous modalities-based models usually combine the various prompt types and the aligned multiple paired modalities, e.g., image-audio, image-video, etc., to learn meaningful representations. The ImageBind [16] is the representative work. In this study, we attempt to explore the traditional foundation model in the infrared modality." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 467, + 458, + 480 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 467, + 458, + 480 + ], + "spans": [ + { + "bbox": [ + 132, + 467, + 458, + 480 + ], + "type": "text", + "content": "2.2 The Masked Image Modeling and Representation Learning" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 485, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 485, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 485, + 482, + 641 + ], + "type": "text", + "content": "The Masked Image Modeling (MIM) [2,15,17,38] is an emerging self-supervised learning approach, i.e., by randomly masking a part of the input image and then reconstructing it. This learning method is simple yet effective in learning representations with high generality from a large-scale of data for downstream takes. BEiT [2] and MAE [17] are pioneering works. BEiT [2] used a bidirectional encoder representation to recover the original visual token based on the corrupted image patches. MAE [17] pre-trained the ViT encoder by randomly masking the image tokens, feeding the visible tokens into the encoder, and then reconstructing the masked tokens through the decoder. Based on MAE, pre-trained foundation models based on MIM learning have emerged in various modalities, e.g., VideoMAE [50,53] in the video modality, Scale-MAE [43] in the remote sensing image modality, and Point-M2AE [59] in the point cloud modality. However, a MIM-based foundation model is not yet available in the infrared modality." + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 641, + 481, + 665 + ], + "type": "text", + "content": "In addition to extending MIM methods to other modalities, methods also focus on designing mask strategies and how to reconstruct images. Regarding the" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "4" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 3 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 479, + 176 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 479, + 176 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 479, + 176 + ], + "type": "text", + "content": "masking strategy, methods like MST [30] and ATTMask [21] utilized attention maps to guide the masking strategy. SemMAE [26] used semantic information in images to select mask regions. UM-PVT [27] adopted a unified mask approach for masking learning. Regarding image reconstruction, some works [2, 11] adopted tokens produced by VQ-VAE [52] or its variants." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 176, + 479, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 176, + 479, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 176, + 479, + 200 + ], + "type": "text", + "content": "In this study, we explore a new masking strategy and decoder structure for infrared image reconstruction, according to the characteristics of infrared images." + } + ] + } + ], + "index": 3 + }, + { + "type": "image", + "bbox": [ + 133, + 221, + 189, + 274 + ], + "blocks": [ + { + "bbox": [ + 133, + 221, + 189, + 274 + ], + "lines": [ + { + "bbox": [ + 133, + 221, + 189, + 274 + ], + "spans": [ + { + "bbox": [ + 133, + 221, + 189, + 274 + ], + "type": "image", + "image_path": "e73bf355602b55c2366e96d44e8acf9385a7de81237fc8bf7fd822ad0ea9bfc1.jpg" + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "image_body" + } + ], + "index": 4 + }, + { + "type": "image", + "bbox": [ + 133, + 274, + 188, + 327 + ], + "blocks": [ + { + "bbox": [ + 133, + 274, + 188, + 327 + ], + "lines": [ + { + "bbox": [ + 133, + 274, + 188, + 327 + ], + "spans": [ + { + "bbox": [ + 133, + 274, + 188, + 327 + ], + "type": "image", + "image_path": "777aa3966fb2a3f9da7d838cb7b7dbd1e292ff1ce8dceca608352b52ec272741.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 337, + 482, + 371 + ], + "lines": [ + { + "bbox": [ + 130, + 337, + 482, + 371 + ], + "spans": [ + { + "bbox": [ + 130, + 337, + 482, + 371 + ], + "type": "text", + "content": "Fig. 2: Some samples of the Inf30. The environments in the collected dataset encompass skies, seascapes, forests, urban areas, suburban areas, lawns, and so on. The objects include ships, vehicles, pedestrians, public facilities, residential buildings, and so on." + } + ] + } + ], + "index": 16, + "angle": 0, + "type": "image_caption" + } + ], + "index": 5 + }, + { + "type": "image", + "bbox": [ + 190, + 221, + 246, + 274 + ], + "blocks": [ + { + "bbox": [ + 190, + 221, + 246, + 274 + ], + "lines": [ + { + "bbox": [ + 190, + 221, + 246, + 274 + ], + "spans": [ + { + "bbox": [ + 190, + 221, + 246, + 274 + ], + "type": "image", + "image_path": "48c32df72a0d74728fd153588f64a84bb3bda584f3e680f19937ad91a43dc6f8.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "image_body" + } + ], + "index": 6 + }, + { + "type": "image", + "bbox": [ + 190, + 274, + 246, + 327 + ], + "blocks": [ + { + "bbox": [ + 190, + 274, + 246, + 327 + ], + "lines": [ + { + "bbox": [ + 190, + 274, + 246, + 327 + ], + "spans": [ + { + "bbox": [ + 190, + 274, + 246, + 327 + ], + "type": "image", + "image_path": "c3e260e6eb45467c206f6cf057bc4a1cca725a25274eefa8987dc31d5fb08aa2.jpg" + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "image_body" + } + ], + "index": 7 + }, + { + "type": "image", + "bbox": [ + 247, + 221, + 306, + 274 + ], + "blocks": [ + { + "bbox": [ + 247, + 221, + 306, + 274 + ], + "lines": [ + { + "bbox": [ + 247, + 221, + 306, + 274 + ], + "spans": [ + { + "bbox": [ + 247, + 221, + 306, + 274 + ], + "type": "image", + "image_path": "734bed7e205841562ec9f601d325905ffd6308f2c87b2e59efb1376a8f97dea1.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "image_body" + } + ], + "index": 8 + }, + { + "type": "image", + "bbox": [ + 247, + 274, + 306, + 327 + ], + "blocks": [ + { + "bbox": [ + 247, + 274, + 306, + 327 + ], + "lines": [ + { + "bbox": [ + 247, + 274, + 306, + 327 + ], + "spans": [ + { + "bbox": [ + 247, + 274, + 306, + 327 + ], + "type": "image", + "image_path": "b9aeef05d261f98793788829670e50421b1af207ce68199f4ae48acb9ce4aa64.jpg" + } + ] + } + ], + "index": 9, + "angle": 0, + "type": "image_body" + } + ], + "index": 9 + }, + { + "type": "image", + "bbox": [ + 307, + 221, + 362, + 274 + ], + "blocks": [ + { + "bbox": [ + 307, + 221, + 362, + 274 + ], + "lines": [ + { + "bbox": [ + 307, + 221, + 362, + 274 + ], + "spans": [ + { + "bbox": [ + 307, + 221, + 362, + 274 + ], + "type": "image", + "image_path": "17086b19529e712ea6e0e9ab33e78e6ed891078d19e3b4319d4ae9694b3a5b86.jpg" + } + ] + } + ], + "index": 10, + "angle": 0, + "type": "image_body" + } + ], + "index": 10 + }, + { + "type": "image", + "bbox": [ + 307, + 274, + 362, + 327 + ], + "blocks": [ + { + "bbox": [ + 307, + 274, + 362, + 327 + ], + "lines": [ + { + "bbox": [ + 307, + 274, + 362, + 327 + ], + "spans": [ + { + "bbox": [ + 307, + 274, + 362, + 327 + ], + "type": "image", + "image_path": "452c7ff5ec0d24bdf42e62f9eca18c0ddd01130a89220ca55e6c3f763e9f318c.jpg" + } + ] + } + ], + "index": 11, + "angle": 0, + "type": "image_body" + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 364, + 221, + 422, + 274 + ], + "blocks": [ + { + "bbox": [ + 364, + 221, + 422, + 274 + ], + "lines": [ + { + "bbox": [ + 364, + 221, + 422, + 274 + ], + "spans": [ + { + "bbox": [ + 364, + 221, + 422, + 274 + ], + "type": "image", + "image_path": "ba07ad74ac0a1c16c53556c73f8fb68bc35769d65a769e546c05f7652a6f290a.jpg" + } + ] + } + ], + "index": 12, + "angle": 0, + "type": "image_body" + } + ], + "index": 12 + }, + { + "type": "image", + "bbox": [ + 364, + 274, + 422, + 327 + ], + "blocks": [ + { + "bbox": [ + 364, + 274, + 422, + 327 + ], + "lines": [ + { + "bbox": [ + 364, + 274, + 422, + 327 + ], + "spans": [ + { + "bbox": [ + 364, + 274, + 422, + 327 + ], + "type": "image", + "image_path": "2e9df8e1c36f024f8a7dd5b2e7334f4d6000739fa2f98f5b646501af506434a6.jpg" + } + ] + } + ], + "index": 13, + "angle": 0, + "type": "image_body" + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 425, + 221, + 479, + 274 + ], + "blocks": [ + { + "bbox": [ + 425, + 221, + 479, + 274 + ], + "lines": [ + { + "bbox": [ + 425, + 221, + 479, + 274 + ], + "spans": [ + { + "bbox": [ + 425, + 221, + 479, + 274 + ], + "type": "image", + "image_path": "5882c696047e05caff17625507909b1c1af1e229e932366c59e8e7585e7063f9.jpg" + } + ] + } + ], + "index": 14, + "angle": 0, + "type": "image_body" + } + ], + "index": 14 + }, + { + "type": "image", + "bbox": [ + 425, + 274, + 479, + 327 + ], + "blocks": [ + { + "bbox": [ + 425, + 274, + 479, + 327 + ], + "lines": [ + { + "bbox": [ + 425, + 274, + 479, + 327 + ], + "spans": [ + { + "bbox": [ + 425, + 274, + 479, + 327 + ], + "type": "image", + "image_path": "f11ac7e701e9c90689d8a669fa06eec361b809220cb791f99cc0f273db04ca6c.jpg" + } + ] + } + ], + "index": 15, + "angle": 0, + "type": "image_body" + } + ], + "index": 15 + }, + { + "bbox": [ + 131, + 414, + 389, + 428 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 414, + 389, + 428 + ], + "spans": [ + { + "bbox": [ + 131, + 414, + 389, + 428 + ], + "type": "text", + "content": "3 Pre-training Dataset Preparation: Inf30" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 131, + 441, + 308, + 453 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 441, + 308, + 453 + ], + "spans": [ + { + "bbox": [ + 131, + 441, + 308, + 453 + ], + "type": "text", + "content": "3.1 Collection and Preprocessing" + } + ] + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 461, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 461, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 461, + 482, + 581 + ], + "type": "text", + "content": "A large-scale dataset is essential for training the foundation model. Hence, this study has constructed a dataset named Inf30. The diversity of the images is important for learning the generalized representation. Hence, we extensively collect about 500K of infrared images from various websites [13, 20, 24, 40, 44, 46, 56]. However, the quality of these images is uneven. For example, the images extracted from the same video exhibit significant similarity, leading to a reduction in image diversity. Additionally, some infrared images obtained from the internet pose challenges due to their extremely low resolution. Consequently, we initiate preprocessing all of the collected images to improve the quality of the infrared dataset." + } + ] + } + ], + "index": 19 + }, + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 641 + ], + "type": "text", + "content": "As for the issue of high similarity in infrared images, we initially selected one image as the anchor. Subsequently, we eliminated those images that have a closely resembling scene with the anchor image and retained images that exhibit substantial dissimilarity. As for the issue of low resolution, we conducted data cleaning by removing images with both width and height of less than 20 pixels." + } + ] + } + ], + "index": 20 + }, + { + "bbox": [ + 131, + 641, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 641, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 131, + 641, + 482, + 665 + ], + "type": "text", + "content": "After collecting and preprocessing the infrared images, we finally obtained 305,241 images. As illustrated in Fig. 2, the scene in our dataset encompasses" + } + ] + } + ], + "index": 21 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 448, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 448, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 448, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "5" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 4 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "content": "skies, seascapes, forests, urban areas, suburban areas, lawns, and schools, while the objects include various types of ships, vehicles, pedestrians, public facilities, and residential buildings. The minimum resolution of images is " + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "inline_equation", + "content": "40 \\times 23" + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "content": ", and the maximum resolution of images is " + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "inline_equation", + "content": "6912 \\times 1024" + }, + { + "bbox": [ + 130, + 116, + 482, + 164 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 181, + 302, + 194 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 181, + 302, + 194 + ], + "spans": [ + { + "bbox": [ + 131, + 181, + 302, + 194 + ], + "type": "text", + "content": "3.2 Detail Information Analysis" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 201, + 482, + 248 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 201, + 482, + 248 + ], + "spans": [ + { + "bbox": [ + 130, + 201, + 482, + 248 + ], + "type": "text", + "content": "In this section, we analyze the detail richness of our Inf30 and the well-established ImageNet-1K [10]. We employ the information entropy to measure the information of an image, which can reflect the detail richness. The information entropy is defined as follows:" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 233, + 258, + 481, + 289 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 233, + 258, + 481, + 289 + ], + "spans": [ + { + "bbox": [ + 233, + 258, + 481, + 289 + ], + "type": "interline_equation", + "content": "H (X) = - \\sum_ {i = 1} ^ {n} P \\left(x _ {i}\\right) \\cdot \\log_ {2} \\left(P \\left(x _ {i}\\right)\\right), \\tag {1}", + "image_path": "bd4bb850e0ad362cfb7fed2ec7dead6b8a693ba6e16375c2f8156fec1174a7a6.jpg" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "spans": [ + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "text", + "content": "where " + }, + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "inline_equation", + "content": "n" + }, + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "text", + "content": " is the number of brightness levels in the image, " + }, + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "inline_equation", + "content": "x_{i}" + }, + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "text", + "content": " represents each brightness level, and " + }, + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "inline_equation", + "content": "P(x_{i})" + }, + { + "bbox": [ + 130, + 292, + 482, + 363 + ], + "type": "text", + "content": " is the probability of the brightness level in the image. We calculate the information entropy of images in the Inf30 and ImageNet-1K datasets. The average information entropy of Inf30 is 6.44, while the average information entropy of ImageNet-1K is 7.19. This reveals that the visible dataset exhibits richer information compared to the infrared image dataset." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 364, + 481, + 399 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 364, + 481, + 399 + ], + "spans": [ + { + "bbox": [ + 130, + 364, + 481, + 399 + ], + "type": "text", + "content": "Recognizing the low information richness of infrared images, this study introduces an information-aware masking strategy to enhance the generalized representation learning ability of the foundation model." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 417, + 203, + 430 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 417, + 203, + 430 + ], + "spans": [ + { + "bbox": [ + 131, + 417, + 203, + 430 + ], + "type": "text", + "content": "4 Method" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 131, + 442, + 209, + 453 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 442, + 209, + 453 + ], + "spans": [ + { + "bbox": [ + 131, + 442, + 209, + 453 + ], + "type": "text", + "content": "4.1 Overview" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 461, + 482, + 581 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 461, + 482, + 581 + ], + "spans": [ + { + "bbox": [ + 130, + 461, + 482, + 581 + ], + "type": "text", + "content": "As depicted in Fig. 3, the proposed InfMAE architecture consists of three principal modules: 1) the mask block generation module, 2) the multi-scale encoder module, and 3) the infrared decoder module. In the mask block generation module, we adopt an information-aware masking strategy on input tokens to get visible token IDs, mask_block1, and mask_block2, which are used in the multiscale encoder module. In the multi-scale encoder module, inspired by the MCMAE [15], we combine convolution and self-attention mechanisms to conduct multi-scale representation learning for the visible tokens. In the infrared decoder module, we integrate the multi-scale representation with the learned visible tokens for image reconstruction." + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 131, + 597, + 362, + 611 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 597, + 362, + 611 + ], + "spans": [ + { + "bbox": [ + 131, + 597, + 362, + 611 + ], + "type": "text", + "content": "4.2 The Structure of the Proposed InfMAE" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "The Mask Block Generation Module Since infrared images lack color and texture details, employing a random masking strategy, as done by the vanilla MAE [17], would result in excessive masking of information-poor regions. This could undermine the network's capacity to develop robust representations from" + } + ] + } + ], + "index": 12 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "6" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 5 + }, + { + "para_blocks": [ + { + "type": "image", + "bbox": [ + 135, + 114, + 478, + 240 + ], + "blocks": [ + { + "bbox": [ + 135, + 114, + 478, + 240 + ], + "lines": [ + { + "bbox": [ + 135, + 114, + 478, + 240 + ], + "spans": [ + { + "bbox": [ + 135, + 114, + 478, + 240 + ], + "type": "image", + "image_path": "1a27b3dbe4b83c9a2df19f43175e9b09bad68621fb4e9488e97cc65ddbb399fe.jpg" + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "image_body" + }, + { + "bbox": [ + 130, + 250, + 480, + 293 + ], + "lines": [ + { + "bbox": [ + 130, + 250, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 130, + 250, + 480, + 293 + ], + "type": "text", + "content": "Fig. 3: The framework of the proposed InfMAE. It contains three modules: the mask block generation module, the multi-scale encoder module, and the infrared decoder module. The features connected by the red dashed lines in the multi-scale encoder module are fed into the infrared decoder module." + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "image_caption" + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 319, + 479, + 342 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 319, + 479, + 342 + ], + "spans": [ + { + "bbox": [ + 130, + 319, + 479, + 342 + ], + "type": "text", + "content": "infrared images. Hence, this study proposes an information-aware masking strategy that can dynamically adjust mask tokens according to the image context." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "spans": [ + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": "Given an input image " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "x \\in \\mathbb{R}^{H \\times W \\times C}" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": ", where " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "C, H," + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "W" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": " denote the number of channels, height, and width respectively. " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": " is first input into the information analysis part to get the intensity-wise feature map. The information analysis part is a convolution with both the kernel size and stride set to 16. Then we calculate the mean value of the intensity-wise feature map along the channel dimension and obtain the gray value map " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "I \\in \\mathbb{R}^{\\frac{H}{16} \\times \\frac{W}{16}}" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": ". After that, the gray value map is flattened to " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": " tokens, " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "N = \\frac{H}{16} \\times \\frac{W}{16}" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": ". Meanwhile, these tokens are arranged in descending order of their gray values, where a higher value means that the information is richer. As depicted in the lower left corner of Fig. 3, each box represents a token, and the number within the box is the sorted token ID. After that, we perform the information-aware masking strategy on the sorted tokens, with a sampling stride " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": ". Specifically, we sample the sorted tokens at an interval of " + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "inline_equation", + "content": "S" + }, + { + "bbox": [ + 130, + 343, + 482, + 534 + ], + "type": "text", + "content": ". The sampled tokens are the visible tokens and the rest are masked tokens. Meanwhile, we record the orders of the visible tokens' IDs and the masked tokens' IDs. These IDs are used as a reference for generating mask blocks." + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 536, + 482, + 608 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 536, + 482, + 608 + ], + "spans": [ + { + "bbox": [ + 130, + 536, + 482, + 608 + ], + "type": "text", + "content": "For mask block generation, we first obtain a binary value mask template through the ID mapping according to the sorted tokens IDs. In the mask template in Fig. 3, the white area is the visible token while the black area is the masked token. Then we up-sample the mask template two and four times to get the mask_block2 and mask_block1 for the following multi-scale learning in the multi-scale encoder module." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 131, + 629, + 482, + 666 + ], + "type": "text", + "content": "The Multi-scale Encoder Module Inspired by previous works like MCMAE [15] and ConvNeXt [54], we introduce a multi-scale encoder for visible token learning. This multi-scale encoder module mainly contains three encoder layers," + } + ] + } + ], + "index": 7 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "7" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 6 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": "which are two CNN-based encoders, named encoder layer 1 and encoder layer 2, and one Transorfmer-based encoder, named encoder layer 3. Such three encoder layers can output feature maps with multi-scale spatial resolution, which are " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "F_{1} \\in \\mathbb{R}^{\\frac{H}{4} \\times \\frac{W}{4} \\times C_{1}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": ", " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "F_{2} \\in \\mathbb{R}^{\\frac{H}{8} \\times \\frac{W}{8} \\times C_{2}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "T_{s} \\in N_{v} \\times C_{3}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": ", respectively. The " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "N_{v}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " is the number of the visible tokens. Specifically, we first input the image " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " into the patch embedding 1 and encoder layer 1 to obtain the feature map " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "F_{1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": ". It should be noted that after the patch embedding 1 and token-wise convolution, we obtain the feature map " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "E_{1} \\in \\mathbb{R}^{\\frac{H}{4} \\times \\frac{W}{4} \\times C_{1}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": ", and then we dot " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "E_{1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " and mask_block1 which are obtained in mask block generation module to mask the original feature. Finally, we follow [15] and adopt the convolutional attention (Conv Attention) and FFN. Same as encoder layer 1, the " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "F_{1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": " is inputted into patch embedding 2 and encoder layer 2 to obtain the feature maps " + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "inline_equation", + "content": "F_{2} \\in \\mathbb{R}^{\\frac{H}{8} \\times \\frac{W}{8} \\times C_{2}}" + }, + { + "bbox": [ + 130, + 116, + 482, + 259 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "spans": [ + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "text", + "content": "After the patch embedding 3 and a linear operation, the " + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "inline_equation", + "content": "F_{2}" + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "text", + "content": " is flattened into " + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "text", + "content": " tokens " + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "inline_equation", + "content": "T\\in N\\times C_3" + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "text", + "content": ". Then, we select the visible tokens from the " + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "inline_equation", + "content": "N" + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "text", + "content": " tokens according to the visible token IDs obtained by the mask block generation module. Finally, we use the encoder layer 3 whose structure is the same as the ViT [12] encoder layer, and obtain the learned visible tokens " + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "inline_equation", + "content": "T_{s}\\in N_{v}\\times C_{3}" + }, + { + "bbox": [ + 130, + 260, + 482, + 321 + ], + "type": "text", + "content": "." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "spans": [ + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": "The Infrared Decoder Module In this study, we combine the multi-scale visible tokens and mask tokens and take them into the decoder for image reconstruction. Specifically, we normalize the multi-scale features " + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "inline_equation", + "content": "F_{1}" + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "inline_equation", + "content": "F_{2}" + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": " to the same size and then flatten them into the same shape with " + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "inline_equation", + "content": "T" + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": ". After that, we obtain the visible tokens " + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "inline_equation", + "content": "T_{1}" + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "inline_equation", + "content": "T_{2}" + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": " according to the visible token IDs. Then, we add all the values of visible tokens " + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "inline_equation", + "content": "T_{1}, T_{2}" + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "inline_equation", + "content": "T_{s}" + }, + { + "bbox": [ + 130, + 338, + 482, + 482 + ], + "type": "text", + "content": " and concat both masked tokens and visible tokens along the first dimension. Meanwhile, we restore the order of these tokens based on the ID number in the mask block generation module. We feed the restored tokens into the decoder for image reconstruction. It is worth noting that infrared images lack many details and color information, so in this study, we set the infrared decoder depth to 2 for image reconstruction, whose structure is the same as the decoder of MAE [17]." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 483, + 482, + 518 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 483, + 482, + 518 + ], + "spans": [ + { + "bbox": [ + 130, + 483, + 482, + 518 + ], + "type": "text", + "content": "The loss function measures the Mean Square Error (MSE) between the masked patches of reconstructed image " + }, + { + "bbox": [ + 130, + 483, + 482, + 518 + ], + "type": "inline_equation", + "content": "y" + }, + { + "bbox": [ + 130, + 483, + 482, + 518 + ], + "type": "text", + "content": " and the original image " + }, + { + "bbox": [ + 130, + 483, + 482, + 518 + ], + "type": "inline_equation", + "content": "x" + }, + { + "bbox": [ + 130, + 483, + 482, + 518 + ], + "type": "text", + "content": ". The MSE loss is defined as follows:" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 252, + 529, + 481, + 562 + ], + "type": "interline_equation", + "angle": 0, + "lines": [ + { + "bbox": [ + 252, + 529, + 481, + 562 + ], + "spans": [ + { + "bbox": [ + 252, + 529, + 481, + 562 + ], + "type": "interline_equation", + "content": "\\mathcal {L} _ {m s e} = \\frac {1}{M} \\sum_ {i = 1} ^ {M} \\left(y _ {i} - x _ {i}\\right) ^ {2}, \\tag {2}", + "image_path": "acd296406352c4b455739fc8e41e09293622bd1d1da9ea2819981b81d4afdb7c.jpg" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 131, + 565, + 324, + 578 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 565, + 324, + 578 + ], + "spans": [ + { + "bbox": [ + 131, + 565, + 324, + 578 + ], + "type": "text", + "content": "where the " + }, + { + "bbox": [ + 131, + 565, + 324, + 578 + ], + "type": "inline_equation", + "content": "M" + }, + { + "bbox": [ + 131, + 565, + 324, + 578 + ], + "type": "text", + "content": " means the number of images." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 131, + 596, + 320, + 608 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 596, + 320, + 608 + ], + "spans": [ + { + "bbox": [ + 131, + 596, + 320, + 608 + ], + "type": "text", + "content": "4.3 InfMAE for Downstream Tasks" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": "After the self-supervised pre-training, InfMAE learns multi-scale feature maps, which can be employed for existing infrared semantic segmentation, object detection, and small target detection methods. To finetune InfMAE for these downstream tasks, we extract the " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "F_{1}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "inline_equation", + "content": "F_{2}" + }, + { + "bbox": [ + 130, + 617, + 482, + 666 + ], + "type": "text", + "content": " obtained by the encoder layer 1 and" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 140, + 100 + ], + "type": "text", + "content": "8" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 220, + 101 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 7 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": "encoder layer 2. Meanwhile, we reshape " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "T_{s}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": " to the feature " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "F_{3} \\in \\mathbb{R}^{\\frac{H}{16} \\times \\frac{W}{16} \\times C_{3}}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": " and downsample the " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "F_{3}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": " to " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "F_{4} \\in \\mathbb{R}^{\\frac{H}{32} \\times \\frac{W}{32} \\times C_{4}}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": " by a convolution layer. It should be noted that when finetuning InfMAE for these downstream tasks, the shape of " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "T_{s}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": " is " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "N \\times C_{3}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": ". Finally, " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "F_{1}, F_{2}, F_{3}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": ", and " + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "inline_equation", + "content": "F_{4}" + }, + { + "bbox": [ + 132, + 114, + 480, + 163 + ], + "type": "text", + "content": " are input into the downstream methods." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 132, + 186, + 223, + 201 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 186, + 223, + 201 + ], + "spans": [ + { + "bbox": [ + 132, + 186, + 223, + 201 + ], + "type": "text", + "content": "5 Experiment" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 215, + 481, + 274 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 215, + 481, + 274 + ], + "spans": [ + { + "bbox": [ + 132, + 215, + 481, + 274 + ], + "type": "text", + "content": "Initially, the proposed InfMAE is subjected to self-supervised pre-training using the released Inf30 dataset. Then, to assess the generalizability and robustness of InfMAE, it is applied to a series of downstream tasks. Finally, a series of ablation studies are conducted to confirm the efficacy and validity of the InfMAE framework." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 297, + 254, + 310 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 297, + 254, + 310 + ], + "spans": [ + { + "bbox": [ + 132, + 297, + 254, + 310 + ], + "type": "text", + "content": "5.1 Pre-training Setup" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 320, + 481, + 464 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 320, + 481, + 464 + ], + "spans": [ + { + "bbox": [ + 132, + 320, + 481, + 464 + ], + "type": "text", + "content": "The framework of the proposed InfMAE is implemented using pytorch 1.12.0 and accelerated by CUDA 11.6 on 4 A100 GPUs. The sampling stride " + }, + { + "bbox": [ + 132, + 320, + 481, + 464 + ], + "type": "inline_equation", + "content": "s" + }, + { + "bbox": [ + 132, + 320, + 481, + 464 + ], + "type": "text", + "content": " of the information-aware masking strategy is set by default to 4. The number of the encoder layer 1, encoder layer 2, and encoder layer 3 are set to 2, 2, and 11, respectively. Meanwhile, the Transformer-based encoder layer 3 with 768 feature dimensions and 12 attention heads. The infrared decoder is configured with two transformer layers, each having 512 feature dimensions and 12 attention heads. For training optimization, we adopt a 400-epoch cosine learning rate schedule, incorporating a 40-epoch warm-up phase. Optimization is achieved through the AdamW [36] optimizer, which is set to a base learning rate of " + }, + { + "bbox": [ + 132, + 320, + 481, + 464 + ], + "type": "inline_equation", + "content": "1.5 \\times 10^{-4}" + }, + { + "bbox": [ + 132, + 320, + 481, + 464 + ], + "type": "text", + "content": ", a weight decay of 0.05, and a batch size of 256. Additionally, random cropping is employed as a data augmentation strategy during pre-training." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 485, + 434, + 498 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 485, + 434, + 498 + ], + "spans": [ + { + "bbox": [ + 132, + 485, + 434, + 498 + ], + "type": "text", + "content": "5.2 InfMAE on The Infrared Semantic Segmentation Task" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 509, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 509, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 509, + 481, + 665 + ], + "type": "text", + "content": "Experimental Setup The MSRS [48] dataset is a semantic segmentation dataset of 1444 paired infrared and visible images. The training set contains 1083 pairs of infrared and visible images and the testing set consists of 361 image pairs. The images are categorized into eight major urban driving-related classes (Cars, People, Bicycles, Curves, Car Stops, Guardrails, Color Cones, and Bumps), providing a robust basis for urban scene analysis. In our experiments, we use the infrared component of the MSRS dataset, referred to as MARS-inf in the following description, to validate the performance of our method. We adopt UperNet [55] and FCN [35], the hierarchical segmentation network headers, to compare the effectiveness of pre-trained InfMAE with other SOTA methods. We use a 24k iteration polynomial learning rate scheme with the first 1500 iterations warmed up. The AdamW [36] optimizer is used, with an initial learning rate of 10e-4, weight decay of 0.05, and a batch size of 2." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 474, + 92, + 480, + 100 + ], + "type": "text", + "content": "9" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 8 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 115, + 482, + 259 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 115, + 482, + 259 + ], + "spans": [ + { + "bbox": [ + 130, + 115, + 482, + 259 + ], + "type": "text", + "content": "Results on The MSRS-inf In our comparative analysis, the performance of the proposed method is evaluated against both supervised methods UperNet [55], DeeplabV3 + [8], DNLNet [57], DDRNet [41], and self-supervised methods vanilla MAE [17], MCMAE [15], UM-PVT [27]. We evaluate these methods using metrics such as the Intersection over Union (IoU) for each class, the mean Intersection over Union (mIoU) across all classes, and the mean accuracy (mAcc) for all classes. The experimental results are shown in Table 1. We first combine the encoder of the proposed InfMAE and the segmentation head of the Upernet [55] and train the method from scratch in a supervised manner. Compared with this method, leveraging the pre-trained weights of this encoder significantly enhances performance, as shown in Table 1. Meanwhile, compared with other supervised and self-supervised methods, the proposed method outperforms them a lot." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 259, + 481, + 295 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 259, + 481, + 295 + ], + "spans": [ + { + "bbox": [ + 130, + 259, + 481, + 295 + ], + "type": "text", + "content": "To evaluate the generalisability of the proposed InfMAE to other segmentation methods, we also use the FCN [35] head for semantic segmentation. As can be seen in Table 1, the proposed method outperforms all the SOTA methods." + } + ] + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 133, + 357, + 479, + 454 + ], + "blocks": [ + { + "bbox": [ + 130, + 315, + 481, + 348 + ], + "lines": [ + { + "bbox": [ + 130, + 315, + 481, + 348 + ], + "spans": [ + { + "bbox": [ + 130, + 315, + 481, + 348 + ], + "type": "text", + "content": "Table 1: Comparison with different semantic segmentation methods on the MSRSinf [48] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 357, + 479, + 454 + ], + "lines": [ + { + "bbox": [ + 133, + 357, + 479, + 454 + ], + "spans": [ + { + "bbox": [ + 133, + 357, + 479, + 454 + ], + "type": "table", + "html": "
MethodsBackboneModelCar(%)Person(%)Bike(%)Curve(%)Car_Stop(%)Guardrail(%)Color_Cone(%)Bumb(%)mIoU(%)mAcc(%)
UperNet [55]Resnet50-82.667.264.247.355.156.653.965.965.674.7
DeeplabV3+ [8]Resnet50-84.269.563.745.154.768.844.558.865.273.8
DNLNet [57]Resnet101-86.766.568.050.557.756.750.369.667.075.7
DDRRNet [41]--87.069.666.847.061.051.356.268.867.373.3
Sup.(Scratch)ViT-BFCN75.463.755.936.449.146.928.655.756.563.4
Vanila MAE [17]ViT-BFCN83.267.362.644.558.157.745.060.564.171.6
UM-VPT [27]VPT-SFCN80.367.361.441.154.259.138.761.962.470.1
MCMAE [15]ViT-BFCN86.568.866.855.068.367.052.372.770.678.7
InfMAE(Ours)ViT-BFCN88.270.168.256.170.067.554.574.972.080.0
Sup.(Scratch)ViT-BUperNet74.050.741.249.735.640.544.055.961.161.1
Vanilla MAE [17]ViT-BUperNet86.672.366.056.269.770.254.968.171.478.2
UM-VPT [27]VPT-SUperNet87.272.166.654.063.856.452.169.068.876.3
MCMAE [15]ViT-BUperNet87.573.266.557.169.767.257.073.072.179.8
InfMAE(Ours)ViT-BUperNet89.372.868.859.172.176.757.174.274.382.5
", + "image_path": "ded5a8689edaaf34374c03632379b9d1c34345712026b59a4c2ffebcd87a87b5.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 490, + 404, + 502 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 490, + 404, + 502 + ], + "spans": [ + { + "bbox": [ + 130, + 490, + 404, + 502 + ], + "type": "text", + "content": "5.3 InfMAE on The Infrared Object Detection Task" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 506, + 482, + 627 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 506, + 482, + 627 + ], + "spans": [ + { + "bbox": [ + 130, + 506, + 482, + 627 + ], + "type": "text", + "content": "Experimental Setup The M3FD [34] dataset is an infrared and visible target detection dataset that contains 4200 images. The dataset labels six targets (People, Cars, Bus, Motor, Trucks, Lamps) during driving. We use the infrared images from it for experimental performance validation. In the following description, we call this used dataset M3FD-inf. We follow the most common setting to use the detection heads in Mask R-CNN [18] and Cascade R-CNN [4] and fine-tune the pre-trained InfMAE model. We follow most of the settings of the benchmark ViT [12]. We report the performance of the target detection model under 25 epoch cosine scheduling with a base learning rate of 10e-4 and a weight decay of 0.1. The batch size is set to 2." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 641, + 481, + 666 + ], + "type": "text", + "content": "Results on The M3FD-inf We compare the proposed method with the supervised methods DETR [5], Sparse R-CNN [47], DINO [6], YoloV8 [51] and" + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "10" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 9 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 133, + 157, + 479, + 256 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 148 + ], + "type": "text", + "content": "Table 2: Performances of different object detection methods on the M3FD-inf [34] dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 133, + 157, + 479, + 256 + ], + "lines": [ + { + "bbox": [ + 133, + 157, + 479, + 256 + ], + "spans": [ + { + "bbox": [ + 133, + 157, + 479, + 256 + ], + "type": "table", + "html": "
MethodsBackboneModelPeople(%)Car(%)Bus(%)Motor(%)Lamp(%)Truck(%)mAP(%)AP50(%)
DETR [5]ResNet101-78.588.187.875.865.978.146.779.0
Sparse R-CNN [47]ResNet50-84.288.788.075.366.274.048.379.4
DINO [6]Swin-L-83.287.585.661.560.473.545.375.3
YoloV8 [51]CSPDarkNet-42.854.358.232.516.240.740.863.0
Sup.(Scratch)ViT-BMask R-CNN83.388.690.172.466.479.148.780.0
Vanilla MAE [17]ViT-BMask R-CNN84.889.693.176.076.580.551.483.4
MCMAE [15]ViT-BMask R-CNN87.890.893.187.785.984.955.788.4
InfMAE(Ours)ViT-BMask R-CNN87.990.794.687.185.283.256.288.1
Sup.(Scratch)ViT-BCascade R-CNN83.788.691.168.263.979.050.979.1
Vanilla MAE [17]ViT-BCascade R-CNN85.288.994.372.272.679.652.882.1
MCMAE [15]ViT-BCascade R-CNN85.690.493.176.880.983.754.785.1
InfMAE(Ours)ViT-BCascade R-CNN85.790.494.981.981.483.455.886.3
", + "image_path": "89d00eb03b133943dee006188585c0e69edaa5a0dc2e48a14f9c22eb52511850.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 277, + 481, + 372 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 277, + 481, + 372 + ], + "spans": [ + { + "bbox": [ + 133, + 277, + 481, + 372 + ], + "type": "text", + "content": "with the self-supervised methods vanilla MAE [17], MCMAE [15]. We report the AP50 of each class, the mAP and AP50 of all classes' performance of all methods, and the experiment results are shown in Table 2. As shown in this table, when combining the encoder of the proposed InfMAE and the detection head of the Cascade R-CNN [4] method, the proposed method outperforms all supervised methods. As for the self-supervised methods, the proposed method outperforms most of the SOTA methods. We can observe a similar experiment performance when using the head of Mask R-CNN method." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 388, + 433, + 400 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 388, + 433, + 400 + ], + "spans": [ + { + "bbox": [ + 133, + 388, + 433, + 400 + ], + "type": "text", + "content": "5.4 InfMAE on The Infrared Small Target Detection Task" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 407, + 481, + 477 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 407, + 481, + 477 + ], + "spans": [ + { + "bbox": [ + 133, + 407, + 481, + 477 + ], + "type": "text", + "content": "Experimental Setup The IRSTD-1k [58] is a well-established infrared small target detection dataset that contains 1000 infrared modal images with pixel-level annotations. We replace the encoder in [33] with the multi-scale encoder module in InfMAE. During the training phase, we adopt the AdamW [36] optimizer with an initial learning rate of 0.001, a weight decay of 0.05, and a batch size of 2." + } + ] + } + ], + "index": 6 + }, + { + "type": "table", + "bbox": [ + 184, + 538, + 430, + 642 + ], + "blocks": [ + { + "bbox": [ + 132, + 496, + 480, + 529 + ], + "lines": [ + { + "bbox": [ + 132, + 496, + 480, + 529 + ], + "spans": [ + { + "bbox": [ + 132, + 496, + 480, + 529 + ], + "type": "text", + "content": "Table 3: Performances of different infrared small target detection methods on the IRSTD-1k dataset, where Sup. (Scratch) indicates training our method from scratch. The bold and underline marks denote the best and suboptimal results, respectively." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 184, + 538, + 430, + 642 + ], + "lines": [ + { + "bbox": [ + 184, + 538, + 430, + 642 + ], + "spans": [ + { + "bbox": [ + 184, + 538, + 430, + 642 + ], + "type": "table", + "html": "
MethodsBackbonePd(%)AUC(%)F1(%)IoU(%)
LPNetGA [7]-77.160.650.834.1
DNANet [25]-89.687.876.461.8
ISTR [33]ViT-B85.886.169.453.1
Sup.(Scratch)ViT-B86.186.172.657.0
Vanilla MAE [17]ViT-B86.886.872.857.2
MCMAE [15]ViT-B74.290.878.464.5
UM-VPT [27]VPT-S99.688.973.558.1
InfMAE(Ours)ViT-B96.691.279.566.0
", + "image_path": "83b5d5b8d6787eaacfea5c9a9a87ce42f3273f94cc75b6d26fb5ce470a6a7d01.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 479, + 100 + ], + "type": "text", + "content": "11" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 10 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": "Results on The IRSTD We compare the proposed method with the supervised methods LPNetGA [7], DNANet [25], ISTR [33], and with the self-supervised methods Vanilla MAE [17], MCMAE [15], UM-PVT [27]. According to the [14, 33], we report four main performance metrics: positive detection " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "P_{d}" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": ", AUC, pixel-level F1 score " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "F_{1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": ", and IoU in the table 3. From this table, we can see that the proposed foundation model outperforms all the SOTA methods in metrics of AUC, " + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "inline_equation", + "content": "F_{1}" + }, + { + "bbox": [ + 130, + 116, + 482, + 200 + ], + "type": "text", + "content": ", and IoU." + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 131, + 214, + 320, + 226 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 131, + 214, + 320, + 226 + ], + "spans": [ + { + "bbox": [ + 131, + 214, + 320, + 226 + ], + "type": "text", + "content": "5.5 Ablation Study of The InfMAE" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 231, + 481, + 302 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 231, + 481, + 302 + ], + "spans": [ + { + "bbox": [ + 130, + 231, + 481, + 302 + ], + "type": "text", + "content": "Module Ablation In this section, we validate the effect of the information-aware masking strategy and multi-scale strategy. We adopt the UperNet [55] as the segmentation head and the Mask R-CNN [18] as the object detection head. The results are shown in Table 4. From this Table, we can see that combining the proposed information-aware masking strategy and the introduced multi-scale strategy can achieve better performance in downstream tasks." + } + ] + } + ], + "index": 4 + }, + { + "type": "table", + "bbox": [ + 149, + 353, + 465, + 412 + ], + "blocks": [ + { + "bbox": [ + 130, + 321, + 481, + 344 + ], + "lines": [ + { + "bbox": [ + 130, + 321, + 481, + 344 + ], + "spans": [ + { + "bbox": [ + 130, + 321, + 481, + 344 + ], + "type": "text", + "content": "Table 4: Ablation study on the influence of the masking strategy and multi-scale strategy. The IAM means the information-aware masking strategy." + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 149, + 353, + 465, + 412 + ], + "lines": [ + { + "bbox": [ + 149, + 353, + 465, + 412 + ], + "spans": [ + { + "bbox": [ + 149, + 353, + 465, + 412 + ], + "type": "table", + "html": "
IAM Multi-scaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
-71.478.281.549.1
✓72.079.478.950.1
-72.179.886.355.0
✓74.382.588.156.2
", + "image_path": "fd7e2e30d0af838c41bcd2d960563c21d55daa41332100ab2092b6ac56732c61.jpg" + } + ] + } + ], + "index": 6, + "angle": 0, + "type": "table_body" + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 447, + 482, + 567 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 447, + 482, + 567 + ], + "spans": [ + { + "bbox": [ + 130, + 447, + 482, + 567 + ], + "type": "text", + "content": "Decoder Depth In this section, we analyze the effects of different decoder depths on the experimental performance of downstream tasks. We set the decoder depth to 2, 4, 8, and 12 respectively, and we also adopt the UperNet [55] and the Mask R-CNN [18] as the segmentation and object detection heads. The experimental performance is shown in the table 5. From the table, we can see that segmentation and detection gain the best result when the decoder depth is 2. From the experimental results, we can find that the infrared image does not need a deep decoder because of its lack of texture, detail, and color information. Meanwhile, we can observe from this table that the semantic performance is more sensitive to the decoder depth." + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "spans": [ + { + "bbox": [ + 130, + 582, + 482, + 665 + ], + "type": "text", + "content": "Masking Strides In this section, we analyze the experimental performance under different masking strides. For the mask strides, we select 2, 4, and 7, and the experimental results are shown in the table 6. From the table, we can see that when the masking stride is set to 4, the semantic segmentation metrics mIoU and mAcc are the best, while the detection metric AP50 is suboptimal. Considering that setting the sampling stride to 2 leads to an increase in the model's parameter count, we select a masking stride of 4." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "12" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 11 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 151, + 146, + 462, + 205 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 479, + 137 + ], + "type": "text", + "content": "Table 5: The influence of increasing decoder depths on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 151, + 146, + 462, + 205 + ], + "lines": [ + { + "bbox": [ + 151, + 146, + 462, + 205 + ], + "spans": [ + { + "bbox": [ + 151, + 146, + 462, + 205 + ], + "type": "table", + "html": "
DecoderDepthSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.382.588.156.2
472.980.487.955.6
873.280.787.653.8
1274.081.987.254.1
", + "image_path": "0091d7b73df8923c7644c2804890750064bc9ad380f9aeb1a4ea0782a272a4c1.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 168, + 257, + 446, + 316 + ], + "blocks": [ + { + "bbox": [ + 132, + 214, + 480, + 247 + ], + "lines": [ + { + "bbox": [ + 132, + 214, + 480, + 247 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 480, + 247 + ], + "type": "text", + "content": "Table 6: The influence of different masking strides of the information-aware masking strategy on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + } + ] + } + ], + "index": 4, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 168, + 257, + 446, + 316 + ], + "lines": [ + { + "bbox": [ + 168, + 257, + 446, + 316 + ], + "spans": [ + { + "bbox": [ + 168, + 257, + 446, + 316 + ], + "type": "table", + "html": "
StridesSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
274.282.089.356.1
474.382.588.156.2
771.879.988.054.9
1470.4--54.3
", + "image_path": "3cec5a1b8b605d8cb9581298a04af0bf57bab60d0c236b969a9db86813bad289.jpg" + } + ] + } + ], + "index": 5, + "angle": 0, + "type": "table_body" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 337, + 480, + 408 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 337, + 480, + 408 + ], + "spans": [ + { + "bbox": [ + 132, + 337, + 480, + 408 + ], + "type": "text", + "content": "Pre-training Epochs For MAE, 1600 pre-training epochs can significantly improve the quality of the learned representations. To explore this effect of pretraining time, we train InfMAE with 200, 400, 800, and 1600 epochs and finetune the pre-trained models on downstream tasks. The experimental results can be seen in Table 7. From this table, we observe improved performances across most downstream tasks with an increase in pre-training epochs." + } + ] + } + ], + "index": 6 + }, + { + "type": "table", + "bbox": [ + 147, + 460, + 466, + 520 + ], + "blocks": [ + { + "bbox": [ + 132, + 429, + 480, + 451 + ], + "lines": [ + { + "bbox": [ + 132, + 429, + 480, + 451 + ], + "spans": [ + { + "bbox": [ + 132, + 429, + 480, + 451 + ], + "type": "text", + "content": "Table 7: The influence of increasing pre-training epochs on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + } + ] + } + ], + "index": 7, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 147, + 460, + 466, + 520 + ], + "lines": [ + { + "bbox": [ + 147, + 460, + 466, + 520 + ], + "spans": [ + { + "bbox": [ + 147, + 460, + 466, + 520 + ], + "type": "table", + "html": "
Pre-train EpochsSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
20071.378.987.455.4
40074.382.588.156.2
80074.983.188.355.9
160074.983.288.256.0
", + "image_path": "bb05acc62e08bde18849235bced922f0fec5dd81eadb52ebbfde83edc92cefba.jpg" + } + ] + } + ], + "index": 8, + "angle": 0, + "type": "table_body" + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 558, + 481, + 665 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 558, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 132, + 558, + 481, + 665 + ], + "type": "text", + "content": "Pre-training Dataset Size Analysis In this section, we present the impact of varying pre-training dataset sizes on downstream task performance, as documented in Table 8. The Inf10 and Inf15 contain 100K and 150K images which are sampled from Inf30 and the Inf50 contains 500K unprocessed images. The table indicates a progressive enhancement in performance with the increase in dataset size from 100K to 300K while from 300K to 500K does not yield a proportional increase. This phenomenon is likely due to the increasing similarity of images within the larger dataset, which results in a limited representation learning ability of the foundational model. The lack of diversity in the dataset restricts" + } + ] + } + ], + "index": 9 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "13" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 12 + }, + { + "para_blocks": [ + { + "type": "table", + "bbox": [ + 155, + 146, + 459, + 205 + ], + "blocks": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "lines": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "spans": [ + { + "bbox": [ + 132, + 114, + 480, + 137 + ], + "type": "text", + "content": "Table 8: The influence of different pre-train data scales on the infrared semantic segmentation (UperNet) task and object detection (Mask R-CNN) task." + } + ] + } + ], + "index": 2, + "angle": 0, + "type": "table_caption" + }, + { + "bbox": [ + 155, + 146, + 459, + 205 + ], + "lines": [ + { + "bbox": [ + 155, + 146, + 459, + 205 + ], + "spans": [ + { + "bbox": [ + 155, + 146, + 459, + 205 + ], + "type": "table", + "html": "
Dataset ScaleSeg_mIoU(%)Seg_mAcc(%)Det_AP50(%)Det_mAP(%)
Inf1069.177.686.955.0
Inf1573.0--55.6
Inf3074.382.588.156.2
Inf5073.080.587.355.8
", + "image_path": "0e3c1c26bd22bd725b071fc94ec895f9875836e0924e2f3f2f27fc0dea14a06a.jpg" + } + ] + } + ], + "index": 3, + "angle": 0, + "type": "table_body" + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 224, + 479, + 260 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 224, + 479, + 260 + ], + "spans": [ + { + "bbox": [ + 130, + 224, + 479, + 260 + ], + "type": "text", + "content": "the model's generalization ability to various downstream tasks. Thus, the findings highlight the significance of dataset quality and diversity in pre-training for optimal model performance." + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 275, + 357, + 288 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 275, + 357, + 288 + ], + "spans": [ + { + "bbox": [ + 132, + 275, + 357, + 288 + ], + "type": "text", + "content": "5.6 Pre-trained on Inf30 and ImageNet-1K" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "spans": [ + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "text", + "content": "In this section, we discuss the importance of the large-scale infrared dataset in developing an infrared foundation model. To this end, the architecture of the vanilla MAE [17] is utilized for pre-training by 400 epochs on both the Inf30 dataset and the IN1K-30 dataset, the latter comprising 300k visible images randomly sampled from the ImageNet-1K [10] for fair comparison. To assess the generalization capabilities of the pre-trained models, we engage in infrared semantic segmentation using the MSRS-inf [48] dataset with UperNet [55], and infrared object detection on the M3FD-inf [34] dataset utilizing Mask R-CNN [18]. This experimental setting is consistent with the MAE [17]. The mIoUs and AP50 of vanilla MAE pre-trained with IN1K-30 are " + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "inline_equation", + "content": "66.7\\%" + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "inline_equation", + "content": "78.2\\%" + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "text", + "content": ", while pre-trained with Inf30 are " + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "inline_equation", + "content": "71.6\\%" + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "text", + "content": " and " + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "inline_equation", + "content": "83.4\\%" + }, + { + "bbox": [ + 130, + 292, + 482, + 472 + ], + "type": "text", + "content": ". These results show that the MAE [17] pre-trains on Inf30 exhibit stronger generalization capabilities in infrared downstream tasks. This observation underscores that the distribution variances indeed contribute to performance disparities. Hence, the release of a large-scale infrared dataset is crucial for the development of the foundation model." + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 487, + 220, + 500 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 487, + 220, + 500 + ], + "spans": [ + { + "bbox": [ + 132, + 487, + 220, + 500 + ], + "type": "text", + "content": "6 Conclusion" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 510, + 482, + 666 + ], + "type": "text", + "content": "In this paper, we propose a foundation model in the infrared modality, named InfMAE. We collect a dataset containing 305,241 infrared images for self-supervised learning. Meanwhile, to enhance the model's capacity to learn the generalized representation, an information-aware masking strategy is proposed, which can make the network pay more attention to the reconstruction of the information-rich part of the image. Besides, based on the characteristics of infrared images, we design a new decoder structure. Finally, we validate the effectiveness of the proposed method InfMAE in infrared semantic segmentation, object detection, and small target detection tasks. The experimental results show that our InfMAE can obtain better experimental results than other supervised and self-supervised methods. In addition, we discuss some parameters in the InfMAE. We hope that the proposed foundation model InfMAE can promote the development of the infrared vision community." + } + ] + } + ], + "index": 8 + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "14" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 101 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 13 + }, + { + "para_blocks": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "spans": [ + { + "bbox": [ + 133, + 114, + 246, + 129 + ], + "type": "text", + "content": "Acknowledgements" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 143, + 482, + 203 + ], + "type": "text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 143, + 482, + 203 + ], + "spans": [ + { + "bbox": [ + 130, + 143, + 482, + 203 + ], + "type": "text", + "content": "This work is supported in part by the National Key R&D Program of China (2022YFA1004100), and in part by the National Natural Science Foundation of China (No. 62176035, 62201111, 12226004, 62272375), the Science and Technology Research Program of Chongqing Municipal Education Commission under Grant (No.KJZD-K202100606)." + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 224, + 197, + 237 + ], + "type": "title", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 224, + 197, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 224, + 197, + 237 + ], + "type": "text", + "content": "References" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 134, + 251, + 480, + 665 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "spans": [ + { + "bbox": [ + 138, + 251, + 480, + 285 + ], + "type": "text", + "content": "1. Awais, M., Naseer, M., Khan, S., Anwer, R.M., Cholakkal, H., Shah, M., Yang, M.H., Khan, F.S.: Foundational models defining a new era in vision: A survey and outlook (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 138, + 286, + 480, + 308 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 286, + 480, + 308 + ], + "spans": [ + { + "bbox": [ + 138, + 286, + 480, + 308 + ], + "type": "text", + "content": "2. Bao, H., Dong, L., Piao, S., Wei, F.: Beit: Bert pre-training of image transformers. In: International Conference on Learning Representations (2021)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 138, + 309, + 480, + 342 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 309, + 480, + 342 + ], + "spans": [ + { + "bbox": [ + 138, + 309, + 480, + 342 + ], + "type": "text", + "content": "3. Bommasani, R., Hudson, D.A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M.S., Bohg, J., Bosselut, A., Brunskill, E., et al.: On the opportunities and risks of foundation models. arXiv preprint arXiv:2108.07258 (2021)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 138, + 342, + 480, + 375 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 342, + 480, + 375 + ], + "spans": [ + { + "bbox": [ + 138, + 342, + 480, + 375 + ], + "type": "text", + "content": "4. Cai, Z., Vasconcelos, N.: Cascade r-cnn: Delving into high quality object detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 6154-6162 (2018)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 138, + 376, + 480, + 409 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 376, + 480, + 409 + ], + "spans": [ + { + "bbox": [ + 138, + 376, + 480, + 409 + ], + "type": "text", + "content": "5. Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., Zagoruyko, S.: End-to-end object detection with transformers. In: Proceedings of the European conference on computer vision (ECCV). pp. 213-229. Springer (2020)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 138, + 410, + 480, + 442 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 410, + 480, + 442 + ], + "spans": [ + { + "bbox": [ + 138, + 410, + 480, + 442 + ], + "type": "text", + "content": "6. Caron, M., Touvron, H., Misra, I., Jégou, H., Mairal, J., Bojanowski, P., Joulin, A.: Emerging properties in self-supervised vision transformers. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 9650-9660 (2021)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 138, + 443, + 480, + 475 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 443, + 480, + 475 + ], + "spans": [ + { + "bbox": [ + 138, + 443, + 480, + 475 + ], + "type": "text", + "content": "7. Chen, F., Gao, C., Liu, F., Zhao, Y., Zhou, Y., Meng, D., Zuo, W.: Local patch network with global attention for infrared small target detection. IEEE Transactions on Aerospace and Electronic Systems 58(5), 3979-3991 (2022)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 138, + 476, + 480, + 509 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 476, + 480, + 509 + ], + "spans": [ + { + "bbox": [ + 138, + 476, + 480, + 509 + ], + "type": "text", + "content": "8. Chen, L.C., Zhu, Y., Papandreou, G., Schroff, F., Adam, H.: Encoder-decoder with atrous separable convolution for semantic image segmentation. In: Proceedings of the European conference on computer vision (ECCV). pp. 801-818 (2018)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "spans": [ + { + "bbox": [ + 138, + 510, + 480, + 542 + ], + "type": "text", + "content": "9. Chen, X., Gao, C., Li, C., Yang, Y., Meng, D.: Infrared action detection in the dark via cross-stream attention mechanism. IEEE Transactions on Multimedia 24, 288-300 (2021)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 138, + 544, + 480, + 576 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 138, + 544, + 480, + 576 + ], + "spans": [ + { + "bbox": [ + 138, + 544, + 480, + 576 + ], + "type": "text", + "content": "0. Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition. pp. 248-255. IEEE (2009)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 134, + 577, + 480, + 620 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 577, + 480, + 620 + ], + "spans": [ + { + "bbox": [ + 134, + 577, + 480, + 620 + ], + "type": "text", + "content": "11. Dong, X., Bao, J., Zhang, T., Chen, D., Zhang, W., Yuan, L., Chen, D., Wen, F., Yu, N., Guo, B.: Peco: Perceptual codebook for bert pre-training of vision transformers. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 552-560 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 134, + 621, + 480, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 134, + 621, + 480, + 665 + ], + "spans": [ + { + "bbox": [ + 134, + 621, + 480, + 665 + ], + "type": "text", + "content": "12. Dosovitskiy, A., Beyer, L., Kolesnikov, A., Weissenborn, D., Zhai, X., Unterthiner, T., Dehghani, M., Minderer, M., Heigold, G., Gelly, S., et al.: An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations (2020)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "15" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 14 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 665 + ], + "type": "list", + "angle": 0, + "index": 19, + "blocks": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 481, + 149 + ], + "type": "text", + "content": "13. Gao, C., Du, Y., Liu, J., Lv, J., Yang, L., Meng, D., Hauptmann, A.G.: Infar dataset: Infrared action recognition at different times. Neurocomputing 212, 36-47 (2016)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 183 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 183 + ], + "type": "text", + "content": "14. Gao, C., Meng, D., Yang, Y., Wang, Y., Zhou, X., Hauptmann, A.G.: Infrared patch-image model for small target detection in a single image. IEEE transactions on image processing 22(12), 4996-5009 (2013)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 133, + 183, + 481, + 215 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 183, + 481, + 215 + ], + "spans": [ + { + "bbox": [ + 133, + 183, + 481, + 215 + ], + "type": "text", + "content": "15. Gao, P., Ma, T., Li, H., Lin, Z., Dai, J., Qiao, Y.: Mcmae: Masked convolution meets masked autoencoders. Advances in Neural Information Processing Systems 35, 35632-35644 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 133, + 216, + 481, + 258 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 216, + 481, + 258 + ], + "spans": [ + { + "bbox": [ + 133, + 216, + 481, + 258 + ], + "type": "text", + "content": "16. Girdhar, R., El-Nouby, A., Liu, Z., Singh, M., Alwala, K.V., Joulin, A., Misra, I.: Imagebind one embedding space to bind them all. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023, Vancouver, BC, Canada, June 17-24, 2023. pp. 15180-15190. IEEE (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 133, + 259, + 481, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 259, + 481, + 293 + ], + "spans": [ + { + "bbox": [ + 133, + 259, + 481, + 293 + ], + "type": "text", + "content": "17. He, K., Chen, X., Xie, S., Li, Y., Dollar, P., Girshick, R.: Masked autoencoders are scalable vision learners. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 16000-16009 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 481, + 315 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 481, + 315 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 481, + 315 + ], + "type": "text", + "content": "18. He, K., Gkioxari, G., Dollar, P., Girshick, R.: Mask r-cnn. In: Proceedings of the IEEE international conference on computer vision. pp. 2961-2969 (2017)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 133, + 316, + 481, + 358 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 316, + 481, + 358 + ], + "spans": [ + { + "bbox": [ + 133, + 316, + 481, + 358 + ], + "type": "text", + "content": "19. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016. pp. 770-778. IEEE Computer Society (2016)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "spans": [ + { + "bbox": [ + 132, + 358, + 481, + 392 + ], + "type": "text", + "content": "20. He, Z., Cao, Y., Dong, Y., Yang, J., Cao, Y., Tisse, C.L.: Single-image-based nonuniformity correction of uncooled long-wave infrared detectors: A deep-learning approach. Applied optics 57(18), D155-D164 (2018)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 133, + 392, + 481, + 434 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 392, + 481, + 434 + ], + "spans": [ + { + "bbox": [ + 133, + 392, + 481, + 434 + ], + "type": "text", + "content": "21. Kakogeorgiou, I., Gidaris, S., Psomas, B., Avrithis, Y., Bursuc, A., Karantzalos, K., Komodakis, N.: What to hide from your students: Attention-guided masked image modeling. In: European Conference on Computer Vision. pp. 300-318. Springer (2022)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 133, + 435, + 481, + 468 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 435, + 481, + 468 + ], + "spans": [ + { + "bbox": [ + 133, + 435, + 481, + 468 + ], + "type": "text", + "content": "22. Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A.C., Lo, W., Dollár, P., Girshick, R.B.: Segment anything. CoRR abs/2304.02643 (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 133, + 468, + 481, + 501 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 468, + 481, + 501 + ], + "spans": [ + { + "bbox": [ + 133, + 468, + 481, + 501 + ], + "type": "text", + "content": "23. Kolesnikov, A., Beyer, L., Zhai, X., Puigcerver, J., Yung, J., Gelly, S., Houlsby, N.: Big transfer (bit): General visual representation learning. In: Proceedings of the European conference on computer vision (ECCV). pp. 491-507. Springer (2020)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 133, + 502, + 481, + 522 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 502, + 481, + 522 + ], + "spans": [ + { + "bbox": [ + 133, + 502, + 481, + 522 + ], + "type": "text", + "content": "24. Lab, A.S.: Thermal infrared dataset. https://projects.asl.ethz.ch/datasets/doku.php?id=ir:iricra2014" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 133, + 523, + 481, + 555 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 523, + 481, + 555 + ], + "spans": [ + { + "bbox": [ + 133, + 523, + 481, + 555 + ], + "type": "text", + "content": "25. Li, B., Xiao, C., Wang, L., Wang, Y., Lin, Z., Li, M., An, W., Guo, Y.: Dense nested attention network for infrared small target detection. IEEE Transactions on Image Processing 32, 1745-1758 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 133, + 555, + 481, + 588 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 555, + 481, + 588 + ], + "spans": [ + { + "bbox": [ + 133, + 555, + 481, + 588 + ], + "type": "text", + "content": "26. Li, G., Zheng, H., Liu, D., Wang, C., Su, B., Zheng, C.: Semmae: Semantic-guided masking for learning masked autoencoders. Advances in Neural Information Processing Systems 35, 14290-14302 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 133, + 589, + 481, + 621 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 589, + 481, + 621 + ], + "spans": [ + { + "bbox": [ + 133, + 589, + 481, + 621 + ], + "type": "text", + "content": "27. Li, X., Wang, W., Yang, L., Yang, J.: Uniform masking: Enabling mae pretraining for pyramid-based vision transformers with locality. arXiv preprint arXiv:2205.10063 (2022)" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 133, + 622, + 481, + 643 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 622, + 481, + 643 + ], + "spans": [ + { + "bbox": [ + 133, + 622, + 481, + 643 + ], + "type": "text", + "content": "28. Li, Y., Liu, H., Tian, Z., Geng, W.: Near-infrared vascular image segmentation using improved level set method. Infrared Physics & Technology 131, 104678 (2023)" + } + ] + } + ], + "index": 17 + }, + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "spans": [ + { + "bbox": [ + 133, + 644, + 481, + 665 + ], + "type": "text", + "content": "29. Li, Y., Xie, S., Chen, X., Dollar, P., He, K., Girshick, R.: Benchmarking detection transfer learning with vision transformers. arXiv preprint arXiv:2111.11429 (2021)" + } + ] + } + ], + "index": 18 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "16" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 15 + }, + { + "para_blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 666 + ], + "type": "list", + "angle": 0, + "index": 18, + "blocks": [ + { + "bbox": [ + 130, + 116, + 482, + 150 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 116, + 482, + 150 + ], + "spans": [ + { + "bbox": [ + 130, + 116, + 482, + 150 + ], + "type": "text", + "content": "30. Li, Z., Chen, Z., Yang, F., Li, W., Zhu, Y., Zhao, C., Deng, R., Wu, L., Zhao, R., Tang, M., et al.: Mst: Masked self-supervised transformer for visual representation. Advances in Neural Information Processing Systems 34, 13165-13176 (2021)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "spans": [ + { + "bbox": [ + 130, + 150, + 482, + 183 + ], + "type": "text", + "content": "31. Li, Z.Y., Gao, S., Cheng, M.M.: Sere: Exploring feature self-relation for self-supervised transformer. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(12), 15619-15631 (2023)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 130, + 184, + 482, + 217 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 184, + 482, + 217 + ], + "spans": [ + { + "bbox": [ + 130, + 184, + 482, + 217 + ], + "type": "text", + "content": "32. Lin, F., Ge, S., Bao, K., Yan, C., Zeng, D.: Learning shape-biased representations for infrared small target detection. IEEE Transactions on Multimedia pp. 1-12 (2023)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 130, + 218, + 482, + 251 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 218, + 482, + 251 + ], + "spans": [ + { + "bbox": [ + 130, + 218, + 482, + 251 + ], + "type": "text", + "content": "33. Liu, F., Gao, C., Chen, F., Meng, D., Zuo, W., Gao, X.: Infrared small and dim target detection with transformer under complex backgrounds. IEEE Transactions on Image Processing 32, 5921-5932 (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 130, + 251, + 482, + 296 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 251, + 482, + 296 + ], + "spans": [ + { + "bbox": [ + 130, + 251, + 482, + 296 + ], + "type": "text", + "content": "34. Liu, J., Fan, X., Huang, Z., Wu, G., Liu, R., Zhong, W., Luo, Z.: Target-aware dual adversarial learning and a multi-scenario multi-modality benchmark to fuse infrared and visible for object detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 5802-5811 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 130, + 296, + 482, + 329 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 296, + 482, + 329 + ], + "spans": [ + { + "bbox": [ + 130, + 296, + 482, + 329 + ], + "type": "text", + "content": "35. Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition. pp. 3431-3440 (2015)" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 130, + 329, + 482, + 373 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 329, + 482, + 373 + ], + "spans": [ + { + "bbox": [ + 130, + 329, + 482, + 373 + ], + "type": "text", + "content": "36. Loshchilov, I., Hutter, F.: Decoupled weight decay regularization. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net (2019), https://openreview.net/forum?id=Bkg6RiCqY7" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "spans": [ + { + "bbox": [ + 130, + 374, + 482, + 407 + ], + "type": "text", + "content": "37. Lüddecke, T., Ecker, A.S.: Image segmentation using text and image prompts. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA, June 18-24, 2022. pp. 7076-7086. IEEE (2022)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 130, + 407, + 482, + 452 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 407, + 482, + 452 + ], + "spans": [ + { + "bbox": [ + 130, + 407, + 482, + 452 + ], + "type": "text", + "content": "38. Madan, N., Ristea, N.C., Ionescu, R.T., Nasrollahi, K., Khan, F.S., Moeslund, T.B., Shah, M.: Self-supervised masked convolutional transformer block for anomaly detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 46(1), 525-542 (2024)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 130, + 452, + 363, + 464 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 452, + 363, + 464 + ], + "spans": [ + { + "bbox": [ + 130, + 452, + 363, + 464 + ], + "type": "text", + "content": "39. OpenAI: Gpt-4 technical report. PREPRINT (2023)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 130, + 464, + 482, + 486 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 464, + 482, + 486 + ], + "spans": [ + { + "bbox": [ + 130, + 464, + 482, + 486 + ], + "type": "text", + "content": "40. OTCBVS: Otcbvs benchmark dataset collection. https://vcipl-okstate.org/pbvs/bench/index.html" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 130, + 487, + 482, + 520 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 487, + 482, + 520 + ], + "spans": [ + { + "bbox": [ + 130, + 487, + 482, + 520 + ], + "type": "text", + "content": "41. Pan, H., Hong, Y., Sun, W., Jia, Y.: Deep dual-resolution networks for real-time and accurate semantic segmentation of traffic scenes. IEEE Transactions on Intelligent Transportation Systems 24(3), 3448-3460 (2022)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 130, + 520, + 482, + 564 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 520, + 482, + 564 + ], + "spans": [ + { + "bbox": [ + 130, + 520, + 482, + 564 + ], + "type": "text", + "content": "42. Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al.: Learning transferable visual models from natural language supervision. In: International conference on machine learning. pp. 8748-8763. PMLR (2021)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 130, + 564, + 482, + 609 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 564, + 482, + 609 + ], + "spans": [ + { + "bbox": [ + 130, + 564, + 482, + 609 + ], + "type": "text", + "content": "43. Reed, C.J., Gupta, R., Li, S., Brockman, S., Funk, C., Clipp, B., Keutzer, K., Candido, S., Uytendaele, M., Darrell, T.: Scale-mae: A scale-aware masked autoencoder for multiscale geospatial representation learning. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. pp. 4088-4099 (2023)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 130, + 609, + 482, + 632 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 609, + 482, + 632 + ], + "spans": [ + { + "bbox": [ + 130, + 609, + 482, + 632 + ], + "type": "text", + "content": "44. Reporter, T.M.: Infrared camera finds 6-year-old lost in deep woods. https://www.youtube.com/watch?v=-FajSFRlKIo" + } + ] + } + ], + "index": 16 + }, + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "spans": [ + { + "bbox": [ + 130, + 632, + 482, + 666 + ], + "type": "text", + "content": "45. Scheibenreif, L., Mommert, M., Borth, D.: Masked vision transformers for hyperspectral image classification. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 2165-2175 (2023)" + } + ] + } + ], + "index": 17 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "spans": [ + { + "bbox": [ + 218, + 91, + 447, + 102 + ], + "type": "text", + "content": "InfMAE: A Foundation Model in The Infrared Modality" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "spans": [ + { + "bbox": [ + 470, + 92, + 480, + 100 + ], + "type": "text", + "content": "17" + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 16 + }, + { + "para_blocks": [ + { + "bbox": [ + 132, + 116, + 481, + 611 + ], + "type": "list", + "angle": 0, + "index": 17, + "blocks": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "spans": [ + { + "bbox": [ + 133, + 116, + 480, + 149 + ], + "type": "text", + "content": "46. St-Charles, P.L., Bilodeau, G.A., Bergevin, R.: Mutual foreground segmentation with multispectral stereo pairs. In: Proceedings of the IEEE International Conference on Computer Vision Workshops. pp. 375-384 (2017)" + } + ] + } + ], + "index": 2 + }, + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "spans": [ + { + "bbox": [ + 133, + 150, + 481, + 194 + ], + "type": "text", + "content": "47. Sun, P., Zhang, R., Jiang, Y., Kong, T., Xu, C., Zhan, W., Tomizuka, M., Li, L., Yuan, Z., Wang, C., et al.: Sparse r-cnn: End-to-end object detection with learnable proposals. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. pp. 14454-14463 (2021)" + } + ] + } + ], + "index": 3 + }, + { + "bbox": [ + 132, + 194, + 480, + 225 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 194, + 480, + 225 + ], + "spans": [ + { + "bbox": [ + 132, + 194, + 480, + 225 + ], + "type": "text", + "content": "48. Tang, L., Yuan, J., Zhang, H., Jiang, X., Ma, J.: Piafusion: A progressive infrared and visible image fusion network based on illumination aware. Information Fusion 83-84, 79-92 (2022)" + } + ] + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 227, + 480, + 259 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 227, + 480, + 259 + ], + "spans": [ + { + "bbox": [ + 132, + 227, + 480, + 259 + ], + "type": "text", + "content": "49. Tian, Z., Liu, H., Li, Q.: Vu-net: A symmetric network-based method for near-infrared blood vessel image segmentation. In: International Conference on Man-Machine-Environment System Engineering. pp. 275–280. Springer (2023)" + } + ] + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "spans": [ + { + "bbox": [ + 132, + 259, + 480, + 293 + ], + "type": "text", + "content": "50. Tong, Z., Song, Y., Wang, J., Wang, L.: Videomae: Masked autoencoders are data-efficient learners for self-supervised video pre-training. Advances in neural information processing systems 35, 10078-10093 (2022)" + } + ] + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 293, + 468, + 304 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 293, + 468, + 304 + ], + "spans": [ + { + "bbox": [ + 132, + 293, + 468, + 304 + ], + "type": "text", + "content": "51. ultralytics: ultralytics, 2023. https://github.com/ultralytics/ultralytics" + } + ] + } + ], + "index": 7 + }, + { + "bbox": [ + 132, + 304, + 480, + 325 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 304, + 480, + 325 + ], + "spans": [ + { + "bbox": [ + 132, + 304, + 480, + 325 + ], + "type": "text", + "content": "52. Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems 30 (2017)" + } + ] + } + ], + "index": 8 + }, + { + "bbox": [ + 132, + 325, + 480, + 369 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 325, + 480, + 369 + ], + "spans": [ + { + "bbox": [ + 132, + 325, + 480, + 369 + ], + "type": "text", + "content": "53. Wang, L., Huang, B., Zhao, Z., Tong, Z., He, Y., Wang, Y., Wang, Y., Qiao, Y.: Videomae v2: Scaling video masked autoencoders with dual masking. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 14549-14560 (2023)" + } + ] + } + ], + "index": 9 + }, + { + "bbox": [ + 132, + 369, + 480, + 413 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 369, + 480, + 413 + ], + "spans": [ + { + "bbox": [ + 132, + 369, + 480, + 413 + ], + "type": "text", + "content": "54. Woo, S., Debnath, S., Hu, R., Chen, X., Liu, Z., Kweon, I.S., Xie, S.: Convnext v2: Co-designing and scaling convnets with masked autoencoders. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 16133-16142 (2023)" + } + ] + } + ], + "index": 10 + }, + { + "bbox": [ + 132, + 413, + 480, + 446 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 413, + 480, + 446 + ], + "spans": [ + { + "bbox": [ + 132, + 413, + 480, + 446 + ], + "type": "text", + "content": "55. Xiao, T., Liu, Y., Zhou, B., Jiang, Y., Sun, J.: Unified perceptual parsing for scene understanding. In: Proceedings of the European conference on computer vision (ECCV). pp. 418-434 (2018)" + } + ] + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 446, + 480, + 479 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 446, + 480, + 479 + ], + "spans": [ + { + "bbox": [ + 132, + 446, + 480, + 479 + ], + "type": "text", + "content": "56. Xu, Z., Zhuang, J., Liu, Q., Zhou, J., Peng, S.: Benchmarking a large-scale fir dataset for on-road pedestrian detection. Infrared Physics & Technology 96, 199-208 (2019)" + } + ] + } + ], + "index": 12 + }, + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "spans": [ + { + "bbox": [ + 132, + 479, + 480, + 512 + ], + "type": "text", + "content": "57. Yin, M., Yao, Z., Cao, Y., Li, X., Zhang, Z., Lin, S., Hu, H.: Disentangled non-local neural networks. In: Proceedings of the European conference on computer vision (ECCV). pp. 191-207. Springer (2020)" + } + ] + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 132, + 512, + 480, + 544 + ], + "type": "text", + "content": "58. Zhang, M., Zhang, R., Yang, Y., Bai, H., Zhang, J., Guo, J.: Isnet: Shape matters for infrared small target detection. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 877-886 (2022)" + } + ] + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "spans": [ + { + "bbox": [ + 132, + 545, + 480, + 578 + ], + "type": "text", + "content": "59. Zhang, R., Guo, Z., Gao, P., Fang, R., Zhao, B., Wang, D., Qiao, Y., Li, H.: Point-m2ae: multi-scale masked autoencoders for hierarchical point cloud pre-training. Advances in neural information processing systems 35, 27061-27074 (2022)" + } + ] + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 578, + 480, + 611 + ], + "type": "ref_text", + "angle": 0, + "lines": [ + { + "bbox": [ + 132, + 578, + 480, + 611 + ], + "spans": [ + { + "bbox": [ + 132, + 578, + 480, + 611 + ], + "type": "text", + "content": "60. Zhang, X., Demiris, Y.: Visible and infrared image fusion using deep learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 45(8), 10535-10554 (2023)" + } + ] + } + ], + "index": 16 + } + ], + "sub_type": "ref_text" + } + ], + "discarded_blocks": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "page_number", + "angle": 0, + "lines": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "spans": [ + { + "bbox": [ + 133, + 91, + 144, + 100 + ], + "type": "text", + "content": "18" + } + ] + } + ], + "index": 0 + }, + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "header", + "angle": 0, + "lines": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "spans": [ + { + "bbox": [ + 166, + 91, + 219, + 100 + ], + "type": "text", + "content": "F. Liu et al." + } + ] + } + ], + "index": 1 + } + ], + "page_size": [ + 612, + 792 + ], + "page_idx": 17 + } + ], + "_backend": "vlm", + "_version_name": "2.6.4" +} \ No newline at end of file